| 9 |
|
|
| 10 |
#include "EffRigCollection.h" |
#include "EffRigCollection.h" |
| 11 |
|
|
| 12 |
|
#include "TGraphAsymmErrors.h" |
| 13 |
|
|
| 14 |
extern "C" { |
extern "C" { |
| 15 |
bool efficiency_(Int_t*, Int_t*, Double_t*, Double_t*, Double_t*); |
bool efficiency_(Int_t*, Int_t*, Double_t*, Double_t*, Double_t*); |
| 16 |
} |
} |
| 17 |
|
|
| 18 |
EffRigCollection::EffRigCollection(const char *collectionName, TString outFileBase, TString rigBinsFile, bool absRig) : |
EffRigCollection::EffRigCollection(const char *collectionName, TString outFileBase, TString rigBinsFile, int errMethod) : |
| 19 |
EffCollection(collectionName, outFileBase), _bins(0), _selVector(0), _detVector(0), _outUp(0), _outDown(0) { |
EffCollection(collectionName, outFileBase, errMethod), _bins(0), _selVector(0), _detVector(0), _outUp(0), _outDown(0) { |
| 20 |
|
|
| 21 |
ifstream rigBinListFile; |
ifstream rigBinListFile; |
| 22 |
rigBinListFile.open(rigBinsFile); |
rigBinListFile.open(rigBinsFile); |
| 41 |
// Check if the event is inside the rigidity range |
// Check if the event is inside the rigidity range |
| 42 |
// NOTE: at this point a TrkPhSinCut should be already performed, |
// NOTE: at this point a TrkPhSinCut should be already performed, |
| 43 |
// since we are going to retrieve rigidity. |
// since we are going to retrieve rigidity. |
| 44 |
float rig; |
|
| 45 |
if (_absRig) { |
float rig = event->GetTrack(0)->GetTrkTrack()->GetRigidity(); |
| 46 |
rig = event->GetTrack(0)->GetTrkTrack()->GetRigidity(); |
|
|
} |
|
|
else |
|
|
rig = 1. / event->GetTrack(0)->GetTrkTrack()->GetDeflection(); |
|
| 47 |
if (rig >= _bins[0]) { |
if (rig >= _bins[0]) { |
| 48 |
int i = 1; |
int i = 1; |
| 49 |
while (rig >= _bins[i] && i < (int) _bins.size()) { |
while (rig >= _bins[i] && i < (int) _bins.size()) { |
| 90 |
for (unsigned int i = 0; i < _selVector.size(); i++) { |
for (unsigned int i = 0; i < _selVector.size(); i++) { |
| 91 |
sel[i] = (Int_t) _selVector[i]; |
sel[i] = (Int_t) _selVector[i]; |
| 92 |
det[i] = (Int_t) _detVector[i]; |
det[i] = (Int_t) _detVector[i]; |
|
efficiency_(&(sel[i]), &(det[i]), &(eff[i]), &(errLow[i]), &(errHigh[i])); |
|
| 93 |
} |
} |
| 94 |
|
|
| 95 |
|
TGraphAsymmErrors errGraph; |
| 96 |
|
errGraph.SetName(GetName()); |
| 97 |
|
errGraph.SetMarkerColor(kRed); |
| 98 |
|
errGraph.SetMarkerStyle(7); |
| 99 |
|
errGraph.GetYaxis()->SetRangeUser(0, 1.2); |
| 100 |
|
|
| 101 |
|
if (_errMethod == EFFRIG_ROOT) { |
| 102 |
|
double binning[_bins.size()]; |
| 103 |
|
for (unsigned int i = 0; i < _bins.size(); i++) |
| 104 |
|
binning[i] = _bins[i]; |
| 105 |
|
|
| 106 |
|
TH1I pass("pass", "pass", _bins.size() - 1, binning); |
| 107 |
|
TH1I total("total", "total", _bins.size() - 1, binning); |
| 108 |
|
for (unsigned int i = 0; i < _selVector.size(); i++) { |
| 109 |
|
cout << (binning[i + 1] + binning[i]) / 2. << " " << det[i] << " " << sel[i] << endl; |
| 110 |
|
for (int j = 0; j < det[i]; j++) |
| 111 |
|
pass.Fill((binning[i + 1] + binning[i]) / 2.); |
| 112 |
|
for (int j = 0; j < sel[i]; j++) |
| 113 |
|
total.Fill((binning[i + 1] + binning[i]) / 2.); |
| 114 |
|
} |
| 115 |
|
|
| 116 |
|
errGraph.BayesDivide(&pass, &total); |
| 117 |
|
Double_t graphX; |
| 118 |
|
double currBin; |
| 119 |
|
int currPoint = 0; |
| 120 |
|
//cout << errGraph.GetN() << " " << pass.GetNbinsX() << " " << total.GetNbinsX() << endl; |
| 121 |
|
for (unsigned int i = 0; i < _selVector.size(); i++) { |
| 122 |
|
errGraph.GetPoint(currPoint, graphX, eff[i]); |
| 123 |
|
currBin = (binning[i + 1] + binning[i]) / 2.; |
| 124 |
|
if (currBin == graphX) { |
| 125 |
|
if (_selVector[i] < 8) { |
| 126 |
|
eff[i] = 1.1; |
| 127 |
|
errLow[i] = errHigh[i] = 0.; |
| 128 |
|
errGraph.SetPoint(currPoint, graphX, 1.1); |
| 129 |
|
float halfBin = (binning[i + 1] - binning[i]) / 2.; |
| 130 |
|
errGraph.SetPointError(currPoint, halfBin, halfBin, 0., 0.); |
| 131 |
|
} |
| 132 |
|
currPoint++; |
| 133 |
|
} |
| 134 |
|
} |
| 135 |
|
|
| 136 |
|
} |
| 137 |
|
if (_errMethod == EFFRIG_SERGIO) { |
| 138 |
|
for (unsigned int i = 0; i < _selVector.size(); i++) { |
| 139 |
|
efficiency_(&(sel[i]), &(det[i]), &(eff[i]), &(errLow[i]), &(errHigh[i])); |
| 140 |
|
} |
| 141 |
|
|
| 142 |
|
} |
| 143 |
|
|
| 144 |
// Write the output files |
// Write the output files |
| 145 |
if (_outFileBase != "") { |
if (_outFileBase != "") { |
| 146 |
ofstream outTextFile((_outFileBase + "-eff-rig.txt").Data(), ios_base::out); |
ofstream outTextFile((_outFileBase + "-eff-rig.txt").Data(), ios_base::out); |
| 155 |
outTextFile << setw(10) << 0. << setw(10) << 0. << setw(10) << 0. << endl; |
outTextFile << setw(10) << 0. << setw(10) << 0. << setw(10) << 0. << endl; |
| 156 |
|
|
| 157 |
} |
} |
| 158 |
|
|
| 159 |
outTextFile.close(); |
outTextFile.close(); |
| 160 |
|
if (_errMethod == EFFRIG_ROOT) { |
| 161 |
|
TFile outRootFile((_outFileBase + "-eff-rig.root"), "RECREATE"); |
| 162 |
|
outRootFile.cd(); |
| 163 |
|
errGraph.Write(); |
| 164 |
|
outRootFile.Close(); |
| 165 |
|
} |
| 166 |
} |
} |
| 167 |
|
|
| 168 |
} |
} |