|
| map ()=default |
|
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()) |
|
template<typename _InputIterator > |
| map (_InputIterator __first, _InputIterator __last, const allocator_type &__a) |
|
| map (const _Compare &__comp, const allocator_type &__a=allocator_type()) |
|
| map (const allocator_type &__a) |
|
| map (const map &)=default |
|
| map (const map &__m, const allocator_type &__a) |
|
| map (initializer_list< value_type > __l, const _Compare &__comp=_Compare(), const allocator_type &__a=allocator_type()) |
|
| map (initializer_list< value_type > __l, const allocator_type &__a) |
|
| map (map &&)=default |
|
| map (map &&__m, const allocator_type &__a) noexcept(is_nothrow_copy_constructible< _Compare >::value &&_Alloc_traits::_S_always_equal()) |
|
| ~map ()=default |
|
mapped_type & | at (const key_type &__k) |
|
const mapped_type & | at (const key_type &__k) const |
|
const_iterator | begin () const noexcept |
|
iterator | begin () noexcept |
|
const_iterator | cbegin () const noexcept |
|
const_iterator | cend () const 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 |
|
const_iterator | end () const noexcept |
|
iterator | end () noexcept |
|
node_type | extract (const key_type &__x) |
|
node_type | extract (const_iterator __pos) |
|
allocator_type | get_allocator () const noexcept |
|
iterator | insert (const_iterator __hint, node_type &&__nh) |
|
insert_return_type | insert (node_type &&__nh) |
|
size_type | max_size () const noexcept |
|
template<typename _Cmp2 > |
void | merge (map< _Key, _Tp, _Cmp2, _Alloc > &&__source) |
|
template<typename _Cmp2 > |
void | merge (map< _Key, _Tp, _Cmp2, _Alloc > &__source) |
|
template<typename _Cmp2 > |
void | merge (multimap< _Key, _Tp, _Cmp2, _Alloc > &&__source) |
|
template<typename _Cmp2 > |
void | merge (multimap< _Key, _Tp, _Cmp2, _Alloc > &__source) |
|
map & | operator= (const map &)=default |
|
map & | operator= (initializer_list< value_type > __l) |
|
map & | operator= (map &&)=default |
|
mapped_type & | operator[] (const key_type &__k) |
|
mapped_type & | operator[] (key_type &&__k) |
|
const_reverse_iterator | rbegin () const noexcept |
|
reverse_iterator | rbegin () noexcept |
|
const_reverse_iterator | rend () const noexcept |
|
reverse_iterator | rend () noexcept |
|
size_type | size () const noexcept |
|
template<typename... _Args> |
pair< iterator, bool > | try_emplace (const key_type &__k, _Args &&... __args) |
|
template<typename... _Args> |
iterator | try_emplace (const_iterator __hint, const key_type &__k, _Args &&... __args) |
|
template<typename... _Args> |
iterator | try_emplace (const_iterator __hint, key_type &&__k, _Args &&... __args) |
|
template<typename... _Args> |
pair< iterator, bool > | try_emplace (key_type &&__k, _Args &&... __args) |
|
|
template<typename , typename > |
struct | std::_Rb_tree_merge_helper |
|
template<typename _K1 , typename _T1 , typename _C1 , typename _A1 > |
bool | operator== (const map< _K1, _T1, _C1, _A1 > &, const map< _K1, _T1, _C1, _A1 > &) |
|
template<typename _K1 , typename _T1 , typename _C1 , typename _A1 > |
bool | operator< (const map< _K1, _T1, _C1, _A1 > &, const map< _K1, _T1, _C1, _A1 > &) |
|
std::pair< iterator, bool > | insert (const value_type &__x) |
|
std::pair< iterator, bool > | insert (value_type &&__x) |
|
template<typename _Pair > |
__enable_if_t< is_constructible< value_type, _Pair >::value, pair< iterator, bool > > | insert (_Pair &&__x) |
|
void | insert (std::initializer_list< value_type > __list) |
|
iterator | insert (const_iterator __position, const value_type &__x) |
|
iterator | insert (const_iterator __position, value_type &&__x) |
|
template<typename _Pair > |
__enable_if_t< is_constructible< value_type, _Pair >::value, iterator > | insert (const_iterator __position, _Pair &&__x) |
|
template<typename _InputIterator > |
void | insert (_InputIterator __first, _InputIterator __last) |
|
template<typename _Obj > |
pair< iterator, bool > | insert_or_assign (const key_type &__k, _Obj &&__obj) |
|
template<typename _Obj > |
pair< iterator, bool > | insert_or_assign (key_type &&__k, _Obj &&__obj) |
|
template<typename _Obj > |
iterator | insert_or_assign (const_iterator __hint, const key_type &__k, _Obj &&__obj) |
|
template<typename _Obj > |
iterator | insert_or_assign (const_iterator __hint, key_type &&__k, _Obj &&__obj) |
|
iterator | erase (const_iterator __position) |
|
_GLIBCXX_ABI_TAG_CXX11 iterator | erase (iterator __position) |
|
size_type | erase (const key_type &__x) |
|
iterator | erase (const_iterator __first, const_iterator __last) |
|
void | swap (map &__x) noexcept(/*conditional */) |
|
void | clear () noexcept |
|
key_compare | key_comp () const |
|
value_compare | value_comp () const |
|
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 100 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 |
|
) |
| |
|
inline |
Builds a map from a range.
- Parameters
-
__first | An input iterator. |
__last | An input iterator. |
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 273 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 290 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 _Kt >
auto std::map< _Key, _Tp, _Compare, _Alloc >::count |
( |
const _Kt & |
__x | ) |
const -> decltype(_M_t._M_count_tr(__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.
Definition at line 1221 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>
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 576 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 |
template<typename _Key , typename _Tp , typename _Compare = std::less<_Key>, typename _Alloc = std::allocator<std::pair<const _Key, _Tp> >>
template<typename _Kt >
auto std::map< _Key, _Tp, _Compare, _Alloc >::equal_range |
( |
const _Kt & |
__x | ) |
-> decltype(pair<iterator, iterator>(_M_t._M_equal_range_tr(__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.
Definition at line 1358 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 _Kt >
auto std::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 |
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 1387 of file stl_map.h.
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 |
( |
const key_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.
Definition at line 1352 of file stl_map.h.
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 |
( |
const key_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.
Definition at line 1381 of file stl_map.h.
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 1088 of file stl_map.h.
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 1031 of file stl_map.h.
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 |
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 1037 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 _Kt >
auto std::map< _Key, _Tp, _Compare, _Alloc >::find |
( |
const _Kt & |
__x | ) |
-> decltype(_M_t._M_find_tr(__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.
Definition at line 1175 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 _Kt >
auto std::map< _Key, _Tp, _Compare, _Alloc >::find |
( |
const _Kt & |
__x | ) |
const -> decltype(_M_t._M_find_tr(__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.
Definition at line 1200 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 _Pair >
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 816 of file stl_map.h.
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 803 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 _Pair >
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 875 of file stl_map.h.
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 860 of file stl_map.h.
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, |
|
|
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.
Definition at line 870 of file stl_map.h.
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 |
( |
const key_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.
Definition at line 918 of file stl_map.h.
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 >
iterator std::map< _Key, _Tp, _Compare, _Alloc >::insert_or_assign |
( |
const_iterator |
__hint, |
|
|
const key_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.
Definition at line 973 of file stl_map.h.
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 _Obj >
iterator std::map< _Key, _Tp, _Compare, _Alloc >::insert_or_assign |
( |
const_iterator |
__hint, |
|
|
key_type && |
__k, |
|
|
_Obj && |
__obj |
|
) |
| |
|
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.
Definition at line 994 of file stl_map.h.
References std::map< _Key, _Tp, _Compare, _Alloc >::emplace_hint(), std::forward_as_tuple(), std::move(), 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 >
pair<iterator, bool> std::map< _Key, _Tp, _Compare, _Alloc >::insert_or_assign |
( |
key_type && |
__k, |
|
|
_Obj && |
__obj |
|
) |
| |
|
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.
Definition at line 936 of file stl_map.h.
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(), std::move(), 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 >
auto std::map< _Key, _Tp, _Compare, _Alloc >::lower_bound |
( |
const _Kt & |
__x | ) |
-> decltype(iterator(_M_t._M_lower_bound_tr(__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.
Definition at line 1264 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 _Kt >
auto std::map< _Key, _Tp, _Compare, _Alloc >::lower_bound |
( |
const _Kt & |
__x | ) |
const -> decltype(const_iterator(_M_t._M_lower_bound_tr(__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.
Definition at line 1289 of file stl_map.h.
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 1258 of file stl_map.h.
Referenced by std::map< _Key, _Tp, _Compare, _Alloc >::at(), std::map< _Key, _Tp, _Compare, _Alloc >::insert_or_assign(), 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> >>
mapped_type& std::map< _Key, _Tp, _Compare, _Alloc >::operator[] |
( |
const key_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.
Definition at line 492 of file stl_map.h.
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 1122 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>
pair<iterator, bool> std::map< _Key, _Tp, _Compare, _Alloc >::try_emplace |
( |
const key_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.
Definition at line 691 of file stl_map.h.
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>
iterator std::map< _Key, _Tp, _Compare, _Alloc >::try_emplace |
( |
const_iterator |
__hint, |
|
|
const key_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).
Definition at line 751 of file stl_map.h.
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 >
auto std::map< _Key, _Tp, _Compare, _Alloc >::upper_bound |
( |
const _Kt & |
__x | ) |
-> decltype(iterator(_M_t._M_upper_bound_tr(__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.
Definition at line 1309 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 _Kt >
auto std::map< _Key, _Tp, _Compare, _Alloc >::upper_bound |
( |
const _Kt & |
__x | ) |
const -> decltype(const_iterator(_M_t._M_upper_bound_tr(__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.
Definition at line 1329 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 _K1 , typename _T1 , typename _C1 , typename _A1 >
bool operator< |
( |
const map< _K1, _T1, _C1, _A1 > & |
, |
|
|
const map< _K1, _T1, _C1, _A1 > & |
|
|
) |
| |
|
friend |
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> >>
template<typename _K1 , typename _T1 , typename _C1 , typename _A1 >
bool operator== |
( |
const map< _K1, _T1, _C1, _A1 > & |
, |
|
|
const map< _K1, _T1, _C1, _A1 > & |
|
|
) |
| |
|
friend |
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.