Difference between revisions of "cpp/container/multiset"
m (Text replace - " {{dcl list h1 | Non-member functions}}" to "{{dcl list end}} ===Non-member functions=== {{dcl list begin}}") |
(+complexity note, +ordering of equivalents) |
||
| Line 9: | Line 9: | ||
}} | }} | ||
| − | Multiset is an associative container that contains a sorted set of objects of type Key. Sorting is done using the key comparison function Compare. | + | 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 feature}} | ||
===Member types=== | ===Member types=== | ||
Revision as of 12:22, 6 October 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. Template:mark c++11 feature
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
