Constructors
Declared in <bslstl_multiset.h>
Create an empty multiset. 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 the 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 (the default), then basicAllocator, if supplied, shall be convertible to bslma::Allocator *. If the type ALLOCATOR is bsl::allocator and basicAllocator is not supplied, the currently installed default allocator is used.
multiset();Create a multiset having the same value as the specified original object. Use a copy of original.key_comp() to order the keys contained in this multiset. Use the allocator returned by 'bsl::allocator_traits<ALLOCATOR>:: select_on_container_copy_construction(original.get_allocator())' to allocate memory. This method requires that the (template parameter) type KEY be copy-insertable into this multiset (see {Requirements on KEY}).
multiset(multiset const& original);Create a multiset having the same value as that of the specified original object by moving (in constant time) the contents of original to the new multiset. Use a copy of original.key_comp() to order the keys contained in this multiset. The allocator associated with original is propagated for use in the newly-created multiset. original is left in a valid but unspecified state.
multiset(BloombergLP::bslmf::MovableRef<multiset> original);Create an empty multiset that uses the specified basicAllocator to supply memory. Use a default-constructed object of the (template parameter) type COMPARATOR to order the keys contained in this multiset. Note that a bslma::Allocator * can be supplied for basicAllocator if the (template parameter) ALLOCATOR is bsl::allocator (the default).
explicit
multiset(ALLOCATOR const& basicAllocator);Create a multiset having the same value as the specified original object that uses the specified basicAllocator to supply memory. The contents of original are moved (in constant time) to the new multiset if basicAllocator == original.get_allocator(), and are move-inserted (in linear time) using basicAllocator otherwise. original is left in a valid but unspecified state. Use a copy of original.key_comp() to order the keys contained in this multiset. This method requires that the (template parameter) type KEY be move-insertable into this multiset (see {Requirements on KEY}). Note that a bslma::Allocator * can be supplied for basicAllocator if the (template parameter) type ALLOCATOR is bsl::allocator (the default).
multiset(
BloombergLP::bslmf::MovableRef<multiset> original,
ALLOCATOR const& basicAllocator);Same as the preceding overload, using the specified basicAllocator.
multiset(
std::initializer_list<KEY> values,
ALLOCATOR const& basicAllocator);Create an empty multiset having the specified comparator.
explicit
multiset(
COMPARATOR const& comparator,
ALLOCATOR const& basicAllocator = ALLOCATOR());Create a multiset having the same value as the specified original object that uses the specified basicAllocator to supply memory. Use a copy of original.key_comp() to order the keys contained in this multiset. 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 (template parameter) type ALLOCATOR is bsl::allocator (the default).
multiset(
multiset const& original,
ALLOCATOR const& basicAllocator);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).
multiset(
std::initializer_list<KEY> values,
COMPARATOR const& comparator = COMPARATOR(),
ALLOCATOR const& basicAllocator = ALLOCATOR());Same as the preceding overload, using the specified basicAllocator.
template<class INPUT_ITERATOR>
multiset(
INPUT_ITERATOR first,
INPUT_ITERATOR last,
ALLOCATOR const& basicAllocator);Create a multiset from the specified range, using the specified basicAllocator.
template<class RANGE>
multiset(
std::from_range_t,
RANGE&& range,
ALLOCATOR const& basicAllocator);Create a multiset, and insert each value_type object in the sequence starting at the specified first element, and ending immediately before the specified last element. 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 the sequence first to last is ordered according to comparator, then this operation has O[N] complexity, where N is the number of elements between first and last, otherwise this operation has O[N * log(N)] complexity. The (template parameter) type INPUT_ITERATOR shall meet the requirements of an input iterator defined in the C++11 standard [24.2.3]providing access to values of a type convertible to value_type, and value_type must be emplace-constructible from *i into this multiset, where i is a dereferenceable iterator in the range [first .. last)] (see {Requirements on KEY}). The behavior is undefined unless first and last refer to a sequence of valid values where first is at a position at or before last. Note that a bslma::Allocator * can be supplied for basicAllocator if the type ALLOCATOR is bsl::allocator (the default).
template<class INPUT_ITERATOR>
multiset(
INPUT_ITERATOR first,
INPUT_ITERATOR last,
COMPARATOR const& comparator = COMPARATOR(),
ALLOCATOR const& basicAllocator = ALLOCATOR());Create a multiset having the (value_type) values obtained from the specified range. Ignore those those objects having a key equivalent to that which appears earlier in the sequence. Optionally specify a comparator used to order key-value pairs 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 (the default), then basicAllocator, if supplied, shall be convertible to bslma::Allocator *. If the type ALLOCATOR is bsl::allocator and basicAllocator is not supplied, the currently installed default allocator is used. If values obtained from `range are ordered according to comparator, then this operation has O[N] complexity, where N is the number of values in the range; otherwise, this operation has O[N * log(N)] complexity. Note that RANGE must meet the requirements of an input range and the values from range must have a type matching or convertible to value_type.
template<class RANGE>
multiset(
std::from_range_t,
RANGE&& range,
COMPARATOR const& comparator = COMPARATOR(),
ALLOCATOR const& basicAllocator = ALLOCATOR());