std::experimental::erase (std::list)
From cppreference.com
 
 
 < cpp | experimental 
 
 
 C++ 
 Feature test macros (C++20)
 Concepts library (C++20)
 Metaprogramming library (C++11)
 Ranges library (C++20)
 Filesystem library (C++17)
 Concurrency support library (C++11)
 Execution control library (C++26)
Experimental 
 Filesystem library (filesystem TS)
 Library fundamentals (library fundamentals TS)
 Library fundamentals 2 (library fundamentals TS v2)
 Library fundamentals 3 (library fundamentals TS v3)
 Extensions for parallelism (parallelism TS)
 Extensions for parallelism 2 (parallelism TS v2)
 Extensions for concurrency (concurrency TS)
 Extensions for concurrency 2 (concurrency TS v2)
 Concepts (concepts TS)
 Ranges (ranges TS)
 Reflection (reflection TS)
 Mathematical special functions (special functions TR)
 
 
 Merged into ISO C++ The functionality described on this page was merged into the mainline ISO C++ standard as of 11/2018, see std::erase (since C++20) 
Defined in header 
 
 
<experimental/list> 
 template< class T, class A, class U >
void erase( std::list <T, A>& c, const U& value );
 
 (library fundamentals TS v2) 
void erase( std::list <T, A>& c, const U& value );
Erases all elements that compare equal to value from the container. Equivalent to c.remove_if([&](auto& elem) { return elem == value; });.
Contents
[edit] Parameters
 c
 -
 container from which to erase
 value
 -
 value to be removed
[edit] Complexity
Linear.
[edit] Example
Run this code
Output:
11141112111 42
Notes
Unlike std::list::remove , this function template accepts heterogeneous types and does not force a conversion to the container's value type before invoking the == operator.
[edit] See also
 
 removes elements satisfying specific criteria 
(public member function of
(public member function of
std::list<T,Allocator>) [edit]