std::experimental:: erase (std::deque)
|
Defined in header
<experimental/deque>
|
||
|
template
<
class
T,
class
A,
class
U
>
void erase ( std:: deque < T, A > & c, const U & value ) ; |
(library fundamentals TS v2) | |
Erases all elements that compare equal to value from the container. Equivalent to c. erase ( std :: remove ( c. begin ( ) , c. end ( ) , value ) , c. end ( ) ) ; .
Parameters
| c | - | container from which to erase |
| value | - | value to be removed |
Complexity
Linear.
Example
#include <experimental/deque> #include <iostream> auto show = [](const auto& container) { for (auto e : container) std::cout << e; std::cout << '\n'; }; int main() { std::deque<int> data{1, 1, 1, 4, 1, 1, 1, 2, 1, 1, 1}; show(data); std::experimental::erase(data, 1); show(data); }
Output:
11141112111 42
See also
|
removes elements satisfying specific criteria
(function template) |
|
|
(library fundamentals 2 TS)
|
erases all elements satisfying a predicate from a
std::deque
(function template) |