]>
Commit | Line | Data |
---|---|---|
1 | #ifndef ALITRDSEEDV1_H | |
2 | #define ALITRDSEEDV1_H | |
3 | /* Copyright(c) 1998-1999, ALICE Experiment at CERN, All rights reserved. * | |
4 | * See cxx source for full Copyright notice */ | |
5 | ||
6 | /* $Id$ */ | |
7 | ||
8 | //////////////////////////////////////////////////////////////////////////// | |
9 | // // | |
10 | // \class AliTRDseedV1 | |
11 | // \brief The TRD offline tracklet | |
12 | // \author Alexandru Bercuci | |
13 | // // | |
14 | //////////////////////////////////////////////////////////////////////////// | |
15 | ||
16 | #ifndef ALITRDTRACKLETBASE_H | |
17 | #include "AliTRDtrackletBase.h" | |
18 | #endif | |
19 | ||
20 | #ifndef ROOT_TMath | |
21 | #include "TMath.h" | |
22 | #endif | |
23 | ||
24 | #ifndef ALITRDGEOMETRY_H | |
25 | #include "AliTRDgeometry.h" | |
26 | #endif | |
27 | ||
28 | #ifndef ALIPID_H | |
29 | #include "AliPID.h" | |
30 | #endif | |
31 | ||
32 | #ifndef ALIRIEMAN_H | |
33 | #include "AliRieman.h" | |
34 | #endif | |
35 | ||
36 | #ifndef ALITRDCLUSTER_H | |
37 | #include "AliTRDcluster.h" | |
38 | #endif | |
39 | ||
40 | #include "AliTRDReconstructor.h" | |
41 | ||
42 | class TTreeSRedirector; | |
43 | class TLinearFitter; | |
44 | ||
45 | class AliRieman; | |
46 | ||
47 | class AliTRDtrackingChamber; | |
48 | class AliTRDtrackV1; | |
49 | class AliTRDpadPlane; | |
50 | class AliTRDseedV1 : public AliTRDtrackletBase | |
51 | { | |
52 | friend class AliHLTTRDTracklet; | |
53 | ||
54 | public: | |
55 | enum ETRDtrackletBuffers { | |
56 | kNbits = 6 // bits to store number of clusters | |
57 | ,kMask = 0x3f // bit mask | |
58 | ,kNtb = 31 // max clusters/pad row | |
59 | ,kNclusters = 2*kNtb // max number of clusters/tracklet | |
60 | ,kNslices = 10 // max dEdx slices | |
61 | }; | |
62 | ||
63 | // bits from 0-13 are reserved by ROOT (see TObject.h) | |
64 | enum ETRDtrackletStatus { | |
65 | kOwner = BIT(14) // owner of its clusters | |
66 | ,kRowCross = BIT(15) // pad row cross tracklet | |
67 | ,kPID = BIT(16) // PID contributor | |
68 | ,kCalib = BIT(17) // calibrated tracklet | |
69 | ,kKink = BIT(18) // kink prolongation tracklet | |
70 | ,kStandAlone = BIT(19) // tracklet build during stand alone track finding | |
71 | }; | |
72 | enum ETRDtrackletError { | |
73 | kAttachClFound = 1 // not enough clusters found | |
74 | ,kAttachRowGap // found gap attached rows | |
75 | ,kAttachRow // found 3 rows | |
76 | ,kAttachMultipleCl // multiple clusters attached to time bin | |
77 | ,kAttachClAttach // not enough clusters attached | |
78 | ,kFitFailed // fit failed det=0 | |
79 | ,kFitOutside // ref radial position outside chamber - wrong covariance | |
80 | }; | |
81 | ||
82 | AliTRDseedV1(Int_t det = -1); | |
83 | ~AliTRDseedV1(); | |
84 | AliTRDseedV1(const AliTRDseedV1 &ref); | |
85 | AliTRDseedV1& operator=(const AliTRDseedV1 &ref); | |
86 | ||
87 | Bool_t AttachClusters(AliTRDtrackingChamber *const chamber, Bool_t tilt = kFALSE); | |
88 | void Bootstrap(const AliTRDReconstructor *rec); | |
89 | void Calibrate(); | |
90 | void CookdEdx(Int_t nslices); | |
91 | void CookLabels(); | |
92 | Bool_t CookPID(); | |
93 | Bool_t Fit(Bool_t tilt=kFALSE, Bool_t zcorr=kFALSE); | |
94 | Bool_t Init(AliTRDtrackV1 *track); | |
95 | inline void Init(const AliRieman *fit); | |
96 | Bool_t IsEqual(const TObject *inTracklet) const; | |
97 | Bool_t IsCalibrated() const { return TestBit(kCalib);} | |
98 | Bool_t IsOwner() const { return TestBit(kOwner);} | |
99 | Bool_t IsKink() const { return TestBit(kKink);} | |
100 | Bool_t HasPID() const { return TestBit(kPID);} | |
101 | Bool_t IsOK() const { return GetN() > 4 && GetNUsed() < 4;} | |
102 | Bool_t IsRowCross() const { return TestBit(kRowCross);} | |
103 | Bool_t IsUsable(Int_t i) const { return fClusters[i] && !fClusters[i]->IsUsed();} | |
104 | Bool_t IsStandAlone() const { return TestBit(kStandAlone);} | |
105 | ||
106 | Float_t GetC(Int_t typ=0) const { return fC[typ]; } | |
107 | Float_t GetChi2() const { return fChi2; } | |
108 | inline Float_t GetChi2Z() const; | |
109 | inline Float_t GetChi2Y() const; | |
110 | inline Float_t GetChi2Phi() const; | |
111 | void GetCovAt(Double_t x, Double_t *cov) const; | |
112 | void GetCovXY(Double_t *cov) const { memcpy(cov, &fCov[0], 3*sizeof(Double_t));} | |
113 | void GetCovRef(Double_t *cov) const { memcpy(cov, &fRefCov, 7*sizeof(Double_t));} | |
114 | static Int_t GetCovSqrt(const Double_t * const c, Double_t *d); | |
115 | static Double_t GetCovInv(const Double_t * const c, Double_t *d); | |
116 | UChar_t GetErrorMsg() const { return fErrorMsg;} | |
117 | Float_t GetdX() const { return fdX;} | |
118 | const Float_t* GetdEdx() const { return &fdEdx[0];} | |
119 | Float_t GetdQdl(Int_t ic, Float_t *dx=NULL) const; | |
120 | Float_t GetdYdX() const { return fYfit[1]; } | |
121 | Float_t GetdZdX() const { return fZref[1]; } | |
122 | Int_t GetdY() const { return Int_t(GetY()/0.014);} | |
123 | Int_t GetDetector() const { return fDet;} | |
124 | void GetCalibParam(Float_t &exb, Float_t &vd, Float_t &t0, Float_t &s2, Float_t &dl, Float_t &dt) const { | |
125 | exb = fExB; vd = fVD; t0 = fT0; s2 = fS2PRF; dl = fDiffL; dt = fDiffT;} | |
126 | AliTRDcluster* GetClusters(Int_t i) const { return i<0 || i>=kNclusters ? NULL: fClusters[i];} | |
127 | Int_t GetIndexes(Int_t i) const{ return i<0 || i>=kNclusters ? -1 : fIndexes[i];} | |
128 | Int_t GetLabels(Int_t i) const { return fLabels[i];} | |
129 | Float_t GetMomentum(Float_t *err = NULL) const; | |
130 | Int_t GetN() const { return (Int_t)fN&kMask;} | |
131 | Int_t GetN2() const { return GetN();} | |
132 | Int_t GetNUsed() const { return Int_t((fN>>kNbits)&kMask);} | |
133 | Int_t GetNShared() const { return Int_t(((fN>>kNbits)>>kNbits)&kMask);} | |
134 | Float_t GetOccupancyTB() const; | |
135 | Float_t GetQuality(Bool_t kZcorr) const; | |
136 | Float_t GetPadLength() const { return fPad[0];} | |
137 | Float_t GetPadWidth() const { return fPad[1];} | |
138 | Int_t GetPlane() const { return AliTRDgeometry::GetLayer(fDet); } | |
139 | ||
140 | Float_t* GetProbability(Bool_t force=kFALSE); | |
141 | Float_t GetPt() const { return fPt; } | |
142 | inline Double_t GetPID(Int_t is=-1) const; | |
143 | Float_t GetS2Y() const { return fS2Y;} | |
144 | Float_t GetS2Z() const { return fS2Z;} | |
145 | Float_t GetSigmaY() const { return fS2Y > 0. ? TMath::Sqrt(fS2Y) : 0.2;} | |
146 | Float_t GetSnp() const { return fYref[1]/TMath::Sqrt(1+fYref[1]*fYref[1]);} | |
147 | Float_t GetTgl() const { return fZref[1]/TMath::Sqrt(1+fYref[1]*fYref[1]);} | |
148 | Float_t GetTilt() const { return fPad[2];} | |
149 | UInt_t GetTrackletWord() const { return 0;} | |
150 | UShort_t GetVolumeId() const; | |
151 | Float_t GetX0() const { return fX0;} | |
152 | Float_t GetX() const { return fX0 - fX;} | |
153 | Float_t GetY() const { return fYfit[0] - fYfit[1] * fX;} | |
154 | Double_t GetYat(Double_t x) const { return fYfit[0] - fYfit[1] * (fX0-x);} | |
155 | Float_t GetYfit(Int_t id) const { return fYfit[id];} | |
156 | Float_t GetYref(Int_t id) const { return fYref[id];} | |
157 | Float_t GetZ() const { return fZfit[0] - fZfit[1] * fX;} | |
158 | Double_t GetZat(Double_t x) const { return fZfit[0] - fZfit[1] * (fX0-x);} | |
159 | Float_t GetZfit(Int_t id) const { return fZfit[id];} | |
160 | Float_t GetZref(Int_t id) const { return fZref[id];} | |
161 | Int_t GetYbin() const { return Int_t(GetY()/0.016);} | |
162 | Int_t GetZbin() const { return Int_t(GetZ()/fPad[0]);} | |
163 | ||
164 | inline AliTRDcluster* NextCluster(); | |
165 | inline AliTRDcluster* PrevCluster(); | |
166 | void Print(Option_t *o = "") const; | |
167 | inline void ResetClusterIter(Bool_t forward = kTRUE); | |
168 | void Reset(Option_t *opt=""); | |
169 | ||
170 | void SetC(Float_t c, Int_t typ=0) { fC[typ] = c;} | |
171 | void SetChi2(Float_t chi2) { fChi2 = chi2;} | |
172 | inline void SetCovRef(const Double_t *cov); | |
173 | void SetErrorMsg(Int_t err) { fErrorMsg = err;} | |
174 | void SetIndexes(Int_t i, Int_t idx) { fIndexes[i] = idx; } | |
175 | void SetLabels(Int_t *lbls) { memcpy(fLabels, lbls, 3*sizeof(Int_t)); } | |
176 | void SetKink(Bool_t k = kTRUE){ SetBit(kKink, k);} | |
177 | void SetPID(Bool_t k = kTRUE) { SetBit(kPID, k);} | |
178 | void SetStandAlone(Bool_t st) { SetBit(kStandAlone, st); } | |
179 | void SetPt(Double_t pt) { fPt = pt;} | |
180 | void SetOwner(); | |
181 | void SetPadPlane(AliTRDpadPlane *p); | |
182 | void SetPadLength(Float_t l) { fPad[0] = l;} | |
183 | void SetPadWidth(Float_t w) { fPad[1] = w;} | |
184 | void SetTilt(Float_t tilt) { fPad[2] = tilt; } | |
185 | void SetDetector(Int_t d) { fDet = d; } | |
186 | void SetDX(Float_t inDX) { fdX = inDX;} | |
187 | void SetReconstructor(const AliTRDReconstructor *rec) {fkReconstructor = rec;} | |
188 | void SetX0(Float_t x0) { fX0 = x0; } | |
189 | void SetYref(Int_t i, Float_t y) { fYref[i] = y;} | |
190 | void SetZref(Int_t i, Float_t z) { fZref[i] = z;} | |
191 | // void SetUsabilityMap(Long_t um) { fUsable = um; } | |
192 | void Update(const AliTRDtrackV1* trk); | |
193 | void UpdateUsed(); | |
194 | void UseClusters(); | |
195 | ||
196 | protected: | |
197 | void Copy(TObject &ref) const; | |
198 | ||
199 | private: | |
200 | inline void SetN(Int_t n); | |
201 | inline void SetNUsed(Int_t n); | |
202 | inline void SetNShared(Int_t n); | |
203 | inline void Swap(Int_t &n1, Int_t &n2); | |
204 | inline void Swap(Double_t &d1, Double_t &d2); | |
205 | ||
206 | const AliTRDReconstructor *fkReconstructor;//! local reconstructor | |
207 | AliTRDcluster **fClusterIter; //! clusters iterator | |
208 | Int_t fIndexes[kNclusters]; //! Indexes | |
209 | Float_t fExB; // tg(a_L) @ tracklet location | |
210 | Float_t fVD; // drift velocity @ tracklet location | |
211 | Float_t fT0; // time 0 @ tracklet location | |
212 | Float_t fS2PRF; // sigma^2 PRF for xd->0 and phi=a_L | |
213 | Float_t fDiffL; // longitudinal diffusion coefficient | |
214 | Float_t fDiffT; // transversal diffusion coefficient | |
215 | Char_t fClusterIdx; //! clusters iterator | |
216 | UChar_t fErrorMsg; // processing error | |
217 | UInt_t fN; // number of clusters attached/used/shared | |
218 | Short_t fDet; // TRD detector | |
219 | AliTRDcluster *fClusters[kNclusters]; // Clusters | |
220 | Float_t fPad[3]; // local pad definition : length/width/tilt | |
221 | Float_t fYref[2]; // Reference y, dydx | |
222 | Float_t fZref[2]; // Reference z, dz/dx | |
223 | Float_t fYfit[2]; // Fit y, dy/dx | |
224 | Float_t fZfit[2]; // Fit z | |
225 | Float_t fPt; // Pt estimate @ tracklet [GeV/c] | |
226 | Float_t fdX; // length of time bin | |
227 | Float_t fX0; // anode wire position | |
228 | Float_t fX; // radial position of the tracklet | |
229 | Float_t fY; // r-phi position of the tracklet | |
230 | Float_t fZ; // z position of the tracklet | |
231 | Float_t fS2Y; // estimated resolution in the r-phi direction | |
232 | Float_t fS2Z; // estimated resolution in the z direction | |
233 | Float_t fC[2]; // Curvature for standalone [0] rieman [1] vertex constrained | |
234 | Float_t fChi2; // Global chi2 | |
235 | Float_t fdEdx[kNslices]; // dE/dx measurements for tracklet | |
236 | Float_t fProb[AliPID::kSPECIES]; // PID probabilities | |
237 | Int_t fLabels[3]; // most frequent MC labels and total number of different labels | |
238 | Double_t fRefCov[7]; // covariance matrix of the track in the yz plane + the rest of the diagonal elements | |
239 | Double_t fCov[3]; // covariance matrix of the tracklet in the xy plane | |
240 | ||
241 | ClassDef(AliTRDseedV1, 11) // The offline TRD tracklet | |
242 | }; | |
243 | ||
244 | //____________________________________________________________ | |
245 | inline Float_t AliTRDseedV1::GetChi2Z() const | |
246 | { | |
247 | Double_t dz = fZref[0]-fZfit[0]; dz*=dz; | |
248 | Double_t cov[3]; GetCovAt(fX, cov); | |
249 | Double_t s2 = fRefCov[2]+cov[2]; | |
250 | return s2 > 0. ? dz/s2 : 0.; | |
251 | } | |
252 | ||
253 | //____________________________________________________________ | |
254 | inline Float_t AliTRDseedV1::GetChi2Y() const | |
255 | { | |
256 | Double_t dy = fYref[0]-fYfit[0]; dy*=dy; | |
257 | Double_t cov[3]; GetCovAt(fX, cov); | |
258 | Double_t s2 = fRefCov[0]+cov[0]; | |
259 | return s2 > 0. ? dy/s2 : 0.; | |
260 | } | |
261 | ||
262 | //____________________________________________________________ | |
263 | inline Float_t AliTRDseedV1::GetChi2Phi() const | |
264 | { | |
265 | Double_t dphi = fYref[1]-fYfit[1]; dphi*=dphi; | |
266 | Double_t cov[3]; GetCovAt(fX, cov); | |
267 | Double_t s2 = fRefCov[2]+cov[2]; | |
268 | return s2 > 0. ? dphi/s2 : 0.; | |
269 | } | |
270 | ||
271 | ||
272 | ||
273 | //____________________________________________________________ | |
274 | inline Double_t AliTRDseedV1::GetPID(Int_t is) const | |
275 | { | |
276 | if(is<0) return fProb[AliPID::kElectron]; | |
277 | if(is<AliPID::kSPECIES) return fProb[is]; | |
278 | return 0.; | |
279 | } | |
280 | ||
281 | //____________________________________________________________ | |
282 | inline void AliTRDseedV1::Init(const AliRieman *rieman) | |
283 | { | |
284 | fZref[0] = rieman->GetZat(fX0); | |
285 | fZref[1] = rieman->GetDZat(fX0); | |
286 | fYref[0] = rieman->GetYat(fX0); | |
287 | fYref[1] = rieman->GetDYat(fX0); | |
288 | if(fkReconstructor && fkReconstructor->IsHLT()){ | |
289 | fRefCov[0] = 1; | |
290 | fRefCov[2] = 10; | |
291 | }else{ | |
292 | fRefCov[0] = rieman->GetErrY(fX0); | |
293 | fRefCov[2] = rieman->GetErrZ(fX0); | |
294 | } | |
295 | fC[0] = rieman->GetC(); | |
296 | fChi2 = rieman->GetChi2(); | |
297 | } | |
298 | ||
299 | //____________________________________________________________ | |
300 | inline AliTRDcluster* AliTRDseedV1::NextCluster() | |
301 | { | |
302 | // Mimic the usage of STL iterators. | |
303 | // Forward iterator | |
304 | ||
305 | fClusterIdx++; fClusterIter++; | |
306 | while(fClusterIdx < kNclusters){ | |
307 | if(!(*fClusterIter)){ | |
308 | fClusterIdx++; | |
309 | fClusterIter++; | |
310 | continue; | |
311 | } | |
312 | return *fClusterIter; | |
313 | } | |
314 | return NULL; | |
315 | } | |
316 | ||
317 | //____________________________________________________________ | |
318 | inline AliTRDcluster* AliTRDseedV1::PrevCluster() | |
319 | { | |
320 | // Mimic the usage of STL iterators. | |
321 | // Backward iterator | |
322 | ||
323 | fClusterIdx--; fClusterIter--; | |
324 | while(fClusterIdx >= 0){ | |
325 | if(!(*fClusterIter)){ | |
326 | fClusterIdx--; | |
327 | fClusterIter--; | |
328 | continue; | |
329 | } | |
330 | return *fClusterIter; | |
331 | } | |
332 | return NULL; | |
333 | } | |
334 | ||
335 | //____________________________________________________________ | |
336 | inline void AliTRDseedV1::ResetClusterIter(Bool_t forward) | |
337 | { | |
338 | // Mimic the usage of STL iterators. | |
339 | // Facilitate the usage of NextCluster for forward like | |
340 | // iterator (kTRUE) and PrevCluster for backward like iterator (kFALSE) | |
341 | ||
342 | if(forward){ | |
343 | fClusterIter = &fClusters[0]; fClusterIter--; | |
344 | fClusterIdx=-1; | |
345 | } else { | |
346 | fClusterIter = &fClusters[kNclusters-1]; fClusterIter++; | |
347 | fClusterIdx=kNclusters; | |
348 | } | |
349 | } | |
350 | ||
351 | //____________________________________________________________ | |
352 | inline void AliTRDseedV1::SetCovRef(const Double_t *cov) | |
353 | { | |
354 | // Copy some "important" covariance matrix elements | |
355 | // var(y) | |
356 | // cov(y,z) var(z) | |
357 | // var(snp) | |
358 | // var(tgl) | |
359 | // cov(tgl, 1/pt) var(1/pt) | |
360 | ||
361 | memcpy(&fRefCov[0], cov, 3*sizeof(Double_t)); // yz full covariance | |
362 | fRefCov[3] = cov[ 5]; // snp variance | |
363 | fRefCov[4] = cov[ 9]; // tgl variance | |
364 | fRefCov[5] = cov[13]; // cov(tgl, 1/pt) | |
365 | fRefCov[6] = cov[14]; // 1/pt variance | |
366 | } | |
367 | ||
368 | ||
369 | //____________________________________________________________ | |
370 | inline void AliTRDseedV1::SetN(Int_t n) | |
371 | { | |
372 | if(n<0 || n>kNclusters) return; | |
373 | fN &= ~kMask; | |
374 | fN |= (n&kMask); | |
375 | } | |
376 | ||
377 | //____________________________________________________________ | |
378 | inline void AliTRDseedV1::SetNUsed(Int_t n) | |
379 | { | |
380 | if(n<0 || n>kNclusters) return; | |
381 | UInt_t mask(kMask<<kNbits); | |
382 | fN &= ~mask; | |
383 | n=n<<kNbits; fN |= (n&mask); | |
384 | } | |
385 | ||
386 | //____________________________________________________________ | |
387 | inline void AliTRDseedV1::SetNShared(Int_t n) | |
388 | { | |
389 | if(n<0 || n>kNclusters) return; | |
390 | UInt_t mask((kMask<<kNbits)<<kNbits); | |
391 | fN &= ~mask; | |
392 | n = (n<<kNbits)<<kNbits; fN|=(n&mask); | |
393 | } | |
394 | ||
395 | //____________________________________________________________ | |
396 | inline void AliTRDseedV1::Swap(Int_t &n1, Int_t &n2) | |
397 | { | |
398 | // swap values of n1 with n2 | |
399 | Int_t tmp(n1); | |
400 | n1=n2; n2=tmp; | |
401 | } | |
402 | ||
403 | //____________________________________________________________ | |
404 | inline void AliTRDseedV1::Swap(Double_t &d1, Double_t &d2) | |
405 | { | |
406 | // swap values of d1 with d2 | |
407 | Double_t tmp(d1); | |
408 | d1=d2; d2=tmp; | |
409 | } | |
410 | ||
411 | ||
412 | #endif | |
413 | ||
414 | ||
415 |