Boost-Commit :

Date view	Thread view	Subject view	Author view

Subject: [Boost-commit] svn:boost r50221 - in trunk/doc/test/gold: . boost boost/accumulators boost/accumulators/extract boost/accumulators/impl boost/accumulators/tag document_to_test_formatting images/accumulators
From: john_at_[hidden]
Date: 2008-12-09 07:11:14

Next message: daniel_james_at_[hidden]: "[Boost-commit] svn:boost r50222 - trunk/tools/boostbook/xsl"
Previous message: john_at_[hidden]: "[Boost-commit] svn:boost r50220 - in trunk/doc/test: . gold"

Author: johnmaddock
Date: 2008-12-09 07:11:12 EST (Tue, 09 Dec 2008)
New Revision: 50221
URL: http://svn.boost.org/trac/boost/changeset/50221

Log:
Added reference build.
Added:
   trunk/doc/test/gold/boost/
   trunk/doc/test/gold/boost/accumulators/
   trunk/doc/test/gold/boost/accumulators/extract/
   trunk/doc/test/gold/boost/accumulators/extract/weighted_tail_quantile.html (contents, props changed)
   trunk/doc/test/gold/boost/accumulators/impl/
   trunk/doc/test/gold/boost/accumulators/impl/weighted_tail_quantile__id226526.html (contents, props changed)
   trunk/doc/test/gold/boost/accumulators/tag/
   trunk/doc/test/gold/boost/accumulators/tag/weighted_tail_quantile.html (contents, props changed)
   trunk/doc/test/gold/boost/array.html (contents, props changed)
   trunk/doc/test/gold/document_to_test_formatting/
   trunk/doc/test/gold/document_to_test_formatting/accumulators.html (contents, props changed)
   trunk/doc/test/gold/document_to_test_formatting/array.html (contents, props changed)
   trunk/doc/test/gold/document_to_test_formatting/basic_formatting.html (contents, props changed)
   trunk/doc/test/gold/document_to_test_formatting/blurbs.html (contents, props changed)
   trunk/doc/test/gold/document_to_test_formatting/code_blocks.html (contents, props changed)
   trunk/doc/test/gold/document_to_test_formatting/images.html (contents, props changed)
   trunk/doc/test/gold/document_to_test_formatting/lists_and_tables.html (contents, props changed)
   trunk/doc/test/gold/document_to_test_formatting/remez.html (contents, props changed)
   trunk/doc/test/gold/document_to_test_formatting/test.html (contents, props changed)
   trunk/doc/test/gold/images/accumulators/
   trunk/doc/test/gold/images/accumulators/doxygen.png (contents, props changed)
   trunk/doc/test/gold/images/accumulators/form_0.png (contents, props changed)
   trunk/doc/test/gold/images/accumulators/form_1.png (contents, props changed)
   trunk/doc/test/gold/images/accumulators/form_2.png (contents, props changed)
   trunk/doc/test/gold/images/accumulators/form_3.png (contents, props changed)
   trunk/doc/test/gold/images/accumulators/form_4.png (contents, props changed)
   trunk/doc/test/gold/images/accumulators/form_5.png (contents, props changed)
   trunk/doc/test/gold/images/accumulators/form_6.png (contents, props changed)
   trunk/doc/test/gold/images/accumulators/form_7.png (contents, props changed)
   trunk/doc/test/gold/images/accumulators/form_8.png (contents, props changed)
   trunk/doc/test/gold/index.html (contents, props changed)

Added: trunk/doc/test/gold/boost/accumulators/extract/weighted_tail_quantile.html
==============================================================================
--- (empty file)
+++ trunk/doc/test/gold/boost/accumulators/extract/weighted_tail_quantile.html 2008-12-09 07:11:12 EST (Tue, 09 Dec 2008)
@@ -0,0 +1,50 @@
+<html>
+<head>
+<meta http-equiv="Content-Type" content="text/html; charset=ISO-8859-1">
+<title>Global weighted_tail_quantile</title>
+<link rel="stylesheet" href="../../../../../../doc/html/boostbook.css" type="text/css">
+<meta name="generator" content="DocBook XSL Stylesheets Vsnapshot_8125">
+<link rel="home" href="../../../index.html" title="Document To Test Formatting">
+<link rel="up" href="../../../document_to_test_formatting/accumulators.html#header.boost.trunk.doc.test.weighted_tail_quantile_hpp" title="Header <boost/trunk/doc/test/weighted_tail_quantile.hpp>">
+<link rel="prev" href="../../../document_to_test_formatting/accumulators.html" title="Accumulators Example Doxygen Documentation">
+<link rel="next" href="../impl/weighted_tail_quantile__id226526.html" title="Struct template weighted_tail_quantile_impl">
+</head>
+<body bgcolor="white" text="black" link="#0000FF" vlink="#840084" alink="#0000FF">
+<table cellpadding="2" width="100%"><tr>
+<td valign="top"><img alt="Boost C++ Libraries" width="277" height="86" src="../../../../../../boost.png"></td>
+<td align="center">Home</td>
+<td align="center">Libraries</td>
+<td align="center">People</td>
+<td align="center">FAQ</td>
+<td align="center">More</td>
+</tr></table>
+<hr>
+<div class="spirit-nav">
+<a accesskey="p" href="../../../document_to_test_formatting/accumulators.html"><img src="../../../../../../doc/html/images/prev.png" alt="Prev"></a><a accesskey="u" href="../../../document_to_test_formatting/accumulators.html#header.boost.trunk.doc.test.weighted_tail_quantile_hpp"><img src="../../../../../../doc/html/images/up.png" alt="Up"></a><a accesskey="h" href="../../../index.html"><img src="../../../../../../doc/html/images/home.png" alt="Home"></a><a accesskey="n" href="../impl/weighted_tail_quantile__id226526.html"><img src="../../../../../../doc/html/images/next.png" alt="Next"></a>
+</div>
+<div class="refentry" lang="en">
+<a name="boost.accumulators.extract.weighted_tail_quantile"></a><div class="titlepage"></div>
+<div class="refnamediv">
+<h2>Global weighted_tail_quantile</h2>
+boost::accumulators::extract::weighted_tail_quantile
+</div>
+<h2 xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" class="refsynopsisdiv-title">Synopsis</h2>
+<div xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" class="refsynopsisdiv"><pre class="synopsis">// In header: <<a class="link" href="../../../document_to_test_formatting/accumulators.html#header.boost.trunk.doc.test.weighted_tail_quantile_hpp" title="Header <boost/trunk/doc/test/weighted_tail_quantile.hpp>">boost/trunk/doc/test/weighted_tail_quantile.hpp</a>>
+
+extractor< tag::quantile > const weighted_tail_quantile;</pre></div>
+</div>
+<table xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" width="100%"><tr>
+<td align="left"></td>
+<td align="right"><div class="copyright-footer">Copyright © 2007 John Maddock, Joel de Guzman, Eric Niebler and Matias
+ Capeletto
+ 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)
+ 
+</div></td>
+</tr></table>
+<hr>
+<div class="spirit-nav">
+<a accesskey="p" href="../../../document_to_test_formatting/accumulators.html"><img src="../../../../../../doc/html/images/prev.png" alt="Prev"></a><a accesskey="u" href="../../../document_to_test_formatting/accumulators.html#header.boost.trunk.doc.test.weighted_tail_quantile_hpp"><img src="../../../../../../doc/html/images/up.png" alt="Up"></a><a accesskey="h" href="../../../index.html"><img src="../../../../../../doc/html/images/home.png" alt="Home"></a><a accesskey="n" href="../impl/weighted_tail_quantile__id226526.html"><img src="../../../../../../doc/html/images/next.png" alt="Next"></a>
+</div>
+</body>
+</html>

Added: trunk/doc/test/gold/boost/accumulators/impl/weighted_tail_quantile__id226526.html
==============================================================================
--- (empty file)
+++ trunk/doc/test/gold/boost/accumulators/impl/weighted_tail_quantile__id226526.html 2008-12-09 07:11:12 EST (Tue, 09 Dec 2008)
@@ -0,0 +1,91 @@
+<html>
+<head>
+<meta http-equiv="Content-Type" content="text/html; charset=ISO-8859-1">
+<title>Struct template weighted_tail_quantile_impl</title>
+<link rel="stylesheet" href="../../../../../../doc/html/boostbook.css" type="text/css">
+<meta name="generator" content="DocBook XSL Stylesheets Vsnapshot_8125">
+<link rel="home" href="../../../index.html" title="Document To Test Formatting">
+<link rel="up" href="../../../document_to_test_formatting/accumulators.html#header.boost.trunk.doc.test.weighted_tail_quantile_hpp" title="Header <boost/trunk/doc/test/weighted_tail_quantile.hpp>">
+<link rel="prev" href="../extract/weighted_tail_quantile.html" title="Global weighted_tail_quantile">
+<link rel="next" href="../tag/weighted_tail_quantile.html" title="Struct template weighted_tail_quantile">
+</head>
+<body bgcolor="white" text="black" link="#0000FF" vlink="#840084" alink="#0000FF">
+<table cellpadding="2" width="100%"><tr>
+<td valign="top"><img alt="Boost C++ Libraries" width="277" height="86" src="../../../../../../boost.png"></td>
+<td align="center">Home</td>
+<td align="center">Libraries</td>
+<td align="center">People</td>
+<td align="center">FAQ</td>
+<td align="center">More</td>
+</tr></table>
+<hr>
+<div class="spirit-nav">
+<a accesskey="p" href="../extract/weighted_tail_quantile.html"><img src="../../../../../../doc/html/images/prev.png" alt="Prev"></a><a accesskey="u" href="../../../document_to_test_formatting/accumulators.html#header.boost.trunk.doc.test.weighted_tail_quantile_hpp"><img src="../../../../../../doc/html/images/up.png" alt="Up"></a><a accesskey="h" href="../../../index.html"><img src="../../../../../../doc/html/images/home.png" alt="Home"></a><a accesskey="n" href="../tag/weighted_tail_quantile.html"><img src="../../../../../../doc/html/images/next.png" alt="Next"></a>
+</div>
+<div class="refentry" lang="en">
+<a name="boost.accumulators.impl.weighted_tail_quantile__id226526"></a><div class="titlepage"></div>
+<div class="refnamediv">
+<h2>Struct template weighted_tail_quantile_impl</h2>
+boost::accumulators::impl::weighted_tail_quantile_impl — Tail quantile estimation based on order statistics of weighted samples (for both left and right tails). 
+</div>
+<h2 xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" class="refsynopsisdiv-title">Synopsis</h2>
+<div xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" class="refsynopsisdiv"><pre class="synopsis">// In header: <<a class="link" href="../../../document_to_test_formatting/accumulators.html#header.boost.trunk.doc.test.weighted_tail_quantile_hpp" title="Header <boost/trunk/doc/test/weighted_tail_quantile.hpp>">boost/trunk/doc/test/weighted_tail_quantile.hpp</a>>
+
+template<typename Sample, typename Weight, typename LeftRight>
+struct <a class="link" href="weighted_tail_quantile__id226526.html" title="Struct template weighted_tail_quantile_impl">weighted_tail_quantile_impl</a> {
+ // types
+ typedef numeric::functional::average< Weight, std::size_t >::result_type <a name="boost.accumulators.impl.weighted_tail_quantile__id226526.float_type"></a>float_type;
+ typedef Sample <a name="boost.accumulators.impl.weighted_tail_quantile__id226526.result_type"></a>result_type;
+
+ // <a class="link" href="weighted_tail_quantile__id226526.html#boost.accumulators.impl.weighted_tail_quantile__id226526construct-copy-destruct">construct/copy/destruct</a>
+ <a class="link" href="weighted_tail_quantile__id226526.html#id226362-bb">weighted_tail_quantile_impl</a>(dont_care);
+
+ // <a class="link" href="weighted_tail_quantile__id226526.html#id226739-bb">public member functions</a>
+ template<typename Args> result_type <a class="link" href="weighted_tail_quantile__id226526.html#id226647-bb">result</a>(Args const &) const;
+};</pre></div>
+<div class="refsect1" lang="en">
+<a name="id545120"></a><h2>Description</h2>
+An estimator <img src="../../../images/accumulators/form_0.png"> of tail quantiles with level <img src="../../../images/accumulators/form_1.png"> based on order statistics <img src="../../../images/accumulators/form_2.png"> of weighted samples are given by <img src="../../../images/accumulators/form_3.png"> (left tail) and <img src="../../../images/accumulators/form_4.png"> (right tail), where
+<div class="equation">
+<a name="id545243"></a>Equation 1. 
+<div class="equation-contents"><div class="mediaobject" align="center"><img src="../../../images/accumulators/form_5.png" align="middle"></div></div>
+</div>
+ 
+and
+<div class="equation">
+<a name="id545273"></a>Equation 2. 
+<div class="equation-contents"><div class="mediaobject" align="center"><img src="../../../images/accumulators/form_6.png" align="middle"></div></div>
+</div>
+ 
+<img src="../../../images/accumulators/form_7.png"> being the number of samples and <img src="../../../images/accumulators/form_8.png"> the sum of all weights.
+
+
+<div class="refsect2" lang="en">
+<a name="id545349"></a><h3>
+<a name="boost.accumulators.impl.weighted_tail_quantile__id226526construct-copy-destruct"></a><code class="computeroutput">weighted_tail_quantile_impl</code>
+ public
+ construct/copy/destruct</h3>
+<div class="orderedlist"><ol type="1"><li><pre class="literallayout"><a name="id226362-bb"></a>weighted_tail_quantile_impl(dont_care);</pre></li></ol></div>
+</div>
+<div class="refsect2" lang="en">
+<a name="id545388"></a><h3>
+<a name="id226739-bb"></a><code class="computeroutput">weighted_tail_quantile_impl</code> public member functions</h3>
+<div class="orderedlist"><ol type="1"><li><pre class="literallayout">template<typename Args> result_type <a name="id226647-bb"></a>result(Args const & args) const;</pre></li></ol></div>
+</div>
+</div>
+</div>
+<table xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" width="100%"><tr>
+<td align="left"></td>
+<td align="right"><div class="copyright-footer">Copyright © 2007 John Maddock, Joel de Guzman, Eric Niebler and Matias
+ Capeletto
+ 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)
+ 
+</div></td>
+</tr></table>
+<hr>
+<div class="spirit-nav">
+<a accesskey="p" href="../extract/weighted_tail_quantile.html"><img src="../../../../../../doc/html/images/prev.png" alt="Prev"></a><a accesskey="u" href="../../../document_to_test_formatting/accumulators.html#header.boost.trunk.doc.test.weighted_tail_quantile_hpp"><img src="../../../../../../doc/html/images/up.png" alt="Up"></a><a accesskey="h" href="../../../index.html"><img src="../../../../../../doc/html/images/home.png" alt="Home"></a><a accesskey="n" href="../tag/weighted_tail_quantile.html"><img src="../../../../../../doc/html/images/next.png" alt="Next"></a>
+</div>
+</body>
+</html>

Added: trunk/doc/test/gold/boost/accumulators/tag/weighted_tail_quantile.html
==============================================================================
--- (empty file)
+++ trunk/doc/test/gold/boost/accumulators/tag/weighted_tail_quantile.html 2008-12-09 07:11:12 EST (Tue, 09 Dec 2008)
@@ -0,0 +1,52 @@
+<html>
+<head>
+<meta http-equiv="Content-Type" content="text/html; charset=ISO-8859-1">
+<title>Struct template weighted_tail_quantile</title>
+<link rel="stylesheet" href="../../../../../../doc/html/boostbook.css" type="text/css">
+<meta name="generator" content="DocBook XSL Stylesheets Vsnapshot_8125">
+<link rel="home" href="../../../index.html" title="Document To Test Formatting">
+<link rel="up" href="../../../document_to_test_formatting/accumulators.html#header.boost.trunk.doc.test.weighted_tail_quantile_hpp" title="Header <boost/trunk/doc/test/weighted_tail_quantile.hpp>">
+<link rel="prev" href="../impl/weighted_tail_quantile__id226526.html" title="Struct template weighted_tail_quantile_impl">
+</head>
+<body bgcolor="white" text="black" link="#0000FF" vlink="#840084" alink="#0000FF">
+<table cellpadding="2" width="100%"><tr>
+<td valign="top"><img alt="Boost C++ Libraries" width="277" height="86" src="../../../../../../boost.png"></td>
+<td align="center">Home</td>
+<td align="center">Libraries</td>
+<td align="center">People</td>
+<td align="center">FAQ</td>
+<td align="center">More</td>
+</tr></table>
+<hr>
+<div class="spirit-nav">
+<a accesskey="p" href="../impl/weighted_tail_quantile__id226526.html"><img src="../../../../../../doc/html/images/prev.png" alt="Prev"></a><a accesskey="u" href="../../../document_to_test_formatting/accumulators.html#header.boost.trunk.doc.test.weighted_tail_quantile_hpp"><img src="../../../../../../doc/html/images/up.png" alt="Up"></a><a accesskey="h" href="../../../index.html"><img src="../../../../../../doc/html/images/home.png" alt="Home"></a>
+</div>
+<div class="refentry" lang="en">
+<a name="boost.accumulators.tag.weighted_tail_quantile"></a><div class="titlepage"></div>
+<div class="refnamediv">
+<h2>Struct template weighted_tail_quantile</h2>
+boost::accumulators::tag::weighted_tail_quantile
+</div>
+<h2 xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" class="refsynopsisdiv-title">Synopsis</h2>
+<div xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" class="refsynopsisdiv"><pre class="synopsis">// In header: <<a class="link" href="../../../document_to_test_formatting/accumulators.html#header.boost.trunk.doc.test.weighted_tail_quantile_hpp" title="Header <boost/trunk/doc/test/weighted_tail_quantile.hpp>">boost/trunk/doc/test/weighted_tail_quantile.hpp</a>>
+
+template<typename LeftRight>
+struct <a class="link" href="weighted_tail_quantile.html" title="Struct template weighted_tail_quantile">weighted_tail_quantile</a> : public boost::accumulators::depends_on< sum_of_weights, tail_weights< LeftRight > >
+{
+};</pre></div>
+</div>
+<table xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" width="100%"><tr>
+<td align="left"></td>
+<td align="right"><div class="copyright-footer">Copyright © 2007 John Maddock, Joel de Guzman, Eric Niebler and Matias
+ Capeletto
+ 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)
+ 
+</div></td>
+</tr></table>
+<hr>
+<div class="spirit-nav">
+<a accesskey="p" href="../impl/weighted_tail_quantile__id226526.html"><img src="../../../../../../doc/html/images/prev.png" alt="Prev"></a><a accesskey="u" href="../../../document_to_test_formatting/accumulators.html#header.boost.trunk.doc.test.weighted_tail_quantile_hpp"><img src="../../../../../../doc/html/images/up.png" alt="Up"></a><a accesskey="h" href="../../../index.html"><img src="../../../../../../doc/html/images/home.png" alt="Home"></a>
+</div>
+</body>
+</html>

