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 //-------------------------------------------------------
14 //-------------------------------------------------------
15 #include "AliTracker.h"
16 #include "AliTPCtrack.h"
17 #include "AliComplexCluster.h"
22 class AliTPCclusterMI;
23 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 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
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
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
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
102 ClassDef(AliTPCseed,1)
108 class AliTPCtrackerMI : public AliTracker {
110 AliTPCtrackerMI():AliTracker(),fkNIS(0),fkNOS(0) {
111 fInnerSec=fOuterSec=0; fSeeds=0;
113 AliTPCtrackerMI(const AliTPCParam *par);
114 virtual ~AliTPCtrackerMI();
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();
124 void SetIO(); //set default IO from folders
125 void SetIO(TTree * input, TTree * output, AliESD * event);
126 void FillESD(TObjArray* arr);
128 void WriteTracks(TTree * tree);
130 void SetDebug(Int_t debug){ fDebug = debug;}
131 Int_t ReadSeeds(const TFile *in);
132 TObjArray * GetSeeds(){return fSeeds;}
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;
140 void RotateToLocal(AliTPCseed *seed);
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);
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);
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);
159 Int_t CheckKinkPoint(AliTPCseed*seed, Float_t th);
160 void SortTracks(TObjArray * arr, Int_t mode) const;
163 virtual Double_t ErrY2(AliTPCseed* seed, AliTPCclusterMI * cl = 0);
164 virtual Double_t ErrZ2(AliTPCseed* seed, AliTPCclusterMI * cl = 0);
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);
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,
174 Bool_t GetProlongation(Double_t x1, Double_t x2, Double_t x[5], Double_t &y, Double_t &z);
177 //**************** Internal tracker class **********************
180 friend class AliTPCtrackerMI;
181 friend class AliTPCtrackerMI::AliTPCSector;
185 void InsertCluster(const AliTPCclusterMI *c, UInt_t index);
186 void ResetClusters();
187 operator int() const {return fN;}
188 Int_t GetN() const {return fN;}
189 const AliTPCclusterMI* operator[](Int_t i) const {return fClusters[i];}
190 UInt_t GetIndex(Int_t i) const {return fIndex[i];}
191 inline Int_t Find(Double_t z) const;
192 AliTPCclusterMI * FindNearest(Double_t y, Double_t z, Double_t roady, Double_t roadz) const;
193 AliTPCclusterMI * FindNearest2(Double_t y, Double_t z, Double_t roady, Double_t roadz, UInt_t & index) const;
194 AliTPCclusterMI * FindNearest3(Double_t y, Double_t z, Double_t roady, Double_t roadz, UInt_t & index) const;
196 void SetX(Double_t x) {fX=x;}
197 Double_t GetX() const {return fX;}
199 Float_t fDeadZone; // the width of the dead zone
200 AliTPCclusterMI *fClusters1; //array with clusters 1
201 Int_t fN1; //number of clusters on left side
202 AliTPCclusterMI *fClusters2; //array with clusters 2
203 Int_t fN2; // number of clusters on right side of the TPC
204 Short_t fFastCluster[510]; //index of the nearest cluster at given position
205 Int_t fN; //number of clusters
206 const AliTPCclusterMI *fClusters[kMaxClusterPerRow]; //pointers to clusters
207 // indexes for cluster at given position z
208 // AliTPCclusterMI *fClustersArray; //
209 UInt_t fIndex[kMaxClusterPerRow]; //indeces of clusters
210 Double_t fX; //X-coordinate of this row
212 AliTPCRow(const AliTPCRow& r); //dummy copy constructor
213 AliTPCRow &operator=(const AliTPCRow& r); //dummy assignment operator
216 //**************** Internal tracker class **********************
218 friend class AliTPCtrackerMI;
220 AliTPCSector() { fN=0; fRow = 0; }
221 ~AliTPCSector() { delete[] fRow; }
222 AliTPCRow& operator[](Int_t i) const { return *(fRow+i); }
223 Int_t GetNRows() const { return fN; }
224 void Setup(const AliTPCParam *par, Int_t flag);
225 Double_t GetX(Int_t l) const {return fRow[l].GetX();}
226 Double_t GetMaxY(Int_t l) const {
227 return GetX(l)*TMath::Tan(0.5*GetAlpha());
229 Double_t GetAlpha() const {return fAlpha;}
230 Double_t GetAlphaShift() const {return fAlphaShift;}
231 //Int_t GetFirst(){return fFirstRow;}
232 Int_t GetRowNumber(Double_t x) const;
233 Double_t GetPadPitchWidth() const {return fPadPitchWidth;}
234 Double_t GetPadPitchLength() const {return fPadPitchLength;}
235 Double_t GetPadPitchLength(Float_t x) const {return (x<200) ? fPadPitchLength:f2PadPitchLength ;}
238 Int_t fN; //number of pad rows
239 //Int_t fFirstRow; //offset
240 AliTPCRow *fRow; //array of pad rows
241 Double_t fAlpha; //opening angle
242 Double_t fAlphaShift; //shift angle;
243 Double_t fPadPitchWidth; //pad pitch width
244 Double_t fPadPitchLength; //pad pitch length
245 Double_t f1PadPitchLength; //pad pitch length
246 Double_t f2PadPitchLength; //pad pitch length
249 AliTPCSector(const AliTPCSector &s); //dummy copy contructor
250 AliTPCSector& operator=(const AliTPCSector &s);//dummy assignment operator
253 Float_t OverlapFactor(AliTPCseed * s1, AliTPCseed * s2, Int_t &sum1, Int_t &sum2);
254 void SignShared(AliTPCseed * s1, AliTPCseed * s2);
255 void SignShared(TObjArray * arr);
257 void RemoveUsed(TObjArray * arr, Float_t factor1, Float_t factor2, Int_t removalindex);
258 void RemoveDouble(TObjArray * arr, Float_t factor1, Float_t factor2, Int_t removalindex);
260 void StopNotActive(TObjArray * arr, Int_t row0, Float_t th0, Float_t th1, Float_t th2) const;
261 void StopNotActive(AliTPCseed * seed, Int_t row0, Float_t th0, Float_t th1, Float_t th2) const;
262 Int_t AcceptCluster(AliTPCseed * seed, AliTPCclusterMI * cluster, Float_t factor, Float_t cory=1., Float_t corz=1.);
265 inline AliTPCRow &GetRow(Int_t sec, Int_t row);
266 inline Double_t GetXrow(Int_t row) const;
267 inline Double_t GetMaxY(Int_t row) const;
268 inline Int_t GetRowNumber(Double_t x) const;
269 inline Double_t GetPadPitchLength(Double_t x) const;
270 inline Double_t GetPadPitchLength(Int_t row) const;
272 Float_t GetSigmaY(AliTPCseed * seed);
273 Float_t GetSigmaZ(AliTPCseed * seed);
274 void GetShape(AliTPCseed * seed, Int_t row);
276 void ReadSeeds(AliESD *event, Int_t direction); //read seeds from the event
278 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);
279 void MakeSeeds5(TObjArray * arr, Int_t sec, Int_t i1, Int_t i2, Float_t cuts[4], Float_t deltay = -1);
281 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);
284 AliTPCseed *MakeSeed(AliTPCseed *t, Float_t r0, Float_t r1, Float_t r2); //reseed
285 AliTPCseed *ReSeed(AliTPCseed *t, Float_t r0, Float_t r1, Float_t r2); //reseed
289 AliTPCseed * ReSeed(AliTPCseed *t);
290 Int_t LoadInnerSectors();
291 Int_t LoadOuterSectors();
292 void UnsignClusters();
293 void SignClusters(TObjArray * arr, Float_t fnumber=3., Float_t fdensity=2.);
295 void ParallelTracking(TObjArray * arr, Int_t rfirst, Int_t rlast);
296 void Tracking(TObjArray * arr);
297 TObjArray * Tracking(Int_t seedtype, Int_t i1, Int_t i2, Float_t cuts[4], Float_t dy=-1, Int_t dsec=0);
298 TObjArray * Tracking();
299 void SumTracks(TObjArray *arr1,TObjArray *arr2) const;
300 void PrepareForBackProlongation(TObjArray * arr, Float_t fac) const;
301 void PrepareForProlongation(TObjArray * arr, Float_t fac) const;
303 void SetSampledEdx(AliTPCseed *t, Float_t q, Int_t i) {;}
304 Int_t UpdateTrack(AliTPCseed *t, Int_t accept); //update trackinfo
307 AliTPCtrackerMI(const AliTPCtrackerMI& r); //dummy copy constructor
308 AliTPCtrackerMI &operator=(const AliTPCtrackerMI& r);//dummy assignment operator
310 const Int_t fkNIS; //number of inner sectors
311 AliTPCSector *fInnerSec; //array of inner sectors;
312 const Int_t fkNOS; //number of outer sectors
313 AliTPCSector *fOuterSec; //array of outer sectors;
315 Int_t fN; //number of loaded sectors
316 AliTPCSector *fSectors; //pointer to loaded sectors;
318 TTree * fInput; // input tree with clusters
319 TTree * fOutput; // output tree with tracks
320 TTree * fSeedTree; // output tree with seeds - filled in debug mode 1
321 TTree * fTreeDebug; // output with a debug information about track
322 AliESD * fEvent; // output with esd tracks
323 Int_t fDebug; // debug option
324 Bool_t fNewIO; // indicated if we have data using New IO
325 Int_t fNtracks; //current number of tracks
326 TObjArray *fSeeds; //array of track seeds
327 Int_t fIteration; // indicate iteration - 0 - froward -1 back - 2forward - back->forward
328 // TObjArray * fTrackPointPool; // ! pool with track points
329 // TObjArray * fSeedPool; //! pool with seeds
330 Double_t fXRow[200]; // radius of the pad row
331 Double_t fYMax[200]; // max y for given pad row
332 Double_t fPadLength[200]; // max y for given pad row
333 const AliTPCParam *fParam; //pointer to the parameters
334 ClassDef(AliTPCtrackerMI,1)
338 AliTPCtrackerMI::AliTPCRow & AliTPCtrackerMI::GetRow(Int_t sec, Int_t row)
341 return (row>=fInnerSec->GetNRows()) ? fOuterSec[sec][row-fInnerSec->GetNRows()]:fInnerSec[sec][row];
344 Double_t AliTPCtrackerMI::GetXrow(Int_t row) const {
345 // return (row>=fInnerSec->GetNRows()) ? fOuterSec->GetX(row-fInnerSec->GetNRows()):fInnerSec->GetX(row);
349 Double_t AliTPCtrackerMI::GetMaxY(Int_t row) const {
350 //return (row>=fInnerSec->GetNRows()) ? fOuterSec->GetMaxY(row-fInnerSec->GetNRows()):fInnerSec->GetMaxY(row);
354 Int_t AliTPCtrackerMI::GetRowNumber(Double_t x) const
357 return (x>133.) ? fOuterSec->GetRowNumber(x)+fInnerSec->GetNRows():fInnerSec->GetRowNumber(x);
360 Double_t AliTPCtrackerMI::GetPadPitchLength(Double_t x) const
363 return (x>133.) ? fOuterSec->GetPadPitchLength(x):fInnerSec->GetPadPitchLength(x);
364 //return fPadLength[row];
367 Double_t AliTPCtrackerMI::GetPadPitchLength(Int_t row) const
370 return fPadLength[row];