.TH "std::__debug::unordered_multiset< _Value, _Hash, _Pred, _Alloc >" 3cxx "libstdc++" \" -*- nroff -*-
.ad l
.nh
.SH NAME
std::__debug::unordered_multiset< _Value, _Hash, _Pred, _Alloc > \- Class std::unordered_multiset with safety/checking/debug instrumentation\&.  

.SH SYNOPSIS
.br
.PP
.PP
\fC#include <unordered_set>\fP
.PP
Inherits \fB__gnu_debug::_Safe_container< _SafeContainer, _Alloc, _SafeBase, _IsCxx11AllocatorAware >\fP, and unordered_multiset< _Value, std::hash< _Value >, std::equal_to< _Value >, std::allocator< _Value > >\&.
.SS "Public Types"

.in +1c
.ti -1c
.RI "\fBtypedef\fP _Base::allocator_type \fBallocator_type\fP"
.br
.ti -1c
.RI "\fBtypedef\fP \fB__gnu_debug::_Safe_iterator\fP< \fB_Base_const_iterator\fP, \fBunordered_multiset\fP > \fBconst_iterator\fP"
.br
.ti -1c
.RI "\fBtypedef\fP \fB__gnu_debug::_Safe_local_iterator\fP< \fB_Base_const_local_iterator\fP, \fBunordered_multiset\fP > \fBconst_local_iterator\fP"
.br
.ti -1c
.RI "\fBtypedef\fP _Base::const_pointer \fBconst_pointer\fP"
.br
.ti -1c
.RI "\fBtypedef\fP _Base::const_reference \fBconst_reference\fP"
.br
.ti -1c
.RI "\fBtypedef\fP _Base::difference_type \fBdifference_type\fP"
.br
.ti -1c
.RI "\fBtypedef\fP _Base::hasher \fBhasher\fP"
.br
.ti -1c
.RI "\fBtypedef\fP \fB__gnu_debug::_Safe_iterator\fP< \fB_Base_iterator\fP, \fBunordered_multiset\fP > \fBiterator\fP"
.br
.ti -1c
.RI "\fBtypedef\fP _Base::key_equal \fBkey_equal\fP"
.br
.ti -1c
.RI "\fBtypedef\fP _Base::key_type \fBkey_type\fP"
.br
.ti -1c
.RI "\fBtypedef\fP \fB__gnu_debug::_Safe_local_iterator\fP< \fB_Base_local_iterator\fP, \fBunordered_multiset\fP > \fBlocal_iterator\fP"
.br
.ti -1c
.RI "\fBusing\fP \fBnode_type\fP = \fBtypename\fP _Base::node_type"
.br
.ti -1c
.RI "\fBtypedef\fP _Base::pointer \fBpointer\fP"
.br
.ti -1c
.RI "\fBtypedef\fP _Base::reference \fBreference\fP"
.br
.ti -1c
.RI "\fBtypedef\fP _Base::size_type \fBsize_type\fP"
.br
.ti -1c
.RI "\fBtypedef\fP _Base::value_type \fBvalue_type\fP"
.br
.in -1c
.SS "Public Member Functions"

