std::__detail::_Hashtable_traits< _Cache_hash_code, _Constant_iterators, _Unique_keys >(3cxx) | std::__detail::_Hashtable_traits< _Cache_hash_code, _Constant_iterators, _Unique_keys >(3cxx) |
NAME¶
std::__detail::_Hashtable_traits< _Cache_hash_code, _Constant_iterators, _Unique_keys > -SYNOPSIS¶
Public Types¶
template<bool _Cond> using __bool_constant = integral_constant< bool, _Cond >
Detailed Description¶
template<bool _Cache_hash_code, bool _Constant_iterators, bool _Unique_keys>struct std::__detail::_Hashtable_traits< _Cache_hash_code, _Constant_iterators, _Unique_keys >¶
struct _Hashtable_traits Important traits for hash tables. Template Parameters:_Cache_hash_code 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 _Equal function.
_Constant_iterators 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.
_Unique_keys 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.
Definition at line 131 of file hashtable_policy.h.
Author¶
Generated automatically by Doxygen for libstdc++ from the source code.Fri Dec 19 2014 | libstdc++ |