script_core 0.2.1 → 0.2.6

data/ext/enterprise_script_service/msgpack/external/boost/preprocessor/doc/examples/catch_builtin.cpp

@@ -1,51 +0,0 @@
-# /* Copyright (C) 2002
-#  * Housemarque Oy
-#  * http://www.housemarque.com
-#  *
-#  * Distributed under the Boost Software License, Version 1.0. (See
-#  * accompanying file LICENSE_1_0.txt or copy at
-#  * http://www.boost.org/LICENSE_1_0.txt)
-#  */
-#
-# /* Revised by Paul Mensonides (2002) */
-#
-# /* See http://www.boost.org for most recent version. */
-#
-# /* This example demonstrates the usage of lists and BOOST_PP_LIST_FOR_EACH(). */
-#
-# include <iostream>
-# include <typeinfo>
-#
-# include <boost/preprocessor/list/for_each.hpp>
-# include <boost/preprocessor/tuple/to_list.hpp>
-#
-# /* List of built-in types.  (Strictly speaking wchar_t should be on the list.) */
-#
-# define BUILTIN_TYPES \
-   BOOST_PP_TUPLE_TO_LIST( \
-      13, \
-      ( \
-         bool, \
-         char, signed char, unsigned char, \
-         unsigned short, short, \
-         int, unsigned, \
-         long, unsigned long, \
-         float, \
-         double, long double \
-      ) \
-   ) \
-   /**/
-#
-# define CATCH(R, _, T) \
-   catch (T t) { \
-      std::cerr << "Caught an " << typeid(t).name() << " = " << t; \
-   } \
-   /**/
-
-int main() {
-   try {
-      throw 10;
-   }
-   BOOST_PP_LIST_FOR_EACH(CATCH, _, BUILTIN_TYPES)
-   return 0;
-}

data/ext/enterprise_script_service/msgpack/external/boost/preprocessor/doc/examples/delay.c

