.TH "std::unordered_multiset< _Value, _Hash, _Pred, _Alloc >" 3cxx "Fri Dec 19 2014" "libstdc++" \" -*- nroff -*-
.ad l
.nh
.SH NAME
std::unordered_multiset< _Value, _Hash, _Pred, _Alloc > \- 
.SH SYNOPSIS
.br
.PP
.PP
Inherits std::__allow_copy_cons< bool >\&.
.SS "Public Types"

.PP
.RI "\fB\fP"
.br

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

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

.in +1c
.ti -1c
.RI "\fBunordered_multiset\fP (\fBsize_type\fP __n=10, const \fBhasher\fP &__hf=\fBhasher\fP(), const \fBkey_equal\fP &__eql=\fBkey_equal\fP(), const \fBallocator_type\fP &__a=\fBallocator_type\fP())"
.br
.ti -1c
.RI "template<typename _InputIterator > \fBunordered_multiset\fP (_InputIterator __f, _InputIterator __l, \fBsize_type\fP __n=0, const \fBhasher\fP &__hf=\fBhasher\fP(), const \fBkey_equal\fP &__eql=\fBkey_equal\fP(), const \fBallocator_type\fP &__a=\fBallocator_type\fP())"
.br
.ti -1c
.RI "\fBunordered_multiset\fP (const \fBunordered_multiset\fP &)=default"
.br
.ti -1c
.RI "\fBunordered_multiset\fP (\fBunordered_multiset\fP &&)=default"
.br
.ti -1c
.RI "\fBunordered_multiset\fP (initializer_list< \fBvalue_type\fP > __l, \fBsize_type\fP __n=0, const \fBhasher\fP &__hf=\fBhasher\fP(), const \fBkey_equal\fP &__eql=\fBkey_equal\fP(), const \fBallocator_type\fP &__a=\fBallocator_type\fP())"
.br
.ti -1c
.RI "\fBsize_type\fP \fBbucket\fP (const \fBkey_type\fP &__key) const "
.br
.ti -1c
.RI "\fBsize_type\fP \fBbucket_count\fP () const noexcept"
.br
.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 "void \fBclear\fP () noexcept"
.br
.ti -1c
.RI "\fBsize_type\fP \fBcount\fP (const \fBkey_type\fP &__x) const "
.br
.ti -1c
.RI "template<typename\&.\&.\&. _Args> \fBiterator\fP \fBemplace\fP (_Args &&\&.\&.\&.__args)"
.br
.ti -1c
.RI "template<typename\&.\&.\&. _Args> \fBiterator\fP \fBemplace_hint\fP (\fBconst_iterator\fP __pos, _Args &&\&.\&.\&.__args)"
.br
.ti -1c
.RI "bool \fBempty\fP () const noexcept"
.br
.ti -1c
.RI "\fBsize_type\fP \fBerase\fP (const \fBkey_type\fP &__x)"
.br
.ti -1c
.RI "\fBiterator\fP \fBerase\fP (\fBconst_iterator\fP __first, \fBconst_iterator\fP __last)"
.br
.ti -1c
.RI "\fBallocator_type\fP \fBget_allocator\fP () const noexcept"
.br
.ti -1c
.RI "\fBhasher\fP \fBhash_function\fP () const "
.br
.ti -1c
.RI "template<typename _InputIterator > void \fBinsert\fP (_InputIterator __first, _InputIterator __last)"
.br
.ti -1c
.RI "void \fBinsert\fP (initializer_list< \fBvalue_type\fP > __l)"
.br
.ti -1c
.RI "\fBkey_equal\fP \fBkey_eq\fP () const "
.br
.ti -1c
.RI "float \fBload_factor\fP () const noexcept"
.br
.ti -1c
.RI "\fBsize_type\fP \fBmax_bucket_count\fP () const noexcept"
.br
.ti -1c
.RI "float \fBmax_load_factor\fP () const noexcept"
.br
.ti -1c
.RI "void \fBmax_load_factor\fP (float __z)"
.br
.ti -1c
.RI "\fBsize_type\fP \fBmax_size\fP () const noexcept"
.br
.ti -1c
.RI "\fBunordered_multiset\fP & \fBoperator=\fP (const \fBunordered_multiset\fP &)=default"
.br
.ti -1c
.RI "\fBunordered_multiset\fP & \fBoperator=\fP (\fBunordered_multiset\fP &&__x)=default"
.br
.ti -1c
.RI "\fBunordered_multiset\fP & \fBoperator=\fP (initializer_list< \fBvalue_type\fP > __l)"
.br
.ti -1c
.RI "void \fBrehash\fP (\fBsize_type\fP __n)"
.br
.ti -1c
.RI "void \fBreserve\fP (\fBsize_type\fP __n)"
.br
.ti -1c
.RI "\fBsize_type\fP \fBsize\fP () const noexcept"
.br
.ti -1c
.RI "void \fBswap\fP (\fBunordered_multiset\fP &__x)"
.br
.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
.ti -1c
.RI "\fBiterator\fP \fBinsert\fP (\fBvalue_type\fP &&__x)"
.br
.in -1c
.in -1c
.PP
.RI "\fB\fP"
.br

