1 #ifndef ALIITSTRACKMI_H
2 #define ALIITSTRACKMI_H
3 /* Copyright(c) 1998-1999, ALICE Experiment at CERN, All rights reserved. *
4 * See cxx source for full Copyright notice */
6 //-------------------------------------------------------------------------
9 // Origin: Marian Ivanov, CERN, Marian.Ivanov@cern.ch
10 // dEdx analysis by: Boris Batyunya, JINR, Boris.Batiounia@cern.ch
11 //-------------------------------------------------------------------------
15 /*****************************************************************************
17 * Internal view of the ITS track parametrisation as well as the order of *
18 * track parameters are subject for possible changes ! *
19 * Use GetExternalParameters() and GetExternalCovariance() to access ITS *
20 * track information regardless of its internal representation. *
21 * This formation is now fixed in the following way: *
22 * external param0: local Y-coordinate of a track (cm) *
23 * external param1: local Z-coordinate of a track (cm) *
24 * external param2: local sine of the track momentum azimuthal angle *
25 * external param3: tangent of the track momentum dip angle *
26 * external param4: 1/pt (1/(GeV/c)) *
27 *****************************************************************************/
29 #include <AliKalmanTrack.h>
31 #include "AliITSRecoParam.h"
32 #include "AliITStrackV2.h"
36 //_____________________________________________________________________________
37 class AliITStrackMI : public AliITStrackV2 {
40 AliITStrackMI(AliESDtrack& t,Bool_t c=kFALSE);
41 AliITStrackMI(const AliITStrackMI& t);
42 virtual ~AliITStrackMI() {if (fWinner) fWinner->fWinner = 0;} // release associated seed
43 Int_t GetProlongationFast(Double_t alpha, Double_t xr,Double_t &y, Double_t &z);
44 Bool_t UpdateMI(const AliCluster *c, Double_t chi2, Int_t i);
46 void SetReconstructed(Bool_t sr=kTRUE){fReconstructed = sr;}
47 Bool_t GetReconstructed() const {return fReconstructed;}
48 void SetChi2MIP(Int_t i,Float_t val){fChi2MIP[i]=val;}
49 Float_t GetChi2MIP(Int_t i) const {return fChi2MIP[i];}
50 void IncrementNSkipped(){fNSkipped++;} // increment by 1 the # of skipped cls
51 Float_t GetNSkipped() const {return fNSkipped;}
52 void SetNSkipped(Float_t n) {fNSkipped=n;}
53 void IncrementNUsed(){fNUsed++;} // increment by 1 the # of shared clusters
54 Float_t GetNUsed() const {return fNUsed;}
55 void SetNUsed(Float_t n) {fNUsed=n;}
57 Int_t Compare(const TObject *o) const;
58 Double_t GetCov33() const {return GetCovariance()[9];} // cov. matrix el. 3,3
59 //Double_t GetCov44() const {return GetCovariance()[15];}// cov. matrix el. 4,4
60 Float_t GetDy(Int_t i) const {return fDy[i];}
61 Float_t GetDz(Int_t i) const {return fDz[i];}
62 Float_t GetD(Int_t i) const {return fD[i];}
63 Double_t GetD(Double_t x, Double_t y) const
64 {return AliITStrackV2::GetD(x,y);}
65 Float_t *GetDP() {return fD;}
66 void SetD(Int_t i, Float_t d) {fD[i]=d;}
67 Float_t GetDnorm(Int_t i) const {return fDnorm[i];}
68 Float_t *GetDnormP() {return fDnorm;}
69 void SetDnorm(Int_t i, Float_t d) {fDnorm[i]=d;}
70 Float_t GetSigmaY(Int_t i) const {return fSigmaY[i];}
71 Float_t GetSigmaZ(Int_t i) const {return fSigmaZ[i];}
72 Float_t GetSigmaYZ(Int_t i) const {return fSigmaYZ[i];}
73 void SetSigmaY(Int_t i, Float_t s) {fSigmaY[i]=s;}
74 void SetSigmaZ(Int_t i, Float_t s) {fSigmaZ[i]=s;}
75 void SetSigmaYZ(Int_t i, Float_t s) {fSigmaYZ[i]=s;}
76 Float_t GetNDeadZone() const {return fNDeadZone;}
77 void SetNDeadZone(Float_t d) {fNDeadZone=d;}
78 Int_t* ClIndex() {return fClIndex;}
79 Int_t GetClIndex(Int_t i) const {return fClIndex[i];}
80 void SetClIndex(Int_t i, Int_t c) {fClIndex[i]=c;}
81 Float_t GetNormChi2(Int_t i) const {return fNormChi2[i];}
82 void SetNormChi2(Int_t i, Float_t n) {fNormChi2[i]=n;}
83 Bool_t GetConstrain() const {return fConstrain;}
84 void SetConstrain(Bool_t c) {fConstrain=c;}
85 Float_t GetExpQ() const {return fExpQ;}
86 void SetExpQ(Float_t f) {fExpQ=f;}
87 Float_t GetNormQ(Int_t i) const {return fNormQ[i];}
88 void SetNormQ(Int_t i, Float_t q) {fNormQ[i]=q;}
89 Float_t GetdEdxMismatch() const {return fdEdxMismatch;}
90 void SetdEdxMismatch(Float_t m) {fdEdxMismatch=m;}
91 Float_t GetNy(Int_t i) const {return fNy[i];}
92 void SetNy(Int_t i, Float_t f) {fNy[i]=f;}
93 Float_t GetNz(Int_t i) const {return fNz[i];}
94 void SetNz(Int_t i, Float_t f) {fNz[i]=f;}
95 Bool_t GetGoldV0() const {return fGoldV0;}
96 void SetGoldV0(Bool_t g) {fGoldV0=g;}
97 Float_t GetChi22() const {return fChi22;}
98 void SetChi22(Float_t c) {fChi22=c;}
99 Float_t GetDeadZoneProbability(Int_t ilayer) const {return fDeadZoneProbability[ilayer];}
100 void SetDeadZoneProbability(Int_t ilayer,Float_t d) {fDeadZoneProbability[ilayer]=d;}
102 AliITStrackMI* GetWinner() const {return fWinner;}
103 void SetWinner(AliITStrackMI* p);
105 Double_t GetPredictedChi2MI(Double_t cy, Double_t cz, Double_t cerry, Double_t cerrz, Double_t covyz=0.) const;
106 Bool_t IsGoldPrimary();
109 Float_t fNUsed; // number of shared clusters
110 Float_t fNSkipped; // number of skipped clusters
111 Float_t fNDeadZone; // number of clusters in dead zone
112 Float_t fDeadZoneProbability[6]; // probability to cross dead zone
113 Bool_t fReconstructed; // reconstructed - accepted flag
114 Float_t fChi2MIP[12]; // MIP chi squres
116 Float_t fDy[12]; //dy in layer
117 Float_t fDz[12]; //dz in layer
118 Float_t fSigmaY[12]; //sigma y
119 Float_t fSigmaZ[12]; //sigma z
120 Float_t fSigmaYZ[12]; //covariance of y and z
121 Float_t fNy[6]; //expected size of cluster
122 Float_t fNz[6]; //expected size of cluster
123 Float_t fD[2]; //distance to the vertex
124 Float_t fDnorm[2]; // normalized distance to the vertex
125 Float_t fNormQ[6]; // normalized Q
126 Float_t fExpQ; // expected Q
127 Float_t fNormChi2[6]; // normalized chi2
128 Float_t fChi22; // chi22
129 Float_t fdEdxMismatch;
130 Bool_t fConstrain; //indication of the vertex constrain
131 Int_t fClIndex[6]; //cluster Index
132 AliITStrackMI* fWinner; //! pointer on winner candidate
133 Bool_t fGoldV0; //corresponding gold V0 found
136 AliITStrackMI &operator=(const AliITStrackMI &tr);
138 ClassDef(AliITStrackMI,4) //ITS reconstructed track
141 inline void AliITStrackMI::SetWinner(AliITStrackMI* p)
143 // connect winning hypothesis with the seed
144 if (fWinner) fWinner->fWinner = 0; // release previous winner
146 if (p) p->fWinner = this;