Standard C++ Library Class Reference

erase (iterator first, iterator last);
Providing the iterators first and last point to the same multiset and last is reachable from first,
all elements in the range (first, last) will be deleted from the multiset. Returns an iterator
pointing to the element following the last deleted element, or end() if there were no elements
after the deleted range.
iterator
find (const key_type& x) const;
Searches the multiset for a key value x and returns an iterator to that key if it is found. If such a
value is not found the iterator end() is returned.
iterator
insert (const value_type& x);
iterator
insert (iterator position, const value_type& x);
x is inserted into the multiset. 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 multiset. This insert
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,
Compare, of the current multiset.
iterator
lower_bound (const key_type& x) const;
Returns an iterator to the first element whose key is greater than or equal to x. If no such
element exists, end() is returned.
size_type
max_size () const;
Returns the maximum possible size of the multiset size_type.
size_type
size () const;
Returns the number of elements in the multiset.
void
swap (multiset<Key, Compare, Allocator>& x);
Swaps the contents of the multiset x with the current multiset, *this.
iterator