RubyGems - script_core - Versions diffs - 0.0.5 → 0.0.6 - Mend

script_core 0.0.5 → 0.0.6

Files changed (1076) hide show

data/ext/enterprise_script_service/msgpack/external/boost/preprocessor/doc/acknowledgements.html DELETED Viewed

@@ -1,58 +0,0 @@
-<html>
-<head>
-	<title>acknowledgements.html</title>
-	<link rel="stylesheet" type="text/css" href="styles.css">
-</head>
-<body>
-	<h4>Acknowledgements</h4>
-	<div>
-		The following are a few acknowledgements of people that contributed to
-		or were instrumental in the development of the library by Vesa Karnoven and myself.
-	</div>
-	<h4>Vesa Karvonen</h4>
-	<div>
-		The original idea of passing two extra parameters to REPEAT, which makes it possible to create preprocessor code on top of it,
-		was due to Aleksey Gurtovoy.&nbsp;
-		The invokeable IDENTITY macro was invented by him.&nbsp;
-		He also suggested the name for the library.&nbsp;
-		Many thanks to Aleksey for his insights!
-	</div>
-	<div>
-		Thanks to everyone who participated in the review:&nbsp; David Abrahams, Beman Dawes, Ronald Garcia, Douglas Gregor, Aleksey Gurtovoy, Jeremy Siek, and Daryle Walker.
-	</div>
-	<div>
-		Thanks to Chris Little and Mat Marcus for providing help with MWCW.
-	</div>
-	<div>
-		The original automatic recursion technique, which makes many of the library
-		primitives easier to use, was invented by Paul Mensonides.
-	</div>
-	<div>
-		The PREPROCESSOR library has been developed by Vesa Karvonen.
-	</div>
-	<h4>Paul Mensonides</h4>
-	<div>
-		Thanks to Vesa Karvonen for the original conception of the library.&nbsp;
-		His work, his help, and his opinions are all much appreciated.
-	</div>
-	<div>
-		Thanks also to David Abrahams for his observations and continued support.
-	</div>
-	<div>
-		The help of several other Boost developers is also greatly appreciated.&nbsp;
-		In particular, thanks to Aleksey Gurtovoy for his suggestions and to Ralf W. Grosse-Kunstleve for providing
-		access to several compilers for testing.
-	</div>
-	<hr size="1">
-	<div style="margin-left: 0px;">
-		<i>� Copyright <a href="http://www.housemarque.com" target="_top">Housemarque Oy</a> 2002</i>
-		</br><i>� Copyright Paul Mensonides 2002</i>
-	</div>
-	<div style="margin-left: 0px;">
-		<p><small>Distributed under the Boost Software License, Version 1.0. (See
-		accompanying file <a href="../../../LICENSE_1_0.txt">LICENSE_1_0.txt</a> or
-		copy at <a href=
-		"http://www.boost.org/LICENSE_1_0.txt">www.boost.org/LICENSE_1_0.txt</a>)</small></p>
-	</div>
-</body>
-</html>

data/ext/enterprise_script_service/msgpack/external/boost/preprocessor/doc/bibliography.html DELETED Viewed

