An object of the class multiset<Key, Compare> can store multiple copies
of the same element of type Key. The elements in the
multiset are ordered by the ordering relation Compare.
The interface of the class multiset<Key, Compare> is almost the same as of
the class set<Key, Compare>. We only list the functions
that have a different syntax or semantics.
#include <set>
Types
multiset<Key, Compare>::iterator
A const bidirectional iterator.
Operations
iterator
M.insert ( iterator pos, Key k)
Inserts k in the set. The iterator pos is the starting
point of the search. The return value points to the inserted item.
iterator
M.insert ( Key k)
Inserts k in the set. Returns an iterator that points to the
inserted item.
void
M.erase ( iterator pos)
Erases the element where pos points to. This erases only one element
int
M.erase ( Key k)
Erases all elements that are equal to k. Returns the number
of erased elements.