Global weighted_tail

Global weighted_tail_quantile

boost::accumulators::extract::weighted_tail_quantile

Synopsis

// In header: <boost/trunk/doc/test/weighted_tail_quantile.hpp>
+// In header: <boost/git/doc/test/weighted_tail_quantile.hpp>
 
-extractor< tag::quantile > const weighted_tail_quantile;
+extractor< tag::quantile > const weighted_tail_quantile;

diff --git a/doc/test/gold/boost/accumulators/impl/weighted_tail_quantile__id226526.html b/doc/test/gold/boost/accumulators/impl/weighted_tail_quantile__id226526.html deleted file mode 100644 index 01c0dff986..0000000000 --- a/doc/test/gold/boost/accumulators/impl/weighted_tail_quantile__id226526.html +++ /dev/null @@ -1,91 +0,0 @@ - - - -Struct template weighted_tail_quantile_impl - - - - - - - - - - - - - - - -

Struct template weighted_tail_quantile_impl

boost::accumulators::impl::weighted_tail_quantile_impl — Tail quantile estimation based on order statistics of weighted samples (for both left and right tails).

Synopsis

// In header: <boost/trunk/doc/test/weighted_tail_quantile.hpp>
-
-template<typename Sample, typename Weight, typename LeftRight> 
-struct weighted_tail_quantile_impl {
-  // types
-  typedef numeric::functional::average< Weight, std::size_t >::result_type float_type; 
-  typedef Sample                                                           result_type;
-
-  // construct/copy/destruct
-  weighted_tail_quantile_impl(dont_care);
-
-  // public member functions
-  template<typename Args> result_type result(Args const &) const;
-};

Description

An estimator of tail quantiles with level based on order statistics of weighted samples are given by (left tail) and (right tail), where

Equation�1.�

and

Equation�2.�

being the number of samples and the sum of all weights.

-`weighted_tail_quantile_impl` - public - construct/copy/destruct

```
weighted_tail_quantile_impl(dont_care);
```

-`weighted_tail_quantile_impl` public member functions

template<typename Args> result_type result(Args const & args) const;

- - - -

- - diff --git a/doc/test/gold/boost/accumulators/impl/weighted_tail_quantile__id330298.html b/doc/test/gold/boost/accumulators/impl/weighted_tail_quantile__id330298.html new file mode 100644 index 0000000000..a33490853a --- /dev/null +++ b/doc/test/gold/boost/accumulators/impl/weighted_tail_quantile__id330298.html @@ -0,0 +1,91 @@ + + + +Struct template weighted_tail_quantile_impl + + + + + + + + + + + + + + + +

Struct template weighted_tail_quantile_impl

boost::accumulators::impl::weighted_tail_quantile_impl — Tail quantile estimation based on order statistics of weighted samples (for both left and right tails).

Synopsis

// In header: <boost/git/doc/test/weighted_tail_quantile.hpp>
+
+template<typename Sample, typename Weight, typename LeftRight> 
+struct weighted_tail_quantile_impl {
+  // types
+  typedef numeric::functional::average< Weight, std::size_t >::result_type float_type; 
+  typedef Sample                                                           result_type;
+
+  // construct/copy/destruct
+  weighted_tail_quantile_impl(dont_care);
+
+  // public member functions
+  template<typename Args> result_type result(Args const &) const;
+};

Description

An estimator of tail quantiles with level based on order statistics of weighted samples are given by (left tail) and (right tail), where

Equation 1.

and

Equation 2.

being the number of samples and the sum of all weights.

+`weighted_tail_quantile_impl` + public + construct/copy/destruct

```
weighted_tail_quantile_impl(dont_care);
```

+`weighted_tail_quantile_impl` public member functions

template<typename Args> result_type result(Args const & args) const;

+ + + +

+ + diff --git a/doc/test/gold/boost/accumulators/tag/weighted_tail_quantile.html b/doc/test/gold/boost/accumulators/tag/weighted_tail_quantile.html index 687d062f42..3e40ff43a9 100644 --- a/doc/test/gold/boost/accumulators/tag/weighted_tail_quantile.html +++ b/doc/test/gold/boost/accumulators/tag/weighted_tail_quantile.html @@ -1,12 +1,12 @@ - + Struct template weighted_tail_quantile - - + + - - + + @@ -19,25 +19,25 @@

Struct template weighted_tail_quantile

boost::accumulators::tag::weighted_tail_quantile

Synopsis

// In header: <boost/trunk/doc/test/weighted_tail_quantile.hpp>
+// In header: <boost/git/doc/test/weighted_tail_quantile.hpp>
 
-template<typename LeftRight> 
-struct weighted_tail_quantile : public boost::accumulators::depends_on< sum_of_weights, tail_weights< LeftRight > >
-{
-};
+template<typename LeftRight> 
+struct weighted_tail_quantile : public boost::accumulators::depends_on< sum_of_weights, tail_weights< LeftRight > >
+{
+};