@@ -1,95 +0,0 @@
-# /* Copyright (C) 2002
-#  * Housemarque Oy
-#  * http://www.housemarque.com
-#  *
-#  * Distributed under the Boost Software License, Version 1.0. (See
-#  * accompanying file LICENSE_1_0.txt or copy at
-#  * http://www.boost.org/LICENSE_1_0.txt)
-#  */
-#
-# /* Revised by Paul Mensonides (2002) */
-#
-# /* See http://www.boost.org for most recent version. */
-#
-# /* The time complexity of DELAY(N) is O(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.
-#  */
-#
-# include <boost/preprocessor/arithmetic/dec.hpp>
-# include <boost/preprocessor/cat.hpp>
-# include <boost/preprocessor/control/while.hpp>
-# include <boost/preprocessor/facilities/empty.hpp>
-# include <boost/preprocessor/tuple/elem.hpp>
-#
-# ifndef DELAY_MAX
-# define DELAY_MAX 14
-# 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))))()
-#
-# define DELAY_C(D, N) N
-#
-# define DELAY_F0(D, N) BOOST_PP_IF(1, BOOST_PP_DEC(N), BOOST_PP_WHILE_ ## D(DELAY_C, DELAY_F ## N, BOOST_PP_DEC(N)))
-# define DELAY_F1(D, N) BOOST_PP_IF(1, BOOST_PP_DEC(N), BOOST_PP_WHILE_ ## D(DELAY_C, DELAY_F ## N, BOOST_PP_DEC(N)))
-# define DELAY_F2(D, N) BOOST_PP_IF(1, BOOST_PP_DEC(N), BOOST_PP_WHILE_ ## D(DELAY_C, DELAY_F ## N, BOOST_PP_DEC(N)))
-# define DELAY_F3(D, N) BOOST_PP_IF(1, BOOST_PP_DEC(N), BOOST_PP_WHILE_ ## D(DELAY_C, DELAY_F ## N, BOOST_PP_DEC(N)))
-# define DELAY_F4(D, N) BOOST_PP_IF(1, BOOST_PP_DEC(N), BOOST_PP_WHILE_ ## D(DELAY_C, DELAY_F ## N, BOOST_PP_DEC(N)))
-# define DELAY_F5(D, N) BOOST_PP_IF(1, BOOST_PP_DEC(N), BOOST_PP_WHILE_ ## D(DELAY_C, DELAY_F ## N, BOOST_PP_DEC(N)))
-# define DELAY_F6(D, N) BOOST_PP_IF(1, BOOST_PP_DEC(N), BOOST_PP_WHILE_ ## D(DELAY_C, DELAY_F ## N, BOOST_PP_DEC(N)))
-# define DELAY_F7(D, N) BOOST_PP_IF(1, BOOST_PP_DEC(N), BOOST_PP_WHILE_ ## D(DELAY_C, DELAY_F ## N, BOOST_PP_DEC(N)))
-# define DELAY_F8(D, N) BOOST_PP_IF(1, BOOST_PP_DEC(N), BOOST_PP_WHILE_ ## D(DELAY_C, DELAY_F ## N, BOOST_PP_DEC(N)))
-# define DELAY_F9(D, N) BOOST_PP_IF(1, BOOST_PP_DEC(N), BOOST_PP_WHILE_ ## D(DELAY_C, DELAY_F ## N, BOOST_PP_DEC(N)))
-# define DELAY_F10(D, N) BOOST_PP_IF(1, BOOST_PP_DEC(N), BOOST_PP_WHILE_ ## D(DELAY_C, DELAY_F ## N, BOOST_PP_DEC(N)))
-# define DELAY_F11(D, N) BOOST_PP_IF(1, BOOST_PP_DEC(N), BOOST_PP_WHILE_ ## D(DELAY_C, DELAY_F ## N, BOOST_PP_DEC(N)))
-# define DELAY_F12(D, N) BOOST_PP_IF(1, BOOST_PP_DEC(N), BOOST_PP_WHILE_ ## D(DELAY_C, DELAY_F ## N, BOOST_PP_DEC(N)))
-# define DELAY_F13(D, N) BOOST_PP_IF(1, BOOST_PP_DEC(N), BOOST_PP_WHILE_ ## D(DELAY_C, DELAY_F ## N, BOOST_PP_DEC(N)))
-# define DELAY_F14(D, N) BOOST_PP_IF(1, BOOST_PP_DEC(N), BOOST_PP_WHILE_ ## D(DELAY_C, DELAY_F ## N, BOOST_PP_DEC(N)))
-# define DELAY_F15(D, N) BOOST_PP_IF(1, BOOST_PP_DEC(N), BOOST_PP_WHILE_ ## D(DELAY_C, DELAY_F ## N, BOOST_PP_DEC(N)))
-# define DELAY_F16(D, N) BOOST_PP_IF(1, BOOST_PP_DEC(N), BOOST_PP_WHILE_ ## D(DELAY_C, DELAY_F ## N, BOOST_PP_DEC(N)))
-# define DELAY_F17(D, N) BOOST_PP_IF(1, BOOST_PP_DEC(N), BOOST_PP_WHILE_ ## D(DELAY_C, DELAY_F ## N, BOOST_PP_DEC(N)))
-# define DELAY_F18(D, N) BOOST_PP_IF(1, BOOST_PP_DEC(N), BOOST_PP_WHILE_ ## D(DELAY_C, DELAY_F ## N, BOOST_PP_DEC(N)))
-# define DELAY_F19(D, N) BOOST_PP_IF(1, BOOST_PP_DEC(N), BOOST_PP_WHILE_ ## D(DELAY_C, DELAY_F ## N, BOOST_PP_DEC(N)))
-# define DELAY_F20(D, N) BOOST_PP_IF(1, BOOST_PP_DEC(N), BOOST_PP_WHILE_ ## D(DELAY_C, DELAY_F ## N, BOOST_PP_DEC(N)))
-# define DELAY_F21(D, N) BOOST_PP_IF(1, BOOST_PP_DEC(N), BOOST_PP_WHILE_ ## D(DELAY_C, DELAY_F ## N, BOOST_PP_DEC(N)))
-# define DELAY_F22(D, N) BOOST_PP_IF(1, BOOST_PP_DEC(N), BOOST_PP_WHILE_ ## D(DELAY_C, DELAY_F ## N, BOOST_PP_DEC(N)))
-# define DELAY_F23(D, N) BOOST_PP_IF(1, BOOST_PP_DEC(N), BOOST_PP_WHILE_ ## D(DELAY_C, DELAY_F ## N, BOOST_PP_DEC(N)))
-# define DELAY_F24(D, N) BOOST_PP_IF(1, BOOST_PP_DEC(N), BOOST_PP_WHILE_ ## D(DELAY_C, DELAY_F ## N, BOOST_PP_DEC(N)))
-# define DELAY_F25(D, N) BOOST_PP_IF(1, BOOST_PP_DEC(N), BOOST_PP_WHILE_ ## D(DELAY_C, DELAY_F ## N, BOOST_PP_DEC(N)))
-# define DELAY_F26(D, N) BOOST_PP_IF(1, BOOST_PP_DEC(N), BOOST_PP_WHILE_ ## D(DELAY_C, DELAY_F ## N, BOOST_PP_DEC(N)))
-# define DELAY_F27(D, N) BOOST_PP_IF(1, BOOST_PP_DEC(N), BOOST_PP_WHILE_ ## D(DELAY_C, DELAY_F ## N, BOOST_PP_DEC(N)))
-# define DELAY_F28(D, N) BOOST_PP_IF(1, BOOST_PP_DEC(N), BOOST_PP_WHILE_ ## D(DELAY_C, DELAY_F ## N, BOOST_PP_DEC(N)))
-# define DELAY_F29(D, N) BOOST_PP_IF(1, BOOST_PP_DEC(N), BOOST_PP_WHILE_ ## D(DELAY_C, DELAY_F ## N, BOOST_PP_DEC(N)))
-# define DELAY_F30(D, N) BOOST_PP_IF(1, BOOST_PP_DEC(N), BOOST_PP_WHILE_ ## D(DELAY_C, DELAY_F ## N, BOOST_PP_DEC(N)))
-# define DELAY_F31(D, N) BOOST_PP_IF(1, BOOST_PP_DEC(N), BOOST_PP_WHILE_ ## D(DELAY_C, DELAY_F ## N, BOOST_PP_DEC(N)))
-# define DELAY_F32(D, N) BOOST_PP_IF(1, BOOST_PP_DEC(N), BOOST_PP_WHILE_ ## D(DELAY_C, DELAY_F ## N, BOOST_PP_DEC(N)))
-# define DELAY_F33(D, N) BOOST_PP_IF(1, BOOST_PP_DEC(N), BOOST_PP_WHILE_ ## D(DELAY_C, DELAY_F ## N, BOOST_PP_DEC(N)))
-# define DELAY_F34(D, N) BOOST_PP_IF(1, BOOST_PP_DEC(N), BOOST_PP_WHILE_ ## D(DELAY_C, DELAY_F ## N, BOOST_PP_DEC(N)))
-# define DELAY_F35(D, N) BOOST_PP_IF(1, BOOST_PP_DEC(N), BOOST_PP_WHILE_ ## D(DELAY_C, DELAY_F ## N, BOOST_PP_DEC(N)))
-# define DELAY_F36(D, N) BOOST_PP_IF(1, BOOST_PP_DEC(N), BOOST_PP_WHILE_ ## D(DELAY_C, DELAY_F ## N, BOOST_PP_DEC(N)))
-# define DELAY_F37(D, N) BOOST_PP_IF(1, BOOST_PP_DEC(N), BOOST_PP_WHILE_ ## D(DELAY_C, DELAY_F ## N, BOOST_PP_DEC(N)))
-# define DELAY_F38(D, N) BOOST_PP_IF(1, BOOST_PP_DEC(N), BOOST_PP_WHILE_ ## D(DELAY_C, DELAY_F ## N, BOOST_PP_DEC(N)))
-# define DELAY_F39(D, N) BOOST_PP_IF(1, BOOST_PP_DEC(N), BOOST_PP_WHILE_ ## D(DELAY_C, DELAY_F ## N, BOOST_PP_DEC(N)))
-# define DELAY_F40(D, N) BOOST_PP_IF(1, BOOST_PP_DEC(N), BOOST_PP_WHILE_ ## D(DELAY_C, DELAY_F ## N, BOOST_PP_DEC(N)))
-# define DELAY_F41(D, N) BOOST_PP_IF(1, BOOST_PP_DEC(N), BOOST_PP_WHILE_ ## D(DELAY_C, DELAY_F ## N, BOOST_PP_DEC(N)))
-# define DELAY_F42(D, N) BOOST_PP_IF(1, BOOST_PP_DEC(N), BOOST_PP_WHILE_ ## D(DELAY_C, DELAY_F ## N, BOOST_PP_DEC(N)))
-# define DELAY_F43(D, N) BOOST_PP_IF(1, BOOST_PP_DEC(N), BOOST_PP_WHILE_ ## D(DELAY_C, DELAY_F ## N, BOOST_PP_DEC(N)))
-# define DELAY_F44(D, N) BOOST_PP_IF(1, BOOST_PP_DEC(N), BOOST_PP_WHILE_ ## D(DELAY_C, DELAY_F ## N, BOOST_PP_DEC(N)))
-# define DELAY_F45(D, N) BOOST_PP_IF(1, BOOST_PP_DEC(N), BOOST_PP_WHILE_ ## D(DELAY_C, DELAY_F ## N, BOOST_PP_DEC(N)))
-# define DELAY_F46(D, N) BOOST_PP_IF(1, BOOST_PP_DEC(N), BOOST_PP_WHILE_ ## D(DELAY_C, DELAY_F ## N, BOOST_PP_DEC(N)))
-# define DELAY_F47(D, N) BOOST_PP_IF(1, BOOST_PP_DEC(N), BOOST_PP_WHILE_ ## D(DELAY_C, DELAY_F ## N, BOOST_PP_DEC(N)))
-# define DELAY_F48(D, N) BOOST_PP_IF(1, BOOST_PP_DEC(N), BOOST_PP_WHILE_ ## D(DELAY_C, DELAY_F ## N, BOOST_PP_DEC(N)))
-# define DELAY_F49(D, N) BOOST_PP_IF(1, BOOST_PP_DEC(N), BOOST_PP_WHILE_ ## D(DELAY_C, DELAY_F ## N, BOOST_PP_DEC(N)))
-# define DELAY_F50(D, N) BOOST_PP_IF(1, BOOST_PP_DEC(N), BOOST_PP_WHILE_ ## D(DELAY_C, DELAY_F ## N, BOOST_PP_DEC(N)))
-
-DELAY(DELAY_MAX)

data/ext/enterprise_script_service/msgpack/external/boost/preprocessor/doc/examples/duffs_device.c

@@ -1,61 +0,0 @@
-# /* Copyright (C) 2002
-#  * Housemarque Oy
-#  * http://www.housemarque.com
-#  *
-#  * Distributed under the Boost Software License, Version 1.0. (See
-#  * accompanying file LICENSE_1_0.txt or copy at
-#  * http://www.boost.org/LICENSE_1_0.txt)
-#  */
-#
-# /* Revised by Paul Mensonides (2002) */
-#
-# /* See http://www.boost.org for most recent version. */
-#
-# /* This example uses the preprocessor library to implement a generalized
-#  * macro for implementing Duff's Device.
-#  *
-#  * This example was inspired by an original generalized macro for
-#  * for implementing Duff's Device written by Joerg Walter.
-#  */
-#
-# include <assert.h>
-#
-# include <boost/preprocessor/repetition/repeat.hpp>
-# include <boost/preprocessor/tuple/elem.hpp>
-#
-# /* Expands to a Duff's Device. */
-# define DUFFS_DEVICE(UNROLLING_FACTOR, COUNTER_TYPE, N, STATEMENT) \
-   do { \
-      COUNTER_TYPE duffs_device_initial_cnt = (N); \
-      if (duffs_device_initial_cnt > 0) { \
-         COUNTER_TYPE duffs_device_running_cnt = (duffs_device_initial_cnt + (UNROLLING_FACTOR - 1)) / UNROLLING_FACTOR; \
-         switch (duffs_device_initial_cnt % UNROLLING_FACTOR) { \
-            do { \
-               BOOST_PP_REPEAT(UNROLLING_FACTOR, DUFFS_DEVICE_C, (UNROLLING_FACTOR, { STATEMENT })) \
-            } while (--duffs_device_running_cnt); \
-         } \
-      } \
-   } while (0) \
-   /**/
-#
-# define DUFFS_DEVICE_C(Z, I, UNROLLING_FACTOR_STATEMENT) \
-   case (I ? BOOST_PP_TUPLE_ELEM(2, 0, UNROLLING_FACTOR_STATEMENT) - I : 0): \
-      BOOST_PP_TUPLE_ELEM(2, 1, UNROLLING_FACTOR_STATEMENT); \
-   /**/
-#
-# ifndef UNROLLING_FACTOR
-# define UNROLLING_FACTOR 16
-# endif
-#
-# ifndef N
-# define N 1000
-# endif
-
-int main(void) {
-   int i = 0;
-   DUFFS_DEVICE(UNROLLING_FACTOR, int, 0, ++i;);
-   assert(i == 0);
-   DUFFS_DEVICE(UNROLLING_FACTOR, int, N, ++i;);
-   assert(i == N);
-   return 0;
-}

