Merge branch 'develop'

Merge branch 'develop' of https://github.com/boostorg/preprocessor into develop
Removing any forcing of C++ levels.
2026-04-12 21:05:47 +02:00 · 2018-10-25 19:41:15 -04:00 · 2018-10-25 16:58:28 -04:00 · 2018-10-25 16:57:55 -04:00 · 2018-10-23 09:49:20 -04:00 · 2018-10-20 14:02:20 -04:00
268 changed files with 12042 additions and 2839 deletions
--- a/.travis.yml
+++ b/.travis.yml
@@ -0,0 +1,48 @@
+# Copyright 2016 Edward Diener
+# Distributed under the Boost Software License, Version 1.0.
+# (See accompanying file LICENSE_1_0.txt or copy at http://boost.org/LICENSE_1_0.txt)
+
+language: cpp
+
+sudo: false
+
+python: "2.7"
+
+os:
+  - linux
+  - osx
+
+branches:
+  only:
+    - master
+    - develop
+
+matrix:
+  include:
+    - install: true
+      script:
+        - mkdir __build__ && cd __build__
+        - cmake ../test
+        - cmake --build .
+
+
+install:
+  - cd ..
+  - git clone -b $TRAVIS_BRANCH --depth 1 https://github.com/boostorg/boost.git boost-root
+  - cd boost-root
+  - git submodule update --init tools/build
+  - git submodule update --init libs/config
+  - git submodule update --init tools/boostdep
+  - cp -r $TRAVIS_BUILD_DIR/* libs/preprocessor
+  - python tools/boostdep/depinst/depinst.py preprocessor
+  - ./bootstrap.sh
+  - ./b2 headers
+
+script:
+  - TOOLSET=gcc,clang
+  - if [ $TRAVIS_OS_NAME == osx ]; then TOOLSET=clang; fi
+  - ./b2 libs/preprocessor/test toolset=$TOOLSET
+
+notifications:
+  email:
+    on_success: always
--- a/CMakeLists.txt
+++ b/CMakeLists.txt
@@ -0,0 +1,12 @@
+# Copyright 2018 Mike Dev
+# 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
+
+cmake_minimum_required(VERSION 3.5)
+project(BoostPreprocessor LANGUAGES CXX)
+
+add_library(boost_preprocessor INTERFACE)
+add_library(Boost::preprocessor ALIAS boost_preprocessor)
+
+target_include_directories(boost_preprocessor INTERFACE include)
+
--- a/appveyor.yml
+++ b/appveyor.yml
@@ -0,0 +1,60 @@
+# Copyright 2017 Edward Diener
+# Copyright 2018 Mike Dev
+# Distributed under the Boost Software License, Version 1.0.
+# (See accompanying file LICENSE_1_0.txt or copy at http://boost.org/LICENSE_1_0.txt)
+
+version: 1.0.{build}-{branch}
+
+shallow_clone: true
+
+configuration:
+  - boost_test
+  - cmake_self_test
+
+branches:
+  only:
+    - master
+    - develop
+
+environment:
+  matrix:
+    - APPVEYOR_BUILD_WORKER_IMAGE: Visual Studio 2015
+      TOOLSET: msvc-9.0,msvc-10.0,msvc-11.0,msvc-12.0,msvc-14.0
+    - APPVEYOR_BUILD_WORKER_IMAGE: Visual Studio 2017
+      TOOLSET: msvc-14.1
+
+build: off
+
+for:
+-
+  matrix:
+    only:
+      - configuration: cmake_self_test
+
+  test_script:
+    - mkdir __build__
+    - cd __build__
+    - cmake ../test
+    - cmake --build .
+
+-
+  matrix:
+    only:
+      - configuration: boost_test
+
+  install:
+    - cd ..
+    - git clone -b %APPVEYOR_REPO_BRANCH% https://github.com/boostorg/boost.git boost-root
+    - cd boost-root
+    - git submodule update --init tools/build
+    - git submodule update --init libs/config
+    - git submodule update --init tools/boostdep
+    - xcopy /s /e /q %APPVEYOR_BUILD_FOLDER% libs\preprocessor
+    - python tools/boostdep/depinst/depinst.py preprocessor
+    - bootstrap
+    - b2 headers
+
+  test_script:
+    - b2 libs/preprocessor/test toolset=%TOOLSET%
+    - cd ../preprocessor/test
+
--- a/doc/AppendixA-AnIntroductiontoPreprocessorMetaprogramming.html
+++ b/doc/AppendixA-AnIntroductiontoPreprocessorMetaprogramming.html
--- a/doc/contents.html
+++ b/doc/contents.html
@@ -1,29 +1,38 @@
 <html>
-<head>
-	<title>contents.html</title>
-	<link rel="stylesheet" type="text/css" href="styles.css">
-	<style>
+  <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="http://boost-consulting.com/tmpbook/preprocessor.html" target="_top">Introduction</a></h4>
-<h4><a href="topics.html">Topics</h4>
-<h4><a href="terms.html">Terminology</h4>
-<h4><a href="data.html">Data Types</h4>
-<h4><a href="ref.html">Reference</h4>
-<h4><a href="headers.html">Headers</h4>
-<h4><a href="examples.html">Examples</h4>
-<h4><a href="miscellanea.html">Miscellanea</h4>
-
-<!--
-© 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>	
+  </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>
--- a/doc/data/arrays.html
+++ b/doc/data/arrays.html
@@ -1,53 +1,55 @@
 <html>
-<head>
-	<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.
-	</div>
-	<div>
-		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>
+  <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>
--- a/doc/data/lists.html
+++ b/doc/data/lists.html
@@ -1,46 +1,42 @@
 <html>
-<head>
-	<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.
-	</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>
+  <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>
--- a/doc/data/sequences.html
+++ b/doc/data/sequences.html
@@ -1,30 +1,23 @@
 <html>
-	<head>
-		<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> 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)
+  <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                  ^

@@ -41,35 +34,27 @@ 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>
+</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>
--- a/doc/data/tuples.html
+++ b/doc/data/tuples.html
@@ -1,42 +1,42 @@
 <html>
-<head>
-	<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>.
-	</div>
-	<div>
-		<i>Tuples</i> are fast and easy to use.&nbsp;
-		However, all access to <i>tuples</i> requires knowledge of its size.
-	</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>
+  <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>
--- a/doc/headers.html
+++ b/doc/headers.html
@@ -1,216 +1,249 @@
 <html>
-	<head>
-		<title>headers.html</title>
-		<link rel="stylesheet" type="text/css" href="styles.css">
-			<base target="desc">
-			<style>
+  <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/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><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><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><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_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/paren.html">paren.hpp</a></li>
-				<li class="ps"><a href="headers/punctuation/paren_if.html">paren_if.hpp</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_tuple.html">to_tuple.hpp</a></li>
-				<li class="ps"><a href="headers/seq/transform.html">transform.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/elem.html">elem.hpp</a></li>
-				<li class="ps"><a href="headers/tuple/eat.html">eat.hpp</a></li>
-				<li class="ps"><a href="headers/tuple/rem.html">rem.hpp</a></li>
-				<li class="ps"><a href="headers/tuple/reverse.html">reverse.hpp</a></li>
-				<li class="ps"><a href="headers/tuple/to_list.html">to_list.hpp</a></li>
-				<li class="ps"><a href="headers/tuple/to_seq.html">to_seq.hpp</a></li>
-			<li><a href="headers/stringize.html">stringize.hpp</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>
+  </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>
--- a/doc/headers/array.html
+++ b/doc/headers/array.html
@@ -1,10 +1,10 @@
 <html>
 <head>
-	<title>array.hpp</title>
+    <title>array.hpp</title>
 	<link rel="stylesheet" type="text/css" href="../styles.css">
 </head>
 <body>
-	<div style="margin-left:  0px;">
+	<div style="margin-left: 0px;">
 		The <b>array.hpp</b> includes the headers in the <i>array</i> folder. 
 	</div>
 	<h4>Usage</h4>
@@ -15,6 +15,7 @@
 		<ul>
 			<li><a href="array/data.html">&lt;boost/preprocessor/array/data.hpp&gt;</a></li>
 			<li><a href="array/elem.html">&lt;boost/preprocessor/array/elem.hpp&gt;</a></li>
+            <li><a href="array/enum.html">&lt;boost/preprocessor/array/enum.hpp&gt;</a></li>
 			<li><a href="array/insert.html">&lt;boost/preprocessor/array/insert.hpp&gt;</a></li>
 			<li><a href="array/pop_back.html">&lt;boost/preprocessor/array/pop_back.hpp&gt;</a></li>
 			<li><a href="array/pop_front.html">&lt;boost/preprocessor/array/pop_front.hpp&gt;</a></li>
@@ -24,17 +25,19 @@
 			<li><a href="array/replace.html">&lt;boost/preprocessor/array/replace.hpp&gt;</a></li>
 			<li><a href="array/reverse.html">&lt;boost/preprocessor/array/reverse.hpp&gt;</a></li>
 			<li><a href="array/size.html">&lt;boost/preprocessor/array/size.hpp&gt;</a></li>
+            <li><a href="array/to_list.html">&lt;boost/preprocessor/array/to_list.hpp&gt;</a></li>
+            <li><a href="array/to_seq.html">&lt;boost/preprocessor/array/to_seq.hpp&gt;</a></li>
+            <li><a href="array/to_tuple.html">&lt;boost/preprocessor/array/to_tuple.hpp&gt;</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>
+		<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>
+		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>
--- a/doc/headers/array/enum.html
+++ b/doc/headers/array/enum.html
@@ -0,0 +1,24 @@
+<html>
+<head>
+  <title>array/enum.hpp</title>
+  <link rel="stylesheet" type="text/css" href="../../styles.css">
+</head>
+<body>
+<div style="margin-left: 0px;"> The <b>array/enum.hpp</b> header
+defines a macro to convert an <i>array</i> to its comma-separated elements. </div>
+<h4>Usage</h4>
+<div class="code"> #include <b>&lt;boost/preprocessor/array/enum.hpp&gt;</b>
+</div>
+<h4>Contents</h4>
+<ul>
+  <li><a href="../../ref/array_enum.html">BOOST_PP_ARRAY_ENUM</a></li>
+</ul>
+<hr size="1">
+<div style="margin-left: 0px;"> <i></i><i>© Copyright Edward Diener 2011</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>
--- a/doc/headers/array/to_list.html
+++ b/doc/headers/array/to_list.html
@@ -0,0 +1,24 @@
+<html>
+<head>
+  <title>array/to_list.hpp</title>
+  <link rel="stylesheet" type="text/css" href="../../styles.css">
+</head>
+<body>
+<div style="margin-left: 0px;"> The <b>array/to_list.hpp</b> header
+defines a macro that converts an <i>array</i> to a <i>list</i>. </div>
+<h4>Usage</h4>
+<div class="code"> #include <b>&lt;boost/preprocessor/array/to_list.hpp&gt;</b>
+</div>
+<h4>Contents</h4>
+<ul>
+  <li><a href="../../ref/array_to_list.html">BOOST_PP_ARRAY_TO_LIST</a></li>
+</ul>
+<hr size="1">
+<div style="margin-left: 0px;"> <i></i><i>© Copyright Edward Diener 2011</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>
--- a/doc/headers/array/to_seq.html
+++ b/doc/headers/array/to_seq.html
@@ -0,0 +1,24 @@
+<html>
+<head>
+  <title>array/to_seq.hpp</title>
+  <link rel="stylesheet" type="text/css" href="../../styles.css">
+</head>
+<body>
+<div style="margin-left: 0px;"> The <b>array/to_seq.hpp</b> header
+defines a macro that converts an <i>array</i> to a <i>seq.</i> </div>
+<h4>Usage</h4>
+<div class="code"> #include <b>&lt;boost/preprocessor/array/to_seq.hpp&gt;</b>
+</div>
+<h4>Contents</h4>
+<ul>
+  <li><a href="../../ref/array_to_seq.html">BOOST_PP_ARRAY_TO_SEQ</a></li>
+</ul>
+<hr size="1">
+<div style="margin-left: 0px;"> <i></i><i>© Copyright Edward Diener 2011</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>
--- a/doc/headers/array/to_tuple.html
+++ b/doc/headers/array/to_tuple.html
@@ -0,0 +1,24 @@
+<html>
+  <head>
+  <title>array/to_tuple.hpp</title>
+  <link rel="stylesheet" type="text/css" href="../../styles.css">
+</head>
+<body>
+<div style="margin-left: 0px;"> The <b>array/to_tuple.hpp</b> header
+defines a macro that converts an <i>array </i>to a <i>tuple</i>. </div>
+<h4>Usage</h4>
+<div class="code"> #include <b>&lt;boost/preprocessor/array/to_tuple.hpp&gt;</b>
+</div>
+<h4>Contents</h4>
+<ul>
+  <li><a href="../../ref/array_to_tuple.html">BOOST_PP_ARRAY_TO_TUPLE</a></li>
+</ul>
+<hr size="1">
+<div style="margin-left: 0px;"> <i></i><i>© Copyright Edward Diener 2011</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>
--- a/doc/headers/config/limits.html
+++ b/doc/headers/config/limits.html
@@ -1,44 +1,44 @@
 <html>
-	<head>
-		<title>config/limits.hpp</title>
-		<link rel="stylesheet" type="text/css" href="../../styles.css">
-	</head>
-	<body>
-		<div style="margin-left:  0px;">
-			The <b>config/limits.hpp</b> header defines various library limits.
-		</div>
-		<h4>
-			Usage
-		</h4>
-		<div class="code">
-			#include <b>&lt;boost/preprocessor/config/limits.hpp&gt;</b>
-		</div>
-		<h4>
-			Contents
-		</h4>
-		<ul>
-			<li><a href="../../ref/limit_dim.html">BOOST_PP_LIMIT_DIM</a></li>
-			<li><a href="../../ref/limit_for.html">BOOST_PP_LIMIT_FOR</a></li>
-			<li><a href="../../ref/limit_iteration.html">BOOST_PP_LIMIT_ITERATION</a></li>
-			<li><a href="../../ref/limit_iteration_dim.html">BOOST_PP_LIMIT_ITERATION_DIM</a></li>
-			<li><a href="../../ref/limit_mag.html">BOOST_PP_LIMIT_MAG</a></li>
-			<li><a href="../../ref/limit_repeat.html">BOOST_PP_LIMIT_REPEAT</a></li>
-			<li><a href="../../ref/limit_seq.html">BOOST_PP_LIMIT_SEQ</a></li>
-			<li><a href="../../ref/limit_slot_count.html">BOOST_PP_LIMIT_SLOT_COUNT</a></li>
-			<li><a href="../../ref/limit_slot_sig.html">BOOST_PP_LIMIT_SLOT_SIG</a></li>
-			<li><a href="../../ref/limit_tuple.html">BOOST_PP_LIMIT_TUPLE</a></li>
-			<li><a href="../../ref/limit_while.html">BOOST_PP_LIMIT_WHILE</a></li>
-		</ul>
+<head>
+    <title>config/limits.hpp</title>
+    <link rel="stylesheet" type="text/css" href="../../styles.css">
+</head>
+<body>
+	<div style="margin-left: 0px;">
+		The <b>config/limits.hpp</b> header defines various library limits.
+	</div>
+	<h4>
+		Usage
+	</h4>
+	<div class="code">
+		#include <b>&lt;boost/preprocessor/config/limits.hpp&gt;</b>
+	</div>
+	<h4>
+		Contents
+	</h4>
+	<ul>
+		<li><a href="../../ref/limit_dim.html">BOOST_PP_LIMIT_DIM</a></li>
+		<li><a href="../../ref/limit_for.html">BOOST_PP_LIMIT_FOR</a></li>
+		<li><a href="../../ref/limit_iteration.html">BOOST_PP_LIMIT_ITERATION</a></li>
+		<li><a href="../../ref/limit_iteration_dim.html">BOOST_PP_LIMIT_ITERATION_DIM</a></li>
+		<li><a href="../../ref/limit_mag.html">BOOST_PP_LIMIT_MAG</a></li>
+		<li><a href="../../ref/limit_repeat.html">BOOST_PP_LIMIT_REPEAT</a></li>
+		<li><a href="../../ref/limit_seq.html">BOOST_PP_LIMIT_SEQ</a></li>
+		<li><a href="../../ref/limit_slot_count.html">BOOST_PP_LIMIT_SLOT_COUNT</a></li>
+		<li><a href="../../ref/limit_slot_sig.html">BOOST_PP_LIMIT_SLOT_SIG</a></li>
+		<li><a href="../../ref/limit_tuple.html">BOOST_PP_LIMIT_TUPLE</a></li>
+		<li><a href="../../ref/limit_while.html">BOOST_PP_LIMIT_WHILE</a></li>
+        <li><a href="../../ref/limit_variadic.html">BOOST_PP_LIMIT_VARIADIC</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>
+		<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>
+		copy at <a href="http://www.boost.org/LICENSE_1_0.txt">www.boost.org/LICENSE_1_0.txt</a>)</small></p>
 	</div>
-	</body>
+</body>
 </html>
--- a/doc/headers/config/variadics.html
+++ b/doc/headers/config/variadics.html
@@ -0,0 +1,32 @@
+<html>
+<head>
+  <title>config/config.hpp</title>
+  <link rel="stylesheet" type="text/css" href="../../styles.css">
+</head>
+<body>
+		<div style="margin-left: 0px;">
+			The <b>config/config.hpp</b>
+header defines internal configuration macros as well as a macro for determining variadic macro support. The file
+is automatically included whenever any Boost PP macros are used. The end-user can manually
+include it in order to use the BOOST_PP_VARIADICS macro, but normally should never have to do so. </div>
+		<h4>
+			Usage
+		</h4>
+		<div class="code">
+			#include <b>&lt;boost/preprocessor/config/config.hpp&gt;</b>
+		</div>
+		<h4>
+			Contents
+		</h4>
+		<ul>
+			<li><a href="../../ref/variadics.html">BOOST_PP_VARIADICS</a></li></ul>
+	<hr size="1">
+	<div style="margin-left: 0px;"><i>© Copyright Edward Diener 2011,2014</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>
--- a/doc/headers/facilities.html
+++ b/doc/headers/facilities.html
@@ -1,10 +1,10 @@
 <html>
 <head>
-	<title>facilities.hpp</title>
+    <title>facilities.hpp</title>
 	<link rel="stylesheet" type="text/css" href="../styles.css">
 </head>
 <body>
-	<div style="margin-left:  0px;">
+	<div style="margin-left: 0px;">
 		The <b>facilities.hpp</b> includes the headers in the <i>facilities</i> folder. 
 	</div>
 	<h4>Usage</h4>
@@ -18,17 +18,17 @@
 			<li><a href="facilities/expand.html">&lt;boost/preprocessor/facilities/expand.hpp&gt;</a></li>
 			<li><a href="facilities/identity.html">&lt;boost/preprocessor/facilities/identity.hpp&gt;</a></li>
 			<li><a href="facilities/intercept.html">&lt;boost/preprocessor/facilities/intercept.hpp&gt;</a></li>
+            <li><a href="facilities/overload.html">&lt;boost/preprocessor/facilities/overload.hpp&gt;</a> <a href="../topics/variadic_macros.html#VNotation" target="_self">(v)</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>
+		<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>
+		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>
--- a/doc/headers/facilities/identity.html
+++ b/doc/headers/facilities/identity.html
@@ -5,7 +5,7 @@
 </head>
 <body>
 	<div style="margin-left:  0px;">
-		The <b>facilities/identity.hpp</b> header defines a utility macro to use with <b>BOOST_PP_IF</b> and <b>BOOST_PP_IIF</b>.
+		The <b>facilities/identity.hpp</b> header defines utility macros to use with <b>BOOST_PP_IF</b> and <b>BOOST_PP_IIF</b>.
 	</div>
 	<h4>Usage</h4>
 		<div class="code">
@@ -14,11 +14,13 @@
 	<h4>Contents</h4>
 		<ul>
 			<li><a href="../../ref/identity.html">BOOST_PP_IDENTITY</a></li>
+			<li><a href="../../ref/identity_n.html">BOOST_PP_IDENTITY_N</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>
+		</br><i>© Copyright Edward Diener 2015</i>
 	</div>
 	<div style="margin-left: 0px;">
 		<p><small>Distributed under the Boost Software License, Version 1.0. (See
--- a/doc/headers/facilities/overload.html
+++ b/doc/headers/facilities/overload.html
@@ -0,0 +1,28 @@
+<html>
+  <head>
+    <title>facilities/overload.hpp</title>
+	<link rel="stylesheet" type="text/css" href="../../styles.css">
+  </head>
+  <body>
+	<div style="margin-left: 0px;">
+		The <b>facilities/overload.hpp</b> header defines variadic macros that overload non-variadic macros to accept different numbers of parameters.
+	</div>
+	<h4>Usage</h4>
+		<div class="code">
+			#include <b>&lt;boost/preprocessor/facilities/overload.hpp&gt;</b>
+		</div>
+	<h4>Contents</h4>
+		<ul>
+			<li><a href="../../ref/overload.html">BOOST_PP_OVERLOAD</a> <a href="../../topics/variadic_macros.html#VNotation" target="_self">(v)</a></li>
+		</ul>
+	<hr size="1">
+	<div style="margin-left: 0px;">
+		<i></i><i>© Copyright Edward Diener 2011,2013</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>
--- a/doc/headers/list.html
+++ b/doc/headers/list.html
@@ -1,10 +1,10 @@
 <html>
 <head>
-	<title>list.hpp</title>
+    <title>list.hpp</title>
 	<link rel="stylesheet" type="text/css" href="../styles.css">
 </head>
 <body>
-	<div style="margin-left:  0px;">
+	<div style="margin-left: 0px;">
 		The <b>list.hpp</b> includes the headers in the <i>list</i> folder. 
 	</div>
 	<h4>Usage</h4>
@@ -28,19 +28,20 @@
 			<li><a href="list/rest_n.html">&lt;boost/preprocessor/list/rest_n.hpp&gt;</a></li>
 			<li><a href="list/reverse.html">&lt;boost/preprocessor/list/reverse.hpp&gt;</a></li>
 			<li><a href="list/size.html">&lt;boost/preprocessor/list/size.hpp&gt;</a></li>
+            <li><a href="list/to_array.html">&lt;boost/preprocessor/list/to_array.hpp&gt;</a></li>
+            <li><a href="list/to_seq.html">&lt;boost/preprocessor/list/to_seq.hpp&gt;</a></li>
 			<li><a href="list/to_tuple.html">&lt;boost/preprocessor/list/to_tuple.hpp&gt;</a></li>
 			<li><a href="list/transform.html">&lt;boost/preprocessor/list/transform.hpp&gt;</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>
+		<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>
+		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>
--- a/doc/headers/list/to_array.html
+++ b/doc/headers/list/to_array.html
@@ -0,0 +1,29 @@
+<html>
+<head>
+  <title>list/to_array.hpp</title>
+  <link rel="stylesheet" type="text/css" href="../../styles.css">
+</head>
+<body>
+	<div style="margin-left: 0px;">
+		The <b>list/to_array.hpp</b> header defines a macro to convert a <i>list</i> to an <i>array</i>.
+	</div>
+	<h4>Usage</h4>
+		<div class="code">
+			#include <b>&lt;boost/preprocessor/list/to_array.hpp&gt;</b>
+		</div>
+	<h4>Contents</h4>
+		<ul>
+			<li><a href="../../ref/list_to_array.html">BOOST_PP_LIST_TO_ARRAY</a></li>
+			<li><a href="../../ref/list_to_array_d.html">BOOST_PP_LIST_TO_ARRAY_D</a></li>
+		</ul>
+	<hr size="1">
+	<div style="margin-left: 0px;">
+		<i></i><i>© Copyright Edward Diener 2011</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>
--- a/doc/headers/list/to_seq.html
+++ b/doc/headers/list/to_seq.html
@@ -0,0 +1,25 @@
+<html><head>
+  <title>list/to_seq.hpp</title>
+	<link rel="stylesheet" type="text/css" href="../../styles.css"></head><body>
+	<div style="margin-left: 0px;">
+		The <b>list/to_seq.hpp</b> header defines a macro to convert a <i>list</i> to a <i>seq</i>.
+	</div>
+	<h4>Usage</h4>
+		<div class="code">
+			#include <b>&lt;boost/preprocessor/list/to_seq.hpp&gt;</b>
+		</div>
+	<h4>Contents</h4>
+		<ul>
+			<li><a href="../../ref/list_to_seq.html">BOOST_PP_LIST_TO_SEQ</a></li>
+			<li><a href="../../ref/list_to_seq.html">BOOST_PP_LIST_TO_SEQ_R</a></li>
+		</ul>
+	<hr size="1">
+	<div style="margin-left: 0px;">
+		<i></i><i>© Copyright Edward Diener 2011</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>
--- a/doc/headers/punctuation/is_begin_parens.html
+++ b/doc/headers/punctuation/is_begin_parens.html
@@ -0,0 +1,26 @@
+<html>
+  <head>
+    <meta content="text/html; charset=windows-1252" http-equiv="content-type">
+    <title>punctuation/is_begin_parens.hpp</title>
+    <link rel="stylesheet" type="text/css" href="../../styles.css">
+  </head>
+  <body>
+    <div style="margin-left:  0px;"> The <b>punctuation/is_begin_parens.hpp</b>
+      header defines a macro that determines if variadic data begins with a
+      parenthesis.</div>
+    <h4>Usage</h4>
+    <div class="code"> #include <b>&lt;boost/preprocessor/punctuation/is_begin_parens.hpp&gt;</b>
+    </div>
+    <h4>Contents</h4>
+    <ul>
+      <li><a href="../../ref/is_begin_parens.html">BOOST_PP_IS_BEGIN_PARENS</a></li>
+    </ul>
+    <hr size="1">
+    <div style="margin-left: 0px;"> <i>© Copyright Edward Diener 2014</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>
--- a/doc/headers/punctuation/remove_parens.html
+++ b/doc/headers/punctuation/remove_parens.html
@@ -0,0 +1,26 @@
+<html>
+  <head>
+    <meta content="text/html; charset=windows-1252" http-equiv="content-type">
+    <title>punctuation/remove_parens.hpp</title>
+    <link rel="stylesheet" type="text/css" href="../../styles.css">
+  </head>
+  <body>
+    <div style="margin-left:  0px;"> The <b>punctuation/remove_parens.hpp</b>
+      header defines a macro that removes the beginning parenthesis from its
+      input if it exists.</div>
+    <h4>Usage</h4>
+    <div class="code"> #include <b>&lt;boost/preprocessor/punctuation/remove_parens.hpp&gt;</b>
+    </div>
+    <h4>Contents</h4>
+    <ul>
+      <li><a href="../../ref/remove_parens.html">BOOST_PP_REMOVE_PARENS</a></li>
+    </ul>
+    <hr size="1">
+    <div style="margin-left: 0px;"> <i>© Copyright Edward Diener 2014</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>
--- a/doc/headers/seq.html
+++ b/doc/headers/seq.html
@@ -1,83 +1,86 @@
 <html>
-	<head>
-		<title>seq.hpp</title>
-		<link rel="stylesheet" type="text/css" href="../styles.css">
-	</head>
-	<body>
-		<div style="margin-left:  0px;">
-			The <b>seq.hpp</b> includes the headers in the <i>seq</i> folder.
-		</div>
-		<h4>
-			Usage
-		</h4>
-		<div class="code">
-			#include <b>&lt;boost/preprocessor/seq.hpp&gt;</b>
-		</div>
-		<h4>
-			Includes
-		</h4>
-		<ul>
-			<li>
-				<a href="seq/cat.html">&lt;boost/preprocessor/seq/cat.hpp&gt;</a></li>
-			<li>
-				<a href="seq/elem.html">&lt;boost/preprocessor/seq/elem.hpp&gt;</a></li>
-			<li>
-				<a href="seq/enum.html">&lt;boost/preprocessor/seq/enum.hpp&gt;</a></li>
-			<li>
-				<a href="seq/filter.html">&lt;boost/preprocessor/seq/filter.hpp&gt;</a></li>
-			<li>
-				<a href="seq/first_n.html">&lt;boost/preprocessor/seq/first_n.hpp&gt;</a></li>
-			<li>
-				<a href="seq/fold_left.html">&lt;boost/preprocessor/seq/fold_left.hpp&gt;</a></li>
-			<li>
-				<a href="seq/fold_right.html">&lt;boost/preprocessor/seq/fold_right.hpp&gt;</a></li>
-			<li>
-				<a href="seq/for_each.html">&lt;boost/preprocessor/seq/for_each.hpp&gt;</a></li>
-			<li>
-				<a href="seq/for_each_i.html">&lt;boost/preprocessor/seq/for_each_i.hpp&gt;</a></li>
-			<li>
-				<a href="seq/for_each_product.html">&lt;boost/preprocessor/seq/for_each_product.hpp&gt;</a></li>
-			<li>
-				<a href="seq/insert.html">&lt;boost/preprocessor/seq/insert.hpp&gt;</a></li>
-			<li>
-				<a href="seq/pop_back.html">&lt;boost/preprocessor/seq/pop_back.hpp&gt;</a></li>
-			<li>
-				<a href="seq/pop_front.html">&lt;boost/preprocessor/seq/pop_front.hpp&gt;</a></li>
-			<li>
-				<a href="seq/push_back.html">&lt;boost/preprocessor/seq/push_back.hpp&gt;</a></li>
-			<li>
-				<a href="seq/push_front.html">&lt;boost/preprocessor/seq/push_front.hpp&gt;</a></li>
-			<li>
-				<a href="seq/remove.html">&lt;boost/preprocessor/seq/remove.hpp&gt;</a></li>
-			<li>
-				<a href="seq/replace.html">&lt;boost/preprocessor/seq/replace.hpp&gt;</a></li>
-			<li>
-				<a href="seq/rest_n.html">&lt;boost/preprocessor/seq/rest_n.hpp&gt;</a></li>
-			<li>
-				<a href="seq/reverse.html">&lt;boost/preprocessor/seq/reverse.hpp&gt;</a></li>
-			<li>
-				<a href="seq/seq.html">&lt;boost/preprocessor/seq/seq.hpp&gt;</a></li>
-			<li>
-				<a href="seq/size.html">&lt;boost/preprocessor/seq/size.hpp&gt;</a></li>
-			<li>
-				<a href="seq/subseq.html">&lt;boost/preprocessor/seq/subseq.hpp&gt;</a></li>
-			<li>
-				<a href="seq/to_array.html">&lt;boost/preprocessor/seq/to_array.hpp&gt;</a></li>
-			<li>
-				<a href="seq/to_tuple.html">&lt;boost/preprocessor/seq/to_tuple.hpp&gt;</a></li>
-			<li>
-				<a href="seq/transform.html">&lt;boost/preprocessor/seq/transform.hpp&gt;</a></li>
-		</ul>
-	<hr size="1">
+<head>
+    <title>seq.hpp</title>
+	<link rel="stylesheet" type="text/css" href="../styles.css">
+</head>
+<body>
 	<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>
+		The <b>seq.hpp</b> includes the headers in the <i>seq</i> folder.
 	</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>
+	<h4>
+		Usage
+	</h4>
+	<div class="code">
+		#include <b>&lt;boost/preprocessor/seq.hpp&gt;</b>
 	</div>
-	</body>
+	<h4>
+		Includes
+	</h4>
+	<ul>
+		<li>
+			<a href="seq/cat.html">&lt;boost/preprocessor/seq/cat.hpp&gt;</a></li>
+		<li>
+			<a href="seq/elem.html">&lt;boost/preprocessor/seq/elem.hpp&gt;</a></li>
+		<li>
+			<a href="seq/enum.html">&lt;boost/preprocessor/seq/enum.hpp&gt;</a></li>
+		<li>
+			<a href="seq/filter.html">&lt;boost/preprocessor/seq/filter.hpp&gt;</a></li>
+		<li>
+			<a href="seq/first_n.html">&lt;boost/preprocessor/seq/first_n.hpp&gt;</a></li>
+		<li>
+			<a href="seq/fold_left.html">&lt;boost/preprocessor/seq/fold_left.hpp&gt;</a></li>
+		<li>
+			<a href="seq/fold_right.html">&lt;boost/preprocessor/seq/fold_right.hpp&gt;</a></li>
+		<li>
+			<a href="seq/for_each.html">&lt;boost/preprocessor/seq/for_each.hpp&gt;</a></li>
+		<li>
+			<a href="seq/for_each_i.html">&lt;boost/preprocessor/seq/for_each_i.hpp&gt;</a></li>
+		<li>
+			<a href="seq/for_each_product.html">&lt;boost/preprocessor/seq/for_each_product.hpp&gt;</a></li>
+		<li>
+			<a href="seq/insert.html">&lt;boost/preprocessor/seq/insert.hpp&gt;</a></li>
+		<li>
+			<a href="seq/pop_back.html">&lt;boost/preprocessor/seq/pop_back.hpp&gt;</a></li>
+		<li>
+			<a href="seq/pop_front.html">&lt;boost/preprocessor/seq/pop_front.hpp&gt;</a></li>
+		<li>
+			<a href="seq/push_back.html">&lt;boost/preprocessor/seq/push_back.hpp&gt;</a></li>
+		<li>
+			<a href="seq/push_front.html">&lt;boost/preprocessor/seq/push_front.hpp&gt;</a></li>
+		<li>
+			<a href="seq/remove.html">&lt;boost/preprocessor/seq/remove.hpp&gt;</a></li>
+		<li>
+			<a href="seq/replace.html">&lt;boost/preprocessor/seq/replace.hpp&gt;</a></li>
+		<li>
+			<a href="seq/rest_n.html">&lt;boost/preprocessor/seq/rest_n.hpp&gt;</a></li>
+		<li>
+			<a href="seq/reverse.html">&lt;boost/preprocessor/seq/reverse.hpp&gt;</a></li>
+		<li>
+			<a href="seq/seq.html">&lt;boost/preprocessor/seq/seq.hpp&gt;</a></li>
+		<li>
+			<a href="seq/size.html">&lt;boost/preprocessor/seq/size.hpp&gt;</a></li>
+		<li>
+			<a href="seq/subseq.html">&lt;boost/preprocessor/seq/subseq.hpp&gt;</a></li>
+		<li>
+			<a href="seq/to_array.html">&lt;boost/preprocessor/seq/to_array.hpp&gt;</a></li>
+        <li>
+            <a href="seq/to_list.html">&lt;boost/preprocessor/seq/to_list.hpp&gt;</a></li>
+		<li>
+			<a href="seq/to_tuple.html">&lt;boost/preprocessor/seq/to_tuple.hpp&gt;</a></li>
+		<li>
+			<a href="seq/transform.html">&lt;boost/preprocessor/seq/transform.hpp&gt;</a></li>
+		<li>
+			<a href="seq/variadic_seq_to_seq.html">&lt;boost/preprocessor/seq/variadic_seq_to_seq.hpp&gt;</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>
--- a/doc/headers/seq/to_list.html
+++ b/doc/headers/seq/to_list.html
@@ -0,0 +1,30 @@
+<html><head>
+  <title>seq/to_list.hpp</title>
+		<link rel="stylesheet" type="text/css" href="../../styles.css"></head><body>
+		<div style="margin-left: 0px;">
+			The <b>seq/to_list.hpp</b> header defines a macro that converts a <i>seq</i> to 
+			a <i>list</i>.
+		</div>
+		<h4>
+			Usage
+		</h4>
+		<div class="code">
+			#include <b>&lt;boost/preprocessor/seq/to_list.hpp&gt;</b>
+		</div>
+		<h4>
+			Contents
+		</h4>
+		<ul>
+			<li>
+				<a href="../../ref/seq_to_list.html">BOOST_PP_SEQ_TO_LIST</a></li>
+		</ul>
+	<hr size="1">
+	<div style="margin-left: 0px;">
+		<i></i><i>© Copyright Edward Diener 2011</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>
--- a/doc/headers/seq/variadic_seq_to_seq.html
+++ b/doc/headers/seq/variadic_seq_to_seq.html
@@ -0,0 +1,34 @@
+<html>
+	<head>
+		<title>seq/variadic_seq_to_seq.hpp</title>
+		<link rel="stylesheet" type="text/css" href="../../styles.css">
+	</head>
+	<body>
+		<div style="margin-left:  0px;">
+			The <b>seq/variadic_seq_to_seq.hpp</b> header defines a macro that converts a <i>variadic seq</i> into a <i>seq</i>.
+		</div>
+		<h4>
+			Usage
+		</h4>
+		<div class="code">
+			#include <b>&lt;boost/preprocessor/seq/variadic_seq_to_seq.hpp&gt;</b>
+		</div>
+		<h4>
+			Contents
+		</h4>
+		<ul>
+			<li>
+				<a href="../../ref/variadic_seq_to_seq.html">BOOST_PP_VARIADIC_SEQ_TO_SEQ</a></li>
+		</ul>
+	<hr size="1">
+	<div style="margin-left: 0px;">
+		<i>© Copyright Paul Mensonides 2012</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>
--- a/doc/headers/tuple.html
+++ b/doc/headers/tuple.html
@@ -1,34 +1,59 @@
 <html>
-<head>
-	<title>tuple.hpp</title>
-	<link rel="stylesheet" type="text/css" href="../styles.css">
-</head>
-<body>
-	<div style="margin-left:  0px;">
-		The <b>tuple.hpp</b> includes the headers in the <i>tuple</i> folder. 
-	</div>
-	<h4>Usage</h4>
-		<div class="code">
-			#include <b>&lt;boost/preprocessor/tuple.hpp&gt;</b>
-		</div>
-	<h4>Includes</h4>
-		<ul>
-			<li><a href="tuple/elem.html">&lt;boost/preprocessor/tuple/elem.hpp&gt;</a></li>
-			<li><a href="tuple/eat.html">&lt;boost/preprocessor/tuple/eat.hpp&gt;</a></li>
-			<li><a href="tuple/rem.html">&lt;boost/preprocessor/tuple/rem.hpp&gt;</a></li>
-			<li><a href="tuple/reverse.html">&lt;boost/preprocessor/tuple/reverse.hpp&gt;</a></li>
-			<li><a href="tuple/to_list.html">&lt;boost/preprocessor/tuple/to_list.hpp&gt;</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>
+  <head>
+    <meta content="text/html; charset=windows-1252" http-equiv="content-type">
+    <title>tuple.hpp</title>
+    <link rel="stylesheet" type="text/css" href="../styles.css">
+  </head>
+  <body>
+    <div style="margin-left: 0px;"> The <b>tuple.hpp</b> includes the headers
+      in the <i>tuple</i> folder. </div>
+    <h4>Usage</h4>
+    <div class="code"> #include <b>&lt;boost/preprocessor/tuple.hpp&gt;</b> </div>
+    <h4>Includes</h4>
+    <ul>
+      <li><a href="tuple/eat.html">&lt;boost/preprocessor/tuple/eat.hpp&gt;</a>
+        <a href="../topics/variadic_macros.html#VNotation" target="_self">(v)</a></li>
+      <li><a href="tuple/elem.html">&lt;boost/preprocessor/tuple/elem.hpp&gt;</a>
+        <a href="../topics/variadic_macros.html#VNotation" target="_self">(v)</a></li>
+      <li><a href="tuple/enum.html">&lt;boost/preprocessor/tuple/enum.hpp&gt;</a>
+        <a href="../topics/variadic_macros.html#VNotation" target="_self">(v)</a></li>
+      <li><a href="tuple/insert.html">&lt;boost/preprocessor/tuple/insert.hpp&gt;</a>
+        <a href="../topics/variadic_macros.html#VNotation">(v)</a></li>
+      <li><a href="tuple/pop_back.html">&lt;boost/preprocessor/tuple/pop_back.hpp&gt;</a>
+        <a href="../topics/variadic_macros.html#VNotation">(v)</a></li>
+      <li><a href="tuple/pop_front.html">&lt;boost/preprocessor/tuple/pop_front.hpp&gt;</a>
+        <a href="../topics/variadic_macros.html#VNotation">(v)</a></li>
+      <li><a href="tuple/push_back.html">&lt;boost/preprocessor/tuple/push_back.hpp&gt;</a>
+        <a href="../topics/variadic_macros.html#VNotation">(v)</a></li>
+      <li><a href="tuple/push_front.html">&lt;boost/preprocessor/tuple/push_front.hpp&gt;</a>
+        <a href="../topics/variadic_macros.html#VNotation">(v)</a></li>
+      <li><a href="tuple/rem.html">&lt;boost/preprocessor/tuple/rem.hpp&gt;</a>
+        <a href="../topics/variadic_macros.html#VNotation" target="_self">(v)</a></li>
+      <li><a href="tuple/remove.html">&lt;boost/preprocessor/tuple/remove.hpp&gt;</a>
+        <a href="../topics/variadic_macros.html#VNotation">(v)</a></li>
+      <li><a href="tuple/replace.html">&lt;boost/preprocessor/tuple/replace.hpp&gt;</a>
+        <a href="../topics/variadic_macros.html#VNotation">(v)</a></li>
+      <li><a href="tuple/reverse.html">&lt;boost/preprocessor/tuple/reverse.hpp&gt;</a>
+        <a href="../topics/variadic_macros.html#VNotation" target="_self">(v)</a></li>
+      <li><a href="tuple/size.html">&lt;boost/preprocessor/tuple/size.hpp&gt;</a>
+        <a href="../topics/variadic_macros.html#VNotation" target="_self">(v)</a></li>
+      <li><a href="tuple/to_array.html">&lt;boost/preprocessor/tuple/to_array.hpp&gt;</a>
+        <a href="../topics/variadic_macros.html#VNotation" target="_self">(v)</a></li>
+      <li><a href="tuple/to_list.html">&lt;boost/preprocessor/tuple/to_list.hpp&gt;</a>
+        <a href="../topics/variadic_macros.html#VNotation" target="_self">(v)</a></li>
+      <li><a href="tuple/to_seq.html">&lt;boost/preprocessor/tuple/to_seq.hpp&gt;</a>
+        <a href="../topics/variadic_macros.html#VNotation" target="_self">(v)</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<br>
+      </i><i>© Copyright Edward Diener 2013</i><br>
+    </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>
--- a/doc/headers/tuple/eat.html
+++ b/doc/headers/tuple/eat.html
@@ -1,10 +1,6 @@
-<html>
-<head>
-	<title>tuple/eat.hpp</title>
-	<link rel="stylesheet" type="text/css" href="../../styles.css">
-</head>
-<body>
-	<div style="margin-left:  0px;">
+<html><head><title>tuple/eat.hpp</title>
+	<link rel="stylesheet" type="text/css" href="../../styles.css"></head><body>
+	<div style="margin-left: 0px;">
 		The <b>tuple/eat.hpp</b> header defines a macro eats a <i>tuple</i>.
 	</div>
 	<h4>Usage</h4>
@@ -13,18 +9,17 @@
 		</div>
 	<h4>Contents</h4>
 		<ul>
-			<li><a href="../../ref/tuple_eat.html">BOOST_PP_TUPLE_EAT</a></li>
+			<li><a href="../../ref/tuple_eat.html">BOOST_PP_TUPLE_EAT</a> <a href="../../topics/variadic_macros.html#VNotation" target="_self">(v)</a><br>
+</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>
+		<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>
+		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>
+</body></html>
--- a/doc/headers/tuple/elem.html
+++ b/doc/headers/tuple/elem.html
@@ -1,10 +1,6 @@
-<html>
-<head>
-	<title>tuple/elem.hpp</title>
-	<link rel="stylesheet" type="text/css" href="../../styles.css">
-</head>
-<body>
-	<div style="margin-left:  0px;">
+<html><head><title>tuple/elem.hpp</title>
+	<link rel="stylesheet" type="text/css" href="../../styles.css"></head><body>
+	<div style="margin-left: 0px;">
 		The <b>tuple/elem.hpp</b> header defines a macro to extract elements from a <i>tuple</i>.
 	</div>
 	<h4>Usage</h4>
@@ -13,18 +9,17 @@
 		</div>
 	<h4>Contents</h4>
 		<ul>
-			<li><a href="../../ref/tuple_elem.html">BOOST_PP_TUPLE_ELEM</a></li>
+			<li><a href="../../ref/tuple_elem.html">BOOST_PP_TUPLE_ELEM</a> <a href="../../topics/variadic_macros.html#VNotation" target="_self">(v)</a><br>
+</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>
+		<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>
+		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>
+</body></html>
--- a/doc/headers/tuple/enum.html
+++ b/doc/headers/tuple/enum.html
@@ -0,0 +1,25 @@
+<html><head>
+  <title>tuple/enum.hpp</title>
+	<link rel="stylesheet" type="text/css" href="../../styles.css"></head><body>
+	<div style="margin-left: 0px;">
+		The <b>tuple/enum.hpp</b> header defines a macro to convert a <i>tuple</i> to its comma-separated elements.
+	</div>
+	<h4>Usage</h4>
+		<div class="code">
+			#include <b>&lt;boost/preprocessor/tuple/enum.hpp&gt;</b>
+		</div>
+	<h4>Contents</h4>
+		<ul>
+			<li><a href="../../ref/tuple_enum.html">BOOST_PP_TUPLE_ENUM</a> <a href="../../topics/variadic_macros.html#VNotation" target="_self">(v)</a><br>
+</li>
+		</ul>
+	<hr size="1">
+	<div style="margin-left: 0px;">
+		<i></i><i>© Copyright Edward Diener 2011,2013</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>
--- a/doc/headers/tuple/insert.html
+++ b/doc/headers/tuple/insert.html
@@ -0,0 +1,27 @@
+<html>
+  <head>
+    <meta content="text/html; charset=windows-1252" http-equiv="content-type">
+    <title>tuple/insert.hpp</title>
+    <link rel="stylesheet" type="text/css" href="../../styles.css">
+  </head>
+  <body>
+    <div style="margin-left:  0px;"> The <b>tuple/insert.hpp</b> header defines
+      macros to insert an element into an <i>tuple</i>.</div>
+    <h4>Usage</h4>
+    <div class="code"> #include <b>&lt;boost/preprocessor/tuple/insert.hpp&gt;</b>
+    </div>
+    <h4>Contents</h4>
+    <ul>
+      <li><a href="../../ref/tuple_insert.html">BOOST_PP_TUPLE_INSERT</a> <a href="../../topics/variadic_macros.html#VNotation">(v)</a></li>
+      <li><a href="../../ref/tuple_insert_d.html">BOOST_PP_TUPLE_INSERT_D</a> <a
+          href="../../topics/variadic_macros.html#VNotation">(v)</a></li>
+    </ul>
+    <hr size="1">
+    <div style="margin-left: 0px;"> <i>© Copyright Edward Diener 2013</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>
--- a/doc/headers/tuple/pop_back.html
+++ b/doc/headers/tuple/pop_back.html
@@ -0,0 +1,28 @@
+<html>
+  <head>
+    <meta content="text/html; charset=windows-1252" http-equiv="content-type">
+    <title>tuple/pop_back.hpp</title>
+    <link rel="stylesheet" type="text/css" href="../../styles.css">
+  </head>
+  <body>
+    <div style="margin-left:  0px;"> The <b>tuple/pop_back.hpp</b> header
+      defines macros to pop an element from the end of an <i>tuple</i>.</div>
+    <h4>Usage</h4>
+    <div class="code"> #include <b>&lt;boost/preprocessor/tuple/pop_back.hpp&gt;</b>
+    </div>
+    <h4>Contents</h4>
+    <ul>
+      <li><a href="../../ref/tuple_pop_back.html">BOOST_PP_TUPLE_POP_BACK</a> <a
+          href="../../topics/variadic_macros.html#VNotation">(v)</a></li>
+      <li><a href="../../ref/tuple_pop_back_z.html">BOOST_PP_TUPLE_POP_BACK_Z</a>
+        <a href="../../topics/variadic_macros.html#VNotation">(v)</a></li>
+    </ul>
+    <hr size="1">
+    <div style="margin-left: 0px;"> <i>© Copyright Edward Diener 2013</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>
--- a/doc/headers/tuple/pop_front.html
+++ b/doc/headers/tuple/pop_front.html
@@ -0,0 +1,28 @@
+<html>
+  <head>
+    <meta content="text/html; charset=windows-1252" http-equiv="content-type">
+    <title>tuple/pop_front.hpp</title>
+    <link rel="stylesheet" type="text/css" href="../../styles.css">
+  </head>
+  <body>
+    <div style="margin-left:  0px;"> The <b>tuple/pop_front.hpp</b> header
+      defines macros to pop an element from the beginning of an <i>tuple</i>.</div>
+    <h4>Usage</h4>
+    <div class="code"> #include <b>&lt;boost/preprocessor/tuple/pop_front.hpp&gt;</b>
+    </div>
+    <h4>Contents</h4>
+    <ul>
+      <li><a href="../../ref/tuple_pop_front.html">BOOST_PP_TUPLE_POP_FRONT</a>
+        <a href="../../topics/variadic_macros.html#VNotation">(v)</a></li>
+      <li><a href="../../ref/tuple_pop_front_z.html">BOOST_PP_TUPLE_POP_FRONT_Z</a>
+        <a href="../../topics/variadic_macros.html#VNotation">(v)</a></li>
+    </ul>
+    <hr size="1">
+    <div style="margin-left: 0px;"> <i>© Copyright Edward Diener 2013</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>
--- a/doc/headers/tuple/push_back.html
+++ b/doc/headers/tuple/push_back.html
@@ -0,0 +1,26 @@
+<html>
+  <head>
+    <meta content="text/html; charset=windows-1252" http-equiv="content-type">
+    <title>tuple/push_back.hpp</title>
+    <link rel="stylesheet" type="text/css" href="../../styles.css">
+  </head>
+  <body>
+    <div style="margin-left:  0px;"> The <b>tuple/push_back.hpp</b> header
+      defines a macro to append an element to the end of an <i>tuple</i>.</div>
+    <h4>Usage</h4>
+    <div class="code"> #include <b>&lt;boost/preprocessor/tuple/push_back.hpp&gt;</b>
+    </div>
+    <h4>Contents</h4>
+    <ul>
+      <li><a href="../../ref/tuple_push_back.html">BOOST_PP_TUPLE_PUSH_BACK</a>
+        <a href="../../topics/variadic_macros.html#VNotation">(v)</a></li>
+    </ul>
+    <hr size="1">
+    <div style="margin-left: 0px;"> <i>© Copyright Edward Diener 2013</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>
--- a/doc/headers/tuple/push_front.html
+++ b/doc/headers/tuple/push_front.html
@@ -0,0 +1,26 @@
+<html>
+  <head>
+    <meta content="text/html; charset=windows-1252" http-equiv="content-type">
+    <title>tuple/push_front.hpp</title>
+    <link rel="stylesheet" type="text/css" href="../../styles.css">
+  </head>
+  <body>
+    <div style="margin-left:  0px;"> The <b>tuple/push_front.hpp</b> header
+      defines a macro to append an element to the beginning of an <i>tuple</i>.</div>
+    <h4>Usage</h4>
+    <div class="code"> #include <b>&lt;boost/preprocessor/tuple/push_front.hpp&gt;</b>
+    </div>
+    <h4>Contents</h4>
+    <ul>
+      <li><a href="../../ref/tuple_push_front.html">BOOST_PP_TUPLE_PUSH_FRONT</a>
+        <a href="../../topics/variadic_macros.html#VNotation">(v)</a></li>
+    </ul>
+    <hr size="1">
+    <div style="margin-left: 0px;"> <i>© Copyright Edward Diener 2013</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>
--- a/doc/headers/tuple/rem.html
+++ b/doc/headers/tuple/rem.html
@@ -1,10 +1,6 @@
-<html>
-<head>
-	<title>tuple/rem.hpp</title>
-	<link rel="stylesheet" type="text/css" href="../../styles.css">
-</head>
-<body>
-	<div style="margin-left:  0px;">
+<html><head><title>tuple/rem.hpp</title>
+	<link rel="stylesheet" type="text/css" href="../../styles.css"></head><body>
+	<div style="margin-left: 0px;">
 		The <b>tuple/rem.hpp</b> header defines a macro that removes the parentheses from a <i>tuple</i>.
 	</div>
 	<h4>Usage</h4>
@@ -13,19 +9,19 @@
 		</div>
 	<h4>Contents</h4>
 		<ul>
-			<li><a href="../../ref/tuple_rem.html">BOOST_PP_TUPLE_REM</a></li>
-			<li><a href="../../ref/tuple_rem_ctor.html">BOOST_PP_TUPLE_REM_CTOR</a></li>
+			<li><a href="../../ref/tuple_rem.html">BOOST_PP_TUPLE_REM</a> <a href="../../topics/variadic_macros.html#VNotation" target="_self">(v)</a><br>
+</li>
+			<li><a href="../../ref/tuple_rem_ctor.html">BOOST_PP_TUPLE_REM_CTOR</a> <a href="../../topics/variadic_macros.html#VNotation" target="_self">(v)</a><br>
+</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>
+		<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>
+		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>
+</body></html>
--- a/doc/headers/tuple/remove.html
+++ b/doc/headers/tuple/remove.html
@@ -0,0 +1,27 @@
+<html>
+  <head>
+    <meta content="text/html; charset=windows-1252" http-equiv="content-type">
+    <title>tuple/remove.hpp</title>
+    <link rel="stylesheet" type="text/css" href="../../styles.css">
+  </head>
+  <body>
+    <div style="margin-left:  0px;"> The <b>tuple/remove.hpp</b> header defines
+      macros to remove an element from an <i>array</i>. </div>
+    <h4>Usage</h4>
+    <div class="code"> #include <b>&lt;boost/preprocessor/tuple/remove.hpp&gt;</b>
+    </div>
+    <h4>Contents</h4>
+    <ul>
+      <li><a href="../../ref/tuple_remove.html">BOOST_PP_TUPLE_REMOVE</a> <a href="../../topics/variadic_macros.html#VNotation">(v)</a></li>
+      <li><a href="../../ref/tuple_remove_d.html">BOOST_PP_TUPLE_REMOVE_D</a> <a
+          href="../../topics/variadic_macros.html#VNotation">(v)</a></li>
+    </ul>
+    <hr size="1">
+    <div style="margin-left: 0px;"> <i>© Copyright Edward Diener 2013</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>
--- a/doc/headers/tuple/replace.html
+++ b/doc/headers/tuple/replace.html
@@ -0,0 +1,28 @@
+<html>
+  <head>
+    <meta content="text/html; charset=windows-1252" http-equiv="content-type">
+    <title>tuple/replace.hpp</title>
+    <link rel="stylesheet" type="text/css" href="../../styles.css">
+  </head>
+  <body>
+    <div style="margin-left:  0px;"> The <b>tuple/replace.hpp</b> header
+      defines macros to replace an element in an <i>array</i>.</div>
+    <h4>Usage</h4>
+    <div class="code"> #include <b>&lt;boost/preprocessor/tuple/replace.hpp&gt;</b>
+    </div>
+    <h4>Contents</h4>
+    <ul>
+      <li><a href="../../ref/tuple_replace.html">BOOST_PP_TUPLE_REPLACE</a> <a
+          href="../../topics/variadic_macros.html#VNotation">(v)</a></li>
+      <li><a href="../../ref/tuple_replace_d.html">BOOST_PP_TUPLE_REPLACE_D</a>
+        <a href="../../topics/variadic_macros.html#VNotation">(v)</a></li>
+    </ul>
+    <hr size="1">
+    <div style="margin-left: 0px;"> <i>© Copyright Edward Diener 2013</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>
--- a/doc/headers/tuple/reverse.html
+++ b/doc/headers/tuple/reverse.html
@@ -1,10 +1,6 @@
-<html>
-<head>
-	<title>tuple/reverse.hpp</title>
-	<link rel="stylesheet" type="text/css" href="../../styles.css">
-</head>
-<body>
-	<div style="margin-left:  0px;">
+<html><head><title>tuple/reverse.hpp</title>
+	<link rel="stylesheet" type="text/css" href="../../styles.css"></head><body>
+	<div style="margin-left: 0px;">
 		The <b>tuple/reverse.hpp</b> header defines a macro that reverses a <i>tuple</i>.
 	</div>
 	<h4>Usage</h4>
@@ -13,18 +9,17 @@
 		</div>
 	<h4>Contents</h4>
 		<ul>
-			<li><a href="../../ref/tuple_reverse.html">BOOST_PP_TUPLE_REVERSE</a></li>
+			<li><a href="../../ref/tuple_reverse.html">BOOST_PP_TUPLE_REVERSE</a> <a href="../../topics/variadic_macros.html#VNotation" target="_self">(v)</a><br>
+</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>
+		<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>
+		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>
+</body></html>
--- a/doc/headers/tuple/size.html
+++ b/doc/headers/tuple/size.html
@@ -0,0 +1,25 @@
+<html><head>
+  <title>tuple/size.hpp</title>
+	<link rel="stylesheet" type="text/css" href="../../styles.css"></head><body>
+	<div style="margin-left: 0px;">
+		The <b>tuple/size.hpp</b> header defines a variadic macro that gives the number of elements in the <i>tuple</i>.
+	</div>
+	<h4>Usage</h4>
+		<div class="code">
+			#include <b>&lt;boost/preprocessor/tuple/size.hpp&gt;</b>
+		</div>
+	<h4>Contents</h4>
+		<ul>
+			<li><a href="../../ref/tuple_size.html">BOOST_PP_TUPLE_SIZE</a> <a href="../../topics/variadic_macros.html#VNotation" target="_self">(v)</a><br>
+</li>
+		</ul>
+	<hr size="1">
+	<div style="margin-left: 0px;">
+		<i></i><i>© Copyright Edward Diener 2011,2013</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>
--- a/doc/headers/tuple/to_array.html
+++ b/doc/headers/tuple/to_array.html
@@ -0,0 +1,25 @@
+<html><head>
+  <title>tuple/to_array.hpp</title>
+	<link rel="stylesheet" type="text/css" href="../../styles.css"></head><body>
+	<div style="margin-left: 0px;">
+		The <b>tuple/to_array.hpp</b> header defines a macro that converts a <i>tuple</i> to an <i>array</i>.
+	</div>
+	<h4>Usage</h4>
+		<div class="code">
+			#include <b>&lt;boost/preprocessor/tuple/to_array.hpp&gt;</b>
+		</div>
+	<h4>Contents</h4>
+		<ul>
+			<li><a href="../../ref/tuple_to_array.html">BOOST_PP_TUPLE_TO_ARRAY</a> <a href="../../topics/variadic_macros.html#VNotation" target="_self">(v)</a><br>
+</li>
+		</ul>
+	<hr size="1">
+	<div style="margin-left: 0px;">
+		<i></i><i>© Copyright Edward Diener 2011,2013</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>
--- a/doc/headers/tuple/to_list.html
+++ b/doc/headers/tuple/to_list.html
@@ -1,10 +1,6 @@
-<html>
-<head>
-	<title>tuple/to_list.hpp</title>
-	<link rel="stylesheet" type="text/css" href="../../styles.css">
-</head>
-<body>
-	<div style="margin-left:  0px;">
+<html><head><title>tuple/to_list.hpp</title>
+	<link rel="stylesheet" type="text/css" href="../../styles.css"></head><body>
+	<div style="margin-left: 0px;">
 		The <b>tuple/to_list.hpp</b> header defines a macro that converts a <i>tuple</i> to a <i>list</i>.
 	</div>
 	<h4>Usage</h4>
@@ -13,18 +9,17 @@
 		</div>
 	<h4>Contents</h4>
 		<ul>
-			<li><a href="../../ref/tuple_to_list.html">BOOST_PP_TUPLE_TO_LIST</a></li>
+			<li><a href="../../ref/tuple_to_list.html">BOOST_PP_TUPLE_TO_LIST</a> <a href="../../topics/variadic_macros.html#VNotation" target="_self">(v)</a><sup><br>
+    </sup></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>
+		<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>
+		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>
+</body></html>
--- a/doc/headers/tuple/to_seq.html
+++ b/doc/headers/tuple/to_seq.html
@@ -1,10 +1,6 @@
-<html>
-	<head>
-		<title>tuple/to_seq.hpp</title>
-		<link rel="stylesheet" type="text/css" href="../../styles.css">
-	</head>
-	<body>
-		<div style="margin-left:  0px;">
+<html><head><title>tuple/to_seq.hpp</title>
+		<link rel="stylesheet" type="text/css" href="../../styles.css"></head><body>
+		<div style="margin-left: 0px;">
 			The <b>tuple/to_seq.hpp</b> header defines a macro that converts a <i>tuple</i> 
 			to a <i>seq</i>.
 		</div>
@@ -19,18 +15,17 @@
 		</h4>
 		<ul>
 			<li>
-				<a href="../../ref/tuple_to_seq.html">BOOST_PP_TUPLE_TO_SEQ</a></li>
+				<a href="../../ref/tuple_to_seq.html">BOOST_PP_TUPLE_TO_SEQ</a> <a href="../../topics/variadic_macros.html#VNotation" target="_self">(v)</a><br>
+</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>
+		<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>
+		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>
+	</body></html>
--- a/doc/headers/variadic.html
+++ b/doc/headers/variadic.html
@@ -0,0 +1,33 @@
+<html>
+<head>
+  <title>variadic.hpp</title>
+	<link rel="stylesheet" type="text/css" href="../styles.css">
+</head>
+<body>
+	<div style="margin-left: 0px;">
+		The <b>variadic.hpp</b> includes the headers in the <i>variadic</i> folder. 
+	</div>
+	<h4>Usage</h4>
+		<div class="code">
+			#include <b>&lt;boost/preprocessor/variadic.hpp&gt;</b>
+		</div>
+	<h4>Includes</h4>
+		<ul>
+			<li><a href="variadic/elem.html">&lt;boost/preprocessor/variadic/elem.hpp&gt;</a> <a href="../topics/variadic_macros.html#VNotation" target="_self">(v)</a></li>
+			<li><a href="variadic/size.html">&lt;boost/preprocessor/variadic/size.hpp&gt;</a> <a href="../topics/variadic_macros.html#VNotation" target="_self">(v)</a></li>
+			<li><a href="variadic/to_array.html">&lt;boost/preprocessor/variadic/to_array.hpp&gt;</a> <a href="../topics/variadic_macros.html#VNotation" target="_self">(v)</a></li>
+			<li><a href="variadic/to_list.html">&lt;boost/preprocessor/variadic/to_list.hpp&gt;</a> <a href="../topics/variadic_macros.html#VNotation" target="_self">(v)</a></li>
+			<li><a href="variadic/to_seq.html">&lt;boost/preprocessor/variadic/to_seq.hpp&gt;</a> <a href="../topics/variadic_macros.html#VNotation" target="_self">(v)</a></li>
+            <li><a href="variadic/to_tuple.html">&lt;boost/preprocessor/variadic/to_tuple.hpp&gt;</a> <a href="../topics/variadic_macros.html#VNotation" target="_self">(v)</a></li>
+		</ul>
+	<hr size="1">
+	<div style="margin-left: 0px;">
+		<i></i><i>© Copyright Edward Diener 2011,2013</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>
--- a/doc/headers/variadic/elem.html
+++ b/doc/headers/variadic/elem.html
@@ -0,0 +1,29 @@
+<html>
+  <head>
+    <title>variadic/elem.hpp
+    </title>
+    <link rel="stylesheet" type="text/css" href="../../styles.css">
+  </head>
+  <body>
+  <div style="margin-left: 0px;">
+    The <b>variadic/elem.hpp</b> header defines a variadic macro to extract an element from <i>variadic data</i>.
+  </div>
+  				<h4>Usage</h4>
+  						<div class="code">
+  									#include <b>&lt;boost/preprocessor/variadic/elem.hpp&gt;</b>
+  											</div>
+  												<h4>Contents</h4>
+  														<ul>
+			<li><a href="../../ref/variadic_elem.html">BOOST_PP_VARIADIC_ELEM</a> <a href="../../topics/variadic_macros.html#VNotation" target="_self">(v)</a><br>
+</li>
+		</ul>
+	<hr size="1">
+	<div style="margin-left: 0px;">
+		<i></i><i>© Copyright Edward Diener 2011,2013</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>
--- a/doc/headers/variadic/size.html
+++ b/doc/headers/variadic/size.html
@@ -0,0 +1,25 @@
+<html><head>
+  <title>variadic/size.hpp</title>
+  <link rel="stylesheet" type="text/css" href="../../styles.css"></head><body>
+   <div style="margin-left: 0px;">
+   The <b>variadic/size.hpp</b> header defines a variadic macro that gives the number of comma-separated elements in the <i>variadic data</i>.
+   </div>
+   <h4>Usage</h4>
+   <div class="code">
+   #include <b>&lt;boost/preprocessor/variadic/size.hpp&gt;</b>
+   </div>
+   <h4>Contents</h4>
+   <ul>
+   <li><a href="../../ref/variadic_size.html">BOOST_PP_VARIADIC_SIZE</a> <a href="../../topics/variadic_macros.html#VNotation" target="_self">(v)</a><br>
+   </li>
+   </ul>
+   <hr size="1">
+   <div style="margin-left: 0px;">
+   <i></i><i>© Copyright Edward Diener 2011,2013</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>
--- a/doc/headers/variadic/to_array.html
+++ b/doc/headers/variadic/to_array.html
@@ -0,0 +1,25 @@
+<html><head>
+  <title>variadic/to_array.hpp</title>
+    <link rel="stylesheet" type="text/css" href="../../styles.css"></head><body>
+    <div style="margin-left: 0px;">
+        The <b>variadic/to_array.hpp</b> header defines a variadic macro that converts <i>variadic data</i> to an <i>array</i>.
+    </div>
+    <h4>Usage</h4>
+        <div class="code">
+            #include <b>&lt;boost/preprocessor/variadic/to_array.hpp&gt;</b>
+        </div>
+    <h4>Contents</h4>
+        <ul>
+            <li><a href="../../ref/variadic_to_array.html">BOOST_PP_VARIADIC_TO_ARRAY</a> <a href="../../topics/variadic_macros.html#VNotation" target="_self">(v)</a><br>
+</li>
+        </ul>
+    <hr size="1">
+    <div style="margin-left: 0px;">
+        <i></i><i>© Copyright Edward Diener 2011,2013</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>
--- a/doc/headers/variadic/to_list.html
+++ b/doc/headers/variadic/to_list.html
@@ -0,0 +1,25 @@
+<html><head>
+  <title>variadic/to_list.hpp</title>
+      <link rel="stylesheet" type="text/css" href="../../styles.css"></head><body>
+       <div style="margin-left: 0px;">
+        The <b>variadic/to_list.hpp</b> header defines a variadic macro that converts <i>variadic data </i>to a <i>list</i>.
+     </div>
+    <h4>Usage</h4>
+     <div class="code">
+      #include <b>&lt;boost/preprocessor/variadic/to_list.hpp&gt;</b>
+      </div>
+    <h4>Contents</h4>
+        <ul>
+            <li><a href="../../ref/variadic_to_list.html">BOOST_PP_VARIADIC_TO_LIST</a> <a href="../../topics/variadic_macros.html#VNotation" target="_self">(v)</a><br>
+</li>
+        </ul>
+    <hr size="1">
+    <div style="margin-left: 0px;">
+        <i></i><i>© Copyright Edward Diener 2011,2013</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>
--- a/doc/headers/variadic/to_seq.html
+++ b/doc/headers/variadic/to_seq.html
@@ -0,0 +1,30 @@
+<html><head>
+  <title>variadic/to_seq.hpp</title>
+		<link rel="stylesheet" type="text/css" href="../../styles.css"></head><body>
+		<div style="margin-left: 0px;">
+			The <b>variadic/to_seq.hpp</b> header defines a variadic macro that converts <i>variadic data </i>to a <i>seq</i>.
+		</div>
+		<h4>
+			Usage
+		</h4>
+		<div class="code">
+			#include <b>&lt;boost/preprocessor/variadic/to_seq.hpp&gt;</b>
+		</div>
+		<h4>
+			Contents
+		</h4>
+		<ul>
+			<li>
+				<a href="../../ref/variadic_to_seq.html">BOOST_PP_VARIADIC_TO_SEQ</a> <a href="../../topics/variadic_macros.html#VNotation" target="_self">(v)</a><br>
+</li>
+		</ul>
+	<hr size="1">
+	<div style="margin-left: 0px;">
+		<i></i><i>© Copyright Edward Diener 2011,2013</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>
--- a/doc/headers/variadic/to_tuple.html
+++ b/doc/headers/variadic/to_tuple.html
@@ -0,0 +1,31 @@
+<html><head>
+  <title>variadic/to_tuple.hpp</title>
+		<link rel="stylesheet" type="text/css" href="../../styles.css"></head><body>
+		<div style="margin-left: 0px;">
+			The <b>variadic/to_tuple.hpp</b> header defines a variadic macro that converts <i>variadic data</i> 
+			to a <i>tuple</i>.
+		</div>
+		<h4>
+			Usage
+		</h4>
+		<div class="code">
+			#include <b>&lt;boost/preprocessor/variadic/to_tuple.hpp&gt;</b>
+		</div>
+		<h4>
+			Contents
+		</h4>
+		<ul>
+			<li>
+				<a href="../../ref/variadic_to_tuple.html">BOOST_PP_VARIADIC_TO_TUPLE</a> <a href="../../topics/variadic_macros.html#VNotation" target="_self">(v)</a><br>
+</li>
+		</ul>
+	<hr size="1">
+	<div style="margin-left: 0px;">
+		<i></i><i>© Copyright Edward Diener 2011,2013</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>
--- a/doc/ref.html
+++ b/doc/ref.html
@@ -1,286 +1,319 @@
 <html>
-	<head>
-		<title>ref.html</title>
-		<link rel="stylesheet" type="text/css" href="styles.css">
-			<base target="desc">
-	</head>
-	<body>
-		<h4>
-			Reference <small><a href="contents.html" target="index">[back]</a></small>
-		</h4>
-		<ul>
-			<!-- A -->
-			<li><a href="ref/add.html">ADD</a></li>
-			<li><a href="ref/add_d.html">ADD_D</a></li>
-			<li><a href="ref/and.html">AND</a></li>
-			<li><a href="ref/apply.html">APPLY</a></li>
-			<li><a href="ref/array_data.html">ARRAY_DATA</a></li>
-			<li><a href="ref/array_elem.html">ARRAY_ELEM</a></li>
-			<li><a href="ref/array_insert.html">ARRAY_INSERT</a></li>
-			<li><a href="ref/array_insert_d.html">ARRAY_INSERT_D</a></li>
-			<li><a href="ref/array_pop_back.html">ARRAY_POP_BACK</a></li>
-			<li><a href="ref/array_pop_back_z.html">ARRAY_POP_BACK_Z</a></li>
-			<li><a href="ref/array_pop_front.html">ARRAY_POP_FRONT</a></li>
-			<li><a href="ref/array_pop_front_z.html">ARRAY_POP_FRONT_Z</a></li>
-			<li><a href="ref/array_push_back.html">ARRAY_PUSH_BACK</a></li>
-			<li><a href="ref/array_push_front.html">ARRAY_PUSH_FRONT</a></li>
-			<li><a href="ref/array_remove.html">ARRAY_REMOVE</a></li>
-			<li><a href="ref/array_remove_d.html">ARRAY_REMOVE_D</a></li>
-			<li><a href="ref/array_replace.html">ARRAY_REPLACE</a></li>
-			<li><a href="ref/array_replace_d.html">ARRAY_REPLACE_D</a></li>
-			<li><a href="ref/array_reverse.html">ARRAY_REVERSE</a></li>
-			<li><a href="ref/array_size.html">ARRAY_SIZE</a></li>
-			<li><a href="ref/assert.html">ASSERT</a></li>
-			<li><a href="ref/assert_msg.html">ASSERT_MSG</a></li>
-			<li><a href="ref/assign_slot.html">ASSIGN_SLOT</a></li>
-			<!-- B -->
-			<li><a href="ref/bitand.html">BITAND</a></li>
-			<li><a href="ref/bitnor.html">BITNOR</a></li>
-			<li><a href="ref/bitor.html">BITOR</a></li>
-			<li><a href="ref/bitxor.html">BITXOR</a></li>
-			<li><a href="ref/bool.html">BOOL</a></li>
-			<!-- C -->
-			<li><a href="ref/cat.html">CAT</a></li>
-			<li><a href="ref/comma.html">COMMA</a></li>
-			<li><a href="ref/comma_if.html">COMMA_IF</a></li>
-			<li><a href="ref/compl.html">COMPL</a></li>
-			<li><a href="ref/config_extended_line_info.html">CONFIG_EXTENDED_LINE_INFO</a></li>
-			<li><a href="ref/counter.html">COUNTER</a></li>
-			<!-- D -->
-			<li><a href="ref/dec.html">DEC</a></li>
-			<li><a href="ref/deduce_d.html">DEDUCE_D</a></li>
-			<li><a href="ref/deduce_r.html">DEDUCE_R</a></li>
-			<li><a href="ref/deduce_z.html">DEDUCE_Z</a></li>
-			<li><a href="ref/div.html">DIV</a></li>
-			<li><a href="ref/div_d.html">DIV_D</a></li>
-			<!-- E -->
-			<li><a href="ref/empty.html">EMPTY</a></li>
-			<li><a href="ref/enum.html">ENUM</a></li>
-			<li><a href="ref/enum_binary_params.html">ENUM_BINARY_PARAMS</a></li>
-			<li><a href="ref/enum_binary_params_z.html">ENUM_BINARY_PARAMS_Z</a></li>
-			<li><a href="ref/enum_params.html">ENUM_PARAMS</a></li>
-			<li><a href="ref/enum_params_with_a_default.html">ENUM_PARAMS_WITH_A_DEFAULT*</a></li>
-			<li><a href="ref/enum_params_with_defaults.html">ENUM_PARAMS_WITH_DEFAULTS*</a></li>
-			<li><a href="ref/enum_params_z.html">ENUM_PARAMS_Z</a></li>
-			<li><a href="ref/enum_shifted.html">ENUM_SHIFTED</a></li>
-			<li><a href="ref/esbp.html">ENUM_SHIFTED_BINARY_PARAMS</a></li>
-			<li><a href="ref/esbpz.html">ENUM_SHIFTED_BINARY_PARAMS_Z</a></li>
-			<li><a href="ref/enum_shifted_params.html">ENUM_SHIFTED_PARAMS</a></li>
-			<li><a href="ref/enum_shifted_params_z.html">ENUM_SHIFTED_PARAMS_Z</a></li>
-			<li><a href="ref/enum_shifted_z.html">ENUM_SHIFTED_<i>z</i></a></li>
-			<li><a href="ref/enum_trailing.html">ENUM_TRAILING</a></li>
-			<li><a href="ref/etbp.html">ENUM_TRAILING_BINARY_PARAMS</a></li>
-			<li><a href="ref/etbpz.html">ENUM_TRAILING_BINARY_PARAMS_Z</a></li>
-			<li><a href="ref/enum_trailing_params.html">ENUM_TRAILING_PARAMS</a></li>
-			<li><a href="ref/enum_trailing_params_z.html">ENUM_TRAILING_PARAMS_Z</a></li>
-			<li><a href="ref/enum_trailing_z.html">ENUM_TRAILING_<i>z</i></a></li>
-			<li><a href="ref/enum_z.html">ENUM_<i>z</i></a></li>
-			<li><a href="ref/equal.html">EQUAL</a></li>
-			<li><a href="ref/equal_d.html">EQUAL_D*</a></li>
-			<li><a href="ref/expand.html">EXPAND</a></li>
-			<li><a href="ref/expr_if.html">EXPR_IF</a></li>
-			<li><a href="ref/expr_iif.html">EXPR_IIF</a></li>
-			<!-- F -->
-			<li><a href="ref/filename_x.html">FILENAME_<i>x</i></a></li>
-			<li><a href="ref/for.html">FOR</a></li>
-			<li><a href="ref/for_r.html">FOR_<i>r</i></a></li>
-			<li><a href="ref/frame_finish.html">FRAME_FINISH</a></li>
-			<li><a href="ref/frame_flags.html">FRAME_FLAGS</a></li>
-			<li><a href="ref/frame_iteration.html">FRAME_ITERATION</a></li>
-			<li><a href="ref/frame_start.html">FRAME_START</a></li>
-			<!-- G -->
-			<li><a href="ref/greater.html">GREATER</a></li>
-			<li><a href="ref/greater_d.html">GREATER_D</a></li>
-			<li><a href="ref/greater_equal.html">GREATER_EQUAL</a></li>
-			<li><a href="ref/greater_equal_d.html">GREATER_EQUAL_D</a></li>
-			<!-- I -->
-			<li><a href="ref/identity.html">IDENTITY</a></li>
-			<li><a href="ref/if.html">IF</a></li>
-			<li><a href="ref/iif.html">IIF</a></li>
-			<li><a href="ref/inc.html">INC</a></li>
-			<li><a href="ref/include_self.html">INCLUDE_SELF</a></li>
-			<li><a href="ref/indirect_self.html">INDIRECT_SELF</a></li>
-			<li><a href="ref/intercept.html">INTERCEPT</a></li>
-			<li><a href="ref/is_iterating.html">IS_ITERATING</a></li>
-			<li><a href="ref/is_selfish.html">IS_SELFISH</a></li>
-			<li><a href="ref/iterate.html">ITERATE</a></li>
-			<li><a href="ref/iteration.html">ITERATION</a></li>
-			<li><a href="ref/iteration_depth.html">ITERATION_DEPTH</a></li>
-			<li><a href="ref/iteration_finish.html">ITERATION_FINISH</a></li>
-			<li><a href="ref/iteration_flags.html">ITERATION_FLAGS</a></li>
-			<li><a href="ref/iteration_limits.html">ITERATION_LIMITS</a></li>
-			<li><a href="ref/iteration_params_x.html">ITERATION_PARAMS_<i>x</i></a></li>
-			<li><a href="ref/iteration_start.html">ITERATION_START</a></li>
-			<!-- L -->
-			<li><a href="ref/less.html">LESS</a></li>
-			<li><a href="ref/less_d.html">LESS_D</a></li>
-			<li><a href="ref/less_equal.html">LESS_EQUAL</a></li>
-			<li><a href="ref/less_equal_d.html">LESS_EQUAL_D</a></li>
-			<li><a href="ref/limit_dim.html">LIMIT_DIM</a></li>
-			<li><a href="ref/limit_for.html">LIMIT_FOR</a></li>
-			<li><a href="ref/limit_iteration.html">LIMIT_ITERATION</a></li>
-			<li><a href="ref/limit_iteration_dim.html">LIMIT_ITERATION_DIM</a></li>
-			<li><a href="ref/limit_mag.html">LIMIT_MAG</a></li>
-			<li><a href="ref/limit_repeat.html">LIMIT_REPEAT</a></li>
-			<li><a href="ref/limit_seq.html">LIMIT_SEQ</a></li>
-			<li><a href="ref/limit_slot_count.html">LIMIT_SLOT_COUNT</a></li>
-			<li><a href="ref/limit_slot_sig.html">LIMIT_SLOT_SIG</a></li>
-			<li><a href="ref/limit_tuple.html">LIMIT_TUPLE</a></li>
-			<li><a href="ref/limit_while.html">LIMIT_WHILE</a></li>
-			<li><a href="ref/line.html">LINE</a></li>
-			<li><a href="ref/list_append.html">LIST_APPEND</a></li>
-			<li><a href="ref/list_append_d.html">LIST_APPEND_D</a></li>
-			<li><a href="ref/list_at.html">LIST_AT</a></li>
-			<li><a href="ref/list_at_d.html">LIST_AT_D</a></li>
-			<li><a href="ref/list_cat.html">LIST_CAT</a></li>
-			<li><a href="ref/list_cat_d.html">LIST_CAT_D</a></li>
-			<li><a href="ref/list_cons.html">LIST_CONS*</a></li>
-			<li><a href="ref/list_enum.html">LIST_ENUM</a></li>
-			<li><a href="ref/list_enum_r.html">LIST_ENUM_R</a></li>
-			<li><a href="ref/list_filter.html">LIST_FILTER</a></li>
-			<li><a href="ref/list_filter_d.html">LIST_FILTER_D</a></li>
-			<li><a href="ref/list_first.html">LIST_FIRST</a></li>
-			<li><a href="ref/list_first_n.html">LIST_FIRST_N</a></li>
-			<li><a href="ref/list_first_n_d.html">LIST_FIRST_N_D</a></li>
-			<li><a href="ref/list_fold_left.html">LIST_FOLD_LEFT</a></li>
-			<li><a href="ref/list_fold_left_2nd.html">LIST_FOLD_LEFT_2ND*</a></li>
-			<li><a href="ref/list_fold_left_2nd_d.html">LIST_FOLD_LEFT_2ND_D*</a></li>
-			<li><a href="ref/list_fold_left_d.html">LIST_FOLD_LEFT_<i>d</i></a></li>
-			<li><a href="ref/list_fold_left_d_old.html">LIST_FOLD_LEFT_D*</a></li>
-			<li><a href="ref/list_fold_right.html">LIST_FOLD_RIGHT</a></li>
-			<li><a href="ref/list_fold_right_2nd.html">LIST_FOLD_RIGHT_2ND*</a></li>
-			<li><a href="ref/list_fold_right_2nd_d.html">LIST_FOLD_RIGHT_2ND_D*</a></li>
-			<li><a href="ref/list_fold_right_d.html">LIST_FOLD_RIGHT_<i>d</i></a></li>
-			<li><a href="ref/list_fold_right_d_old.html">LIST_FOLD_RIGHT_D*</a></li>
-			<li><a href="ref/list_for_each.html">LIST_FOR_EACH</a></li>
-			<li><a href="ref/list_for_each_i.html">LIST_FOR_EACH_I</a></li>
-			<li><a href="ref/list_for_each_i_r.html">LIST_FOR_EACH_I_R</a></li>
-			<li><a href="ref/list_for_each_product.html">LIST_FOR_EACH_PRODUCT</a></li>
-			<li><a href="ref/list_for_each_product_r.html">LIST_FOR_EACH_PRODUCT_R</a></li>
-			<li><a href="ref/list_for_each_r.html">LIST_FOR_EACH_R</a></li>
-			<li><a href="ref/list_is_cons.html">LIST_IS_CONS</a></li>
-			<li><a href="ref/list_is_nil.html">LIST_IS_NIL</a></li>
-			<li><a href="ref/list_nil.html">LIST_NIL*</a></li>
-			<li><a href="ref/list_rest.html">LIST_REST</a></li>
-			<li><a href="ref/list_rest_n.html">LIST_REST_N</a></li>
-			<li><a href="ref/list_rest_n_d.html">LIST_REST_N_D</a></li>
-			<li><a href="ref/list_reverse.html">LIST_REVERSE</a></li>
-			<li><a href="ref/list_reverse_d.html">LIST_REVERSE_D</a></li>
-			<li><a href="ref/list_size.html">LIST_SIZE</a></li>
-			<li><a href="ref/list_size_d.html">LIST_SIZE_D</a></li>
-			<li><a href="ref/list_to_tuple.html">LIST_TO_TUPLE</a></li>
-			<li><a href="ref/list_to_tuple_r.html">LIST_TO_TUPLE_R</a></li>
-			<li><a href="ref/list_transform.html">LIST_TRANSFORM</a></li>
-			<li><a href="ref/list_transform_d.html">LIST_TRANSFORM_D</a></li>
-			<li><a href="ref/local_iterate.html">LOCAL_ITERATE</a></li>
-			<li><a href="ref/local_limits.html">LOCAL_LIMITS</a></li>
-			<li><a href="ref/local_macro.html">LOCAL_MACRO</a></li>
-			<li><a href="ref/lparen.html">LPAREN</a></li>
-			<li><a href="ref/lparen_if.html">LPAREN_IF</a></li>
-			<!-- M -->
-			<li><a href="ref/max.html">MAX</a></li>
-			<li><a href="ref/max_d.html">MAX_D</a></li>
-			<li><a href="ref/min.html">MIN</a></li>
-			<li><a href="ref/min_d.html">MIN_D</a></li>
-			<li><a href="ref/mod.html">MOD</a></li>
-			<li><a href="ref/mod_d.html">MOD_D</a></li>
-			<li><a href="ref/mul.html">MUL</a></li>
-			<li><a href="ref/mul_d.html">MUL_D</a></li>
-			<!-- N -->
-			<li><a href="ref/nil.html">NIL</a></li>
-			<li><a href="ref/nor.html">NOR</a></li>
-			<li><a href="ref/not.html">NOT</a></li>
-			<li><a href="ref/not_equal.html">NOT_EQUAL</a></li>
-			<li><a href="ref/not_equal_d.html">NOT_EQUAL_D*</a></li>
-			<!-- O -->
-			<li><a href="ref/or.html">OR</a></li>
-			<!-- R -->
-			<li><a href="ref/relative_finish.html">RELATIVE_FINISH</a></li>
-			<li><a href="ref/relative_flags.html">RELATIVE_FLAGS</a></li>
-			<li><a href="ref/relative_iteration.html">RELATIVE_ITERATION</a></li>
-			<li><a href="ref/relative_start.html">RELATIVE_START</a></li>
-			<li><a href="ref/repeat.html">REPEAT</a></li>
-			<li><a href="ref/repeat_1st.html">REPEAT_1ST*</a></li>
-			<li><a href="ref/repeat_2nd.html">REPEAT_2ND*</a></li>
-			<li><a href="ref/repeat_3rd.html">REPEAT_3RD*</a></li>
-			<li><a href="ref/repeat_from_to.html">REPEAT_FROM_TO</a></li>
-			<li><a href="ref/repeat_from_to_1st.html">REPEAT_FROM_TO_1ST*</a></li>
-			<li><a href="ref/repeat_from_to_2nd.html">REPEAT_FROM_TO_2ND*</a></li>
-			<li><a href="ref/repeat_from_to_3rd.html">REPEAT_FROM_TO_3RD*</a></li>
-			<li><a href="ref/repeat_from_to_d.html">REPEAT_FROM_TO_D</a></li>
-			<li><a href="ref/repeat_from_to_d_z.html">REPEAT_FROM_TO_D_<i>z</i></a></li>
-			<li><a href="ref/repeat_from_to_z.html">REPEAT_FROM_TO_<i>z</i></a></li>
-			<li><a href="ref/repeat_z.html">REPEAT_<i>z</i></a></li>
-			<li><a href="ref/rparen.html">RPAREN</a></li>
-			<li><a href="ref/rparen_if.html">RPAREN_IF</a></li>
-			<!-- S -->
-			<li><a href="ref/seq_cat.html">SEQ_CAT</a></li>
-			<li><a href="ref/seq_cat_s.html">SEQ_CAT_S</a></li>
-			<li><a href="ref/seq_elem.html">SEQ_ELEM</a></li>
-			<li><a href="ref/seq_enum.html">SEQ_ENUM</a></li>
-			<li><a href="ref/seq_filter.html">SEQ_FILTER</a></li>
-			<li><a href="ref/seq_filter_s.html">SEQ_FILTER_S</a></li>
-			<li><a href="ref/seq_first_n.html">SEQ_FIRST_N</a></li>
-			<li><a href="ref/seq_fold_left.html">SEQ_FOLD_LEFT</a></li>
-			<li><a href="ref/seq_fold_left_s.html">SEQ_FOLD_LEFT_<i>s</i></a></li>
-			<li><a href="ref/seq_fold_right.html">SEQ_FOLD_RIGHT</a></li>
-			<li><a href="ref/seq_fold_right_s.html">SEQ_FOLD_RIGHT_<i>s</i></a></li>
-			<li><a href="ref/seq_for_each.html">SEQ_FOR_EACH</a></li>
-			<li><a href="ref/seq_for_each_i.html">SEQ_FOR_EACH_I</a></li>
-			<li><a href="ref/seq_for_each_i_r.html">SEQ_FOR_EACH_I_R</a></li>
-			<li><a href="ref/seq_for_each_product.html">SEQ_FOR_EACH_PRODUCT</a></li>
-			<li><a href="ref/seq_for_each_product_r.html">SEQ_FOR_EACH_PRODUCT_R</a></li>
-			<li><a href="ref/seq_for_each_r.html">SEQ_FOR_EACH_R</a></li>
-			<li><a href="ref/seq_head.html">SEQ_HEAD</a></li>
-			<li><a href="ref/seq_insert.html">SEQ_INSERT</a></li>
-			<li><a href="ref/seq_nil.html">SEQ_NIL</a></li>
-			<li><a href="ref/seq_pop_back.html">SEQ_POP_BACK</a></li>
-			<li><a href="ref/seq_pop_front.html">SEQ_POP_FRONT</a></li>
-			<li><a href="ref/seq_push_back.html">SEQ_PUSH_BACK</a></li>
-			<li><a href="ref/seq_push_front.html">SEQ_PUSH_FRONT</a></li>
-			<li><a href="ref/seq_remove.html">SEQ_REMOVE</a></li>
-			<li><a href="ref/seq_replace.html">SEQ_REPLACE</a></li>
-			<li><a href="ref/seq_rest_n.html">SEQ_REST_N</a></li>
-			<li><a href="ref/seq_reverse.html">SEQ_REVERSE</a></li>
-			<li><a href="ref/seq_reverse_s.html">SEQ_REVERSE_S</a></li>
-			<li><a href="ref/seq_size.html">SEQ_SIZE</a></li>
-			<li><a href="ref/seq_subseq.html">SEQ_SUBSEQ</a></li>
-			<li><a href="ref/seq_tail.html">SEQ_TAIL</a></li>
-			<li><a href="ref/seq_to_array.html">SEQ_TO_ARRAY</a></li>
-			<li><a href="ref/seq_to_tuple.html">SEQ_TO_TUPLE</a></li>
-			<li><a href="ref/seq_transform.html">SEQ_TRANSFORM</a></li>
-			<li><a href="ref/seq_transform_s.html">SEQ_TRANSFORM_S</a></li>
-			<li><a href="ref/slot.html">SLOT</a></li>
-			<li><a href="ref/stringize.html">STRINGIZE</a></li>
-			<li><a href="ref/sub.html">SUB</a></li>
-			<li><a href="ref/sub_d.html">SUB_D</a></li>
-			<!-- T -->
-			<li><a href="ref/tuple_eat.html">TUPLE_EAT</a></li>
-			<li><a href="ref/tuple_elem.html">TUPLE_ELEM</a></li>
-			<li><a href="ref/tuple_rem.html">TUPLE_REM</a></li>
-			<li><a href="ref/tuple_rem_ctor.html">TUPLE_REM_CTOR</a></li>
-			<li><a href="ref/tuple_reverse.html">TUPLE_REVERSE</a></li>
-			<li><a href="ref/tuple_to_list.html">TUPLE_TO_LIST</a></li>
-			<li><a href="ref/tuple_to_seq.html">TUPLE_TO_SEQ</a></li>
-			<!-- U -->
-			<li><a href="ref/update_counter.html">UPDATE_COUNTER</a></li>
-			<!-- V -->
-			<li><a href="ref/value.html">VALUE</a></li>
-			<!-- W -->
-			<li><a href="ref/while.html">WHILE</a></li>
-			<li><a href="ref/while_d.html">WHILE_<i>d</i></a></li>
-			<li><a href="ref/wstringize.html">WSTRINGIZE</a></li>
-			<!-- X -->
-			<li><a href="ref/xor.html">XOR</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>
+  <head>
+    <meta content="text/html; charset=windows-1252" http-equiv="content-type">
+    <title>ref.html</title>
+    <link rel="stylesheet" type="text/css" href="styles.css">
+    <base target="desc">
+  </head>
+  <body>
+    <h4> Reference <small><a href="contents.html" target="index">[back]</a></small>
+    </h4>
+    <ul>
+      <!-- A -->
+      <li><a href="ref/add.html">ADD</a></li>
+      <li><a href="ref/add_d.html">ADD_D</a></li>
+      <li><a href="ref/and.html">AND</a></li>
+      <li><a href="ref/apply.html">APPLY</a></li>
+      <li><a href="ref/array_data.html">ARRAY_DATA</a></li>
+      <li><a href="ref/array_elem.html">ARRAY_ELEM</a></li>
+      <li><a href="ref/array_enum.html">ARRAY_ENUM</a></li>
+      <li><a href="ref/array_insert.html">ARRAY_INSERT</a></li>
+      <li><a href="ref/array_insert_d.html">ARRAY_INSERT_D</a></li>
+      <li><a href="ref/array_pop_back.html">ARRAY_POP_BACK</a></li>
+      <li><a href="ref/array_pop_back_z.html">ARRAY_POP_BACK_Z</a></li>
+      <li><a href="ref/array_pop_front.html">ARRAY_POP_FRONT</a></li>
+      <li><a href="ref/array_pop_front_z.html">ARRAY_POP_FRONT_Z</a></li>
+      <li><a href="ref/array_push_back.html">ARRAY_PUSH_BACK</a></li>
+      <li><a href="ref/array_push_front.html">ARRAY_PUSH_FRONT</a></li>
+      <li><a href="ref/array_remove.html">ARRAY_REMOVE</a></li>
+      <li><a href="ref/array_remove_d.html">ARRAY_REMOVE_D</a></li>
+      <li><a href="ref/array_replace.html">ARRAY_REPLACE</a></li>
+      <li><a href="ref/array_replace_d.html">ARRAY_REPLACE_D</a></li>
+      <li><a href="ref/array_reverse.html">ARRAY_REVERSE</a></li>
+      <li><a href="ref/array_size.html">ARRAY_SIZE</a></li>
+      <li><a href="ref/array_to_list.html">ARRAY_TO_LIST</a></li>
+      <li><a href="ref/array_to_seq.html">ARRAY_TO_SEQ</a></li>
+      <li><a href="ref/array_to_tuple.html">ARRAY_TO_TUPLE</a></li>
+      <li><a href="ref/assert.html">ASSERT</a></li>
+      <li><a href="ref/assert_msg.html">ASSERT_MSG</a></li>
+      <li><a href="ref/assign_slot.html">ASSIGN_SLOT</a></li>
+      <!-- B -->
+      <li><a href="ref/bitand.html">BITAND</a></li>
+      <li><a href="ref/bitnor.html">BITNOR</a></li>
+      <li><a href="ref/bitor.html">BITOR</a></li>
+      <li><a href="ref/bitxor.html">BITXOR</a></li>
+      <li><a href="ref/bool.html">BOOL</a></li>
+      <!-- C -->
+      <li><a href="ref/cat.html">CAT</a></li>
+      <li><a href="ref/comma.html">COMMA</a></li>
+      <li><a href="ref/comma_if.html">COMMA_IF</a></li>
+      <li><a href="ref/compl.html">COMPL</a></li>
+      <li><a href="ref/config_extended_line_info.html">CONFIG_EXTENDED_LINE_INFO</a></li>
+      <li><a href="ref/counter.html">COUNTER</a></li>
+      <!-- D -->
+      <li><a href="ref/dec.html">DEC</a></li>
+      <li><a href="ref/deduce_d.html">DEDUCE_D</a></li>
+      <li><a href="ref/deduce_r.html">DEDUCE_R</a></li>
+      <li><a href="ref/deduce_z.html">DEDUCE_Z</a></li>
+      <li><a href="ref/div.html">DIV</a></li>
+      <li><a href="ref/div_d.html">DIV_D</a></li>
+      <!-- E -->
+      <li><a href="ref/empty.html">EMPTY</a></li>
+      <li><a href="ref/enum.html">ENUM</a></li>
+      <li><a href="ref/enum_binary_params.html">ENUM_BINARY_PARAMS</a></li>
+      <li><a href="ref/enum_binary_params_z.html">ENUM_BINARY_PARAMS_Z</a></li>
+      <li><a href="ref/enum_params.html">ENUM_PARAMS</a></li>
+      <li><a href="ref/enum_params_with_a_default.html">ENUM_PARAMS_WITH_A_DEFAULT*</a></li>
+      <li><a href="ref/enum_params_with_defaults.html">ENUM_PARAMS_WITH_DEFAULTS*</a></li>
+      <li><a href="ref/enum_params_z.html">ENUM_PARAMS_Z</a></li>
+      <li><a href="ref/enum_shifted.html">ENUM_SHIFTED</a></li>
+      <li><a href="ref/esbp.html">ENUM_SHIFTED_BINARY_PARAMS</a></li>
+      <li><a href="ref/esbpz.html">ENUM_SHIFTED_BINARY_PARAMS_Z</a></li>
+      <li><a href="ref/enum_shifted_params.html">ENUM_SHIFTED_PARAMS</a></li>
+      <li><a href="ref/enum_shifted_params_z.html">ENUM_SHIFTED_PARAMS_Z</a></li>
+      <li><a href="ref/enum_shifted_z.html">ENUM_SHIFTED_<i>z</i></a></li>
+      <li><a href="ref/enum_trailing.html">ENUM_TRAILING</a></li>
+      <li><a href="ref/etbp.html">ENUM_TRAILING_BINARY_PARAMS</a></li>
+      <li><a href="ref/etbpz.html">ENUM_TRAILING_BINARY_PARAMS_Z</a></li>
+      <li><a href="ref/enum_trailing_params.html">ENUM_TRAILING_PARAMS</a></li>
+      <li><a href="ref/enum_trailing_params_z.html">ENUM_TRAILING_PARAMS_Z</a></li>
+      <li><a href="ref/enum_trailing_z.html">ENUM_TRAILING_<i>z</i></a></li>
+      <li><a href="ref/enum_z.html">ENUM_<i>z</i></a></li>
+      <li><a href="ref/equal.html">EQUAL</a></li>
+      <li><a href="ref/equal_d.html">EQUAL_D*</a></li>
+      <li><a href="ref/expand.html">EXPAND</a></li>
+      <li><a href="ref/expr_if.html">EXPR_IF</a></li>
+      <li><a href="ref/expr_iif.html">EXPR_IIF</a></li>
+      <!-- F -->
+      <li><a href="ref/filename_x.html">FILENAME_<i>x</i></a></li>
+      <li><a href="ref/for.html">FOR</a></li>
+      <li><a href="ref/for_r.html">FOR_<i>r</i></a></li>
+      <li><a href="ref/frame_finish.html">FRAME_FINISH</a></li>
+      <li><a href="ref/frame_flags.html">FRAME_FLAGS</a></li>
+      <li><a href="ref/frame_iteration.html">FRAME_ITERATION</a></li>
+      <li><a href="ref/frame_start.html">FRAME_START</a></li>
+      <!-- G -->
+      <li><a href="ref/greater.html">GREATER</a></li>
+      <li><a href="ref/greater_d.html">GREATER_D</a></li>
+      <li><a href="ref/greater_equal.html">GREATER_EQUAL</a></li>
+      <li><a href="ref/greater_equal_d.html">GREATER_EQUAL_D</a></li>
+      <!-- I -->
+      <li><a href="ref/identity.html">IDENTITY</a></li>
+      <li><a href="ref/identity_n.html">IDENTITY_N</a></li>
+      <li><a href="ref/if.html">IF</a></li>
+      <li><a href="ref/iif.html">IIF</a></li>
+      <li><a href="ref/inc.html">INC</a></li>
+      <li><a href="ref/include_self.html">INCLUDE_SELF</a></li>
+      <li><a href="ref/indirect_self.html">INDIRECT_SELF</a></li>
+      <li><a href="ref/intercept.html">INTERCEPT</a></li>
+      <li><a href="ref/is_begin_parens.html">IS_BEGIN_PARENS</a> <a href="topics/variadic_macros.html#VNotation">(v)</a></li>
+      <li><a href="ref/is_iterating.html">IS_ITERATING</a></li>
+      <li><a href="ref/is_selfish.html">IS_SELFISH</a></li>
+      <li><a href="ref/iterate.html">ITERATE</a></li>
+      <li><a href="ref/iteration.html">ITERATION</a></li>
+      <li><a href="ref/iteration_depth.html">ITERATION_DEPTH</a></li>
+      <li><a href="ref/iteration_finish.html">ITERATION_FINISH</a></li>
+      <li><a href="ref/iteration_flags.html">ITERATION_FLAGS</a></li>
+      <li><a href="ref/iteration_limits.html">ITERATION_LIMITS</a></li>
+      <li><a href="ref/iteration_params_x.html">ITERATION_PARAMS_<i>x</i></a></li>
+      <li><a href="ref/iteration_start.html">ITERATION_START</a></li>
+      <!-- L -->
+      <li><a href="ref/less.html">LESS</a></li>
+      <li><a href="ref/less_d.html">LESS_D</a></li>
+      <li><a href="ref/less_equal.html">LESS_EQUAL</a></li>
+      <li><a href="ref/less_equal_d.html">LESS_EQUAL_D</a></li>
+      <li><a href="ref/limit_dim.html">LIMIT_DIM</a></li>
+      <li><a href="ref/limit_for.html">LIMIT_FOR</a></li>
+      <li><a href="ref/limit_iteration.html">LIMIT_ITERATION</a></li>
+      <li><a href="ref/limit_iteration_dim.html">LIMIT_ITERATION_DIM</a></li>
+      <li><a href="ref/limit_mag.html">LIMIT_MAG</a></li>
+      <li><a href="ref/limit_repeat.html">LIMIT_REPEAT</a></li>
+      <li><a href="ref/limit_seq.html">LIMIT_SEQ</a></li>
+      <li><a href="ref/limit_slot_count.html">LIMIT_SLOT_COUNT</a></li>
+      <li><a href="ref/limit_slot_sig.html">LIMIT_SLOT_SIG</a></li>
+      <li><a href="ref/limit_tuple.html">LIMIT_TUPLE</a></li>
+      <li><a href="ref/limit_variadic.html">LIMIT_VARIADIC</a></li>
+      <li><a href="ref/limit_while.html">LIMIT_WHILE</a></li>
+      <li><a href="ref/line.html">LINE</a></li>
+      <li><a href="ref/list_append.html">LIST_APPEND</a></li>
+      <li><a href="ref/list_append_d.html">LIST_APPEND_D</a></li>
+      <li><a href="ref/list_at.html">LIST_AT</a></li>
+      <li><a href="ref/list_at_d.html">LIST_AT_D</a></li>
+      <li><a href="ref/list_cat.html">LIST_CAT</a></li>
+      <li><a href="ref/list_cat_d.html">LIST_CAT_D</a></li>
+      <li><a href="ref/list_cons.html">LIST_CONS*</a></li>
+      <li><a href="ref/list_enum.html">LIST_ENUM</a></li>
+      <li><a href="ref/list_enum_r.html">LIST_ENUM_R</a></li>
+      <li><a href="ref/list_filter.html">LIST_FILTER</a></li>
+      <li><a href="ref/list_filter_d.html">LIST_FILTER_D</a></li>
+      <li><a href="ref/list_first.html">LIST_FIRST</a></li>
+      <li><a href="ref/list_first_n.html">LIST_FIRST_N</a></li>
+      <li><a href="ref/list_first_n_d.html">LIST_FIRST_N_D</a></li>
+      <li><a href="ref/list_fold_left.html">LIST_FOLD_LEFT</a></li>
+      <li><a href="ref/list_fold_left_2nd.html">LIST_FOLD_LEFT_2ND*</a></li>
+      <li><a href="ref/list_fold_left_2nd_d.html">LIST_FOLD_LEFT_2ND_D*</a></li>
+      <li><a href="ref/list_fold_left_d.html">LIST_FOLD_LEFT_<i>d</i></a></li>
+      <li><a href="ref/list_fold_left_d_old.html">LIST_FOLD_LEFT_D*</a></li>
+      <li><a href="ref/list_fold_right.html">LIST_FOLD_RIGHT</a></li>
+      <li><a href="ref/list_fold_right_2nd.html">LIST_FOLD_RIGHT_2ND*</a></li>
+      <li><a href="ref/list_fold_right_2nd_d.html">LIST_FOLD_RIGHT_2ND_D*</a></li>
+      <li><a href="ref/list_fold_right_d.html">LIST_FOLD_RIGHT_<i>d</i></a></li>
+      <li><a href="ref/list_fold_right_d_old.html">LIST_FOLD_RIGHT_D*</a></li>
+      <li><a href="ref/list_for_each.html">LIST_FOR_EACH</a></li>
+      <li><a href="ref/list_for_each_i.html">LIST_FOR_EACH_I</a></li>
+      <li><a href="ref/list_for_each_i_r.html">LIST_FOR_EACH_I_R</a></li>
+      <li><a href="ref/list_for_each_product.html">LIST_FOR_EACH_PRODUCT</a></li>
+      <li><a href="ref/list_for_each_product_r.html">LIST_FOR_EACH_PRODUCT_R</a></li>
+      <li><a href="ref/list_for_each_r.html">LIST_FOR_EACH_R</a></li>
+      <li><a href="ref/list_is_cons.html">LIST_IS_CONS</a></li>
+      <li><a href="ref/list_is_nil.html">LIST_IS_NIL</a></li>
+      <li><a href="ref/list_nil.html">LIST_NIL*</a></li>
+      <li><a href="ref/list_rest.html">LIST_REST</a></li>
+      <li><a href="ref/list_rest_n.html">LIST_REST_N</a></li>
+      <li><a href="ref/list_rest_n_d.html">LIST_REST_N_D</a></li>
+      <li><a href="ref/list_reverse.html">LIST_REVERSE</a></li>
+      <li><a href="ref/list_reverse_d.html">LIST_REVERSE_D</a></li>
+      <li><a href="ref/list_size.html">LIST_SIZE</a></li>
+      <li><a href="ref/list_size_d.html">LIST_SIZE_D</a></li>
+      <li><a href="ref/list_to_array.html">LIST_TO_ARRAY</a></li>
+      <li><a href="ref/list_to_array_d.html">LIST_TO_ARRAY_D</a></li>
+      <li><a href="ref/list_to_seq.html">LIST_TO_SEQ</a></li>
+      <li><a href="ref/list_to_seq_r.html">LIST_TO_SEQ_R</a></li>
+      <li><a href="ref/list_to_tuple.html">LIST_TO_TUPLE</a></li>
+      <li><a href="ref/list_to_tuple_r.html">LIST_TO_TUPLE_R</a></li>
+      <li><a href="ref/list_transform.html">LIST_TRANSFORM</a></li>
+      <li><a href="ref/list_transform_d.html">LIST_TRANSFORM_D</a></li>
+      <li><a href="ref/local_iterate.html">LOCAL_ITERATE</a></li>
+      <li><a href="ref/local_limits.html">LOCAL_LIMITS</a></li>
+      <li><a href="ref/local_macro.html">LOCAL_MACRO</a></li>
+      <li><a href="ref/lparen.html">LPAREN</a></li>
+      <li><a href="ref/lparen_if.html">LPAREN_IF</a></li>
+      <!-- M -->
+      <li><a href="ref/max.html">MAX</a></li>
+      <li><a href="ref/max_d.html">MAX_D</a></li>
+      <li><a href="ref/min.html">MIN</a></li>
+      <li><a href="ref/min_d.html">MIN_D</a></li>
+      <li><a href="ref/mod.html">MOD</a></li>
+      <li><a href="ref/mod_d.html">MOD_D</a></li>
+      <li><a href="ref/mul.html">MUL</a></li>
+      <li><a href="ref/mul_d.html">MUL_D</a></li>
+      <!-- N -->
+      <li><a href="ref/nil.html">NIL</a></li>
+      <li><a href="ref/nor.html">NOR</a></li>
+      <li><a href="ref/not.html">NOT</a></li>
+      <li><a href="ref/not_equal.html">NOT_EQUAL</a></li>
+      <li><a href="ref/not_equal_d.html">NOT_EQUAL_D*</a></li>
+      <!-- O -->
+      <li><a href="ref/or.html">OR</a></li>
+      <li><a href="ref/overload.html">OVERLOAD</a> <a href="topics/variadic_macros.html#VNotation">(v)</a></li>
+      <!-- R -->
+      <li><a href="ref/relative_finish.html">RELATIVE_FINISH</a></li>
+      <li><a href="ref/relative_flags.html">RELATIVE_FLAGS</a></li>
+      <li><a href="ref/relative_iteration.html">RELATIVE_ITERATION</a></li>
+      <li><a href="ref/relative_start.html">RELATIVE_START</a></li>
+      <li><a href="ref/remove_parens.html">REMOVE_PARENS</a> <a href="topics/variadic_macros.html#VNotation">(v)</a></li>
+      <li><a href="ref/repeat.html">REPEAT</a></li>
+      <li><a href="ref/repeat_1st.html">REPEAT_1ST*</a></li>
+      <li><a href="ref/repeat_2nd.html">REPEAT_2ND*</a></li>
+      <li><a href="ref/repeat_3rd.html">REPEAT_3RD*</a></li>
+      <li><a href="ref/repeat_from_to.html">REPEAT_FROM_TO</a></li>
+      <li><a href="ref/repeat_from_to_1st.html">REPEAT_FROM_TO_1ST*</a></li>
+      <li><a href="ref/repeat_from_to_2nd.html">REPEAT_FROM_TO_2ND*</a></li>
+      <li><a href="ref/repeat_from_to_3rd.html">REPEAT_FROM_TO_3RD*</a></li>
+      <li><a href="ref/repeat_from_to_d.html">REPEAT_FROM_TO_D</a></li>
+      <li><a href="ref/repeat_from_to_d_z.html">REPEAT_FROM_TO_D_<i>z</i></a></li>
+      <li><a href="ref/repeat_from_to_z.html">REPEAT_FROM_TO_<i>z</i></a></li>
+      <li><a href="ref/repeat_z.html">REPEAT_<i>z</i></a></li>
+      <li><a href="ref/rparen.html">RPAREN</a></li>
+      <li><a href="ref/rparen_if.html">RPAREN_IF</a></li>
+      <!-- S -->
+      <li><a href="ref/seq_cat.html">SEQ_CAT</a></li>
+      <li><a href="ref/seq_cat_s.html">SEQ_CAT_S</a></li>
+      <li><a href="ref/seq_elem.html">SEQ_ELEM</a></li>
+      <li><a href="ref/seq_enum.html">SEQ_ENUM</a></li>
+      <li><a href="ref/seq_filter.html">SEQ_FILTER</a></li>
+      <li><a href="ref/seq_filter_s.html">SEQ_FILTER_S</a></li>
+      <li><a href="ref/seq_first_n.html">SEQ_FIRST_N</a></li>
+      <li><a href="ref/seq_fold_left.html">SEQ_FOLD_LEFT</a></li>
+      <li><a href="ref/seq_fold_left_s.html">SEQ_FOLD_LEFT_<i>s</i></a></li>
+      <li><a href="ref/seq_fold_right.html">SEQ_FOLD_RIGHT</a></li>
+      <li><a href="ref/seq_fold_right_s.html">SEQ_FOLD_RIGHT_<i>s</i></a></li>
+      <li><a href="ref/seq_for_each.html">SEQ_FOR_EACH</a></li>
+      <li><a href="ref/seq_for_each_i.html">SEQ_FOR_EACH_I</a></li>
+      <li><a href="ref/seq_for_each_i_r.html">SEQ_FOR_EACH_I_R</a></li>
+      <li><a href="ref/seq_for_each_product.html">SEQ_FOR_EACH_PRODUCT</a></li>
+      <li><a href="ref/seq_for_each_product_r.html">SEQ_FOR_EACH_PRODUCT_R</a></li>
+      <li><a href="ref/seq_for_each_r.html">SEQ_FOR_EACH_R</a></li>
+      <li><a href="ref/seq_head.html">SEQ_HEAD</a></li>
+      <li><a href="ref/seq_insert.html">SEQ_INSERT</a></li>
+      <li><a href="ref/seq_nil.html">SEQ_NIL</a></li>
+      <li><a href="ref/seq_pop_back.html">SEQ_POP_BACK</a></li>
+      <li><a href="ref/seq_pop_front.html">SEQ_POP_FRONT</a></li>
+      <li><a href="ref/seq_push_back.html">SEQ_PUSH_BACK</a></li>
+      <li><a href="ref/seq_push_front.html">SEQ_PUSH_FRONT</a></li>
+      <li><a href="ref/seq_remove.html">SEQ_REMOVE</a></li>
+      <li><a href="ref/seq_replace.html">SEQ_REPLACE</a></li>
+      <li><a href="ref/seq_rest_n.html">SEQ_REST_N</a></li>
+      <li><a href="ref/seq_reverse.html">SEQ_REVERSE</a></li>
+      <li><a href="ref/seq_reverse_s.html">SEQ_REVERSE_S</a></li>
+      <li><a href="ref/seq_size.html">SEQ_SIZE</a></li>
+      <li><a href="ref/seq_subseq.html">SEQ_SUBSEQ</a></li>
+      <li><a href="ref/seq_tail.html">SEQ_TAIL</a></li>
+      <li><a href="ref/seq_to_array.html">SEQ_TO_ARRAY</a></li>
+      <li><a href="ref/seq_to_list.html">SEQ_TO_LIST</a></li>
+      <li><a href="ref/seq_to_tuple.html">SEQ_TO_TUPLE</a></li>
+      <li><a href="ref/seq_transform.html">SEQ_TRANSFORM</a></li>
+      <li><a href="ref/seq_transform_s.html">SEQ_TRANSFORM_S</a></li>
+      <li><a href="ref/slot.html">SLOT</a></li>
+      <li><a href="ref/stringize.html">STRINGIZE</a></li>
+      <li><a href="ref/sub.html">SUB</a></li>
+      <li><a href="ref/sub_d.html">SUB_D</a></li>
+      <!-- T -->
+      <li><a href="ref/tuple_eat.html">TUPLE_EAT</a> <a href="topics/variadic_macros.html#VNotation">(v)</a></li>
+      <li><a href="ref/tuple_elem.html">TUPLE_ELEM</a> <a href="topics/variadic_macros.html#VNotation">(v)</a></li>
+      <li><a href="ref/tuple_enum.html">TUPLE_ENUM</a> <a href="topics/variadic_macros.html#VNotation">(v)</a></li>
+      <li><span style="color: gray;"></span><a href="ref/tuple_insert.html">TUPLE_INSERT</a>
+        <a href="topics/variadic_macros.html#VNotation">(v)</a></li>
+      <li><a href="ref/tuple_insert_d.html">TUPLE_INSERT_D</a> <a href="topics/variadic_macros.html#VNotation">(v)</a></li>
+      <li><a href="ref/tuple_pop_back.html">TUPLE_POP_BACK</a> <a href="topics/variadic_macros.html#VNotation">(v)</a></li>
+      <li><a href="ref/tuple_pop_back_z.html">TUPLE_POP_BACK_Z</a> <a href="topics/variadic_macros.html#VNotation">(v)</a></li>
+      <li><a href="ref/tuple_pop_front.html">TUPLE_POP_FRONT</a> <a href="topics/variadic_macros.html#VNotation">(v)</a></li>
+      <li><a href="ref/tuple_pop_front_z.html">TUPLE_POP_FRONT_Z</a> <a href="topics/variadic_macros.html#VNotation">(v)</a></li>
+      <li><a href="ref/tuple_push_back.html">TUPLE_PUSH_BACK</a> <a href="topics/variadic_macros.html#VNotation">(v)</a></li>
+      <li><a href="ref/tuple_push_front.html">TUPLE_PUSH_FRONT</a> <a href="topics/variadic_macros.html#VNotation">(v)</a></li>
+      <li><a href="ref/tuple_rem.html">TUPLE_REM</a> <a href="topics/variadic_macros.html#VNotation">(v)</a></li>
+      <li><a href="ref/tuple_rem_ctor.html">TUPLE_REM_CTOR</a> <a href="topics/variadic_macros.html#VNotation">(v)</a></li>
+      <li><a href="ref/tuple_remove.html">TUPLE_REMOVE</a> <a href="topics/variadic_macros.html#VNotation">(v)</a></li>
+      <li><a href="ref/tuple_remove_d.html">TUPLE_REMOVE_D</a> <a href="topics/variadic_macros.html#VNotation">(v)</a></li>
+      <li><a href="ref/tuple_replace.html">TUPLE_REPLACE</a> <a href="topics/variadic_macros.html#VNotation">(v)</a></li>
+      <li><a href="ref/tuple_replace_d.html">TUPLE_REPLACE_D</a> <a href="topics/variadic_macros.html#VNotation">(v)</a></li>
+      <li><a href="ref/tuple_reverse.html">TUPLE_REVERSE</a> <a href="topics/variadic_macros.html#VNotation">(v)</a></li>
+      <li><a href="ref/tuple_size.html">TUPLE_SIZE</a> <a href="topics/variadic_macros.html#VNotation">(v)</a></li>
+      <li><a href="ref/tuple_to_array.html">TUPLE_TO_ARRAY</a> <a href="topics/variadic_macros.html#VNotation">(v)</a></li>
+      <li><a href="ref/tuple_to_list.html">TUPLE_TO_LIST</a> <a href="topics/variadic_macros.html#VNotation">(v)</a></li>
+      <li><a href="ref/tuple_to_seq.html">TUPLE_TO_SEQ</a> <a href="topics/variadic_macros.html#VNotation">(v)</a></li>
+      <!-- U -->
+      <li><a href="ref/update_counter.html">UPDATE_COUNTER</a></li>
+      <!-- V -->
+      <li><a href="ref/value.html">VALUE</a></li>
+      <li><a href="ref/variadics.html">VARIADICS</a></li>
+      <li><a href="ref/variadic_elem.html">VARIADIC_ELEM</a> <a href="topics/variadic_macros.html#VNotation">(v)</a></li>
+      <li><a href="ref/variadic_seq_to_seq.html">VARIADIC_SEQ_TO_SEQ</a> <a href="topics/variadic_macros.html#VNotation">(v)</a></li>
+      <li><a href="ref/variadic_size.html">VARIADIC_SIZE</a> <a href="topics/variadic_macros.html#VNotation">(v)</a></li>
+      <li><a href="ref/variadic_to_array.html">VARIADIC_TO_ARRAY</a> <a href="topics/variadic_macros.html#VNotation">(v)</a></li>
+      <li><a href="ref/variadic_to_list.html">VARIADIC_TO_LIST</a> <a href="topics/variadic_macros.html#VNotation">(v)</a></li>
+      <li><a href="ref/variadic_to_seq.html">VARIADIC_TO_SEQ</a> <a href="topics/variadic_macros.html#VNotation">(v)</a></li>
+      <li><a href="ref/variadic_to_tuple.html">VARIADIC_TO_TUPLE</a> <a href="topics/variadic_macros.html#VNotation">(v)</a></li>
+      <!-- W -->
+      <li><a href="ref/while.html">WHILE</a></li>
+      <li><a href="ref/while_d.html">WHILE_<i>d</i></a></li>
+      <li><a href="ref/wstringize.html">WSTRINGIZE</a></li>
+      <!-- X -->
+      <li><a href="ref/xor.html">XOR</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>
--- a/doc/ref/add.html
+++ b/doc/ref/add.html
@@ -34,7 +34,7 @@
 			It is more efficient, however, to use <b>BOOST_PP_ADD_D</b> in such a situation.
 		</div>
 		<div>
-			This macro is the most efficient when <i>x</i> is less than or equal to <i>y</i>.&nbsp;
+			This macro is the most efficient when <i>x</i> is greater than or equal to <i>y</i>.&nbsp;
 			However, the efficiency gain is not worth actually comparing the two arguments prior to invocation.&nbsp;
 			In other words, <i>x</i> should be the addend that is <i>most likely</i> to be the largest of the two operands.
 		</div>
--- a/doc/ref/add_d.html
+++ b/doc/ref/add_d.html
@@ -34,7 +34,7 @@
 			If the sum of <i>x</i> and <i>y</i> is greater than <b>BOOST_PP_LIMIT_MAG</b>, the result is saturated to <b>BOOST_PP_LIMIT_MAG</b>.
 		</div>
 		<div>
-			This macro is the most efficient when <i>x</i> is less than or equal to <i>y</i>.&nbsp;
+			This macro is the most efficient when <i>x</i> is greater than or equal to <i>y</i>.&nbsp;
 			However, the efficiency gain is not worth actually comparing the two arguments prior to invocation.&nbsp;
 			In other words, <i>x</i> should be the addend that is <i>most likely</i> to be the largest of the two operands.
 		</div>
--- a/doc/ref/array_enum.html
+++ b/doc/ref/array_enum.html
@@ -0,0 +1,37 @@
+<html>
+<head>
+  <title>BOOST_PP_ARRAY_ENUM</title>
+  <link rel="stylesheet" type="text/css" href="../styles.css">
+</head>
+<body>
+  <div style="margin-left: 0px;"> The <b>BOOST_PP_ARRAY_ENUM</b> macro converts an <i>array</i> to its comma-separated elements. The comma-separated elements are in the form of <i>variadic data</i>.<br>
+  </div>
+<h4> Usage </h4>
+<div class="code"> <b>BOOST_PP_ARRAY_ENUM</b>(<i>array</i>) </div>
+<h4> Arguments </h4>
+<dl>
+  <dt>array</dt>
+  <dd> The <i>array</i> whose elements are to be converted. </dd>
+</dl>
+<h4> Remarks </h4>
+<div> This macro expands to a comma-separated list of the elements in <i>array</i>.&nbsp;
+For example, <b>BOOST_PP_ARRAY_ENUM</b>((3,(<i>x,</i><i>y,</i><i>z</i>)))
+expands to...
+<div> <i>x</i>, <i>y</i>, <i>z</i> </div>
+</div>
+<h4> Requirements </h4>
+<div> <b>Header:</b> &nbsp;<a href="../headers/array/enum.html">&lt;boost/preprocessor/array/enum.hpp&gt;</a>
+</div>
+<h4> Sample Code </h4>
+<div>
+<pre>#include &lt;<a href="../headers/array/enum.html">boost/preprocessor/array/enum.hpp</a>&gt;<br><br>#define ARRAY (5,(B,O,O,S,T))<br><br><a href="array_enum.html">BOOST_PP_ARRAY_ENUM</a>(ARRAY) // expands to B, O, O, S, T<br></pre>
+</div>
+<hr size="1">
+<div style="margin-left: 0px;"> <i></i><i>© Copyright Edward Diener 2011</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>
--- a/doc/ref/array_pop_front.html
+++ b/doc/ref/array_pop_front.html
@@ -1,59 +1,51 @@
 <html>
-<head>
-	<title>BOOST_PP_ARRAY_POP_FRONT</title>
-	<link rel="stylesheet" type="text/css" href="../styles.css">
-</head>
-<body>
-	<div style="margin-left:  0px;">
-		The <b>BOOST_PP_ARRAY_POP_FRONT</b> macro pops an element from the end of an <i>array</i>.
-	</div>
-	<h4>Usage</h4>
-		<div class="code">
-			<b>BOOST_PP_ARRAY_POP_FRONT</b>(<i>array</i>)
-		</div>
-	<h4>Arguments</h4>
-		<dl>
-			<dt>array</dt>
-			<dd>
-				The <i>array</i> to pop an element from.
-			</dd>
-		</dl>
-	<h4>Remarks</h4>
-		<div>
-			This macro returns <i>array</i> after removing the first element.&nbsp;
-			If <i>array</i> has no elements, the result of applying this macro is undefined.
-		</div>
-		<div>
-			This macro uses <b>BOOST_PP_REPEAT</b> internally.&nbsp;
-			Therefore, to use the <i>z</i> parameter passed from other macros that use
-			<b>BOOST_PP_REPEAT</b>, see <b>BOOST_PP_ARRAY_POP_FRONT_Z</b>
-		</div>
-	<h4>See Also</h4>
-		<ul>
-			<li><a href="array_pop_front_z.html">BOOST_PP_ARRAY_POP_FRONT_Z</a></li>
-		</ul>
-	<h4>Requirements</h4>
-		<div>
-			<b>Header:</b> &nbsp;<a href="../headers/array/pop_front.html">&lt;boost/preprocessor/array/pop_front.hpp&gt;</a>
-		</div>
-	<h4>Sample Code</h4>
-<div><pre>
-#include &lt;<a href="../headers/array/pop_front.html">boost/preprocessor/array/pop_front.hpp</a>&gt;
+  <head>
+    <meta content="text/html; charset=windows-1252" http-equiv="content-type">
+    <title>BOOST_PP_ARRAY_POP_FRONT</title>
+    <link rel="stylesheet" type="text/css" href="../styles.css">
+  </head>
+  <body>
+    <div style="margin-left:  0px;"> The <b>BOOST_PP_ARRAY_POP_FRONT</b> macro
+      pops an element from the beginning of an <i>array</i>.</div>
+    <h4>Usage</h4>
+    <div class="code"> <b>BOOST_PP_ARRAY_POP_FRONT</b>(<i>array</i>) </div>
+    <h4>Arguments</h4>
+    <dl>
+      <dt>array</dt>
+      <dd> The <i>array</i> to pop an element from. </dd>
+    </dl>
+    <h4>Remarks</h4>
+    <div> This macro returns <i>array</i> after removing the first
+      element.&nbsp; If <i>array</i> has no elements, the result of applying
+      this macro is undefined. </div>
+    <div> This macro uses <b>BOOST_PP_REPEAT</b> internally.&nbsp; Therefore,
+      to use the <i>z</i> parameter passed from other macros that use <b>BOOST_PP_REPEAT</b>,
+      see <b>BOOST_PP_ARRAY_POP_FRONT_Z</b> </div>
+    <h4>See Also</h4>
+    <ul>
+      <li><a href="array_pop_front_z.html">BOOST_PP_ARRAY_POP_FRONT_Z</a></li>
+    </ul>
+    <h4>Requirements</h4>
+    <div> <b>Header:</b> &nbsp;<a href="../headers/array/pop_front.html">&lt;boost/preprocessor/array/pop_front.hpp&gt;</a>
+    </div>
+    <h4>Sample Code</h4>
+    <div>
+      <pre>#include &lt;<a href="../headers/array/pop_front.html">boost/preprocessor/array/pop_front.hpp</a>&gt;

 #define ARRAY (3, (a, b, c))

 <a href="array_pop_front.html">BOOST_PP_ARRAY_POP_FRONT</a>(ARRAY) // expands to (2, (b, c))
 </pre></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>
+    <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<br>
+      </i><i>© Copyright Edward Diener 2013</i><br>
+    </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>
--- a/doc/ref/array_to_list.html
+++ b/doc/ref/array_to_list.html
@@ -0,0 +1,41 @@
+<html>
+  <head>
+    <meta content="text/html; charset=windows-1252" http-equiv="content-type">
+    <title>BOOST_PP_ARRAY_TO_LIST</title>
+    <link rel="stylesheet" type="text/css" href="../styles.css">
+  </head>
+  <body>
+    <div style="margin-left: 0px;"> The <b>BOOST_PP_ARRAY_TO_LIST</b> macro
+      converts an <i>array</i> to a <i>list</i>. </div>
+    <h4>Usage</h4>
+    <div class="code"> <b>BOOST_PP_ARRAY_TO_LIST</b>(<i>array</i>) </div>
+    <h4>Arguments</h4>
+    <dl>
+      <dt>array</dt>
+      <dd> The <i>array</i> to be converted.</dd>
+    </dl>
+    <ul>
+    </ul>
+    <h4>Remarks</h4>
+    <p>&nbsp;&nbsp;&nbsp; If the <i>array</i> to be converted is empty, as
+      represented by '( 0, () )', the resulting <i>list</i> is empty, as
+      represented by 'BOOST_PP_NIL'.</p>
+    <h4>Requirements</h4>
+    <div> <b>Header:</b> &nbsp;<a href="../headers/array/to_list.html">&lt;boost/preprocessor/array/to_list.hpp&gt;</a>
+    </div>
+    <h4>Sample Code</h4>
+    <div>
+      <pre>#include &lt;<a href="../headers/array/to_list.html">boost/preprocessor/array/to_list.hpp</a>&gt;<br><br><a
+href="array_to_list.html">BOOST_PP_ARRAY_TO_LIST</a>((3, (x, y, z)))<br>   // expands to (x, (y, (z, <a
+href="nil.html">BOOST_PP_NIL</a>)))</pre>
+    </div>
+    <hr size="1">
+    <div style="margin-left: 0px;"> <i>© Copyright Edward Diener 2011</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>
+    s
+  </body>
+</html>
--- a/doc/ref/array_to_seq.html
+++ b/doc/ref/array_to_seq.html
@@ -0,0 +1,37 @@
+<html>
+  <head>
+    <meta content="text/html; charset=windows-1252" http-equiv="content-type">
+    <title>BOOST_PP_ARRAY_TO_SEQ</title>
+    <link rel="stylesheet" type="text/css" href="../styles.css">
+  </head>
+  <body>
+    <div style="margin-left: 0px;"> The <b>BOOST_PP_ARRAY_TO_SEQ</b> macro
+      converts an <i>array</i> to a <i>seq</i>. </div>
+    <h4> Usage </h4>
+    <div class="code"> <b>BOOST_PP_ARRAY_TO_SEQ</b>(<i>array</i>) </div>
+    <h4> Arguments </h4>
+    <dl>
+      <dt>array</dt>
+      <dd> The <i>array</i> to be converted.</dd>
+    </dl>
+    <h4>Remarks</h4>
+    <p>&nbsp;&nbsp;&nbsp; If the <i>array</i> to be converted is empty, as
+      represented by '( 0, () )', the resulting <i>seq</i> is undefined since a
+      <i>seq</i> cannot be empty.</p>
+    <h4>Requirements </h4>
+    <div> <b>Header:</b> &nbsp;<a href="../headers/array/to_seq.html">&lt;boost/preprocessor/array/to_seq.hpp&gt;</a>
+    </div>
+    <h4> Sample Code </h4>
+    <div>
+      <pre>#include &lt;<a href="../headers/array/to_seq.html">boost/preprocessor/array/to_seq.hpp</a>&gt;<br><br><a
+href="array_to_seq.html">BOOST_PP_ARRAY_TO_SEQ</a>((3, (a, b, c))) // expands to (a)(b)(c)</pre>
+    </div>
+    <hr size="1">
+    <div style="margin-left: 0px;"> <i>© Copyright Edward Diener 2011</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>
--- a/doc/ref/array_to_tuple.html
+++ b/doc/ref/array_to_tuple.html
@@ -0,0 +1,39 @@
+<html>
+  <head>
+    <meta content="text/html; charset=windows-1252" http-equiv="content-type">
+    <title>BOOST_PP_ARRAY_TO_TUPLE</title>
+    <link rel="stylesheet" type="text/css" href="../styles.css">
+  </head>
+  <body>
+    <div style="margin-left: 0px;"> The <b>BOOST_PP_ARRAY_TO_TUPLE</b> macro
+      converts an <i>array</i> to an <i>tuple</i>. </div>
+    <h4> Usage </h4>
+    <div class="code"> <b>BOOST_PP_ARRAY_TO_TUPLE</b>(<i>array</i>) </div>
+    <h4> Arguments </h4>
+    <dl>
+      <dt>array</dt>
+      <dd> The <i>array</i> to be converted.</dd>
+    </dl>
+    <h4>Remarks</h4>
+    <p>&nbsp;&nbsp;&nbsp; If the <i>array</i> to be converted is empty, as
+      represented by '( 0, () )', the resulting <i>tuple</i> is undefined
+      since a <i>tuple</i> cannot be empty.</p>
+    <h4>Requirements </h4>
+    <div> <b>Header:</b> &nbsp;<a href="../headers/array/to_tuple.html">&lt;boost/preprocessor/array/to_tuple.hpp&gt;</a>
+    </div>
+    <h4> Sample Code </h4>
+    <div>
+      <pre>#include &lt;<a href="../headers/array/to_tuple.html">boost/preprocessor/array/to_tuple.hpp</a>&gt;<br><br>#define ARRAY (3,(a, b, c))<br><br><a
+
+href="array_to_tuple.html">BOOST_PP_ARRAY_TO_TUPLE</a>(ARRAY) // expands to (a, b, c)</pre>
+    </div>
+    <hr size="1">
+    <div style="margin-left: 0px;"> <i></i><i>© Copyright Edward Diener 2011</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>
--- a/doc/ref/enum_params_with_defaults.html
+++ b/doc/ref/enum_params_with_defaults.html
@@ -64,10 +64,10 @@
 #include &lt;<a href="../headers/repetition/epwd.html">boost/preprocessor/repetition/enum_params_with_defaults.hpp</a>&gt;

 <a href="enum_params_with_defaults.html">BOOST_PP_ENUM_PARAMS_WITH_DEFAULTS</a>(3, class T, U)
-   // expands to T0 = U0, T1 = U1, T2 = U2
+   // expands to class T0 = U0, class T1 = U1, class T2 = U2

 <a href="enum_binary_params.html">BOOST_PP_ENUM_BINARY_PARAMS</a>(3, class T, = U)
-   // expands to T0 = U0, T1 = U1, T2 = U2
+   // expands to class T0 = U0, class T1 = U1, class T2 = U2
 </pre></div>
 	<hr size="1">
 	<div style="margin-left: 0px;">
--- a/doc/ref/expand.html
+++ b/doc/ref/expand.html
@@ -22,7 +22,7 @@
 		<div>
 			This macro is useful when a delay is necessary to produce the correct semantics of a macro invocation.&nbsp;
 			For example, when a macro expands to an argument list to another macro.&nbsp;
-			This macro will expand the the argument list on the first pass, and then rescan to expand any more macros.
+			This macro will expand the argument list on the first pass, and then rescan to expand any more macros.
 		</div>
 	<h4>Requirements</h4>
 		<div>
--- a/doc/ref/for_r.html
+++ b/doc/ref/for_r.html
@@ -1,75 +1,68 @@
 <html>
-<head>
-	<title>BOOST_PP_FOR_r</title>
-	<link rel="stylesheet" type="text/css" href="../styles.css">
-</head>
-<body>
-	<div style="margin-left:  0px;">
-		The <b>BOOST_PP_FOR_<i>r</i></b> macro represents a reentry into the <b>BOOST_PP_FOR</b> repetition construct.
-	</div>
-	<h4>Usage</h4>
-		<div class="code">
-			<b>BOOST_PP_FOR_</b> ## <i>r</i>(<i>state</i>, <i>pred</i>, <i>op</i>, <i>macro</i>)
-		</div>
-	<h4>Arguments</h4>
-		<dl>
-			<dt>r</dt>
-			<dd>
-				The next available <b>BOOST_PP_FOR</b> repetition.
-			</dd>
-			<dt>state</dt>
-			<dd>
-				The initial state.
-			</dd>
-			<dt>pred</dt>
-			<dd>
-				A binary predicate of the form <i>pred</i>(<i>r</i>, <i>state</i>).&nbsp;
-				This macro must expand to an integer in the range of <i>0</i> to <b>BOOST_PP_LIMIT_MAG</b>.&nbsp;
-				<b>BOOST_PP_FOR</b> repeatedly expands <i>macro</i> while this predicate returns non-zero.&nbsp;
-				This macro is called with the next available <b>BOOST_PP_FOR</b> repetition and the current <i>state</i>.
-			</dd>
-			<dt>op</dt>
-			<dd>
-				A binary operation of the form <i>op</i>(<i>r</i>, <i>state</i>).&nbsp;
-				This operation is expanded by <b>BOOST_PP_FOR</b> with the next available <b>BOOST_PP_FOR</b> repetition and the current <i>state</i>.&nbsp;
-				This macro is repeatedly applied to the <i>state</i>, each time producing a new <i>state</i>, until <i>pred</i> returns <i>0</i>.
-			</dd>
-			<dt>macro</dt>
-			<dd>
-				A binary macro of the form <i>macro</i>(<i>r</i>, <i>state</i>).&nbsp;
-				This macro is expanded by <b>BOOST_PP_FOR</b> with the next available <b>BOOST_PP_FOR</b> repetition and the current <i>state</i>.&nbsp;
-				This macro is is repeated by <b>BOOST_PP_FOR</b> until <i>pred</i> returns <i>0</i>.
-			</dd>
-		</dl>
-	<h4>Remarks</h4>
-		<div>
-			This macro expands to the sequence:
-			<div>
-				<i>macro</i>(<i>r</i>, <i>state</i>) <i>macro</i>(<i>r</i>, <i>op</i>(<i>r</i>, <i>state</i>)) ... <i>macro</i>(<i>r</i>, <i>op</i>(<i>r</i>, ... <i>op</i>(<i>r</i>, <i>state</i>) ... ))
-			</div>
-		</div>
-		<div>
-			At certain times, it may be necessary to perform the concatenation with <b>BOOST_PP_CAT</b> rather than the preprocessor token-pasting operator.&nbsp;
-			This happens when the <i>r</i> value is a macro invocation itself.&nbsp;
-			It needs a delay to allow it to expand.&nbsp;
-			The syntax in such a scenario becomes:
-			<div>
-				<b>BOOST_PP_CAT</b>(<b>BOOST_PP_FOR_</b>, <i>r</i>)(<i>state</i>, <i>pred</i>, <i>op</i>, <i>macro</i>)
-			</div>
-		</div>
-	<h4>See Also</h4>
-		<ul>
-			<li><a href="cat.html">BOOST_PP_CAT</a></li>
-			<li><a href="for.html">BOOST_PP_FOR</a></li>
-			<li><a href="limit_mag.html">BOOST_PP_LIMIT_MAG</a></li>
-		</ul>
-	<h4>Requirements</h4>
-		<div>
-			<b>Header:</b> &nbsp;<a href="../headers/repetition/for.html">&lt;boost/preprocessor/repetition/for.hpp&gt;</a>
-		</div>
-	<h4>Sample Code</h4>
-<div><pre>
-#include &lt;<a href="../headers/arithmetic/dec.html">boost/preprocessor/arithmetic/dec.hpp</a>&gt;
+  <head>
+    <meta content="text/html; charset=windows-1252" http-equiv="content-type">
+    <title>BOOST_PP_FOR_r</title>
+    <link rel="stylesheet" type="text/css" href="../styles.css">
+  </head>
+  <body>
+    <div style="margin-left:  0px;"> The <b>BOOST_PP_FOR_<i>r</i></b> macro
+      represents a reentry into the <b>BOOST_PP_FOR</b> repetition construct. </div>
+    <h4>Usage</h4>
+    <div class="code"> <b>BOOST_PP_FOR_</b> ## <i>r</i>(<i>state</i>, <i>pred</i>,
+      <i>op</i>, <i>macro</i>) </div>
+    <h4>Arguments</h4>
+    <dl>
+      <dt>r</dt>
+      <dd> The next available <b>BOOST_PP_FOR</b> repetition. </dd>
+      <dt>state</dt>
+      <dd> The initial state. </dd>
+      <dt>pred</dt>
+      <dd> A binary predicate of the form <i>pred</i>(<i>r</i>, <i>state</i>).&nbsp;
+        This macro must expand to an integer in the range of <i>0</i> to <b>BOOST_PP_LIMIT_MAG</b>.&nbsp;
+        <b>BOOST_PP_FOR</b> repeatedly expands <i>macro</i> while this
+        predicate returns non-zero.&nbsp; This macro is called with the next
+        available <b>BOOST_PP_FOR</b> repetition and the current <i>state</i>.
+      </dd>
+      <dt>op</dt>
+      <dd> A binary operation of the form <i>op</i>(<i>r</i>, <i>state</i>).&nbsp;
+        This operation is expanded by <b>BOOST_PP_FOR</b> with the next
+        available <b>BOOST_PP_FOR</b> repetition and the current <i>state</i>.&nbsp;
+        This macro is repeatedly applied to the <i>state</i>, each time
+        producing a new <i>state</i>, until <i>pred</i> returns <i>0</i>. </dd>
+      <dt>macro</dt>
+      <dd> A binary macro of the form <i>macro</i>(<i>r</i>, <i>state</i>).&nbsp;
+        This macro is expanded by <b>BOOST_PP_FOR</b> with the next available <b>BOOST_PP_FOR</b>
+        repetition and the current <i>state</i>.&nbsp; This macro is is
+        repeated by <b>BOOST_PP_FOR</b> until <i>pred</i> returns <i>0</i>. </dd>
+    </dl>
+    <h4>Remarks</h4>
+    <div> This macro expands to the sequence:
+      <div> <i>macro</i>(<i>r</i>, <i>state</i>) <i>macro</i>(<i>r</i>, <i>op</i>(<i>r</i>,
+        <i>state</i>)) ... <i>macro</i>(<i>r</i>, <i>op</i>(<i>r</i>, ... <i>op</i>(<i>r</i>,
+        <i>state</i>) ... )) </div>
+    </div>
+    <div> At certain times, it may be necessary to perform the concatenation
+      with <b>BOOST_PP_CAT</b> rather than the preprocessor token-pasting
+      operator.&nbsp; This happens when the <i>r</i> value is a macro
+      invocation itself.&nbsp; It needs a delay to allow it to expand.&nbsp; The
+      syntax in such a scenario becomes:
+      <div> <b>BOOST_PP_CAT</b>(<b>BOOST_PP_FOR_</b>, <i>r</i>)(<i>state</i>,
+        <i>pred</i>, <i>op</i>, <i>macro</i>) </div>
+    </div>
+    <h4>See Also</h4>
+    <ul>
+      <li><a href="cat.html">BOOST_PP_CAT</a></li>
+      <li><a href="for.html">BOOST_PP_FOR</a></li>
+      <li><a href="limit_mag.html">BOOST_PP_LIMIT_MAG</a></li>
+      <li><a href="for_r_macros.html"><span style="color: gray;">Macros with R
+            re-entrancy forms</span></a></li>
+    </ul>
+    <h4>Requirements</h4>
+    <div> <b>Header:</b> &nbsp;<a href="../headers/repetition/for.html">&lt;boost/preprocessor/repetition/for.hpp&gt;</a>
+    </div>
+    <h4>Sample Code</h4>
+    <div>
+      <pre>#include &lt;<a href="../headers/arithmetic/dec.html">boost/preprocessor/arithmetic/dec.hpp</a>&gt;
 #include &lt;<a href="../headers/arithmetic/inc.html">boost/preprocessor/arithmetic/inc.hpp</a>&gt;
 #include &lt;<a href="../headers/comparison/not_equal.html">boost/preprocessor/comparison/not_equal.hpp</a>&gt;
 #include &lt;<a href="../headers/punctuation/comma_if.html">boost/preprocessor/punctuation/comma_if.hpp</a>&gt;
@@ -140,16 +133,16 @@ TEMPLATE_TEMPLATE(2, 4, T)
   template&lt;class, class, class, class&gt; class T4
 */
 </pre></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>
