.TH "std::map< _Key, _Tp, _Compare, _Alloc >" 3cxx "Tue Jul 2 2019" "libstdc++" \" -*- nroff -*-
.ad l
.nh
.SH NAME
std::map< _Key, _Tp, _Compare, _Alloc > \- A standard container made up of (key,value) pairs, which can be retrieved based on a key, in logarithmic time\&.  

.SH SYNOPSIS
.br
.PP
.SS "Public Types"

.in +1c
.ti -1c
.RI "typedef _Alloc \fBallocator_type\fP"
.br
.ti -1c
.RI "typedef _Rep_type::const_iterator \fBconst_iterator\fP"
.br
.ti -1c
.RI "typedef _Alloc_traits::const_pointer \fBconst_pointer\fP"
.br
.ti -1c
.RI "typedef _Alloc_traits::const_reference \fBconst_reference\fP"
.br
.ti -1c
.RI "typedef \fB_Rep_type::const_reverse_iterator\fP \fBconst_reverse_iterator\fP"
.br
.ti -1c
.RI "typedef _Rep_type::difference_type \fBdifference_type\fP"
.br
.ti -1c
.RI "typedef _Rep_type::iterator \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 "typedef _Alloc_traits::pointer \fBpointer\fP"
.br
.ti -1c
.RI "typedef _Alloc_traits::reference \fBreference\fP"
.br
.ti -1c
.RI "typedef \fB_Rep_type::reverse_iterator\fP \fBreverse_iterator\fP"
.br
.ti -1c
.RI "typedef _Rep_type::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 ()=default"
.br
.RI "Default constructor creates no elements\&. "
.ti -1c
.RI "\fBmap\fP (const _Compare &__comp, const allocator_type &__a=allocator_type())"
.br
.RI "Creates a map with no elements\&. "
.ti -1c
.RI "\fBmap\fP (const \fBmap\fP &)=default"
.br
.RI "Map copy constructor\&. "
.ti -1c
.RI "\fBmap\fP (\fBmap\fP &&)=default"
.br
.RI "Map move constructor\&. "
.ti -1c
.RI "\fBmap\fP (\fBinitializer_list\fP< \fBvalue_type\fP > __l, const _Compare &__comp=_Compare(), const allocator_type &__a=allocator_type())"
.br
.RI "Builds a map from an initializer_list\&. "
.ti -1c
.RI "\fBmap\fP (const allocator_type &__a)"
.br
.RI "Allocator-extended default constructor\&. "
.ti -1c
.RI "\fBmap\fP (const \fBmap\fP &__m, const allocator_type &__a)"
.br
.RI "Allocator-extended copy constructor\&. "
.ti -1c
.RI "\fBmap\fP (\fBmap\fP &&__m, const allocator_type &__a) noexcept(\fBis_nothrow_copy_constructible\fP< _Compare >::value &&_Alloc_traits::_S_always_equal())"
.br
.RI "Allocator-extended move constructor\&. "
.ti -1c
.RI "\fBmap\fP (\fBinitializer_list\fP< \fBvalue_type\fP > __l, const allocator_type &__a)"
.br
.RI "Allocator-extended initialier-list constructor\&. "
.ti -1c
.RI "template<typename _InputIterator > \fBmap\fP (_InputIterator __first, _InputIterator __last, const allocator_type &__a)"
.br
.RI "Allocator-extended range constructor\&. "
.ti -1c
.RI "template<typename _InputIterator > \fBmap\fP (_InputIterator __first, _InputIterator __last)"
.br
.RI "Builds a map from a range\&. "
.ti -1c
.RI "template<typename _InputIterator > \fBmap\fP (_InputIterator __first, _InputIterator __last, const _Compare &__comp, const allocator_type &__a=allocator_type())"
.br
.RI "Builds a map from a range\&. "
.ti -1c
.RI "\fB~map\fP ()=default"
.br
.ti -1c
.RI "mapped_type & \fBat\fP (const key_type &__k)"
.br
.RI "Access to map data\&. "
.ti -1c
.RI "const mapped_type & \fBat\fP (const key_type &__k) const"
.br
.ti -1c
.RI "iterator \fBbegin\fP () noexcept"
.br
.ti -1c
.RI "const_iterator \fBbegin\fP () const noexcept"
.br
.ti -1c
.RI "const_iterator \fBcbegin\fP () const noexcept"
.br
.ti -1c
.RI "const_iterator \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< iterator, bool > \fBemplace\fP (_Args &&\&.\&.\&. __args)"
.br
.RI "Attempts to build and insert a std::pair into the map\&. "
.ti -1c
.RI "template<typename\&.\&.\&. _Args> iterator \fBemplace_hint\fP (const_iterator __pos, _Args &&\&.\&.\&. __args)"
.br
.RI "Attempts to build and insert a std::pair into the map\&. "
.ti -1c
.RI "bool \fBempty\fP () const noexcept"
.br
.ti -1c
.RI "iterator \fBend\fP () noexcept"
.br
.ti -1c
.RI "const_iterator \fBend\fP () const noexcept"
.br
.ti -1c
.RI "size_type \fBerase\fP (const key_type &__x)"
.br
.RI "Erases elements according to the provided key\&. "
.ti -1c
.RI "iterator \fBerase\fP (const_iterator __first, const_iterator __last)"
.br
.RI "Erases a [first,last) range of elements from a map\&. "
.ti -1c
.RI "allocator_type \fBget_allocator\fP () const noexcept"
.br
.RI "Get a copy of the memory allocation object\&. "
.ti -1c
.RI "void \fBinsert\fP (\fBstd::initializer_list\fP< \fBvalue_type\fP > __list)"
.br
.RI "Attempts to insert a list of std::pairs into the map\&. "
.ti -1c
.RI "template<typename _InputIterator > void \fBinsert\fP (_InputIterator __first, _InputIterator __last)"
.br
.RI "Template function that attempts to insert a range of elements\&. "
.ti -1c
.RI "key_compare \fBkey_comp\fP () const"
.br
.ti -1c
.RI "size_type \fBmax_size\fP () const noexcept"
.br
.ti -1c
.RI "\fBmap\fP & \fBoperator=\fP (const \fBmap\fP &)=default"
.br
.RI "Map assignment operator\&. "
.ti -1c
.RI "\fBmap\fP & \fBoperator=\fP (\fBmap\fP &&)=default"
.br
.RI "Move assignment operator\&. "
.ti -1c
.RI "\fBmap\fP & \fBoperator=\fP (\fBinitializer_list\fP< \fBvalue_type\fP > __l)"
.br
.RI "Map list assignment operator\&. "
.ti -1c
.RI "mapped_type & \fBoperator[]\fP (const key_type &__k)"
.br
.RI "Subscript ( \fC\fP[] ) access to map data\&. "
.ti -1c
.RI "mapped_type & \fBoperator[]\fP (key_type &&__k)"
.br
.ti -1c
.RI "\fBreverse_iterator\fP \fBrbegin\fP () noexcept"
.br
.ti -1c
.RI "\fBconst_reverse_iterator\fP \fBrbegin\fP () const noexcept"
.br
.ti -1c
.RI "\fBreverse_iterator\fP \fBrend\fP () noexcept"
.br
.ti -1c
.RI "\fBconst_reverse_iterator\fP \fBrend\fP () const noexcept"
.br
.ti -1c
.RI "size_type \fBsize\fP () const noexcept"
.br
.ti -1c
.RI "void \fBswap\fP (\fBmap\fP &__x) noexcept(/*\fBconditional\fP */)"
.br
.RI "Swaps data with another map\&. "
.ti -1c
.RI "value_compare \fBvalue_comp\fP () const"
.br
.in -1c
.PP
.RI "\fB\fP"
.br

.in +1c
.in +1c
.ti -1c
.RI "\fBstd::pair\fP< iterator, bool > \fBinsert\fP (const \fBvalue_type\fP &__x)"
.br
.RI "Attempts to insert a std::pair into the map\&. "
.ti -1c
.RI "\fBstd::pair\fP< iterator, bool > \fBinsert\fP (\fBvalue_type\fP &&__x)"
.br
.RI "Attempts to insert a std::pair into the map\&. "
.ti -1c
.RI "template<typename _Pair > __enable_if_t< \fBis_constructible\fP< \fBvalue_type\fP, _Pair >::value, \fBpair\fP< iterator, bool > > \fBinsert\fP (_Pair &&__x)"
.br
.RI "Attempts to insert a std::pair into the map\&. "
.in -1c
.in -1c
.PP
.RI "\fB\fP"
.br

.in +1c
.in +1c
.ti -1c
.RI "iterator \fBinsert\fP (const_iterator __position, const \fBvalue_type\fP &__x)"
.br
.RI "Attempts to insert a std::pair into the map\&. "
.ti -1c
.RI "iterator \fBinsert\fP (const_iterator __position, \fBvalue_type\fP &&__x)"
.br
.RI "Attempts to insert a std::pair into the map\&. "
.ti -1c
.RI "template<typename _Pair > __enable_if_t< \fBis_constructible\fP< \fBvalue_type\fP, _Pair >::value, iterator > \fBinsert\fP (const_iterator __position, _Pair &&__x)"
.br
.RI "Attempts to insert a std::pair into the map\&. "
.in -1c
.in -1c
.PP
.RI "\fB\fP"
.br

