std::unordered_multiset (3cxx)

Public Types

typedef _Hashtable::key_type key_type

typedef _Hashtable::value_type value_type

typedef _Hashtable::hasher hasher

typedef _Hashtable::key_equal key_equal

typedef _Hashtable::allocator_type allocator_type

typedef _Hashtable::pointer pointer

typedef _Hashtable::const_pointer const_pointer

typedef _Hashtable::reference reference

typedef _Hashtable::const_reference const_reference

typedef _Hashtable::iterator iterator

typedef _Hashtable::const_iterator const_iterator

typedef _Hashtable::local_iterator local_iterator

typedef

_Hashtable::const_local_iterator const_local_iterator"

typedef _Hashtable::size_type size_type

typedef _Hashtable::difference_type difference_type

Public Member Functions

unordered_multiset (size_type __n=10, const hasher &__hf=hasher(), const key_equal &__eql=key_equal(), const allocator_type &__a=allocator_type())

template<typename _InputIterator > unordered_multiset (_InputIterator __f, _InputIterator __l, size_type __n=0, const hasher &__hf=hasher(), const key_equal &__eql=key_equal(), const allocator_type &__a=allocator_type())

unordered_multiset (const unordered_multiset &)=default

unordered_multiset (unordered_multiset &&)=default

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

unordered_multiset (const unordered_multiset &__umset, const allocator_type &__a)

unordered_multiset (unordered_multiset &&__umset, const allocator_type &__a)

size_type bucket (const key_type &__key) const

size_type bucket_count () const noexcept

size_type bucket_size (size_type __n) const

const_iterator cbegin () const noexcept

const_iterator cend () const noexcept

void clear () noexcept

size_type count (const key_type &__x) const

template<typename... _Args> iterator emplace (_Args &&...__args)

template<typename... _Args> iterator emplace_hint (const_iterator __pos, _Args &&...__args)

bool empty () const noexcept

size_type erase (const key_type &__x)

iterator erase (const_iterator __first, const_iterator __last)

allocator_type get_allocator () const noexcept

hasher hash_function () const

template<typename _InputIterator > void insert (_InputIterator __first, _InputIterator __last)

void insert (initializer_list< value_type > __l)

key_equal key_eq () const

float load_factor () const noexcept

size_type max_bucket_count () const noexcept

float max_load_factor () const noexcept

void max_load_factor (float __z)

size_type max_size () const noexcept

unordered_multiset & operator= (const unordered_multiset &)=default

unordered_multiset & operator= (unordered_multiset &&)=default

unordered_multiset & operator= (initializer_list< value_type > __l)

void rehash (size_type __n)

void reserve (size_type __n)

size_type size () const noexcept

void swap (unordered_multiset &__x) noexcept(noexcept(_M_h.swap(__x._M_h)))

iterator begin () noexcept

const_iterator begin () const noexcept

iterator end () noexcept

const_iterator end () const noexcept

iterator insert (const value_type &__x)

iterator insert (value_type &&__x)

iterator insert (const_iterator __hint, const value_type &__x)

iterator insert (const_iterator __hint, value_type &&__x)

iterator erase (const_iterator __position)

iterator erase (iterator __it)

iterator find (const key_type &__x)

const_iterator find (const key_type &__x) const

std::pair< iterator, iterator > equal_range (const key_type &__x)

std::pair< const_iterator,

const_iterator > equal_range (const key_type &__x) const "

local_iterator begin (size_type __n)

const_local_iterator begin (size_type __n) const

const_local_iterator cbegin (size_type __n) const

local_iterator end (size_type __n)

const_local_iterator end (size_type __n) const

const_local_iterator cend (size_type __n) const

Friends

template<typename _Value1 , typename _Hash1 , typename _Pred1 , typename _Alloc1 > bool operator== (const unordered_multiset< _Value1, _Hash1, _Pred1, _Alloc1 > &, const unordered_multiset< _Value1, _Hash1, _Pred1, _Alloc1 > &)

template<class _Value, class _Hash = hash<_Value>, class _Pred = std::equal_to<_Value>, class _Alloc = std::allocator<_Value>>class std::unordered_multiset< _Value, _Hash, _Pred, _Alloc >

A standard container composed of equivalent keys (possibly containing multiple of each key value) in which the elements' keys are the elements themselves.

Template Parameters:

_Value Type of key objects.

_Hash Hashing function object type, defaults to hash<_Value>.

_Pred Predicate function object type, defaults to equal_to<_Value>.

_Alloc Allocator type, defaults to allocator<_Key>.

Meets the requirements of a container, and unordered associative container

Base is _Hashtable, dispatched at compile time via template alias __umset_hashtable.

Definition at line 728 of file unordered_set.h.

template<class _Value , class _Hash = hash<_Value>, class _Pred = std::equal_to<_Value>, class _Alloc = std::allocator<_Value>> typedef _Hashtable::allocator_type \fBstd::unordered_multiset\fP< _Value, _Hash, _Pred, _Alloc >::\fBallocator_type\fP

Public typedefs.

Definition at line 741 of file unordered_set.h.

