erase_if overloads

Synopses

Declared in <absl/container/btree_map.h>

Erases all elements that satisfy the predicate pred from the inlined vector v.

template<
    typename T,
    size_t N,
    typename A,
    typename Predicate>
constexpr
InlinedVector<T, N, A>::size_type
erase_if(
    InlinedVector<T, N, A>& v,
    Predicate pred);

» more...

Erases all elements that satisfy the predicate pred from the container.

template<
    typename K,
    typename C,
    typename A,
    typename Pred>
btree_multiset<K, C, A>::size_type
erase_if(
    btree_multiset<K, C, A>& set,
    Pred pred);

» more...

Erases all elements that satisfy the predicate pred from the container.

template<
    typename K,
    typename C,
    typename A,
    typename Pred>
btree_set<K, C, A>::size_type
erase_if(
    btree_set<K, C, A>& set,
    Pred pred);

» more...

Erases all elements that satisfy the predicate pred from the container.

template<
    typename K,
    typename V,
    typename C,
    typename A,
    typename Pred>
btree_map<K, V, C, A>::size_type
erase_if(
    btree_map<K, V, C, A>& map,
    Pred pred);

» more...

Erases all elements that satisfy the predicate pred from the container.

template<
    typename K,
    typename V,
    typename C,
    typename A,
    typename Pred>
btree_multimap<K, V, C, A>::size_type
erase_if(
    btree_multimap<K, V, C, A>& map,
    Pred pred);

» more...

Erases all elements that satisfy the predicate pred from the container c.

template<
    typename T,
    typename H,
    typename E,
    typename A,
    typename Predicate>
flat_hash_set<T, H, E, A>::size_type
erase_if(
    flat_hash_set<T, H, E, A>& c,
    Predicate pred);

» more...

Erases all elements that satisfy the predicate pred from the container c.

template<
    typename T,
    typename H,
    typename E,
    typename A,
    typename Predicate>
node_hash_set<T, H, E, A>::size_type
erase_if(
    node_hash_set<T, H, E, A>& c,
    Predicate pred);

» more...

Erases all elements that satisfy the predicate pred from the container c.

template<
    typename K,
    typename V,
    typename H,
    typename E,
    typename A,
    typename Predicate>
flat_hash_map<K, V, H, E, A>::size_type
erase_if(
    flat_hash_map<K, V, H, E, A>& c,
    Predicate pred);

» more...

Erases all elements that satisfy the predicate pred from the container c.

template<
    typename K,
    typename V,
    typename H,
    typename E,
    typename A,
    typename Predicate>
node_hash_map<K, V, H, E, A>::size_type
erase_if(
    node_hash_map<K, V, H, E, A>& c,
    Predicate pred);

» more...

Return Value

The number of erased elements.

Parameters

Name

Description

v

The inlined vector to erase elements from.

pred

The predicate that selects elements to erase.

set

The container to erase elements from.

map

The container to erase elements from.

c

The container to erase elements from.

Created with MrDocs