|
| unordered_map (size_type __n, const hasher &__hf=hasher(), const key_equal &__eql=key_equal(), const allocator_type &__a=allocator_type()) |
|
template<typename _InputIterator > |
| unordered_map (_InputIterator __first, _InputIterator __last, size_type __n=0, const hasher &__hf=hasher(), const key_equal &__eql=key_equal(), const allocator_type &__a=allocator_type()) |
|
| unordered_map (const unordered_map &)=default |
|
| unordered_map (const _Base &__x) |
|
| unordered_map (unordered_map &&)=default |
|
| unordered_map (const allocator_type &__a) |
|
| unordered_map (const unordered_map &__umap, const allocator_type &__a) |
|
| unordered_map (unordered_map &&__umap, const allocator_type &__a) |
|
| unordered_map (initializer_list< value_type > __l, size_type __n=0, const hasher &__hf=hasher(), const key_equal &__eql=key_equal(), const allocator_type &__a=allocator_type()) |
|
| unordered_map (size_type __n, const allocator_type &__a) |
|
| unordered_map (size_type __n, const hasher &__hf, const allocator_type &__a) |
|
template<typename _InputIterator > |
| unordered_map (_InputIterator __first, _InputIterator __last, size_type __n, const allocator_type &__a) |
|
template<typename _InputIterator > |
| unordered_map (_InputIterator __first, _InputIterator __last, size_type __n, const hasher &__hf, const allocator_type &__a) |
|
| unordered_map (initializer_list< value_type > __l, size_type __n, const allocator_type &__a) |
|
| unordered_map (initializer_list< value_type > __l, size_type __n, const hasher &__hf, const allocator_type &__a) |
|
void | _M_attach (_Safe_iterator_base *__it, bool __constant) |
|
void | _M_attach_local (_Safe_iterator_base *__it, bool __constant) |
|
void | _M_attach_local_single (_Safe_iterator_base *__it, bool __constant) throw () |
|
void | _M_attach_single (_Safe_iterator_base *__it, bool __constant) throw () |
|
_Base & | _M_base () noexcept |
|
const _Base & | _M_base () const noexcept |
|
void | _M_detach (_Safe_iterator_base *__it) |
|
void | _M_detach_local (_Safe_iterator_base *__it) |
|
void | _M_detach_local_single (_Safe_iterator_base *__it) throw () |
|
void | _M_detach_single (_Safe_iterator_base *__it) throw () |
|
void | _M_invalidate_all () const |
|
void | _M_swap (_Safe_container &__x) noexcept |
|
iterator | begin () noexcept |
|
const_iterator | begin () const noexcept |
|
local_iterator | begin (size_type __b) |
|
const_local_iterator | begin (size_type __b) const |
|
size_type | bucket_size (size_type __b) const |
|
const_iterator | cbegin () const noexcept |
|
const_local_iterator | cbegin (size_type __b) const |
|
const_iterator | cend () const noexcept |
|
const_local_iterator | cend (size_type __b) const |
|
void | clear () noexcept |
|
template<typename... _Args> |
std::pair< iterator, bool > | emplace (_Args &&...__args) |
|
template<typename... _Args> |
iterator | emplace_hint (const_iterator __hint, _Args &&...__args) |
|
iterator | end () noexcept |
|
const_iterator | end () const noexcept |
|
local_iterator | end (size_type __b) |
|
const_local_iterator | end (size_type __b) const |
|
std::pair< iterator, iterator > | equal_range (const key_type &__key) |
|
std::pair< const_iterator, const_iterator > | equal_range (const key_type &__key) const |
|
size_type | erase (const key_type &__key) |
|
iterator | erase (const_iterator __it) |
|
iterator | erase (iterator __it) |
|
iterator | erase (const_iterator __first, const_iterator __last) |
|
iterator | find (const key_type &__key) |
|
const_iterator | find (const key_type &__key) const |
|
std::pair< iterator, bool > | insert (const value_type &__obj) |
|
iterator | insert (const_iterator __hint, const value_type &__obj) |
|
template<typename _Pair , typename = typename std::enable_if<std::is_constructible<value_type, _Pair&&>::value>::type> |
std::pair< iterator, bool > | insert (_Pair &&__obj) |
|
template<typename _Pair , typename = typename std::enable_if<std::is_constructible<value_type, _Pair&&>::value>::type> |
iterator | insert (const_iterator __hint, _Pair &&__obj) |
|
void | insert (std::initializer_list< value_type > __l) |
|
template<typename _InputIterator > |
void | insert (_InputIterator __first, _InputIterator __last) |
|
float | max_load_factor () const noexcept |
|
void | max_load_factor (float __f) |
|
unordered_map & | operator= (const unordered_map &)=default |
|
unordered_map & | operator= (unordered_map &&)=default |
|
unordered_map & | operator= (initializer_list< value_type > __l) |
|
void | swap (unordered_map &__x) noexcept(noexcept(declval< _Base >().swap(__x))) |
|
template<typename _Key, typename _Tp, typename _Hash = std::hash<_Key>, typename _Pred = std::equal_to<_Key>, typename _Alloc = std::allocator<std::pair<const _Key, _Tp> >>
class std::__debug::unordered_map< _Key, _Tp, _Hash, _Pred, _Alloc >
Class std::unordered_map with safety/checking/debug instrumentation.
Definition at line 51 of file debug/unordered_map.