Defined in header
Multiset is an associative container that contains a sorted set of objects of type Key. Unlike set, multiple keys with equal values are allowed. Sorting is done using the key comparison function Compare. Search, insertion, and removal operations have logarithmic complexity.
The order of the elements that compare equivalent is the order of insertion and does not change. (since C++11)
The member types
const_iterator may be aliases to the same type. Since
iterator is convertible to
const_iterator should be used in function parameter lists to avoid violations of the One Definition Rule.