]>
Commit | Line | Data |
---|---|---|
1 | #ifndef ALITPCTRACKERMI_H | |
2 | #define ALITPCTRACKERMI_H | |
3 | /* Copyright(c) 1998-1999, ALICE Experiment at CERN, All rights reserved. * | |
4 | * See cxx source for full Copyright notice */ | |
5 | ||
6 | ||
7 | /* $Id$ */ | |
8 | ||
9 | //------------------------------------------------------- | |
10 | // TPC tracker | |
11 | // Parallel tracker | |
12 | // | |
13 | // Origin: | |
14 | //------------------------------------------------------- | |
15 | #include "AliTracker.h" | |
16 | #include "AliTPCtrack.h" | |
17 | #include "AliComplexCluster.h" | |
18 | ||
19 | class TFile; | |
20 | class AliTPCParam; | |
21 | class AliTPCseed; | |
22 | class AliTPCclusterMI; | |
23 | class AliTPCTrackerPoint; | |
24 | class AliESD; | |
25 | class TTree; | |
26 | ||
27 | class AliTPCseed : public AliTPCtrack { | |
28 | friend class AliTPCtrackerMI; | |
29 | public: | |
30 | AliTPCseed(); | |
31 | virtual ~AliTPCseed(); | |
32 | AliTPCseed(const AliTPCtrack &t); | |
33 | AliTPCseed(const AliKalmanTrack &t, Double_t a); | |
34 | Int_t Compare(const TObject *o) const; | |
35 | void Reset(Bool_t all = kTRUE); | |
36 | Int_t GetProlongation(Double_t xr, Double_t &y, Double_t & z) const; | |
37 | virtual Double_t GetPredictedChi2(const AliTPCclusterMI *cluster) const; | |
38 | virtual Int_t Update(const AliTPCclusterMI* c, Double_t chi2, UInt_t i); | |
39 | AliTPCTrackerPoint * GetTrackPoint(Int_t i); | |
40 | void RebuildSeed(); // rebuild seed to be ready for storing | |
41 | AliTPCseed(UInt_t index, const Double_t xx[5], | |
42 | const Double_t cc[15], Double_t xr, Double_t alpha); | |
43 | ||
44 | Double_t GetDensityFirst(Int_t n); | |
45 | Double_t GetSigma2C() const {return fC44;}; | |
46 | void GetClusterStatistic(Int_t first, Int_t last, Int_t &found, Int_t &foundable, Int_t &shared, Bool_t plus2); | |
47 | ||
48 | void Modify(Double_t factor); | |
49 | void SetClusterIndex2(Int_t row, Int_t index) { | |
50 | fIndex[row] = index; | |
51 | } | |
52 | Int_t GetClusterIndex2(Int_t row) const { | |
53 | return fIndex[row]; | |
54 | } | |
55 | Int_t GetClusterSector(Int_t row) const { | |
56 | Int_t pica = -1; | |
57 | if (fIndex[row]>=0) pica = ((fIndex[row]&0xff000000)>>24); | |
58 | return pica; | |
59 | } | |
60 | ||
61 | void SetErrorY2(Float_t sy2){fErrorY2=sy2;} | |
62 | void SetErrorZ2(Float_t sz2){fErrorZ2=sz2;} | |
63 | void CookdEdx(Double_t low=0.05, Double_t up=0.70, Int_t i1=0, Int_t i2=159, Bool_t onlyused = kFALSE); | |
64 | // void CookdEdx2(Double_t low=0.05, Double_t up=0.70); | |
65 | Bool_t IsActive() const { return !(fRemoval);} | |
66 | void Desactivate(Int_t reason){ fRemoval = reason;} | |
67 | // | |
68 | // | |
69 | private: | |
70 | AliESDtrack * fEsd; //! | |
71 | AliTPCclusterMI* fClusterPointer[160]; //! array of cluster pointers - | |
72 | TClonesArray * fPoints; // array with points along the track | |
73 | TClonesArray * fEPoints; // array with exact points - calculated in special macro not used in tracking | |
74 | //---CURRENT VALUES | |
75 | Int_t fRow; //!current row number | |
76 | Int_t fSector; //!current sector number | |
77 | Int_t fRelativeSector; //! index of current relative sector | |
78 | Float_t fCurrentSigmaY2; //!expected current cluster sigma Y | |
79 | Float_t fCurrentSigmaZ2; //!expected current cluster sigma Z | |
80 | Float_t fErrorY2; //!sigma of current cluster | |
81 | Float_t fErrorZ2; //!sigma of current cluster | |
82 | AliTPCclusterMI * fCurrentCluster; //!pointer to the current cluster for prolongation | |
83 | Int_t fCurrentClusterIndex1; //! index of the current cluster | |
84 | Bool_t fInDead; //! indicate if the track is in dead zone | |
85 | Bool_t fIsSeeding; //!indicates if it is proces of seeading | |
86 | Int_t fNoCluster; //!indicates number of rows without clusters | |
87 | Int_t fSort; //!indicate criteria for sorting | |
88 | Bool_t fBSigned; //indicates that clusters of this trackes are signed to be used | |
89 | // | |
90 | // | |
91 | Float_t fDEDX[4]; // dedx according padrows | |
92 | Float_t fSDEDX[4]; // sdedx according padrows | |
93 | Int_t fNCDEDX[4]; // number of clusters for dedx measurment | |
94 | // | |
95 | Int_t fSeedType; //seeding type | |
96 | Int_t fSeed1; //first row for seeding | |
97 | Int_t fSeed2; //last row for seeding | |
98 | Int_t fOverlapLabels[12]; //track labels and the length of the overlap | |
99 | Float_t fMAngular; // mean angular factor | |
100 | AliTPCTrackerPoint fTrackPoints[160]; //!track points - array track points | |
101 | ||
102 | ClassDef(AliTPCseed,1) | |
103 | }; | |
104 | ||
105 | ||
106 | ||
107 | ||
108 | class AliTPCtrackerMI : public AliTracker { | |
109 | public: | |
110 | AliTPCtrackerMI():AliTracker(),fkNIS(0),fkNOS(0) { | |
111 | fInnerSec=fOuterSec=0; fSeeds=0; | |
112 | } | |
113 | AliTPCtrackerMI(const AliTPCParam *par); | |
114 | virtual ~AliTPCtrackerMI(); | |
115 | // | |
116 | void SetIteration(Int_t iteration){fIteration = iteration;} | |
117 | virtual Int_t Clusters2Tracks (AliESD *esd); | |
118 | virtual Int_t RefitInward (AliESD *esd); | |
119 | virtual Int_t LoadClusters (TTree * tree); | |
120 | Int_t LoadClusters(); | |
121 | void UnloadClusters(); | |
122 | ||
123 | // | |
124 | void SetIO(); //set default IO from folders | |
125 | void SetIO(TTree * input, TTree * output, AliESD * event); | |
126 | void FillESD(TObjArray* arr); | |
127 | void WriteTracks(); | |
128 | void WriteTracks(TTree * tree); | |
129 | void DeleteSeeds(); | |
130 | void SetDebug(Int_t debug){ fDebug = debug;} | |
131 | Int_t ReadSeeds(const TFile *in); | |
132 | TObjArray * GetSeeds(){return fSeeds;} | |
133 | // | |
134 | AliCluster * GetCluster (int) const {return 0;} | |
135 | AliTPCclusterMI *GetClusterMI(Int_t index) const; | |
136 | Int_t Clusters2Tracks(const TFile */*in*/, TFile */*out*/){return 0;} | |
137 | Int_t Clusters2Tracks(); | |
138 | virtual void CookLabel(AliTPCseed *t,Float_t wrong) const; | |
139 | ||
140 | void RotateToLocal(AliTPCseed *seed); | |
141 | ||
142 | ||
143 | Int_t FollowProlongation(AliTPCseed& t, Int_t rf=0, Int_t step=1); | |
144 | Int_t FollowProlongationFast(AliTPCseed& t, Int_t rf=0, Int_t step=1); | |
145 | ||
146 | Int_t FollowBackProlongation(AliTPCseed& t, Int_t rf); | |
147 | Int_t FollowToNext(AliTPCseed& t, Int_t nr); | |
148 | Int_t FollowToNextFast(AliTPCseed& t, Int_t nr); | |
149 | Int_t UpdateClusters(AliTPCseed& t, Int_t nr); | |
150 | Int_t FollowToNextCluster( AliTPCseed& t, Int_t nr); | |
151 | ||
152 | virtual Int_t PropagateBack (const TFile *, TFile *){return 0;} | |
153 | Int_t PropagateBack(TObjArray * arr); | |
154 | Int_t PropagateBack(AliESD * event); | |
155 | Int_t PropagateBack(AliTPCseed *pt, Int_t row0, Int_t row1); | |
156 | Int_t PropagateForward(); | |
157 | Int_t PropagateForward2(TObjArray * arr); | |
158 | ||
159 | Int_t CheckKinkPoint(AliTPCseed*seed, Float_t th); | |
160 | void SortTracks(TObjArray * arr, Int_t mode) const; | |
161 | ||
162 | ||
163 | virtual Double_t ErrY2(AliTPCseed* seed, AliTPCclusterMI * cl = 0); | |
164 | virtual Double_t ErrZ2(AliTPCseed* seed, AliTPCclusterMI * cl = 0); | |
165 | ||
166 | Double_t F1(Double_t x1,Double_t y1, Double_t x2,Double_t y2, Double_t x3,Double_t y3); | |
167 | Double_t F1old(Double_t x1,Double_t y1, Double_t x2,Double_t y2, Double_t x3,Double_t y3); | |
168 | Double_t F2(Double_t x1,Double_t y1, Double_t x2,Double_t y2, Double_t x3,Double_t y3); | |
169 | Double_t F2old(Double_t x1,Double_t y1, Double_t x2,Double_t y2, Double_t x3,Double_t y3); | |
170 | ||
171 | Double_t F3(Double_t x1,Double_t y1, Double_t x2,Double_t y2, Double_t z1,Double_t z2); | |
172 | Double_t F3n(Double_t x1,Double_t y1, Double_t x2,Double_t y2, Double_t z1,Double_t z2, | |
173 | Double_t c); | |
174 | Bool_t GetProlongation(Double_t x1, Double_t x2, Double_t x[5], Double_t &y, Double_t &z); | |
175 | ||
176 | public: | |
177 | //**************** Internal tracker class ********************** | |
178 | class AliTPCSector; | |
179 | class AliTPCRow { | |
180 | friend class AliTPCtrackerMI; | |
181 | friend class AliTPCtrackerMI::AliTPCSector; | |
182 | public: | |
183 | AliTPCRow(); | |
184 | ~AliTPCRow(); | |
185 | void InsertCluster(const AliTPCclusterMI *c, UInt_t index); | |
186 | operator int() const {return fN;} | |
187 | Int_t GetN() const {return fN;} | |
188 | const AliTPCclusterMI* operator[](Int_t i) const {return fClusters[i];} | |
189 | UInt_t GetIndex(Int_t i) const {return fIndex[i];} | |
190 | inline Int_t Find(Double_t z) const; | |
191 | AliTPCclusterMI * FindNearest(Double_t y, Double_t z, Double_t roady, Double_t roadz) const; | |
192 | AliTPCclusterMI * FindNearest2(Double_t y, Double_t z, Double_t roady, Double_t roadz, UInt_t & index) const; | |
193 | AliTPCclusterMI * FindNearest3(Double_t y, Double_t z, Double_t roady, Double_t roadz, UInt_t & index) const; | |
194 | ||
195 | void SetX(Double_t x) {fX=x;} | |
196 | Double_t GetX() const {return fX;} | |
197 | private: | |
198 | Float_t fDeadZone; // the width of the dead zone | |
199 | AliTPCclusterMI *fClusters1; //array with clusters 1 | |
200 | Int_t fN1; //number of clusters on left side | |
201 | AliTPCclusterMI *fClusters2; //array with clusters 2 | |
202 | Int_t fN2; // number of clusters on right side of the TPC | |
203 | Short_t fFastCluster[510]; //index of the nearest cluster at given position | |
204 | Int_t fN; //number of clusters | |
205 | const AliTPCclusterMI *fClusters[kMaxClusterPerRow]; //pointers to clusters | |
206 | // indexes for cluster at given position z | |
207 | // AliTPCclusterMI *fClustersArray; // | |
208 | UInt_t fIndex[kMaxClusterPerRow]; //indeces of clusters | |
209 | Double_t fX; //X-coordinate of this row | |
210 | //private: | |
211 | AliTPCRow(const AliTPCRow& r); //dummy copy constructor | |
212 | AliTPCRow &operator=(const AliTPCRow& r); //dummy assignment operator | |
213 | }; | |
214 | ||
215 | //**************** Internal tracker class ********************** | |
216 | class AliTPCSector { | |
217 | friend class AliTPCtrackerMI; | |
218 | public: | |
219 | AliTPCSector() { fN=0; fRow = 0; } | |
220 | ~AliTPCSector() { delete[] fRow; } | |
221 | AliTPCRow& operator[](Int_t i) const { return *(fRow+i); } | |
222 | Int_t GetNRows() const { return fN; } | |
223 | void Setup(const AliTPCParam *par, Int_t flag); | |
224 | Double_t GetX(Int_t l) const {return fRow[l].GetX();} | |
225 | Double_t GetMaxY(Int_t l) const { | |
226 | return GetX(l)*TMath::Tan(0.5*GetAlpha()); | |
227 | } | |
228 | Double_t GetAlpha() const {return fAlpha;} | |
229 | Double_t GetAlphaShift() const {return fAlphaShift;} | |
230 | //Int_t GetFirst(){return fFirstRow;} | |
231 | Int_t GetRowNumber(Double_t x) const; | |
232 | Double_t GetPadPitchWidth() const {return fPadPitchWidth;} | |
233 | Double_t GetPadPitchLength() const {return fPadPitchLength;} | |
234 | Double_t GetPadPitchLength(Float_t x) const {return (x<200) ? fPadPitchLength:f2PadPitchLength ;} | |
235 | ||
236 | private: | |
237 | Int_t fN; //number of pad rows | |
238 | //Int_t fFirstRow; //offset | |
239 | AliTPCRow *fRow; //array of pad rows | |
240 | Double_t fAlpha; //opening angle | |
241 | Double_t fAlphaShift; //shift angle; | |
242 | Double_t fPadPitchWidth; //pad pitch width | |
243 | Double_t fPadPitchLength; //pad pitch length | |
244 | Double_t f1PadPitchLength; //pad pitch length | |
245 | Double_t f2PadPitchLength; //pad pitch length | |
246 | ||
247 | private: | |
248 | AliTPCSector(const AliTPCSector &s); //dummy copy contructor | |
249 | AliTPCSector& operator=(const AliTPCSector &s);//dummy assignment operator | |
250 | }; | |
251 | ||
252 | Float_t OverlapFactor(AliTPCseed * s1, AliTPCseed * s2, Int_t &sum1, Int_t &sum2); | |
253 | void SignShared(AliTPCseed * s1, AliTPCseed * s2); | |
254 | void SignShared(TObjArray * arr); | |
255 | ||
256 | void RemoveUsed(TObjArray * arr, Float_t factor1, Float_t factor2, Int_t removalindex); | |
257 | void RemoveDouble(TObjArray * arr, Float_t factor1, Float_t factor2, Int_t removalindex); | |
258 | ||
259 | void StopNotActive(TObjArray * arr, Int_t row0, Float_t th0, Float_t th1, Float_t th2) const; | |
260 | void StopNotActive(AliTPCseed * seed, Int_t row0, Float_t th0, Float_t th1, Float_t th2) const; | |
261 | Int_t AcceptCluster(AliTPCseed * seed, AliTPCclusterMI * cluster, Float_t factor, Float_t cory=1., Float_t corz=1.); | |
262 | ||
263 | private: | |
264 | inline AliTPCRow &GetRow(Int_t sec, Int_t row); | |
265 | inline Double_t GetXrow(Int_t row) const; | |
266 | inline Double_t GetMaxY(Int_t row) const; | |
267 | inline Int_t GetRowNumber(Double_t x) const; | |
268 | inline Double_t GetPadPitchLength(Double_t x) const; | |
269 | inline Double_t GetPadPitchLength(Int_t row) const; | |
270 | ||
271 | Float_t GetSigmaY(AliTPCseed * seed); | |
272 | Float_t GetSigmaZ(AliTPCseed * seed); | |
273 | void GetShape(AliTPCseed * seed, Int_t row); | |
274 | ||
275 | void ReadSeeds(AliESD *event, Int_t direction); //read seeds from the event | |
276 | ||
277 | void MakeSeeds3(TObjArray * arr, Int_t sec, Int_t i1, Int_t i2, Float_t cuts[4], Float_t deltay = -1, Int_t ddsec=0); | |
278 | void MakeSeeds5(TObjArray * arr, Int_t sec, Int_t i1, Int_t i2, Float_t cuts[4], Float_t deltay = -1); | |
279 | ||
280 | void MakeSeeds2(TObjArray * arr, Int_t sec, Int_t i1, Int_t i2, Float_t cuts[4], Float_t deltay = -1, Bool_t bconstrain=kTRUE); | |
281 | ||
282 | ||
283 | AliTPCseed *MakeSeed(AliTPCseed *t, Float_t r0, Float_t r1, Float_t r2); //reseed | |
284 | AliTPCseed *ReSeed(AliTPCseed *t, Float_t r0, Float_t r1, Float_t r2); //reseed | |
285 | ||
286 | ||
287 | ||
288 | AliTPCseed * ReSeed(AliTPCseed *t); | |
289 | Int_t LoadInnerSectors(); | |
290 | Int_t LoadOuterSectors(); | |
291 | void UnsignClusters(); | |
292 | void SignClusters(TObjArray * arr, Float_t fnumber=3., Float_t fdensity=2.); | |
293 | ||
294 | void ParallelTracking(TObjArray * arr, Int_t rfirst, Int_t rlast); | |
295 | void Tracking(TObjArray * arr); | |
296 | TObjArray * Tracking(Int_t seedtype, Int_t i1, Int_t i2, Float_t cuts[4], Float_t dy=-1, Int_t dsec=0); | |
297 | TObjArray * Tracking(); | |
298 | void SumTracks(TObjArray *arr1,TObjArray *arr2) const; | |
299 | void PrepareForBackProlongation(TObjArray * arr, Float_t fac) const; | |
300 | void PrepareForProlongation(TObjArray * arr, Float_t fac) const; | |
301 | ||
302 | void SetSampledEdx(AliTPCseed *t, Float_t q, Int_t i) {;} | |
303 | Int_t UpdateTrack(AliTPCseed *t, Int_t accept); //update trackinfo | |
304 | ||
305 | ||
306 | AliTPCtrackerMI(const AliTPCtrackerMI& r); //dummy copy constructor | |
307 | AliTPCtrackerMI &operator=(const AliTPCtrackerMI& r);//dummy assignment operator | |
308 | ||
309 | const Int_t fkNIS; //number of inner sectors | |
310 | AliTPCSector *fInnerSec; //array of inner sectors; | |
311 | const Int_t fkNOS; //number of outer sectors | |
312 | AliTPCSector *fOuterSec; //array of outer sectors; | |
313 | ||
314 | Int_t fN; //number of loaded sectors | |
315 | AliTPCSector *fSectors; //pointer to loaded sectors; | |
316 | // | |
317 | TTree * fInput; // input tree with clusters | |
318 | TTree * fOutput; // output tree with tracks | |
319 | TTree * fSeedTree; // output tree with seeds - filled in debug mode 1 | |
320 | TTree * fTreeDebug; // output with a debug information about track | |
321 | AliESD * fEvent; // output with esd tracks | |
322 | Int_t fDebug; // debug option | |
323 | Bool_t fNewIO; // indicated if we have data using New IO | |
324 | Int_t fNtracks; //current number of tracks | |
325 | TObjArray *fSeeds; //array of track seeds | |
326 | Int_t fIteration; // indicate iteration - 0 - froward -1 back - 2forward - back->forward | |
327 | // TObjArray * fTrackPointPool; // ! pool with track points | |
328 | // TObjArray * fSeedPool; //! pool with seeds | |
329 | Double_t fXRow[200]; // radius of the pad row | |
330 | Double_t fYMax[200]; // max y for given pad row | |
331 | Double_t fPadLength[200]; // max y for given pad row | |
332 | const AliTPCParam *fParam; //pointer to the parameters | |
333 | ClassDef(AliTPCtrackerMI,1) | |
334 | }; | |
335 | ||
336 | ||
337 | AliTPCtrackerMI::AliTPCRow & AliTPCtrackerMI::GetRow(Int_t sec, Int_t row) | |
338 | { | |
339 | // | |
340 | return (row>=fInnerSec->GetNRows()) ? fOuterSec[sec][row-fInnerSec->GetNRows()]:fInnerSec[sec][row]; | |
341 | } | |
342 | ||
343 | Double_t AliTPCtrackerMI::GetXrow(Int_t row) const { | |
344 | // return (row>=fInnerSec->GetNRows()) ? fOuterSec->GetX(row-fInnerSec->GetNRows()):fInnerSec->GetX(row); | |
345 | return fXRow[row]; | |
346 | } | |
347 | ||
348 | Double_t AliTPCtrackerMI::GetMaxY(Int_t row) const { | |
349 | //return (row>=fInnerSec->GetNRows()) ? fOuterSec->GetMaxY(row-fInnerSec->GetNRows()):fInnerSec->GetMaxY(row); | |
350 | return fYMax[row]; | |
351 | } | |
352 | ||
353 | Int_t AliTPCtrackerMI::GetRowNumber(Double_t x) const | |
354 | { | |
355 | // | |
356 | return (x>133.) ? fOuterSec->GetRowNumber(x)+fInnerSec->GetNRows():fInnerSec->GetRowNumber(x); | |
357 | } | |
358 | ||
359 | Double_t AliTPCtrackerMI::GetPadPitchLength(Double_t x) const | |
360 | { | |
361 | // | |
362 | return (x>133.) ? fOuterSec->GetPadPitchLength(x):fInnerSec->GetPadPitchLength(x); | |
363 | //return fPadLength[row]; | |
364 | } | |
365 | ||
366 | Double_t AliTPCtrackerMI::GetPadPitchLength(Int_t row) const | |
367 | { | |
368 | // | |
369 | return fPadLength[row]; | |
370 | } | |
371 | ||
372 | ||
373 | ||
374 | #endif | |
375 | ||
376 |