| 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.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 150 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.
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 170 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]¶
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 181 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 194 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 211 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 227 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]¶
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 306 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]¶
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 315 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]¶
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 379 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]¶
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 388 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]¶
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 633 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.
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]¶
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 397 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]¶
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 406 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]¶
Returns true if the multimap is empty. Definition at line 413 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]¶
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 324 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]¶
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 333 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 757 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 774 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 534 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 569 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 589 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 666 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 681 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]¶
Get a copy of the memory allocation object. Definition at line 296 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 440 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> >> 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 474 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 501 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:list A
std::initializer_list<value_type> of pairs to be inserted.
Complexity similar to that of the range constructor.
Definition at line 513 of file stl_multimap.h.
References std::multimap< _Key, _Tp, _Compare, _Alloc >::insert().
Referenced by 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 642 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 705 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 720 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]¶
Returns the maximum size of the multimap. Definition at line 423 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 250 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 265 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 286 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]¶
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 342 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]¶
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 351 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]¶
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 360 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]¶
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 369 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]¶
Returns the size of the multimap. Definition at line 418 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 623 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().
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().
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 650 of file stl_multimap.h.Author¶
Generated automatically by Doxygen for libstdc++ from the source code.| Tue Nov 27 2012 | libstdc++ |