Added: trunk/doc/test/gold/boost/array.html
==============================================================================
--- (empty file)
+++ trunk/doc/test/gold/boost/array.html 2008-12-09 07:11:12 EST (Tue, 09 Dec 2008)
@@ -0,0 +1,641 @@
+<html>
+<head>
+<meta http-equiv="Content-Type" content="text/html; charset=ISO-8859-1">
+<title>Class template array</title>
+<link rel="stylesheet" href="../../../../doc/html/boostbook.css" type="text/css">
+<meta name="generator" content="DocBook XSL Stylesheets Vsnapshot_8125">
+<link rel="home" href="../index.html" title="Document To Test Formatting">
+<link rel="up" href="../document_to_test_formatting/array.html#header.boost.array_hpp" title="Header <boost/array.hpp>">
+<link rel="prev" href="../document_to_test_formatting/array.html" title="Array Example Boostbook XML Documentation">
+<link rel="next" href="../document_to_test_formatting/accumulators.html" title="Accumulators Example Doxygen Documentation">
+</head>
+<body bgcolor="white" text="black" link="#0000FF" vlink="#840084" alink="#0000FF">
+<table cellpadding="2" width="100%"><tr>
+<td valign="top"><img alt="Boost C++ Libraries" width="277" height="86" src="../../../../boost.png"></td>
+<td align="center">Home</td>
+<td align="center">Libraries</td>
+<td align="center">People</td>
+<td align="center">FAQ</td>
+<td align="center">More</td>
+</tr></table>
+<hr>
+<div class="spirit-nav">
+<a accesskey="p" href="../document_to_test_formatting/array.html"><img src="../../../../doc/html/images/prev.png" alt="Prev"></a><a accesskey="u" href="../document_to_test_formatting/array.html#header.boost.array_hpp"><img src="../../../../doc/html/images/up.png" alt="Up"></a><a accesskey="h" href="../index.html"><img src="../../../../doc/html/images/home.png" alt="Home"></a><a accesskey="n" href="../document_to_test_formatting/accumulators.html"><img src="../../../../doc/html/images/next.png" alt="Next"></a>
+</div>
+<div class="refentry" lang="en">
+<a name="boost.array"></a><div class="titlepage"></div>
+<div class="refnamediv">
+<h2>Class template array</h2>
+boost::array — STL compliant container wrapper for arrays of constant size
+</div>
+<h2 xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" class="refsynopsisdiv-title">Synopsis</h2>
+<div xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" class="refsynopsisdiv"><pre class="synopsis">// In header: <<a class="link" href="../document_to_test_formatting/array.html#header.boost.array_hpp" title="Header <boost/array.hpp>">boost/array.hpp</a>>
+
+template<typename T, std::size_t N>
+class <a class="link" href="array.html" title="Class template array">array</a> {
+public:
+ // types
+ typedef T <a name="boost.array.value_type"></a>value_type;
+ typedef T* <a name="boost.array.iterator"></a>iterator;
+ typedef const T* <a name="boost.array.const_iterator"></a>const_iterator;
+ typedef
+ std::reverse_iterator<iterator>
+ <a name="boost.array.reverse_iterator"></a>reverse_iterator;
+ typedef
+ std::reverse_iterator<const_iterator>
+ <a name="boost.array.const_reverse_iterator"></a>const_reverse_iterator;
+ typedef T& <a name="boost.array.reference"></a>reference;
+ typedef const T& <a name="boost.array.const_reference"></a>const_reference;
+ typedef std::size_t <a name="boost.array.size_type"></a>size_type;
+ typedef std::ptrdiff_t <a name="boost.array.difference_type"></a>difference_type;
+
+ // static constants
+ static const size_type static_size = N;
+
+ // <a class="link" href="array.html#boost.arrayconstruct-copy-destruct">construct/copy/destruct</a>
+ template<typename U>
+ array& <a class="link" href="array.html#id225116-bb">operator=</a>(
+ const <a class="link" href="array.html" title="Class template array">array</a><U, N>&
+ );
+
+ // <a class="link" href="array.html#id225163-bb">iterator support</a>
+ iterator <a class="link" href="array.html#id225172-bb">begin</a>();
+ const_iterator <a class="link" href="array.html#id225179-bb">begin</a>() const;
+ iterator <a class="link" href="array.html#id225209-bb">end</a>();
+ const_iterator <a class="link" href="array.html#id185009-bb">end</a>() const;
+
+ // <a class="link" href="array.html#id185036-bb">reverse iterator support</a>
+ reverse_iterator <a class="link" href="array.html#id185046-bb">rbegin</a>();
+ const_reverse_iterator <a class="link" href="array.html#id185053-bb">rbegin</a>() const;
+ reverse_iterator <a class="link" href="array.html#id185076-bb">rend</a>();
+ const_reverse_iterator <a class="link" href="array.html#id185084-bb">rend</a>() const;
+
+ // <a class="link" href="array.html#id185103-bb">capacity</a>
+ size_type <a class="link" href="array.html#id185107-bb">size</a>();
+ bool <a class="link" href="array.html#id185128-bb">empty</a>();
+ size_type <a class="link" href="array.html#id185156-bb">max_size</a>();
+
+ // <a class="link" href="array.html#id155125-bb">element access</a>
+ reference <a class="link" href="array.html#id155134-bb">operator[]</a>(size_type);
+ const_reference <a class="link" href="array.html#id155151-bb">operator[]</a>(size_type) const;
+ reference <a class="link" href="array.html#id155207-bb">at</a>(size_type);
+ const_reference <a class="link" href="array.html#id155224-bb">at</a>(size_type) const;
+ reference <a class="link" href="array.html#id155281-bb">front</a>();
+ const_reference <a class="link" href="array.html#id155288-bb">front</a>() const;
+ reference <a class="link" href="array.html#id155329-bb">back</a>();
+ const_reference <a class="link" href="array.html#id155336-bb">back</a>() const;
+ const T* <a class="link" href="array.html#id155372-bb">data</a>() const;
+ T* <a class="link" href="array.html#id227218-bb">c_array</a>();
+
+ // <a class="link" href="array.html#id227247-bb">modifiers</a>
+ void <a class="link" href="array.html#id227252-bb">swap</a>(
+ <a class="link" href="array.html" title="Class template array">array</a><T, N>&
+ );
+ void <a class="link" href="array.html#id227310-bb">assign</a>(const T&);
+ T elems[N];
+};
+
+// <a class="link" href="array.html#id227358-bb">specialized algorithms</a>
+template<typename T, std::size_t N>
+ void <a class="link" href="array.html#boost.swap">swap</a>(
+ <a class="link" href="array.html" title="Class template array">array</a><T, N>&
+ ,
+
+ <a class="link" href="array.html" title="Class template array">array</a><T, N>&
+ );
+
+// <a class="link" href="array.html#id227444-bb">comparisons</a>
+template<typename T, std::size_t N>
+ bool <a class="link" href="array.html#boost.operator==">operator==</a>(
+ const <a class="link" href="array.html" title="Class template array">array</a><T, N>&
+ ,
+
+ const <a class="link" href="array.html" title="Class template array">array</a><T, N>&
+ );
+template<typename T, std::size_t N>
+ bool <a class="link" href="array.html#boost.operator!=">operator!=</a>(
+ const <a class="link" href="array.html" title="Class template array">array</a><T, N>&
+ ,
+
+ const <a class="link" href="array.html" title="Class template array">array</a><T, N>&
+ );
+template<typename T, std::size_t N>
+ bool <a class="link" href="array.html#boost.operator_id227596">operator<</a>(
+ const <a class="link" href="array.html" title="Class template array">array</a><T, N>&
+ ,
+
+ const <a class="link" href="array.html" title="Class template array">array</a><T, N>&
+ );
+template<typename T, std::size_t N>
+ bool <a class="link" href="array.html#boost.operator_id227679">operator></a>(
+ const <a class="link" href="array.html" title="Class template array">array</a><T, N>&
+ ,
+
+ const <a class="link" href="array.html" title="Class template array">array</a><T, N>&
+ );
+template<typename T, std::size_t N>
+ bool <a class="link" href="array.html#boost.operator_=_id227747">operator<=</a>(
+ const <a class="link" href="array.html" title="Class template array">array</a><T, N>&
+ ,
+
+ const <a class="link" href="array.html" title="Class template array">array</a><T, N>&
+ );
+template<typename T, std::size_t N>
+ bool <a class="link" href="array.html#boost.operator_=_id227814">operator>=</a>(
+ const <a class="link" href="array.html" title="Class template array">array</a><T, N>&
+ ,
+
+ const <a class="link" href="array.html" title="Class template array">array</a><T, N>&
+ );</pre></div>
+<div class="refsect1" lang="en">
+<a name="id542541"></a><h2>Description</h2>
+<div class="refsect2" lang="en">
+<a name="id542545"></a><h3>
+<a name="boost.arrayconstruct-copy-destruct"></a><code class="computeroutput">array</code>
+ public
+ construct/copy/destruct</h3>
+<div class="orderedlist"><ol type="1"><li>
+<pre class="literallayout">template<typename U>
+ array& <a name="id225116-bb"></a>operator=(
+ const <a class="link" href="array.html" title="Class template array">array</a><U, N>&
+ other);</pre>
+<div class="variablelist"><table border="0">
+<col align="left" valign="top">
+<tbody><tr>
+<td>Effects:</td>
+<td>
+ <code class="computeroutput">
+ std::copy(rhs.<a class="link" href="array.html#id225167-bb">begin</a>(),rhs.<a class="link" href="array.html#id225205-bb">end</a>(), <a class="link" href="array.html#id225167-bb">begin</a>())
+ </code>
+ </td>
+</tr></tbody>
+</table></div>
+</li></ol></div>
+</div>
+<div class="refsect2" lang="en">
+<a name="id542665"></a><h3>
+<a name="id225163-bb"></a><code class="computeroutput">array</code> iterator support</h3>
+<div class="orderedlist"><ol type="1">
+<li>
+<pre class="literallayout"><a name="id225167-bb"></a>iterator <a name="id225172-bb"></a>begin();
+const_iterator <a name="id225179-bb"></a>begin() const;</pre>
+<div class="variablelist"><table border="0">
+<col align="left" valign="top">
+<tbody>
+<tr>
+<td>Returns:</td>
+<td>iterator for the first element</td>
+</tr>
+<tr>
+<td>Throws:</td>
+<td>will not throw</td>
+</tr>
+</tbody>
+</table></div>
+</li>
+<li>
+<pre class="literallayout"><a name="id225205-bb"></a>iterator <a name="id225209-bb"></a>end();
+const_iterator <a name="id185009-bb"></a>end() const;</pre>
+<div class="variablelist"><table border="0">
+<col align="left" valign="top">
+<tbody>
+<tr>
+<td>Returns:</td>
+<td>iterator for position after the last element</td>
+</tr>
+<tr>
+<td>Throws:</td>
+<td>will not throw</td>
+</tr>
+</tbody>
+</table></div>
+</li>
+</ol></div>
+</div>
+<div class="refsect2" lang="en">
+<a name="id542810"></a><h3>
+<a name="id185036-bb"></a><code class="computeroutput">array</code> reverse iterator support</h3>
+<div class="orderedlist"><ol type="1">
+<li>
+<pre class="literallayout"><a name="id185041-bb"></a>reverse_iterator <a name="id185046-bb"></a>rbegin();
+const_reverse_iterator <a name="id185053-bb"></a>rbegin() const;</pre>
+<div class="variablelist"><table border="0">
+<col align="left" valign="top">
+<tbody><tr>
+<td>Returns:</td>
+<td>reverse iterator for the first element of reverse iteration</td>
+</tr></tbody>
+</table></div>
+</li>
+<li>
+<pre class="literallayout"><a name="id185072-bb"></a>reverse_iterator <a name="id185076-bb"></a>rend();
+const_reverse_iterator <a name="id185084-bb"></a>rend() const;</pre>
+<div class="variablelist"><table border="0">
+<col align="left" valign="top">
+<tbody><tr>
+<td>Returns:</td>
+<td>reverse iterator for position after the last element in reverse iteration</td>
+</tr></tbody>
+</table></div>
+</li>
+</ol></div>
+</div>
+<div class="refsect2" lang="en">
+<a name="id542942"></a><h3>
+<a name="id185103-bb"></a><code class="computeroutput">array</code> capacity</h3>
+<div class="orderedlist"><ol type="1">
+<li>
+<pre class="literallayout">size_type <a name="id185107-bb"></a>size();</pre>
+<div class="variablelist"><table border="0">
+<col align="left" valign="top">
+<tbody><tr>
+<td>Returns:</td>
+<td>
+ <code class="computeroutput">N</code>
+ </td>
+</tr></tbody>
+</table></div>
+</li>
+<li>
+<pre class="literallayout">bool <a name="id185128-bb"></a>empty();</pre>
+<div class="variablelist"><table border="0">
+<col align="left" valign="top">
+<tbody>
+<tr>
+<td>Returns:</td>
+<td>
+ <code class="computeroutput">N==0</code>
+ </td>
+</tr>
+<tr>
+<td>Throws:</td>
+<td>will not throw</td>
+</tr>
+</tbody>
+</table></div>
+</li>
+<li>
+<pre class="literallayout">size_type <a name="id185156-bb"></a>max_size();</pre>
+<div class="variablelist"><table border="0">
+<col align="left" valign="top">
+<tbody>
+<tr>
+<td>Returns:</td>
+<td>
+ <code class="computeroutput">N</code>
+ </td>
+</tr>
+<tr>
+<td>Throws:</td>
+<td>will not throw</td>
+</tr>
+</tbody>
+</table></div>
+</li>
+</ol></div>
+</div>
+<div class="refsect2" lang="en">
+<a name="id543096"></a><h3>
+<a name="id155125-bb"></a><code class="computeroutput">array</code> element access</h3>
+<div class="orderedlist"><ol type="1">
+<li>
+<pre class="literallayout"><a name="id155129-bb"></a>reference <a name="id155134-bb"></a>operator[](size_type i);
+const_reference <a name="id155151-bb"></a>operator[](size_type i) const;</pre>
+<div class="variablelist"><table border="0">
+<col align="left" valign="top">
+<tbody>
+<tr>
+<td>Requires:</td>
+<td>
+ <code class="computeroutput">i < N</code>
+ </td>
+</tr>
+<tr>
+<td>Returns:</td>
+<td>
+ element with index <code class="computeroutput">i</code>
+ </td>
+</tr>
+<tr>
+<td>Throws:</td>
+<td>will not throw.</td>
+</tr>
+</tbody>
+</table></div>
+</li>
+<li>
+<pre class="literallayout"><a name="id155202-bb"></a>reference <a name="id155207-bb"></a>at(size_type i);
+const_reference <a name="id155224-bb"></a>at(size_type i) const;</pre>
+<div class="variablelist"><table border="0">
+<col align="left" valign="top">
+<tbody>
+<tr>
+<td>Returns:</td>
+<td>
+ element with index <code class="computeroutput">i</code>
+ </td>
+</tr>
+<tr>
+<td>Throws:</td>
+<td>
+ <code class="computeroutput">
+ std::range_error
+ </code> if <code class="computeroutput">i >= N</code>
+ </td>
+</tr>
+</tbody>
+</table></div>
+</li>
+<li>
+<pre class="literallayout"><a name="id155276-bb"></a>reference <a name="id155281-bb"></a>front();
+const_reference <a name="id155288-bb"></a>front() const;</pre>
+<div class="variablelist"><table border="0">
+<col align="left" valign="top">
+<tbody>
+<tr>
+<td>Requires:</td>
+<td>
+ <code class="computeroutput">N > 0</code>
+ </td>
+</tr>
+<tr>
+<td>Returns:</td>
+<td>the first element</td>
+</tr>
+<tr>
+<td>Throws:</td>
+<td>will not throw</td>
+</tr>
+</tbody>
+</table></div>
+</li>
+<li>
+<pre class="literallayout"><a name="id155324-bb"></a>reference <a name="id155329-bb"></a>back();
+const_reference <a name="id155336-bb"></a>back() const;</pre>
+<div class="variablelist"><table border="0">
+<col align="left" valign="top">
+<tbody>
+<tr>
+<td>Requires:</td>
+<td>
+ <code class="computeroutput">N > 0</code>
+ </td>
+</tr>
+<tr>
+<td>Returns:</td>
+<td>the last element</td>
+</tr>
+<tr>
+<td>Throws:</td>
+<td>will not throw</td>
+</tr>
+</tbody>
+</table></div>
+</li>
+<li>
+<pre class="literallayout">const T* <a name="id155372-bb"></a>data() const;</pre>
+<div class="variablelist"><table border="0">
+<col align="left" valign="top">
+<tbody>
+<tr>
+<td>Returns:</td>
+<td>
+ <code class="computeroutput">elems</code>
+ </td>
+</tr>
+<tr>
+<td>Throws:</td>
+<td>will not throw</td>
+</tr>
+</tbody>
+</table></div>
+</li>
+<li>
+<pre class="literallayout">T* <a name="id227218-bb"></a>c_array();</pre>
+<div class="variablelist"><table border="0">
+<col align="left" valign="top">
+<tbody>
+<tr>
+<td>Returns:</td>
+<td>
+ <code class="computeroutput">elems</code>
+ </td>
+</tr>
+<tr>
+<td>Throws:</td>
+<td>will not throw</td>
+</tr>
+</tbody>
+</table></div>
+</li>
+</ol></div>
+</div>
+<div class="refsect2" lang="en">
+<a name="id543547"></a><h3>
+<a name="id227247-bb"></a><code class="computeroutput">array</code> modifiers</h3>
+<div class="orderedlist"><ol type="1">
+<li>
+<pre class="literallayout">void <a name="id227252-bb"></a>swap(
+ <a class="link" href="array.html" title="Class template array">array</a><T, N>&
+ other);</pre>
+<div class="variablelist"><table border="0">
+<col align="left" valign="top">
+<tbody>
+<tr>
+<td>Effects:</td>
+<td>
+ <code class="computeroutput">
+ std::swap_ranges(<a class="link" href="array.html#id225167-bb">begin</a>(), <a class="link" href="array.html#id225205-bb">end</a>(), other.<a class="link" href="array.html#id225167-bb">begin</a>())
+ </code>
+ </td>
+</tr>
+<tr>
+<td>Complexity:</td>
+<td>
+ linear in <code class="computeroutput">N</code>
+ </td>
+</tr>
+</tbody>
+</table></div>
+</li>
+<li>
+<pre class="literallayout">void <a name="id227310-bb"></a>assign(const T& value);</pre>
+<div class="variablelist"><table border="0">
+<col align="left" valign="top">
+<tbody><tr>
+<td>Effects:</td>
+<td>
+ <code class="computeroutput">
+ std::fill_n(<a class="link" href="array.html#id225167-bb">begin</a>(), N, value)
+ </code>
+ </td>
+</tr></tbody>
+</table></div>
+</li>
+</ol></div>
+</div>
+<div class="refsect2" lang="en">
+<a name="id543718"></a><h3>
+<a name="id227358-bb"></a><code class="computeroutput">array</code> specialized algorithms</h3>
+<div class="orderedlist"><ol type="1"><li>
+<pre class="literallayout">template<typename T, std::size_t N>
+ void <a name="boost.swap"></a>swap(
+ <a class="link" href="array.html" title="Class template array">array</a><T, N>&
+ x,
+
+ <a class="link" href="array.html" title="Class template array">array</a><T, N>&
+ y);</pre>
+<div class="variablelist"><table border="0">
+<col align="left" valign="top">
+<tbody>
+<tr>
+<td>Effects:</td>
+<td>
+ <code class="computeroutput">
+ x.<a class="link" href="array.html#id227252-bb">swap</a>(y)
+ </code>
+ </td>
+</tr>
+<tr>
+<td>Throws:</td>
+<td>will not throw.</td>
+</tr>
+</tbody>
+</table></div>
+</li></ol></div>
+</div>
+<div class="refsect2" lang="en">
+<a name="id543830"></a><h3>
+<a name="id227444-bb"></a><code class="computeroutput">array</code> comparisons</h3>
+<div class="orderedlist"><ol type="1">
+<li>
+<pre class="literallayout">template<typename T, std::size_t N>
+ bool <a name="boost.operator=="></a>operator==(
+ const <a class="link" href="array.html" title="Class template array">array</a><T, N>&
+ x,
+
+ const <a class="link" href="array.html" title="Class template array">array</a><T, N>&
+ y);</pre>
+<div class="variablelist"><table border="0">
+<col align="left" valign="top">
+<tbody><tr>
+<td>Returns:</td>
+<td>
+ <code class="computeroutput">
+ std::equal(x.<a class="link" href="array.html#id225167-bb">begin</a>(), x.<a class="link" href="array.html#id225205-bb">end</a>(), y.<a class="link" href="array.html#id225167-bb">begin</a>())
+ </code>
+ </td>
+</tr></tbody>
+</table></div>
+</li>
+<li>
+<pre class="literallayout">template<typename T, std::size_t N>
+ bool <a name="boost.operator!="></a>operator!=(
+ const <a class="link" href="array.html" title="Class template array">array</a><T, N>&
+ x,
+
+ const <a class="link" href="array.html" title="Class template array">array</a><T, N>&
+ y);</pre>
+<div class="variablelist"><table border="0">
+<col align="left" valign="top">
+<tbody><tr>
+<td>Returns:</td>
+<td>
+ <code class="computeroutput">!(x == y)</code>
+ </td>
+</tr></tbody>
+</table></div>
+</li>
+<li>
+<pre class="literallayout">template<typename T, std::size_t N>
+ bool <a name="boost.operator_id227596"></a>operator<(
+ const <a class="link" href="array.html" title="Class template array">array</a><T, N>&
+ x,
+
+ const <a class="link" href="array.html" title="Class template array">array</a><T, N>&
+ y);</pre>
+<div class="variablelist"><table border="0">
+<col align="left" valign="top">
+<tbody><tr>
+<td>Returns:</td>
+<td>
+ <code class="computeroutput">
+ std::lexicographical_compare(x.<a class="link" href="array.html#id225167-bb">begin</a>(), x.<a class="link" href="array.html#id225205-bb">end</a>(), y.<a class="link" href="array.html#id225167-bb">begin</a>(), y.<a class="link" href="array.html#id225205-bb">end</a>())
+ </code>
+ </td>
+</tr></tbody>
+</table></div>
+</li>
+<li>
+<pre class="literallayout">template<typename T, std::size_t N>
+ bool <a name="boost.operator_id227679"></a>operator>(
+ const <a class="link" href="array.html" title="Class template array">array</a><T, N>&
+ x,
+
+ const <a class="link" href="array.html" title="Class template array">array</a><T, N>&
+ y);</pre>
+<div class="variablelist"><table border="0">
+<col align="left" valign="top">
+<tbody><tr>
+<td>Returns:</td>
+<td>
+ <code class="computeroutput">y < x</code>
+ </td>
+</tr></tbody>
+</table></div>
+</li>
+<li>
+<pre class="literallayout">template<typename T, std::size_t N>
+ bool <a name="boost.operator_=_id227747"></a>operator<=(
+ const <a class="link" href="array.html" title="Class template array">array</a><T, N>&
+ x,
+
+ const <a class="link" href="array.html" title="Class template array">array</a><T, N>&
+ y);</pre>
+<div class="variablelist"><table border="0">
+<col align="left" valign="top">
+<tbody><tr>
+<td>Returns:</td>
+<td>
+ <code class="computeroutput">!(y < x)</code>
+ </td>
+</tr></tbody>
+</table></div>
+</li>
+<li>
+<pre class="literallayout">template<typename T, std::size_t N>
+ bool <a name="boost.operator_=_id227814"></a>operator>=(
+ const <a class="link" href="array.html" title="Class template array">array</a><T, N>&
+ x,
+
+ const <a class="link" href="array.html" title="Class template array">array</a><T, N>&
+ y);</pre>
+<div class="variablelist"><table border="0">
+<col align="left" valign="top">
+<tbody><tr>
+<td>Returns:</td>
+<td>
+ <code class="computeroutput">!(x < y)</code>
+ </td>
+</tr></tbody>
+</table></div>
+</li>
+</ol></div>
+</div>
+</div>
+</div>
+<table xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" width="100%"><tr>
+<td align="left"></td>
+<td align="right"><div class="copyright-footer">Copyright © 2007 John Maddock, Joel de Guzman, Eric Niebler and Matias
+ Capeletto
+ 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)
+ 
+</div></td>
+</tr></table>
+<hr>
+<div class="spirit-nav">
+<a accesskey="p" href="../document_to_test_formatting/array.html"><img src="../../../../doc/html/images/prev.png" alt="Prev"></a><a accesskey="u" href="../document_to_test_formatting/array.html#header.boost.array_hpp"><img src="../../../../doc/html/images/up.png" alt="Up"></a><a accesskey="h" href="../index.html"><img src="../../../../doc/html/images/home.png" alt="Home"></a><a accesskey="n" href="../document_to_test_formatting/accumulators.html"><img src="../../../../doc/html/images/next.png" alt="Next"></a>
+</div>
+</body>
+</html>

