libstdc++
Public Types | Public Member Functions | Protected Member Functions | Friends | List of all members
std::__debug::unordered_multimap< _Key, _Tp, _Hash, _Pred, _Alloc > Class Template Reference

#include <unordered_map>

Inheritance diagram for std::__debug::unordered_multimap< _Key, _Tp, _Hash, _Pred, _Alloc >:
[legend]

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
 
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, const allocator_type &__a)
 
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, 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 (const _Safe_container &__x) const 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
 

Detailed Description

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 955 of file debug/unordered_map.

Member Typedef Documentation

◆ 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> >>
typedef _Base::allocator_type std::__debug::unordered_multimap< _Key, _Tp, _Hash, _Pred, _Alloc >::allocator_type

Definition at line 988 of file debug/unordered_map.

◆ 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> >>
typedef __gnu_debug::_Safe_iterator< _Base_const_iterator, unordered_multimap> std::__debug::unordered_multimap< _Key, _Tp, _Hash, _Pred, _Alloc >::const_iterator

Definition at line 1001 of file debug/unordered_map.

◆ 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> >>
typedef __gnu_debug::_Safe_local_iterator< _Base_const_local_iterator, unordered_multimap> std::__debug::unordered_multimap< _Key, _Tp, _Hash, _Pred, _Alloc >::const_local_iterator

Definition at line 1005 of file debug/unordered_map.

◆ 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> >>
typedef _Base::const_pointer std::__debug::unordered_multimap< _Key, _Tp, _Hash, _Pred, _Alloc >::const_pointer

Definition at line 995 of file debug/unordered_map.

◆ 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> >>
typedef _Base::const_reference std::__debug::unordered_multimap< _Key, _Tp, _Hash, _Pred, _Alloc >::const_reference

Definition at line 997 of file debug/unordered_map.

◆ 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> >>
typedef _Base::difference_type std::__debug::unordered_multimap< _Key, _Tp, _Hash, _Pred, _Alloc >::difference_type

Definition at line 1006 of file debug/unordered_map.

◆ 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> >>
typedef _Base::hasher std::__debug::unordered_multimap< _Key, _Tp, _Hash, _Pred, _Alloc >::hasher

Definition at line 986 of file debug/unordered_map.

◆ 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> >>
typedef __gnu_debug::_Safe_iterator< _Base_iterator, unordered_multimap> std::__debug::unordered_multimap< _Key, _Tp, _Hash, _Pred, _Alloc >::iterator

Definition at line 999 of file debug/unordered_map.

◆ 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> >>
typedef _Base::key_equal std::__debug::unordered_multimap< _Key, _Tp, _Hash, _Pred, _Alloc >::key_equal

Definition at line 987 of file debug/unordered_map.

◆ 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> >>
typedef _Base::key_type std::__debug::unordered_multimap< _Key, _Tp, _Hash, _Pred, _Alloc >::key_type

Definition at line 990 of file debug/unordered_map.

◆ 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> >>
typedef __gnu_debug::_Safe_local_iterator< _Base_local_iterator, unordered_multimap> std::__debug::unordered_multimap< _Key, _Tp, _Hash, _Pred, _Alloc >::local_iterator

Definition at line 1003 of file debug/unordered_map.

◆ 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> >>
typedef _Base::mapped_type std::__debug::unordered_multimap< _Key, _Tp, _Hash, _Pred, _Alloc >::mapped_type

Definition at line 992 of file debug/unordered_map.

◆ 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> >>
using std::__debug::unordered_multimap< _Key, _Tp, _Hash, _Pred, _Alloc >::node_type

Definition at line 1366 of file debug/unordered_map.

◆ 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> >>
typedef _Base::pointer std::__debug::unordered_multimap< _Key, _Tp, _Hash, _Pred, _Alloc >::pointer

Definition at line 994 of file debug/unordered_map.

◆ 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> >>
typedef _Base::reference std::__debug::unordered_multimap< _Key, _Tp, _Hash, _Pred, _Alloc >::reference