diff --git a/doc/test/gold/boost/array.html b/doc/test/gold/boost/array.html index 6ed4b9a389..ab31a6ce62 100644 --- a/doc/test/gold/boost/array.html +++ b/doc/test/gold/boost/array.html @@ -1,9 +1,9 @@ - + Class template array - - + + @@ -20,165 +20,165 @@

Class template array

boost::array — STL compliant container wrapper for arrays of constant size

Synopsis

// In header: <boost/array.hpp>
+// In header: <boost/array.hpp>
 
-template<typename T, std::size_t N> 
-class array {
-public:
-  // types
-  typedef T                                                                        value_type;            
-  typedef T*                                                                       iterator;              
-  typedef const T*                                                                 const_iterator;        
-  typedef 
-                  std::reverse_iterator<iterator>
-                      reverse_iterator;      
-  typedef 
-                  std::reverse_iterator<const_iterator>
-                const_reverse_iterator;
-  typedef T&                                                                       reference;             
-  typedef const T&                                                                 const_reference;       
-  typedef std::size_t                                                              size_type;             
-  typedef std::ptrdiff_t                                                           difference_type;       
+template<typename T, std::size_t N> 
+class array {
+public:
+  // types
+  typedef T                                                                        value_type;            
+  typedef T*                                                                       iterator;              
+  typedef const T*                                                                 const_iterator;        
+  typedef 
+                  std::reverse_iterator<iterator>
+                      reverse_iterator;      
+  typedef 
+                  std::reverse_iterator<const_iterator>
+                const_reverse_iterator;
+  typedef T&                                                                       reference;             
+  typedef const T&                                                                 const_reference;       
+  typedef std::size_t                                                              size_type;             
+  typedef std::ptrdiff_t                                                           difference_type;       
 
-  // static constants
-  static const size_type static_size = N;
+  // static constants
+  static const size_type static_size = N;
 
-  // construct/copy/destruct
-  template<typename U> 
-    array& operator=(
-                     const array<U, N>&
-                  );
+  // construct/copy/destruct
+  template<typename U> 
+    array& operator=(
+                     const array<U, N>&
+                  );
 
-  // iterator support
-  iterator begin();
-  const_iterator begin() const;
-  iterator end();
-  const_iterator end() const;
+  // iterator support
+  iterator begin();
+  const_iterator begin() const;
+  iterator end();
+  const_iterator end() const;
 
-  // reverse iterator support
-  reverse_iterator rbegin();
-  const_reverse_iterator rbegin() const;
-  reverse_iterator rend();
-  const_reverse_iterator rend() const;
+  // reverse iterator support
+  reverse_iterator rbegin();
+  const_reverse_iterator rbegin() const;
+  reverse_iterator rend();
+  const_reverse_iterator rend() const;
 
-  // capacity
-  size_type size();
-  bool empty();
-  size_type max_size();
+  // capacity
+  size_type size();
+  bool empty();
+  size_type max_size();
 
-  // element access
-  reference operator[](size_type);
-  const_reference operator[](size_type) const;
-  reference at(size_type);
-  const_reference at(size_type) const;
-  reference front();
-  const_reference front() const;
-  reference back();
-  const_reference back() const;
-  const T* data() const;
-  T* c_array();
+  // element access
+  reference operator[](size_type);
+  const_reference operator[](size_type) const;
+  reference at(size_type);
+  const_reference at(size_type) const;
+  reference front();
+  const_reference front() const;
+  reference back();
+  const_reference back() const;
+  const T* data() const;
+  T* c_array();
 
-  // modifiers
-  void swap(
-                        array<T, N>&
-                     );
-  void assign(const T&);
-  T elems[N];
-};
+  // modifiers
+  void swap(
+                        array<T, N>&
+                     );
+  void assign(const T&);
+  T elems[N];
+};
 
-// specialized algorithms
-template<typename T, std::size_t N> 
-  void swap(
-                        array<T, N>&
-                     , 
+// specialized algorithms
+template<typename T, std::size_t N> 
+  void swap(
+                        array<T, N>&
+                     , 
             
-                        array<T, N>&
-                     );
+                        array<T, N>&
+                     );
 
