.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>\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 "\fBusing\fP \fBinsert_return_type\fP = \fB_Node_insert_return\fP< \fBiterator\fP, node_type >"
.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 "\fBusing\fP \fBnode_type\fP = \fBtypename\fP _Base::node_type"
.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< const \fB_Key\fP, _Tp > \fBvalue_type\fP"
.br
.in -1c
.SS "Public Member Functions"

.in +1c
.ti -1c
.RI "\fBmap\fP (_Base_ref __x)"
.br
.ti -1c
.RI "template<\fBtypename\fP \fB_InputIterator\fP > \fBmap\fP (\fB_InputIterator\fP __first, \fB_InputIterator\fP __last, const _Compare &__comp=_Compare(), const \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, const \fBallocator_type\fP &__a)"
.br
.ti -1c
.RI "\fBmap\fP (const _Compare &__comp, const \fB_Allocator\fP &__a=\fB_Allocator\fP())"
.br
.ti -1c
.RI "\fBmap\fP (const \fBallocator_type\fP &__a)"
.br
.ti -1c
.RI "\fBmap\fP (const \fBmap\fP &)=\fBdefault\fP"
.br
.ti -1c
.RI "\fBmap\fP (const \fBmap\fP &\fB__m\fP, const \fB__type_identity_t\fP< \fBallocator_type\fP > &__a)"
.br
.ti -1c
.RI "\fBmap\fP (\fBinitializer_list\fP< \fBvalue_type\fP > \fB__l\fP, const _Compare &__c=_Compare(), const \fBallocator_type\fP &__a=\fBallocator_type\fP())"
.br
.ti -1c
.RI "\fBmap\fP (\fBinitializer_list\fP< \fBvalue_type\fP > \fB__l\fP, const \fBallocator_type\fP &__a)"
.br
.ti -1c
.RI "\fBmap\fP (\fBmap\fP &&)=\fBdefault\fP"
.br
.ti -1c
.RI "\fBmap\fP (\fBmap\fP &&\fB__m\fP, const \fB__type_identity_t\fP< \fBallocator_type\fP > &__a) noexcept(noexcept(\fB_Base\fP(\fBstd::move\fP(\fB__m\fP), __a)))"
.br
.ti -1c
.RI "const \fB_Base\fP & \fB_M_base\fP () const noexcept"
.br
.ti -1c
.RI "\fB_Base\fP & \fB_M_base\fP () noexcept"
.br
.ti -1c
.RI "\fBconst_iterator\fP \fBbegin\fP () const noexcept"
.br
.ti -1c
.RI "\fBiterator\fP \fBbegin\fP () noexcept"
.br
.ti -1c
.RI "\fBconst_iterator\fP \fBcbegin\fP () const noexcept"
.br
.ti -1c
.RI "\fBconst_iterator\fP \fBcend\fP () const noexcept"
.br
.ti -1c
.RI "\fBvoid\fP \fBclear\fP () noexcept"
.br
.ti -1c
.RI "\fBconst_reverse_iterator\fP \fBcrbegin\fP () const noexcept"
.br
.ti -1c
.RI "\fBconst_reverse_iterator\fP \fBcrend\fP () const noexcept"
.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 () const noexcept"
.br
.ti -1c
.RI "\fBiterator\fP \fBend\fP () noexcept"
.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 (const \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 (const \fB_Kt\fP &__x) const"
.br
.ti -1c
.RI "\fBstd::pair\fP< \fBiterator\fP, \fBiterator\fP > \fBequal_range\fP (const \fBkey_type\fP &__x)"
.br
.ti -1c
.RI "\fBstd::pair\fP< \fBconst_iterator\fP, \fBconst_iterator\fP > \fBequal_range\fP (const \fBkey_type\fP &__x) const"
.br
.ti -1c
.RI "\fB_Base_iterator\fP \fBerase\fP (\fB_Base_const_iterator\fP \fB__position\fP)"
.br
.ti -1c
.RI "size_type \fBerase\fP (const \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 "node_type \fBextract\fP (const \fBkey_type\fP &\fB__key\fP)"
.br
.ti -1c
.RI "node_type \fBextract\fP (\fBconst_iterator\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 (const \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 (const \fB_Kt\fP &__x) const"
.br
.ti -1c
.RI "\fBiterator\fP \fBfind\fP (const \fBkey_type\fP &__x)"
.br
.ti -1c
.RI "\fBconst_iterator\fP \fBfind\fP (const \fBkey_type\fP &__x) const"
.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 (const \fBvalue_type\fP &__x)"
.br
.ti -1c
.RI "\fBiterator\fP \fBinsert\fP (\fBconst_iterator\fP \fB__hint\fP, node_type &&\fB__nh\fP)"
.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, const \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 "\fBinsert_return_type\fP \fBinsert\fP (node_type &&\fB__nh\fP)"
.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 _Obj > \fBstd::pair\fP< \fBiterator\fP, bool > \fBinsert_or_assign\fP (const \fBkey_type\fP &\fB__k\fP, _Obj &&\fB__obj\fP)"
.br
.ti -1c
.RI "template<\fBtypename\fP _Obj > \fBiterator\fP \fBinsert_or_assign\fP (\fBconst_iterator\fP \fB__hint\fP, const \fBkey_type\fP &\fB__k\fP, _Obj &&\fB__obj\fP)"
.br
.ti -1c
.RI "template<\fBtypename\fP _Obj > \fBiterator\fP \fBinsert_or_assign\fP (\fBconst_iterator\fP \fB__hint\fP, \fBkey_type\fP &&\fB__k\fP, _Obj &&\fB__obj\fP)"
.br
.ti -1c
.RI "template<\fBtypename\fP _Obj > \fBstd::pair\fP< \fBiterator\fP, bool > \fBinsert_or_assign\fP (\fBkey_type\fP &&\fB__k\fP, _Obj &&\fB__obj\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 \fBlower_bound\fP (const \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 (const \fB_Kt\fP &__x) const"
.br
.ti -1c
.RI "\fBiterator\fP \fBlower_bound\fP (const \fBkey_type\fP &__x)"
.br
.ti -1c
.RI "\fBconst_iterator\fP \fBlower_bound\fP (const \fBkey_type\fP &__x) const"
.br
.ti -1c
.RI "\fBmap\fP & \fBoperator=\fP (const \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 () const noexcept"
.br
.ti -1c
.RI "\fBreverse_iterator\fP \fBrbegin\fP () noexcept"
.br
.ti -1c
.RI "\fBconst_reverse_iterator\fP \fBrend\fP () const noexcept"
.br
.ti -1c
.RI "\fBreverse_iterator\fP \fBrend\fP () noexcept"
.br
.ti -1c
.RI "\fBvoid\fP \fBswap\fP (\fBmap\fP &__x) noexcept(/*\fBconditional\fP */)"
.br
.ti -1c
.RI "template<typename\&.\&.\&. _Args> \fBpair\fP< \fBiterator\fP, bool > \fBtry_emplace\fP (const \fBkey_type\fP &\fB__k\fP, \fB_Args\fP &&\&.\&.\&. \fB__args\fP)"
.br
.ti -1c
.RI "template<typename\&.\&.\&. _Args> \fBiterator\fP \fBtry_emplace\fP (\fBconst_iterator\fP \fB__hint\fP, const \fBkey_type\fP &\fB__k\fP, \fB_Args\fP &&\&.\&.\&. \fB__args\fP)"
.br
.ti -1c
.RI "template<typename\&.\&.\&. _Args> \fBiterator\fP \fBtry_emplace\fP (\fBconst_iterator\fP \fB__hint\fP, \fBkey_type\fP &&\fB__k\fP, \fB_Args\fP &&\&.\&.\&. \fB__args\fP)"
.br
.ti -1c
.RI "template<typename\&.\&.\&. _Args> \fBpair\fP< \fBiterator\fP, bool > \fBtry_emplace\fP (\fBkey_type\fP &&\fB__k\fP, \fB_Args\fP &&\&.\&.\&. \fB__args\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 (const \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 (const \fB_Kt\fP &__x) const"
.br
.ti -1c
.RI "\fBiterator\fP \fBupper_bound\fP (const \fBkey_type\fP &__x)"
.br
.ti -1c
.RI "\fBconst_iterator\fP \fBupper_bound\fP (const \fBkey_type\fP &__x) const"
.br
.in -1c
.SS "Protected Member Functions"

.in +1c
.ti -1c
.RI "\fBvoid\fP \fB_M_swap\fP (_Safe_container &__x) noexcept"
.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\&. 

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