News for hackers. Stuff that matters.
Re:Outperforming LAPACK with C++ metaprogramming by npsimons on Monday January 29, 2018 @11:32AM (#16258437)
> With maximal inlining, there's a risk of constant propagation resulting in a lot of computation happening at compile time rather than run time.

Without even reading TFA, this was my first thought, remembering back to implementing Fibonnaci's sequence in template metaprogramming from "Thinking in C++, Volume 2": http://web.mit.edu/merolish/ticpp/TicV2.html#_Toc53985733

It's cool and useful to be sure, but as costrouc pointed out, LAPACK has been optimized for a very long time by some very smart people. Most people who have not studied the field for a bit are unlikely to come across a more optimal method.

There are no comments on this comment yet.