spreadsort.hpp | 113 size_bins(std::vector<size_t> &bin_sizes, std::vector<RandomAccessIter> &bin_cache, unsigned cache_offset, unsigned &cache_end, unsigned bin_count)
116 if(bin_count > bin_sizes.size())
117 bin_sizes.resize(bin_count);
119 bin_sizes[u] = 0;
131 , std::vector<size_t> &bin_sizes)
146 RandomAccessIter * bins = size_bins(bin_sizes, bin_cache, cache_offset, cache_end, bin_count);
150 bin_sizes[(*(current++) >> log_divisor) - div_min]++;
154 bins[u + 1] = bins[u] + bin_sizes[u];
161 nextbinstart += bin_sizes[u];
203 spread_sort_rec<RandomAccessIter, div_type, data_type>(lastPos, bin_cache[u], bin_cache, cache_end, bin_sizes);
345 std::vector<size_t> bin_sizes; local 354 std::vector<size_t> bin_sizes; local 363 std::vector<size_t> bin_sizes; local 941 std::vector<size_t> bin_sizes; local 950 std::vector<size_t> bin_sizes; local 959 std::vector<size_t> bin_sizes; local 1554 std::vector<size_t> bin_sizes; local 1564 std::vector<size_t> bin_sizes; local 1574 std::vector<size_t> bin_sizes; local 1584 std::vector<size_t> bin_sizes; local 1594 std::vector<size_t> bin_sizes; local [all...] |