.in +1c
.in +1c
.ti -1c
.RI "iterator \fBerase\fP (const_iterator __position)"
.br
.RI "Erases an element from a map\&. "
.ti -1c
.RI "_GLIBCXX_ABI_TAG_CXX11 iterator \fBerase\fP (iterator __position)"
.br
.RI "Erases an element from a map\&. "
.in -1c
.in -1c
.PP
.RI "\fB\fP"
.br

.in +1c
.in +1c
.ti -1c
.RI "iterator \fBfind\fP (const key_type &__x)"
.br
.RI "Tries to locate an element in a map\&. "
.ti -1c
.RI "template<typename _Kt > auto \fBfind\fP (const _Kt &__x) \-> decltype(_M_t\&._M_find_tr(__x))"
.br
.RI "Tries to locate an element in a map\&. "
.in -1c
.in -1c
.PP
.RI "\fB\fP"
.br

.in +1c
.in +1c
.ti -1c
.RI "const_iterator \fBfind\fP (const key_type &__x) const"
.br
.RI "Tries to locate an element in a map\&. "
.ti -1c
.RI "template<typename _Kt > auto \fBfind\fP (const _Kt &__x) const \-> decltype(_M_t\&._M_find_tr(__x))"
.br
.RI "Tries to locate an element in a map\&. "
.in -1c
.in -1c
.PP
.RI "\fB\fP"
.br

.in +1c
.in +1c
.ti -1c
.RI "size_type \fBcount\fP (const key_type &__x) const"
.br
.RI "Finds the number of elements with given key\&. "
.ti -1c
.RI "template<typename _Kt > auto \fBcount\fP (const _Kt &__x) const \-> decltype(_M_t\&._M_count_tr(__x))"
.br
.RI "Finds the number of elements with given key\&. "
.in -1c
.in -1c
.PP
.RI "\fB\fP"
.br

.in +1c
.in +1c
.ti -1c
.RI "iterator \fBlower_bound\fP (const key_type &__x)"
.br
.RI "Finds the beginning of a subsequence matching given key\&. "
.ti -1c
.RI "template<typename _Kt > auto \fBlower_bound\fP (const _Kt &__x) \-> decltype(iterator(_M_t\&._M_lower_bound_tr(__x)))"
.br
.RI "Finds the beginning of a subsequence matching given key\&. "
.in -1c
.in -1c
.PP
.RI "\fB\fP"
.br

.in +1c
.in +1c
.ti -1c
.RI "const_iterator \fBlower_bound\fP (const key_type &__x) const"
.br
.RI "Finds the beginning of a subsequence matching given key\&. "
.ti -1c
.RI "template<typename _Kt > auto \fBlower_bound\fP (const _Kt &__x) const \-> decltype(const_iterator(_M_t\&._M_lower_bound_tr(__x)))"
.br
.RI "Finds the beginning of a subsequence matching given key\&. "
.in -1c
.in -1c
.PP
.RI "\fB\fP"
.br

.in +1c
.in +1c
.ti -1c
.RI "iterator \fBupper_bound\fP (const key_type &__x)"
.br
.RI "Finds the end of a subsequence matching given key\&. "
.ti -1c
.RI "template<typename _Kt > auto \fBupper_bound\fP (const _Kt &__x) \-> decltype(iterator(_M_t\&._M_upper_bound_tr(__x)))"
.br
.RI "Finds the end of a subsequence matching given key\&. "
.in -1c
.in -1c
.PP
.RI "\fB\fP"
.br

.in +1c
.in +1c
.ti -1c
.RI "const_iterator \fBupper_bound\fP (const key_type &__x) const"
.br
.RI "Finds the end of a subsequence matching given key\&. "
.ti -1c
.RI "template<typename _Kt > auto \fBupper_bound\fP (const _Kt &__x) const \-> decltype(const_iterator(_M_t\&._M_upper_bound_tr(__x)))"
.br
.RI "Finds the end of a subsequence matching given key\&. "
.in -1c
.in -1c
.PP
.RI "\fB\fP"
.br

.in +1c
.in +1c
.ti -1c
.RI "\fBstd::pair\fP< iterator, iterator > \fBequal_range\fP (const key_type &__x)"
.br
.RI "Finds a subsequence matching given key\&. "
.ti -1c
.RI "template<typename _Kt > auto \fBequal_range\fP (const _Kt &__x) \-> decltype(\fBpair\fP< iterator, iterator >(_M_t\&._M_equal_range_tr(__x)))"
.br
.RI "Finds a subsequence matching given key\&. "
.in -1c
.in -1c
.PP
.RI "\fB\fP"
.br

.in +1c
.in +1c
.ti -1c
.RI "\fBstd::pair\fP< const_iterator, const_iterator > \fBequal_range\fP (const key_type &__x) const"
.br
.RI "Finds a subsequence matching given key\&. "
.ti -1c
.RI "template<typename _Kt > auto \fBequal_range\fP (const _Kt &__x) const \-> decltype(\fBpair\fP< const_iterator, const_iterator >(_M_t\&._M_equal_range_tr(__x)))"
.br
.RI "Finds a subsequence matching given key\&. "
.in -1c
.in -1c
.SS "Friends"

.in +1c
.ti -1c
.RI "template<typename _K1 , typename _T1 , typename _C1 , typename _A1 > bool \fBoperator<\fP (const \fBmap\fP< _K1, _T1, _C1, _A1 > &, const \fBmap\fP< _K1, _T1, _C1, _A1 > &)"
.br
.ti -1c
.RI "template<typename _K1 , typename _T1 , typename _C1 , typename _A1 > bool \fBoperator==\fP (const \fBmap\fP< _K1, _T1, _C1, _A1 > &, const \fBmap\fP< _K1, _T1, _C1, _A1 > &)"
.br
.in -1c
.SH "Detailed Description"
.PP 

.SS "template<typename _Key, typename _Tp, typename _Compare = std::less<_Key>, typename _Alloc = std::allocator<std::pair<const _Key, _Tp> >>
.br
class std::map< _Key, _Tp, _Compare, _Alloc >"
A standard container made up of (key,value) pairs, which can be retrieved based on a key, in logarithmic time\&. 


.PP
\fBTemplate Parameters:\fP
.RS 4
\fI_Key\fP Type of key objects\&. 
.br
\fI_Tp\fP Type of mapped objects\&. 
.br
\fI_Compare\fP Comparison function object type, defaults to less<_Key>\&. 
.br
\fI_Alloc\fP Allocator type, defaults to allocator<pair<const _Key, _Tp>\&.
.RE
.PP
Meets the requirements of a \fCcontainer\fP, a \fCreversible container\fP, and an \fCassociative container\fP (using unique keys)\&. For a \fCmap<Key,T>\fP the key_type is Key, the mapped_type is T, and the value_type is std::pair<const Key,T>\&.
.PP
Maps support bidirectional iterators\&.
.PP
The private tree data is declared exactly the same way for map and multimap; the distinction is made entirely in how the tree functions are called (*_unique versus *_equal, same as the standard)\&. 
.PP
Definition at line 100 of file stl_map\&.h\&.
.SH "Constructor & Destructor Documentation"
.PP 
.SS "template<typename _Key, typename _Tp, typename _Compare = std::less<_Key>, typename _Alloc = std::allocator<std::pair<const _Key, _Tp> >> \fBstd::map\fP< _Key, _Tp, _Compare, _Alloc >::\fBmap\fP ()\fC [default]\fP"

.PP
Default constructor creates no elements\&. 
.PP
Referenced by std::map< _Key, _Tp, _Compare, _Alloc >::equal_range(), and std::map< _Key, _Tp, _Compare, _Alloc >::map()\&.
.SS "template<typename _Key, typename _Tp, typename _Compare = std::less<_Key>, typename _Alloc = std::allocator<std::pair<const _Key, _Tp> >> \fBstd::map\fP< _Key, _Tp, _Compare, _Alloc >::\fBmap\fP (const _Compare & __comp, const allocator_type & __a = \fCallocator_type()\fP)\fC [inline]\fP, \fC [explicit]\fP"

.PP
Creates a map with no elements\&. 
.PP
\fBParameters:\fP
.RS 4
\fI__comp\fP A comparison object\&. 
.br
\fI__a\fP An allocator object\&. 
.RE
.PP

.PP
Definition at line 192 of file stl_map\&.h\&.
.PP
References std::map< _Key, _Tp, _Compare, _Alloc >::map()\&.
.SS "template<typename _Key, typename _Tp, typename _Compare = std::less<_Key>, typename _Alloc = std::allocator<std::pair<const _Key, _Tp> >> \fBstd::map\fP< _Key, _Tp, _Compare, _Alloc >::\fBmap\fP (const \fBmap\fP< _Key, _Tp, _Compare, _Alloc > &)\fC [default]\fP"

