void remove( const T& value ); | (since C++11) | |
template< class UnaryPredicate > void remove_if( UnaryPredicate p ); | (since C++11) |
Removes all elements satisfying specific criteria. The first version removes all elements that are equal to value
, the second version removes all elements for which predicate p
returns true
.
value | - | value of the elements to remove |
p | - | unary predicate which returns true if the element should be removed. The signature of the predicate function should be equivalent to the following:
The signature does not need to have |
(none).
Linear in the size of the container.
#include <forward_list> #include <iostream> int main() { std::forward_list<int> l = { 1,100,2,3,10,1,11,-1,12 }; l.remove(1); // remove both elements equal to 1 l.remove_if([](int n){ return n > 10; }); // remove all elements greater than 10 for (int n : l) { std::cout << n << ' '; } std::cout << '\n'; }
Output:
2 3 10 -1
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/forward_list/remove