| std::multimap< _Key, _Tp, _Compare, _Alloc >(3cxx) | std::multimap< _Key, _Tp, _Compare, _Alloc >(3cxx) |
NAME¶
std::multimap< _Key, _Tp, _Compare, _Alloc > -SYNOPSIS¶
Public Types¶
typedef _Alloc allocator_type
Public Member Functions¶
multimap ()
Friends¶
template<typename _K1 , typename _T1 , typename _C1 , typename _A1 > bool operator< (const multimap< _K1, _T1, _C1, _A1 > &, const multimap< _K1, _T1, _C1, _A1 > &)
Detailed Description¶
template<typename _Key, typename _Tp, typename _Compare = std::less<_Key>, typename _Alloc = std::allocator<std::pair<const _Key, _Tp> >>class std::multimap< _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 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.
Constructor & Destructor Documentation¶
template<typename _Key, typename _Tp, typename _Compare = std::less<_Key>, typename _Alloc = std::allocator<std::pair<const _Key, _Tp> >> std::multimap< _Key, _Tp, _Compare, _Alloc >:: multimap () [inline]¶
Default constructor creates no elements. Definition at line 157 of file stl_multimap.h.template<typename _Key, typename _Tp, typename _Compare = std::less<_Key>, typename _Alloc = std::allocator<std::pair<const _Key, _Tp> >> std::multimap< _Key, _Tp, _Compare, _Alloc >:: multimap (const _Compare &__comp, const allocator_type &__a = allocator_type()) [inline], [explicit]¶
Creates a multimap with no elements. Parameters:__comp A comparison object.
__a An allocator object.
Definition at line 166 of file stl_multimap.h.
template<typename _Key, typename _Tp, typename _Compare = std::less<_Key>, typename _Alloc = std::allocator<std::pair<const _Key, _Tp> >> std::multimap< _Key, _Tp, _Compare, _Alloc >:: multimap (const multimap< _Key, _Tp, _Compare, _Alloc > &__x) [inline]¶
Multimap copy constructor. Parameters:__x A multimap of identical element and allocator
types.
The newly-created multimap uses a copy of the allocation object used by
__x.
Definition at line 177 of file stl_multimap.h.
template<typename _Key, typename _Tp, typename _Compare = std::less<_Key>, typename _Alloc = std::allocator<std::pair<const _Key, _Tp> >> std::multimap< _Key, _Tp, _Compare, _Alloc >:: multimap (multimap< _Key, _Tp, _Compare, _Alloc > &&__x) [inline], [noexcept]¶
Multimap move constructor. Parameters:__x A multimap of identical element and allocator
types.
The newly-created multimap contains the exact contents of __x. The
contents of __x are a valid, but unspecified multimap.
Definition at line 188 of file stl_multimap.h.
template<typename _Key, typename _Tp, typename _Compare = std::less<_Key>, typename _Alloc = std::allocator<std::pair<const _Key, _Tp> >> std::multimap< _Key, _Tp, _Compare, _Alloc >:: multimap (initializer_list< value_type >__l, const _Compare &__comp = _Compare(), const allocator_type &__a = allocator_type()) [inline]¶
Builds a multimap from an initializer_list. Parameters:__l An initializer_list.
__comp A comparison functor.
__a An allocator object.
Create a multimap consisting of copies of the elements from the
initializer_list. This is linear in N if the list is already sorted, and NlogN
otherwise (where N is __l.size()).
Definition at line 202 of file stl_multimap.h.
template<typename _Key, typename _Tp, typename _Compare = std::less<_Key>, typename _Alloc = std::allocator<std::pair<const _Key, _Tp> >> template<typename _InputIterator > std::multimap< _Key, _Tp, _Compare, _Alloc >:: multimap (_InputIterator__first, _InputIterator__last) [inline]¶
Builds a multimap from a range. Parameters:__first An input iterator.
__last An input iterator.
Create a multimap 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 219 of file stl_multimap.h.
template<typename _Key, typename _Tp, typename _Compare = std::less<_Key>, typename _Alloc = std::allocator<std::pair<const _Key, _Tp> >> template<typename _InputIterator > std::multimap< _Key, _Tp, _Compare, _Alloc >:: multimap (_InputIterator__first, _InputIterator__last, const _Compare &__comp, const allocator_type &__a = allocator_type()) [inline]¶
Builds a multimap from a range. Parameters:__first An input iterator.
__last An input iterator.
__comp A comparison functor.
__a An allocator object.
Create a multimap 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 235 of file stl_multimap.h.
Member Function Documentation¶
template<typename _Key, typename _Tp, typename _Compare = std::less<_Key>, typename _Alloc = std::allocator<std::pair<const _Key, _Tp> >> iterator std::multimap< _Key, _Tp, _Compare, _Alloc >::begin () [inline], [noexcept]¶
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 314 of file stl_multimap.h.template<typename _Key, typename _Tp, typename _Compare = std::less<_Key>, typename _Alloc = std::allocator<std::pair<const _Key, _Tp> >> const_iterator std::multimap< _Key, _Tp, _Compare, _Alloc >::begin () const [inline], [noexcept]¶
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 323 of file stl_multimap.h.template<typename _Key, typename _Tp, typename _Compare = std::less<_Key>, typename _Alloc = std::allocator<std::pair<const _Key, _Tp> >> const_iterator std::multimap< _Key, _Tp, _Compare, _Alloc >::cbegin () const [inline], [noexcept]¶
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 387 of file stl_multimap.h.template<typename _Key, typename _Tp, typename _Compare = std::less<_Key>, typename _Alloc = std::allocator<std::pair<const _Key, _Tp> >> const_iterator std::multimap< _Key, _Tp, _Compare, _Alloc >::cend () const [inline], [noexcept]¶
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 396 of file stl_multimap.h.template<typename _Key, typename _Tp, typename _Compare = std::less<_Key>, typename _Alloc = std::allocator<std::pair<const _Key, _Tp> >> void std::multimap< _Key, _Tp, _Compare, _Alloc >::clear () [inline], [noexcept]¶
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 697 of file stl_multimap.h. Referenced by std::multimap< _Key, _Tp, _Compare, _Alloc >::operator=().template<typename _Key, typename _Tp, typename _Compare = std::less<_Key>, typename _Alloc = std::allocator<std::pair<const _Key, _Tp> >> size_type std::multimap< _Key, _Tp, _Compare, _Alloc >::count (const key_type &__x) const [inline]¶
Finds the number of elements with given key. Parameters:__x Key of (key, value) pairs to be located.
Returns:
Number of elements with specified key.
Definition at line 754 of file stl_multimap.h.
template<typename _Key, typename _Tp, typename _Compare = std::less<_Key>, typename _Alloc = std::allocator<std::pair<const _Key, _Tp> >> const_reverse_iterator std::multimap< _Key, _Tp, _Compare, _Alloc >::crbegin () const [inline], [noexcept]¶
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 405 of file stl_multimap.h.template<typename _Key, typename _Tp, typename _Compare = std::less<_Key>, typename _Alloc = std::allocator<std::pair<const _Key, _Tp> >> const_reverse_iterator std::multimap< _Key, _Tp, _Compare, _Alloc >::crend () const [inline], [noexcept]¶
Returns a read-only (constant) reverse iterator that points to one before the first pair in the multimap. Iteration is done in descending order according to the keys. Definition at line 414 of file stl_multimap.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::multimap< _Key, _Tp, _Compare, _Alloc >::emplace (_Args &&...__args) [inline]¶
Build and insert a std::pair into the multimap. 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:
An iterator that points to the inserted (key,value)
pair.
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 454 of file stl_multimap.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::multimap< _Key, _Tp, _Compare, _Alloc >::emplace_hint (const_iterator__pos, _Args &&...__args) [inline]¶
Builds and inserts a std::pair into the multimap. 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 inserted (key,value)
pair.
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:
http://gcc.gnu.org/onlinedocs/libstdc++/manual/bk01pt07ch17.html
Insertion requires logarithmic time (if the hint is not taken).
Definition at line 481 of file stl_multimap.h.
template<typename _Key, typename _Tp, typename _Compare = std::less<_Key>, typename _Alloc = std::allocator<std::pair<const _Key, _Tp> >> bool std::multimap< _Key, _Tp, _Compare, _Alloc >::empty () const [inline], [noexcept]¶
Returns true if the multimap is empty. Definition at line 421 of file stl_multimap.h.template<typename _Key, typename _Tp, typename _Compare = std::less<_Key>, typename _Alloc = std::allocator<std::pair<const _Key, _Tp> >> iterator std::multimap< _Key, _Tp, _Compare, _Alloc >::end () [inline], [noexcept]¶
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 332 of file stl_multimap.h.template<typename _Key, typename _Tp, typename _Compare = std::less<_Key>, typename _Alloc = std::allocator<std::pair<const _Key, _Tp> >> const_iterator std::multimap< _Key, _Tp, _Compare, _Alloc >::end () const [inline], [noexcept]¶
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 341 of file stl_multimap.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::multimap< _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). Definition at line 821 of file stl_multimap.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::multimap< _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). Definition at line 838 of file stl_multimap.h.
template<typename _Key, typename _Tp, typename _Compare = std::less<_Key>, typename _Alloc = std::allocator<std::pair<const _Key, _Tp> >> iterator std::multimap< _Key, _Tp, _Compare, _Alloc >::erase (const_iterator__position) [inline]¶
Erases an element from a multimap. 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
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 595 of file stl_multimap.h.
template<typename _Key, typename _Tp, typename _Compare = std::less<_Key>, typename _Alloc = std::allocator<std::pair<const _Key, _Tp> >> size_type std::multimap< _Key, _Tp, _Compare, _Alloc >::erase (const key_type &__x) [inline]¶
Erases elements according to the provided key. Parameters:__x Key of element to be erased.
Returns:
The number of elements erased.
This function erases all 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 631 of file stl_multimap.h.
template<typename _Key, typename _Tp, typename _Compare = std::less<_Key>, typename _Alloc = std::allocator<std::pair<const _Key, _Tp> >> iterator std::multimap< _Key, _Tp, _Compare, _Alloc >::erase (const_iterator__first, const_iterator__last) [inline]¶
Erases a [first,last) range of elements from a multimap. 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 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 652 of file stl_multimap.h.
template<typename _Key, typename _Tp, typename _Compare = std::less<_Key>, typename _Alloc = std::allocator<std::pair<const _Key, _Tp> >> iterator std::multimap< _Key, _Tp, _Compare, _Alloc >::find (const key_type &__x) [inline]¶
Tries to locate an element in a multimap. Parameters:__x Key of (key, value) pair to be located.
Returns:
Iterator pointing to sought-after element, or end() if
not found.
This function takes a key and tries to locate the element with which the key
matches. If successful the function returns an iterator pointing to the sought
after pair. If unsuccessful it returns the past-the-end ( end() ) iterator.
Definition at line 730 of file stl_multimap.h.
template<typename _Key, typename _Tp, typename _Compare = std::less<_Key>, typename _Alloc = std::allocator<std::pair<const _Key, _Tp> >> const_iterator std::multimap< _Key, _Tp, _Compare, _Alloc >::find (const key_type &__x) const [inline]¶
Tries to locate an element in a multimap. Parameters:__x Key of (key, value) pair to be located.
Returns:
Read-only (constant) iterator pointing to sought-after
element, or end() if not found.
This function takes a key and tries to locate the element with which the key
matches. If successful the function returns a constant iterator pointing to
the sought after pair. If unsuccessful it returns the past-the-end ( end() )
iterator.
Definition at line 745 of file stl_multimap.h.
template<typename _Key, typename _Tp, typename _Compare = std::less<_Key>, typename _Alloc = std::allocator<std::pair<const _Key, _Tp> >> allocator_type std::multimap< _Key, _Tp, _Compare, _Alloc >::get_allocator () const [inline], [noexcept]¶
Get a copy of the memory allocation object. Definition at line 304 of file stl_multimap.h.template<typename _Key, typename _Tp, typename _Compare = std::less<_Key>, typename _Alloc = std::allocator<std::pair<const _Key, _Tp> >> iterator std::multimap< _Key, _Tp, _Compare, _Alloc >::insert (const value_type &__x) [inline]¶
Inserts a std::pair into the multimap. Parameters:__x Pair to be inserted (see std::make_pair for
easy creation of pairs).
Returns:
An iterator that points to the inserted (key,value)
pair.
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 501 of file stl_multimap.h.
Referenced by std::multimap< _Key, _Tp, _Compare, _Alloc >::insert(), and
std::multimap< _Key, _Tp, _Compare, _Alloc >::operator=().
template<typename _Key, typename _Tp, typename _Compare = std::less<_Key>, typename _Alloc = std::allocator<std::pair<const _Key, _Tp> >> iterator std::multimap< _Key, _Tp, _Compare, _Alloc >::insert (const_iterator__position, const value_type &__x) [inline]¶
Inserts a std::pair into the multimap. 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 inserted (key,value)
pair.
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:
http://gcc.gnu.org/onlinedocs/libstdc++/manual/bk01pt07ch17.html
Insertion requires logarithmic time (if the hint is not taken).
Definition at line 535 of file stl_multimap.h.
template<typename _Key, typename _Tp, typename _Compare = std::less<_Key>, typename _Alloc = std::allocator<std::pair<const _Key, _Tp> >> template<typename _InputIterator > void std::multimap< _Key, _Tp, _Compare, _Alloc >::insert (_InputIterator__first, _InputIterator__last) [inline]¶
A 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 562 of file stl_multimap.h.
template<typename _Key, typename _Tp, typename _Compare = std::less<_Key>, typename _Alloc = std::allocator<std::pair<const _Key, _Tp> >> void std::multimap< _Key, _Tp, _Compare, _Alloc >::insert (initializer_list< value_type >__l) [inline]¶
Attempts to insert a list of std::pairs into the multimap. Parameters:__l A std::initializer_list<value_type> of
pairs to be inserted.
Complexity similar to that of the range constructor.
Definition at line 574 of file stl_multimap.h.
References std::multimap< _Key, _Tp, _Compare, _Alloc >::insert().
template<typename _Key, typename _Tp, typename _Compare = std::less<_Key>, typename _Alloc = std::allocator<std::pair<const _Key, _Tp> >> key_compare std::multimap< _Key, _Tp, _Compare, _Alloc >::key_comp () const [inline]¶
Returns the key comparison object out of which the multimap was constructed. Definition at line 706 of file stl_multimap.h.template<typename _Key, typename _Tp, typename _Compare = std::less<_Key>, typename _Alloc = std::allocator<std::pair<const _Key, _Tp> >> iterator std::multimap< _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 769 of file stl_multimap.h.
template<typename _Key, typename _Tp, typename _Compare = std::less<_Key>, typename _Alloc = std::allocator<std::pair<const _Key, _Tp> >> const_iterator std::multimap< _Key, _Tp, _Compare, _Alloc >::lower_bound (const key_type &__x) const [inline]¶
Finds the beginning of a subsequence matching given key. Parameters:__x Key of (key, value) pair to be located.
Returns:
Read-only (constant) iterator pointing to first element
equal to or greater than key, or end().
This function returns the first element of a subsequence of elements that
matches the given key. If unsuccessful the iterator will point to the next
greatest element or, if no such greater element exists, to end().
Definition at line 784 of file stl_multimap.h.
template<typename _Key, typename _Tp, typename _Compare = std::less<_Key>, typename _Alloc = std::allocator<std::pair<const _Key, _Tp> >> size_type std::multimap< _Key, _Tp, _Compare, _Alloc >::max_size () const [inline], [noexcept]¶
Returns the maximum size of the multimap. Definition at line 431 of file stl_multimap.h.template<typename _Key, typename _Tp, typename _Compare = std::less<_Key>, typename _Alloc = std::allocator<std::pair<const _Key, _Tp> >> multimap& std::multimap< _Key, _Tp, _Compare, _Alloc >::operator= (const multimap< _Key, _Tp, _Compare, _Alloc > &__x) [inline]¶
Multimap assignment operator. 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. Parameters:__x A multimap of identical element and allocator
types.
All the elements of __x are copied, but unlike the copy constructor, the
allocator object is not copied.
Definition at line 258 of file stl_multimap.h.
template<typename _Key, typename _Tp, typename _Compare = std::less<_Key>, typename _Alloc = std::allocator<std::pair<const _Key, _Tp> >> multimap& std::multimap< _Key, _Tp, _Compare, _Alloc >::operator= ( multimap< _Key, _Tp, _Compare, _Alloc > &&__x) [inline]¶
Multimap move assignment operator. Parameters:__x A multimap of identical element and allocator
types.
The contents of __x are moved into this multimap (without copying).
__x is a valid, but unspecified multimap.
Definition at line 273 of file stl_multimap.h.
References std::multimap< _Key, _Tp, _Compare, _Alloc >::clear(), and
std::multimap< _Key, _Tp, _Compare, _Alloc >::swap().
template<typename _Key, typename _Tp, typename _Compare = std::less<_Key>, typename _Alloc = std::allocator<std::pair<const _Key, _Tp> >> multimap& std::multimap< _Key, _Tp, _Compare, _Alloc >::operator= (initializer_list< value_type >__l) [inline]¶
Multimap list assignment operator. Parameters:__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 294 of file stl_multimap.h.
References std::multimap< _Key, _Tp, _Compare, _Alloc >::clear(), and
std::multimap< _Key, _Tp, _Compare, _Alloc >::insert().
template<typename _Key, typename _Tp, typename _Compare = std::less<_Key>, typename _Alloc = std::allocator<std::pair<const _Key, _Tp> >> reverse_iterator std::multimap< _Key, _Tp, _Compare, _Alloc >::rbegin () [inline], [noexcept]¶
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 350 of file stl_multimap.h.template<typename _Key, typename _Tp, typename _Compare = std::less<_Key>, typename _Alloc = std::allocator<std::pair<const _Key, _Tp> >> const_reverse_iterator std::multimap< _Key, _Tp, _Compare, _Alloc >::rbegin () const [inline], [noexcept]¶
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 359 of file stl_multimap.h.template<typename _Key, typename _Tp, typename _Compare = std::less<_Key>, typename _Alloc = std::allocator<std::pair<const _Key, _Tp> >> reverse_iterator std::multimap< _Key, _Tp, _Compare, _Alloc >::rend () [inline], [noexcept]¶
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 368 of file stl_multimap.h.template<typename _Key, typename _Tp, typename _Compare = std::less<_Key>, typename _Alloc = std::allocator<std::pair<const _Key, _Tp> >> const_reverse_iterator std::multimap< _Key, _Tp, _Compare, _Alloc >::rend () const [inline], [noexcept]¶
Returns a read-only (constant) reverse iterator that points to one before the first pair in the multimap. Iteration is done in descending order according to the keys. Definition at line 377 of file stl_multimap.h.template<typename _Key, typename _Tp, typename _Compare = std::less<_Key>, typename _Alloc = std::allocator<std::pair<const _Key, _Tp> >> size_type std::multimap< _Key, _Tp, _Compare, _Alloc >::size () const [inline], [noexcept]¶
Returns the size of the multimap. Definition at line 426 of file stl_multimap.h.template<typename _Key, typename _Tp, typename _Compare = std::less<_Key>, typename _Alloc = std::allocator<std::pair<const _Key, _Tp> >> void std::multimap< _Key, _Tp, _Compare, _Alloc >::swap ( multimap< _Key, _Tp, _Compare, _Alloc > &__x) [inline]¶
Swaps data with another multimap. Parameters:__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 687 of file stl_multimap.h.
Referenced by std::multimap< _Key, _Tp, _Compare, _Alloc >::operator=(),
and std::swap().
template<typename _Key, typename _Tp, typename _Compare = std::less<_Key>, typename _Alloc = std::allocator<std::pair<const _Key, _Tp> >> iterator std::multimap< _Key, _Tp, _Compare, _Alloc >::upper_bound (const key_type &__x) [inline]¶
Finds the end of a subsequence matching given key. Parameters:__x Key of (key, value) pair to be located.
Returns:
Iterator pointing to the first element greater than key,
or end().
Definition at line 794 of file stl_multimap.h.
template<typename _Key, typename _Tp, typename _Compare = std::less<_Key>, typename _Alloc = std::allocator<std::pair<const _Key, _Tp> >> const_iterator std::multimap< _Key, _Tp, _Compare, _Alloc >::upper_bound (const key_type &__x) const [inline]¶
Finds the end of a subsequence matching given key. Parameters:__x Key of (key, value) pair to be located.
Returns:
Read-only (constant) iterator pointing to first iterator
greater than key, or end().
Definition at line 804 of file stl_multimap.h.
template<typename _Key, typename _Tp, typename _Compare = std::less<_Key>, typename _Alloc = std::allocator<std::pair<const _Key, _Tp> >> value_compare std::multimap< _Key, _Tp, _Compare, _Alloc >::value_comp () const [inline]¶
Returns a value comparison object, built from the key comparison object out of which the multimap was constructed. Definition at line 714 of file stl_multimap.h.Author¶
Generated automatically by Doxygen for libstdc++ from the source code.| Fri Dec 19 2014 | libstdc++ |