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

.SH SYNOPSIS
.br
.PP
.PP
Inherits \fB__gnu_debug::_Safe_container< unordered_set< _Value, std::hash< _Value >, std::equal_to< _Value >, std::allocator< _Value > >, std::allocator< _Value >, __gnu_debug::_Safe_unordered_container >\fP, and unordered_set< _Value, std::hash< _Value >, std::equal_to< _Value >, std::allocator< _Value > >\&.
.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, \fBunordered_set\fP > \fBconst_iterator\fP"
.br
.ti -1c
.RI "typedef \fB__gnu_debug::_Safe_local_iterator\fP< _Base_const_local_iterator, \fBunordered_set\fP > \fBconst_local_iterator\fP"
.br
.ti -1c
.RI "typedef _Base::hasher \fBhasher\fP"
.br
.ti -1c
.RI "using \fBinsert_return_type\fP = \fB_Node_insert_return\fP< \fBiterator\fP, node_type >"
.br
.ti -1c
.RI "typedef \fB__gnu_debug::_Safe_iterator\fP< _Base_iterator, \fBunordered_set\fP > \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, \fBunordered_set\fP > \fBlocal_iterator\fP"
.br
.ti -1c
.RI "using \fBnode_type\fP = typename _Base::node_type"
.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_set\fP (_Base_ref __x)"
.br
.ti -1c
.RI "template<typename _InputIterator > \fBunordered_set\fP (_InputIterator __first, _InputIterator __last, size_type __n, const allocator_type &__a)"
.br
.ti -1c
.RI "template<typename _InputIterator > \fBunordered_set\fP (_InputIterator __first, _InputIterator __last, size_type __n, const hasher &__hf, const allocator_type &__a)"
.br
.ti -1c
.RI "template<typename _InputIterator > \fBunordered_set\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_set\fP (const allocator_type &__a)"
.br
.ti -1c
.RI "\fBunordered_set\fP (const \fBunordered_set\fP &)=default"
.br
.ti -1c
.RI "\fBunordered_set\fP (const \fBunordered_set\fP &__uset, const allocator_type &__a)"
.br
.ti -1c
.RI "\fBunordered_set\fP (\fBinitializer_list\fP< value_type > __l, size_type __n, const allocator_type &__a)"
.br
.ti -1c
.RI "\fBunordered_set\fP (\fBinitializer_list\fP< value_type > __l, size_type __n, const hasher &__hf, const allocator_type &__a)"
.br
.ti -1c
.RI "\fBunordered_set\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_set\fP (size_type __n, const allocator_type &__a)"
.br
.ti -1c
.RI "\fBunordered_set\fP (size_type __n, const hasher &__hf, const allocator_type &__a)"
.br
.ti -1c
.RI "\fBunordered_set\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_set\fP (\fBunordered_set\fP &&)=default"
.br
.ti -1c
.RI "\fBunordered_set\fP (\fBunordered_set\fP &&__uset, const allocator_type &__a) noexcept(noexcept(\fB_Base\fP(\fBstd::move\fP(__uset\&._M_base()), __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 "void \fB_M_swap\fP (_Safe_container &__x) 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 "void \fBclear\fP () noexcept"
.br
.ti -1c
.RI "template<typename\&.\&.\&. _Args> \fBstd::pair\fP< \fBiterator\fP, bool > \fBemplace\fP (_Args &&\&.\&.\&. __args)"
.br
.ti -1c
.RI "template<typename\&.\&.\&. _Args> \fBiterator\fP \fBemplace_hint\fP (\fBconst_iterator\fP __hint, _Args &&\&.\&.\&. __args)"
.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 "\fBstd::pair\fP< \fBiterator\fP, \fBiterator\fP > \fBequal_range\fP (const key_type &__key)"
.br
.ti -1c
.RI "\fBstd::pair\fP< \fBconst_iterator\fP, \fBconst_iterator\fP > \fBequal_range\fP (const key_type &__key) const"
.br
.ti -1c
.RI "size_type \fBerase\fP (const key_type &__key)"
.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 __it)"
.br
.ti -1c
.RI "\fBiterator\fP \fBerase\fP (\fBiterator\fP __it)"
.br
.ti -1c
.RI "node_type \fBextract\fP (const key_type &__key)"
.br
.ti -1c
.RI "node_type \fBextract\fP (\fBconst_iterator\fP __position)"
.br
.ti -1c
.RI "\fBiterator\fP \fBfind\fP (const key_type &__key)"
.br
.ti -1c
.RI "\fBconst_iterator\fP \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 "\fBstd::pair\fP< \fBiterator\fP, bool > \fBinsert\fP (const value_type &__obj)"
.br
.ti -1c
.RI "\fBiterator\fP \fBinsert\fP (\fBconst_iterator\fP __hint, const value_type &__obj)"
.br
.ti -1c
.RI "\fBiterator\fP \fBinsert\fP (\fBconst_iterator\fP __hint, node_type &&__nh)"
.br
.ti -1c
.RI "\fBiterator\fP \fBinsert\fP (\fBconst_iterator\fP __hint, value_type &&__obj)"
.br
.ti -1c
.RI "\fBinsert_return_type\fP \fBinsert\fP (node_type &&__nh)"
.br
.ti -1c
.RI "void \fBinsert\fP (\fBstd::initializer_list\fP< value_type > __l)"
.br
.ti -1c
.RI "\fBstd::pair\fP< \fBiterator\fP, bool > \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 "\fBunordered_set\fP & \fBoperator=\fP (const \fBunordered_set\fP &)=default"
.br
.ti -1c
.RI "\fBunordered_set\fP & \fBoperator=\fP (\fBinitializer_list\fP< value_type > __l)"
.br
.ti -1c
.RI "\fBunordered_set\fP & \fBoperator=\fP (\fBunordered_set\fP &&)=default"
.br
.ti -1c
.RI "void \fBswap\fP (\fBunordered_set\fP &__x) noexcept(noexcept(\fBdeclval\fP< \fB_Base\fP & >()\&.swap(__x)))"
.br
.in -1c
.SS "Public Attributes"

