insert overloads
Declared in <bslstl_multiset.h>
Insert the specified value into this multiset. If a range containing elements equivalent to value already exists in this multiset, insert value at the end of that range. value is left in a valid but unspecified state. Return an iterator referring to the newly inserted value_type object in this multiset that is equivalent to value. This method requires that the (template parameter) type KEY be move-insertable into this multiset (see {Requirements on KEY}).
multiset<KEY, COMPARATOR, ALLOCATOR>::iterator
insert(BloombergLP::bslmf::MovableRef<value_type> value);Insert into this multiset the value of each value_type object in the specified values initializer list. This method requires that the (template parameter) type KEY be copy-insertable into this multiset (see {Requirements on KEY}).
void
insert(std::initializer_list<KEY> values);Insert the specified value into this multiset. If a range containing elements equivalent to value already exists, insert the value at the end of that range. Return an iterator referring to the newly inserted value_type object. This method requires that the (template parameter) type KEY be copy-insertable into this multiset (see {Requirements on KEY}).
multiset<KEY, COMPARATOR, ALLOCATOR>::iterator
insert(value_type const& value);Insert the specified value into this multiset (in amortized constant time if the specified hint is a valid immediate successor to value). value is left in a valid but unspecified state. Return an iterator referring to the newly inserted value_type object in this multiset that is equivalent to value. If hint is not a valid immediate successor to value, this operation has O[log(N)] complexity, where N is the size of this multiset. This method requires that the (template parameter) type KEY be move-insertable into this multiset (see {Requirements on KEY}). The behavior is undefined unless hint is an iterator in the range [begin() .. end()] (both endpoints included).
multiset<KEY, COMPARATOR, ALLOCATOR>::iterator
insert(
const_iterator hint,
BloombergLP::bslmf::MovableRef<value_type> value);Insert the specified value into this multiset (in amortized constant time if the specified hint is a valid immediate successor to value). Return an iterator referring to the newly inserted value_type object in this multiset that is equivalent to value. If hint is not a valid immediate successor to value, this operation has O[log(N)] complexity, where N is the size of this multiset. This method requires that the (template parameter) type KEY be copy-insertable into this multiset (see {Requirements on KEY}). The behavior is undefined unless hint is an iterator in the range [begin() .. end()] (both endpoints included).
multiset<KEY, COMPARATOR, ALLOCATOR>::iterator
insert(
const_iterator hint,
value_type const& value);Insert into this multiset the value of each value_type object in the range starting at the specified first iterator and ending immediately before the specified last iterator. 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.
template<class INPUT_ITERATOR>
void
insert(
INPUT_ITERATOR first,
INPUT_ITERATOR last);