(C++17) | ||||
| Sequence | ||||
(C++11) | ||||
(C++26) | ||||
(C++26) | ||||
(C++11) | ||||
| Associative | ||||
| Unordered associative | ||||
(C++11) | ||||
(C++11) | ||||
(C++11) | ||||
(C++11) | ||||
| Adaptors | ||||
(C++23) | ||||
(C++23) | ||||
(C++23) | ||||
(C++23) | ||||
| Views | ||||
(C++20) | ||||
(C++23) | ||||
| Tables | ||||
| Iterator invalidation | ||||
| Member function table | ||||
| Non-member function table |
| Member types | |||||||||||||||||||||
| Member functions | |||||||||||||||||||||
| Non-member functions | |||||||||||||||||||||
|
| ||||||||||||||||||||
| Deduction guides(C++17) | |||||||||||||||||||||
| (1) | ||
iterator erase( iterator pos); | (until C++11) | |
iterator erase( const_iterator pos); | (since C++11) (constexpr since C++26) | |
| (2) | ||
iterator erase( iterator first, iterator last); | (until C++11) | |
iterator erase( const_iterator first, const_iterator last); | (since C++11) (constexpr since C++26) | |
Erases the specified elements from the container.
[first, last).All iterators and references are invalidated, unless the erased elements are at the end or at the beginning of the container, in which case only the iterators and references to the erased elements are invalidated. Theend() iterator is also invalidated unless the erased elements are at the beginning of the container and the last element is not erased.
The iteratorpos must be valid and dereferenceable. Thus theend() iterator (which is valid, but is not dereferenceable) cannot be used as a value forpos.
The iteratorfirst does not need to be dereferenceable iffirst== last: erasing an empty range is a no-op.
Contents |
| pos | - | iterator to the element to remove |
| first, last | - | the pair of iterators defining therange of elements to remove |
| Type requirements | ||
-IfT is notMoveAssignable, the behavior is undefined. | ||
Iterator following the last removed element.
[first, last) is an empty range, thenlast is returned.Does not throw unless an exception is thrown by the assignment operator ofT.
Linear: the number of calls to the destructor ofT is the same as the number of elements erased, the number of calls to the assignment operator ofT is no more than the lesser of the number of elements before the erased elements and the number of elements after the erased elements.
When container elements need to be erased based on a predicate, rather than iterating the container and calling unaryerase, the iterator range overload is generally used withstd::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)
#include <deque>#include <iostream> void print_container(conststd::deque<int>& c){for(int i: c)std::cout<< i<<' ';std::cout<<'\n';} int main(){std::deque<int> c{0,1,2,3,4,5,6,7,8,9}; print_container(c); c.erase(c.begin()); print_container(c); c.erase(c.begin()+2, c.begin()+5); print_container(c); // Erase all even numbersfor(std::deque<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 91 2 3 4 5 6 7 8 91 2 6 7 8 91 7 9
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, which made the behavior of clearing an empty deque undefined | not required if first== last |
| LWG 638 | C++98 | the past-the-end iterator was not invalidated | it is invalidated if the elements are erased from the middle or the end |
| erases all elements satisfying specific criteria (function template)[edit] | |
| clears the contents (public member function)[edit] |
