Imported Upstream version 1.72.0

[platform/upstream/boost.git] / libs / sort / doc / html / sort / single_thread / spreadsort / bibliog.html

diff --git a/libs/sort/doc/html/sort/single_thread/spreadsort/bibliog.html b/libs/sort/doc/html/sort/single_thread/spreadsort/bibliog.html
index 5aa6c0b..0f16837 100644 (file)
--- a/libs/sort/doc/html/sort/single_thread/spreadsort/bibliog.html
+++ b/libs/sort/doc/html/sort/single_thread/spreadsort/bibliog.html
@@ -68,7 +68,7 @@
           Flag Sort</a>
         </h5>
 <p>
-          A high-speed hybrid string sorting algorithm that <code class="literal"><code class="computeroutput"><a class="link" href="../../../boost/sort/spreadsort/string_s_idm46709764928704.html" title="Function template string_sort">string_sort</a></code></code>
+          A high-speed hybrid string sorting algorithm that <code class="literal"><code class="computeroutput"><a class="link" href="../../../boost/sort/spreadsort/string_s_idm46048202990736.html" title="Function template string_sort">string_sort</a></code></code>
           is partially based upon. See <a href="http://en.wikipedia.org/wiki/American_flag_sort" target="_top">American
           flag sort</a> and Peter M. McIlroy, Keith Bostic, M. Douglas McIlroy.
           Engineering Radix Sort, Computing Systems 1993.
@@ -80,7 +80,7 @@
         </h5>
 <p>
           ARL (Adaptive Left Radix) is a hybrid cache-friendly integer sorting algorithm
-          with comparable speed on random data to <code class="literal"><code class="computeroutput"><a class="link" href="../../../boost/sort/spreadsort/integer__idm46709765154208.html" title="Function template integer_sort">integer_sort</a></code></code>,
+          with comparable speed on random data to <code class="literal"><code class="computeroutput"><a class="link" href="../../../boost/sort/spreadsort/integer__idm46048203222928.html" title="Function template integer_sort">integer_sort</a></code></code>,
           but does not have the optimizations for worst-case performance, causing
           it to perform poorly on certain types of unevenly distributed data.
         </p>
@@ -95,8 +95,8 @@
           Spreadsort</a>
         </h5>
 <p>
-          The algorithm that <code class="literal"><code class="computeroutput"><a class="link" href="../../../boost/sort/spreadsort/integer__idm46709765154208.html" title="Function template integer_sort">integer_sort</a></code></code>
-          was originally based on. <code class="literal"><code class="computeroutput"><a class="link" href="../../../boost/sort/spreadsort/integer__idm46709765154208.html" title="Function template integer_sort">integer_sort</a></code></code>
+          The algorithm that <code class="literal"><code class="computeroutput"><a class="link" href="../../../boost/sort/spreadsort/integer__idm46048203222928.html" title="Function template integer_sort">integer_sort</a></code></code>
+          was originally based on. <code class="literal"><code class="computeroutput"><a class="link" href="../../../boost/sort/spreadsort/integer__idm46048203222928.html" title="Function template integer_sort">integer_sort</a></code></code>
           uses a smaller number of key bits at a time for better cache efficiency
           than the method described in the paper. The importance of cache efficiency
           grew as CPU clock speeds increased while main memory latency stagnated.