tlx
BucketComputation< Radix, Int > Class Template Reference

#include <radix_heap.hpp>

Public Member Functions

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 Public Attributes

static constexpr size_t num_buckets
 Number of buckets required given Radix and the current data type Int. More...
 

Static Private Member Functions

static constexpr size_t num_buckets_ (size_t bits)
 

Static Private Attributes

static constexpr unsigned radix_bits
 

Detailed Description

template<unsigned Radix, typename Int>
class tlx::radix_heap_detail::BucketComputation< Radix, Int >

Definition at line 274 of file radix_heap.hpp.

Member Function Documentation

Int lower_bound ( const size_t  idx) const
inline

Return smallest key possible in bucket idx assuming insertion_limit==0.

Definition at line 300 of file radix_heap.hpp.

static constexpr size_t num_buckets_ ( size_t  bits)
inlinestaticprivate

Definition at line 323 of file radix_heap.hpp.

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 281 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 313 of file radix_heap.hpp.

Member Data Documentation

constexpr size_t num_buckets
static

Number of buckets required given Radix and the current data type Int.

Definition at line 331 of file radix_heap.hpp.

constexpr unsigned radix_bits
staticprivate

Definition at line 277 of file radix_heap.hpp.


The documentation for this class was generated from the following file: