Corrected implementation same as 'develop' and updated test sames as 'develop'.

Back out change from 'develop' because of failing MPL test.
Merge branch 'develop'
2025-06-30 06:20:57 +02:00 · 2015-07-17 07:45:08 -04:00 · 2015-07-16 19:52:49 -04:00 · 2015-07-16 18:16:24 -04:00 · 2015-05-30 08:00:33 -04:00 · 2015-05-29 22:53:01 -04:00
89 changed files with 4715 additions and 692 deletions
--- a/Metaprogramming.html
+++ b/Metaprogramming.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://www.boostpro.com/mplbook/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>
-
-<!--
-<EFBFBD> Copyright Housemarque Oy 2002
-<EFBFBD> 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="Appendix%20A%20%C2%A0%20An%20Introduction%20to%20Preprocessor%20Metaprogramming.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">
+      <!--
+<EFBFBD> Copyright Housemarque Oy 2002<30> 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,5 +1,6 @@
 <html>
  <head>
+    <meta content="text/html; charset=windows-1252" http-equiv="content-type">
    <title>arrays.html</title>
    <link rel="stylesheet" type="text/css" href="../styles.css">
  </head>
@ -17,12 +18,19 @@
      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>
+      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.<br>
+      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>,
--- 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><EFBFBD> Copyright <a href="http://www.housemarque.com" target="_top">Housemarque Oy</a> 2002</i>
-		</br><i><EFBFBD> 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><EFBFBD> Copyright <a href="http://www.housemarque.com"
+          target="_top">Housemarque Oy</a> 2002</i> <br>
+      <i><EFBFBD> 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><EFBFBD> Copyright <a href="http://www.housemarque.com" target="_top">Housemarque Oy</a> 2002</i>
-		</br><i><EFBFBD> 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><EFBFBD> Copyright <a href="http://www.housemarque.com"
+          target="_top">Housemarque Oy</a> 2002</i> <br>
+      <i><EFBFBD> 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,5 +1,6 @@
 <html>
  <head>
+    <meta content="text/html; charset=windows-1252" http-equiv="content-type">
    <title>tuples.html</title>
    <link rel="stylesheet" type="text/css" href="../styles.css">
  </head>
@ -9,13 +10,19 @@
      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>
+      <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.</div>
+      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>
--- a/doc/headers.html
+++ b/doc/headers.html
@ -54,7 +54,7 @@
      <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">variadics.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>
@ -138,8 +138,10 @@
      <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>
--- a/doc/headers/array/to_list.html
+++ b/doc/headers/array/to_list.html
@ -11,7 +11,7 @@ defines a macro that converts an <i>array</i> to a <i>list</i>. </div>
 </div>
 <h4>Contents</h4>
 <ul>
-  <li><a href="../../ref/to_list.html">BOOST_PP_ARRAY_TO_LIST</a></li>
+  <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><EFBFBD> Copyright Edward Diener 2011</i> </div>
--- a/doc/headers/config/variadics.html
+++ b/doc/headers/config/variadics.html
@ -1,19 +1,19 @@
 <html>
 <head>
-  <title>config/variadics.hpp</title>
+  <title>config/config.hpp</title>
  <link rel="stylesheet" type="text/css" href="../../styles.css">
 </head>
 <body>
 		<div style="margin-left: 0px;">
-			The <b>config/variadics.hpp</b>
-header defines a macro for determining variadic macro support. The file
-is automatically included when needed internally. The end-user can
-include it also in order to use the macro. </div>
+			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/variadics.hpp&gt;</b>
+			#include <b>&lt;boost/preprocessor/config/config.hpp&gt;</b>
 		</div>
 		<h4>
 			Contents
@ -21,7 +21,7 @@ include it also in order to use the macro. </div>
 		<ul>
 			<li><a href="../../ref/variadics.html">BOOST_PP_VARIADICS</a></li></ul>
 	<hr size="1">
-	<div style="margin-left: 0px;"><i><EFBFBD> Copyright Edward Diener 2011</i>
+	<div style="margin-left: 0px;"><i><EFBFBD> Copyright Edward Diener 2011,2014</i>
 	</div>
 	<div style="margin-left: 0px;">
 		<p><small>Distributed under the Boost Software License, Version 1.0. (See
--- 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><EFBFBD> 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><EFBFBD> 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.html
+++ b/doc/ref.html
@ -105,6 +105,7 @@
      <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>
@ -209,6 +210,7 @@
      <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>
--- 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_to_list.html
+++ b/doc/ref/array_to_list.html
@ -1,33 +1,41 @@
 <html>
-<head>
-  <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>
-  <a href="limit_tuple.html"></a><ul>
-</ul>
-<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>)))<br></pre>
-</div>
-<hr size="1">
-<div style="margin-left: 0px;"> <i></i><i><EFBFBD> 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>
+  <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><EFBFBD> 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
@ -1,31 +1,37 @@
 <html>
-<head>
-  <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> 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)<br></pre>
-</div>
-<hr size="1">
-<div style="margin-left: 0px;"> <i></i><i><EFBFBD> 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>
+  <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><EFBFBD> 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
@ -1,31 +1,39 @@
 <html>
-<head>
-  <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> 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)<br></pre>
-</div>
-<hr size="1">
-<div style="margin-left: 0px;"> <i></i><i><EFBFBD> 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>
+  <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><EFBFBD> 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/for_r.html
+++ b/doc/ref/for_r.html
@ -135,7 +135,6 @@ TEMPLATE_TEMPLATE(2, 4, T)
 </pre></div>
    <hr size="1">
    <div style="margin-left: 0px;"> <i><EFBFBD> Copyright <a href="http://www.housemarque.com"
-
          target="_top">Housemarque Oy</a> 2002</i> <br>
      <i><EFBFBD> Copyright Paul Mensonides 2002<br>
      </i><i><EFBFBD> Copyright Edward Diener 2014</i><br>
--- 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><EFBFBD> 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/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><EFBFBD> Copyright <a href="http://www.housemarque.com" target="_top">Housemarque Oy</a> 2002</i>
-		</br><i><EFBFBD> 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><EFBFBD> Copyright <a href="http://www.housemarque.com"
+          target="_top">Housemarque Oy</a> 2002</i> <br>
+      <i><EFBFBD> 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_array.html
+++ b/doc/ref/list_to_array.html
@ -1,39 +1,47 @@
 <html>
-<head>
-  <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. </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>.
-	</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))<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>
+  <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
@ -1,27 +1,34 @@
 <html>
-<head>
-  <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>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>
+  <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
@ -1,40 +1,44 @@
 <html>
-<head>
-  <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>.
-	</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)<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>
+  <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
@ -1,27 +1,32 @@
 <html>
-<head>
-  <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 an <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>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>
+  <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><EFBFBD> Copyright <a href="http://www.housemarque.com" target="_top">Housemarque Oy</a> 2002</i>
-		</br><i><EFBFBD> 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><EFBFBD> Copyright <a href="http://www.housemarque.com"
+
+          target="_top">Housemarque Oy</a> 2002</i> <br>
+      <i><EFBFBD> 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><EFBFBD> Copyright <a href="http://www.housemarque.com" target="_top">Housemarque Oy</a> 2002</i>
-		</br><i><EFBFBD> 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><EFBFBD> Copyright <a href="http://www.housemarque.com"
+          target="_top">Housemarque Oy</a> 2002</i> <br>
+      <i><EFBFBD> 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/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><EFBFBD> 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
@ -79,7 +79,6 @@
 </pre></div>
    <hr size="1">
    <div style="margin-left: 0px;"> <i><EFBFBD> Copyright <a href="http://www.housemarque.com"
-
          target="_top">Housemarque Oy</a> 2002</i> <br>
      <i><EFBFBD> Copyright Paul Mensonides 2002<br>
      </i><i><EFBFBD> Copyright Edward Diener 2014</i><br>
--- 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,67 +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>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</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<br></pre>
-		</div>
-	<hr size="1">
-	<div style="margin-left: 0px;">
-		<i><EFBFBD> Copyright <a href="http://www.housemarque.com" target="_top">Housemarque Oy</a> 2002</i>
-		<br><i><EFBFBD> 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><EFBFBD> Copyright <a href="http://www.housemarque.com"
+          target="_top">Housemarque Oy</a> 2002</i> <br>
+      <i><EFBFBD> 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/variadics.html
+++ b/doc/ref/variadics.html
@ -13,14 +13,14 @@
 code to check for the presence of variadic macro support. It can be
 used by the end-user for the same purpose. The macro equals 1 if
 variadic macros are supported and 0 if they are not. </div><b>Requirements</b>
-<div> <b>Header:</b> &nbsp;<a href="../headers/config/variadics.html">&lt;boost/preprocessor/config/variadics.hpp&gt;</a>
+<div> <b>Header:</b> &nbsp;<a href="../headers/config/variadics.html">&lt;boost/preprocessor/config/config.hpp&gt;</a>
 </div>
 <h4>Sample Code</h4>
 <div>
-<pre>#include &lt;<a href="../headers/config/variadics.html">boost/preprocessor/config/variadics.hpp</a>&gt;<br><br>#if <a href="variadics.html">BOOST_PP_VARIADICS</a><br>#define SOME_MACRO(...) // replacement list<br>#else<br>#define SOME_MACRO(param1,param2) // replacement list<br>#endif<br></pre>
+<pre>#include &lt;<a href="../headers/config/variadics.html">boost/preprocessor/config/config.hpp</a>&gt;<br><br>#if <a href="variadics.html">BOOST_PP_VARIADICS</a><br>#define SOME_MACRO(...) // replacement list<br>#else<br>#define SOME_MACRO(param1,param2) // replacement list<br>#endif<br></pre>
 </div>
 <hr size="1">
-<div style="margin-left: 0px;"> <i></i><i><EFBFBD> Copyright Edward Diener 2011</i> </div>
+<div style="margin-left: 0px;"> <i></i><i><EFBFBD> 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>
--- a/doc/ref/while_d.html
+++ b/doc/ref/while_d.html
@ -104,7 +104,6 @@ ACCUMULATE_D(1, ARRAY)// expands to 10
 </pre></div>
    <hr size="1">
    <div style="margin-left: 0px;"> <i><EFBFBD> Copyright <a href="http://www.housemarque.com"
-
          target="_top">Housemarque Oy</a> 2002</i> <br>
      <i><EFBFBD> Copyright Paul Mensonides 2002<br>
      </i><i><EFBFBD> Copyright Edward Diener 2014</i><br>
--- a/doc/ref/while_d_macros.html
+++ b/doc/ref/while_d_macros.html
@ -29,10 +29,12 @@
    </ul>
    comparison<br>
    <ul>
+      <li><a href="equal_d.html"><span style="     color: gray;">BOOST_PP_EQUAL_D</span></a></li>
      <li><a href="greater_d.html"><span style="     color: gray;">BOOST_PP_GREATER_D</span></a></li>
      <li><a href="greater_equal_d.html"><span style="      color: gray;">BOOST_PP_GREATER_EQUAL_D</span></a></li>
      <li><a href="less_d.html"><span style="       color: gray;">BOOST_PP_LESS_D</span></a></li>
      <li><a href="less_equal_d.html"><span style="        color: gray;">BOOST_PP_LESS_EQUAL_D</span></a></li>
+      <li><a href="not_equal_d.html"><span style="     color: gray;">BOOST_PP_NOT_EQUAL_D</span></a></li>
    </ul>
    control<br>
    <ul>
@ -51,6 +53,7 @@
      <li><a href="list_fold_right_d.html"><span style="               color: gray;">BOOST_PP_LIST_FOLD_RIGHT_d</span></a></li>
      <li><a href="list_rest_n_d.html"><span style="                color: gray;">BOOST_PP_LIST_REST_N_D</span></a></li>
      <li><a href="list_reverse_d.html"><span style="                 color: gray;">BOOST_PP_LIST_REVERSE_D</span></a></li>
+      <li><a href="list_size_d.html"><span style="                 color: gray;">BOOST_PP_LIST_SIZE_D</span></a></li>
      <li><a href="list_to_array_d.html"><span style="                  color: gray;">BOOST_PP_LIST_TO_ARRAY_D</span></a></li>
      <li><a href="list_transform_d.html"><span style="                   color: gray;">BOOST_PP_LIST_TRANSFORM_D</span></a></li>
    </ul>
--- a/doc/title.html
+++ b/doc/title.html
@ -1,5 +1,6 @@
 <html>
  <head>
+    <meta content="text/html; charset=windows-1252" http-equiv="content-type">
    <title>title.html</title>
    <link rel="stylesheet" type="text/css" href="styles.css">
  </head>
@ -11,15 +12,14 @@
      may be used as a standalone library. </div>
    <div> An excerpt from <i>C++ Template Metaprogramming: Concepts, Tools, and
        Techniques from Boost and Beyond</i> by Dave Abrahams and Aleksey
-      Gurtovoy has been made available <a href="http://www.boostpro.com/mplbook/preprocessor.html"
-        target="_top"><font color="blue"><b><u><i>online</i></u></b></font></a>.
+      Gurtovoy has been made <a href="Appendix%20A%20%C2%A0%20An%20Introduction%20to%20Preprocessor%20Metaprogramming.html"
+        target="_top"><font color="blue"><b><u><i>available</i></u></b></font></a>.
      This excerpt contains a basic introduction to the Preprocessor library and
      preprocessor metaprogramming which may help users new to the library and
      users interested in seeing some of the facilities offered by the library.
    </div>
    <!--
