.TH "std::unordered_multiset< _Value, _Hash, _Pred, _Alloc >" 3cxx "libstdc++" \" -*- nroff -*-
.ad l
.nh
.SH NAME
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\&.  

.SH SYNOPSIS
.br
.PP
.PP
\fC#include <unordered_set>\fP
.SS "Public Types"

.in +1c
.ti -1c
.RI "\fBusing\fP \fBnode_type\fP = \fBtypename\fP _Hashtable::node_type"
.br
.in -1c
.PP
.RI "\fB\fP"
.br

.in +1c
.in +1c
.ti -1c
.RI "\fBtypedef\fP _Hashtable::key_type \fBkey_type\fP"
.br
.RI "Public typedefs\&. "
.ti -1c
.RI "\fBtypedef\fP _Hashtable::value_type \fBvalue_type\fP"
.br
.RI "Public typedefs\&. "
.ti -1c
.RI "\fBtypedef\fP _Hashtable::hasher \fBhasher\fP"
.br
.RI "Public typedefs\&. "
.ti -1c
.RI "\fBtypedef\fP _Hashtable::key_equal \fBkey_equal\fP"
.br
.RI "Public typedefs\&. "
.ti -1c
.RI "\fBtypedef\fP _Hashtable::allocator_type \fBallocator_type\fP"
.br
.RI "Public typedefs\&. "
.in -1c
.in -1c
.PP
.RI "\fB\fP"
.br

.in +1c
.in +1c
.ti -1c
.RI "\fBtypedef\fP _Hashtable::pointer \fBpointer\fP"
.br
.RI "Iterator-related typedefs\&. "
.ti -1c
.RI "\fBtypedef\fP _Hashtable::const_pointer \fBconst_pointer\fP"
.br
.RI "Iterator-related typedefs\&. "
.ti -1c
.RI "\fBtypedef\fP _Hashtable::reference \fBreference\fP"
.br
.RI "Iterator-related typedefs\&. "
.ti -1c
.RI "\fBtypedef\fP _Hashtable::const_reference \fBconst_reference\fP"
.br
.RI "Iterator-related typedefs\&. "
.ti -1c
.RI "\fBtypedef\fP _Hashtable::iterator \fBiterator\fP"
.br
.RI "Iterator-related typedefs\&. "
.ti -1c
.RI "\fBtypedef\fP _Hashtable::const_iterator \fBconst_iterator\fP"
.br
.RI "Iterator-related typedefs\&. "
.ti -1c
.RI "\fBtypedef\fP _Hashtable::local_iterator \fBlocal_iterator\fP"
.br
.RI "Iterator-related typedefs\&. "
.ti -1c
.RI "\fBtypedef\fP _Hashtable::const_local_iterator \fBconst_local_iterator\fP"
.br
.RI "Iterator-related typedefs\&. "
.ti -1c
.RI "\fBtypedef\fP _Hashtable::size_type \fBsize_type\fP"
.br
.RI "Iterator-related typedefs\&. "
.ti -1c
.RI "\fBtypedef\fP _Hashtable::difference_type \fBdifference_type\fP"
.br
.RI "Iterator-related typedefs\&. "
.in -1c
.in -1c
.SS "Public Member Functions"

.in +1c
.ti -1c
.RI "\fBunordered_multiset\fP ()=\fBdefault\fP"
.br
.RI "Default constructor\&. "
.ti -1c
.RI "template<\fBtypename\fP \fB_InputIterator\fP > \fBunordered_multiset\fP (\fB_InputIterator\fP __first, \fB_InputIterator\fP __last, \fBsize_type\fP __n, const \fBallocator_type\fP &__a)"
.br
.ti -1c
.RI "template<\fBtypename\fP \fB_InputIterator\fP > \fBunordered_multiset\fP (\fB_InputIterator\fP __first, \fB_InputIterator\fP __last, \fBsize_type\fP __n, const \fBhasher\fP &\fB__hf\fP, const \fBallocator_type\fP &__a)"
.br
.ti -1c
.RI "template<\fBtypename\fP \fB_InputIterator\fP > \fBunordered_multiset\fP (\fB_InputIterator\fP __first, \fB_InputIterator\fP __last, \fBsize_type\fP __n=0, const \fBhasher\fP &\fB__hf\fP=\fBhasher\fP(), const \fBkey_equal\fP &\fB__eql\fP=\fBkey_equal\fP(), const \fBallocator_type\fP &__a=\fBallocator_type\fP())"
.br
.RI "Builds an unordered_multiset from a range\&. "
.ti -1c
.RI "\fBunordered_multiset\fP (const \fBallocator_type\fP &__a)"
.br
.RI "Creates an unordered_multiset with no elements\&. "
.ti -1c
.RI "\fBunordered_multiset\fP (const \fBunordered_multiset\fP &)=\fBdefault\fP"
.br
.RI "Copy constructor\&. "
.ti -1c
.RI "\fBunordered_multiset\fP (const \fBunordered_multiset\fP &\fB__umset\fP, const \fBallocator_type\fP &__a)"
.br
.ti -1c
.RI "\fBunordered_multiset\fP (\fBinitializer_list\fP< \fBvalue_type\fP > \fB__l\fP, \fBsize_type\fP __n, const \fBallocator_type\fP &__a)"
.br
.ti -1c
.RI "\fBunordered_multiset\fP (\fBinitializer_list\fP< \fBvalue_type\fP > \fB__l\fP, \fBsize_type\fP __n, const \fBhasher\fP &\fB__hf\fP, const \fBallocator_type\fP &__a)"
.br
.ti -1c
.RI "\fBunordered_multiset\fP (\fBinitializer_list\fP< \fBvalue_type\fP > \fB__l\fP, \fBsize_type\fP __n=0, const \fBhasher\fP &\fB__hf\fP=\fBhasher\fP(), const \fBkey_equal\fP &\fB__eql\fP=\fBkey_equal\fP(), const \fBallocator_type\fP &__a=\fBallocator_type\fP())"
.br
.RI "Builds an unordered_multiset from an initializer_list\&. "
.ti -1c
.RI "\fBunordered_multiset\fP (\fBsize_type\fP __n, const \fBallocator_type\fP &__a)"
.br
.ti -1c
.RI "\fBunordered_multiset\fP (\fBsize_type\fP __n, const \fBhasher\fP &\fB__hf\fP, const \fBallocator_type\fP &__a)"
.br
.ti -1c
.RI "\fBunordered_multiset\fP (\fBsize_type\fP __n, const \fBhasher\fP &\fB__hf\fP=\fBhasher\fP(), const \fBkey_equal\fP &\fB__eql\fP=\fBkey_equal\fP(), const \fBallocator_type\fP &__a=\fBallocator_type\fP())"
.br
.RI "Default constructor creates no elements\&. "
.ti -1c
.RI "\fBunordered_multiset\fP (\fBunordered_multiset\fP &&)=\fBdefault\fP"
.br
.RI "Move constructor\&. "
.ti -1c
.RI "\fBunordered_multiset\fP (\fBunordered_multiset\fP &&\fB__umset\fP, const \fBallocator_type\fP &__a) noexcept(noexcept(\fB_Hashtable\fP(\fBstd::move\fP(__umset\&._M_h), __a)))"
.br
.ti -1c
.RI "\fBsize_type\fP \fBbucket\fP (const \fBkey_type\fP &\fB__key\fP) const"
.br
.ti -1c
.RI "\fBsize_type\fP \fBbucket_count\fP () const noexcept"
.br
.RI "Returns the number of buckets of the unordered_multiset\&. "
.ti -1c
.RI "\fBsize_type\fP \fBbucket_size\fP (\fBsize_type\fP __n) const"
.br
.ti -1c
.RI "\fBconst_iterator\fP \fBcbegin\fP () const noexcept"
.br
.ti -1c
.RI "\fBconst_iterator\fP \fBcend\fP () const noexcept"
.br
.ti -1c
.RI "\fBvoid\fP \fBclear\fP () noexcept"
.br
.ti -1c
.RI "template<typename\&.\&.\&. _Args> \fBiterator\fP \fBemplace\fP (\fB_Args\fP &&\&.\&.\&. \fB__args\fP)"
.br
.RI "Builds and insert an element into the unordered_multiset\&. "
.ti -1c
.RI "template<typename\&.\&.\&. _Args> \fBiterator\fP \fBemplace_hint\fP (\fBconst_iterator\fP \fB__pos\fP, \fB_Args\fP &&\&.\&.\&. \fB__args\fP)"
.br
.RI "Inserts an element into the unordered_multiset\&. "
.ti -1c
.RI "bool \fBempty\fP () const noexcept"
.br
.RI "Returns true if the unordered_multiset is empty\&. "
.ti -1c
.RI "\fBsize_type\fP \fBerase\fP (const \fBkey_type\fP &__x)"
.br
.RI "Erases elements according to the provided key\&. "
.ti -1c
.RI "\fBiterator\fP \fBerase\fP (\fBconst_iterator\fP __first, \fBconst_iterator\fP __last)"
.br
.RI "Erases a [__first,__last) range of elements from an unordered_multiset\&. "
.ti -1c
.RI "node_type \fBextract\fP (const \fBkey_type\fP &\fB__key\fP)"
.br
.RI "Extract a node\&. "
.ti -1c
.RI "node_type \fBextract\fP (\fBconst_iterator\fP \fB__pos\fP)"
.br
.RI "Extract a node\&. "
.ti -1c
.RI "\fBallocator_type\fP \fBget_allocator\fP () const noexcept"
.br
.RI "Returns the allocator object used by the unordered_multiset\&. "
.ti -1c
.RI "\fBhasher\fP \fBhash_function\fP () const"
.br
.RI "Returns the hash functor object with which the unordered_multiset was constructed\&. "
.ti -1c
.RI "template<\fBtypename\fP \fB_InputIterator\fP > \fBvoid\fP \fBinsert\fP (\fB_InputIterator\fP __first, \fB_InputIterator\fP __last)"
.br
.RI "A template function that inserts a range of elements\&. "
.ti -1c
.RI "\fBiterator\fP \fBinsert\fP (\fBconst_iterator\fP \fB__hint\fP, node_type &&\fB__nh\fP)"
.br
.RI "Re-insert an extracted node\&. "
.ti -1c
.RI "\fBvoid\fP \fBinsert\fP (\fBinitializer_list\fP< \fBvalue_type\fP > \fB__l\fP)"
.br
.RI "Inserts a list of elements into the unordered_multiset\&. "
.ti -1c
.RI "\fBiterator\fP \fBinsert\fP (node_type &&\fB__nh\fP)"
.br
.RI "Re-insert an extracted node\&. "
.ti -1c
.RI "\fBkey_equal\fP \fBkey_eq\fP () const"
.br
.RI "Returns the key comparison object with which the unordered_multiset was constructed\&. "
.ti -1c
.RI "float \fBload_factor\fP () const noexcept"
.br
.RI "Returns the average number of elements per bucket\&. "
.ti -1c
.RI "\fBsize_type\fP \fBmax_bucket_count\fP () const noexcept"
.br
.RI "Returns the maximum number of buckets of the unordered_multiset\&. "
.ti -1c
.RI "float \fBmax_load_factor\fP () const noexcept"
.br
.RI "Returns a positive number that the unordered_multiset tries to keep the load factor less than or equal to\&. "
.ti -1c
.RI "\fBvoid\fP \fBmax_load_factor\fP (float \fB__z\fP)"
.br
.RI "Change the unordered_multiset maximum load factor\&. "
.ti -1c
.RI "\fBsize_type\fP \fBmax_size\fP () const noexcept"
.br
.RI "Returns the maximum size of the unordered_multiset\&. "
.ti -1c
.RI "template<\fBtypename\fP \fB_H2\fP , \fBtypename\fP \fB_P2\fP > \fBvoid\fP \fBmerge\fP (\fBunordered_multiset\fP< _Value, \fB_H2\fP, \fB_P2\fP, _Alloc > &&\fB__source\fP)"
.br
.ti -1c
.RI "template<\fBtypename\fP \fB_H2\fP , \fBtypename\fP \fB_P2\fP > \fBvoid\fP \fBmerge\fP (\fBunordered_multiset\fP< _Value, \fB_H2\fP, \fB_P2\fP, _Alloc > &\fB__source\fP)"
.br
.ti -1c
.RI "template<\fBtypename\fP \fB_H2\fP , \fBtypename\fP \fB_P2\fP > \fBvoid\fP \fBmerge\fP (\fBunordered_set\fP< _Value, \fB_H2\fP, \fB_P2\fP, _Alloc > &&\fB__source\fP)"
.br
.ti -1c
.RI "template<\fBtypename\fP \fB_H2\fP , \fBtypename\fP \fB_P2\fP > \fBvoid\fP \fBmerge\fP (\fBunordered_set\fP< _Value, \fB_H2\fP, \fB_P2\fP, _Alloc > &\fB__source\fP)"
.br
.ti -1c
.RI "\fBunordered_multiset\fP & \fBoperator=\fP (const \fBunordered_multiset\fP &)=\fBdefault\fP"
.br
.RI "Copy assignment operator\&. "
.ti -1c
.RI "\fBunordered_multiset\fP & \fBoperator=\fP (\fBinitializer_list\fP< \fBvalue_type\fP > \fB__l\fP)"
.br
.RI "Unordered_multiset list assignment operator\&. "
.ti -1c
.RI "\fBunordered_multiset\fP & \fBoperator=\fP (\fBunordered_multiset\fP &&)=\fBdefault\fP"
.br
.RI "Move assignment operator\&. "
.ti -1c
.RI "\fBvoid\fP \fBrehash\fP (\fBsize_type\fP __n)"
.br
.RI "May rehash the unordered_multiset\&. "
.ti -1c
.RI "\fBvoid\fP \fBreserve\fP (\fBsize_type\fP __n)"
.br
.RI "Prepare the unordered_multiset for a specified number of elements\&. "
.ti -1c
.RI "\fBsize_type\fP \fBsize\fP () const noexcept"
.br
.RI "Returns the size of the unordered_multiset\&. "
.ti -1c
.RI "\fBvoid\fP \fBswap\fP (\fBunordered_multiset\fP &__x) noexcept(noexcept(_M_h\&.swap(__x\&._M_h)))"
.br
.RI "Swaps data with another unordered_multiset\&. "
.in -1c
.PP
.RI "\fB\fP"
.br

