Boost-Commit :

Date view	Thread view	Subject view	Author view

Subject: [Boost-commit] svn:boost r68195 - in sandbox/opaque/libs/opaque/doc: . html
From: vicente.botet_at_[hidden]
Date: 2011-01-16 17:25:35

Next message: joel_at_[hidden]: "[Boost-commit] svn:boost r68196 - in trunk/boost/spirit/home/qi/numeric: . detail"
Previous message: christophe.j.henry_at_[hidden]: "[Boost-commit] svn:boost r68194 - trunk/boost/msm/back"

Author: viboes
Date: 2011-01-16 17:25:22 EST (Sun, 16 Jan 2011)
New Revision: 68195
URL: http://svn.boost.org/trac/boost/changeset/68195

Log:
Boost.Opaque: Update doc

Text files modified:
   sandbox/opaque/libs/opaque/doc/Jamfile.v2 | 5
   sandbox/opaque/libs/opaque/doc/html/index.html | 6644 ++++++++++++++++++++-------------------
   sandbox/opaque/libs/opaque/doc/opaque.qbk | 156
   3 files changed, 3541 insertions(+), 3264 deletions(-)

Modified: sandbox/opaque/libs/opaque/doc/Jamfile.v2
==============================================================================
--- sandbox/opaque/libs/opaque/doc/Jamfile.v2 (original)
+++ sandbox/opaque/libs/opaque/doc/Jamfile.v2 2011-01-16 17:25:22 EST (Sun, 16 Jan 2011)
@@ -51,7 +51,7 @@

 # PDF Options:
 # TOC Generation: this is needed for FOP-0.9 and later:
- #<xsl:param>fop1.extensions=1
+ <xsl:param>fop1.extensions=0
 # Or enable this if you're using XEP:
 <xsl:param>xep.extensions=1
 # TOC generation: this is needed for FOP 0.2, but must not be set to zero for FOP-0.9!
@@ -69,4 +69,7 @@
 # better use SVG's instead:
 <format>pdf:<xsl:param>admon.graphics.extension=".svg"
 <format>pdf:<xsl:param>admon.graphics.path=$(boost-images)/
+ <format>pdf:<xsl:param>boost.url.prefix=http://www.boost.org/doc/libs/release/libs/opaque/doc/html
 ;
+
+install pdf-install : standalone : <location>. <install-type>PDF ;

Modified: sandbox/opaque/libs/opaque/doc/html/index.html
==============================================================================
--- sandbox/opaque/libs/opaque/doc/html/index.html (original)
+++ sandbox/opaque/libs/opaque/doc/html/index.html 2011-01-16 17:25:22 EST (Sun, 16 Jan 2011)
@@ -27,7 +27,7 @@
</h3></div></div></div>
<div>Copyright © 2010 Vicente J. Botet Escriba</div>
<div><div class="legalnotice">
-<a name="id4946181"></a>
+<a name="id4946180"></a>
 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)
 
@@ -84,13 +84,25 @@
</dl></dd>
</dl>
</div>
-<div class="blockquote"><blockquote class="blockquote">
- “Strong type checking is gold; normal type checking is silver; and casting
- is brass”
- </blockquote></div>
-<div class="blockquote"><blockquote class="blockquote">
- -- 
- </blockquote></div>
+<div class="blockquote"><blockquote class="blockquote">
+
+ 
+
+ “Strong type checking is gold; normal type checking is silver; and
+ casting is brass”
+ 
+
+ 
+</blockquote></div>
+<div class="blockquote"><blockquote class="blockquote">
+
+ 
+
+ -- 
+ 
+
+ 
+</blockquote></div>
<div class="warning"><table border="0" summary="Warning">
<tr>
<td rowspan="2" align="center" valign="top" width="25"><img alt="[Warning]" src="../../../../doc/src/images/warning.png"></td>
@@ -109,7 +121,7 @@
<dt>Description</dt>
</dl></div>
<a name="boost.opaque.overview.how_to_use_this_documentation"></a><h3>
-<a name="id4948613"></a>
+<a name="id4948622"></a>
 <a href="index.html#boost.opaque.overview.how_to_use_this_documentation">How to
 Use This Documentation</a>
 </h3>
@@ -118,32 +130,35 @@
 
<div class="itemizedlist"><ul type="disc">
<li>
- Code is in <code class="computeroutput">fixed width
- font</code> and is syntax-highlighted.
- </li>
-<li>
- Replaceable text that you will need to supply is in <code>italics</code>.
- </li>
-<li>
- If a name refers to a free function, it is specified like this: <code class="computeroutput">free_function()</code>;
- that is, it is in code font and its name is followed by <code class="computeroutput">()</code>
- to indicate that it is a free function.
- </li>
-<li>
- If a name refers to a class template, it is specified like this: <code class="computeroutput">class_template<></code>;
- that is, it is in code font and its name is followed by <code class="computeroutput"><></code>
- to indicate that it is a class template.
- </li>
-<li>
- If a name refers to a function-like macro, it is specified like this:
- <code class="computeroutput">MACRO()</code>;
- that is, it is uppercase in code font and its name is followed by <code class="computeroutput">()</code> to indicate that it is a function-like
- macro. Object-like macros appear without the trailing <code class="computeroutput">()</code>.
- </li>
-<li>
- Names that refer to concepts in the generic programming
- sense are specified in CamelCase.
- </li>
+ Code is in <code class="computeroutput">fixed width
+ font</code> and is syntax-highlighted.
+ </li>
+<li>
+ Replaceable text that you will need to supply is in
+ <code>
+ italics
+ </code>
+ .
+ </li>
+<li>
+ If a name refers to a free function, it is specified like this: <code class="computeroutput">free_function()</code>;
+ that is, it is in code font and its name is followed by <code class="computeroutput">()</code>
+ to indicate that it is a free function.
+ </li>
+<li>
+ If a name refers to a class template, it is specified like this: <code class="computeroutput">class_template<></code>;
+ that is, it is in code font and its name is followed by <code class="computeroutput"><></code>
+ to indicate that it is a class template.
+ </li>
+<li>
+ If a name refers to a function-like macro, it is specified like this: <code class="computeroutput">MACRO()</code>;
+ that is, it is uppercase in code font and its name is followed by <code class="computeroutput">()</code> to indicate that it is a function-like
+ macro. Object-like macros appear without the trailing <code class="computeroutput">()</code>.
+ </li>
+<li>
+ Names that refer to concepts in the generic programming
+ sense are specified in CamelCase.
+ </li>
</ul></div>
<div class="note"><table border="0" summary="Note">
<tr>
@@ -158,7 +173,8 @@

 Finally, you can mentally add the following to any code fragments in this document:
 
-<pre class="programlisting">// Include all of the core Opaque files
+<pre class="programlisting">
+// Include all of the core Opaque files
#include <boost/opaque.hpp>

using namespace boost;
@@ -173,16 +189,19 @@
 calls "strong typedefs", but the implementation is not complete.
 

- The Walter E. Brown's proposals () includes a clear motivation for "opaque
- typedefs".
+ The Walter E. Brown's proposals (<a href="http://www.open-std.org/jtc1/sc22/wg21/docs/papers/2005/n1891.pdf" target="_top">N1891: Progress toward Opaque Typedefs for C++0X and
+ N1706: Toward Opaque Typedefs in C++0X</a>)
+ include a clear motivation for "opaque typedefs".
 

- In Alisdair Meredith showed in [] the implicitly generating forwarding constructors
- to a base class new C++0x feature could not be useful to address this issue
- completly. Using this new feature it becomes possible to create something
- very like the required opaque typedef. For example:
+ Alisdair Meredith showed in N2141: Strong Typedefs in C++09(Revisited)
+ that the new C++0x feature that implicitly generates forward constructors
+ to a base class, could not be useful to address this issue completly. Using
+ this new feature it becomes possible to create something very like the required
+ opaque typedef. For example:
 
-<pre class="programlisting">struct MyType : std::string {
+<pre class="programlisting">
+struct MyType : std::string {
 using string::string;
};
</pre>
@@ -193,7 +212,7 @@
 

 As this proposals will not be part of the C++0x standard, a library solution
- that could satisfy most of the requirements seems a loable approach.
+ that could satisfy most of the requirements seems a loable alternative.
 
</div>
<div class="section" lang="en">
@@ -209,25 +228,25 @@
 
<div class="itemizedlist"><ul type="disc">
<li>
- a generic mixin class hierarchy which can be specialized by the user
- to make new opaque classes.
- </li>
+ a generic mixin class hierarchy which can be specialized by the user to
+ make new opaque classes.
+ </li>
<li>
- a generic class hierarchy which can be instantiated by the user to make
- new opaque typedefs.
- </li>
+ a generic class hierarchy which can be instantiated by the user to make
+ new opaque typedefs.
+ </li>
<li>
- a meta-mixin concept that allows to compose in a easy way several aspects
- of a class in an orthogonal way.
- </li>
+ a meta-mixin concept that allows to compose in a easy way several aspects
+ of a class in an orthogonal way.
+ </li>
<li>
- a considerable number of meta-mixins that helps defining new types from
- an underlying type
- </li>
+ a considerable number of meta-mixins that helps defining new types from
+ an underlying type
+ </li>
<li>
- Some helper macros that can reduce the declaration of a new opaque type
- to a single line, emulating the language-based approach.
- </li>
+ Some helper macros that can reduce the declaration of a new opaque type
+ to a single line, emulating the language-based approach.
+ </li>
</ul></div>
</div>
</div>
@@ -283,13 +302,13 @@
 Installing Boost.Opaque</a>
</h4></div></div></div>
<a name="boost.opaque.users_guide.getting_started.install.getting_boost_opaque"></a><h5>
-<a name="id4987337"></a>
+<a name="id4987343"></a>
 <a href="index.html#boost.opaque.users_guide.getting_started.install.getting_boost_opaque">Getting
 Boost.Opaque</a>
 </h5>

 You can get the last stable release of Boost.Opaque
- by downloading <code class="literal">ppaque.zip</code> from the <a href="http://www.boostpro.com/vault/index.php?action=downloadfile&filename=opaque.zip&directory=Utilities&" target="_top">Boost
+ by downloading <code class="literal">opaque.zip</code> from the <a href="http://www.boostpro.com/vault/index.php?action=downloadfile&filename=opaque.zip&directory=Utilities&" target="_top">Boost
 Vault Utilities directory</a>
 

@@ -297,7 +316,7 @@
 Sandbox</a>.
 
<a name="boost.opaque.users_guide.getting_started.install.building_boost_opaque"></a><h5>
-<a name="id4987398"></a>
+<a name="id4987403"></a>
 <a href="index.html#boost.opaque.users_guide.getting_started.install.building_boost_opaque">Building
 Boost.Opaque</a>
 </h5>
@@ -307,7 +326,7 @@
 in your compiler include path.
 
<a name="boost.opaque.users_guide.getting_started.install.requirements"></a><h5>
-<a name="id4987430"></a>
+<a name="id4987435"></a>
 <a href="index.html#boost.opaque.users_guide.getting_started.install.requirements">Requirements</a>
 </h5>

@@ -315,7 +334,7 @@
 (and all libraries it depends on).
 
<a name="boost.opaque.users_guide.getting_started.install.exceptions_safety"></a><h5>
-<a name="id4987461"></a>
+<a name="id4987466"></a>
 <a href="index.html#boost.opaque.users_guide.getting_started.install.exceptions_safety">Exceptions
 safety</a>
 </h5>
@@ -324,7 +343,7 @@
 of exception safety as long as the underlying parameters provide it.
 
<a name="boost.opaque.users_guide.getting_started.install.thread_safety"></a><h5>
-<a name="id4987488"></a>
+<a name="id4987493"></a>
 <a href="index.html#boost.opaque.users_guide.getting_started.install.thread_safety">Thread
 safety</a>
 </h5>
@@ -332,7 +351,7 @@
 All functions in the library are thread-unsafe except when noted explicitly.
 
<a name="boost.opaque.users_guide.getting_started.install.tested_compilers"></a><h5>
-<a name="id4987513"></a>
+<a name="id4987519"></a>
 <a href="index.html#boost.opaque.users_guide.getting_started.install.tested_compilers">Tested
 compilers</a>
 </h5>
@@ -343,39 +362,40 @@

 Windows with
 
-<div class="itemizedlist"><ul type="disc">
-<li>
- MSVC 10.0
- </li>
-<li>
- MSVC 9.0 Express
- </li>
-</ul></div>
+<div class="itemizedlist"><ul type="disc"><li>
+ MSVC 10.0
+ </li></ul></div>

 Cygwin 1.5 with
 
<div class="itemizedlist"><ul type="disc"><li>
- GCC 3.4.4
- </li></ul></div>
+ GCC 3.4.4
+ </li></ul></div>

 Cygwin 1.7 with
 
<div class="itemizedlist"><ul type="disc"><li>
- GCC 4.3.4
- </li></ul></div>
+ GCC 4.3.4
+ </li></ul></div>

 MinGW with
 
<div class="itemizedlist"><ul type="disc">
<li>
- GCC 4.4.0
- </li>
+ GCC 4.4.0
+ </li>
<li>
- GCC 4.5.0
- </li>
+ GCC 4.5.0
+ </li>
<li>
- GCC 4.5.0 C++0x
- </li>
+ GCC 4.5.0 C++0x
+ </li>
+<li>
+ GCC 4.6.0
+ </li>
+<li>
+ GCC 4.6.0 C++0x
+ </li>
</ul></div>
<div class="note"><table border="0" summary="Note">
<tr>
@@ -424,10 +444,11 @@
</h4></div></div></div>

 We will start with the definition of a new type identifier which is based
- on an underlying int type and has the relational operators so it can be
- stored on a sorted container.
+ on an underlying <code class="computeroutput">int</code> type
+ and has the relational operators so it can be stored on a sorted container.
 
-<pre class="programlisting">struct Identifier_tag;
+<pre class="programlisting">
+struct Identifier_tag;
typedef boost::opaque::new_type< int, Identifier_tag,
 boost::mpl::vector<
 opaque::using_totally_ordered1
@@ -438,42 +459,48 @@
 The declaration of a new typedef Identifier is done as follows. We need
 to declare a specific tag that will ensure that two new types are different.
 
-<pre class="programlisting">struct Identifier_tag;
+<pre class="programlisting">
+struct Identifier_tag;
</pre>

- New we use the opaque new_type class which has as parameters:
+ New we use the opaque <code class="computeroutput">new_type</code>
+ class which has as parameters:
 
<div class="itemizedlist"><ul type="disc">
<li>
- the underlying type (<code class="computeroutput">int</code>),
- </li>
+ the underlying type (<code class="computeroutput">int</code>),
+ </li>
<li>
- the unique tag of the new type (<code class="computeroutput">Identifier_tag</code>),
- </li>
+ the unique tag of the <code class="computeroutput">new type</code> (<code class="computeroutput">Identifier_tag</code>),
+ </li>
<li>
- a MPL sequence of additions (<code class="computeroutput">mpl::vector<opaque::using_totally_ordered1></code>)
- </li>
+ a MPL sequence of additions (<code class="computeroutput">mpl::vector<opaque::using_totally_ordered1></code>)
+ </li>
</ul></div>

- This will declare Identifier as new type different from <code class="computeroutput">int</code>
+ This will declare <code class="computeroutput">Identifier</code>
+ as new type different from <code class="computeroutput">int</code>
 that provides just the operation associated to a <code class="computeroutput">totally_ordered</code>
 concept. The concepts are represented by the library in the form a meta-mixin
 and are named with the <code class="computeroutput">using_</code>
 prefix, e.g. as <code class="computeroutput">using_totally_ordered1</code>.
+ We will see later what a meta-mixin intends for.
 

- We can now use Identifier as new int type, but limited to the totally ordered
- operations.
+ We can now use <code class="computeroutput">Identifier</code>
+ as new <code class="computeroutput">int</code> type, but limited
+ to the totally ordered operations.
 

- Boost.Opaque provides a macros to simplify
+ Boost.Opaque provides a macro to simplify
 the preceding declaration
 
-<pre class="programlisting">BOOST_OPAQUE_NEW_TYPE(int, Identifier, ((opaque::using_totally_ordered1)))
+<pre class="programlisting">
+BOOST_OPAQUE_NEW_TYPE(int, Identifier, (opaque::using_totally_ordered1))
</pre>

- The macros is responsable to define a uniqye tag and transform the preprocessor
- PPL sequence into a MPL sequence.
+ The macros is responsable to define a unique tag and transform the preprocessor
+ sequence into a MPL sequence.
 
</div>
<div class="section" lang="en">
@@ -483,11 +510,12 @@
 to define a real new type?</a>
</h4></div></div></div>

- In the prededing example we use a tag to ensure type unicity. When the
- user needs to add yet some specific methods, this tag is no more necessary
+ In the prededing example we have used a tag to ensure type unicity. When
+ the user needs to add yet some specific methods, this tag is no more necessary
 as we need to define already a new class.
 
-<pre class="programlisting">class Identifier : boost::opaque::new_class<Identifier, int,
+<pre class="programlisting">
+class Identifier : boost::opaque::new_class<Identifier, int,
 boost::mpl::vector<
 opaque::using_totally_ordered1
 >
@@ -503,28 +531,29 @@
 
<div class="itemizedlist"><ul type="disc">
<li>
- the class we are defining
- </li>
+ the final class we are defining
+ </li>
<li>
- the underlying type (<code class="computeroutput">int</code>),
- </li>
+ the underlying type (<code class="computeroutput">int</code>),
+ </li>
<li>
- a MPL sequence of additions (<code class="computeroutput">mpl::vector<opaque::using_totally_ordered1></code>)
- </li>
+ a MPL sequence of additions <code class="computeroutput">mpl::vector<opaque::using_totally_ordered1></code>
+</li>
</ul></div>

 Boost.Opaque provides a macro <code class="computeroutput">BOOST_OPAQUE_NEW_CLASS</code> to simplify the
 preceding declaration
 
-<pre class="programlisting">BOOST_OPAQUE_NEW_CLASS(Identifier, int, ((opaque::using_totally_ordered1)))
+<pre class="programlisting">
+BOOST_OPAQUE_NEW_CLASS(Identifier, int, (opaque::using_totally_ordered1))
{
 void print();
 // ...
}
</pre>

- The macros is responsable to define a unique tag and transform the preprocessor
- PPL sequence into a MPL sequence.
+ The macros is responsable to transform the preprocessor sequence into a
+ MPL sequence.
 
</div>
<div class="section" lang="en">
@@ -534,10 +563,11 @@
 type for relational operators: <code class="computeroutput">opaque::boolean</code></a>
</h4></div></div></div>

- The following code doesn't warns in (1) when we use <code class="computeroutput">0</code>
- where a <code class="computeroutput">bool</code> is expected.
+ The following code doesn't warms in (1) when we use the integer <code class="computeroutput">0</code> where a <code class="computeroutput">bool</code>
+ is expected.
 
-<pre class="programlisting">typedef bool Bool;
+<pre class="programlisting">
+typedef bool Bool;
typedef int Int;

Bool f(Int a, Int b)
@@ -551,12 +581,13 @@
 and <code class="computeroutput">false_</code> are accepted
 as constant expressions
 
-<pre class="programlisting">typedef int Int;
+<pre class="programlisting">
+typedef int Int;
typedef opaque::boolean Bool;

Bool f(Int a, Int b)
{
- if(cnd()) return 0; // (1) Error
+ if(cnd()) return 0; // (1) Error
 else return a > b; // (2) Error
}
</pre>
@@ -565,14 +596,15 @@
 is not convertible to <code class="computeroutput">opaque::boolean</code>.
 This can be easily solved
 
-<pre class="programlisting">Bool f(Int a, Int b)
+<pre class="programlisting">
+Bool f(Int a, Int b)
{
- if(cnd()) return opaque::false_; // OK
- else return a > b; // (2) Error
+ if(cnd()) return opaque::false_; // OK
+ else return a > b; // (2) Error
}
</pre>

- But now we also get an error on (2) as <code class="computeroutput">a
+ But we also get an error on (2) as <code class="computeroutput">a
 > b</code>
 is not convertible to <code class="computeroutput">opaque::boolean</code>.
 To solve this issue we need that the signature <code class="computeroutput">Int
@@ -581,10 +613,11 @@
 

 Boost.Opaque provides a meta-mixin that
- allos to define an integer-like class that use <code class="computeroutput">opaque::boolean</code>
+ allow to define an integer-like class that use <code class="computeroutput">opaque::boolean</code>
 as type for the result of the relational operators.
 
-<pre class="programlisting">struct Int_tag;
+<pre class="programlisting">
+struct Int_tag;
typedef boost::opaque::new_type<int, Int_tag, boost::mpl::vector<
 opaque::using_integer_like<opaque::boolean>
> > Int;
@@ -596,7 +629,8 @@

 Or using the macro
 
-<pre class="programlisting">BOOST_OPAQUE_NEW_TYPE(int, Int, ((opaque::using_integer_like<opaque::boolean>)))
+<pre class="programlisting">
+BOOST_OPAQUE_NEW_TYPE(int, Int, (opaque::using_integer_like<opaque::boolean>))
</pre>
</div>
<div class="section" lang="en">
@@ -616,7 +650,8 @@
 This can be done with the <code class="computeroutput">BOOST_OPAQUE_PUBLIC_TYPEDEF</code>
 macro.
 
-<pre class="programlisting">// Listing 1
+<pre class="programlisting">
+// Listing 1
// Cartesian 3D coordinate types
BOOST_OPAQUE_PUBLIC_TYPEDEF(double, X);
BOOST_OPAQUE_PUBLIC_TYPEDEF(double, Y);
@@ -656,11 +691,11 @@
 
<div class="itemizedlist"><ul type="disc">
<li>
- public opaque typedef: implicit conversion to the underlying type
- </li>
+ public opaque typedef: implicit conversion to the underlying type
+ </li>
<li>
- public opaque typedef: explict conversion to the underlying type
- </li>
+ private opaque typedef: explict conversion to the underlying type
+ </li>
</ul></div>
</div>
<div class="section" lang="en">
@@ -672,22 +707,24 @@

 Sometimes we want to inherit most of the operations inherited from the
 underlying type. We can either use the <code class="computeroutput">new_type</code>
- class and bee explicit on which operation we want
+ class and be explicit on which operation we want
 
-<pre class="programlisting">BOOST_OPAQUE_NEW_TYPE(UT, NT, (
+<pre class="programlisting">
+BOOST_OPAQUE_NEW_TYPE(UT, NT,
 (opaque::using_ope1)
 (opaque::using_ope2)
 ...
 (opaque::using_open)
-))
+)
</pre>

- Or we can use opaque types and state explicitly which operation wil be
+ or we can use opaque types and state explicitly which operation will be
 hidden.
 
-<pre class="programlisting">BOOST_OPAQUE_PUBLIC_OPAQUE_TYPE(UT, NT, (
+<pre class="programlisting">
+BOOST_OPAQUE_PUBLIC_OPAQUE_TYPE(UT, NT,
 (opaque::hiding_opeK)
-))
+)
</pre>
</div>
<div class="section" lang="en">
@@ -709,14 +746,66 @@
 UDT as Underlying types</a>
</h4></div></div></div>

- Talk about the problem with direct data access that can not be wrapped
- by the underlying type.
- 
-
 For example we can access the fisrt field of the UT pair, but the OT can
 not give this access. Instead the OT could define some function accessors
 that inderectly will almost behave as the data member.
 
+<pre class="programlisting">
+struct UT {
+ T member_;
+};
+
+UT ut;
+ut.member_ = 88;
+
+
+struct OT : new_class<OT,UT> {
+ T& member() {
+ return underlying().member_;
+ }
+ T member() const {
+ return underlying().member_;
+ }
+};
+
+OT ot;
+//ot.member_=88 // compile-error
+ot.member() = 88;
+</pre>
+
+ For pointer to members, we have the same problem
+ 
+<pre class="programlisting">
+T UT::* pm = &UT::member_;
+UT* utp;
+utp->*pm = 88;
+</pre>
+
+ If UT had overloaded the pointer to member operator, OT should do the same
+ think
+ 
+<pre class="programlisting">
+struct OT : new_class<OT,UT> {
+ T UT::* pmt(T UT::* pm) {
+ return underlying().member_;
+ }
+ T member() const {
+ return underlying().member_;
+ }
+ T& operator->*(T& (OT::* m)()) {
+
+ }
+};
+
+
+T UT::* pm = &UT::member_;
+T& (OT::* pm) = &OT::member;
+UT* utp;
+utp->*pm = 88;
+
+OT* otp;
+otp->*pm() = 88;
+</pre>
</div>
</div>
<div class="section" lang="en">
@@ -735,7 +824,8 @@

 The following template IdentifierGenarator can be used for this propose
 
-<pre class="programlisting">template <typename UT, typename Tag>
+<pre class="programlisting">
+template <typename UT, typename Tag>
struct IdentifierGenarator
{
 typedef boost::opaque::new_type<UT, Tag,
@@ -745,7 +835,8 @@

 The class can be used as follows
 
-<pre class="programlisting">struct ConnectionIdentifierTag {};
+<pre class="programlisting">
+struct ConnectionIdentifierTag {};
typedef IdentifierGenarator<int, ConnectionIdentifierTag>::type ConnectionIdentifier;
</pre>
</div>
@@ -759,26 +850,24 @@
<dl>
<dt>N2141: Strong Typedefs in C++09(Revisited)</dt>
<dd>
- Alisdair Meredith
- </dd>
+ Alisdair Meredith
+ </dd>
<dt>N1891: Progress toward Opaque Typedefs for C++0X</dt>
<dd>
- Walter E. Brown
- </dd>
+ Walter E. Brown
+ </dd>
<dt>N1706: Toward Opaque Typedefs in C++0X</dt>
<dd>
- Walter E. Brown
- </dd>
-<dt><a href="http://www.gimpel.com/html/strong.htm" target="_top">PC-lint/FlexeLint
- Strong Type Checking</a></dt>
+ Walter E. Brown
+ </dd>
+<dt>PC-lint/FlexeLint Strong Type Checking</dt>
<dd>
- Gimpel Software
- </dd>
-<dt><a href="http://www.drdobbs.com/184401633" target="_top">True
- typedefs</a></dt>
+ Gimpel Software
+ </dd>
+<dt>True typedefs</dt>
<dd>
- Matthew Wilson
- </dd>
+ Matthew Wilson
+ </dd>
</dl>
</div>
</div>
@@ -863,7 +952,8 @@

 Include all the opaque public header files.
 
-<pre class="programlisting">#include <boost/opaque/opaque.hpp>
+<pre class="programlisting">
+#include <boost/opaque/opaque.hpp>
</pre>
</div>
<div class="section" lang="en">
@@ -878,7 +968,9 @@
<dt><a href="index.html#boost.opaque.reference.new_class_hpp.opaque_static_cast">
 Non-Member Function Template <code class="computeroutput">opaque_static_cast<></code></a></dt>
</dl></div>
-<pre class="programlisting">namespace boost {
+<pre class="programlisting">
+namespace boost {
+namespace opaque {
 class base_new_type;

 template <
@@ -898,6 +990,7 @@
 >
 T opaque_static_cast(new_class<Final, UT, MetaMixinSeq, Base> const& v);
}
+}
</pre>
<div class="section" lang="en">
<div class="titlepage"><div><div><h4 class="title">
@@ -905,7 +998,8 @@
 Class Template base_new_type<>">
 Class Template <code class="computeroutput">base_new_type<></code></a>
</h4></div></div></div>
-<pre class="programlisting">class base_new_type {};
+<pre class="programlisting">
+class base_new_type {};
</pre>
</div>
<div class="section" lang="en">
@@ -924,23 +1018,24 @@
 
<div class="itemizedlist"><ul type="disc">
<li>
- Can instances of UT be explicitly converted to instances of OT? Yes
- </li>
+ Can instances of UT be explicitly converted to instances of OT? Yes
+ </li>
<li>
- Can instances of convertible to UT be explicitly converted to instances
- of OT? Yes
- </li>
+ Can instances of convertible to UT be explicitly converted to instances
+ of OT? Yes
+ </li>
<li>
- Can instances of UT be implicitly converted to instances of OT? No
- </li>
+ Can instances of UT be implicitly converted to instances of OT? No
+ </li>
<li>
- Can instances of OT be explicitly converted to instances of UT? No
- </li>
+ Can instances of OT be explicitly converted to instances of UT? No
+ </li>
<li>
- Can instances of OT be implicitly converted to instances of UT? No
- </li>
+ Can instances of OT be implicitly converted to instances of UT? No
+ </li>
</ul></div>
-<pre class="programlisting">template <
+<pre class="programlisting">
+template <
 typename Final,
 typename UT,
 typename MetaMixinSeq,
@@ -982,21 +1077,23 @@
 
<div class="itemizedlist"><ul type="disc">
<li>
- <code class="computeroutput">UT</code> must be a model
- of a CopyCOnstructible and Assignable.
- </li>
+<code class="computeroutput">UT</code> must be a model of
+ a <code class="computeroutput">CopyConstructible</code> and
+ <code class="computeroutput">Assignable</code>.
+ </li>
<li>
- <code class="computeroutput">Final</code> must be a model
- of FinalUnderlying.
- </li>
+<code class="computeroutput">Final</code> must be a model
+ of FinalUnderlying.
+ </li>
<li>
- <code class="computeroutput">MetaMixinSeq</code> must be
- a model of FinalUnderlying: defaulted to the empty sequence.
- </li>
+<code class="computeroutput">MetaMixinSeq</code> must be
+ a model of <code class="computeroutput">MetaMixinSeq</code>:
+ defaulted to the empty sequence.
+ </li>
<li>
- <code class="computeroutput">Base</code> is defaulted to
- the base class of all the new types <code class="computeroutput">base_new_type</code>.
- </li>
+<code class="computeroutput">Base</code> is defaulted to
+ the base class of all the new types <code class="computeroutput">base_new_type</code>.
+ </li>
</ul></div>
</div>
<div class="section" lang="en">
@@ -1005,7 +1102,8 @@
 Non-Member Function Template opaque_static_cast<>">
 Non-Member Function Template <code class="computeroutput">opaque_static_cast<></code></a>
</h4></div></div></div>
-<pre class="programlisting">template <
+<pre class="programlisting">
+template <
 typename T,
 typename Final,
 typename UT,
@@ -1019,17 +1117,18 @@
 
<div class="itemizedlist"><ul type="disc">
<li>
- <code class="computeroutput">T</code> and <code class="computeroutput">UT</code> must be a model of a CopyCOnstructible
- and Assignable.
- </li>
+<code class="computeroutput">T</code> and <code class="computeroutput">UT</code>
+ must be a model of a <code class="computeroutput">CopyConstructible</code>
+ and <code class="computeroutput">Assignable</code>.
+ </li>
<li>
- <code class="computeroutput">Final</code> must be a model
- of FinalUnderlying.
- </li>
+<code class="computeroutput">Final</code> must be a model
+ of FinalUnderlying.
+ </li>
<li>
- <code class="computeroutput">MetaMixinSeq</code> must be
- a model of FinalUnderlying.
- </li>
+<code class="computeroutput">MetaMixinSeq</code> must be
+ a model of <code class="computeroutput">MetaMixinSeq</code>.
+ </li>
</ul></div>
</div>
</div>
@@ -1043,13 +1142,17 @@
<dt><a href="index.html#boost.opaque.reference.new_type_hpp.opaque_static_cast">
 Non-Member Function Template Specialization <code class="computeroutput">opaque_static_cast<></code></a></dt>
</dl></div>
-<pre class="programlisting">namespace boost {
+<pre class="programlisting">
+namespace boost {
+namespace opaque {
 template <
 typename UT,
 typename Tag,
 typename MetaMixinSeq=boost::mpl::vector0<>,
 typename Base=base_new_type>
 class new_type;
+}
+}
</pre>
<div class="section" lang="en">
<div class="titlepage"><div><div><h4 class="title">
@@ -1061,7 +1164,8 @@
 <code class="computeroutput">new_type<></code>
 provides the equivalent of <code class="computeroutput">new_class<></code> but can be used as a typedef.
 
-<pre class="programlisting">template <
+<pre class="programlisting">
+template <
 typename UT,
 typename Tag,
 typename MetaMixinSeq,
@@ -1082,21 +1186,23 @@
 
<div class="itemizedlist"><ul type="disc">
<li>
- <code class="computeroutput">UT</code> must be a model
- of a CopyCOnstructible and Assignable.
- </li>
+<code class="computeroutput">UT</code> must be a model of
+ a <code class="computeroutput">CopyConstructible</code> and
+ <code class="computeroutput">Assignable</code>.
+ </li>
<li>
- <code class="computeroutput">Tag</code> must be a unique
- class.
- </li>
+<code class="computeroutput">Tag</code> must be a unique
+ class.
+ </li>
<li>
- <code class="computeroutput">MetaMixinSeq</code> must be
- a model of FinalUnderlying: defaulted to the empty sequence.
- </li>
+<code class="computeroutput">MetaMixinSeq</code> must be
+ a model of <code class="computeroutput">MetaMixinSeq</code>:
+ defaulted to the empty sequence.
+ </li>
<li>
- <code class="computeroutput">Base</code> is defaulted to
- the base class of all the new types <code class="computeroutput">base_new_type</code>.
- </li>
+<code class="computeroutput">Base</code> is defaulted to
+ the base class of all the new types <code class="computeroutput">base_new_type</code>.
+ </li>
</ul></div>
</div>
<div class="section" lang="en">
@@ -1105,7 +1211,8 @@
 Non-Member Function Template Specialization opaque_static_cast<>">
 Non-Member Function Template Specialization <code class="computeroutput">opaque_static_cast<></code></a>
</h4></div></div></div>
-<pre class="programlisting">template <
+<pre class="programlisting">
+template <
 typename T,
 typename UT,
 typename Tag,
@@ -1122,7 +1229,8 @@
</h3></div></div></div>
<div class="toc"><dl><dt><a href="index.html#boost.opaque.reference.boolean_hpp.boolean"> Class
 <code class="computeroutput">boolean</code></a></dt></dl></div>
-<pre class="programlisting">namespace boost {
+<pre class="programlisting">
+namespace boost {
 namespace opaque {
 class boolean;
 }
@@ -1134,7 +1242,8 @@
 boolean"> Class
 <code class="computeroutput">boolean</code></a>
</h4></div></div></div>
-<pre class="programlisting">class boolean {
+<pre class="programlisting">
+class boolean {
public:
 explicit boolean(const bool b);

@@ -1160,7 +1269,9 @@
<dt><a href="index.html#boost.opaque.reference.private_opaque_class_hpp.private_opaque_class">
 Class Template <code class="computeroutput">private_opaque_class<></code></a></dt>
</dl></div>
-<pre class="programlisting">namespace boost {
+<pre class="programlisting">
+namespace boost {
+namespace opaque {
 class base_private_opaque_type;
 template <
 typename Final,
@@ -1170,6 +1281,7 @@
 >
 class private_opaque_class;
}
+}
</pre>
<div class="section" lang="en">
<div class="titlepage"><div><div><h4 class="title">
@@ -1180,7 +1292,8 @@

 This is the base class of all the private opaque types.
 
-<pre class="programlisting">class base_private_opaque_type {};
+<pre class="programlisting">
+class base_private_opaque_type {};
</pre>
</div>
<div class="section" lang="en">
@@ -1194,29 +1307,29 @@
 
<div class="itemizedlist"><ul type="disc">
<li>
- Can instances of UT be explicitly converted to instances of OT? Yes
- </li>
+ Can instances of UT be explicitly converted to instances of OT? Yes
+ </li>
<li>
- Can instances of convertibles to UT be explicitly converted to instances
- of OT? Yes
- </li>
+ Can instances of convertibles to UT be explicitly converted to instances
+ of OT? Yes
+ </li>
<li>
- Can instances of UT be implicitly converted to instances of OT? No
- </li>
+ Can instances of UT be implicitly converted to instances of OT? No
+ </li>
<li>
- Can instances of OT be explicitly converted to instances of UT? Yes.
- </li>
+ Can instances of OT be explicitly converted to instances of UT? Yes.
+ </li>
<li>
- Can instances of OT be explicitly converted to instances of convertible
- to UT? Yes
- </li>
+ Can instances of OT be explicitly converted to instances of convertible
+ to UT? Yes
+ </li>
<li>
- Can instances of OT be implicitly converted to instances of UT? No
- </li>
+ Can instances of OT be implicitly converted to instances of UT? No
+ </li>
<li>
- Can instances of OT be implicitly converted to instances of convertible
- to UT? No
- </li>
+ Can instances of OT be implicitly converted to instances of convertible
+ to UT? No
+ </li>
</ul></div>
<div class="note"><table border="0" summary="Note">
<tr>
@@ -1224,8 +1337,9 @@
<th align="left">Note</th>
</tr>
<tr><td align="left" valign="top">
- Waiting for explicit conversion operators, the explicit conversion must
- be done through the underlying function
+ On compilers don't supporting explicit conversion operators, the explicit
+ conversion must be done through the <code class="computeroutput">underlying</code>
+ function
 </td></tr>
</table></div>

@@ -1237,7 +1351,8 @@
 explicit conversions to all the substituables. The nested typedef <code class="computeroutput">substituables</code> is the MPL sequence of
 all the UT in the opaque type hierarchy.
 
-<pre class="programlisting">template <
+<pre class="programlisting">
+template <
 typename Final,
 typename UT,
 typename MetaMixinSeq,
@@ -1263,6 +1378,7 @@
 explicit private_opaque_class(UT v);
 template <typename W>
 explicit private_opaque_class(W v);
+ explicit operator UT() const;
};
</pre>
</div>
@@ -1275,7 +1391,9 @@
</h3></div></div></div>
<div class="toc"><dl><dt><a href="index.html#boost.opaque.reference.private_opaque_type_hpp.private_opaque_type">
 Class Template <code class="computeroutput">private_opaque_type<></code></a></dt></dl></div>
-<pre class="programlisting">namespace boost {
+<pre class="programlisting">
+namespace boost {
+namespace opaque {
 template <
 typename Final,
 typename UT,
@@ -1284,6 +1402,7 @@
 >
 class private_opaque_type;
}
+}
</pre>
<div class="section" lang="en">
<div class="titlepage"><div><div><h4 class="title">
@@ -1295,7 +1414,8 @@
 <code class="computeroutput">private_opaque_type<></code>
 provides the equivalent of <code class="computeroutput">private_opaque_class<></code> but can be used as a typedef.
 
-<pre class="programlisting">template <
+<pre class="programlisting">
+template <
 typename Final,
 typename UT,
 typename MetaMixinSeq,
@@ -1320,21 +1440,23 @@
 
<div class="itemizedlist"><ul type="disc">
<li>
- <code class="computeroutput">UT</code> must be a model
- of a CopyCOnstructible and Assignable.
- </li>
+<code class="computeroutput">UT</code> must be a model of
+ a <code class="computeroutput">CopyConstructible</code> and
+ <code class="computeroutput">Assignable</code>.
+ </li>
<li>
- <code class="computeroutput">Tag</code> must be a unique
- class.
- </li>
+<code class="computeroutput">Tag</code> must be a unique
+ class.
+ </li>
<li>
- <code class="computeroutput">MetaMixinSeq</code> must be
- a model of FinalUnderlying: defaulted to the empty sequence.
- </li>
+<code class="computeroutput">MetaMixinSeq</code> must be
+ a model of <code class="computeroutput">MetaMixinSeq</code>:
+ defaulted to the empty sequence.
+ </li>
<li>
- <code class="computeroutput">Base</code> is defaulted to
- the base class of all the new types <code class="computeroutput">base_new_type</code>.
- </li>
+<code class="computeroutput">Base</code> is defaulted to
+ the base class of all the new types <code class="computeroutput">base_new_type</code>.
+ </li>
</ul></div>
</div>
</div>
@@ -1352,7 +1474,9 @@
<dt><a href="index.html#boost.opaque.reference.public_opaque_class_hpp.public_opaque_class">
 Class Template <code class="computeroutput">public_opaque_class<></code></a></dt>
</dl></div>
-<pre class="programlisting">namespace boost {
+<pre class="programlisting">
+namespace boost {
+namespace opaque {
 class base_public_opaque_type;

 template <typename T>
@@ -1366,6 +1490,7 @@
 >
 class public_opaque_class;
}
+}
</pre>
<div class="section" lang="en">
<div class="titlepage"><div><div><h4 class="title">
@@ -1376,7 +1501,8 @@

 This is the base class of all the public opaque types.
 
-<pre class="programlisting">class base_public_opaque_type {};
+<pre class="programlisting">
+class base_public_opaque_type {};
</pre>
</div>
<div class="section" lang="en">
@@ -1385,7 +1511,8 @@
 Class Template get_substituables<>">
 Class Template <code class="computeroutput">get_substituables<></code></a>
</h4></div></div></div>
-<pre class="programlisting">template <typename T>
+<pre class="programlisting">
+template <typename T>
struct get_substituables {
 typedef <see below> type;
}
@@ -1406,25 +1533,25 @@
 
<div class="itemizedlist"><ul type="disc">
<li>
- Can instances of UT be explicitly converted to instances of OT? Yes
- </li>
+ Can instances of UT be explicitly converted to instances of OT? Yes
+ </li>
<li>
- Can instances of UT be implicitly converted to instances of OT? No
- </li>
+ Can instances of UT be implicitly converted to instances of OT? No
+ </li>
<li>
- Can instances of OT be explicitly converted to instances of UT? Yes
- </li>
+ Can instances of OT be explicitly converted to instances of UT? Yes
+ </li>
<li>
- Can instances of OT be explicitly converted to instances of convertible
- to UT? Yes
- </li>
+ Can instances of OT be explicitly converted to instances of convertible
+ to UT? Yes
+ </li>
<li>
- Can instances of OT be implicitly converted to instances of UT? Yes
- </li>
+ Can instances of OT be implicitly converted to instances of UT? Yes
+ </li>
<li>
- Can instances of OT be implicitly converted to instances of convertible
- to UT? Yes
- </li>
+ Can instances of OT be implicitly converted to instances of convertible
+ to UT? Yes
+ </li>
</ul></div>

 <code class="computeroutput">public_opaque_class<></code>
@@ -1435,7 +1562,8 @@
 the substituables. The nested typedef <code class="computeroutput">substituables</code>
 is the MPL sequence of all the UT in the opaque type hierarchy.
 
-<pre class="programlisting">template <
+<pre class="programlisting">
+template <
 typename Final,
 typename UT,
 typename MetaMixinSeq=boost::mpl::vector0<>,
@@ -1475,7 +1603,9 @@
</h3></div></div></div>
<div class="toc"><dl><dt><a href="index.html#boost.opaque.reference.public_opaque_type_hpp.public_opaque_type">
 Class Template <code class="computeroutput">public_opaque_type<></code></a></dt></dl></div>
-<pre class="programlisting">namespace boost {
+<pre class="programlisting">
+namespace boost {
+namespace opaque {
 template <
 typename Final,
 typename UT,
@@ -1484,6 +1614,7 @@
 >
 class public_opaque_type;
}
+}
</pre>
<div class="section" lang="en">
<div class="titlepage"><div><div><h4 class="title">
@@ -1492,10 +1623,11 @@
 Class Template <code class="computeroutput">public_opaque_type<></code></a>
</h4></div></div></div>

- <code class="computeroutput">private_opaque_typublic_opaque_typepe<></code> provides the equivalent of <code class="computeroutput">public_opaque_class<></code>
- but can be used as a typedef.
+ <code class="computeroutput">public_opaque_type<></code>
+ provides the equivalent of <code class="computeroutput">public_opaque_class<></code> but can be used as a typedef.
 
-<pre class="programlisting">template <
+<pre class="programlisting">
+template <
 typename Final,
 typename UT,
 typename MetaMixinSeq,
@@ -1520,21 +1652,23 @@
 
<div class="itemizedlist"><ul type="disc">
<li>
- <code class="computeroutput">UT</code> must be a model
- of a CopyCOnstructible and Assignable.
- </li>
+<code class="computeroutput">UT</code> must be a model of
+ a <code class="computeroutput">CopyConstructible</code> and
+ <code class="computeroutput">Assignable</code>.
+ </li>
<li>
- <code class="computeroutput">Tag</code> must be a unique
- class.
- </li>
+<code class="computeroutput">Tag</code> must be a unique
+ class.
+ </li>
<li>
- <code class="computeroutput">MetaMixinSeq</code> must be
- a model of FinalUnderlying: defaulted to the empty sequence.
- </li>
+<code class="computeroutput">MetaMixinSeq</code> must be
+ a model of <code class="computeroutput">MetaMixinSeq</code>:
+ defaulted to the empty sequence.
+ </li>
<li>
- <code class="computeroutput">Base</code> is defaulted to
- the base class of all the new types <code class="computeroutput">base_new_type</code>.
- </li>
+<code class="computeroutput">Base</code> is defaulted to
+ the base class of all the new types <code class="computeroutput">base_new_type</code>.
+ </li>
</ul></div>
</div>
</div>
@@ -1629,13 +1763,14 @@
 
<div class="itemizedlist"><ul type="disc">
<li>
- <code class="computeroutput">Final::final(&b)</code>
- return the <code class="computeroutput">Final&</code> reference associated to <code class="computeroutput">b</code>.
- </li>
-<li>
- <code class="computeroutput">Final::final(&b)</code>
- returns the <code class="computeroutput">const Final&</code> reference associated to <code class="computeroutput">bc</code>.
- </li>
+<code class="computeroutput">Final::final(&b)</code>
+ return the <code class="computeroutput">Final&</code>
+ reference associated to <code class="computeroutput">b</code>.
+ </li>
+<li>
+<code class="computeroutput">Final::final(&b)</code>
+ returns the <code class="computeroutput">const Final&</code> reference associated to <code class="computeroutput">bc</code>.
+ </li>
</ul></div>
</div>
<div class="section" lang="en">
@@ -1652,34 +1787,33 @@
 Let <code class="computeroutput">B</code> a base class of
 <code class="computeroutput">Final</code>, <code class="computeroutput">b</code> an instance of <code class="computeroutput">B</code>,
 <code class="computeroutput">bc</code> an instance of <code class="computeroutput">B const</code>,
- <code class="computeroutput">f</code> an instace of <code class="computeroutput">Final</code> and fc and instance of `Final
- const '.
+ <code class="computeroutput">f</code> an instace of <code class="computeroutput">Final</code> and <code class="computeroutput">fc</code>
+ and instance of `Final const '.
 
<div class="itemizedlist"><ul type="disc">
<li>
- <code class="computeroutput">Final::underlying_type</code> the underlying
- type
- </li>
-<li>
- <code class="computeroutput">Final::underlying(&b)</code>
- return a reference to <code class="computeroutput">Final::underlying_type&</code> associated to <code class="computeroutput">b</code>.
- </li>
-<li>
- <code class="computeroutput">Final::underlying(&bc)</code>
- return a constant reference to <code class="computeroutput">Final::underlying_type
- const&</code>
- associated to <code class="computeroutput">bc</code>.
- </li>
-<li>
- <code class="computeroutput">f.underlying()</code>
- return a reference to <code class="computeroutput">Final::underlying_type&</code> associated to <code class="computeroutput">f</code>.
- </li>
-<li>
- <code class="computeroutput">fc.underlying()</code>
- return a constant reference to <code class="computeroutput">Final::underlying_type
- const&</code>
- associated to <code class="computeroutput">fc</code>.
- </li>
+<code class="computeroutput">Final::underlying_type</code> the underlying type.
+ </li>
+<li>
+<code class="computeroutput">Final::underlying(&b)</code>
+ return a reference to <code class="computeroutput">Final::underlying_type&</code> associated to <code class="computeroutput">b</code>.
+ </li>
+<li>
+<code class="computeroutput">Final::underlying(&bc)</code>
+ return a constant reference to <code class="computeroutput">Final::underlying_type
+ const&</code>
+ associated to <code class="computeroutput">bc</code>.
+ </li>
+<li>
+<code class="computeroutput">f.underlying()</code>
+ return a reference to <code class="computeroutput">Final::underlying_type&</code> associated to <code class="computeroutput">f</code>.
+ </li>
+<li>
+<code class="computeroutput">fc.underlying()</code>
+ return a constant reference to <code class="computeroutput">Final::underlying_type
+ const&</code>
+ associated to <code class="computeroutput">fc</code>.
+ </li>
</ul></div>
</div>
<div class="section" lang="en">
@@ -1690,12 +1824,13 @@
</h5></div></div></div>

 A Mixin is a template class having two template parameters, the Final
- type and the Base type. The Final parameter must satisfy the Final requirements.
+ type and the Base type.
 

 The archetype of a Mixin is
 
-<pre class="programlisting">template <typename Final, typename Base>
+<pre class="programlisting">
+template <typename Final, typename Base>
struct MixinArchetype : Base
{
 ...
@@ -1717,7 +1852,8 @@
 A MetaMixin is a meta-function having as nested type a Mixin. The archetype
 of a MetaMixin is
 
-<pre class="programlisting">struct MetaMixinArchetype {
+<pre class="programlisting">
+struct MetaMixinArchetype {
 template <typename Final, typename Base>
 struct type : Base
 {
@@ -1751,7 +1887,8 @@
</h4></div></div></div>
<div class="toc"><dl><dt><a href="index.html#boost.opaque.reference.meta_mixins.linear_hierarchy_hpp.linear_hierarchy">
 Class Template <code class="computeroutput">linear_hierarchy<></code></a></dt></dl></div>
-<pre class="programlisting">namespace boost {
+<pre class="programlisting">
+namespace boost {
 template<typename MetaMixinSeq, typename Final, typename Base>
 struct linear_hierarchy;
}
@@ -1765,10 +1902,11 @@

 The <code class="computeroutput">linear_hierarchy</code>
 metafunction gererates a linear hierarchy by folding the Mixins obtained
- by application of the <code class="computeroutput">MetaMixin</code>
+ by application of the <code class="computeroutput">MetaMixin</code>s
 in <code class="computeroutput">MetaMixinSeq</code>.
 
-<pre class="programlisting">template<typename MetaMixinSeq, typename Final, typename Base>
+<pre class="programlisting">
+template<typename MetaMixinSeq, typename Final, typename Base>
struct linear_hierarchy {
 typedef <see below> type;
};
@@ -1787,7 +1925,8 @@
</h4></div></div></div>
<div class="toc"><dl><dt><a href="index.html#boost.opaque.reference.meta_mixins.inherited_from_underlying_hpp.inherited_from_underlying">
 Class Template <code class="computeroutput">inherited_from_underlying<></code></a></dt></dl></div>
-<pre class="programlisting">namespace boost {
+<pre class="programlisting">
+namespace boost {
 template <typename T, typename Bool=bool>
 struct inherited_from_underlying;
}
@@ -1798,7 +1937,8 @@
 Class Template inherited_from_underlying<>">
 Class Template <code class="computeroutput">inherited_from_underlying<></code></a>
</h5></div></div></div>
-<pre class="programlisting">template <typename T, typename Bool>
+<pre class="programlisting">
+template <typename T, typename Bool>
struct inherited_from_underlying;
</pre>

@@ -1807,22 +1947,18 @@
 adds wrapping member to the underlyibg type <code class="computeroutput">UT</code>.
 

- This class must specialized for specific types in order to make easier
+ This class must be specialized for specific types in order to make easier
 the construction of opaque types having <code class="computeroutput">UT</code>
 as underlying type. For example the library provide specializations for
- each one of the buil-in types.
+ each one of the built-in types.
 
-<pre class="programlisting">template <typename Bool>
+<pre class="programlisting">
+template <typename Bool>
struct inherited_from_underlying<int> {
 template <typename Final, typename Base>
 struct type; //implementation defined
};
</pre>
-
- template <typename Bool> struct inherited_from_underlying<int>
- { template <typename Final, typename Base> struct type; //implementation
- defined };
- 
</div>
</div>
<div class="section" lang="en">
@@ -1844,8 +1980,8 @@
 Operators</a></dt>
</dl></div>

- This file includes meta-mixins that are used to add un operator overloads
- forwarding from the Final type to the underlying type. There is a meta-mixins
+ This file includes meta-mixins that are used to add an operator overload
+ forwarding from the final type to the underlying type. There is a meta-mixin
 for each one of the C++ overloadable operators.
 

@@ -1882,7 +2018,8 @@

 In the following table the meta-mixin follows the schema
 
-<pre class="programlisting">struct meta-mixins {
+<pre class="programlisting">
+struct meta-mixin {
 template <typename NT, typename Base>
 struct type: Base {
 // Supplied Operation
@@ -1891,32 +2028,42 @@
</pre>
<div class="itemizedlist"><ul type="disc">
<li>
- NT/NT2 is expected to satisfy the FinalUnderlying requirements.
- </li>
+<code class="computeroutput">NT</code>/<code class="computeroutput">NT2</code>
+ is expected to satisfy the <code class="computeroutput">FinalUnderlying</code>
+ requirements.
+ </li>
<li>
- UT stands for NT::underlying_type
- </li>
+<code class="computeroutput">UT</code> stands for <code class="computeroutput">NT::underlying_type</code>.
+ </li>
<li>
- UT2 stands for NT2::underlying_type
- </li>
+<code class="computeroutput">UT2</code> stands for <code class="computeroutput">NT2::underlying_type</code>.
+ </li>
<li>
- this_ut is the instance UT reference obtained NT::underlying(this)
- </li>
+<code class="computeroutput">this_ut</code> is the instance
+ <code class="computeroutput">UT</code> reference obtained
+ <code class="computeroutput">NT::underlying(this)</code>.
+ </li>
<li>
- lhs is a NT/NT2 const reference
- </li>
+<code class="computeroutput">lhs</code> is a <code class="computeroutput">NT</code>/<code class="computeroutput">NT2
+ const</code> reference.
+ </li>
<li>
- rhs is a NT/NT2 const reference
- </li>
+<code class="computeroutput">rhs</code> is a <code class="computeroutput">NT</code>/<code class="computeroutput">NT2
+ const</code> reference.
+ </li>
<li>
- lhs_ut is the instance UT reference obtained lhs.underlying()
- </li>
+<code class="computeroutput">lhs_ut</code> is the instance
+ <code class="computeroutput">UT</code> reference obtained
+ <code class="computeroutput">lhs.underlying()</code>.
+ </li>
<li>
- rhs_ut is the instance UT reference obtained rhs.underlying()
- </li>
+<code class="computeroutput">rhs_ut</code> is the instance
+ <code class="computeroutput">UT</code> reference obtained
+ <code class="computeroutput">rhs.underlying()</code>.
+ </li>
</ul></div>
<div class="table">
-<a name="boost.opaque.reference.meta_mixins.using_operators_hpp.arithmetic_operators.relational_operators"></a>Table 1. Relational operators
+<a name="id5007590"></a>Table 1. Relational operators
<table class="table" summary="Relational operators">
<colgroup>
<col>
@@ -1926,344 +2073,345 @@
</colgroup>
<thead><tr>
<th>
- 
- Meta-Mixin
- 
- </th>
+ 
+ Meta-Mixin
+ 
+ </th>
<th>
- 
- Supplied Operation
- 
- </th>
+ 
+ Supplied Operation
+ 
+ </th>
<th>
- 
- Requirements
- 
- </th>
+ 
+ Requirements
+ 
+ </th>
<th>
- 
- Ref
- 
- </th>
+ 
+ Ref
+ 
+ </th>
</tr></thead>
<tbody>
<tr>
<td>
- 
- <code class="computeroutput">using_equal<Bool></code>
- 
- </td>
+ 
+ <code class="computeroutput">using_equal<Bool></code>
+ 
+ </td>
<td>
- 
- <code class="computeroutput">Bool operator==(const
- NT&
- rhs)
- const</code>
- 
- </td>
+ 
+ <code class="computeroutput">Bool operator==(const
+ NT&
+ rhs)
+ const</code>
+ 
+ </td>
<td>
- 
- <code class="computeroutput">Bool(this_ut ==
- rhs_ut)</code>
- 
- </td>
+ 
+ <code class="computeroutput">Bool(this_ut ==
+ rhs_ut)</code>
+ 
+ </td>
<td>
- 
- 13.5.2
- 
- </td>
+ 
+ 13.5.2
+ 
+ </td>
</tr>
<tr>
<td>
- 
- <code class="computeroutput">using_not_equal<Bool></code>
- 
- </td>
+ 
+ <code class="computeroutput">using_not_equal<Bool></code>
+ 
+ </td>
<td>
- 
- <code class="computeroutput">Bool operator!=(const
- NT&
- rhs)
- const</code>
- 
- </td>
+ 
+ <code class="computeroutput">Bool operator!=(const
+ NT&
+ rhs)
+ const</code>
+ 
+ </td>
<td>
- 
- <code class="computeroutput">Bool(this_ut !=
- rhs_ut)</code>
- 
- </td>
+ 
+ <code class="computeroutput">Bool(this_ut !=
+ rhs_ut)</code>
+ 
+ </td>
<td>
- 
- 13.5.2
- 
- </td>
+ 
+ 13.5.2
+ 
+ </td>
</tr>
<tr>
<td>
- 
- <code class="computeroutput">using_less_than<Bool></code>
- 
- </td>
+ 
+ <code class="computeroutput">using_less_than<Bool></code>
+ 
+ </td>
<td>
- 
- <code class="computeroutput">Bool operator<(const
- NT&
- rhs)
- const</code>
- 
- </td>
+ 
+ <code class="computeroutput">Bool operator<(const
+ NT&
+ rhs)
+ const</code>
+ 
+ </td>
<td>
- 
- <code class="computeroutput">Bool(this_ut <
- rhs_ut)</code>
- 
- </td>
+ 
+ <code class="computeroutput">Bool(this_ut <
+ rhs_ut)</code>
+ 
+ </td>
<td>
- 
- 13.5.2
- 
- </td>
+ 
+ 13.5.2
+ 
+ </td>
</tr>
<tr>
<td>
- 
- <code class="computeroutput">using_less_than_equal<Bool></code>
- 
- </td>
+ 
+ <code class="computeroutput">using_less_than_equal<Bool></code>
+ 
+ </td>
<td>
- 
- <code class="computeroutput">Bool operator<=(const
- NT&
- rhs)
- const</code>
- 
- </td>
+ 
+ <code class="computeroutput">Bool operator<=(const
+ NT&
+ rhs)
+ const</code>
+ 
+ </td>
<td>
- 
- <code class="computeroutput">Bool(this_ut <=
- rhs_ut)</code>
- 
- </td>
+ 
+ <code class="computeroutput">Bool(this_ut <=
+ rhs_ut)</code>
+ 
+ </td>
<td>
- 
- 13.5.2
- 
- </td>
+ 
+ 13.5.2
+ 
+ </td>
</tr>
<tr>
<td>
- 
- <code class="computeroutput">using_greater_than_equal<Bool></code>
- 
- </td>
+ 
+ <code class="computeroutput">using_greater_than_equal<Bool></code>
+ 
+ </td>
<td>
- 
- <code class="computeroutput">Bool operator>=(const
- NT&
- rhs)
- const</code>
- 
- </td>
+ 
+ <code class="computeroutput">Bool operator>=(const
+ NT&
+ rhs)
+ const</code>
+ 
+ </td>
<td>
- 
- <code class="computeroutput">Bool(this_ut >=
- rhs_ut)</code>
- 
- </td>
+ 
+ <code class="computeroutput">Bool(this_ut >=
+ rhs_ut)</code>
+ 
+ </td>
<td>
- 
- 13.5.2
- 
- </td>
+ 
+ 13.5.2
+ 
+ </td>
</tr>
<tr>
<td>
- 
- <code class="computeroutput">using_greater_than<Bool></code>
- 
- </td>
+ 
+ <code class="computeroutput">using_greater_than<Bool></code>
+ 
+ </td>
<td>
- 
- <code class="computeroutput">Bool operator>(const
- NT&
- rhs)
- const</code>
- 
- </td>
+ 
+ <code class="computeroutput">Bool operator>(const
+ NT&
+ rhs)
+ const</code>
+ 
+ </td>
<td>
- 
- <code class="computeroutput">Bool(this_ut >
- rhs_ut)</code>
- 
- </td>
+ 
+ <code class="computeroutput">Bool(this_ut >
+ rhs_ut)</code>
+ 
+ </td>
<td>
- 
- 13.5.2
- 
- </td>
+ 
+ 13.5.2
+ 
+ </td>
</tr>
<tr>
<td>
- 
- <code class="computeroutput">using_equal2<NT2, Bool></code>
- 
- </td>
+ 
+ <code class="computeroutput">using_equal2<NT2,
+ Bool></code>
+ 
+ </td>
<td>
- 
- <code class="computeroutput">Bool operator==(const
- NT2&
- rhs)
- const</code>
- 
- </td>
+ 
+ <code class="computeroutput">Bool operator==(const
+ NT2&
+ rhs)
+ const</code>
+ 
+ </td>
<td>
- 
- <code class="computeroutput">Bool(this_ut ==
- rhs_ut)</code>
- 
- </td>
+ 
+ <code class="computeroutput">Bool(this_ut ==
+ rhs_ut)</code>
+ 
+ </td>
<td>
- 
- 13.5.2
- 
- </td>
+ 
+ 13.5.2
+ 
+ </td>
</tr>
<tr>
<td>
- 
- <code class="computeroutput">using_not_equal2<NT2, Bool></code>
- 
- </td>
+ 
+ <code class="computeroutput">using_not_equal2<NT2, Bool></code>
+ 
+ </td>
<td>
- 
- <code class="computeroutput">Bool operator!=(const
- NT2&
- rhs)
- const</code>
- 
- </td>
+ 
+ <code class="computeroutput">Bool operator!=(const
+ NT2&
+ rhs)
+ const</code>
+ 
+ </td>
<td>
- 
- <code class="computeroutput">Bool(this_ut !=
- rhs_ut)</code>
- 
- </td>
+ 
+ <code class="computeroutput">Bool(this_ut !=
+ rhs_ut)</code>
+ 
+ </td>
<td>
- 
- 13.5.2
- 
- </td>
+ 
+ 13.5.2
+ 
+ </td>
</tr>
<tr>
<td>
- 
- <code class="computeroutput">using_less_than2<NT2, Bool></code>
- 
- </td>
+ 
+ <code class="computeroutput">using_less_than2<NT2, Bool></code>
+ 
+ </td>
<td>
- 
- <code class="computeroutput">Bool operator<(const
- NT&
- rhs)
- const</code>
- 
- </td>
+ 
+ <code class="computeroutput">Bool operator<(const
+ NT&
+ rhs)
+ const</code>
+ 
+ </td>
<td>
- 
- <code class="computeroutput">Bool(this_ut <
- rhs_ut)</code>
- 
- </td>
+ 
+ <code class="computeroutput">Bool(this_ut <
+ rhs_ut)</code>
+ 
+ </td>
<td>
- 
- 13.5.2
- 
- </td>
+ 
+ 13.5.2
+ 
+ </td>
</tr>
<tr>
<td>
- 
- <code class="computeroutput">using_less_than_equal2<NT2, Bool></code>
- 
- </td>
+ 
+ <code class="computeroutput">using_less_than_equal2<NT2, Bool></code>
+ 
+ </td>
<td>
- 
- <code class="computeroutput">Bool operator<=(const
- NT2&
- rhs)
- const</code>
- 
- </td>
+ 
+ <code class="computeroutput">Bool operator<=(const
+ NT2&
+ rhs)
+ const</code>
+ 
+ </td>
<td>
- 
- <code class="computeroutput">Bool(this_ut <=
- rhs_ut)</code>
- 
- </td>
+ 
+ <code class="computeroutput">Bool(this_ut <=
+ rhs_ut)</code>
+ 
+ </td>
<td>
- 
- 13.5.2
- 
- </td>
+ 
+ 13.5.2
+ 
+ </td>
</tr>
<tr>
<td>
- 
- <code class="computeroutput">using_greater_than_equal2<NT2, Bool></code>
- 
- </td>
+ 
+ <code class="computeroutput">using_greater_than_equal2<NT2, Bool></code>
+ 
+ </td>
<td>
- 
- <code class="computeroutput">Bool operator>=(const
- NT2&
- rhs)
- const</code>
- 
- </td>
+ 
+ <code class="computeroutput">Bool operator>=(const
+ NT2&
+ rhs)
+ const</code>
+ 
+ </td>
<td>
- 
- <code class="computeroutput">Bool(this_ut >=
- rhs_ut)</code>
- 
- </td>
+ 
+ <code class="computeroutput">Bool(this_ut >=
+ rhs_ut)</code>
+ 
+ </td>
<td>
- 
- 13.5.2
- 
- </td>
+ 
+ 13.5.2
+ 
+ </td>
</tr>
<tr>
<td>
- 
- <code class="computeroutput">using_greater_than2<NT2, Bool></code>
- 
- </td>
+ 
+ <code class="computeroutput">using_greater_than2<NT2, Bool></code>
+ 
+ </td>
<td>
- 
- <code class="computeroutput">Bool operator>(const
- NT2&
- rhs)
- const</code>
- 
- </td>
+ 
+ <code class="computeroutput">Bool operator>(const
+ NT2&
+ rhs)
+ const</code>
+ 
+ </td>
<td>
- 
- <code class="computeroutput">Bool(this_ut >
- rhs_ut)</code>
- 
- </td>
+ 
+ <code class="computeroutput">Bool(this_ut >
+ rhs_ut)</code>
+ 
+ </td>
<td>
- 
- 13.5.2
- 
- </td>
+ 
+ 13.5.2
+ 
+ </td>
</tr>
</tbody>
</table>
</div>
<div class="table">
-<a name="boost.opaque.reference.meta_mixins.using_operators_hpp.arithmetic_operators.numeric_operators"></a>Table 2. Numeric operators
+<a name="id5009354"></a>Table 2. Numeric operators
<table class="table" summary="Numeric operators">
<colgroup>
<col>
@@ -2273,666 +2421,666 @@
</colgroup>
<thead><tr>
<th>
- 
- Meta-Mixin
- 
- </th>
+ 
+ Meta-Mixin
+ 
+ </th>
<th>
- 
- Supplied Operation
- 
- </th>
+ 
+ Supplied Operation
+ 
+ </th>
<th>
- 
- Requirements
- 
- </th>
+ 
+ Requirements
+ 
+ </th>
<th>
- 
- Ref
- 
- </th>
+ 
+ Ref
+ 
+ </th>
</tr></thead>
<tbody>
<tr>
<td>
- 
- <code class="computeroutput">using_plus</code>
- 
- </td>
+ 
+ <code class="computeroutput">using_plus</code>
+ 
+ </td>
<td>
- 
- <code class="computeroutput">NT operator+(const
- NT&
- rhs)
- const</code>
- 
- </td>
+ 
+ <code class="computeroutput">NT operator+(const
+ NT&
+ rhs)
+ const</code>
+ 
+ </td>
<td>
- 
- <code class="computeroutput">NT(this_ut +
- rhs_ut)</code>
- 
- </td>
+ 
+ <code class="computeroutput">NT(this_ut +
+ rhs_ut)</code>
+ 
+ </td>
<td>
- 
- 13.5.2
- 
- </td>
+ 
+ 13.5.2
+ 
+ </td>
</tr>
<tr>
<td>
- 
- <code class="computeroutput">using_plus_assign</code>
- 
- </td>
+ 
+ <code class="computeroutput">using_plus_assign</code>
+ 
+ </td>
<td>
- 
- <code class="computeroutput">NT&
- operator+=(const NT& rhs)</code>
- 
- </td>
+ 
+ <code class="computeroutput">NT&
+ operator+=(const NT& rhs)</code>
+ 
+ </td>
<td>
- 
- <code class="computeroutput">this_ut +=
- rhs_ut</code>
- 
- </td>
+ 
+ <code class="computeroutput">this_ut +=
+ rhs_ut</code>
+ 
+ </td>
<td>
- 
- 13.5.2
- 
- </td>
+ 
+ 13.5.2
+ 
+ </td>
</tr>
<tr>
<td>
- 
- <code class="computeroutput">using_minus</code>
- 
- </td>
+ 
+ <code class="computeroutput">using_minus</code>
+ 
+ </td>
<td>
- 
- <code class="computeroutput">NT operator-(const
- NT&
- rhs)
- const</code>
- 
- </td>
+ 
+ <code class="computeroutput">NT operator-(const
+ NT&
+ rhs)
+ const</code>
+ 
+ </td>
<td>
- 
- <code class="computeroutput">NT(this_ut -
- rhs_ut)</code>
- 
- </td>
+ 
+ <code class="computeroutput">NT(this_ut -
+ rhs_ut)</code>
+ 
+ </td>
<td>
- 
- 13.5.2
- 
- </td>
+ 
+ 13.5.2
+ 
+ </td>
</tr>
<tr>
<td>
- 
- <code class="computeroutput">using_minus_assign</code>
- 
- </td>
+ 
+ <code class="computeroutput">using_minus_assign</code>
+ 
+ </td>
<td>
- 
- <code class="computeroutput">NT&
- operator-=(const NT& rhs)</code>
- 
- </td>
+ 
+ <code class="computeroutput">NT&
+ operator-=(const NT& rhs)</code>
+ 
+ </td>
<td>
- 
- <code class="computeroutput">this_ut -=
- rhs_ut</code>
- 
- </td>
+ 
+ <code class="computeroutput">this_ut -=
+ rhs_ut</code>
+ 
+ </td>
<td>
- 
- 13.5.2
- 
- </td>
+ 
+ 13.5.2
+ 
+ </td>
</tr>
<tr>
<td>
- 
- <code class="computeroutput">using_multiply</code>
- 
- </td>
+ 
+ <code class="computeroutput">using_multiply</code>
+ 
+ </td>
<td>
- 
- <code class="computeroutput">NT operator*(const
- NT&
- rhs)
- const</code>
- 
- </td>
+ 
+ <code class="computeroutput">NT operator*(const
+ NT&
+ rhs)
+ const</code>
+ 
+ </td>
<td>
- 
- <code class="computeroutput">NT(this_ut *
- rhs_ut)</code>
- 
- </td>
+ 
+ <code class="computeroutput">NT(this_ut *
+ rhs_ut)</code>
+ 
+ </td>
<td>
- 
- 13.5.2
- 
- </td>
+ 
+ 13.5.2
+ 
+ </td>
</tr>
<tr>
<td>
- 
- <code class="computeroutput">using_multiply_assign</code>
- 
- </td>
+ 
+ <code class="computeroutput">using_multiply_assign</code>
+ 
+ </td>
<td>
- 
- <code class="computeroutput">NT&
- operator*=(const NT& rhs)</code>
- 
- </td>
+ 
+ <code class="computeroutput">NT&
+ operator*=(const NT& rhs)</code>
+ 
+ </td>
<td>
- 
- <code class="computeroutput">this_ut *=
- rhs_ut</code>
- 
- </td>
+ 
+ <code class="computeroutput">this_ut *=
+ rhs_ut</code>
+ 
+ </td>
<td>
- 
- 13.5.2
- 
- </td>
+ 
+ 13.5.2
+ 
+ </td>
</tr>
<tr>
<td>
- 
- <code class="computeroutput">using_divide</code>
- 
- </td>
+ 
+ <code class="computeroutput">using_divide</code>
+ 
+ </td>
<td>
- 
- <code class="computeroutput">NT operator/(const
- NT&
- rhs)
- const</code>
- 
- </td>
+ 
+ <code class="computeroutput">NT operator/(const
+ NT&
+ rhs)
+ const</code>
+ 
+ </td>
<td>
- 
- <code class="computeroutput">NT(this_ut /
- rhs_ut)</code>
- 
- </td>
+ 
+ <code class="computeroutput">NT(this_ut /
+ rhs_ut)</code>
+ 
+ </td>
<td>
- 
- 13.5.2
- 
- </td>
+ 
+ 13.5.2
+ 
+ </td>
</tr>
<tr>
<td>
- 
- <code class="computeroutput">using_divide_assign</code>
- 
- </td>
+ 
+ <code class="computeroutput">using_divide_assign</code>
+ 
+ </td>
<td>
- 
- <code class="computeroutput">NT&
- operator/=(const NT& rhs)</code>
- 
- </td>
+ 
+ <code class="computeroutput">NT&
+ operator/=(const NT& rhs)</code>
+ 
+ </td>
<td>
- 
- <code class="computeroutput">this_ut /=
- rhs_ut</code>
- 
- </td>
+ 
+ <code class="computeroutput">this_ut /=
+ rhs_ut</code>
+ 
+ </td>
<td>
- 
- 13.5.2
- 
- </td>
+ 
+ 13.5.2
+ 
+ </td>
</tr>
<tr>
<td>
- 
- <code class="computeroutput">using_modulus</code>
- 
- </td>
+ 
+ <code class="computeroutput">using_modulus</code>
+ 
+ </td>
<td>
- 
- <code class="computeroutput">NT operator%(const
- NT&
- rhs)
- const</code>
- 
- </td>
+ 
+ <code class="computeroutput">NT operator%(const
+ NT&
+ rhs)
+ const</code>
+ 
+ </td>
<td>
- 
- <code class="computeroutput">NT(this_ut %
- rhs_ut)</code>
- 
- </td>
+ 
+ <code class="computeroutput">NT(this_ut %
+ rhs_ut)</code>
+ 
+ </td>
<td>
- 
- 13.5.2
- 
- </td>
+ 
+ 13.5.2
+ 
+ </td>
</tr>
<tr>
<td>
- 
- <code class="computeroutput">using_modulus_assign</code>
- 
- </td>
+ 
+ <code class="computeroutput">using_modulus_assign</code>
+ 
+ </td>
<td>
- 
- <code class="computeroutput">NT&
- operator%=(const NT& rhs)</code>
- 
- </td>
+ 
+ <code class="computeroutput">NT&
+ operator%=(const NT& rhs)</code>
+ 
+ </td>
<td>
- 
- <code class="computeroutput">this_ut %=
- rhs_ut</code>
- 
- </td>
+ 
+ <code class="computeroutput">this_ut %=
+ rhs_ut</code>
+ 
+ </td>
<td>
- 
- 13.5.2
- 
- </td>
+ 
+ 13.5.2
+ 
+ </td>
</tr>
<tr>
<td>
- 
- <code class="computeroutput">using_unary_plus</code>
- 
- </td>
+ 
+ <code class="computeroutput">using_unary_plus</code>
+ 
+ </td>
<td>
- 
- <code class="computeroutput">NT operator+() const</code>
- 
- </td>
+ 
+ <code class="computeroutput">NT operator+() const</code>
+ 
+ </td>
<td>
- 
- <code class="computeroutput">NT(+this_ut)</code>
- 
- </td>
+ 
+ <code class="computeroutput">NT(+this_ut)</code>
+ 
+ </td>
<td>
- 
- 13.5.1
- 
- </td>
+ 
+ 13.5.1
+ 
+ </td>
</tr>
<tr>
<td>
- 
- <code class="computeroutput">using_unary_minus</code>
- 
- </td>
+ 
+ <code class="computeroutput">using_unary_minus</code>
+ 
+ </td>
<td>
- 
- <code class="computeroutput">NT operator-() const</code>
- 
- </td>
+ 
+ <code class="computeroutput">NT operator-() const</code>
+ 
+ </td>
<td>
- 
- <code class="computeroutput">NT(-this_ut)</code>
- 
- </td>
+ 
+ <code class="computeroutput">NT(-this_ut)</code>
+ 
+ </td>
<td>
- 
- 13.5.1
- 
- </td>
+ 
+ 13.5.1
+ 
+ </td>
</tr>
<tr>
<td>
- 
- <code class="computeroutput">using_pre_increment</code>
- 
- </td>
+ 
+ <code class="computeroutput">using_pre_increment</code>
+ 
+ </td>
<td>
- 
- <code class="computeroutput">NT&
- operator++()</code>
- 
- </td>
+ 
+ <code class="computeroutput">NT&
+ operator++()</code>
+ 
+ </td>
<td>
- 
- <code class="computeroutput">++this_ut</code>
- 
- </td>
+ 
+ <code class="computeroutput">++this_ut</code>
+ 
+ </td>
<td>
- 
- 13.5.1
- 
- </td>
+ 
+ 13.5.1
+ 
+ </td>
</tr>
<tr>
<td>
- 
- <code class="computeroutput">using_pre_decrement</code>
- 
- </td>
+ 
+ <code class="computeroutput">using_pre_decrement</code>
+ 
+ </td>
<td>
- 
- <code class="computeroutput">NT&
- operator--()</code>
- 
- </td>
+ 
+ <code class="computeroutput">NT&
+ operator--()</code>
+ 
+ </td>
<td>
- 
- <code class="computeroutput">--this_ut</code>
- 
- </td>
+ 
+ <code class="computeroutput">--this_ut</code>
+ 
+ </td>
<td>
- 
- 13.5.1
- 
- </td>
+ 
+ 13.5.1
+ 
+ </td>
</tr>
<tr>
<td>
- 
- <code class="computeroutput">using_post_increment</code>
- 
- </td>
+ 
+ <code class="computeroutput">using_post_increment</code>
+ 
+ </td>
<td>
- 
- <code class="computeroutput">NT operator++(int) const</code>
- 
- </td>
+ 
+ <code class="computeroutput">NT operator++(int) const</code>
+ 
+ </td>
<td>
- 
- <code class="computeroutput">this_ut++</code>
- 
- </td>
+ 
+ <code class="computeroutput">this_ut++</code>
+ 
+ </td>
<td>
- 
- 13.5.1
- 
- </td>
+ 
+ 13.5.1
+ 
+ </td>
</tr>
<tr>
<td>
- 
- <code class="computeroutput">using_post_decrement</code>
- 
- </td>
+ 
+ <code class="computeroutput">using_post_decrement</code>
+ 
+ </td>
<td>
- 
- <code class="computeroutput">NT operator--(int) const</code>
- 
- </td>
+ 
+ <code class="computeroutput">NT operator--(int) const</code>
+ 
+ </td>
<td>
- 
- <code class="computeroutput">this_ut++</code>
- 
- </td>
+ 
+ <code class="computeroutput">this_ut++</code>
+ 
+ </td>
<td>
- 
- 13.5.1
- 
- </td>
+ 
+ 13.5.1
+ 
+ </td>
</tr>
<tr>
<td>
- 
- <code class="computeroutput">using_plus2<NT2></code>
- 
- </td>
+ 
+ <code class="computeroutput">using_plus2<NT2></code>
+ 
+ </td>
<td>
- 
- <code class="computeroutput">NT operator+(const
- NT2&
- rhs)
- const</code>
- 
- </td>
+ 
+ <code class="computeroutput">NT operator+(const
+ NT2&
+ rhs)
+ const</code>
+ 
+ </td>
<td>
- 
- <code class="computeroutput">NT(this_ut +
- rhs_ut)</code>
- 
- </td>
+ 
+ <code class="computeroutput">NT(this_ut +
+ rhs_ut)</code>
+ 
+ </td>
<td>
- 
- 13.5.2
- 
- </td>
+ 
+ 13.5.2
+ 
+ </td>
</tr>
<tr>
<td>
- 
- <code class="computeroutput">using_plus_assign2<NT2></code>
- 
- </td>
+ 
+ <code class="computeroutput">using_plus_assign2<NT2></code>
+ 
+ </td>
<td>
- 
- <code class="computeroutput">NT&
- operator+=(const NT2& rhs)</code>
- 
- </td>
+ 
+ <code class="computeroutput">NT&
+ operator+=(const NT2& rhs)</code>
+ 
+ </td>
<td>
- 
- <code class="computeroutput">this_ut +=
- rhs_ut</code>
- 
- </td>
+ 
+ <code class="computeroutput">this_ut +=
+ rhs_ut</code>
+ 
+ </td>
<td>
- 
- 13.5.2
- 
- </td>
+ 
+ 13.5.2
+ 
+ </td>
</tr>
<tr>
<td>
- 
- <code class="computeroutput">using_minus2<NT2></code>
- 
- </td>
+ 
+ <code class="computeroutput">using_minus2<NT2></code>
+ 
+ </td>
<td>
- 
- <code class="computeroutput">NT operator-(const
- NT2&
- rhs)
- const</code>
- 
- </td>
+ 
+ <code class="computeroutput">NT operator-(const
+ NT2&
+ rhs)
+ const</code>
+ 
+ </td>
<td>
- 
- <code class="computeroutput">NT(this_ut -
- rhs_ut)</code>
- 
- </td>
+ 
+ <code class="computeroutput">NT(this_ut -
+ rhs_ut)</code>
+ 
+ </td>
<td>
- 
- 13.5.2
- 
- </td>
+ 
+ 13.5.2
+ 
+ </td>
</tr>
<tr>
<td>
- 
- <code class="computeroutput">using_minus_assign2<NT2></code>
- 
- </td>
+ 
+ <code class="computeroutput">using_minus_assign2<NT2></code>
+ 
+ </td>
<td>
- 
- <code class="computeroutput">NT&
- operator-=(const NT2& rhs)</code>
- 
- </td>
+ 
+ <code class="computeroutput">NT&
+ operator-=(const NT2& rhs)</code>
+ 
+ </td>
<td>
- 
- <code class="computeroutput">this_ut -=
- rhs_ut</code>
- 
- </td>
+ 
+ <code class="computeroutput">this_ut -=
+ rhs_ut</code>
+ 
+ </td>
<td>
- 
- 13.5.2
- 
- </td>
+ 
+ 13.5.2
+ 
+ </td>
</tr>
<tr>
<td>
- 
- <code class="computeroutput">using_multiply2<NT2></code>
- 
- </td>
+ 
+ <code class="computeroutput">using_multiply2<NT2></code>
+ 
+ </td>
<td>
- 
- <code class="computeroutput">NT operator*(const
- NT2&
- rhs)
- const</code>
- 
- </td>
+ 
+ <code class="computeroutput">NT operator*(const
+ NT2&
+ rhs)
+ const</code>
+ 
+ </td>
<td>
- 
- <code class="computeroutput">NT(this_ut *
- rhs_ut)</code>
- 
- </td>
+ 
+ <code class="computeroutput">NT(this_ut *
+ rhs_ut)</code>
+ 
+ </td>
<td>
- 
- 13.5.2
- 
- </td>
+ 
+ 13.5.2
+ 
+ </td>
</tr>
<tr>
<td>
- 
- <code class="computeroutput">using_multiply_assign2<NT2></code>
- 
- </td>
+ 
+ <code class="computeroutput">using_multiply_assign2<NT2></code>
+ 
+ </td>
<td>
- 
- <code class="computeroutput">NT&
- operator*=(const NT2& rhs)</code>
- 
- </td>
+ 
+ <code class="computeroutput">NT&
+ operator*=(const NT2& rhs)</code>
+ 
+ </td>
<td>
- 
- <code class="computeroutput">this_ut *=
- rhs_ut</code>
- 
- </td>
+ 
+ <code class="computeroutput">this_ut *=
+ rhs_ut</code>
+ 
+ </td>
<td>
- 
- 13.5.2
- 
- </td>
+ 
+ 13.5.2
+ 
+ </td>
</tr>
<tr>
<td>
- 
- <code class="computeroutput">using_divide2<NT2></code>
- 
- </td>
+ 
+ <code class="computeroutput">using_divide2<NT2></code>
+ 
+ </td>
<td>
- 
- <code class="computeroutput">NT operator/(const
- NT2&
- rhs)
- const</code>
- 
- </td>
+ 
+ <code class="computeroutput">NT operator/(const
+ NT2&
+ rhs)
+ const</code>
+ 
+ </td>
<td>
- 
- <code class="computeroutput">NT(this_ut /
- rhs_ut)</code>
- 
- </td>
+ 
+ <code class="computeroutput">NT(this_ut /
+ rhs_ut)</code>
+ 
+ </td>
<td>
- 
- 13.5.2
- 
- </td>
+ 
+ 13.5.2
+ 
+ </td>
</tr>
<tr>
<td>
- 
- <code class="computeroutput">using_divide_assign2<NT2></code>
- 
- </td>
+ 
+ <code class="computeroutput">using_divide_assign2<NT2></code>
+ 
+ </td>
<td>
- 
- <code class="computeroutput">NT&
- operator/=(const NT2& rhs)</code>
- 
- </td>
+ 
+ <code class="computeroutput">NT&
+ operator/=(const NT2& rhs)</code>
+ 
+ </td>
<td>
- 
- <code class="computeroutput">this_ut /=
- rhs_ut</code>
- 
- </td>
+ 
+ <code class="computeroutput">this_ut /=
+ rhs_ut</code>
+ 
+ </td>
<td>
- 
- 13.5.2
- 
- </td>
+ 
+ 13.5.2
+ 
+ </td>
</tr>
<tr>
<td>
- 
- <code class="computeroutput">using_modulus2<NT2></code>
- 
- </td>
+ 
+ <code class="computeroutput">using_modulus2<NT2></code>
+ 
+ </td>
<td>
- 
- <code class="computeroutput">NT operator%(const
- NT2&
- rhs)
- const</code>
- 
- </td>
+ 
+ <code class="computeroutput">NT operator%(const
+ NT2&
+ rhs)
+ const</code>
+ 
+ </td>
<td>
- 
- <code class="computeroutput">NT(this_ut %
- rhs_ut)</code>
- 
- </td>
+ 
+ <code class="computeroutput">NT(this_ut %
+ rhs_ut)</code>
+ 
+ </td>
<td>
- 
- 13.5.2
- 
- </td>
+ 
+ 13.5.2
+ 
+ </td>
</tr>
<tr>
<td>
- 
- <code class="computeroutput">using_modulus_assign2<NT2></code>
- 
- </td>
+ 
+ <code class="computeroutput">using_modulus_assign2<NT2></code>
+ 
+ </td>
<td>
- 
- <code class="computeroutput">NT&
- operator%=(const NT2& rhs)</code>
- 
- </td>
+ 
+ <code class="computeroutput">NT&
+ operator%=(const NT2& rhs)</code>
+ 
+ </td>
<td>
- 
- <code class="computeroutput">this_ut %=
- rhs_ut</code>
- 
- </td>
+ 
+ <code class="computeroutput">this_ut %=
+ rhs_ut</code>
+ 
+ </td>
<td>
- 
- 13.5.2
- 
- </td>
+ 
+ 13.5.2
+ 
+ </td>
</tr>
</tbody>
</table>
</div>
<div class="table">
-<a name="boost.opaque.reference.meta_mixins.using_operators_hpp.arithmetic_operators.bitwise_operators"></a>Table 3. Bitwise operators
+<a name="id5012357"></a>Table 3. Bitwise operators
<table class="table" summary="Bitwise operators">
<colgroup>
<col>
@@ -2942,548 +3090,548 @@
</colgroup>
<thead><tr>
<th>
- 
- Meta-Mixin
- 
- </th>
+ 
+ Meta-Mixin
+ 
+ </th>
<th>
- 
- Supplied Operation
- 
- </th>
+ 
+ Supplied Operation
+ 
+ </th>
<th>
- 
- Requirements
- 
- </th>
+ 
+ Requirements
+ 
+ </th>
<th>
- 
- Ref
- 
- </th>
+ 
+ Ref
+ 
+ </th>
</tr></thead>
<tbody>
<tr>
<td>
- 
- <code class="computeroutput">using_bitwise_not</code>
- 
- </td>
+ 
+ <code class="computeroutput">using_bitwise_not</code>
+ 
+ </td>
<td>
- 
- <code class="computeroutput">NT operator~() const</code>
- 
- </td>
+ 
+ <code class="computeroutput">NT operator~() const</code>
+ 
+ </td>
<td>
- 
- <code class="computeroutput">NT(~this_ut)</code>
- 
- </td>
+ 
+ <code class="computeroutput">NT(~this_ut)</code>
+ 
+ </td>
<td>
- 
- 13.5.1
- 
- </td>
+ 
+ 13.5.1
+ 
+ </td>
</tr>
<tr>
<td>
- 
- <code class="computeroutput">using_bitwise_xor_assign</code>
- 
- </td>
+ 
+ <code class="computeroutput">using_bitwise_xor_assign</code>
+ 
+ </td>
<td>
- 
- <code class="computeroutput">NT&
- operator^=(const NT& rhs)</code>
- 
- </td>
+ 
+ <code class="computeroutput">NT&
+ operator^=(const NT& rhs)</code>
+ 
+ </td>
<td>
- 
- <code class="computeroutput">this_ut ^=
- rhs_ut</code>
- 
- </td>
+ 
+ <code class="computeroutput">this_ut ^=
+ rhs_ut</code>
+ 
+ </td>
<td>
- 
- 13.5.2
- 
- </td>
+ 
+ 13.5.2
+ 
+ </td>
</tr>
<tr>
<td>
- 
- <code class="computeroutput">using_bitwise_and_assign</code>
- 
- </td>
+ 
+ <code class="computeroutput">using_bitwise_and_assign</code>
+ 
+ </td>
<td>
- 
- <code class="computeroutput">NT&
- operator&=(const NT& rhs)</code>
- 
- </td>
+ 
+ <code class="computeroutput">NT&
+ operator&=(const NT& rhs)</code>
+ 
+ </td>
<td>
- 
- <code class="computeroutput">this_ut &=
- rhs_ut</code>
- 
- </td>
+ 
+ <code class="computeroutput">this_ut &=
+ rhs_ut</code>
+ 
+ </td>
<td>
- 
- 13.5.2
- 
- </td>
+ 
+ 13.5.2
+ 
+ </td>
</tr>
<tr>
<td>
- 
- <code class="computeroutput">using_bitwise_or_assign</code>
- 
- </td>
+ 
+ <code class="computeroutput">using_bitwise_or_assign</code>
+ 
+ </td>
<td>
- 
- <code class="computeroutput">NT&
- operator|=(const NT& rhs)</code>
- 
- </td>
+ 
+ <code class="computeroutput">NT&
+ operator|=(const NT& rhs)</code>
+ 
+ </td>
<td>
- 
- <code class="computeroutput">this_ut |=
- rhs_ut</code>
- 
- </td>
+ 
+ <code class="computeroutput">this_ut |=
+ rhs_ut</code>
+ 
+ </td>
<td>
- 
- 13.5.2
- 
- </td>
+ 
+ 13.5.2
+ 
+ </td>
</tr>
<tr>
<td>
- 
- <code class="computeroutput">using_left_right_assign</code>
- 
- </td>
+ 
+ <code class="computeroutput">using_left_right_assign</code>
+ 
+ </td>
<td>
- 
- <code class="computeroutput">NT&
- operator<<=(const NT& rhs)</code>
- 
- </td>
+ 
+ <code class="computeroutput">NT&
+ operator<<=(const NT& rhs)</code>
+ 
+ </td>
<td>
- 
- <code class="computeroutput">this_ut <<=
- rhs_ut</code>
- 
- </td>
+ 
+ <code class="computeroutput">this_ut <<=
+ rhs_ut</code>
+ 
+ </td>
<td>
- 
- 13.5.2
- 
- </td>
+ 
+ 13.5.2
+ 
+ </td>
</tr>
<tr>
<td>
- 
- <code class="computeroutput">using_right_shift_assign</code>
- 
- </td>
+ 
+ <code class="computeroutput">using_right_shift_assign</code>
+ 
+ </td>
<td>
- 
- <code class="computeroutput">NT&
- operator>>=(const NT& rhs)</code>
- 
- </td>
+ 
+ <code class="computeroutput">NT&
+ operator>>=(const NT& rhs)</code>
+ 
+ </td>
<td>
- 
- <code class="computeroutput">this_ut >>=
- rhs_ut</code>
- 
- </td>
+ 
+ <code class="computeroutput">this_ut >>=
+ rhs_ut</code>
+ 
+ </td>
<td>
- 
- 13.5.2
- 
- </td>
+ 
+ 13.5.2
+ 
+ </td>
</tr>
<tr>
<td>
- 
- <code class="computeroutput">using_bitwise_xor</code>
- 
- </td>
+ 
+ <code class="computeroutput">using_bitwise_xor</code>
+ 
+ </td>
<td>
- 
- <code class="computeroutput">NT operator^(const
- NT&
- rhs)
- const</code>
- 
- </td>
+ 
+ <code class="computeroutput">NT operator^(const
+ NT&
+ rhs)
+ const</code>
+ 
+ </td>
<td>
- 
- <code class="computeroutput">NT(this_ut ^
- rhs_ut)</code>
- 
- </td>
+ 
+ <code class="computeroutput">NT(this_ut ^
+ rhs_ut)</code>
+ 
+ </td>
<td>
- 
- 13.5.2
- 
- </td>
+ 
+ 13.5.2
+ 
+ </td>
</tr>
<tr>
<td>
- 
- <code class="computeroutput">using_bitwise_or</code>
- 
- </td>
+ 
+ <code class="computeroutput">using_bitwise_or</code>
+ 
+ </td>
<td>
- 
- <code class="computeroutput">NT operator|(const
- NT&
- rhs)
- const</code>
- 
- </td>
+ 
+ <code class="computeroutput">NT operator|(const
+ NT&
+ rhs)
+ const</code>
+ 
+ </td>
<td>
- 
- <code class="computeroutput">NT(this_ut |
- rhs_ut)</code>
- 
- </td>
+ 
+ <code class="computeroutput">NT(this_ut |
+ rhs_ut)</code>
+ 
+ </td>
<td>
- 
- 13.5.2
- 
- </td>
+ 
+ 13.5.2
+ 
+ </td>
</tr>
<tr>
<td>
- 
- <code class="computeroutput">using_bitwise_and</code>
- 
- </td>
+ 
+ <code class="computeroutput">using_bitwise_and</code>
+ 
+ </td>
<td>
- 
- <code class="computeroutput">NT operator&(const
- NT&
- rhs)
- const</code>
- 
- </td>
+ 
+ <code class="computeroutput">NT operator&(const
+ NT&
+ rhs)
+ const</code>
+ 
+ </td>
<td>
- 
- <code class="computeroutput">NT(this_ut &
- rhs_ut)</code>
- 
- </td>
+ 
+ <code class="computeroutput">NT(this_ut &
+ rhs_ut)</code>
+ 
+ </td>
<td>
- 
- 13.5.2
- 
- </td>
+ 
+ 13.5.2
+ 
+ </td>
</tr>
<tr>
<td>
- 
- <code class="computeroutput">using_left_shift1</code>
- 
- </td>
+ 
+ <code class="computeroutput">using_left_shift1</code>
+ 
+ </td>
<td>
- 
- <code class="computeroutput">NT operator<<(const
- NT&
- rhs)
- const</code>
- 
- </td>
+ 
+ <code class="computeroutput">NT operator<<(const
+ NT&
+ rhs)
+ const</code>
+ 
+ </td>
<td>
- 
- <code class="computeroutput">NT(this_ut <<
- rhs_ut)</code>
- 
- </td>
+ 
+ <code class="computeroutput">NT(this_ut <<
+ rhs_ut)</code>
+ 
+ </td>
<td>
- 
- 13.5.2
- 
- </td>
+ 
+ 13.5.2
+ 
+ </td>
</tr>
<tr>
<td>
- 
- <code class="computeroutput">using_right_shift1</code>
- 
- </td>
+ 
+ <code class="computeroutput">using_right_shift1</code>
+ 
+ </td>
<td>
- 
- <code class="computeroutput">NT operator>>(const
- NT&
- rhs)
- const</code>
- 
- </td>
+ 
+ <code class="computeroutput">NT operator>>(const
+ NT&
+ rhs)
+ const</code>
+ 
+ </td>
<td>
- 
- <code class="computeroutput">NT(this_ut >>
- rhs_ut)</code>
- 
- </td>
+ 
+ <code class="computeroutput">NT(this_ut >>
+ rhs_ut)</code>
+ 
+ </td>
<td>
- 
- 13.5.2
- 
- </td>
+ 
+ 13.5.2
+ 
+ </td>
</tr>
<tr>
<td>
- 
- <code class="computeroutput">using_bitwise_xor2<NT2></code>
- 
- </td>
+ 
+ <code class="computeroutput">using_bitwise_xor2<NT2></code>
+ 
+ </td>
<td>
- 
- <code class="computeroutput">NT operator^(const
- NT2&
- rhs)
- const</code>
- 
- </td>
+ 
+ <code class="computeroutput">NT operator^(const
+ NT2&
+ rhs)
+ const</code>
+ 
+ </td>
<td>
- 
- <code class="computeroutput">NT(this_ut ^
- rhs_ut)</code>
- 
- </td>
+ 
+ <code class="computeroutput">NT(this_ut ^
+ rhs_ut)</code>
+ 
+ </td>
<td>
- 
- 13.5.2
- 
- </td>
+ 
+ 13.5.2
+ 
+ </td>
</tr>
<tr>
<td>
- 
- <code class="computeroutput">using_bitwise_xor_assign2<NT2></code>
- 
- </td>
+ 
+ <code class="computeroutput">using_bitwise_xor_assign2<NT2></code>
+ 
+ </td>
<td>
- 
- <code class="computeroutput">NT&
- operator^=(const NT2& rhs)</code>
- 
- </td>
+ 
+ <code class="computeroutput">NT&
+ operator^=(const NT2& rhs)</code>
+ 
+ </td>
<td>
- 
- <code class="computeroutput">this_ut ^=
- rhs_ut</code>
- 
- </td>
+ 
+ <code class="computeroutput">this_ut ^=
+ rhs_ut</code>
+ 
+ </td>
<td>
- 
- 13.5.2
- 
- </td>
+ 
+ 13.5.2
+ 
+ </td>
</tr>
<tr>
<td>
- 
- <code class="computeroutput">using_bitwise_or2<NT2></code>
- 
- </td>
+ 
+ <code class="computeroutput">using_bitwise_or2<NT2></code>
+ 
+ </td>
<td>
- 
- <code class="computeroutput">NT operator|(const
- NT2&
- rhs)
- const</code>
- 
- </td>
+ 
+ <code class="computeroutput">NT operator|(const
+ NT2&
+ rhs)
+ const</code>
+ 
+ </td>
<td>
- 
- <code class="computeroutput">NT(this_ut |
- rhs_ut)</code>
- 
- </td>
+ 
+ <code class="computeroutput">NT(this_ut |
+ rhs_ut)</code>
+ 
+ </td>
<td>
- 
- 13.5.2
- 
- </td>
+ 
+ 13.5.2
+ 
+ </td>
</tr>
<tr>
<td>
- 
- <code class="computeroutput">using_bitwise_and2<NT2></code>
- 
- </td>
+ 
+ <code class="computeroutput">using_bitwise_and2<NT2></code>
+ 
+ </td>
<td>
- 
- <code class="computeroutput">NT operator&(const
- NT2&
- rhs)
- const</code>
- 
- </td>
+ 
+ <code class="computeroutput">NT operator&(const
+ NT2&
+ rhs)
+ const</code>
+ 
+ </td>
<td>
- 
- <code class="computeroutput">NT(this_ut &
- rhs_ut)</code>
- 
- </td>
+ 
+ <code class="computeroutput">NT(this_ut &
+ rhs_ut)</code>
+ 
+ </td>
<td>
- 
- 13.5.2
- 
- </td>
+ 
+ 13.5.2
+ 
+ </td>
</tr>
<tr>
<td>
- 
- <code class="computeroutput">using_bitwise_and_assign2<NT2></code>
- 
- </td>
+ 
+ <code class="computeroutput">using_bitwise_and_assign2<NT2></code>
+ 
+ </td>
<td>
- 
- <code class="computeroutput">NT&
- operator&=(const NT2& rhs)</code>
- 
- </td>
+ 
+ <code class="computeroutput">NT&
+ operator&=(const NT2& rhs)</code>
+ 
+ </td>
<td>
- 
- <code class="computeroutput">this_ut &=
- rhs_ut</code>
- 
- </td>
+ 
+ <code class="computeroutput">this_ut &=
+ rhs_ut</code>
+ 
+ </td>
<td>
- 
- 13.5.2
- 
- </td>
+ 
+ 13.5.2
+ 
+ </td>
</tr>
<tr>
<td>
- 
- <code class="computeroutput">using_bitwise_or_assign2<NT2></code>
- 
- </td>
+ 
+ <code class="computeroutput">using_bitwise_or_assign2<NT2></code>
+ 
+ </td>
<td>
- 
- <code class="computeroutput">NT&
- operator|=(const NT2& rhs)</code>
- 
- </td>
+ 
+ <code class="computeroutput">NT&
+ operator|=(const NT2& rhs)</code>
+ 
+ </td>
<td>
- 
- <code class="computeroutput">this_ut |=
- rhs_ut</code>
- 
- </td>
+ 
+ <code class="computeroutput">this_ut |=
+ rhs_ut</code>
+ 
+ </td>
<td>
- 
- 13.5.2
- 
- </td>
+ 
+ 13.5.2
+ 
+ </td>
</tr>
<tr>
<td>
- 
- <code class="computeroutput">using_left_shift2<NT2></code>
- 
- </td>
+ 
+ <code class="computeroutput">using_left_shift2<NT2></code>
+ 
+ </td>
<td>
- 
- <code class="computeroutput">NT operator<<(const
- NT2&
- rhs)
- const</code>
- 
- </td>
+ 
+ <code class="computeroutput">NT operator<<(const
+ NT2&
+ rhs)
+ const</code>
+ 
+ </td>
<td>
- 
- <code class="computeroutput">NT(this_ut <<
- rhs_ut)</code>
- 
- </td>
+ 
+ <code class="computeroutput">NT(this_ut <<
+ rhs_ut)</code>
+ 
+ </td>
<td>
- 
- 13.5.2
- 
- </td>
+ 
+ 13.5.2
+ 
+ </td>
</tr>
<tr>
<td>
- 
- <code class="computeroutput">using_left_right_assign2<NT2></code>
- 
- </td>
+ 
+ <code class="computeroutput">using_left_right_assign2<NT2></code>
+ 
+ </td>
<td>
- 
- <code class="computeroutput">NT&
- operator<<=(const NT2& rhs)</code>
- 
- </td>
+ 
+ <code class="computeroutput">NT&
+ operator<<=(const NT2& rhs)</code>
+ 
+ </td>
<td>
- 
- <code class="computeroutput">this_ut <<=
- rhs_ut</code>
- 
- </td>
+ 
+ <code class="computeroutput">this_ut <<=
+ rhs_ut</code>
+ 
+ </td>
<td>
- 
- 13.5.2
- 
- </td>
+ 
+ 13.5.2
+ 
+ </td>
</tr>
<tr>
<td>
- 
- <code class="computeroutput">using_right_shift2<NT2></code>
- 
- </td>
+ 
+ <code class="computeroutput">using_right_shift2<NT2></code>
+ 
+ </td>
<td>
- 
- <code class="computeroutput">NT operator>>(const
- NT2&
- rhs)
- const</code>
- 
- </td>
+ 
+ <code class="computeroutput">NT operator>>(const
+ NT2&
+ rhs)
+ const</code>
+ 
+ </td>
<td>
- 
- <code class="computeroutput">NT(this_ut >>
- rhs_ut)</code>
- 
- </td>
+ 
+ <code class="computeroutput">NT(this_ut >>
+ rhs_ut)</code>
+ 
+ </td>
<td>
- 
- 13.5.2
- 
- </td>
+ 
+ 13.5.2
+ 
+ </td>
</tr>
<tr>
<td>
- 
- <code class="computeroutput">using_right_shift_assign2<NT2></code>
- 
- </td>
+ 
+ <code class="computeroutput">using_right_shift_assign2<NT2></code>
+ 
+ </td>
<td>
- 
- <code class="computeroutput">NT&
- operator>>=(const NT2& rhs)</code>
- 
- </td>
+ 
+ <code class="computeroutput">NT&
+ operator>>=(const NT2& rhs)</code>
+ 
+ </td>
<td>
- 
- <code class="computeroutput">this_ut >>=
- rhs_ut</code>
- 
- </td>
+ 
+ <code class="computeroutput">this_ut >>=
+ rhs_ut</code>
+ 
+ </td>
<td>
- 
- 13.5.2
- 
- </td>
+ 
+ 13.5.2
+ 
+ </td>
</tr>
</tbody>
</table>
@@ -3496,7 +3644,7 @@
 Operators</a>
</h5></div></div></div>
<div class="table">
-<a name="boost.opaque.reference.meta_mixins.using_operators_hpp.logical_operators.logical_operators"></a>Table 4. Logical operators
+<a name="id5014974"></a>Table 4. Logical operators
<table class="table" summary="Logical operators">
<colgroup>
<col>
@@ -3506,100 +3654,100 @@
</colgroup>
<thead><tr>
<th>
- 
- Meta-Mixin
- 
- </th>
+ 
+ Meta-Mixin
+ 
+ </th>
<th>
- 
- Supplied Operation
- 
- </th>
+ 
+ Supplied Operation
+ 
+ </th>
<th>
- 
- Requirements
- 
- </th>
+ 
+ Requirements
+ 
+ </th>
<th>
- 
- Ref
- 
- </th>
+ 
+ Ref
+ 
+ </th>
</tr></thead>
<tbody>
<tr>
<td>
- 
- <code class="computeroutput">using_logical_not<Bool></code>
- 
- </td>
+ 
+ <code class="computeroutput">using_logical_not<Bool></code>
+ 
+ </td>
<td>
- 
- <code class="computeroutput">Bool operator!() const</code>
- 
- </td>
+ 
+ <code class="computeroutput">Bool operator!() const</code>
+ 
+ </td>
<td>
- 
- <code class="computeroutput">Bool(!this_ut)</code>
- 
- </td>
+ 
+ <code class="computeroutput">Bool(!this_ut)</code>
+ 
+ </td>
<td>
- 
- 13.5.1
- 
- </td>
+ 
+ 13.5.1
+ 
+ </td>
</tr>
<tr>
<td>
- 
- <code class="computeroutput">using_logical_and<Bool></code>
- 
- </td>
+ 
+ <code class="computeroutput">using_logical_and<Bool></code>
+ 
+ </td>
<td>
- 
- <code class="computeroutput">Bool operator&&(const
- NT&
- rhs)
- const</code>
- 
- </td>
+ 
+ <code class="computeroutput">Bool operator&&(const
+ NT&
+ rhs)
+ const</code>
+ 
+ </td>
<td>
- 
- <code class="computeroutput">Bool(this_ut &&
- rhs_ut)</code>
- 
- </td>
+ 
+ <code class="computeroutput">Bool(this_ut &&
+ rhs_ut)</code>
+ 
+ </td>
<td>
- 
- 13.5.2
- 
- </td>
+ 
+ 13.5.2
+ 
+ </td>
</tr>
<tr>
<td>
- 
- <code class="computeroutput">using_logical_or<Bool></code>
- 
- </td>
+ 
+ <code class="computeroutput">using_logical_or<Bool></code>
+ 
+ </td>
<td>
- 
- <code class="computeroutput">Bool operator||(const
- NT&
- rhs)
- const</code>
- 
- </td>
+ 
+ <code class="computeroutput">Bool operator||(const
+ NT&
+ rhs)
+ const</code>
+ 
+ </td>
<td>
- 
- <code class="computeroutput">Bool(this_ut ||
- rhs_ut)</code>
- 
- </td>
+ 
+ <code class="computeroutput">Bool(this_ut ||
+ rhs_ut)</code>
+ 
+ </td>
<td>
- 
- 13.5.2
- 
- </td>
+ 
+ 13.5.2
+ 
+ </td>
</tr>
</tbody>
</table>
@@ -3612,7 +3760,7 @@
 Operators</a>
</h5></div></div></div>
<div class="table">
-<a name="boost.opaque.reference.meta_mixins.using_operators_hpp.conversion_operators.conversion_operators"></a>Table 5. Conversion Operators
+<a name="id5015420"></a>Table 5. Conversion Operators
<table class="table" summary="Conversion Operators">
<colgroup>
<col>
@@ -3622,92 +3770,92 @@
</colgroup>
<thead><tr>
<th>
- 
- Meta-Mixin
- 
- </th>
+ 
+ Meta-Mixin
+ 
+ </th>
<th>
- 
- Supplied Operation
- 
- </th>
+ 
+ Supplied Operation
+ 
+ </th>
<th>
- 
- Requirements
- 
- </th>
+ 
+ Requirements
+ 
+ </th>
<th>
- 
- Ref
- 
- </th>
+ 
+ Ref
+ 
+ </th>
</tr></thead>
<tbody>
<tr>
<td>
- 
- <code class="computeroutput">using_underlying_conversion<UT></code>
- 
- </td>
+ 
+ <code class="computeroutput">using_underlying_conversion<UT></code>
+ 
+ </td>
<td>
- 
- <code class="computeroutput">operator UT() const</code>
- 
- </td>
+ 
+ <code class="computeroutput">operator UT() const</code>
+ 
+ </td>
<td>
- 
- None
- 
- </td>
+ 
+ None
+ 
+ </td>
<td>
- 
- 12.3.2
- 
- </td>
+ 
+ 12.3.2
+ 
+ </td>
</tr>
<tr>
<td>
- 
- <code class="computeroutput">using_conversion_to<T></code>
- 
- </td>
+ 
+ <code class="computeroutput">using_conversion_to<T></code>
+ 
+ </td>
<td>
- 
- <code class="computeroutput">operator T() const</code>
- 
- </td>
+ 
+ <code class="computeroutput">operator T() const</code>
+ 
+ </td>
<td>
- 
- <code class="computeroutput">T(ut)</code>
- 
- </td>
+ 
+ <code class="computeroutput">T(ut)</code>
+ 
+ </td>
<td>
- 
- 12.3.2
- 
- </td>
+ 
+ 12.3.2
+ 
+ </td>
</tr>
<tr>
<td>
- 
- <code class="computeroutput">using_safe_bool_conversion</code>
- 
- </td>
+ 
+ <code class="computeroutput">using_safe_bool_conversion</code>
+ 
+ </td>
<td>
- 
- <code class="computeroutput">operator unspecified_bool_type() const</code>
- 
- </td>
+ 
+ <code class="computeroutput">operator unspecified_bool_type() const</code>
+ 
+ </td>
<td>
- 
- <code class="computeroutput">ut?true:false</code>
- 
- </td>
+ 
+ <code class="computeroutput">ut?true:false</code>
+ 
+ </td>
<td>
- 
- 12.3.2
- 
- </td>
+ 
+ 12.3.2
+ 
+ </td>
</tr>
</tbody>
</table>
@@ -3720,7 +3868,7 @@
 Operators</a>
</h5></div></div></div>
<div class="table">
-<a name="boost.opaque.reference.meta_mixins.using_operators_hpp.dereference_operators.dereference_operators"></a>Table 6. Dereference Operators
+<a name="id5015762"></a>Table 6. Dereference Operators
<table class="table" summary="Dereference Operators">
<colgroup>
<col>
@@ -3730,142 +3878,154 @@
</colgroup>
<thead><tr>
<th>
- 
- Meta-Mixin
- 
- </th>
+ 
+ Meta-Mixin
+ 
+ </th>
<th>
- 
- Supplied Operation
- 
- </th>
+ 
+ Supplied Operation
+ 
+ </th>
<th>
- 
- Requirements
- 
- </th>
+ 
+ Requirements
+ 
+ </th>
<th>
- 
- Ref
- 
- </th>
+ 
+ Ref
+ 
+ </th>
</tr></thead>
<tbody>
<tr>
<td>
- 
- <code class="computeroutput">using_address_of</code>
- 
- </td>
+ 
+ <code class="computeroutput">using_address_of</code>
+ 
+ </td>
<td>
- 
- <code class="computeroutput">NT&
- operator&()</code>
- 
- </td>
+ 
+ <code class="computeroutput">NT&
+ operator&()</code>
+ 
+ </td>
<td>
- 
- ??
- 
- </td>
+ 
+ ??
+ 
+ </td>
<td>
- </td>
+ 
+ 
+ </td>
</tr>
<tr>
<td>
- 
- <code class="computeroutput">using_address_of2<A></code>
- 
- </td>
+ 
+ <code class="computeroutput">using_address_of2<A></code>
+ 
+ </td>
<td>
- 
- <code class="computeroutput">A operator&()</code>
- 
- </td>
+ 
+ <code class="computeroutput">A operator&()</code>
+ 
+ </td>
<td>
- 
- ??
- 
- </td>
+ 
+ ??
+ 
+ </td>
<td>
- </td>
+ 
+ 
+ </td>
</tr>
<tr>
<td>
- 
- <code class="computeroutput">using_derreference</code>
- 
- </td>
+ 
+ <code class="computeroutput">using_derreference</code>
+ 
+ </td>
<td>
- 
- <code class="computeroutput">NT&
- operator*()</code>
- 
- </td>
+ 
+ <code class="computeroutput">NT&
+ operator*()</code>
+ 
+ </td>
<td>
- 
- ??
- 
- </td>
+ 
+ ??
+ 
+ </td>
<td>
- </td>
+ 
+ 
+ </td>
</tr>
<tr>
<td>
- 
- <code class="computeroutput">using_derreference<R></code>
- 
- </td>
+ 
+ <code class="computeroutput">using_derreference<R></code>
+ 
+ </td>
<td>
- 
- <code class="computeroutput">R operator*()</code>
- 
- </td>
+ 
+ <code class="computeroutput">R operator*()</code>
+ 
+ </td>
<td>
- 
- ??
- 
- </td>
+ 
+ ??
+ 
+ </td>
<td>
- </td>
+ 
+ 
+ </td>
</tr>
<tr>
<td>
- 
- <code class="computeroutput">using_member_access<P></code>
- 
- </td>
+ 
+ <code class="computeroutput">using_member_access<P></code>
+ 
+ </td>
<td>
- 
- <code class="computeroutput">P operator->()</code>
- 
- </td>
+ 
+ <code class="computeroutput">P operator->()</code>
+ 
+ </td>
<td>
- 
- ??
- 
- </td>
+ 
+ ??
+ 
+ </td>
<td>
- </td>
+ 
+ 
+ </td>
</tr>
<tr>
<td>
- 
- <code class="computeroutput">using_subscript<D,T></code>
- 
- </td>
+ 
+ <code class="computeroutput">using_subscript<D,T></code>
+ 
+ </td>
<td>
- 
- <code class="computeroutput">T operator[](D)</code>
- 
- </td>
+ 
+ <code class="computeroutput">T operator[](D)</code>
+ 
+ </td>
<td>
- 
- ??
- 
- </td>
+ 
+ ??
+ 
+ </td>
<td>
- </td>
+ 
+ 
+ </td>
</tr>
</tbody>
</table>
@@ -3886,82 +4046,88 @@
</colgroup>
<thead><tr>
<th>
- 
- Meta-Mixin
- 
+ 
+ Meta-Mixin
+ 
 </th>
<th>
- 
- Supplied Operation
- 
+ 
+ Supplied Operation
+ 
 </th>
<th>
- 
- Requirements
- 
+ 
+ Requirements
+ 
 </th>
<th>
- 
- Ref
- 
+ 
+ Ref
+ 
 </th>
</tr></thead>
<tbody>
<tr>
<td>
- 
- <code class="computeroutput">using_comma</code>
- 
+ 
+ <code class="computeroutput">using_comma</code>
+ 
 </td>
<td>
- 
- <code class="computeroutput">NT operator,()</code>
- 
+ 
+ <code class="computeroutput">NT operator,()</code>
+ 
 </td>
<td>
- 
- ??
- 
+ 
+ ??
+ 
 </td>
<td>
+ 
+ 
 </td>
</tr>
<tr>
<td>
- 
- <code class="computeroutput">using_function_call</code>
- 
+ 
+ <code class="computeroutput">using_function_call</code>
+ 
 </td>
<td>
- 
- <code class="computeroutput">operator()()</code>
- 
+ 
+ <code class="computeroutput">operator()()</code>
+ 
 </td>
<td>
- 
- ??
- 
+ 
+ ??
+ 
 </td>
<td>
+ 
+ 
 </td>
</tr>
<tr>
<td>
- 
- <code class="computeroutput">using_pointer_to_member</code>
- 
+ 
+ <code class="computeroutput">using_pointer_to_member</code>
+ 
 </td>
<td>
- 
- <code class="computeroutput">operator->*()</code>
- 
+ 
+ <code class="computeroutput">operator->*()</code>
+ 
 </td>
<td>
- 
- ??
- 
+ 
+ ??
+ 
 </td>
<td>
+ 
+ 
 </td>
</tr>
</tbody>
@@ -3992,70 +4158,70 @@
</colgroup>
<thead><tr>
<th>
- 
- Meta-Mixin
- 
+ 
+ Meta-Mixin
+ 
 </th>
<th>
- 
- Hidden Operation
- 
+ 
+ Hidden Operation
+ 
 </th>
<th>
- 
- Requirements
- 
+ 
+ Requirements
+ 
 </th>
<th>
- 
- Ref
- 
+ 
+ Ref
+ 
 </th>
</tr></thead>
<tbody>
<tr>
<td>
- 
- <code class="computeroutput">hiding_assignment</code>
- 
+ 
+ <code class="computeroutput">hiding_assignment</code>
+ 
 </td>
<td>
- 
- <code class="computeroutput">NT&
- operator=(NT const&)</code>
- 
+ 
+ <code class="computeroutput">NT&
+ operator=(NT const&)</code>
+ 
 </td>
<td>
- 
- None
- 
+ 
+ None
+ 
 </td>
<td>
- 
- 13.5.3
- 
+ 
+ 13.5.3
+ 
 </td>
</tr>
<tr>
<td>
- 
- <code class="computeroutput">hiding_copy_constructor</code>
- 
+ 
+ <code class="computeroutput">hiding_copy_constructor</code>
+ 
 </td>
<td>
- 
- <code class="computeroutput">NT(NT const&)</code>
- 
+ 
+ <code class="computeroutput">NT(NT const&)</code>
+ 
 </td>
<td>
- 
- None
- 
+ 
+ None
+ 
 </td>
<td>
- 
- 13.5.3
- 
+ 
+ 13.5.3
+ 
 </td>
</tr>
</tbody>
@@ -4095,250 +4261,274 @@
</colgroup>
<thead><tr>
<th>
- 
- Meta-Mixin
- 
+ 
+ Meta-Mixin
+ 
 </th>
<th>
- 
- Meta-Mixin Sequence
- 
+ 
+ Meta-Mixin Sequence
+ 
 </th>
<th>
- 
- Ref
- 
+ 
+ Ref
+ 
 </th>
</tr></thead>
<tbody>
<tr>
<td>
- 
- <code class="computeroutput">using_equality_comparable1<Bool></code>
- 
+ 
+ <code class="computeroutput">using_equality_comparable1<Bool></code>
+ 
 </td>
<td>
- 
- <code class="computeroutput">using_equal<Bool></code>,
- <code class="computeroutput">using_not_equal<Bool></code>
- 
+ 
+ <code class="computeroutput">using_equal<Bool></code>,
+ <code class="computeroutput">using_not_equal<Bool></code>
+ 
 </td>
<td>
- 
- 20.1.1
- 
+ 
+ 20.1.1
+ 
 </td>
</tr>
<tr>
<td>
- 
- <code class="computeroutput">using_less_than_comparable1<Bool></code>
- 
+ 
+ <code class="computeroutput">using_less_than_comparable1<Bool></code>
+ 
 </td>
<td>
- 
- <code class="computeroutput">using_less_than<Bool></code> <code class="computeroutput">using_less_than_equal<Bool></code> <code class="computeroutput">using_greater_than_equal<Bool></code> <code class="computeroutput">using_greater_than<Bool></code>
- 
+ 
+ <code class="computeroutput">using_less_than<Bool></code> <code class="computeroutput">using_less_than_equal<Bool></code> <code class="computeroutput">using_greater_than_equal<Bool></code> <code class="computeroutput">using_greater_than<Bool></code>
+ 
 </td>
<td>
- 
- 20.1.2
- 
+ 
+ 20.1.2
+ 
 </td>
</tr>
<tr>
<td>
- 
- <code class="computeroutput">using_partially_ordered1<Bool></code>
- 
+ 
+ <code class="computeroutput">using_partially_ordered1<Bool></code>
+ 
 </td>
<td>
- 
- <code class="computeroutput">using_less_than<Bool></code> <code class="computeroutput">using_less_than_equal<Bool></code> <code class="computeroutput">using_greater_than_equal<Bool></code> <code class="computeroutput">using_greater_than<Bool></code>
- 
+ 
+ <code class="computeroutput">using_less_than<Bool></code> <code class="computeroutput">using_less_than_equal<Bool></code> <code class="computeroutput">using_greater_than_equal<Bool></code> <code class="computeroutput">using_greater_than<Bool></code>
+ 
 </td>
<td>
- 
- 20.1.2
- 
+ 
+ 20.1.2
+ 
 </td>
</tr>
<tr>
<td>
- 
- <code class="computeroutput">using_addable1</code>
- 
+ 
+ <code class="computeroutput">using_addable1</code>
+ 
 </td>
<td>
- 
- <code class="computeroutput">using_plus_assign</code>
- <code class="computeroutput">using_plus</code>
- 
+ 
+ <code class="computeroutput">using_plus_assign</code>
+ <code class="computeroutput">using_plus</code>
+ 
 </td>
<td>
+ 
+ 
 </td>
</tr>
<tr>
<td>
- 
- <code class="computeroutput">using_subtractable1</code>
- 
+ 
+ <code class="computeroutput">using_subtractable1</code>
+ 
 </td>
<td>
- 
- <code class="computeroutput">using_minus_assign</code>
- <code class="computeroutput">using_minus</code>
- 
+ 
+ <code class="computeroutput">using_minus_assign</code>
+ <code class="computeroutput">using_minus</code>
+ 
 </td>
<td>
+ 
+ 
 </td>
</tr>
<tr>
<td>
- 
- <code class="computeroutput">using_multipliable1</code>
- 
+ 
+ <code class="computeroutput">using_multipliable1</code>
+ 
 </td>
<td>
- 
- <code class="computeroutput">using_multiply_assign</code>
- <code class="computeroutput">using_multiply</code>
- 
+ 
+ <code class="computeroutput">using_multiply_assign</code>
+ <code class="computeroutput">using_multiply</code>
+ 
 </td>
<td>
+ 
+ 
 </td>
</tr>
<tr>
<td>
- 
- <code class="computeroutput">using_dividable1</code>
- 
+ 
+ <code class="computeroutput">using_dividable1</code>
+ 
 </td>
<td>
- 
- <code class="computeroutput">using_divide_assign</code>
- <code class="computeroutput">using_divide</code>
- 
+ 
+ <code class="computeroutput">using_divide_assign</code>
+ <code class="computeroutput">using_divide</code>
+ 
 </td>
<td>
+ 
+ 
 </td>
</tr>
<tr>
<td>
- 
- <code class="computeroutput">using_modable1</code>
- 
+ 
+ <code class="computeroutput">using_modable1</code>
+ 
 </td>
<td>
- 
- <code class="computeroutput">using_modulus_assign</code>
- <code class="computeroutput">using_modulus</code>
- 
+ 
+ <code class="computeroutput">using_modulus_assign</code>
+ <code class="computeroutput">using_modulus</code>
+ 
 </td>
<td>
+ 
+ 
 </td>
</tr>
<tr>
<td>
- 
- <code class="computeroutput">using_bitwise_xorable1</code>
- 
+ 
+ <code class="computeroutput">using_bitwise_xorable1</code>
+ 
 </td>
<td>
- 
- <code class="computeroutput">using_bitwise_xor_assign</code>
- <code class="computeroutput">using_bitwise_xor</code>
- 
+ 
+ <code class="computeroutput">using_bitwise_xor_assign</code>
+ <code class="computeroutput">using_bitwise_xor</code>
+ 
 </td>
<td>
+ 
+ 
 </td>
</tr>
<tr>
<td>
- 
- <code class="computeroutput">using_bitwise_orable1</code>
- 
+ 
+ <code class="computeroutput">using_bitwise_orable1</code>
+ 
 </td>
<td>
- 
- <code class="computeroutput">using_bitwise_or_assign</code>
- <code class="computeroutput">using_bitwise_or</code>
- 
+ 
+ <code class="computeroutput">using_bitwise_or_assign</code>
+ <code class="computeroutput">using_bitwise_or</code>
+ 
 </td>
<td>
+ 
+ 
 </td>
</tr>
<tr>
<td>
- 
- <code class="computeroutput">using_bitwise_andable1</code>
- 
+ 
+ <code class="computeroutput">using_bitwise_andable1</code>
+ 
 </td>
<td>
- 
- <code class="computeroutput">using_bitwise_and_assign</code>
- <code class="computeroutput">using_bitwise_and</code>
- 
+ 
+ <code class="computeroutput">using_bitwise_and_assign</code>
+ <code class="computeroutput">using_bitwise_and</code>
+ 
 </td>
<td>
+ 
+ 
 </td>
</tr>
<tr>
<td>
- 
- <code class="computeroutput">using_left_shiftable1</code>
- 
+ 
+ <code class="computeroutput">using_left_shiftable1</code>
+ 
 </td>
<td>
- 
- <code class="computeroutput">using_left_right_assign</code>
- <code class="computeroutput">using_left_shift1</code>
- 
+ 
+ <code class="computeroutput">using_left_right_assign</code>
+ <code class="computeroutput">using_left_shift1</code>
+ 
 </td>
<td>
+ 
+ 
 </td>
</tr>
<tr>
<td>
- 
- <code class="computeroutput">using_right_shiftable1</code>
- 
+ 
+ <code class="computeroutput">using_right_shiftable1</code>
+ 
 </td>
<td>
- 
- <code class="computeroutput">using_right_shift_assign</code>
- <code class="computeroutput">using_right_shift1</code>
- 
+ 
+ <code class="computeroutput">using_right_shift_assign</code>
+ <code class="computeroutput">using_right_shift1</code>
+ 
 </td>
<td>
+ 
+ 
 </td>
</tr>
<tr>
<td>
- 
- <code class="computeroutput">using_incrementable</code>
- 
+ 
+ <code class="computeroutput">using_incrementable</code>
+ 
 </td>
<td>
- 
- <code class="computeroutput">using_pre_increment></code> <code class="computeroutput">using_post_increment</code>
- 
+ 
+ <code class="computeroutput">using_pre_increment></code> <code class="computeroutput">using_post_increment</code>
+ 
 </td>
<td>
+ 
+ 
 </td>
</tr>
<tr>
<td>
- 
- <code class="computeroutput">using_decrementable</code>
- 
+ 
+ <code class="computeroutput">using_decrementable</code>
+ 
 </td>
<td>
- 
- <code class="computeroutput">using_pre_decrement></code> <code class="computeroutput">using_post_decrement</code>
- 
+ 
+ <code class="computeroutput">using_pre_decrement></code> <code class="computeroutput">using_post_decrement</code>
+ 
 </td>
<td>
+ 
+ 
 </td>
</tr>
</tbody>
@@ -4351,215 +4541,241 @@
</colgroup>
<thead><tr>
<th>
- 
- Meta-Mixin
- 
+ 
+ Meta-Mixin
+ 
 </th>
<th>
- 
- Meta-Mixin Sequence
- 
+ 
+ Meta-Mixin Sequence
+ 
 </th>
<th>
- 
- Ref
- 
+ 
+ Ref
+ 
 </th>
</tr></thead>
<tbody>
<tr>
<td>
- 
- <code class="computeroutput">using_totally_ordered1<Bool></code>
- 
+ 
+ <code class="computeroutput">using_totally_ordered1<Bool></code>
+ 
 </td>
<td>
- 
- <code class="computeroutput">using_equality_comparable1<Bool></code> <code class="computeroutput">using_less_than_comparable1<Bool></code>
- 
+ 
+ <code class="computeroutput">using_equality_comparable1<Bool></code> <code class="computeroutput">using_less_than_comparable1<Bool></code>
+ 
 </td>
<td>
+ 
+ 
 </td>
</tr>
<tr>
<td>
- 
- <code class="computeroutput">using_additive1</code>
- 
+ 
+ <code class="computeroutput">using_additive1</code>
+ 
 </td>
<td>
- 
- <code class="computeroutput">using_addable1</code>
- <code class="computeroutput">using_subtractable1</code>
- 
+ 
+ <code class="computeroutput">using_addable1</code>
+ <code class="computeroutput">using_subtractable1</code>
+ 
 </td>
<td>
+ 
+ 
 </td>
</tr>
<tr>
<td>
- 
- <code class="computeroutput">using_multiplicative1</code>
- 
+ 
+ <code class="computeroutput">using_multiplicative1</code>
+ 
 </td>
<td>
- 
- <code class="computeroutput">using_multipliable1</code>
- <code class="computeroutput">using_dividable1</code>
- 
+ 
+ <code class="computeroutput">using_multipliable1</code>
+ <code class="computeroutput">using_dividable1</code>
+ 
 </td>
<td>
+ 
+ 
 </td>
</tr>
<tr>
<td>
- 
- <code class="computeroutput">integer_multiplicative1</code>
- 
+ 
+ <code class="computeroutput">integer_multiplicative1</code>
+ 
 </td>
<td>
- 
- <code class="computeroutput">using_multiplicative1</code>
- <code class="computeroutput">using_modable1</code>
- 
+ 
+ <code class="computeroutput">using_multiplicative1</code>
+ <code class="computeroutput">using_modable1</code>
+ 
 </td>
<td>
+ 
+ 
 </td>
</tr>
<tr>
<td>
- 
- <code class="computeroutput">using_arithmetic1</code>
- 
+ 
+ <code class="computeroutput">using_arithmetic1</code>
+ 
 </td>
<td>
- 
- <code class="computeroutput">using_additive1</code>
- <code class="computeroutput">using_multiplicative1</code>
- 
+ 
+ <code class="computeroutput">using_additive1</code>
+ <code class="computeroutput">using_multiplicative1</code>
+ 
 </td>
<td>
+ 
+ 
 </td>
</tr>
<tr>
<td>
- 
- <code class="computeroutput">using_integer_arithmetic1</code>
- 
+ 
+ <code class="computeroutput">using_integer_arithmetic1</code>
+ 
 </td>
<td>
- 
- <code class="computeroutput">using_additive1</code>
- <code class="computeroutput">integer_multiplicative1</code>
- 
+ 
+ <code class="computeroutput">using_additive1</code>
+ <code class="computeroutput">integer_multiplicative1</code>
+ 
 </td>
<td>
+ 
+ 
 </td>
</tr>
<tr>
<td>
- 
- <code class="computeroutput">using_bitwise1</code>
- 
+ 
+ <code class="computeroutput">using_bitwise1</code>
+ 
 </td>
<td>
- 
- <code class="computeroutput">using_bitwise_xorable1</code>
- <code class="computeroutput">using_bitwise_orable1</code>
- <code class="computeroutput">using_bitwise_andable1</code>
- 
+ 
+ <code class="computeroutput">using_bitwise_xorable1</code>
+ <code class="computeroutput">using_bitwise_orable1</code>
+ <code class="computeroutput">using_bitwise_andable1</code>
+ 
 </td>
<td>
+ 
+ 
 </td>
</tr>
<tr>
<td>
- 
- <code class="computeroutput">using_unit_steppable</code>
- 
+ 
+ <code class="computeroutput">using_unit_steppable</code>
+ 
 </td>
<td>
- 
- <code class="computeroutput">using_incrementable</code>
- <code class="computeroutput">using_decrementable</code>
- 
+ 
+ <code class="computeroutput">using_incrementable</code>
+ <code class="computeroutput">using_decrementable</code>
+ 
 </td>
<td>
+ 
+ 
 </td>
</tr>
<tr>
<td>
- 
- <code class="computeroutput">using_shiftable1</code>
- 
+ 
+ <code class="computeroutput">using_shiftable1</code>
+ 
 </td>
<td>
- 
- <code class="computeroutput">using_left_shiftable1</code>
- <code class="computeroutput">using_right_shiftable1</code>
- 
+ 
+ <code class="computeroutput">using_left_shiftable1</code>
+ <code class="computeroutput">using_right_shiftable1</code>
+ 
 </td>
<td>
+ 
+ 
 </td>
</tr>
<tr>
<td>
- 
- <code class="computeroutput">using_ring_operators1</code>
- 
+ 
+ <code class="computeroutput">using_ring_operators1</code>
+ 
 </td>
<td>
- 
- <code class="computeroutput">using_additive1</code>
- <code class="computeroutput">using_multipliable1</code>
- 
+ 
+ <code class="computeroutput">using_additive1</code>
+ <code class="computeroutput">using_multipliable1</code>
+ 
 </td>
<td>
+ 
+ 
 </td>
</tr>
<tr>
<td>
- 
- <code class="computeroutput">using_ordered_ring_operators1<Bool></code>
- 
+ 
+ <code class="computeroutput">using_ordered_ring_operators1<Bool></code>
+ 
 </td>
<td>
- 
- <code class="computeroutput">using_ring_operators1</code>
- <code class="computeroutput">using_totally_ordered1<Bool></code>
- 
+ 
+ <code class="computeroutput">using_ring_operators1</code>
+ <code class="computeroutput">using_totally_ordered1<Bool></code>
+ 
 </td>
<td>
+ 
+ 
 </td>
</tr>
<tr>
<td>
- 
- <code class="computeroutput">using_field_operators1<Bool></code>
- 
+ 
+ <code class="computeroutput">using_field_operators1<Bool></code>
+ 
 </td>
<td>
- 
- <code class="computeroutput">using_ring_operators1</code>
- <code class="computeroutput">using_dividable1<Bool></code>
- 
+ 
+ <code class="computeroutput">using_ring_operators1</code>
+ <code class="computeroutput">using_dividable1<Bool></code>
+ 
 </td>
<td>
+ 
+ 
 </td>
</tr>
<tr>
<td>
- 
- <code class="computeroutput">using_ordered_field_operators1<Bool></code>
- 
+ 
+ <code class="computeroutput">using_ordered_field_operators1<Bool></code>
+ 
 </td>
<td>
- 
- <code class="computeroutput">using_field_operators1</code>
- <code class="computeroutput">using_totally_ordered1<Bool></code>
- 
+ 
+ <code class="computeroutput">using_field_operators1</code>
+ <code class="computeroutput">using_totally_ordered1<Bool></code>
+ 
 </td>
<td>
+ 
+ 
 </td>
</tr>
</tbody>
@@ -4588,7 +4804,8 @@
</h4></div></div></div>
<div class="toc"><dl><dt><a href="index.html#boost.opaque.reference.meta_mixins.transitive_substituable_hpp.transitive_substituable">
 Class Template <code class="computeroutput">transitive_substituable<></code></a></dt></dl></div>
-<pre class="programlisting">namespace boost {
+<pre class="programlisting">
+namespace boost {
 template <typename BaseClass, typename UT>
 struct transitive_substituable;
}
@@ -4603,7 +4820,8 @@
 This meta-mixin provides the Final class implicit conversions for all
 the underlying types hierarchy.
 
-<pre class="programlisting">template <typename BaseClass, typename UT>
+<pre class="programlisting">
+template <typename BaseClass, typename UT>
struct transitive_substituable;
</pre>
</div>
@@ -4616,7 +4834,8 @@
</h4></div></div></div>
<div class="toc"><dl><dt><a href="index.html#boost.opaque.reference.meta_mixins.transitive_explicit_substituable_hpp.transitive_explicit_substituable">
 Class Template <code class="computeroutput">transitive_explicit_substituable<></code></a></dt></dl></div>
-<pre class="programlisting">namespace boost {
+<pre class="programlisting">
+namespace boost {
 template <typename BaseClass, typename UT>
 struct transitive_explicit_substituable;
}
@@ -4627,7 +4846,8 @@
 Class Template transitive_explicit_substituable<>">
 Class Template <code class="computeroutput">transitive_explicit_substituable<></code></a>
</h5></div></div></div>
-<pre class="programlisting">template <typename BaseClass, typename UT>
+<pre class="programlisting">
+template <typename BaseClass, typename UT>
struct transitive_explicit_substituable;
</pre>

@@ -4677,8 +4897,8 @@
 Features:
 
<div class="itemizedlist"><ul type="disc"><li>
- a
- </li></ul></div>
+ a
+ </li></ul></div>
</div>
</div>
<div class="section" lang="en">
@@ -4688,7 +4908,7 @@
 Rationale</a>
</h3></div></div></div>
<a name="boost.opaque.appendices.rationale.lala"></a><h4>
-<a name="id5018428"></a>
+<a name="id5019602"></a>
 <a href="index.html#boost.opaque.appendices.rationale.lala">lala</a>
 </h4>
</div>
@@ -4699,7 +4919,7 @@
 Implementation Notes</a>
</h3></div></div></div>
<a name="boost.opaque.appendices.implementation.lala"></a><h4>
-<a name="id5018466"></a>
+<a name="id5019640"></a>
 <a href="index.html#boost.opaque.appendices.implementation.lala">lala</a>
 </h4>
</div>
@@ -4729,7 +4949,7 @@
<a name="boost.opaque.appendices.appendix_e__tests.new_class"></a>new_class
</h4></div></div></div>
<div class="table">
-<a name="boost.opaque.appendices.appendix_e__tests.new_class.contructors_and_assignement"></a>Table 7. Contructors and Assignement
+<a name="id5019710"></a>Table 7. Contructors and Assignement
<table class="table" summary="Contructors and Assignement">
<colgroup>
<col>
@@ -4739,142 +4959,142 @@
</colgroup>
<thead><tr>
<th>
- 
- Name
- 
- </th>
-<th>
- 
- kind
- 
- </th>
-<th>
- 
- Description
- 
- </th>
-<th>
- 
- Result
- 
- </th>
+ 
+ Name
+ 
+ </th>
+<th>
+ 
+ kind
+ 
+ </th>
+<th>
+ 
+ Description
+ 
+ </th>
+<th>
+ 
+ Result
+ 
+ </th>
</tr></thead>
<tbody>
<tr>
<td>
- 
- regular_pass
- 
- </td>
+ 
+ regular_pass
+ 
+ </td>
<td>
- 
- run
- 
- </td>
+ 
+ run
+ 
+ </td>
<td>
- 
- check constructors and assignements
- 
- </td>
+ 
+ check constructors and assignements
+ 
+ </td>
<td>
- 
- Pass
- 
- </td>
+ 
+ Pass
+ 
+ </td>
</tr>
<tr>
<td>
- 
- assign_siblings_fail
- 
- </td>
+ 
+ assign_siblings_fail
+ 
+ </td>
<td>
- 
- compile-fail
- 
- </td>
+ 
+ compile-fail
+ 
+ </td>
<td>
- 
- check siblings assignement fail
- 
- </td>
+ 
+ check siblings assignement fail
+ 
+ </td>
<td>
- 
- Pass
- 
- </td>
+ 
+ Pass
+ 
+ </td>
</tr>
<tr>
<td>
- 
- assign_up_fail
- 
- </td>
+ 
+ assign_up_fail
+ 
+ </td>
<td>
- 
- compile-fail
- 
- </td>
+ 
+ compile-fail
+ 
+ </td>
<td>
- 
- check NT can not be assigned to UT
- 
- </td>
+ 
+ check NT can not be assigned to UT
+ 
+ </td>
<td>
- 
- Pass
- 
- </td>
+ 
+ Pass
+ 
+ </td>
</tr>
<tr>
<td>
- 
- assign_down_fail
- 
- </td>
+ 
+ assign_down_fail
+ 
+ </td>
<td>
- 
- compile-fail
- 
- </td>
+ 
+ compile-fail
+ 
+ </td>
<td>
- 
- check UT can not be assigned to NT
- 
- </td>
+ 
+ check UT can not be assigned to NT
+ 
+ </td>
<td>
- 
- Pass
- 
- </td>
+ 
+ Pass
+ 
+ </td>
</tr>
<tr>
<td>
- 
- copy_construct_from_non_convertible_fail
- 
- </td>
+ 
+ copy_construct_from_non_convertible_fail
+ 
+ </td>
<td>
- 
- compile-fail
- 
- </td>
+ 
+ compile-fail
+ 
+ </td>
<td>
- 
- check constructor from non convertibe to UT fails
- 
- </td>
+ 
+ check constructor from non convertibe to UT fails
+ 
+ </td>
<td>
- 
- Pass
- 
- </td>
+ 
+ Pass
+ 
+ </td>
</tr>
</tbody>
</table>
</div>
<div class="table">
-<a name="boost.opaque.appendices.appendix_e__tests.new_class.relational_operators"></a>Table 8. Relational Operators
+<a name="id5019906"></a>Table 8. Relational Operators
<table class="table" summary="Relational Operators">
<colgroup>
<col>
@@ -4884,989 +5104,309 @@
</colgroup>
<thead><tr>
<th>
- 
- Name
- 
- </th>
-<th>
- 
- kind
- 
- </th>
-<th>
- 
- Description
- 
- </th>
-<th>
- 
- Result
- 
- </th>
+ 
+ Name
+ 
+ </th>
+<th>
+ 
+ kind
+ 
+ </th>
+<th>
+ 
+ Description
+ 
+ </th>
+<th>
+ 
+ Result
+ 
+ </th>
</tr></thead>
<tbody>
<tr>
<td>
- 
- using_equal_pass
- 
- </td>
-<td>
- 
- run
- 
- </td>
-<td>
- 
- check <code class="computeroutput">oparator==</code> is available when adding <code class="computeroutput">using_equal</code> meta-mixin
- 
- </td>
-<td>
- 
- Pass
- 
- </td>
-</tr>
-<tr>
-<td>
- 
- using_not_equal_pass
- 
- </td>
-<td>
- 
- run
- 
- </td>
-<td>
- 
- check <code class="computeroutput">oparator!=</code> is available when adding <code class="computeroutput">using_not_equal</code> meta-mixin
- 
- </td>
-<td>
- 
- Pass
- 
- </td>
-</tr>
-<tr>
-<td>
- 
- using_less_than_pass
- 
- </td>
-<td>
- 
- run
- 
- </td>
-<td>
- 
- check <code class="computeroutput">oparator<</code> is available when adding
- <code class="computeroutput">using_less_than</code>
- meta-mixin
- 
- </td>
-<td>
- 
- Pass
- 
- </td>
-</tr>
-<tr>
-<td>
- 
- using_less_than_equal_pass
- 
- </td>
-<td>
- 
- run
- 
- </td>
-<td>
- 
- check <code class="computeroutput">oparator<=</code> is available when adding
- <code class="computeroutput">using_less_than_equal</code>
- meta-mixin
- 
- </td>
-<td>
- 
- Pass
- 
- </td>
-</tr>
-<tr>
-<td>
- 
- using_greater_than_pass
- 
- </td>
-<td>
- 
- run
- 
- </td>
-<td>
- 
- check <code class="computeroutput">oparator></code> is available when adding
- <code class="computeroutput">using_greater_than</code>
- meta-mixin
- 
- </td>
-<td>
- 
- Pass
- 
- </td>
-</tr>
-<tr>
-<td>
- 
- using_greater_than_equal_pass
- 
- </td>
-<td>
- 
- run
- 
- </td>
-<td>
- 
- check <code class="computeroutput">oparator>=</code> is available when adding
- <code class="computeroutput">using_greater_than_equal</code>
- meta-mixin
- 
- </td>
-<td>
- 
- Pass
- 
- </td>
-</tr>
-<tr>
-<td>
- 
- equal_fail
- 
- </td>
-<td>
- 
- compile-fail
- 
- </td>
-<td>
- 
- check check <code class="computeroutput">oparator==</code> fail on default new_class
- 
- </td>
-<td>
- 
- Pass
- 
- </td>
-</tr>
-<tr>
-<td>
- 
- not_equal_fail
- 
- </td>
-<td>
- 
- compile-fail
- 
- </td>
-<td>
- 
- check check <code class="computeroutput">oparator!=</code> fail on default new_class
- 
- </td>
-<td>
- 
- Pass
- 
- </td>
-</tr>
-<tr>
-<td>
- 
- less_than_equal_fail
- 
- </td>
-<td>
- 
- compile-fail
- 
- </td>
-<td>
- 
- check check <code class="computeroutput">oparator<=</code> fail on default new_class
- 
- </td>
-<td>
- 
- Pass
- 
- </td>
-</tr>
-<tr>
-<td>
- 
- less_than_fail
- 
- </td>
+ 
+ using_equal_pass
+ 
+ </td>
<td>
- 
- compile-fail
- 
- </td>
+ 
+ run
+ 
+ </td>
<td>
- 
- check check <code class="computeroutput">oparator<</code> fail on default new_class
- 
- </td>
+ 
+ check <code class="computeroutput">oparator==</code>
+ is available when adding <code class="computeroutput">using_equal</code>
+ meta-mixin
+ 
+ </td>
<td>
- 
- Pass
- 
- </td>
+ 
+ Pass
+ 
+ </td>
</tr>
<tr>
<td>
- 
- greater_than_equal_fail
- 
- </td>
-<td>
- 
- compile-fail
- 
- </td>
-<td>
- 
- check check <code class="computeroutput">oparator>=</code> fail on default new_class
- 
- </td>
-<td>
- 
- Pass
- 
- </td>
-</tr>
-<tr>
-<td>
- 
- greater_than_fail
- 
- </td>
-<td>
- 
- compile-fail
- 
- </td>
-<td>
- 
- check check <code class="computeroutput">oparator></code> fail on default new_class
- 
- </td>
-<td>
- 
- Pass
- 
- </td>
-</tr>
-</tbody>
-</table>
-</div>
-<div class="table">
-<a name="boost.opaque.appendices.appendix_e__tests.new_class.arithmetic_operators"></a>Table 9. Arithmetic Operators
-<table class="table" summary="Arithmetic Operators">
-<colgroup>
-<col>
-<col>
-<col>
-<col>
-</colgroup>
-<thead><tr>
-<th>
- 
- Name
- 
- </th>
-<th>
- 
- kind
- 
- </th>
-<th>
- 
- Description
- 
- </th>
-<th>
- 
- Result
- 
- </th>
-</tr></thead>
-<tbody>
-<tr>
-<td>
- 
- using_plus_pass
- 
- </td>
-<td>
- 
- run
- 
- </td>
-<td>
- 
- check <code class="computeroutput">oparator+</code> is available when adding <code class="computeroutput">using_plus</code> meta-mixin
- 
- </td>
-<td>
- 
- Pass
- 
- </td>
-</tr>
-<tr>
-<td>
- 
- using_plus_assign_pass
- 
- </td>
-<td>
- 
- run
- 
- </td>
-<td>
- 
- check <code class="computeroutput">oparator+=</code> is available when adding <code class="computeroutput">using_plus_assign</code> meta-mixin
- 
- </td>
-<td>
- 
- Pass
- 
- </td>
-</tr>
-<tr>
-<td>
- 
- using_minus_pass
- 
- </td>
-<td>
- 
- run
- 
- </td>
-<td>
- 
- check <code class="computeroutput">oparator-</code> is available when adding <code class="computeroutput">using_minus</code> meta-mixin
- 
- </td>
-<td>
- 
- Pass
- 
- </td>
-</tr>
-<tr>
-<td>
- 
- using_minus_assign_pass
- 
- </td>
-<td>
- 
- run
- 
- </td>
-<td>
- 
- check <code class="computeroutput">oparator-=</code> is available when adding <code class="computeroutput">using_minus_assign</code> meta-mixin
- 
- </td>
-<td>
- 
- Pass
- 
- </td>
-</tr>
-<tr>
-<td>
- 
- using_multiply_pass
- 
- </td>
-<td>
- 
- run
- 
- </td>
-<td>
- 
- check <code class="computeroutput">oparator*</code> is available when adding <code class="computeroutput">using_multiply</code> meta-mixin
- 
- </td>
-<td>
- 
- Pass
- 
- </td>
-</tr>
-<tr>
-<td>
- 
- using_multiply_assign_pass
- 
- </td>
-<td>
- 
- run
- 
- </td>
-<td>
- 
- check <code class="computeroutput">oparator*=</code> is available when adding <code class="computeroutput">using_multiply_assign</code> meta-mixin
- 
- </td>
-<td>
- 
- Pass
- 
- </td>
-</tr>
-<tr>
-<td>
- 
- using_divide_pass
- 
- </td>
-<td>
- 
- run
- 
- </td>
-<td>
- 
- check <code class="computeroutput">oparator/</code> is available when adding <code class="computeroutput">using_divide</code> meta-mixin
- 
- </td>
-<td>
- 
- Pass
- 
- </td>
-</tr>
-<tr>
-<td>
- 
- using_divide_assign_pass
- 
- </td>
-<td>
- 
- run
- 
- </td>
-<td>
- 
- check <code class="computeroutput">oparator/=</code> is available when adding <code class="computeroutput">using_divide_assign</code> meta-mixin
- 
- </td>
-<td>
- 
- Pass
- 
- </td>
-</tr>
-<tr>
-<td>
- 
- using_modulus_pass
- 
- </td>
-<td>
- 
- run
- 
- </td>
-<td>
- 
- check <code class="computeroutput">oparator%</code> is available when adding <code class="computeroutput">using_modulus</code> meta-mixin
- 
- </td>
-<td>
- 
- Pass
- 
- </td>
-</tr>
-<tr>
-<td>
- 
- using_modulus_assign_pass
- 
- </td>
-<td>
- 
- run
- 
- </td>
-<td>
- 
- check <code class="computeroutput">oparator%=</code> is available when adding <code class="computeroutput">using_modulus_assign</code> meta-mixin
- 
- </td>
-<td>
- 
- Pass
- 
- </td>
-</tr>
-<tr>
-<td>
- 
- using_unary_plus_pass
- 
- </td>
-<td>
- 
- run
- 
- </td>
-<td>
- 
- check <code class="computeroutput">oparator+()</code> is available when adding
- <code class="computeroutput">using_unary_plus</code>
- meta-mixin
- 
- </td>
-<td>
- 
- Pass
- 
- </td>
-</tr>
-<tr>
-<td>
- 
- using_unary_minus_pass
- 
- </td>
-<td>
- 
- run
- 
- </td>
-<td>
- 
- check <code class="computeroutput">oparator-()</code> is available when adding
- <code class="computeroutput">using_unary_minus</code>
- meta-mixin
- 
- </td>
-<td>
- 
- Pass
- 
- </td>
-</tr>
-<tr>
-<td>
- 
- using_pre_increment_pass
- 
- </td>
-<td>
- 
- run
- 
- </td>
-<td>
- 
- check <code class="computeroutput">oparator++()</code> is available when adding
- <code class="computeroutput">using_pre_increment</code>
- meta-mixin
- 
- </td>
-<td>
- 
- Pass
- 
- </td>
-</tr>
-<tr>
-<td>
- 
- using_post_increment_pass
- 
- </td>
-<td>
- 
- run
- 
- </td>
-<td>
- 
- check <code class="computeroutput">oparator++(int)</code> is available when adding <code class="computeroutput">using_post_increment</code> meta-mixin
- 
- </td>
-<td>
- 
- Pass
- 
- </td>
-</tr>
-<tr>
-<td>
- 
- using_pre_decrement_pass
- 
- </td>
-<td>
- 
- run
- 
- </td>
-<td>
- 
- check <code class="computeroutput">oparator--()</code> is available when adding
- <code class="computeroutput">using_pre_decrement</code>
- meta-mixin
- 
- </td>
-<td>
- 
- Pass
- 
- </td>
-</tr>
-<tr>
-<td>
- 
- using_post_decrement_pass
- 
- </td>
-<td>
- 
- run
- 
- </td>
-<td>
- 
- check <code class="computeroutput">oparator--(int)</code> is available when adding <code class="computeroutput">using_post_decrement</code> meta-mixin
- 
- </td>
-<td>
- 
- Pass
- 
- </td>
-</tr>
-</tbody>
-</table>
-</div>
-<div class="table">
-<a name="boost.opaque.appendices.appendix_e__tests.new_class.bitwise_operators"></a>Table 10. Bitwise Operators
-<table class="table" summary="Bitwise Operators">
-<colgroup>
-<col>
-<col>
-<col>
-<col>
-</colgroup>
-<thead><tr>
-<th>
- 
- Name
- 
- </th>
-<th>
- 
- kind
- 
- </th>
-<th>
- 
- Description
- 
- </th>
-<th>
- 
- Result
- 
- </th>
-</tr></thead>
-<tbody>
-<tr>
-<td>
- 
- using_bitwise_not_pass
- 
- </td>
-<td>
- 
- run
- 
- </td>
-<td>
- 
- check <code class="computeroutput">oparator~</code> is available when adding <code class="computeroutput">using_bitwise_not</code> meta-mixin
- 
- </td>
+ 
+ using_not_equal_pass
+ 
+ </td>
<td>
- 
- Pass
- 
- </td>
+ 
+ run
+ 
+ </td>
+<td>
+ 
+ check <code class="computeroutput">oparator!=</code>
+ is available when adding <code class="computeroutput">using_not_equal</code>
+ meta-mixin
+ 
+ </td>
+<td>
+ 
+ Pass
+ 
+ </td>
</tr>
<tr>
<td>
- 
- using_bitwise_xor_pass
- 
- </td>
+ 
+ using_less_than_pass
+ 
+ </td>
<td>
- 
- run
- 
- </td>
+ 
+ run
+ 
+ </td>
<td>
- 
- check <code class="computeroutput">oparator^</code> is available when adding <code class="computeroutput">using_bitwise_xor</code> meta-mixin
- 
- </td>
+ 
+ check <code class="computeroutput">oparator<</code>
+ is available when adding <code class="computeroutput">using_less_than</code>
+ meta-mixin
+ 
+ </td>
<td>
- 
- Pass
- 
- </td>
+ 
+ Pass
+ 
+ </td>
</tr>
<tr>
<td>
- 
- using_bitwise_xor_assign_pass
- 
- </td>
+ 
+ using_less_than_equal_pass
+ 
+ </td>
<td>
- 
- run
- 
- </td>
+ 
+ run
+ 
+ </td>
<td>
- 
- check <code class="computeroutput">oparator^=</code> is available when adding <code class="computeroutput">using_bitwise_xor_assign</code> meta-mixin
- 
- </td>
+ 
+ check <code class="computeroutput">oparator<=</code>
+ is available when adding <code class="computeroutput">using_less_than_equal</code>
+ meta-mixin
+ 
+ </td>
<td>
- 
- Pass
- 
- </td>
+ 
+ Pass
+ 
+ </td>
</tr>
<tr>
<td>
- 
- using_bitwise_or_pass
- 
- </td>
+ 
+ using_greater_than_pass
+ 
+ </td>
<td>
- 
- run
- 
- </td>
+ 
+ run
+ 
+ </td>
<td>
- 
- check <code class="computeroutput">oparator|</code> is available when adding <code class="computeroutput">using_bitwise_or</code> meta-mixin
- 
- </td>
+ 
+ check <code class="computeroutput">oparator></code>
+ is available when adding <code class="computeroutput">using_greater_than</code>
+ meta-mixin
+ 
+ </td>
<td>
- 
- Pass
- 
- </td>
+ 
+ Pass
+ 
+ </td>
</tr>
<tr>
<td>
- 
- using_bitwise_or_assign_pass
- 
- </td>
+ 
+ using_greater_than_equal_pass
+ 
+ </td>
<td>
- 
- run
- 
- </td>
+ 
+ run
+ 
+ </td>
<td>
- 
- check <code class="computeroutput">oparator|=</code> is available when adding <code class="computeroutput">using_bitwise_or_assign</code> meta-mixin
- 
- </td>
+ 
+ check <code class="computeroutput">oparator>=</code>
+ is available when adding <code class="computeroutput">using_greater_than_equal</code>
+ meta-mixin
+ 
+ </td>
<td>
- 
- Pass
- 
- </td>
+ 
+ Pass
+ 
+ </td>
</tr>
<tr>
<td>
- 
- using_bitwise_and_pass
- 
- </td>
+ 
+ equal_fail
+ 
+ </td>
<td>
- 
- run
- 
- </td>
+ 
+ compile-fail
+ 
+ </td>
<td>
- 
- check <code class="computeroutput">oparator&</code> is available when adding
- <code class="computeroutput">using_bitwise_and</code>
- meta-mixin
- 
- </td>
+ 
+ check check <code class="computeroutput">oparator==</code> fail on default new_class
+ 
+ </td>
<td>
- 
- Pass
- 
- </td>
+ 
+ Pass
+ 
+ </td>
</tr>
<tr>
<td>
- 
- using_bitwise_and_assign_pass
- 
- </td>
+ 
+ not_equal_fail
+ 
+ </td>
<td>
- 
- run
- 
- </td>
+ 
+ compile-fail
+ 
+ </td>
<td>
- 
- check <code class="computeroutput">oparator&=</code> is available when adding
- <code class="computeroutput">using_bitwise_and_assign</code>
- meta-mixin
- 
- </td>
+ 
+ check check <code class="computeroutput">oparator!=</code> fail on default new_class
+ 
+ </td>
<td>
- 
- Pass
- 
- </td>
+ 
+ Pass
+ 
+ </td>
</tr>
<tr>
<td>
- 
- using_left_shift_pass
- 
- </td>
+ 
+ less_than_equal_fail
+ 
+ </td>
<td>
- 
- run
- 
- </td>
+ 
+ compile-fail
+ 
+ </td>
<td>
- 
- check <code class="computeroutput">oparator<<</code> is available when adding
- <code class="computeroutput">using_left_shift</code>
- meta-mixin
- 
- </td>
+ 
+ check check <code class="computeroutput">oparator<=</code> fail on default new_class
+ 
+ </td>
<td>
- 
- Pass
- 
- </td>
+ 
+ Pass
+ 
+ </td>
</tr>
<tr>
<td>
- 
- using_left_shift_assign_pass
- 
- </td>
+ 
+ less_than_fail
+ 
+ </td>
<td>
- 
- run
- 
- </td>
+ 
+ compile-fail
+ 
+ </td>
<td>
- 
- check <code class="computeroutput">oparator<<=</code> is available when adding
- <code class="computeroutput">using_left_shift_assign</code>
- meta-mixin
- 
- </td>
+ 
+ check check <code class="computeroutput">oparator<</code> fail on default new_class
+ 
+ </td>
<td>
- 
- Pass
- 
- </td>
+ 
+ Pass
+ 
+ </td>
</tr>
<tr>
<td>
- 
- using_right_shift_pass
- 
- </td>
+ 
+ greater_than_equal_fail
+ 
+ </td>
<td>
- 
- run
- 
- </td>
+ 
+ compile-fail
+ 
+ </td>
<td>
- 
- check <code class="computeroutput">oparator>></code> is available when adding
- <code class="computeroutput">using_right_shift</code>
- meta-mixin
- 
- </td>
+ 
+ check check <code class="computeroutput">oparator>=</code> fail on default new_class
+ 
+ </td>
<td>
- 
- Pass
- 
- </td>
+ 
+ Pass
+ 
+ </td>
</tr>
<tr>
<td>
- 
- using_right_shift_assign_pass
- 
- </td>
+ 
+ greater_than_fail
+ 
+ </td>
<td>
- 
- run
- 
- </td>
+ 
+ compile-fail
+ 
+ </td>
<td>
- 
- check <code class="computeroutput">oparator>>=</code> is available when adding
- <code class="computeroutput">using_right_shift_assign</code>
- meta-mixin
- 
- </td>
+ 
+ check check <code class="computeroutput">oparator></code> fail on default new_class
+ 
+ </td>
<td>
- 
- Pass
- 
- </td>
+ 
+ Pass
+ 
+ </td>
</tr>
</tbody>
</table>
</div>
<div class="table">
-<a name="boost.opaque.appendices.appendix_e__tests.new_class.logical_operators"></a>Table 11. Logical Operators
-<table class="table" summary="Logical Operators">
+<a name="id5020561"></a>Table 9. Arithmetic Operators
+<table class="table" summary="Arithmetic Operators">
<colgroup>
<col>
<col>
@@ -5875,94 +5415,816 @@
</colgroup>
<thead><tr>
<th>
- 
- Name
- 
- </th>
-<th>
- 
- kind
- 
- </th>
-<th>
- 
- Description
- 
- </th>
-<th>
- 
- Result
- 
- </th>
+ 
+ Name
+ 
+ </th>
+<th>
+ 
+ kind
+ 
+ </th>
+<th>
+ 
+ Description
+ 
+ </th>
+<th>
+ 
+ Result
+ 
+ </th>
</tr></thead>
<tbody>
<tr>
<td>
- 
- using_logical_not_pass
- 
- </td>
-<td>
- 
- run
- 
- </td>
-<td>
- 
- check <code class="computeroutput">oparator!</code> is available when adding <code class="computeroutput">using_logical_not</code> meta-mixin
- 
- </td>
-<td>
- 
- Pass
- 
- </td>
+ 
+ using_plus_pass
+ 
+ </td>
+<td>
+ 
+ run
+ 
+ </td>
+<td>
+ 
+ check <code class="computeroutput">oparator+</code>
+ is available when adding <code class="computeroutput">using_plus</code>
+ meta-mixin
+ 
+ </td>
+<td>
+ 
+ Pass
+ 
+ </td>
+</tr>
+<tr>
+<td>
+ 
+ using_plus_assign_pass
+ 
+ </td>
+<td>
+ 
+ run
+ 
+ </td>
+<td>
+ 
+ check <code class="computeroutput">oparator+=</code>
+ is available when adding <code class="computeroutput">using_plus_assign</code>
+ meta-mixin
+ 
+ </td>
+<td>
+ 
+ Pass
+ 
+ </td>
+</tr>
+<tr>
+<td>
+ 
+ using_minus_pass
+ 
+ </td>
+<td>
+ 
+ run
+ 
+ </td>
+<td>
+ 
+ check <code class="computeroutput">oparator-</code>
+ is available when adding <code class="computeroutput">using_minus</code>
+ meta-mixin
+ 
+ </td>
+<td>
+ 
+ Pass
+ 
+ </td>
+</tr>
+<tr>
+<td>
+ 
+ using_minus_assign_pass
+ 
+ </td>
+<td>
+ 
+ run
+ 
+ </td>
+<td>
+ 
+ check <code class="computeroutput">oparator-=</code>
+ is available when adding <code class="computeroutput">using_minus_assign</code>
+ meta-mixin
+ 
+ </td>
+<td>
+ 
+ Pass
+ 
+ </td>
+</tr>
+<tr>
+<td>
+ 
+ using_multiply_pass
+ 
+ </td>
+<td>
+ 
+ run
+ 
+ </td>
+<td>
+ 
+ check <code class="computeroutput">oparator*</code>
+ is available when adding <code class="computeroutput">using_multiply</code>
+ meta-mixin
+ 
+ </td>
+<td>
+ 
+ Pass
+ 
+ </td>
+</tr>
+<tr>
+<td>
+ 
+ using_multiply_assign_pass
+ 
+ </td>
+<td>
+ 
+ run
+ 
+ </td>
+<td>
+ 
+ check <code class="computeroutput">oparator*=</code>
+ is available when adding <code class="computeroutput">using_multiply_assign</code>
+ meta-mixin
+ 
+ </td>
+<td>
+ 
+ Pass
+ 
+ </td>
+</tr>
+<tr>
+<td>
+ 
+ using_divide_pass
+ 
+ </td>
+<td>
+ 
+ run
+ 
+ </td>
+<td>
+ 
+ check <code class="computeroutput">oparator/</code>
+ is available when adding <code class="computeroutput">using_divide</code>
+ meta-mixin
+ 
+ </td>
+<td>
+ 
+ Pass
+ 
+ </td>
+</tr>
+<tr>
+<td>
+ 
+ using_divide_assign_pass
+ 
+ </td>
+<td>
+ 
+ run
+ 
+ </td>
+<td>
+ 
+ check <code class="computeroutput">oparator/=</code>
+ is available when adding <code class="computeroutput">using_divide_assign</code>
+ meta-mixin
+ 
+ </td>
+<td>
+ 
+ Pass
+ 
+ </td>
+</tr>
+<tr>
+<td>
+ 
+ using_modulus_pass
+ 
+ </td>
+<td>
+ 
+ run
+ 
+ </td>
+<td>
+ 
+ check <code class="computeroutput">oparator%</code>
+ is available when adding <code class="computeroutput">using_modulus</code>
+ meta-mixin
+ 
+ </td>
+<td>
+ 
+ Pass
+ 
+ </td>
+</tr>
+<tr>
+<td>
+ 
+ using_modulus_assign_pass
+ 
+ </td>
+<td>
+ 
+ run
+ 
+ </td>
+<td>
+ 
+ check <code class="computeroutput">oparator%=</code>
+ is available when adding <code class="computeroutput">using_modulus_assign</code>
+ meta-mixin
+ 
+ </td>
+<td>
+ 
+ Pass
+ 
+ </td>
+</tr>
+<tr>
+<td>
+ 
+ using_unary_plus_pass
+ 
+ </td>
+<td>
+ 
+ run
+ 
+ </td>
+<td>
+ 
+ check <code class="computeroutput">oparator+()</code>
+ is available when adding <code class="computeroutput">using_unary_plus</code>
+ meta-mixin
+ 
+ </td>
+<td>
+ 
+ Pass
+ 
+ </td>
+</tr>
+<tr>
+<td>
+ 
+ using_unary_minus_pass
+ 
+ </td>
+<td>
+ 
+ run
+ 
+ </td>
+<td>
+ 
+ check <code class="computeroutput">oparator-()</code>
+ is available when adding <code class="computeroutput">using_unary_minus</code>
+ meta-mixin
+ 
+ </td>
+<td>
+ 
+ Pass
+ 
+ </td>
+</tr>
+<tr>
+<td>
+ 
+ using_pre_increment_pass
+ 
+ </td>
+<td>
+ 
+ run
+ 
+ </td>
+<td>
+ 
+ check <code class="computeroutput">oparator++()</code>
+ is available when adding <code class="computeroutput">using_pre_increment</code>
+ meta-mixin
+ 
+ </td>
+<td>
+ 
+ Pass
+ 
+ </td>
+</tr>
+<tr>
+<td>
+ 
+ using_post_increment_pass
+ 
+ </td>
+<td>
+ 
+ run
+ 
+ </td>
+<td>
+ 
+ check <code class="computeroutput">oparator++(int)</code>
+ is available when adding <code class="computeroutput">using_post_increment</code>
+ meta-mixin
+ 
+ </td>
+<td>
+ 
+ Pass
+ 
+ </td>
+</tr>
+<tr>
+<td>
+ 
+ using_pre_decrement_pass
+ 
+ </td>
+<td>
+ 
+ run
+ 
+ </td>
+<td>
+ 
+ check <code class="computeroutput">oparator--()</code>
+ is available when adding <code class="computeroutput">using_pre_decrement</code>
+ meta-mixin
+ 
+ </td>
+<td>
+ 
+ Pass
+ 
+ </td>
+</tr>
+<tr>
+<td>
+ 
+ using_post_decrement_pass
+ 
+ </td>
+<td>
+ 
+ run
+ 
+ </td>
+<td>
+ 
+ check <code class="computeroutput">oparator--(int)</code>
+ is available when adding <code class="computeroutput">using_post_decrement</code>
+ meta-mixin
+ 
+ </td>
+<td>
+ 
+ Pass
+ 
+ </td>
</tr>
+</tbody>
+</table>
+</div>
+<div class="table">
+<a name="id5021522"></a>Table 10. Bitwise Operators
+<table class="table" summary="Bitwise Operators">
+<colgroup>
+<col>
+<col>
+<col>
+<col>
+</colgroup>
+<thead><tr>
+<th>
+ 
+ Name
+ 
+ </th>
+<th>
+ 
+ kind
+ 
+ </th>
+<th>
+ 
+ Description
+ 
+ </th>
+<th>
+ 
+ Result
+ 
+ </th>
+</tr></thead>
+<tbody>
<tr>
<td>
- 
- using_logical_and_pass
- 
- </td>
-<td>
- 
- run
- 
- </td>
-<td>
- 
- check <code class="computeroutput">oparator&&</code> is available when adding
- <code class="computeroutput">using_logical_and</code>
- meta-mixin
- 
- </td>
-<td>
- 
- Pass
- 
- </td>
+ 
+ using_bitwise_not_pass
+ 
+ </td>
+<td>
+ 
+ run
+ 
+ </td>
+<td>
+ 
+ check <code class="computeroutput">oparator~</code>
+ is available when adding <code class="computeroutput">using_bitwise_not</code>
+ meta-mixin
+ 
+ </td>
+<td>
+ 
+ Pass
+ 
+ </td>
+</tr>
+<tr>
+<td>
+ 
+ using_bitwise_xor_pass
+ 
+ </td>
+<td>
+ 
+ run
+ 
+ </td>
+<td>
+ 
+ check <code class="computeroutput">oparator^</code>
+ is available when adding <code class="computeroutput">using_bitwise_xor</code>
+ meta-mixin
+ 
+ </td>
+<td>
+ 
+ Pass
+ 
+ </td>
+</tr>
+<tr>
+<td>
+ 
+ using_bitwise_xor_assign_pass
+ 
+ </td>
+<td>
+ 
+ run
+ 
+ </td>
+<td>
+ 
+ check <code class="computeroutput">oparator^=</code>
+ is available when adding <code class="computeroutput">using_bitwise_xor_assign</code>
+ meta-mixin
+ 
+ </td>
+<td>
+ 
+ Pass
+ 
+ </td>
+</tr>
+<tr>
+<td>
+ 
+ using_bitwise_or_pass
+ 
+ </td>
+<td>
+ 
+ run
+ 
+ </td>
+<td>
+ 
+ check <code class="computeroutput">oparator|</code>
+ is available when adding <code class="computeroutput">using_bitwise_or</code>
+ meta-mixin
+ 
+ </td>
+<td>
+ 
+ Pass
+ 
+ </td>
+</tr>
+<tr>
+<td>
+ 
+ using_bitwise_or_assign_pass
+ 
+ </td>
+<td>
+ 
+ run
+ 
+ </td>
+<td>
+ 
+ check <code class="computeroutput">oparator|=</code>
+ is available when adding <code class="computeroutput">using_bitwise_or_assign</code>
+ meta-mixin
+ 
+ </td>
+<td>
+ 
+ Pass
+ 
+ </td>
+</tr>
+<tr>
+<td>
+ 
+ using_bitwise_and_pass
+ 
+ </td>
+<td>
+ 
+ run
+ 
+ </td>
+<td>
+ 
+ check <code class="computeroutput">oparator&</code>
+ is available when adding <code class="computeroutput">using_bitwise_and</code>
+ meta-mixin
+ 
+ </td>
+<td>
+ 
+ Pass
+ 
+ </td>
+</tr>
+<tr>
+<td>
+ 
+ using_bitwise_and_assign_pass
+ 
+ </td>
+<td>
+ 
+ run
+ 
+ </td>
+<td>
+ 
+ check <code class="computeroutput">oparator&=</code>
+ is available when adding <code class="computeroutput">using_bitwise_and_assign</code>
+ meta-mixin
+ 
+ </td>
+<td>
+ 
+ Pass
+ 
+ </td>
+</tr>
+<tr>
+<td>
+ 
+ using_left_shift_pass
+ 
+ </td>
+<td>
+ 
+ run
+ 
+ </td>
+<td>
+ 
+ check <code class="computeroutput">oparator<<</code>
+ is available when adding <code class="computeroutput">using_left_shift</code>
+ meta-mixin
+ 
+ </td>
+<td>
+ 
+ Pass
+ 
+ </td>
+</tr>
+<tr>
+<td>
+ 
+ using_left_shift_assign_pass
+ 
+ </td>
+<td>
+ 
+ run
+ 
+ </td>
+<td>
+ 
+ check <code class="computeroutput">oparator<<=</code>
+ is available when adding <code class="computeroutput">using_left_shift_assign</code>
+ meta-mixin
+ 
+ </td>
+<td>
+ 
+ Pass
+ 
+ </td>
+</tr>
+<tr>
+<td>
+ 
+ using_right_shift_pass
+ 
+ </td>
+<td>
+ 
+ run
+ 
+ </td>
+<td>
+ 
+ check <code class="computeroutput">oparator>></code>
+ is available when adding <code class="computeroutput">using_right_shift</code>
+ meta-mixin
+ 
+ </td>
+<td>
+ 
+ Pass
+ 
+ </td>
+</tr>
+<tr>
+<td>
+ 
+ using_right_shift_assign_pass
+ 
+ </td>
+<td>
+ 
+ run
+ 
+ </td>
+<td>
+ 
+ check <code class="computeroutput">oparator>>=</code>
+ is available when adding <code class="computeroutput">using_right_shift_assign</code>
+ meta-mixin
+ 
+ </td>
+<td>
+ 
+ Pass
+ 
+ </td>
</tr>
+</tbody>
+</table>
+</div>
+<div class="table">
+<a name="id5022189"></a>Table 11. Logical Operators
+<table class="table" summary="Logical Operators">
+<colgroup>
+<col>
+<col>
+<col>
+<col>
+</colgroup>
+<thead><tr>
+<th>
+ 
+ Name
+ 
+ </th>
+<th>
+ 
+ kind
+ 
+ </th>
+<th>
+ 
+ Description
+ 
+ </th>
+<th>
+ 
+ Result
+ 
+ </th>
+</tr></thead>
+<tbody>
<tr>
<td>
- 
- using_logical_or_pass
- 
- </td>
-<td>
- 
- run
- 
- </td>
-<td>
- 
- check <code class="computeroutput">oparator||</code> is available when adding <code class="computeroutput">using_logical_and</code> meta-mixin
- 
- </td>
-<td>
- 
- Pass
- 
- </td>
+ 
+ using_logical_not_pass
+ 
+ </td>
+<td>
+ 
+ run
+ 
+ </td>
+<td>
+ 
+ check <code class="computeroutput">oparator!</code>
+ is available when adding <code class="computeroutput">using_logical_not</code>
+ meta-mixin
+ 
+ </td>
+<td>
+ 
+ Pass
+ 
+ </td>
+</tr>
+<tr>
+<td>
+ 
+ using_logical_and_pass
+ 
+ </td>
+<td>
+ 
+ run
+ 
+ </td>
+<td>
+ 
+ check <code class="computeroutput">oparator&&</code>
+ is available when adding <code class="computeroutput">using_logical_and</code>
+ meta-mixin
+ 
+ </td>
+<td>
+ 
+ Pass
+ 
+ </td>
+</tr>
+<tr>
+<td>
+ 
+ using_logical_or_pass
+ 
+ </td>
+<td>
+ 
+ run
+ 
+ </td>
+<td>
+ 
+ check <code class="computeroutput">oparator||</code>
+ is available when adding <code class="computeroutput">using_logical_and</code>
+ meta-mixin
+ 
+ </td>
+<td>
+ 
+ Pass
+ 
+ </td>
</tr>
</tbody>
</table>
@@ -5981,46 +6243,46 @@
</colgroup>
<thead><tr>
<th>
- 
- Name
- 
+ 
+ Name
+ 
 </th>
<th>
- 
- kind
- 
+ 
+ kind
+ 
 </th>
<th>
- 
- Description
- 
+ 
+ Description
+ 
 </th>
<th>
- 
- Result
- 
+ 
+ Result
+ 
 </th>
</tr></thead>
<tbody><tr>
<td>
- 
- regular.pass
- 
+ 
+ regular.pass
+ 
 </td>
<td>
- 
- run
- 
+ 
+ run
+ 
 </td>
<td>
- 
- check constructors and assignements
- 
+ 
+ check constructors and assignements
+ 
 </td>
<td>
- 
- Pass
- 
+ 
+ Pass
+ 
 </td>
</tr></tbody>
</table></div>
@@ -6038,46 +6300,46 @@
</colgroup>
<thead><tr>
<th>
- 
- Name
- 
+ 
+ Name
+ 
 </th>
<th>
- 
- kind
- 
+ 
+ kind
+ 
 </th>
<th>
- 
- Description
- 
+ 
+ Description
+ 
 </th>
<th>
- 
- Result
- 
+ 
+ Result
+ 
 </th>
</tr></thead>
<tbody><tr>
<td>
- 
- regular.pass
- 
+ 
+ regular.pass
+ 
 </td>
<td>
- 
- run
- 
+ 
+ run
+ 
 </td>
<td>
- 
- check constructors and assignements
- 
+ 
+ check constructors and assignements
+ 
 </td>
<td>
- 
- Pass
- 
+ 
+ Pass
+ 
 </td>
</tr></tbody>
</table></div>
@@ -6093,23 +6355,23 @@
<a name="boost.opaque.appendices.todo"></a> Appendix F: Future plans
</h3></div></div></div>
<a name="boost.opaque.appendices.todo.tasks_to_do_before_review"></a><h4>
-<a name="id5021692"></a>
+<a name="id5022637"></a>
 <a href="index.html#boost.opaque.appendices.todo.tasks_to_do_before_review">Tasks
 to do before review</a>
 </h4>
<div class="itemizedlist"><ul type="disc">
<li>
- Complete the tests
- </li>
+ Complete the tests
+ </li>
<li>
- Add hiding meta-mixins
- </li>
+ Add hiding meta-mixins
+ </li>
</ul></div>
</div>
</div>
</div>
<table xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" width="100%"><tr>
-<td align="left">Last revised: October 04, 2010 at 20:36:10 GMT</td>
+<td align="left">Last revised: January 16, 2011 at 22:23:27 GMT</td>
<td align="right"><div class="copyright-footer"></div></td>
</tr></table>
<hr>

Modified: sandbox/opaque/libs/opaque/doc/opaque.qbk
==============================================================================
--- sandbox/opaque/libs/opaque/doc/opaque.qbk (original)
+++ sandbox/opaque/libs/opaque/doc/opaque.qbk 2011-01-16 17:25:22 EST (Sun, 16 Jan 2011)
@@ -25,13 +25,6 @@
 and casting is brass]]
[:[*['-- ]]]

-[/
-[section Preface]
-
-
-[endsect]
-/]
-
[warning Opaque is not a part of the Boost libraries.]

[/========================]
@@ -54,7 +47,7 @@
* If a name refers to a class template, it is specified like this: `class_template<>`; that is, it is in code font and its name is followed by `<>` to indicate that it is a class template.
* If a name refers to a function-like macro, it is specified like this: `MACRO()`;
 that is, it is uppercase in code font and its name is followed by `()` to indicate that it is a function-like macro. Object-like macros appear without the trailing `()`.
-* Names that refer to /concepts/ in the generic programming sense are specified in CamelCase.
+* Names that refer to /concepts/ in the generic programming sense are specified in CamelCase.

[note In addition, notes such as this one specify non-essential information that provides additional background or rationale.]

@@ -69,7 +62,7 @@

The notion of "opaque typedefs" is a recurring theme (see []). Boost.Serialization contains a macro which is used to define what Robert calls "strong typedefs", but the implementation is not complete.

-The Walter E. Brown's proposals () includes a clear motivation for "opaque typedefs".
+The Walter E. Brown's proposals ([@http://www.open-std.org/jtc1/sc22/wg21/docs/papers/2005/n1891.pdf [*N1891: Progress toward Opaque Typedefs for C++0X] and [@http://www.open-std.org/jtc1/sc22/wg21/docs/papers/2004/n1706.pdf [*N1706: Toward Opaque Typedefs in C++0X]]]) include a clear motivation for "opaque typedefs".

[/
The characteristic feature desired of an opaque typedef is the ability to overload functions and operators based on one or more newly-defined opaque-types. For example, we would wish to overload the constructors in a `PhysicsVector` class such that each constructor corresponds to a distinct coordinate system. Using Boost/Opaque, we can code this as:
@@ -102,7 +95,7 @@
# Application of inheritance makes no provision that permits a base class to be cv-qualified.
]

-In Alisdair Meredith showed in [] the implicitly generating forwarding constructors to a base class new C++0x feature could not be useful to address this issue completly. Using this new feature it becomes possible to create something very like the required opaque typedef. For example:
+Alisdair Meredith showed in [@http://www.open-std.org/jtc1/sc22/wg21/docs/papers/2006/n2141.html [*N2141: Strong Typedefs in C++09(Revisited)]] that the new C++0x feature that implicitly generates forward constructors to a base class, could not be useful to address this issue completly. Using this new feature it becomes possible to create something very like the required opaque typedef. For example:

 struct MyType : std::string {
 using string::string;
@@ -110,7 +103,7 @@

This type is distrinct from `std::string`, functions can be overloaded on this type as well as `std::string`, yet `std::string` is not convertible to this type.

-As this proposals will not be part of the C++0x standard, a library solution that could satisfy most of the requirements seems a loable approach.
+As this proposals will not be part of the C++0x standard, a library solution that could satisfy most of the requirements seems a loable alternative.

[endsect]
@@ -148,7 +141,7 @@
[heading Getting Boost.Opaque]
[/=================================]

-You can get the last stable release of [*Boost.Opaque] by downloading [^ppaque.zip] from the
+You can get the last stable release of [*Boost.Opaque] by downloading [^opaque.zip] from the
[@http://www.boostpro.com/vault/index.php?action=downloadfile&filename=opaque.zip&directory=Utilities& Boost Vault Utilities directory]

You can also access the latest (unstable?) state from the [@https://svn.boost.org/svn/boost/sandbox/opaque Boost Sandbox].
@@ -190,7 +183,6 @@
Windows with

* MSVC 10.0
-* MSVC 9.0 Express

Cygwin 1.5 with

@@ -205,6 +197,8 @@
* GCC 4.4.0
* GCC 4.5.0
* GCC 4.5.0 C++0x
+* GCC 4.6.0
+* GCC 4.6.0 C++0x

[note Please send any questions, comments and bug reports to boost <at> lists <dot> boost <dot> org.]

@@ -225,7 +219,7 @@

[section How to define a real new typedef?]

-We will start with the definition of a new type identifier which is based on an underlying int type and has the relational operators so it can be stored on a sorted container.
+We will start with the definition of a new type identifier which is based on an underlying `int` type and has the relational operators so it can be stored on a sorted container.

 struct Identifier_tag;
 typedef boost::opaque::new_type< int, Identifier_tag,
@@ -238,27 +232,27 @@

 struct Identifier_tag;

-New we use the opaque new_type class which has as parameters:
+New we use the opaque `new_type` class which has as parameters:

* the underlying type (`int`),
-* the unique tag of the new type (`Identifier_tag`),
+* the unique tag of the `new type` (`Identifier_tag`),
* a MPL sequence of additions (`mpl::vector<opaque::using_totally_ordered1>`)

-This will declare Identifier as new type different from `int` that provides just the operation associated to a `totally_ordered` concept. The concepts are represented by the library in the form a meta-mixin and are named with the `using_` prefix, e.g. as `using_totally_ordered1`.
+This will declare `Identifier` as new type different from `int` that provides just the operation associated to a `totally_ordered` concept. The concepts are represented by the library in the form a meta-mixin and are named with the `using_` prefix, e.g. as `using_totally_ordered1`. We will see later what a meta-mixin intends for.

-We can now use Identifier as new int type, but limited to the totally ordered operations.
+We can now use `Identifier` as new `int` type, but limited to the totally ordered operations.

-[*Boost.Opaque] provides a macros to simplify the preceding declaration
+[*Boost.Opaque] provides a macro to simplify the preceding declaration

- BOOST_OPAQUE_NEW_TYPE(int, Identifier, ((opaque::using_totally_ordered1)))
+ BOOST_OPAQUE_NEW_TYPE(int, Identifier, (opaque::using_totally_ordered1))

-The macros is responsable to define a uniqye tag and transform the preprocessor PPL sequence into a MPL sequence.
+The macros is responsable to define a unique tag and transform the preprocessor sequence into a MPL sequence.

[endsect]

[section How to define a real new type?]

-In the prededing example we use a tag to ensure type unicity. When the user needs to add yet some specific methods, this tag is no more necessary as we need to define already a new class.
+In the prededing example we have used a tag to ensure type unicity. When the user needs to add yet some specific methods, this tag is no more necessary as we need to define already a new class.

 class Identifier : boost::opaque::new_class<Identifier, int,
 boost::mpl::vector<
@@ -271,25 +265,25 @@

In this case we use the mixin class `new_class` instead. The `new_class` class template has the following arguments,

-* the class we are defining
+* the final class we are defining
* the underlying type (`int`),
-* a MPL sequence of additions (`mpl::vector<opaque::using_totally_ordered1>`)
+* a MPL sequence of additions `mpl::vector<opaque::using_totally_ordered1>`

[*Boost.Opaque] provides a macro `BOOST_OPAQUE_NEW_CLASS` to simplify the preceding declaration

- BOOST_OPAQUE_NEW_CLASS(Identifier, int, ((opaque::using_totally_ordered1)))
+ BOOST_OPAQUE_NEW_CLASS(Identifier, int, (opaque::using_totally_ordered1))
 {
 void print();
 // ...
 }

-The macros is responsable to define a unique tag and transform the preprocessor PPL sequence into a MPL sequence.
+The macros is responsable to transform the preprocessor sequence into a MPL sequence.

[endsect]

[section Return type for relational operators: `opaque::boolean`]

-The following code doesn't warns in (1) when we use `0` where a `bool` is expected.
+The following code doesn't warms in (1) when we use the integer `0` where a `bool` is expected.

 typedef bool Bool;
 typedef int Int;
@@ -307,7 +301,7 @@

 Bool f(Int a, Int b)
 {
- if(cnd()) return 0; // (1) Error
+ if(cnd()) return 0; // (1) Error
 else return a > b; // (2) Error
 }

@@ -315,13 +309,13 @@

 Bool f(Int a, Int b)
 {
- if(cnd()) return opaque::false_; // OK
- else return a > b; // (2) Error
+ if(cnd()) return opaque::false_; // OK
+ else return a > b; // (2) Error
 }

-But now we also get an error on (2) as `a > b` is not convertible to `opaque::boolean`. To solve this issue we need that the signature `Int > Int` be convertible to `opaque::boolean`.
+But we also get an error on (2) as `a > b` is not convertible to `opaque::boolean`. To solve this issue we need that the signature `Int > Int` be convertible to `opaque::boolean`.

-[*Boost.Opaque] provides a meta-mixin that allos to define an integer-like class that use `opaque::boolean` as type for the result of the relational operators.
+[*Boost.Opaque] provides a meta-mixin that allow to define an integer-like class that use `opaque::boolean` as type for the result of the relational operators.

 struct Int_tag;
 typedef boost::opaque::new_type<int, Int_tag, boost::mpl::vector<
@@ -332,7 +326,7 @@

Or using the macro

- BOOST_OPAQUE_NEW_TYPE(int, Int, ((opaque::using_integer_like<opaque::boolean>)))
+ BOOST_OPAQUE_NEW_TYPE(int, Int, (opaque::using_integer_like<opaque::boolean>))

[endsect]
@@ -370,7 +364,7 @@
Opaque typedef are explicitly convertible to the underlying type. But are they implicitly convertible? It depends. So the library provide two kind of opaque typedef :

* public opaque typedef: implicit conversion to the underlying type
-* public opaque typedef: explict conversion to the underlying type
+* private opaque typedef: explict conversion to the underlying type

@@ -378,35 +372,32 @@

[section Hiding inherited operations]

-Sometimes we want to inherit most of the operations inherited from the underlying type. We can either use the `new_type` class and bee explicit on which operation we want
+Sometimes we want to inherit most of the operations inherited from the underlying type. We can either use the `new_type` class and be explicit on which operation we want

- BOOST_OPAQUE_NEW_TYPE(UT, NT, (
+ BOOST_OPAQUE_NEW_TYPE(UT, NT,
 (opaque::using_ope1)
 (opaque::using_ope2)
 ...
 (opaque::using_open)
- ))
+ )

-Or we can use opaque types and state explicitly which operation wil be hidden.
+or we can use opaque types and state explicitly which operation will be hidden.

- BOOST_OPAQUE_PUBLIC_OPAQUE_TYPE(UT, NT, (
+ BOOST_OPAQUE_PUBLIC_OPAQUE_TYPE(UT, NT,
 (opaque::hiding_opeK)
- ))
+ )

[endsect]
[section Underlying types hierarchy]

-Opaque and underlying types form a hierarchy with a implicit or explicit conversion from the OT to the UT. This convertibility is a relation.
-It seems natural that this relation satisfy the transitivity property.
+Opaque and underlying types form a hierarchy with a implicit or explicit conversion from the OT to the UT. This convertibility is a relation. It seems natural that this relation satisfy the transitivity property.

[endsect]

[section Using UDT as Underlying types]

-Talk about the problem with direct member access that can not be wrapped by the underlying type.
-
For example we can access the fisrt field of the UT pair, but the OT can not give this access. Instead the OT could define some function accessors that inderectly will almost behave as the data member.

 struct UT {
@@ -544,6 +535,7 @@
[/==========================================================================================]

 namespace boost {
+ namespace opaque {
 class base_new_type;

 template <
@@ -563,6 +555,7 @@
>
 T opaque_static_cast(new_class<Final, UT, MetaMixinSeq, Base> const& v);
 }
+ }

[/==========================================================================================]
[section:base_new_type Class Template `base_new_type<>`]
@@ -626,9 +619,9 @@

[*Requirements]

-* `UT` must be a model of a CopyCOnstructible and Assignable.
+* `UT` must be a model of a `CopyConstructible` and `Assignable`.
* `Final` must be a model of FinalUnderlying.
-* `MetaMixinSeq` must be a model of FinalUnderlying: defaulted to the empty sequence.
+* `MetaMixinSeq` must be a model of `MetaMixinSeq`: defaulted to the empty sequence.
* `Base` is defaulted to the base class of all the new types `base_new_type`.

@@ -649,9 +642,9 @@

[*Requirements]

-* `T` and `UT` must be a model of a CopyCOnstructible and Assignable.
+* `T` and `UT` must be a model of a `CopyConstructible` and `Assignable`.
* `Final` must be a model of FinalUnderlying.
-* `MetaMixinSeq` must be a model of FinalUnderlying.
+* `MetaMixinSeq` must be a model of `MetaMixinSeq`.

[endsect]

@@ -661,12 +654,15 @@
[/==========================================================================================]

 namespace boost {
+ namespace opaque {
 template <
 typename UT,
 typename Tag,
 typename MetaMixinSeq=boost::mpl::vector0<>,
 typename Base=base_new_type>
 class new_type;
+ }
+ }

[/==========================================================================================]
[section:new_type Class Template `new_type<>`]
@@ -692,9 +688,9 @@

[*Requirements]

-* `UT` must be a model of a CopyCOnstructible and Assignable.
+* `UT` must be a model of a `CopyConstructible` and `Assignable`.
* `Tag` must be a unique class.
-* `MetaMixinSeq` must be a model of FinalUnderlying: defaulted to the empty sequence.
+* `MetaMixinSeq` must be a model of `MetaMixinSeq`: defaulted to the empty sequence.
* `Base` is defaulted to the base class of all the new types `base_new_type`.

@@ -756,6 +752,7 @@
[/==========================================================================================]

 namespace boost {
+ namespace opaque {
 class base_private_opaque_type;
 template <
 typename Final,
@@ -765,6 +762,7 @@
>
 class private_opaque_class;
 }
+ }

[/==========================================================================================]
@@ -791,7 +789,7 @@
* Can instances of OT be implicitly converted to instances of UT? No
* Can instances of OT be implicitly converted to instances of convertible to UT? No

-[note Waiting for explicit conversion operators, the explicit conversion must be done through the underlying function]
+[note On compilers don't supporting explicit conversion operators, the explicit conversion must be done through the `underlying` function]

`private_opaque_class<>` is a `new_class` with the `transitive_explicit_substituable<base_private_opaque_type>` and `inherited_from_underlying<UT>` added to the sequence of meta-mixins MetaMixinSeq, so a `private_opaque_class` inherits from all the operations of tye underlying type and adds transitive explicit conversions to all the substituables. The nested typedef `substituables` is the MPL sequence of all the UT in the opaque type hierarchy.

@@ -823,6 +821,7 @@
 explicit private_opaque_class(UT v);
 template <typename W>
 explicit private_opaque_class(W v);
+ explicit operator UT() const;
 };

[endsect]
@@ -834,6 +833,7 @@
[/==========================================================================================]

 namespace boost {
+ namespace opaque {
 template <
 typename Final,
 typename UT,
@@ -842,6 +842,7 @@
>
 class private_opaque_type;
 }
+ }

[/==========================================================================================]
[section:private_opaque_type Class Template `private_opaque_type<>`]
@@ -871,9 +872,9 @@

[*Requirements]

-* `UT` must be a model of a CopyCOnstructible and Assignable.
+* `UT` must be a model of a `CopyConstructible` and `Assignable`.
* `Tag` must be a unique class.
-* `MetaMixinSeq` must be a model of FinalUnderlying: defaulted to the empty sequence.
+* `MetaMixinSeq` must be a model of `MetaMixinSeq`: defaulted to the empty sequence.
* `Base` is defaulted to the base class of all the new types `base_new_type`.

@@ -885,6 +886,7 @@
[/==========================================================================================]

 namespace boost {
+ namespace opaque {
 class base_public_opaque_type;

 template <typename T>
@@ -898,6 +900,7 @@
>
 class public_opaque_class;
 }
+ }

[/==========================================================================================]
@@ -978,6 +981,7 @@
[/==========================================================================================]

 namespace boost {
+ namespace opaque {
 template <
 typename Final,
 typename UT,
@@ -986,12 +990,13 @@
>
 class public_opaque_type;
 }
+ }

[/==========================================================================================]
[section:public_opaque_type Class Template `public_opaque_type<>`]
[/==========================================================================================]

-`private_opaque_typublic_opaque_typepe<>` provides the equivalent of `public_opaque_class<>` but can be used as a typedef.
+`public_opaque_type<>` provides the equivalent of `public_opaque_class<>` but can be used as a typedef.

 template <
 typename Final,
@@ -1015,9 +1020,9 @@

[*Requirements]

-* `UT` must be a model of a CopyCOnstructible and Assignable.
+* `UT` must be a model of a `CopyConstructible` and `Assignable`.
* `Tag` must be a unique class.
-* `MetaMixinSeq` must be a model of FinalUnderlying: defaulted to the empty sequence.
+* `MetaMixinSeq` must be a model of `MetaMixinSeq`: defaulted to the empty sequence.
* `Base` is defaulted to the base class of all the new types `base_new_type`.

[endsect]
@@ -1061,9 +1066,9 @@

Classes that models the `FinalUnderlying` concept satisfy the following expressions:

-Let `B` a base class of `Final`, `b` an instance of `B`, `bc` an instance of `B const`, `f` an instace of `Final` and fc and instance of `Final const '.
+Let `B` a base class of `Final`, `b` an instance of `B`, `bc` an instance of `B const`, `f` an instace of `Final` and `fc` and instance of `Final const '.

-* `Final::underlying_type` the underlying type
+* `Final::underlying_type` the underlying type.
* `Final::underlying(&b)` return a reference to `Final::underlying_type&` associated to `b`.
* `Final::underlying(&bc)` return a constant reference to `Final::underlying_type const&` associated to `bc`.
* `f.underlying()` return a reference to `Final::underlying_type&` associated to `f`.
@@ -1077,7 +1082,7 @@
[section:Mixin `Mixin`]
[/==========================================================================================]

-A Mixin is a template class having two template parameters, the Final type and the Base type. The Final parameter must satisfy the Final requirements.
+A Mixin is a template class having two template parameters, the Final type and the Base type.

The archetype of a Mixin is

@@ -1132,7 +1137,7 @@
[section:linear_hierarchy Class Template `linear_hierarchy<>`]
[/==========================================================================================]

-The `linear_hierarchy` metafunction gererates a linear hierarchy by folding the Mixins obtained by application of the `MetaMixin` in `MetaMixinSeq`.
+The `linear_hierarchy` metafunction gererates a linear hierarchy by folding the Mixins obtained by application of the `MetaMixin`s in `MetaMixinSeq`.

 template<typename MetaMixinSeq, typename Final, typename Base>
 struct linear_hierarchy {
@@ -1162,13 +1167,14 @@

`inherited_from_underlying` is a `MetaMixin` which adds wrapping member to the underlyibg type `UT`.

-This class must specialized for specific types in order to make easier the construction of opaque types having `UT` as underlying type. For example the library provide specializations for each one of the buil-in types.
+This class must be specialized for specific types in order to make easier the construction of opaque types having `UT` as underlying type. For example the library provide specializations for each one of the built-in types.

 template <typename Bool>
 struct inherited_from_underlying<int> {
 template <typename Final, typename Base>
 struct type; //implementation defined
 };
+
[endsect]

[endsect]
@@ -1177,7 +1183,7 @@
[section:using_operators_hpp Header `<boost/opaque/meta_mixin/using_operators.hpp>`]
[/==========================================================================================]

-This file includes meta-mixins that are used to add un operator overloads forwarding from the Final type to the underlying type. There is a meta-mixins for each one of the C++ overloadable operators.
+This file includes meta-mixins that are used to add an operator overload forwarding from the final type to the underlying type. There is a meta-mixin for each one of the C++ overloadable operators.

These meta-mixins have names that follows the naming used in Boost.ConceptsTraits, but prefixed by `using_`.

@@ -1188,26 +1194,32 @@

The requirements for the types used to instantiate the simple operator templates are specified in terms of expressions which must be valid and the expression's return type.

-
These meta-mixins are "simple" since they provide un operator based on a single operation the underlying type has to provide. They have an additional optional template parameter Base, which is not shown, for the base class chaining technique.

In the following table the meta-mixin follows the schema

- struct meta-mixins {
+ struct meta-mixin {
 template <typename NT, typename Base>
 struct type: Base {
 // Supplied Operation
 };
 };

-* NT/NT2 is expected to satisfy the FinalUnderlying requirements.
-* UT stands for NT::underlying_type
-* UT2 stands for NT2::underlying_type
-* this_ut is the instance UT reference obtained NT::underlying(this)
-* lhs is a NT/NT2 const reference
-* rhs is a NT/NT2 const reference
-* lhs_ut is the instance UT reference obtained lhs.underlying()
-* rhs_ut is the instance UT reference obtained rhs.underlying()
+* `NT`/`NT2` is expected to satisfy the `FinalUnderlying` requirements.
+
+* `UT` stands for `NT::underlying_type`.
+
+* `UT2` stands for `NT2::underlying_type`.
+
+* `this_ut` is the instance `UT` reference obtained `NT::underlying(this)`.
+
+* `lhs` is a `NT`/`NT2 const` reference.
+
+* `rhs` is a `NT`/`NT2 const` reference.
+
+* `lhs_ut` is the instance `UT` reference obtained `lhs.underlying()`.
+
+* `rhs_ut` is the instance `UT` reference obtained `rhs.underlying()`.

[table Relational operators

Next message: joel_at_[hidden]: "[Boost-commit] svn:boost r68196 - in trunk/boost/spirit/home/qi/numeric: . detail"
Previous message: christophe.j.henry_at_[hidden]: "[Boost-commit] svn:boost r68194 - trunk/boost/msm/back"

Date view	Thread view	Subject view	Author view

Boost-Commit list run by bdawes at acm.org, david.abrahams at rcn.com, gregod at cs.rpi.edu, cpdaniel at pacbell.net, john at johnmaddock.co.uk