template<class _Value , class _Hash = hash<_Value>, class _Pred = std::equal_to<_Value>, class _Alloc = std::allocator<_Value>> typedef \fB_Hashtable::const_iterator\fP \fBstd::unordered_multiset\fP< _Value, _Hash, _Pred, _Alloc >::\fBconst_iterator\fP

Iterator-related typedefs.

Definition at line 751 of file unordered_set.h.

template<class _Value , class _Hash = hash<_Value>, class _Pred = std::equal_to<_Value>, class _Alloc = std::allocator<_Value>> typedef \fB_Hashtable::const_local_iterator\fP \fBstd::unordered_multiset\fP< _Value, _Hash, _Pred, _Alloc >::\fBconst_local_iterator\fP

Iterator-related typedefs.

Definition at line 753 of file unordered_set.h.

template<class _Value , class _Hash = hash<_Value>, class _Pred = std::equal_to<_Value>, class _Alloc = std::allocator<_Value>> typedef _Hashtable::const_pointer \fBstd::unordered_multiset\fP< _Value, _Hash, _Pred, _Alloc >::\fBconst_pointer\fP

Iterator-related typedefs.

Definition at line 747 of file unordered_set.h.

template<class _Value , class _Hash = hash<_Value>, class _Pred = std::equal_to<_Value>, class _Alloc = std::allocator<_Value>> typedef _Hashtable::const_reference \fBstd::unordered_multiset\fP< _Value, _Hash, _Pred, _Alloc >::\fBconst_reference\fP

Iterator-related typedefs.

Definition at line 749 of file unordered_set.h.

template<class _Value , class _Hash = hash<_Value>, class _Pred = std::equal_to<_Value>, class _Alloc = std::allocator<_Value>> typedef _Hashtable::difference_type \fBstd::unordered_multiset\fP< _Value, _Hash, _Pred, _Alloc >::\fBdifference_type\fP

Iterator-related typedefs.

Definition at line 755 of file unordered_set.h.

template<class _Value , class _Hash = hash<_Value>, class _Pred = std::equal_to<_Value>, class _Alloc = std::allocator<_Value>> typedef _Hashtable::hasher \fBstd::unordered_multiset\fP< _Value, _Hash, _Pred, _Alloc >::\fBhasher\fP

Public typedefs.

Definition at line 739 of file unordered_set.h.

template<class _Value , class _Hash = hash<_Value>, class _Pred = std::equal_to<_Value>, class _Alloc = std::allocator<_Value>> typedef \fB_Hashtable::iterator\fP \fBstd::unordered_multiset\fP< _Value, _Hash, _Pred, _Alloc >::\fBiterator\fP

Iterator-related typedefs.

Definition at line 750 of file unordered_set.h.

template<class _Value , class _Hash = hash<_Value>, class _Pred = std::equal_to<_Value>, class _Alloc = std::allocator<_Value>> typedef _Hashtable::key_equal \fBstd::unordered_multiset\fP< _Value, _Hash, _Pred, _Alloc >::\fBkey_equal\fP

Public typedefs.

Definition at line 740 of file unordered_set.h.

template<class _Value , class _Hash = hash<_Value>, class _Pred = std::equal_to<_Value>, class _Alloc = std::allocator<_Value>> typedef _Hashtable::key_type \fBstd::unordered_multiset\fP< _Value, _Hash, _Pred, _Alloc >::\fBkey_type\fP

Public typedefs.

Definition at line 737 of file unordered_set.h.

template<class _Value , class _Hash = hash<_Value>, class _Pred = std::equal_to<_Value>, class _Alloc = std::allocator<_Value>> typedef \fB_Hashtable::local_iterator\fP \fBstd::unordered_multiset\fP< _Value, _Hash, _Pred, _Alloc >::\fBlocal_iterator\fP

Iterator-related typedefs.

Definition at line 752 of file unordered_set.h.

template<class _Value , class _Hash = hash<_Value>, class _Pred = std::equal_to<_Value>, class _Alloc = std::allocator<_Value>> typedef _Hashtable::pointer \fBstd::unordered_multiset\fP< _Value, _Hash, _Pred, _Alloc >::\fBpointer\fP

Iterator-related typedefs.

Definition at line 746 of file unordered_set.h.

template<class _Value , class _Hash = hash<_Value>, class _Pred = std::equal_to<_Value>, class _Alloc = std::allocator<_Value>> typedef _Hashtable::reference \fBstd::unordered_multiset\fP< _Value, _Hash, _Pred, _Alloc >::\fBreference\fP

Iterator-related typedefs.

Definition at line 748 of file unordered_set.h.

template<class _Value , class _Hash = hash<_Value>, class _Pred = std::equal_to<_Value>, class _Alloc = std::allocator<_Value>> typedef _Hashtable::size_type \fBstd::unordered_multiset\fP< _Value, _Hash, _Pred, _Alloc >::\fBsize_type\fP

Iterator-related typedefs.

Definition at line 754 of file unordered_set.h.

template<class _Value , class _Hash = hash<_Value>, class _Pred = std::equal_to<_Value>, class _Alloc = std::allocator<_Value>> typedef _Hashtable::value_type \fBstd::unordered_multiset\fP< _Value, _Hash, _Pred, _Alloc >::\fBvalue_type\fP

