]> git.uio.no Git - u/mrichter/AliRoot.git/blame - ITS/AliITStrackMI.h
output histos instead of THnSparse
[u/mrichter/AliRoot.git] / ITS / AliITStrackMI.h
CommitLineData
15dd636f 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 */
5
6//-------------------------------------------------------------------------
7// ITS Track Class
8//
9// Origin: Marian Ivanov, CERN, Marian.Ivanov@cern.ch
10// dEdx analysis by: Boris Batyunya, JINR, Boris.Batiounia@cern.ch
11//-------------------------------------------------------------------------
12
ae00569a 13/* $Id$ */
15dd636f 14
15/*****************************************************************************
16 * December 18, 2000 *
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 *****************************************************************************/
28
29#include <AliKalmanTrack.h>
30
15dd636f 31#include "AliITStrackV2.h"
32
33class AliESDtrack;
34
35//_____________________________________________________________________________
36class AliITStrackMI : public AliITStrackV2 {
15dd636f 37public:
38 AliITStrackMI();
763bdf3e 39 AliITStrackMI(AliESDtrack& t,Bool_t c=kFALSE);
15dd636f 40 AliITStrackMI(const AliITStrackMI& t);
eea51857 41 virtual ~AliITStrackMI() {if (fWinner) fWinner->fWinner = 0;} // release associated seed
15dd636f 42 Int_t GetProlongationFast(Double_t alpha, Double_t xr,Double_t &y, Double_t &z);
150f264c 43 Bool_t UpdateMI(const AliCluster *c, Double_t chi2, Int_t i);
15dd636f 44
15dd636f 45 void SetReconstructed(Bool_t sr=kTRUE){fReconstructed = sr;}
46 Bool_t GetReconstructed() const {return fReconstructed;}
47 void SetChi2MIP(Int_t i,Float_t val){fChi2MIP[i]=val;}
48 Float_t GetChi2MIP(Int_t i) const {return fChi2MIP[i];}
49 void IncrementNSkipped(){fNSkipped++;} // increment by 1 the # of skipped cls
50 Float_t GetNSkipped() const {return fNSkipped;}
b9671574 51 void SetNSkipped(Float_t n) {fNSkipped=n;}
15dd636f 52 void IncrementNUsed(){fNUsed++;} // increment by 1 the # of shared clusters
53 Float_t GetNUsed() const {return fNUsed;}
b9671574 54 void SetNUsed(Float_t n) {fNUsed=n;}
15dd636f 55
56 Int_t Compare(const TObject *o) const;
6c94f330 57 Double_t GetCov33() const {return GetCovariance()[9];} // cov. matrix el. 3,3
58 //Double_t GetCov44() const {return GetCovariance()[15];}// cov. matrix el. 4,4
15dd636f 59 Float_t GetDy(Int_t i) const {return fDy[i];}
60 Float_t GetDz(Int_t i) const {return fDz[i];}
b9671574 61 Float_t GetD(Int_t i) const {return fD[i];}
62 Double_t GetD(Double_t x, Double_t y) const
63 {return AliITStrackV2::GetD(x,y);}
64 Float_t *GetDP() {return fD;}
65 void SetD(Int_t i, Float_t d) {fD[i]=d;}
66 Float_t GetDnorm(Int_t i) const {return fDnorm[i];}
67 Float_t *GetDnormP() {return fDnorm;}
68 void SetDnorm(Int_t i, Float_t d) {fDnorm[i]=d;}
15dd636f 69 Float_t GetSigmaY(Int_t i) const {return fSigmaY[i];}
70 Float_t GetSigmaZ(Int_t i) const {return fSigmaZ[i];}
d9ead1a0 71 Float_t GetSigmaYZ(Int_t i) const {return fSigmaYZ[i];}
b9671574 72 void SetSigmaY(Int_t i, Float_t s) {fSigmaY[i]=s;}
73 void SetSigmaZ(Int_t i, Float_t s) {fSigmaZ[i]=s;}
d9ead1a0 74 void SetSigmaYZ(Int_t i, Float_t s) {fSigmaYZ[i]=s;}
b9671574 75 Float_t GetNDeadZone() const {return fNDeadZone;}
76 void SetNDeadZone(Float_t d) {fNDeadZone=d;}
77 Int_t* ClIndex() {return fClIndex;}
78 Int_t GetClIndex(Int_t i) const {return fClIndex[i];}
79 void SetClIndex(Int_t i, Int_t c) {fClIndex[i]=c;}
80 Float_t GetNormChi2(Int_t i) const {return fNormChi2[i];}
81 void SetNormChi2(Int_t i, Float_t n) {fNormChi2[i]=n;}
82 Bool_t GetConstrain() const {return fConstrain;}
83 void SetConstrain(Bool_t c) {fConstrain=c;}
84 Float_t GetExpQ() const {return fExpQ;}
85 void SetExpQ(Float_t f) {fExpQ=f;}
86 Float_t GetNormQ(Int_t i) const {return fNormQ[i];}
87 void SetNormQ(Int_t i, Float_t q) {fNormQ[i]=q;}
88 Float_t GetdEdxMismatch() const {return fdEdxMismatch;}
89 void SetdEdxMismatch(Float_t m) {fdEdxMismatch=m;}
90 Float_t GetNy(Int_t i) const {return fNy[i];}
91 void SetNy(Int_t i, Float_t f) {fNy[i]=f;}
92 Float_t GetNz(Int_t i) const {return fNz[i];}
93 void SetNz(Int_t i, Float_t f) {fNz[i]=f;}
94 Bool_t GetGoldV0() const {return fGoldV0;}
95 void SetGoldV0(Bool_t g) {fGoldV0=g;}
96 Float_t GetChi22() const {return fChi22;}
97 void SetChi22(Float_t c) {fChi22=c;}
f8720bda 98 Float_t GetDeadZoneProbability(Int_t ilayer) const {return fDeadZoneProbability[ilayer];}
99 void SetDeadZoneProbability(Int_t ilayer,Float_t d) {fDeadZoneProbability[ilayer]=d;}
a4354152 100 //
101 AliITStrackMI* GetWinner() const {return fWinner;}
eea51857 102 void SetWinner(AliITStrackMI* p);
a4354152 103 //
d9ead1a0 104 Double_t GetPredictedChi2MI(Double_t cy, Double_t cz, Double_t cerry, Double_t cerrz, Double_t covyz=0.) const;
628e7bb0 105 Bool_t IsGoldPrimary();
15dd636f 106protected:
107
108 Float_t fNUsed; // number of shared clusters
109 Float_t fNSkipped; // number of skipped clusters
110 Float_t fNDeadZone; // number of clusters in dead zone
f8720bda 111 Float_t fDeadZoneProbability[6]; // probability to cross dead zone
628e7bb0 112 Bool_t fReconstructed; // reconstructed - accepted flag
15dd636f 113 Float_t fChi2MIP[12]; // MIP chi squres
114
115 Float_t fDy[12]; //dy in layer
116 Float_t fDz[12]; //dz in layer
117 Float_t fSigmaY[12]; //sigma y
118 Float_t fSigmaZ[12]; //sigma z
d9ead1a0 119 Float_t fSigmaYZ[12]; //covariance of y and z
15dd636f 120 Float_t fNy[6]; //expected size of cluster
121 Float_t fNz[6]; //expected size of cluster
122 Float_t fD[2]; //distance to the vertex
628e7bb0 123 Float_t fDnorm[2]; // normalized distance to the vertex
15dd636f 124 Float_t fNormQ[6]; // normalized Q
125 Float_t fExpQ; // expected Q
126 Float_t fNormChi2[6]; // normalized chi2
127 Float_t fChi22; // chi22
128 Float_t fdEdxMismatch;
129 Bool_t fConstrain; //indication of the vertex constrain
130 Int_t fClIndex[6]; //cluster Index
a4354152 131 AliITStrackMI* fWinner; //! pointer on winner candidate
628e7bb0 132 Bool_t fGoldV0; //corresponding gold V0 found
a4354152 133 //
134 private:
135 AliITStrackMI &operator=(const AliITStrackMI &tr);
136
137 ClassDef(AliITStrackMI,4) //ITS reconstructed track
15dd636f 138};
139
eea51857 140inline void AliITStrackMI::SetWinner(AliITStrackMI* p)
141{
142 // connect winning hypothesis with the seed
143 if (fWinner) fWinner->fWinner = 0; // release previous winner
144 fWinner = p;
145 if (p) p->fWinner = this;
146}
147
15dd636f 148#endif
149
150