.TH "std::__debug::set< _Key, _Compare, _Allocator >" 3cxx "libstdc++" \" -*- nroff -*-
.ad l
.nh
.SH NAME
std::__debug::set< _Key, _Compare, _Allocator > \- Class std::set with safety/checking/debug instrumentation\&.  

.SH SYNOPSIS
.br
.PP
.PP
\fC#include <set\&.h>\fP
.PP
Inherits \fB__gnu_debug::_Safe_container< _SafeContainer, _Alloc, _SafeBase, _IsCxx11AllocatorAware >\fP, and set< _Key, std::less< _Key >, std::allocator< _Key > >\&.
.SS "Public Types"

.in +1c
.ti -1c
.RI "\fBtypedef\fP \fB_Allocator\fP \fBallocator_type\fP"
.br
.ti -1c
.RI "\fBtypedef\fP \fB__gnu_debug::_Safe_iterator\fP< \fB_Base_const_iterator\fP, \fBset\fP > \fBconst_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 \fBstd::reverse_iterator\fP< \fBconst_iterator\fP > \fBconst_reverse_iterator\fP"
.br
.ti -1c
.RI "\fBtypedef\fP _Base::difference_type \fBdifference_type\fP"
.br
.ti -1c
.RI "\fBtypedef\fP \fB__gnu_debug::_Safe_iterator\fP< \fB_Base_iterator\fP, \fBset\fP > \fBiterator\fP"
.br
.ti -1c
.RI "\fBtypedef\fP _Compare \fBkey_compare\fP"
.br
.ti -1c
.RI "\fBtypedef\fP \fB_Key\fP \fBkey_type\fP"
.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 \fBstd::reverse_iterator\fP< \fBiterator\fP > \fBreverse_iterator\fP"
.br
.ti -1c
.RI "\fBtypedef\fP _Base::size_type \fBsize_type\fP"
.br
.ti -1c
.RI "\fBtypedef\fP _Compare \fBvalue_compare\fP"
.br
.ti -1c
.RI "\fBtypedef\fP \fB_Key\fP \fBvalue_type\fP"
.br
.in -1c
.SS "Public Member Functions"

