(1) | ||
iterator erase( iterator pos ); | (until C++11) | |
iterator erase( const_iterator pos ); | (since C++11) | |
(2) | ||
iterator erase( iterator first, iterator last ); | (until C++11) | |
iterator erase( const_iterator first, const_iterator last ); | (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.
pos | - | iterator to the element to remove |
first, last | - | range of elements to remove |
Iterator following the last removed element.
If pos
refers to the last element, then the end()
iterator is returned.
If last==end()
prior to removal, then the updated end()
iterator is returned.
If [first, last)
is an empty range, then last
is returned.
(none).
first
and last
.#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
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