Standard C++ Library Class Reference

equal_range (const key_type& x) const;
Returns the pair (lower_bound(x), upper_bound(x)).
iterator
erase (iterator first, iterator last);
Providing the iterators first and last point to the same multimap and last is reachable from first,
all elements in the range (first, last) will be deleted from the multimap. Returns an iterator
pointing to the element following the last deleted element, or end(), if there were no elements
after the deleted range.
iterator
erase (iterator position);
Deletes the multimap element pointed to by the iterator position. Returns an iterator pointing to
the element following the deleted element, or end(), if the deleted item was the last one in this
list.
size_type
erase (const key_type& x);
Deletes the elements with the key value x from the map, if any exist. Returns the number of
deleted elements, or 0 otherwise.
iterator
find (const key_type& x);
Searches the multimap for a pair with the key value x and returns an iterator to that pair if it is
found. If such a pair is not found the value end() is returned.
const_iterator
find (const key_type& x) const;
Same as find above but returns a const_iterator.
iterator
insert (const value_type& x);
iterator
insert (iterator position, const value_type& x);
x is inserted into the multimap. A position may be supplied as a hint regarding where to do the
insertion. If the insertion may be done right after position then it takes amortized constant time.
Otherwise it will take O(log N) time.
template <class InputIterator>
void
insert (InputIterator first, InputIterator last);
Copies of each element in the range [first, last) will be inserted into the multimap. The iterators
first and last must return values of type pair<T1,T2>. This operation takes approximately
O(N*log(size()+N)) time.
key_compare
key_comp() const;
Returns a function object capable of comparing key values using the comparison operation,