.in +1c
.ti -1c
.RI "template<\fBtypename\fP \fB_InputIterator\fP > \fBset\fP (\fB_InputIterator\fP __first, \fB_InputIterator\fP __last, \fBconst\fP _Compare &__comp=_Compare(), \fBconst\fP \fB_Allocator\fP &__a=\fB_Allocator\fP())"
.br
.ti -1c
.RI "template<\fBtypename\fP \fB_InputIterator\fP > \fBset\fP (\fB_InputIterator\fP __first, \fB_InputIterator\fP __last, \fBconst\fP \fBallocator_type\fP &__a)"
.br
.ti -1c
.RI "\fBset\fP (\fBconst\fP \fB_Base\fP &__x)"
.br
.ti -1c
.RI "\fBset\fP (\fBconst\fP _Compare &__comp, \fBconst\fP \fB_Allocator\fP &__a=\fB_Allocator\fP())"
.br
.ti -1c
.RI "\fBset\fP (\fBconst\fP \fBallocator_type\fP &__a)"
.br
.ti -1c
.RI "\fBset\fP (\fBconst\fP \fBset\fP &)=\fBdefault\fP"
.br
.ti -1c
.RI "\fBset\fP (\fBconst\fP \fBset\fP &__x, \fBconst\fP \fBallocator_type\fP &__a)"
.br
.ti -1c
.RI "\fBset\fP (\fBinitializer_list\fP< value_type > \fB__l\fP, \fBconst\fP _Compare &__comp=_Compare(), \fBconst\fP \fBallocator_type\fP &__a=\fBallocator_type\fP())"
.br
.ti -1c
.RI "\fBset\fP (\fBinitializer_list\fP< value_type > \fB__l\fP, \fBconst\fP \fBallocator_type\fP &__a)"
.br
.ti -1c
.RI "\fBset\fP (\fBset\fP &&)=\fBdefault\fP"
.br
.ti -1c
.RI "\fBset\fP (\fBset\fP &&__x, \fBconst\fP \fBallocator_type\fP &__a) \fBnoexcept\fP(\fBnoexcept\fP(\fB_Base\fP(std::move(__x\&._M_base()), __a)))"
.br
.ti -1c
.RI "\fBconst\fP \fB_Base\fP & \fB_M_base\fP () \fBconst\fP \fBnoexcept\fP"
.br
.ti -1c
.RI "\fB_Base\fP & \fB_M_base\fP () \fBnoexcept\fP"
.br
.ti -1c
.RI "\fBvoid\fP \fB_M_swap\fP (_Safe_container &__x) \fBnoexcept\fP"
.br
.ti -1c
.RI "\fBconst_iterator\fP \fBbegin\fP () \fBconst\fP \fBnoexcept\fP"
.br
.ti -1c
.RI "\fBiterator\fP \fBbegin\fP () \fBnoexcept\fP"
.br
.ti -1c
.RI "\fBconst_iterator\fP \fBcbegin\fP () \fBconst\fP \fBnoexcept\fP"
.br
.ti -1c
.RI "\fBconst_iterator\fP \fBcend\fP () \fBconst\fP \fBnoexcept\fP"
.br
.ti -1c
.RI "\fBvoid\fP \fBclear\fP () \fBnoexcept\fP"
.br
.ti -1c
.RI "\fBconst_reverse_iterator\fP \fBcrbegin\fP () \fBconst\fP \fBnoexcept\fP"
.br
.ti -1c
.RI "\fBconst_reverse_iterator\fP \fBcrend\fP () \fBconst\fP \fBnoexcept\fP"
.br
.ti -1c
.RI "template<typename\&.\&.\&. _Args> \fBstd::pair\fP< \fBiterator\fP, bool > \fBemplace\fP (\fB_Args\fP &&\&.\&.\&. \fB__args\fP)"
.br
.ti -1c
.RI "template<typename\&.\&.\&. _Args> \fBiterator\fP \fBemplace_hint\fP (\fBconst_iterator\fP \fB__pos\fP, \fB_Args\fP &&\&.\&.\&. \fB__args\fP)"
.br
.ti -1c
.RI "\fBconst_iterator\fP \fBend\fP () \fBconst\fP \fBnoexcept\fP"
.br
.ti -1c
.RI "\fBiterator\fP \fBend\fP () \fBnoexcept\fP"
.br
.ti -1c
.RI "template<\fBtypename\fP \fB_Kt\fP , \fBtypename\fP \fB_Req\fP  = typename __has_is_transparent<_Compare, _Kt>::type> \fBstd::pair\fP< \fBiterator\fP, \fBiterator\fP > \fBequal_range\fP (\fBconst\fP \fB_Kt\fP &__x)"
.br
.ti -1c
.RI "template<\fBtypename\fP \fB_Kt\fP , \fBtypename\fP \fB_Req\fP  = typename __has_is_transparent<_Compare, _Kt>::type> \fBstd::pair\fP< \fBconst_iterator\fP, \fBconst_iterator\fP > \fBequal_range\fP (\fBconst\fP \fB_Kt\fP &__x) \fBconst\fP"
.br
.ti -1c
.RI "\fBstd::pair\fP< \fBiterator\fP, \fBiterator\fP > \fBequal_range\fP (\fBconst\fP \fBkey_type\fP &__x)"
.br
.ti -1c
.RI "\fBstd::pair\fP< \fBconst_iterator\fP, \fBconst_iterator\fP > \fBequal_range\fP (\fBconst\fP \fBkey_type\fP &__x) \fBconst\fP"
.br
.ti -1c
.RI "size_type \fBerase\fP (\fBconst\fP \fBkey_type\fP &__x)"
.br
.ti -1c
.RI "_GLIBCXX_ABI_TAG_CXX11 \fBiterator\fP \fBerase\fP (\fBconst_iterator\fP __first, \fBconst_iterator\fP __last)"
.br
.ti -1c
.RI "_GLIBCXX_ABI_TAG_CXX11 \fBiterator\fP \fBerase\fP (\fBconst_iterator\fP \fB__position\fP)"
.br
.ti -1c
.RI "template<\fBtypename\fP \fB_Kt\fP , \fBtypename\fP \fB_Req\fP  = typename __has_is_transparent<_Compare, _Kt>::type> \fBiterator\fP \fBfind\fP (\fBconst\fP \fB_Kt\fP &__x)"
.br
.ti -1c
.RI "template<\fBtypename\fP \fB_Kt\fP , \fBtypename\fP \fB_Req\fP  = typename __has_is_transparent<_Compare, _Kt>::type> \fBconst_iterator\fP \fBfind\fP (\fBconst\fP \fB_Kt\fP &__x) \fBconst\fP"
.br
.ti -1c
.RI "\fBiterator\fP \fBfind\fP (\fBconst\fP \fBkey_type\fP &__x)"
.br
.ti -1c
.RI "\fBconst_iterator\fP \fBfind\fP (\fBconst\fP \fBkey_type\fP &__x) \fBconst\fP"
.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 "\fBstd::pair\fP< \fBiterator\fP, bool > \fBinsert\fP (\fBconst\fP value_type &__x)"
.br
.ti -1c
.RI "\fBiterator\fP \fBinsert\fP (\fBconst_iterator\fP \fB__position\fP, \fBconst\fP value_type &__x)"
.br
.ti -1c
.RI "\fBiterator\fP \fBinsert\fP (\fBconst_iterator\fP \fB__position\fP, value_type &&__x)"
.br
.ti -1c
.RI "\fBvoid\fP \fBinsert\fP (\fBinitializer_list\fP< value_type > \fB__l\fP)"
.br
.ti -1c
.RI "\fBstd::pair\fP< \fBiterator\fP, bool > \fBinsert\fP (value_type &&__x)"
.br
.ti -1c
.RI "template<\fBtypename\fP \fB_Kt\fP , \fBtypename\fP \fB_Req\fP  = typename __has_is_transparent<_Compare, _Kt>::type> \fBiterator\fP \fBlower_bound\fP (\fBconst\fP \fB_Kt\fP &__x)"
.br
.ti -1c
.RI "template<\fBtypename\fP \fB_Kt\fP , \fBtypename\fP \fB_Req\fP  = typename __has_is_transparent<_Compare, _Kt>::type> \fBconst_iterator\fP \fBlower_bound\fP (\fBconst\fP \fB_Kt\fP &__x) \fBconst\fP"
.br
.ti -1c
.RI "\fBiterator\fP \fBlower_bound\fP (\fBconst\fP \fBkey_type\fP &__x)"
.br
.ti -1c
.RI "\fBconst_iterator\fP \fBlower_bound\fP (\fBconst\fP \fBkey_type\fP &__x) \fBconst\fP"
.br
.ti -1c
.RI "\fBset\fP & \fBoperator=\fP (\fBconst\fP \fBset\fP &)=\fBdefault\fP"
.br
.ti -1c
.RI "\fBset\fP & \fBoperator=\fP (\fBinitializer_list\fP< value_type > \fB__l\fP)"
.br
.ti -1c
.RI "\fBset\fP & \fBoperator=\fP (\fBset\fP &&)=\fBdefault\fP"
.br
.ti -1c
.RI "\fBconst_reverse_iterator\fP \fBrbegin\fP () \fBconst\fP \fBnoexcept\fP"
.br
.ti -1c
.RI "\fBreverse_iterator\fP \fBrbegin\fP () \fBnoexcept\fP"
.br
.ti -1c
.RI "\fBconst_reverse_iterator\fP \fBrend\fP () \fBconst\fP \fBnoexcept\fP"
.br
.ti -1c
.RI "\fBreverse_iterator\fP \fBrend\fP () \fBnoexcept\fP"
.br
.ti -1c
.RI "\fBvoid\fP \fBswap\fP (\fBset\fP &__x) \fBnoexcept\fP(/*\fBconditional\fP */)"
.br
.ti -1c
.RI "template<\fBtypename\fP \fB_Kt\fP , \fBtypename\fP \fB_Req\fP  = typename __has_is_transparent<_Compare, _Kt>::type> \fBiterator\fP \fBupper_bound\fP (\fBconst\fP \fB_Kt\fP &__x)"
.br
.ti -1c
.RI "template<\fBtypename\fP \fB_Kt\fP , \fBtypename\fP \fB_Req\fP  = typename __has_is_transparent<_Compare, _Kt>::type> \fBconst_iterator\fP \fBupper_bound\fP (\fBconst\fP \fB_Kt\fP &__x) \fBconst\fP"
.br
.ti -1c
.RI "\fBiterator\fP \fBupper_bound\fP (\fBconst\fP \fBkey_type\fP &__x)"
.br
.ti -1c
.RI "\fBconst_iterator\fP \fBupper_bound\fP (\fBconst\fP \fBkey_type\fP &__x) \fBconst\fP"
.br
.in -1c
.SS "Protected Member Functions"

.in +1c
.ti -1c
.RI "_Safe_container & \fB_M_safe\fP () \fBnoexcept\fP"
.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
.in -1c
.SH "Detailed Description"
.PP 