-// comparisons
-template<typename T, std::size_t N> 
-  bool operator==(
-                        const array<T, N>&
-                     , 
+// comparisons
+template<typename T, std::size_t N> 
+  bool operator==(
+                        const array<T, N>&
+                     , 
                   
-                        const array<T, N>&
-                     );
-template<typename T, std::size_t N> 
-  bool operator!=(
-                        const array<T, N>&
-                     , 
+                        const array<T, N>&
+                     );
+template<typename T, std::size_t N> 
+  bool operator!=(
+                        const array<T, N>&
+                     , 
                   
-                        const array<T, N>&
-                     );
-template<typename T, std::size_t N> 
-  bool operator<(
-                        const array<T, N>&
-                     , 
+                        const array<T, N>&
+                     );
+template<typename T, std::size_t N> 
+  bool operator<(
+                        const array<T, N>&
+                     , 
                  
-                        const array<T, N>&
-                     );
-template<typename T, std::size_t N> 
-  bool operator>(
-                        const array<T, N>&
-                     , 
+                        const array<T, N>&
+                     );
+template<typename T, std::size_t N> 
+  bool operator>(
+                        const array<T, N>&
+                     , 
                  
-                        const array<T, N>&
-                     );
-template<typename T, std::size_t N> 
-  bool operator<=(
-                        const array<T, N>&
-                     , 
+                        const array<T, N>&
+                     );
+template<typename T, std::size_t N> 
+  bool operator<=(
+                        const array<T, N>&
+                     , 
                   
-                        const array<T, N>&
-                     );
-template<typename T, std::size_t N> 
-  bool operator>=(
-                        const array<T, N>&
-                     , 
+                        const array<T, N>&
+                     );
+template<typename T, std::size_t N> 
+  bool operator>=(
+                        const array<T, N>&
+                     , 
                   
-                        const array<T, N>&
-                     );
-
-Description
-
-
+                        const array<T, N>&
+                     );

Description

`array` public construct/copy/destruct

template<typename U> 
-  array& operator=(
-                     const array<U, N>&
-                   other);

template<typename U> 
+  array& operator=(
+                     const array<U, N>&
+                   other);

Effects:


-                        std::copy(rhs.begin(),rhs.end(), begin())
+                        std::copy(rhs.begin(),rhs.end(), begin())

-`array` iterator support

iterator begin();
-const_iterator begin() const;

+`array` iterator support

iterator begin();
+const_iterator begin() const;

@@ -193,9 +193,9 @@

iterator end();
-const_iterator end() const;

iterator end();
+const_iterator end() const;

@@ -212,13 +212,13 @@ -

-`array` reverse iterator support

reverse_iterator rbegin();
-const_reverse_iterator rbegin() const;

+`array` reverse iterator support

reverse_iterator rbegin();
+const_reverse_iterator rbegin() const;

@@ -227,9 +227,9 @@

reverse_iterator rend();
-const_reverse_iterator rend() const;

reverse_iterator rend();
+const_reverse_iterator rend() const;

@@ -240,12 +240,12 @@ -

-`array` capacity

-
```
size_type size();
```
+
+
+array capacity
+
1. +
```
size_type size();
```

@@ -256,8 +256,8 @@

-
```
bool empty();
```
+
+
```
bool empty();
```
@@ -274,8 +274,8 @@
-
```
size_type max_size();
```
+

size_type max_size();

@@ -294,13 +294,13 @@ -

-`array` element access

reference operator[](size_type i);
-const_reference operator[](size_type i) const;

+`array` element access

reference operator[](size_type i);
+const_reference operator[](size_type i) const;

@@ -323,9 +323,9 @@

reference at(size_type i);
-const_reference at(size_type i) const;

reference at(size_type i);
+const_reference at(size_type i) const;

@@ -346,9 +346,9 @@

reference front();
-const_reference front() const;

reference front();
+const_reference front() const;

@@ -369,9 +369,9 @@

reference back();
-const_reference back() const;

reference back();
+const_reference back() const;

@@ -392,8 +392,8 @@

-
```
const T* data() const;
```
+
+
```
const T* data() const;
```
@@ -410,8 +410,8 @@
-
```
T* c_array();
```
+

T* c_array();

@@ -430,14 +430,14 @@ -

-`array` modifiers

void swap(
-                        array<T, N>&
-                      other);

+`array` modifiers

void swap(
+                        array<T, N>&
+                      other);

@@ -445,7 +445,7 @@ @@ -458,15 +458,15 @@

Effects:


-                           std::swap_ranges(begin(), end(), other.begin())
+                           std::swap_ranges(begin(), end(), other.begin())

-
```
void assign(const T& value);
```
+

void assign(const T& value);

@@ -474,17 +474,17 @@ -

-`array` specialized algorithms

template<typename T, std::size_t N> 
-  void swap(
-                        array<T, N>&
-                      x, 
+
+
+array specialized algorithms
+
+template<typename T, std::size_t N> 
+  void swap(
+                        array<T, N>&
+                      x, 
             
-                        array<T, N>&
-                      y);
+                        array<T, N>&
+                      y);

Effects:


-                           std::fill_n(begin(), N, value)
+                           std::fill_n(begin(), N, value)

@@ -492,7 +492,7 @@ @@ -504,38 +504,38 @@

Effects:


-                           x.swap(y)
+                           x.swap(y)

-`array` comparisons

template<typename T, std::size_t N> 
-  bool operator==(
-                        const array<T, N>&
-                      x, 
+
+
+array comparisons
+
+
+template<typename T, std::size_t N> 
+  bool operator==(
+                        const array<T, N>&
+                      x, 
                   
-                        const array<T, N>&
-                      y);
+                        const array<T, N>&
+                      y);

Returns:


-                           std::equal(x.begin(), x.end(), y.begin())
+                           std::equal(x.begin(), x.end(), y.begin())

