IOSS 2.0
|
#include <hopscotch_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 |
Private Attributes | |
std::size_t | m_mod |
Static Private Attributes | |
static constexpr double | REHASH_SIZE_MULTIPLICATION_FACTOR |
static const std::size_t | MAX_BUCKET_COUNT |
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.
|
inlineexplicit |
|
inlinenoexcept |
|
inlinenoexcept |
|
inline |
|
inline |
|
private |
|
staticprivate |
|
staticconstexprprivate |