Definition at line 996 of file debug/unordered_map.

◆ 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> >>
typedef _Base::size_type std::__debug::unordered_multimap< _Key, _Tp, _Hash, _Pred, _Alloc >::size_type

Definition at line 985 of file debug/unordered_map.

◆ 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> >>
typedef _Base::value_type std::__debug::unordered_multimap< _Key, _Tp, _Hash, _Pred, _Alloc >::value_type

Definition at line 991 of file debug/unordered_map.

Constructor & Destructor Documentation

◆ unordered_multimap() [1/15]

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

Definition at line 1011 of file debug/unordered_map.

◆ unordered_multimap() [2/15]

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

Definition at line 1018 of file debug/unordered_map.

◆ unordered_multimap() [3/15]

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 ( _Base_ref __x)
inline

Definition at line 1030 of file debug/unordered_map.

◆ unordered_multimap() [4/15]

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 ( const allocator_type & __a)
inlineexplicit

Definition at line 1036 of file debug/unordered_map.

◆ unordered_multimap() [5/15]

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 ( const unordered_multimap< _Key, _Tp, _Hash, _Pred, _Alloc > & __umap,
const allocator_type & __a )
inline

Definition at line 1039 of file debug/unordered_map.

◆ unordered_multimap() [6/15]

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 ( unordered_multimap< _Key, _Tp, _Hash, _Pred, _Alloc > && __umap,
const allocator_type & __a )
inlinenoexcept

Definition at line 1043 of file debug/unordered_map.

◆ unordered_multimap() [7/15]

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

Definition at line 1049 of file debug/unordered_map.

◆ unordered_multimap() [8/15]

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 allocator_type & __a )
inline

Definition at line 1056 of file debug/unordered_map.

◆ unordered_multimap() [9/15]

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

Definition at line 1060 of file debug/unordered_map.

◆ unordered_multimap() [10/15]

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,
const allocator_type & __a )
inline

Definition at line 1066 of file debug/unordered_map.

◆ unordered_multimap() [11/15]

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

Definition at line 1072 of file debug/unordered_map.

◆ unordered_multimap() [12/15]

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

Definition at line 1079 of file debug/unordered_map.

◆ unordered_multimap() [13/15]

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,
const allocator_type & __a )
inline

Definition at line 1085 of file debug/unordered_map.

◆ unordered_multimap() [14/15]

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,
const allocator_type & __a )
inline

Definition at line 1090 of file debug/unordered_map.

◆ unordered_multimap() [15/15]

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,
const hasher & __hf,
const allocator_type & __a )
inline

Definition at line 1096 of file debug/unordered_map.

Member Function Documentation

◆ _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> >>
const _Base & std::__debug::unordered_multimap< _Key, _Tp, _Hash, _Pred, _Alloc >::_M_base ( ) const
inlinenoexcept

Definition at line 1560 of file debug/unordered_map.

◆ _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> >>
_Base & std::__debug::unordered_multimap< _Key, _Tp, _Hash, _Pred, _Alloc >::_M_base ( )
inlinenoexcept

Definition at line 1557 of file debug/unordered_map.

◆ _M_swap()

template<typename _SafeContainer, typename _Alloc, template< typename > class _SafeBase, bool _IsCxx11AllocatorAware = true>
void __gnu_debug::_Safe_container< _SafeContainer, _Alloc, _SafeBase, _IsCxx11AllocatorAware >::_M_swap ( const _Safe_container< _SafeContainer, _Alloc, _SafeBase, _IsCxx11AllocatorAware > & __x) const
inlineconstexprprotectednoexceptinherited

Definition at line 136 of file safe_container.h.

◆ 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> >>
const_iterator std::__debug::unordered_multimap< _Key, _Tp, _Hash, _Pred, _Alloc >::begin ( ) const
inlinenoexcept

Definition at line 1171 of file debug/unordered_map.

