visitReadOnly overloads

Synopses

Declared in <bdlcc_stripedunorderedmap.h>

Call the specified visitor (in an unspecified order) on all elements in this hash table until each such element has been visited 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 read‐only access to each element for duration of each invocation. Every element present in this hash map at the time visit is invoked will be visited unless it is removed before visitor is called for that element. Each visitation is done by the calling thread and the order of visitation is not specified. The behavior is undefined if hash map manipulators are invoked from within visitor, as it may lead to a deadlock. Note that visitor can not change the value of the visited elements.

int
visitReadOnly(ReadOnlyVisitorFunction const& visitor) const;

» more...

Call the specified visitor on element (if one exists) in this hash map having the specified key. That is, for (key, value), invoke: ` bool visitor(value, key); ` Return the number of elements visited or ‐1 if visitor returned false. visitor has read‐only access to each element for duration of each invocation. The behavior is undefined if hash map manipulators are invoked from within visitor, as it may lead to a deadlock.

int
visitReadOnly(
    KEY const& key,
    ReadOnlyVisitorFunction const& visitor) const;

» more...

Created with MrDocs