template<typename_Key,typename_Tp,typename_Compare=std::less<_Key>,typename_Alloc=std::allocator<std::pair<const_Key,_Tp>>>mapped_type&std::map<_Key,_Tp,_Compare,_Alloc>::at(constkey_type&__k)[inline]
Access to map data.
Parameters__k The key for which data should be retrieved.
Returns
A reference to the data whose key is equivalent to __k, if such a data is present in the map.
Exceptionsstd::out_of_range If no such data is present.
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().
template<typename_Key,typename_Tp,typename_Compare=std::less<_Key>,typename_Alloc=std::allocator<std::pair<const_Key,_Tp>>>const_iteratorstd::map<_Key,_Tp,_Compare,_Alloc>::begin()const[inline],[noexcept]
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.
template<typename_Key,typename_Tp,typename_Compare=std::less<_Key>,typename_Alloc=std::allocator<std::pair<const_Key,_Tp>>>iteratorstd::map<_Key,_Tp,_Compare,_Alloc>::begin()[inline],[noexcept]
Returns a read/write iterator that points to the first pair in the map. Iteration is done in ascending
order according to the keys.
template<typename_Key,typename_Tp,typename_Compare=std::less<_Key>,typename_Alloc=std::allocator<std::pair<const_Key,_Tp>>>const_iteratorstd::map<_Key,_Tp,_Compare,_Alloc>::cbegin()const[inline],[noexcept]
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.
template<typename_Key,typename_Tp,typename_Compare=std::less<_Key>,typename_Alloc=std::allocator<std::pair<const_Key,_Tp>>>const_iteratorstd::map<_Key,_Tp,_Compare,_Alloc>::cend()const[inline],[noexcept]
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.
template<typename_Key,typename_Tp,typename_Compare=std::less<_Key>,typename_Alloc=std::allocator<std::pair<const_Key,_Tp>>>voidstd::map<_Key,_Tp,_Compare,_Alloc>::clear()[inline],[noexcept]
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.
template<typename_Key,typename_Tp,typename_Compare=std::less<_Key>,typename_Alloc=std::allocator<std::pair<const_Key,_Tp>>>template<typename_Kt>autostd::map<_Key,_Tp,_Compare,_Alloc>::contains(const_Kt&__x)const->decltype(_M_t._M_find_tr(__x),void(),true)
[inline]"
Finds whether an element with the given key exists.
Parameters__x Key of (key, value) pairs to be located.
Returns
True if there is an element with the specified key.
template<typename_Key,typename_Tp,typename_Compare=std::less<_Key>,typename_Alloc=std::allocator<std::pair<const_Key,_Tp>>>boolstd::map<_Key,_Tp,_Compare,_Alloc>::contains(constkey_type&__x)const[inline]
Finds whether an element with the given key exists.
Parameters__x Key of (key, value) pairs to be located.
Returns
True if there is an element with the specified key.
template<typename_Key,typename_Tp,typename_Compare=std::less<_Key>,typename_Alloc=std::allocator<std::pair<const_Key,_Tp>>>template<typename_Kt>autostd::map<_Key,_Tp,_Compare,_Alloc>::count(const_Kt&__x)const->decltype(_M_t._M_count_tr(__x))
[inline]"
Finds the number of elements with given key.
Parameters__x Key of (key, value) pairs to be located.
Returns
Number of elements with specified key.
This function only makes sense for multimaps; for map the result will either be 0 (not present) or 1
(present).
template<typename_Key,typename_Tp,typename_Compare=std::less<_Key>,typename_Alloc=std::allocator<std::pair<const_Key,_Tp>>>size_typestd::map<_Key,_Tp,_Compare,_Alloc>::count(constkey_type&__x)const[inline]
Finds the number of elements with given key.
Parameters__x Key of (key, value) pairs to be located.
Returns
Number of elements with specified key.
This function only makes sense for multimaps; for map the result will either be 0 (not present) or 1
(present).
template<typename_Key,typename_Tp,typename_Compare=std::less<_Key>,typename_Alloc=std::allocator<std::pair<const_Key,_Tp>>>const_reverse_iteratorstd::map<_Key,_Tp,_Compare,_Alloc>::crbegin()const[inline],[noexcept]
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.
template<typename_Key,typename_Tp,typename_Compare=std::less<_Key>,typename_Alloc=std::allocator<std::pair<const_Key,_Tp>>>const_reverse_iteratorstd::map<_Key,_Tp,_Compare,_Alloc>::crend()const[inline],[noexcept]
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.
template<typename_Key,typename_Tp,typename_Compare=std::less<_Key>,typename_Alloc=std::allocator<std::pair<const_Key,_Tp>>>template<typename..._Args>std::pair<iterator,bool>std::map<_Key,_Tp,_Compare,_Alloc>::emplace(_Args&&...__args)[inline]
Attempts to build and insert a std::pair into the map.
Parameters__args Arguments used to generate a new pair instance (see std::piecewise_contruct for passing
arguments to each part of the pair constructor).
Returns
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.
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.
Insertion requires logarithmic time.
References std::map<_Key,_Tp,_Compare,_Alloc>::emplace_hint(), std::map<_Key,_Tp,_Compare,_Alloc>::end(), std::map<_Key,_Tp,_Compare,_Alloc>::key_comp(), and std::map<_Key,_Tp,_Compare,_Alloc>::lower_bound().
template<typename_Key,typename_Tp,typename_Compare=std::less<_Key>,typename_Alloc=std::allocator<std::pair<const_Key,_Tp>>>template<typename..._Args>iteratorstd::map<_Key,_Tp,_Compare,_Alloc>::emplace_hint(const_iterator__pos,_Args&&...__args)[inline]
Attempts to build and insert a std::pair into the map.
Parameters__pos An iterator that serves as a hint as to where the pair should be inserted.
__args Arguments used to generate a new pair instance (see std::piecewise_contruct for passing
arguments to each part of the pair constructor).
Returns
An iterator that points to the element with key of the std::pair built from __args (may or may not be
that std::pair).
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.
See https://gcc.gnu.org/onlinedocs/libstdc++/manual/associative.html#containers.associative.insert_hints
for more on hinting.
Insertion requires logarithmic time (if the hint is not taken).
Referenced by std::map<_Key,_Tp,_Compare,_Alloc>::emplace(), std::map<_Key,_Tp,_Compare,_Alloc>::insert(), std::map<_Key,_Tp,_Compare,_Alloc>::insert_or_assign(), std::map<_Key,_Tp,_Compare,_Alloc>::insert_or_assign(), std::map<_Key,_Tp,_Compare,_Alloc>::try_emplace(), and std::map<_Key,_Tp,_Compare,_Alloc>::try_emplace().
template<typename_Key,typename_Tp,typename_Compare=std::less<_Key>,typename_Alloc=std::allocator<std::pair<const_Key,_Tp>>>boolstd::map<_Key,_Tp,_Compare,_Alloc>::empty()const[inline],[noexcept]
Returns true if the map is empty. (Thus begin() would equal end().)
template<typename_Key,typename_Tp,typename_Compare=std::less<_Key>,typename_Alloc=std::allocator<std::pair<const_Key,_Tp>>>const_iteratorstd::map<_Key,_Tp,_Compare,_Alloc>::end()const[inline],[noexcept]
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.
template<typename_Key,typename_Tp,typename_Compare=std::less<_Key>,typename_Alloc=std::allocator<std::pair<const_Key,_Tp>>>iteratorstd::map<_Key,_Tp,_Compare,_Alloc>::end()[inline],[noexcept]
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.
Referenced by std::map<_Key,_Tp,_Compare,_Alloc>::at(), std::map<_Key,_Tp,_Compare,_Alloc>::emplace(), std::map<_Key,_Tp,_Compare,_Alloc>::extract(), std::map<_Key,_Tp,_Compare,_Alloc>::insert(), std::map<_Key,_Tp,_Compare,_Alloc>::insert_or_assign(), std::map<_Key,_Tp,_Compare,_Alloc>::operator[](), and std::map<_Key,_Tp,_Compare,_Alloc>::try_emplace().
template<typename_Key,typename_Tp,typename_Compare=std::less<_Key>,typename_Alloc=std::allocator<std::pair<const_Key,_Tp>>>template<typename_Kt>autostd::map<_Key,_Tp,_Compare,_Alloc>::equal_range(const_Kt&__x)->decltype(pair<iterator,iterator>(_M_t._M_equal_range_tr(__x)))
[inline]"
Finds a subsequence matching given key.
Parameters__x Key of (key, value) pairs to be located.
Returns
Pair of iterators that possibly points to the subsequence matching given key.
This function is equivalent to
std::make_pair(c.lower_bound(val),
c.upper_bound(val))
(but is faster than making the calls separately).
This function probably only makes sense for multimaps.
template<typename_Key,typename_Tp,typename_Compare=std::less<_Key>,typename_Alloc=std::allocator<std::pair<const_Key,_Tp>>>template<typename_Kt>autostd::map<_Key,_Tp,_Compare,_Alloc>::equal_range(const_Kt&__x)const->decltype(pair<const_iterator,const_iterator>(
_M_t._M_equal_range_tr(__x))) [inline]"
Finds a subsequence matching given key.
Parameters__x Key of (key, value) pairs to be located.
Returns
Pair of read-only (constant) iterators that possibly points to the subsequence matching given key.
This function is equivalent to
std::make_pair(c.lower_bound(val),
c.upper_bound(val))
(but is faster than making the calls separately).
This function probably only makes sense for multimaps.
template<typename_Key,typename_Tp,typename_Compare=std::less<_Key>,typename_Alloc=std::allocator<std::pair<const_Key,_Tp>>>std::pair<iterator,iterator>std::map<_Key,_Tp,_Compare,_Alloc>::equal_range(constkey_type&__x)[inline]
Finds a subsequence matching given key.
Parameters__x Key of (key, value) pairs to be located.
Returns
Pair of iterators that possibly points to the subsequence matching given key.
This function is equivalent to
std::make_pair(c.lower_bound(val),
c.upper_bound(val))
(but is faster than making the calls separately).
This function probably only makes sense for multimaps.
template<typename_Key,typename_Tp,typename_Compare=std::less<_Key>,typename_Alloc=std::allocator<std::pair<const_Key,_Tp>>>std::pair<const_iterator,const_iterator>std::map<_Key,_Tp,_Compare,_Alloc>::equal_range(constkey_type&__x)const[inline]
Finds a subsequence matching given key.
Parameters__x Key of (key, value) pairs to be located.
Returns
Pair of read-only (constant) iterators that possibly points to the subsequence matching given key.
This function is equivalent to
std::make_pair(c.lower_bound(val),
c.upper_bound(val))
(but is faster than making the calls separately).
This function probably only makes sense for multimaps.
template<typename_Key,typename_Tp,typename_Compare=std::less<_Key>,typename_Alloc=std::allocator<std::pair<const_Key,_Tp>>>size_typestd::map<_Key,_Tp,_Compare,_Alloc>::erase(constkey_type&__x)[inline]
Erases elements according to the provided key.
Parameters__x Key of element to be erased.
Returns
The number of elements erased.
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.
template<typename_Key,typename_Tp,typename_Compare=std::less<_Key>,typename_Alloc=std::allocator<std::pair<const_Key,_Tp>>>iteratorstd::map<_Key,_Tp,_Compare,_Alloc>::erase(const_iterator__first,const_iterator__last)[inline]
Erases a [first,last) range of elements from a map.
Parameters__first Iterator pointing to the start of the range to be erased.
__last Iterator pointing to the end of the range to be erased.
Returns
The iterator __last.
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.
template<typename_Key,typename_Tp,typename_Compare=std::less<_Key>,typename_Alloc=std::allocator<std::pair<const_Key,_Tp>>>iteratorstd::map<_Key,_Tp,_Compare,_Alloc>::erase(const_iterator__position)[inline]
Erases an element from a map.
Parameters__position An iterator pointing to the element to be erased.
Returns
An iterator pointing to the element immediately following position prior to the element being erased.
If no such element exists, end() is returned.
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.
template<typename_Key,typename_Tp,typename_Compare=std::less<_Key>,typename_Alloc=std::allocator<std::pair<const_Key,_Tp>>>_GLIBCXX_ABI_TAG_CXX11iteratorstd::map<_Key,_Tp,_Compare,_Alloc>::erase(iterator__position)[inline]
Erases an element from a map.
Parameters__position An iterator pointing to the element to be erased.
Returns
An iterator pointing to the element immediately following position prior to the element being erased.
If no such element exists, end() is returned.
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.
template<typename_Key,typename_Tp,typename_Compare=std::less<_Key>,typename_Alloc=std::allocator<std::pair<const_Key,_Tp>>>node_typestd::map<_Key,_Tp,_Compare,_Alloc>::extract(constkey_type&__x)[inline]
Extract a node.
template<typename_Key,typename_Tp,typename_Compare=std::less<_Key>,typename_Alloc=std::allocator<std::pair<const_Key,_Tp>>>node_typestd::map<_Key,_Tp,_Compare,_Alloc>::extract(const_iterator__pos)[inline]
Extract a node.
References std::map<_Key,_Tp,_Compare,_Alloc>::end().
template<typename_Key,typename_Tp,typename_Compare=std::less<_Key>,typename_Alloc=std::allocator<std::pair<const_Key,_Tp>>>template<typename_Kt>autostd::map<_Key,_Tp,_Compare,_Alloc>::find(const_Kt&__x)->decltype(_M_t._M_find_tr(__x))
[inline]"
Tries to locate an element in a map.
Parameters__x Key of (key, value) pair to be located.
Returns
Iterator pointing to sought-after element, or end() if not found.
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 ( end() ) iterator.
template<typename_Key,typename_Tp,typename_Compare=std::less<_Key>,typename_Alloc=std::allocator<std::pair<const_Key,_Tp>>>template<typename_Kt>autostd::map<_Key,_Tp,_Compare,_Alloc>::find(const_Kt&__x)const->decltype(_M_t._M_find_tr(__x))
[inline]"
Tries to locate an element in a map.
Parameters__x Key of (key, value) pair to be located.
Returns
Read-only (constant) iterator pointing to sought-after element, or end() if not found.
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 ( end() ) iterator.
template<typename_Key,typename_Tp,typename_Compare=std::less<_Key>,typename_Alloc=std::allocator<std::pair<const_Key,_Tp>>>iteratorstd::map<_Key,_Tp,_Compare,_Alloc>::find(constkey_type&__x)[inline]
Tries to locate an element in a map.
Parameters__x Key of (key, value) pair to be located.
Returns
Iterator pointing to sought-after element, or end() if not found.
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 ( end() ) iterator.
template<typename_Key,typename_Tp,typename_Compare=std::less<_Key>,typename_Alloc=std::allocator<std::pair<const_Key,_Tp>>>const_iteratorstd::map<_Key,_Tp,_Compare,_Alloc>::find(constkey_type&__x)const[inline]
Tries to locate an element in a map.
Parameters__x Key of (key, value) pair to be located.
Returns
Read-only (constant) iterator pointing to sought-after element, or end() if not found.
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 ( end() ) iterator.
template<typename_Key,typename_Tp,typename_Compare=std::less<_Key>,typename_Alloc=std::allocator<std::pair<const_Key,_Tp>>>allocator_typestd::map<_Key,_Tp,_Compare,_Alloc>::get_allocator()const[inline],[noexcept]
Get a copy of the memory allocation object.
template<typename_Key,typename_Tp,typename_Compare=std::less<_Key>,typename_Alloc=std::allocator<std::pair<const_Key,_Tp>>>template<typename_InputIterator>voidstd::map<_Key,_Tp,_Compare,_Alloc>::insert(_InputIterator__first,_InputIterator__last)[inline]
Template function that attempts to insert a range of elements.
Parameters__first Iterator pointing to the start of the range to be inserted.
__last Iterator pointing to the end of the range.
Complexity similar to that of the range constructor.
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<is_constructible<value_type,_Pair>::value,pair<iterator,bool>>std::map<_Key,_Tp,_Compare,_Alloc>::insert(_Pair&&__x)[inline]
Attempts to insert a std::pair into the map.
Parameters__x Pair to be inserted (see std::make_pair for easy creation of pairs).
Returns
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.
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.
Insertion requires logarithmic time.
References std::map<_Key,_Tp,_Compare,_Alloc>::emplace_hint(), std::map<_Key,_Tp,_Compare,_Alloc>::end(), std::map<_Key,_Tp,_Compare,_Alloc>::key_comp(), and std::map<_Key,_Tp,_Compare,_Alloc>::lower_bound().
template<typename_Key,typename_Tp,typename_Compare=std::less<_Key>,typename_Alloc=std::allocator<std::pair<const_Key,_Tp>>>std::pair<iterator,bool>std::map<_Key,_Tp,_Compare,_Alloc>::insert(constvalue_type&__x)[inline]
Attempts to insert a std::pair into the map.
Parameters__x Pair to be inserted (see std::make_pair for easy creation of pairs).
Returns
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.
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.
Insertion requires logarithmic time.
template<typename_Key,typename_Tp,typename_Compare=std::less<_Key>,typename_Alloc=std::allocator<std::pair<const_Key,_Tp>>>iteratorstd::map<_Key,_Tp,_Compare,_Alloc>::insert(const_iterator__hint,node_type&&__nh)[inline]
Re-insert an extracted node.
References std::move().
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<is_constructible<value_type,_Pair>::value,iterator>std::map<_Key,_Tp,_Compare,_Alloc>::insert(const_iterator__position,_Pair&&__x)[inline]
Attempts to insert a std::pair into the map.
Parameters__position An iterator that serves as a hint as to where the pair should be inserted.
__x Pair to be inserted (see std::make_pair for easy creation of pairs).
Returns
An iterator that points to the element with key of __x (may or may not be the pair passed in).
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.
See https://gcc.gnu.org/onlinedocs/libstdc++/manual/associative.html#containers.associative.insert_hints
for more on hinting.
Insertion requires logarithmic time (if the hint is not taken).
template<typename_Key,typename_Tp,typename_Compare=std::less<_Key>,typename_Alloc=std::allocator<std::pair<const_Key,_Tp>>>iteratorstd::map<_Key,_Tp,_Compare,_Alloc>::insert(const_iterator__position,constvalue_type&__x)[inline]
Attempts to insert a std::pair into the map.
Parameters__position An iterator that serves as a hint as to where the pair should be inserted.
__x Pair to be inserted (see std::make_pair for easy creation of pairs).
Returns
An iterator that points to the element with key of __x (may or may not be the pair passed in).
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.
See https://gcc.gnu.org/onlinedocs/libstdc++/manual/associative.html#containers.associative.insert_hints
for more on hinting.
Insertion requires logarithmic time (if the hint is not taken).
template<typename_Key,typename_Tp,typename_Compare=std::less<_Key>,typename_Alloc=std::allocator<std::pair<const_Key,_Tp>>>iteratorstd::map<_Key,_Tp,_Compare,_Alloc>::insert(const_iterator__position,value_type&&__x)[inline]
Attempts to insert a std::pair into the map.
Parameters__position An iterator that serves as a hint as to where the pair should be inserted.
__x Pair to be inserted (see std::make_pair for easy creation of pairs).
Returns
An iterator that points to the element with key of __x (may or may not be the pair passed in).
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.
See https://gcc.gnu.org/onlinedocs/libstdc++/manual/associative.html#containers.associative.insert_hints
for more on hinting.
Insertion requires logarithmic time (if the hint is not taken).
References std::move().
template<typename_Key,typename_Tp,typename_Compare=std::less<_Key>,typename_Alloc=std::allocator<std::pair<const_Key,_Tp>>>insert_return_typestd::map<_Key,_Tp,_Compare,_Alloc>::insert(node_type&&__nh)[inline]
Re-insert an extracted node.
References std::move().
Referenced by std::map<_Key,_Tp,_Compare,_Alloc>::insert(), and std::map<_Key,_Tp,_Compare,_Alloc>::operator[]().
template<typename_Key,typename_Tp,typename_Compare=std::less<_Key>,typename_Alloc=std::allocator<std::pair<const_Key,_Tp>>>voidstd::map<_Key,_Tp,_Compare,_Alloc>::insert(std::initializer_list<value_type>__list)[inline]
Attempts to insert a list of std::pairs into the map.
Parameters__list A std::initializer_list<value_type> of pairs to be inserted.
Complexity similar to that of the range constructor.
References std::map<_Key,_Tp,_Compare,_Alloc>::insert().
template<typename_Key,typename_Tp,typename_Compare=std::less<_Key>,typename_Alloc=std::allocator<std::pair<const_Key,_Tp>>>std::pair<iterator,bool>std::map<_Key,_Tp,_Compare,_Alloc>::insert(value_type&&__x)[inline]
Attempts to insert a std::pair into the map.
Parameters__x Pair to be inserted (see std::make_pair for easy creation of pairs).
Returns
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.
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.
Insertion requires logarithmic time.
References std::move().
template<typename_Key,typename_Tp,typename_Compare=std::less<_Key>,typename_Alloc=std::allocator<std::pair<const_Key,_Tp>>>template<typename_Obj>pair<iterator,bool>std::map<_Key,_Tp,_Compare,_Alloc>::insert_or_assign(constkey_type&__k,_Obj&&__obj)[inline]
Attempts to insert or assign a std::pair into the map.
Parameters__k Key to use for finding a possibly existing pair in the map.
__obj Argument used to generate the .second for a pair instance.
Returns
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.
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. If the pair was
already in the map, the .second of the pair is assigned from __obj.
Insertion requires logarithmic time.
References std::map<_Key,_Tp,_Compare,_Alloc>::emplace_hint(), std::map<_Key,_Tp,_Compare,_Alloc>::end(), std::forward_as_tuple(), std::map<_Key,_Tp,_Compare,_Alloc>::key_comp(), std::map<_Key,_Tp,_Compare,_Alloc>::lower_bound(), and std::piecewise_construct.
template<typename_Key,typename_Tp,typename_Compare=std::less<_Key>,typename_Alloc=std::allocator<std::pair<const_Key,_Tp>>>template<typename_Obj>iteratorstd::map<_Key,_Tp,_Compare,_Alloc>::insert_or_assign(const_iterator__hint,constkey_type&__k,_Obj&&__obj)[inline]
Attempts to insert or assign a std::pair into the map.
Parameters__hint An iterator that serves as a hint as to where the pair should be inserted.
__k Key to use for finding a possibly existing pair in the map.
__obj Argument used to generate the .second for a pair instance.
Returns
An iterator that points to the element with key of __x (may or may not be the pair passed in).
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. If the pair was
already in the map, the .second of the pair is assigned from __obj.
Insertion requires logarithmic time.
References std::map<_Key,_Tp,_Compare,_Alloc>::emplace_hint(), std::forward_as_tuple(), and
std::piecewise_construct.
template<typename_Key,typename_Tp,typename_Compare=std::less<_Key>,typename_Alloc=std::allocator<std::pair<const_Key,_Tp>>>key_comparestd::map<_Key,_Tp,_Compare,_Alloc>::key_comp()const[inline]
Returns the key comparison object out of which the map was constructed.
Referenced by std::map<_Key,_Tp,_Compare,_Alloc>::at(), std::map<_Key,_Tp,_Compare,_Alloc>::emplace(), std::map<_Key,_Tp,_Compare,_Alloc>::insert(), std::map<_Key,_Tp,_Compare,_Alloc>::insert_or_assign(), std::map<_Key,_Tp,_Compare,_Alloc>::operator[](), and std::map<_Key,_Tp,_Compare,_Alloc>::try_emplace().
template<typename_Key,typename_Tp,typename_Compare=std::less<_Key>,typename_Alloc=std::allocator<std::pair<const_Key,_Tp>>>template<typename_Kt>autostd::map<_Key,_Tp,_Compare,_Alloc>::lower_bound(const_Kt&__x)->decltype(iterator(_M_t._M_lower_bound_tr(__x)))
[inline]"
Finds the beginning of a subsequence matching given key.
Parameters__x Key of (key, value) pair to be located.
Returns
Iterator pointing to first element equal to or greater than key, or end().
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.
template<typename_Key,typename_Tp,typename_Compare=std::less<_Key>,typename_Alloc=std::allocator<std::pair<const_Key,_Tp>>>template<typename_Kt>autostd::map<_Key,_Tp,_Compare,_Alloc>::lower_bound(const_Kt&__x)const->decltype(const_iterator(_M_t._M_lower_bound_tr(__x)))
[inline]"
Finds the beginning of a subsequence matching given key.
Parameters__x Key of (key, value) pair to be located.
Returns
Read-only (constant) iterator pointing to first element equal to or greater than key, or end().
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.
template<typename_Key,typename_Tp,typename_Compare=std::less<_Key>,typename_Alloc=std::allocator<std::pair<const_Key,_Tp>>>iteratorstd::map<_Key,_Tp,_Compare,_Alloc>::lower_bound(constkey_type&__x)[inline]
Finds the beginning of a subsequence matching given key.
Parameters__x Key of (key, value) pair to be located.
Returns
Iterator pointing to first element equal to or greater than key, or end().
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.
Referenced by std::map<_Key,_Tp,_Compare,_Alloc>::at(), std::map<_Key,_Tp,_Compare,_Alloc>::emplace(), std::map<_Key,_Tp,_Compare,_Alloc>::insert(), std::map<_Key,_Tp,_Compare,_Alloc>::insert_or_assign(), std::map<_Key,_Tp,_Compare,_Alloc>::operator[](), and std::map<_Key,_Tp,_Compare,_Alloc>::try_emplace().
template<typename_Key,typename_Tp,typename_Compare=std::less<_Key>,typename_Alloc=std::allocator<std::pair<const_Key,_Tp>>>const_iteratorstd::map<_Key,_Tp,_Compare,_Alloc>::lower_bound(constkey_type&__x)const[inline]
Finds the beginning of a subsequence matching given key.
Parameters__x Key of (key, value) pair to be located.
Returns
Read-only (constant) iterator pointing to first element equal to or greater than key, or end().
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.
template<typename_Key,typename_Tp,typename_Compare=std::less<_Key>,typename_Alloc=std::allocator<std::pair<const_Key,_Tp>>>size_typestd::map<_Key,_Tp,_Compare,_Alloc>::max_size()const[inline],[noexcept]
Returns the maximum size of the map.
template<typename_Key,typename_Tp,typename_Compare=std::less<_Key>,typename_Alloc=std::allocator<std::pair<const_Key,_Tp>>>map&std::map<_Key,_Tp,_Compare,_Alloc>::operator=(constmap<_Key,_Tp,_Compare,_Alloc>&)[default]
Map assignment operator. Whether the allocator is copied depends on the allocator traits.
template<typename_Key,typename_Tp,typename_Compare=std::less<_Key>,typename_Alloc=std::allocator<std::pair<const_Key,_Tp>>>map&std::map<_Key,_Tp,_Compare,_Alloc>::operator=(initializer_list<value_type>__l)[inline]
Map list assignment operator.
Parameters__l An initializer_list.
This function fills a map with copies of the elements in the initializer list __l.
Note that the assignment completely changes the map and that the resulting map's size is the same as the
number of elements assigned.
template<typename_Key,typename_Tp,typename_Compare=std::less<_Key>,typename_Alloc=std::allocator<std::pair<const_Key,_Tp>>>map&std::map<_Key,_Tp,_Compare,_Alloc>::operator=(map<_Key,_Tp,_Compare,_Alloc>&&)[default]
Move assignment operator.
template<typename_Key,typename_Tp,typename_Compare=std::less<_Key>,typename_Alloc=std::allocator<std::pair<const_Key,_Tp>>>mapped_type&std::map<_Key,_Tp,_Compare,_Alloc>::operator[](constkey_type&__k)[inline]
Subscript ( [] ) access to map data.
Parameters__k The key for which data should be retrieved.
Returns
A reference to the data of the (key,data) pair.
Allows for easy lookup with the subscript ( [] ) 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.
Lookup requires logarithmic time.
References std::map<_Key,_Tp,_Compare,_Alloc>::end(), std::map<_Key,_Tp,_Compare,_Alloc>::insert(), std::map<_Key,_Tp,_Compare,_Alloc>::key_comp(), std::map<_Key,_Tp,_Compare,_Alloc>::lower_bound(), and std::piecewise_construct.
template<typename_Key,typename_Tp,typename_Compare=std::less<_Key>,typename_Alloc=std::allocator<std::pair<const_Key,_Tp>>>const_reverse_iteratorstd::map<_Key,_Tp,_Compare,_Alloc>::rbegin()const[inline],[noexcept]
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.
template<typename_Key,typename_Tp,typename_Compare=std::less<_Key>,typename_Alloc=std::allocator<std::pair<const_Key,_Tp>>>reverse_iteratorstd::map<_Key,_Tp,_Compare,_Alloc>::rbegin()[inline],[noexcept]
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.
template<typename_Key,typename_Tp,typename_Compare=std::less<_Key>,typename_Alloc=std::allocator<std::pair<const_Key,_Tp>>>const_reverse_iteratorstd::map<_Key,_Tp,_Compare,_Alloc>::rend()const[inline],[noexcept]
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.
template<typename_Key,typename_Tp,typename_Compare=std::less<_Key>,typename_Alloc=std::allocator<std::pair<const_Key,_Tp>>>reverse_iteratorstd::map<_Key,_Tp,_Compare,_Alloc>::rend()[inline],[noexcept]
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.
template<typename_Key,typename_Tp,typename_Compare=std::less<_Key>,typename_Alloc=std::allocator<std::pair<const_Key,_Tp>>>size_typestd::map<_Key,_Tp,_Compare,_Alloc>::size()const[inline],[noexcept]
Returns the size of the map.
template<typename_Key,typename_Tp,typename_Compare=std::less<_Key>,typename_Alloc=std::allocator<std::pair<const_Key,_Tp>>>voidstd::map<_Key,_Tp,_Compare,_Alloc>::swap(map<_Key,_Tp,_Compare,_Alloc>&__x)[inline],[noexcept]
Swaps data with another map.
Parameters__x A map of the same element and allocator types.
This exchanges the elements between two maps in constant time. (It is only swapping a pointer, an
integer, and an instance of the Compare 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.
Whether the allocators are swapped depends on the allocator traits.
template<typename_Key,typename_Tp,typename_Compare=std::less<_Key>,typename_Alloc=std::allocator<std::pair<const_Key,_Tp>>>template<typename..._Args>pair<iterator,bool>std::map<_Key,_Tp,_Compare,_Alloc>::try_emplace(constkey_type&__k,_Args&&...__args)[inline]
Attempts to build and insert a std::pair into the map.
Parameters__k Key to use for finding a possibly existing pair in the map.
__args Arguments used to generate the .second for a new pair instance.
Returns
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.
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. If a
pair is not inserted, this function has no effect.
Insertion requires logarithmic time.
References std::map<_Key,_Tp,_Compare,_Alloc>::emplace_hint(), std::map<_Key,_Tp,_Compare,_Alloc>::end(), std::forward_as_tuple(), std::map<_Key,_Tp,_Compare,_Alloc>::key_comp(), std::map<_Key,_Tp,_Compare,_Alloc>::lower_bound(), and std::piecewise_construct.
template<typename_Key,typename_Tp,typename_Compare=std::less<_Key>,typename_Alloc=std::allocator<std::pair<const_Key,_Tp>>>template<typename..._Args>iteratorstd::map<_Key,_Tp,_Compare,_Alloc>::try_emplace(const_iterator__hint,constkey_type&__k,_Args&&...__args)[inline]
Attempts to build and insert a std::pair into the map.
Parameters__hint An iterator that serves as a hint as to where the pair should be inserted.
__k Key to use for finding a possibly existing pair in the map.
__args Arguments used to generate the .second for a new pair instance.
Returns
An iterator that points to the element with key of the std::pair built from __args (may or may not be
that std::pair).
This function is not concerned about whether the insertion took place, and thus does not return a boolean
like the single-argument try_emplace() does. However, if insertion did not take place, this function has
no effect. 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.
See https://gcc.gnu.org/onlinedocs/libstdc++/manual/associative.html#containers.associative.insert_hints
for more on hinting.
Insertion requires logarithmic time (if the hint is not taken).
References std::map<_Key,_Tp,_Compare,_Alloc>::emplace_hint(), std::forward_as_tuple(), and
std::piecewise_construct.
template<typename_Key,typename_Tp,typename_Compare=std::less<_Key>,typename_Alloc=std::allocator<std::pair<const_Key,_Tp>>>template<typename_Kt>autostd::map<_Key,_Tp,_Compare,_Alloc>::upper_bound(const_Kt&__x)->decltype(iterator(_M_t._M_upper_bound_tr(__x)))
[inline]"
Finds the end of a subsequence matching given key.
Parameters__x Key of (key, value) pair to be located.
Returns
Iterator pointing to the first element greater than key, or end().
template<typename_Key,typename_Tp,typename_Compare=std::less<_Key>,typename_Alloc=std::allocator<std::pair<const_Key,_Tp>>>template<typename_Kt>autostd::map<_Key,_Tp,_Compare,_Alloc>::upper_bound(const_Kt&__x)const->decltype(const_iterator(_M_t._M_upper_bound_tr(__x)))
[inline]"
Finds the end of a subsequence matching given key.
Parameters__x Key of (key, value) pair to be located.
Returns
Read-only (constant) iterator pointing to first iterator greater than key, or end().
template<typename_Key,typename_Tp,typename_Compare=std::less<_Key>,typename_Alloc=std::allocator<std::pair<const_Key,_Tp>>>iteratorstd::map<_Key,_Tp,_Compare,_Alloc>::upper_bound(constkey_type&__x)[inline]
Finds the end of a subsequence matching given key.
Parameters__x Key of (key, value) pair to be located.
Returns
Iterator pointing to the first element greater than key, or end().
template<typename_Key,typename_Tp,typename_Compare=std::less<_Key>,typename_Alloc=std::allocator<std::pair<const_Key,_Tp>>>const_iteratorstd::map<_Key,_Tp,_Compare,_Alloc>::upper_bound(constkey_type&__x)const[inline]
Finds the end of a subsequence matching given key.
Parameters__x Key of (key, value) pair to be located.
Returns
Read-only (constant) iterator pointing to first iterator greater than key, or end().
template<typename_Key,typename_Tp,typename_Compare=std::less<_Key>,typename_Alloc=std::allocator<std::pair<const_Key,_Tp>>>value_comparestd::map<_Key,_Tp,_Compare,_Alloc>::value_comp()const[inline]
Returns a value comparison object, built from the key comparison object out of which the map was
constructed.
Install Now
PNG Icons