libstdc++
|
Public Types | |
typedef _Alloc | allocator_type |
typedef _Rep_type::const_iterator | const_iterator |
typedef _Pair_alloc_type::const_pointer | const_pointer |
typedef _Pair_alloc_type::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 _Pair_alloc_type::pointer | pointer |
typedef _Pair_alloc_type::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 () |
const_iterator | begin () const |
const_iterator | cbegin () const |
const_iterator | cend () const |
void | clear () |
size_type | count (const key_type &__x) const |
const_reverse_iterator | crbegin () const |
const_reverse_iterator | crend () const |
bool | empty () const |
iterator | end () |
const_iterator | end () const |
std::pair< iterator, iterator > | equal_range (const key_type &__x) |
std::pair< const_iterator, const_iterator > | equal_range (const key_type &__x) const |
void | erase (iterator __position) |
size_type | erase (const key_type &__x) |
void | erase (iterator __first, iterator __last) |
iterator | find (const key_type &__x) |
const_iterator | find (const key_type &__x) const |
allocator_type | get_allocator () const |
iterator | insert (const value_type &__x) |
iterator | insert (iterator __position, const value_type &__x) |
template<typename _InputIterator > | |
void | insert (_InputIterator __first, _InputIterator __last) |
void | insert (initializer_list< value_type > __l) |
key_compare | key_comp () const |
iterator | lower_bound (const key_type &__x) |
const_iterator | lower_bound (const key_type &__x) const |
size_type | max_size () const |
multimap () | |
multimap (const _Compare &__comp, const allocator_type &__a=allocator_type()) | |
multimap (const multimap &__x) | |
multimap (multimap &&__x) | |
multimap (initializer_list< value_type > __l, const _Compare &__comp=_Compare(), const allocator_type &__a=allocator_type()) | |
template<typename _InputIterator > | |
multimap (_InputIterator __first, _InputIterator __last) | |
template<typename _InputIterator > | |
multimap (_InputIterator __first, _InputIterator __last, const _Compare &__comp, const allocator_type &__a=allocator_type()) | |
multimap & | operator= (const multimap &__x) |
multimap & | operator= (multimap &&__x) |
multimap & | operator= (initializer_list< value_type > __l) |
reverse_iterator | rbegin () |
const_reverse_iterator | rbegin () const |
reverse_iterator | rend () |
const_reverse_iterator | rend () const |
size_type | size () const |
void | swap (multimap &&__x) |
iterator | upper_bound (const key_type &__x) |
const_iterator | upper_bound (const key_type &__x) const |
value_compare | value_comp () const |
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 > &) |
A standard container made up of (key,value) pairs, which can be retrieved based on a key, in logarithmic time.
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 86 of file stl_multimap.h.
|
inline |
Default constructor creates no elements.
Definition at line 148 of file stl_multimap.h.
|
inlineexplicit |
Creates a multimap with no elements.
comp | A comparison object. |
a | An allocator object. |
Definition at line 157 of file stl_multimap.h.
|
inline |
Multimap copy constructor.
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 168 of file stl_multimap.h.
|
inline |
Multimap move constructor.
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 179 of file stl_multimap.h.
|
inline |
Builds a multimap from an initializer_list.
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 192 of file stl_multimap.h.
|
inline |
Builds a multimap from a range.
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 209 of file stl_multimap.h.
|
inline |
Builds a multimap from a range.
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 225 of file stl_multimap.h.
|
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 303 of file stl_multimap.h.
|
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 312 of file stl_multimap.h.
|
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 376 of file stl_multimap.h.
|
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 385 of file stl_multimap.h.
|
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 561 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 618 of file stl_multimap.h.
|
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 394 of file stl_multimap.h.
|
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 403 of file stl_multimap.h.
|
inline |
Returns true if the multimap is empty.
Definition at line 410 of file stl_multimap.h.
|
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 321 of file stl_multimap.h.
|
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 330 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 685 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 702 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 502 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 517 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 532 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 594 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 609 of file stl_multimap.h.
|
inline |
Get a copy of the memory allocation object.
Definition at line 293 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 437 of file stl_multimap.h.
|
inline |
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: http://gcc.gnu.org/onlinedocs/libstdc++/manual/bk01pt07ch17.html
Insertion requires logarithmic time (if the hint is not taken).
Definition at line 461 of file stl_multimap.h.
|
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 475 of file stl_multimap.h.
|
inline |
Attempts to insert a list of std::pairs into the multimap.
list | A std::initializer_list<value_type> of pairs to be inserted. |
Complexity similar to that of the range constructor.
Definition at line 487 of file stl_multimap.h.
References std::multimap< _Key, _Tp, _Compare, _Alloc >::insert().
Referenced by std::multimap< _Key, _Tp, _Compare, _Alloc >::insert().
|
inline |
Returns the key comparison object out of which the multimap was constructed.
Definition at line 570 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 633 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 648 of file stl_multimap.h.
|
inline |
Returns the maximum size of the multimap.
Definition at line 420 of file stl_multimap.h.
|
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.
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 248 of file stl_multimap.h.
|
inline |
Multimap move assignment operator.
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 263 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 283 of file stl_multimap.h.
|
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 339 of file stl_multimap.h.
|
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 348 of file stl_multimap.h.
|
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 357 of file stl_multimap.h.
|
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 366 of file stl_multimap.h.
|
inline |
Returns the size of the multimap.
Definition at line 415 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 548 of file stl_multimap.h.
Referenced by std::swap().
|
inline |
Finds the end of a subsequence matching given key.
x | Key of (key, value) pair to be located. |
Definition at line 658 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 668 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 578 of file stl_multimap.h.