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

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

.in +1c
.ti -1c
.RI "\fBtypedef\fP \fB_Allocator\fP \fBallocator_type\fP"
.br
.ti -1c
.RI "\fBtypedef\fP \fB__gnu_debug::_Safe_iterator\fP< \fB_Base_const_iterator\fP, \fBmap\fP > \fBconst_iterator\fP"
.br
.ti -1c
.RI "\fBtypedef\fP _Base::const_pointer \fBconst_pointer\fP"
.br
.ti -1c
.RI "\fBtypedef\fP _Base::const_reference \fBconst_reference\fP"
.br
.ti -1c
.RI "\fBtypedef\fP \fBstd::reverse_iterator\fP< \fBconst_iterator\fP > \fBconst_reverse_iterator\fP"
.br
.ti -1c
.RI "\fBtypedef\fP _Base::difference_type \fBdifference_type\fP"
.br
.ti -1c
.RI "\fBtypedef\fP \fB__gnu_debug::_Safe_iterator\fP< \fB_Base_iterator\fP, \fBmap\fP > \fBiterator\fP"
.br
.ti -1c
.RI "\fBtypedef\fP _Compare \fBkey_compare\fP"
.br
.ti -1c
.RI "\fBtypedef\fP \fB_Key\fP \fBkey_type\fP"
.br
.ti -1c
.RI "\fBtypedef\fP _Tp \fBmapped_type\fP"
.br
.ti -1c
.RI "\fBtypedef\fP _Base::pointer \fBpointer\fP"
.br
.ti -1c
.RI "\fBtypedef\fP _Base::reference \fBreference\fP"
.br
.ti -1c
.RI "\fBtypedef\fP \fBstd::reverse_iterator\fP< \fBiterator\fP > \fBreverse_iterator\fP"
.br
.ti -1c
.RI "\fBtypedef\fP _Base::size_type \fBsize_type\fP"
.br
.ti -1c
.RI "\fBtypedef\fP \fBstd::pair\fP< \fBconst\fP \fB_Key\fP, _Tp > \fBvalue_type\fP"
.br
.in -1c
.SS "Public Member Functions"

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

.in +1c
.ti -1c
.RI "_Safe_container & \fB_M_safe\fP () \fBnoexcept\fP"
.br
.in -1c
.SS "Friends"

.in +1c
.ti -1c
.RI "template<\fBtypename\fP \fB_ItT\fP , \fBtypename\fP \fB_SeqT\fP , \fBtypename\fP \fB_CatT\fP > \fBclass\fP \fB::__gnu_debug::_Safe_iterator\fP"
.br
.in -1c
.SH "Detailed Description"
.PP 

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

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

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

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

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

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

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

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

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

.PP
Definition at line \fB64\fP of file \fBdebug/map\&.h\fP\&.
.SS "template<\fBtypename\fP \fB_Key\fP , \fBtypename\fP _Tp , \fBtypename\fP _Compare  = std::less<_Key>, \fBtypename\fP \fB_Allocator\fP  = std::allocator<std::pair<const _Key, _Tp> >> \fBtypedef\fP _Tp \fBstd::__debug::map\fP< \fB_Key\fP, _Tp, _Compare, \fB_Allocator\fP >::mapped_type"

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

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

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

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

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

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

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

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

.PP
Definition at line \fB107\fP of file \fBdebug/map\&.h\fP\&.
.SS "template<\fBtypename\fP \fB_Key\fP , \fBtypename\fP _Tp , \fBtypename\fP _Compare  = std::less<_Key>, \fBtypename\fP \fB_Allocator\fP  = std::allocator<std::pair<const _Key, _Tp> >> \fBstd::__debug::map\fP< \fB_Key\fP, _Tp, _Compare, \fB_Allocator\fP >::map (\fBmap\fP< \fB_Key\fP, _Tp, _Compare, \fB_Allocator\fP > && __m, \fBconst\fP \fBallocator_type\fP & __a)\fC [inline]\fP, \fC [noexcept]\fP"

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

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

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

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

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

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

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

