> Currently this is implemented as a bunch of relatively legible preprocessor
> code that allows the entire algorithm to appear in one definition. Every
> possible combination is compiled and the desired options selected at runtime.
If you trust your compiler to optimize tests of constant expressions,
you could use ordinary if-statements instead of preprocessor
statements and make the arguments template parameters. Then you could
define an array of function pointers and store all the combinations in
there. All that's missing is some kind of loop to get the combinations
automatically.
-- ------------------------------------------------------------------------------- Konrad Hinsen | E-Mail: hinsen@ibs.ibs.fr Laboratoire de Dynamique Moleculaire | Tel.: +33-4.76.88.99.28 Institut de Biologie Structurale | Fax: +33-4.76.88.54.94 41, av. des Martyrs | Deutsch/Esperanto/English/ 38027 Grenoble Cedex 1, France | Nederlands/Francais -------------------------------------------------------------------------------
This archive was generated by hypermail 2b29 : Wed Feb 20 2002 - 03:20:05 EST