account for limits of thrust variable (Sona)
[u/mrichter/AliRoot.git] / PWG4 / JetTasks / AliAnalysisHelperJetTasks.cxx
CommitLineData
f3050824 1
2#include "TROOT.h"
519378fb 3#include "TKey.h"
f3050824 4#include "TList.h"
519378fb 5#include "TSystem.h"
188a1ba9 6#include "TH1F.h"
7#include "TProfile.h"
8#include "THnSparse.h"
9#include "TFile.h"
519378fb 10#include "TString.h"
f3050824 11#include "AliMCEvent.h"
5c047edc 12#include "AliLog.h"
db6bcb0e 13#include "AliAODJet.h"
f3050824 14#include "AliStack.h"
15#include "AliGenEventHeader.h"
16#include "AliGenCocktailEventHeader.h"
17#include "AliGenPythiaEventHeader.h"
18#include <fstream>
19#include <iostream>
20#include "AliAnalysisHelperJetTasks.h"
6f3f79de 21#include "TMatrixDSym.h"
22#include "TMatrixDSymEigen.h"
23#include "TVector.h"
f3050824 24
25ClassImp(AliAnalysisHelperJetTasks)
26
27
28
29
30AliGenPythiaEventHeader* AliAnalysisHelperJetTasks::GetPythiaEventHeader(AliMCEvent *mcEvent){
31
32 AliGenEventHeader* genHeader = mcEvent->GenEventHeader();
33 AliGenPythiaEventHeader* pythiaGenHeader = dynamic_cast<AliGenPythiaEventHeader*>(genHeader);
34 if(!pythiaGenHeader){
35 // cocktail ??
36 AliGenCocktailEventHeader* genCocktailHeader = dynamic_cast<AliGenCocktailEventHeader*>(genHeader);
37
38 if (!genCocktailHeader) {
5c047edc 39 AliWarningGeneral(Form(" %s:%d",(char*)__FILE__,__LINE__),"Unknown header type (not Pythia or Cocktail)");
40 // AliWarning(Form("%s %d: Unknown header type (not Pythia or Cocktail)",(char*)__FILE__,__LINE__));
f3050824 41 return 0;
42 }
43 TList* headerList = genCocktailHeader->GetHeaders();
44 for (Int_t i=0; i<headerList->GetEntries(); i++) {
45 pythiaGenHeader = dynamic_cast<AliGenPythiaEventHeader*>(headerList->At(i));
46 if (pythiaGenHeader)
47 break;
48 }
49 if(!pythiaGenHeader){
5c047edc 50 AliWarningGeneral(Form(" %s:%d",(char*)__FILE__,__LINE__),"Pythia event header not found");
f3050824 51 return 0;
52 }
53 }
54 return pythiaGenHeader;
55
56}
57
58
59void AliAnalysisHelperJetTasks::PrintStack(AliMCEvent *mcEvent,Int_t iFirst,Int_t iLast,Int_t iMaxPrint){
60
61 AliStack *stack = mcEvent->Stack();
62 if(!stack){
63 Printf("%s%d No Stack available",(char*)__FILE__,__LINE__);
64 return;
65 }
66
67 static Int_t iCount = 0;
68 if(iCount>iMaxPrint)return;
69 Int_t nStack = stack->GetNtrack();
70 if(iLast == 0)iLast = nStack;
71 else if(iLast > nStack)iLast = nStack;
72
73
74 Printf("####################################################################");
75 for(Int_t np = iFirst;np<iLast;++np){
76 TParticle *p = stack->Particle(np);
77 Printf("Nr.%d --- Status %d ---- Mother1 %d Mother2 %d Daughter1 %d Daughter2 %d ",
78 np,p->GetStatusCode(),p->GetMother(0),p->GetMother(1),p->GetDaughter(0),p->GetDaughter(1));
79 Printf("Eta %3.3f Phi %3.3f ",p->Eta(),p->Phi());
80 p->Print();
81 Printf("---------------------------------------");
82 }
83 iCount++;
84}
85
86
db6bcb0e 87
88
3dc5a1a4 89void AliAnalysisHelperJetTasks::GetClosestJets(AliAODJet *genJets,const Int_t &kGenJets,
90 AliAODJet *recJets,const Int_t &kRecJets,
db6bcb0e 91 Int_t *iGenIndex,Int_t *iRecIndex,
92 Int_t iDebug,Float_t maxDist){
93
94 //
95 // Relate the two input jet Arrays
96 //
97
98 //
99 // The association has to be unique
100 // So check in two directions
101 // find the closest rec to a gen
102 // and check if there is no other rec which is closer
103 // Caveat: Close low energy/split jets may disturb this correlation
104
3dc5a1a4 105
db6bcb0e 106 // Idea: search in two directions generated e.g (a--e) and rec (1--3)
107 // Fill a matrix with Flags (1 for closest rec jet, 2 for closest rec jet
108 // in the end we have something like this
109 // 1 2 3
110 // ------------
111 // a| 3 2 0
112 // b| 0 1 0
113 // c| 0 0 3
114 // d| 0 0 1
115 // e| 0 0 1
116 // Topology
117 // 1 2
118 // a b
119 //
120 // d c
121 // 3 e
122 // Only entries with "3" match from both sides
3dc5a1a4 123
124 // In case we have more jets than kmaxjets only the
125 // first kmaxjets are searched
126 // all other are -1
127 // use kMaxJets for a test not to fragemnt the memory...
128
129 for(int i = 0;i < kGenJets;++i)iGenIndex[i] = -1;
130 for(int j = 0;j < kRecJets;++j)iRecIndex[j] = -1;
131
132
db6bcb0e 133
134 const int kMode = 3;
135
3dc5a1a4 136 const Int_t nGenJets = TMath::Min(kMaxJets,kGenJets);
137 const Int_t nRecJets = TMath::Min(kMaxJets,kRecJets);
db6bcb0e 138
139 if(nRecJets==0||nGenJets==0)return;
140
3dc5a1a4 141 // UShort_t *iFlag = new UShort_t[nGenJets*nRecJets];
142 UShort_t iFlag[kMaxJets*kMaxJets];
db6bcb0e 143 for(int i = 0;i < nGenJets;++i){
144 for(int j = 0;j < nRecJets;++j){
145 iFlag[i*nGenJets+j] = 0;
146 }
147 }
148
149
150
151 // find the closest distance to the generated
152 for(int ig = 0;ig<nGenJets;++ig){
153 Float_t dist = maxDist;
154 if(iDebug>1)Printf("Gen (%d) p_T %3.3f eta %3.3f ph %3.3f ",ig,genJets[ig].Pt(),genJets[ig].Eta(),genJets[ig].Phi());
155 for(int ir = 0;ir<nRecJets;++ir){
156 Double_t dR = genJets[ig].DeltaR(&recJets[ir]);
157 if(iDebug>1)Printf("Rec (%d) p_T %3.3f eta %3.3f ph %3.3f ",ir,recJets[ir].Pt(),recJets[ir].Eta(),recJets[ir].Phi());
158 if(iDebug>1)Printf("Distance (%d)--(%d) %3.3f ",ig,ir,dR);
159 if(dR<dist){
160 iRecIndex[ig] = ir;
161 dist = dR;
162 }
163 }
164 if(iRecIndex[ig]>=0)iFlag[ig*nGenJets+iRecIndex[ig]]+=1;
165 // reset...
166 iRecIndex[ig] = -1;
167 }
168 // other way around
169 for(int ir = 0;ir<nRecJets;++ir){
170 Float_t dist = maxDist;
171 for(int ig = 0;ig<nGenJets;++ig){
172 Double_t dR = genJets[ig].DeltaR(&recJets[ir]);
173 if(dR<dist){
174 iGenIndex[ir] = ig;
175 dist = dR;
176 }
177 }
178 if(iGenIndex[ir]>=0)iFlag[iGenIndex[ir]*nGenJets+ir]+=2;
179 // reset...
180 iGenIndex[ir] = -1;
181 }
182
183 // check for "true" correlations
184
185 if(iDebug>1)Printf(">>>>>> Matrix");
186
187 for(int ig = 0;ig<nGenJets;++ig){
188 for(int ir = 0;ir<nRecJets;++ir){
189 // Print
190 if(iDebug>1)printf("Flag[%d][%d] %d ",ig,ir,iFlag[ig*nGenJets+ir]);
191
192 if(kMode==3){
193 // we have a uniqie correlation
194 if(iFlag[ig*nGenJets+ir]==3){
195 iGenIndex[ir] = ig;
196 iRecIndex[ig] = ir;
197 }
198 }
199 else{
200 // we just take the correlation from on side
201 if((iFlag[ig*nGenJets+ir]&2)==2){
202 iGenIndex[ir] = ig;
203 }
204 if((iFlag[ig*nGenJets+ir]&1)==1){
205 iRecIndex[ig] = ir;
206 }
207 }
208 }
209 if(iDebug>1)printf("\n");
210 }
db6bcb0e 211}
212
213
214
188a1ba9 215void AliAnalysisHelperJetTasks::MergeOutput(char* cFiles, char* cList){
db6bcb0e 216
188a1ba9 217 // This is used to merge the analysis-output from different
218 // data samples/pt_hard bins
219 // in case the eventweigth was set to xsection/ntrials already, this
220 // is not needed. Both methods only work in case we do not mix different
221 // pt_hard bins, and do not have overlapping bins
db6bcb0e 222
188a1ba9 223 const Int_t nMaxBins = 12;
224 // LHC08q jetjet100: Mean = 1.42483e-03, RMS = 6.642e-05
225 // LHC08r jetjet50: Mean = 2.44068e-02, RMS = 1.144e-03
226 // LHC08v jetjet15-50: Mean = 2.168291 , RMS = 7.119e-02
227 // const Float_t xsection[nBins] = {2.168291,2.44068e-02};
228
229 Float_t xsection[nMaxBins];
230 Float_t nTrials[nMaxBins];
231 Float_t sf[nMaxBins];
232 TList *lIn[nMaxBins];
233 TFile *fIn[nMaxBins];
234
235 ifstream in1;
236 in1.open(cFiles);
237
238 char cFile[120];
239 Int_t ibTotal = 0;
240 while(in1>>cFile){
241 fIn[ibTotal] = TFile::Open(cFile);
242 lIn[ibTotal] = (TList*)fIn[ibTotal]->Get(cList);
5c047edc 243 Printf("Merging file %s",cFile);
188a1ba9 244 if(!lIn[ibTotal]){
245 Printf("%s:%d No list %s found, exiting...",__FILE__,__LINE__,cList);
246 fIn[ibTotal]->ls();
247 return;
248 }
249 TH1* hTrials = (TH1F*)lIn[ibTotal]->FindObject("fh1Trials");
250 if(!hTrials){
251 Printf("%s:%d fh1PtHard_Trials not found in list, exiting...",__FILE__,__LINE__);
252 return;
253 }
254 TProfile* hXsec = (TProfile*)lIn[ibTotal]->FindObject("fh1Xsec");
255 if(!hXsec){
256 Printf("%s:%d fh1Xsec not found in list, exiting...",__FILE__,__LINE__);
257 return;
258 }
259 xsection[ibTotal] = hXsec->GetBinContent(1);
260 nTrials[ibTotal] = hTrials->Integral();
261 sf[ibTotal] = xsection[ibTotal]/ nTrials[ibTotal];
262 ibTotal++;
263 }
264
265 if(ibTotal==0){
266 Printf("%s:%d No files found for mergin, exiting",__FILE__,__LINE__);
267 return;
268 }
269
270 TFile *fOut = new TFile("allpt.root","RECREATE");
271 TList *lOut = new TList();
272 lOut->SetName(lIn[0]->GetName());
273 // for the start scale all...
274 for(int ie = 0; ie < lIn[0]->GetEntries();++ie){
275 TH1 *h1Add = 0;
276 THnSparse *hnAdd = 0;
277 for(int ib = 0;ib < ibTotal;++ib){
278 // dynamic cast does not work with cint
279 TObject *h = lIn[ib]->At(ie);
280 if(h->InheritsFrom("TH1")){
281 TH1 *h1 = (TH1*)h;
282 if(ib==0){
283 h1Add = (TH1*)h1->Clone(h1->GetName());
284 h1Add->Scale(sf[ib]);
285 }
286 else{
287 h1Add->Add(h1,sf[ib]);
288 }
289 }
290 else if(h->InheritsFrom("THnSparse")){
291 THnSparse *hn = (THnSparse*)h;
292 if(ib==0){
293 hnAdd = (THnSparse*)hn->Clone(hn->GetName());
294 hnAdd->Scale(sf[ib]);
295 }
296 else{
297 hnAdd->Add(hn,sf[ib]);
298 }
299 }
300
301
302 }// ib
303 if(h1Add)lOut->Add(h1Add);
304 else if(hnAdd)lOut->Add(hnAdd);
305 }
306 fOut->cd();
307 lOut->Write(lOut->GetName(),TObject::kSingleKey);
308 fOut->Close();
309}
519378fb 310
311Bool_t AliAnalysisHelperJetTasks::PythiaInfoFromFile(const char* currFile,Float_t &fXsec,Float_t &fTrials){
312 //
313 // get the cross section and the trails either from pyxsec.root or from pysec_hists.root
314 // This is to called in Notify and should provide the path to the AOD/ESD file
315
316 TString file(currFile);
317 fXsec = 0;
318 fTrials = 1;
319
320 if(file.Contains("root_archive.zip#")){
321 Ssiz_t pos1 = file.Index("root_archive",12,TString::kExact);
322 Ssiz_t pos = file.Index("#",1,pos1,TString::kExact);
323 file.Replace(pos+1,20,"");
324 }
325 else {
326 // not an archive take the basename....
327 file.ReplaceAll(gSystem->BaseName(file.Data()),"");
328 }
329 Printf("%s",file.Data());
330
331
332
333
334 TFile *fxsec = TFile::Open(Form("%s%s",file.Data(),"pyxsec.root")); // problem that we cannot really test the existance of a file in a archive so we have to lvie with open error message from root
335 if(!fxsec){
336 // next trial fetch the histgram file
337 fxsec = TFile::Open(Form("%s%s",file.Data(),"pyxsec_hists.root"));
338 if(!fxsec){
339 // not a severe condition but inciate that we have no information
340 return kFALSE;
341 }
342 else{
343 // find the tlist we want to be independtent of the name so use the Tkey
344 TKey* key = (TKey*)fxsec->GetListOfKeys()->At(0);
345 if(!key){
346 fxsec->Close();
347 return kFALSE;
348 }
349 TList *list = dynamic_cast<TList*>(key->ReadObj());
350 if(!list){
351 fxsec->Close();
352 return kFALSE;
353 }
354 fXsec = ((TProfile*)list->FindObject("h1Xsec"))->GetBinContent(1);
355 fTrials = ((TH1F*)list->FindObject("h1Trials"))->GetBinContent(1);
356 fxsec->Close();
357 }
358 } // no tree pyxsec.root
359 else {
360 TTree *xtree = (TTree*)fxsec->Get("Xsection");
361 if(!xtree){
362 fxsec->Close();
363 return kFALSE;
364 }
365 UInt_t ntrials = 0;
366 Double_t xsection = 0;
367 xtree->SetBranchAddress("xsection",&xsection);
368 xtree->SetBranchAddress("ntrials",&ntrials);
369 xtree->GetEntry(0);
370 fTrials = ntrials;
371 fXsec = xsection;
372 fxsec->Close();
373 }
374 return kTRUE;
375}
6f3f79de 376
6f3f79de 377//___________________________________________________________________________________________________________
378
379Bool_t AliAnalysisHelperJetTasks::GetEventShapes(TVector3 &n01, TVector3 * pTrack, Int_t nTracks, Double_t * eventShapes)
380{
381 // ***
382 // Event shape calculation
383 // sona.pochybova@cern.ch
384
385 const Int_t kTracks = 1000;
386 if(nTracks>kTracks)return kFALSE;
387
20d01a2f 388 //variables for thrust calculation
6f3f79de 389 TVector3 pTrackPerp[kTracks];
6f3f79de 390 Double_t psum2 = 0;
20d01a2f 391
392 TVector3 psum;
393 TVector3 psum02;
394 TVector3 psum03;
395
396 Double_t psum1 = 0;
397 Double_t psum102 = 0;
398 Double_t psum103 = 0;
399
6f3f79de 400 Double_t thrust[kTracks];
401 Double_t th = -3;
20d01a2f 402 Double_t thrust02[kTracks];
403 Double_t th02 = -4;
404 Double_t thrust03[kTracks];
405 Double_t th03 = -5;
6f3f79de 406
20d01a2f 407 //Sphericity calculation variables
6f3f79de 408 TMatrixDSym m(3);
409 Double_t s00 = 0;
410 Double_t s01 = 0;
411 Double_t s02 = 0;
412
413 Double_t s10 = 0;
414 Double_t s11 = 0;
415 Double_t s12 = 0;
416
417 Double_t s20 = 0;
418 Double_t s21 = 0;
419 Double_t s22 = 0;
420
421 Double_t ptot = 0;
422
423 Double_t c = -10;
424
425//
426//loop for thrust calculation
427//
20d01a2f 428
429 for(Int_t i = 0; i < nTracks; i++)
430 {
431 pTrackPerp[i].SetXYZ(pTrack[i].X(), pTrack[i].Y(), 0);
432 psum2 += pTrackPerp[i].Mag();
433 }
434
435 //additional starting axis
436 TVector3 n02;
437 n02 = pTrack[1].Unit();
438 n02.SetZ(0.);
439 TVector3 n03;
440 n03 = pTrack[2].Unit();
441 n03.SetZ(0.);
442
443 //switches for calculating thrust for different starting points
444 Int_t switch1 = 1;
445 Int_t switch2 = 1;
446 Int_t switch3 = 1;
447
448 //indexes for iteration of different starting points
449 Int_t l1 = 0;
450 Int_t l2 = 0;
451 Int_t l3 = 0;
452
453 //maximal number of iterations
454 // Int_t nMaxIter = 100;
455
456 for(Int_t k = 0; k < nTracks; k++)
6f3f79de 457 {
6f3f79de 458
20d01a2f 459 if(switch1 == 1){
460 psum.SetXYZ(0., 0., 0.);
461 psum1 = 0;
462 for(Int_t i = 0; i < nTracks; i++)
463 {
464 psum1 += (TMath::Abs(n01.Dot(pTrackPerp[i])));
465 if (n01.Dot(pTrackPerp[i]) > 0) psum += pTrackPerp[i];
466 if (n01.Dot(pTrackPerp[i]) < 0) psum -= pTrackPerp[i];
467 }
468 thrust[l1] = psum1/psum2;
469 }
470
471 if(switch2 == 1){
472 psum02.SetXYZ(0., 0., 0.);
473 psum102 = 0;
474 for(Int_t i = 0; i < nTracks; i++)
475 {
476 psum102 += (TMath::Abs(n02.Dot(pTrackPerp[i])));
477 if (n02.Dot(pTrackPerp[i]) > 0) psum02 += pTrackPerp[i];
478 if (n02.Dot(pTrackPerp[i]) < 0) psum02 -= pTrackPerp[i];
479 }
480 thrust02[l2] = psum102/psum2;
481 }
482
483 if(switch3 == 1){
484 psum03.SetXYZ(0., 0., 0.);
485 psum103 = 0;
486 for(Int_t i = 0; i < nTracks; i++)
487 {
488 psum103 += (TMath::Abs(n03.Dot(pTrackPerp[i])));
489 if (n03.Dot(pTrackPerp[i]) > 0) psum03 += pTrackPerp[i];
490 if (n03.Dot(pTrackPerp[i]) < 0) psum03 -= pTrackPerp[i];
491 }
492 thrust03[l3] = psum103/psum2;
493 }
494
495 //check whether thrust value converged
496 if(TMath::Abs(th-thrust[l1]) < 10e-7){
497 switch1 = 0;
498 }
499
500 if(TMath::Abs(th02-thrust02[l2]) < 10e-7){
501 switch2 = 0;
502 }
503
504 if(TMath::Abs(th03-thrust03[l3]) < 10e-7){
505 switch3 = 0;
506 }
507
508 //if it didn't, continue with the calculation
509 if(switch1 == 1){
510 th = thrust[l1];
511 n01 = psum.Unit();
512 l1++;
513 }
514
515 if(switch2 == 1){
516 th02 = thrust02[l2];
517 n02 = psum02.Unit();
518 l2++;
519 }
520
521 if(switch3 == 1){
522 th03 = thrust03[l3];
523 n03 = psum03.Unit();
524 l3++;
525 }
526
527 //if thrust values for all starting direction converged check if to the same value
528 if(switch2 == 0 && switch1 == 0 && switch3 == 0){
529 if(TMath::Abs(th-th02) < 10e-7 && TMath::Abs(th-th03) < 10e-7 && TMath::Abs(th02-th03) < 10e-7){
530 eventShapes[0] = th;
531 Printf("===== THRUST VALUE FOUND AT %d :: %f\n", k, th);
532 break;
533 }
534 //if they did not, reset switches
535 else{
536 switch1 = 1;
537 // th = -1.;
538 switch2 = 1;
539 // th02 = -2.;
540 switch3 = 1;
541 // th03 = -4.;
542 }
543 }
544
545 // Printf("========== %d +++ th :: %f=============\n", l1, th);
546 // Printf("========== %d +++ th2 :: %f=============\n", l2, th02);
547 // Printf("========== %d +++ th3 :: %f=============\n", l3, th03);
6f3f79de 548
6f3f79de 549 }
550
20d01a2f 551 //if no common limitng value was found, take the maximum and take the corresponding thrust axis
552 if(switch1 == 1 && switch2 == 1 && switch3 == 1){
553 eventShapes[0] = TMath::Max(thrust[l1-1], thrust02[l2-1]);
554 eventShapes[0] = TMath::Max(eventShapes[0], thrust03[l3-1]);
555 if(TMath::Abs(eventShapes[0]-thrust[l1-1]) < 10e-7)
556 n01 = n01;
557 if(TMath::Abs(eventShapes[0]-thrust02[l2-1]) < 10e-7)
558 n01 = n02;
559 if(TMath::Abs(eventShapes[0]-thrust03[l3-1]) < 10e-7)
560 n01 = n03;
561 Printf("NO LIMITING VALUE FOUND :: MAXIMUM = %f\n", eventShapes[0]);
562 }
6f3f79de 563
564//
565//other event shapes variables
566//
567 for(Int_t j = 0; j < nTracks; j++)
568 {
569 s00 = s00 + (pTrack[j].Px()*pTrack[j].Px())/pTrack[j].Mag();
570 s01 = s01 + (pTrack[j].Px()*pTrack[j].Py())/pTrack[j].Mag();
571 s02 = s02 + (pTrack[j].Px()*pTrack[j].Pz())/pTrack[j].Mag();
572
573 s10 = s10 + (pTrack[j].Py()*pTrack[j].Px())/pTrack[j].Mag();
574 s11 = s11 + (pTrack[j].Py()*pTrack[j].Py())/pTrack[j].Mag();
575 s12 = s12 + (pTrack[j].Py()*pTrack[j].Pz())/pTrack[j].Mag();
576
577 s20 = s20 + (pTrack[j].Pz()*pTrack[j].Px())/pTrack[j].Mag();
578 s21 = s21 + (pTrack[j].Pz()*pTrack[j].Py())/pTrack[j].Mag();
579 s22 = s22 + (pTrack[j].Pz()*pTrack[j].Pz())/pTrack[j].Mag();
580
581 ptot += pTrack[j].Mag();
582 }
583
584 if(ptot > 0.)
585 {
586 m(0,0) = s00/ptot;
587 m(0,1) = s01/ptot;
588 m(0,2) = s02/ptot;
589
590 m(1,0) = s10/ptot;
591 m(1,1) = s11/ptot;
592 m(1,2) = s12/ptot;
593
594 m(2,0) = s20/ptot;
595 m(2,1) = s21/ptot;
596 m(2,2) = s22/ptot;
597
598 TMatrixDSymEigen eigen(m);
599 TVectorD eigenVal = eigen.GetEigenValues();
600
601 Double_t sphericity = (3/2)*(eigenVal(2)+eigenVal(1));
602 eventShapes[1] = sphericity;
603
604 Double_t aplanarity = (3/2)*(eigenVal(2));
605 eventShapes[2] = aplanarity;
606
607 c = 3*(eigenVal(0)*eigenVal(1)+eigenVal(0)*eigenVal(2)+eigenVal(1)*eigenVal(2));
608 eventShapes[3] = c;
609 }
610 return kTRUE;
611}
612
613
614
615 //__________________________________________________________________________________________________________________________