std::list::erase
From cppreference.com
(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) | |
Removes specified elements from the container.
1) Removes the element at
pos
.2) Removes the elements in the range
[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 dereferencable) 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. If the iterator pos
refers to the last element, the end() iterator is returned.
Exceptions
(none)
Complexity
1) Constant.
2) Linear in the distance between
first
and last
.Example
Run this code
#include <list> #include <iostream> #include <iterator> int main( ) { std::list<int> c{0, 1, 2, 3, 4, 5, 6, 7, 8, 9}; for (auto &i : c) { std::cout << i << " "; } std::cout << '\n'; c.erase(c.begin()); for (auto &i : c) { std::cout << i << " "; } std::cout << '\n'; 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); for (auto &i : c) { std::cout << i << " "; } std::cout << '\n'; }
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
See also
clears the contents (public member function) |