Skip to main content

STL - iterators mechanism

Iterators are a generalization of pointers which allow a programmer to work with different data structures in the uniform manner. 

In STL we are using iterators to go through STL container for getting and setting values of its elements. In order to better understand working with iterators, take a look on below example:
Output of this example is:
In point I we are defining two vector containers using C++11 initializer lists.

Point II shows as definition of iterator which we will use to go through our vector structures to examine their elements. We are setting our iterator to first element of our myVector container. Because iterators are generalized pointers we can imagine this operation as setting up pointer to the first element of our structure. This operation can be illustrated like Step 1 on the picture below.
In C++11 we can simplify declaration of STL iterators using auto type as shown in point IIa.

In point III, IV and V we can see process of going through container elements using iterator mechanism. This process has been ilustrated on the picture below. We have while loop where we are checking whether we reached myVector.end() element or not. myVector.end() element is reached when our iterator points to address placed just after last container element (as shown in Step 10 of below picture).



In point IV we have example of getting value of element where our iterator points to. Point V illustrate using operator++() to move iterator to next element of container. Both those operations works similar way as normal pointer dereferencing and pointer arithmetic. Therefore we can see similarity of iterators to normal pointers.

Point VI depicts usage of iterator in for loop, where point VII shows how to assign value to element where iterator points to.

In terms of vector container from above example, using iterators is not the only way to get and set values of container elements. We can use random-access operator[] for it. It is because vector is allocated as continous part of memory. The same situation is for deque container. However other containers like: list, set, map does does not have random access to its elements. Therefore we cannot use operator[] go get its elements. We should use iterators when we are using such containers.

 Code of above examples can be found in GitHub repository of this blog here: STL iterators
Labels:

Comments

  1. Anonymous9 December 2013 at 12:50

    interesting explenation and example. Thanx!

    ReplyDelete

Post a Comment

Popular posts from this blog

Advanced C++ - Mutable Class Field

Today I would like to present C++ class' feature called mutable class field . Mutable class field is class' field modifier which allows to change its value even if object of the class is declared as const . Take a look at the example: Output of this example is: In point I of that example we are defining object of TestClass . Note that this object is const . As you can see in point Ia this class has three different member fields ( constInt, mutableConstInt, nonConstInt ). Those variables are public for this example, but do not worry about encapsulation here. It is just omitted for simplify this example. As you can see one of this member fields is marked as mutable class file using mutable keyword ( mutableConstInt ). Such variable can be modified even if object of class TestClass is const . It will be explained in next points of this example. In point II we are printing default values of testObject object initialized in initialization list of TestClass' default c...
Post a Comment
Read more

C++ Multithreading - Race conditions

In the previous C++ Multithreading article I presented you how to pass parameters between threads. Take a detail look on the output of that example once again: In the first line of that output you can notice that output text from two threads is mixed. You are probably wondering why it happens? It is because we are not protecting resources which are shared by two threads (in this example cout stream is shared in both threads) which causes multithreading's phenomenon called race condition . Because threads switching and accessing to shared resources are managed by operating system we do not know when std::cout stream will be accessed by main thread and when it will be accessed by second thread. Therefore in the previous article I mentioned that output of the example can be little different on your computer than my output example. What's more it is possible that this output will be different for few consecutive invoking of the example on the same machine. It is beca...
Post a Comment
Read more

C++14 - Tuple addressing via type

Today I would like to introduce one of new features which will arrive to C++ with new language standard (C++14) which is going to be release in 2014. In order to compile example from this article you need to have compiler supporting C++14 standard. The newest version of GCC supports it. I would like to introduce you features called Tuple addressing via type which allows us to get tuple element value using type name instead of tuple parameter number. Of course it is possible only for type names which are not ambiguous. Let's take a look on below example for better understanding: In point I we are declaring our tuple type containng of 2 int elements and on string element. In point II we are using std::get function to get values of our tuple typed variable using tuple parameters numbers. This feature is well known from C++11 standard. Point III shows new (introduced in C++14 standard) way of getting values of tuple elements. We are getting string type element using...
Post a Comment
Read more