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
477
478
479
480
481
482
483
484
485
486
487
488
489
490
491
492
493
494
495
496
497
498
499
500
501
502
503
504
505
506
507
508
509
510
511
512
513
514
515
516
517
518
519
520
521
522
523
524
525
526
527
528
529
530
531
532
533
534
535
536
537
538
539
540
541
542
543
544
545
546
547
548
549
550
551
552
553
554
555
556
557
558
559
560
561
562
563
564
565
566
567
568
569
570
571
572
573
574
575
576
577
578
579
580
581
582
583
584
585
586
587
588
589
590
591
592
593
594
595
596
597
598
599
600
601
602
603
604
605
606
607
608
|
<!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.8.9.1"/>
<title>Boost.Sort: I:/modular-boost/libs/sort/include/boost/sort/spreadsort/detail/integer_sort.hpp 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="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">
$(document).ready(function() { init_search(); });
</script>
<link href="doxygen.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: 56px;">
<td style="padding-left: 0.5em;">
<div id="projectname">Boost.Sort
</div>
</td>
</tr>
</tbody>
</table>
</div>
<!-- end header part -->
<!-- Generated by Doxygen 1.8.9.1 -->
<script type="text/javascript">
var searchBox = new SearchBox("searchBox", "search",false,'Search');
</script>
<div id="navrow1" class="tabs">
<ul class="tablist">
<li><a href="index.html"><span>Main Page</span></a></li>
<li><a href="namespaces.html"><span>Namespaces</span></a></li>
<li><a href="annotated.html"><span>Classes</span></a></li>
<li class="current"><a href="files.html"><span>Files</span></a></li>
<li>
<div id="MSearchBox" class="MSearchBoxInactive">
<span class="left">
<img id="MSearchSelect" src="search/mag_sel.png"
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.png" alt=""/></a>
</span>
</div>
</li>
</ul>
</div>
<div id="navrow2" class="tabs2">
<ul class="tablist">
<li><a href="files.html"><span>File List</span></a></li>
</ul>
</div>
<!-- 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 id="nav-path" class="navpath">
<ul>
<li class="navelem"><a class="el" href="dir_d44c64559bbebec7f509842c48db8b23.html">include</a></li><li class="navelem"><a class="el" href="dir_1878a3f4746a95c6aad317458cc7ef80.html">boost</a></li><li class="navelem"><a class="el" href="dir_0dcad0da4f36218cbabb216021de9867.html">sort</a></li><li class="navelem"><a class="el" href="dir_4aa236a92b75d6f514e733718a475329.html">spreadsort</a></li><li class="navelem"><a class="el" href="dir_1b6f0a484b3a75c2ed43dc394e95eff6.html">detail</a></li> </ul>
</div>
</div><!-- top -->
<div class="header">
<div class="headertitle">
<div class="title">integer_sort.hpp</div> </div>
</div><!--header-->
<div class="contents">
<a href="detail_2integer__sort_8hpp.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="comment">// Details for templated Spreadsort-based integer_sort.</span></div>
<div class="line"><a name="l00002"></a><span class="lineno"> 2</span> </div>
<div class="line"><a name="l00003"></a><span class="lineno"> 3</span> <span class="comment">// Copyright Steven J. Ross 2001 - 2014.</span></div>
<div class="line"><a name="l00004"></a><span class="lineno"> 4</span> <span class="comment">// Distributed under the Boost Software License, Version 1.0.</span></div>
<div class="line"><a name="l00005"></a><span class="lineno"> 5</span> <span class="comment">// (See accompanying file LICENSE_1_0.txt or copy at</span></div>
<div class="line"><a name="l00006"></a><span class="lineno"> 6</span> <span class="comment">// http://www.boost.org/LICENSE_1_0.txt)</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="comment">// See http://www.boost.org/libs/sort for library home page.</span></div>
<div class="line"><a name="l00009"></a><span class="lineno"> 9</span> </div>
<div class="line"><a name="l00010"></a><span class="lineno"> 10</span> <span class="comment">/*</span></div>
<div class="line"><a name="l00011"></a><span class="lineno"> 11</span> <span class="comment">Some improvements suggested by:</span></div>
<div class="line"><a name="l00012"></a><span class="lineno"> 12</span> <span class="comment">Phil Endecott and Frank Gennari</span></div>
<div class="line"><a name="l00013"></a><span class="lineno"> 13</span> <span class="comment">*/</span></div>
<div class="line"><a name="l00014"></a><span class="lineno"> 14</span> </div>
<div class="line"><a name="l00015"></a><span class="lineno"> 15</span> <span class="preprocessor">#ifndef BOOST_SORT_SPREADSORT_DETAIL_INTEGER_SORT_HPP</span></div>
<div class="line"><a name="l00016"></a><span class="lineno"> 16</span> <span class="preprocessor">#define BOOST_SORT_SPREADSORT_DETAIL_INTEGER_SORT_HPP</span></div>
<div class="line"><a name="l00017"></a><span class="lineno"> 17</span> <span class="preprocessor">#include <algorithm></span></div>
<div class="line"><a name="l00018"></a><span class="lineno"> 18</span> <span class="preprocessor">#include <vector></span></div>
<div class="line"><a name="l00019"></a><span class="lineno"> 19</span> <span class="preprocessor">#include <limits></span></div>
<div class="line"><a name="l00020"></a><span class="lineno"> 20</span> <span class="preprocessor">#include <functional></span></div>
<div class="line"><a name="l00021"></a><span class="lineno"> 21</span> <span class="preprocessor">#include <boost/static_assert.hpp></span></div>
<div class="line"><a name="l00022"></a><span class="lineno"> 22</span> <span class="preprocessor">#include <boost/serialization/static_warning.hpp></span></div>
<div class="line"><a name="l00023"></a><span class="lineno"> 23</span> <span class="preprocessor">#include <boost/utility/enable_if.hpp></span></div>
<div class="line"><a name="l00024"></a><span class="lineno"> 24</span> <span class="preprocessor">#include <<a class="code" href="constants_8hpp.html">boost/sort/spreadsort/detail/constants.hpp</a>></span></div>
<div class="line"><a name="l00025"></a><span class="lineno"> 25</span> <span class="preprocessor">#include <<a class="code" href="spreadsort__common_8hpp.html">boost/sort/spreadsort/detail/spreadsort_common.hpp</a>></span></div>
<div class="line"><a name="l00026"></a><span class="lineno"> 26</span> <span class="preprocessor">#include <boost/cstdint.hpp></span></div>
<div class="line"><a name="l00027"></a><span class="lineno"> 27</span> <span class="comment"></span></div>
<div class="line"><a name="l00028"></a><span class="lineno"> 28</span> <span class="comment">//! \cond DETAIL</span></div>
<div class="line"><a name="l00029"></a><span class="lineno"> 29</span> <span class="comment"></span></div>
<div class="line"><a name="l00030"></a><span class="lineno"> 30</span> <span class="keyword">namespace </span><a class="code" href="namespaceboost.html">boost</a> {</div>
<div class="line"><a name="l00031"></a><span class="lineno"> 31</span> <span class="keyword">namespace </span>sort {</div>
<div class="line"><a name="l00032"></a><span class="lineno"> 32</span>  <span class="keyword">namespace </span>detail {</div>
<div class="line"><a name="l00033"></a><span class="lineno"> 33</span>  <span class="comment">// Return true if the list is sorted. Otherwise, find the minimum and</span></div>
<div class="line"><a name="l00034"></a><span class="lineno"> 34</span>  <span class="comment">// maximum using <.</span></div>
<div class="line"><a name="l00035"></a><span class="lineno"> 35</span>  <span class="keyword">template</span> <<span class="keyword">class</span> RandomAccessIter></div>
<div class="line"><a name="l00036"></a><span class="lineno"> 36</span>  <span class="keyword">inline</span> <span class="keywordtype">bool</span></div>
<div class="line"><a name="l00037"></a><span class="lineno"> 37</span>  <a class="code" href="namespaceboost_1_1sort_1_1detail.html#a8aaa1645892e6f6845455605b48a5d0e">is_sorted_or_find_extremes</a>(RandomAccessIter current, RandomAccessIter last,</div>
<div class="line"><a name="l00038"></a><span class="lineno"> 38</span>  RandomAccessIter & max, RandomAccessIter & min)</div>
<div class="line"><a name="l00039"></a><span class="lineno"> 39</span>  {</div>
<div class="line"><a name="l00040"></a><span class="lineno"> 40</span>  min = max = current;</div>
<div class="line"><a name="l00041"></a><span class="lineno"> 41</span>  <span class="comment">//This assumes we have more than 1 element based on prior checks.</span></div>
<div class="line"><a name="l00042"></a><span class="lineno"> 42</span>  <span class="keywordflow">while</span> (!(*(current + 1) < *current)) {</div>
<div class="line"><a name="l00043"></a><span class="lineno"> 43</span>  <span class="comment">//If everything is in sorted order, return</span></div>
<div class="line"><a name="l00044"></a><span class="lineno"> 44</span>  <span class="keywordflow">if</span> (++current == last - 1)</div>
<div class="line"><a name="l00045"></a><span class="lineno"> 45</span>  <span class="keywordflow">return</span> <span class="keyword">true</span>;</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> </div>
<div class="line"><a name="l00048"></a><span class="lineno"> 48</span>  <span class="comment">//The maximum is the last sorted element</span></div>
<div class="line"><a name="l00049"></a><span class="lineno"> 49</span>  max = current;</div>
<div class="line"><a name="l00050"></a><span class="lineno"> 50</span>  <span class="comment">//Start from the first unsorted element</span></div>
<div class="line"><a name="l00051"></a><span class="lineno"> 51</span>  <span class="keywordflow">while</span> (++current < last) {</div>
<div class="line"><a name="l00052"></a><span class="lineno"> 52</span>  <span class="keywordflow">if</span> (*max < *current)</div>
<div class="line"><a name="l00053"></a><span class="lineno"> 53</span>  max = current;</div>
<div class="line"><a name="l00054"></a><span class="lineno"> 54</span>  <span class="keywordflow">else</span> <span class="keywordflow">if</span> (*current < *min)</div>
<div class="line"><a name="l00055"></a><span class="lineno"> 55</span>  min = current;</div>
<div class="line"><a name="l00056"></a><span class="lineno"> 56</span>  }</div>
<div class="line"><a name="l00057"></a><span class="lineno"> 57</span>  <span class="keywordflow">return</span> <span class="keyword">false</span>;</div>
<div class="line"><a name="l00058"></a><span class="lineno"> 58</span>  }</div>
<div class="line"><a name="l00059"></a><span class="lineno"> 59</span> </div>
<div class="line"><a name="l00060"></a><span class="lineno"> 60</span>  <span class="comment">// Return true if the list is sorted. Otherwise, find the minimum and</span></div>
<div class="line"><a name="l00061"></a><span class="lineno"> 61</span>  <span class="comment">// maximum.</span></div>
<div class="line"><a name="l00062"></a><span class="lineno"> 62</span>  <span class="comment">// Use a user-defined comparison operator</span></div>
<div class="line"><a name="l00063"></a><span class="lineno"> 63</span>  <span class="keyword">template</span> <<span class="keyword">class</span> RandomAccessIter, <span class="keyword">class</span> Compare></div>
<div class="line"><a name="l00064"></a><span class="lineno"> 64</span>  <span class="keyword">inline</span> <span class="keywordtype">bool</span></div>
<div class="line"><a name="l00065"></a><span class="lineno"> 65</span>  <a class="code" href="namespaceboost_1_1sort_1_1detail.html#a8aaa1645892e6f6845455605b48a5d0e">is_sorted_or_find_extremes</a>(RandomAccessIter current, RandomAccessIter last,</div>
<div class="line"><a name="l00066"></a><span class="lineno"> 66</span>  RandomAccessIter & max, RandomAccessIter & min, Compare comp)</div>
<div class="line"><a name="l00067"></a><span class="lineno"> 67</span>  {</div>
<div class="line"><a name="l00068"></a><span class="lineno"> 68</span>  min = max = current;</div>
<div class="line"><a name="l00069"></a><span class="lineno"> 69</span>  <span class="keywordflow">while</span> (!comp(*(current + 1), *current)) {</div>
<div class="line"><a name="l00070"></a><span class="lineno"> 70</span>  <span class="comment">//If everything is in sorted order, return</span></div>
<div class="line"><a name="l00071"></a><span class="lineno"> 71</span>  <span class="keywordflow">if</span> (++current == last - 1)</div>
<div class="line"><a name="l00072"></a><span class="lineno"> 72</span>  <span class="keywordflow">return</span> <span class="keyword">true</span>;</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> </div>
<div class="line"><a name="l00075"></a><span class="lineno"> 75</span>  <span class="comment">//The maximum is the last sorted element</span></div>
<div class="line"><a name="l00076"></a><span class="lineno"> 76</span>  max = current;</div>
<div class="line"><a name="l00077"></a><span class="lineno"> 77</span>  <span class="keywordflow">while</span> (++current < last) {</div>
<div class="line"><a name="l00078"></a><span class="lineno"> 78</span>  <span class="keywordflow">if</span> (comp(*max, *current))</div>
<div class="line"><a name="l00079"></a><span class="lineno"> 79</span>  max = current;</div>
<div class="line"><a name="l00080"></a><span class="lineno"> 80</span>  <span class="keywordflow">else</span> <span class="keywordflow">if</span> (comp(*current, *min))</div>
<div class="line"><a name="l00081"></a><span class="lineno"> 81</span>  min = current;</div>
<div class="line"><a name="l00082"></a><span class="lineno"> 82</span>  }</div>
<div class="line"><a name="l00083"></a><span class="lineno"> 83</span>  <span class="keywordflow">return</span> <span class="keyword">false</span>;</div>
<div class="line"><a name="l00084"></a><span class="lineno"> 84</span>  }</div>
<div class="line"><a name="l00085"></a><span class="lineno"> 85</span> </div>
<div class="line"><a name="l00086"></a><span class="lineno"> 86</span>  <span class="comment">//Gets a non-negative right bit shift to operate as a logarithmic divisor</span></div>
<div class="line"><a name="l00087"></a><span class="lineno"> 87</span>  <span class="keyword">template</span><<span class="keywordtype">unsigned</span> log_mean_bin_size></div>
<div class="line"><a name="l00088"></a><span class="lineno"> 88</span>  <span class="keyword">inline</span> <span class="keywordtype">int</span></div>
<div class="line"><a name="l00089"></a><span class="lineno"> 89</span>  get_log_divisor(<span class="keywordtype">size_t</span> count, <span class="keywordtype">int</span> log_range)</div>
<div class="line"><a name="l00090"></a><span class="lineno"> 90</span>  {</div>
<div class="line"><a name="l00091"></a><span class="lineno"> 91</span>  <span class="keywordtype">int</span> log_divisor;</div>
<div class="line"><a name="l00092"></a><span class="lineno"> 92</span>  <span class="comment">//If we can finish in one iteration without exceeding either</span></div>
<div class="line"><a name="l00093"></a><span class="lineno"> 93</span>  <span class="comment">//(2 to the max_finishing_splits) or n bins, do so</span></div>
<div class="line"><a name="l00094"></a><span class="lineno"> 94</span>  <span class="keywordflow">if</span> ((log_divisor = log_range - <a class="code" href="namespaceboost_1_1sort_1_1detail.html#a852a51cde62aa67347cb9b4a7350bbac">rough_log_2_size</a>(count)) <= 0 &&</div>
<div class="line"><a name="l00095"></a><span class="lineno"> 95</span>  log_range <= <a class="code" href="namespaceboost_1_1sort_1_1detail.html#a7bbd2027f75936442318063f34953907acfdc43b3d7aa6df69b0f6982918056c7">max_finishing_splits</a>)</div>
<div class="line"><a name="l00096"></a><span class="lineno"> 96</span>  log_divisor = 0;</div>
<div class="line"><a name="l00097"></a><span class="lineno"> 97</span>  <span class="keywordflow">else</span> {</div>
<div class="line"><a name="l00098"></a><span class="lineno"> 98</span>  <span class="comment">//otherwise divide the data into an optimized number of pieces</span></div>
<div class="line"><a name="l00099"></a><span class="lineno"> 99</span>  log_divisor += log_mean_bin_size;</div>
<div class="line"><a name="l00100"></a><span class="lineno"> 100</span>  <span class="comment">//Cannot exceed max_splits or cache misses slow down bin lookups</span></div>
<div class="line"><a name="l00101"></a><span class="lineno"> 101</span>  <span class="keywordflow">if</span> ((log_range - log_divisor) > <a class="code" href="namespaceboost_1_1sort_1_1detail.html#a7bbd2027f75936442318063f34953907a17b216febe1b5e8212a80231592fc9d9">max_splits</a>)</div>
<div class="line"><a name="l00102"></a><span class="lineno"> 102</span>  log_divisor = log_range - <a class="code" href="namespaceboost_1_1sort_1_1detail.html#a7bbd2027f75936442318063f34953907a17b216febe1b5e8212a80231592fc9d9">max_splits</a>;</div>
<div class="line"><a name="l00103"></a><span class="lineno"> 103</span>  }</div>
<div class="line"><a name="l00104"></a><span class="lineno"> 104</span>  <span class="keywordflow">return</span> log_divisor;</div>
<div class="line"><a name="l00105"></a><span class="lineno"> 105</span>  }</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="comment">//Implementation for recursive integer sorting</span></div>
<div class="line"><a name="l00108"></a><span class="lineno"> 108</span>  <span class="keyword">template</span> <<span class="keyword">class</span> RandomAccessIter, <span class="keyword">class</span> Div_type, <span class="keyword">class</span> Size_type></div>
<div class="line"><a name="l00109"></a><span class="lineno"> 109</span>  <span class="keyword">inline</span> <span class="keywordtype">void</span></div>
<div class="line"><a name="l00110"></a><span class="lineno"> 110</span>  spreadsort_rec(RandomAccessIter first, RandomAccessIter last,</div>
<div class="line"><a name="l00111"></a><span class="lineno"> 111</span>  std::vector<RandomAccessIter> &bin_cache, <span class="keywordtype">unsigned</span> cache_offset</div>
<div class="line"><a name="l00112"></a><span class="lineno"> 112</span>  , <span class="keywordtype">size_t</span> *bin_sizes)</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">//This step is roughly 10% of runtime, but it helps avoid worst-case</span></div>
<div class="line"><a name="l00115"></a><span class="lineno"> 115</span>  <span class="comment">//behavior and improve behavior with real data</span></div>
<div class="line"><a name="l00116"></a><span class="lineno"> 116</span>  <span class="comment">//If you know the maximum and minimum ahead of time, you can pass those</span></div>
<div class="line"><a name="l00117"></a><span class="lineno"> 117</span>  <span class="comment">//values in and skip this step for the first iteration</span></div>
<div class="line"><a name="l00118"></a><span class="lineno"> 118</span>  RandomAccessIter max, min;</div>
<div class="line"><a name="l00119"></a><span class="lineno"> 119</span>  <span class="keywordflow">if</span> (<a class="code" href="namespaceboost_1_1sort_1_1detail.html#a8aaa1645892e6f6845455605b48a5d0e">is_sorted_or_find_extremes</a>(first, last, max, min))</div>
<div class="line"><a name="l00120"></a><span class="lineno"> 120</span>  <span class="keywordflow">return</span>;</div>
<div class="line"><a name="l00121"></a><span class="lineno"> 121</span>  RandomAccessIter * target_bin;</div>
<div class="line"><a name="l00122"></a><span class="lineno"> 122</span>  <span class="keywordtype">unsigned</span> log_divisor = get_log_divisor<int_log_mean_bin_size>(</div>
<div class="line"><a name="l00123"></a><span class="lineno"> 123</span>  last - first, <a class="code" href="namespaceboost_1_1sort_1_1detail.html#a852a51cde62aa67347cb9b4a7350bbac">rough_log_2_size</a>(Size_type((*max >> 0) - (*min >> 0))));</div>
<div class="line"><a name="l00124"></a><span class="lineno"> 124</span>  Div_type div_min = *min >> log_divisor;</div>
<div class="line"><a name="l00125"></a><span class="lineno"> 125</span>  Div_type div_max = *max >> log_divisor;</div>
<div class="line"><a name="l00126"></a><span class="lineno"> 126</span>  <span class="keywordtype">unsigned</span> bin_count = unsigned(div_max - div_min) + 1;</div>
<div class="line"><a name="l00127"></a><span class="lineno"> 127</span>  <span class="keywordtype">unsigned</span> cache_end;</div>
<div class="line"><a name="l00128"></a><span class="lineno"> 128</span>  RandomAccessIter * bins =</div>
<div class="line"><a name="l00129"></a><span class="lineno"> 129</span>  <a class="code" href="namespaceboost_1_1sort_1_1detail.html#ad5b7d31fba809eae5d17f5c2fb0a385b">size_bins</a>(bin_sizes, bin_cache, cache_offset, cache_end, bin_count);</div>
<div class="line"><a name="l00130"></a><span class="lineno"> 130</span> </div>
<div class="line"><a name="l00131"></a><span class="lineno"> 131</span>  <span class="comment">//Calculating the size of each bin; this takes roughly 10% of runtime</span></div>
<div class="line"><a name="l00132"></a><span class="lineno"> 132</span>  <span class="keywordflow">for</span> (RandomAccessIter current = first; current != last;)</div>
<div class="line"><a name="l00133"></a><span class="lineno"> 133</span>  bin_sizes[<span class="keywordtype">size_t</span>((*(current++) >> log_divisor) - div_min)]++;</div>
<div class="line"><a name="l00134"></a><span class="lineno"> 134</span>  <span class="comment">//Assign the bin positions</span></div>
<div class="line"><a name="l00135"></a><span class="lineno"> 135</span>  bins[0] = first;</div>
<div class="line"><a name="l00136"></a><span class="lineno"> 136</span>  <span class="keywordflow">for</span> (<span class="keywordtype">unsigned</span> u = 0; u < bin_count - 1; u++)</div>
<div class="line"><a name="l00137"></a><span class="lineno"> 137</span>  bins[u + 1] = bins[u] + bin_sizes[u];</div>
<div class="line"><a name="l00138"></a><span class="lineno"> 138</span> </div>
<div class="line"><a name="l00139"></a><span class="lineno"> 139</span>  RandomAccessIter nextbinstart = first;</div>
<div class="line"><a name="l00140"></a><span class="lineno"> 140</span>  <span class="comment">//Swap into place</span></div>
<div class="line"><a name="l00141"></a><span class="lineno"> 141</span>  <span class="comment">//This dominates runtime, mostly in the swap and bin lookups</span></div>
<div class="line"><a name="l00142"></a><span class="lineno"> 142</span>  <span class="keywordflow">for</span> (<span class="keywordtype">unsigned</span> u = 0; u < bin_count - 1; ++u) {</div>
<div class="line"><a name="l00143"></a><span class="lineno"> 143</span>  RandomAccessIter * local_bin = bins + u;</div>
<div class="line"><a name="l00144"></a><span class="lineno"> 144</span>  nextbinstart += bin_sizes[u];</div>
<div class="line"><a name="l00145"></a><span class="lineno"> 145</span>  <span class="comment">//Iterating over each element in this bin</span></div>
<div class="line"><a name="l00146"></a><span class="lineno"> 146</span>  <span class="keywordflow">for</span> (RandomAccessIter current = *local_bin; current < nextbinstart;</div>
<div class="line"><a name="l00147"></a><span class="lineno"> 147</span>  ++current) {</div>
<div class="line"><a name="l00148"></a><span class="lineno"> 148</span>  <span class="comment">//Swapping elements in current into place until the correct</span></div>
<div class="line"><a name="l00149"></a><span class="lineno"> 149</span>  <span class="comment">//element has been swapped in</span></div>
<div class="line"><a name="l00150"></a><span class="lineno"> 150</span>  <span class="keywordflow">for</span> (target_bin = (bins + ((*current >> log_divisor) - div_min));</div>
<div class="line"><a name="l00151"></a><span class="lineno"> 151</span>  target_bin != local_bin;</div>
<div class="line"><a name="l00152"></a><span class="lineno"> 152</span>  target_bin = bins + ((*current >> log_divisor) - div_min)) {</div>
<div class="line"><a name="l00153"></a><span class="lineno"> 153</span>  <span class="comment">//3-way swap; this is about 1% faster than a 2-way swap</span></div>
<div class="line"><a name="l00154"></a><span class="lineno"> 154</span>  <span class="comment">//The main advantage is less copies are involved per item</span></div>
<div class="line"><a name="l00155"></a><span class="lineno"> 155</span>  <span class="comment">//put in the correct place</span></div>
<div class="line"><a name="l00156"></a><span class="lineno"> 156</span>  <span class="keyword">typename</span> std::iterator_traits<RandomAccessIter>::value_type tmp;</div>
<div class="line"><a name="l00157"></a><span class="lineno"> 157</span>  RandomAccessIter b = (*target_bin)++;</div>
<div class="line"><a name="l00158"></a><span class="lineno"> 158</span>  RandomAccessIter * b_bin = bins + ((*b >> log_divisor) - div_min);</div>
<div class="line"><a name="l00159"></a><span class="lineno"> 159</span>  <span class="keywordflow">if</span> (b_bin != local_bin) {</div>
<div class="line"><a name="l00160"></a><span class="lineno"> 160</span>  RandomAccessIter c = (*b_bin)++;</div>
<div class="line"><a name="l00161"></a><span class="lineno"> 161</span>  tmp = *c;</div>
<div class="line"><a name="l00162"></a><span class="lineno"> 162</span>  *c = *b;</div>
<div class="line"><a name="l00163"></a><span class="lineno"> 163</span>  }</div>
<div class="line"><a name="l00164"></a><span class="lineno"> 164</span>  <span class="keywordflow">else</span></div>
<div class="line"><a name="l00165"></a><span class="lineno"> 165</span>  tmp = *b;</div>
<div class="line"><a name="l00166"></a><span class="lineno"> 166</span>  *b = *current;</div>
<div class="line"><a name="l00167"></a><span class="lineno"> 167</span>  *current = tmp;</div>
<div class="line"><a name="l00168"></a><span class="lineno"> 168</span>  }</div>
<div class="line"><a name="l00169"></a><span class="lineno"> 169</span>  }</div>
<div class="line"><a name="l00170"></a><span class="lineno"> 170</span>  *local_bin = nextbinstart;</div>
<div class="line"><a name="l00171"></a><span class="lineno"> 171</span>  }</div>
<div class="line"><a name="l00172"></a><span class="lineno"> 172</span>  bins[bin_count - 1] = last;</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>  <span class="comment">//If we've bucketsorted, the array is sorted and we should skip recursion</span></div>
<div class="line"><a name="l00175"></a><span class="lineno"> 175</span>  <span class="keywordflow">if</span> (!log_divisor)</div>
<div class="line"><a name="l00176"></a><span class="lineno"> 176</span>  <span class="keywordflow">return</span>;</div>
<div class="line"><a name="l00177"></a><span class="lineno"> 177</span>  <span class="comment">//log_divisor is the remaining range; calculating the comparison threshold</span></div>
<div class="line"><a name="l00178"></a><span class="lineno"> 178</span>  <span class="keywordtype">size_t</span> max_count =</div>
<div class="line"><a name="l00179"></a><span class="lineno"> 179</span>  <a class="code" href="namespaceboost_1_1sort_1_1detail.html#a4ba5c57512d16f300c08b7a6b4e6ff23">get_min_count</a><<a class="code" href="namespaceboost_1_1sort_1_1detail.html#a7bbd2027f75936442318063f34953907a2e171c91f6c9e1d82643e4b35a4c65de">int_log_mean_bin_size</a>, <a class="code" href="namespaceboost_1_1sort_1_1detail.html#a7bbd2027f75936442318063f34953907a53383c14d73d50ed8faaa695d820a5bf">int_log_min_split_count</a>,</div>
<div class="line"><a name="l00180"></a><span class="lineno"> 180</span>  <a class="code" href="namespaceboost_1_1sort_1_1detail.html#a7bbd2027f75936442318063f34953907ae0c3ec0c116b92c92015245fd5024a27">int_log_finishing_count</a>>(log_divisor);</div>
<div class="line"><a name="l00181"></a><span class="lineno"> 181</span> </div>
<div class="line"><a name="l00182"></a><span class="lineno"> 182</span>  <span class="comment">//Recursing</span></div>
<div class="line"><a name="l00183"></a><span class="lineno"> 183</span>  RandomAccessIter lastPos = first;</div>
<div class="line"><a name="l00184"></a><span class="lineno"> 184</span>  <span class="keywordflow">for</span> (<span class="keywordtype">unsigned</span> u = cache_offset; u < cache_end; lastPos = bin_cache[u],</div>
<div class="line"><a name="l00185"></a><span class="lineno"> 185</span>  ++u) {</div>
<div class="line"><a name="l00186"></a><span class="lineno"> 186</span>  Size_type count = bin_cache[u] - lastPos;</div>
<div class="line"><a name="l00187"></a><span class="lineno"> 187</span>  <span class="comment">//don't sort unless there are at least two items to Compare</span></div>
<div class="line"><a name="l00188"></a><span class="lineno"> 188</span>  <span class="keywordflow">if</span> (count < 2)</div>
<div class="line"><a name="l00189"></a><span class="lineno"> 189</span>  <span class="keywordflow">continue</span>;</div>
<div class="line"><a name="l00190"></a><span class="lineno"> 190</span>  <span class="comment">//using std::sort if its worst-case is better</span></div>
<div class="line"><a name="l00191"></a><span class="lineno"> 191</span>  <span class="keywordflow">if</span> (count < max_count)</div>
<div class="line"><a name="l00192"></a><span class="lineno"> 192</span>  std::sort(lastPos, bin_cache[u]);</div>
<div class="line"><a name="l00193"></a><span class="lineno"> 193</span>  <span class="keywordflow">else</span></div>
<div class="line"><a name="l00194"></a><span class="lineno"> 194</span>  spreadsort_rec<RandomAccessIter, Div_type, Size_type>(lastPos,</div>
<div class="line"><a name="l00195"></a><span class="lineno"> 195</span>  bin_cache[u],</div>
<div class="line"><a name="l00196"></a><span class="lineno"> 196</span>  bin_cache,</div>
<div class="line"><a name="l00197"></a><span class="lineno"> 197</span>  cache_end,</div>
<div class="line"><a name="l00198"></a><span class="lineno"> 198</span>  bin_sizes);</div>
<div class="line"><a name="l00199"></a><span class="lineno"> 199</span>  }</div>
<div class="line"><a name="l00200"></a><span class="lineno"> 200</span>  }</div>
<div class="line"><a name="l00201"></a><span class="lineno"> 201</span> </div>
<div class="line"><a name="l00202"></a><span class="lineno"> 202</span>  <span class="comment">//Generic bitshift-based 3-way swapping code</span></div>
<div class="line"><a name="l00203"></a><span class="lineno"> 203</span>  <span class="keyword">template</span> <<span class="keyword">class</span> RandomAccessIter, <span class="keyword">class</span> Div_type, <span class="keyword">class</span> Right_shift></div>
<div class="line"><a name="l00204"></a><span class="lineno"> 204</span>  <span class="keyword">inline</span> <span class="keywordtype">void</span> inner_swap_loop(RandomAccessIter * bins,</div>
<div class="line"><a name="l00205"></a><span class="lineno"> 205</span>  <span class="keyword">const</span> RandomAccessIter & next_bin_start, <span class="keywordtype">unsigned</span> ii, Right_shift &rshift</div>
<div class="line"><a name="l00206"></a><span class="lineno"> 206</span>  , <span class="keyword">const</span> <span class="keywordtype">unsigned</span> log_divisor, <span class="keyword">const</span> Div_type div_min)</div>
<div class="line"><a name="l00207"></a><span class="lineno"> 207</span>  {</div>
<div class="line"><a name="l00208"></a><span class="lineno"> 208</span>  RandomAccessIter * local_bin = bins + ii;</div>
<div class="line"><a name="l00209"></a><span class="lineno"> 209</span>  <span class="keywordflow">for</span> (RandomAccessIter current = *local_bin; current < next_bin_start;</div>
<div class="line"><a name="l00210"></a><span class="lineno"> 210</span>  ++current) {</div>
<div class="line"><a name="l00211"></a><span class="lineno"> 211</span>  <span class="keywordflow">for</span> (RandomAccessIter * target_bin =</div>
<div class="line"><a name="l00212"></a><span class="lineno"> 212</span>  (bins + (rshift(*current, log_divisor) - div_min));</div>
<div class="line"><a name="l00213"></a><span class="lineno"> 213</span>  target_bin != local_bin;</div>
<div class="line"><a name="l00214"></a><span class="lineno"> 214</span>  target_bin = bins + (rshift(*current, log_divisor) - div_min)) {</div>
<div class="line"><a name="l00215"></a><span class="lineno"> 215</span>  <span class="keyword">typename</span> std::iterator_traits<RandomAccessIter>::value_type tmp;</div>
<div class="line"><a name="l00216"></a><span class="lineno"> 216</span>  RandomAccessIter b = (*target_bin)++;</div>
<div class="line"><a name="l00217"></a><span class="lineno"> 217</span>  RandomAccessIter * b_bin =</div>
<div class="line"><a name="l00218"></a><span class="lineno"> 218</span>  bins + (rshift(*b, log_divisor) - div_min);</div>
<div class="line"><a name="l00219"></a><span class="lineno"> 219</span>  <span class="comment">//Three-way swap; if the item to be swapped doesn't belong</span></div>
<div class="line"><a name="l00220"></a><span class="lineno"> 220</span>  <span class="comment">//in the current bin, swap it to where it belongs</span></div>
<div class="line"><a name="l00221"></a><span class="lineno"> 221</span>  <span class="keywordflow">if</span> (b_bin != local_bin) {</div>
<div class="line"><a name="l00222"></a><span class="lineno"> 222</span>  RandomAccessIter c = (*b_bin)++;</div>
<div class="line"><a name="l00223"></a><span class="lineno"> 223</span>  tmp = *c;</div>
<div class="line"><a name="l00224"></a><span class="lineno"> 224</span>  *c = *b;</div>
<div class="line"><a name="l00225"></a><span class="lineno"> 225</span>  }</div>
<div class="line"><a name="l00226"></a><span class="lineno"> 226</span>  <span class="comment">//Note: we could increment current once the swap is done in this case</span></div>
<div class="line"><a name="l00227"></a><span class="lineno"> 227</span>  <span class="comment">//but that seems to impair performance</span></div>
<div class="line"><a name="l00228"></a><span class="lineno"> 228</span>  <span class="keywordflow">else</span></div>
<div class="line"><a name="l00229"></a><span class="lineno"> 229</span>  tmp = *b;</div>
<div class="line"><a name="l00230"></a><span class="lineno"> 230</span>  *b = *current;</div>
<div class="line"><a name="l00231"></a><span class="lineno"> 231</span>  *current = tmp;</div>
<div class="line"><a name="l00232"></a><span class="lineno"> 232</span>  }</div>
<div class="line"><a name="l00233"></a><span class="lineno"> 233</span>  }</div>
<div class="line"><a name="l00234"></a><span class="lineno"> 234</span>  *local_bin = next_bin_start;</div>
<div class="line"><a name="l00235"></a><span class="lineno"> 235</span>  }</div>
<div class="line"><a name="l00236"></a><span class="lineno"> 236</span> </div>
<div class="line"><a name="l00237"></a><span class="lineno"> 237</span>  <span class="comment">//Standard swapping wrapper for ascending values</span></div>
<div class="line"><a name="l00238"></a><span class="lineno"> 238</span>  <span class="keyword">template</span> <<span class="keyword">class</span> RandomAccessIter, <span class="keyword">class</span> Div_type, <span class="keyword">class</span> Right_shift></div>
<div class="line"><a name="l00239"></a><span class="lineno"> 239</span>  <span class="keyword">inline</span> <span class="keywordtype">void</span> swap_loop(RandomAccessIter * bins,</div>
<div class="line"><a name="l00240"></a><span class="lineno"> 240</span>  RandomAccessIter & next_bin_start, <span class="keywordtype">unsigned</span> ii, Right_shift &rshift</div>
<div class="line"><a name="l00241"></a><span class="lineno"> 241</span>  , <span class="keyword">const</span> <span class="keywordtype">size_t</span> *bin_sizes</div>
<div class="line"><a name="l00242"></a><span class="lineno"> 242</span>  , <span class="keyword">const</span> <span class="keywordtype">unsigned</span> log_divisor, <span class="keyword">const</span> Div_type div_min)</div>
<div class="line"><a name="l00243"></a><span class="lineno"> 243</span>  {</div>
<div class="line"><a name="l00244"></a><span class="lineno"> 244</span>  next_bin_start += bin_sizes[ii];</div>
<div class="line"><a name="l00245"></a><span class="lineno"> 245</span>  inner_swap_loop<RandomAccessIter, Div_type, Right_shift>(bins,</div>
<div class="line"><a name="l00246"></a><span class="lineno"> 246</span>  next_bin_start, ii, rshift, log_divisor, div_min);</div>
<div class="line"><a name="l00247"></a><span class="lineno"> 247</span>  }</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="comment">//Functor implementation for recursive sorting</span></div>
<div class="line"><a name="l00250"></a><span class="lineno"> 250</span>  <span class="keyword">template</span> <<span class="keyword">class </span>RandomAccessIter, <span class="keyword">class </span>Div_type, <span class="keyword">class </span>Right_shift,</div>
<div class="line"><a name="l00251"></a><span class="lineno"> 251</span>  <span class="keyword">class </span>Compare, <span class="keyword">class </span>Size_type, <span class="keywordtype">unsigned</span> log_mean_bin_size,</div>
<div class="line"><a name="l00252"></a><span class="lineno"> 252</span>  <span class="keywordtype">unsigned</span> log_min_split_count, <span class="keywordtype">unsigned</span> log_finishing_count></div>
<div class="line"><a name="l00253"></a><span class="lineno"> 253</span>  <span class="keyword">inline</span> <span class="keywordtype">void</span></div>
<div class="line"><a name="l00254"></a><span class="lineno"> 254</span>  spreadsort_rec(RandomAccessIter first, RandomAccessIter last,</div>
<div class="line"><a name="l00255"></a><span class="lineno"> 255</span>  std::vector<RandomAccessIter> &bin_cache, <span class="keywordtype">unsigned</span> cache_offset</div>
<div class="line"><a name="l00256"></a><span class="lineno"> 256</span>  , <span class="keywordtype">size_t</span> *bin_sizes, Right_shift rshift, Compare comp)</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>  RandomAccessIter max, min;</div>
<div class="line"><a name="l00259"></a><span class="lineno"> 259</span>  <span class="keywordflow">if</span> (<a class="code" href="namespaceboost_1_1sort_1_1detail.html#a8aaa1645892e6f6845455605b48a5d0e">is_sorted_or_find_extremes</a>(first, last, max, min, comp))</div>
<div class="line"><a name="l00260"></a><span class="lineno"> 260</span>  <span class="keywordflow">return</span>;</div>
<div class="line"><a name="l00261"></a><span class="lineno"> 261</span>  <span class="keywordtype">unsigned</span> log_divisor = get_log_divisor<log_mean_bin_size>(last - first,</div>
<div class="line"><a name="l00262"></a><span class="lineno"> 262</span>  <a class="code" href="namespaceboost_1_1sort_1_1detail.html#a852a51cde62aa67347cb9b4a7350bbac">rough_log_2_size</a>(Size_type(rshift(*max, 0) - rshift(*min, 0))));</div>
<div class="line"><a name="l00263"></a><span class="lineno"> 263</span>  Div_type div_min = rshift(*min, log_divisor);</div>
<div class="line"><a name="l00264"></a><span class="lineno"> 264</span>  Div_type div_max = rshift(*max, log_divisor);</div>
<div class="line"><a name="l00265"></a><span class="lineno"> 265</span>  <span class="keywordtype">unsigned</span> bin_count = unsigned(div_max - div_min) + 1;</div>
<div class="line"><a name="l00266"></a><span class="lineno"> 266</span>  <span class="keywordtype">unsigned</span> cache_end;</div>
<div class="line"><a name="l00267"></a><span class="lineno"> 267</span>  RandomAccessIter * bins = <a class="code" href="namespaceboost_1_1sort_1_1detail.html#ad5b7d31fba809eae5d17f5c2fb0a385b">size_bins</a>(bin_sizes, bin_cache, cache_offset,</div>
<div class="line"><a name="l00268"></a><span class="lineno"> 268</span>  cache_end, bin_count);</div>
<div class="line"><a name="l00269"></a><span class="lineno"> 269</span> </div>
<div class="line"><a name="l00270"></a><span class="lineno"> 270</span>  <span class="comment">//Calculating the size of each bin</span></div>
<div class="line"><a name="l00271"></a><span class="lineno"> 271</span>  <span class="keywordflow">for</span> (RandomAccessIter current = first; current != last;)</div>
<div class="line"><a name="l00272"></a><span class="lineno"> 272</span>  bin_sizes[<span class="keywordtype">unsigned</span>(rshift(*(current++), log_divisor) - div_min)]++;</div>
<div class="line"><a name="l00273"></a><span class="lineno"> 273</span>  bins[0] = first;</div>
<div class="line"><a name="l00274"></a><span class="lineno"> 274</span>  <span class="keywordflow">for</span> (<span class="keywordtype">unsigned</span> u = 0; u < bin_count - 1; u++)</div>
<div class="line"><a name="l00275"></a><span class="lineno"> 275</span>  bins[u + 1] = bins[u] + bin_sizes[u];</div>
<div class="line"><a name="l00276"></a><span class="lineno"> 276</span> </div>
<div class="line"><a name="l00277"></a><span class="lineno"> 277</span>  <span class="comment">//Swap into place</span></div>
<div class="line"><a name="l00278"></a><span class="lineno"> 278</span>  RandomAccessIter next_bin_start = first;</div>
<div class="line"><a name="l00279"></a><span class="lineno"> 279</span>  <span class="keywordflow">for</span> (<span class="keywordtype">unsigned</span> u = 0; u < bin_count - 1; ++u)</div>
<div class="line"><a name="l00280"></a><span class="lineno"> 280</span>  swap_loop<RandomAccessIter, Div_type, Right_shift>(bins, next_bin_start,</div>
<div class="line"><a name="l00281"></a><span class="lineno"> 281</span>  u, rshift, bin_sizes, log_divisor, div_min);</div>
<div class="line"><a name="l00282"></a><span class="lineno"> 282</span>  bins[bin_count - 1] = last;</div>
<div class="line"><a name="l00283"></a><span class="lineno"> 283</span> </div>
<div class="line"><a name="l00284"></a><span class="lineno"> 284</span>  <span class="comment">//If we've bucketsorted, the array is sorted</span></div>
<div class="line"><a name="l00285"></a><span class="lineno"> 285</span>  <span class="keywordflow">if</span> (!log_divisor)</div>
<div class="line"><a name="l00286"></a><span class="lineno"> 286</span>  <span class="keywordflow">return</span>;</div>
<div class="line"><a name="l00287"></a><span class="lineno"> 287</span> </div>
<div class="line"><a name="l00288"></a><span class="lineno"> 288</span>  <span class="comment">//Recursing</span></div>
<div class="line"><a name="l00289"></a><span class="lineno"> 289</span>  <span class="keywordtype">size_t</span> max_count = <a class="code" href="namespaceboost_1_1sort_1_1detail.html#a4ba5c57512d16f300c08b7a6b4e6ff23">get_min_count</a><log_mean_bin_size, log_min_split_count,</div>
<div class="line"><a name="l00290"></a><span class="lineno"> 290</span>  log_finishing_count>(log_divisor);</div>
<div class="line"><a name="l00291"></a><span class="lineno"> 291</span>  RandomAccessIter lastPos = first;</div>
<div class="line"><a name="l00292"></a><span class="lineno"> 292</span>  <span class="keywordflow">for</span> (<span class="keywordtype">unsigned</span> u = cache_offset; u < cache_end; lastPos = bin_cache[u],</div>
<div class="line"><a name="l00293"></a><span class="lineno"> 293</span>  ++u) {</div>
<div class="line"><a name="l00294"></a><span class="lineno"> 294</span>  <span class="keywordtype">size_t</span> count = bin_cache[u] - lastPos;</div>
<div class="line"><a name="l00295"></a><span class="lineno"> 295</span>  <span class="keywordflow">if</span> (count < 2)</div>
<div class="line"><a name="l00296"></a><span class="lineno"> 296</span>  <span class="keywordflow">continue</span>;</div>
<div class="line"><a name="l00297"></a><span class="lineno"> 297</span>  <span class="keywordflow">if</span> (count < max_count)</div>
<div class="line"><a name="l00298"></a><span class="lineno"> 298</span>  std::sort(lastPos, bin_cache[u], comp);</div>
<div class="line"><a name="l00299"></a><span class="lineno"> 299</span>  <span class="keywordflow">else</span></div>
<div class="line"><a name="l00300"></a><span class="lineno"> 300</span>  spreadsort_rec<RandomAccessIter, Div_type, Right_shift, Compare,</div>
<div class="line"><a name="l00301"></a><span class="lineno"> 301</span>  Size_type, log_mean_bin_size, log_min_split_count, log_finishing_count></div>
<div class="line"><a name="l00302"></a><span class="lineno"> 302</span>  (lastPos, bin_cache[u], bin_cache, cache_end, bin_sizes, rshift, comp);</div>
<div class="line"><a name="l00303"></a><span class="lineno"> 303</span>  }</div>
<div class="line"><a name="l00304"></a><span class="lineno"> 304</span>  }</div>
<div class="line"><a name="l00305"></a><span class="lineno"> 305</span> </div>
<div class="line"><a name="l00306"></a><span class="lineno"> 306</span>  <span class="comment">//Functor implementation for recursive sorting with only Shift overridden</span></div>
<div class="line"><a name="l00307"></a><span class="lineno"> 307</span>  <span class="keyword">template</span> <<span class="keyword">class </span>RandomAccessIter, <span class="keyword">class </span>Div_type, <span class="keyword">class </span>Right_shift,</div>
<div class="line"><a name="l00308"></a><span class="lineno"> 308</span>  <span class="keyword">class </span>Size_type, <span class="keywordtype">unsigned</span> log_mean_bin_size,</div>
<div class="line"><a name="l00309"></a><span class="lineno"> 309</span>  <span class="keywordtype">unsigned</span> log_min_split_count, <span class="keywordtype">unsigned</span> log_finishing_count></div>
<div class="line"><a name="l00310"></a><span class="lineno"> 310</span>  <span class="keyword">inline</span> <span class="keywordtype">void</span></div>
<div class="line"><a name="l00311"></a><span class="lineno"> 311</span>  spreadsort_rec(RandomAccessIter first, RandomAccessIter last,</div>
<div class="line"><a name="l00312"></a><span class="lineno"> 312</span>  std::vector<RandomAccessIter> &bin_cache, <span class="keywordtype">unsigned</span> cache_offset</div>
<div class="line"><a name="l00313"></a><span class="lineno"> 313</span>  , <span class="keywordtype">size_t</span> *bin_sizes, Right_shift rshift)</div>
<div class="line"><a name="l00314"></a><span class="lineno"> 314</span>  {</div>
<div class="line"><a name="l00315"></a><span class="lineno"> 315</span>  RandomAccessIter max, min;</div>
<div class="line"><a name="l00316"></a><span class="lineno"> 316</span>  <span class="keywordflow">if</span> (<a class="code" href="namespaceboost_1_1sort_1_1detail.html#a8aaa1645892e6f6845455605b48a5d0e">is_sorted_or_find_extremes</a>(first, last, max, min))</div>
<div class="line"><a name="l00317"></a><span class="lineno"> 317</span>  <span class="keywordflow">return</span>;</div>
<div class="line"><a name="l00318"></a><span class="lineno"> 318</span>  <span class="keywordtype">unsigned</span> log_divisor = get_log_divisor<log_mean_bin_size>(last - first,</div>
<div class="line"><a name="l00319"></a><span class="lineno"> 319</span>  <a class="code" href="namespaceboost_1_1sort_1_1detail.html#a852a51cde62aa67347cb9b4a7350bbac">rough_log_2_size</a>(Size_type(rshift(*max, 0) - rshift(*min, 0))));</div>
<div class="line"><a name="l00320"></a><span class="lineno"> 320</span>  Div_type div_min = rshift(*min, log_divisor);</div>
<div class="line"><a name="l00321"></a><span class="lineno"> 321</span>  Div_type div_max = rshift(*max, log_divisor);</div>
<div class="line"><a name="l00322"></a><span class="lineno"> 322</span>  <span class="keywordtype">unsigned</span> bin_count = unsigned(div_max - div_min) + 1;</div>
<div class="line"><a name="l00323"></a><span class="lineno"> 323</span>  <span class="keywordtype">unsigned</span> cache_end;</div>
<div class="line"><a name="l00324"></a><span class="lineno"> 324</span>  RandomAccessIter * bins = <a class="code" href="namespaceboost_1_1sort_1_1detail.html#ad5b7d31fba809eae5d17f5c2fb0a385b">size_bins</a>(bin_sizes, bin_cache, cache_offset,</div>
<div class="line"><a name="l00325"></a><span class="lineno"> 325</span>  cache_end, bin_count);</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>  <span class="comment">//Calculating the size of each bin</span></div>
<div class="line"><a name="l00328"></a><span class="lineno"> 328</span>  <span class="keywordflow">for</span> (RandomAccessIter current = first; current != last;)</div>
<div class="line"><a name="l00329"></a><span class="lineno"> 329</span>  bin_sizes[<span class="keywordtype">unsigned</span>(rshift(*(current++), log_divisor) - div_min)]++;</div>
<div class="line"><a name="l00330"></a><span class="lineno"> 330</span>  bins[0] = first;</div>
<div class="line"><a name="l00331"></a><span class="lineno"> 331</span>  <span class="keywordflow">for</span> (<span class="keywordtype">unsigned</span> u = 0; u < bin_count - 1; u++)</div>
<div class="line"><a name="l00332"></a><span class="lineno"> 332</span>  bins[u + 1] = bins[u] + bin_sizes[u];</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>  <span class="comment">//Swap into place</span></div>
<div class="line"><a name="l00335"></a><span class="lineno"> 335</span>  RandomAccessIter nextbinstart = first;</div>
<div class="line"><a name="l00336"></a><span class="lineno"> 336</span>  <span class="keywordflow">for</span> (<span class="keywordtype">unsigned</span> ii = 0; ii < bin_count - 1; ++ii)</div>
<div class="line"><a name="l00337"></a><span class="lineno"> 337</span>  swap_loop<RandomAccessIter, Div_type, Right_shift>(bins, nextbinstart,</div>
<div class="line"><a name="l00338"></a><span class="lineno"> 338</span>  ii, rshift, bin_sizes, log_divisor, div_min);</div>
<div class="line"><a name="l00339"></a><span class="lineno"> 339</span>  bins[bin_count - 1] = last;</div>
<div class="line"><a name="l00340"></a><span class="lineno"> 340</span> </div>
<div class="line"><a name="l00341"></a><span class="lineno"> 341</span>  <span class="comment">//If we've bucketsorted, the array is sorted</span></div>
<div class="line"><a name="l00342"></a><span class="lineno"> 342</span>  <span class="keywordflow">if</span> (!log_divisor)</div>
<div class="line"><a name="l00343"></a><span class="lineno"> 343</span>  <span class="keywordflow">return</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>  <span class="comment">//Recursing</span></div>
<div class="line"><a name="l00346"></a><span class="lineno"> 346</span>  <span class="keywordtype">size_t</span> max_count = <a class="code" href="namespaceboost_1_1sort_1_1detail.html#a4ba5c57512d16f300c08b7a6b4e6ff23">get_min_count</a><log_mean_bin_size, log_min_split_count,</div>
<div class="line"><a name="l00347"></a><span class="lineno"> 347</span>  log_finishing_count>(log_divisor);</div>
<div class="line"><a name="l00348"></a><span class="lineno"> 348</span>  RandomAccessIter lastPos = first;</div>
<div class="line"><a name="l00349"></a><span class="lineno"> 349</span>  <span class="keywordflow">for</span> (<span class="keywordtype">unsigned</span> u = cache_offset; u < cache_end; lastPos = bin_cache[u],</div>
<div class="line"><a name="l00350"></a><span class="lineno"> 350</span>  ++u) {</div>
<div class="line"><a name="l00351"></a><span class="lineno"> 351</span>  <span class="keywordtype">size_t</span> count = bin_cache[u] - lastPos;</div>
<div class="line"><a name="l00352"></a><span class="lineno"> 352</span>  <span class="keywordflow">if</span> (count < 2)</div>
<div class="line"><a name="l00353"></a><span class="lineno"> 353</span>  <span class="keywordflow">continue</span>;</div>
<div class="line"><a name="l00354"></a><span class="lineno"> 354</span>  <span class="keywordflow">if</span> (count < max_count)</div>
<div class="line"><a name="l00355"></a><span class="lineno"> 355</span>  std::sort(lastPos, bin_cache[u]);</div>
<div class="line"><a name="l00356"></a><span class="lineno"> 356</span>  <span class="keywordflow">else</span></div>
<div class="line"><a name="l00357"></a><span class="lineno"> 357</span>  spreadsort_rec<RandomAccessIter, Div_type, Right_shift, Size_type,</div>
<div class="line"><a name="l00358"></a><span class="lineno"> 358</span>  log_mean_bin_size, log_min_split_count, log_finishing_count>(lastPos,</div>
<div class="line"><a name="l00359"></a><span class="lineno"> 359</span>  bin_cache[u], bin_cache, cache_end, bin_sizes, rshift);</div>
<div class="line"><a name="l00360"></a><span class="lineno"> 360</span>  }</div>
<div class="line"><a name="l00361"></a><span class="lineno"> 361</span>  }</div>
<div class="line"><a name="l00362"></a><span class="lineno"> 362</span> </div>
<div class="line"><a name="l00363"></a><span class="lineno"> 363</span>  <span class="comment">//Holds the bin vector and makes the initial recursive call</span></div>
<div class="line"><a name="l00364"></a><span class="lineno"> 364</span>  <span class="keyword">template</span> <<span class="keyword">class</span> RandomAccessIter, <span class="keyword">class</span> Div_type></div>
<div class="line"><a name="l00365"></a><span class="lineno"> 365</span>  <span class="comment">//Only use spreadsort if the integer can fit in a size_t</span></div>
<div class="line"><a name="l00366"></a><span class="lineno"> 366</span>  <span class="keyword">inline</span> <span class="keyword">typename</span> boost::enable_if_c< <span class="keyword">sizeof</span>(Div_type) <= <span class="keyword">sizeof</span>(<span class="keywordtype">size_t</span>),</div>
<div class="line"><a name="l00367"></a><span class="lineno"> 367</span>  <span class="keywordtype">void</span> >::type</div>
<div class="line"><a name="l00368"></a><span class="lineno"> 368</span>  <a class="code" href="namespaceboost_1_1sort.html#ae6ffbcf932699589fd2b93879f209013">integer_sort</a>(RandomAccessIter first, RandomAccessIter last, Div_type)</div>
<div class="line"><a name="l00369"></a><span class="lineno"> 369</span>  {</div>
<div class="line"><a name="l00370"></a><span class="lineno"> 370</span>  <span class="keywordtype">size_t</span> bin_sizes[1 << <a class="code" href="namespaceboost_1_1sort_1_1detail.html#a7bbd2027f75936442318063f34953907acfdc43b3d7aa6df69b0f6982918056c7">max_finishing_splits</a>];</div>
<div class="line"><a name="l00371"></a><span class="lineno"> 371</span>  std::vector<RandomAccessIter> bin_cache;</div>
<div class="line"><a name="l00372"></a><span class="lineno"> 372</span>  spreadsort_rec<RandomAccessIter, Div_type, size_t>(first, last,</div>
<div class="line"><a name="l00373"></a><span class="lineno"> 373</span>  bin_cache, 0, bin_sizes);</div>
<div class="line"><a name="l00374"></a><span class="lineno"> 374</span>  }</div>
<div class="line"><a name="l00375"></a><span class="lineno"> 375</span> </div>
<div class="line"><a name="l00376"></a><span class="lineno"> 376</span>  <span class="comment">//Holds the bin vector and makes the initial recursive call</span></div>
<div class="line"><a name="l00377"></a><span class="lineno"> 377</span>  <span class="keyword">template</span> <<span class="keyword">class</span> RandomAccessIter, <span class="keyword">class</span> Div_type></div>
<div class="line"><a name="l00378"></a><span class="lineno"> 378</span>  <span class="comment">//Only use spreadsort if the integer can fit in a uintmax_t</span></div>
<div class="line"><a name="l00379"></a><span class="lineno"> 379</span>  <span class="keyword">inline</span> <span class="keyword">typename</span> boost::enable_if_c< (sizeof(Div_type) > <span class="keyword">sizeof</span>(size_t))</div>
<div class="line"><a name="l00380"></a><span class="lineno"> 380</span>  && <span class="keyword">sizeof</span>(Div_type) <= <span class="keyword">sizeof</span>(boost::uintmax_t), <span class="keywordtype">void</span> >::type</div>
<div class="line"><a name="l00381"></a><span class="lineno"> 381</span>  <a class="code" href="namespaceboost_1_1sort.html#ae6ffbcf932699589fd2b93879f209013">integer_sort</a>(RandomAccessIter first, RandomAccessIter last, Div_type)</div>
<div class="line"><a name="l00382"></a><span class="lineno"> 382</span>  {</div>
<div class="line"><a name="l00383"></a><span class="lineno"> 383</span>  <span class="keywordtype">size_t</span> bin_sizes[1 << <a class="code" href="namespaceboost_1_1sort_1_1detail.html#a7bbd2027f75936442318063f34953907acfdc43b3d7aa6df69b0f6982918056c7">max_finishing_splits</a>];</div>
<div class="line"><a name="l00384"></a><span class="lineno"> 384</span>  std::vector<RandomAccessIter> bin_cache;</div>
<div class="line"><a name="l00385"></a><span class="lineno"> 385</span>  spreadsort_rec<RandomAccessIter, Div_type, boost::uintmax_t>(first,</div>
<div class="line"><a name="l00386"></a><span class="lineno"> 386</span>  last, bin_cache, 0, bin_sizes);</div>
<div class="line"><a name="l00387"></a><span class="lineno"> 387</span>  }</div>
<div class="line"><a name="l00388"></a><span class="lineno"> 388</span> </div>
<div class="line"><a name="l00389"></a><span class="lineno"> 389</span>  <span class="keyword">template</span> <<span class="keyword">class</span> RandomAccessIter, <span class="keyword">class</span> Div_type></div>
<div class="line"><a name="l00390"></a><span class="lineno"> 390</span>  <span class="keyword">inline</span> <span class="keyword">typename</span> boost::disable_if_c< <span class="keyword">sizeof</span>(Div_type) <= <span class="keyword">sizeof</span>(<span class="keywordtype">size_t</span>)</div>
<div class="line"><a name="l00391"></a><span class="lineno"> 391</span>  || <span class="keyword">sizeof</span>(Div_type) <= <span class="keyword">sizeof</span>(boost::uintmax_t), <span class="keywordtype">void</span> >::type</div>
<div class="line"><a name="l00392"></a><span class="lineno"> 392</span>  <span class="comment">//defaulting to std::sort when integer_sort won't work</span></div>
<div class="line"><a name="l00393"></a><span class="lineno"> 393</span>  <a class="code" href="namespaceboost_1_1sort.html#ae6ffbcf932699589fd2b93879f209013">integer_sort</a>(RandomAccessIter first, RandomAccessIter last, Div_type)</div>
<div class="line"><a name="l00394"></a><span class="lineno"> 394</span>  {</div>
<div class="line"><a name="l00395"></a><span class="lineno"> 395</span>  <span class="comment">//Warning that we're using std::sort, even though integer_sort was called</span></div>
<div class="line"><a name="l00396"></a><span class="lineno"> 396</span>  BOOST_STATIC_WARNING( <span class="keyword">sizeof</span>(Div_type) <= <span class="keyword">sizeof</span>(<span class="keywordtype">size_t</span>) );</div>
<div class="line"><a name="l00397"></a><span class="lineno"> 397</span>  std::sort(first, last);</div>
<div class="line"><a name="l00398"></a><span class="lineno"> 398</span>  }</div>
<div class="line"><a name="l00399"></a><span class="lineno"> 399</span> </div>
<div class="line"><a name="l00400"></a><span class="lineno"> 400</span> </div>
<div class="line"><a name="l00401"></a><span class="lineno"> 401</span>  <span class="comment">//Same for the full functor version</span></div>
<div class="line"><a name="l00402"></a><span class="lineno"> 402</span>  <span class="keyword">template</span> <<span class="keyword">class </span>RandomAccessIter, <span class="keyword">class </span>Div_type, <span class="keyword">class </span>Right_shift,</div>
<div class="line"><a name="l00403"></a><span class="lineno"> 403</span>  <span class="keyword">class </span>Compare></div>
<div class="line"><a name="l00404"></a><span class="lineno"> 404</span>  <span class="comment">//Only use spreadsort if the integer can fit in a size_t</span></div>
<div class="line"><a name="l00405"></a><span class="lineno"> 405</span>  <span class="keyword">inline</span> <span class="keyword">typename</span> boost::enable_if_c< <span class="keyword">sizeof</span>(Div_type) <= <span class="keyword">sizeof</span>(<span class="keywordtype">size_t</span>),</div>
<div class="line"><a name="l00406"></a><span class="lineno"> 406</span>  <span class="keywordtype">void</span> >::type</div>
<div class="line"><a name="l00407"></a><span class="lineno"> 407</span>  <a class="code" href="namespaceboost_1_1sort.html#ae6ffbcf932699589fd2b93879f209013">integer_sort</a>(RandomAccessIter first, RandomAccessIter last, Div_type,</div>
<div class="line"><a name="l00408"></a><span class="lineno"> 408</span>  Right_shift shift, Compare comp)</div>
<div class="line"><a name="l00409"></a><span class="lineno"> 409</span>  {</div>
<div class="line"><a name="l00410"></a><span class="lineno"> 410</span>  <span class="keywordtype">size_t</span> bin_sizes[1 << <a class="code" href="namespaceboost_1_1sort_1_1detail.html#a7bbd2027f75936442318063f34953907acfdc43b3d7aa6df69b0f6982918056c7">max_finishing_splits</a>];</div>
<div class="line"><a name="l00411"></a><span class="lineno"> 411</span>  std::vector<RandomAccessIter> bin_cache;</div>
<div class="line"><a name="l00412"></a><span class="lineno"> 412</span>  spreadsort_rec<RandomAccessIter, Div_type, Right_shift, Compare,</div>
<div class="line"><a name="l00413"></a><span class="lineno"> 413</span>  size_t, <a class="code" href="namespaceboost_1_1sort_1_1detail.html#a7bbd2027f75936442318063f34953907a2e171c91f6c9e1d82643e4b35a4c65de">int_log_mean_bin_size</a>, <a class="code" href="namespaceboost_1_1sort_1_1detail.html#a7bbd2027f75936442318063f34953907a53383c14d73d50ed8faaa695d820a5bf">int_log_min_split_count</a>,</div>
<div class="line"><a name="l00414"></a><span class="lineno"> 414</span>  <a class="code" href="namespaceboost_1_1sort_1_1detail.html#a7bbd2027f75936442318063f34953907ae0c3ec0c116b92c92015245fd5024a27">int_log_finishing_count</a>></div>
<div class="line"><a name="l00415"></a><span class="lineno"> 415</span>  (first, last, bin_cache, 0, bin_sizes, shift, comp);</div>
<div class="line"><a name="l00416"></a><span class="lineno"> 416</span>  }</div>
<div class="line"><a name="l00417"></a><span class="lineno"> 417</span> </div>
<div class="line"><a name="l00418"></a><span class="lineno"> 418</span>  <span class="keyword">template</span> <<span class="keyword">class </span>RandomAccessIter, <span class="keyword">class </span>Div_type, <span class="keyword">class </span>Right_shift,</div>
<div class="line"><a name="l00419"></a><span class="lineno"> 419</span>  <span class="keyword">class </span>Compare></div>
<div class="line"><a name="l00420"></a><span class="lineno"> 420</span>  <span class="comment">//Only use spreadsort if the integer can fit in a uintmax_t</span></div>
<div class="line"><a name="l00421"></a><span class="lineno"> 421</span>  <span class="keyword">inline</span> <span class="keyword">typename</span> boost::enable_if_c< (sizeof(Div_type) > <span class="keyword">sizeof</span>(size_t))</div>
<div class="line"><a name="l00422"></a><span class="lineno"> 422</span>  && <span class="keyword">sizeof</span>(Div_type) <= <span class="keyword">sizeof</span>(boost::uintmax_t), <span class="keywordtype">void</span> >::type</div>
<div class="line"><a name="l00423"></a><span class="lineno"> 423</span>  <a class="code" href="namespaceboost_1_1sort.html#ae6ffbcf932699589fd2b93879f209013">integer_sort</a>(RandomAccessIter first, RandomAccessIter last, Div_type,</div>
<div class="line"><a name="l00424"></a><span class="lineno"> 424</span>  Right_shift shift, Compare comp)</div>
<div class="line"><a name="l00425"></a><span class="lineno"> 425</span>  {</div>
<div class="line"><a name="l00426"></a><span class="lineno"> 426</span>  <span class="keywordtype">size_t</span> bin_sizes[1 << <a class="code" href="namespaceboost_1_1sort_1_1detail.html#a7bbd2027f75936442318063f34953907acfdc43b3d7aa6df69b0f6982918056c7">max_finishing_splits</a>];</div>
<div class="line"><a name="l00427"></a><span class="lineno"> 427</span>  std::vector<RandomAccessIter> bin_cache;</div>
<div class="line"><a name="l00428"></a><span class="lineno"> 428</span>  spreadsort_rec<RandomAccessIter, Div_type, Right_shift, Compare,</div>
<div class="line"><a name="l00429"></a><span class="lineno"> 429</span>  boost::uintmax_t, <a class="code" href="namespaceboost_1_1sort_1_1detail.html#a7bbd2027f75936442318063f34953907a2e171c91f6c9e1d82643e4b35a4c65de">int_log_mean_bin_size</a>,</div>
<div class="line"><a name="l00430"></a><span class="lineno"> 430</span>  <a class="code" href="namespaceboost_1_1sort_1_1detail.html#a7bbd2027f75936442318063f34953907a53383c14d73d50ed8faaa695d820a5bf">int_log_min_split_count</a>, <a class="code" href="namespaceboost_1_1sort_1_1detail.html#a7bbd2027f75936442318063f34953907ae0c3ec0c116b92c92015245fd5024a27">int_log_finishing_count</a>></div>
<div class="line"><a name="l00431"></a><span class="lineno"> 431</span>  (first, last, bin_cache, 0, bin_sizes, shift, comp);</div>
<div class="line"><a name="l00432"></a><span class="lineno"> 432</span>  }</div>
<div class="line"><a name="l00433"></a><span class="lineno"> 433</span> </div>
<div class="line"><a name="l00434"></a><span class="lineno"> 434</span>  <span class="keyword">template</span> <<span class="keyword">class </span>RandomAccessIter, <span class="keyword">class </span>Div_type, <span class="keyword">class </span>Right_shift,</div>
<div class="line"><a name="l00435"></a><span class="lineno"> 435</span>  <span class="keyword">class </span>Compare></div>
<div class="line"><a name="l00436"></a><span class="lineno"> 436</span>  <span class="keyword">inline</span> <span class="keyword">typename</span> boost::disable_if_c< <span class="keyword">sizeof</span>(Div_type) <= <span class="keyword">sizeof</span>(<span class="keywordtype">size_t</span>)</div>
<div class="line"><a name="l00437"></a><span class="lineno"> 437</span>  || <span class="keyword">sizeof</span>(Div_type) <= <span class="keyword">sizeof</span>(boost::uintmax_t), <span class="keywordtype">void</span> >::type</div>
<div class="line"><a name="l00438"></a><span class="lineno"> 438</span>  <span class="comment">//defaulting to std::sort when integer_sort won't work</span></div>
<div class="line"><a name="l00439"></a><span class="lineno"> 439</span>  <a class="code" href="namespaceboost_1_1sort.html#ae6ffbcf932699589fd2b93879f209013">integer_sort</a>(RandomAccessIter first, RandomAccessIter last, Div_type,</div>
<div class="line"><a name="l00440"></a><span class="lineno"> 440</span>  Right_shift shift, Compare comp)</div>
<div class="line"><a name="l00441"></a><span class="lineno"> 441</span>  {</div>
<div class="line"><a name="l00442"></a><span class="lineno"> 442</span>  <span class="comment">//Warning that we're using std::sort, even though integer_sort was called</span></div>
<div class="line"><a name="l00443"></a><span class="lineno"> 443</span>  BOOST_STATIC_WARNING( <span class="keyword">sizeof</span>(Div_type) <= <span class="keyword">sizeof</span>(<span class="keywordtype">size_t</span>) );</div>
<div class="line"><a name="l00444"></a><span class="lineno"> 444</span>  std::sort(first, last, comp);</div>
<div class="line"><a name="l00445"></a><span class="lineno"> 445</span>  }</div>
<div class="line"><a name="l00446"></a><span class="lineno"> 446</span> </div>
<div class="line"><a name="l00447"></a><span class="lineno"> 447</span> </div>
<div class="line"><a name="l00448"></a><span class="lineno"> 448</span>  <span class="comment">//Same for the right shift version</span></div>
<div class="line"><a name="l00449"></a><span class="lineno"> 449</span>  <span class="keyword">template</span> <<span class="keyword">class</span> RandomAccessIter, <span class="keyword">class</span> Div_type, <span class="keyword">class</span> Right_shift></div>
<div class="line"><a name="l00450"></a><span class="lineno"> 450</span>  <span class="comment">//Only use spreadsort if the integer can fit in a size_t</span></div>
<div class="line"><a name="l00451"></a><span class="lineno"> 451</span>  <span class="keyword">inline</span> <span class="keyword">typename</span> boost::enable_if_c< <span class="keyword">sizeof</span>(Div_type) <= <span class="keyword">sizeof</span>(<span class="keywordtype">size_t</span>),</div>
<div class="line"><a name="l00452"></a><span class="lineno"> 452</span>  <span class="keywordtype">void</span> >::type</div>
<div class="line"><a name="l00453"></a><span class="lineno"> 453</span>  <a class="code" href="namespaceboost_1_1sort.html#ae6ffbcf932699589fd2b93879f209013">integer_sort</a>(RandomAccessIter first, RandomAccessIter last, Div_type,</div>
<div class="line"><a name="l00454"></a><span class="lineno"> 454</span>  Right_shift shift)</div>
<div class="line"><a name="l00455"></a><span class="lineno"> 455</span>  {</div>
<div class="line"><a name="l00456"></a><span class="lineno"> 456</span>  <span class="keywordtype">size_t</span> bin_sizes[1 << <a class="code" href="namespaceboost_1_1sort_1_1detail.html#a7bbd2027f75936442318063f34953907acfdc43b3d7aa6df69b0f6982918056c7">max_finishing_splits</a>];</div>
<div class="line"><a name="l00457"></a><span class="lineno"> 457</span>  std::vector<RandomAccessIter> bin_cache;</div>
<div class="line"><a name="l00458"></a><span class="lineno"> 458</span>  spreadsort_rec<RandomAccessIter, Div_type, Right_shift, size_t,</div>
<div class="line"><a name="l00459"></a><span class="lineno"> 459</span>  <a class="code" href="namespaceboost_1_1sort_1_1detail.html#a7bbd2027f75936442318063f34953907a2e171c91f6c9e1d82643e4b35a4c65de">int_log_mean_bin_size</a>, <a class="code" href="namespaceboost_1_1sort_1_1detail.html#a7bbd2027f75936442318063f34953907a53383c14d73d50ed8faaa695d820a5bf">int_log_min_split_count</a>,</div>
<div class="line"><a name="l00460"></a><span class="lineno"> 460</span>  <a class="code" href="namespaceboost_1_1sort_1_1detail.html#a7bbd2027f75936442318063f34953907ae0c3ec0c116b92c92015245fd5024a27">int_log_finishing_count</a>></div>
<div class="line"><a name="l00461"></a><span class="lineno"> 461</span>  (first, last, bin_cache, 0, bin_sizes, shift);</div>
<div class="line"><a name="l00462"></a><span class="lineno"> 462</span>  }</div>
<div class="line"><a name="l00463"></a><span class="lineno"> 463</span> </div>
<div class="line"><a name="l00464"></a><span class="lineno"> 464</span>  <span class="keyword">template</span> <<span class="keyword">class</span> RandomAccessIter, <span class="keyword">class</span> Div_type, <span class="keyword">class</span> Right_shift></div>
<div class="line"><a name="l00465"></a><span class="lineno"> 465</span>  <span class="comment">//Only use spreadsort if the integer can fit in a uintmax_t</span></div>
<div class="line"><a name="l00466"></a><span class="lineno"> 466</span>  <span class="keyword">inline</span> <span class="keyword">typename</span> boost::enable_if_c< (sizeof(Div_type) > <span class="keyword">sizeof</span>(size_t))</div>
<div class="line"><a name="l00467"></a><span class="lineno"> 467</span>  && <span class="keyword">sizeof</span>(Div_type) <= <span class="keyword">sizeof</span>(boost::uintmax_t), <span class="keywordtype">void</span> >::type</div>
<div class="line"><a name="l00468"></a><span class="lineno"> 468</span>  <a class="code" href="namespaceboost_1_1sort.html#ae6ffbcf932699589fd2b93879f209013">integer_sort</a>(RandomAccessIter first, RandomAccessIter last, Div_type,</div>
<div class="line"><a name="l00469"></a><span class="lineno"> 469</span>  Right_shift shift)</div>
<div class="line"><a name="l00470"></a><span class="lineno"> 470</span>  {</div>
<div class="line"><a name="l00471"></a><span class="lineno"> 471</span>  <span class="keywordtype">size_t</span> bin_sizes[1 << <a class="code" href="namespaceboost_1_1sort_1_1detail.html#a7bbd2027f75936442318063f34953907acfdc43b3d7aa6df69b0f6982918056c7">max_finishing_splits</a>];</div>
<div class="line"><a name="l00472"></a><span class="lineno"> 472</span>  std::vector<RandomAccessIter> bin_cache;</div>
<div class="line"><a name="l00473"></a><span class="lineno"> 473</span>  spreadsort_rec<RandomAccessIter, Div_type, Right_shift,</div>
<div class="line"><a name="l00474"></a><span class="lineno"> 474</span>  boost::uintmax_t, <a class="code" href="namespaceboost_1_1sort_1_1detail.html#a7bbd2027f75936442318063f34953907a2e171c91f6c9e1d82643e4b35a4c65de">int_log_mean_bin_size</a>,</div>
<div class="line"><a name="l00475"></a><span class="lineno"> 475</span>  <a class="code" href="namespaceboost_1_1sort_1_1detail.html#a7bbd2027f75936442318063f34953907a53383c14d73d50ed8faaa695d820a5bf">int_log_min_split_count</a>, <a class="code" href="namespaceboost_1_1sort_1_1detail.html#a7bbd2027f75936442318063f34953907ae0c3ec0c116b92c92015245fd5024a27">int_log_finishing_count</a>></div>
<div class="line"><a name="l00476"></a><span class="lineno"> 476</span>  (first, last, bin_cache, 0, bin_sizes, shift);</div>
<div class="line"><a name="l00477"></a><span class="lineno"> 477</span>  }</div>
<div class="line"><a name="l00478"></a><span class="lineno"> 478</span> </div>
<div class="line"><a name="l00479"></a><span class="lineno"> 479</span>  <span class="keyword">template</span> <<span class="keyword">class</span> RandomAccessIter, <span class="keyword">class</span> Div_type, <span class="keyword">class</span> Right_shift></div>
<div class="line"><a name="l00480"></a><span class="lineno"> 480</span>  <span class="keyword">inline</span> <span class="keyword">typename</span> boost::disable_if_c< <span class="keyword">sizeof</span>(Div_type) <= <span class="keyword">sizeof</span>(<span class="keywordtype">size_t</span>)</div>
<div class="line"><a name="l00481"></a><span class="lineno"> 481</span>  || <span class="keyword">sizeof</span>(Div_type) <= <span class="keyword">sizeof</span>(boost::uintmax_t), <span class="keywordtype">void</span> >::type</div>
<div class="line"><a name="l00482"></a><span class="lineno"> 482</span>  <span class="comment">//defaulting to std::sort when integer_sort won't work</span></div>
<div class="line"><a name="l00483"></a><span class="lineno"> 483</span>  <a class="code" href="namespaceboost_1_1sort.html#ae6ffbcf932699589fd2b93879f209013">integer_sort</a>(RandomAccessIter first, RandomAccessIter last, Div_type,</div>
<div class="line"><a name="l00484"></a><span class="lineno"> 484</span>  Right_shift shift)</div>
<div class="line"><a name="l00485"></a><span class="lineno"> 485</span>  {</div>
<div class="line"><a name="l00486"></a><span class="lineno"> 486</span>  <span class="comment">//Warning that we're using std::sort, even though integer_sort was called</span></div>
<div class="line"><a name="l00487"></a><span class="lineno"> 487</span>  BOOST_STATIC_WARNING( <span class="keyword">sizeof</span>(Div_type) <= <span class="keyword">sizeof</span>(<span class="keywordtype">size_t</span>) );</div>
<div class="line"><a name="l00488"></a><span class="lineno"> 488</span>  std::sort(first, last);</div>
<div class="line"><a name="l00489"></a><span class="lineno"> 489</span>  }</div>
<div class="line"><a name="l00490"></a><span class="lineno"> 490</span>  }</div>
<div class="line"><a name="l00491"></a><span class="lineno"> 491</span> }</div>
<div class="line"><a name="l00492"></a><span class="lineno"> 492</span> }<span class="comment"></span></div>
<div class="line"><a name="l00493"></a><span class="lineno"> 493</span> <span class="comment">//! \endcond</span></div>
<div class="line"><a name="l00494"></a><span class="lineno"> 494</span> <span class="comment"></span></div>
<div class="line"><a name="l00495"></a><span class="lineno"> 495</span> <span class="preprocessor">#endif</span></div>
<div class="line"><a name="l00496"></a><span class="lineno"> 496</span> </div>
<div class="ttc" id="namespaceboost_1_1sort_html_ae6ffbcf932699589fd2b93879f209013"><div class="ttname"><a href="namespaceboost_1_1sort.html#ae6ffbcf932699589fd2b93879f209013">boost::sort::integer_sort</a></div><div class="ttdeci">void integer_sort(RandomAccessIter first, RandomAccessIter last)</div><div class="ttdoc">Integer sort algorithm using random access iterators. (All variants fall back to std::sort if the dat...</div><div class="ttdef"><b>Definition:</b> integer_sort.hpp:78</div></div>
<div class="ttc" id="namespaceboost_html"><div class="ttname"><a href="namespaceboost.html">boost</a></div><div class="ttdef"><b>Definition:</b> constants.hpp:11</div></div>
<div class="ttc" id="namespaceboost_1_1sort_1_1detail_html_a7bbd2027f75936442318063f34953907ae0c3ec0c116b92c92015245fd5024a27"><div class="ttname"><a href="namespaceboost_1_1sort_1_1detail.html#a7bbd2027f75936442318063f34953907ae0c3ec0c116b92c92015245fd5024a27">boost::sort::detail::int_log_finishing_count</a></div><div class="ttdef"><b>Definition:</b> constants.hpp:30</div></div>
<div class="ttc" id="namespaceboost_1_1sort_1_1detail_html_a7bbd2027f75936442318063f34953907acfdc43b3d7aa6df69b0f6982918056c7"><div class="ttname"><a href="namespaceboost_1_1sort_1_1detail.html#a7bbd2027f75936442318063f34953907acfdc43b3d7aa6df69b0f6982918056c7">boost::sort::detail::max_finishing_splits</a></div><div class="ttdef"><b>Definition:</b> constants.hpp:22</div></div>
<div class="ttc" id="namespaceboost_1_1sort_1_1detail_html_a4ba5c57512d16f300c08b7a6b4e6ff23"><div class="ttname"><a href="namespaceboost_1_1sort_1_1detail.html#a4ba5c57512d16f300c08b7a6b4e6ff23">boost::sort::detail::get_min_count</a></div><div class="ttdeci">size_t get_min_count(unsigned log_range)</div><div class="ttdef"><b>Definition:</b> spreadsort_common.hpp:51</div></div>
<div class="ttc" id="namespaceboost_1_1sort_1_1detail_html_a7bbd2027f75936442318063f34953907a53383c14d73d50ed8faaa695d820a5bf"><div class="ttname"><a href="namespaceboost_1_1sort_1_1detail.html#a7bbd2027f75936442318063f34953907a53383c14d73d50ed8faaa695d820a5bf">boost::sort::detail::int_log_min_split_count</a></div><div class="ttdef"><b>Definition:</b> constants.hpp:27</div></div>
<div class="ttc" id="namespaceboost_1_1sort_1_1detail_html_a7bbd2027f75936442318063f34953907a17b216febe1b5e8212a80231592fc9d9"><div class="ttname"><a href="namespaceboost_1_1sort_1_1detail.html#a7bbd2027f75936442318063f34953907a17b216febe1b5e8212a80231592fc9d9">boost::sort::detail::max_splits</a></div><div class="ttdef"><b>Definition:</b> constants.hpp:19</div></div>
<div class="ttc" id="spreadsort__common_8hpp_html"><div class="ttname"><a href="spreadsort__common_8hpp.html">spreadsort_common.hpp</a></div></div>
<div class="ttc" id="namespaceboost_1_1sort_1_1detail_html_a852a51cde62aa67347cb9b4a7350bbac"><div class="ttname"><a href="namespaceboost_1_1sort_1_1detail.html#a852a51cde62aa67347cb9b4a7350bbac">boost::sort::detail::rough_log_2_size</a></div><div class="ttdeci">unsigned rough_log_2_size(const T &input)</div><div class="ttdef"><b>Definition:</b> spreadsort_common.hpp:34</div></div>
<div class="ttc" id="namespaceboost_1_1sort_1_1detail_html_a8aaa1645892e6f6845455605b48a5d0e"><div class="ttname"><a href="namespaceboost_1_1sort_1_1detail.html#a8aaa1645892e6f6845455605b48a5d0e">boost::sort::detail::is_sorted_or_find_extremes</a></div><div class="ttdeci">bool is_sorted_or_find_extremes(RandomAccessIter current, RandomAccessIter last, Div_type &max, Div_type &min, Right_shift rshift)</div><div class="ttdef"><b>Definition:</b> float_sort.hpp:54</div></div>
<div class="ttc" id="constants_8hpp_html"><div class="ttname"><a href="constants_8hpp.html">constants.hpp</a></div></div>
<div class="ttc" id="namespaceboost_1_1sort_1_1detail_html_ad5b7d31fba809eae5d17f5c2fb0a385b"><div class="ttname"><a href="namespaceboost_1_1sort_1_1detail.html#ad5b7d31fba809eae5d17f5c2fb0a385b">boost::sort::detail::size_bins</a></div><div class="ttdeci">RandomAccessIter * size_bins(size_t *bin_sizes, std::vector< RandomAccessIter > &bin_cache, unsigned cache_offset, unsigned &cache_end, unsigned bin_count)</div><div class="ttdef"><b>Definition:</b> spreadsort_common.hpp:106</div></div>
<div class="ttc" id="namespaceboost_1_1sort_1_1detail_html_a7bbd2027f75936442318063f34953907a2e171c91f6c9e1d82643e4b35a4c65de"><div class="ttname"><a href="namespaceboost_1_1sort_1_1detail.html#a7bbd2027f75936442318063f34953907a2e171c91f6c9e1d82643e4b35a4c65de">boost::sort::detail::int_log_mean_bin_size</a></div><div class="ttdef"><b>Definition:</b> constants.hpp:24</div></div>
</div><!-- fragment --></div><!-- contents -->
<!-- start footer part -->
<hr class="footer"/><address class="footer"><small>
Generated on Wed Jan 7 2015 17:29:22 for Boost.Sort by  <a href="http://www.doxygen.org/index.html">
<img class="footer" src="doxygen.png" alt="doxygen"/>
</a> 1.8.9.1
</small></address>
</body>
</html>
|
