| <!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/string_sort.hpp Source File</title> |
| <link href="tabs.css" rel="stylesheet" type="text/css"/> |
| <script type="text/javascript" src="jquery.js"></script> |
| <script type="text/javascript" src="dynsections.js"></script> |
| <link href="search/search.css" rel="stylesheet" type="text/css"/> |
| <script type="text/javascript" src="search/searchdata.js"></script> |
| <script type="text/javascript" src="search/search.js"></script> |
| <script type="text/javascript"> |
| $(document).ready(function() { init_search(); }); |
| </script> |
| <link href="doxygen.css" rel="stylesheet" type="text/css" /> |
| </head> |
| <body> |
| <div id="top"><!-- do not remove this div, it is closed by doxygen! --> |
| <div id="titlearea"> |
| <table cellspacing="0" cellpadding="0"> |
| <tbody> |
| <tr style="height: 56px;"> |
| <td style="padding-left: 0.5em;"> |
| <div id="projectname">Boost.Sort |
| </div> |
| </td> |
| </tr> |
| </tbody> |
| </table> |
| </div> |
| <!-- end header part --> |
| <!-- Generated by Doxygen 1.8.9.1 --> |
| <script type="text/javascript"> |
| var searchBox = new SearchBox("searchBox", "search",false,'Search'); |
| </script> |
| <div id="navrow1" class="tabs"> |
| <ul class="tablist"> |
| <li><a href="index.html"><span>Main Page</span></a></li> |
| <li><a href="namespaces.html"><span>Namespaces</span></a></li> |
| <li><a href="annotated.html"><span>Classes</span></a></li> |
| <li class="current"><a href="files.html"><span>Files</span></a></li> |
| <li> |
| <div id="MSearchBox" class="MSearchBoxInactive"> |
| <span class="left"> |
| <img id="MSearchSelect" src="search/mag_sel.png" |
| onmouseover="return searchBox.OnSearchSelectShow()" |
| onmouseout="return searchBox.OnSearchSelectHide()" |
| alt=""/> |
| <input type="text" id="MSearchField" value="Search" accesskey="S" |
| onfocus="searchBox.OnSearchFieldFocus(true)" |
| onblur="searchBox.OnSearchFieldFocus(false)" |
| onkeyup="searchBox.OnSearchFieldChange(event)"/> |
| </span><span class="right"> |
| <a id="MSearchClose" href="javascript:searchBox.CloseResultsWindow()"><img id="MSearchCloseImg" border="0" src="search/close.png" alt=""/></a> |
| </span> |
| </div> |
| </li> |
| </ul> |
| </div> |
| <div id="navrow2" class="tabs2"> |
| <ul class="tablist"> |
| <li><a href="files.html"><span>File List</span></a></li> |
| </ul> |
| </div> |
| <!-- window showing the filter options --> |
| <div id="MSearchSelectWindow" |
| onmouseover="return searchBox.OnSearchSelectShow()" |
| onmouseout="return searchBox.OnSearchSelectHide()" |
| onkeydown="return searchBox.OnSearchSelectKey(event)"> |
| </div> |
| |
| <!-- iframe showing the search results (closed by default) --> |
| <div id="MSearchResultsWindow"> |
| <iframe src="javascript:void(0)" frameborder="0" |
| name="MSearchResults" id="MSearchResults"> |
| </iframe> |
| </div> |
| |
| <div id="nav-path" class="navpath"> |
| <ul> |
| <li class="navelem"><a class="el" href="dir_d44c64559bbebec7f509842c48db8b23.html">include</a></li><li class="navelem"><a class="el" href="dir_1878a3f4746a95c6aad317458cc7ef80.html">boost</a></li><li class="navelem"><a class="el" href="dir_0dcad0da4f36218cbabb216021de9867.html">sort</a></li><li class="navelem"><a class="el" href="dir_4aa236a92b75d6f514e733718a475329.html">spreadsort</a></li><li class="navelem"><a class="el" href="dir_1b6f0a484b3a75c2ed43dc394e95eff6.html">detail</a></li> </ul> |
| </div> |
| </div><!-- top --> |
| <div class="header"> |
| <div class="headertitle"> |
| <div class="title">string_sort.hpp</div> </div> |
| </div><!--header--> |
| <div class="contents"> |
| <a href="detail_2string__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 a templated general-case hybrid-radix string_sort.</span></div> |
| <div class="line"><a name="l00002"></a><span class="lineno"> 2</span> </div> |
| <div class="line"><a name="l00003"></a><span class="lineno"> 3</span> <span class="comment">// Copyright Steven J. Ross 2001 - 2014.</span></div> |
| <div class="line"><a name="l00004"></a><span class="lineno"> 4</span> <span class="comment">// Distributed under the Boost Software License, Version 1.0.</span></div> |
| <div class="line"><a name="l00005"></a><span class="lineno"> 5</span> <span class="comment">// (See accompanying file LICENSE_1_0.txt or copy at</span></div> |
| <div class="line"><a name="l00006"></a><span class="lineno"> 6</span> <span class="comment">// http://www.boost.org/LICENSE_1_0.txt)</span></div> |
| <div class="line"><a name="l00007"></a><span class="lineno"> 7</span> </div> |
| <div class="line"><a name="l00008"></a><span class="lineno"> 8</span> <span class="comment">// See http://www.boost.org/libs/sort for library home page.</span></div> |
| <div class="line"><a name="l00009"></a><span class="lineno"> 9</span> </div> |
| <div class="line"><a name="l00010"></a><span class="lineno"> 10</span> <span class="comment">/*</span></div> |
| <div class="line"><a name="l00011"></a><span class="lineno"> 11</span> <span class="comment">Some improvements suggested by:</span></div> |
| <div class="line"><a name="l00012"></a><span class="lineno"> 12</span> <span class="comment">Phil Endecott and Frank Gennari</span></div> |
| <div class="line"><a name="l00013"></a><span class="lineno"> 13</span> <span class="comment">*/</span></div> |
| <div class="line"><a name="l00014"></a><span class="lineno"> 14</span> </div> |
| <div class="line"><a name="l00015"></a><span class="lineno"> 15</span> <span class="preprocessor">#ifndef BOOST_SORT_SPREADSORT_DETAIL_SPREAD_SORT_HPP</span></div> |
| <div class="line"><a name="l00016"></a><span class="lineno"> 16</span> <span class="preprocessor">#define BOOST_SORT_SPREADSORT_DETAIL_SPREAD_SORT_HPP</span></div> |
| <div class="line"><a name="l00017"></a><span class="lineno"> 17</span> <span class="preprocessor">#include <algorithm></span></div> |
| <div class="line"><a name="l00018"></a><span class="lineno"> 18</span> <span class="preprocessor">#include <vector></span></div> |
| <div class="line"><a name="l00019"></a><span class="lineno"> 19</span> <span class="preprocessor">#include <cstring></span></div> |
| <div class="line"><a name="l00020"></a><span class="lineno"> 20</span> <span class="preprocessor">#include <limits></span></div> |
| <div class="line"><a name="l00021"></a><span class="lineno"> 21</span> <span class="preprocessor">#include <functional></span></div> |
| <div class="line"><a name="l00022"></a><span class="lineno"> 22</span> <span class="preprocessor">#include <boost/static_assert.hpp></span></div> |
| <div class="line"><a name="l00023"></a><span class="lineno"> 23</span> <span class="preprocessor">#include <boost/serialization/static_warning.hpp></span></div> |
| <div class="line"><a name="l00024"></a><span class="lineno"> 24</span> <span class="preprocessor">#include <boost/utility/enable_if.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 <<a class="code" href="spreadsort__common_8hpp.html">boost/sort/spreadsort/detail/spreadsort_common.hpp</a>></span></div> |
| <div class="line"><a name="l00027"></a><span class="lineno"> 27</span> <span class="preprocessor">#include <boost/cstdint.hpp></span></div> |
| <div class="line"><a name="l00028"></a><span class="lineno"> 28</span> </div> |
| <div class="line"><a name="l00029"></a><span class="lineno"> 29</span> <span class="keyword">namespace </span><a class="code" href="namespaceboost.html">boost</a> {</div> |
| <div class="line"><a name="l00030"></a><span class="lineno"> 30</span> <span class="keyword">namespace </span>sort {</div> |
| <div class="line"><a name="l00031"></a><span class="lineno"> 31</span>  <span class="keyword">namespace </span>detail {</div> |
| <div class="line"><a name="l00032"></a><span class="lineno"> 32</span>  <span class="keyword">static</span> <span class="keyword">const</span> <span class="keywordtype">int</span> max_step_size = 64;</div> |
| <div class="line"><a name="l00033"></a><span class="lineno"> 33</span> </div> |
| <div class="line"><a name="l00034"></a><span class="lineno"> 34</span>  <span class="comment">//Offsetting on identical characters. This function works a chunk of</span></div> |
| <div class="line"><a name="l00035"></a><span class="lineno"> 35</span>  <span class="comment">//characters at a time for cache efficiency and optimal worst-case</span></div> |
| <div class="line"><a name="l00036"></a><span class="lineno"> 36</span>  <span class="comment">//performance.</span></div> |
| <div class="line"><a name="l00037"></a><span class="lineno"> 37</span>  <span class="keyword">template</span><<span class="keyword">class</span> RandomAccessIter, <span class="keyword">class</span> Un<span class="keywordtype">signed</span>_<span class="keywordtype">char</span>_type></div> |
| <div class="line"><a name="l00038"></a><span class="lineno"> 38</span>  <span class="keyword">inline</span> <span class="keywordtype">void</span></div> |
| <div class="line"><a name="l00039"></a><span class="lineno"><a class="line" href="namespaceboost_1_1sort_1_1detail.html#a585497946eeb8cc1d2072642d7f1da01"> 39</a></span>  <a class="code" href="namespaceboost_1_1sort_1_1detail.html#a585497946eeb8cc1d2072642d7f1da01">update_offset</a>(RandomAccessIter first, RandomAccessIter finish,</div> |
| <div class="line"><a name="l00040"></a><span class="lineno"> 40</span>  <span class="keywordtype">size_t</span> &char_offset)</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>  <span class="keyword">const</span> <span class="keywordtype">int</span> char_size = <span class="keyword">sizeof</span>(Unsigned_char_type);</div> |
| <div class="line"><a name="l00043"></a><span class="lineno"> 43</span>  <span class="keywordtype">size_t</span> nextOffset = char_offset;</div> |
| <div class="line"><a name="l00044"></a><span class="lineno"> 44</span>  <span class="keywordtype">int</span> step_size = max_step_size;</div> |
| <div class="line"><a name="l00045"></a><span class="lineno"> 45</span>  <span class="keywordflow">while</span> (<span class="keyword">true</span>) {</div> |
| <div class="line"><a name="l00046"></a><span class="lineno"> 46</span>  RandomAccessIter curr = first;</div> |
| <div class="line"><a name="l00047"></a><span class="lineno"> 47</span>  <span class="keywordflow">do</span> {</div> |
| <div class="line"><a name="l00048"></a><span class="lineno"> 48</span>  <span class="comment">//Ignore empties, but if the nextOffset would exceed the length or</span></div> |
| <div class="line"><a name="l00049"></a><span class="lineno"> 49</span>  <span class="comment">//not match, exit; we've found the last matching character</span></div> |
| <div class="line"><a name="l00050"></a><span class="lineno"> 50</span>  <span class="comment">//This will reduce the step_size if the current step doesn't match.</span></div> |
| <div class="line"><a name="l00051"></a><span class="lineno"> 51</span>  <span class="keywordflow">if</span> ((*curr).size() > char_offset) {</div> |
| <div class="line"><a name="l00052"></a><span class="lineno"> 52</span>  <span class="keywordflow">if</span>((*curr).size() <= (nextOffset + step_size)) {</div> |
| <div class="line"><a name="l00053"></a><span class="lineno"> 53</span>  step_size = (*curr).size() - nextOffset - 1;</div> |
| <div class="line"><a name="l00054"></a><span class="lineno"> 54</span>  <span class="keywordflow">if</span> (step_size < 1) {</div> |
| <div class="line"><a name="l00055"></a><span class="lineno"> 55</span>  char_offset = nextOffset;</div> |
| <div class="line"><a name="l00056"></a><span class="lineno"> 56</span>  <span class="keywordflow">return</span>;</div> |
| <div class="line"><a name="l00057"></a><span class="lineno"> 57</span>  }</div> |
| <div class="line"><a name="l00058"></a><span class="lineno"> 58</span>  }</div> |
| <div class="line"><a name="l00059"></a><span class="lineno"> 59</span>  <span class="keyword">const</span> <span class="keywordtype">int</span> step_byte_size = step_size * char_size;</div> |
| <div class="line"><a name="l00060"></a><span class="lineno"> 60</span>  <span class="keywordflow">if</span> (memcmp(curr->data() + nextOffset, first->data() + nextOffset, </div> |
| <div class="line"><a name="l00061"></a><span class="lineno"> 61</span>  step_byte_size) != 0) {</div> |
| <div class="line"><a name="l00062"></a><span class="lineno"> 62</span>  <span class="keywordflow">if</span> (step_size == 1) {</div> |
| <div class="line"><a name="l00063"></a><span class="lineno"> 63</span>  char_offset = nextOffset;</div> |
| <div class="line"><a name="l00064"></a><span class="lineno"> 64</span>  <span class="keywordflow">return</span>;</div> |
| <div class="line"><a name="l00065"></a><span class="lineno"> 65</span>  }</div> |
| <div class="line"><a name="l00066"></a><span class="lineno"> 66</span>  step_size = (step_size > 4) ? 4 : 1;</div> |
| <div class="line"><a name="l00067"></a><span class="lineno"> 67</span>  <span class="keywordflow">continue</span>;</div> |
| <div class="line"><a name="l00068"></a><span class="lineno"> 68</span>  }</div> |
| <div class="line"><a name="l00069"></a><span class="lineno"> 69</span>  }</div> |
| <div class="line"><a name="l00070"></a><span class="lineno"> 70</span>  ++curr;</div> |
| <div class="line"><a name="l00071"></a><span class="lineno"> 71</span>  } <span class="keywordflow">while</span> (curr != finish);</div> |
| <div class="line"><a name="l00072"></a><span class="lineno"> 72</span>  nextOffset += step_size;</div> |
| <div class="line"><a name="l00073"></a><span class="lineno"> 73</span>  }</div> |
| <div class="line"><a name="l00074"></a><span class="lineno"> 74</span>  }</div> |
| <div class="line"><a name="l00075"></a><span class="lineno"> 75</span> </div> |
| <div class="line"><a name="l00076"></a><span class="lineno"> 76</span>  <span class="comment">//Offsetting on identical characters. This function works a character</span></div> |
| <div class="line"><a name="l00077"></a><span class="lineno"> 77</span>  <span class="comment">//at a time for optimal worst-case performance.</span></div> |
| <div class="line"><a name="l00078"></a><span class="lineno"> 78</span>  <span class="keyword">template</span><<span class="keyword">class</span> RandomAccessIter, <span class="keyword">class</span> Get_<span class="keywordtype">char</span>, <span class="keyword">class</span> Get_length></div> |
| <div class="line"><a name="l00079"></a><span class="lineno"> 79</span>  <span class="keyword">inline</span> <span class="keywordtype">void</span></div> |
| <div class="line"><a name="l00080"></a><span class="lineno"><a class="line" href="namespaceboost_1_1sort_1_1detail.html#a415ebdb0c9a5e9209bbfc7d2e576374c"> 80</a></span>  <a class="code" href="namespaceboost_1_1sort_1_1detail.html#a585497946eeb8cc1d2072642d7f1da01">update_offset</a>(RandomAccessIter first, RandomAccessIter finish,</div> |
| <div class="line"><a name="l00081"></a><span class="lineno"> 81</span>  <span class="keywordtype">size_t</span> &char_offset, Get_char getchar, Get_length length)</div> |
| <div class="line"><a name="l00082"></a><span class="lineno"> 82</span>  {</div> |
| <div class="line"><a name="l00083"></a><span class="lineno"> 83</span>  <span class="keywordtype">size_t</span> nextOffset = char_offset;</div> |
| <div class="line"><a name="l00084"></a><span class="lineno"> 84</span>  <span class="keywordflow">while</span> (<span class="keyword">true</span>) {</div> |
| <div class="line"><a name="l00085"></a><span class="lineno"> 85</span>  RandomAccessIter curr = first;</div> |
| <div class="line"><a name="l00086"></a><span class="lineno"> 86</span>  <span class="keywordflow">do</span> {</div> |
| <div class="line"><a name="l00087"></a><span class="lineno"> 87</span>  <span class="comment">//ignore empties, but if the nextOffset would exceed the length or</span></div> |
| <div class="line"><a name="l00088"></a><span class="lineno"> 88</span>  <span class="comment">//not match, exit; we've found the last matching character</span></div> |
| <div class="line"><a name="l00089"></a><span class="lineno"> 89</span>  <span class="keywordflow">if</span> (length(*curr) > char_offset && (length(*curr) <= (nextOffset + 1)</div> |
| <div class="line"><a name="l00090"></a><span class="lineno"> 90</span>  || getchar((*curr), nextOffset) != getchar((*first), nextOffset))) {</div> |
| <div class="line"><a name="l00091"></a><span class="lineno"> 91</span>  char_offset = nextOffset;</div> |
| <div class="line"><a name="l00092"></a><span class="lineno"> 92</span>  <span class="keywordflow">return</span>;</div> |
| <div class="line"><a name="l00093"></a><span class="lineno"> 93</span>  }</div> |
| <div class="line"><a name="l00094"></a><span class="lineno"> 94</span>  } <span class="keywordflow">while</span> (++curr != finish);</div> |
| <div class="line"><a name="l00095"></a><span class="lineno"> 95</span>  ++nextOffset;</div> |
| <div class="line"><a name="l00096"></a><span class="lineno"> 96</span>  }</div> |
| <div class="line"><a name="l00097"></a><span class="lineno"> 97</span>  }</div> |
| <div class="line"><a name="l00098"></a><span class="lineno"> 98</span> </div> |
| <div class="line"><a name="l00099"></a><span class="lineno"> 99</span>  <span class="comment">//This comparison functor assumes strings are identical up to char_offset</span></div> |
| <div class="line"><a name="l00100"></a><span class="lineno"> 100</span>  <span class="keyword">template</span><<span class="keyword">class</span> Data_type, <span class="keyword">class</span> Un<span class="keywordtype">signed</span>_<span class="keywordtype">char</span>_type></div> |
| <div class="line"><a name="l00101"></a><span class="lineno"><a class="line" href="structboost_1_1sort_1_1detail_1_1offset__less__than.html"> 101</a></span>  <span class="keyword">struct </span><a class="code" href="structboost_1_1sort_1_1detail_1_1offset__less__than.html">offset_less_than</a> {</div> |
| <div class="line"><a name="l00102"></a><span class="lineno"><a class="line" href="structboost_1_1sort_1_1detail_1_1offset__less__than.html#a0c153f50b29e9bea224df345c5ff1e91"> 102</a></span>  <a class="code" href="structboost_1_1sort_1_1detail_1_1offset__less__than.html#a0c153f50b29e9bea224df345c5ff1e91">offset_less_than</a>(<span class="keywordtype">size_t</span> char_offset) : <a class="code" href="structboost_1_1sort_1_1detail_1_1offset__less__than.html#ae6d1402367790441b962b8cc9f066aac">fchar_offset</a>(char_offset){}</div> |
| <div class="line"><a name="l00103"></a><span class="lineno"><a class="line" href="structboost_1_1sort_1_1detail_1_1offset__less__than.html#a3f2184b627e54eb990bfe2022b6f8f06"> 103</a></span>  <span class="keyword">inline</span> <span class="keywordtype">bool</span> <a class="code" href="structboost_1_1sort_1_1detail_1_1offset__less__than.html#a3f2184b627e54eb990bfe2022b6f8f06">operator()</a>(<span class="keyword">const</span> Data_type &x, <span class="keyword">const</span> Data_type &y)<span class="keyword"> const</span></div> |
| <div class="line"><a name="l00104"></a><span class="lineno"> 104</span> <span class="keyword"> </span>{</div> |
| <div class="line"><a name="l00105"></a><span class="lineno"> 105</span>  <span class="keywordtype">size_t</span> minSize = (std::min)(x.size(), y.size());</div> |
| <div class="line"><a name="l00106"></a><span class="lineno"> 106</span>  <span class="keywordflow">for</span> (<span class="keywordtype">size_t</span> u = <a class="code" href="structboost_1_1sort_1_1detail_1_1offset__less__than.html#ae6d1402367790441b962b8cc9f066aac">fchar_offset</a>; u < minSize; ++u) {</div> |
| <div class="line"><a name="l00107"></a><span class="lineno"> 107</span>  BOOST_STATIC_ASSERT(<span class="keyword">sizeof</span>(x[u]) == <span class="keyword">sizeof</span>(Unsigned_char_type));</div> |
| <div class="line"><a name="l00108"></a><span class="lineno"> 108</span>  <span class="keywordflow">if</span> (static_cast<Unsigned_char_type>(x[u]) !=</div> |
| <div class="line"><a name="l00109"></a><span class="lineno"> 109</span>  static_cast<Unsigned_char_type>(y[u])) {</div> |
| <div class="line"><a name="l00110"></a><span class="lineno"> 110</span>  <span class="keywordflow">return</span> <span class="keyword">static_cast<</span>Unsigned_char_type<span class="keyword">></span>(x[u]) < </div> |
| <div class="line"><a name="l00111"></a><span class="lineno"> 111</span>  static_cast<Unsigned_char_type>(y[u]);</div> |
| <div class="line"><a name="l00112"></a><span class="lineno"> 112</span>  }</div> |
| <div class="line"><a name="l00113"></a><span class="lineno"> 113</span>  }</div> |
| <div class="line"><a name="l00114"></a><span class="lineno"> 114</span>  <span class="keywordflow">return</span> x.size() < y.size();</div> |
| <div class="line"><a name="l00115"></a><span class="lineno"> 115</span>  }</div> |
| <div class="line"><a name="l00116"></a><span class="lineno"><a class="line" href="structboost_1_1sort_1_1detail_1_1offset__less__than.html#ae6d1402367790441b962b8cc9f066aac"> 116</a></span>  <span class="keywordtype">size_t</span> <a class="code" href="structboost_1_1sort_1_1detail_1_1offset__less__than.html#ae6d1402367790441b962b8cc9f066aac">fchar_offset</a>;</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>  <span class="comment">//Compares strings assuming they are identical up to char_offset</span></div> |
| <div class="line"><a name="l00120"></a><span class="lineno"> 120</span>  <span class="keyword">template</span><<span class="keyword">class</span> Data_type, <span class="keyword">class</span> Un<span class="keywordtype">signed</span>_<span class="keywordtype">char</span>_type></div> |
| <div class="line"><a name="l00121"></a><span class="lineno"><a class="line" href="structboost_1_1sort_1_1detail_1_1offset__greater__than.html"> 121</a></span>  <span class="keyword">struct </span><a class="code" href="structboost_1_1sort_1_1detail_1_1offset__greater__than.html">offset_greater_than</a> {</div> |
| <div class="line"><a name="l00122"></a><span class="lineno"><a class="line" href="structboost_1_1sort_1_1detail_1_1offset__greater__than.html#a9603b8028ace4872c6e056917c7889aa"> 122</a></span>  <a class="code" href="structboost_1_1sort_1_1detail_1_1offset__greater__than.html#a9603b8028ace4872c6e056917c7889aa">offset_greater_than</a>(<span class="keywordtype">size_t</span> char_offset) : <a class="code" href="structboost_1_1sort_1_1detail_1_1offset__greater__than.html#a3ce63f721a5a4453317ffc0ea61a6243">fchar_offset</a>(char_offset){}</div> |
| <div class="line"><a name="l00123"></a><span class="lineno"><a class="line" href="structboost_1_1sort_1_1detail_1_1offset__greater__than.html#a2d28d7eb61a69c61c0362cfefa264d73"> 123</a></span>  <span class="keyword">inline</span> <span class="keywordtype">bool</span> <a class="code" href="structboost_1_1sort_1_1detail_1_1offset__greater__than.html#a2d28d7eb61a69c61c0362cfefa264d73">operator()</a>(<span class="keyword">const</span> Data_type &x, <span class="keyword">const</span> Data_type &y)<span class="keyword"> const</span></div> |
| <div class="line"><a name="l00124"></a><span class="lineno"> 124</span> <span class="keyword"> </span>{</div> |
| <div class="line"><a name="l00125"></a><span class="lineno"> 125</span>  <span class="keywordtype">size_t</span> minSize = (std::min)(x.size(), y.size());</div> |
| <div class="line"><a name="l00126"></a><span class="lineno"> 126</span>  <span class="keywordflow">for</span> (<span class="keywordtype">size_t</span> u = <a class="code" href="structboost_1_1sort_1_1detail_1_1offset__greater__than.html#a3ce63f721a5a4453317ffc0ea61a6243">fchar_offset</a>; u < minSize; ++u) {</div> |
| <div class="line"><a name="l00127"></a><span class="lineno"> 127</span>  BOOST_STATIC_ASSERT(<span class="keyword">sizeof</span>(x[u]) == <span class="keyword">sizeof</span>(Unsigned_char_type));</div> |
| <div class="line"><a name="l00128"></a><span class="lineno"> 128</span>  <span class="keywordflow">if</span> (static_cast<Unsigned_char_type>(x[u]) !=</div> |
| <div class="line"><a name="l00129"></a><span class="lineno"> 129</span>  static_cast<Unsigned_char_type>(y[u])) {</div> |
| <div class="line"><a name="l00130"></a><span class="lineno"> 130</span>  <span class="keywordflow">return</span> <span class="keyword">static_cast<</span>Unsigned_char_type<span class="keyword">></span>(x[u]) > </div> |
| <div class="line"><a name="l00131"></a><span class="lineno"> 131</span>  static_cast<Unsigned_char_type>(y[u]);</div> |
| <div class="line"><a name="l00132"></a><span class="lineno"> 132</span>  }</div> |
| <div class="line"><a name="l00133"></a><span class="lineno"> 133</span>  }</div> |
| <div class="line"><a name="l00134"></a><span class="lineno"> 134</span>  <span class="keywordflow">return</span> x.size() > y.size();</div> |
| <div class="line"><a name="l00135"></a><span class="lineno"> 135</span>  }</div> |
| <div class="line"><a name="l00136"></a><span class="lineno"><a class="line" href="structboost_1_1sort_1_1detail_1_1offset__greater__than.html#a3ce63f721a5a4453317ffc0ea61a6243"> 136</a></span>  <span class="keywordtype">size_t</span> <a class="code" href="structboost_1_1sort_1_1detail_1_1offset__greater__than.html#a3ce63f721a5a4453317ffc0ea61a6243">fchar_offset</a>;</div> |
| <div class="line"><a name="l00137"></a><span class="lineno"> 137</span>  };</div> |
| <div class="line"><a name="l00138"></a><span class="lineno"> 138</span> </div> |
| <div class="line"><a name="l00139"></a><span class="lineno"> 139</span>  <span class="comment">//This comparison functor assumes strings are identical up to char_offset</span></div> |
| <div class="line"><a name="l00140"></a><span class="lineno"> 140</span>  <span class="keyword">template</span><<span class="keyword">class</span> Data_type, <span class="keyword">class</span> Get_<span class="keywordtype">char</span>, <span class="keyword">class</span> Get_length></div> |
| <div class="line"><a name="l00141"></a><span class="lineno"><a class="line" href="structboost_1_1sort_1_1detail_1_1offset__char__less__than.html"> 141</a></span>  <span class="keyword">struct </span><a class="code" href="structboost_1_1sort_1_1detail_1_1offset__char__less__than.html">offset_char_less_than</a> {</div> |
| <div class="line"><a name="l00142"></a><span class="lineno"><a class="line" href="structboost_1_1sort_1_1detail_1_1offset__char__less__than.html#a0716b085964e676c8c9735bafa783007"> 142</a></span>  <a class="code" href="structboost_1_1sort_1_1detail_1_1offset__char__less__than.html#a0716b085964e676c8c9735bafa783007">offset_char_less_than</a>(<span class="keywordtype">size_t</span> char_offset) : <a class="code" href="structboost_1_1sort_1_1detail_1_1offset__char__less__than.html#ae5ee4abf81ecfb4ff4016792b81bfbd2">fchar_offset</a>(char_offset){}</div> |
| <div class="line"><a name="l00143"></a><span class="lineno"><a class="line" href="structboost_1_1sort_1_1detail_1_1offset__char__less__than.html#ad20c3572610e68d76c49dfff2eba2bf3"> 143</a></span>  <span class="keyword">inline</span> <span class="keywordtype">bool</span> <a class="code" href="structboost_1_1sort_1_1detail_1_1offset__char__less__than.html#ad20c3572610e68d76c49dfff2eba2bf3">operator()</a>(<span class="keyword">const</span> Data_type &x, <span class="keyword">const</span> Data_type &y)<span class="keyword"> const</span></div> |
| <div class="line"><a name="l00144"></a><span class="lineno"> 144</span> <span class="keyword"> </span>{</div> |
| <div class="line"><a name="l00145"></a><span class="lineno"> 145</span>  <span class="keywordtype">size_t</span> minSize = (std::min)(<a class="code" href="structboost_1_1sort_1_1detail_1_1offset__char__less__than.html#a8ff12c3dcf4a6ea9942b8fc1e5046936">length</a>(x), <a class="code" href="structboost_1_1sort_1_1detail_1_1offset__char__less__than.html#a8ff12c3dcf4a6ea9942b8fc1e5046936">length</a>(y));</div> |
| <div class="line"><a name="l00146"></a><span class="lineno"> 146</span>  <span class="keywordflow">for</span> (<span class="keywordtype">size_t</span> u = <a class="code" href="structboost_1_1sort_1_1detail_1_1offset__char__less__than.html#ae5ee4abf81ecfb4ff4016792b81bfbd2">fchar_offset</a>; u < minSize; ++u) {</div> |
| <div class="line"><a name="l00147"></a><span class="lineno"> 147</span>  <span class="keywordflow">if</span> (<a class="code" href="structboost_1_1sort_1_1detail_1_1offset__char__less__than.html#afb5424173c237d8cd25722a02c23ab30">getchar</a>(x, u) != <a class="code" href="structboost_1_1sort_1_1detail_1_1offset__char__less__than.html#afb5424173c237d8cd25722a02c23ab30">getchar</a>(y, u)) {</div> |
| <div class="line"><a name="l00148"></a><span class="lineno"> 148</span>  <span class="keywordflow">return</span> <a class="code" href="structboost_1_1sort_1_1detail_1_1offset__char__less__than.html#afb5424173c237d8cd25722a02c23ab30">getchar</a>(x, u) < <a class="code" href="structboost_1_1sort_1_1detail_1_1offset__char__less__than.html#afb5424173c237d8cd25722a02c23ab30">getchar</a>(y, u);</div> |
| <div class="line"><a name="l00149"></a><span class="lineno"> 149</span>  }</div> |
| <div class="line"><a name="l00150"></a><span class="lineno"> 150</span>  }</div> |
| <div class="line"><a name="l00151"></a><span class="lineno"> 151</span>  <span class="keywordflow">return</span> <a class="code" href="structboost_1_1sort_1_1detail_1_1offset__char__less__than.html#a8ff12c3dcf4a6ea9942b8fc1e5046936">length</a>(x) < <a class="code" href="structboost_1_1sort_1_1detail_1_1offset__char__less__than.html#a8ff12c3dcf4a6ea9942b8fc1e5046936">length</a>(y);</div> |
| <div class="line"><a name="l00152"></a><span class="lineno"> 152</span>  }</div> |
| <div class="line"><a name="l00153"></a><span class="lineno"><a class="line" href="structboost_1_1sort_1_1detail_1_1offset__char__less__than.html#ae5ee4abf81ecfb4ff4016792b81bfbd2"> 153</a></span>  <span class="keywordtype">size_t</span> <a class="code" href="structboost_1_1sort_1_1detail_1_1offset__char__less__than.html#ae5ee4abf81ecfb4ff4016792b81bfbd2">fchar_offset</a>;</div> |
| <div class="line"><a name="l00154"></a><span class="lineno"><a class="line" href="structboost_1_1sort_1_1detail_1_1offset__char__less__than.html#afb5424173c237d8cd25722a02c23ab30"> 154</a></span>  Get_char <a class="code" href="structboost_1_1sort_1_1detail_1_1offset__char__less__than.html#afb5424173c237d8cd25722a02c23ab30">getchar</a>;</div> |
| <div class="line"><a name="l00155"></a><span class="lineno"><a class="line" href="structboost_1_1sort_1_1detail_1_1offset__char__less__than.html#a8ff12c3dcf4a6ea9942b8fc1e5046936"> 155</a></span>  Get_length <a class="code" href="structboost_1_1sort_1_1detail_1_1offset__char__less__than.html#a8ff12c3dcf4a6ea9942b8fc1e5046936">length</a>;</div> |
| <div class="line"><a name="l00156"></a><span class="lineno"> 156</span>  };</div> |
| <div class="line"><a name="l00157"></a><span class="lineno"> 157</span> </div> |
| <div class="line"><a name="l00158"></a><span class="lineno"> 158</span>  <span class="comment">//String sorting recursive implementation</span></div> |
| <div class="line"><a name="l00159"></a><span class="lineno"> 159</span>  <span class="keyword">template</span> <<span class="keyword">class</span> RandomAccessIter, <span class="keyword">class</span> Un<span class="keywordtype">signed</span>_<span class="keywordtype">char</span>_type></div> |
| <div class="line"><a name="l00160"></a><span class="lineno"> 160</span>  <span class="keyword">inline</span> <span class="keywordtype">void</span></div> |
| <div class="line"><a name="l00161"></a><span class="lineno"><a class="line" href="namespaceboost_1_1sort_1_1detail.html#ad1655ab39e410e18b6e8b6694405e5ba"> 161</a></span>  <a class="code" href="namespaceboost_1_1sort_1_1detail.html#ad1655ab39e410e18b6e8b6694405e5ba">string_sort_rec</a>(RandomAccessIter first, RandomAccessIter last,</div> |
| <div class="line"><a name="l00162"></a><span class="lineno"> 162</span>  <span class="keywordtype">size_t</span> char_offset,</div> |
| <div class="line"><a name="l00163"></a><span class="lineno"> 163</span>  std::vector<RandomAccessIter> &bin_cache,</div> |
| <div class="line"><a name="l00164"></a><span class="lineno"> 164</span>  <span class="keywordtype">unsigned</span> cache_offset, <span class="keywordtype">size_t</span> *bin_sizes)</div> |
| <div class="line"><a name="l00165"></a><span class="lineno"> 165</span>  {</div> |
| <div class="line"><a name="l00166"></a><span class="lineno"> 166</span>  <span class="keyword">typedef</span> <span class="keyword">typename</span> std::iterator_traits<RandomAccessIter>::value_type</div> |
| <div class="line"><a name="l00167"></a><span class="lineno"> 167</span>  Data_type;</div> |
| <div class="line"><a name="l00168"></a><span class="lineno"> 168</span>  <span class="comment">//This section makes handling of long identical substrings much faster</span></div> |
| <div class="line"><a name="l00169"></a><span class="lineno"> 169</span>  <span class="comment">//with a mild average performance impact.</span></div> |
| <div class="line"><a name="l00170"></a><span class="lineno"> 170</span>  <span class="comment">//Iterate to the end of the empties. If all empty, return</span></div> |
| <div class="line"><a name="l00171"></a><span class="lineno"> 171</span>  <span class="keywordflow">while</span> ((*first).size() <= char_offset) {</div> |
| <div class="line"><a name="l00172"></a><span class="lineno"> 172</span>  <span class="keywordflow">if</span> (++first == last)</div> |
| <div class="line"><a name="l00173"></a><span class="lineno"> 173</span>  <span class="keywordflow">return</span>;</div> |
| <div class="line"><a name="l00174"></a><span class="lineno"> 174</span>  }</div> |
| <div class="line"><a name="l00175"></a><span class="lineno"> 175</span>  RandomAccessIter finish = last - 1;</div> |
| <div class="line"><a name="l00176"></a><span class="lineno"> 176</span>  <span class="comment">//Getting the last non-empty</span></div> |
| <div class="line"><a name="l00177"></a><span class="lineno"> 177</span>  <span class="keywordflow">for</span> (;(*finish).size() <= char_offset; --finish);</div> |
| <div class="line"><a name="l00178"></a><span class="lineno"> 178</span>  ++finish;</div> |
| <div class="line"><a name="l00179"></a><span class="lineno"> 179</span>  <span class="comment">//Offsetting on identical characters. This section works</span></div> |
| <div class="line"><a name="l00180"></a><span class="lineno"> 180</span>  <span class="comment">//a few characters at a time for optimal worst-case performance.</span></div> |
| <div class="line"><a name="l00181"></a><span class="lineno"> 181</span>  update_offset<RandomAccessIter, Unsigned_char_type>(first, finish,</div> |
| <div class="line"><a name="l00182"></a><span class="lineno"> 182</span>  char_offset);</div> |
| <div class="line"><a name="l00183"></a><span class="lineno"> 183</span>  </div> |
| <div class="line"><a name="l00184"></a><span class="lineno"> 184</span>  <span class="keyword">const</span> <span class="keywordtype">unsigned</span> bin_count = (1 << (<span class="keyword">sizeof</span>(Unsigned_char_type)*8));</div> |
| <div class="line"><a name="l00185"></a><span class="lineno"> 185</span>  <span class="comment">//Equal worst-case of radix and comparison is when bin_count = n*log(n).</span></div> |
| <div class="line"><a name="l00186"></a><span class="lineno"> 186</span>  <span class="keyword">const</span> <span class="keywordtype">unsigned</span> max_size = bin_count;</div> |
| <div class="line"><a name="l00187"></a><span class="lineno"> 187</span>  <span class="keyword">const</span> <span class="keywordtype">unsigned</span> membin_count = bin_count + 1;</div> |
| <div class="line"><a name="l00188"></a><span class="lineno"> 188</span>  <span class="keywordtype">unsigned</span> cache_end;</div> |
| <div class="line"><a name="l00189"></a><span class="lineno"> 189</span>  RandomAccessIter * bins = <a class="code" href="namespaceboost_1_1sort_1_1detail.html#ad5b7d31fba809eae5d17f5c2fb0a385b">size_bins</a>(bin_sizes, bin_cache, cache_offset,</div> |
| <div class="line"><a name="l00190"></a><span class="lineno"> 190</span>  cache_end, membin_count) + 1;</div> |
| <div class="line"><a name="l00191"></a><span class="lineno"> 191</span> </div> |
| <div class="line"><a name="l00192"></a><span class="lineno"> 192</span>  <span class="comment">//Calculating the size of each bin; this takes roughly 10% of runtime</span></div> |
| <div class="line"><a name="l00193"></a><span class="lineno"> 193</span>  <span class="keywordflow">for</span> (RandomAccessIter current = first; current != last; ++current) {</div> |
| <div class="line"><a name="l00194"></a><span class="lineno"> 194</span>  <span class="keywordflow">if</span> ((*current).size() <= char_offset) {</div> |
| <div class="line"><a name="l00195"></a><span class="lineno"> 195</span>  bin_sizes[0]++;</div> |
| <div class="line"><a name="l00196"></a><span class="lineno"> 196</span>  }</div> |
| <div class="line"><a name="l00197"></a><span class="lineno"> 197</span>  <span class="keywordflow">else</span></div> |
| <div class="line"><a name="l00198"></a><span class="lineno"> 198</span>  bin_sizes[<span class="keyword">static_cast<</span>Unsigned_char_type<span class="keyword">></span>((*current)[char_offset])</div> |
| <div class="line"><a name="l00199"></a><span class="lineno"> 199</span>  + 1]++;</div> |
| <div class="line"><a name="l00200"></a><span class="lineno"> 200</span>  }</div> |
| <div class="line"><a name="l00201"></a><span class="lineno"> 201</span>  <span class="comment">//Assign the bin positions</span></div> |
| <div class="line"><a name="l00202"></a><span class="lineno"> 202</span>  bin_cache[cache_offset] = first;</div> |
| <div class="line"><a name="l00203"></a><span class="lineno"> 203</span>  <span class="keywordflow">for</span> (<span class="keywordtype">unsigned</span> u = 0; u < membin_count - 1; u++)</div> |
| <div class="line"><a name="l00204"></a><span class="lineno"> 204</span>  bin_cache[cache_offset + u + 1] =</div> |
| <div class="line"><a name="l00205"></a><span class="lineno"> 205</span>  bin_cache[cache_offset + u] + bin_sizes[u];</div> |
| <div class="line"><a name="l00206"></a><span class="lineno"> 206</span> </div> |
| <div class="line"><a name="l00207"></a><span class="lineno"> 207</span>  <span class="comment">//Swap into place</span></div> |
| <div class="line"><a name="l00208"></a><span class="lineno"> 208</span>  RandomAccessIter next_bin_start = first;</div> |
| <div class="line"><a name="l00209"></a><span class="lineno"> 209</span>  <span class="comment">//handling empty bins</span></div> |
| <div class="line"><a name="l00210"></a><span class="lineno"> 210</span>  RandomAccessIter * local_bin = &(bin_cache[cache_offset]);</div> |
| <div class="line"><a name="l00211"></a><span class="lineno"> 211</span>  next_bin_start += bin_sizes[0];</div> |
| <div class="line"><a name="l00212"></a><span class="lineno"> 212</span>  RandomAccessIter * target_bin;</div> |
| <div class="line"><a name="l00213"></a><span class="lineno"> 213</span>  <span class="comment">//Iterating over each element in the bin of empties</span></div> |
| <div class="line"><a name="l00214"></a><span class="lineno"> 214</span>  <span class="keywordflow">for</span> (RandomAccessIter current = *local_bin; current < next_bin_start;</div> |
| <div class="line"><a name="l00215"></a><span class="lineno"> 215</span>  ++current) {</div> |
| <div class="line"><a name="l00216"></a><span class="lineno"> 216</span>  <span class="comment">//empties belong in this bin</span></div> |
| <div class="line"><a name="l00217"></a><span class="lineno"> 217</span>  <span class="keywordflow">while</span> ((*current).size() > char_offset) {</div> |
| <div class="line"><a name="l00218"></a><span class="lineno"> 218</span>  target_bin =</div> |
| <div class="line"><a name="l00219"></a><span class="lineno"> 219</span>  bins + <span class="keyword">static_cast<</span>Unsigned_char_type<span class="keyword">></span>((*current)[char_offset]);</div> |
| <div class="line"><a name="l00220"></a><span class="lineno"> 220</span>  iter_swap(current, (*target_bin)++);</div> |
| <div class="line"><a name="l00221"></a><span class="lineno"> 221</span>  }</div> |
| <div class="line"><a name="l00222"></a><span class="lineno"> 222</span>  }</div> |
| <div class="line"><a name="l00223"></a><span class="lineno"> 223</span>  *local_bin = next_bin_start;</div> |
| <div class="line"><a name="l00224"></a><span class="lineno"> 224</span>  <span class="comment">//iterate backwards to find the last bin with elements in it</span></div> |
| <div class="line"><a name="l00225"></a><span class="lineno"> 225</span>  <span class="comment">//this saves iterations in multiple loops</span></div> |
| <div class="line"><a name="l00226"></a><span class="lineno"> 226</span>  <span class="keywordtype">unsigned</span> last_bin = bin_count - 1;</div> |
| <div class="line"><a name="l00227"></a><span class="lineno"> 227</span>  <span class="keywordflow">for</span> (; last_bin && !bin_sizes[last_bin + 1]; --last_bin);</div> |
| <div class="line"><a name="l00228"></a><span class="lineno"> 228</span>  <span class="comment">//This dominates runtime, mostly in the swap and bin lookups</span></div> |
| <div class="line"><a name="l00229"></a><span class="lineno"> 229</span>  <span class="keywordflow">for</span> (<span class="keywordtype">unsigned</span> u = 0; u < last_bin; ++u) {</div> |
| <div class="line"><a name="l00230"></a><span class="lineno"> 230</span>  local_bin = bins + u;</div> |
| <div class="line"><a name="l00231"></a><span class="lineno"> 231</span>  next_bin_start += bin_sizes[u + 1];</div> |
| <div class="line"><a name="l00232"></a><span class="lineno"> 232</span>  <span class="comment">//Iterating over each element in this bin</span></div> |
| <div class="line"><a name="l00233"></a><span class="lineno"> 233</span>  <span class="keywordflow">for</span> (RandomAccessIter current = *local_bin; current < next_bin_start;</div> |
| <div class="line"><a name="l00234"></a><span class="lineno"> 234</span>  ++current) {</div> |
| <div class="line"><a name="l00235"></a><span class="lineno"> 235</span>  <span class="comment">//Swapping into place until the correct element has been swapped in</span></div> |
| <div class="line"><a name="l00236"></a><span class="lineno"> 236</span>  <span class="keywordflow">for</span> (target_bin = bins + static_cast<Unsigned_char_type></div> |
| <div class="line"><a name="l00237"></a><span class="lineno"> 237</span>  ((*current)[char_offset]); target_bin != local_bin;</div> |
| <div class="line"><a name="l00238"></a><span class="lineno"> 238</span>  target_bin = bins + <span class="keyword">static_cast<</span>Unsigned_char_type<span class="keyword">></span></div> |
| <div class="line"><a name="l00239"></a><span class="lineno"> 239</span>  ((*current)[char_offset])) iter_swap(current, (*target_bin)++);</div> |
| <div class="line"><a name="l00240"></a><span class="lineno"> 240</span>  }</div> |
| <div class="line"><a name="l00241"></a><span class="lineno"> 241</span>  *local_bin = next_bin_start;</div> |
| <div class="line"><a name="l00242"></a><span class="lineno"> 242</span>  }</div> |
| <div class="line"><a name="l00243"></a><span class="lineno"> 243</span>  bins[last_bin] = last;</div> |
| <div class="line"><a name="l00244"></a><span class="lineno"> 244</span>  <span class="comment">//Recursing</span></div> |
| <div class="line"><a name="l00245"></a><span class="lineno"> 245</span>  RandomAccessIter lastPos = bin_cache[cache_offset];</div> |
| <div class="line"><a name="l00246"></a><span class="lineno"> 246</span>  <span class="comment">//Skip this loop for empties</span></div> |
| <div class="line"><a name="l00247"></a><span class="lineno"> 247</span>  <span class="keywordflow">for</span> (<span class="keywordtype">unsigned</span> u = cache_offset + 1; u < cache_offset + last_bin + 2;</div> |
| <div class="line"><a name="l00248"></a><span class="lineno"> 248</span>  lastPos = bin_cache[u], ++u) {</div> |
| <div class="line"><a name="l00249"></a><span class="lineno"> 249</span>  <span class="keywordtype">size_t</span> count = bin_cache[u] - lastPos;</div> |
| <div class="line"><a name="l00250"></a><span class="lineno"> 250</span>  <span class="comment">//don't sort unless there are at least two items to Compare</span></div> |
| <div class="line"><a name="l00251"></a><span class="lineno"> 251</span>  <span class="keywordflow">if</span> (count < 2)</div> |
| <div class="line"><a name="l00252"></a><span class="lineno"> 252</span>  <span class="keywordflow">continue</span>;</div> |
| <div class="line"><a name="l00253"></a><span class="lineno"> 253</span>  <span class="comment">//using std::sort if its worst-case is better</span></div> |
| <div class="line"><a name="l00254"></a><span class="lineno"> 254</span>  <span class="keywordflow">if</span> (count < max_size)</div> |
| <div class="line"><a name="l00255"></a><span class="lineno"> 255</span>  std::sort(lastPos, bin_cache[u],</div> |
| <div class="line"><a name="l00256"></a><span class="lineno"> 256</span>  <a class="code" href="structboost_1_1sort_1_1detail_1_1offset__less__than.html">offset_less_than<Data_type, Unsigned_char_type></a>(char_offset + 1));</div> |
| <div class="line"><a name="l00257"></a><span class="lineno"> 257</span>  <span class="keywordflow">else</span></div> |
| <div class="line"><a name="l00258"></a><span class="lineno"> 258</span>  string_sort_rec<RandomAccessIter, Unsigned_char_type>(lastPos,</div> |
| <div class="line"><a name="l00259"></a><span class="lineno"> 259</span>  bin_cache[u], char_offset + 1, bin_cache, cache_end, bin_sizes);</div> |
| <div class="line"><a name="l00260"></a><span class="lineno"> 260</span>  }</div> |
| <div class="line"><a name="l00261"></a><span class="lineno"> 261</span>  }</div> |
| <div class="line"><a name="l00262"></a><span class="lineno"> 262</span> </div> |
| <div class="line"><a name="l00263"></a><span class="lineno"> 263</span>  <span class="comment">//Sorts strings in reverse order, with empties at the end</span></div> |
| <div class="line"><a name="l00264"></a><span class="lineno"> 264</span>  <span class="keyword">template</span> <<span class="keyword">class</span> RandomAccessIter, <span class="keyword">class</span> Un<span class="keywordtype">signed</span>_<span class="keywordtype">char</span>_type></div> |
| <div class="line"><a name="l00265"></a><span class="lineno"> 265</span>  <span class="keyword">inline</span> <span class="keywordtype">void</span></div> |
| <div class="line"><a name="l00266"></a><span class="lineno"><a class="line" href="namespaceboost_1_1sort_1_1detail.html#a66be693262defeff06a4a3507155d4a3"> 266</a></span>  <a class="code" href="namespaceboost_1_1sort_1_1detail.html#a66be693262defeff06a4a3507155d4a3">reverse_string_sort_rec</a>(RandomAccessIter first, RandomAccessIter last,</div> |
| <div class="line"><a name="l00267"></a><span class="lineno"> 267</span>  <span class="keywordtype">size_t</span> char_offset,</div> |
| <div class="line"><a name="l00268"></a><span class="lineno"> 268</span>  std::vector<RandomAccessIter> &bin_cache,</div> |
| <div class="line"><a name="l00269"></a><span class="lineno"> 269</span>  <span class="keywordtype">unsigned</span> cache_offset,</div> |
| <div class="line"><a name="l00270"></a><span class="lineno"> 270</span>  <span class="keywordtype">size_t</span> *bin_sizes)</div> |
| <div class="line"><a name="l00271"></a><span class="lineno"> 271</span>  {</div> |
| <div class="line"><a name="l00272"></a><span class="lineno"> 272</span>  <span class="keyword">typedef</span> <span class="keyword">typename</span> std::iterator_traits<RandomAccessIter>::value_type</div> |
| <div class="line"><a name="l00273"></a><span class="lineno"> 273</span>  Data_type;</div> |
| <div class="line"><a name="l00274"></a><span class="lineno"> 274</span>  <span class="comment">//This section makes handling of long identical substrings much faster</span></div> |
| <div class="line"><a name="l00275"></a><span class="lineno"> 275</span>  <span class="comment">//with a mild average performance impact.</span></div> |
| <div class="line"><a name="l00276"></a><span class="lineno"> 276</span>  RandomAccessIter curr = first;</div> |
| <div class="line"><a name="l00277"></a><span class="lineno"> 277</span>  <span class="comment">//Iterate to the end of the empties. If all empty, return</span></div> |
| <div class="line"><a name="l00278"></a><span class="lineno"> 278</span>  <span class="keywordflow">while</span> ((*curr).size() <= char_offset) {</div> |
| <div class="line"><a name="l00279"></a><span class="lineno"> 279</span>  <span class="keywordflow">if</span> (++curr == last)</div> |
| <div class="line"><a name="l00280"></a><span class="lineno"> 280</span>  <span class="keywordflow">return</span>;</div> |
| <div class="line"><a name="l00281"></a><span class="lineno"> 281</span>  }</div> |
| <div class="line"><a name="l00282"></a><span class="lineno"> 282</span>  <span class="comment">//Getting the last non-empty</span></div> |
| <div class="line"><a name="l00283"></a><span class="lineno"> 283</span>  <span class="keywordflow">while</span> ((*(--last)).size() <= char_offset);</div> |
| <div class="line"><a name="l00284"></a><span class="lineno"> 284</span>  ++last;</div> |
| <div class="line"><a name="l00285"></a><span class="lineno"> 285</span>  <span class="comment">//Offsetting on identical characters. This section works</span></div> |
| <div class="line"><a name="l00286"></a><span class="lineno"> 286</span>  <span class="comment">//a few characters at a time for optimal worst-case performance.</span></div> |
| <div class="line"><a name="l00287"></a><span class="lineno"> 287</span>  update_offset<RandomAccessIter, Unsigned_char_type>(first, last,</div> |
| <div class="line"><a name="l00288"></a><span class="lineno"> 288</span>  char_offset);</div> |
| <div class="line"><a name="l00289"></a><span class="lineno"> 289</span>  RandomAccessIter * target_bin;</div> |
| <div class="line"><a name="l00290"></a><span class="lineno"> 290</span> </div> |
| <div class="line"><a name="l00291"></a><span class="lineno"> 291</span>  <span class="keyword">const</span> <span class="keywordtype">unsigned</span> bin_count = (1 << (<span class="keyword">sizeof</span>(Unsigned_char_type)*8));</div> |
| <div class="line"><a name="l00292"></a><span class="lineno"> 292</span>  <span class="comment">//Equal worst-case of radix and comparison when bin_count = n*log(n).</span></div> |
| <div class="line"><a name="l00293"></a><span class="lineno"> 293</span>  <span class="keyword">const</span> <span class="keywordtype">unsigned</span> max_size = bin_count;</div> |
| <div class="line"><a name="l00294"></a><span class="lineno"> 294</span>  <span class="keyword">const</span> <span class="keywordtype">unsigned</span> membin_count = bin_count + 1;</div> |
| <div class="line"><a name="l00295"></a><span class="lineno"> 295</span>  <span class="keyword">const</span> <span class="keywordtype">unsigned</span> max_bin = bin_count - 1;</div> |
| <div class="line"><a name="l00296"></a><span class="lineno"> 296</span>  <span class="keywordtype">unsigned</span> cache_end;</div> |
| <div class="line"><a name="l00297"></a><span class="lineno"> 297</span>  RandomAccessIter * bins = <a class="code" href="namespaceboost_1_1sort_1_1detail.html#ad5b7d31fba809eae5d17f5c2fb0a385b">size_bins</a>(bin_sizes, bin_cache, cache_offset,</div> |
| <div class="line"><a name="l00298"></a><span class="lineno"> 298</span>  cache_end, membin_count);</div> |
| <div class="line"><a name="l00299"></a><span class="lineno"> 299</span>  RandomAccessIter * end_bin = &(bin_cache[cache_offset + max_bin]);</div> |
| <div class="line"><a name="l00300"></a><span class="lineno"> 300</span> </div> |
| <div class="line"><a name="l00301"></a><span class="lineno"> 301</span>  <span class="comment">//Calculating the size of each bin; this takes roughly 10% of runtime</span></div> |
| <div class="line"><a name="l00302"></a><span class="lineno"> 302</span>  <span class="keywordflow">for</span> (RandomAccessIter current = first; current != last; ++current) {</div> |
| <div class="line"><a name="l00303"></a><span class="lineno"> 303</span>  <span class="keywordflow">if</span> ((*current).size() <= char_offset) {</div> |
| <div class="line"><a name="l00304"></a><span class="lineno"> 304</span>  bin_sizes[bin_count]++;</div> |
| <div class="line"><a name="l00305"></a><span class="lineno"> 305</span>  }</div> |
| <div class="line"><a name="l00306"></a><span class="lineno"> 306</span>  <span class="keywordflow">else</span></div> |
| <div class="line"><a name="l00307"></a><span class="lineno"> 307</span>  bin_sizes[max_bin - <span class="keyword">static_cast<</span>Unsigned_char_type<span class="keyword">></span></div> |
| <div class="line"><a name="l00308"></a><span class="lineno"> 308</span>  ((*current)[char_offset])]++;</div> |
| <div class="line"><a name="l00309"></a><span class="lineno"> 309</span>  }</div> |
| <div class="line"><a name="l00310"></a><span class="lineno"> 310</span>  <span class="comment">//Assign the bin positions</span></div> |
| <div class="line"><a name="l00311"></a><span class="lineno"> 311</span>  bin_cache[cache_offset] = first;</div> |
| <div class="line"><a name="l00312"></a><span class="lineno"> 312</span>  <span class="keywordflow">for</span> (<span class="keywordtype">unsigned</span> u = 0; u < membin_count - 1; u++)</div> |
| <div class="line"><a name="l00313"></a><span class="lineno"> 313</span>  bin_cache[cache_offset + u + 1] =</div> |
| <div class="line"><a name="l00314"></a><span class="lineno"> 314</span>  bin_cache[cache_offset + u] + bin_sizes[u];</div> |
| <div class="line"><a name="l00315"></a><span class="lineno"> 315</span> </div> |
| <div class="line"><a name="l00316"></a><span class="lineno"> 316</span>  <span class="comment">//Swap into place</span></div> |
| <div class="line"><a name="l00317"></a><span class="lineno"> 317</span>  RandomAccessIter next_bin_start = last;</div> |
| <div class="line"><a name="l00318"></a><span class="lineno"> 318</span>  <span class="comment">//handling empty bins</span></div> |
| <div class="line"><a name="l00319"></a><span class="lineno"> 319</span>  RandomAccessIter * local_bin = &(bin_cache[cache_offset + bin_count]);</div> |
| <div class="line"><a name="l00320"></a><span class="lineno"> 320</span>  RandomAccessIter lastFull = *local_bin;</div> |
| <div class="line"><a name="l00321"></a><span class="lineno"> 321</span>  <span class="comment">//Iterating over each element in the bin of empties</span></div> |
| <div class="line"><a name="l00322"></a><span class="lineno"> 322</span>  <span class="keywordflow">for</span> (RandomAccessIter current = *local_bin; current < next_bin_start;</div> |
| <div class="line"><a name="l00323"></a><span class="lineno"> 323</span>  ++current) {</div> |
| <div class="line"><a name="l00324"></a><span class="lineno"> 324</span>  <span class="comment">//empties belong in this bin</span></div> |
| <div class="line"><a name="l00325"></a><span class="lineno"> 325</span>  <span class="keywordflow">while</span> ((*current).size() > char_offset) {</div> |
| <div class="line"><a name="l00326"></a><span class="lineno"> 326</span>  target_bin =</div> |
| <div class="line"><a name="l00327"></a><span class="lineno"> 327</span>  end_bin - <span class="keyword">static_cast<</span>Unsigned_char_type<span class="keyword">></span>((*current)[char_offset]);</div> |
| <div class="line"><a name="l00328"></a><span class="lineno"> 328</span>  iter_swap(current, (*target_bin)++);</div> |
| <div class="line"><a name="l00329"></a><span class="lineno"> 329</span>  }</div> |
| <div class="line"><a name="l00330"></a><span class="lineno"> 330</span>  }</div> |
| <div class="line"><a name="l00331"></a><span class="lineno"> 331</span>  *local_bin = next_bin_start;</div> |
| <div class="line"><a name="l00332"></a><span class="lineno"> 332</span>  next_bin_start = first;</div> |
| <div class="line"><a name="l00333"></a><span class="lineno"> 333</span>  <span class="comment">//iterate backwards to find the last non-empty bin</span></div> |
| <div class="line"><a name="l00334"></a><span class="lineno"> 334</span>  <span class="comment">//this saves iterations in multiple loops</span></div> |
| <div class="line"><a name="l00335"></a><span class="lineno"> 335</span>  <span class="keywordtype">unsigned</span> last_bin = max_bin;</div> |
| <div class="line"><a name="l00336"></a><span class="lineno"> 336</span>  <span class="keywordflow">for</span> (; last_bin && !bin_sizes[last_bin]; --last_bin);</div> |
| <div class="line"><a name="l00337"></a><span class="lineno"> 337</span>  <span class="comment">//This dominates runtime, mostly in the swap and bin lookups</span></div> |
| <div class="line"><a name="l00338"></a><span class="lineno"> 338</span>  <span class="keywordflow">for</span> (<span class="keywordtype">unsigned</span> u = 0; u < last_bin; ++u) {</div> |
| <div class="line"><a name="l00339"></a><span class="lineno"> 339</span>  local_bin = bins + u;</div> |
| <div class="line"><a name="l00340"></a><span class="lineno"> 340</span>  next_bin_start += bin_sizes[u];</div> |
| <div class="line"><a name="l00341"></a><span class="lineno"> 341</span>  <span class="comment">//Iterating over each element in this bin</span></div> |
| <div class="line"><a name="l00342"></a><span class="lineno"> 342</span>  <span class="keywordflow">for</span> (RandomAccessIter current = *local_bin; current < next_bin_start;</div> |
| <div class="line"><a name="l00343"></a><span class="lineno"> 343</span>  ++current) {</div> |
| <div class="line"><a name="l00344"></a><span class="lineno"> 344</span>  <span class="comment">//Swapping into place until the correct element has been swapped in</span></div> |
| <div class="line"><a name="l00345"></a><span class="lineno"> 345</span>  <span class="keywordflow">for</span> (target_bin =</div> |
| <div class="line"><a name="l00346"></a><span class="lineno"> 346</span>  end_bin - static_cast<Unsigned_char_type>((*current)[char_offset]);</div> |
| <div class="line"><a name="l00347"></a><span class="lineno"> 347</span>  target_bin != local_bin;</div> |
| <div class="line"><a name="l00348"></a><span class="lineno"> 348</span>  target_bin =</div> |
| <div class="line"><a name="l00349"></a><span class="lineno"> 349</span>  end_bin - <span class="keyword">static_cast<</span>Unsigned_char_type<span class="keyword">></span>((*current)[char_offset]))</div> |
| <div class="line"><a name="l00350"></a><span class="lineno"> 350</span>  iter_swap(current, (*target_bin)++);</div> |
| <div class="line"><a name="l00351"></a><span class="lineno"> 351</span>  }</div> |
| <div class="line"><a name="l00352"></a><span class="lineno"> 352</span>  *local_bin = next_bin_start;</div> |
| <div class="line"><a name="l00353"></a><span class="lineno"> 353</span>  }</div> |
| <div class="line"><a name="l00354"></a><span class="lineno"> 354</span>  bins[last_bin] = lastFull;</div> |
| <div class="line"><a name="l00355"></a><span class="lineno"> 355</span>  <span class="comment">//Recursing</span></div> |
| <div class="line"><a name="l00356"></a><span class="lineno"> 356</span>  RandomAccessIter lastPos = first;</div> |
| <div class="line"><a name="l00357"></a><span class="lineno"> 357</span>  <span class="comment">//Skip this loop for empties</span></div> |
| <div class="line"><a name="l00358"></a><span class="lineno"> 358</span>  <span class="keywordflow">for</span> (<span class="keywordtype">unsigned</span> u = cache_offset; u <= cache_offset + last_bin;</div> |
| <div class="line"><a name="l00359"></a><span class="lineno"> 359</span>  lastPos = bin_cache[u], ++u) {</div> |
| <div class="line"><a name="l00360"></a><span class="lineno"> 360</span>  <span class="keywordtype">size_t</span> count = bin_cache[u] - lastPos;</div> |
| <div class="line"><a name="l00361"></a><span class="lineno"> 361</span>  <span class="comment">//don't sort unless there are at least two items to Compare</span></div> |
| <div class="line"><a name="l00362"></a><span class="lineno"> 362</span>  <span class="keywordflow">if</span> (count < 2)</div> |
| <div class="line"><a name="l00363"></a><span class="lineno"> 363</span>  <span class="keywordflow">continue</span>;</div> |
| <div class="line"><a name="l00364"></a><span class="lineno"> 364</span>  <span class="comment">//using std::sort if its worst-case is better</span></div> |
| <div class="line"><a name="l00365"></a><span class="lineno"> 365</span>  <span class="keywordflow">if</span> (count < max_size)</div> |
| <div class="line"><a name="l00366"></a><span class="lineno"> 366</span>  std::sort(lastPos, bin_cache[u], <a class="code" href="structboost_1_1sort_1_1detail_1_1offset__greater__than.html">offset_greater_than</a><Data_type,</div> |
| <div class="line"><a name="l00367"></a><span class="lineno"> 367</span>  Unsigned_char_type>(char_offset + 1));</div> |
| <div class="line"><a name="l00368"></a><span class="lineno"> 368</span>  <span class="keywordflow">else</span></div> |
| <div class="line"><a name="l00369"></a><span class="lineno"> 369</span>  reverse_string_sort_rec<RandomAccessIter, Unsigned_char_type></div> |
| <div class="line"><a name="l00370"></a><span class="lineno"> 370</span>  (lastPos, bin_cache[u], char_offset + 1, bin_cache, cache_end, bin_sizes);</div> |
| <div class="line"><a name="l00371"></a><span class="lineno"> 371</span>  }</div> |
| <div class="line"><a name="l00372"></a><span class="lineno"> 372</span>  }</div> |
| <div class="line"><a name="l00373"></a><span class="lineno"> 373</span> </div> |
| <div class="line"><a name="l00374"></a><span class="lineno"> 374</span>  <span class="comment">//String sorting recursive implementation</span></div> |
| <div class="line"><a name="l00375"></a><span class="lineno"> 375</span>  <span class="keyword">template</span> <<span class="keyword">class </span>RandomAccessIter, <span class="keyword">class </span>Unsigned_char_type, <span class="keyword">class </span>Get_char,</div> |
| <div class="line"><a name="l00376"></a><span class="lineno"> 376</span>  <span class="keyword">class </span>Get_length></div> |
| <div class="line"><a name="l00377"></a><span class="lineno"> 377</span>  <span class="keyword">inline</span> <span class="keywordtype">void</span></div> |
| <div class="line"><a name="l00378"></a><span class="lineno"><a class="line" href="namespaceboost_1_1sort_1_1detail.html#af825e4484173e0b886d0b24f66ae4a64"> 378</a></span>  <a class="code" href="namespaceboost_1_1sort_1_1detail.html#ad1655ab39e410e18b6e8b6694405e5ba">string_sort_rec</a>(RandomAccessIter first, RandomAccessIter last,</div> |
| <div class="line"><a name="l00379"></a><span class="lineno"> 379</span>  <span class="keywordtype">size_t</span> char_offset, std::vector<RandomAccessIter> &bin_cache,</div> |
| <div class="line"><a name="l00380"></a><span class="lineno"> 380</span>  <span class="keywordtype">unsigned</span> cache_offset, <span class="keywordtype">size_t</span> *bin_sizes,</div> |
| <div class="line"><a name="l00381"></a><span class="lineno"> 381</span>  Get_char getchar, Get_length length)</div> |
| <div class="line"><a name="l00382"></a><span class="lineno"> 382</span>  {</div> |
| <div class="line"><a name="l00383"></a><span class="lineno"> 383</span>  <span class="keyword">typedef</span> <span class="keyword">typename</span> std::iterator_traits<RandomAccessIter>::value_type</div> |
| <div class="line"><a name="l00384"></a><span class="lineno"> 384</span>  Data_type;</div> |
| <div class="line"><a name="l00385"></a><span class="lineno"> 385</span>  <span class="comment">//This section makes handling of long identical substrings much faster</span></div> |
| <div class="line"><a name="l00386"></a><span class="lineno"> 386</span>  <span class="comment">//with a mild average performance impact.</span></div> |
| <div class="line"><a name="l00387"></a><span class="lineno"> 387</span>  <span class="comment">//Iterate to the end of the empties. If all empty, return</span></div> |
| <div class="line"><a name="l00388"></a><span class="lineno"> 388</span>  <span class="keywordflow">while</span> (length(*first) <= char_offset) {</div> |
| <div class="line"><a name="l00389"></a><span class="lineno"> 389</span>  <span class="keywordflow">if</span> (++first == last)</div> |
| <div class="line"><a name="l00390"></a><span class="lineno"> 390</span>  <span class="keywordflow">return</span>;</div> |
| <div class="line"><a name="l00391"></a><span class="lineno"> 391</span>  }</div> |
| <div class="line"><a name="l00392"></a><span class="lineno"> 392</span>  RandomAccessIter finish = last - 1;</div> |
| <div class="line"><a name="l00393"></a><span class="lineno"> 393</span>  <span class="comment">//Getting the last non-empty</span></div> |
| <div class="line"><a name="l00394"></a><span class="lineno"> 394</span>  <span class="keywordflow">for</span> (;length(*finish) <= char_offset; --finish);</div> |
| <div class="line"><a name="l00395"></a><span class="lineno"> 395</span>  ++finish;</div> |
| <div class="line"><a name="l00396"></a><span class="lineno"> 396</span>  <a class="code" href="namespaceboost_1_1sort_1_1detail.html#a585497946eeb8cc1d2072642d7f1da01">update_offset</a>(first, finish, char_offset, getchar, length);</div> |
| <div class="line"><a name="l00397"></a><span class="lineno"> 397</span> </div> |
| <div class="line"><a name="l00398"></a><span class="lineno"> 398</span>  <span class="keyword">const</span> <span class="keywordtype">unsigned</span> bin_count = (1 << (<span class="keyword">sizeof</span>(Unsigned_char_type)*8));</div> |
| <div class="line"><a name="l00399"></a><span class="lineno"> 399</span>  <span class="comment">//Equal worst-case of radix and comparison is when bin_count = n*log(n).</span></div> |
| <div class="line"><a name="l00400"></a><span class="lineno"> 400</span>  <span class="keyword">const</span> <span class="keywordtype">unsigned</span> max_size = bin_count;</div> |
| <div class="line"><a name="l00401"></a><span class="lineno"> 401</span>  <span class="keyword">const</span> <span class="keywordtype">unsigned</span> membin_count = bin_count + 1;</div> |
| <div class="line"><a name="l00402"></a><span class="lineno"> 402</span>  <span class="keywordtype">unsigned</span> cache_end;</div> |
| <div class="line"><a name="l00403"></a><span class="lineno"> 403</span>  RandomAccessIter * bins = <a class="code" href="namespaceboost_1_1sort_1_1detail.html#ad5b7d31fba809eae5d17f5c2fb0a385b">size_bins</a>(bin_sizes, bin_cache, cache_offset,</div> |
| <div class="line"><a name="l00404"></a><span class="lineno"> 404</span>  cache_end, membin_count) + 1;</div> |
| <div class="line"><a name="l00405"></a><span class="lineno"> 405</span> </div> |
| <div class="line"><a name="l00406"></a><span class="lineno"> 406</span>  <span class="comment">//Calculating the size of each bin; this takes roughly 10% of runtime</span></div> |
| <div class="line"><a name="l00407"></a><span class="lineno"> 407</span>  <span class="keywordflow">for</span> (RandomAccessIter current = first; current != last; ++current) {</div> |
| <div class="line"><a name="l00408"></a><span class="lineno"> 408</span>  <span class="keywordflow">if</span> (length(*current) <= char_offset) {</div> |
| <div class="line"><a name="l00409"></a><span class="lineno"> 409</span>  bin_sizes[0]++;</div> |
| <div class="line"><a name="l00410"></a><span class="lineno"> 410</span>  }</div> |
| <div class="line"><a name="l00411"></a><span class="lineno"> 411</span>  <span class="keywordflow">else</span></div> |
| <div class="line"><a name="l00412"></a><span class="lineno"> 412</span>  bin_sizes[getchar((*current), char_offset) + 1]++;</div> |
| <div class="line"><a name="l00413"></a><span class="lineno"> 413</span>  }</div> |
| <div class="line"><a name="l00414"></a><span class="lineno"> 414</span>  <span class="comment">//Assign the bin positions</span></div> |
| <div class="line"><a name="l00415"></a><span class="lineno"> 415</span>  bin_cache[cache_offset] = first;</div> |
| <div class="line"><a name="l00416"></a><span class="lineno"> 416</span>  <span class="keywordflow">for</span> (<span class="keywordtype">unsigned</span> u = 0; u < membin_count - 1; u++)</div> |
| <div class="line"><a name="l00417"></a><span class="lineno"> 417</span>  bin_cache[cache_offset + u + 1] =</div> |
| <div class="line"><a name="l00418"></a><span class="lineno"> 418</span>  bin_cache[cache_offset + u] + bin_sizes[u];</div> |
| <div class="line"><a name="l00419"></a><span class="lineno"> 419</span> </div> |
| <div class="line"><a name="l00420"></a><span class="lineno"> 420</span>  <span class="comment">//Swap into place</span></div> |
| <div class="line"><a name="l00421"></a><span class="lineno"> 421</span>  RandomAccessIter next_bin_start = first;</div> |
| <div class="line"><a name="l00422"></a><span class="lineno"> 422</span>  <span class="comment">//handling empty bins</span></div> |
| <div class="line"><a name="l00423"></a><span class="lineno"> 423</span>  RandomAccessIter * local_bin = &(bin_cache[cache_offset]);</div> |
| <div class="line"><a name="l00424"></a><span class="lineno"> 424</span>  next_bin_start += bin_sizes[0];</div> |
| <div class="line"><a name="l00425"></a><span class="lineno"> 425</span>  RandomAccessIter * target_bin;</div> |
| <div class="line"><a name="l00426"></a><span class="lineno"> 426</span>  <span class="comment">//Iterating over each element in the bin of empties</span></div> |
| <div class="line"><a name="l00427"></a><span class="lineno"> 427</span>  <span class="keywordflow">for</span> (RandomAccessIter current = *local_bin; current < next_bin_start;</div> |
| <div class="line"><a name="l00428"></a><span class="lineno"> 428</span>  ++current) {</div> |
| <div class="line"><a name="l00429"></a><span class="lineno"> 429</span>  <span class="comment">//empties belong in this bin</span></div> |
| <div class="line"><a name="l00430"></a><span class="lineno"> 430</span>  <span class="keywordflow">while</span> (length(*current) > char_offset) {</div> |
| <div class="line"><a name="l00431"></a><span class="lineno"> 431</span>  target_bin = bins + getchar((*current), char_offset);</div> |
| <div class="line"><a name="l00432"></a><span class="lineno"> 432</span>  iter_swap(current, (*target_bin)++);</div> |
| <div class="line"><a name="l00433"></a><span class="lineno"> 433</span>  }</div> |
| <div class="line"><a name="l00434"></a><span class="lineno"> 434</span>  }</div> |
| <div class="line"><a name="l00435"></a><span class="lineno"> 435</span>  *local_bin = next_bin_start;</div> |
| <div class="line"><a name="l00436"></a><span class="lineno"> 436</span>  <span class="comment">//iterate backwards to find the last bin with elements in it</span></div> |
| <div class="line"><a name="l00437"></a><span class="lineno"> 437</span>  <span class="comment">//this saves iterations in multiple loops</span></div> |
| <div class="line"><a name="l00438"></a><span class="lineno"> 438</span>  <span class="keywordtype">unsigned</span> last_bin = bin_count - 1;</div> |
| <div class="line"><a name="l00439"></a><span class="lineno"> 439</span>  <span class="keywordflow">for</span> (; last_bin && !bin_sizes[last_bin + 1]; --last_bin);</div> |
| <div class="line"><a name="l00440"></a><span class="lineno"> 440</span>  <span class="comment">//This dominates runtime, mostly in the swap and bin lookups</span></div> |
| <div class="line"><a name="l00441"></a><span class="lineno"> 441</span>  <span class="keywordflow">for</span> (<span class="keywordtype">unsigned</span> ii = 0; ii < last_bin; ++ii) {</div> |
| <div class="line"><a name="l00442"></a><span class="lineno"> 442</span>  local_bin = bins + ii;</div> |
| <div class="line"><a name="l00443"></a><span class="lineno"> 443</span>  next_bin_start += bin_sizes[ii + 1];</div> |
| <div class="line"><a name="l00444"></a><span class="lineno"> 444</span>  <span class="comment">//Iterating over each element in this bin</span></div> |
| <div class="line"><a name="l00445"></a><span class="lineno"> 445</span>  <span class="keywordflow">for</span> (RandomAccessIter current = *local_bin; current < next_bin_start;</div> |
| <div class="line"><a name="l00446"></a><span class="lineno"> 446</span>  ++current) {</div> |
| <div class="line"><a name="l00447"></a><span class="lineno"> 447</span>  <span class="comment">//Swapping into place until the correct element has been swapped in</span></div> |
| <div class="line"><a name="l00448"></a><span class="lineno"> 448</span>  <span class="keywordflow">for</span> (target_bin = bins + getchar((*current), char_offset);</div> |
| <div class="line"><a name="l00449"></a><span class="lineno"> 449</span>  target_bin != local_bin;</div> |
| <div class="line"><a name="l00450"></a><span class="lineno"> 450</span>  target_bin = bins + getchar((*current), char_offset))</div> |
| <div class="line"><a name="l00451"></a><span class="lineno"> 451</span>  iter_swap(current, (*target_bin)++);</div> |
| <div class="line"><a name="l00452"></a><span class="lineno"> 452</span>  }</div> |
| <div class="line"><a name="l00453"></a><span class="lineno"> 453</span>  *local_bin = next_bin_start;</div> |
| <div class="line"><a name="l00454"></a><span class="lineno"> 454</span>  }</div> |
| <div class="line"><a name="l00455"></a><span class="lineno"> 455</span>  bins[last_bin] = last;</div> |
| <div class="line"><a name="l00456"></a><span class="lineno"> 456</span> </div> |
| <div class="line"><a name="l00457"></a><span class="lineno"> 457</span>  <span class="comment">//Recursing</span></div> |
| <div class="line"><a name="l00458"></a><span class="lineno"> 458</span>  RandomAccessIter lastPos = bin_cache[cache_offset];</div> |
| <div class="line"><a name="l00459"></a><span class="lineno"> 459</span>  <span class="comment">//Skip this loop for empties</span></div> |
| <div class="line"><a name="l00460"></a><span class="lineno"> 460</span>  <span class="keywordflow">for</span> (<span class="keywordtype">unsigned</span> u = cache_offset + 1; u < cache_offset + last_bin + 2;</div> |
| <div class="line"><a name="l00461"></a><span class="lineno"> 461</span>  lastPos = bin_cache[u], ++u) {</div> |
| <div class="line"><a name="l00462"></a><span class="lineno"> 462</span>  <span class="keywordtype">size_t</span> count = bin_cache[u] - lastPos;</div> |
| <div class="line"><a name="l00463"></a><span class="lineno"> 463</span>  <span class="comment">//don't sort unless there are at least two items to Compare</span></div> |
| <div class="line"><a name="l00464"></a><span class="lineno"> 464</span>  <span class="keywordflow">if</span> (count < 2)</div> |
| <div class="line"><a name="l00465"></a><span class="lineno"> 465</span>  <span class="keywordflow">continue</span>;</div> |
| <div class="line"><a name="l00466"></a><span class="lineno"> 466</span>  <span class="comment">//using std::sort if its worst-case is better</span></div> |
| <div class="line"><a name="l00467"></a><span class="lineno"> 467</span>  <span class="keywordflow">if</span> (count < max_size)</div> |
| <div class="line"><a name="l00468"></a><span class="lineno"> 468</span>  std::sort(lastPos, bin_cache[u], <a class="code" href="structboost_1_1sort_1_1detail_1_1offset__char__less__than.html">offset_char_less_than</a><Data_type,</div> |
| <div class="line"><a name="l00469"></a><span class="lineno"> 469</span>  Get_char, Get_length>(char_offset + 1));</div> |
| <div class="line"><a name="l00470"></a><span class="lineno"> 470</span>  <span class="keywordflow">else</span></div> |
| <div class="line"><a name="l00471"></a><span class="lineno"> 471</span>  <a class="code" href="namespaceboost_1_1sort_1_1detail.html#ad1655ab39e410e18b6e8b6694405e5ba">string_sort_rec</a><RandomAccessIter, Unsigned_char_type, Get_char,</div> |
| <div class="line"><a name="l00472"></a><span class="lineno"> 472</span>  Get_length>(lastPos, bin_cache[u], char_offset + 1, bin_cache,</div> |
| <div class="line"><a name="l00473"></a><span class="lineno"> 473</span>  cache_end, bin_sizes, getchar, length);</div> |
| <div class="line"><a name="l00474"></a><span class="lineno"> 474</span>  }</div> |
| <div class="line"><a name="l00475"></a><span class="lineno"> 475</span>  }</div> |
| <div class="line"><a name="l00476"></a><span class="lineno"> 476</span> </div> |
| <div class="line"><a name="l00477"></a><span class="lineno"> 477</span>  <span class="comment">//String sorting recursive implementation</span></div> |
| <div class="line"><a name="l00478"></a><span class="lineno"> 478</span>  <span class="keyword">template</span> <<span class="keyword">class </span>RandomAccessIter, <span class="keyword">class </span>Unsigned_char_type, <span class="keyword">class </span>Get_char,</div> |
| <div class="line"><a name="l00479"></a><span class="lineno"> 479</span>  <span class="keyword">class </span>Get_length, <span class="keyword">class </span>Compare></div> |
| <div class="line"><a name="l00480"></a><span class="lineno"> 480</span>  <span class="keyword">inline</span> <span class="keywordtype">void</span></div> |
| <div class="line"><a name="l00481"></a><span class="lineno"><a class="line" href="namespaceboost_1_1sort_1_1detail.html#a49ccfc022cfef8a14bbbbeccd36d78ec"> 481</a></span>  <a class="code" href="namespaceboost_1_1sort_1_1detail.html#ad1655ab39e410e18b6e8b6694405e5ba">string_sort_rec</a>(RandomAccessIter first, RandomAccessIter last,</div> |
| <div class="line"><a name="l00482"></a><span class="lineno"> 482</span>  <span class="keywordtype">size_t</span> char_offset, std::vector<RandomAccessIter> &bin_cache,</div> |
| <div class="line"><a name="l00483"></a><span class="lineno"> 483</span>  <span class="keywordtype">unsigned</span> cache_offset, <span class="keywordtype">size_t</span> *bin_sizes,</div> |
| <div class="line"><a name="l00484"></a><span class="lineno"> 484</span>  Get_char getchar, Get_length length, Compare comp)</div> |
| <div class="line"><a name="l00485"></a><span class="lineno"> 485</span>  {</div> |
| <div class="line"><a name="l00486"></a><span class="lineno"> 486</span>  <span class="comment">//This section makes handling of long identical substrings much faster</span></div> |
| <div class="line"><a name="l00487"></a><span class="lineno"> 487</span>  <span class="comment">//with a mild average performance impact.</span></div> |
| <div class="line"><a name="l00488"></a><span class="lineno"> 488</span>  <span class="comment">//Iterate to the end of the empties. If all empty, return</span></div> |
| <div class="line"><a name="l00489"></a><span class="lineno"> 489</span>  <span class="keywordflow">while</span> (length(*first) <= char_offset) {</div> |
| <div class="line"><a name="l00490"></a><span class="lineno"> 490</span>  <span class="keywordflow">if</span> (++first == last)</div> |
| <div class="line"><a name="l00491"></a><span class="lineno"> 491</span>  <span class="keywordflow">return</span>;</div> |
| <div class="line"><a name="l00492"></a><span class="lineno"> 492</span>  }</div> |
| <div class="line"><a name="l00493"></a><span class="lineno"> 493</span>  RandomAccessIter finish = last - 1;</div> |
| <div class="line"><a name="l00494"></a><span class="lineno"> 494</span>  <span class="comment">//Getting the last non-empty</span></div> |
| <div class="line"><a name="l00495"></a><span class="lineno"> 495</span>  <span class="keywordflow">for</span> (;length(*finish) <= char_offset; --finish);</div> |
| <div class="line"><a name="l00496"></a><span class="lineno"> 496</span>  ++finish;</div> |
| <div class="line"><a name="l00497"></a><span class="lineno"> 497</span>  <a class="code" href="namespaceboost_1_1sort_1_1detail.html#a585497946eeb8cc1d2072642d7f1da01">update_offset</a>(first, finish, char_offset, getchar, length);</div> |
| <div class="line"><a name="l00498"></a><span class="lineno"> 498</span> </div> |
| <div class="line"><a name="l00499"></a><span class="lineno"> 499</span>  <span class="keyword">const</span> <span class="keywordtype">unsigned</span> bin_count = (1 << (<span class="keyword">sizeof</span>(Unsigned_char_type)*8));</div> |
| <div class="line"><a name="l00500"></a><span class="lineno"> 500</span>  <span class="comment">//Equal worst-case of radix and comparison is when bin_count = n*log(n).</span></div> |
| <div class="line"><a name="l00501"></a><span class="lineno"> 501</span>  <span class="keyword">const</span> <span class="keywordtype">unsigned</span> max_size = bin_count;</div> |
| <div class="line"><a name="l00502"></a><span class="lineno"> 502</span>  <span class="keyword">const</span> <span class="keywordtype">unsigned</span> membin_count = bin_count + 1;</div> |
| <div class="line"><a name="l00503"></a><span class="lineno"> 503</span>  <span class="keywordtype">unsigned</span> cache_end;</div> |
| <div class="line"><a name="l00504"></a><span class="lineno"> 504</span>  RandomAccessIter * bins = <a class="code" href="namespaceboost_1_1sort_1_1detail.html#ad5b7d31fba809eae5d17f5c2fb0a385b">size_bins</a>(bin_sizes, bin_cache, cache_offset,</div> |
| <div class="line"><a name="l00505"></a><span class="lineno"> 505</span>  cache_end, membin_count) + 1;</div> |
| <div class="line"><a name="l00506"></a><span class="lineno"> 506</span> </div> |
| <div class="line"><a name="l00507"></a><span class="lineno"> 507</span>  <span class="comment">//Calculating the size of each bin; this takes roughly 10% of runtime</span></div> |
| <div class="line"><a name="l00508"></a><span class="lineno"> 508</span>  <span class="keywordflow">for</span> (RandomAccessIter current = first; current != last; ++current) {</div> |
| <div class="line"><a name="l00509"></a><span class="lineno"> 509</span>  <span class="keywordflow">if</span> (length(*current) <= char_offset) {</div> |
| <div class="line"><a name="l00510"></a><span class="lineno"> 510</span>  bin_sizes[0]++;</div> |
| <div class="line"><a name="l00511"></a><span class="lineno"> 511</span>  }</div> |
| <div class="line"><a name="l00512"></a><span class="lineno"> 512</span>  <span class="keywordflow">else</span></div> |
| <div class="line"><a name="l00513"></a><span class="lineno"> 513</span>  bin_sizes[getchar((*current), char_offset) + 1]++;</div> |
| <div class="line"><a name="l00514"></a><span class="lineno"> 514</span>  }</div> |
| <div class="line"><a name="l00515"></a><span class="lineno"> 515</span>  <span class="comment">//Assign the bin positions</span></div> |
| <div class="line"><a name="l00516"></a><span class="lineno"> 516</span>  bin_cache[cache_offset] = first;</div> |
| <div class="line"><a name="l00517"></a><span class="lineno"> 517</span>  <span class="keywordflow">for</span> (<span class="keywordtype">unsigned</span> u = 0; u < membin_count - 1; u++)</div> |
| <div class="line"><a name="l00518"></a><span class="lineno"> 518</span>  bin_cache[cache_offset + u + 1] =</div> |
| <div class="line"><a name="l00519"></a><span class="lineno"> 519</span>  bin_cache[cache_offset + u] + bin_sizes[u];</div> |
| <div class="line"><a name="l00520"></a><span class="lineno"> 520</span> </div> |
| <div class="line"><a name="l00521"></a><span class="lineno"> 521</span>  <span class="comment">//Swap into place</span></div> |
| <div class="line"><a name="l00522"></a><span class="lineno"> 522</span>  RandomAccessIter next_bin_start = first;</div> |
| <div class="line"><a name="l00523"></a><span class="lineno"> 523</span>  <span class="comment">//handling empty bins</span></div> |
| <div class="line"><a name="l00524"></a><span class="lineno"> 524</span>  RandomAccessIter * local_bin = &(bin_cache[cache_offset]);</div> |
| <div class="line"><a name="l00525"></a><span class="lineno"> 525</span>  next_bin_start += bin_sizes[0];</div> |
| <div class="line"><a name="l00526"></a><span class="lineno"> 526</span>  RandomAccessIter * target_bin;</div> |
| <div class="line"><a name="l00527"></a><span class="lineno"> 527</span>  <span class="comment">//Iterating over each element in the bin of empties</span></div> |
| <div class="line"><a name="l00528"></a><span class="lineno"> 528</span>  <span class="keywordflow">for</span> (RandomAccessIter current = *local_bin; current < next_bin_start;</div> |
| <div class="line"><a name="l00529"></a><span class="lineno"> 529</span>  ++current) {</div> |
| <div class="line"><a name="l00530"></a><span class="lineno"> 530</span>  <span class="comment">//empties belong in this bin</span></div> |
| <div class="line"><a name="l00531"></a><span class="lineno"> 531</span>  <span class="keywordflow">while</span> (length(*current) > char_offset) {</div> |
| <div class="line"><a name="l00532"></a><span class="lineno"> 532</span>  target_bin = bins + getchar((*current), char_offset);</div> |
| <div class="line"><a name="l00533"></a><span class="lineno"> 533</span>  iter_swap(current, (*target_bin)++);</div> |
| <div class="line"><a name="l00534"></a><span class="lineno"> 534</span>  }</div> |
| <div class="line"><a name="l00535"></a><span class="lineno"> 535</span>  }</div> |
| <div class="line"><a name="l00536"></a><span class="lineno"> 536</span>  *local_bin = next_bin_start;</div> |
| <div class="line"><a name="l00537"></a><span class="lineno"> 537</span>  <span class="comment">//iterate backwards to find the last bin with elements in it</span></div> |
| <div class="line"><a name="l00538"></a><span class="lineno"> 538</span>  <span class="comment">//this saves iterations in multiple loops</span></div> |
| <div class="line"><a name="l00539"></a><span class="lineno"> 539</span>  <span class="keywordtype">unsigned</span> last_bin = bin_count - 1;</div> |
| <div class="line"><a name="l00540"></a><span class="lineno"> 540</span>  <span class="keywordflow">for</span> (; last_bin && !bin_sizes[last_bin + 1]; --last_bin);</div> |
| <div class="line"><a name="l00541"></a><span class="lineno"> 541</span>  <span class="comment">//This dominates runtime, mostly in the swap and bin lookups</span></div> |
| <div class="line"><a name="l00542"></a><span class="lineno"> 542</span>  <span class="keywordflow">for</span> (<span class="keywordtype">unsigned</span> u = 0; u < last_bin; ++u) {</div> |
| <div class="line"><a name="l00543"></a><span class="lineno"> 543</span>  local_bin = bins + u;</div> |
| <div class="line"><a name="l00544"></a><span class="lineno"> 544</span>  next_bin_start += bin_sizes[u + 1];</div> |
| <div class="line"><a name="l00545"></a><span class="lineno"> 545</span>  <span class="comment">//Iterating over each element in this bin</span></div> |
| <div class="line"><a name="l00546"></a><span class="lineno"> 546</span>  <span class="keywordflow">for</span> (RandomAccessIter current = *local_bin; current < next_bin_start;</div> |
| <div class="line"><a name="l00547"></a><span class="lineno"> 547</span>  ++current) {</div> |
| <div class="line"><a name="l00548"></a><span class="lineno"> 548</span>  <span class="comment">//Swapping into place until the correct element has been swapped in</span></div> |
| <div class="line"><a name="l00549"></a><span class="lineno"> 549</span>  <span class="keywordflow">for</span> (target_bin = bins + getchar((*current), char_offset);</div> |
| <div class="line"><a name="l00550"></a><span class="lineno"> 550</span>  target_bin != local_bin;</div> |
| <div class="line"><a name="l00551"></a><span class="lineno"> 551</span>  target_bin = bins + getchar((*current), char_offset))</div> |
| <div class="line"><a name="l00552"></a><span class="lineno"> 552</span>  iter_swap(current, (*target_bin)++);</div> |
| <div class="line"><a name="l00553"></a><span class="lineno"> 553</span>  }</div> |
| <div class="line"><a name="l00554"></a><span class="lineno"> 554</span>  *local_bin = next_bin_start;</div> |
| <div class="line"><a name="l00555"></a><span class="lineno"> 555</span>  }</div> |
| <div class="line"><a name="l00556"></a><span class="lineno"> 556</span>  bins[last_bin] = last;</div> |
| <div class="line"><a name="l00557"></a><span class="lineno"> 557</span> </div> |
| <div class="line"><a name="l00558"></a><span class="lineno"> 558</span>  <span class="comment">//Recursing</span></div> |
| <div class="line"><a name="l00559"></a><span class="lineno"> 559</span>  RandomAccessIter lastPos = bin_cache[cache_offset];</div> |
| <div class="line"><a name="l00560"></a><span class="lineno"> 560</span>  <span class="comment">//Skip this loop for empties</span></div> |
| <div class="line"><a name="l00561"></a><span class="lineno"> 561</span>  <span class="keywordflow">for</span> (<span class="keywordtype">unsigned</span> u = cache_offset + 1; u < cache_offset + last_bin + 2;</div> |
| <div class="line"><a name="l00562"></a><span class="lineno"> 562</span>  lastPos = bin_cache[u], ++u) {</div> |
| <div class="line"><a name="l00563"></a><span class="lineno"> 563</span>  <span class="keywordtype">size_t</span> count = bin_cache[u] - lastPos;</div> |
| <div class="line"><a name="l00564"></a><span class="lineno"> 564</span>  <span class="comment">//don't sort unless there are at least two items to Compare</span></div> |
| <div class="line"><a name="l00565"></a><span class="lineno"> 565</span>  <span class="keywordflow">if</span> (count < 2)</div> |
| <div class="line"><a name="l00566"></a><span class="lineno"> 566</span>  <span class="keywordflow">continue</span>;</div> |
| <div class="line"><a name="l00567"></a><span class="lineno"> 567</span>  <span class="comment">//using std::sort if its worst-case is better</span></div> |
| <div class="line"><a name="l00568"></a><span class="lineno"> 568</span>  <span class="keywordflow">if</span> (count < max_size)</div> |
| <div class="line"><a name="l00569"></a><span class="lineno"> 569</span>  std::sort(lastPos, bin_cache[u], comp);</div> |
| <div class="line"><a name="l00570"></a><span class="lineno"> 570</span>  <span class="keywordflow">else</span></div> |
| <div class="line"><a name="l00571"></a><span class="lineno"> 571</span>  <a class="code" href="namespaceboost_1_1sort_1_1detail.html#ad1655ab39e410e18b6e8b6694405e5ba">string_sort_rec</a><RandomAccessIter, Unsigned_char_type, Get_char,</div> |
| <div class="line"><a name="l00572"></a><span class="lineno"> 572</span>  Get_length, Compare></div> |
| <div class="line"><a name="l00573"></a><span class="lineno"> 573</span>  (lastPos, bin_cache[u], char_offset + 1, bin_cache, cache_end,</div> |
| <div class="line"><a name="l00574"></a><span class="lineno"> 574</span>  bin_sizes, getchar, length, comp);</div> |
| <div class="line"><a name="l00575"></a><span class="lineno"> 575</span>  }</div> |
| <div class="line"><a name="l00576"></a><span class="lineno"> 576</span>  }</div> |
| <div class="line"><a name="l00577"></a><span class="lineno"> 577</span> </div> |
| <div class="line"><a name="l00578"></a><span class="lineno"> 578</span>  <span class="comment">//Sorts strings in reverse order, with empties at the end</span></div> |
| <div class="line"><a name="l00579"></a><span class="lineno"> 579</span>  <span class="keyword">template</span> <<span class="keyword">class </span>RandomAccessIter, <span class="keyword">class </span>Unsigned_char_type, <span class="keyword">class </span>Get_char,</div> |
| <div class="line"><a name="l00580"></a><span class="lineno"> 580</span>  <span class="keyword">class </span>Get_length, <span class="keyword">class </span>Compare></div> |
| <div class="line"><a name="l00581"></a><span class="lineno"> 581</span>  <span class="keyword">inline</span> <span class="keywordtype">void</span></div> |
| <div class="line"><a name="l00582"></a><span class="lineno"><a class="line" href="namespaceboost_1_1sort_1_1detail.html#ab71cd7c25eada649fa1aff16fb3549f6"> 582</a></span>  <a class="code" href="namespaceboost_1_1sort_1_1detail.html#a66be693262defeff06a4a3507155d4a3">reverse_string_sort_rec</a>(RandomAccessIter first, RandomAccessIter last,</div> |
| <div class="line"><a name="l00583"></a><span class="lineno"> 583</span>  <span class="keywordtype">size_t</span> char_offset, std::vector<RandomAccessIter> &bin_cache,</div> |
| <div class="line"><a name="l00584"></a><span class="lineno"> 584</span>  <span class="keywordtype">unsigned</span> cache_offset, <span class="keywordtype">size_t</span> *bin_sizes,</div> |
| <div class="line"><a name="l00585"></a><span class="lineno"> 585</span>  Get_char getchar, Get_length length, Compare comp)</div> |
| <div class="line"><a name="l00586"></a><span class="lineno"> 586</span>  {</div> |
| <div class="line"><a name="l00587"></a><span class="lineno"> 587</span>  <span class="comment">//This section makes handling of long identical substrings much faster</span></div> |
| <div class="line"><a name="l00588"></a><span class="lineno"> 588</span>  <span class="comment">//with a mild average performance impact.</span></div> |
| <div class="line"><a name="l00589"></a><span class="lineno"> 589</span>  RandomAccessIter curr = first;</div> |
| <div class="line"><a name="l00590"></a><span class="lineno"> 590</span>  <span class="comment">//Iterate to the end of the empties. If all empty, return</span></div> |
| <div class="line"><a name="l00591"></a><span class="lineno"> 591</span>  <span class="keywordflow">while</span> (length(*curr) <= char_offset) {</div> |
| <div class="line"><a name="l00592"></a><span class="lineno"> 592</span>  <span class="keywordflow">if</span> (++curr == last)</div> |
| <div class="line"><a name="l00593"></a><span class="lineno"> 593</span>  <span class="keywordflow">return</span>;</div> |
| <div class="line"><a name="l00594"></a><span class="lineno"> 594</span>  }</div> |
| <div class="line"><a name="l00595"></a><span class="lineno"> 595</span>  <span class="comment">//Getting the last non-empty</span></div> |
| <div class="line"><a name="l00596"></a><span class="lineno"> 596</span>  <span class="keywordflow">while</span> (length(*(--last)) <= char_offset);</div> |
| <div class="line"><a name="l00597"></a><span class="lineno"> 597</span>  ++last;</div> |
| <div class="line"><a name="l00598"></a><span class="lineno"> 598</span>  <span class="comment">//Offsetting on identical characters. This section works</span></div> |
| <div class="line"><a name="l00599"></a><span class="lineno"> 599</span>  <span class="comment">//a character at a time for optimal worst-case performance.</span></div> |
| <div class="line"><a name="l00600"></a><span class="lineno"> 600</span>  <a class="code" href="namespaceboost_1_1sort_1_1detail.html#a585497946eeb8cc1d2072642d7f1da01">update_offset</a>(curr, last, char_offset, getchar, length);</div> |
| <div class="line"><a name="l00601"></a><span class="lineno"> 601</span> </div> |
| <div class="line"><a name="l00602"></a><span class="lineno"> 602</span>  <span class="keyword">const</span> <span class="keywordtype">unsigned</span> bin_count = (1 << (<span class="keyword">sizeof</span>(Unsigned_char_type)*8));</div> |
| <div class="line"><a name="l00603"></a><span class="lineno"> 603</span>  <span class="comment">//Equal worst-case of radix and comparison is when bin_count = n*log(n).</span></div> |
| <div class="line"><a name="l00604"></a><span class="lineno"> 604</span>  <span class="keyword">const</span> <span class="keywordtype">unsigned</span> max_size = bin_count;</div> |
| <div class="line"><a name="l00605"></a><span class="lineno"> 605</span>  <span class="keyword">const</span> <span class="keywordtype">unsigned</span> membin_count = bin_count + 1;</div> |
| <div class="line"><a name="l00606"></a><span class="lineno"> 606</span>  <span class="keyword">const</span> <span class="keywordtype">unsigned</span> max_bin = bin_count - 1;</div> |
| <div class="line"><a name="l00607"></a><span class="lineno"> 607</span>  <span class="keywordtype">unsigned</span> cache_end;</div> |
| <div class="line"><a name="l00608"></a><span class="lineno"> 608</span>  RandomAccessIter * bins = <a class="code" href="namespaceboost_1_1sort_1_1detail.html#ad5b7d31fba809eae5d17f5c2fb0a385b">size_bins</a>(bin_sizes, bin_cache, cache_offset,</div> |
| <div class="line"><a name="l00609"></a><span class="lineno"> 609</span>  cache_end, membin_count);</div> |
| <div class="line"><a name="l00610"></a><span class="lineno"> 610</span>  RandomAccessIter *end_bin = &(bin_cache[cache_offset + max_bin]);</div> |
| <div class="line"><a name="l00611"></a><span class="lineno"> 611</span> </div> |
| <div class="line"><a name="l00612"></a><span class="lineno"> 612</span>  <span class="comment">//Calculating the size of each bin; this takes roughly 10% of runtime</span></div> |
| <div class="line"><a name="l00613"></a><span class="lineno"> 613</span>  <span class="keywordflow">for</span> (RandomAccessIter current = first; current != last; ++current) {</div> |
| <div class="line"><a name="l00614"></a><span class="lineno"> 614</span>  <span class="keywordflow">if</span> (length(*current) <= char_offset) {</div> |
| <div class="line"><a name="l00615"></a><span class="lineno"> 615</span>  bin_sizes[bin_count]++;</div> |
| <div class="line"><a name="l00616"></a><span class="lineno"> 616</span>  }</div> |
| <div class="line"><a name="l00617"></a><span class="lineno"> 617</span>  <span class="keywordflow">else</span></div> |
| <div class="line"><a name="l00618"></a><span class="lineno"> 618</span>  bin_sizes[max_bin - getchar((*current), char_offset)]++;</div> |
| <div class="line"><a name="l00619"></a><span class="lineno"> 619</span>  }</div> |
| <div class="line"><a name="l00620"></a><span class="lineno"> 620</span>  <span class="comment">//Assign the bin positions</span></div> |
| <div class="line"><a name="l00621"></a><span class="lineno"> 621</span>  bin_cache[cache_offset] = first;</div> |
| <div class="line"><a name="l00622"></a><span class="lineno"> 622</span>  <span class="keywordflow">for</span> (<span class="keywordtype">unsigned</span> u = 0; u < membin_count - 1; u++)</div> |
| <div class="line"><a name="l00623"></a><span class="lineno"> 623</span>  bin_cache[cache_offset + u + 1] =</div> |
| <div class="line"><a name="l00624"></a><span class="lineno"> 624</span>  bin_cache[cache_offset + u] + bin_sizes[u];</div> |
| <div class="line"><a name="l00625"></a><span class="lineno"> 625</span> </div> |
| <div class="line"><a name="l00626"></a><span class="lineno"> 626</span>  <span class="comment">//Swap into place</span></div> |
| <div class="line"><a name="l00627"></a><span class="lineno"> 627</span>  RandomAccessIter next_bin_start = last;</div> |
| <div class="line"><a name="l00628"></a><span class="lineno"> 628</span>  <span class="comment">//handling empty bins</span></div> |
| <div class="line"><a name="l00629"></a><span class="lineno"> 629</span>  RandomAccessIter * local_bin = &(bin_cache[cache_offset + bin_count]);</div> |
| <div class="line"><a name="l00630"></a><span class="lineno"> 630</span>  RandomAccessIter lastFull = *local_bin;</div> |
| <div class="line"><a name="l00631"></a><span class="lineno"> 631</span>  RandomAccessIter * target_bin;</div> |
| <div class="line"><a name="l00632"></a><span class="lineno"> 632</span>  <span class="comment">//Iterating over each element in the bin of empties</span></div> |
| <div class="line"><a name="l00633"></a><span class="lineno"> 633</span>  <span class="keywordflow">for</span> (RandomAccessIter current = *local_bin; current < next_bin_start;</div> |
| <div class="line"><a name="l00634"></a><span class="lineno"> 634</span>  ++current) {</div> |
| <div class="line"><a name="l00635"></a><span class="lineno"> 635</span>  <span class="comment">//empties belong in this bin</span></div> |
| <div class="line"><a name="l00636"></a><span class="lineno"> 636</span>  <span class="keywordflow">while</span> (length(*current) > char_offset) {</div> |
| <div class="line"><a name="l00637"></a><span class="lineno"> 637</span>  target_bin = end_bin - getchar((*current), char_offset);</div> |
| <div class="line"><a name="l00638"></a><span class="lineno"> 638</span>  iter_swap(current, (*target_bin)++);</div> |
| <div class="line"><a name="l00639"></a><span class="lineno"> 639</span>  }</div> |
| <div class="line"><a name="l00640"></a><span class="lineno"> 640</span>  }</div> |
| <div class="line"><a name="l00641"></a><span class="lineno"> 641</span>  *local_bin = next_bin_start;</div> |
| <div class="line"><a name="l00642"></a><span class="lineno"> 642</span>  next_bin_start = first;</div> |
| <div class="line"><a name="l00643"></a><span class="lineno"> 643</span>  <span class="comment">//iterate backwards to find the last bin with elements in it</span></div> |
| <div class="line"><a name="l00644"></a><span class="lineno"> 644</span>  <span class="comment">//this saves iterations in multiple loops</span></div> |
| <div class="line"><a name="l00645"></a><span class="lineno"> 645</span>  <span class="keywordtype">unsigned</span> last_bin = max_bin;</div> |
| <div class="line"><a name="l00646"></a><span class="lineno"> 646</span>  <span class="keywordflow">for</span> (; last_bin && !bin_sizes[last_bin]; --last_bin);</div> |
| <div class="line"><a name="l00647"></a><span class="lineno"> 647</span>  <span class="comment">//This dominates runtime, mostly in the swap and bin lookups</span></div> |
| <div class="line"><a name="l00648"></a><span class="lineno"> 648</span>  <span class="keywordflow">for</span> (<span class="keywordtype">unsigned</span> u = 0; u < last_bin; ++u) {</div> |
| <div class="line"><a name="l00649"></a><span class="lineno"> 649</span>  local_bin = bins + u;</div> |
| <div class="line"><a name="l00650"></a><span class="lineno"> 650</span>  next_bin_start += bin_sizes[u];</div> |
| <div class="line"><a name="l00651"></a><span class="lineno"> 651</span>  <span class="comment">//Iterating over each element in this bin</span></div> |
| <div class="line"><a name="l00652"></a><span class="lineno"> 652</span>  <span class="keywordflow">for</span> (RandomAccessIter current = *local_bin; current < next_bin_start;</div> |
| <div class="line"><a name="l00653"></a><span class="lineno"> 653</span>  ++current) {</div> |
| <div class="line"><a name="l00654"></a><span class="lineno"> 654</span>  <span class="comment">//Swapping into place until the correct element has been swapped in</span></div> |
| <div class="line"><a name="l00655"></a><span class="lineno"> 655</span>  <span class="keywordflow">for</span> (target_bin = end_bin - getchar((*current), char_offset);</div> |
| <div class="line"><a name="l00656"></a><span class="lineno"> 656</span>  target_bin != local_bin;</div> |
| <div class="line"><a name="l00657"></a><span class="lineno"> 657</span>  target_bin = end_bin - getchar((*current), char_offset))</div> |
| <div class="line"><a name="l00658"></a><span class="lineno"> 658</span>  iter_swap(current, (*target_bin)++);</div> |
| <div class="line"><a name="l00659"></a><span class="lineno"> 659</span>  }</div> |
| <div class="line"><a name="l00660"></a><span class="lineno"> 660</span>  *local_bin = next_bin_start;</div> |
| <div class="line"><a name="l00661"></a><span class="lineno"> 661</span>  }</div> |
| <div class="line"><a name="l00662"></a><span class="lineno"> 662</span>  bins[last_bin] = lastFull;</div> |
| <div class="line"><a name="l00663"></a><span class="lineno"> 663</span>  <span class="comment">//Recursing</span></div> |
| <div class="line"><a name="l00664"></a><span class="lineno"> 664</span>  RandomAccessIter lastPos = first;</div> |
| <div class="line"><a name="l00665"></a><span class="lineno"> 665</span>  <span class="comment">//Skip this loop for empties</span></div> |
| <div class="line"><a name="l00666"></a><span class="lineno"> 666</span>  <span class="keywordflow">for</span> (<span class="keywordtype">unsigned</span> u = cache_offset; u <= cache_offset + last_bin;</div> |
| <div class="line"><a name="l00667"></a><span class="lineno"> 667</span>  lastPos = bin_cache[u], ++u) {</div> |
| <div class="line"><a name="l00668"></a><span class="lineno"> 668</span>  <span class="keywordtype">size_t</span> count = bin_cache[u] - lastPos;</div> |
| <div class="line"><a name="l00669"></a><span class="lineno"> 669</span>  <span class="comment">//don't sort unless there are at least two items to Compare</span></div> |
| <div class="line"><a name="l00670"></a><span class="lineno"> 670</span>  <span class="keywordflow">if</span> (count < 2)</div> |
| <div class="line"><a name="l00671"></a><span class="lineno"> 671</span>  <span class="keywordflow">continue</span>;</div> |
| <div class="line"><a name="l00672"></a><span class="lineno"> 672</span>  <span class="comment">//using std::sort if its worst-case is better</span></div> |
| <div class="line"><a name="l00673"></a><span class="lineno"> 673</span>  <span class="keywordflow">if</span> (count < max_size)</div> |
| <div class="line"><a name="l00674"></a><span class="lineno"> 674</span>  std::sort(lastPos, bin_cache[u], comp);</div> |
| <div class="line"><a name="l00675"></a><span class="lineno"> 675</span>  <span class="keywordflow">else</span></div> |
| <div class="line"><a name="l00676"></a><span class="lineno"> 676</span>  <a class="code" href="namespaceboost_1_1sort_1_1detail.html#a66be693262defeff06a4a3507155d4a3">reverse_string_sort_rec</a><RandomAccessIter, Unsigned_char_type,</div> |
| <div class="line"><a name="l00677"></a><span class="lineno"> 677</span>  Get_char, Get_length, Compare></div> |
| <div class="line"><a name="l00678"></a><span class="lineno"> 678</span>  (lastPos, bin_cache[u], char_offset + 1, bin_cache, cache_end,</div> |
| <div class="line"><a name="l00679"></a><span class="lineno"> 679</span>  bin_sizes, getchar, length, comp);</div> |
| <div class="line"><a name="l00680"></a><span class="lineno"> 680</span>  }</div> |
| <div class="line"><a name="l00681"></a><span class="lineno"> 681</span>  }</div> |
| <div class="line"><a name="l00682"></a><span class="lineno"> 682</span> </div> |
| <div class="line"><a name="l00683"></a><span class="lineno"> 683</span>  <span class="comment">//Holds the bin vector and makes the initial recursive call</span></div> |
| <div class="line"><a name="l00684"></a><span class="lineno"> 684</span>  <span class="keyword">template</span> <<span class="keyword">class</span> RandomAccessIter, <span class="keyword">class</span> Un<span class="keywordtype">signed</span>_<span class="keywordtype">char</span>_type></div> |
| <div class="line"><a name="l00685"></a><span class="lineno"> 685</span>  <span class="keyword">inline</span> <span class="keyword">typename</span> boost::enable_if_c< <span class="keyword">sizeof</span>(Unsigned_char_type) <= 2, <span class="keywordtype">void</span></div> |
| <div class="line"><a name="l00686"></a><span class="lineno"> 686</span>  >::type</div> |
| <div class="line"><a name="l00687"></a><span class="lineno"> 687</span>  <a class="code" href="namespaceboost_1_1sort.html#a950a2dbbe75f048a0b343dbf7c532dc0">string_sort</a>(RandomAccessIter first, RandomAccessIter last,</div> |
| <div class="line"><a name="l00688"></a><span class="lineno"> 688</span>  Unsigned_char_type)</div> |
| <div class="line"><a name="l00689"></a><span class="lineno"> 689</span>  {</div> |
| <div class="line"><a name="l00690"></a><span class="lineno"> 690</span>  <span class="keywordtype">size_t</span> bin_sizes[(1 << (8 * <span class="keyword">sizeof</span>(Unsigned_char_type))) + 1];</div> |
| <div class="line"><a name="l00691"></a><span class="lineno"> 691</span>  std::vector<RandomAccessIter> bin_cache;</div> |
| <div class="line"><a name="l00692"></a><span class="lineno"> 692</span>  string_sort_rec<RandomAccessIter, Unsigned_char_type></div> |
| <div class="line"><a name="l00693"></a><span class="lineno"> 693</span>  (first, last, 0, bin_cache, 0, bin_sizes);</div> |
| <div class="line"><a name="l00694"></a><span class="lineno"> 694</span>  }</div> |
| <div class="line"><a name="l00695"></a><span class="lineno"> 695</span> </div> |
| <div class="line"><a name="l00696"></a><span class="lineno"> 696</span>  <span class="keyword">template</span> <<span class="keyword">class</span> RandomAccessIter, <span class="keyword">class</span> Un<span class="keywordtype">signed</span>_<span class="keywordtype">char</span>_type></div> |
| <div class="line"><a name="l00697"></a><span class="lineno"> 697</span>  <span class="keyword">inline</span> <span class="keyword">typename</span> boost::disable_if_c< <span class="keyword">sizeof</span>(Unsigned_char_type) <= 2, <span class="keywordtype">void</span></div> |
| <div class="line"><a name="l00698"></a><span class="lineno"> 698</span>  >::type</div> |
| <div class="line"><a name="l00699"></a><span class="lineno"> 699</span>  <a class="code" href="namespaceboost_1_1sort.html#a950a2dbbe75f048a0b343dbf7c532dc0">string_sort</a>(RandomAccessIter first, RandomAccessIter last,</div> |
| <div class="line"><a name="l00700"></a><span class="lineno"> 700</span>  Unsigned_char_type)</div> |
| <div class="line"><a name="l00701"></a><span class="lineno"> 701</span>  {</div> |
| <div class="line"><a name="l00702"></a><span class="lineno"> 702</span>  <span class="comment">//Warning that we're using std::sort, even though string_sort was called</span></div> |
| <div class="line"><a name="l00703"></a><span class="lineno"> 703</span>  BOOST_STATIC_WARNING( <span class="keyword">sizeof</span>(Unsigned_char_type) <= 2 );</div> |
| <div class="line"><a name="l00704"></a><span class="lineno"> 704</span>  std::sort(first, last);</div> |
| <div class="line"><a name="l00705"></a><span class="lineno"> 705</span>  }</div> |
| <div class="line"><a name="l00706"></a><span class="lineno"> 706</span> </div> |
| <div class="line"><a name="l00707"></a><span class="lineno"> 707</span>  <span class="comment">//Holds the bin vector and makes the initial recursive call</span></div> |
| <div class="line"><a name="l00708"></a><span class="lineno"> 708</span>  <span class="keyword">template</span> <<span class="keyword">class</span> RandomAccessIter, <span class="keyword">class</span> Un<span class="keywordtype">signed</span>_<span class="keywordtype">char</span>_type></div> |
| <div class="line"><a name="l00709"></a><span class="lineno"> 709</span>  <span class="keyword">inline</span> <span class="keyword">typename</span> boost::enable_if_c< <span class="keyword">sizeof</span>(Unsigned_char_type) <= 2, <span class="keywordtype">void</span></div> |
| <div class="line"><a name="l00710"></a><span class="lineno"> 710</span>  >::type</div> |
| <div class="line"><a name="l00711"></a><span class="lineno"> 711</span>  <a class="code" href="namespaceboost_1_1sort.html#a4ad4785d90f47d51ff1d2fac8c21bb48">reverse_string_sort</a>(RandomAccessIter first, RandomAccessIter last,</div> |
| <div class="line"><a name="l00712"></a><span class="lineno"> 712</span>  Unsigned_char_type)</div> |
| <div class="line"><a name="l00713"></a><span class="lineno"> 713</span>  {</div> |
| <div class="line"><a name="l00714"></a><span class="lineno"> 714</span>  <span class="keywordtype">size_t</span> bin_sizes[(1 << (8 * <span class="keyword">sizeof</span>(Unsigned_char_type))) + 1];</div> |
| <div class="line"><a name="l00715"></a><span class="lineno"> 715</span>  std::vector<RandomAccessIter> bin_cache;</div> |
| <div class="line"><a name="l00716"></a><span class="lineno"> 716</span>  reverse_string_sort_rec<RandomAccessIter, Unsigned_char_type></div> |
| <div class="line"><a name="l00717"></a><span class="lineno"> 717</span>  (first, last, 0, bin_cache, 0, bin_sizes);</div> |
| <div class="line"><a name="l00718"></a><span class="lineno"> 718</span>  }</div> |
| <div class="line"><a name="l00719"></a><span class="lineno"> 719</span> </div> |
| <div class="line"><a name="l00720"></a><span class="lineno"> 720</span>  <span class="keyword">template</span> <<span class="keyword">class</span> RandomAccessIter, <span class="keyword">class</span> Un<span class="keywordtype">signed</span>_<span class="keywordtype">char</span>_type></div> |
| <div class="line"><a name="l00721"></a><span class="lineno"> 721</span>  <span class="keyword">inline</span> <span class="keyword">typename</span> boost::disable_if_c< <span class="keyword">sizeof</span>(Unsigned_char_type) <= 2, <span class="keywordtype">void</span></div> |
| <div class="line"><a name="l00722"></a><span class="lineno"> 722</span>  >::type</div> |
| <div class="line"><a name="l00723"></a><span class="lineno"> 723</span>  <a class="code" href="namespaceboost_1_1sort.html#a4ad4785d90f47d51ff1d2fac8c21bb48">reverse_string_sort</a>(RandomAccessIter first, RandomAccessIter last,</div> |
| <div class="line"><a name="l00724"></a><span class="lineno"> 724</span>  Unsigned_char_type)</div> |
| <div class="line"><a name="l00725"></a><span class="lineno"> 725</span>  {</div> |
| <div class="line"><a name="l00726"></a><span class="lineno"> 726</span>  <span class="keyword">typedef</span> <span class="keyword">typename</span> std::iterator_traits<RandomAccessIter>::value_type</div> |
| <div class="line"><a name="l00727"></a><span class="lineno"> 727</span>  Data_type;</div> |
| <div class="line"><a name="l00728"></a><span class="lineno"> 728</span>  <span class="comment">//Warning that we're using std::sort, even though string_sort was called</span></div> |
| <div class="line"><a name="l00729"></a><span class="lineno"> 729</span>  BOOST_STATIC_WARNING( <span class="keyword">sizeof</span>(Unsigned_char_type) <= 2 );</div> |
| <div class="line"><a name="l00730"></a><span class="lineno"> 730</span>  std::sort(first, last, std::greater<Data_type>());</div> |
| <div class="line"><a name="l00731"></a><span class="lineno"> 731</span>  }</div> |
| <div class="line"><a name="l00732"></a><span class="lineno"> 732</span> </div> |
| <div class="line"><a name="l00733"></a><span class="lineno"> 733</span>  <span class="comment">//Holds the bin vector and makes the initial recursive call</span></div> |
| <div class="line"><a name="l00734"></a><span class="lineno"> 734</span>  <span class="keyword">template</span> <<span class="keyword">class </span>RandomAccessIter, <span class="keyword">class </span>Get_char, <span class="keyword">class </span>Get_length,</div> |
| <div class="line"><a name="l00735"></a><span class="lineno"> 735</span>  <span class="keyword">class </span>Unsigned_char_type></div> |
| <div class="line"><a name="l00736"></a><span class="lineno"> 736</span>  <span class="keyword">inline</span> <span class="keyword">typename</span> boost::enable_if_c< <span class="keyword">sizeof</span>(Unsigned_char_type) <= 2, <span class="keywordtype">void</span></div> |
| <div class="line"><a name="l00737"></a><span class="lineno"> 737</span>  >::type</div> |
| <div class="line"><a name="l00738"></a><span class="lineno"> 738</span>  <a class="code" href="namespaceboost_1_1sort.html#a950a2dbbe75f048a0b343dbf7c532dc0">string_sort</a>(RandomAccessIter first, RandomAccessIter last,</div> |
| <div class="line"><a name="l00739"></a><span class="lineno"> 739</span>  Get_char getchar, Get_length length, Unsigned_char_type)</div> |
| <div class="line"><a name="l00740"></a><span class="lineno"> 740</span>  {</div> |
| <div class="line"><a name="l00741"></a><span class="lineno"> 741</span>  <span class="keywordtype">size_t</span> bin_sizes[(1 << (8 * <span class="keyword">sizeof</span>(Unsigned_char_type))) + 1];</div> |
| <div class="line"><a name="l00742"></a><span class="lineno"> 742</span>  std::vector<RandomAccessIter> bin_cache;</div> |
| <div class="line"><a name="l00743"></a><span class="lineno"> 743</span>  <a class="code" href="namespaceboost_1_1sort_1_1detail.html#ad1655ab39e410e18b6e8b6694405e5ba">string_sort_rec</a><RandomAccessIter, Unsigned_char_type, Get_char,</div> |
| <div class="line"><a name="l00744"></a><span class="lineno"> 744</span>  Get_length>(first, last, 0, bin_cache, 0, bin_sizes, getchar, length);</div> |
| <div class="line"><a name="l00745"></a><span class="lineno"> 745</span>  }</div> |
| <div class="line"><a name="l00746"></a><span class="lineno"> 746</span> </div> |
| <div class="line"><a name="l00747"></a><span class="lineno"> 747</span>  <span class="keyword">template</span> <<span class="keyword">class </span>RandomAccessIter, <span class="keyword">class </span>Get_char, <span class="keyword">class </span>Get_length,</div> |
| <div class="line"><a name="l00748"></a><span class="lineno"> 748</span>  <span class="keyword">class </span>Unsigned_char_type></div> |
| <div class="line"><a name="l00749"></a><span class="lineno"> 749</span>  <span class="keyword">inline</span> <span class="keyword">typename</span> boost::disable_if_c< <span class="keyword">sizeof</span>(Unsigned_char_type) <= 2, <span class="keywordtype">void</span></div> |
| <div class="line"><a name="l00750"></a><span class="lineno"> 750</span>  >::type</div> |
| <div class="line"><a name="l00751"></a><span class="lineno"> 751</span>  <a class="code" href="namespaceboost_1_1sort.html#a950a2dbbe75f048a0b343dbf7c532dc0">string_sort</a>(RandomAccessIter first, RandomAccessIter last,</div> |
| <div class="line"><a name="l00752"></a><span class="lineno"> 752</span>  Get_char getchar, Get_length length, Unsigned_char_type)</div> |
| <div class="line"><a name="l00753"></a><span class="lineno"> 753</span>  {</div> |
| <div class="line"><a name="l00754"></a><span class="lineno"> 754</span>  <span class="comment">//Warning that we're using std::sort, even though string_sort was called</span></div> |
| <div class="line"><a name="l00755"></a><span class="lineno"> 755</span>  BOOST_STATIC_WARNING( <span class="keyword">sizeof</span>(Unsigned_char_type) <= 2 );</div> |
| <div class="line"><a name="l00756"></a><span class="lineno"> 756</span>  std::sort(first, last);</div> |
| <div class="line"><a name="l00757"></a><span class="lineno"> 757</span>  }</div> |
| <div class="line"><a name="l00758"></a><span class="lineno"> 758</span> </div> |
| <div class="line"><a name="l00759"></a><span class="lineno"> 759</span>  <span class="comment">//Holds the bin vector and makes the initial recursive call</span></div> |
| <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>Get_char, <span class="keyword">class </span>Get_length,</div> |
| <div class="line"><a name="l00761"></a><span class="lineno"> 761</span>  <span class="keyword">class </span>Compare, <span class="keyword">class </span>Unsigned_char_type></div> |
| <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< <span class="keyword">sizeof</span>(Unsigned_char_type) <= 2, <span class="keywordtype">void</span></div> |
| <div class="line"><a name="l00763"></a><span class="lineno"> 763</span>  >::type</div> |
| <div class="line"><a name="l00764"></a><span class="lineno"> 764</span>  <a class="code" href="namespaceboost_1_1sort.html#a950a2dbbe75f048a0b343dbf7c532dc0">string_sort</a>(RandomAccessIter first, RandomAccessIter last,</div> |
| <div class="line"><a name="l00765"></a><span class="lineno"> 765</span>  Get_char getchar, Get_length length, Compare comp, Unsigned_char_type)</div> |
| <div class="line"><a name="l00766"></a><span class="lineno"> 766</span>  {</div> |
| <div class="line"><a name="l00767"></a><span class="lineno"> 767</span>  <span class="keywordtype">size_t</span> bin_sizes[(1 << (8 * <span class="keyword">sizeof</span>(Unsigned_char_type))) + 1];</div> |
| <div class="line"><a name="l00768"></a><span class="lineno"> 768</span>  std::vector<RandomAccessIter> bin_cache;</div> |
| <div class="line"><a name="l00769"></a><span class="lineno"> 769</span>  <a class="code" href="namespaceboost_1_1sort_1_1detail.html#ad1655ab39e410e18b6e8b6694405e5ba">string_sort_rec</a><RandomAccessIter, Unsigned_char_type, Get_char</div> |
| <div class="line"><a name="l00770"></a><span class="lineno"> 770</span>  , Get_length, Compare></div> |
| <div class="line"><a name="l00771"></a><span class="lineno"> 771</span>  (first, last, 0, bin_cache, 0, bin_sizes, getchar, length, comp);</div> |
| <div class="line"><a name="l00772"></a><span class="lineno"> 772</span>  }</div> |
| <div class="line"><a name="l00773"></a><span class="lineno"> 773</span> </div> |
| <div class="line"><a name="l00774"></a><span class="lineno"> 774</span>  <span class="comment">//disable_if_c was refusing to compile, so rewrote to use enable_if_c</span></div> |
| <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>Get_char, <span class="keyword">class </span>Get_length,</div> |
| <div class="line"><a name="l00776"></a><span class="lineno"> 776</span>  <span class="keyword">class </span>Compare, <span class="keyword">class </span>Unsigned_char_type></div> |
| <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< (sizeof(Unsigned_char_type) > 2), <span class="keywordtype">void</span></div> |
| <div class="line"><a name="l00778"></a><span class="lineno"> 778</span>  >::type</div> |
| <div class="line"><a name="l00779"></a><span class="lineno"> 779</span>  <a class="code" href="namespaceboost_1_1sort.html#a950a2dbbe75f048a0b343dbf7c532dc0">string_sort</a>(RandomAccessIter first, RandomAccessIter last,</div> |
| <div class="line"><a name="l00780"></a><span class="lineno"> 780</span>  Get_char getchar, Get_length length, Compare comp, Unsigned_char_type)</div> |
| <div class="line"><a name="l00781"></a><span class="lineno"> 781</span>  {</div> |
| <div class="line"><a name="l00782"></a><span class="lineno"> 782</span>  <span class="comment">//Warning that we're using std::sort, even though string_sort was called</span></div> |
| <div class="line"><a name="l00783"></a><span class="lineno"> 783</span>  BOOST_STATIC_WARNING( <span class="keyword">sizeof</span>(Unsigned_char_type) <= 2 );</div> |
| <div class="line"><a name="l00784"></a><span class="lineno"> 784</span>  std::sort(first, last, comp);</div> |
| <div class="line"><a name="l00785"></a><span class="lineno"> 785</span>  }</div> |
| <div class="line"><a name="l00786"></a><span class="lineno"> 786</span> </div> |
| <div class="line"><a name="l00787"></a><span class="lineno"> 787</span>  <span class="comment">//Holds the bin vector and makes the initial recursive call</span></div> |
| <div class="line"><a name="l00788"></a><span class="lineno"> 788</span>  <span class="keyword">template</span> <<span class="keyword">class </span>RandomAccessIter, <span class="keyword">class </span>Get_char, <span class="keyword">class </span>Get_length,</div> |
| <div class="line"><a name="l00789"></a><span class="lineno"> 789</span>  <span class="keyword">class </span>Compare, <span class="keyword">class </span>Unsigned_char_type></div> |
| <div class="line"><a name="l00790"></a><span class="lineno"> 790</span>  <span class="keyword">inline</span> <span class="keyword">typename</span> boost::enable_if_c< <span class="keyword">sizeof</span>(Unsigned_char_type) <= 2, <span class="keywordtype">void</span></div> |
| <div class="line"><a name="l00791"></a><span class="lineno"> 791</span>  >::type</div> |
| <div class="line"><a name="l00792"></a><span class="lineno"> 792</span>  <a class="code" href="namespaceboost_1_1sort.html#a4ad4785d90f47d51ff1d2fac8c21bb48">reverse_string_sort</a>(RandomAccessIter first, RandomAccessIter last,</div> |
| <div class="line"><a name="l00793"></a><span class="lineno"> 793</span>  Get_char getchar, Get_length length, Compare comp, Unsigned_char_type)</div> |
| <div class="line"><a name="l00794"></a><span class="lineno"> 794</span>  {</div> |
| <div class="line"><a name="l00795"></a><span class="lineno"> 795</span>  <span class="keywordtype">size_t</span> bin_sizes[(1 << (8 * <span class="keyword">sizeof</span>(Unsigned_char_type))) + 1];</div> |
| <div class="line"><a name="l00796"></a><span class="lineno"> 796</span>  std::vector<RandomAccessIter> bin_cache;</div> |
| <div class="line"><a name="l00797"></a><span class="lineno"> 797</span>  <a class="code" href="namespaceboost_1_1sort_1_1detail.html#a66be693262defeff06a4a3507155d4a3">reverse_string_sort_rec</a><RandomAccessIter, Unsigned_char_type, Get_char,</div> |
| <div class="line"><a name="l00798"></a><span class="lineno"> 798</span>  Get_length, Compare></div> |
| <div class="line"><a name="l00799"></a><span class="lineno"> 799</span>  (first, last, 0, bin_cache, 0, bin_sizes, getchar, length, comp);</div> |
| <div class="line"><a name="l00800"></a><span class="lineno"> 800</span>  }</div> |
| <div class="line"><a name="l00801"></a><span class="lineno"> 801</span> </div> |
| <div class="line"><a name="l00802"></a><span class="lineno"> 802</span>  <span class="keyword">template</span> <<span class="keyword">class </span>RandomAccessIter, <span class="keyword">class </span>Get_char, <span class="keyword">class </span>Get_length,</div> |
| <div class="line"><a name="l00803"></a><span class="lineno"> 803</span>  <span class="keyword">class </span>Compare, <span class="keyword">class </span>Unsigned_char_type></div> |
| <div class="line"><a name="l00804"></a><span class="lineno"> 804</span>  <span class="keyword">inline</span> <span class="keyword">typename</span> boost::disable_if_c< <span class="keyword">sizeof</span>(Unsigned_char_type) <= 2, <span class="keywordtype">void</span></div> |
| <div class="line"><a name="l00805"></a><span class="lineno"> 805</span>  >::type</div> |
| <div class="line"><a name="l00806"></a><span class="lineno"> 806</span>  <a class="code" href="namespaceboost_1_1sort.html#a4ad4785d90f47d51ff1d2fac8c21bb48">reverse_string_sort</a>(RandomAccessIter first, RandomAccessIter last,</div> |
| <div class="line"><a name="l00807"></a><span class="lineno"> 807</span>  Get_char getchar, Get_length length, Compare comp, Unsigned_char_type)</div> |
| <div class="line"><a name="l00808"></a><span class="lineno"> 808</span>  {</div> |
| <div class="line"><a name="l00809"></a><span class="lineno"> 809</span>  <span class="comment">//Warning that we're using std::sort, even though string_sort was called</span></div> |
| <div class="line"><a name="l00810"></a><span class="lineno"> 810</span>  BOOST_STATIC_WARNING( <span class="keyword">sizeof</span>(Unsigned_char_type) <= 2 );</div> |
| <div class="line"><a name="l00811"></a><span class="lineno"> 811</span>  std::sort(first, last, comp);</div> |
| <div class="line"><a name="l00812"></a><span class="lineno"> 812</span>  }</div> |
| <div class="line"><a name="l00813"></a><span class="lineno"> 813</span>  }</div> |
| <div class="line"><a name="l00814"></a><span class="lineno"> 814</span> }</div> |
| <div class="line"><a name="l00815"></a><span class="lineno"> 815</span> }</div> |
| <div class="line"><a name="l00816"></a><span class="lineno"> 816</span> </div> |
| <div class="line"><a name="l00817"></a><span class="lineno"> 817</span> <span class="preprocessor">#endif</span></div> |
| <div class="ttc" id="namespaceboost_1_1sort_1_1detail_html_a585497946eeb8cc1d2072642d7f1da01"><div class="ttname"><a href="namespaceboost_1_1sort_1_1detail.html#a585497946eeb8cc1d2072642d7f1da01">boost::sort::detail::update_offset</a></div><div class="ttdeci">void update_offset(RandomAccessIter first, RandomAccessIter finish, size_t &char_offset)</div><div class="ttdef"><b>Definition:</b> string_sort.hpp:39</div></div> |
| <div class="ttc" id="namespaceboost_html"><div class="ttname"><a href="namespaceboost.html">boost</a></div><div class="ttdef"><b>Definition:</b> constants.hpp:11</div></div> |
| <div class="ttc" id="structboost_1_1sort_1_1detail_1_1offset__char__less__than_html_a0716b085964e676c8c9735bafa783007"><div class="ttname"><a href="structboost_1_1sort_1_1detail_1_1offset__char__less__than.html#a0716b085964e676c8c9735bafa783007">boost::sort::detail::offset_char_less_than::offset_char_less_than</a></div><div class="ttdeci">offset_char_less_than(size_t char_offset)</div><div class="ttdef"><b>Definition:</b> string_sort.hpp:142</div></div> |
| <div class="ttc" id="structboost_1_1sort_1_1detail_1_1offset__greater__than_html_a2d28d7eb61a69c61c0362cfefa264d73"><div class="ttname"><a href="structboost_1_1sort_1_1detail_1_1offset__greater__than.html#a2d28d7eb61a69c61c0362cfefa264d73">boost::sort::detail::offset_greater_than::operator()</a></div><div class="ttdeci">bool operator()(const Data_type &x, const Data_type &y) const </div><div class="ttdef"><b>Definition:</b> string_sort.hpp:123</div></div> |
| <div class="ttc" id="structboost_1_1sort_1_1detail_1_1offset__greater__than_html_a3ce63f721a5a4453317ffc0ea61a6243"><div class="ttname"><a href="structboost_1_1sort_1_1detail_1_1offset__greater__than.html#a3ce63f721a5a4453317ffc0ea61a6243">boost::sort::detail::offset_greater_than::fchar_offset</a></div><div class="ttdeci">size_t fchar_offset</div><div class="ttdef"><b>Definition:</b> string_sort.hpp:136</div></div> |
| <div class="ttc" id="structboost_1_1sort_1_1detail_1_1offset__greater__than_html"><div class="ttname"><a href="structboost_1_1sort_1_1detail_1_1offset__greater__than.html">boost::sort::detail::offset_greater_than</a></div><div class="ttdef"><b>Definition:</b> string_sort.hpp:121</div></div> |
| <div class="ttc" id="namespaceboost_1_1sort_1_1detail_html_ad1655ab39e410e18b6e8b6694405e5ba"><div class="ttname"><a href="namespaceboost_1_1sort_1_1detail.html#ad1655ab39e410e18b6e8b6694405e5ba">boost::sort::detail::string_sort_rec</a></div><div class="ttdeci">void string_sort_rec(RandomAccessIter first, RandomAccessIter last, size_t char_offset, std::vector< RandomAccessIter > &bin_cache, unsigned cache_offset, size_t *bin_sizes)</div><div class="ttdef"><b>Definition:</b> string_sort.hpp:161</div></div> |
| <div class="ttc" id="namespaceboost_1_1sort_1_1detail_html_a66be693262defeff06a4a3507155d4a3"><div class="ttname"><a href="namespaceboost_1_1sort_1_1detail.html#a66be693262defeff06a4a3507155d4a3">boost::sort::detail::reverse_string_sort_rec</a></div><div class="ttdeci">void reverse_string_sort_rec(RandomAccessIter first, RandomAccessIter last, size_t char_offset, std::vector< RandomAccessIter > &bin_cache, unsigned cache_offset, size_t *bin_sizes)</div><div class="ttdef"><b>Definition:</b> string_sort.hpp:266</div></div> |
| <div class="ttc" id="structboost_1_1sort_1_1detail_1_1offset__less__than_html_a0c153f50b29e9bea224df345c5ff1e91"><div class="ttname"><a href="structboost_1_1sort_1_1detail_1_1offset__less__than.html#a0c153f50b29e9bea224df345c5ff1e91">boost::sort::detail::offset_less_than::offset_less_than</a></div><div class="ttdeci">offset_less_than(size_t char_offset)</div><div class="ttdef"><b>Definition:</b> string_sort.hpp:102</div></div> |
| <div class="ttc" id="structboost_1_1sort_1_1detail_1_1offset__char__less__than_html_ae5ee4abf81ecfb4ff4016792b81bfbd2"><div class="ttname"><a href="structboost_1_1sort_1_1detail_1_1offset__char__less__than.html#ae5ee4abf81ecfb4ff4016792b81bfbd2">boost::sort::detail::offset_char_less_than::fchar_offset</a></div><div class="ttdeci">size_t fchar_offset</div><div class="ttdef"><b>Definition:</b> string_sort.hpp:153</div></div> |
| <div class="ttc" id="namespaceboost_1_1sort_html_a950a2dbbe75f048a0b343dbf7c532dc0"><div class="ttname"><a href="namespaceboost_1_1sort.html#a950a2dbbe75f048a0b343dbf7c532dc0">boost::sort::string_sort</a></div><div class="ttdeci">void string_sort(RandomAccessIter first, RandomAccessIter last, Unsigned_char_type unused)</div><div class="ttdef"><b>Definition:</b> string_sort.hpp:29</div></div> |
| <div class="ttc" id="structboost_1_1sort_1_1detail_1_1offset__char__less__than_html"><div class="ttname"><a href="structboost_1_1sort_1_1detail_1_1offset__char__less__than.html">boost::sort::detail::offset_char_less_than</a></div><div class="ttdef"><b>Definition:</b> string_sort.hpp:141</div></div> |
| <div class="ttc" id="spreadsort__common_8hpp_html"><div class="ttname"><a href="spreadsort__common_8hpp.html">spreadsort_common.hpp</a></div></div> |
| <div class="ttc" id="namespaceboost_1_1sort_html_a4ad4785d90f47d51ff1d2fac8c21bb48"><div class="ttname"><a href="namespaceboost_1_1sort.html#a4ad4785d90f47d51ff1d2fac8c21bb48">boost::sort::reverse_string_sort</a></div><div class="ttdeci">void reverse_string_sort(RandomAccessIter first, RandomAccessIter last, Compare comp, Unsigned_char_type unused)</div><div class="ttdef"><b>Definition:</b> string_sort.hpp:49</div></div> |
| <div class="ttc" id="structboost_1_1sort_1_1detail_1_1offset__less__than_html"><div class="ttname"><a href="structboost_1_1sort_1_1detail_1_1offset__less__than.html">boost::sort::detail::offset_less_than</a></div><div class="ttdef"><b>Definition:</b> string_sort.hpp:101</div></div> |
| <div class="ttc" id="structboost_1_1sort_1_1detail_1_1offset__greater__than_html_a9603b8028ace4872c6e056917c7889aa"><div class="ttname"><a href="structboost_1_1sort_1_1detail_1_1offset__greater__than.html#a9603b8028ace4872c6e056917c7889aa">boost::sort::detail::offset_greater_than::offset_greater_than</a></div><div class="ttdeci">offset_greater_than(size_t char_offset)</div><div class="ttdef"><b>Definition:</b> string_sort.hpp:122</div></div> |
| <div class="ttc" id="structboost_1_1sort_1_1detail_1_1offset__less__than_html_a3f2184b627e54eb990bfe2022b6f8f06"><div class="ttname"><a href="structboost_1_1sort_1_1detail_1_1offset__less__than.html#a3f2184b627e54eb990bfe2022b6f8f06">boost::sort::detail::offset_less_than::operator()</a></div><div class="ttdeci">bool operator()(const Data_type &x, const Data_type &y) const </div><div class="ttdef"><b>Definition:</b> string_sort.hpp:103</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="structboost_1_1sort_1_1detail_1_1offset__less__than_html_ae6d1402367790441b962b8cc9f066aac"><div class="ttname"><a href="structboost_1_1sort_1_1detail_1_1offset__less__than.html#ae6d1402367790441b962b8cc9f066aac">boost::sort::detail::offset_less_than::fchar_offset</a></div><div class="ttdeci">size_t fchar_offset</div><div class="ttdef"><b>Definition:</b> string_sort.hpp:116</div></div> |
| <div class="ttc" id="structboost_1_1sort_1_1detail_1_1offset__char__less__than_html_a8ff12c3dcf4a6ea9942b8fc1e5046936"><div class="ttname"><a href="structboost_1_1sort_1_1detail_1_1offset__char__less__than.html#a8ff12c3dcf4a6ea9942b8fc1e5046936">boost::sort::detail::offset_char_less_than::length</a></div><div class="ttdeci">Get_length length</div><div class="ttdef"><b>Definition:</b> string_sort.hpp:155</div></div> |
| <div class="ttc" id="namespaceboost_1_1sort_1_1detail_html_ad5b7d31fba809eae5d17f5c2fb0a385b"><div class="ttname"><a href="namespaceboost_1_1sort_1_1detail.html#ad5b7d31fba809eae5d17f5c2fb0a385b">boost::sort::detail::size_bins</a></div><div class="ttdeci">RandomAccessIter * size_bins(size_t *bin_sizes, std::vector< RandomAccessIter > &bin_cache, unsigned cache_offset, unsigned &cache_end, unsigned bin_count)</div><div class="ttdef"><b>Definition:</b> spreadsort_common.hpp:106</div></div> |
| <div class="ttc" id="structboost_1_1sort_1_1detail_1_1offset__char__less__than_html_afb5424173c237d8cd25722a02c23ab30"><div class="ttname"><a href="structboost_1_1sort_1_1detail_1_1offset__char__less__than.html#afb5424173c237d8cd25722a02c23ab30">boost::sort::detail::offset_char_less_than::getchar</a></div><div class="ttdeci">Get_char getchar</div><div class="ttdef"><b>Definition:</b> string_sort.hpp:154</div></div> |
| <div class="ttc" id="structboost_1_1sort_1_1detail_1_1offset__char__less__than_html_ad20c3572610e68d76c49dfff2eba2bf3"><div class="ttname"><a href="structboost_1_1sort_1_1detail_1_1offset__char__less__than.html#ad20c3572610e68d76c49dfff2eba2bf3">boost::sort::detail::offset_char_less_than::operator()</a></div><div class="ttdeci">bool operator()(const Data_type &x, const Data_type &y) const </div><div class="ttdef"><b>Definition:</b> string_sort.hpp:143</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> |