◆ 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> >>
iterator std::__debug::unordered_multimap< _Key, _Tp, _Hash, _Pred, _Alloc >::begin ( )
inlinenoexcept

Definition at line 1167 of file debug/unordered_map.

◆ 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> >>
local_iterator std::__debug::unordered_multimap< _Key, _Tp, _Hash, _Pred, _Alloc >::begin ( size_type __b)
inline

Definition at line 1192 of file debug/unordered_map.

◆ 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> >>
const_local_iterator std::__debug::unordered_multimap< _Key, _Tp, _Hash, _Pred, _Alloc >::begin ( size_type __b) const
inline

Definition at line 1206 of file debug/unordered_map.

◆ 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> >>
size_type std::__debug::unordered_multimap< _Key, _Tp, _Hash, _Pred, _Alloc >::bucket_size ( size_type __b) const
inline

Definition at line 1238 of file debug/unordered_map.

◆ 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> >>
const_iterator std::__debug::unordered_multimap< _Key, _Tp, _Hash, _Pred, _Alloc >::cbegin ( ) const
inlinenoexcept

Definition at line 1183 of file debug/unordered_map.

◆ 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> >>
const_local_iterator std::__debug::unordered_multimap< _Key, _Tp, _Hash, _Pred, _Alloc >::cbegin ( size_type __b) const
inline

Definition at line 1220 of file debug/unordered_map.

◆ 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> >>
const_iterator std::__debug::unordered_multimap< _Key, _Tp, _Hash, _Pred, _Alloc >::cend ( ) const
inlinenoexcept

Definition at line 1187 of file debug/unordered_map.

◆ 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> >>
const_local_iterator std::__debug::unordered_multimap< _Key, _Tp, _Hash, _Pred, _Alloc >::cend ( size_type __b) const
inline

Definition at line 1227 of file debug/unordered_map.

◆ 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> >>
void std::__debug::unordered_multimap< _Key, _Tp, _Hash, _Pred, _Alloc >::clear ( )
inlinenoexcept

Definition at line 1160 of file debug/unordered_map.

◆ 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>
iterator std::__debug::unordered_multimap< _Key, _Tp, _Hash, _Pred, _Alloc >::emplace ( _Args &&... __args)
inline

Definition at line 1257 of file debug/unordered_map.

◆ 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>
iterator std::__debug::unordered_multimap< _Key, _Tp, _Hash, _Pred, _Alloc >::emplace_hint ( const_iterator __hint,
_Args &&... __args )
inline

Definition at line 1267 of file debug/unordered_map.

◆ 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> >>
const_iterator std::__debug::unordered_multimap< _Key, _Tp, _Hash, _Pred, _Alloc >::end ( ) const
inlinenoexcept

Definition at line 1179 of file debug/unordered_map.

◆ 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> >>
iterator std::__debug::unordered_multimap< _Key, _Tp, _Hash, _Pred, _Alloc >::end ( )
inlinenoexcept

Definition at line 1175 of file debug/unordered_map.

◆ 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> >>
local_iterator std::__debug::unordered_multimap< _Key, _Tp, _Hash, _Pred, _Alloc >::end ( size_type __b)
inline

Definition at line 1199 of file debug/unordered_map.

◆ 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> >>
const_local_iterator std::__debug::unordered_multimap< _Key, _Tp, _Hash, _Pred, _Alloc >::end ( size_type __b) const
inline

Definition at line 1213 of file debug/unordered_map.

◆ 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>>
std::pair< iterator, iterator > std::__debug::unordered_multimap< _Key, _Tp, _Hash, _Pred, _Alloc >::equal_range ( const _Kt & __k)
inline

Definition at line 1470 of file debug/unordered_map.

◆ 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>>
std::pair< const_iterator, const_iterator > std::__debug::unordered_multimap< _Key, _Tp, _Hash, _Pred, _Alloc >::equal_range ( const _Kt & __k) const
inline

Definition at line 1489 of file debug/unordered_map.