Added: trunk/doc/test/gold/document_to_test_formatting/accumulators.html
==============================================================================
--- (empty file)
+++ trunk/doc/test/gold/document_to_test_formatting/accumulators.html 2008-12-09 07:11:12 EST (Tue, 09 Dec 2008)
@@ -0,0 +1,69 @@
+<html>
+<head>
+<meta http-equiv="Content-Type" content="text/html; charset=ISO-8859-1">
+<title>Accumulators Example Doxygen Documentation</title>
+<link rel="stylesheet" href="../../../../doc/html/boostbook.css" type="text/css">
+<meta name="generator" content="DocBook XSL Stylesheets Vsnapshot_8125">
+<link rel="home" href="../index.html" title="Document To Test Formatting">
+<link rel="up" href="../index.html" title="Document To Test Formatting">
+<link rel="prev" href="../boost/array.html" title="Class template array">
+<link rel="next" href="../boost/accumulators/extract/weighted_tail_quantile.html" title="Global weighted_tail_quantile">
+</head>
+<body bgcolor="white" text="black" link="#0000FF" vlink="#840084" alink="#0000FF">
+<table cellpadding="2" width="100%"><tr>
+<td valign="top"><img alt="Boost C++ Libraries" width="277" height="86" src="../../../../boost.png"></td>
+<td align="center">Home</td>
+<td align="center">Libraries</td>
+<td align="center">People</td>
+<td align="center">FAQ</td>
+<td align="center">More</td>
+</tr></table>
+<hr>
+<div class="spirit-nav">
+<a accesskey="p" href="../boost/array.html"><img src="../../../../doc/html/images/prev.png" alt="Prev"></a><a accesskey="u" href="../index.html"><img src="../../../../doc/html/images/up.png" alt="Up"></a><a accesskey="h" href="../index.html"><img src="../../../../doc/html/images/home.png" alt="Home"></a><a accesskey="n" href="../boost/accumulators/extract/weighted_tail_quantile.html"><img src="../../../../doc/html/images/next.png" alt="Next"></a>
+</div>
+<div class="section" lang="en">
+<div class="titlepage"><div><div><h2 class="title" style="clear: both">
+<a name="document_to_test_formatting.accumulators"></a><a class="link" href="accumulators.html" title="Accumulators Example Doxygen Documentation"> Accumulators
+ Example Doxygen Documentation</a>
+</h2></div></div></div>
+<div class="toc"><dl><dt>Statistics Library Reference</dt></dl></div>
+<div class="section" lang="en">
+<div class="titlepage"><div><div><h3 class="title">
+<a name="statistics_library_reference"></a>Statistics Library Reference</h3></div></div></div>
+<div class="toc"><dl><dt>Header <boost/trunk/doc/test/weighted_tail_quantile.hpp></dt></dl></div>
+<div class="section" lang="en">
+<div class="titlepage"><div><div><h4 class="title">
+<a name="header.boost.trunk.doc.test.weighted_tail_quantile_hpp"></a>Header <boost/trunk/doc/test/weighted_tail_quantile.hpp></h4></div></div></div>
+<pre class="synopsis">namespace boost {
+ namespace accumulators {
+ namespace extract {
+ extractor< tag::quantile > const <a class="link" href="../boost/accumulators/extract/weighted_tail_quantile.html" title="Global weighted_tail_quantile">weighted_tail_quantile</a>;
+ }
+ namespace impl {
+ template<typename Sample, typename Weight, typename LeftRight>
+ struct <a class="link" href="../boost/accumulators/impl/weighted_tail_quantile__id226526.html" title="Struct template weighted_tail_quantile_impl">weighted_tail_quantile_impl</a>;
+ }
+ namespace tag {
+ template<typename LeftRight> struct <a class="link" href="../boost/accumulators/tag/weighted_tail_quantile.html" title="Struct template weighted_tail_quantile">weighted_tail_quantile</a>;
+ }
+ }
+}</pre>
+</div>
+</div>
+</div>
+<table xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" width="100%"><tr>
+<td align="left"></td>
+<td align="right"><div class="copyright-footer">Copyright © 2007 John Maddock, Joel de Guzman, Eric Niebler and Matias
+ Capeletto
+ 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)
+ 
+</div></td>
+</tr></table>
+<hr>
+<div class="spirit-nav">
+<a accesskey="p" href="../boost/array.html"><img src="../../../../doc/html/images/prev.png" alt="Prev"></a><a accesskey="u" href="../index.html"><img src="../../../../doc/html/images/up.png" alt="Up"></a><a accesskey="h" href="../index.html"><img src="../../../../doc/html/images/home.png" alt="Home"></a><a accesskey="n" href="../boost/accumulators/extract/weighted_tail_quantile.html"><img src="../../../../doc/html/images/next.png" alt="Next"></a>
+</div>
+</body>
+</html>

Added: trunk/doc/test/gold/document_to_test_formatting/array.html
==============================================================================
--- (empty file)
+++ trunk/doc/test/gold/document_to_test_formatting/array.html 2008-12-09 07:11:12 EST (Tue, 09 Dec 2008)
@@ -0,0 +1,262 @@
+<html>
+<head>
+<meta http-equiv="Content-Type" content="text/html; charset=ISO-8859-1">
+<title>Array Example Boostbook XML Documentation</title>
+<link rel="stylesheet" href="../../../../doc/html/boostbook.css" type="text/css">
+<meta name="generator" content="DocBook XSL Stylesheets Vsnapshot_8125">
+<link rel="home" href="../index.html" title="Document To Test Formatting">
+<link rel="up" href="../index.html" title="Document To Test Formatting">
+<link rel="prev" href="remez.html" title="Sample Article (The Remez Method)">
+<link rel="next" href="../boost/array.html" title="Class template array">
+</head>
+<body bgcolor="white" text="black" link="#0000FF" vlink="#840084" alink="#0000FF">
+<table cellpadding="2" width="100%"><tr>
+<td valign="top"><img alt="Boost C++ Libraries" width="277" height="86" src="../../../../boost.png"></td>
+<td align="center">Home</td>
+<td align="center">Libraries</td>
+<td align="center">People</td>
+<td align="center">FAQ</td>
+<td align="center">More</td>
+</tr></table>
+<hr>
+<div class="spirit-nav">
+<a accesskey="p" href="remez.html"><img src="../../../../doc/html/images/prev.png" alt="Prev"></a><a accesskey="u" href="../index.html"><img src="../../../../doc/html/images/up.png" alt="Up"></a><a accesskey="h" href="../index.html"><img src="../../../../doc/html/images/home.png" alt="Home"></a><a accesskey="n" href="../boost/array.html"><img src="../../../../doc/html/images/next.png" alt="Next"></a>
+</div>
+<div class="section" lang="en">
+<div class="titlepage"><div><div><h2 class="title" style="clear: both">
+<a name="document_to_test_formatting.array"></a><a class="link" href="array.html" title="Array Example Boostbook XML Documentation"> Array Example Boostbook
+ XML Documentation</a>
+</h2></div></div></div>
+<div class="toc"><dl>
+<dt>Introduction</dt>
+<dt>Reference</dt>
+<dt>Design Rationale</dt>
+<dt>For more information...</dt>
+<dt>Acknowledgements</dt>
+</dl></div>
+<div class="section" lang="en">
+<div class="titlepage"><div><div><h3 class="title">
+<a name="array.intro"></a>Introduction</h3></div></div></div>
+The C++ Standard Template Library STL as part of the C++
+ Standard Library provides a framework for processing algorithms on
+ different kind of containers. However, ordinary arrays don't
+ provide the interface of STL containers (although, they provide
+ the iterator interface of STL containers).
+As replacement for ordinary arrays, the STL provides class
+ <code class="computeroutput">std::vector</code>. However,
+ <code class="computeroutput">std::vector<></code> provides
+ the semantics of dynamic arrays. Thus, it manages data to be able
+ to change the number of elements. This results in some overhead in
+ case only arrays with static size are needed.
+In his book, Generic Programming and the
+ STL, Matthew H. Austern introduces a useful wrapper
+ class for ordinary arrays with static size, called
+ <code class="computeroutput">block</code>. It is safer and has no worse performance than
+ ordinary arrays. In The C++ Programming
+ Language, 3rd edition, Bjarne Stroustrup introduces a
+ similar class, called <code class="computeroutput">c_array</code>, which I (Nicolai Josuttis) present
+ slightly modified in my book The C++ Standard Library -
+ A Tutorial and Reference, called
+ <code class="computeroutput">carray</code>. This is the essence of these approaches
+ spiced with many feedback from boost.
+After considering different names, we decided to name this
+ class simply <code class="computeroutput"><a class="link" href="../boost/array.html" title="Class template array">array</a></code>.
+Note that this class is suggested to be part of the next
+ Technical Report, which will extend the C++ Standard (see
+ http://std.dkuug.dk/jtc1/sc22/wg21/docs/papers/2003/n1548.htm).
+Class <code class="computeroutput"><a class="link" href="../boost/array.html" title="Class template array">array</a></code> fulfills most
+ but not all of the requirements of "reversible containers" (see
+ Section 23.1, [lib.container.requirements] of the C++
+ Standard). The reasons array is not an reversible STL container is
+ because:
+ 
+<div class="itemizedlist"><ul type="disc" compact>
+<li>No constructors are provided.</li>
+<li>Elements may have an undetermined initial value (see <a class="xref" href="array.html#array.rationale" title="Design Rationale">the section called “Design Rationale”</a>).</li>
+<li>
+<code class="computeroutput"><a class="link" href="../boost/array.html#boost.swap">swap</a></code>() has no constant complexity.</li>
+<li>
+<code class="computeroutput"><a class="link" href="../boost/array.html#id185107-bb">size</a></code>() is always constant, based on the second template argument of the type.</li>
+<li>The container provides no allocator support.</li>
+</ul></div>
+
+ 
+It doesn't fulfill the requirements of a "sequence" (see Section 23.1.1, [lib.sequence.reqmts] of the C++ Standard), except that:
+ 
+<div class="itemizedlist"><ul type="disc" compact>
+<li>
+<code class="computeroutput"><a class="link" href="../boost/array.html#id155276-bb">front</a></code>() and <code class="computeroutput"><a class="link" href="../boost/array.html#id155324-bb">back</a></code>() are provided.</li>
+<li>
+<code class="computeroutput"><a class="link" href="../boost/array.html#id155129-bb">operator[]</a></code> and <code class="computeroutput"><a class="link" href="../boost/array.html#id155202-bb">at</a></code>() are provided.</li>
+</ul></div>
+
+ 
+</div>
+<div class="section" lang="en">
+<div class="titlepage"><div><div><h3 class="title">
+<a name="id540764"></a>Reference</h3></div></div></div>
+<div class="toc"><dl><dt>Header <boost/array.hpp></dt></dl></div>
+<div class="section" lang="en">
+<div class="titlepage"><div><div><h4 class="title">
+<a name="header.boost.array_hpp"></a>Header <boost/array.hpp></h4></div></div></div>
+<pre class="synopsis">namespace boost {
+ template<typename T, std::size_t N> class <a class="link" href="../boost/array.html" title="Class template array">array</a>;
+ template<typename T, std::size_t N>
+ void <a class="link" href="../boost/array.html#boost.swap">swap</a>(
+ <a class="link" href="../boost/array.html" title="Class template array">array</a><T, N>&
+ ,
+
+ <a class="link" href="../boost/array.html" title="Class template array">array</a><T, N>&
+ );
+ template<typename T, std::size_t N>
+ bool <a class="link" href="../boost/array.html#boost.operator==">operator==</a>(
+ const <a class="link" href="../boost/array.html" title="Class template array">array</a><T, N>&
+ ,
+
+ const <a class="link" href="../boost/array.html" title="Class template array">array</a><T, N>&
+ );
+ template<typename T, std::size_t N>
+ bool <a class="link" href="../boost/array.html#boost.operator!=">operator!=</a>(
+ const <a class="link" href="../boost/array.html" title="Class template array">array</a><T, N>&
+ ,
+
+ const <a class="link" href="../boost/array.html" title="Class template array">array</a><T, N>&
+ );
+ template<typename T, std::size_t N>
+ bool <a class="link" href="../boost/array.html#boost.operator_id227596">operator<</a>(
+ const <a class="link" href="../boost/array.html" title="Class template array">array</a><T, N>&
+ ,
+
+ const <a class="link" href="../boost/array.html" title="Class template array">array</a><T, N>&
+ );
+ template<typename T, std::size_t N>
+ bool <a class="link" href="../boost/array.html#boost.operator_id227679">operator></a>(
+ const <a class="link" href="../boost/array.html" title="Class template array">array</a><T, N>&
+ ,
+
+ const <a class="link" href="../boost/array.html" title="Class template array">array</a><T, N>&
+ );
+ template<typename T, std::size_t N>
+ bool <a class="link" href="../boost/array.html#boost.operator_=_id227747">operator<=</a>(
+ const <a class="link" href="../boost/array.html" title="Class template array">array</a><T, N>&
+ ,
+
+ const <a class="link" href="../boost/array.html" title="Class template array">array</a><T, N>&
+ );
+ template<typename T, std::size_t N>
+ bool <a class="link" href="../boost/array.html#boost.operator_=_id227814">operator>=</a>(
+ const <a class="link" href="../boost/array.html" title="Class template array">array</a><T, N>&
+ ,
+
+ const <a class="link" href="../boost/array.html" title="Class template array">array</a><T, N>&
+ );
+}</pre>
+</div>
+</div>
+<div class="section" lang="en">
+<div class="titlepage"><div><div><h3 class="title">
+<a name="array.rationale"></a>Design Rationale</h3></div></div></div>
+
+ There was an important design tradeoff regarding the
+ constructors: We could implement array as an "aggregate" (see
+ Section 8.5.1, [dcl.init.aggr], of the C++ Standard). This would
+ mean:
+ 
+<div class="itemizedlist"><ul type="disc"><li>
+
+ An array can be initialized with a
+ brace-enclosing, comma-separated list of initializers for the
+ elements of the container, written in increasing subscript
+ order:
+ 
+<pre class="programlisting">
+ <code class="computeroutput"><a class="link" href="../boost/array.html" title="Class template array">boost::array</a></code><int,4> a = { { 1, 2, 3 } };
+ </pre>
+
+ Note that if there are fewer elements in the
+ initializer list, then each remaining element gets
+ default-initialized (thus, it has a defined value).
+ 
+</li></ul></div>
+
+ 
+
+ However, this approach has its drawbacks: 
+ passing no initializer list means that the elements
+ have an indetermined initial value
+ , because the rule says
+ that aggregates may have:
+ 
+<div class="itemizedlist"><ul type="disc">
+<li>No user-declared constructors.</li>
+<li>No private or protected non-static data members.</li>
+<li>No base classes.</li>
+<li>No virtual functions.</li>
+</ul></div>
+
+ 
+Nevertheless, The current implementation uses this approach.
+
+ Note that for standard conforming compilers it is possible to
+ use fewer braces (according to 8.5.1 (11) of the Standard). That is,
+ you can initialize an array as follows:
+ 
+<pre class="programlisting">
+ <code class="computeroutput"><a class="link" href="../boost/array.html" title="Class template array">boost::array</a></code><int,4> a = { 1, 2, 3 };
+ </pre>
+
+ I'd appreciate any constructive feedback. 
+ Please note: I don't have time to read all boost
+ mails. Thus, to make sure that feedback arrives to me, please send
+ me a copy of each mail regarding this class.
+ 
+ 
+
+ The code is provided "as is" without expressed or implied
+ warranty.
+ 
+</div>
+<div class="section" lang="en">
+<div class="titlepage"><div><div><h3 class="title">
+<a name="array.more.info"></a>For more information...</h3></div></div></div>
+
+ To find more details about using ordinary arrays in C++ and
+ the framework of the STL, see e.g.
+
+ 
+<div class="literallayout"> 
+ The C++ Standard Library - A Tutorial and Reference 
+ by Nicolai M. Josuttis 
+ Addison Wesley Longman, 1999 
+ ISBN 0-201-37926-0 
+ </div>
+
+ 
+
+ <a href="http://www.josuttis.com/" target="_top">
+ Home Page of Nicolai
+ Josuttis
+ </a>
+ 
+</div>
+<div class="section" lang="en">
+<div class="titlepage"><div><div><h3 class="title">
+<a name="array.ack"></a>Acknowledgements</h3></div></div></div>
+Doug Gregor ported the documentation to the BoostBook format.
+</div>
+</div>
+<table xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" width="100%"><tr>
+<td align="left"></td>
+<td align="right"><div class="copyright-footer">Copyright © 2007 John Maddock, Joel de Guzman, Eric Niebler and Matias
+ Capeletto
+ 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)
+ 
+</div></td>
+</tr></table>
+<hr>
+<div class="spirit-nav">
+<a accesskey="p" href="remez.html"><img src="../../../../doc/html/images/prev.png" alt="Prev"></a><a accesskey="u" href="../index.html"><img src="../../../../doc/html/images/up.png" alt="Up"></a><a accesskey="h" href="../index.html"><img src="../../../../doc/html/images/home.png" alt="Home"></a><a accesskey="n" href="../boost/array.html"><img src="../../../../doc/html/images/next.png" alt="Next"></a>
+</div>
+</body>
+</html>

