ReactOS 0.4.15-dev-7918-g2a2556c
Public Types | Public Member Functions | Private Types | Private Attributes | List of all members
unordered_multimap< _Key, _Tp,,, > Class Template Reference

#include <_unordered_map.h>

Collaboration diagram for unordered_multimap< _Key, _Tp,,, >:
Collaboration graph
[legend]

Public Types

typedef _Key key_type
 
typedef _Tp data_type
 
typedef _Tp mapped_type
 
typedef pair< _STLP_CONST key_type, data_type > value_type
 
typedef hashtable< value_type, key_type, _HashFcn, _UnorderedMultimapTraits, _STLP_SELECT1ST(value_type, _Key), _EqualKey, _Alloc > _Ht
 
typedef _Ht::hasher hasher
 
typedef _Ht::key_equal key_equal
 
typedef _Ht::size_type size_type
 
typedef _Ht::difference_type difference_type
 
typedef _Ht::pointer pointer
 
typedef _Ht::const_pointer const_pointer
 
typedef _Ht::reference reference
 
typedef _Ht::const_reference const_reference
 
typedef _Ht::iterator iterator
 
typedef _Ht::const_iterator const_iterator
 
typedef _Ht::local_iterator local_iterator
 
typedef _Ht::const_local_iterator const_local_iterator
 
typedef _Ht::allocator_type allocator_type
 

Public Member Functions

hasher hash_function () const
 
key_equal key_eq () const
 
