From fb752638c9e4021f5d513fcc28c51021212656f7 Mon Sep 17 00:00:00 2001 From: Aleksey Gurtovoy Date: Thu, 13 Mar 2003 12:34:25 +0000 Subject: [PATCH] merge fixes from the main trunk [SVN r17888] --- doc/index.html | 6 +- doc/ref/Acknowledgements.html | 4 +- doc/ref/Algorithms.html | 30 ++++----- doc/ref/Bidirectional_Iterator.html | 4 +- doc/ref/Bidirectional_Sequence.html | 4 +- doc/ref/Categorized_index.html | 30 ++++++--- doc/ref/Extensible_Sequence.html | 4 +- doc/ref/Forward_Iterator.html | 4 +- doc/ref/Forward_Sequence.html | 4 +- doc/ref/Input_Iterator.html | 6 +- doc/ref/Integral_Constant.html | 14 ++-- doc/ref/Iterators.html | 26 +++++--- doc/ref/Metafunction.html | 79 ++++++++++++++--------- doc/ref/Metafunctions.html | 64 ++++++++++++------ doc/ref/Random_Access_Iterator.html | 4 +- doc/ref/Random_Access_Sequence.html | 4 +- doc/ref/Reference/advance.html | 8 +-- doc/ref/Reference/at.html | 22 +++---- doc/ref/Reference/at_c.html | 24 +++---- doc/ref/Reference/back.html | 8 +-- doc/ref/Reference/begin.html | 8 +-- doc/ref/Reference/clear.html | 8 +-- doc/ref/Reference/contains.html | 12 ++-- doc/ref/Reference/copy.html | 8 +-- doc/ref/Reference/copy_backward.html | 8 +-- doc/ref/Reference/copy_backward_if.html | 12 ++-- doc/ref/Reference/copy_if.html | 12 ++-- doc/ref/Reference/count.html | 8 +-- doc/ref/Reference/count_if.html | 10 +-- doc/ref/Reference/distance.html | 8 +-- doc/ref/Reference/divides.html | 14 ++-- doc/ref/Reference/empty.html | 8 +-- doc/ref/Reference/end.html | 8 +-- doc/ref/Reference/equal.html | 12 ++-- doc/ref/Reference/equal_to.html | 18 +++--- doc/ref/Reference/erase.html | 8 +-- doc/ref/Reference/erase_all.html | 62 ------------------ doc/ref/Reference/erase_if.html | 62 ------------------ doc/ref/Reference/erase_range.html | 8 +-- doc/ref/Reference/filter_view.html | 13 ++-- doc/ref/Reference/find.html | 10 +-- doc/ref/Reference/find_if.html | 10 +-- doc/ref/Reference/fold.html | 12 ++-- doc/ref/Reference/fold_backward.html | 12 ++-- doc/ref/Reference/front.html | 8 +-- doc/ref/Reference/greater.html | 16 ++--- doc/ref/Reference/greater_equal.html | 18 +++--- doc/ref/Reference/insert.html | 8 +-- doc/ref/Reference/insert_range.html | 8 +-- doc/ref/Reference/iter_fold.html | 10 +-- doc/ref/Reference/iter_fold_backward.html | 12 ++-- doc/ref/Reference/iter_fold_if.html | 70 -------------------- doc/ref/Reference/iterator_category.html | 10 +-- doc/ref/Reference/less.html | 18 +++--- doc/ref/Reference/less_equal.html | 18 +++--- doc/ref/Reference/list.html | 14 ++-- doc/ref/Reference/list_c.html | 14 ++-- doc/ref/Reference/logical_and.html | 62 ------------------ doc/ref/Reference/logical_not.html | 51 --------------- doc/ref/Reference/logical_or.html | 62 ------------------ doc/ref/Reference/lower_bound.html | 15 +++-- doc/ref/Reference/minus.html | 14 ++-- doc/ref/Reference/modulus.html | 10 +-- doc/ref/Reference/multiplies.html | 14 ++-- doc/ref/Reference/negate.html | 8 +-- doc/ref/Reference/next.html | 61 ----------------- doc/ref/Reference/not_equal_to.html | 18 +++--- doc/ref/Reference/plus.html | 14 ++-- doc/ref/Reference/pop_back.html | 8 +-- doc/ref/Reference/pop_front.html | 8 +-- doc/ref/Reference/prior.html | 61 ----------------- doc/ref/Reference/push_back.html | 14 ++-- doc/ref/Reference/push_front.html | 10 +-- doc/ref/Reference/range_c.html | 8 +-- doc/ref/Reference/remove.html | 8 +-- doc/ref/Reference/remove_if.html | 8 +-- doc/ref/Reference/replace.html | 8 +-- doc/ref/Reference/replace_if.html | 12 ++-- doc/ref/Reference/reverse.html | 51 +++++++-------- doc/ref/Reference/size.html | 8 +-- doc/ref/Reference/sort.html | 62 ------------------ doc/ref/Reference/transform.html | 8 +-- doc/ref/Reference/transform_view.html | 13 ++-- doc/ref/Reference/unique.html | 62 ------------------ doc/ref/Reference/upper_bound.html | 15 +++-- doc/ref/Reference/vector.html | 14 ++-- doc/ref/Reference/vector_c.html | 14 ++-- doc/ref/Sequence.html | 4 +- doc/ref/Sequences.html | 37 ++++++----- doc/ref/Table_of_Content.html | 14 ---- doc/ref/Trivial_Iterator.html | 4 +- test/Jamfile | 3 + 92 files changed, 575 insertions(+), 1132 deletions(-) delete mode 100644 doc/ref/Reference/erase_all.html delete mode 100644 doc/ref/Reference/erase_if.html delete mode 100644 doc/ref/Reference/iter_fold_if.html delete mode 100644 doc/ref/Reference/logical_and.html delete mode 100644 doc/ref/Reference/logical_not.html delete mode 100644 doc/ref/Reference/logical_or.html delete mode 100644 doc/ref/Reference/next.html delete mode 100644 doc/ref/Reference/prior.html delete mode 100644 doc/ref/Reference/sort.html delete mode 100644 doc/ref/Reference/unique.html delete mode 100644 doc/ref/Table_of_Content.html diff --git a/doc/index.html b/doc/index.html index da49330..b72de78 100644 --- a/doc/index.html +++ b/doc/index.html @@ -72,7 +72,7 @@ +

Querying algorithms

+ +

Transformation algorithms

+

-Table of Content
Last edited July 20, 2002 12:00 am \ No newline at end of file +Table of Contents
Last edited March 10, 2003 1:55 am \ No newline at end of file diff --git a/doc/ref/Bidirectional_Iterator.html b/doc/ref/Bidirectional_Iterator.html index 3f89e03..3dda373 100644 --- a/doc/ref/Bidirectional_Iterator.html +++ b/doc/ref/Bidirectional_Iterator.html @@ -2,7 +2,7 @@ boost::mpl::Bidirectional Iterator -

[Home]Bidirectional Iterator

Description

+

[Home]Bidirectional Iterator

Description

A Bidirectional Iterator is a Forward Iterator that provides a way to obtain the previous element in a sequence.

@@ -47,4 +47,4 @@ For any bidirectional iterators i and j the following

Bidirectional Sequence, Forward Iterator, Random Access Iterator

-Table of Content
Last edited July 15, 2002 11:33 am \ No newline at end of file +Table of Contents
Last edited July 15, 2002 11:33 am \ No newline at end of file diff --git a/doc/ref/Bidirectional_Sequence.html b/doc/ref/Bidirectional_Sequence.html index 3055fb8..dcd7e2c 100644 --- a/doc/ref/Bidirectional_Sequence.html +++ b/doc/ref/Bidirectional_Sequence.html @@ -2,7 +2,7 @@ boost::mpl::Bidirectional Sequence -

[Home]Bidirectional Sequence

Description

+

[Home]Bidirectional Sequence

Description

A Bidirectional Sequence is a Forward Sequence, which provides iterators that satisfy the Bidirectional Iterator requirements.

@@ -32,4 +32,4 @@ Bidirectional Sequence does not define any new expressions beyond those defined

Forward Sequence, Random Access Sequence, Bidirectional Iterator

-Table of Content
Last edited July 15, 2002 2:36 pm \ No newline at end of file +Table of Contents
Last edited July 15, 2002 2:36 pm \ No newline at end of file diff --git a/doc/ref/Categorized_index.html b/doc/ref/Categorized_index.html index c4a8480..480e672 100644 --- a/doc/ref/Categorized_index.html +++ b/doc/ref/Categorized_index.html @@ -2,7 +2,7 @@ boost::mpl::Categorized index -

[Home]Categorized index

Concepts

+

[Home]Categorized index

Concepts

-

Components

+

Components

+

-Table of Content
Last edited July 17, 2002 8:58 am \ No newline at end of file +Table of Contents
Last edited March 12, 2003 7:17 am \ No newline at end of file diff --git a/doc/ref/Extensible_Sequence.html b/doc/ref/Extensible_Sequence.html index 89cd27d..36a35f4 100644 --- a/doc/ref/Extensible_Sequence.html +++ b/doc/ref/Extensible_Sequence.html @@ -2,7 +2,7 @@ boost::mpl::Extensible Sequence -

[Home]Extensible Sequence

Description

+

[Home]Extensible Sequence

Description

An Extensible Sequence is either a Forward Sequence, a Bidirectional Sequence or a Random Access Sequence that supports insertion and removal operations.

@@ -37,4 +37,4 @@ See the description of clear, Sequences, clear, insert, erase

-Table of Content
Last edited July 16, 2002 6:27 pm \ No newline at end of file +Table of Contents
Last edited July 16, 2002 6:27 pm \ No newline at end of file diff --git a/doc/ref/Forward_Iterator.html b/doc/ref/Forward_Iterator.html index f3c9bd8..81dad61 100644 --- a/doc/ref/Forward_Iterator.html +++ b/doc/ref/Forward_Iterator.html @@ -2,7 +2,7 @@ boost::mpl::Forward Iterator -

[Home]Forward Iterator

Description

+

[Home]Forward Iterator

Description

A Forward Iterator is an Input Iterator that guarantees a linear traversal over the sequence.

@@ -31,4 +31,4 @@ For any forward iterators i and j the following invariants always hold:

Forward Sequence, Input Iterator, Bidirectional Iterator

-Table of Content
Last edited July 15, 2002 10:53 am \ No newline at end of file +Table of Contents
Last edited July 15, 2002 10:53 am \ No newline at end of file diff --git a/doc/ref/Forward_Sequence.html b/doc/ref/Forward_Sequence.html index ce76f57..a1129a4 100644 --- a/doc/ref/Forward_Sequence.html +++ b/doc/ref/Forward_Sequence.html @@ -2,7 +2,7 @@ boost::mpl::Forward Sequence -

[Home]Forward Sequence

Description

+

[Home]Forward Sequence

Description

A Forward Sequence is a Sequence which guarantees that its elements are arranged in a definite order, and that the ordering will not change spontaneously [1]. Iterators into a forward sequence satisfy the Forward Iterator requirements.

@@ -45,4 +45,4 @@ For any forward sequence s the following invariants always hold:

Sequence, Bidirectional Sequence, Forward Iterator

-Table of Content
Last edited July 15, 2002 2:34 pm \ No newline at end of file +Table of Contents
Last edited July 15, 2002 2:34 pm \ No newline at end of file diff --git a/doc/ref/Input_Iterator.html b/doc/ref/Input_Iterator.html index 36a304f..38b7616 100644 --- a/doc/ref/Input_Iterator.html +++ b/doc/ref/Input_Iterator.html @@ -2,7 +2,7 @@ boost::mpl::Input Iterator -

[Home]Input Iterator

Description

+

[Home]Input Iterator

Description

An Input Iterator is a Trivial Iterator that provides a way to obtain the next iterator in a sequence.

@@ -16,7 +16,7 @@ An Input Iterator is a Trivial Iterator th

  • an input iterator is past-the-end if it points beyond the last element of a sequence; past-the-end iterators are non-dereferenceable;
  • an input iterator is valid if it is dereferenceable or past-the-end;
  • an input iterator i is incrementable if there is a "next" iterator, that is, if i::next expression is well-defined; past-the-end iterators are not incrementable; -
  • an input iterator j is reachable from a forward iterator i if, after recursive application of next operation to i a finite number of times, i is identical to j; +
  • an input iterator j is reachable from a forward iterator i if, after recursive application of next operation to i a finite number of times, i is identical to j;
  • the notation [i,j) refers to a range of iterators beginning with i and up to but not including j;
  • the range [i,j) is a valid range if both i and j are valid iterators, and j is reachable from i. @@ -41,4 +41,4 @@ In addition to the expressions defined in Triv

    Sequence, Trivial Iterator, Forward Iterator

    -Table of Content
    Last edited July 15, 2002 10:48 am \ No newline at end of file +Table of Contents
    Last edited July 15, 2002 10:48 am \ No newline at end of file diff --git a/doc/ref/Integral_Constant.html b/doc/ref/Integral_Constant.html index 50ee484..b19b9b6 100644 --- a/doc/ref/Integral_Constant.html +++ b/doc/ref/Integral_Constant.html @@ -2,9 +2,9 @@ boost::mpl::Integral Constant -

    [Home]Integral Constant

    Description

    +

    [Home]Integral Constant

    Description

    -An Integral Constant is a class (or a template class) that represents a value of a built-in integral type (bool, int, long, etc.) in compile-time programs. An integral constant directly supports the increment/decrement operations within the range of the built-in integral type it wraps. Other arithmetic operations are supported through the external metafunctions. +An Integral Constant is a class representing a value of a built-in integral type (bool, int, long, etc.) in compile-time programs. An integral constant directly supports the increment/decrement operations within the range of the built-in integral type it wraps. Other arithmetic operations are supported through the external metafunctions.

    Valid expressions

    @@ -25,19 +25,19 @@ An Integral Constant is a class (or a template class) that represents a value of typename n::typeAmortized constant timeSelf-reference.is_same<n::type,n>::value == true n::valueAmortized constant timeValue of n. typename n::nextAmortized constant timen::value_type supports an increment operation; n::value is incrementableIncrement operationn::next::value == n::value + 1 -typename n::priorAmortized constant timen::value_type supports an decrement operation; n::value is decrementableDecrement operationn::next::value == n::value - 1 +typename n::priorAmortized constant timen::value_type supports an decrement operation; n::value is decrementableDecrement operationn::prior::value == n::value - 1

    Models

    See also

    -next, prior +next, prior

    -Table of Content
    Last edited July 17, 2002 7:05 am \ No newline at end of file +Table of Contents
    Last edited March 10, 2003 4:21 am \ No newline at end of file diff --git a/doc/ref/Iterators.html b/doc/ref/Iterators.html index f15f209..6b6dfd8 100644 --- a/doc/ref/Iterators.html +++ b/doc/ref/Iterators.html @@ -2,24 +2,30 @@ boost::mpl::Iterators -

    [Home]Iterators

    Iterators are the mechanism that makes it possible to decouple algorithms from concrete compile-time sequence implementations. +

    [Home]Iterators

    Iterators are a generic means of addressing a particular element or +range of sequential elements in a sequence. They are also the mechanism +that makes it possible to decouple algorithms from concrete compile-time +sequence implementations. Under the hood, all MPL sequence algorithms +are implemented in terms of iterators, which, in particular, means that +they will work on any custom compile-time sequence, given that the appropriate +iterator inteface is provided.

    -

      -
    1. Concepts -
        +

        Concepts

        +
      -
    2. Algorithms -
        + +

        +

        Metafunctions

        +
      -
    +

    -Table of Content
    Last edited July 17, 2002 6:16 am \ No newline at end of file +Table of Contents
    Last edited March 10, 2003 1:42 am \ No newline at end of file diff --git a/doc/ref/Metafunction.html b/doc/ref/Metafunction.html index b4d1a8e..f533944 100644 --- a/doc/ref/Metafunction.html +++ b/doc/ref/Metafunction.html @@ -2,59 +2,76 @@ boost::mpl::Metafunction -

    [Home]Metafunction

    Description

    -

    -A Metafunction is a class template that represents a function invocable at compile-time. A metafunction is invoked by instantiating the class template with particular template parameters (metafunction arguments); the result of metafunction application is accessible through the instantiation's nested type typedef. A metafunction can have a variable number of parameters. -

    -

    Example

    -

    -

    -// binary metafunction
-template< typename T1, typename T2 >
-struct is_same
-{
-    typedef false_c type;
-};
-
    
-template< typename T >
-struct is_same
-{
-    typedef true_c type;
-};
-
    
-// metafunction invocation
-typedef is_same<int,char>::type res;
-BOOST_STATIC_ASSERT(!res::value);
-
    +

    [Home]Metafunction

    Description

    +A metafunction is a class or a class template that represents a function invocable at compile-time. A non-nullary metafunction is invoked by instantiating the class template with particular template parameters +(metafunction arguments); the result of the metafunction application is accessible through the instantiation's nested type typedef. All metafunction's arguments must be types (i.e. only type template parameters are allowed). A metafunction can have a variable number of parameters. A nullary metafunction is represented as a class with a nested +type typename member.

    Valid expressions

    - +
     Expression  Expression type  
    typename f::typeA type
    typename f<t1,..,tn>::typeA type
    typename f<a1,..,an>::typeA type

    Expression semantics

    - - + +
     Expression  Complexity  Precondition  Semantics  Postcondition 
    typename f::typeMetafunction dependentf is a nullary metafunction; f::type is a type-namef::type is the result of the metafunction invocation
    typename f<t1,..,tn>::typeMetafunction dependentf is an n-ary metafunction; t1,..,tn are types; f<t1,..,tn>::type is a type-namef<t1,..,tn>::type is the result of the metafunction invocation with the input arguments t1,..,tn
    typename f::typeunspecifiedf is a nullary metafunction; f::type is a type-namef::type is the result of the metafunction invocation
    typename f<a1,..,an>::typeunspecifiedf is an n-ary metafunction; a1,..,an are types; f<a1,..,an>::type is a type-namef<a1,..,an>::type is the result of the metafunction invocation with the actual arguments a1,..,an

    +

    +

    Example

    +

    +

    +// nullary metafunction
+struct always_true { typedef true_ type; };
+
    
+// unary metafunction
+template< typename T > struct sizeof_
+{
+    typedef int_< sizeof(T) > type;
+};
+
    
+// binary metafunction
+template< typename T1, typename T2 >
+struct is_same
+{
+    typedef false_ type;
+};
+
    
+template< typename T >
+struct is_same<T,T>
+{
+    typedef true_ type;
+};
+
    
+// invocations
+typedef always_true::type t1;
+typedef sizeof_<int>::type t2;
+typedef is_same<int,char>::type t3;
+
    
+// results checks
+BOOST_STATIC_ASSERT(t1::value);
+BOOST_STATIC_ASSERT(t2::value == sizeof(int));
+BOOST_STATIC_ASSERT(!t3::value);
+
    +

    Models

    See also

    -Metafunctions, [Metafunction Class] +Metafunctions, Metafunction Class

    -Table of Content
    Last edited July 16, 2002 11:27 pm \ No newline at end of file +Table of Contents
    Last edited March 10, 2003 3:27 am \ No newline at end of file diff --git a/doc/ref/Metafunctions.html b/doc/ref/Metafunctions.html index 283419e..7a77257 100644 --- a/doc/ref/Metafunctions.html +++ b/doc/ref/Metafunctions.html @@ -2,38 +2,60 @@ boost::mpl::Metafunctions -

    [Home]Metafunctions

      -
    1. Concepts -
        +

        [Home]Metafunctions

        Concepts

        +
      -
    2. Metafunction -
        -
      1. Arithmetic operations -
          +
        1. Metafunction Class + +

          +

          Invocation

          +
            +
          • apply +
          +

          +

          Arithmetic operations

          +
        -
      2. Comparisons -
          + +

          +

          Comparisons

          +
        -
      3. Logical operations -
          -
        1. logical_or -
        2. logical_and -
        3. logical_not -
        -
      -
    + +

    +

    Logical operations

    + +

    +

    Bitwise operations

    + +

    +

    Identity operations

    +

    -Table of Content
    Last edited July 17, 2002 8:46 am \ No newline at end of file +Table of Contents
    Last edited March 10, 2003 6:39 am \ No newline at end of file diff --git a/doc/ref/Random_Access_Iterator.html b/doc/ref/Random_Access_Iterator.html index 3f294c4..2123d30 100644 --- a/doc/ref/Random_Access_Iterator.html +++ b/doc/ref/Random_Access_Iterator.html @@ -2,7 +2,7 @@ boost::mpl::Random Access Iterator -

    [Home]Random Access Iterator

    Description

    +

    [Home]Random Access Iterator

    Description

    A Random Access Iterator is a Bidirectional Iterator that provides constant-time methods for moving forward and backward on a sequence in arbitrary-sized steps.

    @@ -45,4 +45,4 @@ For any random access iterators i and j the following

    Random Access Sequence, Bidirectional Iterator

    -Table of Content
    Last edited July 15, 2002 11:35 am \ No newline at end of file +Table of Contents
    Last edited July 15, 2002 11:35 am \ No newline at end of file diff --git a/doc/ref/Random_Access_Sequence.html b/doc/ref/Random_Access_Sequence.html index 16c2bab..d7d792e 100644 --- a/doc/ref/Random_Access_Sequence.html +++ b/doc/ref/Random_Access_Sequence.html @@ -2,7 +2,7 @@ boost::mpl::Random Access Sequence -

    [Home]Random Access Sequence

    Description

    +

    [Home]Random Access Sequence

    Description

    A Random Access Sequence is a Bidirectional Sequence which provides iterators that satisfy the Random Access Iterator requirements. A random access sequence provides amortized constant time access to arbitrary elements.

    @@ -32,4 +32,4 @@ Random Access Sequence does not define any new expressions beyond those defined

    Bidirectional Sequence, Random Access Iterator

    -Table of Content
    Last edited July 15, 2002 2:37 pm \ No newline at end of file +Table of Contents
    Last edited July 15, 2002 2:37 pm \ No newline at end of file diff --git a/doc/ref/Reference/advance.html b/doc/ref/Reference/advance.html index 2b25e10..3d94c75 100644 --- a/doc/ref/Reference/advance.html +++ b/doc/ref/Reference/advance.html @@ -1,8 +1,8 @@ -boost::mpl::Reference/advance +boost::mpl::advance -

    [Home]advance

    Synopsis

    +

    [Home]advance

    Synopsis

     template<
@@ -22,7 +22,7 @@ Returns an new iterator i such as distance< Iterator,i >
 
    Definition
    
 
    
 
    -#include "boost/mpl/advance.hpp"
+#include "boost/mpl/advance.hpp"
 
    
 
    
 
    Parameters
    
@@ -59,4 +59,4 @@ BOOST_MPL_ASSERT_IS_SAME(iter2, first);
 
    
 Iterators, Sequence, distance, begin, end
 
    
-Table of Content | Reference
    Last edited July 17, 2002 6:38 am
\ No newline at end of file
+Table of Contents
    Last edited July 17, 2002 6:38 am
\ No newline at end of file
diff --git a/doc/ref/Reference/at.html b/doc/ref/Reference/at.html
index 5567599..9a39f40 100644
--- a/doc/ref/Reference/at.html
+++ b/doc/ref/Reference/at.html
@@ -1,13 +1,13 @@
 
-boost::mpl::Reference/at
+boost::mpl::at
 
 
-
    [Home]at
    Synopsis
    
+
    [Home]at
    Synopsis
    
 
    
 
     template<