.PP
Map copy constructor\&. Whether the allocator is copied depends on the allocator traits\&. 
.SS "template<typename _Key, typename _Tp, typename _Compare = std::less<_Key>, typename _Alloc = std::allocator<std::pair<const _Key, _Tp> >> \fBstd::map\fP< _Key, _Tp, _Compare, _Alloc >::\fBmap\fP (\fBmap\fP< _Key, _Tp, _Compare, _Alloc > &&)\fC [default]\fP"

.PP
Map move constructor\&. The newly-created map contains the exact contents of the moved instance\&. The moved instance is a valid, but unspecified, map\&. 
.SS "template<typename _Key, typename _Tp, typename _Compare = std::less<_Key>, typename _Alloc = std::allocator<std::pair<const _Key, _Tp> >> \fBstd::map\fP< _Key, _Tp, _Compare, _Alloc >::\fBmap\fP (\fBinitializer_list\fP< \fBvalue_type\fP > __l, const _Compare & __comp = \fC_Compare()\fP, const allocator_type & __a = \fCallocator_type()\fP)\fC [inline]\fP"

.PP
Builds a map from an initializer_list\&. 
.PP
\fBParameters:\fP
.RS 4
\fI__l\fP An initializer_list\&. 
.br
\fI__comp\fP A comparison object\&. 
.br
\fI__a\fP An allocator object\&.
.RE
.PP
Create a map consisting of copies of the elements in the initializer_list \fI__l\fP\&. This is linear in N if the range is already sorted, and NlogN otherwise (where N is \fI__l\&.size()\fP)\&. 
.PP
Definition at line 226 of file stl_map\&.h\&.
.SS "template<typename _Key, typename _Tp, typename _Compare = std::less<_Key>, typename _Alloc = std::allocator<std::pair<const _Key, _Tp> >> \fBstd::map\fP< _Key, _Tp, _Compare, _Alloc >::\fBmap\fP (const allocator_type & __a)\fC [inline]\fP, \fC [explicit]\fP"

.PP
Allocator-extended default constructor\&. 
.PP
Definition at line 234 of file stl_map\&.h\&.
.SS "template<typename _Key, typename _Tp, typename _Compare = std::less<_Key>, typename _Alloc = std::allocator<std::pair<const _Key, _Tp> >> \fBstd::map\fP< _Key, _Tp, _Compare, _Alloc >::\fBmap\fP (const \fBmap\fP< _Key, _Tp, _Compare, _Alloc > & __m, const allocator_type & __a)\fC [inline]\fP"

.PP
Allocator-extended copy constructor\&. 
.PP
Definition at line 238 of file stl_map\&.h\&.
.SS "template<typename _Key, typename _Tp, typename _Compare = std::less<_Key>, typename _Alloc = std::allocator<std::pair<const _Key, _Tp> >> \fBstd::map\fP< _Key, _Tp, _Compare, _Alloc >::\fBmap\fP (\fBmap\fP< _Key, _Tp, _Compare, _Alloc > && __m, const allocator_type & __a)\fC [inline]\fP, \fC [noexcept]\fP"

.PP
Allocator-extended move constructor\&. 
.PP
Definition at line 242 of file stl_map\&.h\&.
.SS "template<typename _Key, typename _Tp, typename _Compare = std::less<_Key>, typename _Alloc = std::allocator<std::pair<const _Key, _Tp> >> \fBstd::map\fP< _Key, _Tp, _Compare, _Alloc >::\fBmap\fP (\fBinitializer_list\fP< \fBvalue_type\fP > __l, const allocator_type & __a)\fC [inline]\fP"

.PP
Allocator-extended initialier-list constructor\&. 
.PP
Definition at line 248 of file stl_map\&.h\&.
.SS "template<typename _Key, typename _Tp, typename _Compare = std::less<_Key>, typename _Alloc = std::allocator<std::pair<const _Key, _Tp> >> template<typename _InputIterator > \fBstd::map\fP< _Key, _Tp, _Compare, _Alloc >::\fBmap\fP (_InputIterator __first, _InputIterator __last, const allocator_type & __a)\fC [inline]\fP"

.PP
Allocator-extended range constructor\&. 
.PP
Definition at line 254 of file stl_map\&.h\&.
.SS "template<typename _Key, typename _Tp, typename _Compare = std::less<_Key>, typename _Alloc = std::allocator<std::pair<const _Key, _Tp> >> template<typename _InputIterator > \fBstd::map\fP< _Key, _Tp, _Compare, _Alloc >::\fBmap\fP (_InputIterator __first, _InputIterator __last)\fC [inline]\fP"

.PP
Builds a map from a range\&. 
.PP
\fBParameters:\fP
.RS 4
\fI__first\fP An input iterator\&. 
.br
\fI__last\fP An input iterator\&.
.RE
.PP
Create a map consisting of copies of the elements from [__first,__last)\&. This is linear in N if the range is already sorted, and NlogN otherwise (where N is distance(__first,__last))\&. 
.PP
Definition at line 271 of file stl_map\&.h\&.
.SS "template<typename _Key, typename _Tp, typename _Compare = std::less<_Key>, typename _Alloc = std::allocator<std::pair<const _Key, _Tp> >> template<typename _InputIterator > \fBstd::map\fP< _Key, _Tp, _Compare, _Alloc >::\fBmap\fP (_InputIterator __first, _InputIterator __last, const _Compare & __comp, const allocator_type & __a = \fCallocator_type()\fP)\fC [inline]\fP"

.PP
Builds a map from a range\&. 
.PP
\fBParameters:\fP
.RS 4
\fI__first\fP An input iterator\&. 
.br
\fI__last\fP An input iterator\&. 
.br
\fI__comp\fP A comparison functor\&. 
.br
\fI__a\fP An allocator object\&.
.RE
.PP
Create a map consisting of copies of the elements from [__first,__last)\&. This is linear in N if the range is already sorted, and NlogN otherwise (where N is distance(__first,__last))\&. 
.PP
Definition at line 288 of file stl_map\&.h\&.
.PP
References std::map< _Key, _Tp, _Compare, _Alloc >::operator=(), and std::map< _Key, _Tp, _Compare, _Alloc >::~map()\&.
.SS "template<typename _Key, typename _Tp, typename _Compare = std::less<_Key>, typename _Alloc = std::allocator<std::pair<const _Key, _Tp> >> \fBstd::map\fP< _Key, _Tp, _Compare, _Alloc >::~\fBmap\fP ()\fC [default]\fP"
The dtor only erases the elements, and note that if the elements themselves are pointers, the pointed-to memory is not touched in any way\&. Managing the pointer is the user's responsibility\&. 
.PP
Referenced by std::map< _Key, _Tp, _Compare, _Alloc >::map()\&.
.SH "Member Function Documentation"
.PP 
.SS "template<typename _Key, typename _Tp, typename _Compare = std::less<_Key>, typename _Alloc = std::allocator<std::pair<const _Key, _Tp> >> mapped_type& \fBstd::map\fP< _Key, _Tp, _Compare, _Alloc >::at (const key_type & __k)\fC [inline]\fP"

.PP
Access to map data\&. 
.PP
\fBParameters:\fP
.RS 4
\fI__k\fP The key for which data should be retrieved\&. 
.RE
.PP
\fBReturns:\fP
.RS 4
A reference to the data whose key is equivalent to \fI__k\fP, if such a data is present in the map\&. 
.RE
.PP
\fBExceptions:\fP
.RS 4
\fIstd::out_of_range\fP If no such data is present\&. 
.RE
.PP

.PP
Definition at line 535 of file stl_map\&.h\&.
.PP
References std::map< _Key, _Tp, _Compare, _Alloc >::end(), std::map< _Key, _Tp, _Compare, _Alloc >::key_comp(), and std::map< _Key, _Tp, _Compare, _Alloc >::lower_bound()\&.
.SS "template<typename _Key, typename _Tp, typename _Compare = std::less<_Key>, typename _Alloc = std::allocator<std::pair<const _Key, _Tp> >> iterator \fBstd::map\fP< _Key, _Tp, _Compare, _Alloc >::begin ()\fC [inline]\fP, \fC [noexcept]\fP"
Returns a read/write iterator that points to the first pair in the map\&. Iteration is done in ascending order according to the keys\&. 
.PP
Definition at line 354 of file stl_map\&.h\&.
.SS "template<typename _Key, typename _Tp, typename _Compare = std::less<_Key>, typename _Alloc = std::allocator<std::pair<const _Key, _Tp> >> const_iterator \fBstd::map\fP< _Key, _Tp, _Compare, _Alloc >::begin () const\fC [inline]\fP, \fC [noexcept]\fP"
Returns a read-only (constant) iterator that points to the first pair in the map\&. Iteration is done in ascending order according to the keys\&. 
.PP
Definition at line 363 of file stl_map\&.h\&.
.SS "template<typename _Key, typename _Tp, typename _Compare = std::less<_Key>, typename _Alloc = std::allocator<std::pair<const _Key, _Tp> >> const_iterator \fBstd::map\fP< _Key, _Tp, _Compare, _Alloc >::cbegin () const\fC [inline]\fP, \fC [noexcept]\fP"
Returns a read-only (constant) iterator that points to the first pair in the map\&. Iteration is done in ascending order according to the keys\&. 
.PP
Definition at line 427 of file stl_map\&.h\&.
.SS "template<typename _Key, typename _Tp, typename _Compare = std::less<_Key>, typename _Alloc = std::allocator<std::pair<const _Key, _Tp> >> const_iterator \fBstd::map\fP< _Key, _Tp, _Compare, _Alloc >::cend () const\fC [inline]\fP, \fC [noexcept]\fP"
Returns a read-only (constant) iterator that points one past the last pair in the map\&. Iteration is done in ascending order according to the keys\&. 
.PP
Definition at line 436 of file stl_map\&.h\&.
.SS "template<typename _Key, typename _Tp, typename _Compare = std::less<_Key>, typename _Alloc = std::allocator<std::pair<const _Key, _Tp> >> void \fBstd::map\fP< _Key, _Tp, _Compare, _Alloc >::clear ()\fC [inline]\fP, \fC [noexcept]\fP"
Erases all elements in a map\&. Note that this function only erases the elements, and that if the elements themselves are pointers, the pointed-to memory is not touched in any way\&. Managing the pointer is the user's responsibility\&. 
.PP
Definition at line 1132 of file stl_map\&.h\&.
.SS "template<typename _Key, typename _Tp, typename _Compare = std::less<_Key>, typename _Alloc = std::allocator<std::pair<const _Key, _Tp> >> size_type \fBstd::map\fP< _Key, _Tp, _Compare, _Alloc >::count (const key_type & __x) const\fC [inline]\fP"

.PP
Finds the number of elements with given key\&. 
.PP
\fBParameters:\fP
.RS 4
\fI__x\fP Key of (key, value) pairs to be located\&. 
.RE
.PP
\fBReturns:\fP
.RS 4
Number of elements with specified key\&.
.RE
.PP
This function only makes sense for multimaps; for map the result will either be 0 (not present) or 1 (present)\&. 
.PP
Definition at line 1214 of file stl_map\&.h\&.
.SS "template<typename _Key, typename _Tp, typename _Compare = std::less<_Key>, typename _Alloc = std::allocator<std::pair<const _Key, _Tp> >> template<typename _Kt > auto \fBstd::map\fP< _Key, _Tp, _Compare, _Alloc >::count (const _Kt & __x) const \-> decltype(_M_t\&._M_count_tr(__x))
	\fC [inline]\fP"

.PP
Finds the number of elements with given key\&. 
.PP
\fBParameters:\fP
.RS 4
\fI__x\fP Key of (key, value) pairs to be located\&. 
.RE
.PP
\fBReturns:\fP
.RS 4
Number of elements with specified key\&.
.RE
.PP
This function only makes sense for multimaps; for map the result will either be 0 (not present) or 1 (present)\&. 
.PP
Definition at line 1220 of file stl_map\&.h\&.
.SS "template<typename _Key, typename _Tp, typename _Compare = std::less<_Key>, typename _Alloc = std::allocator<std::pair<const _Key, _Tp> >> \fBconst_reverse_iterator\fP \fBstd::map\fP< _Key, _Tp, _Compare, _Alloc >::crbegin () const\fC [inline]\fP, \fC [noexcept]\fP"
Returns a read-only (constant) reverse iterator that points to the last pair in the map\&. Iteration is done in descending order according to the keys\&. 
.PP
Definition at line 445 of file stl_map\&.h\&.
.SS "template<typename _Key, typename _Tp, typename _Compare = std::less<_Key>, typename _Alloc = std::allocator<std::pair<const _Key, _Tp> >> \fBconst_reverse_iterator\fP \fBstd::map\fP< _Key, _Tp, _Compare, _Alloc >::crend () const\fC [inline]\fP, \fC [noexcept]\fP"
Returns a read-only (constant) reverse iterator that points to one before the first pair in the map\&. Iteration is done in descending order according to the keys\&. 
.PP
Definition at line 454 of file stl_map\&.h\&.
.SS "template<typename _Key, typename _Tp, typename _Compare = std::less<_Key>, typename _Alloc = std::allocator<std::pair<const _Key, _Tp> >> template<typename\&.\&.\&. _Args> \fBstd::pair\fP<iterator, bool> \fBstd::map\fP< _Key, _Tp, _Compare, _Alloc >::emplace (_Args &&\&.\&.\&. __args)\fC [inline]\fP"

.PP
Attempts to build and insert a std::pair into the map\&. 
.PP
\fBParameters:\fP
.RS 4
\fI__args\fP Arguments used to generate a new pair instance (see std::piecewise_contruct for passing arguments to each part of the pair constructor)\&.
.RE
.PP
\fBReturns:\fP
.RS 4
A pair, of which the first element is an iterator that points to the possibly inserted pair, and the second is a bool that is true if the pair was actually inserted\&.
.RE
.PP
This function attempts to build and insert a (key, value) pair into the map\&. A map relies on unique keys and thus a pair is only inserted if its first element (the key) is not already present in the map\&.
.PP
Insertion requires logarithmic time\&. 
.PP
Definition at line 574 of file stl_map\&.h\&.
.SS "template<typename _Key, typename _Tp, typename _Compare = std::less<_Key>, typename _Alloc = std::allocator<std::pair<const _Key, _Tp> >> template<typename\&.\&.\&. _Args> iterator \fBstd::map\fP< _Key, _Tp, _Compare, _Alloc >::emplace_hint (const_iterator __pos, _Args &&\&.\&.\&. __args)\fC [inline]\fP"

.PP
Attempts to build and insert a std::pair into the map\&. 
.PP
\fBParameters:\fP
.RS 4
\fI__pos\fP An iterator that serves as a hint as to where the pair should be inserted\&. 
.br
\fI__args\fP Arguments used to generate a new pair instance (see std::piecewise_contruct for passing arguments to each part of the pair constructor)\&. 
.RE
.PP
\fBReturns:\fP
.RS 4
An iterator that points to the element with key of the std::pair built from \fI__args\fP (may or may not be that std::pair)\&.
.RE
.PP
This function is not concerned about whether the insertion took place, and thus does not return a boolean like the single-argument emplace() does\&. Note that the first parameter is only a hint and can potentially improve the performance of the insertion process\&. A bad hint would cause no gains in efficiency\&.
.PP
See https://gcc.gnu.org/onlinedocs/libstdc++/manual/associative.html#containers.associative.insert_hints for more on \fIhinting\fP\&.
.PP
Insertion requires logarithmic time (if the hint is not taken)\&. 
.PP
Definition at line 604 of file stl_map\&.h\&.
.PP
Referenced by std::map< _Key, _Tp, _Compare, _Alloc >::insert()\&.
.SS "template<typename _Key, typename _Tp, typename _Compare = std::less<_Key>, typename _Alloc = std::allocator<std::pair<const _Key, _Tp> >> bool \fBstd::map\fP< _Key, _Tp, _Compare, _Alloc >::empty () const\fC [inline]\fP, \fC [noexcept]\fP"
Returns true if the map is empty\&. (Thus begin() would equal end()\&.) 
.PP
Definition at line 463 of file stl_map\&.h\&.
.SS "template<typename _Key, typename _Tp, typename _Compare = std::less<_Key>, typename _Alloc = std::allocator<std::pair<const _Key, _Tp> >> iterator \fBstd::map\fP< _Key, _Tp, _Compare, _Alloc >::end ()\fC [inline]\fP, \fC [noexcept]\fP"
Returns a read/write iterator that points one past the last pair in the map\&. Iteration is done in ascending order according to the keys\&. 
.PP
Definition at line 372 of file stl_map\&.h\&.
.PP
Referenced by std::map< _Key, _Tp, _Compare, _Alloc >::at(), and std::map< _Key, _Tp, _Compare, _Alloc >::insert()\&.
.SS "template<typename _Key, typename _Tp, typename _Compare = std::less<_Key>, typename _Alloc = std::allocator<std::pair<const _Key, _Tp> >> const_iterator \fBstd::map\fP< _Key, _Tp, _Compare, _Alloc >::end () const\fC [inline]\fP, \fC [noexcept]\fP"
Returns a read-only (constant) iterator that points one past the last pair in the map\&. Iteration is done in ascending order according to the keys\&. 
.PP
Definition at line 381 of file stl_map\&.h\&.
.SS "template<typename _Key, typename _Tp, typename _Compare = std::less<_Key>, typename _Alloc = std::allocator<std::pair<const _Key, _Tp> >> \fBstd::pair\fP<iterator, iterator> \fBstd::map\fP< _Key, _Tp, _Compare, _Alloc >::equal_range (const key_type & __x)\fC [inline]\fP"

.PP
Finds a subsequence matching given key\&. 
.PP
\fBParameters:\fP
.RS 4
\fI__x\fP Key of (key, value) pairs to be located\&. 
.RE
.PP
\fBReturns:\fP
.RS 4
Pair of iterators that possibly points to the subsequence matching given key\&.
.RE
.PP
This function is equivalent to 
.PP
.nf
std::make_pair(c\&.lower_bound(val),
               c\&.upper_bound(val))