+    <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<br>
+      </i><i>© Copyright Edward Diener 2014</i><br>
+    </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>
--- a/doc/ref/for_r_macros.html
+++ b/doc/ref/for_r_macros.html
@@ -0,0 +1,44 @@
+<html>
+  <head>
+    <meta content="text/html; charset=windows-1252" http-equiv="content-type">
+    <title>BOOST_PP_FOR_r_macros</title>
+    <link rel="stylesheet" type="text/css" href="../styles.css">
+  </head>
+  <body>This is a list, based on functionality, of the macros which have an
+    alternate <b>_<i>r</i></b> name, representing a reentry into the <b>BOOST_PP_FOR</b>
+    looping construct:
+    <p>repetition</p>
+    <ul>
+      <li><a href="deduce_r.html">BOOST_PP_DEDUCE_R</a></li>
+    </ul>
+    list<br>
+    <ul>
+      <li><a href="list_enum_r.html">BOOST_PP_LIST_ENUM_R</a></li>
+      <li><a href="list_for_each_i_r.html">BOOST_PP_LIST_FOR_EACH_I_R</a></li>
+      <li><a href="list_for_each_product_r.html">BOOST_PP_LIST_FOR_EACH_PRODUCT_R</a></li>
+      <li><a href="list_for_each_r.html">BOOST_PP_LIST_FOR_EACH_R</a></li>
+      <li><a href="list_to_seq_r.html">BOOST_PP_LIST_TO_SEQ_R</a></li>
+      <li><a href="list_to_tuple_r.html">BOOST_PP_LIST_TO_TUPLE_R</a></li>
+    </ul>
+    seq<br>
+    <ul>
+      <li><a href="seq_for_each_product_r.html">BOOST_PP_SEQ_FOR_EACH_PRODUCT_R</a></li>
+      <li><a href="seq_for_each_r.html">BOOST_PP_SEQ_FOR_EACH_R</a></li>
+    </ul>
+    base<br>
+    <ul>
+      <li><a href="for_r.html">BOOST_PP_FOR_R</a><br>
+      </li>
+    </ul>
+    <br>
+    <ul>
+    </ul>
+    <hr size="1">
+    <div style="margin-left: 0px;"> <i>© Copyright Edward Diener 2014</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>
--- a/doc/ref/identity_n.html
+++ b/doc/ref/identity_n.html
@@ -0,0 +1,58 @@
+<html>
+<head>
+	<title>BOOST_PP_IDENTITY_N</title>
+	<link rel="stylesheet" type="text/css" href="../styles.css">
+</head>
+<body>
+	<div style="margin-left:  0px;">
+	    The <b>BOOST_PP_IDENTITY_N</b> macro expands to its first argument when invoked.
+	</div>
+	<h4>Usage</h4>
+		<div class="code">
+			<b>BOOST_PP_IDENTITY_N</b>(<i>item,n</i>)(n-arguments)
+		</div>
+	<h4>Arguments</h4>
+		<dl>
+			<dt>item</dt>
+			<dd>
+				The result of the expansion.
+			</dd>
+			<dt>n</dt>
+			<dd>
+				The number of arguments when invoked.
+			</dd>
+		</dl>
+	<h4>Remarks</h4>
+		<div>
+			This macro is designed to be used with <b>BOOST_PP_IF</b> and <b>BOOST_PP_IIF</b> when only one of the clauses needs to be invoked.
+		</div>
+	<h4>See Also</h4>
+		<ul>
+			<li><a href="if.html">BOOST_PP_IF</a></li>
+			<li><a href="iif.html">BOOST_PP_IIF</a></li>
+		</ul>
+	<h4>Requirements</h4>
+		<div>
+			<b>Header:</b> &nbsp;<a href="../headers/facilities/identity.html">&lt;boost/preprocessor/facilities/identity.hpp&gt;</a>
+		</div>
+	<h4>Sample Code</h4>
+<div><pre>
+#include &lt;<a href="../headers/control/if.html">boost/preprocessor/control/if.hpp</a>&gt;
+#include &lt;<a href="../headers/facilities/identity.html">boost/preprocessor/facilities/identity.hpp</a>&gt;
+
+#define MACRO_CAT(y,z) y ## z
+#define MACRO(n) <a href="if.html">BOOST_PP_IF</a>(n, <a href="identity_n.html">BOOST_PP_IDENTITY_N</a>(x,2), MACRO_CAT)(a,b)
+
+MACRO(0) // expands to ab
+MACRO(1) // expands to x
+</pre></div>
+	<hr size="1">
+    <div style="margin-left: 0px"><i>&copy; Copyright Edward Diener 2015</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>
--- a/doc/ref/iif.html
+++ b/doc/ref/iif.html
@@ -44,7 +44,7 @@
 	<h4>Sample Code</h4>
 <div><pre>
 #include &lt;<a href="../headers/control/iif.html">boost/preprocessor/control/iif.hpp</a>&gt;
