Imported Upstream version 1.72.0

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

diff --git a/libs/sort/doc/html/sort/single_thread/spreadsort/sort_hpp/integer_sort.html b/libs/sort/doc/html/sort/single_thread/spreadsort/sort_hpp/integer_sort.html
index 9806ac6..7df330b 100644 (file)
--- a/libs/sort/doc/html/sort/single_thread/spreadsort/sort_hpp/integer_sort.html
+++ b/libs/sort/doc/html/sort/single_thread/spreadsort/sort_hpp/integer_sort.html
@@ -28,11 +28,11 @@
           Sort</a>
 </h5></div></div></div>
 <p>
-            <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>
+            <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>
             is a fast templated in-place hybrid radix/comparison algorithm, which
             in testing tends to be roughly 50% to 2X faster than <a href="http://en.cppreference.com/w/cpp/algorithm/sort" target="_top">std::sort</a>
             for large tests (&gt;=100kB). Worst-case performance is <span class="emphasis"><em>&#119926;(N
-            * (log2(range)/s + s))</em></span>, so <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>
+            * (log2(range)/s + s))</em></span>, so <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>
             is asymptotically faster than pure comparison-based algorithms. <span class="emphasis"><em>s</em></span>
             is <span class="emphasis"><em>max_splits</em></span>, which defaults to 11, so its worst-case
             with default settings for 32-bit integers is <span class="emphasis"><em>&#119926;(N * ((32/11)</em></span>