.fi
.PP
 (but is faster than making the calls separately)\&.
.PP
This function probably only makes sense for multimaps\&. 
.PP
Definition at line 1332 of file stl_map\&.h\&.
.SS "template<typename _Key, typename _Tp, typename _Compare = std::less<_Key>, typename _Alloc = std::allocator<std::pair<const _Key, _Tp> >> template<typename _Kt > auto \fBstd::map\fP< _Key, _Tp, _Compare, _Alloc >::equal_range (const _Kt & __x) \-> decltype(\fBpair\fP<iterator, iterator>(_M_t\&._M_equal_range_tr(__x)))
	\fC [inline]\fP"

.PP
Finds a subsequence matching given key\&. 
.PP
\fBParameters:\fP
.RS 4
\fI__x\fP Key of (key, value) pairs to be located\&. 
.RE
.PP
\fBReturns:\fP
.RS 4
Pair of iterators that possibly points to the subsequence matching given key\&.
.RE
.PP
This function is equivalent to 
.PP
.nf
std::make_pair(c\&.lower_bound(val),
               c\&.upper_bound(val))

.fi
.PP
 (but is faster than making the calls separately)\&.
.PP
This function probably only makes sense for multimaps\&. 
.PP
Definition at line 1338 of file stl_map\&.h\&.
.SS "template<typename _Key, typename _Tp, typename _Compare = std::less<_Key>, typename _Alloc = std::allocator<std::pair<const _Key, _Tp> >> \fBstd::pair\fP<const_iterator, const_iterator> \fBstd::map\fP< _Key, _Tp, _Compare, _Alloc >::equal_range (const key_type & __x) const\fC [inline]\fP"

.PP
Finds a subsequence matching given key\&. 
.PP
\fBParameters:\fP
.RS 4
\fI__x\fP Key of (key, value) pairs to be located\&. 
.RE
.PP
\fBReturns:\fP
.RS 4
Pair of read-only (constant) iterators that possibly points to the subsequence matching given key\&.
.RE
.PP
This function is equivalent to 
.PP
.nf
std::make_pair(c\&.lower_bound(val),
               c\&.upper_bound(val))

.fi
.PP
 (but is faster than making the calls separately)\&.
.PP
This function probably only makes sense for multimaps\&. 
.PP
Definition at line 1361 of file stl_map\&.h\&.
.SS "template<typename _Key, typename _Tp, typename _Compare = std::less<_Key>, typename _Alloc = std::allocator<std::pair<const _Key, _Tp> >> template<typename _Kt > auto \fBstd::map\fP< _Key, _Tp, _Compare, _Alloc >::equal_range (const _Kt & __x) const \-> decltype(\fBpair\fP<const_iterator, const_iterator>(
	      _M_t\&._M_equal_range_tr(__x)))
	\fC [inline]\fP"

.PP
Finds a subsequence matching given key\&. 
.PP
\fBParameters:\fP
.RS 4
\fI__x\fP Key of (key, value) pairs to be located\&. 
.RE
.PP
\fBReturns:\fP
.RS 4
Pair of read-only (constant) iterators that possibly points to the subsequence matching given key\&.
.RE
.PP
This function is equivalent to 
.PP
.nf
std::make_pair(c\&.lower_bound(val),
               c\&.upper_bound(val))

.fi
.PP
 (but is faster than making the calls separately)\&.
.PP
This function probably only makes sense for multimaps\&. 
.PP
Definition at line 1367 of file stl_map\&.h\&.
.PP
References std::map< _Key, _Tp, _Compare, _Alloc >::map()\&.
.SS "template<typename _Key, typename _Tp, typename _Compare = std::less<_Key>, typename _Alloc = std::allocator<std::pair<const _Key, _Tp> >> iterator \fBstd::map\fP< _Key, _Tp, _Compare, _Alloc >::erase (const_iterator __position)\fC [inline]\fP"

.PP
Erases an element from a map\&. 
.PP
\fBParameters:\fP
.RS 4
\fI__position\fP An iterator pointing to the element to be erased\&. 
.RE
.PP
\fBReturns:\fP
.RS 4
An iterator pointing to the element immediately following \fIposition\fP prior to the element being erased\&. If no such element exists, end() is returned\&.
.RE
.PP
This function erases an element, pointed to by the given iterator, from a map\&. Note that this function only erases the element, and that if the element is itself a pointer, the pointed-to memory is not touched in any way\&. Managing the pointer is the user's responsibility\&. 
.PP
Definition at line 1030 of file stl_map\&.h\&.
.PP
Referenced by std::map< _Key, _Tp, _Compare, _Alloc >::erase()\&.
.SS "template<typename _Key, typename _Tp, typename _Compare = std::less<_Key>, typename _Alloc = std::allocator<std::pair<const _Key, _Tp> >> _GLIBCXX_ABI_TAG_CXX11 iterator \fBstd::map\fP< _Key, _Tp, _Compare, _Alloc >::erase (iterator __position)\fC [inline]\fP"

.PP
Erases an element from a map\&. 
.PP
\fBParameters:\fP
.RS 4
\fI__position\fP An iterator pointing to the element to be erased\&. 
.RE
.PP
\fBReturns:\fP
.RS 4
An iterator pointing to the element immediately following \fIposition\fP prior to the element being erased\&. If no such element exists, end() is returned\&.
.RE
.PP
This function erases an element, pointed to by the given iterator, from a map\&. Note that this function only erases the element, and that if the element is itself a pointer, the pointed-to memory is not touched in any way\&. Managing the pointer is the user's responsibility\&. 
.PP
Definition at line 1036 of file stl_map\&.h\&.
.PP
References std::map< _Key, _Tp, _Compare, _Alloc >::erase()\&.
.SS "template<typename _Key, typename _Tp, typename _Compare = std::less<_Key>, typename _Alloc = std::allocator<std::pair<const _Key, _Tp> >> size_type \fBstd::map\fP< _Key, _Tp, _Compare, _Alloc >::erase (const key_type & __x)\fC [inline]\fP"

.PP
Erases elements according to the provided key\&. 
.PP
\fBParameters:\fP
.RS 4
\fI__x\fP Key of element to be erased\&. 
.RE
.PP
\fBReturns:\fP
.RS 4
The number of elements erased\&.
.RE
.PP
This function erases all the elements located by the given key from a map\&. Note that this function only erases the element, and that if the element is itself a pointer, the pointed-to memory is not touched in any way\&. Managing the pointer is the user's responsibility\&. 
.PP
Definition at line 1067 of file stl_map\&.h\&.
.SS "template<typename _Key, typename _Tp, typename _Compare = std::less<_Key>, typename _Alloc = std::allocator<std::pair<const _Key, _Tp> >> iterator \fBstd::map\fP< _Key, _Tp, _Compare, _Alloc >::erase (const_iterator __first, const_iterator __last)\fC [inline]\fP"

.PP
Erases a [first,last) range of elements from a map\&. 
.PP
\fBParameters:\fP
.RS 4
\fI__first\fP Iterator pointing to the start of the range to be erased\&. 
.br
\fI__last\fP Iterator pointing to the end of the range to be erased\&. 
.RE
.PP
\fBReturns:\fP
.RS 4
The iterator \fI__last\fP\&.
.RE
.PP
This function erases a sequence of elements from a map\&. Note that this function only erases the element, and that if the element is itself a pointer, the pointed-to memory is not touched in any way\&. Managing the pointer is the user's responsibility\&. 
.PP
Definition at line 1087 of file stl_map\&.h\&.
.PP
References std::map< _Key, _Tp, _Compare, _Alloc >::erase()\&.
.SS "template<typename _Key, typename _Tp, typename _Compare = std::less<_Key>, typename _Alloc = std::allocator<std::pair<const _Key, _Tp> >> iterator \fBstd::map\fP< _Key, _Tp, _Compare, _Alloc >::find (const key_type & __x)\fC [inline]\fP"

.PP
Tries to locate an element in a map\&. 
.PP
\fBParameters:\fP
.RS 4
\fI__x\fP Key of (key, value) pair to be located\&. 
.RE
.PP
\fBReturns:\fP
.RS 4
Iterator pointing to sought-after element, or end() if not found\&.
.RE
.PP
This function takes a key and tries to locate the element with which the key matches\&. If successful the function returns an iterator pointing to the sought after pair\&. If unsuccessful it returns the past-the-end ( \fCend()\fP ) iterator\&. 
.PP
Definition at line 1168 of file stl_map\&.h\&.
.SS "template<typename _Key, typename _Tp, typename _Compare = std::less<_Key>, typename _Alloc = std::allocator<std::pair<const _Key, _Tp> >> template<typename _Kt > auto \fBstd::map\fP< _Key, _Tp, _Compare, _Alloc >::find (const _Kt & __x) \-> decltype(_M_t\&._M_find_tr(__x))
	\fC [inline]\fP"

.PP
Tries to locate an element in a map\&. 
.PP
\fBParameters:\fP
.RS 4
\fI__x\fP Key of (key, value) pair to be located\&. 
.RE
.PP
\fBReturns:\fP
.RS 4
Iterator pointing to sought-after element, or end() if not found\&.
.RE
.PP
This function takes a key and tries to locate the element with which the key matches\&. If successful the function returns an iterator pointing to the sought after pair\&. If unsuccessful it returns the past-the-end ( \fCend()\fP ) iterator\&. 
.PP
Definition at line 1174 of file stl_map\&.h\&.
.SS "template<typename _Key, typename _Tp, typename _Compare = std::less<_Key>, typename _Alloc = std::allocator<std::pair<const _Key, _Tp> >> const_iterator \fBstd::map\fP< _Key, _Tp, _Compare, _Alloc >::find (const key_type & __x) const\fC [inline]\fP"

.PP
Tries to locate an element in a map\&. 
.PP
\fBParameters:\fP
.RS 4
\fI__x\fP Key of (key, value) pair to be located\&. 
.RE
.PP
\fBReturns:\fP
.RS 4
Read-only (constant) iterator pointing to sought-after element, or end() if not found\&.
.RE
.PP
This function takes a key and tries to locate the element with which the key matches\&. If successful the function returns a constant iterator pointing to the sought after pair\&. If unsuccessful it returns the past-the-end ( \fCend()\fP ) iterator\&. 
.PP
Definition at line 1193 of file stl_map\&.h\&.
.SS "template<typename _Key, typename _Tp, typename _Compare = std::less<_Key>, typename _Alloc = std::allocator<std::pair<const _Key, _Tp> >> template<typename _Kt > auto \fBstd::map\fP< _Key, _Tp, _Compare, _Alloc >::find (const _Kt & __x) const \-> decltype(_M_t\&._M_find_tr(__x))
	\fC [inline]\fP"

.PP
Tries to locate an element in a map\&. 
.PP
\fBParameters:\fP
.RS 4
\fI__x\fP Key of (key, value) pair to be located\&. 
.RE
.PP
\fBReturns:\fP
.RS 4
Read-only (constant) iterator pointing to sought-after element, or end() if not found\&.
.RE
.PP
This function takes a key and tries to locate the element with which the key matches\&. If successful the function returns a constant iterator pointing to the sought after pair\&. If unsuccessful it returns the past-the-end ( \fCend()\fP ) iterator\&. 
.PP
Definition at line 1199 of file stl_map\&.h\&.
.SS "template<typename _Key, typename _Tp, typename _Compare = std::less<_Key>, typename _Alloc = std::allocator<std::pair<const _Key, _Tp> >> allocator_type \fBstd::map\fP< _Key, _Tp, _Compare, _Alloc >::get_allocator () const\fC [inline]\fP, \fC [noexcept]\fP"

.PP
Get a copy of the memory allocation object\&. 
.PP
Definition at line 344 of file stl_map\&.h\&.
.SS "template<typename _Key, typename _Tp, typename _Compare = std::less<_Key>, typename _Alloc = std::allocator<std::pair<const _Key, _Tp> >> \fBstd::pair\fP<iterator, bool> \fBstd::map\fP< _Key, _Tp, _Compare, _Alloc >::insert (const \fBvalue_type\fP & __x)\fC [inline]\fP"

.PP
Attempts to insert a std::pair into the map\&. 
.PP
\fBParameters:\fP
.RS 4
\fI__x\fP Pair to be inserted (see std::make_pair for easy creation of pairs)\&.
.RE
.PP
\fBReturns:\fP
.RS 4
A pair, of which the first element is an iterator that points to the possibly inserted pair, and the second is a bool that is true if the pair was actually inserted\&.
.RE
.PP
This function attempts to insert a (key, value) pair into the map\&. A map relies on unique keys and thus a pair is only inserted if its first element (the key) is not already present in the map\&.
.PP
Insertion requires logarithmic time\&. 
.PP
Definition at line 801 of file stl_map\&.h\&.
.PP
Referenced by std::map< _Key, _Tp, _Compare, _Alloc >::insert()\&.
.SS "template<typename _Key, typename _Tp, typename _Compare = std::less<_Key>, typename _Alloc = std::allocator<std::pair<const _Key, _Tp> >> \fBstd::pair\fP<iterator, bool> \fBstd::map\fP< _Key, _Tp, _Compare, _Alloc >::insert (\fBvalue_type\fP && __x)\fC [inline]\fP"

.PP
Attempts to insert a std::pair into the map\&. 
.PP
\fBParameters:\fP
.RS 4
\fI__x\fP Pair to be inserted (see std::make_pair for easy creation of pairs)\&.
.RE
.PP
\fBReturns:\fP
.RS 4
A pair, of which the first element is an iterator that points to the possibly inserted pair, and the second is a bool that is true if the pair was actually inserted\&.
.RE
.PP
This function attempts to insert a (key, value) pair into the map\&. A map relies on unique keys and thus a pair is only inserted if its first element (the key) is not already present in the map\&.
.PP
Insertion requires logarithmic time\&. 
.PP
Definition at line 808 of file stl_map\&.h\&.
.SS "template<typename _Key, typename _Tp, typename _Compare = std::less<_Key>, typename _Alloc = std::allocator<std::pair<const _Key, _Tp> >> template<typename _Pair > __enable_if_t<\fBis_constructible\fP<\fBvalue_type\fP, _Pair>::value, \fBpair\fP<iterator, bool> > \fBstd::map\fP< _Key, _Tp, _Compare, _Alloc >::insert (_Pair && __x)\fC [inline]\fP"

.PP
Attempts to insert a std::pair into the map\&. 
.PP
\fBParameters:\fP
.RS 4
\fI__x\fP Pair to be inserted (see std::make_pair for easy creation of pairs)\&.
.RE
.PP
\fBReturns:\fP
.RS 4
A pair, of which the first element is an iterator that points to the possibly inserted pair, and the second is a bool that is true if the pair was actually inserted\&.
.RE
.PP
This function attempts to insert a (key, value) pair into the map\&. A map relies on unique keys and thus a pair is only inserted if its first element (the key) is not already present in the map\&.
.PP
Insertion requires logarithmic time\&. 
.PP
Definition at line 814 of file stl_map\&.h\&.
.SS "template<typename _Key, typename _Tp, typename _Compare = std::less<_Key>, typename _Alloc = std::allocator<std::pair<const _Key, _Tp> >> void \fBstd::map\fP< _Key, _Tp, _Compare, _Alloc >::insert (\fBstd::initializer_list\fP< \fBvalue_type\fP > __list)\fC [inline]\fP"

.PP
Attempts to insert a list of std::pairs into the map\&. 
.PP
\fBParameters:\fP
.RS 4
\fI__list\fP A std::initializer_list<value_type> of pairs to be inserted\&.
.RE
.PP
Complexity similar to that of the range constructor\&. 
.PP
Definition at line 828 of file stl_map\&.h\&.
.PP
References std::map< _Key, _Tp, _Compare, _Alloc >::insert()\&.
.SS "template<typename _Key, typename _Tp, typename _Compare = std::less<_Key>, typename _Alloc = std::allocator<std::pair<const _Key, _Tp> >> iterator \fBstd::map\fP< _Key, _Tp, _Compare, _Alloc >::insert (const_iterator __position, const \fBvalue_type\fP & __x)\fC [inline]\fP"

.PP
Attempts to insert a std::pair into the map\&. 
.PP
\fBParameters:\fP
.RS 4
\fI__position\fP An iterator that serves as a hint as to where the pair should be inserted\&. 
.br
\fI__x\fP Pair to be inserted (see std::make_pair for easy creation of pairs)\&. 
.RE
.PP
\fBReturns:\fP
.RS 4
An iterator that points to the element with key of \fI__x\fP (may or may not be the pair passed in)\&.
.RE
.PP
This function is not concerned about whether the insertion took place, and thus does not return a boolean like the single-argument insert() does\&. Note that the first parameter is only a hint and can potentially improve the performance of the insertion process\&. A bad hint would cause no gains in efficiency\&.
.PP
See https://gcc.gnu.org/onlinedocs/libstdc++/manual/associative.html#containers.associative.insert_hints for more on \fIhinting\fP\&.
.PP
Insertion requires logarithmic time (if the hint is not taken)\&. 
.PP
Definition at line 858 of file stl_map\&.h\&.
.SS "template<typename _Key, typename _Tp, typename _Compare = std::less<_Key>, typename _Alloc = std::allocator<std::pair<const _Key, _Tp> >> iterator \fBstd::map\fP< _Key, _Tp, _Compare, _Alloc >::insert (const_iterator __position, \fBvalue_type\fP && __x)\fC [inline]\fP"