.in +1c
.in +1c
.ti -1c
.RI "\fBiterator\fP \fBinsert\fP (\fBconst_iterator\fP __hint, const \fBvalue_type\fP &__x)"
.br
.ti -1c
.RI "\fBiterator\fP \fBinsert\fP (\fBconst_iterator\fP __hint, \fBvalue_type\fP &&__x)"
.br
.in -1c
.in -1c
.PP
.RI "\fB\fP"
.br

.in +1c
.in +1c
.ti -1c
.RI "\fBiterator\fP \fBerase\fP (\fBconst_iterator\fP __position)"
.br
.ti -1c
.RI "\fBiterator\fP \fBerase\fP (\fBiterator\fP __it)"
.br
.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
.ti -1c
.RI "\fBconst_iterator\fP \fBfind\fP (const \fBkey_type\fP &__x) const "
.br
.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
.ti -1c
.RI "\fBstd::pair\fP< \fBconst_iterator\fP, 
.br
\fBconst_iterator\fP > \fBequal_range\fP (const \fBkey_type\fP &__x) const "
.br
.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
.ti -1c
.RI "\fBconst_local_iterator\fP \fBbegin\fP (\fBsize_type\fP __n) const "
.br
.ti -1c
.RI "\fBconst_local_iterator\fP \fBcbegin\fP (\fBsize_type\fP __n) const "
.br
.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
.ti -1c
.RI "\fBconst_local_iterator\fP \fBend\fP (\fBsize_type\fP __n) const "
.br
.ti -1c
.RI "\fBconst_local_iterator\fP \fBcend\fP (\fBsize_type\fP __n) const "
.br
.in -1c
.in -1c
.SS "Friends"

.in +1c
.ti -1c
.RI "template<typename _Value1 , typename _Hash1 , typename _Pred1 , typename _Alloc1 > bool \fBoperator==\fP (const \fBunordered_multiset\fP< _Value1, _Hash1, _Pred1, _Alloc1 > &, const \fBunordered_multiset\fP< _Value1, _Hash1, _Pred1, _Alloc1 > &)"
.br
.in -1c
.SH "Detailed Description"
.PP 

.SS "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\&. 


.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\&. 
.PP
Definition at line 698 of file unordered_set\&.h\&.
.SH "Member Typedef Documentation"
.PP 
.SS "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"

.PP
Public typedefs\&. 
.PP
Definition at line 711 of file unordered_set\&.h\&.
.SS "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"

.PP
Iterator-related typedefs\&. 
.PP
Definition at line 721 of file unordered_set\&.h\&.
.SS "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"

.PP
Iterator-related typedefs\&. 
.PP
Definition at line 723 of file unordered_set\&.h\&.
.SS "template<class _Value , class _Hash  = hash<_Value>, class _Pred  = std::equal_to<_Value>, class _Alloc  = std::allocator<_Value>> typedef allocator_type::const_pointer \fBstd::unordered_multiset\fP< _Value, _Hash, _Pred, _Alloc >::\fBconst_pointer\fP"

.PP
Iterator-related typedefs\&. 
.PP
Definition at line 717 of file unordered_set\&.h\&.
.SS "template<class _Value , class _Hash  = hash<_Value>, class _Pred  = std::equal_to<_Value>, class _Alloc  = std::allocator<_Value>> typedef allocator_type::const_reference \fBstd::unordered_multiset\fP< _Value, _Hash, _Pred, _Alloc >::\fBconst_reference\fP"

