Namespaces
Variants
Views
Actions

Difference between revisions of "cpp/container/multiset"

From cppreference.com
< cpp‎ | container
m (r2.7.3) (Robot: Adding de, fr, it, pt, zh)
(+note)
Line 80: Line 80:
 
{{dcl list template | cpp/container/dcl list swap2 | multiset}}
 
{{dcl list template | cpp/container/dcl list swap2 | multiset}}
 
{{dcl list end}}
 
{{dcl list end}}
 +
 +
===Notes===
 +
{{cpp/container/assoc_note}}
  
 
[[de:cpp/container/multiset]]
 
[[de:cpp/container/multiset]]

Revision as of 06:50, 2 May 2013

 
 
 
 
Defined in header <set>
template<

    class Key,
    class Compare = std::less<Key>,
    class Allocator = std::allocator<Key>

> class multiset;

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

Template:cpp/container/dcl list key typeTemplate:cpp/container/dcl list value typeTemplate:cpp/container/dcl list size typeTemplate:cpp/container/dcl list difference typeTemplate:cpp/container/dcl list key compareTemplate:cpp/container/dcl list value compare2Template:cpp/container/dcl list allocator typeTemplate:cpp/container/dcl list referenceTemplate:cpp/container/dcl list const referenceTemplate:cpp/container/dcl list pointerTemplate:cpp/container/dcl list const pointerTemplate:cpp/container/dcl list iteratorTemplate:cpp/container/dcl list const iteratorTemplate:cpp/container/dcl list reverse iteratorTemplate:cpp/container/dcl list const reverse iterator
Member type Definition


Member functions

Template:cpp/container/dcl list constructorTemplate:cpp/container/dcl list destructorTemplate:cpp/container/dcl list operator=Template:cpp/container/dcl list get allocatorTemplate:cpp/container/dcl list beginTemplate:cpp/container/dcl list endTemplate:cpp/container/dcl list rbeginTemplate:cpp/container/dcl list rendTemplate:cpp/container/dcl list emptyTemplate:cpp/container/dcl list sizeTemplate:cpp/container/dcl list max sizeTemplate:cpp/container/dcl list clearTemplate:cpp/container/dcl list insertTemplate:cpp/container/dcl list emplaceTemplate:cpp/container/dcl list emplace hintTemplate:cpp/container/dcl list eraseTemplate:cpp/container/dcl list swapTemplate:cpp/container/dcl list countTemplate:cpp/container/dcl list findTemplate:cpp/container/dcl list equal rangeTemplate:cpp/container/dcl list lower boundTemplate:cpp/container/dcl list upper boundTemplate:cpp/container/dcl list key compTemplate:cpp/container/dcl list value comp
Iterators
Capacity
Modifiers
Lookup
Observers

Non-member functions

Template:cpp/container/dcl list operator cmpTemplate:cpp/container/dcl list swap2

Notes

The member types iterator and const_iterator may be aliases to the same type. This means defining a pair of function overloads using the two types as parameter types may violate the One Definition Rule. Since iterator is convertible to const_iterator, a single function with a const_iterator as parameter type will work instead.