HDK
|
#include <robin_growth_policy.h>
Public Member Functions | |
mod_growth_policy (std::size_t &min_bucket_count_in_out) | |
std::size_t | bucket_for_hash (std::size_t hash) const noexcept |
std::size_t | next_bucket_count () const |
std::size_t | max_bucket_count () const |
void | clear () noexcept |
Grow the hash table by GrowthFactor::num / GrowthFactor::den and use a modulo to map a hash to a bucket. Slower but it can be useful if you want a slower growth.
Definition at line 185 of file robin_growth_policy.h.
|
inlineexplicit |
Definition at line 187 of file robin_growth_policy.h.
|
inlinenoexcept |
Definition at line 200 of file robin_growth_policy.h.
|
inlinenoexcept |
Definition at line 226 of file robin_growth_policy.h.
|
inline |
Definition at line 224 of file robin_growth_policy.h.
|
inline |
Definition at line 204 of file robin_growth_policy.h.