Added: trunk/doc/test/gold/document_to_test_formatting/basic_formatting.html
==============================================================================
--- (empty file)
+++ trunk/doc/test/gold/document_to_test_formatting/basic_formatting.html 2008-12-09 07:11:12 EST (Tue, 09 Dec 2008)
@@ -0,0 +1,201 @@
+<html>
+<head>
+<meta http-equiv="Content-Type" content="text/html; charset=ISO-8859-1">
+<title>Basic Formatting</title>
+<link rel="stylesheet" href="../../../../doc/html/boostbook.css" type="text/css">
+<meta name="generator" content="DocBook XSL Stylesheets Vsnapshot_8125">
+<link rel="home" href="../index.html" title="Document To Test Formatting">
+<link rel="up" href="../index.html" title="Document To Test Formatting">
+<link rel="prev" href="code_blocks.html" title="Code Blocks">
+<link rel="next" href="blurbs.html" title="Blurbs">
+</head>
+<body bgcolor="white" text="black" link="#0000FF" vlink="#840084" alink="#0000FF">
+<table cellpadding="2" width="100%"><tr>
+<td valign="top"><img alt="Boost C++ Libraries" width="277" height="86" src="../../../../boost.png"></td>
+<td align="center">Home</td>
+<td align="center">Libraries</td>
+<td align="center">People</td>
+<td align="center">FAQ</td>
+<td align="center">More</td>
+</tr></table>
+<hr>
+<div class="spirit-nav">
+<a accesskey="p" href="code_blocks.html"><img src="../../../../doc/html/images/prev.png" alt="Prev"></a><a accesskey="u" href="../index.html"><img src="../../../../doc/html/images/up.png" alt="Up"></a><a accesskey="h" href="../index.html"><img src="../../../../doc/html/images/home.png" alt="Home"></a><a accesskey="n" href="blurbs.html"><img src="../../../../doc/html/images/next.png" alt="Next"></a>
+</div>
+<div class="section" lang="en">
+<div class="titlepage"><div><div><h2 class="title" style="clear: both">
+<a name="document_to_test_formatting.basic_formatting"></a><a class="link" href="basic_formatting.html" title="Basic Formatting">Basic Formatting</a>
+</h2></div></div></div>
+<div class="toc"><dl>
+<dt><a href="basic_formatting.html#document_to_test_formatting.basic_formatting.font_styles">Font
+ Styles</a></dt>
+<dt><a href="basic_formatting.html#document_to_test_formatting.basic_formatting.replaceable_text">Replaceable
+ Text</a></dt>
+<dt>Quotations</dt>
+<dt><a href="basic_formatting.html#document_to_test_formatting.basic_formatting.inline_code">Inline
+ Code</a></dt>
+<dt>Links</dt>
+<dt>Footnotes</dt>
+<dt>Blockquote</dt>
+<dt>Headings</dt>
+</dl></div>
+<div class="section" lang="en">
+<div class="titlepage"><div><div><h3 class="title">
+<a name="document_to_test_formatting.basic_formatting.font_styles"></a><a class="link" href="basic_formatting.html#document_to_test_formatting.basic_formatting.font_styles" title="Font Styles">Font
+ Styles</a>
+</h3></div></div></div>
+
+ Here we go with some inline formatting: italic, bold, underline,
+ <code class="literal">teletype</code>, strikethrough,
+ we can combine styles as well: bold italic,
+ <code class="literal">teletype with underline</code>.
+ 
+</div>
+<div class="section" lang="en">
+<div class="titlepage"><div><div><h3 class="title">
+<a name="document_to_test_formatting.basic_formatting.replaceable_text"></a><a class="link" href="basic_formatting.html#document_to_test_formatting.basic_formatting.replaceable_text" title="Replaceable Text">Replaceable
+ Text</a>
+</h3></div></div></div>
+
+ Text that is intended to be user-replaceable is
+ <code>
+ rendered like this
+ </code>
+ .
+ 
+</div>
+<div class="section" lang="en">
+<div class="titlepage"><div><div><h3 class="title">
+<a name="document_to_test_formatting.basic_formatting.quotations"></a><a class="link" href="basic_formatting.html#document_to_test_formatting.basic_formatting.quotations" title="Quotations">Quotations</a>
+</h3></div></div></div>
+
+ Here we go: “A question that sometimes drives me hazy: am I or are
+ the others crazy?”--Einstein
+ 
+
+ Note the proper left and right quote marks. Also, while you can simply use
+ ordinary quote marks like "quoted", our quotation, above, will
+ generate correct DocBook quotations (e.g. <quote>quoted</quote>).
+ 
+
+ Like all phrase elements, quotations may be nested. Example:
+ 
+
+ “Here's the rule for bargains: ‘Do other men, for they would
+ do you.’ That's the true business precept.”
+ 
+</div>
+<div class="section" lang="en">
+<div class="titlepage"><div><div><h3 class="title">
+<a name="document_to_test_formatting.basic_formatting.inline_code"></a><a class="link" href="basic_formatting.html#document_to_test_formatting.basic_formatting.inline_code" title="Inline Code">Inline
+ Code</a>
+</h3></div></div></div>
+
+ This text has inlined code <code class="computeroutput">int main() { return 0; }</code>
+ in it. The code should be syntax highlighted.
+ 
+</div>
+<div class="section" lang="en">
+<div class="titlepage"><div><div><h3 class="title">
+<a name="document_to_test_formatting.basic_formatting.links"></a><a class="link" href="basic_formatting.html#document_to_test_formatting.basic_formatting.links" title="Links">Links</a>
+</h3></div></div></div>
+
+ Try this: <a href="http://www.boost.org" target="_top">this is boost's
+ website....</a> it should be visible as a link.
+ 
+</div>
+<div class="section" lang="en">
+<div class="titlepage"><div><div><h3 class="title">
+<a name="document_to_test_formatting.basic_formatting.footnotes"></a><a class="link" href="basic_formatting.html#document_to_test_formatting.basic_formatting.footnotes" title="Footnotes">Footnotes</a>
+</h3></div></div></div>
+
+ Here's one
+ [<a name="id537164" href="#ftn.id537164" class="footnote">1</a>]
+ .
+ 
+
+ And here's another
+ [<a name="id537177" href="#ftn.id537177" class="footnote">2</a>]
+ .
+ 
+</div>
+<div class="section" lang="en">
+<div class="titlepage"><div><div><h3 class="title">
+<a name="document_to_test_formatting.basic_formatting.blockquote"></a><a class="link" href="basic_formatting.html#document_to_test_formatting.basic_formatting.blockquote" title="Blockquote">Blockquote</a>
+</h3></div></div></div>
+
+ Lets indent the next paragraph:
+ 
+<div class="blockquote"><blockquote class="blockquote">
+
+ 
+
+ Here we go!!!
+ 
+
+ 
+</blockquote></div>
+</div>
+<div class="section" lang="en">
+<div class="titlepage"><div><div><h3 class="title">
+<a name="document_to_test_formatting.basic_formatting.headings"></a><a class="link" href="basic_formatting.html#document_to_test_formatting.basic_formatting.headings" title="Headings">Headings</a>
+</h3></div></div></div>
+
+ Now try rendering some heading styles:
+ 
+<a name="document_to_test_formatting.basic_formatting.headings.heading_1"></a><h2>
+<a name="id537256"></a>
+ <a class="link" href="basic_formatting.html#document_to_test_formatting.basic_formatting.headings.heading_1">Heading
+ 1</a>
+ </h2>
+<a name="document_to_test_formatting.basic_formatting.headings.heading_2"></a><h3>
+<a name="id537280"></a>
+ <a class="link" href="basic_formatting.html#document_to_test_formatting.basic_formatting.headings.heading_2">Heading
+ 2</a>
+ </h3>
+<a name="document_to_test_formatting.basic_formatting.headings.heading_3"></a><h4>
+<a name="id537304"></a>
+ <a class="link" href="basic_formatting.html#document_to_test_formatting.basic_formatting.headings.heading_3">Heading
+ 3</a>
+ </h4>
+<a name="document_to_test_formatting.basic_formatting.headings.heading_4"></a><h5>
+<a name="id537330"></a>
+ <a class="link" href="basic_formatting.html#document_to_test_formatting.basic_formatting.headings.heading_4">Heading
+ 4</a>
+ </h5>
+<a name="document_to_test_formatting.basic_formatting.headings.heading_5"></a><h6>
+<a name="id537354"></a>
+ <a class="link" href="basic_formatting.html#document_to_test_formatting.basic_formatting.headings.heading_5">Heading
+ 5</a>
+ </h6>
+<a name="document_to_test_formatting.basic_formatting.headings.heading_6"></a><h4>
+<a name="id537378"></a>
+ <a class="link" href="basic_formatting.html#document_to_test_formatting.basic_formatting.headings.heading_6">Heading
+ 6</a>
+ </h4>
+</div>
+<div class="footnotes">
+ <hr width="100" align="left">
+<div class="footnote">[<a name="ftn.id537164" href="#id537164" class="para">1</a>] 
+ A sample footnote
+ </div>
+<div class="footnote">[<a name="ftn.id537177" href="#id537177" class="para">2</a>] 
+ Another sample footnote
+ </div>
+</div>
+</div>
+<table xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" width="100%"><tr>
+<td align="left"></td>
+<td align="right"><div class="copyright-footer">Copyright © 2007 John Maddock, Joel de Guzman, Eric Niebler and Matias
+ Capeletto
+ 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)
+ 
+</div></td>
+</tr></table>
+<hr>
+<div class="spirit-nav">
+<a accesskey="p" href="code_blocks.html"><img src="../../../../doc/html/images/prev.png" alt="Prev"></a><a accesskey="u" href="../index.html"><img src="../../../../doc/html/images/up.png" alt="Up"></a><a accesskey="h" href="../index.html"><img src="../../../../doc/html/images/home.png" alt="Home"></a><a accesskey="n" href="blurbs.html"><img src="../../../../doc/html/images/next.png" alt="Next"></a>
+</div>
+</body>
+</html>

