libstdc++: std::__debug::unordered_multimap< _Key, _Tp, _Hash, _Pred, _Alloc (original) (raw)
#include <[unordered_map](a18593%5Fsource.html)>
| Public Types | |
|---|---|
| typedef _Base::allocator_type | allocator_type |
| typedef __gnu_debug::_Safe_iterator< _Base_const_iterator, unordered_multimap > | const_iterator |
| typedef __gnu_debug::_Safe_local_iterator< _Base_const_local_iterator, unordered_multimap > | const_local_iterator |
| typedef _Base::const_pointer | const_pointer |
| typedef _Base::const_reference | const_reference |
| typedef _Base::difference_type | difference_type |
| typedef _Base::hasher | hasher |
| typedef __gnu_debug::_Safe_iterator< _Base_iterator, unordered_multimap > | iterator |
| typedef _Base::key_equal | key_equal |
| typedef _Base::key_type | key_type |
| typedef __gnu_debug::_Safe_local_iterator< _Base_local_iterator, unordered_multimap > | local_iterator |
| typedef _Base::mapped_type | mapped_type |
| using | node_type = typename _Base::node_type |
| typedef _Base::pointer | pointer |
| typedef _Base::reference | reference |
| typedef _Base::size_type | size_type |
| typedef _Base::value_type | value_type |
| Public Member Functions | |
|---|---|
| unordered_multimap (_Base_ref __x) | |
| template<typename _InputIterator > | |
| unordered_multimap (_InputIterator __first, _InputIterator __last, size_type __n, const allocator_type &__a) | |
| template<typename _InputIterator > | |
| unordered_multimap (_InputIterator __first, _InputIterator __last, size_type __n, const hasher &__hf, const allocator_type &__a) | |
| template<typename _InputIterator > | |
| unordered_multimap (_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_multimap (const allocator_type &__a) | |
| unordered_multimap (const unordered_multimap &)=default | |
| unordered_multimap (const unordered_multimap &__umap, const allocator_type &__a) | |
| unordered_multimap (initializer_list< value_type > __l, size_type __n, const allocator_type &__a) | |
| unordered_multimap (initializer_list< value_type > __l, size_type __n, const hasher &__hf, const allocator_type &__a) | |
| unordered_multimap (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_multimap (size_type __n, const allocator_type &__a) | |
| unordered_multimap (size_type __n, const hasher &__hf, const allocator_type &__a) | |
| unordered_multimap (size_type __n, const hasher &__hf=hasher(), const key_equal &__eql=key_equal(), const allocator_type &__a=allocator_type()) | |
| unordered_multimap (unordered_multimap &&)=default | |
| unordered_multimap (unordered_multimap &&__umap, const allocator_type &__a) noexcept(noexcept(_Base(std::move(__umap), __a))) | |
| const _Base & | _M_base () const noexcept |
| _Base & | _M_base () noexcept |
| const_iterator | begin () const noexcept |
| iterator | begin () 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> | |
| iterator | emplace (_Args &&... __args) |
| template<typename... _Args> | |
| iterator | emplace_hint (const_iterator __hint, _Args &&... __args) |
| const_iterator | end () const noexcept |
| iterator | end () noexcept |
| local_iterator | end (size_type __b) |
| const_local_iterator | end (size_type __b) const |
| template<typename _Kt , typename = std::__has_is_transparent_t<_Hash, _Kt>, typename = std::__has_is_transparent_t<_Pred, _Kt>> | |
| std::pair< iterator, iterator > | equal_range (const _Kt &__k) |
| template<typename _Kt , typename = std::__has_is_transparent_t<_Hash, _Kt>, typename = std::__has_is_transparent_t<_Pred, _Kt>> | |
| std::pair< const_iterator, const_iterator > | equal_range (const _Kt &__k) const |
| std::pair< iterator, iterator > | equal_range (const key_type &__key) |
| std::pair< const_iterator, const_iterator > | equal_range (const key_type &__key) const |
| _Base_iterator | erase (_Base_const_iterator __it) |
| size_type | erase (const key_type &__key) |
| iterator | erase (const_iterator __first, const_iterator __last) |
| iterator | erase (const_iterator __it) |
| iterator | erase (iterator __it) |
| node_type | extract (const key_type &__key) |
| node_type | extract (const_iterator __position) |
| template<typename _Kt , typename = std::__has_is_transparent_t<_Hash, _Kt>, typename = std::__has_is_transparent_t<_Pred, _Kt>> | |
| iterator | find (const _Kt &__k) |
| template<typename _Kt , typename = std::__has_is_transparent_t<_Hash, _Kt>, typename = std::__has_is_transparent_t<_Pred, _Kt>> | |
| const_iterator | find (const _Kt &__k) const |
| iterator | find (const key_type &__key) |
| const_iterator | find (const key_type &__key) const |
| template<typename _InputIterator > | |
| void | insert (_InputIterator __first, _InputIterator __last) |
| template<typename _Pair , typename = typename std::enable_if<std::is_constructible<value_type, _Pair&&>::value>::type> | |
| iterator | insert (_Pair &&__obj) |
| iterator | insert (const value_type &__obj) |
| template<typename _Pair , typename = typename std::enable_if<std::is_constructible<value_type, _Pair&&>::value>::type> | |
| iterator | insert (const_iterator __hint, _Pair &&__obj) |
| iterator | insert (const_iterator __hint, const value_type &__obj) |
| iterator | insert (const_iterator __hint, node_type &&__nh) |
| iterator | insert (const_iterator __hint, value_type &&__x) |
| iterator | insert (node_type &&__nh) |
| void | insert (std::initializer_list< value_type > __l) |
| iterator | insert (value_type &&__x) |
| float | max_load_factor () const noexcept |
| void | max_load_factor (float __f) |
| template<typename _H2 , typename _P2 > | |
| void | merge (unordered_map< _Key, _Tp, _H2, _P2, _Alloc > &&__source) |
| template<typename _H2 , typename _P2 > | |
| void | merge (unordered_map< _Key, _Tp, _H2, _P2, _Alloc > &__source) |
| template<typename _H2 , typename _P2 > | |
| void | merge (unordered_multimap< _Key, _Tp, _H2, _P2, _Alloc > &&__source) |
| template<typename _H2 , typename _P2 > | |
| void | merge (unordered_multimap< _Key, _Tp, _H2, _P2, _Alloc > &__source) |
| unordered_multimap & | operator= (const unordered_multimap &)=default |
| unordered_multimap & | operator= (initializer_list< value_type > __l) |
| unordered_multimap & | operator= (unordered_multimap &&)=default |
| void | swap (unordered_multimap &__x) noexcept(noexcept(declval< _Base & >().swap(__x))) |
| Protected Member Functions | |
|---|---|
| constexpr void | _M_swap (_Safe_container &__x) noexcept |
| Friends | |
|---|---|
| template<typename _ItT , typename _SeqT , typename _CatT > | |
| class | ::__gnu_debug::_Safe_iterator |
| template<typename _ItT , typename _SeqT > | |
| class | ::__gnu_debug::_Safe_local_iterator |
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_multimap< _Key, _Tp, _Hash, _Pred, _Alloc >
Class std::unordered_multimap with safety/checking/debug instrumentation.
Definition at line 873 of file debug/unordered_map.
◆ allocator_type
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> >>
◆ const_iterator
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> >>
◆ const_local_iterator
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> >>
◆ const_pointer
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> >>
◆ const_reference
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> >>
◆ difference_type
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> >>
◆ hasher
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> >>
◆ iterator
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> >>
◆ key_equal
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> >>
◆ key_type
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> >>
◆ local_iterator
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> >>
◆ mapped_type
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> >>
◆ node_type
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> >>
◆ pointer
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> >>
◆ reference
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> >>
◆ size_type
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> >>
◆ value_type
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> >>
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> >>
| std::__debug::unordered_multimap< _Key, _Tp, _Hash, _Pred, _Alloc >::unordered_multimap ( size_type __n, const hasher & __hf = hasher(), const key_equal & __eql = key_equal(), const allocator_type & __a = allocator_type() ) | inlineexplicit |
|---|
◆ unordered_multimap() [2/13]
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> >>
template<typename _InputIterator >
| std::__debug::unordered_multimap< _Key, _Tp, _Hash, _Pred, _Alloc >::unordered_multimap ( _InputIterator __first, _InputIterator __last, size_type __n = 0, const hasher & __hf = hasher(), const key_equal & __eql = key_equal(), const allocator_type & __a = allocator_type() ) | inline |
|---|
◆ unordered_multimap() [3/13]
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> >>
◆ unordered_multimap() [4/13]
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> >>
◆ unordered_multimap() [5/13]
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> >>
◆ unordered_multimap() [6/13]
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> >>
◆ unordered_multimap() [7/13]
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> >>
| std::__debug::unordered_multimap< _Key, _Tp, _Hash, _Pred, _Alloc >::unordered_multimap ( 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() ) | inline |
|---|
◆ unordered_multimap() [8/13]
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> >>
◆ unordered_multimap() [9/13]
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> >>
| std::__debug::unordered_multimap< _Key, _Tp, _Hash, _Pred, _Alloc >::unordered_multimap ( size_type __n, const hasher & __hf, const allocator_type & __a ) | inline |
|---|
◆ unordered_multimap() [10/13]
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> >>
template<typename _InputIterator >
| std::__debug::unordered_multimap< _Key, _Tp, _Hash, _Pred, _Alloc >::unordered_multimap ( _InputIterator __first, _InputIterator __last, size_type __n, const allocator_type & __a ) | inline |
|---|
◆ unordered_multimap() [11/13]
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> >>
template<typename _InputIterator >
| std::__debug::unordered_multimap< _Key, _Tp, _Hash, _Pred, _Alloc >::unordered_multimap ( _InputIterator __first, _InputIterator __last, size_type __n, const hasher & __hf, const allocator_type & __a ) | inline |
|---|
◆ unordered_multimap() [12/13]
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> >>
◆ unordered_multimap() [13/13]
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> >>
◆ _M_base() [1/2]
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> >>
◆ _M_base() [2/2]
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> >>
◆ _M_swap()
template<typename _SafeContainer , typename _Alloc , template< typename > class _SafeBase, bool _IsCxx11AllocatorAware = true>
| constexpr void __gnu_debug::_Safe_container< _SafeContainer, _Alloc, _SafeBase, _IsCxx11AllocatorAware >::_M_swap ( _Safe_container< _SafeContainer, _Alloc, _SafeBase, _IsCxx11AllocatorAware > & __x) | inlineconstexprprotectednoexceptinherited |
|---|
◆ begin() [1/4]
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> >>
◆ begin() [2/4]
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> >>
◆ begin() [3/4]
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> >>
◆ begin() [4/4]
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> >>
◆ bucket_size()
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> >>
◆ cbegin() [1/2]
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> >>
◆ cbegin() [2/2]
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> >>
◆ cend() [1/2]
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> >>
◆ cend() [2/2]
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> >>
◆ clear()
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> >>
◆ emplace()
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> >>
template<typename... _Args>
◆ emplace_hint()
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> >>
template<typename... _Args>
◆ end() [1/4]
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> >>
◆ end() [2/4]
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> >>
◆ end() [3/4]
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> >>
◆ end() [4/4]
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> >>
◆ equal_range() [1/4]
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> >>
template<typename _Kt , typename = std::__has_is_transparent_t<_Hash, _Kt>, typename = std::__has_is_transparent_t<_Pred, _Kt>>
◆ equal_range() [2/4]
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> >>
template<typename _Kt , typename = std::__has_is_transparent_t<_Hash, _Kt>, typename = std::__has_is_transparent_t<_Pred, _Kt>>
◆ equal_range() [3/4]
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> >>
◆ equal_range() [4/4]
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> >>
◆ erase() [1/5]
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> >>
◆ erase() [2/5]
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> >>
◆ erase() [3/5]
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> >>
◆ erase() [4/5]
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> >>
◆ erase() [5/5]
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> >>
◆ extract() [1/2]
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> >>
◆ extract() [2/2]
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> >>
◆ find() [1/4]
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> >>
template<typename _Kt , typename = std::__has_is_transparent_t<_Hash, _Kt>, typename = std::__has_is_transparent_t<_Pred, _Kt>>
◆ find() [2/4]
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> >>
template<typename _Kt , typename = std::__has_is_transparent_t<_Hash, _Kt>, typename = std::__has_is_transparent_t<_Pred, _Kt>>
◆ find() [3/4]
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> >>
◆ find() [4/4]
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> >>
◆ insert() [1/10]
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> >>
template<typename _InputIterator >
◆ insert() [2/10]
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> >>
template<typename _Pair , typename = typename std::enable_if<std::is_constructible<value_type, _Pair&&>::value>::type>
◆ insert() [3/10]
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> >>
◆ insert() [4/10]
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> >>
template<typename _Pair , typename = typename std::enable_if<std::is_constructible<value_type, _Pair&&>::value>::type>
◆ insert() [5/10]
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> >>
◆ insert() [6/10]
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> >>
◆ insert() [7/10]
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> >>
◆ insert() [8/10]
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> >>
◆ insert() [9/10]
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> >>
◆ insert() [10/10]
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> >>
◆ max_load_factor() [1/2]
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> >>
◆ max_load_factor() [2/2]
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> >>
◆ merge() [1/4]
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> >>
template<typename _H2 , typename _P2 >
◆ merge() [2/4]
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> >>
template<typename _H2 , typename _P2 >
◆ merge() [3/4]
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> >>
template<typename _H2 , typename _P2 >
◆ merge() [4/4]
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> >>
template<typename _H2 , typename _P2 >
◆ operator=()
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> >>
◆ swap()
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> >>
◆ ::__gnu_debug::_Safe_iterator
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> >>
template<typename _ItT , typename _SeqT , typename _CatT >
◆ ::__gnu_debug::_Safe_local_iterator
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> >>
template<typename _ItT , typename _SeqT >
The documentation for this class was generated from the following file: