.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<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()) \-> \fBdeque\fP< _ValT, _Allocator >"
.br
.ti -1c
.RI "template<typename _Tp , typename _Allocator  = allocator<_Tp>, typename  = _RequireAllocator<_Allocator>> \fBdeque\fP (size_t, _Tp, _Allocator=_Allocator()) \-> \fBdeque\fP< _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()) \-> \fBforward_list\fP< _ValT, _Allocator >"
.br
.ti -1c
.RI "template<typename _Tp , typename _Allocator  = allocator<_Tp>, typename  = _RequireAllocator<_Allocator>> \fBforward_list\fP (size_t, _Tp, _Allocator=_Allocator()) \-> \fBforward_list\fP< _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()) \-> \fBlist\fP< _ValT, _Allocator >"
.br
.ti -1c
.RI "template<typename _Tp , typename _Allocator  = allocator<_Tp>, typename  = _RequireAllocator<_Allocator>> \fBlist\fP (size_t, _Tp, _Allocator=_Allocator()) \-> \fBlist\fP< _Tp, _Allocator >"
.br
.ti -1c
.RI "template<typename _InputIterator , typename _Allocator , typename  = _RequireInputIter<_InputIterator>, 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 _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()) \-> \fBmap\fP< __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) \-> \fBmap\fP< _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()) \-> \fBmap\fP< _Key, _Tp, _Compare, _Allocator >"
.br
.ti -1c
.RI "template<typename _InputIterator , typename _Allocator , typename  = _RequireInputIter<_InputIterator>, 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 _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()) \-> \fBmultimap\fP< __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) \-> \fBmultimap\fP< _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()) \-> \fBmultimap\fP< _Key, _Tp, _Compare, _Allocator >"
.br
.ti -1c
.RI "template<typename _InputIterator , typename _Allocator , typename  = _RequireInputIter<_InputIterator>, 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<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()) \-> \fBmultiset\fP< typename \fBiterator_traits\fP< _InputIterator >::value_type, _Compare, _Allocator >"
.br
.ti -1c
.RI "template<typename _Key , typename _Allocator , typename  = _RequireAllocator<_Allocator>> \fBmultiset\fP (\fBinitializer_list\fP< _Key >, _Allocator) \-> \fBmultiset\fP< _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()) \-> \fBmultiset\fP< _Key, _Compare, _Allocator >"
.br
.ti -1c
.RI "template<size_t _Nb> constexpr \fBbitset\fP< _Nb > \fBoperator&\fP (const \fBbitset\fP< _Nb > &__x, const \fBbitset\fP< _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 \fBbitset\fP< _Nb > &__x)"
.br
.ti -1c
.RI "template<typename _Tp , typename _Alloc > constexpr __detail::__synth3way_t< _Tp > \fBoperator<=>\fP (const \fBdeque\fP< _Tp, _Alloc > &__x, const \fBdeque\fP< _Tp, _Alloc > &__y)"
.br
.ti -1c
.RI "template<typename _Tp , typename _Alloc > constexpr __detail::__synth3way_t< _Tp > \fBoperator<=>\fP (const \fBforward_list\fP< _Tp, _Alloc > &__x, const \fBforward_list\fP< _Tp, _Alloc > &__y)"
.br
.ti -1c
.RI "template<typename _Tp , typename _Alloc > constexpr __detail::__synth3way_t< _Tp > \fBoperator<=>\fP (const \fBlist\fP< _Tp, _Alloc > &__x, const \fBlist\fP< _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 \fBmap\fP< _Key, _Tp, _Compare, _Alloc > &__lhs, const \fBmap\fP< _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 \fBmultimap\fP< _Key, _Tp, _Compare, _Alloc > &__lhs, const \fBmultimap\fP< _Key, _Tp, _Compare, _Alloc > &__rhs)"
.br
.ti -1c
.RI "template<typename _Key , typename _Compare , typename _Alloc > __detail::__synth3way_t< _Key > \fBoperator<=>\fP (const \fBmultiset\fP< _Key, _Compare, _Alloc > &__lhs, const \fBmultiset\fP< _Key, _Compare, _Alloc > &__rhs)"
.br
.ti -1c
.RI "template<typename _Key , typename _Compare , typename _Alloc > __detail::__synth3way_t< _Key > \fBoperator<=>\fP (const \fBset\fP< _Key, _Compare, _Alloc > &__lhs, const \fBset\fP< _Key, _Compare, _Alloc > &__rhs)"
.br
.ti -1c
.RI "template<typename _Tp , typename _Alloc > constexpr __detail::__synth3way_t< _Tp > \fBoperator<=>\fP (const \fBvector\fP< _Tp, _Alloc > &__x, const \fBvector\fP< _Tp, _Alloc > &__y)"
.br
.ti -1c
.RI "template<typename _Tp , typename _Alloc > bool \fBoperator==\fP (const \fBdeque\fP< _Tp, _Alloc > &__lhs, const \fBdeque\fP< _Tp, _Alloc > &__rhs)"
.br
.ti -1c
.RI "template<typename _Tp , typename _Alloc > bool \fBoperator==\fP (const \fBforward_list\fP< _Tp, _Alloc > &__lx, const \fBforward_list\fP< _Tp, _Alloc > &__ly)"
.br
.ti -1c
.RI "template<typename _Tp , typename _Alloc > bool \fBoperator==\fP (const \fBlist\fP< _Tp, _Alloc > &__lhs, const \fBlist\fP< _Tp, _Alloc > &__rhs)"
.br
.ti -1c
.RI "template<typename _Key , typename _Tp , typename _Compare , typename _Allocator > bool \fBoperator==\fP (const \fBmap\fP< _Key, _Tp, _Compare, _Allocator > &__lhs, const \fBmap\fP< _Key, _Tp, _Compare, _Allocator > &__rhs)"
.br
.ti -1c
.RI "template<typename _Key , typename _Tp , typename _Compare , typename _Allocator > bool \fBoperator==\fP (const \fBmultimap\fP< _Key, _Tp, _Compare, _Allocator > &__lhs, const \fBmultimap\fP< _Key, _Tp, _Compare, _Allocator > &__rhs)"
.br
.ti -1c
.RI "template<typename _Key , typename _Compare , typename _Allocator > bool \fBoperator==\fP (const \fBmultiset\fP< _Key, _Compare, _Allocator > &__lhs, const \fBmultiset\fP< _Key, _Compare, _Allocator > &__rhs)"
.br
.ti -1c
.RI "template<typename _Key , typename _Compare , typename _Allocator > bool \fBoperator==\fP (const \fBset\fP< _Key, _Compare, _Allocator > &__lhs, const \fBset\fP< _Key, _Compare, _Allocator > &__rhs)"
.br
.ti -1c
.RI "template<typename _Key , typename _Tp , typename _Hash , typename _Pred , typename _Alloc > 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<typename _Key , typename _Tp , typename _Hash , typename _Pred , typename _Alloc > 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<typename _Value , typename _Hash , typename _Pred , typename _Alloc > 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<typename _Value , typename _Hash , typename _Pred , typename _Alloc > 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<typename _Tp , typename _Alloc > constexpr bool \fBoperator==\fP (const \fBvector\fP< _Tp, _Alloc > &__lhs, const \fBvector\fP< _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, \fBbitset\fP< _Nb > &__x)"
.br
.ti -1c
.RI "template<size_t _Nb> constexpr \fBbitset\fP< _Nb > \fBoperator^\fP (const \fBbitset\fP< _Nb > &__x, const \fBbitset\fP< _Nb > &__y) noexcept"
.br
.ti -1c
.RI "template<size_t _Nb> constexpr \fBbitset\fP< _Nb > \fBoperator|\fP (const \fBbitset\fP< _Nb > &__x, const \fBbitset\fP< _Nb > &__y) noexcept"
.br
.ti -1c
.RI "template<typename _InputIterator , typename _Allocator , typename  = _RequireInputIter<_InputIterator>, 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<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()) \-> \fBset\fP< typename \fBiterator_traits\fP< _InputIterator >::value_type, _Compare, _Allocator >"
.br
.ti -1c
.RI "template<typename _Key , typename _Allocator , typename  = _RequireAllocator<_Allocator>> \fBset\fP (\fBinitializer_list\fP< _Key >, _Allocator) \-> \fBset\fP< _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()) \-> \fBset\fP< _Key, _Compare, _Allocator >"
.br
.ti -1c
.RI "template<typename _Tp , typename _Alloc > void \fBswap\fP (\fBdeque\fP< _Tp, _Alloc > &__lhs, \fBdeque\fP< _Tp, _Alloc > &__rhs) noexcept(/*\fBconditional\fP */)"
.br
.ti -1c
.RI "template<typename _Tp , typename _Alloc > 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<typename _Tp , typename _Alloc > void \fBswap\fP (\fBlist\fP< _Tp, _Alloc > &__lhs, \fBlist\fP< _Tp, _Alloc > &__rhs) noexcept(/*\fBconditional\fP */)"
.br
.ti -1c
.RI "template<typename _Key , typename _Tp , typename _Compare , typename _Allocator > 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<typename _Key , typename _Tp , typename _Compare , typename _Allocator > 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<typename _Key , typename _Compare , typename _Allocator > void \fBswap\fP (\fBmultiset\fP< _Key, _Compare, _Allocator > &__x, \fBmultiset\fP< _Key, _Compare, _Allocator > &__y) noexcept(/*\fBconditional\fP */)"
.br
.ti -1c
.RI "template<typename _Key , typename _Compare , typename _Allocator > void \fBswap\fP (\fBset\fP< _Key, _Compare, _Allocator > &__x, \fBset\fP< _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 (\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<typename _Key , typename _Tp , typename _Hash , typename _Pred , typename _Alloc > 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<typename _Value , typename _Hash , typename _Pred , typename _Alloc > 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<typename _Value , typename _Hash , typename _Pred , typename _Alloc > 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<typename _Tp , typename _Alloc > constexpr void \fBswap\fP (\fBvector\fP< _Tp, _Alloc > &__lhs, \fBvector\fP< _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) \-> \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 _InputIterator , typename _Allocator , typename  = _RequireInputIter<_InputIterator>, 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 _InputIterator , typename _Hash , typename _Allocator , typename  = _RequireInputIter<_InputIterator>, 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 _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 \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<typename _Key , typename _Tp , typename _Allocator , typename  = _RequireAllocator<_Allocator>> \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<typename _Key , typename _Tp , typename _Allocator , typename  = _RequireAllocator<_Allocator>> \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 _Key , typename _Tp , typename _Hash , typename _Allocator , typename  = _RequireNotAllocatorOrIntegral<_Hash>, 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 _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 \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 _InputIterator , typename _Allocator , typename  = _RequireInputIter<_InputIterator>, 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 _InputIterator , typename _Allocator , typename  = _RequireInputIter<_InputIterator>, 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 _InputIterator , typename _Hash , typename _Allocator , typename  = _RequireInputIter<_InputIterator>, 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 _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, \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<typename _Key , typename _Tp , typename _Allocator , typename  = _RequireAllocator<_Allocator>> \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<typename _Key , typename _Tp , typename _Allocator , typename  = _RequireAllocator<_Allocator>> \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 _Key , typename _Tp , typename _Hash , typename _Allocator , typename  = _RequireNotAllocatorOrIntegral<_Hash>, 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 _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 > >, \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 _InputIterator , typename _Allocator , typename  = _RequireInputIter<_InputIterator>, 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 _InputIterator , typename _Hash , typename _Allocator , typename  = _RequireInputIter<_InputIterator>, 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<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, \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<typename _Tp , typename _Allocator , typename  = _RequireAllocator<_Allocator>> \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 _Tp , typename _Hash , typename _Allocator , typename  = _RequireNotAllocatorOrIntegral<_Hash>, 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 _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 >, \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 _InputIterator , typename _Allocator , typename  = _RequireInputIter<_InputIterator>, 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 _InputIterator , typename _Hash , typename _Allocator , typename  = _RequireInputIter<_InputIterator>, 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<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, \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<typename _Tp , typename _Allocator , typename  = _RequireAllocator<_Allocator>> \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 _Tp , typename _Hash , typename _Allocator , typename  = _RequireNotAllocatorOrIntegral<_Hash>, 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 _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 >, \fBunordered_set\fP< int >::size_type={}, _Hash=_Hash(), _Pred=_Pred(), _Allocator=_Allocator()) \-> \fBunordered_set\fP< _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()) \-> \fBvector\fP< _ValT, _Allocator >"
.br
.ti -1c
.RI "template<typename _Tp , typename _Allocator  = allocator<_Tp>, 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<typename _Tp , typename _Alloc > void 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\&.