.PP
Iterator-related typedefs\&. 
.PP
Definition at line 719 of file unordered_set\&.h\&.
.SS "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"

.PP
Iterator-related typedefs\&. 
.PP
Definition at line 725 of file unordered_set\&.h\&.
.SS "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"

.PP
Public typedefs\&. 
.PP
Definition at line 709 of file unordered_set\&.h\&.
.SS "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"

.PP
Iterator-related typedefs\&. 
.PP
Definition at line 720 of file unordered_set\&.h\&.
.SS "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"

.PP
Public typedefs\&. 
.PP
Definition at line 710 of file unordered_set\&.h\&.
.SS "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"

.PP
Public typedefs\&. 
.PP
Definition at line 707 of file unordered_set\&.h\&.
.SS "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"

.PP
Iterator-related typedefs\&. 
.PP
Definition at line 722 of file unordered_set\&.h\&.
.SS "template<class _Value , class _Hash  = hash<_Value>, class _Pred  = std::equal_to<_Value>, class _Alloc  = std::allocator<_Value>> typedef allocator_type::pointer \fBstd::unordered_multiset\fP< _Value, _Hash, _Pred, _Alloc >::\fBpointer\fP"

.PP
Iterator-related typedefs\&. 
.PP
Definition at line 716 of file unordered_set\&.h\&.
.SS "template<class _Value , class _Hash  = hash<_Value>, class _Pred  = std::equal_to<_Value>, class _Alloc  = std::allocator<_Value>> typedef allocator_type::reference \fBstd::unordered_multiset\fP< _Value, _Hash, _Pred, _Alloc >::\fBreference\fP"

.PP
Iterator-related typedefs\&. 
.PP
Definition at line 718 of file unordered_set\&.h\&.
.SS "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"

.PP
Iterator-related typedefs\&. 
.PP
Definition at line 724 of file unordered_set\&.h\&.
.SS "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"

.PP
Public typedefs\&. 
.PP
Definition at line 708 of file unordered_set\&.h\&.
.SH "Constructor & Destructor Documentation"
.PP 
.SS "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"

.PP
Default constructor creates no elements\&. 
.PP
\fBParameters:\fP
.RS 4
\fI__n\fP 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

.PP
Definition at line 737 of file unordered_set\&.h\&.
.SS "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"

.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))\&. 
.PP
Definition at line 758 of file unordered_set\&.h\&.
.SS "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"

.PP
Copy constructor\&. 
.SS "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"

.PP
Move constructor\&. 
.SS "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"

.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)\&. 
.PP
Definition at line 783 of file unordered_set\&.h\&.
.SH "Member Function Documentation"
.PP 
.SS "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\&. 
.PP
Definition at line 848 of file unordered_set\&.h\&.
.SS "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\&. 
.PP
Definition at line 852 of file unordered_set\&.h\&.
.SS "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"

.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

.PP
Definition at line 1175 of file unordered_set\&.h\&.
.SS "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"

.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

.PP
Definition at line 1179 of file unordered_set\&.h\&.
.SS "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"

.PP
Returns the number of buckets of the unordered_multiset\&. 
.PP
Definition at line 1141 of file unordered_set\&.h\&.
.SS "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\&. 
.PP
Definition at line 875 of file unordered_set\&.h\&.
.SS "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"

.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

.PP
Definition at line 1183 of file unordered_set\&.h\&.
.SS "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\&. 
.PP
Definition at line 883 of file unordered_set\&.h\&.
.SS "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"

.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

.PP
Definition at line 1203 of file unordered_set\&.h\&.
.SS "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\&.
.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\&. 
.PP
Definition at line 1059 of file unordered_set\&.h\&.
.SS "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"

.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

.PP
Definition at line 1118 of file unordered_set\&.h\&.
.SS "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"

.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\&. 
.PP
Definition at line 897 of file unordered_set\&.h\&.
.SS "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"

.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: http://gcc.gnu.org/onlinedocs/libstdc++/manual/bk01pt07ch17.html
.PP
Insertion requires amortized constant time\&. 
.PP
Definition at line 919 of file unordered_set\&.h\&.
.SS "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"