Public typedefs.

Definition at line 738 of file unordered_set.h.

template<class _Value , class _Hash = hash<_Value>, class _Pred = std::equal_to<_Value>, class _Alloc = std::allocator<_Value>> \fBstd::unordered_multiset\fP< _Value, _Hash, _Pred, _Alloc >::\fBunordered_multiset\fP (\fBsize_type\fP__n = \fC10\fP, const \fBhasher\fP &__hf = \fC\fBhasher\fP()\fP, const \fBkey_equal\fP &__eql = \fC\fBkey_equal\fP()\fP, const \fBallocator_type\fP &__a = \fC\fBallocator_type\fP()\fP)\fC [inline]\fP, \fC [explicit]\fP

Default constructor creates no elements.

Parameters:

__n Initial number of buckets.

__hf A hash functor.

__eql A key equality functor.

__a An allocator object.

Definition at line 767 of file unordered_set.h.

template<class _Value , class _Hash = hash<_Value>, class _Pred = std::equal_to<_Value>, class _Alloc = std::allocator<_Value>> template<typename _InputIterator > \fBstd::unordered_multiset\fP< _Value, _Hash, _Pred, _Alloc >::\fBunordered_multiset\fP (_InputIterator__f, _InputIterator__l, \fBsize_type\fP__n = \fC0\fP, const \fBhasher\fP &__hf = \fC\fBhasher\fP()\fP, const \fBkey_equal\fP &__eql = \fC\fBkey_equal\fP()\fP, const \fBallocator_type\fP &__a = \fC\fBallocator_type\fP()\fP)\fC [inline]\fP

Builds an unordered_multiset from a range.

Parameters:

__first An input iterator.

__last An input iterator.

__n Minimal initial number of buckets.

__hf A hash functor.

__eql A key equality functor.

__a An allocator object.

Create an unordered_multiset consisting of copies of the elements from [__first,__last). This is linear in N (where N is distance(__first,__last)).

Definition at line 788 of file unordered_set.h.

template<class _Value , class _Hash = hash<_Value>, class _Pred = std::equal_to<_Value>, class _Alloc = std::allocator<_Value>> \fBstd::unordered_multiset\fP< _Value, _Hash, _Pred, _Alloc >::\fBunordered_multiset\fP (const \fBunordered_multiset\fP< _Value, _Hash, _Pred, _Alloc > &)\fC [default]\fP

Copy constructor.

template<class _Value , class _Hash = hash<_Value>, class _Pred = std::equal_to<_Value>, class _Alloc = std::allocator<_Value>> \fBstd::unordered_multiset\fP< _Value, _Hash, _Pred, _Alloc >::\fBunordered_multiset\fP (\fBunordered_multiset\fP< _Value, _Hash, _Pred, _Alloc > &&)\fC [default]\fP

Move constructor.

template<class _Value , class _Hash = hash<_Value>, class _Pred = std::equal_to<_Value>, class _Alloc = std::allocator<_Value>> \fBstd::unordered_multiset\fP< _Value, _Hash, _Pred, _Alloc >::\fBunordered_multiset\fP (initializer_list< \fBvalue_type\fP >__l, \fBsize_type\fP__n = \fC0\fP, const \fBhasher\fP &__hf = \fC\fBhasher\fP()\fP, const \fBkey_equal\fP &__eql = \fC\fBkey_equal\fP()\fP, const \fBallocator_type\fP &__a = \fC\fBallocator_type\fP()\fP)\fC [inline]\fP

Builds an unordered_multiset from an initializer_list.

Parameters:

__l An initializer_list.

__n Minimal initial number of buckets.

__hf A hash functor.

__eql A key equality functor.

__a An allocator object.

Create an unordered_multiset consisting of copies of the elements in the list. This is linear in N (where N is __l.size()).

Definition at line 813 of file unordered_set.h.

template<class _Value , class _Hash = hash<_Value>, class _Pred = std::equal_to<_Value>, class _Alloc = std::allocator<_Value>> \fBstd::unordered_multiset\fP< _Value, _Hash, _Pred, _Alloc >::\fBunordered_multiset\fP (const \fBallocator_type\fP &__a)\fC [inline]\fP, \fC [explicit]\fP

Creates an unordered_multiset with no elements.

Parameters:

__a An allocator object.

Definition at line 834 of file unordered_set.h.

template<class _Value , class _Hash = hash<_Value>, class _Pred = std::equal_to<_Value>, class _Alloc = std::allocator<_Value>> \fBiterator\fP \fBstd::unordered_multiset\fP< _Value, _Hash, _Pred, _Alloc >::begin ()\fC [inline]\fP, \fC [noexcept]\fP

Returns a read-only (constant) iterator that points to the first element in the unordered_multiset.

Definition at line 907 of file unordered_set.h.

template<class _Value , class _Hash = hash<_Value>, class _Pred = std::equal_to<_Value>, class _Alloc = std::allocator<_Value>> \fBconst_iterator\fP \fBstd::unordered_multiset\fP< _Value, _Hash, _Pred, _Alloc >::begin () const\fC [inline]\fP, \fC [noexcept]\fP

