Manpages - std___detail__Prime_rehash_policy.3
Table of Contents
- NAME
- SYNOPSIS
- Detailed Description
- Member Typedef Documentation
- Constructor & Destructor Documentation
- Member Function Documentation
- std::size_t std::__detail::_Prime_rehash_policy::_M_bkt_for_elements
- void std::__detail::_Prime_rehash_policy::_M_reset ()= [inline]=,
- void std::__detail::_Prime_rehash_policy::_M_reset (_State
- _State std::__detail::_Prime_rehash_policy::_M_state ()
- float std::__detail::_Prime_rehash_policy::max_load_factor ()
- Member Data Documentation
- Author
NAME
std::__detail::_Prime_rehash_policy - Default value for rehash policy. Bucket size is (usually) the smallest prime that keeps the load factor small enough.
SYNOPSIS
#include <hashtable_policy.h>
Public Types
using __has_load_factor = true_type
typedef std::size_t _State
Public Member Functions
_Prime_rehash_policy (float __z=1.0) noexcept
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 () noexcept
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 441 of file hashtable_policy.h.
Member Typedef Documentation
using std::__detail::_Prime_rehash_policy::__has_load_factor =
true_type Definition at line 443 of file hashtable_policy.h.
typedef std::size_t std::__detail::_Prime_rehash_policy::_State
Definition at line 469 of file hashtable_policy.h.
Constructor & Destructor Documentation
std::__detail::_Prime_rehash_policy::_Prime_rehash_policy (float __z
= 1.0)= [inline]=, = [noexcept]=
Definition at line 445 of file hashtable_policy.h.
Member Function Documentation
std::size_t std::__detail::_Prime_rehash_policy::_M_bkt_for_elements
(std::size_t __n) const= [inline]= Definition at line 458 of file hashtable_policy.h.
void std::__detail::_Prime_rehash_policy::_M_reset ()= [inline]=,
= [noexcept]= Definition at line 476 of file hashtable_policy.h.
void std::__detail::_Prime_rehash_policy::_M_reset (_State
__state)= [inline]= Definition at line 480 of file hashtable_policy.h.
_State std::__detail::_Prime_rehash_policy::_M_state ()
const= [inline]= Definition at line 472 of file hashtable_policy.h.
float std::__detail::_Prime_rehash_policy::max_load_factor ()
const= [inline]=, = [noexcept]= Definition at line 449 of file hashtable_policy.h.
Member Data Documentation
float std::__detail::_Prime_rehash_policy::_M_max_load_factor
Definition at line 485 of file hashtable_policy.h.
std::size_t
std::__detail::_Prime_rehash_policy::_M_next_resize= [mutable]= Definition at line 486 of file hashtable_policy.h.
const std::size_t
std::__detail::_Prime_rehash_policy::_S_growth_factor= [static]= Definition at line 483 of file hashtable_policy.h.
Author
Generated automatically by Doxygen for libstdc++ from the source code.