.TH "std::unordered_multiset< _Value, _Hash, _Pred, _Alloc >" 3cxx "Sun Jan 6 2013" "libstdc++" \" -*- nroff -*-
.ad l
.nh
.SH NAME
std::unordered_multiset< _Value, _Hash, _Pred, _Alloc > \- 
.SH SYNOPSIS
.br
.PP
.PP
Inherits std::__unordered_multiset< _Value, _Hash, _Pred, _Alloc, __cache_hash_code >\&.
.SS "Public Types"

.in +1c
.ti -1c
.RI "typedef _Base::allocator_type \fBallocator_type\fP"
.br
.ti -1c
.RI "typedef _Base::const_iterator \fBconst_iterator\fP"
.br
.ti -1c
.RI "typedef 
.br
__detail::_Local_const_iterator
.br
< key_type, value_type, 
.br
std::_Identity< _Value >
.br
, _Hash, 
.br
__detail::_Mod_range_hashing, 
.br
__detail::_Default_ranged_hash, 
.br
__constant_iterators, 
.br
__cache_hash_code > \fBconst_local_iterator\fP"
.br
.ti -1c
.RI "typedef _Alloc::const_pointer \fBconst_pointer\fP"
.br
.ti -1c
.RI "typedef _Alloc::const_reference \fBconst_reference\fP"
.br
.ti -1c
.RI "typedef std::ptrdiff_t \fBdifference_type\fP"
.br
.ti -1c
.RI "typedef _Base::hasher \fBhasher\fP"
.br
.ti -1c
.RI "typedef _Base::iterator \fBiterator\fP"
.br
.ti -1c
.RI "typedef _Base::key_equal \fBkey_equal\fP"
.br
.ti -1c
.RI "typedef _Value \fBkey_type\fP"
.br
.ti -1c
.RI "typedef 
.br
__detail::_Local_iterator
.br
< key_type, value_type, 
.br
std::_Identity< _Value >
.br
, _Hash, 
.br
__detail::_Mod_range_hashing, 
.br
__detail::_Default_ranged_hash, 
.br
__constant_iterators, 
.br
__cache_hash_code > \fBlocal_iterator\fP"
.br
.ti -1c
.RI "typedef _Alloc::pointer \fBpointer\fP"
.br
.ti -1c
.RI "typedef _Alloc::reference \fBreference\fP"
.br
.ti -1c
.RI "typedef _Base::size_type \fBsize_type\fP"
.br
.ti -1c
.RI "typedef _Base::value_type \fBvalue_type\fP"
.br
.in -1c
.SS "Public Member Functions"