.in +1c
.ti -1c
.RI "_Safe_iterator_base * \fB_M_const_iterators\fP"
.br
.RI "The list of constant iterators that reference this container\&. "
.ti -1c
.RI "_Safe_iterator_base * \fB_M_const_local_iterators\fP"
.br
.RI "The list of constant local iterators that reference this container\&. "
.ti -1c
.RI "_Safe_iterator_base * \fB_M_iterators\fP"
.br
.RI "The list of mutable iterators that reference this container\&. "
.ti -1c
.RI "_Safe_iterator_base * \fB_M_local_iterators\fP"
.br
.RI "The list of mutable local iterators that reference this container\&. "
.ti -1c
.RI "unsigned int \fB_M_version\fP"
.br
.RI "The container version number\&. This number may never be 0\&. "
.in -1c
.SS "Protected Member Functions"

.in +1c
.ti -1c
.RI "void \fB_M_detach_all\fP ()"
.br
.ti -1c
.RI "void \fB_M_detach_singular\fP ()"
.br
.ti -1c
.RI "__gnu_cxx::__mutex & \fB_M_get_mutex\fP ()  throw ()"
.br
.ti -1c
.RI "void \fB_M_invalidate_all\fP ()"
.br
.ti -1c
.RI "void \fB_M_invalidate_all\fP () const"
.br
.ti -1c
.RI "void \fB_M_invalidate_if\fP (_Predicate __pred)"
.br
.ti -1c
.RI "void \fB_M_invalidate_local_if\fP (_Predicate __pred)"
.br
.ti -1c
.RI "void \fB_M_invalidate_locals\fP ()"
.br
.ti -1c
.RI "void \fB_M_revalidate_singular\fP ()"
.br
.ti -1c
.RI "_Safe_container & \fB_M_safe\fP () noexcept"
.br
.ti -1c
.RI "void \fB_M_swap\fP (_Safe_sequence_base &__x) noexcept"
.br
.ti -1c
.RI "void \fB_M_swap\fP (_Safe_unordered_container_base &__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_set< _Value, _Hash, _Pred, _Alloc >"Class std::unordered_set with safety/checking/debug instrumentation\&. 
.PP
Definition at line \fB60\fP of file \fBdebug/unordered_set\fP\&.
.SH "Member Typedef Documentation"
.PP 
.SS "template<typename _Value , typename _Hash  = std::hash<_Value>, typename _Pred  = std::equal_to<_Value>, typename _Alloc  = std::allocator<_Value>> typedef _Base::allocator_type \fBstd::__debug::unordered_set\fP< _Value, _Hash, _Pred, _Alloc >::allocator_type"

.PP
Definition at line \fB93\fP of file \fBdebug/unordered_set\fP\&.
.SS "template<typename _Value , typename _Hash  = std::hash<_Value>, typename _Pred  = std::equal_to<_Value>, typename _Alloc  = std::allocator<_Value>> typedef \fB__gnu_debug::_Safe_iterator\fP< _Base_const_iterator, \fBunordered_set\fP> \fBstd::__debug::unordered_set\fP< _Value, _Hash, _Pred, _Alloc >::const_iterator"

.PP
Definition at line \fB101\fP of file \fBdebug/unordered_set\fP\&.
.SS "template<typename _Value , typename _Hash  = std::hash<_Value>, typename _Pred  = std::equal_to<_Value>, typename _Alloc  = std::allocator<_Value>> typedef \fB__gnu_debug::_Safe_local_iterator\fP< _Base_const_local_iterator, \fBunordered_set\fP> \fBstd::__debug::unordered_set\fP< _Value, _Hash, _Pred, _Alloc >::const_local_iterator"

.PP
Definition at line \fB105\fP of file \fBdebug/unordered_set\fP\&.
.SS "template<typename _Value , typename _Hash  = std::hash<_Value>, typename _Pred  = std::equal_to<_Value>, typename _Alloc  = std::allocator<_Value>> typedef _Base::hasher \fBstd::__debug::unordered_set\fP< _Value, _Hash, _Pred, _Alloc >::hasher"

.PP
Definition at line \fB91\fP of file \fBdebug/unordered_set\fP\&.
.SS "template<typename _Value , typename _Hash  = std::hash<_Value>, typename _Pred  = std::equal_to<_Value>, typename _Alloc  = std::allocator<_Value>> using \fBstd::__debug::unordered_set\fP< _Value, _Hash, _Pred, _Alloc >::insert_return_type =  \fB_Node_insert_return\fP<\fBiterator\fP, node_type>"

.PP
Definition at line \fB393\fP of file \fBdebug/unordered_set\fP\&.
.SS "template<typename _Value , typename _Hash  = std::hash<_Value>, typename _Pred  = std::equal_to<_Value>, typename _Alloc  = std::allocator<_Value>> typedef \fB__gnu_debug::_Safe_iterator\fP< _Base_iterator, \fBunordered_set\fP> \fBstd::__debug::unordered_set\fP< _Value, _Hash, _Pred, _Alloc >::iterator"

.PP
Definition at line \fB99\fP of file \fBdebug/unordered_set\fP\&.
.SS "template<typename _Value , typename _Hash  = std::hash<_Value>, typename _Pred  = std::equal_to<_Value>, typename _Alloc  = std::allocator<_Value>> typedef _Base::key_equal \fBstd::__debug::unordered_set\fP< _Value, _Hash, _Pred, _Alloc >::key_equal"

.PP
Definition at line \fB92\fP of file \fBdebug/unordered_set\fP\&.
.SS "template<typename _Value , typename _Hash  = std::hash<_Value>, typename _Pred  = std::equal_to<_Value>, typename _Alloc  = std::allocator<_Value>> typedef _Base::key_type \fBstd::__debug::unordered_set\fP< _Value, _Hash, _Pred, _Alloc >::key_type"

.PP
Definition at line \fB95\fP of file \fBdebug/unordered_set\fP\&.
.SS "template<typename _Value , typename _Hash  = std::hash<_Value>, typename _Pred  = std::equal_to<_Value>, typename _Alloc  = std::allocator<_Value>> typedef \fB__gnu_debug::_Safe_local_iterator\fP< _Base_local_iterator, \fBunordered_set\fP> \fBstd::__debug::unordered_set\fP< _Value, _Hash, _Pred, _Alloc >::local_iterator"