.in +1c
.in +1c
.ti -1c
.RI "\fBiterator\fP \fBbegin\fP () noexcept"
.br
.ti -1c
.RI "\fBconst_iterator\fP \fBbegin\fP () const noexcept"
.br
.in -1c
.in -1c
.PP
.RI "\fB\fP"
.br

.in +1c
.in +1c
.ti -1c
.RI "\fBiterator\fP \fBend\fP () noexcept"
.br
.ti -1c
.RI "\fBconst_iterator\fP \fBend\fP () const noexcept"
.br
.in -1c
.in -1c
.PP
.RI "\fB\fP"
.br

.in +1c
.in +1c
.ti -1c
.RI "\fBiterator\fP \fBinsert\fP (const \fBvalue_type\fP &__x)"
.br
.RI "Inserts an element into the unordered_multiset\&. "
.ti -1c
.RI "\fBiterator\fP \fBinsert\fP (\fBvalue_type\fP &&__x)"
.br
.RI "Inserts an element into the unordered_multiset\&. "
.in -1c
.in -1c
.PP
.RI "\fB\fP"
.br

.in +1c
.in +1c
.ti -1c
.RI "\fBiterator\fP \fBinsert\fP (\fBconst_iterator\fP \fB__hint\fP, const \fBvalue_type\fP &__x)"
.br
.RI "Inserts an element into the unordered_multiset\&. "
.ti -1c
.RI "\fBiterator\fP \fBinsert\fP (\fBconst_iterator\fP \fB__hint\fP, \fBvalue_type\fP &&__x)"
.br
.RI "Inserts an element into the unordered_multiset\&. "
.in -1c
.in -1c
.PP
.RI "\fB\fP"
.br

.in +1c
.in +1c
.ti -1c
.RI "\fBiterator\fP \fBerase\fP (\fBconst_iterator\fP \fB__position\fP)"
.br
.RI "Erases an element from an unordered_multiset\&. "
.ti -1c
.RI "\fBiterator\fP \fBerase\fP (\fBiterator\fP \fB__position\fP)"
.br
.RI "Erases an element from an unordered_multiset\&. "
.in -1c
.in -1c
.PP
.RI "\fB\fP"
.br

.in +1c
.in +1c
.ti -1c
.RI "\fBiterator\fP \fBfind\fP (const \fBkey_type\fP &__x)"
.br
.RI "Tries to locate an element in an unordered_multiset\&. "
.ti -1c
.RI "template<\fBtypename\fP \fB_Kt\fP > \fBauto\fP \fBfind\fP (const \fB_Kt\fP &__x) \-> \fBdecltype\fP(_M_h\&._M_find_tr(__x))"
.br
.RI "Tries to locate an element in an unordered_multiset\&. "
.ti -1c
.RI "\fBconst_iterator\fP \fBfind\fP (const \fBkey_type\fP &__x) const"
.br
.RI "Tries to locate an element in an unordered_multiset\&. "
.ti -1c
.RI "template<\fBtypename\fP \fB_Kt\fP > \fBauto\fP \fBfind\fP (const \fB_Kt\fP &__x) const \-> \fBdecltype\fP(_M_h\&._M_find_tr(__x))"
.br
.RI "Tries to locate an element in an unordered_multiset\&. "
.in -1c
.in -1c
.PP
.RI "\fB\fP"
.br

.in +1c
.in +1c
.ti -1c
.RI "\fBsize_type\fP \fBcount\fP (const \fBkey_type\fP &__x) const"
.br
.RI "Finds the number of elements\&. "
.ti -1c
.RI "template<\fBtypename\fP \fB_Kt\fP > \fBauto\fP \fBcount\fP (const \fB_Kt\fP &__x) const \-> \fBdecltype\fP(_M_h\&._M_count_tr(__x))"
.br
.RI "Finds the number of elements\&. "
.in -1c
.in -1c
.PP
.RI "\fB\fP"
.br

.in +1c
.in +1c
.ti -1c
.RI "bool \fBcontains\fP (const \fBkey_type\fP &__x) const"
.br
.RI "Finds whether an element with the given key exists\&. "
.ti -1c
.RI "template<\fBtypename\fP \fB_Kt\fP > \fBauto\fP \fBcontains\fP (const \fB_Kt\fP &__x) const \-> \fBdecltype\fP(_M_h\&._M_find_tr(__x), \fBvoid\fP(), \fBtrue\fP)"
.br
.RI "Finds whether an element with the given key exists\&. "
.in -1c
.in -1c
.PP
.RI "\fB\fP"
.br

.in +1c
.in +1c
.ti -1c
.RI "\fBstd::pair\fP< \fBiterator\fP, \fBiterator\fP > \fBequal_range\fP (const \fBkey_type\fP &__x)"
.br
.RI "Finds a subsequence matching given key\&. "
.ti -1c
.RI "template<\fBtypename\fP \fB_Kt\fP > \fBauto\fP \fBequal_range\fP (const \fB_Kt\fP &__x) \-> \fBdecltype\fP(_M_h\&._M_equal_range_tr(__x))"
.br
.RI "Finds a subsequence matching given key\&. "
.ti -1c
.RI "\fBstd::pair\fP< \fBconst_iterator\fP, \fBconst_iterator\fP > \fBequal_range\fP (const \fBkey_type\fP &__x) const"
.br
.RI "Finds a subsequence matching given key\&. "
.ti -1c
.RI "template<\fBtypename\fP \fB_Kt\fP > \fBauto\fP \fBequal_range\fP (const \fB_Kt\fP &__x) const \-> \fBdecltype\fP(_M_h\&._M_equal_range_tr(__x))"
.br
.RI "Finds a subsequence matching given key\&. "
.in -1c
.in -1c
.PP
.RI "\fB\fP"
.br

