bsl::unordered_set::erase

Synopses

Declared in <bslstl_unorderedset.h>

Erase the element at position.

unordered_set<KEY, HASH, EQUAL, ALLOCATOR>::iterator
erase(const_iterator position);

» more...

Erase the element equivalent to key, if present.

unordered_set<KEY, HASH, EQUAL, ALLOCATOR>::size_type
erase(key_type const& key);

» more...

Erase the element equivalent to key, if present.

template<class t_KEY>
size_type
erase(t_KEY&& key)
requires BloombergLP::bslmf::IsTransparentPredicate<HASH, t_KEY>::value &&
        BloombergLP::bslmf::IsTransparentPredicate<EQUAL,t_KEY>::value &&
        !is_convertible<BSLS_COMPILERFEATURES_FORWARD_REF(t_KEY),
                        iterator>::value &&
        !is_convertible<BSLS_COMPILERFEATURES_FORWARD_REF(t_KEY),
                        const_iterator>::value;

» more...

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

unordered_set<KEY, HASH, EQUAL, ALLOCATOR>::iterator
erase(
    const_iterator first,
    const_iterator last);

» more...