19 _ana_tree =
new TTree(
"ana_tree",
"ana_tree");
42 const std::vector<const cluster::ClusterParamsAlg*>& clusters)
57 double min_OA = 99999.;
58 double max_OA = -99999.;
59 double min_OA_wt = 99999.;
60 double max_OA_wt = -99999.;
61 for (
auto const& c : clusters) {
63 double this_OA = c->GetParams().opening_angle;
64 if (this_OA > max_OA) max_OA = this_OA;
65 if (this_OA < min_OA) min_OA = this_OA;
66 double this_OA_wt = c->GetParams().opening_angle_charge_wgt;
67 if (this_OA_wt > max_OA) max_OA_wt = this_OA_wt;
68 if (this_OA_wt < min_OA) min_OA_wt = this_OA_wt;
69 double this_trackness = c->GetParams().trackness;
71 double this_L_over_W = c->GetParams().length / c->GetParams().width;
73 double this_OA_over_L = this_OA / c->GetParams().length;
75 double this_poly_perim_over_A =
76 c->GetParams().PolyObject.Perimeter() / c->GetParams().PolyObject.Area();
79 double this_modhitdens = c->GetParams().modified_hit_density;
84 _o_ang_rms = pow((pow(min_OA, 2) + pow(max_OA, 2)) / 2, 0.5);
86 _o_ang_wt_rms = pow((pow(min_OA_wt, 2) + pow(max_OA_wt, 2)) / 2, 0.5);
90 bool accept_match =
true;
96 return accept_match ? 1 : -1;
108 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.
BEGIN_PROLOG could also be cout