Erase from this hash map the element having the specified key. Return 1 on success and 0 if key does not exist. Note that the returned value equals the number of elements removed.

Synopsis

Declared in <bdlcc_stripedunorderedmap.h>

std::size_t
erase(KEY const& key);

Created with MrDocs