.in +1c
.in +1c
.ti -1c
.RI "\fBlocal_iterator\fP \fBbegin\fP (\fBsize_type\fP __n)"
.br
.RI "Returns a read-only (constant) iterator pointing to the first bucket element\&. "
.ti -1c
.RI "\fBconst_local_iterator\fP \fBbegin\fP (\fBsize_type\fP __n) const"
.br
.RI "Returns a read-only (constant) iterator pointing to the first bucket element\&. "
.ti -1c
.RI "\fBconst_local_iterator\fP \fBcbegin\fP (\fBsize_type\fP __n) const"
.br
.RI "Returns a read-only (constant) iterator pointing to the first bucket element\&. "
.in -1c
.in -1c
.PP
.RI "\fB\fP"
.br

.in +1c
.in +1c
.ti -1c
.RI "\fBlocal_iterator\fP \fBend\fP (\fBsize_type\fP __n)"
.br
.RI "Returns a read-only (constant) iterator pointing to one past the last bucket elements\&. "
.ti -1c
.RI "\fBconst_local_iterator\fP \fBend\fP (\fBsize_type\fP __n) const"
.br
.RI "Returns a read-only (constant) iterator pointing to one past the last bucket elements\&. "
.ti -1c
.RI "\fBconst_local_iterator\fP \fBcend\fP (\fBsize_type\fP __n) const"
.br
.RI "Returns a read-only (constant) iterator pointing to one past the last bucket elements\&. "
.in -1c
.in -1c
.SS "Friends"

.in +1c
.ti -1c
.RI "template<\fBtypename\fP \fB_Value1\fP , \fBtypename\fP \fB_Hash1\fP , \fBtypename\fP \fB_Pred1\fP , \fBtypename\fP _Alloc1 > bool \fBoperator==\fP (const \fBunordered_multiset\fP< \fB_Value1\fP, \fB_Hash1\fP, \fB_Pred1\fP, _Alloc1 > &, const \fBunordered_multiset\fP< \fB_Value1\fP, \fB_Hash1\fP, \fB_Pred1\fP, _Alloc1 > &)"
.br
.ti -1c
.RI "template<\fBtypename\fP , \fBtypename\fP , \fBtypename\fP > \fBclass\fP \fBstd::_Hash_merge_helper\fP"
.br
.in -1c
.SH "Detailed Description"
.PP 

.SS "template<\fBtypename\fP _Value, \fBtypename\fP \fB_Hash\fP = hash<_Value>, \fBtypename\fP \fB_Pred\fP = equal_to<_Value>, \fBtypename\fP _Alloc = allocator<_Value>>
.br
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\&. 


.PP
\fBTemplate Parameters\fP
.RS 4
\fI_Value\fP Type of key objects\&. 
.br
\fI_Hash\fP Hashing function object type, defaults to hash<_Value>\&. 
.br
\fI_Pred\fP Predicate function object type, defaults to equal_to<_Value>\&. 
.br
\fI_Alloc\fP Allocator type, defaults to allocator<_Key>\&.
.RE
.PP
Meets the requirements of a \fCcontainer\fP, and \fCunordered associative container\fP
.PP
Base is _Hashtable, dispatched at compile time via template alias __umset_hashtable\&. 
.SH "Member Typedef Documentation"
.PP 
.SS "template<\fBtypename\fP _Value , \fBtypename\fP \fB_Hash\fP  = hash<_Value>, \fBtypename\fP \fB_Pred\fP  = equal_to<_Value>, \fBtypename\fP _Alloc  = allocator<_Value>> \fBtypedef\fP _Hashtable::allocator_type \fBstd::unordered_multiset\fP< _Value, \fB_Hash\fP, \fB_Pred\fP, _Alloc >::allocator_type"

.PP
Public typedefs\&. 
.SS "template<\fBtypename\fP _Value , \fBtypename\fP \fB_Hash\fP  = hash<_Value>, \fBtypename\fP \fB_Pred\fP  = equal_to<_Value>, \fBtypename\fP _Alloc  = allocator<_Value>> \fBtypedef\fP _Hashtable::const_iterator \fBstd::unordered_multiset\fP< _Value, \fB_Hash\fP, \fB_Pred\fP, _Alloc >::const_iterator"

.PP
Iterator-related typedefs\&. 
.SS "template<\fBtypename\fP _Value , \fBtypename\fP \fB_Hash\fP  = hash<_Value>, \fBtypename\fP \fB_Pred\fP  = equal_to<_Value>, \fBtypename\fP _Alloc  = allocator<_Value>> \fBtypedef\fP _Hashtable::const_local_iterator \fBstd::unordered_multiset\fP< _Value, \fB_Hash\fP, \fB_Pred\fP, _Alloc >::const_local_iterator"

.PP
Iterator-related typedefs\&. 
.SS "template<\fBtypename\fP _Value , \fBtypename\fP \fB_Hash\fP  = hash<_Value>, \fBtypename\fP \fB_Pred\fP  = equal_to<_Value>, \fBtypename\fP _Alloc  = allocator<_Value>> \fBtypedef\fP _Hashtable::const_pointer \fBstd::unordered_multiset\fP< _Value, \fB_Hash\fP, \fB_Pred\fP, _Alloc >::const_pointer"

.PP
Iterator-related typedefs\&. 
.SS "template<\fBtypename\fP _Value , \fBtypename\fP \fB_Hash\fP  = hash<_Value>, \fBtypename\fP \fB_Pred\fP  = equal_to<_Value>, \fBtypename\fP _Alloc  = allocator<_Value>> \fBtypedef\fP _Hashtable::const_reference \fBstd::unordered_multiset\fP< _Value, \fB_Hash\fP, \fB_Pred\fP, _Alloc >::const_reference"

.PP
Iterator-related typedefs\&. 
.SS "template<\fBtypename\fP _Value , \fBtypename\fP \fB_Hash\fP  = hash<_Value>, \fBtypename\fP \fB_Pred\fP  = equal_to<_Value>, \fBtypename\fP _Alloc  = allocator<_Value>> \fBtypedef\fP _Hashtable::difference_type \fBstd::unordered_multiset\fP< _Value, \fB_Hash\fP, \fB_Pred\fP, _Alloc >::difference_type"

.PP
Iterator-related typedefs\&. 
.SS "template<\fBtypename\fP _Value , \fBtypename\fP \fB_Hash\fP  = hash<_Value>, \fBtypename\fP \fB_Pred\fP  = equal_to<_Value>, \fBtypename\fP _Alloc  = allocator<_Value>> \fBtypedef\fP _Hashtable::hasher \fBstd::unordered_multiset\fP< _Value, \fB_Hash\fP, \fB_Pred\fP, _Alloc >::hasher"

.PP
Public typedefs\&. 
.SS "template<\fBtypename\fP _Value , \fBtypename\fP \fB_Hash\fP  = hash<_Value>, \fBtypename\fP \fB_Pred\fP  = equal_to<_Value>, \fBtypename\fP _Alloc  = allocator<_Value>> \fBtypedef\fP _Hashtable::iterator \fBstd::unordered_multiset\fP< _Value, \fB_Hash\fP, \fB_Pred\fP, _Alloc >::iterator"

.PP
Iterator-related typedefs\&. 
.SS "template<\fBtypename\fP _Value , \fBtypename\fP \fB_Hash\fP  = hash<_Value>, \fBtypename\fP \fB_Pred\fP  = equal_to<_Value>, \fBtypename\fP _Alloc  = allocator<_Value>> \fBtypedef\fP _Hashtable::key_equal \fBstd::unordered_multiset\fP< _Value, \fB_Hash\fP, \fB_Pred\fP, _Alloc >::key_equal"

.PP
Public typedefs\&. 
.SS "template<\fBtypename\fP _Value , \fBtypename\fP \fB_Hash\fP  = hash<_Value>, \fBtypename\fP \fB_Pred\fP  = equal_to<_Value>, \fBtypename\fP _Alloc  = allocator<_Value>> \fBtypedef\fP _Hashtable::key_type \fBstd::unordered_multiset\fP< _Value, \fB_Hash\fP, \fB_Pred\fP, _Alloc >::key_type"

.PP
Public typedefs\&. 
.SS "template<\fBtypename\fP _Value , \fBtypename\fP \fB_Hash\fP  = hash<_Value>, \fBtypename\fP \fB_Pred\fP  = equal_to<_Value>, \fBtypename\fP _Alloc  = allocator<_Value>> \fBtypedef\fP _Hashtable::local_iterator \fBstd::unordered_multiset\fP< _Value, \fB_Hash\fP, \fB_Pred\fP, _Alloc >::local_iterator"

.PP
Iterator-related typedefs\&. 
.SS "template<\fBtypename\fP _Value , \fBtypename\fP \fB_Hash\fP  = hash<_Value>, \fBtypename\fP \fB_Pred\fP  = equal_to<_Value>, \fBtypename\fP _Alloc  = allocator<_Value>> \fBtypedef\fP _Hashtable::pointer \fBstd::unordered_multiset\fP< _Value, \fB_Hash\fP, \fB_Pred\fP, _Alloc >::pointer"

.PP
Iterator-related typedefs\&. 
.SS "template<\fBtypename\fP _Value , \fBtypename\fP \fB_Hash\fP  = hash<_Value>, \fBtypename\fP \fB_Pred\fP  = equal_to<_Value>, \fBtypename\fP _Alloc  = allocator<_Value>> \fBtypedef\fP _Hashtable::reference \fBstd::unordered_multiset\fP< _Value, \fB_Hash\fP, \fB_Pred\fP, _Alloc >::reference"