allocator_type get_allocator () const
 
 unordered_multimap (size_type __n=0, const hasher &__hf=hasher(), const key_equal &__eql=key_equal(), const allocator_type &__a=allocator_type())
 
 unordered_multimap (__move_source< _Self > src)
 
 unordered_multimap (const value_type *__f, const 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 (const_iterator __f, const_iterator __l, size_type __n=0, const hasher &__hf=hasher(), const key_equal &__eql=key_equal(), const allocator_type &__a=allocator_type())
 
_Self & operator= (const _Self &__other)
 
size_type size () const
 
size_type max_size () const
 
bool empty () const
 
void swap (_Self &__hs)
 
iterator begin ()
 
iterator end ()
 
const_iterator begin () const
 
const_iterator end () const
 
iterator insert (const value_type &__obj)
 
iterator insert (const_iterator, const value_type &__obj)
 
void insert (const value_type *__f, const value_type *__l)
 
void insert (const_iterator __f, const_iterator __l)
 
_STLP_TEMPLATE_FOR_CONT_EXT iterator find (const _KT &__key)
 
_STLP_TEMPLATE_FOR_CONT_EXT const_iterator find (const _KT &__key) const
 
_STLP_TEMPLATE_FOR_CONT_EXT size_type count (const _KT &__key) const
 
_STLP_TEMPLATE_FOR_CONT_EXT pair< iterator, iterator > equal_range (const _KT &__key)
 
_STLP_TEMPLATE_FOR_CONT_EXT pair< const_iterator, const_iterator > equal_range (const _KT &__key) const
 
size_type erase (const key_type &__key)
 
void erase (const_iterator __it)
 
void erase (const_iterator __f, const_iterator __l)
 
void clear ()
 
size_type bucket_count () const
 
size_type max_bucket_count () const
 
size_type bucket_size (size_type __n) const
 
_STLP_TEMPLATE_FOR_CONT_EXT size_type bucket (const _KT &__k) const
 
local_iterator begin (size_type __n)
 
local_iterator end (size_type __n)
 
const_local_iterator begin (size_type __n) const
 
const_local_iterator end (size_type __n) const
 
float load_factor () const
 
float max_load_factor () const
 
void max_load_factor (float __val)
 
void rehash (size_type __hint)
 

Private Types

typedef unordered_multimap< _Key, _Tp, _HashFcn, _EqualKey, _Alloc > _Self
 
typedef _STLP_PRIV _UnorderedMultimapTraitsT< value_type > _UnorderedMultimapTraits
 

Private Attributes

_Ht _M_ht
 

Detailed Description

template<class _Key, class _Tp, _STLP_DFL_TMPL_PARAM(_HashFcn, hash< _Key >), _STLP_DFL_TMPL_PARAM(_EqualKey, equal_to< _Key >), _STLP_DEFAULT_PAIR_ALLOCATOR_SELECT(_STLP_CONST _Key, _Tp)>
class unordered_multimap< _Key, _Tp,,, >

Definition at line 205 of file _unordered_map.h.

Member Typedef Documentation

◆ _Ht

template<class _Key , class _Tp , _STLP_DFL_TMPL_PARAM(_HashFcn, hash< _Key >) , _STLP_DFL_TMPL_PARAM(_EqualKey, equal_to< _Key >) , _STLP_DEFAULT_PAIR_ALLOCATOR_SELECT(_STLP_CONST _Key, _Tp) >
typedef hashtable<value_type, key_type, _HashFcn, _UnorderedMultimapTraits, _STLP_SELECT1ST(value_type, _Key), _EqualKey, _Alloc > unordered_multimap< _Key, _Tp,,, >::_Ht

Definition at line 223 of file _unordered_map.h.

◆ _Self

template<class _Key , class _Tp , _STLP_DFL_TMPL_PARAM(_HashFcn, hash< _Key >) , _STLP_DFL_TMPL_PARAM(_EqualKey, equal_to< _Key >) , _STLP_DEFAULT_PAIR_ALLOCATOR_SELECT(_STLP_CONST _Key, _Tp) >
typedef unordered_multimap<_Key, _Tp, _HashFcn, _EqualKey, _Alloc> unordered_multimap< _Key, _Tp,,, >::_Self
private

Definition at line 211 of file _unordered_map.h.

◆ _UnorderedMultimapTraits

template<class _Key , class _Tp , _STLP_DFL_TMPL_PARAM(_HashFcn, hash< _Key >) , _STLP_DFL_TMPL_PARAM(_EqualKey, equal_to< _Key >) , _STLP_DEFAULT_PAIR_ALLOCATOR_SELECT(_STLP_CONST _Key, _Tp) >
typedef _STLP_PRIV _UnorderedMultimapTraitsT<value_type> unordered_multimap< _Key, _Tp,,, >::_UnorderedMultimapTraits
private

Definition at line 219 of file _unordered_map.h.

◆ allocator_type

template<class _Key , class _Tp , _STLP_DFL_TMPL_PARAM(_HashFcn, hash< _Key >) , _STLP_DFL_TMPL_PARAM(_EqualKey, equal_to< _Key >) , _STLP_DEFAULT_PAIR_ALLOCATOR_SELECT(_STLP_CONST _Key, _Tp) >
typedef _Ht::allocator_type unordered_multimap< _Key, _Tp,,, >::allocator_type

Definition at line 240 of file _unordered_map.h.

◆ const_iterator

template<class _Key , class _Tp , _STLP_DFL_TMPL_PARAM(_HashFcn, hash< _Key >) , _STLP_DFL_TMPL_PARAM(_EqualKey, equal_to< _Key >) , _STLP_DEFAULT_PAIR_ALLOCATOR_SELECT(_STLP_CONST _Key, _Tp) >
typedef _Ht::const_iterator unordered_multimap< _Key, _Tp,,, >::const_iterator

Definition at line 236 of file _unordered_map.h.

◆ const_local_iterator

template<class _Key , class _Tp , _STLP_DFL_TMPL_PARAM(_HashFcn, hash< _Key >) , _STLP_DFL_TMPL_PARAM(_EqualKey, equal_to< _Key >) , _STLP_DEFAULT_PAIR_ALLOCATOR_SELECT(_STLP_CONST _Key, _Tp) >
typedef _Ht::const_local_iterator unordered_multimap< _Key, _Tp,,, >::const_local_iterator

Definition at line 238 of file _unordered_map.h.

◆ const_pointer

template<class _Key , class _Tp , _STLP_DFL_TMPL_PARAM(_HashFcn, hash< _Key >) , _STLP_DFL_TMPL_PARAM(_EqualKey, equal_to< _Key >) , _STLP_DEFAULT_PAIR_ALLOCATOR_SELECT(_STLP_CONST _Key, _Tp) >
typedef _Ht::const_pointer unordered_multimap< _Key, _Tp,,, >::const_pointer

Definition at line 231 of file _unordered_map.h.

◆ const_reference

template<class _Key , class _Tp , _STLP_DFL_TMPL_PARAM(_HashFcn, hash< _Key >) , _STLP_DFL_TMPL_PARAM(_EqualKey, equal_to< _Key >) , _STLP_DEFAULT_PAIR_ALLOCATOR_SELECT(_STLP_CONST _Key, _Tp) >
typedef _Ht::const_reference unordered_multimap< _Key, _Tp,,, >::const_reference

Definition at line 233 of file _unordered_map.h.

◆ data_type

template<class _Key , class _Tp , _STLP_DFL_TMPL_PARAM(_HashFcn, hash< _Key >) , _STLP_DFL_TMPL_PARAM(_EqualKey, equal_to< _Key >) , _STLP_DEFAULT_PAIR_ALLOCATOR_SELECT(_STLP_CONST _Key, _Tp) >
typedef _Tp unordered_multimap< _Key, _Tp,,, >::data_type

Definition at line 214 of file _unordered_map.h.

◆ difference_type

template<class _Key , class _Tp , _STLP_DFL_TMPL_PARAM(_HashFcn, hash< _Key >) , _STLP_DFL_TMPL_PARAM(_EqualKey, equal_to< _Key >) , _STLP_DEFAULT_PAIR_ALLOCATOR_SELECT(_STLP_CONST _Key, _Tp) >
typedef _Ht::difference_type unordered_multimap< _Key, _Tp,,, >::difference_type

Definition at line 229 of file _unordered_map.h.

◆ hasher

template<class _Key , class _Tp , _STLP_DFL_TMPL_PARAM(_HashFcn, hash< _Key >) , _STLP_DFL_TMPL_PARAM(_EqualKey, equal_to< _Key >) , _STLP_DEFAULT_PAIR_ALLOCATOR_SELECT(_STLP_CONST _Key, _Tp) >
typedef _Ht::hasher unordered_multimap< _Key, _Tp,,, >::hasher

Definition at line 225 of file _unordered_map.h.

◆ iterator

template<class _Key , class _Tp , _STLP_DFL_TMPL_PARAM(_HashFcn, hash< _Key >) , _STLP_DFL_TMPL_PARAM(_EqualKey, equal_to< _Key >) , _STLP_DEFAULT_PAIR_ALLOCATOR_SELECT(_STLP_CONST _Key, _Tp) >
typedef _Ht::iterator unordered_multimap< _Key, _Tp,,, >::iterator

Definition at line 235 of file _unordered_map.h.

◆ key_equal

template<class _Key , class _Tp , _STLP_DFL_TMPL_PARAM(_HashFcn, hash< _Key >) , _STLP_DFL_TMPL_PARAM(_EqualKey, equal_to< _Key >) , _STLP_DEFAULT_PAIR_ALLOCATOR_SELECT(_STLP_CONST _Key, _Tp) >
typedef _Ht::key_equal unordered_multimap< _Key, _Tp,,, >::key_equal

Definition at line 226 of file _unordered_map.h.

◆ key_type

template<class _Key , class _Tp , _STLP_DFL_TMPL_PARAM(_HashFcn, hash< _Key >) , _STLP_DFL_TMPL_PARAM(_EqualKey, equal_to< _Key >) , _STLP_DEFAULT_PAIR_ALLOCATOR_SELECT(_STLP_CONST _Key, _Tp) >
typedef _Key unordered_multimap< _Key, _Tp,,, >::key_type

Definition at line 213 of file _unordered_map.h.

◆ local_iterator

template<class _Key , class _Tp , _STLP_DFL_TMPL_PARAM(_HashFcn, hash< _Key >) , _STLP_DFL_TMPL_PARAM(_EqualKey, equal_to< _Key >) , _STLP_DEFAULT_PAIR_ALLOCATOR_SELECT(_STLP_CONST _Key, _Tp) >
typedef _Ht::local_iterator unordered_multimap< _Key, _Tp,,, >::local_iterator

Definition at line 237 of file _unordered_map.h.

◆ mapped_type

template<class _Key , class _Tp , _STLP_DFL_TMPL_PARAM(_HashFcn, hash< _Key >) , _STLP_DFL_TMPL_PARAM(_EqualKey, equal_to< _Key >) , _STLP_DEFAULT_PAIR_ALLOCATOR_SELECT(_STLP_CONST _Key, _Tp) >
typedef _Tp unordered_multimap< _Key, _Tp,,, >::mapped_type

Definition at line 215 of file _unordered_map.h.

◆ pointer

template<class _Key , class _Tp , _STLP_DFL_TMPL_PARAM(_HashFcn, hash< _Key >) , _STLP_DFL_TMPL_PARAM(_EqualKey, equal_to< _Key >) , _STLP_DEFAULT_PAIR_ALLOCATOR_SELECT(_STLP_CONST _Key, _Tp) >
typedef _Ht::pointer unordered_multimap< _Key, _Tp,,, >::pointer

Definition at line 230 of file _unordered_map.h.

◆ reference

template<class _Key , class _Tp , _STLP_DFL_TMPL_PARAM(_HashFcn, hash< _Key >) , _STLP_DFL_TMPL_PARAM(_EqualKey, equal_to< _Key >) , _STLP_DEFAULT_PAIR_ALLOCATOR_SELECT(_STLP_CONST _Key, _Tp) >
typedef _Ht::reference unordered_multimap< _Key, _Tp,,, >::reference

Definition at line 232 of file _unordered_map.h.

◆ size_type

template<class _Key , class _Tp , _STLP_DFL_TMPL_PARAM(_HashFcn, hash< _Key >) , _STLP_DFL_TMPL_PARAM(_EqualKey, equal_to< _Key >) , _STLP_DEFAULT_PAIR_ALLOCATOR_SELECT(_STLP_CONST _Key, _Tp) >
typedef _Ht::size_type unordered_multimap< _Key, _Tp,,, >::size_type

Definition at line 228 of file _unordered_map.h.

◆ value_type

template<class _Key , class _Tp , _STLP_DFL_TMPL_PARAM(_HashFcn, hash< _Key >) , _STLP_DFL_TMPL_PARAM(_EqualKey, equal_to< _Key >) , _STLP_DEFAULT_PAIR_ALLOCATOR_SELECT(_STLP_CONST _Key, _Tp) >
typedef pair<_STLP_CONST key_type, data_type> unordered_multimap< _Key, _Tp,,, >::value_type

Definition at line 216 of file _unordered_map.h.

Constructor & Destructor Documentation

◆ unordered_multimap() [1/4]

template<class _Key , class _Tp , _STLP_DFL_TMPL_PARAM(_HashFcn, hash< _Key >) , _STLP_DFL_TMPL_PARAM(_EqualKey, equal_to< _Key >) , _STLP_DEFAULT_PAIR_ALLOCATOR_SELECT(_STLP_CONST _Key, _Tp) >
unordered_multimap< _Key, _Tp,,, >::unordered_multimap ( size_type  __n = 0,
const hasher &  __hf = hasher(),
const key_equal &  __eql = key_equal(),
const allocator_type &  __a = allocator_type() 
)
inlineexplicit

Definition at line 251 of file _unordered_map.h.

254 : _M_ht(__n, __hf, __eql, __a) {}
__n
return __n
Definition: _algo.h:75
unordered_multimap::_M_ht
_Ht _M_ht
Definition: _unordered_map.h:247

◆ unordered_multimap() [2/4]

template<class _Key , class _Tp , _STLP_DFL_TMPL_PARAM(_HashFcn, hash< _Key >) , _STLP_DFL_TMPL_PARAM(_EqualKey, equal_to< _Key >) , _STLP_DEFAULT_PAIR_ALLOCATOR_SELECT(_STLP_CONST _Key, _Tp) >
unordered_multimap< _Key, _Tp,,, >::unordered_multimap ( __move_source< _Self >  src)
inline

Definition at line 257 of file _unordered_map.h.

258 : _M_ht(__move_source<_Ht>(src.get()._M_ht)) {}
__move_source
Definition: _move_construct_fwk.h:35
src
GLenum src
Definition: glext.h:6340

◆ unordered_multimap() [3/4]

template<class _Key , class _Tp , _STLP_DFL_TMPL_PARAM(_HashFcn, hash< _Key >) , _STLP_DFL_TMPL_PARAM(_EqualKey, equal_to< _Key >) , _STLP_DEFAULT_PAIR_ALLOCATOR_SELECT(_STLP_CONST _Key, _Tp) >
unordered_multimap< _Key, _Tp,,, >::unordered_multimap ( const value_type *  __f,
const 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 270 of file _unordered_map.h.

274 : _M_ht(__n, __hf, __eql, __a)
275 { _M_ht.insert_equal(__f, __l); }
hashtable::insert_equal
iterator insert_equal(const value_type &__obj)
Definition: _hashtable.h:412

◆ unordered_multimap() [4/4]

template<class _Key , class _Tp , _STLP_DFL_TMPL_PARAM(_HashFcn, hash< _Key >) , _STLP_DFL_TMPL_PARAM(_EqualKey, equal_to< _Key >) , _STLP_DEFAULT_PAIR_ALLOCATOR_SELECT(_STLP_CONST _Key, _Tp) >
unordered_multimap< _Key, _Tp,,, >::unordered_multimap ( const_iterator  __f,
const_iterator  __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 277 of file _unordered_map.h.

281 : _M_ht(__n, __hf, __eql, __a)
282 { _M_ht.insert_equal(__f, __l); }

Member Function Documentation

◆ begin() [1/4]

template<class _Key , class _Tp , _STLP_DFL_TMPL_PARAM(_HashFcn, hash< _Key >) , _STLP_DFL_TMPL_PARAM(_EqualKey, equal_to< _Key >) , _STLP_DEFAULT_PAIR_ALLOCATOR_SELECT(_STLP_CONST _Key, _Tp) >
iterator unordered_multimap< _Key, _Tp,,, >::begin ( )
inline

Definition at line 296 of file _unordered_map.h.

296{ return _M_ht.begin(); }
hashtable::begin
iterator begin()
Definition: _hashtable.h:376

◆ begin() [2/4]

template<class _Key , class _Tp , _STLP_DFL_TMPL_PARAM(_HashFcn, hash< _Key >) , _STLP_DFL_TMPL_PARAM(_EqualKey, equal_to< _Key >) , _STLP_DEFAULT_PAIR_ALLOCATOR_SELECT(_STLP_CONST _Key, _Tp) >
const_iterator unordered_multimap< _Key, _Tp,,, >::begin ( ) const
inline

Definition at line 298 of file _unordered_map.h.

298{ return _M_ht.begin(); }

◆ begin() [3/4]

template<class _Key , class _Tp , _STLP_DFL_TMPL_PARAM(_HashFcn, hash< _Key >) , _STLP_DFL_TMPL_PARAM(_EqualKey, equal_to< _Key >) , _STLP_DEFAULT_PAIR_ALLOCATOR_SELECT(_STLP_CONST _Key, _Tp) >
local_iterator unordered_multimap< _Key, _Tp,,, >::begin ( size_type  __n)
inline

Definition at line 340 of file _unordered_map.h.

340{ return _M_ht.begin(__n); }

◆ begin() [4/4]

template<class _Key , class _Tp , _STLP_DFL_TMPL_PARAM(_HashFcn, hash< _Key >) , _STLP_DFL_TMPL_PARAM(_EqualKey, equal_to< _Key >) , _STLP_DEFAULT_PAIR_ALLOCATOR_SELECT(_STLP_CONST _Key, _Tp) >
const_local_iterator unordered_multimap< _Key, _Tp,,, >::begin ( size_type  __n) const
inline

Definition at line 342 of file _unordered_map.h.

342{ return _M_ht.begin(__n); }

◆ bucket()

template<class _Key , class _Tp , _STLP_DFL_TMPL_PARAM(_HashFcn, hash< _Key >) , _STLP_DFL_TMPL_PARAM(_EqualKey, equal_to< _Key >) , _STLP_DEFAULT_PAIR_ALLOCATOR_SELECT(_STLP_CONST _Key, _Tp) >
_STLP_TEMPLATE_FOR_CONT_EXT size_type unordered_multimap< _Key, _Tp,,, >::bucket ( const _KT &  __k) const
inline

Definition at line 339 of file _unordered_map.h.

339{ return _M_ht.bucket(__k); }
hashtable::bucket
_STLP_TEMPLATE_FOR_CONT_EXT size_type bucket(const _KT &__k) const
Definition: _hashtable.h:397

◆ bucket_count()

template<class _Key , class _Tp , _STLP_DFL_TMPL_PARAM(_HashFcn, hash< _Key >) , _STLP_DFL_TMPL_PARAM(_EqualKey, equal_to< _Key >) , _STLP_DEFAULT_PAIR_ALLOCATOR_SELECT(_STLP_CONST _Key, _Tp) >
size_type unordered_multimap< _Key, _Tp,,, >::bucket_count ( ) const
inline

Definition at line 335 of file _unordered_map.h.

335{ return _M_ht.bucket_count(); }
hashtable::bucket_count
size_type bucket_count() const
Definition: _hashtable.h:391

◆ bucket_size()

template<class _Key , class _Tp , _STLP_DFL_TMPL_PARAM(_HashFcn, hash< _Key >) , _STLP_DFL_TMPL_PARAM(_EqualKey, equal_to< _Key >) , _STLP_DEFAULT_PAIR_ALLOCATOR_SELECT(_STLP_CONST _Key, _Tp) >
size_type unordered_multimap< _Key, _Tp,,, >::bucket_size ( size_type  __n) const
inline

Definition at line 337 of file _unordered_map.h.

337{ return _M_ht.elems_in_bucket(__n); }
hashtable::elems_in_bucket
size_type elems_in_bucket(size_type __bucket) const
Definition: _hashtable.h:393

◆ clear()

template<class _Key , class _Tp , _STLP_DFL_TMPL_PARAM(_HashFcn, hash< _Key >) , _STLP_DFL_TMPL_PARAM(_EqualKey, equal_to< _Key >) , _STLP_DEFAULT_PAIR_ALLOCATOR_SELECT(_STLP_CONST _Key, _Tp) >
void unordered_multimap< _Key, _Tp,,, >::clear ( )
inline

Definition at line 333 of file _unordered_map.h.

333{ _M_ht.clear(); }
hashtable::clear
void clear()
Definition: _hashtable.c:501

◆ count()

template<class _Key , class _Tp , _STLP_DFL_TMPL_PARAM(_HashFcn, hash< _Key >) , _STLP_DFL_TMPL_PARAM(_EqualKey, equal_to< _Key >) , _STLP_DEFAULT_PAIR_ALLOCATOR_SELECT(_STLP_CONST _Key, _Tp) >
_STLP_TEMPLATE_FOR_CONT_EXT size_type unordered_multimap< _Key, _Tp,,, >::count ( const _KT &  __key) const
inline

Definition at line 321 of file _unordered_map.h.

321{ return _M_ht.count(__key); }
hashtable::count
_STLP_TEMPLATE_FOR_CONT_EXT size_type count(const _KT &__key) const
Definition: _hashtable.h:516

◆ empty()

template<class _Key , class _Tp , _STLP_DFL_TMPL_PARAM(_HashFcn, hash< _Key >) , _STLP_DFL_TMPL_PARAM(_EqualKey, equal_to< _Key >) , _STLP_DEFAULT_PAIR_ALLOCATOR_SELECT(_STLP_CONST _Key, _Tp) >
bool unordered_multimap< _Key, _Tp,,, >::empty ( ) const
inline

Definition at line 290 of file _unordered_map.h.

290{ return _M_ht.empty(); }
hashtable::empty
bool empty() const
Definition: _hashtable.h:365

◆ end() [1/4]

template<class _Key , class _Tp , _STLP_DFL_TMPL_PARAM(_HashFcn, hash< _Key >) , _STLP_DFL_TMPL_PARAM(_EqualKey, equal_to< _Key >) , _STLP_DEFAULT_PAIR_ALLOCATOR_SELECT(_STLP_CONST _Key, _Tp) >
iterator unordered_multimap< _Key, _Tp,,, >::end ( )
inline

Definition at line 297 of file _unordered_map.h.

297{ return _M_ht.end(); }
hashtable::end
iterator end()
Definition: _hashtable.h:377

◆ end() [2/4]

template<class _Key , class _Tp , _STLP_DFL_TMPL_PARAM(_HashFcn, hash< _Key >) , _STLP_DFL_TMPL_PARAM(_EqualKey, equal_to< _Key >) , _STLP_DEFAULT_PAIR_ALLOCATOR_SELECT(_STLP_CONST _Key, _Tp) >
const_iterator unordered_multimap< _Key, _Tp,,, >::end ( ) const
inline

Definition at line 299 of file _unordered_map.h.

299{ return _M_ht.end(); }

◆ end() [3/4]

template<class _Key , class _Tp , _STLP_DFL_TMPL_PARAM(_HashFcn, hash< _Key >) , _STLP_DFL_TMPL_PARAM(_EqualKey, equal_to< _Key >) , _STLP_DEFAULT_PAIR_ALLOCATOR_SELECT(_STLP_CONST _Key, _Tp) >
local_iterator unordered_multimap< _Key, _Tp,,, >::end ( size_type  __n)
inline

Definition at line 341 of file _unordered_map.h.

341{ return _M_ht.end(__n); }

◆ end() [4/4]

template<class _Key , class _Tp , _STLP_DFL_TMPL_PARAM(_HashFcn, hash< _Key >) , _STLP_DFL_TMPL_PARAM(_EqualKey, equal_to< _Key >) , _STLP_DEFAULT_PAIR_ALLOCATOR_SELECT(_STLP_CONST _Key, _Tp) >
const_local_iterator unordered_multimap< _Key, _Tp,,, >::end ( size_type  __n) const
inline

Definition at line 343 of file _unordered_map.h.

343{ return _M_ht.end(__n); }

◆ equal_range() [1/2]

template<class _Key , class _Tp , _STLP_DFL_TMPL_PARAM(_HashFcn, hash< _Key >) , _STLP_DFL_TMPL_PARAM(_EqualKey, equal_to< _Key >) , _STLP_DEFAULT_PAIR_ALLOCATOR_SELECT(_STLP_CONST _Key, _Tp) >
_STLP_TEMPLATE_FOR_CONT_EXT pair< iterator, iterator > unordered_multimap< _Key, _Tp,,, >::equal_range ( const _KT &  __key)
inline

Definition at line 324 of file _unordered_map.h.

325 { return _M_ht.equal_range(__key); }
hashtable::equal_range
_STLP_TEMPLATE_FOR_CONT_EXT pair< iterator, iterator > equal_range(const _KT &__key)
Definition: _hashtable.h:534

◆ equal_range() [2/2]

template<class _Key , class _Tp , _STLP_DFL_TMPL_PARAM(_HashFcn, hash< _Key >) , _STLP_DFL_TMPL_PARAM(_EqualKey, equal_to< _Key >) , _STLP_DEFAULT_PAIR_ALLOCATOR_SELECT(_STLP_CONST _Key, _Tp) >
_STLP_TEMPLATE_FOR_CONT_EXT pair< const_iterator, const_iterator > unordered_multimap< _Key, _Tp,,, >::equal_range ( const _KT &  __key) const
inline

Definition at line 327 of file _unordered_map.h.

328 { return _M_ht.equal_range(__key); }

◆ erase() [1/3]

template<class _Key , class _Tp , _STLP_DFL_TMPL_PARAM(_HashFcn, hash< _Key >) , _STLP_DFL_TMPL_PARAM(_EqualKey, equal_to< _Key >) , _STLP_DEFAULT_PAIR_ALLOCATOR_SELECT(_STLP_CONST _Key, _Tp) >
size_type unordered_multimap< _Key, _Tp,,, >::erase ( const key_type &  __key)
inline

Definition at line 330 of file _unordered_map.h.

330{return _M_ht.erase(__key); }
hashtable::erase
size_type erase(const key_type &__key)
Definition: _hashtable.c:263

◆ erase() [2/3]

template<class _Key , class _Tp , _STLP_DFL_TMPL_PARAM(_HashFcn, hash< _Key >) , _STLP_DFL_TMPL_PARAM(_EqualKey, equal_to< _Key >) , _STLP_DEFAULT_PAIR_ALLOCATOR_SELECT(_STLP_CONST _Key, _Tp) >
void unordered_multimap< _Key, _Tp,,, >::erase ( const_iterator  __f,
const_iterator  __l 
)
inline

Definition at line 332 of file _unordered_map.h.

332{ _M_ht.erase(__f, __l); }

◆ erase() [3/3]

template<class _Key , class _Tp , _STLP_DFL_TMPL_PARAM(_HashFcn, hash< _Key >) , _STLP_DFL_TMPL_PARAM(_EqualKey, equal_to< _Key >) , _STLP_DEFAULT_PAIR_ALLOCATOR_SELECT(_STLP_CONST _Key, _Tp) >
void unordered_multimap< _Key, _Tp,,, >::erase ( const_iterator  __it)
inline

Definition at line 331 of file _unordered_map.h.

331{ _M_ht.erase(__it); }
__it
_STLP_MOVE_TO_PRIV_NAMESPACE const _InputIterator const input_iterator_tag &_InputIterator __it(__first)

◆ find() [1/2]

template<class _Key , class _Tp , _STLP_DFL_TMPL_PARAM(_HashFcn, hash< _Key >) , _STLP_DFL_TMPL_PARAM(_EqualKey, equal_to< _Key >) , _STLP_DEFAULT_PAIR_ALLOCATOR_SELECT(_STLP_CONST _Key, _Tp) >
_STLP_TEMPLATE_FOR_CONT_EXT iterator unordered_multimap< _Key, _Tp,,, >::find ( const _KT &  __key)
inline

Definition at line 316 of file _unordered_map.h.

316{ return _M_ht.find(__key); }
hashtable::find
_STLP_TEMPLATE_FOR_CONT_EXT iterator find(const _KT &__key)
Definition: _hashtable.h:511

◆ find() [2/2]

template<class _Key , class _Tp , _STLP_DFL_TMPL_PARAM(_HashFcn, hash< _Key >) , _STLP_DFL_TMPL_PARAM(_EqualKey, equal_to< _Key >) , _STLP_DEFAULT_PAIR_ALLOCATOR_SELECT(_STLP_CONST _Key, _Tp) >
_STLP_TEMPLATE_FOR_CONT_EXT const_iterator unordered_multimap< _Key, _Tp,,, >::find ( const _KT &  __key) const
inline

Definition at line 318 of file _unordered_map.h.

318{ return _M_ht.find(__key); }

◆ get_allocator()

template<class _Key , class _Tp , _STLP_DFL_TMPL_PARAM(_HashFcn, hash< _Key >) , _STLP_DFL_TMPL_PARAM(_EqualKey, equal_to< _Key >) , _STLP_DEFAULT_PAIR_ALLOCATOR_SELECT(_STLP_CONST _Key, _Tp) >
allocator_type unordered_multimap< _Key, _Tp,,, >::get_allocator ( ) const
inline

Definition at line 244 of file _unordered_map.h.

244{ return _M_ht.get_allocator(); }
hashtable::get_allocator
allocator_type get_allocator() const
Definition: _hashtable.h:300

◆ hash_function()

template<class _Key , class _Tp , _STLP_DFL_TMPL_PARAM(_HashFcn, hash< _Key >) , _STLP_DFL_TMPL_PARAM(_EqualKey, equal_to< _Key >) , _STLP_DEFAULT_PAIR_ALLOCATOR_SELECT(_STLP_CONST _Key, _Tp) >
hasher unordered_multimap< _Key, _Tp,,, >::hash_function ( ) const
inline

Definition at line 242 of file _unordered_map.h.

242{ return _M_ht.hash_funct(); }
hashtable::hash_funct
hasher hash_funct() const
Definition: _hashtable.h:246

◆ insert() [1/4]

template<class _Key , class _Tp , _STLP_DFL_TMPL_PARAM(_HashFcn, hash< _Key >) , _STLP_DFL_TMPL_PARAM(_EqualKey, equal_to< _Key >) , _STLP_DEFAULT_PAIR_ALLOCATOR_SELECT(_STLP_CONST _Key, _Tp) >
iterator unordered_multimap< _Key, _Tp,,, >::insert ( const value_type &  __obj)
inline

Definition at line 301 of file _unordered_map.h.

302 { return _M_ht.insert_equal(__obj); }

◆ insert() [2/4]

template<class _Key , class _Tp , _STLP_DFL_TMPL_PARAM(_HashFcn, hash< _Key >) , _STLP_DFL_TMPL_PARAM(_EqualKey, equal_to< _Key >) , _STLP_DEFAULT_PAIR_ALLOCATOR_SELECT(_STLP_CONST _Key, _Tp) >
void unordered_multimap< _Key, _Tp,,, >::insert ( const value_type *  __f,
const value_type *  __l 
)
inline

Definition at line 309 of file _unordered_map.h.

310 { _M_ht.insert_equal(__f,__l); }

◆ insert() [3/4]

template<class _Key , class _Tp , _STLP_DFL_TMPL_PARAM(_HashFcn, hash< _Key >) , _STLP_DFL_TMPL_PARAM(_EqualKey, equal_to< _Key >) , _STLP_DEFAULT_PAIR_ALLOCATOR_SELECT(_STLP_CONST _Key, _Tp) >
void unordered_multimap< _Key, _Tp,,, >::insert ( const_iterator  __f,
const_iterator  __l 
)
inline

Definition at line 311 of file _unordered_map.h.

313 { _M_ht.insert_equal(__f, __l); }

◆ insert() [4/4]

template<class _Key , class _Tp , _STLP_DFL_TMPL_PARAM(_HashFcn, hash< _Key >) , _STLP_DFL_TMPL_PARAM(_EqualKey, equal_to< _Key >) , _STLP_DEFAULT_PAIR_ALLOCATOR_SELECT(_STLP_CONST _Key, _Tp) >
iterator unordered_multimap< _Key, _Tp,,, >::insert ( const_iterator  ,
const value_type &  __obj 
)
inline

Definition at line 303 of file _unordered_map.h.

304 { return _M_ht.insert_equal(__obj); }

◆ key_eq()

template<class _Key , class _Tp , _STLP_DFL_TMPL_PARAM(_HashFcn, hash< _Key >) , _STLP_DFL_TMPL_PARAM(_EqualKey, equal_to< _Key >) , _STLP_DEFAULT_PAIR_ALLOCATOR_SELECT(_STLP_CONST _Key, _Tp) >
key_equal unordered_multimap< _Key, _Tp,,, >::key_eq ( ) const
inline

Definition at line 243 of file _unordered_map.h.

243{ return _M_ht.key_eq(); }
hashtable::key_eq
key_equal key_eq() const
Definition: _hashtable.h:247

◆ load_factor()

template<class _Key , class _Tp , _STLP_DFL_TMPL_PARAM(_HashFcn, hash< _Key >) , _STLP_DFL_TMPL_PARAM(_EqualKey, equal_to< _Key >) , _STLP_DEFAULT_PAIR_ALLOCATOR_SELECT(_STLP_CONST _Key, _Tp) >
float unordered_multimap< _Key, _Tp,,, >::load_factor ( ) const
inline

Definition at line 345 of file _unordered_map.h.

345{ return _M_ht.load_factor(); }
hashtable::load_factor
float load_factor() const
Definition: _hashtable.h:400

◆ max_bucket_count()

template<class _Key , class _Tp , _STLP_DFL_TMPL_PARAM(_HashFcn, hash< _Key >) , _STLP_DFL_TMPL_PARAM(_EqualKey, equal_to< _Key >) , _STLP_DEFAULT_PAIR_ALLOCATOR_SELECT(_STLP_CONST _Key, _Tp) >
size_type unordered_multimap< _Key, _Tp,,, >::max_bucket_count ( ) const
inline

Definition at line 336 of file _unordered_map.h.

336{ return _M_ht.max_bucket_count(); }
hashtable::max_bucket_count
size_type max_bucket_count() const
Definition: _hashtable.h:392

◆ max_load_factor() [1/2]

template<class _Key , class _Tp , _STLP_DFL_TMPL_PARAM(_HashFcn, hash< _Key >) , _STLP_DFL_TMPL_PARAM(_EqualKey, equal_to< _Key >) , _STLP_DEFAULT_PAIR_ALLOCATOR_SELECT(_STLP_CONST _Key, _Tp) >
float unordered_multimap< _Key, _Tp,,, >::max_load_factor ( ) const
inline

Definition at line 346 of file _unordered_map.h.

346{ return _M_ht.max_load_factor(); }
hashtable::max_load_factor
float max_load_factor() const
Definition: _hashtable.h:401

◆ max_load_factor() [2/2]

template<class _Key , class _Tp , _STLP_DFL_TMPL_PARAM(_HashFcn, hash< _Key >) , _STLP_DFL_TMPL_PARAM(_EqualKey, equal_to< _Key >) , _STLP_DEFAULT_PAIR_ALLOCATOR_SELECT(_STLP_CONST _Key, _Tp) >
void unordered_multimap< _Key, _Tp,,, >::max_load_factor ( float  __val)
inline

Definition at line 347 of file _unordered_map.h.

347{ _M_ht.max_load_factor(__val); }
__val
_STLP_INLINE_LOOP _InputIter const _Tp & __val
Definition: _algobase.h:656

◆ max_size()

template<class _Key , class _Tp , _STLP_DFL_TMPL_PARAM(_HashFcn, hash< _Key >) , _STLP_DFL_TMPL_PARAM(_EqualKey, equal_to< _Key >) , _STLP_DEFAULT_PAIR_ALLOCATOR_SELECT(_STLP_CONST _Key, _Tp) >
size_type unordered_multimap< _Key, _Tp,,, >::max_size ( ) const
inline

Definition at line 289 of file _unordered_map.h.

289{ return _M_ht.max_size(); }
hashtable::max_size
size_type max_size() const
Definition: _hashtable.h:364

◆ operator=()

template<class _Key , class _Tp , _STLP_DFL_TMPL_PARAM(_HashFcn, hash< _Key >) , _STLP_DFL_TMPL_PARAM(_EqualKey, equal_to< _Key >) , _STLP_DEFAULT_PAIR_ALLOCATOR_SELECT(_STLP_CONST _Key, _Tp) >
_Self & unordered_multimap< _Key, _Tp,,, >::operator= ( const _Self &  __other)
inline

Definition at line 285 of file _unordered_map.h.

286 { _M_ht = __other._M_ht; return *this; }

◆ rehash()

template<class _Key , class _Tp , _STLP_DFL_TMPL_PARAM(_HashFcn, hash< _Key >) , _STLP_DFL_TMPL_PARAM(_EqualKey, equal_to< _Key >) , _STLP_DEFAULT_PAIR_ALLOCATOR_SELECT(_STLP_CONST _Key, _Tp) >
void unordered_multimap< _Key, _Tp,,, >::rehash ( size_type  __hint)
inline

Definition at line 348 of file _unordered_map.h.

348{ _M_ht.rehash(__hint); }
hashtable::rehash
void rehash(size_type __num_buckets_hint)
Definition: _hashtable.c:365

◆ size()

template<class _Key , class _Tp , _STLP_DFL_TMPL_PARAM(_HashFcn, hash< _Key >) , _STLP_DFL_TMPL_PARAM(_EqualKey, equal_to< _Key >) , _STLP_DEFAULT_PAIR_ALLOCATOR_SELECT(_STLP_CONST _Key, _Tp) >
size_type unordered_multimap< _Key, _Tp,,, >::size ( ) const
inline

Definition at line 288 of file _unordered_map.h.

288{ return _M_ht.size(); }
hashtable::size
size_type size() const
Definition: _hashtable.h:363

◆ swap()

template<class _Key , class _Tp , _STLP_DFL_TMPL_PARAM(_HashFcn, hash< _Key >) , _STLP_DFL_TMPL_PARAM(_EqualKey, equal_to< _Key >) , _STLP_DEFAULT_PAIR_ALLOCATOR_SELECT(_STLP_CONST _Key, _Tp) >
void unordered_multimap< _Key, _Tp,,, >::swap ( _Self &  __hs)
inline

Definition at line 291 of file _unordered_map.h.

291{ _M_ht.swap(__hs._M_ht); }
hashtable::swap
void swap(_Self &__ht)
Definition: _hashtable.h:367

Member Data Documentation

◆ _M_ht

template<class _Key , class _Tp , _STLP_DFL_TMPL_PARAM(_HashFcn, hash< _Key >) , _STLP_DFL_TMPL_PARAM(_EqualKey, equal_to< _Key >) , _STLP_DEFAULT_PAIR_ALLOCATOR_SELECT(_STLP_CONST _Key, _Tp) >
_Ht unordered_multimap< _Key, _Tp,,, >::_M_ht
private

Definition at line 247 of file _unordered_map.h.

Referenced by unordered_multimap< _Key, _Tp,,, >::begin(), unordered_multimap< _Key, _Tp,,, >::bucket(), unordered_multimap< _Key, _Tp,,, >::bucket_count(), unordered_multimap< _Key, _Tp,,, >::bucket_size(), unordered_multimap< _Key, _Tp,,, >::clear(), unordered_multimap< _Key, _Tp,,, >::count(), unordered_multimap< _Key, _Tp,,, >::empty(), unordered_multimap< _Key, _Tp,,, >::end(), unordered_multimap< _Key, _Tp,,, >::equal_range(), unordered_multimap< _Key, _Tp,,, >::erase(), unordered_multimap< _Key, _Tp,,, >::find(), unordered_multimap< _Key, _Tp,,, >::get_allocator(), unordered_multimap< _Key, _Tp,,, >::hash_function(), unordered_multimap< _Key, _Tp,,, >::insert(), unordered_multimap< _Key, _Tp,,, >::key_eq(), unordered_multimap< _Key, _Tp,,, >::load_factor(), unordered_multimap< _Key, _Tp,,, >::max_bucket_count(), unordered_multimap< _Key, _Tp,,, >::max_load_factor(), unordered_multimap< _Key, _Tp,,, >::max_size(), unordered_multimap< _Key, _Tp,,, >::operator=(), unordered_multimap< _Key, _Tp,,, >::rehash(), unordered_multimap< _Key, _Tp,,, >::size(), unordered_multimap< _Key, _Tp,,, >::swap(), and unordered_multimap< _Key, _Tp,,, >::unordered_multimap().

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