Returns a read-only (constant) iterator that points to the first element in the unordered_multiset.

Definition at line 911 of file unordered_set.h.

template<class _Value , class _Hash = hash<_Value>, class _Pred = std::equal_to<_Value>, class _Alloc = std::allocator<_Value>> \fBlocal_iterator\fP \fBstd::unordered_multiset\fP< _Value, _Hash, _Pred, _Alloc >::begin (\fBsize_type\fP__n)\fC [inline]\fP

Returns a read-only (constant) iterator pointing to the first bucket element.

Parameters:

__n The bucket index.

Returns:

A read-only local iterator.

Definition at line 1235 of file unordered_set.h.

template<class _Value , class _Hash = hash<_Value>, class _Pred = std::equal_to<_Value>, class _Alloc = std::allocator<_Value>> \fBconst_local_iterator\fP \fBstd::unordered_multiset\fP< _Value, _Hash, _Pred, _Alloc >::begin (\fBsize_type\fP__n) const\fC [inline]\fP

Returns a read-only (constant) iterator pointing to the first bucket element.

Parameters:

__n The bucket index.

Returns:

A read-only local iterator.

Definition at line 1239 of file unordered_set.h.

template<class _Value , class _Hash = hash<_Value>, class _Pred = std::equal_to<_Value>, class _Alloc = std::allocator<_Value>> \fBsize_type\fP \fBstd::unordered_multiset\fP< _Value, _Hash, _Pred, _Alloc >::bucket_count () const\fC [inline]\fP, \fC [noexcept]\fP

Returns the number of buckets of the unordered_multiset.

Definition at line 1201 of file unordered_set.h.

template<class _Value , class _Hash = hash<_Value>, class _Pred = std::equal_to<_Value>, class _Alloc = std::allocator<_Value>> \fBconst_iterator\fP \fBstd::unordered_multiset\fP< _Value, _Hash, _Pred, _Alloc >::cbegin () const\fC [inline]\fP, \fC [noexcept]\fP

Returns a read-only (constant) iterator that points to the first element in the unordered_multiset.

Definition at line 934 of file unordered_set.h.

template<class _Value , class _Hash = hash<_Value>, class _Pred = std::equal_to<_Value>, class _Alloc = std::allocator<_Value>> \fBconst_local_iterator\fP \fBstd::unordered_multiset\fP< _Value, _Hash, _Pred, _Alloc >::cbegin (\fBsize_type\fP__n) const\fC [inline]\fP

Returns a read-only (constant) iterator pointing to the first bucket element.

Parameters:

__n The bucket index.

Returns:

A read-only local iterator.

Definition at line 1243 of file unordered_set.h.

template<class _Value , class _Hash = hash<_Value>, class _Pred = std::equal_to<_Value>, class _Alloc = std::allocator<_Value>> \fBconst_iterator\fP \fBstd::unordered_multiset\fP< _Value, _Hash, _Pred, _Alloc >::cend () const\fC [inline]\fP, \fC [noexcept]\fP

Returns a read-only (constant) iterator that points one past the last element in the unordered_multiset.

Definition at line 942 of file unordered_set.h.

template<class _Value , class _Hash = hash<_Value>, class _Pred = std::equal_to<_Value>, class _Alloc = std::allocator<_Value>> \fBconst_local_iterator\fP \fBstd::unordered_multiset\fP< _Value, _Hash, _Pred, _Alloc >::cend (\fBsize_type\fP__n) const\fC [inline]\fP

Returns a read-only (constant) iterator pointing to one past the last bucket elements.

Parameters:

__n The bucket index.

Returns:

A read-only local iterator.

Definition at line 1263 of file unordered_set.h.

template<class _Value , class _Hash = hash<_Value>, class _Pred = std::equal_to<_Value>, class _Alloc = std::allocator<_Value>> void \fBstd::unordered_multiset\fP< _Value, _Hash, _Pred, _Alloc >::clear ()\fC [inline]\fP, \fC [noexcept]\fP

Erases all elements in an unordered_multiset.

Note that this function only erases the elements, and that if the elements themselves are pointers, the pointed-to memory is not touched in any way. Managing the pointer is the user's responsibility.

Definition at line 1118 of file unordered_set.h.

template<class _Value , class _Hash = hash<_Value>, class _Pred = std::equal_to<_Value>, class _Alloc = std::allocator<_Value>> \fBsize_type\fP \fBstd::unordered_multiset\fP< _Value, _Hash, _Pred, _Alloc >::count (const \fBkey_type\fP &__x) const\fC [inline]\fP

Finds the number of elements.

Parameters:

__x Element to located.

Returns:

Number of elements with specified key.

Definition at line 1178 of file unordered_set.h.

template<class _Value , class _Hash = hash<_Value>, class _Pred = std::equal_to<_Value>, class _Alloc = std::allocator<_Value>> template<typename... _Args> \fBiterator\fP \fBstd::unordered_multiset\fP< _Value, _Hash, _Pred, _Alloc >::emplace (_Args &&...__args)\fC [inline]\fP

Builds and insert an element into the unordered_multiset.

Parameters:

