Home > Articles > Programming > C/C++

  • Print
  • + Share This
Like this article? We recommend

Discovering lambda Functions

Finally, I want to show you a third way to iterate through a container (it is actually the second way that doesn't require an outside function). Having a background in math, I find this example—unlike the previous one—nothing short of beautiful and elegant. However, to make this work, you have to make use of the Boost library. Specifically, this example makes use of the lambda library within Boost, using a concept called lambda function.

A lambda function is a function that doesn't get named. So how can you possibly call a function if it doesn't have a name? (That sounds like a joke involving The Artist Once Again Known As Prince, but I'm serious.) Here's how: You code it right in place, where it would get called.

Although you've seen this concept many, many times, you probably don't think of it as a lambda function. Imagine a for loop like this:

for (int i=0; i<10; i++) { 

The loop calls a function somefunc with each iteration. But suppose that somefunc isn't very big and it doesn't get called anywhere else. It might be just this, for example:

void somefunc(int i) {
  cout << i << endl;

Chances are you wouldn't create a separate function for this cout stuff. Instead, you're more likely to code it right inside the for loop, like so:

for (int i=0; i<10; i++) { 
  cout << i << endl;

Now for the mental leap: Think of the stuff inside the braces as itself the code for a function that the for loop calls. Think of the code as an unnamed, in-place function. And the technical name for this kind of function is a lambda function.

Unfortunately, the built-in loop constructs in C++ are pretty much the only places where you'll see this kind of thing built into the language. Wouldn't it be nice to do such a thing with the for_each algorithm? Not to sound too much like a salesman, but (thanks to the Boost library) now you can! Good credit, bad credit, this approach can be yours for no money at all!

Before I show you some code, however, I want to explain something that will make your life a whole lot easier when using the lambda library. Although I don't have room here to fully describe it (check out the Boost site for the full docs), I will show you a couple things that will help you understand its gotchas.

First, remember that C++ fully supports operator overloading, through which you can do some pretty crafty things that give the illusion that you are extending the language. A really good example here is the endl function that you use in lines such as cout << endl;. Did I just say "function"? Why yes, I did. If you dig through the header files, you'll see that endl is a function (or more likely, a template function), and that there exists an operator overload for << that recognizes the cout type on the left and the endl function prototype on the right. The operator then calls the function on the right, such as endl, which writes out a newline. Pretty ingenious.

But what does that have to do with anything? Well, for my second point, remember that to successfully get the compiler to call your operator function, you must get the types of parameters exactly right. If you don't, the compiler won't match up your code to the operator function, and you'll get a compilation error.

Now hold those thoughts because after I show you how to use the lambda library, I'll show you how to be sure that the lambda library actually gets called when you want it to, instead of your code triggering that secret but infamous portion down in the compiler's bowels called print_compiler_error_to_harass_programmer().

Before showing you how to iterate through a map, I'll first demonstrate a slightly simpler version that iterates through a vector. Hold on to your suspenders, though, because I can tell you the first time I saw this, I stepped back and stood in awe—momentarily forgetting all the evils that permeate the world. Okay, maybe it wasn't that big a deal, but it was pretty cool. Here goes:

void demoVector() {
  vector<int> myvector;
  // Iterate and print using 
  // algorithm and lambda approach
  for_each(myvector.begin(), myvector.end(), 
    cout << _1 << '\n'

First, make sure that you type _1 as a digit, not a letter: as underscore followed by 1. Now look carefully at the boldfaced line and notice that technically it's not an actual statement; rather, it's some bizarre thing being used as the third parameter to the for_each call. But it looks kind of like a statement, except that

  • it has no semicolon at the end (although there is one after the for_each call).
  • it has a strange _1 thingamabob in there.

This line of code runs for each item in the vector. The _1 is essentially a variable that takes on the value of the current item in the vector. Thus, with the first iteration, _1 contains 1. On the next iteration, it contains 2 and then 4 and then 8 and finally 16 (the numbers I pushed into the vector). Here's the output:


The lambda function, then, is the code that runs with each iteration:

cout << _1 << '\n'

But what is that thing, really? It's an expression containing operators that the compiler decodes; the code for these operators is in the lambda library. Here, the two operators are both <<. How does the compiler match this code up to the right operator code? The _1 is the key. And this is what I was getting at earlier: To trigger the correct operator, you have to have a correct type. Here, _1 is of a type from inside the lambda library, and that one little thing allows the compiler to match the first << operator up to the lambda library and, subsequently, the remaining << operators (in this case, there's only one more). Well, all righty then!

But what will happen if you take out the _1? Try it and see; change it to this:

cout << '\n'

When you do, you'll get some bizarre compiler errors. The compiler doesn't detect this as making use of the lambda library, and it dies immediately after choking and screaming at you a little to remind you whose fault it really is. (Sorry, as a former schoolteacher, that was insensitive; I shouldn't suggest my mistakes are actually my own. Let's blame it on the computer.)

And although this one manages to compile, it doesn't run correctly:

cout << "Hello " << _1 << '\n'

Thus, here's the basic rule for using the lambda library: As you write your lambda functions, you need to make sure that you have inserted into the function an operator or constant or function from the lambda library to trigger the correct operator. How do you know where to do it? The operators are evaluated from left to right, and each operator must have on its left or right side an item that will trigger the lambda operators. The result of the first operator is passed as the left operand to the second operator, and so on. That means if you get the very first operator to use the lambda library, you should be in good shape. If you don't use the _1 anywhere in that first operator, wrap your variables with a function call called var() or wrap your constants with constant(), like so:

for_each(myvector.begin(), myvector.end(), 
  cout << constant("Hello ") << "there\n"

This one works, even though it doesn't even use _1 anywhere. The function called constant triggers the lambda operators to kick in for that first << operator. After that, you're home free.

Well that's enough of the lambda library here; there's a whole world about it in the docs that goes way beyond what I've touched on here applied to iterators. In fact, the whole library contains what is essentially its own programming language, complete with its own looping constructs. Check it out; it's pretty cool.

  • + Share This
  • 🔖 Save To Your Account

InformIT Promotional Mailings & Special Offers

I would like to receive exclusive offers and hear about products from InformIT and its family of brands. I can unsubscribe at any time.


Pearson Education, Inc., 221 River Street, Hoboken, New Jersey 07030, (Pearson) presents this site to provide information about products and services that can be purchased through this site.

This privacy notice provides an overview of our commitment to privacy and describes how we collect, protect, use and share personal information collected through this site. Please note that other Pearson websites and online products and services have their own separate privacy policies.

Collection and Use of Information

To conduct business and deliver products and services, Pearson collects and uses personal information in several ways in connection with this site, including:

Questions and Inquiries

For inquiries and questions, we collect the inquiry or question, together with name, contact details (email address, phone number and mailing address) and any other additional information voluntarily submitted to us through a Contact Us form or an email. We use this information to address the inquiry and respond to the question.

Online Store

For orders and purchases placed through our online store on this site, we collect order details, name, institution name and address (if applicable), email address, phone number, shipping and billing addresses, credit/debit card information, shipping options and any instructions. We use this information to complete transactions, fulfill orders, communicate with individuals placing orders or visiting the online store, and for related purposes.


Pearson may offer opportunities to provide feedback or participate in surveys, including surveys evaluating Pearson products, services or sites. Participation is voluntary. Pearson collects information requested in the survey questions and uses the information to evaluate, support, maintain and improve products, services or sites, develop new products and services, conduct educational research and for other purposes specified in the survey.

Contests and Drawings

Occasionally, we may sponsor a contest or drawing. Participation is optional. Pearson collects name, contact information and other information specified on the entry form for the contest or drawing to conduct the contest or drawing. Pearson may collect additional personal information from the winners of a contest or drawing in order to award the prize and for tax reporting purposes, as required by law.


If you have elected to receive email newsletters or promotional mailings and special offers but want to unsubscribe, simply email information@informit.com.

Service Announcements

On rare occasions it is necessary to send out a strictly service related announcement. For instance, if our service is temporarily suspended for maintenance we might send users an email. Generally, users may not opt-out of these communications, though they can deactivate their account information. However, these communications are not promotional in nature.

Customer Service

We communicate with users on a regular basis to provide requested services and in regard to issues relating to their account we reply via email or phone in accordance with the users' wishes when a user submits their information through our Contact Us form.

Other Collection and Use of Information

Application and System Logs

Pearson automatically collects log data to help ensure the delivery, availability and security of this site. Log data may include technical information about how a user or visitor connected to this site, such as browser type, type of computer/device, operating system, internet service provider and IP address. We use this information for support purposes and to monitor the health of the site, identify problems, improve service, detect unauthorized access and fraudulent activity, prevent and respond to security incidents and appropriately scale computing resources.

Web Analytics

Pearson may use third party web trend analytical services, including Google Analytics, to collect visitor information, such as IP addresses, browser types, referring pages, pages visited and time spent on a particular site. While these analytical services collect and report information on an anonymous basis, they may use cookies to gather web trend information. The information gathered may enable Pearson (but not the third party web trend services) to link information with application and system log data. Pearson uses this information for system administration and to identify problems, improve service, detect unauthorized access and fraudulent activity, prevent and respond to security incidents, appropriately scale computing resources and otherwise support and deliver this site and its services.

Cookies and Related Technologies

This site uses cookies and similar technologies to personalize content, measure traffic patterns, control security, track use and access of information on this site, and provide interest-based messages and advertising. Users can manage and block the use of cookies through their browser. Disabling or blocking certain cookies may limit the functionality of this site.

Do Not Track

This site currently does not respond to Do Not Track signals.


Pearson uses appropriate physical, administrative and technical security measures to protect personal information from unauthorized access, use and disclosure.


This site is not directed to children under the age of 13.


Pearson may send or direct marketing communications to users, provided that

  • Pearson will not use personal information collected or processed as a K-12 school service provider for the purpose of directed or targeted advertising.
  • Such marketing is consistent with applicable law and Pearson's legal obligations.
  • Pearson will not knowingly direct or send marketing communications to an individual who has expressed a preference not to receive marketing.
  • Where required by applicable law, express or implied consent to marketing exists and has not been withdrawn.

Pearson may provide personal information to a third party service provider on a restricted basis to provide marketing solely on behalf of Pearson or an affiliate or customer for whom Pearson is a service provider. Marketing preferences may be changed at any time.

Correcting/Updating Personal Information

If a user's personally identifiable information changes (such as your postal address or email address), we provide a way to correct or update that user's personal data provided to us. This can be done on the Account page. If a user no longer desires our service and desires to delete his or her account, please contact us at customer-service@informit.com and we will process the deletion of a user's account.


Users can always make an informed choice as to whether they should proceed with certain services offered by InformIT. If you choose to remove yourself from our mailing list(s) simply visit the following page and uncheck any communication you no longer want to receive: www.informit.com/u.aspx.

Sale of Personal Information

Pearson does not rent or sell personal information in exchange for any payment of money.

While Pearson does not sell personal information, as defined in Nevada law, Nevada residents may email a request for no sale of their personal information to NevadaDesignatedRequest@pearson.com.

Supplemental Privacy Statement for California Residents

California residents should read our Supplemental privacy statement for California residents in conjunction with this Privacy Notice. The Supplemental privacy statement for California residents explains Pearson's commitment to comply with California law and applies to personal information of California residents collected in connection with this site and the Services.

Sharing and Disclosure

Pearson may disclose personal information, as follows:

  • As required by law.
  • With the consent of the individual (or their parent, if the individual is a minor)
  • In response to a subpoena, court order or legal process, to the extent permitted or required by law
  • To protect the security and safety of individuals, data, assets and systems, consistent with applicable law
  • In connection the sale, joint venture or other transfer of some or all of its company or assets, subject to the provisions of this Privacy Notice
  • To investigate or address actual or suspected fraud or other illegal activities
  • To exercise its legal rights, including enforcement of the Terms of Use for this site or another contract
  • To affiliated Pearson companies and other companies and organizations who perform work for Pearson and are obligated to protect the privacy of personal information consistent with this Privacy Notice
  • To a school, organization, company or government agency, where Pearson collects or processes the personal information in a school setting or on behalf of such organization, company or government agency.


This web site contains links to other sites. Please be aware that we are not responsible for the privacy practices of such other sites. We encourage our users to be aware when they leave our site and to read the privacy statements of each and every web site that collects Personal Information. This privacy statement applies solely to information collected by this web site.

Requests and Contact

Please contact us about this Privacy Notice or if you have any requests or questions relating to the privacy of your personal information.

Changes to this Privacy Notice

We may revise this Privacy Notice through an updated posting. We will identify the effective date of the revision in the posting. Often, updates are made to provide greater clarity or to comply with changes in regulatory requirements. If the updates involve material changes to the collection, protection, use or disclosure of Personal Information, Pearson will provide notice of the change through a conspicuous notice on this site or other appropriate way. Continued use of the site after the effective date of a posted revision evidences acceptance. Please contact us if you have questions or concerns about the Privacy Notice or any objection to any revisions.

Last Update: November 17, 2020