Update each element with key by invoking the specified visitor.
Declared in <bdlcc_stripedunorderedcontainerimpl.h>
int
update(
KEY const& key,
VisitorFunction const& visitor);Serially call the specified visitor on each element (if one exists) in this hash map having the specified key until every such element has been updated or visitor returns false. That is, for (key, value), invoke: ` bool visitor(&value, key); ` Return the number of elements visited or the negation of that value if visitations stopped because visitor returned false. visitor has exclusive access (i.e., write access) to each element for duration of each invocation. The behavior is undefined if hash map manipulators and getValue* methods are invoked from within visitor, as it may lead to a deadlock.
DEPRECATED: Use visit(key, visitor) instead.
number of elements visited, or its negation if stopped early
| Name | Description |
|---|---|
| key | key of the elements to update |
| visitor | functor invoked with each matching value |