Added: trunk/doc/test/gold/document_to_test_formatting/blurbs.html
==============================================================================
--- (empty file)
+++ trunk/doc/test/gold/document_to_test_formatting/blurbs.html 2008-12-09 07:11:12 EST (Tue, 09 Dec 2008)
@@ -0,0 +1,160 @@
+<html>
+<head>
+<meta http-equiv="Content-Type" content="text/html; charset=ISO-8859-1">
+<title>Blurbs</title>
+<link rel="stylesheet" href="../../../../doc/html/boostbook.css" type="text/css">
+<meta name="generator" content="DocBook XSL Stylesheets Vsnapshot_8125">
+<link rel="home" href="../index.html" title="Document To Test Formatting">
+<link rel="up" href="../index.html" title="Document To Test Formatting">
+<link rel="prev" href="basic_formatting.html" title="Basic Formatting">
+<link rel="next" href="lists_and_tables.html" title="Lists and Tables">
+</head>
+<body bgcolor="white" text="black" link="#0000FF" vlink="#840084" alink="#0000FF">
+<table cellpadding="2" width="100%"><tr>
+<td valign="top"><img alt="Boost C++ Libraries" width="277" height="86" src="../../../../boost.png"></td>
+<td align="center">Home</td>
+<td align="center">Libraries</td>
+<td align="center">People</td>
+<td align="center">FAQ</td>
+<td align="center">More</td>
+</tr></table>
+<hr>
+<div class="spirit-nav">
+<a accesskey="p" href="basic_formatting.html"><img src="../../../../doc/html/images/prev.png" alt="Prev"></a><a accesskey="u" href="../index.html"><img src="../../../../doc/html/images/up.png" alt="Up"></a><a accesskey="h" href="../index.html"><img src="../../../../doc/html/images/home.png" alt="Home"></a><a accesskey="n" href="lists_and_tables.html"><img src="../../../../doc/html/images/next.png" alt="Next"></a>
+</div>
+<div class="section" lang="en">
+<div class="titlepage"><div><div><h2 class="title" style="clear: both">
+<a name="document_to_test_formatting.blurbs"></a><a class="link" href="blurbs.html" title="Blurbs">Blurbs</a>
+</h2></div></div></div>
+<div class="toc"><dl>
+<dt><a href="blurbs.html#document_to_test_formatting.blurbs.preformatted_text">Preformatted
+ text</a></dt>
+<dt>Admonishments</dt>
+<dt>Blurbs</dt>
+</dl></div>
+<div class="section" lang="en">
+<div class="titlepage"><div><div><h3 class="title">
+<a name="document_to_test_formatting.blurbs.preformatted_text"></a><a class="link" href="blurbs.html#document_to_test_formatting.blurbs.preformatted_text" title="Preformatted text">Preformatted
+ text</a>
+</h3></div></div></div>
+
+ Here's some sample program output:
+ 
+<pre class="programlisting">F test for equal standard deviations
+____________________________________
+
+Sample 1:
+Number of Observations = 240
+Sample Standard Deviation = 65.549
+
+Sample 2:
+Number of Observations = 240
+Sample Standard Deviation = 61.854
+
+Test Statistic = 1.123
+
+CDF of test statistic: = 8.148e-001
+Upper Critical Value at alpha: = 1.238e+000
+Upper Critical Value at alpha/2: = 1.289e+000
+Lower Critical Value at alpha: = 8.080e-001
+Lower Critical Value at alpha/2: = 7.756e-001
+
+Results for Alternative Hypothesis and alpha = 0.0500
+
+Alternative Hypothesis Conclusion
+Standard deviations are unequal (two sided test) REJECTED
+Standard deviation 1 is less than standard deviation 2 REJECTED
+Standard deviation 1 is greater than standard deviation 2 REJECTED
+</pre>
+</div>
+<div class="section" lang="en">
+<div class="titlepage"><div><div><h3 class="title">
+<a name="document_to_test_formatting.blurbs.admonishments"></a><a class="link" href="blurbs.html#document_to_test_formatting.blurbs.admonishments" title="Admonishments">Admonishments</a>
+</h3></div></div></div>
+
+ There are four admonishments supported by Docbook XML:
+ 
+<div class="note"><table border="0" summary="Note">
+<tr>
+<td rowspan="2" align="center" valign="top" width="25"><img alt="[Note]" src="../../../../doc/html/images/note.png"></td>
+<th align="left">Note</th>
+</tr>
+<tr><td align="left" valign="top">
+ This is a note
+ </td></tr>
+</table></div>
+<div class="tip"><table border="0" summary="Tip">
+<tr>
+<td rowspan="2" align="center" valign="top" width="25"><img alt="[Tip]" src="../../../../doc/html/images/tip.png"></td>
+<th align="left">Tip</th>
+</tr>
+<tr><td align="left" valign="top">
+ This is a tip
+ </td></tr>
+</table></div>
+<div class="important"><table border="0" summary="Important">
+<tr>
+<td rowspan="2" align="center" valign="top" width="25"><img alt="[Important]" src="../../../../doc/html/images/important.png"></td>
+<th align="left">Important</th>
+</tr>
+<tr><td align="left" valign="top">
+ This is important
+ </td></tr>
+</table></div>
+<div class="caution"><table border="0" summary="Caution">
+<tr>
+<td rowspan="2" align="center" valign="top" width="25"><img alt="[Caution]" src="../../../../doc/html/images/caution.png"></td>
+<th align="left">Caution</th>
+</tr>
+<tr><td align="left" valign="top">
+ This is a caution
+ </td></tr>
+</table></div>
+<div class="warning"><table border="0" summary="Warning">
+<tr>
+<td rowspan="2" align="center" valign="top" width="25"><img alt="[Warning]" src="../../../../doc/html/images/warning.png"></td>
+<th align="left">Warning</th>
+</tr>
+<tr><td align="left" valign="top">
+
+ This is a warning
+ 
+
+ They can contain more than one paragraph.
+ 
+</td></tr>
+</table></div>
+</div>
+<div class="section" lang="en">
+<div class="titlepage"><div><div><h3 class="title">
+<a name="document_to_test_formatting.blurbs.blurbs"></a><a class="link" href="blurbs.html#document_to_test_formatting.blurbs.blurbs" title="Blurbs">Blurbs</a>
+</h3></div></div></div>
+<div class="sidebar">
+
+
+ An eye catching advertisement or note...
+ 
+
+ These should be rendered in a manner similar to admonishments.
+ 
+
+ They can contain more than one paragraph.
+ 
+</div>
+</div>
+</div>
+<table xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" width="100%"><tr>
+<td align="left"></td>
+<td align="right"><div class="copyright-footer">Copyright © 2007 John Maddock, Joel de Guzman, Eric Niebler and Matias
+ Capeletto
+ 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)
+ 
+</div></td>
+</tr></table>
+<hr>
+<div class="spirit-nav">
+<a accesskey="p" href="basic_formatting.html"><img src="../../../../doc/html/images/prev.png" alt="Prev"></a><a accesskey="u" href="../index.html"><img src="../../../../doc/html/images/up.png" alt="Up"></a><a accesskey="h" href="../index.html"><img src="../../../../doc/html/images/home.png" alt="Home"></a><a accesskey="n" href="lists_and_tables.html"><img src="../../../../doc/html/images/next.png" alt="Next"></a>
+</div>
+</body>
+</html>

Added: trunk/doc/test/gold/document_to_test_formatting/code_blocks.html
==============================================================================
--- (empty file)
+++ trunk/doc/test/gold/document_to_test_formatting/code_blocks.html 2008-12-09 07:11:12 EST (Tue, 09 Dec 2008)
@@ -0,0 +1,428 @@
+<html>
+<head>
+<meta http-equiv="Content-Type" content="text/html; charset=ISO-8859-1">
+<title>Code Blocks</title>
+<link rel="stylesheet" href="../../../../doc/html/boostbook.css" type="text/css">
+<meta name="generator" content="DocBook XSL Stylesheets Vsnapshot_8125">
+<link rel="home" href="../index.html" title="Document To Test Formatting">
+<link rel="up" href="../index.html" title="Document To Test Formatting">
+<link rel="prev" href="../index.html" title="Document To Test Formatting">
+<link rel="next" href="basic_formatting.html" title="Basic Formatting">
+</head>
+<body bgcolor="white" text="black" link="#0000FF" vlink="#840084" alink="#0000FF">
+<table cellpadding="2" width="100%"><tr>
+<td valign="top"><img alt="Boost C++ Libraries" width="277" height="86" src="../../../../boost.png"></td>
+<td align="center">Home</td>
+<td align="center">Libraries</td>
+<td align="center">People</td>
+<td align="center">FAQ</td>
+<td align="center">More</td>
+</tr></table>
+<hr>
+<div class="spirit-nav">
+<a accesskey="p" href="../index.html"><img src="../../../../doc/html/images/prev.png" alt="Prev"></a><a accesskey="u" href="../index.html"><img src="../../../../doc/html/images/up.png" alt="Up"></a><a accesskey="h" href="../index.html"><img src="../../../../doc/html/images/home.png" alt="Home"></a><a accesskey="n" href="basic_formatting.html"><img src="../../../../doc/html/images/next.png" alt="Next"></a>
+</div>
+<div class="section" lang="en">
+<div class="titlepage"><div><div><h2 class="title" style="clear: both">
+<a name="document_to_test_formatting.code_blocks"></a><a class="link" href="code_blocks.html" title="Code Blocks">Code Blocks</a>
+</h2></div></div></div>
+<div class="toc"><dl>
+<dt><a href="code_blocks.html#document_to_test_formatting.code_blocks.embedded_code">Embedded
+ code</a></dt>
+<dt><a href="code_blocks.html#document_to_test_formatting.code_blocks.imported_code_and_callouts">Imported
+ code and callouts</a></dt>
+<dt><a href="code_blocks.html#document_to_test_formatting.code_blocks.larger_example">Larger
+ example</a></dt>
+</dl></div>
+<div class="section" lang="en">
+<div class="titlepage"><div><div><h3 class="title">
+<a name="document_to_test_formatting.code_blocks.embedded_code"></a><a class="link" href="code_blocks.html#document_to_test_formatting.code_blocks.embedded_code" title="Embedded code">Embedded
+ code</a>
+</h3></div></div></div>
+
+ These should be syntax highlighted:
+ 
+<pre class="programlisting">#include <iostream>
+
+int main()
+{
+ // Sample code
+ std::cout << "Hello, World\n";
+ return 0;
+}
+</pre>
+</div>
+<div class="section" lang="en">
+<div class="titlepage"><div><div><h3 class="title">
+<a name="document_to_test_formatting.code_blocks.imported_code_and_callouts"></a><a class="link" href="code_blocks.html#document_to_test_formatting.code_blocks.imported_code_and_callouts" title="Imported code and callouts">Imported
+ code and callouts</a>
+</h3></div></div></div>
+
+ Here's some code with left-placed callouts:
+ 
+
+ 
+
+
+
+<pre class="programlisting">class x
+{
+public:
+
+ <a class="co" name="document_to_test_formatting2co" href="code_blocks.html#document_to_test_formatting2"><img src="../../../src/images/callouts/1.png" alt="1" border="0"></a>x() : n(0)
+ {
+ }
+
+ <a class="co" name="document_to_test_formatting3co" href="code_blocks.html#document_to_test_formatting3"><img src="../../../src/images/callouts/2.png" alt="2" border="0"></a>~x()
+ {
+ }
+
+ <a class="co" name="document_to_test_formatting4co" href="code_blocks.html#document_to_test_formatting4"><img src="../../../src/images/callouts/3.png" alt="3" border="0"></a>int get() const
+ {
+ return n;
+ }
+
+ <a class="co" name="document_to_test_formatting5co" href="code_blocks.html#document_to_test_formatting5"><img src="../../../src/images/callouts/4.png" alt="4" border="0"></a>void set(int n_)
+ {
+ n = n_;
+ }
+};
+</pre>
+
+ 
+
+ 
+
+ 
+<div class="calloutlist"><table border="0" summary="Callout list">
+<tr>
+<td width="5%" valign="top" align="left"><a name="document_to_test_formatting2"></a> </td>
+<td valign="top" align="left"> Constructor </td>
+</tr>
+<tr>
+<td width="5%" valign="top" align="left"><a name="document_to_test_formatting3"></a> </td>
+<td valign="top" align="left"> Destructor </td>
+</tr>
+<tr>
+<td width="5%" valign="top" align="left"><a name="document_to_test_formatting4"></a> </td>
+<td valign="top" align="left"> Get the <code class="computeroutput">n</code>
+ member variable </td>
+</tr>
+<tr>
+<td width="5%" valign="top" align="left"><a name="document_to_test_formatting5"></a> </td>
+<td valign="top" align="left"> Set the <code class="computeroutput">n</code>
+ member variable </td>
+</tr>
+</table></div>
+
+ 
+
+ 
+
+ And again with callouts placed exactly where we put them:
+ 
+
+ 
+
+
+
+<pre class="programlisting">std::string foo_bar() <a class="co" name="document_to_test_formatting0co" href="code_blocks.html#document_to_test_formatting0"><img src="../../../src/images/callouts/1.png" alt="1" border="0"></a>
+{
+ return "foo-bar"; <a class="co" name="document_to_test_formatting1co" href="code_blocks.html#document_to_test_formatting1"><img src="../../../src/images/callouts/2.png" alt="2" border="0"></a>
+}
+</pre>
+
+ 
+
+ 
+
+ 
+<div class="calloutlist"><table border="0" summary="Callout list">
+<tr>
+<td width="5%" valign="top" align="left"><a name="document_to_test_formatting0"></a> </td>
+<td valign="top" align="left"> The Mythical FooBar. See <a href="http://en.wikipedia.org/wiki/Foobar" target="_top">Foobar
+ for details</a> </td>
+</tr>
+<tr>
+<td width="5%" valign="top" align="left"><a name="document_to_test_formatting1"></a> </td>
+<td valign="top" align="left"> return 'em, foo-bar man! </td>
+</tr>
+</table></div>
+
+ 
+
+ 
+</div>
+<div class="section" lang="en">
+<div class="titlepage"><div><div><h3 class="title">
+<a name="document_to_test_formatting.code_blocks.larger_example"></a><a class="link" href="code_blocks.html#document_to_test_formatting.code_blocks.larger_example" title="Larger example">Larger
+ example</a>
+</h3></div></div></div>
+
+ Now let's include a larger example, this may span several pages and should
+ not be chopped off half way through... some FO processors get this wrong!
+ 
+<pre class="programlisting">namespace boost{
+
+template <class BidirectionalIterator>
+class sub_match;
+
+typedef sub_match<const char*> csub_match;
+typedef sub_match<const wchar_t*> wcsub_match;
+typedef sub_match<std::string::const_iterator> ssub_match;
+typedef sub_match<std::wstring::const_iterator> wssub_match;
+
+template <class BidirectionalIterator>
+class sub_match : public std::pair<BidirectionalIterator, BidirectionalIterator>
+{
+public:
+ typedef typename iterator_traits<BidirectionalIterator>::value_type value_type;
+ typedef typename iterator_traits<BidirectionalIterator>::difference_type difference_type;
+ typedef BidirectionalIterator iterator;
+
+ bool matched;
+
+ difference_type length()const;
+ operator basic_string<value_type>()const;
+ basic_string<value_type> str()const;
+
+ int compare(const sub_match& s)const;
+ int compare(const basic_string<value_type>& s)const;
+ int compare(const value_type* s)const;
+#ifdef BOOST_REGEX_MATCH_EXTRA
+ typedef implementation-private capture_sequence_type;
+ const capture_sequence_type& captures()const;
+#endif
+};
+//
+// comparisons to another sub_match:
+//
+template <class BidirectionalIterator>
+bool operator == (const sub_match<BidirectionalIterator>& lhs,
+ const sub_match<BidirectionalIterator>& rhs);
+template <class BidirectionalIterator>
+bool operator != (const sub_match<BidirectionalIterator>& lhs,
+ const sub_match<BidirectionalIterator>& rhs);
+template <class BidirectionalIterator>
+bool operator < (const sub_match<BidirectionalIterator>& lhs,
+ const sub_match<BidirectionalIterator>& rhs);
+template <class BidirectionalIterator>
+bool operator <= (const sub_match<BidirectionalIterator>& lhs,
+ const sub_match<BidirectionalIterator>& rhs);
+template <class BidirectionalIterator>
+bool operator >= (const sub_match<BidirectionalIterator>& lhs,
+ const sub_match<BidirectionalIterator>& rhs);
+template <class BidirectionalIterator>
+bool operator > (const sub_match<BidirectionalIterator>& lhs,
+ const sub_match<BidirectionalIterator>& rhs);
+
+
+//
+// comparisons to a basic_string:
+//
+template <class BidirectionalIterator, class traits, class Allocator>
+bool operator == (const std::basic_string<iterator_traits<BidirectionalIterator>::value_type,
+ traits,
+ Allocator>& lhs,
+ const sub_match<BidirectionalIterator>& rhs);
+template <class BidirectionalIterator, class traits, class Allocator>
+bool operator != (const std::basic_string<iterator_traits<BidirectionalIterator>::value_type,
+ traits,
+ Allocator>& lhs,
+ const sub_match<BidirectionalIterator>& rhs);
+template <class BidirectionalIterator, class traits, class Allocator>
+bool operator < (const std::basic_string<iterator_traits<BidirectionalIterator>::value_type,
+ traits,
+ Allocator>& lhs,
+ const sub_match<BidirectionalIterator>& rhs);
+template <class BidirectionalIterator, class traits, class Allocator>
+bool operator > (const std::basic_string<iterator_traits<BidirectionalIterator>::value_type,
+ traits,
+ Allocator>& lhs,
+ const sub_match<BidirectionalIterator>& rhs);
+template <class BidirectionalIterator, class traits, class Allocator>
+bool operator >= (const std::basic_string<iterator_traits<BidirectionalIterator>::value_type,
+ traits,
+ Allocator>& lhs,
+ const sub_match<BidirectionalIterator>& rhs);
+template <class BidirectionalIterator, class traits, class Allocator>
+bool operator <= (const std::basic_string<iterator_traits<BidirectionalIterator>::value_type,
+ traits,
+ Allocator>& lhs,
+ const sub_match<BidirectionalIterator>& rhs);
+
+template <class BidirectionalIterator, class traits, class Allocator>
+bool operator == (const sub_match<BidirectionalIterator>& lhs,
+ const std::basic_string<iterator_traits<BidirectionalIterator>::value_type,
+ traits,
+ Allocator>& rhs);
+template <class BidirectionalIterator, class traits, class Allocator>
+bool operator != (const sub_match<BidirectionalIterator>& lhs,
+ const std::basic_string<iterator_traits<BidirectionalIterator>::value_type,
+ traits,
+ Allocator>& rhs);
+template <class BidirectionalIterator, class traits, class Allocator>
+bool operator < (const sub_match<BidirectionalIterator>& lhs,
+ const std::basic_string<iterator_traits<BidirectionalIterator>::value_type,
+ traits,
+ Allocator>& rhs);
+template <class BidirectionalIterator, class traits, class Allocator>
+bool operator > (const sub_match<BidirectionalIterator>& lhs,
+ const std::basic_string<iterator_traits<BidirectionalIterator>::value_type,
+ traits,
+ Allocator>& rhs);
+template <class BidirectionalIterator, class traits, class Allocator>
+bool operator >= (const sub_match<BidirectionalIterator>& lhs,
+ const std::basic_string<iterator_traits<BidirectionalIterator>::value_type,
+ traits,
+ Allocator>& rhs);
+template <class BidirectionalIterator, class traits, class Allocator>
+bool operator <= (const sub_match<BidirectionalIterator>& lhs,
+ const std::basic_string<iterator_traits<BidirectionalIterator>::value_type,
+ traits,
+ Allocator>& rhs);
+
+//
+// comparisons to a pointer to a character array:
+//
+template <class BidirectionalIterator>
+bool operator == (typename iterator_traits<BidirectionalIterator>::value_type const* lhs,
+ const sub_match<BidirectionalIterator>& rhs);
+template <class BidirectionalIterator>
+bool operator != (typename iterator_traits<BidirectionalIterator>::value_type const* lhs,
+ const sub_match<BidirectionalIterator>& rhs);
+template <class BidirectionalIterator>
+bool operator < (typename iterator_traits<BidirectionalIterator>::value_type const* lhs,
+ const sub_match<BidirectionalIterator>& rhs);
+template <class BidirectionalIterator>
+bool operator > (typename iterator_traits<BidirectionalIterator>::value_type const* lhs,
+ const sub_match<BidirectionalIterator>& rhs);
+template <class BidirectionalIterator>
+bool operator >= (typename iterator_traits<BidirectionalIterator>::value_type const* lhs,
+ const sub_match<BidirectionalIterator>& rhs);
+template <class BidirectionalIterator>
+bool operator <= (typename iterator_traits<BidirectionalIterator>::value_type const* lhs,
+ const sub_match<BidirectionalIterator>& rhs);
+
+template <class BidirectionalIterator>
+bool operator == (const sub_match<BidirectionalIterator>& lhs,
+ typename iterator_traits<BidirectionalIterator>::value_type const* rhs);
+template <class BidirectionalIterator>
+bool operator != (const sub_match<BidirectionalIterator>& lhs,
+ typename iterator_traits<BidirectionalIterator>::value_type const* rhs);
+template <class BidirectionalIterator>
+bool operator < (const sub_match<BidirectionalIterator>& lhs,
+ typename iterator_traits<BidirectionalIterator>::value_type const* rhs);
+template <class BidirectionalIterator>
+bool operator > (const sub_match<BidirectionalIterator>& lhs,
+ typename iterator_traits<BidirectionalIterator>::value_type const* rhs);
+template <class BidirectionalIterator>
+bool operator >= (const sub_match<BidirectionalIterator>& lhs,
+ typename iterator_traits<BidirectionalIterator>::value_type const* rhs);
+template <class BidirectionalIterator>
+bool operator <= (const sub_match<BidirectionalIterator>& lhs,
+ typename iterator_traits<BidirectionalIterator>::value_type const* rhs);
+
+//
+// comparisons to a single character:
+//
+template <class BidirectionalIterator>
+bool operator == (typename iterator_traits<BidirectionalIterator>::value_type const& lhs,
+ const sub_match<BidirectionalIterator>& rhs);
+template <class BidirectionalIterator>
+bool operator != (typename iterator_traits<BidirectionalIterator>::value_type const& lhs,
+ const sub_match<BidirectionalIterator>& rhs);
+template <class BidirectionalIterator>
+bool operator < (typename iterator_traits<BidirectionalIterator>::value_type const& lhs,
+ const sub_match<BidirectionalIterator>& rhs);
+template <class BidirectionalIterator>
+bool operator > (typename iterator_traits<BidirectionalIterator>::value_type const& lhs,
+ const sub_match<BidirectionalIterator>& rhs);
+template <class BidirectionalIterator>
+bool operator >= (typename iterator_traits<BidirectionalIterator>::value_type const& lhs,
+ const sub_match<BidirectionalIterator>& rhs);
+template <class BidirectionalIterator>
+bool operator <= (typename iterator_traits<BidirectionalIterator>::value_type const& lhs,
+ const sub_match<BidirectionalIterator>& rhs);
+
+template <class BidirectionalIterator>
+bool operator == (const sub_match<BidirectionalIterator>& lhs,
+ typename iterator_traits<BidirectionalIterator>::value_type const& rhs);
+template <class BidirectionalIterator>
+bool operator != (const sub_match<BidirectionalIterator>& lhs,
+ typename iterator_traits<BidirectionalIterator>::value_type const& rhs);
+template <class BidirectionalIterator>
+bool operator < (const sub_match<BidirectionalIterator>& lhs,
+ typename iterator_traits<BidirectionalIterator>::value_type const& rhs);
+template <class BidirectionalIterator>
+bool operator > (const sub_match<BidirectionalIterator>& lhs,
+ typename iterator_traits<BidirectionalIterator>::value_type const& rhs);
+template <class BidirectionalIterator>
+bool operator >= (const sub_match<BidirectionalIterator>& lhs,
+ typename iterator_traits<BidirectionalIterator>::value_type const& rhs);
+template <class BidirectionalIterator>
+bool operator <= (const sub_match<BidirectionalIterator>& lhs,
+ typename iterator_traits<BidirectionalIterator>::value_type const& rhs);
+//
+// addition operators:
+//
+template <class BidirectionalIterator, class traits, class Allocator>
+std::basic_string<typename iterator_traits<BidirectionalIterator>::value_type, traits, Allocator>
+ operator + (const std::basic_string<typename iterator_traits<BidirectionalIterator>::value_type,
+ traits,
+ Allocator>& s,
+ const sub_match<BidirectionalIterator>& m);
+template <class BidirectionalIterator, class traits, class Allocator>
+std::basic_string<typename iterator_traits<BidirectionalIterator>::value_type, traits, Allocator>
+ operator + (const sub_match<BidirectionalIterator>& m,
+ const std::basic_string<typename iterator_traits<BidirectionalIterator>::value_type,
+ traits,
+ Allocator>& s);
+template <class BidirectionalIterator>
+std::basic_string<typename iterator_traits<BidirectionalIterator>::value_type>
+ operator + (typename iterator_traits<BidirectionalIterator>::value_type const* s,
+ const sub_match<BidirectionalIterator>& m);
+template <class BidirectionalIterator>
+std::basic_string<typename iterator_traits<BidirectionalIterator>::value_type>
+ operator + (const sub_match<BidirectionalIterator>& m,
+ typename iterator_traits<BidirectionalIterator>::value_type const * s);
+template <class BidirectionalIterator>
+std::basic_string<typename iterator_traits<BidirectionalIterator>::value_type>
+ operator + (typename iterator_traits<BidirectionalIterator>::value_type const& s,
+ const sub_match<BidirectionalIterator>& m);
+template <class BidirectionalIterator>
+std::basic_string<typename iterator_traits<BidirectionalIterator>::value_type>
+ operator + (const sub_match<BidirectionalIterator>& m,
+ typename iterator_traits<BidirectionalIterator>::value_type const& s);
+template <class BidirectionalIterator>
+std::basic_string<typename iterator_traits<BidirectionalIterator>::value_type>
+ operator + (const sub_match<BidirectionalIterator>& m1,
+ const sub_match<BidirectionalIterator>& m2);
+
+//
+// stream inserter:
+//
+template <class charT, class traits, class BidirectionalIterator>
+basic_ostream<charT, traits>&
+ operator << (basic_ostream<charT, traits>& os,
+ const sub_match<BidirectionalIterator>& m);
+
+} // namespace boost
+</pre>
+</div>
+</div>
+<table xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" width="100%"><tr>
+<td align="left"></td>
+<td align="right"><div class="copyright-footer">Copyright © 2007 John Maddock, Joel de Guzman, Eric Niebler and Matias
+ Capeletto
+ 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)
+ 
+</div></td>
+</tr></table>
+<hr>
+<div class="spirit-nav">
+<a accesskey="p" href="../index.html"><img src="../../../../doc/html/images/prev.png" alt="Prev"></a><a accesskey="u" href="../index.html"><img src="../../../../doc/html/images/up.png" alt="Up"></a><a accesskey="h" href="../index.html"><img src="../../../../doc/html/images/home.png" alt="Home"></a><a accesskey="n" href="basic_formatting.html"><img src="../../../../doc/html/images/next.png" alt="Next"></a>
+</div>
+</body>
+</html>

