
17 Aug
2010
17 Aug
'10
12:39 p.m.
Hi,
BTW, for this optimization it would be useful to assess the computational complexity (maybe in terms of "number of macro expansions"?) of the Boost.Preprocessor macros -- how can I do that?
The C++ plugin of Eclipse has a Macro-expander, that allows you to step through an expansion and gives you the number of replacements nedded. cheers Wolf Lammen -- GRATIS für alle GMX-Mitglieder: Die maxdome Movie-FLAT! Jetzt freischalten unter http://portal.gmx.net/de/go/maxdome01