data/ext/enterprise_script_service/msgpack/external/boost/preprocessor/doc/examples/is_integral.cpp

@@ -1,49 +0,0 @@
-# /* Copyright (C) 2002
-#  * Housemarque Oy
-#  * http://www.housemarque.com
-#  *
-#  * Distributed under the Boost Software License, Version 1.0. (See
-#  * accompanying file LICENSE_1_0.txt or copy at
-#  * http://www.boost.org/LICENSE_1_0.txt)
-#  */
-#
-# /* Revised by Paul Mensonides (2002) */
-#
-# /* See http://www.boost.org for most recent version. */
-#
-# /* This example demonstrates the usage of preprocessor lists for generating C++ code. */
-#
-# include <boost/preprocessor/facilities/empty.hpp>
-# include <boost/preprocessor/list/at.hpp>
-# include <boost/preprocessor/list/for_each_product.hpp>
-# include <boost/preprocessor/tuple/elem.hpp>
-# include <boost/preprocessor/tuple/to_list.hpp>
-#
-# /* List of integral types.  (Strictly speaking, wchar_t should be on the list.) */
-# define INTEGRAL_TYPES \
-   BOOST_PP_TUPLE_TO_LIST( \
-      9, (char, signed char, unsigned char, short, unsigned short, int, unsigned, long, unsigned long) \
-   ) \
-   /**/
-#
-# /* List of invokeable cv-qualifiers */
-# define CV_QUALIFIERS \
-   BOOST_PP_TUPLE_TO_LIST( \
-      4, (BOOST_PP_EMPTY, const BOOST_PP_EMPTY, volatile BOOST_PP_EMPTY, const volatile BOOST_PP_EMPTY) \
-   ) \
-   /**/
-#
-# /* Template for testing whether a type is an integral type. */
-
-template<class T> struct is_integral {
-   enum { value = false };
-};
-
-# /* Macro for defining a specialization of is_integral<> template. */
-# define IS_INTEGRAL_SPECIALIZATION(R, L) \
-   template<> struct is_integral<BOOST_PP_TUPLE_ELEM(2, 0, L)() BOOST_PP_TUPLE_ELEM(2, 1, L)> { \
-      enum { value = true }; \
-   }; \
-   /**/
-
-BOOST_PP_LIST_FOR_EACH_PRODUCT(IS_INTEGRAL_SPECIALIZATION, 2, (CV_QUALIFIERS, INTEGRAL_TYPES))

data/ext/enterprise_script_service/msgpack/external/boost/preprocessor/doc/examples/linear_fib.c