◆ 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> >>
std::pair< iterator, iterator > std::__debug::unordered_multimap< _Key, _Tp, _Hash, _Pred, _Alloc >::equal_range ( const key_type & __key)
inline

Definition at line 1459 of file debug/unordered_map.

◆ 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> >>
std::pair< const_iterator, const_iterator > std::__debug::unordered_multimap< _Key, _Tp, _Hash, _Pred, _Alloc >::equal_range ( const key_type & __key) const
inline

Definition at line 1478 of file debug/unordered_map.

◆ 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> >>
_Base_iterator std::__debug::unordered_multimap< _Key, _Tp, _Hash, _Pred, _Alloc >::erase ( _Base_const_iterator __it)
inline

Definition at line 1521 of file debug/unordered_map.

◆ 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> >>
size_type std::__debug::unordered_multimap< _Key, _Tp, _Hash, _Pred, _Alloc >::erase ( const key_type & __key)
inline

Definition at line 1497 of file debug/unordered_map.

◆ 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> >>
iterator std::__debug::unordered_multimap< _Key, _Tp, _Hash, _Pred, _Alloc >::erase ( const_iterator __first,
const_iterator __last )
inline

Definition at line 1535 of file debug/unordered_map.

◆ 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> >>
iterator std::__debug::unordered_multimap< _Key, _Tp, _Hash, _Pred, _Alloc >::erase ( const_iterator __it)
inline

Definition at line 1514 of file debug/unordered_map.

◆ 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> >>
iterator std::__debug::unordered_multimap< _Key, _Tp, _Hash, _Pred, _Alloc >::erase ( iterator __it)
inline

Definition at line 1528 of file debug/unordered_map.

◆ 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> >>
node_type std::__debug::unordered_multimap< _Key, _Tp, _Hash, _Pred, _Alloc >::extract ( const key_type & __key)
inline

Definition at line 1376 of file debug/unordered_map.

◆ 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> >>
node_type std::__debug::unordered_multimap< _Key, _Tp, _Hash, _Pred, _Alloc >::extract ( const_iterator __position)
inline

Definition at line 1369 of file debug/unordered_map.

◆ 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>>
iterator std::__debug::unordered_multimap< _Key, _Tp, _Hash, _Pred, _Alloc >::find ( const _Kt & __k)
inline

Definition at line 1436 of file debug/unordered_map.

◆ 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>>
const_iterator std::__debug::unordered_multimap< _Key, _Tp, _Hash, _Pred, _Alloc >::find ( const _Kt & __k) const
inline

Definition at line 1449 of file debug/unordered_map.

◆ 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> >>
iterator std::__debug::unordered_multimap< _Key, _Tp, _Hash, _Pred, _Alloc >::find ( const key_type & __key)
inline

Definition at line 1428 of file debug/unordered_map.

◆ 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> >>
const_iterator std::__debug::unordered_multimap< _Key, _Tp, _Hash, _Pred, _Alloc >::find ( const key_type & __key) const
inline

Definition at line 1441 of file debug/unordered_map.

◆ 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>
void std::__debug::unordered_multimap< _Key, _Tp, _Hash, _Pred, _Alloc >::insert ( _InputIterator __first,
_InputIterator __last )
inline

Definition at line 1350 of file debug/unordered_map.

◆ 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>
iterator std::__debug::unordered_multimap< _Key, _Tp, _Hash, _Pred, _Alloc >::insert ( _Pair && __obj)
inline

Definition at line 1323 of file debug/unordered_map.

◆ 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> >>
iterator std::__debug::unordered_multimap< _Key, _Tp, _Hash, _Pred, _Alloc >::insert ( const value_type & __obj)
inline

Definition at line 1278 of file debug/unordered_map.

◆ 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>
iterator std::__debug::unordered_multimap< _Key, _Tp, _Hash, _Pred, _Alloc >::insert ( const_iterator __hint,
_Pair && __obj )
inline

