Skip to main content

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

Popular posts from this blog

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

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

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