ReactOS 0.4.16-dev-197-g92996da
Public Types | Public Member Functions | Private Types | Private Attributes | List of all members
unordered_multiset< _Value,,, > Class Template Reference

#include <_unordered_set.h>

Collaboration diagram for unordered_multiset< _Value,,, >:
Collaboration graph
[legend]

Public Types

typedef hashtable< _Value, _Value, _HashFcn, _UnorderedMultisetTraits, _STLP_PRIV _Identity< _Value >, _EqualKey, _Alloc > _Ht
 
typedef _Ht::key_type key_type
 
typedef _Ht::value_type value_type
 
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_multiset (size_type __n=0, const hasher &__hf=hasher(), const key_equal &__eql=key_equal(), const allocator_type &__a=allocator_type())
 
 unordered_multiset (__move_source< _Self > src)
 
 unordered_multiset (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_multiset (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_multiset< _Value, _HashFcn, _EqualKey, _Alloc > _Self
 
typedef _STLP_PRIV _UnorderedMultisetTraitsT< _Value > _UnorderedMultisetTraits
 

Private Attributes

_Ht _M_ht
 

Detailed Description

template<class _Value, _STLP_DFL_TMPL_PARAM(_HashFcn, hash< _Value >), _STLP_DFL_TMPL_PARAM(_EqualKey, equal_to< _Value >), _STLP_DFL_TMPL_PARAM(_Alloc, allocator< _Value >)>
class unordered_multiset< _Value,,, >

Definition at line 187 of file _unordered_set.h.

Member Typedef Documentation

◆ _Ht

template<class _Value , _STLP_DFL_TMPL_PARAM(_HashFcn, hash< _Value >) , _STLP_DFL_TMPL_PARAM(_EqualKey, equal_to< _Value >) , _STLP_DFL_TMPL_PARAM(_Alloc, allocator< _Value >) >
typedef hashtable<_Value, _Value, _HashFcn, _UnorderedMultisetTraits, _STLP_PRIV _Identity<_Value>, _EqualKey, _Alloc> unordered_multiset< _Value,,, >::_Ht

Definition at line 197 of file _unordered_set.h.

◆ _Self

template<class _Value , _STLP_DFL_TMPL_PARAM(_HashFcn, hash< _Value >) , _STLP_DFL_TMPL_PARAM(_EqualKey, equal_to< _Value >) , _STLP_DFL_TMPL_PARAM(_Alloc, allocator< _Value >) >
typedef unordered_multiset<_Value, _HashFcn, _EqualKey, _Alloc> unordered_multiset< _Value,,, >::_Self
private

Definition at line 192 of file _unordered_set.h.

◆ _UnorderedMultisetTraits

template<class _Value , _STLP_DFL_TMPL_PARAM(_HashFcn, hash< _Value >) , _STLP_DFL_TMPL_PARAM(_EqualKey, equal_to< _Value >) , _STLP_DFL_TMPL_PARAM(_Alloc, allocator< _Value >) >
typedef _STLP_PRIV _UnorderedMultisetTraitsT<_Value> unordered_multiset< _Value,,, >::_UnorderedMultisetTraits
private

Definition at line 194 of file _unordered_set.h.

◆ allocator_type

template<class _Value , _STLP_DFL_TMPL_PARAM(_HashFcn, hash< _Value >) , _STLP_DFL_TMPL_PARAM(_EqualKey, equal_to< _Value >) , _STLP_DFL_TMPL_PARAM(_Alloc, allocator< _Value >) >
typedef _Ht::allocator_type unordered_multiset< _Value,,, >::allocator_type

Definition at line 216 of file _unordered_set.h.

◆ const_iterator

template<class _Value , _STLP_DFL_TMPL_PARAM(_HashFcn, hash< _Value >) , _STLP_DFL_TMPL_PARAM(_EqualKey, equal_to< _Value >) , _STLP_DFL_TMPL_PARAM(_Alloc, allocator< _Value >) >
typedef _Ht::const_iterator unordered_multiset< _Value,,, >::const_iterator

Definition at line 212 of file _unordered_set.h.

◆ const_local_iterator

template<class _Value , _STLP_DFL_TMPL_PARAM(_HashFcn, hash< _Value >) , _STLP_DFL_TMPL_PARAM(_EqualKey, equal_to< _Value >) , _STLP_DFL_TMPL_PARAM(_Alloc, allocator< _Value >) >
typedef _Ht::const_local_iterator unordered_multiset< _Value,,, >::const_local_iterator

Definition at line 214 of file _unordered_set.h.

◆ const_pointer

template<class _Value , _STLP_DFL_TMPL_PARAM(_HashFcn, hash< _Value >) , _STLP_DFL_TMPL_PARAM(_EqualKey, equal_to< _Value >) , _STLP_DFL_TMPL_PARAM(_Alloc, allocator< _Value >) >
typedef _Ht::const_pointer unordered_multiset< _Value,,, >::const_pointer

Definition at line 207 of file _unordered_set.h.

◆ const_reference

template<class _Value , _STLP_DFL_TMPL_PARAM(_HashFcn, hash< _Value >) , _STLP_DFL_TMPL_PARAM(_EqualKey, equal_to< _Value >) , _STLP_DFL_TMPL_PARAM(_Alloc, allocator< _Value >) >
typedef _Ht::const_reference unordered_multiset< _Value,,, >::const_reference

Definition at line 209 of file _unordered_set.h.

◆ difference_type

template<class _Value , _STLP_DFL_TMPL_PARAM(_HashFcn, hash< _Value >) , _STLP_DFL_TMPL_PARAM(_EqualKey, equal_to< _Value >) , _STLP_DFL_TMPL_PARAM(_Alloc, allocator< _Value >) >
typedef _Ht::difference_type unordered_multiset< _Value,,, >::difference_type

Definition at line 205 of file _unordered_set.h.

◆ hasher

template<class _Value , _STLP_DFL_TMPL_PARAM(_HashFcn, hash< _Value >) , _STLP_DFL_TMPL_PARAM(_EqualKey, equal_to< _Value >) , _STLP_DFL_TMPL_PARAM(_Alloc, allocator< _Value >) >
typedef _Ht::hasher unordered_multiset< _Value,,, >::hasher

Definition at line 201 of file _unordered_set.h.

◆ iterator

template<class _Value , _STLP_DFL_TMPL_PARAM(_HashFcn, hash< _Value >) , _STLP_DFL_TMPL_PARAM(_EqualKey, equal_to< _Value >) , _STLP_DFL_TMPL_PARAM(_Alloc, allocator< _Value >) >
typedef _Ht::iterator unordered_multiset< _Value,,, >::iterator

Definition at line 211 of file _unordered_set.h.

◆ key_equal

template<class _Value , _STLP_DFL_TMPL_PARAM(_HashFcn, hash< _Value >) , _STLP_DFL_TMPL_PARAM(_EqualKey, equal_to< _Value >) , _STLP_DFL_TMPL_PARAM(_Alloc, allocator< _Value >) >
typedef _Ht::key_equal unordered_multiset< _Value,,, >::key_equal

Definition at line 202 of file _unordered_set.h.

◆ key_type

template<class _Value , _STLP_DFL_TMPL_PARAM(_HashFcn, hash< _Value >) , _STLP_DFL_TMPL_PARAM(_EqualKey, equal_to< _Value >) , _STLP_DFL_TMPL_PARAM(_Alloc, allocator< _Value >) >
typedef _Ht::key_type unordered_multiset< _Value,,, >::key_type

Definition at line 199 of file _unordered_set.h.

◆ local_iterator

template<class _Value , _STLP_DFL_TMPL_PARAM(_HashFcn, hash< _Value >) , _STLP_DFL_TMPL_PARAM(_EqualKey, equal_to< _Value >) , _STLP_DFL_TMPL_PARAM(_Alloc, allocator< _Value >) >
typedef _Ht::local_iterator unordered_multiset< _Value,,, >::local_iterator

Definition at line 213 of file _unordered_set.h.

◆ pointer

template<class _Value , _STLP_DFL_TMPL_PARAM(_HashFcn, hash< _Value >) , _STLP_DFL_TMPL_PARAM(_EqualKey, equal_to< _Value >) , _STLP_DFL_TMPL_PARAM(_Alloc, allocator< _Value >) >
typedef _Ht::pointer unordered_multiset< _Value,,, >::pointer

Definition at line 206 of file _unordered_set.h.

◆ reference

template<class _Value , _STLP_DFL_TMPL_PARAM(_HashFcn, hash< _Value >) , _STLP_DFL_TMPL_PARAM(_EqualKey, equal_to< _Value >) , _STLP_DFL_TMPL_PARAM(_Alloc, allocator< _Value >) >
typedef _Ht::reference unordered_multiset< _Value,,, >::reference

Definition at line 208 of file _unordered_set.h.

◆ size_type

template<class _Value , _STLP_DFL_TMPL_PARAM(_HashFcn, hash< _Value >) , _STLP_DFL_TMPL_PARAM(_EqualKey, equal_to< _Value >) , _STLP_DFL_TMPL_PARAM(_Alloc, allocator< _Value >) >
typedef _Ht::size_type unordered_multiset< _Value,,, >::size_type

Definition at line 204 of file _unordered_set.h.

◆ value_type

template<class _Value , _STLP_DFL_TMPL_PARAM(_HashFcn, hash< _Value >) , _STLP_DFL_TMPL_PARAM(_EqualKey, equal_to< _Value >) , _STLP_DFL_TMPL_PARAM(_Alloc, allocator< _Value >) >
typedef _Ht::value_type unordered_multiset< _Value,,, >::value_type

Definition at line 200 of file _unordered_set.h.

Constructor & Destructor Documentation

◆ unordered_multiset() [1/4]

template<class _Value , _STLP_DFL_TMPL_PARAM(_HashFcn, hash< _Value >) , _STLP_DFL_TMPL_PARAM(_EqualKey, equal_to< _Value >) , _STLP_DFL_TMPL_PARAM(_Alloc, allocator< _Value >) >
unordered_multiset< _Value,,, >::unordered_multiset ( size_type  __n = 0,
const hasher &  __hf = hasher(),
const key_equal &  __eql = key_equal(),
const allocator_type &  __a = allocator_type() 
)
inlineexplicit

Definition at line 227 of file _unordered_set.h.

230 : _M_ht(__n, __hf, __eql, __a) {}
__n
return __n
Definition: _algo.h:75
unordered_multiset::_M_ht
_Ht _M_ht
Definition: _unordered_set.h:223

◆ unordered_multiset() [2/4]

template<class _Value , _STLP_DFL_TMPL_PARAM(_HashFcn, hash< _Value >) , _STLP_DFL_TMPL_PARAM(_EqualKey, equal_to< _Value >) , _STLP_DFL_TMPL_PARAM(_Alloc, allocator< _Value >) >
unordered_multiset< _Value,,, >::unordered_multiset ( __move_source< _Self >  src)
inline

Definition at line 233 of file _unordered_set.h.

234 : _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_multiset() [3/4]

template<class _Value , _STLP_DFL_TMPL_PARAM(_HashFcn, hash< _Value >) , _STLP_DFL_TMPL_PARAM(_EqualKey, equal_to< _Value >) , _STLP_DFL_TMPL_PARAM(_Alloc, allocator< _Value >) >
unordered_multiset< _Value,,, >::unordered_multiset ( 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 246 of file _unordered_set.h.

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

◆ unordered_multiset() [4/4]

template<class _Value , _STLP_DFL_TMPL_PARAM(_HashFcn, hash< _Value >) , _STLP_DFL_TMPL_PARAM(_EqualKey, equal_to< _Value >) , _STLP_DFL_TMPL_PARAM(_Alloc, allocator< _Value >) >
unordered_multiset< _Value,,, >::unordered_multiset ( 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 253 of file _unordered_set.h.

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

Member Function Documentation

◆ begin() [1/4]

template<class _Value , _STLP_DFL_TMPL_PARAM(_HashFcn, hash< _Value >) , _STLP_DFL_TMPL_PARAM(_EqualKey, equal_to< _Value >) , _STLP_DFL_TMPL_PARAM(_Alloc, allocator< _Value >) >
iterator unordered_multiset< _Value,,, >::begin ( )
inline

Definition at line 272 of file _unordered_set.h.

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

◆ begin() [2/4]

template<class _Value , _STLP_DFL_TMPL_PARAM(_HashFcn, hash< _Value >) , _STLP_DFL_TMPL_PARAM(_EqualKey, equal_to< _Value >) , _STLP_DFL_TMPL_PARAM(_Alloc, allocator< _Value >) >
const_iterator unordered_multiset< _Value,,, >::begin ( ) const
inline

Definition at line 274 of file _unordered_set.h.

274{ return _M_ht.begin(); }

◆ begin() [3/4]

template<class _Value , _STLP_DFL_TMPL_PARAM(_HashFcn, hash< _Value >) , _STLP_DFL_TMPL_PARAM(_EqualKey, equal_to< _Value >) , _STLP_DFL_TMPL_PARAM(_Alloc, allocator< _Value >) >
local_iterator unordered_multiset< _Value,,, >::begin ( size_type  __n)
inline

Definition at line 316 of file _unordered_set.h.

316{ return _M_ht.begin(__n); }

◆ begin() [4/4]

template<class _Value , _STLP_DFL_TMPL_PARAM(_HashFcn, hash< _Value >) , _STLP_DFL_TMPL_PARAM(_EqualKey, equal_to< _Value >) , _STLP_DFL_TMPL_PARAM(_Alloc, allocator< _Value >) >
const_local_iterator unordered_multiset< _Value,,, >::begin ( size_type  __n) const
inline

Definition at line 318 of file _unordered_set.h.

318{ return _M_ht.begin(__n); }

◆ bucket()

template<class _Value , _STLP_DFL_TMPL_PARAM(_HashFcn, hash< _Value >) , _STLP_DFL_TMPL_PARAM(_EqualKey, equal_to< _Value >) , _STLP_DFL_TMPL_PARAM(_Alloc, allocator< _Value >) >
_STLP_TEMPLATE_FOR_CONT_EXT size_type unordered_multiset< _Value,,, >::bucket ( const _KT &  __k) const
inline

Definition at line 315 of file _unordered_set.h.

315{ 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 _Value , _STLP_DFL_TMPL_PARAM(_HashFcn, hash< _Value >) , _STLP_DFL_TMPL_PARAM(_EqualKey, equal_to< _Value >) , _STLP_DFL_TMPL_PARAM(_Alloc, allocator< _Value >) >
size_type unordered_multiset< _Value,,, >::bucket_count ( ) const
inline

Definition at line 311 of file _unordered_set.h.

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

◆ bucket_size()

template<class _Value , _STLP_DFL_TMPL_PARAM(_HashFcn, hash< _Value >) , _STLP_DFL_TMPL_PARAM(_EqualKey, equal_to< _Value >) , _STLP_DFL_TMPL_PARAM(_Alloc, allocator< _Value >) >
size_type unordered_multiset< _Value,,, >::bucket_size ( size_type  __n) const
inline

Definition at line 313 of file _unordered_set.h.

313{ 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 _Value , _STLP_DFL_TMPL_PARAM(_HashFcn, hash< _Value >) , _STLP_DFL_TMPL_PARAM(_EqualKey, equal_to< _Value >) , _STLP_DFL_TMPL_PARAM(_Alloc, allocator< _Value >) >
void unordered_multiset< _Value,,, >::clear ( )
inline

Definition at line 309 of file _unordered_set.h.

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

◆ count()

template<class _Value , _STLP_DFL_TMPL_PARAM(_HashFcn, hash< _Value >) , _STLP_DFL_TMPL_PARAM(_EqualKey, equal_to< _Value >) , _STLP_DFL_TMPL_PARAM(_Alloc, allocator< _Value >) >
_STLP_TEMPLATE_FOR_CONT_EXT size_type unordered_multiset< _Value,,, >::count ( const _KT &  __key) const
inline

Definition at line 297 of file _unordered_set.h.

297{ 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 _Value , _STLP_DFL_TMPL_PARAM(_HashFcn, hash< _Value >) , _STLP_DFL_TMPL_PARAM(_EqualKey, equal_to< _Value >) , _STLP_DFL_TMPL_PARAM(_Alloc, allocator< _Value >) >
bool unordered_multiset< _Value,,, >::empty ( ) const
inline

Definition at line 266 of file _unordered_set.h.

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

◆ end() [1/4]

template<class _Value , _STLP_DFL_TMPL_PARAM(_HashFcn, hash< _Value >) , _STLP_DFL_TMPL_PARAM(_EqualKey, equal_to< _Value >) , _STLP_DFL_TMPL_PARAM(_Alloc, allocator< _Value >) >
iterator unordered_multiset< _Value,,, >::end ( )
inline

Definition at line 273 of file _unordered_set.h.

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

◆ end() [2/4]

template<class _Value , _STLP_DFL_TMPL_PARAM(_HashFcn, hash< _Value >) , _STLP_DFL_TMPL_PARAM(_EqualKey, equal_to< _Value >) , _STLP_DFL_TMPL_PARAM(_Alloc, allocator< _Value >) >
const_iterator unordered_multiset< _Value,,, >::end ( ) const
inline

Definition at line 275 of file _unordered_set.h.

275{ return _M_ht.end(); }

◆ end() [3/4]

template<class _Value , _STLP_DFL_TMPL_PARAM(_HashFcn, hash< _Value >) , _STLP_DFL_TMPL_PARAM(_EqualKey, equal_to< _Value >) , _STLP_DFL_TMPL_PARAM(_Alloc, allocator< _Value >) >
local_iterator unordered_multiset< _Value,,, >::end ( size_type  __n)
inline

Definition at line 317 of file _unordered_set.h.

317{ return _M_ht.end(__n); }

◆ end() [4/4]

template<class _Value , _STLP_DFL_TMPL_PARAM(_HashFcn, hash< _Value >) , _STLP_DFL_TMPL_PARAM(_EqualKey, equal_to< _Value >) , _STLP_DFL_TMPL_PARAM(_Alloc, allocator< _Value >) >
const_local_iterator unordered_multiset< _Value,,, >::end ( size_type  __n) const
inline

Definition at line 319 of file _unordered_set.h.

319{ return _M_ht.end(__n); }

◆ equal_range() [1/2]

template<class _Value , _STLP_DFL_TMPL_PARAM(_HashFcn, hash< _Value >) , _STLP_DFL_TMPL_PARAM(_EqualKey, equal_to< _Value >) , _STLP_DFL_TMPL_PARAM(_Alloc, allocator< _Value >) >
_STLP_TEMPLATE_FOR_CONT_EXT pair< iterator, iterator > unordered_multiset< _Value,,, >::equal_range ( const _KT &  __key)
inline

Definition at line 300 of file _unordered_set.h.

301 { 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 _Value , _STLP_DFL_TMPL_PARAM(_HashFcn, hash< _Value >) , _STLP_DFL_TMPL_PARAM(_EqualKey, equal_to< _Value >) , _STLP_DFL_TMPL_PARAM(_Alloc, allocator< _Value >) >
_STLP_TEMPLATE_FOR_CONT_EXT pair< const_iterator, const_iterator > unordered_multiset< _Value,,, >::equal_range ( const _KT &  __key) const
inline

Definition at line 303 of file _unordered_set.h.

304 { return _M_ht.equal_range(__key); }

◆ erase() [1/3]

template<class _Value , _STLP_DFL_TMPL_PARAM(_HashFcn, hash< _Value >) , _STLP_DFL_TMPL_PARAM(_EqualKey, equal_to< _Value >) , _STLP_DFL_TMPL_PARAM(_Alloc, allocator< _Value >) >
size_type unordered_multiset< _Value,,, >::erase ( const key_type &  __key)
inline

Definition at line 306 of file _unordered_set.h.

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

◆ erase() [2/3]

template<class _Value , _STLP_DFL_TMPL_PARAM(_HashFcn, hash< _Value >) , _STLP_DFL_TMPL_PARAM(_EqualKey, equal_to< _Value >) , _STLP_DFL_TMPL_PARAM(_Alloc, allocator< _Value >) >
void unordered_multiset< _Value,,, >::erase ( const_iterator  __f,
const_iterator  __l 
)
inline

Definition at line 308 of file _unordered_set.h.

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

◆ erase() [3/3]

template<class _Value , _STLP_DFL_TMPL_PARAM(_HashFcn, hash< _Value >) , _STLP_DFL_TMPL_PARAM(_EqualKey, equal_to< _Value >) , _STLP_DFL_TMPL_PARAM(_Alloc, allocator< _Value >) >
void unordered_multiset< _Value,,, >::erase ( const_iterator  __it)
inline

Definition at line 307 of file _unordered_set.h.

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

◆ find() [1/2]

template<class _Value , _STLP_DFL_TMPL_PARAM(_HashFcn, hash< _Value >) , _STLP_DFL_TMPL_PARAM(_EqualKey, equal_to< _Value >) , _STLP_DFL_TMPL_PARAM(_Alloc, allocator< _Value >) >
_STLP_TEMPLATE_FOR_CONT_EXT iterator unordered_multiset< _Value,,, >::find ( const _KT &  __key)
inline

Definition at line 292 of file _unordered_set.h.

292{ 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 _Value , _STLP_DFL_TMPL_PARAM(_HashFcn, hash< _Value >) , _STLP_DFL_TMPL_PARAM(_EqualKey, equal_to< _Value >) , _STLP_DFL_TMPL_PARAM(_Alloc, allocator< _Value >) >
_STLP_TEMPLATE_FOR_CONT_EXT const_iterator unordered_multiset< _Value,,, >::find ( const _KT &  __key) const
inline

Definition at line 294 of file _unordered_set.h.

294{ return _M_ht.find(__key); }

◆ get_allocator()

template<class _Value , _STLP_DFL_TMPL_PARAM(_HashFcn, hash< _Value >) , _STLP_DFL_TMPL_PARAM(_EqualKey, equal_to< _Value >) , _STLP_DFL_TMPL_PARAM(_Alloc, allocator< _Value >) >
allocator_type unordered_multiset< _Value,,, >::get_allocator ( ) const
inline

Definition at line 220 of file _unordered_set.h.

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

◆ hash_function()

template<class _Value , _STLP_DFL_TMPL_PARAM(_HashFcn, hash< _Value >) , _STLP_DFL_TMPL_PARAM(_EqualKey, equal_to< _Value >) , _STLP_DFL_TMPL_PARAM(_Alloc, allocator< _Value >) >
hasher unordered_multiset< _Value,,, >::hash_function ( ) const
inline

Definition at line 218 of file _unordered_set.h.

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

◆ insert() [1/4]

template<class _Value , _STLP_DFL_TMPL_PARAM(_HashFcn, hash< _Value >) , _STLP_DFL_TMPL_PARAM(_EqualKey, equal_to< _Value >) , _STLP_DFL_TMPL_PARAM(_Alloc, allocator< _Value >) >
iterator unordered_multiset< _Value,,, >::insert ( const value_type &  __obj)
inline

Definition at line 277 of file _unordered_set.h.

278 { return _M_ht.insert_equal(__obj); }

Referenced by UnorderedTest::template_methods().

◆ insert() [2/4]

template<class _Value , _STLP_DFL_TMPL_PARAM(_HashFcn, hash< _Value >) , _STLP_DFL_TMPL_PARAM(_EqualKey, equal_to< _Value >) , _STLP_DFL_TMPL_PARAM(_Alloc, allocator< _Value >) >
void unordered_multiset< _Value,,, >::insert ( const value_type *  __f,
const value_type *  __l 
)
inline

Definition at line 285 of file _unordered_set.h.

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

◆ insert() [3/4]

template<class _Value , _STLP_DFL_TMPL_PARAM(_HashFcn, hash< _Value >) , _STLP_DFL_TMPL_PARAM(_EqualKey, equal_to< _Value >) , _STLP_DFL_TMPL_PARAM(_Alloc, allocator< _Value >) >
void unordered_multiset< _Value,,, >::insert ( const_iterator  __f,
const_iterator  __l 
)
inline

Definition at line 287 of file _unordered_set.h.

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

◆ insert() [4/4]

template<class _Value , _STLP_DFL_TMPL_PARAM(_HashFcn, hash< _Value >) , _STLP_DFL_TMPL_PARAM(_EqualKey, equal_to< _Value >) , _STLP_DFL_TMPL_PARAM(_Alloc, allocator< _Value >) >
iterator unordered_multiset< _Value,,, >::insert ( const_iterator  ,
const value_type &  __obj 
)
inline

Definition at line 279 of file _unordered_set.h.

280 { return _M_ht.insert_equal(__obj); }

◆ key_eq()

template<class _Value , _STLP_DFL_TMPL_PARAM(_HashFcn, hash< _Value >) , _STLP_DFL_TMPL_PARAM(_EqualKey, equal_to< _Value >) , _STLP_DFL_TMPL_PARAM(_Alloc, allocator< _Value >) >
key_equal unordered_multiset< _Value,,, >::key_eq ( ) const
inline

Definition at line 219 of file _unordered_set.h.

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

◆ load_factor()

template<class _Value , _STLP_DFL_TMPL_PARAM(_HashFcn, hash< _Value >) , _STLP_DFL_TMPL_PARAM(_EqualKey, equal_to< _Value >) , _STLP_DFL_TMPL_PARAM(_Alloc, allocator< _Value >) >
float unordered_multiset< _Value,,, >::load_factor ( ) const
inline

Definition at line 321 of file _unordered_set.h.

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

◆ max_bucket_count()

template<class _Value , _STLP_DFL_TMPL_PARAM(_HashFcn, hash< _Value >) , _STLP_DFL_TMPL_PARAM(_EqualKey, equal_to< _Value >) , _STLP_DFL_TMPL_PARAM(_Alloc, allocator< _Value >) >
size_type unordered_multiset< _Value,,, >::max_bucket_count ( ) const
inline

Definition at line 312 of file _unordered_set.h.

312{ 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 _Value , _STLP_DFL_TMPL_PARAM(_HashFcn, hash< _Value >) , _STLP_DFL_TMPL_PARAM(_EqualKey, equal_to< _Value >) , _STLP_DFL_TMPL_PARAM(_Alloc, allocator< _Value >) >
float unordered_multiset< _Value,,, >::max_load_factor ( ) const
inline

Definition at line 322 of file _unordered_set.h.

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

Referenced by UnorderedTest::benchmark1(), UnorderedTest::benchmark2(), and UnorderedTest::equal_range().

◆ max_load_factor() [2/2]

template<class _Value , _STLP_DFL_TMPL_PARAM(_HashFcn, hash< _Value >) , _STLP_DFL_TMPL_PARAM(_EqualKey, equal_to< _Value >) , _STLP_DFL_TMPL_PARAM(_Alloc, allocator< _Value >) >
void unordered_multiset< _Value,,, >::max_load_factor ( float  __val)
inline

Definition at line 323 of file _unordered_set.h.

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

◆ max_size()

template<class _Value , _STLP_DFL_TMPL_PARAM(_HashFcn, hash< _Value >) , _STLP_DFL_TMPL_PARAM(_EqualKey, equal_to< _Value >) , _STLP_DFL_TMPL_PARAM(_Alloc, allocator< _Value >) >
size_type unordered_multiset< _Value,,, >::max_size ( ) const
inline

Definition at line 265 of file _unordered_set.h.

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

◆ operator=()

template<class _Value , _STLP_DFL_TMPL_PARAM(_HashFcn, hash< _Value >) , _STLP_DFL_TMPL_PARAM(_EqualKey, equal_to< _Value >) , _STLP_DFL_TMPL_PARAM(_Alloc, allocator< _Value >) >
_Self & unordered_multiset< _Value,,, >::operator= ( const _Self &  __other)
inline

Definition at line 261 of file _unordered_set.h.

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

◆ rehash()

template<class _Value , _STLP_DFL_TMPL_PARAM(_HashFcn, hash< _Value >) , _STLP_DFL_TMPL_PARAM(_EqualKey, equal_to< _Value >) , _STLP_DFL_TMPL_PARAM(_Alloc, allocator< _Value >) >
void unordered_multiset< _Value,,, >::rehash ( size_type  __hint)
inline

Definition at line 324 of file _unordered_set.h.

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

◆ size()

template<class _Value , _STLP_DFL_TMPL_PARAM(_HashFcn, hash< _Value >) , _STLP_DFL_TMPL_PARAM(_EqualKey, equal_to< _Value >) , _STLP_DFL_TMPL_PARAM(_Alloc, allocator< _Value >) >
size_type unordered_multiset< _Value,,, >::size ( ) const
inline

Definition at line 264 of file _unordered_set.h.

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

◆ swap()

template<class _Value , _STLP_DFL_TMPL_PARAM(_HashFcn, hash< _Value >) , _STLP_DFL_TMPL_PARAM(_EqualKey, equal_to< _Value >) , _STLP_DFL_TMPL_PARAM(_Alloc, allocator< _Value >) >
void unordered_multiset< _Value,,, >::swap ( _Self &  hs)
inline

Definition at line 267 of file _unordered_set.h.

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

Member Data Documentation

◆ _M_ht

template<class _Value , _STLP_DFL_TMPL_PARAM(_HashFcn, hash< _Value >) , _STLP_DFL_TMPL_PARAM(_EqualKey, equal_to< _Value >) , _STLP_DFL_TMPL_PARAM(_Alloc, allocator< _Value >) >
_Ht unordered_multiset< _Value,,, >::_M_ht
private

Definition at line 223 of file _unordered_set.h.

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

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