.PP
Iterator-related typedefs\&. 
.SS "template<\fBtypename\fP _Value , \fBtypename\fP \fB_Hash\fP  = hash<_Value>, \fBtypename\fP \fB_Pred\fP  = equal_to<_Value>, \fBtypename\fP _Alloc  = allocator<_Value>> \fBtypedef\fP _Hashtable::size_type \fBstd::unordered_multiset\fP< _Value, \fB_Hash\fP, \fB_Pred\fP, _Alloc >::size_type"

.PP
Iterator-related typedefs\&. 
.SS "template<\fBtypename\fP _Value , \fBtypename\fP \fB_Hash\fP  = hash<_Value>, \fBtypename\fP \fB_Pred\fP  = equal_to<_Value>, \fBtypename\fP _Alloc  = allocator<_Value>> \fBtypedef\fP _Hashtable::value_type \fBstd::unordered_multiset\fP< _Value, \fB_Hash\fP, \fB_Pred\fP, _Alloc >::value_type"

.PP
Public typedefs\&. 
.SH "Constructor & Destructor Documentation"
.PP 
.SS "template<\fBtypename\fP _Value , \fBtypename\fP \fB_Hash\fP  = hash<_Value>, \fBtypename\fP \fB_Pred\fP  = equal_to<_Value>, \fBtypename\fP _Alloc  = allocator<_Value>> \fBstd::unordered_multiset\fP< _Value, \fB_Hash\fP, \fB_Pred\fP, _Alloc >::unordered_multiset ()\fC [default]\fP"

.PP
Default constructor\&. 
.SS "template<\fBtypename\fP _Value , \fBtypename\fP \fB_Hash\fP  = hash<_Value>, \fBtypename\fP \fB_Pred\fP  = equal_to<_Value>, \fBtypename\fP _Alloc  = allocator<_Value>> \fBstd::unordered_multiset\fP< _Value, \fB_Hash\fP, \fB_Pred\fP, _Alloc >::unordered_multiset (\fBsize_type\fP __n, 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"

.PP
Default constructor creates no elements\&. 
.PP
\fBParameters\fP
.RS 4
\fI__n\fP Minimal initial number of buckets\&. 
.br
\fI__hf\fP A hash functor\&. 
.br
\fI__eql\fP A key equality functor\&. 
.br
\fI__a\fP An allocator object\&. 
.RE
.PP

.SS "template<\fBtypename\fP _Value , \fBtypename\fP \fB_Hash\fP  = hash<_Value>, \fBtypename\fP \fB_Pred\fP  = equal_to<_Value>, \fBtypename\fP _Alloc  = allocator<_Value>> template<\fBtypename\fP \fB_InputIterator\fP > \fBstd::unordered_multiset\fP< _Value, \fB_Hash\fP, \fB_Pred\fP, _Alloc >::unordered_multiset (\fB_InputIterator\fP __first, \fB_InputIterator\fP __last, \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"

.PP
Builds an unordered_multiset from a range\&. 
.PP
\fBParameters\fP
.RS 4
\fI__first\fP An input iterator\&. 
.br
\fI__last\fP An input iterator\&. 
.br
\fI__n\fP Minimal initial number of buckets\&. 
.br
\fI__hf\fP A hash functor\&. 
.br
\fI__eql\fP A key equality functor\&. 
.br
\fI__a\fP An allocator object\&.
.RE
.PP
Create an unordered_multiset consisting of copies of the elements from [__first,__last)\&. This is linear in N (where N is distance(__first,__last))\&. 
.SS "template<\fBtypename\fP _Value , \fBtypename\fP \fB_Hash\fP  = hash<_Value>, \fBtypename\fP \fB_Pred\fP  = equal_to<_Value>, \fBtypename\fP _Alloc  = allocator<_Value>> \fBstd::unordered_multiset\fP< _Value, \fB_Hash\fP, \fB_Pred\fP, _Alloc >::unordered_multiset (const \fBunordered_multiset\fP< _Value, \fB_Hash\fP, \fB_Pred\fP, _Alloc > &)\fC [default]\fP"

.PP
Copy constructor\&. 
.SS "template<\fBtypename\fP _Value , \fBtypename\fP \fB_Hash\fP  = hash<_Value>, \fBtypename\fP \fB_Pred\fP  = equal_to<_Value>, \fBtypename\fP _Alloc  = allocator<_Value>> \fBstd::unordered_multiset\fP< _Value, \fB_Hash\fP, \fB_Pred\fP, _Alloc >::unordered_multiset (\fBunordered_multiset\fP< _Value, \fB_Hash\fP, \fB_Pred\fP, _Alloc > &&)\fC [default]\fP"

.PP
Move constructor\&. 
.SS "template<\fBtypename\fP _Value , \fBtypename\fP \fB_Hash\fP  = hash<_Value>, \fBtypename\fP \fB_Pred\fP  = equal_to<_Value>, \fBtypename\fP _Alloc  = allocator<_Value>> \fBstd::unordered_multiset\fP< _Value, \fB_Hash\fP, \fB_Pred\fP, _Alloc >::unordered_multiset (\fBinitializer_list\fP< \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"

.PP
Builds an unordered_multiset from an initializer_list\&. 
.PP
\fBParameters\fP
.RS 4
\fI__l\fP An initializer_list\&. 
.br
\fI__n\fP Minimal initial number of buckets\&. 
.br
\fI__hf\fP A hash functor\&. 
.br
\fI__eql\fP A key equality functor\&. 
.br
\fI__a\fP An allocator object\&.
.RE
.PP
Create an unordered_multiset consisting of copies of the elements in the list\&. This is linear in N (where N is \fI__l\&.size()\fP)\&. 
.SS "template<\fBtypename\fP _Value , \fBtypename\fP \fB_Hash\fP  = hash<_Value>, \fBtypename\fP \fB_Pred\fP  = equal_to<_Value>, \fBtypename\fP _Alloc  = allocator<_Value>> \fBstd::unordered_multiset\fP< _Value, \fB_Hash\fP, \fB_Pred\fP, _Alloc >::unordered_multiset (const \fBallocator_type\fP & __a)\fC [inline]\fP, \fC [explicit]\fP"

.PP
Creates an unordered_multiset with no elements\&. 
.PP
\fBParameters\fP
.RS 4
\fI__a\fP An allocator object\&. 
.RE
.PP

.SH "Member Function Documentation"
.PP 
.SS "template<\fBtypename\fP _Value , \fBtypename\fP \fB_Hash\fP  = hash<_Value>, \fBtypename\fP \fB_Pred\fP  = equal_to<_Value>, \fBtypename\fP _Alloc  = allocator<_Value>> \fBconst_iterator\fP \fBstd::unordered_multiset\fP< _Value, \fB_Hash\fP, \fB_Pred\fP, _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\&. 
.SS "template<\fBtypename\fP _Value , \fBtypename\fP \fB_Hash\fP  = hash<_Value>, \fBtypename\fP \fB_Pred\fP  = equal_to<_Value>, \fBtypename\fP _Alloc  = allocator<_Value>> \fBiterator\fP \fBstd::unordered_multiset\fP< _Value, \fB_Hash\fP, \fB_Pred\fP, _Alloc >::begin ()\fC [inline]\fP, \fC [noexcept]\fP"
Returns a read-only (constant) iterator that points to the first element in the unordered_multiset\&. 
.SS "template<\fBtypename\fP _Value , \fBtypename\fP \fB_Hash\fP  = hash<_Value>, \fBtypename\fP \fB_Pred\fP  = equal_to<_Value>, \fBtypename\fP _Alloc  = allocator<_Value>> \fBlocal_iterator\fP \fBstd::unordered_multiset\fP< _Value, \fB_Hash\fP, \fB_Pred\fP, _Alloc >::begin (\fBsize_type\fP __n)\fC [inline]\fP"

.PP
Returns a read-only (constant) iterator pointing to the first bucket element\&. 
.PP
\fBParameters\fP
.RS 4
\fI__n\fP The bucket index\&. 
.RE
.PP
\fBReturns\fP
.RS 4
A read-only local iterator\&. 
.RE
.PP

.SS "template<\fBtypename\fP _Value , \fBtypename\fP \fB_Hash\fP  = hash<_Value>, \fBtypename\fP \fB_Pred\fP  = equal_to<_Value>, \fBtypename\fP _Alloc  = allocator<_Value>> \fBconst_local_iterator\fP \fBstd::unordered_multiset\fP< _Value, \fB_Hash\fP, \fB_Pred\fP, _Alloc >::begin (\fBsize_type\fP __n) const\fC [inline]\fP"

.PP
Returns a read-only (constant) iterator pointing to the first bucket element\&. 
.PP
\fBParameters\fP
.RS 4
\fI__n\fP The bucket index\&. 
.RE
.PP
\fBReturns\fP
.RS 4
A read-only local iterator\&. 
.RE
.PP

.SS "template<\fBtypename\fP _Value , \fBtypename\fP \fB_Hash\fP  = hash<_Value>, \fBtypename\fP \fB_Pred\fP  = equal_to<_Value>, \fBtypename\fP _Alloc  = allocator<_Value>> \fBsize_type\fP \fBstd::unordered_multiset\fP< _Value, \fB_Hash\fP, \fB_Pred\fP, _Alloc >::bucket_count () const\fC [inline]\fP, \fC [noexcept]\fP"

