Set the value attribute of the first element in this hash map (of possibly many) found to have the specified key to the specified value. If no such such element exists, insert (key, 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.
Declared in <bdlcc_stripedunorderedcontainerimpl.h>
std::size_t
setValueFirst(
KEY const& key,
VALUE const& value);