@@ -1,91 +0,0 @@
-# /* Copyright (C) 2002
-#  * Housemarque Oy
-#  * http://www.housemarque.com
-#  *
-#  * Distributed under the Boost Software License, Version 1.0. (See
-#  * accompanying file LICENSE_1_0.txt or copy at
-#  * http://www.boost.org/LICENSE_1_0.txt)
-#  */
-#
-# /* Revised by Paul Mensonides (2002) */
-#
-# /* See http://www.boost.org for most recent version. */
-#
-# /* This example shows how BOOST_PP_WHILE() can be used for implementing macros. */
-#
-# include <stdio.h>
-#
-# include <boost/preprocessor/arithmetic/add.hpp>
-# include <boost/preprocessor/arithmetic/sub.hpp>
-# include <boost/preprocessor/comparison/less_equal.hpp>
-# include <boost/preprocessor/control/while.hpp>
-# include <boost/preprocessor/list/adt.hpp>
-# include <boost/preprocessor/tuple/elem.hpp>
-#
-# /* First consider the following C implementation of Fibonacci. */
-
-typedef struct linear_fib_state {
-   int a0, a1, n;
-} linear_fib_state;
-
-static int linear_fib_c(linear_fib_state p) {
-   return p.n;
-}
-
-static linear_fib_state linear_fib_f(linear_fib_state p) {
-   linear_fib_state r = { p.a1, p.a0 + p.a1, p.n - 1 };
-   return r;
-}
-
-static int linear_fib(int n) {
-   linear_fib_state p = { 0, 1, n };
-   while (linear_fib_c(p)) {
-      p = linear_fib_f(p);
-   }
-   return p.a0;
-}
-
-# /* Then consider the following preprocessor implementation of Fibonacci. */
-#
-# define LINEAR_FIB(n) LINEAR_FIB_D(1, n)
-# /* Since the macro is implemented using BOOST_PP_WHILE, the actual
-#  * implementation takes a depth as a parameters so that it can be called
-#  * inside a BOOST_PP_WHILE.  The above easy-to-use version simply uses 1
-#  * as the depth and cannot be called inside a BOOST_PP_WHILE.
-#  */
-#
-# define LINEAR_FIB_D(d, n) \
-   BOOST_PP_TUPLE_ELEM(3, 0, BOOST_PP_WHILE_ ## d(LINEAR_FIB_C, LINEAR_FIB_F, (0, 1, n)))
-# /*                   ^^^^                 ^^^^^           ^^            ^^   ^^^^^^^
-#  *                    #1                   #2             #3            #3     #4
-#  *
-#  * 1) The state is a 3-element tuple.  After the iteration is finished, the first
-#  *    element of the tuple is the result.
-#  *
-#  * 2) The WHILE primitive is "invoked" directly.  BOOST_PP_WHILE(D, ...)
-#  *    can't be used because it would not be expanded by the preprocessor.
-#  *
-#  * 3) ???_C is the condition and ???_F is the iteration macro.
-#  */
-#
-# define LINEAR_FIB_C(d, p) \
-   /* p.n */ BOOST_PP_TUPLE_ELEM(3, 2, p) \
-   /**/
-#
-# define LINEAR_FIB_F(d, p) \
-   ( \
-      /* p.a1 */ BOOST_PP_TUPLE_ELEM(3, 1, p), \
-      /* p.a0 + p.a1 */ BOOST_PP_ADD_D(d, BOOST_PP_TUPLE_ELEM(3, 0, p), BOOST_PP_TUPLE_ELEM(3, 1, p)), \
-                        /*          ^^ ^ \
-                         * BOOST_PP_ADD() uses BOOST_PP_WHILE().  Therefore we \
-                         * pass the recursion depth explicitly to BOOST_PP_ADD_D(). \
-                         */ \
-      /* p.n - 1 */ BOOST_PP_DEC(BOOST_PP_TUPLE_ELEM(3, 2, p)) \
-   ) \
-   /**/
-
-int main() {
-   printf("linear_fib(10) = %d\n", linear_fib(10));
-   printf("LINEAR_FIB(10) = %d\n", LINEAR_FIB(10));
-   return 0;
-}

data/ext/enterprise_script_service/msgpack/external/boost/preprocessor/doc/headers.html

@@ -1,249 +0,0 @@
-<html>
-  <head>
-    <meta content="text/html; charset=windows-1252" http-equiv="content-type">
-    <title>headers.html</title>
-    <link rel="stylesheet" type="text/css" href="styles.css">
-    <base target="desc">
-    <style>
-				.ps { margin-left: 30px; }
-  </style>
-  </head>
-  <body>
-    <h4> Headers <small><a href="contents.html" target="index">[back]</a></small>
-    </h4>
-    <ul>
-      <li>../</li>
-      <li class="ps"> <a href="headers/preprocessor.html">preprocessor.hpp</a></li>
-      <li><a href="headers/arithmetic.html">arithmetic.hpp</a></li>
-      <li>arithmetic/</li>
-      <li class="ps"><a href="headers/arithmetic/add.html">add.hpp</a></li>
-      <li class="ps"><a href="headers/arithmetic/dec.html">dec.hpp</a></li>
-      <li class="ps"><a href="headers/arithmetic/div.html">div.hpp</a></li>
-      <li class="ps"><a href="headers/arithmetic/inc.html">inc.hpp</a></li>
-      <li class="ps"><a href="headers/arithmetic/mod.html">mod.hpp</a></li>
-      <li class="ps"><a href="headers/arithmetic/mul.html">mul.hpp</a></li>
-      <li class="ps"><a href="headers/arithmetic/sub.html">sub.hpp</a></li>
-      <li><a href="headers/array.html">array.hpp</a></li>
-      <li>array/</li>
-      <li class="ps"><a href="headers/array/data.html">data.hpp</a></li>
-      <li class="ps"><a href="headers/array/elem.html">elem.hpp</a></li>
-      <li class="ps"><a href="headers/array/enum.html">enum.hpp</a></li>
-      <li class="ps"><a href="headers/array/insert.html">insert.hpp</a></li>
-      <li class="ps"><a href="headers/array/pop_back.html">pop_back.hpp</a></li>
-      <li class="ps"><a href="headers/array/pop_front.html">pop_front.hpp</a></li>
-      <li class="ps"><a href="headers/array/push_back.html">push_back.hpp</a></li>
-      <li class="ps"><a href="headers/array/push_front.html">push_front.hpp</a></li>
-      <li class="ps"><a href="headers/array/remove.html">remove.hpp</a></li>
-      <li class="ps"><a href="headers/array/replace.html">replace.hpp</a></li>
-      <li class="ps"><a href="headers/array/reverse.html">reverse.hpp</a></li>
-      <li class="ps"><a href="headers/array/size.html">size.hpp</a></li>
-      <li class="ps"><a href="headers/array/to_list.html">to_list.hpp</a></li>
-      <li class="ps"><a href="headers/array/to_seq.html">to_seq.hpp</a></li>
-      <li class="ps"><a href="headers/array/to_tuple.html">to_tuple.hpp</a></li>
-      <li><a href="headers/assert_msg.html">assert_msg.hpp*</a></li>
-      <li><a href="headers/cat.html">cat.hpp</a></li>
-      <li><a href="headers/comma.html">comma.hpp*</a></li>
-      <li><a href="headers/comma_if.html">comma_if.hpp*</a></li>
-      <li><a href="headers/comparison.html">comparison.hpp</a></li>
-      <li>comparison/</li>
-      <li class="ps"><a href="headers/comparison/equal.html">equal.hpp</a></li>
-      <li class="ps"><a href="headers/comparison/greater.html">greater.hpp</a></li>
-      <li class="ps"><a href="headers/comparison/greater_equal.html">greater_equal.hpp</a></li>
-      <li class="ps"><a href="headers/comparison/less.html">less.hpp</a></li>
-      <li class="ps"><a href="headers/comparison/less_equal.html">less_equal.hpp</a></li>
-      <li class="ps"><a href="headers/comparison/not_equal.html">not_equal.hpp</a></li>
-      <li>config/</li>
-      <li class="ps"><a href="headers/config/limits.html">limits.hpp</a></li>
-      <li class="ps"><a href="headers/config/variadics.html">config.hpp</a></li>
-      <li><a href="headers/control.html">control.hpp</a></li>
-      <li>control/</li>
-      <li class="ps"><a href="headers/control/deduce_d.html">deduce_d.hpp</a></li>
-      <li class="ps"><a href="headers/control/expr_if.html">expr_if.hpp</a></li>
-      <li class="ps"><a href="headers/control/expr_iif.html">expr_iif.hpp</a></li>
-      <li class="ps"><a href="headers/control/if.html">if.hpp</a></li>
-      <li class="ps"><a href="headers/control/iif.html">iif.hpp</a></li>
-      <li class="ps"><a href="headers/control/while.html">while.hpp</a></li>
-      <li><a href="headers/debug.html">debug.hpp</a></li>
-      <li>debug/</li>
-      <li class="ps"><a href="headers/debug/assert.html">assert.hpp</a></li>
-      <li class="ps"><a href="headers/debug/line.html">line.hpp</a></li>
-      <li><a href="headers/dec.html">dec.hpp*</a></li>
-      <li><a href="headers/empty.html">empty.hpp*</a></li>
-      <li><a href="headers/enum.html">enum.hpp*</a></li>
-      <li><a href="headers/enum_params.html">enum_params.hpp*</a></li>
-      <li><a href="headers/epwad.html">enum_params_with_a_default.hpp*</a></li>
-      <li><a href="headers/epwd.html">enum_params_with_defaults.hpp*</a></li>
-      <li><a href="headers/enum_shifted.html">enum_shifted.hpp*</a></li>
-      <li><a href="headers/enum_shifted_params.html">enum_shifted_params.hpp*</a></li>
-      <li><a href="headers/expand.html">expand.hpp*</a></li>
-      <li><a href="headers/expr_if.html">expr_if.hpp*</a></li>
-      <li><a href="headers/facilities.html">facilities.hpp</a></li>
-      <li>facilities/</li>
-      <li class="ps"><a href="headers/facilities/apply.html">apply.hpp</a></li>
-      <li class="ps"><a href="headers/facilities/empty.html">empty.hpp</a></li>
-      <li class="ps"><a href="headers/facilities/expand.html">expand.hpp</a></li>
-      <li class="ps"><a href="headers/facilities/identity.html">identity.hpp</a></li>
-      <li class="ps"><a href="headers/facilities/intercept.html">intercept.hpp</a></li>
-      <li class="ps"><a href="headers/facilities/overload.html">overload.hpp</a>
-        <a href="topics/variadic_macros.html#VNotation">(v)</a></li>
-      <li><a href="headers/for.html">for.hpp*</a></li>
-      <li><a href="headers/identity.html">identity.hpp*</a></li>
-      <li><a href="headers/if.html">if.hpp*</a></li>
-      <li><a href="headers/inc.html">inc.hpp*</a></li>
-      <li><a href="headers/iterate.html">iterate.hpp*</a></li>
-      <li><a href="headers/iteration.html">iteration.hpp</a></li>
-      <li>iteration/</li>
-      <li class="ps"><a href="headers/iteration/iterate.html">iterate.hpp</a></li>
-      <li class="ps"><a href="headers/iteration/local.html">local.hpp</a></li>
-      <li class="ps"><a href="headers/iteration/self.html">self.hpp</a></li>
-      <li><a href="headers/library.html">library.hpp</a></li>
-      <li><a href="headers/limits.html">limits.hpp*</a></li>
-      <li><a href="headers/list.html">list.hpp</a></li>
-      <li>list/</li>
-      <li class="ps"><a href="headers/list/adt.html">adt.hpp</a></li>
-      <li class="ps"><a href="headers/list/append.html">append.hpp</a></li>
-      <li class="ps"><a href="headers/list/at.html">at.hpp</a></li>
-      <li class="ps"><a href="headers/list/cat.html">cat.hpp</a></li>
-      <li class="ps"><a href="headers/list/enum.html">enum.hpp</a></li>
-      <li class="ps"><a href="headers/list/filter.html">filter.hpp</a></li>
-      <li class="ps"><a href="headers/list/first_n.html">first_n.hpp</a></li>
-      <li class="ps"><a href="headers/list/fold_left.html">fold_left.hpp</a></li>
-      <li class="ps"><a href="headers/list/fold_right.html">fold_right.hpp</a></li>
-      <li class="ps"><a href="headers/list/for_each.html">for_each.hpp</a></li>
-      <li class="ps"><a href="headers/list/for_each_i.html">for_each_i.hpp</a></li>
-      <li class="ps"><a href="headers/list/for_each_product.html">for_each_product.hpp</a></li>
-      <li class="ps"><a href="headers/list/rest_n.html">rest_n.hpp</a></li>
-      <li class="ps"><a href="headers/list/reverse.html">reverse.hpp</a></li>
-      <li class="ps"><a href="headers/list/size.html">size.hpp</a></li>
-      <li class="ps"><a href="headers/list/to_array.html">to_array.hpp</a></li>
-      <li class="ps"><a href="headers/list/to_seq.html">to_seq.hpp</a></li>
-      <li class="ps"><a href="headers/list/to_tuple.html">to_tuple.hpp</a></li>
-      <li class="ps"><a href="headers/list/transform.html">transform.hpp</a></li>
-      <li><a href="headers/logical.html">logical.hpp</a></li>
-      <li>logical/</li>
-      <li class="ps"><a href="headers/logical/and.html">and.hpp</a></li>
-      <li class="ps"><a href="headers/logical/bitand.html">bitand.hpp</a></li>
-      <li class="ps"><a href="headers/logical/bitnor.html">bitnor.hpp</a></li>
-      <li class="ps"><a href="headers/logical/bitor.html">bitor.hpp</a></li>
-      <li class="ps"><a href="headers/logical/bitxor.html">bitxor.hpp</a></li>
-      <li class="ps"><a href="headers/logical/bool.html">bool.hpp</a></li>
-      <li class="ps"><a href="headers/logical/compl.html">compl.hpp</a></li>
-      <li class="ps"><a href="headers/logical/nor.html">nor.hpp</a></li>
-      <li class="ps"><a href="headers/logical/not.html">not.hpp</a></li>
-      <li class="ps"><a href="headers/logical/or.html">or.hpp</a></li>
-      <li class="ps"><a href="headers/logical/xor.html">xor.hpp</a></li>
-      <li><a href="headers/max.html">max.hpp*</a></li>
-      <li><a href="headers/min.html">min.hpp*</a></li>
-      <li><a href="headers/punctuation.html">punctuation.hpp</a></li>
-      <li>punctuation/</li>
-      <li class="ps"><a href="headers/punctuation/comma.html">comma.hpp</a></li>
-      <li class="ps"><a href="headers/punctuation/comma_if.html">comma_if.hpp</a></li>
-      <li class="ps"><a href="headers/punctuation/is_begin_parens.html">is_begin_parens.hpp</a> <a href="topics/variadic_macros.html#VNotation">(v)</a></li>
-      <li class="ps"><a href="headers/punctuation/paren.html">paren.hpp</a></li>
-      <li class="ps"><a href="headers/punctuation/paren_if.html">paren_if.hpp</a></li>
-      <li class="ps"><a href="headers/punctuation/remove_parens.html">remove_parens.hpp</a> <a href="topics/variadic_macros.html#VNotation">(v)</a></li>
-      <li><a href="headers/repeat.html">repeat.hpp*</a></li>
-      <li><a href="headers/repeat_2nd.html">repeat_2nd.hpp*</a></li>
-      <li><a href="headers/repeat_3rd.html">repeat_3rd.hpp*</a></li>
-      <li><a href="headers/repeat_from_to.html">repeat_from_to.hpp*</a></li>
-      <li><a href="headers/repeat_from_to_2nd.html">repeat_from_to_2nd.hpp*</a></li>
-      <li><a href="headers/repeat_from_to_3rd.html">repeat_from_to_3rd.hpp*</a></li>
-      <li><a href="headers/repetition.html">repetition.hpp</a></li>
-      <li>repetition/</li>
-      <li class="ps"><a href="headers/repetition/deduce_r.html">deduce_r.hpp</a></li>
-      <li class="ps"><a href="headers/repetition/deduce_z.html">deduce_z.hpp</a></li>
-      <li class="ps"><a href="headers/repetition/enum.html">enum.hpp</a></li>
-      <li class="ps"><a href="headers/repetition/enum_binary_params.html">enum_binary_params.hpp</a></li>
-      <li class="ps"><a href="headers/repetition/enum_params.html">enum_params.hpp</a></li>
-      <li class="ps"><a href="headers/repetition/epwad.html">enum_params_with_a_default.hpp</a></li>
-      <li class="ps"><a href="headers/repetition/epwd.html">enum_params_with_defaults.hpp</a></li>
-      <li class="ps"><a href="headers/repetition/esbp.html">enum_shifted_binary_params.hpp</a></li>
-      <li class="ps"><a href="headers/repetition/enum_shifted_params.html">enum_shifted_params.hpp</a></li>
-      <li class="ps"><a href="headers/repetition/enum_shifted.html">enum_shifted.hpp</a></li>
-      <li class="ps"><a href="headers/repetition/enum_trailing.html">enum_trailing.hpp</a></li>
-      <li class="ps"><a href="headers/repetition/etbp.html">enum_trailing_binary_params.hpp</a></li>
-      <li class="ps"><a href="headers/repetition/enum_trailing_params.html">enum_trailing_params.hpp</a></li>
-      <li class="ps"><a href="headers/repetition/for.html">for.hpp</a></li>
-      <li class="ps"><a href="headers/repetition/repeat.html">repeat.hpp</a></li>
-      <li class="ps"><a href="headers/repetition/repeat_from_to.html">repeat_from_to.hpp</a></li>
-      <li><a href="headers/selection.html">selection.hpp</a></li>
-      <li>selection/</li>
-      <li class="ps"><a href="headers/selection/max.html">max.hpp</a></li>
-      <li class="ps"><a href="headers/selection/min.html">min.hpp</a></li>
-      <li><a href="headers/seq.html">seq.hpp</a></li>
-      <li>seq/</li>
-      <li class="ps"><a href="headers/seq/cat.html">cat.hpp</a></li>
-      <li class="ps"><a href="headers/seq/elem.html">elem.hpp</a></li>
-      <li class="ps"><a href="headers/seq/enum.html">enum.hpp</a></li>
-      <li class="ps"><a href="headers/seq/filter.html">filter.hpp</a></li>
-      <li class="ps"><a href="headers/seq/first_n.html">first_n.hpp</a></li>
-      <li class="ps"><a href="headers/seq/fold_left.html">fold_left.hpp</a></li>
-      <li class="ps"><a href="headers/seq/fold_right.html">fold_right.hpp</a></li>
-      <li class="ps"><a href="headers/seq/for_each.html">for_each.hpp</a></li>
-      <li class="ps"><a href="headers/seq/for_each_i.html">for_each_i.hpp</a></li>
-      <li class="ps"><a href="headers/seq/for_each_product.html">for_each_product.hpp</a></li>
-      <li class="ps"><a href="headers/seq/insert.html">insert.hpp</a></li>
-      <li class="ps"><a href="headers/seq/pop_back.html">pop_back.hpp</a></li>
-      <li class="ps"><a href="headers/seq/pop_front.html">pop_front.hpp</a></li>
-      <li class="ps"><a href="headers/seq/push_back.html">push_back.hpp</a></li>
-      <li class="ps"><a href="headers/seq/push_front.html">push_front.hpp</a></li>
-      <li class="ps"><a href="headers/seq/remove.html">remove.hpp</a></li>
-      <li class="ps"><a href="headers/seq/replace.html">replace.hpp</a></li>
-      <li class="ps"><a href="headers/seq/rest_n.html">rest_n.hpp</a></li>
-      <li class="ps"><a href="headers/seq/reverse.html">reverse.hpp</a></li>
-      <li class="ps"><a href="headers/seq/seq.html">seq.hpp</a></li>
-      <li class="ps"><a href="headers/seq/size.html">size.hpp</a></li>
-      <li class="ps"><a href="headers/seq/subseq.html">subseq.hpp</a></li>
-      <li class="ps"><a href="headers/seq/to_array.html">to_array.hpp</a></li>
-      <li class="ps"><a href="headers/seq/to_list.html">to_list.hpp</a></li>
-      <li class="ps"><a href="headers/seq/to_tuple.html">to_tuple.hpp</a></li>
-      <li class="ps"><a href="headers/seq/transform.html">transform.hpp</a></li>
-      <li class="ps"><a href="headers/seq/variadic_seq_to_seq.html">variadic_seq_to_seq.hpp</a></li>
-      <li><a href="headers/slot.html">slot.hpp</a></li>
-      <li>slot/</li>
-      <li class="ps"><a href="headers/slot/counter.html">counter.hpp</a></li>
-      <li class="ps"><a href="headers/slot/slot.html">slot.hpp</a></li>
-      <li><a href="headers/tuple.html">tuple.hpp</a></li>
-      <li>tuple/</li>
-      <li class="ps"><a href="headers/tuple/eat.html">eat.hpp</a> <a href="topics/variadic_macros.html#VNotation">(v)</a></li>
-      <li class="ps"><a href="headers/tuple/elem.html">elem.hpp</a> <a href="topics/variadic_macros.html#VNotation">(v)</a></li>
-      <li class="ps"><a href="headers/tuple/enum.html">enum.hpp</a> <a href="topics/variadic_macros.html#VNotation">(v)</a></li>
-      <li class="ps"><a href="headers/tuple/insert.html">insert.hpp</a> <a href="topics/variadic_macros.html#VNotation">(v)</a></li>
-      <li class="ps"><a href="headers/tuple/pop_back.html">pop_back.hpp</a> <a
-          href="topics/variadic_macros.html#VNotation">(v)</a></li>
-      <li class="ps"><a href="headers/tuple/pop_front.html">pop_front.hpp</a> <a
-          href="topics/variadic_macros.html#VNotation">(v)</a></li>
-      <li class="ps"><a href="headers/tuple/push_back.html">push_back.hpp</a> <a
-          href="topics/variadic_macros.html#VNotation">(v)</a></li>
-      <li class="ps"><a href="headers/tuple/push_front.html">push_front.hpp</a>
-        <a href="topics/variadic_macros.html#VNotation">(v)</a></li>
-      <li class="ps"><a href="headers/tuple/rem.html">rem.hpp</a> <a href="topics/variadic_macros.html#VNotation">(v)</a></li>
-      <li class="ps"><a href="headers/tuple/remove.html">remove.hpp</a> <a href="topics/variadic_macros.html#VNotation">(v)</a></li>
-      <li class="ps"><a href="headers/tuple/replace.html">replace.hpp</a> <a href="topics/variadic_macros.html#VNotation">(v)</a></li>
-      <li class="ps"><a href="headers/tuple/reverse.html">reverse.hpp</a> <a href="topics/variadic_macros.html#VNotation">(v)</a></li>
-      <li class="ps"><a href="headers/tuple/size.html">size.hpp</a> <a href="topics/variadic_macros.html#VNotation">(v)</a></li>
-      <li class="ps"><a href="headers/tuple/to_array.html">to_array.hpp</a> <a
-          href="topics/variadic_macros.html#VNotation">(v)</a></li>
-      <li class="ps"><a href="headers/tuple/to_list.html">to_list.hpp</a> <a href="topics/variadic_macros.html#VNotation">(v)</a></li>
-      <li class="ps"><a href="headers/tuple/to_seq.html">to_seq.hpp</a> <a href="topics/variadic_macros.html#VNotation">(v)</a></li>
-      <li><a href="headers/stringize.html">stringize.hpp</a></li>
-      <li><a href="headers/variadic.html">variadic.hpp</a></li>
-      <li>variadic/</li>
-      <li class="ps"><a href="headers/variadic/elem.html">elem.hpp</a> <a href="topics/variadic_macros.html#VNotation">(v)</a></li>
-      <li class="ps"><a href="headers/variadic/size.html">size.hpp</a> <a href="topics/variadic_macros.html#VNotation">(v)</a></li>
-      <li class="ps"><a href="headers/variadic/to_array.html">to_array.hpp</a> <a
-          href="topics/variadic_macros.html#VNotation">(v)</a></li>
-      <li class="ps"><a href="headers/variadic/to_list.html">to_list.hpp</a> <a
-          href="topics/variadic_macros.html#VNotation">(v)</a></li>
-      <li class="ps"><a href="headers/variadic/to_seq.html">to_seq.hpp</a> <a href="topics/variadic_macros.html#VNotation">(v)</a></li>
-      <li class="ps"><a href="headers/variadic/to_tuple.html">to_tuple.hpp</a> <a
-          href="topics/variadic_macros.html#VNotation">(v)</a></li>
-      <li><a href="headers/while.html">while.hpp*</a></li>
-      <li><a href="headers/wstringize.html">wstringize.hpp</a></li>
-    </ul>
-    <!--
-� Copyright Housemarque Oy 2002� Copyright Paul Mensonides 2002
-Distributed under the Boost Software License, Version 1.0.(See accompanying file LICENSE_1_0.txt or copy at
-http://www.boost.org/LICENSE_1_0.txt)-->
-  </body>
-</html>