24 Containers library [containers]

24.4 Associative containers [associative]

24.4.7 Class template multiset [multiset]

24.4.7.2 Constructors [multiset.cons]

🔗
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> multiset(InputIterator first, InputIterator last, const Compare& comp = Compare(), const Allocator& = Allocator());
3
#
Effects: Constructs an empty multiset 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 , where N is last - first.
🔗
template<container-compatible-range<value_type> R> 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 , where N is ranges​::​distance(rg).