20{
23
25
27 printf("\n%d tracks are in the list\n",ntr);
28
30 int ntrgood = 0;
31 for(int i=0; i<ntr; i++)
32 {
34 if (tra->
Flag() >= 0) ntrgood++;
35 }
36 printf("\n%d good tracks are in the list\n",ntrgood);
37
39 {
40 for(int i=0; i<ntr; i++)
41 {
43 if (tra->
Flag() < 0)
continue;
47 }
49 }
50
52
54 {
56 ntrgood = 0;
57 for(int i=0; i<ntr; i++)
58 {
60 if (tra->
Flag() >= 0) ntrgood++;
61 }
62 printf("\n%d good tracks are in the list after additional propagation\n",
63 ntrgood);
64 }
65
66
68 ntrgood = 0;
69 int nseg = 0;
71 for(int i=0; i<ntr; i++)
72 {
74 if (!tra) continue;
75 if (tra->
Flag() != -10)
76 {
77 if (tra->
N() < 10)
continue;
78
79
80
81
82
83
84 ntrgood++;
86 for (int j=0; j<nseg; j++)
87 {
89 if (!seg) continue;
90
91 }
92 }
93 }
94 printf("%d good tracks was found\n",ntrgood);
95
102
105
107
109
111
113 printf("%d 2-track vertexes was found\n",nvtx);
114
115 if(nvtx != 0) {
116
118 printf("%d vertexes with number of tracks >2 was found\n",nadd);
119 printf("----------------------------------------------\n");
120
123 int ntv = 0;
124 for(int i=0; i<nvtx; i++)
125 {
127 if (!v) continue;
128 if (v->
Flag() < 0)
continue;
130
131
132
134
135
136
137
138
139
140 for(int j=0; j<ntv; j++)
141 {
143 if (!tra) continue;
144
145
147 for (int k=0; k<nseg; k++)
148 {
150 if (!seg) continue;
151
152 }
153 }
154 }
155 }
156}
emulsion data processing
Definition: EdbDataSet.h:181
int InitVolume(int datatype=0, const char *rcut="1")
Definition: EdbDataSet.cxx:2066
EdbPVRec * PVR() const
Definition: EdbDataSet.h:198
TObjArray * eVTX
array of vertex
Definition: EdbPVRec.h:162
TObjArray * eTracks
Definition: EdbPVRec.h:161
void FillCell(float stepx, float stepy, float steptx, float stepty)
Definition: EdbPVRec.cxx:1092
int PropagateTracks(int nplmax, int nplmin, float probMin=0.05, int ngapMax=3, int design=0)
Definition: EdbPVRec.cxx:2487
void FitTracks(float p=10., float mass=0.139, TObjArray *gener=0, int design=0)
Definition: EdbPVRec.cxx:1893
void SetErrorP(float sp2)
Definition: EdbSegP.h:94
Int_t Flag() const
Definition: EdbSegP.h:149
Definition: EdbPattern.h:113
Int_t N() const
Definition: EdbPattern.h:177
EdbSegP * GetSegment(int i) const
Definition: EdbPattern.h:195
EdbSegP * GetSegmentLast() const
Definition: EdbPattern.h:190
EdbSegP * GetSegmentFirst() const
Definition: EdbPattern.h:189
Int_t eQualityMode
vertex quality estimation method (0:=Prob/(sigVX^2+sigVY^2); 1:= inverse average track-vertex distanc...
Definition: EdbVertex.h:183
Bool_t eUseSegPar
use only the nearest measured segments for vertex fit (as Neuchatel)
Definition: EdbVertex.h:182
Float_t eImpMax
maximal acceptable impact parameter (preliminary check)
Definition: EdbVertex.h:179
Float_t eDZmax
maximum z-gap in the track-vertex group
Definition: EdbVertex.h:177
Float_t eProbMin
minimum acceptable probability for chi2-distance between tracks
Definition: EdbVertex.h:178
Definition: EdbVertex.h:194
Int_t ProbVertexN()
Definition: EdbVertex.cxx:1426
TObjArray * eVTX
array of vertex
Definition: EdbVertex.h:205
Int_t FindVertex()
Definition: EdbVertex.cxx:1065
EdbPVRec * ePVR
patterns volume (optional)
Definition: EdbVertex.h:206
TObjArray * eEdbTracks
Definition: EdbVertex.h:204
Definition: EdbVertex.h:69
VERTEX::Vertex * V() const
Definition: EdbVertex.h:154
Int_t N() const
Definition: EdbVertex.h:121
EdbTrackP * GetTrack(int i)
Definition: EdbVertex.h:141
Int_t Flag() const
Definition: EdbVertex.h:124
Definition: VtVertex.hh:88
bool ReFit
Definition: tr_simple.C:12
float momentum
Definition: tr_simple.C:9
float ProbMinV
Definition: tr_simple.C:7
bool UseSegPar
Definition: tr_simple.C:11
EdbDataProc * dproc
Definition: tr_simple.C:3
float dpp
Definition: tr_simple.C:10
bool ReProp
Definition: tr_simple.C:14
float ProbMinP
Definition: tr_simple.C:8
EdbVertexRec * gEVR
Definition: tr_simple.C:5
EdbPVRec * gAli
Definition: tr_simple.C:4