std::multiset<Key,Compare,Allocator>::multiset (3) - Linux Manuals

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

NAME

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

Synopsis

multiset();
explicit multiset( const Compare& comp, (1)
const Allocator& alloc = Allocator() );
explicit multiset( const Allocator& alloc ); (1) (since C++11)
template< class InputIt >
multiset( InputIt first, InputIt last,
const Compare& comp = Compare(),
const Allocator& alloc = Allocator() );
template< class InputIt >
multiset( InputIt first, InputIt last, (since C++14)
const Allocator& alloc );
multiset( const multiset& other ); (2) (3)
multiset( const multiset& other, const Allocator& alloc ); (3) (since C++11)
multiset( multiset&& other ); (4) (since C++11)
multiset( multiset&& other, const Allocator& alloc ); (4) (since C++11)
multiset( std::initializer_list<value_type> init,
const Compare& comp = Compare(), (since C++11)
const Allocator& alloc = Allocator() ); (5)
multiset( std::initializer_list<value_type> init, (since C++14)
const Allocator& );

Constructs new container from a variety of data sources and optionally using user supplied allocator alloc or comparison function object comp.
1) Constructs an empty container.
2) Constructs the container with the contents of the range [first, last).
3) 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()).
4) 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.
5) Constructs the container with the contents of the initializer list 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

1) Constant
2) N log(N) where N = std::distance(first, last) in general, linear in N if the range is already sorted by value_comp().
3) Linear in size of other
4) Constant. If alloc is given and alloc != other.get_allocator(), then linear.
5) N log(N) where N = init.size()) in general, linear in N if init is already sorted by value_comp().

Exceptions

Calls to Allocator::allocate may throw.

Notes

After container move construction (overload (4)), 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 §23.2.1[container.requirements.general]/12, and a more direct guarantee is under consideration via LWG_2321.

Example

 This section is incomplete
 Reason: no example

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