Namespaces
Variants
Views
Actions

Difference between revisions of "cpp/container/multiset"

From cppreference.com
< cpp‎ | container
m (Shorten template names. Use {{lc}} where appropriate.)
m (Update links.)
Line 18: Line 18:
 
{{dsc begin}}
 
{{dsc begin}}
 
{{dsc hitem | Member type | Definition}}
 
{{dsc hitem | Member type | Definition}}
−
{{dsc inc | cpp/container/dcl list key_type | multiset}}
+
{{dsc inc | cpp/container/dsc key_type | multiset}}
−
{{dsc inc | cpp/container/dcl list value_type | multiset}}
+
{{dsc inc | cpp/container/dsc value_type | multiset}}
−
{{dsc inc | cpp/container/dcl list size_type | multiset}}
+
{{dsc inc | cpp/container/dsc size_type | multiset}}
−
{{dsc inc | cpp/container/dcl list difference_type | multiset}}
+
{{dsc inc | cpp/container/dsc difference_type | multiset}}
−
{{dsc inc | cpp/container/dcl list key_compare | multiset}}
+
{{dsc inc | cpp/container/dsc key_compare | multiset}}
−
{{dsc inc | cpp/container/dcl list value_compare2 | multiset}}
+
{{dsc inc | cpp/container/dsc value_compare2 | multiset}}
−
{{dsc inc | cpp/container/dcl list allocator_type | multiset}}
+
{{dsc inc | cpp/container/dsc allocator_type | multiset}}
−
{{dsc inc | cpp/container/dcl list reference | multiset}}
+
{{dsc inc | cpp/container/dsc reference | multiset}}
−
{{dsc inc | cpp/container/dcl list const_reference | multiset}}
+
{{dsc inc | cpp/container/dsc const_reference | multiset}}
−
{{dsc inc | cpp/container/dcl list pointer | multiset}}
+
{{dsc inc | cpp/container/dsc pointer | multiset}}
−
{{dsc inc | cpp/container/dcl list const_pointer | multiset}}
+
{{dsc inc | cpp/container/dsc const_pointer | multiset}}
−
{{dsc inc | cpp/container/dcl list iterator | multiset}}
+
{{dsc inc | cpp/container/dsc iterator | multiset}}
−
{{dsc inc | cpp/container/dcl list const_iterator | multiset}}
+
{{dsc inc | cpp/container/dsc const_iterator | multiset}}
−
{{dsc inc | cpp/container/dcl list reverse_iterator | multiset}}
+
{{dsc inc | cpp/container/dsc reverse_iterator | multiset}}
−
{{dsc inc | cpp/container/dcl list const_reverse_iterator | multiset}}
+
{{dsc inc | cpp/container/dsc const_reverse_iterator | multiset}}
 
{{dsc end}}
 
{{dsc end}}
  
Line 39: Line 39:
 
===Member functions===
 
===Member functions===
 
{{dsc begin}}
 
{{dsc begin}}
−
{{dsc inc | cpp/container/dcl list constructor | multiset}}
+
{{dsc inc | cpp/container/dsc constructor | multiset}}
−
{{dsc inc | cpp/container/dcl list destructor | multiset}}
+
{{dsc inc | cpp/container/dsc destructor | multiset}}
−
{{dsc inc | cpp/container/dcl list operator{{=}} | multiset}}
+
{{dsc inc | cpp/container/dsc operator{{=}} | multiset}}
−
{{dsc inc | cpp/container/dcl list get_allocator | multiset}}
+
{{dsc inc | cpp/container/dsc get_allocator | multiset}}
  
 
{{dsc h2 | Iterators}}
 
{{dsc h2 | Iterators}}
−
{{dsc inc | cpp/container/dcl list begin | multiset}}
+
{{dsc inc | cpp/container/dsc begin | multiset}}
−
{{dsc inc | cpp/container/dcl list end | multiset}}
+
{{dsc inc | cpp/container/dsc end | multiset}}
−
{{dsc inc | cpp/container/dcl list rbegin | multiset}}
+
{{dsc inc | cpp/container/dsc rbegin | multiset}}
−
{{dsc inc | cpp/container/dcl list rend | multiset}}
+
{{dsc inc | cpp/container/dsc rend | multiset}}
  
 
{{dsc h2 | Capacity}}
 
{{dsc h2 | Capacity}}
−
{{dsc inc | cpp/container/dcl list empty | multiset}}
+
{{dsc inc | cpp/container/dsc empty | multiset}}
−
{{dsc inc | cpp/container/dcl list size | multiset}}
+
{{dsc inc | cpp/container/dsc size | multiset}}
−
{{dsc inc | cpp/container/dcl list max_size | multiset}}
+
{{dsc inc | cpp/container/dsc max_size | multiset}}
  
 
{{dsc h2 | Modifiers}}
 
