1 /**************************************************************************
2 * This file is property of and copyright by the ALICE HLT Project *
3 * ALICE Experiment at CERN, All rights reserved. *
5 * Primary Author: Svein Lindal <slindal@fys.uio.no> *
7 * Permission to use, copy, modify and distribute this software and its *
8 * documentation strictly for non-commercial purposes is hereby granted *
9 * without fee, provided that the above copyright notice appears in all *
10 * copies and that both the copyright notice and this permission notice *
11 * appear in the supporting documentation. The authors make no claims *
12 * about the suitability of this software for any purpose. It is *
13 * provided "as is" without express or implied warranty. *
14 **************************************************************************/
16 /// @file AliConversionTrackCuts.cxx
17 /// @author Svein Lindal
18 /// @brief Base class for analysation of conversion particle - track correlations
21 #include "AliConversionTrackCuts.h"
22 //#include "AliAODTrack.h"
23 #include "AliAODEvent.h"
30 ClassImp(AliConversionTrackCuts)
33 const char* AliConversionTrackCuts::fgkCutNames[AliConversionTrackCuts::kNCuts] = {
46 //________________________________________________________________________
47 AliConversionTrackCuts::AliConversionTrackCuts() :
51 fRejectKinkDaughters(kTRUE),
63 fTPCClusOverFindable(0.0),
65 fAODTestFilterBit(-1),
66 fRequireTPCRefit(kFALSE),
77 //________________________________________________________________________
78 AliConversionTrackCuts::AliConversionTrackCuts(TString name, TString title = "title") :
79 AliAnalysisCuts(name, title),
82 fRejectKinkDaughters(kTRUE),
95 fAODTestFilterBit(-1),
96 fRequireTPCRefit(kFALSE),
108 //________________________________________________________________________________
109 AliConversionTrackCuts::~AliConversionTrackCuts() {
112 // delete fHistograms;
113 // fHistograms = NULL;
117 TList * AliConversionTrackCuts::CreateHistograms() {
118 //Create the histograms
119 if(!fHistograms) fHistograms = new TList();
121 fHistograms->SetOwner(kTRUE);
122 fHistograms->SetName("trackCuts");
124 fhPhi = new TH2F("phi", "phi", kNCuts+2, kPreCut -0.5, kNCuts + 0.5,
125 128, 0, TMath::TwoPi());
126 TAxis * xax = fhPhi->GetXaxis();
127 for(Int_t i = 0; i < kNCuts; i++){
128 xax->SetBinLabel(xax->FindFixBin(i), fgkCutNames[i]);
130 fHistograms->Add(fhPhi);
134 fhPt = new TH2F("pt", "pt", kNCuts+2, kPreCut -0.5, kNCuts + 0.5,
136 xax = fhPt->GetXaxis();
137 for(Int_t i = 0; i < kNCuts; i++){
138 xax->SetBinLabel(xax->FindFixBin(i), fgkCutNames[i]);
140 fHistograms->Add(fhPt);
142 fhPhiPt = new TH2F("phipt", "phipt", 100, 0, 100, 64, 0, TMath::TwoPi());
143 fHistograms->Add(fhPhiPt);
145 fhdcaxyPt = new TH2F("dcaxypt", "dcaxypt", 100, 0, 100, 100, 0, 100);
146 fHistograms->Add(fhdcaxyPt);
148 fhdcazPt = new TH2F("dcazpt", "dcazpt", 100, 0, 100, 100, 0, 100);
149 fHistograms->Add(fhdcazPt);
151 fhnclpt = new TH2F("nclstpcvspt", "nclstpcvspt", 100, 0, 100, 100, 0, 100);
152 fHistograms->Add(fhnclpt);
154 fhnclsfpt = new TH2F("nclsfpt", "nclsfpt", 100, 0, 100, 100, 0, 1.2);
155 fHistograms->Add(fhnclsfpt);
161 void AliConversionTrackCuts::FillHistograms(Int_t cutIndex, AliVTrack * track, Bool_t passed = kFALSE) {
163 fhPhi->Fill(cutIndex, track->Phi());
164 fhPt->Fill(cutIndex, track->Pt());
165 if(passed) fhPhiPt->Fill(track->Pt(), track->Phi());
169 Bool_t AliConversionTrackCuts::AcceptTrack(AliAODTrack * track) {
172 fhdcaxyPt->Fill(track->Pt(), TMath::Sqrt(track->XAtDCA()*track->XAtDCA() + track->YAtDCA()*track->YAtDCA()));
173 fhdcazPt->Fill(track->Pt(), TMath::Abs(track->ZAtDCA()));
175 fhnclpt->Fill(track->Pt(), track->GetTPCNcls());
176 if(track->GetTPCNclsF() > 0) fhnclsfpt->Fill(track->Pt(), ((Double_t) track->GetTPCNcls())/track->GetTPCNclsF());
179 FillHistograms(kPreCut, track);
181 if (track->GetTPCNcls() < fTPCminNClusters) return kFALSE;
182 FillHistograms(kCutNcls, track);
184 Double_t foundclusters = 0.0001;
185 if(track->GetTPCNclsF() > 0) foundclusters = ( (Double_t) track->GetTPCNcls() )/track->GetTPCNclsF();
186 if (foundclusters < fTPCClusOverFindable) return kFALSE;
187 FillHistograms(kCutNclsFrac, track);
189 if (track->Chi2perNDF() > fTPCmaxChi2) return kFALSE;
190 FillHistograms(kCutNDF, track);
192 AliAODVertex *vertex = track->GetProdVertex();
193 if (vertex && fRejectKinkDaughters) {
194 if (vertex->GetType() == AliAODVertex::kKink) {
198 FillHistograms(kCutKinc, track);
200 if(TMath::Abs(track->ZAtDCA()) > fDCAZmax) {
203 FillHistograms(kCutDCAZ, track);
206 Float_t xatdca = track->XAtDCA();
207 Float_t yatdca = track->YAtDCA();
208 Float_t xy = xatdca*xatdca + yatdca*yatdca;
210 AliDebug(AliLog::kDebug + 2, "Kink daughter. Rejected");
213 FillHistograms(kCutDCAXY, track);
215 ULong_t status = track->GetStatus();
216 if (fRequireTPCRefit && (status&AliESDtrack::kTPCrefit) == 0) {
217 AliDebug(AliLog::kDebug + 2, "Kink daughter. Rejected");
220 FillHistograms(kCutTPCRefit, track);
222 FillHistograms(kNCuts, track, kTRUE);
226 // void AliConversionTrackCuts::SetUpAxes() {
228 // fCutAxis.Set(kNCuts + 1, -1.5, kNCuts -0.5);
229 // fCutAxis.SetAxisLabel(-1, "track in");
230 // for (Int_t i = 0; i < kNCuts; i++) {
231 // fCutAxis.SetAxisLabel(i, fgkCutNames[i]);
233 // for(Int_t i = 0, i < kNCuts; i++) {
238 //_________________________________________________________________________________________________
239 void AliConversionTrackCuts::Print(const Option_t *) const
242 // Print information on this cut
245 printf("Cut name : %s \n", GetName());
246 printf("Kink daughters are : %s \n", (fRejectKinkDaughters ? "rejected" : "accepted"));
247 printf("TPC requirements : clusters/findable %f, min. cluster = %d, max chi2 = %f, %s require refit\n", fTPCClusOverFindable, fTPCminNClusters, fTPCmaxChi2, (fRequireTPCRefit) ? "" : "Don't");
248 printf("ITS requirements : min. cluster = %d (all), %d (SPD), max chi2 = %f \n", fITSminNClusters, fSPDminNClusters, fITSmaxChi2);
249 printf("DCA z cut : fixed to %f cm \n", fDCAZmax);
250 printf("DCA xy cut : fixed to %f cm \n", fDCAXYmax);