.PP
Returns the number of buckets of the unordered_multiset\&. 
.SS "template<\fBtypename\fP _Value , \fBtypename\fP \fB_Hash\fP  = hash<_Value>, \fBtypename\fP \fB_Pred\fP  = equal_to<_Value>, \fBtypename\fP _Alloc  = allocator<_Value>> \fBconst_iterator\fP \fBstd::unordered_multiset\fP< _Value, \fB_Hash\fP, \fB_Pred\fP, _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\&. 
.SS "template<\fBtypename\fP _Value , \fBtypename\fP \fB_Hash\fP  = hash<_Value>, \fBtypename\fP \fB_Pred\fP  = equal_to<_Value>, \fBtypename\fP _Alloc  = allocator<_Value>> \fBconst_local_iterator\fP \fBstd::unordered_multiset\fP< _Value, \fB_Hash\fP, \fB_Pred\fP, _Alloc >::cbegin (\fBsize_type\fP __n) const\fC [inline]\fP"

.PP
Returns a read-only (constant) iterator pointing to the first bucket element\&. 
.PP
\fBParameters\fP
.RS 4
\fI__n\fP The bucket index\&. 
.RE
.PP
\fBReturns\fP
.RS 4
A read-only local iterator\&. 
.RE
.PP

.SS "template<\fBtypename\fP _Value , \fBtypename\fP \fB_Hash\fP  = hash<_Value>, \fBtypename\fP \fB_Pred\fP  = equal_to<_Value>, \fBtypename\fP _Alloc  = allocator<_Value>> \fBconst_iterator\fP \fBstd::unordered_multiset\fP< _Value, \fB_Hash\fP, \fB_Pred\fP, _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\&. 
.PP
Referenced by \fBstd::unordered_multiset< _Value, _Hash, _Pred, _Alloc >::insert()\fP\&.
.SS "template<\fBtypename\fP _Value , \fBtypename\fP \fB_Hash\fP  = hash<_Value>, \fBtypename\fP \fB_Pred\fP  = equal_to<_Value>, \fBtypename\fP _Alloc  = allocator<_Value>> \fBconst_local_iterator\fP \fBstd::unordered_multiset\fP< _Value, \fB_Hash\fP, \fB_Pred\fP, _Alloc >::cend (\fBsize_type\fP __n) const\fC [inline]\fP"

.PP
Returns a read-only (constant) iterator pointing to one past the last bucket elements\&. 
.PP
\fBParameters\fP
.RS 4
\fI__n\fP The bucket index\&. 
.RE
.PP
\fBReturns\fP
.RS 4
A read-only local iterator\&. 
.RE
.PP

.SS "template<\fBtypename\fP _Value , \fBtypename\fP \fB_Hash\fP  = hash<_Value>, \fBtypename\fP \fB_Pred\fP  = equal_to<_Value>, \fBtypename\fP _Alloc  = allocator<_Value>> \fBvoid\fP \fBstd::unordered_multiset\fP< _Value, \fB_Hash\fP, \fB_Pred\fP, _Alloc >::clear ()\fC [inline]\fP, \fC [noexcept]\fP"
Erases all elements in an unordered_multiset\&.
.PP
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\&. 
.SS "template<\fBtypename\fP _Value , \fBtypename\fP \fB_Hash\fP  = hash<_Value>, \fBtypename\fP \fB_Pred\fP  = equal_to<_Value>, \fBtypename\fP _Alloc  = allocator<_Value>> template<\fBtypename\fP \fB_Kt\fP > \fBauto\fP \fBstd::unordered_multiset\fP< _Value, \fB_Hash\fP, \fB_Pred\fP, _Alloc >::contains (const \fB_Kt\fP & __x) const \-> \fBdecltype\fP(_M_h\&._M_find_tr(__x), \fBvoid\fP(), \fBtrue\fP)
	\fC [inline]\fP"

.PP
Finds whether an element with the given key exists\&. 
.PP
\fBParameters\fP
.RS 4
\fI__x\fP Key of elements to be located\&. 
.RE
.PP
\fBReturns\fP
.RS 4
True if there is any element with the specified key\&. 
.RE
.PP

.SS "template<\fBtypename\fP _Value , \fBtypename\fP \fB_Hash\fP  = hash<_Value>, \fBtypename\fP \fB_Pred\fP  = equal_to<_Value>, \fBtypename\fP _Alloc  = allocator<_Value>> bool \fBstd::unordered_multiset\fP< _Value, \fB_Hash\fP, \fB_Pred\fP, _Alloc >::contains (const \fBkey_type\fP & __x) const\fC [inline]\fP"

.PP
Finds whether an element with the given key exists\&. 
.PP
\fBParameters\fP
.RS 4
\fI__x\fP Key of elements to be located\&. 
.RE
.PP
\fBReturns\fP
.RS 4
True if there is any element with the specified key\&. 
.RE
.PP

.SS "template<\fBtypename\fP _Value , \fBtypename\fP \fB_Hash\fP  = hash<_Value>, \fBtypename\fP \fB_Pred\fP  = equal_to<_Value>, \fBtypename\fP _Alloc  = allocator<_Value>> template<\fBtypename\fP \fB_Kt\fP > \fBauto\fP \fBstd::unordered_multiset\fP< _Value, \fB_Hash\fP, \fB_Pred\fP, _Alloc >::count (const \fB_Kt\fP & __x) const \-> \fBdecltype\fP(_M_h\&._M_count_tr(__x))
	\fC [inline]\fP"

.PP
Finds the number of elements\&. 
.PP
\fBParameters\fP
.RS 4
\fI__x\fP Element to located\&. 
.RE
.PP
\fBReturns\fP
.RS 4
Number of elements with specified key\&. 
.RE
.PP

.SS "template<\fBtypename\fP _Value , \fBtypename\fP \fB_Hash\fP  = hash<_Value>, \fBtypename\fP \fB_Pred\fP  = equal_to<_Value>, \fBtypename\fP _Alloc  = allocator<_Value>> \fBsize_type\fP \fBstd::unordered_multiset\fP< _Value, \fB_Hash\fP, \fB_Pred\fP, _Alloc >::count (const \fBkey_type\fP & __x) const\fC [inline]\fP"

.PP
Finds the number of elements\&. 
.PP
\fBParameters\fP
.RS 4
\fI__x\fP Element to located\&. 
.RE
.PP
\fBReturns\fP
.RS 4
Number of elements with specified key\&. 
.RE
.PP

.SS "template<\fBtypename\fP _Value , \fBtypename\fP \fB_Hash\fP  = hash<_Value>, \fBtypename\fP \fB_Pred\fP  = equal_to<_Value>, \fBtypename\fP _Alloc  = allocator<_Value>> template<typename\&.\&.\&. _Args> \fBiterator\fP \fBstd::unordered_multiset\fP< _Value, \fB_Hash\fP, \fB_Pred\fP, _Alloc >::emplace (\fB_Args\fP &&\&.\&.\&. __args)\fC [inline]\fP"

.PP
Builds and insert an element into the unordered_multiset\&. 
.PP
\fBParameters\fP
.RS 4
\fI__args\fP Arguments used to generate an element\&. 
.RE
.PP
\fBReturns\fP
.RS 4
An iterator that points to the inserted element\&.
.RE
.PP
Insertion requires amortized constant time\&. 
.SS "template<\fBtypename\fP _Value , \fBtypename\fP \fB_Hash\fP  = hash<_Value>, \fBtypename\fP \fB_Pred\fP  = equal_to<_Value>, \fBtypename\fP _Alloc  = allocator<_Value>> template<typename\&.\&.\&. _Args> \fBiterator\fP \fBstd::unordered_multiset\fP< _Value, \fB_Hash\fP, \fB_Pred\fP, _Alloc >::emplace_hint (\fBconst_iterator\fP __pos, \fB_Args\fP &&\&.\&.\&. __args)\fC [inline]\fP"

.PP
Inserts an element into the unordered_multiset\&. 
.PP
\fBParameters\fP
.RS 4
\fI__pos\fP An iterator that serves as a hint as to where the element should be inserted\&. 
.br
\fI__args\fP Arguments used to generate the element to be inserted\&. 
.RE
.PP
\fBReturns\fP
.RS 4
An iterator that points to the inserted element\&.
.RE
.PP
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\&.
.PP
For more on \fIhinting\fP, see: https://gcc.gnu.org/onlinedocs/libstdc++/manual/associative.html#containers.associative.insert_hints
.PP
Insertion requires amortized constant time\&. 
.SS "template<\fBtypename\fP _Value , \fBtypename\fP \fB_Hash\fP  = hash<_Value>, \fBtypename\fP \fB_Pred\fP  = equal_to<_Value>, \fBtypename\fP _Alloc  = allocator<_Value>> bool \fBstd::unordered_multiset\fP< _Value, \fB_Hash\fP, \fB_Pred\fP, _Alloc >::empty () const\fC [inline]\fP, \fC [noexcept]\fP"

.PP
Returns true if the unordered_multiset is empty\&. 
.SS "template<\fBtypename\fP _Value , \fBtypename\fP \fB_Hash\fP  = hash<_Value>, \fBtypename\fP \fB_Pred\fP  = equal_to<_Value>, \fBtypename\fP _Alloc  = allocator<_Value>> \fBconst_iterator\fP \fBstd::unordered_multiset\fP< _Value, \fB_Hash\fP, \fB_Pred\fP, _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\&. 
.SS "template<\fBtypename\fP _Value , \fBtypename\fP \fB_Hash\fP  = hash<_Value>, \fBtypename\fP \fB_Pred\fP  = equal_to<_Value>, \fBtypename\fP _Alloc  = allocator<_Value>> \fBiterator\fP \fBstd::unordered_multiset\fP< _Value, \fB_Hash\fP, \fB_Pred\fP, _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\&. 
.PP
Referenced by \fBstd::unordered_multiset< _Value, _Hash, _Pred, _Alloc >::extract()\fP\&.
.SS "template<\fBtypename\fP _Value , \fBtypename\fP \fB_Hash\fP  = hash<_Value>, \fBtypename\fP \fB_Pred\fP  = equal_to<_Value>, \fBtypename\fP _Alloc  = allocator<_Value>> \fBlocal_iterator\fP \fBstd::unordered_multiset\fP< _Value, \fB_Hash\fP, \fB_Pred\fP, _Alloc >::end (\fBsize_type\fP __n)\fC [inline]\fP"