Definition at line 1335 of file debug/unordered_map.

◆ 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> >>
iterator std::__debug::unordered_multimap< _Key, _Tp, _Hash, _Pred, _Alloc >::insert ( const_iterator __hint,
const value_type & __obj )
inline

Definition at line 1298 of file debug/unordered_map.

◆ 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> >>
iterator std::__debug::unordered_multimap< _Key, _Tp, _Hash, _Pred, _Alloc >::insert ( const_iterator __hint,
node_type && __nh )
inline

Definition at line 1389 of file debug/unordered_map.

◆ 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> >>
iterator std::__debug::unordered_multimap< _Key, _Tp, _Hash, _Pred, _Alloc >::insert ( const_iterator __hint,
value_type && __x )
inline

Definition at line 1310 of file debug/unordered_map.

◆ 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> >>
iterator std::__debug::unordered_multimap< _Key, _Tp, _Hash, _Pred, _Alloc >::insert ( node_type && __nh)
inline

Definition at line 1385 of file debug/unordered_map.

◆ 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> >>
void std::__debug::unordered_multimap< _Key, _Tp, _Hash, _Pred, _Alloc >::insert ( std::initializer_list< value_type > __l)
inline

Definition at line 1345 of file debug/unordered_map.

◆ 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> >>
iterator std::__debug::unordered_multimap< _Key, _Tp, _Hash, _Pred, _Alloc >::insert ( value_type && __x)
inline

Definition at line 1289 of file debug/unordered_map.

◆ 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> >>
float std::__debug::unordered_multimap< _Key, _Tp, _Hash, _Pred, _Alloc >::max_load_factor ( ) const
inlinenoexcept

Definition at line 1245 of file debug/unordered_map.

◆ 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> >>
void std::__debug::unordered_multimap< _Key, _Tp, _Hash, _Pred, _Alloc >::max_load_factor ( float __f)
inline

Definition at line 1249 of file debug/unordered_map.

◆ 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>
void std::__debug::unordered_multimap< _Key, _Tp, _Hash, _Pred, _Alloc >::merge ( unordered_map< _Key, _Tp, _H2, _P2, _Alloc > && __source)
inline

Definition at line 1420 of file debug/unordered_map.

◆ 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>
void std::__debug::unordered_multimap< _Key, _Tp, _Hash, _Pred, _Alloc >::merge ( unordered_map< _Key, _Tp, _H2, _P2, _Alloc > & __source)
inline

Definition at line 1411 of file debug/unordered_map.

◆ 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>
void std::__debug::unordered_multimap< _Key, _Tp, _Hash, _Pred, _Alloc >::merge ( unordered_multimap< _Key, _Tp, _H2, _P2, _Alloc > && __source)
inline

Definition at line 1406 of file debug/unordered_map.

◆ 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>
void std::__debug::unordered_multimap< _Key, _Tp, _Hash, _Pred, _Alloc >::merge ( unordered_multimap< _Key, _Tp, _H2, _P2, _Alloc > & __source)
inline

Definition at line 1397 of file debug/unordered_map.

◆ 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> >>
unordered_multimap & std::__debug::unordered_multimap< _Key, _Tp, _Hash, _Pred, _Alloc >::operator= ( initializer_list< value_type > __l)
inline

Definition at line 1139 of file debug/unordered_map.

◆ 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> >>
void std::__debug::unordered_multimap< _Key, _Tp, _Hash, _Pred, _Alloc >::swap ( unordered_multimap< _Key, _Tp, _Hash, _Pred, _Alloc > & __x)
inlinenoexcept

Definition at line 1152 of file debug/unordered_map.

Friends And Related Symbol Documentation

◆ ::__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>
friend class ::__gnu_debug::_Safe_iterator
friend

Definition at line 972 of file debug/unordered_map.

◆ ::__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>
friend class ::__gnu_debug::_Safe_local_iterator
friend

Definition at line 974 of file debug/unordered_map.

The documentation for this class was generated from the following file: