Insert into this hash map an element having the specified key and the specified move‐insertable value. If key already exists in this hash map, the value attribute of that element is set to value. Return 1 if an element is inserted, and 0 if an existing element is updated. 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 the return value equals the number of elements inserted.

Synopsis

Declared in <bdlcc_stripedunorderedmap.h>

std::size_t
insert(
    KEY const& key,
    bslmf::MovableRef<VALUE> value);

Created with MrDocs