.TH "std::__debug" 3cxx "libstdc++" \" -*- nroff -*-
.ad l
.nh
.SH NAME
std::__debug \- GNU debug code, replaces standard behavior with debug behavior\&.  

.SH SYNOPSIS
.br
.PP
.SS "Classes"

.in +1c
.ti -1c
.RI "class \fBbitset\fP"
.br
.RI "Class std::bitset with additional safety/checking/debug instrumentation\&. "
.ti -1c
.RI "class \fBdeque\fP"
.br
.RI "Class std::deque with safety/checking/debug instrumentation\&. "
.ti -1c
.RI "class \fBforward_list\fP"
.br
.RI "Class std::forward_list with safety/checking/debug instrumentation\&. "
.ti -1c
.RI "class \fBlist\fP"
.br
.RI "Class std::list with safety/checking/debug instrumentation\&. "
.ti -1c
.RI "class \fBmap\fP"
.br
.RI "Class std::map with safety/checking/debug instrumentation\&. "
.ti -1c
.RI "class \fBmultimap\fP"
.br
.RI "Class std::multimap with safety/checking/debug instrumentation\&. "
.ti -1c
.RI "class \fBmultiset\fP"
.br
.RI "Class std::multiset with safety/checking/debug instrumentation\&. "
.ti -1c
.RI "class \fBset\fP"
.br
.RI "Class std::set with safety/checking/debug instrumentation\&. "
.ti -1c
.RI "class \fBunordered_map\fP"
.br
.RI "Class std::unordered_map with safety/checking/debug instrumentation\&. "
.ti -1c
.RI "class \fBunordered_multimap\fP"
.br
.RI "Class std::unordered_multimap with safety/checking/debug instrumentation\&. "
.ti -1c
.RI "class \fBunordered_multiset\fP"
.br
.RI "Class std::unordered_multiset with safety/checking/debug instrumentation\&. "
.ti -1c
.RI "class \fBunordered_set\fP"
.br
.RI "Class std::unordered_set with safety/checking/debug instrumentation\&. "
.ti -1c
.RI "class \fBvector\fP"
.br
.RI "Class std::vector with safety/checking/debug instrumentation\&. "
.in -1c
.SS "Functions"

