libstdc++
|
Functions | |
std::size_t | std::__detail::__clp2 (std::size_t __n) noexcept |
template<class _Iterator > | |
std::iterator_traits < _Iterator >::difference_type | std::__detail::__distance_fw (_Iterator __first, _Iterator __last, std::input_iterator_tag) |
template<class _Iterator > | |
std::iterator_traits < _Iterator >::difference_type | std::__detail::__distance_fw (_Iterator __first, _Iterator __last, std::forward_iterator_tag) |
template<class _Iterator > | |
std::iterator_traits < _Iterator >::difference_type | std::__detail::__distance_fw (_Iterator __first, _Iterator __last) |
std::__detail::__throw_out_of_range (__N("_Map_base::at")) | |
__buckets_ptr | std::__detail::_Hashtable_alloc< _NodeAlloc >::_M_allocate_buckets (std::size_t __bkt_count) |
template<typename... _Args> | |
auto | std::__detail::_Hashtable_alloc< _NodeAlloc >::_M_allocate_node (_Args &&...__args) -> __node_ptr |
void | std::__detail::_Hashtable_alloc< _NodeAlloc >::_M_deallocate_buckets (__buckets_ptr, std::size_t __bkt_count) |
void | std::__detail::_Hashtable_alloc< _NodeAlloc >::_M_deallocate_node (__node_ptr __n) |
void | std::__detail::_Hashtable_alloc< _NodeAlloc >::_M_deallocate_node_ptr (__node_ptr __n) |
void | std::__detail::_Hashtable_alloc< _NodeAlloc >::_M_deallocate_nodes (__node_ptr __n) |
bool | std::__detail::_Equality< _Key, _Value, _Alloc, _ExtractKey, _Equal, _Hash, _RangeHash, _Unused, _RehashPolicy, _Traits, true >::_M_equal (const __hashtable &) const |
bool | std::__detail::_Equality< _Key, _Value, _Alloc, _ExtractKey, _Equal, _Hash, _RangeHash, _Unused, _RehashPolicy, _Traits, false >::_M_equal (const __hashtable &) const |
template<typename _InputIterator , typename _NodeGetter > | |
void | std::__detail::_Insert_base< _Key, _Value, _Alloc, _ExtractKey, _Equal, _Hash, _RangeHash, _Unused, _RehashPolicy, _Traits >::_M_insert_range (_InputIterator __first, _InputIterator __last, const _NodeGetter &, true_type __uks) |
template<typename _InputIterator , typename _NodeGetter > | |
void | std::__detail::_Insert_base< _Key, _Value, _Alloc, _ExtractKey, _Equal, _Hash, _RangeHash, _Unused, _RehashPolicy, _Traits >::_M_insert_range (_InputIterator __first, _InputIterator __last, const _NodeGetter &, false_type __uks) |
const mapped_type & | std::__detail::_Map_base< _Key, _Pair, _Alloc, _Select1st, _Equal, _Hash, _RangeHash, _Unused, _RehashPolicy, _Traits, true >::at (const key_type &__k) const |
mapped_type & | std::__detail::_Map_base< _Key, _Pair, _Alloc, _Select1st, _Equal, _Hash, _RangeHash, _Unused, _RehashPolicy, _Traits, true >::operator[] (const key_type &__k) |
mapped_type & | std::__detail::_Map_base< _Key, _Pair, _Alloc, _Select1st, _Equal, _Hash, _RangeHash, _Unused, _RehashPolicy, _Traits, true >::operator[] (key_type &&__k) |
|
inlinenoexcept |
Compute closest power of 2 not less than __n.
Definition at line 504 of file hashtable_policy.h.