Minor technical detail added

[SVN r12499]
This commit is contained in:
Vesa Karvonen
2002-01-25 13:54:07 +00:00
parent 6d04d3068b
commit 0021c42186

View File

@ -17,6 +17,12 @@
// The time complexity of DELAY(N) is O(pow(2,N)).
//
// Handy when recompiles are too fast to take a coffee break. :)
//
// Template metaprogramming can be used for implementing similar
// delays. Unfortunately template instantiation consumes memory,
// therefore compilers usually fail to fully compile long template
// based delays, because they run out of memory. This macro takes
// only small (O(N)) amount of memory to preprocess.
#ifndef DELAY_MAX
#define DELAY_MAX 16