.TH "std::__debug::unordered_multiset< _Value, _Hash, _Pred, _Alloc >" 3 "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
\fR#include <unordered_set>\fP
.PP
Inherits \fB__gnu_debug::_Safe_container< _SafeContainer, _Alloc, _SafeBase, _IsCxx11AllocatorAware >\fP\&.
.SS "Public Types"

.in +1c
.ti -1c
.RI "typedef _Base::allocator_type \fBallocator_type\fP"
.br
.ti -1c
.RI "typedef \fB__gnu_debug::_Safe_iterator\fP< _Base_const_iterator, unordered_multiset > \fBconst_iterator\fP"
.br
.ti -1c
.RI "typedef \fB__gnu_debug::_Safe_local_iterator\fP< _Base_const_local_iterator, unordered_multiset > \fBconst_local_iterator\fP"
.br
.ti -1c
.RI "typedef _Base::const_pointer \fBconst_pointer\fP"
.br
.ti -1c
.RI "typedef _Base::const_reference \fBconst_reference\fP"
.br
.ti -1c
.RI "typedef _Base::difference_type \fBdifference_type\fP"
.br
.ti -1c
.RI "typedef _Base::hasher \fBhasher\fP"
.br
.ti -1c
.RI "typedef \fB__gnu_debug::_Safe_iterator\fP< _Base_iterator, unordered_multiset > \fBiterator\fP"
.br
.ti -1c
.RI "typedef _Base::key_equal \fBkey_equal\fP"
.br
.ti -1c
.RI "typedef _Base::key_type \fBkey_type\fP"
.br
.ti -1c
.RI "typedef \fB__gnu_debug::_Safe_local_iterator\fP< _Base_local_iterator, unordered_multiset > \fBlocal_iterator\fP"
.br
.ti -1c
.RI "using \fBnode_type\fP"
.br
.ti -1c
.RI "typedef _Base::pointer \fBpointer\fP"
.br
.ti -1c
.RI "typedef _Base::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 (_Base_ref __x)"
.br
.ti -1c
.RI "template<typename _InputIterator> \fBunordered_multiset\fP (_InputIterator __first, _InputIterator __last, size_type __n, const allocator_type &__a)"
.br
.ti -1c
.RI "template<typename _InputIterator> \fBunordered_multiset\fP (_InputIterator __first, _InputIterator __last, size_type __n, const hasher &__hf, const allocator_type &__a)"
.br
.ti -1c
.RI "template<typename _InputIterator> \fBunordered_multiset\fP (_InputIterator __first, _InputIterator __last, 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 (const allocator_type &__a)"
.br
.ti -1c
.RI "\fBunordered_multiset\fP (const unordered_multiset &)=default"
.br
.ti -1c
.RI "\fBunordered_multiset\fP (const unordered_multiset &__uset, const allocator_type &__a)"
.br
.ti -1c
.RI "\fBunordered_multiset\fP (\fBinitializer_list\fP< value_type > __l, size_type __n, const allocator_type &__a)"
.br
.ti -1c
.RI "\fBunordered_multiset\fP (\fBinitializer_list\fP< value_type > __l, size_type __n, const hasher &__hf, const allocator_type &__a)"
.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 "\fBunordered_multiset\fP (size_type __n, const allocator_type &__a)"
.br
.ti -1c
.RI "\fBunordered_multiset\fP (size_type __n, const hasher &__hf, const allocator_type &__a)"
.br
.ti -1c
.RI "\fBunordered_multiset\fP (size_type __n, const hasher &__hf=hasher(), const key_equal &__eql=key_equal(), const allocator_type &__a=allocator_type())"
.br
.ti -1c
.RI "\fBunordered_multiset\fP (unordered_multiset &&)=default"
.br
.ti -1c
.RI "\fBunordered_multiset\fP (unordered_multiset &&__uset, const allocator_type &__a) noexcept(noexcept(_Base(\fBstd::move\fP(__uset), __a)))"
.br
.ti -1c
.RI "const _Base & \fB_M_base\fP () const noexcept"
.br
.ti -1c
.RI "_Base & \fB_M_base\fP () noexcept"
.br
.ti -1c
.RI "const_iterator \fBbegin\fP () const noexcept"
.br
.ti -1c
.RI "iterator \fBbegin\fP () noexcept"
.br
.ti -1c
.RI "local_iterator \fBbegin\fP (size_type __b)"
.br
.ti -1c
.RI "const_local_iterator \fBbegin\fP (size_type __b) const"
.br
.ti -1c
.RI "size_type \fBbucket_size\fP (size_type __b) const"
.br
.ti -1c
.RI "const_iterator \fBcbegin\fP () const noexcept"
.br
.ti -1c
.RI "const_local_iterator \fBcbegin\fP (size_type __b) const"
.br
.ti -1c
.RI "const_iterator \fBcend\fP () const noexcept"
.br
.ti -1c
.RI "const_local_iterator \fBcend\fP (size_type __b) const"
.br
.ti -1c
.RI "void \fBclear\fP () noexcept"
.br
.ti -1c
.RI "template<typename\&.\&.\&. _Args> iterator \fBemplace\fP (_Args &&\&.\&.\&. __args)"
.br
.ti -1c
.RI "template<typename\&.\&.\&. _Args> iterator \fBemplace_hint\fP (const_iterator __hint, _Args &&\&.\&.\&. __args)"
.br
.ti -1c
.RI "const_iterator \fBend\fP () const noexcept"
.br
.ti -1c
.RI "iterator \fBend\fP () noexcept"
.br
.ti -1c
.RI "local_iterator \fBend\fP (size_type __b)"
.br
.ti -1c
.RI "const_local_iterator \fBend\fP (size_type __b) const"
.br
.ti -1c
.RI "template<typename _Kt, typename = std::__has_is_transparent_t<_Hash, _Kt>, typename = std::__has_is_transparent_t<_Pred, _Kt>> \fBstd::pair\fP< iterator, iterator > \fBequal_range\fP (const _Kt &__k)"
.br
.ti -1c
.RI "template<typename _Kt, typename = std::__has_is_transparent_t<_Hash, _Kt>, typename = std::__has_is_transparent_t<_Pred, _Kt>> \fBstd::pair\fP< const_iterator, const_iterator > \fBequal_range\fP (const _Kt &__k) const"
.br
.ti -1c
.RI "\fBstd::pair\fP< iterator, iterator > \fBequal_range\fP (const key_type &__key)"
.br
.ti -1c
.RI "\fBstd::pair\fP< const_iterator, const_iterator > \fBequal_range\fP (const key_type &__key) const"
.br
.ti -1c
.RI "_Base_iterator \fBerase\fP (_Base_const_iterator __it)"
.br
.ti -1c
.RI "size_type \fBerase\fP (const key_type &__key)"
.br
.ti -1c
.RI "iterator \fBerase\fP (const_iterator __first, const_iterator __last)"
.br
.ti -1c
.RI "iterator \fBerase\fP (const_iterator __it)"
.br
.ti -1c
.RI "iterator \fBerase\fP (iterator __it)"
.br
.ti -1c
.RI "node_type \fBextract\fP (const key_type &__key)"
.br
.ti -1c
.RI "node_type \fBextract\fP (const_iterator __position)"
.br
.ti -1c
.RI "template<typename _Kt, typename = std::__has_is_transparent_t<_Hash, _Kt>, typename = std::__has_is_transparent_t<_Pred, _Kt>> iterator \fBfind\fP (const _Kt &__k)"
.br
.ti -1c
.RI "template<typename _Kt, typename = std::__has_is_transparent_t<_Hash, _Kt>, typename = std::__has_is_transparent_t<_Pred, _Kt>> const_iterator \fBfind\fP (const _Kt &__k) const"
.br
.ti -1c
.RI "iterator \fBfind\fP (const key_type &__key)"
.br
.ti -1c
.RI "const_iterator \fBfind\fP (const key_type &__key) const"
.br
.ti -1c
.RI "template<typename _InputIterator> void \fBinsert\fP (_InputIterator __first, _InputIterator __last)"
.br
.ti -1c
.RI "iterator \fBinsert\fP (const value_type &__obj)"
.br
.ti -1c
.RI "iterator \fBinsert\fP (const_iterator __hint, const value_type &__obj)"
.br
.ti -1c
.RI "iterator \fBinsert\fP (const_iterator __hint, node_type &&__nh)"
.br
.ti -1c
.RI "iterator \fBinsert\fP (const_iterator __hint, value_type &&__obj)"
.br
.ti -1c
.RI "iterator \fBinsert\fP (node_type &&__nh)"
.br
.ti -1c
.RI "void \fBinsert\fP (\fBstd::initializer_list\fP< value_type > __l)"
.br
.ti -1c
.RI "iterator \fBinsert\fP (value_type &&__obj)"
.br
.ti -1c
.RI "float \fBmax_load_factor\fP () const noexcept"
.br
.ti -1c
.RI "void \fBmax_load_factor\fP (float __f)"
.br
.ti -1c
.RI "template<typename _H2, typename _P2> void \fBmerge\fP (unordered_multiset< _Value, _H2, _P2, _Alloc > &&__source)"
.br
.ti -1c
.RI "template<typename _H2, typename _P2> void \fBmerge\fP (unordered_multiset< _Value, _H2, _P2, _Alloc > &__source)"
.br
.ti -1c
.RI "template<typename _H2, typename _P2> void \fBmerge\fP (unordered_set< _Value, _H2, _P2, _Alloc > &&__source)"
.br
.ti -1c
.RI "template<typename _H2, typename _P2> void \fBmerge\fP (unordered_set< _Value, _H2, _P2, _Alloc > &__source)"
.br
.ti -1c
.RI "unordered_multiset & \fBoperator=\fP (const unordered_multiset &)=default"
.br
.ti -1c
.RI "unordered_multiset & \fBoperator=\fP (\fBinitializer_list\fP< value_type > __l)"
.br
.ti -1c
.RI "unordered_multiset & \fBoperator=\fP (unordered_multiset &&)=default"
.br
.ti -1c
.RI "void \fBswap\fP (unordered_multiset &__x) noexcept(noexcept(\fBdeclval\fP< _Base & >()\&.swap(__x)))"
.br
.in -1c
.SS "Protected Member Functions"

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

.in +1c
.ti -1c
.RI "template<typename _ItT, typename _SeqT, typename _CatT> class \fB::__gnu_debug::_Safe_iterator\fP"
.br
.ti -1c
.RI "template<typename _ItT, typename _SeqT> class \fB::__gnu_debug::_Safe_local_iterator\fP"
.br
.in -1c
.SH "Detailed Description"
.PP 

.SS "template<typename _Value, typename _Hash = std::hash<_Value>, typename _Pred = std::equal_to<_Value>, typename _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\&.