.TH "std::__debug" 3 "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<typename _InputIterator, typename _ValT = typename iterator_traits<_InputIterator>::value_type, typename _Allocator = allocator<_ValT>, typename = _RequireInputIter<_InputIterator>, typename = _RequireAllocator<_Allocator>> \fBdeque\fP (_InputIterator, _InputIterator, _Allocator=_Allocator()) \-> deque< _ValT, _Allocator >"
.br
.ti -1c
.RI "template<typename _Tp, typename _Allocator = allocator<_Tp>, typename = _RequireAllocator<_Allocator>> \fBdeque\fP (size_t, _Tp, _Allocator=_Allocator()) \-> deque< _Tp, _Allocator >"
.br
.ti -1c
.RI "template<typename _InputIterator, typename _ValT = typename iterator_traits<_InputIterator>::value_type, typename _Allocator = allocator<_ValT>, typename = _RequireInputIter<_InputIterator>, typename = _RequireAllocator<_Allocator>> \fBforward_list\fP (_InputIterator, _InputIterator, _Allocator=_Allocator()) \-> forward_list< _ValT, _Allocator >"
.br
.ti -1c
.RI "template<typename _Tp, typename _Allocator = allocator<_Tp>, typename = _RequireAllocator<_Allocator>> \fBforward_list\fP (size_t, _Tp, _Allocator=_Allocator()) \-> forward_list< _Tp, _Allocator >"
.br
.ti -1c
.RI "template<typename _InputIterator, typename _ValT = typename iterator_traits<_InputIterator>::value_type, typename _Allocator = allocator<_ValT>, typename = _RequireInputIter<_InputIterator>, typename = _RequireAllocator<_Allocator>> \fBlist\fP (_InputIterator, _InputIterator, _Allocator=_Allocator()) \-> list< _ValT, _Allocator >"
.br
.ti -1c
.RI "template<typename _Tp, typename _Allocator = allocator<_Tp>, typename = _RequireAllocator<_Allocator>> \fBlist\fP (size_t, _Tp, _Allocator=_Allocator()) \-> list< _Tp, _Allocator >"
.br
.ti -1c
.RI "template<typename _InputIterator, typename _Allocator, typename = _RequireInputIter<_InputIterator>, typename = _RequireAllocator<_Allocator>> \fBmap\fP (_InputIterator, _InputIterator, _Allocator) \-> map< __iter_key_t< _InputIterator >, __iter_val_t< _InputIterator >, \fBless\fP< __iter_key_t< _InputIterator > >, _Allocator >"
.br
.ti -1c
.RI "template<typename _InputIterator, typename _Compare = less<__iter_key_t<_InputIterator>>, 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()) \-> map< __iter_key_t< _InputIterator >, __iter_val_t< _InputIterator >, _Compare, _Allocator >"
.br
.ti -1c
.RI "template<typename _Key, typename _Tp, typename _Allocator, typename = _RequireAllocator<_Allocator>> \fBmap\fP (\fBinitializer_list\fP< \fBpair\fP< _Key, _Tp > >, _Allocator) \-> map< _Key, _Tp, \fBless\fP< _Key >, _Allocator >"
.br
.ti -1c
.RI "template<typename _Key, typename _Tp, typename _Compare = less<_Key>, typename _Allocator = allocator<pair<const _Key, _Tp>>, typename = _RequireNotAllocator<_Compare>, typename = _RequireAllocator<_Allocator>> \fBmap\fP (\fBinitializer_list\fP< \fBpair\fP< _Key, _Tp > >, _Compare=_Compare(), _Allocator=_Allocator()) \-> map< _Key, _Tp, _Compare, _Allocator >"
.br
.ti -1c
.RI "template<typename _InputIterator, typename _Allocator, typename = _RequireInputIter<_InputIterator>, typename = _RequireAllocator<_Allocator>> \fBmultimap\fP (_InputIterator, _InputIterator, _Allocator) \-> multimap< __iter_key_t< _InputIterator >, __iter_val_t< _InputIterator >, \fBless\fP< __iter_key_t< _InputIterator > >, _Allocator >"
.br
.ti -1c
.RI "template<typename _InputIterator, typename _Compare = less<__iter_key_t<_InputIterator>>, 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()) \-> multimap< __iter_key_t< _InputIterator >, __iter_val_t< _InputIterator >, _Compare, _Allocator >"
.br
.ti -1c
.RI "template<typename _Key, typename _Tp, typename _Allocator, typename = _RequireAllocator<_Allocator>> \fBmultimap\fP (\fBinitializer_list\fP< \fBpair\fP< _Key, _Tp > >, _Allocator) \-> multimap< _Key, _Tp, \fBless\fP< _Key >, _Allocator >"
.br
.ti -1c
.RI "template<typename _Key, typename _Tp, typename _Compare = less<_Key>, typename _Allocator = allocator<pair<const _Key, _Tp>>, typename = _RequireNotAllocator<_Compare>, typename = _RequireAllocator<_Allocator>> \fBmultimap\fP (\fBinitializer_list\fP< \fBpair\fP< _Key, _Tp > >, _Compare=_Compare(), _Allocator=_Allocator()) \-> multimap< _Key, _Tp, _Compare, _Allocator >"
.br
.ti -1c
.RI "template<typename _InputIterator, typename _Allocator, typename = _RequireInputIter<_InputIterator>, typename = _RequireAllocator<_Allocator>> \fBmultiset\fP (_InputIterator, _InputIterator, _Allocator) \-> multiset< typename \fBiterator_traits\fP< _InputIterator >\fB::value_type\fP, \fBless\fP< typename \fBiterator_traits\fP< _InputIterator >\fB::value_type\fP >, _Allocator >"
.br
.ti -1c
.RI "template<typename _InputIterator, typename _Compare = less<typename iterator_traits<_InputIterator>::value_type>, typename _Allocator = allocator<typename iterator_traits<_InputIterator>::value_type>, typename = _RequireInputIter<_InputIterator>, typename = _RequireNotAllocator<_Compare>, typename = _RequireAllocator<_Allocator>> \fBmultiset\fP (_InputIterator, _InputIterator, _Compare=_Compare(), _Allocator=_Allocator()) \-> multiset< typename \fBiterator_traits\fP< _InputIterator >\fB::value_type\fP, _Compare, _Allocator >"
.br
.ti -1c
.RI "template<typename _Key, typename _Allocator, typename = _RequireAllocator<_Allocator>> \fBmultiset\fP (\fBinitializer_list\fP< _Key >, _Allocator) \-> multiset< _Key, \fBless\fP< _Key >, _Allocator >"
.br
.ti -1c
.RI "template<typename _Key, typename _Compare = less<_Key>, typename _Allocator = allocator<_Key>, typename = _RequireNotAllocator<_Compare>, typename = _RequireAllocator<_Allocator>> \fBmultiset\fP (\fBinitializer_list\fP< _Key >, _Compare=_Compare(), _Allocator=_Allocator()) \-> multiset< _Key, _Compare, _Allocator >"
.br
.ti -1c
.RI "template<size_t _Nb> constexpr bitset< _Nb > \fBoperator&\fP (const bitset< _Nb > &__x, const bitset< _Nb > &__y) noexcept"
.br
.ti -1c
.RI "template<typename _CharT, typename _Traits, size_t _Nb> \fBstd::basic_ostream\fP< _CharT, _Traits > & \fBoperator<<\fP (\fBstd::basic_ostream\fP< _CharT, _Traits > &__os, const bitset< _Nb > &__x)"
.br
.ti -1c
.RI "template<typename _Tp, typename _Alloc> constexpr __detail::__synth3way_t< _Tp > \fBoperator<=>\fP (const deque< _Tp, _Alloc > &__x, const deque< _Tp, _Alloc > &__y)"
.br
.ti -1c
.RI "template<typename _Tp, typename _Alloc> constexpr __detail::__synth3way_t< _Tp > \fBoperator<=>\fP (const forward_list< _Tp, _Alloc > &__x, const forward_list< _Tp, _Alloc > &__y)"
.br
.ti -1c
.RI "template<typename _Tp, typename _Alloc> constexpr __detail::__synth3way_t< _Tp > \fBoperator<=>\fP (const list< _Tp, _Alloc > &__x, const list< _Tp, _Alloc > &__y)"
.br
.ti -1c
.RI "template<typename _Key, typename _Tp, typename _Compare, typename _Alloc> __detail::__synth3way_t< \fBpair\fP< const _Key, _Tp > > \fBoperator<=>\fP (const map< _Key, _Tp, _Compare, _Alloc > &__lhs, const map< _Key, _Tp, _Compare, _Alloc > &__rhs)"
.br
.ti -1c
.RI "template<typename _Key, typename _Tp, typename _Compare, typename _Alloc> __detail::__synth3way_t< \fBpair\fP< const _Key, _Tp > > \fBoperator<=>\fP (const multimap< _Key, _Tp, _Compare, _Alloc > &__lhs, const multimap< _Key, _Tp, _Compare, _Alloc > &__rhs)"
.br
.ti -1c
.RI "template<typename _Key, typename _Compare, typename _Alloc> __detail::__synth3way_t< _Key > \fBoperator<=>\fP (const multiset< _Key, _Compare, _Alloc > &__lhs, const multiset< _Key, _Compare, _Alloc > &__rhs)"
.br
.ti -1c
.RI "template<typename _Key, typename _Compare, typename _Alloc> __detail::__synth3way_t< _Key > \fBoperator<=>\fP (const set< _Key, _Compare, _Alloc > &__lhs, const set< _Key, _Compare, _Alloc > &__rhs)"
.br
.ti -1c
.RI "template<typename _Tp, typename _Alloc> constexpr __detail::__synth3way_t< _Tp > \fBoperator<=>\fP (const vector< _Tp, _Alloc > &__x, const vector< _Tp, _Alloc > &__y)"
.br
.ti -1c
.RI "template<typename _Tp, typename _Alloc> bool \fBoperator==\fP (const deque< _Tp, _Alloc > &__lhs, const deque< _Tp, _Alloc > &__rhs)"
.br
.ti -1c
.RI "template<typename _Tp, typename _Alloc> bool \fBoperator==\fP (const forward_list< _Tp, _Alloc > &__lx, const forward_list< _Tp, _Alloc > &__ly)"
.br
.ti -1c
.RI "template<typename _Tp, typename _Alloc> bool \fBoperator==\fP (const list< _Tp, _Alloc > &__lhs, const list< _Tp, _Alloc > &__rhs)"
.br
.ti -1c
.RI "template<typename _Key, typename _Tp, typename _Compare, typename _Allocator> bool \fBoperator==\fP (const map< _Key, _Tp, _Compare, _Allocator > &__lhs, const map< _Key, _Tp, _Compare, _Allocator > &__rhs)"
.br
.ti -1c
.RI "template<typename _Key, typename _Tp, typename _Compare, typename _Allocator> bool \fBoperator==\fP (const multimap< _Key, _Tp, _Compare, _Allocator > &__lhs, const multimap< _Key, _Tp, _Compare, _Allocator > &__rhs)"
.br
.ti -1c
.RI "template<typename _Key, typename _Compare, typename _Allocator> bool \fBoperator==\fP (const multiset< _Key, _Compare, _Allocator > &__lhs, const multiset< _Key, _Compare, _Allocator > &__rhs)"
.br
.ti -1c
.RI "template<typename _Key, typename _Compare, typename _Allocator> bool \fBoperator==\fP (const set< _Key, _Compare, _Allocator > &__lhs, const set< _Key, _Compare, _Allocator > &__rhs)"
.br
.ti -1c
.RI "template<typename _Key, typename _Tp, typename _Hash, typename _Pred, typename _Alloc> bool \fBoperator==\fP (const unordered_map< _Key, _Tp, _Hash, _Pred, _Alloc > &__x, const unordered_map< _Key, _Tp, _Hash, _Pred, _Alloc > &__y)"
.br
.ti -1c
.RI "template<typename _Key, typename _Tp, typename _Hash, typename _Pred, typename _Alloc> bool \fBoperator==\fP (const unordered_multimap< _Key, _Tp, _Hash, _Pred, _Alloc > &__x, const unordered_multimap< _Key, _Tp, _Hash, _Pred, _Alloc > &__y)"
.br
.ti -1c
.RI "template<typename _Value, typename _Hash, typename _Pred, typename _Alloc> bool \fBoperator==\fP (const unordered_multiset< _Value, _Hash, _Pred, _Alloc > &__x, const unordered_multiset< _Value, _Hash, _Pred, _Alloc > &__y)"
.br
.ti -1c
.RI "template<typename _Value, typename _Hash, typename _Pred, typename _Alloc> bool \fBoperator==\fP (const unordered_set< _Value, _Hash, _Pred, _Alloc > &__x, const unordered_set< _Value, _Hash, _Pred, _Alloc > &__y)"
.br
.ti -1c
.RI "template<typename _Tp, typename _Alloc> constexpr bool \fBoperator==\fP (const vector< _Tp, _Alloc > &__lhs, const vector< _Tp, _Alloc > &__rhs)"
.br
.ti -1c
.RI "template<typename _CharT, typename _Traits, size_t _Nb> \fBstd::basic_istream\fP< _CharT, _Traits > & \fBoperator>>\fP (\fBstd::basic_istream\fP< _CharT, _Traits > &__is, bitset< _Nb > &__x)"
.br
.ti -1c
.RI "template<size_t _Nb> constexpr bitset< _Nb > \fBoperator^\fP (const bitset< _Nb > &__x, const bitset< _Nb > &__y) noexcept"
.br
.ti -1c
.RI "template<size_t _Nb> constexpr bitset< _Nb > \fBoperator|\fP (const bitset< _Nb > &__x, const bitset< _Nb > &__y) noexcept"
.br
.ti -1c
.RI "template<typename _InputIterator, typename _Allocator, typename = _RequireInputIter<_InputIterator>, typename = _RequireAllocator<_Allocator>> \fBset\fP (_InputIterator, _InputIterator, _Allocator) \-> set< typename \fBiterator_traits\fP< _InputIterator >\fB::value_type\fP, \fBless\fP< typename \fBiterator_traits\fP< _InputIterator >\fB::value_type\fP >, _Allocator >"
.br
.ti -1c
.RI "template<typename _InputIterator, typename _Compare = less<typename iterator_traits<_InputIterator>::value_type>, typename _Allocator = allocator<typename iterator_traits<_InputIterator>::value_type>, typename = _RequireInputIter<_InputIterator>, typename = _RequireNotAllocator<_Compare>, typename = _RequireAllocator<_Allocator>> \fBset\fP (_InputIterator, _InputIterator, _Compare=_Compare(), _Allocator=_Allocator()) \-> set< typename \fBiterator_traits\fP< _InputIterator >\fB::value_type\fP, _Compare, _Allocator >"
.br
.ti -1c
.RI "template<typename _Key, typename _Allocator, typename = _RequireAllocator<_Allocator>> \fBset\fP (\fBinitializer_list\fP< _Key >, _Allocator) \-> set< _Key, \fBless\fP< _Key >, _Allocator >"
.br
.ti -1c
.RI "template<typename _Key, typename _Compare = less<_Key>, typename _Allocator = allocator<_Key>, typename = _RequireNotAllocator<_Compare>, typename = _RequireAllocator<_Allocator>> \fBset\fP (\fBinitializer_list\fP< _Key >, _Compare=_Compare(), _Allocator=_Allocator()) \-> set< _Key, _Compare, _Allocator >"
.br
.ti -1c
.RI "template<typename _Tp, typename _Alloc> void \fBswap\fP (deque< _Tp, _Alloc > &__lhs, deque< _Tp, _Alloc > &__rhs) noexcept(/*\fBconditional\fP */)"
.br
.ti -1c
.RI "template<typename _Tp, typename _Alloc> void \fBswap\fP (forward_list< _Tp, _Alloc > &__lx, forward_list< _Tp, _Alloc > &__ly) noexcept(noexcept(__lx\&.swap(__ly)))"
.br
.RI "See std::forward_list::swap()\&. "
.ti -1c
.RI "template<typename _Tp, typename _Alloc> void \fBswap\fP (list< _Tp, _Alloc > &__lhs, list< _Tp, _Alloc > &__rhs) noexcept(/*\fBconditional\fP */)"
.br
.ti -1c
.RI "template<typename _Key, typename _Tp, typename _Compare, typename _Allocator> void \fBswap\fP (map< _Key, _Tp, _Compare, _Allocator > &__lhs, map< _Key, _Tp, _Compare, _Allocator > &__rhs) noexcept(/*\fBconditional\fP */)"
.br
.ti -1c
.RI "template<typename _Key, typename _Tp, typename _Compare, typename _Allocator> void \fBswap\fP (multimap< _Key, _Tp, _Compare, _Allocator > &__lhs, multimap< _Key, _Tp, _Compare, _Allocator > &__rhs) noexcept(/*\fBconditional\fP */)"
.br
.ti -1c
.RI "template<typename _Key, typename _Compare, typename _Allocator> void \fBswap\fP (multiset< _Key, _Compare, _Allocator > &__x, multiset< _Key, _Compare, _Allocator > &__y) noexcept(/*\fBconditional\fP */)"
.br
.ti -1c
.RI "template<typename _Key, typename _Compare, typename _Allocator> void \fBswap\fP (set< _Key, _Compare, _Allocator > &__x, set< _Key, _Compare, _Allocator > &__y) noexcept(/*\fBconditional\fP */)"
.br
.ti -1c
.RI "template<typename _Key, typename _Tp, typename _Hash, typename _Pred, typename _Alloc> void \fBswap\fP (unordered_map< _Key, _Tp, _Hash, _Pred, _Alloc > &__x, unordered_map< _Key, _Tp, _Hash, _Pred, _Alloc > &__y) noexcept(noexcept(__x\&.swap(__y)))"
.br
.ti -1c
.RI "template<typename _Key, typename _Tp, typename _Hash, typename _Pred, typename _Alloc> void \fBswap\fP (unordered_multimap< _Key, _Tp, _Hash, _Pred, _Alloc > &__x, unordered_multimap< _Key, _Tp, _Hash, _Pred, _Alloc > &__y) noexcept(noexcept(__x\&.swap(__y)))"
.br
.ti -1c
.RI "template<typename _Value, typename _Hash, typename _Pred, typename _Alloc> void \fBswap\fP (unordered_multiset< _Value, _Hash, _Pred, _Alloc > &__x, unordered_multiset< _Value, _Hash, _Pred, _Alloc > &__y) noexcept(noexcept(__x\&.swap(__y)))"
.br
.ti -1c
.RI "template<typename _Value, typename _Hash, typename _Pred, typename _Alloc> void \fBswap\fP (unordered_set< _Value, _Hash, _Pred, _Alloc > &__x, unordered_set< _Value, _Hash, _Pred, _Alloc > &__y) noexcept(noexcept(__x\&.swap(__y)))"
.br
.ti -1c
.RI "template<typename _Tp, typename _Alloc> constexpr void \fBswap\fP (vector< _Tp, _Alloc > &__lhs, vector< _Tp, _Alloc > &__rhs) noexcept(/*\fBconditional\fP */)"
.br
.ti -1c
.RI "template<typename _InputIterator, typename _Allocator, typename = _RequireInputIter<_InputIterator>, typename = _RequireAllocator<_Allocator>> \fBunordered_map\fP (_InputIterator, _InputIterator, _Allocator) \-> unordered_map< __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 _InputIterator, typename _Allocator, typename = _RequireInputIter<_InputIterator>, typename = _RequireAllocator<_Allocator>> \fBunordered_map\fP (_InputIterator, _InputIterator, typename unordered_map< int, int >\fB::size_type\fP, _Allocator) \-> unordered_map< __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 _InputIterator, typename _Hash, typename _Allocator, typename = _RequireInputIter<_InputIterator>, typename = _RequireNotAllocatorOrIntegral<_Hash>, typename = _RequireAllocator<_Allocator>> \fBunordered_map\fP (_InputIterator, _InputIterator, typename unordered_map< int, int >\fB::size_type\fP, _Hash, _Allocator) \-> unordered_map< __iter_key_t< _InputIterator >, __iter_val_t< _InputIterator >, _Hash, \fBequal_to\fP< __iter_key_t< _InputIterator > >, _Allocator >"
.br
.ti -1c
.RI "template<typename _InputIterator, typename _Hash = hash<__iter_key_t<_InputIterator>>, 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 unordered_map< int, int >\fB::size_type\fP={}, _Hash=_Hash(), _Pred=_Pred(), _Allocator=_Allocator()) \-> unordered_map< __iter_key_t< _InputIterator >, __iter_val_t< _InputIterator >, _Hash, _Pred, _Allocator >"
.br
.ti -1c
.RI "template<typename _Key, typename _Tp, typename _Allocator, typename = _RequireAllocator<_Allocator>> \fBunordered_map\fP (\fBinitializer_list\fP< \fBpair\fP< _Key, _Tp > >, _Allocator) \-> unordered_map< _Key, _Tp, \fBhash\fP< _Key >, \fBequal_to\fP< _Key >, _Allocator >"
.br
.ti -1c
.RI "template<typename _Key, typename _Tp, typename _Allocator, typename = _RequireAllocator<_Allocator>> \fBunordered_map\fP (\fBinitializer_list\fP< \fBpair\fP< _Key, _Tp > >, typename unordered_map< int, int >\fB::size_type\fP, _Allocator) \-> unordered_map< _Key, _Tp, \fBhash\fP< _Key >, \fBequal_to\fP< _Key >, _Allocator >"
.br
.ti -1c
.RI "template<typename _Key, typename _Tp, typename _Hash, typename _Allocator, typename = _RequireNotAllocatorOrIntegral<_Hash>, typename = _RequireAllocator<_Allocator>> \fBunordered_map\fP (\fBinitializer_list\fP< \fBpair\fP< _Key, _Tp > >, typename unordered_map< int, int >\fB::size_type\fP, _Hash, _Allocator) \-> unordered_map< _Key, _Tp, _Hash, \fBequal_to\fP< _Key >, _Allocator >"
.br
.ti -1c
.RI "template<typename _Key, typename _Tp, typename _Hash = hash<_Key>, typename _Pred = equal_to<_Key>, typename _Allocator = allocator<pair<const _Key, _Tp>>, typename = _RequireNotAllocatorOrIntegral<_Hash>, typename = _RequireNotAllocator<_Pred>, typename = _RequireAllocator<_Allocator>> \fBunordered_map\fP (\fBinitializer_list\fP< \fBpair\fP< _Key, _Tp > >, typename unordered_map< int, int >\fB::size_type\fP={}, _Hash=_Hash(), _Pred=_Pred(), _Allocator=_Allocator()) \-> unordered_map< _Key, _Tp, _Hash, _Pred, _Allocator >"
.br
.ti -1c
.RI "template<typename _InputIterator, typename _Allocator, typename = _RequireInputIter<_InputIterator>, typename = _RequireAllocator<_Allocator>> \fBunordered_multimap\fP (_InputIterator, _InputIterator, _Allocator) \-> unordered_multimap< __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 _InputIterator, typename _Allocator, typename = _RequireInputIter<_InputIterator>, typename = _RequireAllocator<_Allocator>> \fBunordered_multimap\fP (_InputIterator, _InputIterator, unordered_multimap< int, int >\fB::size_type\fP, _Allocator) \-> unordered_multimap< __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 _InputIterator, typename _Hash, typename _Allocator, typename = _RequireInputIter<_InputIterator>, typename = _RequireNotAllocatorOrIntegral<_Hash>, typename = _RequireAllocator<_Allocator>> \fBunordered_multimap\fP (_InputIterator, _InputIterator, unordered_multimap< int, int >\fB::size_type\fP, _Hash, _Allocator) \-> unordered_multimap< __iter_key_t< _InputIterator >, __iter_val_t< _InputIterator >, _Hash, \fBequal_to\fP< __iter_key_t< _InputIterator > >, _Allocator >"
.br
.ti -1c
.RI "template<typename _InputIterator, typename _Hash = hash<__iter_key_t<_InputIterator>>, 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, unordered_multimap< int, int >\fB::size_type\fP={}, _Hash=_Hash(), _Pred=_Pred(), _Allocator=_Allocator()) \-> unordered_multimap< __iter_key_t< _InputIterator >, __iter_val_t< _InputIterator >, _Hash, _Pred, _Allocator >"
.br
.ti -1c
.RI "template<typename _Key, typename _Tp, typename _Allocator, typename = _RequireAllocator<_Allocator>> \fBunordered_multimap\fP (\fBinitializer_list\fP< \fBpair\fP< _Key, _Tp > >, _Allocator) \-> unordered_multimap< _Key, _Tp, \fBhash\fP< _Key >, \fBequal_to\fP< _Key >, _Allocator >"
.br
.ti -1c
.RI "template<typename _Key, typename _Tp, typename _Allocator, typename = _RequireAllocator<_Allocator>> \fBunordered_multimap\fP (\fBinitializer_list\fP< \fBpair\fP< _Key, _Tp > >, unordered_multimap< int, int >\fB::size_type\fP, _Allocator) \-> unordered_multimap< _Key, _Tp, \fBhash\fP< _Key >, \fBequal_to\fP< _Key >, _Allocator >"
.br
.ti -1c
.RI "template<typename _Key, typename _Tp, typename _Hash, typename _Allocator, typename = _RequireNotAllocatorOrIntegral<_Hash>, typename = _RequireAllocator<_Allocator>> \fBunordered_multimap\fP (\fBinitializer_list\fP< \fBpair\fP< _Key, _Tp > >, unordered_multimap< int, int >\fB::size_type\fP, _Hash, _Allocator) \-> unordered_multimap< _Key, _Tp, _Hash, \fBequal_to\fP< _Key >, _Allocator >"
.br
.ti -1c
.RI "template<typename _Key, typename _Tp, typename _Hash = hash<_Key>, typename _Pred = equal_to<_Key>, typename _Allocator = allocator<pair<const _Key, _Tp>>, typename = _RequireNotAllocatorOrIntegral<_Hash>, typename = _RequireNotAllocator<_Pred>, typename = _RequireAllocator<_Allocator>> \fBunordered_multimap\fP (\fBinitializer_list\fP< \fBpair\fP< _Key, _Tp > >, unordered_multimap< int, int >\fB::size_type\fP={}, _Hash=_Hash(), _Pred=_Pred(), _Allocator=_Allocator()) \-> unordered_multimap< _Key, _Tp, _Hash, _Pred, _Allocator >"
.br
.ti -1c
.RI "template<typename _InputIterator, typename _Allocator, typename = _RequireInputIter<_InputIterator>, typename = _RequireAllocator<_Allocator>> \fBunordered_multiset\fP (_InputIterator, _InputIterator, _Allocator) \-> unordered_multiset< typename \fBiterator_traits\fP< _InputIterator >\fB::value_type\fP, \fBhash\fP< typename \fBiterator_traits\fP< _InputIterator >\fB::value_type\fP >, \fBequal_to\fP< typename \fBiterator_traits\fP< _InputIterator >\fB::value_type\fP >, _Allocator >"
.br
.ti -1c
.RI "template<typename _InputIterator, typename _Allocator, typename = _RequireInputIter<_InputIterator>, typename = _RequireAllocator<_Allocator>> \fBunordered_multiset\fP (_InputIterator, _InputIterator, unordered_multiset< int >\fB::size_type\fP, _Allocator) \-> unordered_multiset< typename \fBiterator_traits\fP< _InputIterator >\fB::value_type\fP, \fBhash\fP< typename \fBiterator_traits\fP< _InputIterator >\fB::value_type\fP >, \fBequal_to\fP< typename \fBiterator_traits\fP< _InputIterator >\fB::value_type\fP >, _Allocator >"
.br
.ti -1c
.RI "template<typename _InputIterator, typename _Hash, typename _Allocator, typename = _RequireInputIter<_InputIterator>, typename = _RequireNotAllocatorOrIntegral<_Hash>, typename = _RequireAllocator<_Allocator>> \fBunordered_multiset\fP (_InputIterator, _InputIterator, unordered_multiset< int >\fB::size_type\fP, _Hash, _Allocator) \-> unordered_multiset< typename \fBiterator_traits\fP< _InputIterator >\fB::value_type\fP, _Hash, \fBequal_to\fP< typename \fBiterator_traits\fP< _InputIterator >\fB::value_type\fP >, _Allocator >"
.br
.ti -1c
.RI "template<typename _InputIterator, typename _Hash = hash<typename iterator_traits<_InputIterator>::value_type>, typename _Pred = equal_to<typename iterator_traits<_InputIterator>::value_type>, typename _Allocator = allocator<typename iterator_traits<_InputIterator>::value_type>, typename = _RequireInputIter<_InputIterator>, typename = _RequireNotAllocatorOrIntegral<_Hash>, typename = _RequireNotAllocator<_Pred>, typename = _RequireAllocator<_Allocator>> \fBunordered_multiset\fP (_InputIterator, _InputIterator, unordered_multiset< int >\fB::size_type\fP={}, _Hash=_Hash(), _Pred=_Pred(), _Allocator=_Allocator()) \-> unordered_multiset< typename \fBiterator_traits\fP< _InputIterator >\fB::value_type\fP, _Hash, _Pred, _Allocator >"
.br
.ti -1c
.RI "template<typename _Tp, typename _Allocator, typename = _RequireAllocator<_Allocator>> \fBunordered_multiset\fP (\fBinitializer_list\fP< _Tp >, _Allocator) \-> unordered_multiset< _Tp, \fBhash\fP< _Tp >, \fBequal_to\fP< _Tp >, _Allocator >"
.br
.ti -1c
.RI "template<typename _Tp, typename _Allocator, typename = _RequireAllocator<_Allocator>> \fBunordered_multiset\fP (\fBinitializer_list\fP< _Tp >, unordered_multiset< int >\fB::size_type\fP, _Allocator) \-> unordered_multiset< _Tp, \fBhash\fP< _Tp >, \fBequal_to\fP< _Tp >, _Allocator >"
.br
.ti -1c
.RI "template<typename _Tp, typename _Hash, typename _Allocator, typename = _RequireNotAllocatorOrIntegral<_Hash>, typename = _RequireAllocator<_Allocator>> \fBunordered_multiset\fP (\fBinitializer_list\fP< _Tp >, unordered_multiset< int >\fB::size_type\fP, _Hash, _Allocator) \-> unordered_multiset< _Tp, _Hash, \fBequal_to\fP< _Tp >, _Allocator >"
.br
.ti -1c
.RI "template<typename _Tp, typename _Hash = hash<_Tp>, 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 >, unordered_multiset< int >\fB::size_type\fP={}, _Hash=_Hash(), _Pred=_Pred(), _Allocator=_Allocator()) \-> unordered_multiset< _Tp, _Hash, _Pred, _Allocator >"
.br
.ti -1c
.RI "template<typename _InputIterator, typename _Allocator, typename = _RequireInputIter<_InputIterator>, typename = _RequireAllocator<_Allocator>> \fBunordered_set\fP (_InputIterator, _InputIterator, _Allocator) \-> unordered_set< typename \fBiterator_traits\fP< _InputIterator >\fB::value_type\fP, \fBhash\fP< typename \fBiterator_traits\fP< _InputIterator >\fB::value_type\fP >, \fBequal_to\fP< typename \fBiterator_traits\fP< _InputIterator >\fB::value_type\fP >, _Allocator >"
.br
.ti -1c
.RI "template<typename _InputIterator, typename _Allocator, typename = _RequireInputIter<_InputIterator>, typename = _RequireAllocator<_Allocator>> \fBunordered_set\fP (_InputIterator, _InputIterator, unordered_set< int >\fB::size_type\fP, _Allocator) \-> unordered_set< typename \fBiterator_traits\fP< _InputIterator >\fB::value_type\fP, \fBhash\fP< typename \fBiterator_traits\fP< _InputIterator >\fB::value_type\fP >, \fBequal_to\fP< typename \fBiterator_traits\fP< _InputIterator >\fB::value_type\fP >, _Allocator >"
.br
.ti -1c
.RI "template<typename _InputIterator, typename _Hash, typename _Allocator, typename = _RequireInputIter<_InputIterator>, typename = _RequireNotAllocatorOrIntegral<_Hash>, typename = _RequireAllocator<_Allocator>> \fBunordered_set\fP (_InputIterator, _InputIterator, unordered_set< int >\fB::size_type\fP, _Hash, _Allocator) \-> unordered_set< typename \fBiterator_traits\fP< _InputIterator >\fB::value_type\fP, _Hash, \fBequal_to\fP< typename \fBiterator_traits\fP< _InputIterator >\fB::value_type\fP >, _Allocator >"
.br
.ti -1c
.RI "template<typename _InputIterator, typename _Hash = hash<typename iterator_traits<_InputIterator>::value_type>, typename _Pred = equal_to<typename iterator_traits<_InputIterator>::value_type>, typename _Allocator = allocator<typename iterator_traits<_InputIterator>::value_type>, typename = _RequireInputIter<_InputIterator>, typename = _RequireNotAllocatorOrIntegral<_Hash>, typename = _RequireNotAllocator<_Pred>, typename = _RequireAllocator<_Allocator>> \fBunordered_set\fP (_InputIterator, _InputIterator, unordered_set< int >\fB::size_type\fP={}, _Hash=_Hash(), _Pred=_Pred(), _Allocator=_Allocator()) \-> unordered_set< typename \fBiterator_traits\fP< _InputIterator >\fB::value_type\fP, _Hash, _Pred, _Allocator >"
.br
.ti -1c
.RI "template<typename _Tp, typename _Allocator, typename = _RequireAllocator<_Allocator>> \fBunordered_set\fP (\fBinitializer_list\fP< _Tp >, _Allocator) \-> unordered_set< _Tp, \fBhash\fP< _Tp >, \fBequal_to\fP< _Tp >, _Allocator >"
.br
.ti -1c
.RI "template<typename _Tp, typename _Allocator, typename = _RequireAllocator<_Allocator>> \fBunordered_set\fP (\fBinitializer_list\fP< _Tp >, unordered_set< int >\fB::size_type\fP, _Allocator) \-> unordered_set< _Tp, \fBhash\fP< _Tp >, \fBequal_to\fP< _Tp >, _Allocator >"
.br
.ti -1c
.RI "template<typename _Tp, typename _Hash, typename _Allocator, typename = _RequireNotAllocatorOrIntegral<_Hash>, typename = _RequireAllocator<_Allocator>> \fBunordered_set\fP (\fBinitializer_list\fP< _Tp >, unordered_set< int >\fB::size_type\fP, _Hash, _Allocator) \-> unordered_set< _Tp, _Hash, \fBequal_to\fP< _Tp >, _Allocator >"
.br
.ti -1c
.RI "template<typename _Tp, typename _Hash = hash<_Tp>, 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 >, unordered_set< int >\fB::size_type\fP={}, _Hash=_Hash(), _Pred=_Pred(), _Allocator=_Allocator()) \-> unordered_set< _Tp, _Hash, _Pred, _Allocator >"
.br
.ti -1c
.RI "template<typename _InputIterator, typename _ValT = typename iterator_traits<_InputIterator>::value_type, typename _Allocator = allocator<_ValT>, typename = _RequireInputIter<_InputIterator>, typename = _RequireAllocator<_Allocator>> \fBvector\fP (_InputIterator, _InputIterator, _Allocator=_Allocator()) \-> vector< _ValT, _Allocator >"
.br
.ti -1c
.RI "template<typename _Tp, typename _Allocator = allocator<_Tp>, typename = _RequireAllocator<_Allocator>> \fBvector\fP (size_t, _Tp, _Allocator=_Allocator()) \-> vector< _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<typename _Tp, typename _Alloc> void std::__debug::swap (forward_list< _Tp, _Alloc > & __lx, forward_list< _Tp, _Alloc > & __ly)\fR [inline]\fP, \fR [noexcept]\fP"

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