-#include &lt;<a href="../headers/logical/or.html">boost/preprocessor/logical/or.hpp</a>
+#include &lt;<a href="../headers/logical/or.html">boost/preprocessor/logical/or.hpp</a>&gt;

 #define OR_IF(p, q, t, f) <a href="iif.html">BOOST_PP_IIF</a>(<a href="or.html">BOOST_PP_OR</a>(p, q), t, f)

--- a/doc/ref/is_begin_parens.html
+++ b/doc/ref/is_begin_parens.html
@@ -0,0 +1,47 @@
+<html>
+  <head>
+    <meta content="text/html; charset=windows-1252" http-equiv="content-type">
+    <title>BOOST_PP_IS_BEGIN_PARENS</title>
+    <link rel="stylesheet" type="text/css" href="../styles.css">
+  </head>
+  <body>
+    <div style="margin-left:  0px;"> The <b>BOOST_PP_IS_BEGIN_PAREN</b>S
+      determines whether the input starts with a set of parenthesis.</div>
+    <h4>Usage</h4>
+    <div class="code"> <b>BOOST_PP_IS_BEGIN_PARENS</b>(...) <a href="../topics/variadic_macros.html#VNotation"
+        target="_self"><sup>(v)</sup></a></div>
+    <h4>Arguments</h4>
+    <h4>&nbsp;&nbsp;&nbsp; ...&nbsp;&nbsp;&nbsp; <span style="font-weight: normal;">&nbsp;&nbsp;&nbsp;
+        &nbsp;&nbsp;&nbsp; The input as variadic data.</span></h4>
+    <h4>Remarks</h4>
+    <div> If the input input begins with a parenthesis, with any data within
+      that parenthesis, the macro returns 1, otherwise it returns 0. Data may
+      follow the beginning parenthesis and the macro still will return 1.<br>
+      <br>
+      For Visual Studio 2005 ( VC8 ) the input data must be a single parameter
+      else a compilation error will occur.</div>
+    <h4>See Also</h4>
+    <ul>
+      <li><a href="remove_parens.html">BOOST_PP_REMOVE_PARENS</a></li>
+    </ul>
+    <h4>Requirements</h4>
+    <div> <b>Header:</b> &nbsp;<a href="../headers/punctuation/is_begin_parens.html">&lt;boost/preprocessor/punctuation/is_begin_parens.hpp&gt;</a>
+    </div>
+    <h4>Sample Code</h4>
+    <div>
+      <pre>#include &lt;<a href="../headers/punctuation/is_begin_parens.html">boost/preprocessor/punctuation/is_begin_parens.hpp</a>&gt;
+
+#define VARDATA more_data , more_params<br>#define VARDATAP ( data ) more_data , more_params<br>#define DATA data<br>#define DATAP ( data ) more_data<br>
+BOOST_PP_IS_BEGIN_PARENS(VARDATA)  // expands to 0, compiler error with VC8
+BOOST_PP_IS_BEGIN_PARENS(VARDATAP) // expands to 1, compiler error with VC8<br><br>BOOST_PP_IS_BEGIN_PARENS(DATA)     // expands to 0
+BOOST_PP_IS_BEGIN_PARENS(DATAP)    // expands to 1<br><br>BOOST_PP_IS_BEGIN_PARENS()         // expands to 0<br>
+</pre></div>
+    <hr size="1">
+    <div style="margin-left: 0px;"> <i>© Copyright Edward Diener 2014</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>
--- a/doc/ref/iteration_params_x.html
+++ b/doc/ref/iteration_params_x.html
@@ -42,7 +42,7 @@
 			</dd>
 			<dt>[flags]</dt>
 			<dd>
