Erase from this hash map the first element (of possibly many) found to the specified key. Return the number of elements erased. Note that method is more performant than eraseAll when there is one element having key.
Synopsis
Declared in <bdlcc_stripedunorderedcontainerimpl.h>
std::size_t
eraseFirst(KEY const& key);
Created with MrDocs