@@ -1,58 +0,0 @@
-<html>
-<head>
-	<title>bibliography.html</title>
-	<link rel="stylesheet" type="text/css" href="styles.css">
-</head>
-<body>
-<h4>Bibliography</h4>
-<table style="margin-left:  20px">
-	<tr>
-		<td><b><a name="stroustrup"></a>[Stroustrup]</b></td>
-		<td>Stroustrup:&nbsp; <i>The Design and Evolution of C++</i>, ISBN 0201543303</td>
-	</tr>
-	<tr>
-		<td><b><a name="czarnecki"></a>[Czarnecki]</b></td>
-		<td>Czarnecki, Eisenecker:&nbsp; <i>Generative Programming</i>, ISBN 0201309777</td>
-	</tr>
-	<tr>
-		<td><b><b><a name="barton"></a>[Barton]</b></td>
-		<td>Barton, Nackman:&nbsp; <i>Scientific and Engineering C++</i>, ISBN 0201533936</td>
-	</tr>
-	<tr>
-		<td><b><a name="mcconnell"></a>[McConnell]</b></td>
-		<td>McConnell:&nbsp; <i>Code Complete</i>, ISBN 1556154844</td>
-	</tr>
-	<tr>
-		<td><b><a name="std"></a>[Std]</b></td>
-		<td>ISO/IEC 14882:1998 <i>Programming Languages - C++</i></td>
-	</tr>
-	<tr>
-		<td><b>[Thompson]</b></td>
-		<td>Thompson:&nbsp; <i>Haskell:&nbsp; The Craft of Functional Programming</i>, ISBN 0201342758</td>
-	</tr>
-	<tr>
-		<td><b>[Okasaki]</b></td>
-		<td>Okasaki:&nbsp; <i>Purely Functional Data Structures</i>, ISBN 0521663504</td>
-	</tr>
-	<tr>
-		<td><b>[Cousineau]</b></td>
-		<td>Cousineau, Mauny:&nbsp; <i>The Functional Approach to Programming</i>, ISBN 0521576814</td>
-	</tr>
-	<tr>
-		<td><b>[Abelson]</b></td>
-		<td>Abelson, Sussman, Sussman:&nbsp; <i>Structure and Interpretation of Computer Programs</i>, ISBN 0521576814</td>
-	</tr>
-</table>
-	<hr size="1">
-	<div style="margin-left: 0px;">
-		<i>� Copyright <a href="http://www.housemarque.com" target="_top">Housemarque Oy</a> 2002</i>
-		</br><i>� Copyright Paul Mensonides 2002</i>
-	</div>
-	<div style="margin-left: 0px;">
-		<p><small>Distributed under the Boost Software License, Version 1.0. (See
-		accompanying file <a href="../../../LICENSE_1_0.txt">LICENSE_1_0.txt</a> or
-		copy at <a href=
-		"http://www.boost.org/LICENSE_1_0.txt">www.boost.org/LICENSE_1_0.txt</a>)</small></p>
-	</div>
-</body>
-</html>

data/ext/enterprise_script_service/msgpack/external/boost/preprocessor/doc/contents.html DELETED Viewed

@@ -1,38 +0,0 @@
-<html>
-  <head>
-    <meta content="text/html; charset=windows-1252" http-equiv="content-type">
-    <title>contents.html</title>
-    <link rel="stylesheet" type="text/css" href="styles.css">
-    <style>
-		a, a:link, a:visited { color: black; font-weight: bold; }
-	</style>
-  </head>
-  <body>
-    <h4><a href="AppendixA-AnIntroductiontoPreprocessorMetaprogramming.html"
-        target="_top">Introduction</a></h4>
-    <h4><a href="topics.html">Topics</a></h4>
-    <a href="topics.html">
-    </a>
-    <h4><a href="topics.html"></a><a href="terms.html">Terminology</a></h4>
-    <a href="terms.html">
-    </a>
-    <h4><a href="terms.html"></a><a href="data.html">Data Types</a></h4>
-    <a href="data.html">
-    </a>
-    <h4><a href="data.html"></a><a href="ref.html">Reference</a></h4>
-    <a href="ref.html">
-    </a>
-    <h4><a href="ref.html"></a><a href="headers.html">Headers</a></h4>
-    <a href="headers.html">
-    </a>
-    <h4><a href="headers.html"></a><a href="examples.html">Examples</a></h4>
-    <a href="examples.html">
-    </a>
-    <h4><a href="examples.html"></a><a href="miscellanea.html">Miscellanea</a></h4>
-    <a href="miscellanea.html">
-      <!--
-� 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)--> </a>
-  </body>
-</html>

