]> git.uio.no Git - u/mrichter/AliRoot.git/blame - ANALYSIS/AliESDtrackCuts.h
Fix for savannah bug report 87728 (Laurent) + fix invalid read found with valgrind...
[u/mrichter/AliRoot.git] / ANALYSIS / AliESDtrackCuts.h
CommitLineData
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 28class AliESDEvent;
29class AliESDtrack;
30class AliLog;
31class TTree;
d95684c0 32class TH1;
33class TH1F;
34class TH2F;
35class TF1;
36class TCollection;
f328399b 37class TFormula;
73318471 38
39class AliESDtrackCuts : public AliAnalysisCuts
40{
41public:
94c06b89 42 enum ITSClusterRequirement { kOff = 0, kNone, kAny, kFirst, kOnlyFirst, kSecond, kOnlySecond, kBoth };
43 enum Detector { kSPD = 0, kSDD, kSSD };
a61ab805 44 enum MultEstTrackCuts { kMultEstTrackCutGlobal = 0, kMultEstTrackCutITSSA, kMultEstTrackCutDCAwSPD, kMultEstTrackCutDCAwoSPD, kNMultEstTrackCuts /* this must always be the last */};
45 enum MultEstTrackType { kTrackletsITSTPC = 0, kTrackletsITSSA, kTracklets };
94c06b89 46
73318471 47 AliESDtrackCuts(const Char_t* name = "AliESDtrackCuts", const Char_t* title = "");
48 virtual ~AliESDtrackCuts();
36853ddd 49
0c6c629b 50 virtual Bool_t IsSelected(TObject* obj)
9eeae5d5 51 {return AcceptTrack((AliESDtrack*)obj);}
0c6c629b 52 virtual Bool_t IsSelected(TList* /*list*/) {return kTRUE;}
36853ddd 53
73318471 54 Bool_t AcceptTrack(AliESDtrack* esdTrack);
74687314 55 TObjArray* GetAcceptedTracks(AliESDEvent* esd, Bool_t bTPC = kFALSE);
f7ce7a37 56 Int_t CountAcceptedTracks(const AliESDEvent* const esd);
1bf80d20 57
f7ce7a37 58 static Int_t GetReferenceMultiplicity(const AliESDEvent* esd, Bool_t tpcOnly);
a61ab805 59 static Int_t GetReferenceMultiplicity(const AliESDEvent* esd, MultEstTrackType trackType = kTrackletsITSTPC, Float_t etaRange = 0.5);
60 static AliESDtrackCuts* GetMultEstTrackCuts(MultEstTrackCuts cut);
73318471 61
4fd6a75d 62 static AliESDtrack* GetTPCOnlyTrack(const AliESDEvent* esd, Int_t iTrack);
1bf80d20 63
64 // Standard cut definitions
ecd4e3ba 65 static AliESDtrackCuts* GetStandardTPCOnlyTrackCuts();
66 static AliESDtrackCuts* GetStandardITSTPCTrackCuts2009(Bool_t selPrimaries=kTRUE);
07b1b131 67 static AliESDtrackCuts* GetStandardITSTPCTrackCuts2010(Bool_t selPrimaries=kTRUE, Int_t clusterCut=0);
ecd4e3ba 68 static AliESDtrackCuts* GetStandardITSSATrackCuts2009(Bool_t selPrimaries=kTRUE, Bool_t useForPid=kTRUE);
69 static AliESDtrackCuts* GetStandardITSSATrackCuts2010(Bool_t selPrimaries=kTRUE, Bool_t useForPid=kTRUE);
9023d7ac 70 static AliESDtrackCuts* GetStandardITSSATrackCutsPbPb2010(Bool_t selPrimaries=kTRUE, Bool_t useForPid=kTRUE);
ecd4e3ba 71 static AliESDtrackCuts* GetStandardITSPureSATrackCuts2009(Bool_t selPrimaries=kTRUE, Bool_t useForPid=kTRUE);
72 static AliESDtrackCuts* GetStandardITSPureSATrackCuts2010(Bool_t selPrimaries=kTRUE, Bool_t useForPid=kTRUE);
28348fb4 73 // Standard cuts for daughter tracks
74 static AliESDtrackCuts* GetStandardV0DaughterCuts();
524916f0 75
73318471 76 virtual Long64_t Merge(TCollection* list);
77 virtual void Copy(TObject &c) const;
78 AliESDtrackCuts(const AliESDtrackCuts& pd); // Copy Constructor
79 AliESDtrackCuts &operator=(const AliESDtrackCuts &c);
80
81 //######################################################
82 // track quality cut setters
83 void SetMinNClustersTPC(Int_t min=-1) {fCutMinNClusterTPC=min;}
84 void SetMinNClustersITS(Int_t min=-1) {fCutMinNClusterITS=min;}
07b1b131 85 void SetMinNCrossedRowsTPC(Float_t min=-1) { fCutMinNCrossedRowsTPC=min;}
86 void SetMinRatioCrossedRowsOverFindableClustersTPC(Float_t min = -1) { fCutMinRatioCrossedRowsOverFindableClustersTPC=min;}
94c06b89 87 void SetClusterRequirementITS(Detector det, ITSClusterRequirement req = kOff) { fCutClusterRequirementITS[det] = req; }
73318471 88 void SetMaxChi2PerClusterTPC(Float_t max=1e10) {fCutMaxChi2PerClusterTPC=max;}
89 void SetMaxChi2PerClusterITS(Float_t max=1e10) {fCutMaxChi2PerClusterITS=max;}
9023d7ac 90 void SetMaxNOfMissingITSPoints(Int_t max=6) {fCutMaxMissingITSPoints=max;}
73318471 91 void SetRequireTPCRefit(Bool_t b=kFALSE) {fCutRequireTPCRefit=b;}
a86cf7f4 92 void SetRequireTPCStandAlone(Bool_t b=kFALSE) {fCutRequireTPCStandAlone=b;}
73318471 93 void SetRequireITSRefit(Bool_t b=kFALSE) {fCutRequireITSRefit=b;}
0274b76f 94 void SetRequireITSPid(Bool_t b=kFALSE) {fCutRequireITSPid=b;}
95 void SetRequireITSStandAlone(Bool_t b=kFALSE) {fCutRequireITSStandAlone = b;}
96 void SetRequireITSPureStandAlone(Bool_t b=kFALSE){fCutRequireITSpureSA = b;}
97
98
3128582b 99 void SetAcceptKinkDaughters(Bool_t b=kTRUE) {fCutAcceptKinkDaughters=b;}
100 void SetAcceptSharedTPCClusters(Bool_t b=kTRUE){fCutAcceptSharedTPCClusters=b;}
101 void SetMaxFractionSharedTPCClusters(Float_t max=1e10) {fCutMaxFractionSharedTPCClusters=max;}
73318471 102 void SetMaxCovDiagonalElements(Float_t c1=1e10, Float_t c2=1e10, Float_t c3=1e10, Float_t c4=1e10, Float_t c5=1e10)
103 {fCutMaxC11=c1; fCutMaxC22=c2; fCutMaxC33=c3; fCutMaxC44=c4; fCutMaxC55=c5;}
025fb458 104 void SetMaxRel1PtUncertainty(Float_t max=1e10) {fCutMaxRel1PtUncertainty=max;}
73318471 105
07b1b131 106
73318471 107 // track to vertex cut setters
610e91ac 108 void SetMaxNsigmaToVertex(Float_t sigma=1e10) {fCutNsigmaToVertex = sigma; SetRequireSigmaToVertex(kTRUE);}
29387958 109 void SetRequireSigmaToVertex(Bool_t b=kTRUE) {fCutSigmaToVertexRequired = b;}
133a5e00 110 void SetMaxDCAToVertexXY(Float_t dist=1e10) {fCutMaxDCAToVertexXY = dist;}
111 void SetMaxDCAToVertexZ(Float_t dist=1e10) {fCutMaxDCAToVertexZ = dist;}
112 void SetMinDCAToVertexXY(Float_t dist=0.) {fCutMinDCAToVertexXY = dist;}
113 void SetMinDCAToVertexZ(Float_t dist=0.) {fCutMinDCAToVertexZ = dist;}
f328399b 114 void SetMaxDCAToVertexXYPtDep(const char *dist="");
115 void SetMaxDCAToVertexZPtDep(const char *dist="");
116 void SetMinDCAToVertexXYPtDep(const char *dist="");
117 void SetMinDCAToVertexZPtDep(const char *dist="");
86f0e195 118 void SetDCAToVertex2D(Bool_t b=kFALSE) {fCutDCAToVertex2D = b;}
73318471 119
f4e7aa32 120
73318471 121 // getters
73318471 122
5ce43eaf 123 Int_t GetMinNClusterTPC() const { return fCutMinNClusterTPC;}
124 Int_t GetMinNClustersITS() const { return fCutMinNClusterITS;}
94c06b89 125 ITSClusterRequirement GetClusterRequirementITS(Detector det) const { return fCutClusterRequirementITS[det]; }
5ce43eaf 126 Float_t GetMaxChi2PerClusterTPC() const { return fCutMaxChi2PerClusterTPC;}
127 Float_t GetMaxChi2PerClusterITS() const { return fCutMaxChi2PerClusterITS;}
9023d7ac 128 Int_t GetMaxNOfMissingITSPoints() const { return fCutMaxMissingITSPoints;}
5ce43eaf 129 Bool_t GetRequireTPCRefit() const { return fCutRequireTPCRefit;}
a86cf7f4 130 Bool_t GetRequireTPCStandAlone() const { return fCutRequireTPCStandAlone;}
5ce43eaf 131 Bool_t GetRequireITSRefit() const { return fCutRequireITSRefit;}
d95684c0 132 Bool_t GetRequireITSStandAlone() const { return fCutRequireITSStandAlone; }
58c4f3fb 133 Bool_t GetAcceptKinkDaughters() const { return fCutAcceptKinkDaughters;}
3128582b 134 Bool_t GetAcceptSharedTPCClusters() const {return fCutAcceptSharedTPCClusters;}
135 Float_t GetMaxFractionSharedTPCClusters() const {return fCutMaxFractionSharedTPCClusters;}
f690bf48 136 void GetMaxCovDiagonalElements(Float_t& c1, Float_t& c2, Float_t& c3, Float_t& c4, Float_t& c5) const
5ce43eaf 137 {c1 = fCutMaxC11; c2 = fCutMaxC22; c3 = fCutMaxC33; c4 = fCutMaxC44; c5 = fCutMaxC55;}
025fb458 138 Float_t GetMaxRel1PtUncertainty() const { return fCutMaxRel1PtUncertainty;}
94c06b89 139 Float_t GetMaxNsigmaToVertex() const { return fCutNsigmaToVertex;}
133a5e00 140 Float_t GetMaxDCAToVertexXY() const { return fCutMaxDCAToVertexXY;}
141 Float_t GetMaxDCAToVertexZ() const { return fCutMaxDCAToVertexZ;}
142 Float_t GetMinDCAToVertexXY() const { return fCutMinDCAToVertexXY;}
143 Float_t GetMinDCAToVertexZ() const { return fCutMinDCAToVertexZ;}
f4e7aa32 144 const char* GetMaxDCAToVertexXYPtDep() const { return fCutMaxDCAToVertexXYPtDep;}
145 const char* GetMaxDCAToVertexZPtDep() const { return fCutMaxDCAToVertexZPtDep;}
146 const char* GetMinDCAToVertexXYPtDep() const { return fCutMinDCAToVertexXYPtDep;}
147 const char* GetMinDCAToVertexZPtDep() const { return fCutMinDCAToVertexZPtDep;}
86f0e195 148 Bool_t GetDCAToVertex2D() const { return fCutDCAToVertex2D;}
5ce43eaf 149 Bool_t GetRequireSigmaToVertex( ) const { return fCutSigmaToVertexRequired;}
5ac99092 150
1bf80d20 151 void GetPRange(Float_t& r1, Float_t& r2) const {r1=fPMin; r2=fPMax;}
152 void GetPtRange(Float_t& r1, Float_t& r2) const {r1=fPtMin; r2=fPtMax;}
153 void GetPxRange(Float_t& r1, Float_t& r2) const {r1=fPxMin; r2=fPxMax;}
154 void GetPyRange(Float_t& r1, Float_t& r2) const {r1=fPyMin; r2=fPyMax;}
155 void GetPzRange(Float_t& r1, Float_t& r2) const {r1=fPzMin; r2=fPzMax;}
156 void GetEtaRange(Float_t& r1, Float_t& r2) const {r1=fEtaMin; r2=fEtaMax;}
157 void GetRapRange(Float_t& r1, Float_t& r2) const {r1=fRapMin; r2=fRapMax;}
74687314 158
73318471 159 // track kinmatic cut setters
160 void SetPRange(Float_t r1=0, Float_t r2=1e10) {fPMin=r1; fPMax=r2;}
161 void SetPtRange(Float_t r1=0, Float_t r2=1e10) {fPtMin=r1; fPtMax=r2;}
162 void SetPxRange(Float_t r1=-1e10, Float_t r2=1e10) {fPxMin=r1; fPxMax=r2;}
163 void SetPyRange(Float_t r1=-1e10, Float_t r2=1e10) {fPyMin=r1; fPyMax=r2;}
164 void SetPzRange(Float_t r1=-1e10, Float_t r2=1e10) {fPzMin=r1; fPzMax=r2;}
165 void SetEtaRange(Float_t r1=-1e10, Float_t r2=1e10) {fEtaMin=r1; fEtaMax=r2;}
166 void SetRapRange(Float_t r1=-1e10, Float_t r2=1e10) {fRapMin=r1; fRapMax=r2;}
167
168 //######################################################
169 void SetHistogramsOn(Bool_t b=kFALSE) {fHistogramsOn = b;}
170 void DefineHistograms(Int_t color=1);
171 virtual Bool_t LoadHistograms(const Char_t* dir = 0);
172 void SaveHistograms(const Char_t* dir = 0);
173 void DrawHistograms();
174
f690bf48 175 static Float_t GetSigmaToVertex(AliESDtrack* const esdTrack);
73318471 176
177 static void EnableNeededBranches(TTree* tree);
178
179 // void SaveQualityCuts(Char_t* file)
180 // void LoadQualityCuts(Char_t* file)
181
9023d7ac 182 TH1F* GetDZNormalized(Int_t i) const { return fhDZNormalized[i]; }
183 TH1F* GetNClustersTPC(Int_t i) const { return fhNClustersTPC[i]; }
184 TH1F* GetPtHist(Int_t i) const { return fhPt[i]; }
73318471 185
186protected:
187 void Init(); // sets everything to 0
94c06b89 188 Bool_t CheckITSClusterRequirement(ITSClusterRequirement req, Bool_t clusterL1, Bool_t clusterL2);
f4e7aa32 189 Bool_t CheckPtDepDCA(TString dist,Bool_t print=kFALSE) const;
190 void SetPtDepDCACuts(Double_t pt);
191
9023d7ac 192 enum { kNCuts = 39 };
73318471 193
194 //######################################################
195 // esd track quality cuts
196 static const Char_t* fgkCutNames[kNCuts]; //! names of cuts (for internal use)
a61ab805 197 static AliESDtrackCuts* fgMultEstTrackCuts[kNMultEstTrackCuts]; //! track cuts used for the multiplicity estimate
73318471 198
199 Int_t fCutMinNClusterTPC; // min number of tpc clusters
200 Int_t fCutMinNClusterITS; // min number of its clusters
07b1b131 201 Float_t fCutMinNCrossedRowsTPC; // min number of tpc crossed rows
202 Float_t fCutMinRatioCrossedRowsOverFindableClustersTPC; // min ratio crossed rows / findable clusters
203
94c06b89 204 ITSClusterRequirement fCutClusterRequirementITS[3]; // detailed ITS cluster requirements for (SPD, SDD, SSD)
73318471 205
206 Float_t fCutMaxChi2PerClusterTPC; // max tpc fit chi2 per tpc cluster
207 Float_t fCutMaxChi2PerClusterITS; // max its fit chi2 per its cluster
9023d7ac 208 Int_t fCutMaxMissingITSPoints; // max n. of missing ITS points
73318471 209
210 Float_t fCutMaxC11; // max cov. matrix diag. elements (res. y^2)
211 Float_t fCutMaxC22; // max cov. matrix diag. elements (res. z^2)
212 Float_t fCutMaxC33; // max cov. matrix diag. elements (res. sin(phi)^2)
213 Float_t fCutMaxC44; // max cov. matrix diag. elements (res. tan(theta_dip)^2)
214 Float_t fCutMaxC55; // max cov. matrix diag. elements (res. 1/pt^2)
215
025fb458 216 Float_t fCutMaxRel1PtUncertainty; // max relative uncertainty of 1/pt
217
73318471 218 Bool_t fCutAcceptKinkDaughters; // accepting kink daughters?
3128582b 219 Bool_t fCutAcceptSharedTPCClusters;// accepting shared clusters in TPC?
220 Float_t fCutMaxFractionSharedTPCClusters; //Maximum fraction of shared clusters in TPC
73318471 221 Bool_t fCutRequireTPCRefit; // require TPC refit
a86cf7f4 222 Bool_t fCutRequireTPCStandAlone; // require TPC standalone tracks
73318471 223 Bool_t fCutRequireITSRefit; // require ITS refit
ecd4e3ba 224 Bool_t fCutRequireITSPid; // require ITS pid
0274b76f 225 Bool_t fCutRequireITSStandAlone; // require ITS standalone tracks (remove pure SA)
226 Bool_t fCutRequireITSpureSA; // require ITS pure standalone tracks (found using all ITS clusters)
73318471 227
07b1b131 228
73318471 229 // track to vertex cut
230 Float_t fCutNsigmaToVertex; // max number of estimated sigma from track-to-vertex
231 Bool_t fCutSigmaToVertexRequired; // cut track if sigma from track-to-vertex could not be calculated
133a5e00 232 Float_t fCutMaxDCAToVertexXY; // track-to-vertex cut in max absolute distance in xy-plane
233 Float_t fCutMaxDCAToVertexZ; // track-to-vertex cut in max absolute distance in z-plane
234 Float_t fCutMinDCAToVertexXY; // track-to-vertex cut on min absolute distance in xy-plane
235 Float_t fCutMinDCAToVertexZ; // track-to-vertex cut on min absolute distance in z-plane
f328399b 236 //
f4e7aa32 237 TString fCutMaxDCAToVertexXYPtDep; // pt-dep track-to-vertex cut in max absolute distance in xy-plane
238 TString fCutMaxDCAToVertexZPtDep; // pt-dep track-to-vertex cut in max absolute distance in z-plane
239 TString fCutMinDCAToVertexXYPtDep; // pt-dep track-to-vertex cut on min absolute distance in xy-plane
240 TString fCutMinDCAToVertexZPtDep; // pt-dep track-to-vertex cut on min absolute distance in z-plane
f328399b 241
242 // only internal use, set via strings above
243 TFormula *f1CutMaxDCAToVertexXYPtDep; // pt-dep track-to-vertex cut in max absolute distance in xy-plane
244 TFormula *f1CutMaxDCAToVertexZPtDep; // pt-dep track-to-vertex cut in max absolute distance in z-plane
245 TFormula *f1CutMinDCAToVertexXYPtDep; // pt-dep track-to-vertex cut on min absolute distance in xy-plane
246 TFormula *f1CutMinDCAToVertexZPtDep; // pt-dep track-to-vertex cut on min absolute distance in z-plane
247
133a5e00 248 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 249
250 // esd kinematics cuts
251 Float_t fPMin, fPMax; // definition of the range of the P
252 Float_t fPtMin, fPtMax; // definition of the range of the Pt
253 Float_t fPxMin, fPxMax; // definition of the range of the Px
254 Float_t fPyMin, fPyMax; // definition of the range of the Py
255 Float_t fPzMin, fPzMax; // definition of the range of the Pz
256 Float_t fEtaMin, fEtaMax; // definition of the range of the eta
257 Float_t fRapMin, fRapMax; // definition of the range of the y
258
259 //######################################################
260 // diagnostics histograms
261 Bool_t fHistogramsOn; // histograms on/off
262
263 TH1F* fhNClustersITS[2]; //->
264 TH1F* fhNClustersTPC[2]; //->
9023d7ac 265 TH1F* fhNSharedClustersTPC[2]; //->
07b1b131 266 TH1F* fhNCrossedRowsTPC[2]; //->
267 TH1F* fhRatioCrossedRowsOverFindableClustersTPC[2]; // ->
73318471 268
269 TH1F* fhChi2PerClusterITS[2]; //->
270 TH1F* fhChi2PerClusterTPC[2]; //->
2a35259b 271 TH1F* fhNClustersForITSPID[2]; //-> number of points in SDD+SSD (ITS PID selection)
272 TH1F* fhNMissingITSPoints[2]; //-> number of missing ITS points
73318471 273
274 TH1F* fhC11[2]; //->
275 TH1F* fhC22[2]; //->
276 TH1F* fhC33[2]; //->
277 TH1F* fhC44[2]; //->
278 TH1F* fhC55[2]; //->
279
025fb458 280 TH1F* fhRel1PtUncertainty[2]; //-> rel. uncertainty of 1/pt
281
73318471 282 TH1F* fhDXY[2]; //->
283 TH1F* fhDZ[2]; //->
86f0e195 284 TH1F* fhDXYDZ[2]; //-> absolute distance sqrt(dxy**2 + dz**2) to vertex; if 2D cut is set, normalized to given values
73318471 285 TH2F* fhDXYvsDZ[2]; //->
286
287 TH1F* fhDXYNormalized[2]; //->
288 TH1F* fhDZNormalized[2]; //->
289 TH2F* fhDXYvsDZNormalized[2]; //->
290 TH1F* fhNSigmaToVertex[2]; //->
524916f0 291
73318471 292 TH1F* fhPt[2]; //-> pt of esd tracks
293 TH1F* fhEta[2]; //-> eta of esd tracks
294
295 TF1* ffDTheoretical; //-> theoretical distance to vertex normalized (2d gauss)
296
297 TH1F* fhCutStatistics; //-> statistics of what cuts the tracks did not survive
298 TH2F* fhCutCorrelation; //-> 2d statistics plot
299
a61ab805 300 ClassDef(AliESDtrackCuts, 16)
73318471 301};
302
303
304#endif