cppdraft_translate/cppdraft/multiset/cons.md

[multiset.cons]

23 Containers library [containers]

23.4 Associative containers [associative]

23.4.7 Class template multiset [multiset]

23.4.7.2 Constructors [multiset.cons]

🔗

constexpr explicit multiset(const Compare& comp, const Allocator& = Allocator());

1

#

Effects: Constructs an empty multiset using the specified comparison object and allocator.

2

#

Complexity: Constant.

🔗

template<class InputIterator> constexpr multiset(InputIterator first, InputIterator last, const Compare& comp = Compare(), const Allocator& = Allocator());

3

#

Effects: Constructs an emptymultiset using the specified comparison object and allocator, and inserts elements from the range [first, last).

4

#

Complexity: Linear in N if the range [first, last) is already sorted with respect to comp and otherwise NlogN, where N islast - first.

🔗

template<[container-compatible-range](container.intro.reqmts#concept:container-compatible-range "23.2.2.1 Introduction [container.intro.reqmts]")<value_type> R> constexpr multiset(from_range_t, R&& rg, const Compare& comp = Compare(), const Allocator& = Allocator());

5

#

Effects: Constructs an empty multiset using the specified comparison object and allocator, and inserts elements from the range rg.

6

#

Complexity: Linear in N if rg is already sorted with respect to comp and otherwise NlogN, where N is ranges​::​distance(rg).