data/ext/enterprise_script_service/msgpack/external/boost/preprocessor/doc/data.html DELETED Viewed

@@ -1,27 +0,0 @@
-<html>
-	<head>
-		<title>data.html</title>
-		<link rel="stylesheet" type="text/css" href="styles.css">
-			<base target="desc">
-	</head>
-	<body>
-		<h4>
-			Data Types <small><a href="contents.html" target="index">[back]</a></small>
-		</h4>
-		<ul>
-			<li><a href="data/arrays.html">arrays</a></li>
-			<li><a href="data/lists.html">lists</a></li>
-			<li><a href="data/sequences.html">sequences</a></li>
-			<li><a href="data/tuples.html">tuples</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>

data/ext/enterprise_script_service/msgpack/external/boost/preprocessor/doc/data/arrays.html DELETED Viewed

@@ -1,55 +0,0 @@
-<html>
-  <head>
-    <meta content="text/html; charset=windows-1252" http-equiv="content-type">
-    <title>arrays.html</title>
-    <link rel="stylesheet" type="text/css" href="../styles.css">
-  </head>
-  <body>
-    <h4>Arrays</h4>
-    <div> An <i>array</i> is a data structure consisting of a two-element <i>tuple</i>.&nbsp;
-      The first element is the number of elements in the <i>array</i>.&nbsp;
-      The second element is another <i>tuple</i> of the elements in the <i>array</i>.&nbsp;
-      For example, </div>
-    <div class="code"> (<i>3</i>, (<i>a</i>, <i>b</i>, <i>c</i>)) </div>
-    <div> ...is an <i>array</i> of <i>3</i> elements--<i>a</i>, <i>b</i>, and
-      <i>c</i>. </div>
-    <div> The primary strength of <i>arrays</i> is that they store their own
-      size.&nbsp; Because of this, access to elements does not require the
-      size.&nbsp; It only requires that an element exists at a certain index. </div>
-    <div> This allows macro parameters to be variable in size and allows data
-      states to change size without the user explicitly keeping track of the
-      size independently.<br>
-      <br>
-      An <i>array </i>can be empty and have no elements. An empty array has a
-      0 size. The notation for an empty array is '(0,())'.<br>
-      <br>
-      <span style="font-style: italic;"> </span></div>
-    <div>With variadic macro support a <i>tuple </i>has all of the
-      functionality as an <i>array</i>, knows its own size, and is easier
-      syntactically to use. Because of that an <i>array</i> should be used, as
-      opposed to a <i>tuple</i>, only if your compiler does not support
-      variadic macros. The only advantage an <i>array </i>has over a <i>tuple
-      </i>is that an <i>array </i>can be empty while a <i>tuple </i>always
-      has at least one element and therefore can never have a size of 0.<br>
-      <br>
-      Elements of an <i>array</i> can be extracted with <b>BOOST_PP_ARRAY_ELEM</b>,
-      an <i>array's</i> size can be extracted with <b>BOOST_PP_ARRAY_SIZE</b>,
-      and an <i>array</i> can be converted to the more primitive <i>tuple</i>
-      data structure with <b>BOOST_PP_ARRAY_DATA</b>. </div>
-    <h4>Primitives</h4>
-    <ul>
-      <li><a href="../ref/array_data.html">BOOST_PP_ARRAY_DATA</a></li>
-      <li><a href="../ref/array_elem.html">BOOST_PP_ARRAY_ELEM</a></li>
-      <li><a href="../ref/array_size.html">BOOST_PP_ARRAY_SIZE</a></li>
-    </ul>
-    <hr size="1">
-    <div style="margin-left: 0px;"> <i>� Copyright <a href="http://www.housemarque.com"
-          target="_top">Housemarque Oy</a> 2002</i> <br>
-      <i>� Copyright Paul Mensonides 2002</i> </div>
-    <div style="margin-left: 0px;">
-      <p><small>Distributed under the Boost Software License, Version 1.0. (See
-          accompanying file <a href="../../../../LICENSE_1_0.txt">LICENSE_1_0.txt</a>
-          or copy at <a href="http://www.boost.org/LICENSE_1_0.txt">www.boost.org/LICENSE_1_0.txt</a>)</small></p>
-    </div>
-  </body>
-</html>

