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

Blog's new layout

As you noticed this blog has new layout from today. I hope you like it. I think new layout looks better and more modern than previous one. Please, write you opinion about new layout in comments. If you have some ideas how to make this blog better, all ideas are welcomed. Enjoy new layout and blog articles.
3 comments
Read more

STL - count and count_if algorithms

One of the basic and most useful STL algorithms is algorithm which can be used to count number of elements within selected container according to specified criteria. In order to do that we can use std::count or std::count_if algorithm. std::count (firstElementIterator, lastElementIterator, elementForSearch) - is function which will go through container using firstElementIterator and lastElementIterator and return number of container elements which value is equal elementForSearch std::count_if (firstElementIterator, lastElementIterator, UnaryPredicateFunction) - is function which examine range from firstElementIterator to lastElementIterator and return number of container elements which fulfill UnaryPredicateFunction criteria. UnaryPredicateFunction is function having following signature: bool functionName(const Type& a) . So, count_if returns number of elements where UnaryPredicateFunction returns true for. For better understanding let's take a...
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