libstdc++
|
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 |
typedef _Rep_type::iterator | iterator |
typedef _Compare | key_compare |
typedef _Key | key_type |
typedef _Tp | mapped_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 | |
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> | |
iterator | 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 |
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) |
allocator_type | get_allocator () const noexcept |
iterator | insert (const value_type &__x) |
template<typename _Pair , typename = typename std::enable_if<std::is_constructible<value_type, _Pair&&>::value>::type> | |
iterator | insert (_Pair &&__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) |
void | insert (initializer_list< value_type > __l) |
key_compare | key_comp () const |
size_type | max_size () const noexcept |
void | noexcept () |
multimap & | operator= (initializer_list< value_type > __l) |
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 |
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)) |
const_iterator | lower_bound (const key_type &__x) const |
template<typename _Kt > | |
auto | lower_bound (const _Kt &__x) const -> decltype(_M_t._M_lower_bound_tr(__x)) |
const_iterator | upper_bound (const key_type &__x) const |
template<typename _Kt > | |
auto | upper_bound (const _Kt &__x) const -> decltype(_M_t._M_upper_bound_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(_M_t._M_equal_range_tr(__x)) |
Public Attributes | |
const allocator_type & | __a |
__pad0__: _M_t() { } explicit multimap(const _Compare& __comp | |
iterator | |
Friends | |
template<typename _K1 , typename _T1 , typename _C1 , typename _A1 > | |
bool | operator< (const multimap< _K1, _T1, _C1, _A1 > &, const multimap< _K1, _T1, _C1, _A1 > &) |
template<typename _K1 , typename _T1 , typename _C1 , typename _A1 > | |
bool | operator== (const multimap< _K1, _T1, _C1, _A1 > &, const multimap< _K1, _T1, _C1, _A1 > &) |
template<typename _Kt > | |
decltype(_M_t._M_lower_bound_tr(__x)) | auto |
iterator | lower_bound (const key_type &__x) |
template<typename _Kt > | |
decltype(_M_t._M_upper_bound_tr(__x)) | auto |
iterator | upper_bound (const key_type &__x) |
template<typename _Kt > | |
decltype(_M_t._M_equal_range_tr(__x)) | auto |
std::pair< iterator, iterator > | equal_range (const key_type &__x) |
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 equivalent keys). For a multimap<Key,T>
the key_type is Key, the mapped_type is T, and the value_type is std::pair<const Key,T>.
Multimaps 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 95 of file stl_multimap.h.
|
inlinenoexcept |
Returns a read/write iterator that points to the first pair in the multimap. Iteration is done in ascending order according to the keys.
Definition at line 333 of file stl_multimap.h.
|
inlinenoexcept |
Returns a read-only (constant) iterator that points to the first pair in the multimap. Iteration is done in ascending order according to the keys.
Definition at line 342 of file stl_multimap.h.
|
inlinenoexcept |
Returns a read-only (constant) iterator that points to the first pair in the multimap. Iteration is done in ascending order according to the keys.
Definition at line 406 of file stl_multimap.h.
|
inlinenoexcept |
Returns a read-only (constant) iterator that points one past the last pair in the multimap. Iteration is done in ascending order according to the keys.
Definition at line 415 of file stl_multimap.h.
|
inlinenoexcept |
Erases all elements in a multimap. 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.
Definition at line 717 of file stl_multimap.h.
|
inline |
Finds the number of elements with given key.
__x | Key of (key, value) pairs to be located. |
Definition at line 794 of file stl_multimap.h.
|
inline |
Finds the number of elements with given key.
__x | Key of (key, value) pairs to be located. |
Definition at line 800 of file stl_multimap.h.
|
inlinenoexcept |
Returns a read-only (constant) reverse iterator that points to the last pair in the multimap. Iteration is done in descending order according to the keys.
Definition at line 424 of file stl_multimap.h.
|
inlinenoexcept |
Returns a read-only (constant) reverse iterator that points to one before the first pair in the multimap. Iteration is done in descending order according to the keys.
Definition at line 433 of file stl_multimap.h.
|
inline |
Build and insert a std::pair into the multimap.
__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 builds and inserts a (key, value) pair into the multimap. Contrary to a std::map the multimap does not rely on unique keys and thus multiple pairs with the same key can be inserted.
Insertion requires logarithmic time.
Definition at line 473 of file stl_multimap.h.
|
inline |
Builds and inserts a std::pair into the multimap.
__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 inserts a (key, value) pair into the multimap. Contrary to a std::map the multimap does not rely on unique keys and thus multiple pairs with the same key can be inserted. 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.
For more on hinting, see: https://gcc.gnu.org/onlinedocs/libstdc++/manual/associative.html#containers.associative.insert_hints
Insertion requires logarithmic time (if the hint is not taken).
Definition at line 500 of file stl_multimap.h.
|
inlinenoexcept |
Returns true if the multimap is empty.
Definition at line 440 of file stl_multimap.h.
|
inlinenoexcept |
Returns a read/write iterator that points one past the last pair in the multimap. Iteration is done in ascending order according to the keys.
Definition at line 351 of file stl_multimap.h.
|
inlinenoexcept |
Returns a read-only (constant) iterator that points one past the last pair in the multimap. Iteration is done in ascending order according to the keys.
Definition at line 360 of file stl_multimap.h.
|
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).
Definition at line 910 of file stl_multimap.h.
|
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).
Definition at line 937 of file stl_multimap.h.
|
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).
Definition at line 943 of file stl_multimap.h.
|
inline |
Erases an element from a multimap.
__position | An iterator pointing to the element to be erased. |
This function erases an element, pointed to by the given iterator, from a multimap. 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 614 of file stl_multimap.h.
|
inline |
Erases elements according to the provided key.
__x | Key of element to be erased. |
This function erases all elements located by the given key from a multimap. 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 650 of file stl_multimap.h.
|
inline |
Erases a [first,last) range of elements from a multimap.
__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 multimap. 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.
Definition at line 671 of file stl_multimap.h.
|
inline |
Tries to locate an element in a multimap.
__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.
Definition at line 752 of file stl_multimap.h.
|
inline |
Tries to locate an element in a multimap.
__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.
Definition at line 758 of file stl_multimap.h.
|
inline |
Tries to locate an element in a multimap.
__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.
Definition at line 776 of file stl_multimap.h.
|
inline |
Tries to locate an element in a multimap.
__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.
Definition at line 782 of file stl_multimap.h.
|
inlinenoexcept |
Get a copy of the memory allocation object.
Definition at line 323 of file stl_multimap.h.
|
inline |
Inserts a std::pair into the multimap.
__x | Pair to be inserted (see std::make_pair for easy creation of pairs). |
This function inserts a (key, value) pair into the multimap. Contrary to a std::map the multimap does not rely on unique keys and thus multiple pairs with the same key can be inserted.
Insertion requires logarithmic time.
Definition at line 520 of file stl_multimap.h.
Referenced by std::multimap< _Key, _Tp, _Compare, _Alloc >::insert().
|
inline |
A template function that attempts to insert a range of elements.
__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 581 of file stl_multimap.h.
|
inline |
Attempts to insert a list of std::pairs into the multimap.
__l | A std::initializer_list<value_type> of pairs to be inserted. |
Complexity similar to that of the range constructor.
Definition at line 593 of file stl_multimap.h.
References std::multimap< _Key, _Tp, _Compare, _Alloc >::insert().
|
inline |
Returns the key comparison object out of which the multimap was constructed.
Definition at line 726 of file stl_multimap.h.
|
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 818 of file stl_multimap.h.
|
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 the iterator will point to the next greatest element or, if no such greater element exists, to end().
Definition at line 843 of file stl_multimap.h.
|
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 the iterator will point to the next greatest element or, if no such greater element exists, to end().
Definition at line 849 of file stl_multimap.h.
|
inlinenoexcept |
Returns the maximum size of the multimap.
Definition at line 450 of file stl_multimap.h.
|
inline |
Swaps data with another multimap.
__x | A multimap of the same element and allocator types. |
This exchanges the elements between two multimaps 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.
Definition at line 707 of file stl_multimap.h.
|
inline |
Multimap list assignment operator.
__l | An initializer_list. |
This function fills a multimap with copies of the elements in the initializer list __l.
Note that the assignment completely changes the multimap and that the resulting multimap's size is the same as the number of elements assigned. Old data may be lost.
Definition at line 314 of file stl_multimap.h.
|
inlinenoexcept |
Returns a read/write reverse iterator that points to the last pair in the multimap. Iteration is done in descending order according to the keys.
Definition at line 369 of file stl_multimap.h.
|
inlinenoexcept |
Returns a read-only (constant) reverse iterator that points to the last pair in the multimap. Iteration is done in descending order according to the keys.
Definition at line 378 of file stl_multimap.h.
|
inlinenoexcept |
Returns a read/write reverse iterator that points to one before the first pair in the multimap. Iteration is done in descending order according to the keys.
Definition at line 387 of file stl_multimap.h.
|
inlinenoexcept |
Returns a read-only (constant) reverse iterator that points to one before the first pair in the multimap. Iteration is done in descending order according to the keys.
Definition at line 396 of file stl_multimap.h.
|
inlinenoexcept |
Returns the size of the multimap.
Definition at line 445 of file stl_multimap.h.
|
inline |
Finds the end of a subsequence matching given key.
__x | Key of (key, value) pair to be located. |
Definition at line 863 of file stl_multimap.h.
|
inline |
Finds the end of a subsequence matching given key.
__x | Key of (key, value) pair to be located. |
Definition at line 883 of file stl_multimap.h.
|
inline |
Finds the end of a subsequence matching given key.
__x | Key of (key, value) pair to be located. |
Definition at line 889 of file stl_multimap.h.
|
inline |
Returns a value comparison object, built from the key comparison object out of which the multimap was constructed.
Definition at line 734 of file stl_multimap.h.
std::multimap< _Key, _Tp, _Compare, _Alloc >::__pad0__ |
Default constructor creates no elements.
Definition at line 172 of file stl_multimap.h.
decltype(_M_t._M_lower_bound_tr(__x)) std::multimap< _Key, _Tp, _Compare, _Alloc >::auto |
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 826 of file stl_multimap.h.
decltype(_M_t._M_upper_bound_tr(__x)) std::multimap< _Key, _Tp, _Compare, _Alloc >::auto |
Finds the end of a subsequence matching given key.
__x | Key of (key, value) pair to be located. |
Definition at line 871 of file stl_multimap.h.
decltype(_M_t._M_equal_range_tr(__x)) std::multimap< _Key, _Tp, _Compare, _Alloc >::auto |
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).
Definition at line 918 of file stl_multimap.h.
std::multimap< _Key, _Tp, _Compare, _Alloc >::iterator |
Inserts a std::pair into the multimap.
__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 inserts a (key, value) pair into the multimap. Contrary to a std::map the multimap does not rely on unique keys and thus multiple pairs with the same key can be inserted. 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.
For more on hinting, see: https://gcc.gnu.org/onlinedocs/libstdc++/manual/associative.html#containers.associative.insert_hints
Insertion requires logarithmic time (if the hint is not taken).
Definition at line 558 of file stl_multimap.h.