data/ext/enterprise_script_service/msgpack/external/boost/preprocessor/doc/data/lists.html DELETED Viewed

@@ -1,42 +0,0 @@
-<html>
-  <head>
-    <meta content="text/html; charset=windows-1252" http-equiv="content-type">
-    <title>lists.html</title>
-    <link rel="stylesheet" type="text/css" href="../styles.css">
-  </head>
-  <body>
-    <h4>Lists</h4>
-    <div> A <i>list</i> is a simple cons-style list with a head and a
-      tail.&nbsp; The head of a <i>list</i> is an element, and the tail is
-      either another <i>list</i> or <b>BOOST_PP_NIL</b>. For example, </div>
-    <div class="code"> (<i>a</i>, (<i>b</i>, (<i>c</i>, <b>BOOST_PP_NIL</b>)))
-    </div>
-    <div> ...is a <i>list</i> of <i>3</i> elements--<i>a</i>, <i>b</i>, and <i>c</i>.
-    </div>
-    <div> This allows macro parameters to be variable in size and allows data
-      states to change size without the user explicitly keeping track of the
-      size independently.<br>
-      <br>
-      A list can be empty and therefore have a size of 0. An empty list is
-      represented by the notation <b>BOOST_PP_NIL.<br>
-        <br>
-      </b></div>
-    <div> Elements of a <i>list</i> can be extracted with <b>BOOST_PP_LIST_FIRST</b>
-      and <b>BOOST_PP_LIST_REST</b>.&nbsp; </div>
-    <h4>Primitives</h4>
-    <ul>
-      <li><a href="../ref/list_first.html">BOOST_PP_LIST_FIRST</a></li>
-      <li><a href="../ref/list_rest.html">BOOST_PP_LIST_REST</a></li>
-      <li><a href="../ref/nil.html">BOOST_PP_NIL</a></li>
-    </ul>
-    <hr size="1">
-    <div style="margin-left: 0px;"> <i>� Copyright <a href="http://www.housemarque.com"
-          target="_top">Housemarque Oy</a> 2002</i> <br>
-      <i>� Copyright Paul Mensonides 2002</i> </div>
-    <div style="margin-left: 0px;">
-      <p><small>Distributed under the Boost Software License, Version 1.0. (See
-          accompanying file <a href="../../../../LICENSE_1_0.txt">LICENSE_1_0.txt</a>
-          or copy at <a href="http://www.boost.org/LICENSE_1_0.txt">www.boost.org/LICENSE_1_0.txt</a>)</small></p>
-    </div>
-  </body>
-</html>

data/ext/enterprise_script_service/msgpack/external/boost/preprocessor/doc/data/sequences.html DELETED Viewed

