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.
Definition at line 107 of file stl_multimap.h.
multimap | ( | ) | [inline] |
multimap | ( | const _Compare & | __comp, | |
const allocator_type & | __a = allocator_type() | |||
) | [inline, explicit] |
Multimap copy constructor.
x | A multimap of identical element and allocator types. |
Definition at line 188 of file stl_multimap.h.
multimap | ( | _InputIterator | __first, | |
_InputIterator | __last | |||
) | [inline] |
Builds a multimap from a range.
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 201 of file stl_multimap.h.
multimap | ( | _InputIterator | __first, | |
_InputIterator | __last, | |||
const _Compare & | __comp, | |||
const allocator_type & | __a = allocator_type() | |||
) | [inline] |
Builds a multimap from a range.
first | An input iterator. | |
last | An input iterator. | |
comp | A comparison functor. | |
a | An allocator object. |
Definition at line 217 of file stl_multimap.h.
const_iterator 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 267 of file stl_multimap.h.
iterator 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 258 of file stl_multimap.h.
void 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 responsibilty.
Definition at line 460 of file stl_multimap.h.
size_type count | ( | const key_type & | __x | ) | const [inline] |
Finds the number of elements with given key.
x | Key of (key, value) pairs to be located. |
Definition at line 517 of file stl_multimap.h.
References std::count().
bool empty | ( | ) | const [inline] |
Returns true if the multimap is empty.
Definition at line 327 of file stl_multimap.h.
const_iterator 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 285 of file stl_multimap.h.
iterator 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 276 of file stl_multimap.h.
std::pair<const_iterator, const_iterator> equal_range | ( | const key_type & | __x | ) | const [inline] |
Finds a subsequence matching given key.
x | Key of (key, value) pairs to be located. |
std::make_pair(c.lower_bound(val), c.upper_bound(val))
Definition at line 601 of file stl_multimap.h.
Finds a subsequence matching given key.
x | Key of (key, value) pairs to be located. |
std::make_pair(c.lower_bound(val), c.upper_bound(val))
Definition at line 584 of file stl_multimap.h.
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. |
Definition at line 435 of file stl_multimap.h.
size_type erase | ( | const key_type & | __x | ) | [inline] |
Erases elements according to the provided key.
x | Key of element to be erased. |
Definition at line 420 of file stl_multimap.h.
void erase | ( | iterator | __position | ) | [inline] |
Erases an element from a multimap.
position | An iterator pointing to the element to be erased. |
Definition at line 405 of file stl_multimap.h.
const_iterator find | ( | const key_type & | __x | ) | const [inline] |
Tries to locate an element in a multimap.
x | Key of (key, value) pair to be located. |
end()
) iterator.
Definition at line 508 of file stl_multimap.h.
iterator find | ( | const key_type & | __x | ) | [inline] |
Tries to locate an element in a multimap.
x | Key of (key, value) pair to be located. |
end()
) iterator.
Definition at line 493 of file stl_multimap.h.
allocator_type get_allocator | ( | ) | const [inline] |
void insert | ( | _InputIterator | __first, | |
_InputIterator | __last | |||
) | [inline] |
A template function that attemps 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. |
Definition at line 391 of file stl_multimap.h.
iterator insert | ( | iterator | __position, | |
const value_type & | __x | |||
) | [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). |
See http://gcc.gnu.org/onlinedocs/libstdc++/23_containers/howto.html#4 for more on "hinting".
Insertion requires logarithmic time (if the hint is not taken).
Definition at line 378 of file stl_multimap.h.
iterator insert | ( | const value_type & | __x | ) | [inline] |
Inserts a std::pair into the multimap.
x | Pair to be inserted (see std::make_pair for easy creation of pairs). |
Insertion requires logarithmic time.
Definition at line 354 of file stl_multimap.h.
key_compare key_comp | ( | ) | const [inline] |
Returns the key comparison object out of which the multimap was constructed.
Definition at line 469 of file stl_multimap.h.
const_iterator lower_bound | ( | const key_type & | __x | ) | const [inline] |
Finds the beginning of a subsequence matching given key.
x | Key of (key, value) pair to be located. |
Definition at line 547 of file stl_multimap.h.
iterator lower_bound | ( | const key_type & | __x | ) | [inline] |
Finds the beginning of a subsequence matching given key.
x | Key of (key, value) pair to be located. |
Definition at line 532 of file stl_multimap.h.
size_type max_size | ( | ) | const [inline] |
Returns the maximum size of the multimap.
Definition at line 337 of file stl_multimap.h.
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 responsibilty.
x | A multimap of identical element and allocator types. |
Definition at line 240 of file stl_multimap.h.
References multimap::_M_t.
const_reverse_iterator 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 303 of file stl_multimap.h.
reverse_iterator 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 294 of file stl_multimap.h.
const_reverse_iterator 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 321 of file stl_multimap.h.
reverse_iterator 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 312 of file stl_multimap.h.
size_type size | ( | ) | const [inline] |
Returns the size of the multimap.
Definition at line 332 of file stl_multimap.h.
void swap | ( | multimap< _Key, _Tp, _Compare, _Alloc > & | __x | ) | [inline] |
Swaps data with another multimap.
x | A multimap of the same element and allocator types. |
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 450 of file stl_multimap.h.
References multimap::_M_t, and std::swap().
Referenced by std::swap().
const_iterator upper_bound | ( | const key_type & | __x | ) | const [inline] |
iterator upper_bound | ( | const key_type & | __x | ) | [inline] |
Finds the end of a subsequence matching given key.
x | Key of (key, value) pair to be located. |
Definition at line 557 of file stl_multimap.h.
value_compare 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 477 of file stl_multimap.h.