std::multiset<Key,Compare,Allocator>::multiset

std::multiset<Key,Compare,Allocator>::multiset - cppreference.com

From cppreference.com

	(1)
`multiset();`			(until C++11)
`multiset() : multiset(Compare()) {}`			(since C++11)
`explicit multiset( const Compare& comp, {{#pad:\|17}} const Allocator& alloc = Allocator() );`		(2)
`explicit multiset( const Allocator& alloc );`		(3)	(since C++11)
`template< class InputIt > multiset( InputIt first, InputIt last, {{#pad:\|8}} const Compare& comp = Compare(), {{#pad:\|8}} const Allocator& alloc = Allocator() );`		(4)
`template< class InputIt > multiset( InputIt first, InputIt last, {{#pad:\|8}} const Allocator& alloc ) : multiset(first, last, Compare(), alloc) {}`		(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, {{#pad:\|8}} const Compare& comp = Compare(), {{#pad:\|8}} const Allocator& alloc = Allocator() );`		(10)	(since C++11)
`multiset( std::initializer_list<value_type> init, {{#pad:\|8}} const Allocator& alloc ) : multiset(init, Compare(), alloc) {}`		(11)	(since C++14)
`template< container-compatible-range<value_type> R > multiset( std::from_range_t, R&& rg, {{#pad:\|8}} const Compare& comp = Compare(), {{#pad:\|8}} const Allocator& alloc = Allocator() );`		(12)	(since C++23)
`template< container-compatible-range<value_type> R > multiset( std::from_range_t, R&& rg, {{#pad:\|8}} const Allocator& alloc ) : multiset(std::from_range, std::forward<R>(rg), Compare(), alloc) {}`		(13)	(since C++23)

Constructs new container from a variety of data sources and optionally using user supplied allocator alloc or comparison function object comp.

1-3) Constructs an empty container.

4,5) Constructs the container with the contents of the range [first, last).

If [first, last) is not a valid range, the behavior is undefined.

6,7) Copy constructor. Constructs the container with the copy of the contents of other.

If `alloc` is not provided, allocator is obtained by calling `std::allocator_traits<allocator_type>::` `select_on_container_copy_construction(other.get_allocator())`.	(since C++11)
During class template argument deduction, only the first argument contributes to the deduction of the container's `Allocator` template parameter.	(since C++23)

8,9) Move constructor. Constructs the container with the contents of other using move semantics. If alloc is not provided, allocator is obtained by move-construction from the allocator belonging to other.

12,13) Constructs the container with the contents of rg.

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 pair of iterators defining the source range of elements to copy
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
rg	-	a container compatible range, that is, an `input_range` whose elements are convertible to `value_type`
Type requirements
-`InputIt` must meet the requirements of LegacyInputIterator.
-`Compare` must meet the requirements of Compare.
-`Allocator` must meet the requirements of Allocator.

Complexity

1-3) Constant.

4,5) N·log(N) where N is std::distance(first, last) in general, linear in N if [first, last) is already sorted by value_comp().

6,7) Linear in size of other.

8,9) Constant. If alloc is given and alloc != other.get_allocator(), then linear.

10,11) N·log(N) where N is init.size() in general, linear in N if init is already sorted by value_comp().

12,13) N·log(N) where N is ranges::distance(rg) in general, linear in N if rg 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.reqmts]/67, and a more direct guarantee is under consideration via LWG issue 2321.

Although not formally required until C++23, some implementations has already put the template parameter Allocator into non-deduced contexts in earlier modes.

Feature-test macro	Value	Std	Feature
`__cpp_lib_containers_ranges`	`202202L`	(C++23)	Ranges-aware construction and insertion; overloads (12,13)

Example

#include <iostream>
#include <set>
#include <string_view>

template <typename T>
void println(const std::string_view name, const std::multiset<T>& ms)
{
    std::cout << name << ": ";
    for (const 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);
    println("a", a);
    
    // (4) Range constructor
    std::multiset<int> b(a.begin(), a.find(3));
    println("b", b);
    
    // (6) Copy constructor
    std::multiset<int> c(a);
    println("c", c);
    
    // (8) Move constructor
    std::multiset<int> d(std::move(a));
    println("d", d);
    
    // (10) Initializer list constructor
    std::multiset<int> e{3, 2, 1, 2, 4, 7, 3};
    println("e", e);

    // (12) Range constructor
    const auto w = {"α", "β", "γ", "δ", "δ", "γ", "β", "α"};
#if __cpp_lib_containers_ranges
    std::multiset<std::string> f(std::from_range, w); // overload (12)
#else
    std::multiset<std::string> f(w.begin(), w.end()); // fallback to (4)
#endif
    println("f", f);
}

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
f: α α β β γ γ δ δ

Defect reports

The following behavior-changing defect reports were applied retroactively to previously published C++ standards.