18 #ifndef BOOST_INTEGER_SORT_HPP 
   19 #define BOOST_INTEGER_SORT_HPP 
   24 #include <boost/static_assert.hpp> 
   25 #include <boost/sort/spreadsort/detail/constants.hpp> 
   26 #include <boost/sort/spreadsort/detail/integer_sort.hpp> 
   74   template <
class RandomAccessIter>
 
   75   inline void integer_sort(RandomAccessIter first, RandomAccessIter last)
 
   78     if (last - first < detail::min_sort_size)
 
   79       std::sort(first, last);
 
  131   template <
class RandomAccessIter, 
class Right_shift, 
class Compare>
 
  132   inline void integer_sort(RandomAccessIter first, RandomAccessIter last,
 
  133                            Right_shift shift, Compare comp) {
 
  134     if (last - first < detail::min_sort_size)
 
  135       std::sort(first, last, comp);
 
  185   template <
class RandomAccessIter, 
class Right_shift>
 
  186   inline void integer_sort(RandomAccessIter first, RandomAccessIter last,
 
  188     if (last - first < detail::min_sort_size)
 
  189       std::sort(first, last);
 
void integer_sort(RandomAccessIter first, RandomAccessIter last)
Integer sort algorithm using random access iterators. (All variants fall back to std::sort if the dat...
Definition: integer_sort.hpp:75
Definition: float_sort.hpp:27
void integer_sort(RandomAccessIter first, RandomAccessIter last, Right_shift shift)
Integer sort algorithm using random access iterators with just right-shift functor. (All variants fall back to std::sort if the data size is too small, < detail::min_sort_size). 
Definition: integer_sort.hpp:186