The fastest sparse grid code ever.
In my strive for even faster code, I finally followed a vague idea I had: There are those template things in c++. So I began writing grid generation code and had a hard time with it. Mainly because I did not know the mighty typename keyword.
In the end I was successful:
Creating a grid with 1.5 mio points takes around 8.5 secs with the old code and around 2.5 secs with the new templated code. The only catch is, that you have to know the dimension at compile time, but if you do something like CFD, that’s not a problem.
Next stop: Calculating hierarchical surplus.