__args Arguments used to generate an element.

Returns:

An iterator that points to the inserted element.

Insertion requires amortized constant time.

Definition at line 956 of file unordered_set.h.

template<class _Value , class _Hash = hash<_Value>, class _Pred = std::equal_to<_Value>, class _Alloc = std::allocator<_Value>> template<typename... _Args> \fBiterator\fP \fBstd::unordered_multiset\fP< _Value, _Hash, _Pred, _Alloc >::emplace_hint (\fBconst_iterator\fP__pos, _Args &&...__args)\fC [inline]\fP

Inserts an element into the unordered_multiset.

Parameters:

__pos An iterator that serves as a hint as to where the element should be inserted.

__args Arguments used to generate the element to be inserted.

Returns:

An iterator that points to the inserted element.

Note that the first parameter is only a hint and can potentially improve the performance of the insertion process. A bad hint would cause no gains in efficiency.

For more on hinting, see: http://gcc.gnu.org/onlinedocs/libstdc++/manual/bk01pt07ch17.html

Insertion requires amortized constant time.

Definition at line 978 of file unordered_set.h.

template<class _Value , class _Hash = hash<_Value>, class _Pred = std::equal_to<_Value>, class _Alloc = std::allocator<_Value>> bool \fBstd::unordered_multiset\fP< _Value, _Hash, _Pred, _Alloc >::empty () const\fC [inline]\fP, \fC [noexcept]\fP

Returns true if the unordered_multiset is empty.

Definition at line 886 of file unordered_set.h.

template<class _Value , class _Hash = hash<_Value>, class _Pred = std::equal_to<_Value>, class _Alloc = std::allocator<_Value>> \fBiterator\fP \fBstd::unordered_multiset\fP< _Value, _Hash, _Pred, _Alloc >::end ()\fC [inline]\fP, \fC [noexcept]\fP

Returns a read-only (constant) iterator that points one past the last element in the unordered_multiset.

Definition at line 921 of file unordered_set.h.

template<class _Value , class _Hash = hash<_Value>, class _Pred = std::equal_to<_Value>, class _Alloc = std::allocator<_Value>> \fBconst_iterator\fP \fBstd::unordered_multiset\fP< _Value, _Hash, _Pred, _Alloc >::end () const\fC [inline]\fP, \fC [noexcept]\fP

Returns a read-only (constant) iterator that points one past the last element in the unordered_multiset.

Definition at line 925 of file unordered_set.h.

template<class _Value , class _Hash = hash<_Value>, class _Pred = std::equal_to<_Value>, class _Alloc = std::allocator<_Value>> \fBlocal_iterator\fP \fBstd::unordered_multiset\fP< _Value, _Hash, _Pred, _Alloc >::end (\fBsize_type\fP__n)\fC [inline]\fP

Returns a read-only (constant) iterator pointing to one past the last bucket elements.

Parameters:

__n The bucket index.

Returns:

A read-only local iterator.

Definition at line 1255 of file unordered_set.h.

template<class _Value , class _Hash = hash<_Value>, class _Pred = std::equal_to<_Value>, class _Alloc = std::allocator<_Value>> \fBconst_local_iterator\fP \fBstd::unordered_multiset\fP< _Value, _Hash, _Pred, _Alloc >::end (\fBsize_type\fP__n) const\fC [inline]\fP

Returns a read-only (constant) iterator pointing to one past the last bucket elements.

Parameters:

__n The bucket index.

Returns:

A read-only local iterator.

Definition at line 1259 of file unordered_set.h.

template<class _Value , class _Hash = hash<_Value>, class _Pred = std::equal_to<_Value>, class _Alloc = std::allocator<_Value>> \fBstd::pair\fP<\fBiterator\fP, \fBiterator\fP> \fBstd::unordered_multiset\fP< _Value, _Hash, _Pred, _Alloc >::equal_range (const \fBkey_type\fP &__x)\fC [inline]\fP

Finds a subsequence matching given key.

Parameters:

__x Key to be located.

Returns:

Pair of iterators that possibly points to the subsequence matching given key.

Definition at line 1189 of file unordered_set.h.

template<class _Value , class _Hash = hash<_Value>, class _Pred = std::equal_to<_Value>, class _Alloc = std::allocator<_Value>> \fBstd::pair\fP<\fBconst_iterator\fP, \fBconst_iterator\fP> \fBstd::unordered_multiset\fP< _Value, _Hash, _Pred, _Alloc >::equal_range (const \fBkey_type\fP &__x) const\fC [inline]\fP

Finds a subsequence matching given key.

Parameters:

__x Key to be located.

Returns:

Pair of iterators that possibly points to the subsequence matching given key.

Definition at line 1193 of file unordered_set.h.

template<class _Value , class _Hash = hash<_Value>, class _Pred = std::equal_to<_Value>, class _Alloc = std::allocator<_Value>> \fBiterator\fP \fBstd::unordered_multiset\fP< _Value, _Hash, _Pred, _Alloc >::erase (\fBconst_iterator\fP__position)\fC [inline]\fP

Erases an element from an unordered_multiset.

Parameters:

__position An iterator pointing to the element to be erased.

Returns:

An iterator pointing to the element immediately following __position prior to the element being erased. If no such element exists, end() is returned.

This function erases an element, pointed to by the given iterator, from an unordered_multiset.

Note that this function only erases the element, and that if the element is itself a pointer, the pointed-to memory is not touched in any way. Managing the pointer is the user's responsibility.

Definition at line 1064 of file unordered_set.h.

template<class _Value , class _Hash = hash<_Value>, class _Pred = std::equal_to<_Value>, class _Alloc = std::allocator<_Value>> \fBiterator\fP \fBstd::unordered_multiset\fP< _Value, _Hash, _Pred, _Alloc >::erase (\fBiterator\fP__it)\fC [inline]\fP

Erases an element from an unordered_multiset.

Parameters:

__position An iterator pointing to the element to be erased.

Returns:

An iterator pointing to the element immediately following __position prior to the element being erased. If no such element exists, end() is returned.

This function erases an element, pointed to by the given iterator, from an unordered_multiset.

Note that this function only erases the element, and that if the element is itself a pointer, the pointed-to memory is not touched in any way. Managing the pointer is the user's responsibility.

Definition at line 1069 of file unordered_set.h.

template<class _Value , class _Hash = hash<_Value>, class _Pred = std::equal_to<_Value>, class _Alloc = std::allocator<_Value>> \fBsize_type\fP \fBstd::unordered_multiset\fP< _Value, _Hash, _Pred, _Alloc >::erase (const \fBkey_type\fP &__x)\fC [inline]\fP

Erases elements according to the provided key.

Parameters:

__x Key of element to be erased.

Returns:

The number of elements erased.

This function erases all the elements located by the given key from an unordered_multiset.

Note that this function only erases the element, and that if the element is itself a pointer, the pointed-to memory is not touched in any way. Managing the pointer is the user's responsibility.

Definition at line 1087 of file unordered_set.h.

template<class _Value , class _Hash = hash<_Value>, class _Pred = std::equal_to<_Value>, class _Alloc = std::allocator<_Value>> \fBiterator\fP \fBstd::unordered_multiset\fP< _Value, _Hash, _Pred, _Alloc >::erase (\fBconst_iterator\fP__first, \fBconst_iterator\fP__last)\fC [inline]\fP

Erases a [__first,__last) range of elements from an unordered_multiset.

Parameters:

__first Iterator pointing to the start of the range to be erased.

__last Iterator pointing to the end of the range to be erased.

Returns:

The iterator __last.

This function erases a sequence of elements from an unordered_multiset.

Note that this function only erases the element, and that if the element is itself a pointer, the pointed-to memory is not touched in any way. Managing the pointer is the user's responsibility.

Definition at line 1107 of file unordered_set.h.

template<class _Value , class _Hash = hash<_Value>, class _Pred = std::equal_to<_Value>, class _Alloc = std::allocator<_Value>> \fBiterator\fP \fBstd::unordered_multiset\fP< _Value, _Hash, _Pred, _Alloc >::find (const \fBkey_type\fP &__x)\fC [inline]\fP

Tries to locate an element in an unordered_multiset.

Parameters:

__x Element to be located.

Returns:

Iterator pointing to sought-after element, or end() if not found.

This function takes a key and tries to locate the element with which the key matches. If successful the function returns an iterator pointing to the sought after element. If unsuccessful it returns the past-the-end ( end() ) iterator.

Definition at line 1164 of file unordered_set.h.

template<class _Value , class _Hash = hash<_Value>, class _Pred = std::equal_to<_Value>, class _Alloc = std::allocator<_Value>> \fBconst_iterator\fP \fBstd::unordered_multiset\fP< _Value, _Hash, _Pred, _Alloc >::find (const \fBkey_type\fP &__x) const\fC [inline]\fP

Tries to locate an element in an unordered_multiset.

Parameters:

__x Element to be located.

Returns:

Iterator pointing to sought-after element, or end() if not found.

This function takes a key and tries to locate the element with which the key matches. If successful the function returns an iterator pointing to the sought after element. If unsuccessful it returns the past-the-end ( end() ) iterator.

Definition at line 1168 of file unordered_set.h.

template<class _Value , class _Hash = hash<_Value>, class _Pred = std::equal_to<_Value>, class _Alloc = std::allocator<_Value>> \fBallocator_type\fP \fBstd::unordered_multiset\fP< _Value, _Hash, _Pred, _Alloc >::get_allocator () const\fC [inline]\fP, \fC [noexcept]\fP

Returns the allocator object with which the unordered_multiset was constructed.

Definition at line 879 of file unordered_set.h.

template<class _Value , class _Hash = hash<_Value>, class _Pred = std::equal_to<_Value>, class _Alloc = std::allocator<_Value>> \fBhasher\fP \fBstd::unordered_multiset\fP< _Value, _Hash, _Pred, _Alloc >::hash_function () const\fC [inline]\fP

Returns the hash functor object with which the unordered_multiset was constructed.

Definition at line 1140 of file unordered_set.h.