.PP
Definition at line \fB695\fP of file \fBdebug/map\&.h\fP\&.
.SS "template<\fBtypename\fP \fB_SafeContainer\fP , \fBtypename\fP _Alloc , \fBtemplate\fP< \fBtypename\fP > \fBclass\fP _SafeBase, bool _IsCxx11AllocatorAware = true> _Safe_container & \fB__gnu_debug::_Safe_container\fP< \fB_SafeContainer\fP, _Alloc, _SafeBase, \fB_IsCxx11AllocatorAware\fP >::_M_safe ()\fC [inline]\fP, \fC [protected]\fP, \fC [noexcept]\fP, \fC [inherited]\fP"

.PP
Definition at line \fB52\fP of file \fBsafe_container\&.h\fP\&.
.SS "template<\fBtypename\fP \fB_SafeContainer\fP , \fBtypename\fP _Alloc , \fBtemplate\fP< \fBtypename\fP > \fBclass\fP _SafeBase, bool _IsCxx11AllocatorAware = true> \fBvoid\fP \fB__gnu_debug::_Safe_container\fP< \fB_SafeContainer\fP, _Alloc, _SafeBase, \fB_IsCxx11AllocatorAware\fP >::_M_swap (\fB_Safe_container\fP< _SafeContainer, _Alloc, _SafeBase, _IsCxx11AllocatorAware > & __x)\fC [inline]\fP, \fC [noexcept]\fP, \fC [inherited]\fP"

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

.PP
Definition at line \fB332\fP of file \fBdebug/map\&.h\fP\&.
.SS "template<\fBtypename\fP \fB_Key\fP , \fBtypename\fP _Tp , \fBtypename\fP _Compare  = std::less<_Key>, \fBtypename\fP \fB_Allocator\fP  = std::allocator<std::pair<const _Key, _Tp> >> template<\fBtypename\fP \fB_Pair\fP , \fBtypename\fP  = typename std::enable_if<std::is_constructible<value_type,						    _Pair&&>::value>::type> \fBstd::pair\fP< \fBiterator\fP, bool > \fBstd::__debug::map\fP< \fB_Key\fP, _Tp, _Compare, \fB_Allocator\fP >::insert (\fB_Pair\fP && __x)\fC [inline]\fP"

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

.PP
Definition at line \fB260\fP of file \fBdebug/map\&.h\fP\&.
.SS "template<\fBtypename\fP \fB_Key\fP , \fBtypename\fP _Tp , \fBtypename\fP _Compare  = std::less<_Key>, \fBtypename\fP \fB_Allocator\fP  = std::allocator<std::pair<const _Key, _Tp> >> template<\fBtypename\fP \fB_Pair\fP , \fBtypename\fP  = typename std::enable_if<std::is_constructible<value_type,						    _Pair&&>::value>::type> \fBiterator\fP \fBstd::__debug::map\fP< \fB_Key\fP, _Tp, _Compare, \fB_Allocator\fP >::insert (\fBconst_iterator\fP __position, \fB_Pair\fP && __x)\fC [inline]\fP"

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

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

.PP
Definition at line \fB309\fP of file \fBdebug/map\&.h\fP\&.
.SS "template<\fBtypename\fP \fB_Key\fP , \fBtypename\fP _Tp , \fBtypename\fP _Compare  = std::less<_Key>, \fBtypename\fP \fB_Allocator\fP  = std::allocator<std::pair<const _Key, _Tp> >> \fBvoid\fP \fBstd::__debug::map\fP< \fB_Key\fP, _Tp, _Compare, \fB_Allocator\fP >::insert (\fBstd::initializer_list\fP< \fBvalue_type\fP > __list)\fC [inline]\fP"

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

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

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

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

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

.PP
Definition at line \fB614\fP of file \fBdebug/map\&.h\fP\&.
.SS "template<\fBtypename\fP \fB_Key\fP , \fBtypename\fP _Tp , \fBtypename\fP _Compare  = std::less<_Key>, \fBtypename\fP \fB_Allocator\fP  = std::allocator<std::pair<const _Key, _Tp> >> \fBmap\fP & \fBstd::__debug::map\fP< \fB_Key\fP, _Tp, _Compare, \fB_Allocator\fP >::operator= (\fBinitializer_list\fP< \fBvalue_type\fP > __l)\fC [inline]\fP"

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

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

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

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

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

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

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

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

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

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

.PP
Definition at line \fB60\fP of file \fBdebug/map\&.h\fP\&.

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