std::erase,std::erase_if(std::list) (3) - Linux Manuals

std::erase,std::erase_if(std::list): std::erase,std::erase_if(std::list)

NAME

std::erase,std::erase_if(std::list) - std::erase,std::erase_if(std::list)

Synopsis

Defined in header <list>
template< class T, class Alloc, class U > (1) (since C++20)
void erase(std::list<T,Alloc>& c, const U& value);
template< class T, class Alloc, class Pred > (2) (since C++20)
void erase_if(std::list<T,Alloc>& c, Pred pred);

1) Erases all elements that compare equal to value from the container. Equivalent to c.remove_if([&](auto& elem) { return elem == value; });
2) Erases all elements that satisfy the predicate pred from the container. Equivalent to c.remove_if(pred);

Parameters

c - container from which to erase
value - value to be removed
        unary predicate which returns true if the element should be erased.
pred - The expression pred(v) must be convertible to bool for every argument v of type (possibly const) T, regardless of value_category, and must not modify v. Thus, a parameter type of T&is not allowed
        , nor is T unless for T a move is equivalent to a copy
        (since C++11).

Complexity

Linear.

Example

 This section is incomplete
 Reason: no example

Notes

Unlike std::list::remove, erase accepts heterogenous types and does not force a conversion to the container's value type before invoking the == operator.