On this page
std::list<T,Allocator>::erase
(1) | ||
|
(until C++11) | |
|
(since C++11) | |
(2) | ||
|
(until C++11) | |
|
(since C++11) |
Erases the specified elements from the container.
pos
.
[
first
,
last
)
.
References and iterators to the erased elements are invalidated. Other references and iterators are not affected.
The iterator pos
must be valid and dereferenceable. Thus the end()
iterator (which is valid, but is not dereferenceable) cannot be used as a value for pos
.
The iterator first
does not need to be dereferenceable if first == last
: erasing an empty range is a no-op.
Parameters
pos | - | iterator to the element to remove |
first, last | - | range of elements to remove |
Return value
Iterator following the last removed element.
[
first
,
last
)
is an empty range, then last
is returned.
Exceptions
(none)
Complexity
first
and last
.
Notes
When container elements need to be erased based on a predicate, rather than iterating the container and calling unary erase
, the iterator range overload is generally used with std::remove()/std::remove_if()
to minimise the number of moves of the remaining (non-removed) elements, this is the erase-remove idiom. std::erase_if()
replaces the erase-remove idiom.(since C++20)
Example
#include <list>
#include <iostream>
#include <iterator>
void print_container(const std::list<int>& c)
{
for (int i : c)
std::cout << i << ' ';
std::cout << '\n';
}
int main()
{
std::list<int> c{0, 1, 2, 3, 4, 5, 6, 7, 8, 9};
print_container(c);
c.erase(c.begin());
print_container(c);
std::list<int>::iterator range_begin = c.begin();
std::list<int>::iterator range_end = c.begin();
std::advance(range_begin, 2);
std::advance(range_end, 5);
c.erase(range_begin, range_end);
print_container(c);
// Erase all even numbers
for (std::list<int>::iterator it = c.begin(); it != c.end();)
{
if (*it % 2 == 0)
it = c.erase(it);
else
++it;
}
print_container(c);
}
Output:
0 1 2 3 4 5 6 7 8 9
1 2 3 4 5 6 7 8 9
1 2 6 7 8 9
1 7 9
Defect reports
The following behavior-changing defect reports were applied retroactively to previously published C++ standards.
DR | Applied to | Behavior as published | Correct behavior |
---|---|---|---|
LWG 151 | C++98 | first was required to be dereferenceable, whichmade the behavior of clearing an empty list undefined |
not required iffirst == last |
See also
(C++20)
|
erases all elements satisfying specific criteria (function template) |
clears the contents (public member function) |
© cppreference.com
Licensed under the Creative Commons Attribution-ShareAlike Unported License v3.0.
https://en.cppreference.com/w/cpp/container/list/erase