- Generated by
1.9.7
|
libstdc++
|
#include <stl_map.h>
Public Types | |
| typedef _Alloc | allocator_type |
| typedef _Rep_type::const_iterator | const_iterator |
| typedef _Alloc_traits::const_pointer | const_pointer |
| typedef _Alloc_traits::const_reference | const_reference |
| typedef _Rep_type::const_reverse_iterator | const_reverse_iterator |
| typedef _Rep_type::difference_type | difference_type |
| using | insert_return_type = typename _Rep_type::insert_return_type |
| typedef _Rep_type::iterator | iterator |
| typedef _Compare | key_compare |
| typedef _Key | key_type |
| typedef _Tp | mapped_type |
| using | node_type = typename _Rep_type::node_type |
| typedef _Alloc_traits::pointer | pointer |
| typedef _Alloc_traits::reference | reference |
| typedef _Rep_type::reverse_iterator | reverse_iterator |
| typedef _Rep_type::size_type | size_type |
| typedef std::pair< const _Key, _Tp > | value_type |
Public Member Functions | |
| 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 __type_identity_t< 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 __type_identity_t< 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 |
| 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 |
| const_iterator | end () const noexcept |
| iterator | end () noexcept |
| size_type | erase (const key_type &__x) |
| iterator | erase (const_iterator __first, const_iterator __last) |
| node_type | extract (const key_type &__x) |
| node_type | extract (const_iterator __pos) |
| allocator_type | get_allocator () const noexcept |
| template<typename _InputIterator > | |
| void | insert (_InputIterator __first, _InputIterator __last) |
| iterator | insert (const_iterator __hint, node_type &&__nh) |
| insert_return_type | insert (node_type &&__nh) |
| void | insert (std::initializer_list< value_type > __list) |
| template<typename _Obj > | |
| pair< iterator, bool > | insert_or_assign (const 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) |
| template<typename _Obj > | |
| pair< iterator, bool > | insert_or_assign (key_type &&__k, _Obj &&__obj) |
| key_compare | key_comp () const |
| 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 |
| void | swap (map &__x) noexcept(/*conditional */) |
| 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) |
| value_compare | value_comp () const |
| 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) |
| 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) |
| 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)) |
| bool | contains (const key_type &__x) const |
| template<typename _Kt > | |
| auto | contains (const _Kt &__x) const -> decltype(_M_t._M_find_tr(__x), void(), true) |
| 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))) |
Friends | |
| 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 > &) |
| template<typename , typename > | |
| struct | std::_Rb_tree_merge_helper |
A standard container made up of (key,value) pairs, which can be retrieved based on a key, in logarithmic time.
| _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).
| typedef _Alloc std::map< _Key, _Tp, _Compare, _Alloc >::allocator_type |
| typedef _Rep_type::const_iterator std::map< _Key, _Tp, _Compare, _Alloc >::const_iterator |
| typedef _Alloc_traits::const_pointer std::map< _Key, _Tp, _Compare, _Alloc >::const_pointer |
| typedef _Alloc_traits::const_reference std::map< _Key, _Tp, _Compare, _Alloc >::const_reference |
| typedef _Rep_type::const_reverse_iterator std::map< _Key, _Tp, _Compare, _Alloc >::const_reverse_iterator |
| typedef _Rep_type::difference_type std::map< _Key, _Tp, _Compare, _Alloc >::difference_type |
| using std::map< _Key, _Tp, _Compare, _Alloc >::insert_return_type = typename _Rep_type::insert_return_type |
| typedef _Rep_type::iterator std::map< _Key, _Tp, _Compare, _Alloc >::iterator |
| typedef _Compare std::map< _Key, _Tp, _Compare, _Alloc >::key_compare |
| typedef _Key std::map< _Key, _Tp, _Compare, _Alloc >::key_type |
| typedef _Tp std::map< _Key, _Tp, _Compare, _Alloc >::mapped_type |
| using std::map< _Key, _Tp, _Compare, _Alloc >::node_type = typename _Rep_type::node_type |
| typedef _Alloc_traits::pointer std::map< _Key, _Tp, _Compare, _Alloc >::pointer |
| typedef _Alloc_traits::reference std::map< _Key, _Tp, _Compare, _Alloc >::reference |
| typedef _Rep_type::reverse_iterator std::map< _Key, _Tp, _Compare, _Alloc >::reverse_iterator |
| typedef _Rep_type::size_type std::map< _Key, _Tp, _Compare, _Alloc >::size_type |
|
default |
Default constructor creates no elements.
|
inlineexplicit |
|
default |
Map copy constructor.
Whether the allocator is copied depends on the allocator traits.
|
default |
Map move constructor.
The newly-created map contains the exact contents of the moved instance. The moved instance is a valid, but unspecified, map.
|
inline |
Builds a map from an initializer_list.
| __l | An initializer_list. |
| __comp | A comparison object. |
| __a | An allocator object. |
Create a map consisting of copies of the elements in the initializer_list __l. This is linear in N if the range is already sorted, and NlogN otherwise (where N is __l.size()).
|
inlineexplicit |
|
inline |
|
inline |
|
inline |
Builds a map from a range.
| __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)).
|
inline |
Builds a map from a range.
| __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)).
|
default |
The dtor only erases the elements, and note that if the elements themselves are pointers, the pointed-to memory is not touched in any way. Managing the pointer is the user's responsibility.
|
inline |
Access to map data.
| __k | The key for which data should be retrieved. |
| std::out_of_range | If no such data is present. |
Definition at line 547 of file stl_map.h.
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().
|
inline |
|
inlinenoexcept |
|
inlinenoexcept |
|
inlinenoexcept |
|
inlinenoexcept |
|
inlinenoexcept |
|
inline |
|
inline |
|
inline |
Finds the number of elements with given key.
| __x | Key of (key, value) pairs to be located. |
This function only makes sense for multimaps; for map the result will either be 0 (not present) or 1 (present).
|
inline |
Finds the number of elements with given key.
| __x | Key of (key, value) pairs to be located. |
This function only makes sense for multimaps; for map the result will either be 0 (not present) or 1 (present).
|
inlinenoexcept |
|
inlinenoexcept |
|
inline |
Attempts to build and insert a std::pair into the map.
| __args | Arguments used to generate a new pair instance (see std::piecewise_contruct for passing arguments to each part of the pair constructor). |
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 586 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(), and std::map< _Key, _Tp, _Compare, _Alloc >::lower_bound().
|
inline |
Attempts to build and insert a std::pair into the map.
| __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). |
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 636 of file stl_map.h.
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().
|
inlinenoexcept |
|
inlinenoexcept |
|
inlinenoexcept |
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.
Definition at line 384 of file stl_map.h.
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().
|
inline |
Finds a subsequence matching given key.
| __x | Key of (key, value) pairs to be located. |
This function is equivalent to
(but is faster than making the calls separately).
This function probably only makes sense for multimaps.
|
inline |
Finds a subsequence matching given key.
| __x | Key of (key, value) pairs to be located. |
This function is equivalent to
(but is faster than making the calls separately).
This function probably only makes sense for multimaps.
|
inline |
Finds a subsequence matching given key.
| __x | Key of (key, value) pairs to be located. |
This function is equivalent to
(but is faster than making the calls separately).
This function probably only makes sense for multimaps.
|
inline |
Finds a subsequence matching given key.
| __x | Key of (key, value) pairs to be located. |
This function is equivalent to
(but is faster than making the calls separately).
This function probably only makes sense for multimaps.
|
inline |
Erases elements according to the provided key.
| __x | Key of element to be 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.
|
inline |
Erases a [first,last) range of elements from a map.
| __first | Iterator pointing to the start of the range to be erased. |
| __last | Iterator pointing to the end of the range to be erased. |
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.
|
inline |
Erases an element from a map.
| __position | An iterator pointing to the element to be erased. |
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.
|
inline |
Erases an element from a map.
| __position | An iterator pointing to the element to be erased. |
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.
|
inline |
|
inline |
Extract a node.
Definition at line 646 of file stl_map.h.
References std::map< _Key, _Tp, _Compare, _Alloc >::end().
|
inline |
Tries to locate an element in a map.
| __x | Key of (key, value) pair to be located. |
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.
|
inline |
Tries to locate an element in a map.
| __x | Key of (key, value) pair to be located. |
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.
|
inline |
Tries to locate an element in a map.
| __x | Key of (key, value) pair to be located. |
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.
|
inline |
Tries to locate an element in a map.
| __x | Key of (key, value) pair to be located. |
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.
|
inlinenoexcept |
|
inline |
|
inline |
Attempts to insert a std::pair into the map.
| __x | Pair to be inserted (see std::make_pair for easy creation of pairs). |
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 846 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(), and std::map< _Key, _Tp, _Compare, _Alloc >::lower_bound().
|
inline |
Attempts to insert a std::pair into the map.
| __x | Pair to be inserted (see std::make_pair for easy creation of pairs). |
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.
|
inline |
|
inline |
Attempts to insert a std::pair into the map.
| __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). |
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).
|
inline |
Attempts to insert a std::pair into the map.
| __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). |
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).
|
inline |
Attempts to insert a std::pair into the map.
| __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). |
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 918 of file stl_map.h.
References std::move().
|
inline |
Re-insert an extracted node.
Definition at line 659 of file stl_map.h.
References std::move().
Referenced by std::map< _Key, _Tp, _Compare, _Alloc >::insert(), and std::map< _Key, _Tp, _Compare, _Alloc >::operator[]().
|
inline |
Attempts to insert a list of std::pairs into the map.
| __list | A std::initializer_list<value_type> of pairs to be inserted. |
Complexity similar to that of the range constructor.
Definition at line 878 of file stl_map.h.
References std::map< _Key, _Tp, _Compare, _Alloc >::insert().
|
inline |
Attempts to insert a std::pair into the map.
| __x | Pair to be inserted (see std::make_pair for easy creation of pairs). |
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 840 of file stl_map.h.
References std::move().
|
inline |
Attempts to insert or assign a std::pair into the map.
| __k | Key to use for finding a possibly existing pair in the map. |
| __obj | Argument used to generate the .second for a pair instance. |
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 966 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.
|
inline |
Attempts to insert or assign a std::pair into the map.
| __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. |
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 1021 of file stl_map.h.
References std::map< _Key, _Tp, _Compare, _Alloc >::emplace_hint(), std::forward_as_tuple(), and std::piecewise_construct.
|
inline |
|
inline |
Returns the key comparison object out of which the map was constructed.
Definition at line 1190 of file stl_map.h.
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().
|
inline |
Finds the beginning of a subsequence matching given key.
| __x | Key of (key, value) pair to be located. |
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.
|
inline |
Finds the beginning of a subsequence matching given key.
| __x | Key of (key, value) pair to be located. |
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.
|
inline |
Finds the beginning of a subsequence matching given key.
| __x | Key of (key, value) pair to be located. |
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 1306 of file stl_map.h.
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().
|
inline |
Finds the beginning of a subsequence matching given key.
| __x | Key of (key, value) pair to be located. |
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.
|
inlinenoexcept |
|
default |
Map assignment operator.
Whether the allocator is copied depends on the allocator traits.
|
inline |
Map list assignment operator.
| __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.
|
default |
Move assignment operator.
|
inline |
Subscript ( [] ) access to map data.
| __k | The key for which data should be retrieved. |
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 502 of file stl_map.h.
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.
|
inline |
|
inlinenoexcept |
|
inlinenoexcept |
|
inlinenoexcept |
|
inlinenoexcept |
|
inlinenoexcept |
|
inlinenoexcept |
Swaps data with another map.
| __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.
|
inline |
Attempts to build and insert a std::pair into the map.
| __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. |
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 721 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.
|
inline |
Attempts to build and insert a std::pair into the map.
| __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. |
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 781 of file stl_map.h.
References std::map< _Key, _Tp, _Compare, _Alloc >::emplace_hint(), std::forward_as_tuple(), and std::piecewise_construct.
|
inline |
|
inline |
|
inline |
|
inline |
|
inline |
|
inline |
|
friend |
1.9.7