.SS "template<\fBtypename\fP \fB_Key\fP, \fBtypename\fP _Compare = std::less<_Key>, \fBtypename\fP \fB_Allocator\fP = std::allocator<_Key>>
.br
class std::__debug::set< _Key, _Compare, _Allocator >"Class std::set with safety/checking/debug instrumentation\&. 
.PP
Definition at line \fB44\fP of file \fBdebug/set\&.h\fP\&.
.SH "Member Typedef Documentation"
.PP 
.SS "template<\fBtypename\fP \fB_Key\fP , \fBtypename\fP _Compare  = std::less<_Key>, \fBtypename\fP \fB_Allocator\fP  = std::allocator<_Key>> \fBtypedef\fP \fB_Allocator\fP \fBstd::__debug::set\fP< \fB_Key\fP, _Compare, \fB_Allocator\fP >::allocator_type"

.PP
Definition at line \fB67\fP of file \fBdebug/set\&.h\fP\&.
.SS "template<\fBtypename\fP \fB_Key\fP , \fBtypename\fP _Compare  = std::less<_Key>, \fBtypename\fP \fB_Allocator\fP  = std::allocator<_Key>> \fBtypedef\fP \fB__gnu_debug::_Safe_iterator\fP<\fB_Base_const_iterator\fP, \fBset\fP> \fBstd::__debug::set\fP< \fB_Key\fP, _Compare, \fB_Allocator\fP >::const_iterator"

.PP
Definition at line \fB74\fP of file \fBdebug/set\&.h\fP\&.
.SS "template<\fBtypename\fP \fB_Key\fP , \fBtypename\fP _Compare  = std::less<_Key>, \fBtypename\fP \fB_Allocator\fP  = std::allocator<_Key>> \fBtypedef\fP _Base::const_pointer \fBstd::__debug::set\fP< \fB_Key\fP, _Compare, \fB_Allocator\fP >::const_pointer"

.PP
Definition at line \fB79\fP of file \fBdebug/set\&.h\fP\&.
.SS "template<\fBtypename\fP \fB_Key\fP , \fBtypename\fP _Compare  = std::less<_Key>, \fBtypename\fP \fB_Allocator\fP  = std::allocator<_Key>> \fBtypedef\fP _Base::const_reference \fBstd::__debug::set\fP< \fB_Key\fP, _Compare, \fB_Allocator\fP >::const_reference"

.PP
Definition at line \fB69\fP of file \fBdebug/set\&.h\fP\&.
.SS "template<\fBtypename\fP \fB_Key\fP , \fBtypename\fP _Compare  = std::less<_Key>, \fBtypename\fP \fB_Allocator\fP  = std::allocator<_Key>> \fBtypedef\fP \fBstd::reverse_iterator\fP<\fBconst_iterator\fP> \fBstd::__debug::set\fP< \fB_Key\fP, _Compare, \fB_Allocator\fP >::const_reverse_iterator"

.PP
Definition at line \fB81\fP of file \fBdebug/set\&.h\fP\&.
.SS "template<\fBtypename\fP \fB_Key\fP , \fBtypename\fP _Compare  = std::less<_Key>, \fBtypename\fP \fB_Allocator\fP  = std::allocator<_Key>> \fBtypedef\fP _Base::difference_type \fBstd::__debug::set\fP< \fB_Key\fP, _Compare, \fB_Allocator\fP >::difference_type"

.PP
Definition at line \fB77\fP of file \fBdebug/set\&.h\fP\&.
.SS "template<\fBtypename\fP \fB_Key\fP , \fBtypename\fP _Compare  = std::less<_Key>, \fBtypename\fP \fB_Allocator\fP  = std::allocator<_Key>> \fBtypedef\fP \fB__gnu_debug::_Safe_iterator\fP<\fB_Base_iterator\fP, \fBset\fP> \fBstd::__debug::set\fP< \fB_Key\fP, _Compare, \fB_Allocator\fP >::iterator"

.PP
Definition at line \fB72\fP of file \fBdebug/set\&.h\fP\&.
.SS "template<\fBtypename\fP \fB_Key\fP , \fBtypename\fP _Compare  = std::less<_Key>, \fBtypename\fP \fB_Allocator\fP  = std::allocator<_Key>> \fBtypedef\fP _Compare \fBstd::__debug::set\fP< \fB_Key\fP, _Compare, \fB_Allocator\fP >::key_compare"

.PP
Definition at line \fB65\fP of file \fBdebug/set\&.h\fP\&.
.SS "template<\fBtypename\fP \fB_Key\fP , \fBtypename\fP _Compare  = std::less<_Key>, \fBtypename\fP \fB_Allocator\fP  = std::allocator<_Key>> \fBtypedef\fP \fB_Key\fP \fBstd::__debug::set\fP< \fB_Key\fP, _Compare, \fB_Allocator\fP >::key_type"

.PP
Definition at line \fB63\fP of file \fBdebug/set\&.h\fP\&.
.SS "template<\fBtypename\fP \fB_Key\fP , \fBtypename\fP _Compare  = std::less<_Key>, \fBtypename\fP \fB_Allocator\fP  = std::allocator<_Key>> \fBtypedef\fP _Base::pointer \fBstd::__debug::set\fP< \fB_Key\fP, _Compare, \fB_Allocator\fP >::pointer"

.PP
Definition at line \fB78\fP of file \fBdebug/set\&.h\fP\&.
.SS "template<\fBtypename\fP \fB_Key\fP , \fBtypename\fP _Compare  = std::less<_Key>, \fBtypename\fP \fB_Allocator\fP  = std::allocator<_Key>> \fBtypedef\fP _Base::reference \fBstd::__debug::set\fP< \fB_Key\fP, _Compare, \fB_Allocator\fP >::reference"

.PP
Definition at line \fB68\fP of file \fBdebug/set\&.h\fP\&.
.SS "template<\fBtypename\fP \fB_Key\fP , \fBtypename\fP _Compare  = std::less<_Key>, \fBtypename\fP \fB_Allocator\fP  = std::allocator<_Key>> \fBtypedef\fP \fBstd::reverse_iterator\fP<\fBiterator\fP> \fBstd::__debug::set\fP< \fB_Key\fP, _Compare, \fB_Allocator\fP >::reverse_iterator"

.PP
Definition at line \fB80\fP of file \fBdebug/set\&.h\fP\&.
.SS "template<\fBtypename\fP \fB_Key\fP , \fBtypename\fP _Compare  = std::less<_Key>, \fBtypename\fP \fB_Allocator\fP  = std::allocator<_Key>> \fBtypedef\fP _Base::size_type \fBstd::__debug::set\fP< \fB_Key\fP, _Compare, \fB_Allocator\fP >::size_type"