.PP
Definition at line \fB103\fP of file \fBdebug/unordered_set\fP\&.
.SS "template<typename _Value , typename _Hash  = std::hash<_Value>, typename _Pred  = std::equal_to<_Value>, typename _Alloc  = std::allocator<_Value>> using \fBstd::__debug::unordered_set\fP< _Value, _Hash, _Pred, _Alloc >::node_type =  typename _Base::node_type"

.PP
Definition at line \fB392\fP of file \fBdebug/unordered_set\fP\&.
.SS "template<typename _Value , typename _Hash  = std::hash<_Value>, typename _Pred  = std::equal_to<_Value>, typename _Alloc  = std::allocator<_Value>> typedef _Base::size_type \fBstd::__debug::unordered_set\fP< _Value, _Hash, _Pred, _Alloc >::size_type"

.PP
Definition at line \fB90\fP of file \fBdebug/unordered_set\fP\&.
.SS "template<typename _Value , typename _Hash  = std::hash<_Value>, typename _Pred  = std::equal_to<_Value>, typename _Alloc  = std::allocator<_Value>> typedef _Base::value_type \fBstd::__debug::unordered_set\fP< _Value, _Hash, _Pred, _Alloc >::value_type"

.PP
Definition at line \fB96\fP of file \fBdebug/unordered_set\fP\&.
.SH "Constructor & Destructor Documentation"
.PP 
.SS "template<typename _Value , typename _Hash  = std::hash<_Value>, typename _Pred  = std::equal_to<_Value>, typename _Alloc  = std::allocator<_Value>> \fBstd::__debug::unordered_set\fP< _Value, _Hash, _Pred, _Alloc >::unordered_set (size_type __n, const hasher & __hf = \fChasher()\fP, const key_equal & __eql = \fCkey_equal()\fP, const allocator_type & __a = \fCallocator_type()\fP)\fC [inline]\fP, \fC [explicit]\fP"

.PP
Definition at line \fB110\fP of file \fBdebug/unordered_set\fP\&.
.SS "template<typename _Value , typename _Hash  = std::hash<_Value>, typename _Pred  = std::equal_to<_Value>, typename _Alloc  = std::allocator<_Value>> template<typename _InputIterator > \fBstd::__debug::unordered_set\fP< _Value, _Hash, _Pred, _Alloc >::unordered_set (_InputIterator __first, _InputIterator __last, size_type __n = \fC0\fP, const hasher & __hf = \fChasher()\fP, const key_equal & __eql = \fCkey_equal()\fP, const allocator_type & __a = \fCallocator_type()\fP)\fC [inline]\fP"

.PP
Definition at line \fB117\fP of file \fBdebug/unordered_set\fP\&.
.SS "template<typename _Value , typename _Hash  = std::hash<_Value>, typename _Pred  = std::equal_to<_Value>, typename _Alloc  = std::allocator<_Value>> \fBstd::__debug::unordered_set\fP< _Value, _Hash, _Pred, _Alloc >::unordered_set (_Base_ref __x)\fC [inline]\fP"

.PP
Definition at line \fB129\fP of file \fBdebug/unordered_set\fP\&.
.SS "template<typename _Value , typename _Hash  = std::hash<_Value>, typename _Pred  = std::equal_to<_Value>, typename _Alloc  = std::allocator<_Value>> \fBstd::__debug::unordered_set\fP< _Value, _Hash, _Pred, _Alloc >::unordered_set (const allocator_type & __a)\fC [inline]\fP, \fC [explicit]\fP"

.PP
Definition at line \fB135\fP of file \fBdebug/unordered_set\fP\&.
.SS "template<typename _Value , typename _Hash  = std::hash<_Value>, typename _Pred  = std::equal_to<_Value>, typename _Alloc  = std::allocator<_Value>> \fBstd::__debug::unordered_set\fP< _Value, _Hash, _Pred, _Alloc >::unordered_set (const \fBunordered_set\fP< _Value, _Hash, _Pred, _Alloc > & __uset, const allocator_type & __a)\fC [inline]\fP"

.PP
Definition at line \fB138\fP of file \fBdebug/unordered_set\fP\&.
.SS "template<typename _Value , typename _Hash  = std::hash<_Value>, typename _Pred  = std::equal_to<_Value>, typename _Alloc  = std::allocator<_Value>> \fBstd::__debug::unordered_set\fP< _Value, _Hash, _Pred, _Alloc >::unordered_set (\fBunordered_set\fP< _Value, _Hash, _Pred, _Alloc > && __uset, const allocator_type & __a)\fC [inline]\fP, \fC [noexcept]\fP"

.PP
Definition at line \fB142\fP of file \fBdebug/unordered_set\fP\&.
.SS "template<typename _Value , typename _Hash  = std::hash<_Value>, typename _Pred  = std::equal_to<_Value>, typename _Alloc  = std::allocator<_Value>> \fBstd::__debug::unordered_set\fP< _Value, _Hash, _Pred, _Alloc >::unordered_set (\fBinitializer_list\fP< value_type > __l, size_type __n = \fC0\fP, const hasher & __hf = \fChasher()\fP, const key_equal & __eql = \fCkey_equal()\fP, const allocator_type & __a = \fCallocator_type()\fP)\fC [inline]\fP"

.PP
Definition at line \fB148\fP of file \fBdebug/unordered_set\fP\&.
.SS "template<typename _Value , typename _Hash  = std::hash<_Value>, typename _Pred  = std::equal_to<_Value>, typename _Alloc  = std::allocator<_Value>> \fBstd::__debug::unordered_set\fP< _Value, _Hash, _Pred, _Alloc >::unordered_set (size_type __n, const allocator_type & __a)\fC [inline]\fP"

