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 */
9 //-------------------------------------------------------
13 //-------------------------------------------------------
14 #include "AliTracker.h"
15 #include "AliTPCtrack.h"
16 #include "AliComplexCluster.h"
21 class AliTPCclusterMI;
22 class AliTPCTrackerPoint;
27 class AliTPCseed : public AliTPCtrack {
28 friend class AliTPCtrackerMI;
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);
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);
48 void Modify(Double_t factor);
49 void SetClusterIndex2(Int_t row, Int_t index) {
52 Int_t GetClusterIndex2(Int_t row) const {
55 Int_t GetClusterSector(Int_t row) const {
57 if (fIndex[row]>=0) pica = ((fIndex[row]&0xff000000)>>24);
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;}
70 AliTPCclusterMI* fClusterPointer[160]; //! array of cluster pointers -
71 TClonesArray * fPoints; // array with points along the track
72 TClonesArray * fEPoints; // array with exact points - calculated in special macro not used in tracking
74 Int_t fRow; //!current row number
75 Int_t fSector; //!current sector number
76 Int_t fRelativeSector; //! index of current relative sector
77 Float_t fCurrentSigmaY2; //!expected current cluster sigma Y
78 Float_t fCurrentSigmaZ2; //!expected current cluster sigma Z
79 Float_t fErrorY2; //!sigma of current cluster
80 Float_t fErrorZ2; //!sigma of current cluster
81 AliTPCclusterMI * fCurrentCluster; //!pointer to the current cluster for prolongation
82 Int_t fCurrentClusterIndex1; //! index of the current cluster
83 Bool_t fInDead; //! indicate if the track is in dead zone
84 Bool_t fIsSeeding; //!indicates if it is proces of seeading
85 Int_t fNoCluster; //!indicates number of rows without clusters
86 Int_t fSort; //!indicate criteria for sorting
87 Bool_t fBSigned; //indicates that clusters of this trackes are signed to be used
90 Float_t fDEDX[4]; // dedx according padrows
91 Float_t fSDEDX[4]; // sdedx according padrows
92 Int_t fNCDEDX[4]; // number of clusters for dedx measurment
94 Int_t fSeedType; //seeding type
95 Int_t fSeed1; //first row for seeding
96 Int_t fSeed2; //last row for seeding
97 Int_t fOverlapLabels[12]; //track labels and the length of the overlap
98 Float_t fMAngular; // mean angular factor
99 AliTPCTrackerPoint fTrackPoints[160]; //!track points - array track points
101 ClassDef(AliTPCseed,1)
107 class AliTPCtrackerMI : public AliTracker {
109 AliTPCtrackerMI():AliTracker(),fkNIS(0),fkNOS(0) {
110 fInnerSec=fOuterSec=0; fSeeds=0;
112 AliTPCtrackerMI(const AliTPCParam *par);
113 virtual ~AliTPCtrackerMI();
115 //to be implemented later
116 virtual Int_t Clusters2Tracks (AliESD *){return 0;}
117 virtual Int_t RefitInward (AliESD *){return 0;}
118 virtual Int_t LoadClusters (TTree *){return 0;}
120 void SetIO(); //set default IO from folders
121 void SetIO(TTree * input, TTree * output, AliESD * event);
124 void SetDebug(Int_t debug){ fDebug = debug;}
125 Int_t ReadSeeds(const TFile *in);
126 Int_t LoadClusters();
127 void UnloadClusters();
128 TObjArray * GetSeeds(){return fSeeds;}
130 AliCluster * GetCluster (int) const {return 0;}
131 AliTPCclusterMI *GetClusterMI(Int_t index) const;
132 Int_t Clusters2Tracks(const TFile */*in*/, TFile */*out*/){return 0;}
133 Int_t Clusters2Tracks();
134 virtual void CookLabel(AliTPCseed *t,Float_t wrong) const;
136 void RotateToLocal(AliTPCseed *seed);
139 Int_t FollowProlongation(AliTPCseed& t, Int_t rf=0, Int_t step=1);
140 Int_t FollowProlongationFast(AliTPCseed& t, Int_t rf=0, Int_t step=1);
142 Int_t FollowBackProlongation(AliTPCseed& t, Int_t rf);
143 Int_t FollowToNext(AliTPCseed& t, Int_t nr);
144 Int_t FollowToNextFast(AliTPCseed& t, Int_t nr);
145 Int_t UpdateClusters(AliTPCseed& t, Int_t nr);
146 Int_t FollowToNextCluster( AliTPCseed& t, Int_t nr);
148 virtual Int_t PropagateBack (const TFile *, TFile *){return 0;}
149 Int_t PropagateBack(TObjArray * arr);
150 Int_t PropagateBack(AliESD * event);
151 Int_t PropagateBack(AliTPCseed *pt, Int_t row0, Int_t row1);
152 Int_t PropagateForward();
153 Int_t PropagateForward2(TObjArray * arr);
155 Int_t CheckKinkPoint(AliTPCseed*seed, Float_t th);
156 void SortTracks(TObjArray * arr, Int_t mode);
159 virtual Double_t ErrY2(AliTPCseed* seed, AliTPCclusterMI * cl = 0);
160 virtual Double_t ErrZ2(AliTPCseed* seed, AliTPCclusterMI * cl = 0);
162 Double_t F1(Double_t x1,Double_t y1, Double_t x2,Double_t y2, Double_t x3,Double_t y3);
163 Double_t F1old(Double_t x1,Double_t y1, Double_t x2,Double_t y2, Double_t x3,Double_t y3);
164 Double_t F2(Double_t x1,Double_t y1, Double_t x2,Double_t y2, Double_t x3,Double_t y3);
165 Double_t F2old(Double_t x1,Double_t y1, Double_t x2,Double_t y2, Double_t x3,Double_t y3);
167 Double_t F3(Double_t x1,Double_t y1, Double_t x2,Double_t y2, Double_t z1,Double_t z2);
168 Double_t F3n(Double_t x1,Double_t y1, Double_t x2,Double_t y2, Double_t z1,Double_t z2,
170 Bool_t GetProlongation(Double_t x1, Double_t x2, Double_t x[5], Double_t &y, Double_t &z);
173 //**************** Internal tracker class **********************
176 friend class AliTPCtrackerMI;
177 friend class AliTPCtrackerMI::AliTPCSector;
181 void InsertCluster(const AliTPCclusterMI *c, UInt_t index);
182 operator int() const {return fN;}
183 Int_t GetN() const {return fN;}
184 const AliTPCclusterMI* operator[](Int_t i) const {return fClusters[i];}
185 UInt_t GetIndex(Int_t i) const {return fIndex[i];}
186 inline Int_t Find(Double_t z) const;
187 AliTPCclusterMI * FindNearest(Double_t y, Double_t z, Double_t roady, Double_t roadz) const;
188 AliTPCclusterMI * FindNearest2(Double_t y, Double_t z, Double_t roady, Double_t roadz, UInt_t & index) const;
189 AliTPCclusterMI * FindNearest3(Double_t y, Double_t z, Double_t roady, Double_t roadz, UInt_t & index) const;
191 void SetX(Double_t x) {fX=x;}
192 Double_t GetX() const {return fX;}
194 Float_t fDeadZone; // the width of the dead zone
195 AliTPCclusterMI *fClusters1; //array with clusters 1
196 Int_t fN1; //number of clusters on left side
197 AliTPCclusterMI *fClusters2; //array with clusters 2
198 Int_t fN2; // number of clusters on right side of the TPC
199 Short_t fFastCluster[510]; //index of the nearest cluster at given position
200 Int_t fN; //number of clusters
201 const AliTPCclusterMI *fClusters[kMaxClusterPerRow]; //pointers to clusters
202 // indexes for cluster at given position z
203 // AliTPCclusterMI *fClustersArray; //
204 UInt_t fIndex[kMaxClusterPerRow]; //indeces of clusters
205 Double_t fX; //X-coordinate of this row
207 AliTPCRow(const AliTPCRow& r); //dummy copy constructor
208 AliTPCRow &operator=(const AliTPCRow& r); //dummy assignment operator
211 //**************** Internal tracker class **********************
213 friend class AliTPCtrackerMI;
215 AliTPCSector() { fN=0; fRow = 0; }
216 ~AliTPCSector() { delete[] fRow; }
217 AliTPCRow& operator[](Int_t i) const { return *(fRow+i); }
218 Int_t GetNRows() const { return fN; }
219 void Setup(const AliTPCParam *par, Int_t flag);
220 Double_t GetX(Int_t l) const {return fRow[l].GetX();}
221 Double_t GetMaxY(Int_t l) const {
222 return GetX(l)*TMath::Tan(0.5*GetAlpha());
224 Double_t GetAlpha() const {return fAlpha;}
225 Double_t GetAlphaShift() const {return fAlphaShift;}
226 //Int_t GetFirst(){return fFirstRow;}
227 Int_t GetRowNumber(Double_t x) const {
228 //return pad row number for this x
232 if (x > r) return fN;
234 if (x < r) return -1;
235 return Int_t((x-r)/fPadPitchLength + 0.5);}
238 if (x > r) return fN;
240 if (x < r) return -1;
241 Double_t r1=fRow[64].GetX();
243 return Int_t((x-r)/f1PadPitchLength + 0.5);}
245 return (Int_t((x-r1)/f2PadPitchLength + 0.5)+64);}
248 Double_t GetPadPitchWidth() const {return fPadPitchWidth;}
249 Double_t GetPadPitchLength() const {return fPadPitchLength;}
250 Double_t GetPadPitchLength(Float_t x) const {return (x<200) ? fPadPitchLength:f2PadPitchLength ;}
253 Int_t fN; //number of pad rows
254 //Int_t fFirstRow; //offset
255 AliTPCRow *fRow; //array of pad rows
256 Double_t fAlpha; //opening angle
257 Double_t fAlphaShift; //shift angle;
258 Double_t fPadPitchWidth; //pad pitch width
259 Double_t fPadPitchLength; //pad pitch length
260 Double_t f1PadPitchLength; //pad pitch length
261 Double_t f2PadPitchLength; //pad pitch length
264 AliTPCSector(const AliTPCSector &s); //dummy copy contructor
265 AliTPCSector& operator=(const AliTPCSector &s);//dummy assignment operator
268 Float_t OverlapFactor(AliTPCseed * s1, AliTPCseed * s2, Int_t &sum1, Int_t &sum2);
269 void SignShared(AliTPCseed * s1, AliTPCseed * s2);
270 void SignShared(TObjArray * arr);
272 void RemoveUsed(TObjArray * arr, Float_t factor1, Float_t factor2, Int_t removalindex);
273 void RemoveDouble(TObjArray * arr, Float_t factor1, Float_t factor2, Int_t removalindex);
275 void StopNotActive(TObjArray * arr, Int_t row0, Float_t th0, Float_t th1, Float_t th2);
276 void StopNotActive(AliTPCseed * seed, Int_t row0, Float_t th0, Float_t th1, Float_t th2);
277 Int_t AcceptCluster(AliTPCseed * seed, AliTPCclusterMI * cluster, Float_t factor, Float_t cory=1., Float_t corz=1.);
280 inline AliTPCRow &GetRow(Int_t sec, Int_t row);
281 inline Double_t GetXrow(Int_t row);
282 inline Double_t GetMaxY(Int_t row);
283 inline Int_t GetRowNumber(Double_t x);
284 inline Double_t GetPadPitchLength(Double_t x);
285 inline Double_t GetPadPitchLength(Int_t row);
287 Float_t GetSigmaY(AliTPCseed * seed);
288 Float_t GetSigmaZ(AliTPCseed * seed);
289 void GetShape(AliTPCseed * seed, Int_t row);
291 void ReadSeeds(AliESD *event); //read seeds from the event
293 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);
294 void MakeSeeds5(TObjArray * arr, Int_t sec, Int_t i1, Int_t i2, Float_t cuts[4], Float_t deltay = -1);
296 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);
299 AliTPCseed *MakeSeed(AliTPCseed *t, Float_t r0, Float_t r1, Float_t r2); //reseed
303 AliTPCseed * ReSeed(AliTPCseed *t);
304 Int_t LoadInnerSectors();
305 Int_t LoadOuterSectors();
306 void UnsignClusters();
307 void SignClusters(TObjArray * arr, Float_t fnumber=3., Float_t fdensity=2.);
309 void ParallelTracking(TObjArray * arr, Int_t rfirst, Int_t rlast);
310 void Tracking(TObjArray * arr);
311 TObjArray * Tracking(Int_t seedtype, Int_t i1, Int_t i2, Float_t cuts[4], Float_t dy=-1, Int_t dsec=0);
312 TObjArray * Tracking();
313 void SumTracks(TObjArray *arr1,TObjArray *arr2);
314 void PrepareForBackProlongation(TObjArray * arr, Float_t fac);
315 void PrepareForProlongation(TObjArray * arr, Float_t fac);
317 void SetSampledEdx(AliTPCseed *t, Float_t q, Int_t i) {;}
318 Int_t UpdateTrack(AliTPCseed *t, Int_t accept); //update trackinfo
321 AliTPCtrackerMI(const AliTPCtrackerMI& r); //dummy copy constructor
322 AliTPCtrackerMI &operator=(const AliTPCtrackerMI& r);//dummy assignment operator
324 const Int_t fkNIS; //number of inner sectors
325 AliTPCSector *fInnerSec; //array of inner sectors;
326 const Int_t fkNOS; //number of outer sectors
327 AliTPCSector *fOuterSec; //array of outer sectors;
329 Int_t fN; //number of loaded sectors
330 AliTPCSector *fSectors; //pointer to loaded sectors;
332 TTree * fInput; // input tree with clusters
333 TTree * fOutput; // output tree with tracks
334 TTree * fSeedTree; // output tree with seeds - filled in debug mode 1
335 TTree * fTreeDebug; // output with a debug information about track
336 AliESD * fEvent; // output with esd tracks
337 Int_t fDebug; // debug option
338 Bool_t fNewIO; // indicated if we have data using New IO
339 Int_t fNtracks; //current number of tracks
340 TObjArray *fSeeds; //array of track seeds
341 Int_t fIteration; // indicate iteration - 0 - froward -1 back - 2forward - back->forward
342 // TObjArray * fTrackPointPool; // ! pool with track points
343 // TObjArray * fSeedPool; //! pool with seeds
344 Double_t fXRow[200]; // radius of the pad row
345 Double_t fYMax[200]; // max y for given pad row
346 Double_t fPadLength[200]; // max y for given pad row
347 const AliTPCParam *fParam; //pointer to the parameters
348 ClassDef(AliTPCtrackerMI,1)
352 AliTPCtrackerMI::AliTPCRow & AliTPCtrackerMI::GetRow(Int_t sec, Int_t row)
355 return (row>=fInnerSec->GetNRows()) ? fOuterSec[sec][row-fInnerSec->GetNRows()]:fInnerSec[sec][row];
358 Double_t AliTPCtrackerMI::GetXrow(Int_t row) {
359 // return (row>=fInnerSec->GetNRows()) ? fOuterSec->GetX(row-fInnerSec->GetNRows()):fInnerSec->GetX(row);
363 Double_t AliTPCtrackerMI::GetMaxY(Int_t row) {
364 //return (row>=fInnerSec->GetNRows()) ? fOuterSec->GetMaxY(row-fInnerSec->GetNRows()):fInnerSec->GetMaxY(row);
368 Int_t AliTPCtrackerMI::GetRowNumber(Double_t x)
371 return (x>133.) ? fOuterSec->GetRowNumber(x)+fInnerSec->GetNRows():fInnerSec->GetRowNumber(x);
374 Double_t AliTPCtrackerMI::GetPadPitchLength(Double_t x)
377 return (x>133.) ? fOuterSec->GetPadPitchLength(x):fInnerSec->GetPadPitchLength(x);
378 //return fPadLength[row];
381 Double_t AliTPCtrackerMI::GetPadPitchLength(Int_t row)
384 return fPadLength[row];