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