.PP
Definition at line \fB76\fP of file \fBdebug/set\&.h\fP\&.
.SS "template<\fBtypename\fP \fB_Key\fP , \fBtypename\fP _Compare  = std::less<_Key>, \fBtypename\fP \fB_Allocator\fP  = std::allocator<_Key>> \fBtypedef\fP _Compare \fBstd::__debug::set\fP< \fB_Key\fP, _Compare, \fB_Allocator\fP >::value_compare"

.PP
Definition at line \fB66\fP of file \fBdebug/set\&.h\fP\&.
.SS "template<\fBtypename\fP \fB_Key\fP , \fBtypename\fP _Compare  = std::less<_Key>, \fBtypename\fP \fB_Allocator\fP  = std::allocator<_Key>> \fBtypedef\fP \fB_Key\fP \fBstd::__debug::set\fP< \fB_Key\fP, _Compare, \fB_Allocator\fP >::value_type"

.PP
Definition at line \fB64\fP of file \fBdebug/set\&.h\fP\&.
.SH "Constructor & Destructor Documentation"
.PP 
.SS "template<\fBtypename\fP \fB_Key\fP , \fBtypename\fP _Compare  = std::less<_Key>, \fBtypename\fP \fB_Allocator\fP  = std::allocator<_Key>> \fBstd::__debug::set\fP< \fB_Key\fP, _Compare, \fB_Allocator\fP >::set (\fBinitializer_list\fP< value_type > __l, \fBconst\fP _Compare & __comp = \fC_Compare()\fP, \fBconst\fP \fBallocator_type\fP & __a = \fC\fBallocator_type\fP()\fP)\fC [inline]\fP"

.PP
Definition at line \fB97\fP of file \fBdebug/set\&.h\fP\&.
.SS "template<\fBtypename\fP \fB_Key\fP , \fBtypename\fP _Compare  = std::less<_Key>, \fBtypename\fP \fB_Allocator\fP  = std::allocator<_Key>> \fBstd::__debug::set\fP< \fB_Key\fP, _Compare, \fB_Allocator\fP >::set (\fBconst\fP \fBallocator_type\fP & __a)\fC [inline]\fP, \fC [explicit]\fP"

.PP
Definition at line \fB103\fP of file \fBdebug/set\&.h\fP\&.
.SS "template<\fBtypename\fP \fB_Key\fP , \fBtypename\fP _Compare  = std::less<_Key>, \fBtypename\fP \fB_Allocator\fP  = std::allocator<_Key>> \fBstd::__debug::set\fP< \fB_Key\fP, _Compare, \fB_Allocator\fP >::set (\fBconst\fP \fBset\fP< \fB_Key\fP, _Compare, \fB_Allocator\fP > & __x, \fBconst\fP \fBallocator_type\fP & __a)\fC [inline]\fP"

.PP
Definition at line \fB106\fP of file \fBdebug/set\&.h\fP\&.
.SS "template<\fBtypename\fP \fB_Key\fP , \fBtypename\fP _Compare  = std::less<_Key>, \fBtypename\fP \fB_Allocator\fP  = std::allocator<_Key>> \fBstd::__debug::set\fP< \fB_Key\fP, _Compare, \fB_Allocator\fP >::set (\fBset\fP< \fB_Key\fP, _Compare, \fB_Allocator\fP > && __x, \fBconst\fP \fBallocator_type\fP & __a)\fC [inline]\fP, \fC [noexcept]\fP"

.PP
Definition at line \fB109\fP of file \fBdebug/set\&.h\fP\&.
.SS "template<\fBtypename\fP \fB_Key\fP , \fBtypename\fP _Compare  = std::less<_Key>, \fBtypename\fP \fB_Allocator\fP  = std::allocator<_Key>> \fBstd::__debug::set\fP< \fB_Key\fP, _Compare, \fB_Allocator\fP >::set (\fBinitializer_list\fP< value_type > __l, \fBconst\fP \fBallocator_type\fP & __a)\fC [inline]\fP"

.PP
Definition at line \fB114\fP of file \fBdebug/set\&.h\fP\&.
.SS "template<\fBtypename\fP \fB_Key\fP , \fBtypename\fP _Compare  = std::less<_Key>, \fBtypename\fP \fB_Allocator\fP  = std::allocator<_Key>> template<\fBtypename\fP \fB_InputIterator\fP > \fBstd::__debug::set\fP< \fB_Key\fP, _Compare, \fB_Allocator\fP >::set (\fB_InputIterator\fP __first, \fB_InputIterator\fP __last, \fBconst\fP \fBallocator_type\fP & __a)\fC [inline]\fP"

.PP
Definition at line \fB118\fP of file \fBdebug/set\&.h\fP\&.
.SS "template<\fBtypename\fP \fB_Key\fP , \fBtypename\fP _Compare  = std::less<_Key>, \fBtypename\fP \fB_Allocator\fP  = std::allocator<_Key>> \fBstd::__debug::set\fP< \fB_Key\fP, _Compare, \fB_Allocator\fP >::set (\fBconst\fP _Compare & __comp, \fBconst\fP \fB_Allocator\fP & __a = \fC\fB_Allocator\fP()\fP)\fC [inline]\fP, \fC [explicit]\fP"

.PP
Definition at line \fB127\fP of file \fBdebug/set\&.h\fP\&.
.SS "template<\fBtypename\fP \fB_Key\fP , \fBtypename\fP _Compare  = std::less<_Key>, \fBtypename\fP \fB_Allocator\fP  = std::allocator<_Key>> template<\fBtypename\fP \fB_InputIterator\fP > \fBstd::__debug::set\fP< \fB_Key\fP, _Compare, \fB_Allocator\fP >::set (\fB_InputIterator\fP __first, \fB_InputIterator\fP __last, \fBconst\fP _Compare & __comp = \fC_Compare()\fP, \fBconst\fP \fB_Allocator\fP & __a = \fC\fB_Allocator\fP()\fP)\fC [inline]\fP"

.PP
Definition at line \fB132\fP of file \fBdebug/set\&.h\fP\&.
.SS "template<\fBtypename\fP \fB_Key\fP , \fBtypename\fP _Compare  = std::less<_Key>, \fBtypename\fP \fB_Allocator\fP  = std::allocator<_Key>> \fBstd::__debug::set\fP< \fB_Key\fP, _Compare, \fB_Allocator\fP >::set (\fBconst\fP \fB_Base\fP & __x)\fC [inline]\fP"

