Insert the specified value into this multimap (in amortized constant time if the specified hint is a valid immediate successor to the key of value). Return an iterator referring to the newly inserted value_type object. If hint is not a valid immediate successor to the key of value, this operation has O[log(N)] complexity, where N is the size of this multimap. This method requires that the (template parameter) types KEY and VALUE both be copy‐insertable into this multimap (see {Requirements on KEY and VALUE}). The behavior is undefined unless hint is an iterator in the range [begin() .. end()] (both endpoints included).
Synopsis
Declared in <bslstl_multimap.h>
multimap<KEY, VALUE, COMPARATOR, ALLOCATOR>::iterator
insert(
const_iterator hint,
value_type const& value);
Created with MrDocs