std::erase, std::erase_if (std::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 |
Complexity
Linear.
Example
See also
removes elements satisfying specific criteria (function template) |
© cppreference.com
Licensed under the Creative Commons Attribution-ShareAlike Unported License v3.0.
http://en.cppreference.com/w/cpp/container/deque/erase2