Sign Up

Sign Up to our social questions and Answers Engine to ask questions, answer people’s questions, and connect with other people.

Have an account? Sign In

Have an account? Sign In Now

Sign In

Login to our social questions & Answers Engine to ask questions answer people’s questions & connect with other people.

Sign Up Here

Forgot Password?

Don't have account, Sign Up Here

Forgot Password

Lost your password? Please enter your email address. You will receive a link and will create a new password via email.

Have an account? Sign In Now

You must login to ask a question.

Forgot Password?

Need An Account, Sign Up Here

Please briefly explain why you feel this question should be reported.

Please briefly explain why you feel this answer should be reported.

Please briefly explain why you feel this user should be reported.

Sign InSign Up

The Archive Base

The Archive Base Logo The Archive Base Logo

The Archive Base Navigation

  • SEARCH
  • Home
  • About Us
  • Blog
  • Contact Us
Search
Ask A Question

Mobile menu

Close
Ask a Question
  • Home
  • Add group
  • Groups page
  • Feed
  • User Profile
  • Communities
  • Questions
    • New Questions
    • Trending Questions
    • Must read Questions
    • Hot Questions
  • Polls
  • Tags
  • Badges
  • Buy Points
  • Users
  • Help
  • Buy Theme
  • SEARCH
Home/ Questions/Q 6657103
In Process

The Archive Base Latest Questions

Editorial Team
  • 0
Editorial Team
Asked: May 26, 20262026-05-26T01:43:34+00:00 2026-05-26T01:43:34+00:00

The classical example using STL algorithms: void foo(int){}; vector<int> collection; collection.push_back(3); collection.push_back(4); … etc.

  • 0

The classical example using STL algorithms:

void foo(int){};
vector<int> collection;
collection.push_back(3);
collection.push_back(4);
... etc.

std::for_each(collection.begin(), collection.end(), bind(foo, _1));

But what if we have more then one function, which needs to be called with the same argument values:

void bar(int){};
void beer(int){};
... etc.

Repeating for_each algorithm every time with different functions is not option. I need more elegant solution.

  • 1 1 Answer
  • 0 Views
  • 0 Followers
  • 0
Share
  • Facebook
  • Report

Leave an answer
Cancel reply

You must login to add an answer.

Forgot Password?

Need An Account, Sign Up Here

1 Answer

  • Voted
  • Oldest
  • Recent
  • Random
  1. Editorial Team
    Editorial Team
    2026-05-26T01:43:34+00:00Added an answer on May 26, 2026 at 1:43 am

    Since you tagged the question with C++11, then you can use lambda as:

    std::for_each(collection.begin(), collection.end(), [](int a)
    {
       bar(a);    
       beer(a);
    });
    

    I recall that C++11 has std::begin and std::end as free functions, which should be preferred over the member functions:

    std::for_each(std::begin(collection), std::end(collection), [](int a)
    {
       bar(a);    
       beer(a);
    });
    

    The rationale why the free functions should be preferred is because now if, for example, you change the type of the collection to simple array (say, int collection[100]), then the above code would work just fine without changing a single character. With the new Standard C++, the free functions are going to be used more uniformly than the member functions.

    Or, you can use range-based for loop as:

    for(int a : collection)
    {
       bar(a);    
       beer(a);
    }
    

    Ah! It looks even better. Neat and clean, with no begin and end at all.

    • 0
    • Reply
    • Share
      Share
      • Share on Facebook
      • Share on Twitter
      • Share on LinkedIn
      • Share on WhatsApp
      • Report

Sidebar

Related Questions

What options are there in ASP Classic for error handling? For example: I'm using
how to read P implies Q in classical logic? example : Distributivity: Ka(X->Y) ->
Is there any built-in functionality for classical set operations on the java.util.Collection class? My
In a classical example of asp.net/mvc authentication LogOn action gets LogOnViewModel and returnUrl string
I analyzed the sunspots.dat data (below) using fft which is a classic example in
The classical RLE algorithm compresses data by using numbers to represent how many times
I'm mostly speaking about Java and classical OOP. Say I'm using DAO pattern. So
This is a classic Boost message_queue example: #include <boost/interprocess/ipc/message_queue.hpp> using namespace boost::interprocess; struct Data
Poppler is a classic example of something without documentation that you would prefer be
Consider this classic example used to explain what not to do with forward declarations:

Explore

  • Home
  • Add group
  • Groups page
  • Communities
  • Questions
    • New Questions
    • Trending Questions
    • Must read Questions
    • Hot Questions
  • Polls
  • Tags
  • Badges
  • Users
  • Help
  • SEARCH

Footer

© 2021 The Archive Base. All Rights Reserved
With Love by The Archive Base

Insert/edit link

Enter the destination URL

Or link to existing content

    No search term specified. Showing recent items. Search or use up and down arrow keys to select an item.