Set the first element with key to value, inserting if absent.
Declared in <bdlcc_stripedunorderedcontainerimpl.h>
std::size_t
setValueFirst(
KEY const& key,
VALUE const& value);Return the number of elements found with key. Note that if no elements were found, and a new value was inserted, 0 is returned. Also note that this method is more performant than setValueAll when there is one element having key in the hash map.
number of elements found with key
| Name | Description |
|---|---|
| key | key of the element to set or insert |
| value | value to assign or insert |