Added: trunk/doc/test/gold/document_to_test_formatting/images.html
==============================================================================
--- (empty file)
+++ trunk/doc/test/gold/document_to_test_formatting/images.html 2008-12-09 07:11:12 EST (Tue, 09 Dec 2008)
@@ -0,0 +1,60 @@
+<html>
+<head>
+<meta http-equiv="Content-Type" content="text/html; charset=ISO-8859-1">
+<title>Images</title>
+<link rel="stylesheet" href="../../../../doc/html/boostbook.css" type="text/css">
+<meta name="generator" content="DocBook XSL Stylesheets Vsnapshot_8125">
+<link rel="home" href="../index.html" title="Document To Test Formatting">
+<link rel="up" href="../index.html" title="Document To Test Formatting">
+<link rel="prev" href="lists_and_tables.html" title="Lists and Tables">
+<link rel="next" href="test.html" title="test HTML4 symbols">
+</head>
+<body bgcolor="white" text="black" link="#0000FF" vlink="#840084" alink="#0000FF">
+<table cellpadding="2" width="100%"><tr>
+<td valign="top"><img alt="Boost C++ Libraries" width="277" height="86" src="../../../../boost.png"></td>
+<td align="center">Home</td>
+<td align="center">Libraries</td>
+<td align="center">People</td>
+<td align="center">FAQ</td>
+<td align="center">More</td>
+</tr></table>
+<hr>
+<div class="spirit-nav">
+<a accesskey="p" href="lists_and_tables.html"><img src="../../../../doc/html/images/prev.png" alt="Prev"></a><a accesskey="u" href="../index.html"><img src="../../../../doc/html/images/up.png" alt="Up"></a><a accesskey="h" href="../index.html"><img src="../../../../doc/html/images/home.png" alt="Home"></a><a accesskey="n" href="test.html"><img src="../../../../doc/html/images/next.png" alt="Next"></a>
+</div>
+<div class="section" lang="en">
+<div class="titlepage"><div><div><h2 class="title" style="clear: both">
+<a name="document_to_test_formatting.images"></a><a class="link" href="images.html" title="Images">Images</a>
+</h2></div></div></div>
+
+ These are tricky enough that they warrent their own section.
+ 
+
+ Let's start with a PNG file that's set to 120dpi, it should render at a sensible
+ size in both html and PDF forms. It should print OK too!
+ 
+
+ <img src="../images/digamma3.png" alt="digamma3">
+ 
+
+ Now try again with a sample SVG image:
+ 
+
+ <object type="image/svg+xml" data="../images/open_clipart_library_logo.svg" width="745.60706" height="513.2569"></object>
+ 
+</div>
+<table xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" width="100%"><tr>
+<td align="left"></td>
+<td align="right"><div class="copyright-footer">Copyright © 2007 John Maddock, Joel de Guzman, Eric Niebler and Matias
+ Capeletto
+ 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)
+ 
+</div></td>
+</tr></table>
+<hr>
+<div class="spirit-nav">
+<a accesskey="p" href="lists_and_tables.html"><img src="../../../../doc/html/images/prev.png" alt="Prev"></a><a accesskey="u" href="../index.html"><img src="../../../../doc/html/images/up.png" alt="Up"></a><a accesskey="h" href="../index.html"><img src="../../../../doc/html/images/home.png" alt="Home"></a><a accesskey="n" href="test.html"><img src="../../../../doc/html/images/next.png" alt="Next"></a>
+</div>
+</body>
+</html>

Added: trunk/doc/test/gold/document_to_test_formatting/lists_and_tables.html
==============================================================================
--- (empty file)
+++ trunk/doc/test/gold/document_to_test_formatting/lists_and_tables.html 2008-12-09 07:11:12 EST (Tue, 09 Dec 2008)
@@ -0,0 +1,455 @@
+<html>
+<head>
+<meta http-equiv="Content-Type" content="text/html; charset=ISO-8859-1">
+<title>Lists and Tables</title>
+<link rel="stylesheet" href="../../../../doc/html/boostbook.css" type="text/css">
+<meta name="generator" content="DocBook XSL Stylesheets Vsnapshot_8125">
+<link rel="home" href="../index.html" title="Document To Test Formatting">
+<link rel="up" href="../index.html" title="Document To Test Formatting">
+<link rel="prev" href="blurbs.html" title="Blurbs">
+<link rel="next" href="images.html" title="Images">
+</head>
+<body bgcolor="white" text="black" link="#0000FF" vlink="#840084" alink="#0000FF">
+<table cellpadding="2" width="100%"><tr>
+<td valign="top"><img alt="Boost C++ Libraries" width="277" height="86" src="../../../../boost.png"></td>
+<td align="center">Home</td>
+<td align="center">Libraries</td>
+<td align="center">People</td>
+<td align="center">FAQ</td>
+<td align="center">More</td>
+</tr></table>
+<hr>
+<div class="spirit-nav">
+<a accesskey="p" href="blurbs.html"><img src="../../../../doc/html/images/prev.png" alt="Prev"></a><a accesskey="u" href="../index.html"><img src="../../../../doc/html/images/up.png" alt="Up"></a><a accesskey="h" href="../index.html"><img src="../../../../doc/html/images/home.png" alt="Home"></a><a accesskey="n" href="images.html"><img src="../../../../doc/html/images/next.png" alt="Next"></a>
+</div>
+<div class="section" lang="en">
+<div class="titlepage"><div><div><h2 class="title" style="clear: both">
+<a name="document_to_test_formatting.lists_and_tables"></a><a class="link" href="lists_and_tables.html" title="Lists and Tables">Lists and
+ Tables</a>
+</h2></div></div></div>
+<div class="toc"><dl>
+<dt>Lists</dt>
+<dt><a href="lists_and_tables.html#document_to_test_formatting.lists_and_tables.variable_lists">Variable
+ Lists</a></dt>
+<dt>Tables</dt>
+</dl></div>
+<div class="section" lang="en">
+<div class="titlepage"><div><div><h3 class="title">
+<a name="document_to_test_formatting.lists_and_tables.lists"></a><a class="link" href="lists_and_tables.html#document_to_test_formatting.lists_and_tables.lists" title="Lists">Lists</a>
+</h3></div></div></div>
+
+ A numbered list:
+ 
+<div class="orderedlist"><ol type="1">
+<li>
+ One
+ </li>
+<li>
+ Two
+ </li>
+<li>
+ Three
+ <div class="orderedlist"><ol type="a">
+<li>
+ Three.a
+ </li>
+<li>
+ Three.b
+ </li>
+<li>
+ Three.c
+ </li>
+</ol></div>
+</li>
+<li>
+ Four
+ <div class="orderedlist"><ol type="a"><li>
+ Four.a
+ <div class="orderedlist"><ol type="i">
+<li>
+ Four.a.i
+ </li>
+<li>
+ Four.a.ii
+ </li>
+</ol></div>
+</li></ol></div>
+</li>
+<li>
+ Five
+ </li>
+</ol></div>
+
+ An unordered list:
+ 
+<div class="itemizedlist"><ul type="disc">
+<li>
+ First
+ </li>
+<li>
+ Second
+ </li>
+<li>
+ Third
+ </li>
+</ul></div>
+
+ A mixture of the two:
+ 
+<div class="orderedlist"><ol type="1">
+<li>
+ 1
+ <div class="itemizedlist"><ul type="disc">
+<li>
+ 1.a
+ <div class="orderedlist"><ol type="a">
+<li>
+ 1.a.1
+ </li>
+<li>
+ 1.a.2
+ </li>
+</ol></div>
+</li>
+<li>
+ 1.b
+ </li>
+</ul></div>
+</li>
+<li>
+ 2
+ <div class="itemizedlist"><ul type="disc">
+<li>
+ 2.a
+ </li>
+<li>
+ 2.b
+ <div class="orderedlist"><ol type="a">
+<li>
+ 2.b.1
+ </li>
+<li>
+ 2.b.2
+ <div class="itemizedlist"><ul type="circle">
+<li>
+ 2.b.2.a
+ </li>
+<li>
+ 2.b.2.b
+ </li>
+</ul></div>
+</li>
+</ol></div>
+</li>
+</ul></div>
+</li>
+</ol></div>
+</div>
+<div class="section" lang="en">
+<div class="titlepage"><div><div><h3 class="title">
+<a name="document_to_test_formatting.lists_and_tables.variable_lists"></a><a class="link" href="lists_and_tables.html#document_to_test_formatting.lists_and_tables.variable_lists" title="Variable Lists">Variable
+ Lists</a>
+</h3></div></div></div>
+<div class="variablelist">
+A Variable List
+<dl>
+<dt>term 1</dt>
+<dd>
+ The definition of term 1
+ </dd>
+<dt>term 2</dt>
+<dd>
+ The definition of term 2
+ </dd>
+<dt>term 3</dt>
+<dd>
+ The definition of term 3
+ </dd>
+</dl>
+</div>
+</div>
+<div class="section" lang="en">
+<div class="titlepage"><div><div><h3 class="title">
+<a name="document_to_test_formatting.lists_and_tables.tables"></a><a class="link" href="lists_and_tables.html#document_to_test_formatting.lists_and_tables.tables" title="Tables">Tables</a>
+</h3></div></div></div>
+
+ Here's a big table with code and other tricky things:
+ 
+<div class="table">
+<a name="id537940"></a>Table 1. Notes on the Implementation of the Beta Distribution
+<div class="table-contents"><table class="table" summary="Notes on the Implementation of the Beta Distribution">
+<colgroup>
+<col>
+<col>
+</colgroup>
+<thead><tr>
+<th>
+ 
+ Function
+ 
+ </th>
+<th>
+ 
+ Implementation Notes
+ 
+ </th>
+</tr></thead>
+<tbody>
+<tr>
+<td>
+ 
+ pdf
+ 
+ </td>
+<td>
+ 
+ f(x;α,β) = xα - 1 (1 - x)β -1 / B(α, β)
+ 
+ 
+ Implemented using ibeta_derivative(a, b, x).
+ 
+ </td>
+</tr>
+<tr>
+<td>
+ 
+ cdf
+ 
+ </td>
+<td>
+ 
+ Using the incomplete beta function ibeta(a, b, x)
+ 
+ </td>
+</tr>
+<tr>
+<td>
+ 
+ cdf complement
+ 
+ </td>
+<td>
+ 
+ ibetac(a, b, x)
+ 
+ </td>
+</tr>
+<tr>
+<td>
+ 
+ quantile
+ 
+ </td>
+<td>
+ 
+ Using the inverse incomplete beta function ibeta_inv(a, b, p)
+ 
+ </td>
+</tr>
+<tr>
+<td>
+ 
+ quantile from the complement
+ 
+ </td>
+<td>
+ 
+ ibetac_inv(a, b, q)
+ 
+ </td>
+</tr>
+<tr>
+<td>
+ 
+ mean
+ 
+ </td>
+<td>
+ 
+ <code class="computeroutput">a/(a+b)</code>
+ 
+ </td>
+</tr>
+<tr>
+<td>
+ 
+ variance
+ 
+ </td>
+<td>
+ 
+ <code class="computeroutput">a *
+ b /
+ (a+b)^2 * (a + b + 1)</code>
+ 
+ </td>
+</tr>
+<tr>
+<td>
+ 
+ mode
+ 
+ </td>
+<td>
+ 
+ <code class="computeroutput">(a-1)
+ / (a + b + 2)</code>
+ 
+ </td>
+</tr>
+<tr>
+<td>
+ 
+ skewness
+ 
+ </td>
+<td>
+ 
+ <code class="computeroutput">2 (b-a) sqrt(a+b+1)/(a+b+2) *
+ sqrt(a * b)</code>
+ 
+ </td>
+</tr>
+<tr>
+<td>
+ 
+ kurtosis excess
+ 
+ </td>
+<td>
+ 
+ <img src="../images/beta_dist_kurtosis.png" alt="beta_dist_kurtosis">
+ 
+ </td>
+</tr>
+<tr>
+<td>
+ 
+ kurtosis
+ 
+ </td>
+<td>
+ 
+ <code class="computeroutput">kurtosis +
+ 3</code>
+ 
+ </td>
+</tr>
+<tr>
+<td>
+ 
+ parameter estimation
+ 
+ </td>
+<td>
+ 
+ 
+ </td>
+</tr>
+<tr>
+<td>
+ 
+ alpha
+ 
+ 
+ from mean and variance
+ 
+ </td>
+<td>
+ 
+ <code class="computeroutput">mean *
+ (( (mean *
+ (1
+ - mean)) / variance)-
+ 1)</code>
+ 
+ </td>
+</tr>
+<tr>
+<td>
+ 
+ beta
+ 
+ 
+ from mean and variance
+ 
+ </td>
+<td>
+ 
+ <code class="computeroutput">(1
+ - mean) * (((mean
+ * (1 - mean))
+ /variance)-1)</code>
+ 
+ </td>
+</tr>
+<tr>
+<td>
+ 
+ The member functions <code class="computeroutput">estimate_alpha</code>
+ and <code class="computeroutput">estimate_beta</code>
+ 
+ 
+ from cdf and probability x
+ 
+ 
+ and either <code class="computeroutput">alpha</code>
+ or <code class="computeroutput">beta</code>
+ 
+ </td>
+<td>
+ 
+ Implemented in terms of the inverse incomplete beta functions
+ 
+ 
+ ibeta_inva, and ibeta_invb respectively.
+ 
+ </td>
+</tr>
+<tr>
+<td>
+ 
+ <code class="computeroutput">estimate_alpha</code>
+ 
+ </td>
+<td>
+ 
+ <code class="computeroutput">ibeta_inva(beta, x, probability)</code>
+ 
+ </td>
+</tr>
+<tr>
+<td>
+ 
+ <code class="computeroutput">estimate_beta</code>
+ 
+ </td>
+<td>
+ 
+ <code class="computeroutput">ibeta_invb(alpha,
+ x,
+ probability)</code>
+ 
+ </td>
+</tr>
+</tbody>
+</table></div>
+</div>
+ 
+</div>
+</div>
+<table xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" width="100%"><tr>
+<td align="left"></td>
+<td align="right"><div class="copyright-footer">Copyright © 2007 John Maddock, Joel de Guzman, Eric Niebler and Matias
+ Capeletto
+ 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)
+ 
+</div></td>
+</tr></table>
+<hr>
+<div class="spirit-nav">
+<a accesskey="p" href="blurbs.html"><img src="../../../../doc/html/images/prev.png" alt="Prev"></a><a accesskey="u" href="../index.html"><img src="../../../../doc/html/images/up.png" alt="Up"></a><a accesskey="h" href="../index.html"><img src="../../../../doc/html/images/home.png" alt="Home"></a><a accesskey="n" href="images.html"><img src="../../../../doc/html/images/next.png" alt="Next"></a>
+</div>
+</body>
+</html>