.PP
Returns a read-only (constant) iterator pointing to one past the last bucket elements\&. 
.PP
\fBParameters\fP
.RS 4
\fI__n\fP The bucket index\&. 
.RE
.PP
\fBReturns\fP
.RS 4
A read-only local iterator\&. 
.RE
.PP

.SS "template<\fBtypename\fP _Value , \fBtypename\fP \fB_Hash\fP  = hash<_Value>, \fBtypename\fP \fB_Pred\fP  = equal_to<_Value>, \fBtypename\fP _Alloc  = allocator<_Value>> \fBconst_local_iterator\fP \fBstd::unordered_multiset\fP< _Value, \fB_Hash\fP, \fB_Pred\fP, _Alloc >::end (\fBsize_type\fP __n) const\fC [inline]\fP"

.PP
Returns a read-only (constant) iterator pointing to one past the last bucket elements\&. 
.PP
\fBParameters\fP
.RS 4
\fI__n\fP The bucket index\&. 
.RE
.PP
\fBReturns\fP
.RS 4
A read-only local iterator\&. 
.RE
.PP

.SS "template<\fBtypename\fP _Value , \fBtypename\fP \fB_Hash\fP  = hash<_Value>, \fBtypename\fP \fB_Pred\fP  = equal_to<_Value>, \fBtypename\fP _Alloc  = allocator<_Value>> template<\fBtypename\fP \fB_Kt\fP > \fBauto\fP \fBstd::unordered_multiset\fP< _Value, \fB_Hash\fP, \fB_Pred\fP, _Alloc >::equal_range (const \fB_Kt\fP & __x) \-> \fBdecltype\fP(_M_h\&._M_equal_range_tr(__x))
	\fC [inline]\fP"

.PP
Finds a subsequence matching given key\&. 
.PP
\fBParameters\fP
.RS 4
\fI__x\fP Key to be located\&. 
.RE
.PP
\fBReturns\fP
.RS 4
Pair of iterators that possibly points to the subsequence matching given key\&. 
.RE
.PP

.SS "template<\fBtypename\fP _Value , \fBtypename\fP \fB_Hash\fP  = hash<_Value>, \fBtypename\fP \fB_Pred\fP  = equal_to<_Value>, \fBtypename\fP _Alloc  = allocator<_Value>> template<\fBtypename\fP \fB_Kt\fP > \fBauto\fP \fBstd::unordered_multiset\fP< _Value, \fB_Hash\fP, \fB_Pred\fP, _Alloc >::equal_range (const \fB_Kt\fP & __x) const \-> \fBdecltype\fP(_M_h\&._M_equal_range_tr(__x))
	\fC [inline]\fP"

.PP
Finds a subsequence matching given key\&. 
.PP
\fBParameters\fP
.RS 4
\fI__x\fP Key to be located\&. 
.RE
.PP
\fBReturns\fP
.RS 4
Pair of iterators that possibly points to the subsequence matching given key\&. 
.RE
.PP

.SS "template<\fBtypename\fP _Value , \fBtypename\fP \fB_Hash\fP  = hash<_Value>, \fBtypename\fP \fB_Pred\fP  = equal_to<_Value>, \fBtypename\fP _Alloc  = allocator<_Value>> \fBstd::pair\fP< \fBiterator\fP, \fBiterator\fP > \fBstd::unordered_multiset\fP< _Value, \fB_Hash\fP, \fB_Pred\fP, _Alloc >::equal_range (const \fBkey_type\fP & __x)\fC [inline]\fP"

.PP
Finds a subsequence matching given key\&. 
.PP
\fBParameters\fP
.RS 4
\fI__x\fP Key to be located\&. 
.RE
.PP
\fBReturns\fP
.RS 4
Pair of iterators that possibly points to the subsequence matching given key\&. 
.RE
.PP

.SS "template<\fBtypename\fP _Value , \fBtypename\fP \fB_Hash\fP  = hash<_Value>, \fBtypename\fP \fB_Pred\fP  = equal_to<_Value>, \fBtypename\fP _Alloc  = allocator<_Value>> \fBstd::pair\fP< \fBconst_iterator\fP, \fBconst_iterator\fP > \fBstd::unordered_multiset\fP< _Value, \fB_Hash\fP, \fB_Pred\fP, _Alloc >::equal_range (const \fBkey_type\fP & __x) const\fC [inline]\fP"

.PP
Finds a subsequence matching given key\&. 
.PP
\fBParameters\fP
.RS 4
\fI__x\fP Key to be located\&. 
.RE
.PP
\fBReturns\fP
.RS 4
Pair of iterators that possibly points to the subsequence matching given key\&. 
.RE
.PP

.SS "template<\fBtypename\fP _Value , \fBtypename\fP \fB_Hash\fP  = hash<_Value>, \fBtypename\fP \fB_Pred\fP  = equal_to<_Value>, \fBtypename\fP _Alloc  = allocator<_Value>> \fBsize_type\fP \fBstd::unordered_multiset\fP< _Value, \fB_Hash\fP, \fB_Pred\fP, _Alloc >::erase (const \fBkey_type\fP & __x)\fC [inline]\fP"

.PP
Erases elements according to the provided key\&. 
.PP
\fBParameters\fP
.RS 4
\fI__x\fP Key of element to be erased\&. 
.RE
.PP
\fBReturns\fP
.RS 4
The number of elements erased\&.
.RE
.PP
This function erases all the elements located by the given key from an unordered_multiset\&.
.PP
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\&. 
.SS "template<\fBtypename\fP _Value , \fBtypename\fP \fB_Hash\fP  = hash<_Value>, \fBtypename\fP \fB_Pred\fP  = equal_to<_Value>, \fBtypename\fP _Alloc  = allocator<_Value>> \fBiterator\fP \fBstd::unordered_multiset\fP< _Value, \fB_Hash\fP, \fB_Pred\fP, _Alloc >::erase (\fBconst_iterator\fP __first, \fBconst_iterator\fP __last)\fC [inline]\fP"

.PP
Erases a [__first,__last) range of elements from an unordered_multiset\&. 
.PP
\fBParameters\fP
.RS 4
\fI__first\fP Iterator pointing to the start of the range to be erased\&. 
.br
\fI__last\fP Iterator pointing to the end of the range to be erased\&. 
.RE
.PP
\fBReturns\fP
.RS 4
The iterator \fI__last\fP\&.
.RE
.PP
This function erases a sequence of elements from an unordered_multiset\&.
.PP
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\&. 
.SS "template<\fBtypename\fP _Value , \fBtypename\fP \fB_Hash\fP  = hash<_Value>, \fBtypename\fP \fB_Pred\fP  = equal_to<_Value>, \fBtypename\fP _Alloc  = allocator<_Value>> \fBiterator\fP \fBstd::unordered_multiset\fP< _Value, \fB_Hash\fP, \fB_Pred\fP, _Alloc >::erase (\fBconst_iterator\fP __position)\fC [inline]\fP"

.PP
Erases an element from an unordered_multiset\&. 
.PP
\fBParameters\fP
.RS 4
\fI__position\fP An iterator pointing to the element to be erased\&. 
.RE
.PP
\fBReturns\fP
.RS 4
An iterator pointing to the element immediately following \fI__position\fP prior to the element being erased\&. If no such element exists, end() is returned\&.
.RE
.PP
This function erases an element, pointed to by the given iterator, from an unordered_multiset\&.
.PP
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\&. 
.SS "template<\fBtypename\fP _Value , \fBtypename\fP \fB_Hash\fP  = hash<_Value>, \fBtypename\fP \fB_Pred\fP  = equal_to<_Value>, \fBtypename\fP _Alloc  = allocator<_Value>> \fBiterator\fP \fBstd::unordered_multiset\fP< _Value, \fB_Hash\fP, \fB_Pred\fP, _Alloc >::erase (\fBiterator\fP __position)\fC [inline]\fP"

.PP
Erases an element from an unordered_multiset\&. 
.PP
\fBParameters\fP
.RS 4
\fI__position\fP An iterator pointing to the element to be erased\&. 
.RE
.PP
\fBReturns\fP
.RS 4
An iterator pointing to the element immediately following \fI__position\fP prior to the element being erased\&. If no such element exists, end() is returned\&.
.RE
.PP
This function erases an element, pointed to by the given iterator, from an unordered_multiset\&.
.PP
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\&. 
.SS "template<\fBtypename\fP _Value , \fBtypename\fP \fB_Hash\fP  = hash<_Value>, \fBtypename\fP \fB_Pred\fP  = equal_to<_Value>, \fBtypename\fP _Alloc  = allocator<_Value>> node_type \fBstd::unordered_multiset\fP< _Value, \fB_Hash\fP, \fB_Pred\fP, _Alloc >::extract (const \fBkey_type\fP & __key)\fC [inline]\fP"

.PP
Extract a node\&. 
.SS "template<\fBtypename\fP _Value , \fBtypename\fP \fB_Hash\fP  = hash<_Value>, \fBtypename\fP \fB_Pred\fP  = equal_to<_Value>, \fBtypename\fP _Alloc  = allocator<_Value>> node_type \fBstd::unordered_multiset\fP< _Value, \fB_Hash\fP, \fB_Pred\fP, _Alloc >::extract (\fBconst_iterator\fP __pos)\fC [inline]\fP"

