Erase from this hash map the first element with specified key (of possibly many) found, for which the specified predicate holds true. Return the number of elements erased.
Declared in <bdlcc_stripedunorderedcontainerimpl.h>
std::size_t
eraseFirstIf(
KEY const& key,
EraseIfValuePredicate const& predicate);