Added: trunk/doc/test/gold/document_to_test_formatting/remez.html
==============================================================================
--- (empty file)
+++ trunk/doc/test/gold/document_to_test_formatting/remez.html 2008-12-09 07:11:12 EST (Tue, 09 Dec 2008)
@@ -0,0 +1,535 @@
+<html>
+<head>
+<meta http-equiv="Content-Type" content="text/html; charset=ISO-8859-1">
+<title>Sample Article (The Remez Method)</title>
+<link rel="stylesheet" href="../../../../doc/html/boostbook.css" type="text/css">
+<meta name="generator" content="DocBook XSL Stylesheets Vsnapshot_8125">
+<link rel="home" href="../index.html" title="Document To Test Formatting">
+<link rel="up" href="../index.html" title="Document To Test Formatting">
+<link rel="prev" href="test.html" title="test HTML4 symbols">
+<link rel="next" href="array.html" title="Array Example Boostbook XML Documentation">
+</head>
+<body bgcolor="white" text="black" link="#0000FF" vlink="#840084" alink="#0000FF">
+<table cellpadding="2" width="100%"><tr>
+<td valign="top"><img alt="Boost C++ Libraries" width="277" height="86" src="../../../../boost.png"></td>
+<td align="center">Home</td>
+<td align="center">Libraries</td>
+<td align="center">People</td>
+<td align="center">FAQ</td>
+<td align="center">More</td>
+</tr></table>
+<hr>
+<div class="spirit-nav">
+<a accesskey="p" href="test.html"><img src="../../../../doc/html/images/prev.png" alt="Prev"></a><a accesskey="u" href="../index.html"><img src="../../../../doc/html/images/up.png" alt="Up"></a><a accesskey="h" href="../index.html"><img src="../../../../doc/html/images/home.png" alt="Home"></a><a accesskey="n" href="array.html"><img src="../../../../doc/html/images/next.png" alt="Next"></a>
+</div>
+<div class="section" lang="en">
+<div class="titlepage"><div><div><h2 class="title" style="clear: both">
+<a name="document_to_test_formatting.remez"></a><a class="link" href="remez.html" title="Sample Article (The Remez Method)"> Sample Article (The
+ Remez Method)</a>
+</h2></div></div></div>
+
+ The Remez algorithm
+ is a methodology for locating the minimax rational approximation to a function.
+ This short article gives a brief overview of the method, but it should not
+ be regarded as a thorough theoretical treatment, for that you should consult
+ your favorite textbook.
+ 
+
+ Imagine that you want to approximate some function f(x) by way of a rational
+ function R(x), where R(x) may be either a polynomial P(x) or a ratio of two
+ polynomials P(x)/Q(x) (a rational function). Initially we'll concentrate on
+ the polynomial case, as it's by far the easier to deal with, later we'll extend
+ to the full rational function case.
+ 
+
+ We want to find the "best" rational approximation, where "best"
+ is defined to be the approximation that has the least deviation from f(x).
+ We can measure the deviation by way of an error function:
+ 
+
+ Eabs(x) = f(x) - R(x)
+ 
+
+ which is expressed in terms of absolute error, but we can equally use relative
+ error:
+ 
+
+ Erel(x) = (f(x) - R(x)) / |f(x)|
+ 
+
+ And indeed in general we can scale the error function in any way we want, it
+ makes no difference to the maths, although the two forms above cover almost
+ every practical case that you're likely to encounter.
+ 
+
+ The minimax rational function R(x) is then defined to be the function that
+ yields the smallest maximal value of the error function. Chebyshev showed that
+ there is a unique minimax solution for R(x) that has the following properties:
+ 
+<div class="itemizedlist"><ul type="disc">
+<li>
+ If R(x) is a polynomial of degree N, then there are N+2 unknowns: the N+1
+ coefficients of the polynomial, and maximal value of the error function.
+ </li>
+<li>
+ The error function has N+1 roots, and N+2 extrema (minima and maxima).
+ </li>
+<li>
+ The extrema alternate in sign, and all have the same magnitude.
+ </li>
+</ul></div>
+
+ That means that if we know the location of the extrema of the error function
+ then we can write N+2 simultaneous equations:
+ 
+
+ R(xi) + (-1)iE = f(xi)
+ 
+
+ where E is the maximal error term, and xi are the abscissa values of the N+2
+ extrema of the error function. It is then trivial to solve the simultaneous
+ equations to obtain the polynomial coefficients and the error term.
+ 
+
+ Unfortunately we don't know where the extrema of the error function
+ are located!
+ 
+<a name="document_to_test_formatting.remez.the_remez_method"></a><h5>
+<a name="id539430"></a>
+ <a class="link" href="remez.html#document_to_test_formatting.remez.the_remez_method">The Remez
+ Method</a>
+ </h5>
+
+ The Remez method is an iterative technique which, given a broad range of assumptions,
+ will converge on the extrema of the error function, and therefore the minimax
+ solution.
+ 
+
+ In the following discussion we'll use a concrete example to illustrate the
+ Remez method: an approximation to the function ex over the range [-1, 1].
+ 
+
+ Before we can begin the Remez method, we must obtain an initial value for the
+ location of the extrema of the error function. We could "guess" these,
+ but a much closer first approximation can be obtained by first constructing
+ an interpolated polynomial approximation to f(x).
+ 
+
+ In order to obtain the N+1 coefficients of the interpolated polynomial we need
+ N+1 points (x0...xN): with our interpolated form passing through each of those
+ points that yields N+1 simultaneous equations:
+ 
+
+ f(xi) = P(xi) = c0 + c1xi ... + cNxiN
+ 
+
+ Which can be solved for the coefficients c0...cN in P(x).
+ 
+
+ Obviously this is not a minimax solution, indeed our only guarantee is that
+ f(x) and P(x) touch at N+1 locations, away from those points the error may
+ be arbitrarily large. However, we would clearly like this initial approximation
+ to be as close to f(x) as possible, and it turns out that using the zeros of
+ an orthogonal polynomial as the initial interpolation points is a good choice.
+ In our example we'll use the zeros of a Chebyshev polynomial as these are particularly
+ easy to calculate, interpolating for a polynomial of degree 4, and measuring
+ relative error we get the following error function:
+ 
+
+ <img src="../images/remez-2.png" alt="remez-2">
+ 
+
+ Which has a peak relative error of 1.2x10-3.
+ 
+
+ While this is a pretty good approximation already, judging by the shape of
+ the error function we can clearly do better. Before starting on the Remez method
+ propper, we have one more step to perform: locate all the extrema of the error
+ function, and store these locations as our initial Chebyshev control
+ points.
+ 
+<div class="note"><table border="0" summary="Note">
+<tr>
+<td rowspan="2" align="center" valign="top" width="25"><img alt="[Note]" src="../../../../doc/html/images/note.png"></td>
+<th align="left">Note</th>
+</tr>
+<tr><td align="left" valign="top">
+
+ In the simple case of a polynomial approximation, by interpolating through
+ the roots of a Chebyshev polynomial we have in fact created a Chebyshev
+ approximation to the function: in terms of absolute
+ error this is the best a priori choice for the interpolated form
+ we can achieve, and typically is very close to the minimax solution.
+ 
+
+ However, if we want to optimise for relative error,
+ or if the approximation is a rational function, then the initial Chebyshev
+ solution can be quite far from the ideal minimax solution.
+ 
+
+ A more technical discussion of the theory involved can be found in this
+ <a href="http://math.fullerton.edu/mathews/n2003/ChebyshevPolyMod.html" target="_top">online
+ course</a>.
+ 
+</td></tr>
+</table></div>
+<a name="document_to_test_formatting.remez.remez_step_1"></a><h5>
+<a name="id539638"></a>
+ <a class="link" href="remez.html#document_to_test_formatting.remez.remez_step_1">Remez Step 1</a>
+ </h5>
+
+ The first step in the Remez method, given our current set of N+2 Chebyshev
+ control points xi, is to solve the N+2 simultaneous equations:
+ 
+
+ P(xi) + (-1)iE = f(xi)
+ 
+
+ To obtain the error term E, and the coefficients of the polynomial P(x).
+ 
+
+ This gives us a new approximation to f(x) that has the same error E
+ at each of the control points, and whose error function alternates
+ in sign at the control points. This is still not necessarily the
+ minimax solution though: since the control points may not be at the extrema
+ of the error function. After this first step here's what our approximation's
+ error function looks like:
+ 
+
+ <img src="../images/remez-3.png" alt="remez-3">
+ 
+
+ Clearly this is still not the minimax solution since the control points are
+ not located at the extrema, but the maximum relative error has now dropped
+ to 5.6x10-4.
+ 
+<a name="document_to_test_formatting.remez.remez_step_2"></a><h5>
+<a name="id539738"></a>
+ <a class="link" href="remez.html#document_to_test_formatting.remez.remez_step_2">Remez Step 2</a>
+ </h5>
+
+ The second step is to locate the extrema of the new approximation, which we
+ do in two stages: first, since the error function changes sign at each control
+ point, we must have N+1 roots of the error function located between each pair
+ of N+2 control points. Once these roots are found by standard root finding
+ techniques, we know that N extrema are bracketed between each pair of roots,
+ plus two more between the endpoints of the range and the first and last roots.
+ The N+2 extrema can then be found using standard function minimisation techniques.
+ 
+
+ We now have a choice: multi-point exchange, or single point exchange.
+ 
+
+ In single point exchange, we move the control point nearest to the largest
+ extrema to the absissa value of the extrema.
+ 
+
+ In multi-point exchange we swap all the current control points, for the locations
+ of the extrema.
+ 
+
+ In our example we perform multi-point exchange.
+ 
+<a name="document_to_test_formatting.remez.iteration"></a><h5>
+<a name="id539786"></a>
+ <a class="link" href="remez.html#document_to_test_formatting.remez.iteration">Iteration</a>
+ </h5>
+
+ The Remez method then performs steps 1 and 2 above iteratively until the control
+ points are located at the extrema of the error function: this is then the minimax
+ solution.
+ 
+
+ For our current example, two more iterations converges on a minimax solution
+ with a peak relative error of 5x10-4 and an error function that looks like:
+ 
+
+ <img src="../images/remez-4.png" alt="remez-4">
+ 
+<a name="document_to_test_formatting.remez.rational_approximations"></a><h5>
+<a name="id539846"></a>
+ <a class="link" href="remez.html#document_to_test_formatting.remez.rational_approximations">Rational
+ Approximations</a>
+ </h5>
+
+ If we wish to extend the Remez method to a rational approximation of the form
+ 
+
+ f(x) = R(x) = P(x) / Q(x)
+ 
+
+ where P(x) and Q(x) are polynomials, then we proceed as before, except that
+ now we have N+M+2 unknowns if P(x) is of order N and Q(x) is of order M. This
+ assumes that Q(x) is normalised so that it's leading coefficient is 1, giving
+ N+M+1 polynomial coefficients in total, plus the error term E.
+ 
+
+ The simultaneous equations to be solved are now:
+ 
+
+ P(xi) / Q(xi) + (-1)iE = f(xi)
+ 
+
+ Evaluated at the N+M+2 control points xi.
+ 
+
+ Unfortunately these equations are non-linear in the error term E: we can only
+ solve them if we know E, and yet E is one of the unknowns!
+ 
+
+ The method usually adopted to solve these equations is an iterative one: we
+ guess the value of E, solve the equations to obtain a new value for E (as well
+ as the polynomial coefficients), then use the new value of E as the next guess.
+ The method is repeated until E converges on a stable value.
+ 
+
+ These complications extend the running time required for the development of
+ rational approximations quite considerably. It is often desirable to obtain
+ a rational rather than polynomial approximation none the less: rational approximations
+ will often match more difficult to approximate functions, to greater accuracy,
+ and with greater efficiency, than their polynomial alternatives. For example,
+ if we takes our previous example of an approximation to ex, we obtained 5x10-4 accuracy
+ with an order 4 polynomial. If we move two of the unknowns into the denominator
+ to give a pair of order 2 polynomials, and re-minimise, then the peak relative
+ error drops to 8.7x10-5. That's a 5 fold increase in accuracy, for the same
+ number of terms overall.
+ 
+<a name="document_to_test_formatting.remez.practical_considerations"></a><h5>
+<a name="id539957"></a>
+ <a class="link" href="remez.html#document_to_test_formatting.remez.practical_considerations">Practical
+ Considerations</a>
+ </h5>
+
+ Most treatises on approximation theory stop at this point. However, from a
+ practical point of view, most of the work involves finding the right approximating
+ form, and then persuading the Remez method to converge on a solution.
+ 
+
+ So far we have used a direct approximation:
+ 
+
+ f(x) = R(x)
+ 
+
+ But this will converge to a useful approximation only if f(x) is smooth. In
+ addition round-off errors when evaluating the rational form mean that this
+ will never get closer than within a few epsilon of machine precision. Therefore
+ this form of direct approximation is often reserved for situations where we
+ want efficiency, rather than accuracy.
+ 
+
+ The first step in improving the situation is generally to split f(x) into a
+ dominant part that we can compute accurately by another method, and a slowly
+ changing remainder which can be approximated by a rational approximation. We
+ might be tempted to write:
+ 
+
+ f(x) = g(x) + R(x)
+ 
+
+ where g(x) is the dominant part of f(x), but if f(x)/g(x) is approximately
+ constant over the interval of interest then:
+ 
+
+ f(x) = g(x)(c + R(x))
+ 
+
+ Will yield a much better solution: here c is a constant
+ that is the approximate value of f(x)/g(x) and R(x) is typically tiny compared
+ to c. In this situation if R(x) is optimised for absolute
+ error, then as long as its error is small compared to the constant c,
+ that error will effectively get wiped out when R(x) is added to c.
+ 
+
+ The difficult part is obviously finding the right g(x) to extract from your
+ function: often the asymptotic behaviour of the function will give a clue,
+ so for example the function __erfc becomes proportional to e-x2/x as x becomes
+ large. Therefore using:
+ 
+
+ erfc(z) = (C + R(x)) e-x2/x
+ 
+
+ as the approximating form seems like an obvious thing to try, and does indeed
+ yield a useful approximation.
+ 
+
+ However, the difficulty then becomes one of converging the minimax solution.
+ Unfortunately, it is known that for some functions the Remez method can lead
+ to divergent behaviour, even when the initial starting approximation is quite
+ good. Furthermore, it is not uncommon for the solution obtained in the first
+ Remez step above to be a bad one: the equations to be solved are generally
+ "stiff", often very close to being singular, and assuming a solution
+ is found at all, round-off errors and a rapidly changing error function, can
+ lead to a situation where the error function does not in fact change sign at
+ each control point as required. If this occurs, it is fatal to the Remez method.
+ It is also possible to obtain solutions that are perfectly valid mathematically,
+ but which are quite useless computationally: either because there is an unavoidable
+ amount of roundoff error in the computation of the rational function, or because
+ the denominator has one or more roots over the interval of the approximation.
+ In the latter case while the approximation may have the correct limiting value
+ at the roots, the approximation is nonetheless useless.
+ 
+
+ Assuming that the approximation does not have any fatal errors, and that the
+ only issue is converging adequately on the minimax solution, the aim is to
+ get as close as possible to the minimax solution before beginning the Remez
+ method. Using the zeros of a Chebyshev polynomial for the initial interpolation
+ is a good start, but may not be ideal when dealing with relative errors and/or
+ rational (rather than polynomial) approximations. One approach is to skew the
+ initial interpolation points to one end: for example if we raise the roots
+ of the Chebyshev polynomial to a positive power greater than 1 then the roots
+ will be skewed towards the middle of the [-1,1] interval, while a positive
+ power less than one will skew them towards either end. More usefully, if we
+ initially rescale the points over [0,1] and then raise to a positive power,
+ we can skew them to the left or right. Returning to our example of ex over [-1,1],
+ the initial interpolated form was some way from the minimax solution:
+ 
+
+ <img src="../images/remez-2.png" alt="remez-2">
+ 
+
+ However, if we first skew the interpolation points to the left (rescale them
+ to [0, 1], raise to the power 1.3, and then rescale back to [-1,1]) we reduce
+ the error from 1.3x10-3to 6x10-4:
+ 
+
+ <img src="../images/remez-5.png" alt="remez-5">
+ 
+
+ It's clearly still not ideal, but it is only a few percent away from our desired
+ minimax solution (5x10-4).
+ 
+<a name="document_to_test_formatting.remez.remez_method_checklist"></a><h5>
+<a name="id540203"></a>
+ <a class="link" href="remez.html#document_to_test_formatting.remez.remez_method_checklist">Remez
+ Method Checklist</a>
+ </h5>
+
+ The following lists some of the things to check if the Remez method goes wrong,
+ it is by no means an exhaustive list, but is provided in the hopes that it
+ will prove useful.
+ 
+<div class="itemizedlist"><ul type="disc">
+<li>
+ Is the function smooth enough? Can it be better separated into a rapidly
+ changing part, and an asymptotic part?
+ </li>
+<li>
+ Does the function being approximated have any "blips" in it? Check
+ for problems as the function changes computation method, or if a root, or
+ an infinity has been divided out. The telltale sign is if there is a narrow
+ region where the Remez method will not converge.
+ </li>
+<li>
+ Check you have enough accuracy in your calculations: remember that the Remez
+ method works on the difference between the approximation and the function
+ being approximated: so you must have more digits of precision available than
+ the precision of the approximation being constructed. So for example at double
+ precision, you shouldn't expect to be able to get better than a float precision
+ approximation.
+ </li>
+<li>
+ Try skewing the initial interpolated approximation to minimise the error
+ before you begin the Remez steps.
+ </li>
+<li>
+ If the approximation won't converge or is ill-conditioned from one starting
+ location, try starting from a different location.
+ </li>
+<li>
+ If a rational function won't converge, one can minimise a polynomial (which
+ presents no problems), then rotate one term from the numerator to the denominator
+ and minimise again. In theory one can continue moving terms one at a time
+ from numerator to denominator, and then re-minimising, retaining the last
+ set of control points at each stage.
+ </li>
+<li>
+ Try using a smaller interval. It may also be possible to optimise over one
+ (small) interval, rescale the control points over a larger interval, and
+ then re-minimise.
+ </li>
+<li>
+ Keep absissa values small: use a change of variable to keep the abscissa
+ over, say [0, b], for some smallish value b.
+ </li>
+</ul></div>
+<a name="document_to_test_formatting.remez.references"></a><h5>
+<a name="id540285"></a>
+ <a class="link" href="remez.html#document_to_test_formatting.remez.references">References</a>
+ </h5>
+
+ The original references for the Remez Method and it's extension to rational
+ functions are unfortunately in Russian:
+ 
+
+ Remez, E.Ya., Fundamentals of numerical methods for Chebyshev approximations,
+ "Naukova Dumka", Kiev, 1969.
+ 
+
+ Remez, E.Ya., Gavrilyuk, V.T., Computer development of certain approaches
+ to the approximate construction of solutions of Chebyshev problems nonlinearly
+ depending on parameters, Ukr. Mat. Zh. 12 (1960), 324-338.
+ 
+
+ Gavrilyuk, V.T., Generalization of the first polynomial algorithm
+ of E.Ya.Remez for the problem of constructing rational-fractional Chebyshev
+ approximations, Ukr. Mat. Zh. 16 (1961), 575-585.
+ 
+
+ Some English language sources include:
+ 
+
+ Fraser, W., Hart, J.F., On the computation of rational approximations
+ to continuous functions, Comm. of the ACM 5 (1962), 401-403, 414.
+ 
+
+ Ralston, A., Rational Chebyshev approximation by Remes' algorithms,
+ Numer.Math. 7 (1965), no. 4, 322-330.
+ 
+
+ A. Ralston, Rational Chebyshev approximation, Mathematical Methods
+ for Digital Computers v. 2 (Ralston A., Wilf H., eds.), Wiley, New
+ York, 1967, pp. 264-284.
+ 
+
+ Hart, J.F. e.a., Computer approximations, Wiley, New York
+ a.o., 1968.
+ 
+
+ Cody, W.J., Fraser, W., Hart, J.F., Rational Chebyshev approximation
+ using linear equations, Numer.Math. 12 (1968), 242-251.
+ 
+
+ Cody, W.J., A survey of practical rational and polynomial approximation
+ of functions, SIAM Review 12 (1970), no. 3, 400-423.
+ 
+
+ Barrar, R.B., Loeb, H.J., On the Remez algorithm for non-linear families,
+ Numer.Math. 15 (1970), 382-391.
+ 
+
+ Dunham, Ch.B., Convergence of the Fraser-Hart algorithm for rational
+ Chebyshev approximation, Math. Comp. 29 (1975), no. 132, 1078-1082.
+ 
+
+ G. L. Litvinov, Approximate construction of rational approximations
+ and the effect of error autocorrection, Russian Journal of Mathematical
+ Physics, vol.1, No. 3, 1994.
+ 
+</div>
+<table xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" width="100%"><tr>
+<td align="left"></td>
+<td align="right"><div class="copyright-footer">Copyright © 2007 John Maddock, Joel de Guzman, Eric Niebler and Matias
+ Capeletto
+ 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)
+ 
+</div></td>
+</tr></table>
+<hr>
+<div class="spirit-nav">
+<a accesskey="p" href="test.html"><img src="../../../../doc/html/images/prev.png" alt="Prev"></a><a accesskey="u" href="../index.html"><img src="../../../../doc/html/images/up.png" alt="Up"></a><a accesskey="h" href="../index.html"><img src="../../../../doc/html/images/home.png" alt="Home"></a><a accesskey="n" href="array.html"><img src="../../../../doc/html/images/next.png" alt="Next"></a>
+</div>
+</body>
+</html>

