Insert the specified value into this unordered multiset (in constant time if the specified hint refers to an element in this container equivalent to value). If one or more keys equivalent to value already exist in this unordered multiset, this method is guaranteed to insert value in a position contiguous to one of those equivalent keys. Return an iterator referring to the newly inserted value_type object that is equivalent to value. If hint does not refer to an element in this container equivalent to value, this operation has worst case O[N] and average case constant-time complexity, where N is the size of this unordered multiset. This method requires that the (template parameter) type KEY be move-insertable into this unordered multiset (see {Requirements on KEY}). The behavior is undefined unless hint is an iterator in the range [begin() .. end()] (both endpoints included).
Declared in <bslstl_unorderedmultiset.h>
unordered_multiset<KEY, HASH, EQUAL, ALLOCATOR>::iterator
insert(
const_iterator hint,
BloombergLP::bslmf::MovableRef<value_type> value);