I know that this is a long time after the original query, but this may still be useful. This can be done in GCC using the stringify operator “#”, but it requires two stages. #define XSTR(x) STR(x) #define STR(x) #x The value of a macro can then be displayed with: #pragma message “The value of … Read more
Disclaimer:You should probably wait in case a better answer appears even if you are satisfied with this answer, because I’m far from an expert and these may not be the best approaches. 1st approach: //two different sequences struct A { MY_MACRO1((int)(float)(double),(x)(y)(z)) }; I think this approach gives the less scary-looking macro: #define DECLARE_DATA_MEMBER1(R,TYPES,INDEX,NAME) \ BOOST_PP_SEQ_ELEM(INDEX,TYPES) … Read more
I tend to agree with the comment in utnapistim’s answer that you shouldn’t do this even though you can. But, in fact, you can, with standard-conformant C compilers. [Note 1] There are two issues to overcome. The first one is that you cannot use the ## operator to create something which is not a valid … Read more
Well macros don’t directly expand recursively, but there are ways we can work around this. The easiest way of doing recursion in the preprocessor is to use a deferred expression. A deferred expression is an expression that requires more scans to fully expand: #define EMPTY() #define DEFER(id) id EMPTY() #define OBSTRUCT(…) __VA_ARGS__ DEFER(EMPTY)() #define EXPAND(…) … Read more