-				A quoted or angle-bracketed filename to used as the target of a <i>file-iteration</i>.
+				The flags associated with this <i>file-iteration</i> used to discriminate between different <i>file-iterations</i> in the same file.
 			</dd>
 		</dl>
 	<h4>Remarks</h4>
--- a/doc/ref/limit_iteration_dim.html
+++ b/doc/ref/limit_iteration_dim.html
@@ -13,7 +13,7 @@
 		</div>
 	<h4>Remarks</h4>
 		<div>
-			This macro currently expands to <i>5</i>.
+			This macro currently expands to <i>3</i>.
 		</div>
 	<h4>Requirements</h4>
 		<div>
--- a/doc/ref/limit_repeat.html
+++ b/doc/ref/limit_repeat.html
@@ -1,34 +1,39 @@
 <html>
-<head>
-	<title>BOOST_PP_LIMIT_REPEAT</title>
-	<link rel="stylesheet" type="text/css" href="../styles.css">	
-</head>
-<body>
-	<div style="margin-left:  0px;">
-		The <b>BOOST_PP_LIMIT_REPEAT</b> macro defines the maximum number of repetitions supported by each <b>BOOST_PP_REPEAT</b> dimension.
-	</div>
-	<h4>Usage</h4>
-		<div class="code">
-			<b>BOOST_PP_LIMIT_REPEAT</b>
-		</div>
-	<h4>Remarks</h4>
-		<div>
-			This macro current expands to <i>256</i>.
-		</div>
-	<h4>Requirements</h4>
-		<div>
-			<b>Header:</b> &nbsp;<a href="../headers/config/limits.html">&lt;boost/preprocessor/config/limits.hpp&gt;</a>
-		</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>
+  <head>
+    <meta content="text/html; charset=windows-1252" http-equiv="content-type">
+    <title>BOOST_PP_LIMIT_REPEAT</title>
+    <link rel="stylesheet" type="text/css" href="../styles.css">
+  </head>
+  <body>
+    <div style="margin-left:  0px;"> The <b>BOOST_PP_LIMIT_REPEAT</b> macro
+      defines the maximum number of repetitions supported by each <b>BOOST_PP_REPEAT</b>
+      dimension. </div>
+    <h4>Usage</h4>
+    <div class="code"> <b>BOOST_PP_LIMIT_REPEAT</b> </div>
+    <h4>Remarks</h4>
+    <div> This macro current expands to <i>256</i>.<br>
+      <br>
+      NOTE: for the current latest versions of Microsoft's VC++ compiler there
+      is a nested macro limit of 256. This means in actuality that the number of
+      repetitions using VC++ is actually less than 256 depending on the
+      repetition macro being used. For the BOOST_PP_REPEAT macro this limit
+      appears to be 252 while for the BOOST_PP_ENUM... series of macros this
+      limit appears to be around 230, before the VC++ compiler gives a "C1009:
+      compiler limit : macros nested too deeply" error. This is a compiler
+      limitation of VC++ which may vary depending on the specific repetition
+      macro being used, and therefore is not a problem the preprocessor library
+      can solve.</div>
+    <h4>Requirements</h4>
+    <div> <b>Header:</b> &nbsp;<a href="../headers/config/limits.html">&lt;boost/preprocessor/config/limits.hpp&gt;</a>
+    </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>
--- a/doc/ref/limit_tuple.html
+++ b/doc/ref/limit_tuple.html
@@ -1,10 +1,10 @@
 <html>
 <head>
