std::vector::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)
.Invalidates iterators and references at or after the point of the erase, including the end() iterator.
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.
Contents |
[edit] Parameters
pos | - | iterator to the element to remove |
first, last | - | range of elements to remove |
Type requirements | ||
-
T must meet the requirements of MoveAssignable .
|
[edit] Return value
Iterator following the last removed element. If the iterator pos
refers to the last element, the end() iterator is returned.
[edit] Exceptions
Does not throw unless an exception is thrown by the copy constructor, move constructor, assignment operator, or move assignment operator of T
.
[edit] Complexity
1) Linear in distance between
pos
and the end of the container.
2) Linear in the distance between
first
and last
, plus linear in the distance between last
and end of the container.[edit] Example
Run this code
#include <vector> #include <iostream> int main( ) { std::vector<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'; c.erase(c.begin()+2, c.begin()+5); 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
[edit] See also
clears the contents (public member function) |