Skip to content
Related Articles

Related Articles

Iterator Invalidation in C++

Improve Article
Save Article
  • Difficulty Level : Medium
  • Last Updated : 23 Dec, 2021
Improve Article
Save Article

When the container to which an Iterator points changes shape internally, i.e. when elements are moved from one position to another, and the initial iterator still points to the old invalid location, then it is called Iterator invalidation. One should be careful while using iterators in C++. When we iterate over our container using iterators then it may happen that the iterator gets invalidated. This may be due to change in the shape and size of the container while iterating. 

For example, Iterator invalidation in a vector whenever either, at any point in the vector, an element is inserted or an element from the vector is removed. Let us take an example to understand this,

CPP




// CPP program to demonstrate iterator
// invalidations
#include <bits/stdc++.h>
using namespace std;
 
// Driver Code
int main()
{
 
    // Creating a sample vector
    vector<int> v = { 1, 5, 10, 15, 20 };
 
    // Changing vector while iterating over it
    // (This causes iterator invalidation)
    for (auto it = v.begin(); it != v.end(); it++)
        if ((*it) == 5)
            v.push_back(-1);
 
    for (auto it = v.begin(); it != v.end(); it++)
        cout << (*it) << " ";
 
    return 0;
}

Output

1 5 10 15 20 -1 -1 

In the above example code, it may happen that when we add an element -1 while iterating the vector, the size of the vector can get more than the maximum size due to which a new memory is allocated to the vector and all elements are copied there. But, our iterator still points to the previous old memory address. So, now we can say that iterator gets invalidated. This is one example of invalidation. Given below are some rules for iterator invalidation.

Iterator Invalidation Rules:

1. Insertion

 VectorAll iterators which point to an element before the point of insertion are unaffected but all others are invalidated. But, in case if due to insertion the size of the vector becomes more than the previous capacity then all iterators get invalidated as discussed in the above example. 
DequeAll iterators and references are invalidated unless the inserted member is at an end (front or back) of the deque (in which case all iterators are invalidated, but references to elements are unaffected). 
ListAll iterators and references unaffected. 
set, map, multiset, multimapAll iterators and references are unaffected.

2. Erasure 

Vector Every iterator and reference after the point of erasing is invalidated. 
DequeAll iterators and references are invalidated unless the erased members are at an end (front or back) of the deque (in which case only iterators and references to the erased members are invalidated) 
List Only the iterators and references to the erased element is invalidated. 
Set, map, multiset, multimap Only iterators and references to the erased elements are invalidated.

3. Resizing 

Vector, Deque, and List As per insert/erase.

Note: Invalidation of iterator does not always mean that dereferencing such an iterator causes a program to crash. It also includes the possibility that iterator does not point to an element which it is supposed to point.

This article is contributed by Ashish Sharma. If you like GeeksforGeeks and would like to contribute, you can also write an article using write.geeksforgeeks.org or mail your article to review-team@geeksforgeeks.org. See your article appearing on the GeeksforGeeks main page and help other Geeks. Please write comments if you find anything incorrect, or you want to share more information about the topic discussed above. 


My Personal Notes arrow_drop_up
Related Articles

Start Your Coding Journey Now!