erase overloads

Synopses

Declared in <bdlc_flathashmap.h>

Erase the element at the specified position.

FlatHashMap<KEY, VALUE, HASH, EQUAL>::iterator
erase(const_iterator position);

» more...

Erase the element at the specified position.

FlatHashMap<KEY, VALUE, HASH, EQUAL>::iterator
erase(iterator position);

» more...

Erase the element with the specified key, if present.

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

» more...

Erase 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...

Erase the elements in the half‐open range [first, last)].

FlatHashMap<KEY, VALUE, HASH, EQUAL>::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 erase

key

key of the element to erase

first

beginning of the erase range

last

end of the erase range (exclusive)

Created with MrDocs