.PP
Attempts to insert a std::pair into the map\&. 
.PP
\fBParameters:\fP
.RS 4
\fI__position\fP An iterator that serves as a hint as to where the pair should be inserted\&. 
.br
\fI__x\fP Pair to be inserted (see std::make_pair for easy creation of pairs)\&. 
.RE
.PP
\fBReturns:\fP
.RS 4
An iterator that points to the element with key of \fI__x\fP (may or may not be the pair passed in)\&.
.RE
.PP
This function is not concerned about whether the insertion took place, and thus does not return a boolean like the single-argument insert() does\&. Note that the first parameter is only a hint and can potentially improve the performance of the insertion process\&. A bad hint would cause no gains in efficiency\&.
.PP
See https://gcc.gnu.org/onlinedocs/libstdc++/manual/associative.html#containers.associative.insert_hints for more on \fIhinting\fP\&.
.PP
Insertion requires logarithmic time (if the hint is not taken)\&. 
.PP
Definition at line 868 of file stl_map\&.h\&.
.SS "template<typename _Key, typename _Tp, typename _Compare = std::less<_Key>, typename _Alloc = std::allocator<std::pair<const _Key, _Tp> >> template<typename _Pair > __enable_if_t<\fBis_constructible\fP<\fBvalue_type\fP, _Pair>::value, iterator> \fBstd::map\fP< _Key, _Tp, _Compare, _Alloc >::insert (const_iterator __position, _Pair && __x)\fC [inline]\fP"

.PP
Attempts to insert a std::pair into the map\&. 
.PP
\fBParameters:\fP
.RS 4
\fI__position\fP An iterator that serves as a hint as to where the pair should be inserted\&. 
.br
\fI__x\fP Pair to be inserted (see std::make_pair for easy creation of pairs)\&. 
.RE
.PP
\fBReturns:\fP
.RS 4
An iterator that points to the element with key of \fI__x\fP (may or may not be the pair passed in)\&.
.RE
.PP
This function is not concerned about whether the insertion took place, and thus does not return a boolean like the single-argument insert() does\&. Note that the first parameter is only a hint and can potentially improve the performance of the insertion process\&. A bad hint would cause no gains in efficiency\&.
.PP
See https://gcc.gnu.org/onlinedocs/libstdc++/manual/associative.html#containers.associative.insert_hints for more on \fIhinting\fP\&.
.PP
Insertion requires logarithmic time (if the hint is not taken)\&. 
.PP
Definition at line 873 of file stl_map\&.h\&.
.SS "template<typename _Key, typename _Tp, typename _Compare = std::less<_Key>, typename _Alloc = std::allocator<std::pair<const _Key, _Tp> >> template<typename _InputIterator > void \fBstd::map\fP< _Key, _Tp, _Compare, _Alloc >::insert (_InputIterator __first, _InputIterator __last)\fC [inline]\fP"

.PP
Template function that attempts to insert a range of elements\&. 
.PP
\fBParameters:\fP
.RS 4
\fI__first\fP Iterator pointing to the start of the range to be inserted\&. 
.br
\fI__last\fP Iterator pointing to the end of the range\&.
.RE
.PP
Complexity similar to that of the range constructor\&. 
.PP
Definition at line 891 of file stl_map\&.h\&.
.PP
References std::map< _Key, _Tp, _Compare, _Alloc >::emplace_hint(), std::map< _Key, _Tp, _Compare, _Alloc >::end(), std::map< _Key, _Tp, _Compare, _Alloc >::key_comp(), std::map< _Key, _Tp, _Compare, _Alloc >::lower_bound(), and std::piecewise_construct\&.
.SS "template<typename _Key, typename _Tp, typename _Compare = std::less<_Key>, typename _Alloc = std::allocator<std::pair<const _Key, _Tp> >> key_compare \fBstd::map\fP< _Key, _Tp, _Compare, _Alloc >::key_comp () const\fC [inline]\fP"
Returns the key comparison object out of which the map was constructed\&. 
.PP
Definition at line 1141 of file stl_map\&.h\&.
.PP
Referenced by std::map< _Key, _Tp, _Compare, _Alloc >::at(), and std::map< _Key, _Tp, _Compare, _Alloc >::insert()\&.
.SS "template<typename _Key, typename _Tp, typename _Compare = std::less<_Key>, typename _Alloc = std::allocator<std::pair<const _Key, _Tp> >> iterator \fBstd::map\fP< _Key, _Tp, _Compare, _Alloc >::lower_bound (const key_type & __x)\fC [inline]\fP"

.PP
Finds the beginning of a subsequence matching given key\&. 
.PP
\fBParameters:\fP
.RS 4
\fI__x\fP Key of (key, value) pair to be located\&. 
.RE
.PP
\fBReturns:\fP
.RS 4
Iterator pointing to first element equal to or greater than key, or end()\&.
.RE
.PP
This function returns the first element of a subsequence of elements that matches the given key\&. If unsuccessful it returns an iterator pointing to the first element that has a greater value than given key or end() if no such element exists\&. 
.PP
Definition at line 1238 of file stl_map\&.h\&.
.PP
Referenced by std::map< _Key, _Tp, _Compare, _Alloc >::at(), and std::map< _Key, _Tp, _Compare, _Alloc >::insert()\&.
.SS "template<typename _Key, typename _Tp, typename _Compare = std::less<_Key>, typename _Alloc = std::allocator<std::pair<const _Key, _Tp> >> template<typename _Kt > auto \fBstd::map\fP< _Key, _Tp, _Compare, _Alloc >::lower_bound (const _Kt & __x) \-> decltype(iterator(_M_t\&._M_lower_bound_tr(__x)))
	\fC [inline]\fP"

.PP
Finds the beginning of a subsequence matching given key\&. 
.PP
\fBParameters:\fP
.RS 4
\fI__x\fP Key of (key, value) pair to be located\&. 
.RE
.PP
\fBReturns:\fP
.RS 4
Iterator pointing to first element equal to or greater than key, or end()\&.
.RE
.PP
This function returns the first element of a subsequence of elements that matches the given key\&. If unsuccessful it returns an iterator pointing to the first element that has a greater value than given key or end() if no such element exists\&. 
.PP
Definition at line 1244 of file stl_map\&.h\&.
.SS "template<typename _Key, typename _Tp, typename _Compare = std::less<_Key>, typename _Alloc = std::allocator<std::pair<const _Key, _Tp> >> const_iterator \fBstd::map\fP< _Key, _Tp, _Compare, _Alloc >::lower_bound (const key_type & __x) const\fC [inline]\fP"

.PP
Finds the beginning of a subsequence matching given key\&. 
.PP
\fBParameters:\fP
.RS 4
\fI__x\fP Key of (key, value) pair to be located\&. 
.RE
.PP
\fBReturns:\fP
.RS 4
Read-only (constant) iterator pointing to first element equal to or greater than key, or end()\&.
.RE
.PP
This function returns the first element of a subsequence of elements that matches the given key\&. If unsuccessful it returns an iterator pointing to the first element that has a greater value than given key or end() if no such element exists\&. 
.PP
Definition at line 1263 of file stl_map\&.h\&.
.SS "template<typename _Key, typename _Tp, typename _Compare = std::less<_Key>, typename _Alloc = std::allocator<std::pair<const _Key, _Tp> >> template<typename _Kt > auto \fBstd::map\fP< _Key, _Tp, _Compare, _Alloc >::lower_bound (const _Kt & __x) const \-> decltype(const_iterator(_M_t\&._M_lower_bound_tr(__x)))
	\fC [inline]\fP"

.PP
Finds the beginning of a subsequence matching given key\&. 
.PP
\fBParameters:\fP
.RS 4
\fI__x\fP Key of (key, value) pair to be located\&. 
.RE
.PP
\fBReturns:\fP
.RS 4
Read-only (constant) iterator pointing to first element equal to or greater than key, or end()\&.
.RE
.PP
This function returns the first element of a subsequence of elements that matches the given key\&. If unsuccessful it returns an iterator pointing to the first element that has a greater value than given key or end() if no such element exists\&. 
.PP
Definition at line 1269 of file stl_map\&.h\&.
.SS "template<typename _Key, typename _Tp, typename _Compare = std::less<_Key>, typename _Alloc = std::allocator<std::pair<const _Key, _Tp> >> size_type \fBstd::map\fP< _Key, _Tp, _Compare, _Alloc >::max_size () const\fC [inline]\fP, \fC [noexcept]\fP"
Returns the maximum size of the map\&. 
.PP
Definition at line 473 of file stl_map\&.h\&.
.SS "template<typename _Key, typename _Tp, typename _Compare = std::less<_Key>, typename _Alloc = std::allocator<std::pair<const _Key, _Tp> >> \fBmap\fP& \fBstd::map\fP< _Key, _Tp, _Compare, _Alloc >::operator= (const \fBmap\fP< _Key, _Tp, _Compare, _Alloc > &)\fC [default]\fP"

.PP
Map assignment operator\&. Whether the allocator is copied depends on the allocator traits\&. 
.PP
Referenced by std::map< _Key, _Tp, _Compare, _Alloc >::map()\&.
.SS "template<typename _Key, typename _Tp, typename _Compare = std::less<_Key>, typename _Alloc = std::allocator<std::pair<const _Key, _Tp> >> \fBmap\fP& \fBstd::map\fP< _Key, _Tp, _Compare, _Alloc >::operator= (\fBmap\fP< _Key, _Tp, _Compare, _Alloc > &&)\fC [default]\fP"