-<EFBFBD> Copyright Housemarque Oy 2002<30> Copyright Paul Mensonides 2002
-Distributed under the Boost Software License, Version 1.0.(See accompanying file LICENSE_1_0.txt or copy at
+<EFBFBD> Copyright Housemarque Oy 2002<30> Copyright Paul Mensonides 2002Distributed 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/include/boost/preprocessor/arithmetic/dec.hpp
+++ b/include/boost/preprocessor/arithmetic/dec.hpp
@ -284,5 +284,6 @@
 # define BOOST_PP_DEC_254 253
 # define BOOST_PP_DEC_255 254
 # define BOOST_PP_DEC_256 255
+# define BOOST_PP_DEC_257 256
 #
 # endif
--- a/include/boost/preprocessor/array/detail/get_data.hpp
+++ b/include/boost/preprocessor/array/detail/get_data.hpp
@ -0,0 +1,55 @@
+# /* **************************************************************************
+#  *                                                                          *
+#  *     (C) Copyright Edward Diener 2014.                                    *
+#  *     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)                                *
+#  *                                                                          *
+#  ************************************************************************** */
+#
+# /* See http://www.boost.org for most recent version. */
+#
+# ifndef BOOST_PREPROCESSOR_ARRAY_DETAIL_GET_DATA_HPP
+# define BOOST_PREPROCESSOR_ARRAY_DETAIL_GET_DATA_HPP
+#
+# include <boost/preprocessor/config/config.hpp>
+# include <boost/preprocessor/tuple/rem.hpp>
+# include <boost/preprocessor/control/if.hpp>
+# include <boost/preprocessor/control/iif.hpp>
+# include <boost/preprocessor/facilities/is_1.hpp>
+#
+# /* BOOST_PP_ARRAY_DETAIL_GET_DATA */
+#
+# define BOOST_PP_ARRAY_DETAIL_GET_DATA_NONE(size, data)
+
+# if BOOST_PP_VARIADICS && !(BOOST_PP_VARIADICS_MSVC && _MSC_VER <= 1400)
+# 	 if BOOST_PP_VARIADICS_MSVC
+# 		define BOOST_PP_ARRAY_DETAIL_GET_DATA_ANY_VC_DEFAULT(size, data) BOOST_PP_TUPLE_REM(size) data
+# 		define BOOST_PP_ARRAY_DETAIL_GET_DATA_ANY_VC_CAT(size, data) BOOST_PP_TUPLE_REM_CAT(size) data
+# 		define BOOST_PP_ARRAY_DETAIL_GET_DATA_ANY(size, data) \
+			BOOST_PP_IIF \
+				( \
+				BOOST_PP_IS_1(size), \
+				BOOST_PP_ARRAY_DETAIL_GET_DATA_ANY_VC_CAT, \
+				BOOST_PP_ARRAY_DETAIL_GET_DATA_ANY_VC_DEFAULT \
+				) \
+			(size,data) \
+/**/
+#    else
+# 		define BOOST_PP_ARRAY_DETAIL_GET_DATA_ANY(size, data) BOOST_PP_TUPLE_REM(size) data
+#    endif
+# else
+# 	 define BOOST_PP_ARRAY_DETAIL_GET_DATA_ANY(size, data) BOOST_PP_TUPLE_REM(size) data
+# endif
+
+# define BOOST_PP_ARRAY_DETAIL_GET_DATA(size, data) \
+	BOOST_PP_IF \
+		( \
+		size, \
+		BOOST_PP_ARRAY_DETAIL_GET_DATA_ANY, \
+		BOOST_PP_ARRAY_DETAIL_GET_DATA_NONE \
+		) \
+	(size,data) \
+/**/
+#
+# endif /* BOOST_PREPROCESSOR_ARRAY_DETAIL_GET_DATA_HPP */
--- a/include/boost/preprocessor/array/push_back.hpp
+++ b/include/boost/preprocessor/array/push_back.hpp
@ -1,6 +1,7 @@
 # /* **************************************************************************
 #  *                                                                          *
 #  *     (C) Copyright Paul Mensonides 2002.
+#  *     (C) Copyright Edward Diener 2014.
 #  *     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)
@ -18,6 +19,7 @@
 # include <boost/preprocessor/config/config.hpp>
 # include <boost/preprocessor/punctuation/comma_if.hpp>
 # include <boost/preprocessor/tuple/rem.hpp>
+# include <boost/preprocessor/array/detail/get_data.hpp>
 #
 # /* BOOST_PP_ARRAY_PUSH_BACK */
 #
@ -28,6 +30,6 @@
 #    define BOOST_PP_ARRAY_PUSH_BACK_D(array, elem) BOOST_PP_ARRAY_PUSH_BACK_I(BOOST_PP_ARRAY_SIZE(array), BOOST_PP_ARRAY_DATA(array), elem)
 # endif
 #
-# define BOOST_PP_ARRAY_PUSH_BACK_I(size, data, elem) (BOOST_PP_INC(size), (BOOST_PP_TUPLE_REM(size) data BOOST_PP_COMMA_IF(size) elem))
+# define BOOST_PP_ARRAY_PUSH_BACK_I(size, data, elem) (BOOST_PP_INC(size), (BOOST_PP_ARRAY_DETAIL_GET_DATA(size,data) BOOST_PP_COMMA_IF(size) elem))
 #
 # endif
--- a/include/boost/preprocessor/array/push_front.hpp
+++ b/include/boost/preprocessor/array/push_front.hpp
@ -1,6 +1,7 @@
 # /* **************************************************************************
 #  *                                                                          *
 #  *     (C) Copyright Paul Mensonides 2002.
+#  *     (C) Copyright Edward Diener 2014.
 #  *     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)
@ -18,6 +19,7 @@
 # include <boost/preprocessor/config/config.hpp>
 # include <boost/preprocessor/punctuation/comma_if.hpp>
 # include <boost/preprocessor/tuple/rem.hpp>
+# include <boost/preprocessor/array/detail/get_data.hpp>
 #
 # /* BOOST_PP_ARRAY_PUSH_FRONT */
 #
@ -28,6 +30,6 @@
 #    define BOOST_PP_ARRAY_PUSH_FRONT_D(array, elem) BOOST_PP_ARRAY_PUSH_FRONT_I(BOOST_PP_ARRAY_SIZE(array), BOOST_PP_ARRAY_DATA(array), elem)
 # endif
 #
-# define BOOST_PP_ARRAY_PUSH_FRONT_I(size, data, elem) (BOOST_PP_INC(size), (elem BOOST_PP_COMMA_IF(size) BOOST_PP_TUPLE_REM(size) data))
+# define BOOST_PP_ARRAY_PUSH_FRONT_I(size, data, elem) (BOOST_PP_INC(size), (elem BOOST_PP_COMMA_IF(size) BOOST_PP_ARRAY_DETAIL_GET_DATA(size,data)))
 #
 # endif
--- a/include/boost/preprocessor/array/to_list.hpp
+++ b/include/boost/preprocessor/array/to_list.hpp
@ -15,19 +15,33 @@
 #
 # include <boost/preprocessor/cat.hpp>
 # include <boost/preprocessor/config/config.hpp>
+# include <boost/preprocessor/array/size.hpp>
+# include <boost/preprocessor/control/if.hpp>
 # include <boost/preprocessor/tuple/to_list.hpp>
 #
 # /* BOOST_PP_ARRAY_TO_LIST */
 #
+#    define BOOST_PP_ARRAY_TO_LIST(array) \
+		BOOST_PP_IF \
+			( \
+			BOOST_PP_ARRAY_SIZE(array), \
+			BOOST_PP_ARRAY_TO_LIST_DO, \
+			BOOST_PP_ARRAY_TO_LIST_EMPTY \
+			) \
+		(array) \
+/**/
+#
+#    define BOOST_PP_ARRAY_TO_LIST_EMPTY(array) BOOST_PP_NIL
+#
 # if BOOST_PP_CONFIG_FLAGS() & BOOST_PP_CONFIG_MSVC()
-#    define BOOST_PP_ARRAY_TO_LIST(array) BOOST_PP_ARRAY_TO_LIST_I(BOOST_PP_TUPLE_TO_LIST, array)
+#    define BOOST_PP_ARRAY_TO_LIST_DO(array) BOOST_PP_ARRAY_TO_LIST_I(BOOST_PP_TUPLE_TO_LIST, array)
 #    define BOOST_PP_ARRAY_TO_LIST_I(m, args) BOOST_PP_ARRAY_TO_LIST_II(m, args)
 #    define BOOST_PP_ARRAY_TO_LIST_II(m, args) BOOST_PP_CAT(m ## args,)
 # elif BOOST_PP_CONFIG_FLAGS() & BOOST_PP_CONFIG_MWCC()
-#    define BOOST_PP_ARRAY_TO_LIST(array) BOOST_PP_ARRAY_TO_LIST_I(array)
+#    define BOOST_PP_ARRAY_TO_LIST_DO(array) BOOST_PP_ARRAY_TO_LIST_I(array)
 #    define BOOST_PP_ARRAY_TO_LIST_I(array) BOOST_PP_TUPLE_TO_LIST ## array
 # else
-#    define BOOST_PP_ARRAY_TO_LIST(array) BOOST_PP_TUPLE_TO_LIST array
+#    define BOOST_PP_ARRAY_TO_LIST_DO(array) BOOST_PP_TUPLE_TO_LIST array
 # endif
 #
 # endif
--- a/include/boost/preprocessor/array/to_seq.hpp
+++ b/include/boost/preprocessor/array/to_seq.hpp
@ -15,19 +15,32 @@
 #
 # include <boost/preprocessor/cat.hpp>
 # include <boost/preprocessor/config/config.hpp>
+# include <boost/preprocessor/array/size.hpp>
+# include <boost/preprocessor/control/if.hpp>
 # include <boost/preprocessor/tuple/to_seq.hpp>
 #
 # /* BOOST_PP_ARRAY_TO_SEQ */
 #
+#    define BOOST_PP_ARRAY_TO_SEQ(array) \
+		BOOST_PP_IF \
+			( \
+			BOOST_PP_ARRAY_SIZE(array), \
+			BOOST_PP_ARRAY_TO_SEQ_DO, \
+			BOOST_PP_ARRAY_TO_SEQ_EMPTY \
+			) \
+		(array) \
+/**/
+#    define BOOST_PP_ARRAY_TO_SEQ_EMPTY(array)
+#
 # if BOOST_PP_CONFIG_FLAGS() & BOOST_PP_CONFIG_MSVC()
-#    define BOOST_PP_ARRAY_TO_SEQ(array) BOOST_PP_ARRAY_TO_SEQ_I(BOOST_PP_TUPLE_TO_SEQ, array)
+#    define BOOST_PP_ARRAY_TO_SEQ_DO(array) BOOST_PP_ARRAY_TO_SEQ_I(BOOST_PP_TUPLE_TO_SEQ, array)
 #    define BOOST_PP_ARRAY_TO_SEQ_I(m, args) BOOST_PP_ARRAY_TO_SEQ_II(m, args)
 #    define BOOST_PP_ARRAY_TO_SEQ_II(m, args) BOOST_PP_CAT(m ## args,)
 # elif BOOST_PP_CONFIG_FLAGS() & BOOST_PP_CONFIG_MWCC()
-#    define BOOST_PP_ARRAY_TO_SEQ(array) BOOST_PP_ARRAY_TO_SEQ_I(array)
+#    define BOOST_PP_ARRAY_TO_SEQ_DO(array) BOOST_PP_ARRAY_TO_SEQ_I(array)
 #    define BOOST_PP_ARRAY_TO_SEQ_I(array) BOOST_PP_TUPLE_TO_SEQ ## array
 # else
-#    define BOOST_PP_ARRAY_TO_SEQ(array) BOOST_PP_TUPLE_TO_SEQ array
+#    define BOOST_PP_ARRAY_TO_SEQ_DO(array) BOOST_PP_TUPLE_TO_SEQ array
 # endif
 #
 # endif
--- a/include/boost/preprocessor/array/to_tuple.hpp
+++ b/include/boost/preprocessor/array/to_tuple.hpp
@ -14,9 +14,20 @@
 # define BOOST_PREPROCESSOR_ARRAY_TO_TUPLE_HPP
 #
 # include <boost/preprocessor/array/data.hpp>
+# include <boost/preprocessor/array/size.hpp>
+# include <boost/preprocessor/control/if.hpp>
 #
 # /* BOOST_PP_ARRAY_TO_TUPLE */
 #
-# define BOOST_PP_ARRAY_TO_TUPLE BOOST_PP_ARRAY_DATA
+#    define BOOST_PP_ARRAY_TO_TUPLE(array) \
+		BOOST_PP_IF \
+			( \
+			BOOST_PP_ARRAY_SIZE(array), \
+			BOOST_PP_ARRAY_DATA, \
+			BOOST_PP_ARRAY_TO_TUPLE_EMPTY \
+			) \
+		(array) \
+/**/
+#    define BOOST_PP_ARRAY_TO_TUPLE_EMPTY(array)
 #
 # endif
--- a/include/boost/preprocessor/config/config.hpp
+++ b/include/boost/preprocessor/config/config.hpp
@ -32,7 +32,7 @@
 #    elif defined(__MWERKS__) && __MWERKS__ >= 0x3200
 #        define BOOST_PP_CONFIG_FLAGS() (BOOST_PP_CONFIG_STRICT())
 #    elif defined(__EDG__) || defined(__EDG_VERSION__)
-#        if defined(_MSC_VER) && __EDG_VERSION__ >= 308
+#        if defined(_MSC_VER) && (defined(__INTELLISENSE__) || __EDG_VERSION__ >= 308)
 #            define BOOST_PP_CONFIG_FLAGS() (BOOST_PP_CONFIG_MSVC())
 #        else
 #            define BOOST_PP_CONFIG_FLAGS() (BOOST_PP_CONFIG_EDG() | BOOST_PP_CONFIG_STRICT())
@ -70,19 +70,18 @@
 #
 # /* BOOST_PP_VARIADICS */
 #
+# define BOOST_PP_VARIADICS_MSVC 0
 # if !defined BOOST_PP_VARIADICS
 #    /* variadic support explicitly disabled for all untested compilers */
-#    if defined __GCCXML__ || defined __CUDACC__ || defined __PATHSCALE__ || defined __DMC__ || defined __CODEGEARC__ || defined __BORLANDC__ || defined __MWERKS__ || defined __SUNPRO_CC || defined __HP_aCC && !defined __EDG__ || defined __MRC__ || defined __SC__ || defined __IBMCPP__ || defined __PGI
+#    if defined __GCCXML__ || defined __CUDACC__ || defined __PATHSCALE__ || defined __DMC__ || defined __CODEGEARC__ || defined __BORLANDC__ || defined __MWERKS__ || ( defined __SUNPRO_CC && __SUNPRO_CC < 0x5130 ) || defined __HP_aCC && !defined __EDG__ || defined __MRC__ || defined __SC__ || defined __IBMCPP__ || defined __PGI
 #        define BOOST_PP_VARIADICS 0
-#    /* Clang, all versions */
-#    elif defined __clang__
-#        define BOOST_PP_VARIADICS 1
 #    /* VC++ (C/C++) */
-#    elif defined _MSC_VER && _MSC_VER >= 1400 && !defined __EDG__
+#    elif defined _MSC_VER && _MSC_VER >= 1400 && (!defined __EDG__ || defined(__INTELLISENSE__)) && !defined __clang__
 #        define BOOST_PP_VARIADICS 1
+#        undef BOOST_PP_VARIADICS_MSVC
 #        define BOOST_PP_VARIADICS_MSVC 1
 #    /* Wave (C/C++), GCC (C++) */
-#    elif defined __WAVE__ && __WAVE_HAS_VARIADICS__ || defined __GNUC__ && __GXX_EXPERIMENTAL_CXX0X__
+#    elif defined __WAVE__ && __WAVE_HAS_VARIADICS__ || defined __GNUC__ && defined __GXX_EXPERIMENTAL_CXX0X__ && __GXX_EXPERIMENTAL_CXX0X__
 #        define BOOST_PP_VARIADICS 1
 #    /* EDG-based (C/C++), GCC (C), and unknown (C/C++) */
 #    elif !defined __cplusplus && __STDC_VERSION__ >= 199901L || __cplusplus >= 201103L
@ -93,7 +92,8 @@
 # elif !BOOST_PP_VARIADICS + 1 < 2
 #    undef BOOST_PP_VARIADICS
 #    define BOOST_PP_VARIADICS 1
-#    if defined _MSC_VER && _MSC_VER >= 1400 && !(defined __EDG__ || defined __GCCXML__ || defined __CUDACC__ || defined __PATHSCALE__ || defined __clang__ || defined __DMC__ || defined __CODEGEARC__ || defined __BORLANDC__ || defined __MWERKS__ || defined __SUNPRO_CC || defined __HP_aCC || defined __MRC__ || defined __SC__ || defined __IBMCPP__ || defined __PGI)
+#    if defined _MSC_VER && _MSC_VER >= 1400 && (defined(__INTELLISENSE__) || !(defined __EDG__ || defined __GCCXML__ || defined __CUDACC__ || defined __PATHSCALE__ || defined __clang__ || defined __DMC__ || defined __CODEGEARC__ || defined __BORLANDC__ || defined __MWERKS__ || defined __SUNPRO_CC || defined __HP_aCC || defined __MRC__ || defined __SC__ || defined __IBMCPP__ || defined __PGI))
+#        undef BOOST_PP_VARIADICS_MSVC
 #        define BOOST_PP_VARIADICS_MSVC 1
 #    endif
 # else
--- a/include/boost/preprocessor/facilities/detail/is_empty.hpp
+++ b/include/boost/preprocessor/facilities/detail/is_empty.hpp
@ -0,0 +1,55 @@
+# /* **************************************************************************
+#  *                                                                          *
+#  *     (C) Copyright Edward Diener 2014.
+#  *     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)
+#  *                                                                          *
+#  ************************************************************************** */
+#
+# /* See http://www.boost.org for most recent version. */
+#
+#ifndef BOOST_PREPROCESSOR_DETAIL_IS_EMPTY_HPP
+#define BOOST_PREPROCESSOR_DETAIL_IS_EMPTY_HPP
+
+#include <boost/preprocessor/punctuation/is_begin_parens.hpp>
+
+#if BOOST_PP_VARIADICS_MSVC
+
+# pragma warning(once:4002)
+
+#define BOOST_PP_DETAIL_IS_EMPTY_IIF_0(t, b) b
+#define BOOST_PP_DETAIL_IS_EMPTY_IIF_1(t, b) t
+
+#else
+
+#define BOOST_PP_DETAIL_IS_EMPTY_IIF_0(t, ...) __VA_ARGS__
+#define BOOST_PP_DETAIL_IS_EMPTY_IIF_1(t, ...) t
+
+#endif
+
+#if BOOST_PP_VARIADICS_MSVC && _MSC_VER <= 1400
+
+#define BOOST_PP_DETAIL_IS_EMPTY_PROCESS(param) \
+	BOOST_PP_IS_BEGIN_PARENS \
+    	( \
+        BOOST_PP_DETAIL_IS_EMPTY_NON_FUNCTION_C param () \
+        ) \
+/**/
+
+#else
+
+#define BOOST_PP_DETAIL_IS_EMPTY_PROCESS(...) \
+	BOOST_PP_IS_BEGIN_PARENS \
+        ( \
+        BOOST_PP_DETAIL_IS_EMPTY_NON_FUNCTION_C __VA_ARGS__ () \
+        ) \
+/**/
+
+#endif
+
+#define BOOST_PP_DETAIL_IS_EMPTY_PRIMITIVE_CAT(a, b) a ## b
+#define BOOST_PP_DETAIL_IS_EMPTY_IIF(bit) BOOST_PP_DETAIL_IS_EMPTY_PRIMITIVE_CAT(BOOST_PP_DETAIL_IS_EMPTY_IIF_,bit)
+#define BOOST_PP_DETAIL_IS_EMPTY_NON_FUNCTION_C(...) ()
+
+#endif /* BOOST_PREPROCESSOR_DETAIL_IS_EMPTY_HPP */
--- a/include/boost/preprocessor/facilities/empty.hpp
+++ b/include/boost/preprocessor/facilities/empty.hpp
@ -14,6 +14,8 @@
 # ifndef BOOST_PREPROCESSOR_FACILITIES_EMPTY_HPP
 # define BOOST_PREPROCESSOR_FACILITIES_EMPTY_HPP
 #
+# include <boost/preprocessor/config/config.hpp>
+#
 # /* BOOST_PP_EMPTY */
 #
 # define BOOST_PP_EMPTY()
--- a/include/boost/preprocessor/facilities/is_empty.hpp
+++ b/include/boost/preprocessor/facilities/is_empty.hpp
@ -1,6 +1,7 @@
 # /* **************************************************************************
 #  *                                                                          *
 #  *     (C) Copyright Paul Mensonides 2003.
+#  *     (C) Copyright Edward Diener 2014.
 #  *     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)
@ -13,17 +14,27 @@
 # define BOOST_PREPROCESSOR_FACILITIES_IS_EMPTY_HPP
 #
 # include <boost/preprocessor/config/config.hpp>
-# include <boost/preprocessor/cat.hpp>
+#
+# if BOOST_PP_VARIADICS
+#
+# include <boost/preprocessor/facilities/is_empty_variadic.hpp>
+#
+# else
+#
+# if ~BOOST_PP_CONFIG_FLAGS() & BOOST_PP_CONFIG_MSVC() && ~BOOST_PP_CONFIG_FLAGS() & BOOST_PP_CONFIG_MWCC()
 # include <boost/preprocessor/tuple/elem.hpp>
-# include <boost/preprocessor/facilities/empty.hpp>
+# include <boost/preprocessor/facilities/identity.hpp>
+# else
+# include <boost/preprocessor/cat.hpp>
 # include <boost/preprocessor/detail/split.hpp>
+# endif
 #
 # /* BOOST_PP_IS_EMPTY */
 #
 # if ~BOOST_PP_CONFIG_FLAGS() & BOOST_PP_CONFIG_MSVC() && ~BOOST_PP_CONFIG_FLAGS() & BOOST_PP_CONFIG_MWCC()
 #    define BOOST_PP_IS_EMPTY(x) BOOST_PP_IS_EMPTY_I(x BOOST_PP_IS_EMPTY_HELPER)
 #    define BOOST_PP_IS_EMPTY_I(contents) BOOST_PP_TUPLE_ELEM(2, 1, (BOOST_PP_IS_EMPTY_DEF_ ## contents()))
-#    define BOOST_PP_IS_EMPTY_DEF_BOOST_PP_IS_EMPTY_HELPER 1, 1 BOOST_PP_EMPTY
+#    define BOOST_PP_IS_EMPTY_DEF_BOOST_PP_IS_EMPTY_HELPER 1, BOOST_PP_IDENTITY(1)
 #    define BOOST_PP_IS_EMPTY_HELPER() , 0
 # else
 #    if BOOST_PP_CONFIG_FLAGS() & BOOST_PP_CONFIG_MSVC()
@ -40,4 +51,6 @@
 #    define BOOST_PP_IS_EMPTY_DEF_BOOST_PP_IS_EMPTY_HELPER 0, BOOST_PP_NIL
 # endif
 #
-# endif
+# endif /* BOOST_PP_VARIADICS */
+#
+# endif /* BOOST_PREPROCESSOR_FACILITIES_IS_EMPTY_HPP */
--- a/include/boost/preprocessor/facilities/is_empty_or_1.hpp
+++ b/include/boost/preprocessor/facilities/is_empty_or_1.hpp
@ -14,6 +14,7 @@
 #
 # include <boost/preprocessor/control/iif.hpp>
 # include <boost/preprocessor/facilities/empty.hpp>
+# include <boost/preprocessor/facilities/identity.hpp>
 # include <boost/preprocessor/facilities/is_1.hpp>
 # include <boost/preprocessor/facilities/is_empty.hpp>
 #
@ -22,7 +23,7 @@
 # define BOOST_PP_IS_EMPTY_OR_1(x) \
    BOOST_PP_IIF( \
        BOOST_PP_IS_EMPTY(x BOOST_PP_EMPTY()), \
-        1 BOOST_PP_EMPTY, \
+        BOOST_PP_IDENTITY(1), \
        BOOST_PP_IS_1 \
    )(x) \
    /**/
--- a/include/boost/preprocessor/facilities/is_empty_variadic.hpp
+++ b/include/boost/preprocessor/facilities/is_empty_variadic.hpp
@ -0,0 +1,57 @@
+# /* **************************************************************************
+#  *                                                                          *
+#  *     (C) Copyright Edward Diener 2014.
+#  *     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)
+#  *                                                                          *
+#  ************************************************************************** */
+#
+# /* See http://www.boost.org for most recent version. */
+#
+# ifndef BOOST_PREPROCESSOR_FACILITIES_IS_EMPTY_VARIADIC_HPP
+# define BOOST_PREPROCESSOR_FACILITIES_IS_EMPTY_VARIADIC_HPP
+#
+# include <boost/preprocessor/config/config.hpp>
+#
+# if BOOST_PP_VARIADICS
+#
+# include <boost/preprocessor/punctuation/is_begin_parens.hpp>
+# include <boost/preprocessor/facilities/detail/is_empty.hpp>
+#
+#if BOOST_PP_VARIADICS_MSVC && _MSC_VER <= 1400
+#
+#define BOOST_PP_IS_EMPTY(param) \
+    BOOST_PP_DETAIL_IS_EMPTY_IIF \
+      ( \
+      BOOST_PP_IS_BEGIN_PARENS \
+        ( \
+        param \
+        ) \
+      ) \
+      ( \
+      BOOST_PP_IS_EMPTY_ZERO, \
+      BOOST_PP_DETAIL_IS_EMPTY_PROCESS \
+      ) \
+    (param) \
+/**/
+#define BOOST_PP_IS_EMPTY_ZERO(param) 0
+# else
+#define BOOST_PP_IS_EMPTY(...) \
+    BOOST_PP_DETAIL_IS_EMPTY_IIF \
+      ( \
+      BOOST_PP_IS_BEGIN_PARENS \
+        ( \
+        __VA_ARGS__ \
+        ) \
+      ) \
+      ( \
+      BOOST_PP_IS_EMPTY_ZERO, \
+      BOOST_PP_DETAIL_IS_EMPTY_PROCESS \
+      ) \
+    (__VA_ARGS__) \
+/**/
+#define BOOST_PP_IS_EMPTY_ZERO(...) 0
+# endif /* BOOST_PP_VARIADICS_MSVC && _MSC_VER <= 1400 */
+# endif /* BOOST_PP_VARIADICS */
+# endif /* BOOST_PREPROCESSOR_FACILITIES_IS_EMPTY_VARIADIC_HPP */
--- a/include/boost/preprocessor/library.hpp
+++ b/include/boost/preprocessor/library.hpp
@ -32,5 +32,6 @@
 # include <boost/preprocessor/stringize.hpp>
 # include <boost/preprocessor/tuple.hpp>
 # include <boost/preprocessor/variadic.hpp>
+# include <boost/preprocessor/wstringize.hpp>
 #
 # endif
--- a/include/boost/preprocessor/list/to_array.hpp
+++ b/include/boost/preprocessor/list/to_array.hpp
@ -1,6 +1,7 @@
 # /* **************************************************************************
 #  *                                                                          *
-#  *     (C) Copyright Edward Diener 2011.
+#  *     (C) Copyright Paul Mensonides 2011.
+#  *     (C) Copyright Edward Diener 2011,2014.
 #  *     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)
@ -19,10 +20,27 @@
 # include <boost/preprocessor/list/adt.hpp>
 # include <boost/preprocessor/tuple/elem.hpp>
 # include <boost/preprocessor/tuple/rem.hpp>
+# if BOOST_PP_VARIADICS && BOOST_PP_VARIADICS_MSVC && (_MSC_VER <= 1400)
+# include <boost/preprocessor/control/iif.hpp>
+# endif
 #
 # /* BOOST_PP_LIST_TO_ARRAY */
 #
+# if BOOST_PP_VARIADICS && BOOST_PP_VARIADICS_MSVC && (_MSC_VER <= 1400)
+# define BOOST_PP_LIST_TO_ARRAY(list) \
+	BOOST_PP_IIF \
+		( \
+		BOOST_PP_LIST_IS_NIL(list), \
+		BOOST_PP_LIST_TO_ARRAY_VC8ORLESS_EMPTY, \
+		BOOST_PP_LIST_TO_ARRAY_VC8ORLESS_DO \
+		) \
+	(list) \
+/**/
+# define BOOST_PP_LIST_TO_ARRAY_VC8ORLESS_EMPTY(list) (0,())
+# define BOOST_PP_LIST_TO_ARRAY_VC8ORLESS_DO(list) BOOST_PP_LIST_TO_ARRAY_I(BOOST_PP_WHILE, list)
+# else
 # define BOOST_PP_LIST_TO_ARRAY(list) BOOST_PP_LIST_TO_ARRAY_I(BOOST_PP_WHILE, list)
+# endif

 # if BOOST_PP_CONFIG_FLAGS() & BOOST_PP_CONFIG_MSVC()
 #    define BOOST_PP_LIST_TO_ARRAY_I(w, list) \
@ -118,6 +136,20 @@
 #
 # /* BOOST_PP_LIST_TO_ARRAY_D */
 #
+# if BOOST_PP_VARIADICS && BOOST_PP_VARIADICS_MSVC && (_MSC_VER <= 1400)
+# define BOOST_PP_LIST_TO_ARRAY_D(d, list) \
+	BOOST_PP_IIF \
+		( \
+		BOOST_PP_LIST_IS_NIL(list), \
+		BOOST_PP_LIST_TO_ARRAY_D_VC8ORLESS_EMPTY, \
+		BOOST_PP_LIST_TO_ARRAY_D_VC8ORLESS_DO \
+		) \
+	(d, list) \
+/**/
+# define BOOST_PP_LIST_TO_ARRAY_D_VC8ORLESS_EMPTY(d, list) (0,())
+# define BOOST_PP_LIST_TO_ARRAY_D_VC8ORLESS_DO(d, list) BOOST_PP_LIST_TO_ARRAY_I(BOOST_PP_WHILE_ ## d, list)
+# else
 # define BOOST_PP_LIST_TO_ARRAY_D(d, list) BOOST_PP_LIST_TO_ARRAY_I(BOOST_PP_WHILE_ ## d, list)
+# endif
 #
 # endif /* BOOST_PREPROCESSOR_LIST_TO_ARRAY_HPP */
--- a/include/boost/preprocessor/list/to_tuple.hpp
+++ b/include/boost/preprocessor/list/to_tuple.hpp
@ -16,22 +16,45 @@
 #
 # include <boost/preprocessor/config/config.hpp>
 # include <boost/preprocessor/list/enum.hpp>
+# include <boost/preprocessor/control/iif.hpp>
 #
 # /* BOOST_PP_LIST_TO_TUPLE */
 #
+# define BOOST_PP_LIST_TO_TUPLE(list) \
+	BOOST_PP_IIF \
+		( \
+		BOOST_PP_LIST_IS_NIL(list), \
+		BOOST_PP_LIST_TO_TUPLE_EMPTY, \
+		BOOST_PP_LIST_TO_TUPLE_DO \
+		) \
+	(list) \
+/**/
+# define BOOST_PP_LIST_TO_TUPLE_EMPTY(list)
+#
 # if ~BOOST_PP_CONFIG_FLAGS() & BOOST_PP_CONFIG_EDG()
-#    define BOOST_PP_LIST_TO_TUPLE(list) (BOOST_PP_LIST_ENUM(list))
+#    define BOOST_PP_LIST_TO_TUPLE_DO(list) (BOOST_PP_LIST_ENUM(list))
 # else
-#    define BOOST_PP_LIST_TO_TUPLE(list) BOOST_PP_LIST_TO_TUPLE_I(list)
+#    define BOOST_PP_LIST_TO_TUPLE_DO(list) BOOST_PP_LIST_TO_TUPLE_I(list)
 #    define BOOST_PP_LIST_TO_TUPLE_I(list) (BOOST_PP_LIST_ENUM(list))
 # endif
 #
 # /* BOOST_PP_LIST_TO_TUPLE_R */
 #
+# define BOOST_PP_LIST_TO_TUPLE_R(r, list) \
+	BOOST_PP_IIF \
+		( \
+		BOOST_PP_LIST_IS_NIL(list), \
+		BOOST_PP_LIST_TO_TUPLE_R_EMPTY, \
+		BOOST_PP_LIST_TO_TUPLE_R_DO \
+		) \
+	(r, list) \
+/**/
+# define BOOST_PP_LIST_TO_TUPLE_R_EMPTY(r,list)
+#
 # if ~BOOST_PP_CONFIG_FLAGS() & BOOST_PP_CONFIG_EDG()
-#    define BOOST_PP_LIST_TO_TUPLE_R(r, list) (BOOST_PP_LIST_ENUM_R(r, list))
+#    define BOOST_PP_LIST_TO_TUPLE_R_DO(r, list) (BOOST_PP_LIST_ENUM_R(r, list))
 # else
-#    define BOOST_PP_LIST_TO_TUPLE_R(r, list) BOOST_PP_LIST_TO_TUPLE_R_I(r, list)
+#    define BOOST_PP_LIST_TO_TUPLE_R_DO(r, list) BOOST_PP_LIST_TO_TUPLE_R_I(r, list)
 #    define BOOST_PP_LIST_TO_TUPLE_R_I(r, list) (BOOST_PP_LIST_ENUM_R(r, list))
 # endif
 #
--- a/include/boost/preprocessor/punctuation.hpp
+++ b/include/boost/preprocessor/punctuation.hpp
@ -14,7 +14,9 @@
 #
 # include <boost/preprocessor/punctuation/comma.hpp>
 # include <boost/preprocessor/punctuation/comma_if.hpp>
+# include <boost/preprocessor/punctuation/is_begin_parens.hpp>
 # include <boost/preprocessor/punctuation/paren.hpp>
 # include <boost/preprocessor/punctuation/paren_if.hpp>
+# include <boost/preprocessor/punctuation/remove_parens.hpp>
 #
 # endif
--- a/include/boost/preprocessor/punctuation/detail/is_begin_parens.hpp
+++ b/include/boost/preprocessor/punctuation/detail/is_begin_parens.hpp
@ -0,0 +1,48 @@
+# /* **************************************************************************
+#  *                                                                          *
+#  *     (C) Copyright Edward Diener 2014.
+#  *     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)
+#  *                                                                          *
+#  ************************************************************************** */
+#
+# /* See http://www.boost.org for most recent version. */
+#
+#ifndef BOOST_PREPROCESSOR_DETAIL_IS_BEGIN_PARENS_HPP
+#define BOOST_PREPROCESSOR_DETAIL_IS_BEGIN_PARENS_HPP
+
+#if BOOST_PP_VARIADICS_MSVC
+
+#include <boost/preprocessor/facilities/empty.hpp>
+
+#define BOOST_PP_DETAIL_VD_IBP_CAT(a, b) BOOST_PP_DETAIL_VD_IBP_CAT_I(a, b)
+#define BOOST_PP_DETAIL_VD_IBP_CAT_I(a, b) BOOST_PP_DETAIL_VD_IBP_CAT_II(a ## b)
+#define BOOST_PP_DETAIL_VD_IBP_CAT_II(res) res
+
+#define BOOST_PP_DETAIL_IBP_SPLIT(i, ...) \
+    BOOST_PP_DETAIL_VD_IBP_CAT(BOOST_PP_DETAIL_IBP_PRIMITIVE_CAT(BOOST_PP_DETAIL_IBP_SPLIT_,i)(__VA_ARGS__),BOOST_PP_EMPTY()) \
+/**/
+
+#define BOOST_PP_DETAIL_IBP_IS_VARIADIC_C(...) 1 1
+
+#else
+
+#define BOOST_PP_DETAIL_IBP_SPLIT(i, ...) \
+    BOOST_PP_DETAIL_IBP_PRIMITIVE_CAT(BOOST_PP_DETAIL_IBP_SPLIT_,i)(__VA_ARGS__) \
+/**/
+
+#define BOOST_PP_DETAIL_IBP_IS_VARIADIC_C(...) 1
+
+#endif /* BOOST_PP_VARIADICS_MSVC */
+
+#define BOOST_PP_DETAIL_IBP_SPLIT_0(a, ...) a
+#define BOOST_PP_DETAIL_IBP_SPLIT_1(a, ...) __VA_ARGS__
+
+#define BOOST_PP_DETAIL_IBP_CAT(a, ...) BOOST_PP_DETAIL_IBP_PRIMITIVE_CAT(a,__VA_ARGS__)
+#define BOOST_PP_DETAIL_IBP_PRIMITIVE_CAT(a, ...) a ## __VA_ARGS__
+
+#define BOOST_PP_DETAIL_IBP_IS_VARIADIC_R_1 1,
+#define BOOST_PP_DETAIL_IBP_IS_VARIADIC_R_BOOST_PP_DETAIL_IBP_IS_VARIADIC_C 0,
+
+#endif /* BOOST_PREPROCESSOR_DETAIL_IS_BEGIN_PARENS_HPP */
--- a/include/boost/preprocessor/punctuation/is_begin_parens.hpp
+++ b/include/boost/preprocessor/punctuation/is_begin_parens.hpp
@ -0,0 +1,51 @@
+# /* **************************************************************************
+#  *                                                                          *
+#  *     (C) Copyright Edward Diener 2014.
+#  *     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)
+#  *                                                                          *
+#  ************************************************************************** */
+#
+# /* See http://www.boost.org for most recent version. */
+#
+# ifndef BOOST_PREPROCESSOR_IS_BEGIN_PARENS_HPP
+# define BOOST_PREPROCESSOR_IS_BEGIN_PARENS_HPP
+
+# include <boost/preprocessor/config/config.hpp>
+
+#if BOOST_PP_VARIADICS
+
+#include <boost/preprocessor/punctuation/detail/is_begin_parens.hpp>
+
+#if BOOST_PP_VARIADICS_MSVC && _MSC_VER <= 1400
+
+#define BOOST_PP_IS_BEGIN_PARENS(param) \
+    BOOST_PP_DETAIL_IBP_SPLIT \
+      ( \
+      0, \
+      BOOST_PP_DETAIL_IBP_CAT \
+        ( \
+        BOOST_PP_DETAIL_IBP_IS_VARIADIC_R_, \
+        BOOST_PP_DETAIL_IBP_IS_VARIADIC_C param \
+        ) \
+      ) \
+/**/
+
+#else
+
+#define BOOST_PP_IS_BEGIN_PARENS(...) \
+    BOOST_PP_DETAIL_IBP_SPLIT \
+      ( \
+      0, \
+      BOOST_PP_DETAIL_IBP_CAT \
+        ( \
+        BOOST_PP_DETAIL_IBP_IS_VARIADIC_R_, \
+        BOOST_PP_DETAIL_IBP_IS_VARIADIC_C __VA_ARGS__ \
+        ) \
+      ) \
+/**/
+
+#endif /* BOOST_PP_VARIADICS_MSVC && _MSC_VER <= 1400 */
+#endif /* BOOST_PP_VARIADICS */
+#endif /* BOOST_PREPROCESSOR_IS_BEGIN_PARENS_HPP */
--- a/include/boost/preprocessor/punctuation/remove_parens.hpp
+++ b/include/boost/preprocessor/punctuation/remove_parens.hpp
@ -0,0 +1,39 @@
+# /* **************************************************************************
+#  *                                                                          *
+#  *     (C) Copyright Edward Diener 2014.
+#  *     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)
+#  *                                                                          *
+#  ************************************************************************** */
+#
+# /* See http://www.boost.org for most recent version. */
+#
+#ifndef BOOST_PREPROCESSOR_REMOVE_PARENS_HPP
+#define BOOST_PREPROCESSOR_REMOVE_PARENS_HPP
+
+#include <boost/preprocessor/config/config.hpp>
+
+#if BOOST_PP_VARIADICS
+
+#include <boost/preprocessor/control/iif.hpp>
+#include <boost/preprocessor/facilities/identity.hpp>
+#include <boost/preprocessor/punctuation/is_begin_parens.hpp>
+#include <boost/preprocessor/tuple/enum.hpp>
+
+#define BOOST_PP_REMOVE_PARENS(param) \
+    BOOST_PP_IIF \
+      ( \
+      BOOST_PP_IS_BEGIN_PARENS(param), \
+      BOOST_PP_REMOVE_PARENS_DO, \
+      BOOST_PP_IDENTITY \
+      ) \
+    (param)() \
+/**/
+
+#define BOOST_PP_REMOVE_PARENS_DO(param) \
+  BOOST_PP_IDENTITY(BOOST_PP_TUPLE_ENUM(param)) \
+/**/
+
+#endif /* BOOST_PP_VARIADICS */
+#endif /* BOOST_PREPROCESSOR_REMOVE_PARENS_HPP */
--- a/include/boost/preprocessor/repetition/for.hpp
+++ b/include/boost/preprocessor/repetition/for.hpp
@ -16,6 +16,8 @@
 #
 # include <boost/preprocessor/cat.hpp>
 # include <boost/preprocessor/debug/error.hpp>
+# include <boost/preprocessor/facilities/empty.hpp>
+# include <boost/preprocessor/logical/bool.hpp>
 # include <boost/preprocessor/detail/auto_rec.hpp>
 #
 # /* BOOST_PP_FOR */
@ -42,7 +44,23 @@
 #    include <boost/preprocessor/repetition/detail/for.hpp>
 # endif
 #
-# define BOOST_PP_FOR_257(s, p, o, m) BOOST_PP_ERROR(0x0002)
+# if BOOST_PP_CONFIG_FLAGS() & BOOST_PP_CONFIG_DMC()
+# define BOOST_PP_FOR_257_PR(s, p) BOOST_PP_BOOL(p##(257, s))
+# else
+# define BOOST_PP_FOR_257_PR(s, p) BOOST_PP_BOOL(p(257, s))
+# endif
+
+# define BOOST_PP_FOR_257_ERROR() BOOST_PP_ERROR(0x0002)
+# define BOOST_PP_FOR_257(s, p, o, m) \
+	BOOST_PP_IIF \
+		( \
+		BOOST_PP_FOR_257_PR(s,p), \
+		BOOST_PP_FOR_257_ERROR, \
+		BOOST_PP_EMPTY \
+		) \
+	() \
+/**/
+// # define BOOST_PP_FOR_257(s, p, o, m) BOOST_PP_ERROR(0x0002)
 #
 # define BOOST_PP_FOR_CHECK_BOOST_PP_NIL 1
 #
--- a/include/boost/preprocessor/seq/detail/binary_transform.hpp
+++ b/include/boost/preprocessor/seq/detail/binary_transform.hpp
@ -16,6 +16,7 @@
 # include <boost/preprocessor/config/config.hpp>
 # include <boost/preprocessor/tuple/eat.hpp>
 # include <boost/preprocessor/tuple/rem.hpp>
+# include <boost/preprocessor/variadic/detail/is_single_return.hpp>
 #
 # /* BOOST_PP_SEQ_BINARY_TRANSFORM */
 #
@ -28,8 +29,15 @@
 #    define BOOST_PP_SEQ_BINARY_TRANSFORM(seq) BOOST_PP_CAT(BOOST_PP_SEQ_BINARY_TRANSFORM_A seq, 0)
 # endif
 # if BOOST_PP_VARIADICS
-#    define BOOST_PP_SEQ_BINARY_TRANSFORM_A(...) (BOOST_PP_REM, __VA_ARGS__)() BOOST_PP_SEQ_BINARY_TRANSFORM_B
-#    define BOOST_PP_SEQ_BINARY_TRANSFORM_B(...) (BOOST_PP_REM, __VA_ARGS__)() BOOST_PP_SEQ_BINARY_TRANSFORM_A
+#    if BOOST_PP_VARIADICS_MSVC
+#		define BOOST_PP_SEQ_BINARY_TRANSFORM_GET_REM(...) \
+			BOOST_PP_VARIADIC_IS_SINGLE_RETURN(BOOST_PP_REM_CAT,BOOST_PP_REM,__VA_ARGS__) \
+		/**/
+#	 else
+#		define BOOST_PP_SEQ_BINARY_TRANSFORM_GET_REM(...) BOOST_PP_REM
+#	 endif
+#    define BOOST_PP_SEQ_BINARY_TRANSFORM_A(...) (BOOST_PP_SEQ_BINARY_TRANSFORM_GET_REM(__VA_ARGS__), __VA_ARGS__)() BOOST_PP_SEQ_BINARY_TRANSFORM_B
+#    define BOOST_PP_SEQ_BINARY_TRANSFORM_B(...) (BOOST_PP_SEQ_BINARY_TRANSFORM_GET_REM(__VA_ARGS__), __VA_ARGS__)() BOOST_PP_SEQ_BINARY_TRANSFORM_A
 # else
 #    define BOOST_PP_SEQ_BINARY_TRANSFORM_A(e) (BOOST_PP_REM, e)() BOOST_PP_SEQ_BINARY_TRANSFORM_B
 #    define BOOST_PP_SEQ_BINARY_TRANSFORM_B(e) (BOOST_PP_REM, e)() BOOST_PP_SEQ_BINARY_TRANSFORM_A
--- a/include/boost/preprocessor/seq/detail/is_empty.hpp
+++ b/include/boost/preprocessor/seq/detail/is_empty.hpp
@ -0,0 +1,49 @@
+# /* **************************************************************************
+#  *                                                                          *
+#  *     (C) Copyright Edward Diener 2015.
+#  *     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)
+#  *                                                                          *
+#  ************************************************************************** */
+#
+# /* See http://www.boost.org for most recent version. */
+#
+# ifndef BOOST_PREPROCESSOR_SEQ_DETAIL_IS_EMPTY_HPP
+# define BOOST_PREPROCESSOR_SEQ_DETAIL_IS_EMPTY_HPP
+#
+# include <boost/preprocessor/config/config.hpp>
+# include <boost/preprocessor/arithmetic/dec.hpp>
+# include <boost/preprocessor/logical/bool.hpp>
+# include <boost/preprocessor/logical/compl.hpp>
+# include <boost/preprocessor/seq/size.hpp>
+#
+/* An empty seq is one that is just BOOST_PP_SEQ_NIL */
+#
+# define BOOST_PP_SEQ_DETAIL_IS_EMPTY(seq) \
+	BOOST_PP_COMPL \
+		( \
+		BOOST_PP_SEQ_DETAIL_IS_NOT_EMPTY(seq) \
+		) \
+/**/
+#
+# define BOOST_PP_SEQ_DETAIL_IS_EMPTY_SIZE(size) \
+	BOOST_PP_COMPL \
+		( \
+		BOOST_PP_SEQ_DETAIL_IS_NOT_EMPTY_SIZE(size) \
+		) \
+/**/
+#
+# define BOOST_PP_SEQ_DETAIL_IS_NOT_EMPTY(seq) \
+	BOOST_PP_SEQ_DETAIL_IS_NOT_EMPTY_SIZE(BOOST_PP_SEQ_DETAIL_EMPTY_SIZE(seq)) \
+/**/
+#
+# define BOOST_PP_SEQ_DETAIL_IS_NOT_EMPTY_SIZE(size) \
+	BOOST_PP_BOOL(size) \
+/**/
+#
+# define BOOST_PP_SEQ_DETAIL_EMPTY_SIZE(seq) \
+	BOOST_PP_DEC(BOOST_PP_SEQ_SIZE(seq (nil))) \
+/**/
+#
+# endif
--- a/include/boost/preprocessor/seq/for_each.hpp
+++ b/include/boost/preprocessor/seq/for_each.hpp
@ -14,47 +14,94 @@
 #
 # include <boost/preprocessor/arithmetic/dec.hpp>
 # include <boost/preprocessor/config/config.hpp>
+# include <boost/preprocessor/control/if.hpp>
+# include <boost/preprocessor/control/iif.hpp>
 # include <boost/preprocessor/repetition/for.hpp>
 # include <boost/preprocessor/seq/seq.hpp>
 # include <boost/preprocessor/seq/size.hpp>
+# include <boost/preprocessor/seq/detail/is_empty.hpp>
 # include <boost/preprocessor/tuple/elem.hpp>
 # include <boost/preprocessor/tuple/rem.hpp>
 #
 # /* BOOST_PP_SEQ_FOR_EACH */
 #
 # if ~BOOST_PP_CONFIG_FLAGS() & BOOST_PP_CONFIG_EDG()
-#    define BOOST_PP_SEQ_FOR_EACH(macro, data, seq) BOOST_PP_FOR((macro, data, seq (nil)), BOOST_PP_SEQ_FOR_EACH_P, BOOST_PP_SEQ_FOR_EACH_O, BOOST_PP_SEQ_FOR_EACH_M)
+#    define BOOST_PP_SEQ_FOR_EACH(macro, data, seq) BOOST_PP_SEQ_FOR_EACH_DETAIL_CHECK(macro, data, seq)
 # else
 #    define BOOST_PP_SEQ_FOR_EACH(macro, data, seq) BOOST_PP_SEQ_FOR_EACH_D(macro, data, seq)
-#    define BOOST_PP_SEQ_FOR_EACH_D(macro, data, seq) BOOST_PP_FOR((macro, data, seq (nil)), BOOST_PP_SEQ_FOR_EACH_P, BOOST_PP_SEQ_FOR_EACH_O, BOOST_PP_SEQ_FOR_EACH_M)
+#    define BOOST_PP_SEQ_FOR_EACH_D(macro, data, seq) BOOST_PP_SEQ_FOR_EACH_DETAIL_CHECK(macro, data, seq)
 # endif
 #
-# define BOOST_PP_SEQ_FOR_EACH_P(r, x) BOOST_PP_DEC(BOOST_PP_SEQ_SIZE(BOOST_PP_TUPLE_ELEM(3, 2, x)))
+#    define BOOST_PP_SEQ_FOR_EACH_DETAIL_CHECK_EXEC(macro, data, seq) BOOST_PP_FOR((macro, data, seq, BOOST_PP_SEQ_SIZE(seq)), BOOST_PP_SEQ_FOR_EACH_P, BOOST_PP_SEQ_FOR_EACH_O, BOOST_PP_SEQ_FOR_EACH_M)
+#    define BOOST_PP_SEQ_FOR_EACH_DETAIL_CHECK_EMPTY(macro, data, seq)
+#
+#    define BOOST_PP_SEQ_FOR_EACH_DETAIL_CHECK(macro, data, seq) \
+		BOOST_PP_IIF \
+			( \
+			BOOST_PP_SEQ_DETAIL_IS_NOT_EMPTY(seq), \
+			BOOST_PP_SEQ_FOR_EACH_DETAIL_CHECK_EXEC, \
+			BOOST_PP_SEQ_FOR_EACH_DETAIL_CHECK_EMPTY \
+			) \
+		(macro, data, seq) \
+/**/
+#
+# define BOOST_PP_SEQ_FOR_EACH_P(r, x) BOOST_PP_TUPLE_ELEM(4, 3, x)
 #
 # if BOOST_PP_CONFIG_FLAGS() & BOOST_PP_CONFIG_STRICT()
 #    define BOOST_PP_SEQ_FOR_EACH_O(r, x) BOOST_PP_SEQ_FOR_EACH_O_I x
 # else
-#    define BOOST_PP_SEQ_FOR_EACH_O(r, x) BOOST_PP_SEQ_FOR_EACH_O_I(BOOST_PP_TUPLE_ELEM(3, 0, x), BOOST_PP_TUPLE_ELEM(3, 1, x), BOOST_PP_TUPLE_ELEM(3, 2, x))
+#    define BOOST_PP_SEQ_FOR_EACH_O(r, x) BOOST_PP_SEQ_FOR_EACH_O_I(BOOST_PP_TUPLE_ELEM(4, 0, x), BOOST_PP_TUPLE_ELEM(4, 1, x), BOOST_PP_TUPLE_ELEM(4, 2, x), BOOST_PP_TUPLE_ELEM(4, 3, x))
 # endif
 #
-# define BOOST_PP_SEQ_FOR_EACH_O_I(macro, data, seq) (macro, data, BOOST_PP_SEQ_TAIL(seq))
+# define BOOST_PP_SEQ_FOR_EACH_O_I(macro, data, seq, sz) \
+	BOOST_PP_SEQ_FOR_EACH_O_I_DEC(macro, data, seq, BOOST_PP_DEC(sz)) \
+/**/
+# define BOOST_PP_SEQ_FOR_EACH_O_I_DEC(macro, data, seq, sz) \
+	( \
+	macro, \
+	data, \
+	BOOST_PP_IF \
+		( \
+		sz, \
+		BOOST_PP_SEQ_FOR_EACH_O_I_TAIL, \
+		BOOST_PP_SEQ_FOR_EACH_O_I_NIL \
+		) \
+	(seq), \
+	sz \
+	) \
+/**/
+# define BOOST_PP_SEQ_FOR_EACH_O_I_TAIL(seq) BOOST_PP_SEQ_TAIL(seq)
+# define BOOST_PP_SEQ_FOR_EACH_O_I_NIL(seq) BOOST_PP_NIL
 #
 # if BOOST_PP_CONFIG_FLAGS() & BOOST_PP_CONFIG_STRICT()
-#    define BOOST_PP_SEQ_FOR_EACH_M(r, x) BOOST_PP_SEQ_FOR_EACH_M_IM(r, BOOST_PP_TUPLE_REM_3 x)
+#    define BOOST_PP_SEQ_FOR_EACH_M(r, x) BOOST_PP_SEQ_FOR_EACH_M_IM(r, BOOST_PP_TUPLE_REM_4 x)
 #    define BOOST_PP_SEQ_FOR_EACH_M_IM(r, im) BOOST_PP_SEQ_FOR_EACH_M_I(r, im)
 # else
-#    define BOOST_PP_SEQ_FOR_EACH_M(r, x) BOOST_PP_SEQ_FOR_EACH_M_I(r, BOOST_PP_TUPLE_ELEM(3, 0, x), BOOST_PP_TUPLE_ELEM(3, 1, x), BOOST_PP_TUPLE_ELEM(3, 2, x))
+#    define BOOST_PP_SEQ_FOR_EACH_M(r, x) BOOST_PP_SEQ_FOR_EACH_M_I(r, BOOST_PP_TUPLE_ELEM(4, 0, x), BOOST_PP_TUPLE_ELEM(4, 1, x), BOOST_PP_TUPLE_ELEM(4, 2, x), BOOST_PP_TUPLE_ELEM(4, 3, x))
 # endif
 #
-# define BOOST_PP_SEQ_FOR_EACH_M_I(r, macro, data, seq) macro(r, data, BOOST_PP_SEQ_HEAD(seq))
+# define BOOST_PP_SEQ_FOR_EACH_M_I(r, macro, data, seq, sz) macro(r, data, BOOST_PP_SEQ_HEAD(seq))
 #
 # /* BOOST_PP_SEQ_FOR_EACH_R */
 #
 # if ~BOOST_PP_CONFIG_FLAGS() & BOOST_PP_CONFIG_EDG()
-#    define BOOST_PP_SEQ_FOR_EACH_R(r, macro, data, seq) BOOST_PP_FOR_ ## r((macro, data, seq (nil)), BOOST_PP_SEQ_FOR_EACH_P, BOOST_PP_SEQ_FOR_EACH_O, BOOST_PP_SEQ_FOR_EACH_M)
+#    define BOOST_PP_SEQ_FOR_EACH_R(r, macro, data, seq) BOOST_PP_SEQ_FOR_EACH_DETAIL_CHECK_R(r, macro, data, seq)
 # else
 #    define BOOST_PP_SEQ_FOR_EACH_R(r, macro, data, seq) BOOST_PP_SEQ_FOR_EACH_R_I(r, macro, data, seq)
-#    define BOOST_PP_SEQ_FOR_EACH_R_I(r, macro, data, seq) BOOST_PP_FOR_ ## r((macro, data, seq (nil)), BOOST_PP_SEQ_FOR_EACH_P, BOOST_PP_SEQ_FOR_EACH_O, BOOST_PP_SEQ_FOR_EACH_M)
+#    define BOOST_PP_SEQ_FOR_EACH_R_I(r, macro, data, seq) BOOST_PP_SEQ_FOR_EACH_DETAIL_CHECK_R(r, macro, data, seq)
 # endif
 #
+#    define BOOST_PP_SEQ_FOR_EACH_DETAIL_CHECK_EXEC_R(r, macro, data, seq) BOOST_PP_FOR_ ## r((macro, data, seq, BOOST_PP_SEQ_SIZE(seq)), BOOST_PP_SEQ_FOR_EACH_P, BOOST_PP_SEQ_FOR_EACH_O, BOOST_PP_SEQ_FOR_EACH_M)
+#    define BOOST_PP_SEQ_FOR_EACH_DETAIL_CHECK_EMPTY_R(r, macro, data, seq)
+#
+#    define BOOST_PP_SEQ_FOR_EACH_DETAIL_CHECK_R(r, macro, data, seq) \
+		BOOST_PP_IIF \
+			( \
+			BOOST_PP_SEQ_DETAIL_IS_NOT_EMPTY(seq), \
+			BOOST_PP_SEQ_FOR_EACH_DETAIL_CHECK_EXEC_R, \
+			BOOST_PP_SEQ_FOR_EACH_DETAIL_CHECK_EMPTY_R \
+			) \
+		(r, macro, data, seq) \
+/**/
+#
 # endif
--- a/include/boost/preprocessor/seq/for_each_i.hpp
+++ b/include/boost/preprocessor/seq/for_each_i.hpp
@ -15,47 +15,95 @@
 # include <boost/preprocessor/arithmetic/dec.hpp>
 # include <boost/preprocessor/arithmetic/inc.hpp>
 # include <boost/preprocessor/config/config.hpp>
+# include <boost/preprocessor/control/if.hpp>
+# include <boost/preprocessor/control/iif.hpp>
 # include <boost/preprocessor/repetition/for.hpp>
 # include <boost/preprocessor/seq/seq.hpp>
 # include <boost/preprocessor/seq/size.hpp>
+# include <boost/preprocessor/seq/detail/is_empty.hpp>
 # include <boost/preprocessor/tuple/elem.hpp>
 # include <boost/preprocessor/tuple/rem.hpp>
 #
 # /* BOOST_PP_SEQ_FOR_EACH_I */
 #
 # if ~BOOST_PP_CONFIG_FLAGS() & BOOST_PP_CONFIG_EDG()
-#    define BOOST_PP_SEQ_FOR_EACH_I(macro, data, seq) BOOST_PP_FOR((macro, data, seq (nil), 0), BOOST_PP_SEQ_FOR_EACH_I_P, BOOST_PP_SEQ_FOR_EACH_I_O, BOOST_PP_SEQ_FOR_EACH_I_M)
+#    define BOOST_PP_SEQ_FOR_EACH_I(macro, data, seq) BOOST_PP_SEQ_FOR_EACH_I_DETAIL_CHECK(macro, data, seq)
 # else
 #    define BOOST_PP_SEQ_FOR_EACH_I(macro, data, seq) BOOST_PP_SEQ_FOR_EACH_I_I(macro, data, seq)
-#    define BOOST_PP_SEQ_FOR_EACH_I_I(macro, data, seq) BOOST_PP_FOR((macro, data, seq (nil), 0), BOOST_PP_SEQ_FOR_EACH_I_P, BOOST_PP_SEQ_FOR_EACH_I_O, BOOST_PP_SEQ_FOR_EACH_I_M)
+#    define BOOST_PP_SEQ_FOR_EACH_I_I(macro, data, seq) BOOST_PP_SEQ_FOR_EACH_I_DETAIL_CHECK(macro, data, seq)
 # endif
 #
-# define BOOST_PP_SEQ_FOR_EACH_I_P(r, x) BOOST_PP_DEC(BOOST_PP_SEQ_SIZE(BOOST_PP_TUPLE_ELEM(4, 2, x)))
+#    define BOOST_PP_SEQ_FOR_EACH_I_DETAIL_CHECK_EXEC(macro, data, seq) BOOST_PP_FOR((macro, data, seq, 0, BOOST_PP_SEQ_SIZE(seq)), BOOST_PP_SEQ_FOR_EACH_I_P, BOOST_PP_SEQ_FOR_EACH_I_O, BOOST_PP_SEQ_FOR_EACH_I_M)
+#    define BOOST_PP_SEQ_FOR_EACH_I_DETAIL_CHECK_EMPTY(macro, data, seq)
+#
+#    define BOOST_PP_SEQ_FOR_EACH_I_DETAIL_CHECK(macro, data, seq) \
+		BOOST_PP_IIF \
+			( \
+			BOOST_PP_SEQ_DETAIL_IS_NOT_EMPTY(seq), \
+			BOOST_PP_SEQ_FOR_EACH_I_DETAIL_CHECK_EXEC, \
+			BOOST_PP_SEQ_FOR_EACH_I_DETAIL_CHECK_EMPTY \
+			) \
+		(macro, data, seq) \
+/**/
+#
+# define BOOST_PP_SEQ_FOR_EACH_I_P(r, x) BOOST_PP_TUPLE_ELEM(5, 4, x)
 #
 # if BOOST_PP_CONFIG_FLAGS() & BOOST_PP_CONFIG_STRICT()
 #    define BOOST_PP_SEQ_FOR_EACH_I_O(r, x) BOOST_PP_SEQ_FOR_EACH_I_O_I x
 # else
-#    define BOOST_PP_SEQ_FOR_EACH_I_O(r, x) BOOST_PP_SEQ_FOR_EACH_I_O_I(BOOST_PP_TUPLE_ELEM(4, 0, x), BOOST_PP_TUPLE_ELEM(4, 1, x), BOOST_PP_TUPLE_ELEM(4, 2, x), BOOST_PP_TUPLE_ELEM(4, 3, x))
+#    define BOOST_PP_SEQ_FOR_EACH_I_O(r, x) BOOST_PP_SEQ_FOR_EACH_I_O_I(BOOST_PP_TUPLE_ELEM(5, 0, x), BOOST_PP_TUPLE_ELEM(5, 1, x), BOOST_PP_TUPLE_ELEM(5, 2, x), BOOST_PP_TUPLE_ELEM(5, 3, x), BOOST_PP_TUPLE_ELEM(5, 4, x))
 # endif
 #
-# define BOOST_PP_SEQ_FOR_EACH_I_O_I(macro, data, seq, i) (macro, data, BOOST_PP_SEQ_TAIL(seq), BOOST_PP_INC(i))
+# define BOOST_PP_SEQ_FOR_EACH_I_O_I(macro, data, seq, i, sz) \
+	BOOST_PP_SEQ_FOR_EACH_I_O_I_DEC(macro, data, seq, i, BOOST_PP_DEC(sz)) \
+/**/
+# define BOOST_PP_SEQ_FOR_EACH_I_O_I_DEC(macro, data, seq, i, sz) \
+	( \
+	macro, \
+	data, \
+	BOOST_PP_IF \
+		( \
+		sz, \
+		BOOST_PP_SEQ_FOR_EACH_I_O_I_TAIL, \
+		BOOST_PP_SEQ_FOR_EACH_I_O_I_NIL \
+		) \
+	(seq), \
+	BOOST_PP_INC(i), \
+	sz \
+	) \
+/**/
+# define BOOST_PP_SEQ_FOR_EACH_I_O_I_TAIL(seq) BOOST_PP_SEQ_TAIL(seq)
+# define BOOST_PP_SEQ_FOR_EACH_I_O_I_NIL(seq) BOOST_PP_NIL
 #
 # if BOOST_PP_CONFIG_FLAGS() & BOOST_PP_CONFIG_STRICT()
-#    define BOOST_PP_SEQ_FOR_EACH_I_M(r, x) BOOST_PP_SEQ_FOR_EACH_I_M_IM(r, BOOST_PP_TUPLE_REM_4 x)
+#    define BOOST_PP_SEQ_FOR_EACH_I_M(r, x) BOOST_PP_SEQ_FOR_EACH_I_M_IM(r, BOOST_PP_TUPLE_REM_5 x)
 #    define BOOST_PP_SEQ_FOR_EACH_I_M_IM(r, im) BOOST_PP_SEQ_FOR_EACH_I_M_I(r, im)
 # else
-#    define BOOST_PP_SEQ_FOR_EACH_I_M(r, x) BOOST_PP_SEQ_FOR_EACH_I_M_I(r, BOOST_PP_TUPLE_ELEM(4, 0, x), BOOST_PP_TUPLE_ELEM(4, 1, x), BOOST_PP_TUPLE_ELEM(4, 2, x), BOOST_PP_TUPLE_ELEM(4, 3, x))
+#    define BOOST_PP_SEQ_FOR_EACH_I_M(r, x) BOOST_PP_SEQ_FOR_EACH_I_M_I(r, BOOST_PP_TUPLE_ELEM(5, 0, x), BOOST_PP_TUPLE_ELEM(5, 1, x), BOOST_PP_TUPLE_ELEM(5, 2, x), BOOST_PP_TUPLE_ELEM(5, 3, x), BOOST_PP_TUPLE_ELEM(5, 4, x))
 # endif
 #
-# define BOOST_PP_SEQ_FOR_EACH_I_M_I(r, macro, data, seq, i) macro(r, data, i, BOOST_PP_SEQ_HEAD(seq))
+# define BOOST_PP_SEQ_FOR_EACH_I_M_I(r, macro, data, seq, i, sz) macro(r, data, i, BOOST_PP_SEQ_HEAD(seq))
 #
 # /* BOOST_PP_SEQ_FOR_EACH_I_R */
 #
 # if ~BOOST_PP_CONFIG_FLAGS() & BOOST_PP_CONFIG_EDG()
-#    define BOOST_PP_SEQ_FOR_EACH_I_R(r, macro, data, seq) BOOST_PP_FOR_ ## r((macro, data, seq (nil), 0), BOOST_PP_SEQ_FOR_EACH_I_P, BOOST_PP_SEQ_FOR_EACH_I_O, BOOST_PP_SEQ_FOR_EACH_I_M)
+#    define BOOST_PP_SEQ_FOR_EACH_I_R(r, macro, data, seq) BOOST_PP_SEQ_FOR_EACH_I_R_DETAIL_CHECK(r, macro, data, seq)
 # else
 #    define BOOST_PP_SEQ_FOR_EACH_I_R(r, macro, data, seq) BOOST_PP_SEQ_FOR_EACH_I_R_I(r, macro, data, seq)
-#    define BOOST_PP_SEQ_FOR_EACH_I_R_I(r, macro, data, seq) BOOST_PP_FOR_ ## r((macro, data, seq (nil), 0), BOOST_PP_SEQ_FOR_EACH_I_P, BOOST_PP_SEQ_FOR_EACH_I_O, BOOST_PP_SEQ_FOR_EACH_I_M)
+#    define BOOST_PP_SEQ_FOR_EACH_I_R_I(r, macro, data, seq) BOOST_PP_SEQ_FOR_EACH_I_R_DETAIL_CHECK(r, macro, data, seq)
 # endif
 #
+#    define BOOST_PP_SEQ_FOR_EACH_I_R_DETAIL_CHECK_EXEC(r, macro, data, seq) BOOST_PP_FOR_ ## r((macro, data, seq, 0, BOOST_PP_SEQ_SIZE(seq)), BOOST_PP_SEQ_FOR_EACH_I_P, BOOST_PP_SEQ_FOR_EACH_I_O, BOOST_PP_SEQ_FOR_EACH_I_M)
+#    define BOOST_PP_SEQ_FOR_EACH_I_R_DETAIL_CHECK_EMPTY(r, macro, data, seq)
+#
+#    define BOOST_PP_SEQ_FOR_EACH_I_R_DETAIL_CHECK(r, macro, data, seq) \
+		BOOST_PP_IIF \
+			( \
+			BOOST_PP_SEQ_DETAIL_IS_NOT_EMPTY(seq), \
+			BOOST_PP_SEQ_FOR_EACH_I_R_DETAIL_CHECK_EXEC, \
+			BOOST_PP_SEQ_FOR_EACH_I_R_DETAIL_CHECK_EMPTY \
+			) \
+		(r, macro, data, seq) \
+/**/
+#
 # endif
--- a/include/boost/preprocessor/seq/replace.hpp
+++ b/include/boost/preprocessor/seq/replace.hpp
@ -12,18 +12,34 @@
 # ifndef BOOST_PREPROCESSOR_SEQ_REPLACE_HPP
 # define BOOST_PREPROCESSOR_SEQ_REPLACE_HPP
 #
+# include <boost/preprocessor/arithmetic/dec.hpp>
 # include <boost/preprocessor/arithmetic/inc.hpp>
 # include <boost/preprocessor/config/config.hpp>
+# include <boost/preprocessor/comparison/equal.hpp>
+# include <boost/preprocessor/control/iif.hpp>
 # include <boost/preprocessor/seq/first_n.hpp>
 # include <boost/preprocessor/seq/rest_n.hpp>
+# include <boost/preprocessor/seq/size.hpp>
 #
 # /* BOOST_PP_SEQ_REPLACE */
 #
 # if ~BOOST_PP_CONFIG_FLAGS() & BOOST_PP_CONFIG_EDG()
-#    define BOOST_PP_SEQ_REPLACE(seq, i, elem) BOOST_PP_SEQ_FIRST_N(i, seq) (elem) BOOST_PP_SEQ_REST_N(BOOST_PP_INC(i), seq)
+#    define BOOST_PP_SEQ_REPLACE(seq, i, elem) BOOST_PP_SEQ_FIRST_N(i, seq) (elem) BOOST_PP_SEQ_REPLACE_DETAIL_REST(seq, i)
 # else
 #    define BOOST_PP_SEQ_REPLACE(seq, i, elem) BOOST_PP_SEQ_REPLACE_I(seq, i, elem)
-#    define BOOST_PP_SEQ_REPLACE_I(seq, i, elem) BOOST_PP_SEQ_FIRST_N(i, seq) (elem) BOOST_PP_SEQ_REST_N(BOOST_PP_INC(i), seq)
+#    define BOOST_PP_SEQ_REPLACE_I(seq, i, elem) BOOST_PP_SEQ_FIRST_N(i, seq) (elem) BOOST_PP_SEQ_REPLACE_DETAIL_REST(seq, i)
 # endif
 #
+#    define BOOST_PP_SEQ_REPLACE_DETAIL_REST_EMPTY(seq, i)
+#    define BOOST_PP_SEQ_REPLACE_DETAIL_REST_VALID(seq, i) BOOST_PP_SEQ_REST_N(BOOST_PP_INC(i), seq)
+#    define BOOST_PP_SEQ_REPLACE_DETAIL_REST(seq, i) \
+		BOOST_PP_IIF \
+			( \
+			BOOST_PP_EQUAL(i,BOOST_PP_DEC(BOOST_PP_SEQ_SIZE(seq))), \
+			BOOST_PP_SEQ_REPLACE_DETAIL_REST_EMPTY, \
+			BOOST_PP_SEQ_REPLACE_DETAIL_REST_VALID \
+			) \
+		(seq, i) \
+/**/
+#
 # endif
--- a/include/boost/preprocessor/seq/rest_n.hpp
+++ b/include/boost/preprocessor/seq/rest_n.hpp
@ -13,18 +13,34 @@
 # define BOOST_PREPROCESSOR_SEQ_REST_N_HPP
 #
 # include <boost/preprocessor/arithmetic/inc.hpp>
+# include <boost/preprocessor/comparison/not_equal.hpp>
 # include <boost/preprocessor/config/config.hpp>
-# include <boost/preprocessor/facilities/empty.hpp>
+# include <boost/preprocessor/control/expr_iif.hpp>
+# include <boost/preprocessor/facilities/identity.hpp>
+# include <boost/preprocessor/logical/bitand.hpp>
+# include <boost/preprocessor/seq/detail/is_empty.hpp>
 # include <boost/preprocessor/seq/detail/split.hpp>
 # include <boost/preprocessor/tuple/elem.hpp>
 #
 # /* BOOST_PP_SEQ_REST_N */
 #
 # if ~BOOST_PP_CONFIG_FLAGS() & BOOST_PP_CONFIG_EDG()
-#    define BOOST_PP_SEQ_REST_N(n, seq) BOOST_PP_TUPLE_ELEM(2, 1, BOOST_PP_SEQ_SPLIT(BOOST_PP_INC(n), (nil) seq BOOST_PP_EMPTY))()
+#    define BOOST_PP_SEQ_REST_N(n, seq) BOOST_PP_SEQ_REST_N_DETAIL_EXEC(n, seq, BOOST_PP_SEQ_DETAIL_EMPTY_SIZE(seq))
 # else
 #    define BOOST_PP_SEQ_REST_N(n, seq) BOOST_PP_SEQ_REST_N_I(n, seq)
-#    define BOOST_PP_SEQ_REST_N_I(n, seq) BOOST_PP_TUPLE_ELEM(2, 1, BOOST_PP_SEQ_SPLIT(BOOST_PP_INC(n), (nil) seq BOOST_PP_EMPTY))()
+#    define BOOST_PP_SEQ_REST_N_I(n, seq) BOOST_PP_SEQ_REST_N_DETAIL_EXEC(n, seq, BOOST_PP_SEQ_DETAIL_EMPTY_SIZE(seq))
 # endif
 #
+#    define BOOST_PP_SEQ_REST_N_DETAIL_EXEC(n, seq, size) \
+		BOOST_PP_EXPR_IIF \
+			( \
+			BOOST_PP_BITAND \
+				( \
+				BOOST_PP_SEQ_DETAIL_IS_NOT_EMPTY_SIZE(size), \
+				BOOST_PP_NOT_EQUAL(n,size) \
+				), \
+			BOOST_PP_TUPLE_ELEM(2, 1, BOOST_PP_SEQ_SPLIT(BOOST_PP_INC(n), BOOST_PP_IDENTITY( (nil) seq )))() \
+			) \
+/**/
+#
 # endif
--- a/include/boost/preprocessor/seq/size.hpp
+++ b/include/boost/preprocessor/seq/size.hpp
@ -543,5 +543,6 @@
 # define BOOST_PP_SEQ_SIZE_BOOST_PP_SEQ_SIZE_254 254
 # define BOOST_PP_SEQ_SIZE_BOOST_PP_SEQ_SIZE_255 255
 # define BOOST_PP_SEQ_SIZE_BOOST_PP_SEQ_SIZE_256 256
+# define BOOST_PP_SEQ_SIZE_BOOST_PP_SEQ_SIZE_257 257
 #
 # endif
--- a/include/boost/preprocessor/tuple/detail/is_single_return.hpp
+++ b/include/boost/preprocessor/tuple/detail/is_single_return.hpp
@ -0,0 +1,28 @@
+# /* **************************************************************************
+#  *                                                                          *
+#  *     (C) Copyright Edward Diener 2014.                                    *
+#  *     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)                                *
+#  *                                                                          *
+#  ************************************************************************** */
+#
+# /* See http://www.boost.org for most recent version. */
+#
+# ifndef BOOST_PREPROCESSOR_TUPLE_DETAIL_IS_SINGLE_RETURN_HPP
+# define BOOST_PREPROCESSOR_TUPLE_DETAIL_IS_SINGLE_RETURN_HPP
+#
+# include <boost/preprocessor/config/config.hpp>
+#
+# /* BOOST_PP_TUPLE_IS_SINGLE_RETURN */
+#
+# if BOOST_PP_VARIADICS && BOOST_PP_VARIADICS_MSVC
+# include <boost/preprocessor/control/iif.hpp>
+# include <boost/preprocessor/facilities/is_1.hpp>
+# include <boost/preprocessor/tuple/size.hpp>
+# define BOOST_PP_TUPLE_IS_SINGLE_RETURN(sr,nsr,tuple)	\
+	BOOST_PP_IIF(BOOST_PP_IS_1(BOOST_PP_TUPLE_SIZE(tuple)),sr,nsr) \
+	/**/
+# endif /* BOOST_PP_VARIADICS && BOOST_PP_VARIADICS_MSVC */
+#
+# endif /* BOOST_PREPROCESSOR_TUPLE_DETAIL_IS_SINGLE_RETURN_HPP */
--- a/include/boost/preprocessor/tuple/elem.hpp
+++ b/include/boost/preprocessor/tuple/elem.hpp
@ -8,7 +8,7 @@
 #  */
 #
 # /* Revised by Paul Mensonides (2002-2011) */
-# /* Revised by Edward Diener (2011) */
+# /* Revised by Edward Diener (2011,2014) */
 #
 # /* See http://www.boost.org for most recent version. */
 #
@ -17,19 +17,29 @@
 #
 # include <boost/preprocessor/cat.hpp>
 # include <boost/preprocessor/config/config.hpp>
+# include <boost/preprocessor/facilities/expand.hpp>
 # include <boost/preprocessor/facilities/overload.hpp>
 # include <boost/preprocessor/tuple/rem.hpp>
 # include <boost/preprocessor/variadic/elem.hpp>
+# include <boost/preprocessor/tuple/detail/is_single_return.hpp>
 #
 # if BOOST_PP_VARIADICS
 #    if BOOST_PP_VARIADICS_MSVC
 #        define BOOST_PP_TUPLE_ELEM(...) BOOST_PP_TUPLE_ELEM_I(BOOST_PP_OVERLOAD(BOOST_PP_TUPLE_ELEM_O_, __VA_ARGS__), (__VA_ARGS__))
 #        define BOOST_PP_TUPLE_ELEM_I(m, args) BOOST_PP_TUPLE_ELEM_II(m, args)
 #        define BOOST_PP_TUPLE_ELEM_II(m, args) BOOST_PP_CAT(m ## args,)
+/*
+  Use BOOST_PP_REM_CAT if it is a single element tuple ( which might be empty )
+  else use BOOST_PP_REM. This fixes a VC++ problem with an empty tuple and BOOST_PP_TUPLE_ELEM
+  functionality. See tuple_elem_bug_test.cxx.
+*/
+#    	 define BOOST_PP_TUPLE_ELEM_O_2(n, tuple) \
+			BOOST_PP_VARIADIC_ELEM(n, BOOST_PP_EXPAND(BOOST_PP_TUPLE_IS_SINGLE_RETURN(BOOST_PP_REM_CAT,BOOST_PP_REM,tuple) tuple)) \
+			/**/
 #    else
 #        define BOOST_PP_TUPLE_ELEM(...) BOOST_PP_OVERLOAD(BOOST_PP_TUPLE_ELEM_O_, __VA_ARGS__)(__VA_ARGS__)
+#    	 define BOOST_PP_TUPLE_ELEM_O_2(n, tuple) BOOST_PP_VARIADIC_ELEM(n, BOOST_PP_REM tuple)
 #    endif
-#    define BOOST_PP_TUPLE_ELEM_O_2(n, tuple) BOOST_PP_VARIADIC_ELEM(n, BOOST_PP_REM tuple)
 #    define BOOST_PP_TUPLE_ELEM_O_3(size, n, tuple) BOOST_PP_TUPLE_ELEM_O_2(n, tuple)
 # else
 #    if BOOST_PP_CONFIG_FLAGS() & BOOST_PP_CONFIG_MSVC()
--- a/include/boost/preprocessor/tuple/rem.hpp
+++ b/include/boost/preprocessor/tuple/rem.hpp
@ -15,11 +15,17 @@
 #
 # include <boost/preprocessor/cat.hpp>
 # include <boost/preprocessor/config/config.hpp>
+# include <boost/preprocessor/facilities/expand.hpp>
 # include <boost/preprocessor/facilities/overload.hpp>
+# include <boost/preprocessor/tuple/detail/is_single_return.hpp>
 #
 # /* BOOST_PP_REM */
 #
 # if BOOST_PP_VARIADICS
+# 	 if BOOST_PP_VARIADICS_MSVC
+		/* To be used internally when __VA_ARGS__ could be empty ( or is a single element ) */
+#    	define BOOST_PP_REM_CAT(...) BOOST_PP_CAT(__VA_ARGS__,)
+# 	 endif
 #    define BOOST_PP_REM(...) __VA_ARGS__
 # else
 #    define BOOST_PP_REM(x) x
@ -30,7 +36,11 @@
 /*
  VC++8.0 cannot handle the variadic version of BOOST_PP_TUPLE_REM(size)
 */
-# if BOOST_PP_VARIADICS && !(BOOST_PP_VARIADICS_MSVC && _MSC_VER == 1400)
+# if BOOST_PP_VARIADICS && !(BOOST_PP_VARIADICS_MSVC && _MSC_VER <= 1400)
+# 	 if BOOST_PP_VARIADICS_MSVC
+		/* To be used internally when the size could be 0 ( or 1 ) */
+#    	define BOOST_PP_TUPLE_REM_CAT(size) BOOST_PP_REM_CAT
+# 	 endif
 #    define BOOST_PP_TUPLE_REM(size) BOOST_PP_REM
 # else
 #    if ~BOOST_PP_CONFIG_FLAGS() & BOOST_PP_CONFIG_MWCC()
@ -114,10 +124,11 @@
 #        define BOOST_PP_TUPLE_REM_CTOR(...) BOOST_PP_TUPLE_REM_CTOR_I(BOOST_PP_OVERLOAD(BOOST_PP_TUPLE_REM_CTOR_O_, __VA_ARGS__), (__VA_ARGS__))
 #        define BOOST_PP_TUPLE_REM_CTOR_I(m, args) BOOST_PP_TUPLE_REM_CTOR_II(m, args)
 #        define BOOST_PP_TUPLE_REM_CTOR_II(m, args) BOOST_PP_CAT(m ## args,)
+#    	 define BOOST_PP_TUPLE_REM_CTOR_O_1(tuple) BOOST_PP_EXPAND(BOOST_PP_TUPLE_IS_SINGLE_RETURN(BOOST_PP_REM_CAT,BOOST_PP_REM,tuple) tuple)
 #    else
 #        define BOOST_PP_TUPLE_REM_CTOR(...) BOOST_PP_OVERLOAD(BOOST_PP_TUPLE_REM_CTOR_O_, __VA_ARGS__)(__VA_ARGS__)
+#    	 define BOOST_PP_TUPLE_REM_CTOR_O_1(tuple) BOOST_PP_REM tuple
 #    endif
-#    define BOOST_PP_TUPLE_REM_CTOR_O_1(tuple) BOOST_PP_REM tuple
 #    define BOOST_PP_TUPLE_REM_CTOR_O_2(size, tuple) BOOST_PP_TUPLE_REM_CTOR_O_1(tuple)
 # else
 #    if ~BOOST_PP_CONFIG_FLAGS() & BOOST_PP_CONFIG_EDG()
--- a/include/boost/preprocessor/tuple/to_seq.hpp
+++ b/include/boost/preprocessor/tuple/to_seq.hpp
@ -48,6 +48,9 @@
 #    endif
 # endif
 #
+/* An empty array can be passed */
+# define BOOST_PP_TUPLE_TO_SEQ_0() ()
+#
 # define BOOST_PP_TUPLE_TO_SEQ_1(e0) (e0)
 # define BOOST_PP_TUPLE_TO_SEQ_2(e0, e1) (e0)(e1)
 # define BOOST_PP_TUPLE_TO_SEQ_3(e0, e1, e2) (e0)(e1)(e2)
--- a/include/boost/preprocessor/variadic/detail/is_single_return.hpp
+++ b/include/boost/preprocessor/variadic/detail/is_single_return.hpp
@ -0,0 +1,28 @@
+# /* **************************************************************************
+#  *                                                                          *
+#  *     (C) Copyright Edward Diener 2014.                                    *
+#  *     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)                                *
+#  *                                                                          *
+#  ************************************************************************** */
+#
+# /* See http://www.boost.org for most recent version. */
+#
+# ifndef BOOST_PREPROCESSOR_VARIADIC_DETAIL_IS_SINGLE_RETURN_HPP
+# define BOOST_PREPROCESSOR_VARIADIC_DETAIL_IS_SINGLE_RETURN_HPP
+#
+# include <boost/preprocessor/config/config.hpp>
+#
+# /* BOOST_PP_VARIADIC_IS_SINGLE_RETURN */
+#
+# if BOOST_PP_VARIADICS && BOOST_PP_VARIADICS_MSVC
+# include <boost/preprocessor/control/iif.hpp>
+# include <boost/preprocessor/facilities/is_1.hpp>
+# include <boost/preprocessor/variadic/size.hpp>
+# define BOOST_PP_VARIADIC_IS_SINGLE_RETURN(sr,nsr,...)	\
+	BOOST_PP_IIF(BOOST_PP_IS_1(BOOST_PP_VARIADIC_SIZE(__VA_ARGS__)),sr,nsr) \
+	/**/
+# endif /* BOOST_PP_VARIADICS && BOOST_PP_VARIADICS_MSVC */
+#
+# endif /* BOOST_PREPROCESSOR_VARIADIC_DETAIL_IS_SINGLE_RETURN_HPP */
--- a/meta/libraries.json
+++ b/meta/libraries.json
@ -0,0 +1,15 @@
+{
+    "key": "preprocessor",
+    "name": "Preprocessor",
+    "authors": [
+        "Vesa Karvonen",
+        "Paul Mensonides"
+    ],
+    "description": "Preprocessor metaprogramming tools including repetition and recursion.",
+    "category": [
+        "Preprocessor"
+    ],
+    "maintainers": [
+        "Paul Mensonides <pmenso57 -at- comcast.net>"
+    ]
+}
--- a/test/Jamfile.v2
+++ b/test/Jamfile.v2
@ -19,21 +19,22 @@ project preprocessor_tests : requirements <warnings>on

 test-suite preprocessor
   :   
-        [ compile arithmetic.cpp ]
-        [ compile array.cpp ]
-        [ compile comparison.cpp ]
-        [ compile control.cpp ]
-        [ compile debug.cpp ]
-        [ compile facilities.cpp ]
-        [ compile iteration.cpp ]
-        [ compile list.cpp ]
-        [ compile logical.cpp ]
-        [ compile repetition.cpp ]
-        [ compile selection.cpp ]
-        [ compile seq.cpp ]
-        [ compile slot.cpp ]
-        [ compile tuple.cpp ]
-        [ compile variadic.cpp ]
+        [ compile arithmetic.cpp : <toolset>gcc:<cxxflags>-std=c++0x <toolset>clang:<cxxflags>-std=c++0x ]
+        [ compile array.cpp : <toolset>gcc:<cxxflags>-std=c++0x <toolset>clang:<cxxflags>-std=c++0x ]
+        [ compile comparison.cpp : <toolset>gcc:<cxxflags>-std=c++0x <toolset>clang:<cxxflags>-std=c++0x ]
+        [ compile control.cpp : <toolset>gcc:<cxxflags>-std=c++0x <toolset>clang:<cxxflags>-std=c++0x ]
+        [ compile debug.cpp : <toolset>gcc:<cxxflags>-std=c++0x <toolset>clang:<cxxflags>-std=c++0x ]
+        [ compile facilities.cpp : <toolset>gcc:<cxxflags>-std=c++0x <toolset>clang:<cxxflags>-std=c++0x ]
+        [ compile iteration.cpp : <toolset>gcc:<cxxflags>-std=c++0x <toolset>clang:<cxxflags>-std=c++0x ]
+        [ compile list.cpp : <toolset>gcc:<cxxflags>-std=c++0x <toolset>clang:<cxxflags>-std=c++0x ]
+        [ compile logical.cpp : <toolset>gcc:<cxxflags>-std=c++0x <toolset>clang:<cxxflags>-std=c++0x ]
+        [ compile punctuation.cpp : <toolset>gcc:<cxxflags>-std=c++0x <toolset>clang:<cxxflags>-std=c++0x ]
+        [ compile repetition.cpp : <toolset>gcc:<cxxflags>-std=c++0x <toolset>clang:<cxxflags>-std=c++0x ]
+        [ compile selection.cpp : <toolset>gcc:<cxxflags>-std=c++0x <toolset>clang:<cxxflags>-std=c++0x ]
+        [ compile seq.cpp : <toolset>gcc:<cxxflags>-std=c++0x <toolset>clang:<cxxflags>-std=c++0x ]
+        [ compile slot.cpp : <toolset>gcc:<cxxflags>-std=c++0x <toolset>clang:<cxxflags>-std=c++0x ]
+        [ compile tuple.cpp : <toolset>gcc:<cxxflags>-std=c++0x <toolset>clang:<cxxflags>-std=c++0x ]
+        [ compile variadic.cpp : <toolset>gcc:<cxxflags>-std=c++0x <toolset>clang:<cxxflags>-std=c++0x ]
  ;

 test-suite preprocessor_nvm
@ -57,55 +58,59 @@ test-suite preprocessor_nvm
 test-suite preprocessor_c
   :   
        [ compile arithmetic.c 
-          : <toolset>gcc:<cflags>-std=c99
+          : <toolset>gcc:<cflags>-std=c99 <toolset>clang:<cflags>-std=c99
          : arithmetic_c 
        ]
        [ compile array.c 
-          : <toolset>gcc:<cflags>-std=c99
+          : <toolset>gcc:<cflags>-std=c99 <toolset>clang:<cflags>-std=c99
          : array_c 
        ]
        [ compile comparison.c 
-          : <toolset>gcc:<cflags>-std=c99
+          : <toolset>gcc:<cflags>-std=c99 <toolset>clang:<cflags>-std=c99
          : comparison_c 
        ]
        [ compile control.c 
-          : <toolset>gcc:<cflags>-std=c99
+          : <toolset>gcc:<cflags>-std=c99 <toolset>clang:<cflags>-std=c99
          : control_c 
        ]
        [ compile debug.c 
-          : <toolset>gcc:<cflags>-std=c99
+          : <toolset>gcc:<cflags>-std=c99 <toolset>clang:<cflags>-std=c99
          : debug_c 
        ]
        [ compile facilities.c 
-          : <toolset>gcc:<cflags>-std=c99
+          : <toolset>gcc:<cflags>-std=c99 <toolset>clang:<cflags>-std=c99
          : facilities_c 
        ]
        [ compile list.c 
-          : <toolset>gcc:<cflags>-std=c99
+          : <toolset>gcc:<cflags>-std=c99 <toolset>clang:<cflags>-std=c99
          : list_c 
        ]
        [ compile logical.c 
-          : <toolset>gcc:<cflags>-std=c99
+          : <toolset>gcc:<cflags>-std=c99 <toolset>clang:<cflags>-std=c99
          : logical_c 
        ]
+        [ compile punctuation.c 
+          : <toolset>gcc:<cflags>-std=c99 <toolset>clang:<cflags>-std=c99
+          : punctuation_c 
+        ]
        [ compile selection.c 
-          : <toolset>gcc:<cflags>-std=c99
+          : <toolset>gcc:<cflags>-std=c99 <toolset>clang:<cflags>-std=c99
          : selection_c 
        ]
        [ compile seq.c 
-          : <toolset>gcc:<cflags>-std=c99
+          : <toolset>gcc:<cflags>-std=c99 <toolset>clang:<cflags>-std=c99
          : seq_c 
        ]
        [ compile slot.c 
-          : <toolset>gcc:<cflags>-std=c99
+          : <toolset>gcc:<cflags>-std=c99 <toolset>clang:<cflags>-std=c99
          : slot_c 
        ]
        [ compile tuple.c 
-          : <toolset>gcc:<cflags>-std=c99
+          : <toolset>gcc:<cflags>-std=c99 <toolset>clang:<cflags>-std=c99
          : tuple_c 
        ]
        [ compile variadic.c 
-          : <toolset>gcc:<cflags>-std=c99
+          : <toolset>gcc:<cflags>-std=c99 <toolset>clang:<cflags>-std=c99
          : variadic_c 
        ]
  ;
@ -114,62 +119,99 @@ test-suite preprocessor_c_nvm
   :   
        [ compile arithmetic.c 
          : <define>BOOST_PP_VARIADICS=0
-            <toolset>gcc:<cflags>-std=c99
+            <toolset>gcc:<cflags>-std=c99 <toolset>clang:<cflags>-std=c99
          : arithmetic_c_nvm 
        ]
        [ compile array.c 
          : <define>BOOST_PP_VARIADICS=0
-            <toolset>gcc:<cflags>-std=c99
+            <toolset>gcc:<cflags>-std=c99 <toolset>clang:<cflags>-std=c99
          : array_c_nvm 
        ]
        [ compile comparison.c 
          : <define>BOOST_PP_VARIADICS=0
-            <toolset>gcc:<cflags>-std=c99
+            <toolset>gcc:<cflags>-std=c99 <toolset>clang:<cflags>-std=c99
          : comparison_c_nvm 
        ]
        [ compile control.c 
          : <define>BOOST_PP_VARIADICS=0
-            <toolset>gcc:<cflags>-std=c99
+            <toolset>gcc:<cflags>-std=c99 <toolset>clang:<cflags>-std=c99
          : control_c_nvm 
        ]
        [ compile debug.c 
          : <define>BOOST_PP_VARIADICS=0
-            <toolset>gcc:<cflags>-std=c99
+            <toolset>gcc:<cflags>-std=c99 <toolset>clang:<cflags>-std=c99
          : debug_c_nvm 
        ]
        [ compile facilities.c 
          : <define>BOOST_PP_VARIADICS=0
-            <toolset>gcc:<cflags>-std=c99
+            <toolset>gcc:<cflags>-std=c99 <toolset>clang:<cflags>-std=c99
          : facilities_c_nvm 
        ]
        [ compile list.c 
          : <define>BOOST_PP_VARIADICS=0
-            <toolset>gcc:<cflags>-std=c99
+            <toolset>gcc:<cflags>-std=c99 <toolset>clang:<cflags>-std=c99
          : list_c_nvm 
        ]
        [ compile logical.c 
          : <define>BOOST_PP_VARIADICS=0
-            <toolset>gcc:<cflags>-std=c99
+            <toolset>gcc:<cflags>-std=c99 <toolset>clang:<cflags>-std=c99
          : logical_c_nvm 
        ]
        [ compile selection.c 
          : <define>BOOST_PP_VARIADICS=0
-            <toolset>gcc:<cflags>-std=c99
+            <toolset>gcc:<cflags>-std=c99 <toolset>clang:<cflags>-std=c99
          : selection_c_nvm 
        ]
        [ compile seq.c 
          : <define>BOOST_PP_VARIADICS=0
-            <toolset>gcc:<cflags>-std=c99
+            <toolset>gcc:<cflags>-std=c99 <toolset>clang:<cflags>-std=c99
          : seq_c_nvm 
        ]
        [ compile slot.c 
          : <define>BOOST_PP_VARIADICS=0
-            <toolset>gcc:<cflags>-std=c99
+            <toolset>gcc:<cflags>-std=c99 <toolset>clang:<cflags>-std=c99
          : slot_c_nvm 
        ]
        [ compile tuple.c 
          : <define>BOOST_PP_VARIADICS=0
-            <toolset>gcc:<cflags>-std=c99
+            <toolset>gcc:<cflags>-std=c99 <toolset>clang:<cflags>-std=c99
          : tuple_c_nvm 
        ]
  ;
+  
+test-suite preprocessor_isempty
+  :   
+       [ compile isempty.cpp : <toolset>gcc:<cxxflags>-std=c++0x <toolset>clang:<cxxflags>-std=c++0x ]
+       [ compile-fail isempty_variadic_standard_failure.cpp : <toolset>gcc:<cxxflags>-std=c++0x <toolset>clang:<cxxflags>-std=c++0x ]
+       [ compile-fail isempty_variadic_standard_failure2.cpp : <toolset>gcc:<cxxflags>-std=c++0x <toolset>clang:<cxxflags>-std=c++0x ]
+ ; 
+  
+test-suite preprocessor_isempty_nvm
+   :   
+        [ compile isempty.cpp : <define>BOOST_PP_VARIADICS=0 : isempty_nvm ]
+  ;
+  
+test-suite preprocessor_isempty_c
+  :   
+       [ compile isempty.c 
+         : <toolset>gcc:<cflags>-std=c99 <toolset>clang:<cflags>-std=c99
+         : isempty_c 
+       ]
+       [ compile-fail isempty_variadic_standard_failure.c 
+         : <toolset>gcc:<cflags>-std=c99 <toolset>clang:<cflags>-std=c99
+         : isempty_variadic_standard_failure_c 
+       ]
+       [ compile-fail isempty_variadic_standard_failure2.c 
+         : <toolset>gcc:<cflags>-std=c99 <toolset>clang:<cflags>-std=c99
+         : isempty_variadic_standard_failure2_c 
+       ]
+ ;
+  
+test-suite preprocessor_isempty_c_nvm
+   :   
+        [ compile isempty.c 
+          : <define>BOOST_PP_VARIADICS=0
+            <toolset>gcc:<cflags>-std=c99 <toolset>clang:<cflags>-std=c99
+          : isempty_c_nvm 
+        ]
+  ;
--- a/test/array.cxx
+++ b/test/array.cxx
@ -13,20 +13,27 @@
 #
 # include <boost/preprocessor/array.hpp>
 # include <libs/preprocessor/test/test.h>
+# include <boost/preprocessor/facilities/is_empty.hpp>
 # include <boost/preprocessor/list/at.hpp>
+# include <boost/preprocessor/list/size.hpp>
 # include <boost/preprocessor/seq/elem.hpp>
+# include <boost/preprocessor/seq/size.hpp>
 # include <boost/preprocessor/tuple/elem.hpp>
+# include <boost/preprocessor/tuple/size.hpp>
 # if BOOST_PP_VARIADICS
 # include <boost/preprocessor/variadic/size.hpp>
 # include <boost/preprocessor/variadic/elem.hpp>
 # endif

+# define ARRAY_EMPTY (0, ())
+# define ARRAY_ONE (1, ())
 # define ARRAY (3, (0, 1, 2))
 # define ARRAY_LARGE (33, (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))
 # define ARRAY_VERY_LARGE (64, (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))

 // element access

+BEGIN BOOST_PP_IS_EMPTY(BOOST_PP_ARRAY_ELEM(0, ARRAY_ONE)) == 1 END
 BEGIN BOOST_PP_ARRAY_ELEM(1, ARRAY) == 1 END
 BEGIN BOOST_PP_ARRAY_ELEM(2, (5, (0, 1, 2, 3, 4))) == 2 END
 BEGIN BOOST_PP_ARRAY_ELEM(28, ARRAY_LARGE) == 28 END
@ -42,6 +49,8 @@ BEGIN BOOST_PP_ARRAY_SIZE(ARRAY_LARGE) == 33 END
 BEGIN BOOST_PP_ARRAY_SIZE((33, (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 END
 BEGIN BOOST_PP_ARRAY_SIZE(ARRAY_VERY_LARGE) == 64 END
 BEGIN BOOST_PP_ARRAY_SIZE((64, (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 END
+BEGIN BOOST_PP_ARRAY_SIZE(ARRAY_EMPTY) == 0 END
+BEGIN BOOST_PP_ARRAY_SIZE(ARRAY_ONE) == 1 END

 // enum

@ -57,6 +66,7 @@ BEGIN BOOST_PP_VARIADIC_SIZE(BOOST_PP_ARRAY_ENUM((5, (0, 1, 2, 3, 4)))) == 5 END
 BEGIN BOOST_PP_VARIADIC_SIZE(BOOST_PP_ARRAY_ENUM(ARRAY_LARGE)) == 33 END
 BEGIN BOOST_PP_VARIADIC_SIZE(BOOST_PP_ARRAY_ENUM(ARRAY_VERY_LARGE)) == 64 END
 BEGIN BOOST_PP_VARIADIC_SIZE(BOOST_PP_ARRAY_ENUM((64, (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 END
+BEGIN BOOST_PP_VARIADIC_SIZE(BOOST_PP_ARRAY_ENUM(ARRAY_ONE)) == 1 END

 # endif

@ -66,9 +76,12 @@ BEGIN BOOST_PP_LIST_AT(BOOST_PP_ARRAY_TO_LIST(ARRAY), 1) == 1 END
 BEGIN BOOST_PP_LIST_AT(BOOST_PP_ARRAY_TO_LIST((5, (0, 1, 2, 3, 4))), 4) == 4 END
 BEGIN BOOST_PP_LIST_AT(BOOST_PP_ARRAY_TO_LIST((33, (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))), 26) == 26 END
 BEGIN BOOST_PP_LIST_AT(BOOST_PP_ARRAY_TO_LIST(ARRAY_VERY_LARGE), 60) == 60 END
+BEGIN BOOST_PP_LIST_SIZE(BOOST_PP_ARRAY_TO_LIST(ARRAY_EMPTY)) == 0 END
+BEGIN BOOST_PP_LIST_SIZE(BOOST_PP_ARRAY_TO_LIST(ARRAY_ONE)) == 1 END

 // to_seq

+BEGIN BOOST_PP_IS_EMPTY(BOOST_PP_SEQ_ELEM(0, BOOST_PP_ARRAY_TO_SEQ(ARRAY_ONE))) == 1 END
 BEGIN BOOST_PP_SEQ_ELEM(0, BOOST_PP_ARRAY_TO_SEQ(ARRAY)) == 0 END
 BEGIN BOOST_PP_SEQ_ELEM(3, BOOST_PP_ARRAY_TO_SEQ((5, (0, 1, 2, 3, 4)))) == 3 END
 BEGIN BOOST_PP_SEQ_ELEM(17, BOOST_PP_ARRAY_TO_SEQ(ARRAY_LARGE)) == 17 END
@ -78,6 +91,7 @@ BEGIN BOOST_PP_SEQ_ELEM(42, BOOST_PP_ARRAY_TO_SEQ((64, (0, 1, 2, 3, 4, 5, 6, 7,

 # if BOOST_PP_VARIADICS

+BEGIN BOOST_PP_IS_EMPTY(BOOST_PP_TUPLE_ELEM(0, BOOST_PP_ARRAY_TO_TUPLE(ARRAY_ONE))) == 1 END
 BEGIN BOOST_PP_TUPLE_ELEM(2, BOOST_PP_ARRAY_TO_TUPLE(ARRAY)) == 2 END
 BEGIN BOOST_PP_TUPLE_ELEM(1, BOOST_PP_ARRAY_TO_TUPLE((5, (0, 1, 2, 3, 4)))) == 1 END
 BEGIN BOOST_PP_TUPLE_ELEM(26, BOOST_PP_ARRAY_TO_TUPLE(ARRAY_LARGE)) == 26 END
@ -85,6 +99,7 @@ BEGIN BOOST_PP_TUPLE_ELEM(37, BOOST_PP_ARRAY_TO_TUPLE((64, (0, 1, 2, 3, 4, 5, 6,

 # else

+BEGIN BOOST_PP_IS_EMPTY(BOOST_PP_TUPLE_ELEM(1, 0, BOOST_PP_ARRAY_TO_TUPLE(ARRAY_ONE))) == 1 END
 BEGIN BOOST_PP_TUPLE_ELEM(3, 2, BOOST_PP_ARRAY_TO_TUPLE(ARRAY)) == 2 END
 BEGIN BOOST_PP_TUPLE_ELEM(5, 1, BOOST_PP_ARRAY_TO_TUPLE((5, (0, 1, 2, 3, 4)))) == 1 END
 BEGIN BOOST_PP_TUPLE_ELEM(33, 26, BOOST_PP_ARRAY_TO_TUPLE(ARRAY_LARGE)) == 26 END
@ -94,6 +109,7 @@ BEGIN BOOST_PP_TUPLE_ELEM(64, 37, BOOST_PP_ARRAY_TO_TUPLE((64, (0, 1, 2, 3, 4, 5

 // insert

+BEGIN BOOST_PP_ARRAY_ELEM(0, BOOST_PP_ARRAY_INSERT(ARRAY_ONE,0,63)) == 63 END
 BEGIN BOOST_PP_ARRAY_ELEM(0, BOOST_PP_ARRAY_INSERT(ARRAY,2,40)) == 0 END
 BEGIN BOOST_PP_ARRAY_ELEM(1, BOOST_PP_ARRAY_INSERT(ARRAY,1,40)) == 40 END
 BEGIN BOOST_PP_ARRAY_ELEM(2, BOOST_PP_ARRAY_INSERT(ARRAY,1,40)) == 1 END
@ -104,6 +120,9 @@ BEGIN BOOST_PP_ARRAY_ELEM(22, BOOST_PP_ARRAY_INSERT(ARRAY_LARGE,22,1000)) == 100
 BEGIN BOOST_PP_ARRAY_ELEM(26, BOOST_PP_ARRAY_INSERT(ARRAY_LARGE,22,1000)) == 25 END
 BEGIN BOOST_PP_ARRAY_SIZE(BOOST_PP_ARRAY_INSERT(ARRAY_LARGE,22,1000)) == 34 END

+BEGIN BOOST_PP_ARRAY_ELEM(0, BOOST_PP_ARRAY_INSERT(ARRAY_EMPTY,0,25)) == 25 END
+BEGIN BOOST_PP_ARRAY_SIZE(BOOST_PP_ARRAY_INSERT(ARRAY_EMPTY,0,1000)) == 1 END
+
 // pop_back

 BEGIN BOOST_PP_ARRAY_SIZE(BOOST_PP_ARRAY_POP_BACK(ARRAY)) == 2 END
@ -124,18 +143,27 @@ BEGIN BOOST_PP_ARRAY_ELEM(55, BOOST_PP_ARRAY_POP_FRONT(ARRAY_VERY_LARGE)) == 56

 BEGIN BOOST_PP_ARRAY_SIZE(BOOST_PP_ARRAY_PUSH_BACK(ARRAY, 3)) == 4 END
 BEGIN BOOST_PP_ARRAY_SIZE(BOOST_PP_ARRAY_PUSH_BACK(ARRAY_LARGE, 33)) == 34 END
+BEGIN BOOST_PP_ARRAY_SIZE(BOOST_PP_ARRAY_PUSH_BACK(ARRAY_EMPTY, 10)) == 1 END
+BEGIN BOOST_PP_ARRAY_SIZE(BOOST_PP_ARRAY_PUSH_BACK(ARRAY_ONE, 44)) == 2 END
 BEGIN BOOST_PP_ARRAY_ELEM(0, BOOST_PP_ARRAY_PUSH_BACK(ARRAY, 3)) == 0 END
 BEGIN BOOST_PP_ARRAY_ELEM(33, BOOST_PP_ARRAY_PUSH_BACK(ARRAY_LARGE, 33)) == 33 END
+BEGIN BOOST_PP_ARRAY_ELEM(0, BOOST_PP_ARRAY_PUSH_BACK(ARRAY_EMPTY, 136)) == 136 END
+BEGIN BOOST_PP_ARRAY_ELEM(1, BOOST_PP_ARRAY_PUSH_BACK(ARRAY_ONE, 245)) == 245 END

 // push_front

 BEGIN BOOST_PP_ARRAY_SIZE(BOOST_PP_ARRAY_PUSH_FRONT(ARRAY, 555)) == 4 END
 BEGIN BOOST_PP_ARRAY_SIZE(BOOST_PP_ARRAY_PUSH_FRONT(ARRAY_LARGE, 666)) == 34 END
+BEGIN BOOST_PP_ARRAY_SIZE(BOOST_PP_ARRAY_PUSH_FRONT(ARRAY_EMPTY, 10)) == 1 END
+BEGIN BOOST_PP_ARRAY_SIZE(BOOST_PP_ARRAY_PUSH_FRONT(ARRAY_ONE, 131)) == 2 END
 BEGIN BOOST_PP_ARRAY_ELEM(0, BOOST_PP_ARRAY_PUSH_FRONT(ARRAY, 555)) == 555 END
 BEGIN BOOST_PP_ARRAY_ELEM(33, BOOST_PP_ARRAY_PUSH_FRONT(ARRAY_LARGE, 33)) == 32 END
+BEGIN BOOST_PP_ARRAY_ELEM(0, BOOST_PP_ARRAY_PUSH_FRONT(ARRAY_EMPTY, 136)) == 136 END
+BEGIN BOOST_PP_ARRAY_ELEM(0, BOOST_PP_ARRAY_PUSH_FRONT(ARRAY_ONE, 56)) == 56 END

 // remove

+BEGIN BOOST_PP_ARRAY_SIZE(BOOST_PP_ARRAY_REMOVE(ARRAY_ONE, 0)) == 0 END
 BEGIN BOOST_PP_ARRAY_SIZE(BOOST_PP_ARRAY_REMOVE(ARRAY, 1)) == 2 END
 BEGIN BOOST_PP_ARRAY_SIZE(BOOST_PP_ARRAY_REMOVE(ARRAY_LARGE, 17)) == 32 END
 BEGIN BOOST_PP_ARRAY_SIZE(BOOST_PP_ARRAY_REMOVE(ARRAY_VERY_LARGE, 27)) == 63 END
@ -145,7 +173,9 @@ BEGIN BOOST_PP_ARRAY_ELEM(62, BOOST_PP_ARRAY_REMOVE(ARRAY_VERY_LARGE, 48)) == 63

 // replace

+BEGIN BOOST_PP_ARRAY_SIZE(BOOST_PP_ARRAY_REPLACE(ARRAY_ONE, 0, 3)) == 1 END
 BEGIN BOOST_PP_ARRAY_SIZE(BOOST_PP_ARRAY_REPLACE(ARRAY_VERY_LARGE, 27, 1000)) == 64 END
+BEGIN BOOST_PP_ARRAY_ELEM(0, BOOST_PP_ARRAY_REPLACE(ARRAY_ONE, 0, 68)) == 68 END
 BEGIN BOOST_PP_ARRAY_ELEM(0, BOOST_PP_ARRAY_REPLACE(ARRAY, 1, 44)) == 0 END
 BEGIN BOOST_PP_ARRAY_ELEM(29, BOOST_PP_ARRAY_REPLACE(ARRAY_LARGE, 29, 999)) == 999 END
 BEGIN BOOST_PP_ARRAY_ELEM(38, BOOST_PP_ARRAY_REPLACE(ARRAY_VERY_LARGE, 37, 1)) == 38 END
@ -154,6 +184,9 @@ BEGIN BOOST_PP_ARRAY_ELEM(28, BOOST_PP_ARRAY_REPLACE(ARRAY_VERY_LARGE, 28, 1)) =
 // reverse

 BEGIN BOOST_PP_ARRAY_SIZE(BOOST_PP_ARRAY_REVERSE(ARRAY_VERY_LARGE)) == 64 END
+BEGIN BOOST_PP_IS_EMPTY(BOOST_PP_ARRAY_ELEM(0, BOOST_PP_ARRAY_REVERSE(ARRAY_ONE))) == 1 END
 BEGIN BOOST_PP_ARRAY_ELEM(0, BOOST_PP_ARRAY_REVERSE(ARRAY)) == 2 END
 BEGIN BOOST_PP_ARRAY_ELEM(29, BOOST_PP_ARRAY_REVERSE(ARRAY_LARGE)) == 3 END
 BEGIN BOOST_PP_ARRAY_ELEM(38, BOOST_PP_ARRAY_REVERSE(ARRAY_VERY_LARGE)) == 25 END
+BEGIN BOOST_PP_ARRAY_SIZE(BOOST_PP_ARRAY_REVERSE(ARRAY_EMPTY)) == 0 END
+BEGIN BOOST_PP_ARRAY_SIZE(BOOST_PP_ARRAY_REVERSE(ARRAY_ONE)) == 1 END
--- a/test/facilities.cxx
+++ b/test/facilities.cxx
@ -36,7 +36,7 @@ BEGIN BOOST_PP_CAT(BOOST_PP_INTERCEPT, 2) 1 == 1 END
 #define OVMAC_3(x,y,z) BOOST_PP_ADD(BOOST_PP_MUL(x,y),z)
 #define OVMAC_4(x,y,z,a) BOOST_PP_ADD(BOOST_PP_MUL(x,y),BOOST_PP_MUL(a,z))

-#if defined(BOOST_PP_VARIADICS_MSVC)
+#if BOOST_PP_VARIADICS_MSVC

 #define OVTEST(...) BOOST_PP_CAT(BOOST_PP_OVERLOAD(OVMAC_,__VA_ARGS__)(__VA_ARGS__),BOOST_PP_EMPTY())

--- a/test/isempty.c
+++ b/test/isempty.c
@ -0,0 +1,12 @@
+# /* **************************************************************************
+#  *                                                                          *
+#  *     (C) Copyright Edward Diener 2014.
+#  *     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)
+#  *                                                                          *
+#  ************************************************************************** */
+#
+# /* See http://www.boost.org for most recent version. */
+#
+# include <libs/preprocessor/test/isempty.cxx>
--- a/test/isempty.cpp
+++ b/test/isempty.cpp
@ -0,0 +1,12 @@
+# /* **************************************************************************
+#  *                                                                          *
+#  *     (C) Copyright Edward Diener 2014.
+#  *     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)
+#  *                                                                          *
+#  ************************************************************************** */
+#
+# /* See http://www.boost.org for most recent version. */
+#
+# include <libs/preprocessor/test/isempty.cxx>
--- a/test/isempty.cxx
+++ b/test/isempty.cxx
@ -0,0 +1,145 @@
+# /* **************************************************************************
+#  *                                                                          *
+#  *     (C) Copyright Edward Diener 2014.
+#  *     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)
+#  *                                                                          *
+#  ************************************************************************** */
+#
+# /* See http://www.boost.org for most recent version. */
+#
+# include <boost/preprocessor/config/config.hpp>
+#
+#if (BOOST_PP_CONFIG_FLAGS() & BOOST_PP_CONFIG_STRICT()) || (BOOST_PP_CONFIG_FLAGS() & BOOST_PP_CONFIG_MSVC())
+
+# include <boost/preprocessor/facilities/empty.hpp>
+# include <boost/preprocessor/facilities/is_empty.hpp>
+# include <libs/preprocessor/test/test.h>
+
+#define DATA
+#define OBJECT OBJECT2
+#define OBJECT2
+#define FUNC(x) FUNC2(x)
+#define FUNC2(x)
+#define FUNC_GEN() ()
+#define FUNC_GEN2(x) ()
+#define FUNC_GEN3() (&)
+#define FUNC_GEN4(x) (y)
+#define FUNC_GEN5() (y,z)
+#define FUNC_GEN6() anything
+#define FUNC_GEN7(x) anything
+#define FUNC_GEN8(x,y) (1,2,3)
+#define FUNC_GEN9(x,y,z) anything
+#define FUNC_GEN10(x) (y) data
+#define NAME &name
+#define ATUPLE (atuple)
+#define ATUPLE_PLUS (atuple) data
+
+#if BOOST_PP_VARIADICS
+
+#if BOOST_PP_VARIADICS_MSVC /* Testing the VC++ variadic version */
+
+/* INCORRECT */
+
+BEGIN BOOST_PP_IS_EMPTY(FUNC_GEN) == 1 END
+BEGIN BOOST_PP_IS_EMPTY(FUNC_GEN2) == 1 END
+BEGIN BOOST_PP_IS_EMPTY(FUNC_GEN3) == 1 END
+BEGIN BOOST_PP_IS_EMPTY(FUNC_GEN4) == 1 END
+BEGIN BOOST_PP_IS_EMPTY(FUNC_GEN5) == 1 END
+BEGIN BOOST_PP_IS_EMPTY(FUNC_GEN8) == 1 END
+BEGIN BOOST_PP_IS_EMPTY(FUNC_GEN10) == 1 END
+
+/* CORRECT */
+
+BEGIN BOOST_PP_IS_EMPTY(FUNC_GEN9) == 0 END
+
+#else /* Testing the non-VC++ variadic version */
+
+/* CORRECT */
+
+BEGIN BOOST_PP_IS_EMPTY(FUNC_GEN) == 0 END
+BEGIN BOOST_PP_IS_EMPTY(FUNC_GEN2) == 0 END
+BEGIN BOOST_PP_IS_EMPTY(FUNC_GEN3) == 0 END
+BEGIN BOOST_PP_IS_EMPTY(FUNC_GEN4) == 0 END
+BEGIN BOOST_PP_IS_EMPTY(FUNC_GEN5) == 0 END
+BEGIN BOOST_PP_IS_EMPTY(FUNC_GEN10) == 0 END
+
+/* COMPILER ERROR */
+
+// BEGIN BOOST_PP_IS_EMPTY(FUNC_GEN8) == 0 END
+// BEGIN BOOST_PP_IS_EMPTY(FUNC_GEN9) == 0 END
+
+#endif
+
+/* Testing the variadic version */
+
+/* CORRECT */
+
+BEGIN BOOST_PP_IS_EMPTY(BOOST_PP_EMPTY()) == 1 END
+BEGIN BOOST_PP_IS_EMPTY(DATA BOOST_PP_EMPTY()) == 1 END
+BEGIN BOOST_PP_IS_EMPTY(x BOOST_PP_EMPTY()) == 0 END
+BEGIN BOOST_PP_IS_EMPTY(OBJECT BOOST_PP_EMPTY()) == 1 END
+BEGIN BOOST_PP_IS_EMPTY(FUNC(z) BOOST_PP_EMPTY()) == 1 END
+BEGIN BOOST_PP_IS_EMPTY(FUNC_GEN6) == 0 END
+BEGIN BOOST_PP_IS_EMPTY(FUNC_GEN7) == 0 END
+BEGIN BOOST_PP_IS_EMPTY(NAME) == 0 END
+BEGIN BOOST_PP_IS_EMPTY(ATUPLE) == 0 END
+BEGIN BOOST_PP_IS_EMPTY(ATUPLE_PLUS) == 0 END
+
+#else
+
+#if BOOST_PP_CONFIG_FLAGS() & BOOST_PP_CONFIG_MSVC() /* Testing the VC++ non-variadic version */
+
+/* INCORRECT */
+
+BEGIN BOOST_PP_IS_EMPTY(FUNC_GEN) == 1 END
+BEGIN BOOST_PP_IS_EMPTY(FUNC_GEN2) == 1 END
+BEGIN BOOST_PP_IS_EMPTY(FUNC_GEN3) == 1 END
+BEGIN BOOST_PP_IS_EMPTY(FUNC_GEN4) == 1 END
+BEGIN BOOST_PP_IS_EMPTY(FUNC_GEN5) == 1 END
+BEGIN BOOST_PP_IS_EMPTY(FUNC_GEN8) == 1 END
+BEGIN BOOST_PP_IS_EMPTY(ATUPLE) == 1 END
+BEGIN BOOST_PP_IS_EMPTY(FUNC_GEN10) == 1 END
+BEGIN BOOST_PP_IS_EMPTY(ATUPLE_PLUS) == 1 END
+
+/* CORRECT */
+
+BEGIN BOOST_PP_IS_EMPTY(NAME) == 0 END
+
+#else /* Testing the non-VC++ non-variadic version */
+
+/* CORRECT */
+
+BEGIN BOOST_PP_IS_EMPTY(FUNC_GEN) == 0 END
+BEGIN BOOST_PP_IS_EMPTY(FUNC_GEN2) == 0 END
+BEGIN BOOST_PP_IS_EMPTY(FUNC_GEN3) == 0 END
+BEGIN BOOST_PP_IS_EMPTY(FUNC_GEN4) == 0 END
+BEGIN BOOST_PP_IS_EMPTY(FUNC_GEN5) == 0 END
+BEGIN BOOST_PP_IS_EMPTY(FUNC_GEN8) == 0 END
+BEGIN BOOST_PP_IS_EMPTY(FUNC_GEN10) == 0 END
+
+/* UNDEFINED BEHAVIOR */
+
+// BEGIN BOOST_PP_IS_EMPTY(ATUPLE) == 0 END
+// BEGIN BOOST_PP_IS_EMPTY(ATUPLE_PLUS) == 1 END
+// BEGIN BOOST_PP_IS_EMPTY(NAME) == 0 END
+
+#endif
+
+/* Testing the non-variadic version */
+
+/* CORRECT */
+
+BEGIN BOOST_PP_IS_EMPTY(BOOST_PP_EMPTY()) == 1 END
+BEGIN BOOST_PP_IS_EMPTY(DATA BOOST_PP_EMPTY()) == 1 END
+BEGIN BOOST_PP_IS_EMPTY(x BOOST_PP_EMPTY()) == 0 END
+BEGIN BOOST_PP_IS_EMPTY(OBJECT BOOST_PP_EMPTY()) == 1 END
+BEGIN BOOST_PP_IS_EMPTY(FUNC(z) BOOST_PP_EMPTY()) == 1 END
+BEGIN BOOST_PP_IS_EMPTY(FUNC_GEN6) == 0 END
+BEGIN BOOST_PP_IS_EMPTY(FUNC_GEN7) == 0 END
+BEGIN BOOST_PP_IS_EMPTY(FUNC_GEN9) == 0 END
+
+#endif
+
+#endif
--- a/test/isempty_variadic_standard_failure.c
+++ b/test/isempty_variadic_standard_failure.c
@ -0,0 +1,12 @@
+# /* **************************************************************************
+#  *                                                                          *
+#  *     (C) Copyright Edward Diener 2014.
+#  *     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)
+#  *                                                                          *
+#  ************************************************************************** */
+#
+# /* See http://www.boost.org for most recent version. */
+#
+# include <libs/preprocessor/test/isempty_variadic_standard_failure.cxx>
--- a/test/isempty_variadic_standard_failure.cpp
+++ b/test/isempty_variadic_standard_failure.cpp
@ -0,0 +1,12 @@
+# /* **************************************************************************
+#  *                                                                          *
+#  *     (C) Copyright Edward Diener 2014.
+#  *     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)
+#  *                                                                          *
+#  ************************************************************************** */
+#
+# /* See http://www.boost.org for most recent version. */
+#
+# include <libs/preprocessor/test/isempty_variadic_standard_failure.cxx>
--- a/test/isempty_variadic_standard_failure.cxx
+++ b/test/isempty_variadic_standard_failure.cxx
@ -0,0 +1,25 @@
+# /* **************************************************************************
+#  *                                                                          *
+#  *     (C) Copyright Edward Diener 2014.
+#  *     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)
+#  *                                                                          *
+#  ************************************************************************** */
+#
+# /* See http://www.boost.org for most recent version. */
+#
+# include <boost/preprocessor/facilities/is_empty.hpp>
+# include <libs/preprocessor/test/test.h>
+
+#if BOOST_PP_VARIADICS && (BOOST_PP_CONFIG_FLAGS() & BOOST_PP_CONFIG_STRICT()) && !BOOST_PP_VARIADICS_MSVC
+
+#define FUNC_GEN8(x,y) (1,2,3)
+  
+BEGIN BOOST_PP_IS_EMPTY(FUNC_GEN8) == 0 END
+
+#else
+  
+BEGIN 1 == 0 END
+
+#endif
--- a/test/isempty_variadic_standard_failure2.c
+++ b/test/isempty_variadic_standard_failure2.c
@ -0,0 +1,12 @@
+# /* **************************************************************************
+#  *                                                                          *
+#  *     (C) Copyright Edward Diener 2014.
+#  *     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)
+#  *                                                                          *
+#  ************************************************************************** */
+#
+# /* See http://www.boost.org for most recent version. */
+#
+# include <libs/preprocessor/test/isempty_variadic_standard_failure2.cxx>
--- a/test/isempty_variadic_standard_failure2.cpp
+++ b/test/isempty_variadic_standard_failure2.cpp
@ -0,0 +1,12 @@
+# /* **************************************************************************
+#  *                                                                          *
+#  *     (C) Copyright Edward Diener 2014.
+#  *     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)
+#  *                                                                          *
+#  ************************************************************************** */
+#
+# /* See http://www.boost.org for most recent version. */
+#
+# include <libs/preprocessor/test/isempty_variadic_standard_failure2.cxx>
--- a/test/isempty_variadic_standard_failure2.cxx
+++ b/test/isempty_variadic_standard_failure2.cxx
@ -0,0 +1,25 @@
+# /* **************************************************************************
+#  *                                                                          *
+#  *     (C) Copyright Edward Diener 2014.
+#  *     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)
+#  *                                                                          *
+#  ************************************************************************** */
+#
+# /* See http://www.boost.org for most recent version. */
+#
+# include <boost/preprocessor/facilities/is_empty.hpp>
+# include <libs/preprocessor/test/test.h>
+
+#if BOOST_PP_VARIADICS && (BOOST_PP_CONFIG_FLAGS() & BOOST_PP_CONFIG_STRICT()) && !BOOST_PP_VARIADICS_MSVC
+
+#define FUNC_GEN9(x,y,z) anything
+  
+BEGIN BOOST_PP_IS_EMPTY(FUNC_GEN9) == 0 END
+
+#else
+  
+BEGIN 1 == 0 END
+
+#endif
--- a/test/list.cxx
+++ b/test/list.cxx
@ -16,17 +16,27 @@
 # include <boost/preprocessor/comparison/equal.hpp>
 # include <boost/preprocessor/comparison/less.hpp>
 # include <boost/preprocessor/control/iif.hpp>
+# include <boost/preprocessor/facilities/is_empty.hpp>
 # include <boost/preprocessor/list.hpp>
 # include <boost/preprocessor/tuple/elem.hpp>
+# include <boost/preprocessor/tuple/size.hpp>
 # include <boost/preprocessor/array/elem.hpp>
+# include <boost/preprocessor/array/size.hpp>
 # include <boost/preprocessor/seq/elem.hpp>
+# include <boost/preprocessor/seq/size.hpp>
 # include <boost/preprocessor/variadic/elem.hpp>
 # include <libs/preprocessor/test/test.h>

 # define LISTNIL BOOST_PP_NIL
 # define LIST (4, (1, (5, (2, BOOST_PP_NIL))))
-
 # define REVERSAL(d, x, y) BOOST_PP_SUB_D(d, y, x)
+# define F1(r, state, x) + x + state
+# define FI2(r, state, i, x) BOOST_PP_IIF(BOOST_PP_EQUAL(i,1),+ x + x + state,+ x + state)
+# define F2(r, x) + BOOST_PP_TUPLE_ELEM(2, 0, x) + 2 - BOOST_PP_TUPLE_ELEM(2, 1, x)
+# define L1 (0, (x, BOOST_PP_NIL))
+# define L2 (a, (1, (b, (2, BOOST_PP_NIL))))
+# define L3 (c, (3, (d, BOOST_PP_NIL)))
+# define LL (L1, (L2, (L3, BOOST_PP_NIL)))

 BEGIN BOOST_PP_LIST_FIRST(LIST) == 4 END
 BEGIN BOOST_PP_LIST_IS_CONS(LIST) == 1 END
@ -41,22 +51,28 @@ BEGIN BOOST_PP_VARIADIC_ELEM(2,BOOST_PP_LIST_ENUM(LIST)) == 5 END
 #endif

 BEGIN BOOST_PP_LIST_FOLD_LEFT(BOOST_PP_SUB_D, 22, LIST) == 10 END
+BEGIN BOOST_PP_LIST_FOLD_LEFT(BOOST_PP_SUB_D, 22, LISTNIL) == 22 END
 BEGIN BOOST_PP_LIST_FOLD_RIGHT(BOOST_PP_ADD_D, 0, LIST) == 12 END
+BEGIN BOOST_PP_LIST_FOLD_RIGHT(BOOST_PP_ADD_D, 0, LISTNIL) == 0 END
 BEGIN BOOST_PP_LIST_FOLD_RIGHT(REVERSAL, 0, LIST) == 4 END

 BEGIN BOOST_PP_LIST_CAT(BOOST_PP_LIST_REVERSE(LIST)) == 2514 END
+BEGIN BOOST_PP_LIST_IS_NIL(BOOST_PP_LIST_REVERSE(LISTNIL)) == 1 END

 BEGIN BOOST_PP_LIST_CAT(BOOST_PP_LIST_REST_N(2, LIST)) == 52 END
+BEGIN BOOST_PP_LIST_IS_NIL(BOOST_PP_LIST_REST_N(0, LISTNIL)) == 1 END
 BEGIN BOOST_PP_LIST_CAT(BOOST_PP_LIST_FIRST_N(2, LIST)) == 41 END

 BEGIN BOOST_PP_LIST_AT(LIST, 2) == 5 END
 BEGIN BOOST_PP_LIST_SIZE(LIST) == 4 END
+BEGIN BOOST_PP_LIST_SIZE(LISTNIL) == 0 END

 BEGIN BOOST_PP_LIST_CAT(BOOST_PP_LIST_TRANSFORM(BOOST_PP_ADD_D, 2, LIST)) == 6374 END
+BEGIN BOOST_PP_LIST_IS_NIL(BOOST_PP_LIST_TRANSFORM(BOOST_PP_ADD_D, 2, LISTNIL)) == 1 END
 BEGIN BOOST_PP_LIST_CAT(BOOST_PP_LIST_APPEND(BOOST_PP_LIST_REST(LIST), LIST)) == 1524152 END
-
-# define F1(r, state, x) + x + state
-# define FI2(r, state, i, x) BOOST_PP_IIF(BOOST_PP_EQUAL(i,1),+ x + x + state,+ x + state)
+BEGIN BOOST_PP_LIST_CAT(BOOST_PP_LIST_APPEND(LIST,LISTNIL)) == 4152 END
+BEGIN BOOST_PP_LIST_CAT(BOOST_PP_LIST_APPEND(LISTNIL,LIST)) == 4152 END
+BEGIN BOOST_PP_LIST_IS_NIL(BOOST_PP_LIST_APPEND(LISTNIL,LISTNIL)) == 1 END

 BEGIN BOOST_PP_LIST_FOR_EACH(F1, 1, LIST) == 16 END
 BEGIN BOOST_PP_LIST_FOR_EACH_I(FI2, 1, LIST) == 17 END
@ -64,17 +80,12 @@ BEGIN BOOST_PP_LIST_FOR_EACH_I(FI2, 1, LIST) == 17 END
 BEGIN BOOST_PP_TUPLE_ELEM(4, 3, BOOST_PP_LIST_TO_TUPLE(LIST)) == 2 END

 BEGIN BOOST_PP_LIST_CAT(BOOST_PP_LIST_FILTER(BOOST_PP_LESS_D, 3, LIST)) == 45 END
+BEGIN BOOST_PP_LIST_IS_NIL(BOOST_PP_LIST_FILTER(BOOST_PP_LESS_D, 3, LISTNIL)) == 1 END

-# define F2(r, x) + BOOST_PP_TUPLE_ELEM(2, 0, x) + 2 - BOOST_PP_TUPLE_ELEM(2, 1, x)
 BEGIN BOOST_PP_LIST_FOR_EACH_PRODUCT(F2, 2, ( (1, (0, BOOST_PP_NIL)), (2, (3, BOOST_PP_NIL)) )) == 0 END

-# define L1 (0, (x, BOOST_PP_NIL))
-# define L2 (a, (1, (b, (2, BOOST_PP_NIL))))
-# define L3 (c, (3, (d, BOOST_PP_NIL)))
-
-# define LL (L1, (L2, (L3, BOOST_PP_NIL)))
-
 BEGIN BOOST_PP_LIST_CAT(BOOST_PP_LIST_FOLD_LEFT(BOOST_PP_LIST_APPEND_D, BOOST_PP_NIL, LL)) == 0x0a1b2c3d END

 BEGIN BOOST_PP_ARRAY_ELEM(2, BOOST_PP_LIST_TO_ARRAY(LIST)) == 5 END
+BEGIN BOOST_PP_ARRAY_SIZE(BOOST_PP_LIST_TO_ARRAY(LISTNIL)) == 0 END
 BEGIN BOOST_PP_SEQ_ELEM(3, BOOST_PP_LIST_TO_SEQ(LIST)) == 2 END
--- a/test/punctuation.c
+++ b/test/punctuation.c
@ -0,0 +1,14 @@
+# /* **************************************************************************
+#  *                                                                          *
+#  *     (C) 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)
+#  *                                                                          *
+#  ************************************************************************** */
+#
+# /* Revised by Edward Diener (2011) */
+#
+# /* See http://www.boost.org for most recent version. */
+#
+# include <libs/preprocessor/test/punctuation.cxx>
--- a/test/punctuation.cpp
+++ b/test/punctuation.cpp
@ -0,0 +1,14 @@
+# /* **************************************************************************
+#  *                                                                          *
+#  *     (C) 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)
+#  *                                                                          *
+#  ************************************************************************** */
+#
+# /* Revised by Edward Diener (2011) */
+#
+# /* See http://www.boost.org for most recent version. */
+#
+# include <libs/preprocessor/test/punctuation.cxx>
--- a/test/punctuation.cxx
+++ b/test/punctuation.cxx
@ -0,0 +1,54 @@
+# /* **************************************************************************
+#  *                                                                          *
+#  *     (C) Copyright Edward Diener 2014.
+#  *     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)
+#  *                                                                          *
+#  ************************************************************************** */
+#
+# /* See http://www.boost.org for most recent version. */
+#
+# if BOOST_PP_VARIADICS
+# include <boost/preprocessor/punctuation.hpp>
+# include <libs/preprocessor/test/test.h>
+
+# define A_TUPLE (*,#,zz)
+# define A_TUPLE2 (*,#,(zz,44,(e7)))
+# define A_TUPLE_PLUS (mmf,34,^^,!) 456
+# define PLUS_ATUPLE yyt (j,ii%)
+# define JDATA ggh 
+# define NOT_TUPLE y6()
+# define NOT_TUPLE2 &(kkkgg,(e))
+# define A_SEQ (r)($)(#)
+# define AN_ARRAY (4,(5,7,f,x)) 
+# define A_LIST (e,(g,(&,BOOST_PP_NIL)))
+# define DATA (5 + 3) * 4
+# define DATA2 4 * (5 + 3)
+# define DATA3 4 * (5 + 3) * (2 + 1)
+# define DATA4 (5 + 3) * (2 + 1) * 4
+  
+  
+// is_begin_parens
+
+BEGIN BOOST_PP_IS_BEGIN_PARENS() == 0 END
+BEGIN BOOST_PP_IS_BEGIN_PARENS(A_TUPLE) == 1 END
+BEGIN BOOST_PP_IS_BEGIN_PARENS(A_TUPLE2) == 1 END
+BEGIN BOOST_PP_IS_BEGIN_PARENS(A_TUPLE_PLUS) == 1 END
+BEGIN BOOST_PP_IS_BEGIN_PARENS(PLUS_ATUPLE) == 0 END
+BEGIN BOOST_PP_IS_BEGIN_PARENS(JDATA) == 0 END
+BEGIN BOOST_PP_IS_BEGIN_PARENS(NOT_TUPLE) == 0 END
+BEGIN BOOST_PP_IS_BEGIN_PARENS(NOT_TUPLE2) == 0 END
+BEGIN BOOST_PP_IS_BEGIN_PARENS(A_SEQ) == 1 END
+BEGIN BOOST_PP_IS_BEGIN_PARENS(AN_ARRAY) == 1 END
+BEGIN BOOST_PP_IS_BEGIN_PARENS(A_LIST) == 1 END
+BEGIN BOOST_PP_IS_BEGIN_PARENS((y)2(x)) == 1 END
+
+// remove_parens
+
+BEGIN BOOST_PP_REMOVE_PARENS(DATA) == 17 END
+BEGIN BOOST_PP_REMOVE_PARENS(DATA2)== 32 END
+BEGIN BOOST_PP_REMOVE_PARENS(DATA3)== 96 END
+BEGIN BOOST_PP_REMOVE_PARENS(DATA4)== 41 END
+
+#endif
--- a/test/seq.cxx
+++ b/test/seq.cxx
@ -12,38 +12,111 @@
 # /* See http://www.boost.org for most recent version. */
 #
 # include <boost/preprocessor/arithmetic/add.hpp>
+# include <boost/preprocessor/arithmetic/mod.hpp>
 # include <boost/preprocessor/arithmetic/sub.hpp>
+# include <boost/preprocessor/cat.hpp>
 # include <boost/preprocessor/comparison/equal.hpp>
 # include <boost/preprocessor/comparison/less.hpp>
 # include <boost/preprocessor/control/iif.hpp>
+# include <boost/preprocessor/facilities/is_empty.hpp>
+# include <boost/preprocessor/logical/not.hpp>
 # include <boost/preprocessor/seq.hpp>
 # include <boost/preprocessor/array/elem.hpp>
+# include <boost/preprocessor/array/size.hpp>
 # include <boost/preprocessor/tuple/elem.hpp>
+# include <boost/preprocessor/tuple/size.hpp>
 # include <boost/preprocessor/list/at.hpp>
+# include <boost/preprocessor/list/size.hpp>
 # include <boost/preprocessor/variadic/elem.hpp>
+# include <boost/preprocessor/variadic/size.hpp>
 # include <libs/preprocessor/test/test.h>

+# define SEQ_NONE ()
 # define SEQ (4)(1)(5)(2)
+
+# define SEQ_100 \
+	(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)
+	
+# define SEQ_255 \
+	(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)
+	
+# define SEQ_256 SEQ_255(256)
+
 # define SEQVAR (4,5,8,3,61)(1,0)(5,22,43)(2)(17,45,33)

 # define REVERSAL(s, x, y) BOOST_PP_SUB(y, x)
 # define SUB_S(s, x, y) BOOST_PP_SUB(x, y)
 # define ADD_S(s, x, y) BOOST_PP_ADD(x, y)
+# define CAT_S(s, x, y) BOOST_PP_CAT(x, BOOST_PP_IS_EMPTY(y))

+BEGIN BOOST_PP_IS_EMPTY(BOOST_PP_SEQ_HEAD(SEQ_NONE)) == 1 END
 BEGIN BOOST_PP_SEQ_HEAD(SEQ) == 4 END
+BEGIN BOOST_PP_SEQ_HEAD(SEQ_255) == 1 END
+BEGIN BOOST_PP_SEQ_HEAD(SEQ_256) == 1 END

+BEGIN BOOST_PP_SEQ_FOLD_LEFT(CAT_S, 1, SEQ_NONE) == 11 END
 BEGIN BOOST_PP_SEQ_FOLD_LEFT(SUB_S, 22, SEQ) == 10 END
+BEGIN BOOST_PP_SEQ_FOLD_RIGHT(CAT_S, 2, SEQ_NONE) == 21 END
 BEGIN BOOST_PP_SEQ_FOLD_RIGHT(ADD_S, 0, SEQ) == 12 END
 BEGIN BOOST_PP_SEQ_FOLD_RIGHT(REVERSAL, 0, SEQ) == 4 END

+BEGIN BOOST_PP_IS_EMPTY(BOOST_PP_SEQ_CAT(BOOST_PP_SEQ_REVERSE(SEQ_NONE))) == 1 END
 BEGIN BOOST_PP_SEQ_CAT(BOOST_PP_SEQ_REVERSE(SEQ)) == 2514 END

 BEGIN BOOST_PP_SEQ_CAT(BOOST_PP_SEQ_REST_N(2, SEQ)) == 52 END
+BEGIN BOOST_PP_SEQ_CAT(BOOST_PP_SEQ_REST_N(99, SEQ_100)) == 100 END
+BEGIN BOOST_PP_SEQ_CAT(BOOST_PP_SEQ_REST_N(255, SEQ_256)) == 256 END
+BEGIN BOOST_PP_IS_EMPTY(BOOST_PP_SEQ_CAT(BOOST_PP_SEQ_FIRST_N(1, SEQ_NONE))) == 1 END
 BEGIN BOOST_PP_SEQ_CAT(BOOST_PP_SEQ_FIRST_N(2, SEQ)) == 41 END
+BEGIN BOOST_PP_SEQ_ELEM(50,BOOST_PP_SEQ_FIRST_N(100, SEQ_100)) == 51 END
+BEGIN BOOST_PP_SEQ_ELEM(100,BOOST_PP_SEQ_FIRST_N(255, SEQ_255)) == 101 END
+BEGIN BOOST_PP_SEQ_ELEM(200,BOOST_PP_SEQ_FIRST_N(256, SEQ_256)) == 201 END

+BEGIN BOOST_PP_IS_EMPTY(BOOST_PP_SEQ_ELEM(0, SEQ_NONE)) == 1 END
+BEGIN BOOST_PP_SEQ_SIZE(SEQ_NONE) == 1 END
 BEGIN BOOST_PP_SEQ_ELEM(2, SEQ) == 5 END
+BEGIN BOOST_PP_SEQ_ELEM(20, SEQ_255) == 21 END
+BEGIN BOOST_PP_SEQ_ELEM(254, SEQ_255) == 255 END
+BEGIN BOOST_PP_SEQ_ELEM(220, SEQ_256) == 221 END
+BEGIN BOOST_PP_SEQ_ELEM(255, SEQ_256) == 256 END
 BEGIN BOOST_PP_SEQ_SIZE(SEQ) == 4 END

+BEGIN BOOST_PP_SEQ_CAT(BOOST_PP_SEQ_TRANSFORM(CAT_S, 13, SEQ_NONE)) == 131 END
 BEGIN BOOST_PP_SEQ_CAT(BOOST_PP_SEQ_TRANSFORM(ADD_S, 2, SEQ)) == 6374 END
 BEGIN BOOST_PP_SEQ_CAT(BOOST_PP_SEQ_TAIL(SEQ) SEQ) == 1524152 END

@ -53,28 +126,67 @@ BEGIN BOOST_PP_SEQ_FOR_EACH(F1, 1, SEQ) == 16 END
 BEGIN BOOST_PP_SEQ_FOR_EACH_I(FI2, 1, SEQ) == 21 END

 BEGIN BOOST_PP_TUPLE_ELEM(4, 3, BOOST_PP_SEQ_TO_TUPLE(SEQ)) == 2 END
+BEGIN BOOST_PP_IS_EMPTY(BOOST_PP_TUPLE_ELEM(1, 0, BOOST_PP_SEQ_TO_TUPLE(SEQ_NONE))) == 1 END
+
+#if BOOST_PP_VARIADICS
+
+BEGIN BOOST_PP_TUPLE_SIZE(BOOST_PP_SEQ_TO_TUPLE(SEQ_NONE)) == 1 END
+
+#endif
+
 BEGIN BOOST_PP_ARRAY_ELEM(3, BOOST_PP_SEQ_TO_ARRAY(SEQ)) == 2 END

-# define LESS_S(s, x, y) BOOST_PP_LESS(x, y)
-BEGIN BOOST_PP_SEQ_CAT(BOOST_PP_SEQ_FILTER(LESS_S, 3, SEQ)) == 45 END
+BEGIN BOOST_PP_IS_EMPTY(BOOST_PP_ARRAY_ELEM(0, BOOST_PP_SEQ_TO_ARRAY(SEQ_NONE))) == 1 END
+BEGIN BOOST_PP_ARRAY_SIZE(BOOST_PP_SEQ_TO_ARRAY(SEQ_NONE)) == 1 END

+# define LESS_S(s, x, y) BOOST_PP_LESS(x, y)
+# define FILTER_MOD_S(s, data, elem) BOOST_PP_NOT(BOOST_PP_MOD(elem,data))
+BEGIN BOOST_PP_SEQ_CAT(BOOST_PP_SEQ_FILTER(LESS_S, 3, SEQ)) == 45 END
+BEGIN BOOST_PP_SEQ_ELEM(4,BOOST_PP_SEQ_FILTER(FILTER_MOD_S, 20, SEQ_100)) == 100 END
+BEGIN BOOST_PP_SEQ_ELEM(2,BOOST_PP_SEQ_FILTER(FILTER_MOD_S, 30, SEQ_100)) == 90 END
+
+BEGIN BOOST_PP_SEQ_CAT(BOOST_PP_SEQ_INSERT(SEQ_NONE, 0, 7)) == 7 END
 BEGIN BOOST_PP_SEQ_CAT(BOOST_PP_SEQ_INSERT(SEQ, 0, 3)) == 34152 END
 BEGIN BOOST_PP_SEQ_CAT(BOOST_PP_SEQ_INSERT(SEQ, 2, 3)) == 41352 END
 BEGIN BOOST_PP_SEQ_CAT(BOOST_PP_SEQ_INSERT(SEQ, 4, 3)) == 41523 END
+BEGIN BOOST_PP_SEQ_SIZE(BOOST_PP_SEQ_INSERT(SEQ_255, 0, 100)) == 256 END
+BEGIN BOOST_PP_SEQ_ELEM(255,BOOST_PP_SEQ_INSERT(SEQ_255, 0, 100)) == 255 END
+BEGIN BOOST_PP_SEQ_ELEM(0,BOOST_PP_SEQ_INSERT(SEQ_255, 0, 113)) == 113 END

 BEGIN BOOST_PP_SEQ_CAT(BOOST_PP_SEQ_POP_BACK(SEQ)) == 415 END
+BEGIN BOOST_PP_SEQ_SIZE(BOOST_PP_SEQ_POP_BACK(SEQ_256)) == 255 END
+BEGIN BOOST_PP_SEQ_ELEM(254,BOOST_PP_SEQ_POP_BACK(SEQ_256)) == 255 END
+BEGIN BOOST_PP_SEQ_ELEM(100,BOOST_PP_SEQ_POP_BACK(SEQ_256)) == 101 END
 BEGIN BOOST_PP_SEQ_CAT(BOOST_PP_SEQ_POP_FRONT(SEQ)) == 152 END
+BEGIN BOOST_PP_SEQ_SIZE(BOOST_PP_SEQ_POP_FRONT(SEQ_256)) == 255 END
+BEGIN BOOST_PP_SEQ_ELEM(0,BOOST_PP_SEQ_POP_FRONT(SEQ_256)) == 2 END
+BEGIN BOOST_PP_SEQ_ELEM(254,BOOST_PP_SEQ_POP_FRONT(SEQ_256)) == 256 END

+BEGIN BOOST_PP_SEQ_CAT(BOOST_PP_SEQ_PUSH_FRONT(SEQ_NONE, 145))  == 145 END
 BEGIN BOOST_PP_SEQ_CAT(BOOST_PP_SEQ_PUSH_FRONT(SEQ, 3))  == 34152 END
+BEGIN BOOST_PP_SEQ_SIZE(BOOST_PP_SEQ_PUSH_FRONT(SEQ_255, 57))  == 256 END
+BEGIN BOOST_PP_SEQ_ELEM(0,BOOST_PP_SEQ_PUSH_FRONT(SEQ_255, 222))  == 222 END
+BEGIN BOOST_PP_SEQ_ELEM(255,BOOST_PP_SEQ_PUSH_FRONT(SEQ_255, 111))  == 255 END
+BEGIN BOOST_PP_SEQ_CAT(BOOST_PP_SEQ_PUSH_BACK(SEQ_NONE, 79))  == 79 END
 BEGIN BOOST_PP_SEQ_CAT(BOOST_PP_SEQ_PUSH_BACK(SEQ, 3))  == 41523 END
+BEGIN BOOST_PP_SEQ_SIZE(BOOST_PP_SEQ_PUSH_BACK(SEQ_255, 199)) == 256 END
+BEGIN BOOST_PP_SEQ_ELEM(254,BOOST_PP_SEQ_PUSH_BACK(SEQ_255, 99)) == 255 END
+BEGIN BOOST_PP_SEQ_ELEM(255,BOOST_PP_SEQ_PUSH_BACK(SEQ_255, 99)) == 99 END

 BEGIN BOOST_PP_SEQ_CAT(BOOST_PP_SEQ_REMOVE(SEQ, 0))  == 152 END
 BEGIN BOOST_PP_SEQ_CAT(BOOST_PP_SEQ_REMOVE(SEQ, 2))  == 412 END
 BEGIN BOOST_PP_SEQ_CAT(BOOST_PP_SEQ_REMOVE(SEQ, 3))  == 415 END

+BEGIN BOOST_PP_SEQ_SIZE(BOOST_PP_SEQ_REMOVE(SEQ_255, 254))  == 254 END
+BEGIN BOOST_PP_SEQ_SIZE(BOOST_PP_SEQ_REMOVE(SEQ_256, 255))  == 255 END
+
+BEGIN BOOST_PP_SEQ_CAT(BOOST_PP_SEQ_REPLACE(SEQ_NONE, 0, 22))  == 22 END
 BEGIN BOOST_PP_SEQ_CAT(BOOST_PP_SEQ_REPLACE(SEQ, 0, 3))  == 3152 END
 BEGIN BOOST_PP_SEQ_CAT(BOOST_PP_SEQ_REPLACE(SEQ, 1, 3))  == 4352 END
 BEGIN BOOST_PP_SEQ_CAT(BOOST_PP_SEQ_REPLACE(SEQ, 3, 3))  == 4153 END
+BEGIN BOOST_PP_SEQ_SIZE(BOOST_PP_SEQ_REPLACE(SEQ_256, 255, 22)) == 256 END
+BEGIN BOOST_PP_SEQ_ELEM(233,BOOST_PP_SEQ_REPLACE(SEQ_256, 255, 22)) == 234 END
+BEGIN BOOST_PP_SEQ_ELEM(255,BOOST_PP_SEQ_REPLACE(SEQ_256, 255, 22)) == 22 END

 BEGIN BOOST_PP_SEQ_CAT(BOOST_PP_SEQ_SUBSEQ(SEQ, 0, 4))  == 4152 END
 BEGIN BOOST_PP_SEQ_CAT(BOOST_PP_SEQ_SUBSEQ(SEQ, 0, 2))  == 41 END
@ -98,9 +210,12 @@ BEGIN BOOST_PP_SEQ_CAT(BOOST_PP_SEQ_TAIL(BOOST_PP_SEQ_FOLD_LEFT(SEQ_APPEND, (~),
 BEGIN BOOST_PP_SEQ_SIZE(BOOST_PP_SEQ_TAIL(BOOST_PP_SEQ_FOLD_LEFT(SEQ_APPEND, (~), LL))) == 9 END

 BEGIN BOOST_PP_LIST_AT(BOOST_PP_SEQ_TO_LIST(SEQ), 2) == 5 END
+BEGIN BOOST_PP_IS_EMPTY(BOOST_PP_LIST_AT(BOOST_PP_SEQ_TO_LIST(SEQ_NONE),0)) == 1 END
+BEGIN BOOST_PP_LIST_SIZE(BOOST_PP_SEQ_TO_LIST(SEQ_NONE)) == 1 END

 #if BOOST_PP_VARIADICS

+BEGIN BOOST_PP_VARIADIC_SIZE(BOOST_PP_SEQ_ENUM(SEQ_NONE)) == 1 END
 BEGIN BOOST_PP_VARIADIC_ELEM(0,BOOST_PP_SEQ_ENUM(SEQ)) == 4 END
 BEGIN BOOST_PP_TUPLE_ELEM(2,BOOST_PP_SEQ_ELEM(0,BOOST_PP_VARIADIC_SEQ_TO_SEQ(SEQVAR))) == 8 END

--- a/test/tuple.cxx
+++ b/test/tuple.cxx
@ -7,21 +7,29 @@
 #  *                                                                          *
 #  ************************************************************************** */
 #
-# /* Revised by Edward Diener (2011) */
+# /* Revised by Edward Diener (2011,2014) */
 #
 # /* See http://www.boost.org for most recent version. */
 #
+# include <boost/preprocessor/cat.hpp>
+# include <boost/preprocessor/control/if.hpp>
 # include <boost/preprocessor/tuple.hpp>
 # include <boost/preprocessor/array/elem.hpp>
+# include <boost/preprocessor/array/size.hpp>
 # include <boost/preprocessor/list/at.hpp>
+# include <boost/preprocessor/list/size.hpp>
 # include <boost/preprocessor/seq/elem.hpp>
+# include <boost/preprocessor/seq/size.hpp>
+# include <boost/preprocessor/facilities/is_empty.hpp>
 # if BOOST_PP_VARIADICS
 # include <boost/preprocessor/variadic/size.hpp>
 # include <boost/preprocessor/variadic/elem.hpp>
 # endif
 # include <libs/preprocessor/test/test.h>
+# include <libs/preprocessor/test/tuple_elem_bug_test.cxx>

 # define TUPLE (0, 1, 2, 3, 4, 5)
+# define TUPLE_NONE ()
 # define TUPLE_LARGE (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)
 # define TUPLE_VERY_LARGE (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)
 # define T2 (+3, /2, +6)
@ -30,6 +38,7 @@

 # define CALC(x) BOOST_PP_TUPLE_ELEM(0, x) BOOST_PP_TUPLE_ELEM(1, x) BOOST_PP_TUPLE_ELEM(2, x)
 # define TEST_EAT BOOST_PP_TUPLE_EAT()(1, 2) 4
+# define TEST_EAT_NONE BOOST_PP_TUPLE_EAT()() 17
 # define TEST_EAT_LARGE BOOST_PP_TUPLE_EAT()(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) 6
 # define TEST_EAT_VERY_LARGE BOOST_PP_TUPLE_EAT()(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) 8

@ -37,6 +46,7 @@

 # define CALC(x) BOOST_PP_TUPLE_ELEM(3, 0, x) BOOST_PP_TUPLE_ELEM(3, 1, x) BOOST_PP_TUPLE_ELEM(3, 2, x)
 # define TEST_EAT BOOST_PP_TUPLE_EAT(2)(1, 2) 4
+# define TEST_EAT_NONE BOOST_PP_TUPLE_EAT(1)() 17
 # define TEST_EAT_LARGE BOOST_PP_TUPLE_EAT(33)(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) 6
 # define TEST_EAT_VERY_LARGE BOOST_PP_TUPLE_EAT(64)(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) 8

@ -44,6 +54,7 @@

 // elem

+BEGIN BOOST_PP_IS_EMPTY(BOOST_PP_TUPLE_ELEM(1, 0, TUPLE_NONE)) == 1 END
 BEGIN BOOST_PP_TUPLE_ELEM(6, 3, TUPLE) == 3 END
 BEGIN BOOST_PP_TUPLE_ELEM(6, 5, TUPLE) == 5 END
 BEGIN BOOST_PP_TUPLE_ELEM(33, 15, TUPLE_LARGE) == 15 END
@ -55,6 +66,7 @@ BEGIN BOOST_PP_TUPLE_ELEM(64, 63, TUPLE_VERY_LARGE) == 63 END

 // reverse

+BEGIN BOOST_PP_IS_EMPTY(BOOST_PP_TUPLE_ELEM(1, 0, BOOST_PP_TUPLE_REVERSE(1,TUPLE_NONE))) == 1 END
 BEGIN BOOST_PP_TUPLE_ELEM(6, 2, BOOST_PP_TUPLE_REVERSE(6,TUPLE)) == 3 END
 BEGIN BOOST_PP_TUPLE_ELEM(33, 27, BOOST_PP_TUPLE_REVERSE(33,TUPLE_LARGE)) == 5 END
 BEGIN BOOST_PP_TUPLE_ELEM(64, 43, BOOST_PP_TUPLE_REVERSE(64,TUPLE_VERY_LARGE)) == 20 END
@ -64,6 +76,7 @@ BEGIN CALC(BOOST_PP_TUPLE_REVERSE(3, T2)) == 6 END
 // eat

 BEGIN TEST_EAT == 4 END
+BEGIN TEST_EAT_NONE == 17 END
 BEGIN TEST_EAT_LARGE == 6 END
 BEGIN TEST_EAT_VERY_LARGE == 8 END

@ -72,23 +85,30 @@ BEGIN TEST_EAT_VERY_LARGE == 8 END
 BEGIN BOOST_PP_ARRAY_ELEM(3,BOOST_PP_TUPLE_TO_ARRAY(6,TUPLE)) == 3 END
 BEGIN BOOST_PP_ARRAY_ELEM(29,BOOST_PP_TUPLE_TO_ARRAY(33,TUPLE_LARGE)) == 29 END
 BEGIN BOOST_PP_ARRAY_ELEM(61,BOOST_PP_TUPLE_TO_ARRAY(64,TUPLE_VERY_LARGE)) == 61 END
+BEGIN BOOST_PP_IS_EMPTY(BOOST_PP_ARRAY_ELEM(0,BOOST_PP_TUPLE_TO_ARRAY(1,TUPLE_NONE))) == 1 END
+BEGIN BOOST_PP_ARRAY_SIZE(BOOST_PP_TUPLE_TO_ARRAY(1,TUPLE_NONE)) == 1 END

 // to_list

 BEGIN BOOST_PP_LIST_AT(BOOST_PP_TUPLE_TO_LIST(6,TUPLE), 2) == 2 END
 BEGIN BOOST_PP_LIST_AT(BOOST_PP_TUPLE_TO_LIST(33,TUPLE_LARGE), 19) == 19 END
 BEGIN BOOST_PP_LIST_AT(BOOST_PP_TUPLE_TO_LIST(64,TUPLE_VERY_LARGE), 62) == 62 END
+BEGIN BOOST_PP_IS_EMPTY(BOOST_PP_LIST_AT(BOOST_PP_TUPLE_TO_LIST(1,TUPLE_NONE), 0)) == 1 END
+BEGIN BOOST_PP_LIST_SIZE(BOOST_PP_TUPLE_TO_LIST(1,TUPLE_NONE)) == 1 END

 // to_seq

 BEGIN BOOST_PP_SEQ_ELEM(4,BOOST_PP_TUPLE_TO_SEQ(6,TUPLE)) == 4 END
 BEGIN BOOST_PP_SEQ_ELEM(31,BOOST_PP_TUPLE_TO_SEQ(33,TUPLE_LARGE)) == 31 END
 BEGIN BOOST_PP_SEQ_ELEM(55,BOOST_PP_TUPLE_TO_SEQ(64,TUPLE_VERY_LARGE)) == 55 END
+BEGIN BOOST_PP_IS_EMPTY(BOOST_PP_SEQ_ELEM(0,BOOST_PP_TUPLE_TO_SEQ(1,TUPLE_NONE))) == 1 END
+BEGIN BOOST_PP_SEQ_SIZE(BOOST_PP_TUPLE_TO_SEQ(1,TUPLE_NONE)) == 1 END

 #if BOOST_PP_VARIADICS

 // elem

+BEGIN BOOST_PP_IS_EMPTY(BOOST_PP_TUPLE_ELEM(0, TUPLE_NONE)) == 1 END
 BEGIN BOOST_PP_TUPLE_ELEM(3, TUPLE) == 3 END
 BEGIN BOOST_PP_TUPLE_ELEM(5, TUPLE) == 5 END
 BEGIN BOOST_PP_TUPLE_ELEM(15, TUPLE_LARGE) == 15 END
@ -100,6 +120,7 @@ BEGIN BOOST_PP_TUPLE_ELEM(63, TUPLE_VERY_LARGE) == 63 END

 // reverse

+BEGIN BOOST_PP_IS_EMPTY(BOOST_PP_TUPLE_ELEM(0, BOOST_PP_TUPLE_REVERSE(TUPLE_NONE))) == 1 END
 BEGIN BOOST_PP_TUPLE_ELEM(2, BOOST_PP_TUPLE_REVERSE(TUPLE)) == 3 END
 BEGIN BOOST_PP_TUPLE_ELEM(27, BOOST_PP_TUPLE_REVERSE(TUPLE_LARGE)) == 5 END
 BEGIN BOOST_PP_TUPLE_ELEM(43, BOOST_PP_TUPLE_REVERSE(TUPLE_VERY_LARGE)) == 20 END
@ -110,12 +131,16 @@ BEGIN BOOST_PP_VARIADIC_ELEM(45,BOOST_PP_TUPLE_ENUM(BOOST_PP_TUPLE_REVERSE(TUPLE

 // enum

+BEGIN BOOST_PP_VARIADIC_SIZE(BOOST_PP_TUPLE_ENUM(TUPLE_NONE)) == 1 END
 BEGIN BOOST_PP_VARIADIC_SIZE(BOOST_PP_TUPLE_ENUM(TUPLE)) == 6 END
 BEGIN BOOST_PP_VARIADIC_SIZE(BOOST_PP_TUPLE_ENUM(TUPLE_LARGE)) == 33 END
 BEGIN BOOST_PP_VARIADIC_SIZE(BOOST_PP_TUPLE_ENUM(TUPLE_VERY_LARGE)) == 64 END

 // insert

+BEGIN BOOST_PP_TUPLE_ELEM(0, BOOST_PP_TUPLE_INSERT(TUPLE_NONE,0,40)) == 40 END
+BEGIN BOOST_PP_TUPLE_SIZE(BOOST_PP_TUPLE_INSERT(TUPLE_NONE,0,40)) == 2 END
+
 BEGIN BOOST_PP_TUPLE_ELEM(0, BOOST_PP_TUPLE_INSERT(TUPLE,2,40)) == 0 END
 BEGIN BOOST_PP_TUPLE_ELEM(1, BOOST_PP_TUPLE_INSERT(TUPLE,1,40)) == 40 END
 BEGIN BOOST_PP_TUPLE_ELEM(2, BOOST_PP_TUPLE_INSERT(TUPLE,1,40)) == 1 END
@ -144,28 +169,38 @@ BEGIN BOOST_PP_TUPLE_ELEM(55, BOOST_PP_TUPLE_POP_FRONT(TUPLE_VERY_LARGE)) == 56

 // push_back

+BEGIN BOOST_PP_TUPLE_SIZE(BOOST_PP_TUPLE_PUSH_BACK(TUPLE_NONE, 1)) == 2 END
 BEGIN BOOST_PP_TUPLE_SIZE(BOOST_PP_TUPLE_PUSH_BACK(TUPLE, 6)) == 7 END
 BEGIN BOOST_PP_TUPLE_SIZE(BOOST_PP_TUPLE_PUSH_BACK(TUPLE_LARGE, 33)) == 34 END
+BEGIN BOOST_PP_TUPLE_ELEM(1, BOOST_PP_TUPLE_PUSH_BACK(TUPLE_NONE, 1)) == 1 END
 BEGIN BOOST_PP_TUPLE_ELEM(0, BOOST_PP_TUPLE_PUSH_BACK(TUPLE, 6)) == 0 END
 BEGIN BOOST_PP_TUPLE_ELEM(33, BOOST_PP_TUPLE_PUSH_BACK(TUPLE_LARGE, 33)) == 33 END

 // push_front

+BEGIN BOOST_PP_TUPLE_SIZE(BOOST_PP_TUPLE_PUSH_FRONT(TUPLE_NONE, 55)) == 2 END
 BEGIN BOOST_PP_TUPLE_SIZE(BOOST_PP_TUPLE_PUSH_FRONT(TUPLE, 555)) == 7 END
 BEGIN BOOST_PP_TUPLE_SIZE(BOOST_PP_TUPLE_PUSH_FRONT(TUPLE_LARGE, 666)) == 34 END
+BEGIN BOOST_PP_TUPLE_ELEM(0, BOOST_PP_TUPLE_PUSH_FRONT(TUPLE_NONE, 55)) == 55 END
 BEGIN BOOST_PP_TUPLE_ELEM(0, BOOST_PP_TUPLE_PUSH_FRONT(TUPLE, 555)) == 555 END
 BEGIN BOOST_PP_TUPLE_ELEM(33, BOOST_PP_TUPLE_PUSH_FRONT(TUPLE_LARGE, 33)) == 32 END

 // rem

-#if BOOST_PP_VARIADICS_MSVC && _MSC_VER == 1400
+#if BOOST_PP_VARIADICS_MSVC && _MSC_VER <= 1400

-BEGIN BOOST_PP_VARIADIC_SIZE(BOOST_PP_TUPLE_REM(6)(0, 1, 2, 3, 4, 5)) == 6 END
+BEGIN BOOST_PP_VARIADIC_SIZE(BOOST_PP_TUPLE_REM(1)()) == 1 END
 BEGIN BOOST_PP_VARIADIC_SIZE(BOOST_PP_TUPLE_REM(33)(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 END
 BEGIN BOOST_PP_VARIADIC_SIZE(BOOST_PP_TUPLE_REM(64)(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 END

 #else

+#if BOOST_PP_VARIADICS_MSVC
+BEGIN BOOST_PP_IS_EMPTY(BOOST_PP_TUPLE_REM_CAT() TUPLE_NONE) == 1 END
+#else
+BEGIN BOOST_PP_IS_EMPTY(BOOST_PP_TUPLE_REM() TUPLE_NONE) == 1 END
+#endif
+
 BEGIN BOOST_PP_VARIADIC_SIZE(BOOST_PP_TUPLE_REM()(0, 1, 2, 3, 4, 5)) == 6 END
 BEGIN BOOST_PP_VARIADIC_SIZE(BOOST_PP_TUPLE_REM()(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 END
 BEGIN BOOST_PP_VARIADIC_SIZE(BOOST_PP_TUPLE_REM()(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 END
@ -174,6 +209,7 @@ BEGIN BOOST_PP_VARIADIC_SIZE(BOOST_PP_TUPLE_REM()(0, 1, 2, 3, 4, 5, 6, 7, 8, 9,

 // rem_ctor

+BEGIN BOOST_PP_VARIADIC_SIZE(BOOST_PP_TUPLE_REM_CTOR(TUPLE_NONE)) == 1 END
 BEGIN BOOST_PP_VARIADIC_SIZE(BOOST_PP_TUPLE_REM_CTOR(TUPLE)) == 6 END
 BEGIN BOOST_PP_VARIADIC_SIZE(BOOST_PP_TUPLE_REM_CTOR(TUPLE_LARGE)) == 33 END
 BEGIN BOOST_PP_VARIADIC_SIZE(BOOST_PP_TUPLE_REM_CTOR(TUPLE_VERY_LARGE)) == 64 END
@ -190,6 +226,7 @@ BEGIN BOOST_PP_TUPLE_ELEM(62, BOOST_PP_TUPLE_REMOVE(TUPLE_VERY_LARGE, 48)) == 63
 // replace

 BEGIN BOOST_PP_TUPLE_SIZE(BOOST_PP_TUPLE_REPLACE(TUPLE_VERY_LARGE, 27, 1000)) == 64 END
+BEGIN BOOST_PP_TUPLE_ELEM(0, BOOST_PP_TUPLE_REPLACE(TUPLE_NONE, 0, 71)) == 71 END
 BEGIN BOOST_PP_TUPLE_ELEM(0, BOOST_PP_TUPLE_REPLACE(TUPLE, 1, 44)) == 0 END
 BEGIN BOOST_PP_TUPLE_ELEM(29, BOOST_PP_TUPLE_REPLACE(TUPLE_LARGE, 29, 999)) == 999 END
 BEGIN BOOST_PP_TUPLE_ELEM(38, BOOST_PP_TUPLE_REPLACE(TUPLE_VERY_LARGE, 37, 1)) == 38 END
@ -197,6 +234,7 @@ BEGIN BOOST_PP_TUPLE_ELEM(28, BOOST_PP_TUPLE_REPLACE(TUPLE_VERY_LARGE, 28, 1)) =

 // size

+BEGIN BOOST_PP_TUPLE_SIZE(TUPLE_NONE) == 1 END
 BEGIN BOOST_PP_TUPLE_SIZE(TUPLE) == 6 END
 BEGIN BOOST_PP_TUPLE_SIZE(TUPLE_LARGE) == 33 END
 BEGIN BOOST_PP_TUPLE_SIZE(TUPLE_VERY_LARGE) == 64 END
@ -206,17 +244,23 @@ BEGIN BOOST_PP_TUPLE_SIZE(TUPLE_VERY_LARGE) == 64 END
 BEGIN BOOST_PP_ARRAY_ELEM(3,BOOST_PP_TUPLE_TO_ARRAY(TUPLE)) == 3 END
 BEGIN BOOST_PP_ARRAY_ELEM(29,BOOST_PP_TUPLE_TO_ARRAY(TUPLE_LARGE)) == 29 END
 BEGIN BOOST_PP_ARRAY_ELEM(61,BOOST_PP_TUPLE_TO_ARRAY(TUPLE_VERY_LARGE)) == 61 END
+BEGIN BOOST_PP_IS_EMPTY(BOOST_PP_ARRAY_ELEM(0,BOOST_PP_TUPLE_TO_ARRAY(TUPLE_NONE))) == 1 END
+BEGIN BOOST_PP_ARRAY_SIZE(BOOST_PP_TUPLE_TO_ARRAY(TUPLE_NONE)) == 1 END

 // to_tuple

 BEGIN BOOST_PP_LIST_AT(BOOST_PP_TUPLE_TO_LIST(TUPLE), 2) == 2 END
 BEGIN BOOST_PP_LIST_AT(BOOST_PP_TUPLE_TO_LIST(TUPLE_LARGE), 19) == 19 END
 BEGIN BOOST_PP_LIST_AT(BOOST_PP_TUPLE_TO_LIST(TUPLE_VERY_LARGE), 62) == 62 END
+BEGIN BOOST_PP_IS_EMPTY(BOOST_PP_LIST_AT(BOOST_PP_TUPLE_TO_LIST(TUPLE_NONE), 0)) == 1 END
+BEGIN BOOST_PP_LIST_SIZE(BOOST_PP_TUPLE_TO_LIST(TUPLE_NONE)) == 1 END

 // to_seq

 BEGIN BOOST_PP_SEQ_ELEM(4,BOOST_PP_TUPLE_TO_SEQ(TUPLE)) == 4 END
 BEGIN BOOST_PP_SEQ_ELEM(31,BOOST_PP_TUPLE_TO_SEQ(TUPLE_LARGE)) == 31 END
 BEGIN BOOST_PP_SEQ_ELEM(55,BOOST_PP_TUPLE_TO_SEQ(TUPLE_VERY_LARGE)) == 55 END
+BEGIN BOOST_PP_IS_EMPTY(BOOST_PP_SEQ_ELEM(0,BOOST_PP_TUPLE_TO_SEQ(TUPLE_NONE))) == 1 END
+BEGIN BOOST_PP_SEQ_SIZE(BOOST_PP_TUPLE_TO_SEQ(TUPLE_NONE)) == 1 END

 #endif
--- a/test/tuple_elem_bug_test.cxx
+++ b/test/tuple_elem_bug_test.cxx
@ -0,0 +1,38 @@
+# /* **************************************************************************
+#  *                                                                          *
+#  *     (C) Copyright Edward Diener 2014.
+#  *     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)
+#  *                                                                          *
+#  ************************************************************************** */
+#
+# /* See http://www.boost.org for most recent version. */
+#
+# include <boost/preprocessor/cat.hpp>
+# include <boost/preprocessor/control/if.hpp>
+# include <boost/preprocessor/tuple.hpp>
+# include <libs/preprocessor/test/test.h>
+
+#define TN_GEN_ONE(p) (1)
+#define TN_GEN_ZERO(p) (0)
+#define TN_TEST_ONE_MORE(parameter,ens) \
+		BOOST_PP_IF \
+			( \
+			BOOST_PP_CAT(BOOST_PP_TUPLE_ELEM(1,0,ens),0), \
+			TN_GEN_ONE, \
+			TN_GEN_ZERO \
+			) \
+		(parameter) \
+/**/
+#define TN_TEST_ONE(parameter,ens) \
+	BOOST_PP_TUPLE_ELEM \
+		( \
+		1, \
+		0, \
+		TN_TEST_ONE_MORE(parameter,ens) \
+		) \
+/**/
+
+BEGIN TN_TEST_ONE(A,(1)) == 1 END
+BEGIN TN_TEST_ONE(A,()) == 0 END
Author	SHA1	Message	Date
Edward Diener	3c3c7b42d9	Corrected implementation same as 'develop' and updated test sames as 'develop'.	2015-07-17 07:45:08 -04:00
Edward Diener	d4fbb8fda2	Back out change from 'develop' because of failing MPL test.	2015-07-16 19:52:49 -04:00
Edward Diener	38e7f69054	Merge branch 'develop'	2015-07-16 18:16:24 -04:00
Edward Diener	3ed3cd689e	Added more thorough tests for large seqs	2015-05-30 08:00:33 -04:00
Edward Diener	fc6229660e	Added not about VC++ compiler limitation	2015-05-29 22:53:01 -04:00
Edward Diener	b125850bbb	Fixes for BOOST_PP_SEQ_REMOVE when the seq is its maximum size and has its last element removed. Also updated seq tests.	2015-05-29 01:36:06 -04:00
Edward Diener	350c0e59b1	Add ned macro	2015-05-27 19:15:45 -04:00
Edward Diener	2612bf706c	Corrected fix for the for_each problem when dealing with as much as 256 seq elements.	2015-05-27 19:13:22 -04:00
Edward Diener	b84235fcb7	Revert "Corrected fix for seq for each processing." This reverts commit `dc61cc1373`.	2015-05-27 07:44:30 -04:00
Edward Diener	4aa8ae8a01	Disallow variadic macro support for versions below 12.4, since that is the first version with C++11 support.	2015-05-26 17:39:58 -04:00
Edward Diener	9044b17f18	For Oracle C++ do not automatically turn off variadic macro support for version 12.3 or higher, since those versions can support C++11.	2015-05-25 23:46:33 -04:00
Edward Diener	106f5a43a1	Added local copy of preprocessor introduction from the C++ Template Metaprogramming Book Appendix A	2015-05-20 17:19:31 -04:00
Edward Diener	915ab7834c	Add local copy of preprocessing tutorail	2015-05-20 16:48:23 -04:00
Edward Diener	dc61cc1373	Corrected fix for seq for each processing.	2015-05-19 20:10:39 -04:00
Edward Diener	4c2c83f9f2	Backing out for_each and for_each_i changes.	2015-05-19 11:34:02 -04:00
Edward Diener	862f64c45c	Updated documentation about undefined behavior.	2015-05-18 17:02:48 -04:00
Edward Diener	06c18a67f8	Fixed replace when replacing the last element of a 256 element sequence.	2015-05-18 16:36:06 -04:00
Edward Diener	eb2a675b8f	Added #undef to quell VC++ warnings about macro be redefined.	2015-05-18 10:51:50 -04:00
Edward Diener	b12333b419	Fixed problem when repetitions go past 256 and the 257th loop op returns that the repetitions are finished.	2015-05-18 02:14:35 -04:00
Edward Diener	1543b5fbf7	Remove need to add extra nil element	2015-05-17 14:54:39 -04:00
Edward Diener	86378d648e	Removed need to add extra seq element.	2015-05-17 13:30:03 -04:00
Edward Diener	633f1e679a	Added information about empty data.	2015-05-17 00:46:10 -04:00
Edward Diener	4360660e39	Add wstringize.hpp to library header	2015-05-16 23:58:39 -04:00
Edward Diener	827ff0905c	Cleaner use of preprocessor defines to quell warnings.	2015-05-16 23:44:06 -04:00
Edward Diener	9cb039ab8b	Merge branch 'develop'	2015-03-28 04:19:20 -04:00
Edward Diener	1b3fe1570b	Put BOOST_PP_EXPAND in correct place for VC++	2015-02-02 21:19:50 -05:00
Edward Diener	4f0adfb553	Reveert removal of BOOST_PP_EXPAND	2015-02-02 18:04:58 -05:00
Edward Diener	01848af60d	Merge branch 'vctuple' into develop	2015-01-30 23:16:08 -05:00
Edward Diener	dc54fee21c	Remove BOOST_PP_EXPAND usage since it is no needed	2015-01-30 23:11:07 -05:00
Edward Diener	77a9177c31	Remove extraneous include	2015-01-30 22:15:54 -05:00
Edward Diener	f1165249fb	Merge branch 'develop'	2015-01-15 15:20:38 -05:00
Edward Diener	fd135a078f	Added BOOST_PP_LIST_SIZE_D to list of re-entrant macros.	2014-12-09 13:21:49 -05:00
Edward Diener	eedd7378f1	Added EQUAL and NOT_EQUAL to re-entrancy list.	2014-12-07 16:04:57 -05:00
Edward Diener	e1ade3ea3b	Changed explanation of which value should be greater for maximum efficiency.	2014-12-05 00:16:11 -05:00
Edward Diener	3760758d4e	When the Intellisense compiler is being used wihin the Visual Studio IDE, both __EDG__ and __INTELLISENSE__ are defined along with the usual VC++ predefines. This change adjusts the Boost PP configuration to take into account that situation.	2014-11-09 14:20:03 -05:00
Edward Diener	0baf10bfc6	Updated docs to refer to config.hpp rather than variadics.hpp.	2014-11-07 16:35:36 -05:00
Edward Diener	e72b298001	Merge branch 'develop'	2014-10-12 18:29:09 -04:00
Edward Diener	f77c8f2c85	When using clang variadic macro support is now dependent on the C or C++ version system, and not automatically turned on in all situations. This reduces clang warnings.	2014-08-19 00:32:35 -04:00
Edward Diener	9c2ef3ae46	Merge pull request #3 from danieljames/metadata Create metadata file.	2014-08-18 11:36:36 -04:00
Daniel James	1a40a5ea30	Add metadata file.	2014-08-18 15:09:06 +01:00
Edward Diener	15f75eca35	Updated test for "empty" tuple and arrays.	2014-07-21 08:38:07 -04:00
Edward Diener	8924ad016f	Additional tests for "empty" tuples.	2014-07-20 17:40:34 -04:00
Edward Diener	9c478f0c39	Special processing when "empty" single element .	2014-07-20 17:40:02 -04:00
Edward Diener	cee3323340	Corrected link.	2014-07-16 19:30:51 -04:00
Edward Diener	503175a63e	Added copyright and base link back to original macro.	2014-07-03 21:17:20 -04:00
Edward Diener	46ff3eb1f4	Correct line endings.	2014-07-03 21:15:56 -04:00
Edward Diener	04634b402b	Added topics for showing lists of macros which re-enter FOR, REPEAT, and WHILE.	2014-07-03 21:10:26 -04:00
Edward Diener	83f05f5325	Add links tio topics for re-entrancies.	2014-07-03 21:02:11 -04:00
Edward Diener	00d05d4f04	Added links to topics with macros which use re-entrancy versions.	2014-07-03 20:55:39 -04:00
Edward Diener	542bd2653d	Use expand to fix VC++ problem.	2014-07-03 16:59:52 -04:00
Edward Diener	fd36e236bc	get_data not needed.	2014-07-03 16:59:39 -04:00
Edward Diener	c4bf80ee1d	Cleaner inclusion if is_single_return functionality.	2014-07-03 16:59:30 -04:00
Edward Diener	2cea910cd8	Simplify get_data.	2014-07-03 16:59:15 -04:00
Edward Diener	4fc958a89d	Remove special processing for REM_CTOR wsing VC++.	2014-07-03 16:59:05 -04:00
Edward Diener	08c50b219d	Added documentation for is_begin_parens and remove_parens.	2014-07-03 16:58:01 -04:00
Edward Diener	3a472c2084	Updated docs	2014-07-03 16:56:40 -04:00
Edward Diener	4063b1564b	Updated doc for empty array and/or list when converted to other data type.	2014-07-03 16:51:28 -04:00
Edward Diener	b70598c357	Using BOOST_PP_IDENTITY makes code clearer.	2014-07-03 16:51:17 -04:00
Edward Diener	56525c76cc	Change back to original implementation.	2014-07-03 16:50:56 -04:00
Edward Diener	8ac31eb612	Changed BOOST_PP_EMPTY to only use the variadic version when not VC++. Corrected others to use local version of EMPTY.	2014-07-03 16:50:44 -04:00
Edward Diener	f61bb8a80f	Changed functionality so empty arrays/lists when converted to a seq or a tuple expand to nothing.	2014-07-03 16:46:20 -04:00
Edward Diener	df165d9fc6	Added further tests for empty lists and arrays.	2014-07-03 16:46:07 -04:00
Edward Diener	fb732aaab5	Fixes for empty conversions and tests for empty conversions.	2014-07-03 16:45:55 -04:00
Edward Diener	9dfce3363c	Added remove_parens and tests.	2014-07-03 16:45:22 -04:00
Edward Diener	6590e41581	Further tests of changes involving empty data.	2014-07-03 16:45:10 -04:00
Edward Diener	ec93b32f82	Corrected calculation _msc_ver number.	2014-07-03 16:44:56 -04:00
Edward Diener	6c091d7f99	Removed tests which involve undefined behavior.	2014-07-03 16:44:39 -04:00
Edward Diener	b3b9e80f86	Updated tests for strict compilers or VC++	2014-07-03 16:44:27 -04:00
Edward Diener	ea91a3defa	Added variadic is_empty tests.	2014-07-03 16:44:13 -04:00
Edward Diener	4ed6f6e07a	Addition of is_empty tests and changes to rem processing as a workaround to VC++ problem.	2014-07-03 16:44:00 -04:00
Edward Diener	2c7cf9410a	Added variadic version of BOOST_PP_EMPTY and added new is_empty tests.	2014-07-03 16:43:40 -04:00
Edward Diener	975c39b910	Added variadic is_empty and is_begin_parens along with tests.	2014-07-03 16:43:16 -04:00
Edward Diener	f80bb83f3b	Fixes for empty tuple processing	2014-07-03 16:42:26 -04:00
Edward Diener	21ccb35814	Reapply typo fix.	2014-06-17 07:08:04 -04:00
Edward Diener	6b0be3fe4f	Revert "Merge branch 'master' into develop" This reverts commit `1422fce0db`, reversing changes made to `9d2d1fffdf`.	2014-06-16 23:58:35 -04:00
Edward Diener	1422fce0db	Merge branch 'master' into develop	2014-06-16 08:43:38 -04:00
Edward Diener	9d2d1fffdf	Revert use of variadic is_empty.	2014-06-16 07:01:15 -04:00
Edward Diener	60691e3a49	Merge branch 'vcoverload' into develop	2014-06-08 10:21:02 -04:00
Edward Diener	3f75659921	Added documentation for is_begin_parens and remove_parens.	2014-06-08 02:00:24 -04:00
Edward Diener	b43a4708eb	Correct line endings.	2014-06-04 19:38:09 -04:00
Edward Diener	b923dadf19	Merge pull request #2 from coding-po/Bug_8454 #8454. Fixed minor typo in documentation.	2014-06-04 06:53:42 -04:00
Edward Diener	e57370608e	Updated doc for empty array and/or list when converted to other data type.	2014-06-04 06:50:33 -04:00
6recetru	7da3c88d82	#8454 . Fixed minor typo in documentation.	2014-05-26 16:55:07 -07:00
Edward Diener	70e0f2d6e0	Using BOOST_PP_IDENTITY makes code clearer.	2014-05-26 16:36:30 -04:00
Edward Diener	b03d46129c	Change back to original implementation.	2014-05-25 07:53:44 -04:00
Edward Diener	9d308c1b9d	Changed BOOST_PP_EMPTY to only use the variadic version when not VC++. Corrected others to use local version of EMPTY.	2014-05-23 10:23:40 -04:00
Edward Diener	1f16a481c7	Changed functionality so empty arrays/lists when converted to a seq or a tuple expand to nothing.	2014-05-05 20:49:20 -04:00
Edward Diener	181a88db7e	Added further tests for empty lists and arrays.	2014-05-04 23:55:53 -04:00
Edward Diener	697ebcd840	Fixes for empty conversions and tests for empty conversions.	2014-05-04 03:07:00 -04:00
Edward Diener	70e775452a	Added remove_parens and tests.	2014-05-03 02:15:47 -04:00
Edward Diener	dec4cfd273	Further tests of changes involving empty data.	2014-05-02 20:17:08 -04:00
Edward Diener	7da9dbb7a9	Corrected calculation _msc_ver number.	2014-05-02 02:59:10 -04:00
Edward Diener	5c22605c3d	Removed tests which involve undefined behavior.	2014-05-01 23:21:05 -04:00
Edward Diener	4614c62130	Updated tests for strict compilers or VC++	2014-05-01 01:20:12 -04:00
Edward Diener	fe2a9cbfcc	Added variadic is_empty tests.	2014-04-30 16:15:57 -04:00
Edward Diener	c66ea5871f	Addition of is_empty tests and changes to rem processing as a workaround to VC++ problem.	2014-04-30 16:06:49 -04:00
Edward Diener	6fe93a542d	Added variadic version of BOOST_PP_EMPTY and added new is_empty tests.	2014-04-28 22:12:08 -04:00
Edward Diener	d2bfda8308	Added variadic is_empty and is_begin_parens along with tests.	2014-04-28 19:24:42 -04:00
Edward Diener	0a23b4d6a6	Fixes for empty tuple processing	2014-04-27 12:00:13 -04:00