Remove from this set 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 set), return 0 with no other effect. This method invalidates all iterators and references to the removed element.

Synopsis

Declared in <bdlc_flathashset.h>

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

Created with MrDocs