]>
Commit | Line | Data |
---|---|---|
7c673cae FG |
1 | <!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "http://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd"> |
2 | <html xmlns="http://www.w3.org/1999/xhtml"> | |
3 | <head> | |
4 | <meta http-equiv="Content-Type" content="text/xhtml;charset=UTF-8"/> | |
5 | <meta http-equiv="X-UA-Compatible" content="IE=9"/> | |
6 | <meta name="generator" content="Doxygen 1.8.9.1"/> | |
7 | <title>Boost.Sort: I:/modular-boost/libs/sort/include/boost/sort/spreadsort/detail/float_sort.hpp Source File</title> | |
8 | <link href="tabs.css" rel="stylesheet" type="text/css"/> | |
9 | <script type="text/javascript" src="jquery.js"></script> | |
10 | <script type="text/javascript" src="dynsections.js"></script> | |
11 | <link href="search/search.css" rel="stylesheet" type="text/css"/> | |
12 | <script type="text/javascript" src="search/searchdata.js"></script> | |
13 | <script type="text/javascript" src="search/search.js"></script> | |
14 | <script type="text/javascript"> | |
15 | $(document).ready(function() { init_search(); }); | |
16 | </script> | |
17 | <link href="doxygen.css" rel="stylesheet" type="text/css" /> | |
18 | </head> | |
19 | <body> | |
20 | <div id="top"><!-- do not remove this div, it is closed by doxygen! --> | |
21 | <div id="titlearea"> | |
22 | <table cellspacing="0" cellpadding="0"> | |
23 | <tbody> | |
24 | <tr style="height: 56px;"> | |
25 | <td style="padding-left: 0.5em;"> | |
26 | <div id="projectname">Boost.Sort | |
27 | </div> | |
28 | </td> | |
29 | </tr> | |
30 | </tbody> | |
31 | </table> | |
32 | </div> | |
33 | <!-- end header part --> | |
34 | <!-- Generated by Doxygen 1.8.9.1 --> | |
35 | <script type="text/javascript"> | |
36 | var searchBox = new SearchBox("searchBox", "search",false,'Search'); | |
37 | </script> | |
38 | <div id="navrow1" class="tabs"> | |
39 | <ul class="tablist"> | |
40 | <li><a href="index.html"><span>Main Page</span></a></li> | |
41 | <li><a href="namespaces.html"><span>Namespaces</span></a></li> | |
42 | <li><a href="annotated.html"><span>Classes</span></a></li> | |
43 | <li class="current"><a href="files.html"><span>Files</span></a></li> | |
44 | <li> | |
45 | <div id="MSearchBox" class="MSearchBoxInactive"> | |
46 | <span class="left"> | |
47 | <img id="MSearchSelect" src="search/mag_sel.png" | |
48 | onmouseover="return searchBox.OnSearchSelectShow()" | |
49 | onmouseout="return searchBox.OnSearchSelectHide()" | |
50 | alt=""/> | |
51 | <input type="text" id="MSearchField" value="Search" accesskey="S" | |
52 | onfocus="searchBox.OnSearchFieldFocus(true)" | |
53 | onblur="searchBox.OnSearchFieldFocus(false)" | |
54 | onkeyup="searchBox.OnSearchFieldChange(event)"/> | |
55 | </span><span class="right"> | |
56 | <a id="MSearchClose" href="javascript:searchBox.CloseResultsWindow()"><img id="MSearchCloseImg" border="0" src="search/close.png" alt=""/></a> | |
57 | </span> | |
58 | </div> | |
59 | </li> | |
60 | </ul> | |
61 | </div> | |
62 | <div id="navrow2" class="tabs2"> | |
63 | <ul class="tablist"> | |
64 | <li><a href="files.html"><span>File List</span></a></li> | |
65 | </ul> | |
66 | </div> | |
67 | <!-- window showing the filter options --> | |
68 | <div id="MSearchSelectWindow" | |
69 | onmouseover="return searchBox.OnSearchSelectShow()" | |
70 | onmouseout="return searchBox.OnSearchSelectHide()" | |
71 | onkeydown="return searchBox.OnSearchSelectKey(event)"> | |
72 | </div> | |
73 | ||
74 | <!-- iframe showing the search results (closed by default) --> | |
75 | <div id="MSearchResultsWindow"> | |
76 | <iframe src="javascript:void(0)" frameborder="0" | |
77 | name="MSearchResults" id="MSearchResults"> | |
78 | </iframe> | |
79 | </div> | |
80 | ||
81 | <div id="nav-path" class="navpath"> | |
82 | <ul> | |
83 | <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> | |
84 | </div> | |
85 | </div><!-- top --> | |
86 | <div class="header"> | |
87 | <div class="headertitle"> | |
88 | <div class="title">float_sort.hpp</div> </div> | |
89 | </div><!--header--> | |
90 | <div class="contents"> | |
91 | <a href="detail_2float__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 float_sort.</span></div> | |
92 | <div class="line"><a name="l00002"></a><span class="lineno"> 2</span> </div> | |
93 | <div class="line"><a name="l00003"></a><span class="lineno"> 3</span> <span class="comment">// Copyright Steven J. Ross 2001 - 2014.</span></div> | |
94 | <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> | |
95 | <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> | |
96 | <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> | |
97 | <div class="line"><a name="l00007"></a><span class="lineno"> 7</span> </div> | |
98 | <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> | |
99 | <div class="line"><a name="l00009"></a><span class="lineno"> 9</span> </div> | |
100 | <div class="line"><a name="l00010"></a><span class="lineno"> 10</span> <span class="comment">/*</span></div> | |
101 | <div class="line"><a name="l00011"></a><span class="lineno"> 11</span> <span class="comment">Some improvements suggested by:</span></div> | |
102 | <div class="line"><a name="l00012"></a><span class="lineno"> 12</span> <span class="comment">Phil Endecott and Frank Gennari</span></div> | |
103 | <div class="line"><a name="l00013"></a><span class="lineno"> 13</span> <span class="comment">float_mem_cast fix provided by:</span></div> | |
104 | <div class="line"><a name="l00014"></a><span class="lineno"> 14</span> <span class="comment">Scott McMurray</span></div> | |
105 | <div class="line"><a name="l00015"></a><span class="lineno"> 15</span> <span class="comment">*/</span></div> | |
106 | <div class="line"><a name="l00016"></a><span class="lineno"> 16</span> </div> | |
107 | <div class="line"><a name="l00017"></a><span class="lineno"> 17</span> <span class="preprocessor">#ifndef BOOST_SORT_SPREADSORT_DETAIL_FLOAT_SORT_HPP</span></div> | |
108 | <div class="line"><a name="l00018"></a><span class="lineno"> 18</span> <span class="preprocessor">#define BOOST_SORT_SPREADSORT_DETAIL_FLOAT_SORT_HPP</span></div> | |
109 | <div class="line"><a name="l00019"></a><span class="lineno"> 19</span> <span class="preprocessor">#include <algorithm></span></div> | |
110 | <div class="line"><a name="l00020"></a><span class="lineno"> 20</span> <span class="preprocessor">#include <vector></span></div> | |
111 | <div class="line"><a name="l00021"></a><span class="lineno"> 21</span> <span class="preprocessor">#include <limits></span></div> | |
112 | <div class="line"><a name="l00022"></a><span class="lineno"> 22</span> <span class="preprocessor">#include <functional></span></div> | |
113 | <div class="line"><a name="l00023"></a><span class="lineno"> 23</span> <span class="preprocessor">#include <boost/static_assert.hpp></span></div> | |
114 | <div class="line"><a name="l00024"></a><span class="lineno"> 24</span> <span class="preprocessor">#include <boost/serialization/static_warning.hpp></span></div> | |
115 | <div class="line"><a name="l00025"></a><span class="lineno"> 25</span> <span class="preprocessor">#include <boost/utility/enable_if.hpp></span></div> | |
116 | <div class="line"><a name="l00026"></a><span class="lineno"> 26</span> <span class="preprocessor">#include <<a class="code" href="constants_8hpp.html">boost/sort/spreadsort/detail/constants.hpp</a>></span></div> | |
117 | <div class="line"><a name="l00027"></a><span class="lineno"> 27</span> <span class="preprocessor">#include <<a class="code" href="detail_2integer__sort_8hpp.html">boost/sort/spreadsort/detail/integer_sort.hpp</a>></span></div> | |
118 | <div class="line"><a name="l00028"></a><span class="lineno"> 28</span> <span class="preprocessor">#include <<a class="code" href="spreadsort__common_8hpp.html">boost/sort/spreadsort/detail/spreadsort_common.hpp</a>></span></div> | |
119 | <div class="line"><a name="l00029"></a><span class="lineno"> 29</span> <span class="preprocessor">#include <boost/cstdint.hpp></span></div> | |
120 | <div class="line"><a name="l00030"></a><span class="lineno"> 30</span> </div> | |
121 | <div class="line"><a name="l00031"></a><span class="lineno"> 31</span> <span class="keyword">namespace </span><a class="code" href="namespaceboost.html">boost</a> {</div> | |
122 | <div class="line"><a name="l00032"></a><span class="lineno"> 32</span> <span class="keyword">namespace </span>sort {</div> | |
123 | <div class="line"><a name="l00033"></a><span class="lineno"> 33</span>  <span class="keyword">namespace </span>detail {</div> | |
124 | <div class="line"><a name="l00034"></a><span class="lineno"> 34</span>  <span class="comment">//Casts a RandomAccessIter to the specified integer type</span></div> | |
125 | <div class="line"><a name="l00035"></a><span class="lineno"> 35</span>  <span class="keyword">template</span><<span class="keyword">class</span> Cast_type, <span class="keyword">class</span> RandomAccessIter></div> | |
126 | <div class="line"><a name="l00036"></a><span class="lineno"> 36</span>  <span class="keyword">inline</span> Cast_type</div> | |
127 | <div class="line"><a name="l00037"></a><span class="lineno"><a class="line" href="namespaceboost_1_1sort_1_1detail.html#a8e8308c47bd14eff1c1d0f498289de35"> 37</a></span>  <a class="code" href="namespaceboost_1_1sort_1_1detail.html#a8e8308c47bd14eff1c1d0f498289de35">cast_float_iter</a>(<span class="keyword">const</span> RandomAccessIter & floatiter)</div> | |
128 | <div class="line"><a name="l00038"></a><span class="lineno"> 38</span>  {</div> | |
129 | <div class="line"><a name="l00039"></a><span class="lineno"> 39</span>  <span class="keyword">typedef</span> <span class="keyword">typename</span> std::iterator_traits<RandomAccessIter>::value_type</div> | |
130 | <div class="line"><a name="l00040"></a><span class="lineno"> 40</span>  Data_type;</div> | |
131 | <div class="line"><a name="l00041"></a><span class="lineno"> 41</span>  <span class="comment">//Only cast IEEE floating-point numbers, and only to same-sized integers</span></div> | |
132 | <div class="line"><a name="l00042"></a><span class="lineno"> 42</span>  BOOST_STATIC_ASSERT(<span class="keyword">sizeof</span>(Cast_type) == <span class="keyword">sizeof</span>(Data_type));</div> | |
133 | <div class="line"><a name="l00043"></a><span class="lineno"> 43</span>  BOOST_STATIC_ASSERT(std::numeric_limits<Data_type>::is_iec559);</div> | |
134 | <div class="line"><a name="l00044"></a><span class="lineno"> 44</span>  BOOST_STATIC_ASSERT(std::numeric_limits<Cast_type>::is_integer);</div> | |
135 | <div class="line"><a name="l00045"></a><span class="lineno"> 45</span>  Cast_type result;</div> | |
136 | <div class="line"><a name="l00046"></a><span class="lineno"> 46</span>  std::memcpy(&result, &(*floatiter), <span class="keyword">sizeof</span>(Data_type));</div> | |
137 | <div class="line"><a name="l00047"></a><span class="lineno"> 47</span>  <span class="keywordflow">return</span> result;</div> | |
138 | <div class="line"><a name="l00048"></a><span class="lineno"> 48</span>  }</div> | |
139 | <div class="line"><a name="l00049"></a><span class="lineno"> 49</span> </div> | |
140 | <div class="line"><a name="l00050"></a><span class="lineno"> 50</span>  <span class="comment">// Return true if the list is sorted. Otherwise, find the minimum and</span></div> | |
141 | <div class="line"><a name="l00051"></a><span class="lineno"> 51</span>  <span class="comment">// maximum. Values are Right_shifted 0 bits before comparison.</span></div> | |
142 | <div class="line"><a name="l00052"></a><span class="lineno"> 52</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> | |
143 | <div class="line"><a name="l00053"></a><span class="lineno"> 53</span>  <span class="keyword">inline</span> <span class="keywordtype">bool</span></div> | |
144 | <div class="line"><a name="l00054"></a><span class="lineno"><a class="line" href="namespaceboost_1_1sort_1_1detail.html#a8aaa1645892e6f6845455605b48a5d0e"> 54</a></span>  <a class="code" href="namespaceboost_1_1sort_1_1detail.html#a8aaa1645892e6f6845455605b48a5d0e">is_sorted_or_find_extremes</a>(RandomAccessIter current, RandomAccessIter last,</div> | |
145 | <div class="line"><a name="l00055"></a><span class="lineno"> 55</span>  Div_type & max, Div_type & min, Right_shift rshift)</div> | |
146 | <div class="line"><a name="l00056"></a><span class="lineno"> 56</span>  {</div> | |
147 | <div class="line"><a name="l00057"></a><span class="lineno"> 57</span>  min = max = rshift(*current, 0);</div> | |
148 | <div class="line"><a name="l00058"></a><span class="lineno"> 58</span>  Div_type prev = min;</div> | |
149 | <div class="line"><a name="l00059"></a><span class="lineno"> 59</span>  <span class="keywordtype">bool</span> sorted = <span class="keyword">true</span>;</div> | |
150 | <div class="line"><a name="l00060"></a><span class="lineno"> 60</span>  <span class="keywordflow">while</span> (++current < last) {</div> | |
151 | <div class="line"><a name="l00061"></a><span class="lineno"> 61</span>  Div_type value = rshift(*current, 0);</div> | |
152 | <div class="line"><a name="l00062"></a><span class="lineno"> 62</span>  sorted &= value >= prev;</div> | |
153 | <div class="line"><a name="l00063"></a><span class="lineno"> 63</span>  prev = value;</div> | |
154 | <div class="line"><a name="l00064"></a><span class="lineno"> 64</span>  <span class="keywordflow">if</span> (max < value)</div> | |
155 | <div class="line"><a name="l00065"></a><span class="lineno"> 65</span>  max = value;</div> | |
156 | <div class="line"><a name="l00066"></a><span class="lineno"> 66</span>  <span class="keywordflow">else</span> <span class="keywordflow">if</span> (value < min)</div> | |
157 | <div class="line"><a name="l00067"></a><span class="lineno"> 67</span>  min = value;</div> | |
158 | <div class="line"><a name="l00068"></a><span class="lineno"> 68</span>  }</div> | |
159 | <div class="line"><a name="l00069"></a><span class="lineno"> 69</span>  <span class="keywordflow">return</span> sorted;</div> | |
160 | <div class="line"><a name="l00070"></a><span class="lineno"> 70</span>  }</div> | |
161 | <div class="line"><a name="l00071"></a><span class="lineno"> 71</span> </div> | |
162 | <div class="line"><a name="l00072"></a><span class="lineno"> 72</span>  <span class="comment">//Specialized swap loops for floating-point casting</span></div> | |
163 | <div class="line"><a name="l00073"></a><span class="lineno"> 73</span>  <span class="keyword">template</span> <<span class="keyword">class</span> RandomAccessIter, <span class="keyword">class</span> Div_type></div> | |
164 | <div class="line"><a name="l00074"></a><span class="lineno"><a class="line" href="namespaceboost_1_1sort_1_1detail.html#ac04e982cc9f6bcc101f6af6bcd7b36b3"> 74</a></span>  <span class="keyword">inline</span> <span class="keywordtype">void</span> <a class="code" href="namespaceboost_1_1sort_1_1detail.html#ac04e982cc9f6bcc101f6af6bcd7b36b3">inner_float_swap_loop</a>(RandomAccessIter * bins,</div> | |
165 | <div class="line"><a name="l00075"></a><span class="lineno"> 75</span>  <span class="keyword">const</span> RandomAccessIter & nextbinstart, <span class="keywordtype">unsigned</span> ii</div> | |
166 | <div class="line"><a name="l00076"></a><span class="lineno"> 76</span>  , <span class="keyword">const</span> <span class="keywordtype">unsigned</span> log_divisor, <span class="keyword">const</span> Div_type div_min)</div> | |
167 | <div class="line"><a name="l00077"></a><span class="lineno"> 77</span>  {</div> | |
168 | <div class="line"><a name="l00078"></a><span class="lineno"> 78</span>  RandomAccessIter * local_bin = bins + ii;</div> | |
169 | <div class="line"><a name="l00079"></a><span class="lineno"> 79</span>  <span class="keywordflow">for</span> (RandomAccessIter current = *local_bin; current < nextbinstart;</div> | |
170 | <div class="line"><a name="l00080"></a><span class="lineno"> 80</span>  ++current) {</div> | |
171 | <div class="line"><a name="l00081"></a><span class="lineno"> 81</span>  <span class="keywordflow">for</span> (RandomAccessIter * target_bin =</div> | |
172 | <div class="line"><a name="l00082"></a><span class="lineno"> 82</span>  (bins + ((cast_float_iter<Div_type, RandomAccessIter>(current) >></div> | |
173 | <div class="line"><a name="l00083"></a><span class="lineno"> 83</span>  log_divisor) - div_min)); target_bin != local_bin;</div> | |
174 | <div class="line"><a name="l00084"></a><span class="lineno"> 84</span>  target_bin = bins + ((cast_float_iter<Div_type, RandomAccessIter></div> | |
175 | <div class="line"><a name="l00085"></a><span class="lineno"> 85</span>  (current) >> log_divisor) - div_min)) {</div> | |
176 | <div class="line"><a name="l00086"></a><span class="lineno"> 86</span>  <span class="keyword">typename</span> std::iterator_traits<RandomAccessIter>::value_type tmp;</div> | |
177 | <div class="line"><a name="l00087"></a><span class="lineno"> 87</span>  RandomAccessIter b = (*target_bin)++;</div> | |
178 | <div class="line"><a name="l00088"></a><span class="lineno"> 88</span>  RandomAccessIter * b_bin = bins + ((<a class="code" href="namespaceboost_1_1sort_1_1detail.html#a8e8308c47bd14eff1c1d0f498289de35">cast_float_iter</a><Div_type,</div> | |
179 | <div class="line"><a name="l00089"></a><span class="lineno"> 89</span>  RandomAccessIter>(b) >> log_divisor) - div_min);</div> | |
180 | <div class="line"><a name="l00090"></a><span class="lineno"> 90</span>  <span class="comment">//Three-way swap; if the item to be swapped doesn't belong in the</span></div> | |
181 | <div class="line"><a name="l00091"></a><span class="lineno"> 91</span>  <span class="comment">//current bin, swap it to where it belongs</span></div> | |
182 | <div class="line"><a name="l00092"></a><span class="lineno"> 92</span>  <span class="keywordflow">if</span> (b_bin != local_bin) {</div> | |
183 | <div class="line"><a name="l00093"></a><span class="lineno"> 93</span>  RandomAccessIter c = (*b_bin)++;</div> | |
184 | <div class="line"><a name="l00094"></a><span class="lineno"> 94</span>  tmp = *c;</div> | |
185 | <div class="line"><a name="l00095"></a><span class="lineno"> 95</span>  *c = *b;</div> | |
186 | <div class="line"><a name="l00096"></a><span class="lineno"> 96</span>  }</div> | |
187 | <div class="line"><a name="l00097"></a><span class="lineno"> 97</span>  <span class="keywordflow">else</span></div> | |
188 | <div class="line"><a name="l00098"></a><span class="lineno"> 98</span>  tmp = *b;</div> | |
189 | <div class="line"><a name="l00099"></a><span class="lineno"> 99</span>  *b = *current;</div> | |
190 | <div class="line"><a name="l00100"></a><span class="lineno"> 100</span>  *current = tmp;</div> | |
191 | <div class="line"><a name="l00101"></a><span class="lineno"> 101</span>  }</div> | |
192 | <div class="line"><a name="l00102"></a><span class="lineno"> 102</span>  }</div> | |
193 | <div class="line"><a name="l00103"></a><span class="lineno"> 103</span>  *local_bin = nextbinstart;</div> | |
194 | <div class="line"><a name="l00104"></a><span class="lineno"> 104</span>  }</div> | |
195 | <div class="line"><a name="l00105"></a><span class="lineno"> 105</span> </div> | |
196 | <div class="line"><a name="l00106"></a><span class="lineno"> 106</span>  <span class="keyword">template</span> <<span class="keyword">class</span> RandomAccessIter, <span class="keyword">class</span> Div_type></div> | |
197 | <div class="line"><a name="l00107"></a><span class="lineno"><a class="line" href="namespaceboost_1_1sort_1_1detail.html#a18fb49752147ebb43503428568323d37"> 107</a></span>  <span class="keyword">inline</span> <span class="keywordtype">void</span> <a class="code" href="namespaceboost_1_1sort_1_1detail.html#a18fb49752147ebb43503428568323d37">float_swap_loop</a>(RandomAccessIter * bins,</div> | |
198 | <div class="line"><a name="l00108"></a><span class="lineno"> 108</span>  RandomAccessIter & nextbinstart, <span class="keywordtype">unsigned</span> ii,</div> | |
199 | <div class="line"><a name="l00109"></a><span class="lineno"> 109</span>  <span class="keyword">const</span> <span class="keywordtype">size_t</span> *bin_sizes,</div> | |
200 | <div class="line"><a name="l00110"></a><span class="lineno"> 110</span>  <span class="keyword">const</span> <span class="keywordtype">unsigned</span> log_divisor, <span class="keyword">const</span> Div_type div_min)</div> | |
201 | <div class="line"><a name="l00111"></a><span class="lineno"> 111</span>  {</div> | |
202 | <div class="line"><a name="l00112"></a><span class="lineno"> 112</span>  nextbinstart += bin_sizes[ii];</div> | |
203 | <div class="line"><a name="l00113"></a><span class="lineno"> 113</span>  inner_float_swap_loop<RandomAccessIter, Div_type></div> | |
204 | <div class="line"><a name="l00114"></a><span class="lineno"> 114</span>  (bins, nextbinstart, ii, log_divisor, div_min);</div> | |
205 | <div class="line"><a name="l00115"></a><span class="lineno"> 115</span>  }</div> | |
206 | <div class="line"><a name="l00116"></a><span class="lineno"> 116</span> </div> | |
207 | <div class="line"><a name="l00117"></a><span class="lineno"> 117</span>  <span class="comment">// Return true if the list is sorted. Otherwise, find the minimum and</span></div> | |
208 | <div class="line"><a name="l00118"></a><span class="lineno"> 118</span>  <span class="comment">// maximum. Values are cast to Cast_type before comparison.</span></div> | |
209 | <div class="line"><a name="l00119"></a><span class="lineno"> 119</span>  <span class="keyword">template</span> <<span class="keyword">class</span> RandomAccessIter, <span class="keyword">class</span> Cast_type></div> | |
210 | <div class="line"><a name="l00120"></a><span class="lineno"> 120</span>  <span class="keyword">inline</span> <span class="keywordtype">bool</span></div> | |
211 | <div class="line"><a name="l00121"></a><span class="lineno"><a class="line" href="namespaceboost_1_1sort_1_1detail.html#a75e908c58d77dce852027ea90c59ea8e"> 121</a></span>  <a class="code" href="namespaceboost_1_1sort_1_1detail.html#a8aaa1645892e6f6845455605b48a5d0e">is_sorted_or_find_extremes</a>(RandomAccessIter current, RandomAccessIter last,</div> | |
212 | <div class="line"><a name="l00122"></a><span class="lineno"> 122</span>  Cast_type & max, Cast_type & min)</div> | |
213 | <div class="line"><a name="l00123"></a><span class="lineno"> 123</span>  {</div> | |
214 | <div class="line"><a name="l00124"></a><span class="lineno"> 124</span>  min = max = cast_float_iter<Cast_type, RandomAccessIter>(current);</div> | |
215 | <div class="line"><a name="l00125"></a><span class="lineno"> 125</span>  Cast_type prev = min;</div> | |
216 | <div class="line"><a name="l00126"></a><span class="lineno"> 126</span>  <span class="keywordtype">bool</span> sorted = <span class="keyword">true</span>;</div> | |
217 | <div class="line"><a name="l00127"></a><span class="lineno"> 127</span>  <span class="keywordflow">while</span> (++current < last) {</div> | |
218 | <div class="line"><a name="l00128"></a><span class="lineno"> 128</span>  Cast_type value = cast_float_iter<Cast_type, RandomAccessIter>(current);</div> | |
219 | <div class="line"><a name="l00129"></a><span class="lineno"> 129</span>  sorted &= value >= prev;</div> | |
220 | <div class="line"><a name="l00130"></a><span class="lineno"> 130</span>  prev = value;</div> | |
221 | <div class="line"><a name="l00131"></a><span class="lineno"> 131</span>  <span class="keywordflow">if</span> (max < value)</div> | |
222 | <div class="line"><a name="l00132"></a><span class="lineno"> 132</span>  max = value;</div> | |
223 | <div class="line"><a name="l00133"></a><span class="lineno"> 133</span>  <span class="keywordflow">else</span> <span class="keywordflow">if</span> (value < min)</div> | |
224 | <div class="line"><a name="l00134"></a><span class="lineno"> 134</span>  min = value;</div> | |
225 | <div class="line"><a name="l00135"></a><span class="lineno"> 135</span>  }</div> | |
226 | <div class="line"><a name="l00136"></a><span class="lineno"> 136</span>  <span class="keywordflow">return</span> sorted;</div> | |
227 | <div class="line"><a name="l00137"></a><span class="lineno"> 137</span>  }</div> | |
228 | <div class="line"><a name="l00138"></a><span class="lineno"> 138</span> </div> | |
229 | <div class="line"><a name="l00139"></a><span class="lineno"> 139</span>  <span class="comment">//Special-case sorting of positive floats with casting</span></div> | |
230 | <div class="line"><a name="l00140"></a><span class="lineno"> 140</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> | |
231 | <div class="line"><a name="l00141"></a><span class="lineno"> 141</span>  <span class="keyword">inline</span> <span class="keywordtype">void</span></div> | |
232 | <div class="line"><a name="l00142"></a><span class="lineno"><a class="line" href="namespaceboost_1_1sort_1_1detail.html#a3b8a896e29139b047fb1886262d124ab"> 142</a></span>  <a class="code" href="namespaceboost_1_1sort_1_1detail.html#a3b8a896e29139b047fb1886262d124ab">positive_float_sort_rec</a>(RandomAccessIter first, RandomAccessIter last,</div> | |
233 | <div class="line"><a name="l00143"></a><span class="lineno"> 143</span>  std::vector<RandomAccessIter> &bin_cache, <span class="keywordtype">unsigned</span> cache_offset</div> | |
234 | <div class="line"><a name="l00144"></a><span class="lineno"> 144</span>  , <span class="keywordtype">size_t</span> *bin_sizes)</div> | |
235 | <div class="line"><a name="l00145"></a><span class="lineno"> 145</span>  {</div> | |
236 | <div class="line"><a name="l00146"></a><span class="lineno"> 146</span>  Div_type max, min;</div> | |
237 | <div class="line"><a name="l00147"></a><span class="lineno"> 147</span>  <span class="keywordflow">if</span> (is_sorted_or_find_extremes<RandomAccessIter, Div_type>(first, last, </div> | |
238 | <div class="line"><a name="l00148"></a><span class="lineno"> 148</span>  max, min))</div> | |
239 | <div class="line"><a name="l00149"></a><span class="lineno"> 149</span>  <span class="keywordflow">return</span>;</div> | |
240 | <div class="line"><a name="l00150"></a><span class="lineno"> 150</span>  <span class="keywordtype">unsigned</span> log_divisor = get_log_divisor<float_log_mean_bin_size>(</div> | |
241 | <div class="line"><a name="l00151"></a><span class="lineno"> 151</span>  last - first, <a class="code" href="namespaceboost_1_1sort_1_1detail.html#a852a51cde62aa67347cb9b4a7350bbac">rough_log_2_size</a>(Size_type(max - min)));</div> | |
242 | <div class="line"><a name="l00152"></a><span class="lineno"> 152</span>  Div_type div_min = min >> log_divisor;</div> | |
243 | <div class="line"><a name="l00153"></a><span class="lineno"> 153</span>  Div_type div_max = max >> log_divisor;</div> | |
244 | <div class="line"><a name="l00154"></a><span class="lineno"> 154</span>  <span class="keywordtype">unsigned</span> bin_count = unsigned(div_max - div_min) + 1;</div> | |
245 | <div class="line"><a name="l00155"></a><span class="lineno"> 155</span>  <span class="keywordtype">unsigned</span> cache_end;</div> | |
246 | <div class="line"><a name="l00156"></a><span class="lineno"> 156</span>  RandomAccessIter * bins = <a class="code" href="namespaceboost_1_1sort_1_1detail.html#ad5b7d31fba809eae5d17f5c2fb0a385b">size_bins</a>(bin_sizes, bin_cache, cache_offset,</div> | |
247 | <div class="line"><a name="l00157"></a><span class="lineno"> 157</span>  cache_end, bin_count);</div> | |
248 | <div class="line"><a name="l00158"></a><span class="lineno"> 158</span> </div> | |
249 | <div class="line"><a name="l00159"></a><span class="lineno"> 159</span>  <span class="comment">//Calculating the size of each bin</span></div> | |
250 | <div class="line"><a name="l00160"></a><span class="lineno"> 160</span>  <span class="keywordflow">for</span> (RandomAccessIter current = first; current != last;)</div> | |
251 | <div class="line"><a name="l00161"></a><span class="lineno"> 161</span>  bin_sizes[<span class="keywordtype">unsigned</span>((cast_float_iter<Div_type, RandomAccessIter>(</div> | |
252 | <div class="line"><a name="l00162"></a><span class="lineno"> 162</span>  current++) >> log_divisor) - div_min)]++;</div> | |
253 | <div class="line"><a name="l00163"></a><span class="lineno"> 163</span>  bins[0] = first;</div> | |
254 | <div class="line"><a name="l00164"></a><span class="lineno"> 164</span>  <span class="keywordflow">for</span> (<span class="keywordtype">unsigned</span> u = 0; u < bin_count - 1; u++)</div> | |
255 | <div class="line"><a name="l00165"></a><span class="lineno"> 165</span>  bins[u + 1] = bins[u] + bin_sizes[u];</div> | |
256 | <div class="line"><a name="l00166"></a><span class="lineno"> 166</span> </div> | |
257 | <div class="line"><a name="l00167"></a><span class="lineno"> 167</span> </div> | |
258 | <div class="line"><a name="l00168"></a><span class="lineno"> 168</span>  <span class="comment">//Swap into place</span></div> | |
259 | <div class="line"><a name="l00169"></a><span class="lineno"> 169</span>  RandomAccessIter nextbinstart = first;</div> | |
260 | <div class="line"><a name="l00170"></a><span class="lineno"> 170</span>  <span class="keywordflow">for</span> (<span class="keywordtype">unsigned</span> u = 0; u < bin_count - 1; ++u)</div> | |
261 | <div class="line"><a name="l00171"></a><span class="lineno"> 171</span>  float_swap_loop<RandomAccessIter, Div_type></div> | |
262 | <div class="line"><a name="l00172"></a><span class="lineno"> 172</span>  (bins, nextbinstart, u, bin_sizes, log_divisor, div_min);</div> | |
263 | <div class="line"><a name="l00173"></a><span class="lineno"> 173</span>  bins[bin_count - 1] = last;</div> | |
264 | <div class="line"><a name="l00174"></a><span class="lineno"> 174</span> </div> | |
265 | <div class="line"><a name="l00175"></a><span class="lineno"> 175</span>  <span class="comment">//Return if we've completed bucketsorting</span></div> | |
266 | <div class="line"><a name="l00176"></a><span class="lineno"> 176</span>  <span class="keywordflow">if</span> (!log_divisor)</div> | |
267 | <div class="line"><a name="l00177"></a><span class="lineno"> 177</span>  <span class="keywordflow">return</span>;</div> | |
268 | <div class="line"><a name="l00178"></a><span class="lineno"> 178</span> </div> | |
269 | <div class="line"><a name="l00179"></a><span class="lineno"> 179</span>  <span class="comment">//Recursing</span></div> | |
270 | <div class="line"><a name="l00180"></a><span class="lineno"> 180</span>  <span class="keywordtype">size_t</span> max_count = <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#a7bbd2027f75936442318063f34953907a0631b5d90d6ff0f1ff5370c616047a33">float_log_mean_bin_size</a>,</div> | |
271 | <div class="line"><a name="l00181"></a><span class="lineno"> 181</span>  <a class="code" href="namespaceboost_1_1sort_1_1detail.html#a7bbd2027f75936442318063f34953907aa0ee6e920e1d3d09e148ce00a985340c">float_log_min_split_count</a>,</div> | |
272 | <div class="line"><a name="l00182"></a><span class="lineno"> 182</span>  <a class="code" href="namespaceboost_1_1sort_1_1detail.html#a7bbd2027f75936442318063f34953907a498b754f6198248703d3907562207d28">float_log_finishing_count</a>>(log_divisor);</div> | |
273 | <div class="line"><a name="l00183"></a><span class="lineno"> 183</span>  RandomAccessIter lastPos = first;</div> | |
274 | <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> | |
275 | <div class="line"><a name="l00185"></a><span class="lineno"> 185</span>  ++u) {</div> | |
276 | <div class="line"><a name="l00186"></a><span class="lineno"> 186</span>  <span class="keywordtype">size_t</span> count = bin_cache[u] - lastPos;</div> | |
277 | <div class="line"><a name="l00187"></a><span class="lineno"> 187</span>  <span class="keywordflow">if</span> (count < 2)</div> | |
278 | <div class="line"><a name="l00188"></a><span class="lineno"> 188</span>  <span class="keywordflow">continue</span>;</div> | |
279 | <div class="line"><a name="l00189"></a><span class="lineno"> 189</span>  <span class="keywordflow">if</span> (count < max_count)</div> | |
280 | <div class="line"><a name="l00190"></a><span class="lineno"> 190</span>  std::sort(lastPos, bin_cache[u]);</div> | |
281 | <div class="line"><a name="l00191"></a><span class="lineno"> 191</span>  <span class="keywordflow">else</span></div> | |
282 | <div class="line"><a name="l00192"></a><span class="lineno"> 192</span>  positive_float_sort_rec<RandomAccessIter, Div_type, Size_type></div> | |
283 | <div class="line"><a name="l00193"></a><span class="lineno"> 193</span>  (lastPos, bin_cache[u], bin_cache, cache_end, bin_sizes);</div> | |
284 | <div class="line"><a name="l00194"></a><span class="lineno"> 194</span>  }</div> | |
285 | <div class="line"><a name="l00195"></a><span class="lineno"> 195</span>  }</div> | |
286 | <div class="line"><a name="l00196"></a><span class="lineno"> 196</span> </div> | |
287 | <div class="line"><a name="l00197"></a><span class="lineno"> 197</span>  <span class="comment">//Sorting negative floats</span></div> | |
288 | <div class="line"><a name="l00198"></a><span class="lineno"> 198</span>  <span class="comment">//Bins are iterated in reverse because max_neg_float = min_neg_int</span></div> | |
289 | <div class="line"><a name="l00199"></a><span class="lineno"> 199</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> | |
290 | <div class="line"><a name="l00200"></a><span class="lineno"> 200</span>  <span class="keyword">inline</span> <span class="keywordtype">void</span></div> | |
291 | <div class="line"><a name="l00201"></a><span class="lineno"><a class="line" href="namespaceboost_1_1sort_1_1detail.html#a6b85a606f35ef97e23c7f8aed1c655b9"> 201</a></span>  <a class="code" href="namespaceboost_1_1sort_1_1detail.html#a6b85a606f35ef97e23c7f8aed1c655b9">negative_float_sort_rec</a>(RandomAccessIter first, RandomAccessIter last,</div> | |
292 | <div class="line"><a name="l00202"></a><span class="lineno"> 202</span>  std::vector<RandomAccessIter> &bin_cache,</div> | |
293 | <div class="line"><a name="l00203"></a><span class="lineno"> 203</span>  <span class="keywordtype">unsigned</span> cache_offset, <span class="keywordtype">size_t</span> *bin_sizes)</div> | |
294 | <div class="line"><a name="l00204"></a><span class="lineno"> 204</span>  {</div> | |
295 | <div class="line"><a name="l00205"></a><span class="lineno"> 205</span>  Div_type max, min;</div> | |
296 | <div class="line"><a name="l00206"></a><span class="lineno"> 206</span>  <span class="keywordflow">if</span> (is_sorted_or_find_extremes<RandomAccessIter, Div_type>(first, last, </div> | |
297 | <div class="line"><a name="l00207"></a><span class="lineno"> 207</span>  max, min))</div> | |
298 | <div class="line"><a name="l00208"></a><span class="lineno"> 208</span>  <span class="keywordflow">return</span>;</div> | |
299 | <div class="line"><a name="l00209"></a><span class="lineno"> 209</span>  <span class="keywordtype">unsigned</span> log_divisor = get_log_divisor<float_log_mean_bin_size>(</div> | |
300 | <div class="line"><a name="l00210"></a><span class="lineno"> 210</span>  last - first, <a class="code" href="namespaceboost_1_1sort_1_1detail.html#a852a51cde62aa67347cb9b4a7350bbac">rough_log_2_size</a>(Size_type(max - min)));</div> | |
301 | <div class="line"><a name="l00211"></a><span class="lineno"> 211</span>  Div_type div_min = min >> log_divisor;</div> | |
302 | <div class="line"><a name="l00212"></a><span class="lineno"> 212</span>  Div_type div_max = max >> log_divisor;</div> | |
303 | <div class="line"><a name="l00213"></a><span class="lineno"> 213</span>  <span class="keywordtype">unsigned</span> bin_count = unsigned(div_max - div_min) + 1;</div> | |
304 | <div class="line"><a name="l00214"></a><span class="lineno"> 214</span>  <span class="keywordtype">unsigned</span> cache_end;</div> | |
305 | <div class="line"><a name="l00215"></a><span class="lineno"> 215</span>  RandomAccessIter * bins = <a class="code" href="namespaceboost_1_1sort_1_1detail.html#ad5b7d31fba809eae5d17f5c2fb0a385b">size_bins</a>(bin_sizes, bin_cache, cache_offset,</div> | |
306 | <div class="line"><a name="l00216"></a><span class="lineno"> 216</span>  cache_end, bin_count);</div> | |
307 | <div class="line"><a name="l00217"></a><span class="lineno"> 217</span> </div> | |
308 | <div class="line"><a name="l00218"></a><span class="lineno"> 218</span>  <span class="comment">//Calculating the size of each bin</span></div> | |
309 | <div class="line"><a name="l00219"></a><span class="lineno"> 219</span>  <span class="keywordflow">for</span> (RandomAccessIter current = first; current != last;)</div> | |
310 | <div class="line"><a name="l00220"></a><span class="lineno"> 220</span>  bin_sizes[<span class="keywordtype">unsigned</span>((cast_float_iter<Div_type, RandomAccessIter>(</div> | |
311 | <div class="line"><a name="l00221"></a><span class="lineno"> 221</span>  current++) >> log_divisor) - div_min)]++;</div> | |
312 | <div class="line"><a name="l00222"></a><span class="lineno"> 222</span>  bins[bin_count - 1] = first;</div> | |
313 | <div class="line"><a name="l00223"></a><span class="lineno"> 223</span>  <span class="keywordflow">for</span> (<span class="keywordtype">int</span> ii = bin_count - 2; ii >= 0; --ii)</div> | |
314 | <div class="line"><a name="l00224"></a><span class="lineno"> 224</span>  bins[ii] = bins[ii + 1] + bin_sizes[ii + 1];</div> | |
315 | <div class="line"><a name="l00225"></a><span class="lineno"> 225</span> </div> | |
316 | <div class="line"><a name="l00226"></a><span class="lineno"> 226</span>  <span class="comment">//Swap into place</span></div> | |
317 | <div class="line"><a name="l00227"></a><span class="lineno"> 227</span>  RandomAccessIter nextbinstart = first;</div> | |
318 | <div class="line"><a name="l00228"></a><span class="lineno"> 228</span>  <span class="comment">//The last bin will always have the correct elements in it</span></div> | |
319 | <div class="line"><a name="l00229"></a><span class="lineno"> 229</span>  <span class="keywordflow">for</span> (<span class="keywordtype">int</span> ii = bin_count - 1; ii > 0; --ii)</div> | |
320 | <div class="line"><a name="l00230"></a><span class="lineno"> 230</span>  float_swap_loop<RandomAccessIter, Div_type></div> | |
321 | <div class="line"><a name="l00231"></a><span class="lineno"> 231</span>  (bins, nextbinstart, ii, bin_sizes, log_divisor, div_min);</div> | |
322 | <div class="line"><a name="l00232"></a><span class="lineno"> 232</span>  <span class="comment">//Update the end position because we don't process the last bin</span></div> | |
323 | <div class="line"><a name="l00233"></a><span class="lineno"> 233</span>  bin_cache[cache_offset] = last;</div> | |
324 | <div class="line"><a name="l00234"></a><span class="lineno"> 234</span> </div> | |
325 | <div class="line"><a name="l00235"></a><span class="lineno"> 235</span>  <span class="comment">//Return if we've completed bucketsorting</span></div> | |
326 | <div class="line"><a name="l00236"></a><span class="lineno"> 236</span>  <span class="keywordflow">if</span> (!log_divisor)</div> | |
327 | <div class="line"><a name="l00237"></a><span class="lineno"> 237</span>  <span class="keywordflow">return</span>;</div> | |
328 | <div class="line"><a name="l00238"></a><span class="lineno"> 238</span> </div> | |
329 | <div class="line"><a name="l00239"></a><span class="lineno"> 239</span>  <span class="comment">//Recursing</span></div> | |
330 | <div class="line"><a name="l00240"></a><span class="lineno"> 240</span>  <span class="keywordtype">size_t</span> max_count = <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#a7bbd2027f75936442318063f34953907a0631b5d90d6ff0f1ff5370c616047a33">float_log_mean_bin_size</a>,</div> | |
331 | <div class="line"><a name="l00241"></a><span class="lineno"> 241</span>  <a class="code" href="namespaceboost_1_1sort_1_1detail.html#a7bbd2027f75936442318063f34953907aa0ee6e920e1d3d09e148ce00a985340c">float_log_min_split_count</a>,</div> | |
332 | <div class="line"><a name="l00242"></a><span class="lineno"> 242</span>  <a class="code" href="namespaceboost_1_1sort_1_1detail.html#a7bbd2027f75936442318063f34953907a498b754f6198248703d3907562207d28">float_log_finishing_count</a>>(log_divisor);</div> | |
333 | <div class="line"><a name="l00243"></a><span class="lineno"> 243</span>  RandomAccessIter lastPos = first;</div> | |
334 | <div class="line"><a name="l00244"></a><span class="lineno"> 244</span>  <span class="keywordflow">for</span> (<span class="keywordtype">int</span> ii = cache_end - 1; ii >= <span class="keyword">static_cast<</span><span class="keywordtype">int</span><span class="keyword">></span>(cache_offset);</div> | |
335 | <div class="line"><a name="l00245"></a><span class="lineno"> 245</span>  lastPos = bin_cache[ii], --ii) {</div> | |
336 | <div class="line"><a name="l00246"></a><span class="lineno"> 246</span>  <span class="keywordtype">size_t</span> count = bin_cache[ii] - lastPos;</div> | |
337 | <div class="line"><a name="l00247"></a><span class="lineno"> 247</span>  <span class="keywordflow">if</span> (count < 2)</div> | |
338 | <div class="line"><a name="l00248"></a><span class="lineno"> 248</span>  <span class="keywordflow">continue</span>;</div> | |
339 | <div class="line"><a name="l00249"></a><span class="lineno"> 249</span>  <span class="keywordflow">if</span> (count < max_count)</div> | |
340 | <div class="line"><a name="l00250"></a><span class="lineno"> 250</span>  std::sort(lastPos, bin_cache[ii]);</div> | |
341 | <div class="line"><a name="l00251"></a><span class="lineno"> 251</span>  <span class="keywordflow">else</span></div> | |
342 | <div class="line"><a name="l00252"></a><span class="lineno"> 252</span>  negative_float_sort_rec<RandomAccessIter, Div_type, Size_type></div> | |
343 | <div class="line"><a name="l00253"></a><span class="lineno"> 253</span>  (lastPos, bin_cache[ii], bin_cache, cache_end, bin_sizes);</div> | |
344 | <div class="line"><a name="l00254"></a><span class="lineno"> 254</span>  }</div> | |
345 | <div class="line"><a name="l00255"></a><span class="lineno"> 255</span>  }</div> | |
346 | <div class="line"><a name="l00256"></a><span class="lineno"> 256</span> </div> | |
347 | <div class="line"><a name="l00257"></a><span class="lineno"> 257</span>  <span class="comment">//Sorting negative floats</span></div> | |
348 | <div class="line"><a name="l00258"></a><span class="lineno"> 258</span>  <span class="comment">//Bins are iterated in reverse order because max_neg_float = min_neg_int</span></div> | |
349 | <div class="line"><a name="l00259"></a><span class="lineno"> 259</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> | |
350 | <div class="line"><a name="l00260"></a><span class="lineno"> 260</span>  <span class="keyword">class </span>Size_type></div> | |
351 | <div class="line"><a name="l00261"></a><span class="lineno"> 261</span>  <span class="keyword">inline</span> <span class="keywordtype">void</span></div> | |
352 | <div class="line"><a name="l00262"></a><span class="lineno"><a class="line" href="namespaceboost_1_1sort_1_1detail.html#af7cc04cc70debc73a6bdbde6552b556c"> 262</a></span>  <a class="code" href="namespaceboost_1_1sort_1_1detail.html#a6b85a606f35ef97e23c7f8aed1c655b9">negative_float_sort_rec</a>(RandomAccessIter first, RandomAccessIter last,</div> | |
353 | <div class="line"><a name="l00263"></a><span class="lineno"> 263</span>  std::vector<RandomAccessIter> &bin_cache, <span class="keywordtype">unsigned</span> cache_offset</div> | |
354 | <div class="line"><a name="l00264"></a><span class="lineno"> 264</span>  , <span class="keywordtype">size_t</span> *bin_sizes, Right_shift rshift)</div> | |
355 | <div class="line"><a name="l00265"></a><span class="lineno"> 265</span>  {</div> | |
356 | <div class="line"><a name="l00266"></a><span class="lineno"> 266</span>  Div_type max, min;</div> | |
357 | <div class="line"><a name="l00267"></a><span class="lineno"> 267</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, rshift))</div> | |
358 | <div class="line"><a name="l00268"></a><span class="lineno"> 268</span>  <span class="keywordflow">return</span>;</div> | |
359 | <div class="line"><a name="l00269"></a><span class="lineno"> 269</span>  <span class="keywordtype">unsigned</span> log_divisor = get_log_divisor<float_log_mean_bin_size>(</div> | |
360 | <div class="line"><a name="l00270"></a><span class="lineno"> 270</span>  last - first, <a class="code" href="namespaceboost_1_1sort_1_1detail.html#a852a51cde62aa67347cb9b4a7350bbac">rough_log_2_size</a>(Size_type(max - min)));</div> | |
361 | <div class="line"><a name="l00271"></a><span class="lineno"> 271</span>  Div_type div_min = min >> log_divisor;</div> | |
362 | <div class="line"><a name="l00272"></a><span class="lineno"> 272</span>  Div_type div_max = max >> log_divisor;</div> | |
363 | <div class="line"><a name="l00273"></a><span class="lineno"> 273</span>  <span class="keywordtype">unsigned</span> bin_count = unsigned(div_max - div_min) + 1;</div> | |
364 | <div class="line"><a name="l00274"></a><span class="lineno"> 274</span>  <span class="keywordtype">unsigned</span> cache_end;</div> | |
365 | <div class="line"><a name="l00275"></a><span class="lineno"> 275</span>  RandomAccessIter * bins = <a class="code" href="namespaceboost_1_1sort_1_1detail.html#ad5b7d31fba809eae5d17f5c2fb0a385b">size_bins</a>(bin_sizes, bin_cache, cache_offset,</div> | |
366 | <div class="line"><a name="l00276"></a><span class="lineno"> 276</span>  cache_end, bin_count);</div> | |
367 | <div class="line"><a name="l00277"></a><span class="lineno"> 277</span> </div> | |
368 | <div class="line"><a name="l00278"></a><span class="lineno"> 278</span>  <span class="comment">//Calculating the size of each bin</span></div> | |
369 | <div class="line"><a name="l00279"></a><span class="lineno"> 279</span>  <span class="keywordflow">for</span> (RandomAccessIter current = first; current != last;)</div> | |
370 | <div class="line"><a name="l00280"></a><span class="lineno"> 280</span>  bin_sizes[<span class="keywordtype">unsigned</span>(rshift(*(current++), log_divisor) - div_min)]++;</div> | |
371 | <div class="line"><a name="l00281"></a><span class="lineno"> 281</span>  bins[bin_count - 1] = first;</div> | |
372 | <div class="line"><a name="l00282"></a><span class="lineno"> 282</span>  <span class="keywordflow">for</span> (<span class="keywordtype">int</span> ii = bin_count - 2; ii >= 0; --ii)</div> | |
373 | <div class="line"><a name="l00283"></a><span class="lineno"> 283</span>  bins[ii] = bins[ii + 1] + bin_sizes[ii + 1];</div> | |
374 | <div class="line"><a name="l00284"></a><span class="lineno"> 284</span> </div> | |
375 | <div class="line"><a name="l00285"></a><span class="lineno"> 285</span>  <span class="comment">//Swap into place</span></div> | |
376 | <div class="line"><a name="l00286"></a><span class="lineno"> 286</span>  RandomAccessIter nextbinstart = first;</div> | |
377 | <div class="line"><a name="l00287"></a><span class="lineno"> 287</span>  <span class="comment">//The last bin will always have the correct elements in it</span></div> | |
378 | <div class="line"><a name="l00288"></a><span class="lineno"> 288</span>  <span class="keywordflow">for</span> (<span class="keywordtype">int</span> ii = bin_count - 1; ii > 0; --ii)</div> | |
379 | <div class="line"><a name="l00289"></a><span class="lineno"> 289</span>  swap_loop<RandomAccessIter, Div_type, Right_shift></div> | |
380 | <div class="line"><a name="l00290"></a><span class="lineno"> 290</span>  (bins, nextbinstart, ii, rshift, bin_sizes, log_divisor, div_min);</div> | |
381 | <div class="line"><a name="l00291"></a><span class="lineno"> 291</span>  <span class="comment">//Update the end position of the unprocessed last bin</span></div> | |
382 | <div class="line"><a name="l00292"></a><span class="lineno"> 292</span>  bin_cache[cache_offset] = last;</div> | |
383 | <div class="line"><a name="l00293"></a><span class="lineno"> 293</span> </div> | |
384 | <div class="line"><a name="l00294"></a><span class="lineno"> 294</span>  <span class="comment">//Return if we've completed bucketsorting</span></div> | |
385 | <div class="line"><a name="l00295"></a><span class="lineno"> 295</span>  <span class="keywordflow">if</span> (!log_divisor)</div> | |
386 | <div class="line"><a name="l00296"></a><span class="lineno"> 296</span>  <span class="keywordflow">return</span>;</div> | |
387 | <div class="line"><a name="l00297"></a><span class="lineno"> 297</span> </div> | |
388 | <div class="line"><a name="l00298"></a><span class="lineno"> 298</span>  <span class="comment">//Recursing</span></div> | |
389 | <div class="line"><a name="l00299"></a><span class="lineno"> 299</span>  <span class="keywordtype">size_t</span> max_count = <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#a7bbd2027f75936442318063f34953907a0631b5d90d6ff0f1ff5370c616047a33">float_log_mean_bin_size</a>,</div> | |
390 | <div class="line"><a name="l00300"></a><span class="lineno"> 300</span>  <a class="code" href="namespaceboost_1_1sort_1_1detail.html#a7bbd2027f75936442318063f34953907aa0ee6e920e1d3d09e148ce00a985340c">float_log_min_split_count</a>,</div> | |
391 | <div class="line"><a name="l00301"></a><span class="lineno"> 301</span>  <a class="code" href="namespaceboost_1_1sort_1_1detail.html#a7bbd2027f75936442318063f34953907a498b754f6198248703d3907562207d28">float_log_finishing_count</a>>(log_divisor);</div> | |
392 | <div class="line"><a name="l00302"></a><span class="lineno"> 302</span>  RandomAccessIter lastPos = first;</div> | |
393 | <div class="line"><a name="l00303"></a><span class="lineno"> 303</span>  <span class="keywordflow">for</span> (<span class="keywordtype">int</span> ii = cache_end - 1; ii >= <span class="keyword">static_cast<</span><span class="keywordtype">int</span><span class="keyword">></span>(cache_offset);</div> | |
394 | <div class="line"><a name="l00304"></a><span class="lineno"> 304</span>  lastPos = bin_cache[ii], --ii) {</div> | |
395 | <div class="line"><a name="l00305"></a><span class="lineno"> 305</span>  <span class="keywordtype">size_t</span> count = bin_cache[ii] - lastPos;</div> | |
396 | <div class="line"><a name="l00306"></a><span class="lineno"> 306</span>  <span class="keywordflow">if</span> (count < 2)</div> | |
397 | <div class="line"><a name="l00307"></a><span class="lineno"> 307</span>  <span class="keywordflow">continue</span>;</div> | |
398 | <div class="line"><a name="l00308"></a><span class="lineno"> 308</span>  <span class="keywordflow">if</span> (count < max_count)</div> | |
399 | <div class="line"><a name="l00309"></a><span class="lineno"> 309</span>  std::sort(lastPos, bin_cache[ii]);</div> | |
400 | <div class="line"><a name="l00310"></a><span class="lineno"> 310</span>  <span class="keywordflow">else</span></div> | |
401 | <div class="line"><a name="l00311"></a><span class="lineno"> 311</span>  <a class="code" href="namespaceboost_1_1sort_1_1detail.html#a6b85a606f35ef97e23c7f8aed1c655b9">negative_float_sort_rec</a><RandomAccessIter, Div_type, Right_shift,</div> | |
402 | <div class="line"><a name="l00312"></a><span class="lineno"> 312</span>  Size_type></div> | |
403 | <div class="line"><a name="l00313"></a><span class="lineno"> 313</span>  (lastPos, bin_cache[ii], bin_cache, cache_end, bin_sizes, rshift);</div> | |
404 | <div class="line"><a name="l00314"></a><span class="lineno"> 314</span>  }</div> | |
405 | <div class="line"><a name="l00315"></a><span class="lineno"> 315</span>  }</div> | |
406 | <div class="line"><a name="l00316"></a><span class="lineno"> 316</span> </div> | |
407 | <div class="line"><a name="l00317"></a><span class="lineno"> 317</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> | |
408 | <div class="line"><a name="l00318"></a><span class="lineno"> 318</span>  <span class="keyword">class </span>Compare, <span class="keyword">class </span>Size_type></div> | |
409 | <div class="line"><a name="l00319"></a><span class="lineno"> 319</span>  <span class="keyword">inline</span> <span class="keywordtype">void</span></div> | |
410 | <div class="line"><a name="l00320"></a><span class="lineno"><a class="line" href="namespaceboost_1_1sort_1_1detail.html#a3936c51da0154af6003bc491b542fa12"> 320</a></span>  <a class="code" href="namespaceboost_1_1sort_1_1detail.html#a6b85a606f35ef97e23c7f8aed1c655b9">negative_float_sort_rec</a>(RandomAccessIter first, RandomAccessIter last,</div> | |
411 | <div class="line"><a name="l00321"></a><span class="lineno"> 321</span>  std::vector<RandomAccessIter> &bin_cache, <span class="keywordtype">unsigned</span> cache_offset,</div> | |
412 | <div class="line"><a name="l00322"></a><span class="lineno"> 322</span>  <span class="keywordtype">size_t</span> *bin_sizes, Right_shift rshift, Compare comp)</div> | |
413 | <div class="line"><a name="l00323"></a><span class="lineno"> 323</span>  {</div> | |
414 | <div class="line"><a name="l00324"></a><span class="lineno"> 324</span>  Div_type max, min;</div> | |
415 | <div class="line"><a name="l00325"></a><span class="lineno"> 325</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, rshift))</div> | |
416 | <div class="line"><a name="l00326"></a><span class="lineno"> 326</span>  <span class="keywordflow">return</span>;</div> | |
417 | <div class="line"><a name="l00327"></a><span class="lineno"> 327</span>  <span class="keywordtype">unsigned</span> log_divisor = get_log_divisor<float_log_mean_bin_size>(</div> | |
418 | <div class="line"><a name="l00328"></a><span class="lineno"> 328</span>  last - first, <a class="code" href="namespaceboost_1_1sort_1_1detail.html#a852a51cde62aa67347cb9b4a7350bbac">rough_log_2_size</a>(Size_type(max - min)));</div> | |
419 | <div class="line"><a name="l00329"></a><span class="lineno"> 329</span>  Div_type div_min = min >> log_divisor;</div> | |
420 | <div class="line"><a name="l00330"></a><span class="lineno"> 330</span>  Div_type div_max = max >> log_divisor;</div> | |
421 | <div class="line"><a name="l00331"></a><span class="lineno"> 331</span>  <span class="keywordtype">unsigned</span> bin_count = unsigned(div_max - div_min) + 1;</div> | |
422 | <div class="line"><a name="l00332"></a><span class="lineno"> 332</span>  <span class="keywordtype">unsigned</span> cache_end;</div> | |
423 | <div class="line"><a name="l00333"></a><span class="lineno"> 333</span>  RandomAccessIter * bins = <a class="code" href="namespaceboost_1_1sort_1_1detail.html#ad5b7d31fba809eae5d17f5c2fb0a385b">size_bins</a>(bin_sizes, bin_cache, cache_offset,</div> | |
424 | <div class="line"><a name="l00334"></a><span class="lineno"> 334</span>  cache_end, bin_count);</div> | |
425 | <div class="line"><a name="l00335"></a><span class="lineno"> 335</span> </div> | |
426 | <div class="line"><a name="l00336"></a><span class="lineno"> 336</span>  <span class="comment">//Calculating the size of each bin</span></div> | |
427 | <div class="line"><a name="l00337"></a><span class="lineno"> 337</span>  <span class="keywordflow">for</span> (RandomAccessIter current = first; current != last;)</div> | |
428 | <div class="line"><a name="l00338"></a><span class="lineno"> 338</span>  bin_sizes[<span class="keywordtype">unsigned</span>(rshift(*(current++), log_divisor) - div_min)]++;</div> | |
429 | <div class="line"><a name="l00339"></a><span class="lineno"> 339</span>  bins[bin_count - 1] = first;</div> | |
430 | <div class="line"><a name="l00340"></a><span class="lineno"> 340</span>  <span class="keywordflow">for</span> (<span class="keywordtype">int</span> ii = bin_count - 2; ii >= 0; --ii)</div> | |
431 | <div class="line"><a name="l00341"></a><span class="lineno"> 341</span>  bins[ii] = bins[ii + 1] + bin_sizes[ii + 1];</div> | |
432 | <div class="line"><a name="l00342"></a><span class="lineno"> 342</span> </div> | |
433 | <div class="line"><a name="l00343"></a><span class="lineno"> 343</span>  <span class="comment">//Swap into place</span></div> | |
434 | <div class="line"><a name="l00344"></a><span class="lineno"> 344</span>  RandomAccessIter nextbinstart = first;</div> | |
435 | <div class="line"><a name="l00345"></a><span class="lineno"> 345</span>  <span class="comment">//The last bin will always have the correct elements in it</span></div> | |
436 | <div class="line"><a name="l00346"></a><span class="lineno"> 346</span>  <span class="keywordflow">for</span> (<span class="keywordtype">int</span> ii = bin_count - 1; ii > 0; --ii)</div> | |
437 | <div class="line"><a name="l00347"></a><span class="lineno"> 347</span>  swap_loop<RandomAccessIter, Div_type, Right_shift></div> | |
438 | <div class="line"><a name="l00348"></a><span class="lineno"> 348</span>  (bins, nextbinstart, ii, rshift, bin_sizes, log_divisor, div_min);</div> | |
439 | <div class="line"><a name="l00349"></a><span class="lineno"> 349</span>  <span class="comment">//Update the end position of the unprocessed last bin</span></div> | |
440 | <div class="line"><a name="l00350"></a><span class="lineno"> 350</span>  bin_cache[cache_offset] = last;</div> | |
441 | <div class="line"><a name="l00351"></a><span class="lineno"> 351</span> </div> | |
442 | <div class="line"><a name="l00352"></a><span class="lineno"> 352</span>  <span class="comment">//Return if we've completed bucketsorting</span></div> | |
443 | <div class="line"><a name="l00353"></a><span class="lineno"> 353</span>  <span class="keywordflow">if</span> (!log_divisor)</div> | |
444 | <div class="line"><a name="l00354"></a><span class="lineno"> 354</span>  <span class="keywordflow">return</span>;</div> | |
445 | <div class="line"><a name="l00355"></a><span class="lineno"> 355</span> </div> | |
446 | <div class="line"><a name="l00356"></a><span class="lineno"> 356</span>  <span class="comment">//Recursing</span></div> | |
447 | <div class="line"><a name="l00357"></a><span class="lineno"> 357</span>  <span class="keywordtype">size_t</span> max_count = <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#a7bbd2027f75936442318063f34953907a0631b5d90d6ff0f1ff5370c616047a33">float_log_mean_bin_size</a>,</div> | |
448 | <div class="line"><a name="l00358"></a><span class="lineno"> 358</span>  <a class="code" href="namespaceboost_1_1sort_1_1detail.html#a7bbd2027f75936442318063f34953907aa0ee6e920e1d3d09e148ce00a985340c">float_log_min_split_count</a>,</div> | |
449 | <div class="line"><a name="l00359"></a><span class="lineno"> 359</span>  <a class="code" href="namespaceboost_1_1sort_1_1detail.html#a7bbd2027f75936442318063f34953907a498b754f6198248703d3907562207d28">float_log_finishing_count</a>>(log_divisor);</div> | |
450 | <div class="line"><a name="l00360"></a><span class="lineno"> 360</span>  RandomAccessIter lastPos = first;</div> | |
451 | <div class="line"><a name="l00361"></a><span class="lineno"> 361</span>  <span class="keywordflow">for</span> (<span class="keywordtype">int</span> ii = cache_end - 1; ii >= <span class="keyword">static_cast<</span><span class="keywordtype">int</span><span class="keyword">></span>(cache_offset);</div> | |
452 | <div class="line"><a name="l00362"></a><span class="lineno"> 362</span>  lastPos = bin_cache[ii], --ii) {</div> | |
453 | <div class="line"><a name="l00363"></a><span class="lineno"> 363</span>  <span class="keywordtype">size_t</span> count = bin_cache[ii] - lastPos;</div> | |
454 | <div class="line"><a name="l00364"></a><span class="lineno"> 364</span>  <span class="keywordflow">if</span> (count < 2)</div> | |
455 | <div class="line"><a name="l00365"></a><span class="lineno"> 365</span>  <span class="keywordflow">continue</span>;</div> | |
456 | <div class="line"><a name="l00366"></a><span class="lineno"> 366</span>  <span class="keywordflow">if</span> (count < max_count)</div> | |
457 | <div class="line"><a name="l00367"></a><span class="lineno"> 367</span>  std::sort(lastPos, bin_cache[ii], comp);</div> | |
458 | <div class="line"><a name="l00368"></a><span class="lineno"> 368</span>  <span class="keywordflow">else</span></div> | |
459 | <div class="line"><a name="l00369"></a><span class="lineno"> 369</span>  <a class="code" href="namespaceboost_1_1sort_1_1detail.html#a6b85a606f35ef97e23c7f8aed1c655b9">negative_float_sort_rec</a><RandomAccessIter, Div_type, Right_shift,</div> | |
460 | <div class="line"><a name="l00370"></a><span class="lineno"> 370</span>  Compare, Size_type>(lastPos, bin_cache[ii],</div> | |
461 | <div class="line"><a name="l00371"></a><span class="lineno"> 371</span>  bin_cache, cache_end,</div> | |
462 | <div class="line"><a name="l00372"></a><span class="lineno"> 372</span>  bin_sizes, rshift, comp);</div> | |
463 | <div class="line"><a name="l00373"></a><span class="lineno"> 373</span>  }</div> | |
464 | <div class="line"><a name="l00374"></a><span class="lineno"> 374</span>  }</div> | |
465 | <div class="line"><a name="l00375"></a><span class="lineno"> 375</span> </div> | |
466 | <div class="line"><a name="l00376"></a><span class="lineno"> 376</span>  <span class="comment">//Casting special-case for floating-point sorting</span></div> | |
467 | <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, <span class="keyword">class</span> Size_type></div> | |
468 | <div class="line"><a name="l00378"></a><span class="lineno"> 378</span>  <span class="keyword">inline</span> <span class="keywordtype">void</span></div> | |
469 | <div class="line"><a name="l00379"></a><span class="lineno"><a class="line" href="namespaceboost_1_1sort_1_1detail.html#a1faa4283ebb64ba23c4a73c1c0a6548a"> 379</a></span>  <a class="code" href="namespaceboost_1_1sort_1_1detail.html#a1faa4283ebb64ba23c4a73c1c0a6548a">float_sort_rec</a>(RandomAccessIter first, RandomAccessIter last,</div> | |
470 | <div class="line"><a name="l00380"></a><span class="lineno"> 380</span>  std::vector<RandomAccessIter> &bin_cache, <span class="keywordtype">unsigned</span> cache_offset</div> | |
471 | <div class="line"><a name="l00381"></a><span class="lineno"> 381</span>  , <span class="keywordtype">size_t</span> *bin_sizes)</div> | |
472 | <div class="line"><a name="l00382"></a><span class="lineno"> 382</span>  {</div> | |
473 | <div class="line"><a name="l00383"></a><span class="lineno"> 383</span>  Div_type max, min;</div> | |
474 | <div class="line"><a name="l00384"></a><span class="lineno"> 384</span>  <span class="keywordflow">if</span> (is_sorted_or_find_extremes<RandomAccessIter, Div_type>(first, last, </div> | |
475 | <div class="line"><a name="l00385"></a><span class="lineno"> 385</span>  max, min))</div> | |
476 | <div class="line"><a name="l00386"></a><span class="lineno"> 386</span>  <span class="keywordflow">return</span>;</div> | |
477 | <div class="line"><a name="l00387"></a><span class="lineno"> 387</span>  <span class="keywordtype">unsigned</span> log_divisor = get_log_divisor<float_log_mean_bin_size>(</div> | |
478 | <div class="line"><a name="l00388"></a><span class="lineno"> 388</span>  last - first, <a class="code" href="namespaceboost_1_1sort_1_1detail.html#a852a51cde62aa67347cb9b4a7350bbac">rough_log_2_size</a>(Size_type(max - min)));</div> | |
479 | <div class="line"><a name="l00389"></a><span class="lineno"> 389</span>  Div_type div_min = min >> log_divisor;</div> | |
480 | <div class="line"><a name="l00390"></a><span class="lineno"> 390</span>  Div_type div_max = max >> log_divisor;</div> | |
481 | <div class="line"><a name="l00391"></a><span class="lineno"> 391</span>  <span class="keywordtype">unsigned</span> bin_count = unsigned(div_max - div_min) + 1;</div> | |
482 | <div class="line"><a name="l00392"></a><span class="lineno"> 392</span>  <span class="keywordtype">unsigned</span> cache_end;</div> | |
483 | <div class="line"><a name="l00393"></a><span class="lineno"> 393</span>  RandomAccessIter * bins = <a class="code" href="namespaceboost_1_1sort_1_1detail.html#ad5b7d31fba809eae5d17f5c2fb0a385b">size_bins</a>(bin_sizes, bin_cache, cache_offset,</div> | |
484 | <div class="line"><a name="l00394"></a><span class="lineno"> 394</span>  cache_end, bin_count);</div> | |
485 | <div class="line"><a name="l00395"></a><span class="lineno"> 395</span> </div> | |
486 | <div class="line"><a name="l00396"></a><span class="lineno"> 396</span>  <span class="comment">//Calculating the size of each bin</span></div> | |
487 | <div class="line"><a name="l00397"></a><span class="lineno"> 397</span>  <span class="keywordflow">for</span> (RandomAccessIter current = first; current != last;)</div> | |
488 | <div class="line"><a name="l00398"></a><span class="lineno"> 398</span>  bin_sizes[<span class="keywordtype">unsigned</span>((cast_float_iter<Div_type, RandomAccessIter>(</div> | |
489 | <div class="line"><a name="l00399"></a><span class="lineno"> 399</span>  current++) >> log_divisor) - div_min)]++;</div> | |
490 | <div class="line"><a name="l00400"></a><span class="lineno"> 400</span>  <span class="comment">//The index of the first positive bin</span></div> | |
491 | <div class="line"><a name="l00401"></a><span class="lineno"> 401</span>  <span class="comment">//Must be divided small enough to fit into an integer</span></div> | |
492 | <div class="line"><a name="l00402"></a><span class="lineno"> 402</span>  <span class="keywordtype">unsigned</span> first_positive = (div_min < 0) ? <span class="keywordtype">unsigned</span>(-div_min) : 0;</div> | |
493 | <div class="line"><a name="l00403"></a><span class="lineno"> 403</span>  <span class="comment">//Resetting if all bins are negative</span></div> | |
494 | <div class="line"><a name="l00404"></a><span class="lineno"> 404</span>  <span class="keywordflow">if</span> (cache_offset + first_positive > cache_end)</div> | |
495 | <div class="line"><a name="l00405"></a><span class="lineno"> 405</span>  first_positive = cache_end - cache_offset;</div> | |
496 | <div class="line"><a name="l00406"></a><span class="lineno"> 406</span>  <span class="comment">//Reversing the order of the negative bins</span></div> | |
497 | <div class="line"><a name="l00407"></a><span class="lineno"> 407</span>  <span class="comment">//Note that because of the negative/positive ordering direction flip</span></div> | |
498 | <div class="line"><a name="l00408"></a><span class="lineno"> 408</span>  <span class="comment">//We can not depend upon bin order and positions matching up</span></div> | |
499 | <div class="line"><a name="l00409"></a><span class="lineno"> 409</span>  <span class="comment">//so bin_sizes must be reused to contain the end of the bin</span></div> | |
500 | <div class="line"><a name="l00410"></a><span class="lineno"> 410</span>  <span class="keywordflow">if</span> (first_positive > 0) {</div> | |
501 | <div class="line"><a name="l00411"></a><span class="lineno"> 411</span>  bins[first_positive - 1] = first;</div> | |
502 | <div class="line"><a name="l00412"></a><span class="lineno"> 412</span>  <span class="keywordflow">for</span> (<span class="keywordtype">int</span> ii = first_positive - 2; ii >= 0; --ii) {</div> | |
503 | <div class="line"><a name="l00413"></a><span class="lineno"> 413</span>  bins[ii] = first + bin_sizes[ii + 1];</div> | |
504 | <div class="line"><a name="l00414"></a><span class="lineno"> 414</span>  bin_sizes[ii] += bin_sizes[ii + 1];</div> | |
505 | <div class="line"><a name="l00415"></a><span class="lineno"> 415</span>  }</div> | |
506 | <div class="line"><a name="l00416"></a><span class="lineno"> 416</span>  <span class="comment">//Handling positives following negatives</span></div> | |
507 | <div class="line"><a name="l00417"></a><span class="lineno"> 417</span>  <span class="keywordflow">if</span> (first_positive < bin_count) {</div> | |
508 | <div class="line"><a name="l00418"></a><span class="lineno"> 418</span>  bins[first_positive] = first + bin_sizes[0];</div> | |
509 | <div class="line"><a name="l00419"></a><span class="lineno"> 419</span>  bin_sizes[first_positive] += bin_sizes[0];</div> | |
510 | <div class="line"><a name="l00420"></a><span class="lineno"> 420</span>  }</div> | |
511 | <div class="line"><a name="l00421"></a><span class="lineno"> 421</span>  }</div> | |
512 | <div class="line"><a name="l00422"></a><span class="lineno"> 422</span>  <span class="keywordflow">else</span></div> | |
513 | <div class="line"><a name="l00423"></a><span class="lineno"> 423</span>  bins[0] = first;</div> | |
514 | <div class="line"><a name="l00424"></a><span class="lineno"> 424</span>  <span class="keywordflow">for</span> (<span class="keywordtype">unsigned</span> u = first_positive; u < bin_count - 1; u++) {</div> | |
515 | <div class="line"><a name="l00425"></a><span class="lineno"> 425</span>  bins[u + 1] = first + bin_sizes[u];</div> | |
516 | <div class="line"><a name="l00426"></a><span class="lineno"> 426</span>  bin_sizes[u + 1] += bin_sizes[u];</div> | |
517 | <div class="line"><a name="l00427"></a><span class="lineno"> 427</span>  }</div> | |
518 | <div class="line"><a name="l00428"></a><span class="lineno"> 428</span> </div> | |
519 | <div class="line"><a name="l00429"></a><span class="lineno"> 429</span>  <span class="comment">//Swap into place</span></div> | |
520 | <div class="line"><a name="l00430"></a><span class="lineno"> 430</span>  RandomAccessIter nextbinstart = first;</div> | |
521 | <div class="line"><a name="l00431"></a><span class="lineno"> 431</span>  <span class="keywordflow">for</span> (<span class="keywordtype">unsigned</span> u = 0; u < bin_count; ++u) {</div> | |
522 | <div class="line"><a name="l00432"></a><span class="lineno"> 432</span>  nextbinstart = first + bin_sizes[u];</div> | |
523 | <div class="line"><a name="l00433"></a><span class="lineno"> 433</span>  inner_float_swap_loop<RandomAccessIter, Div_type></div> | |
524 | <div class="line"><a name="l00434"></a><span class="lineno"> 434</span>  (bins, nextbinstart, u, log_divisor, div_min);</div> | |
525 | <div class="line"><a name="l00435"></a><span class="lineno"> 435</span>  }</div> | |
526 | <div class="line"><a name="l00436"></a><span class="lineno"> 436</span> </div> | |
527 | <div class="line"><a name="l00437"></a><span class="lineno"> 437</span>  <span class="keywordflow">if</span> (!log_divisor)</div> | |
528 | <div class="line"><a name="l00438"></a><span class="lineno"> 438</span>  <span class="keywordflow">return</span>;</div> | |
529 | <div class="line"><a name="l00439"></a><span class="lineno"> 439</span> </div> | |
530 | <div class="line"><a name="l00440"></a><span class="lineno"> 440</span>  <span class="comment">//Handling negative values first</span></div> | |
531 | <div class="line"><a name="l00441"></a><span class="lineno"> 441</span>  <span class="keywordtype">size_t</span> max_count = <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#a7bbd2027f75936442318063f34953907a0631b5d90d6ff0f1ff5370c616047a33">float_log_mean_bin_size</a>,</div> | |
532 | <div class="line"><a name="l00442"></a><span class="lineno"> 442</span>  <a class="code" href="namespaceboost_1_1sort_1_1detail.html#a7bbd2027f75936442318063f34953907aa0ee6e920e1d3d09e148ce00a985340c">float_log_min_split_count</a>,</div> | |
533 | <div class="line"><a name="l00443"></a><span class="lineno"> 443</span>  <a class="code" href="namespaceboost_1_1sort_1_1detail.html#a7bbd2027f75936442318063f34953907a498b754f6198248703d3907562207d28">float_log_finishing_count</a>>(log_divisor);</div> | |
534 | <div class="line"><a name="l00444"></a><span class="lineno"> 444</span>  RandomAccessIter lastPos = first;</div> | |
535 | <div class="line"><a name="l00445"></a><span class="lineno"> 445</span>  <span class="keywordflow">for</span> (<span class="keywordtype">int</span> ii = cache_offset + first_positive - 1; </div> | |
536 | <div class="line"><a name="l00446"></a><span class="lineno"> 446</span>  ii >= <span class="keyword">static_cast<</span><span class="keywordtype">int</span><span class="keyword">></span>(cache_offset);</div> | |
537 | <div class="line"><a name="l00447"></a><span class="lineno"> 447</span>  lastPos = bin_cache[ii--]) {</div> | |
538 | <div class="line"><a name="l00448"></a><span class="lineno"> 448</span>  <span class="keywordtype">size_t</span> count = bin_cache[ii] - lastPos;</div> | |
539 | <div class="line"><a name="l00449"></a><span class="lineno"> 449</span>  <span class="keywordflow">if</span> (count < 2)</div> | |
540 | <div class="line"><a name="l00450"></a><span class="lineno"> 450</span>  <span class="keywordflow">continue</span>;</div> | |
541 | <div class="line"><a name="l00451"></a><span class="lineno"> 451</span>  <span class="keywordflow">if</span> (count < max_count)</div> | |
542 | <div class="line"><a name="l00452"></a><span class="lineno"> 452</span>  std::sort(lastPos, bin_cache[ii]);</div> | |
543 | <div class="line"><a name="l00453"></a><span class="lineno"> 453</span>  <span class="comment">//sort negative values using reversed-bin spreadsort</span></div> | |
544 | <div class="line"><a name="l00454"></a><span class="lineno"> 454</span>  <span class="keywordflow">else</span></div> | |
545 | <div class="line"><a name="l00455"></a><span class="lineno"> 455</span>  negative_float_sort_rec<RandomAccessIter, Div_type, Size_type></div> | |
546 | <div class="line"><a name="l00456"></a><span class="lineno"> 456</span>  (lastPos, bin_cache[ii], bin_cache, cache_end, bin_sizes);</div> | |
547 | <div class="line"><a name="l00457"></a><span class="lineno"> 457</span>  }</div> | |
548 | <div class="line"><a name="l00458"></a><span class="lineno"> 458</span> </div> | |
549 | <div class="line"><a name="l00459"></a><span class="lineno"> 459</span>  <span class="keywordflow">for</span> (<span class="keywordtype">unsigned</span> u = cache_offset + first_positive; u < cache_end;</div> | |
550 | <div class="line"><a name="l00460"></a><span class="lineno"> 460</span>  lastPos = bin_cache[u], ++u) {</div> | |
551 | <div class="line"><a name="l00461"></a><span class="lineno"> 461</span>  <span class="keywordtype">size_t</span> count = bin_cache[u] - lastPos;</div> | |
552 | <div class="line"><a name="l00462"></a><span class="lineno"> 462</span>  <span class="keywordflow">if</span> (count < 2)</div> | |
553 | <div class="line"><a name="l00463"></a><span class="lineno"> 463</span>  <span class="keywordflow">continue</span>;</div> | |
554 | <div class="line"><a name="l00464"></a><span class="lineno"> 464</span>  <span class="keywordflow">if</span> (count < max_count)</div> | |
555 | <div class="line"><a name="l00465"></a><span class="lineno"> 465</span>  std::sort(lastPos, bin_cache[u]);</div> | |
556 | <div class="line"><a name="l00466"></a><span class="lineno"> 466</span>  <span class="comment">//sort positive values using normal spreadsort</span></div> | |
557 | <div class="line"><a name="l00467"></a><span class="lineno"> 467</span>  <span class="keywordflow">else</span></div> | |
558 | <div class="line"><a name="l00468"></a><span class="lineno"> 468</span>  positive_float_sort_rec<RandomAccessIter, Div_type, Size_type></div> | |
559 | <div class="line"><a name="l00469"></a><span class="lineno"> 469</span>  (lastPos, bin_cache[u], bin_cache, cache_end, bin_sizes);</div> | |
560 | <div class="line"><a name="l00470"></a><span class="lineno"> 470</span>  }</div> | |
561 | <div class="line"><a name="l00471"></a><span class="lineno"> 471</span>  }</div> | |
562 | <div class="line"><a name="l00472"></a><span class="lineno"> 472</span> </div> | |
563 | <div class="line"><a name="l00473"></a><span class="lineno"> 473</span>  <span class="comment">//Functor implementation for recursive sorting</span></div> | |
564 | <div class="line"><a name="l00474"></a><span class="lineno"> 474</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> | |
565 | <div class="line"><a name="l00475"></a><span class="lineno"> 475</span>  , <span class="keyword">class </span>Size_type></div> | |
566 | <div class="line"><a name="l00476"></a><span class="lineno"> 476</span>  <span class="keyword">inline</span> <span class="keywordtype">void</span></div> | |
567 | <div class="line"><a name="l00477"></a><span class="lineno"><a class="line" href="namespaceboost_1_1sort_1_1detail.html#a85d8622f809c9c5ee535890de4aa9ff3"> 477</a></span>  <a class="code" href="namespaceboost_1_1sort_1_1detail.html#a1faa4283ebb64ba23c4a73c1c0a6548a">float_sort_rec</a>(RandomAccessIter first, RandomAccessIter last,</div> | |
568 | <div class="line"><a name="l00478"></a><span class="lineno"> 478</span>  std::vector<RandomAccessIter> &bin_cache, <span class="keywordtype">unsigned</span> cache_offset</div> | |
569 | <div class="line"><a name="l00479"></a><span class="lineno"> 479</span>  , <span class="keywordtype">size_t</span> *bin_sizes, Right_shift rshift)</div> | |
570 | <div class="line"><a name="l00480"></a><span class="lineno"> 480</span>  {</div> | |
571 | <div class="line"><a name="l00481"></a><span class="lineno"> 481</span>  Div_type max, min;</div> | |
572 | <div class="line"><a name="l00482"></a><span class="lineno"> 482</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, rshift))</div> | |
573 | <div class="line"><a name="l00483"></a><span class="lineno"> 483</span>  <span class="keywordflow">return</span>;</div> | |
574 | <div class="line"><a name="l00484"></a><span class="lineno"> 484</span>  <span class="keywordtype">unsigned</span> log_divisor = get_log_divisor<float_log_mean_bin_size>(</div> | |
575 | <div class="line"><a name="l00485"></a><span class="lineno"> 485</span>  last - first, <a class="code" href="namespaceboost_1_1sort_1_1detail.html#a852a51cde62aa67347cb9b4a7350bbac">rough_log_2_size</a>(Size_type(max - min)));</div> | |
576 | <div class="line"><a name="l00486"></a><span class="lineno"> 486</span>  Div_type div_min = min >> log_divisor;</div> | |
577 | <div class="line"><a name="l00487"></a><span class="lineno"> 487</span>  Div_type div_max = max >> log_divisor;</div> | |
578 | <div class="line"><a name="l00488"></a><span class="lineno"> 488</span>  <span class="keywordtype">unsigned</span> bin_count = unsigned(div_max - div_min) + 1;</div> | |
579 | <div class="line"><a name="l00489"></a><span class="lineno"> 489</span>  <span class="keywordtype">unsigned</span> cache_end;</div> | |
580 | <div class="line"><a name="l00490"></a><span class="lineno"> 490</span>  RandomAccessIter * bins = <a class="code" href="namespaceboost_1_1sort_1_1detail.html#ad5b7d31fba809eae5d17f5c2fb0a385b">size_bins</a>(bin_sizes, bin_cache, cache_offset,</div> | |
581 | <div class="line"><a name="l00491"></a><span class="lineno"> 491</span>  cache_end, bin_count);</div> | |
582 | <div class="line"><a name="l00492"></a><span class="lineno"> 492</span> </div> | |
583 | <div class="line"><a name="l00493"></a><span class="lineno"> 493</span>  <span class="comment">//Calculating the size of each bin</span></div> | |
584 | <div class="line"><a name="l00494"></a><span class="lineno"> 494</span>  <span class="keywordflow">for</span> (RandomAccessIter current = first; current != last;)</div> | |
585 | <div class="line"><a name="l00495"></a><span class="lineno"> 495</span>  bin_sizes[<span class="keywordtype">unsigned</span>(rshift(*(current++), log_divisor) - div_min)]++;</div> | |
586 | <div class="line"><a name="l00496"></a><span class="lineno"> 496</span>  <span class="comment">//The index of the first positive bin</span></div> | |
587 | <div class="line"><a name="l00497"></a><span class="lineno"> 497</span>  <span class="keywordtype">unsigned</span> first_positive = (div_min < 0) ? <span class="keywordtype">unsigned</span>(-div_min) : 0;</div> | |
588 | <div class="line"><a name="l00498"></a><span class="lineno"> 498</span>  <span class="comment">//Resetting if all bins are negative</span></div> | |
589 | <div class="line"><a name="l00499"></a><span class="lineno"> 499</span>  <span class="keywordflow">if</span> (cache_offset + first_positive > cache_end)</div> | |
590 | <div class="line"><a name="l00500"></a><span class="lineno"> 500</span>  first_positive = cache_end - cache_offset;</div> | |
591 | <div class="line"><a name="l00501"></a><span class="lineno"> 501</span>  <span class="comment">//Reversing the order of the negative bins</span></div> | |
592 | <div class="line"><a name="l00502"></a><span class="lineno"> 502</span>  <span class="comment">//Note that because of the negative/positive ordering direction flip</span></div> | |
593 | <div class="line"><a name="l00503"></a><span class="lineno"> 503</span>  <span class="comment">//We can not depend upon bin order and positions matching up</span></div> | |
594 | <div class="line"><a name="l00504"></a><span class="lineno"> 504</span>  <span class="comment">//so bin_sizes must be reused to contain the end of the bin</span></div> | |
595 | <div class="line"><a name="l00505"></a><span class="lineno"> 505</span>  <span class="keywordflow">if</span> (first_positive > 0) {</div> | |
596 | <div class="line"><a name="l00506"></a><span class="lineno"> 506</span>  bins[first_positive - 1] = first;</div> | |
597 | <div class="line"><a name="l00507"></a><span class="lineno"> 507</span>  <span class="keywordflow">for</span> (<span class="keywordtype">int</span> ii = first_positive - 2; ii >= 0; --ii) {</div> | |
598 | <div class="line"><a name="l00508"></a><span class="lineno"> 508</span>  bins[ii] = first + bin_sizes[ii + 1];</div> | |
599 | <div class="line"><a name="l00509"></a><span class="lineno"> 509</span>  bin_sizes[ii] += bin_sizes[ii + 1];</div> | |
600 | <div class="line"><a name="l00510"></a><span class="lineno"> 510</span>  }</div> | |
601 | <div class="line"><a name="l00511"></a><span class="lineno"> 511</span>  <span class="comment">//Handling positives following negatives</span></div> | |
602 | <div class="line"><a name="l00512"></a><span class="lineno"> 512</span>  <span class="keywordflow">if</span> (static_cast<unsigned>(first_positive) < bin_count) {</div> | |
603 | <div class="line"><a name="l00513"></a><span class="lineno"> 513</span>  bins[first_positive] = first + bin_sizes[0];</div> | |
604 | <div class="line"><a name="l00514"></a><span class="lineno"> 514</span>  bin_sizes[first_positive] += bin_sizes[0];</div> | |
605 | <div class="line"><a name="l00515"></a><span class="lineno"> 515</span>  }</div> | |
606 | <div class="line"><a name="l00516"></a><span class="lineno"> 516</span>  }</div> | |
607 | <div class="line"><a name="l00517"></a><span class="lineno"> 517</span>  <span class="keywordflow">else</span></div> | |
608 | <div class="line"><a name="l00518"></a><span class="lineno"> 518</span>  bins[0] = first;</div> | |
609 | <div class="line"><a name="l00519"></a><span class="lineno"> 519</span>  <span class="keywordflow">for</span> (<span class="keywordtype">unsigned</span> u = first_positive; u < bin_count - 1; u++) {</div> | |
610 | <div class="line"><a name="l00520"></a><span class="lineno"> 520</span>  bins[u + 1] = first + bin_sizes[u];</div> | |
611 | <div class="line"><a name="l00521"></a><span class="lineno"> 521</span>  bin_sizes[u + 1] += bin_sizes[u];</div> | |
612 | <div class="line"><a name="l00522"></a><span class="lineno"> 522</span>  }</div> | |
613 | <div class="line"><a name="l00523"></a><span class="lineno"> 523</span> </div> | |
614 | <div class="line"><a name="l00524"></a><span class="lineno"> 524</span>  <span class="comment">//Swap into place</span></div> | |
615 | <div class="line"><a name="l00525"></a><span class="lineno"> 525</span>  RandomAccessIter next_bin_start = first;</div> | |
616 | <div class="line"><a name="l00526"></a><span class="lineno"> 526</span>  <span class="keywordflow">for</span> (<span class="keywordtype">unsigned</span> u = 0; u < bin_count; ++u) {</div> | |
617 | <div class="line"><a name="l00527"></a><span class="lineno"> 527</span>  next_bin_start = first + bin_sizes[u];</div> | |
618 | <div class="line"><a name="l00528"></a><span class="lineno"> 528</span>  inner_swap_loop<RandomAccessIter, Div_type, Right_shift></div> | |
619 | <div class="line"><a name="l00529"></a><span class="lineno"> 529</span>  (bins, next_bin_start, u, rshift, log_divisor, div_min);</div> | |
620 | <div class="line"><a name="l00530"></a><span class="lineno"> 530</span>  }</div> | |
621 | <div class="line"><a name="l00531"></a><span class="lineno"> 531</span> </div> | |
622 | <div class="line"><a name="l00532"></a><span class="lineno"> 532</span>  <span class="comment">//Return if we've completed bucketsorting</span></div> | |
623 | <div class="line"><a name="l00533"></a><span class="lineno"> 533</span>  <span class="keywordflow">if</span> (!log_divisor)</div> | |
624 | <div class="line"><a name="l00534"></a><span class="lineno"> 534</span>  <span class="keywordflow">return</span>;</div> | |
625 | <div class="line"><a name="l00535"></a><span class="lineno"> 535</span> </div> | |
626 | <div class="line"><a name="l00536"></a><span class="lineno"> 536</span>  <span class="comment">//Handling negative values first</span></div> | |
627 | <div class="line"><a name="l00537"></a><span class="lineno"> 537</span>  <span class="keywordtype">size_t</span> max_count = <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#a7bbd2027f75936442318063f34953907a0631b5d90d6ff0f1ff5370c616047a33">float_log_mean_bin_size</a>,</div> | |
628 | <div class="line"><a name="l00538"></a><span class="lineno"> 538</span>  <a class="code" href="namespaceboost_1_1sort_1_1detail.html#a7bbd2027f75936442318063f34953907aa0ee6e920e1d3d09e148ce00a985340c">float_log_min_split_count</a>,</div> | |
629 | <div class="line"><a name="l00539"></a><span class="lineno"> 539</span>  <a class="code" href="namespaceboost_1_1sort_1_1detail.html#a7bbd2027f75936442318063f34953907a498b754f6198248703d3907562207d28">float_log_finishing_count</a>>(log_divisor);</div> | |
630 | <div class="line"><a name="l00540"></a><span class="lineno"> 540</span>  RandomAccessIter lastPos = first;</div> | |
631 | <div class="line"><a name="l00541"></a><span class="lineno"> 541</span>  <span class="keywordflow">for</span> (<span class="keywordtype">int</span> ii = cache_offset + first_positive - 1; </div> | |
632 | <div class="line"><a name="l00542"></a><span class="lineno"> 542</span>  ii >= <span class="keyword">static_cast<</span><span class="keywordtype">int</span><span class="keyword">></span>(cache_offset);</div> | |
633 | <div class="line"><a name="l00543"></a><span class="lineno"> 543</span>  lastPos = bin_cache[ii--]) {</div> | |
634 | <div class="line"><a name="l00544"></a><span class="lineno"> 544</span>  <span class="keywordtype">size_t</span> count = bin_cache[ii] - lastPos;</div> | |
635 | <div class="line"><a name="l00545"></a><span class="lineno"> 545</span>  <span class="keywordflow">if</span> (count < 2)</div> | |
636 | <div class="line"><a name="l00546"></a><span class="lineno"> 546</span>  <span class="keywordflow">continue</span>;</div> | |
637 | <div class="line"><a name="l00547"></a><span class="lineno"> 547</span>  <span class="keywordflow">if</span> (count < max_count)</div> | |
638 | <div class="line"><a name="l00548"></a><span class="lineno"> 548</span>  std::sort(lastPos, bin_cache[ii]);</div> | |
639 | <div class="line"><a name="l00549"></a><span class="lineno"> 549</span>  <span class="comment">//sort negative values using reversed-bin spreadsort</span></div> | |
640 | <div class="line"><a name="l00550"></a><span class="lineno"> 550</span>  <span class="keywordflow">else</span></div> | |
641 | <div class="line"><a name="l00551"></a><span class="lineno"> 551</span>  <a class="code" href="namespaceboost_1_1sort_1_1detail.html#a6b85a606f35ef97e23c7f8aed1c655b9">negative_float_sort_rec</a><RandomAccessIter, Div_type,</div> | |
642 | <div class="line"><a name="l00552"></a><span class="lineno"> 552</span>  Right_shift, Size_type>(lastPos, bin_cache[ii], bin_cache,</div> | |
643 | <div class="line"><a name="l00553"></a><span class="lineno"> 553</span>  cache_end, bin_sizes, rshift);</div> | |
644 | <div class="line"><a name="l00554"></a><span class="lineno"> 554</span>  }</div> | |
645 | <div class="line"><a name="l00555"></a><span class="lineno"> 555</span> </div> | |
646 | <div class="line"><a name="l00556"></a><span class="lineno"> 556</span>  <span class="keywordflow">for</span> (<span class="keywordtype">unsigned</span> u = cache_offset + first_positive; u < cache_end;</div> | |
647 | <div class="line"><a name="l00557"></a><span class="lineno"> 557</span>  lastPos = bin_cache[u], ++u) {</div> | |
648 | <div class="line"><a name="l00558"></a><span class="lineno"> 558</span>  <span class="keywordtype">size_t</span> count = bin_cache[u] - lastPos;</div> | |
649 | <div class="line"><a name="l00559"></a><span class="lineno"> 559</span>  <span class="keywordflow">if</span> (count < 2)</div> | |
650 | <div class="line"><a name="l00560"></a><span class="lineno"> 560</span>  <span class="keywordflow">continue</span>;</div> | |
651 | <div class="line"><a name="l00561"></a><span class="lineno"> 561</span>  <span class="keywordflow">if</span> (count < max_count)</div> | |
652 | <div class="line"><a name="l00562"></a><span class="lineno"> 562</span>  std::sort(lastPos, bin_cache[u]);</div> | |
653 | <div class="line"><a name="l00563"></a><span class="lineno"> 563</span>  <span class="comment">//sort positive values using normal spreadsort</span></div> | |
654 | <div class="line"><a name="l00564"></a><span class="lineno"> 564</span>  <span class="keywordflow">else</span></div> | |
655 | <div class="line"><a name="l00565"></a><span class="lineno"> 565</span>  spreadsort_rec<RandomAccessIter, Div_type, Right_shift, Size_type,</div> | |
656 | <div class="line"><a name="l00566"></a><span class="lineno"> 566</span>  <a class="code" href="namespaceboost_1_1sort_1_1detail.html#a7bbd2027f75936442318063f34953907a0631b5d90d6ff0f1ff5370c616047a33">float_log_mean_bin_size</a>, <a class="code" href="namespaceboost_1_1sort_1_1detail.html#a7bbd2027f75936442318063f34953907aa0ee6e920e1d3d09e148ce00a985340c">float_log_min_split_count</a>,</div> | |
657 | <div class="line"><a name="l00567"></a><span class="lineno"> 567</span>  <a class="code" href="namespaceboost_1_1sort_1_1detail.html#a7bbd2027f75936442318063f34953907a498b754f6198248703d3907562207d28">float_log_finishing_count</a>></div> | |
658 | <div class="line"><a name="l00568"></a><span class="lineno"> 568</span>  (lastPos, bin_cache[u], bin_cache, cache_end, bin_sizes, rshift);</div> | |
659 | <div class="line"><a name="l00569"></a><span class="lineno"> 569</span>  }</div> | |
660 | <div class="line"><a name="l00570"></a><span class="lineno"> 570</span>  }</div> | |
661 | <div class="line"><a name="l00571"></a><span class="lineno"> 571</span> </div> | |
662 | <div class="line"><a name="l00572"></a><span class="lineno"> 572</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> | |
663 | <div class="line"><a name="l00573"></a><span class="lineno"> 573</span>  <span class="keyword">class </span>Compare, <span class="keyword">class </span>Size_type></div> | |
664 | <div class="line"><a name="l00574"></a><span class="lineno"> 574</span>  <span class="keyword">inline</span> <span class="keywordtype">void</span></div> | |
665 | <div class="line"><a name="l00575"></a><span class="lineno"><a class="line" href="namespaceboost_1_1sort_1_1detail.html#a7b984ddce7638d78d26ea22cea08f2e7"> 575</a></span>  <a class="code" href="namespaceboost_1_1sort_1_1detail.html#a1faa4283ebb64ba23c4a73c1c0a6548a">float_sort_rec</a>(RandomAccessIter first, RandomAccessIter last,</div> | |
666 | <div class="line"><a name="l00576"></a><span class="lineno"> 576</span>  std::vector<RandomAccessIter> &bin_cache, <span class="keywordtype">unsigned</span> cache_offset,</div> | |
667 | <div class="line"><a name="l00577"></a><span class="lineno"> 577</span>  <span class="keywordtype">size_t</span> *bin_sizes, Right_shift rshift, Compare comp)</div> | |
668 | <div class="line"><a name="l00578"></a><span class="lineno"> 578</span>  {</div> | |
669 | <div class="line"><a name="l00579"></a><span class="lineno"> 579</span>  Div_type max, min;</div> | |
670 | <div class="line"><a name="l00580"></a><span class="lineno"> 580</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, rshift))</div> | |
671 | <div class="line"><a name="l00581"></a><span class="lineno"> 581</span>  <span class="keywordflow">return</span>;</div> | |
672 | <div class="line"><a name="l00582"></a><span class="lineno"> 582</span>  <span class="keywordtype">unsigned</span> log_divisor = get_log_divisor<float_log_mean_bin_size>(</div> | |
673 | <div class="line"><a name="l00583"></a><span class="lineno"> 583</span>  last - first, <a class="code" href="namespaceboost_1_1sort_1_1detail.html#a852a51cde62aa67347cb9b4a7350bbac">rough_log_2_size</a>(Size_type(max - min)));</div> | |
674 | <div class="line"><a name="l00584"></a><span class="lineno"> 584</span>  Div_type div_min = min >> log_divisor;</div> | |
675 | <div class="line"><a name="l00585"></a><span class="lineno"> 585</span>  Div_type div_max = max >> log_divisor;</div> | |
676 | <div class="line"><a name="l00586"></a><span class="lineno"> 586</span>  <span class="keywordtype">unsigned</span> bin_count = unsigned(div_max - div_min) + 1;</div> | |
677 | <div class="line"><a name="l00587"></a><span class="lineno"> 587</span>  <span class="keywordtype">unsigned</span> cache_end;</div> | |
678 | <div class="line"><a name="l00588"></a><span class="lineno"> 588</span>  RandomAccessIter * bins = <a class="code" href="namespaceboost_1_1sort_1_1detail.html#ad5b7d31fba809eae5d17f5c2fb0a385b">size_bins</a>(bin_sizes, bin_cache, cache_offset,</div> | |
679 | <div class="line"><a name="l00589"></a><span class="lineno"> 589</span>  cache_end, bin_count);</div> | |
680 | <div class="line"><a name="l00590"></a><span class="lineno"> 590</span> </div> | |
681 | <div class="line"><a name="l00591"></a><span class="lineno"> 591</span>  <span class="comment">//Calculating the size of each bin</span></div> | |
682 | <div class="line"><a name="l00592"></a><span class="lineno"> 592</span>  <span class="keywordflow">for</span> (RandomAccessIter current = first; current != last;)</div> | |
683 | <div class="line"><a name="l00593"></a><span class="lineno"> 593</span>  bin_sizes[<span class="keywordtype">unsigned</span>(rshift(*(current++), log_divisor) - div_min)]++;</div> | |
684 | <div class="line"><a name="l00594"></a><span class="lineno"> 594</span>  <span class="comment">//The index of the first positive bin</span></div> | |
685 | <div class="line"><a name="l00595"></a><span class="lineno"> 595</span>  <span class="keywordtype">unsigned</span> first_positive = </div> | |
686 | <div class="line"><a name="l00596"></a><span class="lineno"> 596</span>  (div_min < 0) ? static_cast<unsigned>(-div_min) : 0;</div> | |
687 | <div class="line"><a name="l00597"></a><span class="lineno"> 597</span>  <span class="comment">//Resetting if all bins are negative</span></div> | |
688 | <div class="line"><a name="l00598"></a><span class="lineno"> 598</span>  <span class="keywordflow">if</span> (cache_offset + first_positive > cache_end)</div> | |
689 | <div class="line"><a name="l00599"></a><span class="lineno"> 599</span>  first_positive = cache_end - cache_offset;</div> | |
690 | <div class="line"><a name="l00600"></a><span class="lineno"> 600</span>  <span class="comment">//Reversing the order of the negative bins</span></div> | |
691 | <div class="line"><a name="l00601"></a><span class="lineno"> 601</span>  <span class="comment">//Note that because of the negative/positive ordering direction flip</span></div> | |
692 | <div class="line"><a name="l00602"></a><span class="lineno"> 602</span>  <span class="comment">//We can not depend upon bin order and positions matching up</span></div> | |
693 | <div class="line"><a name="l00603"></a><span class="lineno"> 603</span>  <span class="comment">//so bin_sizes must be reused to contain the end of the bin</span></div> | |
694 | <div class="line"><a name="l00604"></a><span class="lineno"> 604</span>  <span class="keywordflow">if</span> (first_positive > 0) {</div> | |
695 | <div class="line"><a name="l00605"></a><span class="lineno"> 605</span>  bins[first_positive - 1] = first;</div> | |
696 | <div class="line"><a name="l00606"></a><span class="lineno"> 606</span>  <span class="keywordflow">for</span> (<span class="keywordtype">int</span> ii = first_positive - 2; ii >= 0; --ii) {</div> | |
697 | <div class="line"><a name="l00607"></a><span class="lineno"> 607</span>  bins[ii] = first + bin_sizes[ii + 1];</div> | |
698 | <div class="line"><a name="l00608"></a><span class="lineno"> 608</span>  bin_sizes[ii] += bin_sizes[ii + 1];</div> | |
699 | <div class="line"><a name="l00609"></a><span class="lineno"> 609</span>  }</div> | |
700 | <div class="line"><a name="l00610"></a><span class="lineno"> 610</span>  <span class="comment">//Handling positives following negatives</span></div> | |
701 | <div class="line"><a name="l00611"></a><span class="lineno"> 611</span>  <span class="keywordflow">if</span> (static_cast<unsigned>(first_positive) < bin_count) {</div> | |
702 | <div class="line"><a name="l00612"></a><span class="lineno"> 612</span>  bins[first_positive] = first + bin_sizes[0];</div> | |
703 | <div class="line"><a name="l00613"></a><span class="lineno"> 613</span>  bin_sizes[first_positive] += bin_sizes[0];</div> | |
704 | <div class="line"><a name="l00614"></a><span class="lineno"> 614</span>  }</div> | |
705 | <div class="line"><a name="l00615"></a><span class="lineno"> 615</span>  }</div> | |
706 | <div class="line"><a name="l00616"></a><span class="lineno"> 616</span>  <span class="keywordflow">else</span></div> | |
707 | <div class="line"><a name="l00617"></a><span class="lineno"> 617</span>  bins[0] = first;</div> | |
708 | <div class="line"><a name="l00618"></a><span class="lineno"> 618</span>  <span class="keywordflow">for</span> (<span class="keywordtype">unsigned</span> u = first_positive; u < bin_count - 1; u++) {</div> | |
709 | <div class="line"><a name="l00619"></a><span class="lineno"> 619</span>  bins[u + 1] = first + bin_sizes[u];</div> | |
710 | <div class="line"><a name="l00620"></a><span class="lineno"> 620</span>  bin_sizes[u + 1] += bin_sizes[u];</div> | |
711 | <div class="line"><a name="l00621"></a><span class="lineno"> 621</span>  }</div> | |
712 | <div class="line"><a name="l00622"></a><span class="lineno"> 622</span> </div> | |
713 | <div class="line"><a name="l00623"></a><span class="lineno"> 623</span>  <span class="comment">//Swap into place</span></div> | |
714 | <div class="line"><a name="l00624"></a><span class="lineno"> 624</span>  RandomAccessIter next_bin_start = first;</div> | |
715 | <div class="line"><a name="l00625"></a><span class="lineno"> 625</span>  <span class="keywordflow">for</span> (<span class="keywordtype">unsigned</span> u = 0; u < bin_count; ++u) {</div> | |
716 | <div class="line"><a name="l00626"></a><span class="lineno"> 626</span>  next_bin_start = first + bin_sizes[u];</div> | |
717 | <div class="line"><a name="l00627"></a><span class="lineno"> 627</span>  inner_swap_loop<RandomAccessIter, Div_type, Right_shift></div> | |
718 | <div class="line"><a name="l00628"></a><span class="lineno"> 628</span>  (bins, next_bin_start, u, rshift, log_divisor, div_min);</div> | |
719 | <div class="line"><a name="l00629"></a><span class="lineno"> 629</span>  }</div> | |
720 | <div class="line"><a name="l00630"></a><span class="lineno"> 630</span> </div> | |
721 | <div class="line"><a name="l00631"></a><span class="lineno"> 631</span>  <span class="comment">//Return if we've completed bucketsorting</span></div> | |
722 | <div class="line"><a name="l00632"></a><span class="lineno"> 632</span>  <span class="keywordflow">if</span> (!log_divisor)</div> | |
723 | <div class="line"><a name="l00633"></a><span class="lineno"> 633</span>  <span class="keywordflow">return</span>;</div> | |
724 | <div class="line"><a name="l00634"></a><span class="lineno"> 634</span> </div> | |
725 | <div class="line"><a name="l00635"></a><span class="lineno"> 635</span>  <span class="comment">//Handling negative values first</span></div> | |
726 | <div class="line"><a name="l00636"></a><span class="lineno"> 636</span>  <span class="keywordtype">size_t</span> max_count = <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#a7bbd2027f75936442318063f34953907a0631b5d90d6ff0f1ff5370c616047a33">float_log_mean_bin_size</a>,</div> | |
727 | <div class="line"><a name="l00637"></a><span class="lineno"> 637</span>  <a class="code" href="namespaceboost_1_1sort_1_1detail.html#a7bbd2027f75936442318063f34953907aa0ee6e920e1d3d09e148ce00a985340c">float_log_min_split_count</a>,</div> | |
728 | <div class="line"><a name="l00638"></a><span class="lineno"> 638</span>  <a class="code" href="namespaceboost_1_1sort_1_1detail.html#a7bbd2027f75936442318063f34953907a498b754f6198248703d3907562207d28">float_log_finishing_count</a>>(log_divisor);</div> | |
729 | <div class="line"><a name="l00639"></a><span class="lineno"> 639</span>  RandomAccessIter lastPos = first;</div> | |
730 | <div class="line"><a name="l00640"></a><span class="lineno"> 640</span>  <span class="keywordflow">for</span> (<span class="keywordtype">int</span> ii = cache_offset + first_positive - 1; </div> | |
731 | <div class="line"><a name="l00641"></a><span class="lineno"> 641</span>  ii >= <span class="keyword">static_cast<</span><span class="keywordtype">int</span><span class="keyword">></span>(cache_offset);</div> | |
732 | <div class="line"><a name="l00642"></a><span class="lineno"> 642</span>  lastPos = bin_cache[ii--]) {</div> | |
733 | <div class="line"><a name="l00643"></a><span class="lineno"> 643</span>  <span class="keywordtype">size_t</span> count = bin_cache[ii] - lastPos;</div> | |
734 | <div class="line"><a name="l00644"></a><span class="lineno"> 644</span>  <span class="keywordflow">if</span> (count < 2)</div> | |
735 | <div class="line"><a name="l00645"></a><span class="lineno"> 645</span>  <span class="keywordflow">continue</span>;</div> | |
736 | <div class="line"><a name="l00646"></a><span class="lineno"> 646</span>  <span class="keywordflow">if</span> (count < max_count)</div> | |
737 | <div class="line"><a name="l00647"></a><span class="lineno"> 647</span>  std::sort(lastPos, bin_cache[ii], comp);</div> | |
738 | <div class="line"><a name="l00648"></a><span class="lineno"> 648</span>  <span class="comment">//sort negative values using reversed-bin spreadsort</span></div> | |
739 | <div class="line"><a name="l00649"></a><span class="lineno"> 649</span>  <span class="keywordflow">else</span></div> | |
740 | <div class="line"><a name="l00650"></a><span class="lineno"> 650</span>  <a class="code" href="namespaceboost_1_1sort_1_1detail.html#a6b85a606f35ef97e23c7f8aed1c655b9">negative_float_sort_rec</a><RandomAccessIter, Div_type, Right_shift,</div> | |
741 | <div class="line"><a name="l00651"></a><span class="lineno"> 651</span>  Compare, Size_type>(lastPos, bin_cache[ii],</div> | |
742 | <div class="line"><a name="l00652"></a><span class="lineno"> 652</span>  bin_cache, cache_end,</div> | |
743 | <div class="line"><a name="l00653"></a><span class="lineno"> 653</span>  bin_sizes, rshift, comp);</div> | |
744 | <div class="line"><a name="l00654"></a><span class="lineno"> 654</span>  }</div> | |
745 | <div class="line"><a name="l00655"></a><span class="lineno"> 655</span> </div> | |
746 | <div class="line"><a name="l00656"></a><span class="lineno"> 656</span>  <span class="keywordflow">for</span> (<span class="keywordtype">unsigned</span> u = cache_offset + first_positive; u < cache_end;</div> | |
747 | <div class="line"><a name="l00657"></a><span class="lineno"> 657</span>  lastPos = bin_cache[u], ++u) {</div> | |
748 | <div class="line"><a name="l00658"></a><span class="lineno"> 658</span>  <span class="keywordtype">size_t</span> count = bin_cache[u] - lastPos;</div> | |
749 | <div class="line"><a name="l00659"></a><span class="lineno"> 659</span>  <span class="keywordflow">if</span> (count < 2)</div> | |
750 | <div class="line"><a name="l00660"></a><span class="lineno"> 660</span>  <span class="keywordflow">continue</span>;</div> | |
751 | <div class="line"><a name="l00661"></a><span class="lineno"> 661</span>  <span class="keywordflow">if</span> (count < max_count)</div> | |
752 | <div class="line"><a name="l00662"></a><span class="lineno"> 662</span>  std::sort(lastPos, bin_cache[u], comp);</div> | |
753 | <div class="line"><a name="l00663"></a><span class="lineno"> 663</span>  <span class="comment">//sort positive values using normal spreadsort</span></div> | |
754 | <div class="line"><a name="l00664"></a><span class="lineno"> 664</span>  <span class="keywordflow">else</span></div> | |
755 | <div class="line"><a name="l00665"></a><span class="lineno"> 665</span>  spreadsort_rec<RandomAccessIter, Div_type, Right_shift, Compare,</div> | |
756 | <div class="line"><a name="l00666"></a><span class="lineno"> 666</span>  Size_type, <a class="code" href="namespaceboost_1_1sort_1_1detail.html#a7bbd2027f75936442318063f34953907a0631b5d90d6ff0f1ff5370c616047a33">float_log_mean_bin_size</a>,</div> | |
757 | <div class="line"><a name="l00667"></a><span class="lineno"> 667</span>  <a class="code" href="namespaceboost_1_1sort_1_1detail.html#a7bbd2027f75936442318063f34953907aa0ee6e920e1d3d09e148ce00a985340c">float_log_min_split_count</a>, <a class="code" href="namespaceboost_1_1sort_1_1detail.html#a7bbd2027f75936442318063f34953907a498b754f6198248703d3907562207d28">float_log_finishing_count</a>></div> | |
758 | <div class="line"><a name="l00668"></a><span class="lineno"> 668</span>  (lastPos, bin_cache[u], bin_cache, cache_end, bin_sizes, rshift, comp);</div> | |
759 | <div class="line"><a name="l00669"></a><span class="lineno"> 669</span>  }</div> | |
760 | <div class="line"><a name="l00670"></a><span class="lineno"> 670</span>  }</div> | |
761 | <div class="line"><a name="l00671"></a><span class="lineno"> 671</span> </div> | |
762 | <div class="line"><a name="l00672"></a><span class="lineno"> 672</span>  <span class="comment">//Checking whether the value type is a float, and trying a 32-bit integer</span></div> | |
763 | <div class="line"><a name="l00673"></a><span class="lineno"> 673</span>  <span class="keyword">template</span> <<span class="keyword">class</span> RandomAccessIter></div> | |
764 | <div class="line"><a name="l00674"></a><span class="lineno"> 674</span>  <span class="keyword">inline</span> <span class="keyword">typename</span> boost::enable_if_c< <span class="keyword">sizeof</span>(boost::uint32_t) ==</div> | |
765 | <div class="line"><a name="l00675"></a><span class="lineno"> 675</span>  <span class="keyword">sizeof</span>(<span class="keyword">typename</span> std::iterator_traits<RandomAccessIter>::value_type)</div> | |
766 | <div class="line"><a name="l00676"></a><span class="lineno"> 676</span>  && std::numeric_limits<<span class="keyword">typename</span></div> | |
767 | <div class="line"><a name="l00677"></a><span class="lineno"> 677</span>  std::iterator_traits<RandomAccessIter>::value_type>::is_iec559,</div> | |
768 | <div class="line"><a name="l00678"></a><span class="lineno"> 678</span>  <span class="keywordtype">void</span> >::type</div> | |
769 | <div class="line"><a name="l00679"></a><span class="lineno"><a class="line" href="namespaceboost_1_1sort_1_1detail.html#aaa66aec0efcc4f4a7f5584886e93444b"> 679</a></span>  <a class="code" href="namespaceboost_1_1sort_1_1detail.html#aaa66aec0efcc4f4a7f5584886e93444b">float_sort</a>(RandomAccessIter first, RandomAccessIter last)</div> | |
770 | <div class="line"><a name="l00680"></a><span class="lineno"> 680</span>  {</div> | |
771 | <div class="line"><a name="l00681"></a><span class="lineno"> 681</span>  <span class="keywordtype">size_t</span> bin_sizes[1 << <a class="code" href="namespaceboost_1_1sort_1_1detail.html#a7bbd2027f75936442318063f34953907a17b216febe1b5e8212a80231592fc9d9">max_splits</a>];</div> | |
772 | <div class="line"><a name="l00682"></a><span class="lineno"> 682</span>  std::vector<RandomAccessIter> bin_cache;</div> | |
773 | <div class="line"><a name="l00683"></a><span class="lineno"> 683</span>  float_sort_rec<RandomAccessIter, boost::int32_t, boost::uint32_t></div> | |
774 | <div class="line"><a name="l00684"></a><span class="lineno"> 684</span>  (first, last, bin_cache, 0, bin_sizes);</div> | |
775 | <div class="line"><a name="l00685"></a><span class="lineno"> 685</span>  }</div> | |
776 | <div class="line"><a name="l00686"></a><span class="lineno"> 686</span> </div> | |
777 | <div class="line"><a name="l00687"></a><span class="lineno"> 687</span>  <span class="comment">//Checking whether the value type is a double, and using a 64-bit integer</span></div> | |
778 | <div class="line"><a name="l00688"></a><span class="lineno"> 688</span>  <span class="keyword">template</span> <<span class="keyword">class</span> RandomAccessIter></div> | |
779 | <div class="line"><a name="l00689"></a><span class="lineno"> 689</span>  <span class="keyword">inline</span> <span class="keyword">typename</span> boost::enable_if_c< <span class="keyword">sizeof</span>(boost::uint64_t) ==</div> | |
780 | <div class="line"><a name="l00690"></a><span class="lineno"> 690</span>  <span class="keyword">sizeof</span>(<span class="keyword">typename</span> std::iterator_traits<RandomAccessIter>::value_type)</div> | |
781 | <div class="line"><a name="l00691"></a><span class="lineno"> 691</span>  && std::numeric_limits<<span class="keyword">typename</span></div> | |
782 | <div class="line"><a name="l00692"></a><span class="lineno"> 692</span>  std::iterator_traits<RandomAccessIter>::value_type>::is_iec559,</div> | |
783 | <div class="line"><a name="l00693"></a><span class="lineno"> 693</span>  <span class="keywordtype">void</span> >::type</div> | |
784 | <div class="line"><a name="l00694"></a><span class="lineno"><a class="line" href="namespaceboost_1_1sort_1_1detail.html#aa9667055e88a8492bac9cd1b14cc86e0"> 694</a></span>  <a class="code" href="namespaceboost_1_1sort_1_1detail.html#aaa66aec0efcc4f4a7f5584886e93444b">float_sort</a>(RandomAccessIter first, RandomAccessIter last)</div> | |
785 | <div class="line"><a name="l00695"></a><span class="lineno"> 695</span>  {</div> | |
786 | <div class="line"><a name="l00696"></a><span class="lineno"> 696</span>  <span class="keywordtype">size_t</span> bin_sizes[1 << <a class="code" href="namespaceboost_1_1sort_1_1detail.html#a7bbd2027f75936442318063f34953907a17b216febe1b5e8212a80231592fc9d9">max_splits</a>];</div> | |
787 | <div class="line"><a name="l00697"></a><span class="lineno"> 697</span>  std::vector<RandomAccessIter> bin_cache;</div> | |
788 | <div class="line"><a name="l00698"></a><span class="lineno"> 698</span>  float_sort_rec<RandomAccessIter, boost::int64_t, boost::uint64_t></div> | |
789 | <div class="line"><a name="l00699"></a><span class="lineno"> 699</span>  (first, last, bin_cache, 0, bin_sizes);</div> | |
790 | <div class="line"><a name="l00700"></a><span class="lineno"> 700</span>  }</div> | |
791 | <div class="line"><a name="l00701"></a><span class="lineno"> 701</span> </div> | |
792 | <div class="line"><a name="l00702"></a><span class="lineno"> 702</span>  <span class="keyword">template</span> <<span class="keyword">class</span> RandomAccessIter></div> | |
793 | <div class="line"><a name="l00703"></a><span class="lineno"> 703</span>  <span class="keyword">inline</span> <span class="keyword">typename</span> boost::disable_if_c< (<span class="keyword">sizeof</span>(boost::uint64_t) ==</div> | |
794 | <div class="line"><a name="l00704"></a><span class="lineno"> 704</span>  <span class="keyword">sizeof</span>(<span class="keyword">typename</span> std::iterator_traits<RandomAccessIter>::value_type)</div> | |
795 | <div class="line"><a name="l00705"></a><span class="lineno"> 705</span>  || <span class="keyword">sizeof</span>(boost::uint32_t) ==</div> | |
796 | <div class="line"><a name="l00706"></a><span class="lineno"> 706</span>  <span class="keyword">sizeof</span>(<span class="keyword">typename</span> std::iterator_traits<RandomAccessIter>::value_type))</div> | |
797 | <div class="line"><a name="l00707"></a><span class="lineno"> 707</span>  && std::numeric_limits<<span class="keyword">typename</span></div> | |
798 | <div class="line"><a name="l00708"></a><span class="lineno"> 708</span>  std::iterator_traits<RandomAccessIter>::value_type>::is_iec559,</div> | |
799 | <div class="line"><a name="l00709"></a><span class="lineno"> 709</span>  <span class="keywordtype">void</span> >::type</div> | |
800 | <div class="line"><a name="l00710"></a><span class="lineno"><a class="line" href="namespaceboost_1_1sort_1_1detail.html#a298f19036e85ffc74dbe92d2c26eae77"> 710</a></span>  <a class="code" href="namespaceboost_1_1sort_1_1detail.html#aaa66aec0efcc4f4a7f5584886e93444b">float_sort</a>(RandomAccessIter first, RandomAccessIter last)</div> | |
801 | <div class="line"><a name="l00711"></a><span class="lineno"> 711</span>  {</div> | |
802 | <div class="line"><a name="l00712"></a><span class="lineno"> 712</span>  BOOST_STATIC_WARNING(!(<span class="keyword">sizeof</span>(boost::uint64_t) ==</div> | |
803 | <div class="line"><a name="l00713"></a><span class="lineno"> 713</span>  <span class="keyword">sizeof</span>(<span class="keyword">typename</span> std::iterator_traits<RandomAccessIter>::value_type)</div> | |
804 | <div class="line"><a name="l00714"></a><span class="lineno"> 714</span>  || <span class="keyword">sizeof</span>(boost::uint32_t) ==</div> | |
805 | <div class="line"><a name="l00715"></a><span class="lineno"> 715</span>  <span class="keyword">sizeof</span>(<span class="keyword">typename</span> std::iterator_traits<RandomAccessIter>::value_type))</div> | |
806 | <div class="line"><a name="l00716"></a><span class="lineno"> 716</span>  || !std::numeric_limits<<span class="keyword">typename</span></div> | |
807 | <div class="line"><a name="l00717"></a><span class="lineno"> 717</span>  std::iterator_traits<RandomAccessIter>::value_type>::is_iec559);</div> | |
808 | <div class="line"><a name="l00718"></a><span class="lineno"> 718</span>  std::sort(first, last);</div> | |
809 | <div class="line"><a name="l00719"></a><span class="lineno"> 719</span>  }</div> | |
810 | <div class="line"><a name="l00720"></a><span class="lineno"> 720</span> </div> | |
811 | <div class="line"><a name="l00721"></a><span class="lineno"> 721</span>  <span class="comment">//These approaches require the user to do the typecast</span></div> | |
812 | <div class="line"><a name="l00722"></a><span class="lineno"> 722</span>  <span class="comment">//with rshift but default comparision</span></div> | |
813 | <div class="line"><a name="l00723"></a><span class="lineno"> 723</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> | |
814 | <div class="line"><a name="l00724"></a><span class="lineno"> 724</span>  <span class="keyword">inline</span> <span class="keyword">typename</span> boost::enable_if_c< sizeof(size_t) >= <span class="keyword">sizeof</span>(Div_type),</div> | |
815 | <div class="line"><a name="l00725"></a><span class="lineno"> 725</span>  <span class="keywordtype">void</span> >::type</div> | |
816 | <div class="line"><a name="l00726"></a><span class="lineno"><a class="line" href="namespaceboost_1_1sort_1_1detail.html#a22be02c948faa1f93e4dbb58b03b6e42"> 726</a></span>  <a class="code" href="namespaceboost_1_1sort_1_1detail.html#aaa66aec0efcc4f4a7f5584886e93444b">float_sort</a>(RandomAccessIter first, RandomAccessIter last, Div_type,</div> | |
817 | <div class="line"><a name="l00727"></a><span class="lineno"> 727</span>  Right_shift rshift)</div> | |
818 | <div class="line"><a name="l00728"></a><span class="lineno"> 728</span>  {</div> | |
819 | <div class="line"><a name="l00729"></a><span class="lineno"> 729</span>  <span class="keywordtype">size_t</span> bin_sizes[1 << <a class="code" href="namespaceboost_1_1sort_1_1detail.html#a7bbd2027f75936442318063f34953907a17b216febe1b5e8212a80231592fc9d9">max_splits</a>];</div> | |
820 | <div class="line"><a name="l00730"></a><span class="lineno"> 730</span>  std::vector<RandomAccessIter> bin_cache;</div> | |
821 | <div class="line"><a name="l00731"></a><span class="lineno"> 731</span>  float_sort_rec<RandomAccessIter, Div_type, Right_shift, size_t></div> | |
822 | <div class="line"><a name="l00732"></a><span class="lineno"> 732</span>  (first, last, bin_cache, 0, bin_sizes, rshift);</div> | |
823 | <div class="line"><a name="l00733"></a><span class="lineno"> 733</span>  }</div> | |
824 | <div class="line"><a name="l00734"></a><span class="lineno"> 734</span> </div> | |
825 | <div class="line"><a name="l00735"></a><span class="lineno"> 735</span>  <span class="comment">//maximum integer size with rshift but default comparision</span></div> | |
826 | <div class="line"><a name="l00736"></a><span class="lineno"> 736</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> | |
827 | <div class="line"><a name="l00737"></a><span class="lineno"> 737</span>  <span class="keyword">inline</span> <span class="keyword">typename</span> boost::enable_if_c< <span class="keyword">sizeof</span>(size_t) < <span class="keyword">sizeof</span>(Div_type)</div> | |
828 | <div class="line"><a name="l00738"></a><span class="lineno"> 738</span>  && <span class="keyword">sizeof</span>(boost::uintmax_t) >= <span class="keyword">sizeof</span>(Div_type), <span class="keywordtype">void</span> >::type</div> | |
829 | <div class="line"><a name="l00739"></a><span class="lineno"><a class="line" href="namespaceboost_1_1sort_1_1detail.html#a5e85811e357edf81ed621e25407b3256"> 739</a></span>  <a class="code" href="namespaceboost_1_1sort_1_1detail.html#aaa66aec0efcc4f4a7f5584886e93444b">float_sort</a>(RandomAccessIter first, RandomAccessIter last, Div_type,</div> | |
830 | <div class="line"><a name="l00740"></a><span class="lineno"> 740</span>  Right_shift rshift)</div> | |
831 | <div class="line"><a name="l00741"></a><span class="lineno"> 741</span>  {</div> | |
832 | <div class="line"><a name="l00742"></a><span class="lineno"> 742</span>  <span class="keywordtype">size_t</span> bin_sizes[1 << <a class="code" href="namespaceboost_1_1sort_1_1detail.html#a7bbd2027f75936442318063f34953907a17b216febe1b5e8212a80231592fc9d9">max_splits</a>];</div> | |
833 | <div class="line"><a name="l00743"></a><span class="lineno"> 743</span>  std::vector<RandomAccessIter> bin_cache;</div> | |
834 | <div class="line"><a name="l00744"></a><span class="lineno"> 744</span>  float_sort_rec<RandomAccessIter, Div_type, Right_shift, boost::uintmax_t></div> | |
835 | <div class="line"><a name="l00745"></a><span class="lineno"> 745</span>  (first, last, bin_cache, 0, bin_sizes, rshift);</div> | |
836 | <div class="line"><a name="l00746"></a><span class="lineno"> 746</span>  }</div> | |
837 | <div class="line"><a name="l00747"></a><span class="lineno"> 747</span> </div> | |
838 | <div class="line"><a name="l00748"></a><span class="lineno"> 748</span>  <span class="comment">//sizeof(Div_type) doesn't match, so use std::sort</span></div> | |
839 | <div class="line"><a name="l00749"></a><span class="lineno"> 749</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> | |
840 | <div class="line"><a name="l00750"></a><span class="lineno"> 750</span>  <span class="keyword">inline</span> <span class="keyword">typename</span> boost::disable_if_c< sizeof(boost::uintmax_t) >=</div> | |
841 | <div class="line"><a name="l00751"></a><span class="lineno"> 751</span>  <span class="keyword">sizeof</span>(Div_type), <span class="keywordtype">void</span> >::type</div> | |
842 | <div class="line"><a name="l00752"></a><span class="lineno"> 752</span>  <a class="code" href="namespaceboost_1_1sort_1_1detail.html#aaa66aec0efcc4f4a7f5584886e93444b">float_sort</a>(RandomAccessIter first, RandomAccessIter last, Div_type,</div> | |
843 | <div class="line"><a name="l00753"></a><span class="lineno"> 753</span>  Right_shift rshift)</div> | |
844 | <div class="line"><a name="l00754"></a><span class="lineno"> 754</span>  {</div> | |
845 | <div class="line"><a name="l00755"></a><span class="lineno"> 755</span>  BOOST_STATIC_WARNING(<span class="keyword">sizeof</span>(boost::uintmax_t) >= <span class="keyword">sizeof</span>(Div_type));</div> | |
846 | <div class="line"><a name="l00756"></a><span class="lineno"> 756</span>  std::sort(first, last);</div> | |
847 | <div class="line"><a name="l00757"></a><span class="lineno"> 757</span>  }</div> | |
848 | <div class="line"><a name="l00758"></a><span class="lineno"> 758</span> </div> | |
849 | <div class="line"><a name="l00759"></a><span class="lineno"> 759</span>  <span class="comment">//specialized comparison</span></div> | |
850 | <div class="line"><a name="l00760"></a><span class="lineno"> 760</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> | |
851 | <div class="line"><a name="l00761"></a><span class="lineno"> 761</span>  <span class="keyword">class </span>Compare></div> | |
852 | <div class="line"><a name="l00762"></a><span class="lineno"> 762</span>  <span class="keyword">inline</span> <span class="keyword">typename</span> boost::enable_if_c< sizeof(size_t) >= <span class="keyword">sizeof</span>(Div_type),</div> | |
853 | <div class="line"><a name="l00763"></a><span class="lineno"> 763</span>  <span class="keywordtype">void</span> >::type</div> | |
854 | <div class="line"><a name="l00764"></a><span class="lineno"><a class="line" href="namespaceboost_1_1sort_1_1detail.html#a23494fbb0eadd6a979f0b6c9fc19ea61"> 764</a></span>  <a class="code" href="namespaceboost_1_1sort_1_1detail.html#aaa66aec0efcc4f4a7f5584886e93444b">float_sort</a>(RandomAccessIter first, RandomAccessIter last, Div_type,</div> | |
855 | <div class="line"><a name="l00765"></a><span class="lineno"> 765</span>  Right_shift rshift, Compare comp)</div> | |
856 | <div class="line"><a name="l00766"></a><span class="lineno"> 766</span>  {</div> | |
857 | <div class="line"><a name="l00767"></a><span class="lineno"> 767</span>  <span class="keywordtype">size_t</span> bin_sizes[1 << <a class="code" href="namespaceboost_1_1sort_1_1detail.html#a7bbd2027f75936442318063f34953907a17b216febe1b5e8212a80231592fc9d9">max_splits</a>];</div> | |
858 | <div class="line"><a name="l00768"></a><span class="lineno"> 768</span>  std::vector<RandomAccessIter> bin_cache;</div> | |
859 | <div class="line"><a name="l00769"></a><span class="lineno"> 769</span>  <a class="code" href="namespaceboost_1_1sort_1_1detail.html#a1faa4283ebb64ba23c4a73c1c0a6548a">float_sort_rec</a><RandomAccessIter, Div_type, Right_shift, Compare,</div> | |
860 | <div class="line"><a name="l00770"></a><span class="lineno"> 770</span>  <span class="keywordtype">size_t</span>></div> | |
861 | <div class="line"><a name="l00771"></a><span class="lineno"> 771</span>  (first, last, bin_cache, 0, bin_sizes, rshift, comp);</div> | |
862 | <div class="line"><a name="l00772"></a><span class="lineno"> 772</span>  }</div> | |
863 | <div class="line"><a name="l00773"></a><span class="lineno"> 773</span> </div> | |
864 | <div class="line"><a name="l00774"></a><span class="lineno"> 774</span>  <span class="comment">//max-sized integer with specialized comparison</span></div> | |
865 | <div class="line"><a name="l00775"></a><span class="lineno"> 775</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> | |
866 | <div class="line"><a name="l00776"></a><span class="lineno"> 776</span>  <span class="keyword">class </span>Compare></div> | |
867 | <div class="line"><a name="l00777"></a><span class="lineno"> 777</span>  <span class="keyword">inline</span> <span class="keyword">typename</span> boost::enable_if_c< <span class="keyword">sizeof</span>(size_t) < <span class="keyword">sizeof</span>(Div_type)</div> | |
868 | <div class="line"><a name="l00778"></a><span class="lineno"> 778</span>  && <span class="keyword">sizeof</span>(boost::uintmax_t) >= <span class="keyword">sizeof</span>(Div_type), <span class="keywordtype">void</span> >::type</div> | |
869 | <div class="line"><a name="l00779"></a><span class="lineno"><a class="line" href="namespaceboost_1_1sort_1_1detail.html#ad73450f75077d802111a93f66e24a4bc"> 779</a></span>  <a class="code" href="namespaceboost_1_1sort_1_1detail.html#aaa66aec0efcc4f4a7f5584886e93444b">float_sort</a>(RandomAccessIter first, RandomAccessIter last, Div_type,</div> | |
870 | <div class="line"><a name="l00780"></a><span class="lineno"> 780</span>  Right_shift rshift, Compare comp)</div> | |
871 | <div class="line"><a name="l00781"></a><span class="lineno"> 781</span>  {</div> | |
872 | <div class="line"><a name="l00782"></a><span class="lineno"> 782</span>  <span class="keywordtype">size_t</span> bin_sizes[1 << <a class="code" href="namespaceboost_1_1sort_1_1detail.html#a7bbd2027f75936442318063f34953907a17b216febe1b5e8212a80231592fc9d9">max_splits</a>];</div> | |
873 | <div class="line"><a name="l00783"></a><span class="lineno"> 783</span>  std::vector<RandomAccessIter> bin_cache;</div> | |
874 | <div class="line"><a name="l00784"></a><span class="lineno"> 784</span>  <a class="code" href="namespaceboost_1_1sort_1_1detail.html#a1faa4283ebb64ba23c4a73c1c0a6548a">float_sort_rec</a><RandomAccessIter, Div_type, Right_shift, Compare,</div> | |
875 | <div class="line"><a name="l00785"></a><span class="lineno"> 785</span>  boost::uintmax_t></div> | |
876 | <div class="line"><a name="l00786"></a><span class="lineno"> 786</span>  (first, last, bin_cache, 0, bin_sizes, rshift, comp);</div> | |
877 | <div class="line"><a name="l00787"></a><span class="lineno"> 787</span>  }</div> | |
878 | <div class="line"><a name="l00788"></a><span class="lineno"> 788</span> </div> | |
879 | <div class="line"><a name="l00789"></a><span class="lineno"> 789</span>  <span class="comment">//sizeof(Div_type) doesn't match, so use std::sort</span></div> | |
880 | <div class="line"><a name="l00790"></a><span class="lineno"> 790</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> | |
881 | <div class="line"><a name="l00791"></a><span class="lineno"> 791</span>  <span class="keyword">class </span>Compare></div> | |
882 | <div class="line"><a name="l00792"></a><span class="lineno"> 792</span>  <span class="keyword">inline</span> <span class="keyword">typename</span> boost::disable_if_c< sizeof(boost::uintmax_t) >=</div> | |
883 | <div class="line"><a name="l00793"></a><span class="lineno"> 793</span>  <span class="keyword">sizeof</span>(Div_type), <span class="keywordtype">void</span> >::type</div> | |
884 | <div class="line"><a name="l00794"></a><span class="lineno"> 794</span>  <a class="code" href="namespaceboost_1_1sort_1_1detail.html#aaa66aec0efcc4f4a7f5584886e93444b">float_sort</a>(RandomAccessIter first, RandomAccessIter last, Div_type,</div> | |
885 | <div class="line"><a name="l00795"></a><span class="lineno"> 795</span>  Right_shift rshift, Compare comp)</div> | |
886 | <div class="line"><a name="l00796"></a><span class="lineno"> 796</span>  {</div> | |
887 | <div class="line"><a name="l00797"></a><span class="lineno"> 797</span>  BOOST_STATIC_WARNING(<span class="keyword">sizeof</span>(boost::uintmax_t) >= <span class="keyword">sizeof</span>(Div_type));</div> | |
888 | <div class="line"><a name="l00798"></a><span class="lineno"> 798</span>  std::sort(first, last, comp);</div> | |
889 | <div class="line"><a name="l00799"></a><span class="lineno"> 799</span>  }</div> | |
890 | <div class="line"><a name="l00800"></a><span class="lineno"> 800</span>  }</div> | |
891 | <div class="line"><a name="l00801"></a><span class="lineno"> 801</span> }</div> | |
892 | <div class="line"><a name="l00802"></a><span class="lineno"> 802</span> }</div> | |
893 | <div class="line"><a name="l00803"></a><span class="lineno"> 803</span> </div> | |
894 | <div class="line"><a name="l00804"></a><span class="lineno"> 804</span> <span class="preprocessor">#endif</span></div> | |
895 | <div class="ttc" id="namespaceboost_1_1sort_1_1detail_html_a1faa4283ebb64ba23c4a73c1c0a6548a"><div class="ttname"><a href="namespaceboost_1_1sort_1_1detail.html#a1faa4283ebb64ba23c4a73c1c0a6548a">boost::sort::detail::float_sort_rec</a></div><div class="ttdeci">void float_sort_rec(RandomAccessIter first, RandomAccessIter last, std::vector< RandomAccessIter > &bin_cache, unsigned cache_offset, size_t *bin_sizes)</div><div class="ttdef"><b>Definition:</b> float_sort.hpp:379</div></div> | |
896 | <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> | |
897 | <div class="ttc" id="namespaceboost_1_1sort_1_1detail_html_a8e8308c47bd14eff1c1d0f498289de35"><div class="ttname"><a href="namespaceboost_1_1sort_1_1detail.html#a8e8308c47bd14eff1c1d0f498289de35">boost::sort::detail::cast_float_iter</a></div><div class="ttdeci">Cast_type cast_float_iter(const RandomAccessIter &floatiter)</div><div class="ttdef"><b>Definition:</b> float_sort.hpp:37</div></div> | |
898 | <div class="ttc" id="detail_2integer__sort_8hpp_html"><div class="ttname"><a href="detail_2integer__sort_8hpp.html">integer_sort.hpp</a></div></div> | |
899 | <div class="ttc" id="namespaceboost_1_1sort_1_1detail_html_a7bbd2027f75936442318063f34953907a498b754f6198248703d3907562207d28"><div class="ttname"><a href="namespaceboost_1_1sort_1_1detail.html#a7bbd2027f75936442318063f34953907a498b754f6198248703d3907562207d28">boost::sort::detail::float_log_finishing_count</a></div><div class="ttdef"><b>Definition:</b> constants.hpp:38</div></div> | |
900 | <div class="ttc" id="namespaceboost_1_1sort_1_1detail_html_ac04e982cc9f6bcc101f6af6bcd7b36b3"><div class="ttname"><a href="namespaceboost_1_1sort_1_1detail.html#ac04e982cc9f6bcc101f6af6bcd7b36b3">boost::sort::detail::inner_float_swap_loop</a></div><div class="ttdeci">void inner_float_swap_loop(RandomAccessIter *bins, const RandomAccessIter &nextbinstart, unsigned ii, const unsigned log_divisor, const Div_type div_min)</div><div class="ttdef"><b>Definition:</b> float_sort.hpp:74</div></div> | |
901 | <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> | |
902 | <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> | |
903 | <div class="ttc" id="spreadsort__common_8hpp_html"><div class="ttname"><a href="spreadsort__common_8hpp.html">spreadsort_common.hpp</a></div></div> | |
904 | <div class="ttc" id="namespaceboost_1_1sort_1_1detail_html_a18fb49752147ebb43503428568323d37"><div class="ttname"><a href="namespaceboost_1_1sort_1_1detail.html#a18fb49752147ebb43503428568323d37">boost::sort::detail::float_swap_loop</a></div><div class="ttdeci">void float_swap_loop(RandomAccessIter *bins, RandomAccessIter &nextbinstart, unsigned ii, const size_t *bin_sizes, const unsigned log_divisor, const Div_type div_min)</div><div class="ttdef"><b>Definition:</b> float_sort.hpp:107</div></div> | |
905 | <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> | |
906 | <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> | |
907 | <div class="ttc" id="constants_8hpp_html"><div class="ttname"><a href="constants_8hpp.html">constants.hpp</a></div></div> | |
908 | <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> | |
909 | <div class="ttc" id="namespaceboost_1_1sort_1_1detail_html_a7bbd2027f75936442318063f34953907aa0ee6e920e1d3d09e148ce00a985340c"><div class="ttname"><a href="namespaceboost_1_1sort_1_1detail.html#a7bbd2027f75936442318063f34953907aa0ee6e920e1d3d09e148ce00a985340c">boost::sort::detail::float_log_min_split_count</a></div><div class="ttdef"><b>Definition:</b> constants.hpp:35</div></div> | |
910 | <div class="ttc" id="namespaceboost_1_1sort_1_1detail_html_a7bbd2027f75936442318063f34953907a0631b5d90d6ff0f1ff5370c616047a33"><div class="ttname"><a href="namespaceboost_1_1sort_1_1detail.html#a7bbd2027f75936442318063f34953907a0631b5d90d6ff0f1ff5370c616047a33">boost::sort::detail::float_log_mean_bin_size</a></div><div class="ttdef"><b>Definition:</b> constants.hpp:32</div></div> | |
911 | <div class="ttc" id="namespaceboost_1_1sort_1_1detail_html_a6b85a606f35ef97e23c7f8aed1c655b9"><div class="ttname"><a href="namespaceboost_1_1sort_1_1detail.html#a6b85a606f35ef97e23c7f8aed1c655b9">boost::sort::detail::negative_float_sort_rec</a></div><div class="ttdeci">void negative_float_sort_rec(RandomAccessIter first, RandomAccessIter last, std::vector< RandomAccessIter > &bin_cache, unsigned cache_offset, size_t *bin_sizes)</div><div class="ttdef"><b>Definition:</b> float_sort.hpp:201</div></div> | |
912 | <div class="ttc" id="namespaceboost_1_1sort_1_1detail_html_a3b8a896e29139b047fb1886262d124ab"><div class="ttname"><a href="namespaceboost_1_1sort_1_1detail.html#a3b8a896e29139b047fb1886262d124ab">boost::sort::detail::positive_float_sort_rec</a></div><div class="ttdeci">void positive_float_sort_rec(RandomAccessIter first, RandomAccessIter last, std::vector< RandomAccessIter > &bin_cache, unsigned cache_offset, size_t *bin_sizes)</div><div class="ttdef"><b>Definition:</b> float_sort.hpp:142</div></div> | |
913 | <div class="ttc" id="namespaceboost_1_1sort_1_1detail_html_aaa66aec0efcc4f4a7f5584886e93444b"><div class="ttname"><a href="namespaceboost_1_1sort_1_1detail.html#aaa66aec0efcc4f4a7f5584886e93444b">boost::sort::detail::float_sort</a></div><div class="ttdeci">boost::enable_if_c< sizeof(boost::uint32_t)==sizeof(typename std::iterator_traits< RandomAccessIter >::value_type)&&std::numeric_limits< typename std::iterator_traits< RandomAccessIter >::value_type >::is_iec559, void >::type float_sort(RandomAccessIter first, RandomAccessIter last)</div><div class="ttdef"><b>Definition:</b> float_sort.hpp:679</div></div> | |
914 | </div><!-- fragment --></div><!-- contents --> | |
915 | <!-- start footer part --> | |
916 | <hr class="footer"/><address class="footer"><small> | |
917 | Generated on Wed Jan 7 2015 17:29:22 for Boost.Sort by  <a href="http://www.doxygen.org/index.html"> | |
918 | <img class="footer" src="doxygen.png" alt="doxygen"/> | |
919 | </a> 1.8.9.1 | |
920 | </small></address> | |
921 | </body> | |
922 | </html> |