73318471 |
1 | // |
2 | // Class for handling of ESD track cuts. |
3 | // |
4 | // The class manages a number of track quality cuts, a |
5 | // track-to-vertex cut and a number of kinematic cuts. Two methods |
6 | // can be used to figure out if an ESD track survives the cuts: |
7 | // AcceptTrack which takes a single AliESDtrack as argument and |
524916f0 |
8 | // returns kTRUE/kFALSE or GetAcceptedTracks which takes an AliESDEvent |
73318471 |
9 | // object and returns an TObjArray (of AliESDtracks) with the tracks |
10 | // in the ESD that survived the cuts. |
11 | // |
12 | // |
524916f0 |
13 | // TODO: |
73318471 |
14 | // - add functionality to save and load cuts |
73318471 |
15 | // - add histograms for kinematic cut variables? |
16 | // - upper and lower cuts for all (non-boolean) cuts |
17 | // - update print method |
73318471 |
18 | // - put comments to each variable |
19 | // |
20 | |
21 | #ifndef ALIESDTRACKCUTS_H |
22 | #define ALIESDTRACKCUTS_H |
23 | |
f4e7aa32 |
24 | #include <TString.h> |
25 | |
73318471 |
26 | #include "AliAnalysisCuts.h" |
27 | |
73318471 |
28 | class AliESDEvent; |
29 | class AliESDtrack; |
30 | class AliLog; |
31 | class TTree; |
d95684c0 |
32 | class TH1; |
33 | class TH1F; |
34 | class TH2F; |
35 | class TF1; |
36 | class TCollection; |
f328399b |
37 | class TFormula; |
73318471 |
38 | |
39 | class AliESDtrackCuts : public AliAnalysisCuts |
40 | { |
41 | public: |
94c06b89 |
42 | enum ITSClusterRequirement { kOff = 0, kNone, kAny, kFirst, kOnlyFirst, kSecond, kOnlySecond, kBoth }; |
43 | enum Detector { kSPD = 0, kSDD, kSSD }; |
2c32e4e4 |
44 | enum ITSULayers { kITSU012 = 0, kITSU34, kITSU56 }; |
a61ab805 |
45 | enum MultEstTrackCuts { kMultEstTrackCutGlobal = 0, kMultEstTrackCutITSSA, kMultEstTrackCutDCAwSPD, kMultEstTrackCutDCAwoSPD, kNMultEstTrackCuts /* this must always be the last */}; |
46 | enum MultEstTrackType { kTrackletsITSTPC = 0, kTrackletsITSSA, kTracklets }; |
4c3dc2a0 |
47 | enum VertexType { kVertexTracks = 0x1, kVertexSPD = 0x2, kVertexTPC = 0x4 }; |
94c06b89 |
48 | |
73318471 |
49 | AliESDtrackCuts(const Char_t* name = "AliESDtrackCuts", const Char_t* title = ""); |
50 | virtual ~AliESDtrackCuts(); |
36853ddd |
51 | |
0c6c629b |
52 | virtual Bool_t IsSelected(TObject* obj) |
9eeae5d5 |
53 | {return AcceptTrack((AliESDtrack*)obj);} |
0c6c629b |
54 | virtual Bool_t IsSelected(TList* /*list*/) {return kTRUE;} |
36853ddd |
55 | |
0ecbfc1b |
56 | Bool_t AcceptTrack(const AliESDtrack* esdTrack); |
4c3dc2a0 |
57 | TObjArray* GetAcceptedTracks(const AliESDEvent* esd, Bool_t bTPC = kFALSE); |
f7ce7a37 |
58 | Int_t CountAcceptedTracks(const AliESDEvent* const esd); |
1bf80d20 |
59 | |
f7ce7a37 |
60 | static Int_t GetReferenceMultiplicity(const AliESDEvent* esd, Bool_t tpcOnly); |
a61ab805 |
61 | static Int_t GetReferenceMultiplicity(const AliESDEvent* esd, MultEstTrackType trackType = kTrackletsITSTPC, Float_t etaRange = 0.5); |
62 | static AliESDtrackCuts* GetMultEstTrackCuts(MultEstTrackCuts cut); |
73318471 |
63 | |
4fd6a75d |
64 | static AliESDtrack* GetTPCOnlyTrack(const AliESDEvent* esd, Int_t iTrack); |
1bf80d20 |
65 | |
66 | // Standard cut definitions |
ecd4e3ba |
67 | static AliESDtrackCuts* GetStandardTPCOnlyTrackCuts(); |
68 | static AliESDtrackCuts* GetStandardITSTPCTrackCuts2009(Bool_t selPrimaries=kTRUE); |
07b1b131 |
69 | static AliESDtrackCuts* GetStandardITSTPCTrackCuts2010(Bool_t selPrimaries=kTRUE, Int_t clusterCut=0); |
1e01a1ac |
70 | static AliESDtrackCuts* GetStandardITSTPCTrackCuts2011(Bool_t selPrimaries=kTRUE, Int_t clusterCut=1); |
ecd4e3ba |
71 | static AliESDtrackCuts* GetStandardITSSATrackCuts2009(Bool_t selPrimaries=kTRUE, Bool_t useForPid=kTRUE); |
72 | static AliESDtrackCuts* GetStandardITSSATrackCuts2010(Bool_t selPrimaries=kTRUE, Bool_t useForPid=kTRUE); |
9023d7ac |
73 | static AliESDtrackCuts* GetStandardITSSATrackCutsPbPb2010(Bool_t selPrimaries=kTRUE, Bool_t useForPid=kTRUE); |
ecd4e3ba |
74 | static AliESDtrackCuts* GetStandardITSPureSATrackCuts2009(Bool_t selPrimaries=kTRUE, Bool_t useForPid=kTRUE); |
75 | static AliESDtrackCuts* GetStandardITSPureSATrackCuts2010(Bool_t selPrimaries=kTRUE, Bool_t useForPid=kTRUE); |
28348fb4 |
76 | // Standard cuts for daughter tracks |
77 | static AliESDtrackCuts* GetStandardV0DaughterCuts(); |
524916f0 |
78 | |
73318471 |
79 | virtual Long64_t Merge(TCollection* list); |
80 | virtual void Copy(TObject &c) const; |
81 | AliESDtrackCuts(const AliESDtrackCuts& pd); // Copy Constructor |
82 | AliESDtrackCuts &operator=(const AliESDtrackCuts &c); |
83 | |
84 | //###################################################### |
85 | // track quality cut setters |
86 | void SetMinNClustersTPC(Int_t min=-1) {fCutMinNClusterTPC=min;} |
c11bb29c |
87 | void SetMinNClustersTPCPtDep(TFormula *f1=0x0, Float_t ptmax=0.); |
73318471 |
88 | void SetMinNClustersITS(Int_t min=-1) {fCutMinNClusterITS=min;} |
07b1b131 |
89 | void SetMinNCrossedRowsTPC(Float_t min=-1) { fCutMinNCrossedRowsTPC=min;} |
90 | void SetMinRatioCrossedRowsOverFindableClustersTPC(Float_t min = -1) { fCutMinRatioCrossedRowsOverFindableClustersTPC=min;} |
94c06b89 |
91 | void SetClusterRequirementITS(Detector det, ITSClusterRequirement req = kOff) { fCutClusterRequirementITS[det] = req; } |
2c32e4e4 |
92 | void SetClusterRequirementITS(ITSULayers det, ITSClusterRequirement req = kOff) { fCutClusterRequirementITS[det] = req; } |
73318471 |
93 | void SetMaxChi2PerClusterTPC(Float_t max=1e10) {fCutMaxChi2PerClusterTPC=max;} |
94 | void SetMaxChi2PerClusterITS(Float_t max=1e10) {fCutMaxChi2PerClusterITS=max;} |
4c3dc2a0 |
95 | void SetMaxChi2TPCConstrainedGlobal(Float_t max=1e10) {fCutMaxChi2TPCConstrainedVsGlobal = max; } |
96 | void SetMaxChi2TPCConstrainedGlobalVertexType(Int_t vertexType = kVertexTracks | kVertexSPD) { fCutMaxChi2TPCConstrainedVsGlobalVertexType = vertexType; } |
9023d7ac |
97 | void SetMaxNOfMissingITSPoints(Int_t max=6) {fCutMaxMissingITSPoints=max;} |
73318471 |
98 | void SetRequireTPCRefit(Bool_t b=kFALSE) {fCutRequireTPCRefit=b;} |
a86cf7f4 |
99 | void SetRequireTPCStandAlone(Bool_t b=kFALSE) {fCutRequireTPCStandAlone=b;} |
73318471 |
100 | void SetRequireITSRefit(Bool_t b=kFALSE) {fCutRequireITSRefit=b;} |
0274b76f |
101 | void SetRequireITSPid(Bool_t b=kFALSE) {fCutRequireITSPid=b;} |
102 | void SetRequireITSStandAlone(Bool_t b=kFALSE) {fCutRequireITSStandAlone = b;} |
103 | void SetRequireITSPureStandAlone(Bool_t b=kFALSE){fCutRequireITSpureSA = b;} |
104 | |
105 | |
3128582b |
106 | void SetAcceptKinkDaughters(Bool_t b=kTRUE) {fCutAcceptKinkDaughters=b;} |
107 | void SetAcceptSharedTPCClusters(Bool_t b=kTRUE){fCutAcceptSharedTPCClusters=b;} |
108 | void SetMaxFractionSharedTPCClusters(Float_t max=1e10) {fCutMaxFractionSharedTPCClusters=max;} |
73318471 |
109 | void SetMaxCovDiagonalElements(Float_t c1=1e10, Float_t c2=1e10, Float_t c3=1e10, Float_t c4=1e10, Float_t c5=1e10) |
110 | {fCutMaxC11=c1; fCutMaxC22=c2; fCutMaxC33=c3; fCutMaxC44=c4; fCutMaxC55=c5;} |
025fb458 |
111 | void SetMaxRel1PtUncertainty(Float_t max=1e10) {fCutMaxRel1PtUncertainty=max;} |
73318471 |
112 | |
07b1b131 |
113 | |
73318471 |
114 | // track to vertex cut setters |
610e91ac |
115 | void SetMaxNsigmaToVertex(Float_t sigma=1e10) {fCutNsigmaToVertex = sigma; SetRequireSigmaToVertex(kTRUE);} |
29387958 |
116 | void SetRequireSigmaToVertex(Bool_t b=kTRUE) {fCutSigmaToVertexRequired = b;} |
133a5e00 |
117 | void SetMaxDCAToVertexXY(Float_t dist=1e10) {fCutMaxDCAToVertexXY = dist;} |
118 | void SetMaxDCAToVertexZ(Float_t dist=1e10) {fCutMaxDCAToVertexZ = dist;} |
119 | void SetMinDCAToVertexXY(Float_t dist=0.) {fCutMinDCAToVertexXY = dist;} |
120 | void SetMinDCAToVertexZ(Float_t dist=0.) {fCutMinDCAToVertexZ = dist;} |
f328399b |
121 | void SetMaxDCAToVertexXYPtDep(const char *dist=""); |
122 | void SetMaxDCAToVertexZPtDep(const char *dist=""); |
123 | void SetMinDCAToVertexXYPtDep(const char *dist=""); |
124 | void SetMinDCAToVertexZPtDep(const char *dist=""); |
86f0e195 |
125 | void SetDCAToVertex2D(Bool_t b=kFALSE) {fCutDCAToVertex2D = b;} |
73318471 |
126 | |
f4e7aa32 |
127 | |
73318471 |
128 | // getters |
73318471 |
129 | |
5ce43eaf |
130 | Int_t GetMinNClusterTPC() const { return fCutMinNClusterTPC;} |
131 | Int_t GetMinNClustersITS() const { return fCutMinNClusterITS;} |
c11bb29c |
132 | TFormula *GetMinNClustersTPCPtDep() const { return f1CutMinNClustersTPCPtDep;} |
94c06b89 |
133 | ITSClusterRequirement GetClusterRequirementITS(Detector det) const { return fCutClusterRequirementITS[det]; } |
2c32e4e4 |
134 | ITSClusterRequirement GetClusterRequirementITS(ITSULayers det) const { return fCutClusterRequirementITS[det]; } |
5ce43eaf |
135 | Float_t GetMaxChi2PerClusterTPC() const { return fCutMaxChi2PerClusterTPC;} |
136 | Float_t GetMaxChi2PerClusterITS() const { return fCutMaxChi2PerClusterITS;} |
4c3dc2a0 |
137 | Float_t GetMaxChi2TPCConstrainedGlobal() const { return fCutMaxChi2TPCConstrainedVsGlobal; } |
138 | Int_t GetMaxChi2TPCConstrainedGlobalVertexType() const { return fCutMaxChi2TPCConstrainedVsGlobalVertexType; } |
9023d7ac |
139 | Int_t GetMaxNOfMissingITSPoints() const { return fCutMaxMissingITSPoints;} |
5ce43eaf |
140 | Bool_t GetRequireTPCRefit() const { return fCutRequireTPCRefit;} |
a86cf7f4 |
141 | Bool_t GetRequireTPCStandAlone() const { return fCutRequireTPCStandAlone;} |
5ce43eaf |
142 | Bool_t GetRequireITSRefit() const { return fCutRequireITSRefit;} |
d95684c0 |
143 | Bool_t GetRequireITSStandAlone() const { return fCutRequireITSStandAlone; } |
58c4f3fb |
144 | Bool_t GetAcceptKinkDaughters() const { return fCutAcceptKinkDaughters;} |
3128582b |
145 | Bool_t GetAcceptSharedTPCClusters() const {return fCutAcceptSharedTPCClusters;} |
146 | Float_t GetMaxFractionSharedTPCClusters() const {return fCutMaxFractionSharedTPCClusters;} |
f690bf48 |
147 | void GetMaxCovDiagonalElements(Float_t& c1, Float_t& c2, Float_t& c3, Float_t& c4, Float_t& c5) const |
5ce43eaf |
148 | {c1 = fCutMaxC11; c2 = fCutMaxC22; c3 = fCutMaxC33; c4 = fCutMaxC44; c5 = fCutMaxC55;} |
025fb458 |
149 | Float_t GetMaxRel1PtUncertainty() const { return fCutMaxRel1PtUncertainty;} |
94c06b89 |
150 | Float_t GetMaxNsigmaToVertex() const { return fCutNsigmaToVertex;} |
133a5e00 |
151 | Float_t GetMaxDCAToVertexXY() const { return fCutMaxDCAToVertexXY;} |
152 | Float_t GetMaxDCAToVertexZ() const { return fCutMaxDCAToVertexZ;} |
153 | Float_t GetMinDCAToVertexXY() const { return fCutMinDCAToVertexXY;} |
154 | Float_t GetMinDCAToVertexZ() const { return fCutMinDCAToVertexZ;} |
f4e7aa32 |
155 | const char* GetMaxDCAToVertexXYPtDep() const { return fCutMaxDCAToVertexXYPtDep;} |
156 | const char* GetMaxDCAToVertexZPtDep() const { return fCutMaxDCAToVertexZPtDep;} |
157 | const char* GetMinDCAToVertexXYPtDep() const { return fCutMinDCAToVertexXYPtDep;} |
158 | const char* GetMinDCAToVertexZPtDep() const { return fCutMinDCAToVertexZPtDep;} |
86f0e195 |
159 | Bool_t GetDCAToVertex2D() const { return fCutDCAToVertex2D;} |
5ce43eaf |
160 | Bool_t GetRequireSigmaToVertex( ) const { return fCutSigmaToVertexRequired;} |
5ac99092 |
161 | |
1bf80d20 |
162 | void GetPRange(Float_t& r1, Float_t& r2) const {r1=fPMin; r2=fPMax;} |
163 | void GetPtRange(Float_t& r1, Float_t& r2) const {r1=fPtMin; r2=fPtMax;} |
164 | void GetPxRange(Float_t& r1, Float_t& r2) const {r1=fPxMin; r2=fPxMax;} |
165 | void GetPyRange(Float_t& r1, Float_t& r2) const {r1=fPyMin; r2=fPyMax;} |
166 | void GetPzRange(Float_t& r1, Float_t& r2) const {r1=fPzMin; r2=fPzMax;} |
167 | void GetEtaRange(Float_t& r1, Float_t& r2) const {r1=fEtaMin; r2=fEtaMax;} |
168 | void GetRapRange(Float_t& r1, Float_t& r2) const {r1=fRapMin; r2=fRapMax;} |
74687314 |
169 | |
73318471 |
170 | // track kinmatic cut setters |
171 | void SetPRange(Float_t r1=0, Float_t r2=1e10) {fPMin=r1; fPMax=r2;} |
172 | void SetPtRange(Float_t r1=0, Float_t r2=1e10) {fPtMin=r1; fPtMax=r2;} |
173 | void SetPxRange(Float_t r1=-1e10, Float_t r2=1e10) {fPxMin=r1; fPxMax=r2;} |
174 | void SetPyRange(Float_t r1=-1e10, Float_t r2=1e10) {fPyMin=r1; fPyMax=r2;} |
175 | void SetPzRange(Float_t r1=-1e10, Float_t r2=1e10) {fPzMin=r1; fPzMax=r2;} |
176 | void SetEtaRange(Float_t r1=-1e10, Float_t r2=1e10) {fEtaMin=r1; fEtaMax=r2;} |
177 | void SetRapRange(Float_t r1=-1e10, Float_t r2=1e10) {fRapMin=r1; fRapMax=r2;} |
178 | |
179 | //###################################################### |
180 | void SetHistogramsOn(Bool_t b=kFALSE) {fHistogramsOn = b;} |
181 | void DefineHistograms(Int_t color=1); |
182 | virtual Bool_t LoadHistograms(const Char_t* dir = 0); |
183 | void SaveHistograms(const Char_t* dir = 0); |
184 | void DrawHistograms(); |
185 | |
4c3dc2a0 |
186 | static Float_t GetSigmaToVertex(const AliESDtrack* const esdTrack); |
73318471 |
187 | |
188 | static void EnableNeededBranches(TTree* tree); |
189 | |
190 | // void SaveQualityCuts(Char_t* file) |
191 | // void LoadQualityCuts(Char_t* file) |
192 | |
9023d7ac |
193 | TH1F* GetDZNormalized(Int_t i) const { return fhDZNormalized[i]; } |
194 | TH1F* GetNClustersTPC(Int_t i) const { return fhNClustersTPC[i]; } |
195 | TH1F* GetPtHist(Int_t i) const { return fhPt[i]; } |
08e4d7b0 |
196 | |
ab9f5531 |
197 | // TOF cuts |
08e4d7b0 |
198 | void SetFlagCutTOFdistance(Bool_t flagTOFcut) { fFlagCutTOFdistance = flagTOFcut;} |
199 | Bool_t GetFlagCutTOFdistance() const { return fFlagCutTOFdistance;} |
200 | void SetCutTOFdistance(Float_t cut) { fCutTOFdistance = cut;} |
201 | Float_t GetCutTOFdistance() const { return fCutTOFdistance;} |
ab9f5531 |
202 | void SetRequireTOFout(Bool_t b = kFALSE) {fCutRequireTOFout = b;} |
203 | void SetRequireStandardTOFmatchCuts(); |
73318471 |
204 | |
205 | protected: |
206 | void Init(); // sets everything to 0 |
94c06b89 |
207 | Bool_t CheckITSClusterRequirement(ITSClusterRequirement req, Bool_t clusterL1, Bool_t clusterL2); |
f4e7aa32 |
208 | Bool_t CheckPtDepDCA(TString dist,Bool_t print=kFALSE) const; |
209 | void SetPtDepDCACuts(Double_t pt); |
210 | |
ab9f5531 |
211 | enum { kNCuts = 42 }; |
73318471 |
212 | |
213 | //###################################################### |
214 | // esd track quality cuts |
215 | static const Char_t* fgkCutNames[kNCuts]; //! names of cuts (for internal use) |
a61ab805 |
216 | static AliESDtrackCuts* fgMultEstTrackCuts[kNMultEstTrackCuts]; //! track cuts used for the multiplicity estimate |
73318471 |
217 | |
218 | Int_t fCutMinNClusterTPC; // min number of tpc clusters |
219 | Int_t fCutMinNClusterITS; // min number of its clusters |
07b1b131 |
220 | Float_t fCutMinNCrossedRowsTPC; // min number of tpc crossed rows |
221 | Float_t fCutMinRatioCrossedRowsOverFindableClustersTPC; // min ratio crossed rows / findable clusters |
c11bb29c |
222 | TFormula *f1CutMinNClustersTPCPtDep; // pt dependent tpc clusters cut |
223 | Float_t fCutMaxPtDepNClustersTPC; // maximum pt for pt dependend TPC cluster cut. For pt=>ptmax NClusterMin = f1CutMinNClustersTPCPtDep->Eval(fCutMaxPtDepNClustersTPC). |
07b1b131 |
224 | |
94c06b89 |
225 | ITSClusterRequirement fCutClusterRequirementITS[3]; // detailed ITS cluster requirements for (SPD, SDD, SSD) |
73318471 |
226 | |
227 | Float_t fCutMaxChi2PerClusterTPC; // max tpc fit chi2 per tpc cluster |
228 | Float_t fCutMaxChi2PerClusterITS; // max its fit chi2 per its cluster |
4c3dc2a0 |
229 | Float_t fCutMaxChi2TPCConstrainedVsGlobal; // max chi2 TPC track constrained with vtx vs. global track |
230 | Int_t fCutMaxChi2TPCConstrainedVsGlobalVertexType; // vertex type for max chi2 TPC track constrained with vtx vs. global track (can be configured to accept several vertex types) |
9023d7ac |
231 | Int_t fCutMaxMissingITSPoints; // max n. of missing ITS points |
73318471 |
232 | |
233 | Float_t fCutMaxC11; // max cov. matrix diag. elements (res. y^2) |
234 | Float_t fCutMaxC22; // max cov. matrix diag. elements (res. z^2) |
235 | Float_t fCutMaxC33; // max cov. matrix diag. elements (res. sin(phi)^2) |
236 | Float_t fCutMaxC44; // max cov. matrix diag. elements (res. tan(theta_dip)^2) |
237 | Float_t fCutMaxC55; // max cov. matrix diag. elements (res. 1/pt^2) |
238 | |
025fb458 |
239 | Float_t fCutMaxRel1PtUncertainty; // max relative uncertainty of 1/pt |
240 | |
73318471 |
241 | Bool_t fCutAcceptKinkDaughters; // accepting kink daughters? |
3128582b |
242 | Bool_t fCutAcceptSharedTPCClusters;// accepting shared clusters in TPC? |
243 | Float_t fCutMaxFractionSharedTPCClusters; //Maximum fraction of shared clusters in TPC |
73318471 |
244 | Bool_t fCutRequireTPCRefit; // require TPC refit |
a86cf7f4 |
245 | Bool_t fCutRequireTPCStandAlone; // require TPC standalone tracks |
73318471 |
246 | Bool_t fCutRequireITSRefit; // require ITS refit |
ecd4e3ba |
247 | Bool_t fCutRequireITSPid; // require ITS pid |
0274b76f |
248 | Bool_t fCutRequireITSStandAlone; // require ITS standalone tracks (remove pure SA) |
249 | Bool_t fCutRequireITSpureSA; // require ITS pure standalone tracks (found using all ITS clusters) |
73318471 |
250 | |
07b1b131 |
251 | |
73318471 |
252 | // track to vertex cut |
253 | Float_t fCutNsigmaToVertex; // max number of estimated sigma from track-to-vertex |
254 | Bool_t fCutSigmaToVertexRequired; // cut track if sigma from track-to-vertex could not be calculated |
133a5e00 |
255 | Float_t fCutMaxDCAToVertexXY; // track-to-vertex cut in max absolute distance in xy-plane |
256 | Float_t fCutMaxDCAToVertexZ; // track-to-vertex cut in max absolute distance in z-plane |
257 | Float_t fCutMinDCAToVertexXY; // track-to-vertex cut on min absolute distance in xy-plane |
258 | Float_t fCutMinDCAToVertexZ; // track-to-vertex cut on min absolute distance in z-plane |
f328399b |
259 | // |
f4e7aa32 |
260 | TString fCutMaxDCAToVertexXYPtDep; // pt-dep track-to-vertex cut in max absolute distance in xy-plane |
261 | TString fCutMaxDCAToVertexZPtDep; // pt-dep track-to-vertex cut in max absolute distance in z-plane |
262 | TString fCutMinDCAToVertexXYPtDep; // pt-dep track-to-vertex cut on min absolute distance in xy-plane |
263 | TString fCutMinDCAToVertexZPtDep; // pt-dep track-to-vertex cut on min absolute distance in z-plane |
f328399b |
264 | |
265 | // only internal use, set via strings above |
266 | TFormula *f1CutMaxDCAToVertexXYPtDep; // pt-dep track-to-vertex cut in max absolute distance in xy-plane |
267 | TFormula *f1CutMaxDCAToVertexZPtDep; // pt-dep track-to-vertex cut in max absolute distance in z-plane |
268 | TFormula *f1CutMinDCAToVertexXYPtDep; // pt-dep track-to-vertex cut on min absolute distance in xy-plane |
269 | TFormula *f1CutMinDCAToVertexZPtDep; // pt-dep track-to-vertex cut on min absolute distance in z-plane |
270 | |
133a5e00 |
271 | Bool_t fCutDCAToVertex2D; // if true a 2D DCA cut is made. Tracks are accepted if sqrt((DCAXY / fCutMaxDCAToVertexXY)^2 + (DCAZ / fCutMaxDCAToVertexZ)^2) < 1 AND sqrt((DCAXY / fCutMinDCAToVertexXY)^2 + (DCAZ / fCutMinDCAToVertexZ)^2) > 1 |
73318471 |
272 | |
273 | // esd kinematics cuts |
274 | Float_t fPMin, fPMax; // definition of the range of the P |
275 | Float_t fPtMin, fPtMax; // definition of the range of the Pt |
276 | Float_t fPxMin, fPxMax; // definition of the range of the Px |
277 | Float_t fPyMin, fPyMax; // definition of the range of the Py |
278 | Float_t fPzMin, fPzMax; // definition of the range of the Pz |
279 | Float_t fEtaMin, fEtaMax; // definition of the range of the eta |
280 | Float_t fRapMin, fRapMax; // definition of the range of the y |
281 | |
ab9f5531 |
282 | Bool_t fCutRequireTOFout; // require TOF out |
08e4d7b0 |
283 | Bool_t fFlagCutTOFdistance; // cut on TOFdistance? --> yes by default! |
284 | Float_t fCutTOFdistance; // value of the cut on TOFdistance |
285 | static Char_t fgBeamTypeFlag; // -1 --> no check done on the beam type yet |
286 | // 0 --> beam type != "A-A" |
287 | // 1 --> beam type == "A-A" |
288 | |
73318471 |
289 | //###################################################### |
290 | // diagnostics histograms |
291 | Bool_t fHistogramsOn; // histograms on/off |
292 | |
293 | TH1F* fhNClustersITS[2]; //-> |
294 | TH1F* fhNClustersTPC[2]; //-> |
9023d7ac |
295 | TH1F* fhNSharedClustersTPC[2]; //-> |
07b1b131 |
296 | TH1F* fhNCrossedRowsTPC[2]; //-> |
297 | TH1F* fhRatioCrossedRowsOverFindableClustersTPC[2]; // -> |
73318471 |
298 | |
299 | TH1F* fhChi2PerClusterITS[2]; //-> |
300 | TH1F* fhChi2PerClusterTPC[2]; //-> |
4c3dc2a0 |
301 | TH1F* fhChi2TPCConstrainedVsGlobal[2]; //-> |
2a35259b |
302 | TH1F* fhNClustersForITSPID[2]; //-> number of points in SDD+SSD (ITS PID selection) |
303 | TH1F* fhNMissingITSPoints[2]; //-> number of missing ITS points |
73318471 |
304 | |
305 | TH1F* fhC11[2]; //-> |
306 | TH1F* fhC22[2]; //-> |
307 | TH1F* fhC33[2]; //-> |
308 | TH1F* fhC44[2]; //-> |
309 | TH1F* fhC55[2]; //-> |
310 | |
025fb458 |
311 | TH1F* fhRel1PtUncertainty[2]; //-> rel. uncertainty of 1/pt |
312 | |
73318471 |
313 | TH1F* fhDXY[2]; //-> |
314 | TH1F* fhDZ[2]; //-> |
86f0e195 |
315 | TH1F* fhDXYDZ[2]; //-> absolute distance sqrt(dxy**2 + dz**2) to vertex; if 2D cut is set, normalized to given values |
73318471 |
316 | TH2F* fhDXYvsDZ[2]; //-> |
317 | |
318 | TH1F* fhDXYNormalized[2]; //-> |
319 | TH1F* fhDZNormalized[2]; //-> |
320 | TH2F* fhDXYvsDZNormalized[2]; //-> |
321 | TH1F* fhNSigmaToVertex[2]; //-> |
524916f0 |
322 | |
73318471 |
323 | TH1F* fhPt[2]; //-> pt of esd tracks |
324 | TH1F* fhEta[2]; //-> eta of esd tracks |
325 | |
326 | TF1* ffDTheoretical; //-> theoretical distance to vertex normalized (2d gauss) |
327 | |
328 | TH1F* fhCutStatistics; //-> statistics of what cuts the tracks did not survive |
329 | TH2F* fhCutCorrelation; //-> 2d statistics plot |
330 | |
08e4d7b0 |
331 | TH2F* fhTOFdistance[2]; //-> TOF signal distance dx vs dz |
332 | |
ab9f5531 |
333 | ClassDef(AliESDtrackCuts, 20) |
73318471 |
334 | }; |
335 | |
336 | |
337 | #endif |