C++11 - Lambda functions

C++11 standard introduces new type of functions for C++ programming - lambda functions.

Lambda function is a anonymous (unnamed) function which you can write directly inline in the code.

Lambda function allows do some operations visible like a function without declaring it as a function (saving space and time).

C++ lambda function has following syntax:
[capture](arguments){body}

capture - value which should be captured outside of body class
arguments - list of arguments of function (the same syntax as for normal C++ functions)
body - body of function - statements which should be exectued when function is invoked

For better understanding take a look fo below example: Output of this example is:

In point I we are initializing vector using C++11 initializer_list

Point II is key point of our example. It demonstrate using lambda function (3rd argument of for_each function) together with with for_each algorithm of STL library in order to calculate sum of vector elements. In C++03 we had to define separate function (outside of our main function) in order to use it within some STL algorithm (ex. for_each as in this example). Thanks to lambda functions we can define such us such function without declaration - in place. It is definitely easier especially if we are going to use some small function once in our code.

In point III we are printing results of our calculations.

As you can see, lambda functions are very comfortable when you are going to use some small function only once withing your code (ex. calculate some sum).

Code of this example you can find in our GitHub account here: https://github.com/xmementoit/CppAdventureExamples/tree/master/cpp11/lambdaFunctions

Comments

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.

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...

QT - foreach algoriithm with const references performance improvement

Today I would like to show you optimal way of using foreach QT algorithm . I will show you why we should pass elements of foreach algorithm by const reference instead of passing them by value. Let me explain it on the below example: Output of this example is: In point I we are creating 3 objects of MyClass class and push them to myClasses QList element. In point II we are using QT foreach algorithm to invoke getValue() method for each object from myClasses list. As you can see on output text for that part of code we are invoking copy constructor before and destructor after invoking getValue() function. It is because we are passing each myClasses list element to foreach algorithm by value. Therefore we are copying that element at the beginning of foreach loop step and removing them (destructing) at the end. This is inefficient solution, especially when class of object being copied is big. It decreases performance. of our application. Solution for that i...

Developer Adventure

Search This Blog