-	<title>BOOST_PP_LIMIT_TUPLE</title>
-	<link rel="stylesheet" type="text/css" href="../styles.css">	
+    <title>BOOST_PP_LIMIT_TUPLE</title>
+	<link rel="stylesheet" type="text/css" href="../styles.css">
 </head>
 <body>
-	<div style="margin-left:  0px;">
+	<div style="margin-left: 0px;">
 		The <b>BOOST_PP_LIMIT_TUPLE</b> macro defines the maximum <i>tuple</i> size supported by the library.
 	</div>
 	<h4>Usage</h4>
@@ -13,7 +13,7 @@
 		</div>
 	<h4>Remarks</h4>
 		<div>
-			This macro currently expands to <i>25</i>.
+			This macro currently expands to <i>64</i>.
 		</div>
 	<h4>Requirements</h4>
 		<div>
@@ -22,13 +22,12 @@
 	<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>
+		<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>
+		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>
+</html>
--- a/doc/ref/limit_variadic.html
+++ b/doc/ref/limit_variadic.html
@@ -0,0 +1,24 @@
+<html>
+<head>
+  <title>BOOST_PP_LIMIT_VARIADIC</title>
+  <link rel="stylesheet" type="text/css" href="../styles.css">
+</head>
+<body>
+<div style="margin-left: 0px;"> The <b>BOOST_PP_LIMIT_VARIADIC</b> macro
+defines the maximum <i>variadic data</i> size&nbsp;supported by the library. </div>
+<h4>Usage</h4>
+<div class="code"> <b>BOOST_PP_LIMIT_VARIADIC</b> </div>
+<h4>Remarks</h4>
+<div> This macro currently expands to <i>64</i>. </div>
+<h4>Requirements</h4>
+<div> <b>Header:</b> &nbsp;<a href="../headers/config/limits.html">&lt;boost/preprocessor/config/limits.hpp&gt;</a>
+</div>
+<hr size="1">
+<div style="margin-left: 0px;"> <i></i><i>© Copyright Edward Diener 2011</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>
--- a/doc/ref/list_to_array.html
+++ b/doc/ref/list_to_array.html
@@ -0,0 +1,47 @@
+<html>
+  <head>
+    <meta content="text/html; charset=windows-1252" http-equiv="content-type">
+    <title>BOOST_PP_LIST_TO_ARRAY</title>
+    <link rel="stylesheet" type="text/css" href="../styles.css">
+  </head>
+  <body>
+    <div style="margin-left: 0px;"> The <b>BOOST_PP_LIST_TO_ARRAY</b> macro
+      converts a <i>list</i> to an <i>array</i>. </div>
+    <h4> Usage </h4>
+    <div class="code"> <b>BOOST_PP_LIST_TO_ARRAY</b>(<i>list</i>) </div>
+    <h4> Arguments </h4>
+    <dl>
+      <dt>list</dt>
+      <dd> The <i>list</i> to be converted. <br>
+      </dd>
+    </dl>
+    <h4>Remarks</h4>
+    <div> This macro uses <b>BOOST_PP_WHILE</b>. Within <b>BOOST_PP_WHILE</b>,
+      it is more efficient to use <b>BOOST_PP_LIST_TO_ARRAY_D</b>.<br>
+      <br>
+      If the <i>list</i> to be converted is empty, as represented by
+      'BOOST_PP_NIL', the resulting <i>array</i> is empty, as represented by '( 0, ()
+      )'.</div>
+    <h4>See Also</h4>
+    <ul>
+      <li><a href="list_to_array_d.html">BOOST_PP_LIST_TO_ARRAY_D</a></li>
+    </ul>
+    <h4> Requirements </h4>
+    <div> <b>Header:</b> &nbsp;<a href="../headers/list/to_array.html">&lt;boost/preprocessor/list/to_array.hpp&gt;</a>
+    </div>
+    <h4> Sample Code </h4>
+    <div>
+      <pre>#include &lt;<a href="../headers/list/to_array.html">boost/preprocessor/list/to_array.hpp</a>&gt;<br><br>#define LIST (a, (b, (c, <a
+
+href="nil.html">BOOST_PP_NIL</a>)))<br><br><a href="list_to_array.html">BOOST_PP_LIST_TO_ARRAY</a>(LIST) // expands to (3, (a, b, c))</pre>
+    </div>
+    <hr size="1">
+    <div style="margin-left: 0px;"> <i></i><i>© Copyright Edward Diener 2011</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>
--- a/doc/ref/list_to_array_d.html
+++ b/doc/ref/list_to_array_d.html
@@ -0,0 +1,34 @@
+<html>
+  <head>
+    <meta content="text/html; charset=windows-1252" http-equiv="content-type">
+    <title>BOOST_PP_LIST_TO_ARRAY_D</title>
+    <link rel="stylesheet" type="text/css" href="../styles.css">
+  </head>
+  <body>
+    <div style="margin-left: 0px;"> The <b>BOOST_PP_LIST_TO_ARRAY_D</b> macro
+      converts a <i>list</i> to an <i>array</i>. It reenters <b>BOOST_PP_WHILE</b>
+      with maximum efficiency. </div>
+    <h4> Usage </h4>
+    <div class="code"> <b>BOOST_PP_LIST_TO_ARRAY_D</b>(<i>d</i>, <i>list</i>)
+    </div>
+    <h4> Arguments </h4>
+    <dl>
+      <dt>d</dt>
+      <dd>The next available <b>BOOST_PP_WHILE</b> iteration.</dd>
+      <dt>list</dt>
+      <dd> The <i>list</i> to be converted. </dd>
+    </dl>
+    <h4>Remarks</h4>
+    <p>&nbsp;&nbsp;&nbsp; If the <i>list</i> to be converted is empty, as
+      represented by 'BOOST_PP_NIL', the resulting <i>array</i> is empty, as
+      represented by '( 0, () )'. </p>
+    <h4>See Also</h4>
+    <h4>See Also</h4>
+    <ul>
+      <li><a href="list_to_array_d.html">BOOST_PP_LIST_TO_ARRAY</a></li>
+    </ul>
+    <h4> Requirements </h4>
+    <div> <b>Header:</b> &nbsp;<a href="../headers/list/to_array.html">&lt;boost/preprocessor/list/to_array.hpp&gt;</a>
+    </div>
+  </body>
+</html>
--- a/doc/ref/list_to_seq.html
+++ b/doc/ref/list_to_seq.html
@@ -0,0 +1,44 @@
+<html>
+  <head>
+    <meta content="text/html; charset=windows-1252" http-equiv="content-type">
+    <title>BOOST_PP_LIST_TO_SEQ</title>
+    <link rel="stylesheet" type="text/css" href="../styles.css">
+  </head>
+  <body>
+    <div style="margin-left: 0px;"> The <b>BOOST_PP_LIST_TO_SEQ</b> macro
+      converts a <i>list</i> to a <i>seq</i>. </div>
+    <h4> Usage </h4>
+    <div class="code"> <b>BOOST_PP_LIST_TO_SEQ</b>(<i>list</i>) </div>
+    <h4> Arguments </h4>
+    <dl>
+      <dt>list</dt>
+      <dd> The <i>list</i> to be converted. </dd>
+    </dl>
+    <h4>Remarks</h4>
+    <div> This macro uses <b>BOOST_PP_FOR</b>. Within <b>BOOST_PP_FOR</b>, it
+      is more efficient to use <b>BOOST_PP_LIST_TO_SEQ_R</b>.<br>
+      <br>
+      If the <i>list</i> to be converted is empty, as represented by
+      'BOOST_PP_NIL', the resulting <i>seq</i> is undefined since a <i>seq</i>
+      cannot be empty.</div>
+    <h4>See Also</h4>
+    <ul>
+      <li><a href="list_to_seq_r.html">BOOST_PP_LIST_TO_SEQ_R</a></li>
+    </ul>
+    <h4> Requirements </h4>
+    <div> <b>Header:</b> &nbsp;<a href="../headers/list/to_seq.html">&lt;boost/preprocessor/list/to_seq.hpp&gt;</a>
+    </div>
+    <h4> Sample Code </h4>
+    <div>
+      <pre>#include &lt;<a href="../headers/list/to_seq.html">boost/preprocessor/list/to_seq.hpp</a>&gt;<br><br><a
+href="list_to_seq.html">BOOST_PP_LIST_TO_SEQ</a>((a, (b, (c, <a href="nil.html">BOOST_PP_NIL</a>)))) // expands to (a)(b)(c)</pre>
+    </div>
+    <hr size="1">
+    <div style="margin-left: 0px;"> <i>© Copyright Edward Diener 2011</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>
--- a/doc/ref/list_to_seq_r.html
+++ b/doc/ref/list_to_seq_r.html
@@ -0,0 +1,32 @@
+<html>
+  <head>
+    <meta content="text/html; charset=windows-1252" http-equiv="content-type">
+    <title>BOOST_PP_LIST_TO_SEQ_R</title>
+    <link rel="stylesheet" type="text/css" href="../styles.css">
+  </head>
+  <body>
+    <div style="margin-left: 0px;"> The <b>BOOST_PP_LIST_TO_SEQ_R</b> macro
+      converts a <i>list</i> to a <i>seq</i>. It reenters <b>BOOST_PP_FOR</b>
+      with maximum efficiency. </div>
+    <h4> Usage </h4>
+    <div class="code"> <b>BOOST_PP_LIST_TO_SEQ_R</b>(<i>r</i>, <i>list</i>) </div>
+    <h4> Arguments </h4>
+    <dl>
+      <dt>d</dt>
+      <dd>The next available <b>BOOST_PP_FOR</b> repetition.</dd>
+      <dt>list</dt>
+      <dd> The <i>list</i> to be converted.</dd>
+    </dl>
+    <h4>Remarks</h4>
+    <p>&nbsp;&nbsp;&nbsp; If the <i>list</i> to be converted is empty, as
+      represented by 'BOOST_PP_NIL', the resulting <i>seq</i> is undefined
+      since a <i>seq</i> cannot be empty.</p>
+    <h4>See Also</h4>
+    <ul>
+      <li><a href="list_to_seq_r.html">BOOST_PP_LIST_TO_SEQ</a></li>
+    </ul>
+    <h4> Requirements </h4>
+    <div> <b>Header:</b> &nbsp;<a href="../headers/list/to_seq.html">&lt;boost/preprocessor/list/to_seq.hpp&gt;</a>
+    </div>
+  </body>
+</html>
--- a/doc/ref/list_to_tuple.html
+++ b/doc/ref/list_to_tuple.html
@@ -1,62 +1,55 @@
 <html>
