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.h>
| |
A const bidirectional iterator.
|
|
| |
Inserts k in the set. The iterator pos is the starting point of the search. The return value points to the inserted item. | ||
|
| Inserts k in the set. Returns an iterator that points to the inserted item. |
|
| |
Erases the element where pos points to. This erases only one element | ||
|
| Erases all elements that are equal to k. Returns the number of erased elements. |