.PP
Definition at line \fB155\fP of file \fBdebug/unordered_set\fP\&.
.SS "template<typename _Value , typename _Hash  = std::hash<_Value>, typename _Pred  = std::equal_to<_Value>, typename _Alloc  = std::allocator<_Value>> \fBstd::__debug::unordered_set\fP< _Value, _Hash, _Pred, _Alloc >::unordered_set (size_type __n, const hasher & __hf, const allocator_type & __a)\fC [inline]\fP"

.PP
Definition at line \fB159\fP of file \fBdebug/unordered_set\fP\&.
.SS "template<typename _Value , typename _Hash  = std::hash<_Value>, typename _Pred  = std::equal_to<_Value>, typename _Alloc  = std::allocator<_Value>> template<typename _InputIterator > \fBstd::__debug::unordered_set\fP< _Value, _Hash, _Pred, _Alloc >::unordered_set (_InputIterator __first, _InputIterator __last, size_type __n, const allocator_type & __a)\fC [inline]\fP"

.PP
Definition at line \fB165\fP of file \fBdebug/unordered_set\fP\&.
.SS "template<typename _Value , typename _Hash  = std::hash<_Value>, typename _Pred  = std::equal_to<_Value>, typename _Alloc  = std::allocator<_Value>> template<typename _InputIterator > \fBstd::__debug::unordered_set\fP< _Value, _Hash, _Pred, _Alloc >::unordered_set (_InputIterator __first, _InputIterator __last, size_type __n, const hasher & __hf, const allocator_type & __a)\fC [inline]\fP"

.PP
Definition at line \fB172\fP of file \fBdebug/unordered_set\fP\&.
.SS "template<typename _Value , typename _Hash  = std::hash<_Value>, typename _Pred  = std::equal_to<_Value>, typename _Alloc  = std::allocator<_Value>> \fBstd::__debug::unordered_set\fP< _Value, _Hash, _Pred, _Alloc >::unordered_set (\fBinitializer_list\fP< value_type > __l, size_type __n, const allocator_type & __a)\fC [inline]\fP"

.PP
Definition at line \fB178\fP of file \fBdebug/unordered_set\fP\&.
.SS "template<typename _Value , typename _Hash  = std::hash<_Value>, typename _Pred  = std::equal_to<_Value>, typename _Alloc  = std::allocator<_Value>> \fBstd::__debug::unordered_set\fP< _Value, _Hash, _Pred, _Alloc >::unordered_set (\fBinitializer_list\fP< value_type > __l, size_type __n, const hasher & __hf, const allocator_type & __a)\fC [inline]\fP"

.PP
Definition at line \fB184\fP of file \fBdebug/unordered_set\fP\&.
.SH "Member Function Documentation"
.PP 
.SS "template<typename _Value , typename _Hash  = std::hash<_Value>, typename _Pred  = std::equal_to<_Value>, typename _Alloc  = std::allocator<_Value>> const \fB_Base\fP & \fBstd::__debug::unordered_set\fP< _Value, _Hash, _Pred, _Alloc >::_M_base () const\fC [inline]\fP, \fC [noexcept]\fP"

.PP
Definition at line \fB543\fP of file \fBdebug/unordered_set\fP\&.
.SS "template<typename _Value , typename _Hash  = std::hash<_Value>, typename _Pred  = std::equal_to<_Value>, typename _Alloc  = std::allocator<_Value>> \fB_Base\fP & \fBstd::__debug::unordered_set\fP< _Value, _Hash, _Pred, _Alloc >::_M_base ()\fC [inline]\fP, \fC [noexcept]\fP"

.PP
Definition at line \fB540\fP of file \fBdebug/unordered_set\fP\&.
.SS "void __gnu_debug::_Safe_unordered_container_base::_M_detach_all ()\fC [protected]\fP, \fC [inherited]\fP"
Detach all iterators, leaving them singular\&. 
.SS "void __gnu_debug::_Safe_sequence_base::_M_detach_singular ()\fC [protected]\fP, \fC [inherited]\fP"
Detach all singular iterators\&. 
.PP
\fBPostcondition\fP
.RS 4
for all iterators i attached to this sequence, i->_M_version == _M_version\&. 
.RE
.PP

.SS "__gnu_cxx::__mutex & __gnu_debug::_Safe_sequence_base::_M_get_mutex ()\fC [protected]\fP, \fC [inherited]\fP"
For use in _Safe_sequence\&. 
.PP
Referenced by \fB__gnu_debug::_Safe_sequence< _Sequence >::_M_transfer_from_if()\fP\&.
.SS "void \fB__gnu_debug::_Safe_unordered_container\fP< \fBunordered_set\fP< _Value, \fBstd::hash\fP< _Value >, \fBstd::equal_to\fP< _Value >, \fBstd::allocator\fP< _Value > >  >::_M_invalidate_all ()\fC [inline]\fP, \fC [protected]\fP, \fC [inherited]\fP"

.PP
Definition at line \fB76\fP of file \fBsafe_unordered_container\&.h\fP\&.
.SS "void __gnu_debug::_Safe_sequence_base::_M_invalidate_all () const\fC [inline]\fP, \fC [protected]\fP, \fC [inherited]\fP"
Invalidates all iterators\&. 
.PP
Definition at line \fB256\fP of file \fBsafe_base\&.h\fP\&.
.PP
References \fB__gnu_debug::_Safe_sequence_base::_M_version\fP\&.
.SS "void \fB__gnu_debug::_Safe_unordered_container\fP< \fBunordered_set\fP< _Value, \fBstd::hash\fP< _Value >, \fBstd::equal_to\fP< _Value >, \fBstd::allocator\fP< _Value > >  >::_M_invalidate_if (_Predicate __pred)\fC [protected]\fP, \fC [inherited]\fP"
Invalidates all iterators \fCx\fP that reference this container, are not singular, and for which \fC__pred(x)\fP returns \fCtrue\fP\&. \fC__pred\fP will be invoked with the normal iterators nested in the safe ones\&. 
.PP
Definition at line \fB90\fP of file \fBsafe_unordered_container\&.tcc\fP\&.
.SS "void \fB__gnu_debug::_Safe_unordered_container\fP< \fBunordered_set\fP< _Value, \fBstd::hash\fP< _Value >, \fBstd::equal_to\fP< _Value >, \fBstd::allocator\fP< _Value > >  >::_M_invalidate_local_if (_Predicate __pred)\fC [protected]\fP, \fC [inherited]\fP"
Invalidates all local iterators \fCx\fP that reference this container, are not singular, and for which \fC__pred(x)\fP returns \fCtrue\fP\&. \fC__pred\fP will be invoked with the normal local iterators nested in the safe ones\&. 
.PP
Definition at line \fB98\fP of file \fBsafe_unordered_container\&.tcc\fP\&.
.SS "void \fB__gnu_debug::_Safe_unordered_container\fP< \fBunordered_set\fP< _Value, \fBstd::hash\fP< _Value >, \fBstd::equal_to\fP< _Value >, \fBstd::allocator\fP< _Value > >  >::_M_invalidate_locals ()\fC [inline]\fP, \fC [protected]\fP, \fC [inherited]\fP"

