.TH "std::__detail::_Prime_rehash_policy" 3cxx "libstdc++" \" -*- nroff -*-
.ad l
.nh
.SH 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\&.  

.SH SYNOPSIS
.br
.PP
.PP
\fC#include <hashtable_policy\&.h>\fP
.SS "Public Types"

.in +1c
.ti -1c
.RI "\fBusing\fP \fB__has_load_factor\fP = \fBtrue_type\fP"
.br
.ti -1c
.RI "\fBtypedef\fP std::size_t \fB_State\fP"
.br
.in -1c
.SS "Public Member Functions"

.in +1c
.ti -1c
.RI "\fB_Prime_rehash_policy\fP (float \fB__z\fP=1\&.0) \fBnoexcept\fP"
.br
.ti -1c
.RI "std::size_t \fB_M_bkt_for_elements\fP (std::size_t __n) \fBconst\fP"
.br
.ti -1c
.RI "\fBstd::pair\fP< bool, std::size_t > \fB_M_need_rehash\fP (std::size_t \fB__n_bkt\fP, std::size_t \fB__n_elt\fP, std::size_t \fB__n_ins\fP) \fBconst\fP"
.br
.ti -1c
.RI "std::size_t \fB_M_next_bkt\fP (std::size_t __n) \fBconst\fP"
.br
.ti -1c
.RI "\fBvoid\fP \fB_M_reset\fP () \fBnoexcept\fP"
.br
.ti -1c
.RI "\fBvoid\fP \fB_M_reset\fP (_State \fB__state\fP)"
.br
.ti -1c
.RI "_State \fB_M_state\fP () \fBconst\fP"
.br
.ti -1c
.RI "float \fBmax_load_factor\fP () \fBconst\fP \fBnoexcept\fP"
.br
.in -1c
.SS "Public Attributes"

.in +1c
.ti -1c
.RI "float \fB_M_max_load_factor\fP"
.br
.ti -1c
.RI "std::size_t \fB_M_next_resize\fP"
.br
.in -1c
.SS "Static Public Attributes"

.in +1c
.ti -1c
.RI "\fBstatic\fP \fBconst\fP std::size_t \fB_S_growth_factor\fP"
.br
.in -1c
.SH "Detailed Description"
.PP 
Default value for rehash policy\&. Bucket size is (usually) the smallest prime that keeps the load factor small enough\&. 

.SH "Author"
.PP 
Generated automatically by Doxygen for libstdc++ from the source code\&.