template<typename T, std::size_t N> 
-  bool operator!=(
-                        const array<T, N>&
-                      x, 
+
+template<typename T, std::size_t N> 
+  bool operator!=(
+                        const array<T, N>&
+                      x, 
                   
-                        const array<T, N>&
-                      y);
+                        const array<T, N>&
+                      y);

@@ -546,34 +546,34 @@

template<typename T, std::size_t N> 
-  bool operator<(
-                        const array<T, N>&
-                      x, 
+
+template<typename T, std::size_t N> 
+  bool operator<(
+                        const array<T, N>&
+                      x, 
                  
-                        const array<T, N>&
-                      y);
+                        const array<T, N>&
+                      y);

Returns:


-                           std::lexicographical_compare(x.begin(), x.end(), y.begin(), y.end())
+                           std::lexicographical_compare(x.begin(), x.end(), y.begin(), y.end())

template<typename T, std::size_t N> 
-  bool operator>(
-                        const array<T, N>&
-                      x, 
+
+template<typename T, std::size_t N> 
+  bool operator>(
+                        const array<T, N>&
+                      x, 
                  
-                        const array<T, N>&
-                      y);
+                        const array<T, N>&
+                      y);

@@ -584,14 +584,14 @@

template<typename T, std::size_t N> 
-  bool operator<=(
-                        const array<T, N>&
-                      x, 
+
+template<typename T, std::size_t N> 
+  bool operator<=(
+                        const array<T, N>&
+                      x, 
                   
-                        const array<T, N>&
-                      y);
+                        const array<T, N>&
+                      y);

@@ -602,14 +602,14 @@

template<typename T, std::size_t N> 
-  bool operator>=(
-                        const array<T, N>&
-                      x, 
+
+template<typename T, std::size_t N> 
+  bool operator>=(
+                        const array<T, N>&
+                      x, 
                   
-                        const array<T, N>&
-                      y);
+                        const array<T, N>&
+                      y);

@@ -626,7 +626,7 @@

diff --git a/doc/test/gold/document_to_test_formatting/accumulators.html b/doc/test/gold/document_to_test_formatting/accumulators.html index 6febad2b78..cdad18cfcd 100644 --- a/doc/test/gold/document_to_test_formatting/accumulators.html +++ b/doc/test/gold/document_to_test_formatting/accumulators.html @@ -1,9 +1,9 @@ - + Accumulators Example Doxygen Documentation - - + + @@ -20,41 +20,41 @@

Accumulators Example Doxygen Documentation

Statistics Library Reference

Statistics Library Reference

Header <boost/trunk/doc/test/weighted_tail_quantile.hpp>

Header <boost/git/doc/test/weighted_tail_quantile.hpp>

-Header <boost/trunk/doc/test/weighted_tail_quantile.hpp>

namespace boost {
-  namespace accumulators {
-    namespace extract {
-      extractor< tag::quantile > const weighted_tail_quantile;
-    }
-    namespace impl {
-      template<typename Sample, typename Weight, typename LeftRight> 
-        struct weighted_tail_quantile_impl;
-    }
-    namespace tag {
-      template<typename LeftRight> struct weighted_tail_quantile;
-    }
-  }
-}

+Header <boost/git/doc/test/weighted_tail_quantile.hpp>

namespace boost {
+  namespace accumulators {
+    namespace extract {
+      extractor< tag::quantile > const weighted_tail_quantile;
+    }
+    namespace impl {
+      template<typename Sample, typename Weight, typename LeftRight> 
+        struct weighted_tail_quantile_impl;
+    }
+    namespace tag {
+      template<typename LeftRight> struct weighted_tail_quantile;
+    }
+  }
+}

diff --git a/doc/test/gold/document_to_test_formatting/array.html b/doc/test/gold/document_to_test_formatting/array.html index 176f09cd8e..361c0aa05f 100644 --- a/doc/test/gold/document_to_test_formatting/array.html +++ b/doc/test/gold/document_to_test_formatting/array.html @@ -1,9 +1,9 @@ - + Array Example Boostbook XML Documentation - - + + @@ -20,21 +20,21 @@

Array Example Boostbook XML Documentation

Introduction
Reference
Reference
Design Rationale
For more information...
Acknowledgements

Introduction

The C++ Standard Template Library STL as part of the C++ @@ -70,90 +70,90 @@ Standard). The reasons array is not an reversible STL container is because:

No constructors are provided.
Elements may have an undetermined initial value (see the section called “Design Rationale”).
-swap() has no constant complexity.
-size() is always constant, based on the second template argument of the type.
The container provides no allocator support.

No constructors are provided.
Elements may have an undetermined initial value (see the section called “Design Rationale”).
+swap() has no constant complexity.
+size() is always constant, based on the second template argument of the type.
The container provides no allocator support.

It doesn't fulfill the requirements of a "sequence" (see Section 23.1.1, [lib.sequence.reqmts] of the C++ Standard), except that:

-front() and back() are provided.
-operator[] and at() are provided.

+front() and back() are provided.
+operator[] and at() are provided.

-Reference

+Reference

Header <boost/array.hpp>

Header <boost/array.hpp>

namespace boost {
-  template<typename T, std::size_t N> class array;
-  template<typename T, std::size_t N> 
-    void swap(
-                        array<T, N>&
-                     , 
+namespace boost {
+  template<typename T, std::size_t N> class array;
+  template<typename T, std::size_t N> 
+    void swap(
+                        array<T, N>&
+                     , 
               
-                        array<T, N>&
-                     );
-  template<typename T, std::size_t N> 
-    bool operator==(
-                        const array<T, N>&
-                     , 
+                        array<T, N>&
+                     );
+  template<typename T, std::size_t N> 
+    bool operator==(
+                        const array<T, N>&
+                     , 
                     
-                        const array<T, N>&
-                     );
-  template<typename T, std::size_t N> 
-    bool operator!=(
-                        const array<T, N>&
-                     , 
+                        const array<T, N>&
+                     );
+  template<typename T, std::size_t N> 
+    bool operator!=(
+                        const array<T, N>&
+                     , 
                     
-                        const array<T, N>&
-                     );
-  template<typename T, std::size_t N> 
-    bool operator<(
-                        const array<T, N>&
-                     , 
+                        const array<T, N>&
+                     );
+  template<typename T, std::size_t N> 
+    bool operator<(
+                        const array<T, N>&
+                     , 
                    
-                        const array<T, N>&
-                     );
-  template<typename T, std::size_t N> 
-    bool operator>(
-                        const array<T, N>&
-                     , 
+                        const array<T, N>&
+                     );
+  template<typename T, std::size_t N> 
+    bool operator>(
+                        const array<T, N>&
+                     , 
                    
-                        const array<T, N>&
-                     );
-  template<typename T, std::size_t N> 
-    bool operator<=(
-                        const array<T, N>&
-                     , 
+                        const array<T, N>&
+                     );
+  template<typename T, std::size_t N> 
+    bool operator<=(
+                        const array<T, N>&
+                     , 
                     
-                        const array<T, N>&
-                     );
-  template<typename T, std::size_t N> 
-    bool operator>=(
-                        const array<T, N>&
-                     , 
+                        const array<T, N>&
+                     );
+  template<typename T, std::size_t N> 
+    bool operator>=(
+                        const array<T, N>&
+                     , 
                     
-                        const array<T, N>&
-                     );
-}
+                        const array<T, N>&
+                     );
+}

Design Rationale

@@ -162,8 +162,8 @@ Section 8.5.1, [dcl.init.aggr], of the C++ Standard). This would mean:

An array can be initialized with a brace-enclosing, comma-separated list of initializers for the elements of the container, written in increasing subscript @@ -172,7 +172,7 @@

                boost::array<int,4> a = { { 1, 2, 3 } };

Note that if there are fewer elements in the initializer list, then each remaining element gets default-initialized (thus, it has a defined value). @@ -187,11 +187,11 @@ , because the rule says that aggregates may have:

No user-declared constructors.
No private or protected non-static data members.
No base classes.
No virtual functions.

No user-declared constructors.
No private or protected non-static data members.
No base classes.
No virtual functions.

For more information...

@@ -225,11 +225,11 @@

-��The�C++�Standard�Library�-�A�Tutorial�and�Reference
-��by�Nicolai�M.�Josuttis
-��Addison�Wesley�Longman,�1999
-��ISBN�0-201-37926-0
-��

+         The C++ Standard Library - A Tutorial and Reference
+         by Nicolai M. Josuttis
+         Addison Wesley Longman, 1999
+         ISBN 0-201-37926-0
+

@@ -239,7 +239,7 @@

Acknowledgements

Doug Gregor ported the documentation to the BoostBook format.

@@ -247,7 +247,7 @@

diff --git a/doc/test/gold/document_to_test_formatting/basic_formatting.html b/doc/test/gold/document_to_test_formatting/basic_formatting.html index 396546acdd..b03332f923 100644 --- a/doc/test/gold/document_to_test_formatting/basic_formatting.html +++ b/doc/test/gold/document_to_test_formatting/basic_formatting.html @@ -1,9 +1,9 @@ - + Basic Formatting - - + + @@ -20,9 +20,9 @@

Basic Formatting

@@ -39,7 +39,7 @@

Blockquote

Headings

Font Styles @@ -51,26 +51,23 @@ `teletype with underline`.

Replaceable Text

- Text that is intended to be user-replaceable is - - rendered like this - - . + Text that is intended to be user-replaceable is rendered like + this.

Quotations

- Here we go: “A question that sometimes drives me hazy: am I or are - the others crazy?”--Einstein + 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 @@ -81,11 +78,11 @@ 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.” + “Here's the rule for bargains: ‘Do other men, for they would + do you.’ That's the true business precept.”

Inline Code @@ -95,7 +92,7 @@ in it. The code should be syntax highlighted.

Links

@@ -103,40 +100,50 @@ Try this: this is boost's website.... it should be visible as a link.

+ This is 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 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 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 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. +

Footnotes

- Here's one - ^[1] - . + Here's one ^[1].

- And here's another - ^[2] - . + And here's another ^[2].

Blockquote

Lets indent the next paragraph:

-
-
-
- Here we go!!! -
-
-
-

+ Here we go!!! +

Headings

@@ -144,49 +151,49 @@ Now try rendering some heading styles:

- + Heading 1

- + Heading 2

- + Heading 3

- + Heading 4

- + Heading 5

- + Heading 6

^[1] - A sample footnote -

^[2] - Another sample footnote -

^[1] + A sample footnote +

^[2] + Another sample footnote +

diff --git a/doc/test/gold/document_to_test_formatting/blurbs.html b/doc/test/gold/document_to_test_formatting/blurbs.html index ec8ee51a62..44843dc40c 100644 --- a/doc/test/gold/document_to_test_formatting/blurbs.html +++ b/doc/test/gold/document_to_test_formatting/blurbs.html @@ -1,9 +1,9 @@ - + Blurbs - - + + @@ -20,9 +20,9 @@

Blurbs

@@ -32,7 +32,7 @@

Admonishments

Blurbs

Preformatted text @@ -67,7 +67,7 @@ Standard deviation 1 is less than standard deviation 2 REJECTED Standard deviation 1 is greater than standard deviation 2 REJECTED

Admonishments

@@ -76,7 +76,7 @@ Standard deviation 1 is greater than standard deviation 2 REJECTED

- +

		Note
		@@ -85,7 +85,7 @@ Standard deviation 1 is greater than standard deviation 2 REJECTED

- +

		Tip
		@@ -94,7 +94,7 @@ Standard deviation 1 is greater than standard deviation 2 REJECTED

- +

		Important
		@@ -103,7 +103,7 @@ Standard deviation 1 is greater than standard deviation 2 REJECTED

- +

		Caution
		@@ -112,7 +112,7 @@ Standard deviation 1 is greater than standard deviation 2 REJECTED

- +

		Warning
		@@ -125,7 +125,7 @@ Standard deviation 1 is greater than standard deviation 2 REJECTED

Blurbs

@@ -145,7 +145,7 @@ Standard deviation 1 is greater than standard deviation 2 REJECTED

diff --git a/doc/test/gold/document_to_test_formatting/code_blocks.html b/doc/test/gold/document_to_test_formatting/code_blocks.html index 2f22e82330..fefa9e089e 100644 --- a/doc/test/gold/document_to_test_formatting/code_blocks.html +++ b/doc/test/gold/document_to_test_formatting/code_blocks.html @@ -1,9 +1,9 @@ - + Code Blocks - - + + @@ -20,21 +20,23 @@

Code Blocks

Embedded code
Code + With a Very Long Line
Imported code and callouts
Larger example

Embedded code @@ -52,7 +54,15 @@ }

+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; }
+

Imported code and callouts @@ -61,99 +71,87 @@ Here's some code with left-placed callouts:

- +

class x
 {
 public:
 
-    x() : n(0)
+    x() : n(0)
     {
     }
 
-    ~x()
+    ~x()
     {
     }
 
-    int get() const
+    int get() const
     {
         return n; 
     }
 
-    void set(int n_)
+    void set(int n_)
     {
         n = n_;
     }
 };

- + - + - + + member variable

- + + member variable

		Constructor
		Destructor
		Get the `n` - member variable
		Set the `n` - member variable

And again with callouts placed exactly where we put them:

- +

std::string foo_bar() 
+std::string foo_bar() 
 {
-    return "foo-bar"; 
+    return "foo-bar"; 
 }
 
 
-        
+      
 
         
-
-          
 
-
+
+        for details
-
+
   
  The Mythical FooBar. See Foobar
-          for details  
 
   
  return 'em, foo-bar man! 
 
 
-
-

Larger example @@ -413,7 +411,7 @@

diff --git a/doc/test/gold/document_to_test_formatting/images.html b/doc/test/gold/document_to_test_formatting/images.html index a5e4fc625a..8303d68f60 100644 --- a/doc/test/gold/document_to_test_formatting/images.html +++ b/doc/test/gold/document_to_test_formatting/images.html @@ -1,9 +1,9 @@ - + Images - - + + @@ -20,9 +20,9 @@

Images

@@ -45,7 +45,7 @@

diff --git a/doc/test/gold/document_to_test_formatting/lists_and_tables.html b/doc/test/gold/document_to_test_formatting/lists_and_tables.html index ee2dee5f22..b372e4f430 100644 --- a/doc/test/gold/document_to_test_formatting/lists_and_tables.html +++ b/doc/test/gold/document_to_test_formatting/lists_and_tables.html @@ -1,9 +1,9 @@ - + Lists and Tables - - + + @@ -20,9 +20,9 @@

Lists and Tables @@ -33,119 +33,119 @@ Lists
Tables

Lists

A numbered list:

- One -
- Two -
- Three -
1. - Three.a -
2. - Three.b -
3. - Three.c -
-

- Four -

- Four.a -

