Insert into this hash map an element having the specified key and the specified move‐insertable value. The value object is left in a valid but unspecified state. If value is allocator‐enabled and allocator() != value.allocator() this operation may cost as much as a copy. Note that other elements having the same key may exist in this hash map.
Synopsis
Declared in <bdlcc_stripedunorderedmultimap.h>
void
insert(
KEY const& key,
bslmf::MovableRef<VALUE> value);
Created with MrDocs