AliPhysics  720d1f3 (720d1f3)
 All Classes Namespaces Files Functions Variables Typedefs Enumerations Enumerator Friends Macros Groups Pages
AliMTRChEffAnalysis.cxx
Go to the documentation of this file.
1 /**************************************************************************
2  * Copyright(c) 1998-2007, ALICE Experiment at CERN, All rights reserved. *
3  * *
4  * Author: The ALICE Off-line Project. *
5  * Contributors are mentioned in the code where appropriate. *
6  * *
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  **************************************************************************/
15 
16 #include "AliMTRChEffAnalysis.h"
17 
18 // ROOT includes
19 #include <Riostream.h>
20 #include "TObjString.h"
21 #include "TObjArray.h"
22 #include "TList.h"
23 #include "TSystem.h"
24 #include "TROOT.h"
25 #include "TRegexp.h"
26 #include "TFile.h"
27 #include "TDirectory.h"
28 #include "TTree.h"
29 #include "TKey.h"
30 #include "TArrayI.h"
31 #include "TArrayD.h"
32 #include "TGrid.h"
33 #include "TGridResult.h"
34 #include "TGraphAsymmErrors.h"
35 #include "TH1.h"
36 #include "TH2.h"
37 #include "TAxis.h"
38 #include "TF1.h"
39 #include "TMath.h"
40 #include "TCanvas.h"
41 #include "TLegend.h"
42 #include "TLine.h"
43 #include "TLatex.h"
44 #include "TFileMerger.h"
45 #include "TFitResultPtr.h"
46 
47 #include "AliLog.h"
48 #include "AliMergeableCollection.h"
49 #include "AliCounterCollection.h"
50 
51 #include "AliAnalysisMuonUtility.h"
52 #include "AliTrigChEffOutput.h"
53 
54 #include "AliCDBManager.h"
55 #include "AliCDBStorage.h"
56 #include "AliCDBId.h"
57 #include "AliCDBEntry.h"
58 #include "AliMUONCDB.h"
59 #include "AliMUONTriggerEfficiencyCells.h"
60 
62 ClassImp(AliMTRChEffAnalysis) // Class implementation in ROOT context
64 
65 using std::cout;
66 using std::endl;
67 using std::cin;
68 using std::ofstream;
69 using std::ifstream;
70 
71 //________________________________________________________________________
73  TObject(),
74  fConditions(0x0),
75  fNamer(0x0)
76 {
78 
79 }
80 
81 //________________________________________________________________________
82 AliMTRChEffAnalysis::AliMTRChEffAnalysis ( const char *localFileList, const char* outputName ) :
83  TObject(),
84  fConditions(0x0),
85  fNamer(0x0)
86 {
88  SetOutList(localFileList,outputName);
89 }
90 
91 //________________________________________________________________________
93 {
94  //
96  //
97  delete fConditions;
98  delete fNamer;
99  for ( AliMTRChEffAnalysis::AliMTRChEffInnerObj* obj : fRunMap ) delete obj;
100  for ( AliMTRChEffAnalysis::AliMTRChEffInnerObj* obj : fMergedMap ) delete obj;
101 }
102 
103 //________________________________________________________________________
104 Bool_t AliMTRChEffAnalysis::AddSystematicCondition ( const char* physSel, const char* trigClassName, const char* centrality, Int_t itrackSel, Int_t imatch, Int_t imethod )
105 {
107  return SetCondition(physSel, trigClassName, centrality, itrackSel, imatch, imethod, kFALSE);
108 }
109 
110 //________________________________________________________________________
111 Bool_t AliMTRChEffAnalysis::AddToList ( const char *filename, const char *outputName )
112 {
114  AliTrigChEffOutput* trigOut = new AliTrigChEffOutput(filename,outputName);
115  if ( ! trigOut->GetMergeableCollection() ) {
116  AliError(Form("Cannot find %s in %s",outputName,filename));
117  return kFALSE;
118  }
119 
120  TObjArray* condition = static_cast<TObjArray*>(fConditions->At(0));
121 
122 // // Delete counter collection to save memory
123 // trigOut->RemoveFromList(trigOut->GetCounterCollection());
124  // Just keep counter and mergeable collections
125  TList* effHistoList = GetEffHistoList(trigOut,condition);
126 // effHistoList->SetName(filename);
127  Int_t runNum = AliAnalysisMuonUtility::GetRunNumber(filename);
128 // effHistoList->SetUniqueID(currRun.Atoi());
129 
131  Int_t idxFromRun = GetIndexFromRun(runNum);
132  if ( idxFromRun >= 0 ) obj = fRunMap[idxFromRun];
133  else {
134  obj = new AliMTRChEffAnalysis::AliMTRChEffInnerObj(filename,outputName,runNum);
135  obj->SetUniqueID(fRunMap.size());
136  fRunMap.push_back(obj);
137  }
138 
139  obj->AddEffHistoList(condition->GetName(), effHistoList);
140 
141 
142  delete trigOut;
143  return kTRUE;
144 }
145 
146 //________________________________________________________________________
148 {
150 
151  // FIXME: ugly and hardcoded, but avoid loading the mapping
152 
153  TArrayI boards;
154  if ( irpc == 0 || irpc == 9 ) {
155  Int_t arr[] = {26,27,28,29,48,49,50,51,68,69,84,85,100,101,113};
156  Int_t nBoards = sizeof(arr)/sizeof(arr[0]);
157  boards.Set(nBoards,arr);
158  if ( irpc == 9 )
159  for ( Int_t iboard=0; iboard<nBoards; iboard++ ) boards[iboard] += 117;
160  }
161  else if ( irpc == 1 || irpc == 8 ) {
162  Int_t arr[] = {9,10,11,30,31,32,33,52,53,54,55,70,71,86,87,102,103,114};
163  Int_t nBoards = sizeof(arr)/sizeof(arr[0]);
164  boards.Set(nBoards,arr);
165  if ( irpc == 8 )
166  for ( Int_t iboard=0; iboard<nBoards; iboard++ ) boards[iboard] += 117;
167  }
168  else if ( irpc == 2 || irpc == 7 ) {
169  Int_t arr[] = {12,13,34,35,56,57,72,73,88,89,104,105,115};
170  Int_t nBoards = sizeof(arr)/sizeof(arr[0]);
171  boards.Set(nBoards,arr);
172  if ( irpc == 7 )
173  for ( Int_t iboard=0; iboard<nBoards; iboard++ ) boards[iboard] += 117;
174  }
175  else if ( irpc == 3 || irpc == 6 ) {
176  Int_t arr[] = {14,15,36,37,58,59,74,75,90,91,106,107,116};
177  Int_t nBoards = sizeof(arr)/sizeof(arr[0]);
178  boards.Set(nBoards,arr);
179  if ( irpc == 6 )
180  for ( Int_t iboard=0; iboard<nBoards; iboard++ ) boards[iboard] += 117;
181  }
182  else if ( irpc == 4 || irpc == 5 ) {
183  Int_t arr[] = {16,38,60,76,92,108,117};
184  Int_t nBoards = sizeof(arr)/sizeof(arr[0]);
185  boards.Set(nBoards,arr);
186  if ( irpc == 5 )
187  for ( Int_t iboard=0; iboard<nBoards; iboard++ ) boards[iboard] += 117;
188  }
189  else if ( irpc == 17 || irpc == 10 ) {
190  Int_t arr[] = {6,7,8,22,23,24,25,44,45,46,47,66,67,82,83,98,99,112};
191  Int_t nBoards = sizeof(arr)/sizeof(arr[0]);
192  boards.Set(nBoards,arr);
193  if ( irpc == 10 )
194  for ( Int_t iboard=0; iboard<nBoards; iboard++ ) boards[iboard] += 117;
195  }
196  else if ( irpc == 16 || irpc == 11 ) {
197  Int_t arr[] = {4,5,20,21,42,43,64,65,80,81,96,97,111};
198  Int_t nBoards = sizeof(arr)/sizeof(arr[0]);
199  boards.Set(nBoards,arr);
200  if ( irpc == 11 )
201  for ( Int_t iboard=0; iboard<nBoards; iboard++ ) boards[iboard] += 117;
202  }
203  else if ( irpc == 15 || irpc == 12 ) {
204  Int_t arr[] = {2,3,18,19,40,41,62,63,78,79,94,95,110};
205  Int_t nBoards = sizeof(arr)/sizeof(arr[0]);
206  boards.Set(nBoards,arr);
207  if ( irpc == 12 )
208  for ( Int_t iboard=0; iboard<nBoards; iboard++ ) boards[iboard] += 117;
209  }
210  else if ( irpc == 14 || irpc == 13 ) {
211  Int_t arr[] = {1,17,39,61,77,93,109};
212  Int_t nBoards = sizeof(arr)/sizeof(arr[0]);
213  boards.Set(nBoards,arr);
214  if ( irpc == 13 )
215  for ( Int_t iboard=0; iboard<nBoards; iboard++ ) boards[iboard] += 117;
216  }
217 
218  return boards;
219 }
220 
221 
222 //________________________________________________________________________
224 {
226  TList* clonedEffHistos = new TList();
227  clonedEffHistos->SetOwner();
228  TIter next(effHistos);
229  TObject* obj = 0x0;
230  while ( (obj = next()) ) {
231  clonedEffHistos->Add(obj->Clone());
232  }
233  return clonedEffHistos;
234 }
235 
236 //________________________________________________________________________
238 {
240  if ( ! HasMergedResults() ) return kFALSE;
241 
242  AliInfo("Building efficiency map for systematic uncertainties");
243 
244  TString currName = "";
245  Double_t xref=0., yref=0., xpt=0., ypt=0.;
246  Double_t nSigmas = 1.;
247 
249 
250  std::vector<std::string> systKeys = obj->GetSortKeys();
251  Int_t nSysts = systKeys.size();
252 
253  // Clone the histogram list that will contain the systematic uncertainties
254  TList* effHistos = obj->GetEffHistoList(fConditions->UncheckedAt(0)->GetName());
255  TList* systematicList = CloneEffHistoList(effHistos);
256 
257  for ( Int_t ich=0; ich<4; ich++ ) {
258  // Get the efficiency graph for the different conditions
259  // as well as the list of histograms to build the efficiency
260  TGraphAsymmErrors* checkEffList[nSysts];
261  TH1* histoList[nSysts*4];
262  TH1* systHistoList[4];
263  for ( Int_t isyst=0; isyst<nSysts; isyst++ ) {
264  effHistos = obj->GetEffHistoList(systKeys[isyst].c_str());
265  for ( Int_t icount=0; icount<4; icount++ ) {
266  currName = Namer()->GetHistoName(AliTrigChEffOutput::kHboardEff, icount, ich, -1, -1, -1);
267  histoList[4*isyst+icount] = static_cast<TH1*>(effHistos->FindObject(currName.Data()));
268  if ( isyst == 0 ) {
269  systHistoList[icount] = static_cast<TH1*>(systematicList->FindObject(currName.Data()));
270  }
271  }
272 
274  Int_t iden = 4*isyst+AliTrigChEffOutput::kAllTracks;
275  checkEffList[isyst] = new TGraphAsymmErrors(histoList[inum],histoList[iden],"e0");
276  } // loop on systematics
277  TGraphAsymmErrors* refEffList[3];
278  for ( Int_t icount=0; icount<3; icount++ ) {
279  refEffList[icount] = new TGraphAsymmErrors(histoList[icount],histoList[AliTrigChEffOutput::kAllTracks],"e0");
280  }
281 
282  // First check what condition to use for the systematic uncertainty
283  // We're searching for the one giving the maximum discrepancy from the reference
284  // not compatible with statistical uncertainty
285  // If this is not found, we'll just use the statistical uncertanty of the reference
286 
287  TGraphAsymmErrors* refGraph = checkEffList[0];
288  for ( Int_t ipt=0; ipt<refGraph->GetN(); ipt++ ) {
289  refGraph->GetPoint(ipt,xref,yref);
290  Int_t chosenSyst = -1;
291  Double_t foundAbsDiff = -1.;
292  for ( Int_t isyst=1; isyst<nSysts; isyst++ ) {
293  TGraphAsymmErrors* graph = checkEffList[isyst];
294  graph->GetPoint(ipt,xpt,ypt);
295  Double_t diff = ypt - yref;
296  Double_t err = (diff > 0.) ? graph->GetErrorYlow(ipt) : graph->GetErrorYhigh(ipt);
297  Double_t absDiff = TMath::Abs(diff);
298  if ( absDiff < nSigmas*err ) continue;
299  if ( foundAbsDiff < absDiff ) {
300  foundAbsDiff = absDiff;
301  chosenSyst = isyst;
302  }
303  } // loop on Systs
304 
305  Int_t ibin = ipt+1;
306  AliDebug(2,Form("Chamber %i board %i systematicCondition %i",11+ich,ibin,chosenSyst));
307  if ( chosenSyst >= 0 ) {
308  for ( Int_t icount=0; icount<4; icount++ ) {
309  systHistoList[icount]->SetBinContent(ibin,histoList[4*chosenSyst+icount]->GetBinContent(ibin));
310  }
311  }
312  else {
313  Double_t countAll = histoList[AliTrigChEffOutput::kAllTracks]->GetBinContent(ibin);
314  systHistoList[AliTrigChEffOutput::kAllTracks]->SetBinContent(ibin,countAll);
315  for ( Int_t icount=0; icount<3; icount++ ) {
316  TGraphAsymmErrors* graph = refEffList[icount];
317  graph->GetPoint(ipt,xpt,ypt);
318  Double_t errHigh = graph->GetErrorYhigh(ipt);
319  Double_t errLow = graph->GetErrorYlow(ipt);
320  Double_t newEff = ( errLow > errHigh ) ? ypt - errLow : ypt + errHigh;
321  Double_t newCount = TMath::Nint(newEff * countAll);
322  if ( newCount < 0 || newCount > countAll ) {
323  TString warning = Form("WARNING: ch %i board %i cath %i systDiff %g newEff %g / %g",11+ich,ibin,icount,newEff-yref,newCount,countAll);
324  if ( newCount < 0 ) newCount = 0;
325  else newCount = countAll;
326  warning += Form(" => setting numerator to %g",newCount);
327  AliWarning(warning.Data());
328  }
329  systHistoList[icount]->SetBinContent(ibin,newCount);
330  }
331  }
332  } // loop on points
333  for ( Int_t it=0; it<nSysts; it++ ) delete checkEffList[it];
334  for ( Int_t it=0; it<3; it++ ) delete refEffList[it];
335  } // loop on chambers
336  obj->AddEffHistoList("Systematics",systematicList);
337  } // loop on merged efficiencies
338 
339  return kTRUE;
340 }
341 
342 //________________________________________________________________________
343 Int_t AliMTRChEffAnalysis::CompareEfficiencies ( const char* sources, const char* titles, const char* opt, const char* canvasNameSuffix ) const
344 {
346  TString srcs(sources);
347  if ( srcs.Contains("raw://") ) {
348  AliError("The method assumes that the specified storage is a SpecificStorage. Hence, please replace raw:// with the actual path in alien, e.g.: alien://folder=/alice/data/<year>/OCDB");
349  return -2;
350  }
351  TObjArray* sourceList = srcs.Tokenize(",");
352  TObjArray effHistoLists;
353  effHistoLists.SetOwner();
354 
355  TIter next(sourceList);
356  TObjString* src = 0x0;
357  while ( (src = static_cast<TObjString*>(next())) ) {
358  TList* readList = ReadEffHistoList(src->String().Data());
359  if ( ! readList ) continue;
360  effHistoLists.Add(readList);
361  }
362 
363  return CompareEfficiencies(&effHistoLists, titles, opt, canvasNameSuffix);
364 }
365 
366 //________________________________________________________________________
367 Int_t AliMTRChEffAnalysis::CompareEfficiencies ( TObjArray* effHistoLists, const char* titles, const char* opt, const char* canvasNameSuffix ) const
368 {
370 
371  TString sTitles(titles);
372  TObjArray* titleList = sTitles.Tokenize(",");
373 
374  Int_t nDiffs = 0;
375 
376  Int_t nLists = effHistoLists->GetEntriesFast();
377 
378  TString sCanvasNameSuffix(canvasNameSuffix);
379  if ( ! sCanvasNameSuffix.IsNull() && ! sCanvasNameSuffix.BeginsWith("_") ) sCanvasNameSuffix.Prepend("_");
380 
381  Double_t xpt, ypt, xref, yref;
382  enum {kEff, kDiff, kPull};
383  TString sOpt(opt);
384  sOpt.ToLower();
385  Int_t iopt = kEff;
386  TString yTitle = "Eff.";
387  if ( sOpt.Contains("diff") ) {
388  iopt = kDiff;
389  yTitle = "Eff. - (ref.Eff)";
390  }
391  else if ( sOpt.Contains("pull") ) {
392  iopt = kPull;
393  yTitle = "(Eff - (ref.Eff)) / err";
394  }
395  else nDiffs = -1;
396 
397  if ( iopt != kEff && nLists <2 ) {
398  AliError(Form("You ask for %s but you only provided one set of histograms: nothing done",opt));
399  return -1;
400  }
401 
402  Bool_t needsLegend = ( nLists > 1 );
403 // if ( iopt != kEff ) needsLegend = nLists > 2;
404 
405  Int_t colors[] = {kBlack, kRed, kSpring, kTeal, kBlue, kViolet, kMagenta, kOrange, kGray};
406  Int_t ncolors = sizeof(colors)/sizeof(colors[0]);
407 
410 
411  TString currName = "";
412  Int_t ican = 0;
413  for ( Int_t itype=0; itype<2; itype++ ) {
414  TString xTitle = ( hTypes[itype] == AliTrigChEffOutput::kHslatEff ) ? "RPC" : "Board";
415  for ( Int_t icount=0; icount<3; icount++ ) {
416  TCanvas* can = 0x0;
417  for ( Int_t ich=0; ich<4; ich++ ) {
418  TLegend* leg = 0x0;
419 // Int_t hrefIdx = AliTrigChEffOutput::kNcounts + AliTrigChEffOutput::kNcounts*4*(itype-1) + 4*AliTrigChEffOutput::kAllTracks + ich;
420 // Int_t hIdx = AliTrigChEffOutput::kNcounts + AliTrigChEffOutput::kNcounts*4*(itype-1) + 4*icount + ich;
421  TGraphAsymmErrors* refGraph = 0x0;
422  for ( Int_t ilist=0; ilist<nLists; ilist++ ) {
423  TString currTitle = titleList->At(ilist)->GetName();
424  TList* effHistos = static_cast<TList*>(effHistoLists->UncheckedAt(ilist));
425  currName = Namer()->GetHistoName(hTypes[itype], AliTrigChEffOutput::kAllTracks, ich, -1, -1, -1);
426  TH1* histoDen = static_cast<TH1*>(effHistos->FindObject(currName.Data()));
427  currName = Namer()->GetHistoName(hTypes[itype], icount, ich, -1, -1, -1);
428  TH1* histoNum = static_cast<TH1*>(effHistos->FindObject(currName.Data()));
429  TGraphAsymmErrors* graph = new TGraphAsymmErrors(histoNum,histoDen,"e0");
430  currName = histoNum->GetName();
431  currName.ReplaceAll("Count","Eff");
432  currName.Append(Form("_%s",currTitle.Data()));
433  graph->SetName(currName.Data());
434 
435  if ( iopt != kEff ) {
436  if ( refGraph ) {
437  for ( Int_t ipt=0; ipt<graph->GetN(); ipt++ ) {
438  refGraph->GetPoint(ipt,xref,yref);
439  graph->GetPoint(ipt,xpt,ypt);
440  Double_t diff = ypt - yref;
441  if ( TMath::Abs(diff) > 1.e-4 ) nDiffs++;
442  if ( iopt == kDiff ) graph->SetPoint(ipt,xpt,diff);
443  else if ( iopt == kPull ) {
444  Double_t err = GetError(graph->GetErrorYlow(ipt),graph->GetErrorYhigh(ipt));
445  Double_t pull = ( err > 0. ) ? diff/err : 0.;
446  graph->SetPoint(ipt,xpt,pull);
447  }
448  } // loop on points
449  }
450  else {
451  refGraph = graph;
452  continue;
453  }
454  }
455 
456  if ( ! can ) {
457  currName = graph->GetName();
458  currName.Remove(currName.Length()-currTitle.Length()-5);
459  currName += sCanvasNameSuffix;
460  can = new TCanvas(currName.Data(),currName.Data(),20*ican,20*ican,600,600);
461  can->Divide(2,2);
462  ican++;
463  }
464  if ( needsLegend && ! leg ) {
465  leg = new TLegend(0.35, 0.15, 0.65, 0.45);
466  if ( refGraph ) leg->SetHeader(Form("Ref.: %s",titleList->At(0)->GetName()));
467  }
468  can->cd(ich+1);
469  gPad->SetGridy();
470  Int_t icolor = ( ilist < ncolors ) ? colors[ilist] : 20+ilist;
471  graph->SetLineColor(icolor);
472  graph->SetMarkerColor(icolor);
473  graph->SetMarkerStyle(20+ilist);
474  graph->SetMarkerSize(0.5);
475  graph->GetXaxis()->SetTitle(xTitle.Data());
476  graph->GetYaxis()->SetTitle(yTitle.Data());
477  graph->Draw((gPad->GetListOfPrimitives()->GetEntries()==0)?"ap":"p");
478  if ( leg ) leg->AddEntry(graph,titleList->At(ilist)->GetName(),"lp");
479  } // loop on lists
480  if (leg ) leg->Draw();
481  delete refGraph;
482  } // loop on chambers
483  } // loop on counts
484  } // loop on types
485 
486  delete titleList;
487 
488  return nDiffs;
489 }
490 
491 //________________________________________________________________________
492 Int_t AliMTRChEffAnalysis::CompareEfficiencyMethods ( const char* source, const char* opt, const char* canvasNameSuffix ) const
493 {
495  if ( ! fConditions ) {
496  AliWarning("No condition found! Please specify the default efficiency condition with SetEffConditions and then add additional tests with AddSystematicCondition");
497  return -1;
498  }
499 
500  AliTrigChEffOutput trigOut(source);
501 
502  Int_t nConditions = fConditions->GetEntriesFast();
503 
504  TString titles = "";
505  TObjArray effHistoLists;
506  effHistoLists.SetOwner();
507 
508  for ( Int_t icond=0; icond<nConditions; icond++ ) {
509  TObjArray* condition = static_cast<TObjArray*>(fConditions->UncheckedAt(icond));
510  TString condTitle = GetShortConditionTitle(condition->GetName());
511 
512  TList* effHistos = GetEffHistoList(&trigOut, condition);
513  effHistoLists.Add(effHistos);
514  titles += Form("%s,",condTitle.Data());
515  }
516 
517  titles.Remove(TString::kTrailing,',');
518  return CompareEfficiencies(&effHistoLists, titles, opt, canvasNameSuffix);
519 }
520 
521 
522 //________________________________________________________________________
524 {
525  if ( ! HasMergedResults() ) return;
526 
527  if ( fMergedMap.size() < 2 ) {
528  AliWarning("There is only one merged object: nothing to compare to");
529  return;
530  }
531 
532  AliInfo("Comparing the merged efficiencies");
533 
534  TObjArray* condition = static_cast<TObjArray*>(fConditions->At(0));
535  TString titles = "";
536 
537  TObjArray effHistoList;
539  TList* effHistos = obj->GetEffHistoList(condition->GetName());
540  effHistoList.Add(effHistos);
541  titles += Form("%i_%i,",obj->GetMinRun(),obj->GetMaxRun());
542  }
543  titles.Remove(TString::kTrailing,',');
544 
545  CompareEfficiencies(&effHistoList, titles.Data(), opt, "MergedComp");
546 }
547 
548 //________________________________________________________________________
549 Int_t AliMTRChEffAnalysis::ComputeAndCompareEfficiencies ( const char* sources, const char* titles, const char* opt, const char* canvasNameSuffix ) const
550 {
552  TString srcs(sources);
553  TObjArray* sourceList = srcs.Tokenize(",");
554  TObjArray effHistoLists;
555  effHistoLists.SetOwner();
556 
557  TObjArray* condition = static_cast<TObjArray*>(fConditions->At(0));
558  if ( ! condition ) {
559  AliError("The method requires to set an efficiency confition with SetEffConditions");
560  return -1;
561  }
562 
563  TIter next(sourceList);
564  TObjString* src = 0x0;
565  while ( (src = static_cast<TObjString*>(next())) ) {
566  if ( ! src->String().EndsWith(".root") ) {
567  AliError("The method reads files with the output of AliAnalysisTaskTrigChEff and re-compute the efficiency");
568  return -1;
569  }
570  AliTrigChEffOutput trigOut(src->GetName());
571  TList* readList = GetEffHistoList(&trigOut,condition);
572  if ( ! readList ) continue;
573  effHistoLists.Add(readList);
574  }
575 
576  return CompareEfficiencies(&effHistoLists, titles, opt, canvasNameSuffix);
577 }
578 
579 
580 //________________________________________________________________________
581 //TArrayI AliMTRChEffAnalysis::CheckHomogeneity ( const TGraphAsymmErrors* trendGraph, Double_t nSigmas, Bool_t revert ) const
582 //{
583 // /// Check efficiency homogeneity
584 // TArrayI ranges(trendGraph->GetN());
585 // Double_t xpt=0., ypt=0.;
586 //
587 // Double_t sumEffOverSigma2 = -10.;
588 // Double_t sumInvSimga2 = 0.001;
589 // Int_t irange = 0;
590 // Int_t npt = trendGraph->GetN();
591 // for ( Int_t ipt=0; ipt<npt; ipt++ ) {
592 // Int_t currPt = ( revert ) ? npt-1-ipt : ipt;
593 // trendGraph->GetPoint(currPt,xpt,ypt);
594 // Double_t err = GetError(trendGraph->GetErrorYlow(currPt),trendGraph->GetErrorYhigh(currPt));
595 // Double_t invSigma2 = 1./(err*err);
596 // Double_t effOverSigma2 = ypt*invSigma2;
597 //
598 // Double_t meanEff = sumEffOverSigma2 / sumInvSimga2;
599 // Double_t diff = ypt - meanEff;
600 // Double_t diffErr = TMath::Sqrt(err*err+1./sumInvSimga2);
602 // if ( TMath::Abs(diff)/diffErr > nSigmas ) {
603 // TString run = trendGraph->GetXaxis()->GetBinLabel(currPt+1);
604 // ranges[irange++] = run.Atoi();
605 // sumEffOverSigma2 = 0.;
606 // sumInvSimga2 = 0.;
607 // }
608 // sumEffOverSigma2 += effOverSigma2;
609 // sumInvSimga2 += invSigma2;
610 // }
611 // TString run = trendGraph->GetXaxis()->GetBinLabel(trendGraph->GetN());
612 // ranges[irange++] = run.Atoi();
613 // ranges.Set(irange);
614 // return ranges;
615 //}
616 
617 //________________________________________________________________________
618 void AliMTRChEffAnalysis::CopyDir(TDirectory *source) const
619 {
621  TDirectory *savdir = gDirectory;
622  TDirectory *adir = savdir->mkdir(source->GetName());
623  adir->cd();
624  //loop on all entries of this directory
625  TKey *key;
626  TIter nextkey(source->GetListOfKeys());
627  while ((key = (TKey*)nextkey())) {
628  const char *classname = key->GetClassName();
629  TClass *cl = gROOT->GetClass(classname);
630  if (!cl) continue;
631  if (cl->InheritsFrom(TDirectory::Class())) {
632  source->cd(key->GetName());
633  TDirectory *subdir = gDirectory;
634  adir->cd();
635  CopyDir(subdir);
636  adir->cd();
637  } else if (cl->InheritsFrom(TTree::Class())) {
638  TTree *T = (TTree*)source->Get(key->GetName());
639  adir->cd();
640  TTree *newT = T->CloneTree(-1,"fast");
641  newT->Write();
642  } else {
643  source->cd();
644  TObject *obj = key->ReadObj();
645  adir->cd();
646  obj->Write(obj->GetName(),TObject::kSingleKey);
647  delete obj;
648  }
649  }
650  adir->SaveSelf(kTRUE);
651  savdir->cd();
652 }
653 
654 
655 //________________________________________________________________________
656 Bool_t AliMTRChEffAnalysis::CopyLocally ( const char* runList, const char* path, const char* pattern, const char* localFileList, const char* outDir, const char* directory ) const
657 {
659  TString sPattern(pattern);
660  TString sOutDir(outDir);
661  TString sPath(path);
662  Bool_t isGrid = (! sPattern.IsNull());
663 
664  if ( sOutDir.IsNull() ) {
665  if ( isGrid ) {
666  TString data = sPath(TRegexp("/data/"));
667  TString year = sPath(TRegexp("/20[0-9][0-9]/"));
668  TString period = sPath(TRegexp("/LHC[0-9][0-9][a-z]"));
669  period.Append("/");
670  TString pass = AliAnalysisMuonUtility::GetPassName(path);
671  if ( pass.IsNull() ) pass = AliAnalysisMuonUtility::GetPassName(pattern);
672  sOutDir = data+year+period+pass;
673  sOutDir.ReplaceAll("//","/");
674  sOutDir.Remove(TString::kTrailing,'/');
675  sOutDir.Remove(TString::kLeading,'/');
676  }
677  else sOutDir = sPath;
678  sOutDir.Remove(TString::kTrailing,'/');
679  sOutDir.Remove(TString::kLeading,'/');
680  }
681 
682  TGridResult* res = 0x0;
683  Bool_t hasCurl = kFALSE;
684  if ( isGrid ) {
685  if ( ! gGrid ) TGrid::Connect("alien://");
686  res = gGrid->Query(path,pattern);
687  }
688  else {
689  if ( gSystem->Exec("which curl &> /dev/null") == 0 ) hasCurl = kTRUE;
690  }
691 
692  TList* rl = GetRunList(runList);
693 
694  ofstream outFile(localFileList);
695  Bool_t allOk = kTRUE;
696  Bool_t prompt = kTRUE;
697  Bool_t overwrite = kFALSE;
698  for ( Int_t irun=0; irun<rl->GetEntries(); irun++ ) {
699  TString run = static_cast<TObjString*>(rl->At(irun))->String();
700  TString dest = Form("%s/%09i/QAresults.root",sOutDir.Data(),run.Atoi());
701  TString destDir = gSystem->DirName(dest.Data());
702  if ( gSystem->AccessPathName(destDir.Data()) ) ExecCommand(Form("mkdir -p %s",destDir.Data()),kFALSE);
703  Bool_t copyFile = kTRUE;
704  Bool_t isFileOk = kTRUE;
705  if ( gSystem->AccessPathName(dest) == 0 ) {
706  if ( prompt ) {
707  TString decision = "";
708  cout << "Local file " << dest.Data() << " already exist: overwrite? [y/n/ya/na (a=use decision for all)]" << endl;
709  cin >> decision;
710  if ( decision.EndsWith("a") ) prompt = kFALSE;
711  if ( decision.BeginsWith("y") ) overwrite = kTRUE;
712  else overwrite = kFALSE;
713  }
714  copyFile = overwrite;
715  }
716  if ( copyFile ) {
717  TString src = "";
718  if ( isGrid ) {
719  for ( Int_t ifile=0; ifile<res->GetEntries(); ifile++ ) {
720  TString inFilename = res->GetKey(ifile,"turl");
721  if ( inFilename.Contains(run.Data()) ) {
722  src = inFilename;
723  break;
724  }
725  }
726  if ( src.IsNull() ) {
727  AliWarning(Form("Cannot find output for run %s",run.Data()));
728  isFileOk = kFALSE;
729  }
730  else {
731  TFile* outFile = TFile::Open(dest,"RECREATE");
732  TFile* inFile = TFile::Open(src);
733  inFile->cd();
734  TDirectory* dir = static_cast<TDirectory*>(inFile->Get(directory));
735  if ( dir ) {
736  outFile->cd();
737  CopyDir(dir);
738  }
739  else isFileOk = kFALSE;
740  delete inFile;
741  delete outFile;
742  }
743  }
744  else {
745  src = Form("http://aliqamu.web.cern.ch/aliqamu/%s",dest.Data());
746  // TFile::Cp was having some issue lately.
747  // If curl is found on the system, let's use it instead...
748  if ( hasCurl ) {
749  Int_t cmdOut = gSystem->Exec(Form("curl -f -# -o %s %s",dest.Data(),src.Data()));
750  isFileOk = ( cmdOut == 0 );
751  }
752  else isFileOk = TFile::Cp(src.Data(),dest.Data());
753  }
754  }
755 
756  if ( isFileOk ) outFile << gSystem->pwd() << "/" << dest.Data() << endl;
757  else {
758  AliWarning(Form("Problem getting run %s",run.Data()));
759  allOk = kFALSE;
760  }
761  }
762  delete rl;
763  outFile.close();
764  return allOk;
765 }
766 
767 //________________________________________________________________________
768 void AliMTRChEffAnalysis::DrawEffTrend ( Int_t itype, Int_t irpc, Double_t maxNsigmaOutliers, Double_t minEff, Double_t maxEff ) const
769 {
771  TString baseNames[3] = {"Chamber","RPC","Board"};
772  TString base = baseNames[itype] + "Eff";
773  if ( itype == AliTrigChEffOutput::kHboardEff ) {
774  if ( irpc < 0 ) {
775  AliWarning("Please specify RPC");
776  return;
777  }
778  base += Form("InRPC%i",irpc);
779  }
780 
781  Int_t nColumns = 2;
782  Int_t nRows = 2;
783  Int_t width = 600;
784  Int_t height = 600;
785  Int_t nDetEl = 4;
786  Int_t nCh = 1;
787  if ( itype != AliTrigChEffOutput::kHchamberEff ) {
788  nColumns = 6;
789  nRows = 3;
790  width = 1200;
791  height = 800;
792  nDetEl = 18;
793  nCh = 4;
794  }
795  TArrayI boards = BoardsInRPC(irpc);
796  if ( itype == AliTrigChEffOutput::kHboardEff ) nDetEl = boards.GetSize();
797 
798  for ( Int_t ich=0; ich<nCh; ich++ ) {
799  TString canName = base;
800  if ( itype != AliTrigChEffOutput::kHchamberEff ) canName += Form("Ch%i",11+ich);
801  TCanvas* can = new TCanvas(canName.Data(),canName.Data(),25*ich,25*ich,width,height);
802  can->Divide(nColumns,nRows,0,0);
803  // can->SetTopMargin(0.03);
804  // can->SetBottomMargin(0.1);
805  for ( Int_t idetelem=0; idetelem<nDetEl; idetelem++ ) {
806  can->cd(idetelem+1);
807  gPad->SetTicks(1,1);
808  gPad->SetGridy();
809  Int_t detElemId = idetelem;
810  if ( itype == AliTrigChEffOutput::kHchamberEff ) detElemId = 11+idetelem;
811  else if ( itype == AliTrigChEffOutput::kHboardEff ) detElemId = boards[idetelem];
812 
813  TString title = Form("%s %i",baseNames[itype].Data(),detElemId);
814  TLegend* leg = new TLegend(0.2,0.15,0.8,0.4);
815  leg->SetHeader(title.Data());
816  for ( Int_t icount=0; icount<2; icount++ ) {
817  TGraphAsymmErrors* gr = GetTrendEff(itype, icount, ich, detElemId);
818  gr->SetLineColor(icount+1);
819  gr->SetMarkerColor(icount+1);
820  gr->SetMarkerStyle(24+2*icount);
821  gr->GetYaxis()->SetRangeUser(minEff,maxEff);
822  gr->GetXaxis()->SetLabelSize(0.07);
823  // gr->GetYaxis()->SetLabelSize(0.025*nRows);
824  // gr->GetXaxis()->SetLabelSize(0.025*nColumns);
825  gr->SetTitle("");
826  gr->Draw(icount==0?"ap":"p");
827  TString legTitle = ( icount==0 ) ? "bending plane" : "non-bending plane";
828  leg->AddEntry(gr,legTitle.Data(),"lp");
829  if ( maxNsigmaOutliers > 0. ) {
830  TGraphAsymmErrors* outliers = GetOutliers(gr,maxNsigmaOutliers);
831  outliers->SetLineColor(6+icount);
832  outliers->SetMarkerColor(6+icount);
833  outliers->SetMarkerStyle(20+2*icount);
834  outliers->SetLineWidth(2);
835  outliers->Draw("p");
836  legTitle.ReplaceAll("plane","outliers");
837  leg->AddEntry(outliers,legTitle.Data(),"lp");
838  }
839  }
840  leg->Draw();
841  }
842  if ( itype == AliTrigChEffOutput::kHchamberEff ) break;
843  }
844 }
845 
846 //________________________________________________________________________
847 void AliMTRChEffAnalysis::DrawStatContribution ( Int_t itype, Int_t irpc, Double_t maxNsigmaOutliers, Double_t minY, Double_t maxY ) const
848 {
850  if ( itype == AliTrigChEffOutput::kHchamberEff ) {
851  AliWarning("This function is valid only for itype 1 and 2");
852  return;
853  }
854 
855  TString baseNames[3] = {"Chamber","RPC","Board"};
856  TString base = baseNames[itype] + "Stat";
857  if ( itype == AliTrigChEffOutput::kHboardEff ) {
858  if ( irpc < 0 ) {
859  AliWarning("Please specify RPC");
860  return;
861  }
862  base += Form("InRPC%i",irpc);
863  }
864 
865  Int_t nColumns = 6;
866  Int_t nRows = 3;
867  Int_t width = 1200;
868  Int_t height = 800;
869  Int_t nDetEl = 18;
870  Int_t nCh = 1;
871 
872  TArrayI boards = BoardsInRPC(irpc);
873  if ( itype == AliTrigChEffOutput::kHboardEff ) nDetEl = boards.GetSize();
874 
875  for ( Int_t ich=0; ich<nCh; ich++ ) {
876  TH1* histos[nDetEl];
877  TH1* sumHistos = 0x0;
878  for ( Int_t idetelem=0; idetelem<nDetEl; idetelem++ ) {
879  Int_t detElemId = idetelem;
880  if ( itype == AliTrigChEffOutput::kHboardEff ) detElemId = boards[idetelem];
881  histos[idetelem] = GetTrend(itype, AliTrigChEffOutput::kAllTracks, ich, detElemId);
882  histos[idetelem]->SetName(Form("%s_stat",histos[idetelem]->GetName()));
883  histos[idetelem]->SetStats(0);
884  if ( sumHistos ) sumHistos->Add(histos[idetelem]);
885  else sumHistos = static_cast<TH1*>(histos[idetelem]->Clone("sumHistos"));
886  }
887 
888  TString canName = base; //Form("%sCh%i",base.Data(),11+ich);
889  TCanvas* can = new TCanvas(canName.Data(),canName.Data(),25*ich,25*ich,width,height);
890  can->Divide(nColumns,nRows,0,0);
891  for ( Int_t idetelem=0; idetelem<nDetEl; idetelem++ ) {
892  can->cd(idetelem+1);
893  gPad->SetTicks(1,1);
894  gPad->SetGridy();
895  Int_t detElemId = idetelem;
896  if ( itype == AliTrigChEffOutput::kHboardEff ) detElemId = boards[idetelem];
897  TString title = Form("%s %i",baseNames[itype].Data(),detElemId);
898  TLegend* leg = new TLegend(0.2,0.65,0.8,0.9);
899  leg->SetHeader(title.Data());
900  TGraphAsymmErrors* gr = new TGraphAsymmErrors(histos[idetelem],sumHistos,"e0");
901  gr->SetHistogram(static_cast<TH1F*>(histos[idetelem]));
902 
903  gr->SetMarkerStyle(24);
904  gr->SetMarkerSize(0.5);
905  gr->GetYaxis()->SetRangeUser(minY,maxY);
906  gr->GetYaxis()->SetTitle(Form("Tracks in %s / Sum of tracks of %ss in %s",baseNames[itype].Data(),baseNames[itype].Data(),baseNames[itype-1].Data()));
907  gr->SetTitle("");
908  gr->Draw("ap");
909  TString legTitle = "stat";
910 // leg->AddEntry(gr,legTitle.Data(),"lp");
911  if ( maxNsigmaOutliers > 0. ) {
912  TGraphAsymmErrors* outliers = GetOutliers(gr,maxNsigmaOutliers);
913  outliers->SetLineColor(6);
914  outliers->SetMarkerColor(6);
915  outliers->SetMarkerStyle(20);
916  outliers->SetLineWidth(2);
917  outliers->Draw("p");
918  legTitle = "outliers";
919  leg->AddEntry(outliers,legTitle.Data(),"lp");
920  }
921 // }
922  leg->Draw();
923  }
924  delete sumHistos;
925  }
926 }
927 
928 //________________________________________________________________________
930 {
932  if ( ! HasMergedResults() ) return kFALSE;
933 
934  AliInfo("Drawing the systematic variations");
935 
936  Int_t colors[] = {kBlack, kRed, kSpring, kTeal, kBlue, kViolet, kMagenta, kOrange, kGray};
937  Int_t ncolors = sizeof(colors)/sizeof(colors[0]);
938 
941 
942  Double_t xpt, ypt, xref, yref;
943  TArrayD eff(4), effErr(4);
944 
945  Int_t imerged = -1;
947  imerged++;
948  std::vector<std::string> systKeys = obj->GetSortKeys();
949  std::vector<std::string> shortSystName;
950  for ( std::string str : systKeys ) {
951  shortSystName.push_back(GetShortConditionTitle(str.c_str()).Data());
952  }
953  Int_t nSysts = systKeys.size();
954 
955  TString baseName = Form("mergedTrigEff_%i_%i",obj->GetMinRun(),obj->GetMaxRun());
956 
957  TArrayI isEmpty(nSysts);
958 
959  // First get the needed graphs
960  Int_t nDE = 0;
961  TObjArray effGraphs[8];
962  for ( Int_t iplane=0; iplane<8; iplane++ ) {
963  effGraphs[iplane].SetOwner();
964  }
965  TString titles = "";
966  TObjArray effHistoLists;
967 // effHistoLists.SetOwner();
968  for ( Int_t isyst=0; isyst<nSysts; isyst++ ) {
969  TList* effHistos = obj->GetEffHistoList(systKeys[isyst].c_str());
970  effHistoLists.Add(effHistos);
971  titles += Form("%s,",shortSystName[isyst].c_str());
972 
973  for ( Int_t ich=0; ich<4; ich++ ) {
974  TString currName = Namer()->GetHistoName(itype, AliTrigChEffOutput::kAllTracks, ich, -1, -1, -1);
975  TH1* histoDen = static_cast<TH1*>(effHistos->FindObject(currName.Data()));
976  for ( Int_t icount=0; icount<2; icount++ ) {
977  Int_t iplane = 4*icount+ich;
978 
979  if ( histoDen->GetEntries() > 0 ) {
980  currName = Namer()->GetHistoName(itype, countTypes[icount], ich, -1, -1, -1);
981  TH1* histoNum = static_cast<TH1*>(effHistos->FindObject(currName.Data()));
982  TGraphAsymmErrors* gr = new TGraphAsymmErrors(histoNum,histoDen,"e0");
983  nDE = gr->GetN();
984  effGraphs[iplane].AddAtAndExpand(gr,isyst);
985  }
986  else {
987  isEmpty[isyst] = 1;
988  AliWarning(Form("No entries in count %i and ch %i for %s",countTypes[icount],ich,shortSystName[isyst].c_str()));
989  }
990  }
991  }
992  }
993 
994  titles.Remove(TString::kTrailing,',');
995  CompareEfficiencies(&effHistoLists, titles, "diff", baseName.Data());
996 
997  // Draw average dispersion per plane
998  TString canName = Form("EffSyst_%s",baseName.Data());
999  Int_t pos = 25*(imerged+1);
1000  TCanvas* can = new TCanvas(canName.Data(),canName.Data(),pos,pos,1200,800);
1001  can->Divide(4,2,0,0);
1002 
1003  for ( Int_t icount=0; icount<2; icount++ ) {
1004  for ( Int_t ich=0; ich<4; ich++ ) {
1005  Int_t iplane = 4*icount+ich;
1006  can->cd(iplane+1);
1007  gPad->SetTicks(1,1);
1008  gPad->SetLogy();
1009  TLegend* leg = new TLegend(0.15,0.7,0.9,0.9);
1010  leg->SetHeader(Namer()->GetHistoName(-1,icount,ich,-1,-1,-1));
1011  TH1* sumHisto = 0x0;
1012  for ( Int_t isyst=1; isyst<nSysts; isyst++ ) {
1013  if ( isEmpty[isyst] == 1 ) continue;
1014  TH1* histo = new TH1D(Form("syst_%s_%s_plane%i_ch%i",baseName.Data(),shortSystName[isyst].c_str(),icount,11+ich),"",200,-0.1,0.1);
1015  histo->GetXaxis()->SetTitle("Eff.-(ref.Eff.)");
1016  histo->GetYaxis()->SetTitle("1/#sigma^{2}");
1017 
1018  TGraphAsymmErrors* gr = static_cast<TGraphAsymmErrors*>(effGraphs[iplane].UncheckedAt(isyst));
1019  TGraphAsymmErrors* grRef = static_cast<TGraphAsymmErrors*>(effGraphs[iplane].UncheckedAt(0));
1020  for ( Int_t ipt=0; ipt<gr->GetN(); ipt++ ) {
1021  gr->GetPoint(ipt,xpt,ypt);
1022  Double_t err = GetError(gr->GetErrorYlow(ipt),gr->GetErrorYhigh(ipt));
1023  Double_t invErr2 = ( err > 0. ) ? 1./(err*err) : 0.;
1024  grRef->GetPoint(ipt,xref,yref);
1025 
1026  Double_t diff = ypt-yref;
1027  histo->Fill(diff,invErr2);
1028  }
1029 
1030  if ( ! sumHisto ) {
1031  sumHisto = static_cast<TH1*>(histo->Clone(Form("syst_%s_plane%i_ch%i",baseName.Data(),icount,11+ich)));
1032  sumHisto->SetLineColor(1);
1033  sumHisto->Draw();
1034  leg->AddEntry(sumHisto,"All systematics","l");
1035  }
1036  else sumHisto->Add(histo);
1037  Int_t icolor = ( isyst < ncolors ) ? colors[isyst] : 20+isyst;
1038  histo->SetLineColor(icolor);
1039  histo->Draw("same");
1040  leg->AddEntry(histo,shortSystName[isyst].c_str(),"l");
1041  } // loop on conditions
1042  leg->Draw();
1043  } // loop on chambers
1044  } // loop on counts
1045 
1046 
1047  canName = Form("TriggerEff_3outOf4_syst_%s",baseName.Data());
1048  pos += 50;
1049  TCanvas* canSyst = new TCanvas(canName.Data(),canName.Data(),pos,pos,600,600);
1050  canSyst->SetLogy();
1051  TLegend* leg = new TLegend(0.15,0.7,0.9,0.4);
1052 // leg->SetHeader(trigOut->GetHistoName(-1,icount,ich,-1,-1,-1));
1053  TH1* histo[nSysts];
1054  for ( Int_t isyst=0; isyst<nSysts; isyst++ ) {
1055  if ( isEmpty[isyst] == 1 ) continue;
1056  histo[isyst] = new TH1D(Form("TriggerEff_syst_%s_%s",shortSystName[isyst].c_str(),baseName.Data()),"Dispersion of trigger probability (3/4)",200,-0.1,0.1);
1057  histo[isyst]->GetXaxis()->SetTitle("Trig. prob. - (ref. trig. prob)");
1058  histo[isyst]->GetYaxis()->SetTitle("1/#sigma^{2}");
1059  }
1060 
1061  for ( Int_t ipt=0; ipt<nDE; ipt++ ) {
1062  Double_t refTrigProb = 0.; // refTrigProbErr = 0.;
1063  for ( Int_t isyst=0; isyst<nSysts; isyst++ ) {
1064  if ( isEmpty[isyst] == 1 ) continue;
1065  Double_t trigProb = 1., trigProbErr2 = 0.;
1066  for ( Int_t icount=0; icount<2; icount++ ) {
1067  for ( Int_t ich=0; ich<4; ich++ ) {
1068  Int_t iplane = 4*icount+ich;
1069  TGraphAsymmErrors* gr = static_cast<TGraphAsymmErrors*>(effGraphs[iplane].UncheckedAt(isyst));
1070  gr->GetPoint(ipt,xpt,ypt);
1071  eff[ich] = ypt;
1072  effErr[ich] = GetError(gr->GetErrorYlow(ipt),gr->GetErrorYhigh(ipt));
1073  } // loop on chambers
1074  Double_t effErr34 = 0.;
1075  Double_t eff34 = GetThreeOfFour(eff,effErr,effErr34);
1076  trigProb *= eff34;
1077  trigProbErr2 += effErr34*effErr34;
1078  } // loop on counts
1079 
1080  if ( isyst == 0 ) {
1081  refTrigProb = trigProb;
1082 // refTrigProbErr = trigProbErr;
1083  }
1084  else {
1085  Double_t invErr2 = ( trigProbErr2>0. ) ? 1./trigProbErr2 : 0.;
1086  histo[isyst]->Fill(trigProb-refTrigProb,invErr2);
1087  }
1088  } // loop on conditions
1089  } // loop on points
1090 
1091  for ( Int_t isyst=0; isyst<nSysts; isyst++ ) {
1092  if ( isEmpty[isyst] == 1 ) continue;
1093  TString title = ( isyst == 0 ) ? "All systematics" : shortSystName[isyst].c_str();
1094  Int_t icolor = ( isyst < ncolors ) ? colors[isyst] : 20+isyst;
1095  histo[isyst]->SetLineColor(icolor);
1096  histo[isyst]->Draw((isyst == 0)?"":"same");
1097  leg->AddEntry(histo[isyst],title.Data(),"l");
1098  if ( isyst>0 ) histo[0]->Add(histo[isyst]);
1099  }
1100  leg->Draw();
1101  } // loop on merged output
1102  return kTRUE;
1103 }
1104 
1105 //________________________________________________________________________
1107 {
1109  TString decision = "y";
1110 
1111  if ( gROOT->IsBatch() ) prompt = kFALSE; // To run with crontab
1112 
1113  if ( prompt ) {
1114  cout << command.Data() << " ? [y/n]" << endl;
1115  cin >> decision;
1116  }
1117 
1118  decision.ToLower();
1119  if ( decision == "y" ) {
1120  cout << "Executing: " << command.Data() << endl;
1121  gSystem->Exec(command.Data());
1122  return kTRUE;
1123  }
1124 
1125  return kFALSE;
1126 }
1127 
1128 //________________________________________________________________________
1130 {
1137 
1138  Double_t xx = x[0];
1139  Double_t val = par[1];
1140  Int_t nChanges = par[0];
1141  Double_t matchDiff = 123456789.;
1142  Int_t matchChange = -1;
1143  for ( Int_t iknot=0; iknot<nChanges; iknot++ ) {
1144  Int_t iparChange = 2*(iknot+1);
1145  Double_t diff = xx - par[iparChange];
1146  if ( diff >= 0. && diff < matchDiff ) {
1147  matchDiff = diff;
1148  matchChange = iparChange;
1149  }
1150  }
1151  if ( matchChange >= 0 ) val = par[matchChange+1];
1152 
1153  return val;
1154 }
1155 
1156 //________________________________________________________________________
1157 Double_t AliMTRChEffAnalysis::GetAverageStat ( Int_t firstRun, Int_t lastRun, Int_t itype,Bool_t excludePeriphericBoard ) const
1158 {
1160 
1161  TH1* statHisto = 0x0;
1162 
1164  TList* effHistoList = obj->GetEffHistoList(fConditions->UncheckedAt(0)->GetName());
1165  Int_t run = obj->GetMinRun();
1166  if ( run < firstRun || run > lastRun ) continue;
1167  TH1* histo = GetHisto(effHistoList,itype,AliTrigChEffOutput::kAllTracks,0);
1168 // if ( ! histo ) continue;
1169  if ( statHisto ) statHisto->Add(histo);
1170  else statHisto = static_cast<TH1*>(histo->Clone("tmpStatHisto"));
1171 // delete histo;
1172  }
1173  if ( ! statHisto ) return 0.;
1174 
1175  Double_t statPerDE = 0.;
1176  Double_t nDe = 0.;
1177  if ( itype == AliTrigChEffOutput::kHboardEff && excludePeriphericBoard ) {
1178  Int_t excludeBoardsHalf[] = {1, 17, 39, 61, 77, 93,109,
1179  16, 38, 60, 76, 92, 108, 117,
1180  110, 111, 112, 113, 114, 115, 116};
1181  Int_t nExcludedHalf = sizeof(excludeBoardsHalf)/sizeof(excludeBoardsHalf[0]);
1182  for ( Int_t ibin=1; ibin<=statHisto->GetNbinsX(); ibin++ ) {
1183  Bool_t skip = kFALSE;
1184  for ( Int_t iexcl=0; iexcl<nExcludedHalf; iexcl++ ) {
1185  if ( ibin == excludeBoardsHalf[iexcl] || ibin == excludeBoardsHalf[iexcl]+117 ) {
1186  skip = kTRUE;
1187  break;
1188  }
1189  }
1190  if ( skip ) continue;
1191  statPerDE += statHisto->GetBinContent(ibin);
1192  nDe += 1.;
1193  }
1194  }
1195  else {
1196  statPerDE = statHisto->Integral();
1197  nDe = (Double_t)statHisto->GetNbinsX();
1198  }
1199  statPerDE = nDe > 0. ? statPerDE/nDe : -1.;
1200 
1201  delete statHisto;
1202  return statPerDE;
1203 }
1204 
1205 //________________________________________________________________________
1207 {
1209  Int_t itrackSel = condition->UncheckedAt(3)->GetUniqueID();
1210  Int_t imatch = condition->UncheckedAt(4)->GetUniqueID();
1211  Int_t imethod = condition->UncheckedAt(5)->GetUniqueID();
1212 
1213  return trigOut->GetEffHistoList(condition->At(0)->GetName(),condition->At(1)->GetName(),condition->At(2)->GetName(),itrackSel,imatch,imethod);
1214 }
1215 
1216 //________________________________________________________________________
1218 {
1220  return TMath::Max(errLow,errHigh);
1221 }
1222 
1223 //________________________________________________________________________
1224 TH1* AliMTRChEffAnalysis::GetHisto ( TList* effHistoList, Int_t itype, Int_t icount, Int_t ichamber ) const
1225 {
1227  Int_t ihisto = ( itype == AliTrigChEffOutput::kHchamberEff ) ? icount : AliTrigChEffOutput::kNcounts + 4*AliTrigChEffOutput::kNcounts*(itype-1) + 4*icount + ichamber;
1228  return static_cast<TH1*>(effHistoList->At(ihisto));
1229 }
1230 
1231 //________________________________________________________________________
1232 TArrayI AliMTRChEffAnalysis::GetHomogeneousRanges ( Double_t chi2Cut, Int_t maxNRanges, Double_t minEffVariation, Bool_t perRPC, TArrayI* forcedChanges, Double_t minEff, Double_t maxEff )
1233 {
1235 
1236  AliInfo("Selecting ranges with homogeneous efficiency");
1237 
1238  Int_t nRuns = fRunMap.size();
1239 
1240  TH1F* hRunChangeCount = new TH1F("runChangeCount","Number of RPCs changing efficiency per run",nRuns,-0.5,-0.5+(Double_t)nRuns);
1241  hRunChangeCount->SetXTitle("Run num.");
1242  hRunChangeCount->SetYTitle("Num. of RPCs with change in eff.");
1243  for ( Int_t irun=0; irun<nRuns; irun++ ) {
1244  hRunChangeCount->GetXaxis()->SetBinLabel(irun+1,Form("%i",GetRunNumber(irun)));
1245  }
1246 
1248 
1249  Int_t nCanvas = perRPC ? 4 : 18;
1250  TObjArray canList(nCanvas);
1251 
1252  for ( Int_t irpc=0; irpc<18; irpc++ ) {
1254  TArrayI boards = BoardsInRPC(irpc);
1255  Int_t firstDetEl = perRPC ? irpc : 0;
1256  Int_t lastDetEl = perRPC ? irpc : boards.GetSize()-1;
1257 
1258  for ( Int_t ich=0; ich<4; ich++ ) {
1259  Int_t ican = perRPC ? ich : irpc;
1260  TCanvas* can = static_cast<TCanvas*>(canList.At(ican));
1261  if ( ! can ) {
1262  TString canName = perRPC ? Form("testRanges_ch%i",11+ich) : Form("testRanges_RPC%i",irpc);
1263  can = new TCanvas(canName.Data(),canName.Data(),10*ich,10*ich,1200,800);
1264  can->Divide(6,3,0,0);
1265  can->SetMargin(0.,0.,0.,0.);
1266  canList.AddAt(can,ican);
1267  }
1268 
1269  for ( Int_t idetel=firstDetEl; idetel<=lastDetEl; idetel++ ) {
1270  Int_t currDE = ( perRPC ) ? idetel : boards[idetel];
1271 // for ( Int_t icount=0; icount<2; icount++ ) {
1272  TGraphAsymmErrors* trendGraph = GetTrendEff(itype,icount,ich,currDE);
1273  TArrayI range = GetHomogeneousRanges(trendGraph,chi2Cut,maxNRanges,minEffVariation,forcedChanges, kTRUE);
1274  trendGraph->GetYaxis()->SetRangeUser(minEff,maxEff);
1275 
1276  can->cd(idetel+1);
1277  gPad->SetTicks(1,1);
1278  gPad->SetMargin(0.08,0.,0.08,0.);
1279  TString drawOpt = ( gPad->GetListOfPrimitives()->GetEntries() == 0 ) ? "ap" : "p";
1280 
1281  TString legendName = Form("%s_%i",can->GetName(),currDE);
1282  TLegend* leg = static_cast<TLegend*>(gPad->GetListOfPrimitives()->FindObject(legendName.Data()));
1283  if ( ! leg ) {
1284  leg = new TLegend(0.2,0.15,0.8,0.4);
1285  leg->SetHeader(Form("%s %i",perRPC?"RPC":"Board",currDE));
1286  leg->SetName(legendName.Data());
1287  }
1288 
1289  if ( ! perRPC ) {
1290  Int_t icolor = ich+1;
1291  trendGraph->SetLineColor(icolor);
1292  trendGraph->SetMarkerColor(icolor);
1293  trendGraph->SetMarkerStyle(24+ich);
1294  TF1* func = static_cast<TF1*>(trendGraph->GetListOfFunctions()->At(0));
1295  if ( func ) {
1296  func->SetLineWidth(2);
1297  func->SetLineColor(icolor);
1298  }
1299  }
1300  trendGraph->GetXaxis()->SetLabelSize(0.07);
1301  trendGraph->SetTitle("");
1302 
1303  trendGraph->Draw(drawOpt.Data());
1304  leg->AddEntry(trendGraph,Form("Chamber %i",11+ich),"lp");
1305  leg->Draw();
1306  for ( Int_t ichange=2; ichange<range.GetSize(); ichange++ ) {
1307  // Store only the run when the change applies
1308  if ( ichange%2 == 1 ) continue;
1309  Int_t runIdx = range[ichange];
1310 // if ( ichange != 0 ) {
1311  TLine* line = new TLine(runIdx,minEff,runIdx,maxEff);
1312  line->SetLineStyle(2);
1313  line->Draw("same");
1314  TLatex text;
1315  text.DrawLatex((Double_t)(runIdx-3),maxEff-0.1*(maxEff-minEff)*(Double_t)(ichange/2),Form("%i",GetRunNumber(runIdx)));
1316 // }
1317  hRunChangeCount->Fill(runIdx);
1318  if ( hRunChangeCount->GetBinContent(runIdx+1) == 1 ) {
1319  TString infoMsg = Form("Efficiency change in %i triggered by ch %i RPC %i",GetRunNumber(runIdx),11+ich,irpc);
1320  if ( ! perRPC ) infoMsg += Form(" Board %i",currDE);
1321  AliInfo(infoMsg.Data());
1322  }
1323  } // loop on change
1324  } // loop on detection element
1325 // }
1326  } // loop on chambers
1327  } // loop on RPC
1328 
1329  // Clusterize contiguous runs
1330  TArrayI runChangeClust(nRuns);
1331  Double_t sumWgtRun = 0.;
1332  Double_t sumWgt = 0;
1333  for ( Int_t irun=0; irun<=nRuns; irun++ ) {
1334  if ( irun == nRuns || hRunChangeCount->GetBinContent(irun+1) == 0 ) {
1335  if ( sumWgt > 0. ) {
1336  Int_t averageRun = TMath::Nint(sumWgtRun / sumWgt);
1337  AliDebug(2,Form("Average run: %i => %i",averageRun,GetRunNumber(averageRun)));
1338  runChangeClust[averageRun]++;
1339  sumWgtRun = 0.;
1340  sumWgt = 0.;
1341  }
1342  }
1343  if ( irun == nRuns ) break;
1344 
1345  AliDebug(2,Form("irun %i => %i: wgt %g",irun,GetRunNumber(irun),hRunChangeCount->GetBinContent(irun+1)));
1346 
1347 // Double_t wgt = (Double_t)runChangeCount[irun];
1348  Double_t wgt = hRunChangeCount->GetBinContent(irun+1);
1349  if ( forcedChanges ) {
1350  for ( Int_t ichange=0; ichange<forcedChanges->GetSize(); ichange++ ) {
1351  if ( GetRunNumber(irun) == forcedChanges->At(ichange) ) wgt *= 10.;
1352  }
1353  }
1354  sumWgtRun += wgt*(Double_t)irun;
1355  sumWgt += wgt;
1356  }
1357 
1358  TCanvas* summaryCan = new TCanvas("effChangeSummary","effChangeSummary",50,50,600,600);
1359  summaryCan->SetLogy();
1360  hRunChangeCount->GetXaxis()->LabelsOption("v");
1361  hRunChangeCount->Draw();
1362 
1363  Int_t ientry = 0;
1364  TArrayI runRanges(nRuns);
1365  runRanges[ientry++] = GetRunNumber(0);
1366  for ( Int_t irun=1; irun<nRuns; irun++ ) {
1367  if ( runChangeClust[irun] > 0 ) {
1368  runRanges[ientry++] = GetRunNumber(irun-1);
1369  runRanges[ientry++] = GetRunNumber(irun);
1370  }
1371  }
1372  runRanges[ientry++] = GetRunNumber(nRuns-1);
1373  runRanges.Set(ientry);
1374  return runRanges;
1375 }
1376 
1377 //________________________________________________________________________
1378 TArrayI AliMTRChEffAnalysis::GetHomogeneousRanges ( TGraphAsymmErrors* trendGraph, Double_t chi2Cut, Int_t maxNRanges, Double_t minEffVariation, TArrayI* forcedChanges, Bool_t returnIndex )
1379 {
1381 
1382  TArrayI runRanges;
1383  TF1* func = 0x0;
1384  TArrayD forcedChangesBin;
1385  Int_t nForced = 0;
1386  if ( forcedChanges ) {
1387  forcedChangesBin.Set(forcedChanges->GetSize());
1388  for ( Int_t ichange=0; ichange<forcedChanges->GetSize(); ichange++ ) {
1389  Int_t idx = GetIndexFromRun(forcedChanges->At(ichange));
1390  if ( idx >= 0 ) forcedChangesBin[nForced++] = (Double_t)idx;
1391  else AliWarning(Form("Cannot find run %i",forcedChanges->At(ichange)));
1392  }
1393  }
1394 
1395  Double_t minNormChi2 = 123456789.;
1396  Int_t minNormChi2Step = -1;
1397  TString fitOpt = "NQ0";
1398 // Double_t fakeVal = -999.;
1399 // TArrayD params(2*maxNRanges);
1400 // params.Reset(fakeVal);
1401 
1402  for ( Int_t istep=0; istep<maxNRanges; istep++ ) {
1403  Int_t nPars = 2*(istep+1);
1404  Double_t xMin = trendGraph->GetXaxis()->GetXmin();
1405  Double_t xMax = trendGraph->GetXaxis()->GetXmax();
1406  func = new TF1("rangeFunc",this,&AliMTRChEffAnalysis::FitRangesFunc,xMin,xMax,nPars,"AliMTRChEffAnalysis","FitRanges");
1407  func->FixParameter(0,istep);
1408  for ( Int_t ipar=1; ipar<nPars; ipar++ ) {
1409 // if ( ipar >= 2*istep ) {
1410 // if ( TMath::Abs(params[ipar]-fakeVal) < 0.01 ) {
1411 // if ( ipar%2 == 1 ) params[ipar] = 0.95;
1412 // else params[ipar] = (xMax-xMin) * (Double_t)(ipar/2)/((Double_t)(istep+1));
1413 // }
1414 // func->SetParameter(ipar,params[ipar]);
1415  Double_t val = ( ipar%2 == 1 ) ? 0.95 : (xMax-xMin) * (Double_t)(ipar/2)/((Double_t)(istep+1));
1416  func->SetParameter(ipar,val);
1417  if ( ipar%2 == 0 ) func->SetParLimits(ipar,xMin,xMax);
1418  }
1419 
1420  TFitResultPtr fitResult = trendGraph->Fit(func,fitOpt.Data());
1421  // If fit converges close to a point where a break is forced
1422  // fix parameters and redo the fit
1423  if ( forcedChanges ) {
1424  Bool_t hasFixedPars = kFALSE;
1425  for ( Int_t iforced=0; iforced<nForced; iforced++ ) {
1426  for ( Int_t jstep=0; jstep<istep; jstep++ ) {
1427  Int_t ipar = 2*(jstep+1);
1428  if ( TMath::Abs(forcedChangesBin[iforced]-func->GetParameter(ipar)) > 2. ) continue;
1429  func->FixParameter(ipar,forcedChangesBin[iforced]);
1430  hasFixedPars = kTRUE;
1431  }
1432  }
1433  if ( hasFixedPars ) fitResult = trendGraph->Fit(func,fitOpt.Data());
1434  }
1435 
1436 // for ( Int_t ipar=1; ipar<nPars; ipar++ ) {
1437 // params[ipar] = func->GetParameter(ipar);
1438 // }
1439 
1440  Double_t normChi2 = func->GetChisquare() / ((Double_t)func->GetNDF());
1441  if ( normChi2 < minNormChi2 ) {
1442  minNormChi2 = normChi2;
1443  minNormChi2Step = istep;
1444  }
1445 // if ( static_cast<int>(fitResult) == 0 && normChi2 < chi2Cut ) break;
1446  if ( normChi2 < chi2Cut ) break; // REMEMBER TO CHECK
1447  delete func;
1448  func = 0x0;
1449  }
1450 
1451  if ( func ) {
1452  trendGraph->GetListOfFunctions()->Add(func->Clone());
1453  Int_t nSteps = (Int_t)func->GetParameter(0);
1454 
1455  // The runs for which the efficiency changes could be unsorted
1456  // (when forced values are requires)
1457  // Copy the parameters in arrays to sort them
1458  Int_t nPoints = nSteps+1;
1459  TArrayD parRunIdx(nPoints);
1460  TArrayD parEff(nPoints);
1461  for ( Int_t ipar=0; ipar<func->GetNpar(); ipar++ ) {
1462  Int_t istep = ipar/2;
1463  if ( ipar%2 == 0 ) parRunIdx[istep] = func->GetParameter(ipar);
1464  else parEff[istep] = func->GetParameter(ipar);
1465  }
1466  parRunIdx[0] = 0.;
1467  TArrayI sortIdx(nPoints);
1468  TMath::Sort(nPoints,parRunIdx.GetArray(),sortIdx.GetArray(),kFALSE);
1469 
1470  runRanges.Set(2*nPoints);
1471  Int_t irun = 0;
1472  runRanges[irun++] = returnIndex ? 0 : GetRunNumber(0);
1473  for ( Int_t ipoint=1; ipoint<nPoints; ipoint++ ) {
1474  Double_t deltaEff = TMath::Abs(parEff[sortIdx[ipoint]]-parEff[sortIdx[ipoint-1]]);
1475 // if ( ipoint>=2 ) deltaEff = TMath::Max(deltaEff,TMath::Abs(parEff[sortIdx[ipoint]]-parEff[sortIdx[ipoint-2]]));
1476  if ( deltaEff < minEffVariation ) {
1477  AliWarning(Form("Efficiency variation for %s is %g => consider uniform",trendGraph->GetName(),deltaEff));
1478  continue;
1479  }
1480  Int_t runChangeIdx = TMath::Nint(parRunIdx[sortIdx[ipoint]]);
1481  AliDebug(1,Form("Change run: %s => %g => %i %i",trendGraph->GetName(),parRunIdx[sortIdx[ipoint]],runChangeIdx,GetRunNumber(runChangeIdx)));
1482  runRanges[irun++] = returnIndex ? runChangeIdx-1 : GetRunNumber(runChangeIdx-1);
1483  runRanges[irun++] = returnIndex ? runChangeIdx : GetRunNumber(runChangeIdx);
1484  }
1485  Int_t lastPt = trendGraph->GetN()-1;
1486  runRanges[irun++] = returnIndex ? lastPt : GetRunNumber(lastPt);
1487  runRanges.Set(irun);
1488  }
1489  else {
1490  AliWarning(Form("Fit did not converge for %s (minimum chi2 %g for step %i)",trendGraph->GetName(),minNormChi2,minNormChi2Step));
1491  }
1492  return runRanges;
1493 }
1494 
1495 //________________________________________________________________________
1496 TString AliMTRChEffAnalysis::GetId ( const char* condition, Int_t minRun, Int_t maxRun ) const
1497 {
1499  if ( maxRun < minRun ) maxRun = minRun;
1500  return Form("%s_%i_%i",condition,minRun,maxRun);
1501 }
1502 
1503 //________________________________________________________________________
1505 {
1508  if ( obj->GetMinRun() == runNumber ) {
1509  return obj->GetUniqueID();
1510  break;
1511  }
1512  }
1513  return -1;
1514 }
1515 
1516 //________________________________________________________________________
1518 {
1520 // TGraphAsymmErrors* outliers = new TGraphAsymmErrors();
1521  TGraphAsymmErrors* outliers = new TGraphAsymmErrors(*graph);
1522  outliers->SetHistogram(static_cast<TH1F*>(graph->GetHistogram()->Clone(Form("%s_outliers",graph->GetHistogram()->GetName()))));
1523 // outliers->SetLineColor(graph->GetLineColor()+1);
1524  if ( graph->GetListOfFunctions()->GetEntries() == 0 ) graph->Fit("pol0","Q0");
1525  TF1* func = static_cast<TF1*>(graph->GetListOfFunctions()->At(0));
1526 
1527  Double_t xpt, ypt;
1528  Int_t nremoved = 0;
1529  for ( Int_t ipt=0; ipt<graph->GetN(); ipt++ ) {
1530  graph->GetPoint(ipt,xpt,ypt);
1531  Double_t diff = ypt - func->Eval(xpt);
1532  Double_t err = ( diff > 0. ) ? graph->GetErrorYlow(ipt) : graph->GetErrorYhigh(ipt);
1533  if ( err < 0. || TMath::Abs(diff)/err > maxNsigmas ) continue;
1534  outliers->RemovePoint(ipt-nremoved);
1535  nremoved++;
1536 // outliers->SetPoint(iopt,xpt,ypt);
1537  }
1538  return outliers;
1539 }
1540 
1541 //________________________________________________________________________
1543 {
1545  if ( ipt < 0 || ipt >= fRunMap.size() ) return -1;
1546  return fRunMap[ipt]->GetMinRun();
1547 }
1548 
1549 //________________________________________________________________________
1550 TList* AliMTRChEffAnalysis::GetRunList ( const char* runList ) const
1551 {
1553  TList* rl = new TList;
1554  rl->SetOwner();
1555  TString sRunList = gSystem->ExpandPathName(runList);
1556  if ( gSystem->AccessPathName(sRunList) || sRunList.EndsWith(".root") ) {
1557  sRunList.ReplaceAll(","," ");
1558  if ( sRunList.IsDigit() ) {
1559  TObjArray* arr = sRunList.Tokenize(" ");
1560  for ( Int_t iarr=0; iarr<arr->GetEntries(); iarr++ ) {
1561  rl->Add(new TObjString(arr->At(iarr)->GetName()));
1562  }
1563  delete arr;
1564  }
1565  }
1566  else {
1567  ifstream inFile(sRunList.Data());
1568  TString currLine = "";
1569  while ( ! inFile.eof() ) {
1570  currLine.ReadLine(inFile);
1571  TString currRun = AliAnalysisMuonUtility::GetRunNumberAsString(currLine);
1572  if ( ! currRun.IsNull() ) rl->Add(new TObjString(currRun));
1573  }
1574  inFile.close();
1575  }
1576  rl->Sort();
1577  return rl;
1578 }
1579 
1580 //________________________________________________________________________
1581 TString AliMTRChEffAnalysis::GetShortConditionTitle ( const char* conditionName ) const
1582 {
1584 
1585  TString sCond(conditionName);
1586  TObjArray* refCondition = static_cast<TObjArray*>(fConditions->UncheckedAt(0));
1587  TString sRef(refCondition->GetName());
1588 
1589  TObjArray* condition = static_cast<TObjArray*>(fConditions->FindObject(conditionName));
1590  TString title = "";
1591  if ( ! condition || sCond == sRef ) {
1592  title = sCond;
1593  }
1594  else {
1595  for ( Int_t ic=0; ic<condition->GetEntriesFast(); ic++ ) {
1596  TString currCond = static_cast<TObjString*>(condition->UncheckedAt(ic))->String();
1597  TString refCond = static_cast<TObjString*>(refCondition->UncheckedAt(ic))->String();
1598  if ( currCond == refCond ) continue;
1599  title += ";" + currCond;
1600  }
1601  title.Remove(TString::kLeading,';');
1602  }
1603  title.ReplaceAll(",","+");
1604 
1605  return title;
1606 }
1607 
1608 //________________________________________________________________________
1609 TH1* AliMTRChEffAnalysis::GetSum ( AliTrigChEffOutput* trigOut, TObjArray* condition, Int_t itype, Int_t icount, Int_t ichamber ) const
1610 {
1612  TString objName = "";
1613  for ( Int_t ic=3; ic<6; ic++ ) {
1614  objName += condition->UncheckedAt(ic)->GetName();
1615  }
1616  return static_cast<TH1*>(trigOut->GetSum(condition->At(0)->GetName(),condition->At(1)->GetName(),condition->At(2)->GetName(),objName));
1617 }
1618 
1619 //________________________________________________________________________
1620 TH1* AliMTRChEffAnalysis::GetTrend ( Int_t itype, Int_t icount, Int_t ichamber, Int_t idetelem ) const
1621 {
1623  if ( itype == AliTrigChEffOutput::kHchamberEff ) {
1624  if ( idetelem < 0 && ichamber >=0 ) idetelem = 11+ichamber;
1625  }
1626  TH1* outHisto = 0x0;
1627 
1628  Int_t nRuns = fRunMap.size();
1629 
1630  Int_t ibin = 0;
1632  ibin++;
1633  TList* effHistoList = obj->GetEffHistoList(fConditions->UncheckedAt(0)->GetName());
1634  if ( ! outHisto ) {
1635 // TString outName = identifier;
1636  TString outName = Form("histo_type%i_count%i_ch%i_",itype,icount,11+ichamber);
1637 // outName.ReplaceAll("/","_");
1638  outName += Form("%i_trend",idetelem);
1639  outHisto = new TH1D(outName.Data(),outName.Data(),nRuns,0.,(Double_t)nRuns);
1640  outHisto->SetDirectory(0);
1641  outHisto->GetXaxis()->SetTitle("Run num.");
1642  }
1643  Int_t run = obj->GetMinRun();
1644  outHisto->GetXaxis()->SetBinLabel(ibin,Form("%i",run));
1645  TH1* histo = GetHisto(effHistoList,itype,icount,ichamber);
1646  Int_t currBin = histo->GetXaxis()->FindBin(idetelem);
1647  outHisto->SetBinContent(ibin,histo->GetBinContent(currBin));
1648  outHisto->SetBinError(ibin,histo->GetBinError(currBin));
1649  }
1650  if ( outHisto ) outHisto->GetXaxis()->LabelsOption("v");
1651  return outHisto;
1652 }
1653 
1654 //________________________________________________________________________
1655 TGraphAsymmErrors* AliMTRChEffAnalysis::GetTrendEff ( Int_t itype, Int_t icount, Int_t ichamber, Int_t idetelem ) const
1656 {
1658  if ( icount == AliTrigChEffOutput::kAllTracks ) {
1659  AliWarning("Chose either bending plane, non-bending plane or both planes");
1660  return NULL;
1661  }
1662  TH1* histoNum = GetTrend(itype,icount,ichamber,idetelem);
1663  TH1* histoDen = GetTrend(itype,AliTrigChEffOutput::kAllTracks,ichamber,idetelem);
1664  TGraphAsymmErrors* graph = new TGraphAsymmErrors(histoNum,histoDen,"e0");
1665  histoNum->Reset();
1666  histoNum->SetStats(kFALSE);
1667  // Solves crash when saving the canvas as a root file
1668  graph->SetHistogram(new TH1F(*static_cast<TH1F*>(histoNum)));
1669  graph->GetYaxis()->SetTitle("Efficiency");
1670  graph->SetMarkerSize(0.5);
1671 // for ( Int_t ibin=1; ibin<=histoNum->GetXaxis()->GetNbins(); ibin++ ) {
1672 // graph->GetXaxis()->SetBinLabel(ibin,histoNum->GetXaxis()->GetBinLabel(ibin));
1673 // }
1674  delete histoNum;
1675  delete histoDen;
1676  return graph;
1677 }
1678 
1679 //________________________________________________________________________
1681 {
1683  Double_t binomialEff = 0.;
1684  Double_t sumErr2 = 0.;
1685  for ( Int_t jch=-1; jch<4; jch++ ) {
1686  Double_t prodEff = 1.;
1687  Double_t prodErr2 = 0.;
1688  for ( Int_t ich=0; ich<4; ich++ ) {
1689  Double_t currEff = ( ich == jch ) ? 1.-eff[ich] : eff[ich];
1690  prodEff *= currEff;
1691  Double_t relErr = ( currEff>0. ) ? effErr[ich]/currEff : 0.;
1692  prodErr2 += relErr*relErr;
1693  }
1694  binomialEff += prodEff;
1695  sumErr2 += prodEff*prodEff*prodErr2;
1696  }
1697  probErr = TMath::Sqrt(sumErr2);
1698  return binomialEff;
1699 }
1700 
1701 //________________________________________________________________________
1703 {
1705  if ( fMergedMap.empty() ) {
1706  AliError("You first need to merge efficiency objects with MergeOutput");
1707  return kFALSE;
1708  }
1709  return kTRUE;
1710 }
1711 
1712 //________________________________________________________________________
1713 Bool_t AliMTRChEffAnalysis::MergeOutput ( TArrayI runRanges, Double_t averageStatError, Bool_t isIndex )
1714 {
1716 
1717  if ( runRanges.GetSize()%2 == 1 ) {
1718  AliError("Run ranges expected in the form: start_period1,end_period1,start_period2,end_period2... => even number expected");
1719  return kFALSE;
1720  }
1721 
1722  TArrayI mergedRanges = MergeRangesForStat(runRanges, averageStatError);
1723 
1724  AliInfo("Merging efficiencies");
1725 
1726  Int_t nRanges = mergedRanges.GetSize()/2;
1727 
1728 
1729  if ( fMergedMap.size() > 0 ) {
1730  for ( AliMTRChEffAnalysis::AliMTRChEffInnerObj* obj : fMergedMap ) delete obj;
1731  fMergedMap.clear();
1732  }
1733 
1734  for ( Int_t irange=0; irange<nRanges; irange++ ) {
1735  Int_t firstRun = mergedRanges[2*irange];
1736  Int_t lastRun = mergedRanges[2*irange+1];
1737  if ( isIndex ) {
1738  firstRun = GetRunNumber(firstRun);
1739  lastRun = GetRunNumber(lastRun);
1740  }
1741 
1742  TString filename = "", outputname = "";
1743 
1744  TFileMerger fileMerger;
1746  Int_t run = obj->GetMinRun();
1747  if ( run < firstRun || run > lastRun ) continue;
1748  filename = obj->GetFilename();
1749  outputname = obj->GetOutputname();
1750  if ( firstRun == lastRun ) continue;
1751  fileMerger.AddFile(filename.Data(),kFALSE);
1752  }
1753 
1754  TString sRange = Form("%i_%i",firstRun,lastRun);
1755  TString mergedFilename = Form("mergedTrigEff_runs_%s.root",sRange.Data());
1756 
1757  if ( firstRun == lastRun ) TFile::Cp(filename.Data(),mergedFilename.Data(),kFALSE);
1758  else {
1759  fileMerger.OutputFile(mergedFilename.Data());
1760  fileMerger.Merge();
1761  }
1762  AliTrigChEffOutput* trigOut = new AliTrigChEffOutput(mergedFilename,outputname);
1763  AliMTRChEffInnerObj* mergedObj = new AliMTRChEffInnerObj(mergedFilename.Data(),outputname.Data(),firstRun,lastRun);
1764  for ( Int_t icond=0; icond<fConditions->GetEntriesFast(); icond++ ) {
1765  TObjArray* condition = static_cast<TObjArray*>(fConditions->UncheckedAt(icond));
1766  TList* effHistoList = GetEffHistoList(trigOut,condition);
1767  mergedObj->AddEffHistoList(condition->GetName(), effHistoList);
1768  }
1769  fMergedMap.push_back(mergedObj);
1770  delete trigOut;
1771  }
1772  return kTRUE;
1773 }
1774 
1775 //________________________________________________________________________
1776 TArrayI AliMTRChEffAnalysis::MergeRangesForStat ( TArrayI runRanges, Double_t averageStatError, Bool_t excludePeriphericBoards ) const
1777 {
1778  if ( averageStatError <= 0. || averageStatError >= 1. ) return runRanges;
1779 
1780  // FIXME: statstical error for binomial depends on the value of epsilon
1781  // for the moment let's assume an average efficiency of 0.9 (underestimated)
1782  // in the future one could maybe actually calculate it
1783  // (still we're working with average values...so the precision is limited)
1784  Double_t effForStatCalc = 0.9;
1785 
1786  Double_t averageStatNeeded = effForStatCalc*(1.-effForStatCalc)/(averageStatError*averageStatError);
1787 
1788  AliInfo(Form("Average statistics needed to reach precision of %g : %g",averageStatError,averageStatNeeded));
1789 
1790  Int_t nRanges = runRanges.GetSize()/2;
1791 
1792  TArrayD averageStat(nRanges);
1793  Double_t fullStat = 0.;
1794  for ( Int_t irange=0; irange<nRanges; irange++ ) {
1795  averageStat[irange] = GetAverageStat(runRanges[2*irange],runRanges[2*irange+1],AliTrigChEffOutput::kHboardEff,excludePeriphericBoards);
1796  fullStat += averageStat[irange];
1797  }
1798 
1799  TArrayI mergedRanges(runRanges.GetSize());
1800  Int_t imerged = 0;
1801  mergedRanges[imerged++] = runRanges[0];
1802  Double_t mergedAverageStat = 0., remainingStat = fullStat;
1803  for ( Int_t irange=0; irange<nRanges; irange++ ) {
1804  Int_t istart = 2*irange;
1805  Int_t iend = istart+1;
1806  mergedAverageStat += averageStat[irange];
1807  remainingStat -= averageStat[irange];
1808 
1809  AliInfo(Form("%i - %i => stat %g",runRanges[2*irange],runRanges[2*irange+1],averageStat[irange]));
1810 
1811  if ( ( mergedAverageStat >= averageStatNeeded && remainingStat >= averageStatNeeded ) || iend == runRanges.GetSize()-1 ) {
1812  mergedRanges[imerged++] = runRanges[iend];
1813  AliInfo(Form(" merged range %i - %i => stat %g",mergedRanges[imerged-2],mergedRanges[imerged-1],mergedAverageStat));
1814  mergedAverageStat = 0.;
1815  Int_t nextRun = iend+1;
1816  if ( nextRun < runRanges.GetSize() ) mergedRanges[imerged++] = runRanges[nextRun];
1817  }
1818  }
1819  mergedRanges.Set(imerged);
1820  return mergedRanges;
1821 }
1822 
1823 //________________________________________________________________________
1825 {
1827  if ( fNamer ) return fNamer;
1828 
1829  TObjArray arr;
1830  fNamer = new AliTrigChEffOutput(&arr,"dummy");
1831 
1832  return fNamer;
1833 }
1834 
1835 
1836 //________________________________________________________________________
1838 {
1840  TString currSrc(src);
1841  TString trigEffCDBdir = "MUON/Calib/TriggerEfficiency";
1842 
1843  if ( currSrc.BeginsWith("alien") && ! gGrid ) TGrid::Connect("alien://");
1844 
1845  AliMUONTriggerEfficiencyCells* effMap = 0x0;
1846  Bool_t deleteMap = kTRUE;
1847  if ( currSrc.EndsWith(".root") ) effMap = new AliMUONTriggerEfficiencyCells(currSrc.Data());
1848  else {
1849  TObjArray* dirRun = currSrc.Tokenize("?");
1850  TString cdbPath = dirRun->UncheckedAt(0)->GetName();
1851  TString runNum = ( dirRun->GetEntriesFast() > 1 ) ? dirRun->UncheckedAt(1)->GetName() : "";
1852  AliCDBManager* mgr = AliCDBManager::Instance();
1853  if ( ! mgr->GetDefaultStorage() ) mgr->SetDefaultStorage("local://$ALICE_ROOT/OCDB");
1854  if ( mgr->GetEntryCache()->Contains(trigEffCDBdir.Data()) ) mgr->UnloadFromCache(trigEffCDBdir.Data());
1855  mgr->SetSpecificStorage(trigEffCDBdir.Data(),cdbPath.Data());
1856  Int_t runNumber = 0;
1857  if ( runNum.IsNull() ) {
1858  cout << "Please enter run number: " << endl;
1859  cin >> runNumber;
1860  }
1861  else runNumber = runNum.Atoi();
1862  mgr->SetRun(runNumber);
1863  AliCDBEntry* cdbEntry = mgr->Get(trigEffCDBdir.Data());
1864 
1865  // The CDB manager replace the current effMap with another in case two specific storage are provided
1866  // To avoid double deletion, do not delete the object
1867  deleteMap = kFALSE;
1868  effMap = static_cast<AliMUONTriggerEfficiencyCells*>(cdbEntry->GetObject());
1869  }
1870 
1871  if ( ! effMap ) {
1872  AliError(Form("Cannot find effieciency map in %s",src));
1873  return 0x0;
1874  }
1875 
1876  TList* effHistoList = CloneEffHistoList(effMap->GetHistoList());
1877  if ( deleteMap ) delete effMap;
1878 
1879  return effHistoList;
1880 }
1881 
1882 //________________________________________________________________________
1883 Bool_t AliMTRChEffAnalysis::RecoverEfficiency ( const char* runList, const char* ocdb, const char* systOcdb, Int_t referenceRun )
1884 {
1892 
1893  if ( ! HasMergedResults() ) return kFALSE;
1894 
1895  AliInfo("Check for local boards where the efficiency could not be computed and recover it from other maps");
1896 
1897  TList* rList = 0x0;
1898  std::vector<TList*> readEffLists;
1899  std::vector<TList*> systLists;
1900 
1901  TString refRun = "";
1902  if ( referenceRun >= 0 ) refRun = Form("%i",referenceRun);
1903  TList *refRead = 0x0, *refSyst = 0x0;
1904 
1905  // Search for chambers with missing efficiencies
1906  TString currName = "";
1908  TList* effList = obj->GetEffHistoList(fConditions->UncheckedAt(0)->GetName());
1909  std::vector<TH1*> histoList;
1910  histoList.reserve(16);
1911  for ( Int_t ich=0; ich<4; ich++ ) {
1912  for ( Int_t icount=0; icount<4; icount++ ) {
1913  currName = Namer()->GetHistoName(AliTrigChEffOutput::kHboardEff, icount, ich, -1, -1, -1);
1914  histoList[4*ich+icount] = static_cast<TH1*>(effList->FindObject(currName.Data()));
1915  }
1916  }
1917  for ( Int_t ibin=1; ibin<=histoList[0]->GetXaxis()->GetNbins(); ibin++ ) {
1918  Bool_t isUnknown[4] = {0,0,0,0};
1919  Int_t nDead = 0, nUnknown = 0;
1920  for ( Int_t ich=0; ich<4; ich++ ) {
1921  Double_t countAll = histoList[4*ich+AliTrigChEffOutput::kAllTracks]->GetBinContent(ibin);
1922  if ( countAll > 10 ) {
1923  Double_t eff = histoList[4*ich+AliTrigChEffOutput::kBothPlanesEff]->GetBinContent(ibin) / countAll;
1924  if ( eff<0.1 ) nDead++;
1925  }
1926  else {
1927  isUnknown[ich] = 1;
1928  nUnknown++;
1929  }
1930  }
1931  if ( nDead > 0 ) {
1932  if ( nUnknown == 3 ) {
1933  for ( Int_t ich=0; ich<4; ich++ ) {
1934  AliInfo(Form("Recovering board %i in ch %i",ibin,11+ich));
1935  if ( ! isUnknown[ich] ) continue;
1936  if ( readEffLists.size() == 0 ) {
1937  // Initialize once all needed objects for recovery
1938  rList = GetRunList(runList);
1939  if ( rList->GetEntries() == 0 ) {
1940  AliError("A recovery is needed, but no run list is specified: please specify it");
1941  return kFALSE;
1942  }
1943  if ( refRun.IsNull() ) refRun = rList->Last()->GetName();
1944  else if ( ! rList->FindObject(refRun.Data()) ) rList->Add(new TObjString(refRun));
1945  AliInfo(Form("Using efficiency of run %s",refRun.Data()));
1946  for ( Int_t itype=0; itype<2; itype++ ) {
1947  // Loop once on standard efficiency and another time for systematic efficiency
1948  TString currOcdb = ( itype == 0 ) ? ocdb : systOcdb;
1949  TString baseName = ( itype == 0 ) ? "RecoveredFrom" : "RecoveredSystFrom";
1950  TIter next(rList);
1951  TObjString* runObj = 0x0;
1952  while ( (runObj = static_cast<TObjString*>(next())) ) {
1953  Bool_t isRefRun = ( runObj->String() == refRun );
1954  // We only need the systematics for the chosen run
1955  if ( itype == 1 && ! isRefRun ) continue;
1956  TList* readList = ReadEffHistoList(Form("%s?%s",currOcdb.Data(),runObj->GetName()));
1957  readEffLists.push_back(readList);
1958 
1959  // The systematic efficiency list is a clone of the merged efficiency object
1960  // We will copy later on the recovered efficiency ONLY for the missing boards
1961  TList* systEffList = CloneEffHistoList(effList);
1962  systEffList->SetName(Form("%s_%s",baseName.Data(),runObj->GetName()));
1963  systLists.push_back(systEffList);
1964 
1965  if ( isRefRun && itype == 0 ) {
1966  refRead = readList;
1967  refSyst = systEffList;
1968  }
1969  } // loop on runs
1970  } // loop on standard or systematic OCDB
1971  }
1972  for ( Int_t imap=0; imap<readEffLists.size(); imap++ ) {
1973  TList* readList = readEffLists[imap];
1974  for ( Int_t icount=0; icount<4; icount++ ) {
1975  currName = Namer()->GetHistoName(AliTrigChEffOutput::kHboardEff, icount, ich, -1, -1, -1);
1976  TH1* histoFrom = static_cast<TH1*>(readList->FindObject(currName.Data()));
1977  TH1* histoTo = ( readList == refRead ) ? histoList[4*ich+icount] : static_cast<TH1*>(systLists[imap]->FindObject(currName.Data()));
1978  histoTo->SetBinContent(ibin,histoFrom->GetBinContent(ibin));
1979  } // loop on counts
1980  } // loop on maps
1981  } // loop on chambers
1982  } // needs recovery
1983  else AliWarning(Form("Local board %i: unknown efficiency: %i %i %i %i",ibin,isUnknown[0],isUnknown[1],isUnknown[2],isUnknown[3]));
1984  }
1985  } // loop on local boards
1986  for ( TList* systEffHistoList : systLists ) {
1987  if ( systEffHistoList == refSyst ) continue;
1988  obj->AddEffHistoList(systEffHistoList->GetName(),systEffHistoList);
1989  }
1990  } // loop on merged objects
1991 
1992  // Delete objects
1993  for ( TList* obj : systLists ) delete obj;
1994  readEffLists.clear();
1995  delete rList;
1996 
1997  return kTRUE;
1998 }
1999 
2000 //________________________________________________________________________
2001 Bool_t AliMTRChEffAnalysis::SetCondition ( const char* physSel, const char* trigClassName, const char* centrality, Int_t itrackSel, Int_t imatch, Int_t imethod, Bool_t isBasic )
2002 {
2004  if ( ! fConditions ) {
2005  fConditions = new TObjArray();
2006  fConditions->SetOwner();
2007  }
2008 
2009 
2010  TString sCondition = Form("%s;%s;%s",physSel,trigClassName,centrality);
2011  sCondition += ";" + Namer()->GetHistoName(-1,-1,-1,itrackSel,-1,-1);
2012  sCondition += ";" + Namer()->GetHistoName(-1,-1,-1,-1,imatch,-1);
2013  sCondition += ";" + Namer()->GetHistoName(-1,-1,-1,-1,-1,imethod);
2014 
2015  TObjArray* foundCondition = static_cast<TObjArray*>(fConditions->FindObject(sCondition.Data()));
2016  TObjArray* basicCondition = static_cast<TObjArray*>(fConditions->At(0));
2017 
2018  TObjArray* addCondition = 0x0;
2019 
2020  if ( foundCondition ) {
2021  if ( isBasic ) {
2022  if ( foundCondition == basicCondition ) return kFALSE;
2023  else {
2024  fConditions->Remove(foundCondition);
2025  addCondition = foundCondition;
2026  }
2027  }
2028  else {
2029  AliInfo("Systematic condition already added");
2030  return kFALSE;
2031  }
2032  }
2033  else {
2034  addCondition = sCondition.Tokenize(";");
2035  addCondition->SetName(sCondition.Data());
2036  addCondition->UncheckedAt(3)->SetUniqueID(itrackSel);
2037  addCondition->UncheckedAt(4)->SetUniqueID(imatch);
2038  addCondition->UncheckedAt(5)->SetUniqueID(imethod);
2039  }
2040 
2041 
2042  if ( isBasic ) {
2043  if ( basicCondition ) {
2044  AliInfo(Form("Changing current eff. condition: %s",basicCondition->GetName()));
2045  fConditions->Remove(basicCondition);
2046  delete basicCondition;
2047  }
2048  fConditions->AddAt(addCondition,0);
2049  fConditions->Compress();
2050 
2051  // Update outputs
2053  obj->RemoveEffHistoList(sCondition.Data());
2054  AddToList(obj->GetFilename(), obj->GetOutputname());
2055  }
2056  }
2057  else fConditions->Add(addCondition);
2058 
2059  return kTRUE;
2060 }
2061 
2062 //________________________________________________________________________
2064 {
2067 }
2068 
2069 
2070 //________________________________________________________________________
2071 Bool_t AliMTRChEffAnalysis::SetEffConditions ( const char* physSel, const char* trigClassName, const char* centrality, Int_t itrackSel, Int_t imatch, Int_t imethod )
2072 {
2074  return SetCondition(physSel, trigClassName, centrality, itrackSel, imatch, imethod, kTRUE);
2075 }
2076 
2077 //________________________________________________________________________
2078 Bool_t AliMTRChEffAnalysis::SetOutList ( const char *localFileList, const char *outputName )
2079 {
2081 
2082  AliInfo("Reading efficiency objects");
2083 
2085 
2086  TString filename(localFileList);
2087  gSystem->ExpandPathName(filename);
2088  if ( gSystem->AccessPathName(filename.Data()) ) {
2089  AliWarning(Form("Cannot find %s",filename.Data()));
2090  return kFALSE;
2091  }
2092  if ( filename.EndsWith(".root") ) return AddToList(filename.Data(),outputName);
2093 
2094  Bool_t isOk = kTRUE;
2095  ifstream inFile(filename.Data());
2096  TString currLine = "";
2097  while ( ! inFile.eof() ) {
2098  currLine.ReadLine(inFile);
2099  if ( currLine.IsNull() ) continue;
2100  if ( gSystem->AccessPathName(currLine.Data()) ) continue;
2101  if ( ! AddToList(currLine.Data(), outputName) ) isOk = kFALSE;
2102  }
2103  inFile.close();
2104 
2105  return isOk;
2106 }
2107 
2108 //________________________________________________________________________
2109 Bool_t AliMTRChEffAnalysis::SetResultsFromGrid ( const char *runList, const char *path, const char *pattern, const char* localFileList, const char* outDir, const char *directory, const char* outputName )
2110 {
2112  CopyLocally(runList,path,pattern,localFileList,outDir,directory);
2113  return SetOutList(localFileList,outputName);
2114 }
2115 
2116 //________________________________________________________________________
2117 Bool_t AliMTRChEffAnalysis::SetResultsFromWeb ( const char *runList, const char *path, const char* localFileList, const char* outDir, const char *directory, const char* outputName )
2118 {
2120  CopyLocally(runList,path,"",localFileList,outDir,directory);
2121  return SetOutList(localFileList,outputName);
2122 }
2123 
2124 //________________________________________________________________________
2125 Bool_t AliMTRChEffAnalysis::WriteMergedToOCDB ( const char* outputCDB, Bool_t writeSystematics ) const
2126 {
2128  if ( ! HasMergedResults() ) return kFALSE;
2129 
2130  AliInfo("Writing merged efficiencies to OCDB");
2131 
2132  TString outCDB(outputCDB);
2133  if ( ! outCDB.Contains("://") || outCDB == "raw://" ) {
2134  AliError("Invalid CDB output dir");
2135  return kFALSE;
2136  }
2137 
2138  TString rmCommand = "rm";
2139  if ( outCDB.BeginsWith("alien://") && ! gGrid ) {
2140  TGrid::Connect("alien://");
2141  rmCommand = "alien_rm";
2142  if ( ! gGrid ) {
2143  AliError("Cannot open grid connection");
2144  return kFALSE;
2145  }
2146  }
2147 
2148  AliCDBManager* mgr = AliCDBManager::Instance();
2149  if ( ! mgr->GetDefaultStorage() ) mgr->SetDefaultStorage("local://$ALICE_ROOT/OCDB");
2150 
2151  TString trigEffCDBdir = "MUON/Calib/TriggerEfficiency";
2152 
2153  mgr->SetSpecificStorage(trigEffCDBdir.Data(),outCDB.Data());
2154 
2155  AliCDBStorage* specificStorage = mgr->GetSpecificStorage(trigEffCDBdir.Data());
2156  TString baseOutDir = specificStorage->GetBaseFolder();
2157 
2158  TString condName = ( writeSystematics ) ? "Systematics" : fConditions->UncheckedAt(0)->GetName();
2159 
2161  TList* effHistos = obj->GetEffHistoList(condName.Data());
2162  if ( ! effHistos ) {
2163  AliWarning("No systematic condition found: you should first run BuildSystematicMap");
2164  continue;
2165  }
2166 
2167  // Write OCDB object
2168  Int_t firstRun = obj->GetMinRun();
2169  Int_t lastRun = obj->GetMaxRun();
2170 
2171  // If an object is already there, ask to remove it or keep it
2172  for ( Int_t irun=0; irun<2; irun++ ) {
2173  Int_t runnr = ( irun == 0 ) ? firstRun : lastRun;
2174  specificStorage->QueryCDB(runnr);
2175  TObjArray* allIdsForRun = specificStorage->GetQueryCDBList();
2176  TIter nextId(allIdsForRun);
2177  AliCDBId* id = 0x0;
2178  while ((id = static_cast<AliCDBId*>(nextId()))) {
2179  TString path(id->GetPath());
2180  Int_t foundFirst = id->GetFirstRun();
2181  Int_t foundLast = id->GetLastRun();
2182  Int_t version = id->GetVersion();
2183  Int_t subversion = TMath::Max(id->GetSubVersion(),0);
2184  TString fullPath = Form("%s/%s/Run%d_%d_v%d_s%d.root",baseOutDir.Data(),path.Data(),foundFirst,foundLast,version,subversion);
2185  ExecCommand(Form("%s %s",rmCommand.Data(),fullPath.Data()), kTRUE);
2186  }
2187  }
2188 
2189  // Save the CDB object in the specific storage
2190  AliMUONTriggerEfficiencyCells* effMap = new AliMUONTriggerEfficiencyCells(CloneEffHistoList(effHistos));
2191  AliMUONCDB::WriteToCDB(effMap, "MUON/Calib/TriggerEfficiency", firstRun, lastRun, "Measured efficiencies");
2192  delete effMap; // CAVEAT: effMap is owner of effHistos
2193  }
2194  return kTRUE;
2195 }
2196 
2197 //___________________________________________________________________________
2198 AliMTRChEffAnalysis::AliMTRChEffInnerObj::AliMTRChEffInnerObj ( const char* filename, const char* outputname, Int_t minRun, Int_t maxRun ) :
2199  TObject(),
2200  fFilename(filename),
2201  fOutputname(outputname),
2202  fMinRun(minRun),
2203  fMaxRun(maxRun)
2204 {
2206  if ( fMaxRun < fMinRun ) fMaxRun = fMinRun;
2207 }
2208 
2209 //___________________________________________________________________________
2211 {
2213  for ( auto& mapEntry : fEffLists ) delete mapEntry.second;
2214  fEffLists.clear();
2215 }
2216 
2217 //___________________________________________________________________________
2219 {
2221  auto const& mapEntry = fEffLists.find(condition);
2222  if ( mapEntry == fEffLists.end() ) return 0x0;
2223  return mapEntry->second;
2224 }
2225 
2226 //___________________________________________________________________________
2228 {
2230  if ( fEffLists.find(condition) != fEffLists.end() ) {
2231  AliWarning(Form("Condition %s already present: nothing done",condition));
2232  return kFALSE;
2233  }
2234  fEffLists.insert({condition,effHistoList});
2235  fSortKeys.push_back(condition);
2236  return kTRUE;
2237 }
2238 
2239 //___________________________________________________________________________
2241 {
2243  auto const& mapEntry = fEffLists.find(condition);
2244  if ( mapEntry == fEffLists.end() ) return kFALSE;
2245  delete mapEntry->second;
2246  return fEffLists.erase(condition);
2247 }
Counts per cathode histogram index.
const char * filename
Definition: TestFCM.C:1
return jsonbuilder str().c_str()
TList * GetEffHistoList(TString physSel, TString trigClassNames, TString centrality, Int_t itrackSel, Int_t imatch, Int_t imethod)
void CompareMergedEfficiencies(const char *opt) const
double Double_t
Definition: External.C:58
void CopyDir(TDirectory *source) const
Double_t GetError(Double_t errLow, Double_t errHigh) const
const char * title
Definition: MakeQAPdf.C:26
tracks used for calculation
const char * cdbPath
Definition: AOD.C:26
Bool_t CopyLocally(const char *runList, const char *path, const char *pattern, const char *localFileList, const char *outDir, const char *directory) const
Hit pattern from tracker track extrapolation.
Double_t GetThreeOfFour(TArrayD eff, TArrayD effErr, Double_t &probErr) const
TSystem * gSystem
TGraphAsymmErrors * GetTrendEff(Int_t itype, Int_t icount, Int_t ichamber, Int_t idetelem) const
centrality
Bool_t RemoveEffHistoList(const char *condition)
AliMTRChEffInnerObj(const char *filename, const char *outputname, Int_t minRun, Int_t maxRun=-1)
TArrayI MergeRangesForStat(TArrayI runRanges, Double_t averageStatError, Bool_t excludePeriphericBoards=kTRUE) const
Int_t ComputeAndCompareEfficiencies(const char *sources, const char *titles, const char *opt, const char *canvasNameSuffix="") const
Counts per slat histogram index.
Int_t CompareEfficiencies(const char *sources, const char *titles, const char *opt, const char *canvasNameSuffix="") const
TList * GetEffHistoList(const char *condition) const
Bool_t SetResultsFromGrid(const char *runList, const char *path, const char *pattern, const char *localFileList="localFileList.txt", const char *outDir="", const char *directory="MTR_ChamberEffMap", const char *outputName="testMTRChamberEff")
Int_t nDE
UShort_t T(UShort_t m, UShort_t t)
Definition: RingBits.C:60
TList * GetEffHistoList(AliTrigChEffOutput *trigOut, TObjArray *condition) const
Number of count type.
int Int_t
Definition: External.C:63
Bool_t WriteMergedToOCDB(const char *outputCDB="CDB", Bool_t writeSystematics=kFALSE) const
Bool_t AddToList(const char *filename, const char *outputName)
Int_t CompareEfficiencyMethods(const char *source, const char *opt, const char *canvasNameSuffix="") const
Output for Trig chamber effieincy.
Definition: External.C:212
Bool_t AddEffHistoList(const char *condition, TList *effHistoList)
TArrayI GetHomogeneousRanges(Double_t chi2Cut=3, Int_t maxNRanges=4, Double_t minEffVariation=0.005, Bool_t perRPC=kTRUE, TArrayI *forcedChanges=0x0, Double_t minEff=0.85, Double_t maxEff=1.01)
Bool_t SetEffConditions(const char *physSel, const char *trigClassName, const char *centrality, Int_t itrackSel, Int_t imatch, Int_t imethod)
Output for Trig chamber effieincy.
AliTrigChEffOutput * fNamer
! Namer for histograms
void DrawStatContribution(Int_t itype, Int_t irpc, Double_t maxNsigmaOutliers=-1., Double_t minY=0., Double_t maxY=0.15) const
Double_t GetAverageStat(Int_t firstRun, Int_t lastRun, Int_t itype=AliTrigChEffOutput::kHboardEff, Bool_t excludePeriphericBoards=kTRUE) const
Bool_t SetOutList(const char *localFileList, const char *outputName)
Bool_t Data(TH1F *h, Double_t *rangefit, Bool_t writefit, Double_t &sgn, Double_t &errsgn, Double_t &bkg, Double_t &errbkg, Double_t &sgnf, Double_t &errsgnf, Double_t &sigmafit, Int_t &status)
TString GetId(const char *condition, Int_t minRun, Int_t maxRun=-1) const
TObject * FindObject(int bin, const char *nameH, const TList *lst, Bool_t normPerEvent=kTRUE)
AliTrigChEffOutput * Namer() const
std::vector< AliMTRChEffAnalysis::AliMTRChEffInnerObj * > fRunMap
! Map of internal objects per run
Int_t colors[nPtBins]
std::vector< AliMTRChEffAnalysis::AliMTRChEffInnerObj * > fMergedMap
! Map of merged internal objects
TH1 * GetHisto(TList *effHistoList, Int_t itype, Int_t icount, Int_t ichamber) const
Bool_t SetCondition(const char *physSel, const char *trigClassName, const char *centrality, Int_t itrackSel, Int_t imatch, Int_t imethod, Bool_t isBasic)
TList * GetRunList(const char *runList) const
ClassImp(AliAnalysisTaskCRC) AliAnalysisTaskCRC
Int_t GetRunNumber(Int_t ipt) const
Bool_t HasMergedResults() const
Bool_t ExecCommand(TString command, Bool_t prompt) const
TArrayI BoardsInRPC(Int_t irpc) const
Bool_t RecoverEfficiency(const char *runList, const char *ocdb, const char *systOcdb, Int_t referenceRun=-1)
Int_t GetIndexFromRun(Int_t runNumber) const
Double_t FitRangesFunc(Double_t *x, Double_t *par)
Counts per board histogram index.
Int_t GetRunNumber(TString)
Definition: PlotMuonQA.C:2235
void DrawEffTrend(Int_t itype, Int_t irpc, Double_t maxNsigmasOutliers=-1., Double_t minEff=0.8, Double_t maxEff=1.01) const
TObjArray * fConditions
! List of conditions for trigger efficiency
TList * CloneEffHistoList(TList *effHistos) const
TGraphAsymmErrors * GetOutliers(TGraphAsymmErrors *graph, Double_t maxNsigmas=3.) const
Bool_t AddSystematicCondition(const char *physSel, const char *trigClassName, const char *centrality, Int_t itrackSel, Int_t imatch, Int_t imethod)
bool Bool_t
Definition: External.C:53
TString GetShortConditionTitle(const char *conditionName) const
Bool_t SetResultsFromWeb(const char *runList, const char *path, const char *localFileList="localFileList.txt", const char *outDir="", const char *directory="MTR_ChamberEffMap", const char *outputName="testMTRChamberEff")
Bool_t DrawSystematicEnvelope(Bool_t perRPC=kFALSE) const
Bool_t MergeOutput(TArrayI runRanges, Double_t averageStatError=0.01, Bool_t isIndex=kFALSE)
TString GetHistoName(Int_t itype, Int_t icount, Int_t ichamber, Int_t itrackSel, Int_t imatch, Int_t imethod)
Definition: External.C:196
TH1 * GetSum(AliTrigChEffOutput *trigOut, TObjArray *condition, Int_t itype, Int_t icount, Int_t ichamber) const
TList * ReadEffHistoList(const char *src) const
TH1 * GetTrend(Int_t itype, Int_t icount, Int_t ichamber, Int_t idetelem) const