Remove from this set the element whose key is equivalent to the specified key, if it exists, and return 1; otherwise (there is no element equivalent to key in this set), return 0 with no other effect. This method invalidates all iterators and references to the removed element.
Declared in <bdlc_flathashset.h>
template<class LOOKUP_KEY>
std::size_t
erase(LOOKUP_KEY&& key)
requires BloombergLP::bslmf::IsTransparentPredicate<HASH, LOOKUP_KEY>::value
&& BloombergLP::bslmf::IsTransparentPredicate<EQUAL,LOOKUP_KEY>::value;