#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. More...
|
| |
| Int | lower_bound (const size_t idx) const |
| | Return smallest key possible in bucket idx assuming insertion_limit==0. More...
|
| |
| Int | upper_bound (const size_t idx) const |
| | Return largest key possible in bucket idx assuming insertion_limit==0. More...
|
| |
|
| static constexpr size_t | num_buckets |
| | Number of buckets required given Radix and the current data type Int. More...
|
| |
template<unsigned Radix, typename Int>
class tlx::radix_heap_detail::BucketComputation< Radix, Int >
Definition at line 275 of file radix_heap.hpp.
| Int lower_bound |
( |
const size_t |
idx | ) |
const |
|
inline |
Return smallest key possible in bucket idx assuming insertion_limit==0.
Definition at line 301 of file radix_heap.hpp.
| static constexpr size_t num_buckets_ |
( |
size_t |
bits | ) |
|
|
inlinestaticprivate |
| 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 282 of file radix_heap.hpp.
| Int upper_bound |
( |
const size_t |
idx | ) |
const |
|
inline |
Return largest key possible in bucket idx assuming insertion_limit==0.
Definition at line 314 of file radix_heap.hpp.
| constexpr size_t num_buckets |
|
static |
Number of buckets required given Radix and the current data type Int.
Definition at line 332 of file radix_heap.hpp.
| constexpr unsigned radix_bits |
|
staticprivate |
The documentation for this class was generated from the following file:
1.8.11 
