Boost-Commit :

Date view	Thread view	Subject view	Author view

Subject: [Boost-commit] svn:boost r83219 - in sandbox/contract/doc: . html html/bbv2 html/date_time html/hash html/images images pdf src src/images src/images/callouts test test/gold test/gold/boost test/gold/boost/accumulators test/gold/boost/accumulators/extract test/gold/boost/accumulators/impl test/gold/boost/accumulators/tag test/gold/document_to_test_formatting test/gold/images test/gold/images/accumulators test/html test/html/images
From: lorcaminiti_at_[hidden]
Date: 2013-02-28 18:35:11

Next message: lorcaminiti_at_[hidden]: "[Boost-commit] svn:boost r83220 - in sandbox/contract: . doc/pdf doc/test"
Previous message: lorcaminiti_at_[hidden]: "[Boost-commit] svn:boost r83218 - sandbox/contract"

Author: lcaminiti
Date: 2013-02-28 18:35:01 EST (Thu, 28 Feb 2013)
New Revision: 83219
URL: http://svn.boost.org/trac/boost/changeset/83219

Log:
Added doc/ as from trunk/doc/.
Added:
   sandbox/contract/doc/
   sandbox/contract/doc/Jamfile.v2 (contents, props changed)
   sandbox/contract/doc/html/
   sandbox/contract/doc/html/Assignable.html (contents, props changed)
   sandbox/contract/doc/html/CopyConstructible.html (contents, props changed)
   sandbox/contract/doc/html/accumulators.html (contents, props changed)
   sandbox/contract/doc/html/any.html (contents, props changed)
   sandbox/contract/doc/html/array.html (contents, props changed)
   sandbox/contract/doc/html/atomic.html (contents, props changed)
   sandbox/contract/doc/html/bbv2/
   sandbox/contract/doc/html/bbv2.html (contents, props changed)
   sandbox/contract/doc/html/bbv2/installation.html (contents, props changed)
   sandbox/contract/doc/html/boost_asio.html (contents, props changed)
   sandbox/contract/doc/html/boost_lexical_cast.html (contents, props changed)
   sandbox/contract/doc/html/boost_random.html (contents, props changed)
   sandbox/contract/doc/html/boost_staticassert.html (contents, props changed)
   sandbox/contract/doc/html/boost_tr1.html (contents, props changed)
   sandbox/contract/doc/html/boostbook.html (contents, props changed)
   sandbox/contract/doc/html/chrono.html (contents, props changed)
   sandbox/contract/doc/html/container.html (contents, props changed)
   sandbox/contract/doc/html/date_time/
   sandbox/contract/doc/html/date_time.html (contents, props changed)
   sandbox/contract/doc/html/date_time/date_time_io.html (contents, props changed)
   sandbox/contract/doc/html/date_time/details.html (contents, props changed)
   sandbox/contract/doc/html/date_time/local_time.html (contents, props changed)
   sandbox/contract/doc/html/foreach.html (contents, props changed)
   sandbox/contract/doc/html/function.html (contents, props changed)
   sandbox/contract/doc/html/hash/
   sandbox/contract/doc/html/hash.html (contents, props changed)
   sandbox/contract/doc/html/hash/custom.html (contents, props changed)
   sandbox/contract/doc/html/heap.html (contents, props changed)
   sandbox/contract/doc/html/images/
   sandbox/contract/doc/html/images/blank.png (contents, props changed)
   sandbox/contract/doc/html/images/caution.png (contents, props changed)
   sandbox/contract/doc/html/images/draft.png (contents, props changed)
   sandbox/contract/doc/html/images/home.png (contents, props changed)
   sandbox/contract/doc/html/images/important.png (contents, props changed)
   sandbox/contract/doc/html/images/next.png (contents, props changed)
   sandbox/contract/doc/html/images/next_disabled.png (contents, props changed)
   sandbox/contract/doc/html/images/note.png (contents, props changed)
   sandbox/contract/doc/html/images/prev.png (contents, props changed)
   sandbox/contract/doc/html/images/prev_disabled.png (contents, props changed)
   sandbox/contract/doc/html/images/tip.png (contents, props changed)
   sandbox/contract/doc/html/images/toc-blank.png (contents, props changed)
   sandbox/contract/doc/html/images/toc-minus.png (contents, props changed)
   sandbox/contract/doc/html/images/toc-plus.png (contents, props changed)
   sandbox/contract/doc/html/images/up.png (contents, props changed)
   sandbox/contract/doc/html/images/up_disabled.png (contents, props changed)
   sandbox/contract/doc/html/images/warning.png (contents, props changed)
   sandbox/contract/doc/html/interprocess.html (contents, props changed)
   sandbox/contract/doc/html/intrusive.html (contents, props changed)
   sandbox/contract/doc/html/lambda.html (contents, props changed)
   sandbox/contract/doc/html/lockfree.html (contents, props changed)
   sandbox/contract/doc/html/move.html (contents, props changed)
   sandbox/contract/doc/html/mpi.html (contents, props changed)
   sandbox/contract/doc/html/program_options.html (contents, props changed)
   sandbox/contract/doc/html/property_tree.html (contents, props changed)
   sandbox/contract/doc/html/proto.html (contents, props changed)
   sandbox/contract/doc/html/quickbook.html (contents, props changed)
   sandbox/contract/doc/html/ratio.html (contents, props changed)
   sandbox/contract/doc/html/ref.html (contents, props changed)
   sandbox/contract/doc/html/signals.html (contents, props changed)
   sandbox/contract/doc/html/signals2.html (contents, props changed)
   sandbox/contract/doc/html/string_algo.html (contents, props changed)
   sandbox/contract/doc/html/thread.html (contents, props changed)
   sandbox/contract/doc/html/tribool.html (contents, props changed)
   sandbox/contract/doc/html/typeof.html (contents, props changed)
   sandbox/contract/doc/html/unordered.html (contents, props changed)
   sandbox/contract/doc/html/variant.html (contents, props changed)
   sandbox/contract/doc/html/xpressive.html (contents, props changed)
   sandbox/contract/doc/images/
   sandbox/contract/doc/images/valid-html401.png (contents, props changed)
   sandbox/contract/doc/pdf/
   sandbox/contract/doc/pdf/Jamfile.v2 (contents, props changed)
   sandbox/contract/doc/src/
   sandbox/contract/doc/src/boost.xml (contents, props changed)
   sandbox/contract/doc/src/boostbook.css (contents, props changed)
   sandbox/contract/doc/src/docutils.css (contents, props changed)
   sandbox/contract/doc/src/images/
   sandbox/contract/doc/src/images/alert.png (contents, props changed)
   sandbox/contract/doc/src/images/blank.png (contents, props changed)
   sandbox/contract/doc/src/images/callouts/
   sandbox/contract/doc/src/images/callouts/1.png (contents, props changed)
   sandbox/contract/doc/src/images/callouts/1.svg (contents, props changed)
   sandbox/contract/doc/src/images/callouts/10.png (contents, props changed)
   sandbox/contract/doc/src/images/callouts/10.svg (contents, props changed)
   sandbox/contract/doc/src/images/callouts/11.png (contents, props changed)
   sandbox/contract/doc/src/images/callouts/11.svg (contents, props changed)
   sandbox/contract/doc/src/images/callouts/12.png (contents, props changed)
   sandbox/contract/doc/src/images/callouts/12.svg (contents, props changed)
   sandbox/contract/doc/src/images/callouts/13.png (contents, props changed)
   sandbox/contract/doc/src/images/callouts/13.svg (contents, props changed)
   sandbox/contract/doc/src/images/callouts/14.png (contents, props changed)
   sandbox/contract/doc/src/images/callouts/14.svg (contents, props changed)
   sandbox/contract/doc/src/images/callouts/15.png (contents, props changed)
   sandbox/contract/doc/src/images/callouts/15.svg (contents, props changed)
   sandbox/contract/doc/src/images/callouts/16.svg (contents, props changed)
   sandbox/contract/doc/src/images/callouts/17.svg (contents, props changed)
   sandbox/contract/doc/src/images/callouts/18.svg (contents, props changed)
   sandbox/contract/doc/src/images/callouts/19.svg (contents, props changed)
   sandbox/contract/doc/src/images/callouts/2.png (contents, props changed)
   sandbox/contract/doc/src/images/callouts/2.svg (contents, props changed)
   sandbox/contract/doc/src/images/callouts/20.svg (contents, props changed)
   sandbox/contract/doc/src/images/callouts/21.svg (contents, props changed)
   sandbox/contract/doc/src/images/callouts/22.svg (contents, props changed)
   sandbox/contract/doc/src/images/callouts/23.svg (contents, props changed)
   sandbox/contract/doc/src/images/callouts/24.svg (contents, props changed)
   sandbox/contract/doc/src/images/callouts/25.svg (contents, props changed)
   sandbox/contract/doc/src/images/callouts/26.svg (contents, props changed)
   sandbox/contract/doc/src/images/callouts/27.svg (contents, props changed)
   sandbox/contract/doc/src/images/callouts/28.svg (contents, props changed)
   sandbox/contract/doc/src/images/callouts/29.svg (contents, props changed)
   sandbox/contract/doc/src/images/callouts/3.png (contents, props changed)
   sandbox/contract/doc/src/images/callouts/3.svg (contents, props changed)
   sandbox/contract/doc/src/images/callouts/30.svg (contents, props changed)
   sandbox/contract/doc/src/images/callouts/4.png (contents, props changed)
   sandbox/contract/doc/src/images/callouts/4.svg (contents, props changed)
   sandbox/contract/doc/src/images/callouts/5.png (contents, props changed)
   sandbox/contract/doc/src/images/callouts/5.svg (contents, props changed)
   sandbox/contract/doc/src/images/callouts/6.png (contents, props changed)
   sandbox/contract/doc/src/images/callouts/6.svg (contents, props changed)
   sandbox/contract/doc/src/images/callouts/7.png (contents, props changed)
   sandbox/contract/doc/src/images/callouts/7.svg (contents, props changed)
   sandbox/contract/doc/src/images/callouts/8.png (contents, props changed)
   sandbox/contract/doc/src/images/callouts/8.svg (contents, props changed)
   sandbox/contract/doc/src/images/callouts/9.png (contents, props changed)
   sandbox/contract/doc/src/images/callouts/9.svg (contents, props changed)
   sandbox/contract/doc/src/images/caution.png (contents, props changed)
   sandbox/contract/doc/src/images/caution.svg (contents, props changed)
   sandbox/contract/doc/src/images/draft.png (contents, props changed)
   sandbox/contract/doc/src/images/home.png (contents, props changed)
   sandbox/contract/doc/src/images/home.svg (contents, props changed)
   sandbox/contract/doc/src/images/important.png (contents, props changed)
   sandbox/contract/doc/src/images/important.svg (contents, props changed)
   sandbox/contract/doc/src/images/next.png (contents, props changed)
   sandbox/contract/doc/src/images/next.svg (contents, props changed)
   sandbox/contract/doc/src/images/next_disabled.png (contents, props changed)
   sandbox/contract/doc/src/images/note.png (contents, props changed)
   sandbox/contract/doc/src/images/note.svg (contents, props changed)
   sandbox/contract/doc/src/images/prev.png (contents, props changed)
   sandbox/contract/doc/src/images/prev.svg (contents, props changed)
   sandbox/contract/doc/src/images/prev_disabled.png (contents, props changed)
   sandbox/contract/doc/src/images/smiley.png (contents, props changed)
   sandbox/contract/doc/src/images/tip.png (contents, props changed)
   sandbox/contract/doc/src/images/tip.svg (contents, props changed)
   sandbox/contract/doc/src/images/toc-blank.png (contents, props changed)
   sandbox/contract/doc/src/images/toc-minus.png (contents, props changed)
   sandbox/contract/doc/src/images/toc-plus.png (contents, props changed)
   sandbox/contract/doc/src/images/up.png (contents, props changed)
   sandbox/contract/doc/src/images/up.svg (contents, props changed)
   sandbox/contract/doc/src/images/up_disabled.png (contents, props changed)
   sandbox/contract/doc/src/images/warning.png (contents, props changed)
   sandbox/contract/doc/src/images/warning.svg (contents, props changed)
   sandbox/contract/doc/src/minimal.css (contents, props changed)
   sandbox/contract/doc/src/reference.css (contents, props changed)
   sandbox/contract/doc/test/
   sandbox/contract/doc/test/HTML4_symbols.qbk (contents, props changed)
   sandbox/contract/doc/test/Jamfile.v2 (contents, props changed)
   sandbox/contract/doc/test/array.xml (contents, props changed)
   sandbox/contract/doc/test/array1.xml (contents, props changed)
   sandbox/contract/doc/test/array2.xml (contents, props changed)
   sandbox/contract/doc/test/array3.xml (contents, props changed)
   sandbox/contract/doc/test/array4.xml (contents, props changed)
   sandbox/contract/doc/test/gold/
   sandbox/contract/doc/test/gold/boost/
   sandbox/contract/doc/test/gold/boost/accumulators/
   sandbox/contract/doc/test/gold/boost/accumulators/extract/
   sandbox/contract/doc/test/gold/boost/accumulators/extract/weighted_tail_quantile.html (contents, props changed)
   sandbox/contract/doc/test/gold/boost/accumulators/impl/
   sandbox/contract/doc/test/gold/boost/accumulators/impl/weighted_tail_quantile__id330053.html (contents, props changed)
   sandbox/contract/doc/test/gold/boost/accumulators/tag/
   sandbox/contract/doc/test/gold/boost/accumulators/tag/weighted_tail_quantile.html (contents, props changed)
   sandbox/contract/doc/test/gold/boost/array.html (contents, props changed)
   sandbox/contract/doc/test/gold/document_to_test_formatting/
   sandbox/contract/doc/test/gold/document_to_test_formatting/accumulators.html (contents, props changed)
   sandbox/contract/doc/test/gold/document_to_test_formatting/array.html (contents, props changed)
   sandbox/contract/doc/test/gold/document_to_test_formatting/basic_formatting.html (contents, props changed)
   sandbox/contract/doc/test/gold/document_to_test_formatting/blurbs.html (contents, props changed)
   sandbox/contract/doc/test/gold/document_to_test_formatting/code_blocks.html (contents, props changed)
   sandbox/contract/doc/test/gold/document_to_test_formatting/images.html (contents, props changed)
   sandbox/contract/doc/test/gold/document_to_test_formatting/lists_and_tables.html (contents, props changed)
   sandbox/contract/doc/test/gold/document_to_test_formatting/remez.html (contents, props changed)
   sandbox/contract/doc/test/gold/document_to_test_formatting/test.html (contents, props changed)
   sandbox/contract/doc/test/gold/images/
   sandbox/contract/doc/test/gold/images/accumulators/
   sandbox/contract/doc/test/gold/images/accumulators/doxygen.png (contents, props changed)
   sandbox/contract/doc/test/gold/images/accumulators/form_0.png (contents, props changed)
   sandbox/contract/doc/test/gold/images/accumulators/form_1.png (contents, props changed)
   sandbox/contract/doc/test/gold/images/accumulators/form_2.png (contents, props changed)
   sandbox/contract/doc/test/gold/images/accumulators/form_3.png (contents, props changed)
   sandbox/contract/doc/test/gold/images/accumulators/form_4.png (contents, props changed)
   sandbox/contract/doc/test/gold/images/accumulators/form_5.png (contents, props changed)
   sandbox/contract/doc/test/gold/images/accumulators/form_6.png (contents, props changed)
   sandbox/contract/doc/test/gold/images/accumulators/form_7.png (contents, props changed)
   sandbox/contract/doc/test/gold/images/accumulators/form_8.png (contents, props changed)
   sandbox/contract/doc/test/gold/images/beta_dist_kurtosis.png (contents, props changed)
   sandbox/contract/doc/test/gold/images/digamma3.png (contents, props changed)
   sandbox/contract/doc/test/gold/images/doctest.png (contents, props changed)
   sandbox/contract/doc/test/gold/images/open_clipart_library_logo.svg (contents, props changed)
   sandbox/contract/doc/test/gold/images/remez-2.png (contents, props changed)
   sandbox/contract/doc/test/gold/images/remez-3.png (contents, props changed)
   sandbox/contract/doc/test/gold/images/remez-4.png (contents, props changed)
   sandbox/contract/doc/test/gold/images/remez-5.png (contents, props changed)
   sandbox/contract/doc/test/gold/index.html (contents, props changed)
   sandbox/contract/doc/test/html/
   sandbox/contract/doc/test/html/images/
   sandbox/contract/doc/test/html/images/beta_dist_kurtosis.png (contents, props changed)
   sandbox/contract/doc/test/html/images/digamma3.png (contents, props changed)
   sandbox/contract/doc/test/html/images/doctest.png (contents, props changed)
   sandbox/contract/doc/test/html/images/open_clipart_library_logo.svg (contents, props changed)
   sandbox/contract/doc/test/html/images/remez-2.png (contents, props changed)
   sandbox/contract/doc/test/html/images/remez-3.png (contents, props changed)
   sandbox/contract/doc/test/html/images/remez-4.png (contents, props changed)
   sandbox/contract/doc/test/html/images/remez-5.png (contents, props changed)
   sandbox/contract/doc/test/remez.qbk (contents, props changed)
   sandbox/contract/doc/test/stub.cpp (contents, props changed)
   sandbox/contract/doc/test/test.png (contents, props changed)
   sandbox/contract/doc/test/test.qbk (contents, props changed)
   sandbox/contract/doc/test/test.svg (contents, props changed)
   sandbox/contract/doc/test/test_HTML4_symbols.qbk (contents, props changed)
   sandbox/contract/doc/test/weighted_tail_quantile.hpp (contents, props changed)

