.TH "std::__detail::_Hashtable_traits< _Cache_hash_code, _Constant_iterators, _Unique_keys >" 3cxx "Thu Nov 18 2021" "libstdc++" \" -*- nroff -*-
.ad l
.nh
.SH NAME
std::__detail::_Hashtable_traits< _Cache_hash_code, _Constant_iterators, _Unique_keys >
.SH SYNOPSIS
.br
.PP
.SS "Public Types"

.in +1c
.ti -1c
.RI "using \fB__constant_iterators\fP = __bool_constant< _Constant_iterators >"
.br
.ti -1c
.RI "using \fB__hash_cached\fP = __bool_constant< _Cache_hash_code >"
.br
.ti -1c
.RI "using \fB__unique_keys\fP = __bool_constant< _Unique_keys >"
.br
.in -1c
.SH "Detailed Description"
.PP 

.SS "template<bool _Cache_hash_code, bool _Constant_iterators, bool _Unique_keys>
.br
struct std::__detail::_Hashtable_traits< _Cache_hash_code, _Constant_iterators, _Unique_keys >"
struct _Hashtable_traits
.PP
Important traits for hash tables\&.
.PP
\fBTemplate Parameters\fP
.RS 4
\fI_Cache_hash_code\fP Boolean value\&. True if the value of the hash function is stored along with the value\&. This is a time-space tradeoff\&. Storing it may improve lookup speed by reducing the number of times we need to call the _Hash or _Equal functors\&.
.br
\fI_Constant_iterators\fP Boolean value\&. True if iterator and const_iterator are both constant iterator types\&. This is true for unordered_set and unordered_multiset, false for unordered_map and unordered_multimap\&.
.br
\fI_Unique_keys\fP Boolean value\&. True if the return value of _Hashtable::count(k) is always at most one, false if it may be an arbitrary number\&. This is true for unordered_set and unordered_map, false for unordered_multiset and unordered_multimap\&. 
.RE
.PP

.PP
Definition at line 199 of file hashtable_policy\&.h\&.

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