#include <radix_heap.hpp>
|
size_t | operator() (const Int x, const Int insertion_limit) const |
| Return bucket index key x belongs to given the current insertion limit.
|
Int | lower_bound (const size_t idx) const |
| Return smallest key possible in bucket idx assuming insertion_limit==0.
|
Int | upper_bound (const size_t idx) const |
| Return largest key possible in bucket idx assuming insertion_limit==0.
|
|
static constexpr size_t | num_buckets |
| Number of buckets required given Radix and the current data type Int.
|
template<unsigned Radix, typename Int>
class tlx::radix_heap_detail::BucketComputation< Radix, Int >
Definition at line 276 of file radix_heap.hpp.
◆ lower_bound()
template<unsigned Radix, typename Int>
Int lower_bound |
( |
const size_t | idx | ) |
const |
|
inline |
Return smallest key possible in bucket idx assuming insertion_limit==0.
Definition at line 302 of file radix_heap.hpp.
◆ num_buckets_()
template<unsigned Radix, typename Int>
constexpr size_t num_buckets_ |
( |
size_t | bits | ) |
|
|
inlinestaticconstexprprivate |
◆ operator()()
template<unsigned Radix, typename Int>
size_t operator() |
( |
const Int | x, |
|
|
const Int | insertion_limit ) const |
|
inline |
Return bucket index key x belongs to given the current insertion limit.
Definition at line 283 of file radix_heap.hpp.
◆ upper_bound()
template<unsigned Radix, typename Int>
Int upper_bound |
( |
const size_t | idx | ) |
const |
|
inline |
Return largest key possible in bucket idx assuming insertion_limit==0.
Definition at line 315 of file radix_heap.hpp.
◆ num_buckets
template<unsigned Radix, typename Int>
Number of buckets required given Radix and the current data type Int.
Definition at line 333 of file radix_heap.hpp.
◆ radix_bits
template<unsigned Radix, typename Int>
The documentation for this class was generated from the following file: