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

Defined in header <list> 
template< class T, class Alloc, class U >
void erase(std::list<T,Alloc>& c, const U& value);
 (1) (since C++20) 
template< class T, class Alloc, class Pred >
void erase_if(std::list<T,Alloc>& c, Pred pred);
 (2) (since C++20)
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
pred - unary predicate which returns ​true if the element should be erased.

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

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.

See also

removes elements satisfying specific criteria
(function template)
removes elements satisfying specific criteria
(public member function)

© cppreference.com
Licensed under the Creative Commons Attribution-ShareAlike Unported License v3.0.
http://en.cppreference.com/w/cpp/container/list/erase2