# std::erase, std::erase_if (std::deque)

From cppreference.com
< cpp‎ | container‎ | deque

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

1) Erases all elements that compare equal to `value` from the container. Equivalent to c.erase(std::remove(c.begin(), c.end(), value), c.end());
2) 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
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

| This section is incomplete Reason: no example

### See also

remove remove_if | removes elements satisfying specific criteria (function template)

Retrieved from "https://en.cppreference.com/mwiki/index.php?title=cpp/container/deque/erase2&oldid=108077"