|
| | map ()=default |
| |
| | map (const _Compare &__comp, const allocator_type &__a=allocator_type()) |
| |
| | map (const map &)=default |
| |
| | map (map &&)=default |
| |
| | map (initializer_list< value_type > __l, const _Compare &__comp=_Compare(), const allocator_type &__a=allocator_type()) |
| |
| | map (const allocator_type &__a) |
| |
| | map (const map &__m, const allocator_type &__a) |
| |
| | map (map &&__m, const allocator_type &__a) noexcept(is_nothrow_copy_constructible< _Compare >::value &&_Alloc_traits::_S_always_equal()) |
| |
| | map (initializer_list< value_type > __l, const allocator_type &__a) |
| |
| template<typename _InputIterator > |
| | map (_InputIterator __first, _InputIterator __last, const allocator_type &__a) |
| |
| template<typename _InputIterator > |
| | map (_InputIterator __first, _InputIterator __last) |
| |
| template<typename _InputIterator > |
| | map (_InputIterator __first, _InputIterator __last, const _Compare &__comp, const allocator_type &__a=allocator_type()) |
| |
| | ~map ()=default |
| |
| mapped_type & | at (const key_type &__k) |
| |
|
const mapped_type & | at (const key_type &__k) const |
| |
| iterator | begin () noexcept |
| |
| const_iterator | begin () const noexcept |
| |
| const_iterator | cbegin () const noexcept |
| |
| const_iterator | cend () const noexcept |
| |
| void | clear () noexcept |
| |
| const_reverse_iterator | crbegin () const noexcept |
| |
| const_reverse_iterator | crend () const noexcept |
| |
| template<typename... _Args> |
| std::pair< iterator, bool > | emplace (_Args &&... __args) |
| |
| template<typename... _Args> |
| iterator | emplace_hint (const_iterator __pos, _Args &&... __args) |
| |
| bool | empty () const noexcept |
| |
| iterator | end () noexcept |
| |
| const_iterator | end () const noexcept |
| |
| size_type | erase (const key_type &__x) |
| |
| iterator | erase (const_iterator __first, const_iterator __last) |
| |
| allocator_type | get_allocator () const noexcept |
| |
| std::pair< iterator, bool > | insert (const value_type &__x) |
| |
|
template<typename _Pair , typename = typename std::enable_if<std::is_constructible<value_type, _Pair&&>::value>::type> |
| std::pair< iterator, bool > | insert (_Pair &&__x) |
| |
| void | insert (std::initializer_list< value_type > __list) |
| |
| iterator | insert (const_iterator __position, const value_type &__x) |
| |
|
template<typename _Pair , typename = typename std::enable_if<std::is_constructible<value_type, _Pair&&>::value>::type> |
| iterator | insert (const_iterator __position, _Pair &&__x) |
| |
| template<typename _InputIterator > |
| void | insert (_InputIterator __first, _InputIterator __last) |
| |
| key_compare | key_comp () const |
| |
| size_type | max_size () const noexcept |
| |
| map & | operator= (const map &)=default |
| |
| map & | operator= (map &&)=default |
| |
| map & | operator= (initializer_list< value_type > __l) |
| |
| mapped_type & | operator[] (const key_type &__k) |
| |
|
mapped_type & | operator[] (key_type &&__k) |
| |
| reverse_iterator | rbegin () noexcept |
| |
| const_reverse_iterator | rbegin () const noexcept |
| |
| reverse_iterator | rend () noexcept |
| |
| const_reverse_iterator | rend () const noexcept |
| |
| size_type | size () const noexcept |
| |
| void | swap (map &__x) noexcept(/*conditional */) |
| |
| value_compare | value_comp () const |
| |
|
| iterator | erase (const_iterator __position) |
| |
| _GLIBCXX_ABI_TAG_CXX11 iterator | erase (iterator __position) |
| |
|
| iterator | find (const key_type &__x) |
| |
| template<typename _Kt > |
| auto | find (const _Kt &__x) -> decltype(_M_t._M_find_tr(__x)) |
| |
|
| const_iterator | find (const key_type &__x) const |
| |
| template<typename _Kt > |
| auto | find (const _Kt &__x) const -> decltype(_M_t._M_find_tr(__x)) |
| |
|
| size_type | count (const key_type &__x) const |
| |
| template<typename _Kt > |
| auto | count (const _Kt &__x) const -> decltype(_M_t._M_count_tr(__x)) |
| |
|
| iterator | lower_bound (const key_type &__x) |
| |
| template<typename _Kt > |
| auto | lower_bound (const _Kt &__x) -> decltype(iterator(_M_t._M_lower_bound_tr(__x))) |
| |
|
| const_iterator | lower_bound (const key_type &__x) const |
| |
| template<typename _Kt > |
| auto | lower_bound (const _Kt &__x) const -> decltype(const_iterator(_M_t._M_lower_bound_tr(__x))) |
| |
|
| iterator | upper_bound (const key_type &__x) |
| |
| template<typename _Kt > |
| auto | upper_bound (const _Kt &__x) -> decltype(iterator(_M_t._M_upper_bound_tr(__x))) |
| |
|
| const_iterator | upper_bound (const key_type &__x) const |
| |
| template<typename _Kt > |
| auto | upper_bound (const _Kt &__x) const -> decltype(const_iterator(_M_t._M_upper_bound_tr(__x))) |
| |
|
| std::pair< iterator, iterator > | equal_range (const key_type &__x) |
| |
| template<typename _Kt > |
| auto | equal_range (const _Kt &__x) -> decltype(pair< iterator, iterator >(_M_t._M_equal_range_tr(__x))) |
| |
|
| std::pair< const_iterator, const_iterator > | equal_range (const key_type &__x) const |
| |
| template<typename _Kt > |
| auto | equal_range (const _Kt &__x) const -> decltype(pair< const_iterator, const_iterator >(_M_t._M_equal_range_tr(__x))) |
| |
template<typename _Key, typename _Tp, typename _Compare = std::less<_Key>, typename _Alloc = std::allocator<std::pair<const _Key, _Tp> >>
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.
- Template Parameters
-
| _Key | Type of key objects. |
| _Tp | Type of mapped objects. |
| _Compare | Comparison function object type, defaults to less<_Key>. |
| _Alloc | Allocator type, defaults to allocator<pair<const _Key, _Tp>. |
Meets the requirements of a container, a reversible container, and an associative container (using unique keys). For a map<Key,T> the key_type is Key, the mapped_type is T, and the value_type is std::pair<const Key,T>.
Maps support bidirectional iterators.
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).
Definition at line 99 of file stl_map.h.
template<typename _Key, typename _Tp, typename _Compare = std::less<_Key>, typename _Alloc = std::allocator<std::pair<const _Key, _Tp> >>
template<typename _InputIterator >
| std::map< _Key, _Tp, _Compare, _Alloc >::map |
( |
_InputIterator |
__first, |
|
|
_InputIterator |
__last, |
|
|
const _Compare & |
__comp, |
|
|
const allocator_type & |
__a = allocator_type() |
|
) |
| |
|
inline |
Builds a map from a range.
- Parameters
-
| __first | An input iterator. |
| __last | An input iterator. |
| __comp | A comparison functor. |
| __a | An allocator object. |
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)).
Definition at line 282 of file stl_map.h.
References std::map< _Key, _Tp, _Compare, _Alloc >::operator=(), and std::map< _Key, _Tp, _Compare, _Alloc >::~map().
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.
Definition at line 568 of file stl_map.h.
template<typename _Key, typename _Tp, typename _Compare = std::less<_Key>, typename _Alloc = std::allocator<std::pair<const _Key, _Tp> >>
template<typename... _Args>
| iterator std::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).
Definition at line 598 of file stl_map.h.
Referenced by 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> >>
| iterator std::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.
Definition at line 1010 of file stl_map.h.
Referenced by std::map< _Key, _Tp, _Compare, _Alloc >::erase().
template<typename _Key, typename _Tp, typename _Compare = std::less<_Key>, typename _Alloc = std::allocator<std::pair<const _Key, _Tp> >>
| _GLIBCXX_ABI_TAG_CXX11 iterator std::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.
Definition at line 1016 of file stl_map.h.
References std::map< _Key, _Tp, _Compare, _Alloc >::erase().
template<typename _Key, typename _Tp, typename _Compare = std::less<_Key>, typename _Alloc = std::allocator<std::pair<const _Key, _Tp> >>
| iterator std::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.
Definition at line 1067 of file stl_map.h.
References std::map< _Key, _Tp, _Compare, _Alloc >::erase().
template<typename _Key, typename _Tp, typename _Compare = std::less<_Key>, typename _Alloc = std::allocator<std::pair<const _Key, _Tp> >>
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.
Definition at line 795 of file stl_map.h.
Referenced by 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> >>
| iterator std::map< _Key, _Tp, _Compare, _Alloc >::insert |
( |
const_iterator |
__position, |
|
|
const 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).
Definition at line 845 of file stl_map.h.
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> >>
template<typename _InputIterator >
| void std::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.
Definition at line 871 of file stl_map.h.
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.
template<typename _Key, typename _Tp, typename _Compare = std::less<_Key>, typename _Alloc = std::allocator<std::pair<const _Key, _Tp> >>
| iterator std::map< _Key, _Tp, _Compare, _Alloc >::lower_bound |
( |
const key_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.
Definition at line 1218 of file stl_map.h.
Referenced by std::map< _Key, _Tp, _Compare, _Alloc >::at(), and 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> >>
| void std::map< _Key, _Tp, _Compare, _Alloc >::swap |
( |
map< _Key, _Tp, _Compare, _Alloc > & |
__x | ) |
|
|
inlinenoexcept |
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.
Definition at line 1101 of file stl_map.h.
1.8.13