| <!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "http://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd"> |
| <html xmlns="http://www.w3.org/1999/xhtml"> |
| <head> |
| <meta http-equiv="Content-Type" content="text/xhtml;charset=UTF-8"/> |
| <meta http-equiv="X-UA-Compatible" content="IE=9"/> |
| <meta name="generator" content="Doxygen 1.8.9.1"/> |
| <title>Boost.Sort: I:/modular-boost/libs/sort/include/boost/sort/spreadsort/detail/spreadsort_common.hpp Source File</title> |
| <link href="tabs.css" rel="stylesheet" type="text/css"/> |
| <script type="text/javascript" src="jquery.js"></script> |
| <script type="text/javascript" src="dynsections.js"></script> |
| <link href="search/search.css" rel="stylesheet" type="text/css"/> |
| <script type="text/javascript" src="search/searchdata.js"></script> |
| <script type="text/javascript" src="search/search.js"></script> |
| <script type="text/javascript"> |
| $(document).ready(function() { init_search(); }); |
| </script> |
| <link href="doxygen.css" rel="stylesheet" type="text/css" /> |
| </head> |
| <body> |
| <div id="top"><!-- do not remove this div, it is closed by doxygen! --> |
| <div id="titlearea"> |
| <table cellspacing="0" cellpadding="0"> |
| <tbody> |
| <tr style="height: 56px;"> |
| <td style="padding-left: 0.5em;"> |
| <div id="projectname">Boost.Sort |
| </div> |
| </td> |
| </tr> |
| </tbody> |
| </table> |
| </div> |
| <!-- end header part --> |
| <!-- Generated by Doxygen 1.8.9.1 --> |
| <script type="text/javascript"> |
| var searchBox = new SearchBox("searchBox", "search",false,'Search'); |
| </script> |
| <div id="navrow1" class="tabs"> |
| <ul class="tablist"> |
| <li><a href="index.html"><span>Main Page</span></a></li> |
| <li><a href="namespaces.html"><span>Namespaces</span></a></li> |
| <li><a href="annotated.html"><span>Classes</span></a></li> |
| <li class="current"><a href="files.html"><span>Files</span></a></li> |
| <li> |
| <div id="MSearchBox" class="MSearchBoxInactive"> |
| <span class="left"> |
| <img id="MSearchSelect" src="search/mag_sel.png" |
| onmouseover="return searchBox.OnSearchSelectShow()" |
| onmouseout="return searchBox.OnSearchSelectHide()" |
| alt=""/> |
| <input type="text" id="MSearchField" value="Search" accesskey="S" |
| onfocus="searchBox.OnSearchFieldFocus(true)" |
| onblur="searchBox.OnSearchFieldFocus(false)" |
| onkeyup="searchBox.OnSearchFieldChange(event)"/> |
| </span><span class="right"> |
| <a id="MSearchClose" href="javascript:searchBox.CloseResultsWindow()"><img id="MSearchCloseImg" border="0" src="search/close.png" alt=""/></a> |
| </span> |
| </div> |
| </li> |
| </ul> |
| </div> |
| <div id="navrow2" class="tabs2"> |
| <ul class="tablist"> |
| <li><a href="files.html"><span>File List</span></a></li> |
| </ul> |
| </div> |
| <!-- window showing the filter options --> |
| <div id="MSearchSelectWindow" |
| onmouseover="return searchBox.OnSearchSelectShow()" |
| onmouseout="return searchBox.OnSearchSelectHide()" |
| onkeydown="return searchBox.OnSearchSelectKey(event)"> |
| </div> |
| |
| <!-- iframe showing the search results (closed by default) --> |
| <div id="MSearchResultsWindow"> |
| <iframe src="javascript:void(0)" frameborder="0" |
| name="MSearchResults" id="MSearchResults"> |
| </iframe> |
| </div> |
| |
| <div id="nav-path" class="navpath"> |
| <ul> |
| <li class="navelem"><a class="el" href="dir_d44c64559bbebec7f509842c48db8b23.html">include</a></li><li class="navelem"><a class="el" href="dir_1878a3f4746a95c6aad317458cc7ef80.html">boost</a></li><li class="navelem"><a class="el" href="dir_0dcad0da4f36218cbabb216021de9867.html">sort</a></li><li class="navelem"><a class="el" href="dir_4aa236a92b75d6f514e733718a475329.html">spreadsort</a></li><li class="navelem"><a class="el" href="dir_1b6f0a484b3a75c2ed43dc394e95eff6.html">detail</a></li> </ul> |
| </div> |
| </div><!-- top --> |
| <div class="header"> |
| <div class="headertitle"> |
| <div class="title">spreadsort_common.hpp</div> </div> |
| </div><!--header--> |
| <div class="contents"> |
| <a href="spreadsort__common_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">// Contains get_min_count, the core optimization of the spreadsort algorithm.</span></div> |
| <div class="line"><a name="l00002"></a><span class="lineno"> 2</span> <span class="comment">// Also has other helper functions commonly useful across variants.</span></div> |
| <div class="line"><a name="l00003"></a><span class="lineno"> 3</span> </div> |
| <div class="line"><a name="l00004"></a><span class="lineno"> 4</span> <span class="comment">// Copyright Steven J. Ross 2001 - 2014.</span></div> |
| <div class="line"><a name="l00005"></a><span class="lineno"> 5</span> <span class="comment">// Distributed under the Boost Software License, Version 1.0.</span></div> |
| <div class="line"><a name="l00006"></a><span class="lineno"> 6</span> <span class="comment">// (See accompanying file LICENSE_1_0.txt or copy at</span></div> |
| <div class="line"><a name="l00007"></a><span class="lineno"> 7</span> <span class="comment">// http://www.boost.org/LICENSE_1_0.txt)</span></div> |
| <div class="line"><a name="l00008"></a><span class="lineno"> 8</span> </div> |
| <div class="line"><a name="l00009"></a><span class="lineno"> 9</span> <span class="comment">// See http://www.boost.org/libs/sort for library home page.</span></div> |
| <div class="line"><a name="l00010"></a><span class="lineno"> 10</span> </div> |
| <div class="line"><a name="l00011"></a><span class="lineno"> 11</span> <span class="comment">/*</span></div> |
| <div class="line"><a name="l00012"></a><span class="lineno"> 12</span> <span class="comment">Some improvements suggested by:</span></div> |
| <div class="line"><a name="l00013"></a><span class="lineno"> 13</span> <span class="comment">Phil Endecott and Frank Gennari</span></div> |
| <div class="line"><a name="l00014"></a><span class="lineno"> 14</span> <span class="comment">*/</span></div> |
| <div class="line"><a name="l00015"></a><span class="lineno"> 15</span> </div> |
| <div class="line"><a name="l00016"></a><span class="lineno"> 16</span> <span class="preprocessor">#ifndef BOOST_SORT_SPREADSORT_DETAIL_SPREAD_SORT_COMMON_HPP</span></div> |
| <div class="line"><a name="l00017"></a><span class="lineno"> 17</span> <span class="preprocessor">#define BOOST_SORT_SPREADSORT_DETAIL_SPREAD_SORT_COMMON_HPP</span></div> |
| <div class="line"><a name="l00018"></a><span class="lineno"> 18</span> <span class="preprocessor">#include <algorithm></span></div> |
| <div class="line"><a name="l00019"></a><span class="lineno"> 19</span> <span class="preprocessor">#include <vector></span></div> |
| <div class="line"><a name="l00020"></a><span class="lineno"> 20</span> <span class="preprocessor">#include <cstring></span></div> |
| <div class="line"><a name="l00021"></a><span class="lineno"> 21</span> <span class="preprocessor">#include <limits></span></div> |
| <div class="line"><a name="l00022"></a><span class="lineno"> 22</span> <span class="preprocessor">#include <functional></span></div> |
| <div class="line"><a name="l00023"></a><span class="lineno"> 23</span> <span class="preprocessor">#include <boost/static_assert.hpp></span></div> |
| <div class="line"><a name="l00024"></a><span class="lineno"> 24</span> <span class="preprocessor">#include <boost/serialization/static_warning.hpp></span></div> |
| <div class="line"><a name="l00025"></a><span class="lineno"> 25</span> <span class="preprocessor">#include <<a class="code" href="constants_8hpp.html">boost/sort/spreadsort/detail/constants.hpp</a>></span></div> |
| <div class="line"><a name="l00026"></a><span class="lineno"> 26</span> <span class="preprocessor">#include <boost/cstdint.hpp></span></div> |
| <div class="line"><a name="l00027"></a><span class="lineno"> 27</span> </div> |
| <div class="line"><a name="l00028"></a><span class="lineno"> 28</span> <span class="keyword">namespace </span><a class="code" href="namespaceboost.html">boost</a> {</div> |
| <div class="line"><a name="l00029"></a><span class="lineno"> 29</span> <span class="keyword">namespace </span>sort {</div> |
| <div class="line"><a name="l00030"></a><span class="lineno"> 30</span>  <span class="keyword">namespace </span>detail {</div> |
| <div class="line"><a name="l00031"></a><span class="lineno"> 31</span>  <span class="comment">//This only works on unsigned data types</span></div> |
| <div class="line"><a name="l00032"></a><span class="lineno"> 32</span>  <span class="keyword">template</span> <<span class="keyword">typename</span> T></div> |
| <div class="line"><a name="l00033"></a><span class="lineno"> 33</span>  <span class="keyword">inline</span> <span class="keywordtype">unsigned</span></div> |
| <div class="line"><a name="l00034"></a><span class="lineno"><a class="line" href="namespaceboost_1_1sort_1_1detail.html#a852a51cde62aa67347cb9b4a7350bbac"> 34</a></span>  <a class="code" href="namespaceboost_1_1sort_1_1detail.html#a852a51cde62aa67347cb9b4a7350bbac">rough_log_2_size</a>(<span class="keyword">const</span> T& input)</div> |
| <div class="line"><a name="l00035"></a><span class="lineno"> 35</span>  {</div> |
| <div class="line"><a name="l00036"></a><span class="lineno"> 36</span>  <span class="keywordtype">unsigned</span> result = 0;</div> |
| <div class="line"><a name="l00037"></a><span class="lineno"> 37</span>  <span class="comment">//The && is necessary on some compilers to avoid infinite loops</span></div> |
| <div class="line"><a name="l00038"></a><span class="lineno"> 38</span>  <span class="comment">//it doesn't significantly impair performance</span></div> |
| <div class="line"><a name="l00039"></a><span class="lineno"> 39</span>  <span class="keywordflow">while</span> ((input >> result) && (result < (8*<span class="keyword">sizeof</span>(T)))) ++result;</div> |
| <div class="line"><a name="l00040"></a><span class="lineno"> 40</span>  <span class="keywordflow">return</span> result;</div> |
| <div class="line"><a name="l00041"></a><span class="lineno"> 41</span>  }</div> |
| <div class="line"><a name="l00042"></a><span class="lineno"> 42</span> </div> |
| <div class="line"><a name="l00043"></a><span class="lineno"> 43</span>  <span class="comment">//Gets the minimum size to call spreadsort on to control worst-case runtime.</span></div> |
| <div class="line"><a name="l00044"></a><span class="lineno"> 44</span>  <span class="comment">//This is called for a set of bins, instead of bin-by-bin, to minimize</span></div> |
| <div class="line"><a name="l00045"></a><span class="lineno"> 45</span>  <span class="comment">//runtime overhead.</span></div> |
| <div class="line"><a name="l00046"></a><span class="lineno"> 46</span>  <span class="comment">//This could be replaced by a lookup table of sizeof(Div_type)*8 but this</span></div> |
| <div class="line"><a name="l00047"></a><span class="lineno"> 47</span>  <span class="comment">//function is more general.</span></div> |
| <div class="line"><a name="l00048"></a><span class="lineno"> 48</span>  <span class="keyword">template</span><<span class="keywordtype">unsigned</span> log_mean_bin_size,</div> |
| <div class="line"><a name="l00049"></a><span class="lineno"> 49</span>  <span class="keywordtype">unsigned</span> log_min_split_count, <span class="keywordtype">unsigned</span> log_finishing_count></div> |
| <div class="line"><a name="l00050"></a><span class="lineno"> 50</span>  <span class="keyword">inline</span> <span class="keywordtype">size_t</span></div> |
| <div class="line"><a name="l00051"></a><span class="lineno"><a class="line" href="namespaceboost_1_1sort_1_1detail.html#a4ba5c57512d16f300c08b7a6b4e6ff23"> 51</a></span>  <a class="code" href="namespaceboost_1_1sort_1_1detail.html#a4ba5c57512d16f300c08b7a6b4e6ff23">get_min_count</a>(<span class="keywordtype">unsigned</span> log_range)</div> |
| <div class="line"><a name="l00052"></a><span class="lineno"> 52</span>  {</div> |
| <div class="line"><a name="l00053"></a><span class="lineno"> 53</span>  <span class="keyword">const</span> <span class="keywordtype">size_t</span> typed_one = 1;</div> |
| <div class="line"><a name="l00054"></a><span class="lineno"> 54</span>  <span class="keyword">const</span> <span class="keywordtype">unsigned</span> min_size = log_mean_bin_size + log_min_split_count;</div> |
| <div class="line"><a name="l00055"></a><span class="lineno"> 55</span>  <span class="comment">//Assuring that constants have valid settings</span></div> |
| <div class="line"><a name="l00056"></a><span class="lineno"> 56</span>  BOOST_STATIC_ASSERT(log_min_split_count <= <a class="code" href="namespaceboost_1_1sort_1_1detail.html#a7bbd2027f75936442318063f34953907a17b216febe1b5e8212a80231592fc9d9">max_splits</a> &&</div> |
| <div class="line"><a name="l00057"></a><span class="lineno"> 57</span>  log_min_split_count > 0);</div> |
| <div class="line"><a name="l00058"></a><span class="lineno"> 58</span>  BOOST_STATIC_ASSERT(<a class="code" href="namespaceboost_1_1sort_1_1detail.html#a7bbd2027f75936442318063f34953907a17b216febe1b5e8212a80231592fc9d9">max_splits</a> > 1 &&</div> |
| <div class="line"><a name="l00059"></a><span class="lineno"> 59</span>  <a class="code" href="namespaceboost_1_1sort_1_1detail.html#a7bbd2027f75936442318063f34953907a17b216febe1b5e8212a80231592fc9d9">max_splits</a> < (8 * <span class="keyword">sizeof</span>(<span class="keywordtype">unsigned</span>)));</div> |
| <div class="line"><a name="l00060"></a><span class="lineno"> 60</span>  BOOST_STATIC_ASSERT(<a class="code" href="namespaceboost_1_1sort_1_1detail.html#a7bbd2027f75936442318063f34953907acfdc43b3d7aa6df69b0f6982918056c7">max_finishing_splits</a> >= <a class="code" href="namespaceboost_1_1sort_1_1detail.html#a7bbd2027f75936442318063f34953907a17b216febe1b5e8212a80231592fc9d9">max_splits</a> &&</div> |
| <div class="line"><a name="l00061"></a><span class="lineno"> 61</span>  <a class="code" href="namespaceboost_1_1sort_1_1detail.html#a7bbd2027f75936442318063f34953907acfdc43b3d7aa6df69b0f6982918056c7">max_finishing_splits</a> < (8 * <span class="keyword">sizeof</span>(<span class="keywordtype">unsigned</span>)));</div> |
| <div class="line"><a name="l00062"></a><span class="lineno"> 62</span>  BOOST_STATIC_ASSERT(log_mean_bin_size >= 0);</div> |
| <div class="line"><a name="l00063"></a><span class="lineno"> 63</span>  BOOST_STATIC_ASSERT(log_finishing_count >= 0);</div> |
| <div class="line"><a name="l00064"></a><span class="lineno"> 64</span>  <span class="comment">//if we can complete in one iteration, do so</span></div> |
| <div class="line"><a name="l00065"></a><span class="lineno"> 65</span>  <span class="comment">//This first check allows the compiler to optimize never-executed code out</span></div> |
| <div class="line"><a name="l00066"></a><span class="lineno"> 66</span>  <span class="keywordflow">if</span> (log_finishing_count < min_size) {</div> |
| <div class="line"><a name="l00067"></a><span class="lineno"> 67</span>  <span class="keywordflow">if</span> (log_range <= min_size && log_range <= <a class="code" href="namespaceboost_1_1sort_1_1detail.html#a7bbd2027f75936442318063f34953907a17b216febe1b5e8212a80231592fc9d9">max_splits</a>) {</div> |
| <div class="line"><a name="l00068"></a><span class="lineno"> 68</span>  <span class="comment">//Return no smaller than a certain minimum limit</span></div> |
| <div class="line"><a name="l00069"></a><span class="lineno"> 69</span>  <span class="keywordflow">if</span> (log_range <= log_finishing_count)</div> |
| <div class="line"><a name="l00070"></a><span class="lineno"> 70</span>  <span class="keywordflow">return</span> typed_one << log_finishing_count;</div> |
| <div class="line"><a name="l00071"></a><span class="lineno"> 71</span>  <span class="keywordflow">return</span> typed_one << log_range;</div> |
| <div class="line"><a name="l00072"></a><span class="lineno"> 72</span>  }</div> |
| <div class="line"><a name="l00073"></a><span class="lineno"> 73</span>  }</div> |
| <div class="line"><a name="l00074"></a><span class="lineno"> 74</span>  <span class="keyword">const</span> <span class="keywordtype">unsigned</span> base_iterations = <a class="code" href="namespaceboost_1_1sort_1_1detail.html#a7bbd2027f75936442318063f34953907a17b216febe1b5e8212a80231592fc9d9">max_splits</a> - log_min_split_count;</div> |
| <div class="line"><a name="l00075"></a><span class="lineno"> 75</span>  <span class="comment">//sum of n to n + x = ((x + 1) * (n + (n + x)))/2 + log_mean_bin_size</span></div> |
| <div class="line"><a name="l00076"></a><span class="lineno"> 76</span>  <span class="keyword">const</span> <span class="keywordtype">unsigned</span> base_range =</div> |
| <div class="line"><a name="l00077"></a><span class="lineno"> 77</span>  ((base_iterations + 1) * (<a class="code" href="namespaceboost_1_1sort_1_1detail.html#a7bbd2027f75936442318063f34953907a17b216febe1b5e8212a80231592fc9d9">max_splits</a> + log_min_split_count))/2</div> |
| <div class="line"><a name="l00078"></a><span class="lineno"> 78</span>  + log_mean_bin_size;</div> |
| <div class="line"><a name="l00079"></a><span class="lineno"> 79</span>  <span class="comment">//Calculating the required number of iterations, and returning</span></div> |
| <div class="line"><a name="l00080"></a><span class="lineno"> 80</span>  <span class="comment">//1 << (iteration_count + min_size)</span></div> |
| <div class="line"><a name="l00081"></a><span class="lineno"> 81</span>  <span class="keywordflow">if</span> (log_range < base_range) {</div> |
| <div class="line"><a name="l00082"></a><span class="lineno"> 82</span>  <span class="keywordtype">unsigned</span> result = log_min_split_count;</div> |
| <div class="line"><a name="l00083"></a><span class="lineno"> 83</span>  <span class="keywordflow">for</span> (<span class="keywordtype">unsigned</span> offset = min_size; offset < log_range;</div> |
| <div class="line"><a name="l00084"></a><span class="lineno"> 84</span>  offset += ++result);</div> |
| <div class="line"><a name="l00085"></a><span class="lineno"> 85</span>  <span class="comment">//Preventing overflow; this situation shouldn't occur</span></div> |
| <div class="line"><a name="l00086"></a><span class="lineno"> 86</span>  <span class="keywordflow">if</span> ((result + log_mean_bin_size) >= (8 * <span class="keyword">sizeof</span>(size_t)))</div> |
| <div class="line"><a name="l00087"></a><span class="lineno"> 87</span>  <span class="keywordflow">return</span> typed_one << ((8 * <span class="keyword">sizeof</span>(<span class="keywordtype">size_t</span>)) - 1);</div> |
| <div class="line"><a name="l00088"></a><span class="lineno"> 88</span>  <span class="keywordflow">return</span> typed_one << (result + log_mean_bin_size);</div> |
| <div class="line"><a name="l00089"></a><span class="lineno"> 89</span>  }</div> |
| <div class="line"><a name="l00090"></a><span class="lineno"> 90</span>  <span class="comment">//A quick division can calculate the worst-case runtime for larger ranges</span></div> |
| <div class="line"><a name="l00091"></a><span class="lineno"> 91</span>  <span class="keywordtype">unsigned</span> remainder = log_range - base_range;</div> |
| <div class="line"><a name="l00092"></a><span class="lineno"> 92</span>  <span class="comment">//the max_splits - 1 is used to calculate the ceiling of the division</span></div> |
| <div class="line"><a name="l00093"></a><span class="lineno"> 93</span>  <span class="keywordtype">unsigned</span> bit_length = ((((<a class="code" href="namespaceboost_1_1sort_1_1detail.html#a7bbd2027f75936442318063f34953907a17b216febe1b5e8212a80231592fc9d9">max_splits</a> - 1) + remainder)/<a class="code" href="namespaceboost_1_1sort_1_1detail.html#a7bbd2027f75936442318063f34953907a17b216febe1b5e8212a80231592fc9d9">max_splits</a>)</div> |
| <div class="line"><a name="l00094"></a><span class="lineno"> 94</span>  + base_iterations + min_size);</div> |
| <div class="line"><a name="l00095"></a><span class="lineno"> 95</span>  <span class="comment">//Preventing overflow; this situation shouldn't occur</span></div> |
| <div class="line"><a name="l00096"></a><span class="lineno"> 96</span>  <span class="keywordflow">if</span> (bit_length >= (8 * <span class="keyword">sizeof</span>(<span class="keywordtype">size_t</span>)))</div> |
| <div class="line"><a name="l00097"></a><span class="lineno"> 97</span>  <span class="keywordflow">return</span> typed_one << ((8 * <span class="keyword">sizeof</span>(size_t)) - 1);</div> |
| <div class="line"><a name="l00098"></a><span class="lineno"> 98</span>  <span class="comment">//n(log_range)/max_splits + C, optimizing worst-case performance</span></div> |
| <div class="line"><a name="l00099"></a><span class="lineno"> 99</span>  <span class="keywordflow">return</span> typed_one << bit_length;</div> |
| <div class="line"><a name="l00100"></a><span class="lineno"> 100</span>  }</div> |
| <div class="line"><a name="l00101"></a><span class="lineno"> 101</span> </div> |
| <div class="line"><a name="l00102"></a><span class="lineno"> 102</span>  <span class="comment">// Resizes the bin cache and bin sizes, and initializes each bin size to 0.</span></div> |
| <div class="line"><a name="l00103"></a><span class="lineno"> 103</span>  <span class="comment">// This generates the memory overhead to use in radix sorting.</span></div> |
| <div class="line"><a name="l00104"></a><span class="lineno"> 104</span>  <span class="keyword">template</span> <<span class="keyword">class</span> RandomAccessIter></div> |
| <div class="line"><a name="l00105"></a><span class="lineno"> 105</span>  <span class="keyword">inline</span> RandomAccessIter *</div> |
| <div class="line"><a name="l00106"></a><span class="lineno"><a class="line" href="namespaceboost_1_1sort_1_1detail.html#ad5b7d31fba809eae5d17f5c2fb0a385b"> 106</a></span>  <a class="code" href="namespaceboost_1_1sort_1_1detail.html#ad5b7d31fba809eae5d17f5c2fb0a385b">size_bins</a>(<span class="keywordtype">size_t</span> *bin_sizes, std::vector<RandomAccessIter></div> |
| <div class="line"><a name="l00107"></a><span class="lineno"> 107</span>  &bin_cache, <span class="keywordtype">unsigned</span> cache_offset, <span class="keywordtype">unsigned</span> &cache_end, <span class="keywordtype">unsigned</span> bin_count)</div> |
| <div class="line"><a name="l00108"></a><span class="lineno"> 108</span>  {</div> |
| <div class="line"><a name="l00109"></a><span class="lineno"> 109</span>  <span class="comment">// Clear the bin sizes</span></div> |
| <div class="line"><a name="l00110"></a><span class="lineno"> 110</span>  <span class="keywordflow">for</span> (<span class="keywordtype">size_t</span> u = 0; u < bin_count; u++)</div> |
| <div class="line"><a name="l00111"></a><span class="lineno"> 111</span>  bin_sizes[u] = 0;</div> |
| <div class="line"><a name="l00112"></a><span class="lineno"> 112</span>  <span class="comment">//Make sure there is space for the bins</span></div> |
| <div class="line"><a name="l00113"></a><span class="lineno"> 113</span>  cache_end = cache_offset + bin_count;</div> |
| <div class="line"><a name="l00114"></a><span class="lineno"> 114</span>  <span class="keywordflow">if</span> (cache_end > bin_cache.size())</div> |
| <div class="line"><a name="l00115"></a><span class="lineno"> 115</span>  bin_cache.resize(cache_end);</div> |
| <div class="line"><a name="l00116"></a><span class="lineno"> 116</span>  <span class="keywordflow">return</span> &(bin_cache[cache_offset]);</div> |
| <div class="line"><a name="l00117"></a><span class="lineno"> 117</span>  }</div> |
| <div class="line"><a name="l00118"></a><span class="lineno"> 118</span>  }</div> |
| <div class="line"><a name="l00119"></a><span class="lineno"> 119</span> }</div> |
| <div class="line"><a name="l00120"></a><span class="lineno"> 120</span> }</div> |
| <div class="line"><a name="l00121"></a><span class="lineno"> 121</span> </div> |
| <div class="line"><a name="l00122"></a><span class="lineno"> 122</span> <span class="preprocessor">#endif</span></div> |
| <div class="ttc" id="namespaceboost_html"><div class="ttname"><a href="namespaceboost.html">boost</a></div><div class="ttdef"><b>Definition:</b> constants.hpp:11</div></div> |
| <div class="ttc" id="namespaceboost_1_1sort_1_1detail_html_a7bbd2027f75936442318063f34953907acfdc43b3d7aa6df69b0f6982918056c7"><div class="ttname"><a href="namespaceboost_1_1sort_1_1detail.html#a7bbd2027f75936442318063f34953907acfdc43b3d7aa6df69b0f6982918056c7">boost::sort::detail::max_finishing_splits</a></div><div class="ttdef"><b>Definition:</b> constants.hpp:22</div></div> |
| <div class="ttc" id="namespaceboost_1_1sort_1_1detail_html_a4ba5c57512d16f300c08b7a6b4e6ff23"><div class="ttname"><a href="namespaceboost_1_1sort_1_1detail.html#a4ba5c57512d16f300c08b7a6b4e6ff23">boost::sort::detail::get_min_count</a></div><div class="ttdeci">size_t get_min_count(unsigned log_range)</div><div class="ttdef"><b>Definition:</b> spreadsort_common.hpp:51</div></div> |
| <div class="ttc" id="namespaceboost_1_1sort_1_1detail_html_a7bbd2027f75936442318063f34953907a17b216febe1b5e8212a80231592fc9d9"><div class="ttname"><a href="namespaceboost_1_1sort_1_1detail.html#a7bbd2027f75936442318063f34953907a17b216febe1b5e8212a80231592fc9d9">boost::sort::detail::max_splits</a></div><div class="ttdef"><b>Definition:</b> constants.hpp:19</div></div> |
| <div class="ttc" id="namespaceboost_1_1sort_1_1detail_html_a852a51cde62aa67347cb9b4a7350bbac"><div class="ttname"><a href="namespaceboost_1_1sort_1_1detail.html#a852a51cde62aa67347cb9b4a7350bbac">boost::sort::detail::rough_log_2_size</a></div><div class="ttdeci">unsigned rough_log_2_size(const T &input)</div><div class="ttdef"><b>Definition:</b> spreadsort_common.hpp:34</div></div> |
| <div class="ttc" id="constants_8hpp_html"><div class="ttname"><a href="constants_8hpp.html">constants.hpp</a></div></div> |
| <div class="ttc" id="namespaceboost_1_1sort_1_1detail_html_ad5b7d31fba809eae5d17f5c2fb0a385b"><div class="ttname"><a href="namespaceboost_1_1sort_1_1detail.html#ad5b7d31fba809eae5d17f5c2fb0a385b">boost::sort::detail::size_bins</a></div><div class="ttdeci">RandomAccessIter * size_bins(size_t *bin_sizes, std::vector< RandomAccessIter > &bin_cache, unsigned cache_offset, unsigned &cache_end, unsigned bin_count)</div><div class="ttdef"><b>Definition:</b> spreadsort_common.hpp:106</div></div> |
| </div><!-- fragment --></div><!-- contents --> |
| <!-- start footer part --> |
| <hr class="footer"/><address class="footer"><small> |
| Generated on Wed Jan 7 2015 17:29:22 for Boost.Sort by  <a href="http://www.doxygen.org/index.html"> |
| <img class="footer" src="doxygen.png" alt="doxygen"/> |
| </a> 1.8.9.1 |
| </small></address> |
| </body> |
| </html> |
