Difference between revisions of "cpp/container/multiset"
(+complexity note, +ordering of equivalents) |
(target has been moved) |
||
Line 76: | Line 76: | ||
{{dcl list begin}} | {{dcl list begin}} | ||
{{dcl list template | cpp/container/dcl list operator_comp | multiset}} | {{dcl list template | cpp/container/dcl list operator_comp | multiset}} | ||
− | {{dcl list template | cpp/container/dcl list | + | {{dcl list template | cpp/container/dcl list swap2 | multiset}} |
{{dcl list end}} | {{dcl list end}} |
Revision as of 10:56, 3 November 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