4 Apr
2012
4 Apr
'12
4:08 p.m.
on Tue Apr 03 2012, Sumant Tambe <sutambe-AT-gmail.com> wrote:
Some compile-time computations can be better (faster) implemented as recursive constexpr functions. I would like to see some performance comparisons between constexpr and vanilla metaprogramming.
Well, yes, that's the point. The question is, what kinds of computations should we try to perform in order to discover where to use the new techniques? Do we have libraries in Boost with slow-to-compile examples that would make good representative test cases? -- Dave Abrahams BoostPro Computing http://www.boostpro.com