Insert into this hash map an element having the specified key and 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. Note that the return value equals the number of elements inserted.

Synopsis

Declared in <bdlcc_stripedunorderedmap.h>

std::size_t
insert(
    KEY const& key,
    VALUE const& value);

Created with MrDocs