Added: sandbox/contract/doc/Jamfile.v2
==============================================================================
--- (empty file)
+++ sandbox/contract/doc/Jamfile.v2 2013-02-28 18:35:01 EST (Thu, 28 Feb 2013)
@@ -0,0 +1,130 @@
+# Copyright (c) 2002 Douglas Gregor <doug.gregor -at- gmail.com>
+#
+# Distributed under the Boost Software License, Version 1.0.
+# (See accompanying file LICENSE_1_0.txt or copy at
+# http://www.boost.org/LICENSE_1_0.txt)
+project boost/doc ;
+import boostbook : boostbook ;
+
+alias asio : ../libs/asio/doc//asio/<xsl:param>boost.libraries=../../libs/libraries.htm ;
+
+#
+# Note that when refering to libraries that use auto-index we must process all the way to
+# docbook before including here. We must also ensure that auto-index uses it's own index
+# generation, otherwise we get one big index that's repeated in each library. Xslt's index
+# generation is also so slow that it's impractical for a build this large (takes ~ 9 hrs
+# to build with just 3 indexed libraries). Hence we refer to these libraries as for example:
+#
+# ../libs/interprocess/doc//standalone/<format>docbook
+#
+# Within each library that uses this, make sure that the boostbook target contains
+#
+# <format>docbook:<auto-index-internal>on
+#
+# And if boost.root is set, restrict it to local html builds using:
+#
+# <format>html:<xsl:param>boost.root=../../../..
+# <format>html:<xsl:param>boost.libraries=../../../../libs/libraries.htm
+#
+# Finally, in boost.xml we xi:include interproces.auto_index.docbook which is the final
+# post-index generation docbook, rather than interprocess.xml which is the pre-indexed boostbook.
+#
+
+boostbook doc
+ :
+ src/boost.xml
+ :
+ ## Build the various generated docs (Doxygen and QuickBook)...
+
+ <dependency>../libs/accumulators/doc//accdoc.xml
+ <dependency>../libs/accumulators/doc//statsdoc.xml
+ <dependency>../libs/accumulators/doc//opdoc.xml
+ <dependency>../libs/accumulators/doc//accumulators
+ <dependency>../libs/conversion/doc//lexical_cast
+ <dependency>../libs/chrono/doc//chrono
+ <dependency>../libs/program_options/doc//autodoc.xml
+ <dependency>../libs/algorithm/string/doc//autodoc.xml
+ <dependency>../libs/logic/doc//reference.xml
+ <dependency>../libs/functional/hash/doc//hash
+ #<dependency>../libs/type_traits/doc//type_traits
+ <dependency>../libs/static_assert/doc//static_assert
+ <dependency>../libs/tr1/doc//tr1
+ <dependency>../libs/foreach/doc//foreach
+ <dependency>../libs/mpi/doc//mpi
+ <dependency>../libs/mpi/doc//mpi_autodoc.xml
+ <dependency>../libs/property_tree/doc//autodoc.xml
+ <dependency>../libs/property_tree/doc//property_tree
+ #<dependency>../libs/proto/doc//protodoc.xml
+ <dependency>../libs/proto/doc//proto
+ <dependency>../libs/ratio/doc//ratio
+ <dependency>../libs/typeof/doc//typeof
+ <dependency>../libs/xpressive/doc//autodoc.xml
+ <dependency>../libs/xpressive/doc//xpressive
+ <dependency>../libs/date_time/xmldoc//date_time_autodoc.xml
+ <dependency>../libs/date_time/xmldoc//gregorian_autodoc.xml
+ <dependency>../libs/date_time/xmldoc//posix_time_autodoc.xml
+ <dependency>../libs/date_time/xmldoc//local_time_autodoc.xml
+ <dependency>../tools/build/v2/doc//jam_docs
+ <dependency>../tools/quickbook/doc//quickbook
+ <dependency>../libs/interprocess/doc//standalone/<format>docbook
+ <dependency>../libs/intrusive/doc//standalone/<format>docbook
+ <dependency>../libs/move/doc//autodoc.xml
+ <dependency>../libs/move/doc//move
+ <dependency>../libs/container/doc//standalone/<format>docbook
+ <dependency>../libs/units/doc//units
+ <dependency>../libs/unordered/doc//unordered
+ <dependency>../libs/thread/doc//thread
+ <dependency>../libs/signals2/doc//hello_world_def_code_snippet.xml
+ <dependency>../libs/random/doc//random
+ #<dependency>../libs/spirit/doc//spirit
+ <dependency>../libs/heap/doc//autodoc.xml
+ <dependency>../libs/heap/doc//heap
+ <dependency>../libs/lockfree/doc//autodoc.xml
+ <dependency>../libs/lockfree/doc//lockfree
+ <dependency>../libs/atomic/doc//atomic
+
+ ## Add path references to the QuickBook generated docs...
+
+ <implicit-dependency>../libs/accumulators/doc//accumulators
+ <implicit-dependency>../libs/chrono/doc//chrono
+ <implicit-dependency>../libs/conversion/doc//lexical_cast
+ <implicit-dependency>../libs/functional/hash/doc//hash
+ #<implicit-dependency>../libs/type_traits/doc//type_traits
+ <implicit-dependency>../libs/static_assert/doc//static_assert
+ <implicit-dependency>../libs/tr1/doc//tr1
+ <implicit-dependency>../libs/foreach/doc//foreach
+ <implicit-dependency>../libs/property_tree/doc//property_tree
+ <implicit-dependency>../libs/proto/doc//proto
+ <implicit-dependency>../libs/ratio/doc//ratio
+ <implicit-dependency>../libs/typeof/doc//typeof
+ <implicit-dependency>../libs/xpressive/doc//xpressive
+ <implicit-dependency>../tools/build/v2/doc//jam_docs
+ <implicit-dependency>../tools/quickbook/doc//quickbook
+ <implicit-dependency>../libs/mpi/doc//mpi
+ <implicit-dependency>../libs/container/doc//standalone/<format>docbook
+ <implicit-dependency>../libs/interprocess/doc//standalone/<format>docbook
+ <implicit-dependency>../libs/intrusive/doc//standalone/<format>docbook
+ <implicit-dependency>../libs/move/doc//move
+ <implicit-dependency>../libs/units/doc//units
+ <implicit-dependency>../libs/unordered/doc//unordered
+ <implicit-dependency>../libs/thread/doc//thread
+ <implicit-dependency>../libs/signals2/doc//hello_world_def_code_snippet.xml
+ <implicit-dependency>../libs/random/doc//random
+ #<implicit-dependency>../libs/spirit/doc//spirit
+ <implicit-dependency>../libs/heap/doc//heap
+ <implicit-dependency>../libs/lockfree/doc//lockfree
+ <implicit-dependency>../libs/atomic/doc//atomic
+
+ <xsl:param>boost.libraries=../../libs/libraries.htm
+
+ <dependency>images
+ <dependency>callouts
+ ;
+
+install images : [ glob src/images/*.png ] : <location>html/images ;
+explicit images ;
+install callouts : [ glob src/images/callouts/*.png ] : <location>html/images/callouts ;
+explicit callouts ;
+
+
+

Added: sandbox/contract/doc/html/Assignable.html
==============================================================================
--- (empty file)
+++ sandbox/contract/doc/html/Assignable.html 2013-02-28 18:35:01 EST (Thu, 28 Feb 2013)
@@ -0,0 +1,16 @@
+<!DOCTYPE HTML PUBLIC "-//W3C//DTD HTML 4.01 Transitional//EN">
+<html>
+ <head>
+ 
+ <title>Redirect to generated documentation</title>
+ <meta http-equiv="refresh" content="0; URL=http://boost-sandbox.sourceforge.net/doc/html/Assignable.html">
+ </head>
+ <body>
+ Automatic redirection failed, please go to
+ http://boost-sandbox.sourceforge.net/doc/html/Assignable.html
+ </body>
+</html>

Added: sandbox/contract/doc/html/CopyConstructible.html
==============================================================================
--- (empty file)
+++ sandbox/contract/doc/html/CopyConstructible.html 2013-02-28 18:35:01 EST (Thu, 28 Feb 2013)
@@ -0,0 +1,16 @@
+<!DOCTYPE HTML PUBLIC "-//W3C//DTD HTML 4.01 Transitional//EN">
+<html>
+ <head>
+ 
+ <title>Redirect to generated documentation</title>
+ <meta http-equiv="refresh" content="0; URL=http://boost-sandbox.sourceforge.net/doc/html/CopyConstructible.html">
+ </head>
+ <body>
+ Automatic redirection failed, please go to
+ http://boost-sandbox.sourceforge.net/doc/html/CopyConstructible.html
+ </body>
+</html>

Added: sandbox/contract/doc/html/accumulators.html
==============================================================================
--- (empty file)
+++ sandbox/contract/doc/html/accumulators.html 2013-02-28 18:35:01 EST (Thu, 28 Feb 2013)
@@ -0,0 +1,16 @@
+<!DOCTYPE HTML PUBLIC "-//W3C//DTD HTML 4.01 Transitional//EN">
+<html>
+ <head>
+ 
+ <title>Redirect to generated documentation</title>
+ <meta http-equiv="refresh" content="0; URL=http://boost-sandbox.sourceforge.net/doc/html/accumulators.html">
+ </head>
+ <body>
+ Automatic redirection failed, please go to
+ http://boost-sandbox.sourceforge.net/doc/html/accumulators.html
+ </body>
+</html>

Added: sandbox/contract/doc/html/any.html
==============================================================================
--- (empty file)
+++ sandbox/contract/doc/html/any.html 2013-02-28 18:35:01 EST (Thu, 28 Feb 2013)
@@ -0,0 +1,16 @@
+<!DOCTYPE HTML PUBLIC "-//W3C//DTD HTML 4.01 Transitional//EN">
+<html>
+ <head>
+ 
+ <title>Redirect to generated documentation</title>
+ <meta http-equiv="refresh" content="0; URL=http://boost-sandbox.sourceforge.net/doc/html/any.html">
+ </head>
+ <body>
+ Automatic redirection failed, please go to
+ http://boost-sandbox.sourceforge.net/doc/html/any.html
+ </body>
+</html>

Added: sandbox/contract/doc/html/array.html
==============================================================================
--- (empty file)
+++ sandbox/contract/doc/html/array.html 2013-02-28 18:35:01 EST (Thu, 28 Feb 2013)
@@ -0,0 +1,16 @@
+<!DOCTYPE HTML PUBLIC "-//W3C//DTD HTML 4.01 Transitional//EN">
+<html>
+ <head>
+ 
+ <title>Redirect to generated documentation</title>
+ <meta http-equiv="refresh" content="0; URL=http://boost-sandbox.sourceforge.net/doc/html/array.html">
+ </head>
+ <body>
+ Automatic redirection failed, please go to
+ http://boost-sandbox.sourceforge.net/doc/html/array.html
+ </body>
+</html>

Added: sandbox/contract/doc/html/atomic.html
==============================================================================
--- (empty file)
+++ sandbox/contract/doc/html/atomic.html 2013-02-28 18:35:01 EST (Thu, 28 Feb 2013)
@@ -0,0 +1,16 @@
+<!DOCTYPE HTML PUBLIC "-//W3C//DTD HTML 4.01 Transitional//EN">
+<html>
+ <head>
+ 
+ <title>Redirect to generated documentation</title>
+ <meta http-equiv="refresh" content="0; URL=http://boost-sandbox.sourceforge.net/doc/html/atomic.html">
+ </head>
+ <body>
+ Automatic redirection failed, please go to
+ http://boost-sandbox.sourceforge.net/doc/html/atomic.html
+ </body>
+</html>

Added: sandbox/contract/doc/html/bbv2.html
==============================================================================
--- (empty file)
+++ sandbox/contract/doc/html/bbv2.html 2013-02-28 18:35:01 EST (Thu, 28 Feb 2013)
@@ -0,0 +1,16 @@
+<!DOCTYPE HTML PUBLIC "-//W3C//DTD HTML 4.01 Transitional//EN">
+<html>
+ <head>
+ 
+ <title>Redirect to generated documentation</title>
+ <meta http-equiv="refresh" content="0; URL=http://boost-sandbox.sourceforge.net/doc/html/bbv2.html">
+ </head>
+ <body>
+ Automatic redirection failed, please go to
+ http://boost-sandbox.sourceforge.net/doc/html/bbv2.html
+ </body>
+</html>

Added: sandbox/contract/doc/html/bbv2/installation.html
==============================================================================
--- (empty file)
+++ sandbox/contract/doc/html/bbv2/installation.html 2013-02-28 18:35:01 EST (Thu, 28 Feb 2013)
@@ -0,0 +1,18 @@
+<!DOCTYPE HTML PUBLIC "-//W3C//DTD HTML 4.01 Transitional//EN">
+<html>
+ <head>
+ 
+ <title>Redirect to generated documentation</title>
+ <meta http-equiv="refresh" content="0; URL=http://boost-sandbox.sourceforge.net/doc/html/bbv2/installation.html">
+ </head>
+ <body>
+ Automatic redirection failed, please go to
+ http://boost-sandbox.sourceforge.net/doc/html/bbv2/installation.html
+ </body>
+</html>
+
+

Added: sandbox/contract/doc/html/boost_asio.html
==============================================================================
--- (empty file)
+++ sandbox/contract/doc/html/boost_asio.html 2013-02-28 18:35:01 EST (Thu, 28 Feb 2013)
@@ -0,0 +1,17 @@
+<!DOCTYPE HTML PUBLIC "-//W3C//DTD HTML 4.01 Transitional//EN">
+<html>
+ <head>
+ 
+ <title>Redirect to generated documentation</title>
+ <meta http-equiv="refresh" content="0; URL=http://boost-sandbox.sourceforge.net/doc/html/boost_asio.html">
+ </head>
+ <body>
+ Automatic redirection failed, please go to
+ http://boost-sandbox.sourceforge.net/doc/html/boost_asio.html
+ </body>
+</html>
+

Added: sandbox/contract/doc/html/boost_lexical_cast.html
==============================================================================
--- (empty file)
+++ sandbox/contract/doc/html/boost_lexical_cast.html 2013-02-28 18:35:01 EST (Thu, 28 Feb 2013)
@@ -0,0 +1,16 @@
+<!DOCTYPE HTML PUBLIC "-//W3C//DTD HTML 4.01 Transitional//EN">
+<html>
+ <head>
+ 
+ <title>Redirect to generated documentation</title>
+ <meta http-equiv="refresh" content="0; URL=http://boost-sandbox.sourceforge.net/doc/html/boost_lexical_cast.html">
+ </head>
+ <body>
+ Automatic redirection failed, please go to
+ http://boost-sandbox.sourceforge.net/doc/html/boost_lexical_cast.html
+ </body>
+</html>

Added: sandbox/contract/doc/html/boost_random.html
==============================================================================
--- (empty file)
+++ sandbox/contract/doc/html/boost_random.html 2013-02-28 18:35:01 EST (Thu, 28 Feb 2013)
@@ -0,0 +1,17 @@
+<!DOCTYPE HTML PUBLIC "-//W3C//DTD HTML 4.01 Transitional//EN">
+<html>
+ <head>
+ 
+ <title>Redirect to generated documentation</title>
+ <meta http-equiv="refresh" content="0; URL=http://boost-sandbox.sourceforge.net/doc/html/boost_random.html">
+ </head>
+ <body>
+ Automatic redirection failed, please go to
+ http://boost-sandbox.sourceforge.net/doc/html/boost_random.html
+ </body>
+</html>
+

Added: sandbox/contract/doc/html/boost_staticassert.html
==============================================================================
--- (empty file)
+++ sandbox/contract/doc/html/boost_staticassert.html 2013-02-28 18:35:01 EST (Thu, 28 Feb 2013)
@@ -0,0 +1,17 @@
+<!DOCTYPE HTML PUBLIC "-//W3C//DTD HTML 4.01 Transitional//EN">
+<html>
+ <head>
+ 
+ <title>Redirect to generated documentation</title>
+ <meta http-equiv="refresh" content="0; URL=http://boost-sandbox.sourceforge.net/doc/html/boost_staticassert.html">
+ </head>
+ <body>
+ Automatic redirection failed, please go to
+ http://boost-sandbox.sourceforge.net/doc/html/boost_staticassert.html
+ </body>
+</html>
+

Added: sandbox/contract/doc/html/boost_tr1.html
==============================================================================
--- (empty file)
+++ sandbox/contract/doc/html/boost_tr1.html 2013-02-28 18:35:01 EST (Thu, 28 Feb 2013)
@@ -0,0 +1,17 @@
+<!DOCTYPE HTML PUBLIC "-//W3C//DTD HTML 4.01 Transitional//EN">
+<html>
+ <head>
+ 
+ <title>Redirect to generated documentation</title>
+ <meta http-equiv="refresh" content="0; URL=http://boost-sandbox.sourceforge.net/doc/html/boost_tr1.html">
+ </head>
+ <body>
+ Automatic redirection failed, please go to
+ http://boost-sandbox.sourceforge.net/doc/html/boost_tr1.html
+ </body>
+</html>
+

Added: sandbox/contract/doc/html/boostbook.html
==============================================================================
--- (empty file)
+++ sandbox/contract/doc/html/boostbook.html 2013-02-28 18:35:01 EST (Thu, 28 Feb 2013)
@@ -0,0 +1,16 @@
+<!DOCTYPE HTML PUBLIC "-//W3C//DTD HTML 4.01 Transitional//EN">
+<html>
+ <head>
+ 
+ <title>Redirect to generated documentation</title>
+ <meta http-equiv="refresh" content="0; URL=http://boost-sandbox.sourceforge.net/doc/html/boostbook.html">
+ </head>
+ <body>
+ Automatic redirection failed, please go to
+ http://boost-sandbox.sourceforge.net/doc/html/boostbook.html
+ </body>
+</html>

Added: sandbox/contract/doc/html/chrono.html
==============================================================================
--- (empty file)
+++ sandbox/contract/doc/html/chrono.html 2013-02-28 18:35:01 EST (Thu, 28 Feb 2013)
@@ -0,0 +1,16 @@
+<!DOCTYPE HTML PUBLIC "-//W3C//DTD HTML 4.01 Transitional//EN">
+<html>
+ <head>
+ 
+ <title>Redirect to generated documentation</title>
+ <meta http-equiv="refresh" content="0; URL=http://boost-sandbox.sourceforge.net/doc/html/chrono.html">
+ </head>
+ <body>
+ Automatic redirection failed, please go to
+ http://boost-sandbox.sourceforge.net/doc/html/chrono.html
+ </body>
+</html>

Added: sandbox/contract/doc/html/container.html
==============================================================================
--- (empty file)
+++ sandbox/contract/doc/html/container.html 2013-02-28 18:35:01 EST (Thu, 28 Feb 2013)
@@ -0,0 +1,16 @@
+<!DOCTYPE HTML PUBLIC "-//W3C//DTD HTML 4.01 Transitional//EN">
+<html>
+ <head>
+ 
+ <title>Redirect to generated documentation</title>
+ <meta http-equiv="refresh" content="0; URL=http://boost-sandbox.sourceforge.net/doc/html/container.html">
+ </head>
+ <body>
+ Automatic redirection failed, please go to
+ http://boost-sandbox.sourceforge.net/doc/html/container.html
+ </body>
+</html>

Added: sandbox/contract/doc/html/date_time.html
==============================================================================
--- (empty file)
+++ sandbox/contract/doc/html/date_time.html 2013-02-28 18:35:01 EST (Thu, 28 Feb 2013)
@@ -0,0 +1,16 @@
+<!DOCTYPE HTML PUBLIC "-//W3C//DTD HTML 4.01 Transitional//EN">
+<html>
+ <head>
+ 
+ <title>Redirect to generated documentation</title>
+ <meta http-equiv="refresh" content="0; URL=http://boost-sandbox.sourceforge.net/doc/html/date_time.html">
+ </head>
+ <body>
+ Automatic redirection failed, please go to
+ http://boost-sandbox.sourceforge.net/doc/html/date_time.html
+ </body>
+</html>

Added: sandbox/contract/doc/html/date_time/date_time_io.html
==============================================================================
--- (empty file)
+++ sandbox/contract/doc/html/date_time/date_time_io.html 2013-02-28 18:35:01 EST (Thu, 28 Feb 2013)
@@ -0,0 +1,17 @@
+<!DOCTYPE HTML PUBLIC "-//W3C//DTD HTML 4.01 Transitional//EN">
+<html>
+ <head>
+ 
+ <title>Redirect to generated documentation</title>
+ <meta http-equiv="refresh" content="0; URL=http://boost-sandbox.sourceforge.net/doc/html/date_time/date_time_io.html">
+ </head>
+ <body>
+ Automatic redirection failed, please go to
+ http://boost-sandbox.sourceforge.net/doc/html/date_time/date_time_io.html
+ </body>
+</html>
+

Added: sandbox/contract/doc/html/date_time/details.html
==============================================================================
--- (empty file)
+++ sandbox/contract/doc/html/date_time/details.html 2013-02-28 18:35:01 EST (Thu, 28 Feb 2013)
@@ -0,0 +1,17 @@
+<!DOCTYPE HTML PUBLIC "-//W3C//DTD HTML 4.01 Transitional//EN">
+<html>
+ <head>
+ 
+ <title>Redirect to generated documentation</title>
+ <meta http-equiv="refresh" content="0; URL=http://boost-sandbox.sourceforge.net/doc/html/date_time/details.html">
+ </head>
+ <body>
+ Automatic redirection failed, please go to
+ http://boost-sandbox.sourceforge.net/doc/html/date_time/details.html
+ </body>
+</html>
+

Added: sandbox/contract/doc/html/date_time/local_time.html
==============================================================================
--- (empty file)
+++ sandbox/contract/doc/html/date_time/local_time.html 2013-02-28 18:35:01 EST (Thu, 28 Feb 2013)
@@ -0,0 +1,17 @@
+<!DOCTYPE HTML PUBLIC "-//W3C//DTD HTML 4.01 Transitional//EN">
+<html>
+ <head>
+ 
+ <title>Redirect to generated documentation</title>
+ <meta http-equiv="refresh" content="0; URL=http://boost-sandbox.sourceforge.net/doc/html/date_time/local_time.html">
+ </head>
+ <body>
+ Automatic redirection failed, please go to
+ http://boost-sandbox.sourceforge.net/doc/html/date_time/local_time.html
+ </body>
+</html>
+

Added: sandbox/contract/doc/html/foreach.html
==============================================================================
--- (empty file)
+++ sandbox/contract/doc/html/foreach.html 2013-02-28 18:35:01 EST (Thu, 28 Feb 2013)
@@ -0,0 +1,17 @@
+<!DOCTYPE HTML PUBLIC "-//W3C//DTD HTML 4.01 Transitional//EN">
+<html>
+ <head>
+ 
+ <title>Redirect to generated documentation</title>
+ <meta http-equiv="refresh" content="0; URL=http://boost-sandbox.sourceforge.net/doc/html/foreach.html">
+ </head>
+ <body>
+ Automatic redirection failed, please go to
+ http://boost-sandbox.sourceforge.net/doc/html/foreach.html
+ </body>
+</html>
+

Added: sandbox/contract/doc/html/function.html
==============================================================================
--- (empty file)
+++ sandbox/contract/doc/html/function.html 2013-02-28 18:35:01 EST (Thu, 28 Feb 2013)
@@ -0,0 +1,16 @@
+<!DOCTYPE HTML PUBLIC "-//W3C//DTD HTML 4.01 Transitional//EN">
+<html>
+ <head>
+ 
+ <title>Redirect to generated documentation</title>
+ <meta http-equiv="refresh" content="0; URL=http://boost-sandbox.sourceforge.net/doc/html/function.html">
+ </head>
+ <body>
+ Automatic redirection failed, please go to
+ http://boost-sandbox.sourceforge.net/doc/html/function.html
+ </body>
+</html>

Added: sandbox/contract/doc/html/hash.html
==============================================================================
--- (empty file)
+++ sandbox/contract/doc/html/hash.html 2013-02-28 18:35:01 EST (Thu, 28 Feb 2013)
@@ -0,0 +1,16 @@
+<!DOCTYPE HTML PUBLIC "-//W3C//DTD HTML 4.01 Transitional//EN">
+<html>
+ <head>
+ 
+ <title>Redirect to generated documentation</title>
+ <meta http-equiv="refresh" content="0; URL=http://boost-sandbox.sourceforge.net/doc/html/hash.html">
+ </head>
+ <body>
+ Automatic redirection failed, please go to
+ http://boost-sandbox.sourceforge.net/doc/html/hash.html
+ </body>
+</html>

Added: sandbox/contract/doc/html/hash/custom.html
==============================================================================
--- (empty file)
+++ sandbox/contract/doc/html/hash/custom.html 2013-02-28 18:35:01 EST (Thu, 28 Feb 2013)
@@ -0,0 +1,16 @@
+<!DOCTYPE HTML PUBLIC "-//W3C//DTD HTML 4.01 Transitional//EN">
+<html>
+ <head>
+ 
+ <title>Redirect to generated documentation</title>
+ <meta http-equiv="refresh" content="0; URL=http://boost-sandbox.sourceforge.net/doc/html/hash/custom.html">
+ </head>
+ <body>
+ Automatic redirection failed, please go to
+ http://boost-sandbox.sourceforge.net/doc/html/hash/custom.html
+ </body>
+</html>

Added: sandbox/contract/doc/html/heap.html
==============================================================================
--- (empty file)
+++ sandbox/contract/doc/html/heap.html 2013-02-28 18:35:01 EST (Thu, 28 Feb 2013)
@@ -0,0 +1,16 @@
+<!DOCTYPE HTML PUBLIC "-//W3C//DTD HTML 4.01 Transitional//EN">
+<html>
+ <head>
+ 
+ <title>Redirect to generated documentation</title>
+ <meta http-equiv="refresh" content="0; URL=http://boost-sandbox.sourceforge.net/doc/html/heap.html">
+ </head>
+ <body>
+ Automatic redirection failed, please go to
+ http://boost-sandbox.sourceforge.net/doc/html/heap.html
+ </body>
+</html>

Added: sandbox/contract/doc/html/images/blank.png
==============================================================================
Binary file. No diff available.

Added: sandbox/contract/doc/html/images/caution.png
==============================================================================
Binary file. No diff available.

Added: sandbox/contract/doc/html/images/draft.png
==============================================================================
Binary file. No diff available.

Added: sandbox/contract/doc/html/images/home.png
==============================================================================
Binary file. No diff available.

Added: sandbox/contract/doc/html/images/important.png
==============================================================================
Binary file. No diff available.

Added: sandbox/contract/doc/html/images/next.png
==============================================================================
Binary file. No diff available.

Added: sandbox/contract/doc/html/images/next_disabled.png
==============================================================================
Binary file. No diff available.

Added: sandbox/contract/doc/html/images/note.png
==============================================================================
Binary file. No diff available.

Added: sandbox/contract/doc/html/images/prev.png
==============================================================================
Binary file. No diff available.

Added: sandbox/contract/doc/html/images/prev_disabled.png
==============================================================================
Binary file. No diff available.

Added: sandbox/contract/doc/html/images/tip.png
==============================================================================
Binary file. No diff available.

Added: sandbox/contract/doc/html/images/toc-blank.png
==============================================================================
Binary file. No diff available.

Added: sandbox/contract/doc/html/images/toc-minus.png
==============================================================================
Binary file. No diff available.

Added: sandbox/contract/doc/html/images/toc-plus.png
==============================================================================
Binary file. No diff available.

Added: sandbox/contract/doc/html/images/up.png
==============================================================================
Binary file. No diff available.

Added: sandbox/contract/doc/html/images/up_disabled.png
==============================================================================
Binary file. No diff available.

Added: sandbox/contract/doc/html/images/warning.png
==============================================================================
Binary file. No diff available.

Added: sandbox/contract/doc/html/interprocess.html
==============================================================================
--- (empty file)
+++ sandbox/contract/doc/html/interprocess.html 2013-02-28 18:35:01 EST (Thu, 28 Feb 2013)
@@ -0,0 +1,17 @@
+<!DOCTYPE HTML PUBLIC "-//W3C//DTD HTML 4.01 Transitional//EN">
+<html>
+ <head>
+ 
+ <meta http-equiv="refresh" content="0; URL=http://boost-sandbox.sourceforge.net/doc/html/interprocess.html">
+ <title>Redirect to generated documentation</title>
+ </head>
+ <body>
+ Automatic redirection failed, please go to
+ http://boost-sandbox.sourceforge.net/doc/html/interprocess.html
+ </body>
+</html>
+

Added: sandbox/contract/doc/html/intrusive.html
==============================================================================
--- (empty file)
+++ sandbox/contract/doc/html/intrusive.html 2013-02-28 18:35:01 EST (Thu, 28 Feb 2013)
@@ -0,0 +1,17 @@
+<!DOCTYPE HTML PUBLIC "-//W3C//DTD HTML 4.01 Transitional//EN">
+<html>
+ <head>
+ 
+ <title>Redirect to generated documentation</title>
+ <meta http-equiv="refresh" content="0; URL=http://boost-sandbox.sourceforge.net/doc/html/intrusive.html">
+ </head>
+ <body>
+ Automatic redirection failed, please go to
+ http://boost-sandbox.sourceforge.net/doc/html/intrusive.html
+ </body>
+</html>
+

Added: sandbox/contract/doc/html/lambda.html
==============================================================================
--- (empty file)
+++ sandbox/contract/doc/html/lambda.html 2013-02-28 18:35:01 EST (Thu, 28 Feb 2013)
@@ -0,0 +1,16 @@
+<!DOCTYPE HTML PUBLIC "-//W3C//DTD HTML 4.01 Transitional//EN">
+<html>
+ <head>
+ 
+ <title>Redirect to generated documentation</title>
+ <meta http-equiv="refresh" content="0; URL=http://boost-sandbox.sourceforge.net/doc/html/lambda.html">
+ </head>
+ <body>
+ Automatic redirection failed, please go to
+ http://boost-sandbox.sourceforge.net/doc/html/lambda.html
+ </body>
+</html>

Added: sandbox/contract/doc/html/lockfree.html
==============================================================================
--- (empty file)
+++ sandbox/contract/doc/html/lockfree.html 2013-02-28 18:35:01 EST (Thu, 28 Feb 2013)
@@ -0,0 +1,16 @@
+<!DOCTYPE HTML PUBLIC "-//W3C//DTD HTML 4.01 Transitional//EN">
+<html>
+ <head>
+ 
+ <title>Redirect to generated documentation</title>
+ <meta http-equiv="refresh" content="0; URL=http://boost-sandbox.sourceforge.net/doc/html/lockfree.html">
+ </head>
+ <body>
+ Automatic redirection failed, please go to
+ http://boost-sandbox.sourceforge.net/doc/html/lockfree.html
+ </body>
+</html>

Added: sandbox/contract/doc/html/move.html
==============================================================================
--- (empty file)
+++ sandbox/contract/doc/html/move.html 2013-02-28 18:35:01 EST (Thu, 28 Feb 2013)
@@ -0,0 +1,16 @@
+<!DOCTYPE HTML PUBLIC "-//W3C//DTD HTML 4.01 Transitional//EN">
+<html>
+ <head>
+ 
+ <title>Redirect to generated documentation</title>
+ <meta http-equiv="refresh" content="0; URL=http://boost-sandbox.sourceforge.net/doc/html/move.html">
+ </head>
+ <body>
+ Automatic redirection failed, please go to
+ http://boost-sandbox.sourceforge.net/doc/html/move.html
+ </body>
+</html>

Added: sandbox/contract/doc/html/mpi.html
==============================================================================
--- (empty file)
+++ sandbox/contract/doc/html/mpi.html 2013-02-28 18:35:01 EST (Thu, 28 Feb 2013)
@@ -0,0 +1,16 @@
+<!DOCTYPE HTML PUBLIC "-//W3C//DTD HTML 4.01 Transitional//EN">
+<html>
+ <head>
+ 
+ <title>Redirect to generated documentation</title>
+ <meta http-equiv="refresh" content="0; URL=http://boost-sandbox.sourceforge.net/doc/html/mpi.html">
+ </head>
+ <body>
+ Automatic redirection failed, please go to
+ http://boost-sandbox.sourceforge.net/doc/html/mpi.html
+ </body>
+</html>

Added: sandbox/contract/doc/html/program_options.html
==============================================================================
--- (empty file)
+++ sandbox/contract/doc/html/program_options.html 2013-02-28 18:35:01 EST (Thu, 28 Feb 2013)
@@ -0,0 +1,16 @@
+<!DOCTYPE HTML PUBLIC "-//W3C//DTD HTML 4.01 Transitional//EN">
+<html>
+ <head>
+ 
+ <title>Redirect to generated documentation</title>
+ <meta http-equiv="refresh" content="0; URL=http://boost-sandbox.sourceforge.net/doc/html/program_options.html">
+ </head>
+ <body>
+ Automatic redirection failed, please go to
+ http://boost-sandbox.sourceforge.net/doc/html/program_options.html
+ </body>
+</html>

Added: sandbox/contract/doc/html/property_tree.html
==============================================================================
--- (empty file)
+++ sandbox/contract/doc/html/property_tree.html 2013-02-28 18:35:01 EST (Thu, 28 Feb 2013)
@@ -0,0 +1,16 @@
+<!DOCTYPE HTML PUBLIC "-//W3C//DTD HTML 4.01 Transitional//EN">
+<html>
+ <head>
+ 
+ <title>Redirect to generated documentation</title>
+ <meta http-equiv="refresh" content="0; URL=http://boost-sandbox.sourceforge.net/doc/html/property_tree.html">
+ </head>
+ <body>
+ Automatic redirection failed, please go to
+ http://boost-sandbox.sourceforge.net/doc/html/property_tree.html
+ </body>
+</html>

Added: sandbox/contract/doc/html/proto.html
==============================================================================
--- (empty file)
+++ sandbox/contract/doc/html/proto.html 2013-02-28 18:35:01 EST (Thu, 28 Feb 2013)
@@ -0,0 +1,16 @@
+<!DOCTYPE HTML PUBLIC "-//W3C//DTD HTML 4.01 Transitional//EN">
+<html>
+ <head>
+ 
+ <title>Redirect to generated documentation</title>
+ <meta http-equiv="refresh" content="0; URL=http://boost-sandbox.sourceforge.net/doc/html/proto.html">
+ </head>
+ <body>
+ Automatic redirection failed, please go to
+ http://boost-sandbox.sourceforge.net/doc/html/proto.html
+ </body>
+</html>

Added: sandbox/contract/doc/html/quickbook.html
==============================================================================
--- (empty file)
+++ sandbox/contract/doc/html/quickbook.html 2013-02-28 18:35:01 EST (Thu, 28 Feb 2013)
@@ -0,0 +1,16 @@
+<!DOCTYPE HTML PUBLIC "-//W3C//DTD HTML 4.01 Transitional//EN">
+<html>
+ <head>
+ 
+ <title>Redirect to generated documentation</title>
+ <meta http-equiv="refresh" content="0; URL=http://boost-sandbox.sourceforge.net/doc/html/quickbook.html">
+ </head>
+ <body>
+ Automatic redirection failed, please go to
+ http://boost-sandbox.sourceforge.net/doc/html/quickbook.html
+ </body>
+</html>

Added: sandbox/contract/doc/html/ratio.html
==============================================================================
--- (empty file)
+++ sandbox/contract/doc/html/ratio.html 2013-02-28 18:35:01 EST (Thu, 28 Feb 2013)
@@ -0,0 +1,16 @@
+<!DOCTYPE HTML PUBLIC "-//W3C//DTD HTML 4.01 Transitional//EN">
+<html>
+ <head>
+ 
+ <title>Redirect to generated documentation</title>
+ <meta http-equiv="refresh" content="0; URL=http://boost-sandbox.sourceforge.net/doc/html/ratio.html">
+ </head>
+ <body>
+ Automatic redirection failed, please go to
+ http://boost-sandbox.sourceforge.net/doc/html/ratio.html
+ </body>
+</html>

Added: sandbox/contract/doc/html/ref.html
==============================================================================
--- (empty file)
+++ sandbox/contract/doc/html/ref.html 2013-02-28 18:35:01 EST (Thu, 28 Feb 2013)
@@ -0,0 +1,16 @@
+<!DOCTYPE HTML PUBLIC "-//W3C//DTD HTML 4.01 Transitional//EN">
+<html>
+ <head>
+ 
+ <title>Redirect to generated documentation</title>
+ <meta http-equiv="refresh" content="0; URL=http://boost-sandbox.sourceforge.net/doc/html/ref.html">
+ </head>
+ <body>
+ Automatic redirection failed, please go to
+ http://boost-sandbox.sourceforge.net/doc/html/ref.html
+ </body>
+</html>

Added: sandbox/contract/doc/html/signals.html
==============================================================================
--- (empty file)
+++ sandbox/contract/doc/html/signals.html 2013-02-28 18:35:01 EST (Thu, 28 Feb 2013)
@@ -0,0 +1,16 @@
+<!DOCTYPE HTML PUBLIC "-//W3C//DTD HTML 4.01 Transitional//EN">
+<html>
+ <head>
+ 
+ <title>Redirect to generated documentation</title>
+ <meta http-equiv="refresh" content="0; URL=http://boost-sandbox.sourceforge.net/doc/html/signals.html">
+ </head>
+ <body>
+ Automatic redirection failed, please go to
+ http://boost-sandbox.sourceforge.net/doc/html/signals.html
+ </body>
+</html>

Added: sandbox/contract/doc/html/signals2.html
==============================================================================
--- (empty file)
+++ sandbox/contract/doc/html/signals2.html 2013-02-28 18:35:01 EST (Thu, 28 Feb 2013)
@@ -0,0 +1,16 @@
+<!DOCTYPE HTML PUBLIC "-//W3C//DTD HTML 4.01 Transitional//EN">
+<html>
+ <head>
+ 
+ <title>Redirect to generated documentation</title>
+ <meta http-equiv="refresh" content="0; URL=http://boost-sandbox.sourceforge.net/doc/html/signals2.html">
+ </head>
+ <body>
+ Automatic redirection failed, please go to
+ http://boost-sandbox.sourceforge.net/doc/html/signals2.html
+ </body>
+</html>

Added: sandbox/contract/doc/html/string_algo.html
==============================================================================
--- (empty file)
+++ sandbox/contract/doc/html/string_algo.html 2013-02-28 18:35:01 EST (Thu, 28 Feb 2013)
@@ -0,0 +1,16 @@
+<!DOCTYPE HTML PUBLIC "-//W3C//DTD HTML 4.01 Transitional//EN">
+<html>
+ <head>
+ 
+ <title>Redirect to generated documentation</title>
+ <meta http-equiv="refresh" content="0; URL=http://boost-sandbox.sourceforge.net/doc/html/string_algo.html">
+ </head>
+ <body>
+ Automatic redirection failed, please go to
+ http://boost-sandbox.sourceforge.net/doc/html/string_algo.html
+ </body>
+</html>

Added: sandbox/contract/doc/html/thread.html
==============================================================================
--- (empty file)
+++ sandbox/contract/doc/html/thread.html 2013-02-28 18:35:01 EST (Thu, 28 Feb 2013)
@@ -0,0 +1,16 @@
+<!DOCTYPE HTML PUBLIC "-//W3C//DTD HTML 4.01 Transitional//EN">
+<html>
+ <head>
+ 
+ <title>Redirect to generated documentation</title>
+ <meta http-equiv="refresh" content="0; URL=http://boost-sandbox.sourceforge.net/doc/html/thread.html">
+ </head>
+ <body>
+ Automatic redirection failed, please go to
+ http://boost-sandbox.sourceforge.net/doc/html/thread.html
+ </body>
+</html>

Added: sandbox/contract/doc/html/tribool.html
==============================================================================
--- (empty file)
+++ sandbox/contract/doc/html/tribool.html 2013-02-28 18:35:01 EST (Thu, 28 Feb 2013)
@@ -0,0 +1,16 @@
+<!DOCTYPE HTML PUBLIC "-//W3C//DTD HTML 4.01 Transitional//EN">
+<html>
+ <head>
+ 
+ <title>Redirect to generated documentation</title>
+ <meta http-equiv="refresh" content="0; URL=http://boost-sandbox.sourceforge.net/doc/html/tribool.html">
+ </head>
+ <body>
+ Automatic redirection failed, please go to
+ http://boost-sandbox.sourceforge.net/doc/html/tribool.html
+ </body>
+</html>

Added: sandbox/contract/doc/html/typeof.html
==============================================================================
--- (empty file)
+++ sandbox/contract/doc/html/typeof.html 2013-02-28 18:35:01 EST (Thu, 28 Feb 2013)
@@ -0,0 +1,16 @@
+<!DOCTYPE HTML PUBLIC "-//W3C//DTD HTML 4.01 Transitional//EN">
+<html>
+ <head>
+ 
+ <title>Redirect to generated documentation</title>
+ <meta http-equiv="refresh" content="0; URL=http://boost-sandbox.sourceforge.net/doc/html/typeof.html">
+ </head>
+ <body>
+ Automatic redirection failed, please go to
+ http://boost-sandbox.sourceforge.net/doc/html/typeof.html
+ </body>
+</html>

Added: sandbox/contract/doc/html/unordered.html
==============================================================================
--- (empty file)
+++ sandbox/contract/doc/html/unordered.html 2013-02-28 18:35:01 EST (Thu, 28 Feb 2013)
@@ -0,0 +1,16 @@
+<!DOCTYPE HTML PUBLIC "-//W3C//DTD HTML 4.01 Transitional//EN">
+<html>
+ <head>
+ 
+ <title>Redirect to generated documentation</title>
+ <meta http-equiv="refresh" content="0; URL=http://boost-sandbox.sourceforge.net/doc/html/unordered.html">
+ </head>
+ <body>
+ Automatic redirection failed, please go to
+ http://boost-sandbox.sourceforge.net/doc/html/unordered.html
+ </body>
+</html>

Added: sandbox/contract/doc/html/variant.html
==============================================================================
--- (empty file)
+++ sandbox/contract/doc/html/variant.html 2013-02-28 18:35:01 EST (Thu, 28 Feb 2013)
@@ -0,0 +1,16 @@
+<!DOCTYPE HTML PUBLIC "-//W3C//DTD HTML 4.01 Transitional//EN">
+<html>
+ <head>
+ 
+ <title>Redirect to generated documentation</title>
+ <meta http-equiv="refresh" content="0; URL=http://boost-sandbox.sourceforge.net/doc/html/variant.html">
+ </head>
+ <body>
+ Automatic redirection failed, please go to
+ http://boost-sandbox.sourceforge.net/doc/html/variant.html
+ </body>
+</html>

Added: sandbox/contract/doc/html/xpressive.html
==============================================================================
--- (empty file)
+++ sandbox/contract/doc/html/xpressive.html 2013-02-28 18:35:01 EST (Thu, 28 Feb 2013)
@@ -0,0 +1,17 @@
+<!DOCTYPE HTML PUBLIC "-//W3C//DTD HTML 4.01 Transitional//EN">
+<html>
+ <head>
+ 
+ <title>Redirect to generated documentation</title>
+ <meta http-equiv="refresh" content="0; URL=http://boost-sandbox.sourceforge.net/doc/html/xpressive.html">
+ </head>
+ <body>
+ Automatic redirection failed, please go to
+ http://boost-sandbox.sourceforge.net/doc/html/xpressive.html
+ </body>
+</html>
+

Added: sandbox/contract/doc/images/valid-html401.png
==============================================================================
Binary file. No diff available.

Added: sandbox/contract/doc/pdf/Jamfile.v2
==============================================================================
--- (empty file)
+++ sandbox/contract/doc/pdf/Jamfile.v2 2013-02-28 18:35:01 EST (Thu, 28 Feb 2013)
@@ -0,0 +1,195 @@
+# Copyright (c) 2008 John Maddock
+#
+# 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)
+
+import boostbook ;
+import os ;
+import common ;
+import doxygen ;
+import quickbook ;
+
+project : requirements <include>../../libs/geometry/doc ;
+
+
+
+boostbook array_docs
+ : ../../libs/array/doc/array.xml
+ :
+ <format>pdf:<xsl:param>boost.url.prefix=http://www.boost.org/doc/libs/release/doc/html
+ <format>pdf
+ ;
+
+boostbook any_docs
+ : ../../libs/any/doc/any.xml
+ :
+ <format>pdf:<xsl:param>boost.url.prefix=http://www.boost.org/doc/libs/release/doc/html
+ <format>pdf
+ ;
+
+install pdf-install
+ :
+ array_docs
+ any_docs
+ ../../libs/atomic/doc//standalone
+ ../../libs/accumulators/doc//standalone
+ ../../libs/algorithm/string/doc//string_algo
+ ../../libs/algorithm/doc//standalone
+ ../../libs/bimap/doc//standalone
+ ../../libs/bind/doc//ref-doc
+ ../../libs/chrono/doc//standalone
+ ../../libs/concept_check/doc//concepts
+ ../../libs/config/doc//standalone
+ #../../libs/container/doc//pdf-install
+ ../../libs/conversion/doc//standalone
+ ../../libs/coroutine/doc//standalone
+ ../../libs/date_time/xmldoc//date_time
+ ../../libs/foreach/doc//standalone
+ ../../libs/function/doc//function-doc
+ ../../libs/functional/factory/doc//standalone
+ ../../libs/functional/forward/doc//standalone
+ ../../libs/functional/hash/doc//standalone
+# ../../libs/functional/overloaded_function/doc//doc
+ ../../libs/fusion/doc//quickbook
+ #../../libs/geometry/doc//geometry
+ ../../libs/icl/doc//standalone
+ ../../libs/integer/doc//standalone
+ ../../libs/iterator/doc//standalone
+ ../../libs/lambda/doc//lambda-doc
+ ../../libs/lockfree/doc//standalone
+# ../../libs/local_function/doc//doc
+ ../../libs/logic/doc//tribool
+ ../../libs/math/doc/complex//standalone
+ ../../libs/math/doc/octonion//standalone
+ ../../libs/math/doc/quaternion//standalone
+ ../../libs/math/doc/gcd//standalone
+ ../../libs/math/doc/sf_and_dist//pdf-install
+ ../../libs/move/doc//standalone
+ ../../libs/mpi/doc//standalone
+ ../../libs/multiprecision/doc//pdf-install
+ ../../libs/numeric/conversion/doc//standalone
+# ../../libs/numeric/odeint/doc//standalone
+ ../../libs/optional/doc//standalone
+ ../../libs/phoenix/doc//phoenix-doc
+ ../../libs/program_options/doc//program_option
+ ../../libs/property_tree/doc//standalone
+ ../../libs/proto/doc//standalone
+ # Invalid Jamfile, doesn't use Boostbook anyway??
+ #../../libs/ptr_container/doc//standalone
+ ../../libs/ratio/doc//standalone
+ ../../libs/regex/doc//standalone
+ ../../libs/signals/doc//doc
+ ../../libs/spirit/repository/doc//spirit2_repository
+ ../../libs/static_assert/doc//standalone
+ ../../libs/thread/doc//standalone
+ ../../libs/tr1/doc//standalone
+ ../../libs/type_traits/doc//pdf-install
+ ../../libs/typeof/doc//standalone
+ ../../libs/units/doc//standalone
+# ../../libs/utility/identity_type/doc//doc
+ ../../libs/unordered/doc//standalone
+ ../../libs/variant/doc//variant-doc
+ ../../libs/xpressive/doc//standalone
+
+ ../../tools/boostbook/doc//boostbook
+ ../../tools/build/v2/doc//jam_docs
+ ../../tools/quickbook/doc//standalone
+ ../../tools/bcp/doc//standalone
+ :
+ <location>.
+ <install-type>PDF
+ <format>pdf
+ ;
+
+
+install python-tutorial-install
+ :
+ ../../libs/python/doc/tutorial/doc//tutorial
+ :
+ <location>.
+ <install-type>PDF
+ <format>pdf
+ <name>python_tutorial.pdf
+ ;
+
+install asio-install
+ :
+ ../../libs/asio/doc//asio
+ :
+ <location>.
+ <install-type>PDF
+ <format>pdf
+ <name>asio.pdf
+ ;
+
+install phoenix-install
+ :
+ ../../libs/spirit/phoenix/doc//quickbook
+ :
+ <location>.
+ <install-type>PDF
+ <format>pdf
+ <name>spirit-phoenix-v2.pdf
+ ;
+
+install boost-build-install
+ :
+ ../../tools/build/v2/doc//userman
+ :
+ <location>.
+ <install-type>PDF
+ <format>pdf
+ <name>boost_build.pdf
+ ;
+
+install signals2-install
+ :
+ ../../libs/signals2/doc//standalone
+ :
+ <location>.
+ <install-type>PDF
+ <format>pdf
+ <name>signals2.pdf
+ <dependency>../../libs/signals2/doc//hello_world_def_code_snippet.xml
+ ;
+
+install range-install
+ :
+ ../../libs/range/doc//quickbook
+ :
+ <location>.
+ <install-type>PDF
+ <format>pdf
+ <name>range.pdf
+ ;
+
+# Just copy the MSM PDF over:
+install msm_install : ../../libs/msm/doc/pdf/msm.pdf : <location>. ;
+
+install spirit-install
+ :
+ ../../libs/spirit/doc//spirit2
+ :
+ <location>.
+ <install-type>PDF
+ <format>pdf
+ <name>spirit2.pdf
+;
+
+install scope_exit_install
+ :
+ ../../libs/scope_exit/doc//doc
+ :
+ <location>.
+ <install-type>PDF
+ <format>pdf
+ <name>scope_exit.pdf
+;
+
+
+
+
+
+
+

Added: sandbox/contract/doc/src/boost.xml
==============================================================================
--- (empty file)
+++ sandbox/contract/doc/src/boost.xml 2013-02-28 18:35:01 EST (Thu, 28 Feb 2013)
@@ -0,0 +1,764 @@
+<?xml version="1.0" encoding="utf-8"?>
+<!DOCTYPE boostbook PUBLIC "-//Boost//DTD BoostBook XML V1.0//EN"
+ "http://www.boost.org/tools/boostbook/dtd/boostbook.dtd">
+<boostbook id="boost" xmlns:xi="http://www.w3.org/2001/XInclude"
+ last-revision="$Date: 2013-02-19 01:14:53 -0800 (Tue, 19 Feb 2013) $">
+ <title>The Boost C++ Libraries BoostBook Documentation Subset</title>
+
+ <preface id="about">
+ <title>What's Included in This Document</title>
+
+ <para>This document represents only a subset of the full Boost
+ documentation: that part which is generated from BoostBook or
+ QuickBook sources. Eventually all Boost libraries may use these
+ formats, but in the meantime, much of Boost's documentation is not
+ available here. Please
+ see <ulink
+ url="http://www.boost.org/libs">http://www.boost.org/libs>
+ for complete documentation.
+ </para>
+
+ <para>
+ Documentation for some of the libraries described in this document is
+ available in alternative formats:
+ <itemizedlist>
+ <listitem>
+ <simpara><link linkend="boost">HTML</link></simpara>
+ </listitem>
+ </itemizedlist>
+ <itemizedlist>
+ <listitem>
+ <simpara><ulink url="http://sourceforge.net/projects/boost/files/boost-docs/">PDF</ulink></simpara>
+ </listitem>
+ </itemizedlist>
+ </para>
+
+ </preface>
+
+ <part id="libraries">
+ <title>The Boost C++ Libraries (BoostBook Subset)</title>
+
+ <xi:include href="accumulators.xml"/>
+
+ <xi:include href="../../libs/any/doc/any.xml"/>
+ <xi:include href="../../libs/array/doc/array.xml"/>
+
+ <library name="Asio" dirname="asio" html-only="1">
+ <libraryinfo>
+ <author>
+ <firstname>Christopher</firstname>
+ <surname>Kohlhoff</surname>
+ </author>
+
+ <librarypurpose>Portable networking and other low-level I/O, including sockets, timers, hostname resolution, socket iostreams, serial ports, file descriptors and Windows HANDLEs</librarypurpose>
+ <librarycategory name="category:io"/>
+ </libraryinfo>
+ </library>
+
+ <xi:include href="atomic.xml"/>
+
+ <library name="Bind" dirname="bind" html-only="1">
+ <libraryinfo>
+ <author>
+ <firstname>Peter</firstname>
+ <surname>Dimov</surname>
+ </author>
+ <librarypurpose>Generalized binders for function/object/pointers and member functions</librarypurpose>
+ <librarycategory name="category:higher-order"/>
+ </libraryinfo>
+ </library>
+
+ <library name="Mem_fn" dirname="bind" html-only="1"
+ url="../../libs/bind/mem_fn.html">
+ <libraryinfo>
+ <author>
+ <firstname>Peter</firstname>
+ <surname>Dimov</surname>
+ </author>
+ <librarypurpose>Generalized binders for member functions</librarypurpose>
+ <librarycategory name="category:higher-order"/>
+ </libraryinfo>
+ </library>
+
+ <library name="Call Traits" dirname="call_traits" html-only="1"
+ url="../../libs/utility/call_traits.htm">
+ <libraryinfo>
+ <author>
+ <firstname>John</firstname>
+ <surname>Maddock</surname>
+ </author>
+ <author>
+ <firstname>Howard</firstname>
+ <surname>Hinnant</surname>
+ </author>
+ <librarypurpose>Defines types for passing parameters</librarypurpose>
+ <librarycategory name="category:generic"/>
+ </libraryinfo>
+ </library>
+
+ <xi:include href="chrono.xml"/>
+
+ <library name="Circular Buffer" dirname="circular_buffer" html-only="1"
+ url="../../libs/circular_buffer/index.html">
+ <libraryinfo>
+ <author>
+ <firstname>Jan</firstname>
+ <surname>Gaspar</surname>
+ </author>
+ <librarypurpose>A STL compliant container also known as ring or cyclic buffer</librarypurpose>
+ <librarycategory name="category:containers"/>
+ </libraryinfo>
+ </library>
+
+ <library name="Compatibility" dirname="compatibility" html-only="1">
+ <libraryinfo>
+ <author>
+ <firstname>Ralf</firstname>
+ <surname>Grosse-Kunstleve</surname>
+ </author>
+ <author>
+ <firstname>Jens</firstname>
+ <surname>Maurer</surname>
+ </author>
+ <librarypurpose>Help for non-conforming standard libraries</librarypurpose>
+ <librarycategory name="category:broken"/>
+ </libraryinfo>
+ </library>
+
+ <library name="Compose" dirname="compose" html-only="1"
+ url="../../libs/compose/index.htm">
+ <libraryinfo>
+ <author>
+ <firstname>Nicolai</firstname>
+ <surname>Josuttis</surname>
+ </author>
+
+ <librarypurpose>Functional composition adapters for the STL</librarypurpose>
+ <librarycategory name="category:higher-order"/>
+ </libraryinfo>
+ </library>
+
+ <library name="Compressed Pair" dirname="compressed_pair" html-only="1"
+ url="../../libs/utility/compressed_pair.htm">
+ <libraryinfo>
+ <author>
+ <firstname>John</firstname>
+ <surname>Maddock</surname>
+ </author>
+ <author>
+ <firstname>Howard</firstname>
+ <surname>Hinnant</surname>
+ </author>
+ <librarypurpose>Empty member optimization</librarypurpose>
+ <librarycategory name="category:data-structures"/>
+ <librarycategory name="category:misc"/>
+ </libraryinfo>
+ </library>
+
+ <library name="Concept Check" dirname="concept_check">
+ <libraryinfo>
+ <author>
+ <firstname>Jeremy</firstname>
+ <surname>Siek</surname>
+ </author>
+ <librarypurpose>Tools for generic programming</librarypurpose>
+ <librarycategory name="category:generic"/>
+ <librarycategory name="category:testing"/>
+ </libraryinfo>
+ <title>Boost.Concept_Check</title>
+ <xi:include href="../../libs/concept_check/doc/reference/concepts.xml"/>
+ </library>
+
+ <library name="Config" dirname="config" html-only="1">
+ <libraryinfo>
+ <author>
+ <firstname>John</firstname>
+ <surname>Maddock</surname>
+ </author>
+ <author>
+ <firstname>Beman</firstname>
+ <surname>Dawes</surname>
+ </author>
+ <author>
+ <firstname>Vesa</firstname>
+ <surname>Karvonen</surname>
+ </author>
+
+ <librarypurpose>Helps boost library developers adapt to compiler idiosyncrasies; not intended for library users</librarypurpose>
+ <librarycategory name="category:broken"/>
+ </libraryinfo>
+ </library>
+
+ <xi:include href="container.auto_index.docbook"/>
+
+ <library name="Conversion" dirname="conversion" html-only="1"
+ url="../../libs/conversion/index.html">
+ <libraryinfo>
+ <author>
+ <firstname>Dave</firstname>
+ <surname>Abrahams</surname>
+ </author>
+ <author>
+ <firstname>Kevlin</firstname>
+ <surname>Henney</surname>
+ </author>
+
+ <librarypurpose>Numeric, polymorphic, and lexical casts</librarypurpose>
+ <librarycategory name="category:misc"/>
+ </libraryinfo>
+ </library>
+
+ <library name="CRC" dirname="crc" html-only="1">
+ <libraryinfo>
+ <author>
+ <firstname>Daryle</firstname>
+ <surname>Walker</surname>
+ </author>
+
+ <librarypurpose>Cyclic Redundancy Code</librarypurpose>
+ <librarycategory name="category:misc"/>
+ </libraryinfo>
+ </library>
+
+ <xi:include href="../../libs/date_time/xmldoc/date_time.xml"/>
+
+ <library name="Dynamic Bitset" dirname="dynamic_bitset" html-only="1">
+ <libraryinfo>
+ <author>
+ <firstname>Jeremy</firstname>
+ <surname>Siek</surname>
+ </author>
+ <author>
+ <firstname>Chuck</firstname>
+ <surname>Allison</surname>
+ </author>
+ <librarypurpose>A runtime sized version of <code>std::bitset</code></librarypurpose>
+ <librarycategory name="category:containers"/>
+ </libraryinfo>
+ </library>
+
+ <library name="Format" dirname="format" html-only="1"
+ url="../../libs/format/index.html">
+ <libraryinfo>
+ <author>
+ <firstname>Samuel</firstname>
+ <surname>Krempp</surname>
+ </author>
+
+ <librarypurpose>Type-safe 'printf-like' format operations</librarypurpose>
+ <librarycategory name="category:string-text"/>
+ <librarycategory name="category:io"/>
+ </libraryinfo>
+ </library>
+
+ <library name="Filesystem" dirname="filesystem" html-only="1">
+ <libraryinfo>
+ <author>
+ <firstname>Beman</firstname>
+ <surname>Dawes</surname>
+ </author>
+
+ <librarypurpose>Portable paths, iteration over directories, and other useful filesystem operations</librarypurpose>
+ <librarycategory name="category:misc"/>
+ </libraryinfo>
+ </library>
+
+ <xi:include href="foreach.xml"/>
+
+ <xi:include href="../../libs/function/doc/function.xml"/>
+
+ <library name="Functional" dirname="functional" html-only="1">
+ <libraryinfo>
+ <author>
+ <firstname>Mark</firstname>
+ <surname>Rodgers</surname>
+ </author>
+ <librarypurpose>Enhanced function object adaptors</librarypurpose>
+ <librarycategory name="category:higher-order"/>
+ </libraryinfo>
+ </library>
+
+ <xi:include href="hash.xml"/>
+
+ <library name="Graph" dirname="graph" html-only="1">
+ <libraryinfo>
+ <author>
+ <firstname>Jeremy</firstname>
+ <surname>Siek</surname>
+ </author>
+ <author>
+ <firstname>University of Notre Dame</firstname>
+ <surname>Team</surname>
+ </author>
+ <librarypurpose>Generic graph components and algorithms</librarypurpose>
+ <librarycategory name="category:containers"/>
+ <librarycategory name="category:iterators"/>
+ <librarycategory name="category:algorithms"/>
+ </libraryinfo>
+ </library>
+
+ <xi:include href="heap.xml"/>
+
+ <library name="Integer" dirname="integer" html-only="1"
+ url="../../libs/integer/index.html">
+ <libraryinfo>
+ <author>
+ <firstname>various</firstname>
+ <surname>authors</surname>
+ </author>
+
+ <librarypurpose>Headers to ease dealing with integral types</librarypurpose>
+ <librarycategory name="category:math"/>
+ </libraryinfo>
+ </library>
+
+ <xi:include href="interprocess.auto_index.docbook"/>
+
+ <library name="Interval" dirname="numeric/interval" html-only="1"
+ url="../../libs/numeric/interval/doc/index.html">
+ <libraryinfo>
+ <author>
+ <firstname>Guillaume</firstname>
+ <surname>Melquiond</surname>
+ </author>
+ <author>
+ <firstname>Hervé</firstname>
+ <surname>Brönnimann</surname>
+ </author>
+ <author>
+ <firstname>Sylvain</firstname>
+ <surname>Pion</surname>
+ </author>
+
+ <librarypurpose>Extends the usual arithmetic functions to mathematical intervals</librarypurpose>
+ <librarycategory name="category:math"/>
+ </libraryinfo>
+ </library>
+
+ <xi:include href="intrusive.auto_index.docbook"/>
+
+ <library name="I/O State Savers" dirname="io" html-only="1">
+ <libraryinfo>
+ <author>
+ <firstname>Daryle</firstname>
+ <surname>Walker</surname>
+ </author>
+
+ <librarypurpose>Save I/O state to prevent jumbled data</librarypurpose>
+ <librarycategory name="category:io"/>
+ </libraryinfo>
+ </library>
+
+ <library name="Iterator Adaptors" dirname="utility" html-only="1"
+ url="../../libs/utility/iterator_adaptors.htm">
+ <libraryinfo>
+ <author>
+ <firstname>Dave</firstname>
+ <surname>Abrahams</surname>
+ </author>
+ <author>
+ <firstname>Jeremy</firstname>
+ <surname>Siek</surname>
+ </author>
+ <author>
+ <firstname>John</firstname>
+ <surname>Potter</surname>
+ </author>
+
+ <librarypurpose>Adapt a base type into a standard conforming iterator</librarypurpose>
+ <librarycategory name="category:iterators"/>
+ </libraryinfo>
+ </library>
+
+ <xi:include href="../../libs/lambda/doc/lambda.xml"/>
+
+ <xi:include href="lexical_cast.xml"/>
+
+ <xi:include href="lockfree.xml"/>
+
+ <library name="Math" dirname="math" html-only="1">
+ <libraryinfo>
+ <author>
+ <firstname>various</firstname>
+ <surname>authors</surname>
+ </author>
+
+ <librarypurpose>Several contributions in the domain of mathematics</librarypurpose>
+ <librarycategory name="category:math"/>
+ </libraryinfo>
+ </library>
+
+ <library name="Math/Common Factor" dirname="math/common_factor" html-only="1"
+ url="../../libs/math/doc/common_factor.html">
+ <libraryinfo>
+ <author>
+ <firstname>Daryle</firstname>
+ <surname>Walker</surname>
+ </author>
+
+ <librarypurpose>Greatest common divisor and least common multiple</librarypurpose>
+ <librarycategory name="category:math"/>
+ </libraryinfo>
+ </library>
+
+ <library name="Math/Octonion" dirname="math/octonion" html-only="1">
+ <libraryinfo>
+ <author>
+ <firstname>Hubert</firstname>
+ <surname>Holin</surname>
+ </author>
+
+ <librarypurpose>Octonions</librarypurpose>
+ <librarycategory name="category:math"/>
+ </libraryinfo>
+ </library>
+
+ <library name="Math/Quaternion" dirname="math/quaternion" html-only="1">
+ <libraryinfo>
+ <author>
+ <firstname>Hubert</firstname>
+ <surname>Holin</surname>
+ </author>
+
+ <librarypurpose>Quaternions</librarypurpose>
+ <librarycategory name="category:math"/>
+ </libraryinfo>
+ </library>
+
+ <library name="Math/Special Functions" dirname="math/special_functions" html-only="1">
+ <libraryinfo>
+ <author>
+ <firstname>Hubert</firstname>
+ <surname>Holin</surname>
+ </author>
+
+ <librarypurpose>Mathematical special functions such as atanh, sinc, and sinhc</librarypurpose>
+ <librarycategory name="category:math"/>
+ </libraryinfo>
+ </library>
+
+ <xi:include href="move.xml"/>
+
+ <library name="MPL" dirname="mpl" html-only="1">
+ <libraryinfo>
+ <author>
+ <firstname>Aleksey</firstname>
+ <surname>Gurtovoy</surname>
+ </author>
+
+ <librarypurpose>Template metaprogramming framework of compile-time algorithms, sequences and metafunction classes</librarypurpose>
+ <librarycategory name="category:template"/>
+ </libraryinfo>
+ </library>
+
+
+ <xi:include href="../../libs/multi_array/doc/xml/bbref.xml"/>
+
+ <library name="Operators" dirname="utility" html-only="1">
+ <libraryinfo>
+ <author>
+ <firstname>Dave</firstname>
+ <surname>Abrahams</surname>
+ </author>
+ <author>
+ <firstname>Jeremy</firstname>
+ <surname>Siek</surname>
+ </author>
+
+ <librarypurpose>Templates ease arithmetic classes and iterators</librarypurpose>
+ <librarycategory name="category:generic"/>
+ <librarycategory name="category:iterators"/>
+ <librarycategory name="category:math"/>
+ </libraryinfo>
+ </library>
+
+ <library name="Optional" dirname="optional" html-only="1">
+ <libraryinfo>
+ <author>
+ <firstname>Fernando</firstname>
+ <surname>Cacciola</surname>
+ </author>
+
+ <librarypurpose>Discriminated-union wrapper for optional values</librarypurpose>
+ <librarycategory name="category:misc"/>
+ <librarycategory name="category:data-structures"/>
+ </libraryinfo>
+ </library>
+
+ <xi:include href="mpi.xml"/>
+
+ <library name="Pool" dirname="pool" html-only="1">
+ <libraryinfo>
+ <author>
+ <firstname>Steve</firstname>
+ <surname>Cleary</surname>
+ </author>
+
+ <librarypurpose>Memory pool management</librarypurpose>
+ <librarycategory name="category:memory"/>
+ </libraryinfo>
+ </library>
+
+ <library name="Preprocessor" dirname="preprocessor" html-only="1">
+ <libraryinfo>
+ <author>
+ <firstname>Vesa</firstname>
+ <surname>Karvonen</surname>
+ </author>
+ <author>
+ <firstname>Paul</firstname>
+ <surname>Mensonides</surname>
+ </author>
+
+ <librarypurpose>Preprocessor metaprogramming tools including repetition and recursion</librarypurpose>
+ <librarycategory name="category:preprocessor"/>
+ </libraryinfo>
+ </library>
+
+ <xi:include href="../../libs/program_options/doc/program_options.xml"/>
+
+ <library name="Property Map" dirname="property_map" html-only="1">
+ <libraryinfo>
+ <author>
+ <firstname>Jeremy</firstname>
+ <surname>Siek</surname>
+ </author>
+ <librarypurpose>Concepts defining interfaces which map key objects to value objects</librarypurpose>
+ <librarycategory name="category:containers"/>
+ <librarycategory name="category:generic"/>
+ </libraryinfo>
+ </library>
+
+ <xi:include href="property_tree.xml"/>
+
+ <xi:include href="proto.xml"/>
+
+ <library name="Python" dirname="python" html-only="1">
+ <libraryinfo>
+ <author>
+ <firstname>Dave</firstname>
+ <surname>Abrahams</surname>
+ </author>
+ <librarypurpose>Reflects C++ classes and functions into <ulink url="http://www.python.org">Python</ulink></librarypurpose>
+ <librarycategory name="category:lang"/>
+ </libraryinfo>
+ </library>
+
+ <xi:include href="random.xml"/>
+
+ <xi:include href="ratio.xml"/>
+
+ <library name="Rational" dirname="rational" html-only="1">
+ <libraryinfo>
+ <author>
+ <firstname>Paul</firstname>
+ <surname>Moore</surname>
+ </author>
+ <librarypurpose>A rational number class</librarypurpose>
+ <librarycategory name="category:math"/>
+ </libraryinfo>
+ </library>
+
+ <xi:include href="../../libs/bind/doc/ref.xml"/>
+
+ <library name="Regex" dirname="regex" html-only="1"
+ url="../../libs/regex/index.html">
+ <libraryinfo>
+ <author>
+ <firstname>John</firstname>
+ <surname>Maddock</surname>
+ </author>
+ <librarypurpose>Regular expression library</librarypurpose>
+ <librarycategory name="category:string-text"/>
+ </libraryinfo>
+ </library>
+
+ <library name="Serialization" dirname="serialization" html-only="1"
+ url="../../libs/serialization/index.html">
+ <libraryinfo>
+ <author>
+ <firstname>Robert</firstname>
+ <surname>Ramey</surname>
+ </author>
+ <librarypurpose>Serialization of C++ objects for persistence and marshalling</librarypurpose>
+ <librarycategory name="category:io"/>
+ </libraryinfo>
+ </library>
+
+ <xi:include href="../../libs/signals/doc/signals.xml"/>
+
+ <xi:include href="../../libs/signals2/doc/signals.xml"/>
+
+ <library name="Smart Pointer" dirname="smart_ptr" html-only="1"
+ url="../../libs/smart_ptr/index.html">
+ <libraryinfo>
+ <author>
+ <firstname>Greg</firstname>
+ <surname>Colvin</surname>
+ </author>
+ <author>
+ <firstname>Beman</firstname>
+ <surname>Dawes</surname>
+ </author>
+ <author>
+ <firstname>Peter</firstname>
+ <surname>Dimov</surname>
+ </author>
+ <author>
+ <firstname>Darin</firstname>
+ <surname>Adler</surname>
+ </author>
+ <librarypurpose>Six smart pointer class templates</librarypurpose>
+ <librarycategory name="category:memory"/>
+ </libraryinfo>
+ </library>
+
+ <library name="Spirit" dirname="spirit" html-only="1">
+ <libraryinfo>
+ <author>
+ <firstname>Joel</firstname>
+ <surname>de Guzman</surname>
+ </author>
+ <author>
+ <firstname>team</firstname>
+ </author>
+
+ <librarypurpose>LL parser framework represents parsers directly as EBNF grammars in inlined C++</librarypurpose>
+ <librarycategory name="category:text"/>
+ <librarycategory name="category:parsing"/>
+ </libraryinfo>
+ </library>
+
+ <xi:include href="static_assert.xml"/>
+
+ <xi:include href="../../libs/algorithm/string/doc/string_algo.xml"/>
+
+ <library name="Test" dirname="test" html-only="1">
+ <libraryinfo>
+ <author>
+ <firstname>Gennadiy</firstname>
+ <surname>Rozental</surname>
+ </author>
+ <librarypurpose>Support for simple program testing, full unit testing, and for program execution monitoring</librarypurpose>
+ <librarycategory name="category:testing"/>
+ </libraryinfo>
+ </library>
+
+ <xi:include href="thread.xml"/>
+
+ <library name="Timer" dirname="timer" html-only="1"
+ url="../../libs/timer/index.html">
+ <libraryinfo>
+ <author>
+ <firstname>Beman</firstname>
+ <surname>Dawes</surname>
+ </author>
+ <librarypurpose>Event timer, progress timer, and progress display classes</librarypurpose>
+ <librarycategory name="category:misc"/>
+ </libraryinfo>
+ </library>
+
+ <library name="Tokenizer" dirname="tokenizer" html-only="1"
+ url="../../libs/tokenizer/index.html">
+ <libraryinfo>
+ <author>
+ <firstname>John</firstname>
+ <surname>Bandela</surname>
+ </author>
+ <librarypurpose>Break of a string or other character sequence into a series of tokens</librarypurpose>
+ <librarycategory name="category:string-text"/>
+ <librarycategory name="category:iterators"/>
+ </libraryinfo>
+ </library>
+
+ <xi:include href="tr1.xml"/>
+ <xi:include href="../../libs/logic/doc/tribool.boostbook"/>
+
+ <library name="Tuple" dirname="tuple" html-only="1">
+ <libraryinfo>
+ <author>
+ <firstname>Jaakko</firstname>
+ <surname>Järvi</surname>
+ </author>
+ <librarypurpose>Ease definition of functions returning multiple values, and more</librarypurpose>
+ <librarycategory name="category:data-structures"/>
+ </libraryinfo>
+ </library>
+
+ <library name="Type Traits" dirname="type_traits" html-only="1">
+ <libraryinfo>
+ <author>
+ <firstname>John</firstname>
+ <surname>Maddock</surname>
+ </author>
+ <librarypurpose>Meta-programming support library.</librarypurpose>
+ <librarycategory name="category:generic"/>
+ </libraryinfo>
+ </library>
+
+ <xi:include href="typeof.xml"/>
+
+ <library name="uBLAS" dirname="numeric/ublas" html-only="1">
+ <libraryinfo>
+ <author>
+ <firstname>Joerg</firstname>
+ <surname>Walter</surname>
+ </author>
+ <author>
+ <firstname>Mathias</firstname>
+ <surname>Koch</surname>
+ </author>
+ <librarypurpose>Basic linear algebra for dense, packed and sparse matrices</librarypurpose>
+ <librarycategory name="category:math"/>
+ </libraryinfo>
+ </library>
+
+ <xi:include href="units.xml"/>
+
+ <xi:include href="unordered.xml"/>
+
+ <library name="Utility" dirname="utility" html-only="1">
+ <libraryinfo>
+ <author>
+ <firstname>Dave</firstname>
+ <surname>Abrahams</surname>
+ </author>
+ <author>
+ <firstname>others</firstname>
+ </author>
+
+ <librarypurpose>Class noncopyable plus <functionname>checked_delete</functionname>, <functionname>checked_array_delete</functionname>, <functionname>next</functionname>, <functionname>prior</functionname> function templates, plus base-from-member idiom</librarypurpose>
+ <librarycategory name="category:misc"/>
+ <librarycategory name="category:memory"/>
+ <librarycategory name="category:algorithms"/>
+ </libraryinfo>
+ </library>
+ <xi:include href="../../libs/variant/doc/variant.xml"/>
+
+ <xi:include href="xpressive.xml"/>
+
+ </part>
+
+ <part id="tools">
+ <title>Boost Tools</title>
+ <partintro>
+ <para>
+ Boost developers, testers, and maintainers have developed various programs to
+ help with the administration of the Boost Libraries. Like everything else about
+ Boost, these tools are available in source form, and are part of the regular
+ Boost distribution.
+ </para>
+ <para>
+ Users may find these tools useful when porting Boost libraries to a new platform,
+ or for use with their own applications.
+ </para>
+ </partintro>
+ <xi:include href="../../tools/boostbook/doc/boostbook.xml"/>
+ <xi:include href="quickbook.xml"/>
+ <xi:include href="jam_docs.xml"/>
+ <xi:include href="../../tools/build/v2/doc/src/userman.xml"/>
+ </part>
+</boostbook>
+
+
+

Added: sandbox/contract/doc/src/boostbook.css
==============================================================================
--- (empty file)
+++ sandbox/contract/doc/src/boostbook.css 2013-02-28 18:35:01 EST (Thu, 28 Feb 2013)
@@ -0,0 +1,646 @@
+/*=============================================================================
+ Copyright (c) 2004 Joel de Guzman
+ http://spirit.sourceforge.net/
+
+ Distributed under the Boost Software License, Version 1.0. (See accompany-
+ ing file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)
+=============================================================================*/
+
+/*=============================================================================
+ Body defaults
+=============================================================================*/
+
+ body
+ {
+ margin: 1em;
+ font-family: sans-serif;
+ }
+
+/*=============================================================================
+ Paragraphs
+=============================================================================*/
+
+ p
+ {
+ text-align: left;
+ font-size: 10pt;
+ line-height: 1.15;
+ }
+
+/*=============================================================================
+ Program listings
+=============================================================================*/
+
+ /* Code on paragraphs */
+ p tt.computeroutput
+ {
+ font-size: 9pt;
+ }
+
+ pre.synopsis
+ {
+ font-size: 9pt;
+ margin: 1pc 4% 0pc 4%;
+ padding: 0.5pc 0.5pc 0.5pc 0.5pc;
+ }
+
+ .programlisting,
+ .screen
+ {
+ font-size: 9pt;
+ display: block;
+ margin: 1pc 4% 0pc 4%;
+ padding: 0.5pc 0.5pc 0.5pc 0.5pc;
+ }
+
+ /* Program listings in tables don't get borders */
+ td .programlisting,
+ td .screen
+ {
+ margin: 0pc 0pc 0pc 0pc;
+ padding: 0pc 0pc 0pc 0pc;
+ }
+
+/*=============================================================================
+ Headings
+=============================================================================*/
+
+ h1, h2, h3, h4, h5, h6
+ {
+ text-align: left;
+ margin: 1em 0em 0.5em 0em;
+ font-weight: bold;
+ }
+
+ h1 { font-size: 140%; }
+ h2 { font-weight: bold; font-size: 140%; }
+ h3 { font-weight: bold; font-size: 130%; }
+ h4 { font-weight: bold; font-size: 120%; }
+ h5 { font-weight: normal; font-style: italic; font-size: 110%; }
+ h6 { font-weight: normal; font-style: italic; font-size: 100%; }
+
+ /* Top page titles */
+ title,
+ h1.title,
+ h2.title
+ h3.title,
+ h4.title,
+ h5.title,
+ h6.title,
+ .refentrytitle
+ {
+ font-weight: bold;
+ margin-bottom: 1pc;
+ }
+
+ h1.title { font-size: 140% }
+ h2.title { font-size: 140% }
+ h3.title { font-size: 130% }
+ h4.title { font-size: 120% }
+ h5.title { font-size: 110% }
+ h6.title { font-size: 100% }
+
+ .section h1
+ {
+ margin: 0em 0em 0.5em 0em;
+ font-size: 140%;
+ }
+
+ .section h2 { font-size: 140% }
+ .section h3 { font-size: 130% }
+ .section h4 { font-size: 120% }
+ .section h5 { font-size: 110% }
+ .section h6 { font-size: 100% }
+
+ /* Code on titles */
+ h1 tt.computeroutput { font-size: 140% }
+ h2 tt.computeroutput { font-size: 140% }
+ h3 tt.computeroutput { font-size: 130% }
+ h4 tt.computeroutput { font-size: 130% }
+ h5 tt.computeroutput { font-size: 130% }
+ h6 tt.computeroutput { font-size: 130% }
+
+
+/*=============================================================================
+ Author
+=============================================================================*/
+
+ h3.author
+ {
+ font-size: 100%
+ }
+
+/*=============================================================================
+ Lists
+=============================================================================*/
+
+ li
+ {
+ font-size: 10pt;
+ line-height: 1.3;
+ }
+
+ /* Unordered lists */
+ ul
+ {
+ text-align: left;
+ }
+
+ /* Ordered lists */
+ ol
+ {
+ text-align: left;
+ }
+
+/*=============================================================================
+ Links
+=============================================================================*/
+
+ a
+ {
+ text-decoration: none; /* no underline */
+ }
+
+ a:hover
+ {
+ text-decoration: underline;
+ }
+
+/*=============================================================================
+ Spirit style navigation
+=============================================================================*/
+
+ .spirit-nav
+ {
+ text-align: right;
+ }
+
+ .spirit-nav a
+ {
+ color: white;
+ padding-left: 0.5em;
+ }
+
+ .spirit-nav img
+ {
+ border-width: 0px;
+ }
+
+/*=============================================================================
+ Copyright footer
+=============================================================================*/
+ .copyright-footer
+ {
+ text-align: right;
+ font-size: 70%;
+ }
+
+ .copyright-footer p
+ {
+ text-align: right;
+ font-size: 80%;
+ }
+
+/*=============================================================================
+ Table of contents
+=============================================================================*/
+
+ .toc
+ {
+ margin: 1pc 4% 0pc 4%;
+ padding: 0.1pc 1pc 0.1pc 1pc;
+ font-size: 80%;
+ line-height: 1.15;
+ }
+
+ .boost-toc
+ {
+ float: right;
+ padding: 0.5pc;
+ }
+
+ /* Code on toc */
+ .toc .computeroutput { font-size: 120% }
+
+ /* No margin on nested menus */
+
+ .toc dl dl { margin: 0; }
+
+/*=============================================================================
+ Tables
+=============================================================================*/
+
+ .table-title,
+ div.table p.title
+ {
+ margin-left: 4%;
+ padding-right: 0.5em;
+ padding-left: 0.5em;
+ }
+
+ .informaltable table,
+ .table table
+ {
+ width: 92%;
+ margin-left: 4%;
+ margin-right: 4%;
+ }
+
+ div.informaltable table,
+ div.table table
+ {
+ padding: 4px;
+ }
+
+ /* Table Cells */
+ div.informaltable table tr td,
+ div.table table tr td
+ {
+ padding: 0.5em;
+ text-align: left;
+ font-size: 9pt;
+ }
+
+ div.informaltable table tr th,
+ div.table table tr th
+ {
+ padding: 0.5em 0.5em 0.5em 0.5em;
+ border: 1pt solid white;
+ font-size: 80%;
+ }
+
+ table.simplelist
+ {
+ width: auto !important;
+ margin: 0em !important;
+ padding: 0em !important;
+ border: none !important;
+ }
+ table.simplelist td
+ {
+ margin: 0em !important;
+ padding: 0em !important;
+ text-align: left !important;
+ font-size: 9pt !important;
+ border: none !important;
+ }
+
+/*=============================================================================
+ Blurbs
+=============================================================================*/
+
+ div.note,
+ div.tip,
+ div.important,
+ div.caution,
+ div.warning,
+ p.blurb
+ {
+ font-size: 9pt; /* A little bit smaller than the main text */
+ line-height: 1.2;
+ display: block;
+ margin: 1pc 4% 0pc 4%;
+ padding: 0.5pc 0.5pc 0.5pc 0.5pc;
+ }
+
+ p.blurb img
+ {
+ padding: 1pt;
+ }
+
+/*=============================================================================
+ Variable Lists
+=============================================================================*/
+
+ div.variablelist
+ {
+ margin: 1em 0;
+ }
+
+ /* Make the terms in definition lists bold */
+ div.variablelist dl dt,
+ span.term
+ {
+ font-weight: bold;
+ font-size: 10pt;
+ }
+
+ div.variablelist table tbody tr td
+ {
+ text-align: left;
+ vertical-align: top;
+ padding: 0em 2em 0em 0em;
+ font-size: 10pt;
+ margin: 0em 0em 0.5em 0em;
+ line-height: 1;
+ }
+
+ div.variablelist dl dt
+ {
+ margin-bottom: 0.2em;
+ }
+
+ div.variablelist dl dd
+ {
+ margin: 0em 0em 0.5em 2em;
+ font-size: 10pt;
+ }
+
+ div.variablelist table tbody tr td p,
+ div.variablelist dl dd p
+ {
+ margin: 0em 0em 0.5em 0em;
+ line-height: 1;
+ }
+
+/*=============================================================================
+ Misc
+=============================================================================*/
+
+ /* Title of books and articles in bibliographies */
+ span.title
+ {
+ font-style: italic;
+ }
+
+ span.underline
+ {
+ text-decoration: underline;
+ }
+
+ span.strikethrough
+ {
+ text-decoration: line-through;
+ }
+
+ /* Copyright, Legal Notice */
+ div div.legalnotice p
+ {
+ text-align: left
+ }
+
+/*=============================================================================
+ Colors
+=============================================================================*/
+
+ @media screen
+ {
+ body {
+ background-color: #FFFFFF;
+ color: #000000;
+ }
+
+ /* Syntax Highlighting */
+ .keyword { color: #0000AA; }
+ .identifier { color: #000000; }
+ .special { color: #707070; }
+ .preprocessor { color: #402080; }
+ .char { color: teal; }
+ .comment { color: #800000; }
+ .string { color: teal; }
+ .number { color: teal; }
+ .white_bkd { background-color: #FFFFFF; }
+ .dk_grey_bkd { background-color: #999999; }
+
+ /* Links */
+ a, a .keyword, a .identifier, a .special, a .preprocessor
+ a .char, a .comment, a .string, a .number
+ {
+ color: #005a9c;
+ }
+
+ a:visited, a:visited .keyword, a:visited .identifier,
+ a:visited .special, a:visited .preprocessor a:visited .char,
+ a:visited .comment, a:visited .string, a:visited .number
+ {
+ color: #9c5a9c;
+ }
+
+ h1 a, h2 a, h3 a, h4 a, h5 a, h6 a,
+ h1 a:hover, h2 a:hover, h3 a:hover, h4 a:hover, h5 a:hover, h6 a:hover,
+ h1 a:visited, h2 a:visited, h3 a:visited, h4 a:visited, h5 a:visited, h6 a:visited
+ {
+ text-decoration: none; /* no underline */
+ color: #000000;
+ }
+
+ /* Copyright, Legal Notice */
+ .copyright
+ {
+ color: #666666;
+ font-size: small;
+ }
+
+ div div.legalnotice p
+ {
+ color: #666666;
+ }
+
+ /* Program listing */
+ pre.synopsis
+ {
+ border: 1px solid #DCDCDC;
+ }
+
+ .programlisting,
+ .screen
+ {
+ border: 1px solid #DCDCDC;
+ }
+
+ td .programlisting,
+ td .screen
+ {
+ border: 0px solid #DCDCDC;
+ }
+
+ /* Blurbs */
+ div.note,
+ div.tip,
+ div.important,
+ div.caution,
+ div.warning,
+ p.blurb
+ {
+ border: 1px solid #DCDCDC;
+ }
+
+ /* Table of contents */
+ .toc
+ {
+ border: 1px solid #DCDCDC;
+ }
+
+ /* Tables */
+ div.informaltable table tr td,
+ div.table table tr td
+ {
+ border: 1px solid #DCDCDC;
+ }
+
+ div.informaltable table tr th,
+ div.table table tr th
+ {
+ background-color: #F0F0F0;
+ border: 1px solid #DCDCDC;
+ }
+
+ .copyright-footer
+ {
+ color: #8F8F8F;
+ }
+
+ /* Misc */
+ span.highlight
+ {
+ color: #00A000;
+ }
+ }
+
+ @media print
+ {
+ /* Links */
+ a
+ {
+ color: black;
+ }
+
+ a:visited
+ {
+ color: black;
+ }
+
+ .spirit-nav
+ {
+ display: none;
+ }
+
+ /* Program listing */
+ pre.synopsis
+ {
+ border: 1px solid gray;
+ }
+
+ .programlisting,
+ .screen
+ {
+ border: 1px solid gray;
+ }
+
+ td .programlisting,
+ td .screen
+ {
+ border: 0px solid #DCDCDC;
+ }
+
+ /* Table of contents */
+ .toc
+ {
+ border: 1px solid gray;
+ }
+
+ .informaltable table,
+ .table table
+ {
+ border: 1px solid gray;
+ border-collapse: collapse;
+ }
+
+ /* Tables */
+ div.informaltable table tr td,
+ div.table table tr td
+ {
+ border: 1px solid gray;
+ }
+
+ div.informaltable table tr th,
+ div.table table tr th
+ {
+ border: 1px solid gray;
+ }
+
+ table.simplelist tr td
+ {
+ border: none !important;
+ }
+
+ /* Misc */
+ span.highlight
+ {
+ font-weight: bold;
+ }
+ }
+
+/*=============================================================================
+ Images
+=============================================================================*/
+
+ span.inlinemediaobject img
+ {
+ vertical-align: middle;
+ }
+
+/*==============================================================================
+ Super and Subscript: style so that line spacing isn't effected, see
+ http://www.adobe.com/cfusion/communityengine/index.cfm?event=showdetails&productId=1&postId=5341
+==============================================================================*/
+
+sup,
+sub {
+ height: 0;
+ line-height: 1;
+ vertical-align: baseline;
+ position: relative;
+
+}
+
+/* For internet explorer: */
+
+* html sup,
+* html sub {
+ vertical-align: bottom;
+}
+
+sup {
+ bottom: 1ex;
+}
+
+sub {
+ top: .5ex;
+}
+
+/*==============================================================================
+ Indexes: pretty much the same as the TOC.
+==============================================================================*/
+
+ .index
+ {
+ font-size: 80%;
+ padding-top: 0px;
+ padding-bottom: 0px;
+ margin-top: 0px;
+ margin-bottom: 0px;
+ margin-left: 0px;
+ }
+
+ .index ul
+ {
+ padding-left: 3em;
+ }
+
+ .index p
+ {
+ padding: 2px;
+ margin: 2px;
+ }
+
+ .index-entry-level-0
+ {
+ font-weight: bold;
+ }
+
+ .index em
+ {
+ font-weight: bold;
+ }
+

Added: sandbox/contract/doc/src/docutils.css
==============================================================================
--- (empty file)
+++ sandbox/contract/doc/src/docutils.css 2013-02-28 18:35:01 EST (Thu, 28 Feb 2013)
@@ -0,0 +1,275 @@
+/*
+:Author: David Goodger
+:Contact: goodger_at_[hidden]
+:Date: $Date: 2007-04-16 21:44:59 -0700 (Mon, 16 Apr 2007) $
+:Revision: $Revision: 37457 $
+:Copyright: This stylesheet has been placed in the public domain.
+
+Default cascading style sheet for the HTML output of Docutils.
+
+See http://docutils.sf.net/docs/howto/html-stylesheets.html for how to
+customize this style sheet.
+*/
+
+/* used to remove borders from tables and images */
+.borderless, table.borderless td, table.borderless th {
+ border: 0 }
+
+table.borderless td, table.borderless th {
+ /* Override padding for "table.docutils td" with "! important".
+ The right padding separates the table cells. */
+ padding: 0 0.5em 0 0 ! important }
+
+.first {
+ /* Override more specific margin styles with "! important". */
+ margin-top: 0 ! important }
+
+.last, .with-subtitle {
+ margin-bottom: 0 ! important }
+
+.hidden {
+ display: none }
+
+a.toc-backref {
+ text-decoration: none ;
+ color: black }
+
+blockquote.epigraph {
+ margin: 2em 5em ; }
+
+dl.docutils dd {
+ margin-bottom: 0.5em }
+
+/* Uncomment (and remove this text!) to get bold-faced definition list terms
+dl.docutils dt {
+ font-weight: bold }
+*/
+
+div.abstract {
+ margin: 2em 5em }
+
+div.abstract p.topic-title {
+ font-weight: bold ;
+ text-align: center }
+
+div.admonition, div.attention, div.caution, div.danger, div.error,
+div.hint, div.important, div.note, div.tip, div.warning {
+ margin: 2em ;
+ border: medium outset ;
+ padding: 1em }
+
+div.admonition p.admonition-title, div.hint p.admonition-title,
+div.important p.admonition-title, div.note p.admonition-title,
+div.tip p.admonition-title {
+ font-weight: bold ;
+ font-family: sans-serif }
+
+div.attention p.admonition-title, div.caution p.admonition-title,
+div.danger p.admonition-title, div.error p.admonition-title,
+div.warning p.admonition-title {
+ color: red ;
+ font-weight: bold ;
+ font-family: sans-serif }
+
+/* Uncomment (and remove this text!) to get reduced vertical space in
+ compound paragraphs.
+div.compound .compound-first, div.compound .compound-middle {
+ margin-bottom: 0.5em }
+
+div.compound .compound-last, div.compound .compound-middle {
+ margin-top: 0.5em }
+*/
+
+div.dedication {
+ margin: 2em 5em ;
+ text-align: center ;
+ font-style: italic }
+
+div.dedication p.topic-title {
+ font-weight: bold ;
+ font-style: normal }
+
+div.figure {
+ margin-left: 2em ;
+ margin-right: 2em }
+
+div.footer, div.header {
+ clear: both;
+ font-size: smaller }
+
+div.line-block {
+ display: block ;
+ margin-top: 1em ;
+ margin-bottom: 1em }
+
+div.line-block div.line-block {
+ margin-top: 0 ;
+ margin-bottom: 0 ;
+ margin-left: 1.5em }
+
+div.sidebar {
+ margin-left: 1em ;
+ border: medium outset ;
+ padding: 1em ;
+ background-color: #ffffee ;
+ width: 40% ;
+ float: right ;
+ clear: right }
+
+div.sidebar p.rubric {
+ font-family: sans-serif ;
+ font-size: medium }
+
+div.system-messages {
+ margin: 5em }
+
+div.system-messages h1 {
+ color: red }
+
+div.system-message {
+ border: medium outset ;
+ padding: 1em }
+
+div.system-message p.system-message-title {
+ color: red ;
+ font-weight: bold }
+
+div.topic {
+ margin: 2em }
+
+h1.section-subtitle, h2.section-subtitle, h3.section-subtitle,
+h4.section-subtitle, h5.section-subtitle, h6.section-subtitle {
+ margin-top: 0.4em }
+
+h1.title {
+ text-align: center }
+
+h2.subtitle {
+ text-align: center }
+
+hr.docutils {
+ width: 75% }
+
+img.align-left {
+ clear: left }
+
+img.align-right {
+ clear: right }
+
+ol.simple, ul.simple {
+ margin-bottom: 1em }
+
+ol.arabic {
+ list-style: decimal }
+
+ol.loweralpha {
+ list-style: lower-alpha }
+
+ol.upperalpha {
+ list-style: upper-alpha }
+
+ol.lowerroman {
+ list-style: lower-roman }
+
+ol.upperroman {
+ list-style: upper-roman }
+
+p.attribution {
+ text-align: right ;
+ margin-left: 50% }
+
+p.caption {
+ font-style: italic }
+
+p.credits {
+ font-style: italic ;
+ font-size: smaller }
+
+p.label {
+ white-space: nowrap }
+
+p.rubric {
+ font-weight: bold ;
+ font-size: larger ;
+ color: maroon ;
+ text-align: center }
+
+p.sidebar-title {
+ font-family: sans-serif ;
+ font-weight: bold ;
+ font-size: larger }
+
+p.sidebar-subtitle {
+ font-family: sans-serif ;
+ font-weight: bold }
+
+p.topic-title {
+ font-weight: bold }
+
+pre.address {
+ margin-bottom: 0 ;
+ margin-top: 0 ;
+ font-family: serif ;
+ font-size: 100% }
+
+pre.literal-block, pre.doctest-block {
+ margin-left: 2em ;
+ margin-right: 2em }
+
+span.classifier {
+ font-family: sans-serif ;
+ font-style: oblique }
+
+span.classifier-delimiter {
+ font-family: sans-serif ;
+ font-weight: bold }
+
+span.interpreted {
+ font-family: sans-serif }
+
+span.option {
+ white-space: nowrap }
+
+span.pre {
+ white-space: pre }
+
+span.problematic {
+ color: red }
+
+span.section-subtitle {
+ /* font-size relative to parent (h1..h6 element) */
+ font-size: 80% }
+
+table.citation {
+ border-left: solid 1px gray;
+ margin-left: 1px }
+
+table.docinfo {
+ margin: 2em 4em }
+
+table.docutils {
+ margin-top: 0.5em ;
+ margin-bottom: 0.5em }
+
+table.footnote {
+ border-left: solid 1px black;
+ margin-left: 1px }
+
+table.docutils td, table.docutils th,
+table.docinfo td, table.docinfo th {
+ padding-left: 0.5em ;
+ padding-right: 0.5em ;
+ vertical-align: top }
+
+table.docutils th.field-name, table.docinfo th.docinfo-name {
+ font-weight: bold ;
+ text-align: left ;
+ white-space: nowrap ;
+ padding-left: 0 }
+
+h1 tt.docutils, h2 tt.docutils, h3 tt.docutils,
+h4 tt.docutils, h5 tt.docutils, h6 tt.docutils {
+ font-size: 100% }
+
+ul.auto-toc {
+ list-style-type: none }

Added: sandbox/contract/doc/src/images/alert.png
==============================================================================
Binary file. No diff available.

Added: sandbox/contract/doc/src/images/blank.png
==============================================================================
Binary file. No diff available.

Added: sandbox/contract/doc/src/images/callouts/1.png
==============================================================================
Binary file. No diff available.

Added: sandbox/contract/doc/src/images/callouts/1.svg
==============================================================================
Binary file. No diff available.

Added: sandbox/contract/doc/src/images/callouts/10.png
==============================================================================
Binary file. No diff available.

Added: sandbox/contract/doc/src/images/callouts/10.svg
==============================================================================
Binary file. No diff available.

Added: sandbox/contract/doc/src/images/callouts/11.png
==============================================================================
Binary file. No diff available.

Added: sandbox/contract/doc/src/images/callouts/11.svg
==============================================================================
Binary file. No diff available.

Added: sandbox/contract/doc/src/images/callouts/12.png
==============================================================================
Binary file. No diff available.

Added: sandbox/contract/doc/src/images/callouts/12.svg
==============================================================================
Binary file. No diff available.

Added: sandbox/contract/doc/src/images/callouts/13.png
==============================================================================
Binary file. No diff available.

Added: sandbox/contract/doc/src/images/callouts/13.svg
==============================================================================
Binary file. No diff available.

Added: sandbox/contract/doc/src/images/callouts/14.png
==============================================================================
Binary file. No diff available.

Added: sandbox/contract/doc/src/images/callouts/14.svg
==============================================================================
Binary file. No diff available.

Added: sandbox/contract/doc/src/images/callouts/15.png
==============================================================================
Binary file. No diff available.

Added: sandbox/contract/doc/src/images/callouts/15.svg
==============================================================================
Binary file. No diff available.

Added: sandbox/contract/doc/src/images/callouts/16.svg
==============================================================================
Binary file. No diff available.

Added: sandbox/contract/doc/src/images/callouts/17.svg
==============================================================================
Binary file. No diff available.

Added: sandbox/contract/doc/src/images/callouts/18.svg
==============================================================================
Binary file. No diff available.

Added: sandbox/contract/doc/src/images/callouts/19.svg
==============================================================================
Binary file. No diff available.

Added: sandbox/contract/doc/src/images/callouts/2.png
==============================================================================
Binary file. No diff available.

Added: sandbox/contract/doc/src/images/callouts/2.svg
==============================================================================
Binary file. No diff available.

Added: sandbox/contract/doc/src/images/callouts/20.svg
==============================================================================
Binary file. No diff available.

Added: sandbox/contract/doc/src/images/callouts/21.svg
==============================================================================
Binary file. No diff available.

Added: sandbox/contract/doc/src/images/callouts/22.svg
==============================================================================
Binary file. No diff available.

Added: sandbox/contract/doc/src/images/callouts/23.svg
==============================================================================
Binary file. No diff available.

Added: sandbox/contract/doc/src/images/callouts/24.svg
==============================================================================
Binary file. No diff available.

Added: sandbox/contract/doc/src/images/callouts/25.svg
==============================================================================
Binary file. No diff available.

Added: sandbox/contract/doc/src/images/callouts/26.svg
==============================================================================
Binary file. No diff available.

Added: sandbox/contract/doc/src/images/callouts/27.svg
==============================================================================
Binary file. No diff available.

Added: sandbox/contract/doc/src/images/callouts/28.svg
==============================================================================
Binary file. No diff available.

Added: sandbox/contract/doc/src/images/callouts/29.svg
==============================================================================
Binary file. No diff available.

Added: sandbox/contract/doc/src/images/callouts/3.png
==============================================================================
Binary file. No diff available.

Added: sandbox/contract/doc/src/images/callouts/3.svg
==============================================================================
Binary file. No diff available.

Added: sandbox/contract/doc/src/images/callouts/30.svg
==============================================================================
Binary file. No diff available.

Added: sandbox/contract/doc/src/images/callouts/4.png
==============================================================================
Binary file. No diff available.

Added: sandbox/contract/doc/src/images/callouts/4.svg
==============================================================================
Binary file. No diff available.

Added: sandbox/contract/doc/src/images/callouts/5.png
==============================================================================
Binary file. No diff available.

Added: sandbox/contract/doc/src/images/callouts/5.svg
==============================================================================
Binary file. No diff available.

Added: sandbox/contract/doc/src/images/callouts/6.png
==============================================================================
Binary file. No diff available.

Added: sandbox/contract/doc/src/images/callouts/6.svg
==============================================================================
Binary file. No diff available.

Added: sandbox/contract/doc/src/images/callouts/7.png
==============================================================================
Binary file. No diff available.

Added: sandbox/contract/doc/src/images/callouts/7.svg
==============================================================================
Binary file. No diff available.

Added: sandbox/contract/doc/src/images/callouts/8.png
==============================================================================
Binary file. No diff available.

Added: sandbox/contract/doc/src/images/callouts/8.svg
==============================================================================
Binary file. No diff available.

Added: sandbox/contract/doc/src/images/callouts/9.png
==============================================================================
Binary file. No diff available.

Added: sandbox/contract/doc/src/images/callouts/9.svg
==============================================================================
Binary file. No diff available.

Added: sandbox/contract/doc/src/images/caution.png
==============================================================================
Binary file. No diff available.

Added: sandbox/contract/doc/src/images/caution.svg
==============================================================================
Binary file. No diff available.

Added: sandbox/contract/doc/src/images/draft.png
==============================================================================
Binary file. No diff available.

Added: sandbox/contract/doc/src/images/home.png
==============================================================================
Binary file. No diff available.

Added: sandbox/contract/doc/src/images/home.svg
==============================================================================
Binary file. No diff available.

Added: sandbox/contract/doc/src/images/important.png
==============================================================================
Binary file. No diff available.

Added: sandbox/contract/doc/src/images/important.svg
==============================================================================
Binary file. No diff available.

Added: sandbox/contract/doc/src/images/next.png
==============================================================================
Binary file. No diff available.

Added: sandbox/contract/doc/src/images/next.svg
==============================================================================
Binary file. No diff available.

Added: sandbox/contract/doc/src/images/next_disabled.png
==============================================================================
Binary file. No diff available.

Added: sandbox/contract/doc/src/images/note.png
==============================================================================
Binary file. No diff available.

Added: sandbox/contract/doc/src/images/note.svg
==============================================================================
Binary file. No diff available.

Added: sandbox/contract/doc/src/images/prev.png
==============================================================================
Binary file. No diff available.

Added: sandbox/contract/doc/src/images/prev.svg
==============================================================================
Binary file. No diff available.

Added: sandbox/contract/doc/src/images/prev_disabled.png
==============================================================================
Binary file. No diff available.

Added: sandbox/contract/doc/src/images/smiley.png
==============================================================================
Binary file. No diff available.

Added: sandbox/contract/doc/src/images/tip.png
==============================================================================
Binary file. No diff available.

Added: sandbox/contract/doc/src/images/tip.svg
==============================================================================
Binary file. No diff available.

Added: sandbox/contract/doc/src/images/toc-blank.png
==============================================================================
Binary file. No diff available.

Added: sandbox/contract/doc/src/images/toc-minus.png
==============================================================================
Binary file. No diff available.

Added: sandbox/contract/doc/src/images/toc-plus.png
==============================================================================
Binary file. No diff available.

Added: sandbox/contract/doc/src/images/up.png
==============================================================================
Binary file. No diff available.

Added: sandbox/contract/doc/src/images/up.svg
==============================================================================
Binary file. No diff available.

Added: sandbox/contract/doc/src/images/up_disabled.png
==============================================================================
Binary file. No diff available.

Added: sandbox/contract/doc/src/images/warning.png
==============================================================================
Binary file. No diff available.

Added: sandbox/contract/doc/src/images/warning.svg
==============================================================================
Binary file. No diff available.

Added: sandbox/contract/doc/src/minimal.css
==============================================================================
--- (empty file)
+++ sandbox/contract/doc/src/minimal.css 2013-02-28 18:35:01 EST (Thu, 28 Feb 2013)
@@ -0,0 +1,23 @@
+/*
+
+ © Copyright Beman Dawes, 2007
+
+ Distributed under the Boost Software License, Version 1.0.
+ See www.boost.org/LICENSE_1_0.txt
+
+*/
+
+body {
+ font-family: sans-serif;
+ margin: 1em;
+ max-width : 8.5in;
+ }
+
+table { margin: 0.5em; }
+
+pre { background-color:#D7EEFF }
+
+ins { background-color:#A0FFA0 }
+del { background-color:#FFA0A0 }
+
+/*** end ***/
\ No newline at end of file

Added: sandbox/contract/doc/src/reference.css
==============================================================================
--- (empty file)
+++ sandbox/contract/doc/src/reference.css 2013-02-28 18:35:01 EST (Thu, 28 Feb 2013)
@@ -0,0 +1,11 @@
+/*============================================================================
+ Copyright 2003-2004 Douglas Gregor
+ Distributed under the Boost Software License, Version 1.0. (See accompany-
+ ing file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)
+============================================================================*/
+
+PRE.synopsis {
+ background-color: #e0ffff;
+ border: thin solid blue;
+ padding: 1em
+}
\ No newline at end of file

Added: sandbox/contract/doc/test/HTML4_symbols.qbk
==============================================================================
--- (empty file)
+++ sandbox/contract/doc/test/HTML4_symbols.qbk 2013-02-28 18:35:01 EST (Thu, 28 Feb 2013)
@@ -0,0 +1,253 @@
+[/ File Latin1_symbols.qbk
+Copyright 2006-2007 Paul A. Bristow.
+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).
+]
+
+
+[/ Symbols and Greek letters (about 120) from HTML4 ]
+[/ File HTML4_symbols.qbk]
+[/ See http://www.htmlhelp.com/reference/html40/entities/symbols.html]
+[/ All (except 2 angle brackets) show OK on Firefox 2.0]
+
+[/ Also some miscellaneous math charaters added to this list - see the end.]
+
+[/ To use, enclose the template name in square brackets.]
+
+[template fnof[]'''ƒ'''] [/ ï¿½ Latin small f with hook = function = florin]
+[template Alpha[]'''Α'''] [/ ? Greek capital letter alpha]
+[template Beta[]'''Β'''] [/ ? Greek capital letter beta]
+[template Gamma[]'''Γ'''] [/ G Greek capital letter gamma]
+[template Delta[]'''Δ'''] [/ ? Greek capital letter delta]
+[template Epsilon[]'''Ε'''] [/ ? Greek capital letter epsilon]
+[template Zeta[]'''Ζ'''] [/ ? Greek capital letter zeta]
+[template Eta[]'''Η'''] [/ ? Greek capital letter eta]
+[template Theta[]'''Θ'''] [/ T Greek capital letter theta]
+[template Iota[]'''Ι'''] [/ ? Greek capital letter iota]
+[template Kappa[]'''Κ'''] [/ ? Greek capital letter kappa]
+[template Lambda[]'''Λ'''] [/ ? Greek capital letter lambda]
+[template Mu[]'''Μ'''] [/ ? Greek capital letter mu]
+[template Nu[]'''Ν'''] [/ ? Greek capital letter nu]
+[template Xi[]'''Ξ'''] [/ ? Greek capital letter xi]
+[template Omicron[]'''Ο'''] [/ ? Greek capital letter omicron]
+[template Pi[]'''Π'''] [/ ? Greek capital letter pi]
+[template Rho[]'''Ρ'''] [/ ? Greek capital letter rho]
+[template Sigma[]'''Σ'''] [/ S Greek capital letter sigma]
+[template Tau[]'''Τ'''] [/ ? Greek capital letter tau]
+[template Upsilon[]'''Υ'''] [/ ? Greek capital letter upsilon]
+[template Phi[]'''Φ'''] [/ F Greek capital letter phi]
+[template Chi[]'''Χ'''] [/ ? Greek capital letter chi]
+[template Psi[]'''Ψ'''] [/ ? Greek capital letter psi]
+[template Omega[]'''Ω'''] [/ O Greek capital letter omega]
+[template alpha[]'''α'''] [/ a Greek small letter alpha]
+[template beta[]'''β'''] [/ ï¿½ Greek small letter beta]
+[template gamma[]'''γ'''] [/ ? Greek small letter gamma]
+[template delta[]'''δ'''] [/ d Greek small letter delta]
+[template epsilon[]'''ε'''] [/ e Greek small letter epsilon]
+[template zeta[]'''ζ'''] [/ ? Greek small letter zeta]
+[template eta[]'''η'''] [/ ? Greek small letter eta]
+[template theta[]'''θ'''] [/ ? Greek small letter theta]
+[template iota[]'''ι'''] [/ ? Greek small letter iota]
+[template kappa[]'''κ'''] [/ ? Greek small letter kappa]
+[template lambda[]'''λ'''] [/ ? Greek small letter lambda]
+[template mu[]'''μ'''] [/ ï¿½ Greek small letter mu]
+[template nu[]'''ν'''] [/ ? Greek small letter nu]
+[template xi[]'''ξ'''] [/ ? Greek small letter xi]
+[template omicron[]'''ο'''] [/ ? Greek small letter omicron]
+[template pi[]'''π'''] [/ p Greek small letter pi]
+[template rho[]'''ρ'''] [/ ? Greek small letter rho]
+[template sigmaf[]'''ς'''] [/ ? Greek small letter final sigma]
+[template sigma[]'''σ'''] [/ s Greek small letter sigma]
+[template tau[]'''τ'''] [/ t Greek small letter tau]
+[template upsilon[]'''υ'''] [/ ? Greek small letter upsilon]
+[template phi[]'''φ'''] [/ f Greek small letter phi]
+[template chi[]'''χ'''] [/ ? Greek small letter chi]
+[template psi[]'''ψ'''] [/ ? Greek small letter psi]
+[template omega[]'''ω'''] [/ ? Greek small letter omega]
+[template thetasym[]'''ϑ'''] [/ ? Greek small letter theta symbol]
+[template upsih[]'''ϒ'''] [/ ? Greek upsilon with hook symbol]
+[template piv[]'''ϖ'''] [/ ? Greek pi symbol]
+[template bull[]'''•'''] [/ ï¿½ bullet = black small circle]
+[template hellip[]'''…'''] [/ ï¿½ horizontal ellipsis = three dot leader]
+[template prime[]'''′'''] [/ ' prime = minutes = feet]
+[template Prime[]'''″'''] [/ ? double prime = seconds = inches]
+[template oline[]'''‾'''] [/ ? overline = spacing overscore]
+[template frasl[]'''⁄'''] [/ / fraction slash]
+[template weierp[]'''℘'''] [/ P script capital P = power set = Weierstrass p]
+[template image[]'''ℑ'''] [/ I blackletter capital I = imaginary part]
+[template real[]'''ℜ'''] [/ R blackletter capital R = real part symbol]
+[template trade[]'''™'''] [/ ï¿½ trade mark sign]
+[template alefsym[]'''ℵ'''] [/ ? alef symbol = first transfinite cardinal]
+[template larr[]'''←'''] [/ ? leftwards arrow]
+[template uarr[]'''↑'''] [/ ? upwards arrow]
+[template rarr[]'''→'''] [/ ? rightwards arrow]
+[template darr[]'''↓'''] [/ ? downwards arrow]
+[template harr[]'''↔'''] [/ ? left right arrow]
+[template crarr[]'''↵'''] [/ ? downwards arrow with corner leftwards = CR]
+[template lArr[]'''⇐'''] [/ ? leftwards double arrow]
+[template uArr[]'''⇑'''] [/ ? upwards double arrow]
+[template rArr[]'''⇒'''] [/ ? rightwards double arrow]
+[template dArr[]'''⇓'''] [/ ? downwards double arrow]
+[template hArr[]'''⇔'''] [/ ? left right double arrow]
+[template forall[]'''∀'''] [/ ? for all]
+[template part[]'''∂'''] [/ ? partial differential]
+[template exist[]'''∃'''] [/ ? there exists]
+[template empty[]'''∅'''] [/ ï¿½ empty set = null set = diameter]
+[template nabla[]'''∇'''] [/ ? nabla = backward difference]
+[template isin[]'''∈'''] [/ ? element of]
+[template notin[]'''∉'''] [/ ? not an element of]
+[template ni[]'''∋'''] [/ ? contains as member]
+[template prod[]'''∏'''] [/ ? n-ary product = product sign]
+[template sum[]'''∑'''] [/ ? n-ary sumation]
+[template minus[]'''−'''] [/ - minus sign]
+[template lowast[]'''∗'''] [/ * asterisk operator]
+[template radic[]'''√'''] [/ v square root = radical sign]
+[template prop[]'''∝'''] [/ ? proportional to]
+[template infin[]'''∞'''] [/ 8 infinity]
+[template ang[]'''∠'''] [/ ? angle]
+[template and[]'''∧'''] [/ ? logical and = wedge]
+[template or[]'''∨'''] [/ ? logical or = vee]
+[template cap[]'''∩'''] [/ n intersection = cap]
+[template cup[]'''∪'''] [/ ? union = cup]
+[template int[]'''∫'''] [/ ? integral]
+[template there4[]'''∴'''] [/ ? therefore]
+[template sim[]'''∼'''] [/ ~ tilde operator = varies with = similar to]
+[template cong[]'''≅'''] [/ ? approximately equal to]
+[template asymp[]'''≈'''] [/ ï¿½ almost equal to = asymptotic to]
+[template ne[]'''≠'''] [/ ? not equal to]
+[template equiv[]'''≡'''] [/ = identical to]
+[template le[]'''≤'''] [/ = less-than or equal to]
+[template ge[]'''≥'''] [/ = greater-than or equal to]
+[template subset[]'''⊂'''] [/ ? subset of]
+[template superset[]'''⊃'''] [/ ? superset of]
+[template nsubset[]'''⊄'''] [/ ? not a subset of]
+[template sube[]'''⊆'''] [/ ? subset of or equal to]
+[template supe[]'''⊇'''] [/ ? superset of or equal to]
+[template oplus[]'''⊕'''] [/ ? circled plus = direct sum]
+[template otimes[]'''⊗'''] [/ ? circled times = vector product]
+[template perp[]'''⊥'''] [/ ? up tack = orthogonal to = perpendicular]
+[template sdot[]'''⋅'''] [/ ï¿½ dot operator]
+[template lceil[]'''⌈'''] [/ ? left ceiling = APL upstile]
+[template rceil[]'''⌉'''] [/ ? right ceiling]
+[template lfloor[]'''⌊'''] [/ ? left floor = APL downstile]
+[template rfloor[]'''⌋'''] [/ ? right floor]
+[template lang[]'''〈'''] [/ < left-pointing angle bracket = bra (Firefox shows ?)]
+[template rang[]'''〉'''] [/ > right-pointing angle bracket = ket (Firefox shows ?)]
+[template loz[]'''◊'''] [/ ? lozenge]
+[template spades[]'''♠'''] [/ ? black spade suit]
+[template clubs[]'''♣'''] [/ ? black club suit = shamrock]
+[template hearts[]'''♥'''] [/ ? black heart suit = valentine]
+[template diams[]'''♦'''] [/ ? black diamond suit]
+
+[/ Other symbols, not in the HTML4 list:]
+[template space[]''' ''']
+[template plusminus[]'''±'''] [/ ? plus or minus sign]
+
+
+[/ Symbols and accented letters from Latin-1]
+[/ File Latin1_symbols.qbk]
+[/ http://www.htmlhelp.com/reference/html40/entities/latin1.html ]
+[/ based on table Copyright </copyright.html> 1998-2006 Liam Quinn.]
+[/ Glyphs <http://www.unicode.org/charts/> of the characters ]
+[/ are available at the Unicode Consortium <http://www.unicode.org/>. ]
+
+[template nbsp[]''' '''] [/ no-break space = non-breaking space]
+[template iexcl[]'''¡'''] [/ inverted exclamation mark ]
+[template cent[]'''¢'''] [/ cent sign ]
+[template pound[]'''£'''] [/ pound sign ]
+[template curren[]'''¤'''] [/ currency sign ]
+[template yen[]'''¥'''] [/ yen sign = yuan sign ]
+[template brvbar[]'''¦'''] [/ broken vertical bar ]
+[template sectsign[]'''§'''] [/ section sign ]
+[template uml[]'''¨'''] [/ diaeresis ]
+[template copy[]'''©'''] [/ copyright ]
+[template ordf[]'''ª'''] [/ feminine ordinal indicator ]
+[template laquo[]'''«'''] [/ left-pointing double angle quotation mark = left pointing guillemet ]
+[template not[]'''¬'''] [/ not sign ]
+[template shy[]''''''] [/ soft hyphen = discretionary hyphen ]
+[template reg[]'''®'''] [/ registered sign = registered trade mark sign ]
+[template macron[]'''¯'''] [/ macron = spacing macron = overline = APL overbar ]
+[template deg[]'''°'''] [/ degree sign ]
+[template plusmn[]'''±'''] [/ plus-minus sign = plus-or-minus sign ]
+[template sup2[]'''²'''] [/ superscript two = superscript digit two = squared ]
+[template cubed[]'''³'''] [/ superscript three = superscript digit three = cubed ]
+[template acute[]'''´'''] [/ acute accent = spacing acute ]
+[template micro[]'''µ'''] [/ micro sign ]
+[template para[]'''¶'''] [/ pilcrow sign = paragraph sign ]
+[template middot[]'''·'''] [/ middle dot = Georgian comma = Greek middle dot ]
+[template cedil[]'''¸'''] [/ cedilla = spacing cedilla ]
+[template sup1[]'''¹'''] [/ superscript one = superscript digit one ]
+[template ordm[]'''º'''] [/ masculine ordinal indicator ]
+[template raquo[]'''»'''] [/ right-pointing double angle quotation mark = right pointing guillemet ]
+[template frac14[]'''¼'''] [/ vulgar fraction one quarter = fraction one quarter ]
+[template frac12[]'''½'''] [/ vulgar fraction one half = fraction one half ]
+[template frac34[]'''¾'''] [/vulgar fraction three quarters = fraction three quarters ]
+[template iquest[]'''¿'''] [/ inverted question mark = turned question mark ]
+[template Agrave[]'''À'''] [/ Latin capital letter A with grave = Latin capital letter A grave ]
+[template Aacute[]'''Á'''] [/ Latin capital letter A with acute = Latin capital letter A acute ]
+[template Acirc[]'''Â'''] [/ Latin capital letter A with circumflex ]
+[template Atilde[]'''Ã'''] [/Latin capital letter A with tilde ]
+[template Auml[]'''Ä'''] [/ Latin capital letter A with diaeresis ]
+[template Aring[]'''Å'''] [/ Latin capital letter A with ring above = Latin capital letter A ring ]
+[template AElig[]'''Æ'''] [/ Latin capital letter AE = Latin capital ligature AE ]
+[template Ccedil[]'''Ç'''] [/ Latin capital letter C with cedilla ]
+[template Egrave[]'''È'''] [/ Latin capital letter E with grave ]
+[template Eacute[]'''É'''] [/ Latin capital letter E with acute ]
+[template Ecirc[]'''Ê'''] [/ Latin capital letter E with circumflex ]
+[template Euml[]'''Ë'''] [/ Latin capital letter E with diaeresis ]
+[template Igrave[]'''Ì'''] [/ Latin capital letter I with grave ]
+[template Iacute[]'''Í'''] [/ Latin capital letter I with acute ]
+[template Icirc[]'''Î'''] [/ Latin capital letter I with circumflex ]
+[template Iuml[]'''Ï'''] [/ Latin capital letter I with diaeresis ]
+[template ETH[]'''Ð'''] [/ Latin capital letter ETH ]
+[template Ntilde[]'''Ñ'''] [/ Latin capital letter N with tilde ]
+[template Ograve[]'''Ò'''] [/ Latin capital letter O with grave]
+[template Oacute[]'''Ó'''] [/ Latin capital letter O with acute ]
+[template Ocirc[]'''Ô'''] [/ Latin capital letter O with circumflex ]
+[template Otilde[]'''Õ'''] [/ Latin capital letter O with tilde ]
+[template Ouml[]'''Ö'''] [/ Latin capital letter O with diaeresis ]
+[template times[]'''×'''] [/ multiplication sign ]
+[template Oslash[]'''Ø'''] [/ Latin capital letter O with stroke = Latin capital letter O slash ]
+[template Ugrave[]'''Ù'''] [/ Latin capital letter U with grave ]
+[template Uacute[]'''Ú'''] [/ Latin capital letter U with acute ]
+[template Ucirc[]'''Û'''] [/ Latin capital letter U with circumflex ]
+[template Uuml[]'''Ü'''] [/ Latin capital letter U with diaeresis ]
+[template Yacute[]'''Ý'''] [/ Latin capital letter Y with acute ]
+[template THORN[]'''Þ'''] [/ Latin capital letter THORN ]
+[template szlig[]'''ß'''] [/ Latin small letter sharp s = ess-zed ]
+[template agrave[]'''à'''] [/ Latin small letter a with grave = Latin small letter a grave ]
+[template aacute[]'''á'''] [/ Latin small letter a with acute ]
+[template acirc[]'''â'''] [/ Latin small letter a with circumflex ]
+[template atilde[]'''ã'''] [/ Latin small letter a with tilde ]
+[template auml[]'''ä'''] [/ Latin small letter a with diaeresis ]
+[template aring[]'''å'''] [/ Latin small letter a with ring above = Latin small letter a ring ]
+[template aelig[]'''æ'''] [/ Latin small letter ae = Latin small ligature ae ]
+[template ccedil[]'''ç'''] [/ Latin small letter c with cedilla ]
+[template egrave[]'''è'''] [/ Latin small letter e with grave ]
+[template eacute[]'''é'''] [/ Latin small letter e with acute ]
+[template ecirc[]'''ê'''] [/ Latin small letter e with circumflex ]
+[template euml[]'''ë'''] [/ Latin small letter e with diaeresis ]
+[template igrave[]'''ì'''] [/ Latin small letter i with grave ]
+[template iacute[]'''í'''] [/ Latin small letter i with acute ]
+[template icirc[]'''î'''] [/ Latin small letter i with circumflex ]
+[template iuml[]'''ï'''] [/ Latin small letter i with diaeresis ]
+[template eth[]'''ð'''] [/ Latin small letter eth ]
+[template ntilde[]'''ñ'''] [/ Latin small letter n with tilde ]
+[template ograve[]'''ò'''] [/Latin small letter o with grave ]
+[template oacute[]'''ó'''] [/ Latin small letter o with acute ]
+[template ocirc[]'''ô'''] [/ Latin small letter o with circumflex ]
+[template otilde[]'''õ'''] [/ Latin small letter o with tilde ]
+[template ouml[]'''ö'''] [/ Latin small letter o with diaeresis ]
+[template divide[]'''÷'''] [/ division sign ]
+[template oslash[]'''ø'''] [/ Latin small letter o with stroke = Latin small letter o slash ]
+[template ugrave[]'''ù'''] [/ Latin small letter u with grave ]
+[template uacute[]'''ú'''] [/ Latin small letter u with acute ]
+[template ucirc[]'''û'''] [/ Latin small letter u with circumflex ]
+[template uuml[]'''ü'''] [/ Latin small letter u with diaeresis ]
+[template yacute[]'''ý'''] [/ Latin small letter y with acute ]
+[template thorn[]'''þ'''] [/ Latin small letter thorn ]
+[template yuml[]'''ÿ'''] [/ Latin small letter y with diaeresis ]
+
+
+

Added: sandbox/contract/doc/test/Jamfile.v2
==============================================================================
--- (empty file)
+++ sandbox/contract/doc/test/Jamfile.v2 2013-02-28 18:35:01 EST (Thu, 28 Feb 2013)
@@ -0,0 +1,207 @@
+# Copyright John Maddock 2008. Use, modification, and distribution are
+# subject to 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)
+
+import os ;
+import common ;
+import doxygen ;
+using quickbook ;
+import modules ;
+
+path-constant images_location : html ;
+
+#
+# Accumulators docs are dependent upon
+# latex dvips and ps being in your PATH.
+# This is true for most Unix installs, but
+# not on Win32, where you will need to install
+# MkTex and Ghostscript and add these tools
+# to your path.
+#
+make latex.check : : @check-latex ;
+actions check-latex
+{
+ latex -version > latex.version
+}
+
+make dvips.check : : @check-dvips ;
+actions check-dvips
+{
+ dvips -version > dvips.version
+}
+
+make gs.check : : @check-gs ;
+
+import os ;
+
+if [ os.name ] = "NT"
+{
+ actions check-gs
+ {
+ gswin32c -version > gs.version
+ }
+}
+else
+{
+ actions check-gs
+ {
+ gs -version > gs.version
+ }
+}
+
+
+# Use Doxygen to emit a tagfile with the definition of depends_on<>. That
+# tagfile will be used by Doxygen below when generating the Statistics Library
+# Reference. This is all so that the Doxygen-generated documentation for the
+# features shows the dependency relationships between them.
+doxygen tagfile
+ :
+ ../../boost/accumulators/framework/depends_on.hpp
+ ../../boost/accumulators/framework/extractor.hpp
+ :
+ <doxygen:param>MACRO_EXPANSION=YES
+ <doxygen:param>EXPAND_ONLY_PREDEF=YES
+ <doxygen:param>GENERATE_TAGFILE=accumulators.tag
+ <doxygen:param>"PREDEFINED=\"BOOST_ACCUMULATORS_DOXYGEN_INVOKED=1\" \\
+ \"BOOST_PP_REPEAT_FROM_TO(a,b,c,d)=\" \\
+ \"BOOST_PP_ENUM_PARAMS(a,b)=b ## 1, b ## 2, ...\""
+ <dependency>latex.check
+ <dependency>dvips.check
+ <dependency>gs.check
+ ;
+
+# Generate the HTML form of the stats documentation, as this causes Doxygen to
+# generate .png images for the LaTeX formulas embedded in the doc comments.
+doxygen statsdoc.html
+ :
+ weighted_tail_quantile.hpp
+ :
+ <dependency>latex.check
+ <dependency>dvips.check
+ <dependency>gs.check
+ ;
+
+if [ os.name ] = NT
+{
+ CP = copy /y ;
+ MKDIR = mkdir ;
+ FROM = \\..\\..\\..\\html\\statsdoc\\*.png ;
+ TOHTML = .\\html\\images\\accumulators ;
+ TOPDF = \\images\\accumulators ;
+}
+else
+{
+ CP = cp ;
+ MKDIR = mkdir -p ;
+ FROM = /../../html/statsdoc/*.png ;
+ TOHTML = ./html/images/accumulators ;
+ TOPDF = /images/accumulators ;
+}
+
+actions copy-latex-pngs
+{
+ $(MKDIR) $(TOHTML)
+ $(MKDIR) $(<:D)$(TOPDF)
+ $(CP) $(<:D)$(FROM) $(TOHTML)
+ $(CP) $(<:D)$(FROM) $(<:D)$(TOPDF)
+ echo "Stamped" > "$(<)"
+}
+
+# This causes the png files built above to be copied into the
+# html/images/accumulators directory.
+make statsdoclatex.tag
+ : statsdoc.html
+ : @copy-latex-pngs
+ ;
+
+doxygen statsdoc
+ :
+ weighted_tail_quantile.hpp
+ :
+ <doxygen:param>EXTRACT_ALL=YES
+ <doxygen:param>"PREDEFINED=\"BOOST_ACCUMULATORS_DOXYGEN_INVOKED=1\" \\
+ \"BOOST_PP_REPEAT_FROM_TO(a,b,c,d)=\" \\
+ \"BOOST_PP_REPEAT(a,b,c)=\" \\
+ \"BOOST_PARAMETER_KEYWORD(a,b)=\\
+ namespace a { struct b {}; } \\
+ boost::parameter::keyword<a::b> const b;\" \\
+ \"BOOST_PP_ENUM_PARAMS(a,b)=b ## 1, b ## 2, ...\""
+ <doxygen:param>HIDE_UNDOC_MEMBERS=NO
+ <doxygen:param>EXTRACT_PRIVATE=NO
+ <doxygen:param>ENABLE_PREPROCESSING=YES
+ <doxygen:param>MACRO_EXPANSION=YES
+ <doxygen:param>EXPAND_ONLY_PREDEF=YES
+ <doxygen:param>SEARCH_INCLUDES=NO
+ <doxygen:param>TAGFILES=accumulators.tag
+ <xsl:param>boost.doxygen.header.prefix=doc
+ <xsl:param>boost.doxygen.formuladir=images/accumulators/
+ <reftitle>"Statistics Library Reference"
+ <dependency>tagfile
+ <dependency>statsdoclatex.tag
+ <dependency>latex.check
+ <dependency>dvips.check
+ <dependency>gs.check
+ ;
+
+if htmlhelp in [ modules.peek : ARGV ]
+{
+ #
+ # Start with a rule to convert htmlhelp project into
+ # compiled help file:
+ #
+ make htmlhelp/htmlhelp.chm : standalone : @hhc ;
+ actions ignore hhc
+ {
+ hhc htmlhelp/htmlhelp.hhp
+ }
+ #
+ # These install rules copy our images into a subdirectory of the created
+ # htmlhelp project directory: unfortunately hhc.exe will only embed
+ # images in a subdirectory of the project root.
+ #
+ install htmlhelp1 : [ glob html/images/*.png ] : <location>htmlhelp/images ;
+ install htmlhelp1a : [ glob html/images/*.svg ] : <location>htmlhelp/images ;
+ install htmlhelp2 : [ glob html/images/accumulators/*.png ] : <dependency>statsdoc <location>htmlhelp/images/accumulators ;
+ install htmlhelp3 : [ glob ../src/images/*.png ] : <dependency>statsdoc <location>htmlhelp/images ;
+ install htmlhelp4 : [ glob ../src/images/callouts/*.png ] : <dependency>statsdoc <location>htmlhelp/images/callouts ;
+}
+
+xml test : test.qbk ;
+boostbook standalone
+ :
+ test
+ :
+ <dependency>statsdoc
+ <format>htmlhelp:<dependency>htmlhelp1
+ <format>htmlhelp:<dependency>htmlhelp1a
+ <format>htmlhelp:<dependency>htmlhelp2
+ <format>htmlhelp:<dependency>htmlhelp3
+ <format>htmlhelp:<dependency>htmlhelp4
+
+ # HTML options first:
+ #======================================================================
+
+ <xsl:param>toc.max.depth=2
+ <xsl:param>toc.section.depth=2
+ <xsl:param>chunk.section.depth=1
+ <xsl:param>boost.root=../../..
+ <xsl:param>navig.graphics=1
+ <xsl:param>boost.mathjax=1
+ <xsl:path>$(images_location)/..
+
+
+ # PDF Options:
+ #======================================================================
+ <format>pdf:<xsl:param>img.src.path=$(images_location)/
+ <format>pdf:<xsl:param>boost.url.prefix=http://www.boost.org/doc/libs/release/doc/test/html
+
+ # HTML Help Options:
+ #======================================================================
+ #<format>htmlhelp:<xsl:param>img.src.path=../html
+ <format>htmlhelp:<xsl:param>boost.url.prefix=http://www.boost.org/doc/libs/release/doc/test/html
+ <format>htmlhelp:<xsl:param>htmlhelp.chm=test.chm
+ ;
+
+
+install pdfinstall : standalone/<format>pdf : <location>. <install-type>PDF ;
+explicit pdfinstall ;

Added: sandbox/contract/doc/test/array.xml
==============================================================================
--- (empty file)
+++ sandbox/contract/doc/test/array.xml 2013-02-28 18:35:01 EST (Thu, 28 Feb 2013)
@@ -0,0 +1,64 @@
+<section id="array.intro">
+ <title>Introduction</title>
+
+ <using-namespace name="boost"/>
+ <using-class name="array"/>
+
+ <para>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).</para>
+
+ <para>As replacement for ordinary arrays, the STL provides class
+ <code><classname>std::vector</classname></code>. However,
+ <code><classname>std::vector<></classname></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.</para>
+
+ <para>In his book, <emphasis>Generic Programming and the
+ STL</emphasis>, Matthew H. Austern introduces a useful wrapper
+ class for ordinary arrays with static size, called
+ <code>block</code>. It is safer and has no worse performance than
+ ordinary arrays. In <emphasis>The C++ Programming
+ Language</emphasis>, 3rd edition, Bjarne Stroustrup introduces a
+ similar class, called <code>c_array</code>, which I (<ulink
+ url="http://www.josuttis.com">Nicolai Josuttis</ulink>) present
+ slightly modified in my book <emphasis>The C++ Standard Library -
+ A Tutorial and Reference</emphasis>, called
+ <code>carray</code>. This is the essence of these approaches
+ spiced with many feedback from <ulink
+ url="http://www.boost.org">boost</ulink>.</para>
+
+ <para>After considering different names, we decided to name this
+ class simply <code><classname>array</classname></code>.</para>
+
+ <para>Note that this class is suggested to be part of the next
+ Technical Report, which will extend the C++ Standard (see
+ <ulink url="http://std.dkuug.dk/jtc1/sc22/wg21/docs/papers/2003/n1548.htm">http://std.dkuug.dk/jtc1/sc22/wg21/docs/papers/2003/n1548.htm>).</para>
+
+ <para>Class <code><classname>array</classname></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:
+ <itemizedlist spacing="compact">
+ <listitem><simpara>No constructors are provided.</simpara></listitem>
+ <listitem><simpara>Elements may have an undetermined initial value (see <xref linkend="array.rationale"/>).</simpara></listitem>
+ <listitem><simpara><functionname>swap</functionname>() has no constant complexity.</simpara></listitem>
+ <listitem><simpara><methodname>size</methodname>() is always constant, based on the second template argument of the type.</simpara></listitem>
+ <listitem><simpara>The container provides no allocator support.</simpara></listitem>
+ </itemizedlist>
+ </para>
+
+ <para>It doesn't fulfill the requirements of a "sequence" (see Section 23.1.1, [lib.sequence.reqmts] of the C++ Standard), except that:
+ <itemizedlist spacing="compact">
+ <listitem><simpara><methodname>front</methodname>() and <methodname>back</methodname>() are provided.</simpara></listitem>
+ <listitem><simpara><methodname>operator[]</methodname> and <methodname>at</methodname>() are provided.</simpara></listitem>
+ </itemizedlist>
+ </para>
+ </section>
+
+
+

Added: sandbox/contract/doc/test/array1.xml
==============================================================================
--- (empty file)
+++ sandbox/contract/doc/test/array1.xml 2013-02-28 18:35:01 EST (Thu, 28 Feb 2013)
@@ -0,0 +1,511 @@
+<library-reference>
+ <header name="boost/array.hpp">
+ <namespace name="boost">
+ <class name="array">
+ <template>
+ <template-type-parameter name="T"/>
+ <template-nontype-parameter name="N">
+ <type>std::size_t</type>
+ </template-nontype-parameter>
+ </template>
+
+ <purpose>
+ <para>STL compliant container wrapper for arrays of constant size</para>
+ </purpose>
+ <typedef name="value_type">
+ <type>T</type>
+ </typedef>
+ <typedef name="iterator">
+ <type>T*</type>
+ </typedef>
+ <typedef name="const_iterator">
+ <type>const T*</type>
+ </typedef>
+ <typedef name="reverse_iterator">
+ <type>
+ <classname>std::reverse_iterator</classname><iterator>
+ </type>
+ </typedef>
+ <typedef name="const_reverse_iterator">
+ <type>
+ <classname>std::reverse_iterator</classname><const_iterator>
+ </type>
+ </typedef>
+ <typedef name="reference">
+ <type>T&</type>
+ </typedef>
+ <typedef name="const_reference">
+ <type>const T&</type>
+ </typedef>
+ <typedef name="size_type">
+ <type>std::size_t</type>
+ </typedef>
+ <typedef name="difference_type">
+ <type>std::ptrdiff_t</type>
+ </typedef>
+
+ <static-constant name="static_size">
+ <type>size_type</type>
+ <default>N</default>
+ </static-constant>
+
+ <copy-assignment>
+ <template>
+ <template-type-parameter name="U"/>
+ </template>
+ <parameter name="other">
+ <paramtype>const <classname>array</classname><U, N>&</paramtype>
+ </parameter>
+ <effects>
+ <simpara>
+ <code>
+ std::copy(rhs.<methodname>begin</methodname>(),rhs.<methodname>end</methodname>(), <methodname>begin</methodname>())
+ </code>
+ </simpara>
+ </effects>
+ </copy-assignment>
+
+ <method-group name="iterator support">
+ <overloaded-method name="begin">
+ <signature>
+ <type>iterator</type>
+ </signature>
+ <signature cv="const">
+ <type>const_iterator</type>
+ </signature>
+
+ <returns>
+ <simpara>iterator for the first element</simpara>
+ </returns>
+ <throws>
+ <simpara>will not throw</simpara>
+ </throws>
+ </overloaded-method>
+
+ <overloaded-method name="end">
+ <signature>
+ <type>iterator</type>
+ </signature>
+ <signature cv="const">
+ <type>const_iterator</type>
+ </signature>
+
+ <returns>
+ <simpara>iterator for position after the last element</simpara>
+ </returns>
+ <throws>
+ <simpara>will not throw</simpara>
+ </throws>
+ </overloaded-method>
+ </method-group>
+
+ <method-group name="reverse iterator support">
+ <overloaded-method name="rbegin">
+ <signature>
+ <type>reverse_iterator</type>
+ </signature>
+ <signature cv="const">
+ <type>const_reverse_iterator</type>
+ </signature>
+
+ <returns>
+ <simpara>reverse iterator for the first element of reverse iteration</simpara>
+ </returns>
+ </overloaded-method>
+
+ <overloaded-method name="rend">
+ <signature>
+ <type>reverse_iterator</type>
+ </signature>
+ <signature cv="const">
+ <type>const_reverse_iterator</type>
+ </signature>
+
+ <returns>
+ <simpara>reverse iterator for position after the last element in reverse iteration</simpara>
+ </returns>
+ </overloaded-method>
+ </method-group>
+
+ <method-group name="capacity">
+ <method name="size">
+ <type>size_type</type>
+ <returns>
+ <simpara>
+ <code>N</code>
+ </simpara>
+ </returns>
+ </method>
+ <method name="empty">
+ <type>bool</type>
+ <returns>
+ <simpara>
+ <code>N==0</code>
+ </simpara>
+ </returns>
+ <throws>
+ <simpara>will not throw</simpara>
+ </throws>
+ </method>
+ <method name="max_size">
+ <type>size_type</type>
+ <returns>
+ <simpara>
+ <code>N</code>
+ </simpara>
+ </returns>
+ <throws>
+ <simpara>will not throw</simpara>
+ </throws>
+ </method>
+ </method-group>
+
+ <method-group name="element access">
+ <overloaded-method name="operator[]">
+ <signature>
+ <type>reference</type>
+ <parameter name="i">
+ <paramtype>size_type</paramtype>
+ </parameter>
+ </signature>
+
+ <signature cv="const">
+ <type>const_reference</type>
+ <parameter name="i">
+ <paramtype>size_type</paramtype>
+ </parameter>
+ </signature>
+
+ <requires>
+ <simpara>
+ <code>i < N</code>
+ </simpara>
+ </requires>
+ <returns>
+ <simpara>
+ element with index <code>i</code>
+ </simpara>
+ </returns>
+ <throws>
+ <simpara>will not throw.</simpara>
+ </throws>
+ </overloaded-method>
+
+ <overloaded-method name="at">
+ <signature>
+ <type>reference</type>
+ <parameter name="i">
+ <paramtype>size_type</paramtype>
+ </parameter>
+ </signature>
+
+ <signature cv="const">
+ <type>const_reference</type>
+ <parameter name="i">
+ <paramtype>size_type</paramtype>
+ </parameter>
+ </signature>
+
+ <returns>
+ <simpara>
+ element with index <code>i</code>
+ </simpara>
+ </returns>
+ <throws>
+ <simpara>
+ <code>
+ <classname>std::range_error</classname>
+ </code> if <code>i >= N</code>
+ </simpara>
+ </throws>
+ </overloaded-method>
+
+ <overloaded-method name="front">
+ <signature>
+ <type>reference</type>
+ </signature>
+ <signature cv="const">
+ <type>const_reference</type>
+ </signature>
+ <requires>
+ <simpara>
+ <code>N > 0</code>
+ </simpara>
+ </requires>
+ <returns>
+ <simpara>the first element</simpara>
+ </returns>
+ <throws>
+ <simpara>will not throw</simpara>
+ </throws>
+ </overloaded-method>
+
+ <overloaded-method name="back">
+ <signature>
+ <type>reference</type>
+ </signature>
+ <signature cv="const">
+ <type>const_reference</type>
+ </signature>
+ <requires>
+ <simpara>
+ <code>N > 0</code>
+ </simpara>
+ </requires>
+ <returns>
+ <simpara>the last element</simpara>
+ </returns>
+ <throws>
+ <simpara>will not throw</simpara>
+ </throws>
+ </overloaded-method>
+
+ <method name="data" cv="const">
+ <type>const T*</type>
+ <returns>
+ <simpara>
+ <code>elems</code>
+ </simpara>
+ </returns>
+ <throws>
+ <simpara>will not throw</simpara>
+ </throws>
+ </method>
+
+ <method name="c_array">
+ <type>T*</type>
+ <returns>
+ <simpara>
+ <code>elems</code>
+ </simpara>
+ </returns>
+ <throws>
+ <simpara>will not throw</simpara>
+ </throws>
+ </method>
+ </method-group>
+
+ <method-group name="modifiers">
+ <method name="swap">
+ <type>void</type>
+ <parameter name="other">
+ <paramtype><classname>array</classname><T, N>&</paramtype>
+ </parameter>
+ <effects>
+ <simpara>
+ <code>
+ std::swap_ranges(<methodname>begin</methodname>(), <methodname>end</methodname>(), other.<methodname>begin</methodname>())
+ </code>
+ </simpara>
+ </effects>
+ <complexity>
+ <simpara>
+ linear in <code>N</code>
+ </simpara>
+ </complexity>
+ </method>
+ <method name="assign">
+ <type>void</type>
+ <parameter name="value">
+ <paramtype>const T&</paramtype>
+ </parameter>
+ <effects>
+ <simpara>
+ <code>
+ std::fill_n(<methodname>begin</methodname>(), N, value)
+ </code>
+ </simpara>
+ </effects>
+ </method>
+ </method-group>
+
+ <data-member name="elems[N]">
+ 
+ <type>T</type>
+ </data-member>
+
+ <free-function-group name="specialized algorithms">
+ <function name="swap">
+ <template>
+ <template-type-parameter name="T"/>
+ <template-nontype-parameter name="N">
+ <type>std::size_t</type>
+ </template-nontype-parameter>
+ </template>
+
+ <type>void</type>
+
+ <parameter name="x">
+ <paramtype><classname>array</classname><T, N>&</paramtype>
+ </parameter>
+ <parameter name="y">
+ <paramtype><classname>array</classname><T, N>&</paramtype>
+ </parameter>
+
+ <effects>
+ <simpara>
+ <code>
+ x.<methodname>swap</methodname>(y)
+ </code>
+ </simpara>
+ </effects>
+ <throws>
+ <simpara>will not throw.</simpara>
+ </throws>
+ </function>
+ </free-function-group>
+
+ <free-function-group name="comparisons">
+ <function name="operator==">
+ <template>
+ <template-type-parameter name="T"/>
+ <template-nontype-parameter name="N">
+ <type>std::size_t</type>
+ </template-nontype-parameter>
+ </template>
+
+ <type>bool</type>
+
+ <parameter name="x">
+ <paramtype>const <classname>array</classname><T, N>&</paramtype>
+ </parameter>
+ <parameter name="y">
+ <paramtype>const <classname>array</classname><T, N>&</paramtype>
+ </parameter>
+
+ <returns>
+ <simpara>
+ <code>
+ std::equal(x.<methodname>begin</methodname>(), x.<methodname>end</methodname>(), y.<methodname>begin</methodname>())
+ </code>
+ </simpara>
+ </returns>
+ </function>
+
+ <function name="operator!=">
+ <template>
+ <template-type-parameter name="T"/>
+ <template-nontype-parameter name="N">
+ <type>std::size_t</type>
+ </template-nontype-parameter>
+ </template>
+
+ <type>bool</type>
+
+ <parameter name="x">
+ <paramtype>const <classname>array</classname><T, N>&</paramtype>
+ </parameter>
+ <parameter name="y">
+ <paramtype>const <classname>array</classname><T, N>&</paramtype>
+ </parameter>
+
+ <returns>
+ <simpara>
+ <code>!(x == y)</code>
+ </simpara>
+ </returns>
+ </function>
+
+ <function name="operator<">
+ <template>
+ <template-type-parameter name="T"/>
+ <template-nontype-parameter name="N">
+ <type>std::size_t</type>
+ </template-nontype-parameter>
+ </template>
+
+ <type>bool</type>
+
+ <parameter name="x">
+ <paramtype>const <classname>array</classname><T, N>&</paramtype>
+ </parameter>
+ <parameter name="y">
+ <paramtype>const <classname>array</classname><T, N>&</paramtype>
+ </parameter>
+
+ <returns>
+ <simpara>
+ <code>
+ std::lexicographical_compare(x.<methodname>begin</methodname>(), x.<methodname>end</methodname>(), y.<methodname>begin</methodname>(), y.<methodname>end</methodname>())
+ </code>
+ </simpara>
+ </returns>
+ </function>
+
+ <function name="operator>">
+ <template>
+ <template-type-parameter name="T"/>
+ <template-nontype-parameter name="N">
+ <type>std::size_t</type>
+ </template-nontype-parameter>
+ </template>
+
+ <type>bool</type>
+
+ <parameter name="x">
+ <paramtype>const <classname>array</classname><T, N>&</paramtype>
+ </parameter>
+ <parameter name="y">
+ <paramtype>const <classname>array</classname><T, N>&</paramtype>
+ </parameter>
+
+ <returns>
+ <simpara>
+ <code>y < x</code>
+ </simpara>
+ </returns>
+ </function>
+
+ <function name="operator<=">
+ <template>
+ <template-type-parameter name="T"/>
+ <template-nontype-parameter name="N">
+ <type>std::size_t</type>
+ </template-nontype-parameter>
+ </template>
+
+ <type>bool</type>
+
+ <parameter name="x">
+ <paramtype>const <classname>array</classname><T, N>&</paramtype>
+ </parameter>
+ <parameter name="y">
+ <paramtype>const <classname>array</classname><T, N>&</paramtype>
+ </parameter>
+
+ <returns>
+ <simpara>
+ <code>!(y < x)</code>
+ </simpara>
+ </returns>
+ </function>
+
+ <function name="operator>=">
+ <template>
+ <template-type-parameter name="T"/>
+ <template-nontype-parameter name="N">
+ <type>std::size_t</type>
+ </template-nontype-parameter>
+ </template>
+
+ <type>bool</type>
+
+ <parameter name="x">
+ <paramtype>const <classname>array</classname><T, N>&</paramtype>
+ </parameter>
+ <parameter name="y">
+ <paramtype>const <classname>array</classname><T, N>&</paramtype>
+ </parameter>
+
+ <returns>
+ <simpara>
+ <code>!(x < y)</code>
+ </simpara>
+ </returns>
+ </function>
+ </free-function-group>
+ </class>
+ </namespace>
+ </header>
+</library-reference>
+

Added: sandbox/contract/doc/test/array2.xml
==============================================================================
--- (empty file)
+++ sandbox/contract/doc/test/array2.xml 2013-02-28 18:35:01 EST (Thu, 28 Feb 2013)
@@ -0,0 +1,82 @@
+<section id="array.rationale">
+ <title>Design Rationale</title>
+
+ <para>
+ 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:
+ <itemizedlist>
+ <listitem>
+ <simpara>
+ 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:
+ </simpara>
+
+ <programlisting>
+ <classname>boost::array</classname><int,4> a = { { 1, 2, 3 } };
+ </programlisting>
+
+ <simpara>
+ Note that if there are fewer elements in the
+ initializer list, then each remaining element gets
+ default-initialized (thus, it has a defined value).
+ </simpara>
+ </listitem>
+ </itemizedlist>
+ </para>
+
+ <para>
+ However, this approach has its drawbacks: <emphasis
+ role="bold">
+ passing no initializer list means that the elements
+ have an indetermined initial value
+ </emphasis>, because the rule says
+ that aggregates may have:
+ <itemizedlist>
+ <listitem>
+ <simpara>No user-declared constructors.</simpara>
+ </listitem>
+ <listitem>
+ <simpara>No private or protected non-static data members.</simpara>
+ </listitem>
+ <listitem>
+ <simpara>No base classes.</simpara>
+ </listitem>
+ <listitem>
+ <simpara>No virtual functions.</simpara>
+ </listitem>
+ </itemizedlist>
+ </para>
+
+ <para>Nevertheless, The current implementation uses this approach.</para>
+
+ <para>
+ 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:
+ </para>
+
+ <programlisting>
+ <classname>boost::array</classname><int,4> a = { 1, 2, 3 };
+ </programlisting>
+
+ <para>
+ I'd appreciate any constructive feedback. <emphasis
+ role="bold">
+ 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.
+ </emphasis>
+ </para>
+
+ <para>
+ The code is provided "as is" without expressed or implied
+ warranty.
+ </para>
+
+</section>
+
+

Added: sandbox/contract/doc/test/array3.xml
==============================================================================
--- (empty file)
+++ sandbox/contract/doc/test/array3.xml 2013-02-28 18:35:01 EST (Thu, 28 Feb 2013)
@@ -0,0 +1,22 @@
+<section id="array.more.info">
+ <title>For more information...</title>
+ <para>
+ To find more details about using ordinary arrays in C++ and
+ the framework of the STL, see e.g.
+
+ <literallayout>
+ The C++ Standard Library - A Tutorial and Reference
+ by Nicolai M. Josuttis
+ Addison Wesley Longman, 1999
+ ISBN 0-201-37926-0
+ </literallayout>
+ </para>
+
+ <para>
+ <ulink url="http://www.josuttis.com/">
+ Home Page of Nicolai
+ Josuttis
+ </ulink>
+ </para>
+</section>
+

Added: sandbox/contract/doc/test/array4.xml
==============================================================================
--- (empty file)
+++ sandbox/contract/doc/test/array4.xml 2013-02-28 18:35:01 EST (Thu, 28 Feb 2013)
@@ -0,0 +1,5 @@
+<section id="array.ack">
+ <title>Acknowledgements</title>
+
+ <para>Doug Gregor ported the documentation to the BoostBook format.</para>
+</section>

Added: sandbox/contract/doc/test/gold/boost/accumulators/extract/weighted_tail_quantile.html
==============================================================================
--- (empty file)
+++ sandbox/contract/doc/test/gold/boost/accumulators/extract/weighted_tail_quantile.html 2013-02-28 18:35:01 EST (Thu, 28 Feb 2013)
@@ -0,0 +1,50 @@
+<html>
+<head>
+<meta http-equiv="Content-Type" content="text/html; charset=US-ASCII">
+<title>Global weighted_tail_quantile</title>
+<link rel="stylesheet" href="../../../../../../doc/src/boostbook.css" type="text/css">
+<meta name="generator" content="DocBook XSL Stylesheets V1.75.2">
+<link rel="home" href="../../../index.html" title="Document To Test Formatting">
+<link rel="up" href="../../../document_to_test_formatting/accumulators.html#header.doc.test.weighted_tail_quantile_hpp" title="Header <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__id330053.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/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../../../document_to_test_formatting/accumulators.html#header.doc.test.weighted_tail_quantile_hpp"><img src="../../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../../../index.html"><img src="../../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="../impl/weighted_tail_quantile__id330053.html"><img src="../../../../../../doc/src/images/next.png" alt="Next"></a>
+</div>
+<div class="refentry">
+<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.doc.test.weighted_tail_quantile_hpp" title="Header <doc/test/weighted_tail_quantile.hpp>">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/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../../../document_to_test_formatting/accumulators.html#header.doc.test.weighted_tail_quantile_hpp"><img src="../../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../../../index.html"><img src="../../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="../impl/weighted_tail_quantile__id330053.html"><img src="../../../../../../doc/src/images/next.png" alt="Next"></a>
+</div>
+</body>
+</html>

Added: sandbox/contract/doc/test/gold/boost/accumulators/impl/weighted_tail_quantile__id330053.html
==============================================================================
--- (empty file)
+++ sandbox/contract/doc/test/gold/boost/accumulators/impl/weighted_tail_quantile__id330053.html 2013-02-28 18:35:01 EST (Thu, 28 Feb 2013)
@@ -0,0 +1,91 @@
+<html>
+<head>
+<meta http-equiv="Content-Type" content="text/html; charset=US-ASCII">
+<title>Struct template weighted_tail_quantile_impl</title>
+<link rel="stylesheet" href="../../../../../../doc/src/boostbook.css" type="text/css">
+<meta name="generator" content="DocBook XSL Stylesheets V1.75.2">
+<link rel="home" href="../../../index.html" title="Document To Test Formatting">
+<link rel="up" href="../../../document_to_test_formatting/accumulators.html#header.doc.test.weighted_tail_quantile_hpp" title="Header <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/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../../../document_to_test_formatting/accumulators.html#header.doc.test.weighted_tail_quantile_hpp"><img src="../../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../../../index.html"><img src="../../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="../tag/weighted_tail_quantile.html"><img src="../../../../../../doc/src/images/next.png" alt="Next"></a>
+</div>
+<div class="refentry">
+<a name="boost.accumulators.impl.weighted_tail_quantile__id330053"></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.doc.test.weighted_tail_quantile_hpp" title="Header <doc/test/weighted_tail_quantile.hpp>">doc/test/weighted_tail_quantile.hpp</a>>
+
+template<typename Sample, typename Weight, typename LeftRight>
+struct <a class="link" href="weighted_tail_quantile__id330053.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__id330053.float_type"></a>float_type;
+ typedef Sample <a name="boost.accumulators.impl.weighted_tail_quantile__id330053.result_type"></a>result_type;
+
+ // <a class="link" href="weighted_tail_quantile__id330053.html#boost.accumulators.impl.weighted_tail_quantile__id330053construct-copy-destruct">construct/copy/destruct</a>
+ <a class="link" href="weighted_tail_quantile__id330053.html#id330297-bb">weighted_tail_quantile_impl</a>(dont_care);
+
+ // <a class="link" href="weighted_tail_quantile__id330053.html#id330273-bb">public member functions</a>
+ template<typename Args> result_type <a class="link" href="weighted_tail_quantile__id330053.html#id330277-bb">result</a>(Args const &) const;
+};</pre></div>
+<div class="refsect1">
+<a name="id779890"></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="id779998"></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="id780026"></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">
+<a name="id780095"></a><h3>
+<a name="boost.accumulators.impl.weighted_tail_quantile__id330053construct-copy-destruct"></a><code class="computeroutput">weighted_tail_quantile_impl</code>
+ public
+ construct/copy/destruct</h3>
+<div class="orderedlist"><ol class="orderedlist" type="1"><li class="listitem"><pre class="literallayout"><a name="id330297-bb"></a>weighted_tail_quantile_impl(dont_care);</pre></li></ol></div>
+</div>
+<div class="refsect2">
+<a name="id780149"></a><h3>
+<a name="id330273-bb"></a><code class="computeroutput">weighted_tail_quantile_impl</code> public member functions</h3>
+<div class="orderedlist"><ol class="orderedlist" type="1"><li class="listitem"><pre class="literallayout">template<typename Args> result_type <a name="id330277-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/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../../../document_to_test_formatting/accumulators.html#header.doc.test.weighted_tail_quantile_hpp"><img src="../../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../../../index.html"><img src="../../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="../tag/weighted_tail_quantile.html"><img src="../../../../../../doc/src/images/next.png" alt="Next"></a>
+</div>
+</body>
+</html>

Added: sandbox/contract/doc/test/gold/boost/accumulators/tag/weighted_tail_quantile.html
==============================================================================
--- (empty file)
+++ sandbox/contract/doc/test/gold/boost/accumulators/tag/weighted_tail_quantile.html 2013-02-28 18:35:01 EST (Thu, 28 Feb 2013)
@@ -0,0 +1,52 @@
+<html>
+<head>
+<meta http-equiv="Content-Type" content="text/html; charset=US-ASCII">
+<title>Struct template weighted_tail_quantile</title>
+<link rel="stylesheet" href="../../../../../../doc/src/boostbook.css" type="text/css">
+<meta name="generator" content="DocBook XSL Stylesheets V1.75.2">
+<link rel="home" href="../../../index.html" title="Document To Test Formatting">
+<link rel="up" href="../../../document_to_test_formatting/accumulators.html#header.doc.test.weighted_tail_quantile_hpp" title="Header <doc/test/weighted_tail_quantile.hpp>">
+<link rel="prev" href="../impl/weighted_tail_quantile__id330053.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__id330053.html"><img src="../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../../../document_to_test_formatting/accumulators.html#header.doc.test.weighted_tail_quantile_hpp"><img src="../../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../../../index.html"><img src="../../../../../../doc/src/images/home.png" alt="Home"></a>
+</div>
+<div class="refentry">
+<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.doc.test.weighted_tail_quantile_hpp" title="Header <doc/test/weighted_tail_quantile.hpp>">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__id330053.html"><img src="../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../../../document_to_test_formatting/accumulators.html#header.doc.test.weighted_tail_quantile_hpp"><img src="../../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../../../index.html"><img src="../../../../../../doc/src/images/home.png" alt="Home"></a>
+</div>
+</body>
+</html>

Added: sandbox/contract/doc/test/gold/boost/array.html
==============================================================================
--- (empty file)
+++ sandbox/contract/doc/test/gold/boost/array.html 2013-02-28 18:35:01 EST (Thu, 28 Feb 2013)
@@ -0,0 +1,559 @@
+<html>
+<head>
+<meta http-equiv="Content-Type" content="text/html; charset=US-ASCII">
+<title>Class template array</title>
+<link rel="stylesheet" href="../../../../doc/src/boostbook.css" type="text/css">
+<meta name="generator" content="DocBook XSL Stylesheets V1.75.2">
+<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/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../document_to_test_formatting/array.html#header.boost.array_hpp"><img src="../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../index.html"><img src="../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="../document_to_test_formatting/accumulators.html"><img src="../../../../doc/src/images/next.png" alt="Next"></a>
+</div>
+<div class="refentry">
+<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#id330673-bb">operator=</a>(const <a class="link" href="array.html" title="Class template array">array</a><U, N>&);
+
+ // <a class="link" href="array.html#id330714-bb">iterator support</a>
+ iterator <a class="link" href="array.html#id330722-bb">begin</a>();
+ const_iterator <a class="link" href="array.html#id330729-bb">begin</a>() const;
+ iterator <a class="link" href="array.html#id330755-bb">end</a>();
+ const_iterator <a class="link" href="array.html#id330761-bb">end</a>() const;
+
+ // <a class="link" href="array.html#id330785-bb">reverse iterator support</a>
+ reverse_iterator <a class="link" href="array.html#id330793-bb">rbegin</a>();
+ const_reverse_iterator <a class="link" href="array.html#id330800-bb">rbegin</a>() const;
+ reverse_iterator <a class="link" href="array.html#id330821-bb">rend</a>();
+ const_reverse_iterator <a class="link" href="array.html#id330827-bb">rend</a>() const;
+
+ // <a class="link" href="array.html#id330844-bb">capacity</a>
+ size_type <a class="link" href="array.html#id330848-bb">size</a>();
+ bool <a class="link" href="array.html#id330866-bb">empty</a>();
+ size_type <a class="link" href="array.html#id330890-bb">max_size</a>();
+
+ // <a class="link" href="array.html#id330915-bb">element access</a>
+ reference <a class="link" href="array.html#id330923-bb">operator[]</a>(size_type);
+ const_reference <a class="link" href="array.html#id330938-bb">operator[]</a>(size_type) const;
+ reference <a class="link" href="array.html#id330986-bb">at</a>(size_type);
+ const_reference <a class="link" href="array.html#id331001-bb">at</a>(size_type) const;
+ reference <a class="link" href="array.html#id331061-bb">front</a>();
+ const_reference <a class="link" href="array.html#id331069-bb">front</a>() const;
+ reference <a class="link" href="array.html#id331115-bb">back</a>();
+ const_reference <a class="link" href="array.html#id331123-bb">back</a>() const;
+ const T* <a class="link" href="array.html#id331165-bb">data</a>() const;
+ T* <a class="link" href="array.html#id331198-bb">c_array</a>();
+
+ // <a class="link" href="array.html#id331230-bb">modifiers</a>
+ void <a class="link" href="array.html#id331235-bb">swap</a>(<a class="link" href="array.html" title="Class template array">array</a><T, N>&);
+ void <a class="link" href="array.html#id331296-bb">assign</a>(const T&);
+ T elems[N];
+};
+
+// <a class="link" href="array.html#id331348-bb">specialized algorithms</a>
+template<typename T, std::size_t N> void <a class="link" href="array.html#boost.array.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#id331434-bb">comparisons</a>
+template<typename T, std::size_t N>
+ bool <a class="link" href="array.html#boost.array.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.array.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.array.operator_id331592">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.array.operator_id331679">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.array.operator_=_id331750">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.array.operator_=_id332091">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">
+<a name="id776025"></a><h2>Description</h2>
+<div class="refsect2">
+<a name="id776028"></a><h3>
+<a name="boost.arrayconstruct-copy-destruct"></a><code class="computeroutput">array</code>
+ public
+ construct/copy/destruct</h3>
+<div class="orderedlist"><ol class="orderedlist" type="1"><li class="listitem">
+<pre class="literallayout">template<typename U> array& <a name="id330673-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#id330718-bb">begin</a>(),rhs.<a class="link" href="array.html#id330751-bb">end</a>(), <a class="link" href="array.html#id330718-bb">begin</a>())
+ </code>
+ </td>
+</tr></tbody>
+</table></div>
+</li></ol></div>
+</div>
+<div class="refsect2">
+<a name="id776182"></a><h3>
+<a name="id330714-bb"></a><code class="computeroutput">array</code> iterator support</h3>
+<div class="orderedlist"><ol class="orderedlist" type="1">
+<li class="listitem">
+<pre class="literallayout"><a name="id330718-bb"></a>iterator <a name="id330722-bb"></a>begin();
+const_iterator <a name="id330729-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 class="listitem">
+<pre class="literallayout"><a name="id330751-bb"></a>iterator <a name="id330755-bb"></a>end();
+const_iterator <a name="id330761-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">
+<a name="id776385"></a><h3>
+<a name="id330785-bb"></a><code class="computeroutput">array</code> reverse iterator support</h3>
+<div class="orderedlist"><ol class="orderedlist" type="1">
+<li class="listitem">
+<pre class="literallayout"><a name="id330789-bb"></a>reverse_iterator <a name="id330793-bb"></a>rbegin();
+const_reverse_iterator <a name="id330800-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 class="listitem">
+<pre class="literallayout"><a name="id330817-bb"></a>reverse_iterator <a name="id330821-bb"></a>rend();
+const_reverse_iterator <a name="id330827-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">
+<a name="id776574"></a><h3>
+<a name="id330844-bb"></a><code class="computeroutput">array</code> capacity</h3>
+<div class="orderedlist"><ol class="orderedlist" type="1">
+<li class="listitem">
+<pre class="literallayout">size_type <a name="id330848-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 class="listitem">
+<pre class="literallayout">bool <a name="id330866-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 class="listitem">
+<pre class="literallayout">size_type <a name="id330890-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">
+<a name="id776761"></a><h3>
+<a name="id330915-bb"></a><code class="computeroutput">array</code> element access</h3>
+<div class="orderedlist"><ol class="orderedlist" type="1">
+<li class="listitem">
+<pre class="literallayout"><a name="id330919-bb"></a>reference <a name="id330923-bb"></a>operator[](size_type i);
+const_reference <a name="id330938-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 class="listitem">
+<pre class="literallayout"><a name="id330982-bb"></a>reference <a name="id330986-bb"></a>at(size_type i);
+const_reference <a name="id331001-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 class="listitem">
+<pre class="literallayout"><a name="id331056-bb"></a>reference <a name="id331061-bb"></a>front();
+const_reference <a name="id331069-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 class="listitem">
+<pre class="literallayout"><a name="id331110-bb"></a>reference <a name="id331115-bb"></a>back();
+const_reference <a name="id331123-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 class="listitem">
+<pre class="literallayout">const T* <a name="id331165-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 class="listitem">
+<pre class="literallayout">T* <a name="id331198-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">
+<a name="id777380"></a><h3>
+<a name="id331230-bb"></a><code class="computeroutput">array</code> modifiers</h3>
+<div class="orderedlist"><ol class="orderedlist" type="1">
+<li class="listitem">
+<pre class="literallayout">void <a name="id331235-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#id330718-bb">begin</a>(), <a class="link" href="array.html#id330751-bb">end</a>(), other.<a class="link" href="array.html#id330718-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 class="listitem">
+<pre class="literallayout">void <a name="id331296-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#id330718-bb">begin</a>(), N, value)
+ </code>
+ </td>
+</tr></tbody>
+</table></div>
+</li>
+</ol></div>
+</div>
+<div class="refsect2">
+<a name="id777592"></a><h3>
+<a name="id331348-bb"></a><code class="computeroutput">array</code> specialized algorithms</h3>
+<div class="orderedlist"><ol class="orderedlist" type="1"><li class="listitem">
+<pre class="literallayout">template<typename T, std::size_t N> void <a name="boost.array.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#id331235-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">
+<a name="id777791"></a><h3>
+<a name="id331434-bb"></a><code class="computeroutput">array</code> comparisons</h3>
+<div class="orderedlist"><ol class="orderedlist" type="1">
+<li class="listitem">
+<pre class="literallayout">template<typename T, std::size_t N>
+ bool <a name="boost.array.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#id330718-bb">begin</a>(), x.<a class="link" href="array.html#id330751-bb">end</a>(), y.<a class="link" href="array.html#id330718-bb">begin</a>())
+ </code>
+ </td>
+</tr></tbody>
+</table></div>
+</li>
+<li class="listitem">
+<pre class="literallayout">template<typename T, std::size_t N>
+ bool <a name="boost.array.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 class="listitem">
+<pre class="literallayout">template<typename T, std::size_t N>
+ bool <a name="boost.array.operator_id331592"></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#id330718-bb">begin</a>(), x.<a class="link" href="array.html#id330751-bb">end</a>(), y.<a class="link" href="array.html#id330718-bb">begin</a>(), y.<a class="link" href="array.html#id330751-bb">end</a>())
+ </code>
+ </td>
+</tr></tbody>
+</table></div>
+</li>
+<li class="listitem">
+<pre class="literallayout">template<typename T, std::size_t N>
+ bool <a name="boost.array.operator_id331679"></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 class="listitem">
+<pre class="literallayout">template<typename T, std::size_t N>
+ bool <a name="boost.array.operator_=_id331750"></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 class="listitem">
+<pre class="literallayout">template<typename T, std::size_t N>
+ bool <a name="boost.array.operator_=_id332091"></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/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../document_to_test_formatting/array.html#header.boost.array_hpp"><img src="../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../index.html"><img src="../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="../document_to_test_formatting/accumulators.html"><img src="../../../../doc/src/images/next.png" alt="Next"></a>
+</div>
+</body>
+</html>

Added: sandbox/contract/doc/test/gold/document_to_test_formatting/accumulators.html
==============================================================================
--- (empty file)
+++ sandbox/contract/doc/test/gold/document_to_test_formatting/accumulators.html 2013-02-28 18:35:01 EST (Thu, 28 Feb 2013)
@@ -0,0 +1,69 @@
+<html>
+<head>
+<meta http-equiv="Content-Type" content="text/html; charset=US-ASCII">
+<title>Accumulators Example Doxygen Documentation</title>
+<link rel="stylesheet" href="../../../../doc/src/boostbook.css" type="text/css">
+<meta name="generator" content="DocBook XSL Stylesheets V1.75.2">
+<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/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../index.html"><img src="../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../index.html"><img src="../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="../boost/accumulators/extract/weighted_tail_quantile.html"><img src="../../../../doc/src/images/next.png" alt="Next"></a>
+</div>
+<div class="section">
+<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">
+<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 <doc/test/weighted_tail_quantile.hpp></dt></dl></div>
+<div class="section">
+<div class="titlepage"><div><div><h4 class="title">
+<a name="header.doc.test.weighted_tail_quantile_hpp"></a>Header <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__id330053.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/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../index.html"><img src="../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../index.html"><img src="../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="../boost/accumulators/extract/weighted_tail_quantile.html"><img src="../../../../doc/src/images/next.png" alt="Next"></a>
+</div>
+</body>
+</html>

Added: sandbox/contract/doc/test/gold/document_to_test_formatting/array.html
==============================================================================
--- (empty file)
+++ sandbox/contract/doc/test/gold/document_to_test_formatting/array.html 2013-02-28 18:35:01 EST (Thu, 28 Feb 2013)
@@ -0,0 +1,226 @@
+<html>
+<head>
+<meta http-equiv="Content-Type" content="text/html; charset=US-ASCII">
+<title>Array Example Boostbook XML Documentation</title>
+<link rel="stylesheet" href="../../../../doc/src/boostbook.css" type="text/css">
+<meta name="generator" content="DocBook XSL Stylesheets V1.75.2">
+<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/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../index.html"><img src="../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../index.html"><img src="../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="../boost/array.html"><img src="../../../../doc/src/images/next.png" alt="Next"></a>
+</div>
+<div class="section">
+<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">
+<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 class="itemizedlist" type="disc" compact>
+<li class="listitem">No constructors are provided.</li>
+<li class="listitem">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 class="listitem">
+<code class="computeroutput"><a class="link" href="../boost/array.html#boost.array.swap">swap</a></code>() has no constant complexity.</li>
+<li class="listitem">
+<code class="computeroutput"><a class="link" href="../boost/array.html#id330848-bb">size</a></code>() is always constant, based on the second template argument of the type.</li>
+<li class="listitem">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 class="itemizedlist" type="disc" compact>
+<li class="listitem">
+<code class="computeroutput"><a class="link" href="../boost/array.html#id331056-bb">front</a></code>() and <code class="computeroutput"><a class="link" href="../boost/array.html#id331110-bb">back</a></code>() are provided.</li>
+<li class="listitem">
+<code class="computeroutput"><a class="link" href="../boost/array.html#id330919-bb">operator[]</a></code> and <code class="computeroutput"><a class="link" href="../boost/array.html#id330982-bb">at</a></code>() are provided.</li>
+</ul></div>
+
+ 
+</div>
+<div class="section">
+<div class="titlepage"><div><div><h3 class="title">
+<a name="id772287"></a>Reference</h3></div></div></div>
+<div class="toc"><dl><dt>Header <boost/array.hpp></dt></dl></div>
+<div class="section">
+<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.array.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>&
amp;);
+ template<typename T, std::size_t N>
+ bool <a class="link" href="../boost/array.html#boost.array.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.array.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.array.operator_id331592">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.array.operator_id331679">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.array.operator_=_id331750">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.array.operator_=_id332091">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">
+<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 class="itemizedlist" type="disc"><li class="listitem">
+
+ 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 class="itemizedlist" type="disc">
+<li class="listitem">No user-declared constructors.</li>
+<li class="listitem">No private or protected non-static data members.</li>
+<li class="listitem">No base classes.</li>
+<li class="listitem">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">
+<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">
+<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/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../index.html"><img src="../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../index.html"><img src="../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="../boost/array.html"><img src="../../../../doc/src/images/next.png" alt="Next"></a>
+</div>
+</body>
+</html>

Added: sandbox/contract/doc/test/gold/document_to_test_formatting/basic_formatting.html
==============================================================================
--- (empty file)
+++ sandbox/contract/doc/test/gold/document_to_test_formatting/basic_formatting.html 2013-02-28 18:35:01 EST (Thu, 28 Feb 2013)
@@ -0,0 +1,208 @@
+<html>
+<head>
+<meta http-equiv="Content-Type" content="text/html; charset=US-ASCII">
+<title>Basic Formatting</title>
+<link rel="stylesheet" href="../../../../doc/src/boostbook.css" type="text/css">
+<meta name="generator" content="DocBook XSL Stylesheets V1.75.2">
+<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/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../index.html"><img src="../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../index.html"><img src="../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="blurbs.html"><img src="../../../../doc/src/images/next.png" alt="Next"></a>
+</div>
+<div class="section">
+<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">
+<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">
+<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">
+<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">
+<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">
+<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.
+ 
+
+ This is <a href="../../../../boost/math/distributions.hpp" target="_top">a link to a header
+ file (boost/math/distributions.hpp)</a>, it should be rewritable and
+ point to the website when built as a PDF.
+ 
+
+ This is <a href="../../../../libs/regex/index.html" target="_top">a link to another library's
+ documentation (Boost.Regex)</a>, using the boost: protocol, it should
+ be rewritten to point to the website when building a PDF.
+ 
+
+ This is <a href="../../../../libs/regex/index.html" target="_top">a link to another library's
+ documentation (Boost.Regex)</a>, using the boost:/ protocol, it should
+ be rewritten to point to the website when building a PDF.
+ 
+
+ This is <a href="../../weighted_tail_quantile.hpp" target="_top">a relative link to a header
+ file within the test source</a>, it should be rewritten to point to the
+ website when building a PDF. Although it might be on the website yet.
+ 
+</div>
+<div class="section">
+<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="id769038" href="#ftn.id769038" class="footnote">1</a>].
+ 
+
+ And here's another [<a name="id769049" href="#ftn.id769049" class="footnote">2</a>].
+ 
+</div>
+<div class="section">
+<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">
+<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="id769109"></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="id769128"></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="id769146"></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="id769165"></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="id769183"></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="id769201"></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.id769038" href="#id769038" class="para">1</a>] 
+ A sample footnote
+ </div>
+<div class="footnote">[<a name="ftn.id769049" href="#id769049" 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/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../index.html"><img src="../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../index.html"><img src="../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="blurbs.html"><img src="../../../../doc/src/images/next.png" alt="Next"></a>
+</div>
+</body>
+</html>

Added: sandbox/contract/doc/test/gold/document_to_test_formatting/blurbs.html
==============================================================================
--- (empty file)
+++ sandbox/contract/doc/test/gold/document_to_test_formatting/blurbs.html 2013-02-28 18:35:01 EST (Thu, 28 Feb 2013)
@@ -0,0 +1,160 @@
+<html>
+<head>
+<meta http-equiv="Content-Type" content="text/html; charset=US-ASCII">
+<title>Blurbs</title>
+<link rel="stylesheet" href="../../../../doc/src/boostbook.css" type="text/css">
+<meta name="generator" content="DocBook XSL Stylesheets V1.75.2">
+<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/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../index.html"><img src="../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../index.html"><img src="../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="lists_and_tables.html"><img src="../../../../doc/src/images/next.png" alt="Next"></a>
+</div>
+<div class="section">
+<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">
+<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">
+<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/src/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/src/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/src/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/src/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/src/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">
+<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/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../index.html"><img src="../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../index.html"><img src="../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="lists_and_tables.html"><img src="../../../../doc/src/images/next.png" alt="Next"></a>
+</div>
+</body>
+</html>

Added: sandbox/contract/doc/test/gold/document_to_test_formatting/code_blocks.html
==============================================================================
--- (empty file)
+++ sandbox/contract/doc/test/gold/document_to_test_formatting/code_blocks.html 2013-02-28 18:35:01 EST (Thu, 28 Feb 2013)
@@ -0,0 +1,426 @@
+<html>
+<head>
+<meta http-equiv="Content-Type" content="text/html; charset=US-ASCII">
+<title>Code Blocks</title>
+<link rel="stylesheet" href="../../../../doc/src/boostbook.css" type="text/css">
+<meta name="generator" content="DocBook XSL Stylesheets V1.75.2">
+<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/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../index.html"><img src="../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../index.html"><img src="../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="basic_formatting.html"><img src="../../../../doc/src/images/next.png" alt="Next"></a>
+</div>
+<div class="section">
+<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.code_with_a_very_long_line">Code
+ With a Very Long Line</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">
+<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">
+<div class="titlepage"><div><div><h3 class="title">
+<a name="document_to_test_formatting.code_blocks.code_with_a_very_long_line"></a><a class="link" href="code_blocks.html#document_to_test_formatting.code_blocks.code_with_a_very_long_line" title="Code With a Very Long Line">Code
+ With a Very Long Line</a>
+</h3></div></div></div>
+<pre class="programlisting">template <class RealType> RealType inline foo(const RealType& a, const RealType& b, const RealType& c, const RealType& d, const RealType& e, const RealType& f, const RealType& g, const RealType& h){ return 0; }
+</pre>
+</div>
+<div class="section">
+<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_formatting0co" href="code_blocks.html#document_to_test_formatting0"><img src="../../../../doc/src/images/callouts/1.png" alt="1" border="0"></a>x() : n(0)
+ {
+ }
+
+ <a class="co" name="document_to_test_formatting1co" href="code_blocks.html#document_to_test_formatting1"><img src="../../../../doc/src/images/callouts/2.png" alt="2" border="0"></a>~x()
+ {
+ }
+
+ <a class="co" name="document_to_test_formatting2co" href="code_blocks.html#document_to_test_formatting2"><img src="../../../../doc/src/images/callouts/3.png" alt="3" border="0"></a>int get() const
+ {
+ return n;
+ }
+
+ <a class="co" name="document_to_test_formatting3co" href="code_blocks.html#document_to_test_formatting3"><img src="../../../../doc/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_formatting0"></a> </td>
+<td valign="top" align="left"> Constructor </td>
+</tr>
+<tr>
+<td width="5%" valign="top" align="left"><a name="document_to_test_formatting1"></a> </td>
+<td valign="top" align="left"> Destructor </td>
+</tr>
+<tr>
+<td width="5%" valign="top" align="left"><a name="document_to_test_formatting2"></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_formatting3"></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_formatting4co" href="code_blocks.html#document_to_test_formatting4"><img src="../../../../doc/src/images/callouts/1.png" alt="1" border="0"></a>
+{
+ return "foo-bar"; <a class="co" name="document_to_test_formatting5co" href="code_blocks.html#document_to_test_formatting5"><img src="../../../../doc/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_formatting4"></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_formatting5"></a> </td>
+<td valign="top" align="left"> return 'em, foo-bar man! </td>
+</tr>
+</table></div>
+
+ 
+</div>
+<div class="section">
+<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/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../index.html"><img src="../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../index.html"><img src="../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="basic_formatting.html"><img src="../../../../doc/src/images/next.png" alt="Next"></a>
+</div>
+</body>
+</html>

Added: sandbox/contract/doc/test/gold/document_to_test_formatting/images.html
==============================================================================
--- (empty file)
+++ sandbox/contract/doc/test/gold/document_to_test_formatting/images.html 2013-02-28 18:35:01 EST (Thu, 28 Feb 2013)
@@ -0,0 +1,60 @@
+<html>
+<head>
+<meta http-equiv="Content-Type" content="text/html; charset=US-ASCII">
+<title>Images</title>
+<link rel="stylesheet" href="../../../../doc/src/boostbook.css" type="text/css">
+<meta name="generator" content="DocBook XSL Stylesheets V1.75.2">
+<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/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../index.html"><img src="../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../index.html"><img src="../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="test.html"><img src="../../../../doc/src/images/next.png" alt="Next"></a>
+</div>
+<div class="section">
+<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/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../index.html"><img src="../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../index.html"><img src="../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="test.html"><img src="../../../../doc/src/images/next.png" alt="Next"></a>
+</div>
+</body>
+</html>

Added: sandbox/contract/doc/test/gold/document_to_test_formatting/lists_and_tables.html
==============================================================================
--- (empty file)
+++ sandbox/contract/doc/test/gold/document_to_test_formatting/lists_and_tables.html 2013-02-28 18:35:01 EST (Thu, 28 Feb 2013)
@@ -0,0 +1,459 @@
+<html>
+<head>
+<meta http-equiv="Content-Type" content="text/html; charset=US-ASCII">
+<title>Lists and Tables</title>
+<link rel="stylesheet" href="../../../../doc/src/boostbook.css" type="text/css">
+<meta name="generator" content="DocBook XSL Stylesheets V1.75.2">
+<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/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../index.html"><img src="../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../index.html"><img src="../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="images.html"><img src="../../../../doc/src/images/next.png" alt="Next"></a>
+</div>
+<div class="section">
+<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">
+<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 class="orderedlist" type="1">
+<li class="listitem">
+ One
+ </li>
+<li class="listitem">
+ Two
+ </li>
+<li class="listitem">
+ Three
+ <div class="orderedlist"><ol class="orderedlist" type="a">
+<li class="listitem">
+ Three.a
+ </li>
+<li class="listitem">
+ Three.b
+ </li>
+<li class="listitem">
+ Three.c
+ </li>
+</ol></div>
+ </li>
+<li class="listitem">
+ Four
+ <div class="orderedlist"><ol class="orderedlist" type="a"><li class="listitem">
+ Four.a
+ <div class="orderedlist"><ol class="orderedlist" type="i">
+<li class="listitem">
+ Four.a.i
+ </li>
+<li class="listitem">
+ Four.a.ii
+ </li>
+</ol></div>
+ </li></ol></div>
+ </li>
+<li class="listitem">
+ Five
+ </li>
+</ol></div>
+
+ An unordered list:
+ 
+<div class="itemizedlist"><ul class="itemizedlist" type="disc">
+<li class="listitem">
+ First
+ </li>
+<li class="listitem">
+ Second
+ </li>
+<li class="listitem">
+ Third
+ </li>
+</ul></div>
+
+ A mixture of the two:
+ 
+<div class="orderedlist"><ol class="orderedlist" type="1">
+<li class="listitem">
+ 1
+ <div class="itemizedlist"><ul class="itemizedlist" type="disc">
+<li class="listitem">
+ 1.a
+ <div class="orderedlist"><ol class="orderedlist" type="a">
+<li class="listitem">
+ 1.a.1
+ </li>
+<li class="listitem">
+ 1.a.2
+ </li>
+</ol></div>
+ </li>
+<li class="listitem">
+ 1.b
+ </li>
+</ul></div>
+ </li>
+<li class="listitem">
+ 2
+ <div class="itemizedlist"><ul class="itemizedlist" type="disc">
+<li class="listitem">
+ 2.a
+ </li>
+<li class="listitem">
+ 2.b
+ <div class="orderedlist"><ol class="orderedlist" type="a">
+<li class="listitem">
+ 2.b.1
+ </li>
+<li class="listitem">
+ 2.b.2
+ <div class="itemizedlist"><ul class="itemizedlist" type="circle">
+<li class="listitem">
+ 2.b.2.a
+ </li>
+<li class="listitem">
+ 2.b.2.b
+ </li>
+</ul></div>
+ </li>
+</ol></div>
+ </li>
+</ul></div>
+ </li>
+</ol></div>
+</div>
+<div class="section">
+<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">
+<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="id769721"></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/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../index.html"><img src="../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../index.html"><img src="../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="images.html"><img src="../../../../doc/src/images/next.png" alt="Next"></a>
+</div>
+</body>
+</html>

Added: sandbox/contract/doc/test/gold/document_to_test_formatting/remez.html
==============================================================================
--- (empty file)
+++ sandbox/contract/doc/test/gold/document_to_test_formatting/remez.html 2013-02-28 18:35:01 EST (Thu, 28 Feb 2013)
@@ -0,0 +1,535 @@
+<html>
+<head>
+<meta http-equiv="Content-Type" content="text/html; charset=US-ASCII">
+<title>Sample Article (The Remez Method)</title>
+<link rel="stylesheet" href="../../../../doc/src/boostbook.css" type="text/css">
+<meta name="generator" content="DocBook XSL Stylesheets V1.75.2">
+<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/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../index.html"><img src="../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../index.html"><img src="../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="array.html"><img src="../../../../doc/src/images/next.png" alt="Next"></a>
+</div>
+<div class="section">
+<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 class="itemizedlist" type="disc">
+<li class="listitem">
+ 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 class="listitem">
+ The error function has N+1 roots, and N+2 extrema (minima and maxima).
+ </li>
+<li class="listitem">
+ 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="id771060"></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/src/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="id771248"></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="id771342"></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="id771387"></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="id771441"></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="id771550"></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="id771737"></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 class="itemizedlist" type="disc">
+<li class="listitem">
+ Is the function smooth enough? Can it be better separated into a rapidly
+ changing part, and an asymptotic part?
+ </li>
+<li class="listitem">
+ 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 class="listitem">
+ 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 class="listitem">
+ Try skewing the initial interpolated approximation to minimise the error
+ before you begin the Remez steps.
+ </li>
+<li class="listitem">
+ If the approximation won't converge or is ill-conditioned from one starting
+ location, try starting from a different location.
+ </li>
+<li class="listitem">
+ 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 class="listitem">
+ 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 class="listitem">
+ 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="id771857"></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/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../index.html"><img src="../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../index.html"><img src="../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="array.html"><img src="../../../../doc/src/images/next.png" alt="Next"></a>
+</div>
+</body>
+</html>

Added: sandbox/contract/doc/test/gold/document_to_test_formatting/test.html
==============================================================================
--- (empty file)
+++ sandbox/contract/doc/test/gold/document_to_test_formatting/test.html 2013-02-28 18:35:01 EST (Thu, 28 Feb 2013)
@@ -0,0 +1,73 @@
+<html>
+<head>
+<meta http-equiv="Content-Type" content="text/html; charset=US-ASCII">
+<title>test HTML4 symbols</title>
+<link rel="stylesheet" href="../../../../doc/src/boostbook.css" type="text/css">
+<meta name="generator" content="DocBook XSL Stylesheets V1.75.2">
+<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/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../index.html"><img src="../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../index.html"><img src="../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="remez.html"><img src="../../../../doc/src/images/next.png" alt="Next"></a>
+</div>
+<div class="section">
+<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">
+<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">
+<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/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../index.html"><img src="../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../index.html"><img src="../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="remez.html"><img src="../../../../doc/src/images/next.png" alt="Next"></a>
+</div>
+</body>
+</html>

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

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

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

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

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

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

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

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

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

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

Added: sandbox/contract/doc/test/gold/images/beta_dist_kurtosis.png
==============================================================================
Binary file. No diff available.

Added: sandbox/contract/doc/test/gold/images/digamma3.png
==============================================================================
Binary file. No diff available.

Added: sandbox/contract/doc/test/gold/images/doctest.png
==============================================================================
Binary file. No diff available.

Added: sandbox/contract/doc/test/gold/images/open_clipart_library_logo.svg
==============================================================================
Binary file. No diff available.

Added: sandbox/contract/doc/test/gold/images/remez-2.png
==============================================================================
Binary file. No diff available.

Added: sandbox/contract/doc/test/gold/images/remez-3.png
==============================================================================
Binary file. No diff available.

Added: sandbox/contract/doc/test/gold/images/remez-4.png
==============================================================================
Binary file. No diff available.

Added: sandbox/contract/doc/test/gold/images/remez-5.png
==============================================================================
Binary file. No diff available.

Added: sandbox/contract/doc/test/gold/index.html
==============================================================================
--- (empty file)
+++ sandbox/contract/doc/test/gold/index.html 2013-02-28 18:35:01 EST (Thu, 28 Feb 2013)
@@ -0,0 +1,151 @@
+<html>
+<head>
+<meta http-equiv="Content-Type" content="text/html; charset=US-ASCII">
+<title>Document To Test Formatting</title>
+<link rel="stylesheet" href="../../../doc/src/boostbook.css" type="text/css">
+<meta name="generator" content="DocBook XSL Stylesheets V1.75.2">
+<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/src/images/next.png" alt="Next"></a></div>
+<div class="article">
+<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="id759728"></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.code_with_a_very_long_line">Code
+ With a Very Long Line</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">
+<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: July 22, 2010 at 21:58:58 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/src/images/next.png" alt="Next"></a></div>
+</body>
+</html>

Added: sandbox/contract/doc/test/html/images/beta_dist_kurtosis.png
==============================================================================
Binary file. No diff available.

Added: sandbox/contract/doc/test/html/images/digamma3.png
==============================================================================
Binary file. No diff available.

Added: sandbox/contract/doc/test/html/images/doctest.png
==============================================================================
Binary file. No diff available.

Added: sandbox/contract/doc/test/html/images/open_clipart_library_logo.svg
==============================================================================
Binary file. No diff available.

Added: sandbox/contract/doc/test/html/images/remez-2.png
==============================================================================
Binary file. No diff available.

Added: sandbox/contract/doc/test/html/images/remez-3.png
==============================================================================
Binary file. No diff available.

Added: sandbox/contract/doc/test/html/images/remez-4.png
==============================================================================
Binary file. No diff available.

Added: sandbox/contract/doc/test/html/images/remez-5.png
==============================================================================
Binary file. No diff available.

Added: sandbox/contract/doc/test/remez.qbk
==============================================================================
--- (empty file)
+++ sandbox/contract/doc/test/remez.qbk 2013-02-28 18:35:01 EST (Thu, 28 Feb 2013)
@@ -0,0 +1,372 @@
+[section:remez Sample Article (The Remez Method)]
+
+The [@http://en.wikipedia.org/wiki/Remez_algorithm 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:
+
+E[sub abs](x) = f(x) - R(x)
+
+which is expressed in terms of absolute error, but we can equally use
+relative error:
+
+E[sub rel](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:
+
+* 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.
+* The error function has N+1 roots, and N+2 extrema (minima and maxima).
+* The extrema alternate in sign, and all have the same magnitude.
+
+That means that if we know the location of the extrema of the error function
+then we can write N+2 simultaneous equations:
+
+R(x[sub i]) + (-1)[super i]E = f(x[sub i])
+
+where E is the maximal error term, and x[sub i] 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!]
+
+[h4 The Remez Method]
+
+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 e[super x][space] 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 (x[sub 0]...x[sub N]): with our interpolated form
+passing through each of those points
+that yields N+1 simultaneous equations:
+
+f(x[sub i]) = P(x[sub i]) = c[sub 0] + c[sub 1]x[sub i] ... + c[sub N]x[sub i][super N]
+
+Which can be solved for the coefficients c[sub 0]...c[sub N] 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:
+
+[$images/remez-2.png]
+
+Which has a peak relative error of 1.2x10[super -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].
+
+[note
+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
+[@http://math.fullerton.edu/mathews/n2003/ChebyshevPolyMod.html online course].]
+
+[h4 Remez Step 1]
+
+The first step in the Remez method, given our current set of
+N+2 Chebyshev control points x[sub i], is to solve the N+2 simultaneous
+equations:
+
+P(x[sub i]) + (-1)[super i]E = f(x[sub i])
+
+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:
+
+[$images/remez-3.png]
+
+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[super -4].
+
+[h4 Remez Step 2]
+
+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.
+
+[h4 Iteration]
+
+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[super -4] and an error function that looks like:
+
+[$images/remez-4.png]
+
+[h4 Rational Approximations]
+
+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(x[sub i]) / Q(x[sub i]) + (-1)[super i]E = f(x[sub i])
+
+Evaluated at the N+M+2 control points x[sub i].
+
+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 e[super x], we obtained 5x10[super -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[super -5]. That's a 5 fold increase in accuracy, for the same number
+of terms overall.
+
+[h4 Practical Considerations]
+
+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[super -x[super 2]]\/x as x becomes large. Therefore using:
+
+erfc(z) = (C + R(x)) e[super -x[super 2]]/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 e[super x][space] over \[-1,1\], the initial
+interpolated form was some way from the minimax solution:
+
+[$images/remez-2.png]
+
+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[super -3][space]to 6x10[super -4]:
+
+[$images/remez-5.png]
+
+It's clearly still not ideal, but it is only a few percent away from
+our desired minimax solution (5x10[super -4]).
+
+[h4 Remez Method Checklist]
+
+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.
+
+* Is the function smooth enough? Can it be better separated into
+a rapidly changing part, and an asymptotic part?
+* 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.
+* 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.
+* Try skewing the initial interpolated approximation to minimise the
+error before you begin the Remez steps.
+* If the approximation won't converge or is ill-conditioned from one starting
+location, try starting from a different location.
+* 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.
+* 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.
+* Keep absissa values small: use a change of variable to keep the abscissa
+over, say \[0, b\], for some smallish value /b/.
+
+[h4 References]
+
+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.
+
+[endsect][/section:remez The Remez Method]
+
+
+

Added: sandbox/contract/doc/test/stub.cpp
==============================================================================
--- (empty file)
+++ sandbox/contract/doc/test/stub.cpp 2013-02-28 18:35:01 EST (Thu, 28 Feb 2013)
@@ -0,0 +1,69 @@
+/*=============================================================================
+ Copyright (c) 2006 Joel de Guzman
+ http://spirit.sourceforge.net/
+
+ Use, modification and distribution is subject to 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)
+=============================================================================*/
+#include <string>
+
+//[ bar
+//` This is the [*/bar/] function
+std::string bar()
+{
+ // return 'em, bar man!
+ return "bar";
+}
+//]
+
+//[ foo
+/*` This is the [*['foo]] function. */
+std::string foo()
+{
+ // return 'em, foo man!
+ return "foo";
+}
+//]
+
+//[ foo_bar
+std::string foo_bar() /*< The /Mythical/ FooBar.
+ See [@http://en.wikipedia.org/wiki/Foobar Foobar for details] >*/
+{
+ return "foo-bar"; /*< return 'em, foo-bar man! >*/
+}
+//]
+
+//[ class_
+class x
+{
+public:
+
+ /*<< Constructor >>*/
+ x() : n(0)
+ {
+ }
+
+ /*<< Destructor >>*/
+ ~x()
+ {
+ }
+
+ /*<< Get the `n` member variable >>*/
+ int get() const
+ {
+ return n; /*<- this will be ignored by quickbook ->*/
+ }
+
+ /*<< Set the `n` member variable >>*/
+ void set(int n_)
+ {
+ n = n_;
+ }
+//<- this will be ignored by quickbook
+private:
+
+ int n;
+//->
+};
+//]

Added: sandbox/contract/doc/test/test.png
==============================================================================
Binary file. No diff available.

Added: sandbox/contract/doc/test/test.qbk
==============================================================================
--- (empty file)
+++ sandbox/contract/doc/test/test.qbk 2013-02-28 18:35:01 EST (Thu, 28 Feb 2013)
@@ -0,0 +1,646 @@
+[article Document To Test Formatting
+ [quickbook 1.4]
+ [copyright 2007 John Maddock, Joel de Guzman, Eric Niebler and Matias Capeletto]
+ [purpose Test Formatting Document]
+ [license
+ 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])
+ ]
+ [authors [Maddock, John], [de Guzman, Joel], [Niebler, Eric], [Capeletto, Matias] ]
+ [category math]
+ [/last-revision $Date: 2007-05-07 10:21:52 +0100 (Mon, 07 May 2007) $]
+]
+
+[include HTML4_symbols.qbk]
+
+[/ Some composite templates]
+[template super[x]'''<superscript>'''[x]'''</superscript>''']
+[template sub[x]'''<subscript>'''[x]'''</subscript>''']
+[template floor[x]'''⌊'''[x]'''⌋''']
+[template floorlr[x][lfloor][x][rfloor]]
+[template ceil[x] '''⌈'''[x]'''⌉''']
+
+[section Introduction]
+
+This document is purely a test case to test out HTML and PDF generation and style.
+
+This is some body text.
+
+ int main()
+ {
+ double d = 2.345;
+ return d;
+ }
+
+We can count in Greek too: [alpha], [beta], [gamma].
+
+Try some superscrips and subscripts: x[super 2], x[sub i][super 3], [alpha][super 2],
+[beta][super [alpha]], [floor x], [floor [alpha]], [ceil a].
+
+[endsect]
+
+[section Code Blocks]
+
+[section Embedded code]
+
+These should be syntax highlighted:
+
+ #include <iostream>
+
+ int main()
+ {
+ // Sample code
+ std::cout << "Hello, World\n";
+ return 0;
+ }
+
+[endsect]
+
+[section Code With a Very Long Line]
+
+ template <class RealType> RealType inline foo(const RealType& a, const RealType& b, const RealType& c, const RealType& d, const RealType& e, const RealType& f, const RealType& g, const RealType& h){ return 0; }
+
+[endsect]
+
+[section Imported code and callouts]
+
+[import stub.cpp]
+
+Here's some code with left-placed callouts:
+
+[class_]
+
+And again with callouts placed exactly where we put them:
+
+[foo_bar]
+
+[endsect]
+
+[section Larger example]
+
+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!
+
+ 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
+
+[endsect]
+
+[endsect]
+
+[section Basic Formatting]
+
+[section Font Styles]
+
+Here we go with some inline formatting:
+['italic], [*bold], [_underline], [^teletype], [-strikethrough],
+we can combine styles as well: ['[*bold italic]], [_[^teletype with underline]].
+
+[endsect]
+
+[section Replaceable Text]
+
+Text that is intended to be user-replaceable is [~rendered like this].
+
+[endsect]
+
+[section Quotations]
+
+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.]
+
+[endsect]
+
+[section Inline Code]
+
+This text has inlined code `int main() { return 0; }` in it.
+The code should be syntax highlighted.
+
+[endsect]
+
+[section Links]
+
+Try this: [@http://www.boost.org this is [*boost's] website....] it should
+be visible as a link.
+
+This is [@../../../boost/math/distributions.hpp a link to a header file (boost/math/distributions.hpp)],
+it should be rewritable and point to the website when built as a PDF.
+
+This is [@boost:libs/regex/index.html a link to another library's documentation (Boost.Regex)], using the boost: protocol,
+it should be rewritten to point to the website when building a PDF.
+
+This is [@boost:/libs/regex/index.html a link to another library's documentation (Boost.Regex)], using the boost:/ protocol,
+it should be rewritten to point to the website when building a PDF.
+
+This is [@../weighted_tail_quantile.hpp a relative link to a header file within the test source],
+it should be rewritten to point to the website when building a PDF.
+Although it might be on the website yet.
+
+[endsect]
+
+[section Footnotes]
+
+Here's one [footnote A sample footnote].
+
+And here's another [footnote Another sample footnote].
+
+[endsect]
+
+[section Blockquote]
+
+Lets indent the next paragraph:
+
+[:Here we go!!!]
+
+[endsect]
+
+[section Headings]
+
+Now try rendering some heading styles:
+
+[h1 Heading 1]
+
+[h2 Heading 2]
+
+[h3 Heading 3]
+
+[h4 Heading 4]
+
+[h5 Heading 5]
+
+[h6 Heading 6]
+
+[endsect]
+
+[endsect]
+
+[section Blurbs]
+
+[section Preformatted text]
+
+Here's some sample program output:
+
+[pre
+'''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'''
+]
+
+[endsect]
+
+[section Admonishments]
+
+There are four admonishments supported by Docbook XML:
+
+[note This is a note]
+
+[tip This is a tip]
+
+[important This is important]
+
+[caution This is a caution]
+
+[warning This is a warning
+
+They can contain more than one paragraph.
+]
+
+[endsect]
+
+[section Blurbs]
+
+[blurb [*An eye catching advertisement or note...]
+
+These should be rendered in a manner similar to admonishments.
+
+They can contain more than one paragraph.
+]
+
+[endsect]
+
+[endsect]
+
+[section Lists and Tables]
+
+[section Lists]
+
+A numbered list:
+
+# One
+# Two
+# Three
+ # Three.a
+ # Three.b
+ # Three.c
+# Four
+ # Four.a
+ # Four.a.i
+ # Four.a.ii
+# Five
+
+An unordered list:
+
+* First
+* Second
+* Third
+
+A mixture of the two:
+
+# 1
+ * 1.a
+ # 1.a.1
+ # 1.a.2
+ * 1.b
+# 2
+ * 2.a
+ * 2.b
+ # 2.b.1
+ # 2.b.2
+ * 2.b.2.a
+ * 2.b.2.b
+
+
+[endsect]
+
+[section Variable Lists]
+
+[variablelist A Variable List
+ [[term 1] [The definition of term 1]]
+ [[term 2] [The definition of term 2]]
+ [[term 3] [The definition of term 3]]
+]
+
+[endsect]
+
+[section Tables]
+
+Here's a big table with code and other tricky things:
+
+[table Notes on the Implementation of the Beta Distribution
+[[Function][Implementation Notes]]
+[[pdf]
+ [f(x;[alpha],[beta]) = x[super[alpha] - 1] (1 - x)[super[beta] -1] / B([alpha], [beta])
+
+ Implemented using ibeta_derivative(a, b, x).]]
+
+[[cdf][Using the incomplete beta function ibeta(a, b, x)]]
+[[cdf complement][ibetac(a, b, x)]]
+[[quantile][Using the inverse incomplete beta function ibeta_inv(a, b, p)]]
+[[quantile from the complement][ibetac_inv(a, b, q)]]
+[[mean][`a/(a+b)`]]
+[[variance][`a * b / (a+b)^2 * (a + b + 1)`]]
+[[mode][`(a-1) / (a + b + 2)`]]
+[[skewness][`2 (b-a) sqrt(a+b+1)/(a+b+2) * sqrt(a * b)`]]
+[[kurtosis excess][ [$images/beta_dist_kurtosis.png] ]]
+[[kurtosis][`kurtosis + 3`]]
+[[parameter estimation][ ]]
+[[alpha
+
+ from mean and variance][`mean * (( (mean * (1 - mean)) / variance)- 1)`]]
+[[beta
+
+ from mean and variance][`(1 - mean) * (((mean * (1 - mean)) /variance)-1)`]]
+[[The member functions `estimate_alpha` and `estimate_beta`
+
+ from cdf and probability x
+
+ and *either* `alpha` or `beta`]
+ [Implemented in terms of the inverse incomplete beta functions
+
+ibeta_inva, and ibeta_invb respectively.]]
+[[`estimate_alpha`][`ibeta_inva(beta, x, probability)`]]
+[[`estimate_beta`][`ibeta_invb(alpha, x, probability)`]]
+]
+
+[endsect]
+
+[endsect]
+
+[section Images]
+
+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!
+
+[$images/digamma3.png]
+
+Now try again with a sample SVG image:
+
+[$images/open_clipart_library_logo.svg]
+
+
+[endsect]
+
+[section Equations]
+
+This page is largely to test equation handling in various browsers, unfortunately none of this works as well as it should (or at all?)
+in Internet Explorer....
+
+This equation is formatted from Latex text:
+
+'''<inlinemediaobject><textobject role="tex">ax^2 + bx + c = 0</textobject></inlinemediaobject>'''
+
+This equation is formed from MathML:
+
+'''<inlinemediaobject><textobject role="MathML"><?dbhtml-include href="test.mml"?></textobject></inlinemediaobject>'''
+
+This equation is SVG:
+
+'''<inlinemediaobject><imageobject><imagedata format="SVG" fileref="../test.svg"></imagedata></imageobject></inlinemediaobject>'''
+
+
+[endsect]
+
+[include test_HTML4_symbols.qbk]
+
+[include remez.qbk]
+
+[section:array Array Example Boostbook XML Documentation]
+[xinclude array.xml]
+[xinclude array1.xml]
+[xinclude array2.xml]
+[xinclude array3.xml]
+[xinclude array4.xml]
+[endsect]
+
+[section:accumulators Accumulators Example Doxygen Documentation]
+[xinclude statsdoc.xml]
+[endsect]
+
+
+

Added: sandbox/contract/doc/test/test.svg
==============================================================================
Binary file. No diff available.

Added: sandbox/contract/doc/test/test_HTML4_symbols.qbk
==============================================================================
--- (empty file)
+++ sandbox/contract/doc/test/test_HTML4_symbols.qbk 2013-02-28 18:35:01 EST (Thu, 28 Feb 2013)
@@ -0,0 +1,253 @@
+[section:test test HTML4 symbols]
+[/ Examples of using all the Greek and Math symbols defined in HTML4_symbols.qbk]
+[/ See http://www.htmlhelp.com/reference/html40/entities/symbols.html]
+
+[/ Also some miscellaneous math charaters added to this list - see the end.]
+
+[/ To use, enclose the template name in square brackets.]
+
+[section test Greek and Math symbols]
+
+[fnof],
+[Alpha],
+[Beta],
+[Gamma],
+[Delta],
+[Epsilon],
+[Zeta],
+[Eta],
+[Theta],
+[Iota],
+[Kappa],
+[Lambda],
+[Mu],
+[Nu],
+[Xi],
+[Omicron],
+[Pi],
+[Rho],
+[Sigma],
+[Tau],
+[Upsilon],
+[Phi],
+[Chi],
+[Psi],
+[Omega],
+[alpha],
+[beta],
+[gamma],
+[delta],
+[epsilon],
+[zeta],
+[eta],
+[theta],
+[iota],
+[kappa],
+[lambda],
+[mu],
+[nu],
+[xi],
+[omicron],
+[pi],
+[rho],
+[sigmaf],
+[sigma],
+[tau],
+[upsilon],
+[phi],
+[chi],
+[psi],
+[omega],
+[thetasym],
+[upsih],
+[piv],
+[bull],
+[hellip],
+[prime],
+[Prime],
+[oline],
+[frasl],
+[weierp],
+[image],
+[real],
+[trade],
+[alefsym],
+[larr],
+[uarr],
+[rarr],
+[darr],
+[harr],
+[crarr],
+[lArr],
+[uArr],
+[rArr],
+[dArr],
+[hArr],
+[forall],
+[part],
+[exist],
+[empty],
+[nabla],
+[isin],
+[notin],
+[ni],
+[prod],
+[sum],
+[minus],
+[lowast],
+[radic],
+[prop],
+[infin],
+[ang],
+[and],
+[or],
+[cap],
+[cup],
+[int],
+[there4],
+[sim],
+[cong],
+[asymp],
+[ne],
+[equiv],
+[le],
+[ge],
+[subset],
+[superset],
+[nsubset],
+[sube],
+[supe],
+[oplus],
+[otimes],
+[perp],
+[sdot],
+[lceil],
+[rceil],
+[lfloor],
+[rfloor],
+[lang],
+[rang],
+[loz],
+[spades],
+[clubs],
+[hearts],
+[diams]
+
+[endsect]
+
+[section test Latin1 symbols]
+[/ Examples of using all the symbols defined in Latin1_symbols.qbk]
+[/ http://www.htmlhelp.com/reference/html40/entities/latin1.html ]
+
+[/ To use, enclose the template name in square brackets.]
+
+[nbsp],
+[iexcl],
+[cent],
+[pound],
+[curren],
+[yen],
+[brvbar],
+[sectsign],
+[uml],
+[copy],
+[ordf],
+[laquo],
+[not],
+[shy],
+[reg],
+[macron],
+[deg],
+[plusmn],
+[sup2],
+[cubed],
+[acute],
+[micro],
+[para],
+[middot],
+[cedil],
+[sup1],
+[ordm],
+[raquo],
+[frac14],
+[frac12],
+[frac34],
+[iquest],
+[Agrave],
+[Aacute],
+[Acirc],
+[Atilde],
+[Auml],
+[Aring],
+[AElig],
+[Ccedil],
+[Egrave],
+[Eacute],
+[Ecirc],
+[Euml],
+[Igrave],
+[Iacute],
+[Icirc],
+[Iuml],
+[ETH],
+[Ntilde],
+[Ograve],
+[Oacute],
+[Ocirc],
+[Otilde],
+[Ouml],
+[times],
+[Oslash],
+[Ugrave],
+[Uacute],
+[Ucirc],
+[Uuml],
+[Yacute],
+[THORN],
+[szlig],
+[agrave],
+[aacute],
+[acirc],
+[atilde],
+[auml],
+[aring],
+[aelig],
+[ccedil],
+[egrave],
+[eacute],
+[ecirc],
+[euml],
+[igrave],
+[iacute],
+[icirc],
+[iuml],
+[eth],
+[ntilde],
+[ograve],
+[oacute],
+[ocirc],
+[otilde],
+[ouml],
+[divide],
+[oslash],
+[ugrave],
+[uacute],
+[ucirc],
+[uuml],
+[yacute],
+[thorn],
+[yuml],
+
+[endsect]
+
+
+[endsect]
+
+[/ testsymbols.qbk
+ Copyright 2006 John Maddock and Paul A. Bristow.
+ 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).
+]
+
+

Added: sandbox/contract/doc/test/weighted_tail_quantile.hpp
==============================================================================
--- (empty file)
+++ sandbox/contract/doc/test/weighted_tail_quantile.hpp 2013-02-28 18:35:01 EST (Thu, 28 Feb 2013)
@@ -0,0 +1,144 @@
+///////////////////////////////////////////////////////////////////////////////
+// weighted_tail_quantile.hpp
+//
+// Copyright 2006 Daniel Egloff, Olivier Gygi. 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)
+
+#ifndef BOOST_ACCUMULATORS_STATISTICS_WEIGHTED_TAIL_QUANTILE_HPP_DE_01_01_2006
+#define BOOST_ACCUMULATORS_STATISTICS_WEIGHTED_TAIL_QUANTILE_HPP_DE_01_01_2006
+
+#include <vector>
+#include <limits>
+#include <functional>
+#include <sstream>
+#include <stdexcept>
+#include <boost/throw_exception.hpp>
+#include <boost/parameter/keyword.hpp>
+#include <boost/mpl/placeholders.hpp>
+#include <boost/mpl/if.hpp>
+#include <boost/type_traits/is_same.hpp>
+#include <boost/accumulators/numeric/functional.hpp>
+#include <boost/accumulators/framework/depends_on.hpp>
+#include <boost/accumulators/framework/accumulator_base.hpp>
+#include <boost/accumulators/framework/extractor.hpp>
+#include <boost/accumulators/framework/parameters/sample.hpp>
+#include <boost/accumulators/statistics_fwd.hpp>
+#include <boost/accumulators/statistics/tail.hpp>
+#include <boost/accumulators/statistics/tail_quantile.hpp>
+#include <boost/accumulators/statistics/parameters/quantile_probability.hpp>
+
+#ifdef _MSC_VER
+# pragma warning(push)
+# pragma warning(disable: 4127) // conditional expression is constant
+#endif
+
+namespace boost { namespace accumulators
+{
+
+namespace impl
+{
+ ///////////////////////////////////////////////////////////////////////////////
+ // weighted_tail_quantile_impl
+ // Tail quantile estimation based on order statistics of weighted samples
+ /**
+ @brief Tail quantile estimation based on order statistics of weighted samples (for both left and right tails)
+
+ An estimator \f$\hat{q}\f$ of tail quantiles with level \f$\alpha\f$ based on order statistics
+ \f$X_{1:n} \leq X_{2:n} \leq\dots\leq X_{n:n}\f$ of weighted samples are given by \f$X_{\lambda:n}\f$ (left tail)
+ and \f$X_{\rho:n}\f$ (right tail), where
+
+ \f[
+ \lambda = \inf\left\{ l \left| \frac{1}{\bar{w}_n}\sum_{i=1}^{l} w_i \geq \alpha \right. \right\}
+ \f]
+
+ and
+
+ \f[
+ \rho = \sup\left\{ r \left| \frac{1}{\bar{w}_n}\sum_{i=r}^{n} w_i \geq (1 - \alpha) \right. \right\},
+ \f]
+
+ \f$n\f$ being the number of samples and \f$\bar{w}_n\f$ the sum of all weights.
+
+ @param quantile_probability
+ */
+ template<typename Sample, typename Weight, typename LeftRight>
+ struct weighted_tail_quantile_impl
+ : accumulator_base
+ {
+ typedef typename numeric::functional::average<Weight, std::size_t>::result_type float_type;
+ // for boost::result_of
+ typedef Sample result_type;
+
+ weighted_tail_quantile_impl(dont_care) {}
+
+ template<typename Args>
+ result_type result(Args const &args) const
+ {
+ float_type threshold = sum_of_weights(args)
+ * ( ( is_same<LeftRight, left>::value ) ? args[quantile_probability] : 1. - args[quantile_probability] );
+
+ std::size_t n = 0;
+ Weight sum = Weight(0);
+
+ while (sum < threshold)
+ {
+ if (n < static_cast<std::size_t>(tail_weights(args).size()))
+ {
+ sum += *(tail_weights(args).begin() + n);
+ n++;
+ }
+ else
+ {
+ if (std::numeric_limits<result_type>::has_quiet_NaN)
+ {
+ return std::numeric_limits<result_type>::quiet_NaN();
+ }
+ else
+ {
+ std::ostringstream msg;
+ msg << "index n = " << n << " is not in valid range [0, " << tail(args).size() << ")";
+ boost::throw_exception(std::runtime_error(msg.str()));
+ return Sample(0);
+ }
+ }
+ }
+
+ // Note that the cached samples of the left are sorted in ascending order,
+ // whereas the samples of the right tail are sorted in descending order
+ return *(boost::begin(tail(args)) + n - 1);
+ }
+ };
+} // namespace impl
+
+///////////////////////////////////////////////////////////////////////////////
+// tag::weighted_tail_quantile<>
+//
+namespace tag
+{
+ template<typename LeftRight>
+ struct weighted_tail_quantile
+ : depends_on<sum_of_weights, tail_weights<LeftRight> >
+ {
+ /// INTERNAL ONLY
+ typedef accumulators::impl::weighted_tail_quantile_impl<mpl::_1, mpl::_2, LeftRight> impl;
+ };
+}
+
+///////////////////////////////////////////////////////////////////////////////
+// extract::weighted_tail_quantile
+//
+namespace extract
+{
+ extractor<tag::quantile> const weighted_tail_quantile = {};
+}
+
+using extract::weighted_tail_quantile;
+
+}} // namespace boost::accumulators
+
+#ifdef _MSC_VER
+# pragma warning(pop)
+#endif
+
+#endif

Next message: lorcaminiti_at_[hidden]: "[Boost-commit] svn:boost r83220 - in sandbox/contract: . doc/pdf doc/test"
Previous message: lorcaminiti_at_[hidden]: "[Boost-commit] svn:boost r83218 - sandbox/contract"

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