insert overloads
Declared in <bslstl_unorderedmultimap.h>
Insert into this unordered multimap the value of each value_type object in the specified values initializer list. This method requires that the (template parameter) types KEY and VALUE both be copy-insertable into this unordered multimap (see {Requirements on KEY and VALUE}).
void
insert(std::initializer_list<value_type> values);Insert the specified value into this unordered multimap, and return an iterator referring to the newly inserted value_type object. This method requires that the (template parameter) types KEY and VALUE both be copy-insertable into this unordered multimap (see {Requirements on KEY and VALUE}).
unordered_multimap<KEY, VALUE, HASH, EQUAL, ALLOCATOR>::iterator
insert(value_type const& value);Insert into this unordered multimap a value_type object created from the specified value, and return an iterator referring to the newly inserted value_type object. This method requires that the (template parameter) types KEY and VALUE both be move-insertable into this unordered multimap (see {Requirements on KEY and VALUE}), and the value_type be constructible from the (template parameter) ALT_VALUE_TYPE.
template<class ALT_VALUE_TYPE>
iterator
insert(ALT_VALUE_TYPE&& value)
requires std::is_constructible<value_type,
ALT_VALUE_TYPE&&>::value;Insert the specified value into this unordered multimap (in constant time if the specified hint refers to an element in this container with a key equivalent to the key of value), and return an iterator referring to the newly inserted value_type object. If hint does not refer to an element in this container with a key equivalent to the key of value, this operation has worst case O[N] and average case constant-time complexity, where N is the size of this unordered multimap. This method requires that the (template parameter) types KEY and VALUE both be copy-insertable into this unordered multimap (see {Requirements on KEY and VALUE}). The behavior is undefined unless hint is an iterator in the range [begin() .. end()] (both endpoints included).
unordered_multimap<KEY, VALUE, HASH, EQUAL, ALLOCATOR>::iterator
insert(
const_iterator hint,
value_type const& value);Insert into this unordered multimap 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 unordered multimap, where i is a dereferenceable iterator in the range [first .. last)] (see {Requirements on KEY and VALUE}). 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);Insert into this unordered multimap a value_type object created from the specified value (in constant time if the specified hint refers to an element in this container with a key equivalent to the key of value), and return an iterator referring to the newly inserted value_type object. If hint does not refer to an element in this container with a key equivalent to the key of value, this operation has worst case O[N] and average case constant-time complexity, where N is the size of this unordered multimap. This method requires that the (template parameter) types KEY and VALUE both be move-insertable into this unordered multimap (see {Requirements on KEY and VALUE}), and the value_type be constructible from the (template parameter) ALT_VALUE_TYPE. The behavior is undefined unless hint is an iterator in the range [begin() .. end()] (both endpoints included).
template<class ALT_VALUE_TYPE>
iterator
insert(
const_iterator hint,
ALT_VALUE_TYPE&& value)
requires std::is_constructible<value_type,
ALT_VALUE_TYPE&&>::value;