Create a multiset and insert each value_type object in the specified values initializer list. Optionally specify a comparator used to order keys contained in this object. If comparator is not supplied, a default-constructed object of the (template parameter) type COMPARATOR is used. Optionally specify a basicAllocator used to supply memory. If basicAllocator is not supplied, a default-constructed object of the (template parameter) type ALLOCATOR is used. If the type ALLOCATOR is bsl::allocator and basicAllocator is not supplied, the currently installed default allocator is used. If values is ordered according to comparator, then this operation has O[N] complexity, where N is the number of elements in values; otherwise this operation has O[N * log(N)] complexity. This method requires that the (template parameter) type KEY be copy-insertable into this multiset (see {Requirements on KEY}). Note that a bslma::Allocator * can be supplied for basicAllocator if the type ALLOCATOR is bsl::allocator (the default).
Declared in <bslstl_multiset.h>
multiset(
std::initializer_list<KEY> values,
COMPARATOR const& comparator = COMPARATOR(),
ALLOCATOR const& basicAllocator = ALLOCATOR());