std::multiset

Defined in header <set>
template<     class Key,     class Compare = std::less<Key>,     class Allocator = std::allocator<Key> > class multiset;

Multiset is an associative container that contains a sorted set of objects of type Key. 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. Template:mark c++11 feature

Member functions

Template:cpp/container/dcl list constructorTemplate:cpp/container/dcl list destructorTemplate:cpp/container/dcl list operator=Template:cpp/container/dcl list get allocatorTemplate:cpp/container/dcl list beginTemplate:cpp/container/dcl list endTemplate:cpp/container/dcl list rbeginTemplate:cpp/container/dcl list rendTemplate:cpp/container/dcl list emptyTemplate:cpp/container/dcl list sizeTemplate:cpp/container/dcl list max sizeTemplate:cpp/container/dcl list clearTemplate:cpp/container/dcl list insertTemplate:cpp/container/dcl list emplaceTemplate:cpp/container/dcl list emplace hintTemplate:cpp/container/dcl list eraseTemplate:cpp/container/dcl list swapTemplate:cpp/container/dcl list countTemplate:cpp/container/dcl list findTemplate:cpp/container/dcl list equal rangeTemplate:cpp/container/dcl list lower boundTemplate:cpp/container/dcl list upper boundTemplate:cpp/container/dcl list key compTemplate:cpp/container/dcl list value comp

Iterators

Capacity

Modifiers

Lookup

Observers

Non-member functions

Template:cpp/container/dcl list operator cmpTemplate:cpp/container/dcl list swap2