Function integer_sort_

pbbslib/integer_sort.h:190–204

// num_bucket must be less than or equal to 2^bits
template <typename SeqIn, typename IterOut, typename Get_Key>
sequence<size_t> integer_sort_(SeqIn const &In, range<IterOut> Out,
                               range<IterOut> Tmp, Get_Key const &g,
                               size_t bits, size_t num_buckets, bool inplace) {
  if (slice_eq(In.slice(), Out)) {
    std::cout << "in integer_sort : input and output must be different locations" << std::endl;
    exit(-1);
  }
  if (bits == 0) {
    auto get_key = [&](size_t i) { return g(In[i]); };
    auto keys = delayed_seq<size_t>(In.size(), get_key);
    num_buckets = reduce(keys, maxm<size_t>()) + 1;
    bits = log2_up(num_buckets);
  }
  return integer_sort_r(In, Out, Tmp, g, bits, num_buckets, inplace);
}

template <typename T, typename Get_Key>
void integer_sort_inplace(range<T *> In, Get_Key const &g,