MCPcopy Create free account
hub / github.com/ParAlg/gbbs / integer_sort

Function integer_sort

pbbslib/integer_sort.h:214–221  ·  view source on GitHub ↗

Source from the content-addressed store, hash-verified

212
213template <typename Seq, typename Get_Key>
214sequence<typename Seq::value_type> integer_sort(Seq const &In, Get_Key const &g,
215 size_t num_bits = 0) {
216 using T = typename Seq::value_type;
217 sequence<T> Out = sequence<T>::no_init(In.size());
218 sequence<T> Tmp = sequence<T>::no_init(In.size());
219 integer_sort_(In, Out.slice(), Tmp.slice(), g, num_bits, 0, false);
220 return Out;
221}
222
223// Given a sorted input sequence with integer keys in the range
224// `[0,..,num_buckets)`, returns a sequence of length `num_buckets` in which the

Callers 4

integer_sort_with_countsFunction · 0.85
t_integer_sort_pairFunction · 0.85
t_integer_sortFunction · 0.85

Calls 3

integer_sort_Function · 0.85
sizeMethod · 0.45
sliceMethod · 0.45

Tested by

no test coverage detected