.PP
Extract a node\&. 
.PP
References \fBstd::unordered_multiset< _Value, _Hash, _Pred, _Alloc >::end()\fP\&.
.SS "template<\fBtypename\fP _Value , \fBtypename\fP \fB_Hash\fP  = hash<_Value>, \fBtypename\fP \fB_Pred\fP  = equal_to<_Value>, \fBtypename\fP _Alloc  = allocator<_Value>> template<\fBtypename\fP \fB_Kt\fP > \fBauto\fP \fBstd::unordered_multiset\fP< _Value, \fB_Hash\fP, \fB_Pred\fP, _Alloc >::find (const \fB_Kt\fP & __x) \-> \fBdecltype\fP(_M_h\&._M_find_tr(__x))
	\fC [inline]\fP"

.PP
Tries to locate an element in an unordered_multiset\&. 
.PP
\fBParameters\fP
.RS 4
\fI__x\fP Element to be located\&. 
.RE
.PP
\fBReturns\fP
.RS 4
Iterator pointing to sought-after element, or end() if not found\&.
.RE
.PP
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 ( \fCend()\fP ) iterator\&. 
.SS "template<\fBtypename\fP _Value , \fBtypename\fP \fB_Hash\fP  = hash<_Value>, \fBtypename\fP \fB_Pred\fP  = equal_to<_Value>, \fBtypename\fP _Alloc  = allocator<_Value>> template<\fBtypename\fP \fB_Kt\fP > \fBauto\fP \fBstd::unordered_multiset\fP< _Value, \fB_Hash\fP, \fB_Pred\fP, _Alloc >::find (const \fB_Kt\fP & __x) const \-> \fBdecltype\fP(_M_h\&._M_find_tr(__x))
	\fC [inline]\fP"

.PP
Tries to locate an element in an unordered_multiset\&. 
.PP
\fBParameters\fP
.RS 4
\fI__x\fP Element to be located\&. 
.RE
.PP
\fBReturns\fP
.RS 4
Iterator pointing to sought-after element, or end() if not found\&.
.RE
.PP
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 ( \fCend()\fP ) iterator\&. 
.SS "template<\fBtypename\fP _Value , \fBtypename\fP \fB_Hash\fP  = hash<_Value>, \fBtypename\fP \fB_Pred\fP  = equal_to<_Value>, \fBtypename\fP _Alloc  = allocator<_Value>> \fBiterator\fP \fBstd::unordered_multiset\fP< _Value, \fB_Hash\fP, \fB_Pred\fP, _Alloc >::find (const \fBkey_type\fP & __x)\fC [inline]\fP"

.PP
Tries to locate an element in an unordered_multiset\&. 
.PP
\fBParameters\fP
.RS 4
\fI__x\fP Element to be located\&. 
.RE
.PP
\fBReturns\fP
.RS 4
Iterator pointing to sought-after element, or end() if not found\&.
.RE
.PP
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 ( \fCend()\fP ) iterator\&. 
.SS "template<\fBtypename\fP _Value , \fBtypename\fP \fB_Hash\fP  = hash<_Value>, \fBtypename\fP \fB_Pred\fP  = equal_to<_Value>, \fBtypename\fP _Alloc  = allocator<_Value>> \fBconst_iterator\fP \fBstd::unordered_multiset\fP< _Value, \fB_Hash\fP, \fB_Pred\fP, _Alloc >::find (const \fBkey_type\fP & __x) const\fC [inline]\fP"

.PP
Tries to locate an element in an unordered_multiset\&. 
.PP
\fBParameters\fP
.RS 4
\fI__x\fP Element to be located\&. 
.RE
.PP
\fBReturns\fP
.RS 4
Iterator pointing to sought-after element, or end() if not found\&.
.RE
.PP
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 ( \fCend()\fP ) iterator\&. 
.SS "template<\fBtypename\fP _Value , \fBtypename\fP \fB_Hash\fP  = hash<_Value>, \fBtypename\fP \fB_Pred\fP  = equal_to<_Value>, \fBtypename\fP _Alloc  = allocator<_Value>> \fBallocator_type\fP \fBstd::unordered_multiset\fP< _Value, \fB_Hash\fP, \fB_Pred\fP, _Alloc >::get_allocator () const\fC [inline]\fP, \fC [noexcept]\fP"

.PP
Returns the allocator object used by the unordered_multiset\&. 
.SS "template<\fBtypename\fP _Value , \fBtypename\fP \fB_Hash\fP  = hash<_Value>, \fBtypename\fP \fB_Pred\fP  = equal_to<_Value>, \fBtypename\fP _Alloc  = allocator<_Value>> \fBhasher\fP \fBstd::unordered_multiset\fP< _Value, \fB_Hash\fP, \fB_Pred\fP, _Alloc >::hash_function () const\fC [inline]\fP"

.PP
Returns the hash functor object with which the unordered_multiset was constructed\&. 
.SS "template<\fBtypename\fP _Value , \fBtypename\fP \fB_Hash\fP  = hash<_Value>, \fBtypename\fP \fB_Pred\fP  = equal_to<_Value>, \fBtypename\fP _Alloc  = allocator<_Value>> template<\fBtypename\fP \fB_InputIterator\fP > \fBvoid\fP \fBstd::unordered_multiset\fP< _Value, \fB_Hash\fP, \fB_Pred\fP, _Alloc >::insert (\fB_InputIterator\fP __first, \fB_InputIterator\fP __last)\fC [inline]\fP"

.PP
A template function that inserts a range of elements\&. 
.PP
\fBParameters\fP
.RS 4
\fI__first\fP Iterator pointing to the start of the range to be inserted\&. 
.br
\fI__last\fP Iterator pointing to the end of the range\&.
.RE
.PP
Complexity similar to that of the range constructor\&. 
.SS "template<\fBtypename\fP _Value , \fBtypename\fP \fB_Hash\fP  = hash<_Value>, \fBtypename\fP \fB_Pred\fP  = equal_to<_Value>, \fBtypename\fP _Alloc  = allocator<_Value>> \fBiterator\fP \fBstd::unordered_multiset\fP< _Value, \fB_Hash\fP, \fB_Pred\fP, _Alloc >::insert (const \fBvalue_type\fP & __x)\fC [inline]\fP"

.PP
Inserts an element into the unordered_multiset\&. 
.PP
\fBParameters\fP
.RS 4
\fI__x\fP Element to be inserted\&. 
.RE
.PP
\fBReturns\fP
.RS 4
An iterator that points to the inserted element\&.
.RE
.PP
Insertion requires amortized constant time\&. 
.SS "template<\fBtypename\fP _Value , \fBtypename\fP \fB_Hash\fP  = hash<_Value>, \fBtypename\fP \fB_Pred\fP  = equal_to<_Value>, \fBtypename\fP _Alloc  = allocator<_Value>> \fBiterator\fP \fBstd::unordered_multiset\fP< _Value, \fB_Hash\fP, \fB_Pred\fP, _Alloc >::insert (\fBconst_iterator\fP __hint, const \fBvalue_type\fP & __x)\fC [inline]\fP"

.PP
Inserts an element into the unordered_multiset\&. 
.PP
\fBParameters\fP
.RS 4
\fI__hint\fP An iterator that serves as a hint as to where the element should be inserted\&. 
.br
\fI__x\fP Element to be inserted\&. 
.RE
.PP
\fBReturns\fP
.RS 4
An iterator that points to the inserted element\&.
.RE
.PP
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\&.
.PP
For more on \fIhinting\fP, see: https://gcc.gnu.org/onlinedocs/libstdc++/manual/associative.html#containers.associative.insert_hints
.PP
Insertion requires amortized constant\&. 
.SS "template<\fBtypename\fP _Value , \fBtypename\fP \fB_Hash\fP  = hash<_Value>, \fBtypename\fP \fB_Pred\fP  = equal_to<_Value>, \fBtypename\fP _Alloc  = allocator<_Value>> \fBiterator\fP \fBstd::unordered_multiset\fP< _Value, \fB_Hash\fP, \fB_Pred\fP, _Alloc >::insert (\fBconst_iterator\fP __hint, node_type && __nh)\fC [inline]\fP"

.PP
Re-insert an extracted node\&. 
.PP
References \fBstd::move()\fP\&.
.SS "template<\fBtypename\fP _Value , \fBtypename\fP \fB_Hash\fP  = hash<_Value>, \fBtypename\fP \fB_Pred\fP  = equal_to<_Value>, \fBtypename\fP _Alloc  = allocator<_Value>> \fBiterator\fP \fBstd::unordered_multiset\fP< _Value, \fB_Hash\fP, \fB_Pred\fP, _Alloc >::insert (\fBconst_iterator\fP __hint, \fBvalue_type\fP && __x)\fC [inline]\fP"

.PP
Inserts an element into the unordered_multiset\&. 
.PP
\fBParameters\fP
.RS 4
\fI__hint\fP An iterator that serves as a hint as to where the element should be inserted\&. 
.br
\fI__x\fP Element to be inserted\&. 
.RE
.PP
\fBReturns\fP
.RS 4
An iterator that points to the inserted element\&.
.RE
.PP
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\&.
.PP
For more on \fIhinting\fP, see: https://gcc.gnu.org/onlinedocs/libstdc++/manual/associative.html#containers.associative.insert_hints
.PP
Insertion requires amortized constant\&. 
.PP
References \fBstd::move()\fP\&.
.SS "template<\fBtypename\fP _Value , \fBtypename\fP \fB_Hash\fP  = hash<_Value>, \fBtypename\fP \fB_Pred\fP  = equal_to<_Value>, \fBtypename\fP _Alloc  = allocator<_Value>> \fBvoid\fP \fBstd::unordered_multiset\fP< _Value, \fB_Hash\fP, \fB_Pred\fP, _Alloc >::insert (\fBinitializer_list\fP< \fBvalue_type\fP > __l)\fC [inline]\fP"

