Página Principal Explorar Ajuda
Registe-se Iniciar Sessão
devn00b
/
EQ2EMu
9
3
Fork 0
Ficheiros Problemas 59 Pull Requests 0 Wiki
Árvore: 9d9a5ec294
Ramos Etiquetas
EQ2EMu
/
EQ2
/
source
/
depends
/
boost_1_72_0
/
libs
/
sort
/
doc
/
doxygen
/
html
/
namespaceboost_1_1sort.html

namespaceboost_1_1sort.html 90 KB
Histórico Em bruto

1234567891011121314151617181920212223242526272829303132333435363738394041424344454647484950515253545556575859606162636465666768697071727374757677787980818283848586878889909192939495969798991001011021031041051061071081091101111121131141151161171181191201211221231241251261271281291301311321331341351361371381391401411421431441451461471481491501511521531541551561571581591601611621631641651661671681691701711721731741751761771781791801811821831841851861871881891901911921931941951961971981992002012022032042052062072082092102112122132142152162172182192202212222232242252262272282292302312322332342352362372382392402412422432442452462472482492502512522532542552562572582592602612622632642652662672682692702712722732742752762772782792802812822832842852862872882892902912922932942952962972982993003013023033043053063073083093103113123133143153163173183193203213223233243253263273283293303313323333343353363373383393403413423433443453463473483493503513523533543553563573583593603613623633643653663673683693703713723733743753763773783793803813823833843853863873883893903913923933943953963973983994004014024034044054064074084094104114124134144154164174184194204214224234244254264274284294304314324334344354364374384394404414424434444454464474484494504514524534544554564574584594604614624634644654664674684694704714724734744754764774784794804814824834844854864874884894904914924934944954964974984995005015025035045055065075085095105115125135145155165175185195205215225235245255265275285295305315325335345355365375385395405415425435445455465475485495505515525535545555565575585595605615625635645655665675685695705715725735745755765775785795805815825835845855865875885895905915925935945955965975985996006016026036046056066076086096106116126136146156166176186196206216226236246256266276286296306316326336346356366376386396406416426436446456466476486496506516526536546556566576586596606616626636646656666676686696706716726736746756766776786796806816826836846856866876886896906916926936946956966976986997007017027037047057067077087097107117127137147157167177187197207217227237247257267277287297307317327337347357367377387397407417427437447457467477487497507517527537547557567577587597607617627637647657667677687697707717727737747757767777787797807817827837847857867877887897907917927937947957967977987998008018028038048058068078088098108118128138148158168178188198208218228238248258268278288298308318328338348358368378388398408418428438448458468478488498508518528538548558568578588598608618628638648658668678688698708718728738748758768778788798808818828838848858868878888898908918928938948958968978988999009019029039049059069079089099109119129139149159169179189199209219229239249259269279289299309319329339349359369379389399409419429439449459469479489499509519529539549559569579589599609619629639649659669679689699709719729739749759769779789799809819829839849859869879889899909919929939949959969979989991000100110021003100410051006100710081009101010111012101310141015101610171018101910201021102210231024102510261027102810291030103110321033103410351036103710381039104010411042104310441045104610471048104910501051105210531054105510561057105810591060106110621063106410651066106710681069107010711072107310741075107610771078107910801081108210831084108510861087108810891090109110921093109410951096109710981099110011011102110311041105110611071108110911101111111211131114111511161117111811191120112111221123112411251126112711281129113011311132113311341135113611371138113911401141114211431144114511461147114811491150115111521153115411551156115711581159116011611162116311641165116611671168116911701171117211731174117511761177117811791180118111821183118411851186118711881189119011911192119311941195119611971198119912001201120212031204120512061207120812091210121112121213121412151216121712181219122012211222122312241225122612271228122912301231123212331234123512361237123812391240124112421243124412451246124712481249125012511252125312541255125612571258125912601261126212631264126512661267126812691270127112721273127412751276127712781279128012811282128312841285128612871288128912901291129212931294129512961297129812991300130113021303130413051306130713081309131013111312131313141315131613171318131913201321132213231324132513261327132813291330133113321333133413351336133713381339134013411342134313441345134613471348134913501351135213531354135513561357135813591360136113621363136413651366136713681369137013711372137313741375137613771378137913801381138213831384138513861387138813891390139113921393139413951396139713981399140014011402140314041405140614071408140914101411141214131414141514161417141814191420142114221423142414251426142714281429143014311432143314341435143614371438143914401441144214431444144514461447144814491450145114521453145414551456145714581459146014611462146314641465146614671468146914701471147214731474147514761477147814791480148114821483148414851486148714881489149014911492149314941495149614971498149915001501150215031504150515061507150815091510151115121513151415151516151715181519152015211522152315241525152615271528152915301531153215331534 
  1. <!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "http://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd">
    2. 

  2. <html xmlns="http://www.w3.org/1999/xhtml">
    3. 

  3. <head>
    4. 

  4. <meta http-equiv="Content-Type" content="text/xhtml;charset=UTF-8"/>
    5. 

  5. <meta http-equiv="X-UA-Compatible" content="IE=9"/>
    6. 

  6. <meta name="generator" content="Doxygen 1.8.9.1"/>
    7. 

  7. <title>Boost.Sort: boost::sort Namespace Reference</title>
    8. 

  8. <link href="tabs.css" rel="stylesheet" type="text/css"/>
    9. 

  9. <script type="text/javascript" src="jquery.js"></script>
    10. 

  10. <script type="text/javascript" src="dynsections.js"></script>
    11. 

  11. <link href="search/search.css" rel="stylesheet" type="text/css"/>
    12. 

  12. <script type="text/javascript" src="search/searchdata.js"></script>
    13. 

  13. <script type="text/javascript" src="search/search.js"></script>
    14. 

  14. <script type="text/javascript">
    15. 

  15.   $(document).ready(function() { init_search(); });
    16. 

  16. </script>
    17. 

  17. <link href="doxygen.css" rel="stylesheet" type="text/css" />
    18. 

  18. </head>
    19. 

  19. <body>
    20. 

  20. <div id="top"><!-- do not remove this div, it is closed by doxygen! -->
    21. 

  21. <div id="titlearea">
    22. 

  22. <table cellspacing="0" cellpadding="0">
    23. 

  23.  <tbody>
    24. 

  24.  <tr style="height: 56px;">
    25. 

  25.   <td style="padding-left: 0.5em;">
    26. 

  26.    <div id="projectname">Boost.Sort
    27. 

  27.    </div>
    28. 

  28.   </td>
    29. 

  29.  </tr>
    30. 

  30.  </tbody>
    31. 

  31. </table>
    32. 

  32. </div>
    33. 

  33. <!-- end header part -->
    34. 

  34. <!-- Generated by Doxygen 1.8.9.1 -->
    35. 

  35. <script type="text/javascript">
    36. 

  36. var searchBox = new SearchBox("searchBox", "search",false,'Search');
    37. 

  37. </script>
    38. 

  38.   <div id="navrow1" class="tabs">
    39. 

  39.     <ul class="tablist">
    40. 

  40.       <li><a href="index.html"><span>Main&#160;Page</span></a></li>
    41. 

  41.       <li class="current"><a href="namespaces.html"><span>Namespaces</span></a></li>
    42. 

  42.       <li><a href="annotated.html"><span>Classes</span></a></li>
    43. 

  43.       <li><a href="files.html"><span>Files</span></a></li>
    44. 

  44.       <li>
    45. 

  45.         <div id="MSearchBox" class="MSearchBoxInactive">
    46. 

  46.         <span class="left">
    47. 

  47.           <img id="MSearchSelect" src="search/mag_sel.png"
    48. 

  48.                onmouseover="return searchBox.OnSearchSelectShow()"
    49. 

  49.                onmouseout="return searchBox.OnSearchSelectHide()"
    50. 

  50.                alt=""/>
    51. 

  51.           <input type="text" id="MSearchField" value="Search" accesskey="S"
    52. 

  52.                onfocus="searchBox.OnSearchFieldFocus(true)" 
    53. 

  53.                onblur="searchBox.OnSearchFieldFocus(false)" 
    54. 

  54.                onkeyup="searchBox.OnSearchFieldChange(event)"/>
    55. 

  55.           </span><span class="right">
    56. 

  56.             <a id="MSearchClose" href="javascript:searchBox.CloseResultsWindow()"><img id="MSearchCloseImg" border="0" src="search/close.png" alt=""/></a>
    57. 

  57.           </span>
    58. 

  58.         </div>
    59. 

  59.       </li>
    60. 

  60.     </ul>
    61. 

  61.   </div>
    62. 

  62.   <div id="navrow2" class="tabs2">
    63. 

  63.     <ul class="tablist">
    64. 

  64.       <li><a href="namespaces.html"><span>Namespace&#160;List</span></a></li>
    65. 

  65.       <li><a href="namespacemembers.html"><span>Namespace&#160;Members</span></a></li>
    66. 

  66.     </ul>
    67. 

  67.   </div>
    68. 

  68. <!-- window showing the filter options -->
    69. 

  69. <div id="MSearchSelectWindow"
    70. 

  70.      onmouseover="return searchBox.OnSearchSelectShow()"
    71. 

  71.      onmouseout="return searchBox.OnSearchSelectHide()"
    72. 

  72.      onkeydown="return searchBox.OnSearchSelectKey(event)">
    73. 

  73. </div>
    74. 

  74. 

  75. <!-- iframe showing the search results (closed by default) -->
    76. 

  76. <div id="MSearchResultsWindow">
    77. 

  77. <iframe src="javascript:void(0)" frameborder="0" 
    78. 

  78.         name="MSearchResults" id="MSearchResults">
    79. 

  79. </iframe>
    80. 

  80. </div>
    81. 

  81. 

  82. <div id="nav-path" class="navpath">
    83. 

  83.   <ul>
    84. 

  84. <li class="navelem"><a class="el" href="namespaceboost.html">boost</a></li><li class="navelem"><a class="el" href="namespaceboost_1_1sort.html">sort</a></li>  </ul>
    85. 

  85. </div>
    86. 

  86. </div><!-- top -->
    87. 

  87. <div class="header">
    88. 

  88.   <div class="summary">
    89. 

  89. <a href="#func-members">Functions</a>  </div>
    90. 

  90.   <div class="headertitle">
    91. 

  91. <div class="title">boost::sort Namespace Reference</div>  </div>
    92. 

  92. </div><!--header-->
    93. 

  93. <div class="contents">
    94. 

  94. <table class="memberdecls">
    95. 

  95. <tr class="heading"><td colspan="2"><h2 class="groupheader"><a name="func-members"></a>
    96. 

  96. Functions</h2></td></tr>
    97. 

  97. <tr class="memitem:ac3a946e197df6cfc4968c6371ace319b"><td class="memTemplParams" colspan="2">template&lt;class Data_type , class Cast_type &gt; </td></tr>
    98. 

  98. <tr class="memitem:ac3a946e197df6cfc4968c6371ace319b"><td class="memTemplItemLeft" align="right" valign="top">Cast_type&#160;</td><td class="memTemplItemRight" valign="bottom"><a class="el" href="namespaceboost_1_1sort.html#ac3a946e197df6cfc4968c6371ace319b">float_mem_cast</a> (const Data_type &amp;data)</td></tr>
    99. 

  99. <tr class="memdesc:ac3a946e197df6cfc4968c6371ace319b"><td class="mdescLeft">&#160;</td><td class="mdescRight">Casts a float to the specified integer type.  <a href="#ac3a946e197df6cfc4968c6371ace319b">More...</a><br /></td></tr>
    100. 

  100. <tr class="separator:ac3a946e197df6cfc4968c6371ace319b"><td class="memSeparator" colspan="2">&#160;</td></tr>
    101. 

  101. <tr class="memitem:acbcfc139de18c5c35c0ff1744c56e211"><td class="memTemplParams" colspan="2">template&lt;class RandomAccessIter &gt; </td></tr>
    102. 

  102. <tr class="memitem:acbcfc139de18c5c35c0ff1744c56e211"><td class="memTemplItemLeft" align="right" valign="top">void&#160;</td><td class="memTemplItemRight" valign="bottom"><a class="el" href="namespaceboost_1_1sort.html#acbcfc139de18c5c35c0ff1744c56e211">float_sort</a> (RandomAccessIter first, RandomAccessIter last)</td></tr>
    103. 

  103. <tr class="memdesc:acbcfc139de18c5c35c0ff1744c56e211"><td class="mdescLeft">&#160;</td><td class="mdescRight"><code>float_sort</code> with casting to the appropriate size.  <a href="#acbcfc139de18c5c35c0ff1744c56e211">More...</a><br /></td></tr>
    104. 

  104. <tr class="separator:acbcfc139de18c5c35c0ff1744c56e211"><td class="memSeparator" colspan="2">&#160;</td></tr>
    105. 

  105. <tr class="memitem:ad65f9ec25686acfbd2a59683cc99be12"><td class="memTemplParams" colspan="2">template&lt;class RandomAccessIter , class Right_shift &gt; </td></tr>
    106. 

  106. <tr class="memitem:ad65f9ec25686acfbd2a59683cc99be12"><td class="memTemplItemLeft" align="right" valign="top">void&#160;</td><td class="memTemplItemRight" valign="bottom"><a class="el" href="namespaceboost_1_1sort.html#ad65f9ec25686acfbd2a59683cc99be12">float_sort</a> (RandomAccessIter first, RandomAccessIter last, Right_shift rshift)</td></tr>
    107. 

  107. <tr class="memdesc:ad65f9ec25686acfbd2a59683cc99be12"><td class="mdescLeft">&#160;</td><td class="mdescRight">Floating-point sort algorithm using random access iterators with just right-shift functor.  <a href="#ad65f9ec25686acfbd2a59683cc99be12">More...</a><br /></td></tr>
    108. 

  108. <tr class="separator:ad65f9ec25686acfbd2a59683cc99be12"><td class="memSeparator" colspan="2">&#160;</td></tr>
    109. 

  109. <tr class="memitem:a941746cb1461c5f4971c2cf1efb9301e"><td class="memTemplParams" colspan="2">template&lt;class RandomAccessIter , class Right_shift , class Compare &gt; </td></tr>
    110. 

  110. <tr class="memitem:a941746cb1461c5f4971c2cf1efb9301e"><td class="memTemplItemLeft" align="right" valign="top">void&#160;</td><td class="memTemplItemRight" valign="bottom"><a class="el" href="namespaceboost_1_1sort.html#a941746cb1461c5f4971c2cf1efb9301e">float_sort</a> (RandomAccessIter first, RandomAccessIter last, Right_shift rshift, Compare comp)</td></tr>
    111. 

  111. <tr class="memdesc:a941746cb1461c5f4971c2cf1efb9301e"><td class="mdescLeft">&#160;</td><td class="mdescRight">Float sort algorithm using random access iterators with both right-shift and user-defined comparison operator.  <a href="#a941746cb1461c5f4971c2cf1efb9301e">More...</a><br /></td></tr>
    112. 

  112. <tr class="separator:a941746cb1461c5f4971c2cf1efb9301e"><td class="memSeparator" colspan="2">&#160;</td></tr>
    113. 

  113. <tr class="memitem:ae6ffbcf932699589fd2b93879f209013"><td class="memTemplParams" colspan="2">template&lt;class RandomAccessIter &gt; </td></tr>
    114. 

  114. <tr class="memitem:ae6ffbcf932699589fd2b93879f209013"><td class="memTemplItemLeft" align="right" valign="top">void&#160;</td><td class="memTemplItemRight" valign="bottom"><a class="el" href="namespaceboost_1_1sort.html#ae6ffbcf932699589fd2b93879f209013">integer_sort</a> (RandomAccessIter first, RandomAccessIter last)</td></tr>
    115. 

  115. <tr class="memdesc:ae6ffbcf932699589fd2b93879f209013"><td class="mdescLeft">&#160;</td><td class="mdescRight">Integer sort algorithm using random access iterators. (All variants fall back to <code>std::sort</code> if the data size is too small, &lt; <code>detail::min_sort_size</code>).  <a href="#ae6ffbcf932699589fd2b93879f209013">More...</a><br /></td></tr>
    116. 

  116. <tr class="separator:ae6ffbcf932699589fd2b93879f209013"><td class="memSeparator" colspan="2">&#160;</td></tr>
    117. 

  117. <tr class="memitem:aa4ebb2541be58f9f0fecd8d7c108b817"><td class="memTemplParams" colspan="2">template&lt;class RandomAccessIter , class Right_shift , class Compare &gt; </td></tr>
    118. 

  118. <tr class="memitem:aa4ebb2541be58f9f0fecd8d7c108b817"><td class="memTemplItemLeft" align="right" valign="top">void&#160;</td><td class="memTemplItemRight" valign="bottom"><a class="el" href="namespaceboost_1_1sort.html#aa4ebb2541be58f9f0fecd8d7c108b817">integer_sort</a> (RandomAccessIter first, RandomAccessIter last, Right_shift shift, Compare comp)</td></tr>
    119. 

  119. <tr class="memdesc:aa4ebb2541be58f9f0fecd8d7c108b817"><td class="mdescLeft">&#160;</td><td class="mdescRight">Integer sort algorithm using random access iterators with both right-shift and user-defined comparison operator. (All variants fall back to <code>std::sort</code> if the data size is too small, &lt; <code>detail::min_sort_size</code>).  <a href="#aa4ebb2541be58f9f0fecd8d7c108b817">More...</a><br /></td></tr>
    120. 

  120. <tr class="separator:aa4ebb2541be58f9f0fecd8d7c108b817"><td class="memSeparator" colspan="2">&#160;</td></tr>
    121. 

  121. <tr class="memitem:ae50349854aad811f67a540d9b3aa4d4a"><td class="memTemplParams" colspan="2">template&lt;class RandomAccessIter , class Right_shift &gt; </td></tr>
    122. 

  122. <tr class="memitem:ae50349854aad811f67a540d9b3aa4d4a"><td class="memTemplItemLeft" align="right" valign="top">void&#160;</td><td class="memTemplItemRight" valign="bottom"><a class="el" href="namespaceboost_1_1sort.html#ae50349854aad811f67a540d9b3aa4d4a">integer_sort</a> (RandomAccessIter first, RandomAccessIter last, Right_shift shift)</td></tr>
    123. 

  123. <tr class="memdesc:ae50349854aad811f67a540d9b3aa4d4a"><td class="mdescLeft">&#160;</td><td class="mdescRight">Integer sort algorithm using random access iterators with just right-shift functor. (All variants fall back to <code>std::sort</code> if the data size is too small, &lt; <code>detail::min_sort_size</code>).  <a href="#ae50349854aad811f67a540d9b3aa4d4a">More...</a><br /></td></tr>
    124. 

  124. <tr class="separator:ae50349854aad811f67a540d9b3aa4d4a"><td class="memSeparator" colspan="2">&#160;</td></tr>
    125. 

  125. <tr class="memitem:a4bc25fdacd4c948f631f08a3f9aa38eb"><td class="memTemplParams" colspan="2">template&lt;class RandomAccessIter &gt; </td></tr>
    126. 

  126. <tr class="memitem:a4bc25fdacd4c948f631f08a3f9aa38eb"><td class="memTemplItemLeft" align="right" valign="top">boost::enable_if_c&lt; std::numeric_limits&lt; typename std::iterator_traits&lt; RandomAccessIter &gt;::value_type &gt;::is_integer, void &gt;::type&#160;</td><td class="memTemplItemRight" valign="bottom"><a class="el" href="namespaceboost_1_1sort.html#a4bc25fdacd4c948f631f08a3f9aa38eb">spreadsort</a> (RandomAccessIter first, RandomAccessIter last)</td></tr>
    127. 

  127. <tr class="memdesc:a4bc25fdacd4c948f631f08a3f9aa38eb"><td class="mdescLeft">&#160;</td><td class="mdescRight">Generic <code>spreadsort</code> variant detecting integer-type elements so call to <code>integer_sort</code>.  <a href="#a4bc25fdacd4c948f631f08a3f9aa38eb">More...</a><br /></td></tr>
    128. 

  128. <tr class="separator:a4bc25fdacd4c948f631f08a3f9aa38eb"><td class="memSeparator" colspan="2">&#160;</td></tr>
    129. 

  129. <tr class="memitem:a94a736da091bd5d3b525818399f1b272"><td class="memTemplParams" colspan="2">template&lt;class RandomAccessIter &gt; </td></tr>
    130. 

  130. <tr class="memitem:a94a736da091bd5d3b525818399f1b272"><td class="memTemplItemLeft" align="right" valign="top">boost::enable_if_c&lt; !std::numeric_limits&lt; typename std::iterator_traits&lt; RandomAccessIter &gt;::value_type &gt;::is_integer &amp;&amp;std::numeric_limits&lt; typename std::iterator_traits&lt; RandomAccessIter &gt;::value_type &gt;::is_iec559, void &gt;::type&#160;</td><td class="memTemplItemRight" valign="bottom"><a class="el" href="namespaceboost_1_1sort.html#a94a736da091bd5d3b525818399f1b272">spreadsort</a> (RandomAccessIter first, RandomAccessIter last)</td></tr>
    131. 

  131. <tr class="memdesc:a94a736da091bd5d3b525818399f1b272"><td class="mdescLeft">&#160;</td><td class="mdescRight">Generic <code>spreadsort</code> variant detecting float element type so call to <code>float_sort</code>.  <a href="#a94a736da091bd5d3b525818399f1b272">More...</a><br /></td></tr>
    132. 

  132. <tr class="separator:a94a736da091bd5d3b525818399f1b272"><td class="memSeparator" colspan="2">&#160;</td></tr>
    133. 

  133. <tr class="memitem:aafdea66d9b4a7faef5604b3079b525fa"><td class="memTemplParams" colspan="2">template&lt;class RandomAccessIter &gt; </td></tr>
    134. 

  134. <tr class="memitem:aafdea66d9b4a7faef5604b3079b525fa"><td class="memTemplItemLeft" align="right" valign="top">boost::enable_if_c&lt; is_same&lt; typename std::iterator_traits&lt; RandomAccessIter &gt;::value_type, typename std::string &gt;::value||is_same&lt; typename std::iterator_traits&lt; RandomAccessIter &gt;::value_type, typename std::wstring &gt;::value, void &gt;::type&#160;</td><td class="memTemplItemRight" valign="bottom"><a class="el" href="namespaceboost_1_1sort.html#aafdea66d9b4a7faef5604b3079b525fa">spreadsort</a> (RandomAccessIter first, RandomAccessIter last)</td></tr>
    135. 

  135. <tr class="memdesc:aafdea66d9b4a7faef5604b3079b525fa"><td class="mdescLeft">&#160;</td><td class="mdescRight">Generic <code>spreadsort</code> variant detecting string element type so call to <code>string_sort</code> for <code>std::strings</code> and <code>std::wstrings</code>.  <a href="#aafdea66d9b4a7faef5604b3079b525fa">More...</a><br /></td></tr>
    136. 

  136. <tr class="separator:aafdea66d9b4a7faef5604b3079b525fa"><td class="memSeparator" colspan="2">&#160;</td></tr>
    137. 

  137. <tr class="memitem:a950a2dbbe75f048a0b343dbf7c532dc0"><td class="memTemplParams" colspan="2">template&lt;class RandomAccessIter , class Unsigned_char_type &gt; </td></tr>
    138. 

  138. <tr class="memitem:a950a2dbbe75f048a0b343dbf7c532dc0"><td class="memTemplItemLeft" align="right" valign="top">void&#160;</td><td class="memTemplItemRight" valign="bottom"><a class="el" href="namespaceboost_1_1sort.html#a950a2dbbe75f048a0b343dbf7c532dc0">string_sort</a> (RandomAccessIter first, RandomAccessIter last, Unsigned_char_type unused)</td></tr>
    139. 

  139. <tr class="memdesc:a950a2dbbe75f048a0b343dbf7c532dc0"><td class="mdescLeft">&#160;</td><td class="mdescRight">String sort algorithm using random access iterators, allowing character-type overloads.<br />
    140. 

  140.  (All variants fall back to <code>std::sort</code> if the data size is too small, &lt; <code>detail::min_sort_size</code>).  <a href="#a950a2dbbe75f048a0b343dbf7c532dc0">More...</a><br /></td></tr>
    141. 

  141. <tr class="separator:a950a2dbbe75f048a0b343dbf7c532dc0"><td class="memSeparator" colspan="2">&#160;</td></tr>
    142. 

  142. <tr class="memitem:a6acd5fc94521b0a5cb47dc491b6d862f"><td class="memTemplParams" colspan="2">template&lt;class RandomAccessIter &gt; </td></tr>
    143. 

  143. <tr class="memitem:a6acd5fc94521b0a5cb47dc491b6d862f"><td class="memTemplItemLeft" align="right" valign="top">void&#160;</td><td class="memTemplItemRight" valign="bottom"><a class="el" href="namespaceboost_1_1sort.html#a6acd5fc94521b0a5cb47dc491b6d862f">string_sort</a> (RandomAccessIter first, RandomAccessIter last)</td></tr>
    144. 

  144. <tr class="memdesc:a6acd5fc94521b0a5cb47dc491b6d862f"><td class="mdescLeft">&#160;</td><td class="mdescRight">String sort algorithm using random access iterators, wraps using default of unsigned char. (All variants fall back to <code>std::sort</code> if the data size is too small, &lt; <code>detail::min_sort_size</code>).  <a href="#a6acd5fc94521b0a5cb47dc491b6d862f">More...</a><br /></td></tr>
    145. 

  145. <tr class="separator:a6acd5fc94521b0a5cb47dc491b6d862f"><td class="memSeparator" colspan="2">&#160;</td></tr>
    146. 

  146. <tr class="memitem:a4ad4785d90f47d51ff1d2fac8c21bb48"><td class="memTemplParams" colspan="2">template&lt;class RandomAccessIter , class Compare , class Unsigned_char_type &gt; </td></tr>
    147. 

  147. <tr class="memitem:a4ad4785d90f47d51ff1d2fac8c21bb48"><td class="memTemplItemLeft" align="right" valign="top">void&#160;</td><td class="memTemplItemRight" valign="bottom"><a class="el" href="namespaceboost_1_1sort.html#a4ad4785d90f47d51ff1d2fac8c21bb48">reverse_string_sort</a> (RandomAccessIter first, RandomAccessIter last, Compare comp, Unsigned_char_type unused)</td></tr>
    148. 

  148. <tr class="memdesc:a4ad4785d90f47d51ff1d2fac8c21bb48"><td class="mdescLeft">&#160;</td><td class="mdescRight">String sort algorithm using random access iterators, allowing character-type overloads.  <a href="#a4ad4785d90f47d51ff1d2fac8c21bb48">More...</a><br /></td></tr>
    149. 

  149. <tr class="separator:a4ad4785d90f47d51ff1d2fac8c21bb48"><td class="memSeparator" colspan="2">&#160;</td></tr>
    150. 

  150. <tr class="memitem:afd4938835fd03aab9c42bd0653e5dbe5"><td class="memTemplParams" colspan="2">template&lt;class RandomAccessIter , class Compare &gt; </td></tr>
    151. 

  151. <tr class="memitem:afd4938835fd03aab9c42bd0653e5dbe5"><td class="memTemplItemLeft" align="right" valign="top">void&#160;</td><td class="memTemplItemRight" valign="bottom"><a class="el" href="namespaceboost_1_1sort.html#afd4938835fd03aab9c42bd0653e5dbe5">reverse_string_sort</a> (RandomAccessIter first, RandomAccessIter last, Compare comp)</td></tr>
    152. 

  152. <tr class="memdesc:afd4938835fd03aab9c42bd0653e5dbe5"><td class="mdescLeft">&#160;</td><td class="mdescRight">String sort algorithm using random access iterators, wraps using default of <code>unsigned</code> char.  <a href="#afd4938835fd03aab9c42bd0653e5dbe5">More...</a><br /></td></tr>
    153. 

  153. <tr class="separator:afd4938835fd03aab9c42bd0653e5dbe5"><td class="memSeparator" colspan="2">&#160;</td></tr>
    154. 

  154. <tr class="memitem:a5143ec4f58cfe13eca2a0d6b6f6a6680"><td class="memTemplParams" colspan="2">template&lt;class RandomAccessIter , class Get_char , class Get_length &gt; </td></tr>
    155. 

  155. <tr class="memitem:a5143ec4f58cfe13eca2a0d6b6f6a6680"><td class="memTemplItemLeft" align="right" valign="top">void&#160;</td><td class="memTemplItemRight" valign="bottom"><a class="el" href="namespaceboost_1_1sort.html#a5143ec4f58cfe13eca2a0d6b6f6a6680">string_sort</a> (RandomAccessIter first, RandomAccessIter last, Get_char get_character, Get_length length)</td></tr>
    156. 

  156. <tr class="memdesc:a5143ec4f58cfe13eca2a0d6b6f6a6680"><td class="mdescLeft">&#160;</td><td class="mdescRight">String sort algorithm using random access iterators, wraps using default of <code>unsigned</code> char.  <a href="#a5143ec4f58cfe13eca2a0d6b6f6a6680">More...</a><br /></td></tr>
    157. 

  157. <tr class="separator:a5143ec4f58cfe13eca2a0d6b6f6a6680"><td class="memSeparator" colspan="2">&#160;</td></tr>
    158. 

  158. <tr class="memitem:a82c4c0d7ba9873ecce7c674631dceae2"><td class="memTemplParams" colspan="2">template&lt;class RandomAccessIter , class Get_char , class Get_length , class Compare &gt; </td></tr>
    159. 

  159. <tr class="memitem:a82c4c0d7ba9873ecce7c674631dceae2"><td class="memTemplItemLeft" align="right" valign="top">void&#160;</td><td class="memTemplItemRight" valign="bottom"><a class="el" href="namespaceboost_1_1sort.html#a82c4c0d7ba9873ecce7c674631dceae2">string_sort</a> (RandomAccessIter first, RandomAccessIter last, Get_char get_character, Get_length length, Compare comp)</td></tr>
    160. 

  160. <tr class="memdesc:a82c4c0d7ba9873ecce7c674631dceae2"><td class="mdescLeft">&#160;</td><td class="mdescRight">String sort algorithm using random access iterators, wraps using default of <code>unsigned</code> char.  <a href="#a82c4c0d7ba9873ecce7c674631dceae2">More...</a><br /></td></tr>
    161. 

  161. <tr class="separator:a82c4c0d7ba9873ecce7c674631dceae2"><td class="memSeparator" colspan="2">&#160;</td></tr>
    162. 

  162. <tr class="memitem:a7940f1b2a7746c083a12a4e26077096b"><td class="memTemplParams" colspan="2">template&lt;class RandomAccessIter , class Get_char , class Get_length , class Compare &gt; </td></tr>
    163. 

  163. <tr class="memitem:a7940f1b2a7746c083a12a4e26077096b"><td class="memTemplItemLeft" align="right" valign="top">void&#160;</td><td class="memTemplItemRight" valign="bottom"><a class="el" href="namespaceboost_1_1sort.html#a7940f1b2a7746c083a12a4e26077096b">reverse_string_sort</a> (RandomAccessIter first, RandomAccessIter last, Get_char get_character, Get_length length, Compare comp)</td></tr>
    164. 

  164. <tr class="memdesc:a7940f1b2a7746c083a12a4e26077096b"><td class="mdescLeft">&#160;</td><td class="mdescRight">Reverse String sort algorithm using random access iterators.  <a href="#a7940f1b2a7746c083a12a4e26077096b">More...</a><br /></td></tr>
    165. 

  165. <tr class="separator:a7940f1b2a7746c083a12a4e26077096b"><td class="memSeparator" colspan="2">&#160;</td></tr>
    166. 

  166. </table>
    167. 

  167. <a name="details" id="details"></a><h2 class="groupheader">Detailed Description</h2>
    168. 

  168. <div class="textblock"><p>Namespace for spreadsort sort variants for different data types. </p><dl class="section note"><dt>Note</dt><dd>Use hyperlinks (coloured) to get detailed information about functions. </dd></dl>
    169. 

  169. </div><h2 class="groupheader">Function Documentation</h2>
    170. 

  170. <a class="anchor" id="ac3a946e197df6cfc4968c6371ace319b"></a>
    171. 

  171. <div class="memitem">
    172. 

  172. <div class="memproto">
    173. 

  173. <div class="memtemplate">
    174. 

  174. template&lt;class Data_type , class Cast_type &gt; </div>
    175. 

  175. <table class="mlabels">
    176. 

  176.   <tr>
    177. 

  177.   <td class="mlabels-left">
    178. 

  178.       <table class="memname">
    179. 

  179.         <tr>
    180. 

  180.           <td class="memname">Cast_type boost::sort::float_mem_cast </td>
    181. 

  181.           <td>(</td>
    182. 

  182.           <td class="paramtype">const Data_type &amp;&#160;</td>
    183. 

  183.           <td class="paramname"><em>data</em></td><td>)</td>
    184. 

  184.           <td></td>
    185. 

  185.         </tr>
    186. 

  186.       </table>
    187. 

  187.   </td>
    188. 

  188.   <td class="mlabels-right">
    189. 

  189. <span class="mlabels"><span class="mlabel">inline</span></span>  </td>
    190. 

  190.   </tr>
    191. 

  191. </table>
    192. 

  192. </div><div class="memdoc">
    193. 

  193. 

  194. <p>Casts a float to the specified integer type. </p>
    195. 

  195. <dl class="tparams"><dt>Template Parameters</dt><dd>
    196. 

  196.   <table class="tparams">
    197. 

  197.     <tr><td class="paramname">Data_type</td><td>Floating-point IEEE 754/IEC559 type. </td></tr>
    198. 

  198.     <tr><td class="paramname">Cast_type</td><td>Integer type (same size) to which to cast.</td></tr>
    199. 

  199.   </table>
    200. 

  200.   </dd>
    201. 

  201. </dl>
    202. 

  202. <dl class="section user"><dt>Example:</dt><dd><div class="fragment"><div class="line"><span class="keyword">struct </span><a class="code" href="structrightshift.html">rightshift</a> {</div>
    203. 

  203. <div class="line">  <span class="keywordtype">int</span> operator()(<span class="keyword">const</span> <a class="code" href="struct_d_a_t_a___t_y_p_e.html">DATA_TYPE</a> &amp;x, <span class="keyword">const</span> <span class="keywordtype">unsigned</span> offset)<span class="keyword"> const </span>{</div>
    204. 

  204. <div class="line">    <span class="keywordflow">return</span> <a class="code" href="namespaceboost_1_1sort.html#ac3a946e197df6cfc4968c6371ace319b">float_mem_cast</a>&lt;<a class="code" href="floatfunctorsample_8cpp.html#ae35c40bc2f912c11f0e36ac66cba4489">KEY_TYPE</a>, <a class="code" href="double_8cpp.html#a38779bfd63dd113c9f7602664546a58c">CAST_TYPE</a>&gt;(x.<a class="code" href="struct_d_a_t_a___t_y_p_e.html#aa28561fc8e223d84187ccfaf99953bae">key</a>) &gt;&gt; offset;</div>
    205. 

  205. <div class="line">  }</div>
    206. 

  206. <div class="line">};</div>
    207. 

  207. </div><!-- fragment --> </dd></dl>
    208. 

  208. 

  209. </div>
    210. 

  210. </div>
    211. 

  211. <a class="anchor" id="acbcfc139de18c5c35c0ff1744c56e211"></a>
    212. 

  212. <div class="memitem">
    213. 

  213. <div class="memproto">
    214. 

  214. <div class="memtemplate">
    215. 

  215. template&lt;class RandomAccessIter &gt; </div>
    216. 

  216. <table class="mlabels">
    217. 

  217.   <tr>
    218. 

  218.   <td class="mlabels-left">
    219. 

  219.       <table class="memname">
    220. 

  220.         <tr>
    221. 

  221.           <td class="memname">void boost::sort::float_sort </td>
    222. 

  222.           <td>(</td>
    223. 

  223.           <td class="paramtype">RandomAccessIter&#160;</td>
    224. 

  224.           <td class="paramname"><em>first</em>, </td>
    225. 

  225.         </tr>
    226. 

  226.         <tr>
    227. 

  227.           <td class="paramkey"></td>
    228. 

  228.           <td></td>
    229. 

  229.           <td class="paramtype">RandomAccessIter&#160;</td>
    230. 

  230.           <td class="paramname"><em>last</em>&#160;</td>
    231. 

  231.         </tr>
    232. 

  232.         <tr>
    233. 

  233.           <td></td>
    234. 

  234.           <td>)</td>
    235. 

  235.           <td></td><td></td>
    236. 

  236.         </tr>
    237. 

  237.       </table>
    238. 

  238.   </td>
    239. 

  239.   <td class="mlabels-right">
    240. 

  240. <span class="mlabels"><span class="mlabel">inline</span></span>  </td>
    241. 

  241.   </tr>
    242. 

  242. </table>
    243. 

  243. </div><div class="memdoc">
    244. 

  244. 

  245. <p><code>float_sort</code> with casting to the appropriate size. </p>
    246. 

  246. <dl class="tparams"><dt>Template Parameters</dt><dd>
    247. 

  247.   <table class="tparams">
    248. 

  248.     <tr><td class="paramname">RandomAccessIter</td><td><a href="http://www.cplusplus.com/reference/iterator/RandomAccessIterator/">Random access iterator</a></td></tr>
    249. 

  249.   </table>
    250. 

  250.   </dd>
    251. 

  251. </dl>
    252. 

  252. <dl class="params"><dt>Parameters</dt><dd>
    253. 

  253.   <table class="params">
    254. 

  254.     <tr><td class="paramdir">[in]</td><td class="paramname">first</td><td>Iterator pointer to first element. </td></tr>
    255. 

  255.     <tr><td class="paramdir">[in]</td><td class="paramname">last</td><td>Iterator pointing to one beyond the end of data.</td></tr>
    256. 

  256.   </table>
    257. 

  257.   </dd>
    258. 

  258. </dl>
    259. 

  259. <p>Some performance plots of runtime vs. n and log(range) are provided:<br />
    260. 

  260.  <a href="../../doc/graph/windows_float_sort.htm">windows_float_sort</a> <br />
    261. 

  261.  <a href="../../doc/graph/osx_float_sort.htm">osx_float_sort</a></p>
    262. 

  262. <dl class="section user"><dt>A simple example of sorting some floating-point is:</dt><dd><div class="fragment"><div class="line">vector&lt;float&gt; vec;</div>
    263. 

  263. <div class="line">vec.push_back(1.0);</div>
    264. 

  264. <div class="line">vec.push_back(2.3);</div>
    265. 

  265. <div class="line">vec.push_back(1.3);</div>
    266. 

  266. <div class="line"><a class="code" href="namespaceboost_1_1sort.html#a4bc25fdacd4c948f631f08a3f9aa38eb">spreadsort</a>(vec.begin(), vec.end());</div>
    267. 

  267. </div><!-- fragment --> </dd></dl>
    268. 

  268. <dl class="section user"><dt>The sorted vector contains ascending values "1.0 1.3 2.3".</dt><dd></dd></dl>
    269. 

  269. 

  270. </div>
    271. 

  271. </div>
    272. 

  272. <a class="anchor" id="ad65f9ec25686acfbd2a59683cc99be12"></a>
    273. 

  273. <div class="memitem">
    274. 

  274. <div class="memproto">
    275. 

  275. <div class="memtemplate">
    276. 

  276. template&lt;class RandomAccessIter , class Right_shift &gt; </div>
    277. 

  277. <table class="mlabels">
    278. 

  278.   <tr>
    279. 

  279.   <td class="mlabels-left">
    280. 

  280.       <table class="memname">
    281. 

  281.         <tr>
    282. 

  282.           <td class="memname">void boost::sort::float_sort </td>
    283. 

  283.           <td>(</td>
    284. 

  284.           <td class="paramtype">RandomAccessIter&#160;</td>
    285. 

  285.           <td class="paramname"><em>first</em>, </td>
    286. 

  286.         </tr>
    287. 

  287.         <tr>
    288. 

  288.           <td class="paramkey"></td>
    289. 

  289.           <td></td>
    290. 

  290.           <td class="paramtype">RandomAccessIter&#160;</td>
    291. 

  291.           <td class="paramname"><em>last</em>, </td>
    292. 

  292.         </tr>
    293. 

  293.         <tr>
    294. 

  294.           <td class="paramkey"></td>
    295. 

  295.           <td></td>
    296. 

  296.           <td class="paramtype">Right_shift&#160;</td>
    297. 

  297.           <td class="paramname"><em>rshift</em>&#160;</td>
    298. 

  298.         </tr>
    299. 

  299.         <tr>
    300. 

  300.           <td></td>
    301. 

  301.           <td>)</td>
    302. 

  302.           <td></td><td></td>
    303. 

  303.         </tr>
    304. 

  304.       </table>
    305. 

  305.   </td>
    306. 

  306.   <td class="mlabels-right">
    307. 

  307. <span class="mlabels"><span class="mlabel">inline</span></span>  </td>
    308. 

  308.   </tr>
    309. 

  309. </table>
    310. 

  310. </div><div class="memdoc">
    311. 

  311. 

  312. <p>Floating-point sort algorithm using random access iterators with just right-shift functor. </p>
    313. 

  313. <dl class="tparams"><dt>Template Parameters</dt><dd>
    314. 

  314.   <table class="tparams">
    315. 

  315.     <tr><td class="paramname">RandomAccessIter</td><td><a href="http://www.cplusplus.com/reference/iterator/RandomAccessIterator/">Random access iterator</a> </td></tr>
    316. 

  316.     <tr><td class="paramname">Right_shift</td><td>Functor for right-shift by parameter <code>shift</code> bits.</td></tr>
    317. 

  317.   </table>
    318. 

  318.   </dd>
    319. 

  319. </dl>
    320. 

  320. <dl class="params"><dt>Parameters</dt><dd>
    321. 

  321.   <table class="params">
    322. 

  322.     <tr><td class="paramdir">[in]</td><td class="paramname">first</td><td>Iterator pointer to first element. </td></tr>
    323. 

  323.     <tr><td class="paramdir">[in]</td><td class="paramname">last</td><td>Iterator pointing to one beyond the end of data. </td></tr>
    324. 

  324.     <tr><td class="paramdir">[in]</td><td class="paramname">rshift</td><td>Number of bits to right-shift (using functor). </td></tr>
    325. 

  325.   </table>
    326. 

  326.   </dd>
    327. 

  327. </dl>
    328. 

  328. 

  329. </div>
    330. 

  330. </div>
    331. 

  331. <a class="anchor" id="a941746cb1461c5f4971c2cf1efb9301e"></a>
    332. 

  332. <div class="memitem">
    333. 

  333. <div class="memproto">
    334. 

  334. <div class="memtemplate">
    335. 

  335. template&lt;class RandomAccessIter , class Right_shift , class Compare &gt; </div>
    336. 

  336. <table class="mlabels">
    337. 

  337.   <tr>
    338. 

  338.   <td class="mlabels-left">
    339. 

  339.       <table class="memname">
    340. 

  340.         <tr>
    341. 

  341.           <td class="memname">void boost::sort::float_sort </td>
    342. 

  342.           <td>(</td>
    343. 

  343.           <td class="paramtype">RandomAccessIter&#160;</td>
    344. 

  344.           <td class="paramname"><em>first</em>, </td>
    345. 

  345.         </tr>
    346. 

  346.         <tr>
    347. 

  347.           <td class="paramkey"></td>
    348. 

  348.           <td></td>
    349. 

  349.           <td class="paramtype">RandomAccessIter&#160;</td>
    350. 

  350.           <td class="paramname"><em>last</em>, </td>
    351. 

  351.         </tr>
    352. 

  352.         <tr>
    353. 

  353.           <td class="paramkey"></td>
    354. 

  354.           <td></td>
    355. 

  355.           <td class="paramtype">Right_shift&#160;</td>
    356. 

  356.           <td class="paramname"><em>rshift</em>, </td>
    357. 

  357.         </tr>
    358. 

  358.         <tr>
    359. 

  359.           <td class="paramkey"></td>
    360. 

  360.           <td></td>
    361. 

  361.           <td class="paramtype">Compare&#160;</td>
    362. 

  362.           <td class="paramname"><em>comp</em>&#160;</td>
    363. 

  363.         </tr>
    364. 

  364.         <tr>
    365. 

  365.           <td></td>
    366. 

  366.           <td>)</td>
    367. 

  367.           <td></td><td></td>
    368. 

  368.         </tr>
    369. 

  369.       </table>
    370. 

  370.   </td>
    371. 

  371.   <td class="mlabels-right">
    372. 

  372. <span class="mlabels"><span class="mlabel">inline</span></span>  </td>
    373. 

  373.   </tr>
    374. 

  374. </table>
    375. 

  375. </div><div class="memdoc">
    376. 

  376. 

  377. <p>Float sort algorithm using random access iterators with both right-shift and user-defined comparison operator. </p>
    378. 

  378. <dl class="tparams"><dt>Template Parameters</dt><dd>
    379. 

  379.   <table class="tparams">
    380. 

  380.     <tr><td class="paramname">RandomAccessIter</td><td><a href="http://www.cplusplus.com/reference/iterator/RandomAccessIterator/">Random access iterator</a> </td></tr>
    381. 

  381.     <tr><td class="paramname">Right_shift</td><td>functor for right-shift by parameter <code>shift</code> bits. </td></tr>
    382. 

  382.     <tr><td class="paramname">Comp</td><td>To provide <code>operator&lt;</code> for user-defined comparison.</td></tr>
    383. 

  383.   </table>
    384. 

  384.   </dd>
    385. 

  385. </dl>
    386. 

  386. <dl class="params"><dt>Parameters</dt><dd>
    387. 

  387.   <table class="params">
    388. 

  388.     <tr><td class="paramdir">[in]</td><td class="paramname">first</td><td>Iterator pointer to first element. </td></tr>
    389. 

  389.     <tr><td class="paramdir">[in]</td><td class="paramname">last</td><td>Iterator pointing to one beyond the end of data. </td></tr>
    390. 

  390.     <tr><td class="paramdir">[in]</td><td class="paramname">rshift</td><td>Number of bits to right-shift (using functor). </td></tr>
    391. 

  391.     <tr><td class="paramdir">[in]</td><td class="paramname">comp</td><td>comparison functor. </td></tr>
    392. 

  392.   </table>
    393. 

  393.   </dd>
    394. 

  394. </dl>
    395. 

  395. 

  396. </div>
    397. 

  397. </div>
    398. 

  398. <a class="anchor" id="ae6ffbcf932699589fd2b93879f209013"></a>
    399. 

  399. <div class="memitem">
    400. 

  400. <div class="memproto">
    401. 

  401. <div class="memtemplate">
    402. 

  402. template&lt;class RandomAccessIter &gt; </div>
    403. 

  403. <table class="mlabels">
    404. 

  404.   <tr>
    405. 

  405.   <td class="mlabels-left">
    406. 

  406.       <table class="memname">
    407. 

  407.         <tr>
    408. 

  408.           <td class="memname">void boost::sort::integer_sort </td>
    409. 

  409.           <td>(</td>
    410. 

  410.           <td class="paramtype">RandomAccessIter&#160;</td>
    411. 

  411.           <td class="paramname"><em>first</em>, </td>
    412. 

  412.         </tr>
    413. 

  413.         <tr>
    414. 

  414.           <td class="paramkey"></td>
    415. 

  415.           <td></td>
    416. 

  416.           <td class="paramtype">RandomAccessIter&#160;</td>
    417. 

  417.           <td class="paramname"><em>last</em>&#160;</td>
    418. 

  418.         </tr>
    419. 

  419.         <tr>
    420. 

  420.           <td></td>
    421. 

  421.           <td>)</td>
    422. 

  422.           <td></td><td></td>
    423. 

  423.         </tr>
    424. 

  424.       </table>
    425. 

  425.   </td>
    426. 

  426.   <td class="mlabels-right">
    427. 

  427. <span class="mlabels"><span class="mlabel">inline</span></span>  </td>
    428. 

  428.   </tr>
    429. 

  429. </table>
    430. 

  430. </div><div class="memdoc">
    431. 

  431. 

  432. <p>Integer sort algorithm using random access iterators. (All variants fall back to <code>std::sort</code> if the data size is too small, &lt; <code>detail::min_sort_size</code>). </p>
    433. 

  433. <p><code>integer_sort</code> is a fast templated in-place hybrid radix/comparison algorithm, which in testing tends to be roughly 50% to 2X faster than <code>std::sort</code> for large tests (&gt;=100kB).<br />
    434. 

  434. Worst-case performance is <em> O(N * (lg(range)/s + s)) </em>, so <code>integer_sort</code> is asymptotically faster than pure comparison-based algorithms. <code>s</code> is <code>max_splits</code>, which defaults to 11, so its worst-case with default settings for 32-bit integers is <em> O(N * ((32/11) </em> slow radix-based iterations fast comparison-based iterations).<br />
    435. 

  435. <br />
    436. 

  436. Some performance plots of runtime vs. n and log(range) are provided:<br />
    437. 

  437.  <a href="../../doc/graph/windows_integer_sort.htm">windows_integer_sort</a> <br />
    438. 

  438.  <a href="../../doc/graph/osx_integer_sort.htm">osx_integer_sort</a></p>
    439. 

  439. <dl class="tparams"><dt>Template Parameters</dt><dd>
    440. 

  440.   <table class="tparams">
    441. 

  441.     <tr><td class="paramname">RandomAccessIter</td><td><a href="http://www.cplusplus.com/reference/iterator/RandomAccessIterator/">Random access iterator</a> </td></tr>
    442. 

  442.   </table>
    443. 

  443.   </dd>
    444. 

  444. </dl>
    445. 

  445. <dl class="params"><dt>Parameters</dt><dd>
    446. 

  446.   <table class="params">
    447. 

  447.     <tr><td class="paramdir">[in]</td><td class="paramname">first</td><td>Iterator pointer to first element. </td></tr>
    448. 

  448.     <tr><td class="paramdir">[in]</td><td class="paramname">last</td><td>Iterator pointing to one beyond the end of data.</td></tr>
    449. 

  449.   </table>
    450. 

  450.   </dd>
    451. 

  451. </dl>
    452. 

  452. <dl class="section pre"><dt>Precondition</dt><dd>[<code>first</code>, <code>last</code>) is a valid range. </dd>
    453. 

  453. <dd>
    454. 

  454. <code>RandomAccessIter</code> <code>value_type</code> is mutable. </dd>
    455. 

  455. <dd>
    456. 

  456. <code>RandomAccessIter</code> <code>value_type</code> is <a href="http://en.cppreference.com/w/cpp/concept/LessThanComparable">LessThanComparable</a> </dd>
    457. 

  457. <dd>
    458. 

  458. <code>RandomAccessIter</code> <code>value_type</code> supports the <code>operator&gt;&gt;</code>, which returns an integer-type right-shifted a specified number of bits. </dd></dl>
    459. 

  459. <dl class="section post"><dt>Postcondition</dt><dd>The elements in the range [<code>first</code>, <code>last</code>) are sorted in ascending order.</dd></dl>
    460. 

  460. <dl class="exception"><dt>Exceptions</dt><dd>
    461. 

  461.   <table class="exception">
    462. 

  462.     <tr><td class="paramname">std::exception</td><td>Propagates exceptions if any of the element comparisons, the element swaps (or moves), the right shift, subtraction of right-shifted elements, functors, or any operations on iterators throw.</td></tr>
    463. 

  463.   </table>
    464. 

  464.   </dd>
    465. 

  465. </dl>
    466. 

  466. <dl class="section warning"><dt>Warning</dt><dd>Throwing an exception may cause data loss. This will also throw if a small vector resize throws, in which case there will be no data loss. </dd>
    467. 

  467. <dd>
    468. 

  468. Invalid arguments cause undefined behaviour. </dd></dl>
    469. 

  469. <dl class="section note"><dt>Note</dt><dd><code>spreadsort</code> function provides a wrapper that calls the fastest sorting algorithm available for a data type, enabling faster generic-programming.</dd></dl>
    470. 

  470. <dl class="section remark"><dt>Remarks</dt><dd>The lesser of <em> O(N*log(N)) </em> comparisons and <em> O(N*log(K/S + S)) </em>operations worst-case, where: </dd>
    471. 

  471. <dd>
    472. 

  472. * N is <code>last</code> - <code>first</code>, </dd>
    473. 

  473. <dd>
    474. 

  474. * K is the log of the range in bits (32 for 32-bit integers using their full range), </dd>
    475. 

  475. <dd>
    476. 

  476. * S is a constant called max_splits, defaulting to 11 (except for strings where it is the log of the character size). </dd></dl>
    477. 

  477. 

  478. </div>
    479. 

  479. </div>
    480. 

  480. <a class="anchor" id="aa4ebb2541be58f9f0fecd8d7c108b817"></a>
    481. 

  481. <div class="memitem">
    482. 

  482. <div class="memproto">
    483. 

  483. <div class="memtemplate">
    484. 

  484. template&lt;class RandomAccessIter , class Right_shift , class Compare &gt; </div>
    485. 

  485. <table class="mlabels">
    486. 

  486.   <tr>
    487. 

  487.   <td class="mlabels-left">
    488. 

  488.       <table class="memname">
    489. 

  489.         <tr>
    490. 

  490.           <td class="memname">void boost::sort::integer_sort </td>
    491. 

  491.           <td>(</td>
    492. 

  492.           <td class="paramtype">RandomAccessIter&#160;</td>
    493. 

  493.           <td class="paramname"><em>first</em>, </td>
    494. 

  494.         </tr>
    495. 

  495.         <tr>
    496. 

  496.           <td class="paramkey"></td>
    497. 

  497.           <td></td>
    498. 

  498.           <td class="paramtype">RandomAccessIter&#160;</td>
    499. 

  499.           <td class="paramname"><em>last</em>, </td>
    500. 

  500.         </tr>
    501. 

  501.         <tr>
    502. 

  502.           <td class="paramkey"></td>
    503. 

  503.           <td></td>
    504. 

  504.           <td class="paramtype">Right_shift&#160;</td>
    505. 

  505.           <td class="paramname"><em>shift</em>, </td>
    506. 

  506.         </tr>
    507. 

  507.         <tr>
    508. 

  508.           <td class="paramkey"></td>
    509. 

  509.           <td></td>
    510. 

  510.           <td class="paramtype">Compare&#160;</td>
    511. 

  511.           <td class="paramname"><em>comp</em>&#160;</td>
    512. 

  512.         </tr>
    513. 

  513.         <tr>
    514. 

  514.           <td></td>
    515. 

  515.           <td>)</td>
    516. 

  516.           <td></td><td></td>
    517. 

  517.         </tr>
    518. 

  518.       </table>
    519. 

  519.   </td>
    520. 

  520.   <td class="mlabels-right">
    521. 

  521. <span class="mlabels"><span class="mlabel">inline</span></span>  </td>
    522. 

  522.   </tr>
    523. 

  523. </table>
    524. 

  524. </div><div class="memdoc">
    525. 

  525. 

  526. <p>Integer sort algorithm using random access iterators with both right-shift and user-defined comparison operator. (All variants fall back to <code>std::sort</code> if the data size is too small, &lt; <code>detail::min_sort_size</code>). </p>
    527. 

  527. <p><code>integer_sort</code> is a fast templated in-place hybrid radix/comparison algorithm, which in testing tends to be roughly 50% to 2X faster than <code>std::sort</code> for large tests (&gt;=100kB).<br />
    528. 

  528. Worst-case performance is <em> O(N * (lg(range)/s + s)) </em>, so <code>integer_sort</code> is asymptotically faster than pure comparison-based algorithms. <code>s</code> is <code>max_splits</code>, which defaults to 11, so its worst-case with default settings for 32-bit integers is <em> O(N * ((32/11) </em> slow radix-based iterations fast comparison-based iterations).<br />
    529. 

  529. <br />
    530. 

  530. Some performance plots of runtime vs. n and log(range) are provided:<br />
    531. 

  531.  <a href="../../doc/graph/windows_integer_sort.htm">windows_integer_sort</a> <br />
    532. 

  532.  <a href="../../doc/graph/osx_integer_sort.htm">osx_integer_sort</a></p>
    533. 

  533. <dl class="tparams"><dt>Template Parameters</dt><dd>
    534. 

  534.   <table class="tparams">
    535. 

  535.     <tr><td class="paramname">RandomAccessIter</td><td><a href="http://www.cplusplus.com/reference/iterator/RandomAccessIterator/">Random access iterator</a> </td></tr>
    536. 

  536.     <tr><td class="paramname">Right_shift</td><td>functor for right-shift by parameter <code>shift</code> bits. </td></tr>
    537. 

  537.     <tr><td class="paramname">Comp</td><td>To provide <code>operator&lt;</code> for user-defined comparison.</td></tr>
    538. 

  538.   </table>
    539. 

  539.   </dd>
    540. 

  540. </dl>
    541. 

  541. <dl class="params"><dt>Parameters</dt><dd>
    542. 

  542.   <table class="params">
    543. 

  543.     <tr><td class="paramdir">[in]</td><td class="paramname">first</td><td>Iterator pointer to first element. </td></tr>
    544. 

  544.     <tr><td class="paramdir">[in]</td><td class="paramname">last</td><td>Iterator pointing to one beyond the end of data. </td></tr>
    545. 

  545.     <tr><td class="paramdir">[in]</td><td class="paramname">shift</td><td>Number of bits to right-shift (using functor). </td></tr>
    546. 

  546.     <tr><td class="paramdir">[in]</td><td class="paramname">comp</td><td>comparison functor.</td></tr>
    547. 

  547.   </table>
    548. 

  548.   </dd>
    549. 

  549. </dl>
    550. 

  550. <dl class="section pre"><dt>Precondition</dt><dd>[<code>first</code>, <code>last</code>) is a valid range. </dd>
    551. 

  551. <dd>
    552. 

  552. <code>RandomAccessIter</code> <code>value_type</code> is mutable. </dd>
    553. 

  553. <dd>
    554. 

  554. <code>RandomAccessIter</code> <code>value_type</code> is <a href="http://en.cppreference.com/w/cpp/concept/LessThanComparable">LessThanComparable</a> </dd>
    555. 

  555. <dd>
    556. 

  556. <code>RandomAccessIter</code> <code>value_type</code> supports the <code>operator&gt;&gt;</code>, which returns an integer-type right-shifted a specified number of bits. </dd></dl>
    557. 

  557. <dl class="section post"><dt>Postcondition</dt><dd>The elements in the range [<code>first</code>, <code>last</code>) are sorted in ascending order.</dd></dl>
    558. 

  558. <dl class="section return"><dt>Returns</dt><dd><code>void</code>.</dd></dl>
    559. 

  559. <dl class="exception"><dt>Exceptions</dt><dd>
    560. 

  560.   <table class="exception">
    561. 

  561.     <tr><td class="paramname">std::exception</td><td>Propagates exceptions if any of the element comparisons, the element swaps (or moves), the right shift, subtraction of right-shifted elements, functors, or any operations on iterators throw.</td></tr>
    562. 

  562.   </table>
    563. 

  563.   </dd>
    564. 

  564. </dl>
    565. 

  565. <dl class="section warning"><dt>Warning</dt><dd>Throwing an exception may cause data loss. This will also throw if a small vector resize throws, in which case there will be no data loss. </dd>
    566. 

  566. <dd>
    567. 

  567. Invalid arguments cause undefined behaviour. </dd></dl>
    568. 

  568. <dl class="section note"><dt>Note</dt><dd><code>spreadsort</code> function provides a wrapper that calls the fastest sorting algorithm available for a data type, enabling faster generic-programming.</dd></dl>
    569. 

  569. <dl class="section remark"><dt>Remarks</dt><dd>The lesser of <em> O(N*log(N)) </em> comparisons and <em> O(N*log(K/S + S)) </em>operations worst-case, where: </dd>
    570. 

  570. <dd>
    571. 

  571. * N is <code>last</code> - <code>first</code>, </dd>
    572. 

  572. <dd>
    573. 

  573. * K is the log of the range in bits (32 for 32-bit integers using their full range), </dd>
    574. 

  574. <dd>
    575. 

  575. * S is a constant called max_splits, defaulting to 11 (except for strings where it is the log of the character size). </dd></dl>
    576. 

  576. 

  577. </div>
    578. 

  578. </div>
    579. 

  579. <a class="anchor" id="ae50349854aad811f67a540d9b3aa4d4a"></a>
    580. 

  580. <div class="memitem">
    581. 

  581. <div class="memproto">
    582. 

  582. <div class="memtemplate">
    583. 

  583. template&lt;class RandomAccessIter , class Right_shift &gt; </div>
    584. 

  584. <table class="mlabels">
    585. 

  585.   <tr>
    586. 

  586.   <td class="mlabels-left">
    587. 

  587.       <table class="memname">
    588. 

  588.         <tr>
    589. 

  589.           <td class="memname">void boost::sort::integer_sort </td>
    590. 

  590.           <td>(</td>
    591. 

  591.           <td class="paramtype">RandomAccessIter&#160;</td>
    592. 

  592.           <td class="paramname"><em>first</em>, </td>
    593. 

  593.         </tr>
    594. 

  594.         <tr>
    595. 

  595.           <td class="paramkey"></td>
    596. 

  596.           <td></td>
    597. 

  597.           <td class="paramtype">RandomAccessIter&#160;</td>
    598. 

  598.           <td class="paramname"><em>last</em>, </td>
    599. 

  599.         </tr>
    600. 

  600.         <tr>
    601. 

  601.           <td class="paramkey"></td>
    602. 

  602.           <td></td>
    603. 

  603.           <td class="paramtype">Right_shift&#160;</td>
    604. 

  604.           <td class="paramname"><em>shift</em>&#160;</td>
    605. 

  605.         </tr>
    606. 

  606.         <tr>
    607. 

  607.           <td></td>
    608. 

  608.           <td>)</td>
    609. 

  609.           <td></td><td></td>
    610. 

  610.         </tr>
    611. 

  611.       </table>
    612. 

  612.   </td>
    613. 

  613.   <td class="mlabels-right">
    614. 

  614. <span class="mlabels"><span class="mlabel">inline</span></span>  </td>
    615. 

  615.   </tr>
    616. 

  616. </table>
    617. 

  617. </div><div class="memdoc">
    618. 

  618. 

  619. <p>Integer sort algorithm using random access iterators with just right-shift functor. (All variants fall back to <code>std::sort</code> if the data size is too small, &lt; <code>detail::min_sort_size</code>). </p>
    620. 

  620. <p><code>integer_sort</code> is a fast templated in-place hybrid radix/comparison algorithm, which in testing tends to be roughly 50% to 2X faster than <code>std::sort</code> for large tests (&gt;=100kB).<br />
    621. 

  621.  </p><dl class="section user"><dt>Performance:</dt><dd>Worst-case performance is <em> O(N * (lg(range)/s + s)) </em>, so <code>integer_sort</code> is asymptotically faster than pure comparison-based algorithms. <code>s</code> is <code>max_splits</code>, which defaults to 11, so its worst-case with default settings for 32-bit integers is <em> O(N * ((32/11) </em> slow radix-based iterations fast comparison-based iterations).<br />
    622. 

  622. <br />
    623. 

  623. Some performance plots of runtime vs. n and log(range) are provided:<br />
    624. 

  624.  <a href="../../doc/graph/windows_integer_sort.htm">windows_integer_sort</a><br />
    625. 

  625.  <a href="../../doc/graph/osx_integer_sort.htm">osx_integer_sort</a></dd></dl>
    626. 

  626. <dl class="tparams"><dt>Template Parameters</dt><dd>
    627. 

  627.   <table class="tparams">
    628. 

  628.     <tr><td class="paramname">RandomAccessIter</td><td><a href="http://www.cplusplus.com/reference/iterator/RandomAccessIterator/">Random access iterator</a> </td></tr>
    629. 

  629.     <tr><td class="paramname">Right_shift</td><td>functor for right-shift by parameter <code>shift</code> bits.</td></tr>
    630. 

  630.   </table>
    631. 

  631.   </dd>
    632. 

  632. </dl>
    633. 

  633. <dl class="params"><dt>Parameters</dt><dd>
    634. 

  634.   <table class="params">
    635. 

  635.     <tr><td class="paramdir">[in]</td><td class="paramname">first</td><td>Iterator pointer to first element. </td></tr>
    636. 

  636.     <tr><td class="paramdir">[in]</td><td class="paramname">last</td><td>Iterator pointing to one beyond the end of data. </td></tr>
    637. 

  637.     <tr><td class="paramdir">[in]</td><td class="paramname">shift</td><td>Number of bits to right-shift (using functor).</td></tr>
    638. 

  638.   </table>
    639. 

  639.   </dd>
    640. 

  640. </dl>
    641. 

  641. <dl class="section pre"><dt>Precondition</dt><dd>[<code>first</code>, <code>last</code>) is a valid range. </dd>
    642. 

  642. <dd>
    643. 

  643. <code>RandomAccessIter</code> <code>value_type</code> is mutable. </dd>
    644. 

  644. <dd>
    645. 

  645. <code>RandomAccessIter</code> <code>value_type</code> is <a href="http://en.cppreference.com/w/cpp/concept/LessThanComparable">LessThanComparable</a> </dd>
    646. 

  646. <dd>
    647. 

  647. <code>RandomAccessIter</code> <code>value_type</code> supports the <code>operator&gt;&gt;</code>, which returns an integer-type right-shifted a specified number of bits. </dd></dl>
    648. 

  648. <dl class="section post"><dt>Postcondition</dt><dd>The elements in the range [<code>first</code>, <code>last</code>) are sorted in ascending order.</dd></dl>
    649. 

  649. <dl class="exception"><dt>Exceptions</dt><dd>
    650. 

  650.   <table class="exception">
    651. 

  651.     <tr><td class="paramname">std::exception</td><td>Propagates exceptions if any of the element comparisons, the element swaps (or moves), the right shift, subtraction of right-shifted elements, functors, or any operations on iterators throw.</td></tr>
    652. 

  652.   </table>
    653. 

  653.   </dd>
    654. 

  654. </dl>
    655. 

  655. <dl class="section warning"><dt>Warning</dt><dd>Throwing an exception may cause data loss. This will also throw if a small vector resize throws, in which case there will be no data loss. </dd>
    656. 

  656. <dd>
    657. 

  657. Invalid arguments cause undefined behaviour. </dd></dl>
    658. 

  658. <dl class="section note"><dt>Note</dt><dd><code>spreadsort</code> function provides a wrapper that calls the fastest sorting algorithm available for a data type, enabling faster generic-programming.</dd></dl>
    659. 

  659. <dl class="section remark"><dt>Remarks</dt><dd>The lesser of <em> O(N*log(N)) </em> comparisons and <em> O(N*log(K/S + S)) </em>operations worst-case, where: </dd>
    660. 

  660. <dd>
    661. 

  661. * N is <code>last</code> - <code>first</code>, </dd>
    662. 

  662. <dd>
    663. 

  663. * K is the log of the range in bits (32 for 32-bit integers using their full range), </dd>
    664. 

  664. <dd>
    665. 

  665. * S is a constant called max_splits, defaulting to 11 (except for strings where it is the log of the character size). </dd></dl>
    666. 

  666. 

  667. </div>
    668. 

  668. </div>
    669. 

  669. <a class="anchor" id="a4ad4785d90f47d51ff1d2fac8c21bb48"></a>
    670. 

  670. <div class="memitem">
    671. 

  671. <div class="memproto">
    672. 

  672. <div class="memtemplate">
    673. 

  673. template&lt;class RandomAccessIter , class Compare , class Unsigned_char_type &gt; </div>
    674. 

  674. <table class="mlabels">
    675. 

  675.   <tr>
    676. 

  676.   <td class="mlabels-left">
    677. 

  677.       <table class="memname">
    678. 

  678.         <tr>
    679. 

  679.           <td class="memname">void boost::sort::reverse_string_sort </td>
    680. 

  680.           <td>(</td>
    681. 

  681.           <td class="paramtype">RandomAccessIter&#160;</td>
    682. 

  682.           <td class="paramname"><em>first</em>, </td>
    683. 

  683.         </tr>
    684. 

  684.         <tr>
    685. 

  685.           <td class="paramkey"></td>
    686. 

  686.           <td></td>
    687. 

  687.           <td class="paramtype">RandomAccessIter&#160;</td>
    688. 

  688.           <td class="paramname"><em>last</em>, </td>
    689. 

  689.         </tr>
    690. 

  690.         <tr>
    691. 

  691.           <td class="paramkey"></td>
    692. 

  692.           <td></td>
    693. 

  693.           <td class="paramtype">Compare&#160;</td>
    694. 

  694.           <td class="paramname"><em>comp</em>, </td>
    695. 

  695.         </tr>
    696. 

  696.         <tr>
    697. 

  697.           <td class="paramkey"></td>
    698. 

  698.           <td></td>
    699. 

  699.           <td class="paramtype">Unsigned_char_type&#160;</td>
    700. 

  700.           <td class="paramname"><em>unused</em>&#160;</td>
    701. 

  701.         </tr>
    702. 

  702.         <tr>
    703. 

  703.           <td></td>
    704. 

  704.           <td>)</td>
    705. 

  705.           <td></td><td></td>
    706. 

  706.         </tr>
    707. 

  707.       </table>
    708. 

  708.   </td>
    709. 

  709.   <td class="mlabels-right">
    710. 

  710. <span class="mlabels"><span class="mlabel">inline</span></span>  </td>
    711. 

  711.   </tr>
    712. 

  712. </table>
    713. 

  713. </div><div class="memdoc">
    714. 

  714. 

  715. <p>String sort algorithm using random access iterators, allowing character-type overloads. </p>
    716. 

  716. <p>(All variants fall back to <code>std::sort</code> if the data size is too small, &lt; detail::min_sort_size).</p>
    717. 

  717. <p><code>integer_sort</code> is a fast templated in-place hybrid radix/comparison algorithm, which in testing tends to be roughly 50% to 2X faster than <code>std::sort</code> for large tests (&gt;=100kB).<br />
    718. 

  718. Worst-case performance is <em> O(N * (lg(range)/s + s)) </em>, so <code>integer_sort</code> is asymptotically faster than pure comparison-based algorithms. <code>s</code> is <code>max_splits</code>, which defaults to 11, so its worst-case with default settings for 32-bit integers is <em> O(N * ((32/11) </em> slow radix-based iterations fast comparison-based iterations).<br />
    719. 

  719. <br />
    720. 

  720. Some performance plots of runtime vs. n and log(range) are provided:<br />
    721. 

  721.  <a href="../../doc/graph/windows_integer_sort.htm">windows_integer_sort</a> <br />
    722. 

  722.  <a href="../../doc/graph/osx_integer_sort.htm">osx_integer_sort</a></p>
    723. 

  723. <dl class="tparams"><dt>Template Parameters</dt><dd>
    724. 

  724.   <table class="tparams">
    725. 

  725.     <tr><td class="paramname">RandomAccessIter</td><td><a href="http://www.cplusplus.com/reference/iterator/RandomAccessIterator/">Random access iterator</a> </td></tr>
    726. 

  726.     <tr><td class="paramname">Comp</td><td>To provide <code>operator&lt;</code> for user-defined comparison. </td></tr>
    727. 

  727.     <tr><td class="paramname">Unsigned_char_type</td><td>Unsigned character type used for string.</td></tr>
    728. 

  728.   </table>
    729. 

  729.   </dd>
    730. 

  730. </dl>
    731. 

  731. <dl class="params"><dt>Parameters</dt><dd>
    732. 

  732.   <table class="params">
    733. 

  733.     <tr><td class="paramdir">[in]</td><td class="paramname">first</td><td>Iterator pointer to first element. </td></tr>
    734. 

  734.     <tr><td class="paramdir">[in]</td><td class="paramname">last</td><td>Iterator pointing to one beyond the end of data. </td></tr>
    735. 

  735.     <tr><td class="paramdir">[in]</td><td class="paramname">comp</td><td>comparison functor. </td></tr>
    736. 

  736.     <tr><td class="paramdir">[in]</td><td class="paramname">unused</td><td>Unused ???</td></tr>
    737. 

  737.   </table>
    738. 

  738.   </dd>
    739. 

  739. </dl>
    740. 

  740. <dl class="section pre"><dt>Precondition</dt><dd>[<code>first</code>, <code>last</code>) is a valid range. </dd>
    741. 

  741. <dd>
    742. 

  742. <code>RandomAccessIter</code> <code>value_type</code> is mutable. </dd>
    743. 

  743. <dd>
    744. 

  744. <code>RandomAccessIter</code> <code>value_type</code> is <a href="http://en.cppreference.com/w/cpp/concept/LessThanComparable">LessThanComparable</a> </dd>
    745. 

  745. <dd>
    746. 

  746. <code>RandomAccessIter</code> <code>value_type</code> supports the <code>operator&gt;&gt;</code>, which returns an integer-type right-shifted a specified number of bits. </dd></dl>
    747. 

  747. <dl class="section post"><dt>Postcondition</dt><dd>The elements in the range [<code>first</code>, <code>last</code>) are sorted in ascending order.</dd></dl>
    748. 

  748. <dl class="section return"><dt>Returns</dt><dd><code>void</code>.</dd></dl>
    749. 

  749. <dl class="exception"><dt>Exceptions</dt><dd>
    750. 

  750.   <table class="exception">
    751. 

  751.     <tr><td class="paramname">std::exception</td><td>Propagates exceptions if any of the element comparisons, the element swaps (or moves), the right shift, subtraction of right-shifted elements, functors, or any operations on iterators throw.</td></tr>
    752. 

  752.   </table>
    753. 

  753.   </dd>
    754. 

  754. </dl>
    755. 

  755. <dl class="section warning"><dt>Warning</dt><dd>Throwing an exception may cause data loss. This will also throw if a small vector resize throws, in which case there will be no data loss. </dd>
    756. 

  756. <dd>
    757. 

  757. Invalid arguments cause undefined behaviour. </dd></dl>
    758. 

  758. <dl class="section note"><dt>Note</dt><dd><code>spreadsort</code> function provides a wrapper that calls the fastest sorting algorithm available for a data type, enabling faster generic-programming.</dd></dl>
    759. 

  759. <dl class="section remark"><dt>Remarks</dt><dd>The lesser of <em> O(N*log(N)) </em> comparisons and <em> O(N*log(K/S + S)) </em>operations worst-case, where: </dd>
    760. 

  760. <dd>
    761. 

  761. * N is <code>last</code> - <code>first</code>, </dd>
    762. 

  762. <dd>
    763. 

  763. * K is the log of the range in bits (32 for 32-bit integers using their full range), </dd>
    764. 

  764. <dd>
    765. 

  765. * S is a constant called max_splits, defaulting to 11 (except for strings where it is the log of the character size). </dd></dl>
    766. 

  766. 

  767. </div>
    768. 

  768. </div>
    769. 

  769. <a class="anchor" id="afd4938835fd03aab9c42bd0653e5dbe5"></a>
    770. 

  770. <div class="memitem">
    771. 

  771. <div class="memproto">
    772. 

  772. <div class="memtemplate">
    773. 

  773. template&lt;class RandomAccessIter , class Compare &gt; </div>
    774. 

  774. <table class="mlabels">
    775. 

  775.   <tr>
    776. 

  776.   <td class="mlabels-left">
    777. 

  777.       <table class="memname">
    778. 

  778.         <tr>
    779. 

  779.           <td class="memname">void boost::sort::reverse_string_sort </td>
    780. 

  780.           <td>(</td>
    781. 

  781.           <td class="paramtype">RandomAccessIter&#160;</td>
    782. 

  782.           <td class="paramname"><em>first</em>, </td>
    783. 

  783.         </tr>
    784. 

  784.         <tr>
    785. 

  785.           <td class="paramkey"></td>
    786. 

  786.           <td></td>
    787. 

  787.           <td class="paramtype">RandomAccessIter&#160;</td>
    788. 

  788.           <td class="paramname"><em>last</em>, </td>
    789. 

  789.         </tr>
    790. 

  790.         <tr>
    791. 

  791.           <td class="paramkey"></td>
    792. 

  792.           <td></td>
    793. 

  793.           <td class="paramtype">Compare&#160;</td>
    794. 

  794.           <td class="paramname"><em>comp</em>&#160;</td>
    795. 

  795.         </tr>
    796. 

  796.         <tr>
    797. 

  797.           <td></td>
    798. 

  798.           <td>)</td>
    799. 

  799.           <td></td><td></td>
    800. 

  800.         </tr>
    801. 

  801.       </table>
    802. 

  802.   </td>
    803. 

  803.   <td class="mlabels-right">
    804. 

  804. <span class="mlabels"><span class="mlabel">inline</span></span>  </td>
    805. 

  805.   </tr>
    806. 

  806. </table>
    807. 

  807. </div><div class="memdoc">
    808. 

  808. 

  809. <p>String sort algorithm using random access iterators, wraps using default of <code>unsigned</code> char. </p>
    810. 

  810. <p>(All variants fall back to <code>std::sort</code> if the data size is too small, &lt; <code>detail::min_sort_size</code>).</p>
    811. 

  811. <p><code>integer_sort</code> is a fast templated in-place hybrid radix/comparison algorithm, which in testing tends to be roughly 50% to 2X faster than <code>std::sort</code> for large tests (&gt;=100kB).<br />
    812. 

  812. Worst-case performance is <em> O(N * (lg(range)/s + s)) </em>, so <code>integer_sort</code> is asymptotically faster than pure comparison-based algorithms. <code>s</code> is <code>max_splits</code>, which defaults to 11, so its worst-case with default settings for 32-bit integers is <em> O(N * ((32/11) </em> slow radix-based iterations fast comparison-based iterations).<br />
    813. 

  813. <br />
    814. 

  814. Some performance plots of runtime vs. n and log(range) are provided:<br />
    815. 

  815.  <a href="../../doc/graph/windows_integer_sort.htm">windows_integer_sort</a> <br />
    816. 

  816.  <a href="../../doc/graph/osx_integer_sort.htm">osx_integer_sort</a></p>
    817. 

  817. <dl class="tparams"><dt>Template Parameters</dt><dd>
    818. 

  818.   <table class="tparams">
    819. 

  819.     <tr><td class="paramname">RandomAccessIter</td><td><a href="http://www.cplusplus.com/reference/iterator/RandomAccessIterator/">Random access iterator</a> </td></tr>
    820. 

  820.     <tr><td class="paramname">Comp</td><td>To provide <code>operator&lt;</code> for user-defined comparison.</td></tr>
    821. 

  821.   </table>
    822. 

  822.   </dd>
    823. 

  823. </dl>
    824. 

  824. <dl class="params"><dt>Parameters</dt><dd>
    825. 

  825.   <table class="params">
    826. 

  826.     <tr><td class="paramdir">[in]</td><td class="paramname">first</td><td>Iterator pointer to first element. </td></tr>
    827. 

  827.     <tr><td class="paramdir">[in]</td><td class="paramname">last</td><td>Iterator pointing to one beyond the end of data. </td></tr>
    828. 

  828.     <tr><td class="paramdir">[in]</td><td class="paramname">comp</td><td>Comparison functor.</td></tr>
    829. 

  829.   </table>
    830. 

  830.   </dd>
    831. 

  831. </dl>
    832. 

  832. <dl class="section pre"><dt>Precondition</dt><dd>[<code>first</code>, <code>last</code>) is a valid range. </dd>
    833. 

  833. <dd>
    834. 

  834. <code>RandomAccessIter</code> <code>value_type</code> is mutable. </dd>
    835. 

  835. <dd>
    836. 

  836. <code>RandomAccessIter</code> <code>value_type</code> is <a href="http://en.cppreference.com/w/cpp/concept/LessThanComparable">LessThanComparable</a> </dd>
    837. 

  837. <dd>
    838. 

  838. <code>RandomAccessIter</code> <code>value_type</code> supports the <code>operator&gt;&gt;</code>, which returns an integer-type right-shifted a specified number of bits. </dd></dl>
    839. 

  839. <dl class="section post"><dt>Postcondition</dt><dd>The elements in the range [<code>first</code>, <code>last</code>) are sorted in ascending order.</dd></dl>
    840. 

  840. <dl class="section return"><dt>Returns</dt><dd><code>void</code>.</dd></dl>
    841. 

  841. <dl class="exception"><dt>Exceptions</dt><dd>
    842. 

  842.   <table class="exception">
    843. 

  843.     <tr><td class="paramname">std::exception</td><td>Propagates exceptions if any of the element comparisons, the element swaps (or moves), the right shift, subtraction of right-shifted elements, functors, or any operations on iterators throw.</td></tr>
    844. 

  844.   </table>
    845. 

  845.   </dd>
    846. 

  846. </dl>
    847. 

  847. <dl class="section warning"><dt>Warning</dt><dd>Throwing an exception may cause data loss. This will also throw if a small vector resize throws, in which case there will be no data loss. </dd>
    848. 

  848. <dd>
    849. 

  849. Invalid arguments cause undefined behaviour. </dd></dl>
    850. 

  850. <dl class="section note"><dt>Note</dt><dd><code>spreadsort</code> function provides a wrapper that calls the fastest sorting algorithm available for a data type, enabling faster generic-programming.</dd></dl>
    851. 

  851. <dl class="section remark"><dt>Remarks</dt><dd>The lesser of <em> O(N*log(N)) </em> comparisons and <em> O(N*log(K/S + S)) </em>operations worst-case, where: </dd>
    852. 

  852. <dd>
    853. 

  853. * N is <code>last</code> - <code>first</code>, </dd>
    854. 

  854. <dd>
    855. 

  855. * K is the log of the range in bits (32 for 32-bit integers using their full range), </dd>
    856. 

  856. <dd>
    857. 

  857. * S is a constant called max_splits, defaulting to 11 (except for strings where it is the log of the character size). </dd></dl>
    858. 

  858. 

  859. </div>
    860. 

  860. </div>
    861. 

  861. <a class="anchor" id="a7940f1b2a7746c083a12a4e26077096b"></a>
    862. 

  862. <div class="memitem">
    863. 

  863. <div class="memproto">
    864. 

  864. <div class="memtemplate">
    865. 

  865. template&lt;class RandomAccessIter , class Get_char , class Get_length , class Compare &gt; </div>
    866. 

  866. <table class="mlabels">
    867. 

  867.   <tr>
    868. 

  868.   <td class="mlabels-left">
    869. 

  869.       <table class="memname">
    870. 

  870.         <tr>
    871. 

  871.           <td class="memname">void boost::sort::reverse_string_sort </td>
    872. 

  872.           <td>(</td>
    873. 

  873.           <td class="paramtype">RandomAccessIter&#160;</td>
    874. 

  874.           <td class="paramname"><em>first</em>, </td>
    875. 

  875.         </tr>
    876. 

  876.         <tr>
    877. 

  877.           <td class="paramkey"></td>
    878. 

  878.           <td></td>
    879. 

  879.           <td class="paramtype">RandomAccessIter&#160;</td>
    880. 

  880.           <td class="paramname"><em>last</em>, </td>
    881. 

  881.         </tr>
    882. 

  882.         <tr>
    883. 

  883.           <td class="paramkey"></td>
    884. 

  884.           <td></td>
    885. 

  885.           <td class="paramtype">Get_char&#160;</td>
    886. 

  886.           <td class="paramname"><em>get_character</em>, </td>
    887. 

  887.         </tr>
    888. 

  888.         <tr>
    889. 

  889.           <td class="paramkey"></td>
    890. 

  890.           <td></td>
    891. 

  891.           <td class="paramtype">Get_length&#160;</td>
    892. 

  892.           <td class="paramname"><em>length</em>, </td>
    893. 

  893.         </tr>
    894. 

  894.         <tr>
    895. 

  895.           <td class="paramkey"></td>
    896. 

  896.           <td></td>
    897. 

  897.           <td class="paramtype">Compare&#160;</td>
    898. 

  898.           <td class="paramname"><em>comp</em>&#160;</td>
    899. 

  899.         </tr>
    900. 

  900.         <tr>
    901. 

  901.           <td></td>
    902. 

  902.           <td>)</td>
    903. 

  903.           <td></td><td></td>
    904. 

  904.         </tr>
    905. 

  905.       </table>
    906. 

  906.   </td>
    907. 

  907.   <td class="mlabels-right">
    908. 

  908. <span class="mlabels"><span class="mlabel">inline</span></span>  </td>
    909. 

  909.   </tr>
    910. 

  910. </table>
    911. 

  911. </div><div class="memdoc">
    912. 

  912. 

  913. <p>Reverse String sort algorithm using random access iterators. </p>
    914. 

  914. <p>(All variants fall back to <code>std::sort</code> if the data size is too small, &lt; <code>detail::min_sort_size</code>).</p>
    915. 

  915. <p><code>integer_sort</code> is a fast templated in-place hybrid radix/comparison algorithm, which in testing tends to be roughly 50% to 2X faster than <code>std::sort</code> for large tests (&gt;=100kB).<br />
    916. 

  916. Worst-case performance is <em> O(N * (lg(range)/s + s)) </em>, so <code>integer_sort</code> is asymptotically faster than pure comparison-based algorithms. <code>s</code> is <code>max_splits</code>, which defaults to 11, so its worst-case with default settings for 32-bit integers is <em> O(N * ((32/11) </em> slow radix-based iterations fast comparison-based iterations).<br />
    917. 

  917. <br />
    918. 

  918. Some performance plots of runtime vs. n and log(range) are provided:<br />
    919. 

  919.  <a href="../../doc/graph/windows_integer_sort.htm">windows_integer_sort</a> <br />
    920. 

  920.  <a href="../../doc/graph/osx_integer_sort.htm">osx_integer_sort</a></p>
    921. 

  921. <dl class="tparams"><dt>Template Parameters</dt><dd>
    922. 

  922.   <table class="tparams">
    923. 

  923.     <tr><td class="paramname">RandomAccessIter</td><td><a href="http://www.cplusplus.com/reference/iterator/RandomAccessIterator/">Random access iterator</a> </td></tr>
    924. 

  924.     <tr><td class="paramname">Get_char</td><td>???. </td></tr>
    925. 

  925.     <tr><td class="paramname">Get_length</td><td>??? TODO </td></tr>
    926. 

  926.     <tr><td class="paramname">Comp</td><td>To provide <code>operator&lt;</code> for user-defined comparison.</td></tr>
    927. 

  927.   </table>
    928. 

  928.   </dd>
    929. 

  929. </dl>
    930. 

  930. <dl class="params"><dt>Parameters</dt><dd>
    931. 

  931.   <table class="params">
    932. 

  932.     <tr><td class="paramdir">[in]</td><td class="paramname">first</td><td>Iterator pointer to first element. </td></tr>
    933. 

  933.     <tr><td class="paramdir">[in]</td><td class="paramname">last</td><td>Iterator pointing to one beyond the end of data. </td></tr>
    934. 

  934.     <tr><td class="paramdir">[in]</td><td class="paramname">comp</td><td>comparison functor. </td></tr>
    935. 

  935.     <tr><td class="paramdir">[in]</td><td class="paramname">get_character</td><td>??? </td></tr>
    936. 

  936.     <tr><td class="paramdir">[in]</td><td class="paramname">length</td><td>???</td></tr>
    937. 

  937.   </table>
    938. 

  938.   </dd>
    939. 

  939. </dl>
    940. 

  940. <dl class="section pre"><dt>Precondition</dt><dd>[<code>first</code>, <code>last</code>) is a valid range. </dd>
    941. 

  941. <dd>
    942. 

  942. <code>RandomAccessIter</code> <code>value_type</code> is mutable. </dd>
    943. 

  943. <dd>
    944. 

  944. <code>RandomAccessIter</code> <code>value_type</code> is <a href="http://en.cppreference.com/w/cpp/concept/LessThanComparable">LessThanComparable</a> </dd></dl>
    945. 

  945. <dl class="section post"><dt>Postcondition</dt><dd>The elements in the range [<code>first</code>, <code>last</code>) are sorted in ascending order.</dd></dl>
    946. 

  946. <dl class="section return"><dt>Returns</dt><dd><code>void</code>.</dd></dl>
    947. 

  947. <dl class="exception"><dt>Exceptions</dt><dd>
    948. 

  948.   <table class="exception">
    949. 

  949.     <tr><td class="paramname">std::exception</td><td>Propagates exceptions if any of the element comparisons, the element swaps (or moves), the right shift, subtraction of right-shifted elements, functors, or any operations on iterators throw.</td></tr>
    950. 

  950.   </table>
    951. 

  951.   </dd>
    952. 

  952. </dl>
    953. 

  953. <dl class="section warning"><dt>Warning</dt><dd>Throwing an exception may cause data loss. This will also throw if a small vector resize throws, in which case there will be no data loss. </dd>
    954. 

  954. <dd>
    955. 

  955. Invalid arguments cause undefined behaviour. </dd></dl>
    956. 

  956. <dl class="section note"><dt>Note</dt><dd><code>spreadsort</code> function provides a wrapper that calls the fastest sorting algorithm available for a data type, enabling faster generic-programming.</dd></dl>
    957. 

  957. <dl class="section remark"><dt>Remarks</dt><dd>The lesser of <em> O(N*log(N)) </em> comparisons and <em> O(N*log(K/S + S)) </em>operations worst-case, where: </dd>
    958. 

  958. <dd>
    959. 

  959. * N is <code>last</code> - <code>first</code>, </dd>
    960. 

  960. <dd>
    961. 

  961. * K is the log of the range in bits (32 for 32-bit integers using their full range), </dd>
    962. 

  962. <dd>
    963. 

  963. * S is a constant called max_splits, defaulting to 11 (except for strings where it is the log of the character size). </dd></dl>
    964. 

  964. 

  965. </div>
    966. 

  966. </div>
    967. 

  967. <a class="anchor" id="a4bc25fdacd4c948f631f08a3f9aa38eb"></a>
    968. 

  968. <div class="memitem">
    969. 

  969. <div class="memproto">
    970. 

  970. <div class="memtemplate">
    971. 

  971. template&lt;class RandomAccessIter &gt; </div>
    972. 

  972. <table class="mlabels">
    973. 

  973.   <tr>
    974. 

  974.   <td class="mlabels-left">
    975. 

  975.       <table class="memname">
    976. 

  976.         <tr>
    977. 

  977.           <td class="memname">boost::enable_if_c&lt; std::numeric_limits&lt; typename std::iterator_traits&lt;RandomAccessIter&gt;::value_type &gt;::is_integer, void &gt;::type boost::sort::spreadsort </td>
    978. 

  978.           <td>(</td>
    979. 

  979.           <td class="paramtype">RandomAccessIter&#160;</td>
    980. 

  980.           <td class="paramname"><em>first</em>, </td>
    981. 

  981.         </tr>
    982. 

  982.         <tr>
    983. 

  983.           <td class="paramkey"></td>
    984. 

  984.           <td></td>
    985. 

  985.           <td class="paramtype">RandomAccessIter&#160;</td>
    986. 

  986.           <td class="paramname"><em>last</em>&#160;</td>
    987. 

  987.         </tr>
    988. 

  988.         <tr>
    989. 

  989.           <td></td>
    990. 

  990.           <td>)</td>
    991. 

  991.           <td></td><td></td>
    992. 

  992.         </tr>
    993. 

  993.       </table>
    994. 

  994.   </td>
    995. 

  995.   <td class="mlabels-right">
    996. 

  996. <span class="mlabels"><span class="mlabel">inline</span></span>  </td>
    997. 

  997.   </tr>
    998. 

  998. </table>
    999. 

  999. </div><div class="memdoc">
    1000. 

  1000. 

  1001. <p>Generic <code>spreadsort</code> variant detecting integer-type elements so call to <code>integer_sort</code>. </p>
    1002. 

  1002. <p>If the data type provided is an integer, <code>integer_sort</code> is used. </p><dl class="section note"><dt>Note</dt><dd>Sorting other data types requires picking between <code>integer_sort</code>, <code>float_sort</code> and <code>string_sort</code> directly, as <code>spreadsort</code> won't accept types that don't have the appropriate <code>type_traits</code>. </dd></dl>
    1003. 

  1003. <dl class="tparams"><dt>Template Parameters</dt><dd>
    1004. 

  1004.   <table class="tparams">
    1005. 

  1005.     <tr><td class="paramname">RandomAccessIter</td><td><a href="http://www.cplusplus.com/reference/iterator/RandomAccessIterator/">Random access iterator</a> </td></tr>
    1006. 

  1006.   </table>
    1007. 

  1007.   </dd>
    1008. 

  1008. </dl>
    1009. 

  1009. <dl class="params"><dt>Parameters</dt><dd>
    1010. 

  1010.   <table class="params">
    1011. 

  1011.     <tr><td class="paramdir">[in]</td><td class="paramname">first</td><td>Iterator pointer to first element. </td></tr>
    1012. 

  1012.     <tr><td class="paramdir">[in]</td><td class="paramname">last</td><td>Iterator pointing to one beyond the end of data.</td></tr>
    1013. 

  1013.   </table>
    1014. 

  1014.   </dd>
    1015. 

  1015. </dl>
    1016. 

  1016. <dl class="section pre"><dt>Precondition</dt><dd>[<code>first</code>, <code>last</code>) is a valid range. </dd>
    1017. 

  1017. <dd>
    1018. 

  1018. <code>RandomAccessIter</code> <code>value_type</code> is mutable. </dd>
    1019. 

  1019. <dd>
    1020. 

  1020. <code>RandomAccessIter</code> <code>value_type</code> is <a href="http://en.cppreference.com/w/cpp/concept/LessThanComparable">LessThanComparable</a> </dd>
    1021. 

  1021. <dd>
    1022. 

  1022. <code>RandomAccessIter</code> <code>value_type</code> supports the <code>operator&gt;&gt;</code>, which returns an integer-type right-shifted a specified number of bits. </dd></dl>
    1023. 

  1023. <dl class="section post"><dt>Postcondition</dt><dd>The elements in the range [<code>first</code>, <code>last</code>) are sorted in ascending order. </dd></dl>
    1024. 

  1024. 

  1025. </div>
    1026. 

  1026. </div>
    1027. 

  1027. <a class="anchor" id="a94a736da091bd5d3b525818399f1b272"></a>
    1028. 

  1028. <div class="memitem">
    1029. 

  1029. <div class="memproto">
    1030. 

  1030. <div class="memtemplate">
    1031. 

  1031. template&lt;class RandomAccessIter &gt; </div>
    1032. 

  1032. <table class="mlabels">
    1033. 

  1033.   <tr>
    1034. 

  1034.   <td class="mlabels-left">
    1035. 

  1035.       <table class="memname">
    1036. 

  1036.         <tr>
    1037. 

  1037.           <td class="memname">boost::enable_if_c&lt; !std::numeric_limits&lt; typename std::iterator_traits&lt;RandomAccessIter&gt;::value_type &gt;::is_integer &amp;&amp; std::numeric_limits&lt; typename std::iterator_traits&lt;RandomAccessIter&gt;::value_type &gt;::is_iec559, void &gt;::type boost::sort::spreadsort </td>
    1038. 

  1038.           <td>(</td>
    1039. 

  1039.           <td class="paramtype">RandomAccessIter&#160;</td>
    1040. 

  1040.           <td class="paramname"><em>first</em>, </td>
    1041. 

  1041.         </tr>
    1042. 

  1042.         <tr>
    1043. 

  1043.           <td class="paramkey"></td>
    1044. 

  1044.           <td></td>
    1045. 

  1045.           <td class="paramtype">RandomAccessIter&#160;</td>
    1046. 

  1046.           <td class="paramname"><em>last</em>&#160;</td>
    1047. 

  1047.         </tr>
    1048. 

  1048.         <tr>
    1049. 

  1049.           <td></td>
    1050. 

  1050.           <td>)</td>
    1051. 

  1051.           <td></td><td></td>
    1052. 

  1052.         </tr>
    1053. 

  1053.       </table>
    1054. 

  1054.   </td>
    1055. 

  1055.   <td class="mlabels-right">
    1056. 

  1056. <span class="mlabels"><span class="mlabel">inline</span></span>  </td>
    1057. 

  1057.   </tr>
    1058. 

  1058. </table>
    1059. 

  1059. </div><div class="memdoc">
    1060. 

  1060. 

  1061. <p>Generic <code>spreadsort</code> variant detecting float element type so call to <code>float_sort</code>. </p>
    1062. 

  1062. <p>If the data type provided is a float or castable-float, <code>float_sort</code> is used. </p><dl class="section note"><dt>Note</dt><dd>Sorting other data types requires picking between <code>integer_sort</code>, <code>float_sort</code> and <code>string_sort</code> directly, as <code>spreadsort</code> won't accept types that don't have the appropriate <code>type_traits</code>.</dd></dl>
    1063. 

  1063. <dl class="tparams"><dt>Template Parameters</dt><dd>
    1064. 

  1064.   <table class="tparams">
    1065. 

  1065.     <tr><td class="paramname">RandomAccessIter</td><td><a href="http://www.cplusplus.com/reference/iterator/RandomAccessIterator/">Random access iterator</a> </td></tr>
    1066. 

  1066.   </table>
    1067. 

  1067.   </dd>
    1068. 

  1068. </dl>
    1069. 

  1069. <dl class="params"><dt>Parameters</dt><dd>
    1070. 

  1070.   <table class="params">
    1071. 

  1071.     <tr><td class="paramdir">[in]</td><td class="paramname">first</td><td>Iterator pointer to first element. </td></tr>
    1072. 

  1072.     <tr><td class="paramdir">[in]</td><td class="paramname">last</td><td>Iterator pointing to one beyond the end of data.</td></tr>
    1073. 

  1073.   </table>
    1074. 

  1074.   </dd>
    1075. 

  1075. </dl>
    1076. 

  1076. <dl class="section pre"><dt>Precondition</dt><dd>[<code>first</code>, <code>last</code>) is a valid range. </dd>
    1077. 

  1077. <dd>
    1078. 

  1078. <code>RandomAccessIter</code> <code>value_type</code> is mutable. </dd>
    1079. 

  1079. <dd>
    1080. 

  1080. <code>RandomAccessIter</code> <code>value_type</code> is <a href="http://en.cppreference.com/w/cpp/concept/LessThanComparable">LessThanComparable</a> </dd>
    1081. 

  1081. <dd>
    1082. 

  1082. <code>RandomAccessIter</code> <code>value_type</code> supports the <code>operator&gt;&gt;</code>, which returns an integer-type right-shifted a specified number of bits. </dd></dl>
    1083. 

  1083. <dl class="section post"><dt>Postcondition</dt><dd>The elements in the range [<code>first</code>, <code>last</code>) are sorted in ascending order. </dd></dl>
    1084. 

  1084. 

  1085. </div>
    1086. 

  1086. </div>
    1087. 

  1087. <a class="anchor" id="aafdea66d9b4a7faef5604b3079b525fa"></a>
    1088. 

  1088. <div class="memitem">
    1089. 

  1089. <div class="memproto">
    1090. 

  1090. <div class="memtemplate">
    1091. 

  1091. template&lt;class RandomAccessIter &gt; </div>
    1092. 

  1092. <table class="mlabels">
    1093. 

  1093.   <tr>
    1094. 

  1094.   <td class="mlabels-left">
    1095. 

  1095.       <table class="memname">
    1096. 

  1096.         <tr>
    1097. 

  1097.           <td class="memname">boost::enable_if_c&lt; is_same&lt;typename std::iterator_traits&lt;RandomAccessIter&gt;::value_type, typename std::string&gt;::value || is_same&lt;typename std::iterator_traits&lt;RandomAccessIter&gt;::value_type, typename std::wstring&gt;::value, void &gt;::type boost::sort::spreadsort </td>
    1098. 

  1098.           <td>(</td>
    1099. 

  1099.           <td class="paramtype">RandomAccessIter&#160;</td>
    1100. 

  1100.           <td class="paramname"><em>first</em>, </td>
    1101. 

  1101.         </tr>
    1102. 

  1102.         <tr>
    1103. 

  1103.           <td class="paramkey"></td>
    1104. 

  1104.           <td></td>
    1105. 

  1105.           <td class="paramtype">RandomAccessIter&#160;</td>
    1106. 

  1106.           <td class="paramname"><em>last</em>&#160;</td>
    1107. 

  1107.         </tr>
    1108. 

  1108.         <tr>
    1109. 

  1109.           <td></td>
    1110. 

  1110.           <td>)</td>
    1111. 

  1111.           <td></td><td></td>
    1112. 

  1112.         </tr>
    1113. 

  1113.       </table>
    1114. 

  1114.   </td>
    1115. 

  1115.   <td class="mlabels-right">
    1116. 

  1116. <span class="mlabels"><span class="mlabel">inline</span></span>  </td>
    1117. 

  1117.   </tr>
    1118. 

  1118. </table>
    1119. 

  1119. </div><div class="memdoc">
    1120. 

  1120. 

  1121. <p>Generic <code>spreadsort</code> variant detecting string element type so call to <code>string_sort</code> for <code>std::strings</code> and <code>std::wstrings</code>. </p>
    1122. 

  1122. <p>If the data type provided is a string or wstring, <code>string_sort</code> is used. </p><dl class="section note"><dt>Note</dt><dd>Sorting other data types requires picking between <code>integer_sort</code>, <code>float_sort</code> and <code>string_sort</code> directly, as <code>spreadsort</code> won't accept types that don't have the appropriate <code>type_traits</code>.</dd></dl>
    1123. 

  1123. <dl class="tparams"><dt>Template Parameters</dt><dd>
    1124. 

  1124.   <table class="tparams">
    1125. 

  1125.     <tr><td class="paramname">RandomAccessIter</td><td><a href="http://www.cplusplus.com/reference/iterator/RandomAccessIterator/">Random access iterator</a> </td></tr>
    1126. 

  1126.   </table>
    1127. 

  1127.   </dd>
    1128. 

  1128. </dl>
    1129. 

  1129. <dl class="params"><dt>Parameters</dt><dd>
    1130. 

  1130.   <table class="params">
    1131. 

  1131.     <tr><td class="paramdir">[in]</td><td class="paramname">first</td><td>Iterator pointer to first element. </td></tr>
    1132. 

  1132.     <tr><td class="paramdir">[in]</td><td class="paramname">last</td><td>Iterator pointing to one beyond the end of data.</td></tr>
    1133. 

  1133.   </table>
    1134. 

  1134.   </dd>
    1135. 

  1135. </dl>
    1136. 

  1136. <dl class="section pre"><dt>Precondition</dt><dd>[<code>first</code>, <code>last</code>) is a valid range. </dd>
    1137. 

  1137. <dd>
    1138. 

  1138. <code>RandomAccessIter</code> <code>value_type</code> is mutable. </dd>
    1139. 

  1139. <dd>
    1140. 

  1140. <code>RandomAccessIter</code> <code>value_type</code> is <a href="http://en.cppreference.com/w/cpp/concept/LessThanComparable">LessThanComparable</a> </dd>
    1141. 

  1141. <dd>
    1142. 

  1142. <code>RandomAccessIter</code> <code>value_type</code> supports the <code>operator&gt;&gt;</code>, which returns an integer-type right-shifted a specified number of bits. </dd></dl>
    1143. 

  1143. <dl class="section post"><dt>Postcondition</dt><dd>The elements in the range [<code>first</code>, <code>last</code>) are sorted in ascending order. </dd></dl>
    1144. 

  1144. 

  1145. </div>
    1146. 

  1146. </div>
    1147. 

  1147. <a class="anchor" id="a950a2dbbe75f048a0b343dbf7c532dc0"></a>
    1148. 

  1148. <div class="memitem">
    1149. 

  1149. <div class="memproto">
    1150. 

  1150. <div class="memtemplate">
    1151. 

  1151. template&lt;class RandomAccessIter , class Unsigned_char_type &gt; </div>
    1152. 

  1152. <table class="mlabels">
    1153. 

  1153.   <tr>
    1154. 

  1154.   <td class="mlabels-left">
    1155. 

  1155.       <table class="memname">
    1156. 

  1156.         <tr>
    1157. 

  1157.           <td class="memname">void boost::sort::string_sort </td>
    1158. 

  1158.           <td>(</td>
    1159. 

  1159.           <td class="paramtype">RandomAccessIter&#160;</td>
    1160. 

  1160.           <td class="paramname"><em>first</em>, </td>
    1161. 

  1161.         </tr>
    1162. 

  1162.         <tr>
    1163. 

  1163.           <td class="paramkey"></td>
    1164. 

  1164.           <td></td>
    1165. 

  1165.           <td class="paramtype">RandomAccessIter&#160;</td>
    1166. 

  1166.           <td class="paramname"><em>last</em>, </td>
    1167. 

  1167.         </tr>
    1168. 

  1168.         <tr>
    1169. 

  1169.           <td class="paramkey"></td>
    1170. 

  1170.           <td></td>
    1171. 

  1171.           <td class="paramtype">Unsigned_char_type&#160;</td>
    1172. 

  1172.           <td class="paramname"><em>unused</em>&#160;</td>
    1173. 

  1173.         </tr>
    1174. 

  1174.         <tr>
    1175. 

  1175.           <td></td>
    1176. 

  1176.           <td>)</td>
    1177. 

  1177.           <td></td><td></td>
    1178. 

  1178.         </tr>
    1179. 

  1179.       </table>
    1180. 

  1180.   </td>
    1181. 

  1181.   <td class="mlabels-right">
    1182. 

  1182. <span class="mlabels"><span class="mlabel">inline</span></span>  </td>
    1183. 

  1183.   </tr>
    1184. 

  1184. </table>
    1185. 

  1185. </div><div class="memdoc">
    1186. 

  1186. 

  1187. <p>String sort algorithm using random access iterators, allowing character-type overloads.<br />
    1188. 

  1188.  (All variants fall back to <code>std::sort</code> if the data size is too small, &lt; <code>detail::min_sort_size</code>). </p>
    1189. 

  1189. <p><code>string_sort</code> is a fast templated in-place hybrid radix/comparison algorithm, which in testing tends to be roughly 50% to 2X faster than <code>std::sort</code> for large tests (&gt;=100kB).<br />
    1190. 

  1190. </p><dl class="section user"><dt></dt><dd>Worst-case performance is <em> O(N * (lg(range)/s + s)) </em>, so <code>integer_sort</code> is asymptotically faster than pure comparison-based algorithms. <code>s</code> is <code>max_splits</code>, which defaults to 11, so its worst-case with default settings for 32-bit integers is <em> O(N * ((32/11) </em> slow radix-based iterations fast comparison-based iterations).<br />
    1191. 

  1191. <br />
    1192. 

  1192. Some performance plots of runtime vs. n and log(range) are provided:<br />
    1193. 

  1193. <a href="../../doc/graph/windows_string_sort.htm">windows_string_sort</a><br />
    1194. 

  1194. <a href="../../doc/graph/osx_string_sort.htm">osx_string_sort</a></dd></dl>
    1195. 

  1195. <dl class="tparams"><dt>Template Parameters</dt><dd>
    1196. 

  1196.   <table class="tparams">
    1197. 

  1197.     <tr><td class="paramname">RandomAccessIter</td><td><a href="http://www.cplusplus.com/reference/iterator/RandomAccessIterator/">Random access iterator</a> </td></tr>
    1198. 

  1198.     <tr><td class="paramname">Unsigned_char_type</td><td>Unsigned character type used for string. </td></tr>
    1199. 

  1199.   </table>
    1200. 

  1200.   </dd>
    1201. 

  1201. </dl>
    1202. 

  1202. <dl class="params"><dt>Parameters</dt><dd>
    1203. 

  1203.   <table class="params">
    1204. 

  1204.     <tr><td class="paramdir">[in]</td><td class="paramname">first</td><td>Iterator pointer to first element. </td></tr>
    1205. 

  1205.     <tr><td class="paramdir">[in]</td><td class="paramname">last</td><td>Iterator pointing to one beyond the end of data. </td></tr>
    1206. 

  1206.     <tr><td class="paramdir">[in]</td><td class="paramname">unused</td><td>Unused ???</td></tr>
    1207. 

  1207.   </table>
    1208. 

  1208.   </dd>
    1209. 

  1209. </dl>
    1210. 

  1210. <dl class="section pre"><dt>Precondition</dt><dd>[<code>first</code>, <code>last</code>) is a valid range. </dd>
    1211. 

  1211. <dd>
    1212. 

  1212. <code>RandomAccessIter</code> <code>value_type</code> is mutable. </dd>
    1213. 

  1213. <dd>
    1214. 

  1214. <code>RandomAccessIter</code> <code>value_type</code> is <a href="http://en.cppreference.com/w/cpp/concept/LessThanComparable">LessThanComparable</a> </dd>
    1215. 

  1215. <dd>
    1216. 

  1216. <code>RandomAccessIter</code> <code>value_type</code> supports the <code>operator&gt;&gt;</code>, which returns an integer-type right-shifted a specified number of bits. </dd></dl>
    1217. 

  1217. <dl class="section post"><dt>Postcondition</dt><dd>The elements in the range [<code>first</code>, <code>last</code>) are sorted in ascending order.</dd></dl>
    1218. 

  1218. <dl class="exception"><dt>Exceptions</dt><dd>
    1219. 

  1219.   <table class="exception">
    1220. 

  1220.     <tr><td class="paramname">std::exception</td><td>Propagates exceptions if any of the element comparisons, the element swaps (or moves), the right shift, subtraction of right-shifted elements, functors, or any operations on iterators throw.</td></tr>
    1221. 

  1221.   </table>
    1222. 

  1222.   </dd>
    1223. 

  1223. </dl>
    1224. 

  1224. <dl class="section warning"><dt>Warning</dt><dd>Throwing an exception may cause data loss. This will also throw if a small vector resize throws, in which case there will be no data loss. </dd>
    1225. 

  1225. <dd>
    1226. 

  1226. Invalid arguments cause undefined behaviour. </dd></dl>
    1227. 

  1227. <dl class="section note"><dt>Note</dt><dd><code>spreadsort</code> function provides a wrapper that calls the fastest sorting algorithm available for a data type, enabling faster generic-programming.</dd></dl>
    1228. 

  1228. <dl class="section remark"><dt>Remarks</dt><dd>The lesser of <em> O(N*log(N)) </em> comparisons and <em> O(N*log(K/S + S)) </em>operations worst-case, where: </dd>
    1229. 

  1229. <dd>
    1230. 

  1230. * N is <code>last</code> - <code>first</code>, </dd>
    1231. 

  1231. <dd>
    1232. 

  1232. * K is the log of the range in bits (32 for 32-bit integers using their full range), </dd>
    1233. 

  1233. <dd>
    1234. 

  1234. * S is a constant called max_splits, defaulting to 11 (except for strings where it is the log of the character size). </dd></dl>
    1235. 

  1235. 

  1236. </div>
    1237. 

  1237. </div>
    1238. 

  1238. <a class="anchor" id="a6acd5fc94521b0a5cb47dc491b6d862f"></a>
    1239. 

  1239. <div class="memitem">
    1240. 

  1240. <div class="memproto">
    1241. 

  1241. <div class="memtemplate">
    1242. 

  1242. template&lt;class RandomAccessIter &gt; </div>
    1243. 

  1243. <table class="mlabels">
    1244. 

  1244.   <tr>
    1245. 

  1245.   <td class="mlabels-left">
    1246. 

  1246.       <table class="memname">
    1247. 

  1247.         <tr>
    1248. 

  1248.           <td class="memname">void boost::sort::string_sort </td>
    1249. 

  1249.           <td>(</td>
    1250. 

  1250.           <td class="paramtype">RandomAccessIter&#160;</td>
    1251. 

  1251.           <td class="paramname"><em>first</em>, </td>
    1252. 

  1252.         </tr>
    1253. 

  1253.         <tr>
    1254. 

  1254.           <td class="paramkey"></td>
    1255. 

  1255.           <td></td>
    1256. 

  1256.           <td class="paramtype">RandomAccessIter&#160;</td>
    1257. 

  1257.           <td class="paramname"><em>last</em>&#160;</td>
    1258. 

  1258.         </tr>
    1259. 

  1259.         <tr>
    1260. 

  1260.           <td></td>
    1261. 

  1261.           <td>)</td>
    1262. 

  1262.           <td></td><td></td>
    1263. 

  1263.         </tr>
    1264. 

  1264.       </table>
    1265. 

  1265.   </td>
    1266. 

  1266.   <td class="mlabels-right">
    1267. 

  1267. <span class="mlabels"><span class="mlabel">inline</span></span>  </td>
    1268. 

  1268.   </tr>
    1269. 

  1269. </table>
    1270. 

  1270. </div><div class="memdoc">
    1271. 

  1271. 

  1272. <p>String sort algorithm using random access iterators, wraps using default of unsigned char. (All variants fall back to <code>std::sort</code> if the data size is too small, &lt; <code>detail::min_sort_size</code>). </p>
    1273. 

  1273. <p><code>string_sort</code> is a fast templated in-place hybrid radix/comparison algorithm, which in testing tends to be roughly 50% to 2X faster than <code>std::sort</code> for large tests (&gt;=100kB).<br />
    1274. 

  1274. Worst-case performance is <em> O(N * (lg(range)/s + s)) </em>, so <code>integer_sort</code> is asymptotically faster than pure comparison-based algorithms. <code>s</code> is <code>max_splits</code>, which defaults to 11, so its worst-case with default settings for 32-bit integers is <em> O(N * ((32/11) </em> slow radix-based iterations fast comparison-based iterations).<br />
    1275. 

  1275. <br />
    1276. 

  1276. Some performance plots of runtime vs. n and log(range) are provided:<br />
    1277. 

  1277.  <a href="../../doc/graph/windows_string_sort.htm">windows_string_sort</a> <br />
    1278. 

  1278.  <a href="../../doc/graph/osx_string_sort.htm">osx_string_sort</a></p>
    1279. 

  1279. <dl class="tparams"><dt>Template Parameters</dt><dd>
    1280. 

  1280.   <table class="tparams">
    1281. 

  1281.     <tr><td class="paramname">RandomAccessIter</td><td><a href="http://www.cplusplus.com/reference/iterator/RandomAccessIterator/">Random access iterator</a> </td></tr>
    1282. 

  1282.   </table>
    1283. 

  1283.   </dd>
    1284. 

  1284. </dl>
    1285. 

  1285. <dl class="params"><dt>Parameters</dt><dd>
    1286. 

  1286.   <table class="params">
    1287. 

  1287.     <tr><td class="paramdir">[in]</td><td class="paramname">first</td><td>Iterator pointer to first element. </td></tr>
    1288. 

  1288.     <tr><td class="paramdir">[in]</td><td class="paramname">last</td><td>Iterator pointing to one beyond the end of data.</td></tr>
    1289. 

  1289.   </table>
    1290. 

  1290.   </dd>
    1291. 

  1291. </dl>
    1292. 

  1292. <dl class="section pre"><dt>Precondition</dt><dd>[<code>first</code>, <code>last</code>) is a valid range. </dd>
    1293. 

  1293. <dd>
    1294. 

  1294. <code>RandomAccessIter</code> <code>value_type</code> is mutable. </dd>
    1295. 

  1295. <dd>
    1296. 

  1296. <code>RandomAccessIter</code> <code>value_type</code> is <a href="http://en.cppreference.com/w/cpp/concept/LessThanComparable">LessThanComparable</a> </dd>
    1297. 

  1297. <dd>
    1298. 

  1298. <code>RandomAccessIter</code> <code>value_type</code> supports the <code>operator&gt;&gt;</code>, which returns an integer-type right-shifted a specified number of bits. </dd></dl>
    1299. 

  1299. <dl class="section post"><dt>Postcondition</dt><dd>The elements in the range [<code>first</code>, <code>last</code>) are sorted in ascending order.</dd></dl>
    1300. 

  1300. <dl class="exception"><dt>Exceptions</dt><dd>
    1301. 

  1301.   <table class="exception">
    1302. 

  1302.     <tr><td class="paramname">std::exception</td><td>Propagates exceptions if any of the element comparisons, the element swaps (or moves), the right shift, subtraction of right-shifted elements, functors, or any operations on iterators throw.</td></tr>
    1303. 

  1303.   </table>
    1304. 

  1304.   </dd>
    1305. 

  1305. </dl>
    1306. 

  1306. <dl class="section warning"><dt>Warning</dt><dd>Throwing an exception may cause data loss. This will also throw if a small vector resize throws, in which case there will be no data loss. </dd>
    1307. 

  1307. <dd>
    1308. 

  1308. Invalid arguments cause undefined behaviour. </dd></dl>
    1309. 

  1309. <dl class="section note"><dt>Note</dt><dd><code>spreadsort</code> function provides a wrapper that calls the fastest sorting algorithm available for a data type, enabling faster generic-programming.</dd></dl>
    1310. 

  1310. <dl class="section remark"><dt>Remarks</dt><dd>The lesser of <em> O(N*log(N)) </em> comparisons and <em> O(N*log(K/S + S)) </em>operations worst-case, where: </dd>
    1311. 

  1311. <dd>
    1312. 

  1312. * N is <code>last</code> - <code>first</code>, </dd>
    1313. 

  1313. <dd>
    1314. 

  1314. * K is the log of the range in bits (32 for 32-bit integers using their full range), </dd>
    1315. 

  1315. <dd>
    1316. 

  1316. * S is a constant called max_splits, defaulting to 11 (except for strings where it is the log of the character size). </dd></dl>
    1317. 

  1317. 

  1318. </div>
    1319. 

  1319. </div>
    1320. 

  1320. <a class="anchor" id="a5143ec4f58cfe13eca2a0d6b6f6a6680"></a>
    1321. 

  1321. <div class="memitem">
    1322. 

  1322. <div class="memproto">
    1323. 

  1323. <div class="memtemplate">
    1324. 

  1324. template&lt;class RandomAccessIter , class Get_char , class Get_length &gt; </div>
    1325. 

  1325. <table class="mlabels">
    1326. 

  1326.   <tr>
    1327. 

  1327.   <td class="mlabels-left">
    1328. 

  1328.       <table class="memname">
    1329. 

  1329.         <tr>
    1330. 

  1330.           <td class="memname">void boost::sort::string_sort </td>
    1331. 

  1331.           <td>(</td>
    1332. 

  1332.           <td class="paramtype">RandomAccessIter&#160;</td>
    1333. 

  1333.           <td class="paramname"><em>first</em>, </td>
    1334. 

  1334.         </tr>
    1335. 

  1335.         <tr>
    1336. 

  1336.           <td class="paramkey"></td>
    1337. 

  1337.           <td></td>
    1338. 

  1338.           <td class="paramtype">RandomAccessIter&#160;</td>
    1339. 

  1339.           <td class="paramname"><em>last</em>, </td>
    1340. 

  1340.         </tr>
    1341. 

  1341.         <tr>
    1342. 

  1342.           <td class="paramkey"></td>
    1343. 

  1343.           <td></td>
    1344. 

  1344.           <td class="paramtype">Get_char&#160;</td>
    1345. 

  1345.           <td class="paramname"><em>get_character</em>, </td>
    1346. 

  1346.         </tr>
    1347. 

  1347.         <tr>
    1348. 

  1348.           <td class="paramkey"></td>
    1349. 

  1349.           <td></td>
    1350. 

  1350.           <td class="paramtype">Get_length&#160;</td>
    1351. 

  1351.           <td class="paramname"><em>length</em>&#160;</td>
    1352. 

  1352.         </tr>
    1353. 

  1353.         <tr>
    1354. 

  1354.           <td></td>
    1355. 

  1355.           <td>)</td>
    1356. 

  1356.           <td></td><td></td>
    1357. 

  1357.         </tr>
    1358. 

  1358.       </table>
    1359. 

  1359.   </td>
    1360. 

  1360.   <td class="mlabels-right">
    1361. 

  1361. <span class="mlabels"><span class="mlabel">inline</span></span>  </td>
    1362. 

  1362.   </tr>
    1363. 

  1363. </table>
    1364. 

  1364. </div><div class="memdoc">
    1365. 

  1365. 

  1366. <p>String sort algorithm using random access iterators, wraps using default of <code>unsigned</code> char. </p>
    1367. 

  1367. <p>(All variants fall back to <code>std::sort</code> if the data size is too small, &lt; <code>detail::min_sort_size</code>).</p>
    1368. 

  1368. <p><code>integer_sort</code> is a fast templated in-place hybrid radix/comparison algorithm, which in testing tends to be roughly 50% to 2X faster than <code>std::sort</code> for large tests (&gt;=100kB).<br />
    1369. 

  1369. Worst-case performance is <em> O(N * (lg(range)/s + s)) </em>, so <code>integer_sort</code> is asymptotically faster than pure comparison-based algorithms. <code>s</code> is <code>max_splits</code>, which defaults to 11, so its worst-case with default settings for 32-bit integers is <em> O(N * ((32/11) </em> slow radix-based iterations fast comparison-based iterations).<br />
    1370. 

  1370. <br />
    1371. 

  1371. Some performance plots of runtime vs. n and log(range) are provided:<br />
    1372. 

  1372.  <a href="../../doc/graph/windows_integer_sort.htm">windows_integer_sort</a> <br />
    1373. 

  1373.  <a href="../../doc/graph/osx_integer_sort.htm">osx_integer_sort</a></p>
    1374. 

  1374. <dl class="tparams"><dt>Template Parameters</dt><dd>
    1375. 

  1375.   <table class="tparams">
    1376. 

  1376.     <tr><td class="paramname">RandomAccessIter</td><td><a href="http://www.cplusplus.com/reference/iterator/RandomAccessIterator/">Random access iterator</a> </td></tr>
    1377. 

  1377.     <tr><td class="paramname">Get_char</td><td>Bracket functor equivalent to <code>operator</code>[], taking a number corresponding to the character offset.. </td></tr>
    1378. 

  1378.     <tr><td class="paramname">Get_length</td><td>Functor to get the length of the string in characters. TODO Check this and below and other places!!!</td></tr>
    1379. 

  1379.   </table>
    1380. 

  1380.   </dd>
    1381. 

  1381. </dl>
    1382. 

  1382. <dl class="params"><dt>Parameters</dt><dd>
    1383. 

  1383.   <table class="params">
    1384. 

  1384.     <tr><td class="paramdir">[in]</td><td class="paramname">first</td><td>Iterator pointer to first element. </td></tr>
    1385. 

  1385.     <tr><td class="paramdir">[in]</td><td class="paramname">last</td><td>Iterator pointing to one beyond the end of data. </td></tr>
    1386. 

  1386.     <tr><td class="paramdir">[in]</td><td class="paramname">get_character</td><td>Number corresponding to the character offset from bracket functor equivalent to <code>operator</code>[]. </td></tr>
    1387. 

  1387.     <tr><td class="paramdir">[in]</td><td class="paramname">length</td><td>Functor to get the length of the string in characters.</td></tr>
    1388. 

  1388.   </table>
    1389. 

  1389.   </dd>
    1390. 

  1390. </dl>
    1391. 

  1391. <dl class="section pre"><dt>Precondition</dt><dd>[<code>first</code>, <code>last</code>) is a valid range. </dd>
    1392. 

  1392. <dd>
    1393. 

  1393. <code>RandomAccessIter</code> <code>value_type</code> is mutable. </dd>
    1394. 

  1394. <dd>
    1395. 

  1395. <code>RandomAccessIter</code> <code>value_type</code> is <a href="http://en.cppreference.com/w/cpp/concept/LessThanComparable">LessThanComparable</a> </dd>
    1396. 

  1396. <dd>
    1397. 

  1397. <code>RandomAccessIter</code> <code>value_type</code> supports the <code>operator&gt;&gt;</code>, which returns an integer-type right-shifted a specified number of bits. </dd></dl>
    1398. 

  1398. <dl class="section post"><dt>Postcondition</dt><dd>The elements in the range [<code>first</code>, <code>last</code>) are sorted in ascending order.</dd></dl>
    1399. 

  1399. <dl class="section return"><dt>Returns</dt><dd><code>void</code>.</dd></dl>
    1400. 

  1400. <dl class="exception"><dt>Exceptions</dt><dd>
    1401. 

  1401.   <table class="exception">
    1402. 

  1402.     <tr><td class="paramname">std::exception</td><td>Propagates exceptions if any of the element comparisons, the element swaps (or moves), the right shift, subtraction of right-shifted elements, functors, or any operations on iterators throw.</td></tr>
    1403. 

  1403.   </table>
    1404. 

  1404.   </dd>
    1405. 

  1405. </dl>
    1406. 

  1406. <dl class="section warning"><dt>Warning</dt><dd>Throwing an exception may cause data loss. This will also throw if a small vector resize throws, in which case there will be no data loss. </dd>
    1407. 

  1407. <dd>
    1408. 

  1408. Invalid arguments cause undefined behaviour. </dd></dl>
    1409. 

  1409. <dl class="section note"><dt>Note</dt><dd><code>spreadsort</code> function provides a wrapper that calls the fastest sorting algorithm available for a data type, enabling faster generic-programming.</dd></dl>
    1410. 

  1410. <dl class="section remark"><dt>Remarks</dt><dd>The lesser of <em> O(N*log(N)) </em> comparisons and <em> O(N*log(K/S + S)) </em>operations worst-case, where: </dd>
    1411. 

  1411. <dd>
    1412. 

  1412. * N is <code>last</code> - <code>first</code>, </dd>
    1413. 

  1413. <dd>
    1414. 

  1414. * K is the log of the range in bits (32 for 32-bit integers using their full range), </dd>
    1415. 

  1415. <dd>
    1416. 

  1416. * S is a constant called max_splits, defaulting to 11 (except for strings where it is the log of the character size). </dd></dl>
    1417. 

  1417. 

  1418. </div>
    1419. 

  1419. </div>
    1420. 

  1420. <a class="anchor" id="a82c4c0d7ba9873ecce7c674631dceae2"></a>
    1421. 

  1421. <div class="memitem">
    1422. 

  1422. <div class="memproto">
    1423. 

  1423. <div class="memtemplate">
    1424. 

  1424. template&lt;class RandomAccessIter , class Get_char , class Get_length , class Compare &gt; </div>
    1425. 

  1425. <table class="mlabels">
    1426. 

  1426.   <tr>
    1427. 

  1427.   <td class="mlabels-left">
    1428. 

  1428.       <table class="memname">
    1429. 

  1429.         <tr>
    1430. 

  1430.           <td class="memname">void boost::sort::string_sort </td>
    1431. 

  1431.           <td>(</td>
    1432. 

  1432.           <td class="paramtype">RandomAccessIter&#160;</td>
    1433. 

  1433.           <td class="paramname"><em>first</em>, </td>
    1434. 

  1434.         </tr>
    1435. 

  1435.         <tr>
    1436. 

  1436.           <td class="paramkey"></td>
    1437. 

  1437.           <td></td>
    1438. 

  1438.           <td class="paramtype">RandomAccessIter&#160;</td>
    1439. 

  1439.           <td class="paramname"><em>last</em>, </td>
    1440. 

  1440.         </tr>
    1441. 

  1441.         <tr>
    1442. 

  1442.           <td class="paramkey"></td>
    1443. 

  1443.           <td></td>
    1444. 

  1444.           <td class="paramtype">Get_char&#160;</td>
    1445. 

  1445.           <td class="paramname"><em>get_character</em>, </td>
    1446. 

  1446.         </tr>
    1447. 

  1447.         <tr>
    1448. 

  1448.           <td class="paramkey"></td>
    1449. 

  1449.           <td></td>
    1450. 

  1450.           <td class="paramtype">Get_length&#160;</td>
    1451. 

  1451.           <td class="paramname"><em>length</em>, </td>
    1452. 

  1452.         </tr>
    1453. 

  1453.         <tr>
    1454. 

  1454.           <td class="paramkey"></td>
    1455. 

  1455.           <td></td>
    1456. 

  1456.           <td class="paramtype">Compare&#160;</td>
    1457. 

  1457.           <td class="paramname"><em>comp</em>&#160;</td>
    1458. 

  1458.         </tr>
    1459. 

  1459.         <tr>
    1460. 

  1460.           <td></td>
    1461. 

  1461.           <td>)</td>
    1462. 

  1462.           <td></td><td></td>
    1463. 

  1463.         </tr>
    1464. 

  1464.       </table>
    1465. 

  1465.   </td>
    1466. 

  1466.   <td class="mlabels-right">
    1467. 

  1467. <span class="mlabels"><span class="mlabel">inline</span></span>  </td>
    1468. 

  1468.   </tr>
    1469. 

  1469. </table>
    1470. 

  1470. </div><div class="memdoc">
    1471. 

  1471. 

  1472. <p>String sort algorithm using random access iterators, wraps using default of <code>unsigned</code> char. </p>
    1473. 

  1473. <p>(All variants fall back to <code>std::sort</code> if the data size is too small, &lt; <code>detail::min_sort_size</code>).</p>
    1474. 

  1474. <p><code>integer_sort</code> is a fast templated in-place hybrid radix/comparison algorithm, which in testing tends to be roughly 50% to 2X faster than <code>std::sort</code> for large tests (&gt;=100kB).<br />
    1475. 

  1475. Worst-case performance is <em> O(N * (lg(range)/s + s)) </em>, so <code>integer_sort</code> is asymptotically faster than pure comparison-based algorithms. <code>s</code> is <code>max_splits</code>, which defaults to 11, so its worst-case with default settings for 32-bit integers is <em> O(N * ((32/11) </em> slow radix-based iterations fast comparison-based iterations).<br />
    1476. 

  1476. <br />
    1477. 

  1477. Some performance plots of runtime vs. n and log(range) are provided:<br />
    1478. 

  1478.  <a href="../../doc/graph/windows_integer_sort.htm">windows_integer_sort</a> <br />
    1479. 

  1479.  <a href="../../doc/graph/osx_integer_sort.htm">osx_integer_sort</a></p>
    1480. 

  1480. <dl class="tparams"><dt>Template Parameters</dt><dd>
    1481. 

  1481.   <table class="tparams">
    1482. 

  1482.     <tr><td class="paramname">RandomAccessIter</td><td><a href="http://www.cplusplus.com/reference/iterator/RandomAccessIterator/">Random access iterator</a> </td></tr>
    1483. 

  1483.     <tr><td class="paramname">Get_char</td><td>???. </td></tr>
    1484. 

  1484.     <tr><td class="paramname">Get_length</td><td>??? TODO </td></tr>
    1485. 

  1485.     <tr><td class="paramname">Comp</td><td>To provide <code>operator&lt;</code> for user-defined comparison.</td></tr>
    1486. 

  1486.   </table>
    1487. 

  1487.   </dd>
    1488. 

  1488. </dl>
    1489. 

  1489. <dl class="params"><dt>Parameters</dt><dd>
    1490. 

  1490.   <table class="params">
    1491. 

  1491.     <tr><td class="paramdir">[in]</td><td class="paramname">first</td><td>Iterator pointer to first element. </td></tr>
    1492. 

  1492.     <tr><td class="paramdir">[in]</td><td class="paramname">last</td><td>Iterator pointing to one beyond the end of data. </td></tr>
    1493. 

  1493.     <tr><td class="paramdir">[in]</td><td class="paramname">comp</td><td>comparison functor. </td></tr>
    1494. 

  1494.     <tr><td class="paramdir">[in]</td><td class="paramname">get_character</td><td>??? </td></tr>
    1495. 

  1495.     <tr><td class="paramdir">[in]</td><td class="paramname">length</td><td>???</td></tr>
    1496. 

  1496.   </table>
    1497. 

  1497.   </dd>
    1498. 

  1498. </dl>
    1499. 

  1499. <dl class="section pre"><dt>Precondition</dt><dd>[<code>first</code>, <code>last</code>) is a valid range. </dd>
    1500. 

  1500. <dd>
    1501. 

  1501. <code>RandomAccessIter</code> <code>value_type</code> is mutable. </dd>
    1502. 

  1502. <dd>
    1503. 

  1503. <code>RandomAccessIter</code> <code>value_type</code> is <a href="http://en.cppreference.com/w/cpp/concept/LessThanComparable">LessThanComparable</a> </dd></dl>
    1504. 

  1504. <dl class="section post"><dt>Postcondition</dt><dd>The elements in the range [<code>first</code>, <code>last</code>) are sorted in ascending order.</dd></dl>
    1505. 

  1505. <dl class="section return"><dt>Returns</dt><dd><code>void</code>.</dd></dl>
    1506. 

  1506. <dl class="exception"><dt>Exceptions</dt><dd>
    1507. 

  1507.   <table class="exception">
    1508. 

  1508.     <tr><td class="paramname">std::exception</td><td>Propagates exceptions if any of the element comparisons, the element swaps (or moves), the right shift, subtraction of right-shifted elements, functors, or any operations on iterators throw.</td></tr>
    1509. 

  1509.   </table>
    1510. 

  1510.   </dd>
    1511. 

  1511. </dl>
    1512. 

  1512. <dl class="section warning"><dt>Warning</dt><dd>Throwing an exception may cause data loss. This will also throw if a small vector resize throws, in which case there will be no data loss. </dd>
    1513. 

  1513. <dd>
    1514. 

  1514. Invalid arguments cause undefined behaviour. </dd></dl>
    1515. 

  1515. <dl class="section note"><dt>Note</dt><dd><code>spreadsort</code> function provides a wrapper that calls the fastest sorting algorithm available for a data type, enabling faster generic-programming.</dd></dl>
    1516. 

  1516. <dl class="section remark"><dt>Remarks</dt><dd>The lesser of <em> O(N*log(N)) </em> comparisons and <em> O(N*log(K/S + S)) </em>operations worst-case, where: </dd>
    1517. 

  1517. <dd>
    1518. 

  1518. * N is <code>last</code> - <code>first</code>, </dd>
    1519. 

  1519. <dd>
    1520. 

  1520. * K is the log of the range in bits (32 for 32-bit integers using their full range), </dd>
    1521. 

  1521. <dd>
    1522. 

  1522. * S is a constant called max_splits, defaulting to 11 (except for strings where it is the log of the character size). </dd></dl>
    1523. 

  1523. 

  1524. </div>
    1525. 

  1525. </div>
    1526. 

  1526. </div><!-- contents -->
    1527. 

  1527. <!-- start footer part -->
    1528. 

  1528. <hr class="footer"/><address class="footer"><small>
    1529. 

  1529. Generated on Fri Jan 9 2015 14:20:24 for Boost.Sort by &#160;<a href="http://www.doxygen.org/index.html">
    1530. 

  1530. <img class="footer" src="doxygen.png" alt="doxygen"/>
    1531. 

  1531. </a> 1.8.9.1
    1532. 

  1532. </small></address>
    1533. 

  1533. </body>
    1534. 

  1534. </html>
    1535.