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