NAME¶

std::experimental::erase_if(std::deque) - std::experimental::erase_if(std::deque)

Synopsis¶

Defined in header <experimental/deque>
template< class T, class Alloc, class Pred > (library fundamentals TS v2)
void erase_if( std::deque<T,Alloc>& c, Pred pred );

Erases all elements that satisfy the predicate pred from the container. Equivalent
to c.erase(std::remove_if(c.begin(), c.end(), pred), c.end());

Parameters¶

c - container from which to erase
pred - predicate that determines which elements should be erased

Complexity¶

Linear.

Example¶

// Run this code

#include <experimental/deque>
#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::deque<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';
}

Output:¶

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¶

remove removes elements satisfying specific criteria
remove_if (function template)
erase (std::deque) Erases all elements equal to a specific value from a
(library fundamentals 2 TS) std::deque
(function template)