-      typename N
-    , typename Sequence
+      typename Sequence
+    , typename N
     >
 struct at
 {
@@ -22,21 +22,21 @@ Returns a type identical to the N-th element from the beginning of
 
    Definition
    
 
    
 
    -#include "boost/mpl/at.hpp"
+#include "boost/mpl/at.hpp"
 
    
 
    
 
    Parameters
    
 
-
+
    
 
     Parameter  Requirement  Description  
    NA model of Integral ConstantThe offset from the beginning of the sequence that specifies the element to be retrieved. 
    
 
    SequenceA model of Forward SequenceA sequence to be examined. 
    NA model of Integral ConstantThe offset from the beginning of the sequence that specifies the element to be retrieved. 
    
 
    
 
    
 
    Expression semantics
    
 
    
 
-
+
    
 
     Expression  Expression type  Precondition  Semantics  Postcondition 
    typedef at<N,Sequence>::type t;A type0 <= N::value < size<Sequence>::type::valueEquivalent to typedef advance< begin<Sequence>::type,N >::type::type t;
    typedef at<Sequence,N>::type t;A type0 <= N::value < size<Sequence>::type::valueEquivalent to typedef advance< begin<Sequence>::type,N >::type::type t;
    
 
    
 
    
 
    Complexity
    
@@ -47,13 +47,13 @@ Depends on the implementation of the particular sequence it is applied to. Linea
 
    
 
     typedef range_c<long,10,50> range;
-BOOST_STATIC_ASSERT(at< int_c<0>, range >::type::value == 10);
-BOOST_STATIC_ASSERT(at< int_c<10>, range >::type::value == 20);
-BOOST_STATIC_ASSERT(at< int_c<40>, range >::type::value == 50);
+BOOST_STATIC_ASSERT(at< range, int_<0> >::type::value == 10);
+BOOST_STATIC_ASSERT(at< range, int_<10> >::type::value == 20);
+BOOST_STATIC_ASSERT(at< range, int_<40> >::type::value == 50);
 
    
 
    
 
    See also
    
 
    
 Forward Sequence, at_c, front, back
 
    
-Table of Content | Reference
    Last edited July 17, 2002 3:49 am
\ No newline at end of file
+Table of Contents
    Last edited March 12, 2003 6:26 am
\ No newline at end of file
diff --git a/doc/ref/Reference/at_c.html b/doc/ref/Reference/at_c.html
index 7a3b2a2..2bae6a5 100644
--- a/doc/ref/Reference/at_c.html
+++ b/doc/ref/Reference/at_c.html
@@ -1,13 +1,13 @@
 
-boost::mpl::Reference/at c
+boost::mpl::at_c
 
 
-
    [Home]at_c
    Synopsis
    
+
    [Home]at_c
    Synopsis
    
 
    
 
     template<
-      long n
-    , typename Sequence
+      typename Sequence
+    , long n
     >
 struct at_c
 {
@@ -17,26 +17,26 @@ struct at_c
 
    
 
    Description
    
 
    
-Returns a type identical to the n-th element from the beginning of the sequence. at_c<n,Sequence>::type is a shorcut notation for at< integral_c<long,n>, Sequence>::type.
+Returns a type identical to the n-th element from the beginning of the sequence. at_c<Sequence,n>::type is a shorcut notation for at< Sequence, integral_c<long,n> >::type.
 
    
 
    Definition
    
 
    
 
    -#include "boost/mpl/at.hpp"
+#include "boost/mpl/at.hpp"
 
    
 
    
 
    Parameters
    
 
-
+
    
 
     Parameter  Requirement  Description  
    nAn compile-time integral constantAn offset from the beginning of the sequence that specifies the element to be retrieved. 
    
 
    SequenceA model of Forward SequenceA sequence being examined. 
    nAn compile-time integral constantAn offset from the beginning of the sequence that specifies the element to be retrieved. 
    
 
    
 
    
 
    Expression semantics
    
 
    
 
-
+
    
 
     Expression  Expression type  Precondition  Semantics  Postcondition 
    typedef at_c<n,Sequence>::type t;A type0 <= n < size<Sequence>::type::valueEquivalent to typedef at< integral_c<long,n>, Sequence>::type t;
    typedef at_c<Sequence,n>::type t;A type0 <= n < size<Sequence>::type::valueEquivalent to typedef at< Sequence, integral_c<long,n> >::type t;
    
 
    
 
    
 
    Complexity
    
@@ -47,13 +47,13 @@ Depends on the implementation of the particular sequence it is applied to. Linea
 
    
 
     typedef range_c<long,10,50> range;
-BOOST_STATIC_ASSERT(at_c<0,range>::type::value == 10);
-BOOST_STATIC_ASSERT(at_c<10,range>::type::value == 20);
-BOOST_STATIC_ASSERT(at_c<40,range>::type::value == 50);
+BOOST_STATIC_ASSERT(at_c<range,0>::type::value == 10);
+BOOST_STATIC_ASSERT(at_c<range,10>::type::value == 20);
+BOOST_STATIC_ASSERT(at_c<range,40>::type::value == 50);
 
    
 
    
 
    See also
    
 
    
 Forward Sequence, at, front, back
 
    
-Table of Content | Reference
    Last edited July 17, 2002 3:50 am
\ No newline at end of file
+Table of Contents
    Last edited October 21, 2002 4:09 am
\ No newline at end of file
diff --git a/doc/ref/Reference/back.html b/doc/ref/Reference/back.html
index 0ce7a8c..af0bed5 100644
--- a/doc/ref/Reference/back.html
+++ b/doc/ref/Reference/back.html
@@ -1,8 +1,8 @@
 
-boost::mpl::Reference/back
+boost::mpl::back
 
 
-
    [Home]back
    Synopsis
    
+
    [Home]back
    Synopsis
    
 
    
 
     template<
@@ -21,7 +21,7 @@ Returns a type identical to the last element in the sequence, that is, the eleme
 
    Definition
    
 
    
 
    -#include "boost/mpl/back.hpp"
+#include "boost/mpl/back.hpp"
 
    
 
    
 
    Parameters
    
@@ -61,4 +61,4 @@ BOOST_STATIC_ASSERT(back<range3>::type::value == -1);
 
    
 Forward Sequence, front, at, end, push_back
 
    
-Table of Content | Reference
    Last edited July 17, 2002 3:47 am
\ No newline at end of file
+Table of Contents
    Last edited July 17, 2002 3:47 am
\ No newline at end of file
diff --git a/doc/ref/Reference/begin.html b/doc/ref/Reference/begin.html
index a301168..e50354e 100644
--- a/doc/ref/Reference/begin.html
+++ b/doc/ref/Reference/begin.html
@@ -1,8 +1,8 @@
 
-boost::mpl::Reference/begin
+boost::mpl::begin
 
 
-
    [Home]begin
    Synopsis
    
+
    [Home]begin
    Synopsis
    
 
    
 
     template<
@@ -21,7 +21,7 @@ Returns an iterator that points to the first element of the sequence.
 
    Definition
    
 
    
 
    -#include "boost/mpl/begin_end.hpp"
+#include "boost/mpl/begin_end.hpp"
 
    
 
    
 
    Parameters
    
@@ -53,4 +53,4 @@ BOOST_STATIC_ASSERT((boost::is_same<iter::type,unsigned char>::value));
 
    
 Iterators, Sequence, end, size, empty
 
    
-Table of Content | Reference
    Last edited July 22, 2002 2:03 am
\ No newline at end of file
+Table of Contents
    Last edited July 22, 2002 2:03 am
\ No newline at end of file
diff --git a/doc/ref/Reference/clear.html b/doc/ref/Reference/clear.html
index 29e03b0..800c9f2 100644
--- a/doc/ref/Reference/clear.html
+++ b/doc/ref/Reference/clear.html
@@ -1,8 +1,8 @@
 
-boost::mpl::Reference/clear
+boost::mpl::clear
 
 
-
    [Home]clear
    Synopsis
    
+
    [Home]clear
    Synopsis
    
 
    
 
     template<
@@ -21,7 +21,7 @@ Returns an empty sequence that preserves all the functional and performance char
 
    Definition
    
 
    
 
    -#include "boost/mpl/clear.hpp"
+#include "boost/mpl/clear.hpp"
 
    
 
    
 
    Parameters
    
@@ -57,4 +57,4 @@ BOOST_STATIC_ASSERT(empty<nothing>::type::value);
 
    
 Extensible Sequence, erase, empty, begin, end
 
    
-Table of Content | Reference
    Last edited July 17, 2002 3:58 am
\ No newline at end of file
+Table of Contents
    Last edited July 17, 2002 3:58 am
\ No newline at end of file
diff --git a/doc/ref/Reference/contains.html b/doc/ref/Reference/contains.html
index f2a667e..0d7bd9a 100644
--- a/doc/ref/Reference/contains.html
+++ b/doc/ref/Reference/contains.html
@@ -1,8 +1,8 @@
 
-boost::mpl::Reference/contains
+boost::mpl::contains
 
 
-
    [Home]contains
    Synopsis
    
+
    [Home]contains
    Synopsis
    
 
    
 
     template<
@@ -17,12 +17,12 @@ struct contains
 
    
 
    Description
    
 
    
-Returns true_c if one or more elements in Sequence are identical to T, and false_c otherwise. 
+Returns true_ if one or more elements in Sequence are identical to T, and false_ otherwise. 
 
    
 
    Definition
    
 
    
 
    -#include "boost/mpl/contains.hpp"
+#include "boost/mpl/contains.hpp"
 
    
 
    
 
    Parameters
    
@@ -36,7 +36,7 @@ Returns true_c if one or more elements in Sequence are
 
    
 
-
+
    
 
     Expression  Expression type  Precondition  Semantics  Postcondition 
    typedef contains<Sequence,T>::type c;A model of bool Integral ConstantEquivalent to typedef logical_not< is_same< find<Sequence,T>::type, end<Sequence>::type > >::type c; 
    typedef contains<Sequence,T>::type c;A model of bool Integral ConstantEquivalent to typedef not_< is_same< find<Sequence,T>::type, end<Sequence>::type > >::type c; 
    
 
    
 
    
 
    Complexity
    
@@ -55,4 +55,4 @@ BOOST_STATIC_ASSERT(!result::value);
 
    
 Algorithms, find, find_if, count, count_if
 
    
-Table of Content | Reference
    Last edited July 17, 2002 4:48 am
\ No newline at end of file
+Table of Contents
    Last edited March 10, 2003 5:33 am
\ No newline at end of file
diff --git a/doc/ref/Reference/copy.html b/doc/ref/Reference/copy.html
index 1dec84a..267490f 100644
--- a/doc/ref/Reference/copy.html
+++ b/doc/ref/Reference/copy.html
@@ -1,8 +1,8 @@
 
-boost::mpl::Reference/copy
+boost::mpl::copy
 
 
-
    [Home]copy
    Synopsis
    
+
    [Home]copy
    Synopsis
    
 
    
 
     template<
@@ -23,7 +23,7 @@ struct copy
 
    Definition
    
 
    
 
    -#include "boost/mpl/copy.hpp"
+#include "boost/mpl/copy.hpp"
 
    
 
    
 
    Parameters
    
@@ -67,4 +67,4 @@ BOOST_STATIC_ASSERT((equal< result,
 Algorithms, copy_if, copy_backward, copy_backward_if, fold, fold_backward
 
    
-Table of Content | Reference
    Last edited July 19, 2002 2:10 am
\ No newline at end of file
+Table of Contents
    Last edited July 19, 2002 2:10 am
\ No newline at end of file
diff --git a/doc/ref/Reference/copy_backward.html b/doc/ref/Reference/copy_backward.html
index 183d86c..c2ae085 100644
--- a/doc/ref/Reference/copy_backward.html
+++ b/doc/ref/Reference/copy_backward.html
@@ -1,8 +1,8 @@
 
-boost::mpl::Reference/copy backward
+boost::mpl::copy_backward
 
 
-
    [Home]copy_backward
    Synopsis
    
+
    [Home]copy_backward
    Synopsis
    
 
    
 
     template<
@@ -23,7 +23,7 @@ struct copy_backward
 
    Definition
    
 
    
 
    -#include "boost/mpl/copy_backward.hpp"
+#include "boost/mpl/copy_backward.hpp"
 
    
 
    
 
    Parameters
    
@@ -67,4 +67,4 @@ BOOST_STATIC_ASSERT((equal< result,
 Algorithms, copy_backward_if, copy, copy_if, fold, fold_backward
 
    
-Table of Content | Reference
    Last edited July 19, 2002 2:11 am
\ No newline at end of file
+Table of Contents
    Last edited July 19, 2002 2:11 am
\ No newline at end of file
diff --git a/doc/ref/Reference/copy_backward_if.html b/doc/ref/Reference/copy_backward_if.html
index a6608fd..60b1883 100644
--- a/doc/ref/Reference/copy_backward_if.html
+++ b/doc/ref/Reference/copy_backward_if.html
@@ -1,8 +1,8 @@
 
-boost::mpl::Reference/copy backward if
+boost::mpl::copy_backward_if
 
 
-
    [Home]copy_backward_if
    Synopsis
    
+
    [Home]copy_backward_if
    Synopsis
    
 
    
 
     template<
@@ -24,7 +24,7 @@ Returns the result of the successive application of BinaryOp to the
 
    Definition
    
 
    
 
    -#include "boost/mpl/copy_backward_if.hpp"
+#include "boost/mpl/copy_backward_if.hpp"
 
    
 
    
 
    Parameters
    
@@ -55,8 +55,8 @@ typedef list_c<int,0,1,2,3,4>::type
 typedef copy_backward_if<
       numbers
     , list_c<int>
-    , push_front<_,_>
-    , less<_,int_c<5> >
+    , push_front<_1,_2>
+    , less<_1,int_<5> >
     >::type result;
 
    
 BOOST_STATIC_ASSERT(size<result>::value == 5);
@@ -67,4 +67,4 @@ BOOST_STATIC_ASSERT((equal<result,answe
 
    
 Algorithms, copy_backward, copy_if, copy, fold, fold_backward
 
    
-Table of Content | Reference
    Last edited July 19, 2002 2:09 am
\ No newline at end of file
+Table of Contents
    Last edited March 12, 2003 6:29 am
\ No newline at end of file
diff --git a/doc/ref/Reference/copy_if.html b/doc/ref/Reference/copy_if.html
index 4b22920..b80347e 100644
--- a/doc/ref/Reference/copy_if.html
+++ b/doc/ref/Reference/copy_if.html
@@ -1,8 +1,8 @@
 
-boost::mpl::Reference/copy if
+boost::mpl::copy_if
 
 
-
    [Home]copy_if
    Synopsis
    
+
    [Home]copy_if
    Synopsis
    
 
    
 
     template<
@@ -24,7 +24,7 @@ Returns the result of the successive application of BinaryOp to the
 
    Definition
    
 
    
 
    -#include "boost/mpl/copy_if.hpp"
+#include "boost/mpl/copy_if.hpp"
 
    
 
    
 
    Parameters
    
@@ -55,8 +55,8 @@ typedef list_c<int,0,1,2,3,4>::type
 typedef copy_if<
       numbers
     , vector_c<int>
-    , push_back<_,_>
-    , less<_,int_c<5> >
+    , push_back<_1,_2>
+    , less<_1,int_<5> >
     >::type result;
 
    
 BOOST_STATIC_ASSERT(size<result>::value == 5);
@@ -67,4 +67,4 @@ BOOST_STATIC_ASSERT((equal<result,answe
 
    
 Algorithms, copy, copy_backward_if, copy_backward, fold, iter_fold
 
    
-Table of Content | Reference
    Last edited July 19, 2002 2:10 am
\ No newline at end of file
+Table of Contents
    Last edited March 12, 2003 6:30 am
\ No newline at end of file
diff --git a/doc/ref/Reference/count.html b/doc/ref/Reference/count.html
index 8f3cf6d..847e8c2 100644
--- a/doc/ref/Reference/count.html
+++ b/doc/ref/Reference/count.html
@@ -1,8 +1,8 @@
 
-boost::mpl::Reference/count
+boost::mpl::count
 
 
-
    [Home]count
    Synopsis
    
+
    [Home]count
    Synopsis
    
 
    
 
     template<
@@ -22,7 +22,7 @@ Returns the number of elements in a Sequence that are identical to
 
    Definition
    
 
    
 
    -#include "boost/mpl/count_if.hpp"
+#include "boost/mpl/count.hpp"
 
    
 
    
 
    Parameters
    
@@ -57,4 +57,4 @@ BOOST_STATIC_ASSERT((distance< begin
 
    
 Algorithms, count_if, find, find_if, contains
 
    
-Table of Content | Reference
    Last edited July 17, 2002 4:32 am
\ No newline at end of file
+Table of Contents
    Last edited December 12, 2002 2:05 am
\ No newline at end of file
diff --git a/doc/ref/Reference/count_if.html b/doc/ref/Reference/count_if.html
index a5d4bf2..2d5e0d1 100644
--- a/doc/ref/Reference/count_if.html
+++ b/doc/ref/Reference/count_if.html
@@ -1,8 +1,8 @@
 
-boost::mpl::Reference/count if
+boost::mpl::count_if
 
 
-
    [Home]count_if
    Synopsis
    
+
    [Home]count_if
    Synopsis
    
 
    
 
     template<
@@ -22,7 +22,7 @@ Returns the number of elements in a Sequence that satisfy the predi
 
    Definition
    
 
    
 
    -#include "boost/mpl/count_if.hpp"
+#include "boost/mpl/count_if.hpp"
 
    
 
    
 
    Parameters
    
@@ -36,7 +36,7 @@ Returns the number of elements in a Sequence that satisfy the predi
 
    
 
-
+
    
 
     Expression  Expression type  Precondition  Semantics  Postcondition 
    typedef count_if<Sequence,Pred>::type n;A model of Integral ConstantEquivalent to  typedef lambda<Pred>::type pred; typedef fold< Sequence,integral_c<unsigned long,0>,if_<pred,next<_1>,_1> >::type n;
    typedef count_if<Sequence,Pred>::type n;A model of Integral ConstantEquivalent to  typedef lambda<Pred>::type pred; typedef fold< Sequence,integral_c<unsigned long,0>,if_<pred,next<_1>,_1> >::type n;
    
 
    
 
    
 
    
@@ -58,4 +58,4 @@ BOOST_STATIC_ASSERT((count_if< types,boost::is_same<_,void> >::type:
 
    
 Algorithms, count, find_if, find, contains
 
    
-Table of Content | Reference
    Last edited July 17, 2002 4:32 am
\ No newline at end of file
+Table of Contents
    Last edited July 17, 2002 4:32 am
\ No newline at end of file
diff --git a/doc/ref/Reference/distance.html b/doc/ref/Reference/distance.html
index 18ca747..b698c70 100644
--- a/doc/ref/Reference/distance.html
+++ b/doc/ref/Reference/distance.html
@@ -1,8 +1,8 @@
 
-boost::mpl::Reference/distance
+boost::mpl::distance
 
 
-
    [Home]distance
    Synopsis
    
+
    [Home]distance
    Synopsis
    
 
    
 
     template<
@@ -22,7 +22,7 @@ Finds the distance between First and Last, that is, an
 
    Definition
    
 
    
 
    -#include "boost/mpl/distance.hpp"
+#include "boost/mpl/distance.hpp"
 
    
 
    
 
    Parameters
    
@@ -53,4 +53,4 @@ BOOST_STATIC_ASSERT((distance< begin<range>::type,end<range>::typ
 
    
 Iterators, Sequence, advance, begin, end
 
    
-Table of Content | Reference
    Last edited July 17, 2002 6:47 am
\ No newline at end of file
+Table of Contents
    Last edited July 17, 2002 6:47 am
\ No newline at end of file
diff --git a/doc/ref/Reference/divides.html b/doc/ref/Reference/divides.html
index 9d4de2d..c7c4a21 100644
--- a/doc/ref/Reference/divides.html
+++ b/doc/ref/Reference/divides.html
@@ -1,16 +1,16 @@
 
-boost::mpl::Reference/divides
+boost::mpl::divides
 
 
-
    [Home]divides
    Synopsis
    
+
    [Home]divides
    Synopsis
    
 
    
 
     template<
       typename T1
-    , typaname T2
-    , typaname T3 = integral_c<int,1>
+    , typename T2
+    , typename T3 = integral_c<int,1>
     , ...
-    , typaname Tn = integral_c<int,1>
+    , typename Tn = integral_c<int,1>
     >
 struct divides
 {
@@ -25,7 +25,7 @@ Returns the quotient of its arguments [1].
 
    Definition
    
 
    
 
    -#include "boost/mpl/arithmetic/divides.hpp"
+#include "boost/mpl/divides.hpp"
 
    
 
    
 
    Parameters
    
@@ -61,4 +61,4 @@ BOOST_MPL_ASSERT_IS_SAME(quot::value_type, long);
 
    
 Metafunctions, multiplies, modulus, plus, minus, negate
 
    
-Table of Content | Reference
    Last edited July 17, 2002 4:08 am
\ No newline at end of file
+Table of Contents
    Last edited March 10, 2003 6:32 am
\ No newline at end of file
diff --git a/doc/ref/Reference/empty.html b/doc/ref/Reference/empty.html
index 90e7347..14ee143 100644
--- a/doc/ref/Reference/empty.html
+++ b/doc/ref/Reference/empty.html
@@ -1,8 +1,8 @@
 
-boost::mpl::Reference/empty
+boost::mpl::empty
 
 
-
    [Home]empty
    Synopsis
    
+
    [Home]empty
    Synopsis
    
 
    
 
     template<
@@ -21,7 +21,7 @@ Returns an Integral Constant cDefinition
 
    
 
    -#include "boost/mpl/empty.hpp"
+#include "boost/mpl/empty.hpp"
 
    
 
    
 
    Parameters
    
@@ -56,4 +56,4 @@ BOOST_STATIC_ASSERT(!empty<types>::value)
 
    
 Sequence, size, begin, end
 
    
-Table of Content | Reference
    Last edited July 17, 2002 3:52 am
\ No newline at end of file
+Table of Contents
    Last edited July 17, 2002 3:52 am
\ No newline at end of file
diff --git a/doc/ref/Reference/end.html b/doc/ref/Reference/end.html
index 55e9c0d..bac4d50 100644
--- a/doc/ref/Reference/end.html
+++ b/doc/ref/Reference/end.html
@@ -1,8 +1,8 @@
 
-boost::mpl::Reference/end
+boost::mpl::end
 
 
-
    [Home]end
    Synopsis
    
+
    [Home]end
    Synopsis
    
 
    
 
     template<
@@ -21,7 +21,7 @@ Returns the past-the-end iterator to the sequence.
 
    Definition
    
 
    
 
    -#include "boost/mpl/begin_end.hpp"
+#include "boost/mpl/begin_end.hpp"
 
    
 
    
 
    Parameters
    
@@ -54,4 +54,4 @@ BOOST_STATIC_ASSERT((boost::is_same<first::next,last>::value));
 
    
 Iterators, Sequence, begin, size, empty
 
    
-Table of Content | Reference
    Last edited July 22, 2002 4:30 pm
\ No newline at end of file
+Table of Contents
    Last edited July 22, 2002 4:30 pm
\ No newline at end of file
diff --git a/doc/ref/Reference/equal.html b/doc/ref/Reference/equal.html
index 9ea2cb8..8976cbd 100644
--- a/doc/ref/Reference/equal.html
+++ b/doc/ref/Reference/equal.html
@@ -1,14 +1,14 @@
 
-boost::mpl::Reference/equal
+boost::mpl::equal
 
 
-
    [Home]equal
    Synopsis
    
+
    [Home]equal
    Synopsis
    
 
    
 
     template<
       typename Sequence1
     , typename Sequence2
-    , typename Pred = is_same<_,_>
+    , typename Pred = is_same<_1,_2>
     >
 struct equal
 {
@@ -18,12 +18,12 @@ struct equal
 
    
 
    Description
    
 
    
-Returns true_c if the two sequences Sequence1 and Sequence2 are identical when compared element-by-element, and otherwise returns false_c.
+Returns true_ if the two sequences Sequence1 and Sequence2 are identical when compared element-by-element, and otherwise returns false_.
 
    
 
    Definition
    
 
    
 
    -#include "boost/mpl/equal.hpp"
+#include "boost/mpl/equal.hpp"
 
    
 
    
 
    Parameters
    
@@ -56,4 +56,4 @@ BOOST_STATIC_ASSERT((equal<s1,s2>::type::value));
 
    
 Algorithms, count, count_if
 
    
-Table of Content | Reference
    Last edited July 17, 2002 4:54 am
\ No newline at end of file
+Table of Contents
    Last edited March 10, 2003 5:39 am
\ No newline at end of file
diff --git a/doc/ref/Reference/equal_to.html b/doc/ref/Reference/equal_to.html
index 536f65d..4093487 100644
--- a/doc/ref/Reference/equal_to.html
+++ b/doc/ref/Reference/equal_to.html
@@ -1,13 +1,13 @@
 
-boost::mpl::Reference/equal to
+boost::mpl::equal_to
 
 
-
    [Home]equal_to
    Synopsis
    
+
    [Home]equal_to
    Synopsis
    
 
    
 
     template<
       typename T1
-    , typaname T2
+    , typename T2
     >
 struct equal_to
 {
@@ -17,12 +17,12 @@ struct equal_to
 
    
 
    Description
    
 
    
-Returns true_c if T1::value == T2::value and false_c otherwise [1].
+Returns true_ if T1::value == T2::value and false_ otherwise [1].
 
    
 
    Definition
    
 
    
 
    -#include "boost/mpl/comparison/equal_to.hpp"
+#include "boost/mpl/equal_to.hpp"
 
    
 
    
 
    Parameters
    
@@ -35,7 +35,7 @@ Returns true_c if T1::value == T2::value and fal
 
    
 
-
+
    
 
     Expression  Expression type  Precondition  Semantics  Postcondition 
    typedef equal_to<t1,t2>::type c;A model of bool Integral ConstantEquivalent to typedef bool_c<(t1::value == t2::value)> c;
    typedef equal_to<t1,t2>::type c;A model of bool Integral ConstantEquivalent to typedef bool_<(t1::value == t2::value)> c;
    
 
    
 
    
 
    Complexity
    
@@ -46,8 +46,8 @@ Amortized constant time.
 
    
 
     typedef list_c<int,1,2,3,5,7,12,19,31> fibonacci;
-typedef find_if< fibonacci, equal_to<_,int_c<12> > >::type iter;
-BOOST_STATIC_ASSERT(equal_to< distance< begin<fibonacci>::type, iter >::type, int_c<5> >::type::value));
+typedef find_if< fibonacci, equal_to<_1,int_<12> > >::type iter;
+BOOST_STATIC_ASSERT(equal_to< distance< begin<fibonacci>::type, iter >::type, int_<5> >::type::value));
 
    
 
    
 
    Notes
    
@@ -58,4 +58,4 @@ BOOST_STATIC_ASSERT(equal_to< distance
 Metafunctions, not_equal_to, less, less_equal, greater, greater_equal
 
    
-Table of Content | Reference
    Last edited July 17, 2002 4:13 am
\ No newline at end of file
+Table of Contents
    Last edited March 10, 2003 6:26 am
\ No newline at end of file
diff --git a/doc/ref/Reference/erase.html b/doc/ref/Reference/erase.html
index dd72794..c7ca5dd 100644
--- a/doc/ref/Reference/erase.html
+++ b/doc/ref/Reference/erase.html
@@ -1,8 +1,8 @@
 
-boost::mpl::Reference/erase
+boost::mpl::erase
 
 
-
    [Home]erase
    Synopsis
    
+
    [Home]erase
    Synopsis
    
 
    
 
     template<
@@ -23,7 +23,7 @@ struct erase
 
    Definition
    
 
    
 
    -#include "boost/mpl/erase.hpp"
+#include "boost/mpl/erase.hpp"
 
    
 
    
 
    Parameters
    
@@ -62,4 +62,4 @@ BOOST_MPL_ASSERT_IS_SAME(result_iter, end<
 
    
 Extensible Sequence, pop_front, pop_back, insert
 
    
-Table of Content | Reference
    Last edited July 17, 2002 3:59 am
\ No newline at end of file
+Table of Contents
    Last edited July 17, 2002 3:59 am
\ No newline at end of file
diff --git a/doc/ref/Reference/erase_all.html b/doc/ref/Reference/erase_all.html
deleted file mode 100644
index ceb8f67..0000000
--- a/doc/ref/Reference/erase_all.html
+++ /dev/null
@@ -1,62 +0,0 @@
-
-boost::mpl::Reference/erase all
-
-
-
    [Home]erase_all
    Synopsis
-
    
-
    
-
    -template<
-      typename Sequence
-    , typename T
-    >
-struct erase_all
-{
-    typedef implementation-defined type;
-};
-
    
-
    
-
    Description
-
    
-
    
-[to do]
-
    
-
    Definition
-
    
-
    
-
    -#include "boost/mpl/erase_all.hpp"
-
    
-
    
-
    Parameters
-
    
-
-
-
-
     Parameter  Requirement  Description  Default argument  
    ParamA model of Concept[to do][to do] 
    
-
    
-
    Members
-
    
-
-
-
-
     Member  Description  
    type[to do] 
    
-
    
-
    Complexity
-
    
-
    
-[to do]
-
    
-
    Example
-
    
-
    
-
    -[to do]
-
    
-
    
-
    See also
-
    
-
    
-Algorithms, erase, erase_if, erase_range
-
    
-Table of Content | Reference
    Last edited February 19, 2002 3:53 am
\ No newline at end of file
diff --git a/doc/ref/Reference/erase_if.html b/doc/ref/Reference/erase_if.html
deleted file mode 100644
index 533901e..0000000
--- a/doc/ref/Reference/erase_if.html
+++ /dev/null
@@ -1,62 +0,0 @@
-
-boost::mpl::Reference/erase if
-
-
-
    [Home]erase_if
    Synopsis
-
    
-
    
-
    -template<
-      typename Sequence
-    , typename Predicate
-    >
-struct erase_if
-{
-    typedef implementation-defined type;
-};
-
    
-
    
-
    Description
-
    
-
    
-[to do]
-
    
-
    Definition
-
    
-
    
-
    -#include "boost/mpl/erase_if.hpp"
-
    
-
    
-
    Parameters
-
    
-
-
-
-
     Parameter  Requirement  Description  Default argument  
    ParamA model of Concept[to do][to do] 
    
-
    
-
    Members
-
    
-
-
-
-
     Member  Description  
    type[to do] 
    
-
    
-
    Complexity
-
    
-
    
-[to do]
-
    
-
    Example
-
    
-
    
-
    -[to do]
-
    
-
    
-
    See also
-
    
-
    
-Algorithms, erase_all, erase_if, erase_range
-
    
-Table of Content | Reference
    Last edited February 19, 2002 3:54 am
\ No newline at end of file
diff --git a/doc/ref/Reference/erase_range.html b/doc/ref/Reference/erase_range.html
index 965ddb8..8bee8d9 100644
--- a/doc/ref/Reference/erase_range.html
+++ b/doc/ref/Reference/erase_range.html
@@ -1,8 +1,8 @@
 
-boost::mpl::Reference/erase range
+boost::mpl::erase_range
 
 
-
    [Home]erase_range
    Synopsis
+
    [Home]erase_range
    Synopsis
 
    
 
    
 
    @@ -26,7 +26,7 @@ struct erase_range
 
 
    
 
    -#include "boost/mpl/erase_range.hpp"
+#include "boost/mpl/erase_range.hpp"
 
    
 
    
 
    Parameters
@@ -60,4 +60,4 @@ struct erase_range
 
    
 Algorithms, erase, erase_all, erase_if
 
    
-Table of Content | Reference
    Last edited February 19, 2002 3:55 am
\ No newline at end of file
+Table of Contents
    Last edited February 19, 2002 3:55 am
\ No newline at end of file
diff --git a/doc/ref/Reference/filter_view.html b/doc/ref/Reference/filter_view.html
index 280f39b..e5016a6 100644
--- a/doc/ref/Reference/filter_view.html
+++ b/doc/ref/Reference/filter_view.html
@@ -1,8 +1,8 @@
 
-boost::mpl::Reference/filter view
+boost::mpl::filter_view
 
 
-
    [Home]filter_view
    Synopsis
    
+
    [Home]filter_view
    Synopsis
    
 
    
 
     template<
@@ -11,6 +11,7 @@ template<
     >
 struct filter_view
 {
+    // unspecified
 };
 
    
 
    
@@ -21,7 +22,7 @@ struct filter_view
 
    Definition
    
 
    
 
    -#include "boost/mpl/filter_view.hpp"
+#include "boost/mpl/filter_view.hpp"
 
    
 
    
 
    Parameters
    
@@ -48,7 +49,7 @@ Finds the largest floating type in a sequence.
 
    
 
     typedef list<int,float,long,float,char[50],long double,char> types;
-typedef max_element<
+typedef max_element<
       transform_view< filter_view< types,boost::is_float<_> >, size_of<_> >
     >::type iter;
 
    
@@ -57,6 +58,6 @@ BOOST_STATIC_ASSERT((is_same<iter::base::type,long double>::value));
 
    
 
    See also
    
 
    
-Sequences, transform_view, list, max_element
+Sequences, transform_view, joint_view, zip_view, max_element
 
    
-Table of Content | Reference
    Last edited July 23, 2002 4:04 am
\ No newline at end of file
+Table of Contents
    Last edited March 10, 2003 4:42 am
\ No newline at end of file
diff --git a/doc/ref/Reference/find.html b/doc/ref/Reference/find.html
index 20384f2..17108e9 100644
--- a/doc/ref/Reference/find.html
+++ b/doc/ref/Reference/find.html
@@ -1,8 +1,8 @@
 
-boost::mpl::Reference/find
+boost::mpl::find
 
 
-
    [Home]find
    Synopsis
    
+
    [Home]find
    Synopsis
    
 
    
 
     template<
@@ -22,7 +22,7 @@ Finds the first occurrence of type T in a Sequence.
 
    Definition
    
 
    
 
    -#include "boost/mpl/find.hpp"
+#include "boost/mpl/find.hpp"
 
    
 
    
 
    Parameters
    
@@ -48,11 +48,11 @@ Linear. At most size<Sequence>::value comparisons for identit
 
     typedef vector<char,int,unsigned,long,unsigned long> types;
 typedef find<types,unsigned>::type iter;
-BOOST_STATIC_ASSERT(iter::position == 2);
+BOOST_STATIC_ASSERT(iter::pos::value == 2);
 
    
 
    
 
    See also
    
 
    
 Algorithms, find_if, contains, count, count_if
 
    
-Table of Content | Reference
    Last edited July 17, 2002 4:48 am
\ No newline at end of file
+Table of Contents
    Last edited September 15, 2002 7:24 pm
\ No newline at end of file
diff --git a/doc/ref/Reference/find_if.html b/doc/ref/Reference/find_if.html
index 3b690dc..5d5b6a7 100644
--- a/doc/ref/Reference/find_if.html
+++ b/doc/ref/Reference/find_if.html
@@ -1,8 +1,8 @@
 
-boost::mpl::Reference/find if
+boost::mpl::find_if
 
 
-
    [Home]find_if
    Synopsis
    
+
    [Home]find_if
    Synopsis
    
 
    
 
     template<
@@ -22,7 +22,7 @@ Finds the first element in a Sequence that satisfies the predicate
 
    Definition
    
 
    
 
    -#include "boost/mpl/find_if.hpp"
+#include "boost/mpl/find_if.hpp"
 
    
 
    
 
    Parameters
    
@@ -48,11 +48,11 @@ Linear. At most size<Sequence>::value applications of P
 
     typedef vector<char,int,unsigned,long,unsigned_long> types;
 typedef find_if<types, is_same<_1,unsigned> >::type iter;
-BOOST_STATIC_ASSERT(iter::position == 2);
+BOOST_STATIC_ASSERT(iter::pos::value == 2);
 
    
 
    
 
    See also
    
 
    
 Algorithms, find, contains, count, count_if
 
    
-Table of Content | Reference
    Last edited July 17, 2002 4:48 am
\ No newline at end of file
+Table of Contents
    Last edited September 15, 2002 7:24 pm
\ No newline at end of file
diff --git a/doc/ref/Reference/fold.html b/doc/ref/Reference/fold.html
index ee2368d..73417b2 100644
--- a/doc/ref/Reference/fold.html
+++ b/doc/ref/Reference/fold.html
@@ -1,8 +1,8 @@
 
-boost::mpl::Reference/fold
+boost::mpl::fold
 
 
-
    [Home]fold
    Synopsis
    
+
    [Home]fold
    Synopsis
    
 
    
 
     template<
@@ -23,7 +23,7 @@ Returns the result of the successive application of binary ForwardOpDefinition
 
    
 
    -#include "boost/mpl/fold.hpp"
+#include "boost/mpl/fold.hpp"
 
    
 
    
 
    Parameters
    
@@ -52,14 +52,14 @@ typedef vector<long,float,short,double
 typedef typename fold<
       types
     , integral_c<long, 0>
-    , if_< is_float<_2>,next<_1>,_1 >
+    , if_< is_float<_2>,next<_1>,_1 >
     >::type number_of_floats;
 
    
-BOOST_STATIC_ASSERT(number_of_floats::value == 3);
+BOOST_STATIC_ASSERT(number_of_floats::value == 4);
 
    
 
    
 
    See also
    
 
    
 Algorithms, fold_backward, iter_fold, iter_fold_backward, copy, copy_if
 
    
-Table of Content | Reference
    Last edited July 19, 2002 2:12 am
\ No newline at end of file
+Table of Contents
    Last edited December 12, 2002 4:42 pm
\ No newline at end of file
diff --git a/doc/ref/Reference/fold_backward.html b/doc/ref/Reference/fold_backward.html
index c192da7..c624e7e 100644
--- a/doc/ref/Reference/fold_backward.html
+++ b/doc/ref/Reference/fold_backward.html
@@ -1,8 +1,8 @@
 
-boost::mpl::Reference/fold backward
+boost::mpl::fold_backward
 
 
-
    [Home]fold_backward
    Synopsis
    
+
    [Home]fold_backward
    Synopsis
    
 
    
 
     template<
@@ -24,7 +24,7 @@ Returns the result of the successive application of binary BackwardOpDefinition
 
    
 
    -#include "boost/mpl/fold_backward.hpp"
+#include "boost/mpl/fold_backward.hpp"
 
    
 
    
 
    Parameters
    
@@ -58,10 +58,10 @@ typedef list_c<int,-1,-7,-2,-5> neg
 typedef fold_backward<
       numbers
     , list_c<int>
-    , if_< less< _2,int_c<0> >, push_front<_1,_2,>, _1 >
+    , if_< less< _2,int_<0> >, push_front<_1,_2,>, _1 >
     >::type result;
 
    
-BOOST_STATIC_ASSERT(equal< negatives,result,equal_to<_,_> >::type::value);
+BOOST_STATIC_ASSERT(equal< negatives,result >::type::value);
 
    
 
    
 
    Notes
    
@@ -72,4 +72,4 @@ BOOST_STATIC_ASSERT(equal< negatives,re
 
    
 Algorithms, fold, iter_fold_backward, iter_fold, copy, copy_backward
 
    
-Table of Content | Reference
    Last edited July 19, 2002 1:58 am
\ No newline at end of file
+Table of Contents
    Last edited March 12, 2003 6:30 am
\ No newline at end of file
diff --git a/doc/ref/Reference/front.html b/doc/ref/Reference/front.html
index 056cc3f..eb7c409 100644
--- a/doc/ref/Reference/front.html
+++ b/doc/ref/Reference/front.html
@@ -1,8 +1,8 @@
 
-boost::mpl::Reference/front
+boost::mpl::front
 
 
-
    [Home]front
    Synopsis
    
+
    [Home]front
    Synopsis
    
 
    
 
     template<
@@ -21,7 +21,7 @@ Returns a type identical to the first element in the sequence.
 
    Definition
    
 
    
 
    -#include "boost/mpl/front.hpp"
+#include "boost/mpl/front.hpp"
 
    
 
    
 
    Parameters
    
@@ -57,4 +57,4 @@ BOOST_MPL_ASSERT_IS_SAME(front<types3>::type, char);
 
    
 Forward Sequence, back, at, push_front, begin, empty
 
    
-Table of Content | Reference
    Last edited July 17, 2002 3:48 am
\ No newline at end of file
+Table of Contents
    Last edited July 17, 2002 3:48 am
\ No newline at end of file
diff --git a/doc/ref/Reference/greater.html b/doc/ref/Reference/greater.html
index 81292ed..bdf9376 100644
--- a/doc/ref/Reference/greater.html
+++ b/doc/ref/Reference/greater.html
@@ -1,13 +1,13 @@
 
-boost::mpl::Reference/greater
+boost::mpl::greater
 
 
-
    [Home]greater
    Synopsis
    
+
    [Home]greater
    Synopsis
    
 
    
 
     template<
       typename T1
-    , typaname T2
+    , typename T2
     >
 struct greater
 {
@@ -17,12 +17,12 @@ struct greater
 
    
 
    Description
    
 
    
-Returns true_c if T1::value > T2::value and false_c otherwise [1].
+Returns true_ if T1::value > T2::value and false_ otherwise [1].
 
    
 
    Definition
    
 
    
 
    -#include "boost/mpl/comparison/greater.hpp"
+#include "boost/mpl/greater.hpp"
 
    
 
    
 
    Parameters
    
@@ -35,7 +35,7 @@ Returns true_c if T1::value > T2::value and f
 
    
 
-
+
    
 
     Expression  Expression type  Precondition  Semantics  Postcondition 
    typedef greater<t1,t2>::type c;A model of bool Integral ConstantEquivalent to typedef bool_c<(t1::value > t2::value)> c;
    typedef greater<t1,t2>::type c;A model of bool Integral ConstantEquivalent to typedef bool_<(t1::value > t2::value)> c;
    
 
    
 
    
 
    Complexity
    
@@ -46,7 +46,7 @@ Amortized constant time.
 
    
 
     typedef list_c<int,1,2,3,5,7,12,19,31> fibonacci;
-typedef find_if< fibonacci, greater<_,int_c<10> > >::type iter;
+typedef find_if< fibonacci, greater<_1,int_<10> > >::type iter;
 BOOST_STATIC_ASSERT(iter::type::value == 12));
 
    
 
    
@@ -58,4 +58,4 @@ BOOST_STATIC_ASSERT(iter::type::value == 12));
 
    
 Metafunctions, greater_equal, less, less_equal, equal_to, not_equal_to
 
    
-Table of Content | Reference
    Last edited July 17, 2002 4:16 am
\ No newline at end of file
+Table of Contents
    Last edited March 10, 2003 6:24 am
\ No newline at end of file
diff --git a/doc/ref/Reference/greater_equal.html b/doc/ref/Reference/greater_equal.html
index 3f0ee12..2997edb 100644
--- a/doc/ref/Reference/greater_equal.html
+++ b/doc/ref/Reference/greater_equal.html
@@ -1,13 +1,13 @@
 
-boost::mpl::Reference/greater equal
+boost::mpl::greater_equal
 
 
-
    [Home]greater_equal
    Synopsis
    
+
    [Home]greater_equal
    Synopsis
    
 
    
 
     template<
       typename T1
-    , typaname T2
+    , typename T2
     >
 struct greater_equal
 {
@@ -17,12 +17,12 @@ struct greater_equal
 
    
 
    Description
    
 
    
-Returns true_c if T1::value > T2::value and false_c otherwise [1].
+Returns true_ if T1::value > T2::value and false_ otherwise [1].
 
    
 
    Definition
    
 
    
 
    -#include "boost/mpl/comparison/greater_equal.hpp"
+#include "boost/mpl/greater_equal.hpp"
 
    
 
    
 
    Parameters
    
@@ -35,7 +35,7 @@ Returns true_c if T1::value > T2::value and f
 
    
 
-
+
    
 
     Expression  Expression type  Precondition  Semantics  Postcondition 
    typedef greater_equal<t1,t2>::type c;A model of bool Integral ConstantEquivalent to typedef bool_c<(t1::value >= t2::value)> c;
    typedef greater_equal<t1,t2>::type c;A model of bool Integral ConstantEquivalent to typedef bool_<(t1::value >= t2::value)> c;
    
 
    
 
    
 
    Complexity
    
@@ -46,8 +46,8 @@ Amortized constant time.
 
    
 
     typedef list_c<int,0,1,2,3,4,5,6,7,8,9> numbers;
-typedef remove_if< numbers, greater_equal<_,int_c<5> > >::type result;
-BOOST_STATIC_ASSERT(equal< result,range_c<int,0,5>,equal_to<_,_> >::type::value));
+typedef remove_if< numbers, greater_equal<_1,int_<5> > >::type result;
+BOOST_STATIC_ASSERT(equal< result,range_c<int,0,5> >::type::value));
 
    
 
    
 
    Notes
    
@@ -58,4 +58,4 @@ BOOST_STATIC_ASSERT(equal< result,
 Metafunctions, greater, less, less_equal, equal_to, not_equal_to
 
    
-Table of Content | Reference
    Last edited July 17, 2002 4:16 am
\ No newline at end of file
+Table of Contents
    Last edited March 10, 2003 6:25 am
\ No newline at end of file
diff --git a/doc/ref/Reference/insert.html b/doc/ref/Reference/insert.html
index 63f6554..56ccc1c 100644
--- a/doc/ref/Reference/insert.html
+++ b/doc/ref/Reference/insert.html
@@ -1,8 +1,8 @@
 
-boost::mpl::Reference/insert
+boost::mpl::insert
 
 
-
    [Home]insert
    Synopsis
    
+
    [Home]insert
    Synopsis
    
 
    
 
     template<
@@ -23,7 +23,7 @@ struct insert
 
    Definition
    
 
    
 
    -#include "boost/mpl/insert.hpp"
+#include "boost/mpl/insert.hpp"
 
    
 
    
 
    Parameters
    
@@ -59,4 +59,4 @@ BOOST_STATIC_ASSERT((equal< range,
 Extensible Sequence, insert_range, push_front, push_back, erase
 
    
-Table of Content | Reference
    Last edited July 17, 2002 5:17 am
\ No newline at end of file
+Table of Contents
    Last edited July 17, 2002 5:17 am
\ No newline at end of file
diff --git a/doc/ref/Reference/insert_range.html b/doc/ref/Reference/insert_range.html
index f7a8672..10bdf7c 100644
--- a/doc/ref/Reference/insert_range.html
+++ b/doc/ref/Reference/insert_range.html
@@ -1,8 +1,8 @@
 
-boost::mpl::Reference/insert range
+boost::mpl::insert_range
 
 
-
    [Home]insert_range
    Synopsis
    
+
    [Home]insert_range
    Synopsis
    
 
    
 
     template<
@@ -23,7 +23,7 @@ struct insert_range
 
    Definition
    
 
    
 
    -#include "boost/mpl/insert_range.hpp"
+#include "boost/mpl/insert_range.hpp"
 
    
 
    
 
    Parameters
    
@@ -59,4 +59,4 @@ BOOST_STATIC_ASSERT((equal< range,
 Extensible Sequence, insert, push_front, push_back, erase
 
    
-Table of Content | Reference
    Last edited July 22, 2002 4:32 pm
\ No newline at end of file
+Table of Contents
    Last edited July 22, 2002 4:32 pm
\ No newline at end of file
diff --git a/doc/ref/Reference/iter_fold.html b/doc/ref/Reference/iter_fold.html
index b336eb1..f3ddd0c 100644
--- a/doc/ref/Reference/iter_fold.html
+++ b/doc/ref/Reference/iter_fold.html
@@ -1,8 +1,8 @@
 
-boost::mpl::Reference/iter fold
+boost::mpl::iter_fold
 
 
-
    [Home]iter_fold
    Synopsis
    
+
    [Home]iter_fold
    Synopsis
    
 
    
 
     template<
@@ -23,7 +23,7 @@ Returns the result of the successive application of binary ForwardOpDefinition
 
    
 
    -#include "boost/mpl/iter_fold.hpp"
+#include "boost/mpl/iter_fold.hpp"
 
    
 
    
 
    Parameters
    
@@ -52,7 +52,7 @@ typedef list_c<int,5,-1,0,7,2,0,-5,4&g
 typedef iter_fold<
       numbers
     , begin<numbers>::type
-    , if_< less< deref<_1>, deref<_2> >,_2,_1 >
+    , if_< less< deref<_1>, deref<_2> >,_2,_1 >
     >::type max_element_iter;
 
    
 BOOST_STATIC_ASSERT(max_element_iter::type::value == 7);
@@ -62,4 +62,4 @@ BOOST_STATIC_ASSERT(max_element_iter::type::value == 7);
 
    
 Algorithms, iter_fold_backward, fold, fold_backward, copy, copy_backward
 
    
-Table of Content | Reference
    Last edited July 19, 2002 1:16 am
\ No newline at end of file
+Table of Contents
    Last edited July 19, 2002 1:16 am
\ No newline at end of file
diff --git a/doc/ref/Reference/iter_fold_backward.html b/doc/ref/Reference/iter_fold_backward.html
index a2b7b3a..d7ee2dd 100644
--- a/doc/ref/Reference/iter_fold_backward.html
+++ b/doc/ref/Reference/iter_fold_backward.html
@@ -1,8 +1,8 @@
 
-boost::mpl::Reference/iter fold backward
+boost::mpl::iter_fold_backward
 
 
-
    [Home]iter_fold_backward
    Synopsis
    
+
    [Home]iter_fold_backward
    Synopsis
    
 
    
 
     template<
@@ -24,7 +24,7 @@ Returns the result of the successive application of binary BackwardOpDefinition
 
    
 
    -#include "boost/mpl/iter_fold_backward.hpp"
+#include "boost/mpl/iter_fold_backward.hpp"
 
    
 
    
 
    Parameters
    
@@ -58,14 +58,14 @@ typedef list_c<int,-1,-7,-2,-5> neg
 typedef iter_fold_backward<
       numbers
     , list<>
-    , if_< less< deref<_2>,int_c<0> >, push_front<_1,_2>, _1 >
+    , if_< less< deref<_2>,int_<0> >, push_front<_1,_2>, _1 >
     >::type iters;
 
    
-BOOST_STATIC_ASSERT(equal< negatives, transform_view< iters,deref<_> >, equal_to<_,_> >::type::value);
+BOOST_STATIC_ASSERT(equal< negatives, transform_view< iters,deref<_1> > >::type::value);
 
    
 
    
 
    See also
    
 
    
 Algorithms, iter_fold, fold_backward, fold, copy, copy_backward
 
    
-Table of Content | Reference
    Last edited July 19, 2002 1:58 am
\ No newline at end of file
+Table of Contents
    Last edited March 12, 2003 6:31 am
\ No newline at end of file
diff --git a/doc/ref/Reference/iter_fold_if.html b/doc/ref/Reference/iter_fold_if.html
deleted file mode 100644
index 320c43f..0000000
--- a/doc/ref/Reference/iter_fold_if.html
+++ /dev/null
@@ -1,70 +0,0 @@
-
-boost::mpl::Reference/iter fold if
-
-
-
    [Home]iter_fold_if
    Synopsis
    
-
    
-
    -template<
-      typename Sequence
-    , typename State
-    , typename BackwardOp
-    , typename ForwardOp = _1
-    >
-struct iter_fold_backward
-{
-    typedef unspecified type;
-};
-
    
-
    
-
    Description
    
-
    
-Returns the result of the successive application of binary BackwardOp to the result of the previous BackwardOp invocation (State if it's the first call) and each iterator in the range [begin<Sequence>::type,end<Sequence>::type) in the reverse order. If ForwardOp is provided, then it's applied on forward traversal to form the result which is passed to the first BackwardOp call.
-
    
-
    Definition
    
-
    
-
    -#include "boost/mpl/iter_fold_backward.hpp"
-
    
-
    
-
    Parameters
    
-
-
-
-
-
-
-
     Parameter  Requirement  Description  Default value  
    SequenceA model of SequenceA sequence to iterate.
    StateA typeThe initial state for the first BackwardOp/ForwardOp application.
    BackwardOpA model of [Lambda Function]The operation to be executed on backward traversal.
    ForwardOpA model of [Lambda Function]The operation to be executed on forward traversal.arg<1> 
    
-
    
-
    Expression semantics
    
-
    
-
-
-
-
-
     Expression  Expression type  Precondition  Semantics  Postcondition 
    typedef iter_fold_backward< Sequence,T,BackwardOp >::type t;A typeEquivalent to typedef lambda<BackwardOp>::type bk_op; typedef begin<Sequence>::type i1; typedef i1::next i2; ...; typedef in::next last; typedef apply<bk_op,T,in>::type tn; typedef apply<bk_op,tn,in-1>::type tn-1; ...; typedef apply<bk_op,t2,i1>::type t1; typedef t1 t, where n == size<Sequence>::type::value and last is identical to end<Sequence>::type; Equivalent to typedef T t; if the sequence is empty.
    typedef iter_fold_backward< Sequence,T,BackwardOp,ForwardOp >::type t;A typeEquivalent to typedef iter_fold_backward<Sequence, iter_fold<Sequence,State,ForwardOp>::type, BackwardOp>::type t;.
    
-
    
-
    Complexity
    
-
    
-Linear. Exactly size<Sequence>::type::value applications of BackwardOp and ForwardOp. 
-
    
-
    Example
    
-
    
-Finds an iterator to the last negative element in the sequence.
-
    
-
    -typedef list_c<int,5,-1,0,7,2,0,-5,4> numbers;
-typedef iter_fold_backward<
-      numbers
-    , end<numbers>::type
-    , if_< less< deref<_2>, int_c<0> >,_2,_1 >
-    >::type last_negative_iter;
-
    
-BOOST_STATIC_ASSERT(last_negative_iter::type::value == -5);
-
    
-
    
-
    See also
    
-
    
-Algorithms, iter_fold, fold_backward, fold, copy, copy_backward
-
    
-Table of Content | Reference
    Last edited July 19, 2002 1:25 am
\ No newline at end of file
diff --git a/doc/ref/Reference/iterator_category.html b/doc/ref/Reference/iterator_category.html
index 904dd4e..1e90cfc 100644
--- a/doc/ref/Reference/iterator_category.html
+++ b/doc/ref/Reference/iterator_category.html
@@ -1,8 +1,8 @@
 
-boost::mpl::Reference/iterator category
+boost::mpl::iterator_category
 
 
-
    [Home]iterator_category
    Synopsis
    
+
    [Home]iterator_category
    Synopsis
    
 
    
 
     template<
@@ -21,8 +21,8 @@ Returns one of the following iterator category tags: input_iterator_tagDefinition
 
    
 
    -#include "boost/mpl/iterator_category.hpp"
-#include "boost/mpl/iterator_tag.hpp"
+#include "boost/mpl/iterator_category.hpp"
+#include "boost/mpl/iterator_tag.hpp"
 
    
 
    
 
    Parameters
    
@@ -59,4 +59,4 @@ struct my_algorithm
 
    
 Iterators, Sequence, begin, end, advance, distance
 
    
-Table of Content | Reference
    Last edited July 17, 2002 6:20 am
\ No newline at end of file
+Table of Contents
    Last edited July 17, 2002 6:20 am
\ No newline at end of file
diff --git a/doc/ref/Reference/less.html b/doc/ref/Reference/less.html
index a8aa5e8..8ff0fcb 100644
--- a/doc/ref/Reference/less.html
+++ b/doc/ref/Reference/less.html
@@ -1,13 +1,13 @@
 
-boost::mpl::Reference/less
+boost::mpl::less
 
 
-
    [Home]less
    Synopsis
    
+
    [Home]less
    Synopsis
    
 
    
 
     template<
       typename T1
-    , typaname T2
+    , typename T2
     >
 struct less
 {
@@ -17,12 +17,12 @@ struct less
 
    
 
    Description
    
 
    
-Returns true_c if T1::value < T2::value and false_c otherwise [1].
+Returns true_ if T1::value < T2::value and false_ otherwise [1].
 
    
 
    Definition
    
 
    
 
    -#include "boost/mpl/comparison/less.hpp"
+#include "boost/mpl/less.hpp"
 
    
 
    
 
    Parameters
    
@@ -35,7 +35,7 @@ Returns true_c if T1::value < T2::value and f
 
    
 
-
+
    
 
     Expression  Expression type  Precondition  Semantics  Postcondition 
    typedef less<t1,t2>::type c;A model of bool Integral ConstantEquivalent to typedef bool_c<(t1::value < t2::value)> c;
    typedef less<t1,t2>::type c;A model of bool Integral ConstantEquivalent to typedef bool_<(t1::value < t2::value)> c;
    
 
    
 
    
 
    Complexity
    
@@ -46,8 +46,8 @@ Amortized constant time.
 
    
 
     typedef list_c<int,0,1,2,3,4,5,6,7,8,9> numbers;
-typedef remove_if< numbers, less<_,int_c<5> > >::type result;
-BOOST_STATIC_ASSERT(equal< result,range_c<int,5,10>,equal_to<_,_> >::type::value));
+typedef remove_if< numbers, less<_1,int_<5> > >::type result;
+BOOST_STATIC_ASSERT(equal< result,range_c<int,5,10> >::type::value));
 
    
 
    
 
    Notes
    
@@ -58,4 +58,4 @@ BOOST_STATIC_ASSERT(equal< result,
 Metafunctions, less_equal, greater, greater_equal, equal, not_equal_to
 
    
-Table of Content | Reference
    Last edited July 17, 2002 4:15 am
\ No newline at end of file
+Table of Contents
    Last edited March 10, 2003 6:22 am
\ No newline at end of file
diff --git a/doc/ref/Reference/less_equal.html b/doc/ref/Reference/less_equal.html
index e1293f6..379f9a6 100644
--- a/doc/ref/Reference/less_equal.html
+++ b/doc/ref/Reference/less_equal.html
@@ -1,13 +1,13 @@
 
-boost::mpl::Reference/less equal
+boost::mpl::less_equal
 
 
-
    [Home]less_equal
    Synopsis
    
+
    [Home]less_equal
    Synopsis
    
 
    
 
     template<
       typename T1
-    , typaname T2
+    , typename T2
     >
 struct less_equal
 {
@@ -17,12 +17,12 @@ struct less_equal
 
    
 
    Description
    
 
    
-Returns true_c if T1::value <= T2::value and false_c otherwise [1].
+Returns true_ if T1::value <= T2::value and false_ otherwise [1].
 
    
 
    Definition
    
 
    
 
    -#include "boost/mpl/comparison/less_equal.hpp"
+#include "boost/mpl/less_equal.hpp"
 
    
 
    
 
    Parameters
    
@@ -35,7 +35,7 @@ Returns true_c if T1::value <= T2::value and 
 
    
 
-
+
    
 
     Expression  Expression type  Precondition  Semantics  Postcondition 
    typedef less_equal<t1,t2>::type c;A model of bool Integral ConstantEquivalent to typedef bool_c<(t1::value <= t2::value)> c;
    typedef less_equal<t1,t2>::type c;A model of bool Integral ConstantEquivalent to typedef bool_<(t1::value <= t2::value)> c;
    
 
    
 
    
 
    Complexity
    
@@ -46,8 +46,8 @@ Amortized constant time.
 
    
 
     typedef list_c<int,0,1,2,3,4,5,6,7,8,9> numbers;
-typedef remove_if< numbers, less_equal<_,int_c<4> > >::type result;
-BOOST_STATIC_ASSERT(equal< result,range_c<int,5,10>,equal_to<_,_> >::type::value));
+typedef remove_if< numbers, less_equal<_1,int_<4> > >::type result;
+BOOST_STATIC_ASSERT(equal< result,range_c<int,5,10> >::type::value));
 
    
 
    
 
    Notes
    
@@ -58,4 +58,4 @@ BOOST_STATIC_ASSERT(equal< result,
 Metafunctions, less, greater, greater_equal, equal, not_equal_to
 
    
-Table of Content | Reference
    Last edited July 17, 2002 4:15 am
\ No newline at end of file
+Table of Contents
    Last edited March 10, 2003 6:28 am
\ No newline at end of file
diff --git a/doc/ref/Reference/list.html b/doc/ref/Reference/list.html
index 6bf9629..4a522d2 100644
--- a/doc/ref/Reference/list.html
+++ b/doc/ref/Reference/list.html
@@ -1,8 +1,8 @@
 
-boost::mpl::Reference/list
+boost::mpl::list
 
 
-
    [Home]list
    Synopsis
    
+
    [Home]list
    Synopsis
    
 
    
 
     template<
@@ -31,15 +31,15 @@ BOOST_STATIC_ASSERT((boost::is_same< front<
 
    Definition
    
 
    
 
    -#include "boost/mpl/list.hpp"
-#include "boost/mpl/list/list0.hpp"
-#include "boost/mpl/list/list10.hpp"
+#include "boost/mpl/list.hpp"
+#include "boost/mpl/list/list0.hpp"
+#include "boost/mpl/list/list10.hpp"
 ...
-#include "boost/mpl/list/list50.hpp"
+#include "boost/mpl/list/list50.hpp"
 
    
 
    
 
    See also
    
 
    
 Forward Sequence, list_c, vector, vector_c, range_c
 
    
-Table of Content | Reference
    Last edited July 17, 2002 8:05 am
\ No newline at end of file
+Table of Contents
    Last edited July 17, 2002 8:05 am
\ No newline at end of file
diff --git a/doc/ref/Reference/list_c.html b/doc/ref/Reference/list_c.html
index b98a9a7..3635e75 100644
--- a/doc/ref/Reference/list_c.html
+++ b/doc/ref/Reference/list_c.html
@@ -1,8 +1,8 @@
 
-boost::mpl::Reference/list c
+boost::mpl::list_c
 
 
-
    [Home]list_c
    Synopsis
    
+
    [Home]list_c
    Synopsis
    
 
    
 
     template<
@@ -44,15 +44,15 @@ typedef list<
 
    Definition
    
 
    
 
    -#include "boost/mpl/list_c.hpp"
-#include "boost/mpl/list/list0_c.hpp"
-#include "boost/mpl/list/list10_c.hpp"
+#include "boost/mpl/list_c.hpp"
+#include "boost/mpl/list/list0_c.hpp"
+#include "boost/mpl/list/list10_c.hpp"
 ...
-#include "boost/mpl/list/list50_c.hpp"
+#include "boost/mpl/list/list50_c.hpp"
 
    
 
    
 
    See also
    
 
    
 Random Access Sequence, list, vector, vector_c, range_c
 
    
-Table of Content | Reference
    Last edited July 17, 2002 8:04 am
\ No newline at end of file
+Table of Contents
    Last edited July 17, 2002 8:04 am
\ No newline at end of file
diff --git a/doc/ref/Reference/logical_and.html b/doc/ref/Reference/logical_and.html
deleted file mode 100644
index ce03f3d..0000000
--- a/doc/ref/Reference/logical_and.html
+++ /dev/null
@@ -1,62 +0,0 @@
-
-boost::mpl::Reference/logical and
-
-
-
    [Home]logical_and
    Synopsis
    
-
    
-
    -template< 
-      typename F1
-    , typename F2
-    , typename F3 = true_c
-    ...
-    , typename Fn = true_c
-    >
-struct logical_and
-{
-    typedef unspecified type;
-};
-
    
-
    
-
    Description
    
-
    
-Returns the result of short-circuit logical and (&&) operation on its arguments.
-
    
-
    Definition
    
-
    
-
    -#include "boost/mpl/logical/and.hpp"
-
    
-
    
-
    Parameters
    
-
-
-
-
     Parameter  Requirement  Description  
    F1, F2, .., FnA model of nullary Metafunction
    
-
    
-
    Expression semantics
    
-
    
-
-
-
-
     Expression  Precondition  Semantics  Postcondition 
    typedef logical_and<f1,f2,..,fn>::type c;Returns false_c if either of f1::type::value, f2::type::value, .., fn::type::value expressions evaluates to false, and true_c otherwise; guarantees left-to-right evaluation; moreover, the operands subsequent to the first fi metafunction that evaluates to false are not evaluated.
    
-
    
-
    Example
    
-
    
-
    -// will generate compile-time error if invoked with T == any fundamental type
-template< typename T > struct fail
-{
-   typedef typename T::nonexistent type;
-};
-
    
-BOOST_STATIC_ASSERT((logical_and< true_c,false_c >::type::value == false));
-BOOST_STATIC_ASSERT((logical_and< false_c,fail<int> >::type::value == false)); // ok, fail<int> is never invoked
-BOOST_STATIC_ASSERT((logical_and< true_c,false_c,fail<int> >::type::value == false)); // ok too
-
    
-
    
-
    See also
    
-
    
-Metafunctions, logical_or, logical_not
-
    
-Table of Content | Reference
    Last edited July 17, 2002 1:06 am
\ No newline at end of file
diff --git a/doc/ref/Reference/logical_not.html b/doc/ref/Reference/logical_not.html
deleted file mode 100644
index bc47337..0000000
--- a/doc/ref/Reference/logical_not.html
+++ /dev/null
@@ -1,51 +0,0 @@
-
-boost::mpl::Reference/logical not
-
-
-
    [Home]logical_not
    Synopsis
    
-
    
-
    -template< 
-      typename F
-    >
-struct logical_not
-{
-    typedef unspecified type;
-};
-
    
-
    
-
    Description
    
-
    
-Returns the result of logical not (!) operation on its argument.
-
    
-
    Definition
    
-
    
-
    -#include "boost/mpl/logical/not.hpp"
-
    
-
    
-
    Parameters
    
-
-
-
-
     Parameter  Requirement  Description  
    FA model of nullary Metafunction
    
-
    
-
    Expression semantics
    
-
    
-
-
-
-
     Expression  Expression type  Precondition  Semantics  Postcondition 
    typedef logical_not<f>::type c;A model of bool Integral ConstantEquivalent to typedef bool_c<(!f::type::value)> c;
    
-
    
-
    Example
    
-
    
-
    -BOOST_STATIC_ASSERT(logical_not<true_c>::type::value == false);
-BOOST_STATIC_ASSERT(logical_not<false_c>::type::value == true);
-
    
-
    
-
    See also
    
-
    
-Metafunctions, logical_and, logical_or
-
    
-Table of Content | Reference
    Last edited July 17, 2002 4:13 am
\ No newline at end of file
diff --git a/doc/ref/Reference/logical_or.html b/doc/ref/Reference/logical_or.html
deleted file mode 100644
index 801007d..0000000
--- a/doc/ref/Reference/logical_or.html
+++ /dev/null
@@ -1,62 +0,0 @@
-
-boost::mpl::Reference/logical or
-
-
-
    [Home]logical_or
    Synopsis
    
-
    
-
    -template< 
-      typename F1
-    , typename F2
-    , typename F3 = false_c
-    ...
-    , typename Fn = false_c
-    >
-struct logical_or
-{
-    typedef unspecified type;
-};
-
    
-
    
-
    Description
    
-
    
-Returns the result of short-circuit logical or (||) operation on its arguments.
-
    
-
    Definition
    
-
    
-
    -#include "boost/mpl/logical/or.hpp"
-
    
-
    
-
    Parameters
    
-
-
-
-
     Parameter  Requirement  Description  
    F1, F2, .., FnA model of nullary Metafunction
    
-
    
-
    Expression semantics
    
-
    
-
-
-
-
     Expression  Expression type  Precondition  Semantics  Postcondition 
    typedef logical_or<f1,f2,..,fn>::type c;A model of bool Integral ConstantReturns true_c if either of f1::type::value, f2::type::value, .., fn::type::value expressions evaluates to true, and false_c otherwise; guarantees left-to-right evaluation; moreover, the operands subsequent to the first fi metafunction that evaluates to true are not evaluated.
    
-
    
-
    Example
    
-
    
-
    -// will generate compile-time error if invoked with T == any fundamental type
-template< typename T > struct fail
-{
-   typedef typename T::nonexistent type;
-};
-
    
-BOOST_STATIC_ASSERT((logical_or< false_c,true_c >::type::value == true));
-BOOST_STATIC_ASSERT((logical_or< true_c,fail<int> >::type::value == true)); // ok, fail<int> is never invoked
-BOOST_STATIC_ASSERT((logical_or< false_c,true_c,fail<int> >::type::value == true)); // ok too
-
    
-
    
-
    See also
    
-
    
-Metafunctions, logical_and, logical_not
-
    
-Table of Content | Reference
    Last edited July 17, 2002 4:12 am
\ No newline at end of file
diff --git a/doc/ref/Reference/lower_bound.html b/doc/ref/Reference/lower_bound.html
index 0b116d4..85f36e1 100644
--- a/doc/ref/Reference/lower_bound.html
+++ b/doc/ref/Reference/lower_bound.html
@@ -1,14 +1,14 @@
 
-boost::mpl::Reference/lower bound
+boost::mpl::lower_bound
 
 
-
    [Home]lower_bound
    Synopsis
    
+
    [Home]lower_bound
    Synopsis
    
 
    
 
     template<
       typename Sequence
     , typename T
-    , typename Pred
+    , typename Pred = less<_,_>
     >
 struct lower_bound
 {
@@ -23,7 +23,7 @@ Returns the first position in the sorted Sequence where TDefinition
 
    
 
    -#include "boost/mpl/lower_bound.hpp"
+#include "boost/mpl/lower_bound.hpp"
 
    
 
    
 
    Parameters
    
@@ -49,12 +49,13 @@ The number of comparisons is logarithmic: at most log(size<Sequence>
 
    
 
     typedef list_c<int,1,2,3,3,3,5,8> numbers;
-typedef lower_bound< numbers, int_c<3>, less<_,_> >::type iter;
+typedef lower_bound< numbers, int_<3> >::type iter;
 BOOST_STATIC_ASSERT((distance< begin<numbers>::type,iter >::type::value == 2));
+BOOST_STATIC_ASSERT(iter::type::value == 3);
 
    
 
    
 
    See also
    
 
    
-Algorithms, sort, upper_bound
+Algorithms, sort, upper_bound
 
    
-Table of Content | Reference
    Last edited July 17, 2002 5:13 am
\ No newline at end of file
+Table of Contents
    Last edited March 10, 2003 5:43 am
\ No newline at end of file
diff --git a/doc/ref/Reference/minus.html b/doc/ref/Reference/minus.html
index 1910713..83752b0 100644
--- a/doc/ref/Reference/minus.html
+++ b/doc/ref/Reference/minus.html
@@ -1,16 +1,16 @@
 
-boost::mpl::Reference/minus
+boost::mpl::minus
 
 
-
    [Home]minus
    Synopsis
    
+
    [Home]minus
    Synopsis
    
 
    
 
     template<
       typename T1
-    , typaname T2
-    , typaname T3 = integral_c<int,0>
+    , typename T2
+    , typename T3 = integral_c<int,0>
     , ...
-    , typaname Tn = integral_c<int,0>
+    , typename Tn = integral_c<int,0>
     >
 struct minus
 {
@@ -25,7 +25,7 @@ Returns the difference of its arguments [1].
 
    Definition
    
 
    
 
    -#include "boost/mpl/arithmetic/minus.hpp"
+#include "boost/mpl/minus.hpp"
 
    
 
    
 
    Parameters
    
@@ -61,4 +61,4 @@ BOOST_MPL_ASSERT_IS_SAME(diff::value_type, long);
 
    
 Metafunctions, plus, divides, multiplies, modulus, negate
 
    
-Table of Content | Reference
    Last edited July 17, 2002 4:06 am
\ No newline at end of file
+Table of Contents
    Last edited March 10, 2003 6:31 am
\ No newline at end of file
diff --git a/doc/ref/Reference/modulus.html b/doc/ref/Reference/modulus.html
index 0f39fb7..0b7a646 100644
--- a/doc/ref/Reference/modulus.html
+++ b/doc/ref/Reference/modulus.html
@@ -1,13 +1,13 @@
 
-boost::mpl::Reference/modulus
+boost::mpl::modulus
 
 
-
    [Home]modulus
    Synopsis
    
+
    [Home]modulus
    Synopsis
    
 
    
 
     template<
       typename T1
-    , typaname T2
+    , typename T2
     >
 struct modulus
 {
@@ -22,7 +22,7 @@ Returns the modulus of its arguments [1].
 
    Definition
    
 
    
 
    -#include "boost/mpl/arithmetic/modulus.hpp"
+#include "boost/mpl/modulus.hpp"
 
    
 
    
 
    Parameters
    
@@ -58,4 +58,4 @@ BOOST_MPL_ASSERT_IS_SAME(mod::value_type, long);
 
    
 Metafunctions, divides, multiplies, plus, minus, negate
 
    
-Table of Content | Reference
    Last edited July 17, 2002 4:10 am
\ No newline at end of file
+Table of Contents
    Last edited March 10, 2003 6:32 am
\ No newline at end of file
diff --git a/doc/ref/Reference/multiplies.html b/doc/ref/Reference/multiplies.html
index 9a00ea3..111bd20 100644
--- a/doc/ref/Reference/multiplies.html
+++ b/doc/ref/Reference/multiplies.html
@@ -1,16 +1,16 @@
 
-boost::mpl::Reference/multiplies
+boost::mpl::multiplies
 
 
-
    [Home]multiplies
    Synopsis
    
+
    [Home]multiplies
    Synopsis
    
 
    
 
     template<
       typename T1
-    , typaname T2
-    , typaname T3 = integral_c<int,1>
+    , typename T2
+    , typename T3 = integral_c<int,1>
     , ...
-    , typaname Tn = integral_c<int,1>
+    , typename Tn = integral_c<int,1>
     >
 struct multiplies
 {
@@ -25,7 +25,7 @@ Returns the product of its arguments [1].
 
    Definition
    
 
    
 
    -#include "boost/mpl/arithmetic/multiplies.hpp"
+#include "boost/mpl/multiplies.hpp"
 
    
 
    
 
    Parameters
    
@@ -61,4 +61,4 @@ BOOST_MPL_ASSERT_IS_SAME(product::value_type, long);
 
    
 Metafunctions, divides, modulus, plus, minus, negate
 
    
-Table of Content | Reference
    Last edited July 17, 2002 4:07 am
\ No newline at end of file
+Table of Contents
    Last edited March 10, 2003 6:31 am
\ No newline at end of file
diff --git a/doc/ref/Reference/negate.html b/doc/ref/Reference/negate.html
index 0b57a14..266b70e 100644
--- a/doc/ref/Reference/negate.html
+++ b/doc/ref/Reference/negate.html
@@ -1,8 +1,8 @@
 
-boost::mpl::Reference/negate
+boost::mpl::negate
 
 
-
    [Home]negate
    Synopsis
    
+
    [Home]negate
    Synopsis
    
 
    
 
     template<
@@ -21,7 +21,7 @@ Returns the negative (additive inverse) of its argument [1].
 
    Definition
    
 
    
 
    -#include "boost/mpl/arithmetic/negate.hpp"
+#include "boost/mpl/negate.hpp"
 
    
 
    
 
    Parameters
    
@@ -57,4 +57,4 @@ BOOST_MPL_ASSERT_IS_SAME(n::value_type, short);
 
    
 Metafunctions, minus, plus, multiplies, divides, modulus
 
    
-Table of Content | Reference
    Last edited July 17, 2002 4:10 am
\ No newline at end of file
+Table of Contents
    Last edited March 10, 2003 6:33 am
\ No newline at end of file
diff --git a/doc/ref/Reference/next.html b/doc/ref/Reference/next.html
deleted file mode 100644
index cc00727..0000000
--- a/doc/ref/Reference/next.html
+++ /dev/null
@@ -1,61 +0,0 @@
-
-boost::mpl::Reference/next
-
-
-
    [Home]next
    Synopsis
-
    
-
    
-
    -template<
-      typename T
-    >
-struct next
-{
-    typedef implementation-defined type;
-};
-
    
-
    
-
    Description
-
    
-
    
-[to do]
-
    
-
    Definition
-
    
-
    
-
    -#include "boost/mpl/next.hpp"
-
    
-
    
-
    Parameters
-
    
-
-
-
-
     Parameter  Requirement  Description  Default argument  
    ParamA model of Concept[to do][to do] 
    
-
    
-
    Members
-
    
-
-
-
-
     Member  Description  
    type[to do] 
    
-
    
-
    Complexity
-
    
-
    
-[to do]
-
    
-
    Example
-
    
-
    
-
    -[to do]
-
    
-
    
-
    See also
-
    
-
    
-Algorithms, prior
-
    
-Table of Content | Reference
    Last edited February 19, 2002 4:25 am
\ No newline at end of file
diff --git a/doc/ref/Reference/not_equal_to.html b/doc/ref/Reference/not_equal_to.html
index 785e28a..1a1e224 100644
--- a/doc/ref/Reference/not_equal_to.html
+++ b/doc/ref/Reference/not_equal_to.html
@@ -1,13 +1,13 @@
 
-boost::mpl::Reference/not equal to
+boost::mpl::not_equal_to
 
 
-
    [Home]not_equal_to
    Synopsis
    
+
    [Home]not_equal_to
    Synopsis
    
 
    
 
     template<
       typename T1
-    , typaname T2
+    , typename T2
     >
 struct not_equal_to
 {
@@ -17,12 +17,12 @@ struct not_equal_to
 
    
 
    Description
    
 
    
-Returns true_c if T1::value != T2::value and false_c otherwise [1].
+Returns true_ if T1::value != T2::value and false_ otherwise [1].
 
    
 
    Definition
    
 
    
 
    -#include "boost/mpl/comparison/not_equal_to.hpp"
+#include "boost/mpl/not_equal_to.hpp"
 
    
 
    
 
    Parameters
    
@@ -35,7 +35,7 @@ Returns true_c if T1::value != T2::value and fal
 
    
 
-
+
    
 
     Expression  Expression type  Precondition  Semantics  Postcondition 
    typedef not_equal_to<t1,t2>::type c;A model of bool Integral ConstantEquivalent to typedef bool_c<(t1::value != t2::value)> c;
    typedef not_equal_to<t1,t2>::type c;A model of bool Integral ConstantEquivalent to typedef bool_<(t1::value != t2::value)> c;
    
 
    
 
    
 
    Complexity
    
@@ -46,8 +46,8 @@ Amortized constant time.
 
    
 
     typedef list_c<int,1,5,0,7,5,-1,2,4,5> numbers;
-typedef remove_if< numbers, not_equal_to<_,int_c<5> > >::type fives;
-BOOST_STATIC_ASSERT(equal_to< count_if< fives, equal_to<_,int_c<5> > >::type, size<fives>::type >::type::value));
+typedef remove_if< numbers, not_equal_to<_1,int_<5> > >::type fives;
+BOOST_STATIC_ASSERT(equal_to< count_if< fives, equal_to<_1,int_<5> > >::type, size<fives>::type >::type::value));
 
    
 
    
 
    Notes
    
@@ -58,4 +58,4 @@ BOOST_STATIC_ASSERT(equal_to< 
 Metafunctions, equal_to, less, less_equal, greater, greater_equal
 
    
-Table of Content | Reference
    Last edited July 17, 2002 4:14 am
\ No newline at end of file
+Table of Contents
    Last edited March 10, 2003 6:20 am
\ No newline at end of file
diff --git a/doc/ref/Reference/plus.html b/doc/ref/Reference/plus.html
index c39e75e..7b71d80 100644
--- a/doc/ref/Reference/plus.html
+++ b/doc/ref/Reference/plus.html
@@ -1,16 +1,16 @@
 
-boost::mpl::Reference/plus
+boost::mpl::plus
 
 
-
    [Home]plus
    Synopsis
    
+
    [Home]plus
    Synopsis
    
 
    
 
     template<
       typename T1
-    , typaname T2
-    , typaname T3 = integral_c<int,0>
+    , typename T2
+    , typename T3 = integral_c<int,0>
     , ...
-    , typaname Tn = integral_c<int,0>
+    , typename Tn = integral_c<int,0>
     >
 struct plus
 {
@@ -25,7 +25,7 @@ Returns the sum of its arguments [1].
 
    Definition
    
 
    
 
    -#include "boost/mpl/arithmetic/plus.hpp"
+#include "boost/mpl/plus.hpp"
 
    
 
    
 
    Parameters
    
@@ -61,4 +61,4 @@ BOOST_MPL_ASSERT_IS_SAME(sum::value_type, long);
 
    
 Metafunctions, minus, multiplies, divides, modulus, negate
 
    
-Table of Content | Reference
    Last edited July 17, 2002 4:05 am
\ No newline at end of file
+Table of Contents
    Last edited March 10, 2003 6:30 am
\ No newline at end of file
diff --git a/doc/ref/Reference/pop_back.html b/doc/ref/Reference/pop_back.html
index bea1777..adbd4f4 100644
--- a/doc/ref/Reference/pop_back.html
+++ b/doc/ref/Reference/pop_back.html
@@ -1,8 +1,8 @@
 
-boost::mpl::Reference/pop back
+boost::mpl::pop_back
 
 
-
    [Home]pop_back
    Synopsis
    
+
    [Home]pop_back
    Synopsis
    
 
    
 
     template<
@@ -21,7 +21,7 @@ struct pop_back
 
    Definition
    
 
    
 
    -#include "boost/mpl/pop_back.hpp"
+#include "boost/mpl/pop_back.hpp"
 
    
 
    
 
    Parameters
    
@@ -68,4 +68,4 @@ BOOST_MPL_ASSERT_IS_SAME(back<result3>::type, int);
 
    
 Extensible Sequence, erase, push_back, back, pop_front
 
    
-Table of Content | Reference
    Last edited July 17, 2002 3:56 am
\ No newline at end of file
+Table of Contents
    Last edited July 17, 2002 3:56 am
\ No newline at end of file
diff --git a/doc/ref/Reference/pop_front.html b/doc/ref/Reference/pop_front.html
index 90060d8..2930458 100644
--- a/doc/ref/Reference/pop_front.html
+++ b/doc/ref/Reference/pop_front.html
@@ -1,8 +1,8 @@
 
-boost::mpl::Reference/pop front
+boost::mpl::pop_front
 
 
-
    [Home]pop_front
    Synopsis
    
+
    [Home]pop_front
    Synopsis
    
 
    
 
     template<
@@ -21,7 +21,7 @@ struct pop_front
 
    Definition
    
 
    
 
    -#include "boost/mpl/pop_front.hpp"
+#include "boost/mpl/pop_front.hpp"
 
    
 
    
 
    Parameters
    
@@ -68,4 +68,4 @@ BOOST_MPL_ASSERT_IS_SAME(front<result3>::type, int);
 
    
 Extensible Sequence, erase, push_front, front, pop_back
 
    
-Table of Content | Reference
    Last edited July 17, 2002 3:54 am
\ No newline at end of file
+Table of Contents
    Last edited July 17, 2002 3:54 am
\ No newline at end of file
diff --git a/doc/ref/Reference/prior.html b/doc/ref/Reference/prior.html
deleted file mode 100644
index 4a5d037..0000000
--- a/doc/ref/Reference/prior.html
+++ /dev/null
@@ -1,61 +0,0 @@
-
-boost::mpl::Reference/prior
-
-
-
    [Home]prior
    Synopsis
-
    
-
    
-
    -template<
-      typename T
-    >
-struct prior
-{
-    typedef implementation-defined type;
-};
-
    
-
    
-
    Description
-
    
-
    
-[to do]
-
    
-
    Definition
-
    
-
    
-
    -#include "boost/mpl/prior.hpp"
-
    
-
    
-
    Parameters
-
    
-
-
-
-
     Parameter  Requirement  Description  Default argument  
    ParamA model of Concept[to do][to do] 
    
-
    
-
    Members
-
    
-
-
-
-
     Member  Description  
    type[to do] 
    
-
    
-
    Complexity
-
    
-
    
-[to do]
-
    
-
    Example
-
    
-
    
-
    -[to do]
-
    
-
    
-
    See also
-
    
-
    
-Algorithms, next
-
    
-Table of Content | Reference
    Last edited February 19, 2002 4:25 am
\ No newline at end of file
diff --git a/doc/ref/Reference/push_back.html b/doc/ref/Reference/push_back.html
index a5998f8..bd0ca75 100644
--- a/doc/ref/Reference/push_back.html
+++ b/doc/ref/Reference/push_back.html
@@ -1,8 +1,8 @@
 
-boost::mpl::Reference/push back
+boost::mpl::push_back
 
 
-
    [Home]push_back
    Synopsis
    
+
    [Home]push_back
    Synopsis
    
 
    
 
     template<
@@ -22,7 +22,7 @@ struct push_back
 
    Definition
    
 
    
 
    -#include "boost/mpl/push_back.hpp"
+#include "boost/mpl/push_back.hpp"
 
    
 
    
 
    Parameters
    
@@ -47,17 +47,17 @@ Amortized constant time [1].
 
    
 
     typedef vector_c<bool,false,false,false,true,true,true,false,false> bools;
-typedef push_back<bools,false_c>::type message;
+typedef push_back<bools,false_>::type message;
 BOOST_STATIC_ASSERT(back<message>::type::value == false);
-BOOST_STATIC_ASSERT((count_if<message, equal_to<_,false_c> >::type::value == 6));
+BOOST_STATIC_ASSERT((count_if<message, equal_to<_1,false_> >::type::value == 6));
 
    
 
    
 
    Notes
    
 
    
-[1]  The algorithm is can be viewed as a notational shorcut to more verbose insert< Sequence,end<Sequence>::type,T >::type, and is provided only if the sequence can meet the stated complexity requirements.
    
+[1]  The algorithm can be viewed as a notational shorcut to more verbose insert< Sequence,end<Sequence>::type,T >::type, and is provided only if the sequence can meet the stated complexity requirements.
    
 
    
 
    See also
    
 
    
 Extensible Sequence, insert, back, pop_back, push_front
 
    
-Table of Content | Reference
    Last edited July 17, 2002 3:57 am
\ No newline at end of file
+Table of Contents
    Last edited March 12, 2003 6:34 am
\ No newline at end of file
diff --git a/doc/ref/Reference/push_front.html b/doc/ref/Reference/push_front.html
index d0f3765..4681fcb 100644
--- a/doc/ref/Reference/push_front.html
+++ b/doc/ref/Reference/push_front.html
@@ -1,8 +1,8 @@
 
-boost::mpl::Reference/push front
+boost::mpl::push_front
 
 
-
    [Home]push_front
    Synopsis
    
+
    [Home]push_front
    Synopsis
    
 
    
 
     template<
@@ -22,7 +22,7 @@ struct push_front
 
    Definition
    
 
    
 
    -#include "boost/mpl/push_front.hpp"
+#include "boost/mpl/push_front.hpp"
 
    
 
    
 
    Parameters
    
@@ -55,10 +55,10 @@ BOOST_STATIC_ASSERT((equal< fibonacci,l
 
    
 
    Notes
    
 
    
-[1]  The algorithm is can be viewed as a notational shorcut to more verbose insert< Sequence,begin<Sequence>::type,T >::type, and is provided only if the sequence can meet the stated complexity requirements.
    
+[1]  The algorithm can be viewed as a notational shorcut to more verbose insert< Sequence,begin<Sequence>::type,T >::type, and is provided only if the sequence can meet the stated complexity requirements.
    
 
    
 
    See also
    
 
    
 Extensible Sequence, insert, front, pop_front, push_back
 
    
-Table of Content | Reference
    Last edited July 17, 2002 3:53 am
\ No newline at end of file
+Table of Contents
    Last edited September 11, 2002 4:27 am
\ No newline at end of file
diff --git a/doc/ref/Reference/range_c.html b/doc/ref/Reference/range_c.html
index 95fdf02..ded9ce7 100644
--- a/doc/ref/Reference/range_c.html
+++ b/doc/ref/Reference/range_c.html
@@ -1,8 +1,8 @@
 
-boost::mpl::Reference/range c
+boost::mpl::range_c
 
 
-
    [Home]range_c
    Synopsis
    
+
    [Home]range_c
    Synopsis
    
 
    
 
     template<
@@ -24,7 +24,7 @@ struct range_c
 
    Definition
    
 
    
 
    -#include "boost/mpl/range_c.hpp"
+#include "boost/mpl/range_c.hpp"
 
    
 
    
 
    Example
    
@@ -68,4 +68,4 @@ typedef copy<
 
    
 Random Access Sequence, vector, vector_c, list, list_c
 
    
-Table of Content | Reference
    Last edited July 17, 2002 8:31 am
\ No newline at end of file
+Table of Contents
    Last edited July 17, 2002 8:31 am
\ No newline at end of file
diff --git a/doc/ref/Reference/remove.html b/doc/ref/Reference/remove.html
index 034f729..6585d5b 100644
--- a/doc/ref/Reference/remove.html
+++ b/doc/ref/Reference/remove.html
@@ -1,8 +1,8 @@
 
-boost::mpl::Reference/remove
+boost::mpl::remove
 
 
-
    [Home]remove
    Synopsis
    
+
    [Home]remove
    Synopsis
    
 
    
 
     template<
@@ -22,7 +22,7 @@ Returns a new sequence which contains all the elements from [begin<Sequ
 
    Definition
    
 
    
 
    -#include "boost/mpl/remove.hpp"
+#include "boost/mpl/remove.hpp"
 
    
 
    
 
    Parameters
    
@@ -56,4 +56,4 @@ BOOST_STATIC_ASSERT((equal< result,answ
 
    
 Algorithms, remove_if, replace, replace_if, transform
 
    
-Table of Content | Reference
    Last edited July 17, 2002 8:43 am
\ No newline at end of file
+Table of Contents
    Last edited July 17, 2002 8:43 am
\ No newline at end of file
diff --git a/doc/ref/Reference/remove_if.html b/doc/ref/Reference/remove_if.html
index 9d30c15..de10a3e 100644
--- a/doc/ref/Reference/remove_if.html
+++ b/doc/ref/Reference/remove_if.html
@@ -1,8 +1,8 @@
 
-boost::mpl::Reference/remove if
+boost::mpl::remove_if
 
 
-
    [Home]remove_if
    Synopsis
    
+
    [Home]remove_if
    Synopsis
    
 
    
 
     template<
@@ -22,7 +22,7 @@ Returns a new sequence which contains all the elements from [begin<Sequ
 
    Definition
    
 
    
 
    -#include "boost/mpl/remove_if.hpp"
+#include "boost/mpl/remove_if.hpp"
 
    
 
    
 
    Parameters
    
@@ -56,4 +56,4 @@ BOOST_STATIC_ASSERT((equal< answer,resu
 
    
 Algorithms, remove, replace, transform
 
    
-Table of Content | Reference
    Last edited July 17, 2002 8:43 am
\ No newline at end of file
+Table of Contents
    Last edited July 17, 2002 8:43 am
\ No newline at end of file
diff --git a/doc/ref/Reference/replace.html b/doc/ref/Reference/replace.html
index 5955b72..c496cb3 100644
--- a/doc/ref/Reference/replace.html
+++ b/doc/ref/Reference/replace.html
@@ -1,8 +1,8 @@
 
-boost::mpl::Reference/replace
+boost::mpl::replace
 
 
-
    [Home]replace
    Synopsis
    
+
    [Home]replace
    Synopsis
    
 
    
 
     template<
@@ -23,7 +23,7 @@ Performs a replacement operation on the sequence. The algorithm returns a new se
 
    Definition
    
 
    
 
    -#include "boost/mpl/replace.hpp"
+#include "boost/mpl/replace.hpp"
 
    
 
    
 
    Parameters
    
@@ -58,4 +58,4 @@ BOOST_STATIC_ASSERT((equal< result,answ
 
    
 Algorithms, replace_if, transform
 
    
-Table of Content | Reference
    Last edited July 17, 2002 5:38 am
\ No newline at end of file
+Table of Contents
    Last edited July 17, 2002 5:38 am
\ No newline at end of file
diff --git a/doc/ref/Reference/replace_if.html b/doc/ref/Reference/replace_if.html
index 96a44ef..8919586 100644
--- a/doc/ref/Reference/replace_if.html
+++ b/doc/ref/Reference/replace_if.html
@@ -1,8 +1,8 @@
 
-boost::mpl::Reference/replace if
+boost::mpl::replace_if
 
 
-
    [Home]replace_if
    Synopsis
    
+
    [Home]replace_if
    Synopsis
    
 
    
 
     template<
@@ -23,7 +23,7 @@ Performs a conditional replacement operation on the sequence. The algorithm retu
 
    Definition
    
 
    
 
    -#include "boost/mpl/replace_if.hpp"
+#include "boost/mpl/replace_if.hpp"
 
    
 
    
 
    Parameters
    
@@ -49,13 +49,13 @@ Linear. Performs exactly size<Sequ
 
    
 
     typedef list_c<int,1,4,5,2,7,5,3,5>::type numbers;
-typedef replace_if< numbers, greater<_,4>, int_c<0> >::type result;
+typedef replace_if< numbers, greater<_,4>, int_<0> >::type result;
 typedef list_c<int,1,4,0,2,0,0,3,0>::type answer;
-BOOST_STATIC_ASSERT((equal< answer,result,equal_to<_,_> >::type::value));
+BOOST_STATIC_ASSERT((equal< answer,result >::type::value));
 
    
 
    
 
    See also
    
 
    
 Algorithms, replace, transform
 
    
-Table of Content | Reference
    Last edited July 17, 2002 5:38 am
\ No newline at end of file
+Table of Contents
    Last edited March 12, 2003 6:32 am
\ No newline at end of file
diff --git a/doc/ref/Reference/reverse.html b/doc/ref/Reference/reverse.html
index 8e2f5ce..e0c7778 100644
--- a/doc/ref/Reference/reverse.html
+++ b/doc/ref/Reference/reverse.html
@@ -1,9 +1,8 @@
 
-boost::mpl::Reference/reverse
+boost::mpl::reverse
 
 
-
    [Home]reverse
    Synopsis
-
    
+
    [Home]reverse
    Synopsis
    
 
    
 
     template<
@@ -15,47 +14,45 @@ struct reverse
 };
 
    
 
    
-
    Description
-
    
+
    Description
    
 
    
-[to do]
+Reverses a sequence. The result sequence preserves all the functional and performance characteristics of the original Sequence, including its size, but not identity. 
 
    
-
    Definition
-
    
+
    Definition
    
 
    
 
    -#include "boost/mpl/reverse.hpp"
+#include "boost/mpl/reverse.hpp"
 
    
 
    
-
    Parameters
-
    
+
    Parameters
    
 
-
-
+
+
     Parameter  Requirement  Description  Default argument  
    ParamA model of Concept[to do][to do] 
     Parameter  Requirement  Description  
    SequenceA model of Extensible SequenceThe original sequence.  
    
 
    
 
    
-
    Members
-
    
+
    Expression semantics
    
+
    
 
-
-
+
+
     Member  Description  
    type[to do] 
     Expression  Expression type  Precondition  Semantics  Postcondition 
    typedef reverse<Sequence>::type s;A model of Extensible Sequencesize<s>::type::value == size<Sequence>::type::value. 
    
 
    
 
    
-
    Complexity
-
    
+
    Complexity
    
 
    
-[to do]
+Linear.
 
    
-
    Example
-
    
+
    Example
    
 
    
 
    -[to do]
+typedef list_c<int,9,8,7,6,5,4,3,2,1,0>::type numbers;
+typedef reverse< numbers >::type result;
+
    
+typedef range_c<int,0,10> answer;
+BOOST_STATIC_ASSERT((equal<result,answer>::type::value));
 
    
 
    
-
    See also
-
    
+
    See also
    
 
    
-Algorithms, fold, fold_reverse
+Algorithms, transform, remove, remove_if
 
    
-Table of Content | Reference
    Last edited February 19, 2002 4:11 am
\ No newline at end of file
+Table of Contents
    Last edited March 10, 2003 6:13 am
\ No newline at end of file
diff --git a/doc/ref/Reference/size.html b/doc/ref/Reference/size.html
index 17b5ad5..f5201d3 100644
--- a/doc/ref/Reference/size.html
+++ b/doc/ref/Reference/size.html
@@ -1,8 +1,8 @@
 
-boost::mpl::Reference/size
+boost::mpl::size
 
 
-
    [Home]size
    Synopsis
    
+
    [Home]size
    Synopsis
    
 
    
 
     template<
@@ -21,7 +21,7 @@ struct size
 
    Definition
    
 
    
 
    -#include "boost/mpl/size.hpp"
+#include "boost/mpl/size.hpp"
 
    
 
    
 
    Parameters
    
@@ -57,4 +57,4 @@ BOOST_STATIC_ASSERT(size<more_numbers>::type::value == 100);
 
    
 Sequence, empty, begin, end
 
    
-Table of Content | Reference
    Last edited July 17, 2002 3:51 am
\ No newline at end of file
+Table of Contents
    Last edited July 17, 2002 3:51 am
\ No newline at end of file
diff --git a/doc/ref/Reference/sort.html b/doc/ref/Reference/sort.html
deleted file mode 100644
index 1905d48..0000000
--- a/doc/ref/Reference/sort.html
+++ /dev/null
@@ -1,62 +0,0 @@
-
-boost::mpl::Reference/sort
-
-
-
    [Home]sort
    Synopsis
-
    
-
    
-
    -template<
-      typename Sequence
-    , typename Compare = less<_1,_2>
-    >
-struct sort
-{
-    typedef implementation-defined type;
-};
-
    
-
    
-
    Description
-
    
-
    
-[to do]
-
    
-
    Definition
-
    
-
    
-
    -#include "boost/mpl/sort.hpp"
-
    
-
    
-
    Parameters
-
    
-
-
-
-
     Parameter  Requirement  Description  Default argument  
    ParamA model of Concept[to do][to do] 
    
-
    
-
    Members
-
    
-
-
-
-
     Member  Description  
    type[to do] 
    
-
    
-
    Complexity
-
    
-
    
-[to do]
-
    
-
    Example
-
    
-
    
-
    -[to do]
-
    
-
    
-
    See also
-
    
-
    
-Algorithms, lower_bound, upper_bound
-
    
-Table of Content | Reference
    Last edited February 19, 2002 4:22 am
\ No newline at end of file
diff --git a/doc/ref/Reference/transform.html b/doc/ref/Reference/transform.html
index 5b8c84e..c2dced5 100644
--- a/doc/ref/Reference/transform.html
+++ b/doc/ref/Reference/transform.html
@@ -1,8 +1,8 @@
 
-boost::mpl::Reference/transform
+boost::mpl::transform
 
 
-
    [Home]transform
    Synopsis
    
+
    [Home]transform
    Synopsis
    
 
    
 
     template<
@@ -22,7 +22,7 @@ Performs a transformation on the sequence. The algorithm returns a new sequence
 
    Definition
    
 
    
 
    -#include "boost/mpl/transform.hpp"
+#include "boost/mpl/transform.hpp"
 
    
 
    
 
    Parameters
    
@@ -56,4 +56,4 @@ BOOST_STATIC_ASSERT((equal<result,point
 
    
 Algorithms, replace, replace_if, transform
 
    
-Table of Content | Reference
    Last edited July 17, 2002 5:47 am
\ No newline at end of file
+Table of Contents
    Last edited July 17, 2002 5:47 am
\ No newline at end of file
diff --git a/doc/ref/Reference/transform_view.html b/doc/ref/Reference/transform_view.html
index e27ac54..23827bd 100644
--- a/doc/ref/Reference/transform_view.html
+++ b/doc/ref/Reference/transform_view.html
@@ -1,8 +1,8 @@
 
-boost::mpl::Reference/transform view
+boost::mpl::transform_view
 
 
-
    [Home]transform_view
    Synopsis
    
+
    [Home]transform_view
    Synopsis
    
 
    
 
     template<
@@ -11,6 +11,7 @@ template<
     >
 struct transform_view
 {
+    // unspecified
 };
 
    
 
    
@@ -21,7 +22,7 @@ struct transform_view
 
    Definition
    
 
    
 
    -#include "boost/mpl/transform_view.hpp"
+#include "boost/mpl/transform_view.hpp"
 
    
 
    
 
    Parameters
    
@@ -48,7 +49,7 @@ Finds the largest type in a sequence.
 
    
 
     typedef list<int,long,char,char[50],double> types;
-typedef max_element<
+typedef max_element<
       transform_view< types, size_of<_> >
     >::type iter;
 BOOST_STATIC_ASSERT(iter::type::value == 50);
@@ -56,6 +57,6 @@ BOOST_STATIC_ASSERT(iter::type::value == 50);
 
    
 
    See also
    
 
    
-Sequences, filter_view, list, max_element
+Sequences, filter_view, joint_view, zip_view, max_element
 
    
-Table of Content | Reference
    Last edited July 23, 2002 3:23 am
\ No newline at end of file
+Table of Contents
    Last edited March 10, 2003 4:43 am
\ No newline at end of file
diff --git a/doc/ref/Reference/unique.html b/doc/ref/Reference/unique.html
deleted file mode 100644
index 4302889..0000000
--- a/doc/ref/Reference/unique.html
+++ /dev/null
@@ -1,62 +0,0 @@
-
-boost::mpl::Reference/unique
-
-
-
    [Home]unique
    Synopsis
-
    
-
    
-
    -template<
-      typename Sequence
-    , typename Predicate = is_same<_1,_2>
-    >
-struct unique
-{
-    typedef implementation-defined type;
-};
-
    
-
    
-
    Description
-
    
-
    
-[to do]
-
    
-
    Definition
-
    
-
    
-
    -#include "boost/mpl/unique.hpp"
-
    
-
    
-
    Parameters
-
    
-
-
-
-
     Parameter  Requirement  Description  Default argument  
    ParamA model of Concept[to do][to do] 
    
-
    
-
    Members
-
    
-
-
-
-
     Member  Description  
    type[to do] 
    
-
    
-
    Complexity
-
    
-
    
-[to do]
-
    
-
    Example
-
    
-
    
-
    -[to do]
-
    
-
    
-
    See also
-
    
-
    
-Algorithms, erase, erase_if
-
    
-Table of Content | Reference
    Last edited February 19, 2002 4:15 am
\ No newline at end of file
diff --git a/doc/ref/Reference/upper_bound.html b/doc/ref/Reference/upper_bound.html
index 4379743..6bf4310 100644
--- a/doc/ref/Reference/upper_bound.html
+++ b/doc/ref/Reference/upper_bound.html
@@ -1,14 +1,14 @@
 
-boost::mpl::Reference/upper bound
+boost::mpl::upper_bound
 
 
-
    [Home]upper_bound
    Synopsis
    
+
    [Home]upper_bound
    Synopsis
    
 
    
 
     template<
       typename Sequence
     , typename T
-    , typename Pred
+    , typename Pred = less<_1,_2>
     >
 struct upper_bound
 {
@@ -23,7 +23,7 @@ Returns the last position in the sorted Sequence where TDefinition
 
    
 
    -#include "boost/mpl/upper_bound.hpp"
+#include "boost/mpl/upper_bound.hpp"
 
    
 
    
 
    Parameters
    
@@ -49,12 +49,13 @@ The number of comparisons is logarithmic: at most log(size<Sequence>
 
    
 
     typedef list_c<int,1,2,3,3,3,5,8> numbers;
-typedef upper_bound< numbers, int_c<3>, less<_,_> >::type iter;
+typedef upper_bound< numbers, int_<3> >::type iter;
 BOOST_STATIC_ASSERT((distance< begin<numbers>::type,iter >::type::value == 5));
+BOOST_STATIC_ASSERT(iter::type::value == 5);
 
    
 
    
 
    See also
    
 
    
-Algorithms, sort, lower_bound
+Algorithms, sort, lower_bound
 
    
-Table of Content | Reference
    Last edited July 17, 2002 6:30 pm
\ No newline at end of file
+Table of Contents
    Last edited March 10, 2003 5:44 am
\ No newline at end of file
diff --git a/doc/ref/Reference/vector.html b/doc/ref/Reference/vector.html
index 968736d..ec61ef6 100644
--- a/doc/ref/Reference/vector.html
+++ b/doc/ref/Reference/vector.html
@@ -1,8 +1,8 @@
 
-boost::mpl::Reference/vector
+boost::mpl::vector
 
 
-
    [Home]vector
    Synopsis
    
+
    [Home]vector
    Synopsis
    
 
    
 
     template<
@@ -32,11 +32,11 @@ BOOST_STATIC_ASSERT((boost::is_same<my,my_float>::value));
 
    Definition
    
 
    
 
    -#include "boost/mpl/vector.hpp"
-#include "boost/mpl/vector/vector0.hpp"
-#include "boost/mpl/vector/vector10.hpp"
+#include "boost/mpl/vector.hpp"
+#include "boost/mpl/vector/vector0.hpp"
+#include "boost/mpl/vector/vector10.hpp"
 ...
-#include "boost/mpl/vector/vector50.hpp"
+#include "boost/mpl/vector/vector50.hpp"
 
    
 
    
 
    Notes
    
@@ -74,4 +74,4 @@ BOOST_STATIC_ASSERT((is_same<t,int>::value));
 
    
 Random Access Sequence, vector_c, list, list_c, range_c
 
    
-Table of Content | Reference
    Last edited July 22, 2002 4:28 pm
\ No newline at end of file
+Table of Contents
    Last edited July 22, 2002 4:28 pm
\ No newline at end of file
diff --git a/doc/ref/Reference/vector_c.html b/doc/ref/Reference/vector_c.html
index dbf2b29..538db43 100644
--- a/doc/ref/Reference/vector_c.html
+++ b/doc/ref/Reference/vector_c.html
@@ -1,8 +1,8 @@
 
-boost::mpl::Reference/vector c
+boost::mpl::vector_c
 
 
-
    [Home]vector_c
    Synopsis
    
+
    [Home]vector_c
    Synopsis
    
 
    
 
     template<
@@ -44,15 +44,15 @@ typedef vector<
 
    Definition
    
 
    
 
    -#include "boost/mpl/vector_c.hpp"
-#include "boost/mpl/vector/vector0_c.hpp"
-#include "boost/mpl/vector/vector10_c.hpp"
+#include "boost/mpl/vector_c.hpp"
+#include "boost/mpl/vector/vector0_c.hpp"
+#include "boost/mpl/vector/vector10_c.hpp"
 ...
-#include "boost/mpl/vector/vector50_c.hpp"
+#include "boost/mpl/vector/vector50_c.hpp"
 
    
 
    
 
    See also
    
 
    
 Random Access Sequence, vector, list, list_c, range_c
 
    
-Table of Content | Reference
    Last edited July 17, 2002 8:01 am
\ No newline at end of file
+Table of Contents
    Last edited July 17, 2002 8:01 am
\ No newline at end of file
diff --git a/doc/ref/Sequence.html b/doc/ref/Sequence.html
index f7692f4..7450d3b 100644
--- a/doc/ref/Sequence.html
+++ b/doc/ref/Sequence.html
@@ -2,7 +2,7 @@
 boost::mpl::Sequence
 
 
-
    [Home]Sequence
    Description
    
+
    [Home]Sequence
    Description
    
 
    
 A Sequence (or, more precisely, an Input Sequence) is a compile-time entity to which you can apply begin/end operations in order to get iterators for accessing the range of its elements. In general, a sequence does not guarantee that its content doesn't change from one iteration to another, or between different compilation sessions [1]. See Forward Sequence for the definition of the concept that imposes such additional requirements.
 
    
@@ -46,4 +46,4 @@ For any sequence s the following invariants always hold:
 
    
 Sequences, Forward Sequence, Input Iterator, begin, end
 
    
-Table of Content
    Last edited July 21, 2002 5:55 pm
\ No newline at end of file
+Table of Contents
    Last edited July 21, 2002 5:55 pm
\ No newline at end of file
diff --git a/doc/ref/Sequences.html b/doc/ref/Sequences.html
index 6c1c77e..b565e83 100644
--- a/doc/ref/Sequences.html
+++ b/doc/ref/Sequences.html
@@ -2,31 +2,38 @@
 boost::mpl::Sequences
 
 
-
    [Home]Sequences
      
-
    1. Concepts
-
        
+
        [Home]Sequences
        Concepts
        
+
      
-
    2. Classes
-
        
+
+
        
+
        Classes
        
+
      
-
    3. Views
-
        
+
+
        
+
        Views
        
+
      
-
    4. Algorithms
-
        
+
      1. joint_view
+
      2. zip_view
+
      3. single_view
+
      4. as_sequence
+
+
        
+
        Metafunctions
        
+
      
-
    
+
+
    
 
    
-Table of Content
    Last edited July 19, 2002 2:14 am
\ No newline at end of file
+Table of Contents
    Last edited March 10, 2003 5:07 am
\ No newline at end of file
diff --git a/doc/ref/Table_of_Content.html b/doc/ref/Table_of_Content.html
deleted file mode 100644
index 107548c..0000000
--- a/doc/ref/Table_of_Content.html
+++ /dev/null
@@ -1,14 +0,0 @@
-
-boost::mpl::Table of Content
-
-
-
    [Home]Table of Content
      
-
    1. Sequences
-
    2. Iterators
-
    3. Algorithms
-
    4. Metafunctions
-
    5. Categorized index
-
    6. Acknowledgements
-
    
-
    
-Table of Content
    Last edited July 17, 2002 10:15 am
\ No newline at end of file
diff --git a/doc/ref/Trivial_Iterator.html b/doc/ref/Trivial_Iterator.html
index eb40e71..f8d4a50 100644
--- a/doc/ref/Trivial_Iterator.html
+++ b/doc/ref/Trivial_Iterator.html
@@ -2,7 +2,7 @@
 boost::mpl::Trivial Iterator
 
 
-
    [Home]Trivial Iterator
    Description
    
+
    [Home]Trivial Iterator
    Description
    
 
    
 A Trivial Iterator i is a type that represents a reference to an element of some Sequence, and allows to access the element through its nested type member [1]. A trivial iterator does not define any traversal operations.
 
    
@@ -43,4 +43,4 @@ For any trivial iterators i and j the following invari
 
    
 Sequence, Input Iterator
 
    
-Table of Content
    Last edited July 15, 2002 10:46 am
\ No newline at end of file
+Table of Contents
    Last edited July 15, 2002 10:46 am
\ No newline at end of file
diff --git a/test/Jamfile b/test/Jamfile
index da9ae10..a288174 100644
--- a/test/Jamfile
+++ b/test/Jamfile
@@ -14,6 +14,7 @@ compile assert_is_same.cpp ;
 compile at.cpp ;
 compile back.cpp ;
 compile bind.cpp ;
+compile bitwise.cpp ;
 compile bool.cpp ;
 compile comparison.cpp ;
 compile contains.cpp ;
@@ -41,6 +42,7 @@ compile insert.cpp ;
 compile insert_range.cpp ;
 compile int.cpp ;
 compile integral_c.cpp ;
+compile is_placeholder.cpp ;
 compile is_sequence.cpp ;
 compile joint_view.cpp ;
 compile lambda.cpp ;
@@ -67,3 +69,4 @@ compile unique.cpp ;
 compile upper_bound.cpp ;
 compile vector.cpp ;
 compile vector_c.cpp ;
+compile zip_view.cpp ;