summaryrefslogtreecommitdiff
path: root/libs/libraries.htm
diff options
context:
space:
mode:
authorDaniel James <daniel@calamity.org.uk>2015-02-01 09:08:11 +0000
committerDaniel James <daniel@calamity.org.uk>2015-02-01 09:08:11 +0000
commitc14a48b183d1efc8f3af1cee8a62267ef9a4ed80 (patch)
treec7ced434416f18ede1670a51189aada5cb1b02af /libs/libraries.htm
parenta5454023226ceca4903f76c6612284074f46e7c3 (diff)
downloadboost-c14a48b183d1efc8f3af1cee8a62267ef9a4ed80.tar.gz
Revert "Add sort to libraries.html"
This reverts commit 1381e6afaec8f5ca69ba7a5096dec880a7bc4929. Because I accidentally merge the pull request against master instead of develop.
Diffstat (limited to 'libs/libraries.htm')
-rw-r--r--libs/libraries.htm4
1 files changed, 0 insertions, 4 deletions
diff --git a/libs/libraries.htm b/libs/libraries.htm
index 34e00ab458..fedf967efa 100644
--- a/libs/libraries.htm
+++ b/libs/libraries.htm
@@ -308,8 +308,6 @@ 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>
@@ -403,8 +401,6 @@ 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>