-
Notifications
You must be signed in to change notification settings - Fork 184
/
Copy path_auto_rebin_8cc_source.html
476 lines (474 loc) · 68 KB
/
_auto_rebin_8cc_source.html
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
318
319
320
321
322
323
324
325
326
327
328
329
330
331
332
333
334
335
336
337
338
339
340
341
342
343
344
345
346
347
348
349
350
351
352
353
354
355
356
357
358
359
360
361
362
363
364
365
366
367
368
369
370
371
372
373
374
375
376
377
378
379
380
381
382
383
384
385
386
387
388
389
390
391
392
393
394
395
396
397
398
399
400
401
402
403
404
405
406
407
408
409
410
411
412
413
414
415
416
417
418
419
420
421
422
423
424
425
426
427
428
429
430
431
432
433
434
435
436
437
438
439
440
441
442
443
444
445
446
447
448
449
450
451
452
453
454
455
456
457
458
459
460
461
462
463
464
465
466
467
468
469
470
471
472
473
474
475
476
<!-- HTML header for doxygen 1.8.6-->
<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "http://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd">
<html xmlns="http://www.w3.org/1999/xhtml">
<head>
<meta http-equiv="Content-Type" content="text/xhtml;charset=UTF-8"/>
<meta http-equiv="X-UA-Compatible" content="IE=9"/>
<meta name="generator" content="Doxygen 1.9.1"/>
<title>CombineHarvester: CombineTools/src/AutoRebin.cc Source File</title>
<link href="tabs.css" rel="stylesheet" type="text/css"/>
<script type="text/javascript" src="jquery.js"></script>
<script type="text/javascript" src="dynsections.js"></script>
<link href="navtree.css" rel="stylesheet" type="text/css"/>
<script type="text/javascript" src="resize.js"></script>
<script type="text/javascript" src="navtreedata.js"></script>
<script type="text/javascript" src="navtree.js"></script>
<link href="search/search.css" rel="stylesheet" type="text/css"/>
<script type="text/javascript" src="search/searchdata.js"></script>
<script type="text/javascript" src="search/search.js"></script>
<script type="text/javascript">
/* @license magnet:?xt=urn:btih:cf05388f2679ee054f2beb29a391d25f4e673ac3&dn=gpl-2.0.txt GPL-v2 */
$(document).ready(function() { init_search(); });
/* @license-end */
</script>
<script type="text/x-mathjax-config">
MathJax.Hub.Config({
extensions: ["tex2jax.js"],
jax: ["input/TeX","output/HTML-CSS"],
});
</script>
<script type="text/javascript" async="async" src="http://cdn.mathjax.org/mathjax/latest/MathJax.js"></script>
<link href="doxygen.css" rel="stylesheet" type="text/css" />
<link href="customdoxygen.css" rel="stylesheet" type="text/css"/>
</head>
<body>
<div id="top"><!-- do not remove this div, it is closed by doxygen! -->
<div id="titlearea">
<table cellspacing="0" cellpadding="0">
<tbody>
<tr style="height: 70px;">
<td style="padding-left: 0.5em;">
<div id="projectname">CombineHarvester
</div>
</td>
<td> <div id="MSearchBox" class="MSearchBoxInactive">
<span class="left">
<img id="MSearchSelect" src="search/mag_sel.svg"
onmouseover="return searchBox.OnSearchSelectShow()"
onmouseout="return searchBox.OnSearchSelectHide()"
alt=""/>
<input type="text" id="MSearchField" value="Search" accesskey="S"
onfocus="searchBox.OnSearchFieldFocus(true)"
onblur="searchBox.OnSearchFieldFocus(false)"
onkeyup="searchBox.OnSearchFieldChange(event)"/>
</span><span class="right">
<a id="MSearchClose" href="javascript:searchBox.CloseResultsWindow()"><img id="MSearchCloseImg" border="0" src="search/close.svg" alt=""/></a>
</span>
</div>
</td>
</tr>
</tbody>
</table>
</div>
<!-- end header part -->
<!-- Generated by Doxygen 1.9.1 -->
<script type="text/javascript">
/* @license magnet:?xt=urn:btih:cf05388f2679ee054f2beb29a391d25f4e673ac3&dn=gpl-2.0.txt GPL-v2 */
var searchBox = new SearchBox("searchBox", "search",false,'Search','.html');
/* @license-end */
</script>
</div><!-- top -->
<div id="side-nav" class="ui-resizable side-nav-resizable">
<div id="nav-tree">
<div id="nav-tree-contents">
<div id="nav-sync" class="sync"></div>
</div>
</div>
<div id="splitbar" style="-moz-user-select:none;"
class="ui-resizable-handle">
</div>
</div>
<script type="text/javascript">
/* @license magnet:?xt=urn:btih:cf05388f2679ee054f2beb29a391d25f4e673ac3&dn=gpl-2.0.txt GPL-v2 */
$(document).ready(function(){initNavTree('_auto_rebin_8cc_source.html',''); initResizable(); });
/* @license-end */
</script>
<div id="doc-content">
<!-- window showing the filter options -->
<div id="MSearchSelectWindow"
onmouseover="return searchBox.OnSearchSelectShow()"
onmouseout="return searchBox.OnSearchSelectHide()"
onkeydown="return searchBox.OnSearchSelectKey(event)">
</div>
<!-- iframe showing the search results (closed by default) -->
<div id="MSearchResultsWindow">
<iframe src="javascript:void(0)" frameborder="0"
name="MSearchResults" id="MSearchResults">
</iframe>
</div>
<div class="header">
<div class="headertitle">
<div class="title">AutoRebin.cc</div> </div>
</div><!--header-->
<div class="contents">
<a href="_auto_rebin_8cc.html">Go to the documentation of this file.</a><div class="fragment"><div class="line"><a name="l00001"></a><span class="lineno"> 1</span> <span class="preprocessor">#include "<a class="code" href="_auto_rebin_8h.html">CombineHarvester/CombineTools/interface/AutoRebin.h</a>"</span> </div>
<div class="line"><a name="l00002"></a><span class="lineno"> 2</span> <span class="preprocessor">#include <iostream></span> </div>
<div class="line"><a name="l00003"></a><span class="lineno"> 3</span> <span class="preprocessor">#include <string></span> </div>
<div class="line"><a name="l00004"></a><span class="lineno"> 4</span> <span class="preprocessor">#include <vector></span> </div>
<div class="line"><a name="l00005"></a><span class="lineno"> 5</span> <span class="preprocessor">#include "boost/format.hpp"</span></div>
<div class="line"><a name="l00006"></a><span class="lineno"> 6</span> <span class="preprocessor">#include "boost/lexical_cast.hpp"</span></div>
<div class="line"><a name="l00007"></a><span class="lineno"> 7</span>  </div>
<div class="line"><a name="l00008"></a><span class="lineno"> 8</span> <span class="keyword">namespace </span><a class="code" href="namespacech.html">ch</a> {</div>
<div class="line"><a name="l00009"></a><span class="lineno"> 9</span>  </div>
<div class="line"><a name="l00010"></a><span class="lineno"><a class="line" href="classch_1_1_auto_rebin.html#a9305a4b7d600e31a17ccc6606d488825"> 10</a></span> <a class="code" href="classch_1_1_auto_rebin.html#a9305a4b7d600e31a17ccc6606d488825">AutoRebin::AutoRebin</a>()</div>
<div class="line"><a name="l00011"></a><span class="lineno"> 11</span>  : v_(0),</div>
<div class="line"><a name="l00012"></a><span class="lineno"> 12</span>  rebin_mode_(0), </div>
<div class="line"><a name="l00013"></a><span class="lineno"> 13</span>  perform_rebin_(true),</div>
<div class="line"><a name="l00014"></a><span class="lineno"> 14</span>  bin_threshold_(0.), </div>
<div class="line"><a name="l00015"></a><span class="lineno"> 15</span>  bin_uncert_fraction_(100.) {}</div>
<div class="line"><a name="l00016"></a><span class="lineno"> 16</span>  </div>
<div class="line"><a name="l00017"></a><span class="lineno"> 17</span>  </div>
<div class="line"><a name="l00018"></a><span class="lineno"><a class="line" href="classch_1_1_auto_rebin.html#af9525ed197d8b5742695c729645ea4a2"> 18</a></span> <span class="keywordtype">void</span> <a class="code" href="classch_1_1_auto_rebin.html#af9525ed197d8b5742695c729645ea4a2">AutoRebin::Rebin</a>(<a class="code" href="classch_1_1_combine_harvester.html">CombineHarvester</a> &src, <a class="code" href="classch_1_1_combine_harvester.html">CombineHarvester</a> &dest) {</div>
<div class="line"><a name="l00019"></a><span class="lineno"> 19</span>  </div>
<div class="line"><a name="l00020"></a><span class="lineno"> 20</span>  <span class="keyword">auto</span> bins = src.<a class="code" href="classch_1_1_combine_harvester.html#a869c951c635b86fba33b2c550c9c39c9">bin_set</a>();</div>
<div class="line"><a name="l00021"></a><span class="lineno"> 21</span>  <span class="comment">//Perform rebinning separately for each channel-category of the CH instance</span></div>
<div class="line"><a name="l00022"></a><span class="lineno"> 22</span>  </div>
<div class="line"><a name="l00023"></a><span class="lineno"> 23</span>  <span class="keywordflow">for</span> (<span class="keyword">auto</span> bin : bins) {</div>
<div class="line"><a name="l00024"></a><span class="lineno"> 24</span>  <span class="comment">//Build histogram containing total of all backgrounds, avoid using</span></div>
<div class="line"><a name="l00025"></a><span class="lineno"> 25</span>  <span class="comment">//GetShapeWithUncertainty so that possible negative bins are retained</span></div>
<div class="line"><a name="l00026"></a><span class="lineno"> 26</span>  TH1F data_obs = src.<a class="code" href="classch_1_1_combine_harvester.html#ade0f7c161d078a189404a274b93336d2">cp</a>().<a class="code" href="classch_1_1_combine_harvester.html#a83dd50569a1f1a4b5a46f2ad2b5c1cdb">bin</a>({bin}).GetObservedShape();</div>
<div class="line"><a name="l00027"></a><span class="lineno"> 27</span>  TH1F total_bkg;</div>
<div class="line"><a name="l00028"></a><span class="lineno"> 28</span>  <span class="keywordflow">if</span> (data_obs.GetXaxis()->GetXbins()->GetArray()){</div>
<div class="line"><a name="l00029"></a><span class="lineno"> 29</span>  total_bkg = TH1F(<span class="stringliteral">""</span>,<span class="stringliteral">""</span>,data_obs.GetNbinsX(), </div>
<div class="line"><a name="l00030"></a><span class="lineno"> 30</span>  data_obs.GetXaxis()->GetXbins()->GetArray()) ;</div>
<div class="line"><a name="l00031"></a><span class="lineno"> 31</span>  } <span class="keywordflow">else</span> {</div>
<div class="line"><a name="l00032"></a><span class="lineno"> 32</span>  total_bkg = TH1F(<span class="stringliteral">""</span>,<span class="stringliteral">""</span>,data_obs.GetNbinsX(),</div>
<div class="line"><a name="l00033"></a><span class="lineno"> 33</span>  data_obs.GetXaxis()->GetBinLowEdge(1),data_obs.GetXaxis()->GetBinLowEdge(data_obs.GetNbinsX()+1));</div>
<div class="line"><a name="l00034"></a><span class="lineno"> 34</span>  }</div>
<div class="line"><a name="l00035"></a><span class="lineno"> 35</span>  src.<a class="code" href="classch_1_1_combine_harvester.html#ade0f7c161d078a189404a274b93336d2">cp</a>().<a class="code" href="classch_1_1_combine_harvester.html#a83dd50569a1f1a4b5a46f2ad2b5c1cdb">bin</a>({bin}).backgrounds().<a class="code" href="classch_1_1_combine_harvester.html#a44064524ffe47ccac63ef8025a6f46dc">ForEachProc</a>([&](<a class="code" href="classch_1_1_process.html">ch::Process</a> *proc) {</div>
<div class="line"><a name="l00036"></a><span class="lineno"> 36</span>  total_bkg.Add((proc-><a class="code" href="classch_1_1_process.html#a3818d45b542fe058e4159fe0a30d2fba">ClonedScaledShape</a>()).get());</div>
<div class="line"><a name="l00037"></a><span class="lineno"> 37</span>  });</div>
<div class="line"><a name="l00038"></a><span class="lineno"> 38</span>  </div>
<div class="line"><a name="l00039"></a><span class="lineno"> 39</span>  <span class="comment">//Create a vector to store the original and new binning</span></div>
<div class="line"><a name="l00040"></a><span class="lineno"> 40</span>  <span class="keywordtype">int</span> nbins = total_bkg.GetNbinsX();</div>
<div class="line"><a name="l00041"></a><span class="lineno"> 41</span>  std::vector<double> init_bins; </div>
<div class="line"><a name="l00042"></a><span class="lineno"> 42</span>  <span class="keywordflow">for</span>(<span class="keywordtype">int</span> i=1; i<=nbins+1; ++i) init_bins.push_back(total_bkg.GetBinLowEdge(i));</div>
<div class="line"><a name="l00043"></a><span class="lineno"> 43</span>  std::cout << <span class="stringliteral">"[AutoRebin] Searching for bins failing conditions "</span></div>
<div class="line"><a name="l00044"></a><span class="lineno"> 44</span>  <span class="stringliteral">"for analysis bin id "</span> << bin << std::endl; </div>
<div class="line"><a name="l00045"></a><span class="lineno"> 45</span>  std::vector<double> new_bins = init_bins;</div>
<div class="line"><a name="l00046"></a><span class="lineno"> 46</span>  </div>
<div class="line"><a name="l00047"></a><span class="lineno"> 47</span>  <span class="comment">//Call to function to fill new_bins vector with the recommended binning</span></div>
<div class="line"><a name="l00048"></a><span class="lineno"> 48</span>  <a class="code" href="classch_1_1_auto_rebin.html#a2dc97baa47e812e6aa1817f604e2541a">AutoRebin::FindNewBinning</a>(total_bkg, new_bins, bin_threshold_, </div>
<div class="line"><a name="l00049"></a><span class="lineno"> 49</span>  bin_uncert_fraction_, rebin_mode_);</div>
<div class="line"><a name="l00050"></a><span class="lineno"> 50</span>  </div>
<div class="line"><a name="l00051"></a><span class="lineno"> 51</span>  <span class="comment">//Inform user if binning has been modified </span></div>
<div class="line"><a name="l00052"></a><span class="lineno"> 52</span>  <span class="keywordflow">if</span>(new_bins.size() != init_bins.size()) { </div>
<div class="line"><a name="l00053"></a><span class="lineno"> 53</span>  std::cout << <span class="stringliteral">"[AutoRebin] Some bins not satisfying requested condition "</span></div>
<div class="line"><a name="l00054"></a><span class="lineno"> 54</span>  <span class="stringliteral">"found for analysis bin "</span> << bin << <span class="stringliteral">", merging with neighbouring bins"</span></div>
<div class="line"><a name="l00055"></a><span class="lineno"> 55</span>  << std::endl; </div>
<div class="line"><a name="l00056"></a><span class="lineno"> 56</span>  <span class="keywordflow">if</span>(v_ > 0) {</div>
<div class="line"><a name="l00057"></a><span class="lineno"> 57</span>  <span class="keywordtype">unsigned</span> i_old = 0;</div>
<div class="line"><a name="l00058"></a><span class="lineno"> 58</span>  <span class="keywordtype">unsigned</span> i_new = 0;</div>
<div class="line"><a name="l00059"></a><span class="lineno"> 59</span>  std::cout << (</div>
<div class="line"><a name="l00060"></a><span class="lineno"> 60</span>  boost::format(<span class="stringliteral">"%-21s %-10s %-21s\n"</span>) % <span class="stringliteral">"Init Edges/Widths"</span> % <span class="stringliteral">"Content"</span> % <span class="stringliteral">"New Edges/Widths"</span>);</div>
<div class="line"><a name="l00061"></a><span class="lineno"> 61</span>  </div>
<div class="line"><a name="l00062"></a><span class="lineno"> 62</span>  <span class="keywordflow">for</span> (; i_old < init_bins.size(); ++i_old) {</div>
<div class="line"><a name="l00063"></a><span class="lineno"> 63</span>  <span class="keywordtype">double</span> i_old_width = (i_old < (init_bins.size() - 1))</div>
<div class="line"><a name="l00064"></a><span class="lineno"> 64</span>  ? (init_bins[i_old + 1] - init_bins[i_old])</div>
<div class="line"><a name="l00065"></a><span class="lineno"> 65</span>  : 0.;</div>
<div class="line"><a name="l00066"></a><span class="lineno"> 66</span>  std::cout << (</div>
<div class="line"><a name="l00067"></a><span class="lineno"> 67</span>  boost::format(<span class="stringliteral">"%-10.0f %-10.0f %-10.2g"</span>) % init_bins[i_old] % i_old_width % total_bkg.GetBinContent(i_old+1));</div>
<div class="line"><a name="l00068"></a><span class="lineno"> 68</span>  <span class="keywordtype">bool</span> new_aligned = (i_new < new_bins.size()) ? std::fabs(init_bins[i_old] - new_bins[i_new]) < 1E-8 : <span class="keyword">false</span>;</div>
<div class="line"><a name="l00069"></a><span class="lineno"> 69</span>  <span class="keywordflow">if</span> (new_aligned) {</div>
<div class="line"><a name="l00070"></a><span class="lineno"> 70</span>  <span class="keywordtype">double</span> i_new_width = (i_new < (new_bins.size() - 1))</div>
<div class="line"><a name="l00071"></a><span class="lineno"> 71</span>  ? (new_bins[i_new + 1] - new_bins[i_new])</div>
<div class="line"><a name="l00072"></a><span class="lineno"> 72</span>  : 0.;</div>
<div class="line"><a name="l00073"></a><span class="lineno"> 73</span>  </div>
<div class="line"><a name="l00074"></a><span class="lineno"> 74</span>  std::cout << (</div>
<div class="line"><a name="l00075"></a><span class="lineno"> 75</span>  boost::format(<span class="stringliteral">"%-10.0f %-10.0f\n"</span>) % new_bins[i_new] % i_new_width);</div>
<div class="line"><a name="l00076"></a><span class="lineno"> 76</span>  ++i_new;</div>
<div class="line"><a name="l00077"></a><span class="lineno"> 77</span>  } <span class="keywordflow">else</span> {</div>
<div class="line"><a name="l00078"></a><span class="lineno"> 78</span>  std::cout << (</div>
<div class="line"><a name="l00079"></a><span class="lineno"> 79</span>  boost::format(<span class="stringliteral">"%-10s %-10s\n"</span>) % <span class="stringliteral">"-"</span> % <span class="stringliteral">"-"</span>);</div>
<div class="line"><a name="l00080"></a><span class="lineno"> 80</span>  }</div>
<div class="line"><a name="l00081"></a><span class="lineno"> 81</span>  }</div>
<div class="line"><a name="l00082"></a><span class="lineno"> 82</span>  <span class="comment">// std::cout << "Original binning: " << std::endl; </span></div>
<div class="line"><a name="l00083"></a><span class="lineno"> 83</span>  <span class="comment">// for (std::vector<double>::const_iterator i =</span></div>
<div class="line"><a name="l00084"></a><span class="lineno"> 84</span>  <span class="comment">// init_bins.begin(); i != init_bins.end(); ++i) std::cout << *i << ", ";</span></div>
<div class="line"><a name="l00085"></a><span class="lineno"> 85</span>  <span class="comment">// std::cout << std::endl; </span></div>
<div class="line"><a name="l00086"></a><span class="lineno"> 86</span>  <span class="comment">// std::cout << "New binning: " << std::endl; </span></div>
<div class="line"><a name="l00087"></a><span class="lineno"> 87</span>  <span class="comment">// for (std::vector<double>::const_iterator i = new_bins.begin(); </span></div>
<div class="line"><a name="l00088"></a><span class="lineno"> 88</span>  <span class="comment">// i != new_bins.end(); ++i) </span></div>
<div class="line"><a name="l00089"></a><span class="lineno"> 89</span>  <span class="comment">// std::cout << *i << ", "; </span></div>
<div class="line"><a name="l00090"></a><span class="lineno"> 90</span>  <span class="comment">// std::cout << std::endl; </span></div>
<div class="line"><a name="l00091"></a><span class="lineno"> 91</span>  }</div>
<div class="line"><a name="l00092"></a><span class="lineno"> 92</span>  <span class="comment">//Altering binning in CH instance for all distributions if requested</span></div>
<div class="line"><a name="l00093"></a><span class="lineno"> 93</span>  <span class="keywordflow">if</span>(perform_rebin_) {</div>
<div class="line"><a name="l00094"></a><span class="lineno"> 94</span>  std::cout << <span class="stringliteral">"[AutoRebin] Applying binning to all relevant distributions "</span></div>
<div class="line"><a name="l00095"></a><span class="lineno"> 95</span>  <span class="stringliteral">"for analysis bin id "</span> << bin << std::endl; </div>
<div class="line"><a name="l00096"></a><span class="lineno"> 96</span>  dest.<a class="code" href="classch_1_1_combine_harvester.html#ade0f7c161d078a189404a274b93336d2">cp</a>().<a class="code" href="classch_1_1_combine_harvester.html#a83dd50569a1f1a4b5a46f2ad2b5c1cdb">bin</a>({bin}).VariableRebin(new_bins); </div>
<div class="line"><a name="l00097"></a><span class="lineno"> 97</span>  }</div>
<div class="line"><a name="l00098"></a><span class="lineno"> 98</span>  } <span class="keywordflow">else</span> std::cout << <span class="stringliteral">"[AutoRebin] Did not find any bins to merge for analysis "</span></div>
<div class="line"><a name="l00099"></a><span class="lineno"> 99</span>  <span class="stringliteral">"bin id: "</span> << bin << std::endl;</div>
<div class="line"><a name="l00100"></a><span class="lineno"> 100</span>  }</div>
<div class="line"><a name="l00101"></a><span class="lineno"> 101</span> }</div>
<div class="line"><a name="l00102"></a><span class="lineno"> 102</span>  </div>
<div class="line"><a name="l00103"></a><span class="lineno"> 103</span>  </div>
<div class="line"><a name="l00104"></a><span class="lineno"><a class="line" href="classch_1_1_auto_rebin.html#a2dc97baa47e812e6aa1817f604e2541a"> 104</a></span> <span class="keywordtype">void</span> <a class="code" href="classch_1_1_auto_rebin.html#a2dc97baa47e812e6aa1817f604e2541a">AutoRebin::FindNewBinning</a>(TH1F &total_bkg, std::vector<double> &new_bins, </div>
<div class="line"><a name="l00105"></a><span class="lineno"> 105</span>  <span class="keywordtype">double</span> bin_condition, <span class="keywordtype">double</span> bin_uncert_fraction, <span class="keywordtype">int</span> mode) {</div>
<div class="line"><a name="l00106"></a><span class="lineno"> 106</span>  </div>
<div class="line"><a name="l00107"></a><span class="lineno"> 107</span>  <span class="keywordtype">bool</span> all_bins = <span class="keyword">true</span>;</div>
<div class="line"><a name="l00108"></a><span class="lineno"> 108</span>  <span class="comment">//Find the maximum bin</span></div>
<div class="line"><a name="l00109"></a><span class="lineno"> 109</span>  <span class="keywordtype">int</span> hbin_idx = total_bkg.GetMaximumBin();</div>
<div class="line"><a name="l00110"></a><span class="lineno"> 110</span>  <span class="keywordtype">int</span> nbins = total_bkg.GetNbinsX();</div>
<div class="line"><a name="l00111"></a><span class="lineno"> 111</span>  std::cout << <span class="stringliteral">"[AutoRebin::FindNewBinning] Searching for bins failing condition "</span></div>
<div class="line"><a name="l00112"></a><span class="lineno"> 112</span>  <span class="stringliteral">"using algorithm mode: "</span> << mode << std::endl; </div>
<div class="line"><a name="l00113"></a><span class="lineno"> 113</span>  </div>
<div class="line"><a name="l00114"></a><span class="lineno"> 114</span>  <span class="comment">//Mode 0 is the simplest version of merging algorithm. It loops from the</span></div>
<div class="line"><a name="l00115"></a><span class="lineno"> 115</span>  <span class="comment">//peak bin left to bin 1 then right to final bin. When the "next" bin in</span></div>
<div class="line"><a name="l00116"></a><span class="lineno"> 116</span>  <span class="comment">//either direction fails</span></div>
<div class="line"><a name="l00117"></a><span class="lineno"> 117</span>  <span class="comment">//the threshold, it removes the boundary between the current bin and the</span></div>
<div class="line"><a name="l00118"></a><span class="lineno"> 118</span>  <span class="comment">//next bin. This will be overly conservative in situations where a better</span></div>
<div class="line"><a name="l00119"></a><span class="lineno"> 119</span>  <span class="comment">//solution is to sum a subset of subsequent bins to reach the threshold and</span></div>
<div class="line"><a name="l00120"></a><span class="lineno"> 120</span>  <span class="comment">//will lead to more rebinning than necessary.</span></div>
<div class="line"><a name="l00121"></a><span class="lineno"> 121</span>  <span class="keywordflow">if</span>(mode==0) {</div>
<div class="line"><a name="l00122"></a><span class="lineno"> 122</span>  new_bins.clear();</div>
<div class="line"><a name="l00123"></a><span class="lineno"> 123</span>  <span class="comment">//Loop from highest bin, first left and then right, merging bins where</span></div>
<div class="line"><a name="l00124"></a><span class="lineno"> 124</span>  <span class="comment">//necessary to make new list of BinLowEdges</span></div>
<div class="line"><a name="l00125"></a><span class="lineno"> 125</span>  <span class="keywordflow">if</span>(v_>0) std::cout << <span class="stringliteral">"[AutoRebin::FindNewBinning] Testing bins of "</span> </div>
<div class="line"><a name="l00126"></a><span class="lineno"> 126</span>  <span class="stringliteral">"total_bkg hist to find those failing condition, starting from "</span></div>
<div class="line"><a name="l00127"></a><span class="lineno"> 127</span>  <span class="stringliteral">"maximum bin: "</span> << hbin_idx << std::endl; </div>
<div class="line"><a name="l00128"></a><span class="lineno"> 128</span>  <span class="keywordflow">for</span>(<span class="keywordtype">int</span> idx=hbin_idx; idx>1; --idx) { </div>
<div class="line"><a name="l00129"></a><span class="lineno"> 129</span>  <span class="keywordflow">if</span>(v_>0) std::cout << <span class="stringliteral">"Bin index: "</span> << idx << <span class="stringliteral">", BinLowEdge: "</span> << </div>
<div class="line"><a name="l00130"></a><span class="lineno"> 130</span>  total_bkg.GetBinLowEdge(idx) << <span class="stringliteral">", Bin content: "</span> << </div>
<div class="line"><a name="l00131"></a><span class="lineno"> 131</span>  total_bkg.GetBinContent(idx) << <span class="stringliteral">", Bin error fraction: "</span> <<</div>
<div class="line"><a name="l00132"></a><span class="lineno"> 132</span>  total_bkg.GetBinError(idx-1)/total_bkg.GetBinContent(idx-1)</div>
<div class="line"><a name="l00133"></a><span class="lineno"> 133</span>  << std::endl;</div>
<div class="line"><a name="l00134"></a><span class="lineno"> 134</span>  <span class="keywordflow">if</span>(total_bkg.GetBinContent(idx-1) > bin_condition </div>
<div class="line"><a name="l00135"></a><span class="lineno"> 135</span>  && (total_bkg.GetBinError(idx-1)/total_bkg.GetBinContent(idx-1)</div>
<div class="line"><a name="l00136"></a><span class="lineno"> 136</span>  < bin_uncert_fraction) </div>
<div class="line"><a name="l00137"></a><span class="lineno"> 137</span>  && idx!=1)</div>
<div class="line"><a name="l00138"></a><span class="lineno"> 138</span>  new_bins.push_back(total_bkg.GetBinLowEdge(idx)); </div>
<div class="line"><a name="l00139"></a><span class="lineno"> 139</span>  } </div>
<div class="line"><a name="l00140"></a><span class="lineno"> 140</span>  <span class="keywordflow">for</span>(<span class="keywordtype">int</span> idx=hbin_idx+1; idx<=nbins; ++idx) { </div>
<div class="line"><a name="l00141"></a><span class="lineno"> 141</span>  <span class="keywordflow">if</span>(v_>0) std::cout << <span class="stringliteral">"Bin index: "</span> << idx << <span class="stringliteral">", BinLowEdge: "</span> << </div>
<div class="line"><a name="l00142"></a><span class="lineno"> 142</span>  total_bkg.GetBinLowEdge(idx) << <span class="stringliteral">", Bin content: "</span> << </div>
<div class="line"><a name="l00143"></a><span class="lineno"> 143</span>  total_bkg.GetBinContent(idx) << <span class="stringliteral">", Bin error fraction: "</span> <<</div>
<div class="line"><a name="l00144"></a><span class="lineno"> 144</span>  total_bkg.GetBinError(idx)/total_bkg.GetBinContent(idx)</div>
<div class="line"><a name="l00145"></a><span class="lineno"> 145</span>  << std::endl;</div>
<div class="line"><a name="l00146"></a><span class="lineno"> 146</span>  <span class="keywordflow">if</span>(total_bkg.GetBinContent(idx) > bin_condition</div>
<div class="line"><a name="l00147"></a><span class="lineno"> 147</span>  && (total_bkg.GetBinError(idx)/total_bkg.GetBinContent(idx)</div>
<div class="line"><a name="l00148"></a><span class="lineno"> 148</span>  < bin_uncert_fraction))</div>
<div class="line"><a name="l00149"></a><span class="lineno"> 149</span>  new_bins.push_back(total_bkg.GetBinLowEdge(idx)); </div>
<div class="line"><a name="l00150"></a><span class="lineno"> 150</span>  }</div>
<div class="line"><a name="l00151"></a><span class="lineno"> 151</span>  <span class="comment">//Add to vector the extremal bins, which are untreated in the above </span></div>
<div class="line"><a name="l00152"></a><span class="lineno"> 152</span>  new_bins.push_back(total_bkg.GetBinLowEdge(1));</div>
<div class="line"><a name="l00153"></a><span class="lineno"> 153</span>  new_bins.push_back(total_bkg.GetBinLowEdge(nbins+1));</div>
<div class="line"><a name="l00154"></a><span class="lineno"> 154</span>  std::sort(new_bins.begin(), new_bins.end()); </div>
<div class="line"><a name="l00155"></a><span class="lineno"> 155</span>  </div>
<div class="line"><a name="l00156"></a><span class="lineno"> 156</span>  <span class="comment">//Mode 1 finds bins below threshold, then tries merging with bins left or</span></div>
<div class="line"><a name="l00157"></a><span class="lineno"> 157</span>  <span class="comment">//right until threshold is met, the final choice being the one which</span></div>
<div class="line"><a name="l00158"></a><span class="lineno"> 158</span>  <span class="comment">//minimises the number of required bin merges. </span></div>
<div class="line"><a name="l00159"></a><span class="lineno"> 159</span>  } <span class="keywordflow">else</span> <span class="keywordflow">if</span>(mode == 1 || mode == 2) {</div>
<div class="line"><a name="l00160"></a><span class="lineno"> 160</span>  <span class="comment">//Start from finding the minimum bin and the bin with largest fractional</span></div>
<div class="line"><a name="l00161"></a><span class="lineno"> 161</span>  <span class="comment">//error</span></div>
<div class="line"><a name="l00162"></a><span class="lineno"> 162</span>  <span class="keywordtype">int</span> lbin_idx = 0;</div>
<div class="line"><a name="l00163"></a><span class="lineno"> 163</span>  <span class="keywordflow">if</span> (mode == 1) {</div>
<div class="line"><a name="l00164"></a><span class="lineno"> 164</span>  lbin_idx = total_bkg.GetMinimumBin();</div>
<div class="line"><a name="l00165"></a><span class="lineno"> 165</span>  } <span class="keywordflow">else</span> <span class="keywordflow">if</span> (mode == 2) {</div>
<div class="line"><a name="l00166"></a><span class="lineno"> 166</span>  <span class="keywordtype">double</span> maxval = std::numeric_limits<double>::max();</div>
<div class="line"><a name="l00167"></a><span class="lineno"> 167</span>  <span class="comment">// loop through bins from left to right - we take the rightmost</span></div>
<div class="line"><a name="l00168"></a><span class="lineno"> 168</span>  <span class="comment">// bin in the case multiple bins are tied on the smallest value</span></div>
<div class="line"><a name="l00169"></a><span class="lineno"> 169</span>  <span class="keywordflow">for</span> (<span class="keywordtype">int</span> idx = 1; idx <= total_bkg.GetNbinsX(); ++idx) {</div>
<div class="line"><a name="l00170"></a><span class="lineno"> 170</span>  <span class="keywordflow">if</span> (total_bkg.GetBinContent(idx) <= maxval) {</div>
<div class="line"><a name="l00171"></a><span class="lineno"> 171</span>  lbin_idx = idx;</div>
<div class="line"><a name="l00172"></a><span class="lineno"> 172</span>  maxval = total_bkg.GetBinContent(idx);</div>
<div class="line"><a name="l00173"></a><span class="lineno"> 173</span>  }</div>
<div class="line"><a name="l00174"></a><span class="lineno"> 174</span>  }</div>
<div class="line"><a name="l00175"></a><span class="lineno"> 175</span>  }</div>
<div class="line"><a name="l00176"></a><span class="lineno"> 176</span>  </div>
<div class="line"><a name="l00177"></a><span class="lineno"> 177</span>  <span class="keywordtype">int</span> herrbin_idx = <a class="code" href="classch_1_1_auto_rebin.html#a72dbe98c7aacd48dd99d03d2b957a934">GetMaximumFracUncertBin</a>(total_bkg);</div>
<div class="line"><a name="l00178"></a><span class="lineno"> 178</span>  <span class="keywordtype">bool</span> bin_tot_flag = total_bkg.GetBinContent(lbin_idx) <= bin_condition;</div>
<div class="line"><a name="l00179"></a><span class="lineno"> 179</span>  <span class="keywordtype">bool</span> bin_err_flag = total_bkg.GetBinError(herrbin_idx)/</div>
<div class="line"><a name="l00180"></a><span class="lineno"> 180</span>  total_bkg.GetBinContent(herrbin_idx) >= bin_uncert_fraction;</div>
<div class="line"><a name="l00181"></a><span class="lineno"> 181</span>  <span class="keywordflow">if</span>(bin_tot_flag || bin_err_flag) {</div>
<div class="line"><a name="l00182"></a><span class="lineno"> 182</span>  <span class="comment">//Fix issues with minimal bins in first pass and bin errors after </span></div>
<div class="line"><a name="l00183"></a><span class="lineno"> 183</span>  lbin_idx = (bin_tot_flag ? lbin_idx : herrbin_idx);</div>
<div class="line"><a name="l00184"></a><span class="lineno"> 184</span>  <span class="keywordflow">if</span>(v_>0 && bin_tot_flag) std::cout << <span class="stringliteral">"[AutoRebin::FindNewBinning] Testing "</span></div>
<div class="line"><a name="l00185"></a><span class="lineno"> 185</span>  <span class="stringliteral">"bins of total_bkg hist to find those with entry <= "</span> << bin_condition </div>
<div class="line"><a name="l00186"></a><span class="lineno"> 186</span>  << <span class="stringliteral">", starting from bin: "</span> << lbin_idx << std::endl; </div>
<div class="line"><a name="l00187"></a><span class="lineno"> 187</span>  <span class="keywordflow">if</span>(v_>0 && !bin_tot_flag) std::cout << <span class="stringliteral">"[AutoRebin::FindNewBinning] Testing "</span></div>
<div class="line"><a name="l00188"></a><span class="lineno"> 188</span>  <span class="stringliteral">"bins of total_bkg hist to find those with fractional error >= "</span> <<</div>
<div class="line"><a name="l00189"></a><span class="lineno"> 189</span>  bin_uncert_fraction << <span class="stringliteral">", starting from bin: "</span> << lbin_idx << std::endl; </div>
<div class="line"><a name="l00190"></a><span class="lineno"> 190</span>  <span class="comment">//loop left first</span></div>
<div class="line"><a name="l00191"></a><span class="lineno"> 191</span>  <span class="keywordtype">double</span> left_tot = total_bkg.GetBinContent(lbin_idx);</div>
<div class="line"><a name="l00192"></a><span class="lineno"> 192</span>  <span class="keywordtype">double</span> left_err_tot = total_bkg.GetBinError(lbin_idx);</div>
<div class="line"><a name="l00193"></a><span class="lineno"> 193</span>  <span class="keywordtype">int</span> idx = lbin_idx - 1;</div>
<div class="line"><a name="l00194"></a><span class="lineno"> 194</span>  <span class="comment">//Note: this logic works so long as bins with 0 entries are merged</span></div>
<div class="line"><a name="l00195"></a><span class="lineno"> 195</span>  <span class="comment">//first, to give sensible values for the fractional error</span></div>
<div class="line"><a name="l00196"></a><span class="lineno"> 196</span>  <span class="keywordflow">while</span> (((bin_tot_flag && left_tot <= bin_condition) || (!bin_tot_flag && </div>
<div class="line"><a name="l00197"></a><span class="lineno"> 197</span>  left_err_tot/left_tot >= bin_uncert_fraction)) && idx > 0) {</div>
<div class="line"><a name="l00198"></a><span class="lineno"> 198</span>  left_err_tot = sqrt(pow(left_err_tot,2) + pow(total_bkg.GetBinError(idx),2));</div>
<div class="line"><a name="l00199"></a><span class="lineno"> 199</span>  left_tot = left_tot + total_bkg.GetBinContent(idx);</div>
<div class="line"><a name="l00200"></a><span class="lineno"> 200</span>  <span class="keywordflow">if</span>(v_>0) std::cout << <span class="stringliteral">"Moving left, bin index: "</span> << idx << <span class="stringliteral">", BinLowEdge: "</span> << </div>
<div class="line"><a name="l00201"></a><span class="lineno"> 201</span>  total_bkg.GetBinLowEdge(idx) << <span class="stringliteral">", Bin content: "</span> << </div>
<div class="line"><a name="l00202"></a><span class="lineno"> 202</span>  total_bkg.GetBinContent(idx) << <span class="stringliteral">", Running total from combining bins: "</span></div>
<div class="line"><a name="l00203"></a><span class="lineno"> 203</span>  << left_tot << <span class="stringliteral">", Current fractional error: "</span> << left_err_tot/left_tot </div>
<div class="line"><a name="l00204"></a><span class="lineno"> 204</span>  << std::endl;</div>
<div class="line"><a name="l00205"></a><span class="lineno"> 205</span>  --idx;</div>
<div class="line"><a name="l00206"></a><span class="lineno"> 206</span>  }</div>
<div class="line"><a name="l00207"></a><span class="lineno"> 207</span>  <span class="keywordtype">int</span> left_bins = lbin_idx - idx;</div>
<div class="line"><a name="l00208"></a><span class="lineno"> 208</span>  <span class="keywordtype">double</span> right_tot = total_bkg.GetBinContent(lbin_idx);</div>
<div class="line"><a name="l00209"></a><span class="lineno"> 209</span>  <span class="keywordtype">double</span> right_err_tot = total_bkg.GetBinError(lbin_idx);</div>
<div class="line"><a name="l00210"></a><span class="lineno"> 210</span>  idx = lbin_idx + 1;</div>
<div class="line"><a name="l00211"></a><span class="lineno"> 211</span>  <span class="comment">//now try right</span></div>
<div class="line"><a name="l00212"></a><span class="lineno"> 212</span>  <span class="keywordflow">while</span> (((bin_tot_flag && right_tot <= bin_condition) || (!bin_tot_flag && </div>
<div class="line"><a name="l00213"></a><span class="lineno"> 213</span>  right_err_tot/right_tot >= bin_uncert_fraction)) && idx <= nbins) {</div>
<div class="line"><a name="l00214"></a><span class="lineno"> 214</span>  right_err_tot = sqrt(pow(right_err_tot,2) + pow(total_bkg.GetBinError(idx),2));</div>
<div class="line"><a name="l00215"></a><span class="lineno"> 215</span>  right_tot = right_tot + total_bkg.GetBinContent(idx);</div>
<div class="line"><a name="l00216"></a><span class="lineno"> 216</span>  <span class="keywordflow">if</span>(v_>0) std::cout << <span class="stringliteral">"Moving right, bin index: "</span> << idx << <span class="stringliteral">", BinLowEdge: "</span> << </div>
<div class="line"><a name="l00217"></a><span class="lineno"> 217</span>  total_bkg.GetBinLowEdge(idx) << <span class="stringliteral">", Bin content: "</span> << </div>
<div class="line"><a name="l00218"></a><span class="lineno"> 218</span>  total_bkg.GetBinContent(idx) << <span class="stringliteral">", Running total from combining bins: "</span></div>
<div class="line"><a name="l00219"></a><span class="lineno"> 219</span>  << right_tot << <span class="stringliteral">", Current fractional error: "</span> << right_err_tot/right_tot </div>
<div class="line"><a name="l00220"></a><span class="lineno"> 220</span>  << std::endl;</div>
<div class="line"><a name="l00221"></a><span class="lineno"> 221</span>  ++idx;</div>
<div class="line"><a name="l00222"></a><span class="lineno"> 222</span>  }</div>
<div class="line"><a name="l00223"></a><span class="lineno"> 223</span>  <span class="keywordtype">int</span> right_bins = idx - lbin_idx;</div>
<div class="line"><a name="l00224"></a><span class="lineno"> 224</span>  <span class="keywordtype">bool</span> left_pass = bin_tot_flag ? left_tot > bin_condition : </div>
<div class="line"><a name="l00225"></a><span class="lineno"> 225</span>  left_err_tot/left_tot < bin_uncert_fraction;</div>
<div class="line"><a name="l00226"></a><span class="lineno"> 226</span>  <span class="keywordtype">bool</span> right_pass = bin_tot_flag ? right_tot > bin_condition : </div>
<div class="line"><a name="l00227"></a><span class="lineno"> 227</span>  right_err_tot/right_tot < bin_uncert_fraction;</div>
<div class="line"><a name="l00228"></a><span class="lineno"> 228</span>  <span class="keywordflow">if</span> (mode == 2) right_pass = <span class="keyword">false</span>; <span class="comment">// never merge right in mode 2</span></div>
<div class="line"><a name="l00229"></a><span class="lineno"> 229</span>  <span class="comment">//Decision on which way to merge - remove relevant entries from</span></div>
<div class="line"><a name="l00230"></a><span class="lineno"> 230</span>  <span class="comment">//binning vector as applicable</span></div>
<div class="line"><a name="l00231"></a><span class="lineno"> 231</span>  <span class="keywordflow">if</span>(left_pass && !right_pass) {</div>
<div class="line"><a name="l00232"></a><span class="lineno"> 232</span>  <span class="keywordflow">if</span>(v_>0) std::cout << <span class="stringliteral">"Merging left using "</span> << left_bins - 1 << </div>
<div class="line"><a name="l00233"></a><span class="lineno"> 233</span>  <span class="stringliteral">" bins"</span> << std::endl;</div>
<div class="line"><a name="l00234"></a><span class="lineno"> 234</span>  <span class="keywordflow">for</span>(<span class="keywordtype">int</span> i = lbin_idx; i > lbin_idx - left_bins + 1; --i) {</div>
<div class="line"><a name="l00235"></a><span class="lineno"> 235</span>  <span class="keywordflow">if</span>(v_>0) std::cout << <span class="stringliteral">"Erasing bin low edge for bin "</span> << i << </div>
<div class="line"><a name="l00236"></a><span class="lineno"> 236</span>  <span class="stringliteral">", BinLowEdge: "</span> << total_bkg.GetBinLowEdge(i) << std::endl;</div>
<div class="line"><a name="l00237"></a><span class="lineno"> 237</span>  new_bins.erase( std::remove( new_bins.begin(), new_bins.end(), </div>
<div class="line"><a name="l00238"></a><span class="lineno"> 238</span>  total_bkg.GetBinLowEdge(i)),new_bins.end() );</div>
<div class="line"><a name="l00239"></a><span class="lineno"> 239</span>  }</div>
<div class="line"><a name="l00240"></a><span class="lineno"> 240</span>  } <span class="keywordflow">else</span> <span class="keywordflow">if</span>(right_pass && !left_pass) {</div>
<div class="line"><a name="l00241"></a><span class="lineno"> 241</span>  <span class="keywordflow">if</span>(v_>0) std::cout << <span class="stringliteral">"Merging right using "</span> << right_bins - 1 << </div>
<div class="line"><a name="l00242"></a><span class="lineno"> 242</span>  <span class="stringliteral">" bins"</span> << std::endl; </div>
<div class="line"><a name="l00243"></a><span class="lineno"> 243</span>  <span class="keywordflow">for</span>(<span class="keywordtype">int</span> i = lbin_idx; i < lbin_idx + right_bins - 1; ++i) {</div>
<div class="line"><a name="l00244"></a><span class="lineno"> 244</span>  <span class="keywordflow">if</span>(v_>0) std::cout << <span class="stringliteral">"Erasing bin upper edge for bin "</span> << i << </div>
<div class="line"><a name="l00245"></a><span class="lineno"> 245</span>  <span class="stringliteral">", BinUpperEdge: "</span> << total_bkg.GetBinLowEdge(i+1) << std::endl;</div>
<div class="line"><a name="l00246"></a><span class="lineno"> 246</span>  new_bins.erase( std::remove( new_bins.begin(), new_bins.end(), </div>
<div class="line"><a name="l00247"></a><span class="lineno"> 247</span>  total_bkg.GetBinLowEdge(i+1)),new_bins.end() );</div>
<div class="line"><a name="l00248"></a><span class="lineno"> 248</span>  }</div>
<div class="line"><a name="l00249"></a><span class="lineno"> 249</span>  } <span class="keywordflow">else</span> <span class="keywordflow">if</span>(left_pass && right_pass && left_bins < right_bins) {</div>
<div class="line"><a name="l00250"></a><span class="lineno"> 250</span>  <span class="keywordflow">if</span>(v_>0) std::cout << <span class="stringliteral">"Merging left using "</span> << left_bins - 1 << </div>
<div class="line"><a name="l00251"></a><span class="lineno"> 251</span>  <span class="stringliteral">" bins"</span> << std::endl;</div>
<div class="line"><a name="l00252"></a><span class="lineno"> 252</span>  <span class="keywordflow">for</span>(<span class="keywordtype">int</span> i = lbin_idx; i > lbin_idx - left_bins + 1; --i) {</div>
<div class="line"><a name="l00253"></a><span class="lineno"> 253</span>  <span class="keywordflow">if</span>(v_>0) std::cout << <span class="stringliteral">"Erasing bin low edge for bin "</span> << i << </div>
<div class="line"><a name="l00254"></a><span class="lineno"> 254</span>  <span class="stringliteral">", BinLowEdge: "</span> << total_bkg.GetBinLowEdge(i) << std::endl;</div>
<div class="line"><a name="l00255"></a><span class="lineno"> 255</span>  new_bins.erase( std::remove( new_bins.begin(), new_bins.end(), </div>
<div class="line"><a name="l00256"></a><span class="lineno"> 256</span>  total_bkg.GetBinLowEdge(i)),new_bins.end() );</div>
<div class="line"><a name="l00257"></a><span class="lineno"> 257</span>  }</div>
<div class="line"><a name="l00258"></a><span class="lineno"> 258</span>  } <span class="keywordflow">else</span> <span class="keywordflow">if</span>(left_pass && right_pass && left_bins > right_bins) {</div>
<div class="line"><a name="l00259"></a><span class="lineno"> 259</span>  <span class="keywordflow">if</span>(v_>0) std::cout << <span class="stringliteral">"Merging right using "</span> << right_bins - 1 << </div>
<div class="line"><a name="l00260"></a><span class="lineno"> 260</span>  <span class="stringliteral">" bins"</span> << std::endl;</div>
<div class="line"><a name="l00261"></a><span class="lineno"> 261</span>  <span class="keywordflow">for</span>(<span class="keywordtype">int</span> i = lbin_idx; i < lbin_idx + right_bins - 1 ; ++i) {</div>
<div class="line"><a name="l00262"></a><span class="lineno"> 262</span>  <span class="keywordflow">if</span>(v_>0) std::cout << <span class="stringliteral">"Erasing bin upper edge for bin "</span> << i << </div>
<div class="line"><a name="l00263"></a><span class="lineno"> 263</span>  <span class="stringliteral">", BinUpperEdge: "</span> << total_bkg.GetBinLowEdge(i+1) << std::endl;</div>
<div class="line"><a name="l00264"></a><span class="lineno"> 264</span>  new_bins.erase( std::remove( new_bins.begin(), new_bins.end(), </div>
<div class="line"><a name="l00265"></a><span class="lineno"> 265</span>  total_bkg.GetBinLowEdge(i+1)),new_bins.end() );</div>
<div class="line"><a name="l00266"></a><span class="lineno"> 266</span>  }</div>
<div class="line"><a name="l00267"></a><span class="lineno"> 267</span>  <span class="comment">//In case where left and right are equally good, merge towards the</span></div>
<div class="line"><a name="l00268"></a><span class="lineno"> 268</span>  <span class="comment">//peak (unclear to me if this is really always better but it generally more</span></div>
<div class="line"><a name="l00269"></a><span class="lineno"> 269</span>  <span class="comment">//conservative in leading to bins with higher content)</span></div>
<div class="line"><a name="l00270"></a><span class="lineno"> 270</span>  } <span class="keywordflow">else</span> <span class="keywordflow">if</span>(left_pass && right_pass && left_bins == right_bins &&</div>
<div class="line"><a name="l00271"></a><span class="lineno"> 271</span>  lbin_idx < hbin_idx) {</div>
<div class="line"><a name="l00272"></a><span class="lineno"> 272</span>  <span class="keywordflow">if</span>(v_>0) std::cout << <span class="stringliteral">"Merging right using "</span> << right_bins - 1 << </div>
<div class="line"><a name="l00273"></a><span class="lineno"> 273</span>  <span class="stringliteral">" bins"</span> << std::endl;</div>
<div class="line"><a name="l00274"></a><span class="lineno"> 274</span>  <span class="keywordflow">for</span>(<span class="keywordtype">int</span> i = lbin_idx; i < lbin_idx + right_bins - 1; ++i) {</div>
<div class="line"><a name="l00275"></a><span class="lineno"> 275</span>  <span class="keywordflow">if</span>(v_>0) std::cout << <span class="stringliteral">"Erasing bin upper edge for bin "</span> << i << </div>
<div class="line"><a name="l00276"></a><span class="lineno"> 276</span>  <span class="stringliteral">", BinUpperEdge: "</span> << total_bkg.GetBinLowEdge(i+1) << std::endl;</div>
<div class="line"><a name="l00277"></a><span class="lineno"> 277</span>  new_bins.erase( std::remove( new_bins.begin(), new_bins.end(), </div>
<div class="line"><a name="l00278"></a><span class="lineno"> 278</span>  total_bkg.GetBinLowEdge(i+1)),new_bins.end() );</div>
<div class="line"><a name="l00279"></a><span class="lineno"> 279</span>  }</div>
<div class="line"><a name="l00280"></a><span class="lineno"> 280</span>  } <span class="keywordflow">else</span> <span class="keywordflow">if</span>(left_pass && right_pass && left_bins == right_bins && </div>
<div class="line"><a name="l00281"></a><span class="lineno"> 281</span>  lbin_idx > hbin_idx) {</div>
<div class="line"><a name="l00282"></a><span class="lineno"> 282</span>  <span class="keywordflow">if</span>(v_>0) std::cout << <span class="stringliteral">"Merging left using "</span> << left_bins - 1 << </div>
<div class="line"><a name="l00283"></a><span class="lineno"> 283</span>  <span class="stringliteral">" bins"</span> << std::endl;</div>
<div class="line"><a name="l00284"></a><span class="lineno"> 284</span>  <span class="keywordflow">for</span>(<span class="keywordtype">int</span> i = lbin_idx; i > lbin_idx - left_bins + 1; --i) {</div>
<div class="line"><a name="l00285"></a><span class="lineno"> 285</span>  <span class="keywordflow">if</span>(v_>0) std::cout << <span class="stringliteral">"Erasing bin low edge for bin "</span> << i << </div>
<div class="line"><a name="l00286"></a><span class="lineno"> 286</span>  <span class="stringliteral">", BinLowEdge: "</span> << total_bkg.GetBinLowEdge(i) << std::endl;</div>
<div class="line"><a name="l00287"></a><span class="lineno"> 287</span>  new_bins.erase( std::remove( new_bins.begin(), new_bins.end(), </div>
<div class="line"><a name="l00288"></a><span class="lineno"> 288</span>  total_bkg.GetBinLowEdge(i)),new_bins.end() );</div>
<div class="line"><a name="l00289"></a><span class="lineno"> 289</span>  }</div>
<div class="line"><a name="l00290"></a><span class="lineno"> 290</span>  } <span class="keywordflow">else</span> <span class="keywordflow">if</span>(!left_pass && !right_pass) {</div>
<div class="line"><a name="l00291"></a><span class="lineno"> 291</span>  std::cout << <span class="stringliteral">"[AutoRebin::FindNewBinning] WARNING: No solution found "</span></div>
<div class="line"><a name="l00292"></a><span class="lineno"> 292</span>  <span class="stringliteral">"to satisfy condition, try merging all bins"</span> << std::endl;</div>
<div class="line"><a name="l00293"></a><span class="lineno"> 293</span>  <span class="keywordflow">for</span>(<span class="keywordtype">int</span> i = 2; i<=nbins; ++i) new_bins.erase( std::remove( new_bins.begin(), </div>
<div class="line"><a name="l00294"></a><span class="lineno"> 294</span>  new_bins.end(), total_bkg.GetBinLowEdge(i)),new_bins.end() );</div>
<div class="line"><a name="l00295"></a><span class="lineno"> 295</span>  }</div>
<div class="line"><a name="l00296"></a><span class="lineno"> 296</span>  }</div>
<div class="line"><a name="l00297"></a><span class="lineno"> 297</span>  } <span class="keywordflow">else</span> {</div>
<div class="line"><a name="l00298"></a><span class="lineno"> 298</span>  std::cout << <span class="stringliteral">"[AutoRebin::FindNewBinning] Chosen mode "</span> << mode << <span class="stringliteral">" not"</span></div>
<div class="line"><a name="l00299"></a><span class="lineno"> 299</span>  <span class="stringliteral">" currently supported, exiting without altering binning"</span> << std::endl;</div>
<div class="line"><a name="l00300"></a><span class="lineno"> 300</span>  <span class="keywordflow">return</span>;</div>
<div class="line"><a name="l00301"></a><span class="lineno"> 301</span>  }</div>
<div class="line"><a name="l00302"></a><span class="lineno"> 302</span>  </div>
<div class="line"><a name="l00303"></a><span class="lineno"> 303</span>  TH1F* total_bkg_new;</div>
<div class="line"><a name="l00304"></a><span class="lineno"> 304</span>  total_bkg_new = (TH1F*)total_bkg.Rebin(new_bins.size()-1, <span class="stringliteral">"total_bkg_new"</span>,</div>
<div class="line"><a name="l00305"></a><span class="lineno"> 305</span>  &new_bins[0]); </div>
<div class="line"><a name="l00306"></a><span class="lineno"> 306</span>  </div>
<div class="line"><a name="l00307"></a><span class="lineno"> 307</span>  <span class="comment">//Flag checks if all bins now satify the condition after pass through</span></div>
<div class="line"><a name="l00308"></a><span class="lineno"> 308</span>  <span class="keywordtype">int</span> nbins_new = total_bkg_new->GetNbinsX();</div>
<div class="line"><a name="l00309"></a><span class="lineno"> 309</span>  <span class="keywordflow">if</span>(nbins_new!=nbins) {</div>
<div class="line"><a name="l00310"></a><span class="lineno"> 310</span>  <span class="keywordflow">if</span>(v_>0) std::cout << std::endl;</div>
<div class="line"><a name="l00311"></a><span class="lineno"> 311</span>  <span class="keywordflow">if</span>(v_>0) std::cout << <span class="stringliteral">"[AutoRebin::FindNewBinning] New binning found: "</span> </div>
<div class="line"><a name="l00312"></a><span class="lineno"> 312</span>  << std::endl;</div>
<div class="line"><a name="l00313"></a><span class="lineno"> 313</span>  <span class="keywordflow">for</span>(<span class="keywordtype">int</span> i=1; i<=nbins_new+1; ++i) {</div>
<div class="line"><a name="l00314"></a><span class="lineno"> 314</span>  <span class="keywordflow">if</span>(v_>0) std::cout << <span class="stringliteral">"Bin index: "</span> << i << <span class="stringliteral">", BinLowEdge: "</span> << </div>
<div class="line"><a name="l00315"></a><span class="lineno"> 315</span>  total_bkg_new->GetBinLowEdge(i) << <span class="stringliteral">", Bin content: "</span> << </div>
<div class="line"><a name="l00316"></a><span class="lineno"> 316</span>  total_bkg_new->GetBinContent(i) << <span class="stringliteral">", Bin error fraction: "</span> <<</div>
<div class="line"><a name="l00317"></a><span class="lineno"> 317</span>  total_bkg_new->GetBinError(i)/total_bkg_new->GetBinContent(i) </div>
<div class="line"><a name="l00318"></a><span class="lineno"> 318</span>  << std::endl;</div>
<div class="line"><a name="l00319"></a><span class="lineno"> 319</span>  <span class="comment">//Last bin is allowed to be failing condition, just there to enclose the</span></div>
<div class="line"><a name="l00320"></a><span class="lineno"> 320</span>  <span class="comment">//penultimate bin</span></div>
<div class="line"><a name="l00321"></a><span class="lineno"> 321</span>  <span class="keywordflow">if</span>((total_bkg_new->GetBinContent(i) <= bin_condition </div>
<div class="line"><a name="l00322"></a><span class="lineno"> 322</span>  || total_bkg_new->GetBinError(i)/total_bkg_new->GetBinContent(i) </div>
<div class="line"><a name="l00323"></a><span class="lineno"> 323</span>  >= bin_uncert_fraction)</div>
<div class="line"><a name="l00324"></a><span class="lineno"> 324</span>  && i!=nbins_new+1) all_bins=<span class="keyword">false</span>;</div>
<div class="line"><a name="l00325"></a><span class="lineno"> 325</span>  }</div>
<div class="line"><a name="l00326"></a><span class="lineno"> 326</span>  } </div>
<div class="line"><a name="l00327"></a><span class="lineno"> 327</span>  </div>
<div class="line"><a name="l00328"></a><span class="lineno"> 328</span>  <span class="keywordflow">if</span>(all_bins) <span class="keywordflow">return</span>;</div>
<div class="line"><a name="l00329"></a><span class="lineno"> 329</span>  <span class="comment">//Run function again if all_bins is not true, i.e. if it's possible that not</span></div>
<div class="line"><a name="l00330"></a><span class="lineno"> 330</span>  <span class="comment">//all bins pass condition after one pass </span></div>
<div class="line"><a name="l00331"></a><span class="lineno"> 331</span>  <span class="keywordflow">else</span> <a class="code" href="classch_1_1_auto_rebin.html#a2dc97baa47e812e6aa1817f604e2541a">FindNewBinning</a>(*total_bkg_new, new_bins, bin_condition, bin_uncert_fraction, mode);</div>
<div class="line"><a name="l00332"></a><span class="lineno"> 332</span>  </div>
<div class="line"><a name="l00333"></a><span class="lineno"> 333</span> }</div>
<div class="line"><a name="l00334"></a><span class="lineno"> 334</span>  </div>
<div class="line"><a name="l00335"></a><span class="lineno"> 335</span>  </div>
<div class="line"><a name="l00336"></a><span class="lineno"><a class="line" href="classch_1_1_auto_rebin.html#a72dbe98c7aacd48dd99d03d2b957a934"> 336</a></span> <span class="keywordtype">int</span> <a class="code" href="classch_1_1_auto_rebin.html#a72dbe98c7aacd48dd99d03d2b957a934">AutoRebin::GetMaximumFracUncertBin</a>(TH1F &total_bkg) {</div>
<div class="line"><a name="l00337"></a><span class="lineno"> 337</span>  <span class="keywordtype">int</span> idx = 1;</div>
<div class="line"><a name="l00338"></a><span class="lineno"> 338</span>  <span class="keywordtype">double</span> maximum = 0;</div>
<div class="line"><a name="l00339"></a><span class="lineno"> 339</span>  <span class="keywordflow">for</span>(<span class="keywordtype">int</span> i = 1; i <= total_bkg.GetNbinsX(); ++i){</div>
<div class="line"><a name="l00340"></a><span class="lineno"> 340</span>  <span class="keywordflow">if</span>(total_bkg.GetBinError(i)/total_bkg.GetBinContent(i) > maximum) {</div>
<div class="line"><a name="l00341"></a><span class="lineno"> 341</span>  maximum = total_bkg.GetBinError(i)/total_bkg.GetBinContent(i);</div>
<div class="line"><a name="l00342"></a><span class="lineno"> 342</span>  idx = i;</div>
<div class="line"><a name="l00343"></a><span class="lineno"> 343</span>  }</div>
<div class="line"><a name="l00344"></a><span class="lineno"> 344</span>  }</div>
<div class="line"><a name="l00345"></a><span class="lineno"> 345</span>  </div>
<div class="line"><a name="l00346"></a><span class="lineno"> 346</span>  <span class="keywordflow">return</span> idx; </div>
<div class="line"><a name="l00347"></a><span class="lineno"> 347</span> }</div>
<div class="line"><a name="l00348"></a><span class="lineno"> 348</span>  </div>
<div class="line"><a name="l00349"></a><span class="lineno"> 349</span>  </div>
<div class="line"><a name="l00350"></a><span class="lineno"> 350</span>  </div>
<div class="line"><a name="l00351"></a><span class="lineno"> 351</span>  </div>
<div class="line"><a name="l00352"></a><span class="lineno"> 352</span> }</div>
<div class="ttc" id="a_auto_rebin_8h_html"><div class="ttname"><a href="_auto_rebin_8h.html">AutoRebin.h</a></div></div>
<div class="ttc" id="aclassch_1_1_auto_rebin_html_a2dc97baa47e812e6aa1817f604e2541a"><div class="ttname"><a href="classch_1_1_auto_rebin.html#a2dc97baa47e812e6aa1817f604e2541a">ch::AutoRebin::FindNewBinning</a></div><div class="ttdeci">void FindNewBinning(TH1F &total_bkg, std::vector< double > &new_bins, double bin_condition, double bin_uncert_fraction, int mode)</div><div class="ttdoc">Pass through the total background histogram to find bins failing the required condition ("empty" bins...</div><div class="ttdef"><b>Definition:</b> <a href="_auto_rebin_8cc_source.html#l00104">AutoRebin.cc:104</a></div></div>
<div class="ttc" id="aclassch_1_1_auto_rebin_html_a72dbe98c7aacd48dd99d03d2b957a934"><div class="ttname"><a href="classch_1_1_auto_rebin.html#a72dbe98c7aacd48dd99d03d2b957a934">ch::AutoRebin::GetMaximumFracUncertBin</a></div><div class="ttdeci">int GetMaximumFracUncertBin(TH1F &total_bkg)</div><div class="ttdoc">Return bin with maximum value of fractional error.</div><div class="ttdef"><b>Definition:</b> <a href="_auto_rebin_8cc_source.html#l00336">AutoRebin.cc:336</a></div></div>
<div class="ttc" id="aclassch_1_1_auto_rebin_html_a9305a4b7d600e31a17ccc6606d488825"><div class="ttname"><a href="classch_1_1_auto_rebin.html#a9305a4b7d600e31a17ccc6606d488825">ch::AutoRebin::AutoRebin</a></div><div class="ttdeci">AutoRebin()</div><div class="ttdef"><b>Definition:</b> <a href="_auto_rebin_8cc_source.html#l00010">AutoRebin.cc:10</a></div></div>
<div class="ttc" id="aclassch_1_1_auto_rebin_html_af9525ed197d8b5742695c729645ea4a2"><div class="ttname"><a href="classch_1_1_auto_rebin.html#af9525ed197d8b5742695c729645ea4a2">ch::AutoRebin::Rebin</a></div><div class="ttdeci">void Rebin(CombineHarvester &src, CombineHarvester &dest)</div><div class="ttdoc">Work out optimal binning using the total background histogram built from src, and apply the binning t...</div><div class="ttdef"><b>Definition:</b> <a href="_auto_rebin_8cc_source.html#l00018">AutoRebin.cc:18</a></div></div>
<div class="ttc" id="aclassch_1_1_combine_harvester_html"><div class="ttname"><a href="classch_1_1_combine_harvester.html">ch::CombineHarvester</a></div><div class="ttdef"><b>Definition:</b> <a href="_combine_harvester_8h_source.html#l00030">CombineHarvester.h:30</a></div></div>
<div class="ttc" id="aclassch_1_1_combine_harvester_html_a44064524ffe47ccac63ef8025a6f46dc"><div class="ttname"><a href="classch_1_1_combine_harvester.html#a44064524ffe47ccac63ef8025a6f46dc">ch::CombineHarvester::ForEachProc</a></div><div class="ttdeci">void ForEachProc(Function func)</div><div class="ttdef"><b>Definition:</b> <a href="_combine_harvester_8h_source.html#l00636">CombineHarvester.h:636</a></div></div>
<div class="ttc" id="aclassch_1_1_combine_harvester_html_a83dd50569a1f1a4b5a46f2ad2b5c1cdb"><div class="ttname"><a href="classch_1_1_combine_harvester.html#a83dd50569a1f1a4b5a46f2ad2b5c1cdb">ch::CombineHarvester::bin</a></div><div class="ttdeci">CombineHarvester & bin(std::vector< std::string > const &vec, bool cond=true)</div><div class="ttdef"><b>Definition:</b> <a href="_combine_harvester___filters_8cc_source.html#l00013">CombineHarvester_Filters.cc:13</a></div></div>
<div class="ttc" id="aclassch_1_1_combine_harvester_html_a869c951c635b86fba33b2c550c9c39c9"><div class="ttname"><a href="classch_1_1_combine_harvester.html#a869c951c635b86fba33b2c550c9c39c9">ch::CombineHarvester::bin_set</a></div><div class="ttdeci">std::set< std::string > bin_set()</div><div class="ttdef"><b>Definition:</b> <a href="_combine_harvester___filters_8cc_source.html#l00190">CombineHarvester_Filters.cc:190</a></div></div>
<div class="ttc" id="aclassch_1_1_combine_harvester_html_ade0f7c161d078a189404a274b93336d2"><div class="ttname"><a href="classch_1_1_combine_harvester.html#ade0f7c161d078a189404a274b93336d2">ch::CombineHarvester::cp</a></div><div class="ttdeci">CombineHarvester cp()</div><div class="ttdoc">Creates and returns a shallow copy of the CombineHarvester instance.</div><div class="ttdef"><b>Definition:</b> <a href="_combine_harvester_8cc_source.html#l00220">CombineHarvester.cc:220</a></div></div>
<div class="ttc" id="aclassch_1_1_process_html"><div class="ttname"><a href="classch_1_1_process.html">ch::Process</a></div><div class="ttdef"><b>Definition:</b> <a href="_process_8h_source.html#l00015">Process.h:15</a></div></div>
<div class="ttc" id="aclassch_1_1_process_html_a3818d45b542fe058e4159fe0a30d2fba"><div class="ttname"><a href="classch_1_1_process.html#a3818d45b542fe058e4159fe0a30d2fba">ch::Process::ClonedScaledShape</a></div><div class="ttdeci">std::unique_ptr< TH1 > ClonedScaledShape() const</div><div class="ttdef"><b>Definition:</b> <a href="_process_8cc_source.html#l00117">Process.cc:117</a></div></div>
<div class="ttc" id="anamespacech_html"><div class="ttname"><a href="namespacech.html">ch</a></div><div class="ttdef"><b>Definition:</b> <a href="_algorithm_8h_source.html#l00010">Algorithm.h:10</a></div></div>
</div><!-- fragment --></div><!-- contents -->
</div><!-- doc-content -->
<!-- HTML footer for doxygen 1.8.6-->
<!-- start footer part -->
</body>
</html>