Difference between revisions of "cpp/container/multiset"
m (Text replace - "operator_comp" to "operator_cmp") |
m (Text replace - "{{mark c++11 feature}}" to "{{mark since c++11}}") |
||
| Line 11: | Line 11: | ||
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. | 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. {{mark c++11 | + | The order of the elements that compare equivalent is the order of insertion and does not change. {{mark since c++11}} |
===Member types=== | ===Member types=== | ||
Revision as of 14:51, 24 December 2011
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. 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)
Contents |
Member types
Template:tdcl list begin Template:tdcl list hitem Template:tdcl list template Template:tdcl list template Template:tdcl list template Template:tdcl list template Template:tdcl list template Template:tdcl list template Template:tdcl list template Template:tdcl list template Template:tdcl list template Template:tdcl list template Template:tdcl list template Template:tdcl list template Template:tdcl list template Template:tdcl list template Template:tdcl list template Template:tdcl list end