template<class _Value , class _Hash = hash<_Value>, class _Pred = std::equal_to<_Value>, class _Alloc = std::allocator<_Value>> \fBiterator\fP \fBstd::unordered_multiset\fP< _Value, _Hash, _Pred, _Alloc >::insert (const \fBvalue_type\fP &__x)\fC [inline]\fP

Inserts an element into the unordered_multiset.

Parameters:

__x Element to be inserted.

Returns:

An iterator that points to the inserted element.

Insertion requires amortized constant time.

Definition at line 990 of file unordered_set.h.

template<class _Value , class _Hash = hash<_Value>, class _Pred = std::equal_to<_Value>, class _Alloc = std::allocator<_Value>> \fBiterator\fP \fBstd::unordered_multiset\fP< _Value, _Hash, _Pred, _Alloc >::insert (\fBvalue_type\fP &&__x)\fC [inline]\fP

Inserts an element into the unordered_multiset.

Parameters:

__x Element to be inserted.

Returns:

An iterator that points to the inserted element.

Insertion requires amortized constant time.

Definition at line 994 of file unordered_set.h.

References std::move().

template<class _Value , class _Hash = hash<_Value>, class _Pred = std::equal_to<_Value>, class _Alloc = std::allocator<_Value>> \fBiterator\fP \fBstd::unordered_multiset\fP< _Value, _Hash, _Pred, _Alloc >::insert (\fBconst_iterator\fP__hint, const \fBvalue_type\fP &__x)\fC [inline]\fP

Inserts an element into the unordered_multiset.

Parameters:

__hint An iterator that serves as a hint as to where the element should be inserted.

__x Element to be inserted.

Returns:

An iterator that points to the inserted element.

Note that the first parameter is only a hint and can potentially improve the performance of the insertion process. A bad hint would cause no gains in efficiency.

For more on hinting, see: http://gcc.gnu.org/onlinedocs/libstdc++/manual/bk01pt07ch17.html

Insertion requires amortized constant.

Definition at line 1016 of file unordered_set.h.

template<class _Value , class _Hash = hash<_Value>, class _Pred = std::equal_to<_Value>, class _Alloc = std::allocator<_Value>> \fBiterator\fP \fBstd::unordered_multiset\fP< _Value, _Hash, _Pred, _Alloc >::insert (\fBconst_iterator\fP__hint, \fBvalue_type\fP &&__x)\fC [inline]\fP

Inserts an element into the unordered_multiset.

Parameters:

__hint An iterator that serves as a hint as to where the element should be inserted.

__x Element to be inserted.

Returns:

An iterator that points to the inserted element.

Note that the first parameter is only a hint and can potentially improve the performance of the insertion process. A bad hint would cause no gains in efficiency.

For more on hinting, see: http://gcc.gnu.org/onlinedocs/libstdc++/manual/bk01pt07ch17.html

Insertion requires amortized constant.

Definition at line 1020 of file unordered_set.h.

References std::move().

template<class _Value , class _Hash = hash<_Value>, class _Pred = std::equal_to<_Value>, class _Alloc = std::allocator<_Value>> template<typename _InputIterator > void \fBstd::unordered_multiset\fP< _Value, _Hash, _Pred, _Alloc >::insert (_InputIterator__first, _InputIterator__last)\fC [inline]\fP

A template function that inserts a range of elements.

Parameters:

__first Iterator pointing to the start of the range to be inserted.

__last Iterator pointing to the end of the range.

Complexity similar to that of the range constructor.

Definition at line 1034 of file unordered_set.h.

template<class _Value , class _Hash = hash<_Value>, class _Pred = std::equal_to<_Value>, class _Alloc = std::allocator<_Value>> void \fBstd::unordered_multiset\fP< _Value, _Hash, _Pred, _Alloc >::insert (initializer_list< \fBvalue_type\fP >__l)\fC [inline]\fP

Inserts a list of elements into the unordered_multiset.

Parameters:

__l A std::initializer_list<value_type> of elements to be inserted.

Complexity similar to that of the range constructor.

Definition at line 1045 of file unordered_set.h.

template<class _Value , class _Hash = hash<_Value>, class _Pred = std::equal_to<_Value>, class _Alloc = std::allocator<_Value>> \fBkey_equal\fP \fBstd::unordered_multiset\fP< _Value, _Hash, _Pred, _Alloc >::key_eq () const\fC [inline]\fP

Returns the key comparison object with which the unordered_multiset was constructed.

Definition at line 1146 of file unordered_set.h.

template<class _Value , class _Hash = hash<_Value>, class _Pred = std::equal_to<_Value>, class _Alloc = std::allocator<_Value>> float \fBstd::unordered_multiset\fP< _Value, _Hash, _Pred, _Alloc >::load_factor () const\fC [inline]\fP, \fC [noexcept]\fP

Returns the average number of elements per bucket.

Definition at line 1271 of file unordered_set.h.

template<class _Value , class _Hash = hash<_Value>, class _Pred = std::equal_to<_Value>, class _Alloc = std::allocator<_Value>> \fBsize_type\fP \fBstd::unordered_multiset\fP< _Value, _Hash, _Pred, _Alloc >::max_bucket_count () const\fC [inline]\fP, \fC [noexcept]\fP

Returns the maximum number of buckets of the unordered_multiset.

