62 |
|
del tree |
63 |
|
|
64 |
|
CountIncl = fileList[0][3] |
65 |
+ |
xSecIncl = fileList[0][1] |
66 |
|
print fileList |
67 |
+ |
print 'Inclusive cross-section %.2f pb' %xSecIncl |
68 |
|
|
69 |
|
#total -> total numer of events in each lheBin |
70 |
|
print 'Calculating total' |
81 |
|
#print fileList |
82 |
|
if total[bin] > 0.: |
83 |
|
#the first is always the one with the highest N in the bin: |
84 |
< |
weight.append( (fileList[0][1]/fileList[0][3]) * (CountIncl/2950.0) * fileList[0][2][bin]/total[bin] ) |
84 |
> |
weight.append( (fileList[0][1]/fileList[0][3]) * (CountIncl/xSecIncl) * fileList[0][2][bin]/total[bin] ) |
85 |
|
else: |
86 |
|
weight.append(1.) |
87 |
|
|