Given a Set, the task is to delete a range of values from this Set using Iterator.
Input: set = [10 20 30 40 50 60 70 80 90], start_iterator = 3, end_iterator = 8 Output: 10 20 80 90 Input: set = [1 2 3 4 5] start_iterator = 1, end_iterator = 3 Output: 3 4 5
Approach: In this method, a range of elements are deleted from the set. This is done with the help of two iterators. The first iterator points at the starting element of the range and the second iterator points at the last element of the range. The first iterator is exclusive while the last iterator is inclusive which means that element will also get deleted which is pointed by the last iterator.
iterator erase (const_iterator startPositionIterator_exclusive, const_iterator endingPositionIterator_inclusive);
Below is the implementation of the above approach:
Set originally: 10 20 30 40 50 60 70 80 90 Set after deletion of range from 3rd till 2nd last: 10 20 80 90
- How to delete a range of values from the List using Iterator
- <iterator> library in C++ STL
- Iterator Invalidation in C++
- Implementing Forward Iterator in BST
- C++ program to find the type of the given iterator
- Implementing Iterator pattern of a single Linked List
- "delete this" in C++
- delete() in C++
- How to delete last element from a map in C++
- delete and free() in C++
- How to delete last element from a set in C++
- How to delete last element from a List in C++ STL
- Overloading New and Delete operator in c++
- How to delete an element from the Set by passing its value in C++
- Delete elements in C++ STL list
If you like GeeksforGeeks and would like to contribute, you can also write an article using contribute.geeksforgeeks.org or mail your article to firstname.lastname@example.org. See your article appearing on the GeeksforGeeks main page and help other Geeks.
Please Improve this article if you find anything incorrect by clicking on the "Improve Article" button below.