- Four.a.i +
1. + One +
2. + Two +
3. + Three +
  1. + Three.a +
  2. + Three.b
  3. - Four.a.ii +
  4. + Three.c
  -
-
- Five -
+ Four +
1. + Four.a +
  1. + Four.a.i +
  2. + Four.a.ii +
  +
+
+ Five +

An unordered list:

- First -
- Second -
- Third -

+ First +
+ Second +
+ Third +

A mixture of the two:

- 1 -
- - 1.a -
  1. - 1.a.1 +
    +
    + 1 +
    +
    + 1.a +
    +
    + 1.a.1 +
    +
    + 1.a.2 +
    +
    
    -
    - 1.a.2 +
    + 1.b
    -
    -
  2. - 1.b -
-

- 2 -

- 2.a -
- 2.b -
1. - 2.b.1 +
2. + 2 +
  - + 2.a
  - - 2.b.2 -
    -
    - 2.b.2.a -
    -
    - 2.b.2.b -
    +
    + 2.b +
    +
    + 2.b.1 +
    +
    + 2.b.2 +
    +
    + 2.b.2.a +
    +
    + 2.b.2.b +
    
    -
    +
    -
    +
    -

Variable Lists @@ -155,20 +155,20 @@

term 1

- The definition of term 1 -
+ The definition of term 1 +

term 2

- The definition of term 2 -
+ The definition of term 2 +

term 3

- The definition of term 3 -
+ The definition of term 3 +

Tables

@@ -176,7 +176,7 @@ Here's a big table with code and other tricky things:

Table�1.�Notes on the Implementation of the Beta Distribution

Table 1. Notes on the Implementation of the Beta Distribution

@@ -184,253 +184,257 @@ +

+ Function +

+ +

+ Implementation Notes +

+ - +

+ pdf +

+ + +

+ 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 +

+ + - +

+ mode +

+ + - +

+ skewness +

+ + +

+ kurtosis excess +

+ +

+ beta_dist_kurtosis +

+ +

+ kurtosis +

+ +

+ kurtosis + + 3 +

+ +

+ parameter estimation +

+ + - +

+ alpha +

+ from mean and variance +

+ + - +

+ beta +

+ from mean and variance +

+ + - +

+ The member functions estimate_alpha + and estimate_beta +

+ from cdf and probability x +

+ and either alpha + or beta +

+ + - +

+ estimate_alpha +

+ + - +

+ estimate_beta +

+ +

- - Function - -	- - Implementation Notes - -
- - pdf - -	- - f(x;α,β) = x^{α - 1} (1 - x)^{β -1} / B(α, β) - - - Implemented using ibeta_derivative(a, b, x). - -	+ + f(x;α,β) = x^{α - 1} (1 - x)^{β -1} / B(α, β) + + + 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)` - -	+ + `a * + b / + (a+b)^2 * (a + + b + + 1)` + +
- - mode - -	- - `(a-1) - / (a + b + 2)` - -	+ + `(a-1) / (a + + b + + 2)` + +
- - skewness - -	- - `2 (b-a) sqrt(a+b+1)/(a+b+2) * - sqrt(a * b)` - -	+ + `2 (b-a) + sqrt(a+b+1)/(a+b+2) * sqrt(a + * b)` + +
- - kurtosis excess - -	- - - -
- - kurtosis - -	- - `kurtosis + - 3` - -
- - parameter estimation - -	- - -
- - alpha - - - from mean and variance - -	- - `mean * - (( (mean * - (1 - - mean)) / variance)- - 1)` - -	+ + `mean * + (( (mean * + (1 + - mean)) / variance)- + 1)` + +
- - beta - - - from mean and variance - -	- - `(1 - - mean) * (((mean - * (1 - mean)) - /variance)-1)` - -	+ + `(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. - -	+ + Implemented in terms of the inverse incomplete beta functions + + + ibeta_inva, and ibeta_invb respectively. + +
- - `estimate_alpha` - -	- - `ibeta_inva(beta, x, probability)` - -	+ + `ibeta_inva(beta, + x, + probability)` + +
- - `estimate_beta` - -	- - `ibeta_invb(alpha, - x, - probability)` - -	+ + `ibeta_invb(alpha, + x, + probability)` + +

@@ -440,7 +444,7 @@

diff --git a/doc/test/gold/document_to_test_formatting/remez.html b/doc/test/gold/document_to_test_formatting/remez.html index 4752abc202..ad8d8fab4c 100644 --- a/doc/test/gold/document_to_test_formatting/remez.html +++ b/doc/test/gold/document_to_test_formatting/remez.html @@ -1,9 +1,9 @@ - + Sample Article (The Remez Method) - - + + @@ -20,9 +20,9 @@

Sample Article (The Remez Method) @@ -66,17 +66,17 @@ 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. -
+
+
+ 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 @@ -95,7 +95,7 @@ are located!

- + The Remez Method
@@ -150,7 +150,7 @@

- +

Note

@@ -174,7 +174,7 @@

- + Remez Step 1

@@ -204,7 +204,7 @@ to 5.6x10^-4.

- + Remez Step 2

@@ -231,7 +231,7 @@ In our example we perform multi-point exchange.

- + Iteration

@@ -247,7 +247,7 @@

- + Rational Approximations
@@ -295,7 +295,7 @@ number of terms overall.

- + Practical Considerations
@@ -401,7 +401,7 @@ minimax solution (5x10^-4).

- + Remez Method Checklist
@@ -410,52 +410,52 @@ 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. -
+
+
+ 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. +

- + References

@@ -520,7 +520,7 @@
-

Copyright � 2007 John Maddock, Joel de Guzman, Eric Niebler and Matias +
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) @@ -529,7 +529,7 @@