.in +1c
.ti -1c
.RI "\fBunordered_multiset\fP (_Base_ref __x)"
.br
.ti -1c
.RI "template<\fBtypename\fP \fB_InputIterator\fP > \fBunordered_multiset\fP (\fB_InputIterator\fP __first, \fB_InputIterator\fP __last, size_type __n, const allocator_type &__a)"
.br
.ti -1c
.RI "template<\fBtypename\fP \fB_InputIterator\fP > \fBunordered_multiset\fP (\fB_InputIterator\fP __first, \fB_InputIterator\fP __last, size_type __n, const hasher &\fB__hf\fP, const allocator_type &__a)"
.br
.ti -1c
.RI "template<\fBtypename\fP \fB_InputIterator\fP > \fBunordered_multiset\fP (\fB_InputIterator\fP __first, \fB_InputIterator\fP __last, size_type __n=0, const hasher &\fB__hf\fP=hasher(), const key_equal &\fB__eql\fP=key_equal(), const allocator_type &__a=allocator_type())"
.br
.ti -1c
.RI "\fBunordered_multiset\fP (const allocator_type &__a)"
.br
.ti -1c
.RI "\fBunordered_multiset\fP (const \fBunordered_multiset\fP &)=\fBdefault\fP"
.br
.ti -1c
.RI "\fBunordered_multiset\fP (const \fBunordered_multiset\fP &\fB__uset\fP, const allocator_type &__a)"
.br
.ti -1c
.RI "\fBunordered_multiset\fP (\fBinitializer_list\fP< value_type > \fB__l\fP, size_type __n, const allocator_type &__a)"
.br
.ti -1c
.RI "\fBunordered_multiset\fP (\fBinitializer_list\fP< value_type > \fB__l\fP, size_type __n, const hasher &\fB__hf\fP, const allocator_type &__a)"
.br
.ti -1c
.RI "\fBunordered_multiset\fP (\fBinitializer_list\fP< value_type > \fB__l\fP, size_type __n=0, const hasher &\fB__hf\fP=hasher(), const key_equal &\fB__eql\fP=key_equal(), const allocator_type &__a=allocator_type())"
.br
.ti -1c
.RI "\fBunordered_multiset\fP (size_type __n, const allocator_type &__a)"
.br
.ti -1c
.RI "\fBunordered_multiset\fP (size_type __n, const hasher &\fB__hf\fP, const allocator_type &__a)"
.br
.ti -1c
.RI "\fBunordered_multiset\fP (size_type __n, const hasher &\fB__hf\fP=hasher(), const key_equal &\fB__eql\fP=key_equal(), const allocator_type &__a=allocator_type())"
.br
.ti -1c
.RI "\fBunordered_multiset\fP (\fBunordered_multiset\fP &&)=\fBdefault\fP"
.br
.ti -1c
.RI "\fBunordered_multiset\fP (\fBunordered_multiset\fP &&\fB__uset\fP, const allocator_type &__a) noexcept(noexcept(\fB_Base\fP(\fBstd::move\fP(\fB__uset\fP), __a)))"
.br
.ti -1c
.RI "const \fB_Base\fP & \fB_M_base\fP () const noexcept"
.br
.ti -1c
.RI "\fB_Base\fP & \fB_M_base\fP () noexcept"
.br
.ti -1c
.RI "\fBconst_iterator\fP \fBbegin\fP () const noexcept"
.br
.ti -1c
.RI "\fBiterator\fP \fBbegin\fP () noexcept"
.br
.ti -1c
.RI "\fBlocal_iterator\fP \fBbegin\fP (size_type __b)"
.br
.ti -1c
.RI "\fBconst_local_iterator\fP \fBbegin\fP (size_type __b) const"
.br
.ti -1c
.RI "size_type \fBbucket_size\fP (size_type __b) const"
.br
.ti -1c
.RI "\fBconst_iterator\fP \fBcbegin\fP () const noexcept"
.br
.ti -1c
.RI "\fBconst_local_iterator\fP \fBcbegin\fP (size_type __b) const"
.br
.ti -1c
.RI "\fBconst_iterator\fP \fBcend\fP () const noexcept"
.br
.ti -1c
.RI "\fBconst_local_iterator\fP \fBcend\fP (size_type __b) const"
.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
.ti -1c
.RI "template<typename\&.\&.\&. _Args> \fBiterator\fP \fBemplace_hint\fP (\fBconst_iterator\fP \fB__hint\fP, \fB_Args\fP &&\&.\&.\&. \fB__args\fP)"
.br
.ti -1c
.RI "\fBconst_iterator\fP \fBend\fP () const noexcept"
.br
.ti -1c
.RI "\fBiterator\fP \fBend\fP () noexcept"
.br
.ti -1c
.RI "\fBlocal_iterator\fP \fBend\fP (size_type __b)"
.br
.ti -1c
.RI "\fBconst_local_iterator\fP \fBend\fP (size_type __b) const"
.br
.ti -1c
.RI "template<\fBtypename\fP \fB_Kt\fP , \fBtypename\fP  = std::__has_is_transparent_t<_Hash, _Kt>, \fBtypename\fP  = std::__has_is_transparent_t<_Pred, _Kt>> \fBstd::pair\fP< \fBiterator\fP, \fBiterator\fP > \fBequal_range\fP (const \fB_Kt\fP &\fB__k\fP)"
.br
.ti -1c
.RI "template<\fBtypename\fP \fB_Kt\fP , \fBtypename\fP  = std::__has_is_transparent_t<_Hash, _Kt>, \fBtypename\fP  = std::__has_is_transparent_t<_Pred, _Kt>> \fBstd::pair\fP< \fBconst_iterator\fP, \fBconst_iterator\fP > \fBequal_range\fP (const \fB_Kt\fP &\fB__k\fP) const"
.br
.ti -1c
.RI "\fBstd::pair\fP< \fBiterator\fP, \fBiterator\fP > \fBequal_range\fP (const key_type &\fB__key\fP)"
.br
.ti -1c
.RI "\fBstd::pair\fP< \fBconst_iterator\fP, \fBconst_iterator\fP > \fBequal_range\fP (const key_type &\fB__key\fP) const"
.br
.ti -1c
.RI "\fB_Base_iterator\fP \fBerase\fP (\fB_Base_const_iterator\fP \fB__it\fP)"
.br
.ti -1c
.RI "size_type \fBerase\fP (const key_type &\fB__key\fP)"
.br
.ti -1c
.RI "\fBiterator\fP \fBerase\fP (\fBconst_iterator\fP __first, \fBconst_iterator\fP __last)"
.br
.ti -1c
.RI "\fBiterator\fP \fBerase\fP (\fBconst_iterator\fP \fB__it\fP)"
.br
.ti -1c
.RI "\fBiterator\fP \fBerase\fP (\fBiterator\fP \fB__it\fP)"
.br
.ti -1c
.RI "node_type \fBextract\fP (const key_type &\fB__key\fP)"
.br
.ti -1c
.RI "node_type \fBextract\fP (\fBconst_iterator\fP \fB__position\fP)"
.br
.ti -1c
.RI "template<\fBtypename\fP \fB_Kt\fP , \fBtypename\fP  = std::__has_is_transparent_t<_Hash, _Kt>, \fBtypename\fP  = std::__has_is_transparent_t<_Pred, _Kt>> \fBiterator\fP \fBfind\fP (const \fB_Kt\fP &\fB__k\fP)"
.br
.ti -1c
.RI "template<\fBtypename\fP \fB_Kt\fP , \fBtypename\fP  = std::__has_is_transparent_t<_Hash, _Kt>, \fBtypename\fP  = std::__has_is_transparent_t<_Pred, _Kt>> \fBconst_iterator\fP \fBfind\fP (const \fB_Kt\fP &\fB__k\fP) const"
.br
.ti -1c
.RI "\fBiterator\fP \fBfind\fP (const key_type &\fB__key\fP)"
.br
.ti -1c
.RI "\fBconst_iterator\fP \fBfind\fP (const key_type &\fB__key\fP) const"
.br
.ti -1c
.RI "template<\fBtypename\fP \fB_InputIterator\fP > \fBvoid\fP \fBinsert\fP (\fB_InputIterator\fP __first, \fB_InputIterator\fP __last)"
.br
.ti -1c
.RI "\fBiterator\fP \fBinsert\fP (const value_type &\fB__obj\fP)"
.br
.ti -1c
.RI "\fBiterator\fP \fBinsert\fP (\fBconst_iterator\fP \fB__hint\fP, const value_type &\fB__obj\fP)"
.br
.ti -1c
.RI "\fBiterator\fP \fBinsert\fP (\fBconst_iterator\fP \fB__hint\fP, node_type &&\fB__nh\fP)"
.br
.ti -1c
.RI "\fBiterator\fP \fBinsert\fP (\fBconst_iterator\fP \fB__hint\fP, value_type &&\fB__obj\fP)"
.br
.ti -1c
.RI "\fBiterator\fP \fBinsert\fP (node_type &&\fB__nh\fP)"
.br
.ti -1c
.RI "\fBvoid\fP \fBinsert\fP (\fBstd::initializer_list\fP< value_type > \fB__l\fP)"
.br
.ti -1c
.RI "\fBiterator\fP \fBinsert\fP (value_type &&\fB__obj\fP)"
.br
.ti -1c
.RI "float \fBmax_load_factor\fP () const noexcept"
.br
.ti -1c
.RI "\fBvoid\fP \fBmax_load_factor\fP (float __f)"
.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_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
.ti -1c
.RI "\fBunordered_multiset\fP & \fBoperator=\fP (\fBinitializer_list\fP< value_type > \fB__l\fP)"
.br
.ti -1c
.RI "\fBunordered_multiset\fP & \fBoperator=\fP (\fBunordered_multiset\fP &&)=\fBdefault\fP"
.br
.ti -1c
.RI "\fBvoid\fP \fBswap\fP (\fBunordered_multiset\fP &__x) noexcept(noexcept(\fBdeclval\fP< \fB_Base\fP & >()\&.swap(__x)))"
.br
.in -1c
.SS "Protected Member Functions"

.in +1c
.ti -1c
.RI "\fBvoid\fP \fB_M_swap\fP (_Safe_container &__x) noexcept"
.br
.in -1c
.SS "Friends"

.in +1c
.ti -1c
.RI "template<\fBtypename\fP \fB_ItT\fP , \fBtypename\fP \fB_SeqT\fP , \fBtypename\fP \fB_CatT\fP > \fBclass\fP \fB::__gnu_debug::_Safe_iterator\fP"
.br
.ti -1c
.RI "template<\fBtypename\fP \fB_ItT\fP , \fBtypename\fP \fB_SeqT\fP > \fBclass\fP \fB::__gnu_debug::_Safe_local_iterator\fP"
.br
.in -1c
.SH "Detailed Description"
.PP 

.SS "template<\fBtypename\fP _Value, \fBtypename\fP \fB_Hash\fP = std::hash<_Value>, \fBtypename\fP \fB_Pred\fP = std::equal_to<_Value>, \fBtypename\fP _Alloc = std::allocator<_Value>>
.br
class std::__debug::unordered_multiset< _Value, _Hash, _Pred, _Alloc >"Class std::unordered_multiset with safety/checking/debug instrumentation\&. 

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