17 _ana_tree =
new TTree(
"ana_tree",
"ana_tree");
40 const std::vector<const cluster::ClusterParamsAlg*>& clusters)
55 double min_OA = 99999.;
56 double max_OA = -99999.;
57 double min_OA_wt = 99999.;
58 double max_OA_wt = -99999.;
59 for (
auto const&
c : clusters) {
61 double this_OA =
c->GetParams().opening_angle;
62 if (this_OA > max_OA) max_OA = this_OA;
63 if (this_OA < min_OA) min_OA = this_OA;
64 double this_OA_wt =
c->GetParams().opening_angle_charge_wgt;
65 if (this_OA_wt > max_OA) max_OA_wt = this_OA_wt;
66 if (this_OA_wt < min_OA) min_OA_wt = this_OA_wt;
67 double this_trackness =
c->GetParams().trackness;
69 double this_L_over_W =
c->GetParams().length /
c->GetParams().width;
71 double this_OA_over_L = this_OA /
c->GetParams().length;
73 double this_poly_perim_over_A =
74 c->GetParams().PolyObject.Perimeter() /
c->GetParams().PolyObject.Area();
77 double this_modhitdens =
c->GetParams().modified_hit_density;
88 bool accept_match =
true;
94 return accept_match ? 1 : -1;
106 std::cout <<
" This cluster's info is as follows:" <<
std::endl;
This algo only matches clusters if they are not track-like. This is implemented in an algo because it...
const cluster_params & GetParams() const
double opening_angle
Width of angular distubtion wrt vertx.
QTextStream & endl(QTextStream &s)