<a name="sort.sort_hpp.string_sort"></a><a class="link" href="string_sort.html" title="String Sort">String Sort</a>
</h3></div></div></div>
<p>
- <code class="literal"><code class="computeroutput"><a class="link" href="../../boost/sort/spreadsort/string_sort_idp23596528.html" title="Function template string_sort">string_sort</a></code></code>
+ <code class="literal"><code class="computeroutput"><a class="link" href="../../boost/sort/spreadsort/string_sort_idp26036384.html" title="Function template string_sort">string_sort</a></code></code>
is a hybrid radix-based/comparison-based algorithm that sorts strings of
characters (or arrays of binary data) in ascending order.
</p>
be called instead if the character type is of size > 2.
</p>
<p>
- <code class="literal"><code class="computeroutput"><a class="link" href="../../boost/sort/spreadsort/string_sort_idp23596528.html" title="Function template string_sort">string_sort</a></code></code>
+ <code class="literal"><code class="computeroutput"><a class="link" href="../../boost/sort/spreadsort/string_sort_idp26036384.html" title="Function template string_sort">string_sort</a></code></code>
has a special optimization for identical substrings. This adds some overhead
on random data, but identical substrings are common in real strings.
</p>
<p>
reverse_string_sort sorts strings in reverse (decending) order, but is otherwise
- identical. <code class="literal"><code class="computeroutput"><a class="link" href="../../boost/sort/spreadsort/string_sort_idp23596528.html" title="Function template string_sort">string_sort</a></code></code>
+ identical. <code class="literal"><code class="computeroutput"><a class="link" href="../../boost/sort/spreadsort/string_sort_idp26036384.html" title="Function template string_sort">string_sort</a></code></code>
is sufficiently flexible that it should sort any data type that <a href="http://en.cppreference.com/w/cpp/algorithm/sort" target="_top">std::sort</a>
can, assuming the user provides appropriate functors that index into a key.
</p>