std::multiset
cppreference.com
<tbody>
</tbody>
| <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 Container, AllocatorAwareContainer, AssociativeContainer and ReversibleContainer.
Member types
| Member type | Definition |
key_type
|
|
value_type
|
Key
|
size_type
|
(unsigned int) ( std::size_t) |
difference_type
|
(signed int) ( std::ptrdiff_t) |
key_compare
|
Compare
|
value_compare
|
Compare
|
allocator_type
|
|
reference
|
Allocator::reference (until C++11)value_type& (since C++11)
|
const_reference
|
Allocator::const_reference (until C++11)const value_type& (since C++11)
|
pointer
|
Allocator::pointer (until C++11)std::allocator_traits<Allocator>::pointer (since C++11)
|
const_pointer
|
Allocator::const_pointer (until C++11)std::allocator_traits<Allocator>::const_pointer (since C++11)
|
iterator
|
BidirectionalIterator (until C++11)Constant bidirectional iterator (since C++11) |
const_iterator
|
(constant) (iterator) |
reverse_iterator
|
std::reverse_iterator<iterator>
|
const_reverse_iterator
|
std::reverse_iterator<const_iterator>
|
Member functions
multiset . (public member function) | |
multiset . (public member function) | |
| . (public member function) | |
| . (public member function) | |
Iterators | |
| (iterator) . (public member function) | |
| (iterator) . (public member function) | |
| (reverse iterator) . (public member function) | |
| (reverse iterator) . (public member function) | |
Capacity | |
| . (public member function) | |
| . (public member function) | |
| . (public member function) | |
Modifiers | |
| . (public member function) | |
| . (public member function) | |
(C++11) |
. (public member function) |
(C++11) |
constructs elements in-place using a hint (public member function) |
| (public member function) | |
| (public member function) | |
Lookup | |
| . (public member function) | |
| . (public member function) | |
| returns range of elements matching a specific key (public member function) | |
| returns an iterator to the first element not less than the given value (public member function) | |
| returns an iterator to the first element greater than a certain value (public member function) | |
Observers | |
| returns the function that compares keys (public member function) | |
| returns the function that compares keys in objects of type value_type (public member function) | |
Non-member functions
| lexicographically compares the values in the multiset (function template) | |
| specializes the std::swap algorithm (function template) |
Notes
The member types iterator and const_iterator may be aliases to the same type. Since iterator is convertible to const_iterator, const_iterator should be used in function parameter lists to avoid violations of the One Definition Rule.