{{dsc h2 | Modifiers}}
−
{{dsc inc | cpp/container/dcl list clear | multiset}}
+
{{dsc inc | cpp/container/dsc clear | multiset}}
−
{{dsc inc | cpp/container/dcl list insert | multiset}}
+
{{dsc inc | cpp/container/dsc insert | multiset}}
−
{{dsc inc | cpp/container/dcl list emplace | multiset}}
+
{{dsc inc | cpp/container/dsc emplace | multiset}}
−
{{dsc inc | cpp/container/dcl list emplace_hint | multiset}}
+
{{dsc inc | cpp/container/dsc emplace_hint | multiset}}
−
{{dsc inc | cpp/container/dcl list erase | multiset}}
+
{{dsc inc | cpp/container/dsc erase | multiset}}
−
{{dsc inc | cpp/container/dcl list swap | multiset}}
+
{{dsc inc | cpp/container/dsc swap | multiset}}
  
 
{{dsc h2 | Lookup}}
 
{{dsc h2 | Lookup}}
−
{{dsc inc | cpp/container/dcl list count | multiset}}
+
{{dsc inc | cpp/container/dsc count | multiset}}
−
{{dsc inc | cpp/container/dcl list find | multiset}}
+
{{dsc inc | cpp/container/dsc find | multiset}}
−
{{dsc inc | cpp/container/dcl list equal_range | multiset}}
+
{{dsc inc | cpp/container/dsc equal_range | multiset}}
−
{{dsc inc | cpp/container/dcl list lower_bound | multiset}}
+
{{dsc inc | cpp/container/dsc lower_bound | multiset}}
−
{{dsc inc | cpp/container/dcl list upper_bound | multiset}}
+
{{dsc inc | cpp/container/dsc upper_bound | multiset}}
  
 
{{dsc h2 | Observers}}
 
{{dsc h2 | Observers}}
−
{{dsc inc | cpp/container/dcl list key_comp | multiset}}
+
{{dsc inc | cpp/container/dsc key_comp | multiset}}
−
{{dsc inc | cpp/container/dcl list value_comp | multiset}}
+
{{dsc inc | cpp/container/dsc value_comp | multiset}}
 
{{dsc end}}
 
{{dsc end}}
  
 
===Non-member functions===
 
===Non-member functions===
 
{{dsc begin}}
 
{{dsc begin}}
−
{{dsc inc | cpp/container/dcl list operator_cmp | multiset}}
+
{{dsc inc | cpp/container/dsc operator_cmp | multiset}}
−
{{dsc inc | cpp/container/dcl list swap2 | multiset}}
+
{{dsc inc | cpp/container/dsc swap2 | multiset}}
 
{{dsc end}}
 
{{dsc end}}
  

Revision as of 21:50, 31 May 2013

 
C++
 
Containers library
 
std::multiset
Member functions
Non-member functions
(until C++20)(until C++20)(until C++20)(until C++20)(until C++20)
Deduction guides(C++17)
 
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

Member type Definition
key_type Key[edit]
value_type Key[edit]
size_type Unsigned integer type (usually std::size_t)[edit]
difference_type Signed integer type (usually std::ptrdiff_t)[edit]
key_compare Compare[edit]
value_compare Compare[edit]
allocator_type Allocator[edit]
reference value_type&[edit]
const_reference const value_type&[edit]
pointer

Allocator::pointer

(until C++11)

std::allocator_traits<Allocator>::pointer

(since C++11)
[edit]
const_pointer

Allocator::const_pointer

(until C++11)

std::allocator_traits<Allocator>::const_pointer

(since C++11)
[edit]
iterator Constant LegacyBidirectionalIterator to value_type[edit]
const_iterator LegacyBidirectionalIterator to const value_type[edit]
reverse_iterator std::reverse_iterator<iterator>[edit]
const_reverse_iterator std::reverse_iterator<const_iterator>[edit]


Member functions

 constructs the multiset
(public member function) [edit]
destructs the multiset
(public member function) [edit]
assigns values to the container
(public member function) [edit]
returns the associated allocator
(public member function) [edit]
Iterators
(C++11)
 returns an iterator to the beginning
(public member function) [edit]
(C++11)
 returns an iterator to the end
(public member function) [edit]
(C++11)
 returns a reverse iterator to the beginning
(public member function) [edit]
(C++11)
 returns a reverse iterator to the end
(public member function) [edit]
Capacity
checks whether the container is empty
(public member function) [edit]
returns the number of elements
(public member function) [edit]
returns the maximum possible number of elements
(public member function) [edit]
Modifiers
clears the contents
(public member function) [edit]
inserts elements or nodes(since C++17)
(public member function) [edit]
(C++11)
 constructs element in-place
(public member function) [edit]
(C++11)
 constructs elements in-place using a hint
(public member function) [edit]
erases elements
(public member function) [edit]
swaps the contents
(public member function) [edit]
Lookup
returns the number of elements matching specific key
(public member function) [edit]
finds element with specific key
(public member function) [edit]
returns range of elements matching a specific key
(public member function) [edit]
returns an iterator to the first element not less than the given key
(public member function) [edit]
returns an iterator to the first element greater than the given key
(public member function) [edit]
Observers
returns the function that compares keys
(public member function) [edit]
returns the function that compares keys in objects of type value_type
(public member function) [edit]

Non-member functions

(removed in C++20)(removed in C++20)(removed in C++20)(removed in C++20)(removed in C++20)(C++20)
 lexicographically compares the values of two multisets
(function template) [edit]
specializes the std::swap algorithm
(function template) [edit]

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.

Retrieved from "https://en.cppreference.com/mwiki/index.php?title=cpp/container/multiset&oldid=57286"