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

Preprocessor library is now C friendly.

Browse Source 
[SVN r12552]
This commit is contained in:
Vesa Karvonen
2002-01-29 14:13:10 +00:00
parent 972f6222d1
commit df1244ba20
137 changed files with 1671 additions and 1272 deletions
Download Patch File Download Diff File Expand all files Collapse all files

48
example/delay.cpp
View File

@ -1,32 +1,34 @@
// Copyright (C) 2002
// Housemarque Oy
// http://www.housemarque.com
//
// Permission to copy, use, modify, sell and distribute this software is
// granted provided this copyright notice appears in all copies. This
// software is provided "as is" without express or implied warranty, and
// with no claim as to its suitability for any purpose.
// See http://www.boost.org for most recent version.
/* Copyright (C) 2002
* Housemarque Oy
* http://www.housemarque.com
*
* Permission to copy, use, modify, sell and distribute this software is
* granted provided this copyright notice appears in all copies. This
* software is provided "as is" without express or implied warranty, and
* with no claim as to its suitability for any purpose.
*
* See http://www.boost.org for most recent version.
*/
#include <boost/preprocessor/while.hpp>
#include <boost/preprocessor/dec.hpp>
#include <boost/preprocessor/cat.hpp>
#include <boost/preprocessor/empty.hpp>
// 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.
//
// On many compilers (e.g. g++, MSVC++), this macro takes only a
// small amount of memory to preprocess. On some compilers (e.g.
// MWCW), however, this macro seems to consume huge amounts of
// memory.
/* 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.
*
* On many compilers (e.g. g++, MSVC++), this macro takes only a
* small amount of memory to preprocess. On some compilers (e.g.
* MWCW), however, this macro seems to consume huge amounts of
* memory.
*/
#ifndef DELAY_MAX
#define DELAY_MAX 16