Remove the entry with the specified key, if present.
Declared in <bdlc_flathashtable.h>
std::size_t
erase(KEY const& key);
Remove from this table the object having the specified key, if it exists, and return 1; otherwise (there is no object with a key equal to key in this table) return 0 with no other effect. This method invalidates all iterators, and references to the removed element.
1 if an entry was erased, and 0 otherwise
| Name | Description |
|---|---|
| key | key of the entry to remove |