.in +1c
.ti -1c
.RI "template<\fBtypename\fP \fB_InputIterator\fP , \fBtypename\fP \fB_ValT\fP  = typename iterator_traits<_InputIterator>::value_type, \fBtypename\fP \fB_Allocator\fP  = allocator<_ValT>, \fBtypename\fP  = _RequireInputIter<_InputIterator>, \fBtypename\fP  = _RequireAllocator<_Allocator>> \fBdeque\fP (\fB_InputIterator\fP, \fB_InputIterator\fP, \fB_Allocator\fP=\fB_Allocator\fP()) \-> \fBdeque\fP< \fB_ValT\fP, \fB_Allocator\fP >"
.br
.ti -1c
.RI "template<\fBtypename\fP _Tp , \fBtypename\fP \fB_Allocator\fP  = allocator<_Tp>, \fBtypename\fP  = _RequireAllocator<_Allocator>> \fBdeque\fP (size_t, _Tp, \fB_Allocator\fP=\fB_Allocator\fP()) \-> \fBdeque\fP< _Tp, \fB_Allocator\fP >"
.br
.ti -1c
.RI "template<\fBtypename\fP \fB_InputIterator\fP , \fBtypename\fP \fB_ValT\fP  = typename iterator_traits<_InputIterator>::value_type, \fBtypename\fP \fB_Allocator\fP  = allocator<_ValT>, \fBtypename\fP  = _RequireInputIter<_InputIterator>, \fBtypename\fP  = _RequireAllocator<_Allocator>> \fBforward_list\fP (\fB_InputIterator\fP, \fB_InputIterator\fP, \fB_Allocator\fP=\fB_Allocator\fP()) \-> \fBforward_list\fP< \fB_ValT\fP, \fB_Allocator\fP >"
.br
.ti -1c
.RI "template<\fBtypename\fP _Tp , \fBtypename\fP \fB_Allocator\fP  = allocator<_Tp>, \fBtypename\fP  = _RequireAllocator<_Allocator>> \fBforward_list\fP (size_t, _Tp, \fB_Allocator\fP=\fB_Allocator\fP()) \-> \fBforward_list\fP< _Tp, \fB_Allocator\fP >"
.br
.ti -1c
.RI "template<\fBtypename\fP \fB_InputIterator\fP , \fBtypename\fP \fB_ValT\fP  = typename iterator_traits<_InputIterator>::value_type, \fBtypename\fP \fB_Allocator\fP  = allocator<_ValT>, \fBtypename\fP  = _RequireInputIter<_InputIterator>, \fBtypename\fP  = _RequireAllocator<_Allocator>> \fBlist\fP (\fB_InputIterator\fP, \fB_InputIterator\fP, \fB_Allocator\fP=\fB_Allocator\fP()) \-> \fBlist\fP< \fB_ValT\fP, \fB_Allocator\fP >"
.br
.ti -1c
.RI "template<\fBtypename\fP _Tp , \fBtypename\fP \fB_Allocator\fP  = allocator<_Tp>, \fBtypename\fP  = _RequireAllocator<_Allocator>> \fBlist\fP (size_t, _Tp, \fB_Allocator\fP=\fB_Allocator\fP()) \-> \fBlist\fP< _Tp, \fB_Allocator\fP >"
.br
.ti -1c
.RI "template<\fBtypename\fP \fB_InputIterator\fP , \fBtypename\fP \fB_Allocator\fP , \fBtypename\fP  = _RequireInputIter<_InputIterator>, \fBtypename\fP  = _RequireAllocator<_Allocator>> \fBmap\fP (\fB_InputIterator\fP, \fB_InputIterator\fP, \fB_Allocator\fP) \-> \fBmap\fP< \fB__iter_key_t\fP< \fB_InputIterator\fP >, __iter_val_t< \fB_InputIterator\fP >, \fBless\fP< \fB__iter_key_t\fP< \fB_InputIterator\fP > >, \fB_Allocator\fP >"
.br
.ti -1c
.RI "template<\fBtypename\fP \fB_InputIterator\fP , \fBtypename\fP _Compare  = less<__iter_key_t<_InputIterator>>, \fBtypename\fP \fB_Allocator\fP  = allocator<__iter_to_alloc_t<_InputIterator>>, \fBtypename\fP  = _RequireInputIter<_InputIterator>, \fBtypename\fP  = _RequireNotAllocator<_Compare>, \fBtypename\fP  = _RequireAllocator<_Allocator>> \fBmap\fP (\fB_InputIterator\fP, \fB_InputIterator\fP, _Compare=_Compare(), \fB_Allocator\fP=\fB_Allocator\fP()) \-> \fBmap\fP< \fB__iter_key_t\fP< \fB_InputIterator\fP >, __iter_val_t< \fB_InputIterator\fP >, _Compare, \fB_Allocator\fP >"
.br
.ti -1c
.RI "template<\fBtypename\fP \fB_Key\fP , \fBtypename\fP _Tp , \fBtypename\fP \fB_Allocator\fP , \fBtypename\fP  = _RequireAllocator<_Allocator>> \fBmap\fP (\fBinitializer_list\fP< \fBpair\fP< \fB_Key\fP, _Tp > >, \fB_Allocator\fP) \-> \fBmap\fP< \fB_Key\fP, _Tp, \fBless\fP< \fB_Key\fP >, \fB_Allocator\fP >"
.br
.ti -1c
.RI "template<\fBtypename\fP \fB_Key\fP , \fBtypename\fP _Tp , \fBtypename\fP _Compare  = less<_Key>, \fBtypename\fP \fB_Allocator\fP  = allocator<pair<const _Key, _Tp>>, \fBtypename\fP  = _RequireNotAllocator<_Compare>, \fBtypename\fP  = _RequireAllocator<_Allocator>> \fBmap\fP (\fBinitializer_list\fP< \fBpair\fP< \fB_Key\fP, _Tp > >, _Compare=_Compare(), \fB_Allocator\fP=\fB_Allocator\fP()) \-> \fBmap\fP< \fB_Key\fP, _Tp, _Compare, \fB_Allocator\fP >"
.br
.ti -1c
.RI "template<\fBtypename\fP \fB_InputIterator\fP , \fBtypename\fP \fB_Allocator\fP , \fBtypename\fP  = _RequireInputIter<_InputIterator>, \fBtypename\fP  = _RequireAllocator<_Allocator>> \fBmultimap\fP (\fB_InputIterator\fP, \fB_InputIterator\fP, \fB_Allocator\fP) \-> \fBmultimap\fP< \fB__iter_key_t\fP< \fB_InputIterator\fP >, __iter_val_t< \fB_InputIterator\fP >, \fBless\fP< \fB__iter_key_t\fP< \fB_InputIterator\fP > >, \fB_Allocator\fP >"
.br
.ti -1c
.RI "template<\fBtypename\fP \fB_InputIterator\fP , \fBtypename\fP _Compare  = less<__iter_key_t<_InputIterator>>, \fBtypename\fP \fB_Allocator\fP  = allocator<__iter_to_alloc_t<_InputIterator>>, \fBtypename\fP  = _RequireInputIter<_InputIterator>, \fBtypename\fP  = _RequireNotAllocator<_Compare>, \fBtypename\fP  = _RequireAllocator<_Allocator>> \fBmultimap\fP (\fB_InputIterator\fP, \fB_InputIterator\fP, _Compare=_Compare(), \fB_Allocator\fP=\fB_Allocator\fP()) \-> \fBmultimap\fP< \fB__iter_key_t\fP< \fB_InputIterator\fP >, __iter_val_t< \fB_InputIterator\fP >, _Compare, \fB_Allocator\fP >"
.br
.ti -1c
.RI "template<\fBtypename\fP \fB_Key\fP , \fBtypename\fP _Tp , \fBtypename\fP \fB_Allocator\fP , \fBtypename\fP  = _RequireAllocator<_Allocator>> \fBmultimap\fP (\fBinitializer_list\fP< \fBpair\fP< \fB_Key\fP, _Tp > >, \fB_Allocator\fP) \-> \fBmultimap\fP< \fB_Key\fP, _Tp, \fBless\fP< \fB_Key\fP >, \fB_Allocator\fP >"
.br
.ti -1c
.RI "template<\fBtypename\fP \fB_Key\fP , \fBtypename\fP _Tp , \fBtypename\fP _Compare  = less<_Key>, \fBtypename\fP \fB_Allocator\fP  = allocator<pair<const _Key, _Tp>>, \fBtypename\fP  = _RequireNotAllocator<_Compare>, \fBtypename\fP  = _RequireAllocator<_Allocator>> \fBmultimap\fP (\fBinitializer_list\fP< \fBpair\fP< \fB_Key\fP, _Tp > >, _Compare=_Compare(), \fB_Allocator\fP=\fB_Allocator\fP()) \-> \fBmultimap\fP< \fB_Key\fP, _Tp, _Compare, \fB_Allocator\fP >"
.br
.ti -1c
.RI "template<\fBtypename\fP \fB_InputIterator\fP , \fBtypename\fP \fB_Allocator\fP , \fBtypename\fP  = _RequireInputIter<_InputIterator>, \fBtypename\fP  = _RequireAllocator<_Allocator>> \fBmultiset\fP (\fB_InputIterator\fP, \fB_InputIterator\fP, \fB_Allocator\fP) \-> \fBmultiset\fP< \fBtypename\fP \fBiterator_traits\fP< \fB_InputIterator\fP >::value_type, \fBless\fP< \fBtypename\fP \fBiterator_traits\fP< \fB_InputIterator\fP >::value_type >, \fB_Allocator\fP >"
.br
.ti -1c
.RI "template<\fBtypename\fP \fB_InputIterator\fP , \fBtypename\fP _Compare  = less<typename iterator_traits<_InputIterator>::value_type>, \fBtypename\fP \fB_Allocator\fP  = allocator<typename iterator_traits<_InputIterator>::value_type>, \fBtypename\fP  = _RequireInputIter<_InputIterator>, \fBtypename\fP  = _RequireNotAllocator<_Compare>, \fBtypename\fP  = _RequireAllocator<_Allocator>> \fBmultiset\fP (\fB_InputIterator\fP, \fB_InputIterator\fP, _Compare=_Compare(), \fB_Allocator\fP=\fB_Allocator\fP()) \-> \fBmultiset\fP< \fBtypename\fP \fBiterator_traits\fP< \fB_InputIterator\fP >::value_type, _Compare, \fB_Allocator\fP >"
.br
.ti -1c
.RI "template<\fBtypename\fP \fB_Key\fP , \fBtypename\fP \fB_Allocator\fP , \fBtypename\fP  = _RequireAllocator<_Allocator>> \fBmultiset\fP (\fBinitializer_list\fP< \fB_Key\fP >, \fB_Allocator\fP) \-> \fBmultiset\fP< \fB_Key\fP, \fBless\fP< \fB_Key\fP >, \fB_Allocator\fP >"
.br
.ti -1c
.RI "template<\fBtypename\fP \fB_Key\fP , \fBtypename\fP _Compare  = less<_Key>, \fBtypename\fP \fB_Allocator\fP  = allocator<_Key>, \fBtypename\fP  = _RequireNotAllocator<_Compare>, \fBtypename\fP  = _RequireAllocator<_Allocator>> \fBmultiset\fP (\fBinitializer_list\fP< \fB_Key\fP >, _Compare=_Compare(), \fB_Allocator\fP=\fB_Allocator\fP()) \-> \fBmultiset\fP< \fB_Key\fP, _Compare, \fB_Allocator\fP >"
.br
.ti -1c
.RI "template<\fBtypename\fP _Tp , \fBtypename\fP _Alloc > bool \fBoperator!=\fP (const \fBdeque\fP< _Tp, _Alloc > &\fB__lhs\fP, const \fBdeque\fP< _Tp, _Alloc > &\fB__rhs\fP)"
.br
.ti -1c
.RI "template<\fBtypename\fP _Tp , \fBtypename\fP _Alloc > bool \fBoperator!=\fP (const \fBforward_list\fP< _Tp, _Alloc > &\fB__lx\fP, const \fBforward_list\fP< _Tp, _Alloc > &\fB__ly\fP)"
.br
.ti -1c
.RI "template<\fBtypename\fP _Tp , \fBtypename\fP _Alloc > bool \fBoperator!=\fP (const \fBlist\fP< _Tp, _Alloc > &\fB__lhs\fP, const \fBlist\fP< _Tp, _Alloc > &\fB__rhs\fP)"
.br
.ti -1c
.RI "template<\fBtypename\fP \fB_Key\fP , \fBtypename\fP _Tp , \fBtypename\fP _Compare , \fBtypename\fP \fB_Allocator\fP > bool \fBoperator!=\fP (const \fBmap\fP< \fB_Key\fP, _Tp, _Compare, \fB_Allocator\fP > &\fB__lhs\fP, const \fBmap\fP< \fB_Key\fP, _Tp, _Compare, \fB_Allocator\fP > &\fB__rhs\fP)"
.br
.ti -1c
.RI "template<\fBtypename\fP \fB_Key\fP , \fBtypename\fP _Tp , \fBtypename\fP _Compare , \fBtypename\fP \fB_Allocator\fP > bool \fBoperator!=\fP (const \fBmultimap\fP< \fB_Key\fP, _Tp, _Compare, \fB_Allocator\fP > &\fB__lhs\fP, const \fBmultimap\fP< \fB_Key\fP, _Tp, _Compare, \fB_Allocator\fP > &\fB__rhs\fP)"
.br
.ti -1c
.RI "template<\fBtypename\fP \fB_Key\fP , \fBtypename\fP _Compare , \fBtypename\fP \fB_Allocator\fP > bool \fBoperator!=\fP (const \fBmultiset\fP< \fB_Key\fP, _Compare, \fB_Allocator\fP > &\fB__lhs\fP, const \fBmultiset\fP< \fB_Key\fP, _Compare, \fB_Allocator\fP > &\fB__rhs\fP)"
.br
.ti -1c
.RI "template<\fBtypename\fP \fB_Key\fP , \fBtypename\fP _Compare , \fBtypename\fP \fB_Allocator\fP > bool \fBoperator!=\fP (const \fBset\fP< \fB_Key\fP, _Compare, \fB_Allocator\fP > &\fB__lhs\fP, const \fBset\fP< \fB_Key\fP, _Compare, \fB_Allocator\fP > &\fB__rhs\fP)"
.br
.ti -1c
.RI "template<\fBtypename\fP _Tp , \fBtypename\fP _Alloc > bool \fBoperator!=\fP (const \fBvector\fP< _Tp, _Alloc > &\fB__lhs\fP, const \fBvector\fP< _Tp, _Alloc > &\fB__rhs\fP)"
.br
.ti -1c
.RI "template<size_t _Nb> \fBbitset\fP< \fB_Nb\fP > \fBoperator&\fP (const \fBbitset\fP< \fB_Nb\fP > &__x, const \fBbitset\fP< \fB_Nb\fP > &\fB__y\fP) noexcept"
.br
.ti -1c
.RI "template<\fBtypename\fP _Tp , \fBtypename\fP _Alloc > bool \fBoperator<\fP (const \fBdeque\fP< _Tp, _Alloc > &\fB__lhs\fP, const \fBdeque\fP< _Tp, _Alloc > &\fB__rhs\fP)"
.br
.ti -1c
.RI "template<\fBtypename\fP _Tp , \fBtypename\fP _Alloc > bool \fBoperator<\fP (const \fBforward_list\fP< _Tp, _Alloc > &\fB__lx\fP, const \fBforward_list\fP< _Tp, _Alloc > &\fB__ly\fP)"
.br
.ti -1c
.RI "template<\fBtypename\fP _Tp , \fBtypename\fP _Alloc > bool \fBoperator<\fP (const \fBlist\fP< _Tp, _Alloc > &\fB__lhs\fP, const \fBlist\fP< _Tp, _Alloc > &\fB__rhs\fP)"
.br
.ti -1c
.RI "template<\fBtypename\fP \fB_Key\fP , \fBtypename\fP _Tp , \fBtypename\fP _Compare , \fBtypename\fP \fB_Allocator\fP > bool \fBoperator<\fP (const \fBmap\fP< \fB_Key\fP, _Tp, _Compare, \fB_Allocator\fP > &\fB__lhs\fP, const \fBmap\fP< \fB_Key\fP, _Tp, _Compare, \fB_Allocator\fP > &\fB__rhs\fP)"
.br
.ti -1c
.RI "template<\fBtypename\fP \fB_Key\fP , \fBtypename\fP _Tp , \fBtypename\fP _Compare , \fBtypename\fP \fB_Allocator\fP > bool \fBoperator<\fP (const \fBmultimap\fP< \fB_Key\fP, _Tp, _Compare, \fB_Allocator\fP > &\fB__lhs\fP, const \fBmultimap\fP< \fB_Key\fP, _Tp, _Compare, \fB_Allocator\fP > &\fB__rhs\fP)"
.br
.ti -1c
.RI "template<\fBtypename\fP \fB_Key\fP , \fBtypename\fP _Compare , \fBtypename\fP \fB_Allocator\fP > bool \fBoperator<\fP (const \fBmultiset\fP< \fB_Key\fP, _Compare, \fB_Allocator\fP > &\fB__lhs\fP, const \fBmultiset\fP< \fB_Key\fP, _Compare, \fB_Allocator\fP > &\fB__rhs\fP)"
.br
.ti -1c
.RI "template<\fBtypename\fP \fB_Key\fP , \fBtypename\fP _Compare , \fBtypename\fP \fB_Allocator\fP > bool \fBoperator<\fP (const \fBset\fP< \fB_Key\fP, _Compare, \fB_Allocator\fP > &\fB__lhs\fP, const \fBset\fP< \fB_Key\fP, _Compare, \fB_Allocator\fP > &\fB__rhs\fP)"
.br
.ti -1c
.RI "template<\fBtypename\fP _Tp , \fBtypename\fP _Alloc > bool \fBoperator<\fP (const \fBvector\fP< _Tp, _Alloc > &\fB__lhs\fP, const \fBvector\fP< _Tp, _Alloc > &\fB__rhs\fP)"
.br
.ti -1c
.RI "template<\fBtypename\fP _CharT , \fBtypename\fP _Traits , size_t _Nb> \fBstd::basic_ostream\fP< _CharT, _Traits > & \fBoperator<<\fP (\fBstd::basic_ostream\fP< _CharT, _Traits > &\fB__os\fP, const \fBbitset\fP< \fB_Nb\fP > &__x)"
.br
.ti -1c
.RI "template<\fBtypename\fP _Tp , \fBtypename\fP _Alloc > bool \fBoperator<=\fP (const \fBdeque\fP< _Tp, _Alloc > &\fB__lhs\fP, const \fBdeque\fP< _Tp, _Alloc > &\fB__rhs\fP)"
.br
.ti -1c
.RI "template<\fBtypename\fP _Tp , \fBtypename\fP _Alloc > bool \fBoperator<=\fP (const \fBforward_list\fP< _Tp, _Alloc > &\fB__lx\fP, const \fBforward_list\fP< _Tp, _Alloc > &\fB__ly\fP)"
.br
.RI "Based on operator<\&. "
.ti -1c
.RI "template<\fBtypename\fP _Tp , \fBtypename\fP _Alloc > bool \fBoperator<=\fP (const \fBlist\fP< _Tp, _Alloc > &\fB__lhs\fP, const \fBlist\fP< _Tp, _Alloc > &\fB__rhs\fP)"
.br
.ti -1c
.RI "template<\fBtypename\fP \fB_Key\fP , \fBtypename\fP _Tp , \fBtypename\fP _Compare , \fBtypename\fP \fB_Allocator\fP > bool \fBoperator<=\fP (const \fBmap\fP< \fB_Key\fP, _Tp, _Compare, \fB_Allocator\fP > &\fB__lhs\fP, const \fBmap\fP< \fB_Key\fP, _Tp, _Compare, \fB_Allocator\fP > &\fB__rhs\fP)"
.br
.ti -1c
.RI "template<\fBtypename\fP \fB_Key\fP , \fBtypename\fP _Tp , \fBtypename\fP _Compare , \fBtypename\fP \fB_Allocator\fP > bool \fBoperator<=\fP (const \fBmultimap\fP< \fB_Key\fP, _Tp, _Compare, \fB_Allocator\fP > &\fB__lhs\fP, const \fBmultimap\fP< \fB_Key\fP, _Tp, _Compare, \fB_Allocator\fP > &\fB__rhs\fP)"
.br
.ti -1c
.RI "template<\fBtypename\fP \fB_Key\fP , \fBtypename\fP _Compare , \fBtypename\fP \fB_Allocator\fP > bool \fBoperator<=\fP (const \fBmultiset\fP< \fB_Key\fP, _Compare, \fB_Allocator\fP > &\fB__lhs\fP, const \fBmultiset\fP< \fB_Key\fP, _Compare, \fB_Allocator\fP > &\fB__rhs\fP)"
.br
.ti -1c
.RI "template<\fBtypename\fP \fB_Key\fP , \fBtypename\fP _Compare , \fBtypename\fP \fB_Allocator\fP > bool \fBoperator<=\fP (const \fBset\fP< \fB_Key\fP, _Compare, \fB_Allocator\fP > &\fB__lhs\fP, const \fBset\fP< \fB_Key\fP, _Compare, \fB_Allocator\fP > &\fB__rhs\fP)"
.br
.ti -1c
.RI "template<\fBtypename\fP _Tp , \fBtypename\fP _Alloc > bool \fBoperator<=\fP (const \fBvector\fP< _Tp, _Alloc > &\fB__lhs\fP, const \fBvector\fP< _Tp, _Alloc > &\fB__rhs\fP)"
.br
.ti -1c
.RI "template<\fBtypename\fP _Tp , \fBtypename\fP _Alloc > bool \fBoperator==\fP (const \fBdeque\fP< _Tp, _Alloc > &\fB__lhs\fP, const \fBdeque\fP< _Tp, _Alloc > &\fB__rhs\fP)"
.br
.ti -1c
.RI "template<\fBtypename\fP _Tp , \fBtypename\fP _Alloc > bool \fBoperator==\fP (const \fBforward_list\fP< _Tp, _Alloc > &\fB__lx\fP, const \fBforward_list\fP< _Tp, _Alloc > &\fB__ly\fP)"
.br
.ti -1c
.RI "template<\fBtypename\fP _Tp , \fBtypename\fP _Alloc > bool \fBoperator==\fP (const \fBlist\fP< _Tp, _Alloc > &\fB__lhs\fP, const \fBlist\fP< _Tp, _Alloc > &\fB__rhs\fP)"
.br
.ti -1c
.RI "template<\fBtypename\fP \fB_Key\fP , \fBtypename\fP _Tp , \fBtypename\fP _Compare , \fBtypename\fP \fB_Allocator\fP > bool \fBoperator==\fP (const \fBmap\fP< \fB_Key\fP, _Tp, _Compare, \fB_Allocator\fP > &\fB__lhs\fP, const \fBmap\fP< \fB_Key\fP, _Tp, _Compare, \fB_Allocator\fP > &\fB__rhs\fP)"
.br
.ti -1c
.RI "template<\fBtypename\fP \fB_Key\fP , \fBtypename\fP _Tp , \fBtypename\fP _Compare , \fBtypename\fP \fB_Allocator\fP > bool \fBoperator==\fP (const \fBmultimap\fP< \fB_Key\fP, _Tp, _Compare, \fB_Allocator\fP > &\fB__lhs\fP, const \fBmultimap\fP< \fB_Key\fP, _Tp, _Compare, \fB_Allocator\fP > &\fB__rhs\fP)"
.br
.ti -1c
.RI "template<\fBtypename\fP \fB_Key\fP , \fBtypename\fP _Compare , \fBtypename\fP \fB_Allocator\fP > bool \fBoperator==\fP (const \fBmultiset\fP< \fB_Key\fP, _Compare, \fB_Allocator\fP > &\fB__lhs\fP, const \fBmultiset\fP< \fB_Key\fP, _Compare, \fB_Allocator\fP > &\fB__rhs\fP)"
.br
.ti -1c
.RI "template<\fBtypename\fP \fB_Key\fP , \fBtypename\fP _Compare , \fBtypename\fP \fB_Allocator\fP > bool \fBoperator==\fP (const \fBset\fP< \fB_Key\fP, _Compare, \fB_Allocator\fP > &\fB__lhs\fP, const \fBset\fP< \fB_Key\fP, _Compare, \fB_Allocator\fP > &\fB__rhs\fP)"
.br
.ti -1c
.RI "template<\fBtypename\fP \fB_Key\fP , \fBtypename\fP _Tp , \fBtypename\fP \fB_Hash\fP , \fBtypename\fP \fB_Pred\fP , \fBtypename\fP _Alloc > bool \fBoperator==\fP (const \fBunordered_map\fP< \fB_Key\fP, _Tp, \fB_Hash\fP, \fB_Pred\fP, _Alloc > &__x, const \fBunordered_map\fP< \fB_Key\fP, _Tp, \fB_Hash\fP, \fB_Pred\fP, _Alloc > &\fB__y\fP)"
.br
.ti -1c
.RI "template<\fBtypename\fP \fB_Key\fP , \fBtypename\fP _Tp , \fBtypename\fP \fB_Hash\fP , \fBtypename\fP \fB_Pred\fP , \fBtypename\fP _Alloc > bool \fBoperator==\fP (const \fBunordered_multimap\fP< \fB_Key\fP, _Tp, \fB_Hash\fP, \fB_Pred\fP, _Alloc > &__x, const \fBunordered_multimap\fP< \fB_Key\fP, _Tp, \fB_Hash\fP, \fB_Pred\fP, _Alloc > &\fB__y\fP)"
.br
.ti -1c
.RI "template<\fBtypename\fP _Value , \fBtypename\fP \fB_Hash\fP , \fBtypename\fP \fB_Pred\fP , \fBtypename\fP _Alloc > bool \fBoperator==\fP (const \fBunordered_multiset\fP< _Value, \fB_Hash\fP, \fB_Pred\fP, _Alloc > &__x, const \fBunordered_multiset\fP< _Value, \fB_Hash\fP, \fB_Pred\fP, _Alloc > &\fB__y\fP)"
.br
.ti -1c
.RI "template<\fBtypename\fP _Value , \fBtypename\fP \fB_Hash\fP , \fBtypename\fP \fB_Pred\fP , \fBtypename\fP _Alloc > bool \fBoperator==\fP (const \fBunordered_set\fP< _Value, \fB_Hash\fP, \fB_Pred\fP, _Alloc > &__x, const \fBunordered_set\fP< _Value, \fB_Hash\fP, \fB_Pred\fP, _Alloc > &\fB__y\fP)"
.br
.ti -1c
.RI "template<\fBtypename\fP _Tp , \fBtypename\fP _Alloc > bool \fBoperator==\fP (const \fBvector\fP< _Tp, _Alloc > &\fB__lhs\fP, const \fBvector\fP< _Tp, _Alloc > &\fB__rhs\fP)"
.br
.ti -1c
.RI "template<\fBtypename\fP _Tp , \fBtypename\fP _Alloc > bool \fBoperator>\fP (const \fBdeque\fP< _Tp, _Alloc > &\fB__lhs\fP, const \fBdeque\fP< _Tp, _Alloc > &\fB__rhs\fP)"
.br
.ti -1c
.RI "template<\fBtypename\fP _Tp , \fBtypename\fP _Alloc > bool \fBoperator>\fP (const \fBforward_list\fP< _Tp, _Alloc > &\fB__lx\fP, const \fBforward_list\fP< _Tp, _Alloc > &\fB__ly\fP)"
.br
.RI "Based on operator<\&. "
.ti -1c
.RI "template<\fBtypename\fP _Tp , \fBtypename\fP _Alloc > bool \fBoperator>\fP (const \fBlist\fP< _Tp, _Alloc > &\fB__lhs\fP, const \fBlist\fP< _Tp, _Alloc > &\fB__rhs\fP)"
.br
.ti -1c
.RI "template<\fBtypename\fP \fB_Key\fP , \fBtypename\fP _Tp , \fBtypename\fP _Compare , \fBtypename\fP \fB_Allocator\fP > bool \fBoperator>\fP (const \fBmap\fP< \fB_Key\fP, _Tp, _Compare, \fB_Allocator\fP > &\fB__lhs\fP, const \fBmap\fP< \fB_Key\fP, _Tp, _Compare, \fB_Allocator\fP > &\fB__rhs\fP)"
.br
.ti -1c
.RI "template<\fBtypename\fP \fB_Key\fP , \fBtypename\fP _Tp , \fBtypename\fP _Compare , \fBtypename\fP \fB_Allocator\fP > bool \fBoperator>\fP (const \fBmultimap\fP< \fB_Key\fP, _Tp, _Compare, \fB_Allocator\fP > &\fB__lhs\fP, const \fBmultimap\fP< \fB_Key\fP, _Tp, _Compare, \fB_Allocator\fP > &\fB__rhs\fP)"
.br
.ti -1c
.RI "template<\fBtypename\fP \fB_Key\fP , \fBtypename\fP _Compare , \fBtypename\fP \fB_Allocator\fP > bool \fBoperator>\fP (const \fBmultiset\fP< \fB_Key\fP, _Compare, \fB_Allocator\fP > &\fB__lhs\fP, const \fBmultiset\fP< \fB_Key\fP, _Compare, \fB_Allocator\fP > &\fB__rhs\fP)"
.br
.ti -1c
.RI "template<\fBtypename\fP \fB_Key\fP , \fBtypename\fP _Compare , \fBtypename\fP \fB_Allocator\fP > bool \fBoperator>\fP (const \fBset\fP< \fB_Key\fP, _Compare, \fB_Allocator\fP > &\fB__lhs\fP, const \fBset\fP< \fB_Key\fP, _Compare, \fB_Allocator\fP > &\fB__rhs\fP)"
.br
.ti -1c
.RI "template<\fBtypename\fP _Tp , \fBtypename\fP _Alloc > bool \fBoperator>\fP (const \fBvector\fP< _Tp, _Alloc > &\fB__lhs\fP, const \fBvector\fP< _Tp, _Alloc > &\fB__rhs\fP)"
.br
.ti -1c
.RI "template<\fBtypename\fP _Tp , \fBtypename\fP _Alloc > bool \fBoperator>=\fP (const \fBdeque\fP< _Tp, _Alloc > &\fB__lhs\fP, const \fBdeque\fP< _Tp, _Alloc > &\fB__rhs\fP)"
.br
.ti -1c
.RI "template<\fBtypename\fP _Tp , \fBtypename\fP _Alloc > bool \fBoperator>=\fP (const \fBforward_list\fP< _Tp, _Alloc > &\fB__lx\fP, const \fBforward_list\fP< _Tp, _Alloc > &\fB__ly\fP)"
.br
.RI "Based on operator<\&. "
.ti -1c
.RI "template<\fBtypename\fP _Tp , \fBtypename\fP _Alloc > bool \fBoperator>=\fP (const \fBlist\fP< _Tp, _Alloc > &\fB__lhs\fP, const \fBlist\fP< _Tp, _Alloc > &\fB__rhs\fP)"
.br
.ti -1c
.RI "template<\fBtypename\fP \fB_Key\fP , \fBtypename\fP _Tp , \fBtypename\fP _Compare , \fBtypename\fP \fB_Allocator\fP > bool \fBoperator>=\fP (const \fBmap\fP< \fB_Key\fP, _Tp, _Compare, \fB_Allocator\fP > &\fB__lhs\fP, const \fBmap\fP< \fB_Key\fP, _Tp, _Compare, \fB_Allocator\fP > &\fB__rhs\fP)"
.br
.ti -1c
.RI "template<\fBtypename\fP \fB_Key\fP , \fBtypename\fP _Tp , \fBtypename\fP _Compare , \fBtypename\fP \fB_Allocator\fP > bool \fBoperator>=\fP (const \fBmultimap\fP< \fB_Key\fP, _Tp, _Compare, \fB_Allocator\fP > &\fB__lhs\fP, const \fBmultimap\fP< \fB_Key\fP, _Tp, _Compare, \fB_Allocator\fP > &\fB__rhs\fP)"
.br
.ti -1c
.RI "template<\fBtypename\fP \fB_Key\fP , \fBtypename\fP _Compare , \fBtypename\fP \fB_Allocator\fP > bool \fBoperator>=\fP (const \fBmultiset\fP< \fB_Key\fP, _Compare, \fB_Allocator\fP > &\fB__lhs\fP, const \fBmultiset\fP< \fB_Key\fP, _Compare, \fB_Allocator\fP > &\fB__rhs\fP)"
.br
.ti -1c
.RI "template<\fBtypename\fP \fB_Key\fP , \fBtypename\fP _Compare , \fBtypename\fP \fB_Allocator\fP > bool \fBoperator>=\fP (const \fBset\fP< \fB_Key\fP, _Compare, \fB_Allocator\fP > &\fB__lhs\fP, const \fBset\fP< \fB_Key\fP, _Compare, \fB_Allocator\fP > &\fB__rhs\fP)"
.br
.ti -1c
.RI "template<\fBtypename\fP _Tp , \fBtypename\fP _Alloc > bool \fBoperator>=\fP (const \fBvector\fP< _Tp, _Alloc > &\fB__lhs\fP, const \fBvector\fP< _Tp, _Alloc > &\fB__rhs\fP)"
.br
.ti -1c
.RI "template<\fBtypename\fP _CharT , \fBtypename\fP _Traits , size_t _Nb> \fBstd::basic_istream\fP< _CharT, _Traits > & \fBoperator>>\fP (\fBstd::basic_istream\fP< _CharT, _Traits > &\fB__is\fP, \fBbitset\fP< \fB_Nb\fP > &__x)"
.br
.ti -1c
.RI "template<size_t _Nb> \fBbitset\fP< \fB_Nb\fP > \fBoperator^\fP (const \fBbitset\fP< \fB_Nb\fP > &__x, const \fBbitset\fP< \fB_Nb\fP > &\fB__y\fP) noexcept"
.br
.ti -1c
.RI "template<size_t _Nb> \fBbitset\fP< \fB_Nb\fP > \fBoperator|\fP (const \fBbitset\fP< \fB_Nb\fP > &__x, const \fBbitset\fP< \fB_Nb\fP > &\fB__y\fP) noexcept"
.br
.ti -1c
.RI "template<\fBtypename\fP \fB_InputIterator\fP , \fBtypename\fP \fB_Allocator\fP , \fBtypename\fP  = _RequireInputIter<_InputIterator>, \fBtypename\fP  = _RequireAllocator<_Allocator>> \fBset\fP (\fB_InputIterator\fP, \fB_InputIterator\fP, \fB_Allocator\fP) \-> \fBset\fP< \fBtypename\fP \fBiterator_traits\fP< \fB_InputIterator\fP >::value_type, \fBless\fP< \fBtypename\fP \fBiterator_traits\fP< \fB_InputIterator\fP >::value_type >, \fB_Allocator\fP >"
.br
.ti -1c
.RI "template<\fBtypename\fP \fB_InputIterator\fP , \fBtypename\fP _Compare  = less<typename iterator_traits<_InputIterator>::value_type>, \fBtypename\fP \fB_Allocator\fP  = allocator<typename iterator_traits<_InputIterator>::value_type>, \fBtypename\fP  = _RequireInputIter<_InputIterator>, \fBtypename\fP  = _RequireNotAllocator<_Compare>, \fBtypename\fP  = _RequireAllocator<_Allocator>> \fBset\fP (\fB_InputIterator\fP, \fB_InputIterator\fP, _Compare=_Compare(), \fB_Allocator\fP=\fB_Allocator\fP()) \-> \fBset\fP< \fBtypename\fP \fBiterator_traits\fP< \fB_InputIterator\fP >::value_type, _Compare, \fB_Allocator\fP >"
.br
.ti -1c
.RI "template<\fBtypename\fP \fB_Key\fP , \fBtypename\fP \fB_Allocator\fP , \fBtypename\fP  = _RequireAllocator<_Allocator>> \fBset\fP (\fBinitializer_list\fP< \fB_Key\fP >, \fB_Allocator\fP) \-> \fBset\fP< \fB_Key\fP, \fBless\fP< \fB_Key\fP >, \fB_Allocator\fP >"
.br
.ti -1c
.RI "template<\fBtypename\fP \fB_Key\fP , \fBtypename\fP _Compare  = less<_Key>, \fBtypename\fP \fB_Allocator\fP  = allocator<_Key>, \fBtypename\fP  = _RequireNotAllocator<_Compare>, \fBtypename\fP  = _RequireAllocator<_Allocator>> \fBset\fP (\fBinitializer_list\fP< \fB_Key\fP >, _Compare=_Compare(), \fB_Allocator\fP=\fB_Allocator\fP()) \-> \fBset\fP< \fB_Key\fP, _Compare, \fB_Allocator\fP >"
.br
.ti -1c
.RI "template<\fBtypename\fP _Tp , \fBtypename\fP _Alloc > \fBvoid\fP \fBswap\fP (\fBdeque\fP< _Tp, _Alloc > &\fB__lhs\fP, \fBdeque\fP< _Tp, _Alloc > &\fB__rhs\fP) noexcept(/*\fBconditional\fP */)"
.br
.ti -1c
.RI "template<\fBtypename\fP _Tp , \fBtypename\fP _Alloc > \fBvoid\fP \fBswap\fP (\fBforward_list\fP< _Tp, _Alloc > &\fB__lx\fP, \fBforward_list\fP< _Tp, _Alloc > &\fB__ly\fP) noexcept(noexcept(__lx\&.swap(\fB__ly\fP)))"
.br
.RI "See std::forward_list::swap()\&. "
.ti -1c
.RI "template<\fBtypename\fP _Tp , \fBtypename\fP _Alloc > \fBvoid\fP \fBswap\fP (\fBlist\fP< _Tp, _Alloc > &\fB__lhs\fP, \fBlist\fP< _Tp, _Alloc > &\fB__rhs\fP) noexcept(/*\fBconditional\fP */)"
.br
.ti -1c
.RI "template<\fBtypename\fP \fB_Key\fP , \fBtypename\fP _Tp , \fBtypename\fP _Compare , \fBtypename\fP \fB_Allocator\fP > \fBvoid\fP \fBswap\fP (\fBmap\fP< \fB_Key\fP, _Tp, _Compare, \fB_Allocator\fP > &\fB__lhs\fP, \fBmap\fP< \fB_Key\fP, _Tp, _Compare, \fB_Allocator\fP > &\fB__rhs\fP) noexcept(/*\fBconditional\fP */)"
.br
.ti -1c
.RI "template<\fBtypename\fP \fB_Key\fP , \fBtypename\fP _Tp , \fBtypename\fP _Compare , \fBtypename\fP \fB_Allocator\fP > \fBvoid\fP \fBswap\fP (\fBmultimap\fP< \fB_Key\fP, _Tp, _Compare, \fB_Allocator\fP > &\fB__lhs\fP, \fBmultimap\fP< \fB_Key\fP, _Tp, _Compare, \fB_Allocator\fP > &\fB__rhs\fP) noexcept(/*\fBconditional\fP */)"
.br
.ti -1c
.RI "template<\fBtypename\fP \fB_Key\fP , \fBtypename\fP _Compare , \fBtypename\fP \fB_Allocator\fP > \fBvoid\fP \fBswap\fP (\fBmultiset\fP< \fB_Key\fP, _Compare, \fB_Allocator\fP > &__x, \fBmultiset\fP< \fB_Key\fP, _Compare, \fB_Allocator\fP > &\fB__y\fP) noexcept(/*\fBconditional\fP */)"
.br
.ti -1c
.RI "template<\fBtypename\fP \fB_Key\fP , \fBtypename\fP _Compare , \fBtypename\fP \fB_Allocator\fP > \fBvoid\fP \fBswap\fP (\fBset\fP< \fB_Key\fP, _Compare, \fB_Allocator\fP > &__x, \fBset\fP< \fB_Key\fP, _Compare, \fB_Allocator\fP > &\fB__y\fP) noexcept(/*\fBconditional\fP */)"
.br
.ti -1c
.RI "template<\fBtypename\fP \fB_Key\fP , \fBtypename\fP _Tp , \fBtypename\fP \fB_Hash\fP , \fBtypename\fP \fB_Pred\fP , \fBtypename\fP _Alloc > \fBvoid\fP \fBswap\fP (\fBunordered_map\fP< \fB_Key\fP, _Tp, \fB_Hash\fP, \fB_Pred\fP, _Alloc > &__x, \fBunordered_map\fP< \fB_Key\fP, _Tp, \fB_Hash\fP, \fB_Pred\fP, _Alloc > &\fB__y\fP) noexcept(noexcept(__x\&.swap(\fB__y\fP)))"
.br
.ti -1c
.RI "template<\fBtypename\fP \fB_Key\fP , \fBtypename\fP _Tp , \fBtypename\fP \fB_Hash\fP , \fBtypename\fP \fB_Pred\fP , \fBtypename\fP _Alloc > \fBvoid\fP \fBswap\fP (\fBunordered_multimap\fP< \fB_Key\fP, _Tp, \fB_Hash\fP, \fB_Pred\fP, _Alloc > &__x, \fBunordered_multimap\fP< \fB_Key\fP, _Tp, \fB_Hash\fP, \fB_Pred\fP, _Alloc > &\fB__y\fP) noexcept(noexcept(__x\&.swap(\fB__y\fP)))"
.br
.ti -1c
.RI "template<\fBtypename\fP _Value , \fBtypename\fP \fB_Hash\fP , \fBtypename\fP \fB_Pred\fP , \fBtypename\fP _Alloc > \fBvoid\fP \fBswap\fP (\fBunordered_multiset\fP< _Value, \fB_Hash\fP, \fB_Pred\fP, _Alloc > &__x, \fBunordered_multiset\fP< _Value, \fB_Hash\fP, \fB_Pred\fP, _Alloc > &\fB__y\fP) noexcept(noexcept(__x\&.swap(\fB__y\fP)))"
.br
.ti -1c
.RI "template<\fBtypename\fP _Value , \fBtypename\fP \fB_Hash\fP , \fBtypename\fP \fB_Pred\fP , \fBtypename\fP _Alloc > \fBvoid\fP \fBswap\fP (\fBunordered_set\fP< _Value, \fB_Hash\fP, \fB_Pred\fP, _Alloc > &__x, \fBunordered_set\fP< _Value, \fB_Hash\fP, \fB_Pred\fP, _Alloc > &\fB__y\fP) noexcept(noexcept(__x\&.swap(\fB__y\fP)))"
.br
.ti -1c
.RI "template<\fBtypename\fP _Tp , \fBtypename\fP _Alloc > \fBvoid\fP \fBswap\fP (\fBvector\fP< _Tp, _Alloc > &\fB__lhs\fP, \fBvector\fP< _Tp, _Alloc > &\fB__rhs\fP) noexcept(/*\fBconditional\fP */)"
.br
.ti -1c
.RI "template<\fBtypename\fP \fB_InputIterator\fP , \fBtypename\fP \fB_Allocator\fP , \fBtypename\fP  = _RequireInputIter<_InputIterator>, \fBtypename\fP  = _RequireAllocator<_Allocator>> \fBunordered_map\fP (\fB_InputIterator\fP, \fB_InputIterator\fP, \fB_Allocator\fP) \-> \fBunordered_map\fP< \fB__iter_key_t\fP< \fB_InputIterator\fP >, __iter_val_t< \fB_InputIterator\fP >, \fBhash\fP< \fB__iter_key_t\fP< \fB_InputIterator\fP > >, \fBequal_to\fP< \fB__iter_key_t\fP< \fB_InputIterator\fP > >, \fB_Allocator\fP >"
.br
.ti -1c
.RI "template<\fBtypename\fP \fB_InputIterator\fP , \fBtypename\fP \fB_Allocator\fP , \fBtypename\fP  = _RequireInputIter<_InputIterator>, \fBtypename\fP  = _RequireAllocator<_Allocator>> \fBunordered_map\fP (\fB_InputIterator\fP, \fB_InputIterator\fP, \fBtypename\fP \fBunordered_map\fP< int, int >::size_type, \fB_Allocator\fP) \-> \fBunordered_map\fP< \fB__iter_key_t\fP< \fB_InputIterator\fP >, __iter_val_t< \fB_InputIterator\fP >, \fBhash\fP< \fB__iter_key_t\fP< \fB_InputIterator\fP > >, \fBequal_to\fP< \fB__iter_key_t\fP< \fB_InputIterator\fP > >, \fB_Allocator\fP >"
.br
.ti -1c
.RI "template<\fBtypename\fP \fB_InputIterator\fP , \fBtypename\fP \fB_Hash\fP , \fBtypename\fP \fB_Allocator\fP , \fBtypename\fP  = _RequireInputIter<_InputIterator>, \fBtypename\fP  = _RequireNotAllocatorOrIntegral<_Hash>, \fBtypename\fP  = _RequireAllocator<_Allocator>> \fBunordered_map\fP (\fB_InputIterator\fP, \fB_InputIterator\fP, \fBtypename\fP \fBunordered_map\fP< int, int >::size_type, \fB_Hash\fP, \fB_Allocator\fP) \-> \fBunordered_map\fP< \fB__iter_key_t\fP< \fB_InputIterator\fP >, __iter_val_t< \fB_InputIterator\fP >, \fB_Hash\fP, \fBequal_to\fP< \fB__iter_key_t\fP< \fB_InputIterator\fP > >, \fB_Allocator\fP >"
.br
.ti -1c
.RI "template<\fBtypename\fP \fB_InputIterator\fP , \fBtypename\fP \fB_Hash\fP  = hash<__iter_key_t<_InputIterator>>, \fBtypename\fP \fB_Pred\fP  = equal_to<__iter_key_t<_InputIterator>>, \fBtypename\fP \fB_Allocator\fP  = allocator<__iter_to_alloc_t<_InputIterator>>, \fBtypename\fP  = _RequireInputIter<_InputIterator>, \fBtypename\fP  = _RequireNotAllocatorOrIntegral<_Hash>, \fBtypename\fP  = _RequireNotAllocator<_Pred>, \fBtypename\fP  = _RequireAllocator<_Allocator>> \fBunordered_map\fP (\fB_InputIterator\fP, \fB_InputIterator\fP, \fBtypename\fP \fBunordered_map\fP< int, int >::size_type={}, \fB_Hash\fP=\fB_Hash\fP(), \fB_Pred\fP=\fB_Pred\fP(), \fB_Allocator\fP=\fB_Allocator\fP()) \-> \fBunordered_map\fP< \fB__iter_key_t\fP< \fB_InputIterator\fP >, __iter_val_t< \fB_InputIterator\fP >, \fB_Hash\fP, \fB_Pred\fP, \fB_Allocator\fP >"
.br
.ti -1c
.RI "template<\fBtypename\fP \fB_Key\fP , \fBtypename\fP _Tp , \fBtypename\fP \fB_Allocator\fP , \fBtypename\fP  = _RequireAllocator<_Allocator>> \fBunordered_map\fP (\fBinitializer_list\fP< \fBpair\fP< \fB_Key\fP, _Tp > >, \fB_Allocator\fP) \-> \fBunordered_map\fP< \fB_Key\fP, _Tp, \fBhash\fP< \fB_Key\fP >, \fBequal_to\fP< \fB_Key\fP >, \fB_Allocator\fP >"
.br
.ti -1c
.RI "template<\fBtypename\fP \fB_Key\fP , \fBtypename\fP _Tp , \fBtypename\fP \fB_Allocator\fP , \fBtypename\fP  = _RequireAllocator<_Allocator>> \fBunordered_map\fP (\fBinitializer_list\fP< \fBpair\fP< \fB_Key\fP, _Tp > >, \fBtypename\fP \fBunordered_map\fP< int, int >::size_type, \fB_Allocator\fP) \-> \fBunordered_map\fP< \fB_Key\fP, _Tp, \fBhash\fP< \fB_Key\fP >, \fBequal_to\fP< \fB_Key\fP >, \fB_Allocator\fP >"
.br
.ti -1c
.RI "template<\fBtypename\fP \fB_Key\fP , \fBtypename\fP _Tp , \fBtypename\fP \fB_Hash\fP , \fBtypename\fP \fB_Allocator\fP , \fBtypename\fP  = _RequireNotAllocatorOrIntegral<_Hash>, \fBtypename\fP  = _RequireAllocator<_Allocator>> \fBunordered_map\fP (\fBinitializer_list\fP< \fBpair\fP< \fB_Key\fP, _Tp > >, \fBtypename\fP \fBunordered_map\fP< int, int >::size_type, \fB_Hash\fP, \fB_Allocator\fP) \-> \fBunordered_map\fP< \fB_Key\fP, _Tp, \fB_Hash\fP, \fBequal_to\fP< \fB_Key\fP >, \fB_Allocator\fP >"
.br
.ti -1c
.RI "template<\fBtypename\fP \fB_Key\fP , \fBtypename\fP _Tp , \fBtypename\fP \fB_Hash\fP  = hash<_Key>, \fBtypename\fP \fB_Pred\fP  = equal_to<_Key>, \fBtypename\fP \fB_Allocator\fP  = allocator<pair<const _Key, _Tp>>, \fBtypename\fP  = _RequireNotAllocatorOrIntegral<_Hash>, \fBtypename\fP  = _RequireNotAllocator<_Pred>, \fBtypename\fP  = _RequireAllocator<_Allocator>> \fBunordered_map\fP (\fBinitializer_list\fP< \fBpair\fP< \fB_Key\fP, _Tp > >, \fBtypename\fP \fBunordered_map\fP< int, int >::size_type={}, \fB_Hash\fP=\fB_Hash\fP(), \fB_Pred\fP=\fB_Pred\fP(), \fB_Allocator\fP=\fB_Allocator\fP()) \-> \fBunordered_map\fP< \fB_Key\fP, _Tp, \fB_Hash\fP, \fB_Pred\fP, \fB_Allocator\fP >"
.br
.ti -1c
.RI "template<\fBtypename\fP \fB_InputIterator\fP , \fBtypename\fP \fB_Allocator\fP , \fBtypename\fP  = _RequireInputIter<_InputIterator>, \fBtypename\fP  = _RequireAllocator<_Allocator>> \fBunordered_multimap\fP (\fB_InputIterator\fP, \fB_InputIterator\fP, \fB_Allocator\fP) \-> \fBunordered_multimap\fP< \fB__iter_key_t\fP< \fB_InputIterator\fP >, __iter_val_t< \fB_InputIterator\fP >, \fBhash\fP< \fB__iter_key_t\fP< \fB_InputIterator\fP > >, \fBequal_to\fP< \fB__iter_key_t\fP< \fB_InputIterator\fP > >, \fB_Allocator\fP >"
.br
.ti -1c
.RI "template<\fBtypename\fP \fB_InputIterator\fP , \fBtypename\fP \fB_Allocator\fP , \fBtypename\fP  = _RequireInputIter<_InputIterator>, \fBtypename\fP  = _RequireAllocator<_Allocator>> \fBunordered_multimap\fP (\fB_InputIterator\fP, \fB_InputIterator\fP, \fBunordered_multimap\fP< int, int >::size_type, \fB_Allocator\fP) \-> \fBunordered_multimap\fP< \fB__iter_key_t\fP< \fB_InputIterator\fP >, __iter_val_t< \fB_InputIterator\fP >, \fBhash\fP< \fB__iter_key_t\fP< \fB_InputIterator\fP > >, \fBequal_to\fP< \fB__iter_key_t\fP< \fB_InputIterator\fP > >, \fB_Allocator\fP >"
.br
.ti -1c
.RI "template<\fBtypename\fP \fB_InputIterator\fP , \fBtypename\fP \fB_Hash\fP , \fBtypename\fP \fB_Allocator\fP , \fBtypename\fP  = _RequireInputIter<_InputIterator>, \fBtypename\fP  = _RequireNotAllocatorOrIntegral<_Hash>, \fBtypename\fP  = _RequireAllocator<_Allocator>> \fBunordered_multimap\fP (\fB_InputIterator\fP, \fB_InputIterator\fP, \fBunordered_multimap\fP< int, int >::size_type, \fB_Hash\fP, \fB_Allocator\fP) \-> \fBunordered_multimap\fP< \fB__iter_key_t\fP< \fB_InputIterator\fP >, __iter_val_t< \fB_InputIterator\fP >, \fB_Hash\fP, \fBequal_to\fP< \fB__iter_key_t\fP< \fB_InputIterator\fP > >, \fB_Allocator\fP >"
.br
.ti -1c
.RI "template<\fBtypename\fP \fB_InputIterator\fP , \fBtypename\fP \fB_Hash\fP  = hash<__iter_key_t<_InputIterator>>, \fBtypename\fP \fB_Pred\fP  = equal_to<__iter_key_t<_InputIterator>>, \fBtypename\fP \fB_Allocator\fP  = allocator<__iter_to_alloc_t<_InputIterator>>, \fBtypename\fP  = _RequireInputIter<_InputIterator>, \fBtypename\fP  = _RequireNotAllocatorOrIntegral<_Hash>, \fBtypename\fP  = _RequireNotAllocator<_Pred>, \fBtypename\fP  = _RequireAllocator<_Allocator>> \fBunordered_multimap\fP (\fB_InputIterator\fP, \fB_InputIterator\fP, \fBunordered_multimap\fP< int, int >::size_type={}, \fB_Hash\fP=\fB_Hash\fP(), \fB_Pred\fP=\fB_Pred\fP(), \fB_Allocator\fP=\fB_Allocator\fP()) \-> \fBunordered_multimap\fP< \fB__iter_key_t\fP< \fB_InputIterator\fP >, __iter_val_t< \fB_InputIterator\fP >, \fB_Hash\fP, \fB_Pred\fP, \fB_Allocator\fP >"
.br
.ti -1c
.RI "template<\fBtypename\fP \fB_Key\fP , \fBtypename\fP _Tp , \fBtypename\fP \fB_Allocator\fP , \fBtypename\fP  = _RequireAllocator<_Allocator>> \fBunordered_multimap\fP (\fBinitializer_list\fP< \fBpair\fP< \fB_Key\fP, _Tp > >, \fB_Allocator\fP) \-> \fBunordered_multimap\fP< \fB_Key\fP, _Tp, \fBhash\fP< \fB_Key\fP >, \fBequal_to\fP< \fB_Key\fP >, \fB_Allocator\fP >"
.br
.ti -1c
.RI "template<\fBtypename\fP \fB_Key\fP , \fBtypename\fP _Tp , \fBtypename\fP \fB_Allocator\fP , \fBtypename\fP  = _RequireAllocator<_Allocator>> \fBunordered_multimap\fP (\fBinitializer_list\fP< \fBpair\fP< \fB_Key\fP, _Tp > >, \fBunordered_multimap\fP< int, int >::size_type, \fB_Allocator\fP) \-> \fBunordered_multimap\fP< \fB_Key\fP, _Tp, \fBhash\fP< \fB_Key\fP >, \fBequal_to\fP< \fB_Key\fP >, \fB_Allocator\fP >"
.br
.ti -1c
.RI "template<\fBtypename\fP \fB_Key\fP , \fBtypename\fP _Tp , \fBtypename\fP \fB_Hash\fP , \fBtypename\fP \fB_Allocator\fP , \fBtypename\fP  = _RequireNotAllocatorOrIntegral<_Hash>, \fBtypename\fP  = _RequireAllocator<_Allocator>> \fBunordered_multimap\fP (\fBinitializer_list\fP< \fBpair\fP< \fB_Key\fP, _Tp > >, \fBunordered_multimap\fP< int, int >::size_type, \fB_Hash\fP, \fB_Allocator\fP) \-> \fBunordered_multimap\fP< \fB_Key\fP, _Tp, \fB_Hash\fP, \fBequal_to\fP< \fB_Key\fP >, \fB_Allocator\fP >"
.br
.ti -1c
.RI "template<\fBtypename\fP \fB_Key\fP , \fBtypename\fP _Tp , \fBtypename\fP \fB_Hash\fP  = hash<_Key>, \fBtypename\fP \fB_Pred\fP  = equal_to<_Key>, \fBtypename\fP \fB_Allocator\fP  = allocator<pair<const _Key, _Tp>>, \fBtypename\fP  = _RequireNotAllocatorOrIntegral<_Hash>, \fBtypename\fP  = _RequireNotAllocator<_Pred>, \fBtypename\fP  = _RequireAllocator<_Allocator>> \fBunordered_multimap\fP (\fBinitializer_list\fP< \fBpair\fP< \fB_Key\fP, _Tp > >, \fBunordered_multimap\fP< int, int >::size_type={}, \fB_Hash\fP=\fB_Hash\fP(), \fB_Pred\fP=\fB_Pred\fP(), \fB_Allocator\fP=\fB_Allocator\fP()) \-> \fBunordered_multimap\fP< \fB_Key\fP, _Tp, \fB_Hash\fP, \fB_Pred\fP, \fB_Allocator\fP >"
.br
.ti -1c
.RI "template<\fBtypename\fP \fB_InputIterator\fP , \fBtypename\fP \fB_Allocator\fP , \fBtypename\fP  = _RequireInputIter<_InputIterator>, \fBtypename\fP  = _RequireAllocator<_Allocator>> \fBunordered_multiset\fP (\fB_InputIterator\fP, \fB_InputIterator\fP, \fBunordered_multiset\fP< int >::size_type, \fB_Allocator\fP) \-> \fBunordered_multiset\fP< \fBtypename\fP \fBiterator_traits\fP< \fB_InputIterator\fP >::value_type, \fBhash\fP< \fBtypename\fP \fBiterator_traits\fP< \fB_InputIterator\fP >::value_type >, \fBequal_to\fP< \fBtypename\fP \fBiterator_traits\fP< \fB_InputIterator\fP >::value_type >, \fB_Allocator\fP >"
.br
.ti -1c
.RI "template<\fBtypename\fP \fB_InputIterator\fP , \fBtypename\fP \fB_Hash\fP , \fBtypename\fP \fB_Allocator\fP , \fBtypename\fP  = _RequireInputIter<_InputIterator>, \fBtypename\fP  = _RequireNotAllocatorOrIntegral<_Hash>, \fBtypename\fP  = _RequireAllocator<_Allocator>> \fBunordered_multiset\fP (\fB_InputIterator\fP, \fB_InputIterator\fP, \fBunordered_multiset\fP< int >::size_type, \fB_Hash\fP, \fB_Allocator\fP) \-> \fBunordered_multiset\fP< \fBtypename\fP \fBiterator_traits\fP< \fB_InputIterator\fP >::value_type, \fB_Hash\fP, \fBequal_to\fP< \fBtypename\fP \fBiterator_traits\fP< \fB_InputIterator\fP >::value_type >, \fB_Allocator\fP >"
.br
.ti -1c
.RI "template<\fBtypename\fP \fB_InputIterator\fP , \fBtypename\fP \fB_Hash\fP  = hash<typename iterator_traits<_InputIterator>::value_type>, \fBtypename\fP \fB_Pred\fP  = equal_to<typename iterator_traits<_InputIterator>::value_type>, \fBtypename\fP \fB_Allocator\fP  = allocator<typename iterator_traits<_InputIterator>::value_type>, \fBtypename\fP  = _RequireInputIter<_InputIterator>, \fBtypename\fP  = _RequireNotAllocatorOrIntegral<_Hash>, \fBtypename\fP  = _RequireNotAllocator<_Pred>, \fBtypename\fP  = _RequireAllocator<_Allocator>> \fBunordered_multiset\fP (\fB_InputIterator\fP, \fB_InputIterator\fP, \fBunordered_multiset\fP< int >::size_type={}, \fB_Hash\fP=\fB_Hash\fP(), \fB_Pred\fP=\fB_Pred\fP(), \fB_Allocator\fP=\fB_Allocator\fP()) \-> \fBunordered_multiset\fP< \fBtypename\fP \fBiterator_traits\fP< \fB_InputIterator\fP >::value_type, \fB_Hash\fP, \fB_Pred\fP, \fB_Allocator\fP >"
.br
.ti -1c
.RI "template<\fBtypename\fP _Tp , \fBtypename\fP \fB_Allocator\fP , \fBtypename\fP  = _RequireAllocator<_Allocator>> \fBunordered_multiset\fP (\fBinitializer_list\fP< _Tp >, \fBunordered_multiset\fP< int >::size_type, \fB_Allocator\fP) \-> \fBunordered_multiset\fP< _Tp, \fBhash\fP< _Tp >, \fBequal_to\fP< _Tp >, \fB_Allocator\fP >"
.br
.ti -1c
.RI "template<\fBtypename\fP _Tp , \fBtypename\fP \fB_Hash\fP , \fBtypename\fP \fB_Allocator\fP , \fBtypename\fP  = _RequireNotAllocatorOrIntegral<_Hash>, \fBtypename\fP  = _RequireAllocator<_Allocator>> \fBunordered_multiset\fP (\fBinitializer_list\fP< _Tp >, \fBunordered_multiset\fP< int >::size_type, \fB_Hash\fP, \fB_Allocator\fP) \-> \fBunordered_multiset\fP< _Tp, \fB_Hash\fP, \fBequal_to\fP< _Tp >, \fB_Allocator\fP >"
.br
.ti -1c
.RI "template<\fBtypename\fP _Tp , \fBtypename\fP \fB_Hash\fP  = hash<_Tp>, \fBtypename\fP \fB_Pred\fP  = equal_to<_Tp>, \fBtypename\fP \fB_Allocator\fP  = allocator<_Tp>, \fBtypename\fP  = _RequireNotAllocatorOrIntegral<_Hash>, \fBtypename\fP  = _RequireNotAllocator<_Pred>, \fBtypename\fP  = _RequireAllocator<_Allocator>> \fBunordered_multiset\fP (\fBinitializer_list\fP< _Tp >, \fBunordered_multiset\fP< int >::size_type={}, \fB_Hash\fP=\fB_Hash\fP(), \fB_Pred\fP=\fB_Pred\fP(), \fB_Allocator\fP=\fB_Allocator\fP()) \-> \fBunordered_multiset\fP< _Tp, \fB_Hash\fP, \fB_Pred\fP, \fB_Allocator\fP >"
.br
.ti -1c
.RI "template<\fBtypename\fP \fB_InputIterator\fP , \fBtypename\fP \fB_Allocator\fP , \fBtypename\fP  = _RequireInputIter<_InputIterator>, \fBtypename\fP  = _RequireAllocator<_Allocator>> \fBunordered_set\fP (\fB_InputIterator\fP, \fB_InputIterator\fP, \fBunordered_set\fP< int >::size_type, \fB_Allocator\fP) \-> \fBunordered_set\fP< \fBtypename\fP \fBiterator_traits\fP< \fB_InputIterator\fP >::value_type, \fBhash\fP< \fBtypename\fP \fBiterator_traits\fP< \fB_InputIterator\fP >::value_type >, \fBequal_to\fP< \fBtypename\fP \fBiterator_traits\fP< \fB_InputIterator\fP >::value_type >, \fB_Allocator\fP >"
.br
.ti -1c
.RI "template<\fBtypename\fP \fB_InputIterator\fP , \fBtypename\fP \fB_Hash\fP , \fBtypename\fP \fB_Allocator\fP , \fBtypename\fP  = _RequireInputIter<_InputIterator>, \fBtypename\fP  = _RequireNotAllocatorOrIntegral<_Hash>, \fBtypename\fP  = _RequireAllocator<_Allocator>> \fBunordered_set\fP (\fB_InputIterator\fP, \fB_InputIterator\fP, \fBunordered_set\fP< int >::size_type, \fB_Hash\fP, \fB_Allocator\fP) \-> \fBunordered_set\fP< \fBtypename\fP \fBiterator_traits\fP< \fB_InputIterator\fP >::value_type, \fB_Hash\fP, \fBequal_to\fP< \fBtypename\fP \fBiterator_traits\fP< \fB_InputIterator\fP >::value_type >, \fB_Allocator\fP >"
.br
.ti -1c
.RI "template<\fBtypename\fP \fB_InputIterator\fP , \fBtypename\fP \fB_Hash\fP  = hash<typename iterator_traits<_InputIterator>::value_type>, \fBtypename\fP \fB_Pred\fP  = equal_to<typename iterator_traits<_InputIterator>::value_type>, \fBtypename\fP \fB_Allocator\fP  = allocator<typename iterator_traits<_InputIterator>::value_type>, \fBtypename\fP  = _RequireInputIter<_InputIterator>, \fBtypename\fP  = _RequireNotAllocatorOrIntegral<_Hash>, \fBtypename\fP  = _RequireNotAllocator<_Pred>, \fBtypename\fP  = _RequireAllocator<_Allocator>> \fBunordered_set\fP (\fB_InputIterator\fP, \fB_InputIterator\fP, \fBunordered_set\fP< int >::size_type={}, \fB_Hash\fP=\fB_Hash\fP(), \fB_Pred\fP=\fB_Pred\fP(), \fB_Allocator\fP=\fB_Allocator\fP()) \-> \fBunordered_set\fP< \fBtypename\fP \fBiterator_traits\fP< \fB_InputIterator\fP >::value_type, \fB_Hash\fP, \fB_Pred\fP, \fB_Allocator\fP >"
.br
.ti -1c
.RI "template<\fBtypename\fP _Tp , \fBtypename\fP \fB_Allocator\fP , \fBtypename\fP  = _RequireAllocator<_Allocator>> \fBunordered_set\fP (\fBinitializer_list\fP< _Tp >, \fBunordered_set\fP< int >::size_type, \fB_Allocator\fP) \-> \fBunordered_set\fP< _Tp, \fBhash\fP< _Tp >, \fBequal_to\fP< _Tp >, \fB_Allocator\fP >"
.br
.ti -1c
.RI "template<\fBtypename\fP _Tp , \fBtypename\fP \fB_Hash\fP , \fBtypename\fP \fB_Allocator\fP , \fBtypename\fP  = _RequireNotAllocatorOrIntegral<_Hash>, \fBtypename\fP  = _RequireAllocator<_Allocator>> \fBunordered_set\fP (\fBinitializer_list\fP< _Tp >, \fBunordered_set\fP< int >::size_type, \fB_Hash\fP, \fB_Allocator\fP) \-> \fBunordered_set\fP< _Tp, \fB_Hash\fP, \fBequal_to\fP< _Tp >, \fB_Allocator\fP >"
.br
.ti -1c
.RI "template<\fBtypename\fP _Tp , \fBtypename\fP \fB_Hash\fP  = hash<_Tp>, \fBtypename\fP \fB_Pred\fP  = equal_to<_Tp>, \fBtypename\fP \fB_Allocator\fP  = allocator<_Tp>, \fBtypename\fP  = _RequireNotAllocatorOrIntegral<_Hash>, \fBtypename\fP  = _RequireNotAllocator<_Pred>, \fBtypename\fP  = _RequireAllocator<_Allocator>> \fBunordered_set\fP (\fBinitializer_list\fP< _Tp >, \fBunordered_set\fP< int >::size_type={}, \fB_Hash\fP=\fB_Hash\fP(), \fB_Pred\fP=\fB_Pred\fP(), \fB_Allocator\fP=\fB_Allocator\fP()) \-> \fBunordered_set\fP< _Tp, \fB_Hash\fP, \fB_Pred\fP, \fB_Allocator\fP >"
.br
.ti -1c
.RI "template<\fBtypename\fP \fB_InputIterator\fP , \fBtypename\fP \fB_ValT\fP  = typename iterator_traits<_InputIterator>::value_type, \fBtypename\fP \fB_Allocator\fP  = allocator<_ValT>, \fBtypename\fP  = _RequireInputIter<_InputIterator>, \fBtypename\fP  = _RequireAllocator<_Allocator>> \fBvector\fP (\fB_InputIterator\fP, \fB_InputIterator\fP, \fB_Allocator\fP=\fB_Allocator\fP()) \-> \fBvector\fP< \fB_ValT\fP, \fB_Allocator\fP >"
.br
.ti -1c
.RI "template<\fBtypename\fP _Tp , \fBtypename\fP \fB_Allocator\fP  = allocator<_Tp>, \fBtypename\fP  = _RequireAllocator<_Allocator>> \fBvector\fP (size_t, _Tp, \fB_Allocator\fP=\fB_Allocator\fP()) \-> \fBvector\fP< _Tp, \fB_Allocator\fP >"
.br
.in -1c
.SH "Detailed Description"
.PP 
GNU debug code, replaces standard behavior with debug behavior\&. 

