Difference between revisions of "cpp/container/multiset"
From cppreference.com
m (r2.7.3) (Robot: Adding es, ja, pl, ru) |
m (Text replace - "{{tdcl list begin" to "{{dcl list begin") |
||
| Line 16: | Line 16: | ||
===Member types=== | ===Member types=== | ||
| − | {{ | + | {{dcl list begin}} |
{{tdcl list hitem | Member type | Definition}} | {{tdcl list hitem | Member type | Definition}} | ||
{{tdcl list template | cpp/container/tdcl list key_type | multiset}} | {{tdcl list template | cpp/container/tdcl list key_type | multiset}} | ||
Revision as of 01:12, 12 June 2012
Template:cpp/container/multiset/sidebar
| 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 |
