.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 "typedef _Allocator \fBallocator_type\fP"
.br
.ti -1c
.RI "typedef \fB__gnu_debug::_Safe_iterator\fP< \fB_Base_const_iterator\fP, \fBmap\fP > \fBconst_iterator\fP"
.br
.ti -1c
.RI "typedef _Base::const_pointer \fBconst_pointer\fP"
.br
.ti -1c
.RI "typedef _Base::const_reference \fBconst_reference\fP"
.br
.ti -1c
.RI "typedef \fBstd::reverse_iterator\fP< \fBconst_iterator\fP > \fBconst_reverse_iterator\fP"
.br
.ti -1c
.RI "typedef _Base::difference_type \fBdifference_type\fP"
.br
.ti -1c
.RI "using \fBinsert_return_type\fP = \fB_Node_insert_return\fP< \fBiterator\fP, node_type >"
.br
.ti -1c
.RI "typedef \fB__gnu_debug::_Safe_iterator\fP< \fB_Base_iterator\fP, \fBmap\fP > \fBiterator\fP"
.br
.ti -1c
.RI "typedef _Compare \fBkey_compare\fP"
.br
.ti -1c
.RI "typedef _Key \fBkey_type\fP"
.br
.ti -1c
.RI "typedef _Tp \fBmapped_type\fP"
.br
.ti -1c
.RI "using \fBnode_type\fP = typename _Base::node_type"
.br
.ti -1c
.RI "typedef _Base::pointer \fBpointer\fP"
.br
.ti -1c
.RI "typedef _Base::reference \fBreference\fP"
.br
.ti -1c
.RI "typedef \fBstd::reverse_iterator\fP< \fBiterator\fP > \fBreverse_iterator\fP"
.br
.ti -1c
.RI "typedef _Base::size_type \fBsize_type\fP"
.br
.ti -1c
.RI "typedef \fBstd::pair\fP< const _Key, _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<typename _InputIterator > \fBmap\fP (_InputIterator __first, _InputIterator __last, const _Compare &__comp=_Compare(), const _Allocator &__a=_Allocator())"
.br
.ti -1c
.RI "template<typename _InputIterator > \fBmap\fP (_InputIterator __first, _InputIterator __last, const allocator_type &__a)"
.br
.ti -1c
.RI "\fBmap\fP (const _Compare &__comp, const _Allocator &__a=_Allocator())"
.br
.ti -1c
.RI "\fBmap\fP (const allocator_type &__a)"
.br
.ti -1c
.RI "\fBmap\fP (const \fBmap\fP &)=default"
.br
.ti -1c
.RI "\fBmap\fP (const \fBmap\fP &__m, const __type_identity_t< allocator_type > &__a)"
.br
.ti -1c
.RI "\fBmap\fP (\fBinitializer_list\fP< \fBvalue_type\fP > __l, const _Compare &__c=_Compare(), const allocator_type &__a=allocator_type())"
.br
.ti -1c
.RI "\fBmap\fP (\fBinitializer_list\fP< \fBvalue_type\fP > __l, const allocator_type &__a)"
.br
.ti -1c
.RI "\fBmap\fP (\fBmap\fP &&)=default"
.br
.ti -1c
.RI "\fBmap\fP (\fBmap\fP &&__m, const __type_identity_t< allocator_type > &__a) noexcept(noexcept(\fB_Base\fP(\fBstd::move\fP(__m), __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 "void \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 (_Args &&\&.\&.\&. __args)"
.br
.ti -1c
.RI "template<typename\&.\&.\&. _Args> \fBiterator\fP \fBemplace_hint\fP (\fBconst_iterator\fP __pos, _Args &&\&.\&.\&. __args)"
.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<typename _Kt , typename _Req  = typename __has_is_transparent<_Compare, _Kt>::type> \fBstd::pair\fP< \fBiterator\fP, \fBiterator\fP > \fBequal_range\fP (const _Kt &__x)"
.br
.ti -1c
.RI "template<typename _Kt , typename _Req  = typename __has_is_transparent<_Compare, _Kt>::type> \fBstd::pair\fP< \fBconst_iterator\fP, \fBconst_iterator\fP > \fBequal_range\fP (const _Kt &__x) const"
.br
.ti -1c
.RI "\fBstd::pair\fP< \fBiterator\fP, \fBiterator\fP > \fBequal_range\fP (const key_type &__x)"
.br
.ti -1c
.RI "\fBstd::pair\fP< \fBconst_iterator\fP, \fBconst_iterator\fP > \fBequal_range\fP (const key_type &__x) const"
.br
.ti -1c
.RI "\fB_Base_iterator\fP \fBerase\fP (\fB_Base_const_iterator\fP __position)"
.br
.ti -1c
.RI "size_type \fBerase\fP (const key_type &__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 __position)"
.br
.ti -1c
.RI "_GLIBCXX_ABI_TAG_CXX11 \fBiterator\fP \fBerase\fP (\fBiterator\fP __position)"
.br
.ti -1c
.RI "node_type \fBextract\fP (const key_type &__key)"
.br
.ti -1c
.RI "node_type \fBextract\fP (\fBconst_iterator\fP __position)"
.br
.ti -1c
.RI "template<typename _Kt , typename _Req  = typename __has_is_transparent<_Compare, _Kt>::type> \fBiterator\fP \fBfind\fP (const _Kt &__x)"
.br
.ti -1c
.RI "template<typename _Kt , typename _Req  = typename __has_is_transparent<_Compare, _Kt>::type> \fBconst_iterator\fP \fBfind\fP (const _Kt &__x) const"
.br
.ti -1c
.RI "\fBiterator\fP \fBfind\fP (const key_type &__x)"
.br
.ti -1c
.RI "\fBconst_iterator\fP \fBfind\fP (const key_type &__x) const"
.br
.ti -1c
.RI "template<typename _InputIterator > void \fBinsert\fP (_InputIterator __first, _InputIterator __last)"
.br
.ti -1c
.RI "template<typename _Pair , typename  = typename std::enable_if<std::is_constructible<value_type,						    _Pair&&>::value>::type> \fBstd::pair\fP< \fBiterator\fP, bool > \fBinsert\fP (_Pair &&__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 __hint, node_type &&__nh)"
.br
.ti -1c
.RI "template<typename _Pair , typename  = typename std::enable_if<std::is_constructible<value_type,						    _Pair&&>::value>::type> \fBiterator\fP \fBinsert\fP (\fBconst_iterator\fP __position, _Pair &&__x)"
.br
.ti -1c
.RI "\fBiterator\fP \fBinsert\fP (\fBconst_iterator\fP __position, const \fBvalue_type\fP &__x)"
.br
.ti -1c
.RI "\fBiterator\fP \fBinsert\fP (\fBconst_iterator\fP __position, \fBvalue_type\fP &&__x)"
.br
.ti -1c
.RI "insert_return_type \fBinsert\fP (node_type &&__nh)"
.br
.ti -1c
.RI "void \fBinsert\fP (\fBstd::initializer_list\fP< \fBvalue_type\fP > __list)"
.br
.ti -1c
.RI "\fBstd::pair\fP< \fBiterator\fP, bool > \fBinsert\fP (\fBvalue_type\fP &&__x)"
.br
.ti -1c
.RI "template<typename _Obj > \fBstd::pair\fP< \fBiterator\fP, bool > \fBinsert_or_assign\fP (const key_type &__k, _Obj &&__obj)"
.br
.ti -1c
.RI "template<typename _Obj > \fBiterator\fP \fBinsert_or_assign\fP (\fBconst_iterator\fP __hint, const key_type &__k, _Obj &&__obj)"
.br
.ti -1c
.RI "template<typename _Obj > \fBiterator\fP \fBinsert_or_assign\fP (\fBconst_iterator\fP __hint, key_type &&__k, _Obj &&__obj)"
.br
.ti -1c
.RI "template<typename _Obj > \fBstd::pair\fP< \fBiterator\fP, bool > \fBinsert_or_assign\fP (key_type &&__k, _Obj &&__obj)"
.br
.ti -1c
.RI "template<typename _Kt , typename _Req  = typename __has_is_transparent<_Compare, _Kt>::type> \fBiterator\fP \fBlower_bound\fP (const _Kt &__x)"
.br
.ti -1c
.RI "template<typename _Kt , typename _Req  = typename __has_is_transparent<_Compare, _Kt>::type> \fBconst_iterator\fP \fBlower_bound\fP (const _Kt &__x) const"
.br
.ti -1c
.RI "\fBiterator\fP \fBlower_bound\fP (const key_type &__x)"
.br
.ti -1c
.RI "\fBconst_iterator\fP \fBlower_bound\fP (const key_type &__x) const"
.br
.ti -1c
.RI "\fBmap\fP & \fBoperator=\fP (const \fBmap\fP &)=default"
.br
.ti -1c
.RI "\fBmap\fP & \fBoperator=\fP (\fBinitializer_list\fP< \fBvalue_type\fP > __l)"
.br
.ti -1c
.RI "\fBmap\fP & \fBoperator=\fP (\fBmap\fP &&)=default"
.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 "void \fBswap\fP (\fBmap\fP &__x) noexcept(/*\fBconditional\fP */)"
.br
.ti -1c
.RI "template<typename\&.\&.\&. _Args> \fBpair\fP< \fBiterator\fP, bool > \fBtry_emplace\fP (const key_type &__k, _Args &&\&.\&.\&. __args)"
.br
.ti -1c
.RI "template<typename\&.\&.\&. _Args> \fBiterator\fP \fBtry_emplace\fP (\fBconst_iterator\fP __hint, const key_type &__k, _Args &&\&.\&.\&. __args)"
.br
.ti -1c
.RI "template<typename\&.\&.\&. _Args> \fBiterator\fP \fBtry_emplace\fP (\fBconst_iterator\fP __hint, key_type &&__k, _Args &&\&.\&.\&. __args)"
.br
.ti -1c
.RI "template<typename\&.\&.\&. _Args> \fBpair\fP< \fBiterator\fP, bool > \fBtry_emplace\fP (key_type &&__k, _Args &&\&.\&.\&. __args)"
.br
.ti -1c
.RI "template<typename _Kt , typename _Req  = typename __has_is_transparent<_Compare, _Kt>::type> \fBiterator\fP \fBupper_bound\fP (const _Kt &__x)"
.br
.ti -1c
.RI "template<typename _Kt , typename _Req  = typename __has_is_transparent<_Compare, _Kt>::type> \fBconst_iterator\fP \fBupper_bound\fP (const _Kt &__x) const"
.br
.ti -1c
.RI "\fBiterator\fP \fBupper_bound\fP (const key_type &__x)"
.br
.ti -1c
.RI "\fBconst_iterator\fP \fBupper_bound\fP (const key_type &__x) const"
.br
.in -1c
.SS "Protected Member Functions"

.in +1c
.ti -1c
.RI "constexpr void \fB_M_swap\fP (_Safe_container &__x) noexcept"
.br
.in -1c
.SS "Friends"

.in +1c
.ti -1c
.RI "template<typename _ItT , typename _SeqT , typename _CatT > class \fB::__gnu_debug::_Safe_iterator\fP"
.br
.in -1c
.SH "Detailed Description"
.PP 

.SS "template<typename _Key, typename _Tp, typename _Compare = std::less<_Key>, typename _Allocator = 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\&.