#include <robin_growth_policy.h>
| Public Member Functions | |
| std::size_t | bucket_for_hash (std::size_t hash) const noexcept | 
| void | clear () noexcept | 
| std::size_t | max_bucket_count () const | 
| mod_growth_policy (std::size_t &min_bucket_count_in_out) | |
| std::size_t | next_bucket_count () const | 
| Private Attributes | |
| std::size_t | m_mod | 
| Static Private Attributes | |
| static const std::size_t | MAX_BUCKET_COUNT | 
| static constexpr double | REHASH_SIZE_MULTIPLICATION_FACTOR | 
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 190 of file robin_growth_policy.h.
| 
 | inlineexplicit | 
Definition at line 192 of file robin_growth_policy.h.
| 
 | inlinenoexcept | 
Definition at line 205 of file robin_growth_policy.h.
| 
 | inlinenoexcept | 
Definition at line 231 of file robin_growth_policy.h.
| 
 | inline | 
Definition at line 229 of file robin_growth_policy.h.
| 
 | inline | 
Definition at line 209 of file robin_growth_policy.h.
| 
 | private | 
Definition at line 241 of file robin_growth_policy.h.
| 
 | staticprivate | 
Definition at line 236 of file robin_growth_policy.h.
| 
 | staticconstexprprivate | 
Definition at line 234 of file robin_growth_policy.h.