Insert value near hint and return an iterator to it.

Synopsis

Declared in <bslstl_unorderedmultimap.h>

unordered_multimap<KEY, VALUE, HASH, EQUAL, ALLOCATOR>::iterator
insert(
    const_iterator hint,
    value_type const& value);

Description

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).

Return Value

iterator referring to the newly inserted element

Parameters

Name

Description

hint

iterator hint for insertion position

value

element to insert

Created with MrDocs