.PP
Returns true if the unordered_multiset is empty\&. 
.PP
Definition at line 827 of file unordered_set\&.h\&.
.SS "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\&. 
.PP
Definition at line 862 of file unordered_set\&.h\&.
.SS "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\&. 
.PP
Definition at line 866 of file unordered_set\&.h\&.
.SS "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"

.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

.PP
Definition at line 1195 of file unordered_set\&.h\&.
.SS "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"

.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

.PP
Definition at line 1199 of file unordered_set\&.h\&.
.SS "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"

.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

.PP
Definition at line 1129 of file unordered_set\&.h\&.
.SS "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"

.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

.PP
Definition at line 1133 of file unordered_set\&.h\&.
.SS "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"

.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\&. 
.PP
Definition at line 1005 of file unordered_set\&.h\&.
.SS "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"

.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\&. 
.PP
Definition at line 1010 of file unordered_set\&.h\&.
.SS "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"

.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\&. 
.PP
Definition at line 1028 of file unordered_set\&.h\&.
.SS "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"

.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\&. 
.PP
Definition at line 1048 of file unordered_set\&.h\&.
.SS "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"

.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\&. 
.PP
Definition at line 1104 of file unordered_set\&.h\&.
.SS "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"

.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\&. 
.PP
Definition at line 1108 of file unordered_set\&.h\&.
.SS "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"

.PP
Returns the allocator object with which the unordered_multiset was constructed\&. 
.PP
Definition at line 820 of file unordered_set\&.h\&.
.SS "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"

.PP
Returns the hash functor object with which the unordered_multiset was constructed\&. 
.PP
Definition at line 1080 of file unordered_set\&.h\&.
.SS "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"

.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
Definition at line 931 of file unordered_set\&.h\&.
.SS "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"

.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
Definition at line 935 of file unordered_set\&.h\&.
.PP
References std::move()\&.
.SS "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"

.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: http://gcc.gnu.org/onlinedocs/libstdc++/manual/bk01pt07ch17.html
.PP
Insertion requires amortized constant\&. 
.PP
Definition at line 957 of file unordered_set\&.h\&.
.SS "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"

.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: http://gcc.gnu.org/onlinedocs/libstdc++/manual/bk01pt07ch17.html
.PP
Insertion requires amortized constant\&. 
.PP
Definition at line 961 of file unordered_set\&.h\&.
.PP
References std::move()\&.
.SS "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"

.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\&. 
.PP
Definition at line 975 of file unordered_set\&.h\&.
.SS "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"

.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\&. 
.PP
Definition at line 986 of file unordered_set\&.h\&.
.SS "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"

.PP
Returns the key comparison object with which the unordered_multiset was constructed\&. 
.PP
Definition at line 1086 of file unordered_set\&.h\&.
.SS "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"

.PP
Returns the average number of elements per bucket\&. 
.PP
Definition at line 1211 of file unordered_set\&.h\&.
.SS "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"

.PP
Returns the maximum number of buckets of the unordered_multiset\&. 
.PP
Definition at line 1146 of file unordered_set\&.h\&.
.SS "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"

.PP
Returns a positive number that the unordered_multiset tries to keep the load factor less than or equal to\&. 
.PP
Definition at line 1217 of file unordered_set\&.h\&.
.SS "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"

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

.PP
Definition at line 1225 of file unordered_set\&.h\&.
.SS "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"

.PP
Returns the maximum size of the unordered_multiset\&. 
.PP
Definition at line 837 of file unordered_set\&.h\&.
.SS "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"

.PP
Copy assignment operator\&. 
.SS "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 > &&__x)\fC [default]\fP"

.PP
Move assignment operator\&. 
.SS "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"

.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_set's size is the same as the number of elements assigned\&. Old data may be lost\&. 
.PP
Definition at line 811 of file unordered_set\&.h\&.
.SS "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"

.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\&. 
.PP
Definition at line 1236 of file unordered_set\&.h\&.
.SS "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"

.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()))\&. 
.PP
Definition at line 1247 of file unordered_set\&.h\&.
.SS "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"

.PP
Returns the size of the unordered_multiset\&. 
.PP
Definition at line 832 of file unordered_set\&.h\&.
.SS "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"

.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\&. 
.PP
Definition at line 1072 of file unordered_set\&.h\&.

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