[#BloombergLP-bdlcc-StripedUnorderedContainerImpl-setComputedValueAll]
= xref:BloombergLP.adoc[BloombergLP]::xref:BloombergLP/bdlcc.adoc[bdlcc]::xref:BloombergLP/bdlcc/StripedUnorderedContainerImpl.adoc[StripedUnorderedContainerImpl]::setComputedValueAll
:relfileprefix: ../../../
:mrdocs:

Serially invoke the specified `visitor` passing the specified `key`, and the address of the value of each element in this hash map having `key`. If `key` is not in the map, `value` will be default constructed. That is, for each `(key, value)` found, invoke: ` bool visitor(VALUE *value, const Key& key); ` If no element in the map has `key`, insert `(key, VALUE())` and invoke `visitor` with `value` pointing to the defsult constructed value. Return the number of elements visited or the negation of that value if visitations stopped because `visitor` returned `false`. `visitor`, when invoked, has exclusive access (i.e., write access) to each element during 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. Note that the `setComputedValueFirst` method is more performant than the when the hash map contains a single element for `key`. Also note that a return value of `0` implies that an element was inserted.

== Synopsis

Declared in `<bdlcc_stripedunorderedcontainerimpl.h>`

[source,cpp,subs="verbatim,replacements,macros,-callouts"]
----
int
setComputedValueAll(
    KEY const& key,
    xref:BloombergLP/bdlcc/StripedUnorderedContainerImpl/VisitorFunction.adoc[VisitorFunction] const& visitor);
----


[.small]#Created with https://www.mrdocs.com[MrDocs]#