18 |
|
self.cuts = [] |
19 |
|
for options in optionsList: |
20 |
|
self.cuts.append(options['cut']) |
21 |
< |
print self.cuts |
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 |
114 |
|
gDict[group] = self.mybinning.rebin(hTree) |
115 |
|
del hTree |
116 |
|
else: |
117 |
< |
print 'not rebinning %s'%job.name |
117 |
> |
#print 'not rebinning %s'%job.name |
118 |
|
gDict[group] = hTree |
119 |
|
hTreeList.append(gDict) |
120 |
|
CuttedTree.IsA().Destructor(CuttedTree) |
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 |
< |
print 'binning set to %s'%binlist |
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' |