.PP
Definition at line \fB140\fP of file \fBdebug/set\&.h\fP\&.
.SH "Member Function Documentation"
.PP 
.SS "template<\fBtypename\fP \fB_Key\fP , \fBtypename\fP _Compare  = std::less<_Key>, \fBtypename\fP \fB_Allocator\fP  = std::allocator<_Key>> \fBconst\fP \fB_Base\fP & \fBstd::__debug::set\fP< \fB_Key\fP, _Compare, \fB_Allocator\fP >::_M_base () const\fC [inline]\fP, \fC [noexcept]\fP"

.PP
Definition at line \fB559\fP of file \fBdebug/set\&.h\fP\&.
.SS "template<\fBtypename\fP \fB_Key\fP , \fBtypename\fP _Compare  = std::less<_Key>, \fBtypename\fP \fB_Allocator\fP  = std::allocator<_Key>> \fB_Base\fP & \fBstd::__debug::set\fP< \fB_Key\fP, _Compare, \fB_Allocator\fP >::_M_base ()\fC [inline]\fP, \fC [noexcept]\fP"

.PP
Definition at line \fB556\fP of file \fBdebug/set\&.h\fP\&.
.SS "template<\fBtypename\fP \fB_SafeContainer\fP , \fBtypename\fP _Alloc , \fBtemplate\fP< \fBtypename\fP > \fBclass\fP _SafeBase, bool _IsCxx11AllocatorAware = true> _Safe_container & \fB__gnu_debug::_Safe_container\fP< \fB_SafeContainer\fP, _Alloc, _SafeBase, \fB_IsCxx11AllocatorAware\fP >::_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 "template<\fBtypename\fP \fB_SafeContainer\fP , \fBtypename\fP _Alloc , \fBtemplate\fP< \fBtypename\fP > \fBclass\fP _SafeBase, bool _IsCxx11AllocatorAware = true> \fBvoid\fP \fB__gnu_debug::_Safe_container\fP< \fB_SafeContainer\fP, _Alloc, _SafeBase, \fB_IsCxx11AllocatorAware\fP >::_M_swap (\fB_Safe_container\fP< _SafeContainer, _Alloc, _SafeBase, _IsCxx11AllocatorAware > & __x)\fC [inline]\fP, \fC [noexcept]\fP, \fC [inherited]\fP"

.PP
Definition at line \fB104\fP of file \fBsafe_container\&.h\fP\&.
.SS "template<\fBtypename\fP \fB_Key\fP , \fBtypename\fP _Compare  = std::less<_Key>, \fBtypename\fP \fB_Allocator\fP  = std::allocator<_Key>> \fBconst_iterator\fP \fBstd::__debug::set\fP< \fB_Key\fP, _Compare, \fB_Allocator\fP >::begin () const\fC [inline]\fP, \fC [noexcept]\fP"

.PP
Definition at line \fB175\fP of file \fBdebug/set\&.h\fP\&.
.SS "template<\fBtypename\fP \fB_Key\fP , \fBtypename\fP _Compare  = std::less<_Key>, \fBtypename\fP \fB_Allocator\fP  = std::allocator<_Key>> \fBiterator\fP \fBstd::__debug::set\fP< \fB_Key\fP, _Compare, \fB_Allocator\fP >::begin ()\fC [inline]\fP, \fC [noexcept]\fP"

.PP
Definition at line \fB171\fP of file \fBdebug/set\&.h\fP\&.
.SS "template<\fBtypename\fP \fB_Key\fP , \fBtypename\fP _Compare  = std::less<_Key>, \fBtypename\fP \fB_Allocator\fP  = std::allocator<_Key>> \fBconst_iterator\fP \fBstd::__debug::set\fP< \fB_Key\fP, _Compare, \fB_Allocator\fP >::cbegin () const\fC [inline]\fP, \fC [noexcept]\fP"

.PP
Definition at line \fB204\fP of file \fBdebug/set\&.h\fP\&.
.SS "template<\fBtypename\fP \fB_Key\fP , \fBtypename\fP _Compare  = std::less<_Key>, \fBtypename\fP \fB_Allocator\fP  = std::allocator<_Key>> \fBconst_iterator\fP \fBstd::__debug::set\fP< \fB_Key\fP, _Compare, \fB_Allocator\fP >::cend () const\fC [inline]\fP, \fC [noexcept]\fP"

.PP
Definition at line \fB208\fP of file \fBdebug/set\&.h\fP\&.
.SS "template<\fBtypename\fP \fB_Key\fP , \fBtypename\fP _Compare  = std::less<_Key>, \fBtypename\fP \fB_Allocator\fP  = std::allocator<_Key>> \fBvoid\fP \fBstd::__debug::set\fP< \fB_Key\fP, _Compare, \fB_Allocator\fP >::clear ()\fC [inline]\fP, \fC [noexcept]\fP"

.PP
Definition at line \fB422\fP of file \fBdebug/set\&.h\fP\&.
.SS "template<\fBtypename\fP \fB_Key\fP , \fBtypename\fP _Compare  = std::less<_Key>, \fBtypename\fP \fB_Allocator\fP  = std::allocator<_Key>> \fBconst_reverse_iterator\fP \fBstd::__debug::set\fP< \fB_Key\fP, _Compare, \fB_Allocator\fP >::crbegin () const\fC [inline]\fP, \fC [noexcept]\fP"

.PP
Definition at line \fB212\fP of file \fBdebug/set\&.h\fP\&.
.SS "template<\fBtypename\fP \fB_Key\fP , \fBtypename\fP _Compare  = std::less<_Key>, \fBtypename\fP \fB_Allocator\fP  = std::allocator<_Key>> \fBconst_reverse_iterator\fP \fBstd::__debug::set\fP< \fB_Key\fP, _Compare, \fB_Allocator\fP >::crend () const\fC [inline]\fP, \fC [noexcept]\fP"

.PP
Definition at line \fB216\fP of file \fBdebug/set\&.h\fP\&.
.SS "template<\fBtypename\fP \fB_Key\fP , \fBtypename\fP _Compare  = std::less<_Key>, \fBtypename\fP \fB_Allocator\fP  = std::allocator<_Key>> template<typename\&.\&.\&. _Args> \fBstd::pair\fP< \fBiterator\fP, bool > \fBstd::__debug::set\fP< \fB_Key\fP, _Compare, \fB_Allocator\fP >::emplace (\fB_Args\fP &&\&.\&.\&. __args)\fC [inline]\fP"

.PP
Definition at line \fB229\fP of file \fBdebug/set\&.h\fP\&.
.SS "template<\fBtypename\fP \fB_Key\fP , \fBtypename\fP _Compare  = std::less<_Key>, \fBtypename\fP \fB_Allocator\fP  = std::allocator<_Key>> template<typename\&.\&.\&. _Args> \fBiterator\fP \fBstd::__debug::set\fP< \fB_Key\fP, _Compare, \fB_Allocator\fP >::emplace_hint (\fBconst_iterator\fP __pos, \fB_Args\fP &&\&.\&.\&. __args)\fC [inline]\fP"

