import new upstream nautilus stable release 14.2.8

[ceph.git] / ceph / src / boost / boost / sort / spreadsort / float_sort.hpp

diff --git a/ceph/src/boost/boost/sort/spreadsort/float_sort.hpp b/ceph/src/boost/boost/sort/spreadsort/float_sort.hpp
index d5310d19ce3113b99d9becc8b83c2b6417a1a76f..c48a5da949d48acf36d2f62d9daa18174d309d66 100644 (file)
--- a/ceph/src/boost/boost/sort/spreadsort/float_sort.hpp
+++ b/ceph/src/boost/boost/sort/spreadsort/float_sort.hpp
@@ -87,7 +87,7 @@ Some performance plots of runtime vs. n and log(range) are provided:\n
   inline void float_sort(RandomAccessIter first, RandomAccessIter last)
   {
     if (last - first < detail::min_sort_size)
-      std::sort(first, last);
+      boost::sort::pdqsort(first, last);
     else
       detail::float_sort(first, last);
   }
@@ -117,7 +117,7 @@ Some performance plots of runtime vs. n and log(range) are provided:\n
                          Right_shift rshift)
   {
     if (last - first < detail::min_sort_size)
-      std::sort(first, last);
+      boost::sort::pdqsort(first, last);
     else
       detail::float_sort(first, last, rshift(*first, 0), rshift);
   }
@@ -150,7 +150,7 @@ Some performance plots of runtime vs. n and log(range) are provided:\n
                          Right_shift rshift, Compare comp)
   {
     if (last - first < detail::min_sort_size)
-      std::sort(first, last, comp);
+      boost::sort::pdqsort(first, last, comp);
     else
       detail::float_sort(first, last, rshift(*first, 0), rshift, comp);
   }