| Defined in header <experimental/list>
|
||
| template< class T, class Alloc, class Pred > void erase_if( std::list<T, Alloc>& c, Pred pred ); |
(library fundamentals TS v2) | |
Erases all elements that satisfy the predicate pred from the container. Equivalent to c.remove_if(pred);.
Parameters
| c | - | container from which to erase |
| pred | - | predicate that determines which elements should be erased |
Complexity
Linear.
Example
#include <experimental/list>
#include <iostream>
template<typename Os, typename Container>
inline Os& operator<<(Os& os, Container const& container)
{
os << "{ ";
for (const auto& item : container)
os << item << ' ';
return os << '}';
}
int main()
{
std::list<int> data{3, 3, 4, 5, 5, 6, 6, 7, 2, 1, 0};
std::cout << "Original:\n" << data << '\n';
auto divisible_by_3 = [](auto const& x) { return (x % 3) == 0; };
std::experimental::erase_if(data, divisible_by_3);
std::cout << "Erase all items divisible by 3:\n" << data << '\n';
}Original:
{ 3 3 4 5 5 6 6 7 2 1 0 }
Erase all items divisible by 3:
{ 4 5 5 7 2 1 }See also
| removes elements satisfying specific criteria (function template) | |
| removes elements satisfying specific criteria (public member function of std::list<T,Allocator>) | |
| (library fundamentals 2 TS) |
erases all elements equal to a specific value from a std::list (function template) |
Content from this page on cppreference.com, licensed under CC-BY-SA 3.0 and GFDL. Modified: restyled, site navigation removed, code windows added. Offline snapshot of 9 February 2025.