-<head>
-	<title>BOOST_PP_LIST_TO_TUPLE</title>
-	<link rel="stylesheet" type="text/css" href="../styles.css">
-</head>
-<body>
-	<div style="margin-left:  0px;">
-		The <b>BOOST_PP_LIST_TO_TUPLE</b> macro converts a <i>list</i> to a <i>tuple</i>.
-	</div>
-	<h4>Usage</h4>
-		<div class="code">
-			<b>BOOST_PP_LIST_TO_TUPLE</b>(<i>list</i>)
-		</div>
-	<h4>Arguments</h4>
-		<dl>
-			<dt>list</dt>
-			<dd>
-				The <i>list</i> to be converted.
-			</dd>
-		</dl>
-	<h4>Remarks</h4>
-		<div>
-			If <i>list</i> is, for example, (<i>a</i>, (<i>b</i>, (<i>c</i>, <b>BOOST_PP_NIL</b>))),
-			this macro will produce:
-			<div>
-				(<i>a</i>, <i>b</i>, <i>c</i>)
-			</div>
-		</div>
-		<div>
-			Previously, this macro could not be used inside <b>BOOST_PP_FOR</b>.&nbsp;
-			There is no longer any such restriction.&nbsp;
-			It is more efficient, however, to use <b>BOOST_PP_LIST_TO_TUPLE_R</b> in such a situation.
-		</div>
-	<h4>See Also</h4>
-		<ul>
-			<li><a href="list_to_tuple_r.html">BOOST_PP_LIST_TO_TUPLE_R</a></li>
-		</ul>
-	<h4>Requirements</h4>
-		<div>
-			<b>Header:</b> &nbsp;<a href="../headers/list/to_tuple.html">&lt;boost/preprocessor/list/to_tuple.hpp&gt;</a>
-		</div>
-	<h4>Sample Code</h4>
-<div><pre>
-#include &lt;<a href="../headers/list/to_tuple.html">boost/preprocessor/list/to_tuple.hpp</a>&gt;
+  <head>
+    <meta content="text/html; charset=windows-1252" http-equiv="content-type">
+    <title>BOOST_PP_LIST_TO_TUPLE</title>
+    <link rel="stylesheet" type="text/css" href="../styles.css">
+  </head>
+  <body>
+    <div style="margin-left:  0px;"> The <b>BOOST_PP_LIST_TO_TUPLE</b> macro
+      converts a <i>list</i> to a <i>tuple</i>. </div>
+    <h4>Usage</h4>
+    <div class="code"> <b>BOOST_PP_LIST_TO_TUPLE</b>(<i>list</i>) </div>
+    <h4>Arguments</h4>
+    <dl>
+      <dt>list</dt>
+      <dd> The <i>list</i> to be converted. </dd>
+    </dl>
+    <h4>Remarks</h4>
+    <div> If <i>list</i> is, for example, (<i>a</i>, (<i>b</i>, (<i>c</i>, <b>BOOST_PP_NIL</b>))),
+      this macro will produce:
+      <div> (<i>a</i>, <i>b</i>, <i>c</i>) </div>
+    </div>
+    <div> Previously, this macro could not be used inside <b>BOOST_PP_FOR</b>.&nbsp;
+      There is no longer any such restriction.&nbsp; It is more efficient,
+      however, to use <b>BOOST_PP_LIST_TO_TUPLE_R</b> in such a situation.<br>
+      <br>
+      If the <i>list</i> to be converted is empty, as represented by 'BOOST_PP_NIL',
+      the resulting <i>tuple</i> is undefined since a <i>tuple</i> cannot be
+      empty.</div>
+    <h4>See Also</h4>
+    <ul>
+      <li><a href="list_to_tuple_r.html">BOOST_PP_LIST_TO_TUPLE_R</a></li>
+    </ul>
+    <h4>Requirements</h4>
+    <div> <b>Header:</b> &nbsp;<a href="../headers/list/to_tuple.html">&lt;boost/preprocessor/list/to_tuple.hpp&gt;</a>
+    </div>
+    <h4>Sample Code</h4>
+    <div>
+      <pre>#include &lt;<a href="../headers/list/to_tuple.html">boost/preprocessor/list/to_tuple.hpp</a>&gt;

 #define LIST (w, (x, (y, (z, <a href="nil.html">BOOST_PP_NIL</a>))))

 <a href="list_to_tuple.html">BOOST_PP_LIST_TO_TUPLE</a>(LIST) // expands to (w, x, y, z)
 </pre></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>
+    <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>
--- a/doc/ref/list_to_tuple_r.html
+++ b/doc/ref/list_to_tuple_r.html
@@ -1,47 +1,42 @@
 <html>
-<head>
-	<title>BOOST_PP_LIST_TO_TUPLE_R</title>
-	<link rel="stylesheet" type="text/css" href="../styles.css">
-</head>
-<body>
-	<div style="margin-left:  0px;">
-		The <b>BOOST_PP_LIST_TO_TUPLE_R</b> macro converts a <i>list</i> to a <i>tuple</i>.&nbsp;
-		It reenters <b>BOOST_PP_FOR</b> with maximum efficiency.
-	</div>
-	<h4>Usage</h4>
-		<div class="code">
-			<b>BOOST_PP_LIST_TO_TUPLE_R</b>(<i>r</i>, <i>list</i>)
-		</div>
-	<h4>Arguments</h4>
-		<dl>
-			<dt>r</dt>
-			<dd>
-				The next available <b>BOOST_PP_FOR</b> repetition.
-			</dd>
-			<dt>list</dt>
-			<dd>
-				The <i>list</i> to be converted.
-			</dd>
-		</dl>
-	<h4>Remarks</h4>
-		<div>
-			If <i>list</i> is, for example, (<i>a</i>, (<i>b</i>, (<i>c</i>, <b>BOOST_PP_NIL</b>))),
-			this macro will produce:
-			<div>
-				(<i>a</i>, <i>b</i>, <i>c</i>)
-			</div>
-		</div>
-	<h4>See Also</h4>
-		<ul>
-			<li><a href="list_to_tuple.html">BOOST_PP_LIST_TO_TUPLE</a></li>
-		</ul>
-	<h4>Requirements</h4>
-		<div>
-			<b>Header:</b> &nbsp;<a href="../headers/list/to_tuple.html">&lt;boost/preprocessor/list/to_tuple.hpp&gt;</a>
-		</div>
-	<h4>Sample Code</h4>
-<div><pre>
-#include &lt;<a href="../headers/list/adt.html">boost/preprocessor/list/adt.hpp</a>&gt;
+  <head>
+    <meta content="text/html; charset=windows-1252" http-equiv="content-type">
+    <title>BOOST_PP_LIST_TO_TUPLE_R</title>
+    <link rel="stylesheet" type="text/css" href="../styles.css">
+  </head>
+  <body>
+    <div style="margin-left:  0px;"> The <b>BOOST_PP_LIST_TO_TUPLE_R</b> macro
+      converts a <i>list</i> to a <i>tuple</i>.&nbsp; It reenters <b>BOOST_PP_FOR</b>
+      with maximum efficiency. </div>
+    <h4>Usage</h4>
+    <div class="code"> <b>BOOST_PP_LIST_TO_TUPLE_R</b>(<i>r</i>, <i>list</i>)
+    </div>
+    <h4>Arguments</h4>
+    <dl>
+      <dt>r</dt>
+      <dd> The next available <b>BOOST_PP_FOR</b> repetition. </dd>
+      <dt>list</dt>
+      <dd> The <i>list</i> to be converted. </dd>
+    </dl>
+    <h4>Remarks</h4>
+    <p>&nbsp;&nbsp; If <i>list</i> is, for example, (<i>a</i>, (<i>b</i>, (<i>c</i>,
+      <b>BOOST_PP_NIL</b>))), this macro will produce: </p>
+    <div>
+      <div> (<i>a</i>, <i>b</i>, <i>c</i>)&nbsp;&nbsp; </div>
+    </div>
+    <h4><span style="font-weight: normal;">&nbsp;&nbsp; If the <i>list</i> to
+        be converted is empty, as represented by 'BOOST_PP_NIL', the resulting <i>tuple</i>
+        is undefined since a <i>tuple</i> cannot be empty. </span></h4>
+    <h4>See Also</h4>
+    <ul>
+      <li><a href="list_to_tuple.html">BOOST_PP_LIST_TO_TUPLE</a></li>
+    </ul>
+    <h4>Requirements</h4>
+    <div> <b>Header:</b> &nbsp;<a href="../headers/list/to_tuple.html">&lt;boost/preprocessor/list/to_tuple.hpp&gt;</a>
+    </div>
+    <h4>Sample Code</h4>
+    <div>
+      <pre>#include &lt;<a href="../headers/list/adt.html">boost/preprocessor/list/adt.hpp</a>&gt;
 #include &lt;<a href="../headers/list/to_tuple.html">boost/preprocessor/list/to_tuple.hpp</a>&gt;
 #include &lt;<a href="../headers/repetition/for.html">boost/preprocessor/repetition/for.hpp</a>&gt;

@@ -54,16 +49,14 @@
 <a href="for.html">BOOST_PP_FOR</a>(LIST, PRED, OP, MACRO)
   // expands to (x, y, z) (y, z) (z)
 </pre></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>
+    <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>
--- a/doc/ref/mul.html
+++ b/doc/ref/mul.html
@@ -34,7 +34,7 @@
 			It is more efficient, however, to use <b>BOOST_PP_MUL_D</b> in such a situation.
 		</div>
 		<div>
-			This macro is the most efficient when <i>x</i> is less than or equal to <i>y</i>.&nbsp;
+			This macro is the most efficient when <i>x</i> is greater than or equal to <i>y</i>.&nbsp;
 			However, the efficiency gain is not worth actually comparing the two arguments prior to invocation.&nbsp;
 			In other words, <i>x</i> should be the value that is <i>most likely</i> to be the largest of the two operands.
 		</div>
--- a/doc/ref/mul_d.html
+++ b/doc/ref/mul_d.html
@@ -34,7 +34,7 @@
 			If the product of <i>x</i> and <i>y</i> is greater than <b>BOOST_PP_LIMIT_MAG</b>, the result is saturated to <b>BOOST_PP_LIMIT_MAG</b>.
 		</div>
 		<div>
-			This macro is the most efficient when <i>x</i> is less than or equal to <i>y</i>.&nbsp;
+			This macro is the most efficient when <i>x</i> is greater than or equal to <i>y</i>.&nbsp;
 			However, the efficiency gain is not worth actually comparing the two arguments prior to invocation.&nbsp;
 			In other words, <i>x</i> should be the value that is <i>most likely</i> to be the largest of the two operands.
 		</div>
--- a/doc/ref/overload.html
+++ b/doc/ref/overload.html
@@ -0,0 +1,58 @@
+<html>
+  <head>
+    <meta  content="text/html; charset=windows-1252"  http-equiv="content-type">
+    <title>BOOST_PP_OVERLOAD</title>
+    <link  rel="stylesheet"  type="text/css"  href="../styles.css">
+  </head>
+  <body>
+    <div  style="margin-left: 0px;"> The <b>BOOST_PP_OVERLOAD</b> variadic
+      macro expands to the name of a non-variadic macro having a given number of
+      parameters.<br>
+    </div>
+    <h4>Usage</h4>
+    <div  class="code"> <b>BOOST_PP_OVERLOAD</b>(<i>prefix</i>,...) <a  href="../topics/variadic_macros.html#VNotation"
+         target="_self"><sup>(v)</sup></a><br>
+    </div>
+    <h4>Arguments</h4>
+    <dl>
+      <dt>prefix<br>
+      </dt>
+      <dd> The prefix of the non-variadic macro name. </dd>
+      <dt>...<br>
+      </dt>
+      <dd><i> Variadic data</i>. The number of variadic data
+        elements, as determined by BOOST_PP_VARIADIC_SIZE, is appended to the
+        prefix to form the output non-variadic macro name.<br>
+      </dd>
+    </dl>
+    <h4>Remarks</h4>
+    <div> This macro creates a macro name which depends on the number of
+      elements of variadic data. It should be used in the form of <br>
+      BOOST_PP_OVERLOAD(MACRO_NAME_,__VA_ARGS__)(__VA_ARGS__) in order to
+      call a non-variadic macro taking a given number of variadic data
+      elements as non-variadic arguments. In this way one can invoke a
+      variadic macro with a variable number of parameters which calls one of
+      a series of non-variadic macros doing very similar things.
+    </div>
+    <b>Requirements</b>
+    <div> <b>Header:</b> &nbsp;<a  href="../headers/facilities/overload.html">&lt;boost/preprocessor/facilities/overload.hpp&gt;</a>
+    </div>
+    <h4>Sample Code</h4>
+    <div>
+      <pre>#include &lt;<a  href="../headers/facilities/overload.html">boost/preprocessor/facilities/overload.hpp</a>&gt;<br>#include <<a
+ href="../headers/cat.html">boost/preprocessor/cat.hpp</a>><br>#include <<a  href="../headers/facilities/empty.html">boost/preprocessor/facilities/empty.hpp</a>><br>#include <<a
+ href="../headers/arithmetic/add.html">boost/preprocessor/arithmetic/add.hpp</a>><br><br>#define MACRO_1(number) MACRO_2(number,10)<br>#define MACRO_2(number1,number2) <a
+ href="add.html">BOOST_PP_ADD</a>(number1,number2)<br><br>#if !BOOST_PP_VARIADICS_MSVC<br><br>#define MACRO_ADD_NUMBERS(...) <a
+ href="overload.html">BOOST_PP_OVERLOAD</a>(MACRO_,__VA_ARGS__)(__VA_ARGS__)<br><br>#else<br><br>// or for Visual C++<br><br>#define MACRO_ADD_NUMBERS(...) \<br>  <a
+ href="cat.html">BOOST_PP_CAT</a>(<a  href="overload.html">BOOST_PP_OVERLOAD</a>(MACRO_,__VA_ARGS__)(__VA_ARGS__),<a
+ href="empty.html">BOOST_PP_EMPTY</a>())<br><br>#endif<br><br>MACRO_ADD_NUMBERS(5) // output is 15<br>MACRO_ADD_NUMBERS(3,6) // output is 9</pre>
+</div>
+<hr  size="1">
+<div  style="margin-left: 0px;"> <i></i><i>© Copyright Edward Diener 2011,2013,2016</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>
--- a/doc/ref/remove_parens.html
+++ b/doc/ref/remove_parens.html
@@ -0,0 +1,44 @@
+<html>
+  <head>
+    <meta content="text/html; charset=windows-1252" http-equiv="content-type">
+    <title>BOOST_PP_REMOVE_PARENS</title>
+    <link rel="stylesheet" type="text/css" href="../styles.css">
+  </head>
+  <body>
+    <div style="margin-left:  0px;"> The <b>BOOST_PP_REMOVE_PAREN</b>S macro
+      removes the beginning parenthesis, if it exists, from the input data and
+      expands to the result</div>
+    <h4>Usage</h4>
+    <div class="code"> <b>BOOST_PP_REMOVE_PARENS</b>(param) <a href="../topics/variadic_macros.html#VNotation"
+        target="_self"><sup>(v)</sup></a></div>
+    <h4>Arguments&nbsp;&nbsp;&nbsp;&nbsp;<span style="font-weight: normal;"></span></h4>
+    <h4><span style="font-weight: normal;">&nbsp;&nbsp;&nbsp; param</span>&nbsp;&nbsp;
+      <span style="font-weight: normal;">&nbsp;&nbsp;&nbsp; &nbsp;&nbsp;&nbsp;
+        The input data.</span></h4>
+    <h4>Remarks</h4>
+    <div> If the input begins with a parenthesis, with any data within that
+      parenthesis, the macro removes the parenthesis and expands to the result.
+      If the input does not begin with a parenthesis the macro expands to the
+      input.<br>
+    </div>
+    <h4>See Also</h4>
+    <ul>
+      <li><a href="is_begin_parens.html">BOOST_PP_IS_BEGIN_PARENS</a></li>
+    </ul>
+    <h4>Requirements</h4>
+    <div> <b>Header:</b> &nbsp;<a href="../headers/punctuation/remove_parens.html">&lt;boost/preprocessor/punctuation/remove_parens.hpp&gt;</a>
+    </div>
+    <h4>Sample Code</h4>
+    <div>
+      <pre>#include &lt;<a href="../headers/punctuation/remove_parens.html">boost/preprocessor/punctuation/remove_parens.hpp</a>&gt;<br><br>#define DATA data<br>#define DATAP ( data ) more_data<br><br>BOOST_PP_REMOVE_PARENS(DATA)     // expands to 'data'
+BOOST_PP_REMOVE_PARENS(DATAP)    // expands to 'data more_data'<br>
+</pre></div>
+    <hr size="1">
+    <div style="margin-left: 0px;"> <i>© Copyright Edward Diener 2014</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>
--- a/doc/ref/repeat_z.html
+++ b/doc/ref/repeat_z.html
@@ -1,67 +1,59 @@
 <html>
