33 TFile *
f =
new TFile(
file);
47 for(
int i=0; i<ntr; i++)
60 if (
hp[10])
hp[10]->Fill(ntr);
66 for(
int i=0; i<ntr; i++)
69 if (
tr->Flag() != -10)
72 if (
hp[11])
hp[11]->Fill(
tr->N());
74 if (
hp[12])
hp[12]->Fill(
tr->GetSegment(0)->X()-
tr->GetSegmentF(0)->X());
76 if (
hp[17])
hp[17]->Fill(
tr->Prob());
79 ang = TMath::ACos(1./(1.+tx*tx+ty*ty))*1000.;
81 if (
hp[20])
hp[20]->Fill(ang);
83 if (
hp[21])
hp[21]->Fill(
tr->P());
88 printf(
"%d 2-track vertexes was found\n",nvtx);
93 printf(
"%d vertexes with number of tracks >2 was found\n",nadd);
102 for(
int i=0; i<nv; i++)
105 if (v->
Flag() != -10)
110 if (v->
N() > 2) v->
Print();
114 if (
hp[9])
hp[9]->Fill(nvg);
119 int nlv =
gAli->LinkedVertexes();
120 printf(
"%d linked vertexes found\n", nlv);
123 for(
int i=0; i<nv; i++)
129 if (vc->
ID() > v->
ID())
139 int nn =
gAli->VertexNeighboor(1000., 2);
140 printf(
"%d neighbooring tracks found\n", nn);
int maxgaps[6]
Definition: RecDispEX.C:14
bool usemom
Definition: RecDispEX.C:20
float ProbMinV
Definition: RecDispEX.C:16
float AngleAcceptance
Definition: RecDispEX.C:15
float ProbMinT
Definition: RecDispEX.C:18
int nsegMin
Definition: RecDispEX.C:19
float ProbMinP
Definition: RecDispEX.C:17
int MakeTracks(int nsegments=2, int flag=0)
Definition: EdbPVRec.cxx:1985
void FillTracksCell()
Definition: EdbPVRec.cxx:1315
void FillCell(float stepx, float stepy, float steptx, float stepty)
Definition: EdbPVRec.cxx:1088
int Link()
Definition: EdbPVRec.cxx:1183
int PropagateTracks(int nplmax, int nplmin, float probMin=0.05, int ngapMax=3, int design=0)
Definition: EdbPVRec.cxx:2483
void FitTracks(float p=10., float mass=0.139, TObjArray *gener=0, int design=0)
Definition: EdbPVRec.cxx:1889