Macros and namespaces used by the implementation outside of debug wrappers to verify certain properties\&. The __glibcxx_requires_xxx macros are merely wrappers around the __glibcxx_check_xxx wrappers when we are compiling with debug mode, but disappear when we are in release mode so that there is no checking performed in, e\&.g\&., the standard library algorithms\&. 
.SH "Function Documentation"
.PP 
.SS "template<\fBtypename\fP _Tp , \fBtypename\fP _Alloc > bool std::__debug::operator<= (const \fBforward_list\fP< _Tp, _Alloc > & __lx, const \fBforward_list\fP< _Tp, _Alloc > & __ly)\fC [inline]\fP, \fC [protected]\fP"

.PP
Based on operator<\&. 
.SS "template<\fBtypename\fP _Tp , \fBtypename\fP _Alloc > bool std::__debug::operator> (const \fBforward_list\fP< _Tp, _Alloc > & __lx, const \fBforward_list\fP< _Tp, _Alloc > & __ly)\fC [inline]\fP, \fC [protected]\fP"

.PP
Based on operator<\&. 
.SS "template<\fBtypename\fP _Tp , \fBtypename\fP _Alloc > bool std::__debug::operator>= (const \fBforward_list\fP< _Tp, _Alloc > & __lx, const \fBforward_list\fP< _Tp, _Alloc > & __ly)\fC [inline]\fP, \fC [protected]\fP"

.PP
Based on operator<\&. 
.SS "template<\fBtypename\fP _Tp , \fBtypename\fP _Alloc > \fBvoid\fP std::__debug::swap (\fBforward_list\fP< _Tp, _Alloc > & __lx, \fBforward_list\fP< _Tp, _Alloc > & __ly)\fC [inline]\fP, \fC [protected]\fP, \fC [noexcept]\fP"

.PP
See std::forward_list::swap()\&. 
.SH "Author"
.PP 
Generated automatically by Doxygen for libstdc++ from the source code\&.