C++11 - Range-based for loops

Another interesting new feature of C++11 standard is range-based for loop.
This feature is simplification of usage of for loop going through each element of some container (ex. vector). For other programming languages we can use following syntax when we would like to iterate through all container elements:
Those constructions are very simple and rather self-understandable. However in C++ until now (C++03 standard) we had to use following syntax when we would like to go through each element of container:
Complicated, right? Especially for beginner user who is just starting learning of C++ and STL library. So, how to simplity it? C++11 helps us here :) It defines new syntax for dealing with 'for each' iteration called "range-based for loop". Instead of above vector iteration we can do something like this:
Definitely simpler, more understandable and easier to read, I think.
What is more when we do not know exact type of data in our container we can use auto type this way:
Range-based for loop should simplify iterating through container.

Comments

GDB Automatic Deadlock Detector

Have you ever had a problem with detection deadlock between threads in your C/C++ application? Would you like to do that automatically? Try this GDB Automatic Deadlock Detector from my github: GDB Automatic Deadlock Detector Picture source: http://csunplugged.org/wp-content/uploads/2015/03/deadlock.jpg1286488735

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

Advanced C++ - Stack unwinding

Stack unwinding is normally a concept of removing function entries from call stack (also known as Execution stack, Control stack, Function stack or Run-time stack). Call Stack is a stack data structure that stores active functions' addresses and helps in supporting function call/return mechanism. Every time when a function is called, an entry is made into Call stack which contains the return address of the calling function where the control needs to return after the execution of called function. This entry is called by various names like stack frame , activation frame or activation record. With respect to exception handling , stack Unwinding is a process of linearly searching function call stack to reach exception handler. When an exception occurs, if it is not handled in current function where it is thrown, the function Call Stack is unwound until the control reaches try block and then passes to catch block at the end of try block to handle exception. Also, in this proc

Developer Adventure

Search This Blog