.PP
Move assignment operator\&. 
.SS "template<typename _Key, typename _Tp, typename _Compare = std::less<_Key>, typename _Alloc = std::allocator<std::pair<const _Key, _Tp> >> \fBmap\fP& \fBstd::map\fP< _Key, _Tp, _Compare, _Alloc >::operator= (\fBinitializer_list\fP< \fBvalue_type\fP > __l)\fC [inline]\fP"

.PP
Map list assignment operator\&. 
.PP
\fBParameters:\fP
.RS 4
\fI__l\fP An initializer_list\&.
.RE
.PP
This function fills a map with copies of the elements in the initializer list \fI__l\fP\&.
.PP
Note that the assignment completely changes the map and that the resulting map's size is the same as the number of elements assigned\&. 
.PP
Definition at line 335 of file stl_map\&.h\&.
.SS "template<typename _Key, typename _Tp, typename _Compare = std::less<_Key>, typename _Alloc = std::allocator<std::pair<const _Key, _Tp> >> mapped_type& \fBstd::map\fP< _Key, _Tp, _Compare, _Alloc >::operator[] (const key_type & __k)\fC [inline]\fP"

.PP
Subscript ( \fC\fP[] ) access to map data\&. 
.PP
\fBParameters:\fP
.RS 4
\fI__k\fP The key for which data should be retrieved\&. 
.RE
.PP
\fBReturns:\fP
.RS 4
A reference to the data of the (key,data) pair\&.
.RE
.PP
Allows for easy lookup with the subscript ( \fC\fP[] ) operator\&. Returns data associated with the key specified in subscript\&. If the key does not exist, a pair with that key is created using default values, which is then returned\&.
.PP
Lookup requires logarithmic time\&. 
.PP
Definition at line 490 of file stl_map\&.h\&.
.SS "template<typename _Key, typename _Tp, typename _Compare = std::less<_Key>, typename _Alloc = std::allocator<std::pair<const _Key, _Tp> >> \fBreverse_iterator\fP \fBstd::map\fP< _Key, _Tp, _Compare, _Alloc >::rbegin ()\fC [inline]\fP, \fC [noexcept]\fP"
Returns a read/write reverse iterator that points to the last pair in the map\&. Iteration is done in descending order according to the keys\&. 
.PP
Definition at line 390 of file stl_map\&.h\&.
.SS "template<typename _Key, typename _Tp, typename _Compare = std::less<_Key>, typename _Alloc = std::allocator<std::pair<const _Key, _Tp> >> \fBconst_reverse_iterator\fP \fBstd::map\fP< _Key, _Tp, _Compare, _Alloc >::rbegin () const\fC [inline]\fP, \fC [noexcept]\fP"
Returns a read-only (constant) reverse iterator that points to the last pair in the map\&. Iteration is done in descending order according to the keys\&. 
.PP
Definition at line 399 of file stl_map\&.h\&.
.SS "template<typename _Key, typename _Tp, typename _Compare = std::less<_Key>, typename _Alloc = std::allocator<std::pair<const _Key, _Tp> >> \fBreverse_iterator\fP \fBstd::map\fP< _Key, _Tp, _Compare, _Alloc >::rend ()\fC [inline]\fP, \fC [noexcept]\fP"
Returns a read/write reverse iterator that points to one before the first pair in the map\&. Iteration is done in descending order according to the keys\&. 
.PP
Definition at line 408 of file stl_map\&.h\&.
.SS "template<typename _Key, typename _Tp, typename _Compare = std::less<_Key>, typename _Alloc = std::allocator<std::pair<const _Key, _Tp> >> \fBconst_reverse_iterator\fP \fBstd::map\fP< _Key, _Tp, _Compare, _Alloc >::rend () const\fC [inline]\fP, \fC [noexcept]\fP"
Returns a read-only (constant) reverse iterator that points to one before the first pair in the map\&. Iteration is done in descending order according to the keys\&. 
.PP
Definition at line 417 of file stl_map\&.h\&.
.SS "template<typename _Key, typename _Tp, typename _Compare = std::less<_Key>, typename _Alloc = std::allocator<std::pair<const _Key, _Tp> >> size_type \fBstd::map\fP< _Key, _Tp, _Compare, _Alloc >::size () const\fC [inline]\fP, \fC [noexcept]\fP"
Returns the size of the map\&. 
.PP
Definition at line 468 of file stl_map\&.h\&.
.SS "template<typename _Key, typename _Tp, typename _Compare = std::less<_Key>, typename _Alloc = std::allocator<std::pair<const _Key, _Tp> >> void \fBstd::map\fP< _Key, _Tp, _Compare, _Alloc >::swap (\fBmap\fP< _Key, _Tp, _Compare, _Alloc > & __x)\fC [inline]\fP, \fC [noexcept]\fP"

.PP
Swaps data with another map\&. 
.PP
\fBParameters:\fP
.RS 4
\fI__x\fP A map of the same element and allocator types\&.
.RE
.PP
This exchanges the elements between two maps in constant time\&. (It is only swapping a pointer, an integer, and an instance of the \fCCompare\fP type (which itself is often stateless and empty), so it should be quite fast\&.) Note that the global std::swap() function is specialized such that std::swap(m1,m2) will feed to this function\&.
.PP
Whether the allocators are swapped depends on the allocator traits\&. 
.PP
Definition at line 1121 of file stl_map\&.h\&.
.SS "template<typename _Key, typename _Tp, typename _Compare = std::less<_Key>, typename _Alloc = std::allocator<std::pair<const _Key, _Tp> >> iterator \fBstd::map\fP< _Key, _Tp, _Compare, _Alloc >::upper_bound (const key_type & __x)\fC [inline]\fP"

.PP
Finds the end of a subsequence matching given key\&. 
.PP
\fBParameters:\fP
.RS 4
\fI__x\fP Key of (key, value) pair to be located\&. 
.RE
.PP
\fBReturns:\fP
.RS 4
Iterator pointing to the first element greater than key, or end()\&. 
.RE
.PP

.PP
Definition at line 1283 of file stl_map\&.h\&.
.SS "template<typename _Key, typename _Tp, typename _Compare = std::less<_Key>, typename _Alloc = std::allocator<std::pair<const _Key, _Tp> >> template<typename _Kt > auto \fBstd::map\fP< _Key, _Tp, _Compare, _Alloc >::upper_bound (const _Kt & __x) \-> decltype(iterator(_M_t\&._M_upper_bound_tr(__x)))
	\fC [inline]\fP"

.PP
Finds the end of a subsequence matching given key\&. 
.PP
\fBParameters:\fP
.RS 4
\fI__x\fP Key of (key, value) pair to be located\&. 
.RE
.PP
\fBReturns:\fP
.RS 4
Iterator pointing to the first element greater than key, or end()\&. 
.RE
.PP

.PP
Definition at line 1289 of file stl_map\&.h\&.
.SS "template<typename _Key, typename _Tp, typename _Compare = std::less<_Key>, typename _Alloc = std::allocator<std::pair<const _Key, _Tp> >> const_iterator \fBstd::map\fP< _Key, _Tp, _Compare, _Alloc >::upper_bound (const key_type & __x) const\fC [inline]\fP"

.PP
Finds the end of a subsequence matching given key\&. 
.PP
\fBParameters:\fP
.RS 4
\fI__x\fP Key of (key, value) pair to be located\&. 
.RE
.PP
\fBReturns:\fP
.RS 4
Read-only (constant) iterator pointing to first iterator greater than key, or end()\&. 
.RE
.PP

.PP
Definition at line 1303 of file stl_map\&.h\&.
.SS "template<typename _Key, typename _Tp, typename _Compare = std::less<_Key>, typename _Alloc = std::allocator<std::pair<const _Key, _Tp> >> template<typename _Kt > auto \fBstd::map\fP< _Key, _Tp, _Compare, _Alloc >::upper_bound (const _Kt & __x) const \-> decltype(const_iterator(_M_t\&._M_upper_bound_tr(__x)))
	\fC [inline]\fP"

.PP
Finds the end of a subsequence matching given key\&. 
.PP
\fBParameters:\fP
.RS 4
\fI__x\fP Key of (key, value) pair to be located\&. 
.RE
.PP
\fBReturns:\fP
.RS 4
Read-only (constant) iterator pointing to first iterator greater than key, or end()\&. 
.RE
.PP

.PP
Definition at line 1309 of file stl_map\&.h\&.
.SS "template<typename _Key, typename _Tp, typename _Compare = std::less<_Key>, typename _Alloc = std::allocator<std::pair<const _Key, _Tp> >> value_compare \fBstd::map\fP< _Key, _Tp, _Compare, _Alloc >::value_comp () const\fC [inline]\fP"
Returns a value comparison object, built from the key comparison object out of which the map was constructed\&. 
.PP
Definition at line 1149 of file stl_map\&.h\&.

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