| 5 |
|
from printcolor import printc |
| 6 |
|
from BetterConfigParser import BetterConfigParser |
| 7 |
|
from TreeCache import TreeCache |
| 8 |
+ |
from math import sqrt |
| 9 |
+ |
from copy import copy |
| 10 |
|
|
| 11 |
|
class HistoMaker: |
| 12 |
< |
def __init__(self, samples, path, config, optionsList): |
| 12 |
> |
def __init__(self, samples, path, config, optionsList,GroupDict=None): |
| 13 |
|
self.path = path |
| 14 |
|
self.config = config |
| 15 |
|
self.optionsList = optionsList |
| 16 |
+ |
self.nBins = optionsList[0]['nBins'] |
| 17 |
|
self.lumi=0. |
| 18 |
|
self.cuts = [] |
| 19 |
|
for options in optionsList: |
| 20 |
|
self.cuts.append(options['cut']) |
| 21 |
+ |
#print self.cuts |
| 22 |
|
#self.tc = TreeCache(self.cuts,samples,path) |
| 23 |
|
self.tc = TreeCache(self.cuts,samples,path,config) |
| 24 |
+ |
self._rebin = False |
| 25 |
+ |
self.mybinning = None |
| 26 |
+ |
self.GroupDict=GroupDict |
| 27 |
+ |
self.calc_rebin_flag = False |
| 28 |
|
|
| 29 |
|
def get_histos_from_tree(self,job): |
| 30 |
|
if self.lumi == 0: |
| 43 |
|
# get all Histos at once |
| 44 |
|
for options in self.optionsList: |
| 45 |
|
name=job.name |
| 46 |
< |
group=job.group |
| 46 |
> |
if self.GroupDict is None: |
| 47 |
> |
group=job.group |
| 48 |
> |
else: |
| 49 |
> |
group=self.GroupDict[job.name] |
| 50 |
|
treeVar=options['var'] |
| 51 |
|
name=options['name'] |
| 52 |
< |
nBins=int(options['nBins']) |
| 52 |
> |
if self._rebin or self.calc_rebin_flag: |
| 53 |
> |
nBins = self.nBins |
| 54 |
> |
else: |
| 55 |
> |
nBins = int(options['nBins']) |
| 56 |
|
xMin=float(options['xMin']) |
| 57 |
|
xMax=float(options['xMax']) |
| 58 |
|
weightF=options['weight'] |
| 63 |
|
|
| 64 |
|
if job.type != 'DATA': |
| 65 |
|
if CuttedTree.GetEntries(): |
| 52 |
– |
|
| 66 |
|
if 'RTight' in treeVar or 'RMed' in treeVar: |
| 67 |
|
drawoption = '(%s)*(%s)'%(weightF,BDT_add_cut) |
| 68 |
|
else: |
| 72 |
|
else: |
| 73 |
|
full=False |
| 74 |
|
elif job.type == 'DATA': |
| 75 |
< |
if options['blind']: |
| 75 |
> |
if eval(options['blind']): |
| 76 |
|
if treeVar == 'H.mass': |
| 77 |
|
CuttedTree.Draw('%s>>%s(%s,%s,%s)' %(treeVar,name,nBins,xMin,xMax),treeVar+'<90. || '+treeVar + '>150.' , "goff,e") |
| 78 |
|
else: |
| 90 |
|
if 'RTight' in treeVar or 'RMed' in treeVar: |
| 91 |
|
if TrainFlag: |
| 92 |
|
MC_rescale_factor=2. |
| 93 |
< |
print 'I RESCALE BY 2.0' |
| 93 |
> |
#print 'I RESCALE BY 2.0' |
| 94 |
|
else: |
| 95 |
|
MC_rescale_factor = 1. |
| 96 |
|
ScaleFactor = self.tc.get_scale(job,self.config,self.lumi)*MC_rescale_factor |
| 110 |
|
hTree.SetBinError(hTree.GetNbinsX(),oFlowErr) |
| 111 |
|
hTree.SetDirectory(0) |
| 112 |
|
gDict = {} |
| 113 |
< |
gDict[group] = hTree |
| 113 |
> |
if self._rebin: |
| 114 |
> |
gDict[group] = self.mybinning.rebin(hTree) |
| 115 |
> |
del hTree |
| 116 |
> |
else: |
| 117 |
> |
#print 'not rebinning %s'%job.name |
| 118 |
> |
gDict[group] = hTree |
| 119 |
|
hTreeList.append(gDict) |
| 120 |
< |
|
| 120 |
> |
CuttedTree.IsA().Destructor(CuttedTree) |
| 121 |
> |
del CuttedTree |
| 122 |
|
return hTreeList |
| 123 |
< |
|
| 123 |
> |
|
| 124 |
> |
@property |
| 125 |
> |
def rebin(self): |
| 126 |
> |
return self._rebin |
| 127 |
> |
|
| 128 |
> |
@property |
| 129 |
> |
def rebin(self, value): |
| 130 |
> |
if self._rebin and value: |
| 131 |
> |
return True |
| 132 |
> |
elif self._rebin and not value: |
| 133 |
> |
self.nBins = self.norebin_nBins |
| 134 |
> |
self._rebin = False |
| 135 |
> |
elif not self._rebin and value: |
| 136 |
> |
if self.mybinning is None: |
| 137 |
> |
raise Exception('define rebinning first') |
| 138 |
> |
else: |
| 139 |
> |
self.nBins = self.rebin_nBins |
| 140 |
> |
self._rebin = True |
| 141 |
> |
return True |
| 142 |
> |
elif not self._rebin and not self.value: |
| 143 |
> |
return False |
| 144 |
> |
|
| 145 |
> |
def calc_rebin(self, bg_list, nBins_start=1000, tolerance=0.35): |
| 146 |
> |
self.calc_rebin_flag = True |
| 147 |
> |
self.norebin_nBins = copy(self.nBins) |
| 148 |
> |
self.rebin_nBins = nBins_start |
| 149 |
> |
self.nBins = nBins_start |
| 150 |
> |
i=0 |
| 151 |
> |
#add all together: |
| 152 |
> |
print '\n\t...calculating rebinning...' |
| 153 |
> |
for job in bg_list: |
| 154 |
> |
htree = self.get_histos_from_tree(job)[0].values()[0] |
| 155 |
> |
if not i: |
| 156 |
> |
totalBG = copy(htree) |
| 157 |
> |
else: |
| 158 |
> |
totalBG.Add(htree,1) |
| 159 |
> |
del htree |
| 160 |
> |
i+=1 |
| 161 |
> |
ErrorR=0 |
| 162 |
> |
ErrorL=0 |
| 163 |
> |
TotR=0 |
| 164 |
> |
TotL=0 |
| 165 |
> |
binR=self.rebin_nBins |
| 166 |
> |
binL=1 |
| 167 |
> |
rel=1.0 |
| 168 |
> |
#---- from right |
| 169 |
> |
while rel > tolerance: |
| 170 |
> |
TotR+=totalBG.GetBinContent(binR) |
| 171 |
> |
ErrorR=sqrt(ErrorR**2+totalBG.GetBinError(binR)**2) |
| 172 |
> |
binR-=1 |
| 173 |
> |
if not TotR == 0 and not ErrorR == 0: |
| 174 |
> |
rel=ErrorR/TotR |
| 175 |
> |
#print rel |
| 176 |
> |
#print 'upper bin is %s'%binR |
| 177 |
> |
|
| 178 |
> |
#---- from left |
| 179 |
> |
rel=1.0 |
| 180 |
> |
while rel > tolerance: |
| 181 |
> |
TotL+=totalBG.GetBinContent(binL) |
| 182 |
> |
ErrorL=sqrt(ErrorL**2+totalBG.GetBinError(binL)**2) |
| 183 |
> |
binL+=1 |
| 184 |
> |
if not TotL == 0 and not ErrorL == 0: |
| 185 |
> |
rel=ErrorL/TotL |
| 186 |
> |
#print rel |
| 187 |
> |
#it's the lower edge |
| 188 |
> |
binL+=1 |
| 189 |
> |
#print 'lower bin is %s'%binL |
| 190 |
> |
|
| 191 |
> |
inbetween=binR-binL |
| 192 |
> |
stepsize=int(inbetween)/(int(self.norebin_nBins)-2) |
| 193 |
> |
modulo = int(inbetween)%(int(self.norebin_nBins)-2) |
| 194 |
> |
|
| 195 |
> |
#print 'stepsize %s'% stepsize |
| 196 |
> |
#print 'modulo %s'%modulo |
| 197 |
> |
binlist=[binL] |
| 198 |
> |
for i in range(0,int(self.norebin_nBins)-3): |
| 199 |
> |
binlist.append(binlist[-1]+stepsize) |
| 200 |
> |
binlist[-1]+=modulo |
| 201 |
> |
binlist.append(binR) |
| 202 |
> |
binlist.append(self.rebin_nBins+1) |
| 203 |
> |
#print 'binning set to %s'%binlist |
| 204 |
> |
self.mybinning = Rebinner(int(self.norebin_nBins),array('d',[-1.0]+[totalBG.GetBinLowEdge(i) for i in binlist]),True) |
| 205 |
> |
self._rebin = True |
| 206 |
> |
print '\t > rebinning is set <\n' |
| 207 |
|
|
| 208 |
|
@staticmethod |
| 209 |
|
def orderandadd(histo_dicts,setup): |
| 108 |
– |
print histo_dicts |
| 210 |
|
ordered_histo_dict = {} |
| 211 |
|
for sample in setup: |
| 212 |
|
nSample = 0 |
| 213 |
|
for histo_dict in histo_dicts: |
| 214 |
|
if histo_dict.has_key(sample): |
| 215 |
|
if nSample == 0: |
| 216 |
< |
ordered_histo_dict[sample] = histo_dict[sample] |
| 216 |
> |
ordered_histo_dict[sample] = histo_dict[sample].Clone() |
| 217 |
|
else: |
| 218 |
|
printc('magenta','','\t--> added %s to %s'%(sample,sample)) |
| 219 |
|
ordered_histo_dict[sample].Add(histo_dict[sample]) |
| 220 |
|
nSample += 1 |
| 221 |
+ |
del histo_dicts |
| 222 |
|
return ordered_histo_dict |
| 223 |
+ |
|
| 224 |
+ |
class Rebinner: |
| 225 |
+ |
def __init__(self,nBins,lowedgearray,active=True): |
| 226 |
+ |
self.lowedgearray=lowedgearray |
| 227 |
+ |
self.nBins=nBins |
| 228 |
+ |
self.active=active |
| 229 |
+ |
def rebin(self, histo): |
| 230 |
+ |
if not self.active: return histo |
| 231 |
+ |
#print histo.Integral() |
| 232 |
+ |
ROOT.gDirectory.Delete('hnew') |
| 233 |
+ |
histo.Rebin(self.nBins,'hnew',self.lowedgearray) |
| 234 |
+ |
binhisto=ROOT.gDirectory.Get('hnew') |
| 235 |
+ |
#print binhisto.Integral() |
| 236 |
+ |
newhisto=ROOT.TH1F('new','new',self.nBins,self.lowedgearray[0],self.lowedgearray[-1]) |
| 237 |
+ |
newhisto.Sumw2() |
| 238 |
+ |
for bin in range(1,self.nBins+1): |
| 239 |
+ |
newhisto.SetBinContent(bin,binhisto.GetBinContent(bin)) |
| 240 |
+ |
newhisto.SetBinError(bin,binhisto.GetBinError(bin)) |
| 241 |
+ |
newhisto.SetName(binhisto.GetName()) |
| 242 |
+ |
newhisto.SetTitle(binhisto.GetTitle()) |
| 243 |
+ |
#print newhisto.Integral() |
| 244 |
+ |
del histo |
| 245 |
+ |
del binhisto |
| 246 |
+ |
return copy(newhisto) |