.PP
Definition at line \fB67\fP of file \fBsafe_unordered_container\&.h\fP\&.
.SS "void __gnu_debug::_Safe_sequence_base::_M_revalidate_singular ()\fC [protected]\fP, \fC [inherited]\fP"
Revalidates all attached singular iterators\&. This method may be used to validate iterators that were invalidated before (but for some reason, such as an exception, need to become valid again)\&. 
.SS "_Safe_container & \fB__gnu_debug::_Safe_container\fP< \fBunordered_set\fP< _Value, \fBstd::hash\fP< _Value >, \fBstd::equal_to\fP< _Value >, \fBstd::allocator\fP< _Value > > , \fBstd::allocator\fP< _Value > , \fB__gnu_debug::_Safe_unordered_container\fP , true  >::_M_safe ()\fC [inline]\fP, \fC [protected]\fP, \fC [noexcept]\fP, \fC [inherited]\fP"

.PP
Definition at line \fB52\fP of file \fBsafe_container\&.h\fP\&.
.SS "void \fB__gnu_debug::_Safe_container\fP< \fBunordered_set\fP< _Value, \fBstd::hash\fP< _Value >, \fBstd::equal_to\fP< _Value >, \fBstd::allocator\fP< _Value > > , \fBstd::allocator\fP< _Value > , \fB__gnu_debug::_Safe_unordered_container\fP , true  >::_M_swap (\fB_Safe_container\fP< \fBunordered_set\fP< _Value, \fBstd::hash\fP< _Value >, \fBstd::equal_to\fP< _Value >, \fBstd::allocator\fP< _Value > >, \fBstd::allocator\fP< _Value >, \fB__gnu_debug::_Safe_unordered_container\fP > & __x)\fC [inline]\fP, \fC [noexcept]\fP, \fC [inherited]\fP"

.PP
Definition at line \fB111\fP of file \fBsafe_container\&.h\fP\&.
.SS "void __gnu_debug::_Safe_sequence_base::_M_swap (\fB_Safe_sequence_base\fP & __x)\fC [protected]\fP, \fC [noexcept]\fP, \fC [inherited]\fP"
Swap this sequence with the given sequence\&. This operation also swaps ownership of the iterators, so that when the operation is complete all iterators that originally referenced one container now reference the other container\&. 
.SS "void __gnu_debug::_Safe_unordered_container_base::_M_swap (\fB_Safe_unordered_container_base\fP & __x)\fC [protected]\fP, \fC [noexcept]\fP, \fC [inherited]\fP"
Swap this container with the given container\&. This operation also swaps ownership of the iterators, so that when the operation is complete all iterators that originally referenced one container now reference the other container\&. 
.SS "template<typename _Value , typename _Hash  = std::hash<_Value>, typename _Pred  = std::equal_to<_Value>, typename _Alloc  = std::allocator<_Value>> \fBconst_iterator\fP \fBstd::__debug::unordered_set\fP< _Value, _Hash, _Pred, _Alloc >::begin () const\fC [inline]\fP, \fC [noexcept]\fP"

.PP
Definition at line \fB226\fP of file \fBdebug/unordered_set\fP\&.
.SS "template<typename _Value , typename _Hash  = std::hash<_Value>, typename _Pred  = std::equal_to<_Value>, typename _Alloc  = std::allocator<_Value>> \fBiterator\fP \fBstd::__debug::unordered_set\fP< _Value, _Hash, _Pred, _Alloc >::begin ()\fC [inline]\fP, \fC [noexcept]\fP"

.PP
Definition at line \fB222\fP of file \fBdebug/unordered_set\fP\&.
.SS "template<typename _Value , typename _Hash  = std::hash<_Value>, typename _Pred  = std::equal_to<_Value>, typename _Alloc  = std::allocator<_Value>> \fBlocal_iterator\fP \fBstd::__debug::unordered_set\fP< _Value, _Hash, _Pred, _Alloc >::begin (size_type __b)\fC [inline]\fP"

.PP
Definition at line \fB247\fP of file \fBdebug/unordered_set\fP\&.
.SS "template<typename _Value , typename _Hash  = std::hash<_Value>, typename _Pred  = std::equal_to<_Value>, typename _Alloc  = std::allocator<_Value>> \fBconst_local_iterator\fP \fBstd::__debug::unordered_set\fP< _Value, _Hash, _Pred, _Alloc >::begin (size_type __b) const\fC [inline]\fP"

.PP
Definition at line \fB261\fP of file \fBdebug/unordered_set\fP\&.
.SS "template<typename _Value , typename _Hash  = std::hash<_Value>, typename _Pred  = std::equal_to<_Value>, typename _Alloc  = std::allocator<_Value>> size_type \fBstd::__debug::unordered_set\fP< _Value, _Hash, _Pred, _Alloc >::bucket_size (size_type __b) const\fC [inline]\fP"

.PP
Definition at line \fB289\fP of file \fBdebug/unordered_set\fP\&.
.SS "template<typename _Value , typename _Hash  = std::hash<_Value>, typename _Pred  = std::equal_to<_Value>, typename _Alloc  = std::allocator<_Value>> \fBconst_iterator\fP \fBstd::__debug::unordered_set\fP< _Value, _Hash, _Pred, _Alloc >::cbegin () const\fC [inline]\fP, \fC [noexcept]\fP"