.PP
Definition at line \fB237\fP of file \fBdebug/set\&.h\fP\&.
.SS "template<\fBtypename\fP \fB_Key\fP , \fBtypename\fP _Compare  = std::less<_Key>, \fBtypename\fP \fB_Allocator\fP  = std::allocator<_Key>> \fBconst_iterator\fP \fBstd::__debug::set\fP< \fB_Key\fP, _Compare, \fB_Allocator\fP >::end () const\fC [inline]\fP, \fC [noexcept]\fP"

.PP
Definition at line \fB183\fP of file \fBdebug/set\&.h\fP\&.
.SS "template<\fBtypename\fP \fB_Key\fP , \fBtypename\fP _Compare  = std::less<_Key>, \fBtypename\fP \fB_Allocator\fP  = std::allocator<_Key>> \fBiterator\fP \fBstd::__debug::set\fP< \fB_Key\fP, _Compare, \fB_Allocator\fP >::end ()\fC [inline]\fP, \fC [noexcept]\fP"

.PP
Definition at line \fB179\fP of file \fBdebug/set\&.h\fP\&.
.SS "template<\fBtypename\fP \fB_Key\fP , \fBtypename\fP _Compare  = std::less<_Key>, \fBtypename\fP \fB_Allocator\fP  = std::allocator<_Key>> template<\fBtypename\fP \fB_Kt\fP , \fBtypename\fP \fB_Req\fP  = typename __has_is_transparent<_Compare, _Kt>::type> \fBstd::pair\fP< \fBiterator\fP, \fBiterator\fP > \fBstd::__debug::set\fP< \fB_Key\fP, _Compare, \fB_Allocator\fP >::equal_range (\fBconst\fP \fB_Kt\fP & __x)\fC [inline]\fP"

.PP
Definition at line \fB538\fP of file \fBdebug/set\&.h\fP\&.
.SS "template<\fBtypename\fP \fB_Key\fP , \fBtypename\fP _Compare  = std::less<_Key>, \fBtypename\fP \fB_Allocator\fP  = std::allocator<_Key>> template<\fBtypename\fP \fB_Kt\fP , \fBtypename\fP \fB_Req\fP  = typename __has_is_transparent<_Compare, _Kt>::type> \fBstd::pair\fP< \fBconst_iterator\fP, \fBconst_iterator\fP > \fBstd::__debug::set\fP< \fB_Key\fP, _Compare, \fB_Allocator\fP >::equal_range (\fBconst\fP \fB_Kt\fP & __x) const\fC [inline]\fP"

.PP
Definition at line \fB548\fP of file \fBdebug/set\&.h\fP\&.
.SS "template<\fBtypename\fP \fB_Key\fP , \fBtypename\fP _Compare  = std::less<_Key>, \fBtypename\fP \fB_Allocator\fP  = std::allocator<_Key>> \fBstd::pair\fP< \fBiterator\fP, \fBiterator\fP > \fBstd::__debug::set\fP< \fB_Key\fP, _Compare, \fB_Allocator\fP >::equal_range (\fBconst\fP \fBkey_type\fP & __x)\fC [inline]\fP"

.PP
Definition at line \fB514\fP of file \fBdebug/set\&.h\fP\&.
.SS "template<\fBtypename\fP \fB_Key\fP , \fBtypename\fP _Compare  = std::less<_Key>, \fBtypename\fP \fB_Allocator\fP  = std::allocator<_Key>> \fBstd::pair\fP< \fBconst_iterator\fP, \fBconst_iterator\fP > \fBstd::__debug::set\fP< \fB_Key\fP, _Compare, \fB_Allocator\fP >::equal_range (\fBconst\fP \fBkey_type\fP & __x) const\fC [inline]\fP"

.PP
Definition at line \fB525\fP of file \fBdebug/set\&.h\fP\&.
.SS "template<\fBtypename\fP \fB_Key\fP , \fBtypename\fP _Compare  = std::less<_Key>, \fBtypename\fP \fB_Allocator\fP  = std::allocator<_Key>> size_type \fBstd::__debug::set\fP< \fB_Key\fP, _Compare, \fB_Allocator\fP >::erase (\fBconst\fP \fBkey_type\fP & __x)\fC [inline]\fP"

.PP
Definition at line \fB360\fP of file \fBdebug/set\&.h\fP\&.
.SS "template<\fBtypename\fP \fB_Key\fP , \fBtypename\fP _Compare  = std::less<_Key>, \fBtypename\fP \fB_Allocator\fP  = std::allocator<_Key>> _GLIBCXX_ABI_TAG_CXX11 \fBiterator\fP \fBstd::__debug::set\fP< \fB_Key\fP, _Compare, \fB_Allocator\fP >::erase (\fBconst_iterator\fP __first, \fBconst_iterator\fP __last)\fC [inline]\fP"

.PP
Definition at line \fB376\fP of file \fBdebug/set\&.h\fP\&.
.SS "template<\fBtypename\fP \fB_Key\fP , \fBtypename\fP _Compare  = std::less<_Key>, \fBtypename\fP \fB_Allocator\fP  = std::allocator<_Key>> _GLIBCXX_ABI_TAG_CXX11 \fBiterator\fP \fBstd::__debug::set\fP< \fB_Key\fP, _Compare, \fB_Allocator\fP >::erase (\fBconst_iterator\fP __position)\fC [inline]\fP"

.PP
Definition at line \fB343\fP of file \fBdebug/set\&.h\fP\&.
.SS "template<\fBtypename\fP \fB_Key\fP , \fBtypename\fP _Compare  = std::less<_Key>, \fBtypename\fP \fB_Allocator\fP  = std::allocator<_Key>> template<\fBtypename\fP \fB_Kt\fP , \fBtypename\fP \fB_Req\fP  = typename __has_is_transparent<_Compare, _Kt>::type> \fBiterator\fP \fBstd::__debug::set\fP< \fB_Key\fP, _Compare, \fB_Allocator\fP >::find (\fBconst\fP \fB_Kt\fP & __x)\fC [inline]\fP"

.PP
Definition at line \fB448\fP of file \fBdebug/set\&.h\fP\&.
.SS "template<\fBtypename\fP \fB_Key\fP , \fBtypename\fP _Compare  = std::less<_Key>, \fBtypename\fP \fB_Allocator\fP  = std::allocator<_Key>> template<\fBtypename\fP \fB_Kt\fP , \fBtypename\fP \fB_Req\fP  = typename __has_is_transparent<_Compare, _Kt>::type> \fBconst_iterator\fP \fBstd::__debug::set\fP< \fB_Key\fP, _Compare, \fB_Allocator\fP >::find (\fBconst\fP \fB_Kt\fP & __x) const\fC [inline]\fP"

