erase overloads

Synopses

Declared in <bdlc_flathashset.h>

Remove the element at the specified position.

FlatHashSet<KEY, HASH, EQUAL>::const_iterator
erase(const_iterator position);

» more...

Remove the element with the specified key, if present.

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

» more...

Remove the element equivalent to the specified key, if present.

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;

» more...

Remove the elements in the half‐open iterator range.

FlatHashSet<KEY, HASH, EQUAL>::const_iterator
erase(
    const_iterator first,
    const_iterator last);

» more...

Return Value

  • iterator following the erased element

  • 1 if an element was erased, and 0 otherwise

  • iterator equal to last

Parameters

Name

Description

position

iterator to the element to remove

key

key of the element to remove

first

beginning of the range to erase

last

end of the range to erase (exclusive)

Created with MrDocs