.PP
Definition at line \fB238\fP of file \fBdebug/unordered_set\fP\&.
.SS "template<typename _Value , typename _Hash  = std::hash<_Value>, typename _Pred  = std::equal_to<_Value>, typename _Alloc  = std::allocator<_Value>> \fBconst_local_iterator\fP \fBstd::__debug::unordered_set\fP< _Value, _Hash, _Pred, _Alloc >::cbegin (size_type __b) const\fC [inline]\fP"

.PP
Definition at line \fB275\fP of file \fBdebug/unordered_set\fP\&.
.SS "template<typename _Value , typename _Hash  = std::hash<_Value>, typename _Pred  = std::equal_to<_Value>, typename _Alloc  = std::allocator<_Value>> \fBconst_iterator\fP \fBstd::__debug::unordered_set\fP< _Value, _Hash, _Pred, _Alloc >::cend () const\fC [inline]\fP, \fC [noexcept]\fP"

.PP
Definition at line \fB242\fP of file \fBdebug/unordered_set\fP\&.
.SS "template<typename _Value , typename _Hash  = std::hash<_Value>, typename _Pred  = std::equal_to<_Value>, typename _Alloc  = std::allocator<_Value>> \fBconst_local_iterator\fP \fBstd::__debug::unordered_set\fP< _Value, _Hash, _Pred, _Alloc >::cend (size_type __b) const\fC [inline]\fP"

.PP
Definition at line \fB282\fP of file \fBdebug/unordered_set\fP\&.
.SS "template<typename _Value , typename _Hash  = std::hash<_Value>, typename _Pred  = std::equal_to<_Value>, typename _Alloc  = std::allocator<_Value>> void \fBstd::__debug::unordered_set\fP< _Value, _Hash, _Pred, _Alloc >::clear ()\fC [inline]\fP, \fC [noexcept]\fP"

.PP
Definition at line \fB215\fP of file \fBdebug/unordered_set\fP\&.
.SS "template<typename _Value , typename _Hash  = std::hash<_Value>, typename _Pred  = std::equal_to<_Value>, typename _Alloc  = std::allocator<_Value>> template<typename\&.\&.\&. _Args> \fBstd::pair\fP< \fBiterator\fP, bool > \fBstd::__debug::unordered_set\fP< _Value, _Hash, _Pred, _Alloc >::emplace (_Args &&\&.\&.\&. __args)\fC [inline]\fP"

.PP
Definition at line \fB308\fP of file \fBdebug/unordered_set\fP\&.
.SS "template<typename _Value , typename _Hash  = std::hash<_Value>, typename _Pred  = std::equal_to<_Value>, typename _Alloc  = std::allocator<_Value>> template<typename\&.\&.\&. _Args> \fBiterator\fP \fBstd::__debug::unordered_set\fP< _Value, _Hash, _Pred, _Alloc >::emplace_hint (\fBconst_iterator\fP __hint, _Args &&\&.\&.\&. __args)\fC [inline]\fP"

.PP
Definition at line \fB318\fP of file \fBdebug/unordered_set\fP\&.
.SS "template<typename _Value , typename _Hash  = std::hash<_Value>, typename _Pred  = std::equal_to<_Value>, typename _Alloc  = std::allocator<_Value>> \fBconst_iterator\fP \fBstd::__debug::unordered_set\fP< _Value, _Hash, _Pred, _Alloc >::end () const\fC [inline]\fP, \fC [noexcept]\fP"

.PP
Definition at line \fB234\fP of file \fBdebug/unordered_set\fP\&.
.SS "template<typename _Value , typename _Hash  = std::hash<_Value>, typename _Pred  = std::equal_to<_Value>, typename _Alloc  = std::allocator<_Value>> \fBiterator\fP \fBstd::__debug::unordered_set\fP< _Value, _Hash, _Pred, _Alloc >::end ()\fC [inline]\fP, \fC [noexcept]\fP"

.PP
Definition at line \fB230\fP of file \fBdebug/unordered_set\fP\&.
.SS "template<typename _Value , typename _Hash  = std::hash<_Value>, typename _Pred  = std::equal_to<_Value>, typename _Alloc  = std::allocator<_Value>> \fBlocal_iterator\fP \fBstd::__debug::unordered_set\fP< _Value, _Hash, _Pred, _Alloc >::end (size_type __b)\fC [inline]\fP"

.PP
Definition at line \fB254\fP of file \fBdebug/unordered_set\fP\&.
.SS "template<typename _Value , typename _Hash  = std::hash<_Value>, typename _Pred  = std::equal_to<_Value>, typename _Alloc  = std::allocator<_Value>> \fBconst_local_iterator\fP \fBstd::__debug::unordered_set\fP< _Value, _Hash, _Pred, _Alloc >::end (size_type __b) const\fC [inline]\fP"

.PP
Definition at line \fB268\fP of file \fBdebug/unordered_set\fP\&.
.SS "template<typename _Value , typename _Hash  = std::hash<_Value>, typename _Pred  = std::equal_to<_Value>, typename _Alloc  = std::allocator<_Value>> \fBstd::pair\fP< \fBiterator\fP, \fBiterator\fP > \fBstd::__debug::unordered_set\fP< _Value, _Hash, _Pred, _Alloc >::equal_range (const key_type & __key)\fC [inline]\fP"

.PP
Definition at line \fB456\fP of file \fBdebug/unordered_set\fP\&.
.SS "template<typename _Value , typename _Hash  = std::hash<_Value>, typename _Pred  = std::equal_to<_Value>, typename _Alloc  = std::allocator<_Value>> \fBstd::pair\fP< \fBconst_iterator\fP, \fBconst_iterator\fP > \fBstd::__debug::unordered_set\fP< _Value, _Hash, _Pred, _Alloc >::equal_range (const key_type & __key) const\fC [inline]\fP"