.PP
Definition at line \fB455\fP of file \fBdebug/set\&.h\fP\&.
.SS "template<\fBtypename\fP \fB_Key\fP , \fBtypename\fP _Compare  = std::less<_Key>, \fBtypename\fP \fB_Allocator\fP  = std::allocator<_Key>> \fBiterator\fP \fBstd::__debug::set\fP< \fB_Key\fP, _Compare, \fB_Allocator\fP >::find (\fBconst\fP \fBkey_type\fP & __x)\fC [inline]\fP"

.PP
Definition at line \fB434\fP of file \fBdebug/set\&.h\fP\&.
.SS "template<\fBtypename\fP \fB_Key\fP , \fBtypename\fP _Compare  = std::less<_Key>, \fBtypename\fP \fB_Allocator\fP  = std::allocator<_Key>> \fBconst_iterator\fP \fBstd::__debug::set\fP< \fB_Key\fP, _Compare, \fB_Allocator\fP >::find (\fBconst\fP \fBkey_type\fP & __x) const\fC [inline]\fP"

.PP
Definition at line \fB440\fP of file \fBdebug/set\&.h\fP\&.
.SS "template<\fBtypename\fP \fB_Key\fP , \fBtypename\fP _Compare  = std::less<_Key>, \fBtypename\fP \fB_Allocator\fP  = std::allocator<_Key>> template<\fBtypename\fP \fB_InputIterator\fP > \fBvoid\fP \fBstd::__debug::set\fP< \fB_Key\fP, _Compare, \fB_Allocator\fP >::insert (\fB_InputIterator\fP __first, \fB_InputIterator\fP __last)\fC [inline]\fP"

.PP
Definition at line \fB283\fP of file \fBdebug/set\&.h\fP\&.
.SS "template<\fBtypename\fP \fB_Key\fP , \fBtypename\fP _Compare  = std::less<_Key>, \fBtypename\fP \fB_Allocator\fP  = std::allocator<_Key>> \fBstd::pair\fP< \fBiterator\fP, bool > \fBstd::__debug::set\fP< \fB_Key\fP, _Compare, \fB_Allocator\fP >::insert (\fBconst\fP value_type & __x)\fC [inline]\fP"

.PP
Definition at line \fB249\fP of file \fBdebug/set\&.h\fP\&.
.SS "template<\fBtypename\fP \fB_Key\fP , \fBtypename\fP _Compare  = std::less<_Key>, \fBtypename\fP \fB_Allocator\fP  = std::allocator<_Key>> \fBiterator\fP \fBstd::__debug::set\fP< \fB_Key\fP, _Compare, \fB_Allocator\fP >::insert (\fBconst_iterator\fP __position, \fBconst\fP value_type & __x)\fC [inline]\fP"

.PP
Definition at line \fB266\fP of file \fBdebug/set\&.h\fP\&.
.SS "template<\fBtypename\fP \fB_Key\fP , \fBtypename\fP _Compare  = std::less<_Key>, \fBtypename\fP \fB_Allocator\fP  = std::allocator<_Key>> \fBiterator\fP \fBstd::__debug::set\fP< \fB_Key\fP, _Compare, \fB_Allocator\fP >::insert (\fBconst_iterator\fP __position, value_type && __x)\fC [inline]\fP"

.PP
Definition at line \fB274\fP of file \fBdebug/set\&.h\fP\&.
.SS "template<\fBtypename\fP \fB_Key\fP , \fBtypename\fP _Compare  = std::less<_Key>, \fBtypename\fP \fB_Allocator\fP  = std::allocator<_Key>> \fBvoid\fP \fBstd::__debug::set\fP< \fB_Key\fP, _Compare, \fB_Allocator\fP >::insert (\fBinitializer_list\fP< value_type > __l)\fC [inline]\fP"

.PP
Definition at line \fB297\fP of file \fBdebug/set\&.h\fP\&.
.SS "template<\fBtypename\fP \fB_Key\fP , \fBtypename\fP _Compare  = std::less<_Key>, \fBtypename\fP \fB_Allocator\fP  = std::allocator<_Key>> \fBstd::pair\fP< \fBiterator\fP, bool > \fBstd::__debug::set\fP< \fB_Key\fP, _Compare, \fB_Allocator\fP >::insert (value_type && __x)\fC [inline]\fP"

.PP
Definition at line \fB258\fP of file \fBdebug/set\&.h\fP\&.
.SS "template<\fBtypename\fP \fB_Key\fP , \fBtypename\fP _Compare  = std::less<_Key>, \fBtypename\fP \fB_Allocator\fP  = std::allocator<_Key>> template<\fBtypename\fP \fB_Kt\fP , \fBtypename\fP \fB_Req\fP  = typename __has_is_transparent<_Compare, _Kt>::type> \fBiterator\fP \fBstd::__debug::set\fP< \fB_Key\fP, _Compare, \fB_Allocator\fP >::lower_bound (\fBconst\fP \fB_Kt\fP & __x)\fC [inline]\fP"

.PP
Definition at line \fB476\fP of file \fBdebug/set\&.h\fP\&.
.SS "template<\fBtypename\fP \fB_Key\fP , \fBtypename\fP _Compare  = std::less<_Key>, \fBtypename\fP \fB_Allocator\fP  = std::allocator<_Key>> template<\fBtypename\fP \fB_Kt\fP , \fBtypename\fP \fB_Req\fP  = typename __has_is_transparent<_Compare, _Kt>::type> \fBconst_iterator\fP \fBstd::__debug::set\fP< \fB_Key\fP, _Compare, \fB_Allocator\fP >::lower_bound (\fBconst\fP \fB_Kt\fP & __x) const\fC [inline]\fP"

.PP
Definition at line \fB483\fP of file \fBdebug/set\&.h\fP\&.
.SS "template<\fBtypename\fP \fB_Key\fP , \fBtypename\fP _Compare  = std::less<_Key>, \fBtypename\fP \fB_Allocator\fP  = std::allocator<_Key>> \fBiterator\fP \fBstd::__debug::set\fP< \fB_Key\fP, _Compare, \fB_Allocator\fP >::lower_bound (\fBconst\fP \fBkey_type\fP & __x)\fC [inline]\fP"

