tsl::ah::mod_growth_policy< GrowthFactor > Class Template Reference

#include <array_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

Detailed Description

template<class GrowthFactor = std::ratio<3, 2>>
class tsl::ah::mod_growth_policy< GrowthFactor >

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.

Constructor & Destructor Documentation

mod_growth_policy()

template<class GrowthFactor = std::ratio<3, 2>>

tsl::ah::mod_growth_policy< GrowthFactor >::mod_growth_policy ( std::size_t &  min_bucket_count_in_out )

inlineexplicit

Member Function Documentation

bucket_for_hash()

template<class GrowthFactor = std::ratio<3, 2>>

std::size_t tsl::ah::mod_growth_policy< GrowthFactor >::bucket_for_hash ( std::size_t  hash ) const

inlinenoexcept

clear()

template<class GrowthFactor = std::ratio<3, 2>>

void tsl::ah::mod_growth_policy< GrowthFactor >::clear ( )

inlinenoexcept

max_bucket_count()

template<class GrowthFactor = std::ratio<3, 2>>

std::size_t tsl::ah::mod_growth_policy< GrowthFactor >::max_bucket_count ( ) const

inline

next_bucket_count()

template<class GrowthFactor = std::ratio<3, 2>>

std::size_t tsl::ah::mod_growth_policy< GrowthFactor >::next_bucket_count ( ) const

inline

---

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

• include/tsl/array_growth_policy.h