| 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: |
| 49 |
|
group=self.GroupDict[job.name] |
| 50 |
|
treeVar=options['var'] |
| 51 |
|
name=options['name'] |
| 52 |
< |
if self._rebin: |
| 52 |
> |
if self._rebin or self.calc_rebin_flag: |
| 53 |
|
nBins = self.nBins |
| 54 |
|
else: |
| 55 |
|
nBins = int(options['nBins']) |
| 63 |
|
|
| 64 |
|
if job.type != 'DATA': |
| 65 |
|
if CuttedTree.GetEntries(): |
| 64 |
– |
|
| 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 |
| 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 |
|
CuttedTree.IsA().Destructor(CuttedTree) |
| 143 |
|
return False |
| 144 |
|
|
| 145 |
|
def calc_rebin(self, bg_list, nBins_start=1000, tolerance=0.35): |
| 146 |
< |
self.norebin_nBins = self.nBins |
| 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 |
| 173 |
|
if not TotR == 0 and not ErrorR == 0: |
| 174 |
|
rel=ErrorR/TotR |
| 175 |
|
#print rel |
| 176 |
< |
#print 'upper bin is %s'%binR |
| 176 |
> |
print 'upper bin is %s'%binR |
| 177 |
|
|
| 178 |
|
#---- from left |
| 179 |
|
rel=1.0 |
| 186 |
|
#print rel |
| 187 |
|
#it's the lower edge |
| 188 |
|
binL+=1 |
| 189 |
< |
#print 'lower bin is %s'%binL |
| 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 |
| 195 |
> |
print 'stepsize %s'% stepsize |
| 196 |
|
#print 'modulo %s'%modulo |
| 197 |
|
binlist=[binL] |
| 198 |
|
for i in range(0,int(self.norebin_nBins)-3): |
| 200 |
|
binlist[-1]+=modulo |
| 201 |
|
binlist.append(binR) |
| 202 |
|
binlist.append(self.rebin_nBins+1) |
| 203 |
< |
|
| 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' |