.PP
Definition at line \fB462\fP of file \fBdebug/set\&.h\fP\&.
.SS "template<\fBtypename\fP \fB_Key\fP , \fBtypename\fP _Compare  = std::less<_Key>, \fBtypename\fP \fB_Allocator\fP  = std::allocator<_Key>> \fBconst_iterator\fP \fBstd::__debug::set\fP< \fB_Key\fP, _Compare, \fB_Allocator\fP >::lower_bound (\fBconst\fP \fBkey_type\fP & __x) const\fC [inline]\fP"

.PP
Definition at line \fB468\fP of file \fBdebug/set\&.h\fP\&.
.SS "template<\fBtypename\fP \fB_Key\fP , \fBtypename\fP _Compare  = std::less<_Key>, \fBtypename\fP \fB_Allocator\fP  = std::allocator<_Key>> \fBset\fP & \fBstd::__debug::set\fP< \fB_Key\fP, _Compare, \fB_Allocator\fP >::operator= (\fBinitializer_list\fP< value_type > __l)\fC [inline]\fP"

.PP
Definition at line \fB159\fP of file \fBdebug/set\&.h\fP\&.
.SS "template<\fBtypename\fP \fB_Key\fP , \fBtypename\fP _Compare  = std::less<_Key>, \fBtypename\fP \fB_Allocator\fP  = std::allocator<_Key>> \fBconst_reverse_iterator\fP \fBstd::__debug::set\fP< \fB_Key\fP, _Compare, \fB_Allocator\fP >::rbegin () const\fC [inline]\fP, \fC [noexcept]\fP"

.PP
Definition at line \fB191\fP of file \fBdebug/set\&.h\fP\&.
.SS "template<\fBtypename\fP \fB_Key\fP , \fBtypename\fP _Compare  = std::less<_Key>, \fBtypename\fP \fB_Allocator\fP  = std::allocator<_Key>> \fBreverse_iterator\fP \fBstd::__debug::set\fP< \fB_Key\fP, _Compare, \fB_Allocator\fP >::rbegin ()\fC [inline]\fP, \fC [noexcept]\fP"

.PP
Definition at line \fB187\fP of file \fBdebug/set\&.h\fP\&.
.SS "template<\fBtypename\fP \fB_Key\fP , \fBtypename\fP _Compare  = std::less<_Key>, \fBtypename\fP \fB_Allocator\fP  = std::allocator<_Key>> \fBconst_reverse_iterator\fP \fBstd::__debug::set\fP< \fB_Key\fP, _Compare, \fB_Allocator\fP >::rend () const\fC [inline]\fP, \fC [noexcept]\fP"

.PP
Definition at line \fB199\fP of file \fBdebug/set\&.h\fP\&.
.SS "template<\fBtypename\fP \fB_Key\fP , \fBtypename\fP _Compare  = std::less<_Key>, \fBtypename\fP \fB_Allocator\fP  = std::allocator<_Key>> \fBreverse_iterator\fP \fBstd::__debug::set\fP< \fB_Key\fP, _Compare, \fB_Allocator\fP >::rend ()\fC [inline]\fP, \fC [noexcept]\fP"

.PP
Definition at line \fB195\fP of file \fBdebug/set\&.h\fP\&.
.SS "template<\fBtypename\fP \fB_Key\fP , \fBtypename\fP _Compare  = std::less<_Key>, \fBtypename\fP \fB_Allocator\fP  = std::allocator<_Key>> \fBvoid\fP \fBstd::__debug::set\fP< \fB_Key\fP, _Compare, \fB_Allocator\fP >::swap (\fBset\fP< \fB_Key\fP, _Compare, \fB_Allocator\fP > & __x)\fC [inline]\fP, \fC [noexcept]\fP"

.PP
Definition at line \fB414\fP of file \fBdebug/set\&.h\fP\&.
.SS "template<\fBtypename\fP \fB_Key\fP , \fBtypename\fP _Compare  = std::less<_Key>, \fBtypename\fP \fB_Allocator\fP  = std::allocator<_Key>> template<\fBtypename\fP \fB_Kt\fP , \fBtypename\fP \fB_Req\fP  = typename __has_is_transparent<_Compare, _Kt>::type> \fBiterator\fP \fBstd::__debug::set\fP< \fB_Key\fP, _Compare, \fB_Allocator\fP >::upper_bound (\fBconst\fP \fB_Kt\fP & __x)\fC [inline]\fP"

.PP
Definition at line \fB502\fP of file \fBdebug/set\&.h\fP\&.
.SS "template<\fBtypename\fP \fB_Key\fP , \fBtypename\fP _Compare  = std::less<_Key>, \fBtypename\fP \fB_Allocator\fP  = std::allocator<_Key>> template<\fBtypename\fP \fB_Kt\fP , \fBtypename\fP \fB_Req\fP  = typename __has_is_transparent<_Compare, _Kt>::type> \fBconst_iterator\fP \fBstd::__debug::set\fP< \fB_Key\fP, _Compare, \fB_Allocator\fP >::upper_bound (\fBconst\fP \fB_Kt\fP & __x) const\fC [inline]\fP"

.PP
Definition at line \fB509\fP of file \fBdebug/set\&.h\fP\&.
.SS "template<\fBtypename\fP \fB_Key\fP , \fBtypename\fP _Compare  = std::less<_Key>, \fBtypename\fP \fB_Allocator\fP  = std::allocator<_Key>> \fBiterator\fP \fBstd::__debug::set\fP< \fB_Key\fP, _Compare, \fB_Allocator\fP >::upper_bound (\fBconst\fP \fBkey_type\fP & __x)\fC [inline]\fP"

.PP
Definition at line \fB488\fP of file \fBdebug/set\&.h\fP\&.
.SS "template<\fBtypename\fP \fB_Key\fP , \fBtypename\fP _Compare  = std::less<_Key>, \fBtypename\fP \fB_Allocator\fP  = std::allocator<_Key>> \fBconst_iterator\fP \fBstd::__debug::set\fP< \fB_Key\fP, _Compare, \fB_Allocator\fP >::upper_bound (\fBconst\fP \fBkey_type\fP & __x) const\fC [inline]\fP"

.PP
Definition at line \fB494\fP of file \fBdebug/set\&.h\fP\&.
.SH "Friends And Related Symbol Documentation"
.PP 
.SS "template<\fBtypename\fP \fB_Key\fP , \fBtypename\fP _Compare  = std::less<_Key>, \fBtypename\fP \fB_Allocator\fP  = std::allocator<_Key>> template<\fBtypename\fP \fB_ItT\fP , \fBtypename\fP \fB_SeqT\fP , \fBtypename\fP \fB_CatT\fP > friend \fBclass\fP \fB::__gnu_debug::_Safe_iterator\fP\fC [friend]\fP"

.PP
Definition at line \fB59\fP of file \fBdebug/set\&.h\fP\&.

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