Added: trunk/doc/test/gold/document_to_test_formatting/test.html
==============================================================================
--- (empty file)
+++ trunk/doc/test/gold/document_to_test_formatting/test.html 2008-12-09 07:11:12 EST (Tue, 09 Dec 2008)
@@ -0,0 +1,73 @@
+<html>
+<head>
+<meta http-equiv="Content-Type" content="text/html; charset=ISO-8859-1">
+<title>test HTML4 symbols</title>
+<link rel="stylesheet" href="../../../../doc/html/boostbook.css" type="text/css">
+<meta name="generator" content="DocBook XSL Stylesheets Vsnapshot_8125">
+<link rel="home" href="../index.html" title="Document To Test Formatting">
+<link rel="up" href="../index.html" title="Document To Test Formatting">
+<link rel="prev" href="images.html" title="Images">
+<link rel="next" href="remez.html" title="Sample Article (The Remez Method)">
+</head>
+<body bgcolor="white" text="black" link="#0000FF" vlink="#840084" alink="#0000FF">
+<table cellpadding="2" width="100%"><tr>
+<td valign="top"><img alt="Boost C++ Libraries" width="277" height="86" src="../../../../boost.png"></td>
+<td align="center">Home</td>
+<td align="center">Libraries</td>
+<td align="center">People</td>
+<td align="center">FAQ</td>
+<td align="center">More</td>
+</tr></table>
+<hr>
+<div class="spirit-nav">
+<a accesskey="p" href="images.html"><img src="../../../../doc/html/images/prev.png" alt="Prev"></a><a accesskey="u" href="../index.html"><img src="../../../../doc/html/images/up.png" alt="Up"></a><a accesskey="h" href="../index.html"><img src="../../../../doc/html/images/home.png" alt="Home"></a><a accesskey="n" href="remez.html"><img src="../../../../doc/html/images/next.png" alt="Next"></a>
+</div>
+<div class="section" lang="en">
+<div class="titlepage"><div><div><h2 class="title" style="clear: both">
+<a name="document_to_test_formatting.test"></a><a class="link" href="test.html" title="test HTML4 symbols"> test HTML4 symbols</a>
+</h2></div></div></div>
+<div class="toc"><dl>
+<dt><a href="test.html#document_to_test_formatting.test.test_greek_and_math_symbols">test
+ Greek and Math symbols</a></dt>
+<dt><a href="test.html#document_to_test_formatting.test.test_latin1_symbols">test
+ Latin1 symbols</a></dt>
+</dl></div>
+<div class="section" lang="en">
+<div class="titlepage"><div><div><h3 class="title">
+<a name="document_to_test_formatting.test.test_greek_and_math_symbols"></a><a class="link" href="test.html#document_to_test_formatting.test.test_greek_and_math_symbols" title="test Greek and Math symbols">test
+ Greek and Math symbols</a>
+</h3></div></div></div>
+
+ ƒ, Α, Β, Γ, Δ, Ε, Ζ, Η, Θ, Ι, Κ, Λ, Μ, Ν, Ξ, Ο, Π, Ρ, Σ, Τ, Υ, Φ, Χ, Ψ, Ω, α, β, γ, δ, ε, ζ, η, θ, ι, κ, λ, μ,
+ ν, ξ, ο, π, ρ, ς, σ, τ, υ, φ, χ, ψ, ω, ϑ, ϒ, ϖ, •, …, ′, ″, ‾, ⁄, ℘, ℑ, ℜ, ™, ℵ, ←, ↑, →, ↓, ↔, ↵, ⇐, ⇑, ⇒, ⇓,
+ ⇔, ∀, ∂, ∃, ∅, ∇, ∈, ∉, ∋, ∏, ∑, −, ∗, √, ∝, ∞, ∠, ∧, ∨, ∩, ∪, ∫, ∴, ∼, ≅, ≈, ≠, ≡, ≤, ≥, ⊂, ⊃, ⊄, ⊆, ⊇, ⊕, ⊗,
+ ⊥, ⋅, ⌈, ⌉, ⌊, ⌋, 〈, 〉, ◊, ♠, ♣, ♥, ♦
+ 
+</div>
+<div class="section" lang="en">
+<div class="titlepage"><div><div><h3 class="title">
+<a name="document_to_test_formatting.test.test_latin1_symbols"></a><a class="link" href="test.html#document_to_test_formatting.test.test_latin1_symbols" title="test Latin1 symbols">test
+ Latin1 symbols</a>
+</h3></div></div></div>
+
+ , ¡, ¢, £, ¤, ¥, ¦, §, ¨, ©, ª, «, ¬, , ®, ¯, °, ±, ², ³, ´, µ, ¶, ·, ¸, ¹, º, », ¼, ½, ¾, ¿, À, Á, Â, Ã, Ä,
+ Å, Æ, Ç, È, É, Ê, Ë, Ì, Í, Î, Ï, Ð, Ñ, Ò, Ó, Ô, Õ, Ö, ×, Ø, Ù, Ú, Û, Ü, Ý, Þ, ß, à, á, â, ã, ä, å, æ, ç, è, é,
+ ê, ë, ì, í, î, ï, ð, ñ, ò, ó, ô, õ, ö, ÷, ø, ù, ú, û, ü, ý, þ, ÿ,
+ 
+</div>
+</div>
+<table xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" width="100%"><tr>
+<td align="left"></td>
+<td align="right"><div class="copyright-footer">Copyright © 2007 John Maddock, Joel de Guzman, Eric Niebler and Matias
+ Capeletto
+ 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)
+ 
+</div></td>
+</tr></table>
+<hr>
+<div class="spirit-nav">
+<a accesskey="p" href="images.html"><img src="../../../../doc/html/images/prev.png" alt="Prev"></a><a accesskey="u" href="../index.html"><img src="../../../../doc/html/images/up.png" alt="Up"></a><a accesskey="h" href="../index.html"><img src="../../../../doc/html/images/home.png" alt="Home"></a><a accesskey="n" href="remez.html"><img src="../../../../doc/html/images/next.png" alt="Next"></a>
+</div>
+</body>
+</html>

Added: trunk/doc/test/gold/images/accumulators/doxygen.png
==============================================================================
Binary file. No diff available.

Added: trunk/doc/test/gold/images/accumulators/form_0.png
==============================================================================
Binary file. No diff available.

Added: trunk/doc/test/gold/images/accumulators/form_1.png
==============================================================================
Binary file. No diff available.

Added: trunk/doc/test/gold/images/accumulators/form_2.png
==============================================================================
Binary file. No diff available.

Added: trunk/doc/test/gold/images/accumulators/form_3.png
==============================================================================
Binary file. No diff available.

Added: trunk/doc/test/gold/images/accumulators/form_4.png
==============================================================================
Binary file. No diff available.

Added: trunk/doc/test/gold/images/accumulators/form_5.png
==============================================================================
Binary file. No diff available.

Added: trunk/doc/test/gold/images/accumulators/form_6.png
==============================================================================
Binary file. No diff available.

Added: trunk/doc/test/gold/images/accumulators/form_7.png
==============================================================================
Binary file. No diff available.

Added: trunk/doc/test/gold/images/accumulators/form_8.png
==============================================================================
Binary file. No diff available.

Added: trunk/doc/test/gold/index.html
==============================================================================
--- (empty file)
+++ trunk/doc/test/gold/index.html 2008-12-09 07:11:12 EST (Tue, 09 Dec 2008)
@@ -0,0 +1,149 @@
+<html>
+<head>
+<meta http-equiv="Content-Type" content="text/html; charset=ISO-8859-1">
+<title>Document To Test Formatting</title>
+<link rel="stylesheet" href="../../../doc/html/boostbook.css" type="text/css">
+<meta name="generator" content="DocBook XSL Stylesheets Vsnapshot_8125">
+<link rel="home" href="index.html" title="Document To Test Formatting">
+<link rel="next" href="document_to_test_formatting/code_blocks.html" title="Code Blocks">
+</head>
+<body bgcolor="white" text="black" link="#0000FF" vlink="#840084" alink="#0000FF">
+<table cellpadding="2" width="100%"><tr>
+<td valign="top"><img alt="Boost C++ Libraries" width="277" height="86" src="../../../boost.png"></td>
+<td align="center">Home</td>
+<td align="center">Libraries</td>
+<td align="center">People</td>
+<td align="center">FAQ</td>
+<td align="center">More</td>
+</tr></table>
+<hr>
+<div class="spirit-nav"><a accesskey="n" href="document_to_test_formatting/code_blocks.html"><img src="../../../doc/html/images/next.png" alt="Next"></a></div>
+<div class="article" lang="en">
+<div class="titlepage">
+<div>
+<div><h2 class="title">
+<a name="document_to_test_formatting"></a>Document To Test Formatting</h2></div>
+<div><div class="authorgroup">
+<div class="author"><h3 class="author">
+John Maddock
+</h3></div>
+<div class="author"><h3 class="author">
+Joel de Guzman
+</h3></div>
+<div class="author"><h3 class="author">
+Eric Niebler
+</h3></div>
+<div class="author"><h3 class="author">
+Matias Capeletto
+</h3></div>
+</div></div>
+<div>Copyright © 2007 John Maddock, Joel de Guzman, Eric Niebler and Matias
+ Capeletto</div>
+<div><div class="legalnotice">
+<a name="id473217"></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)
+ 
+</div></div>
+</div>
+<hr>
+</div>
+<div class="toc">
+Table of Contents
+<dl>
+<dt>Introduction</dt>
+<dt>Code Blocks</dt>
+<dd><dl>
+<dt><a href="document_to_test_formatting/code_blocks.html#document_to_test_formatting.code_blocks.embedded_code">Embedded
+ code</a></dt>
+<dt><a href="document_to_test_formatting/code_blocks.html#document_to_test_formatting.code_blocks.imported_code_and_callouts">Imported
+ code and callouts</a></dt>
+<dt><a href="document_to_test_formatting/code_blocks.html#document_to_test_formatting.code_blocks.larger_example">Larger
+ example</a></dt>
+</dl></dd>
+<dt>Basic Formatting</dt>
+<dd><dl>
+<dt><a href="document_to_test_formatting/basic_formatting.html#document_to_test_formatting.basic_formatting.font_styles">Font
+ Styles</a></dt>
+<dt><a href="document_to_test_formatting/basic_formatting.html#document_to_test_formatting.basic_formatting.replaceable_text">Replaceable
+ Text</a></dt>
+<dt>Quotations</dt>
+<dt><a href="document_to_test_formatting/basic_formatting.html#document_to_test_formatting.basic_formatting.inline_code">Inline
+ Code</a></dt>
+<dt>Links</dt>
+<dt>Footnotes</dt>
+<dt>Blockquote</dt>
+<dt>Headings</dt>
+</dl></dd>
+<dt>Blurbs</dt>
+<dd><dl>
+<dt><a href="document_to_test_formatting/blurbs.html#document_to_test_formatting.blurbs.preformatted_text">Preformatted
+ text</a></dt>
+<dt>Admonishments</dt>
+<dt>Blurbs</dt>
+</dl></dd>
+<dt><a href="document_to_test_formatting/lists_and_tables.html">Lists and
+ Tables</a></dt>
+<dd><dl>
+<dt>Lists</dt>
+<dt><a href="document_to_test_formatting/lists_and_tables.html#document_to_test_formatting.lists_and_tables.variable_lists">Variable
+ Lists</a></dt>
+<dt>Tables</dt>
+</dl></dd>
+<dt>Images</dt>
+<dt> test HTML4 symbols</dt>
+<dd><dl>
+<dt><a href="document_to_test_formatting/test.html#document_to_test_formatting.test.test_greek_and_math_symbols">test
+ Greek and Math symbols</a></dt>
+<dt><a href="document_to_test_formatting/test.html#document_to_test_formatting.test.test_latin1_symbols">test
+ Latin1 symbols</a></dt>
+</dl></dd>
+<dt><a href="document_to_test_formatting/remez.html"> Sample Article (The
+ Remez Method)</a></dt>
+<dt><a href="document_to_test_formatting/array.html"> Array Example Boostbook
+ XML Documentation</a></dt>
+<dd><dl>
+<dt>Introduction</dt>
+<dt>Reference</dt>
+<dt>Design Rationale</dt>
+<dt>For more information...</dt>
+<dt>Acknowledgements</dt>
+</dl></dd>
+<dt><a href="document_to_test_formatting/accumulators.html"> Accumulators
+ Example Doxygen Documentation</a></dt>
+<dd><dl><dt>Statistics Library Reference</dt></dl></dd>
+</dl>
+</div>
+<div class="section" lang="en">
+<div class="titlepage"><div><div><h2 class="title" style="clear: both">
+<a name="document_to_test_formatting.introduction"></a><a class="link" href="index.html#document_to_test_formatting.introduction" title="Introduction">Introduction</a>
+</h2></div></div></div>
+
+ This document is purely a test case to test out HTML and PDF generation and
+ style.
+ 
+
+ This is some body text.
+ 
+<pre class="programlisting">int main()
+{
+ double d = 2.345;
+ return d;
+}
+</pre>
+
+ We can count in Greek too: α, β, γ.
+ 
+
+ Try some superscrips and subscripts: x2, xi3, α2, βα, ⌊x⌋, ⌊α⌋, ⌈a⌉.
+ 
+</div>
+</div>
+<table xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" width="100%"><tr>
+<td align="left">Last revised: December 09, 2008 at 12:07:46 GMT</td>
+<td align="right"><div class="copyright-footer"></div></td>
+</tr></table>
+<hr>
+<div class="spirit-nav"><a accesskey="n" href="document_to_test_formatting/code_blocks.html"><img src="../../../doc/html/images/next.png" alt="Next"></a></div>
+</body>
+</html>

Next message: daniel_james_at_[hidden]: "[Boost-commit] svn:boost r50222 - trunk/tools/boostbook/xsl"
Previous message: john_at_[hidden]: "[Boost-commit] svn:boost r50220 - in trunk/doc/test: . gold"

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