.PP
Inserts a list of elements into the unordered_multiset\&. 
.PP
\fBParameters\fP
.RS 4
\fI__l\fP A std::initializer_list<value_type> of elements to be inserted\&.
.RE
.PP
Complexity similar to that of the range constructor\&. 
.SS "template<\fBtypename\fP _Value , \fBtypename\fP \fB_Hash\fP  = hash<_Value>, \fBtypename\fP \fB_Pred\fP  = equal_to<_Value>, \fBtypename\fP _Alloc  = allocator<_Value>> \fBiterator\fP \fBstd::unordered_multiset\fP< _Value, \fB_Hash\fP, \fB_Pred\fP, _Alloc >::insert (node_type && __nh)\fC [inline]\fP"

.PP
Re-insert an extracted node\&. 
.PP
References \fBstd::unordered_multiset< _Value, _Hash, _Pred, _Alloc >::cend()\fP, and \fBstd::move()\fP\&.
.SS "template<\fBtypename\fP _Value , \fBtypename\fP \fB_Hash\fP  = hash<_Value>, \fBtypename\fP \fB_Pred\fP  = equal_to<_Value>, \fBtypename\fP _Alloc  = allocator<_Value>> \fBiterator\fP \fBstd::unordered_multiset\fP< _Value, \fB_Hash\fP, \fB_Pred\fP, _Alloc >::insert (\fBvalue_type\fP && __x)\fC [inline]\fP"

.PP
Inserts an element into the unordered_multiset\&. 
.PP
\fBParameters\fP
.RS 4
\fI__x\fP Element to be inserted\&. 
.RE
.PP
\fBReturns\fP
.RS 4
An iterator that points to the inserted element\&.
.RE
.PP
Insertion requires amortized constant time\&. 
.PP
References \fBstd::move()\fP\&.
.SS "template<\fBtypename\fP _Value , \fBtypename\fP \fB_Hash\fP  = hash<_Value>, \fBtypename\fP \fB_Pred\fP  = equal_to<_Value>, \fBtypename\fP _Alloc  = allocator<_Value>> \fBkey_equal\fP \fBstd::unordered_multiset\fP< _Value, \fB_Hash\fP, \fB_Pred\fP, _Alloc >::key_eq () const\fC [inline]\fP"

.PP
Returns the key comparison object with which the unordered_multiset was constructed\&. 
.SS "template<\fBtypename\fP _Value , \fBtypename\fP \fB_Hash\fP  = hash<_Value>, \fBtypename\fP \fB_Pred\fP  = equal_to<_Value>, \fBtypename\fP _Alloc  = allocator<_Value>> float \fBstd::unordered_multiset\fP< _Value, \fB_Hash\fP, \fB_Pred\fP, _Alloc >::load_factor () const\fC [inline]\fP, \fC [noexcept]\fP"

.PP
Returns the average number of elements per bucket\&. 
.SS "template<\fBtypename\fP _Value , \fBtypename\fP \fB_Hash\fP  = hash<_Value>, \fBtypename\fP \fB_Pred\fP  = equal_to<_Value>, \fBtypename\fP _Alloc  = allocator<_Value>> \fBsize_type\fP \fBstd::unordered_multiset\fP< _Value, \fB_Hash\fP, \fB_Pred\fP, _Alloc >::max_bucket_count () const\fC [inline]\fP, \fC [noexcept]\fP"

.PP
Returns the maximum number of buckets of the unordered_multiset\&. 
.SS "template<\fBtypename\fP _Value , \fBtypename\fP \fB_Hash\fP  = hash<_Value>, \fBtypename\fP \fB_Pred\fP  = equal_to<_Value>, \fBtypename\fP _Alloc  = allocator<_Value>> float \fBstd::unordered_multiset\fP< _Value, \fB_Hash\fP, \fB_Pred\fP, _Alloc >::max_load_factor () const\fC [inline]\fP, \fC [noexcept]\fP"

.PP
Returns a positive number that the unordered_multiset tries to keep the load factor less than or equal to\&. 
.SS "template<\fBtypename\fP _Value , \fBtypename\fP \fB_Hash\fP  = hash<_Value>, \fBtypename\fP \fB_Pred\fP  = equal_to<_Value>, \fBtypename\fP _Alloc  = allocator<_Value>> \fBvoid\fP \fBstd::unordered_multiset\fP< _Value, \fB_Hash\fP, \fB_Pred\fP, _Alloc >::max_load_factor (float __z)\fC [inline]\fP"

.PP
Change the unordered_multiset maximum load factor\&. 
.PP
\fBParameters\fP
.RS 4
\fI__z\fP The new maximum load factor\&. 
.RE
.PP

.SS "template<\fBtypename\fP _Value , \fBtypename\fP \fB_Hash\fP  = hash<_Value>, \fBtypename\fP \fB_Pred\fP  = equal_to<_Value>, \fBtypename\fP _Alloc  = allocator<_Value>> \fBsize_type\fP \fBstd::unordered_multiset\fP< _Value, \fB_Hash\fP, \fB_Pred\fP, _Alloc >::max_size () const\fC [inline]\fP, \fC [noexcept]\fP"

.PP
Returns the maximum size of the unordered_multiset\&. 
.SS "template<\fBtypename\fP _Value , \fBtypename\fP \fB_Hash\fP  = hash<_Value>, \fBtypename\fP \fB_Pred\fP  = equal_to<_Value>, \fBtypename\fP _Alloc  = allocator<_Value>> \fBunordered_multiset\fP & \fBstd::unordered_multiset\fP< _Value, \fB_Hash\fP, \fB_Pred\fP, _Alloc >::operator= (const \fBunordered_multiset\fP< _Value, \fB_Hash\fP, \fB_Pred\fP, _Alloc > &)\fC [default]\fP"

.PP
Copy assignment operator\&. 
.SS "template<\fBtypename\fP _Value , \fBtypename\fP \fB_Hash\fP  = hash<_Value>, \fBtypename\fP \fB_Pred\fP  = equal_to<_Value>, \fBtypename\fP _Alloc  = allocator<_Value>> \fBunordered_multiset\fP & \fBstd::unordered_multiset\fP< _Value, \fB_Hash\fP, \fB_Pred\fP, _Alloc >::operator= (\fBinitializer_list\fP< \fBvalue_type\fP > __l)\fC [inline]\fP"

.PP
Unordered_multiset list assignment operator\&. 
.PP
\fBParameters\fP
.RS 4
\fI__l\fP An initializer_list\&.
.RE
.PP
This function fills an unordered_multiset with copies of the elements in the initializer list \fI__l\fP\&.
.PP
Note that the assignment completely changes the unordered_multiset and that the resulting unordered_multiset's size is the same as the number of elements assigned\&. 
.SS "template<\fBtypename\fP _Value , \fBtypename\fP \fB_Hash\fP  = hash<_Value>, \fBtypename\fP \fB_Pred\fP  = equal_to<_Value>, \fBtypename\fP _Alloc  = allocator<_Value>> \fBunordered_multiset\fP & \fBstd::unordered_multiset\fP< _Value, \fB_Hash\fP, \fB_Pred\fP, _Alloc >::operator= (\fBunordered_multiset\fP< _Value, \fB_Hash\fP, \fB_Pred\fP, _Alloc > &&)\fC [default]\fP"

.PP
Move assignment operator\&. 
.SS "template<\fBtypename\fP _Value , \fBtypename\fP \fB_Hash\fP  = hash<_Value>, \fBtypename\fP \fB_Pred\fP  = equal_to<_Value>, \fBtypename\fP _Alloc  = allocator<_Value>> \fBvoid\fP \fBstd::unordered_multiset\fP< _Value, \fB_Hash\fP, \fB_Pred\fP, _Alloc >::rehash (\fBsize_type\fP __n)\fC [inline]\fP"

.PP
May rehash the unordered_multiset\&. 
.PP
\fBParameters\fP
.RS 4
\fI__n\fP The new number of buckets\&.
.RE
.PP
Rehash will occur only if the new number of buckets respect the unordered_multiset maximum load factor\&. 
.SS "template<\fBtypename\fP _Value , \fBtypename\fP \fB_Hash\fP  = hash<_Value>, \fBtypename\fP \fB_Pred\fP  = equal_to<_Value>, \fBtypename\fP _Alloc  = allocator<_Value>> \fBvoid\fP \fBstd::unordered_multiset\fP< _Value, \fB_Hash\fP, \fB_Pred\fP, _Alloc >::reserve (\fBsize_type\fP __n)\fC [inline]\fP"

.PP
Prepare the unordered_multiset for a specified number of elements\&. 
.PP
\fBParameters\fP
.RS 4
\fI__n\fP Number of elements required\&.
.RE
.PP
Same as rehash(ceil(n / max_load_factor()))\&. 
.SS "template<\fBtypename\fP _Value , \fBtypename\fP \fB_Hash\fP  = hash<_Value>, \fBtypename\fP \fB_Pred\fP  = equal_to<_Value>, \fBtypename\fP _Alloc  = allocator<_Value>> \fBsize_type\fP \fBstd::unordered_multiset\fP< _Value, \fB_Hash\fP, \fB_Pred\fP, _Alloc >::size () const\fC [inline]\fP, \fC [noexcept]\fP"

.PP
Returns the size of the unordered_multiset\&. 
.SS "template<\fBtypename\fP _Value , \fBtypename\fP \fB_Hash\fP  = hash<_Value>, \fBtypename\fP \fB_Pred\fP  = equal_to<_Value>, \fBtypename\fP _Alloc  = allocator<_Value>> \fBvoid\fP \fBstd::unordered_multiset\fP< _Value, \fB_Hash\fP, \fB_Pred\fP, _Alloc >::swap (\fBunordered_multiset\fP< _Value, \fB_Hash\fP, \fB_Pred\fP, _Alloc > & __x)\fC [inline]\fP, \fC [noexcept]\fP"

.PP
Swaps data with another unordered_multiset\&. 
.PP
\fBParameters\fP
.RS 4
\fI__x\fP An unordered_multiset of the same element and allocator types\&.
.RE
.PP
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\&. 

.SH "Author"
.PP 
Generated automatically by Doxygen for libstdc++ from the source code\&.