Imported Upstream version 1.72.0

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

diff --git a/libs/sort/doc/html/sort/single_thread/spreadsort/sort_hpp/float_sort.html b/libs/sort/doc/html/sort/single_thread/spreadsort/sort_hpp/float_sort.html
index fd19db2..5c73954 100644 (file)
--- a/libs/sort/doc/html/sort/single_thread/spreadsort/sort_hpp/float_sort.html
+++ b/libs/sort/doc/html/sort/single_thread/spreadsort/sort_hpp/float_sort.html
@@ -28,9 +28,9 @@
           Sort</a>
 </h5></div></div></div>
 <p>
-            <code class="literal"><code class="computeroutput"><a class="link" href="../../../../boost/sort/spreadsort/float_so_idm46709766348432.html" title="Function template float_sort">float_sort</a></code></code>
+            <code class="literal"><code class="computeroutput"><a class="link" href="../../../../boost/sort/spreadsort/float_so_idm46048204416688.html" title="Function template float_sort">float_sort</a></code></code>
             is a fast templated in-place hybrid radix/comparison algorithm much like
-            <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>,
             but sorts IEEE floating-point numbers (positive, zero, NaN, and negative)
             into ascending order by casting them to integers. This works because
             positive IEEE floating-point numbers sort like integers with the same
@@ -55,7 +55,7 @@
             a custom rightshift functor for float_sort, when one is needed. Only
             IEEE floating-point numbers of the same size as the integer type being
             cast to should be used in this specialized method call. 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/float_so_idm46709766348432.html" title="Function template float_sort">float_sort</a></code></code>
+            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/float_so_idm46048204416688.html" title="Function template float_sort">float_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>