.in +1c
.ti -1c
.RI "\fBunordered_multiset\fP (size_type __n=10, const hasher &__hf=hasher(), const key_equal &__eql=key_equal(), const allocator_type &__a=allocator_type())"
.br
.ti -1c
.RI "template<typename _InputIterator > \fBunordered_multiset\fP (_InputIterator __f, _InputIterator __l, size_type __n=0, const hasher &__hf=hasher(), const key_equal &__eql=key_equal(), const allocator_type &__a=allocator_type())"
.br
.ti -1c
.RI "\fBunordered_multiset\fP (\fBinitializer_list\fP< value_type > __l, size_type __n=0, const hasher &__hf=hasher(), const key_equal &__eql=key_equal(), const allocator_type &__a=allocator_type())"
.br
.ti -1c
.RI "const 
.br
__detail::_Prime_rehash_policy & \fB__rehash_policy\fP () const"
.br
.ti -1c
.RI "void \fB__rehash_policy\fP (const __detail::_Prime_rehash_policy &)"
.br
.ti -1c
.RI "iterator \fBbegin\fP () noexcept"
.br
.ti -1c
.RI "const_iterator \fBbegin\fP () const noexcept"
.br
.ti -1c
.RI "local_iterator \fBbegin\fP (size_type __n)"
.br
.ti -1c
.RI "const_local_iterator \fBbegin\fP (size_type __n) const"
.br
.ti -1c
.RI "size_type \fBbucket\fP (const key_type &__k) const"
.br
.ti -1c
.RI "size_type \fBbucket_count\fP () const noexcept"
.br
.ti -1c
.RI "size_type \fBbucket_size\fP (size_type __n) const"
.br
.ti -1c
.RI "const_iterator \fBcbegin\fP () const noexcept"
.br
.ti -1c
.RI "const_local_iterator \fBcbegin\fP (size_type __n) const"
.br
.ti -1c
.RI "const_iterator \fBcend\fP () const noexcept"
.br
.ti -1c
.RI "const_local_iterator \fBcend\fP (size_type __n) const"
.br
.ti -1c
.RI "void \fBclear\fP () noexcept"
.br
.ti -1c
.RI "size_type \fBcount\fP (const key_type &__k) const"
.br
.ti -1c
.RI "_Insert_Return_Type \fBemplace\fP (_Args &&\&.\&.\&.__args)"
.br
.ti -1c
.RI "iterator \fBemplace_hint\fP (const_iterator, _Args &&\&.\&.\&.__args)"
.br
.ti -1c
.RI "bool \fBempty\fP () const noexcept"
.br
.ti -1c
.RI "iterator \fBend\fP () noexcept"
.br
.ti -1c
.RI "const_iterator \fBend\fP () const noexcept"
.br
.ti -1c
.RI "local_iterator \fBend\fP (size_type __n)"
.br
.ti -1c
.RI "const_local_iterator \fBend\fP (size_type __n) const"
.br
.ti -1c
.RI "\fBstd::pair\fP< iterator, iterator > \fBequal_range\fP (const key_type &__k)"
.br
.ti -1c
.RI "\fBstd::pair\fP< const_iterator, 
.br
const_iterator > \fBequal_range\fP (const key_type &__k) const"
.br
.ti -1c
.RI "iterator \fBerase\fP (const_iterator)"
.br
.ti -1c
.RI "iterator \fBerase\fP (iterator __it)"
.br
.ti -1c
.RI "size_type \fBerase\fP (const key_type &)"
.br
.ti -1c
.RI "iterator \fBerase\fP (const_iterator, const_iterator)"
.br
.ti -1c
.RI "iterator \fBfind\fP (const key_type &__k)"
.br
.ti -1c
.RI "const_iterator \fBfind\fP (const key_type &__k) const"
.br
.ti -1c
.RI "allocator_type \fBget_allocator\fP () const noexcept"
.br
.ti -1c
.RI "iterator \fBinsert\fP (value_type &&__v)"
.br
.ti -1c
.RI "iterator \fBinsert\fP (const_iterator, value_type &&__v)"
.br
.ti -1c
.RI "_Insert_Return_Type \fBinsert\fP (const value_type &__v)"
.br
.ti -1c
.RI "iterator \fBinsert\fP (const_iterator, const value_type &__v)"
.br
.ti -1c
.RI "_Insert_Return_Type \fBinsert\fP (_Pair &&__v)"
.br
.ti -1c
.RI "iterator \fBinsert\fP (const_iterator, _Pair &&__v)"
.br
.ti -1c
.RI "void \fBinsert\fP (_InputIterator __first, _InputIterator __last)"
.br
.ti -1c
.RI "void \fBinsert\fP (\fBinitializer_list\fP< value_type > __l)"
.br
.ti -1c
.RI "key_equal \fBkey_eq\fP () const"
.br
.ti -1c
.RI "float \fBload_factor\fP () const noexcept"
.br
.ti -1c
.RI "size_type \fBmax_bucket_count\fP () const noexcept"
.br
.ti -1c
.RI "size_type \fBmax_size\fP () const noexcept"
.br
.ti -1c
.RI "\fBunordered_multiset\fP & \fBoperator=\fP (\fBinitializer_list\fP< value_type > __l)"
.br
.ti -1c
.RI "void \fBrehash\fP (size_type __n)"
.br
.ti -1c
.RI "size_type \fBsize\fP () const noexcept"
.br
.ti -1c
.RI "void \fBswap\fP (\fB_Hashtable\fP &)"
.br
.in -1c
.SS "Protected Types"

.in +1c
.ti -1c
.RI "typedef _HCBase::_Hash_code_type \fB_Hash_code_type\fP"
.br
.in -1c
.SS "Protected Member Functions"

.in +1c
.ti -1c
.RI "\fBstd::pair\fP< iterator, bool > \fB_M_emplace\fP (\fBstd::true_type\fP, _Args &&\&.\&.\&.__args)"
.br
.ti -1c
.RI "iterator \fB_M_emplace\fP (\fBstd::false_type\fP, _Args &&\&.\&.\&.__args)"
.br
.ti -1c
.RI "const _Equal & \fB_M_eq\fP () const "
.br
.ti -1c
.RI "_Equal & \fB_M_eq\fP ()"
.br
.ti -1c
.RI "bool \fB_M_equals\fP (const _Key &__k, _Hash_code_type __c, _Hash_node< _Value, __cache_hash_code > *__n) const "
.br
.ti -1c
.RI "\fBstd::pair\fP< iterator, bool > \fB_M_insert\fP (_Arg &&, \fBstd::true_type\fP)"
.br
.ti -1c
.RI "iterator \fB_M_insert\fP (_Arg &&, \fBstd::false_type\fP)"
.br
.ti -1c
.RI "void \fB_M_swap\fP (_Hashtable_base &__x)"
.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\&. 

Meets the requirements of a \fCcontainer\fP, and \fCunordered associative container\fP
.PP
\fBParameters:\fP
.RS 4
\fIValue\fP Type of key objects\&. 
.br
\fIHash\fP Hashing function object type, defaults to hash<Value>\&. 
.br
\fIPred\fP Predicate function object type, defaults to equal_to<Value>\&. 
.br
\fIAlloc\fP Allocator type, defaults to allocator<Key>\&. 
.RE
.PP

.PP
Definition at line 344 of file unordered_set\&.h\&.

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