summaryrefslogtreecommitdiff
path: root/libs/libraries.htm
diff options
context:
space:
mode:
authorspreadsort <spreadsort@gmail.com>2015-02-12 22:24:34 -0500
committerspreadsort <spreadsort@gmail.com>2015-02-12 22:24:34 -0500
commit949d3da8ca333c13dafab2b7aab520ab1dcc069c (patch)
tree142ae7b47f31934b69ae7b2a9d94dce6abba9171 /libs/libraries.htm
parentc0aa03e297bc19d8f7c15ddc7e55f5714d9c5ef0 (diff)
downloadboost-949d3da8ca333c13dafab2b7aab520ab1dcc069c.tar.gz
Add new sort library to libraries.html
The same change has been merged into develop.
Diffstat (limited to 'libs/libraries.htm')
-rw-r--r--libs/libraries.htm4
1 files changed, 4 insertions, 0 deletions
diff --git a/libs/libraries.htm b/libs/libraries.htm
index fedf967efa..34e00ab458 100644
--- a/libs/libraries.htm
+++ b/libs/libraries.htm
@@ -308,6 +308,8 @@ how to download, build, and install the libraries.</p>
<li><a href="smart_ptr/index.html">smart_ptr</a> - Six smart
pointer class templates, from Greg Colvin, Beman Dawes,
Peter Dimov, Darin Adler, and Glen Fernandes.</li>
+ <li><a href="sort/index.html">sort</a> - library that includes spreadsort, a general-case
+ hybrid radix sort that is faster than O(n*log(n))</li>
<li><a href="statechart/doc/index.html">statechart</a> - Arbitrarily
complex finite state machines can be implemented in easily readable and
maintainable C++ code, from Andreas Huber.</li>
@@ -401,6 +403,8 @@ how to download, build, and install the libraries.</p>
<li><a href="range/index.html">range</a> - A new infrastructure
for generic algorithms that builds on top
of the new iterator concepts, from Thorsten Ottosen.</li>
+ <li><a href="sort/index.html">sort</a> - library that includes spreadsort, a general-case
+ hybrid radix sort that is faster than O(n*log(n))</li>
<li><a href="algorithm/string/index.html">string_algo</a> -
String algorithms library, from Pavol Droba</li>
<li><a href="utility/utility.htm">utility</a> - Class <b>next(),</b>&nbsp; <b>prior()</b>