From cbe5e0fa9f21cc241952c843fe7488999b5eac74 Mon Sep 17 00:00:00 2001 From: Vesa Karvonen Date: Sun, 16 Jun 2002 08:08:00 +0000 Subject: [PATCH] New O(N*N) space and O(1) time BOOST_PP_TUPLE_ELEM() [SVN r14150] --- example/delay.c | 3 ++- test/preprocessor_test.cpp | 1 + 2 files changed, 3 insertions(+), 1 deletion(-) diff --git a/example/delay.c b/example/delay.c index 23f2525..bb520ed 100644 --- a/example/delay.c +++ b/example/delay.c @@ -14,6 +14,7 @@ #include #include #include +#include /* The time complexity of DELAY(N) is O(pow(2,N)). * @@ -31,7 +32,7 @@ */ #ifndef DELAY_MAX -#define DELAY_MAX 16 +#define DELAY_MAX 15 #endif #define DELAY(N) BOOST_PP_TUPLE_ELEM(2,0,(BOOST_PP_EMPTY,BOOST_PP_WHILE(DELAY_C,BOOST_PP_CAT(DELAY_F,N),BOOST_PP_DEC(N))))() diff --git a/test/preprocessor_test.cpp b/test/preprocessor_test.cpp index a28690d..6931850 100644 --- a/test/preprocessor_test.cpp +++ b/test/preprocessor_test.cpp @@ -16,6 +16,7 @@ #include #include #include +#include #include