-<head>
-	<title>BOOST_PP_REPEAT_z</title>
-	<link rel="stylesheet" type="text/css" href="../styles.css">
-</head>
-<body>
-	<div style="margin-left:  0px;">
-		The <b>BOOST_PP_REPEAT_<i>z</i></b> macro represents a reentry into the <b>BOOST_PP_REPEAT</b> repetition construct.
-	</div>
-	<h4>Usage</h4>
-		<div class="code">
-			<b>BOOST_PP_REPEAT_</b> ## <i>z</i>(<i>count</i>, <i>macro</i>, <i>data</i>)
-		</div>
-	<h4>Arguments</h4>
-		<dl>
-			<dt>z</dt>
-			<dd>
-				The next available <b>BOOST_PP_REPEAT</b> dimension.
-			</dd>
-			<dt>count</dt>
-			<dd>
-				The number of repetitious calls to <i>macro</i>.&nbsp;
-				Valid values range from <i>0</i> to <b>BOOST_PP_LIMIT_REPEAT</b>.
-			</dd>
-			<dt>macro</dt>
-			<dd>
-				A ternary operation of the form <i>macro</i>(<i>z</i>, <i>n</i>, <i>data</i>).&nbsp;
-				This macro is expanded by <b>BOOST_PP_REPEAT</b> with the next available repetition depth,
-				the current repetition number, and the auxiliary <i>data</i> argument.&nbsp;
-			</dd>
-			<dt>data</dt>
-			<dd>
-				Auxiliary data passed to <i>macro</i>.
-			</dd>
-		</dl>
-	<h4>Remarks</h4>
-		<div>
-			This macro expands to the sequence:
-			<div>
-				<i>macro</i>(<i>z</i>, <i>0</i>, <i>data</i>) <i>macro</i>(<i>z</i>, <i>1</i>, <i>data</i>) ... <i>macro</i>(<i>z</i>, <i>count</i> - <i>1</i>, <i>data</i>)
-			</div>
-		</div>
-		<div>
-			At certain times, it may be necessary to perform the concatenation with <b>BOOST_PP_CAT</b> rather than the preprocessor token-pasting operator.&nbsp;
-			This happens when the <i>z</i> value is a macro invocation itself.&nbsp;
-			It needs a delay to allow it to expand.&nbsp;
-			The syntax in such a scenario becomes:
-			<div>
-				<b>BOOST_PP_CAT</b>(<b>BOOST_PP_REPEAT_</b>, <i>z</i>)(<i>count</i>, <i>macro</i>, <i>data</i>)
-			</div>
-		</div>
-	<h4>See Also</h4>
-		<ul>
-			<li><a href="cat.html">BOOST_PP_CAT</a></li>
-			<li><a href="limit_repeat.html">BOOST_PP_LIMIT_REPEAT</a></li>
-			<li><a href="repeat.html">BOOST_PP_REPEAT</a></li>
-		</ul>
-	<h4>Requirements</h4>
-		<div>
-			<b>Header:</b> &nbsp;<a href="../headers/repetition/repeat.html">&lt;boost/preprocessor/repetition/repeat.hpp&gt;</a>
-		</div>
-	<h4>Sample Code</h4>
-<div><pre>
-#include &lt;<a href="../headers/arithmetic/inc.html">boost/preprocessor/arithmetic/inc.hpp</a>&gt;
+  <head>
+    <meta content="text/html; charset=windows-1252" http-equiv="content-type">
+    <title>BOOST_PP_REPEAT_z</title>
+    <link rel="stylesheet" type="text/css" href="../styles.css">
+  </head>
+  <body>
+    <div style="margin-left:  0px;"> The <b>BOOST_PP_REPEAT_<i>z</i></b> macro
+      represents a reentry into the <b>BOOST_PP_REPEAT</b> repetition
+      construct. </div>
+    <h4>Usage</h4>
+    <div class="code"> <b>BOOST_PP_REPEAT_</b> ## <i>z</i>(<i>count</i>, <i>macro</i>,
+      <i>data</i>) </div>
+    <h4>Arguments</h4>
+    <dl>
+      <dt>z</dt>
+      <dd> The next available <b>BOOST_PP_REPEAT</b> dimension. </dd>
+      <dt>count</dt>
+      <dd> The number of repetitious calls to <i>macro</i>.&nbsp; Valid values
+        range from <i>0</i> to <b>BOOST_PP_LIMIT_REPEAT</b>. </dd>
+      <dt>macro</dt>
+      <dd> A ternary operation of the form <i>macro</i>(<i>z</i>, <i>n</i>, <i>data</i>).&nbsp;
+        This macro is expanded by <b>BOOST_PP_REPEAT</b> with the next
+        available repetition depth, the current repetition number, and the
+        auxiliary <i>data</i> argument.&nbsp; </dd>
+      <dt>data</dt>
+      <dd> Auxiliary data passed to <i>macro</i>. </dd>
+    </dl>
+    <h4>Remarks</h4>
+    <div> This macro expands to the sequence:
+      <div> <i>macro</i>(<i>z</i>, <i>0</i>, <i>data</i>) <i>macro</i>(<i>z</i>,
+        <i>1</i>, <i>data</i>) ... <i>macro</i>(<i>z</i>, <i>count</i> - <i>1</i>,
+        <i>data</i>) </div>
+    </div>
+    <div> At certain times, it may be necessary to perform the concatenation
+      with <b>BOOST_PP_CAT</b> rather than the preprocessor token-pasting
+      operator.&nbsp; This happens when the <i>z</i> value is a macro
+      invocation itself.&nbsp; It needs a delay to allow it to expand.&nbsp; The
+      syntax in such a scenario becomes:
+      <div> <b>BOOST_PP_CAT</b>(<b>BOOST_PP_REPEAT_</b>, <i>z</i>)(<i>count</i>,
+        <i>macro</i>, <i>data</i>) </div>
+    </div>
+    <h4>See Also</h4>
+    <ul>
+      <li><a href="cat.html">BOOST_PP_CAT</a></li>
+      <li><a href="limit_repeat.html">BOOST_PP_LIMIT_REPEAT</a></li>
+      <li><a href="repeat.html">BOOST_PP_REPEAT</a></li>
+      <li><a href="repeat_z_macros.html"><span style="color: gray;">Macros with
+            Z re-entrancy forms</span></a></li>
+    </ul>
+    <h4>Requirements</h4>
+    <div> <b>Header:</b> &nbsp;<a href="../headers/repetition/repeat.html">&lt;boost/preprocessor/repetition/repeat.hpp&gt;</a>
+    </div>
+    <h4>Sample Code</h4>
+    <div>
+      <pre>#include &lt;<a href="../headers/arithmetic/inc.html">boost/preprocessor/arithmetic/inc.hpp</a>&gt;
 #include &lt;<a href="../headers/punctuation/comma_if.html">boost/preprocessor/punctuation/comma_if.hpp</a>&gt;
 #include &lt;<a href="../headers/repetition/repeat.html">boost/preprocessor/repetition/repeat.hpp</a>&gt;

@@ -85,16 +77,16 @@
      template&lt;class, class, class&gt; class T2
   */
 </pre></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>
+    <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<br>
+      </i><i>© Copyright Edward Diener 2014</i><br>
+    </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>
--- a/doc/ref/repeat_z_macros.html
+++ b/doc/ref/repeat_z_macros.html
@@ -0,0 +1,45 @@
+<html>
+  <head>
+    <meta content="text/html; charset=windows-1252" http-equiv="content-type">
+    <title>BOOST_PP_REPEAT_z_macros</title>
+    <link rel="stylesheet" type="text/css" href="../styles.css">
+  </head>
+  <body>This is a list, based on functionality, of the macros which have an
+    alternate <b>_z<i></i></b> name, representing a reentry into the <b>BOOST_PP_REPEAT</b>
+    looping construct:<br>
+    <br>
+    array<br>
+    <ul>
+      <li><a href="array_pop_back_z.html">BOOST_PP_ARRAY_POP_BACK_Z</a></li>
+      <li><a href="array_pop_front_z.html">BOOST_PP_ARRAY_POP_FRONT_Z</a></li>
+    </ul>
+    repetition<br>
+    <ul>
+      <li><a href="deduce_z.html">BOOST_PP_DEDUCE_Z</a></li>
+      <li><a href="enum_binary_params_z.html">BOOST_PP_ENUM_BINARY_PARAMS_Z</a></li>
+      <li><a href="enum_params_z.html">BOOST_PP_ENUM_PARAMS_Z</a></li>
+      <li><a href="esbpz.html">BOOST_PP_ENUM_SHIFTED_BINARY_PARAMS_Z</a></li>
+      <li><a href="enum_shifted_params_z.html">BOOST_PP_ENUM_SHIFTED_PARAMS_Z</a></li>
+      <li><a href="enum_shifted_z.html">BOOST_PP_ENUM_SHIFTED_<i>z</i></a></li>
+      <li><a href="etbpz.html">BOOST_PP_ENUM_TRAILING_BINARY_PARAMS_Z</a></li>
+      <li><a href="enum_trailing_params_z.html">BOOST_PP_ENUM_TRAILING_PARAMS_Z</a></li>
+      <li><a href="enum_trailing_z.html">BOOST_PP_ENUM_TRAILING_<i>z</i></a></li>
+      <li><a href="enum_z.html">BOOST_PP_ENUM_<i>z</i></a></li>
+      <li><a href="repeat_from_to_d_z.html">BOOST_PP_REPEAT_FROM_TO_D_<i>z</i></a></li>
+      <li><a href="repeat_from_to_z.html">BOOST_PP_REPEAT_FROM_TO_<i>z</i></a></li>
+    </ul>
+    base<br>
+    <ul>
+      <li><a href="repeat_z.html">BOOST_PP_REPEAT_<i>z</i></a></li>
+    </ul>
+    <br>
+    <pre></pre>
+    <hr size="1">
+    <div style="margin-left: 0px;"> <i>© Copyright Edward Diener 2014</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>
--- a/doc/ref/seq_cat.html
+++ b/doc/ref/seq_cat.html
@@ -1,17 +1,17 @@
 <html>
-	<head>
-		<title>BOOST_PP_SEQ_CAT</title>
+<head>
+        <title>BOOST_PP_SEQ_CAT</title>
 		<link rel="stylesheet" type="text/css" href="../styles.css">
-	</head>
-	<body>
-		<div style="margin-left:  0px;">
+</head>
+<body>
+		<div style="margin-left: 0px;">
 			The <b>BOOST_PP_SEQ_CAT</b> macro concatenates all elements in a <i>seq</i>.
 		</div>
 		<h4>
 			Usage
 		</h4>
 		<div class="code">
-			<b>BOOST_PP_SEQ_CAT</b>(<i>list</i>)
+			<b>BOOST_PP_SEQ_CAT</b>(<i>seq</i>)
 		</div>
 		<h4>
 			Arguments
@@ -48,24 +48,17 @@
 			Sample Code
 		</h4>
 		<div>
-			<pre>
-#include &lt;<a href="../headers/seq/cat.html">boost/preprocessor/seq/cat.hpp</a>&gt;
-
-#define SEQ (a)(b)(c)
-
-<a href="seq_cat.html">BOOST_PP_SEQ_CAT</a>(SEQ) // expands to abc
-</pre>
+			<pre>#include &lt;<a href="../headers/seq/cat.html">boost/preprocessor/seq/cat.hpp</a>&gt;<br><br>#define SEQ (a)(b)(c)<br><br><a href="seq_cat.html">BOOST_PP_SEQ_CAT</a>(SEQ) // expands to abc<br></pre>
 		</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>
+		<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>
+		copy at <a href="http://www.boost.org/LICENSE_1_0.txt">www.boost.org/LICENSE_1_0.txt</a>)</small></p>
 	</div>
-	</body>
+</body>
 </html>
--- a/doc/ref/seq_cat_s.html
+++ b/doc/ref/seq_cat_s.html
@@ -1,10 +1,10 @@
 <html>
-	<head>
-		<title>BOOST_PP_SEQ_CAT_S</title>
+<head>
+        <title>BOOST_PP_SEQ_CAT_S</title>
 		<link rel="stylesheet" type="text/css" href="../styles.css">
-	</head>
-	<body>
-		<div style="margin-left:  0px;">
+</head>
+<body>
+		<div style="margin-left: 0px;">
 			The <b>BOOST_PP_SEQ_CAT_S</b> macro concatenates all elements in a <i>seq</i>.&nbsp; 
 			It reenters <b>BOOST_PP_SEQ_FOLD_LEFT</b> with maximum efficiency.
 		</div>
@@ -12,7 +12,7 @@
 			Usage
 		</h4>
 		<div class="code">
-			<b>BOOST_PP_SEQ_CAT_S</b>(<i>s</i>, <i>list</i>)
+			<b>BOOST_PP_SEQ_CAT_S</b>(<i>s</i>, <i>seq</i>)
 		</div>
 		<h4>
 			Arguments
@@ -49,13 +49,12 @@
 	<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>
+		<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>
+		copy at <a href="http://www.boost.org/LICENSE_1_0.txt">www.boost.org/LICENSE_1_0.txt</a>)</small></p>
 	</div>
-	</body>
+</body>
 </html>
--- a/doc/ref/seq_elem.html
+++ b/doc/ref/seq_elem.html
@@ -1,17 +1,17 @@
 <html>
-	<head>
-		<title>BOOST_PP_SEQ_ELEM</title>
+<head>
+        <title>BOOST_PP_SEQ_ELEM</title>
 		<link rel="stylesheet" type="text/css" href="../styles.css">
-	</head>
-	<body>
-		<div style="margin-left:  0px;">
+</head>
+<body>
+		<div style="margin-left: 0px;">
 			The <b>BOOST_PP_SEQ_ELEM</b> macro extracts an element from a <i>seq</i>.
 		</div>
 		<h4>
 			Usage
 		</h4>
 		<div class="code">
-			<b>BOOST_PP_SEQ_ELEM</b>(<i>i</i>, <i>list</i>)
+			<b>BOOST_PP_SEQ_ELEM</b>(<i>i</i>, <i>seq</i>)
 		</div>
 		<h4>
 			Arguments
@@ -43,37 +43,17 @@
 			Sample Code
 		</h4>
 		<div>
-			<pre>
-#include &lt;<a href="../headers/seq/elem.html">boost/preprocessor/seq/elem.hpp</a>&gt;
-
-<a href="seq_elem.html">BOOST_PP_SEQ_ELEM</a>(1, (a)(b)(c)) // expands to b
-
-#define SEQ \
-   (0)(1)(2)(3)(4)(5)(6)(7)(8)(9) \
-   (10)(11)(12)(13)(14)(15)(16)(17)(18)(19) \
-   (20)(21)(22)(23)(24)(25)(26)(27)(28)(29) \
-   (30)(31)(32)(33)(34)(35)(36)(37)(38)(39) \
-   (40)(41)(42)(43)(44)(45)(46)(47)(48)(49) \
-   (50)(51)(52)(53)(54)(55)(56)(57)(58)(59) \
-   (60)(61)(62)(63)(64)(65)(66)(67)(68)(69) \
-   (70)(71)(72)(73)(74)(75)(76)(77)(78)(79) \
-   (80)(81)(82)(83)(84)(85)(86)(87)(88)(89) \
-   (90)(91)(92)(93)(94)(95)(96)(97)(98)(99) \
-   /**/
-
-<a href="seq_elem.html">BOOST_PP_SEQ_ELEM</a>(88, SEQ) // expands to 88
-</pre>
+			<pre>#include &lt;<a href="../headers/seq/elem.html">boost/preprocessor/seq/elem.hpp</a>&gt;<br><br><a href="seq_elem.html">BOOST_PP_SEQ_ELEM</a>(1, (a)(b)(c)) // expands to b<br><br>#define SEQ \<br>   (0)(1)(2)(3)(4)(5)(6)(7)(8)(9) \<br>   (10)(11)(12)(13)(14)(15)(16)(17)(18)(19) \<br>   (20)(21)(22)(23)(24)(25)(26)(27)(28)(29) \<br>   (30)(31)(32)(33)(34)(35)(36)(37)(38)(39) \<br>   (40)(41)(42)(43)(44)(45)(46)(47)(48)(49) \<br>   (50)(51)(52)(53)(54)(55)(56)(57)(58)(59) \<br>   (60)(61)(62)(63)(64)(65)(66)(67)(68)(69) \<br>   (70)(71)(72)(73)(74)(75)(76)(77)(78)(79) \<br>   (80)(81)(82)(83)(84)(85)(86)(87)(88)(89) \<br>   (90)(91)(92)(93)(94)(95)(96)(97)(98)(99) \<br>   /**/<br><br><a href="seq_elem.html">BOOST_PP_SEQ_ELEM</a>(88, SEQ) // expands to 88<br></pre>
 		</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>
+		<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>
+		copy at <a href="http://www.boost.org/LICENSE_1_0.txt">www.boost.org/LICENSE_1_0.txt</a>)</small></p>
 	</div>
-	</body>
+</body>
 </html>
--- a/doc/ref/seq_first_n.html
+++ b/doc/ref/seq_first_n.html
@@ -1,10 +1,10 @@
 <html>
-	<head>
-		<title>BOOST_PP_SEQ_FIRST_N</title>
+<head>
+        <title>BOOST_PP_SEQ_FIRST_N</title>
 		<link rel="stylesheet" type="text/css" href="../styles.css">
-	</head>
-	<body>
-		<div style="margin-left:  0px;">
+</head>
+<body>
+		<div style="margin-left: 0px;">
 			The <b>BOOST_PP_SEQ_FIRST_N</b> macro expands to a <i>seq</i> of the first <i>n</i>
 			elements of a <i>seq</i>.
 		</div>
@@ -12,7 +12,7 @@
 			Usage
 		</h4>
 		<div class="code">
-			<b>BOOST_PP_SEQ_FIRST_N</b>(<i>n</i>, <i>list</i>)
+			<b>BOOST_PP_SEQ_FIRST_N</b>(<i>n</i>, <i>seq</i>)
 		</div>
 		<h4>
 			Arguments
@@ -22,7 +22,7 @@
 			<dd>
 				The number of elements to extract.
 			</dd>
-			<dt>list</dt>
+			<dt>seq</dt>
 			<dd>
 				The <i>seq</i> from which the elements are extracted.
 			</dd>
@@ -51,24 +51,17 @@
 			Sample Code
 		</h4>
 		<div>
-			<pre>
-#include &lt;<a href="../headers/seq/first_n.html">boost/preprocessor/seq/first_n.hpp</a>&gt;
-
-#define SEQ (a)(b)(c)(d)(e)
-
-<a href="seq_first_n.html">BOOST_PP_SEQ_FIRST_N</a>(2, SEQ) // expands to (a)(b)
-</pre>
+			<pre>#include &lt;<a href="../headers/seq/first_n.html">boost/preprocessor/seq/first_n.hpp</a>&gt;<br><br>#define SEQ (a)(b)(c)(d)(e)<br><br><a href="seq_first_n.html">BOOST_PP_SEQ_FIRST_N</a>(2, SEQ) // expands to (a)(b)<br></pre>
 		</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>
+		<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>
+		copy at <a href="http://www.boost.org/LICENSE_1_0.txt">www.boost.org/LICENSE_1_0.txt</a>)</small></p>
 	</div>
-	</body>
+</body>
 </html>
--- a/doc/ref/seq_nil.html
+++ b/doc/ref/seq_nil.html
@@ -1,12 +1,12 @@
 <html>
-	<head>
-		<title>BOOST_PP_SEQ_NIL</title>
+<head>
+        <title>BOOST_PP_SEQ_NIL</title>
 		<link rel="stylesheet" type="text/css" href="../styles.css">
-	</head>
-	<body>
-		<div style="margin-left:  0px;">
+</head>
+<body>
+		<div style="margin-left: 0px;">
 			The <b>BOOST_PP_SEQ_NIL</b> macro is a placeholder macro for an empty <i>seq</i>.&nbsp; 
-			It is only valid if it is elements are appended to the end of this empty 
+			It is only valid if it's elements are appended to the end of this empty 
 			"seq."&nbsp;
 		</div>
 		<h4>
@@ -63,38 +63,19 @@
 			Sample Code
 		</h4>
 		<div>
-			<pre>
-#include &lt;<a href="../headers/facilities/empty.html">boost/preprocessor/facilities/empty.hpp</a>&gt;
-#include &lt;<a href="../headers/seq/push_back.html">boost/preprocessor/seq/push_back.hpp</a>&gt;
-#include &lt;<a href="../headers/seq/push_front.html">boost/preprocessor/seq/push_front.hpp</a>&gt;
-#include &lt;<a href="../headers/seq/seq.html">boost/preprocessor/seq/seq.hpp</a>&gt;
-
-#define SEQ_L <a href="seq_nil.html">BOOST_PP_SEQ_NIL</a>
+			<pre>#include &lt;<a href="../headers/facilities/empty.html">boost/preprocessor/facilities/empty.hpp</a>&gt;<br>#include &lt;<a href="../headers/seq/push_back.html">boost/preprocessor/seq/push_back.hpp</a>&gt;<br>#include &lt;<a href="../headers/seq/push_front.html">boost/preprocessor/seq/push_front.hpp</a>&gt;<br>#include &lt;<a href="../headers/seq/seq.html">boost/preprocessor/seq/seq.hpp</a>&gt;<br><br>#define SEQ_L <a href="seq_nil.html">BOOST_PP_SEQ_NIL</a>
 #define SEQ_R <a href="empty.html">BOOST_PP_EMPTY</a>
-
-<a href="seq_push_back.html">BOOST_PP_SEQ_PUSH_BACK</a>(
-   <a href="seq_push_back.html">BOOST_PP_SEQ_PUSH_BACK</a>(SEQ_L, a), b
-)
-
-// expands to (a)(b)
-
-<a href="seq_push_front.html">BOOST_PP_SEQ_PUSH_FRONT</a>(
-   <a href="seq_push_front.html">BOOST_PP_SEQ_PUSH_FRONT</a>(SEQ_R, a), b
-)()
-
-// expands to (b)(a)
-</pre>
+<a href="seq_push_back.html">BOOST_PP_SEQ_PUSH_BACK</a>(<br>   <a href="seq_push_back.html">BOOST_PP_SEQ_PUSH_BACK</a>(SEQ_L, a), b<br>)<br><br>// expands to (a)(b)<br><br><a href="seq_push_front.html">BOOST_PP_SEQ_PUSH_FRONT</a>(<br>   <a href="seq_push_front.html">BOOST_PP_SEQ_PUSH_FRONT</a>(SEQ_R, a), b<br>)()<br><br>// expands to (b)(a)<br></pre>
 		</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>
+		<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>
+		copy at <a href="http://www.boost.org/LICENSE_1_0.txt">www.boost.org/LICENSE_1_0.txt</a>)</small></p>
 	</div>
-	</body>
+</body>
 </html>
--- a/doc/ref/seq_replace.html
+++ b/doc/ref/seq_replace.html
@@ -11,7 +11,7 @@
 			Usage
 		</h4>
 		<div class="code">
-			<b>BOOST_PP_SEQ_RPLACE</b>(<i>seq</i>, <i>i</i>, <i>elem</i>)
+			<b>BOOST_PP_SEQ_REPLACE</b>(<i>seq</i>, <i>i</i>, <i>elem</i>)
 		</div>
 		<h4>
 			Arguments
--- a/doc/ref/seq_rest_n.html
+++ b/doc/ref/seq_rest_n.html
@@ -1,120 +1,55 @@
 <html>
