boostorg/preprocessor
1
0
Fork 1
mirror of https://github.com/boostorg/preprocessor.git synced 2025-07-13 12:36:45 +02:00
Code Issues Packages Projects Releases Wiki Activity

Refactored the test not to use an O(N*N) operation. Repetition count remains the same.

Browse Source 
[SVN r12374]
This commit is contained in:
Vesa Karvonen
2002-01-20 17:46:01 +00:00
parent fbea3f4f9f
commit 2e11cfcd42
1 changed files with 4 additions and 5 deletions
Download Patch File Download Diff File Expand all files Collapse all files

9
test/for_test.cpp
View File

@ -10,8 +10,7 @@
// See http://www.boost.org for most recent version.
#include <boost/preprocessor/for.hpp>
#include <boost/preprocessor/comparison/less_equal.hpp>
#include <boost/preprocessor/inc.hpp>
#include <boost/preprocessor/dec.hpp>
#include <libs/preprocessor/test/test.hpp>
@ -21,8 +20,8 @@
#define FOR_TEST_MAX 50
#endif
#define C(D,X) BOOST_PP_LESS_EQUAL(X,FOR_TEST_MAX)
#define F(D,X) BOOST_PP_INC(X)
#define C(D,X) X
#define F(D,X) BOOST_PP_DEC(X)
#define I(D,X) -X
TEST((FOR_TEST_MAX*(FOR_TEST_MAX+1)/2)+1 BOOST_PP_FOR(0,C,F,I))
TEST((FOR_TEST_MAX*(FOR_TEST_MAX+1)/2)+1 BOOST_PP_FOR(FOR_TEST_MAX,C,F,I))