@@ -1,60 +0,0 @@
-<html>
-  <head>
-    <meta content="text/html; charset=windows-1252" http-equiv="content-type">
-    <title>sequences.html</title>
-    <link rel="stylesheet" type="text/css" href="../styles.css">
-  </head>
-  <body>
-    <h4> Sequences </h4>
-    <div> A <i>sequence</i> (abbreviated to <i>seq</i>) is a group of adjacent
-      parenthesized elements. For example, </div>
-    <div class="code"> (<i>a</i>)(<i>b</i>)(<i>c</i>) </div>
-    <div> ...is a <i>seq</i> of <i>3</i> elements--<i>a</i>, <i>b</i>, and <i>c</i>.
-    </div>
-    <div> <i>Sequences</i> are data structures that merge the properties of
-      both <i>lists</i> and <i>tuples</i> with the exception that a <i>seq, </i>like
-      a <i>tuple, </i>cannot be empty.&nbsp; Therefore, an "empty" <i>seq</i>
-      is considered a special case scenario that must be handled separately in
-      C++. </div>
-    <div class="code">
-      <pre>#define SEQ (x)(y)(z)
-#define REVERSE(s, state, elem) (elem) state
-   // append to head                  ^
-BOOST_PP_SEQ_FOLD_LEFT(REVERSE, BOOST_PP_EMPTY, SEQ)()
-   //                           #1                  #2
-   // 1) placeholder for "empty" seq
-   // 2) remove placeholder
-#define SEQ_B (1)(2)(3)
-#define INC(s, state, elem) state (BOOST_PP_INC(elem))
-   // append to tail             ^
-BOOST_PP_SEQ_FOLD_RIGHT(INC, BOOST_PP_SEQ_NIL, SEQ)
-   //                        ^
-   // special placeholder that will be "eaten"
-   // by appending to the tail
-</pre> </div>
-    <div> <i>Sequences</i> are extremely efficient.&nbsp; Element access speed
-      approaches random access--even with <i>seqs</i> of up to <i>256</i>
-      elements.&nbsp; This is because element access (among other things) is
-      implemented iteratively rather than recursively.&nbsp; Therefore, elements
-      can be accessed at extremely high indices even on preprocessors with low
-      maximum expansion depths. </div>
-    <div> Elements of a <i>seq</i> can be extracted with <b>BOOST_PP_SEQ_ELEM</b>.
-    </div>
-    <h4> Primitives </h4>
-    <ul>
-      <li> <a href="../ref/seq_elem.html">BOOST_PP_SEQ_ELEM</a></li>
-    </ul>
-    <hr size="1">
-    <div style="margin-left: 0px;"> <i>� Copyright <a href="http://www.housemarque.com"
-          target="_top">Housemarque Oy</a> 2002</i> <br>
-      <i>� Copyright Paul Mensonides 2002</i> </div>
-    <div style="margin-left: 0px;">
-      <p><small>Distributed under the Boost Software License, Version 1.0. (See
-          accompanying file <a href="../../../../LICENSE_1_0.txt">LICENSE_1_0.txt</a>
-          or copy at <a href="http://www.boost.org/LICENSE_1_0.txt">www.boost.org/LICENSE_1_0.txt</a>)</small></p>
-    </div>
-  </body>
-</html>

data/ext/enterprise_script_service/msgpack/external/boost/preprocessor/doc/data/tuples.html DELETED Viewed

@@ -1,42 +0,0 @@
-<html>
-  <head>
-    <meta content="text/html; charset=windows-1252" http-equiv="content-type">
-    <title>tuples.html</title>
-    <link rel="stylesheet" type="text/css" href="../styles.css">
-  </head>
-  <body>
-    <h4>Tuples</h4>
-    <div> A <i>tuple</i> is a simple comma-separated list of elements inside
-      parenthesis.&nbsp; For example, </div>
-    <div class="code"> (<i>a</i>, <i>b</i>, <i>c</i>) </div>
-    <div> ...is a <i>tuple</i> of <i>3</i> elements--<i>a</i>, <i>b</i>, and
-      <i>c</i>.<br>
-      <br>
-      A <i>tuple </i>cannot be empty. The notation '()' as a <i>tuple </i>is
-      a single element <i>tuple </i>of size 1, where the element is empty. </div>
-    <div> <i>Tuples</i> are fast and easy to use.&nbsp; With variadic macro
-      support it is not necessary to know the size of a <i>tuple; </i>without
-      variadic macro support&nbsp;all access to <i>tuples</i> requires
-      knowledge of its size. Use a <i>tuple </i>instead of an <i>array</i> if
-      your compiler supports variadic macros, since a <i>tuple </i>has all of
-      the functionality as an <i>array </i>and is easier syntactically to use.
-      The only functionality an <i>array </i>has which a <i>tuple </i>does
-      not have is that an <i>array </i>can be empty whereas a <i>tuple </i>cannot
-      be empty.</div>
-    <div> Elements of a <i>tuple</i> can be extracted with <b>BOOST_PP_TUPLE_ELEM</b>.
-    </div>
-    <h4>Primitives</h4>
-    <ul>
-      <li><a href="../ref/tuple_elem.html">BOOST_PP_TUPLE_ELEM</a></li>
-    </ul>
-    <hr size="1">
-    <div style="margin-left: 0px;"> <i>� Copyright <a href="http://www.housemarque.com"
-          target="_top">Housemarque Oy</a> 2002</i> <br>
-      <i>� Copyright Paul Mensonides 2002</i> </div>
-    <div style="margin-left: 0px;">
-      <p><small>Distributed under the Boost Software License, Version 1.0. (See
-          accompanying file <a href="../../../../LICENSE_1_0.txt">LICENSE_1_0.txt</a>
-          or copy at <a href="http://www.boost.org/LICENSE_1_0.txt">www.boost.org/LICENSE_1_0.txt</a>)</small></p>
-    </div>
-  </body>
-</html>

