]>
Commit | Line | Data |
---|---|---|
7dbd4e68 | 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 | |
8 | // returns kTRUE/kFALSE or GetAcceptedTracks which takes an AliESD | |
9 | // object and returns an TObjArray (of AliESDtracks) with the tracks | |
10 | // in the ESD that survived the cuts. | |
11 | // | |
12 | // | |
13 | // TODO: | |
14 | // - add functionality to save and load cuts | |
15 | // - add different ways to make track to vertex cut | |
16 | // - add histograms for kinematic cut variables? | |
17 | // - upper and lower cuts for all (non-boolean) cuts | |
18 | // - update print method | |
19 | // - is there a smarter way to manage the cuts? | |
20 | // - put comments to each variable | |
21 | // | |
22 | ||
23 | #ifndef ALIESDTRACKCUTS_H | |
24 | #define ALIESDTRACKCUTS_H | |
25 | ||
26 | #include <TNamed.h> | |
27 | #include <TF1.h> | |
28 | #include <TH2.h> | |
29 | ||
30 | class AliESD; | |
31 | class AliESDtrack; | |
32 | class AliLog; | |
33 | class TTree; | |
34 | ||
35 | class AliESDtrackCuts : public TNamed | |
36 | { | |
37 | ||
38 | public: | |
39 | AliESDtrackCuts(); | |
40 | AliESDtrackCuts(Char_t* name, Char_t* title=""); | |
41 | virtual ~AliESDtrackCuts(); | |
42 | ||
43 | Bool_t AcceptTrack(AliESDtrack* esdTrack); | |
44 | TObjArray* GetAcceptedTracks(AliESD* esd); | |
45 | Int_t CountAcceptedTracks(AliESD* esd); | |
46 | ||
47 | virtual Long64_t Merge(TCollection* list); | |
48 | virtual void Copy(TObject &c) const; | |
49 | AliESDtrackCuts(const AliESDtrackCuts& pd); // Copy Constructor | |
50 | AliESDtrackCuts &operator=(const AliESDtrackCuts &c); | |
51 | ||
52 | //###################################################### | |
53 | // track quality cut setters | |
54 | void SetMinNClustersTPC(Int_t min=-1) {fCutMinNClusterTPC=min;} | |
55 | void SetMinNClustersITS(Int_t min=-1) {fCutMinNClusterITS=min;} | |
56 | void SetMaxChi2PerClusterTPC(Float_t max=1e99) {fCutMaxChi2PerClusterTPC=max;} | |
57 | void SetMaxChi2PerClusterITS(Float_t max=1e99) {fCutMaxChi2PerClusterITS=max;} | |
58 | void SetRequireTPCRefit(Bool_t b=kFALSE) {fCutRequireTPCRefit=b;} | |
59 | void SetRequireITSRefit(Bool_t b=kFALSE) {fCutRequireITSRefit=b;} | |
60 | void SetAcceptKingDaughters(Bool_t b=kFALSE) {fCutAcceptKinkDaughters=b;} | |
61 | void SetMaxCovDiagonalElements(Float_t c1=1e99, Float_t c2=1e99, Float_t c3=1e99, Float_t c4=1e99, Float_t c5=1e99) | |
62 | {fCutMaxC11=c1; fCutMaxC22=c2; fCutMaxC33=c3; fCutMaxC44=c4; fCutMaxC55=c5;} | |
63 | ||
64 | // track to vertex cut setters | |
65 | void SetMinNsigmaToVertex(Float_t sigma=1e99) {fCutNsigmaToVertex = sigma;} | |
66 | void SetRequireSigmaToVertex(Bool_t b=kTRUE ) {fCutSigmaToVertexRequired = b;} | |
67 | ||
68 | // track kinmatic cut setters | |
69 | void SetPRange(Float_t r1=0, Float_t r2=1e99) {fPMin=r1; fPMax=r2;} | |
70 | void SetPtRange(Float_t r1=0, Float_t r2=1e99) {fPtMin=r1; fPtMax=r2;} | |
71 | void SetPxRange(Float_t r1=-1e99, Float_t r2=1e99) {fPxMin=r1; fPxMax=r2;} | |
72 | void SetPyRange(Float_t r1=-1e99, Float_t r2=1e99) {fPyMin=r1; fPyMax=r2;} | |
73 | void SetPzRange(Float_t r1=-1e99, Float_t r2=1e99) {fPzMin=r1; fPzMax=r2;} | |
74 | void SetEtaRange(Float_t r1=-1e99, Float_t r2=1e99) {fEtaMin=r1; fEtaMax=r2;} | |
75 | void SetRapRange(Float_t r1=-1e99, Float_t r2=1e99) {fRapMin=r1; fRapMax=r2;} | |
76 | ||
77 | Float_t GetMinNsigmaToVertex() { return fCutNsigmaToVertex; } | |
78 | ||
79 | //###################################################### | |
80 | void SetHistogramsOn(Bool_t b=kFALSE) {fHistogramsOn = b;} | |
81 | void DefineHistograms(Int_t color=1); | |
82 | void SaveHistograms(Char_t* dir="track_selection"); | |
83 | ||
84 | Float_t GetSigmaToVertex(AliESDtrack* esdTrack); | |
85 | ||
86 | virtual void Print(const Option_t* = "") const; | |
87 | ||
88 | static void EnableNeededBranches(TTree* tree); | |
89 | ||
90 | // void SaveQualityCuts(Char_t* file) | |
91 | // void LoadQualityCuts(Char_t* file) | |
92 | ||
93 | protected: | |
94 | void Init(); // sets everything to 0 | |
95 | ||
96 | enum { kNCuts = 21 }; | |
97 | ||
98 | //###################################################### | |
99 | // esd track quality cuts | |
100 | static const Char_t* fgkCutNames[kNCuts]; //! names of cuts (for internal use) | |
101 | ||
102 | Int_t fCutMinNClusterTPC; // min number of tpc clusters | |
103 | Int_t fCutMinNClusterITS; // min number of its clusters | |
104 | ||
105 | Float_t fCutMaxChi2PerClusterTPC; // max tpc fit chi2 per tpc cluster | |
106 | Float_t fCutMaxChi2PerClusterITS; // max its fit chi2 per its cluster | |
107 | ||
108 | Float_t fCutMaxC11; // max cov. matrix diag. elements (res. y^2) | |
109 | Float_t fCutMaxC22; // max cov. matrix diag. elements (res. z^2) | |
110 | Float_t fCutMaxC33; // max cov. matrix diag. elements (res. sin(phi)^2) | |
111 | Float_t fCutMaxC44; // max cov. matrix diag. elements (res. tan(theta_dip)^2) | |
112 | Float_t fCutMaxC55; // max cov. matrix diag. elements (res. 1/pt^2) | |
113 | ||
114 | Bool_t fCutAcceptKinkDaughters; // accepting kink daughters? | |
115 | Bool_t fCutRequireTPCRefit; // require TPC refit | |
116 | Bool_t fCutRequireITSRefit; // require ITS refit | |
117 | ||
118 | // track to vertex cut | |
119 | Float_t fCutNsigmaToVertex; // max number of estimated sigma from track-to-vertex | |
120 | Bool_t fCutSigmaToVertexRequired; // cut track if sigma from track-to-vertex could not be calculated | |
121 | ||
122 | // esd kinematics cuts | |
123 | Float_t fPMin, fPMax; // definition of the range of the P | |
124 | Float_t fPtMin, fPtMax; // definition of the range of the Pt | |
125 | Float_t fPxMin, fPxMax; // definition of the range of the Px | |
126 | Float_t fPyMin, fPyMax; // definition of the range of the Py | |
127 | Float_t fPzMin, fPzMax; // definition of the range of the Pz | |
128 | Float_t fEtaMin, fEtaMax; // definition of the range of the eta | |
129 | Float_t fRapMin, fRapMax; // definition of the range of the y | |
130 | ||
131 | //###################################################### | |
132 | // diagnostics histograms | |
133 | Bool_t fHistogramsOn; // histograms on/off | |
134 | ||
135 | TH1F* fhNClustersITS[2]; //-> | |
136 | TH1F* fhNClustersTPC[2]; //-> | |
137 | ||
138 | TH1F* fhChi2PerClusterITS[2]; //-> | |
139 | TH1F* fhChi2PerClusterTPC[2]; //-> | |
140 | ||
141 | TH1F* fhC11[2]; //-> | |
142 | TH1F* fhC22[2]; //-> | |
143 | TH1F* fhC33[2]; //-> | |
144 | TH1F* fhC44[2]; //-> | |
145 | TH1F* fhC55[2]; //-> | |
146 | ||
147 | TH1F* fhDXY[2]; //-> | |
148 | TH1F* fhDZ[2]; //-> | |
149 | TH2F* fhDXYvsDZ[2]; //-> | |
150 | ||
151 | TH1F* fhDXYNormalized[2]; //-> | |
152 | TH1F* fhDZNormalized[2]; //-> | |
153 | TH2F* fhDXYvsDZNormalized[2]; //-> | |
154 | TH1F* fhNSigmaToVertex[2]; //-> | |
155 | ||
156 | TF1* ffDTheoretical; //-> theoretical distance to vertex normalized (2d gauss) | |
157 | ||
158 | TH1F* fhCutStatistics; //-> statistics of what cuts the tracks did not survive | |
159 | TH2F* fhCutCorrelation; //-> 2d statistics plot | |
160 | ||
161 | ClassDef(AliESDtrackCuts, 1) | |
162 | }; | |
163 | ||
164 | ||
165 | #endif |