insertUnique overloads

Synopses

Declared in <bdlcc_stripedunorderedcontainerimpl.h>

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.

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

» more...

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.

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

» more...

Created with MrDocs