Query: std::__detail::_prime_rehash_policy
OS: centos
Section: 3
Format: Original Unix Latex Style Formatted with HTML and a Horizontal Scroll Bar
std::__detail::_Prime_rehash_policy(3) Library Functions Manual std::__detail::_Prime_rehash_policy(3)NAMEstd::__detail::_Prime_rehash_policy -SYNOPSISPublic Types enum { _S_n_primes } typedef std::size_t _State Public Member Functions _Prime_rehash_policy (float __z=1.0) std::size_t _M_bkt_for_elements (std::size_t __n) const std::pair< bool, std::size_t > _M_need_rehash (std::size_t __n_bkt, std::size_t __n_elt, std::size_t __n_ins) const std::size_t _M_next_bkt (std::size_t __n) const void _M_reset (_State __state) _State _M_state () const float max_load_factor () const noexcept Public Attributes float _M_max_load_factor std::size_t _M_next_resize Static Public Attributes static const std::size_t _S_growth_factor Detailed Description Default value for rehash policy. Bucket size is (usually) the smallest prime that keeps the load factor small enough. Definition at line 357 of file hashtable_policy.h. Author Generated automatically by Doxygen for libstdc++ from the source code. libstdc++ Tue Jun 10 2014 std::__detail::_Prime_rehash_policy(3)