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¶
#include <hashtable_policy.h>
Public Types¶
using __constant_iterators =
__bool_constant< _Constant_iterators >
using __hash_cached = __bool_constant<
_Cache_hash_code >
using __unique_keys = __bool_constant<
_Unique_keys >
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
_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.
Author¶
Generated automatically by Doxygen for libstdc++ from the source code.
libstdc++ |