16 #ifndef BOOST_SORT_SPREADSORT_DETAIL_SPREAD_SORT_COMMON_HPP 
   17 #define BOOST_SORT_SPREADSORT_DETAIL_SPREAD_SORT_COMMON_HPP 
   23 #include <boost/static_assert.hpp> 
   24 #include <boost/serialization/static_warning.hpp> 
   26 #include <boost/cstdint.hpp> 
   39       while ((input >> result) && (result < (8*
sizeof(T)))) ++result;
 
   48     template<
unsigned log_mean_bin_size,
 
   49       unsigned log_min_split_count, 
unsigned log_finishing_count>
 
   53       const size_t typed_one = 1;
 
   54       const unsigned min_size = log_mean_bin_size + log_min_split_count;
 
   56       BOOST_STATIC_ASSERT(log_min_split_count <= 
max_splits &&
 
   57                           log_min_split_count > 0);
 
   62       BOOST_STATIC_ASSERT(log_mean_bin_size >= 0);
 
   63       BOOST_STATIC_ASSERT(log_finishing_count >= 0);
 
   66       if (log_finishing_count < min_size) {
 
   67         if (log_range <= min_size && log_range <= 
max_splits) {
 
   69           if (log_range <= log_finishing_count)
 
   70             return typed_one << log_finishing_count;
 
   71           return typed_one << log_range;
 
   74       const unsigned base_iterations = 
max_splits - log_min_split_count;
 
   76       const unsigned base_range =
 
   77           ((base_iterations + 1) * (
max_splits + log_min_split_count))/2
 
   81       if (log_range < base_range) {
 
   82         unsigned result = log_min_split_count;
 
   83         for (
unsigned offset = min_size; offset < log_range;
 
   86         if ((result + log_mean_bin_size) >= (8 * 
sizeof(size_t)))
 
   87           return typed_one << ((8 * 
sizeof(
size_t)) - 1);
 
   88         return typed_one << (result + log_mean_bin_size);
 
   91       unsigned remainder = log_range - base_range;
 
   94         + base_iterations + min_size);
 
   96       if (bit_length >= (8 * 
sizeof(
size_t)))
 
   97         return typed_one << ((8 * 
sizeof(size_t)) - 1);
 
   99       return typed_one << bit_length;
 
  104     template <
class RandomAccessIter>
 
  105     inline RandomAccessIter *
 
  106     size_bins(
size_t *bin_sizes, std::vector<RandomAccessIter>
 
  107   &bin_cache, 
unsigned cache_offset, 
unsigned &cache_end, 
unsigned bin_count)
 
  110       for (
size_t u = 0; u < bin_count; u++)
 
  113       cache_end = cache_offset + bin_count;
 
  114       if (cache_end > bin_cache.size())
 
  115         bin_cache.resize(cache_end);
 
  116       return &(bin_cache[cache_offset]);
 
Definition: constants.hpp:11
Definition: constants.hpp:22
size_t get_min_count(unsigned log_range)
Definition: spreadsort_common.hpp:51
Definition: constants.hpp:19
unsigned rough_log_2_size(const T &input)
Definition: spreadsort_common.hpp:34
RandomAccessIter * size_bins(size_t *bin_sizes, std::vector< RandomAccessIter > &bin_cache, unsigned cache_offset, unsigned &cache_end, unsigned bin_count)
Definition: spreadsort_common.hpp:106