.TH "std::__debug" 3cxx "Sun Jan 8 2023" "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::value_type, typename _Allocator = allocator<_ValT>, typename = _RequireInputIter<_InputIterator>, typename = _RequireAllocator<_Allocator>> \fBdeque\fP (_InputIterator, _InputIterator, _Allocator=_Allocator()) \-> \fBdeque\fP< _ValT, _Allocator >" .br .ti -1c .RI "template, typename = _RequireAllocator<_Allocator>> \fBdeque\fP (size_t, _Tp, _Allocator=_Allocator()) \-> \fBdeque\fP< _Tp, _Allocator >" .br .ti -1c .RI "template::value_type, typename _Allocator = allocator<_ValT>, typename = _RequireInputIter<_InputIterator>, typename = _RequireAllocator<_Allocator>> \fBforward_list\fP (_InputIterator, _InputIterator, _Allocator=_Allocator()) \-> \fBforward_list\fP< _ValT, _Allocator >" .br .ti -1c .RI "template, typename = _RequireAllocator<_Allocator>> \fBforward_list\fP (size_t, _Tp, _Allocator=_Allocator()) \-> \fBforward_list\fP< _Tp, _Allocator >" .br .ti -1c .RI "template::value_type, typename _Allocator = allocator<_ValT>, typename = _RequireInputIter<_InputIterator>, typename = _RequireAllocator<_Allocator>> \fBlist\fP (_InputIterator, _InputIterator, _Allocator=_Allocator()) \-> \fBlist\fP< _ValT, _Allocator >" .br .ti -1c .RI "template, typename = _RequireAllocator<_Allocator>> \fBlist\fP (size_t, _Tp, _Allocator=_Allocator()) \-> \fBlist\fP< _Tp, _Allocator >" .br .ti -1c .RI "template, typename = _RequireAllocator<_Allocator>> \fBmap\fP (_InputIterator, _InputIterator, _Allocator) \-> \fBmap\fP< __iter_key_t< _InputIterator >, __iter_val_t< _InputIterator >, \fBless\fP< __iter_key_t< _InputIterator > >, _Allocator >" .br .ti -1c .RI "template>, typename _Allocator = allocator<__iter_to_alloc_t<_InputIterator>>, typename = _RequireInputIter<_InputIterator>, typename = _RequireNotAllocator<_Compare>, typename = _RequireAllocator<_Allocator>> \fBmap\fP (_InputIterator, _InputIterator, _Compare=_Compare(), _Allocator=_Allocator()) \-> \fBmap\fP< __iter_key_t< _InputIterator >, __iter_val_t< _InputIterator >, _Compare, _Allocator >" .br .ti -1c .RI "template> \fBmap\fP (\fBinitializer_list\fP< \fBpair\fP< _Key, _Tp > >, _Allocator) \-> \fBmap\fP< _Key, _Tp, \fBless\fP< _Key >, _Allocator >" .br .ti -1c .RI "template, typename _Allocator = allocator>, typename = _RequireNotAllocator<_Compare>, typename = _RequireAllocator<_Allocator>> \fBmap\fP (\fBinitializer_list\fP< \fBpair\fP< _Key, _Tp > >, _Compare=_Compare(), _Allocator=_Allocator()) \-> \fBmap\fP< _Key, _Tp, _Compare, _Allocator >" .br .ti -1c .RI "template, typename = _RequireAllocator<_Allocator>> \fBmultimap\fP (_InputIterator, _InputIterator, _Allocator) \-> \fBmultimap\fP< __iter_key_t< _InputIterator >, __iter_val_t< _InputIterator >, \fBless\fP< __iter_key_t< _InputIterator > >, _Allocator >" .br .ti -1c .RI "template>, typename _Allocator = allocator<__iter_to_alloc_t<_InputIterator>>, typename = _RequireInputIter<_InputIterator>, typename = _RequireNotAllocator<_Compare>, typename = _RequireAllocator<_Allocator>> \fBmultimap\fP (_InputIterator, _InputIterator, _Compare=_Compare(), _Allocator=_Allocator()) \-> \fBmultimap\fP< __iter_key_t< _InputIterator >, __iter_val_t< _InputIterator >, _Compare, _Allocator >" .br .ti -1c .RI "template> \fBmultimap\fP (\fBinitializer_list\fP< \fBpair\fP< _Key, _Tp > >, _Allocator) \-> \fBmultimap\fP< _Key, _Tp, \fBless\fP< _Key >, _Allocator >" .br .ti -1c .RI "template, typename _Allocator = allocator>, typename = _RequireNotAllocator<_Compare>, typename = _RequireAllocator<_Allocator>> \fBmultimap\fP (\fBinitializer_list\fP< \fBpair\fP< _Key, _Tp > >, _Compare=_Compare(), _Allocator=_Allocator()) \-> \fBmultimap\fP< _Key, _Tp, _Compare, _Allocator >" .br .ti -1c .RI "template, typename = _RequireAllocator<_Allocator>> \fBmultiset\fP (_InputIterator, _InputIterator, _Allocator) \-> \fBmultiset\fP< typename \fBiterator_traits\fP< _InputIterator >::value_type, \fBless\fP< typename \fBiterator_traits\fP< _InputIterator >::value_type >, _Allocator >" .br .ti -1c .RI "template::value_type>, typename _Allocator = allocator::value_type>, typename = _RequireInputIter<_InputIterator>, typename = _RequireNotAllocator<_Compare>, typename = _RequireAllocator<_Allocator>> \fBmultiset\fP (_InputIterator, _InputIterator, _Compare=_Compare(), _Allocator=_Allocator()) \-> \fBmultiset\fP< typename \fBiterator_traits\fP< _InputIterator >::value_type, _Compare, _Allocator >" .br .ti -1c .RI "template> \fBmultiset\fP (\fBinitializer_list\fP< _Key >, _Allocator) \-> \fBmultiset\fP< _Key, \fBless\fP< _Key >, _Allocator >" .br .ti -1c .RI "template, typename _Allocator = allocator<_Key>, typename = _RequireNotAllocator<_Compare>, typename = _RequireAllocator<_Allocator>> \fBmultiset\fP (\fBinitializer_list\fP< _Key >, _Compare=_Compare(), _Allocator=_Allocator()) \-> \fBmultiset\fP< _Key, _Compare, _Allocator >" .br .ti -1c .RI "template bool \fBoperator!=\fP (const \fBdeque\fP< _Tp, _Alloc > &__lhs, const \fBdeque\fP< _Tp, _Alloc > &__rhs)" .br .ti -1c .RI "template bool \fBoperator!=\fP (const \fBforward_list\fP< _Tp, _Alloc > &__lx, const \fBforward_list\fP< _Tp, _Alloc > &__ly)" .br .ti -1c .RI "template bool \fBoperator!=\fP (const \fBlist\fP< _Tp, _Alloc > &__lhs, const \fBlist\fP< _Tp, _Alloc > &__rhs)" .br .ti -1c .RI "template bool \fBoperator!=\fP (const \fBmap\fP< _Key, _Tp, _Compare, _Allocator > &__lhs, const \fBmap\fP< _Key, _Tp, _Compare, _Allocator > &__rhs)" .br .ti -1c .RI "template bool \fBoperator!=\fP (const \fBmultimap\fP< _Key, _Tp, _Compare, _Allocator > &__lhs, const \fBmultimap\fP< _Key, _Tp, _Compare, _Allocator > &__rhs)" .br .ti -1c .RI "template bool \fBoperator!=\fP (const \fBmultiset\fP< _Key, _Compare, _Allocator > &__lhs, const \fBmultiset\fP< _Key, _Compare, _Allocator > &__rhs)" .br .ti -1c .RI "template bool \fBoperator!=\fP (const \fBset\fP< _Key, _Compare, _Allocator > &__lhs, const \fBset\fP< _Key, _Compare, _Allocator > &__rhs)" .br .ti -1c .RI "template bool \fBoperator!=\fP (const \fBvector\fP< _Tp, _Alloc > &__lhs, const \fBvector\fP< _Tp, _Alloc > &__rhs)" .br .ti -1c .RI "template \fBbitset\fP< _Nb > \fBoperator&\fP (const \fBbitset\fP< _Nb > &__x, const \fBbitset\fP< _Nb > &__y) noexcept" .br .ti -1c .RI "template bool \fBoperator<\fP (const \fBdeque\fP< _Tp, _Alloc > &__lhs, const \fBdeque\fP< _Tp, _Alloc > &__rhs)" .br .ti -1c .RI "template bool \fBoperator<\fP (const \fBforward_list\fP< _Tp, _Alloc > &__lx, const \fBforward_list\fP< _Tp, _Alloc > &__ly)" .br .ti -1c .RI "template bool \fBoperator<\fP (const \fBlist\fP< _Tp, _Alloc > &__lhs, const \fBlist\fP< _Tp, _Alloc > &__rhs)" .br .ti -1c .RI "template bool \fBoperator<\fP (const \fBmap\fP< _Key, _Tp, _Compare, _Allocator > &__lhs, const \fBmap\fP< _Key, _Tp, _Compare, _Allocator > &__rhs)" .br .ti -1c .RI "template bool \fBoperator<\fP (const \fBmultimap\fP< _Key, _Tp, _Compare, _Allocator > &__lhs, const \fBmultimap\fP< _Key, _Tp, _Compare, _Allocator > &__rhs)" .br .ti -1c .RI "template bool \fBoperator<\fP (const \fBmultiset\fP< _Key, _Compare, _Allocator > &__lhs, const \fBmultiset\fP< _Key, _Compare, _Allocator > &__rhs)" .br .ti -1c .RI "template bool \fBoperator<\fP (const \fBset\fP< _Key, _Compare, _Allocator > &__lhs, const \fBset\fP< _Key, _Compare, _Allocator > &__rhs)" .br .ti -1c .RI "template bool \fBoperator<\fP (const \fBvector\fP< _Tp, _Alloc > &__lhs, const \fBvector\fP< _Tp, _Alloc > &__rhs)" .br .ti -1c .RI "template \fBstd::basic_ostream\fP< _CharT, _Traits > & \fBoperator<<\fP (\fBstd::basic_ostream\fP< _CharT, _Traits > &__os, const \fBbitset\fP< _Nb > &__x)" .br .ti -1c .RI "template bool \fBoperator<=\fP (const \fBdeque\fP< _Tp, _Alloc > &__lhs, const \fBdeque\fP< _Tp, _Alloc > &__rhs)" .br .ti -1c .RI "template bool \fBoperator<=\fP (const \fBforward_list\fP< _Tp, _Alloc > &__lx, const \fBforward_list\fP< _Tp, _Alloc > &__ly)" .br .RI "Based on operator<\&. " .ti -1c .RI "template bool \fBoperator<=\fP (const \fBlist\fP< _Tp, _Alloc > &__lhs, const \fBlist\fP< _Tp, _Alloc > &__rhs)" .br .ti -1c .RI "template bool \fBoperator<=\fP (const \fBmap\fP< _Key, _Tp, _Compare, _Allocator > &__lhs, const \fBmap\fP< _Key, _Tp, _Compare, _Allocator > &__rhs)" .br .ti -1c .RI "template bool \fBoperator<=\fP (const \fBmultimap\fP< _Key, _Tp, _Compare, _Allocator > &__lhs, const \fBmultimap\fP< _Key, _Tp, _Compare, _Allocator > &__rhs)" .br .ti -1c .RI "template bool \fBoperator<=\fP (const \fBmultiset\fP< _Key, _Compare, _Allocator > &__lhs, const \fBmultiset\fP< _Key, _Compare, _Allocator > &__rhs)" .br .ti -1c .RI "template bool \fBoperator<=\fP (const \fBset\fP< _Key, _Compare, _Allocator > &__lhs, const \fBset\fP< _Key, _Compare, _Allocator > &__rhs)" .br .ti -1c .RI "template bool \fBoperator<=\fP (const \fBvector\fP< _Tp, _Alloc > &__lhs, const \fBvector\fP< _Tp, _Alloc > &__rhs)" .br .ti -1c .RI "template bool \fBoperator==\fP (const \fBdeque\fP< _Tp, _Alloc > &__lhs, const \fBdeque\fP< _Tp, _Alloc > &__rhs)" .br .ti -1c .RI "template bool \fBoperator==\fP (const \fBforward_list\fP< _Tp, _Alloc > &__lx, const \fBforward_list\fP< _Tp, _Alloc > &__ly)" .br .ti -1c .RI "template bool \fBoperator==\fP (const \fBlist\fP< _Tp, _Alloc > &__lhs, const \fBlist\fP< _Tp, _Alloc > &__rhs)" .br .ti -1c .RI "template bool \fBoperator==\fP (const \fBmap\fP< _Key, _Tp, _Compare, _Allocator > &__lhs, const \fBmap\fP< _Key, _Tp, _Compare, _Allocator > &__rhs)" .br .ti -1c .RI "template bool \fBoperator==\fP (const \fBmultimap\fP< _Key, _Tp, _Compare, _Allocator > &__lhs, const \fBmultimap\fP< _Key, _Tp, _Compare, _Allocator > &__rhs)" .br .ti -1c .RI "template bool \fBoperator==\fP (const \fBmultiset\fP< _Key, _Compare, _Allocator > &__lhs, const \fBmultiset\fP< _Key, _Compare, _Allocator > &__rhs)" .br .ti -1c .RI "template bool \fBoperator==\fP (const \fBset\fP< _Key, _Compare, _Allocator > &__lhs, const \fBset\fP< _Key, _Compare, _Allocator > &__rhs)" .br .ti -1c .RI "template bool \fBoperator==\fP (const \fBunordered_map\fP< _Key, _Tp, _Hash, _Pred, _Alloc > &__x, const \fBunordered_map\fP< _Key, _Tp, _Hash, _Pred, _Alloc > &__y)" .br .ti -1c .RI "template bool \fBoperator==\fP (const \fBunordered_multimap\fP< _Key, _Tp, _Hash, _Pred, _Alloc > &__x, const \fBunordered_multimap\fP< _Key, _Tp, _Hash, _Pred, _Alloc > &__y)" .br .ti -1c .RI "template bool \fBoperator==\fP (const \fBunordered_multiset\fP< _Value, _Hash, _Pred, _Alloc > &__x, const \fBunordered_multiset\fP< _Value, _Hash, _Pred, _Alloc > &__y)" .br .ti -1c .RI "template bool \fBoperator==\fP (const \fBunordered_set\fP< _Value, _Hash, _Pred, _Alloc > &__x, const \fBunordered_set\fP< _Value, _Hash, _Pred, _Alloc > &__y)" .br .ti -1c .RI "template bool \fBoperator==\fP (const \fBvector\fP< _Tp, _Alloc > &__lhs, const \fBvector\fP< _Tp, _Alloc > &__rhs)" .br .ti -1c .RI "template bool \fBoperator>\fP (const \fBdeque\fP< _Tp, _Alloc > &__lhs, const \fBdeque\fP< _Tp, _Alloc > &__rhs)" .br .ti -1c .RI "template bool \fBoperator>\fP (const \fBforward_list\fP< _Tp, _Alloc > &__lx, const \fBforward_list\fP< _Tp, _Alloc > &__ly)" .br .RI "Based on operator<\&. " .ti -1c .RI "template bool \fBoperator>\fP (const \fBlist\fP< _Tp, _Alloc > &__lhs, const \fBlist\fP< _Tp, _Alloc > &__rhs)" .br .ti -1c .RI "template bool \fBoperator>\fP (const \fBmap\fP< _Key, _Tp, _Compare, _Allocator > &__lhs, const \fBmap\fP< _Key, _Tp, _Compare, _Allocator > &__rhs)" .br .ti -1c .RI "template bool \fBoperator>\fP (const \fBmultimap\fP< _Key, _Tp, _Compare, _Allocator > &__lhs, const \fBmultimap\fP< _Key, _Tp, _Compare, _Allocator > &__rhs)" .br .ti -1c .RI "template bool \fBoperator>\fP (const \fBmultiset\fP< _Key, _Compare, _Allocator > &__lhs, const \fBmultiset\fP< _Key, _Compare, _Allocator > &__rhs)" .br .ti -1c .RI "template bool \fBoperator>\fP (const \fBset\fP< _Key, _Compare, _Allocator > &__lhs, const \fBset\fP< _Key, _Compare, _Allocator > &__rhs)" .br .ti -1c .RI "template bool \fBoperator>\fP (const \fBvector\fP< _Tp, _Alloc > &__lhs, const \fBvector\fP< _Tp, _Alloc > &__rhs)" .br .ti -1c .RI "template bool \fBoperator>=\fP (const \fBdeque\fP< _Tp, _Alloc > &__lhs, const \fBdeque\fP< _Tp, _Alloc > &__rhs)" .br .ti -1c .RI "template bool \fBoperator>=\fP (const \fBforward_list\fP< _Tp, _Alloc > &__lx, const \fBforward_list\fP< _Tp, _Alloc > &__ly)" .br .RI "Based on operator<\&. " .ti -1c .RI "template bool \fBoperator>=\fP (const \fBlist\fP< _Tp, _Alloc > &__lhs, const \fBlist\fP< _Tp, _Alloc > &__rhs)" .br .ti -1c .RI "template bool \fBoperator>=\fP (const \fBmap\fP< _Key, _Tp, _Compare, _Allocator > &__lhs, const \fBmap\fP< _Key, _Tp, _Compare, _Allocator > &__rhs)" .br .ti -1c .RI "template bool \fBoperator>=\fP (const \fBmultimap\fP< _Key, _Tp, _Compare, _Allocator > &__lhs, const \fBmultimap\fP< _Key, _Tp, _Compare, _Allocator > &__rhs)" .br .ti -1c .RI "template bool \fBoperator>=\fP (const \fBmultiset\fP< _Key, _Compare, _Allocator > &__lhs, const \fBmultiset\fP< _Key, _Compare, _Allocator > &__rhs)" .br .ti -1c .RI "template bool \fBoperator>=\fP (const \fBset\fP< _Key, _Compare, _Allocator > &__lhs, const \fBset\fP< _Key, _Compare, _Allocator > &__rhs)" .br .ti -1c .RI "template bool \fBoperator>=\fP (const \fBvector\fP< _Tp, _Alloc > &__lhs, const \fBvector\fP< _Tp, _Alloc > &__rhs)" .br .ti -1c .RI "template \fBstd::basic_istream\fP< _CharT, _Traits > & \fBoperator>>\fP (\fBstd::basic_istream\fP< _CharT, _Traits > &__is, \fBbitset\fP< _Nb > &__x)" .br .ti -1c .RI "template \fBbitset\fP< _Nb > \fBoperator^\fP (const \fBbitset\fP< _Nb > &__x, const \fBbitset\fP< _Nb > &__y) noexcept" .br .ti -1c .RI "template \fBbitset\fP< _Nb > \fBoperator|\fP (const \fBbitset\fP< _Nb > &__x, const \fBbitset\fP< _Nb > &__y) noexcept" .br .ti -1c .RI "template, typename = _RequireAllocator<_Allocator>> \fBset\fP (_InputIterator, _InputIterator, _Allocator) \-> \fBset\fP< typename \fBiterator_traits\fP< _InputIterator >::value_type, \fBless\fP< typename \fBiterator_traits\fP< _InputIterator >::value_type >, _Allocator >" .br .ti -1c .RI "template::value_type>, typename _Allocator = allocator::value_type>, typename = _RequireInputIter<_InputIterator>, typename = _RequireNotAllocator<_Compare>, typename = _RequireAllocator<_Allocator>> \fBset\fP (_InputIterator, _InputIterator, _Compare=_Compare(), _Allocator=_Allocator()) \-> \fBset\fP< typename \fBiterator_traits\fP< _InputIterator >::value_type, _Compare, _Allocator >" .br .ti -1c .RI "template> \fBset\fP (\fBinitializer_list\fP< _Key >, _Allocator) \-> \fBset\fP< _Key, \fBless\fP< _Key >, _Allocator >" .br .ti -1c .RI "template, typename _Allocator = allocator<_Key>, typename = _RequireNotAllocator<_Compare>, typename = _RequireAllocator<_Allocator>> \fBset\fP (\fBinitializer_list\fP< _Key >, _Compare=_Compare(), _Allocator=_Allocator()) \-> \fBset\fP< _Key, _Compare, _Allocator >" .br .ti -1c .RI "template void \fBswap\fP (\fBdeque\fP< _Tp, _Alloc > &__lhs, \fBdeque\fP< _Tp, _Alloc > &__rhs) noexcept(/*\fBconditional\fP */)" .br .ti -1c .RI "template void \fBswap\fP (\fBforward_list\fP< _Tp, _Alloc > &__lx, \fBforward_list\fP< _Tp, _Alloc > &__ly) noexcept(noexcept(__lx\&.swap(__ly)))" .br .RI "See std::forward_list::swap()\&. " .ti -1c .RI "template void \fBswap\fP (\fBlist\fP< _Tp, _Alloc > &__lhs, \fBlist\fP< _Tp, _Alloc > &__rhs) noexcept(/*\fBconditional\fP */)" .br .ti -1c .RI "template void \fBswap\fP (\fBmap\fP< _Key, _Tp, _Compare, _Allocator > &__lhs, \fBmap\fP< _Key, _Tp, _Compare, _Allocator > &__rhs) noexcept(/*\fBconditional\fP */)" .br .ti -1c .RI "template void \fBswap\fP (\fBmultimap\fP< _Key, _Tp, _Compare, _Allocator > &__lhs, \fBmultimap\fP< _Key, _Tp, _Compare, _Allocator > &__rhs) noexcept(/*\fBconditional\fP */)" .br .ti -1c .RI "template void \fBswap\fP (\fBmultiset\fP< _Key, _Compare, _Allocator > &__x, \fBmultiset\fP< _Key, _Compare, _Allocator > &__y) noexcept(/*\fBconditional\fP */)" .br .ti -1c .RI "template void \fBswap\fP (\fBset\fP< _Key, _Compare, _Allocator > &__x, \fBset\fP< _Key, _Compare, _Allocator > &__y) noexcept(/*\fBconditional\fP */)" .br .ti -1c .RI "template void \fBswap\fP (\fBunordered_map\fP< _Key, _Tp, _Hash, _Pred, _Alloc > &__x, \fBunordered_map\fP< _Key, _Tp, _Hash, _Pred, _Alloc > &__y) noexcept(noexcept(__x\&.swap(__y)))" .br .ti -1c .RI "template void \fBswap\fP (\fBunordered_multimap\fP< _Key, _Tp, _Hash, _Pred, _Alloc > &__x, \fBunordered_multimap\fP< _Key, _Tp, _Hash, _Pred, _Alloc > &__y) noexcept(noexcept(__x\&.swap(__y)))" .br .ti -1c .RI "template void \fBswap\fP (\fBunordered_multiset\fP< _Value, _Hash, _Pred, _Alloc > &__x, \fBunordered_multiset\fP< _Value, _Hash, _Pred, _Alloc > &__y) noexcept(noexcept(__x\&.swap(__y)))" .br .ti -1c .RI "template void \fBswap\fP (\fBunordered_set\fP< _Value, _Hash, _Pred, _Alloc > &__x, \fBunordered_set\fP< _Value, _Hash, _Pred, _Alloc > &__y) noexcept(noexcept(__x\&.swap(__y)))" .br .ti -1c .RI "template void \fBswap\fP (\fBvector\fP< _Tp, _Alloc > &__lhs, \fBvector\fP< _Tp, _Alloc > &__rhs) noexcept(/*\fBconditional\fP */)" .br .ti -1c .RI "template, typename = _RequireAllocator<_Allocator>> \fBunordered_map\fP (_InputIterator, _InputIterator, _Allocator) \-> \fBunordered_map\fP< __iter_key_t< _InputIterator >, __iter_val_t< _InputIterator >, \fBhash\fP< __iter_key_t< _InputIterator > >, \fBequal_to\fP< __iter_key_t< _InputIterator > >, _Allocator >" .br .ti -1c .RI "template, typename = _RequireAllocator<_Allocator>> \fBunordered_map\fP (_InputIterator, _InputIterator, typename \fBunordered_map\fP< int, int >::size_type, _Allocator) \-> \fBunordered_map\fP< __iter_key_t< _InputIterator >, __iter_val_t< _InputIterator >, \fBhash\fP< __iter_key_t< _InputIterator > >, \fBequal_to\fP< __iter_key_t< _InputIterator > >, _Allocator >" .br .ti -1c .RI "template, typename = _RequireNotAllocatorOrIntegral<_Hash>, typename = _RequireAllocator<_Allocator>> \fBunordered_map\fP (_InputIterator, _InputIterator, typename \fBunordered_map\fP< int, int >::size_type, _Hash, _Allocator) \-> \fBunordered_map\fP< __iter_key_t< _InputIterator >, __iter_val_t< _InputIterator >, _Hash, \fBequal_to\fP< __iter_key_t< _InputIterator > >, _Allocator >" .br .ti -1c .RI "template>, typename _Pred = equal_to<__iter_key_t<_InputIterator>>, typename _Allocator = allocator<__iter_to_alloc_t<_InputIterator>>, typename = _RequireInputIter<_InputIterator>, typename = _RequireNotAllocatorOrIntegral<_Hash>, typename = _RequireNotAllocator<_Pred>, typename = _RequireAllocator<_Allocator>> \fBunordered_map\fP (_InputIterator, _InputIterator, typename \fBunordered_map\fP< int, int >::size_type={}, _Hash=_Hash(), _Pred=_Pred(), _Allocator=_Allocator()) \-> \fBunordered_map\fP< __iter_key_t< _InputIterator >, __iter_val_t< _InputIterator >, _Hash, _Pred, _Allocator >" .br .ti -1c .RI "template> \fBunordered_map\fP (\fBinitializer_list\fP< \fBpair\fP< _Key, _Tp > >, _Allocator) \-> \fBunordered_map\fP< _Key, _Tp, \fBhash\fP< _Key >, \fBequal_to\fP< _Key >, _Allocator >" .br .ti -1c .RI "template> \fBunordered_map\fP (\fBinitializer_list\fP< \fBpair\fP< _Key, _Tp > >, typename \fBunordered_map\fP< int, int >::size_type, _Allocator) \-> \fBunordered_map\fP< _Key, _Tp, \fBhash\fP< _Key >, \fBequal_to\fP< _Key >, _Allocator >" .br .ti -1c .RI "template, typename = _RequireAllocator<_Allocator>> \fBunordered_map\fP (\fBinitializer_list\fP< \fBpair\fP< _Key, _Tp > >, typename \fBunordered_map\fP< int, int >::size_type, _Hash, _Allocator) \-> \fBunordered_map\fP< _Key, _Tp, _Hash, \fBequal_to\fP< _Key >, _Allocator >" .br .ti -1c .RI "template, typename _Pred = equal_to<_Key>, typename _Allocator = allocator>, typename = _RequireNotAllocatorOrIntegral<_Hash>, typename = _RequireNotAllocator<_Pred>, typename = _RequireAllocator<_Allocator>> \fBunordered_map\fP (\fBinitializer_list\fP< \fBpair\fP< _Key, _Tp > >, typename \fBunordered_map\fP< int, int >::size_type={}, _Hash=_Hash(), _Pred=_Pred(), _Allocator=_Allocator()) \-> \fBunordered_map\fP< _Key, _Tp, _Hash, _Pred, _Allocator >" .br .ti -1c .RI "template, typename = _RequireAllocator<_Allocator>> \fBunordered_multimap\fP (_InputIterator, _InputIterator, _Allocator) \-> \fBunordered_multimap\fP< __iter_key_t< _InputIterator >, __iter_val_t< _InputIterator >, \fBhash\fP< __iter_key_t< _InputIterator > >, \fBequal_to\fP< __iter_key_t< _InputIterator > >, _Allocator >" .br .ti -1c .RI "template, typename = _RequireAllocator<_Allocator>> \fBunordered_multimap\fP (_InputIterator, _InputIterator, \fBunordered_multimap\fP< int, int >::size_type, _Allocator) \-> \fBunordered_multimap\fP< __iter_key_t< _InputIterator >, __iter_val_t< _InputIterator >, \fBhash\fP< __iter_key_t< _InputIterator > >, \fBequal_to\fP< __iter_key_t< _InputIterator > >, _Allocator >" .br .ti -1c .RI "template, typename = _RequireNotAllocatorOrIntegral<_Hash>, typename = _RequireAllocator<_Allocator>> \fBunordered_multimap\fP (_InputIterator, _InputIterator, \fBunordered_multimap\fP< int, int >::size_type, _Hash, _Allocator) \-> \fBunordered_multimap\fP< __iter_key_t< _InputIterator >, __iter_val_t< _InputIterator >, _Hash, \fBequal_to\fP< __iter_key_t< _InputIterator > >, _Allocator >" .br .ti -1c .RI "template>, typename _Pred = equal_to<__iter_key_t<_InputIterator>>, typename _Allocator = allocator<__iter_to_alloc_t<_InputIterator>>, typename = _RequireInputIter<_InputIterator>, typename = _RequireNotAllocatorOrIntegral<_Hash>, typename = _RequireNotAllocator<_Pred>, typename = _RequireAllocator<_Allocator>> \fBunordered_multimap\fP (_InputIterator, _InputIterator, \fBunordered_multimap\fP< int, int >::size_type={}, _Hash=_Hash(), _Pred=_Pred(), _Allocator=_Allocator()) \-> \fBunordered_multimap\fP< __iter_key_t< _InputIterator >, __iter_val_t< _InputIterator >, _Hash, _Pred, _Allocator >" .br .ti -1c .RI "template> \fBunordered_multimap\fP (\fBinitializer_list\fP< \fBpair\fP< _Key, _Tp > >, _Allocator) \-> \fBunordered_multimap\fP< _Key, _Tp, \fBhash\fP< _Key >, \fBequal_to\fP< _Key >, _Allocator >" .br .ti -1c .RI "template> \fBunordered_multimap\fP (\fBinitializer_list\fP< \fBpair\fP< _Key, _Tp > >, \fBunordered_multimap\fP< int, int >::size_type, _Allocator) \-> \fBunordered_multimap\fP< _Key, _Tp, \fBhash\fP< _Key >, \fBequal_to\fP< _Key >, _Allocator >" .br .ti -1c .RI "template, typename = _RequireAllocator<_Allocator>> \fBunordered_multimap\fP (\fBinitializer_list\fP< \fBpair\fP< _Key, _Tp > >, \fBunordered_multimap\fP< int, int >::size_type, _Hash, _Allocator) \-> \fBunordered_multimap\fP< _Key, _Tp, _Hash, \fBequal_to\fP< _Key >, _Allocator >" .br .ti -1c .RI "template, typename _Pred = equal_to<_Key>, typename _Allocator = allocator>, typename = _RequireNotAllocatorOrIntegral<_Hash>, typename = _RequireNotAllocator<_Pred>, typename = _RequireAllocator<_Allocator>> \fBunordered_multimap\fP (\fBinitializer_list\fP< \fBpair\fP< _Key, _Tp > >, \fBunordered_multimap\fP< int, int >::size_type={}, _Hash=_Hash(), _Pred=_Pred(), _Allocator=_Allocator()) \-> \fBunordered_multimap\fP< _Key, _Tp, _Hash, _Pred, _Allocator >" .br .ti -1c .RI "template, typename = _RequireAllocator<_Allocator>> \fBunordered_multiset\fP (_InputIterator, _InputIterator, \fBunordered_multiset\fP< int >::size_type, _Allocator) \-> \fBunordered_multiset\fP< typename \fBiterator_traits\fP< _InputIterator >::value_type, \fBhash\fP< typename \fBiterator_traits\fP< _InputIterator >::value_type >, \fBequal_to\fP< typename \fBiterator_traits\fP< _InputIterator >::value_type >, _Allocator >" .br .ti -1c .RI "template, typename = _RequireNotAllocatorOrIntegral<_Hash>, typename = _RequireAllocator<_Allocator>> \fBunordered_multiset\fP (_InputIterator, _InputIterator, \fBunordered_multiset\fP< int >::size_type, _Hash, _Allocator) \-> \fBunordered_multiset\fP< typename \fBiterator_traits\fP< _InputIterator >::value_type, _Hash, \fBequal_to\fP< typename \fBiterator_traits\fP< _InputIterator >::value_type >, _Allocator >" .br .ti -1c .RI "template::value_type>, typename _Pred = equal_to::value_type>, typename _Allocator = allocator::value_type>, typename = _RequireInputIter<_InputIterator>, typename = _RequireNotAllocatorOrIntegral<_Hash>, typename = _RequireNotAllocator<_Pred>, typename = _RequireAllocator<_Allocator>> \fBunordered_multiset\fP (_InputIterator, _InputIterator, \fBunordered_multiset\fP< int >::size_type={}, _Hash=_Hash(), _Pred=_Pred(), _Allocator=_Allocator()) \-> \fBunordered_multiset\fP< typename \fBiterator_traits\fP< _InputIterator >::value_type, _Hash, _Pred, _Allocator >" .br .ti -1c .RI "template> \fBunordered_multiset\fP (\fBinitializer_list\fP< _Tp >, \fBunordered_multiset\fP< int >::size_type, _Allocator) \-> \fBunordered_multiset\fP< _Tp, \fBhash\fP< _Tp >, \fBequal_to\fP< _Tp >, _Allocator >" .br .ti -1c .RI "template, typename = _RequireAllocator<_Allocator>> \fBunordered_multiset\fP (\fBinitializer_list\fP< _Tp >, \fBunordered_multiset\fP< int >::size_type, _Hash, _Allocator) \-> \fBunordered_multiset\fP< _Tp, _Hash, \fBequal_to\fP< _Tp >, _Allocator >" .br .ti -1c .RI "template, typename _Pred = equal_to<_Tp>, typename _Allocator = allocator<_Tp>, typename = _RequireNotAllocatorOrIntegral<_Hash>, typename = _RequireNotAllocator<_Pred>, typename = _RequireAllocator<_Allocator>> \fBunordered_multiset\fP (\fBinitializer_list\fP< _Tp >, \fBunordered_multiset\fP< int >::size_type={}, _Hash=_Hash(), _Pred=_Pred(), _Allocator=_Allocator()) \-> \fBunordered_multiset\fP< _Tp, _Hash, _Pred, _Allocator >" .br .ti -1c .RI "template, typename = _RequireAllocator<_Allocator>> \fBunordered_set\fP (_InputIterator, _InputIterator, \fBunordered_set\fP< int >::size_type, _Allocator) \-> \fBunordered_set\fP< typename \fBiterator_traits\fP< _InputIterator >::value_type, \fBhash\fP< typename \fBiterator_traits\fP< _InputIterator >::value_type >, \fBequal_to\fP< typename \fBiterator_traits\fP< _InputIterator >::value_type >, _Allocator >" .br .ti -1c .RI "template, typename = _RequireNotAllocatorOrIntegral<_Hash>, typename = _RequireAllocator<_Allocator>> \fBunordered_set\fP (_InputIterator, _InputIterator, \fBunordered_set\fP< int >::size_type, _Hash, _Allocator) \-> \fBunordered_set\fP< typename \fBiterator_traits\fP< _InputIterator >::value_type, _Hash, \fBequal_to\fP< typename \fBiterator_traits\fP< _InputIterator >::value_type >, _Allocator >" .br .ti -1c .RI "template::value_type>, typename _Pred = equal_to::value_type>, typename _Allocator = allocator::value_type>, typename = _RequireInputIter<_InputIterator>, typename = _RequireNotAllocatorOrIntegral<_Hash>, typename = _RequireNotAllocator<_Pred>, typename = _RequireAllocator<_Allocator>> \fBunordered_set\fP (_InputIterator, _InputIterator, \fBunordered_set\fP< int >::size_type={}, _Hash=_Hash(), _Pred=_Pred(), _Allocator=_Allocator()) \-> \fBunordered_set\fP< typename \fBiterator_traits\fP< _InputIterator >::value_type, _Hash, _Pred, _Allocator >" .br .ti -1c .RI "template> \fBunordered_set\fP (\fBinitializer_list\fP< _Tp >, \fBunordered_set\fP< int >::size_type, _Allocator) \-> \fBunordered_set\fP< _Tp, \fBhash\fP< _Tp >, \fBequal_to\fP< _Tp >, _Allocator >" .br .ti -1c .RI "template, typename = _RequireAllocator<_Allocator>> \fBunordered_set\fP (\fBinitializer_list\fP< _Tp >, \fBunordered_set\fP< int >::size_type, _Hash, _Allocator) \-> \fBunordered_set\fP< _Tp, _Hash, \fBequal_to\fP< _Tp >, _Allocator >" .br .ti -1c .RI "template, typename _Pred = equal_to<_Tp>, typename _Allocator = allocator<_Tp>, typename = _RequireNotAllocatorOrIntegral<_Hash>, typename = _RequireNotAllocator<_Pred>, typename = _RequireAllocator<_Allocator>> \fBunordered_set\fP (\fBinitializer_list\fP< _Tp >, \fBunordered_set\fP< int >::size_type={}, _Hash=_Hash(), _Pred=_Pred(), _Allocator=_Allocator()) \-> \fBunordered_set\fP< _Tp, _Hash, _Pred, _Allocator >" .br .ti -1c .RI "template::value_type, typename _Allocator = allocator<_ValT>, typename = _RequireInputIter<_InputIterator>, typename = _RequireAllocator<_Allocator>> \fBvector\fP (_InputIterator, _InputIterator, _Allocator=_Allocator()) \-> \fBvector\fP< _ValT, _Allocator >" .br .ti -1c .RI "template, typename = _RequireAllocator<_Allocator>> \fBvector\fP (size_t, _Tp, _Allocator=_Allocator()) \-> \fBvector\fP< _Tp, _Allocator >" .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 bool std::__debug::operator!= (const \fBdeque\fP< _Tp, _Alloc > & __lhs, const \fBdeque\fP< _Tp, _Alloc > & __rhs)\fC [inline]\fP" .PP Definition at line \fB684\fP of file \fBdebug/deque\fP\&. .SS "template bool std::__debug::operator!= (const \fBforward_list\fP< _Tp, _Alloc > & __lx, const \fBforward_list\fP< _Tp, _Alloc > & __ly)\fC [inline]\fP" .PP Definition at line \fB884\fP of file \fBdebug/forward_list\fP\&. .SS "template bool std::__debug::operator!= (const \fBlist\fP< _Tp, _Alloc > & __lhs, const \fBlist\fP< _Tp, _Alloc > & __rhs)\fC [inline]\fP" .PP Definition at line \fB937\fP of file \fBdebug/list\fP\&. .SS "template bool std::__debug::operator!= (const \fBmap\fP< _Key, _Tp, _Compare, _Allocator > & __lhs, const \fBmap\fP< _Key, _Tp, _Compare, _Allocator > & __rhs)\fC [inline]\fP" .PP Definition at line \fB762\fP of file \fBmap\&.h\fP\&. .SS "template bool std::__debug::operator!= (const \fBmultimap\fP< _Key, _Tp, _Compare, _Allocator > & __lhs, const \fBmultimap\fP< _Key, _Tp, _Compare, _Allocator > & __rhs)\fC [inline]\fP" .PP Definition at line \fB644\fP of file \fBmultimap\&.h\fP\&. .SS "template bool std::__debug::operator!= (const \fBmultiset\fP< _Key, _Compare, _Allocator > & __lhs, const \fBmultiset\fP< _Key, _Compare, _Allocator > & __rhs)\fC [inline]\fP" .PP Definition at line \fB614\fP of file \fBmultiset\&.h\fP\&. .SS "template bool std::__debug::operator!= (const \fBset\fP< _Key, _Compare, _Allocator > & __lhs, const \fBset\fP< _Key, _Compare, _Allocator > & __rhs)\fC [inline]\fP" .PP Definition at line \fB624\fP of file \fBset\&.h\fP\&. .SS "template bool std::__debug::operator!= (const \fBvector\fP< _Tp, _Alloc > & __lhs, const \fBvector\fP< _Tp, _Alloc > & __rhs)\fC [inline]\fP" .PP Definition at line \fB762\fP of file \fBdebug/vector\fP\&. .SS "template \fBbitset\fP< _Nb > std::__debug::operator& (const \fBbitset\fP< _Nb > & __x, const \fBbitset\fP< _Nb > & __y)\fC [noexcept]\fP" .PP Definition at line \fB388\fP of file \fBdebug/bitset\fP\&. .SS "template bool std::__debug::operator< (const \fBdeque\fP< _Tp, _Alloc > & __lhs, const \fBdeque\fP< _Tp, _Alloc > & __rhs)\fC [inline]\fP" .PP Definition at line \fB689\fP of file \fBdebug/deque\fP\&. .SS "template bool std::__debug::operator< (const \fBforward_list\fP< _Tp, _Alloc > & __lx, const \fBforward_list\fP< _Tp, _Alloc > & __ly)\fC [inline]\fP" .PP Definition at line \fB877\fP of file \fBdebug/forward_list\fP\&. .SS "template bool std::__debug::operator< (const \fBlist\fP< _Tp, _Alloc > & __lhs, const \fBlist\fP< _Tp, _Alloc > & __rhs)\fC [inline]\fP" .PP Definition at line \fB942\fP of file \fBdebug/list\fP\&. .SS "template bool std::__debug::operator< (const \fBmap\fP< _Key, _Tp, _Compare, _Allocator > & __lhs, const \fBmap\fP< _Key, _Tp, _Compare, _Allocator > & __rhs)\fC [inline]\fP" .PP Definition at line \fB768\fP of file \fBmap\&.h\fP\&. .SS "template bool std::__debug::operator< (const \fBmultimap\fP< _Key, _Tp, _Compare, _Allocator > & __lhs, const \fBmultimap\fP< _Key, _Tp, _Compare, _Allocator > & __rhs)\fC [inline]\fP" .PP Definition at line \fB650\fP of file \fBmultimap\&.h\fP\&. .SS "template bool std::__debug::operator< (const \fBmultiset\fP< _Key, _Compare, _Allocator > & __lhs, const \fBmultiset\fP< _Key, _Compare, _Allocator > & __rhs)\fC [inline]\fP" .PP Definition at line \fB619\fP of file \fBmultiset\&.h\fP\&. .SS "template bool std::__debug::operator< (const \fBset\fP< _Key, _Compare, _Allocator > & __lhs, const \fBset\fP< _Key, _Compare, _Allocator > & __rhs)\fC [inline]\fP" .PP Definition at line \fB629\fP of file \fBset\&.h\fP\&. .SS "template bool std::__debug::operator< (const \fBvector\fP< _Tp, _Alloc > & __lhs, const \fBvector\fP< _Tp, _Alloc > & __rhs)\fC [inline]\fP" .PP Definition at line \fB767\fP of file \fBdebug/vector\fP\&. .SS "template \fBstd::basic_ostream\fP< _CharT, _Traits > & std::__debug::operator<< (\fBstd::basic_ostream\fP< _CharT, _Traits > & __os, const \fBbitset\fP< _Nb > & __x)" .PP Definition at line \fB403\fP of file \fBdebug/bitset\fP\&. .SS "template bool std::__debug::operator<= (const \fBdeque\fP< _Tp, _Alloc > & __lhs, const \fBdeque\fP< _Tp, _Alloc > & __rhs)\fC [inline]\fP" .PP Definition at line \fB695\fP of file \fBdebug/deque\fP\&. .SS "template bool std::__debug::operator<= (const \fBforward_list\fP< _Tp, _Alloc > & __lx, const \fBforward_list\fP< _Tp, _Alloc > & __ly)\fC [inline]\fP" .PP Based on operator<\&. .PP Definition at line \fB904\fP of file \fBdebug/forward_list\fP\&. .SS "template bool std::__debug::operator<= (const \fBlist\fP< _Tp, _Alloc > & __lhs, const \fBlist\fP< _Tp, _Alloc > & __rhs)\fC [inline]\fP" .PP Definition at line \fB948\fP of file \fBdebug/list\fP\&. .SS "template bool std::__debug::operator<= (const \fBmap\fP< _Key, _Tp, _Compare, _Allocator > & __lhs, const \fBmap\fP< _Key, _Tp, _Compare, _Allocator > & __rhs)\fC [inline]\fP" .PP Definition at line \fB775\fP of file \fBmap\&.h\fP\&. .SS "template bool std::__debug::operator<= (const \fBmultimap\fP< _Key, _Tp, _Compare, _Allocator > & __lhs, const \fBmultimap\fP< _Key, _Tp, _Compare, _Allocator > & __rhs)\fC [inline]\fP" .PP Definition at line \fB657\fP of file \fBmultimap\&.h\fP\&. .SS "template bool std::__debug::operator<= (const \fBmultiset\fP< _Key, _Compare, _Allocator > & __lhs, const \fBmultiset\fP< _Key, _Compare, _Allocator > & __rhs)\fC [inline]\fP" .PP Definition at line \fB625\fP of file \fBmultiset\&.h\fP\&. .SS "template bool std::__debug::operator<= (const \fBset\fP< _Key, _Compare, _Allocator > & __lhs, const \fBset\fP< _Key, _Compare, _Allocator > & __rhs)\fC [inline]\fP" .PP Definition at line \fB635\fP of file \fBset\&.h\fP\&. .SS "template bool std::__debug::operator<= (const \fBvector\fP< _Tp, _Alloc > & __lhs, const \fBvector\fP< _Tp, _Alloc > & __rhs)\fC [inline]\fP" .PP Definition at line \fB773\fP of file \fBdebug/vector\fP\&. .SS "template bool std::__debug::operator== (const \fBdeque\fP< _Tp, _Alloc > & __lhs, const \fBdeque\fP< _Tp, _Alloc > & __rhs)\fC [inline]\fP" .PP Definition at line \fB672\fP of file \fBdebug/deque\fP\&. .SS "template bool std::__debug::operator== (const \fBforward_list\fP< _Tp, _Alloc > & __lx, const \fBforward_list\fP< _Tp, _Alloc > & __ly)" .PP Definition at line \fB865\fP of file \fBdebug/forward_list\fP\&. .SS "template bool std::__debug::operator== (const \fBlist\fP< _Tp, _Alloc > & __lhs, const \fBlist\fP< _Tp, _Alloc > & __rhs)\fC [inline]\fP" .PP Definition at line \fB925\fP of file \fBdebug/list\fP\&. .SS "template bool std::__debug::operator== (const \fBmap\fP< _Key, _Tp, _Compare, _Allocator > & __lhs, const \fBmap\fP< _Key, _Tp, _Compare, _Allocator > & __rhs)\fC [inline]\fP" .PP Definition at line \fB748\fP of file \fBmap\&.h\fP\&. .SS "template bool std::__debug::operator== (const \fBmultimap\fP< _Key, _Tp, _Compare, _Allocator > & __lhs, const \fBmultimap\fP< _Key, _Tp, _Compare, _Allocator > & __rhs)\fC [inline]\fP" .PP Definition at line \fB630\fP of file \fBmultimap\&.h\fP\&. .SS "template bool std::__debug::operator== (const \fBmultiset\fP< _Key, _Compare, _Allocator > & __lhs, const \fBmultiset\fP< _Key, _Compare, _Allocator > & __rhs)\fC [inline]\fP" .PP Definition at line \fB601\fP of file \fBmultiset\&.h\fP\&. .SS "template bool std::__debug::operator== (const \fBset\fP< _Key, _Compare, _Allocator > & __lhs, const \fBset\fP< _Key, _Compare, _Allocator > & __rhs)\fC [inline]\fP" .PP Definition at line \fB611\fP of file \fBset\&.h\fP\&. .SS "template bool std::__debug::operator== (const \fBunordered_map\fP< _Key, _Tp, _Hash, _Pred, _Alloc > & __x, const \fBunordered_map\fP< _Key, _Tp, _Hash, _Pred, _Alloc > & __y)\fC [inline]\fP" .PP Definition at line \fB855\fP of file \fBdebug/unordered_map\fP\&. .SS "template bool std::__debug::operator== (const \fBunordered_multimap\fP< _Key, _Tp, _Hash, _Pred, _Alloc > & __x, const \fBunordered_multimap\fP< _Key, _Tp, _Hash, _Pred, _Alloc > & __y)\fC [inline]\fP" .PP Definition at line \fB1572\fP of file \fBdebug/unordered_map\fP\&. .SS "template bool std::__debug::operator== (const \fBunordered_multiset\fP< _Value, _Hash, _Pred, _Alloc > & __x, const \fBunordered_multiset\fP< _Value, _Hash, _Pred, _Alloc > & __y)\fC [inline]\fP" .PP Definition at line \fB1400\fP of file \fBdebug/unordered_set\fP\&. .SS "template bool std::__debug::operator== (const \fBunordered_set\fP< _Value, _Hash, _Pred, _Alloc > & __x, const \fBunordered_set\fP< _Value, _Hash, _Pred, _Alloc > & __y)\fC [inline]\fP" .PP Definition at line \fB723\fP of file \fBdebug/unordered_set\fP\&. .SS "template bool std::__debug::operator== (const \fBvector\fP< _Tp, _Alloc > & __lhs, const \fBvector\fP< _Tp, _Alloc > & __rhs)\fC [inline]\fP" .PP Definition at line \fB750\fP of file \fBdebug/vector\fP\&. .SS "template bool std::__debug::operator> (const \fBdeque\fP< _Tp, _Alloc > & __lhs, const \fBdeque\fP< _Tp, _Alloc > & __rhs)\fC [inline]\fP" .PP Definition at line \fB708\fP of file \fBdebug/deque\fP\&. .SS "template bool std::__debug::operator> (const \fBforward_list\fP< _Tp, _Alloc > & __lx, const \fBforward_list\fP< _Tp, _Alloc > & __ly)\fC [inline]\fP" .PP Based on operator<\&. .PP Definition at line \fB891\fP of file \fBdebug/forward_list\fP\&. .SS "template bool std::__debug::operator> (const \fBlist\fP< _Tp, _Alloc > & __lhs, const \fBlist\fP< _Tp, _Alloc > & __rhs)\fC [inline]\fP" .PP Definition at line \fB961\fP of file \fBdebug/list\fP\&. .SS "template bool std::__debug::operator> (const \fBmap\fP< _Key, _Tp, _Compare, _Allocator > & __lhs, const \fBmap\fP< _Key, _Tp, _Compare, _Allocator > & __rhs)\fC [inline]\fP" .PP Definition at line \fB790\fP of file \fBmap\&.h\fP\&. .SS "template bool std::__debug::operator> (const \fBmultimap\fP< _Key, _Tp, _Compare, _Allocator > & __lhs, const \fBmultimap\fP< _Key, _Tp, _Compare, _Allocator > & __rhs)\fC [inline]\fP" .PP Definition at line \fB672\fP of file \fBmultimap\&.h\fP\&. .SS "template bool std::__debug::operator> (const \fBmultiset\fP< _Key, _Compare, _Allocator > & __lhs, const \fBmultiset\fP< _Key, _Compare, _Allocator > & __rhs)\fC [inline]\fP" .PP Definition at line \fB638\fP of file \fBmultiset\&.h\fP\&. .SS "template bool std::__debug::operator> (const \fBset\fP< _Key, _Compare, _Allocator > & __lhs, const \fBset\fP< _Key, _Compare, _Allocator > & __rhs)\fC [inline]\fP" .PP Definition at line \fB648\fP of file \fBset\&.h\fP\&. .SS "template bool std::__debug::operator> (const \fBvector\fP< _Tp, _Alloc > & __lhs, const \fBvector\fP< _Tp, _Alloc > & __rhs)\fC [inline]\fP" .PP Definition at line \fB786\fP of file \fBdebug/vector\fP\&. .SS "template bool std::__debug::operator>= (const \fBdeque\fP< _Tp, _Alloc > & __lhs, const \fBdeque\fP< _Tp, _Alloc > & __rhs)\fC [inline]\fP" .PP Definition at line \fB702\fP of file \fBdebug/deque\fP\&. .SS "template bool std::__debug::operator>= (const \fBforward_list\fP< _Tp, _Alloc > & __lx, const \fBforward_list\fP< _Tp, _Alloc > & __ly)\fC [inline]\fP" .PP Based on operator<\&. .PP Definition at line \fB898\fP of file \fBdebug/forward_list\fP\&. .SS "template bool std::__debug::operator>= (const \fBlist\fP< _Tp, _Alloc > & __lhs, const \fBlist\fP< _Tp, _Alloc > & __rhs)\fC [inline]\fP" .PP Definition at line \fB955\fP of file \fBdebug/list\fP\&. .SS "template bool std::__debug::operator>= (const \fBmap\fP< _Key, _Tp, _Compare, _Allocator > & __lhs, const \fBmap\fP< _Key, _Tp, _Compare, _Allocator > & __rhs)\fC [inline]\fP" .PP Definition at line \fB783\fP of file \fBmap\&.h\fP\&. .SS "template bool std::__debug::operator>= (const \fBmultimap\fP< _Key, _Tp, _Compare, _Allocator > & __lhs, const \fBmultimap\fP< _Key, _Tp, _Compare, _Allocator > & __rhs)\fC [inline]\fP" .PP Definition at line \fB665\fP of file \fBmultimap\&.h\fP\&. .SS "template bool std::__debug::operator>= (const \fBmultiset\fP< _Key, _Compare, _Allocator > & __lhs, const \fBmultiset\fP< _Key, _Compare, _Allocator > & __rhs)\fC [inline]\fP" .PP Definition at line \fB632\fP of file \fBmultiset\&.h\fP\&. .SS "template bool std::__debug::operator>= (const \fBset\fP< _Key, _Compare, _Allocator > & __lhs, const \fBset\fP< _Key, _Compare, _Allocator > & __rhs)\fC [inline]\fP" .PP Definition at line \fB642\fP of file \fBset\&.h\fP\&. .SS "template bool std::__debug::operator>= (const \fBvector\fP< _Tp, _Alloc > & __lhs, const \fBvector\fP< _Tp, _Alloc > & __rhs)\fC [inline]\fP" .PP Definition at line \fB780\fP of file \fBdebug/vector\fP\&. .SS "template \fBstd::basic_istream\fP< _CharT, _Traits > & std::__debug::operator>> (\fBstd::basic_istream\fP< _CharT, _Traits > & __is, \fBbitset\fP< _Nb > & __x)" .PP Definition at line \fB403\fP of file \fBdebug/bitset\fP\&. .SS "template \fBbitset\fP< _Nb > std::__debug::operator^ (const \fBbitset\fP< _Nb > & __x, const \fBbitset\fP< _Nb > & __y)\fC [noexcept]\fP" .PP Definition at line \fB398\fP of file \fBdebug/bitset\fP\&. .SS "template \fBbitset\fP< _Nb > std::__debug::operator| (const \fBbitset\fP< _Nb > & __x, const \fBbitset\fP< _Nb > & __y)\fC [noexcept]\fP" .PP Definition at line \fB393\fP of file \fBdebug/bitset\fP\&. .SS "template void std::__debug::swap (\fBdeque\fP< _Tp, _Alloc > & __lhs, \fBdeque\fP< _Tp, _Alloc > & __rhs)\fC [inline]\fP, \fC [noexcept]\fP" .PP Definition at line \fB715\fP of file \fBdebug/deque\fP\&. .SS "template void std::__debug::swap (\fBforward_list\fP< _Tp, _Alloc > & __lx, \fBforward_list\fP< _Tp, _Alloc > & __ly)\fC [inline]\fP, \fC [noexcept]\fP" .PP See std::forward_list::swap()\&. .PP Definition at line \fB913\fP of file \fBdebug/forward_list\fP\&. .SS "template void std::__debug::swap (\fBlist\fP< _Tp, _Alloc > & __lhs, \fBlist\fP< _Tp, _Alloc > & __rhs)\fC [inline]\fP, \fC [noexcept]\fP" .PP Definition at line \fB968\fP of file \fBdebug/list\fP\&. .SS "template void std::__debug::swap (\fBmap\fP< _Key, _Tp, _Compare, _Allocator > & __lhs, \fBmap\fP< _Key, _Tp, _Compare, _Allocator > & __rhs)\fC [inline]\fP, \fC [noexcept]\fP" .PP Definition at line \fB798\fP of file \fBmap\&.h\fP\&. .SS "template void std::__debug::swap (\fBmultimap\fP< _Key, _Tp, _Compare, _Allocator > & __lhs, \fBmultimap\fP< _Key, _Tp, _Compare, _Allocator > & __rhs)\fC [inline]\fP, \fC [noexcept]\fP" .PP Definition at line \fB680\fP of file \fBmultimap\&.h\fP\&. .SS "template void std::__debug::swap (\fBmultiset\fP< _Key, _Compare, _Allocator > & __x, \fBmultiset\fP< _Key, _Compare, _Allocator > & __y)\fC [noexcept]\fP" .PP Definition at line \fB645\fP of file \fBmultiset\&.h\fP\&. .SS "template void std::__debug::swap (\fBset\fP< _Key, _Compare, _Allocator > & __x, \fBset\fP< _Key, _Compare, _Allocator > & __y)\fC [noexcept]\fP" .PP Definition at line \fB655\fP of file \fBset\&.h\fP\&. .SS "template void std::__debug::swap (\fBunordered_map\fP< _Key, _Tp, _Hash, _Pred, _Alloc > & __x, \fBunordered_map\fP< _Key, _Tp, _Hash, _Pred, _Alloc > & __y)\fC [inline]\fP, \fC [noexcept]\fP" .PP Definition at line \fB847\fP of file \fBdebug/unordered_map\fP\&. .SS "template void std::__debug::swap (\fBunordered_multimap\fP< _Key, _Tp, _Hash, _Pred, _Alloc > & __x, \fBunordered_multimap\fP< _Key, _Tp, _Hash, _Pred, _Alloc > & __y)\fC [inline]\fP, \fC [noexcept]\fP" .PP Definition at line \fB1564\fP of file \fBdebug/unordered_map\fP\&. .SS "template void std::__debug::swap (\fBunordered_multiset\fP< _Value, _Hash, _Pred, _Alloc > & __x, \fBunordered_multiset\fP< _Value, _Hash, _Pred, _Alloc > & __y)\fC [inline]\fP, \fC [noexcept]\fP" .PP Definition at line \fB1393\fP of file \fBdebug/unordered_set\fP\&. .SS "template void std::__debug::swap (\fBunordered_set\fP< _Value, _Hash, _Pred, _Alloc > & __x, \fBunordered_set\fP< _Value, _Hash, _Pred, _Alloc > & __y)\fC [inline]\fP, \fC [noexcept]\fP" .PP Definition at line \fB716\fP of file \fBdebug/unordered_set\fP\&. .SS "template void std::__debug::swap (\fBvector\fP< _Tp, _Alloc > & __lhs, \fBvector\fP< _Tp, _Alloc > & __rhs)\fC [inline]\fP, \fC [noexcept]\fP" .PP Definition at line \fB793\fP of file \fBdebug/vector\fP\&. .SH "Author" .PP Generated automatically by Doxygen for libstdc++ from the source code\&.