.PP
Definition at line \fB475\fP of file \fBdebug/unordered_set\fP\&.
.SS "template<typename _Value , typename _Hash  = std::hash<_Value>, typename _Pred  = std::equal_to<_Value>, typename _Alloc  = std::allocator<_Value>> size_type \fBstd::__debug::unordered_set\fP< _Value, _Hash, _Pred, _Alloc >::erase (const key_type & __key)\fC [inline]\fP"

.PP
Definition at line \fB494\fP of file \fBdebug/unordered_set\fP\&.
.SS "template<typename _Value , typename _Hash  = std::hash<_Value>, typename _Pred  = std::equal_to<_Value>, typename _Alloc  = std::allocator<_Value>> \fBiterator\fP \fBstd::__debug::unordered_set\fP< _Value, _Hash, _Pred, _Alloc >::erase (\fBconst_iterator\fP __first, \fBconst_iterator\fP __last)\fC [inline]\fP"

.PP
Definition at line \fB521\fP of file \fBdebug/unordered_set\fP\&.
.SS "template<typename _Value , typename _Hash  = std::hash<_Value>, typename _Pred  = std::equal_to<_Value>, typename _Alloc  = std::allocator<_Value>> \fBiterator\fP \fBstd::__debug::unordered_set\fP< _Value, _Hash, _Pred, _Alloc >::erase (\fBconst_iterator\fP __it)\fC [inline]\fP"

.PP
Definition at line \fB507\fP of file \fBdebug/unordered_set\fP\&.
.SS "template<typename _Value , typename _Hash  = std::hash<_Value>, typename _Pred  = std::equal_to<_Value>, typename _Alloc  = std::allocator<_Value>> \fBiterator\fP \fBstd::__debug::unordered_set\fP< _Value, _Hash, _Pred, _Alloc >::erase (\fBiterator\fP __it)\fC [inline]\fP"

.PP
Definition at line \fB514\fP of file \fBdebug/unordered_set\fP\&.
.SS "template<typename _Value , typename _Hash  = std::hash<_Value>, typename _Pred  = std::equal_to<_Value>, typename _Alloc  = std::allocator<_Value>> node_type \fBstd::__debug::unordered_set\fP< _Value, _Hash, _Pred, _Alloc >::extract (const key_type & __key)\fC [inline]\fP"

.PP
Definition at line \fB403\fP of file \fBdebug/unordered_set\fP\&.
.SS "template<typename _Value , typename _Hash  = std::hash<_Value>, typename _Pred  = std::equal_to<_Value>, typename _Alloc  = std::allocator<_Value>> node_type \fBstd::__debug::unordered_set\fP< _Value, _Hash, _Pred, _Alloc >::extract (\fBconst_iterator\fP __position)\fC [inline]\fP"

.PP
Definition at line \fB396\fP of file \fBdebug/unordered_set\fP\&.
.SS "template<typename _Value , typename _Hash  = std::hash<_Value>, typename _Pred  = std::equal_to<_Value>, typename _Alloc  = std::allocator<_Value>> \fBiterator\fP \fBstd::__debug::unordered_set\fP< _Value, _Hash, _Pred, _Alloc >::find (const key_type & __key)\fC [inline]\fP"

.PP
Definition at line \fB430\fP of file \fBdebug/unordered_set\fP\&.
.SS "template<typename _Value , typename _Hash  = std::hash<_Value>, typename _Pred  = std::equal_to<_Value>, typename _Alloc  = std::allocator<_Value>> \fBconst_iterator\fP \fBstd::__debug::unordered_set\fP< _Value, _Hash, _Pred, _Alloc >::find (const key_type & __key) const\fC [inline]\fP"

.PP
Definition at line \fB443\fP of file \fBdebug/unordered_set\fP\&.
.SS "template<typename _Value , typename _Hash  = std::hash<_Value>, typename _Pred  = std::equal_to<_Value>, typename _Alloc  = std::allocator<_Value>> template<typename _InputIterator > void \fBstd::__debug::unordered_set\fP< _Value, _Hash, _Pred, _Alloc >::insert (_InputIterator __first, _InputIterator __last)\fC [inline]\fP"

.PP
Definition at line \fB376\fP of file \fBdebug/unordered_set\fP\&.
.SS "template<typename _Value , typename _Hash  = std::hash<_Value>, typename _Pred  = std::equal_to<_Value>, typename _Alloc  = std::allocator<_Value>> \fBstd::pair\fP< \fBiterator\fP, bool > \fBstd::__debug::unordered_set\fP< _Value, _Hash, _Pred, _Alloc >::insert (const value_type & __obj)\fC [inline]\fP"

.PP
Definition at line \fB329\fP of file \fBdebug/unordered_set\fP\&.
.SS "template<typename _Value , typename _Hash  = std::hash<_Value>, typename _Pred  = std::equal_to<_Value>, typename _Alloc  = std::allocator<_Value>> \fBiterator\fP \fBstd::__debug::unordered_set\fP< _Value, _Hash, _Pred, _Alloc >::insert (\fBconst_iterator\fP __hint, const value_type & __obj)\fC [inline]\fP"

.PP
Definition at line \fB338\fP of file \fBdebug/unordered_set\fP\&.
.SS "template<typename _Value , typename _Hash  = std::hash<_Value>, typename _Pred  = std::equal_to<_Value>, typename _Alloc  = std::allocator<_Value>> \fBiterator\fP \fBstd::__debug::unordered_set\fP< _Value, _Hash, _Pred, _Alloc >::insert (\fBconst_iterator\fP __hint, node_type && __nh)\fC [inline]\fP"

.PP
Definition at line \fB420\fP of file \fBdebug/unordered_set\fP\&.
.SS "template<typename _Value , typename _Hash  = std::hash<_Value>, typename _Pred  = std::equal_to<_Value>, typename _Alloc  = std::allocator<_Value>> \fBiterator\fP \fBstd::__debug::unordered_set\fP< _Value, _Hash, _Pred, _Alloc >::insert (\fBconst_iterator\fP __hint, value_type && __obj)\fC [inline]\fP"