-	<head>
-		<title>BOOST_PP_SEQ_REST_N</title>
-		<link rel="stylesheet" type="text/css" href="../styles.css">
-	</head>
-	<body>
-		<div style="margin-left:  0px;">
-			The <b>BOOST_PP_SEQ_REST_N</b> macro expands to a <i>seq</i> of all but the 
-			first <i>n</i> elements of a <i>seq</i>.
-		</div>
-		<h4>
-			Usage
-		</h4>
-		<div class="code">
-			<b>BOOST_PP_SEQ_REST_N</b>(<i>n</i>, <i>list</i>)
-		</div>
-		<h4>
-			Arguments
-		</h4>
-		<dl>
-			<dt>n</dt>
-			<dd>
-				The number of elements to remove.
-			</dd>
-			<dt>list</dt>
-			<dd>
-				The <i>seq</i> from which the elements are to be removed.
-			</dd>
-		</dl>
-		<h4>
-			Remarks
-		</h4>
-		<div>
-			This macro extracts <i>n</i> elements from the beginning of <i>seq</i> and 
-			returns the remainder of <i>seq</i> as a new <i>seq</i>
-		</div>
-		<h4>
-			See Also
-		</h4>
-		<ul>
-			<li>
-				<a href="seq_first_n.html">BOOST_PP_SEQ_FIRST_N</a></li>
-		</ul>
-		<h4>
-			Requirements
-		</h4>
-		<div>
-			<b>Header:</b> &nbsp;<a href="../headers/seq/rest_n.html">&lt;boost/preprocessor/seq/rest_n.hpp&gt;</a>
-		</div>
-		<h4>
-			Sample Code
-		</h4>
-		<div>
-			<pre>
-#include &lt;<a href="../headers/arithmetic/inc.html">boost/preprocessor/arithmetic/inc.hpp</a>&gt;
-#include &lt;<a href="../headers/seq/elem.html">boost/preprocessor/seq/elem.hpp</a>&gt;
-#include &lt;<a href="../headers/seq/first_n.html">boost/preprocessor/seq/first_n.hpp</a>&gt;
-#include &lt;<a href="../headers/seq/rest_n.html">boost/preprocessor/seq/rest_n.hpp</a>&gt;
-#include &lt;<a href="../headers/seq/size.html">boost/preprocessor/seq/size.hpp</a>&gt;
-
-#define NUMBERS \
-   (0)(1)(2)(3)(4)(5)(6)(7)(8)(9) \
-   (10)(11)(12)(13)(14)(15)(16)(17)(18)(19) \
-   (20)(21)(22)(23)(24)(25)(26)(27)(28)(29) \
-   (30)(31)(32)(33)(34)(35)(36)(37)(38)(39) \
-   (40)(41)(42)(43)(44)(45)(46)(47)(48)(49) \
-   (50)(51)(52)(53)(54)(55)(56)(57)(58)(59) \
-   (60)(61)(62)(63)(64)(65)(66)(67)(68)(69) \
-   (70)(71)(72)(73)(74)(75)(76)(77)(78)(79) \
-   (80)(81)(82)(83)(84)(85)(86)(87)(88)(89) \
-   (90)(91)(92)(93)(94)(95)(96)(97)(98)(99) \
-   (100)(101)(102)(103)(104)(105)(106)(107)(108)(109) \
-   (110)(111)(112)(113)(114)(115)(116)(117)(118)(119) \
-   (120)(121)(122)(123)(124)(125)(126)(127)(128)(129) \
-   (130)(131)(132)(133)(134)(135)(136)(137)(138)(139) \
-   (140)(141)(142)(143)(144)(145)(146)(147)(148)(149) \
-   (150)(151)(152)(153)(154)(155)(156)(157)(158)(159) \
-   (160)(161)(162)(163)(164)(165)(166)(167)(168)(169) \
-   (170)(171)(172)(173)(174)(175)(176)(177)(178)(179) \
-   (180)(181)(182)(183)(184)(185)(186)(187)(188)(189) \
-   (190)(191)(192)(193)(194)(195)(196)(197)(198)(199) \
-   (200)(201)(202)(203)(204)(205)(206)(207)(208)(209) \
-   (210)(211)(212)(213)(214)(215)(216)(217)(218)(219) \
-   (220)(221)(222)(223)(224)(225)(226)(227)(228)(229) \
-   (230)(231)(232)(233)(234)(235)(236)(237)(238)(239) \
-   (240)(241)(242)(243)(244)(245)(246)(247)(248)(249) \
-   (250)(251)(252)(253)(254)(255)(256) \
-   /**/
-
-#define SUPER_ADD(x, y) <a href="seq_elem.html">BOOST_PP_SEQ_ELEM</a>(y, <a href="seq_rest_n.html">BOOST_PP_SEQ_REST_N</a>(x, NUMBERS))
-
-SUPER_ADD(100, 100) // expands to 200
-
-#define SUPER_SUB(x, y) \
-   <a href="seq_size.html">BOOST_PP_SEQ_SIZE</a>( \
-      <a href="seq_rest_n.html">BOOST_PP_SEQ_REST_N</a>( \
-         <a href="inc.html">BOOST_PP_INC</a>(y), \
-         <a href="seq_first_n.html">BOOST_PP_SEQ_FIRST_N</a>( \
-            <a href="inc.html">BOOST_PP_INC</a>(x), NUMBERS \
-         ) \
-      ) \
-   ) \
-   /**/
-
-SUPER_SUB(67, 25) // expands to 42
-</pre>
-		</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>
+  <head>
+    <meta content="text/html; charset=windows-1252" http-equiv="content-type">
+    <title>BOOST_PP_SEQ_REST_N</title>
+    <link rel="stylesheet" type="text/css" href="../styles.css">
+  </head>
+  <body>
+    <div style="margin-left: 0px;"> The <b>BOOST_PP_SEQ_REST_N</b> macro
+      expands to a <i>seq</i> of all but the first <i>n</i> elements of a <i>seq</i>.
+    </div>
+    <h4> Usage </h4>
+    <div class="code"> <b>BOOST_PP_SEQ_REST_N</b>(<i>n</i>, <i>seq</i>) </div>
+    <h4> Arguments </h4>
+    <dl>
+      <dt>n</dt>
+      <dd> The number of elements to remove. </dd>
+      <dt>seq</dt>
+      <dd> The <i>seq</i> from which the elements are to be removed. </dd>
+    </dl>
+    <h4> Remarks </h4>
+    <div> This macro extracts <i>n</i> elements from the beginning of <i>seq</i>
+      and returns the remainder of <i>seq</i> as a new <i>seq.<br>
+        <br>
+      </i>It is undefined behavior if <i>n </i>is greater or equal to the size
+      of the <i>seq</i>. </div>
+    <h4> See Also </h4>
+    <ul>
+      <li> <a href="seq_first_n.html">BOOST_PP_SEQ_FIRST_N</a></li>
+    </ul>
+    <h4> Requirements </h4>
+    <div> <b>Header:</b> &nbsp;<a href="../headers/seq/rest_n.html">&lt;boost/preprocessor/seq/rest_n.hpp&gt;</a>
+    </div>
+    <h4> Sample Code </h4>
+    <div>
+      <pre>#include &lt;<a href="../headers/arithmetic/inc.html">boost/preprocessor/arithmetic/inc.hpp</a>&gt;<br>#include &lt;<a
+href="../headers/seq/elem.html">boost/preprocessor/seq/elem.hpp</a>&gt;<br>#include &lt;<a
+href="../headers/seq/first_n.html">boost/preprocessor/seq/first_n.hpp</a>&gt;<br>#include &lt;<a
+href="../headers/seq/rest_n.html">boost/preprocessor/seq/rest_n.hpp</a>&gt;<br>#include &lt;<a
+href="../headers/seq/size.html">boost/preprocessor/seq/size.hpp</a>&gt;<br><br>#define NUMBERS \<br>   (0)(1)(2)(3)(4)(5)(6)(7)(8)(9) \<br>   (10)(11)(12)(13)(14)(15)(16)(17)(18)(19) \<br>   (20)(21)(22)(23)(24)(25)(26)(27)(28)(29) \<br>   (30)(31)(32)(33)(34)(35)(36)(37)(38)(39) \<br>   (40)(41)(42)(43)(44)(45)(46)(47)(48)(49) \<br>   (50)(51)(52)(53)(54)(55)(56)(57)(58)(59) \<br>   (60)(61)(62)(63)(64)(65)(66)(67)(68)(69) \<br>   (70)(71)(72)(73)(74)(75)(76)(77)(78)(79) \<br>   (80)(81)(82)(83)(84)(85)(86)(87)(88)(89) \<br>   (90)(91)(92)(93)(94)(95)(96)(97)(98)(99) \<br>   (100)(101)(102)(103)(104)(105)(106)(107)(108)(109) \<br>   (110)(111)(112)(113)(114)(115)(116)(117)(118)(119) \<br>   (120)(121)(122)(123)(124)(125)(126)(127)(128)(129) \<br>   (130)(131)(132)(133)(134)(135)(136)(137)(138)(139) \<br>   (140)(141)(142)(143)(144)(145)(146)(147)(148)(149) \<br>   (150)(151)(152)(153)(154)(155)(156)(157)(158)(159) \<br>   (160)(161)(162)(163)(164)(165)(166)(167)(168)(169) \<br>   (170)(171)(172)(173)(174)(175)(176)(177)(178)(179) \<br>   (180)(181)(182)(183)(184)(185)(186)(187)(188)(189) \<br>   (190)(191)(192)(193)(194)(195)(196)(197)(198)(199) \<br>   (200)(201)(202)(203)(204)(205)(206)(207)(208)(209) \<br>   (210)(211)(212)(213)(214)(215)(216)(217)(218)(219) \<br>   (220)(221)(222)(223)(224)(225)(226)(227)(228)(229) \<br>   (230)(231)(232)(233)(234)(235)(236)(237)(238)(239) \<br>   (240)(241)(242)(243)(244)(245)(246)(247)(248)(249) \<br>   (250)(251)(252)(253)(254)(255)(256) \<br>   /**/<br><br>#define SUPER_ADD(x, y) <a
+href="seq_elem.html">BOOST_PP_SEQ_ELEM</a>(y, <a href="seq_rest_n.html">BOOST_PP_SEQ_REST_N</a>(x, NUMBERS))<br><br>SUPER_ADD(100, 100) // expands to 200<br><br>#define SUPER_SUB(x, y) \<br>   <a
+href="seq_size.html">BOOST_PP_SEQ_SIZE</a>( \<br>      <a href="seq_rest_n.html">BOOST_PP_SEQ_REST_N</a>( \<br>         <a
+href="inc.html">BOOST_PP_INC</a>(y), \<br>         <a href="seq_first_n.html">BOOST_PP_SEQ_FIRST_N</a>( \<br>            <a
+href="inc.html">BOOST_PP_INC</a>(x), NUMBERS \<br>         ) \<br>      ) \<br>   ) \<br>   /**/<br><br>SUPER_SUB(67, 25) // expands to 42</pre>
+    </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>
--- a/doc/ref/seq_tail.html
+++ b/doc/ref/seq_tail.html
@@ -5,7 +5,7 @@
 	</head>
 	<body>
 		<div style="margin-left:  0px;">
-			The <b>BOOST_PP_SEQ_HEAD</b> macro expands to all but the first element of a <i>seq</i>.
+			The <b>BOOST_PP_SEQ_TAIL</b> macro expands to all but the first element of a <i>seq</i>.
 		</div>
 		<h4>
 			Usage
--- a/doc/ref/seq_to_list.html
+++ b/doc/ref/seq_to_list.html
@@ -0,0 +1,34 @@
+<html>
+<head>
+  <title>BOOST_PP_SEQ_TO_LIST</title>
+  <link rel="stylesheet" type="text/css" href="../styles.css">
+</head>
+<body>
+<div style="margin-left: 0px;"> The <b>BOOST_PP_SEQ_TO_LIST</b>
+macro converts a <i>seq</i> to a <i>list</i>. </div>
+<h4>Usage</h4>
+<div class="code"> <b>BOOST_PP_SEQ_TO_LIST</b>(<i>seq</i>)
+</div>
+<h4>Arguments</h4>
+<dl><dt>seq</dt>
+  <dd> The <i>seq</i> to be converted. </dd>
+</dl><b>See Also</b>
+<ul>
+  <li><a href="limit_seq.html">BOOST_PP_LIMIT_SEQ</a></li>
+</ul>
+<h4>Requirements</h4>
+<div> <b>Header:</b> &nbsp;<a href="../headers/seq/to_list.html">&lt;boost/preprocessor/seq/to_list.hpp&gt;</a>
+</div>
+<h4>Sample Code</h4>
+<div>
+<pre>#include &lt;<a href="../headers/seq/to_list.html">boost/preprocessor/seq/to_list.hpp</a>&gt;<br><br><a href="seq_to_list.html">BOOST_PP_SEQ_TO_LIST</a>((x)(y)(z))<br>   // expands to (x, (y, (z, <a href="nil.html">BOOST_PP_NIL</a>)))<br></pre>
+</div>
+<hr size="1">
+<div style="margin-left: 0px;"> <i>© Copyright Edward Diener 2011</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>
--- a/doc/ref/tuple_eat.html
+++ b/doc/ref/tuple_eat.html
@@ -1,28 +1,38 @@
 <html>
-<head>
-	<title>BOOST_PP_TUPLE_EAT</title>
+  <head>
+    <title>BOOST_PP_TUPLE_EAT</title>
 	<link rel="stylesheet" type="text/css" href="../styles.css">
-</head>
-<body>
-	<div style="margin-left:  0px;">
-		The <b>BOOST_PP_TUPLE_EAT</b> macro expands to a macro that eats a <i>tuple</i> of the specified size.
+  </head>
+  <body>
+	<div style="margin-left: 0px;">
+		The <b>BOOST_PP_TUPLE_EAT</b> macro expands to a macro that eats a <i>tuple</i>.
 	</div>
 	<h4>Usage</h4>
 		<div class="code">
-			<b>BOOST_PP_TUPLE_EAT</b>(<i>size</i>)
-		</div>
+			<b>BOOST_PP_TUPLE_EAT</b>(<i>size</i>)<br>
+<br>
+or<br>
+<br>
+<b>BOOST_PP_TUPLE_EAT</b>(<i>size</i>) <a href="../topics/variadic_macros.html#VNotation" target="_self"><sup>(v)</sup></a><b></b><br>
+</div>
 	<h4>Arguments</h4>
 		<dl>
 			<dt>size</dt>
 			<dd>
 				The size of the <i>tuple</i> to be eaten.&nbsp;
-				Valid <i>tuple</i> sizes range from <i>0</i> to <b>BOOST_PP_LIMIT_TUPLE</b>.&nbsp;
+				Valid <i>tuple</i> sizes range from <i>1</i> to <b>BOOST_PP_LIMIT_TUPLE</b>.
 			</dd>
 		</dl>
 	<h4>Remarks</h4>
 		<div>
-			The <i>size</i> argument must be the actual size of the <i>tuple</i>.
-		</div>
+			The <i>size</i> argument must be the actual size of the <i>tuple</i> in the non-variadic version. <br>
+<br>For the variadic version <a href="../topics/variadic_macros.html#VNotation" target="_self"><sup>(v)</sup></a>&nbsp;the
+size may be left out
+completely so that the macro can be invoked as BOOST_PP_TUPLE_EAT(); you may get a warning from some compilers, but the
+functionality will still work. If you specify a size in the variadic
+version, it will be ignored, but the warning from some compilers will
+not occur.<br>
+ </div>
 	<h4>See Also</h4>
 		<ul>
 			<li><a href="limit_tuple.html">BOOST_PP_LIMIT_TUPLE</a></li>
@@ -32,27 +42,17 @@
 			<b>Header:</b> &nbsp;<a href="../headers/tuple/eat.html">&lt;boost/preprocessor/tuple/eat.hpp&gt;</a>
 		</div>
 	<h4>Sample Code</h4>
-<div><pre>
-#include &lt;<a href="../headers/control/if.html">boost/preprocessor/control/if.hpp</a>&gt;
-#include &lt;<a href="../headers/tuple/eat.html">boost/preprocessor/tuple/eat.hpp</a>&gt;
-
-#define OP(a, b) (a b)
-
-#define MACRO(n) <a href="if.html">BOOST_PP_IF</a>(n, OP, <a href="tuple_eat.html">BOOST_PP_TUPLE_EAT</a>(2))(1, 2)
-
-MACRO(0) // expands to nothing
-MACRO(1) // expands to (1, 2)
-</pre></div>
+<div><pre>#include &lt;<a href="../headers/control/if.html">boost/preprocessor/control/if.hpp</a>&gt;<br>#include &lt;<a href="../headers/tuple/eat.html">boost/preprocessor/tuple/eat.hpp</a>&gt;<br><br>#define OP(a, b) (a b)<br><br>#define MACRO(n) <a href="if.html">BOOST_PP_IF</a>(n, OP, <a href="tuple_eat.html">BOOST_PP_TUPLE_EAT</a>(2))(1, 2)<br><br>// or for the variadic version <a href="../topics/variadic_macros.html#VNotation" target="_self"><sup>(v)</sup></a><br><br>#define MACRO(n) <a href="if.html">BOOST_PP_IF</a>(n, OP, <a href="tuple_eat.html">BOOST_PP_TUPLE_EAT</a>())(1, 2)<br><br>MACRO(0) // expands to nothing<br>MACRO(1) // expands to (1, 2)<br></pre></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>
+		<br><i>© Copyright Paul Mensonides 2002<br>
+</i><i>© Copyright Edward Diener 2011,2013</i><br>
 	</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>
+		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>
+  </body>
+</html>
--- a/doc/ref/tuple_elem.html
+++ b/doc/ref/tuple_elem.html
@@ -1,22 +1,26 @@
 <html>
-<head>
-	<title>BOOST_PP_TUPLE_ELEM</title>
+  <head>
+    <title>BOOST_PP_TUPLE_ELEM</title>
 	<link rel="stylesheet" type="text/css" href="../styles.css">
-</head>
-<body>
-	<div style="margin-left:  0px;">
+  </head>
+  <body>
+	<div style="margin-left: 0px;">
 		The <b>BOOST_PP_TUPLE_ELEM</b> macro extracts an element from a <i>tuple</i>.
 	</div>
 	<h4>Usage</h4>
 		<div class="code">
-			<b>BOOST_PP_TUPLE_ELEM</b>(<i>size</i>, <i>i</i>, <i>tuple</i>)
-		</div>
+			<b>BOOST_PP_TUPLE_ELEM</b>(<i>size</i>, <i>i</i>, <i>tuple</i>)<sup></sup><br>
+<br>
+or<br>
+<br>
+<b>BOOST_PP_TUPLE_ELEM</b>(<i>...</i>) <a href="../topics/variadic_macros.html#VNotation" target="_self"><sup>(v)</sup></a><b></b><br>
+</div>
 	<h4>Arguments</h4>
 		<dl>
 			<dt>size</dt>
 			<dd>
 				The size of the <i>tuple</i>.&nbsp;
-				Valid <i>tuple</i> sizes range from <i>0</i> to <b>BOOST_PP_LIMIT_TUPLE</b>.&nbsp;
+				Valid <i>tuple</i> sizes range from <i>1</i> to <b>BOOST_PP_LIMIT_TUPLE</b>.&nbsp;
 			</dd>
 			<dt>i</dt>
 			<dd>
@@ -31,7 +35,10 @@
 	<h4>Remarks</h4>
 		<div>
 			The <i>size</i> argument must be the actual size of the <i>tuple</i>,
-			and <i>i</i> must be less than the size of the <i>tuple</i>.
+			and <i>i</i> must be less than the size of the <i>tuple</i>. <br>
+            <br>You can
+            invoke the variadic version as BOOST_PP_TUPLE_ELEM(<i>i</i>,<i>tuple</i>) or
+            BOOST_PP_TUPLE_ELEM(<i>size</i>,<i>i</i>,<i>tuple</i>). 
 		</div>
 	<h4>See Also</h4>
 		<ul>
@@ -42,24 +49,17 @@
 			<b>Header:</b> &nbsp;<a href="../headers/tuple/elem.html">&lt;boost/preprocessor/tuple/elem.hpp&gt;</a>
 		</div>
 	<h4>Sample Code</h4>
-<div><pre>
-#include &lt;<a href="../headers/tuple/elem.html">boost/preprocessor/tuple/elem.hpp</a>&gt;
-
-#define TUPLE (a, b, c, d)
-
-<a href="tuple_elem.html">BOOST_PP_TUPLE_ELEM</a>(4, 0, TUPLE) // expands to a
-<a href="tuple_elem.html">BOOST_PP_TUPLE_ELEM</a>(4, 3, TUPLE) // expands to d
-</pre></div>
+<div><pre>#include &lt;<a href="../headers/tuple/elem.html">boost/preprocessor/tuple/elem.hpp</a>&gt;<br><br>#define TUPLE (a, b, c, d)<br><br><a href="tuple_elem.html">BOOST_PP_TUPLE_ELEM</a>(4, 0, TUPLE) // expands to a<br><a href="tuple_elem.html">BOOST_PP_TUPLE_ELEM</a>(4, 3, TUPLE) // expands to d<br><br>// or for the variadic version <a href="../topics/variadic_macros.html#VNotation" target="_self"><sup>(v)</sup></a><br><br><a href="tuple_elem.html">BOOST_PP_TUPLE_ELEM</a>(0, TUPLE) // expands to a in the variadic version<br><a href="file:///C:/Programming/VersionControl/sandbox/variadics/libs/preprocessor/doc/ref/tuple_elem.html">BOOST_PP_TUPLE_ELEM</a>(3, TUPLE) // expands to d in the variadic version<br></pre></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>
+		<br><i>© Copyright Paul Mensonides 2002<br>
+        </i><i>© Copyright Edward Diener 2011,2013</i><br>
 	</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>
+		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>
+  </body>
+</html>
--- a/doc/ref/tuple_enum.html
+++ b/doc/ref/tuple_enum.html
@@ -0,0 +1,55 @@
+<html>
+  <head>
+    <title>BOOST_PP_TUPLE_ENUM</title>
+    <link rel="stylesheet" type="text/css" href="../styles.css">
+  </head>
+  <body>
+<div style="margin-left: 0px;"> The <b>BOOST_PP_TUPLE_ENUM</b> macro&nbsp;converts a <i>tuple</i> to its comma-separated elements. The comma-separated elements are in the form of <i>variadic data</i>. </div>
+<h4> Usage </h4>
+<div class="code"> <b>BOOST_PP_TUPLE_ENUM</b>(<i>size,tuple</i>)<br>
+<br>
+or<br>
+<br>
+<b>BOOST_PP_TUPLE_ENUM</b>(<i>...</i>) <a href="../topics/variadic_macros.html#VNotation" target="_self"><sup>(v)</sup></a><b></b><br>
+</div>
+<h4> Arguments </h4>
+<dl>
+  <dt>size</dt>
+  <dd>
+				The size of the <i>tuple</i>.&nbsp;
+				Valid <i>tuple</i> sizes range from <i>1</i> to <b>BOOST_PP_LIMIT_TUPLE</b>. <br>
+  </dd>
+  <dt>tuple</dt>
+  <dd> The <i>tuple</i> whose elements are to be converted. </dd>
+</dl>
+<h4> Remarks </h4>
+<div>
+<br>You can
+invoke the variadic version <a href="../topics/variadic_macros.html#VNotation" target="_self"><sup>(v)</sup></a> as BOOST_PP_TUPLE_ENUM(<i>tuple</i>) or
+BOOST_PP_TUPLE_ENUM(<i>size</i>,<i>tuple</i>).<br>
+</div>
+<h4>See Also</h4>
+<ul>
+<li><a href="limit_tuple.html">BOOST_PP_LIMIT_TUPLE</a><br>
+</li>
+</ul>
+<h4> Requirements </h4>
+<div> <b>Header:</b> &nbsp;<a href="../headers/tuple/enum.html">&lt;boost/preprocessor/tuple/enum.hpp&gt;</a>
+</div>
+<h4> Sample Code </h4>
+<div>
+<pre>#include &lt;<a href="../headers/tuple/enum.html">boost/preprocessor/tuple/enum.hpp</a>&gt;<br><br>#define TUPLE (B,O,O,S,T)<br><br><a href="tuple_enum.html">BOOST_PP_TUPLE_ENUM</a>(5,TUPLE) // expands to B, O, O, S, T<br><br>// or for the variadic version <a href="../topics/variadic_macros.html#VNotation" target="_self"><sup>(v)</sup></a><br><br><a href="tuple_enum.html">BOOST_PP_TUPLE_ENUM</a>(TUPLE) // expands to B, O, O, S, T<br></pre>
+</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<br>
+</i><i>© Copyright Edward Diener 2011,2013</i><br>
+ </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>
--- a/doc/ref/tuple_insert.html
+++ b/doc/ref/tuple_insert.html
@@ -0,0 +1,54 @@
+<html>
+  <head>
+    <meta content="text/html; charset=windows-1252" http-equiv="content-type">
+    <title>BOOST_PP_TUPLE_INSERT</title>
+    <link rel="stylesheet" type="text/css" href="../styles.css">
+  </head>
+  <body>
+    <div style="margin-left:  0px;"> The <b>BOOST_PP_TUPLE_INSERT</b> macro
+      inserts an element into an <i>tuple</i>.</div>
+    <h4>Usage</h4>
+    <div class="code"> <b>BOOST_PP_TUPLE_INSERT</b>(<i>tuple</i>, <i>i</i>, <i>elem</i>)
+      <a href="../topics/variadic_macros.html#VNotation"><sup>(v)</sup></a></div>
+    <h4>Arguments</h4>
+    <dl>
+      <dt>tuple</dt>
+      <dd> The <i>tuple</i> into which an element is to be inserted. </dd>
+      <dt>i</dt>
+      <dd> The zero-based position in <i>tuple</i> where an element is to be
+        inserted.&nbsp; Valid values range from <i>0</i> to <b>BOOST_PP_TUPLE_SIZE</b>(<i>tuple</i>).</dd>
+      <dt>elem</dt>
+      <dd> The element to insert. </dd>
+    </dl>
+    <h4>Remarks</h4>
+    <div> This macro inserts <i>elem</i> before the element at index <i>i</i>.
+    </div>
+    <div> If the operation attempts to create an <i>tuple</i> that is larger
+      than <b>BOOST_PP_LIMIT_TUPLE</b>, the result is undefined.</div>
+    <div> This macro uses <b>BOOST_PP_WHILE</b> interally.&nbsp; Therefore, to
+      use the <i>d</i> parameter passed from other macros that use <b>BOOST_PP_WHILE</b>,
+      see <b>BOOST_PP_TUPLE_INSERT_D</b>.</div>
+    <h4>See Also</h4>
+    <ul>
+      <li><a href="tuple_insert_d.html">BOOST_PP_TUPLE_INSERT_D</a></li>
+    </ul>
+    <h4>Requirements</h4>
+    <div> <b>Header:</b> &nbsp;<a href="../headers/tuple/insert.html">&lt;boost/preprocessor/tuple/insert.hpp&gt;</a>
+    </div>
+    <h4>Sample Code</h4>
+    <div>
+      <pre>#include &lt;<a href="../headers/tuple/insert.html">boost/preprocessor/tuple/insert.hpp</a>&gt;
+
+#define TUPLE (a, b, d)
+
+<a href="tuple_insert.html">BOOST_PP_TUPLE_INSERT</a>(TUPLE, 2, c) // expands to (a, b, c, d)
+</pre></div>
+    <hr size="1">
+    <div style="margin-left: 0px;"> <i>© Copyright Edward Diener 2013</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>
--- a/doc/ref/tuple_insert_d.html
+++ b/doc/ref/tuple_insert_d.html
@@ -0,0 +1,46 @@
+<html>
+  <head>
+    <meta content="text/html; charset=windows-1252" http-equiv="content-type">
+    <title>BOOST_PP_TUPLE_INSERT_D</title>
+    <link rel="stylesheet" type="text/css" href="../styles.css">
+  </head>
+  <body>
+    <div style="margin-left:  0px;"> The <b>BOOST_PP_TUPLE_INSERT_D</b> macro
+      inserts an element into a <i>tuple</i>.&nbsp; It reenters <b>BOOST_PP_WHILE</b>
+      with maximum efficiency.</div>
+    <h4>Usage</h4>
+    <div class="code"> <b>BOOST_PP_TUPLE_INSERT_D</b>(<i>d</i>, <i>tuple</i>,
+      <i>i</i>, <i>elem</i>) <a href="../topics/variadic_macros.html#VNotation"><sup>(v)</sup></a></div>
+    <h4>Arguments</h4>
+    <dl>
+      <dt>d</dt>
+      <dd> The next available <b>BOOST_PP_WHILE</b> iteration. </dd>
+      <dt>tuple</dt>
+      <dd> The <i>tuple</i> into which an element is to be inserted.</dd>
+      <dt>i</dt>
+      <dd> The zero-based position in <i>tuple</i> where an element is to be
+        inserted.&nbsp; Valid values range from <i>0</i> to <b>BOOST_PP_TUPLE_SIZE</b>(<i>tuple</i>).</dd>
+      <dt>elem</dt>
+      <dd> The element to insert. </dd>
+    </dl>
+    <h4>Remarks</h4>
+    <div> This macro inserts <i>elem</i> before the element at index <i>i</i>.
+    </div>
+    <div> If the operation attempts to create an <i>tuple</i> that is larger
+      than <b>BOOST_PP_LIMIT_TUPLE</b>, the result is undefined.</div>
+    <h4>See Also</h4>
+    <ul>
+      <li><a href="tuple_insert.html">BOOST_PP_TUPLE_INSERT</a></li>
+    </ul>
+    <h4>Requirements</h4>
+    <div> <b>Header:</b> &nbsp;<a href="../headers/tuple/insert.html">&lt;boost/preprocessor/tuple/insert.hpp&gt;</a>
+    </div>
+    <hr size="1">
+    <div style="margin-left: 0px;"> <i>© Copyright Edward Diener 2013</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>
--- a/doc/ref/tuple_pop_back.html
+++ b/doc/ref/tuple_pop_back.html
@@ -0,0 +1,48 @@
+<html>
+  <head>
+    <meta content="text/html; charset=windows-1252" http-equiv="content-type">
+    <title>BOOST_PP_TUPLE_POP_BACK</title>
+    <link rel="stylesheet" type="text/css" href="../styles.css">
+  </head>
+  <body>
+    <div style="margin-left:  0px;"> The <b>BOOST_PP_TUPLE_POP_BACK</b> macro
+      pops an element from the end of an <i>tuple</i>.</div>
+    <h4>Usage</h4>
+    <div class="code"> <b>BOOST_PP_TUPLE_POP_BACK</b>(<i>tuple</i>) <a href="../topics/variadic_macros.html#VNotation"><sup>(v)</sup></a></div>
+    <h4>Arguments</h4>
+    <dl>
+      <dt>tuple</dt>
+      <dd>The <i>tuple</i> to pop an element from.</dd>
+    </dl>
+    <h4>Remarks</h4>
+    <div style="background-color: white;"> This macro returns <i>tuple</i>
+      after removing the last element.&nbsp; If <i>tuple</i> has only a single
+      element, it remains unchanged since a&nbsp;<i>tuple </i>must have at
+      least one element.</div>
+    <div> This macro uses <b>BOOST_PP_REPEAT</b> internally.&nbsp; Therefore,
+      to use the <i>z</i> parameter passed from other macros that use <b>BOOST_PP_REPEAT</b>,
+      see <b>BOOST_PP_TUPLE_POP_BACK_Z</b> </div>
+    <h4>See Also</h4>
+    <ul>
+      <li><a href="tuple_pop_back_z.html">BOOST_PP_TUPLE_POP_BACK_Z</a></li>
+    </ul>
+    <h4>Requirements</h4>
+    <div> <b>Header:</b> &nbsp;<a href="../headers/tuple/pop_back.html">&lt;boost/preprocessor/tuple/pop_back.hpp&gt;</a>
+    </div>
+    <h4>Sample Code</h4>
+    <div>
+      <pre>#include &lt;<a href="../headers/tuple/pop_back.html">boost/preprocessor/tuple/pop_back.hpp</a>&gt;
+
+#define TUPLE (a, b, c)
+
+<a href="tuple_pop_back.html">BOOST_PP_TUPLE_POP_BACK</a>(TUPLE) // expands to (a, b)
+</pre></div>
+    <hr size="1">
+    <div style="margin-left: 0px;"> <i>© Copyright Edward Diener 2013</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>
--- a/doc/ref/tuple_pop_back_z.html
+++ b/doc/ref/tuple_pop_back_z.html
@@ -0,0 +1,40 @@
+<html>
+  <head>
+    <meta content="text/html; charset=windows-1252" http-equiv="content-type">
+    <title>BOOST_PP_TUPLE_POP_BACK_Z</title>
+    <link rel="stylesheet" type="text/css" href="../styles.css">
+  </head>
+  <body>
+    <div style="margin-left:  0px;"> The <b>BOOST_PP_TUPLE_POP_BACK_Z</b> macro
+      pops an element from the end of an <i>tuple</i>.&nbsp; It reenters <b>BOOST_PP_REPEAT</b>
+      with maximum efficiency. </div>
+    <h4>Usage</h4>
+    <div class="code"> <b>BOOST_PP_TUPLE_POP_BACK_Z</b>(<i>z</i>, <i>tuple</i>)
+      <a href="../topics/variadic_macros.html#VNotation"><sup>(v)</sup></a></div>
+    <h4>Arguments</h4>
+    <dl>
+      <dt>z</dt>
+      <dd> The next available <b>BOOST_PP_REPEAT</b> dimension. </dd>
+      <dt>tuple</dt>
+      <dd> The <i>tuple</i> to pop an element from.</dd>
+    </dl>
+    <h4>Remarks</h4>
+    <div> This macro returns <i>tuple</i> after removing the last
+      element.&nbsp; If <i>tuple</i> has only a single element, it remains
+      unchanged since a&nbsp;<i>tuple </i>must have at least one element.</div>
+    <h4>See Also</h4>
+    <ul>
+      <li><a href="tuple_pop_back.html">BOOST_PP_TUPLE_POP_BACK</a></li>
+    </ul>
+    <h4>Requirements</h4>
+    <div> <b>Header:</b> &nbsp;<a href="../headers/tuple/pop_back.html">&lt;boost/preprocessor/tuple/pop_back.hpp&gt;</a>
+    </div>
+    <hr size="1">
+    <div style="margin-left: 0px;"> <i>© Copyright Edward Diener 2013</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>
--- a/Show More
+++ b/Show More