std::multiset<Key,Compare,Allocator>::multiset
multiset(); |
(1) | |
explicit multiset( const Compare& comp, const Allocator& alloc = Allocator() ); |
(2) | |
explicit multiset( const Allocator& alloc ); |
(3) | (since C++11) |
template< class InputIt > multiset( InputIt first, InputIt last, |
(4) | |
template< class InputIt > multiset( InputIt first, InputIt last, |
(5) | (since C++14) |
multiset( const multiset& other ); |
(6) | |
multiset( const multiset& other, const Allocator& alloc ); |
(7) | (since C++11) |
multiset( multiset&& other ); |
(8) | (since C++11) |
multiset( multiset&& other, const Allocator& alloc ); |
(9) | (since C++11) |
multiset( std::initializer_list<value_type> init, const Compare& comp = Compare(), |
(10) | (since C++11) |
multiset( std::initializer_list<value_type> init, const Allocator& ); |
(11) | (since C++14) |
Constructs new container from a variety of data sources and optionally using user supplied allocator alloc
or comparison function object comp
.
[first, last)
. other
.
If |
(since C++11) |
The template parameter |
(since C++23) |
other
using move semantics. If alloc
is not provided, allocator is obtained by move-construction from the allocator belonging to other
.
The template parameter |
(since C++23) |
init
. Parameters
alloc | - | allocator to use for all memory allocations of this container |
comp | - | comparison function object to use for all comparisons of keys |
first, last | - | the range to copy the elements from |
other | - | another container to be used as source to initialize the elements of the container with |
init | - | initializer list to initialize the elements of the container with |
Type requirements | ||
-InputIt must meet the requirements of LegacyInputIterator.
| ||
-Compare must meet the requirements of Compare.
| ||
-Allocator must meet the requirements of Allocator.
|
Complexity
N
if the range is already sorted by value_comp()
.other
alloc
is given and alloc != other.get_allocator(), then linear.N
if init
is already sorted by value_comp()
.Exceptions
Calls to Allocator::allocate
may throw.
Notes
After container move construction (overload (8-9)), references, pointers, and iterators (other than the end iterator) to other
remain valid, but refer to elements that are now in *this. The current standard makes this guarantee via the blanket statement in [container.requirements.general]/12, and a more direct guarantee is under consideration via LWG 2321.
Although not formally required until C++23, some implementations has already put the template parameter Allocator
into non-deduced contexts in earlier modes.
Example
#include <iostream> #include <string_view> #include <set> void print(const std::string_view name, const std::multiset<int>& ms) { std::cout << name << ": "; for(auto element: ms) std::cout << element << " "; std::cout << '\n'; } int main() { // (1) Default constructor std::multiset<int> a; a.insert(4); a.insert(3); a.insert(2); a.insert(1); print("a", a); // (4) Iterator constructor std::multiset<int> b(a.begin(), a.find(3)); print("b", b); // (6) Copy constructor std::multiset<int> c(a); print("c", c); // (8) Move constructor std::multiset<int> d(std::move(a)); print("d", d); // (10) Initializer list constructor std::multiset<int> e {3,2,1,2,4,7,3}; print("e", e); }
Output:
a: 1 2 3 4 b: 1 2 c: 1 2 3 4 d: 1 2 3 4 e: 1 2 2 3 3 4 7
Defect reports
The following behavior-changing defect reports were applied retroactively to previously published C++ standards.
DR | Applied to | Behavior as published | Correct behavior |
---|---|---|---|
LWG 2193 | C++11 | the default constructor is explicit | made non-explicit |
See also
assigns values to the container (public member function) |