Definition at line 1206 of file unordered_set.h.

template<class _Value , class _Hash = hash<_Value>, class _Pred = std::equal_to<_Value>, class _Alloc = std::allocator<_Value>> float \fBstd::unordered_multiset\fP< _Value, _Hash, _Pred, _Alloc >::max_load_factor () const\fC [inline]\fP, \fC [noexcept]\fP

Returns a positive number that the unordered_multiset tries to keep the load factor less than or equal to.

Definition at line 1277 of file unordered_set.h.

template<class _Value , class _Hash = hash<_Value>, class _Pred = std::equal_to<_Value>, class _Alloc = std::allocator<_Value>> void \fBstd::unordered_multiset\fP< _Value, _Hash, _Pred, _Alloc >::max_load_factor (float__z)\fC [inline]\fP

Change the unordered_multiset maximum load factor.

Parameters:

__z The new maximum load factor.

Definition at line 1285 of file unordered_set.h.

template<class _Value , class _Hash = hash<_Value>, class _Pred = std::equal_to<_Value>, class _Alloc = std::allocator<_Value>> \fBsize_type\fP \fBstd::unordered_multiset\fP< _Value, _Hash, _Pred, _Alloc >::max_size () const\fC [inline]\fP, \fC [noexcept]\fP

Returns the maximum size of the unordered_multiset.

Definition at line 896 of file unordered_set.h.

template<class _Value , class _Hash = hash<_Value>, class _Pred = std::equal_to<_Value>, class _Alloc = std::allocator<_Value>> \fBunordered_multiset\fP& \fBstd::unordered_multiset\fP< _Value, _Hash, _Pred, _Alloc >::operator= (const \fBunordered_multiset\fP< _Value, _Hash, _Pred, _Alloc > &)\fC [default]\fP

Copy assignment operator.

template<class _Value , class _Hash = hash<_Value>, class _Pred = std::equal_to<_Value>, class _Alloc = std::allocator<_Value>> \fBunordered_multiset\fP& \fBstd::unordered_multiset\fP< _Value, _Hash, _Pred, _Alloc >::operator= (\fBunordered_multiset\fP< _Value, _Hash, _Pred, _Alloc > &&)\fC [default]\fP

Move assignment operator.

template<class _Value , class _Hash = hash<_Value>, class _Pred = std::equal_to<_Value>, class _Alloc = std::allocator<_Value>> \fBunordered_multiset\fP& \fBstd::unordered_multiset\fP< _Value, _Hash, _Pred, _Alloc >::operator= (initializer_list< \fBvalue_type\fP >__l)\fC [inline]\fP

Unordered_multiset list assignment operator.

Parameters:

__l An initializer_list.

This function fills an unordered_multiset with copies of the elements in the initializer list __l.

Note that the assignment completely changes the unordered_multiset and that the resulting unordered_set's size is the same as the number of elements assigned. Old data may be lost.

Definition at line 870 of file unordered_set.h.

template<class _Value , class _Hash = hash<_Value>, class _Pred = std::equal_to<_Value>, class _Alloc = std::allocator<_Value>> void \fBstd::unordered_multiset\fP< _Value, _Hash, _Pred, _Alloc >::rehash (\fBsize_type\fP__n)\fC [inline]\fP

May rehash the unordered_multiset.

Parameters:

__n The new number of buckets.

Rehash will occur only if the new number of buckets respect the unordered_multiset maximum load factor.

Definition at line 1296 of file unordered_set.h.

template<class _Value , class _Hash = hash<_Value>, class _Pred = std::equal_to<_Value>, class _Alloc = std::allocator<_Value>> void \fBstd::unordered_multiset\fP< _Value, _Hash, _Pred, _Alloc >::reserve (\fBsize_type\fP__n)\fC [inline]\fP

Prepare the unordered_multiset for a specified number of elements.

Parameters:

__n Number of elements required.

Same as rehash(ceil(n / max_load_factor())).

Definition at line 1307 of file unordered_set.h.

template<class _Value , class _Hash = hash<_Value>, class _Pred = std::equal_to<_Value>, class _Alloc = std::allocator<_Value>> \fBsize_type\fP \fBstd::unordered_multiset\fP< _Value, _Hash, _Pred, _Alloc >::size () const\fC [inline]\fP, \fC [noexcept]\fP

Returns the size of the unordered_multiset.

Definition at line 891 of file unordered_set.h.

template<class _Value , class _Hash = hash<_Value>, class _Pred = std::equal_to<_Value>, class _Alloc = std::allocator<_Value>> void \fBstd::unordered_multiset\fP< _Value, _Hash, _Pred, _Alloc >::swap (\fBunordered_multiset\fP< _Value, _Hash, _Pred, _Alloc > &__x)\fC [inline]\fP, \fC [noexcept]\fP

Swaps data with another unordered_multiset.

Parameters:

__x An unordered_multiset of the same element and allocator types.

This exchanges the elements between two sets in constant time. Note that the global std::swap() function is specialized such that std::swap(s1,s2) will feed to this function.

Definition at line 1131 of file unordered_set.h.

Generated automatically by Doxygen for libstdc++ from the source code.