.PP
Definition at line \fB357\fP of file \fBdebug/unordered_set\fP\&.
.SS "template<typename _Value , typename _Hash  = std::hash<_Value>, typename _Pred  = std::equal_to<_Value>, typename _Alloc  = std::allocator<_Value>> \fBinsert_return_type\fP \fBstd::__debug::unordered_set\fP< _Value, _Hash, _Pred, _Alloc >::insert (node_type && __nh)\fC [inline]\fP"

.PP
Definition at line \fB412\fP of file \fBdebug/unordered_set\fP\&.
.SS "template<typename _Value , typename _Hash  = std::hash<_Value>, typename _Pred  = std::equal_to<_Value>, typename _Alloc  = std::allocator<_Value>> void \fBstd::__debug::unordered_set\fP< _Value, _Hash, _Pred, _Alloc >::insert (\fBstd::initializer_list\fP< value_type > __l)\fC [inline]\fP"

.PP
Definition at line \fB367\fP of file \fBdebug/unordered_set\fP\&.
.SS "template<typename _Value , typename _Hash  = std::hash<_Value>, typename _Pred  = std::equal_to<_Value>, typename _Alloc  = std::allocator<_Value>> \fBstd::pair\fP< \fBiterator\fP, bool > \fBstd::__debug::unordered_set\fP< _Value, _Hash, _Pred, _Alloc >::insert (value_type && __obj)\fC [inline]\fP"

.PP
Definition at line \fB348\fP of file \fBdebug/unordered_set\fP\&.
.SS "template<typename _Value , typename _Hash  = std::hash<_Value>, typename _Pred  = std::equal_to<_Value>, typename _Alloc  = std::allocator<_Value>> float \fBstd::__debug::unordered_set\fP< _Value, _Hash, _Pred, _Alloc >::max_load_factor () const\fC [inline]\fP, \fC [noexcept]\fP"

.PP
Definition at line \fB296\fP of file \fBdebug/unordered_set\fP\&.
.SS "template<typename _Value , typename _Hash  = std::hash<_Value>, typename _Pred  = std::equal_to<_Value>, typename _Alloc  = std::allocator<_Value>> void \fBstd::__debug::unordered_set\fP< _Value, _Hash, _Pred, _Alloc >::max_load_factor (float __f)\fC [inline]\fP"

.PP
Definition at line \fB300\fP of file \fBdebug/unordered_set\fP\&.
.SS "template<typename _Value , typename _Hash  = std::hash<_Value>, typename _Pred  = std::equal_to<_Value>, typename _Alloc  = std::allocator<_Value>> \fBunordered_set\fP & \fBstd::__debug::unordered_set\fP< _Value, _Hash, _Pred, _Alloc >::operator= (\fBinitializer_list\fP< value_type > __l)\fC [inline]\fP"

.PP
Definition at line \fB199\fP of file \fBdebug/unordered_set\fP\&.
.SS "template<typename _Value , typename _Hash  = std::hash<_Value>, typename _Pred  = std::equal_to<_Value>, typename _Alloc  = std::allocator<_Value>> void \fBstd::__debug::unordered_set\fP< _Value, _Hash, _Pred, _Alloc >::swap (\fBunordered_set\fP< _Value, _Hash, _Pred, _Alloc > & __x)\fC [inline]\fP, \fC [noexcept]\fP"

.PP
Definition at line \fB207\fP of file \fBdebug/unordered_set\fP\&.
.SH "Friends And Related Function Documentation"
.PP 
.SS "template<typename _Value , typename _Hash  = std::hash<_Value>, typename _Pred  = std::equal_to<_Value>, typename _Alloc  = std::allocator<_Value>> template<typename _ItT , typename _SeqT , typename _CatT > friend class \fB::__gnu_debug::_Safe_iterator\fP\fC [friend]\fP"

.PP
Definition at line \fB77\fP of file \fBdebug/unordered_set\fP\&.
.SS "template<typename _Value , typename _Hash  = std::hash<_Value>, typename _Pred  = std::equal_to<_Value>, typename _Alloc  = std::allocator<_Value>> template<typename _ItT , typename _SeqT > friend class \fB::__gnu_debug::_Safe_local_iterator\fP\fC [friend]\fP"

.PP
Definition at line \fB79\fP of file \fBdebug/unordered_set\fP\&.
.SH "Member Data Documentation"
.PP 
.SS "_Safe_iterator_base* __gnu_debug::_Safe_sequence_base::_M_const_iterators\fC [inherited]\fP"

.PP
The list of constant iterators that reference this container\&. 
.PP
Definition at line \fB197\fP of file \fBsafe_base\&.h\fP\&.
.PP
Referenced by \fB__gnu_debug::_Safe_sequence< _Sequence >::_M_transfer_from_if()\fP\&.
.SS "_Safe_iterator_base* __gnu_debug::_Safe_unordered_container_base::_M_const_local_iterators\fC [inherited]\fP"

.PP
The list of constant local iterators that reference this container\&. 
.PP
Definition at line \fB130\fP of file \fBsafe_unordered_base\&.h\fP\&.
.SS "_Safe_iterator_base* __gnu_debug::_Safe_sequence_base::_M_iterators\fC [inherited]\fP"

.PP
The list of mutable iterators that reference this container\&. 
.PP
Definition at line \fB194\fP of file \fBsafe_base\&.h\fP\&.
.PP
Referenced by \fB__gnu_debug::_Safe_sequence< _Sequence >::_M_transfer_from_if()\fP\&.
.SS "_Safe_iterator_base* __gnu_debug::_Safe_unordered_container_base::_M_local_iterators\fC [inherited]\fP"

.PP
The list of mutable local iterators that reference this container\&. 
.PP
Definition at line \fB127\fP of file \fBsafe_unordered_base\&.h\fP\&.
.SS "unsigned int __gnu_debug::_Safe_sequence_base::_M_version\fC [mutable]\fP, \fC [inherited]\fP"

.PP
The container version number\&. This number may never be 0\&. 
.PP
Definition at line \fB200\fP of file \fBsafe_base\&.h\fP\&.
.PP
Referenced by \fB__gnu_debug::_Safe_sequence_base::_M_invalidate_all()\fP\&.

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