- +
diff --git a/doc/test/gold/document_to_test_formatting/test.html b/doc/test/gold/document_to_test_formatting/test.html index 3e7abb4a22..beb278dd1b 100644 --- a/doc/test/gold/document_to_test_formatting/test.html +++ b/doc/test/gold/document_to_test_formatting/test.html @@ -1,9 +1,9 @@ - + test HTML4 symbols - - + + @@ -20,9 +20,9 @@

- +
-
+

test HTML4 symbols
@@ -32,7 +32,7 @@
test Latin1 symbols

-
+

test Greek and Math symbols @@ -44,21 +44,21 @@ ⊥, ⋅, ⌈, ⌉, ⌊, ⌋, 〈, 〉, ◊, ♠, ♣, ♥, ♦

-
+

test Latin1 symbols

- �, �, �, �, �, �, �, �, �, �, �, �, �, �, �, �, �, �, �, �, �, �, �, �, �, �, �, �, �, �, �, �, �, �, �, �, �, - �, �, �, �, �, �, �, �, �, �, �, �, �, �, �, �, �, �, �, �, �, �, �, �, �, �, �, �, �, �, �, �, �, �, �, �, �, - �, �, �, �, �, �, �, �, �, �, �, �, �, �, �, �, �, �, �, �, �, �, + , ¡, ¢, £, ¤, ¥, ¦, §, ¨, ©, ª, «, ¬, , ®, ¯, °, ±, ², ³, ´, µ, ¶, ·, ¸, ¹, º, », ¼, ½, ¾, ¿, À, Á, Â, Ã, Ä, + Å, Æ, Ç, È, É, Ê, Ë, Ì, Í, Î, Ï, Ð, Ñ, Ò, Ó, Ô, Õ, Ö, ×, Ø, Ù, Ú, Û, Ü, Ý, Þ, ß, à, á, â, ã, ä, å, æ, ç, è, é, + ê, ë, ì, í, î, ï, ð, ñ, ò, ó, ô, õ, ö, ÷, ø, ù, ú, û, ü, ý, þ, ÿ,

-

Copyright � 2007 John Maddock, Joel de Guzman, Eric Niebler and Matias +
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) @@ -67,7 +67,7 @@

- +
diff --git a/doc/test/gold/images/accumulators/form_2.png b/doc/test/gold/images/accumulators/form_2.png index 49a572f11b..c81c9a4f9f 100644 Binary files a/doc/test/gold/images/accumulators/form_2.png and b/doc/test/gold/images/accumulators/form_2.png differ diff --git a/doc/test/gold/images/accumulators/form_5.png b/doc/test/gold/images/accumulators/form_5.png index 304603baa3..d7481e0616 100644 Binary files a/doc/test/gold/images/accumulators/form_5.png and b/doc/test/gold/images/accumulators/form_5.png differ diff --git a/doc/test/gold/images/accumulators/form_6.png b/doc/test/gold/images/accumulators/form_6.png index 4783b96345..dcfd30cb6c 100644 Binary files a/doc/test/gold/images/accumulators/form_6.png and b/doc/test/gold/images/accumulators/form_6.png differ diff --git a/doc/test/gold/index.html b/doc/test/gold/index.html index e9afa5f1d3..64aafe9142 100644 --- a/doc/test/gold/index.html +++ b/doc/test/gold/index.html @@ -1,9 +1,9 @@ - + Document To Test Formatting - - + + @@ -17,8 +17,8 @@ More
-
-
+
+

@@ -37,10 +37,10 @@ Matias Capeletto

-
Copyright � 2007 John Maddock, Joel de Guzman, Eric Niebler and Matias +
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)
@@ -56,6 +56,8 @@

Embedded code
+
Code + With a Very Long Line

Imported code and callouts

Larger @@ -104,7 +106,7 @@ XML Documentation

Introduction
-
Reference
+
Reference

Design Rationale

For more information...

Acknowledgements
@@ -114,7 +116,7 @@
Statistics Library Reference

-
+

Introduction
@@ -140,10 +142,10 @@

- +
Last revised: December 09, 2008 at 12:07:46 GMT
Last revised: July 19, 2010 at 19:45:35 GMT

-
+
-- cgit v1.2.1

		The Mythical FooBar. See Foobar - for details
		return 'em, foo-bar man!