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

  • Home
  • SEARCH
  • 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 36923
In Process

The Archive Base Latest Questions

Editorial Team
  • 0
Editorial Team
Asked: May 10, 20262026-05-10T14:28:10+00:00 2026-05-10T14:28:10+00:00

I have a ‘foreach’ macro I use frequently in C++ that works for most

  • 0

I have a ‘foreach’ macro I use frequently in C++ that works for most STL containers:

#define foreach(var, container) \   for(typeof((container).begin()) var = (container).begin(); \       var != (container).end(); \       ++var) 

(Note that ‘typeof’ is a gcc extension.) It is used like this:

std::vector< Blorgus > blorgi = ...; foreach(blorgus, blorgi) {   blorgus->draw(); } 

I would like to make something similar that iterates over a map’s values. Call it ‘foreach_value’, perhaps. So instead of writing

foreach(pair, mymap) {   pair->second->foo(); } 

I would write

foreach_value(v, mymap) {   v.foo(); } 

I can’t come up with a macro that will do this, because it requires declaring two variables: the iterator and the value variable (‘v’, above). I don’t know how to do that in the initializer of a for loop, even using gcc extensions. I could declare it just before the foreach_value call, but then it will conflict with other instances of the foreach_value macro in the same scope. If I could suffix the current line number to the iterator variable name, it would work, but I don’t know how to do that.

  • 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. 2026-05-10T14:28:11+00:00Added an answer on May 10, 2026 at 2:28 pm

    You can do this using two loops. The first declares the iterator, with a name which is a function of the container variable (and you can make this uglier if you’re worried about conflicts with your own code). The second declares the value variable.

    #define ci(container) container ## iter #define foreach_value(var, container) \     for (typeof((container).begin()) ci(container) = container.begin(); \          ci(container) != container.end(); ) \         for (typeof(ci(container)->second)* var = &ci(container)->second; \              ci(container) != container.end(); \              (++ci(container) != container.end()) ? \                  (var = &ci(container)->second) : var) 

    By using the same loop termination condition, the outer loop only happens once (and if you’re lucky, gets optimized away). Also, you avoid calling ->second on the iterator if the map is empty. That’s the same reason for the ternary operator in the increment of the inner loop; at the end, we just leave var at the last value, since it won’t be referenced again.

    You could inline ci(container), but I think it makes the macro more readable.

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

Sidebar

Ask A Question

Stats

  • Questions 65k
  • Answers 65k
  • Best Answers 0
  • User 1
  • Popular
  • Answers
  • Editorial Team

    How to approach applying for a job at a company ...

    • 7 Answers
  • Editorial Team

    How to handle personal stress caused by utterly incompetent and ...

    • 5 Answers
  • Editorial Team

    What is a programmer’s life like?

    • 5 Answers
  • added an answer Good idea? No. Sometimes necessary? Yes. Living in a world… May 11, 2026 at 11:18 am
  • added an answer You told printf that you were suppling a c style… May 11, 2026 at 11:18 am
  • added an answer Remy Sharp's post is confusing if you don't read it… May 11, 2026 at 11:18 am

Related Questions

I have a web-service that I will be deploying to dev, staging and production.
I have a .Net desktop application with a TreeView as one of the UI
I have a Queue<T> object that I have initialised to a capacity of 2,
I have a complete XML document in a string and would like a Document
I have a regex that is going to end up being a bit long
I have a custom validation function in JavaScript in a user control on a
I have a (potentially dumb) question about the C++ STL. When I make a
I have a project that I'm currently working on but it currently only supports
I have a large tree of Java Objects in my Desktop Application and am
I have a table with more than a millon rows. This table is used

Trending Tags

analytics british company computer developers django employee employer english facebook french google interview javascript language life php programmer programs salary

Top Members

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.