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),
79 //________________________________________________________________________
80 AliConversionTrackCuts::AliConversionTrackCuts(TString name, TString title = "title") :
81 AliAnalysisCuts(name, title),
84 fRejectKinkDaughters(kTRUE),
96 fTPCClusOverFindable(0.0),
98 fAODTestFilterBit(-1),
99 fRequireTPCRefit(kFALSE),
114 //________________________________________________________________________________
115 AliConversionTrackCuts::~AliConversionTrackCuts() {
118 // delete fHistograms;
119 // fHistograms = NULL;
123 TList * AliConversionTrackCuts::CreateHistograms() {
124 //Create the histograms
125 if(!fHistograms) fHistograms = new TList();
127 fHistograms->SetOwner(kTRUE);
128 fHistograms->SetName("trackCuts");
130 fhPhi = new TH2F("phi", "phi", kNCuts+2, kPreCut -0.5, kNCuts + 0.5,
131 128, 0, TMath::TwoPi());
132 TAxis * xax = fhPhi->GetXaxis();
133 for(Int_t i = 0; i < kNCuts; i++){
134 xax->SetBinLabel(xax->FindFixBin(i), fgkCutNames[i]);
136 fHistograms->Add(fhPhi);
140 fhPt = new TH2F("pt", "pt", kNCuts+2, kPreCut -0.5, kNCuts + 0.5,
142 xax = fhPt->GetXaxis();
143 for(Int_t i = 0; i < kNCuts; i++){
144 xax->SetBinLabel(xax->FindFixBin(i), fgkCutNames[i]);
146 fHistograms->Add(fhPt);
148 fhPhiPt = new TH2F("phipt", "phipt", 100, 0, 100, 64, 0, TMath::TwoPi());
149 fHistograms->Add(fhPhiPt);
151 fhdcaxyPt = new TH2F("dcaxypt", "dcaxypt", 100, 0, 100, 100, 0, 100);
152 fHistograms->Add(fhdcaxyPt);
154 fhdcazPt = new TH2F("dcazpt", "dcazpt", 100, 0, 100, 100, 0, 100);
155 fHistograms->Add(fhdcazPt);
157 fhnclpt = new TH2F("nclstpcvspt", "nclstpcvspt", 100, 0, 100, 100, 0, 100);
158 fHistograms->Add(fhnclpt);
160 fhnclsfpt = new TH2F("nclsfpt", "nclsfpt", 100, 0, 100, 100, 0, 1.2);
161 fHistograms->Add(fhnclsfpt);
167 void AliConversionTrackCuts::FillHistograms(Int_t cutIndex, AliVTrack * track, Bool_t passed = kFALSE) {
169 fhPhi->Fill(cutIndex, track->Phi());
170 fhPt->Fill(cutIndex, track->Pt());
171 if(passed) fhPhiPt->Fill(track->Pt(), track->Phi());
175 Bool_t AliConversionTrackCuts::AcceptTrack(AliAODTrack * track) {
178 fhdcaxyPt->Fill(track->Pt(), TMath::Sqrt(track->XAtDCA()*track->XAtDCA() + track->YAtDCA()*track->YAtDCA()));
179 fhdcazPt->Fill(track->Pt(), TMath::Abs(track->ZAtDCA()));
181 fhnclpt->Fill(track->Pt(), track->GetTPCNcls());
182 if(track->GetTPCNclsF() > 0) fhnclsfpt->Fill(track->Pt(), ((Double_t) track->GetTPCNcls())/track->GetTPCNclsF());
185 FillHistograms(kPreCut, track);
187 if (track->GetTPCNcls() < fTPCminNClusters) return kFALSE;
188 FillHistograms(kCutNcls, track);
190 Double_t foundclusters = 0.0001;
191 if(track->GetTPCNclsF() > 0) foundclusters = ( (Double_t) track->GetTPCNcls() )/track->GetTPCNclsF();
192 if (foundclusters < fTPCClusOverFindable) return kFALSE;
193 FillHistograms(kCutNclsFrac, track);
195 if (track->Chi2perNDF() > fTPCmaxChi2) return kFALSE;
196 FillHistograms(kCutNDF, track);
198 AliAODVertex *vertex = track->GetProdVertex();
199 if (vertex && fRejectKinkDaughters) {
200 if (vertex->GetType() == AliAODVertex::kKink) {
204 FillHistograms(kCutKinc, track);
206 if(TMath::Abs(track->ZAtDCA()) > fDCAZmax) {
209 FillHistograms(kCutDCAZ, track);
212 Float_t xatdca = track->XAtDCA();
213 Float_t yatdca = track->YAtDCA();
214 Float_t xy = xatdca*xatdca + yatdca*yatdca;
216 AliDebug(AliLog::kDebug + 2, "Kink daughter. Rejected");
219 FillHistograms(kCutDCAXY, track);
221 ULong_t status = track->GetStatus();
222 if (fRequireTPCRefit && (status&AliESDtrack::kTPCrefit) == 0) {
223 AliDebug(AliLog::kDebug + 2, "Kink daughter. Rejected");
226 FillHistograms(kCutTPCRefit, track);
228 FillHistograms(kNCuts, track, kTRUE);
232 // void AliConversionTrackCuts::SetUpAxes() {
234 // fCutAxis.Set(kNCuts + 1, -1.5, kNCuts -0.5);
235 // fCutAxis.SetAxisLabel(-1, "track in");
236 // for (Int_t i = 0; i < kNCuts; i++) {
237 // fCutAxis.SetAxisLabel(i, fgkCutNames[i]);
239 // for(Int_t i = 0, i < kNCuts; i++) {
244 //_________________________________________________________________________________________________
245 void AliConversionTrackCuts::Print(const Option_t *) const
248 // Print information on this cut
251 printf("Cut name : %s \n", GetName());
252 printf("Kink daughters are : %s \n", (fRejectKinkDaughters ? "rejected" : "accepted"));
253 printf("TPC requirements : clusters/findable %f, min. cluster = %d, max chi2 = %f, %s require refit\n", fTPCClusOverFindable, fTPCminNClusters, fTPCmaxChi2, (fRequireTPCRefit) ? "" : "Don't");
254 printf("ITS requirements : min. cluster = %d (all), %d (SPD), max chi2 = %f \n", fITSminNClusters, fSPDminNClusters, fITSmaxChi2);
255 printf("DCA z cut : fixed to %f cm \n", fDCAZmax);
256 printf("DCA xy cut : fixed to %f cm \n", fDCAXYmax);