Difference between revisions of "cpp/container/multiset"
From cppreference.com
(value_compare in sets and maps are not the same) |
m (Text replace - "/sidebar" to "/navbar") |
||
Line 1: | Line 1: | ||
{{cpp/title|multiset}} | {{cpp/title|multiset}} | ||
− | {{cpp/container/multiset/ | + | {{cpp/container/multiset/navbar}} |
{{ddcl | header=set | | {{ddcl | header=set | | ||
template< | template< |
Revision as of 12:29, 15 June 2012
Defined in header <set>
|
||
template< class Key, |
||
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)
std::multiset
meets the requirements of Template:concept, Template:concept, Template:concept and Template:concept.
Contents |
Member types