#include <stl_multimap.h>
Public Member Functions | |
iterator | begin () |
const_iterator | begin () const |
iterator | end () |
const_iterator | end () const |
reverse_iterator | rbegin () |
const_reverse_iterator | rbegin () const |
reverse_iterator | rend () |
const_reverse_iterator | rend () const |
bool | empty () const |
size_type | size () const |
size_type | max_size () const |
iterator | insert (const value_type &__x) |
Inserts a std::pair into the multimap. | |
iterator | insert (iterator __position, const value_type &__x) |
Inserts a std::pair into the multimap. | |
template<class _InputIterator> void | insert (_InputIterator __first, _InputIterator __last) |
A template function that attemps to insert elements from another range (possibly another multimap or standard container). | |
void | erase (iterator __position) |
Erases an element from a multimap. | |
size_type | erase (const key_type &__x) |
Erases an element according to the provided key. | |
void | erase (iterator __first, iterator __last) |
Erases a [first,last) range of elements from a multimap. | |
void | clear () |
iterator | find (const key_type &__x) |
Tries to locate an element in a multimap. | |
const_iterator | find (const key_type &__x) const |
Tries to locate an element in a multimap. | |
size_type | count (const key_type &__x) const |
Finds the number of elements with given key. | |
iterator | lower_bound (const key_type &__x) |
Finds the beginning of a subsequence matching given key. | |
const_iterator | lower_bound (const key_type &__x) const |
Finds the beginning of a subsequence matching given key. | |
iterator | upper_bound (const key_type &__x) |
Finds the end of a subsequence matching given key. | |
const_iterator | upper_bound (const key_type &__x) const |
Finds the end of a subsequence matching given key. | |
pair< iterator, iterator > | equal_range (const key_type &__x) |
Finds a subsequence matching given key. | |
pair< const_iterator, const_iterator > | equal_range (const key_type &__x) const |
Finds a subsequence matching given key. |
This is an associative container. Values contained within it can be quickly retrieved through a key element. In contrast with a map a multimap can have multiple duplicate keys.
Definition at line 91 of file stl_multimap.h.
|
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 177 of file stl_multimap.h. |
|
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 170 of file stl_multimap.h. |
|
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 responsibilty. Definition at line 317 of file stl_multimap.h. |
|
Finds the number of elements with given key.
Definition at line 352 of file stl_multimap.h. |
|
Returns true if the map is empty. (Thus begin() would equal end().) Definition at line 221 of file stl_multimap.h. |
|
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 190 of file stl_multimap.h. |
|
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 183 of file stl_multimap.h. |
|
Finds a subsequence matching given key.
Definition at line 431 of file stl_multimap.h. |
|
Finds a subsequence matching given key.
Definition at line 413 of file stl_multimap.h. |
|
Erases a [first,last) range of elements from a multimap.
Definition at line 309 of file stl_multimap.h. |
|
Erases an element according to the provided key.
Definition at line 297 of file stl_multimap.h. |
|
Erases an element from a multimap.
Definition at line 284 of file stl_multimap.h. |
|
Tries to locate an element in a multimap.
Definition at line 345 of file stl_multimap.h. |
|
Tries to locate an element in a multimap.
Definition at line 332 of file stl_multimap.h. |
|
A template function that attemps to insert elements from another range (possibly another multimap or standard container).
Definition at line 271 of file stl_multimap.h. |
|
Inserts a std::pair into the multimap.
Definition at line 259 of file stl_multimap.h. |
|
Inserts a std::pair into the multimap.
Definition at line 242 of file stl_multimap.h. |
|
Finds the beginning of a subsequence matching given key.
Definition at line 378 of file stl_multimap.h. |
|
Finds the beginning of a subsequence matching given key.
Definition at line 365 of file stl_multimap.h. |
|
Returns the maximum size of the map. Definition at line 227 of file stl_multimap.h. |
|
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 204 of file stl_multimap.h. |
|
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 197 of file stl_multimap.h. |
|
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 218 of file stl_multimap.h. |
|
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 211 of file stl_multimap.h. |
|
Returns the size of the map. Definition at line 224 of file stl_multimap.h. |
|
Finds the end of a subsequence matching given key.
Definition at line 395 of file stl_multimap.h. |
|
Finds the end of a subsequence matching given key.
Definition at line 387 of file stl_multimap.h. |