erase overloads

Synopses

Declared in <bslstl_multiset.h>

Erase the element at position.

multiset<KEY, COMPARATOR, ALLOCATOR>::iterator
erase(const_iterator position);

» more...

Erase all elements equivalent to key.

multiset<KEY, COMPARATOR, ALLOCATOR>::size_type
erase(key_type const& key);

» more...

Remove all elements matching the specified transparent key.

template<class t_KEY>
size_type
erase(t_KEY&& key)
requires BloombergLP::bslmf::IsTransparentPredicate<COMPARATOR,
                                                   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 range [first, last)].

multiset<KEY, COMPARATOR, ALLOCATOR>::iterator
erase(
    const_iterator first,
    const_iterator last);

» more...

Return Value

  • iterator to the element following the erased element

  • number of elements erased

  • last

Parameters

Name

Description

position

iterator to the element to erase

key

key whose matching elements are erased

first

beginning of the erase range

last

end of the erase range

Created with MrDocs