data/ext/enterprise_script_service/msgpack/external/boost/preprocessor/doc/examples.html DELETED Viewed

@@ -1,27 +0,0 @@
-<html>
-<head>
-	<title>topics.html</title>
-	<link rel="stylesheet" type="text/css" href="styles.css">
-	<base target="desc">
-</head>
-<body>
-<h4>Examples <small><a href="contents.html" target="index">[back]</a></small></h4>
-<ul>
-	<li><a href="examples/array_arithmetic.c">array_arithmetic.c</a></i>
-	<li><a href="examples/catch_builtin.cpp">catch_builtin.cpp</a></i>
-	<li><a href="examples/delay.c">delay.c</a></i>
-	<li><a href="examples/duffs_device.c">duffs_device.c</a></i>
-	<li><a href="examples/is_integral.cpp">is_integral.cpp</a></li>
-	<li><a href="examples/linear_fib.c">linear_fib.c</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>

data/ext/enterprise_script_service/msgpack/external/boost/preprocessor/doc/examples/array_arithmetic.c DELETED Viewed

@@ -1,196 +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 implements over 2200 functions for 1-dimensional arithmetic
-#  * array manipulation in C.  The idea is to use preprocessor data structures,
-#  * lists, and tuples for storing metainformation to be used for generating
-#  * the actual C code.
-#  *
-#  * Who needs templates anyway? :)
-#  *
-#  * Compile with any C compiler with a standards conforming preprocessor.
-#  */
-#
-# include <boost/preprocessor/comparison/less.hpp>
-# include <boost/preprocessor/control/if.hpp>
-# include <boost/preprocessor/list/at.hpp>
-# include <boost/preprocessor/list/cat.hpp>
-# include <boost/preprocessor/list/for_each_product.hpp>
-# include <boost/preprocessor/logical/or.hpp>
-# include <boost/preprocessor/tuple/to_list.hpp>
-# include <boost/preprocessor/tuple/eat.hpp>
-#
-# /* Information about C operators */
-#
-# /* Accessors for the operator datatype. */
-# define OP_SYMBOL(O)      BOOST_PP_TUPLE_ELEM(5, 0, O)
-# define OP_NAME(O)        BOOST_PP_TUPLE_ELEM(5, 1, O)
-# define OP_IS_FLOATING(O) BOOST_PP_TUPLE_ELEM(5, 2, O)
-# define OP_IS_LOGICAL(O)  BOOST_PP_TUPLE_ELEM(5, 3, O)
-# define OP_IS_SHIFT(O)    BOOST_PP_TUPLE_ELEM(5, 4, O)
-#
-# /* List of applicative unary operators. */
-# define APPLICATIVE_UNARY_OPS \
-   BOOST_PP_TUPLE_TO_LIST( \
-      3, \
-      ( \
-         ( ! , logical_not, 1, 1, 0), \
-         ( ~ , bitwise_not, 0, 0, 0), \
-         ( - , neg,         1, 0, 0) \
-      ) \
-   ) \
-   /**/
-#
-# /* List of applicative binary operators. */
-# define APPLICATIVE_BINARY_OPS \
-   BOOST_PP_TUPLE_TO_LIST( \
-      18, \
-      ( \
-         ( *  , mul           ,1 ,0 ,0), \
-         ( /  , div           ,1 ,0 ,0), \
-         ( %  , mod           ,0 ,0 ,0), \
-         ( +  , add           ,1 ,0 ,0), \
-         ( -  , sub           ,1 ,0 ,0), \
-         ( << , shift_left    ,0 ,0 ,1), \
-         ( >> , shift_right   ,0 ,0 ,1), \
-         ( <  , less          ,1 ,1 ,0), \
-         ( <= , less_equal    ,1 ,1 ,0), \
-         ( >= , greater_equal ,1 ,1 ,0), \
-         ( >  , greater       ,1 ,1 ,0), \
-         ( == , equal         ,1 ,1 ,0), \
-         ( != , not_equal     ,1 ,1 ,0), \
-         ( &  , bitwise_and   ,0 ,0 ,0), \
-         ( |  , bitwise_or    ,0 ,0 ,0), \
-         ( ^  , bitwise_xor   ,0 ,0 ,0), \
-         ( && , logical_and   ,1 ,1 ,0), \
-         ( || , logical_or    ,1 ,1 ,0) \
-      ) \
-   ) \
-   /**/
-#
-# /* Information about C built-in types. */
-#
-# /* Accessors for the type datatype. */
-# define TYPE_NAME(T)         BOOST_PP_TUPLE_ELEM(4, 0, T)
-# define TYPE_ABBREVIATION(T) BOOST_PP_TUPLE_ELEM(4, 1, T)
-# define TYPE_IS_FLOATING(T)  BOOST_PP_TUPLE_ELEM(4, 2, T)
-# define TYPE_RANK(T)         BOOST_PP_TUPLE_ELEM(4, 3, T)
-#
-# /* List of C built-in types. */
-# define BUILTIN_TYPES \
-   BOOST_PP_TUPLE_TO_LIST( \
-      12, \
-      ( \
-         ( signed char    ,sc, 0, 1), \
-         ( char           ,ch, 0, 1), \
-         ( unsigned char  ,uc, 0, 1), \
-         ( short          ,ss, 0, 2), \
-         ( unsigned short ,us, 0, 2), \
-         TYPE_INT, \
-         ( unsigned       ,ui, 0, 4), \
-         ( long           ,sl, 0, 5), \
-         ( unsigned long  ,ul, 0, 6), \
-         ( float          ,fl, 1, 7), \
-         ( double         ,db, 1, 8), \
-         ( long double    ,ld, 1, 9) \
-      ) \
-   ) \
-   /**/
-#
-# /* Type int is needed in some type computations. */
-# define TYPE_INT (int, si, 0, 3)
-#
-# /* Type computation macros. */
-# define TYPE_OF_INTEGER_PROMOTION(T) \
-   BOOST_PP_IF( \
-      BOOST_PP_LESS(TYPE_RANK(T), TYPE_RANK(TYPE_INT)), \
-      TYPE_INT, T \
-   ) \
-   /**/
-# define TYPE_OF_USUAL_ARITHMETIC_CONVERSION(L, R) \
-   TYPE_OF_INTEGER_PROMOTION( \
-      BOOST_PP_IF( \
-         BOOST_PP_LESS(TYPE_RANK(L), TYPE_RANK(R)), \
-         R, L \
-      ) \
-   ) \
-   /**/
-# define TYPE_OF_UNARY_OP(O, T) \
-   BOOST_PP_IF( \
-      OP_IS_LOGICAL(O), \
-      TYPE_INT, TYPE_OF_INTEGER_PROMOTION(T) \
-   ) \
-   /**/
-# define TYPE_OF_BINARY_OP(O, L, R) \
-   BOOST_PP_IF( \
-      OP_IS_LOGICAL(O), TYPE_INT, \
-      BOOST_PP_IF( \
-         OP_IS_SHIFT(O), \
-         TYPE_OF_INTEGER_PROMOTION(L), \
-         TYPE_OF_USUAL_ARITHMETIC_CONVERSION(L,R) \
-      ) \
-   ) \
-   /**/
-# define IS_VALID_UNARY_OP_AND_TYPE_COMBINATION(O, T) \
-   BOOST_PP_IF( \
-      TYPE_IS_FLOATING(T), \
-      OP_IS_FLOATING(O), 1 \
-   ) \
-   /**/
-# define IS_VALID_BINARY_OP_AND_TYPE_COMBINATION(O, L, R) \
-   BOOST_PP_IF( \
-      BOOST_PP_OR(TYPE_IS_FLOATING(L), TYPE_IS_FLOATING(R)), \
-      OP_IS_FLOATING(O), 1 \
-   ) \
-   /**/
-#
-# /* Generates code for all unary operators and integral types. */
-# define UNARY_ARRAY_OP(_, OT) \
-   BOOST_PP_IF( \
-      IS_VALID_UNARY_OP_AND_TYPE_COMBINATION OT, \
-      UNARY_ARRAY_OP_CODE, BOOST_PP_TUPLE_EAT(2) \
-   ) OT \
-   /**/
-# define UNARY_ARRAY_OP_CODE(O, T) \
-   void BOOST_PP_LIST_CAT(BOOST_PP_TUPLE_TO_LIST(4, (array_, OP_NAME(O), _, TYPE_ABBREVIATION(T)))) \
-   (const TYPE_NAME(T)* in, TYPE_NAME(TYPE_OF_UNARY_OP(O, T))* out, unsigned n) { \
-      do { \
-         *out++ = OP_SYMBOL(O) *in++; \
-      } while (--n); \
-   } \
-   /**/
-BOOST_PP_LIST_FOR_EACH_PRODUCT(UNARY_ARRAY_OP, 2, (APPLICATIVE_UNARY_OPS, BUILTIN_TYPES))
-# /* Generates code for all binary operators and integral type pairs. */
-# define BINARY_ARRAY_OP(_, OLR) \
-   BOOST_PP_IF( \
-      IS_VALID_BINARY_OP_AND_TYPE_COMBINATION OLR, \
-      BINARY_ARRAY_OP_CODE, BOOST_PP_TUPLE_EAT(3) \
-   ) OLR \
-   /**/
-# define BINARY_ARRAY_OP_CODE(O, L, R) \
-   void BOOST_PP_LIST_CAT( \
-      BOOST_PP_TUPLE_TO_LIST( \
-         6, (array_, OP_NAME(O), _, TYPE_ABBREVIATION(L), _, TYPE_ABBREVIATION(R)) \
-      ) \
-   )(const TYPE_NAME(L)* lhs_in, const TYPE_NAME(R)* rhs_in, TYPE_NAME(TYPE_OF_BINARY_OP(O, L, R))* out, unsigned n) { \
-      do { \
-         *out++ = *lhs_in OP_SYMBOL(O) *rhs_in; \
-         ++lhs_in; \
-         ++rhs_in; \
-      } while (--n); \
-   } \
-   /**/
-BOOST_PP_LIST_FOR_EACH_PRODUCT(BINARY_ARRAY_OP, 3, (APPLICATIVE_BINARY_OPS, BUILTIN_TYPES, BUILTIN_TYPES))