From df1a3a334f1dffe00411e9eeed5181794de9d583 Mon Sep 17 00:00:00 2001
From: Neil Groves <neil@grovescomputing.com>
Date: Sun, 22 May 2011 11:16:53 +0000
Subject: [PATCH 01/41] [boost][range] - ticket 5544 - fix for termination of
 irange.

[SVN r72070]
---
 include/boost/range/irange.hpp        |  7 ++--
 test/Jamfile.v2                       |  1 +
 test/irange.cpp                       |  9 ++++-
 test/ticket_5544_terminate_irange.cpp | 47 +++++++++++++++++++++++++++
 4 files changed, 60 insertions(+), 4 deletions(-)
 create mode 100644 test/ticket_5544_terminate_irange.cpp

diff --git a/include/boost/range/irange.hpp b/include/boost/range/irange.hpp
index 8045550..fe36e9d 100644
--- a/include/boost/range/irange.hpp
+++ b/include/boost/range/irange.hpp
@@ -216,9 +216,10 @@ namespace boost
 
         typedef typename range_detail::integer_iterator_with_step<Integer> iterator_t;
 
-        const std::ptrdiff_t last_step
-            = (static_cast<std::ptrdiff_t>(last) - static_cast<std::ptrdiff_t>(first))
-            / (static_cast<std::ptrdiff_t>(step_size));
+        const std::ptrdiff_t l = static_cast<std::ptrdiff_t>(last);
+        const std::ptrdiff_t f = static_cast<std::ptrdiff_t>(first);
+        const std::ptrdiff_t sz = static_cast<std::ptrdiff_t>(step_size);
+        const std::ptrdiff_t last_step = (l + ((l-f) % sz) - f) / sz;
 
         return strided_integer_range<Integer>(
             iterator_t(first, 0, step_size),
diff --git a/test/Jamfile.v2 b/test/Jamfile.v2
index 7086fd0..f1fb3aa 100644
--- a/test/Jamfile.v2
+++ b/test/Jamfile.v2
@@ -156,5 +156,6 @@ test-suite range :
 	[ range-test std_container ]
 	[ range-test string ]
 	[ range-test sub_range ]
+	[ range-test ticket_5544_terminate_irange ]
     ;
 
diff --git a/test/irange.cpp b/test/irange.cpp
index d71f184..985e07a 100644
--- a/test/irange.cpp
+++ b/test/irange.cpp
@@ -81,7 +81,6 @@ namespace boost
     void test_irange(int first, int last, int step_size)
     {
         BOOST_ASSERT( step_size != 0 );
-        BOOST_ASSERT( (last - first) % step_size == 0 );
         test_irange_impl<signed char>(first, last, step_size);
         test_irange_impl<unsigned char>(first, last, step_size);
         test_irange_impl<signed short>(first, last, step_size);
@@ -114,8 +113,16 @@ namespace boost
         test_irange(10, 0, -1);
         test_irange(0, 2, 2);
         test_irange(2, 0, -2);
+        test_irange(0, 9, 2);
         test_irange(10, 20, 5);
         test_irange(20, 10, -5);
+        
+        test_irange(0, 0, 3);
+        test_irange(0, 1, 3);
+        test_irange(0, 2, 3);
+        test_irange(0, 3, 3);
+        test_irange(0, 4, 3);
+        test_irange(0, 10, 3);
     }
 } // namespace boost
 
diff --git a/test/ticket_5544_terminate_irange.cpp b/test/ticket_5544_terminate_irange.cpp
new file mode 100644
index 0000000..fa64436
--- /dev/null
+++ b/test/ticket_5544_terminate_irange.cpp
@@ -0,0 +1,47 @@
+// Boost.Range library
+//
+//  Copyright Neil Groves 2011. Use, modification and
+//  distribution is subject to the Boost Software License, Version
+//  1.0. (See accompanying file LICENSE_1_0.txt or copy at
+//  http://www.boost.org/LICENSE_1_0.txt)
+//
+//
+// For more information, see http://www.boost.org/libs/range/
+//
+#include <boost/range/irange.hpp>
+#include <boost/range/algorithm_ext/push_back.hpp>
+
+#include <boost/test/test_tools.hpp>
+#include <boost/test/unit_test.hpp>
+
+#include <vector>
+
+namespace boost
+{
+    namespace
+    {
+        void test_irange_termination()
+        {
+            std::vector<int> reference;
+            for (int i = 0; i < 9; i += 2)
+                reference.push_back(i);
+                
+            std::vector<int> actual;
+            boost::push_back(actual, boost::irange(0,9,2));
+            
+            BOOST_CHECK_EQUAL_COLLECTIONS(actual.begin(), actual.end(),
+                                          reference.begin(), reference.end());
+        }
+    }
+}
+
+boost::unit_test::test_suite*
+init_unit_test_suite(int argc, char* argv[])
+{
+    boost::unit_test::test_suite* test
+        = BOOST_TEST_SUITE( "RangeTestSuite.ticket_5544" );
+
+    test->add( BOOST_TEST_CASE( &boost::test_irange_termination ) );
+
+    return test;
+}

From 5ed611649091a18b87abe375fe591bfc4747859c Mon Sep 17 00:00:00 2001
From: Neil Groves <neil@grovescomputing.com>
Date: Sun, 22 May 2011 19:59:59 +0000
Subject: [PATCH 02/41] [boost][range] - ticket 5544 - fix for termination of
 irange - done properly for negative step sizes.

[SVN r72097]
---
 include/boost/range/irange.hpp | 19 +++++++------
 test/irange.cpp                | 49 ++++++++++++++++++++++++----------
 2 files changed, 44 insertions(+), 24 deletions(-)

diff --git a/include/boost/range/irange.hpp b/include/boost/range/irange.hpp
index fe36e9d..3b5a6cc 100644
--- a/include/boost/range/irange.hpp
+++ b/include/boost/range/irange.hpp
@@ -124,13 +124,11 @@ namespace boost
             typedef typename base_t::difference_type difference_type;
             typedef typename base_t::reference reference;
 
-            integer_iterator_with_step(value_type first, value_type step, difference_type step_size)
+            integer_iterator_with_step(value_type first, difference_type step, value_type step_size)
                 : m_first(first)
                 , m_step(step)
                 , m_step_size(step_size)
             {
-                BOOST_ASSERT( step >= 0 );
-                BOOST_ASSERT( step_size != 0 );
             }
 
         private:
@@ -213,17 +211,18 @@ namespace boost
     {
         BOOST_ASSERT( step_size != 0 );
         BOOST_ASSERT( (step_size > 0) ? (last >= first) : (last <= first) );
-
+        
         typedef typename range_detail::integer_iterator_with_step<Integer> iterator_t;
 
-        const std::ptrdiff_t l = static_cast<std::ptrdiff_t>(last);
-        const std::ptrdiff_t f = static_cast<std::ptrdiff_t>(first);
-        const std::ptrdiff_t sz = static_cast<std::ptrdiff_t>(step_size);
-        const std::ptrdiff_t last_step = (l + ((l-f) % sz) - f) / sz;
-
+        const std::ptrdiff_t sz = static_cast<std::ptrdiff_t>(step_size >= 0 ? step_size : -step_size);
+        const Integer l = step_size >= 0 ? last : first;
+        const Integer f = step_size >= 0 ? first : last;
+        const std::ptrdiff_t num_steps = (l + ((l-f) % sz) - f) / sz;
+        BOOST_ASSERT(num_steps >= 0);
+       
         return strided_integer_range<Integer>(
             iterator_t(first, 0, step_size),
-            iterator_t(first, last_step, step_size));
+            iterator_t(first, num_steps, step_size));
     }
 
 } // namespace boost
diff --git a/test/irange.cpp b/test/irange.cpp
index 985e07a..358a2b1 100644
--- a/test/irange.cpp
+++ b/test/irange.cpp
@@ -14,7 +14,6 @@
 #include <boost/range/end.hpp>
 #include <boost/test/test_tools.hpp>
 #include <boost/test/unit_test.hpp>
-#include <iostream>
 #include <vector>
 
 namespace boost
@@ -35,27 +34,38 @@ namespace boost
         BOOST_CHECK_EQUAL_COLLECTIONS( test.begin(), test.end(),
                                        reference.begin(), reference.end() );
     }
+    
+    template<typename Integer>
+    std::ptrdiff_t test_irange_calculate_num_steps(Integer first, Integer last, int step)
+    {
+        const std::ptrdiff_t sz = static_cast<std::ptrdiff_t>(step >= 0 ? step : -step);
+        const std::ptrdiff_t l = static_cast<std::ptrdiff_t>(step >= 0 ? last : first);
+        const std::ptrdiff_t f = static_cast<std::ptrdiff_t>(step >= 0 ? first : last);
+        return (l + ((l-f) % sz) - f) / sz;
+    }
 
     // Test an integer range with a runtime specified step size.
-    template<typename Integer>
-    void test_irange_impl(Integer first, Integer last, int step)
+    template<typename Integer, typename IntegerInput>
+    void test_irange_impl(IntegerInput first, IntegerInput last, int step)
     {
         BOOST_ASSERT( step != 0 );
+        
+        // Skip tests that have negative values if the type is
+        // unsigned
+        if ((static_cast<IntegerInput>(static_cast<Integer>(first)) != first)
+        ||  (static_cast<IntegerInput>(static_cast<Integer>(last)) != last))
+            return;
+        
         std::vector<Integer> reference;
-        if (step > 0)
-        {
-            for (Integer i = first; i < last; i += step)
-                reference.push_back(i);
-        }
-        else
-        {
-            for (Integer i = first; i > last; i += step)
-                reference.push_back(i);
-        }
+
+        const std::ptrdiff_t num_steps = test_irange_calculate_num_steps(first, last, step);        
+        Integer current_value = first;
+        for (std::ptrdiff_t i = 0; i < num_steps; ++i, current_value += step)
+            reference.push_back(current_value);
 
         std::vector<Integer> test;
         boost::push_back(test, boost::irange(first, last, step));
-
+        
         BOOST_CHECK_EQUAL_COLLECTIONS( test.begin(), test.end(),
                                        reference.begin(), reference.end() );
     }
@@ -114,6 +124,10 @@ namespace boost
         test_irange(0, 2, 2);
         test_irange(2, 0, -2);
         test_irange(0, 9, 2);
+        test_irange(9, 0, -2);
+        test_irange(-9, 0, 2);
+        test_irange(-9, 9, 2);
+        test_irange(9, -9, -2);
         test_irange(10, 20, 5);
         test_irange(20, 10, -5);
         
@@ -123,6 +137,13 @@ namespace boost
         test_irange(0, 3, 3);
         test_irange(0, 4, 3);
         test_irange(0, 10, 3);
+        
+        test_irange(0, 0, -3);
+        test_irange(0, -1, -3);
+        test_irange(0, -2, -3);
+        test_irange(0, -3, -3);
+        test_irange(0, -4, -3);
+        test_irange(0, -10, -3);
     }
 } // namespace boost
 

From 3b3889b70f07ccd082591543d25bcbb4e17a3ead Mon Sep 17 00:00:00 2001
From: Neil Groves <neil@grovescomputing.com>
Date: Sun, 22 May 2011 20:01:12 +0000
Subject: [PATCH 03/41] [boost][range] - Ticket 5485 - doubly defined
 BOOST_DEFINE_RANGE_ADAPTOR_1 macro.

[SVN r72098]
---
 include/boost/range/adaptor/define_adaptor.hpp | 18 ------------------
 1 file changed, 18 deletions(-)

diff --git a/include/boost/range/adaptor/define_adaptor.hpp b/include/boost/range/adaptor/define_adaptor.hpp
index 26f4016..b228df3 100644
--- a/include/boost/range/adaptor/define_adaptor.hpp
+++ b/include/boost/range/adaptor/define_adaptor.hpp
@@ -44,24 +44,6 @@
         return range_adaptor <const Range>(rng); \
     }
 
-#define BOOST_DEFINE_RANGE_ADAPTOR_1( adaptor_name, range_adaptor, adaptor_class ) \
-    template<typename Range> range_adaptor <Range> \
-        operator|(Range& rng, const adaptor_name & args) \
-    { \
-        return range_adaptor <Range>(rng, args.arg1); \
-    } \
-    template<typename Range> range_adaptor <const Range> \
-        operator|(const Range& rng, const adaptor_name & args) \
-    { \
-        return range_adaptor <Range>(rng, args.arg1); \
-    } \
-    template<typename Range, typename Arg1> \
-    range_adaptor<Range> \
-    make_##adaptor_name(Range& rng, Arg1 arg1) \
-    { \
-        return range_adaptor<Range>(rng, arg1); \
-    }
-
 #define BOOST_DEFINE_RANGE_ADAPTOR_1( adaptor_name, range_adaptor, arg1_type ) \
     struct adaptor_name \
     { \

From b06fca837865b3aefa2f4f785629e76bfde643b0 Mon Sep 17 00:00:00 2001
From: Neil Groves <neil@grovescomputing.com>
Date: Sun, 22 May 2011 20:20:20 +0000
Subject: [PATCH 04/41] [boost][range] - Ticket 5556 - is_sorted namespace
 issue under GCC 4.5

[SVN r72101]
---
 test/Jamfile.v2                          |  1 +
 test/ticket_5556_is_sorted_namespace.cpp | 37 ++++++++++++++++++++++++
 2 files changed, 38 insertions(+)
 create mode 100644 test/ticket_5556_is_sorted_namespace.cpp

diff --git a/test/Jamfile.v2 b/test/Jamfile.v2
index f1fb3aa..ba8a08a 100644
--- a/test/Jamfile.v2
+++ b/test/Jamfile.v2
@@ -157,5 +157,6 @@ test-suite range :
 	[ range-test string ]
 	[ range-test sub_range ]
 	[ range-test ticket_5544_terminate_irange ]
+	[ range-test ticket_5556_is_sorted_namespace ]
     ;
 
diff --git a/test/ticket_5556_is_sorted_namespace.cpp b/test/ticket_5556_is_sorted_namespace.cpp
new file mode 100644
index 0000000..78a75cd
--- /dev/null
+++ b/test/ticket_5556_is_sorted_namespace.cpp
@@ -0,0 +1,37 @@
+// Boost.Range library
+//
+//  Copyright Neil Groves 2011. Use, modification and
+//  distribution is subject to the Boost Software License, Version
+//  1.0. (See accompanying file LICENSE_1_0.txt or copy at
+//  http://www.boost.org/LICENSE_1_0.txt)
+//
+//
+// For more information, see http://www.boost.org/libs/range/
+//
+
+// Embarrasingly, the mere inclusion of these headers in this order was
+// enough to trigger the defect. 
+#include <boost/range/algorithm.hpp>
+#include <boost/range/algorithm_ext.hpp>
+
+#include <boost/test/test_tools.hpp>
+#include <boost/test/unit_test.hpp>
+
+namespace boost
+{
+    namespace
+    {
+        void test_ticket_5556() {}
+    }
+}
+
+boost::unit_test::test_suite*
+init_unit_test_suite(int argc, char* argv[])
+{
+    boost::unit_test::test_suite* test
+        = BOOST_TEST_SUITE( "RangeTestSuite.ticket_5556" );
+
+    test->add( BOOST_TEST_CASE( &boost::test_ticket_5556 ) );
+
+    return test;
+}

From 44c26a3356ac9293570b30383ebfd4abf2c980f7 Mon Sep 17 00:00:00 2001
From: Neil Groves <neil@grovescomputing.com>
Date: Sun, 22 May 2011 20:33:06 +0000
Subject: [PATCH 05/41] [boost][range] - Ticket 5486 - Removal of unnecessary
 variables from adjacent_filtered_range. This removes the requirement for the
 predicate to be default constructible.

[SVN r72102]
---
 .../boost/range/adaptor/adjacent_filtered.hpp |  4 --
 test/Jamfile.v2                               |  1 +
 test/ticket_5486.cpp                          | 56 +++++++++++++++++++
 3 files changed, 57 insertions(+), 4 deletions(-)
 create mode 100644 test/ticket_5486.cpp

diff --git a/include/boost/range/adaptor/adjacent_filtered.hpp b/include/boost/range/adaptor/adjacent_filtered.hpp
index edc1dff..f717cb3 100644
--- a/include/boost/range/adaptor/adjacent_filtered.hpp
+++ b/include/boost/range/adaptor/adjacent_filtered.hpp
@@ -143,10 +143,6 @@ namespace boost
                          skip_iter(boost::end(r), boost::end(r), p))
             {
             }
-
-        private:
-            P m_pred;
-            R* m_range;
         };
 
         template< class T >
diff --git a/test/Jamfile.v2 b/test/Jamfile.v2
index ba8a08a..4845d4e 100644
--- a/test/Jamfile.v2
+++ b/test/Jamfile.v2
@@ -156,6 +156,7 @@ test-suite range :
 	[ range-test std_container ]
 	[ range-test string ]
 	[ range-test sub_range ]
+	[ range-test ticket_5486 ]
 	[ range-test ticket_5544_terminate_irange ]
 	[ range-test ticket_5556_is_sorted_namespace ]
     ;
diff --git a/test/ticket_5486.cpp b/test/ticket_5486.cpp
new file mode 100644
index 0000000..3a6bf4b
--- /dev/null
+++ b/test/ticket_5486.cpp
@@ -0,0 +1,56 @@
+// Boost.Range library
+//
+//  Copyright Neil Groves 2011. Use, modification and
+//  distribution is subject to the Boost Software License, Version
+//  1.0. (See accompanying file LICENSE_1_0.txt or copy at
+//  http://www.boost.org/LICENSE_1_0.txt)
+//
+//
+// For more information, see http://www.boost.org/libs/range/
+//
+#include <boost/range/adaptor/adjacent_filtered.hpp>
+#include <boost/range/algorithm_ext/push_back.hpp>
+
+#include <boost/test/test_tools.hpp>
+#include <boost/test/unit_test.hpp>
+
+#include <functional>
+#include <vector>
+
+namespace boost
+{
+    namespace
+    {
+        class TestTicket5486Pred
+            : public std::binary_function<int,int,bool>
+        {
+        public:
+            explicit TestTicket5486Pred(int x) {}
+            bool operator()(int,int) const { return true; }
+        private:
+            TestTicket5486Pred();
+        };
+    
+        // Ticket 5486 - pertained to predicates erroneous
+        // requiring default construction
+        void test_ticket_5486()
+        {
+            std::vector<int> v;
+            boost::push_back(v, v | boost::adaptors::adjacent_filtered(TestTicket5486Pred(1)));
+            
+            BOOST_CHECK_EQUAL_COLLECTIONS( v.begin(), v.end(),
+                                           v.begin(), v.end() );
+        }
+    }
+}
+
+boost::unit_test::test_suite*
+init_unit_test_suite(int argc, char* argv[])
+{
+    boost::unit_test::test_suite* test
+        = BOOST_TEST_SUITE( "RangeTestSuite.ticket_5486" );
+
+    test->add( BOOST_TEST_CASE( &boost::test_ticket_5486 ) );
+
+    return test;
+}

From 91428c211093d74a2525f277b53f20f0c224c187 Mon Sep 17 00:00:00 2001
From: Neil Groves <neil@grovescomputing.com>
Date: Sun, 22 May 2011 21:03:01 +0000
Subject: [PATCH 06/41] [boost][range] - Ticket 5530 - adaptor example fails to
 compile. This change adds tests for all of the .cpp example files for the
 range adaptors, and fixes a few small issues with the examples shown by the
 new tests.

[SVN r72104]
---
 .../adaptors/examples/adjacent_filtered.cpp       |  2 +-
 doc/reference/adaptors/examples/indexed.cpp       |  2 +-
 doc/reference/adaptors/examples/transformed.cpp   |  2 +-
 test/Jamfile.v2                                   | 15 +++++++++++++++
 4 files changed, 18 insertions(+), 3 deletions(-)

diff --git a/doc/reference/adaptors/examples/adjacent_filtered.cpp b/doc/reference/adaptors/examples/adjacent_filtered.cpp
index 7830a1d..cc7cd9b 100644
--- a/doc/reference/adaptors/examples/adjacent_filtered.cpp
+++ b/doc/reference/adaptors/examples/adjacent_filtered.cpp
@@ -11,7 +11,7 @@
 #include <boost/range/algorithm/copy.hpp>
 #include <boost/assign.hpp>
 #include <algorithm>
-#include <functinoal>
+#include <functional>
 #include <iostream>
 #include <vector>
 
diff --git a/doc/reference/adaptors/examples/indexed.cpp b/doc/reference/adaptors/examples/indexed.cpp
index 3178457..bb141e8 100644
--- a/doc/reference/adaptors/examples/indexed.cpp
+++ b/doc/reference/adaptors/examples/indexed.cpp
@@ -41,5 +41,5 @@ int main(int argc, const char* argv[])
     display_element_and_index( input | indexed(0) );
     
     return 0;
-]
+}
 
diff --git a/doc/reference/adaptors/examples/transformed.cpp b/doc/reference/adaptors/examples/transformed.cpp
index f2a46f5..62bf5d4 100644
--- a/doc/reference/adaptors/examples/transformed.cpp
+++ b/doc/reference/adaptors/examples/transformed.cpp
@@ -9,7 +9,7 @@
 //
 #include <boost/range/adaptor/transformed.hpp>
 #include <boost/range/algorithm/copy.hpp>
-#include <boost/range/assign.hpp>
+#include <boost/assign.hpp>
 #include <algorithm>
 #include <iostream>
 #include <vector>
diff --git a/test/Jamfile.v2 b/test/Jamfile.v2
index 4845d4e..ec67d7b 100644
--- a/test/Jamfile.v2
+++ b/test/Jamfile.v2
@@ -31,6 +31,21 @@ rule range-test ( name : includes * )
 }
 
 test-suite range :
+    [ compile ../doc/reference/adaptors/examples/adjacent_filtered.cpp : : example_adjacent_filtered ]
+    [ compile ../doc/reference/adaptors/examples/copied.cpp : : example_copied ]
+    [ compile ../doc/reference/adaptors/examples/filtered.cpp : : example_filtered ]
+    [ compile ../doc/reference/adaptors/examples/indexed.cpp : : example_indexed ]
+    [ compile ../doc/reference/adaptors/examples/indirected.cpp : : example_indirected ]
+    [ compile ../doc/reference/adaptors/examples/map_keys.cpp : : example_map_keys ]
+    [ compile ../doc/reference/adaptors/examples/map_values.cpp : : example_map_values ]
+    [ compile ../doc/reference/adaptors/examples/replaced.cpp : : example_replaced ]
+    [ compile ../doc/reference/adaptors/examples/replaced_if.cpp : : example_replaced_if ]
+    [ compile ../doc/reference/adaptors/examples/reversed.cpp : : example_reversed ]
+    [ compile ../doc/reference/adaptors/examples/sliced.cpp : : example_sliced ]
+    [ compile ../doc/reference/adaptors/examples/strided.cpp : : example_strided ]
+    [ compile ../doc/reference/adaptors/examples/tokenized.cpp : : example_tokenized ]
+    [ compile ../doc/reference/adaptors/examples/transformed.cpp : : example_transformed ]
+    [ compile ../doc/reference/adaptors/examples/uniqued.cpp : : example_uniqued ]
 	[ compile-fail compile_fail/iterator_range1.cpp ]
 	[ range-test adaptor_test/adjacent_filtered ]
 	[ range-test adaptor_test/copied ]

From 8810c4c4aae24f36cba1f019753ac214d6f24461 Mon Sep 17 00:00:00 2001
From: Neil Groves <neil@grovescomputing.com>
Date: Sun, 22 May 2011 21:19:53 +0000
Subject: [PATCH 07/41] [boost][range] - Ticket 5547 - Boost.Range join()
 ambiguous with Boost.Algorithm join() function. Put the Boost.Range join
 function into the boost::range namespace and brought out with 'using'

[SVN r72106]
---
 include/boost/range/join.hpp |  8 +++++++
 test/Jamfile.v2              |  1 +
 test/ticket_5547.cpp         | 42 ++++++++++++++++++++++++++++++++++++
 3 files changed, 51 insertions(+)
 create mode 100644 test/ticket_5547.cpp

diff --git a/include/boost/range/join.hpp b/include/boost/range/join.hpp
index ad0217e..aacc0a3 100644
--- a/include/boost/range/join.hpp
+++ b/include/boost/range/join.hpp
@@ -36,6 +36,9 @@ public:
 
     } // namespace range_detail
 
+namespace range
+{
+
 template<class SinglePassRange1, class SinglePassRange2>
 class joined_range
     : public range_detail::joined_type<SinglePassRange1, SinglePassRange2>::type
@@ -78,6 +81,11 @@ join(SinglePassRange1& r1, SinglePassRange2& r2)
     return joined_range<SinglePassRange1, SinglePassRange2>(r1, r2);
 }
 
+} // namespace range
+
+using ::boost::range::joined_range;
+using ::boost::range::join;
+
 } // namespace boost
 
 #endif // include guard
diff --git a/test/Jamfile.v2 b/test/Jamfile.v2
index ec67d7b..afab584 100644
--- a/test/Jamfile.v2
+++ b/test/Jamfile.v2
@@ -173,6 +173,7 @@ test-suite range :
 	[ range-test sub_range ]
 	[ range-test ticket_5486 ]
 	[ range-test ticket_5544_terminate_irange ]
+	[ range-test ticket_5547 ]
 	[ range-test ticket_5556_is_sorted_namespace ]
     ;
 
diff --git a/test/ticket_5547.cpp b/test/ticket_5547.cpp
new file mode 100644
index 0000000..1b9d3f6
--- /dev/null
+++ b/test/ticket_5547.cpp
@@ -0,0 +1,42 @@
+// Boost.Range library
+//
+//  Copyright Neil Groves 2011. Use, modification and
+//  distribution is subject to the Boost Software License, Version
+//  1.0. (See accompanying file LICENSE_1_0.txt or copy at
+//  http://www.boost.org/LICENSE_1_0.txt)
+//
+//
+// For more information, see http://www.boost.org/libs/range/
+//
+#include <boost/algorithm/string/join.hpp>
+#include <boost/range/join.hpp>
+
+#include <boost/test/test_tools.hpp>
+#include <boost/test/unit_test.hpp>
+
+#include <vector>
+
+namespace boost
+{
+    namespace
+    {
+   
+        // Ticket 5547 - boost::join ambiguous with algorithm::join
+        void test_ticket_5547()
+        {
+            std::vector<int> x;
+            boost::range::join(x,x);
+        }
+    }
+}
+
+boost::unit_test::test_suite*
+init_unit_test_suite(int argc, char* argv[])
+{
+    boost::unit_test::test_suite* test
+        = BOOST_TEST_SUITE( "RangeTestSuite.ticket_5547" );
+
+    test->add( BOOST_TEST_CASE( &boost::test_ticket_5547 ) );
+
+    return test;
+}

From 846f11a96cd8623cdbd74d96b2ff0ca2f1aa1cfd Mon Sep 17 00:00:00 2001
From: Neil Groves <neil@grovescomputing.com>
Date: Sun, 22 May 2011 22:06:30 +0000
Subject: [PATCH 08/41] [boost][range] - Ticket 5236 - Strided reversing past
 begin issue resolved.

[SVN r72107]
---
 include/boost/range/adaptor/strided.hpp | 43 ++++++++++++-------------
 test/adaptor_test/strided.cpp           | 20 ++++++++++++
 2 files changed, 40 insertions(+), 23 deletions(-)

diff --git a/include/boost/range/adaptor/strided.hpp b/include/boost/range/adaptor/strided.hpp
index abfad5e..e843f62 100755
--- a/include/boost/range/adaptor/strided.hpp
+++ b/include/boost/range/adaptor/strided.hpp
@@ -176,6 +176,7 @@ namespace boost
             strided_iterator()
                 : m_first()
                 , m_last()
+                , m_index(0)
                 , m_stride()
             {
             }
@@ -184,6 +185,7 @@ namespace boost
                 : super_t(it)
                 , m_first(first)
                 , m_last(last)
+                , m_index(stride ? (it - first) / stride : 0)
                 , m_stride(stride)
             {
             }
@@ -194,6 +196,7 @@ namespace boost
                 : super_t(other.base())
                 , m_first(other.base_begin())
                 , m_last(other.base_end())
+                , m_index(other.get_index())
                 , m_stride(other.get_stride())
             {
             }
@@ -201,44 +204,37 @@ namespace boost
             base_iterator base_begin() const { return m_first; }
             base_iterator base_end() const { return m_last; }
             difference_type get_stride() const { return m_stride; }
+            difference_type get_index() const { return m_index; }
 
         private:
             void increment()
             {
-                base_iterator& it = this->base_reference();
-                if ((m_last - it) > m_stride)
-                    it += m_stride;
+                m_index += m_stride;
+                if (m_index < (m_last - m_first))
+                    this->base_reference() = m_first + m_index;
                 else
-                    it = m_last;
+                    this->base_reference() = m_last;
             }
 
             void decrement()
             {
-                base_iterator& it = this->base_reference();
-                if ((it - m_first) > m_stride)
-                    it -= m_stride;
+                m_index -= m_stride;
+                if (m_index >= 0)
+                    this->base_reference() = m_first + m_index;
                 else
-                    it = m_first;
+                    this->base_reference() = m_first;
             }
 
             void advance(difference_type offset)
             {
-                base_iterator& it = this->base_reference();
                 offset *= m_stride;
-                if (offset >= 0)
-                {
-                    if ((m_last - it) > offset)
-                        it += offset;
-                    else
-                        it = m_last;
-                }
+                m_index += offset;
+                if (m_index < 0)
+                    this->base_reference() = m_first;
+                else if (m_index > (m_last - m_first))
+                    this->base_reference() = m_last;
                 else
-                {
-                    if ((m_first - it) > offset)
-                        it += offset;
-                    else
-                        it = m_first;
-                }
+                    this->base_reference() = m_first + m_index;
             }
 
             template<class OtherIterator>
@@ -252,12 +248,13 @@ namespace boost
 
             bool equal(const strided_iterator& other) const
             {
-                return other.base() == this->base();
+                return this->base() == other.base();
             }
 
         private:
             base_iterator m_first;
             base_iterator m_last;
+            difference_type m_index;
             difference_type m_stride;
         };
 
diff --git a/test/adaptor_test/strided.cpp b/test/adaptor_test/strided.cpp
index 91beb81..6389a30 100644
--- a/test/adaptor_test/strided.cpp
+++ b/test/adaptor_test/strided.cpp
@@ -250,6 +250,25 @@ namespace boost
             BOOST_CHECK_EQUAL_COLLECTIONS( reference.begin(), reference.end(),
                                            output.begin(), output.end() );
         }
+
+        template<typename Range>
+        void strided_test_ticket_5236_check(const Range& rng)
+        {
+            BOOST_CHECK_EQUAL( boost::distance(rng), 1 );
+            BOOST_CHECK_EQUAL( std::distance(boost::begin(rng), boost::prior(boost::end(rng))), 0 );
+            
+            typename boost::range_iterator<const Range>::type it = boost::end(rng);
+            it = it - 1;
+            
+            BOOST_CHECK_EQUAL( std::distance(boost::begin(rng), it), 0 );
+        }
+        
+        void strided_test_ticket_5236()
+        {
+            std::vector<int> v;
+            v.push_back(1);
+            strided_test_ticket_5236_check( v | boost::adaptors::strided(2) );                
+        }
     }
 }
 
@@ -262,6 +281,7 @@ init_unit_test_suite(int argc, char* argv[])
     test->add( BOOST_TEST_CASE( &boost::strided_test ) );
     test->add( BOOST_TEST_CASE( &boost::strided_defect_Trac5014 ) );
     test->add( BOOST_TEST_CASE( &boost::strided_test_traversal ) );
+    test->add( BOOST_TEST_CASE( &boost::strided_test_ticket_5236 ) );
 
     return test;
 }

From 41b76f8f5c99237c53e5631e8a4d5154ebd169d7 Mon Sep 17 00:00:00 2001
From: Neil Groves <neil@grovescomputing.com>
Date: Sun, 22 May 2011 22:15:14 +0000
Subject: [PATCH 09/41] [boost][range] - Ticket 5236 - Improved test coverage
 to ensure that the result for a random access strided range is consistent
 with that of a bidirectional strided range.

[SVN r72108]
---
 test/adaptor_test/strided.cpp | 19 ++++++++++++++++---
 1 file changed, 16 insertions(+), 3 deletions(-)

diff --git a/test/adaptor_test/strided.cpp b/test/adaptor_test/strided.cpp
index 6389a30..1198a10 100644
--- a/test/adaptor_test/strided.cpp
+++ b/test/adaptor_test/strided.cpp
@@ -252,14 +252,19 @@ namespace boost
         }
 
         template<typename Range>
-        void strided_test_ticket_5236_check(const Range& rng)
+        void strided_test_ticket_5236_check_bidirectional(const Range& rng)
         {
             BOOST_CHECK_EQUAL( boost::distance(rng), 1 );
             BOOST_CHECK_EQUAL( std::distance(boost::begin(rng), boost::prior(boost::end(rng))), 0 );
-            
+        }
+        
+        template<typename Range>
+        void strided_test_ticket_5236_check(const Range& rng)
+        {
+            strided_test_ticket_5236_check_bidirectional(rng);
+                        
             typename boost::range_iterator<const Range>::type it = boost::end(rng);
             it = it - 1;
-            
             BOOST_CHECK_EQUAL( std::distance(boost::begin(rng), it), 0 );
         }
         
@@ -268,7 +273,15 @@ namespace boost
             std::vector<int> v;
             v.push_back(1);
             strided_test_ticket_5236_check( v | boost::adaptors::strided(2) );                
+            
+            // Ensure that there is consistency between the random-access implementation
+            // and the bidirectional.
+            
+            std::list<int> l;
+            l.push_back(1);
+            strided_test_ticket_5236_check_bidirectional( l | boost::adaptors::strided(2) );
         }
+        
     }
 }
 

From c4bd4bf4ce4a4ce0d2dcd44908266d04fde60921 Mon Sep 17 00:00:00 2001
From: Bryce Adelstein-Lelbach <blelbach@cct.lsu.edu>
Date: Thu, 26 May 2011 18:23:57 +0000
Subject: [PATCH 10/41] Remove tabs.

[SVN r72190]
---
 include/boost/range/iterator_range_core.hpp | 2 +-
 1 file changed, 1 insertion(+), 1 deletion(-)
 mode change 100755 => 100644 include/boost/range/iterator_range_core.hpp

diff --git a/include/boost/range/iterator_range_core.hpp b/include/boost/range/iterator_range_core.hpp
old mode 100755
new mode 100644
index 31d7147..60c7670
--- a/include/boost/range/iterator_range_core.hpp
+++ b/include/boost/range/iterator_range_core.hpp
@@ -249,7 +249,7 @@ namespace boost
 
             difference_type size() const
             {
-				return m_End - m_Begin;
+                return m_End - m_Begin;
             }
 
             bool empty() const

From 1cb6a99c80d86b76735753f163ac98448375b30f Mon Sep 17 00:00:00 2001
From: Gennadiy Rozental <rogeeff@gmail.com>
Date: Wed, 5 Oct 2011 09:13:05 +0000
Subject: [PATCH 11/41] eliminated unit_test_framework

[SVN r74719]
---
 test/adl_conformance.cpp | 4 ++--
 test/begin.cpp           | 8 ++++----
 test/compat2.cpp         | 4 ++--
 test/compat3.cpp         | 4 ++--
 test/end.cpp             | 8 ++++----
 5 files changed, 14 insertions(+), 14 deletions(-)
 mode change 100755 => 100644 test/compat3.cpp

diff --git a/test/adl_conformance.cpp b/test/adl_conformance.cpp
index 2d7f290..277c183 100644
--- a/test/adl_conformance.cpp
+++ b/test/adl_conformance.cpp
@@ -172,9 +172,9 @@ void check_adl_conformance()
     BOOST_CHECK_EQUAL( boost_test::begin( r6 ), global_namespace );
 }
 
-#include <boost/test/included/unit_test_framework.hpp>
+#include <boost/test/included/unit_test.hpp>
 
-using boost::unit_test_framework::test_suite;
+using boost::unit_test::test_suite;
 
 test_suite* init_unit_test_suite( int argc, char* argv[] )
 {
diff --git a/test/begin.cpp b/test/begin.cpp
index eb745c2..bbc11c1 100644
--- a/test/begin.cpp
+++ b/test/begin.cpp
@@ -18,7 +18,7 @@
 #include <boost/range/begin.hpp>
 #include <boost/test/unit_test.hpp>
 #include <boost/test/test_tools.hpp>
-#include <boost/test/included/unit_test_framework.hpp>
+#include <boost/test/included/unit_test.hpp>
 
 namespace mock_std
 {
@@ -104,12 +104,12 @@ namespace
     }
 }
 
-using boost::unit_test_framework::test_suite;
+using boost::unit_test::test_suite;
 
-boost::unit_test_framework::test_suite*
+boost::unit_test::test_suite*
 init_unit_test_suite( int argc, char* argv[] )
 {
-    boost::unit_test_framework::test_suite* test = BOOST_TEST_SUITE( "Range Test Suite - begin() ADL namespace barrier" );
+    boost::unit_test::test_suite* test = BOOST_TEST_SUITE( "Range Test Suite - begin() ADL namespace barrier" );
 
     test->add( BOOST_TEST_CASE( &test_range_begin ) );
 
diff --git a/test/compat2.cpp b/test/compat2.cpp
index 1a5359c..2874c04 100644
--- a/test/compat2.cpp
+++ b/test/compat2.cpp
@@ -53,9 +53,9 @@ void compat1()
     iterator_of< std::vector<int> >::type i = v.begin();
 }
 
-#include <boost/test/included/unit_test_framework.hpp> 
+#include <boost/test/included/unit_test.hpp> 
 
-using boost::unit_test_framework::test_suite;
+using boost::unit_test::test_suite;
 
 test_suite* init_unit_test_suite( int argc, char* argv[] )
 {
diff --git a/test/compat3.cpp b/test/compat3.cpp
old mode 100755
new mode 100644
index 00987e4..5249c58
--- a/test/compat3.cpp
+++ b/test/compat3.cpp
@@ -53,9 +53,9 @@ void compat1()
     iterator_of< std::vector<int> >::type i = v.begin();
 }
 
-#include <boost/test/included/unit_test_framework.hpp> 
+#include <boost/test/included/unit_test.hpp> 
 
-using boost::unit_test_framework::test_suite;
+using boost::unit_test::test_suite;
 
 test_suite* init_unit_test_suite( int argc, char* argv[] )
 {
diff --git a/test/end.cpp b/test/end.cpp
index e3383c3..3e989ff 100644
--- a/test/end.cpp
+++ b/test/end.cpp
@@ -18,7 +18,7 @@
 #include <boost/range/end.hpp>
 #include <boost/test/unit_test.hpp>
 #include <boost/test/test_tools.hpp>
-#include <boost/test/included/unit_test_framework.hpp>
+#include <boost/test/included/unit_test.hpp>
 
 namespace mock_std
 {
@@ -104,12 +104,12 @@ namespace
     }
 }
 
-using boost::unit_test_framework::test_suite;
+using boost::unit_test::test_suite;
 
-boost::unit_test_framework::test_suite*
+boost::unit_test::test_suite*
 init_unit_test_suite( int argc, char* argv[] )
 {
-    boost::unit_test_framework::test_suite* test = BOOST_TEST_SUITE( "Range Test Suite - end() ADL namespace barrier" );
+    boost::unit_test::test_suite* test = BOOST_TEST_SUITE( "Range Test Suite - end() ADL namespace barrier" );
 
     test->add( BOOST_TEST_CASE( &test_range_end_adl_avoidance ) );
 

From 11238e4c19537aa12c9a110f60863f05619723ab Mon Sep 17 00:00:00 2001
From: Neil Groves <neil@grovescomputing.com>
Date: Sun, 15 Apr 2012 11:52:01 +0000
Subject: [PATCH 12/41] [boost][range] - Trac 5971 - size() should return an
 unsigned type.

[SVN r77990]
---
 doc/mfc_atl.qbk                              |  2 +-
 doc/portability.qbk                          |  2 +-
 doc/reference/semantics.qbk                  |  2 +-
 doc/reference/synopsis.qbk                   | 28 ++++----
 doc/reference/utilities.qbk                  | 74 ++++++++++----------
 doc/style.qbk                                |  8 +--
 doc/upgrade.qbk                              |  6 ++
 include/boost/range/algorithm/equal.hpp      | 20 ++++--
 include/boost/range/algorithm_ext/copy_n.hpp |  8 +--
 include/boost/range/detail/size_type.hpp     | 41 ++++-------
 include/boost/range/size.hpp                 |  6 +-
 include/boost/range/size_type.hpp            | 60 +++++++++-------
 test/algorithm_test/for_each.cpp             |  2 +-
 test/extension_size.cpp                      |  2 +-
 14 files changed, 136 insertions(+), 125 deletions(-)
 mode change 100755 => 100644 include/boost/range/algorithm/equal.hpp
 mode change 100755 => 100644 include/boost/range/algorithm_ext/copy_n.hpp
 mode change 100755 => 100644 include/boost/range/detail/size_type.hpp

diff --git a/doc/mfc_atl.qbk b/doc/mfc_atl.qbk
index 0511509..de2e225 100644
--- a/doc/mfc_atl.qbk
+++ b/doc/mfc_atl.qbk
@@ -41,7 +41,7 @@ BOOST_FOREACH (CList<CString> *theList, myArray)
 
 * Boost C++ Libraries Version 1.34.0 or later (no compilation required)
 * Visual C++ 7.1 or later (for MFC and ATL)
-    
+
 [endsect]
 
 [section:mfc_ranges MFC Ranges]
diff --git a/doc/portability.qbk b/doc/portability.qbk
index aed3825..fabaafc 100644
--- a/doc/portability.qbk
+++ b/doc/portability.qbk
@@ -19,7 +19,7 @@ For maximum portability you should follow these guidelines:
 # use __const_begin__`()` and __const_end__`()` whenever your code by intention is read-only; this will also solve most rvalue problems,
 # do not rely on ADL:
   * if you overload functions, include that header before the headers in this library,
-  * put all overloads in namespace boost. 
+  * put all overloads in namespace boost.
 
 
 
diff --git a/doc/reference/semantics.qbk b/doc/reference/semantics.qbk
index 335ab90..0710a99 100644
--- a/doc/reference/semantics.qbk
+++ b/doc/reference/semantics.qbk
@@ -128,7 +128,7 @@
     ]
     [
         [`size(x)`]
-        [`range_difference<X>::type`]
+        [`range_size<X>::type`]
         [`range_calculate_size(x)` which by default is `boost::end(x) - boost::begin(x)`. Users may supply alternative implementations by implementing `range_calculate_size(x)` so that it will be found via ADL]
         [constant time]
     ]
diff --git a/doc/reference/synopsis.qbk b/doc/reference/synopsis.qbk
index 381d77b..76719df 100644
--- a/doc/reference/synopsis.qbk
+++ b/doc/reference/synopsis.qbk
@@ -20,10 +20,10 @@ namespace boost
 
     template< class T >
     struct range_reference;
-    
+
     template< class T >
     struct range_pointer;
-    
+
     template< class T >
     struct range_category;
 
@@ -92,11 +92,11 @@ namespace boost
     template< class T >
     typename range_reverse_iterator<const T>::type
     rend( const T& r );
-    
+
     //
     // Random Access Range functions
     //
-    
+
     template< class T >
     typename range_difference<T>::type
     size( const T& r );
@@ -106,42 +106,42 @@ namespace boost
     //
 
     template< class T >
-    typename range_iterator<const T>::type 
+    typename range_iterator<const T>::type
     const_begin( const T& r );
 
     template< class T >
-    typename range_iterator<const T>::type 
+    typename range_iterator<const T>::type
     const_end( const T& r );
 
     template< class T >
-    typename range_reverse_iterator<const T>::type 
+    typename range_reverse_iterator<const T>::type
     const_rbegin( const T& r );
 
     template< class T >
-    typename range_reverse_iterator<const T>::type 
+    typename range_reverse_iterator<const T>::type
     const_rend( const T& r );
-    
+
     //
     // String utilities
     //
-    
+
     template< class T >
     iterator_range< ... see below ... >
     as_literal( T& r );
-    
+
     template< class T >
     iterator_range< ... see below ... >
     as_literal( const T& r );
-    
+
     template< class T >
     iterator_range< typename range_iterator<T>::type >
     as_array( T& r );
-    
+
     template< class T >
     iterator_range< typename range_iterator<const T>::type >
     as_array( const T& r );
 
-} // namespace 'boost' 
+} // namespace 'boost'
 ``
 
 [endsect]
diff --git a/doc/reference/utilities.qbk b/doc/reference/utilities.qbk
index 94d4699..25a7edb 100644
--- a/doc/reference/utilities.qbk
+++ b/doc/reference/utilities.qbk
@@ -40,23 +40,23 @@ namespace boost
     public: // construction, assignment
         template< class ForwardTraversalIterator2 >
         iterator_range( ForwardTraversalIterator2 Begin, ForwardTraversalIterator2 End );
-                    
+
         template< class ForwardRange >
         iterator_range( ForwardRange& r );
-  
+
         template< class ForwardRange >
         iterator_range( const ForwardRange& r );
-        
+
         template< class ForwardRange >
         iterator_range& operator=( ForwardRange& r );
 
         template< class ForwardRange >
         iterator_range& operator=( const ForwardRange& r );
-    
+
     public: // Forward Range functions
         iterator  begin() const;
         iterator  end() const;
-        
+
     public: // convenience
         operator    unspecified_bool_type() const;
         bool        equal( const iterator_range& ) const;
@@ -65,25 +65,25 @@ namespace boost
         iterator_range& advance_begin(difference_type n);
         iterator_range& advance_end(difference_type n);
         bool      empty() const;
-        // for Random Access Range only: 
+        // for Random Access Range only:
         reference operator[]( difference_type at ) const;
         value_type operator()( difference_type at ) const;
         size_type size() const;
     };
-    
+
     // stream output
     template< class ForwardTraversalIterator, class T, class Traits >
-    std::basic_ostream<T,Traits>& 
+    std::basic_ostream<T,Traits>&
     operator<<( std::basic_ostream<T,Traits>& Os,
                 const iterator_range<ForwardTraversalIterator>& r );
 
     // comparison
     template< class ForwardTraversalIterator, class ForwardTraversalIterator2 >
-    bool operator==( const iterator_range<ForwardTraversalIterator>& l, 
+    bool operator==( const iterator_range<ForwardTraversalIterator>& l,
                      const iterator_range<ForwardTraversalIterator2>& r );
 
     template< class ForwardTraversalIterator, class ForwardRange >
-    bool operator==( const iterator_range<ForwardTraversalIterator>& l, 
+    bool operator==( const iterator_range<ForwardTraversalIterator>& l,
                      const ForwardRange& r );
 
     template< class ForwardTraversalIterator, class ForwardRange >
@@ -91,11 +91,11 @@ namespace boost
                      const iterator_range<ForwardTraversalIterator>& r );
 
     template< class ForwardTraversalIterator, class ForwardTraversalIterator2 >
-    bool operator!=( const iterator_range<ForwardTraversalIterator>& l, 
+    bool operator!=( const iterator_range<ForwardTraversalIterator>& l,
                      const iterator_range<ForwardTraversalIterator2>& r );
 
     template< class ForwardTraversalIterator, class ForwardRange >
-    bool operator!=( const iterator_range<ForwardTraversalIterator>& l, 
+    bool operator!=( const iterator_range<ForwardTraversalIterator>& l,
                      const ForwardRange& r );
 
     template< class ForwardTraversalIterator, class ForwardRange >
@@ -103,23 +103,23 @@ namespace boost
                      const iterator_range<ForwardTraversalIterator>& r );
 
     template< class ForwardTraversalIterator, class ForwardTraversalIterator2 >
-    bool operator<( const iterator_range<ForwardTraversalIterator>& l, 
+    bool operator<( const iterator_range<ForwardTraversalIterator>& l,
                     const iterator_range<ForwardTraversalIterator2>& r );
 
     template< class ForwardTraversalIterator, class ForwardRange >
-    bool operator<( const iterator_range<ForwardTraversalIterator>& l, 
+    bool operator<( const iterator_range<ForwardTraversalIterator>& l,
                     const ForwardRange& r );
 
     template< class ForwardTraversalIterator, class ForwardRange >
     bool operator<( const ForwardRange& l,
                     const iterator_range<ForwardTraversalIterator>& r );
- 
+
     // external construction
     template< class ForwardTraversalIterator >
     iterator_range< ForwardTraversalIterator >
-    make_iterator_range( ForwardTraversalIterator Begin, 
+    make_iterator_range( ForwardTraversalIterator Begin,
                          ForwardTraversalIterator End );
-       
+
     template< class ForwardRange >
     iterator_range< typename range_iterator<ForwardRange>::type >
     make_iterator_range( ForwardRange& r );
@@ -127,25 +127,25 @@ namespace boost
     template< class ForwardRange >
     iterator_range< typename range_iterator<const ForwardRange>::type >
     make_iterator_range( const ForwardRange& r );
-    
+
     template< class Range >
     iterator_range< typename range_iterator<Range>::type >
     make_iterator_range( Range& r,
                          typename range_difference<Range>::type advance_begin,
                          typename range_difference<Range>::type advance_end );
-    
+
     template< class Range >
     iterator_range< typename range_iterator<const Range>::type >
-    make_iterator_range( const Range& r, 
+    make_iterator_range( const Range& r,
                          typename range_difference<const Range>::type advance_begin,
                          typename range_difference<const Range>::type advance_end );
-    
+
     // convenience
     template< class Sequence, class ForwardRange >
     Sequence copy_range( const ForwardRange& r );
-    
+
 } // namespace 'boost'
-``    
+``
 
 If an instance of `iterator_range` is constructed by a client with two iterators, the client must ensure that the two iterators delimit a valid closed-open range [begin,end).
 
@@ -177,7 +177,7 @@ It is worth noticing that the templated constructors and assignment operators al
 
 ``
 iterator_range make_iterator_range( Range& r,
-                                    typename range_difference<Range>::type advance_begin, 
+                                    typename range_difference<Range>::type advance_begin,
                                     typename range_difference<Range>::type advance_end );
 ``
 
@@ -209,46 +209,46 @@ namespace boost
     template< class ForwardRange >
     class sub_range : public iterator_range< typename range_iterator<ForwardRange>::type >
     {
-    public: 
+    public:
         typedef typename range_iterator<ForwardRange>::type iterator;
         typedef typename range_iterator<const ForwardRange>::type  const_iterator;
         typedef typename iterator_difference<iterator>::type difference_type;
-    
+
     public: // construction, assignment
         template< class ForwardTraversalIterator >
         sub_range( ForwardTraversalIterator Begin, ForwardTraversalIterator End );
 
         template< class ForwardRange2 >
         sub_range( ForwardRange2& r );
-         
+
         template< class ForwardRange2 >
         sub_range( const Range2& r );
-         
+
         template< class ForwardRange2 >
         sub_range& operator=( ForwardRange2& r );
 
         template< class ForwardRange2 >
-        sub_range& operator=( const ForwardRange2& r );    
-    
-    public:  // Forward Range functions 
+        sub_range& operator=( const ForwardRange2& r );
+
+    public:  // Forward Range functions
         iterator        begin();
         const_iterator  begin() const;
         iterator        end();
-        const_iterator  end() const;    
-        
-    public: // convenience 
+        const_iterator  end() const;
+
+    public: // convenience
         value_type&       front();
         const value_type& front() const;
         value_type&       back();
         const value_type& back() const;
-        // for Random Access Range only: 
+        // for Random Access Range only:
         value_type&       operator[]( size_type at );
         const value_type& operator[]( size_type at ) const;
-    
+
     public:
         // rest of interface inherited from iterator_range
     };
-    
+
 } // namespace 'boost'
 ``
 
diff --git a/doc/style.qbk b/doc/style.qbk
index c6e5e34..2074ba6 100644
--- a/doc/style.qbk
+++ b/doc/style.qbk
@@ -13,7 +13,7 @@ Since ranges are characterized by a specific underlying iterator type, we get a
   * Readable Range
   * Writeable Range
   * Swappable Range
-  * Lvalue Range 
+  * Lvalue Range
 * [*/Traversal/] category:
   * __single_pass_range__
   * __forward_range__
@@ -25,7 +25,7 @@ Notice how we have used the categories from the __new_style_iterators__.
 Notice that an iterator (and therefore an range) has one [*/traversal/] property and one or more properties from the [*/value access/] category. So in reality we will mostly talk about mixtures such as
 
 * Random Access Readable Writeable Range
-* Forward Lvalue Range 
+* Forward Lvalue Range
 
 By convention, we should always specify the [*/traversal/] property first as done above. This seems reasonable since there will only be one [*/traversal/] property, but perhaps many [*/value access/] properties.
 
@@ -37,7 +37,7 @@ As another example, consider how we specify the interface of `std::sort()`. Algo
    template< class RandomAccessTraversalReadableWritableIterator >
    void sort( RandomAccessTraversalReadableWritableIterator first,
               RandomAccessTraversalReadableWritableIterator last );
-`` 
+``
 
 For ranges the interface becomes
 
@@ -45,6 +45,6 @@ For ranges the interface becomes
    template< class RandomAccessReadableWritableRange >
    void sort( RandomAccessReadableWritableRange& r );
 ``
- 
+
 [endsect]
 
diff --git a/doc/upgrade.qbk b/doc/upgrade.qbk
index 516ed11..e97f761 100644
--- a/doc/upgrade.qbk
+++ b/doc/upgrade.qbk
@@ -5,6 +5,12 @@
 /]
 [section:upgrade Upgrade version of Boost.Range]
 
+[section:upgrade_from_1_49 Upgrade from version 1.49]
+
+# __size__ now returns the type Rng::size_type if the range has size_type;
+otherwise range_size<Rng>::type is used. This is the distance type promoted to
+an unsigned type.
+
 [section:upgrade_from_1_45 Upgrade from version 1.45]
 
 # __size__ in addition to supporting __random_access_range__ now also supports extensibility via calls to the unqualified `range_calculate_size(rng)` function.
diff --git a/include/boost/range/algorithm/equal.hpp b/include/boost/range/algorithm/equal.hpp
old mode 100755
new mode 100644
index a3ebc29..4472bb1
--- a/include/boost/range/algorithm/equal.hpp
+++ b/include/boost/range/algorithm/equal.hpp
@@ -31,7 +31,7 @@ namespace boost
                                 IteratorCategoryTag1,
                                 IteratorCategoryTag2 )
         {
-            do
+            while (true)
             {
                 // If we have reached the end of the left range then this is
                 // the end of the loop. They are equal if and only if we have
@@ -46,7 +46,12 @@ namespace boost
                     return false;
 
                 // continue looping if and only if the values are equal
-            } while(*first1++ == *first2++);
+                if (*first1 != *first2)
+                    break;
+
+                ++first1;
+                ++first2;
+            }
 
             // Reaching this line in the algorithm indicates that a value
             // inequality has been detected.
@@ -66,7 +71,7 @@ namespace boost
                                 IteratorCategoryTag1,
                                 IteratorCategoryTag2 )
         {
-            do
+            while (true)
             {
                 // If we have reached the end of the left range then this is
                 // the end of the loop. They are equal if and only if we have
@@ -81,7 +86,12 @@ namespace boost
                     return false;
 
                 // continue looping if and only if the values are equal
-            } while(pred(*first1++, *first2++));
+                if (!pred(*first1, *first2))
+                    break;
+
+                ++first1;
+                ++first2;
+            }
 
             // Reaching this line in the algorithm indicates that a value
             // inequality has been detected.
@@ -182,7 +192,7 @@ namespace boost
         }
 
     } // namespace range
-    using range::equal;
+    using ::boost::range::equal;
 } // namespace boost
 
 #endif // include guard
diff --git a/include/boost/range/algorithm_ext/copy_n.hpp b/include/boost/range/algorithm_ext/copy_n.hpp
old mode 100755
new mode 100644
index ba7ad1c..f855441
--- a/include/boost/range/algorithm_ext/copy_n.hpp
+++ b/include/boost/range/algorithm_ext/copy_n.hpp
@@ -30,15 +30,15 @@ namespace boost
 ///
 /// \pre SinglePassRange is a model of the SinglePassRangeConcept
 /// \pre OutputIterator is a model of the OutputIteratorConcept
-/// \pre 0 <= n < distance(rng)
+/// \pre 0 <= n <= distance(rng)
 template< class SinglePassRange, class Size, class OutputIterator >
 inline OutputIterator copy_n(const SinglePassRange& rng, Size n, OutputIterator out)
 {
     BOOST_RANGE_CONCEPT_ASSERT(( SinglePassRangeConcept<const SinglePassRange> ));
-    BOOST_ASSERT( n < static_cast<Size>(boost::distance(rng)) );
+    BOOST_ASSERT( n <= static_cast<Size>(::boost::distance(rng)) );
     BOOST_ASSERT( n >= static_cast<Size>(0) );
 
-    BOOST_DEDUCED_TYPENAME range_iterator<const SinglePassRange>::type source = boost::begin(rng);
+    BOOST_DEDUCED_TYPENAME range_iterator<const SinglePassRange>::type source = ::boost::begin(rng);
 
     for (Size i = 0; i < n; ++i, ++out, ++source)
         *out = *source;
@@ -47,7 +47,7 @@ inline OutputIterator copy_n(const SinglePassRange& rng, Size n, OutputIterator
 }
 
     } // namespace range
-    using range::copy_n;
+    using ::boost::range::copy_n;
 } // namespace boost
 
 #endif // include guard
diff --git a/include/boost/range/detail/size_type.hpp b/include/boost/range/detail/size_type.hpp
old mode 100755
new mode 100644
index ec49f4d..78a60a4
--- a/include/boost/range/detail/size_type.hpp
+++ b/include/boost/range/detail/size_type.hpp
@@ -17,12 +17,19 @@
 // missing partial specialization  workaround.
 //////////////////////////////////////////////////////////////////////////////
 
-namespace boost 
+namespace boost
 {
-    namespace range_detail 
-    {        
+    namespace range_detail
+    {
         template< typename T >
-        struct range_size_type_;
+        struct range_size_type_
+        {
+            template< typename C >
+            struct pts
+            {
+                typedef std::size_t type;
+            };
+        };
 
         template<>
         struct range_size_type_<std_container_>
@@ -33,36 +40,14 @@ namespace boost
                 typedef BOOST_RANGE_DEDUCED_TYPENAME C::size_type type;
             };
         };
+    }
 
-        template<>
-        struct range_size_type_<std_pair_>
-        {
-            template< typename P >
-            struct pts
-            {
-                typedef std::size_t type;
-            };
-        };
-
-        template<>
-        struct range_size_type_<array_>
-        {
-            template< typename A >
-            struct pts
-            {
-                typedef std::size_t type;
-            };
-        };
-
-  
-    } 
-    
     template< typename C >
     class range_size
     {
         typedef typename range_detail::range<C>::type c_type;
     public:
-        typedef typename range_detail::range_size_type_<c_type>::BOOST_NESTED_TEMPLATE pts<C>::type type; 
+        typedef typename range_detail::range_size_type_<c_type>::BOOST_NESTED_TEMPLATE pts<C>::type type;
     };
 }
 
diff --git a/include/boost/range/size.hpp b/include/boost/range/size.hpp
index 4b4eebe..6ae74d1 100644
--- a/include/boost/range/size.hpp
+++ b/include/boost/range/size.hpp
@@ -18,7 +18,7 @@
 #include <boost/range/config.hpp>
 #include <boost/range/begin.hpp>
 #include <boost/range/end.hpp>
-#include <boost/range/difference_type.hpp>
+#include <boost/range/size_type.hpp>
 #include <boost/assert.hpp>
 
 namespace boost
@@ -26,7 +26,7 @@ namespace boost
     namespace range_detail
     {
         template<class SinglePassRange>
-        inline BOOST_DEDUCED_TYPENAME range_difference<SinglePassRange>::type
+        inline BOOST_DEDUCED_TYPENAME range_size<const SinglePassRange>::type
         range_calculate_size(const SinglePassRange& rng)
         {
             BOOST_ASSERT( (boost::end(rng) - boost::begin(rng)) >= 0 &&
@@ -36,7 +36,7 @@ namespace boost
     }
 
     template<class SinglePassRange>
-    inline BOOST_DEDUCED_TYPENAME range_difference<SinglePassRange>::type
+    inline BOOST_DEDUCED_TYPENAME range_size<const SinglePassRange>::type
     size(const SinglePassRange& rng)
     {
 #if !BOOST_WORKAROUND(__BORLANDC__, BOOST_TESTED_AT(0x564)) && \
diff --git a/include/boost/range/size_type.hpp b/include/boost/range/size_type.hpp
index 8c184f8..8223b75 100644
--- a/include/boost/range/size_type.hpp
+++ b/include/boost/range/size_type.hpp
@@ -16,11 +16,13 @@
 #endif
 
 #include <boost/range/config.hpp>
-
+#include <boost/range/difference_type.hpp>
 #ifdef BOOST_NO_TEMPLATE_PARTIAL_SPECIALIZATION
 #include <boost/range/detail/size_type.hpp>
 #else
 
+#include <boost/utility.hpp>
+#include <boost/type_traits/make_unsigned.hpp>
 #include <boost/type_traits/remove_const.hpp>
 #include <cstddef>
 #include <utility>
@@ -33,36 +35,44 @@ namespace boost
         //////////////////////////////////////////////////////////////////////////
         // default
         //////////////////////////////////////////////////////////////////////////
-    
-        template< typename C >
+
+        template<typename T>
+        class has_size_type
+        {
+            typedef char no_type;
+            struct yes_type { char dummy[2]; };
+
+            template<typename C>
+            static yes_type test(BOOST_DEDUCED_TYPENAME C::size_type x);
+
+            template<typename C, typename Arg>
+            static no_type test(Arg x);
+
+        public:
+            static const bool value = sizeof(test<T>(0)) == sizeof(yes_type);
+        };
+
+        template<typename C, typename Enabler=void>
         struct range_size
+        {
+            typedef BOOST_DEDUCED_TYPENAME make_unsigned<
+                BOOST_DEDUCED_TYPENAME range_difference<C>::type
+            >::type type;
+        };
+
+        template<typename C>
+        struct range_size<
+            C,
+            BOOST_DEDUCED_TYPENAME enable_if<has_size_type<C>, void>::type
+        >
         {
             typedef BOOST_DEDUCED_TYPENAME C::size_type type;
         };
-    
-        //////////////////////////////////////////////////////////////////////////
-        // pair
-        //////////////////////////////////////////////////////////////////////////
-    
-        template< typename Iterator >
-        struct range_size< std::pair<Iterator,Iterator> >
-        {
-            typedef std::size_t type;
-        };
-    
-        //////////////////////////////////////////////////////////////////////////
-        // array
-        //////////////////////////////////////////////////////////////////////////
-    
-        template< typename T, std::size_t sz >
-        struct range_size< T[sz] >
-        {
-            typedef std::size_t type;
-        };
+
     }
 
     template< class T >
-    struct range_size : 
+    struct range_size :
         detail::range_size<T>
     { };
 
@@ -70,7 +80,7 @@ namespace boost
     struct range_size<const T >
         : detail::range_size<T>
     { };
-    
+
 } // namespace boost
 
 #endif // BOOST_NO_TEMPLATE_PARTIAL_SPECIALIZATION
diff --git a/test/algorithm_test/for_each.cpp b/test/algorithm_test/for_each.cpp
index 2ef51bf..701d676 100644
--- a/test/algorithm_test/for_each.cpp
+++ b/test/algorithm_test/for_each.cpp
@@ -44,7 +44,7 @@ namespace boost
             BOOST_CHECK_EQUAL( boost::udistance(rng), result_fn.invocation_count() );
             
             fn_t result_fn2 = boost::for_each(boost::make_iterator_range(rng), fn_t(rng));
-            BOOST_CHECK_EQUAL( boost::udistance(rng), result_fn.invocation_count() );
+            BOOST_CHECK_EQUAL( boost::udistance(rng), result_fn2.invocation_count() );
 
             // Test the constant version
             const SinglePassRange& cref_rng = rng;
diff --git a/test/extension_size.cpp b/test/extension_size.cpp
index 856f87d..b6f15cd 100644
--- a/test/extension_size.cpp
+++ b/test/extension_size.cpp
@@ -40,7 +40,7 @@ namespace boost_range_extension_size_test
         impl_t m_impl;
     };
 
-    inline boost::range_difference<std::list<int> >::type
+    inline boost::range_size<std::list<int> >::type
     range_calculate_size(const FooWithoutSize& rng)
     {
         return 2u;

From e6279d44364b81e3e0fa062eb091392d19393144 Mon Sep 17 00:00:00 2001
From: Neil Groves <neil@grovescomputing.com>
Date: Sun, 15 Apr 2012 12:18:02 +0000
Subject: [PATCH 13/41] [boost][range] - Ticket 6149 - as_literal causing
 unnecessary copy (on very silly compilers)

[SVN r77992]
---
 include/boost/range/as_literal.hpp | 32 +++++++++++++++---------------
 1 file changed, 16 insertions(+), 16 deletions(-)

diff --git a/include/boost/range/as_literal.hpp b/include/boost/range/as_literal.hpp
index 2f04ca8..9ea144d 100644
--- a/include/boost/range/as_literal.hpp
+++ b/include/boost/range/as_literal.hpp
@@ -25,7 +25,7 @@
 #include <boost/detail/workaround.hpp>
 
 #include <cstring>
-#ifndef BOOST_NO_CWCHAR 
+#ifndef BOOST_NO_CWCHAR
 #include <cwchar>
 #endif
 
@@ -38,72 +38,72 @@ namespace boost
             return strlen( s );
         }
 
-#ifndef BOOST_NO_CWCHAR  
+#ifndef BOOST_NO_CWCHAR
         inline std::size_t length( const wchar_t* s )
         {
             return wcslen( s );
         }
-#endif        
+#endif
 
         //
         // Remark: the compiler cannot choose between T* and T[sz]
         // overloads, so we must put the T* internal to the
         // unconstrained version.
-        // 
+        //
 
         inline bool is_char_ptr( char* )
         {
             return true;
         }
-        
+
         inline bool is_char_ptr( const char* )
         {
             return true;
         }
 
-#ifndef BOOST_NO_CWCHAR  
+#ifndef BOOST_NO_CWCHAR
         inline bool is_char_ptr( wchar_t* )
         {
             return true;
         }
-        
+
         inline bool is_char_ptr( const wchar_t* )
         {
             return true;
         }
 #endif
-        
+
         template< class T >
-        inline long is_char_ptr( T /* r */ )
+        inline long is_char_ptr( const T& /* r */ )
         {
             return 0L;
         }
 
         template< class T >
-        inline iterator_range<T*> 
+        inline iterator_range<T*>
         make_range( T* const r, bool )
         {
             return iterator_range<T*>( r, r + length(r) );
         }
 
         template< class T >
-        inline iterator_range<BOOST_DEDUCED_TYPENAME range_iterator<T>::type> 
+        inline iterator_range<BOOST_DEDUCED_TYPENAME range_iterator<T>::type>
         make_range( T& r, long )
         {
             return boost::make_iterator_range( r );
         }
 
     }
-    
+
     template< class Range >
-    inline iterator_range<BOOST_DEDUCED_TYPENAME range_iterator<Range>::type> 
+    inline iterator_range<BOOST_DEDUCED_TYPENAME range_iterator<Range>::type>
     as_literal( Range& r )
     {
         return range_detail::make_range( r, range_detail::is_char_ptr(r) );
     }
 
     template< class Range >
-    inline iterator_range<BOOST_DEDUCED_TYPENAME range_iterator<const Range>::type> 
+    inline iterator_range<BOOST_DEDUCED_TYPENAME range_iterator<const Range>::type>
     as_literal( const Range& r )
     {
         return range_detail::make_range( r, range_detail::is_char_ptr(r) );
@@ -112,9 +112,9 @@ namespace boost
     template< class Char, std::size_t sz >
     inline iterator_range<Char*> as_literal( Char (&arr)[sz] )
     {
-        return range_detail::make_range( arr, range_detail::is_char_ptr(arr) );        
+        return range_detail::make_range( arr, range_detail::is_char_ptr(arr) );
     }
-    
+
     template< class Char, std::size_t sz >
     inline iterator_range<const Char*> as_literal( const Char (&arr)[sz] )
     {

From 5a04c9e05bb62ccf2be15448e695fe913260ca86 Mon Sep 17 00:00:00 2001
From: Neil Groves <neil@grovescomputing.com>
Date: Sun, 15 Apr 2012 12:24:53 +0000
Subject: [PATCH 14/41] [boost][range] - Ticket 5993 - Accumulate Concept Check
 constness.

[SVN r77993]
---
 include/boost/range/numeric.hpp | 2 +-
 1 file changed, 1 insertion(+), 1 deletion(-)
 mode change 100755 => 100644 include/boost/range/numeric.hpp

diff --git a/include/boost/range/numeric.hpp b/include/boost/range/numeric.hpp
old mode 100755
new mode 100644
index b01b73a..bfd1049
--- a/include/boost/range/numeric.hpp
+++ b/include/boost/range/numeric.hpp
@@ -40,7 +40,7 @@ namespace boost
     template< class SinglePassRange, class Value >
     inline Value accumulate( const SinglePassRange& rng, Value init )
     {
-        BOOST_RANGE_CONCEPT_ASSERT(( SinglePassRangeConcept<SinglePassRange> ));
+        BOOST_RANGE_CONCEPT_ASSERT(( SinglePassRangeConcept<const SinglePassRange> ));
         return std::accumulate( boost::begin(rng), boost::end(rng), init );
     }
 

From a72eae60992ef6737eefccb258017d3318fa0252 Mon Sep 17 00:00:00 2001
From: Dave Abrahams <dave@boostpro.com>
Date: Fri, 18 May 2012 04:44:04 +0000
Subject: [PATCH 15/41] Replace all uses of boost/utility.hpp with
 more-granular includes.  Solves modularization dependency nightmare.

[SVN r78502]
---
 include/boost/range/algorithm/for_each.hpp         | 1 -
 include/boost/range/counting_range.hpp             | 1 -
 include/boost/range/detail/any_iterator.hpp        | 1 -
 include/boost/range/detail/any_iterator_buffer.hpp | 2 +-
 include/boost/range/detail/join_iterator.hpp       | 2 +-
 include/boost/range/has_range_iterator.hpp         | 2 +-
 include/boost/range/size_type.hpp                  | 2 +-
 7 files changed, 4 insertions(+), 7 deletions(-)
 mode change 100755 => 100644 include/boost/range/algorithm/for_each.hpp
 mode change 100755 => 100644 include/boost/range/counting_range.hpp

diff --git a/include/boost/range/algorithm/for_each.hpp b/include/boost/range/algorithm/for_each.hpp
old mode 100755
new mode 100644
index 12c9d4d..4f5108d
--- a/include/boost/range/algorithm/for_each.hpp
+++ b/include/boost/range/algorithm/for_each.hpp
@@ -14,7 +14,6 @@
 #include <boost/range/end.hpp>
 #include <boost/range/concepts.hpp>
 #include <boost/ref.hpp>
-#include <boost/utility.hpp>
 #include <algorithm>
 
 #if BOOST_WORKAROUND(BOOST_MSVC, == 1600)
diff --git a/include/boost/range/counting_range.hpp b/include/boost/range/counting_range.hpp
old mode 100755
new mode 100644
index 72733a2..b8e4e3a
--- a/include/boost/range/counting_range.hpp
+++ b/include/boost/range/counting_range.hpp
@@ -18,7 +18,6 @@
 #include <boost/range/iterator_range_core.hpp>
 #include <boost/range/value_type.hpp>
 #include <boost/iterator/counting_iterator.hpp>
-#include <boost/utility.hpp>
 
 namespace boost
 {
diff --git a/include/boost/range/detail/any_iterator.hpp b/include/boost/range/detail/any_iterator.hpp
index 107dfd6..5705ff0 100644
--- a/include/boost/range/detail/any_iterator.hpp
+++ b/include/boost/range/detail/any_iterator.hpp
@@ -11,7 +11,6 @@
 #define BOOST_RANGE_DETAIL_ANY_ITERATOR_HPP_INCLUDED
 
 #include <boost/cast.hpp>
-#include <boost/utility.hpp>
 #include <boost/mpl/and.hpp>
 #include <boost/mpl/or.hpp>
 #include <boost/mpl/not.hpp>
diff --git a/include/boost/range/detail/any_iterator_buffer.hpp b/include/boost/range/detail/any_iterator_buffer.hpp
index 26c1420..2bb5d53 100644
--- a/include/boost/range/detail/any_iterator_buffer.hpp
+++ b/include/boost/range/detail/any_iterator_buffer.hpp
@@ -13,7 +13,7 @@
 #include <boost/array.hpp>
 #include <boost/assert.hpp>
 #include <boost/static_assert.hpp>
-#include <boost/utility.hpp>
+#include <boost/noncopyable.hpp>
 
 namespace boost
 {
diff --git a/include/boost/range/detail/join_iterator.hpp b/include/boost/range/detail/join_iterator.hpp
index ce86467..bbdeec7 100644
--- a/include/boost/range/detail/join_iterator.hpp
+++ b/include/boost/range/detail/join_iterator.hpp
@@ -23,7 +23,7 @@
 #include <boost/range/empty.hpp>
 #include <boost/range/detail/demote_iterator_traversal_tag.hpp>
 #include <boost/range/value_type.hpp>
-#include <boost/utility.hpp>
+#include <boost/next_prior.hpp>
 
 namespace boost
 {
diff --git a/include/boost/range/has_range_iterator.hpp b/include/boost/range/has_range_iterator.hpp
index 432efad..8046eb4 100644
--- a/include/boost/range/has_range_iterator.hpp
+++ b/include/boost/range/has_range_iterator.hpp
@@ -13,7 +13,7 @@
 #include <boost/mpl/bool.hpp>
 #include <boost/mpl/has_xxx.hpp>
 #include <boost/range/iterator.hpp>
-#include <boost/utility.hpp>
+#include <boost/utility/enable_if.hpp>
 
 namespace boost
 {
diff --git a/include/boost/range/size_type.hpp b/include/boost/range/size_type.hpp
index 8223b75..c6fb54b 100644
--- a/include/boost/range/size_type.hpp
+++ b/include/boost/range/size_type.hpp
@@ -21,7 +21,7 @@
 #include <boost/range/detail/size_type.hpp>
 #else
 
-#include <boost/utility.hpp>
+#include <boost/utility/enable_if.hpp>
 #include <boost/type_traits/make_unsigned.hpp>
 #include <boost/type_traits/remove_const.hpp>
 #include <cstddef>

From dceccc9de9801e36ff682a6f3261513889f44fff Mon Sep 17 00:00:00 2001
From: Neil Groves <neil@grovescomputing.com>
Date: Fri, 29 Jun 2012 21:49:37 +0000
Subject: [PATCH 16/41] [boost][range] - Added the missing include of
 boost/utility/enable_if.hpp to boost/range/algorithm/for_each.hpp

[SVN r79180]
---
 include/boost/range/algorithm/for_each.hpp | 1 +
 1 file changed, 1 insertion(+)

diff --git a/include/boost/range/algorithm/for_each.hpp b/include/boost/range/algorithm/for_each.hpp
index 4f5108d..fe8ab80 100644
--- a/include/boost/range/algorithm/for_each.hpp
+++ b/include/boost/range/algorithm/for_each.hpp
@@ -13,6 +13,7 @@
 #include <boost/range/begin.hpp>
 #include <boost/range/end.hpp>
 #include <boost/range/concepts.hpp>
+#include <boost/utility/enable_if.hpp>
 #include <boost/ref.hpp>
 #include <algorithm>
 

From 665c4a3234b470040105abf6a1e91e57e6b3d9de Mon Sep 17 00:00:00 2001
From: Nathan Ridge <zeratul976@hotmail.com>
Date: Thu, 13 Dec 2012 07:01:39 +0000
Subject: [PATCH 17/41] [range] fixed a typo in the docs, introduced in r77990,
 that messed up the sections

[SVN r81888]
---
 doc/html/index.html                           |   9 +-
 doc/html/quickbook_HTML.manifest              |   1 +
 doc/html/range/concepts.html                  |   5 +-
 .../range/concepts/bidirectional_range.html   |  55 +++---
 doc/html/range/concepts/concept_checking.html |  14 +-
 doc/html/range/concepts/forward_range.html    |  37 ++--
 doc/html/range/concepts/overview.html         |   5 +-
 .../range/concepts/random_access_range.html   |  42 ++---
 .../range/concepts/single_pass_range.html     |  54 +++---
 doc/html/range/examples.html                  |   5 +-
 doc/html/range/faq.html                       |   5 +-
 doc/html/range/headers.html                   |   5 +-
 doc/html/range/headers/adaptors.html          |   5 +-
 doc/html/range/headers/algorithm.html         |   5 +-
 doc/html/range/headers/algorithm_ext.html     |   5 +-
 doc/html/range/headers/general.html           |   5 +-
 doc/html/range/history_ack.html               |  19 ++-
 doc/html/range/introduction.html              |  30 ++--
 doc/html/range/mfc_atl.html                   |  18 +-
 doc/html/range/mfc_atl/atl_ranges.html        |   5 +-
 doc/html/range/mfc_atl/const_ranges.html      |   6 +-
 doc/html/range/mfc_atl/mfc_ranges.html        |   5 +-
 doc/html/range/mfc_atl/references.html        |   5 +-
 doc/html/range/mfc_atl/requirements.html      |   5 +-
 doc/html/range/portability.html               |  21 ++-
 doc/html/range/reference.html                 |   5 +-
 doc/html/range/reference/adaptors.html        |   5 +-
 .../adaptors/general_requirements.html        |   7 +-
 .../reference/adaptors/introduction.html      |  38 ++---
 .../range/reference/adaptors/reference.html   |   5 +-
 .../adaptors/reference/adjacent_filtered.html |  10 +-
 .../reference/adaptors/reference/copied.html  |  10 +-
 .../adaptors/reference/filtered.html          |  10 +-
 .../reference/adaptors/reference/indexed.html |  10 +-
 .../adaptors/reference/indirected.html        |  10 +-
 .../adaptors/reference/map_keys.html          |  10 +-
 .../adaptors/reference/map_values.html        |  10 +-
 .../adaptors/reference/replaced.html          |  32 ++--
 .../adaptors/reference/replaced_if.html       |  30 ++--
 .../adaptors/reference/reversed.html          |  10 +-
 .../reference/adaptors/reference/sliced.html  |  10 +-
 .../reference/adaptors/reference/strided.html |  10 +-
 .../adaptors/reference/tokenized.html         |  45 +++--
 .../adaptors/reference/transformed.html       |  10 +-
 .../adaptors/reference/type_erased.html       | 161 +++++++++---------
 .../reference/adaptors/reference/uniqued.html |  10 +-
 doc/html/range/reference/algorithms.html      |   5 +-
 doc/html/range/reference/algorithms/heap.html |   5 +-
 .../reference/algorithms/heap/make_heap.html  |  36 ++--
 .../reference/algorithms/heap/pop_heap.html   |  42 ++---
 .../reference/algorithms/heap/push_heap.html  |  42 ++---
 .../reference/algorithms/heap/sort_heap.html  |  42 ++---
 .../reference/algorithms/introduction.html    |  23 ++-
 .../range/reference/algorithms/mutating.html  |   5 +-
 .../reference/algorithms/mutating/copy.html   |  42 ++---
 .../algorithms/mutating/copy_backward.html    |  42 ++---
 .../reference/algorithms/mutating/fill.html   |  36 ++--
 .../reference/algorithms/mutating/fill_n.html |  36 ++--
 .../algorithms/mutating/generate.html         |  42 ++---
 .../algorithms/mutating/inplace_merge.html    |  54 +++---
 .../reference/algorithms/mutating/merge.html  |  54 +++---
 .../algorithms/mutating/nth_element.html      |  36 ++--
 .../algorithms/mutating/partial_sort.html     |  36 ++--
 .../algorithms/mutating/partition.html        |  36 ++--
 .../algorithms/mutating/random_shuffle.html   |  42 ++---
 .../reference/algorithms/mutating/remove.html |  36 ++--
 .../algorithms/mutating/remove_copy.html      |  36 ++--
 .../algorithms/mutating/remove_copy_if.html   |  36 ++--
 .../algorithms/mutating/remove_if.html        |  36 ++--
 .../algorithms/mutating/replace.html          |  36 ++--
 .../algorithms/mutating/replace_copy.html     |  36 ++--
 .../algorithms/mutating/replace_copy_if.html  |  36 ++--
 .../algorithms/mutating/replace_if.html       |  36 ++--
 .../algorithms/mutating/reverse.html          |  36 ++--
 .../algorithms/mutating/reverse_copy.html     |  36 ++--
 .../reference/algorithms/mutating/rotate.html |  42 ++---
 .../algorithms/mutating/rotate_copy.html      |  42 ++---
 .../reference/algorithms/mutating/sort.html   |  36 ++--
 .../algorithms/mutating/stable_partition.html |  36 ++--
 .../algorithms/mutating/stable_sort.html      |  36 ++--
 .../algorithms/mutating/swap_ranges.html      |  36 ++--
 .../algorithms/mutating/transform.html        |  42 ++---
 .../reference/algorithms/mutating/unique.html |  36 ++--
 .../algorithms/mutating/unique_copy.html      |  36 ++--
 doc/html/range/reference/algorithms/new.html  |   5 +-
 .../reference/algorithms/new/copy_n.html      |  36 ++--
 .../range/reference/algorithms/new/erase.html |  36 ++--
 .../reference/algorithms/new/for_each.html    |  36 ++--
 .../reference/algorithms/new/insert.html      |  36 ++--
 .../range/reference/algorithms/new/iota.html  |  36 ++--
 .../reference/algorithms/new/is_sorted.html   |  36 ++--
 .../reference/algorithms/new/overwrite.html   |  36 ++--
 .../reference/algorithms/new/push_back.html   |  36 ++--
 .../reference/algorithms/new/push_front.html  |  36 ++--
 .../algorithms/new/remove_erase.html          |  36 ++--
 .../algorithms/new/remove_erase_if.html       |  36 ++--
 .../reference/algorithms/non_mutating.html    |   5 +-
 .../non_mutating/adjacent_find.html           |  36 ++--
 .../non_mutating/binary_search.html           |  42 ++---
 .../algorithms/non_mutating/count.html        |  36 ++--
 .../algorithms/non_mutating/count_if.html     |  36 ++--
 .../algorithms/non_mutating/equal.html        |  36 ++--
 .../algorithms/non_mutating/equal_range.html  |  46 ++---
 .../algorithms/non_mutating/find.html         |  36 ++--
 .../algorithms/non_mutating/find_end.html     |  36 ++--
 .../non_mutating/find_first_of.html           |  36 ++--
 .../algorithms/non_mutating/find_if.html      |  42 ++---
 .../algorithms/non_mutating/for_each.html     |  38 ++---
 .../non_mutating/lexicographical_compare.html |  38 ++---
 .../algorithms/non_mutating/lower_bound.html  |  42 ++---
 .../algorithms/non_mutating/max_element.html  |  36 ++--
 .../algorithms/non_mutating/min_element.html  |  36 ++--
 .../algorithms/non_mutating/mismatch.html     |  42 ++---
 .../algorithms/non_mutating/search.html       |  36 ++--
 .../algorithms/non_mutating/search_n.html     |  36 ++--
 .../algorithms/non_mutating/upper_bound.html  |  42 ++---
 .../range/reference/algorithms/numeric.html   |   5 +-
 .../algorithms/numeric/accumulate.html        |  48 +++---
 .../numeric/adjacent_difference.html          |  54 +++---
 .../algorithms/numeric/inner_product.html     |  54 +++---
 .../algorithms/numeric/partial_sum.html       |  54 +++---
 .../reference/algorithms/permutation.html     |   5 +-
 .../permutation/next_permutation.html         |  36 ++--
 .../permutation/prev_permutation.html         |  36 ++--
 doc/html/range/reference/algorithms/set.html  |   5 +-
 .../reference/algorithms/set/includes.html    |  44 ++---
 .../algorithms/set/set_difference.html        |  42 ++---
 .../algorithms/set/set_intersection.html      |  44 ++---
 .../set/set_symmetric_difference.html         |  44 ++---
 .../reference/algorithms/set/set_union.html   |  46 ++---
 .../reference/concept_implementation.html     |   5 +-
 .../concept_implementation/semantics.html     |  11 +-
 .../semantics/functions.html                  |   7 +-
 .../semantics/metafunctions.html              |   7 +-
 .../concept_implementation/synopsis.html      | 104 +++++------
 doc/html/range/reference/extending.html       |   5 +-
 .../range/reference/extending/method_1.html   |   5 +-
 .../range/reference/extending/method_2.html   |  76 ++++-----
 .../range/reference/extending/method_3.html   |   5 +-
 .../extending/method_3/method_3_1.html        |  10 +-
 .../extending/method_3/method_3_2.html        |  10 +-
 doc/html/range/reference/overview.html        |   5 +-
 doc/html/range/reference/ranges.html          |   5 +-
 .../range/reference/ranges/any_range.html     |  24 +--
 .../reference/ranges/counting_range.html      |  30 ++--
 doc/html/range/reference/ranges/irange.html   |  36 ++--
 .../range/reference/ranges/istream_range.html |  24 +--
 doc/html/range/reference/utilities.html       |   5 +-
 .../reference/utilities/iterator_range.html   | 110 ++++++------
 doc/html/range/reference/utilities/join.html  |  18 +-
 .../range/reference/utilities/sub_range.html  |  57 +++----
 doc/html/range/style_guide.html               |  53 +++---
 doc/html/range/upgrade.html                   |  13 +-
 doc/html/range/upgrade/upgrade_from_1_34.html |   5 +-
 doc/html/range/upgrade/upgrade_from_1_42.html |   5 +-
 doc/html/range/upgrade/upgrade_from_1_45.html |  11 +-
 doc/html/range/upgrade/upgrade_from_1_49.html |  50 ++++++
 doc/upgrade.qbk                               |   2 +
 158 files changed, 2299 insertions(+), 2227 deletions(-)
 create mode 100644 doc/html/range/upgrade/upgrade_from_1_49.html

diff --git a/doc/html/index.html b/doc/html/index.html
index 1be23d5..01dcdb6 100644
--- a/doc/html/index.html
+++ b/doc/html/index.html
@@ -28,9 +28,10 @@
 <div><div class="author"><h3 class="author">
 <span class="firstname">Neil</span> <span class="surname">Groves</span>
 </h3></div></div>
-<div><p class="copyright">Copyright &#169; 2003 -2010 Thorsten Ottosen, Neil Groves</p></div>
+<div><p class="copyright">Copyright &#169; 2003-2010 Thorsten Ottosen,
+      Neil Groves</p></div>
 <div><div class="legalnotice">
-<a name="id607962"></a><p>
+<a name="range.legal"></a><p>
         Distributed under the Boost Software License, Version 1.0. (See accompanying
         file LICENSE_1_0.txt or copy at <a href="http://www.boost.org/LICENSE_1_0.txt" target="_top">http://www.boost.org/LICENSE_1_0.txt</a>)
       </p>
@@ -122,6 +123,8 @@
 </dl></dd>
 <dt><span class="section"><a href="range/upgrade.html">Upgrade version of Boost.Range</a></span></dt>
 <dd><dl>
+<dt><span class="section"><a href="range/upgrade/upgrade_from_1_49.html">Upgrade from version
+      1.49</a></span></dt>
 <dt><span class="section"><a href="range/upgrade/upgrade_from_1_45.html">Upgrade from version
       1.45</a></span></dt>
 <dt><span class="section"><a href="range/upgrade/upgrade_from_1_42.html">Upgrade from version
@@ -144,7 +147,7 @@
   </p>
 </div>
 <table xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" width="100%"><tr>
-<td align="left"><p><small>Last revised: January 01, 2011 at 16:31:27 GMT</small></p></td>
+<td align="left"><p><small>Last revised: December 13, 2012 at 06:35:02 GMT</small></p></td>
 <td align="right"><div class="copyright-footer"></div></td>
 </tr></table>
 <hr>
diff --git a/doc/html/quickbook_HTML.manifest b/doc/html/quickbook_HTML.manifest
index 1b32f72..27afd8c 100644
--- a/doc/html/quickbook_HTML.manifest
+++ b/doc/html/quickbook_HTML.manifest
@@ -147,6 +147,7 @@ range/mfc_atl/atl_ranges.html
 range/mfc_atl/const_ranges.html
 range/mfc_atl/references.html
 range/upgrade.html
+range/upgrade/upgrade_from_1_49.html
 range/upgrade/upgrade_from_1_45.html
 range/upgrade/upgrade_from_1_42.html
 range/upgrade/upgrade_from_1_34.html
diff --git a/doc/html/range/concepts.html b/doc/html/range/concepts.html
index c3c92a8..f78f33b 100644
--- a/doc/html/range/concepts.html
+++ b/doc/html/range/concepts.html
@@ -22,7 +22,7 @@
 <div class="spirit-nav">
 <a accesskey="p" href="introduction.html"><img src="../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../index.html"><img src="../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../index.html"><img src="../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="concepts/overview.html"><img src="../../../../../doc/src/images/next.png" alt="Next"></a>
 </div>
-<div class="section">
+<div class="section range_concepts">
 <div class="titlepage"><div><div><h2 class="title" style="clear: both">
 <a name="range.concepts"></a><a class="link" href="concepts.html" title="Range Concepts">Range Concepts</a>
 </h2></div></div></div>
@@ -37,7 +37,8 @@
 </div>
 <table xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" width="100%"><tr>
 <td align="left"></td>
-<td align="right"><div class="copyright-footer">Copyright &#169; 2003 -2010 Thorsten Ottosen, Neil Groves<p>
+<td align="right"><div class="copyright-footer">Copyright &#169; 2003-2010 Thorsten Ottosen,
+      Neil Groves<p>
         Distributed under the Boost Software License, Version 1.0. (See accompanying
         file LICENSE_1_0.txt or copy at <a href="http://www.boost.org/LICENSE_1_0.txt" target="_top">http://www.boost.org/LICENSE_1_0.txt</a>)
       </p>
diff --git a/doc/html/range/concepts/bidirectional_range.html b/doc/html/range/concepts/bidirectional_range.html
index 6e3dc8c..a19891d 100644
--- a/doc/html/range/concepts/bidirectional_range.html
+++ b/doc/html/range/concepts/bidirectional_range.html
@@ -22,13 +22,13 @@
 <div class="spirit-nav">
 <a accesskey="p" href="forward_range.html"><img src="../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../concepts.html"><img src="../../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../../index.html"><img src="../../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="random_access_range.html"><img src="../../../../../../doc/src/images/next.png" alt="Next"></a>
 </div>
-<div class="section">
+<div class="section range_concepts_bidirectional_range">
 <div class="titlepage"><div><div><h3 class="title">
 <a name="range.concepts.bidirectional_range"></a><a class="link" href="bidirectional_range.html" title="Bidirectional Range">Bidirectional Range</a>
 </h3></div></div></div>
-<a name="range.concepts.bidirectional_range.notation"></a><h5>
-<a name="id650256"></a>
-        <a class="link" href="bidirectional_range.html#range.concepts.bidirectional_range.notation">Notation</a>
+<h5>
+<a name="range.concepts.bidirectional_range.h0"></a>
+        <span><a name="range.concepts.bidirectional_range.notation"></a></span><a class="link" href="bidirectional_range.html#range.concepts.bidirectional_range.notation">Notation</a>
       </h5>
 <div class="informaltable"><table class="table">
 <colgroup>
@@ -64,9 +64,9 @@
 </tr>
 </tbody>
 </table></div>
-<a name="range.concepts.bidirectional_range.description"></a><h5>
-<a name="id650345"></a>
-        <a class="link" href="bidirectional_range.html#range.concepts.bidirectional_range.description">Description</a>
+<h5>
+<a name="range.concepts.bidirectional_range.h1"></a>
+        <span><a name="range.concepts.bidirectional_range.description"></a></span><a class="link" href="bidirectional_range.html#range.concepts.bidirectional_range.description">Description</a>
       </h5>
 <p>
         This concept provides access to iterators that traverse in both directions
@@ -74,17 +74,17 @@
         of <a href="../../../../../../libs/iterator/doc/new-iter-concepts.html#bidirectional-traversal-iterators-lib-bidirectional-traversal-iterators" target="_top">Bidirectional
         Traversal Iterator</a>.
       </p>
-<a name="range.concepts.bidirectional_range.refinement_of"></a><h5>
-<a name="id650403"></a>
-        <a class="link" href="bidirectional_range.html#range.concepts.bidirectional_range.refinement_of">Refinement
+<h5>
+<a name="range.concepts.bidirectional_range.h2"></a>
+        <span><a name="range.concepts.bidirectional_range.refinement_of"></a></span><a class="link" href="bidirectional_range.html#range.concepts.bidirectional_range.refinement_of">Refinement
         of</a>
       </h5>
 <p>
         <a class="link" href="forward_range.html" title="Forward Range">Forward Range</a>
       </p>
-<a name="range.concepts.bidirectional_range.associated_types"></a><h5>
-<a name="id650426"></a>
-        <a class="link" href="bidirectional_range.html#range.concepts.bidirectional_range.associated_types">Associated
+<h5>
+<a name="range.concepts.bidirectional_range.h3"></a>
+        <span><a name="range.concepts.bidirectional_range.associated_types"></a></span><a class="link" href="bidirectional_range.html#range.concepts.bidirectional_range.associated_types">Associated
         types</a>
       </h5>
 <div class="informaltable"><table class="table">
@@ -135,10 +135,9 @@
 </tr>
 </tbody>
 </table></div>
-<a name="range.concepts.bidirectional_range.valid_expressions"></a><h5>
-<a name="id650581"></a>
-        <a class="link" href="bidirectional_range.html#range.concepts.bidirectional_range.valid_expressions">Valid
-        expressions</a>
+<h5>
+<a name="range.concepts.bidirectional_range.h4"></a>
+        <span><a name="range.concepts.bidirectional_range.valid_expressions"></a></span><a class="link" href="bidirectional_range.html#range.concepts.bidirectional_range.valid_expressions">Valid expressions</a>
       </h5>
 <div class="informaltable"><table class="table">
 <colgroup>
@@ -220,9 +219,9 @@
 </tr>
 </tbody>
 </table></div>
-<a name="range.concepts.bidirectional_range.complexity_guarantees"></a><h5>
-<a name="id651042"></a>
-        <a class="link" href="bidirectional_range.html#range.concepts.bidirectional_range.complexity_guarantees">Complexity
+<h5>
+<a name="range.concepts.bidirectional_range.h5"></a>
+        <span><a name="range.concepts.bidirectional_range.complexity_guarantees"></a></span><a class="link" href="bidirectional_range.html#range.concepts.bidirectional_range.complexity_guarantees">Complexity
         guarantees</a>
       </h5>
 <p>
@@ -231,9 +230,9 @@
         <code class="computeroutput"><span class="identifier">boost</span><span class="special">::</span><span class="identifier">rend</span><span class="special">(</span><span class="identifier">a</span><span class="special">)</span></code> has the same complexity as <code class="computeroutput"><span class="identifier">boost</span><span class="special">::</span><span class="identifier">begin</span><span class="special">(</span><span class="identifier">a</span><span class="special">)</span></code> from
         <a class="link" href="forward_range.html" title="Forward Range">Forward Range</a>.
       </p>
-<a name="range.concepts.bidirectional_range.invariants"></a><h5>
-<a name="id651182"></a>
-        <a class="link" href="bidirectional_range.html#range.concepts.bidirectional_range.invariants">Invariants</a>
+<h5>
+<a name="range.concepts.bidirectional_range.h6"></a>
+        <span><a name="range.concepts.bidirectional_range.invariants"></a></span><a class="link" href="bidirectional_range.html#range.concepts.bidirectional_range.invariants">Invariants</a>
       </h5>
 <div class="informaltable"><table class="table">
 <colgroup>
@@ -271,9 +270,10 @@
 </tr>
 </tbody>
 </table></div>
-<a name="range.concepts.bidirectional_range.see_also"></a><h5>
-<a name="id651431"></a>
-        <a class="link" href="bidirectional_range.html#range.concepts.bidirectional_range.see_also">See also</a>
+<h5>
+<a name="range.concepts.bidirectional_range.h7"></a>
+        <span><a name="range.concepts.bidirectional_range.see_also"></a></span><a class="link" href="bidirectional_range.html#range.concepts.bidirectional_range.see_also">See
+        also</a>
       </h5>
 <p>
         <a class="link" href="../reference/concept_implementation/semantics/metafunctions.html" title="Metafunctions">Implementation
@@ -286,7 +286,8 @@
 </div>
 <table xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" width="100%"><tr>
 <td align="left"></td>
-<td align="right"><div class="copyright-footer">Copyright &#169; 2003 -2010 Thorsten Ottosen, Neil Groves<p>
+<td align="right"><div class="copyright-footer">Copyright &#169; 2003-2010 Thorsten Ottosen,
+      Neil Groves<p>
         Distributed under the Boost Software License, Version 1.0. (See accompanying
         file LICENSE_1_0.txt or copy at <a href="http://www.boost.org/LICENSE_1_0.txt" target="_top">http://www.boost.org/LICENSE_1_0.txt</a>)
       </p>
diff --git a/doc/html/range/concepts/concept_checking.html b/doc/html/range/concepts/concept_checking.html
index 20a2fbb..5fa7fa3 100644
--- a/doc/html/range/concepts/concept_checking.html
+++ b/doc/html/range/concepts/concept_checking.html
@@ -22,7 +22,7 @@
 <div class="spirit-nav">
 <a accesskey="p" href="random_access_range.html"><img src="../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../concepts.html"><img src="../../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../../index.html"><img src="../../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="../reference.html"><img src="../../../../../../doc/src/images/next.png" alt="Next"></a>
 </div>
-<div class="section">
+<div class="section range_concepts_concept_checking">
 <div class="titlepage"><div><div><h3 class="title">
 <a name="range.concepts.concept_checking"></a><a class="link" href="concept_checking.html" title="Concept Checking">Concept Checking</a>
 </h3></div></div></div>
@@ -38,7 +38,6 @@
         Range</a> concept.
       </p>
 <p>
-        
 </p>
 <pre class="programlisting"><span class="identifier">BOOST_CONCEPT_ASSERT</span><span class="special">((</span> <span class="identifier">ForwardRangeConcept</span><span class="special">&lt;</span><span class="identifier">T</span><span class="special">&gt;</span> <span class="special">));</span>
 </pre>
@@ -50,7 +49,6 @@
         ForwardReadableRange, the following code is required.
       </p>
 <p>
-        
 </p>
 <pre class="programlisting"><span class="identifier">BOOST_CONCEPT_ASSERT</span><span class="special">((</span> <span class="identifier">ForwardRangeConcept</span><span class="special">&lt;</span><span class="identifier">T</span><span class="special">&gt;</span> <span class="special">));</span>
 <span class="identifier">BOOST_CONCEPT_ASSERT</span><span class="special">((</span> <span class="identifier">ReadableIteratorConcept</span><span class="special">&lt;</span><span class="keyword">typename</span> <span class="identifier">range_iterator</span><span class="special">&lt;</span><span class="identifier">T</span><span class="special">&gt;::</span><span class="identifier">type</span><span class="special">&gt;</span> <span class="special">));</span>
@@ -78,9 +76,10 @@
             Access Range</a>
           </li>
 </ul></div>
-<a name="range.concepts.concept_checking.see_also"></a><h5>
-<a name="id652377"></a>
-        <a class="link" href="concept_checking.html#range.concepts.concept_checking.see_also">See also</a>
+<h5>
+<a name="range.concepts.concept_checking.h0"></a>
+        <span><a name="range.concepts.concept_checking.see_also"></a></span><a class="link" href="concept_checking.html#range.concepts.concept_checking.see_also">See
+        also</a>
       </h5>
 <p>
         <a class="link" href="../style_guide.html" title="Terminology and style guidelines">Range Terminology and style guidelines</a>
@@ -94,7 +93,8 @@
 </div>
 <table xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" width="100%"><tr>
 <td align="left"></td>
-<td align="right"><div class="copyright-footer">Copyright &#169; 2003 -2010 Thorsten Ottosen, Neil Groves<p>
+<td align="right"><div class="copyright-footer">Copyright &#169; 2003-2010 Thorsten Ottosen,
+      Neil Groves<p>
         Distributed under the Boost Software License, Version 1.0. (See accompanying
         file LICENSE_1_0.txt or copy at <a href="http://www.boost.org/LICENSE_1_0.txt" target="_top">http://www.boost.org/LICENSE_1_0.txt</a>)
       </p>
diff --git a/doc/html/range/concepts/forward_range.html b/doc/html/range/concepts/forward_range.html
index 7937f8c..ca7b471 100644
--- a/doc/html/range/concepts/forward_range.html
+++ b/doc/html/range/concepts/forward_range.html
@@ -22,13 +22,13 @@
 <div class="spirit-nav">
 <a accesskey="p" href="single_pass_range.html"><img src="../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../concepts.html"><img src="../../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../../index.html"><img src="../../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="bidirectional_range.html"><img src="../../../../../../doc/src/images/next.png" alt="Next"></a>
 </div>
-<div class="section">
+<div class="section range_concepts_forward_range">
 <div class="titlepage"><div><div><h3 class="title">
 <a name="range.concepts.forward_range"></a><a class="link" href="forward_range.html" title="Forward Range">Forward Range</a>
 </h3></div></div></div>
-<a name="range.concepts.forward_range.notation"></a><h5>
-<a name="id649886"></a>
-        <a class="link" href="forward_range.html#range.concepts.forward_range.notation">Notation</a>
+<h5>
+<a name="range.concepts.forward_range.h0"></a>
+        <span><a name="range.concepts.forward_range.notation"></a></span><a class="link" href="forward_range.html#range.concepts.forward_range.notation">Notation</a>
       </h5>
 <div class="informaltable"><table class="table">
 <colgroup>
@@ -64,24 +64,25 @@
 </tr>
 </tbody>
 </table></div>
-<a name="range.concepts.forward_range.description"></a><h5>
-<a name="id649974"></a>
-        <a class="link" href="forward_range.html#range.concepts.forward_range.description">Description</a>
+<h5>
+<a name="range.concepts.forward_range.h1"></a>
+        <span><a name="range.concepts.forward_range.description"></a></span><a class="link" href="forward_range.html#range.concepts.forward_range.description">Description</a>
       </h5>
 <p>
         A range <code class="computeroutput"><span class="identifier">X</span></code> where <code class="computeroutput"><span class="identifier">boost</span><span class="special">::</span><span class="identifier">range_iterator</span><span class="special">&lt;</span><span class="identifier">X</span><span class="special">&gt;::</span><span class="identifier">type</span></code> is a model of <a href="../../../../../../libs/iterator/doc/new-iter-concepts.html#forward-traversal-iterators-lib-forward-traversal-iterators" target="_top">Forward
         Traversal Iterator</a>.
       </p>
-<a name="range.concepts.forward_range.refinement_of"></a><h5>
-<a name="id650039"></a>
-        <a class="link" href="forward_range.html#range.concepts.forward_range.refinement_of">Refinement of</a>
+<h5>
+<a name="range.concepts.forward_range.h2"></a>
+        <span><a name="range.concepts.forward_range.refinement_of"></a></span><a class="link" href="forward_range.html#range.concepts.forward_range.refinement_of">Refinement
+        of</a>
       </h5>
 <p>
         <a class="link" href="single_pass_range.html" title="Single Pass Range">Single Pass Range</a>
       </p>
-<a name="range.concepts.forward_range.associated_types"></a><h5>
-<a name="id650062"></a>
-        <a class="link" href="forward_range.html#range.concepts.forward_range.associated_types">Associated
+<h5>
+<a name="range.concepts.forward_range.h3"></a>
+        <span><a name="range.concepts.forward_range.associated_types"></a></span><a class="link" href="forward_range.html#range.concepts.forward_range.associated_types">Associated
         types</a>
       </h5>
 <div class="informaltable"><table class="table">
@@ -131,9 +132,10 @@
 </tr>
 </tbody>
 </table></div>
-<a name="range.concepts.forward_range.see_also"></a><h5>
-<a name="id650211"></a>
-        <a class="link" href="forward_range.html#range.concepts.forward_range.see_also">See also</a>
+<h5>
+<a name="range.concepts.forward_range.h4"></a>
+        <span><a name="range.concepts.forward_range.see_also"></a></span><a class="link" href="forward_range.html#range.concepts.forward_range.see_also">See
+        also</a>
       </h5>
 <p>
         <a class="link" href="../reference/concept_implementation/semantics/metafunctions.html" title="Metafunctions">Implementation
@@ -146,7 +148,8 @@
 </div>
 <table xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" width="100%"><tr>
 <td align="left"></td>
-<td align="right"><div class="copyright-footer">Copyright &#169; 2003 -2010 Thorsten Ottosen, Neil Groves<p>
+<td align="right"><div class="copyright-footer">Copyright &#169; 2003-2010 Thorsten Ottosen,
+      Neil Groves<p>
         Distributed under the Boost Software License, Version 1.0. (See accompanying
         file LICENSE_1_0.txt or copy at <a href="http://www.boost.org/LICENSE_1_0.txt" target="_top">http://www.boost.org/LICENSE_1_0.txt</a>)
       </p>
diff --git a/doc/html/range/concepts/overview.html b/doc/html/range/concepts/overview.html
index bded544..9fb26b3 100644
--- a/doc/html/range/concepts/overview.html
+++ b/doc/html/range/concepts/overview.html
@@ -22,7 +22,7 @@
 <div class="spirit-nav">
 <a accesskey="p" href="../concepts.html"><img src="../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../concepts.html"><img src="../../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../../index.html"><img src="../../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="single_pass_range.html"><img src="../../../../../../doc/src/images/next.png" alt="Next"></a>
 </div>
-<div class="section">
+<div class="section range_concepts_overview">
 <div class="titlepage"><div><div><h3 class="title">
 <a name="range.concepts.overview"></a><a class="link" href="overview.html" title="Overview">Overview</a>
 </h3></div></div></div>
@@ -65,7 +65,8 @@
 </div>
 <table xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" width="100%"><tr>
 <td align="left"></td>
-<td align="right"><div class="copyright-footer">Copyright &#169; 2003 -2010 Thorsten Ottosen, Neil Groves<p>
+<td align="right"><div class="copyright-footer">Copyright &#169; 2003-2010 Thorsten Ottosen,
+      Neil Groves<p>
         Distributed under the Boost Software License, Version 1.0. (See accompanying
         file LICENSE_1_0.txt or copy at <a href="http://www.boost.org/LICENSE_1_0.txt" target="_top">http://www.boost.org/LICENSE_1_0.txt</a>)
       </p>
diff --git a/doc/html/range/concepts/random_access_range.html b/doc/html/range/concepts/random_access_range.html
index 3124ddc..89ff255 100644
--- a/doc/html/range/concepts/random_access_range.html
+++ b/doc/html/range/concepts/random_access_range.html
@@ -22,30 +22,29 @@
 <div class="spirit-nav">
 <a accesskey="p" href="bidirectional_range.html"><img src="../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../concepts.html"><img src="../../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../../index.html"><img src="../../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="concept_checking.html"><img src="../../../../../../doc/src/images/next.png" alt="Next"></a>
 </div>
-<div class="section">
+<div class="section range_concepts_random_access_range">
 <div class="titlepage"><div><div><h3 class="title">
 <a name="range.concepts.random_access_range"></a><a class="link" href="random_access_range.html" title="Random Access Range">Random Access Range</a>
 </h3></div></div></div>
-<a name="range.concepts.random_access_range.description"></a><h5>
-<a name="id651477"></a>
-        <a class="link" href="random_access_range.html#range.concepts.random_access_range.description">Description</a>
+<h5>
+<a name="range.concepts.random_access_range.h0"></a>
+        <span><a name="range.concepts.random_access_range.description"></a></span><a class="link" href="random_access_range.html#range.concepts.random_access_range.description">Description</a>
       </h5>
 <p>
         A range <code class="computeroutput"><span class="identifier">X</span></code> where <code class="computeroutput"><span class="identifier">boost</span><span class="special">::</span><span class="identifier">range_iterator</span><span class="special">&lt;</span><span class="identifier">X</span><span class="special">&gt;::</span><span class="identifier">type</span></code> is a model of <a href="../../../../../../libs/iterator/doc/new-iter-concepts.html#random-access-traversal-iterators-lib-random-access-traversal-iterators" target="_top">Random
         Access Traversal Iterator</a>.
       </p>
-<a name="range.concepts.random_access_range.refinement_of"></a><h5>
-<a name="id651543"></a>
-        <a class="link" href="random_access_range.html#range.concepts.random_access_range.refinement_of">Refinement
+<h5>
+<a name="range.concepts.random_access_range.h1"></a>
+        <span><a name="range.concepts.random_access_range.refinement_of"></a></span><a class="link" href="random_access_range.html#range.concepts.random_access_range.refinement_of">Refinement
         of</a>
       </h5>
 <p>
         <a class="link" href="bidirectional_range.html" title="Bidirectional Range">Bidirectional Range</a>
       </p>
-<a name="range.concepts.random_access_range.valid_expressions"></a><h5>
-<a name="id651566"></a>
-        <a class="link" href="random_access_range.html#range.concepts.random_access_range.valid_expressions">Valid
-        expressions</a>
+<h5>
+<a name="range.concepts.random_access_range.h2"></a>
+        <span><a name="range.concepts.random_access_range.valid_expressions"></a></span><a class="link" href="random_access_range.html#range.concepts.random_access_range.valid_expressions">Valid expressions</a>
       </h5>
 <div class="informaltable"><table class="table">
 <colgroup>
@@ -88,9 +87,9 @@
               </td>
 </tr></tbody>
 </table></div>
-<a name="range.concepts.random_access_range.expression_semantics"></a><h5>
-<a name="id651704"></a>
-        <a class="link" href="random_access_range.html#range.concepts.random_access_range.expression_semantics">Expression
+<h5>
+<a name="range.concepts.random_access_range.h3"></a>
+        <span><a name="range.concepts.random_access_range.expression_semantics"></a></span><a class="link" href="random_access_range.html#range.concepts.random_access_range.expression_semantics">Expression
         semantics</a>
       </h5>
 <div class="informaltable"><table class="table">
@@ -138,17 +137,17 @@
               </td>
 </tr></tbody>
 </table></div>
-<a name="range.concepts.random_access_range.complexity_guarantees"></a><h5>
-<a name="id651919"></a>
-        <a class="link" href="random_access_range.html#range.concepts.random_access_range.complexity_guarantees">Complexity
+<h5>
+<a name="range.concepts.random_access_range.h4"></a>
+        <span><a name="range.concepts.random_access_range.complexity_guarantees"></a></span><a class="link" href="random_access_range.html#range.concepts.random_access_range.complexity_guarantees">Complexity
         guarantees</a>
       </h5>
 <p>
         <code class="computeroutput"><span class="identifier">boost</span><span class="special">::</span><span class="identifier">size</span><span class="special">(</span><span class="identifier">a</span><span class="special">)</span></code> completes in amortized constant time.
       </p>
-<a name="range.concepts.random_access_range.invariants"></a><h5>
-<a name="id651967"></a>
-        <a class="link" href="random_access_range.html#range.concepts.random_access_range.invariants">Invariants</a>
+<h5>
+<a name="range.concepts.random_access_range.h5"></a>
+        <span><a name="range.concepts.random_access_range.invariants"></a></span><a class="link" href="random_access_range.html#range.concepts.random_access_range.invariants">Invariants</a>
       </h5>
 <div class="informaltable"><table class="table">
 <colgroup>
@@ -173,7 +172,8 @@
 </div>
 <table xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" width="100%"><tr>
 <td align="left"></td>
-<td align="right"><div class="copyright-footer">Copyright &#169; 2003 -2010 Thorsten Ottosen, Neil Groves<p>
+<td align="right"><div class="copyright-footer">Copyright &#169; 2003-2010 Thorsten Ottosen,
+      Neil Groves<p>
         Distributed under the Boost Software License, Version 1.0. (See accompanying
         file LICENSE_1_0.txt or copy at <a href="http://www.boost.org/LICENSE_1_0.txt" target="_top">http://www.boost.org/LICENSE_1_0.txt</a>)
       </p>
diff --git a/doc/html/range/concepts/single_pass_range.html b/doc/html/range/concepts/single_pass_range.html
index 273692a..2165fc9 100644
--- a/doc/html/range/concepts/single_pass_range.html
+++ b/doc/html/range/concepts/single_pass_range.html
@@ -22,13 +22,13 @@
 <div class="spirit-nav">
 <a accesskey="p" href="overview.html"><img src="../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../concepts.html"><img src="../../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../../index.html"><img src="../../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="forward_range.html"><img src="../../../../../../doc/src/images/next.png" alt="Next"></a>
 </div>
-<div class="section">
+<div class="section range_concepts_single_pass_range">
 <div class="titlepage"><div><div><h3 class="title">
 <a name="range.concepts.single_pass_range"></a><a class="link" href="single_pass_range.html" title="Single Pass Range">Single Pass Range</a>
 </h3></div></div></div>
-<a name="range.concepts.single_pass_range.notation"></a><h5>
-<a name="id648593"></a>
-        <a class="link" href="single_pass_range.html#range.concepts.single_pass_range.notation">Notation</a>
+<h5>
+<a name="range.concepts.single_pass_range.h0"></a>
+        <span><a name="range.concepts.single_pass_range.notation"></a></span><a class="link" href="single_pass_range.html#range.concepts.single_pass_range.notation">Notation</a>
       </h5>
 <div class="informaltable"><table class="table">
 <colgroup>
@@ -64,17 +64,17 @@
 </tr>
 </tbody>
 </table></div>
-<a name="range.concepts.single_pass_range.description"></a><h5>
-<a name="id648686"></a>
-        <a class="link" href="single_pass_range.html#range.concepts.single_pass_range.description">Description</a>
+<h5>
+<a name="range.concepts.single_pass_range.h1"></a>
+        <span><a name="range.concepts.single_pass_range.description"></a></span><a class="link" href="single_pass_range.html#range.concepts.single_pass_range.description">Description</a>
       </h5>
 <p>
         A range <code class="computeroutput"><span class="identifier">X</span></code> where <code class="computeroutput"><span class="identifier">boost</span><span class="special">::</span><span class="identifier">range_iterator</span><span class="special">&lt;</span><span class="identifier">X</span><span class="special">&gt;::</span><span class="identifier">type</span></code> is a model of <a href="../../../../../../libs/iterator/doc/new-iter-concepts.html#singls-pass-iterators-lib-single-pass-iterators" target="_top">Single
         Pass Iterator</a>.
       </p>
-<a name="range.concepts.single_pass_range.associated_types"></a><h5>
-<a name="id648751"></a>
-        <a class="link" href="single_pass_range.html#range.concepts.single_pass_range.associated_types">Associated
+<h5>
+<a name="range.concepts.single_pass_range.h2"></a>
+        <span><a name="range.concepts.single_pass_range.associated_types"></a></span><a class="link" href="single_pass_range.html#range.concepts.single_pass_range.associated_types">Associated
         types</a>
       </h5>
 <div class="informaltable"><table class="table">
@@ -125,9 +125,9 @@
 </tr>
 </tbody>
 </table></div>
-<a name="range.concepts.single_pass_range.valid_expressions"></a><h5>
-<a name="id648914"></a>
-        <a class="link" href="single_pass_range.html#range.concepts.single_pass_range.valid_expressions">Valid
+<h5>
+<a name="range.concepts.single_pass_range.h3"></a>
+        <span><a name="range.concepts.single_pass_range.valid_expressions"></a></span><a class="link" href="single_pass_range.html#range.concepts.single_pass_range.valid_expressions">Valid
         expressions</a>
       </h5>
 <p>
@@ -197,9 +197,9 @@
 </tr>
 </tbody>
 </table></div>
-<a name="range.concepts.single_pass_range.expression_semantics"></a><h5>
-<a name="id649233"></a>
-        <a class="link" href="single_pass_range.html#range.concepts.single_pass_range.expression_semantics">Expression
+<h5>
+<a name="range.concepts.single_pass_range.h4"></a>
+        <span><a name="range.concepts.single_pass_range.expression_semantics"></a></span><a class="link" href="single_pass_range.html#range.concepts.single_pass_range.expression_semantics">Expression
         semantics</a>
       </h5>
 <div class="informaltable"><table class="table">
@@ -265,9 +265,9 @@
 </tr>
 </tbody>
 </table></div>
-<a name="range.concepts.single_pass_range.complexity_guarantees"></a><h5>
-<a name="id649490"></a>
-        <a class="link" href="single_pass_range.html#range.concepts.single_pass_range.complexity_guarantees">Complexity
+<h5>
+<a name="range.concepts.single_pass_range.h5"></a>
+        <span><a name="range.concepts.single_pass_range.complexity_guarantees"></a></span><a class="link" href="single_pass_range.html#range.concepts.single_pass_range.complexity_guarantees">Complexity
         guarantees</a>
       </h5>
 <p>
@@ -275,9 +275,9 @@
         constant time. For most practical purposes, one can expect both to be amortized
         constant time.
       </p>
-<a name="range.concepts.single_pass_range.invariants"></a><h5>
-<a name="id649567"></a>
-        <a class="link" href="single_pass_range.html#range.concepts.single_pass_range.invariants">Invariants</a>
+<h5>
+<a name="range.concepts.single_pass_range.h6"></a>
+        <span><a name="range.concepts.single_pass_range.invariants"></a></span><a class="link" href="single_pass_range.html#range.concepts.single_pass_range.invariants">Invariants</a>
       </h5>
 <div class="informaltable"><table class="table">
 <colgroup>
@@ -315,9 +315,10 @@
 </tr>
 </tbody>
 </table></div>
-<a name="range.concepts.single_pass_range.see_also"></a><h5>
-<a name="id649823"></a>
-        <a class="link" href="single_pass_range.html#range.concepts.single_pass_range.see_also">See also</a>
+<h5>
+<a name="range.concepts.single_pass_range.h7"></a>
+        <span><a name="range.concepts.single_pass_range.see_also"></a></span><a class="link" href="single_pass_range.html#range.concepts.single_pass_range.see_also">See
+        also</a>
       </h5>
 <p>
         <a class="link" href="../reference/extending.html" title="Extending the library">Extending the library for UDTs</a>
@@ -336,7 +337,8 @@
 </div>
 <table xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" width="100%"><tr>
 <td align="left"></td>
-<td align="right"><div class="copyright-footer">Copyright &#169; 2003 -2010 Thorsten Ottosen, Neil Groves<p>
+<td align="right"><div class="copyright-footer">Copyright &#169; 2003-2010 Thorsten Ottosen,
+      Neil Groves<p>
         Distributed under the Boost Software License, Version 1.0. (See accompanying
         file LICENSE_1_0.txt or copy at <a href="http://www.boost.org/LICENSE_1_0.txt" target="_top">http://www.boost.org/LICENSE_1_0.txt</a>)
       </p>
diff --git a/doc/html/range/examples.html b/doc/html/range/examples.html
index 5a4201b..9972fd5 100644
--- a/doc/html/range/examples.html
+++ b/doc/html/range/examples.html
@@ -22,7 +22,7 @@
 <div class="spirit-nav">
 <a accesskey="p" href="headers/algorithm_ext.html"><img src="../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../index.html"><img src="../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../index.html"><img src="../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="mfc_atl.html"><img src="../../../../../doc/src/images/next.png" alt="Next"></a>
 </div>
-<div class="section">
+<div class="section range_examples">
 <div class="titlepage"><div><div><h2 class="title" style="clear: both">
 <a name="range.examples"></a><a class="link" href="examples.html" title="Examples">Examples</a>
 </h2></div></div></div>
@@ -60,7 +60,8 @@
 </div>
 <table xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" width="100%"><tr>
 <td align="left"></td>
-<td align="right"><div class="copyright-footer">Copyright &#169; 2003 -2010 Thorsten Ottosen, Neil Groves<p>
+<td align="right"><div class="copyright-footer">Copyright &#169; 2003-2010 Thorsten Ottosen,
+      Neil Groves<p>
         Distributed under the Boost Software License, Version 1.0. (See accompanying
         file LICENSE_1_0.txt or copy at <a href="http://www.boost.org/LICENSE_1_0.txt" target="_top">http://www.boost.org/LICENSE_1_0.txt</a>)
       </p>
diff --git a/doc/html/range/faq.html b/doc/html/range/faq.html
index 6a689f1..0675a8b 100644
--- a/doc/html/range/faq.html
+++ b/doc/html/range/faq.html
@@ -22,7 +22,7 @@
 <div class="spirit-nav">
 <a accesskey="p" href="portability.html"><img src="../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../index.html"><img src="../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../index.html"><img src="../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="history_ack.html"><img src="../../../../../doc/src/images/next.png" alt="Next"></a>
 </div>
-<div class="section">
+<div class="section range_faq">
 <div class="titlepage"><div><div><h2 class="title" style="clear: both">
 <a name="range.faq"></a><a class="link" href="faq.html" title="FAQ">FAQ</a>
 </h2></div></div></div>
@@ -75,7 +75,8 @@
 </div>
 <table xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" width="100%"><tr>
 <td align="left"></td>
-<td align="right"><div class="copyright-footer">Copyright &#169; 2003 -2010 Thorsten Ottosen, Neil Groves<p>
+<td align="right"><div class="copyright-footer">Copyright &#169; 2003-2010 Thorsten Ottosen,
+      Neil Groves<p>
         Distributed under the Boost Software License, Version 1.0. (See accompanying
         file LICENSE_1_0.txt or copy at <a href="http://www.boost.org/LICENSE_1_0.txt" target="_top">http://www.boost.org/LICENSE_1_0.txt</a>)
       </p>
diff --git a/doc/html/range/headers.html b/doc/html/range/headers.html
index b4ce7e3..fb2c7d0 100644
--- a/doc/html/range/headers.html
+++ b/doc/html/range/headers.html
@@ -22,7 +22,7 @@
 <div class="spirit-nav">
 <a accesskey="p" href="style_guide.html"><img src="../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../index.html"><img src="../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../index.html"><img src="../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="headers/general.html"><img src="../../../../../doc/src/images/next.png" alt="Next"></a>
 </div>
-<div class="section">
+<div class="section range_headers">
 <div class="titlepage"><div><div><h2 class="title" style="clear: both">
 <a name="range.headers"></a><a class="link" href="headers.html" title="Library Headers">Library Headers</a>
 </h2></div></div></div>
@@ -35,7 +35,8 @@
 </div>
 <table xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" width="100%"><tr>
 <td align="left"></td>
-<td align="right"><div class="copyright-footer">Copyright &#169; 2003 -2010 Thorsten Ottosen, Neil Groves<p>
+<td align="right"><div class="copyright-footer">Copyright &#169; 2003-2010 Thorsten Ottosen,
+      Neil Groves<p>
         Distributed under the Boost Software License, Version 1.0. (See accompanying
         file LICENSE_1_0.txt or copy at <a href="http://www.boost.org/LICENSE_1_0.txt" target="_top">http://www.boost.org/LICENSE_1_0.txt</a>)
       </p>
diff --git a/doc/html/range/headers/adaptors.html b/doc/html/range/headers/adaptors.html
index 1d2952e..c028d2d 100644
--- a/doc/html/range/headers/adaptors.html
+++ b/doc/html/range/headers/adaptors.html
@@ -22,7 +22,7 @@
 <div class="spirit-nav">
 <a accesskey="p" href="general.html"><img src="../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../headers.html"><img src="../../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../../index.html"><img src="../../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="algorithm.html"><img src="../../../../../../doc/src/images/next.png" alt="Next"></a>
 </div>
-<div class="section">
+<div class="section range_headers_adaptors">
 <div class="titlepage"><div><div><h3 class="title">
 <a name="range.headers.adaptors"></a><a class="link" href="adaptors.html" title="Adaptors">Adaptors</a>
 </h3></div></div></div>
@@ -218,7 +218,8 @@
 </div>
 <table xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" width="100%"><tr>
 <td align="left"></td>
-<td align="right"><div class="copyright-footer">Copyright &#169; 2003 -2010 Thorsten Ottosen, Neil Groves<p>
+<td align="right"><div class="copyright-footer">Copyright &#169; 2003-2010 Thorsten Ottosen,
+      Neil Groves<p>
         Distributed under the Boost Software License, Version 1.0. (See accompanying
         file LICENSE_1_0.txt or copy at <a href="http://www.boost.org/LICENSE_1_0.txt" target="_top">http://www.boost.org/LICENSE_1_0.txt</a>)
       </p>
diff --git a/doc/html/range/headers/algorithm.html b/doc/html/range/headers/algorithm.html
index 40bac90..d410f82 100644
--- a/doc/html/range/headers/algorithm.html
+++ b/doc/html/range/headers/algorithm.html
@@ -22,7 +22,7 @@
 <div class="spirit-nav">
 <a accesskey="p" href="adaptors.html"><img src="../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../headers.html"><img src="../../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../../index.html"><img src="../../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="algorithm_ext.html"><img src="../../../../../../doc/src/images/next.png" alt="Next"></a>
 </div>
-<div class="section">
+<div class="section range_headers_algorithm">
 <div class="titlepage"><div><div><h3 class="title">
 <a name="range.headers.algorithm"></a><a class="link" href="algorithm.html" title="Algorithm">Algorithm</a>
 </h3></div></div></div>
@@ -669,7 +669,8 @@
 </div>
 <table xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" width="100%"><tr>
 <td align="left"></td>
-<td align="right"><div class="copyright-footer">Copyright &#169; 2003 -2010 Thorsten Ottosen, Neil Groves<p>
+<td align="right"><div class="copyright-footer">Copyright &#169; 2003-2010 Thorsten Ottosen,
+      Neil Groves<p>
         Distributed under the Boost Software License, Version 1.0. (See accompanying
         file LICENSE_1_0.txt or copy at <a href="http://www.boost.org/LICENSE_1_0.txt" target="_top">http://www.boost.org/LICENSE_1_0.txt</a>)
       </p>
diff --git a/doc/html/range/headers/algorithm_ext.html b/doc/html/range/headers/algorithm_ext.html
index 4a62339..7721f7a 100644
--- a/doc/html/range/headers/algorithm_ext.html
+++ b/doc/html/range/headers/algorithm_ext.html
@@ -22,7 +22,7 @@
 <div class="spirit-nav">
 <a accesskey="p" href="algorithm.html"><img src="../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../headers.html"><img src="../../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../../index.html"><img src="../../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="../examples.html"><img src="../../../../../../doc/src/images/next.png" alt="Next"></a>
 </div>
-<div class="section">
+<div class="section range_headers_algorithm_ext">
 <div class="titlepage"><div><div><h3 class="title">
 <a name="range.headers.algorithm_ext"></a><a class="link" href="algorithm_ext.html" title="Algorithm Extensions">Algorithm Extensions</a>
 </h3></div></div></div>
@@ -157,7 +157,8 @@
 </div>
 <table xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" width="100%"><tr>
 <td align="left"></td>
-<td align="right"><div class="copyright-footer">Copyright &#169; 2003 -2010 Thorsten Ottosen, Neil Groves<p>
+<td align="right"><div class="copyright-footer">Copyright &#169; 2003-2010 Thorsten Ottosen,
+      Neil Groves<p>
         Distributed under the Boost Software License, Version 1.0. (See accompanying
         file LICENSE_1_0.txt or copy at <a href="http://www.boost.org/LICENSE_1_0.txt" target="_top">http://www.boost.org/LICENSE_1_0.txt</a>)
       </p>
diff --git a/doc/html/range/headers/general.html b/doc/html/range/headers/general.html
index ea122b8..7020f7a 100644
--- a/doc/html/range/headers/general.html
+++ b/doc/html/range/headers/general.html
@@ -22,7 +22,7 @@
 <div class="spirit-nav">
 <a accesskey="p" href="../headers.html"><img src="../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../headers.html"><img src="../../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../../index.html"><img src="../../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="adaptors.html"><img src="../../../../../../doc/src/images/next.png" alt="Next"></a>
 </div>
-<div class="section">
+<div class="section range_headers_general">
 <div class="titlepage"><div><div><h3 class="title">
 <a name="range.headers.general"></a><a class="link" href="general.html" title="General">General</a>
 </h3></div></div></div>
@@ -537,7 +537,8 @@
 </div>
 <table xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" width="100%"><tr>
 <td align="left"></td>
-<td align="right"><div class="copyright-footer">Copyright &#169; 2003 -2010 Thorsten Ottosen, Neil Groves<p>
+<td align="right"><div class="copyright-footer">Copyright &#169; 2003-2010 Thorsten Ottosen,
+      Neil Groves<p>
         Distributed under the Boost Software License, Version 1.0. (See accompanying
         file LICENSE_1_0.txt or copy at <a href="http://www.boost.org/LICENSE_1_0.txt" target="_top">http://www.boost.org/LICENSE_1_0.txt</a>)
       </p>
diff --git a/doc/html/range/history_ack.html b/doc/html/range/history_ack.html
index 49355b5..f3f974e 100644
--- a/doc/html/range/history_ack.html
+++ b/doc/html/range/history_ack.html
@@ -21,14 +21,14 @@
 <div class="spirit-nav">
 <a accesskey="p" href="faq.html"><img src="../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../index.html"><img src="../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../index.html"><img src="../../../../../doc/src/images/home.png" alt="Home"></a>
 </div>
-<div class="section">
+<div class="section range_history_ack">
 <div class="titlepage"><div><div><h2 class="title" style="clear: both">
 <a name="range.history_ack"></a><a class="link" href="history_ack.html" title="History and Acknowledgement">History and Acknowledgement</a>
 </h2></div></div></div>
-<a name="range.history_ack.version_1___before_boost_1_43"></a><h4>
-<a name="id786758"></a>
-      <a class="link" href="history_ack.html#range.history_ack.version_1___before_boost_1_43">Version 1 -
-      before Boost 1.43</a>
+<h4>
+<a name="range.history_ack.h0"></a>
+      <span><a name="range.history_ack.version_1___before_boost_1_43"></a></span><a class="link" href="history_ack.html#range.history_ack.version_1___before_boost_1_43">Version
+      1 - before Boost 1.43</a>
     </h4>
 <p>
       The library have been under way for a long time. Dietmar K&#252;hl originally intended
@@ -78,9 +78,9 @@
 <p>
       The concept checks and their documentation was provided by Daniel Walker.
     </p>
-<a name="range.history_ack.version_2___boost_1_43_and_beyond"></a><h4>
-<a name="id786859"></a>
-      <a class="link" href="history_ack.html#range.history_ack.version_2___boost_1_43_and_beyond">Version
+<h4>
+<a name="range.history_ack.h1"></a>
+      <span><a name="range.history_ack.version_2___boost_1_43_and_beyond"></a></span><a class="link" href="history_ack.html#range.history_ack.version_2___boost_1_43_and_beyond">Version
       2 - Boost 1.43 and beyond</a>
     </h4>
 <p>
@@ -142,7 +142,8 @@
 </div>
 <table xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" width="100%"><tr>
 <td align="left"></td>
-<td align="right"><div class="copyright-footer">Copyright &#169; 2003 -2010 Thorsten Ottosen, Neil Groves<p>
+<td align="right"><div class="copyright-footer">Copyright &#169; 2003-2010 Thorsten Ottosen,
+      Neil Groves<p>
         Distributed under the Boost Software License, Version 1.0. (See accompanying
         file LICENSE_1_0.txt or copy at <a href="http://www.boost.org/LICENSE_1_0.txt" target="_top">http://www.boost.org/LICENSE_1_0.txt</a>)
       </p>
diff --git a/doc/html/range/introduction.html b/doc/html/range/introduction.html
index a68d315..0ebd7bd 100644
--- a/doc/html/range/introduction.html
+++ b/doc/html/range/introduction.html
@@ -22,7 +22,7 @@
 <div class="spirit-nav">
 <a accesskey="p" href="../index.html"><img src="../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../index.html"><img src="../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../index.html"><img src="../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="concepts.html"><img src="../../../../../doc/src/images/next.png" alt="Next"></a>
 </div>
-<div class="section">
+<div class="section range_introduction">
 <div class="titlepage"><div><div><h2 class="title" style="clear: both">
 <a name="range.introduction"></a><a class="link" href="introduction.html" title="Introduction">Introduction</a>
 </h2></div></div></div>
@@ -69,13 +69,12 @@
           arrays?)
         </li>
 </ul></div>
-<a name="range.introduction.example___iterate_over_the_values_in_a_map"></a><h4>
-<a name="id607240"></a>
-      <a class="link" href="introduction.html#range.introduction.example___iterate_over_the_values_in_a_map">Example
+<h4>
+<a name="range.introduction.h0"></a>
+      <span><a name="range.introduction.example___iterate_over_the_values_in_a_map"></a></span><a class="link" href="introduction.html#range.introduction.example___iterate_over_the_values_in_a_map">Example
       - Iterate over the values in a map</a>
     </h4>
 <p>
-      
 </p>
 <pre class="programlisting"><span class="keyword">using</span> <span class="keyword">namespace</span> <span class="identifier">boost</span><span class="special">;</span>
 <span class="keyword">using</span> <span class="keyword">namespace</span> <span class="identifier">boost</span><span class="special">::</span><span class="identifier">adaptors</span><span class="special">;</span>
@@ -83,13 +82,12 @@
 </pre>
 <p>
     </p>
-<a name="range.introduction.example___iterate_over_the_keys_in_a_map"></a><h4>
-<a name="id607360"></a>
-      <a class="link" href="introduction.html#range.introduction.example___iterate_over_the_keys_in_a_map">Example
+<h4>
+<a name="range.introduction.h1"></a>
+      <span><a name="range.introduction.example___iterate_over_the_keys_in_a_map"></a></span><a class="link" href="introduction.html#range.introduction.example___iterate_over_the_keys_in_a_map">Example
       - Iterate over the keys in a map</a>
     </h4>
 <p>
-      
 </p>
 <pre class="programlisting"><span class="keyword">using</span> <span class="keyword">namespace</span> <span class="identifier">boost</span><span class="special">;</span>
 <span class="keyword">using</span> <span class="keyword">namespace</span> <span class="identifier">boost</span><span class="special">::</span><span class="identifier">adaptors</span><span class="special">;</span>
@@ -97,25 +95,25 @@
 </pre>
 <p>
     </p>
-<a name="range.introduction.example___push_the_even_values_from_a_map_in_reverse_order_into_the_container__code__phrase_role__identifier__target__phrase___code_"></a><h4>
-<a name="id648314"></a>
-      <a class="link" href="introduction.html#range.introduction.example___push_the_even_values_from_a_map_in_reverse_order_into_the_container__code__phrase_role__identifier__target__phrase___code_">Example
+<h4>
+<a name="range.introduction.h2"></a>
+      <span><a name="range.introduction.example___push_the_even_values_from_a_map_in_reverse_order_into_the_container__code__phrase_role__identifier__target__phrase___code_"></a></span><a class="link" href="introduction.html#range.introduction.example___push_the_even_values_from_a_map_in_reverse_order_into_the_container__code__phrase_role__identifier__target__phrase___code_">Example
       - Push the even values from a map in reverse order into the container <code class="computeroutput"><span class="identifier">target</span></code></a>
     </h4>
 <p>
-      
 </p>
 <pre class="programlisting"><span class="keyword">using</span> <span class="keyword">namespace</span> <span class="identifier">boost</span><span class="special">;</span>
 <span class="keyword">using</span> <span class="keyword">namespace</span> <span class="identifier">boost</span><span class="special">::</span><span class="identifier">adaptors</span><span class="special">;</span>
-<span class="comment">// Assume that is_even is a predicate that has been implemented elsewhere...
-</span><span class="identifier">push_back</span><span class="special">(</span><span class="identifier">target</span><span class="special">,</span> <span class="identifier">my_map</span> <span class="special">|</span> <span class="identifier">map_values</span> <span class="special">|</span> <span class="identifier">filtered</span><span class="special">(</span><span class="identifier">is_even</span><span class="special">())</span> <span class="special">|</span> <span class="identifier">reversed</span><span class="special">);</span>
+<span class="comment">// Assume that is_even is a predicate that has been implemented elsewhere...</span>
+<span class="identifier">push_back</span><span class="special">(</span><span class="identifier">target</span><span class="special">,</span> <span class="identifier">my_map</span> <span class="special">|</span> <span class="identifier">map_values</span> <span class="special">|</span> <span class="identifier">filtered</span><span class="special">(</span><span class="identifier">is_even</span><span class="special">())</span> <span class="special">|</span> <span class="identifier">reversed</span><span class="special">);</span>
 </pre>
 <p>
     </p>
 </div>
 <table xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" width="100%"><tr>
 <td align="left"></td>
-<td align="right"><div class="copyright-footer">Copyright &#169; 2003 -2010 Thorsten Ottosen, Neil Groves<p>
+<td align="right"><div class="copyright-footer">Copyright &#169; 2003-2010 Thorsten Ottosen,
+      Neil Groves<p>
         Distributed under the Boost Software License, Version 1.0. (See accompanying
         file LICENSE_1_0.txt or copy at <a href="http://www.boost.org/LICENSE_1_0.txt" target="_top">http://www.boost.org/LICENSE_1_0.txt</a>)
       </p>
diff --git a/doc/html/range/mfc_atl.html b/doc/html/range/mfc_atl.html
index 2ca51fd..85cbe61 100644
--- a/doc/html/range/mfc_atl.html
+++ b/doc/html/range/mfc_atl.html
@@ -22,7 +22,7 @@
 <div class="spirit-nav">
 <a accesskey="p" href="examples.html"><img src="../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../index.html"><img src="../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../index.html"><img src="../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="mfc_atl/requirements.html"><img src="../../../../../doc/src/images/next.png" alt="Next"></a>
 </div>
-<div class="section">
+<div class="section range_mfc_atl">
 <div class="titlepage"><div><div><h2 class="title" style="clear: both">
 <a name="range.mfc_atl"></a><a class="link" href="mfc_atl.html" title="MFC/ATL (courtesy of Shunsuke Sogame)">MFC/ATL (courtesy of Shunsuke Sogame)</a>
 </h2></div></div></div>
@@ -33,9 +33,9 @@
 <dt><span class="section"><a href="mfc_atl/const_ranges.html">const Ranges</a></span></dt>
 <dt><span class="section"><a href="mfc_atl/references.html">References</a></span></dt>
 </dl></div>
-<a name="range.mfc_atl.introduction"></a><h5>
-<a name="id780286"></a>
-      <a class="link" href="mfc_atl.html#range.mfc_atl.introduction">Introduction</a>
+<h5>
+<a name="range.mfc_atl.h0"></a>
+      <span><a name="range.mfc_atl.introduction"></a></span><a class="link" href="mfc_atl.html#range.mfc_atl.introduction">Introduction</a>
     </h5>
 <p>
       This implementation was kindly donated by Shunsuke Sogame. This header adapts
@@ -99,16 +99,15 @@
 </tr>
 </tbody>
 </table></div>
-<a name="range.mfc_atl.overview"></a><h5>
-<a name="id780420"></a>
-      <a class="link" href="mfc_atl.html#range.mfc_atl.overview">Overview</a>
+<h5>
+<a name="range.mfc_atl.h1"></a>
+      <span><a name="range.mfc_atl.overview"></a></span><a class="link" href="mfc_atl.html#range.mfc_atl.overview">Overview</a>
     </h5>
 <p>
       Boost.Range MFC/ATL Extension provides Boost.Range support for MFC/ATL collection
       and string types.
     </p>
 <p>
-      
 </p>
 <pre class="programlisting"><span class="identifier">CTypedPtrArray</span><span class="special">&lt;</span><span class="identifier">CPtrArray</span><span class="special">,</span> <span class="identifier">CList</span><span class="special">&lt;</span><span class="identifier">CString</span><span class="special">&gt;</span> <span class="special">*&gt;</span> <span class="identifier">myArray</span><span class="special">;</span>
 <span class="special">...</span>
@@ -127,7 +126,8 @@
 </div>
 <table xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" width="100%"><tr>
 <td align="left"></td>
-<td align="right"><div class="copyright-footer">Copyright &#169; 2003 -2010 Thorsten Ottosen, Neil Groves<p>
+<td align="right"><div class="copyright-footer">Copyright &#169; 2003-2010 Thorsten Ottosen,
+      Neil Groves<p>
         Distributed under the Boost Software License, Version 1.0. (See accompanying
         file LICENSE_1_0.txt or copy at <a href="http://www.boost.org/LICENSE_1_0.txt" target="_top">http://www.boost.org/LICENSE_1_0.txt</a>)
       </p>
diff --git a/doc/html/range/mfc_atl/atl_ranges.html b/doc/html/range/mfc_atl/atl_ranges.html
index aec5af5..c93ae75 100644
--- a/doc/html/range/mfc_atl/atl_ranges.html
+++ b/doc/html/range/mfc_atl/atl_ranges.html
@@ -22,7 +22,7 @@
 <div class="spirit-nav">
 <a accesskey="p" href="mfc_ranges.html"><img src="../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../mfc_atl.html"><img src="../../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../../index.html"><img src="../../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="const_ranges.html"><img src="../../../../../../doc/src/images/next.png" alt="Next"></a>
 </div>
-<div class="section">
+<div class="section range_mfc_atl_atl_ranges">
 <div class="titlepage"><div><div><h3 class="title">
 <a name="range.mfc_atl.atl_ranges"></a><a class="link" href="atl_ranges.html" title="ATL Ranges">ATL Ranges</a>
 </h3></div></div></div>
@@ -360,7 +360,8 @@
 </div>
 <table xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" width="100%"><tr>
 <td align="left"></td>
-<td align="right"><div class="copyright-footer">Copyright &#169; 2003 -2010 Thorsten Ottosen, Neil Groves<p>
+<td align="right"><div class="copyright-footer">Copyright &#169; 2003-2010 Thorsten Ottosen,
+      Neil Groves<p>
         Distributed under the Boost Software License, Version 1.0. (See accompanying
         file LICENSE_1_0.txt or copy at <a href="http://www.boost.org/LICENSE_1_0.txt" target="_top">http://www.boost.org/LICENSE_1_0.txt</a>)
       </p>
diff --git a/doc/html/range/mfc_atl/const_ranges.html b/doc/html/range/mfc_atl/const_ranges.html
index d833d83..efd4b9f 100644
--- a/doc/html/range/mfc_atl/const_ranges.html
+++ b/doc/html/range/mfc_atl/const_ranges.html
@@ -22,7 +22,7 @@
 <div class="spirit-nav">
 <a accesskey="p" href="atl_ranges.html"><img src="../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../mfc_atl.html"><img src="../../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../../index.html"><img src="../../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="references.html"><img src="../../../../../../doc/src/images/next.png" alt="Next"></a>
 </div>
-<div class="section">
+<div class="section range_mfc_atl_const_ranges">
 <div class="titlepage"><div><div><h3 class="title">
 <a name="range.mfc_atl.const_ranges"></a><a class="link" href="const_ranges.html" title="const Ranges">const Ranges</a>
 </h3></div></div></div>
@@ -33,7 +33,6 @@
         be the same as <code class="computeroutput"><span class="identifier">range_reference</span><span class="special">&lt;</span><span class="identifier">Range</span><span class="special">&gt;::</span><span class="identifier">type</span></code>.
       </p>
 <p>
-        
 </p>
 <pre class="programlisting"><span class="keyword">if</span> <span class="special">(</span><span class="identifier">Range</span> <span class="identifier">is</span> <span class="identifier">CObArray</span> <span class="special">||</span> <span class="identifier">Range</span> <span class="identifier">is</span> <span class="identifier">CObList</span><span class="special">)</span>
     <span class="keyword">return</span> <span class="identifier">CObject</span> <span class="keyword">const</span> <span class="special">*</span> <span class="special">&amp;</span>
@@ -111,7 +110,8 @@
 </div>
 <table xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" width="100%"><tr>
 <td align="left"></td>
-<td align="right"><div class="copyright-footer">Copyright &#169; 2003 -2010 Thorsten Ottosen, Neil Groves<p>
+<td align="right"><div class="copyright-footer">Copyright &#169; 2003-2010 Thorsten Ottosen,
+      Neil Groves<p>
         Distributed under the Boost Software License, Version 1.0. (See accompanying
         file LICENSE_1_0.txt or copy at <a href="http://www.boost.org/LICENSE_1_0.txt" target="_top">http://www.boost.org/LICENSE_1_0.txt</a>)
       </p>
diff --git a/doc/html/range/mfc_atl/mfc_ranges.html b/doc/html/range/mfc_atl/mfc_ranges.html
index a757cf5..ba05b74 100644
--- a/doc/html/range/mfc_atl/mfc_ranges.html
+++ b/doc/html/range/mfc_atl/mfc_ranges.html
@@ -22,7 +22,7 @@
 <div class="spirit-nav">
 <a accesskey="p" href="requirements.html"><img src="../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../mfc_atl.html"><img src="../../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../../index.html"><img src="../../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="atl_ranges.html"><img src="../../../../../../doc/src/images/next.png" alt="Next"></a>
 </div>
-<div class="section">
+<div class="section range_mfc_atl_mfc_ranges">
 <div class="titlepage"><div><div><h3 class="title">
 <a name="range.mfc_atl.mfc_ranges"></a><a class="link" href="mfc_ranges.html" title="MFC Ranges">MFC Ranges</a>
 </h3></div></div></div>
@@ -466,7 +466,8 @@
 </div>
 <table xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" width="100%"><tr>
 <td align="left"></td>
-<td align="right"><div class="copyright-footer">Copyright &#169; 2003 -2010 Thorsten Ottosen, Neil Groves<p>
+<td align="right"><div class="copyright-footer">Copyright &#169; 2003-2010 Thorsten Ottosen,
+      Neil Groves<p>
         Distributed under the Boost Software License, Version 1.0. (See accompanying
         file LICENSE_1_0.txt or copy at <a href="http://www.boost.org/LICENSE_1_0.txt" target="_top">http://www.boost.org/LICENSE_1_0.txt</a>)
       </p>
diff --git a/doc/html/range/mfc_atl/references.html b/doc/html/range/mfc_atl/references.html
index a09ba0a..5e24f31 100644
--- a/doc/html/range/mfc_atl/references.html
+++ b/doc/html/range/mfc_atl/references.html
@@ -22,7 +22,7 @@
 <div class="spirit-nav">
 <a accesskey="p" href="const_ranges.html"><img src="../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../mfc_atl.html"><img src="../../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../../index.html"><img src="../../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="../upgrade.html"><img src="../../../../../../doc/src/images/next.png" alt="Next"></a>
 </div>
-<div class="section">
+<div class="section range_mfc_atl_references">
 <div class="titlepage"><div><div><h3 class="title">
 <a name="range.mfc_atl.references"></a><a class="link" href="references.html" title="References">References</a>
 </h3></div></div></div>
@@ -42,7 +42,8 @@
 </div>
 <table xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" width="100%"><tr>
 <td align="left"></td>
-<td align="right"><div class="copyright-footer">Copyright &#169; 2003 -2010 Thorsten Ottosen, Neil Groves<p>
+<td align="right"><div class="copyright-footer">Copyright &#169; 2003-2010 Thorsten Ottosen,
+      Neil Groves<p>
         Distributed under the Boost Software License, Version 1.0. (See accompanying
         file LICENSE_1_0.txt or copy at <a href="http://www.boost.org/LICENSE_1_0.txt" target="_top">http://www.boost.org/LICENSE_1_0.txt</a>)
       </p>
diff --git a/doc/html/range/mfc_atl/requirements.html b/doc/html/range/mfc_atl/requirements.html
index f171d85..347c9e4 100644
--- a/doc/html/range/mfc_atl/requirements.html
+++ b/doc/html/range/mfc_atl/requirements.html
@@ -22,7 +22,7 @@
 <div class="spirit-nav">
 <a accesskey="p" href="../mfc_atl.html"><img src="../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../mfc_atl.html"><img src="../../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../../index.html"><img src="../../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="mfc_ranges.html"><img src="../../../../../../doc/src/images/next.png" alt="Next"></a>
 </div>
-<div class="section">
+<div class="section range_mfc_atl_requirements">
 <div class="titlepage"><div><div><h3 class="title">
 <a name="range.mfc_atl.requirements"></a><a class="link" href="requirements.html" title="Requirements">Requirements</a>
 </h3></div></div></div>
@@ -37,7 +37,8 @@
 </div>
 <table xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" width="100%"><tr>
 <td align="left"></td>
-<td align="right"><div class="copyright-footer">Copyright &#169; 2003 -2010 Thorsten Ottosen, Neil Groves<p>
+<td align="right"><div class="copyright-footer">Copyright &#169; 2003-2010 Thorsten Ottosen,
+      Neil Groves<p>
         Distributed under the Boost Software License, Version 1.0. (See accompanying
         file LICENSE_1_0.txt or copy at <a href="http://www.boost.org/LICENSE_1_0.txt" target="_top">http://www.boost.org/LICENSE_1_0.txt</a>)
       </p>
diff --git a/doc/html/range/portability.html b/doc/html/range/portability.html
index 8f24282..47e1ec3 100644
--- a/doc/html/range/portability.html
+++ b/doc/html/range/portability.html
@@ -22,7 +22,7 @@
 <div class="spirit-nav">
 <a accesskey="p" href="upgrade/upgrade_from_1_34.html"><img src="../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../index.html"><img src="../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../index.html"><img src="../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="faq.html"><img src="../../../../../doc/src/images/next.png" alt="Next"></a>
 </div>
-<div class="section">
+<div class="section range_portability">
 <div class="titlepage"><div><div><h2 class="title" style="clear: both">
 <a name="range.portability"></a><a class="link" href="portability.html" title="Portability">Portability</a>
 </h2></div></div></div>
@@ -62,24 +62,23 @@
           rvalue problems,
         </li>
 <li class="listitem">
-<p class="simpara">
           do not rely on ADL:
-        </p>
-<div class="itemizedlist"><ul class="itemizedlist" type="disc">
+          <div class="itemizedlist"><ul class="itemizedlist" type="disc">
 <li class="listitem">
-              if you overload functions, include that header before the headers in
-              this library,
-            </li>
+                if you overload functions, include that header before the headers
+                in this library,
+              </li>
 <li class="listitem">
-              put all overloads in namespace boost.
-            </li>
+                put all overloads in namespace boost.
+              </li>
 </ul></div>
-</li>
+        </li>
 </ol></div>
 </div>
 <table xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" width="100%"><tr>
 <td align="left"></td>
-<td align="right"><div class="copyright-footer">Copyright &#169; 2003 -2010 Thorsten Ottosen, Neil Groves<p>
+<td align="right"><div class="copyright-footer">Copyright &#169; 2003-2010 Thorsten Ottosen,
+      Neil Groves<p>
         Distributed under the Boost Software License, Version 1.0. (See accompanying
         file LICENSE_1_0.txt or copy at <a href="http://www.boost.org/LICENSE_1_0.txt" target="_top">http://www.boost.org/LICENSE_1_0.txt</a>)
       </p>
diff --git a/doc/html/range/reference.html b/doc/html/range/reference.html
index 50f6ed0..c79b01c 100644
--- a/doc/html/range/reference.html
+++ b/doc/html/range/reference.html
@@ -22,7 +22,7 @@
 <div class="spirit-nav">
 <a accesskey="p" href="concepts/concept_checking.html"><img src="../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../index.html"><img src="../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../index.html"><img src="../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="reference/overview.html"><img src="../../../../../doc/src/images/next.png" alt="Next"></a>
 </div>
-<div class="section">
+<div class="section range_reference">
 <div class="titlepage"><div><div><h2 class="title" style="clear: both">
 <a name="range.reference"></a><a class="link" href="reference.html" title="Reference">Reference</a>
 </h2></div></div></div>
@@ -82,7 +82,8 @@
 </div>
 <table xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" width="100%"><tr>
 <td align="left"></td>
-<td align="right"><div class="copyright-footer">Copyright &#169; 2003 -2010 Thorsten Ottosen, Neil Groves<p>
+<td align="right"><div class="copyright-footer">Copyright &#169; 2003-2010 Thorsten Ottosen,
+      Neil Groves<p>
         Distributed under the Boost Software License, Version 1.0. (See accompanying
         file LICENSE_1_0.txt or copy at <a href="http://www.boost.org/LICENSE_1_0.txt" target="_top">http://www.boost.org/LICENSE_1_0.txt</a>)
       </p>
diff --git a/doc/html/range/reference/adaptors.html b/doc/html/range/reference/adaptors.html
index 004364e..72cf595 100644
--- a/doc/html/range/reference/adaptors.html
+++ b/doc/html/range/reference/adaptors.html
@@ -22,7 +22,7 @@
 <div class="spirit-nav">
 <a accesskey="p" href="concept_implementation/semantics/functions.html"><img src="../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../reference.html"><img src="../../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../../index.html"><img src="../../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="adaptors/introduction.html"><img src="../../../../../../doc/src/images/next.png" alt="Next"></a>
 </div>
-<div class="section">
+<div class="section range_reference_adaptors">
 <div class="titlepage"><div><div><h3 class="title">
 <a name="range.reference.adaptors"></a><a class="link" href="adaptors.html" title="Range Adaptors">Range Adaptors</a>
 </h3></div></div></div>
@@ -36,7 +36,8 @@
 </div>
 <table xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" width="100%"><tr>
 <td align="left"></td>
-<td align="right"><div class="copyright-footer">Copyright &#169; 2003 -2010 Thorsten Ottosen, Neil Groves<p>
+<td align="right"><div class="copyright-footer">Copyright &#169; 2003-2010 Thorsten Ottosen,
+      Neil Groves<p>
         Distributed under the Boost Software License, Version 1.0. (See accompanying
         file LICENSE_1_0.txt or copy at <a href="http://www.boost.org/LICENSE_1_0.txt" target="_top">http://www.boost.org/LICENSE_1_0.txt</a>)
       </p>
diff --git a/doc/html/range/reference/adaptors/general_requirements.html b/doc/html/range/reference/adaptors/general_requirements.html
index 8078038..7ec8c7d 100644
--- a/doc/html/range/reference/adaptors/general_requirements.html
+++ b/doc/html/range/reference/adaptors/general_requirements.html
@@ -22,7 +22,7 @@
 <div class="spirit-nav">
 <a accesskey="p" href="introduction.html"><img src="../../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../adaptors.html"><img src="../../../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../../../index.html"><img src="../../../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="reference.html"><img src="../../../../../../../doc/src/images/next.png" alt="Next"></a>
 </div>
-<div class="section">
+<div class="section range_reference_adaptors_general_requirements">
 <div class="titlepage"><div><div><h4 class="title">
 <a name="range.reference.adaptors.general_requirements"></a><a class="link" href="general_requirements.html" title="General Requirements">General
         Requirements</a>
@@ -87,7 +87,7 @@
           regardless of the input.
         </p>
 <p>
-          Furthermore, the following rules apply to any expression of the form 
+          Furthermore, the following rules apply to any expression of the form
 </p>
 <pre class="programlisting"><span class="identifier">rng</span> <span class="special">|</span> <span class="identifier">boost</span><span class="special">::</span><span class="identifier">adaptors</span><span class="special">::</span><span class="identifier">adaptor_generator</span>
 </pre>
@@ -127,7 +127,8 @@
 </div>
 <table xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" width="100%"><tr>
 <td align="left"></td>
-<td align="right"><div class="copyright-footer">Copyright &#169; 2003 -2010 Thorsten Ottosen, Neil Groves<p>
+<td align="right"><div class="copyright-footer">Copyright &#169; 2003-2010 Thorsten Ottosen,
+      Neil Groves<p>
         Distributed under the Boost Software License, Version 1.0. (See accompanying
         file LICENSE_1_0.txt or copy at <a href="http://www.boost.org/LICENSE_1_0.txt" target="_top">http://www.boost.org/LICENSE_1_0.txt</a>)
       </p>
diff --git a/doc/html/range/reference/adaptors/introduction.html b/doc/html/range/reference/adaptors/introduction.html
index 4991499..3253f5c 100644
--- a/doc/html/range/reference/adaptors/introduction.html
+++ b/doc/html/range/reference/adaptors/introduction.html
@@ -22,7 +22,7 @@
 <div class="spirit-nav">
 <a accesskey="p" href="../adaptors.html"><img src="../../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../adaptors.html"><img src="../../../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../../../index.html"><img src="../../../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="general_requirements.html"><img src="../../../../../../../doc/src/images/next.png" alt="Next"></a>
 </div>
-<div class="section">
+<div class="section range_reference_adaptors_introduction">
 <div class="titlepage"><div><div><h4 class="title">
 <a name="range.reference.adaptors.introduction"></a><a class="link" href="introduction.html" title="Introduction and motivation">Introduction
         and motivation</a>
@@ -35,7 +35,6 @@
           In this example
         </p>
 <p>
-          
 </p>
 <pre class="programlisting"><span class="preprocessor">#include</span> <span class="special">&lt;</span><span class="identifier">boost</span><span class="special">/</span><span class="identifier">range</span><span class="special">/</span><span class="identifier">adaptors</span><span class="special">.</span><span class="identifier">hpp</span><span class="special">&gt;</span>
 <span class="preprocessor">#include</span> <span class="special">&lt;</span><span class="identifier">boost</span><span class="special">/</span><span class="identifier">range</span><span class="special">/</span><span class="identifier">algorithm</span><span class="special">.</span><span class="identifier">hpp</span><span class="special">&gt;</span>
@@ -55,7 +54,6 @@
           do not need to know it. All that is relevant is that the expression
         </p>
 <p>
-          
 </p>
 <pre class="programlisting"><span class="identifier">vec</span> <span class="special">|</span> <span class="identifier">boost</span><span class="special">::</span><span class="identifier">adaptors</span><span class="special">::</span><span class="identifier">reversed</span>
 </pre>
@@ -82,7 +80,6 @@
           Why do I prefer the <code class="computeroutput"><span class="keyword">operator</span><span class="special">|</span></code> syntax? The answer is readability:
         </p>
 <p>
-          
 </p>
 <pre class="programlisting"><span class="identifier">std</span><span class="special">::</span><span class="identifier">vector</span><span class="special">&lt;</span><span class="keyword">int</span><span class="special">&gt;</span> <span class="identifier">vec</span><span class="special">;</span>
 <span class="identifier">boost</span><span class="special">::</span><span class="identifier">copy</span><span class="special">(</span> <span class="identifier">boost</span><span class="special">::</span><span class="identifier">adaptors</span><span class="special">::</span><span class="identifier">reverse</span><span class="special">(</span><span class="identifier">vec</span><span class="special">),</span>
@@ -95,7 +92,6 @@
           much worse. Just compare
         </p>
 <p>
-          
 </p>
 <pre class="programlisting"><span class="identifier">std</span><span class="special">::</span><span class="identifier">vector</span><span class="special">&lt;</span><span class="keyword">int</span><span class="special">&gt;</span> <span class="identifier">vec</span><span class="special">;</span>
 <span class="identifier">boost</span><span class="special">::</span><span class="identifier">copy</span><span class="special">(</span> <span class="identifier">boost</span><span class="special">::</span><span class="identifier">adaptors</span><span class="special">::</span><span class="identifier">unique</span><span class="special">(</span> <span class="identifier">boost</span><span class="special">::</span><span class="identifier">adaptors</span><span class="special">::</span><span class="identifier">reverse</span><span class="special">(</span> <span class="identifier">vec</span> <span class="special">)</span> <span class="special">),</span>
@@ -107,7 +103,6 @@
           to
         </p>
 <p>
-          
 </p>
 <pre class="programlisting"><span class="identifier">std</span><span class="special">::</span><span class="identifier">vector</span><span class="special">&lt;</span><span class="keyword">int</span><span class="special">&gt;</span> <span class="identifier">vec</span><span class="special">;</span>
 <span class="identifier">boost</span><span class="special">::</span><span class="identifier">copy</span><span class="special">(</span> <span class="identifier">vec</span> <span class="special">|</span> <span class="identifier">boost</span><span class="special">::</span><span class="identifier">adaptors</span><span class="special">::</span><span class="identifier">reversed</span>
@@ -121,9 +116,9 @@
           these arguments are expressed with function call notation too. In those
           situations, you will really appreciate the succinctness of <code class="computeroutput"><span class="keyword">operator</span><span class="special">|()</span></code>.
         </p>
-<a name="range.reference.adaptors.introduction.composition_of_adaptors"></a><h6>
-<a name="id659630"></a>
-          <a class="link" href="introduction.html#range.reference.adaptors.introduction.composition_of_adaptors">Composition
+<h6>
+<a name="range.reference.adaptors.introduction.h0"></a>
+          <span><a name="range.reference.adaptors.introduction.composition_of_adaptors"></a></span><a class="link" href="introduction.html#range.reference.adaptors.introduction.composition_of_adaptors">Composition
           of Adaptors</a>
         </h6>
 <p>
@@ -168,35 +163,33 @@
           is redundant development overhead for each new algorithm. The Adaptor Generator
           is the design solution to this problem.
         </p>
-<a name="range.reference.adaptors.introduction.range_adaptor_alternative_to_copy_if_algorithm"></a><h6>
-<a name="id659939"></a>
-          <a class="link" href="introduction.html#range.reference.adaptors.introduction.range_adaptor_alternative_to_copy_if_algorithm">Range
+<h6>
+<a name="range.reference.adaptors.introduction.h1"></a>
+          <span><a name="range.reference.adaptors.introduction.range_adaptor_alternative_to_copy_if_algorithm"></a></span><a class="link" href="introduction.html#range.reference.adaptors.introduction.range_adaptor_alternative_to_copy_if_algorithm">Range
           Adaptor alternative to copy_if algorithm</a>
         </h6>
 <p>
-          
 </p>
 <pre class="programlisting"><span class="identifier">boost</span><span class="special">::</span><span class="identifier">copy_if</span><span class="special">(</span> <span class="identifier">rng</span><span class="special">,</span> <span class="identifier">pred</span><span class="special">,</span> <span class="identifier">out</span> <span class="special">);</span>
 </pre>
 <p>
-          can be expressed as 
+          can be expressed as
 </p>
 <pre class="programlisting"><span class="identifier">boost</span><span class="special">::</span><span class="identifier">copy</span><span class="special">(</span> <span class="identifier">rng</span> <span class="special">|</span> <span class="identifier">boost</span><span class="special">::</span><span class="identifier">adaptors</span><span class="special">::</span><span class="identifier">filtered</span><span class="special">(</span><span class="identifier">pred</span><span class="special">),</span> <span class="identifier">out</span> <span class="special">);</span>
 </pre>
 <p>
         </p>
-<a name="range.reference.adaptors.introduction.range_adaptor_alternative_to_count_if_algorithm"></a><h6>
-<a name="id660104"></a>
-          <a class="link" href="introduction.html#range.reference.adaptors.introduction.range_adaptor_alternative_to_count_if_algorithm">Range
+<h6>
+<a name="range.reference.adaptors.introduction.h2"></a>
+          <span><a name="range.reference.adaptors.introduction.range_adaptor_alternative_to_count_if_algorithm"></a></span><a class="link" href="introduction.html#range.reference.adaptors.introduction.range_adaptor_alternative_to_count_if_algorithm">Range
           Adaptor alternative to count_if algorithm</a>
         </h6>
 <p>
-          
 </p>
 <pre class="programlisting"><span class="identifier">boost</span><span class="special">::</span><span class="identifier">count_if</span><span class="special">(</span> <span class="identifier">rng</span><span class="special">,</span> <span class="identifier">pred</span> <span class="special">);</span>
 </pre>
 <p>
-          can be expressed as 
+          can be expressed as
 </p>
 <pre class="programlisting"><span class="identifier">boost</span><span class="special">::</span><span class="identifier">count</span><span class="special">(</span> <span class="identifier">rng</span> <span class="special">|</span> <span class="identifier">boost</span><span class="special">::</span><span class="identifier">adaptors</span><span class="special">::</span><span class="identifier">filtered</span><span class="special">(</span><span class="identifier">pred</span><span class="special">),</span> <span class="identifier">out</span> <span class="special">);</span>
 </pre>
@@ -209,7 +202,6 @@
           the somewhat misdesigned <code class="computeroutput"><span class="identifier">replace_copy_if</span><span class="special">()</span></code> which may be used as
         </p>
 <p>
-          
 </p>
 <pre class="programlisting"><span class="identifier">std</span><span class="special">::</span><span class="identifier">vector</span><span class="special">&lt;</span><span class="keyword">int</span><span class="special">&gt;</span> <span class="identifier">vec</span><span class="special">;</span>
 <span class="identifier">boost</span><span class="special">::</span><span class="identifier">replace_copy_if</span><span class="special">(</span> <span class="identifier">rng</span><span class="special">,</span> <span class="identifier">std</span><span class="special">::</span><span class="identifier">back_inserter</span><span class="special">(</span><span class="identifier">vec</span><span class="special">),</span> <span class="identifier">pred</span> <span class="special">);</span>
@@ -220,7 +212,6 @@
           With adaptors and algorithms we can express this as
         </p>
 <p>
-          
 </p>
 <pre class="programlisting"><span class="identifier">std</span><span class="special">::</span><span class="identifier">vector</span><span class="special">&lt;</span><span class="keyword">int</span><span class="special">&gt;</span> <span class="identifier">vec</span><span class="special">;</span>
 <span class="identifier">boost</span><span class="special">::</span><span class="identifier">push_back</span><span class="special">(</span><span class="identifier">vec</span><span class="special">,</span> <span class="identifier">rng</span> <span class="special">|</span> <span class="identifier">boost</span><span class="special">::</span><span class="identifier">adaptors</span><span class="special">::</span><span class="identifier">replaced_if</span><span class="special">(</span><span class="identifier">pred</span><span class="special">,</span> <span class="identifier">new_value</span><span class="special">));</span>
@@ -236,7 +227,7 @@
         </p>
 <p>
           2. it is <span class="emphasis"><em><span class="bold"><strong>flexible</strong></span></em></span>
-          as we can subsequently apply even more adaptors, for example: 
+          as we can subsequently apply even more adaptors, for example:
 </p>
 <pre class="programlisting"><span class="identifier">boost</span><span class="special">::</span><span class="identifier">push_back</span><span class="special">(</span><span class="identifier">vec</span><span class="special">,</span> <span class="identifier">rng</span> <span class="special">|</span> <span class="identifier">boost</span><span class="special">::</span><span class="identifier">adaptors</span><span class="special">::</span><span class="identifier">replaced_if</span><span class="special">(</span><span class="identifier">pred</span><span class="special">,</span> <span class="identifier">new_value</span><span class="special">)</span>
                           <span class="special">|</span> <span class="identifier">boost</span><span class="special">::</span><span class="identifier">adaptors</span><span class="special">::</span><span class="identifier">reversed</span><span class="special">);</span>
@@ -270,7 +261,8 @@
 </div>
 <table xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" width="100%"><tr>
 <td align="left"></td>
-<td align="right"><div class="copyright-footer">Copyright &#169; 2003 -2010 Thorsten Ottosen, Neil Groves<p>
+<td align="right"><div class="copyright-footer">Copyright &#169; 2003-2010 Thorsten Ottosen,
+      Neil Groves<p>
         Distributed under the Boost Software License, Version 1.0. (See accompanying
         file LICENSE_1_0.txt or copy at <a href="http://www.boost.org/LICENSE_1_0.txt" target="_top">http://www.boost.org/LICENSE_1_0.txt</a>)
       </p>
diff --git a/doc/html/range/reference/adaptors/reference.html b/doc/html/range/reference/adaptors/reference.html
index 4e5b99a..49e2359 100644
--- a/doc/html/range/reference/adaptors/reference.html
+++ b/doc/html/range/reference/adaptors/reference.html
@@ -22,7 +22,7 @@
 <div class="spirit-nav">
 <a accesskey="p" href="general_requirements.html"><img src="../../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../adaptors.html"><img src="../../../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../../../index.html"><img src="../../../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="reference/adjacent_filtered.html"><img src="../../../../../../../doc/src/images/next.png" alt="Next"></a>
 </div>
-<div class="section">
+<div class="section range_reference_adaptors_reference">
 <div class="titlepage"><div><div><h4 class="title">
 <a name="range.reference.adaptors.reference"></a><a class="link" href="reference.html" title="Reference">Reference</a>
 </h4></div></div></div>
@@ -47,7 +47,8 @@
 </div>
 <table xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" width="100%"><tr>
 <td align="left"></td>
-<td align="right"><div class="copyright-footer">Copyright &#169; 2003 -2010 Thorsten Ottosen, Neil Groves<p>
+<td align="right"><div class="copyright-footer">Copyright &#169; 2003-2010 Thorsten Ottosen,
+      Neil Groves<p>
         Distributed under the Boost Software License, Version 1.0. (See accompanying
         file LICENSE_1_0.txt or copy at <a href="http://www.boost.org/LICENSE_1_0.txt" target="_top">http://www.boost.org/LICENSE_1_0.txt</a>)
       </p>
diff --git a/doc/html/range/reference/adaptors/reference/adjacent_filtered.html b/doc/html/range/reference/adaptors/reference/adjacent_filtered.html
index cce2471..f83b737 100644
--- a/doc/html/range/reference/adaptors/reference/adjacent_filtered.html
+++ b/doc/html/range/reference/adaptors/reference/adjacent_filtered.html
@@ -22,7 +22,7 @@
 <div class="spirit-nav">
 <a accesskey="p" href="../reference.html"><img src="../../../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../reference.html"><img src="../../../../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../../../../index.html"><img src="../../../../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="copied.html"><img src="../../../../../../../../doc/src/images/next.png" alt="Next"></a>
 </div>
-<div class="section">
+<div class="section range_reference_adaptors_reference_adjacent_filtered">
 <div class="titlepage"><div><div><h5 class="title">
 <a name="range.reference.adaptors.reference.adjacent_filtered"></a><a class="link" href="adjacent_filtered.html" title="adjacent_filtered">adjacent_filtered</a>
 </h5></div></div></div>
@@ -102,13 +102,12 @@
                 and <a class="link" href="../../../concepts/forward_range.html" title="Forward Range">Forward Range</a>
               </li>
 </ul></div>
-<div class="section">
+<div class="section range_reference_adaptors_reference_adjacent_filtered_adjacent_filtered_example">
 <div class="titlepage"><div><div><h6 class="title">
 <a name="range.reference.adaptors.reference.adjacent_filtered.adjacent_filtered_example"></a><a class="link" href="adjacent_filtered.html#range.reference.adaptors.reference.adjacent_filtered.adjacent_filtered_example" title="adjacent_filtered example">adjacent_filtered
             example</a>
 </h6></div></div></div>
 <p>
-              
 </p>
 <pre class="programlisting"><span class="preprocessor">#include</span> <span class="special">&lt;</span><span class="identifier">boost</span><span class="special">/</span><span class="identifier">range</span><span class="special">/</span><span class="identifier">adaptor</span><span class="special">/</span><span class="identifier">adjacent_filtered</span><span class="special">.</span><span class="identifier">hpp</span><span class="special">&gt;</span>
 <span class="preprocessor">#include</span> <span class="special">&lt;</span><span class="identifier">boost</span><span class="special">/</span><span class="identifier">range</span><span class="special">/</span><span class="identifier">algorithm</span><span class="special">/</span><span class="identifier">copy</span><span class="special">.</span><span class="identifier">hpp</span><span class="special">&gt;</span>
@@ -137,7 +136,7 @@
             </p>
 </div>
 <p>
-            This would produce the output: 
+            This would produce the output:
 </p>
 <pre class="programlisting"><span class="number">1</span><span class="special">,</span><span class="number">2</span><span class="special">,</span><span class="number">3</span><span class="special">,</span><span class="number">4</span><span class="special">,</span><span class="number">5</span><span class="special">,</span><span class="number">6</span>
 </pre>
@@ -146,7 +145,8 @@
 </div>
 <table xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" width="100%"><tr>
 <td align="left"></td>
-<td align="right"><div class="copyright-footer">Copyright &#169; 2003 -2010 Thorsten Ottosen, Neil Groves<p>
+<td align="right"><div class="copyright-footer">Copyright &#169; 2003-2010 Thorsten Ottosen,
+      Neil Groves<p>
         Distributed under the Boost Software License, Version 1.0. (See accompanying
         file LICENSE_1_0.txt or copy at <a href="http://www.boost.org/LICENSE_1_0.txt" target="_top">http://www.boost.org/LICENSE_1_0.txt</a>)
       </p>
diff --git a/doc/html/range/reference/adaptors/reference/copied.html b/doc/html/range/reference/adaptors/reference/copied.html
index 5007999..6902098 100644
--- a/doc/html/range/reference/adaptors/reference/copied.html
+++ b/doc/html/range/reference/adaptors/reference/copied.html
@@ -22,7 +22,7 @@
 <div class="spirit-nav">
 <a accesskey="p" href="adjacent_filtered.html"><img src="../../../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../reference.html"><img src="../../../../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../../../../index.html"><img src="../../../../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="filtered.html"><img src="../../../../../../../../doc/src/images/next.png" alt="Next"></a>
 </div>
-<div class="section">
+<div class="section range_reference_adaptors_reference_copied">
 <div class="titlepage"><div><div><h5 class="title">
 <a name="range.reference.adaptors.reference.copied"></a><a class="link" href="copied.html" title="copied">copied</a>
 </h5></div></div></div>
@@ -99,13 +99,12 @@
                 Access Range</a>
               </li>
 </ul></div>
-<div class="section">
+<div class="section range_reference_adaptors_reference_copied_copied_example">
 <div class="titlepage"><div><div><h6 class="title">
 <a name="range.reference.adaptors.reference.copied.copied_example"></a><a class="link" href="copied.html#range.reference.adaptors.reference.copied.copied_example" title="copied example">copied
             example</a>
 </h6></div></div></div>
 <p>
-              
 </p>
 <pre class="programlisting"><span class="preprocessor">#include</span> <span class="special">&lt;</span><span class="identifier">boost</span><span class="special">/</span><span class="identifier">range</span><span class="special">/</span><span class="identifier">adaptor</span><span class="special">/</span><span class="identifier">copied</span><span class="special">.</span><span class="identifier">hpp</span><span class="special">&gt;</span>
 <span class="preprocessor">#include</span> <span class="special">&lt;</span><span class="identifier">boost</span><span class="special">/</span><span class="identifier">range</span><span class="special">/</span><span class="identifier">algorithm</span><span class="special">/</span><span class="identifier">copy</span><span class="special">.</span><span class="identifier">hpp</span><span class="special">&gt;</span>
@@ -133,7 +132,7 @@
             </p>
 </div>
 <p>
-            This would produce the output: 
+            This would produce the output:
 </p>
 <pre class="programlisting"><span class="number">2</span><span class="special">,</span><span class="number">3</span><span class="special">,</span><span class="number">4</span><span class="special">,</span><span class="number">5</span>
 </pre>
@@ -142,7 +141,8 @@
 </div>
 <table xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" width="100%"><tr>
 <td align="left"></td>
-<td align="right"><div class="copyright-footer">Copyright &#169; 2003 -2010 Thorsten Ottosen, Neil Groves<p>
+<td align="right"><div class="copyright-footer">Copyright &#169; 2003-2010 Thorsten Ottosen,
+      Neil Groves<p>
         Distributed under the Boost Software License, Version 1.0. (See accompanying
         file LICENSE_1_0.txt or copy at <a href="http://www.boost.org/LICENSE_1_0.txt" target="_top">http://www.boost.org/LICENSE_1_0.txt</a>)
       </p>
diff --git a/doc/html/range/reference/adaptors/reference/filtered.html b/doc/html/range/reference/adaptors/reference/filtered.html
index 6fe2ce1..5d45709 100644
--- a/doc/html/range/reference/adaptors/reference/filtered.html
+++ b/doc/html/range/reference/adaptors/reference/filtered.html
@@ -22,7 +22,7 @@
 <div class="spirit-nav">
 <a accesskey="p" href="copied.html"><img src="../../../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../reference.html"><img src="../../../../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../../../../index.html"><img src="../../../../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="indexed.html"><img src="../../../../../../../../doc/src/images/next.png" alt="Next"></a>
 </div>
-<div class="section">
+<div class="section range_reference_adaptors_reference_filtered">
 <div class="titlepage"><div><div><h5 class="title">
 <a name="range.reference.adaptors.reference.filtered"></a><a class="link" href="filtered.html" title="filtered">filtered</a>
 </h5></div></div></div>
@@ -102,13 +102,12 @@
                 Range</a>
               </li>
 </ul></div>
-<div class="section">
+<div class="section range_reference_adaptors_reference_filtered_filtered_example">
 <div class="titlepage"><div><div><h6 class="title">
 <a name="range.reference.adaptors.reference.filtered.filtered_example"></a><a class="link" href="filtered.html#range.reference.adaptors.reference.filtered.filtered_example" title="filtered example">filtered
             example</a>
 </h6></div></div></div>
 <p>
-              
 </p>
 <pre class="programlisting"><span class="preprocessor">#include</span> <span class="special">&lt;</span><span class="identifier">boost</span><span class="special">/</span><span class="identifier">range</span><span class="special">/</span><span class="identifier">adaptor</span><span class="special">/</span><span class="identifier">filtered</span><span class="special">.</span><span class="identifier">hpp</span><span class="special">&gt;</span>
 <span class="preprocessor">#include</span> <span class="special">&lt;</span><span class="identifier">boost</span><span class="special">/</span><span class="identifier">range</span><span class="special">/</span><span class="identifier">algorithm</span><span class="special">/</span><span class="identifier">copy</span><span class="special">.</span><span class="identifier">hpp</span><span class="special">&gt;</span>
@@ -139,7 +138,7 @@
             </p>
 </div>
 <p>
-            This would produce the output: 
+            This would produce the output:
 </p>
 <pre class="programlisting"><span class="number">2</span><span class="special">,</span><span class="number">4</span><span class="special">,</span><span class="number">6</span><span class="special">,</span><span class="number">8</span>
 </pre>
@@ -148,7 +147,8 @@
 </div>
 <table xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" width="100%"><tr>
 <td align="left"></td>
-<td align="right"><div class="copyright-footer">Copyright &#169; 2003 -2010 Thorsten Ottosen, Neil Groves<p>
+<td align="right"><div class="copyright-footer">Copyright &#169; 2003-2010 Thorsten Ottosen,
+      Neil Groves<p>
         Distributed under the Boost Software License, Version 1.0. (See accompanying
         file LICENSE_1_0.txt or copy at <a href="http://www.boost.org/LICENSE_1_0.txt" target="_top">http://www.boost.org/LICENSE_1_0.txt</a>)
       </p>
diff --git a/doc/html/range/reference/adaptors/reference/indexed.html b/doc/html/range/reference/adaptors/reference/indexed.html
index 1d29887..ab6a776 100644
--- a/doc/html/range/reference/adaptors/reference/indexed.html
+++ b/doc/html/range/reference/adaptors/reference/indexed.html
@@ -22,7 +22,7 @@
 <div class="spirit-nav">
 <a accesskey="p" href="filtered.html"><img src="../../../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../reference.html"><img src="../../../../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../../../../index.html"><img src="../../../../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="indirected.html"><img src="../../../../../../../../doc/src/images/next.png" alt="Next"></a>
 </div>
-<div class="section">
+<div class="section range_reference_adaptors_reference_indexed">
 <div class="titlepage"><div><div><h5 class="title">
 <a name="range.reference.adaptors.reference.indexed"></a><a class="link" href="indexed.html" title="indexed">indexed</a>
 </h5></div></div></div>
@@ -94,13 +94,12 @@
                 category of <code class="computeroutput"><span class="identifier">rng</span></code>
               </li>
 </ul></div>
-<div class="section">
+<div class="section range_reference_adaptors_reference_indexed_indexed_example">
 <div class="titlepage"><div><div><h6 class="title">
 <a name="range.reference.adaptors.reference.indexed.indexed_example"></a><a class="link" href="indexed.html#range.reference.adaptors.reference.indexed.indexed_example" title="indexed example">indexed
             example</a>
 </h6></div></div></div>
 <p>
-              
 </p>
 <pre class="programlisting"><span class="preprocessor">#include</span> <span class="special">&lt;</span><span class="identifier">boost</span><span class="special">/</span><span class="identifier">range</span><span class="special">/</span><span class="identifier">adaptor</span><span class="special">/</span><span class="identifier">indexed</span><span class="special">.</span><span class="identifier">hpp</span><span class="special">&gt;</span>
 <span class="preprocessor">#include</span> <span class="special">&lt;</span><span class="identifier">boost</span><span class="special">/</span><span class="identifier">range</span><span class="special">/</span><span class="identifier">algorithm</span><span class="special">/</span><span class="identifier">copy</span><span class="special">.</span><span class="identifier">hpp</span><span class="special">&gt;</span>
@@ -162,7 +161,7 @@
             </p>
 </div>
 <p>
-            This would produce the output: 
+            This would produce the output:
 </p>
 <pre class="programlisting"><span class="identifier">Element</span> <span class="special">=</span> <span class="number">10</span> <span class="identifier">Index</span> <span class="special">=</span> <span class="number">0</span>
 <span class="identifier">Element</span> <span class="special">=</span> <span class="number">20</span> <span class="identifier">Index</span> <span class="special">=</span> <span class="number">1</span>
@@ -179,7 +178,8 @@
 </div>
 <table xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" width="100%"><tr>
 <td align="left"></td>
-<td align="right"><div class="copyright-footer">Copyright &#169; 2003 -2010 Thorsten Ottosen, Neil Groves<p>
+<td align="right"><div class="copyright-footer">Copyright &#169; 2003-2010 Thorsten Ottosen,
+      Neil Groves<p>
         Distributed under the Boost Software License, Version 1.0. (See accompanying
         file LICENSE_1_0.txt or copy at <a href="http://www.boost.org/LICENSE_1_0.txt" target="_top">http://www.boost.org/LICENSE_1_0.txt</a>)
       </p>
diff --git a/doc/html/range/reference/adaptors/reference/indirected.html b/doc/html/range/reference/adaptors/reference/indirected.html
index e990d1e..d185d79 100644
--- a/doc/html/range/reference/adaptors/reference/indirected.html
+++ b/doc/html/range/reference/adaptors/reference/indirected.html
@@ -22,7 +22,7 @@
 <div class="spirit-nav">
 <a accesskey="p" href="indexed.html"><img src="../../../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../reference.html"><img src="../../../../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../../../../index.html"><img src="../../../../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="map_keys.html"><img src="../../../../../../../../doc/src/images/next.png" alt="Next"></a>
 </div>
-<div class="section">
+<div class="section range_reference_adaptors_reference_indirected">
 <div class="titlepage"><div><div><h5 class="title">
 <a name="range.reference.adaptors.reference.indirected"></a><a class="link" href="indirected.html" title="indirected">indirected</a>
 </h5></div></div></div>
@@ -98,13 +98,12 @@
                 category of <code class="computeroutput"><span class="identifier">rng</span></code>
               </li>
 </ul></div>
-<div class="section">
+<div class="section range_reference_adaptors_reference_indirected_indirected_example">
 <div class="titlepage"><div><div><h6 class="title">
 <a name="range.reference.adaptors.reference.indirected.indirected_example"></a><a class="link" href="indirected.html#range.reference.adaptors.reference.indirected.indirected_example" title="indirected example">indirected
             example</a>
 </h6></div></div></div>
 <p>
-              
 </p>
 <pre class="programlisting"><span class="preprocessor">#include</span> <span class="special">&lt;</span><span class="identifier">boost</span><span class="special">/</span><span class="identifier">range</span><span class="special">/</span><span class="identifier">adaptor</span><span class="special">/</span><span class="identifier">indirected</span><span class="special">.</span><span class="identifier">hpp</span><span class="special">&gt;</span>
 <span class="preprocessor">#include</span> <span class="special">&lt;</span><span class="identifier">boost</span><span class="special">/</span><span class="identifier">range</span><span class="special">/</span><span class="identifier">algorithm</span><span class="special">/</span><span class="identifier">copy</span><span class="special">.</span><span class="identifier">hpp</span><span class="special">&gt;</span>
@@ -133,7 +132,7 @@
             </p>
 </div>
 <p>
-            This would produce the output: 
+            This would produce the output:
 </p>
 <pre class="programlisting"><span class="number">0</span><span class="special">,</span><span class="number">1</span><span class="special">,</span><span class="number">2</span><span class="special">,</span><span class="number">3</span><span class="special">,</span><span class="number">4</span><span class="special">,</span><span class="number">5</span><span class="special">,</span><span class="number">6</span><span class="special">,</span><span class="number">7</span><span class="special">,</span><span class="number">8</span><span class="special">,</span><span class="number">9</span>
 </pre>
@@ -142,7 +141,8 @@
 </div>
 <table xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" width="100%"><tr>
 <td align="left"></td>
-<td align="right"><div class="copyright-footer">Copyright &#169; 2003 -2010 Thorsten Ottosen, Neil Groves<p>
+<td align="right"><div class="copyright-footer">Copyright &#169; 2003-2010 Thorsten Ottosen,
+      Neil Groves<p>
         Distributed under the Boost Software License, Version 1.0. (See accompanying
         file LICENSE_1_0.txt or copy at <a href="http://www.boost.org/LICENSE_1_0.txt" target="_top">http://www.boost.org/LICENSE_1_0.txt</a>)
       </p>
diff --git a/doc/html/range/reference/adaptors/reference/map_keys.html b/doc/html/range/reference/adaptors/reference/map_keys.html
index 3120f2f..58c164f 100644
--- a/doc/html/range/reference/adaptors/reference/map_keys.html
+++ b/doc/html/range/reference/adaptors/reference/map_keys.html
@@ -22,7 +22,7 @@
 <div class="spirit-nav">
 <a accesskey="p" href="indirected.html"><img src="../../../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../reference.html"><img src="../../../../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../../../../index.html"><img src="../../../../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="map_values.html"><img src="../../../../../../../../doc/src/images/next.png" alt="Next"></a>
 </div>
-<div class="section">
+<div class="section range_reference_adaptors_reference_map_keys">
 <div class="titlepage"><div><div><h5 class="title">
 <a name="range.reference.adaptors.reference.map_keys"></a><a class="link" href="map_keys.html" title="map_keys">map_keys</a>
 </h5></div></div></div>
@@ -97,13 +97,12 @@
                 category of <code class="computeroutput"><span class="identifier">rng</span></code>.
               </li>
 </ul></div>
-<div class="section">
+<div class="section range_reference_adaptors_reference_map_keys_map_keys_example">
 <div class="titlepage"><div><div><h6 class="title">
 <a name="range.reference.adaptors.reference.map_keys.map_keys_example"></a><a class="link" href="map_keys.html#range.reference.adaptors.reference.map_keys.map_keys_example" title="map_keys example">map_keys
             example</a>
 </h6></div></div></div>
 <p>
-              
 </p>
 <pre class="programlisting"><span class="preprocessor">#include</span> <span class="special">&lt;</span><span class="identifier">boost</span><span class="special">/</span><span class="identifier">range</span><span class="special">/</span><span class="identifier">adaptor</span><span class="special">/</span><span class="identifier">map</span><span class="special">.</span><span class="identifier">hpp</span><span class="special">&gt;</span>
 <span class="preprocessor">#include</span> <span class="special">&lt;</span><span class="identifier">boost</span><span class="special">/</span><span class="identifier">range</span><span class="special">/</span><span class="identifier">algorithm</span><span class="special">/</span><span class="identifier">copy</span><span class="special">.</span><span class="identifier">hpp</span><span class="special">&gt;</span>
@@ -133,7 +132,7 @@
             </p>
 </div>
 <p>
-            This would produce the output: 
+            This would produce the output:
 </p>
 <pre class="programlisting"><span class="number">0</span><span class="special">,</span><span class="number">1</span><span class="special">,</span><span class="number">2</span><span class="special">,</span><span class="number">3</span><span class="special">,</span><span class="number">4</span><span class="special">,</span><span class="number">5</span><span class="special">,</span><span class="number">6</span><span class="special">,</span><span class="number">7</span><span class="special">,</span><span class="number">8</span><span class="special">,</span><span class="number">9</span>
 </pre>
@@ -142,7 +141,8 @@
 </div>
 <table xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" width="100%"><tr>
 <td align="left"></td>
-<td align="right"><div class="copyright-footer">Copyright &#169; 2003 -2010 Thorsten Ottosen, Neil Groves<p>
+<td align="right"><div class="copyright-footer">Copyright &#169; 2003-2010 Thorsten Ottosen,
+      Neil Groves<p>
         Distributed under the Boost Software License, Version 1.0. (See accompanying
         file LICENSE_1_0.txt or copy at <a href="http://www.boost.org/LICENSE_1_0.txt" target="_top">http://www.boost.org/LICENSE_1_0.txt</a>)
       </p>
diff --git a/doc/html/range/reference/adaptors/reference/map_values.html b/doc/html/range/reference/adaptors/reference/map_values.html
index 30ff247..d467ffb 100644
--- a/doc/html/range/reference/adaptors/reference/map_values.html
+++ b/doc/html/range/reference/adaptors/reference/map_values.html
@@ -22,7 +22,7 @@
 <div class="spirit-nav">
 <a accesskey="p" href="map_keys.html"><img src="../../../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../reference.html"><img src="../../../../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../../../../index.html"><img src="../../../../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="replaced.html"><img src="../../../../../../../../doc/src/images/next.png" alt="Next"></a>
 </div>
-<div class="section">
+<div class="section range_reference_adaptors_reference_map_values">
 <div class="titlepage"><div><div><h5 class="title">
 <a name="range.reference.adaptors.reference.map_values"></a><a class="link" href="map_values.html" title="map_values">map_values</a>
 </h5></div></div></div>
@@ -99,13 +99,12 @@
                 category of <code class="computeroutput"><span class="identifier">rng</span></code>.
               </li>
 </ul></div>
-<div class="section">
+<div class="section range_reference_adaptors_reference_map_values_map_values_example">
 <div class="titlepage"><div><div><h6 class="title">
 <a name="range.reference.adaptors.reference.map_values.map_values_example"></a><a class="link" href="map_values.html#range.reference.adaptors.reference.map_values.map_values_example" title="map_values example">map_values
             example</a>
 </h6></div></div></div>
 <p>
-              
 </p>
 <pre class="programlisting"><span class="preprocessor">#include</span> <span class="special">&lt;</span><span class="identifier">boost</span><span class="special">/</span><span class="identifier">range</span><span class="special">/</span><span class="identifier">adaptor</span><span class="special">/</span><span class="identifier">map</span><span class="special">.</span><span class="identifier">hpp</span><span class="special">&gt;</span>
 <span class="preprocessor">#include</span> <span class="special">&lt;</span><span class="identifier">boost</span><span class="special">/</span><span class="identifier">range</span><span class="special">/</span><span class="identifier">algorithm</span><span class="special">/</span><span class="identifier">copy</span><span class="special">.</span><span class="identifier">hpp</span><span class="special">&gt;</span>
@@ -135,7 +134,7 @@
             </p>
 </div>
 <p>
-            This would produce the output: 
+            This would produce the output:
 </p>
 <pre class="programlisting"><span class="number">0</span><span class="special">,</span><span class="number">10</span><span class="special">,</span><span class="number">20</span><span class="special">,</span><span class="number">30</span><span class="special">,</span><span class="number">40</span><span class="special">,</span><span class="number">50</span><span class="special">,</span><span class="number">60</span><span class="special">,</span><span class="number">70</span><span class="special">,</span><span class="number">80</span><span class="special">,</span><span class="number">90</span>
 </pre>
@@ -144,7 +143,8 @@
 </div>
 <table xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" width="100%"><tr>
 <td align="left"></td>
-<td align="right"><div class="copyright-footer">Copyright &#169; 2003 -2010 Thorsten Ottosen, Neil Groves<p>
+<td align="right"><div class="copyright-footer">Copyright &#169; 2003-2010 Thorsten Ottosen,
+      Neil Groves<p>
         Distributed under the Boost Software License, Version 1.0. (See accompanying
         file LICENSE_1_0.txt or copy at <a href="http://www.boost.org/LICENSE_1_0.txt" target="_top">http://www.boost.org/LICENSE_1_0.txt</a>)
       </p>
diff --git a/doc/html/range/reference/adaptors/reference/replaced.html b/doc/html/range/reference/adaptors/reference/replaced.html
index 398258c..a0fc28e 100644
--- a/doc/html/range/reference/adaptors/reference/replaced.html
+++ b/doc/html/range/reference/adaptors/reference/replaced.html
@@ -22,7 +22,7 @@
 <div class="spirit-nav">
 <a accesskey="p" href="map_values.html"><img src="../../../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../reference.html"><img src="../../../../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../../../../index.html"><img src="../../../../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="replaced_if.html"><img src="../../../../../../../../doc/src/images/next.png" alt="Next"></a>
 </div>
-<div class="section">
+<div class="section range_reference_adaptors_reference_replaced">
 <div class="titlepage"><div><div><h5 class="title">
 <a name="range.reference.adaptors.reference.replaced"></a><a class="link" href="replaced.html" title="replaced">replaced</a>
 </h5></div></div></div>
@@ -78,22 +78,20 @@
 </table></div>
 <div class="itemizedlist"><ul class="itemizedlist" type="disc">
 <li class="listitem">
-<p class="simpara">
                 <span class="bold"><strong>Precondition:</strong></span>
-              </p>
-<div class="itemizedlist"><ul class="itemizedlist" type="circle">
+                <div class="itemizedlist"><ul class="itemizedlist" type="circle">
 <li class="listitem">
-                    <code class="computeroutput"><span class="identifier">new_value</span></code> is
-                    convertible to the <code class="computeroutput"><span class="identifier">value_type</span></code>
-                    of the range.
-                  </li>
+                      <code class="computeroutput"><span class="identifier">new_value</span></code> is
+                      convertible to the <code class="computeroutput"><span class="identifier">value_type</span></code>
+                      of the range.
+                    </li>
 <li class="listitem">
-                    <code class="computeroutput"><span class="identifier">old_value</span></code> is
-                    convertible to the <code class="computeroutput"><span class="identifier">value_type</span></code>
-                    of the range.
-                  </li>
+                      <code class="computeroutput"><span class="identifier">old_value</span></code> is
+                      convertible to the <code class="computeroutput"><span class="identifier">value_type</span></code>
+                      of the range.
+                    </li>
 </ul></div>
-</li>
+              </li>
 <li class="listitem">
                 <span class="bold"><strong>Postcondition:</strong></span> For all elements
                 <code class="computeroutput"><span class="identifier">x</span></code> in the returned
@@ -117,13 +115,12 @@
                 category of <code class="computeroutput"><span class="identifier">rng</span></code>.
               </li>
 </ul></div>
-<div class="section">
+<div class="section range_reference_adaptors_reference_replaced_replaced_example">
 <div class="titlepage"><div><div><h6 class="title">
 <a name="range.reference.adaptors.reference.replaced.replaced_example"></a><a class="link" href="replaced.html#range.reference.adaptors.reference.replaced.replaced_example" title="replaced example">replaced
             example</a>
 </h6></div></div></div>
 <p>
-              
 </p>
 <pre class="programlisting"><span class="preprocessor">#include</span> <span class="special">&lt;</span><span class="identifier">boost</span><span class="special">/</span><span class="identifier">range</span><span class="special">/</span><span class="identifier">adaptor</span><span class="special">/</span><span class="identifier">replaced</span><span class="special">.</span><span class="identifier">hpp</span><span class="special">&gt;</span>
 <span class="preprocessor">#include</span> <span class="special">&lt;</span><span class="identifier">boost</span><span class="special">/</span><span class="identifier">range</span><span class="special">/</span><span class="identifier">algorithm</span><span class="special">/</span><span class="identifier">copy</span><span class="special">.</span><span class="identifier">hpp</span><span class="special">&gt;</span>
@@ -151,7 +148,7 @@
             </p>
 </div>
 <p>
-            This would produce the output: 
+            This would produce the output:
 </p>
 <pre class="programlisting"><span class="number">1</span><span class="special">,</span><span class="number">10</span><span class="special">,</span><span class="number">3</span><span class="special">,</span><span class="number">10</span><span class="special">,</span><span class="number">5</span><span class="special">,</span><span class="number">10</span><span class="special">,</span><span class="number">7</span><span class="special">,</span><span class="number">10</span><span class="special">,</span><span class="number">9</span>
 </pre>
@@ -160,7 +157,8 @@
 </div>
 <table xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" width="100%"><tr>
 <td align="left"></td>
-<td align="right"><div class="copyright-footer">Copyright &#169; 2003 -2010 Thorsten Ottosen, Neil Groves<p>
+<td align="right"><div class="copyright-footer">Copyright &#169; 2003-2010 Thorsten Ottosen,
+      Neil Groves<p>
         Distributed under the Boost Software License, Version 1.0. (See accompanying
         file LICENSE_1_0.txt or copy at <a href="http://www.boost.org/LICENSE_1_0.txt" target="_top">http://www.boost.org/LICENSE_1_0.txt</a>)
       </p>
diff --git a/doc/html/range/reference/adaptors/reference/replaced_if.html b/doc/html/range/reference/adaptors/reference/replaced_if.html
index e259a84..05b26b3 100644
--- a/doc/html/range/reference/adaptors/reference/replaced_if.html
+++ b/doc/html/range/reference/adaptors/reference/replaced_if.html
@@ -22,7 +22,7 @@
 <div class="spirit-nav">
 <a accesskey="p" href="replaced.html"><img src="../../../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../reference.html"><img src="../../../../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../../../../index.html"><img src="../../../../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="reversed.html"><img src="../../../../../../../../doc/src/images/next.png" alt="Next"></a>
 </div>
-<div class="section">
+<div class="section range_reference_adaptors_reference_replaced_if">
 <div class="titlepage"><div><div><h5 class="title">
 <a name="range.reference.adaptors.reference.replaced_if"></a><a class="link" href="replaced_if.html" title="replaced_if">replaced_if</a>
 </h5></div></div></div>
@@ -78,21 +78,19 @@
 </table></div>
 <div class="itemizedlist"><ul class="itemizedlist" type="disc">
 <li class="listitem">
-<p class="simpara">
                 <span class="bold"><strong>Precondition:</strong></span>
-              </p>
-<div class="itemizedlist"><ul class="itemizedlist" type="circle">
+                <div class="itemizedlist"><ul class="itemizedlist" type="circle">
 <li class="listitem">
-                    The range <code class="computeroutput"><span class="identifier">value_type</span></code>
-                    is convertible to the argument type of <code class="computeroutput"><span class="identifier">pred</span></code>.
-                  </li>
+                      The range <code class="computeroutput"><span class="identifier">value_type</span></code>
+                      is convertible to the argument type of <code class="computeroutput"><span class="identifier">pred</span></code>.
+                    </li>
 <li class="listitem">
-                    <code class="computeroutput"><span class="identifier">new_value</span></code> is
-                    convertible to the <code class="computeroutput"><span class="identifier">value_type</span></code>
-                    of the range.
-                  </li>
+                      <code class="computeroutput"><span class="identifier">new_value</span></code> is
+                      convertible to the <code class="computeroutput"><span class="identifier">value_type</span></code>
+                      of the range.
+                    </li>
 </ul></div>
-</li>
+              </li>
 <li class="listitem">
                 <span class="bold"><strong>Postconditions:</strong></span> For all elements
                 <code class="computeroutput"><span class="identifier">x</span></code> in the returned
@@ -113,13 +111,12 @@
                 category of <code class="computeroutput"><span class="identifier">rng</span></code>.
               </li>
 </ul></div>
-<div class="section">
+<div class="section range_reference_adaptors_reference_replaced_if_replaced_if_example">
 <div class="titlepage"><div><div><h6 class="title">
 <a name="range.reference.adaptors.reference.replaced_if.replaced_if_example"></a><a class="link" href="replaced_if.html#range.reference.adaptors.reference.replaced_if.replaced_if_example" title="replaced_if example">replaced_if
             example</a>
 </h6></div></div></div>
 <p>
-              
 </p>
 <pre class="programlisting"><span class="preprocessor">#include</span> <span class="special">&lt;</span><span class="identifier">boost</span><span class="special">/</span><span class="identifier">range</span><span class="special">/</span><span class="identifier">adaptor</span><span class="special">/</span><span class="identifier">replaced_if</span><span class="special">.</span><span class="identifier">hpp</span><span class="special">&gt;</span>
 <span class="preprocessor">#include</span> <span class="special">&lt;</span><span class="identifier">boost</span><span class="special">/</span><span class="identifier">range</span><span class="special">/</span><span class="identifier">algorithm</span><span class="special">/</span><span class="identifier">copy</span><span class="special">.</span><span class="identifier">hpp</span><span class="special">&gt;</span>
@@ -152,7 +149,7 @@
             </p>
 </div>
 <p>
-            This would produce the output: 
+            This would produce the output:
 </p>
 <pre class="programlisting"><span class="number">1</span><span class="special">,</span><span class="number">10</span><span class="special">,</span><span class="number">3</span><span class="special">,</span><span class="number">10</span><span class="special">,</span><span class="number">5</span><span class="special">,</span><span class="number">10</span><span class="special">,</span><span class="number">7</span><span class="special">,</span><span class="number">10</span><span class="special">,</span><span class="number">9</span>
 </pre>
@@ -161,7 +158,8 @@
 </div>
 <table xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" width="100%"><tr>
 <td align="left"></td>
-<td align="right"><div class="copyright-footer">Copyright &#169; 2003 -2010 Thorsten Ottosen, Neil Groves<p>
+<td align="right"><div class="copyright-footer">Copyright &#169; 2003-2010 Thorsten Ottosen,
+      Neil Groves<p>
         Distributed under the Boost Software License, Version 1.0. (See accompanying
         file LICENSE_1_0.txt or copy at <a href="http://www.boost.org/LICENSE_1_0.txt" target="_top">http://www.boost.org/LICENSE_1_0.txt</a>)
       </p>
diff --git a/doc/html/range/reference/adaptors/reference/reversed.html b/doc/html/range/reference/adaptors/reference/reversed.html
index efdf11f..1db2af4 100644
--- a/doc/html/range/reference/adaptors/reference/reversed.html
+++ b/doc/html/range/reference/adaptors/reference/reversed.html
@@ -22,7 +22,7 @@
 <div class="spirit-nav">
 <a accesskey="p" href="replaced_if.html"><img src="../../../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../reference.html"><img src="../../../../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../../../../index.html"><img src="../../../../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="sliced.html"><img src="../../../../../../../../doc/src/images/next.png" alt="Next"></a>
 </div>
-<div class="section">
+<div class="section range_reference_adaptors_reference_reversed">
 <div class="titlepage"><div><div><h5 class="title">
 <a name="range.reference.adaptors.reference.reversed"></a><a class="link" href="reversed.html" title="reversed">reversed</a>
 </h5></div></div></div>
@@ -90,13 +90,12 @@
                 category of <code class="computeroutput"><span class="identifier">rng</span></code>.
               </li>
 </ul></div>
-<div class="section">
+<div class="section range_reference_adaptors_reference_reversed_reversed_example">
 <div class="titlepage"><div><div><h6 class="title">
 <a name="range.reference.adaptors.reference.reversed.reversed_example"></a><a class="link" href="reversed.html#range.reference.adaptors.reference.reversed.reversed_example" title="reversed example">reversed
             example</a>
 </h6></div></div></div>
 <p>
-              
 </p>
 <pre class="programlisting"><span class="preprocessor">#include</span> <span class="special">&lt;</span><span class="identifier">boost</span><span class="special">/</span><span class="identifier">range</span><span class="special">/</span><span class="identifier">adaptor</span><span class="special">/</span><span class="identifier">reversed</span><span class="special">.</span><span class="identifier">hpp</span><span class="special">&gt;</span>
 <span class="preprocessor">#include</span> <span class="special">&lt;</span><span class="identifier">boost</span><span class="special">/</span><span class="identifier">range</span><span class="special">/</span><span class="identifier">algorithm</span><span class="special">/</span><span class="identifier">copy</span><span class="special">.</span><span class="identifier">hpp</span><span class="special">&gt;</span>
@@ -124,7 +123,7 @@
             </p>
 </div>
 <p>
-            This would produce the output: 
+            This would produce the output:
 </p>
 <pre class="programlisting"><span class="number">9</span><span class="special">,</span><span class="number">8</span><span class="special">,</span><span class="number">7</span><span class="special">,</span><span class="number">6</span><span class="special">,</span><span class="number">5</span><span class="special">,</span><span class="number">4</span><span class="special">,</span><span class="number">3</span><span class="special">,</span><span class="number">2</span><span class="special">,</span><span class="number">1</span>
 </pre>
@@ -133,7 +132,8 @@
 </div>
 <table xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" width="100%"><tr>
 <td align="left"></td>
-<td align="right"><div class="copyright-footer">Copyright &#169; 2003 -2010 Thorsten Ottosen, Neil Groves<p>
+<td align="right"><div class="copyright-footer">Copyright &#169; 2003-2010 Thorsten Ottosen,
+      Neil Groves<p>
         Distributed under the Boost Software License, Version 1.0. (See accompanying
         file LICENSE_1_0.txt or copy at <a href="http://www.boost.org/LICENSE_1_0.txt" target="_top">http://www.boost.org/LICENSE_1_0.txt</a>)
       </p>
diff --git a/doc/html/range/reference/adaptors/reference/sliced.html b/doc/html/range/reference/adaptors/reference/sliced.html
index ea0b736..1f4e63d 100644
--- a/doc/html/range/reference/adaptors/reference/sliced.html
+++ b/doc/html/range/reference/adaptors/reference/sliced.html
@@ -22,7 +22,7 @@
 <div class="spirit-nav">
 <a accesskey="p" href="reversed.html"><img src="../../../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../reference.html"><img src="../../../../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../../../../index.html"><img src="../../../../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="strided.html"><img src="../../../../../../../../doc/src/images/next.png" alt="Next"></a>
 </div>
-<div class="section">
+<div class="section range_reference_adaptors_reference_sliced">
 <div class="titlepage"><div><div><h5 class="title">
 <a name="range.reference.adaptors.reference.sliced"></a><a class="link" href="sliced.html" title="sliced">sliced</a>
 </h5></div></div></div>
@@ -100,13 +100,12 @@
                 Access Range</a>
               </li>
 </ul></div>
-<div class="section">
+<div class="section range_reference_adaptors_reference_sliced_sliced_example">
 <div class="titlepage"><div><div><h6 class="title">
 <a name="range.reference.adaptors.reference.sliced.sliced_example"></a><a class="link" href="sliced.html#range.reference.adaptors.reference.sliced.sliced_example" title="sliced example">sliced
             example</a>
 </h6></div></div></div>
 <p>
-              
 </p>
 <pre class="programlisting"><span class="preprocessor">#include</span> <span class="special">&lt;</span><span class="identifier">boost</span><span class="special">/</span><span class="identifier">range</span><span class="special">/</span><span class="identifier">adaptor</span><span class="special">/</span><span class="identifier">sliced</span><span class="special">.</span><span class="identifier">hpp</span><span class="special">&gt;</span>
 <span class="preprocessor">#include</span> <span class="special">&lt;</span><span class="identifier">boost</span><span class="special">/</span><span class="identifier">range</span><span class="special">/</span><span class="identifier">algorithm</span><span class="special">/</span><span class="identifier">copy</span><span class="special">.</span><span class="identifier">hpp</span><span class="special">&gt;</span>
@@ -134,7 +133,7 @@
             </p>
 </div>
 <p>
-            This would produce the output: 
+            This would produce the output:
 </p>
 <pre class="programlisting"><span class="number">3</span><span class="special">,</span><span class="number">4</span><span class="special">,</span><span class="number">5</span>
 </pre>
@@ -143,7 +142,8 @@
 </div>
 <table xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" width="100%"><tr>
 <td align="left"></td>
-<td align="right"><div class="copyright-footer">Copyright &#169; 2003 -2010 Thorsten Ottosen, Neil Groves<p>
+<td align="right"><div class="copyright-footer">Copyright &#169; 2003-2010 Thorsten Ottosen,
+      Neil Groves<p>
         Distributed under the Boost Software License, Version 1.0. (See accompanying
         file LICENSE_1_0.txt or copy at <a href="http://www.boost.org/LICENSE_1_0.txt" target="_top">http://www.boost.org/LICENSE_1_0.txt</a>)
       </p>
diff --git a/doc/html/range/reference/adaptors/reference/strided.html b/doc/html/range/reference/adaptors/reference/strided.html
index 592b83e..8ff19e1 100644
--- a/doc/html/range/reference/adaptors/reference/strided.html
+++ b/doc/html/range/reference/adaptors/reference/strided.html
@@ -22,7 +22,7 @@
 <div class="spirit-nav">
 <a accesskey="p" href="sliced.html"><img src="../../../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../reference.html"><img src="../../../../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../../../../index.html"><img src="../../../../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="type_erased.html"><img src="../../../../../../../../doc/src/images/next.png" alt="Next"></a>
 </div>
-<div class="section">
+<div class="section range_reference_adaptors_reference_strided">
 <div class="titlepage"><div><div><h5 class="title">
 <a name="range.reference.adaptors.reference.strided"></a><a class="link" href="strided.html" title="strided">strided</a>
 </h5></div></div></div>
@@ -92,13 +92,12 @@
                 category of <code class="computeroutput"><span class="identifier">rng</span></code>.
               </li>
 </ul></div>
-<div class="section">
+<div class="section range_reference_adaptors_reference_strided_strided_example">
 <div class="titlepage"><div><div><h6 class="title">
 <a name="range.reference.adaptors.reference.strided.strided_example"></a><a class="link" href="strided.html#range.reference.adaptors.reference.strided.strided_example" title="strided example">strided
             example</a>
 </h6></div></div></div>
 <p>
-              
 </p>
 <pre class="programlisting"><span class="preprocessor">#include</span> <span class="special">&lt;</span><span class="identifier">boost</span><span class="special">/</span><span class="identifier">range</span><span class="special">/</span><span class="identifier">adaptor</span><span class="special">/</span><span class="identifier">strided</span><span class="special">.</span><span class="identifier">hpp</span><span class="special">&gt;</span>
 <span class="preprocessor">#include</span> <span class="special">&lt;</span><span class="identifier">boost</span><span class="special">/</span><span class="identifier">range</span><span class="special">/</span><span class="identifier">algorithm</span><span class="special">/</span><span class="identifier">copy</span><span class="special">.</span><span class="identifier">hpp</span><span class="special">&gt;</span>
@@ -126,7 +125,7 @@
             </p>
 </div>
 <p>
-            This would produce the output: 
+            This would produce the output:
 </p>
 <pre class="programlisting"><span class="number">1</span><span class="special">,</span><span class="number">3</span><span class="special">,</span><span class="number">5</span><span class="special">,</span><span class="number">7</span><span class="special">,</span><span class="number">9</span>
 </pre>
@@ -135,7 +134,8 @@
 </div>
 <table xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" width="100%"><tr>
 <td align="left"></td>
-<td align="right"><div class="copyright-footer">Copyright &#169; 2003 -2010 Thorsten Ottosen, Neil Groves<p>
+<td align="right"><div class="copyright-footer">Copyright &#169; 2003-2010 Thorsten Ottosen,
+      Neil Groves<p>
         Distributed under the Boost Software License, Version 1.0. (See accompanying
         file LICENSE_1_0.txt or copy at <a href="http://www.boost.org/LICENSE_1_0.txt" target="_top">http://www.boost.org/LICENSE_1_0.txt</a>)
       </p>
diff --git a/doc/html/range/reference/adaptors/reference/tokenized.html b/doc/html/range/reference/adaptors/reference/tokenized.html
index 2dfa506..1b9a97d 100644
--- a/doc/html/range/reference/adaptors/reference/tokenized.html
+++ b/doc/html/range/reference/adaptors/reference/tokenized.html
@@ -22,7 +22,7 @@
 <div class="spirit-nav">
 <a accesskey="p" href="type_erased.html"><img src="../../../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../reference.html"><img src="../../../../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../../../../index.html"><img src="../../../../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="transformed.html"><img src="../../../../../../../../doc/src/images/next.png" alt="Next"></a>
 </div>
-<div class="section">
+<div class="section range_reference_adaptors_reference_tokenized">
 <div class="titlepage"><div><div><h5 class="title">
 <a name="range.reference.adaptors.reference.tokenized"></a><a class="link" href="tokenized.html" title="tokenized">tokenized</a>
 </h5></div></div></div>
@@ -52,7 +52,6 @@
                   </td>
 <td>
                     <p>
-                      
 </p>
 <pre xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" class="table-programlisting"><span class="identifier">rng</span> <span class="special">|</span> <span class="identifier">boost</span><span class="special">::</span><span class="identifier">adaptors</span><span class="special">::</span><span class="identifier">tokenized</span><span class="special">(</span><span class="identifier">regex</span><span class="special">)</span>
 <span class="identifier">rng</span> <span class="special">|</span> <span class="identifier">boost</span><span class="special">::</span><span class="identifier">adaptors</span><span class="special">::</span><span class="identifier">tokenized</span><span class="special">(</span><span class="identifier">regex</span><span class="special">,</span> <span class="identifier">i</span><span class="special">)</span>
@@ -72,7 +71,6 @@
                   </td>
 <td>
                     <p>
-                      
 </p>
 <pre xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" class="table-programlisting"><span class="identifier">boost</span><span class="special">::</span><span class="identifier">adaptors</span><span class="special">::</span><span class="identifier">tokenize</span><span class="special">(</span><span class="identifier">rng</span><span class="special">,</span> <span class="identifier">regex</span><span class="special">)</span>
 <span class="identifier">boost</span><span class="special">::</span><span class="identifier">adaptors</span><span class="special">::</span><span class="identifier">tokenize</span><span class="special">(</span><span class="identifier">rng</span><span class="special">,</span> <span class="identifier">regex</span><span class="special">,</span> <span class="identifier">i</span><span class="special">)</span>
@@ -88,32 +86,30 @@
 </table></div>
 <div class="itemizedlist"><ul class="itemizedlist" type="disc">
 <li class="listitem">
-<p class="simpara">
                 <span class="bold"><strong>Precondition:</strong></span>
-              </p>
-<div class="itemizedlist"><ul class="itemizedlist" type="circle">
+                <div class="itemizedlist"><ul class="itemizedlist" type="circle">
 <li class="listitem">
-                    Let <code class="computeroutput"><span class="identifier">T</span></code> denote
-                    <code class="computeroutput"><span class="keyword">typename</span> <span class="identifier">range_value</span><span class="special">&lt;</span><span class="identifier">decltype</span><span class="special">(</span><span class="identifier">rng</span><span class="special">)&gt;::</span><span class="identifier">type</span></code>,
-                    then <code class="computeroutput"><span class="identifier">regex</span></code> has
-                    the type <code class="computeroutput"><span class="identifier">basic_regex</span><span class="special">&lt;</span><span class="identifier">T</span><span class="special">&gt;</span></code> or is implicitly convertible
-                    to one of these types.
-                  </li>
+                      Let <code class="computeroutput"><span class="identifier">T</span></code> denote
+                      <code class="computeroutput"><span class="keyword">typename</span> <span class="identifier">range_value</span><span class="special">&lt;</span><span class="identifier">decltype</span><span class="special">(</span><span class="identifier">rng</span><span class="special">)&gt;::</span><span class="identifier">type</span></code>,
+                      then <code class="computeroutput"><span class="identifier">regex</span></code>
+                      has the type <code class="computeroutput"><span class="identifier">basic_regex</span><span class="special">&lt;</span><span class="identifier">T</span><span class="special">&gt;</span></code> or is implicitly convertible
+                      to one of these types.
+                    </li>
 <li class="listitem">
-                    <code class="computeroutput"><span class="identifier">i</span></code> has the type
-                    <code class="computeroutput"><span class="keyword">int</span></code>.
-                  </li>
+                      <code class="computeroutput"><span class="identifier">i</span></code> has the type
+                      <code class="computeroutput"><span class="keyword">int</span></code>.
+                    </li>
 <li class="listitem">
-                    the <code class="computeroutput"><span class="identifier">value_type</span></code>
-                    of <code class="computeroutput"><span class="identifier">rndRng</span></code> is
-                    <code class="computeroutput"><span class="keyword">int</span></code>.
-                  </li>
+                      the <code class="computeroutput"><span class="identifier">value_type</span></code>
+                      of <code class="computeroutput"><span class="identifier">rndRng</span></code> is
+                      <code class="computeroutput"><span class="keyword">int</span></code>.
+                    </li>
 <li class="listitem">
-                    <code class="computeroutput"><span class="identifier">flags</span></code> has the
-                    type <code class="computeroutput"><span class="identifier">regex_constants</span><span class="special">::</span><span class="identifier">syntax_option_type</span></code>.
-                  </li>
+                      <code class="computeroutput"><span class="identifier">flags</span></code> has the
+                      type <code class="computeroutput"><span class="identifier">regex_constants</span><span class="special">::</span><span class="identifier">syntax_option_type</span></code>.
+                    </li>
 </ul></div>
-</li>
+              </li>
 <li class="listitem">
                 <span class="bold"><strong>Returns:</strong></span> A range whose iterators
                 behave as if they were the original iterators wrapped in <code class="computeroutput"><span class="identifier">regex_token_iterator</span></code>. The first
@@ -141,7 +137,8 @@
 </div>
 <table xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" width="100%"><tr>
 <td align="left"></td>
-<td align="right"><div class="copyright-footer">Copyright &#169; 2003 -2010 Thorsten Ottosen, Neil Groves<p>
+<td align="right"><div class="copyright-footer">Copyright &#169; 2003-2010 Thorsten Ottosen,
+      Neil Groves<p>
         Distributed under the Boost Software License, Version 1.0. (See accompanying
         file LICENSE_1_0.txt or copy at <a href="http://www.boost.org/LICENSE_1_0.txt" target="_top">http://www.boost.org/LICENSE_1_0.txt</a>)
       </p>
diff --git a/doc/html/range/reference/adaptors/reference/transformed.html b/doc/html/range/reference/adaptors/reference/transformed.html
index 97200e9..9a272b0 100644
--- a/doc/html/range/reference/adaptors/reference/transformed.html
+++ b/doc/html/range/reference/adaptors/reference/transformed.html
@@ -22,7 +22,7 @@
 <div class="spirit-nav">
 <a accesskey="p" href="tokenized.html"><img src="../../../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../reference.html"><img src="../../../../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../../../../index.html"><img src="../../../../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="uniqued.html"><img src="../../../../../../../../doc/src/images/next.png" alt="Next"></a>
 </div>
-<div class="section">
+<div class="section range_reference_adaptors_reference_transformed">
 <div class="titlepage"><div><div><h5 class="title">
 <a name="range.reference.adaptors.reference.transformed"></a><a class="link" href="transformed.html" title="transformed">transformed</a>
 </h5></div></div></div>
@@ -103,13 +103,12 @@
                 category of <code class="computeroutput"><span class="identifier">rng</span></code>.
               </li>
 </ul></div>
-<div class="section">
+<div class="section range_reference_adaptors_reference_transformed_transformed_example">
 <div class="titlepage"><div><div><h6 class="title">
 <a name="range.reference.adaptors.reference.transformed.transformed_example"></a><a class="link" href="transformed.html#range.reference.adaptors.reference.transformed.transformed_example" title="transformed example">transformed
             example</a>
 </h6></div></div></div>
 <p>
-              
 </p>
 <pre class="programlisting"><span class="preprocessor">#include</span> <span class="special">&lt;</span><span class="identifier">boost</span><span class="special">/</span><span class="identifier">range</span><span class="special">/</span><span class="identifier">adaptor</span><span class="special">/</span><span class="identifier">transformed</span><span class="special">.</span><span class="identifier">hpp</span><span class="special">&gt;</span>
 <span class="preprocessor">#include</span> <span class="special">&lt;</span><span class="identifier">boost</span><span class="special">/</span><span class="identifier">range</span><span class="special">/</span><span class="identifier">algorithm</span><span class="special">/</span><span class="identifier">copy</span><span class="special">.</span><span class="identifier">hpp</span><span class="special">&gt;</span>
@@ -143,7 +142,7 @@
             </p>
 </div>
 <p>
-            This would produce the output: 
+            This would produce the output:
 </p>
 <pre class="programlisting"><span class="number">2</span><span class="special">,</span><span class="number">4</span><span class="special">,</span><span class="number">6</span><span class="special">,</span><span class="number">8</span><span class="special">,</span><span class="number">10</span><span class="special">,</span><span class="number">12</span><span class="special">,</span><span class="number">14</span><span class="special">,</span><span class="number">16</span><span class="special">,</span><span class="number">18</span><span class="special">,</span><span class="number">20</span>
 </pre>
@@ -152,7 +151,8 @@
 </div>
 <table xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" width="100%"><tr>
 <td align="left"></td>
-<td align="right"><div class="copyright-footer">Copyright &#169; 2003 -2010 Thorsten Ottosen, Neil Groves<p>
+<td align="right"><div class="copyright-footer">Copyright &#169; 2003-2010 Thorsten Ottosen,
+      Neil Groves<p>
         Distributed under the Boost Software License, Version 1.0. (See accompanying
         file LICENSE_1_0.txt or copy at <a href="http://www.boost.org/LICENSE_1_0.txt" target="_top">http://www.boost.org/LICENSE_1_0.txt</a>)
       </p>
diff --git a/doc/html/range/reference/adaptors/reference/type_erased.html b/doc/html/range/reference/adaptors/reference/type_erased.html
index 87649ee..c678e56 100644
--- a/doc/html/range/reference/adaptors/reference/type_erased.html
+++ b/doc/html/range/reference/adaptors/reference/type_erased.html
@@ -22,7 +22,7 @@
 <div class="spirit-nav">
 <a accesskey="p" href="strided.html"><img src="../../../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../reference.html"><img src="../../../../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../../../../index.html"><img src="../../../../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="tokenized.html"><img src="../../../../../../../../doc/src/images/next.png" alt="Next"></a>
 </div>
-<div class="section">
+<div class="section range_reference_adaptors_reference_type_erased">
 <div class="titlepage"><div><div><h5 class="title">
 <a name="range.reference.adaptors.reference.type_erased"></a><a class="link" href="type_erased.html" title="type_erased">type_erased</a>
 </h5></div></div></div>
@@ -92,48 +92,48 @@
           </p>
 <div class="itemizedlist"><ul class="itemizedlist" type="disc">
 <li class="listitem">
-<p class="simpara">
                 <span class="bold"><strong>Template parameters:</strong></span>
-              </p>
-<div class="itemizedlist"><ul class="itemizedlist" type="circle">
+                <div class="itemizedlist"><ul class="itemizedlist" type="circle">
 <li class="listitem">
-                    <code class="computeroutput"><span class="identifier">Value</span></code> is the
-                    <code class="computeroutput"><span class="identifier">value_type</span></code> for
-                    the <code class="computeroutput"><span class="identifier">any_range</span></code>.
-                    If this is set to boost::use_default, <code class="computeroutput"><span class="identifier">Value</span></code>
-                    will be calculated from the range type when the adaptor is applied.
-                  </li>
+                      <code class="computeroutput"><span class="identifier">Value</span></code> is the
+                      <code class="computeroutput"><span class="identifier">value_type</span></code>
+                      for the <code class="computeroutput"><span class="identifier">any_range</span></code>.
+                      If this is set to boost::use_default, <code class="computeroutput"><span class="identifier">Value</span></code>
+                      will be calculated from the range type when the adaptor is
+                      applied.
+                    </li>
 <li class="listitem">
-                    <code class="computeroutput"><span class="identifier">Traversal</span></code> is
-                    the tag used to identify the traversal of the resultant range.
-                    Frequently it is desireable to set a traversal category lower
-                    than the source container or range to maximize the number of
-                    ranges that can convert to the <code class="computeroutput"><span class="identifier">any_range</span></code>.
-                    If this is left as boost::use_default then <code class="computeroutput"><span class="identifier">Traversal</span></code>
-                    will be <code class="computeroutput"><span class="keyword">typename</span> <span class="identifier">boost</span><span class="special">::</span><span class="identifier">iterator_traversal</span><span class="special">&lt;</span><span class="identifier">boost</span><span class="special">::</span><span class="identifier">range_iterator</span><span class="special">&lt;</span><span class="identifier">Rng</span><span class="special">&gt;::</span><span class="identifier">type</span><span class="special">&gt;::</span><span class="identifier">type</span></code>
-                  </li>
+                      <code class="computeroutput"><span class="identifier">Traversal</span></code> is
+                      the tag used to identify the traversal of the resultant range.
+                      Frequently it is desireable to set a traversal category lower
+                      than the source container or range to maximize the number of
+                      ranges that can convert to the <code class="computeroutput"><span class="identifier">any_range</span></code>.
+                      If this is left as boost::use_default then <code class="computeroutput"><span class="identifier">Traversal</span></code>
+                      will be <code class="computeroutput"><span class="keyword">typename</span> <span class="identifier">boost</span><span class="special">::</span><span class="identifier">iterator_traversal</span><span class="special">&lt;</span><span class="identifier">boost</span><span class="special">::</span><span class="identifier">range_iterator</span><span class="special">&lt;</span><span class="identifier">Rng</span><span class="special">&gt;::</span><span class="identifier">type</span><span class="special">&gt;::</span><span class="identifier">type</span></code>
+                    </li>
 <li class="listitem">
-                    <code class="computeroutput"><span class="identifier">Reference</span></code> is
-                    the <code class="computeroutput"><span class="identifier">reference</span></code>
-                    for the <code class="computeroutput"><span class="identifier">any_range</span></code>.
-                    <code class="computeroutput"><span class="identifier">boost</span><span class="special">::</span><span class="identifier">use_default</span></code> will equate to
-                    <code class="computeroutput"><span class="keyword">typename</span> <span class="identifier">range_reference</span><span class="special">&lt;</span><span class="identifier">Rng</span><span class="special">&gt;::</span><span class="identifier">type</span></code>.
-                  </li>
+                      <code class="computeroutput"><span class="identifier">Reference</span></code> is
+                      the <code class="computeroutput"><span class="identifier">reference</span></code>
+                      for the <code class="computeroutput"><span class="identifier">any_range</span></code>.
+                      <code class="computeroutput"><span class="identifier">boost</span><span class="special">::</span><span class="identifier">use_default</span></code> will equate to
+                      <code class="computeroutput"><span class="keyword">typename</span> <span class="identifier">range_reference</span><span class="special">&lt;</span><span class="identifier">Rng</span><span class="special">&gt;::</span><span class="identifier">type</span></code>.
+                    </li>
 <li class="listitem">
-                    <code class="computeroutput"><span class="identifier">Difference</span></code> is
-                    the <code class="computeroutput"><span class="identifier">difference_type</span></code>
-                    for the any_range. <code class="computeroutput"><span class="identifier">boost</span><span class="special">::</span><span class="identifier">use_default</span></code>
-                    will equate to <code class="computeroutput"><span class="keyword">typename</span>
-                    <span class="identifier">boost</span><span class="special">::</span><span class="identifier">range_difference</span><span class="special">&lt;</span><span class="identifier">Rng</span><span class="special">&gt;::</span><span class="identifier">type</span></code>
-                  </li>
+                      <code class="computeroutput"><span class="identifier">Difference</span></code>
+                      is the <code class="computeroutput"><span class="identifier">difference_type</span></code>
+                      for the any_range. <code class="computeroutput"><span class="identifier">boost</span><span class="special">::</span><span class="identifier">use_default</span></code>
+                      will equate to <code class="computeroutput"><span class="keyword">typename</span>
+                      <span class="identifier">boost</span><span class="special">::</span><span class="identifier">range_difference</span><span class="special">&lt;</span><span class="identifier">Rng</span><span class="special">&gt;::</span><span class="identifier">type</span></code>
+                    </li>
 <li class="listitem">
-                    <code class="computeroutput"><span class="identifier">Buffer</span></code> is the
-                    storage used to allocate the underlying iterator wrappers. This
-                    can typically be ignored, but is available as a template parameter
-                    for customization. Buffer must be a model of the <code class="computeroutput"><span class="identifier">AnyIteratorBufferConcept</span></code>.
-                  </li>
+                      <code class="computeroutput"><span class="identifier">Buffer</span></code> is the
+                      storage used to allocate the underlying iterator wrappers.
+                      This can typically be ignored, but is available as a template
+                      parameter for customization. Buffer must be a model of the
+                      <code class="computeroutput"><span class="identifier">AnyIteratorBufferConcept</span></code>.
+                    </li>
 </ul></div>
-</li>
+              </li>
 <li class="listitem">
                 <span class="bold"><strong>Precondition:</strong></span> <code class="computeroutput"><span class="identifier">Traversal</span></code>
                 is one of <code class="computeroutput"><span class="special">{</span> <span class="identifier">boost</span><span class="special">::</span><span class="identifier">use_default</span><span class="special">,</span> <span class="identifier">boost</span><span class="special">::</span><span class="identifier">single_pass_traversal_tag</span><span class="special">,</span> <span class="identifier">boost</span><span class="special">::</span><span class="identifier">forward_traversal_tag</span><span class="special">,</span> <span class="identifier">boost</span><span class="special">::</span><span class="identifier">bidirectional_traversal_tag</span><span class="special">,</span> <span class="identifier">boost</span><span class="special">::</span><span class="identifier">random_access_traversal_tag</span>
@@ -153,12 +153,11 @@
                 otherwise <code class="computeroutput"><span class="identifier">Traversal</span></code>.
               </li>
 </ul></div>
-<a name="range.reference.adaptors.reference.type_erased.anyiteratorbufferconcept"></a><h6>
-<a name="id677095"></a>
-            <a class="link" href="type_erased.html#range.reference.adaptors.reference.type_erased.anyiteratorbufferconcept">AnyIteratorBufferConcept</a>
+<h6>
+<a name="range.reference.adaptors.reference.type_erased.h0"></a>
+            <span><a name="range.reference.adaptors.reference.type_erased.anyiteratorbufferconcept"></a></span><a class="link" href="type_erased.html#range.reference.adaptors.reference.type_erased.anyiteratorbufferconcept">AnyIteratorBufferConcept</a>
           </h6>
 <p>
-            
 </p>
 <pre class="programlisting"><span class="keyword">class</span> <span class="identifier">AnyIteratorBufferConcept</span>
 <span class="special">{</span>
@@ -166,27 +165,26 @@
     <span class="identifier">AnyIteratorBufferConcept</span><span class="special">();</span>
     <span class="special">~</span><span class="identifier">AnyIteratorBufferConcept</span><span class="special">();</span>
 
-    <span class="comment">// bytes is the requested size to allocate. This function
-</span>    <span class="comment">// must return a pointer to an adequate area of memory.
-</span>    <span class="comment">// throws: bad_alloc
-</span>    <span class="comment">//
-</span>    <span class="comment">// The buffer will only ever have zero or one
-</span>    <span class="comment">// outstanding memory allocations.
-</span>    <span class="keyword">void</span><span class="special">*</span> <span class="identifier">allocate</span><span class="special">(</span><span class="identifier">std</span><span class="special">::</span><span class="identifier">size_t</span> <span class="identifier">bytes</span><span class="special">);</span>
+    <span class="comment">// bytes is the requested size to allocate. This function</span>
+    <span class="comment">// must return a pointer to an adequate area of memory.</span>
+    <span class="comment">// throws: bad_alloc</span>
+    <span class="comment">//</span>
+    <span class="comment">// The buffer will only ever have zero or one</span>
+    <span class="comment">// outstanding memory allocations.</span>
+    <span class="keyword">void</span><span class="special">*</span> <span class="identifier">allocate</span><span class="special">(</span><span class="identifier">std</span><span class="special">::</span><span class="identifier">size_t</span> <span class="identifier">bytes</span><span class="special">);</span>
 
-    <span class="comment">// deallocate this buffer
-</span>    <span class="keyword">void</span> <span class="identifier">deallocate</span><span class="special">();</span>
+    <span class="comment">// deallocate this buffer</span>
+    <span class="keyword">void</span> <span class="identifier">deallocate</span><span class="special">();</span>
 <span class="special">};</span>
 </pre>
 <p>
           </p>
-<div class="section">
+<div class="section range_reference_adaptors_reference_type_erased_type_erased_example">
 <div class="titlepage"><div><div><h6 class="title">
 <a name="range.reference.adaptors.reference.type_erased.type_erased_example"></a><a class="link" href="type_erased.html#range.reference.adaptors.reference.type_erased.type_erased_example" title="type-erased example">type-erased
             example</a>
 </h6></div></div></div>
 <p>
-              
 </p>
 <pre class="programlisting"><span class="preprocessor">#include</span> <span class="special">&lt;</span><span class="identifier">boost</span><span class="special">/</span><span class="identifier">range</span><span class="special">/</span><span class="identifier">adaptor</span><span class="special">/</span><span class="identifier">type_erased</span><span class="special">.</span><span class="identifier">hpp</span><span class="special">&gt;</span>
 <span class="preprocessor">#include</span> <span class="special">&lt;</span><span class="identifier">boost</span><span class="special">/</span><span class="identifier">range</span><span class="special">/</span><span class="identifier">algorithm</span><span class="special">/</span><span class="identifier">copy</span><span class="special">.</span><span class="identifier">hpp</span><span class="special">&gt;</span>
@@ -197,9 +195,9 @@
 <span class="preprocessor">#include</span> <span class="special">&lt;</span><span class="identifier">list</span><span class="special">&gt;</span>
 <span class="preprocessor">#include</span> <span class="special">&lt;</span><span class="identifier">vector</span><span class="special">&gt;</span>
 
-<span class="comment">// The client interface from an OO perspective merely requires a sequence
-</span><span class="comment">// of integers that can be forward traversed
-</span><span class="keyword">typedef</span> <span class="identifier">boost</span><span class="special">::</span><span class="identifier">any_range</span><span class="special">&lt;</span>
+<span class="comment">// The client interface from an OO perspective merely requires a sequence</span>
+<span class="comment">// of integers that can be forward traversed</span>
+<span class="keyword">typedef</span> <span class="identifier">boost</span><span class="special">::</span><span class="identifier">any_range</span><span class="special">&lt;</span>
     <span class="keyword">int</span>
   <span class="special">,</span> <span class="identifier">boost</span><span class="special">::</span><span class="identifier">forward_traversal_tag</span>
   <span class="special">,</span> <span class="keyword">int</span>
@@ -224,47 +222,47 @@
         <span class="keyword">using</span> <span class="keyword">namespace</span> <span class="identifier">boost</span><span class="special">::</span><span class="identifier">assign</span><span class="special">;</span>
         <span class="keyword">using</span> <span class="keyword">namespace</span> <span class="identifier">boost</span><span class="special">::</span><span class="identifier">adaptors</span><span class="special">;</span>
 
-        <span class="comment">// Under most conditions one would simply use an appropriate
-</span>        <span class="comment">// any_range as a function parameter. The type_erased adaptor
-</span>        <span class="comment">// is often superfluous. However because the type_erased
-</span>        <span class="comment">// adaptor is applied to a range, we can use default template
-</span>        <span class="comment">// arguments that are generated in conjunction with the
-</span>        <span class="comment">// range type to which we are applying the adaptor.
-</span>
+        <span class="comment">// Under most conditions one would simply use an appropriate</span>
+        <span class="comment">// any_range as a function parameter. The type_erased adaptor</span>
+        <span class="comment">// is often superfluous. However because the type_erased</span>
+        <span class="comment">// adaptor is applied to a range, we can use default template</span>
+        <span class="comment">// arguments that are generated in conjunction with the</span>
+        <span class="comment">// range type to which we are applying the adaptor.</span>
+
         <span class="identifier">std</span><span class="special">::</span><span class="identifier">vector</span><span class="special">&lt;</span><span class="keyword">int</span><span class="special">&gt;</span> <span class="identifier">input</span><span class="special">;</span>
         <span class="identifier">input</span> <span class="special">+=</span> <span class="number">1</span><span class="special">,</span><span class="number">2</span><span class="special">,</span><span class="number">3</span><span class="special">,</span><span class="number">4</span><span class="special">,</span><span class="number">5</span><span class="special">;</span>
 
-        <span class="comment">// Note that this call is to a non-template function
-</span>        <span class="identifier">server</span><span class="special">::</span><span class="identifier">display_integers</span><span class="special">(</span><span class="identifier">input</span><span class="special">);</span>
+        <span class="comment">// Note that this call is to a non-template function</span>
+        <span class="identifier">server</span><span class="special">::</span><span class="identifier">display_integers</span><span class="special">(</span><span class="identifier">input</span><span class="special">);</span>
 
         <span class="identifier">std</span><span class="special">::</span><span class="identifier">list</span><span class="special">&lt;</span><span class="keyword">int</span><span class="special">&gt;</span> <span class="identifier">input2</span><span class="special">;</span>
         <span class="identifier">input2</span> <span class="special">+=</span> <span class="number">6</span><span class="special">,</span><span class="number">7</span><span class="special">,</span><span class="number">8</span><span class="special">,</span><span class="number">9</span><span class="special">,</span><span class="number">10</span><span class="special">;</span>
 
-        <span class="comment">// Note that this call is to the same non-tempate function
-</span>        <span class="identifier">server</span><span class="special">::</span><span class="identifier">display_integers</span><span class="special">(</span><span class="identifier">input2</span><span class="special">);</span>
+        <span class="comment">// Note that this call is to the same non-tempate function</span>
+        <span class="identifier">server</span><span class="special">::</span><span class="identifier">display_integers</span><span class="special">(</span><span class="identifier">input2</span><span class="special">);</span>
 
         <span class="identifier">input2</span><span class="special">.</span><span class="identifier">clear</span><span class="special">();</span>
         <span class="identifier">input2</span> <span class="special">+=</span> <span class="number">11</span><span class="special">,</span><span class="number">12</span><span class="special">,</span><span class="number">13</span><span class="special">,</span><span class="number">14</span><span class="special">,</span><span class="number">15</span><span class="special">;</span>
 
-        <span class="comment">// Calling using the adaptor looks like this:
-</span>        <span class="comment">// Notice that here I have a type_erased that would be a
-</span>        <span class="comment">// bidirectional_traversal_tag, but this is convertible
-</span>        <span class="comment">// to the forward_traversal_tag equivalent hence this
-</span>        <span class="comment">// works.
-</span>        <span class="identifier">server</span><span class="special">::</span><span class="identifier">display_integers</span><span class="special">(</span><span class="identifier">input2</span> <span class="special">|</span> <span class="identifier">type_erased</span><span class="special">&lt;&gt;());</span>
+        <span class="comment">// Calling using the adaptor looks like this:</span>
+        <span class="comment">// Notice that here I have a type_erased that would be a</span>
+        <span class="comment">// bidirectional_traversal_tag, but this is convertible</span>
+        <span class="comment">// to the forward_traversal_tag equivalent hence this</span>
+        <span class="comment">// works.</span>
+        <span class="identifier">server</span><span class="special">::</span><span class="identifier">display_integers</span><span class="special">(</span><span class="identifier">input2</span> <span class="special">|</span> <span class="identifier">type_erased</span><span class="special">&lt;&gt;());</span>
 
-        <span class="comment">// However we may simply wish to define an adaptor that
-</span>        <span class="comment">// takes a range and makes it into an appropriate
-</span>        <span class="comment">// forward_traversal any_range...
-</span>        <span class="keyword">typedef</span> <span class="identifier">boost</span><span class="special">::</span><span class="identifier">adaptors</span><span class="special">::</span><span class="identifier">type_erased</span><span class="special">&lt;</span>
+        <span class="comment">// However we may simply wish to define an adaptor that</span>
+        <span class="comment">// takes a range and makes it into an appropriate</span>
+        <span class="comment">// forward_traversal any_range...</span>
+        <span class="keyword">typedef</span> <span class="identifier">boost</span><span class="special">::</span><span class="identifier">adaptors</span><span class="special">::</span><span class="identifier">type_erased</span><span class="special">&lt;</span>
             <span class="identifier">boost</span><span class="special">::</span><span class="identifier">use_default</span>
           <span class="special">,</span> <span class="identifier">boost</span><span class="special">::</span><span class="identifier">forward_traversal_tag</span>
         <span class="special">&gt;</span> <span class="identifier">type_erased_forward</span><span class="special">;</span>
 
-        <span class="comment">// This adaptor can turn other containers with different
-</span>        <span class="comment">// value_types and reference_types into the appropriate
-</span>        <span class="comment">// any_range.
-</span>
+        <span class="comment">// This adaptor can turn other containers with different</span>
+        <span class="comment">// value_types and reference_types into the appropriate</span>
+        <span class="comment">// any_range.</span>
+
         <span class="identifier">server</span><span class="special">::</span><span class="identifier">display_integers</span><span class="special">(</span><span class="identifier">input2</span> <span class="special">|</span> <span class="identifier">type_erased_forward</span><span class="special">());</span>
     <span class="special">}</span>
 <span class="special">}</span>
@@ -279,7 +277,7 @@
             </p>
 </div>
 <p>
-            This would produce the output: 
+            This would produce the output:
 </p>
 <pre class="programlisting"><span class="number">1</span><span class="special">,</span><span class="number">2</span><span class="special">,</span><span class="number">3</span><span class="special">,</span><span class="number">4</span><span class="special">,</span><span class="number">5</span>
 <span class="number">6</span><span class="special">,</span><span class="number">7</span><span class="special">,</span><span class="number">8</span><span class="special">,</span><span class="number">9</span><span class="special">,</span><span class="number">10</span>
@@ -291,7 +289,8 @@
 </div>
 <table xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" width="100%"><tr>
 <td align="left"></td>
-<td align="right"><div class="copyright-footer">Copyright &#169; 2003 -2010 Thorsten Ottosen, Neil Groves<p>
+<td align="right"><div class="copyright-footer">Copyright &#169; 2003-2010 Thorsten Ottosen,
+      Neil Groves<p>
         Distributed under the Boost Software License, Version 1.0. (See accompanying
         file LICENSE_1_0.txt or copy at <a href="http://www.boost.org/LICENSE_1_0.txt" target="_top">http://www.boost.org/LICENSE_1_0.txt</a>)
       </p>
diff --git a/doc/html/range/reference/adaptors/reference/uniqued.html b/doc/html/range/reference/adaptors/reference/uniqued.html
index 4174cf8..2ef82e0 100644
--- a/doc/html/range/reference/adaptors/reference/uniqued.html
+++ b/doc/html/range/reference/adaptors/reference/uniqued.html
@@ -22,7 +22,7 @@
 <div class="spirit-nav">
 <a accesskey="p" href="transformed.html"><img src="../../../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../reference.html"><img src="../../../../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../../../../index.html"><img src="../../../../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="../../algorithms.html"><img src="../../../../../../../../doc/src/images/next.png" alt="Next"></a>
 </div>
-<div class="section">
+<div class="section range_reference_adaptors_reference_uniqued">
 <div class="titlepage"><div><div><h5 class="title">
 <a name="range.reference.adaptors.reference.uniqued"></a><a class="link" href="uniqued.html" title="uniqued">uniqued</a>
 </h5></div></div></div>
@@ -95,13 +95,12 @@
                 and <a class="link" href="../../../concepts/forward_range.html" title="Forward Range">Forward Range</a>.
               </li>
 </ul></div>
-<div class="section">
+<div class="section range_reference_adaptors_reference_uniqued_uniqued_example">
 <div class="titlepage"><div><div><h6 class="title">
 <a name="range.reference.adaptors.reference.uniqued.uniqued_example"></a><a class="link" href="uniqued.html#range.reference.adaptors.reference.uniqued.uniqued_example" title="uniqued example">uniqued
             example</a>
 </h6></div></div></div>
 <p>
-              
 </p>
 <pre class="programlisting"><span class="preprocessor">#include</span> <span class="special">&lt;</span><span class="identifier">boost</span><span class="special">/</span><span class="identifier">range</span><span class="special">/</span><span class="identifier">adaptor</span><span class="special">/</span><span class="identifier">uniqued</span><span class="special">.</span><span class="identifier">hpp</span><span class="special">&gt;</span>
 <span class="preprocessor">#include</span> <span class="special">&lt;</span><span class="identifier">boost</span><span class="special">/</span><span class="identifier">range</span><span class="special">/</span><span class="identifier">algorithm</span><span class="special">/</span><span class="identifier">copy</span><span class="special">.</span><span class="identifier">hpp</span><span class="special">&gt;</span>
@@ -127,7 +126,7 @@
             </p>
 </div>
 <p>
-            This would produce the output: 
+            This would produce the output:
 </p>
 <pre class="programlisting"><span class="number">1</span><span class="special">,</span><span class="number">2</span><span class="special">,</span><span class="number">3</span><span class="special">,</span><span class="number">4</span><span class="special">,</span><span class="number">5</span><span class="special">,</span><span class="number">6</span>
 </pre>
@@ -136,7 +135,8 @@
 </div>
 <table xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" width="100%"><tr>
 <td align="left"></td>
-<td align="right"><div class="copyright-footer">Copyright &#169; 2003 -2010 Thorsten Ottosen, Neil Groves<p>
+<td align="right"><div class="copyright-footer">Copyright &#169; 2003-2010 Thorsten Ottosen,
+      Neil Groves<p>
         Distributed under the Boost Software License, Version 1.0. (See accompanying
         file LICENSE_1_0.txt or copy at <a href="http://www.boost.org/LICENSE_1_0.txt" target="_top">http://www.boost.org/LICENSE_1_0.txt</a>)
       </p>
diff --git a/doc/html/range/reference/algorithms.html b/doc/html/range/reference/algorithms.html
index bd65e72..cf8b5c2 100644
--- a/doc/html/range/reference/algorithms.html
+++ b/doc/html/range/reference/algorithms.html
@@ -22,7 +22,7 @@
 <div class="spirit-nav">
 <a accesskey="p" href="adaptors/reference/uniqued.html"><img src="../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../reference.html"><img src="../../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../../index.html"><img src="../../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="algorithms/introduction.html"><img src="../../../../../../doc/src/images/next.png" alt="Next"></a>
 </div>
-<div class="section">
+<div class="section range_reference_algorithms">
 <div class="titlepage"><div><div><h3 class="title">
 <a name="range.reference.algorithms"></a><a class="link" href="algorithms.html" title="Range Algorithms">Range Algorithms</a>
 </h3></div></div></div>
@@ -42,7 +42,8 @@
 </div>
 <table xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" width="100%"><tr>
 <td align="left"></td>
-<td align="right"><div class="copyright-footer">Copyright &#169; 2003 -2010 Thorsten Ottosen, Neil Groves<p>
+<td align="right"><div class="copyright-footer">Copyright &#169; 2003-2010 Thorsten Ottosen,
+      Neil Groves<p>
         Distributed under the Boost Software License, Version 1.0. (See accompanying
         file LICENSE_1_0.txt or copy at <a href="http://www.boost.org/LICENSE_1_0.txt" target="_top">http://www.boost.org/LICENSE_1_0.txt</a>)
       </p>
diff --git a/doc/html/range/reference/algorithms/heap.html b/doc/html/range/reference/algorithms/heap.html
index 66d79ce..971f72b 100644
--- a/doc/html/range/reference/algorithms/heap.html
+++ b/doc/html/range/reference/algorithms/heap.html
@@ -22,7 +22,7 @@
 <div class="spirit-nav">
 <a accesskey="p" href="set/set_symmetric_difference.html"><img src="../../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../algorithms.html"><img src="../../../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../../../index.html"><img src="../../../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="heap/push_heap.html"><img src="../../../../../../../doc/src/images/next.png" alt="Next"></a>
 </div>
-<div class="section">
+<div class="section range_reference_algorithms_heap">
 <div class="titlepage"><div><div><h4 class="title">
 <a name="range.reference.algorithms.heap"></a><a class="link" href="heap.html" title="Heap algorithms">Heap algorithms</a>
 </h4></div></div></div>
@@ -35,7 +35,8 @@
 </div>
 <table xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" width="100%"><tr>
 <td align="left"></td>
-<td align="right"><div class="copyright-footer">Copyright &#169; 2003 -2010 Thorsten Ottosen, Neil Groves<p>
+<td align="right"><div class="copyright-footer">Copyright &#169; 2003-2010 Thorsten Ottosen,
+      Neil Groves<p>
         Distributed under the Boost Software License, Version 1.0. (See accompanying
         file LICENSE_1_0.txt or copy at <a href="http://www.boost.org/LICENSE_1_0.txt" target="_top">http://www.boost.org/LICENSE_1_0.txt</a>)
       </p>
diff --git a/doc/html/range/reference/algorithms/heap/make_heap.html b/doc/html/range/reference/algorithms/heap/make_heap.html
index 3d4b6ec..e7309f6 100644
--- a/doc/html/range/reference/algorithms/heap/make_heap.html
+++ b/doc/html/range/reference/algorithms/heap/make_heap.html
@@ -22,16 +22,15 @@
 <div class="spirit-nav">
 <a accesskey="p" href="pop_heap.html"><img src="../../../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../heap.html"><img src="../../../../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../../../../index.html"><img src="../../../../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="sort_heap.html"><img src="../../../../../../../../doc/src/images/next.png" alt="Next"></a>
 </div>
-<div class="section">
+<div class="section range_reference_algorithms_heap_make_heap">
 <div class="titlepage"><div><div><h5 class="title">
 <a name="range.reference.algorithms.heap.make_heap"></a><a class="link" href="make_heap.html" title="make_heap">make_heap</a>
 </h5></div></div></div>
-<a name="range.reference.algorithms.heap.make_heap.prototype"></a><h6>
-<a name="id741272"></a>
-            <a class="link" href="make_heap.html#range.reference.algorithms.heap.make_heap.prototype">Prototype</a>
+<h6>
+<a name="range.reference.algorithms.heap.make_heap.h0"></a>
+            <span><a name="range.reference.algorithms.heap.make_heap.prototype"></a></span><a class="link" href="make_heap.html#range.reference.algorithms.heap.make_heap.prototype">Prototype</a>
           </h6>
 <p>
-            
 </p>
 <pre class="programlisting"><span class="keyword">template</span><span class="special">&lt;</span><span class="keyword">class</span> <span class="identifier">RandomAccessRange</span><span class="special">&gt;</span>
 <span class="identifier">RandomAccessRange</span><span class="special">&amp;</span> <span class="identifier">make_heap</span><span class="special">(</span><span class="identifier">RandomAccessRange</span><span class="special">&amp;</span> <span class="identifier">rng</span><span class="special">);</span>
@@ -47,9 +46,9 @@
 </pre>
 <p>
           </p>
-<a name="range.reference.algorithms.heap.make_heap.description"></a><h6>
-<a name="id741648"></a>
-            <a class="link" href="make_heap.html#range.reference.algorithms.heap.make_heap.description">Description</a>
+<h6>
+<a name="range.reference.algorithms.heap.make_heap.h1"></a>
+            <span><a name="range.reference.algorithms.heap.make_heap.description"></a></span><a class="link" href="make_heap.html#range.reference.algorithms.heap.make_heap.description">Description</a>
           </h6>
 <p>
             <code class="computeroutput"><span class="identifier">make_heap</span></code> turns <code class="computeroutput"><span class="identifier">rng</span></code> into a heap.
@@ -59,16 +58,16 @@
             by evaluating <code class="computeroutput"><span class="identifier">pred</span></code> in
             the predicate versions.
           </p>
-<a name="range.reference.algorithms.heap.make_heap.definition"></a><h6>
-<a name="id741722"></a>
-            <a class="link" href="make_heap.html#range.reference.algorithms.heap.make_heap.definition">Definition</a>
+<h6>
+<a name="range.reference.algorithms.heap.make_heap.h2"></a>
+            <span><a name="range.reference.algorithms.heap.make_heap.definition"></a></span><a class="link" href="make_heap.html#range.reference.algorithms.heap.make_heap.definition">Definition</a>
           </h6>
 <p>
             Defined in the header file <code class="computeroutput"><span class="identifier">boost</span><span class="special">/</span><span class="identifier">range</span><span class="special">/</span><span class="identifier">algorithm</span><span class="special">/</span><span class="identifier">heap_algorithm</span><span class="special">.</span><span class="identifier">hpp</span></code>
           </p>
-<a name="range.reference.algorithms.heap.make_heap.requirements"></a><h6>
-<a name="id741791"></a>
-            <a class="link" href="make_heap.html#range.reference.algorithms.heap.make_heap.requirements">Requirements</a>
+<h6>
+<a name="range.reference.algorithms.heap.make_heap.h3"></a>
+            <span><a name="range.reference.algorithms.heap.make_heap.requirements"></a></span><a class="link" href="make_heap.html#range.reference.algorithms.heap.make_heap.requirements">Requirements</a>
           </h6>
 <p>
             <span class="bold"><strong>For the non-predicate versions:</strong></span>
@@ -117,9 +116,9 @@
                 argument types.
               </li>
 </ul></div>
-<a name="range.reference.algorithms.heap.make_heap.complexity"></a><h6>
-<a name="id742039"></a>
-            <a class="link" href="make_heap.html#range.reference.algorithms.heap.make_heap.complexity">Complexity</a>
+<h6>
+<a name="range.reference.algorithms.heap.make_heap.h4"></a>
+            <span><a name="range.reference.algorithms.heap.make_heap.complexity"></a></span><a class="link" href="make_heap.html#range.reference.algorithms.heap.make_heap.complexity">Complexity</a>
           </h6>
 <p>
             Linear. At most <code class="computeroutput"><span class="number">3</span> <span class="special">*</span>
@@ -129,7 +128,8 @@
 </div>
 <table xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" width="100%"><tr>
 <td align="left"></td>
-<td align="right"><div class="copyright-footer">Copyright &#169; 2003 -2010 Thorsten Ottosen, Neil Groves<p>
+<td align="right"><div class="copyright-footer">Copyright &#169; 2003-2010 Thorsten Ottosen,
+      Neil Groves<p>
         Distributed under the Boost Software License, Version 1.0. (See accompanying
         file LICENSE_1_0.txt or copy at <a href="http://www.boost.org/LICENSE_1_0.txt" target="_top">http://www.boost.org/LICENSE_1_0.txt</a>)
       </p>
diff --git a/doc/html/range/reference/algorithms/heap/pop_heap.html b/doc/html/range/reference/algorithms/heap/pop_heap.html
index d8f0283..633ba1f 100644
--- a/doc/html/range/reference/algorithms/heap/pop_heap.html
+++ b/doc/html/range/reference/algorithms/heap/pop_heap.html
@@ -22,16 +22,15 @@
 <div class="spirit-nav">
 <a accesskey="p" href="push_heap.html"><img src="../../../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../heap.html"><img src="../../../../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../../../../index.html"><img src="../../../../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="make_heap.html"><img src="../../../../../../../../doc/src/images/next.png" alt="Next"></a>
 </div>
-<div class="section">
+<div class="section range_reference_algorithms_heap_pop_heap">
 <div class="titlepage"><div><div><h5 class="title">
 <a name="range.reference.algorithms.heap.pop_heap"></a><a class="link" href="pop_heap.html" title="pop_heap">pop_heap</a>
 </h5></div></div></div>
-<a name="range.reference.algorithms.heap.pop_heap.prototype"></a><h6>
-<a name="id740266"></a>
-            <a class="link" href="pop_heap.html#range.reference.algorithms.heap.pop_heap.prototype">Prototype</a>
+<h6>
+<a name="range.reference.algorithms.heap.pop_heap.h0"></a>
+            <span><a name="range.reference.algorithms.heap.pop_heap.prototype"></a></span><a class="link" href="pop_heap.html#range.reference.algorithms.heap.pop_heap.prototype">Prototype</a>
           </h6>
 <p>
-            
 </p>
 <pre class="programlisting"><span class="keyword">template</span><span class="special">&lt;</span><span class="keyword">class</span> <span class="identifier">RandomAccessRange</span><span class="special">&gt;</span>
 <span class="identifier">RandomAccessRange</span><span class="special">&amp;</span> <span class="identifier">pop_heap</span><span class="special">(</span><span class="identifier">RandomAccessRange</span><span class="special">&amp;</span> <span class="identifier">rng</span><span class="special">);</span>
@@ -47,9 +46,9 @@
 </pre>
 <p>
           </p>
-<a name="range.reference.algorithms.heap.pop_heap.description"></a><h6>
-<a name="id740642"></a>
-            <a class="link" href="pop_heap.html#range.reference.algorithms.heap.pop_heap.description">Description</a>
+<h6>
+<a name="range.reference.algorithms.heap.pop_heap.h1"></a>
+            <span><a name="range.reference.algorithms.heap.pop_heap.description"></a></span><a class="link" href="pop_heap.html#range.reference.algorithms.heap.pop_heap.description">Description</a>
           </h6>
 <p>
             <code class="computeroutput"><span class="identifier">pop_heap</span></code> removes the
@@ -61,16 +60,16 @@
             by evaluating <code class="computeroutput"><span class="identifier">pred</span></code> in
             the predicate versions.
           </p>
-<a name="range.reference.algorithms.heap.pop_heap.definition"></a><h6>
-<a name="id740796"></a>
-            <a class="link" href="pop_heap.html#range.reference.algorithms.heap.pop_heap.definition">Definition</a>
+<h6>
+<a name="range.reference.algorithms.heap.pop_heap.h2"></a>
+            <span><a name="range.reference.algorithms.heap.pop_heap.definition"></a></span><a class="link" href="pop_heap.html#range.reference.algorithms.heap.pop_heap.definition">Definition</a>
           </h6>
 <p>
             Defined in the header file <code class="computeroutput"><span class="identifier">boost</span><span class="special">/</span><span class="identifier">range</span><span class="special">/</span><span class="identifier">algorithm</span><span class="special">/</span><span class="identifier">heap_algorithm</span><span class="special">.</span><span class="identifier">hpp</span></code>
           </p>
-<a name="range.reference.algorithms.heap.pop_heap.requirements"></a><h6>
-<a name="id740866"></a>
-            <a class="link" href="pop_heap.html#range.reference.algorithms.heap.pop_heap.requirements">Requirements</a>
+<h6>
+<a name="range.reference.algorithms.heap.pop_heap.h3"></a>
+            <span><a name="range.reference.algorithms.heap.pop_heap.requirements"></a></span><a class="link" href="pop_heap.html#range.reference.algorithms.heap.pop_heap.requirements">Requirements</a>
           </h6>
 <p>
             <span class="bold"><strong>For the non-predicate versions:</strong></span>
@@ -119,9 +118,9 @@
                 argument types.
               </li>
 </ul></div>
-<a name="range.reference.algorithms.heap.pop_heap.precondition_"></a><h6>
-<a name="id741114"></a>
-            <a class="link" href="pop_heap.html#range.reference.algorithms.heap.pop_heap.precondition_">Precondition:</a>
+<h6>
+<a name="range.reference.algorithms.heap.pop_heap.h4"></a>
+            <span><a name="range.reference.algorithms.heap.pop_heap.precondition_"></a></span><a class="link" href="pop_heap.html#range.reference.algorithms.heap.pop_heap.precondition_">Precondition:</a>
           </h6>
 <div class="itemizedlist"><ul class="itemizedlist" type="disc">
 <li class="listitem">
@@ -131,9 +130,9 @@
                 <code class="computeroutput"><span class="identifier">rng</span></code> is a heap.
               </li>
 </ul></div>
-<a name="range.reference.algorithms.heap.pop_heap.complexity"></a><h6>
-<a name="id741189"></a>
-            <a class="link" href="pop_heap.html#range.reference.algorithms.heap.pop_heap.complexity">Complexity</a>
+<h6>
+<a name="range.reference.algorithms.heap.pop_heap.h5"></a>
+            <span><a name="range.reference.algorithms.heap.pop_heap.complexity"></a></span><a class="link" href="pop_heap.html#range.reference.algorithms.heap.pop_heap.complexity">Complexity</a>
           </h6>
 <p>
             Logarithmic. At most <code class="computeroutput"><span class="number">2</span> <span class="special">*</span>
@@ -143,7 +142,8 @@
 </div>
 <table xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" width="100%"><tr>
 <td align="left"></td>
-<td align="right"><div class="copyright-footer">Copyright &#169; 2003 -2010 Thorsten Ottosen, Neil Groves<p>
+<td align="right"><div class="copyright-footer">Copyright &#169; 2003-2010 Thorsten Ottosen,
+      Neil Groves<p>
         Distributed under the Boost Software License, Version 1.0. (See accompanying
         file LICENSE_1_0.txt or copy at <a href="http://www.boost.org/LICENSE_1_0.txt" target="_top">http://www.boost.org/LICENSE_1_0.txt</a>)
       </p>
diff --git a/doc/html/range/reference/algorithms/heap/push_heap.html b/doc/html/range/reference/algorithms/heap/push_heap.html
index 4223024..2e4a326 100644
--- a/doc/html/range/reference/algorithms/heap/push_heap.html
+++ b/doc/html/range/reference/algorithms/heap/push_heap.html
@@ -22,16 +22,15 @@
 <div class="spirit-nav">
 <a accesskey="p" href="../heap.html"><img src="../../../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../heap.html"><img src="../../../../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../../../../index.html"><img src="../../../../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="pop_heap.html"><img src="../../../../../../../../doc/src/images/next.png" alt="Next"></a>
 </div>
-<div class="section">
+<div class="section range_reference_algorithms_heap_push_heap">
 <div class="titlepage"><div><div><h5 class="title">
 <a name="range.reference.algorithms.heap.push_heap"></a><a class="link" href="push_heap.html" title="push_heap">push_heap</a>
 </h5></div></div></div>
-<a name="range.reference.algorithms.heap.push_heap.prototype"></a><h6>
-<a name="id739222"></a>
-            <a class="link" href="push_heap.html#range.reference.algorithms.heap.push_heap.prototype">Prototype</a>
+<h6>
+<a name="range.reference.algorithms.heap.push_heap.h0"></a>
+            <span><a name="range.reference.algorithms.heap.push_heap.prototype"></a></span><a class="link" href="push_heap.html#range.reference.algorithms.heap.push_heap.prototype">Prototype</a>
           </h6>
 <p>
-            
 </p>
 <pre class="programlisting"><span class="keyword">template</span><span class="special">&lt;</span><span class="keyword">class</span> <span class="identifier">RandomAccessRange</span><span class="special">&gt;</span>
 <span class="identifier">RandomAccessRange</span><span class="special">&amp;</span> <span class="identifier">push_heap</span><span class="special">(</span><span class="identifier">RandomAccessRange</span><span class="special">&amp;</span> <span class="identifier">rng</span><span class="special">);</span>
@@ -47,9 +46,9 @@
 </pre>
 <p>
           </p>
-<a name="range.reference.algorithms.heap.push_heap.description"></a><h6>
-<a name="id739596"></a>
-            <a class="link" href="push_heap.html#range.reference.algorithms.heap.push_heap.description">Description</a>
+<h6>
+<a name="range.reference.algorithms.heap.push_heap.h1"></a>
+            <span><a name="range.reference.algorithms.heap.push_heap.description"></a></span><a class="link" href="push_heap.html#range.reference.algorithms.heap.push_heap.description">Description</a>
           </h6>
 <p>
             <code class="computeroutput"><span class="identifier">push_heap</span></code> adds an element
@@ -61,16 +60,16 @@
             by evaluating <code class="computeroutput"><span class="identifier">pred</span></code> in
             the predicate versions.
           </p>
-<a name="range.reference.algorithms.heap.push_heap.definition"></a><h6>
-<a name="id739755"></a>
-            <a class="link" href="push_heap.html#range.reference.algorithms.heap.push_heap.definition">Definition</a>
+<h6>
+<a name="range.reference.algorithms.heap.push_heap.h2"></a>
+            <span><a name="range.reference.algorithms.heap.push_heap.definition"></a></span><a class="link" href="push_heap.html#range.reference.algorithms.heap.push_heap.definition">Definition</a>
           </h6>
 <p>
             Defined in the header file <code class="computeroutput"><span class="identifier">boost</span><span class="special">/</span><span class="identifier">range</span><span class="special">/</span><span class="identifier">algorithm</span><span class="special">/</span><span class="identifier">heap_algorithm</span><span class="special">.</span><span class="identifier">hpp</span></code>
           </p>
-<a name="range.reference.algorithms.heap.push_heap.requirements"></a><h6>
-<a name="id739825"></a>
-            <a class="link" href="push_heap.html#range.reference.algorithms.heap.push_heap.requirements">Requirements</a>
+<h6>
+<a name="range.reference.algorithms.heap.push_heap.h3"></a>
+            <span><a name="range.reference.algorithms.heap.push_heap.requirements"></a></span><a class="link" href="push_heap.html#range.reference.algorithms.heap.push_heap.requirements">Requirements</a>
           </h6>
 <p>
             <span class="bold"><strong>For the non-predicate versions:</strong></span>
@@ -119,9 +118,9 @@
                 argument types.
               </li>
 </ul></div>
-<a name="range.reference.algorithms.heap.push_heap.precondition_"></a><h6>
-<a name="id740073"></a>
-            <a class="link" href="push_heap.html#range.reference.algorithms.heap.push_heap.precondition_">Precondition:</a>
+<h6>
+<a name="range.reference.algorithms.heap.push_heap.h4"></a>
+            <span><a name="range.reference.algorithms.heap.push_heap.precondition_"></a></span><a class="link" href="push_heap.html#range.reference.algorithms.heap.push_heap.precondition_">Precondition:</a>
           </h6>
 <div class="itemizedlist"><ul class="itemizedlist" type="disc">
 <li class="listitem">
@@ -131,9 +130,9 @@
                 <code class="computeroutput"><span class="special">[</span><span class="identifier">begin</span><span class="special">(</span><span class="identifier">rng</span><span class="special">),</span> <span class="identifier">prior</span><span class="special">(</span><span class="identifier">end</span><span class="special">(</span><span class="identifier">rng</span><span class="special">)))</span></code> is a heap.
               </li>
 </ul></div>
-<a name="range.reference.algorithms.heap.push_heap.complexity"></a><h6>
-<a name="id740193"></a>
-            <a class="link" href="push_heap.html#range.reference.algorithms.heap.push_heap.complexity">Complexity</a>
+<h6>
+<a name="range.reference.algorithms.heap.push_heap.h5"></a>
+            <span><a name="range.reference.algorithms.heap.push_heap.complexity"></a></span><a class="link" href="push_heap.html#range.reference.algorithms.heap.push_heap.complexity">Complexity</a>
           </h6>
 <p>
             Logarithmic. At most <code class="computeroutput"><span class="identifier">log</span><span class="special">(</span><span class="identifier">distance</span><span class="special">(</span><span class="identifier">rng</span><span class="special">))</span></code> comparisons.
@@ -141,7 +140,8 @@
 </div>
 <table xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" width="100%"><tr>
 <td align="left"></td>
-<td align="right"><div class="copyright-footer">Copyright &#169; 2003 -2010 Thorsten Ottosen, Neil Groves<p>
+<td align="right"><div class="copyright-footer">Copyright &#169; 2003-2010 Thorsten Ottosen,
+      Neil Groves<p>
         Distributed under the Boost Software License, Version 1.0. (See accompanying
         file LICENSE_1_0.txt or copy at <a href="http://www.boost.org/LICENSE_1_0.txt" target="_top">http://www.boost.org/LICENSE_1_0.txt</a>)
       </p>
diff --git a/doc/html/range/reference/algorithms/heap/sort_heap.html b/doc/html/range/reference/algorithms/heap/sort_heap.html
index 7667438..26c7e8c 100644
--- a/doc/html/range/reference/algorithms/heap/sort_heap.html
+++ b/doc/html/range/reference/algorithms/heap/sort_heap.html
@@ -22,16 +22,15 @@
 <div class="spirit-nav">
 <a accesskey="p" href="make_heap.html"><img src="../../../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../heap.html"><img src="../../../../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../../../../index.html"><img src="../../../../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="../permutation.html"><img src="../../../../../../../../doc/src/images/next.png" alt="Next"></a>
 </div>
-<div class="section">
+<div class="section range_reference_algorithms_heap_sort_heap">
 <div class="titlepage"><div><div><h5 class="title">
 <a name="range.reference.algorithms.heap.sort_heap"></a><a class="link" href="sort_heap.html" title="sort_heap">sort_heap</a>
 </h5></div></div></div>
-<a name="range.reference.algorithms.heap.sort_heap.prototype"></a><h6>
-<a name="id742115"></a>
-            <a class="link" href="sort_heap.html#range.reference.algorithms.heap.sort_heap.prototype">Prototype</a>
+<h6>
+<a name="range.reference.algorithms.heap.sort_heap.h0"></a>
+            <span><a name="range.reference.algorithms.heap.sort_heap.prototype"></a></span><a class="link" href="sort_heap.html#range.reference.algorithms.heap.sort_heap.prototype">Prototype</a>
           </h6>
 <p>
-            
 </p>
 <pre class="programlisting"><span class="keyword">template</span><span class="special">&lt;</span><span class="keyword">class</span> <span class="identifier">RandomAccessRange</span><span class="special">&gt;</span>
 <span class="identifier">RandomAccessRange</span><span class="special">&amp;</span> <span class="identifier">sort_heap</span><span class="special">(</span><span class="identifier">RandomAccessRange</span><span class="special">&amp;</span> <span class="identifier">rng</span><span class="special">);</span>
@@ -47,9 +46,9 @@
 </pre>
 <p>
           </p>
-<a name="range.reference.algorithms.heap.sort_heap.description"></a><h6>
-<a name="id742491"></a>
-            <a class="link" href="sort_heap.html#range.reference.algorithms.heap.sort_heap.description">Description</a>
+<h6>
+<a name="range.reference.algorithms.heap.sort_heap.h1"></a>
+            <span><a name="range.reference.algorithms.heap.sort_heap.description"></a></span><a class="link" href="sort_heap.html#range.reference.algorithms.heap.sort_heap.description">Description</a>
           </h6>
 <p>
             <code class="computeroutput"><span class="identifier">sort_heap</span></code> turns a heap
@@ -60,16 +59,16 @@
             by evaluating <code class="computeroutput"><span class="identifier">pred</span></code> in
             the predicate versions.
           </p>
-<a name="range.reference.algorithms.heap.sort_heap.definition"></a><h6>
-<a name="id742555"></a>
-            <a class="link" href="sort_heap.html#range.reference.algorithms.heap.sort_heap.definition">Definition</a>
+<h6>
+<a name="range.reference.algorithms.heap.sort_heap.h2"></a>
+            <span><a name="range.reference.algorithms.heap.sort_heap.definition"></a></span><a class="link" href="sort_heap.html#range.reference.algorithms.heap.sort_heap.definition">Definition</a>
           </h6>
 <p>
             Defined in the header file <code class="computeroutput"><span class="identifier">boost</span><span class="special">/</span><span class="identifier">range</span><span class="special">/</span><span class="identifier">algorithm</span><span class="special">/</span><span class="identifier">heap_algorithm</span><span class="special">.</span><span class="identifier">hpp</span></code>
           </p>
-<a name="range.reference.algorithms.heap.sort_heap.requirements"></a><h6>
-<a name="id742626"></a>
-            <a class="link" href="sort_heap.html#range.reference.algorithms.heap.sort_heap.requirements">Requirements</a>
+<h6>
+<a name="range.reference.algorithms.heap.sort_heap.h3"></a>
+            <span><a name="range.reference.algorithms.heap.sort_heap.requirements"></a></span><a class="link" href="sort_heap.html#range.reference.algorithms.heap.sort_heap.requirements">Requirements</a>
           </h6>
 <p>
             <span class="bold"><strong>For the non-predicate versions:</strong></span>
@@ -118,16 +117,16 @@
                 argument types.
               </li>
 </ul></div>
-<a name="range.reference.algorithms.heap.sort_heap.precondition_"></a><h6>
-<a name="id742873"></a>
-            <a class="link" href="sort_heap.html#range.reference.algorithms.heap.sort_heap.precondition_">Precondition:</a>
+<h6>
+<a name="range.reference.algorithms.heap.sort_heap.h4"></a>
+            <span><a name="range.reference.algorithms.heap.sort_heap.precondition_"></a></span><a class="link" href="sort_heap.html#range.reference.algorithms.heap.sort_heap.precondition_">Precondition:</a>
           </h6>
 <p>
             <code class="computeroutput"><span class="identifier">rng</span></code> is a heap.
           </p>
-<a name="range.reference.algorithms.heap.sort_heap.complexity"></a><h6>
-<a name="id742906"></a>
-            <a class="link" href="sort_heap.html#range.reference.algorithms.heap.sort_heap.complexity">Complexity</a>
+<h6>
+<a name="range.reference.algorithms.heap.sort_heap.h5"></a>
+            <span><a name="range.reference.algorithms.heap.sort_heap.complexity"></a></span><a class="link" href="sort_heap.html#range.reference.algorithms.heap.sort_heap.complexity">Complexity</a>
           </h6>
 <p>
             At most <code class="computeroutput"><span class="identifier">N</span> <span class="special">*</span>
@@ -138,7 +137,8 @@
 </div>
 <table xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" width="100%"><tr>
 <td align="left"></td>
-<td align="right"><div class="copyright-footer">Copyright &#169; 2003 -2010 Thorsten Ottosen, Neil Groves<p>
+<td align="right"><div class="copyright-footer">Copyright &#169; 2003-2010 Thorsten Ottosen,
+      Neil Groves<p>
         Distributed under the Boost Software License, Version 1.0. (See accompanying
         file LICENSE_1_0.txt or copy at <a href="http://www.boost.org/LICENSE_1_0.txt" target="_top">http://www.boost.org/LICENSE_1_0.txt</a>)
       </p>
diff --git a/doc/html/range/reference/algorithms/introduction.html b/doc/html/range/reference/algorithms/introduction.html
index 708e794..21aee3a 100644
--- a/doc/html/range/reference/algorithms/introduction.html
+++ b/doc/html/range/reference/algorithms/introduction.html
@@ -22,7 +22,7 @@
 <div class="spirit-nav">
 <a accesskey="p" href="../algorithms.html"><img src="../../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../algorithms.html"><img src="../../../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../../../index.html"><img src="../../../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="mutating.html"><img src="../../../../../../../doc/src/images/next.png" alt="Next"></a>
 </div>
-<div class="section">
+<div class="section range_reference_algorithms_introduction">
 <div class="titlepage"><div><div><h4 class="title">
 <a name="range.reference.algorithms.introduction"></a><a class="link" href="introduction.html" title="Introduction and motivation">Introduction
         and motivation</a>
@@ -34,7 +34,6 @@
           <span class="emphasis"><em>one</em></span> range argument. For example, we may write
         </p>
 <p>
-          
 </p>
 <pre class="programlisting"><span class="preprocessor">#include</span> <span class="special">&lt;</span><span class="identifier">boost</span><span class="special">/</span><span class="identifier">range</span><span class="special">/</span><span class="identifier">algorithm</span><span class="special">.</span><span class="identifier">hpp</span><span class="special">&gt;</span>
 <span class="preprocessor">#include</span> <span class="special">&lt;</span><span class="identifier">vector</span><span class="special">&gt;</span>
@@ -48,7 +47,6 @@
           instead of
         </p>
 <p>
-          
 </p>
 <pre class="programlisting"><span class="identifier">std</span><span class="special">::</span><span class="identifier">sort</span><span class="special">(</span><span class="identifier">vec</span><span class="special">.</span><span class="identifier">begin</span><span class="special">(),</span> <span class="identifier">vec</span><span class="special">.</span><span class="identifier">end</span><span class="special">());</span>
 </pre>
@@ -61,7 +59,7 @@
 <p>
           One group of algorithms, like <code class="computeroutput"><span class="identifier">boost</span><span class="special">::</span><span class="identifier">sort</span><span class="special">()</span></code>, will simply return the same range so
           that we can continue to pass the range around and/or further modify it.
-          Because of this we may write 
+          Because of this we may write
 </p>
 <pre class="programlisting"><span class="identifier">boost</span><span class="special">:</span><span class="identifier">unique</span><span class="special">(</span><span class="identifier">boost</span><span class="special">::</span><span class="identifier">sort</span><span class="special">(</span><span class="identifier">vec</span><span class="special">));</span>
 </pre>
@@ -76,7 +74,7 @@
           iterator returned by <code class="computeroutput"><span class="identifier">std</span><span class="special">::</span><span class="identifier">unique</span><span class="special">(</span><span class="identifier">boost</span><span class="special">::</span><span class="identifier">begin</span><span class="special">(</span><span class="identifier">rng</span><span class="special">),</span> <span class="identifier">boost</span><span class="special">::</span><span class="identifier">end</span><span class="special">(</span><span class="identifier">rng</span><span class="special">))</span></code>
         </p>
 <p>
-          Therefore exactly the unique values can be copied by writing 
+          Therefore exactly the unique values can be copied by writing
 </p>
 <pre class="programlisting"><span class="identifier">boost</span><span class="special">::</span><span class="identifier">copy</span><span class="special">(</span><span class="identifier">boost</span><span class="special">::</span><span class="identifier">unique</span><span class="special">(</span><span class="identifier">boost</span><span class="special">::</span><span class="identifier">sort</span><span class="special">(</span><span class="identifier">vec</span><span class="special">)),</span>
             <span class="identifier">std</span><span class="special">::</span><span class="identifier">ostream_iterator</span><span class="special">&lt;</span><span class="keyword">int</span><span class="special">&gt;(</span><span class="identifier">std</span><span class="special">::</span><span class="identifier">cout</span><span class="special">));</span>
@@ -204,7 +202,6 @@
           container:
         </p>
 <p>
-          
 </p>
 <pre class="programlisting"><span class="identifier">std</span><span class="special">::</span><span class="identifier">vector</span><span class="special">&lt;</span><span class="keyword">int</span><span class="special">&gt;</span> <span class="identifier">vec</span> <span class="special">=</span> <span class="special">...;</span>
 <span class="identifier">boost</span><span class="special">::</span><span class="identifier">erase</span><span class="special">(</span><span class="identifier">vec</span><span class="special">,</span> <span class="identifier">boost</span><span class="special">::</span><span class="identifier">unique</span><span class="special">&lt;</span><span class="identifier">boost</span><span class="special">::</span><span class="identifier">return_found_end</span><span class="special">&gt;(</span><span class="identifier">boost</span><span class="special">::</span><span class="identifier">sort</span><span class="special">(</span><span class="identifier">vec</span><span class="special">)));</span>
@@ -217,13 +214,12 @@
           STL-programming we might write
         </p>
 <p>
-          
 </p>
-<pre class="programlisting"><span class="comment">// assume 'vec' is already sorted
-</span><span class="identifier">std</span><span class="special">::</span><span class="identifier">vector</span><span class="special">&lt;</span><span class="keyword">int</span><span class="special">&gt;::</span><span class="identifier">iterator</span> <span class="identifier">i</span> <span class="special">=</span> <span class="identifier">std</span><span class="special">::</span><span class="identifier">unique</span><span class="special">(</span><span class="identifier">vec</span><span class="special">.</span><span class="identifier">begin</span><span class="special">(),</span> <span class="identifier">vec</span><span class="special">.</span><span class="identifier">end</span><span class="special">());</span>
+<pre class="programlisting"><span class="comment">// assume 'vec' is already sorted</span>
+<span class="identifier">std</span><span class="special">::</span><span class="identifier">vector</span><span class="special">&lt;</span><span class="keyword">int</span><span class="special">&gt;::</span><span class="identifier">iterator</span> <span class="identifier">i</span> <span class="special">=</span> <span class="identifier">std</span><span class="special">::</span><span class="identifier">unique</span><span class="special">(</span><span class="identifier">vec</span><span class="special">.</span><span class="identifier">begin</span><span class="special">(),</span> <span class="identifier">vec</span><span class="special">.</span><span class="identifier">end</span><span class="special">());</span>
 
-<span class="comment">// remember this check or you get into problems
-</span><span class="keyword">if</span> <span class="special">(</span><span class="identifier">i</span> <span class="special">!=</span> <span class="identifier">vec</span><span class="special">.</span><span class="identifier">end</span><span class="special">())</span>
+<span class="comment">// remember this check or you get into problems</span>
+<span class="keyword">if</span> <span class="special">(</span><span class="identifier">i</span> <span class="special">!=</span> <span class="identifier">vec</span><span class="special">.</span><span class="identifier">end</span><span class="special">())</span>
     <span class="special">++</span><span class="identifier">i</span><span class="special">;</span>
 
 <span class="identifier">vec</span><span class="special">.</span><span class="identifier">erase</span><span class="special">(</span><span class="identifier">i</span><span class="special">,</span> <span class="identifier">vec</span><span class="special">.</span><span class="identifier">end</span><span class="special">());</span>
@@ -231,7 +227,7 @@
 <p>
         </p>
 <p>
-          The same task may be accomplished simply with 
+          The same task may be accomplished simply with
 </p>
 <pre class="programlisting"><span class="identifier">boost</span><span class="special">::</span><span class="identifier">erase</span><span class="special">(</span><span class="identifier">vec</span><span class="special">,</span> <span class="identifier">boost</span><span class="special">::</span><span class="identifier">unique</span><span class="special">&lt;</span><span class="identifier">boost</span><span class="special">::</span><span class="identifier">return_next_end</span><span class="special">&gt;(</span><span class="identifier">vec</span><span class="special">));</span>
 </pre>
@@ -243,7 +239,8 @@
 </div>
 <table xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" width="100%"><tr>
 <td align="left"></td>
-<td align="right"><div class="copyright-footer">Copyright &#169; 2003 -2010 Thorsten Ottosen, Neil Groves<p>
+<td align="right"><div class="copyright-footer">Copyright &#169; 2003-2010 Thorsten Ottosen,
+      Neil Groves<p>
         Distributed under the Boost Software License, Version 1.0. (See accompanying
         file LICENSE_1_0.txt or copy at <a href="http://www.boost.org/LICENSE_1_0.txt" target="_top">http://www.boost.org/LICENSE_1_0.txt</a>)
       </p>
diff --git a/doc/html/range/reference/algorithms/mutating.html b/doc/html/range/reference/algorithms/mutating.html
index ad51a61..1d75a60 100644
--- a/doc/html/range/reference/algorithms/mutating.html
+++ b/doc/html/range/reference/algorithms/mutating.html
@@ -22,7 +22,7 @@
 <div class="spirit-nav">
 <a accesskey="p" href="introduction.html"><img src="../../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../algorithms.html"><img src="../../../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../../../index.html"><img src="../../../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="mutating/copy.html"><img src="../../../../../../../doc/src/images/next.png" alt="Next"></a>
 </div>
-<div class="section">
+<div class="section range_reference_algorithms_mutating">
 <div class="titlepage"><div><div><h4 class="title">
 <a name="range.reference.algorithms.mutating"></a><a class="link" href="mutating.html" title="Mutating algorithms">Mutating algorithms</a>
 </h4></div></div></div>
@@ -61,7 +61,8 @@
 </div>
 <table xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" width="100%"><tr>
 <td align="left"></td>
-<td align="right"><div class="copyright-footer">Copyright &#169; 2003 -2010 Thorsten Ottosen, Neil Groves<p>
+<td align="right"><div class="copyright-footer">Copyright &#169; 2003-2010 Thorsten Ottosen,
+      Neil Groves<p>
         Distributed under the Boost Software License, Version 1.0. (See accompanying
         file LICENSE_1_0.txt or copy at <a href="http://www.boost.org/LICENSE_1_0.txt" target="_top">http://www.boost.org/LICENSE_1_0.txt</a>)
       </p>
diff --git a/doc/html/range/reference/algorithms/mutating/copy.html b/doc/html/range/reference/algorithms/mutating/copy.html
index fd096ff..186f980 100644
--- a/doc/html/range/reference/algorithms/mutating/copy.html
+++ b/doc/html/range/reference/algorithms/mutating/copy.html
@@ -22,25 +22,24 @@
 <div class="spirit-nav">
 <a accesskey="p" href="../mutating.html"><img src="../../../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../mutating.html"><img src="../../../../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../../../../index.html"><img src="../../../../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="copy_backward.html"><img src="../../../../../../../../doc/src/images/next.png" alt="Next"></a>
 </div>
-<div class="section">
+<div class="section range_reference_algorithms_mutating_copy">
 <div class="titlepage"><div><div><h5 class="title">
 <a name="range.reference.algorithms.mutating.copy"></a><a class="link" href="copy.html" title="copy">copy</a>
 </h5></div></div></div>
-<a name="range.reference.algorithms.mutating.copy.prototype"></a><h6>
-<a name="id684203"></a>
-            <a class="link" href="copy.html#range.reference.algorithms.mutating.copy.prototype">Prototype</a>
+<h6>
+<a name="range.reference.algorithms.mutating.copy.h0"></a>
+            <span><a name="range.reference.algorithms.mutating.copy.prototype"></a></span><a class="link" href="copy.html#range.reference.algorithms.mutating.copy.prototype">Prototype</a>
           </h6>
 <p>
-            
 </p>
 <pre class="programlisting"><span class="keyword">template</span><span class="special">&lt;</span><span class="keyword">class</span> <span class="identifier">SinglePassRange</span><span class="special">,</span> <span class="keyword">class</span> <span class="identifier">OutputIterator</span><span class="special">&gt;</span>
 <span class="identifier">OutputIterator</span> <span class="identifier">copy</span><span class="special">(</span><span class="keyword">const</span> <span class="identifier">SinglePassRange</span><span class="special">&amp;</span> <span class="identifier">source_rng</span><span class="special">,</span> <span class="identifier">OutputIterator</span> <span class="identifier">out_it</span><span class="special">);</span>
 </pre>
 <p>
           </p>
-<a name="range.reference.algorithms.mutating.copy.description"></a><h6>
-<a name="id684330"></a>
-            <a class="link" href="copy.html#range.reference.algorithms.mutating.copy.description">Description</a>
+<h6>
+<a name="range.reference.algorithms.mutating.copy.h1"></a>
+            <span><a name="range.reference.algorithms.mutating.copy.description"></a></span><a class="link" href="copy.html#range.reference.algorithms.mutating.copy.description">Description</a>
           </h6>
 <p>
             <code class="computeroutput"><span class="identifier">copy</span></code> copies all elements
@@ -49,16 +48,16 @@
             <span class="special">+</span> <span class="identifier">distance</span><span class="special">(</span><span class="identifier">source_rng</span><span class="special">))</span></code>. The return value is <code class="computeroutput"><span class="identifier">out_it</span> <span class="special">+</span>
             <span class="identifier">distance</span><span class="special">(</span><span class="identifier">source_rng</span><span class="special">)</span></code>
           </p>
-<a name="range.reference.algorithms.mutating.copy.definition"></a><h6>
-<a name="id684459"></a>
-            <a class="link" href="copy.html#range.reference.algorithms.mutating.copy.definition">Definition</a>
+<h6>
+<a name="range.reference.algorithms.mutating.copy.h2"></a>
+            <span><a name="range.reference.algorithms.mutating.copy.definition"></a></span><a class="link" href="copy.html#range.reference.algorithms.mutating.copy.definition">Definition</a>
           </h6>
 <p>
             Defined in the header file <code class="computeroutput"><span class="identifier">boost</span><span class="special">/</span><span class="identifier">range</span><span class="special">/</span><span class="identifier">algorithm</span><span class="special">/</span><span class="identifier">copy</span><span class="special">.</span><span class="identifier">hpp</span></code>
           </p>
-<a name="range.reference.algorithms.mutating.copy.requirements"></a><h6>
-<a name="id684528"></a>
-            <a class="link" href="copy.html#range.reference.algorithms.mutating.copy.requirements">Requirements</a>
+<h6>
+<a name="range.reference.algorithms.mutating.copy.h3"></a>
+            <span><a name="range.reference.algorithms.mutating.copy.requirements"></a></span><a class="link" href="copy.html#range.reference.algorithms.mutating.copy.requirements">Requirements</a>
           </h6>
 <div class="itemizedlist"><ul class="itemizedlist" type="disc">
 <li class="listitem">
@@ -77,9 +76,9 @@
                 set of value types.
               </li>
 </ul></div>
-<a name="range.reference.algorithms.mutating.copy.precondition_"></a><h6>
-<a name="id684638"></a>
-            <a class="link" href="copy.html#range.reference.algorithms.mutating.copy.precondition_">Precondition:</a>
+<h6>
+<a name="range.reference.algorithms.mutating.copy.h4"></a>
+            <span><a name="range.reference.algorithms.mutating.copy.precondition_"></a></span><a class="link" href="copy.html#range.reference.algorithms.mutating.copy.precondition_">Precondition:</a>
           </h6>
 <div class="itemizedlist"><ul class="itemizedlist" type="disc">
 <li class="listitem">
@@ -91,9 +90,9 @@
                 <span class="special">+</span> <span class="identifier">distance</span><span class="special">(</span><span class="identifier">source_rng</span><span class="special">))</span></code> is a valid range.
               </li>
 </ul></div>
-<a name="range.reference.algorithms.mutating.copy.complexity"></a><h6>
-<a name="id684744"></a>
-            <a class="link" href="copy.html#range.reference.algorithms.mutating.copy.complexity">Complexity</a>
+<h6>
+<a name="range.reference.algorithms.mutating.copy.h5"></a>
+            <span><a name="range.reference.algorithms.mutating.copy.complexity"></a></span><a class="link" href="copy.html#range.reference.algorithms.mutating.copy.complexity">Complexity</a>
           </h6>
 <p>
             Linear. Exactly <code class="computeroutput"><span class="identifier">distance</span><span class="special">(</span><span class="identifier">source_rng</span><span class="special">)</span></code> assignments are performed.
@@ -101,7 +100,8 @@
 </div>
 <table xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" width="100%"><tr>
 <td align="left"></td>
-<td align="right"><div class="copyright-footer">Copyright &#169; 2003 -2010 Thorsten Ottosen, Neil Groves<p>
+<td align="right"><div class="copyright-footer">Copyright &#169; 2003-2010 Thorsten Ottosen,
+      Neil Groves<p>
         Distributed under the Boost Software License, Version 1.0. (See accompanying
         file LICENSE_1_0.txt or copy at <a href="http://www.boost.org/LICENSE_1_0.txt" target="_top">http://www.boost.org/LICENSE_1_0.txt</a>)
       </p>
diff --git a/doc/html/range/reference/algorithms/mutating/copy_backward.html b/doc/html/range/reference/algorithms/mutating/copy_backward.html
index 29139c1..0dc4f74 100644
--- a/doc/html/range/reference/algorithms/mutating/copy_backward.html
+++ b/doc/html/range/reference/algorithms/mutating/copy_backward.html
@@ -22,16 +22,15 @@
 <div class="spirit-nav">
 <a accesskey="p" href="copy.html"><img src="../../../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../mutating.html"><img src="../../../../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../../../../index.html"><img src="../../../../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="fill.html"><img src="../../../../../../../../doc/src/images/next.png" alt="Next"></a>
 </div>
-<div class="section">
+<div class="section range_reference_algorithms_mutating_copy_backward">
 <div class="titlepage"><div><div><h5 class="title">
 <a name="range.reference.algorithms.mutating.copy_backward"></a><a class="link" href="copy_backward.html" title="copy_backward">copy_backward</a>
 </h5></div></div></div>
-<a name="range.reference.algorithms.mutating.copy_backward.prototype"></a><h6>
-<a name="id684808"></a>
-            <a class="link" href="copy_backward.html#range.reference.algorithms.mutating.copy_backward.prototype">Prototype</a>
+<h6>
+<a name="range.reference.algorithms.mutating.copy_backward.h0"></a>
+            <span><a name="range.reference.algorithms.mutating.copy_backward.prototype"></a></span><a class="link" href="copy_backward.html#range.reference.algorithms.mutating.copy_backward.prototype">Prototype</a>
           </h6>
 <p>
-            
 </p>
 <pre class="programlisting"><span class="keyword">template</span><span class="special">&lt;</span><span class="keyword">class</span> <span class="identifier">BidirectionalRange</span><span class="special">,</span> <span class="keyword">class</span> <span class="identifier">BidirectionalOutputIterator</span><span class="special">&gt;</span>
     <span class="identifier">BidirectionalOutputIterator</span>
@@ -40,9 +39,9 @@
 </pre>
 <p>
           </p>
-<a name="range.reference.algorithms.mutating.copy_backward.description"></a><h6>
-<a name="id684936"></a>
-            <a class="link" href="copy_backward.html#range.reference.algorithms.mutating.copy_backward.description">Description</a>
+<h6>
+<a name="range.reference.algorithms.mutating.copy_backward.h1"></a>
+            <span><a name="range.reference.algorithms.mutating.copy_backward.description"></a></span><a class="link" href="copy_backward.html#range.reference.algorithms.mutating.copy_backward.description">Description</a>
           </h6>
 <p>
             <code class="computeroutput"><span class="identifier">copy_backward</span></code> copies
@@ -58,16 +57,16 @@
             Note well that unlike all other standard algorithms <code class="computeroutput"><span class="identifier">out_it</span></code>
             denotes the <span class="bold"><strong>end</strong></span> of the output sequence.
           </p>
-<a name="range.reference.algorithms.mutating.copy_backward.definition"></a><h6>
-<a name="id685090"></a>
-            <a class="link" href="copy_backward.html#range.reference.algorithms.mutating.copy_backward.definition">Definition</a>
+<h6>
+<a name="range.reference.algorithms.mutating.copy_backward.h2"></a>
+            <span><a name="range.reference.algorithms.mutating.copy_backward.definition"></a></span><a class="link" href="copy_backward.html#range.reference.algorithms.mutating.copy_backward.definition">Definition</a>
           </h6>
 <p>
             Defined in the header file <code class="computeroutput"><span class="identifier">boost</span><span class="special">/</span><span class="identifier">range</span><span class="special">/</span><span class="identifier">algorithm</span><span class="special">/</span><span class="identifier">copy_backward</span><span class="special">.</span><span class="identifier">hpp</span></code>
           </p>
-<a name="range.reference.algorithms.mutating.copy_backward.requirements"></a><h6>
-<a name="id685160"></a>
-            <a class="link" href="copy_backward.html#range.reference.algorithms.mutating.copy_backward.requirements">Requirements</a>
+<h6>
+<a name="range.reference.algorithms.mutating.copy_backward.h3"></a>
+            <span><a name="range.reference.algorithms.mutating.copy_backward.requirements"></a></span><a class="link" href="copy_backward.html#range.reference.algorithms.mutating.copy_backward.requirements">Requirements</a>
           </h6>
 <div class="itemizedlist"><ul class="itemizedlist" type="disc">
 <li class="listitem">
@@ -86,9 +85,9 @@
                 set of value types.
               </li>
 </ul></div>
-<a name="range.reference.algorithms.mutating.copy_backward.precondition_"></a><h6>
-<a name="id685270"></a>
-            <a class="link" href="copy_backward.html#range.reference.algorithms.mutating.copy_backward.precondition_">Precondition:</a>
+<h6>
+<a name="range.reference.algorithms.mutating.copy_backward.h4"></a>
+            <span><a name="range.reference.algorithms.mutating.copy_backward.precondition_"></a></span><a class="link" href="copy_backward.html#range.reference.algorithms.mutating.copy_backward.precondition_">Precondition:</a>
           </h6>
 <div class="itemizedlist"><ul class="itemizedlist" type="disc">
 <li class="listitem">
@@ -100,9 +99,9 @@
                 <span class="special">+</span> <span class="identifier">distance</span><span class="special">(</span><span class="identifier">source_rng</span><span class="special">))</span></code> is a valid range.
               </li>
 </ul></div>
-<a name="range.reference.algorithms.mutating.copy_backward.complexity"></a><h6>
-<a name="id685378"></a>
-            <a class="link" href="copy_backward.html#range.reference.algorithms.mutating.copy_backward.complexity">Complexity</a>
+<h6>
+<a name="range.reference.algorithms.mutating.copy_backward.h5"></a>
+            <span><a name="range.reference.algorithms.mutating.copy_backward.complexity"></a></span><a class="link" href="copy_backward.html#range.reference.algorithms.mutating.copy_backward.complexity">Complexity</a>
           </h6>
 <p>
             Linear. Exactly <code class="computeroutput"><span class="identifier">distance</span><span class="special">(</span><span class="identifier">source_rng</span><span class="special">)</span></code> assignments are performed.
@@ -110,7 +109,8 @@
 </div>
 <table xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" width="100%"><tr>
 <td align="left"></td>
-<td align="right"><div class="copyright-footer">Copyright &#169; 2003 -2010 Thorsten Ottosen, Neil Groves<p>
+<td align="right"><div class="copyright-footer">Copyright &#169; 2003-2010 Thorsten Ottosen,
+      Neil Groves<p>
         Distributed under the Boost Software License, Version 1.0. (See accompanying
         file LICENSE_1_0.txt or copy at <a href="http://www.boost.org/LICENSE_1_0.txt" target="_top">http://www.boost.org/LICENSE_1_0.txt</a>)
       </p>
diff --git a/doc/html/range/reference/algorithms/mutating/fill.html b/doc/html/range/reference/algorithms/mutating/fill.html
index ea3fec4..063be50 100644
--- a/doc/html/range/reference/algorithms/mutating/fill.html
+++ b/doc/html/range/reference/algorithms/mutating/fill.html
@@ -22,41 +22,40 @@
 <div class="spirit-nav">
 <a accesskey="p" href="copy_backward.html"><img src="../../../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../mutating.html"><img src="../../../../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../../../../index.html"><img src="../../../../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="fill_n.html"><img src="../../../../../../../../doc/src/images/next.png" alt="Next"></a>
 </div>
-<div class="section">
+<div class="section range_reference_algorithms_mutating_fill">
 <div class="titlepage"><div><div><h5 class="title">
 <a name="range.reference.algorithms.mutating.fill"></a><a class="link" href="fill.html" title="fill">fill</a>
 </h5></div></div></div>
-<a name="range.reference.algorithms.mutating.fill.prototype"></a><h6>
-<a name="id685443"></a>
-            <a class="link" href="fill.html#range.reference.algorithms.mutating.fill.prototype">Prototype</a>
+<h6>
+<a name="range.reference.algorithms.mutating.fill.h0"></a>
+            <span><a name="range.reference.algorithms.mutating.fill.prototype"></a></span><a class="link" href="fill.html#range.reference.algorithms.mutating.fill.prototype">Prototype</a>
           </h6>
 <p>
-            
 </p>
 <pre class="programlisting"><span class="keyword">template</span><span class="special">&lt;</span><span class="keyword">class</span> <span class="identifier">ForwardRange</span><span class="special">,</span> <span class="keyword">class</span> <span class="identifier">Value</span><span class="special">&gt;</span>
 <span class="identifier">ForwardRange</span><span class="special">&amp;</span> <span class="identifier">fill</span><span class="special">(</span> <span class="identifier">ForwardRange</span><span class="special">&amp;</span> <span class="identifier">rng</span><span class="special">,</span> <span class="keyword">const</span> <span class="identifier">Value</span><span class="special">&amp;</span> <span class="identifier">val</span> <span class="special">);</span>
 </pre>
 <p>
           </p>
-<a name="range.reference.algorithms.mutating.fill.description"></a><h6>
-<a name="id685579"></a>
-            <a class="link" href="fill.html#range.reference.algorithms.mutating.fill.description">Description</a>
+<h6>
+<a name="range.reference.algorithms.mutating.fill.h1"></a>
+            <span><a name="range.reference.algorithms.mutating.fill.description"></a></span><a class="link" href="fill.html#range.reference.algorithms.mutating.fill.description">Description</a>
           </h6>
 <p>
             <code class="computeroutput"><span class="identifier">fill</span></code> assigns the value
             <code class="computeroutput"><span class="identifier">val</span></code> to every element
             in the range <code class="computeroutput"><span class="identifier">rng</span></code>.
           </p>
-<a name="range.reference.algorithms.mutating.fill.definition"></a><h6>
-<a name="id685634"></a>
-            <a class="link" href="fill.html#range.reference.algorithms.mutating.fill.definition">Definition</a>
+<h6>
+<a name="range.reference.algorithms.mutating.fill.h2"></a>
+            <span><a name="range.reference.algorithms.mutating.fill.definition"></a></span><a class="link" href="fill.html#range.reference.algorithms.mutating.fill.definition">Definition</a>
           </h6>
 <p>
             Defined in the header file <code class="computeroutput"><span class="identifier">boost</span><span class="special">/</span><span class="identifier">range</span><span class="special">/</span><span class="identifier">algorithm</span><span class="special">/</span><span class="identifier">fill</span><span class="special">.</span><span class="identifier">hpp</span></code>
           </p>
-<a name="range.reference.algorithms.mutating.fill.requirements"></a><h6>
-<a name="id685703"></a>
-            <a class="link" href="fill.html#range.reference.algorithms.mutating.fill.requirements">Requirements</a>
+<h6>
+<a name="range.reference.algorithms.mutating.fill.h3"></a>
+            <span><a name="range.reference.algorithms.mutating.fill.requirements"></a></span><a class="link" href="fill.html#range.reference.algorithms.mutating.fill.requirements">Requirements</a>
           </h6>
 <div class="itemizedlist"><ul class="itemizedlist" type="disc">
 <li class="listitem">
@@ -77,9 +76,9 @@
                 value type.
               </li>
 </ul></div>
-<a name="range.reference.algorithms.mutating.fill.complexity"></a><h6>
-<a name="id685823"></a>
-            <a class="link" href="fill.html#range.reference.algorithms.mutating.fill.complexity">Complexity</a>
+<h6>
+<a name="range.reference.algorithms.mutating.fill.h4"></a>
+            <span><a name="range.reference.algorithms.mutating.fill.complexity"></a></span><a class="link" href="fill.html#range.reference.algorithms.mutating.fill.complexity">Complexity</a>
           </h6>
 <p>
             Linear. Exactly <code class="computeroutput"><span class="identifier">distance</span><span class="special">(</span><span class="identifier">rng</span><span class="special">)</span></code> assignments are performed.
@@ -87,7 +86,8 @@
 </div>
 <table xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" width="100%"><tr>
 <td align="left"></td>
-<td align="right"><div class="copyright-footer">Copyright &#169; 2003 -2010 Thorsten Ottosen, Neil Groves<p>
+<td align="right"><div class="copyright-footer">Copyright &#169; 2003-2010 Thorsten Ottosen,
+      Neil Groves<p>
         Distributed under the Boost Software License, Version 1.0. (See accompanying
         file LICENSE_1_0.txt or copy at <a href="http://www.boost.org/LICENSE_1_0.txt" target="_top">http://www.boost.org/LICENSE_1_0.txt</a>)
       </p>
diff --git a/doc/html/range/reference/algorithms/mutating/fill_n.html b/doc/html/range/reference/algorithms/mutating/fill_n.html
index 56594c9..065b6df 100644
--- a/doc/html/range/reference/algorithms/mutating/fill_n.html
+++ b/doc/html/range/reference/algorithms/mutating/fill_n.html
@@ -22,40 +22,39 @@
 <div class="spirit-nav">
 <a accesskey="p" href="fill.html"><img src="../../../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../mutating.html"><img src="../../../../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../../../../index.html"><img src="../../../../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="generate.html"><img src="../../../../../../../../doc/src/images/next.png" alt="Next"></a>
 </div>
-<div class="section">
+<div class="section range_reference_algorithms_mutating_fill_n">
 <div class="titlepage"><div><div><h5 class="title">
 <a name="range.reference.algorithms.mutating.fill_n"></a><a class="link" href="fill_n.html" title="fill_n">fill_n</a>
 </h5></div></div></div>
-<a name="range.reference.algorithms.mutating.fill_n.prototype"></a><h6>
-<a name="id685887"></a>
-            <a class="link" href="fill_n.html#range.reference.algorithms.mutating.fill_n.prototype">Prototype</a>
+<h6>
+<a name="range.reference.algorithms.mutating.fill_n.h0"></a>
+            <span><a name="range.reference.algorithms.mutating.fill_n.prototype"></a></span><a class="link" href="fill_n.html#range.reference.algorithms.mutating.fill_n.prototype">Prototype</a>
           </h6>
 <p>
-            
 </p>
 <pre class="programlisting"><span class="keyword">template</span><span class="special">&lt;</span><span class="keyword">class</span> <span class="identifier">ForwardRange</span><span class="special">,</span> <span class="keyword">class</span> <span class="identifier">Size</span><span class="special">,</span> <span class="keyword">class</span> <span class="identifier">Value</span><span class="special">&gt;</span>
 <span class="identifier">ForwardRange</span><span class="special">&amp;</span> <span class="identifier">fill</span><span class="special">(</span> <span class="identifier">ForwardRange</span><span class="special">&amp;</span> <span class="identifier">rng</span><span class="special">,</span> <span class="identifier">Size</span> <span class="identifier">n</span><span class="special">,</span> <span class="keyword">const</span> <span class="identifier">Value</span><span class="special">&amp;</span> <span class="identifier">val</span> <span class="special">);</span>
 </pre>
 <p>
           </p>
-<a name="range.reference.algorithms.mutating.fill_n.description"></a><h6>
-<a name="id686056"></a>
-            <a class="link" href="fill_n.html#range.reference.algorithms.mutating.fill_n.description">Description</a>
+<h6>
+<a name="range.reference.algorithms.mutating.fill_n.h1"></a>
+            <span><a name="range.reference.algorithms.mutating.fill_n.description"></a></span><a class="link" href="fill_n.html#range.reference.algorithms.mutating.fill_n.description">Description</a>
           </h6>
 <p>
             <code class="computeroutput"><span class="identifier">fill_n</span></code> assigns the value
             <code class="computeroutput"><span class="identifier">val</span></code> to <code class="computeroutput"><span class="identifier">n</span></code> elements in the range <code class="computeroutput"><span class="identifier">rng</span></code> begining with <code class="computeroutput"><span class="identifier">boost</span><span class="special">::</span><span class="identifier">begin</span><span class="special">(</span><span class="identifier">rng</span><span class="special">)</span></code>.
           </p>
-<a name="range.reference.algorithms.mutating.fill_n.definition"></a><h6>
-<a name="id686152"></a>
-            <a class="link" href="fill_n.html#range.reference.algorithms.mutating.fill_n.definition">Definition</a>
+<h6>
+<a name="range.reference.algorithms.mutating.fill_n.h2"></a>
+            <span><a name="range.reference.algorithms.mutating.fill_n.definition"></a></span><a class="link" href="fill_n.html#range.reference.algorithms.mutating.fill_n.definition">Definition</a>
           </h6>
 <p>
             Defined in the header file <code class="computeroutput"><span class="identifier">boost</span><span class="special">/</span><span class="identifier">range</span><span class="special">/</span><span class="identifier">algorithm</span><span class="special">/</span><span class="identifier">fill_n</span><span class="special">.</span><span class="identifier">hpp</span></code>
           </p>
-<a name="range.reference.algorithms.mutating.fill_n.requirements"></a><h6>
-<a name="id686222"></a>
-            <a class="link" href="fill_n.html#range.reference.algorithms.mutating.fill_n.requirements">Requirements</a>
+<h6>
+<a name="range.reference.algorithms.mutating.fill_n.h3"></a>
+            <span><a name="range.reference.algorithms.mutating.fill_n.requirements"></a></span><a class="link" href="fill_n.html#range.reference.algorithms.mutating.fill_n.requirements">Requirements</a>
           </h6>
 <div class="itemizedlist"><ul class="itemizedlist" type="disc">
 <li class="listitem">
@@ -76,9 +75,9 @@
                 value type.
               </li>
 </ul></div>
-<a name="range.reference.algorithms.mutating.fill_n.complexity"></a><h6>
-<a name="id686341"></a>
-            <a class="link" href="fill_n.html#range.reference.algorithms.mutating.fill_n.complexity">Complexity</a>
+<h6>
+<a name="range.reference.algorithms.mutating.fill_n.h4"></a>
+            <span><a name="range.reference.algorithms.mutating.fill_n.complexity"></a></span><a class="link" href="fill_n.html#range.reference.algorithms.mutating.fill_n.complexity">Complexity</a>
           </h6>
 <p>
             Linear. Exactly <code class="computeroutput"><span class="identifier">n</span></code> assignments
@@ -87,7 +86,8 @@
 </div>
 <table xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" width="100%"><tr>
 <td align="left"></td>
-<td align="right"><div class="copyright-footer">Copyright &#169; 2003 -2010 Thorsten Ottosen, Neil Groves<p>
+<td align="right"><div class="copyright-footer">Copyright &#169; 2003-2010 Thorsten Ottosen,
+      Neil Groves<p>
         Distributed under the Boost Software License, Version 1.0. (See accompanying
         file LICENSE_1_0.txt or copy at <a href="http://www.boost.org/LICENSE_1_0.txt" target="_top">http://www.boost.org/LICENSE_1_0.txt</a>)
       </p>
diff --git a/doc/html/range/reference/algorithms/mutating/generate.html b/doc/html/range/reference/algorithms/mutating/generate.html
index c4f568d..a25b977 100644
--- a/doc/html/range/reference/algorithms/mutating/generate.html
+++ b/doc/html/range/reference/algorithms/mutating/generate.html
@@ -22,16 +22,15 @@
 <div class="spirit-nav">
 <a accesskey="p" href="fill_n.html"><img src="../../../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../mutating.html"><img src="../../../../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../../../../index.html"><img src="../../../../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="inplace_merge.html"><img src="../../../../../../../../doc/src/images/next.png" alt="Next"></a>
 </div>
-<div class="section">
+<div class="section range_reference_algorithms_mutating_generate">
 <div class="titlepage"><div><div><h5 class="title">
 <a name="range.reference.algorithms.mutating.generate"></a><a class="link" href="generate.html" title="generate">generate</a>
 </h5></div></div></div>
-<a name="range.reference.algorithms.mutating.generate.prototype"></a><h6>
-<a name="id686391"></a>
-            <a class="link" href="generate.html#range.reference.algorithms.mutating.generate.prototype">Prototype</a>
+<h6>
+<a name="range.reference.algorithms.mutating.generate.h0"></a>
+            <span><a name="range.reference.algorithms.mutating.generate.prototype"></a></span><a class="link" href="generate.html#range.reference.algorithms.mutating.generate.prototype">Prototype</a>
           </h6>
 <p>
-            
 </p>
 <pre class="programlisting"><span class="keyword">template</span><span class="special">&lt;</span><span class="keyword">class</span> <span class="identifier">ForwardRange</span><span class="special">,</span> <span class="keyword">class</span> <span class="identifier">Generator</span><span class="special">&gt;</span>
 <span class="identifier">ForwardRange</span><span class="special">&amp;</span> <span class="identifier">generate</span><span class="special">(</span> <span class="identifier">ForwardRange</span><span class="special">&amp;</span> <span class="identifier">rng</span><span class="special">,</span> <span class="identifier">Generator</span> <span class="identifier">gen</span> <span class="special">);</span>
@@ -41,9 +40,9 @@
 </pre>
 <p>
           </p>
-<a name="range.reference.algorithms.mutating.generate.description"></a><h6>
-<a name="id686629"></a>
-            <a class="link" href="generate.html#range.reference.algorithms.mutating.generate.description">Description</a>
+<h6>
+<a name="range.reference.algorithms.mutating.generate.h1"></a>
+            <span><a name="range.reference.algorithms.mutating.generate.description"></a></span><a class="link" href="generate.html#range.reference.algorithms.mutating.generate.description">Description</a>
           </h6>
 <p>
             <code class="computeroutput"><span class="identifier">generate</span></code> assigns the
@@ -51,16 +50,16 @@
             to each element in range <code class="computeroutput"><span class="identifier">rng</span></code>.
             Returns the resultant range.
           </p>
-<a name="range.reference.algorithms.mutating.generate.definition"></a><h6>
-<a name="id686689"></a>
-            <a class="link" href="generate.html#range.reference.algorithms.mutating.generate.definition">Definition</a>
+<h6>
+<a name="range.reference.algorithms.mutating.generate.h2"></a>
+            <span><a name="range.reference.algorithms.mutating.generate.definition"></a></span><a class="link" href="generate.html#range.reference.algorithms.mutating.generate.definition">Definition</a>
           </h6>
 <p>
             Defined in the header file <code class="computeroutput"><span class="identifier">boost</span><span class="special">/</span><span class="identifier">range</span><span class="special">/</span><span class="identifier">algorithm</span><span class="special">/</span><span class="identifier">generate</span><span class="special">.</span><span class="identifier">hpp</span></code>
           </p>
-<a name="range.reference.algorithms.mutating.generate.requirements"></a><h6>
-<a name="id686758"></a>
-            <a class="link" href="generate.html#range.reference.algorithms.mutating.generate.requirements">Requirements</a>
+<h6>
+<a name="range.reference.algorithms.mutating.generate.h3"></a>
+            <span><a name="range.reference.algorithms.mutating.generate.requirements"></a></span><a class="link" href="generate.html#range.reference.algorithms.mutating.generate.requirements">Requirements</a>
           </h6>
 <div class="itemizedlist"><ul class="itemizedlist" type="disc">
 <li class="listitem">
@@ -82,9 +81,9 @@
                 set of value types.
               </li>
 </ul></div>
-<a name="range.reference.algorithms.mutating.generate.precondition_"></a><h6>
-<a name="id686889"></a>
-            <a class="link" href="generate.html#range.reference.algorithms.mutating.generate.precondition_">Precondition:</a>
+<h6>
+<a name="range.reference.algorithms.mutating.generate.h4"></a>
+            <span><a name="range.reference.algorithms.mutating.generate.precondition_"></a></span><a class="link" href="generate.html#range.reference.algorithms.mutating.generate.precondition_">Precondition:</a>
           </h6>
 <div class="itemizedlist"><ul class="itemizedlist" type="disc">
 <li class="listitem">
@@ -96,9 +95,9 @@
                 <span class="special">+</span> <span class="identifier">distance</span><span class="special">(</span><span class="identifier">rng</span><span class="special">))</span></code> is a valid range.
               </li>
 </ul></div>
-<a name="range.reference.algorithms.mutating.generate.complexity"></a><h6>
-<a name="id686995"></a>
-            <a class="link" href="generate.html#range.reference.algorithms.mutating.generate.complexity">Complexity</a>
+<h6>
+<a name="range.reference.algorithms.mutating.generate.h5"></a>
+            <span><a name="range.reference.algorithms.mutating.generate.complexity"></a></span><a class="link" href="generate.html#range.reference.algorithms.mutating.generate.complexity">Complexity</a>
           </h6>
 <p>
             Linear. Exactly <code class="computeroutput"><span class="identifier">distance</span><span class="special">(</span><span class="identifier">rng</span><span class="special">)</span></code> assignments are performed.
@@ -106,7 +105,8 @@
 </div>
 <table xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" width="100%"><tr>
 <td align="left"></td>
-<td align="right"><div class="copyright-footer">Copyright &#169; 2003 -2010 Thorsten Ottosen, Neil Groves<p>
+<td align="right"><div class="copyright-footer">Copyright &#169; 2003-2010 Thorsten Ottosen,
+      Neil Groves<p>
         Distributed under the Boost Software License, Version 1.0. (See accompanying
         file LICENSE_1_0.txt or copy at <a href="http://www.boost.org/LICENSE_1_0.txt" target="_top">http://www.boost.org/LICENSE_1_0.txt</a>)
       </p>
diff --git a/doc/html/range/reference/algorithms/mutating/inplace_merge.html b/doc/html/range/reference/algorithms/mutating/inplace_merge.html
index ced6655..43b1305 100644
--- a/doc/html/range/reference/algorithms/mutating/inplace_merge.html
+++ b/doc/html/range/reference/algorithms/mutating/inplace_merge.html
@@ -22,16 +22,15 @@
 <div class="spirit-nav">
 <a accesskey="p" href="generate.html"><img src="../../../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../mutating.html"><img src="../../../../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../../../../index.html"><img src="../../../../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="merge.html"><img src="../../../../../../../../doc/src/images/next.png" alt="Next"></a>
 </div>
-<div class="section">
+<div class="section range_reference_algorithms_mutating_inplace_merge">
 <div class="titlepage"><div><div><h5 class="title">
 <a name="range.reference.algorithms.mutating.inplace_merge"></a><a class="link" href="inplace_merge.html" title="inplace_merge">inplace_merge</a>
 </h5></div></div></div>
-<a name="range.reference.algorithms.mutating.inplace_merge.prototype"></a><h6>
-<a name="id687058"></a>
-            <a class="link" href="inplace_merge.html#range.reference.algorithms.mutating.inplace_merge.prototype">Prototype</a>
+<h6>
+<a name="range.reference.algorithms.mutating.inplace_merge.h0"></a>
+            <span><a name="range.reference.algorithms.mutating.inplace_merge.prototype"></a></span><a class="link" href="inplace_merge.html#range.reference.algorithms.mutating.inplace_merge.prototype">Prototype</a>
           </h6>
 <p>
-            
 </p>
 <pre class="programlisting"><span class="keyword">template</span><span class="special">&lt;</span><span class="keyword">class</span> <span class="identifier">BidirectionalRange</span><span class="special">&gt;</span>
 <span class="identifier">BidirectionalRange</span><span class="special">&amp;</span>
@@ -57,9 +56,9 @@
 </pre>
 <p>
           </p>
-<a name="range.reference.algorithms.mutating.inplace_merge.description"></a><h6>
-<a name="id687615"></a>
-            <a class="link" href="inplace_merge.html#range.reference.algorithms.mutating.inplace_merge.description">Description</a>
+<h6>
+<a name="range.reference.algorithms.mutating.inplace_merge.h1"></a>
+            <span><a name="range.reference.algorithms.mutating.inplace_merge.description"></a></span><a class="link" href="inplace_merge.html#range.reference.algorithms.mutating.inplace_merge.description">Description</a>
           </h6>
 <p>
             <code class="computeroutput"><span class="identifier">inplace_merge</span></code> combines
@@ -70,16 +69,16 @@
             is stable, meaning both that the relative order of elements within each
             input range is preserved.
           </p>
-<a name="range.reference.algorithms.mutating.inplace_merge.definition"></a><h6>
-<a name="id687833"></a>
-            <a class="link" href="inplace_merge.html#range.reference.algorithms.mutating.inplace_merge.definition">Definition</a>
+<h6>
+<a name="range.reference.algorithms.mutating.inplace_merge.h2"></a>
+            <span><a name="range.reference.algorithms.mutating.inplace_merge.definition"></a></span><a class="link" href="inplace_merge.html#range.reference.algorithms.mutating.inplace_merge.definition">Definition</a>
           </h6>
 <p>
             Defined in the header file <code class="computeroutput"><span class="identifier">boost</span><span class="special">/</span><span class="identifier">range</span><span class="special">/</span><span class="identifier">algorithm</span><span class="special">/</span><span class="identifier">inplace_merge</span><span class="special">.</span><span class="identifier">hpp</span></code>
           </p>
-<a name="range.reference.algorithms.mutating.inplace_merge.requirements"></a><h6>
-<a name="id687903"></a>
-            <a class="link" href="inplace_merge.html#range.reference.algorithms.mutating.inplace_merge.requirements">Requirements</a>
+<h6>
+<a name="range.reference.algorithms.mutating.inplace_merge.h3"></a>
+            <span><a name="range.reference.algorithms.mutating.inplace_merge.requirements"></a></span><a class="link" href="inplace_merge.html#range.reference.algorithms.mutating.inplace_merge.requirements">Requirements</a>
           </h6>
 <p>
             <span class="bold"><strong>For the non-predicate version:</strong></span>
@@ -114,13 +113,13 @@
             value type is convertible to both <code class="computeroutput"><span class="identifier">BinaryPredicate</span></code>'s
             argument types.
           </p>
-<a name="range.reference.algorithms.mutating.inplace_merge.precondition_"></a><h6>
-<a name="id688158"></a>
-            <a class="link" href="inplace_merge.html#range.reference.algorithms.mutating.inplace_merge.precondition_">Precondition:</a>
+<h6>
+<a name="range.reference.algorithms.mutating.inplace_merge.h4"></a>
+            <span><a name="range.reference.algorithms.mutating.inplace_merge.precondition_"></a></span><a class="link" href="inplace_merge.html#range.reference.algorithms.mutating.inplace_merge.precondition_">Precondition:</a>
           </h6>
-<a name="range.reference.algorithms.mutating.inplace_merge.for_the_non_predicate_version_"></a><h6>
-<a name="id688178"></a>
-            <a class="link" href="inplace_merge.html#range.reference.algorithms.mutating.inplace_merge.for_the_non_predicate_version_">For
+<h6>
+<a name="range.reference.algorithms.mutating.inplace_merge.h5"></a>
+            <span><a name="range.reference.algorithms.mutating.inplace_merge.for_the_non_predicate_version_"></a></span><a class="link" href="inplace_merge.html#range.reference.algorithms.mutating.inplace_merge.for_the_non_predicate_version_">For
             the non-predicate version:</a>
           </h6>
 <div class="itemizedlist"><ul class="itemizedlist" type="disc">
@@ -141,9 +140,9 @@
                 <span class="identifier">x</span></code> is <code class="computeroutput"><span class="keyword">false</span></code>.
               </li>
 </ul></div>
-<a name="range.reference.algorithms.mutating.inplace_merge.for_the_predicate_version_"></a><h6>
-<a name="id688439"></a>
-            <a class="link" href="inplace_merge.html#range.reference.algorithms.mutating.inplace_merge.for_the_predicate_version_">For
+<h6>
+<a name="range.reference.algorithms.mutating.inplace_merge.h6"></a>
+            <span><a name="range.reference.algorithms.mutating.inplace_merge.for_the_predicate_version_"></a></span><a class="link" href="inplace_merge.html#range.reference.algorithms.mutating.inplace_merge.for_the_predicate_version_">For
             the predicate version:</a>
           </h6>
 <div class="itemizedlist"><ul class="itemizedlist" type="disc">
@@ -162,9 +161,9 @@
                 <code class="computeroutput"><span class="identifier">pred</span><span class="special">(</span><span class="identifier">y</span><span class="special">,</span><span class="identifier">x</span><span class="special">)</span> <span class="special">==</span> <span class="keyword">false</span></code>.
               </li>
 </ul></div>
-<a name="range.reference.algorithms.mutating.inplace_merge.complexity"></a><h6>
-<a name="id688724"></a>
-            <a class="link" href="inplace_merge.html#range.reference.algorithms.mutating.inplace_merge.complexity">Complexity</a>
+<h6>
+<a name="range.reference.algorithms.mutating.inplace_merge.h7"></a>
+            <span><a name="range.reference.algorithms.mutating.inplace_merge.complexity"></a></span><a class="link" href="inplace_merge.html#range.reference.algorithms.mutating.inplace_merge.complexity">Complexity</a>
           </h6>
 <p>
             Worst case: <code class="computeroutput"><span class="identifier">O</span><span class="special">(</span><span class="identifier">N</span> <span class="identifier">log</span><span class="special">(</span><span class="identifier">N</span><span class="special">))</span></code>
@@ -172,7 +171,8 @@
 </div>
 <table xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" width="100%"><tr>
 <td align="left"></td>
-<td align="right"><div class="copyright-footer">Copyright &#169; 2003 -2010 Thorsten Ottosen, Neil Groves<p>
+<td align="right"><div class="copyright-footer">Copyright &#169; 2003-2010 Thorsten Ottosen,
+      Neil Groves<p>
         Distributed under the Boost Software License, Version 1.0. (See accompanying
         file LICENSE_1_0.txt or copy at <a href="http://www.boost.org/LICENSE_1_0.txt" target="_top">http://www.boost.org/LICENSE_1_0.txt</a>)
       </p>
diff --git a/doc/html/range/reference/algorithms/mutating/merge.html b/doc/html/range/reference/algorithms/mutating/merge.html
index 9d0ce89..dfee063 100644
--- a/doc/html/range/reference/algorithms/mutating/merge.html
+++ b/doc/html/range/reference/algorithms/mutating/merge.html
@@ -22,16 +22,15 @@
 <div class="spirit-nav">
 <a accesskey="p" href="inplace_merge.html"><img src="../../../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../mutating.html"><img src="../../../../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../../../../index.html"><img src="../../../../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="nth_element.html"><img src="../../../../../../../../doc/src/images/next.png" alt="Next"></a>
 </div>
-<div class="section">
+<div class="section range_reference_algorithms_mutating_merge">
 <div class="titlepage"><div><div><h5 class="title">
 <a name="range.reference.algorithms.mutating.merge"></a><a class="link" href="merge.html" title="merge">merge</a>
 </h5></div></div></div>
-<a name="range.reference.algorithms.mutating.merge.prototype"></a><h6>
-<a name="id688803"></a>
-            <a class="link" href="merge.html#range.reference.algorithms.mutating.merge.prototype">Prototype</a>
+<h6>
+<a name="range.reference.algorithms.mutating.merge.h0"></a>
+            <span><a name="range.reference.algorithms.mutating.merge.prototype"></a></span><a class="link" href="merge.html#range.reference.algorithms.mutating.merge.prototype">Prototype</a>
           </h6>
 <p>
-            
 </p>
 <pre class="programlisting"><span class="keyword">template</span><span class="special">&lt;</span>
     <span class="keyword">class</span> <span class="identifier">SinglePassRange1</span><span class="special">,</span>
@@ -55,9 +54,9 @@
 </pre>
 <p>
           </p>
-<a name="range.reference.algorithms.mutating.merge.description"></a><h6>
-<a name="id689149"></a>
-            <a class="link" href="merge.html#range.reference.algorithms.mutating.merge.description">Description</a>
+<h6>
+<a name="range.reference.algorithms.mutating.merge.h1"></a>
+            <span><a name="range.reference.algorithms.mutating.merge.description"></a></span><a class="link" href="merge.html#range.reference.algorithms.mutating.merge.description">Description</a>
           </h6>
 <p>
             <code class="computeroutput"><span class="identifier">merge</span></code> combines two sorted
@@ -74,16 +73,16 @@
             The non-predicate version uses the <code class="computeroutput"><span class="keyword">operator</span><span class="special">&lt;()</span></code> for the range value type. The predicate
             version uses the predicate instead of <code class="computeroutput"><span class="keyword">operator</span><span class="special">&lt;()</span></code>.
           </p>
-<a name="range.reference.algorithms.mutating.merge.definition"></a><h6>
-<a name="id689324"></a>
-            <a class="link" href="merge.html#range.reference.algorithms.mutating.merge.definition">Definition</a>
+<h6>
+<a name="range.reference.algorithms.mutating.merge.h2"></a>
+            <span><a name="range.reference.algorithms.mutating.merge.definition"></a></span><a class="link" href="merge.html#range.reference.algorithms.mutating.merge.definition">Definition</a>
           </h6>
 <p>
             Defined in the header file <code class="computeroutput"><span class="identifier">boost</span><span class="special">/</span><span class="identifier">range</span><span class="special">/</span><span class="identifier">algorithm</span><span class="special">/</span><span class="identifier">merge</span><span class="special">.</span><span class="identifier">hpp</span></code>
           </p>
-<a name="range.reference.algorithms.mutating.merge.requirements"></a><h6>
-<a name="id689393"></a>
-            <a class="link" href="merge.html#range.reference.algorithms.mutating.merge.requirements">Requirements</a>
+<h6>
+<a name="range.reference.algorithms.mutating.merge.h3"></a>
+            <span><a name="range.reference.algorithms.mutating.merge.requirements"></a></span><a class="link" href="merge.html#range.reference.algorithms.mutating.merge.requirements">Requirements</a>
           </h6>
 <p>
             <span class="bold"><strong>For the non-predicate version:</strong></span>
@@ -149,13 +148,13 @@
                 set of value types.
               </li>
 </ul></div>
-<a name="range.reference.algorithms.mutating.merge.precondition_"></a><h6>
-<a name="id689915"></a>
-            <a class="link" href="merge.html#range.reference.algorithms.mutating.merge.precondition_">Precondition:</a>
+<h6>
+<a name="range.reference.algorithms.mutating.merge.h4"></a>
+            <span><a name="range.reference.algorithms.mutating.merge.precondition_"></a></span><a class="link" href="merge.html#range.reference.algorithms.mutating.merge.precondition_">Precondition:</a>
           </h6>
-<a name="range.reference.algorithms.mutating.merge.for_the_non_predicate_version_"></a><h6>
-<a name="id689935"></a>
-            <a class="link" href="merge.html#range.reference.algorithms.mutating.merge.for_the_non_predicate_version_">For
+<h6>
+<a name="range.reference.algorithms.mutating.merge.h5"></a>
+            <span><a name="range.reference.algorithms.mutating.merge.for_the_non_predicate_version_"></a></span><a class="link" href="merge.html#range.reference.algorithms.mutating.merge.for_the_non_predicate_version_">For
             the non-predicate version:</a>
           </h6>
 <div class="itemizedlist"><ul class="itemizedlist" type="disc">
@@ -193,9 +192,9 @@
                 is a valid range.
               </li>
 </ul></div>
-<a name="range.reference.algorithms.mutating.merge.for_the_predicate_version_"></a><h6>
-<a name="id690400"></a>
-            <a class="link" href="merge.html#range.reference.algorithms.mutating.merge.for_the_predicate_version_">For
+<h6>
+<a name="range.reference.algorithms.mutating.merge.h6"></a>
+            <span><a name="range.reference.algorithms.mutating.merge.for_the_predicate_version_"></a></span><a class="link" href="merge.html#range.reference.algorithms.mutating.merge.for_the_predicate_version_">For
             the predicate version:</a>
           </h6>
 <div class="itemizedlist"><ul class="itemizedlist" type="disc">
@@ -229,9 +228,9 @@
                 is a valid range.
               </li>
 </ul></div>
-<a name="range.reference.algorithms.mutating.merge.complexity"></a><h6>
-<a name="id690889"></a>
-            <a class="link" href="merge.html#range.reference.algorithms.mutating.merge.complexity">Complexity</a>
+<h6>
+<a name="range.reference.algorithms.mutating.merge.h7"></a>
+            <span><a name="range.reference.algorithms.mutating.merge.complexity"></a></span><a class="link" href="merge.html#range.reference.algorithms.mutating.merge.complexity">Complexity</a>
           </h6>
 <p>
             Linear. There are no comparisons if both <code class="computeroutput"><span class="identifier">rng1</span></code>
@@ -242,7 +241,8 @@
 </div>
 <table xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" width="100%"><tr>
 <td align="left"></td>
-<td align="right"><div class="copyright-footer">Copyright &#169; 2003 -2010 Thorsten Ottosen, Neil Groves<p>
+<td align="right"><div class="copyright-footer">Copyright &#169; 2003-2010 Thorsten Ottosen,
+      Neil Groves<p>
         Distributed under the Boost Software License, Version 1.0. (See accompanying
         file LICENSE_1_0.txt or copy at <a href="http://www.boost.org/LICENSE_1_0.txt" target="_top">http://www.boost.org/LICENSE_1_0.txt</a>)
       </p>
diff --git a/doc/html/range/reference/algorithms/mutating/nth_element.html b/doc/html/range/reference/algorithms/mutating/nth_element.html
index 16846cd..64d87c6 100644
--- a/doc/html/range/reference/algorithms/mutating/nth_element.html
+++ b/doc/html/range/reference/algorithms/mutating/nth_element.html
@@ -22,16 +22,15 @@
 <div class="spirit-nav">
 <a accesskey="p" href="merge.html"><img src="../../../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../mutating.html"><img src="../../../../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../../../../index.html"><img src="../../../../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="partial_sort.html"><img src="../../../../../../../../doc/src/images/next.png" alt="Next"></a>
 </div>
-<div class="section">
+<div class="section range_reference_algorithms_mutating_nth_element">
 <div class="titlepage"><div><div><h5 class="title">
 <a name="range.reference.algorithms.mutating.nth_element"></a><a class="link" href="nth_element.html" title="nth_element">nth_element</a>
 </h5></div></div></div>
-<a name="range.reference.algorithms.mutating.nth_element.prototype"></a><h6>
-<a name="id691010"></a>
-            <a class="link" href="nth_element.html#range.reference.algorithms.mutating.nth_element.prototype">Prototype</a>
+<h6>
+<a name="range.reference.algorithms.mutating.nth_element.h0"></a>
+            <span><a name="range.reference.algorithms.mutating.nth_element.prototype"></a></span><a class="link" href="nth_element.html#range.reference.algorithms.mutating.nth_element.prototype">Prototype</a>
           </h6>
 <p>
-            
 </p>
 <pre class="programlisting"><span class="keyword">template</span><span class="special">&lt;</span><span class="keyword">class</span> <span class="identifier">RandomAccessRange</span><span class="special">&gt;</span>
 <span class="identifier">RandomAccessRange</span><span class="special">&amp;</span> <span class="identifier">nth_element</span><span class="special">(</span>
@@ -57,9 +56,9 @@
 </pre>
 <p>
           </p>
-<a name="range.reference.algorithms.mutating.nth_element.description"></a><h6>
-<a name="id691529"></a>
-            <a class="link" href="nth_element.html#range.reference.algorithms.mutating.nth_element.description">Description</a>
+<h6>
+<a name="range.reference.algorithms.mutating.nth_element.h1"></a>
+            <span><a name="range.reference.algorithms.mutating.nth_element.description"></a></span><a class="link" href="nth_element.html#range.reference.algorithms.mutating.nth_element.description">Description</a>
           </h6>
 <p>
             <code class="computeroutput"><span class="identifier">nth_element</span></code> partially
@@ -68,16 +67,16 @@
             such that the element corresponding with the iterator <code class="computeroutput"><span class="identifier">nth</span></code>
             is the same as the element that would be in that position if <code class="computeroutput"><span class="identifier">rng</span></code> has been sorted.
           </p>
-<a name="range.reference.algorithms.mutating.nth_element.definition"></a><h6>
-<a name="id691606"></a>
-            <a class="link" href="nth_element.html#range.reference.algorithms.mutating.nth_element.definition">Definition</a>
+<h6>
+<a name="range.reference.algorithms.mutating.nth_element.h2"></a>
+            <span><a name="range.reference.algorithms.mutating.nth_element.definition"></a></span><a class="link" href="nth_element.html#range.reference.algorithms.mutating.nth_element.definition">Definition</a>
           </h6>
 <p>
             Defined in the header file <code class="computeroutput"><span class="identifier">boost</span><span class="special">/</span><span class="identifier">range</span><span class="special">/</span><span class="identifier">algorithm</span><span class="special">/</span><span class="identifier">nth_element</span><span class="special">.</span><span class="identifier">hpp</span></code>
           </p>
-<a name="range.reference.algorithms.mutating.nth_element.requirements"></a><h6>
-<a name="id691676"></a>
-            <a class="link" href="nth_element.html#range.reference.algorithms.mutating.nth_element.requirements">Requirements</a>
+<h6>
+<a name="range.reference.algorithms.mutating.nth_element.h3"></a>
+            <span><a name="range.reference.algorithms.mutating.nth_element.requirements"></a></span><a class="link" href="nth_element.html#range.reference.algorithms.mutating.nth_element.requirements">Requirements</a>
           </h6>
 <p>
             <span class="bold"><strong>For the non-predicate version:</strong></span>
@@ -126,9 +125,9 @@
                 argument types.
               </li>
 </ul></div>
-<a name="range.reference.algorithms.mutating.nth_element.complexity"></a><h6>
-<a name="id691923"></a>
-            <a class="link" href="nth_element.html#range.reference.algorithms.mutating.nth_element.complexity">Complexity</a>
+<h6>
+<a name="range.reference.algorithms.mutating.nth_element.h4"></a>
+            <span><a name="range.reference.algorithms.mutating.nth_element.complexity"></a></span><a class="link" href="nth_element.html#range.reference.algorithms.mutating.nth_element.complexity">Complexity</a>
           </h6>
 <p>
             On average, linear in <code class="computeroutput"><span class="identifier">distance</span><span class="special">(</span><span class="identifier">rng</span><span class="special">)</span></code>.
@@ -136,7 +135,8 @@
 </div>
 <table xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" width="100%"><tr>
 <td align="left"></td>
-<td align="right"><div class="copyright-footer">Copyright &#169; 2003 -2010 Thorsten Ottosen, Neil Groves<p>
+<td align="right"><div class="copyright-footer">Copyright &#169; 2003-2010 Thorsten Ottosen,
+      Neil Groves<p>
         Distributed under the Boost Software License, Version 1.0. (See accompanying
         file LICENSE_1_0.txt or copy at <a href="http://www.boost.org/LICENSE_1_0.txt" target="_top">http://www.boost.org/LICENSE_1_0.txt</a>)
       </p>
diff --git a/doc/html/range/reference/algorithms/mutating/partial_sort.html b/doc/html/range/reference/algorithms/mutating/partial_sort.html
index 33fb1df..a00b3ff 100644
--- a/doc/html/range/reference/algorithms/mutating/partial_sort.html
+++ b/doc/html/range/reference/algorithms/mutating/partial_sort.html
@@ -22,16 +22,15 @@
 <div class="spirit-nav">
 <a accesskey="p" href="nth_element.html"><img src="../../../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../mutating.html"><img src="../../../../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../../../../index.html"><img src="../../../../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="partition.html"><img src="../../../../../../../../doc/src/images/next.png" alt="Next"></a>
 </div>
-<div class="section">
+<div class="section range_reference_algorithms_mutating_partial_sort">
 <div class="titlepage"><div><div><h5 class="title">
 <a name="range.reference.algorithms.mutating.partial_sort"></a><a class="link" href="partial_sort.html" title="partial_sort">partial_sort</a>
 </h5></div></div></div>
-<a name="range.reference.algorithms.mutating.partial_sort.prototype"></a><h6>
-<a name="id691988"></a>
-            <a class="link" href="partial_sort.html#range.reference.algorithms.mutating.partial_sort.prototype">Prototype</a>
+<h6>
+<a name="range.reference.algorithms.mutating.partial_sort.h0"></a>
+            <span><a name="range.reference.algorithms.mutating.partial_sort.prototype"></a></span><a class="link" href="partial_sort.html#range.reference.algorithms.mutating.partial_sort.prototype">Prototype</a>
           </h6>
 <p>
-            
 </p>
 <pre class="programlisting"><span class="keyword">template</span><span class="special">&lt;</span><span class="keyword">class</span> <span class="identifier">RandomAccessRange</span><span class="special">&gt;</span>
 <span class="identifier">RandomAccessRange</span><span class="special">&amp;</span> <span class="identifier">partial_sort</span><span class="special">(</span>
@@ -57,9 +56,9 @@
 </pre>
 <p>
           </p>
-<a name="range.reference.algorithms.mutating.partial_sort.description"></a><h6>
-<a name="id692508"></a>
-            <a class="link" href="partial_sort.html#range.reference.algorithms.mutating.partial_sort.description">Description</a>
+<h6>
+<a name="range.reference.algorithms.mutating.partial_sort.h1"></a>
+            <span><a name="range.reference.algorithms.mutating.partial_sort.description"></a></span><a class="link" href="partial_sort.html#range.reference.algorithms.mutating.partial_sort.description">Description</a>
           </h6>
 <p>
             <code class="computeroutput"><span class="identifier">partial_sort</span></code> rearranges
@@ -73,16 +72,16 @@
             is less than another by using <code class="computeroutput"><span class="keyword">operator</span><span class="special">&lt;()</span></code>. The predicate versions use the
             predicate instead.
           </p>
-<a name="range.reference.algorithms.mutating.partial_sort.definition"></a><h6>
-<a name="id692685"></a>
-            <a class="link" href="partial_sort.html#range.reference.algorithms.mutating.partial_sort.definition">Definition</a>
+<h6>
+<a name="range.reference.algorithms.mutating.partial_sort.h2"></a>
+            <span><a name="range.reference.algorithms.mutating.partial_sort.definition"></a></span><a class="link" href="partial_sort.html#range.reference.algorithms.mutating.partial_sort.definition">Definition</a>
           </h6>
 <p>
             Defined in the header file <code class="computeroutput"><span class="identifier">boost</span><span class="special">/</span><span class="identifier">range</span><span class="special">/</span><span class="identifier">algorithm</span><span class="special">/</span><span class="identifier">partial_sort</span><span class="special">.</span><span class="identifier">hpp</span></code>
           </p>
-<a name="range.reference.algorithms.mutating.partial_sort.requirements"></a><h6>
-<a name="id692756"></a>
-            <a class="link" href="partial_sort.html#range.reference.algorithms.mutating.partial_sort.requirements">Requirements</a>
+<h6>
+<a name="range.reference.algorithms.mutating.partial_sort.h3"></a>
+            <span><a name="range.reference.algorithms.mutating.partial_sort.requirements"></a></span><a class="link" href="partial_sort.html#range.reference.algorithms.mutating.partial_sort.requirements">Requirements</a>
           </h6>
 <p>
             <span class="bold"><strong>For the non-predicate version:</strong></span>
@@ -131,9 +130,9 @@
                 argument types.
               </li>
 </ul></div>
-<a name="range.reference.algorithms.mutating.partial_sort.complexity"></a><h6>
-<a name="id693003"></a>
-            <a class="link" href="partial_sort.html#range.reference.algorithms.mutating.partial_sort.complexity">Complexity</a>
+<h6>
+<a name="range.reference.algorithms.mutating.partial_sort.h4"></a>
+            <span><a name="range.reference.algorithms.mutating.partial_sort.complexity"></a></span><a class="link" href="partial_sort.html#range.reference.algorithms.mutating.partial_sort.complexity">Complexity</a>
           </h6>
 <p>
             Approximately <code class="computeroutput"><span class="identifier">distance</span><span class="special">(</span><span class="identifier">rng</span><span class="special">)</span> <span class="special">*</span> <span class="identifier">log</span><span class="special">(</span><span class="identifier">distance</span><span class="special">(</span><span class="identifier">begin</span><span class="special">(</span><span class="identifier">rng</span><span class="special">),</span> <span class="identifier">middle</span><span class="special">))</span></code> comparisons.
@@ -141,7 +140,8 @@
 </div>
 <table xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" width="100%"><tr>
 <td align="left"></td>
-<td align="right"><div class="copyright-footer">Copyright &#169; 2003 -2010 Thorsten Ottosen, Neil Groves<p>
+<td align="right"><div class="copyright-footer">Copyright &#169; 2003-2010 Thorsten Ottosen,
+      Neil Groves<p>
         Distributed under the Boost Software License, Version 1.0. (See accompanying
         file LICENSE_1_0.txt or copy at <a href="http://www.boost.org/LICENSE_1_0.txt" target="_top">http://www.boost.org/LICENSE_1_0.txt</a>)
       </p>
diff --git a/doc/html/range/reference/algorithms/mutating/partition.html b/doc/html/range/reference/algorithms/mutating/partition.html
index d659dd4..e45dbca 100644
--- a/doc/html/range/reference/algorithms/mutating/partition.html
+++ b/doc/html/range/reference/algorithms/mutating/partition.html
@@ -22,16 +22,15 @@
 <div class="spirit-nav">
 <a accesskey="p" href="partial_sort.html"><img src="../../../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../mutating.html"><img src="../../../../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../../../../index.html"><img src="../../../../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="random_shuffle.html"><img src="../../../../../../../../doc/src/images/next.png" alt="Next"></a>
 </div>
-<div class="section">
+<div class="section range_reference_algorithms_mutating_partition">
 <div class="titlepage"><div><div><h5 class="title">
 <a name="range.reference.algorithms.mutating.partition"></a><a class="link" href="partition.html" title="partition">partition</a>
 </h5></div></div></div>
-<a name="range.reference.algorithms.mutating.partition.prototype"></a><h6>
-<a name="id693119"></a>
-            <a class="link" href="partition.html#range.reference.algorithms.mutating.partition.prototype">Prototype</a>
+<h6>
+<a name="range.reference.algorithms.mutating.partition.h0"></a>
+            <span><a name="range.reference.algorithms.mutating.partition.prototype"></a></span><a class="link" href="partition.html#range.reference.algorithms.mutating.partition.prototype">Prototype</a>
           </h6>
 <p>
-            
 </p>
 <pre class="programlisting"><span class="keyword">template</span><span class="special">&lt;</span>
     <span class="keyword">class</span> <span class="identifier">ForwardRange</span><span class="special">,</span>
@@ -65,9 +64,9 @@
 </pre>
 <p>
           </p>
-<a name="range.reference.algorithms.mutating.partition.description"></a><h6>
-<a name="id693695"></a>
-            <a class="link" href="partition.html#range.reference.algorithms.mutating.partition.description">Description</a>
+<h6>
+<a name="range.reference.algorithms.mutating.partition.h1"></a>
+            <span><a name="range.reference.algorithms.mutating.partition.description"></a></span><a class="link" href="partition.html#range.reference.algorithms.mutating.partition.description">Description</a>
           </h6>
 <p>
             <code class="computeroutput"><span class="identifier">partition</span></code> orders the
@@ -79,16 +78,16 @@
             have a configurable range_return, <code class="computeroutput"><span class="identifier">found</span></code>
             corresponds to the middle iterator.
           </p>
-<a name="range.reference.algorithms.mutating.partition.definition"></a><h6>
-<a name="id693774"></a>
-            <a class="link" href="partition.html#range.reference.algorithms.mutating.partition.definition">Definition</a>
+<h6>
+<a name="range.reference.algorithms.mutating.partition.h2"></a>
+            <span><a name="range.reference.algorithms.mutating.partition.definition"></a></span><a class="link" href="partition.html#range.reference.algorithms.mutating.partition.definition">Definition</a>
           </h6>
 <p>
             Defined in the header file <code class="computeroutput"><span class="identifier">boost</span><span class="special">/</span><span class="identifier">range</span><span class="special">/</span><span class="identifier">algorithm</span><span class="special">/</span><span class="identifier">partition</span><span class="special">.</span><span class="identifier">hpp</span></code>
           </p>
-<a name="range.reference.algorithms.mutating.partition.requirements"></a><h6>
-<a name="id693845"></a>
-            <a class="link" href="partition.html#range.reference.algorithms.mutating.partition.requirements">Requirements</a>
+<h6>
+<a name="range.reference.algorithms.mutating.partition.h3"></a>
+            <span><a name="range.reference.algorithms.mutating.partition.requirements"></a></span><a class="link" href="partition.html#range.reference.algorithms.mutating.partition.requirements">Requirements</a>
           </h6>
 <div class="itemizedlist"><ul class="itemizedlist" type="disc">
 <li class="listitem">
@@ -106,9 +105,9 @@
                 argument type.
               </li>
 </ul></div>
-<a name="range.reference.algorithms.mutating.partition.complexity"></a><h6>
-<a name="id693947"></a>
-            <a class="link" href="partition.html#range.reference.algorithms.mutating.partition.complexity">Complexity</a>
+<h6>
+<a name="range.reference.algorithms.mutating.partition.h4"></a>
+            <span><a name="range.reference.algorithms.mutating.partition.complexity"></a></span><a class="link" href="partition.html#range.reference.algorithms.mutating.partition.complexity">Complexity</a>
           </h6>
 <p>
             Linear. Exactly <code class="computeroutput"><span class="identifier">distance</span><span class="special">(</span><span class="identifier">rng</span><span class="special">)</span></code> applications of <code class="computeroutput"><span class="identifier">pred</span></code>,
@@ -118,7 +117,8 @@
 </div>
 <table xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" width="100%"><tr>
 <td align="left"></td>
-<td align="right"><div class="copyright-footer">Copyright &#169; 2003 -2010 Thorsten Ottosen, Neil Groves<p>
+<td align="right"><div class="copyright-footer">Copyright &#169; 2003-2010 Thorsten Ottosen,
+      Neil Groves<p>
         Distributed under the Boost Software License, Version 1.0. (See accompanying
         file LICENSE_1_0.txt or copy at <a href="http://www.boost.org/LICENSE_1_0.txt" target="_top">http://www.boost.org/LICENSE_1_0.txt</a>)
       </p>
diff --git a/doc/html/range/reference/algorithms/mutating/random_shuffle.html b/doc/html/range/reference/algorithms/mutating/random_shuffle.html
index 8b8629d..e9ae434 100644
--- a/doc/html/range/reference/algorithms/mutating/random_shuffle.html
+++ b/doc/html/range/reference/algorithms/mutating/random_shuffle.html
@@ -22,16 +22,15 @@
 <div class="spirit-nav">
 <a accesskey="p" href="partition.html"><img src="../../../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../mutating.html"><img src="../../../../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../../../../index.html"><img src="../../../../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="remove.html"><img src="../../../../../../../../doc/src/images/next.png" alt="Next"></a>
 </div>
-<div class="section">
+<div class="section range_reference_algorithms_mutating_random_shuffle">
 <div class="titlepage"><div><div><h5 class="title">
 <a name="range.reference.algorithms.mutating.random_shuffle"></a><a class="link" href="random_shuffle.html" title="random_shuffle">random_shuffle</a>
 </h5></div></div></div>
-<a name="range.reference.algorithms.mutating.random_shuffle.prototype"></a><h6>
-<a name="id694058"></a>
-            <a class="link" href="random_shuffle.html#range.reference.algorithms.mutating.random_shuffle.prototype">Prototype</a>
+<h6>
+<a name="range.reference.algorithms.mutating.random_shuffle.h0"></a>
+            <span><a name="range.reference.algorithms.mutating.random_shuffle.prototype"></a></span><a class="link" href="random_shuffle.html#range.reference.algorithms.mutating.random_shuffle.prototype">Prototype</a>
           </h6>
 <p>
-            
 </p>
 <pre class="programlisting"><span class="keyword">template</span><span class="special">&lt;</span><span class="keyword">class</span> <span class="identifier">RandomAccessRange</span><span class="special">&gt;</span>
 <span class="identifier">RandomAccessRange</span><span class="special">&amp;</span> <span class="identifier">random_shuffle</span><span class="special">(</span><span class="identifier">RandomAccessRange</span><span class="special">&amp;</span> <span class="identifier">rng</span><span class="special">);</span>
@@ -47,9 +46,9 @@
 </pre>
 <p>
           </p>
-<a name="range.reference.algorithms.mutating.random_shuffle.description"></a><h6>
-<a name="id694442"></a>
-            <a class="link" href="random_shuffle.html#range.reference.algorithms.mutating.random_shuffle.description">Description</a>
+<h6>
+<a name="range.reference.algorithms.mutating.random_shuffle.h1"></a>
+            <span><a name="range.reference.algorithms.mutating.random_shuffle.description"></a></span><a class="link" href="random_shuffle.html#range.reference.algorithms.mutating.random_shuffle.description">Description</a>
           </h6>
 <p>
             <code class="computeroutput"><span class="identifier">random_shuffle</span></code> randomly
@@ -59,16 +58,16 @@
             use an internal random number generator. The versions of <code class="computeroutput"><span class="identifier">random_shuffle</span></code> that do specify a <code class="computeroutput"><span class="identifier">Generator</span></code> use this instead. Returns
             the shuffles range.
           </p>
-<a name="range.reference.algorithms.mutating.random_shuffle.definition"></a><h6>
-<a name="id694530"></a>
-            <a class="link" href="random_shuffle.html#range.reference.algorithms.mutating.random_shuffle.definition">Definition</a>
+<h6>
+<a name="range.reference.algorithms.mutating.random_shuffle.h2"></a>
+            <span><a name="range.reference.algorithms.mutating.random_shuffle.definition"></a></span><a class="link" href="random_shuffle.html#range.reference.algorithms.mutating.random_shuffle.definition">Definition</a>
           </h6>
 <p>
             Defined in the header file <code class="computeroutput"><span class="identifier">boost</span><span class="special">/</span><span class="identifier">range</span><span class="special">/</span><span class="identifier">algorithm</span><span class="special">/</span><span class="identifier">random_shuffle</span><span class="special">.</span><span class="identifier">hpp</span></code>
           </p>
-<a name="range.reference.algorithms.mutating.random_shuffle.requirements"></a><h6>
-<a name="id694601"></a>
-            <a class="link" href="random_shuffle.html#range.reference.algorithms.mutating.random_shuffle.requirements">Requirements</a>
+<h6>
+<a name="range.reference.algorithms.mutating.random_shuffle.h3"></a>
+            <span><a name="range.reference.algorithms.mutating.random_shuffle.requirements"></a></span><a class="link" href="random_shuffle.html#range.reference.algorithms.mutating.random_shuffle.requirements">Requirements</a>
           </h6>
 <p>
             <span class="bold"><strong>For the version without a Generator:</strong></span>
@@ -97,18 +96,18 @@
                 argument type.
               </li>
 </ul></div>
-<a name="range.reference.algorithms.mutating.random_shuffle.precondition_"></a><h6>
-<a name="id694751"></a>
-            <a class="link" href="random_shuffle.html#range.reference.algorithms.mutating.random_shuffle.precondition_">Precondition:</a>
+<h6>
+<a name="range.reference.algorithms.mutating.random_shuffle.h4"></a>
+            <span><a name="range.reference.algorithms.mutating.random_shuffle.precondition_"></a></span><a class="link" href="random_shuffle.html#range.reference.algorithms.mutating.random_shuffle.precondition_">Precondition:</a>
           </h6>
 <div class="itemizedlist"><ul class="itemizedlist" type="disc"><li class="listitem">
                 <code class="computeroutput"><span class="identifier">distance</span><span class="special">(</span><span class="identifier">rng</span><span class="special">)</span></code>
                 is less than <code class="computeroutput"><span class="identifier">gen</span></code>'s
                 maximum value.
               </li></ul></div>
-<a name="range.reference.algorithms.mutating.random_shuffle.complexity"></a><h6>
-<a name="id694815"></a>
-            <a class="link" href="random_shuffle.html#range.reference.algorithms.mutating.random_shuffle.complexity">Complexity</a>
+<h6>
+<a name="range.reference.algorithms.mutating.random_shuffle.h5"></a>
+            <span><a name="range.reference.algorithms.mutating.random_shuffle.complexity"></a></span><a class="link" href="random_shuffle.html#range.reference.algorithms.mutating.random_shuffle.complexity">Complexity</a>
           </h6>
 <p>
             Linear. If <code class="computeroutput"><span class="special">!</span><span class="identifier">empty</span><span class="special">(</span><span class="identifier">rng</span><span class="special">)</span></code>, exactly <code class="computeroutput"><span class="identifier">distance</span><span class="special">(</span><span class="identifier">rng</span><span class="special">)</span> <span class="special">-</span> <span class="number">1</span></code>
@@ -117,7 +116,8 @@
 </div>
 <table xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" width="100%"><tr>
 <td align="left"></td>
-<td align="right"><div class="copyright-footer">Copyright &#169; 2003 -2010 Thorsten Ottosen, Neil Groves<p>
+<td align="right"><div class="copyright-footer">Copyright &#169; 2003-2010 Thorsten Ottosen,
+      Neil Groves<p>
         Distributed under the Boost Software License, Version 1.0. (See accompanying
         file LICENSE_1_0.txt or copy at <a href="http://www.boost.org/LICENSE_1_0.txt" target="_top">http://www.boost.org/LICENSE_1_0.txt</a>)
       </p>
diff --git a/doc/html/range/reference/algorithms/mutating/remove.html b/doc/html/range/reference/algorithms/mutating/remove.html
index 172fd87..073ea31 100644
--- a/doc/html/range/reference/algorithms/mutating/remove.html
+++ b/doc/html/range/reference/algorithms/mutating/remove.html
@@ -22,16 +22,15 @@
 <div class="spirit-nav">
 <a accesskey="p" href="random_shuffle.html"><img src="../../../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../mutating.html"><img src="../../../../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../../../../index.html"><img src="../../../../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="remove_copy.html"><img src="../../../../../../../../doc/src/images/next.png" alt="Next"></a>
 </div>
-<div class="section">
+<div class="section range_reference_algorithms_mutating_remove">
 <div class="titlepage"><div><div><h5 class="title">
 <a name="range.reference.algorithms.mutating.remove"></a><a class="link" href="remove.html" title="remove">remove</a>
 </h5></div></div></div>
-<a name="range.reference.algorithms.mutating.remove.prototype"></a><h6>
-<a name="id694919"></a>
-            <a class="link" href="remove.html#range.reference.algorithms.mutating.remove.prototype">Prototype</a>
+<h6>
+<a name="range.reference.algorithms.mutating.remove.h0"></a>
+            <span><a name="range.reference.algorithms.mutating.remove.prototype"></a></span><a class="link" href="remove.html#range.reference.algorithms.mutating.remove.prototype">Prototype</a>
           </h6>
 <p>
-            
 </p>
 <pre class="programlisting"><span class="keyword">template</span><span class="special">&lt;</span>
     <span class="keyword">class</span> <span class="identifier">ForwardRange</span><span class="special">,</span>
@@ -65,9 +64,9 @@
 </pre>
 <p>
           </p>
-<a name="range.reference.algorithms.mutating.remove.description"></a><h6>
-<a name="id695536"></a>
-            <a class="link" href="remove.html#range.reference.algorithms.mutating.remove.description">Description</a>
+<h6>
+<a name="range.reference.algorithms.mutating.remove.h1"></a>
+            <span><a name="range.reference.algorithms.mutating.remove.description"></a></span><a class="link" href="remove.html#range.reference.algorithms.mutating.remove.description">Description</a>
           </h6>
 <p>
             <code class="computeroutput"><span class="identifier">remove</span></code> removes from
@@ -82,16 +81,16 @@
             <span class="identifier">end</span><span class="special">(</span><span class="identifier">rng</span><span class="special">))</span></code>
             are dereferenceable, but the elements are unspecified.
           </p>
-<a name="range.reference.algorithms.mutating.remove.definition"></a><h6>
-<a name="id695762"></a>
-            <a class="link" href="remove.html#range.reference.algorithms.mutating.remove.definition">Definition</a>
+<h6>
+<a name="range.reference.algorithms.mutating.remove.h2"></a>
+            <span><a name="range.reference.algorithms.mutating.remove.definition"></a></span><a class="link" href="remove.html#range.reference.algorithms.mutating.remove.definition">Definition</a>
           </h6>
 <p>
             Defined in the header file <code class="computeroutput"><span class="identifier">boost</span><span class="special">/</span><span class="identifier">range</span><span class="special">/</span><span class="identifier">algorithm</span><span class="special">/</span><span class="identifier">remove</span><span class="special">.</span><span class="identifier">hpp</span></code>
           </p>
-<a name="range.reference.algorithms.mutating.remove.requirements"></a><h6>
-<a name="id695833"></a>
-            <a class="link" href="remove.html#range.reference.algorithms.mutating.remove.requirements">Requirements</a>
+<h6>
+<a name="range.reference.algorithms.mutating.remove.h3"></a>
+            <span><a name="range.reference.algorithms.mutating.remove.requirements"></a></span><a class="link" href="remove.html#range.reference.algorithms.mutating.remove.requirements">Requirements</a>
           </h6>
 <div class="itemizedlist"><ul class="itemizedlist" type="disc">
 <li class="listitem">
@@ -112,9 +111,9 @@
                 value type.
               </li>
 </ul></div>
-<a name="range.reference.algorithms.mutating.remove.complexity"></a><h6>
-<a name="id695954"></a>
-            <a class="link" href="remove.html#range.reference.algorithms.mutating.remove.complexity">Complexity</a>
+<h6>
+<a name="range.reference.algorithms.mutating.remove.h4"></a>
+            <span><a name="range.reference.algorithms.mutating.remove.complexity"></a></span><a class="link" href="remove.html#range.reference.algorithms.mutating.remove.complexity">Complexity</a>
           </h6>
 <p>
             Linear. <code class="computeroutput"><span class="identifier">remove</span></code> performs
@@ -124,7 +123,8 @@
 </div>
 <table xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" width="100%"><tr>
 <td align="left"></td>
-<td align="right"><div class="copyright-footer">Copyright &#169; 2003 -2010 Thorsten Ottosen, Neil Groves<p>
+<td align="right"><div class="copyright-footer">Copyright &#169; 2003-2010 Thorsten Ottosen,
+      Neil Groves<p>
         Distributed under the Boost Software License, Version 1.0. (See accompanying
         file LICENSE_1_0.txt or copy at <a href="http://www.boost.org/LICENSE_1_0.txt" target="_top">http://www.boost.org/LICENSE_1_0.txt</a>)
       </p>
diff --git a/doc/html/range/reference/algorithms/mutating/remove_copy.html b/doc/html/range/reference/algorithms/mutating/remove_copy.html
index a5aff6b..9951aa3 100644
--- a/doc/html/range/reference/algorithms/mutating/remove_copy.html
+++ b/doc/html/range/reference/algorithms/mutating/remove_copy.html
@@ -22,16 +22,15 @@
 <div class="spirit-nav">
 <a accesskey="p" href="remove.html"><img src="../../../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../mutating.html"><img src="../../../../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../../../../index.html"><img src="../../../../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="remove_copy_if.html"><img src="../../../../../../../../doc/src/images/next.png" alt="Next"></a>
 </div>
-<div class="section">
+<div class="section range_reference_algorithms_mutating_remove_copy">
 <div class="titlepage"><div><div><h5 class="title">
 <a name="range.reference.algorithms.mutating.remove_copy"></a><a class="link" href="remove_copy.html" title="remove_copy">remove_copy</a>
 </h5></div></div></div>
-<a name="range.reference.algorithms.mutating.remove_copy.prototype"></a><h6>
-<a name="id696029"></a>
-            <a class="link" href="remove_copy.html#range.reference.algorithms.mutating.remove_copy.prototype">Prototype</a>
+<h6>
+<a name="range.reference.algorithms.mutating.remove_copy.h0"></a>
+            <span><a name="range.reference.algorithms.mutating.remove_copy.prototype"></a></span><a class="link" href="remove_copy.html#range.reference.algorithms.mutating.remove_copy.prototype">Prototype</a>
           </h6>
 <p>
-            
 </p>
 <pre class="programlisting"><span class="keyword">template</span><span class="special">&lt;</span><span class="keyword">class</span> <span class="identifier">ForwardRange</span><span class="special">,</span> <span class="keyword">class</span> <span class="identifier">Outputiterator</span><span class="special">,</span> <span class="keyword">class</span> <span class="identifier">Value</span><span class="special">&gt;</span>
 <span class="identifier">OutputIterator</span>
@@ -43,25 +42,25 @@
 </pre>
 <p>
           </p>
-<a name="range.reference.algorithms.mutating.remove_copy.description"></a><h6>
-<a name="id696332"></a>
-            <a class="link" href="remove_copy.html#range.reference.algorithms.mutating.remove_copy.description">Description</a>
+<h6>
+<a name="range.reference.algorithms.mutating.remove_copy.h1"></a>
+            <span><a name="range.reference.algorithms.mutating.remove_copy.description"></a></span><a class="link" href="remove_copy.html#range.reference.algorithms.mutating.remove_copy.description">Description</a>
           </h6>
 <p>
             <code class="computeroutput"><span class="identifier">remove_copy</span></code> copied all
             of the elements <code class="computeroutput"><span class="identifier">x</span></code> from
             <code class="computeroutput"><span class="identifier">rng</span></code> for which <code class="computeroutput"><span class="identifier">x</span> <span class="special">==</span> <span class="identifier">val</span></code> is <code class="computeroutput"><span class="keyword">false</span></code>.
           </p>
-<a name="range.reference.algorithms.mutating.remove_copy.definition"></a><h6>
-<a name="id696418"></a>
-            <a class="link" href="remove_copy.html#range.reference.algorithms.mutating.remove_copy.definition">Definition</a>
+<h6>
+<a name="range.reference.algorithms.mutating.remove_copy.h2"></a>
+            <span><a name="range.reference.algorithms.mutating.remove_copy.definition"></a></span><a class="link" href="remove_copy.html#range.reference.algorithms.mutating.remove_copy.definition">Definition</a>
           </h6>
 <p>
             Defined in the header file <code class="computeroutput"><span class="identifier">boost</span><span class="special">/</span><span class="identifier">range</span><span class="special">/</span><span class="identifier">algorithm</span><span class="special">/</span><span class="identifier">remove_copy</span><span class="special">.</span><span class="identifier">hpp</span></code>
           </p>
-<a name="range.reference.algorithms.mutating.remove_copy.requirements"></a><h6>
-<a name="id696488"></a>
-            <a class="link" href="remove_copy.html#range.reference.algorithms.mutating.remove_copy.requirements">Requirements</a>
+<h6>
+<a name="range.reference.algorithms.mutating.remove_copy.h3"></a>
+            <span><a name="range.reference.algorithms.mutating.remove_copy.requirements"></a></span><a class="link" href="remove_copy.html#range.reference.algorithms.mutating.remove_copy.requirements">Requirements</a>
           </h6>
 <div class="itemizedlist"><ul class="itemizedlist" type="disc">
 <li class="listitem">
@@ -82,9 +81,9 @@
                 value type.
               </li>
 </ul></div>
-<a name="range.reference.algorithms.mutating.remove_copy.complexity"></a><h6>
-<a name="id696609"></a>
-            <a class="link" href="remove_copy.html#range.reference.algorithms.mutating.remove_copy.complexity">Complexity</a>
+<h6>
+<a name="range.reference.algorithms.mutating.remove_copy.h4"></a>
+            <span><a name="range.reference.algorithms.mutating.remove_copy.complexity"></a></span><a class="link" href="remove_copy.html#range.reference.algorithms.mutating.remove_copy.complexity">Complexity</a>
           </h6>
 <p>
             Linear. <code class="computeroutput"><span class="identifier">remove_copy</span></code> performs
@@ -94,7 +93,8 @@
 </div>
 <table xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" width="100%"><tr>
 <td align="left"></td>
-<td align="right"><div class="copyright-footer">Copyright &#169; 2003 -2010 Thorsten Ottosen, Neil Groves<p>
+<td align="right"><div class="copyright-footer">Copyright &#169; 2003-2010 Thorsten Ottosen,
+      Neil Groves<p>
         Distributed under the Boost Software License, Version 1.0. (See accompanying
         file LICENSE_1_0.txt or copy at <a href="http://www.boost.org/LICENSE_1_0.txt" target="_top">http://www.boost.org/LICENSE_1_0.txt</a>)
       </p>
diff --git a/doc/html/range/reference/algorithms/mutating/remove_copy_if.html b/doc/html/range/reference/algorithms/mutating/remove_copy_if.html
index 4763181..9f38a0c 100644
--- a/doc/html/range/reference/algorithms/mutating/remove_copy_if.html
+++ b/doc/html/range/reference/algorithms/mutating/remove_copy_if.html
@@ -22,16 +22,15 @@
 <div class="spirit-nav">
 <a accesskey="p" href="remove_copy.html"><img src="../../../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../mutating.html"><img src="../../../../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../../../../index.html"><img src="../../../../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="remove_if.html"><img src="../../../../../../../../doc/src/images/next.png" alt="Next"></a>
 </div>
-<div class="section">
+<div class="section range_reference_algorithms_mutating_remove_copy_if">
 <div class="titlepage"><div><div><h5 class="title">
 <a name="range.reference.algorithms.mutating.remove_copy_if"></a><a class="link" href="remove_copy_if.html" title="remove_copy_if">remove_copy_if</a>
 </h5></div></div></div>
-<a name="range.reference.algorithms.mutating.remove_copy_if.prototype"></a><h6>
-<a name="id696683"></a>
-            <a class="link" href="remove_copy_if.html#range.reference.algorithms.mutating.remove_copy_if.prototype">Prototype</a>
+<h6>
+<a name="range.reference.algorithms.mutating.remove_copy_if.h0"></a>
+            <span><a name="range.reference.algorithms.mutating.remove_copy_if.prototype"></a></span><a class="link" href="remove_copy_if.html#range.reference.algorithms.mutating.remove_copy_if.prototype">Prototype</a>
           </h6>
 <p>
-            
 </p>
 <pre class="programlisting"><span class="keyword">template</span><span class="special">&lt;</span><span class="keyword">class</span> <span class="identifier">ForwardRange</span><span class="special">,</span> <span class="keyword">class</span> <span class="identifier">Outputiterator</span><span class="special">,</span> <span class="keyword">class</span> <span class="identifier">UnaryPred</span><span class="special">&gt;</span>
 <span class="identifier">OutputIterator</span>
@@ -43,9 +42,9 @@
 </pre>
 <p>
           </p>
-<a name="range.reference.algorithms.mutating.remove_copy_if.description"></a><h6>
-<a name="id696964"></a>
-            <a class="link" href="remove_copy_if.html#range.reference.algorithms.mutating.remove_copy_if.description">Description</a>
+<h6>
+<a name="range.reference.algorithms.mutating.remove_copy_if.h1"></a>
+            <span><a name="range.reference.algorithms.mutating.remove_copy_if.description"></a></span><a class="link" href="remove_copy_if.html#range.reference.algorithms.mutating.remove_copy_if.description">Description</a>
           </h6>
 <p>
             <code class="computeroutput"><span class="identifier">remove_copy_if</span></code> copied
@@ -53,16 +52,16 @@
             from <code class="computeroutput"><span class="identifier">rng</span></code> for which <code class="computeroutput"><span class="identifier">pred</span><span class="special">(</span><span class="identifier">x</span><span class="special">)</span></code>
             is <code class="computeroutput"><span class="keyword">false</span></code>.
           </p>
-<a name="range.reference.algorithms.mutating.remove_copy_if.definition"></a><h6>
-<a name="id697054"></a>
-            <a class="link" href="remove_copy_if.html#range.reference.algorithms.mutating.remove_copy_if.definition">Definition</a>
+<h6>
+<a name="range.reference.algorithms.mutating.remove_copy_if.h2"></a>
+            <span><a name="range.reference.algorithms.mutating.remove_copy_if.definition"></a></span><a class="link" href="remove_copy_if.html#range.reference.algorithms.mutating.remove_copy_if.definition">Definition</a>
           </h6>
 <p>
             Defined in the header file <code class="computeroutput"><span class="identifier">boost</span><span class="special">/</span><span class="identifier">range</span><span class="special">/</span><span class="identifier">algorithm</span><span class="special">/</span><span class="identifier">remove_copy_if</span><span class="special">.</span><span class="identifier">hpp</span></code>
           </p>
-<a name="range.reference.algorithms.mutating.remove_copy_if.requirements"></a><h6>
-<a name="id697124"></a>
-            <a class="link" href="remove_copy_if.html#range.reference.algorithms.mutating.remove_copy_if.requirements">Requirements</a>
+<h6>
+<a name="range.reference.algorithms.mutating.remove_copy_if.h3"></a>
+            <span><a name="range.reference.algorithms.mutating.remove_copy_if.requirements"></a></span><a class="link" href="remove_copy_if.html#range.reference.algorithms.mutating.remove_copy_if.requirements">Requirements</a>
           </h6>
 <div class="itemizedlist"><ul class="itemizedlist" type="disc">
 <li class="listitem">
@@ -78,9 +77,9 @@
                 of the <code class="computeroutput"><span class="identifier">UnaryPredicateConcept</span></code>.
               </li>
 </ul></div>
-<a name="range.reference.algorithms.mutating.remove_copy_if.complexity"></a><h6>
-<a name="id697217"></a>
-            <a class="link" href="remove_copy_if.html#range.reference.algorithms.mutating.remove_copy_if.complexity">Complexity</a>
+<h6>
+<a name="range.reference.algorithms.mutating.remove_copy_if.h4"></a>
+            <span><a name="range.reference.algorithms.mutating.remove_copy_if.complexity"></a></span><a class="link" href="remove_copy_if.html#range.reference.algorithms.mutating.remove_copy_if.complexity">Complexity</a>
           </h6>
 <p>
             Linear. <code class="computeroutput"><span class="identifier">remove_copy_if</span></code>
@@ -89,7 +88,8 @@
 </div>
 <table xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" width="100%"><tr>
 <td align="left"></td>
-<td align="right"><div class="copyright-footer">Copyright &#169; 2003 -2010 Thorsten Ottosen, Neil Groves<p>
+<td align="right"><div class="copyright-footer">Copyright &#169; 2003-2010 Thorsten Ottosen,
+      Neil Groves<p>
         Distributed under the Boost Software License, Version 1.0. (See accompanying
         file LICENSE_1_0.txt or copy at <a href="http://www.boost.org/LICENSE_1_0.txt" target="_top">http://www.boost.org/LICENSE_1_0.txt</a>)
       </p>
diff --git a/doc/html/range/reference/algorithms/mutating/remove_if.html b/doc/html/range/reference/algorithms/mutating/remove_if.html
index 59aebc2..788816e 100644
--- a/doc/html/range/reference/algorithms/mutating/remove_if.html
+++ b/doc/html/range/reference/algorithms/mutating/remove_if.html
@@ -22,16 +22,15 @@
 <div class="spirit-nav">
 <a accesskey="p" href="remove_copy_if.html"><img src="../../../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../mutating.html"><img src="../../../../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../../../../index.html"><img src="../../../../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="replace.html"><img src="../../../../../../../../doc/src/images/next.png" alt="Next"></a>
 </div>
-<div class="section">
+<div class="section range_reference_algorithms_mutating_remove_if">
 <div class="titlepage"><div><div><h5 class="title">
 <a name="range.reference.algorithms.mutating.remove_if"></a><a class="link" href="remove_if.html" title="remove_if">remove_if</a>
 </h5></div></div></div>
-<a name="range.reference.algorithms.mutating.remove_if.prototype"></a><h6>
-<a name="id697291"></a>
-            <a class="link" href="remove_if.html#range.reference.algorithms.mutating.remove_if.prototype">Prototype</a>
+<h6>
+<a name="range.reference.algorithms.mutating.remove_if.h0"></a>
+            <span><a name="range.reference.algorithms.mutating.remove_if.prototype"></a></span><a class="link" href="remove_if.html#range.reference.algorithms.mutating.remove_if.prototype">Prototype</a>
           </h6>
 <p>
-            
 </p>
 <pre class="programlisting"><span class="keyword">template</span><span class="special">&lt;</span>
     <span class="keyword">class</span> <span class="identifier">ForwardRange</span><span class="special">,</span>
@@ -65,9 +64,9 @@
 </pre>
 <p>
           </p>
-<a name="range.reference.algorithms.mutating.remove_if.description"></a><h6>
-<a name="id697867"></a>
-            <a class="link" href="remove_if.html#range.reference.algorithms.mutating.remove_if.description">Description</a>
+<h6>
+<a name="range.reference.algorithms.mutating.remove_if.h1"></a>
+            <span><a name="range.reference.algorithms.mutating.remove_if.description"></a></span><a class="link" href="remove_if.html#range.reference.algorithms.mutating.remove_if.description">Description</a>
           </h6>
 <p>
             <code class="computeroutput"><span class="identifier">remove_if</span></code> removes from
@@ -81,16 +80,16 @@
             the range <code class="computeroutput"><span class="special">[</span><span class="identifier">new_last</span><span class="special">,</span> <span class="identifier">end</span><span class="special">(</span><span class="identifier">rng</span><span class="special">))</span></code> are dereferenceable, but the elements
             are unspecified.
           </p>
-<a name="range.reference.algorithms.mutating.remove_if.definition"></a><h6>
-<a name="id698089"></a>
-            <a class="link" href="remove_if.html#range.reference.algorithms.mutating.remove_if.definition">Definition</a>
+<h6>
+<a name="range.reference.algorithms.mutating.remove_if.h2"></a>
+            <span><a name="range.reference.algorithms.mutating.remove_if.definition"></a></span><a class="link" href="remove_if.html#range.reference.algorithms.mutating.remove_if.definition">Definition</a>
           </h6>
 <p>
             Defined in the header file <code class="computeroutput"><span class="identifier">boost</span><span class="special">/</span><span class="identifier">range</span><span class="special">/</span><span class="identifier">algorithm</span><span class="special">/</span><span class="identifier">remove_if</span><span class="special">.</span><span class="identifier">hpp</span></code>
           </p>
-<a name="range.reference.algorithms.mutating.remove_if.requirements"></a><h6>
-<a name="id698160"></a>
-            <a class="link" href="remove_if.html#range.reference.algorithms.mutating.remove_if.requirements">Requirements</a>
+<h6>
+<a name="range.reference.algorithms.mutating.remove_if.h3"></a>
+            <span><a name="range.reference.algorithms.mutating.remove_if.requirements"></a></span><a class="link" href="remove_if.html#range.reference.algorithms.mutating.remove_if.requirements">Requirements</a>
           </h6>
 <div class="itemizedlist"><ul class="itemizedlist" type="disc">
 <li class="listitem">
@@ -111,9 +110,9 @@
                 argument type.
               </li>
 </ul></div>
-<a name="range.reference.algorithms.mutating.remove_if.complexity"></a><h6>
-<a name="id698282"></a>
-            <a class="link" href="remove_if.html#range.reference.algorithms.mutating.remove_if.complexity">Complexity</a>
+<h6>
+<a name="range.reference.algorithms.mutating.remove_if.h4"></a>
+            <span><a name="range.reference.algorithms.mutating.remove_if.complexity"></a></span><a class="link" href="remove_if.html#range.reference.algorithms.mutating.remove_if.complexity">Complexity</a>
           </h6>
 <p>
             Linear. <code class="computeroutput"><span class="identifier">remove_if</span></code> performs
@@ -123,7 +122,8 @@
 </div>
 <table xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" width="100%"><tr>
 <td align="left"></td>
-<td align="right"><div class="copyright-footer">Copyright &#169; 2003 -2010 Thorsten Ottosen, Neil Groves<p>
+<td align="right"><div class="copyright-footer">Copyright &#169; 2003-2010 Thorsten Ottosen,
+      Neil Groves<p>
         Distributed under the Boost Software License, Version 1.0. (See accompanying
         file LICENSE_1_0.txt or copy at <a href="http://www.boost.org/LICENSE_1_0.txt" target="_top">http://www.boost.org/LICENSE_1_0.txt</a>)
       </p>
diff --git a/doc/html/range/reference/algorithms/mutating/replace.html b/doc/html/range/reference/algorithms/mutating/replace.html
index b392c50..275c029 100644
--- a/doc/html/range/reference/algorithms/mutating/replace.html
+++ b/doc/html/range/reference/algorithms/mutating/replace.html
@@ -22,16 +22,15 @@
 <div class="spirit-nav">
 <a accesskey="p" href="remove_if.html"><img src="../../../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../mutating.html"><img src="../../../../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../../../../index.html"><img src="../../../../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="replace_copy.html"><img src="../../../../../../../../doc/src/images/next.png" alt="Next"></a>
 </div>
-<div class="section">
+<div class="section range_reference_algorithms_mutating_replace">
 <div class="titlepage"><div><div><h5 class="title">
 <a name="range.reference.algorithms.mutating.replace"></a><a class="link" href="replace.html" title="replace">replace</a>
 </h5></div></div></div>
-<a name="range.reference.algorithms.mutating.replace.prototype"></a><h6>
-<a name="id698368"></a>
-            <a class="link" href="replace.html#range.reference.algorithms.mutating.replace.prototype">Prototype</a>
+<h6>
+<a name="range.reference.algorithms.mutating.replace.h0"></a>
+            <span><a name="range.reference.algorithms.mutating.replace.prototype"></a></span><a class="link" href="replace.html#range.reference.algorithms.mutating.replace.prototype">Prototype</a>
           </h6>
 <p>
-            
 </p>
 <pre class="programlisting"><span class="keyword">template</span><span class="special">&lt;</span>
     <span class="keyword">class</span> <span class="identifier">ForwardRange</span><span class="special">,</span>
@@ -47,25 +46,25 @@
 </pre>
 <p>
           </p>
-<a name="range.reference.algorithms.mutating.replace.description"></a><h6>
-<a name="id698680"></a>
-            <a class="link" href="replace.html#range.reference.algorithms.mutating.replace.description">Description</a>
+<h6>
+<a name="range.reference.algorithms.mutating.replace.h1"></a>
+            <span><a name="range.reference.algorithms.mutating.replace.description"></a></span><a class="link" href="replace.html#range.reference.algorithms.mutating.replace.description">Description</a>
           </h6>
 <p>
             <code class="computeroutput"><span class="identifier">replace</span></code> every element
             in <code class="computeroutput"><span class="identifier">rng</span></code> equal to <code class="computeroutput"><span class="identifier">what</span></code> with <code class="computeroutput"><span class="identifier">with_what</span></code>.
             Return a reference to <code class="computeroutput"><span class="identifier">rng</span></code>.
           </p>
-<a name="range.reference.algorithms.mutating.replace.definition"></a><h6>
-<a name="id698755"></a>
-            <a class="link" href="replace.html#range.reference.algorithms.mutating.replace.definition">Definition</a>
+<h6>
+<a name="range.reference.algorithms.mutating.replace.h2"></a>
+            <span><a name="range.reference.algorithms.mutating.replace.definition"></a></span><a class="link" href="replace.html#range.reference.algorithms.mutating.replace.definition">Definition</a>
           </h6>
 <p>
             Defined in the header file <code class="computeroutput"><span class="identifier">boost</span><span class="special">/</span><span class="identifier">range</span><span class="special">/</span><span class="identifier">algorithm</span><span class="special">/</span><span class="identifier">replace</span><span class="special">.</span><span class="identifier">hpp</span></code>
           </p>
-<a name="range.reference.algorithms.mutating.replace.requirements"></a><h6>
-<a name="id698825"></a>
-            <a class="link" href="replace.html#range.reference.algorithms.mutating.replace.requirements">Requirements</a>
+<h6>
+<a name="range.reference.algorithms.mutating.replace.h3"></a>
+            <span><a name="range.reference.algorithms.mutating.replace.requirements"></a></span><a class="link" href="replace.html#range.reference.algorithms.mutating.replace.requirements">Requirements</a>
           </h6>
 <div class="itemizedlist"><ul class="itemizedlist" type="disc">
 <li class="listitem">
@@ -92,9 +91,9 @@
                 value type.
               </li>
 </ul></div>
-<a name="range.reference.algorithms.mutating.replace.complexity"></a><h6>
-<a name="id698985"></a>
-            <a class="link" href="replace.html#range.reference.algorithms.mutating.replace.complexity">Complexity</a>
+<h6>
+<a name="range.reference.algorithms.mutating.replace.h4"></a>
+            <span><a name="range.reference.algorithms.mutating.replace.complexity"></a></span><a class="link" href="replace.html#range.reference.algorithms.mutating.replace.complexity">Complexity</a>
           </h6>
 <p>
             Linear. <code class="computeroutput"><span class="identifier">replace</span></code> performs
@@ -104,7 +103,8 @@
 </div>
 <table xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" width="100%"><tr>
 <td align="left"></td>
-<td align="right"><div class="copyright-footer">Copyright &#169; 2003 -2010 Thorsten Ottosen, Neil Groves<p>
+<td align="right"><div class="copyright-footer">Copyright &#169; 2003-2010 Thorsten Ottosen,
+      Neil Groves<p>
         Distributed under the Boost Software License, Version 1.0. (See accompanying
         file LICENSE_1_0.txt or copy at <a href="http://www.boost.org/LICENSE_1_0.txt" target="_top">http://www.boost.org/LICENSE_1_0.txt</a>)
       </p>
diff --git a/doc/html/range/reference/algorithms/mutating/replace_copy.html b/doc/html/range/reference/algorithms/mutating/replace_copy.html
index 1784235..cebad10 100644
--- a/doc/html/range/reference/algorithms/mutating/replace_copy.html
+++ b/doc/html/range/reference/algorithms/mutating/replace_copy.html
@@ -22,16 +22,15 @@
 <div class="spirit-nav">
 <a accesskey="p" href="replace.html"><img src="../../../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../mutating.html"><img src="../../../../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../../../../index.html"><img src="../../../../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="replace_copy_if.html"><img src="../../../../../../../../doc/src/images/next.png" alt="Next"></a>
 </div>
-<div class="section">
+<div class="section range_reference_algorithms_mutating_replace_copy">
 <div class="titlepage"><div><div><h5 class="title">
 <a name="range.reference.algorithms.mutating.replace_copy"></a><a class="link" href="replace_copy.html" title="replace_copy">replace_copy</a>
 </h5></div></div></div>
-<a name="range.reference.algorithms.mutating.replace_copy.prototype"></a><h6>
-<a name="id699084"></a>
-            <a class="link" href="replace_copy.html#range.reference.algorithms.mutating.replace_copy.prototype">Prototype</a>
+<h6>
+<a name="range.reference.algorithms.mutating.replace_copy.h0"></a>
+            <span><a name="range.reference.algorithms.mutating.replace_copy.prototype"></a></span><a class="link" href="replace_copy.html#range.reference.algorithms.mutating.replace_copy.prototype">Prototype</a>
           </h6>
 <p>
-            
 </p>
 <pre class="programlisting"><span class="keyword">template</span><span class="special">&lt;</span><span class="keyword">class</span> <span class="identifier">ForwardRange</span><span class="special">,</span> <span class="keyword">class</span> <span class="identifier">OutputIterator</span><span class="special">,</span> <span class="keyword">class</span> <span class="identifier">Value</span><span class="special">&gt;</span>
 <span class="identifier">OutputIterator</span> <span class="identifier">replace_copy</span><span class="special">(</span><span class="keyword">const</span> <span class="identifier">ForwardRange</span><span class="special">&amp;</span> <span class="identifier">rng</span><span class="special">,</span> <span class="identifier">OutputIterator</span> <span class="identifier">out</span><span class="special">,</span>
@@ -39,9 +38,9 @@
 </pre>
 <p>
           </p>
-<a name="range.reference.algorithms.mutating.replace_copy.description"></a><h6>
-<a name="id699279"></a>
-            <a class="link" href="replace_copy.html#range.reference.algorithms.mutating.replace_copy.description">Description</a>
+<h6>
+<a name="range.reference.algorithms.mutating.replace_copy.h1"></a>
+            <span><a name="range.reference.algorithms.mutating.replace_copy.description"></a></span><a class="link" href="replace_copy.html#range.reference.algorithms.mutating.replace_copy.description">Description</a>
           </h6>
 <p>
             <code class="computeroutput"><span class="identifier">replace_copy</span></code> copy every
@@ -52,16 +51,16 @@
             <span class="identifier">with_what</span> <span class="special">:</span>
             <span class="identifier">x</span></code>.
           </p>
-<a name="range.reference.algorithms.mutating.replace_copy.definition"></a><h6>
-<a name="id699388"></a>
-            <a class="link" href="replace_copy.html#range.reference.algorithms.mutating.replace_copy.definition">Definition</a>
+<h6>
+<a name="range.reference.algorithms.mutating.replace_copy.h2"></a>
+            <span><a name="range.reference.algorithms.mutating.replace_copy.definition"></a></span><a class="link" href="replace_copy.html#range.reference.algorithms.mutating.replace_copy.definition">Definition</a>
           </h6>
 <p>
             Defined in the header file <code class="computeroutput"><span class="identifier">boost</span><span class="special">/</span><span class="identifier">range</span><span class="special">/</span><span class="identifier">algorithm</span><span class="special">/</span><span class="identifier">replace_copy</span><span class="special">.</span><span class="identifier">hpp</span></code>
           </p>
-<a name="range.reference.algorithms.mutating.replace_copy.requirements"></a><h6>
-<a name="id699458"></a>
-            <a class="link" href="replace_copy.html#range.reference.algorithms.mutating.replace_copy.requirements">Requirements</a>
+<h6>
+<a name="range.reference.algorithms.mutating.replace_copy.h3"></a>
+            <span><a name="range.reference.algorithms.mutating.replace_copy.requirements"></a></span><a class="link" href="replace_copy.html#range.reference.algorithms.mutating.replace_copy.requirements">Requirements</a>
           </h6>
 <div class="itemizedlist"><ul class="itemizedlist" type="disc">
 <li class="listitem">
@@ -86,9 +85,9 @@
                 a model of the <code class="computeroutput"><span class="identifier">OutputIteratorConcept</span></code>.
               </li>
 </ul></div>
-<a name="range.reference.algorithms.mutating.replace_copy.complexity"></a><h6>
-<a name="id699606"></a>
-            <a class="link" href="replace_copy.html#range.reference.algorithms.mutating.replace_copy.complexity">Complexity</a>
+<h6>
+<a name="range.reference.algorithms.mutating.replace_copy.h4"></a>
+            <span><a name="range.reference.algorithms.mutating.replace_copy.complexity"></a></span><a class="link" href="replace_copy.html#range.reference.algorithms.mutating.replace_copy.complexity">Complexity</a>
           </h6>
 <p>
             Linear. <code class="computeroutput"><span class="identifier">replace_copy</span></code>
@@ -97,7 +96,8 @@
 </div>
 <table xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" width="100%"><tr>
 <td align="left"></td>
-<td align="right"><div class="copyright-footer">Copyright &#169; 2003 -2010 Thorsten Ottosen, Neil Groves<p>
+<td align="right"><div class="copyright-footer">Copyright &#169; 2003-2010 Thorsten Ottosen,
+      Neil Groves<p>
         Distributed under the Boost Software License, Version 1.0. (See accompanying
         file LICENSE_1_0.txt or copy at <a href="http://www.boost.org/LICENSE_1_0.txt" target="_top">http://www.boost.org/LICENSE_1_0.txt</a>)
       </p>
diff --git a/doc/html/range/reference/algorithms/mutating/replace_copy_if.html b/doc/html/range/reference/algorithms/mutating/replace_copy_if.html
index d4d3be2..e7526c6 100644
--- a/doc/html/range/reference/algorithms/mutating/replace_copy_if.html
+++ b/doc/html/range/reference/algorithms/mutating/replace_copy_if.html
@@ -22,16 +22,15 @@
 <div class="spirit-nav">
 <a accesskey="p" href="replace_copy.html"><img src="../../../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../mutating.html"><img src="../../../../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../../../../index.html"><img src="../../../../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="replace_if.html"><img src="../../../../../../../../doc/src/images/next.png" alt="Next"></a>
 </div>
-<div class="section">
+<div class="section range_reference_algorithms_mutating_replace_copy_if">
 <div class="titlepage"><div><div><h5 class="title">
 <a name="range.reference.algorithms.mutating.replace_copy_if"></a><a class="link" href="replace_copy_if.html" title="replace_copy_if">replace_copy_if</a>
 </h5></div></div></div>
-<a name="range.reference.algorithms.mutating.replace_copy_if.prototype"></a><h6>
-<a name="id699680"></a>
-            <a class="link" href="replace_copy_if.html#range.reference.algorithms.mutating.replace_copy_if.prototype">Prototype</a>
+<h6>
+<a name="range.reference.algorithms.mutating.replace_copy_if.h0"></a>
+            <span><a name="range.reference.algorithms.mutating.replace_copy_if.prototype"></a></span><a class="link" href="replace_copy_if.html#range.reference.algorithms.mutating.replace_copy_if.prototype">Prototype</a>
           </h6>
 <p>
-            
 </p>
 <pre class="programlisting"><span class="keyword">template</span><span class="special">&lt;</span><span class="keyword">class</span> <span class="identifier">ForwardRange</span><span class="special">,</span> <span class="keyword">class</span> <span class="identifier">OutputIterator</span><span class="special">,</span> <span class="keyword">class</span> <span class="identifier">UnaryPredicate</span><span class="special">,</span> <span class="keyword">class</span> <span class="identifier">Value</span><span class="special">&gt;</span>
 <span class="identifier">OutputIterator</span> <span class="identifier">replace_copy_if</span><span class="special">(</span><span class="keyword">const</span> <span class="identifier">ForwardRange</span><span class="special">&amp;</span> <span class="identifier">rng</span><span class="special">,</span> <span class="identifier">OutputIterator</span> <span class="identifier">out</span><span class="special">,</span>
@@ -39,9 +38,9 @@
 </pre>
 <p>
           </p>
-<a name="range.reference.algorithms.mutating.replace_copy_if.description"></a><h6>
-<a name="id699881"></a>
-            <a class="link" href="replace_copy_if.html#range.reference.algorithms.mutating.replace_copy_if.description">Description</a>
+<h6>
+<a name="range.reference.algorithms.mutating.replace_copy_if.h1"></a>
+            <span><a name="range.reference.algorithms.mutating.replace_copy_if.description"></a></span><a class="link" href="replace_copy_if.html#range.reference.algorithms.mutating.replace_copy_if.description">Description</a>
           </h6>
 <p>
             <code class="computeroutput"><span class="identifier">replace_copy_if</span></code> copy
@@ -50,16 +49,16 @@
             is <code class="computeroutput"><span class="identifier">pred</span><span class="special">(</span><span class="identifier">x</span><span class="special">)</span> <span class="special">?</span> <span class="identifier">with_what</span>
             <span class="special">:</span> <span class="identifier">x</span></code>.
           </p>
-<a name="range.reference.algorithms.mutating.replace_copy_if.definition"></a><h6>
-<a name="id699992"></a>
-            <a class="link" href="replace_copy_if.html#range.reference.algorithms.mutating.replace_copy_if.definition">Definition</a>
+<h6>
+<a name="range.reference.algorithms.mutating.replace_copy_if.h2"></a>
+            <span><a name="range.reference.algorithms.mutating.replace_copy_if.definition"></a></span><a class="link" href="replace_copy_if.html#range.reference.algorithms.mutating.replace_copy_if.definition">Definition</a>
           </h6>
 <p>
             Defined in the header file <code class="computeroutput"><span class="identifier">boost</span><span class="special">/</span><span class="identifier">range</span><span class="special">/</span><span class="identifier">algorithm</span><span class="special">/</span><span class="identifier">replace_copy_if</span><span class="special">.</span><span class="identifier">hpp</span></code>
           </p>
-<a name="range.reference.algorithms.mutating.replace_copy_if.requirements"></a><h6>
-<a name="id700063"></a>
-            <a class="link" href="replace_copy_if.html#range.reference.algorithms.mutating.replace_copy_if.requirements">Requirements</a>
+<h6>
+<a name="range.reference.algorithms.mutating.replace_copy_if.h3"></a>
+            <span><a name="range.reference.algorithms.mutating.replace_copy_if.requirements"></a></span><a class="link" href="replace_copy_if.html#range.reference.algorithms.mutating.replace_copy_if.requirements">Requirements</a>
           </h6>
 <div class="itemizedlist"><ul class="itemizedlist" type="disc">
 <li class="listitem">
@@ -88,9 +87,9 @@
                 a model of the <code class="computeroutput"><span class="identifier">UnaryPredicateConcept</span></code>.
               </li>
 </ul></div>
-<a name="range.reference.algorithms.mutating.replace_copy_if.complexity"></a><h6>
-<a name="id700239"></a>
-            <a class="link" href="replace_copy_if.html#range.reference.algorithms.mutating.replace_copy_if.complexity">Complexity</a>
+<h6>
+<a name="range.reference.algorithms.mutating.replace_copy_if.h4"></a>
+            <span><a name="range.reference.algorithms.mutating.replace_copy_if.complexity"></a></span><a class="link" href="replace_copy_if.html#range.reference.algorithms.mutating.replace_copy_if.complexity">Complexity</a>
           </h6>
 <p>
             Linear. <code class="computeroutput"><span class="identifier">replace_copy_if</span></code>
@@ -99,7 +98,8 @@
 </div>
 <table xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" width="100%"><tr>
 <td align="left"></td>
-<td align="right"><div class="copyright-footer">Copyright &#169; 2003 -2010 Thorsten Ottosen, Neil Groves<p>
+<td align="right"><div class="copyright-footer">Copyright &#169; 2003-2010 Thorsten Ottosen,
+      Neil Groves<p>
         Distributed under the Boost Software License, Version 1.0. (See accompanying
         file LICENSE_1_0.txt or copy at <a href="http://www.boost.org/LICENSE_1_0.txt" target="_top">http://www.boost.org/LICENSE_1_0.txt</a>)
       </p>
diff --git a/doc/html/range/reference/algorithms/mutating/replace_if.html b/doc/html/range/reference/algorithms/mutating/replace_if.html
index 1e6609b..0b09c1d 100644
--- a/doc/html/range/reference/algorithms/mutating/replace_if.html
+++ b/doc/html/range/reference/algorithms/mutating/replace_if.html
@@ -22,16 +22,15 @@
 <div class="spirit-nav">
 <a accesskey="p" href="replace_copy_if.html"><img src="../../../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../mutating.html"><img src="../../../../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../../../../index.html"><img src="../../../../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="reverse.html"><img src="../../../../../../../../doc/src/images/next.png" alt="Next"></a>
 </div>
-<div class="section">
+<div class="section range_reference_algorithms_mutating_replace_if">
 <div class="titlepage"><div><div><h5 class="title">
 <a name="range.reference.algorithms.mutating.replace_if"></a><a class="link" href="replace_if.html" title="replace_if">replace_if</a>
 </h5></div></div></div>
-<a name="range.reference.algorithms.mutating.replace_if.prototype"></a><h6>
-<a name="id700324"></a>
-            <a class="link" href="replace_if.html#range.reference.algorithms.mutating.replace_if.prototype">Prototype</a>
+<h6>
+<a name="range.reference.algorithms.mutating.replace_if.h0"></a>
+            <span><a name="range.reference.algorithms.mutating.replace_if.prototype"></a></span><a class="link" href="replace_if.html#range.reference.algorithms.mutating.replace_if.prototype">Prototype</a>
           </h6>
 <p>
-            
 </p>
 <pre class="programlisting"><span class="keyword">template</span><span class="special">&lt;</span><span class="keyword">class</span> <span class="identifier">ForwardRange</span><span class="special">,</span> <span class="keyword">class</span> <span class="identifier">UnaryPredicate</span><span class="special">,</span> <span class="keyword">class</span> <span class="identifier">Value</span><span class="special">&gt;</span>
 <span class="identifier">ForwardRange</span><span class="special">&amp;</span> <span class="identifier">replace_if</span><span class="special">(</span><span class="identifier">ForwardRange</span><span class="special">&amp;</span> <span class="identifier">rng</span><span class="special">,</span> <span class="identifier">UnaryPredicate</span> <span class="identifier">pred</span><span class="special">,</span> <span class="keyword">const</span> <span class="identifier">Value</span><span class="special">&amp;</span> <span class="identifier">with_what</span><span class="special">);</span>
@@ -41,25 +40,25 @@
 </pre>
 <p>
           </p>
-<a name="range.reference.algorithms.mutating.replace_if.description"></a><h6>
-<a name="id700643"></a>
-            <a class="link" href="replace_if.html#range.reference.algorithms.mutating.replace_if.description">Description</a>
+<h6>
+<a name="range.reference.algorithms.mutating.replace_if.h1"></a>
+            <span><a name="range.reference.algorithms.mutating.replace_if.description"></a></span><a class="link" href="replace_if.html#range.reference.algorithms.mutating.replace_if.description">Description</a>
           </h6>
 <p>
             <code class="computeroutput"><span class="identifier">replace_if</span></code> replaces every
             element <code class="computeroutput"><span class="identifier">x</span></code> in <code class="computeroutput"><span class="identifier">rng</span></code> for which <code class="computeroutput"><span class="identifier">pred</span><span class="special">(</span><span class="identifier">x</span><span class="special">)</span> <span class="special">==</span> <span class="keyword">true</span></code> with <code class="computeroutput"><span class="identifier">with_what</span></code>.
             Returns a reference to <code class="computeroutput"><span class="identifier">rng</span></code>.
           </p>
-<a name="range.reference.algorithms.mutating.replace_if.definition"></a><h6>
-<a name="id700754"></a>
-            <a class="link" href="replace_if.html#range.reference.algorithms.mutating.replace_if.definition">Definition</a>
+<h6>
+<a name="range.reference.algorithms.mutating.replace_if.h2"></a>
+            <span><a name="range.reference.algorithms.mutating.replace_if.definition"></a></span><a class="link" href="replace_if.html#range.reference.algorithms.mutating.replace_if.definition">Definition</a>
           </h6>
 <p>
             Defined in the header file <code class="computeroutput"><span class="identifier">boost</span><span class="special">/</span><span class="identifier">range</span><span class="special">/</span><span class="identifier">algorithm</span><span class="special">/</span><span class="identifier">replace_if</span><span class="special">.</span><span class="identifier">hpp</span></code>
           </p>
-<a name="range.reference.algorithms.mutating.replace_if.requirements"></a><h6>
-<a name="id700825"></a>
-            <a class="link" href="replace_if.html#range.reference.algorithms.mutating.replace_if.requirements">Requirements</a>
+<h6>
+<a name="range.reference.algorithms.mutating.replace_if.h3"></a>
+            <span><a name="range.reference.algorithms.mutating.replace_if.requirements"></a></span><a class="link" href="replace_if.html#range.reference.algorithms.mutating.replace_if.requirements">Requirements</a>
           </h6>
 <div class="itemizedlist"><ul class="itemizedlist" type="disc">
 <li class="listitem">
@@ -89,9 +88,9 @@
                 of the <code class="computeroutput"><span class="identifier">AssignableConcept</span></code>.
               </li>
 </ul></div>
-<a name="range.reference.algorithms.mutating.replace_if.complexity"></a><h6>
-<a name="id701001"></a>
-            <a class="link" href="replace_if.html#range.reference.algorithms.mutating.replace_if.complexity">Complexity</a>
+<h6>
+<a name="range.reference.algorithms.mutating.replace_if.h4"></a>
+            <span><a name="range.reference.algorithms.mutating.replace_if.complexity"></a></span><a class="link" href="replace_if.html#range.reference.algorithms.mutating.replace_if.complexity">Complexity</a>
           </h6>
 <p>
             Linear. <code class="computeroutput"><span class="identifier">replace_if</span></code> performs
@@ -102,7 +101,8 @@
 </div>
 <table xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" width="100%"><tr>
 <td align="left"></td>
-<td align="right"><div class="copyright-footer">Copyright &#169; 2003 -2010 Thorsten Ottosen, Neil Groves<p>
+<td align="right"><div class="copyright-footer">Copyright &#169; 2003-2010 Thorsten Ottosen,
+      Neil Groves<p>
         Distributed under the Boost Software License, Version 1.0. (See accompanying
         file LICENSE_1_0.txt or copy at <a href="http://www.boost.org/LICENSE_1_0.txt" target="_top">http://www.boost.org/LICENSE_1_0.txt</a>)
       </p>
diff --git a/doc/html/range/reference/algorithms/mutating/reverse.html b/doc/html/range/reference/algorithms/mutating/reverse.html
index 6907fe5..e02adeb 100644
--- a/doc/html/range/reference/algorithms/mutating/reverse.html
+++ b/doc/html/range/reference/algorithms/mutating/reverse.html
@@ -22,16 +22,15 @@
 <div class="spirit-nav">
 <a accesskey="p" href="replace_if.html"><img src="../../../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../mutating.html"><img src="../../../../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../../../../index.html"><img src="../../../../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="reverse_copy.html"><img src="../../../../../../../../doc/src/images/next.png" alt="Next"></a>
 </div>
-<div class="section">
+<div class="section range_reference_algorithms_mutating_reverse">
 <div class="titlepage"><div><div><h5 class="title">
 <a name="range.reference.algorithms.mutating.reverse"></a><a class="link" href="reverse.html" title="reverse">reverse</a>
 </h5></div></div></div>
-<a name="range.reference.algorithms.mutating.reverse.prototype"></a><h6>
-<a name="id701111"></a>
-            <a class="link" href="reverse.html#range.reference.algorithms.mutating.reverse.prototype">Prototype</a>
+<h6>
+<a name="range.reference.algorithms.mutating.reverse.h0"></a>
+            <span><a name="range.reference.algorithms.mutating.reverse.prototype"></a></span><a class="link" href="reverse.html#range.reference.algorithms.mutating.reverse.prototype">Prototype</a>
           </h6>
 <p>
-            
 </p>
 <pre class="programlisting"><span class="keyword">template</span><span class="special">&lt;</span><span class="keyword">class</span> <span class="identifier">BidirectionalRange</span><span class="special">&gt;</span>
 <span class="identifier">BidirectionalRange</span><span class="special">&amp;</span> <span class="identifier">reverse</span><span class="special">(</span><span class="identifier">BidirectionalRange</span><span class="special">&amp;</span> <span class="identifier">rng</span><span class="special">);</span>
@@ -41,24 +40,24 @@
 </pre>
 <p>
           </p>
-<a name="range.reference.algorithms.mutating.reverse.description"></a><h6>
-<a name="id701281"></a>
-            <a class="link" href="reverse.html#range.reference.algorithms.mutating.reverse.description">Description</a>
+<h6>
+<a name="range.reference.algorithms.mutating.reverse.h1"></a>
+            <span><a name="range.reference.algorithms.mutating.reverse.description"></a></span><a class="link" href="reverse.html#range.reference.algorithms.mutating.reverse.description">Description</a>
           </h6>
 <p>
             <code class="computeroutput"><span class="identifier">reverse</span></code> reverses a range.
             Returns a reference to the reversed range.
           </p>
-<a name="range.reference.algorithms.mutating.reverse.definition"></a><h6>
-<a name="id701314"></a>
-            <a class="link" href="reverse.html#range.reference.algorithms.mutating.reverse.definition">Definition</a>
+<h6>
+<a name="range.reference.algorithms.mutating.reverse.h2"></a>
+            <span><a name="range.reference.algorithms.mutating.reverse.definition"></a></span><a class="link" href="reverse.html#range.reference.algorithms.mutating.reverse.definition">Definition</a>
           </h6>
 <p>
             Defined in the header file <code class="computeroutput"><span class="identifier">boost</span><span class="special">/</span><span class="identifier">range</span><span class="special">/</span><span class="identifier">algorithm</span><span class="special">/</span><span class="identifier">reverse</span><span class="special">.</span><span class="identifier">hpp</span></code>
           </p>
-<a name="range.reference.algorithms.mutating.reverse.requirements"></a><h6>
-<a name="id701385"></a>
-            <a class="link" href="reverse.html#range.reference.algorithms.mutating.reverse.requirements">Requirements</a>
+<h6>
+<a name="range.reference.algorithms.mutating.reverse.h3"></a>
+            <span><a name="range.reference.algorithms.mutating.reverse.requirements"></a></span><a class="link" href="reverse.html#range.reference.algorithms.mutating.reverse.requirements">Requirements</a>
           </h6>
 <div class="itemizedlist"><ul class="itemizedlist" type="disc">
 <li class="listitem">
@@ -71,9 +70,9 @@
                 is mutable.
               </li>
 </ul></div>
-<a name="range.reference.algorithms.mutating.reverse.complexity"></a><h6>
-<a name="id701451"></a>
-            <a class="link" href="reverse.html#range.reference.algorithms.mutating.reverse.complexity">Complexity</a>
+<h6>
+<a name="range.reference.algorithms.mutating.reverse.h4"></a>
+            <span><a name="range.reference.algorithms.mutating.reverse.complexity"></a></span><a class="link" href="reverse.html#range.reference.algorithms.mutating.reverse.complexity">Complexity</a>
           </h6>
 <p>
             Linear. <code class="computeroutput"><span class="identifier">reverse</span></code> makes
@@ -82,7 +81,8 @@
 </div>
 <table xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" width="100%"><tr>
 <td align="left"></td>
-<td align="right"><div class="copyright-footer">Copyright &#169; 2003 -2010 Thorsten Ottosen, Neil Groves<p>
+<td align="right"><div class="copyright-footer">Copyright &#169; 2003-2010 Thorsten Ottosen,
+      Neil Groves<p>
         Distributed under the Boost Software License, Version 1.0. (See accompanying
         file LICENSE_1_0.txt or copy at <a href="http://www.boost.org/LICENSE_1_0.txt" target="_top">http://www.boost.org/LICENSE_1_0.txt</a>)
       </p>
diff --git a/doc/html/range/reference/algorithms/mutating/reverse_copy.html b/doc/html/range/reference/algorithms/mutating/reverse_copy.html
index b0c9624..15cacf1 100644
--- a/doc/html/range/reference/algorithms/mutating/reverse_copy.html
+++ b/doc/html/range/reference/algorithms/mutating/reverse_copy.html
@@ -22,25 +22,24 @@
 <div class="spirit-nav">
 <a accesskey="p" href="reverse.html"><img src="../../../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../mutating.html"><img src="../../../../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../../../../index.html"><img src="../../../../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="rotate.html"><img src="../../../../../../../../doc/src/images/next.png" alt="Next"></a>
 </div>
-<div class="section">
+<div class="section range_reference_algorithms_mutating_reverse_copy">
 <div class="titlepage"><div><div><h5 class="title">
 <a name="range.reference.algorithms.mutating.reverse_copy"></a><a class="link" href="reverse_copy.html" title="reverse_copy">reverse_copy</a>
 </h5></div></div></div>
-<a name="range.reference.algorithms.mutating.reverse_copy.prototype"></a><h6>
-<a name="id701540"></a>
-            <a class="link" href="reverse_copy.html#range.reference.algorithms.mutating.reverse_copy.prototype">Prototype</a>
+<h6>
+<a name="range.reference.algorithms.mutating.reverse_copy.h0"></a>
+            <span><a name="range.reference.algorithms.mutating.reverse_copy.prototype"></a></span><a class="link" href="reverse_copy.html#range.reference.algorithms.mutating.reverse_copy.prototype">Prototype</a>
           </h6>
 <p>
-            
 </p>
 <pre class="programlisting"><span class="keyword">template</span><span class="special">&lt;</span><span class="keyword">class</span> <span class="identifier">BidirectionalRange</span><span class="special">,</span> <span class="keyword">class</span> <span class="identifier">OutputIterator</span><span class="special">&gt;</span>
 <span class="identifier">OutputIterator</span> <span class="identifier">reverse_copy</span><span class="special">(</span><span class="keyword">const</span> <span class="identifier">BidirectionalRange</span><span class="special">&amp;</span> <span class="identifier">rng</span><span class="special">,</span> <span class="identifier">OutputIterator</span> <span class="identifier">out</span><span class="special">);</span>
 </pre>
 <p>
           </p>
-<a name="range.reference.algorithms.mutating.reverse_copy.description"></a><h6>
-<a name="id701667"></a>
-            <a class="link" href="reverse_copy.html#range.reference.algorithms.mutating.reverse_copy.description">Description</a>
+<h6>
+<a name="range.reference.algorithms.mutating.reverse_copy.h1"></a>
+            <span><a name="range.reference.algorithms.mutating.reverse_copy.description"></a></span><a class="link" href="reverse_copy.html#range.reference.algorithms.mutating.reverse_copy.description">Description</a>
           </h6>
 <p>
             <code class="computeroutput"><span class="identifier">reverse_copy</span></code> copies the
@@ -48,16 +47,16 @@
             reverse order to <code class="computeroutput"><span class="identifier">out</span></code>.
             Returns the output iterator one passed the last copied element.
           </p>
-<a name="range.reference.algorithms.mutating.reverse_copy.definition"></a><h6>
-<a name="id701723"></a>
-            <a class="link" href="reverse_copy.html#range.reference.algorithms.mutating.reverse_copy.definition">Definition</a>
+<h6>
+<a name="range.reference.algorithms.mutating.reverse_copy.h2"></a>
+            <span><a name="range.reference.algorithms.mutating.reverse_copy.definition"></a></span><a class="link" href="reverse_copy.html#range.reference.algorithms.mutating.reverse_copy.definition">Definition</a>
           </h6>
 <p>
             Defined in the header file <code class="computeroutput"><span class="identifier">boost</span><span class="special">/</span><span class="identifier">range</span><span class="special">/</span><span class="identifier">algorithm</span><span class="special">/</span><span class="identifier">reverse_copy</span><span class="special">.</span><span class="identifier">hpp</span></code>
           </p>
-<a name="range.reference.algorithms.mutating.reverse_copy.requirements"></a><h6>
-<a name="id701792"></a>
-            <a class="link" href="reverse_copy.html#range.reference.algorithms.mutating.reverse_copy.requirements">Requirements</a>
+<h6>
+<a name="range.reference.algorithms.mutating.reverse_copy.h3"></a>
+            <span><a name="range.reference.algorithms.mutating.reverse_copy.requirements"></a></span><a class="link" href="reverse_copy.html#range.reference.algorithms.mutating.reverse_copy.requirements">Requirements</a>
           </h6>
 <div class="itemizedlist"><ul class="itemizedlist" type="disc">
 <li class="listitem">
@@ -74,9 +73,9 @@
                 a model of the <code class="computeroutput"><span class="identifier">OutputIteratorConcept</span></code>.
               </li>
 </ul></div>
-<a name="range.reference.algorithms.mutating.reverse_copy.complexity"></a><h6>
-<a name="id701885"></a>
-            <a class="link" href="reverse_copy.html#range.reference.algorithms.mutating.reverse_copy.complexity">Complexity</a>
+<h6>
+<a name="range.reference.algorithms.mutating.reverse_copy.h4"></a>
+            <span><a name="range.reference.algorithms.mutating.reverse_copy.complexity"></a></span><a class="link" href="reverse_copy.html#range.reference.algorithms.mutating.reverse_copy.complexity">Complexity</a>
           </h6>
 <p>
             Linear. <code class="computeroutput"><span class="identifier">reverse_copy</span></code>
@@ -86,7 +85,8 @@
 </div>
 <table xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" width="100%"><tr>
 <td align="left"></td>
-<td align="right"><div class="copyright-footer">Copyright &#169; 2003 -2010 Thorsten Ottosen, Neil Groves<p>
+<td align="right"><div class="copyright-footer">Copyright &#169; 2003-2010 Thorsten Ottosen,
+      Neil Groves<p>
         Distributed under the Boost Software License, Version 1.0. (See accompanying
         file LICENSE_1_0.txt or copy at <a href="http://www.boost.org/LICENSE_1_0.txt" target="_top">http://www.boost.org/LICENSE_1_0.txt</a>)
       </p>
diff --git a/doc/html/range/reference/algorithms/mutating/rotate.html b/doc/html/range/reference/algorithms/mutating/rotate.html
index de9388a..14e43e0 100644
--- a/doc/html/range/reference/algorithms/mutating/rotate.html
+++ b/doc/html/range/reference/algorithms/mutating/rotate.html
@@ -22,16 +22,15 @@
 <div class="spirit-nav">
 <a accesskey="p" href="reverse_copy.html"><img src="../../../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../mutating.html"><img src="../../../../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../../../../index.html"><img src="../../../../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="rotate_copy.html"><img src="../../../../../../../../doc/src/images/next.png" alt="Next"></a>
 </div>
-<div class="section">
+<div class="section range_reference_algorithms_mutating_rotate">
 <div class="titlepage"><div><div><h5 class="title">
 <a name="range.reference.algorithms.mutating.rotate"></a><a class="link" href="rotate.html" title="rotate">rotate</a>
 </h5></div></div></div>
-<a name="range.reference.algorithms.mutating.rotate.prototype"></a><h6>
-<a name="id701961"></a>
-            <a class="link" href="rotate.html#range.reference.algorithms.mutating.rotate.prototype">Prototype</a>
+<h6>
+<a name="range.reference.algorithms.mutating.rotate.h0"></a>
+            <span><a name="range.reference.algorithms.mutating.rotate.prototype"></a></span><a class="link" href="rotate.html#range.reference.algorithms.mutating.rotate.prototype">Prototype</a>
           </h6>
 <p>
-            
 </p>
 <pre class="programlisting"><span class="keyword">template</span><span class="special">&lt;</span><span class="keyword">class</span> <span class="identifier">ForwardRange</span><span class="special">&gt;</span>
 <span class="identifier">ForwardRange</span><span class="special">&amp;</span> <span class="identifier">rotate</span><span class="special">(</span><span class="identifier">ForwardRange</span><span class="special">&amp;</span> <span class="identifier">rng</span><span class="special">,</span>
@@ -43,25 +42,25 @@
 </pre>
 <p>
           </p>
-<a name="range.reference.algorithms.mutating.rotate.description"></a><h6>
-<a name="id702217"></a>
-            <a class="link" href="rotate.html#range.reference.algorithms.mutating.rotate.description">Description</a>
+<h6>
+<a name="range.reference.algorithms.mutating.rotate.h1"></a>
+            <span><a name="range.reference.algorithms.mutating.rotate.description"></a></span><a class="link" href="rotate.html#range.reference.algorithms.mutating.rotate.description">Description</a>
           </h6>
 <p>
             <code class="computeroutput"><span class="identifier">rotate</span></code> rotates the elements
             in a range. It exchanges the two ranges <code class="computeroutput"><span class="special">[</span><span class="identifier">begin</span><span class="special">(</span><span class="identifier">rng</span><span class="special">),</span> <span class="identifier">middle</span><span class="special">)</span></code>
             and <code class="computeroutput"><span class="special">[</span><span class="identifier">middle</span><span class="special">,</span> <span class="identifier">end</span><span class="special">(</span><span class="identifier">rng</span><span class="special">))</span></code>. Returns a reference to <code class="computeroutput"><span class="identifier">rng</span></code>.
           </p>
-<a name="range.reference.algorithms.mutating.rotate.definition"></a><h6>
-<a name="id702338"></a>
-            <a class="link" href="rotate.html#range.reference.algorithms.mutating.rotate.definition">Definition</a>
+<h6>
+<a name="range.reference.algorithms.mutating.rotate.h2"></a>
+            <span><a name="range.reference.algorithms.mutating.rotate.definition"></a></span><a class="link" href="rotate.html#range.reference.algorithms.mutating.rotate.definition">Definition</a>
           </h6>
 <p>
             Defined in the header file <code class="computeroutput"><span class="identifier">boost</span><span class="special">/</span><span class="identifier">range</span><span class="special">/</span><span class="identifier">algorithm</span><span class="special">/</span><span class="identifier">rotate</span><span class="special">.</span><span class="identifier">hpp</span></code>
           </p>
-<a name="range.reference.algorithms.mutating.rotate.requirements"></a><h6>
-<a name="id702407"></a>
-            <a class="link" href="rotate.html#range.reference.algorithms.mutating.rotate.requirements">Requirements</a>
+<h6>
+<a name="range.reference.algorithms.mutating.rotate.h3"></a>
+            <span><a name="range.reference.algorithms.mutating.rotate.requirements"></a></span><a class="link" href="rotate.html#range.reference.algorithms.mutating.rotate.requirements">Requirements</a>
           </h6>
 <div class="itemizedlist"><ul class="itemizedlist" type="disc">
 <li class="listitem">
@@ -73,9 +72,9 @@
                 <code class="computeroutput"><span class="identifier">ForwardRange</span></code> is mutable.
               </li>
 </ul></div>
-<a name="range.reference.algorithms.mutating.rotate.precondition_"></a><h6>
-<a name="id702473"></a>
-            <a class="link" href="rotate.html#range.reference.algorithms.mutating.rotate.precondition_">Precondition:</a>
+<h6>
+<a name="range.reference.algorithms.mutating.rotate.h4"></a>
+            <span><a name="range.reference.algorithms.mutating.rotate.precondition_"></a></span><a class="link" href="rotate.html#range.reference.algorithms.mutating.rotate.precondition_">Precondition:</a>
           </h6>
 <div class="itemizedlist"><ul class="itemizedlist" type="disc">
 <li class="listitem">
@@ -85,9 +84,9 @@
                 <code class="computeroutput"><span class="special">[</span><span class="identifier">middle</span><span class="special">,</span> <span class="identifier">end</span><span class="special">(</span><span class="identifier">rng</span><span class="special">))</span></code> is a valid range.
               </li>
 </ul></div>
-<a name="range.reference.algorithms.mutating.rotate.complexity"></a><h6>
-<a name="id702586"></a>
-            <a class="link" href="rotate.html#range.reference.algorithms.mutating.rotate.complexity">Complexity</a>
+<h6>
+<a name="range.reference.algorithms.mutating.rotate.h5"></a>
+            <span><a name="range.reference.algorithms.mutating.rotate.complexity"></a></span><a class="link" href="rotate.html#range.reference.algorithms.mutating.rotate.complexity">Complexity</a>
           </h6>
 <p>
             Linear. At most <code class="computeroutput"><span class="identifier">distance</span><span class="special">(</span><span class="identifier">rng</span><span class="special">)</span></code> swaps are performed.
@@ -95,7 +94,8 @@
 </div>
 <table xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" width="100%"><tr>
 <td align="left"></td>
-<td align="right"><div class="copyright-footer">Copyright &#169; 2003 -2010 Thorsten Ottosen, Neil Groves<p>
+<td align="right"><div class="copyright-footer">Copyright &#169; 2003-2010 Thorsten Ottosen,
+      Neil Groves<p>
         Distributed under the Boost Software License, Version 1.0. (See accompanying
         file LICENSE_1_0.txt or copy at <a href="http://www.boost.org/LICENSE_1_0.txt" target="_top">http://www.boost.org/LICENSE_1_0.txt</a>)
       </p>
diff --git a/doc/html/range/reference/algorithms/mutating/rotate_copy.html b/doc/html/range/reference/algorithms/mutating/rotate_copy.html
index fbecb94..95ff474 100644
--- a/doc/html/range/reference/algorithms/mutating/rotate_copy.html
+++ b/doc/html/range/reference/algorithms/mutating/rotate_copy.html
@@ -22,16 +22,15 @@
 <div class="spirit-nav">
 <a accesskey="p" href="rotate.html"><img src="../../../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../mutating.html"><img src="../../../../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../../../../index.html"><img src="../../../../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="sort.html"><img src="../../../../../../../../doc/src/images/next.png" alt="Next"></a>
 </div>
-<div class="section">
+<div class="section range_reference_algorithms_mutating_rotate_copy">
 <div class="titlepage"><div><div><h5 class="title">
 <a name="range.reference.algorithms.mutating.rotate_copy"></a><a class="link" href="rotate_copy.html" title="rotate_copy">rotate_copy</a>
 </h5></div></div></div>
-<a name="range.reference.algorithms.mutating.rotate_copy.prototype"></a><h6>
-<a name="id702649"></a>
-            <a class="link" href="rotate_copy.html#range.reference.algorithms.mutating.rotate_copy.prototype">Prototype</a>
+<h6>
+<a name="range.reference.algorithms.mutating.rotate_copy.h0"></a>
+            <span><a name="range.reference.algorithms.mutating.rotate_copy.prototype"></a></span><a class="link" href="rotate_copy.html#range.reference.algorithms.mutating.rotate_copy.prototype">Prototype</a>
           </h6>
 <p>
-            
 </p>
 <pre class="programlisting"><span class="keyword">template</span><span class="special">&lt;</span><span class="keyword">class</span> <span class="identifier">ForwardRange</span><span class="special">,</span> <span class="keyword">class</span> <span class="identifier">OutputIterator</span><span class="special">&gt;</span>
 <span class="identifier">OutputIterator</span> <span class="identifier">rotate_copy</span><span class="special">(</span>
@@ -41,25 +40,25 @@
 </pre>
 <p>
           </p>
-<a name="range.reference.algorithms.mutating.rotate_copy.description"></a><h6>
-<a name="id702817"></a>
-            <a class="link" href="rotate_copy.html#range.reference.algorithms.mutating.rotate_copy.description">Description</a>
+<h6>
+<a name="range.reference.algorithms.mutating.rotate_copy.h1"></a>
+            <span><a name="range.reference.algorithms.mutating.rotate_copy.description"></a></span><a class="link" href="rotate_copy.html#range.reference.algorithms.mutating.rotate_copy.description">Description</a>
           </h6>
 <p>
             <code class="computeroutput"><span class="identifier">rotate_copy</span></code> rotates the
             elements in a range. It copies the two ranges <code class="computeroutput"><span class="special">[</span><span class="identifier">begin</span><span class="special">(</span><span class="identifier">rng</span><span class="special">),</span> <span class="identifier">middle</span><span class="special">)</span></code>
             and <code class="computeroutput"><span class="special">[</span><span class="identifier">middle</span><span class="special">,</span> <span class="identifier">end</span><span class="special">(</span><span class="identifier">rng</span><span class="special">))</span></code> to <code class="computeroutput"><span class="identifier">out</span></code>.
           </p>
-<a name="range.reference.algorithms.mutating.rotate_copy.definition"></a><h6>
-<a name="id702938"></a>
-            <a class="link" href="rotate_copy.html#range.reference.algorithms.mutating.rotate_copy.definition">Definition</a>
+<h6>
+<a name="range.reference.algorithms.mutating.rotate_copy.h2"></a>
+            <span><a name="range.reference.algorithms.mutating.rotate_copy.definition"></a></span><a class="link" href="rotate_copy.html#range.reference.algorithms.mutating.rotate_copy.definition">Definition</a>
           </h6>
 <p>
             Defined in the header file <code class="computeroutput"><span class="identifier">boost</span><span class="special">/</span><span class="identifier">range</span><span class="special">/</span><span class="identifier">algorithm</span><span class="special">/</span><span class="identifier">rotate_copy</span><span class="special">.</span><span class="identifier">hpp</span></code>
           </p>
-<a name="range.reference.algorithms.mutating.rotate_copy.requirements"></a><h6>
-<a name="id703007"></a>
-            <a class="link" href="rotate_copy.html#range.reference.algorithms.mutating.rotate_copy.requirements">Requirements</a>
+<h6>
+<a name="range.reference.algorithms.mutating.rotate_copy.h3"></a>
+            <span><a name="range.reference.algorithms.mutating.rotate_copy.requirements"></a></span><a class="link" href="rotate_copy.html#range.reference.algorithms.mutating.rotate_copy.requirements">Requirements</a>
           </h6>
 <div class="itemizedlist"><ul class="itemizedlist" type="disc">
 <li class="listitem">
@@ -75,9 +74,9 @@
                 a model of the <code class="computeroutput"><span class="identifier">OutputIteratorConcept</span></code>.
               </li>
 </ul></div>
-<a name="range.reference.algorithms.mutating.rotate_copy.precondition_"></a><h6>
-<a name="id703100"></a>
-            <a class="link" href="rotate_copy.html#range.reference.algorithms.mutating.rotate_copy.precondition_">Precondition:</a>
+<h6>
+<a name="range.reference.algorithms.mutating.rotate_copy.h4"></a>
+            <span><a name="range.reference.algorithms.mutating.rotate_copy.precondition_"></a></span><a class="link" href="rotate_copy.html#range.reference.algorithms.mutating.rotate_copy.precondition_">Precondition:</a>
           </h6>
 <div class="itemizedlist"><ul class="itemizedlist" type="disc">
 <li class="listitem">
@@ -87,9 +86,9 @@
                 <code class="computeroutput"><span class="special">[</span><span class="identifier">middle</span><span class="special">,</span> <span class="identifier">end</span><span class="special">(</span><span class="identifier">rng</span><span class="special">))</span></code> is a valid range.
               </li>
 </ul></div>
-<a name="range.reference.algorithms.mutating.rotate_copy.complexity"></a><h6>
-<a name="id703212"></a>
-            <a class="link" href="rotate_copy.html#range.reference.algorithms.mutating.rotate_copy.complexity">Complexity</a>
+<h6>
+<a name="range.reference.algorithms.mutating.rotate_copy.h5"></a>
+            <span><a name="range.reference.algorithms.mutating.rotate_copy.complexity"></a></span><a class="link" href="rotate_copy.html#range.reference.algorithms.mutating.rotate_copy.complexity">Complexity</a>
           </h6>
 <p>
             Linear. Exactly <code class="computeroutput"><span class="identifier">distance</span><span class="special">(</span><span class="identifier">rng</span><span class="special">)</span></code> elements are copied.
@@ -97,7 +96,8 @@
 </div>
 <table xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" width="100%"><tr>
 <td align="left"></td>
-<td align="right"><div class="copyright-footer">Copyright &#169; 2003 -2010 Thorsten Ottosen, Neil Groves<p>
+<td align="right"><div class="copyright-footer">Copyright &#169; 2003-2010 Thorsten Ottosen,
+      Neil Groves<p>
         Distributed under the Boost Software License, Version 1.0. (See accompanying
         file LICENSE_1_0.txt or copy at <a href="http://www.boost.org/LICENSE_1_0.txt" target="_top">http://www.boost.org/LICENSE_1_0.txt</a>)
       </p>
diff --git a/doc/html/range/reference/algorithms/mutating/sort.html b/doc/html/range/reference/algorithms/mutating/sort.html
index aa9512c..19afd9f 100644
--- a/doc/html/range/reference/algorithms/mutating/sort.html
+++ b/doc/html/range/reference/algorithms/mutating/sort.html
@@ -22,16 +22,15 @@
 <div class="spirit-nav">
 <a accesskey="p" href="rotate_copy.html"><img src="../../../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../mutating.html"><img src="../../../../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../../../../index.html"><img src="../../../../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="stable_partition.html"><img src="../../../../../../../../doc/src/images/next.png" alt="Next"></a>
 </div>
-<div class="section">
+<div class="section range_reference_algorithms_mutating_sort">
 <div class="titlepage"><div><div><h5 class="title">
 <a name="range.reference.algorithms.mutating.sort"></a><a class="link" href="sort.html" title="sort">sort</a>
 </h5></div></div></div>
-<a name="range.reference.algorithms.mutating.sort.prototype"></a><h6>
-<a name="id703276"></a>
-            <a class="link" href="sort.html#range.reference.algorithms.mutating.sort.prototype">Prototype</a>
+<h6>
+<a name="range.reference.algorithms.mutating.sort.h0"></a>
+            <span><a name="range.reference.algorithms.mutating.sort.prototype"></a></span><a class="link" href="sort.html#range.reference.algorithms.mutating.sort.prototype">Prototype</a>
           </h6>
 <p>
-            
 </p>
 <pre class="programlisting"><span class="keyword">template</span><span class="special">&lt;</span><span class="keyword">class</span> <span class="identifier">RandomAccessRange</span><span class="special">&gt;</span>
 <span class="identifier">RandomAccessRange</span><span class="special">&amp;</span> <span class="identifier">sort</span><span class="special">(</span><span class="identifier">RandomAccessRange</span><span class="special">&amp;</span> <span class="identifier">rng</span><span class="special">);</span>
@@ -47,9 +46,9 @@
 </pre>
 <p>
           </p>
-<a name="range.reference.algorithms.mutating.sort.description"></a><h6>
-<a name="id703652"></a>
-            <a class="link" href="sort.html#range.reference.algorithms.mutating.sort.description">Description</a>
+<h6>
+<a name="range.reference.algorithms.mutating.sort.h1"></a>
+            <span><a name="range.reference.algorithms.mutating.sort.description"></a></span><a class="link" href="sort.html#range.reference.algorithms.mutating.sort.description">Description</a>
           </h6>
 <p>
             <code class="computeroutput"><span class="identifier">sort</span></code> sorts the elements
@@ -70,16 +69,16 @@
             function with a predicate, ascending order is defined by <code class="computeroutput"><span class="identifier">pred</span></code> such that for all adjacent elements
             <code class="computeroutput"><span class="special">[</span><span class="identifier">x</span><span class="special">,</span><span class="identifier">y</span><span class="special">]</span></code>, <code class="computeroutput"><span class="identifier">pred</span><span class="special">(</span><span class="identifier">y</span><span class="special">,</span> <span class="identifier">x</span><span class="special">)</span> <span class="special">==</span> <span class="keyword">false</span></code>.
           </p>
-<a name="range.reference.algorithms.mutating.sort.definition"></a><h6>
-<a name="id703896"></a>
-            <a class="link" href="sort.html#range.reference.algorithms.mutating.sort.definition">Definition</a>
+<h6>
+<a name="range.reference.algorithms.mutating.sort.h2"></a>
+            <span><a name="range.reference.algorithms.mutating.sort.definition"></a></span><a class="link" href="sort.html#range.reference.algorithms.mutating.sort.definition">Definition</a>
           </h6>
 <p>
             Defined in the header file <code class="computeroutput"><span class="identifier">boost</span><span class="special">/</span><span class="identifier">range</span><span class="special">/</span><span class="identifier">algorithm</span><span class="special">/</span><span class="identifier">sort</span><span class="special">.</span><span class="identifier">hpp</span></code>
           </p>
-<a name="range.reference.algorithms.mutating.sort.requirements"></a><h6>
-<a name="id703965"></a>
-            <a class="link" href="sort.html#range.reference.algorithms.mutating.sort.requirements">Requirements</a>
+<h6>
+<a name="range.reference.algorithms.mutating.sort.h3"></a>
+            <span><a name="range.reference.algorithms.mutating.sort.requirements"></a></span><a class="link" href="sort.html#range.reference.algorithms.mutating.sort.requirements">Requirements</a>
           </h6>
 <p>
             <span class="bold"><strong>For versions of sort without a predicate:</strong></span>
@@ -128,9 +127,9 @@
                 argument types.
               </li>
 </ul></div>
-<a name="range.reference.algorithms.mutating.sort.complexity"></a><h6>
-<a name="id704212"></a>
-            <a class="link" href="sort.html#range.reference.algorithms.mutating.sort.complexity">Complexity</a>
+<h6>
+<a name="range.reference.algorithms.mutating.sort.h4"></a>
+            <span><a name="range.reference.algorithms.mutating.sort.complexity"></a></span><a class="link" href="sort.html#range.reference.algorithms.mutating.sort.complexity">Complexity</a>
           </h6>
 <p>
             <code class="computeroutput"><span class="identifier">O</span><span class="special">(</span><span class="identifier">N</span> <span class="identifier">log</span><span class="special">(</span><span class="identifier">N</span><span class="special">))</span></code> comparisons (both average and worst-case),
@@ -139,7 +138,8 @@
 </div>
 <table xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" width="100%"><tr>
 <td align="left"></td>
-<td align="right"><div class="copyright-footer">Copyright &#169; 2003 -2010 Thorsten Ottosen, Neil Groves<p>
+<td align="right"><div class="copyright-footer">Copyright &#169; 2003-2010 Thorsten Ottosen,
+      Neil Groves<p>
         Distributed under the Boost Software License, Version 1.0. (See accompanying
         file LICENSE_1_0.txt or copy at <a href="http://www.boost.org/LICENSE_1_0.txt" target="_top">http://www.boost.org/LICENSE_1_0.txt</a>)
       </p>
diff --git a/doc/html/range/reference/algorithms/mutating/stable_partition.html b/doc/html/range/reference/algorithms/mutating/stable_partition.html
index c8dcd45..01db87e 100644
--- a/doc/html/range/reference/algorithms/mutating/stable_partition.html
+++ b/doc/html/range/reference/algorithms/mutating/stable_partition.html
@@ -22,16 +22,15 @@
 <div class="spirit-nav">
 <a accesskey="p" href="sort.html"><img src="../../../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../mutating.html"><img src="../../../../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../../../../index.html"><img src="../../../../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="stable_sort.html"><img src="../../../../../../../../doc/src/images/next.png" alt="Next"></a>
 </div>
-<div class="section">
+<div class="section range_reference_algorithms_mutating_stable_partition">
 <div class="titlepage"><div><div><h5 class="title">
 <a name="range.reference.algorithms.mutating.stable_partition"></a><a class="link" href="stable_partition.html" title="stable_partition">stable_partition</a>
 </h5></div></div></div>
-<a name="range.reference.algorithms.mutating.stable_partition.prototype"></a><h6>
-<a name="id704324"></a>
-            <a class="link" href="stable_partition.html#range.reference.algorithms.mutating.stable_partition.prototype">Prototype</a>
+<h6>
+<a name="range.reference.algorithms.mutating.stable_partition.h0"></a>
+            <span><a name="range.reference.algorithms.mutating.stable_partition.prototype"></a></span><a class="link" href="stable_partition.html#range.reference.algorithms.mutating.stable_partition.prototype">Prototype</a>
           </h6>
 <p>
-            
 </p>
 <pre class="programlisting"><span class="keyword">template</span><span class="special">&lt;</span><span class="keyword">class</span> <span class="identifier">ForwardRange</span><span class="special">,</span> <span class="keyword">class</span> <span class="identifier">UnaryPredicate</span><span class="special">&gt;</span>
 <span class="keyword">typename</span> <span class="identifier">range_iterator</span><span class="special">&lt;</span><span class="identifier">ForwardRange</span><span class="special">&gt;::</span><span class="identifier">type</span>
@@ -59,9 +58,9 @@
 </pre>
 <p>
           </p>
-<a name="range.reference.algorithms.mutating.stable_partition.description"></a><h6>
-<a name="id704898"></a>
-            <a class="link" href="stable_partition.html#range.reference.algorithms.mutating.stable_partition.description">Description</a>
+<h6>
+<a name="range.reference.algorithms.mutating.stable_partition.h1"></a>
+            <span><a name="range.reference.algorithms.mutating.stable_partition.description"></a></span><a class="link" href="stable_partition.html#range.reference.algorithms.mutating.stable_partition.description">Description</a>
           </h6>
 <p>
             <code class="computeroutput"><span class="identifier">stable_partition</span></code> reorders
@@ -81,16 +80,16 @@
             the <code class="computeroutput"><span class="identifier">found</span></code> iterator is
             the iterator to the first element that fails to satisfy <code class="computeroutput"><span class="identifier">pred</span></code>.
           </p>
-<a name="range.reference.algorithms.mutating.stable_partition.definition"></a><h6>
-<a name="id705039"></a>
-            <a class="link" href="stable_partition.html#range.reference.algorithms.mutating.stable_partition.definition">Definition</a>
+<h6>
+<a name="range.reference.algorithms.mutating.stable_partition.h2"></a>
+            <span><a name="range.reference.algorithms.mutating.stable_partition.definition"></a></span><a class="link" href="stable_partition.html#range.reference.algorithms.mutating.stable_partition.definition">Definition</a>
           </h6>
 <p>
             Defined in the header file <code class="computeroutput"><span class="identifier">boost</span><span class="special">/</span><span class="identifier">range</span><span class="special">/</span><span class="identifier">algorithm</span><span class="special">/</span><span class="identifier">stable_partition</span><span class="special">.</span><span class="identifier">hpp</span></code>
           </p>
-<a name="range.reference.algorithms.mutating.stable_partition.requirements"></a><h6>
-<a name="id705110"></a>
-            <a class="link" href="stable_partition.html#range.reference.algorithms.mutating.stable_partition.requirements">Requirements</a>
+<h6>
+<a name="range.reference.algorithms.mutating.stable_partition.h3"></a>
+            <span><a name="range.reference.algorithms.mutating.stable_partition.requirements"></a></span><a class="link" href="stable_partition.html#range.reference.algorithms.mutating.stable_partition.requirements">Requirements</a>
           </h6>
 <div class="itemizedlist"><ul class="itemizedlist" type="disc">
 <li class="listitem">
@@ -106,9 +105,9 @@
                 a model of the <code class="computeroutput"><span class="identifier">PredicateConcept</span></code>.
               </li>
 </ul></div>
-<a name="range.reference.algorithms.mutating.stable_partition.complexity"></a><h6>
-<a name="id705203"></a>
-            <a class="link" href="stable_partition.html#range.reference.algorithms.mutating.stable_partition.complexity">Complexity</a>
+<h6>
+<a name="range.reference.algorithms.mutating.stable_partition.h4"></a>
+            <span><a name="range.reference.algorithms.mutating.stable_partition.complexity"></a></span><a class="link" href="stable_partition.html#range.reference.algorithms.mutating.stable_partition.complexity">Complexity</a>
           </h6>
 <p>
             Best case: <code class="computeroutput"><span class="identifier">O</span><span class="special">(</span><span class="identifier">N</span><span class="special">)</span></code>
@@ -120,7 +119,8 @@
 </div>
 <table xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" width="100%"><tr>
 <td align="left"></td>
-<td align="right"><div class="copyright-footer">Copyright &#169; 2003 -2010 Thorsten Ottosen, Neil Groves<p>
+<td align="right"><div class="copyright-footer">Copyright &#169; 2003-2010 Thorsten Ottosen,
+      Neil Groves<p>
         Distributed under the Boost Software License, Version 1.0. (See accompanying
         file LICENSE_1_0.txt or copy at <a href="http://www.boost.org/LICENSE_1_0.txt" target="_top">http://www.boost.org/LICENSE_1_0.txt</a>)
       </p>
diff --git a/doc/html/range/reference/algorithms/mutating/stable_sort.html b/doc/html/range/reference/algorithms/mutating/stable_sort.html
index e22f262..ee685e0 100644
--- a/doc/html/range/reference/algorithms/mutating/stable_sort.html
+++ b/doc/html/range/reference/algorithms/mutating/stable_sort.html
@@ -22,16 +22,15 @@
 <div class="spirit-nav">
 <a accesskey="p" href="stable_partition.html"><img src="../../../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../mutating.html"><img src="../../../../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../../../../index.html"><img src="../../../../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="swap_ranges.html"><img src="../../../../../../../../doc/src/images/next.png" alt="Next"></a>
 </div>
-<div class="section">
+<div class="section range_reference_algorithms_mutating_stable_sort">
 <div class="titlepage"><div><div><h5 class="title">
 <a name="range.reference.algorithms.mutating.stable_sort"></a><a class="link" href="stable_sort.html" title="stable_sort">stable_sort</a>
 </h5></div></div></div>
-<a name="range.reference.algorithms.mutating.stable_sort.prototype"></a><h6>
-<a name="id705369"></a>
-            <a class="link" href="stable_sort.html#range.reference.algorithms.mutating.stable_sort.prototype">Prototype</a>
+<h6>
+<a name="range.reference.algorithms.mutating.stable_sort.h0"></a>
+            <span><a name="range.reference.algorithms.mutating.stable_sort.prototype"></a></span><a class="link" href="stable_sort.html#range.reference.algorithms.mutating.stable_sort.prototype">Prototype</a>
           </h6>
 <p>
-            
 </p>
 <pre class="programlisting"><span class="keyword">template</span><span class="special">&lt;</span><span class="keyword">class</span> <span class="identifier">RandomAccessRange</span><span class="special">&gt;</span>
 <span class="identifier">RandomAccessRange</span><span class="special">&amp;</span> <span class="identifier">stable_sort</span><span class="special">(</span><span class="identifier">RandomAccessRange</span><span class="special">&amp;</span> <span class="identifier">rng</span><span class="special">);</span>
@@ -47,9 +46,9 @@
 </pre>
 <p>
           </p>
-<a name="range.reference.algorithms.mutating.stable_sort.description"></a><h6>
-<a name="id705745"></a>
-            <a class="link" href="stable_sort.html#range.reference.algorithms.mutating.stable_sort.description">Description</a>
+<h6>
+<a name="range.reference.algorithms.mutating.stable_sort.h1"></a>
+            <span><a name="range.reference.algorithms.mutating.stable_sort.description"></a></span><a class="link" href="stable_sort.html#range.reference.algorithms.mutating.stable_sort.description">Description</a>
           </h6>
 <p>
             <code class="computeroutput"><span class="identifier">stable_sort</span></code> sorts the
@@ -70,16 +69,16 @@
             function with a predicate, ascending order is designed by <code class="computeroutput"><span class="identifier">pred</span></code> such that for all adjacent elements
             <code class="computeroutput"><span class="special">[</span><span class="identifier">x</span><span class="special">,</span><span class="identifier">y</span><span class="special">]</span></code>, <code class="computeroutput"><span class="identifier">pred</span><span class="special">(</span><span class="identifier">y</span><span class="special">,</span><span class="identifier">x</span><span class="special">)</span> <span class="special">==</span> <span class="keyword">false</span></code>.
           </p>
-<a name="range.reference.algorithms.mutating.stable_sort.definition"></a><h6>
-<a name="id705989"></a>
-            <a class="link" href="stable_sort.html#range.reference.algorithms.mutating.stable_sort.definition">Definition</a>
+<h6>
+<a name="range.reference.algorithms.mutating.stable_sort.h2"></a>
+            <span><a name="range.reference.algorithms.mutating.stable_sort.definition"></a></span><a class="link" href="stable_sort.html#range.reference.algorithms.mutating.stable_sort.definition">Definition</a>
           </h6>
 <p>
             Defined in the header file <code class="computeroutput"><span class="identifier">boost</span><span class="special">/</span><span class="identifier">range</span><span class="special">/</span><span class="identifier">algorithm</span><span class="special">/</span><span class="identifier">stable_sort</span><span class="special">.</span><span class="identifier">hpp</span></code>
           </p>
-<a name="range.reference.algorithms.mutating.stable_sort.requirements"></a><h6>
-<a name="id706060"></a>
-            <a class="link" href="stable_sort.html#range.reference.algorithms.mutating.stable_sort.requirements">Requirements</a>
+<h6>
+<a name="range.reference.algorithms.mutating.stable_sort.h3"></a>
+            <span><a name="range.reference.algorithms.mutating.stable_sort.requirements"></a></span><a class="link" href="stable_sort.html#range.reference.algorithms.mutating.stable_sort.requirements">Requirements</a>
           </h6>
 <p>
             <span class="bold"><strong>For versions of stable_sort without a predicate</strong></span>
@@ -128,9 +127,9 @@
                 argument types.
               </li>
 </ul></div>
-<a name="range.reference.algorithms.mutating.stable_sort.complexity"></a><h6>
-<a name="id706307"></a>
-            <a class="link" href="stable_sort.html#range.reference.algorithms.mutating.stable_sort.complexity">Complexity</a>
+<h6>
+<a name="range.reference.algorithms.mutating.stable_sort.h4"></a>
+            <span><a name="range.reference.algorithms.mutating.stable_sort.complexity"></a></span><a class="link" href="stable_sort.html#range.reference.algorithms.mutating.stable_sort.complexity">Complexity</a>
           </h6>
 <p>
             Best case: <code class="computeroutput"><span class="identifier">O</span><span class="special">(</span><span class="identifier">N</span><span class="special">)</span></code>
@@ -142,7 +141,8 @@
 </div>
 <table xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" width="100%"><tr>
 <td align="left"></td>
-<td align="right"><div class="copyright-footer">Copyright &#169; 2003 -2010 Thorsten Ottosen, Neil Groves<p>
+<td align="right"><div class="copyright-footer">Copyright &#169; 2003-2010 Thorsten Ottosen,
+      Neil Groves<p>
         Distributed under the Boost Software License, Version 1.0. (See accompanying
         file LICENSE_1_0.txt or copy at <a href="http://www.boost.org/LICENSE_1_0.txt" target="_top">http://www.boost.org/LICENSE_1_0.txt</a>)
       </p>
diff --git a/doc/html/range/reference/algorithms/mutating/swap_ranges.html b/doc/html/range/reference/algorithms/mutating/swap_ranges.html
index 0e329dd..9fc260b 100644
--- a/doc/html/range/reference/algorithms/mutating/swap_ranges.html
+++ b/doc/html/range/reference/algorithms/mutating/swap_ranges.html
@@ -22,25 +22,24 @@
 <div class="spirit-nav">
 <a accesskey="p" href="stable_sort.html"><img src="../../../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../mutating.html"><img src="../../../../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../../../../index.html"><img src="../../../../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="transform.html"><img src="../../../../../../../../doc/src/images/next.png" alt="Next"></a>
 </div>
-<div class="section">
+<div class="section range_reference_algorithms_mutating_swap_ranges">
 <div class="titlepage"><div><div><h5 class="title">
 <a name="range.reference.algorithms.mutating.swap_ranges"></a><a class="link" href="swap_ranges.html" title="swap_ranges">swap_ranges</a>
 </h5></div></div></div>
-<a name="range.reference.algorithms.mutating.swap_ranges.prototype"></a><h6>
-<a name="id706485"></a>
-            <a class="link" href="swap_ranges.html#range.reference.algorithms.mutating.swap_ranges.prototype">Prototype</a>
+<h6>
+<a name="range.reference.algorithms.mutating.swap_ranges.h0"></a>
+            <span><a name="range.reference.algorithms.mutating.swap_ranges.prototype"></a></span><a class="link" href="swap_ranges.html#range.reference.algorithms.mutating.swap_ranges.prototype">Prototype</a>
           </h6>
 <p>
-            
 </p>
 <pre class="programlisting"><span class="keyword">template</span><span class="special">&lt;</span><span class="keyword">class</span> <span class="identifier">SinglePassRange1</span><span class="special">,</span> <span class="keyword">class</span> <span class="identifier">SinglePassRange2</span><span class="special">&gt;</span>
 <span class="identifier">SinglePassRange2</span><span class="special">&amp;</span> <span class="identifier">swap_ranges</span><span class="special">(</span><span class="identifier">SinglePassRange1</span><span class="special">&amp;</span> <span class="identifier">rng1</span><span class="special">,</span> <span class="identifier">SinglePassRange</span><span class="special">&amp;</span> <span class="identifier">rng2</span><span class="special">);</span>
 </pre>
 <p>
           </p>
-<a name="range.reference.algorithms.mutating.swap_ranges.description"></a><h6>
-<a name="id706616"></a>
-            <a class="link" href="swap_ranges.html#range.reference.algorithms.mutating.swap_ranges.description">Description</a>
+<h6>
+<a name="range.reference.algorithms.mutating.swap_ranges.h1"></a>
+            <span><a name="range.reference.algorithms.mutating.swap_ranges.description"></a></span><a class="link" href="swap_ranges.html#range.reference.algorithms.mutating.swap_ranges.description">Description</a>
           </h6>
 <p>
             <code class="computeroutput"><span class="identifier">swap_ranges</span></code> swaps each
@@ -48,16 +47,16 @@
             <code class="computeroutput"><span class="identifier">y</span></code> in <code class="computeroutput"><span class="identifier">rng2</span></code>.
             Returns a reference to <code class="computeroutput"><span class="identifier">rng2</span></code>.
           </p>
-<a name="range.reference.algorithms.mutating.swap_ranges.definition"></a><h6>
-<a name="id706703"></a>
-            <a class="link" href="swap_ranges.html#range.reference.algorithms.mutating.swap_ranges.definition">Definition</a>
+<h6>
+<a name="range.reference.algorithms.mutating.swap_ranges.h2"></a>
+            <span><a name="range.reference.algorithms.mutating.swap_ranges.definition"></a></span><a class="link" href="swap_ranges.html#range.reference.algorithms.mutating.swap_ranges.definition">Definition</a>
           </h6>
 <p>
             Defined in the header file <code class="computeroutput"><span class="identifier">boost</span><span class="special">/</span><span class="identifier">range</span><span class="special">/</span><span class="identifier">algorithm</span><span class="special">/</span><span class="identifier">swap_ranges</span><span class="special">.</span><span class="identifier">hpp</span></code>
           </p>
-<a name="range.reference.algorithms.mutating.swap_ranges.requirements"></a><h6>
-<a name="id706773"></a>
-            <a class="link" href="swap_ranges.html#range.reference.algorithms.mutating.swap_ranges.requirements">Requirements</a>
+<h6>
+<a name="range.reference.algorithms.mutating.swap_ranges.h3"></a>
+            <span><a name="range.reference.algorithms.mutating.swap_ranges.requirements"></a></span><a class="link" href="swap_ranges.html#range.reference.algorithms.mutating.swap_ranges.requirements">Requirements</a>
           </h6>
 <div class="itemizedlist"><ul class="itemizedlist" type="disc">
 <li class="listitem">
@@ -79,9 +78,9 @@
                 is mutable.
               </li>
 </ul></div>
-<a name="range.reference.algorithms.mutating.swap_ranges.complexity"></a><h6>
-<a name="id706880"></a>
-            <a class="link" href="swap_ranges.html#range.reference.algorithms.mutating.swap_ranges.complexity">Complexity</a>
+<h6>
+<a name="range.reference.algorithms.mutating.swap_ranges.h4"></a>
+            <span><a name="range.reference.algorithms.mutating.swap_ranges.complexity"></a></span><a class="link" href="swap_ranges.html#range.reference.algorithms.mutating.swap_ranges.complexity">Complexity</a>
           </h6>
 <p>
             Linear. Exactly <code class="computeroutput"><span class="identifier">distance</span><span class="special">(</span><span class="identifier">rng1</span><span class="special">)</span></code> elements are swapped.
@@ -89,7 +88,8 @@
 </div>
 <table xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" width="100%"><tr>
 <td align="left"></td>
-<td align="right"><div class="copyright-footer">Copyright &#169; 2003 -2010 Thorsten Ottosen, Neil Groves<p>
+<td align="right"><div class="copyright-footer">Copyright &#169; 2003-2010 Thorsten Ottosen,
+      Neil Groves<p>
         Distributed under the Boost Software License, Version 1.0. (See accompanying
         file LICENSE_1_0.txt or copy at <a href="http://www.boost.org/LICENSE_1_0.txt" target="_top">http://www.boost.org/LICENSE_1_0.txt</a>)
       </p>
diff --git a/doc/html/range/reference/algorithms/mutating/transform.html b/doc/html/range/reference/algorithms/mutating/transform.html
index 77a319c..92baa8a 100644
--- a/doc/html/range/reference/algorithms/mutating/transform.html
+++ b/doc/html/range/reference/algorithms/mutating/transform.html
@@ -22,16 +22,15 @@
 <div class="spirit-nav">
 <a accesskey="p" href="swap_ranges.html"><img src="../../../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../mutating.html"><img src="../../../../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../../../../index.html"><img src="../../../../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="unique.html"><img src="../../../../../../../../doc/src/images/next.png" alt="Next"></a>
 </div>
-<div class="section">
+<div class="section range_reference_algorithms_mutating_transform">
 <div class="titlepage"><div><div><h5 class="title">
 <a name="range.reference.algorithms.mutating.transform"></a><a class="link" href="transform.html" title="transform">transform</a>
 </h5></div></div></div>
-<a name="range.reference.algorithms.mutating.transform.prototype"></a><h6>
-<a name="id706944"></a>
-            <a class="link" href="transform.html#range.reference.algorithms.mutating.transform.prototype">Prototype</a>
+<h6>
+<a name="range.reference.algorithms.mutating.transform.h0"></a>
+            <span><a name="range.reference.algorithms.mutating.transform.prototype"></a></span><a class="link" href="transform.html#range.reference.algorithms.mutating.transform.prototype">Prototype</a>
           </h6>
 <p>
-            
 </p>
 <pre class="programlisting"><span class="keyword">template</span><span class="special">&lt;</span>
     <span class="keyword">class</span> <span class="identifier">SinglePassRange1</span><span class="special">,</span>
@@ -55,9 +54,9 @@
 </pre>
 <p>
           </p>
-<a name="range.reference.algorithms.mutating.transform.description"></a><h6>
-<a name="id707279"></a>
-            <a class="link" href="transform.html#range.reference.algorithms.mutating.transform.description">Description</a>
+<h6>
+<a name="range.reference.algorithms.mutating.transform.h1"></a>
+            <span><a name="range.reference.algorithms.mutating.transform.description"></a></span><a class="link" href="transform.html#range.reference.algorithms.mutating.transform.description">Description</a>
           </h6>
 <p>
             <span class="bold"><strong>UnaryOperation version:</strong></span>
@@ -91,16 +90,16 @@
 <p>
             The return value is <code class="computeroutput"><span class="identifier">out</span> <span class="special">+</span> <span class="identifier">min</span><span class="special">(</span><span class="identifier">distance</span><span class="special">(</span><span class="identifier">rng1</span><span class="special">),</span> <span class="identifier">distance</span><span class="special">(</span><span class="identifier">rng2</span><span class="special">))</span></code>.
           </p>
-<a name="range.reference.algorithms.mutating.transform.definition"></a><h6>
-<a name="id707818"></a>
-            <a class="link" href="transform.html#range.reference.algorithms.mutating.transform.definition">Definition</a>
+<h6>
+<a name="range.reference.algorithms.mutating.transform.h2"></a>
+            <span><a name="range.reference.algorithms.mutating.transform.definition"></a></span><a class="link" href="transform.html#range.reference.algorithms.mutating.transform.definition">Definition</a>
           </h6>
 <p>
             Defined in the header file <code class="computeroutput"><span class="identifier">boost</span><span class="special">/</span><span class="identifier">range</span><span class="special">/</span><span class="identifier">algorithm</span><span class="special">/</span><span class="identifier">transform</span><span class="special">.</span><span class="identifier">hpp</span></code>
           </p>
-<a name="range.reference.algorithms.mutating.transform.requirements"></a><h6>
-<a name="id707889"></a>
-            <a class="link" href="transform.html#range.reference.algorithms.mutating.transform.requirements">Requirements</a>
+<h6>
+<a name="range.reference.algorithms.mutating.transform.h3"></a>
+            <span><a name="range.reference.algorithms.mutating.transform.requirements"></a></span><a class="link" href="transform.html#range.reference.algorithms.mutating.transform.requirements">Requirements</a>
           </h6>
 <p>
             <span class="bold"><strong>For the unary versions of transform:</strong></span>
@@ -168,9 +167,9 @@
                 set of value types.
               </li>
 </ul></div>
-<a name="range.reference.algorithms.mutating.transform.precondition_"></a><h6>
-<a name="id708258"></a>
-            <a class="link" href="transform.html#range.reference.algorithms.mutating.transform.precondition_">Precondition:</a>
+<h6>
+<a name="range.reference.algorithms.mutating.transform.h4"></a>
+            <span><a name="range.reference.algorithms.mutating.transform.precondition_"></a></span><a class="link" href="transform.html#range.reference.algorithms.mutating.transform.precondition_">Precondition:</a>
           </h6>
 <p>
             <span class="bold"><strong>For the unary version of transform:</strong></span>
@@ -202,9 +201,9 @@
                 <span class="special">+</span> <span class="identifier">min</span><span class="special">(</span><span class="identifier">distance</span><span class="special">(</span><span class="identifier">rng1</span><span class="special">),</span> <span class="identifier">distance</span><span class="special">(</span><span class="identifier">rng2</span><span class="special">)))</span></code> is a valid range.
               </li>
 </ul></div>
-<a name="range.reference.algorithms.mutating.transform.complexity"></a><h6>
-<a name="id708682"></a>
-            <a class="link" href="transform.html#range.reference.algorithms.mutating.transform.complexity">Complexity</a>
+<h6>
+<a name="range.reference.algorithms.mutating.transform.h5"></a>
+            <span><a name="range.reference.algorithms.mutating.transform.complexity"></a></span><a class="link" href="transform.html#range.reference.algorithms.mutating.transform.complexity">Complexity</a>
           </h6>
 <p>
             Linear. The operation is applied exactly <code class="computeroutput"><span class="identifier">distance</span><span class="special">(</span><span class="identifier">rng1</span><span class="special">)</span></code> for the unary version and <code class="computeroutput"><span class="identifier">min</span><span class="special">(</span><span class="identifier">distance</span><span class="special">(</span><span class="identifier">rng1</span><span class="special">),</span> <span class="identifier">distance</span><span class="special">(</span><span class="identifier">rng2</span><span class="special">))</span></code>
@@ -213,7 +212,8 @@
 </div>
 <table xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" width="100%"><tr>
 <td align="left"></td>
-<td align="right"><div class="copyright-footer">Copyright &#169; 2003 -2010 Thorsten Ottosen, Neil Groves<p>
+<td align="right"><div class="copyright-footer">Copyright &#169; 2003-2010 Thorsten Ottosen,
+      Neil Groves<p>
         Distributed under the Boost Software License, Version 1.0. (See accompanying
         file LICENSE_1_0.txt or copy at <a href="http://www.boost.org/LICENSE_1_0.txt" target="_top">http://www.boost.org/LICENSE_1_0.txt</a>)
       </p>
diff --git a/doc/html/range/reference/algorithms/mutating/unique.html b/doc/html/range/reference/algorithms/mutating/unique.html
index 7aa3f2f..8d32d27 100644
--- a/doc/html/range/reference/algorithms/mutating/unique.html
+++ b/doc/html/range/reference/algorithms/mutating/unique.html
@@ -22,16 +22,15 @@
 <div class="spirit-nav">
 <a accesskey="p" href="transform.html"><img src="../../../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../mutating.html"><img src="../../../../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../../../../index.html"><img src="../../../../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="unique_copy.html"><img src="../../../../../../../../doc/src/images/next.png" alt="Next"></a>
 </div>
-<div class="section">
+<div class="section range_reference_algorithms_mutating_unique">
 <div class="titlepage"><div><div><h5 class="title">
 <a name="range.reference.algorithms.mutating.unique"></a><a class="link" href="unique.html" title="unique">unique</a>
 </h5></div></div></div>
-<a name="range.reference.algorithms.mutating.unique.prototype"></a><h6>
-<a name="id708800"></a>
-            <a class="link" href="unique.html#range.reference.algorithms.mutating.unique.prototype">Prototype</a>
+<h6>
+<a name="range.reference.algorithms.mutating.unique.h0"></a>
+            <span><a name="range.reference.algorithms.mutating.unique.prototype"></a></span><a class="link" href="unique.html#range.reference.algorithms.mutating.unique.prototype">Prototype</a>
           </h6>
 <p>
-            
 </p>
 <pre class="programlisting"><span class="keyword">template</span><span class="special">&lt;</span><span class="keyword">class</span> <span class="identifier">ForwardRange</span><span class="special">&gt;</span>
 <span class="keyword">typename</span> <span class="identifier">range_return</span><span class="special">&lt;</span><span class="identifier">ForwardRange</span><span class="special">,</span> <span class="identifier">return_begin_found</span><span class="special">&gt;::</span><span class="identifier">type</span>
@@ -67,9 +66,9 @@
 </pre>
 <p>
           </p>
-<a name="range.reference.algorithms.mutating.unique.description"></a><h6>
-<a name="id709822"></a>
-            <a class="link" href="unique.html#range.reference.algorithms.mutating.unique.description">Description</a>
+<h6>
+<a name="range.reference.algorithms.mutating.unique.h1"></a>
+            <span><a name="range.reference.algorithms.mutating.unique.description"></a></span><a class="link" href="unique.html#range.reference.algorithms.mutating.unique.description">Description</a>
           </h6>
 <p>
             <code class="computeroutput"><span class="identifier">unique</span></code> removes all but
@@ -85,16 +84,16 @@
             for <code class="computeroutput"><span class="identifier">ForwardRange</span></code>'s value
             type.
           </p>
-<a name="range.reference.algorithms.mutating.unique.definition"></a><h6>
-<a name="id709940"></a>
-            <a class="link" href="unique.html#range.reference.algorithms.mutating.unique.definition">Definition</a>
+<h6>
+<a name="range.reference.algorithms.mutating.unique.h2"></a>
+            <span><a name="range.reference.algorithms.mutating.unique.definition"></a></span><a class="link" href="unique.html#range.reference.algorithms.mutating.unique.definition">Definition</a>
           </h6>
 <p>
             Defined in the header file <code class="computeroutput"><span class="identifier">boost</span><span class="special">/</span><span class="identifier">range</span><span class="special">/</span><span class="identifier">algorithm</span><span class="special">/</span><span class="identifier">unique</span><span class="special">.</span><span class="identifier">hpp</span></code>
           </p>
-<a name="range.reference.algorithms.mutating.unique.requirements"></a><h6>
-<a name="id710010"></a>
-            <a class="link" href="unique.html#range.reference.algorithms.mutating.unique.requirements">Requirements</a>
+<h6>
+<a name="range.reference.algorithms.mutating.unique.h3"></a>
+            <span><a name="range.reference.algorithms.mutating.unique.requirements"></a></span><a class="link" href="unique.html#range.reference.algorithms.mutating.unique.requirements">Requirements</a>
           </h6>
 <p>
             <span class="bold"><strong>For the non-predicate versions of unique:</strong></span>
@@ -136,9 +135,9 @@
                 second argument type.
               </li>
 </ul></div>
-<a name="range.reference.algorithms.mutating.unique.complexity"></a><h6>
-<a name="id710232"></a>
-            <a class="link" href="unique.html#range.reference.algorithms.mutating.unique.complexity">Complexity</a>
+<h6>
+<a name="range.reference.algorithms.mutating.unique.h4"></a>
+            <span><a name="range.reference.algorithms.mutating.unique.complexity"></a></span><a class="link" href="unique.html#range.reference.algorithms.mutating.unique.complexity">Complexity</a>
           </h6>
 <p>
             Linear. <code class="computeroutput"><span class="identifier">O</span><span class="special">(</span><span class="identifier">N</span><span class="special">)</span></code>
@@ -149,7 +148,8 @@
 </div>
 <table xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" width="100%"><tr>
 <td align="left"></td>
-<td align="right"><div class="copyright-footer">Copyright &#169; 2003 -2010 Thorsten Ottosen, Neil Groves<p>
+<td align="right"><div class="copyright-footer">Copyright &#169; 2003-2010 Thorsten Ottosen,
+      Neil Groves<p>
         Distributed under the Boost Software License, Version 1.0. (See accompanying
         file LICENSE_1_0.txt or copy at <a href="http://www.boost.org/LICENSE_1_0.txt" target="_top">http://www.boost.org/LICENSE_1_0.txt</a>)
       </p>
diff --git a/doc/html/range/reference/algorithms/mutating/unique_copy.html b/doc/html/range/reference/algorithms/mutating/unique_copy.html
index cd4a014..7b6319e 100644
--- a/doc/html/range/reference/algorithms/mutating/unique_copy.html
+++ b/doc/html/range/reference/algorithms/mutating/unique_copy.html
@@ -22,16 +22,15 @@
 <div class="spirit-nav">
 <a accesskey="p" href="unique.html"><img src="../../../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../mutating.html"><img src="../../../../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../../../../index.html"><img src="../../../../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="../non_mutating.html"><img src="../../../../../../../../doc/src/images/next.png" alt="Next"></a>
 </div>
-<div class="section">
+<div class="section range_reference_algorithms_mutating_unique_copy">
 <div class="titlepage"><div><div><h5 class="title">
 <a name="range.reference.algorithms.mutating.unique_copy"></a><a class="link" href="unique_copy.html" title="unique_copy">unique_copy</a>
 </h5></div></div></div>
-<a name="range.reference.algorithms.mutating.unique_copy.prototype"></a><h6>
-<a name="id710354"></a>
-            <a class="link" href="unique_copy.html#range.reference.algorithms.mutating.unique_copy.prototype">Prototype</a>
+<h6>
+<a name="range.reference.algorithms.mutating.unique_copy.h0"></a>
+            <span><a name="range.reference.algorithms.mutating.unique_copy.prototype"></a></span><a class="link" href="unique_copy.html#range.reference.algorithms.mutating.unique_copy.prototype">Prototype</a>
           </h6>
 <p>
-            
 </p>
 <pre class="programlisting"><span class="keyword">template</span><span class="special">&lt;</span><span class="keyword">class</span> <span class="identifier">SinglePassRange</span><span class="special">,</span> <span class="keyword">class</span> <span class="identifier">OutputIterator</span><span class="special">&gt;</span>
 <span class="identifier">OutputIterator</span> <span class="identifier">unique_copy</span><span class="special">(</span><span class="keyword">const</span> <span class="identifier">SinglePassRange</span><span class="special">&amp;</span> <span class="identifier">rng</span><span class="special">,</span> <span class="identifier">OutputIterator</span> <span class="identifier">out</span><span class="special">);</span>
@@ -41,9 +40,9 @@
 </pre>
 <p>
           </p>
-<a name="range.reference.algorithms.mutating.unique_copy.description"></a><h6>
-<a name="id710611"></a>
-            <a class="link" href="unique_copy.html#range.reference.algorithms.mutating.unique_copy.description">Description</a>
+<h6>
+<a name="range.reference.algorithms.mutating.unique_copy.h1"></a>
+            <span><a name="range.reference.algorithms.mutating.unique_copy.description"></a></span><a class="link" href="unique_copy.html#range.reference.algorithms.mutating.unique_copy.description">Description</a>
           </h6>
 <p>
             <code class="computeroutput"><span class="identifier">unique_copy</span></code> copies the
@@ -54,16 +53,16 @@
             for <code class="computeroutput"><span class="identifier">SinglePassRange</span></code>'s
             value type.
           </p>
-<a name="range.reference.algorithms.mutating.unique_copy.definition"></a><h6>
-<a name="id710696"></a>
-            <a class="link" href="unique_copy.html#range.reference.algorithms.mutating.unique_copy.definition">Definition</a>
+<h6>
+<a name="range.reference.algorithms.mutating.unique_copy.h2"></a>
+            <span><a name="range.reference.algorithms.mutating.unique_copy.definition"></a></span><a class="link" href="unique_copy.html#range.reference.algorithms.mutating.unique_copy.definition">Definition</a>
           </h6>
 <p>
             Defined in the header file <code class="computeroutput"><span class="identifier">boost</span><span class="special">/</span><span class="identifier">range</span><span class="special">/</span><span class="identifier">algorithm</span><span class="special">/</span><span class="identifier">unique_copy</span><span class="special">.</span><span class="identifier">hpp</span></code>
           </p>
-<a name="range.reference.algorithms.mutating.unique_copy.requirements"></a><h6>
-<a name="id710767"></a>
-            <a class="link" href="unique_copy.html#range.reference.algorithms.mutating.unique_copy.requirements">Requirements</a>
+<h6>
+<a name="range.reference.algorithms.mutating.unique_copy.h3"></a>
+            <span><a name="range.reference.algorithms.mutating.unique_copy.requirements"></a></span><a class="link" href="unique_copy.html#range.reference.algorithms.mutating.unique_copy.requirements">Requirements</a>
           </h6>
 <p>
             <span class="bold"><strong>For the non-predicate versions of unique:</strong></span>
@@ -115,9 +114,9 @@
                 a model of the <code class="computeroutput"><span class="identifier">OutputIteratorConcept</span></code>.
               </li>
 </ul></div>
-<a name="range.reference.algorithms.mutating.unique_copy.complexity"></a><h6>
-<a name="id711046"></a>
-            <a class="link" href="unique_copy.html#range.reference.algorithms.mutating.unique_copy.complexity">Complexity</a>
+<h6>
+<a name="range.reference.algorithms.mutating.unique_copy.h4"></a>
+            <span><a name="range.reference.algorithms.mutating.unique_copy.complexity"></a></span><a class="link" href="unique_copy.html#range.reference.algorithms.mutating.unique_copy.complexity">Complexity</a>
           </h6>
 <p>
             Linear. <code class="computeroutput"><span class="identifier">O</span><span class="special">(</span><span class="identifier">N</span><span class="special">)</span></code>
@@ -128,7 +127,8 @@
 </div>
 <table xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" width="100%"><tr>
 <td align="left"></td>
-<td align="right"><div class="copyright-footer">Copyright &#169; 2003 -2010 Thorsten Ottosen, Neil Groves<p>
+<td align="right"><div class="copyright-footer">Copyright &#169; 2003-2010 Thorsten Ottosen,
+      Neil Groves<p>
         Distributed under the Boost Software License, Version 1.0. (See accompanying
         file LICENSE_1_0.txt or copy at <a href="http://www.boost.org/LICENSE_1_0.txt" target="_top">http://www.boost.org/LICENSE_1_0.txt</a>)
       </p>
diff --git a/doc/html/range/reference/algorithms/new.html b/doc/html/range/reference/algorithms/new.html
index e0451a8..26d7f5c 100644
--- a/doc/html/range/reference/algorithms/new.html
+++ b/doc/html/range/reference/algorithms/new.html
@@ -22,7 +22,7 @@
 <div class="spirit-nav">
 <a accesskey="p" href="permutation/prev_permutation.html"><img src="../../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../algorithms.html"><img src="../../../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../../../index.html"><img src="../../../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="new/copy_n.html"><img src="../../../../../../../doc/src/images/next.png" alt="Next"></a>
 </div>
-<div class="section">
+<div class="section range_reference_algorithms_new">
 <div class="titlepage"><div><div><h4 class="title">
 <a name="range.reference.algorithms.new"></a><a class="link" href="new.html" title="New algorithms">New algorithms</a>
 </h4></div></div></div>
@@ -42,7 +42,8 @@
 </div>
 <table xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" width="100%"><tr>
 <td align="left"></td>
-<td align="right"><div class="copyright-footer">Copyright &#169; 2003 -2010 Thorsten Ottosen, Neil Groves<p>
+<td align="right"><div class="copyright-footer">Copyright &#169; 2003-2010 Thorsten Ottosen,
+      Neil Groves<p>
         Distributed under the Boost Software License, Version 1.0. (See accompanying
         file LICENSE_1_0.txt or copy at <a href="http://www.boost.org/LICENSE_1_0.txt" target="_top">http://www.boost.org/LICENSE_1_0.txt</a>)
       </p>
diff --git a/doc/html/range/reference/algorithms/new/copy_n.html b/doc/html/range/reference/algorithms/new/copy_n.html
index d7ce746..7dad794 100644
--- a/doc/html/range/reference/algorithms/new/copy_n.html
+++ b/doc/html/range/reference/algorithms/new/copy_n.html
@@ -22,25 +22,24 @@
 <div class="spirit-nav">
 <a accesskey="p" href="../new.html"><img src="../../../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../new.html"><img src="../../../../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../../../../index.html"><img src="../../../../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="erase.html"><img src="../../../../../../../../doc/src/images/next.png" alt="Next"></a>
 </div>
-<div class="section">
+<div class="section range_reference_algorithms_new_copy_n">
 <div class="titlepage"><div><div><h5 class="title">
 <a name="range.reference.algorithms.new.copy_n"></a><a class="link" href="copy_n.html" title="copy_n">copy_n</a>
 </h5></div></div></div>
-<a name="range.reference.algorithms.new.copy_n.prototype"></a><h6>
-<a name="id744730"></a>
-            <a class="link" href="copy_n.html#range.reference.algorithms.new.copy_n.prototype">Prototype</a>
+<h6>
+<a name="range.reference.algorithms.new.copy_n.h0"></a>
+            <span><a name="range.reference.algorithms.new.copy_n.prototype"></a></span><a class="link" href="copy_n.html#range.reference.algorithms.new.copy_n.prototype">Prototype</a>
           </h6>
 <p>
-            
 </p>
 <pre class="programlisting"><span class="keyword">template</span><span class="special">&lt;</span><span class="keyword">class</span> <span class="identifier">SinglePassRange</span><span class="special">,</span> <span class="keyword">class</span> <span class="identifier">Size</span><span class="special">,</span> <span class="keyword">class</span> <span class="identifier">OutputIterator</span><span class="special">&gt;</span>
 <span class="identifier">OutputIterator</span> <span class="identifier">copy_n</span><span class="special">(</span><span class="keyword">const</span> <span class="identifier">SinglePassRange</span><span class="special">&amp;</span> <span class="identifier">rng</span><span class="special">,</span> <span class="identifier">Size</span> <span class="identifier">n</span><span class="special">,</span> <span class="identifier">OutputIterator</span> <span class="identifier">out</span><span class="special">);</span>
 </pre>
 <p>
           </p>
-<a name="range.reference.algorithms.new.copy_n.description"></a><h6>
-<a name="id744888"></a>
-            <a class="link" href="copy_n.html#range.reference.algorithms.new.copy_n.description">Description</a>
+<h6>
+<a name="range.reference.algorithms.new.copy_n.h1"></a>
+            <span><a name="range.reference.algorithms.new.copy_n.description"></a></span><a class="link" href="copy_n.html#range.reference.algorithms.new.copy_n.description">Description</a>
           </h6>
 <p>
             <code class="computeroutput"><span class="identifier">copy_n</span></code> is provided to
@@ -52,16 +51,16 @@
             <code class="computeroutput"><span class="identifier">copy_n</span></code> copies elements
             from <code class="computeroutput"><span class="special">[</span><span class="identifier">boost</span><span class="special">::</span><span class="identifier">begin</span><span class="special">(</span><span class="identifier">rng</span><span class="special">),</span> <span class="identifier">boost</span><span class="special">::</span><span class="identifier">begin</span><span class="special">(</span><span class="identifier">rng</span><span class="special">)</span> <span class="special">+</span> <span class="identifier">n</span><span class="special">)</span></code> to the range <code class="computeroutput"><span class="special">[</span><span class="identifier">out</span><span class="special">,</span> <span class="identifier">out</span> <span class="special">+</span> <span class="identifier">n</span><span class="special">)</span></code>
           </p>
-<a name="range.reference.algorithms.new.copy_n.definition"></a><h6>
-<a name="id745058"></a>
-            <a class="link" href="copy_n.html#range.reference.algorithms.new.copy_n.definition">Definition</a>
+<h6>
+<a name="range.reference.algorithms.new.copy_n.h2"></a>
+            <span><a name="range.reference.algorithms.new.copy_n.definition"></a></span><a class="link" href="copy_n.html#range.reference.algorithms.new.copy_n.definition">Definition</a>
           </h6>
 <p>
             Defined in the header file <code class="computeroutput"><span class="identifier">boost</span><span class="special">/</span><span class="identifier">range</span><span class="special">/</span><span class="identifier">algorithm_ext</span><span class="special">/</span><span class="identifier">copy_n</span><span class="special">.</span><span class="identifier">hpp</span></code>
           </p>
-<a name="range.reference.algorithms.new.copy_n.requirements"></a><h6>
-<a name="id745129"></a>
-            <a class="link" href="copy_n.html#range.reference.algorithms.new.copy_n.requirements">Requirements</a>
+<h6>
+<a name="range.reference.algorithms.new.copy_n.h3"></a>
+            <span><a name="range.reference.algorithms.new.copy_n.requirements"></a></span><a class="link" href="copy_n.html#range.reference.algorithms.new.copy_n.requirements">Requirements</a>
           </h6>
 <div class="orderedlist"><ol class="orderedlist" type="1">
 <li class="listitem">
@@ -78,9 +77,9 @@
                 a model of the <code class="computeroutput"><span class="identifier">OutputIteratorConcept</span></code>.
               </li>
 </ol></div>
-<a name="range.reference.algorithms.new.copy_n.complexity"></a><h6>
-<a name="id745236"></a>
-            <a class="link" href="copy_n.html#range.reference.algorithms.new.copy_n.complexity">Complexity</a>
+<h6>
+<a name="range.reference.algorithms.new.copy_n.h4"></a>
+            <span><a name="range.reference.algorithms.new.copy_n.complexity"></a></span><a class="link" href="copy_n.html#range.reference.algorithms.new.copy_n.complexity">Complexity</a>
           </h6>
 <p>
             Linear. Exactly <code class="computeroutput"><span class="identifier">n</span></code> elements
@@ -89,7 +88,8 @@
 </div>
 <table xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" width="100%"><tr>
 <td align="left"></td>
-<td align="right"><div class="copyright-footer">Copyright &#169; 2003 -2010 Thorsten Ottosen, Neil Groves<p>
+<td align="right"><div class="copyright-footer">Copyright &#169; 2003-2010 Thorsten Ottosen,
+      Neil Groves<p>
         Distributed under the Boost Software License, Version 1.0. (See accompanying
         file LICENSE_1_0.txt or copy at <a href="http://www.boost.org/LICENSE_1_0.txt" target="_top">http://www.boost.org/LICENSE_1_0.txt</a>)
       </p>
diff --git a/doc/html/range/reference/algorithms/new/erase.html b/doc/html/range/reference/algorithms/new/erase.html
index dffd697..03db199 100644
--- a/doc/html/range/reference/algorithms/new/erase.html
+++ b/doc/html/range/reference/algorithms/new/erase.html
@@ -22,16 +22,15 @@
 <div class="spirit-nav">
 <a accesskey="p" href="copy_n.html"><img src="../../../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../new.html"><img src="../../../../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../../../../index.html"><img src="../../../../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="for_each.html"><img src="../../../../../../../../doc/src/images/next.png" alt="Next"></a>
 </div>
-<div class="section">
+<div class="section range_reference_algorithms_new_erase">
 <div class="titlepage"><div><div><h5 class="title">
 <a name="range.reference.algorithms.new.erase"></a><a class="link" href="erase.html" title="erase">erase</a>
 </h5></div></div></div>
-<a name="range.reference.algorithms.new.erase.prototype"></a><h6>
-<a name="id745287"></a>
-            <a class="link" href="erase.html#range.reference.algorithms.new.erase.prototype">Prototype</a>
+<h6>
+<a name="range.reference.algorithms.new.erase.h0"></a>
+            <span><a name="range.reference.algorithms.new.erase.prototype"></a></span><a class="link" href="erase.html#range.reference.algorithms.new.erase.prototype">Prototype</a>
           </h6>
 <p>
-            
 </p>
 <pre class="programlisting"><span class="keyword">template</span><span class="special">&lt;</span><span class="keyword">class</span> <span class="identifier">Container</span><span class="special">&gt;</span>
 <span class="identifier">Container</span><span class="special">&amp;</span> <span class="identifier">erase</span><span class="special">(</span>
@@ -40,9 +39,9 @@
 </pre>
 <p>
           </p>
-<a name="range.reference.algorithms.new.erase.description"></a><h6>
-<a name="id745427"></a>
-            <a class="link" href="erase.html#range.reference.algorithms.new.erase.description">Description</a>
+<h6>
+<a name="range.reference.algorithms.new.erase.h1"></a>
+            <span><a name="range.reference.algorithms.new.erase.description"></a></span><a class="link" href="erase.html#range.reference.algorithms.new.erase.description">Description</a>
           </h6>
 <p>
             <code class="computeroutput"><span class="identifier">erase</span></code> the iterator range
@@ -57,24 +56,24 @@
             <code class="computeroutput"><span class="identifier">remove_erase_if</span></code> performs
             the frequently used combination equivalent to <code class="computeroutput"><span class="identifier">target</span><span class="special">.</span><span class="identifier">erase</span><span class="special">(</span><span class="identifier">std</span><span class="special">::</span><span class="identifier">remove_if</span><span class="special">(</span><span class="identifier">target</span><span class="special">.</span><span class="identifier">begin</span><span class="special">(),</span> <span class="identifier">target</span><span class="special">.</span><span class="identifier">end</span><span class="special">(),</span> <span class="identifier">pred</span><span class="special">),</span> <span class="identifier">target</span><span class="special">.</span><span class="identifier">end</span><span class="special">());</span></code>
           </p>
-<a name="range.reference.algorithms.new.erase.definition"></a><h6>
-<a name="id745727"></a>
-            <a class="link" href="erase.html#range.reference.algorithms.new.erase.definition">Definition</a>
+<h6>
+<a name="range.reference.algorithms.new.erase.h2"></a>
+            <span><a name="range.reference.algorithms.new.erase.definition"></a></span><a class="link" href="erase.html#range.reference.algorithms.new.erase.definition">Definition</a>
           </h6>
 <p>
             Defined in the header file <code class="computeroutput"><span class="identifier">boost</span><span class="special">/</span><span class="identifier">range</span><span class="special">/</span><span class="identifier">algorithm_ext</span><span class="special">/</span><span class="identifier">erase</span><span class="special">.</span><span class="identifier">hpp</span></code>
           </p>
-<a name="range.reference.algorithms.new.erase.requirements"></a><h6>
-<a name="id745796"></a>
-            <a class="link" href="erase.html#range.reference.algorithms.new.erase.requirements">Requirements</a>
+<h6>
+<a name="range.reference.algorithms.new.erase.h3"></a>
+            <span><a name="range.reference.algorithms.new.erase.requirements"></a></span><a class="link" href="erase.html#range.reference.algorithms.new.erase.requirements">Requirements</a>
           </h6>
 <div class="orderedlist"><ol class="orderedlist" type="1"><li class="listitem">
                 <code class="computeroutput"><span class="identifier">Container</span></code> supports
                 erase of an iterator range.
               </li></ol></div>
-<a name="range.reference.algorithms.new.erase.complexity"></a><h6>
-<a name="id745840"></a>
-            <a class="link" href="erase.html#range.reference.algorithms.new.erase.complexity">Complexity</a>
+<h6>
+<a name="range.reference.algorithms.new.erase.h4"></a>
+            <span><a name="range.reference.algorithms.new.erase.complexity"></a></span><a class="link" href="erase.html#range.reference.algorithms.new.erase.complexity">Complexity</a>
           </h6>
 <p>
             Linear. Proprotional to <code class="computeroutput"><span class="identifier">distance</span><span class="special">(</span><span class="identifier">to_erase</span><span class="special">)</span></code>.
@@ -82,7 +81,8 @@
 </div>
 <table xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" width="100%"><tr>
 <td align="left"></td>
-<td align="right"><div class="copyright-footer">Copyright &#169; 2003 -2010 Thorsten Ottosen, Neil Groves<p>
+<td align="right"><div class="copyright-footer">Copyright &#169; 2003-2010 Thorsten Ottosen,
+      Neil Groves<p>
         Distributed under the Boost Software License, Version 1.0. (See accompanying
         file LICENSE_1_0.txt or copy at <a href="http://www.boost.org/LICENSE_1_0.txt" target="_top">http://www.boost.org/LICENSE_1_0.txt</a>)
       </p>
diff --git a/doc/html/range/reference/algorithms/new/for_each.html b/doc/html/range/reference/algorithms/new/for_each.html
index 58885de..f966248 100644
--- a/doc/html/range/reference/algorithms/new/for_each.html
+++ b/doc/html/range/reference/algorithms/new/for_each.html
@@ -22,16 +22,15 @@
 <div class="spirit-nav">
 <a accesskey="p" href="erase.html"><img src="../../../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../new.html"><img src="../../../../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../../../../index.html"><img src="../../../../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="insert.html"><img src="../../../../../../../../doc/src/images/next.png" alt="Next"></a>
 </div>
-<div class="section">
+<div class="section range_reference_algorithms_new_for_each">
 <div class="titlepage"><div><div><h5 class="title">
 <a name="range.reference.algorithms.new.for_each"></a><a class="link" href="for_each.html" title="for_each">for_each</a>
 </h5></div></div></div>
-<a name="range.reference.algorithms.new.for_each.prototype"></a><h6>
-<a name="id745904"></a>
-            <a class="link" href="for_each.html#range.reference.algorithms.new.for_each.prototype">Prototype</a>
+<h6>
+<a name="range.reference.algorithms.new.for_each.h0"></a>
+            <span><a name="range.reference.algorithms.new.for_each.prototype"></a></span><a class="link" href="for_each.html#range.reference.algorithms.new.for_each.prototype">Prototype</a>
           </h6>
 <p>
-            
 </p>
 <pre class="programlisting"><span class="keyword">template</span><span class="special">&lt;</span>
     <span class="keyword">class</span> <span class="identifier">SinglePassRange1</span><span class="special">,</span>
@@ -71,9 +70,9 @@
 </pre>
 <p>
           </p>
-<a name="range.reference.algorithms.new.for_each.description"></a><h6>
-<a name="id746478"></a>
-            <a class="link" href="for_each.html#range.reference.algorithms.new.for_each.description">Description</a>
+<h6>
+<a name="range.reference.algorithms.new.for_each.h1"></a>
+            <span><a name="range.reference.algorithms.new.for_each.description"></a></span><a class="link" href="for_each.html#range.reference.algorithms.new.for_each.description">Description</a>
           </h6>
 <p>
             <code class="computeroutput"><span class="identifier">for_each</span></code> traverses forward
@@ -87,16 +86,16 @@
             Iteration is stopped upon reaching the end of the shorter of <code class="computeroutput"><span class="identifier">rng1</span></code>, or <code class="computeroutput"><span class="identifier">rng2</span></code>.
             It is safe to call this function with unequal length ranges.
           </p>
-<a name="range.reference.algorithms.new.for_each.definition"></a><h6>
-<a name="id746634"></a>
-            <a class="link" href="for_each.html#range.reference.algorithms.new.for_each.definition">Definition</a>
+<h6>
+<a name="range.reference.algorithms.new.for_each.h2"></a>
+            <span><a name="range.reference.algorithms.new.for_each.definition"></a></span><a class="link" href="for_each.html#range.reference.algorithms.new.for_each.definition">Definition</a>
           </h6>
 <p>
             Defined in the header file <code class="computeroutput"><span class="identifier">boost</span><span class="special">/</span><span class="identifier">range</span><span class="special">/</span><span class="identifier">algorithm_ext</span><span class="special">/</span><span class="identifier">for_each</span><span class="special">.</span><span class="identifier">hpp</span></code>
           </p>
-<a name="range.reference.algorithms.new.for_each.requirements"></a><h6>
-<a name="id746705"></a>
-            <a class="link" href="for_each.html#range.reference.algorithms.new.for_each.requirements">Requirements</a>
+<h6>
+<a name="range.reference.algorithms.new.for_each.h3"></a>
+            <span><a name="range.reference.algorithms.new.for_each.requirements"></a></span><a class="link" href="for_each.html#range.reference.algorithms.new.for_each.requirements">Requirements</a>
           </h6>
 <div class="orderedlist"><ol class="orderedlist" type="1">
 <li class="listitem">
@@ -124,9 +123,9 @@
                 second argument type.
               </li>
 </ol></div>
-<a name="range.reference.algorithms.new.for_each.complexity"></a><h6>
-<a name="id746866"></a>
-            <a class="link" href="for_each.html#range.reference.algorithms.new.for_each.complexity">Complexity</a>
+<h6>
+<a name="range.reference.algorithms.new.for_each.h4"></a>
+            <span><a name="range.reference.algorithms.new.for_each.complexity"></a></span><a class="link" href="for_each.html#range.reference.algorithms.new.for_each.complexity">Complexity</a>
           </h6>
 <p>
             Linear. Exactly <code class="computeroutput"><span class="identifier">min</span><span class="special">(</span><span class="identifier">distance</span><span class="special">(</span><span class="identifier">rng1</span><span class="special">),</span> <span class="identifier">distance</span><span class="special">(</span><span class="identifier">rng2</span><span class="special">))</span></code>
@@ -135,7 +134,8 @@
 </div>
 <table xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" width="100%"><tr>
 <td align="left"></td>
-<td align="right"><div class="copyright-footer">Copyright &#169; 2003 -2010 Thorsten Ottosen, Neil Groves<p>
+<td align="right"><div class="copyright-footer">Copyright &#169; 2003-2010 Thorsten Ottosen,
+      Neil Groves<p>
         Distributed under the Boost Software License, Version 1.0. (See accompanying
         file LICENSE_1_0.txt or copy at <a href="http://www.boost.org/LICENSE_1_0.txt" target="_top">http://www.boost.org/LICENSE_1_0.txt</a>)
       </p>
diff --git a/doc/html/range/reference/algorithms/new/insert.html b/doc/html/range/reference/algorithms/new/insert.html
index e702ab7..2b9751e 100644
--- a/doc/html/range/reference/algorithms/new/insert.html
+++ b/doc/html/range/reference/algorithms/new/insert.html
@@ -22,16 +22,15 @@
 <div class="spirit-nav">
 <a accesskey="p" href="for_each.html"><img src="../../../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../new.html"><img src="../../../../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../../../../index.html"><img src="../../../../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="iota.html"><img src="../../../../../../../../doc/src/images/next.png" alt="Next"></a>
 </div>
-<div class="section">
+<div class="section range_reference_algorithms_new_insert">
 <div class="titlepage"><div><div><h5 class="title">
 <a name="range.reference.algorithms.new.insert"></a><a class="link" href="insert.html" title="insert">insert</a>
 </h5></div></div></div>
-<a name="range.reference.algorithms.new.insert.prototype"></a><h6>
-<a name="id746969"></a>
-            <a class="link" href="insert.html#range.reference.algorithms.new.insert.prototype">Prototype</a>
+<h6>
+<a name="range.reference.algorithms.new.insert.h0"></a>
+            <span><a name="range.reference.algorithms.new.insert.prototype"></a></span><a class="link" href="insert.html#range.reference.algorithms.new.insert.prototype">Prototype</a>
           </h6>
 <p>
-            
 </p>
 <pre class="programlisting"><span class="keyword">template</span><span class="special">&lt;</span>
     <span class="keyword">class</span> <span class="identifier">Container</span><span class="special">,</span>
@@ -43,9 +42,9 @@
 </pre>
 <p>
           </p>
-<a name="range.reference.algorithms.new.insert.description"></a><h6>
-<a name="id747139"></a>
-            <a class="link" href="insert.html#range.reference.algorithms.new.insert.description">Description</a>
+<h6>
+<a name="range.reference.algorithms.new.insert.h1"></a>
+            <span><a name="range.reference.algorithms.new.insert.description"></a></span><a class="link" href="insert.html#range.reference.algorithms.new.insert.description">Description</a>
           </h6>
 <p>
             <code class="computeroutput"><span class="identifier">insert</span></code> all of the elements
@@ -53,16 +52,16 @@
             the <code class="computeroutput"><span class="identifier">before</span></code> iterator into
             <code class="computeroutput"><span class="identifier">target</span></code>.
           </p>
-<a name="range.reference.algorithms.new.insert.definition"></a><h6>
-<a name="id747205"></a>
-            <a class="link" href="insert.html#range.reference.algorithms.new.insert.definition">Definition</a>
+<h6>
+<a name="range.reference.algorithms.new.insert.h2"></a>
+            <span><a name="range.reference.algorithms.new.insert.definition"></a></span><a class="link" href="insert.html#range.reference.algorithms.new.insert.definition">Definition</a>
           </h6>
 <p>
             Defined in the header file <code class="computeroutput"><span class="identifier">boost</span><span class="special">/</span><span class="identifier">range</span><span class="special">/</span><span class="identifier">algorithm_ext</span><span class="special">/</span><span class="identifier">insert</span><span class="special">.</span><span class="identifier">hpp</span></code>
           </p>
-<a name="range.reference.algorithms.new.insert.requirements"></a><h6>
-<a name="id747275"></a>
-            <a class="link" href="insert.html#range.reference.algorithms.new.insert.requirements">Requirements</a>
+<h6>
+<a name="range.reference.algorithms.new.insert.h3"></a>
+            <span><a name="range.reference.algorithms.new.insert.requirements"></a></span><a class="link" href="insert.html#range.reference.algorithms.new.insert.requirements">Requirements</a>
           </h6>
 <div class="orderedlist"><ol class="orderedlist" type="1">
 <li class="listitem">
@@ -80,9 +79,9 @@
                 value type.
               </li>
 </ol></div>
-<a name="range.reference.algorithms.new.insert.complexity"></a><h6>
-<a name="id747373"></a>
-            <a class="link" href="insert.html#range.reference.algorithms.new.insert.complexity">Complexity</a>
+<h6>
+<a name="range.reference.algorithms.new.insert.h4"></a>
+            <span><a name="range.reference.algorithms.new.insert.complexity"></a></span><a class="link" href="insert.html#range.reference.algorithms.new.insert.complexity">Complexity</a>
           </h6>
 <p>
             Linear. <code class="computeroutput"><span class="identifier">distance</span><span class="special">(</span><span class="identifier">from</span><span class="special">)</span></code>
@@ -91,7 +90,8 @@
 </div>
 <table xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" width="100%"><tr>
 <td align="left"></td>
-<td align="right"><div class="copyright-footer">Copyright &#169; 2003 -2010 Thorsten Ottosen, Neil Groves<p>
+<td align="right"><div class="copyright-footer">Copyright &#169; 2003-2010 Thorsten Ottosen,
+      Neil Groves<p>
         Distributed under the Boost Software License, Version 1.0. (See accompanying
         file LICENSE_1_0.txt or copy at <a href="http://www.boost.org/LICENSE_1_0.txt" target="_top">http://www.boost.org/LICENSE_1_0.txt</a>)
       </p>
diff --git a/doc/html/range/reference/algorithms/new/iota.html b/doc/html/range/reference/algorithms/new/iota.html
index 47054f4..d288499 100644
--- a/doc/html/range/reference/algorithms/new/iota.html
+++ b/doc/html/range/reference/algorithms/new/iota.html
@@ -22,25 +22,24 @@
 <div class="spirit-nav">
 <a accesskey="p" href="insert.html"><img src="../../../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../new.html"><img src="../../../../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../../../../index.html"><img src="../../../../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="is_sorted.html"><img src="../../../../../../../../doc/src/images/next.png" alt="Next"></a>
 </div>
-<div class="section">
+<div class="section range_reference_algorithms_new_iota">
 <div class="titlepage"><div><div><h5 class="title">
 <a name="range.reference.algorithms.new.iota"></a><a class="link" href="iota.html" title="iota">iota</a>
 </h5></div></div></div>
-<a name="range.reference.algorithms.new.iota.prototype"></a><h6>
-<a name="id747438"></a>
-            <a class="link" href="iota.html#range.reference.algorithms.new.iota.prototype">Prototype</a>
+<h6>
+<a name="range.reference.algorithms.new.iota.h0"></a>
+            <span><a name="range.reference.algorithms.new.iota.prototype"></a></span><a class="link" href="iota.html#range.reference.algorithms.new.iota.prototype">Prototype</a>
           </h6>
 <p>
-            
 </p>
 <pre class="programlisting"><span class="keyword">template</span><span class="special">&lt;</span><span class="keyword">class</span> <span class="identifier">ForwardRange</span><span class="special">,</span> <span class="keyword">class</span> <span class="identifier">Value</span><span class="special">&gt;</span>
 <span class="identifier">ForwardRange</span><span class="special">&amp;</span> <span class="identifier">iota</span><span class="special">(</span><span class="identifier">ForwardRange</span><span class="special">&amp;</span> <span class="identifier">rng</span><span class="special">,</span> <span class="identifier">Value</span> <span class="identifier">x</span><span class="special">);</span>
 </pre>
 <p>
           </p>
-<a name="range.reference.algorithms.new.iota.description"></a><h6>
-<a name="id747564"></a>
-            <a class="link" href="iota.html#range.reference.algorithms.new.iota.description">Description</a>
+<h6>
+<a name="range.reference.algorithms.new.iota.h1"></a>
+            <span><a name="range.reference.algorithms.new.iota.description"></a></span><a class="link" href="iota.html#range.reference.algorithms.new.iota.description">Description</a>
           </h6>
 <p>
             <code class="computeroutput"><span class="identifier">iota</span></code> traverses forward
@@ -49,16 +48,16 @@
             is assigned a value equivalent to <code class="computeroutput"><span class="identifier">x</span>
             <span class="special">+</span> <span class="identifier">boost</span><span class="special">::</span><span class="identifier">distance</span><span class="special">(</span><span class="identifier">boost</span><span class="special">::</span><span class="identifier">begin</span><span class="special">(</span><span class="identifier">rng</span><span class="special">),</span> <span class="identifier">it</span><span class="special">)</span></code>
           </p>
-<a name="range.reference.algorithms.new.iota.definition"></a><h6>
-<a name="id747700"></a>
-            <a class="link" href="iota.html#range.reference.algorithms.new.iota.definition">Definition</a>
+<h6>
+<a name="range.reference.algorithms.new.iota.h2"></a>
+            <span><a name="range.reference.algorithms.new.iota.definition"></a></span><a class="link" href="iota.html#range.reference.algorithms.new.iota.definition">Definition</a>
           </h6>
 <p>
             Defined in the header file <code class="computeroutput"><span class="identifier">boost</span><span class="special">/</span><span class="identifier">range</span><span class="special">/</span><span class="identifier">algorithm_ext</span><span class="special">/</span><span class="identifier">iota</span><span class="special">.</span><span class="identifier">hpp</span></code>
           </p>
-<a name="range.reference.algorithms.new.iota.requirements"></a><h6>
-<a name="id747770"></a>
-            <a class="link" href="iota.html#range.reference.algorithms.new.iota.requirements">Requirements</a>
+<h6>
+<a name="range.reference.algorithms.new.iota.h3"></a>
+            <span><a name="range.reference.algorithms.new.iota.requirements"></a></span><a class="link" href="iota.html#range.reference.algorithms.new.iota.requirements">Requirements</a>
           </h6>
 <div class="orderedlist"><ol class="orderedlist" type="1">
 <li class="listitem">
@@ -72,9 +71,9 @@
                 Concept.
               </li>
 </ol></div>
-<a name="range.reference.algorithms.new.iota.complexity"></a><h6>
-<a name="id747850"></a>
-            <a class="link" href="iota.html#range.reference.algorithms.new.iota.complexity">Complexity</a>
+<h6>
+<a name="range.reference.algorithms.new.iota.h4"></a>
+            <span><a name="range.reference.algorithms.new.iota.complexity"></a></span><a class="link" href="iota.html#range.reference.algorithms.new.iota.complexity">Complexity</a>
           </h6>
 <p>
             Linear. Exactly <code class="computeroutput"><span class="identifier">distance</span><span class="special">(</span><span class="identifier">rng</span><span class="special">)</span></code> assignments into <code class="computeroutput"><span class="identifier">rng</span></code>.
@@ -82,7 +81,8 @@
 </div>
 <table xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" width="100%"><tr>
 <td align="left"></td>
-<td align="right"><div class="copyright-footer">Copyright &#169; 2003 -2010 Thorsten Ottosen, Neil Groves<p>
+<td align="right"><div class="copyright-footer">Copyright &#169; 2003-2010 Thorsten Ottosen,
+      Neil Groves<p>
         Distributed under the Boost Software License, Version 1.0. (See accompanying
         file LICENSE_1_0.txt or copy at <a href="http://www.boost.org/LICENSE_1_0.txt" target="_top">http://www.boost.org/LICENSE_1_0.txt</a>)
       </p>
diff --git a/doc/html/range/reference/algorithms/new/is_sorted.html b/doc/html/range/reference/algorithms/new/is_sorted.html
index 41d6bdc..9a68551 100644
--- a/doc/html/range/reference/algorithms/new/is_sorted.html
+++ b/doc/html/range/reference/algorithms/new/is_sorted.html
@@ -22,16 +22,15 @@
 <div class="spirit-nav">
 <a accesskey="p" href="iota.html"><img src="../../../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../new.html"><img src="../../../../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../../../../index.html"><img src="../../../../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="overwrite.html"><img src="../../../../../../../../doc/src/images/next.png" alt="Next"></a>
 </div>
-<div class="section">
+<div class="section range_reference_algorithms_new_is_sorted">
 <div class="titlepage"><div><div><h5 class="title">
 <a name="range.reference.algorithms.new.is_sorted"></a><a class="link" href="is_sorted.html" title="is_sorted">is_sorted</a>
 </h5></div></div></div>
-<a name="range.reference.algorithms.new.is_sorted.prototype"></a><h6>
-<a name="id747924"></a>
-            <a class="link" href="is_sorted.html#range.reference.algorithms.new.is_sorted.prototype">Prototype</a>
+<h6>
+<a name="range.reference.algorithms.new.is_sorted.h0"></a>
+            <span><a name="range.reference.algorithms.new.is_sorted.prototype"></a></span><a class="link" href="is_sorted.html#range.reference.algorithms.new.is_sorted.prototype">Prototype</a>
           </h6>
 <p>
-            
 </p>
 <pre class="programlisting"><span class="keyword">template</span><span class="special">&lt;</span><span class="keyword">class</span> <span class="identifier">SinglePassRange</span><span class="special">&gt;</span>
 <span class="keyword">bool</span> <span class="identifier">is_sorted</span><span class="special">(</span><span class="keyword">const</span> <span class="identifier">SinglePassRange</span><span class="special">&amp;</span> <span class="identifier">rng</span><span class="special">);</span>
@@ -41,9 +40,9 @@
 </pre>
 <p>
           </p>
-<a name="range.reference.algorithms.new.is_sorted.description"></a><h6>
-<a name="id748118"></a>
-            <a class="link" href="is_sorted.html#range.reference.algorithms.new.is_sorted.description">Description</a>
+<h6>
+<a name="range.reference.algorithms.new.is_sorted.h1"></a>
+            <span><a name="range.reference.algorithms.new.is_sorted.description"></a></span><a class="link" href="is_sorted.html#range.reference.algorithms.new.is_sorted.description">Description</a>
           </h6>
 <p>
             <code class="computeroutput"><span class="identifier">is_sorted</span></code> determines
@@ -57,16 +56,16 @@
             the expression <code class="computeroutput"><span class="identifier">pred</span><span class="special">(</span><span class="identifier">x</span><span class="special">,</span><span class="identifier">y</span><span class="special">)</span></code>
             is <code class="computeroutput"><span class="keyword">true</span></code>.
           </p>
-<a name="range.reference.algorithms.new.is_sorted.definition"></a><h6>
-<a name="id748306"></a>
-            <a class="link" href="is_sorted.html#range.reference.algorithms.new.is_sorted.definition">Definition</a>
+<h6>
+<a name="range.reference.algorithms.new.is_sorted.h2"></a>
+            <span><a name="range.reference.algorithms.new.is_sorted.definition"></a></span><a class="link" href="is_sorted.html#range.reference.algorithms.new.is_sorted.definition">Definition</a>
           </h6>
 <p>
             Defined in the header file <code class="computeroutput"><span class="identifier">boost</span><span class="special">/</span><span class="identifier">range</span><span class="special">/</span><span class="identifier">algorithm_ext</span><span class="special">/</span><span class="identifier">is_sorted</span><span class="special">.</span><span class="identifier">hpp</span></code>
           </p>
-<a name="range.reference.algorithms.new.is_sorted.requirements"></a><h6>
-<a name="id748376"></a>
-            <a class="link" href="is_sorted.html#range.reference.algorithms.new.is_sorted.requirements">Requirements</a>
+<h6>
+<a name="range.reference.algorithms.new.is_sorted.h3"></a>
+            <span><a name="range.reference.algorithms.new.is_sorted.requirements"></a></span><a class="link" href="is_sorted.html#range.reference.algorithms.new.is_sorted.requirements">Requirements</a>
           </h6>
 <div class="orderedlist"><ol class="orderedlist" type="1">
 <li class="listitem">
@@ -84,9 +83,9 @@
                 is convertible to both argument types of <code class="computeroutput"><span class="identifier">BinaryPredicate</span></code>.
               </li>
 </ol></div>
-<a name="range.reference.algorithms.new.is_sorted.complexity"></a><h6>
-<a name="id748485"></a>
-            <a class="link" href="is_sorted.html#range.reference.algorithms.new.is_sorted.complexity">Complexity</a>
+<h6>
+<a name="range.reference.algorithms.new.is_sorted.h4"></a>
+            <span><a name="range.reference.algorithms.new.is_sorted.complexity"></a></span><a class="link" href="is_sorted.html#range.reference.algorithms.new.is_sorted.complexity">Complexity</a>
           </h6>
 <p>
             Linear. A maximum of <code class="computeroutput"><span class="identifier">distance</span><span class="special">(</span><span class="identifier">rng</span><span class="special">)</span></code> comparisons are performed.
@@ -94,7 +93,8 @@
 </div>
 <table xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" width="100%"><tr>
 <td align="left"></td>
-<td align="right"><div class="copyright-footer">Copyright &#169; 2003 -2010 Thorsten Ottosen, Neil Groves<p>
+<td align="right"><div class="copyright-footer">Copyright &#169; 2003-2010 Thorsten Ottosen,
+      Neil Groves<p>
         Distributed under the Boost Software License, Version 1.0. (See accompanying
         file LICENSE_1_0.txt or copy at <a href="http://www.boost.org/LICENSE_1_0.txt" target="_top">http://www.boost.org/LICENSE_1_0.txt</a>)
       </p>
diff --git a/doc/html/range/reference/algorithms/new/overwrite.html b/doc/html/range/reference/algorithms/new/overwrite.html
index 7fa22b4..8691998 100644
--- a/doc/html/range/reference/algorithms/new/overwrite.html
+++ b/doc/html/range/reference/algorithms/new/overwrite.html
@@ -22,16 +22,15 @@
 <div class="spirit-nav">
 <a accesskey="p" href="is_sorted.html"><img src="../../../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../new.html"><img src="../../../../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../../../../index.html"><img src="../../../../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="push_back.html"><img src="../../../../../../../../doc/src/images/next.png" alt="Next"></a>
 </div>
-<div class="section">
+<div class="section range_reference_algorithms_new_overwrite">
 <div class="titlepage"><div><div><h5 class="title">
 <a name="range.reference.algorithms.new.overwrite"></a><a class="link" href="overwrite.html" title="overwrite">overwrite</a>
 </h5></div></div></div>
-<a name="range.reference.algorithms.new.overwrite.prototype"></a><h6>
-<a name="id748550"></a>
-            <a class="link" href="overwrite.html#range.reference.algorithms.new.overwrite.prototype">Prototype</a>
+<h6>
+<a name="range.reference.algorithms.new.overwrite.h0"></a>
+            <span><a name="range.reference.algorithms.new.overwrite.prototype"></a></span><a class="link" href="overwrite.html#range.reference.algorithms.new.overwrite.prototype">Prototype</a>
           </h6>
 <p>
-            
 </p>
 <pre class="programlisting"><span class="keyword">template</span><span class="special">&lt;</span>
     <span class="keyword">class</span> <span class="identifier">SinglePassRange1</span><span class="special">,</span>
@@ -42,25 +41,25 @@
 </pre>
 <p>
           </p>
-<a name="range.reference.algorithms.new.overwrite.description"></a><h6>
-<a name="id748683"></a>
-            <a class="link" href="overwrite.html#range.reference.algorithms.new.overwrite.description">Description</a>
+<h6>
+<a name="range.reference.algorithms.new.overwrite.h1"></a>
+            <span><a name="range.reference.algorithms.new.overwrite.description"></a></span><a class="link" href="overwrite.html#range.reference.algorithms.new.overwrite.description">Description</a>
           </h6>
 <p>
             <code class="computeroutput"><span class="identifier">overwrite</span></code> assigns the
             values from the range <code class="computeroutput"><span class="identifier">from</span></code>
             into the range <code class="computeroutput"><span class="identifier">to</span></code>.
           </p>
-<a name="range.reference.algorithms.new.overwrite.definition"></a><h6>
-<a name="id748739"></a>
-            <a class="link" href="overwrite.html#range.reference.algorithms.new.overwrite.definition">Definition</a>
+<h6>
+<a name="range.reference.algorithms.new.overwrite.h2"></a>
+            <span><a name="range.reference.algorithms.new.overwrite.definition"></a></span><a class="link" href="overwrite.html#range.reference.algorithms.new.overwrite.definition">Definition</a>
           </h6>
 <p>
             Defined in the header file <code class="computeroutput"><span class="identifier">boost</span><span class="special">/</span><span class="identifier">range</span><span class="special">/</span><span class="identifier">algorithm_ext</span><span class="special">/</span><span class="identifier">overwrite</span><span class="special">.</span><span class="identifier">hpp</span></code>
           </p>
-<a name="range.reference.algorithms.new.overwrite.requirements"></a><h6>
-<a name="id748810"></a>
-            <a class="link" href="overwrite.html#range.reference.algorithms.new.overwrite.requirements">Requirements</a>
+<h6>
+<a name="range.reference.algorithms.new.overwrite.h3"></a>
+            <span><a name="range.reference.algorithms.new.overwrite.requirements"></a></span><a class="link" href="overwrite.html#range.reference.algorithms.new.overwrite.requirements">Requirements</a>
           </h6>
 <div class="orderedlist"><ol class="orderedlist" type="1">
 <li class="listitem">
@@ -87,9 +86,9 @@
                 value type.
               </li>
 </ol></div>
-<a name="range.reference.algorithms.new.overwrite.complexity"></a><h6>
-<a name="id748987"></a>
-            <a class="link" href="overwrite.html#range.reference.algorithms.new.overwrite.complexity">Complexity</a>
+<h6>
+<a name="range.reference.algorithms.new.overwrite.h4"></a>
+            <span><a name="range.reference.algorithms.new.overwrite.complexity"></a></span><a class="link" href="overwrite.html#range.reference.algorithms.new.overwrite.complexity">Complexity</a>
           </h6>
 <p>
             Linear. <code class="computeroutput"><span class="identifier">distance</span><span class="special">(</span><span class="identifier">rng1</span><span class="special">)</span></code>
@@ -98,7 +97,8 @@
 </div>
 <table xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" width="100%"><tr>
 <td align="left"></td>
-<td align="right"><div class="copyright-footer">Copyright &#169; 2003 -2010 Thorsten Ottosen, Neil Groves<p>
+<td align="right"><div class="copyright-footer">Copyright &#169; 2003-2010 Thorsten Ottosen,
+      Neil Groves<p>
         Distributed under the Boost Software License, Version 1.0. (See accompanying
         file LICENSE_1_0.txt or copy at <a href="http://www.boost.org/LICENSE_1_0.txt" target="_top">http://www.boost.org/LICENSE_1_0.txt</a>)
       </p>
diff --git a/doc/html/range/reference/algorithms/new/push_back.html b/doc/html/range/reference/algorithms/new/push_back.html
index a348b93..92d559c 100644
--- a/doc/html/range/reference/algorithms/new/push_back.html
+++ b/doc/html/range/reference/algorithms/new/push_back.html
@@ -22,16 +22,15 @@
 <div class="spirit-nav">
 <a accesskey="p" href="overwrite.html"><img src="../../../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../new.html"><img src="../../../../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../../../../index.html"><img src="../../../../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="push_front.html"><img src="../../../../../../../../doc/src/images/next.png" alt="Next"></a>
 </div>
-<div class="section">
+<div class="section range_reference_algorithms_new_push_back">
 <div class="titlepage"><div><div><h5 class="title">
 <a name="range.reference.algorithms.new.push_back"></a><a class="link" href="push_back.html" title="push_back">push_back</a>
 </h5></div></div></div>
-<a name="range.reference.algorithms.new.push_back.prototype"></a><h6>
-<a name="id749051"></a>
-            <a class="link" href="push_back.html#range.reference.algorithms.new.push_back.prototype">Prototype</a>
+<h6>
+<a name="range.reference.algorithms.new.push_back.h0"></a>
+            <span><a name="range.reference.algorithms.new.push_back.prototype"></a></span><a class="link" href="push_back.html#range.reference.algorithms.new.push_back.prototype">Prototype</a>
           </h6>
 <p>
-            
 </p>
 <pre class="programlisting"><span class="keyword">template</span><span class="special">&lt;</span>
     <span class="keyword">class</span> <span class="identifier">Container</span><span class="special">,</span>
@@ -42,25 +41,25 @@
 </pre>
 <p>
           </p>
-<a name="range.reference.algorithms.new.push_back.description"></a><h6>
-<a name="id749190"></a>
-            <a class="link" href="push_back.html#range.reference.algorithms.new.push_back.description">Description</a>
+<h6>
+<a name="range.reference.algorithms.new.push_back.h1"></a>
+            <span><a name="range.reference.algorithms.new.push_back.description"></a></span><a class="link" href="push_back.html#range.reference.algorithms.new.push_back.description">Description</a>
           </h6>
 <p>
             <code class="computeroutput"><span class="identifier">push_back</span></code> all of the
             elements in the range <code class="computeroutput"><span class="identifier">from</span></code>
             to the back of the container <code class="computeroutput"><span class="identifier">target</span></code>.
           </p>
-<a name="range.reference.algorithms.new.push_back.definition"></a><h6>
-<a name="id749246"></a>
-            <a class="link" href="push_back.html#range.reference.algorithms.new.push_back.definition">Definition</a>
+<h6>
+<a name="range.reference.algorithms.new.push_back.h2"></a>
+            <span><a name="range.reference.algorithms.new.push_back.definition"></a></span><a class="link" href="push_back.html#range.reference.algorithms.new.push_back.definition">Definition</a>
           </h6>
 <p>
             Defined in the header file <code class="computeroutput"><span class="identifier">boost</span><span class="special">/</span><span class="identifier">range</span><span class="special">/</span><span class="identifier">algorithm_ext</span><span class="special">/</span><span class="identifier">push_back</span><span class="special">.</span><span class="identifier">hpp</span></code>
           </p>
-<a name="range.reference.algorithms.new.push_back.requirements"></a><h6>
-<a name="id749316"></a>
-            <a class="link" href="push_back.html#range.reference.algorithms.new.push_back.requirements">Requirements</a>
+<h6>
+<a name="range.reference.algorithms.new.push_back.h3"></a>
+            <span><a name="range.reference.algorithms.new.push_back.requirements"></a></span><a class="link" href="push_back.html#range.reference.algorithms.new.push_back.requirements">Requirements</a>
           </h6>
 <div class="orderedlist"><ol class="orderedlist" type="1">
 <li class="listitem">
@@ -78,9 +77,9 @@
                 value type.
               </li>
 </ol></div>
-<a name="range.reference.algorithms.new.push_back.complexity"></a><h6>
-<a name="id749427"></a>
-            <a class="link" href="push_back.html#range.reference.algorithms.new.push_back.complexity">Complexity</a>
+<h6>
+<a name="range.reference.algorithms.new.push_back.h4"></a>
+            <span><a name="range.reference.algorithms.new.push_back.complexity"></a></span><a class="link" href="push_back.html#range.reference.algorithms.new.push_back.complexity">Complexity</a>
           </h6>
 <p>
             Linear. <code class="computeroutput"><span class="identifier">distance</span><span class="special">(</span><span class="identifier">from</span><span class="special">)</span></code>
@@ -89,7 +88,8 @@
 </div>
 <table xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" width="100%"><tr>
 <td align="left"></td>
-<td align="right"><div class="copyright-footer">Copyright &#169; 2003 -2010 Thorsten Ottosen, Neil Groves<p>
+<td align="right"><div class="copyright-footer">Copyright &#169; 2003-2010 Thorsten Ottosen,
+      Neil Groves<p>
         Distributed under the Boost Software License, Version 1.0. (See accompanying
         file LICENSE_1_0.txt or copy at <a href="http://www.boost.org/LICENSE_1_0.txt" target="_top">http://www.boost.org/LICENSE_1_0.txt</a>)
       </p>
diff --git a/doc/html/range/reference/algorithms/new/push_front.html b/doc/html/range/reference/algorithms/new/push_front.html
index ab4b48b..768d1a1 100644
--- a/doc/html/range/reference/algorithms/new/push_front.html
+++ b/doc/html/range/reference/algorithms/new/push_front.html
@@ -22,16 +22,15 @@
 <div class="spirit-nav">
 <a accesskey="p" href="push_back.html"><img src="../../../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../new.html"><img src="../../../../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../../../../index.html"><img src="../../../../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="remove_erase.html"><img src="../../../../../../../../doc/src/images/next.png" alt="Next"></a>
 </div>
-<div class="section">
+<div class="section range_reference_algorithms_new_push_front">
 <div class="titlepage"><div><div><h5 class="title">
 <a name="range.reference.algorithms.new.push_front"></a><a class="link" href="push_front.html" title="push_front">push_front</a>
 </h5></div></div></div>
-<a name="range.reference.algorithms.new.push_front.prototype"></a><h6>
-<a name="id749493"></a>
-            <a class="link" href="push_front.html#range.reference.algorithms.new.push_front.prototype">Prototype</a>
+<h6>
+<a name="range.reference.algorithms.new.push_front.h0"></a>
+            <span><a name="range.reference.algorithms.new.push_front.prototype"></a></span><a class="link" href="push_front.html#range.reference.algorithms.new.push_front.prototype">Prototype</a>
           </h6>
 <p>
-            
 </p>
 <pre class="programlisting"><span class="keyword">template</span><span class="special">&lt;</span>
     <span class="keyword">class</span> <span class="identifier">Container</span><span class="special">,</span>
@@ -42,25 +41,25 @@
 </pre>
 <p>
           </p>
-<a name="range.reference.algorithms.new.push_front.description"></a><h6>
-<a name="id749631"></a>
-            <a class="link" href="push_front.html#range.reference.algorithms.new.push_front.description">Description</a>
+<h6>
+<a name="range.reference.algorithms.new.push_front.h1"></a>
+            <span><a name="range.reference.algorithms.new.push_front.description"></a></span><a class="link" href="push_front.html#range.reference.algorithms.new.push_front.description">Description</a>
           </h6>
 <p>
             <code class="computeroutput"><span class="identifier">push_front</span></code> all of the
             elements in the range <code class="computeroutput"><span class="identifier">from</span></code>
             to the front of the container <code class="computeroutput"><span class="identifier">target</span></code>.
           </p>
-<a name="range.reference.algorithms.new.push_front.definition"></a><h6>
-<a name="id749686"></a>
-            <a class="link" href="push_front.html#range.reference.algorithms.new.push_front.definition">Definition</a>
+<h6>
+<a name="range.reference.algorithms.new.push_front.h2"></a>
+            <span><a name="range.reference.algorithms.new.push_front.definition"></a></span><a class="link" href="push_front.html#range.reference.algorithms.new.push_front.definition">Definition</a>
           </h6>
 <p>
             Defined in the header file <code class="computeroutput"><span class="identifier">boost</span><span class="special">/</span><span class="identifier">range</span><span class="special">/</span><span class="identifier">algorithm_ext</span><span class="special">/</span><span class="identifier">push_front</span><span class="special">.</span><span class="identifier">hpp</span></code>
           </p>
-<a name="range.reference.algorithms.new.push_front.requirements"></a><h6>
-<a name="id749755"></a>
-            <a class="link" href="push_front.html#range.reference.algorithms.new.push_front.requirements">Requirements</a>
+<h6>
+<a name="range.reference.algorithms.new.push_front.h3"></a>
+            <span><a name="range.reference.algorithms.new.push_front.requirements"></a></span><a class="link" href="push_front.html#range.reference.algorithms.new.push_front.requirements">Requirements</a>
           </h6>
 <div class="orderedlist"><ol class="orderedlist" type="1">
 <li class="listitem">
@@ -78,9 +77,9 @@
                 value type.
               </li>
 </ol></div>
-<a name="range.reference.algorithms.new.push_front.complexity"></a><h6>
-<a name="id749868"></a>
-            <a class="link" href="push_front.html#range.reference.algorithms.new.push_front.complexity">Complexity</a>
+<h6>
+<a name="range.reference.algorithms.new.push_front.h4"></a>
+            <span><a name="range.reference.algorithms.new.push_front.complexity"></a></span><a class="link" href="push_front.html#range.reference.algorithms.new.push_front.complexity">Complexity</a>
           </h6>
 <p>
             Linear. <code class="computeroutput"><span class="identifier">distance</span><span class="special">(</span><span class="identifier">from</span><span class="special">)</span></code>
@@ -89,7 +88,8 @@
 </div>
 <table xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" width="100%"><tr>
 <td align="left"></td>
-<td align="right"><div class="copyright-footer">Copyright &#169; 2003 -2010 Thorsten Ottosen, Neil Groves<p>
+<td align="right"><div class="copyright-footer">Copyright &#169; 2003-2010 Thorsten Ottosen,
+      Neil Groves<p>
         Distributed under the Boost Software License, Version 1.0. (See accompanying
         file LICENSE_1_0.txt or copy at <a href="http://www.boost.org/LICENSE_1_0.txt" target="_top">http://www.boost.org/LICENSE_1_0.txt</a>)
       </p>
diff --git a/doc/html/range/reference/algorithms/new/remove_erase.html b/doc/html/range/reference/algorithms/new/remove_erase.html
index e09216b..a1114ee 100644
--- a/doc/html/range/reference/algorithms/new/remove_erase.html
+++ b/doc/html/range/reference/algorithms/new/remove_erase.html
@@ -22,16 +22,15 @@
 <div class="spirit-nav">
 <a accesskey="p" href="push_front.html"><img src="../../../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../new.html"><img src="../../../../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../../../../index.html"><img src="../../../../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="remove_erase_if.html"><img src="../../../../../../../../doc/src/images/next.png" alt="Next"></a>
 </div>
-<div class="section">
+<div class="section range_reference_algorithms_new_remove_erase">
 <div class="titlepage"><div><div><h5 class="title">
 <a name="range.reference.algorithms.new.remove_erase"></a><a class="link" href="remove_erase.html" title="remove_erase">remove_erase</a>
 </h5></div></div></div>
-<a name="range.reference.algorithms.new.remove_erase.prototype"></a><h6>
-<a name="id749933"></a>
-            <a class="link" href="remove_erase.html#range.reference.algorithms.new.remove_erase.prototype">Prototype</a>
+<h6>
+<a name="range.reference.algorithms.new.remove_erase.h0"></a>
+            <span><a name="range.reference.algorithms.new.remove_erase.prototype"></a></span><a class="link" href="remove_erase.html#range.reference.algorithms.new.remove_erase.prototype">Prototype</a>
           </h6>
 <p>
-            
 </p>
 <pre class="programlisting"><span class="keyword">template</span><span class="special">&lt;</span><span class="keyword">class</span> <span class="identifier">Container</span><span class="special">,</span> <span class="keyword">class</span> <span class="identifier">Value</span><span class="special">&gt;</span>
 <span class="identifier">Container</span><span class="special">&amp;</span> <span class="identifier">remove_erase</span><span class="special">(</span><span class="identifier">Container</span><span class="special">&amp;</span> <span class="identifier">target</span><span class="special">,</span>
@@ -39,9 +38,9 @@
 </pre>
 <p>
           </p>
-<a name="range.reference.algorithms.new.remove_erase.description"></a><h6>
-<a name="id750070"></a>
-            <a class="link" href="remove_erase.html#range.reference.algorithms.new.remove_erase.description">Description</a>
+<h6>
+<a name="range.reference.algorithms.new.remove_erase.h1"></a>
+            <span><a name="range.reference.algorithms.new.remove_erase.description"></a></span><a class="link" href="remove_erase.html#range.reference.algorithms.new.remove_erase.description">Description</a>
           </h6>
 <p>
             <code class="computeroutput"><span class="identifier">remove_erase</span></code> actually
@@ -49,24 +48,24 @@
             from the container. This is in contrast to the <code class="computeroutput"><span class="identifier">remove</span></code>
             algorithm which merely rearranges elements.
           </p>
-<a name="range.reference.algorithms.new.remove_erase.definition"></a><h6>
-<a name="id750126"></a>
-            <a class="link" href="remove_erase.html#range.reference.algorithms.new.remove_erase.definition">Definition</a>
+<h6>
+<a name="range.reference.algorithms.new.remove_erase.h2"></a>
+            <span><a name="range.reference.algorithms.new.remove_erase.definition"></a></span><a class="link" href="remove_erase.html#range.reference.algorithms.new.remove_erase.definition">Definition</a>
           </h6>
 <p>
             Defined in the header file <code class="computeroutput"><span class="identifier">boost</span><span class="special">/</span><span class="identifier">range</span><span class="special">/</span><span class="identifier">algorithm_ext</span><span class="special">/</span><span class="identifier">erase</span><span class="special">.</span><span class="identifier">hpp</span></code>
           </p>
-<a name="range.reference.algorithms.new.remove_erase.requirements"></a><h6>
-<a name="id750197"></a>
-            <a class="link" href="remove_erase.html#range.reference.algorithms.new.remove_erase.requirements">Requirements</a>
+<h6>
+<a name="range.reference.algorithms.new.remove_erase.h3"></a>
+            <span><a name="range.reference.algorithms.new.remove_erase.requirements"></a></span><a class="link" href="remove_erase.html#range.reference.algorithms.new.remove_erase.requirements">Requirements</a>
           </h6>
 <div class="orderedlist"><ol class="orderedlist" type="1"><li class="listitem">
                 <code class="computeroutput"><span class="identifier">Container</span></code> supports
                 erase of an iterator range.
               </li></ol></div>
-<a name="range.reference.algorithms.new.remove_erase.complexity"></a><h6>
-<a name="id750242"></a>
-            <a class="link" href="remove_erase.html#range.reference.algorithms.new.remove_erase.complexity">Complexity</a>
+<h6>
+<a name="range.reference.algorithms.new.remove_erase.h4"></a>
+            <span><a name="range.reference.algorithms.new.remove_erase.complexity"></a></span><a class="link" href="remove_erase.html#range.reference.algorithms.new.remove_erase.complexity">Complexity</a>
           </h6>
 <p>
             Linear. Proportional to <code class="computeroutput"><span class="identifier">distance</span><span class="special">(</span><span class="identifier">target</span><span class="special">)</span></code>s.
@@ -74,7 +73,8 @@
 </div>
 <table xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" width="100%"><tr>
 <td align="left"></td>
-<td align="right"><div class="copyright-footer">Copyright &#169; 2003 -2010 Thorsten Ottosen, Neil Groves<p>
+<td align="right"><div class="copyright-footer">Copyright &#169; 2003-2010 Thorsten Ottosen,
+      Neil Groves<p>
         Distributed under the Boost Software License, Version 1.0. (See accompanying
         file LICENSE_1_0.txt or copy at <a href="http://www.boost.org/LICENSE_1_0.txt" target="_top">http://www.boost.org/LICENSE_1_0.txt</a>)
       </p>
diff --git a/doc/html/range/reference/algorithms/new/remove_erase_if.html b/doc/html/range/reference/algorithms/new/remove_erase_if.html
index bf13441..4f24e48 100644
--- a/doc/html/range/reference/algorithms/new/remove_erase_if.html
+++ b/doc/html/range/reference/algorithms/new/remove_erase_if.html
@@ -22,16 +22,15 @@
 <div class="spirit-nav">
 <a accesskey="p" href="remove_erase.html"><img src="../../../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../new.html"><img src="../../../../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../../../../index.html"><img src="../../../../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="../numeric.html"><img src="../../../../../../../../doc/src/images/next.png" alt="Next"></a>
 </div>
-<div class="section">
+<div class="section range_reference_algorithms_new_remove_erase_if">
 <div class="titlepage"><div><div><h5 class="title">
 <a name="range.reference.algorithms.new.remove_erase_if"></a><a class="link" href="remove_erase_if.html" title="remove_erase_if">remove_erase_if</a>
 </h5></div></div></div>
-<a name="range.reference.algorithms.new.remove_erase_if.prototype"></a><h6>
-<a name="id750307"></a>
-            <a class="link" href="remove_erase_if.html#range.reference.algorithms.new.remove_erase_if.prototype">Prototype</a>
+<h6>
+<a name="range.reference.algorithms.new.remove_erase_if.h0"></a>
+            <span><a name="range.reference.algorithms.new.remove_erase_if.prototype"></a></span><a class="link" href="remove_erase_if.html#range.reference.algorithms.new.remove_erase_if.prototype">Prototype</a>
           </h6>
 <p>
-            
 </p>
 <pre class="programlisting"><span class="keyword">template</span><span class="special">&lt;</span><span class="keyword">class</span> <span class="identifier">Container</span><span class="special">,</span> <span class="keyword">class</span> <span class="identifier">Pred</span><span class="special">&gt;</span>
 <span class="identifier">Container</span><span class="special">&amp;</span> <span class="identifier">remove_erase_if</span><span class="special">(</span><span class="identifier">Container</span><span class="special">&amp;</span> <span class="identifier">target</span><span class="special">,</span>
@@ -39,9 +38,9 @@
 </pre>
 <p>
           </p>
-<a name="range.reference.algorithms.new.remove_erase_if.description"></a><h6>
-<a name="id750434"></a>
-            <a class="link" href="remove_erase_if.html#range.reference.algorithms.new.remove_erase_if.description">Description</a>
+<h6>
+<a name="range.reference.algorithms.new.remove_erase_if.h1"></a>
+            <span><a name="range.reference.algorithms.new.remove_erase_if.description"></a></span><a class="link" href="remove_erase_if.html#range.reference.algorithms.new.remove_erase_if.description">Description</a>
           </h6>
 <p>
             <code class="computeroutput"><span class="identifier">remove_erase_if</span></code> removes
@@ -50,16 +49,16 @@
             from the container. This is in contrast to the <code class="computeroutput"><span class="identifier">erase</span></code>
             algorithm which merely rearranges elements.
           </p>
-<a name="range.reference.algorithms.new.remove_erase_if.definition"></a><h6>
-<a name="id750514"></a>
-            <a class="link" href="remove_erase_if.html#range.reference.algorithms.new.remove_erase_if.definition">Definition</a>
+<h6>
+<a name="range.reference.algorithms.new.remove_erase_if.h2"></a>
+            <span><a name="range.reference.algorithms.new.remove_erase_if.definition"></a></span><a class="link" href="remove_erase_if.html#range.reference.algorithms.new.remove_erase_if.definition">Definition</a>
           </h6>
 <p>
             Defined in the header file <code class="computeroutput"><span class="identifier">boost</span><span class="special">/</span><span class="identifier">range</span><span class="special">/</span><span class="identifier">algorithm_ext</span><span class="special">/</span><span class="identifier">erase</span><span class="special">.</span><span class="identifier">hpp</span></code>
           </p>
-<a name="range.reference.algorithms.new.remove_erase_if.requirements"></a><h6>
-<a name="id750585"></a>
-            <a class="link" href="remove_erase_if.html#range.reference.algorithms.new.remove_erase_if.requirements">Requirements</a>
+<h6>
+<a name="range.reference.algorithms.new.remove_erase_if.h3"></a>
+            <span><a name="range.reference.algorithms.new.remove_erase_if.requirements"></a></span><a class="link" href="remove_erase_if.html#range.reference.algorithms.new.remove_erase_if.requirements">Requirements</a>
           </h6>
 <div class="orderedlist"><ol class="orderedlist" type="1">
 <li class="listitem">
@@ -71,9 +70,9 @@
                 the <code class="computeroutput"><span class="identifier">Predicate</span></code> Concept.
               </li>
 </ol></div>
-<a name="range.reference.algorithms.new.remove_erase_if.complexity"></a><h6>
-<a name="id750659"></a>
-            <a class="link" href="remove_erase_if.html#range.reference.algorithms.new.remove_erase_if.complexity">Complexity</a>
+<h6>
+<a name="range.reference.algorithms.new.remove_erase_if.h4"></a>
+            <span><a name="range.reference.algorithms.new.remove_erase_if.complexity"></a></span><a class="link" href="remove_erase_if.html#range.reference.algorithms.new.remove_erase_if.complexity">Complexity</a>
           </h6>
 <p>
             Linear. Proportional to <code class="computeroutput"><span class="identifier">distance</span><span class="special">(</span><span class="identifier">target</span><span class="special">)</span></code>s.
@@ -81,7 +80,8 @@
 </div>
 <table xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" width="100%"><tr>
 <td align="left"></td>
-<td align="right"><div class="copyright-footer">Copyright &#169; 2003 -2010 Thorsten Ottosen, Neil Groves<p>
+<td align="right"><div class="copyright-footer">Copyright &#169; 2003-2010 Thorsten Ottosen,
+      Neil Groves<p>
         Distributed under the Boost Software License, Version 1.0. (See accompanying
         file LICENSE_1_0.txt or copy at <a href="http://www.boost.org/LICENSE_1_0.txt" target="_top">http://www.boost.org/LICENSE_1_0.txt</a>)
       </p>
diff --git a/doc/html/range/reference/algorithms/non_mutating.html b/doc/html/range/reference/algorithms/non_mutating.html
index aca1179..8c70627 100644
--- a/doc/html/range/reference/algorithms/non_mutating.html
+++ b/doc/html/range/reference/algorithms/non_mutating.html
@@ -22,7 +22,7 @@
 <div class="spirit-nav">
 <a accesskey="p" href="mutating/unique_copy.html"><img src="../../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../algorithms.html"><img src="../../../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../../../index.html"><img src="../../../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="non_mutating/adjacent_find.html"><img src="../../../../../../../doc/src/images/next.png" alt="Next"></a>
 </div>
-<div class="section">
+<div class="section range_reference_algorithms_non_mutating">
 <div class="titlepage"><div><div><h4 class="title">
 <a name="range.reference.algorithms.non_mutating"></a><a class="link" href="non_mutating.html" title="Non-mutating algorithms">Non-mutating
         algorithms</a>
@@ -51,7 +51,8 @@
 </div>
 <table xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" width="100%"><tr>
 <td align="left"></td>
-<td align="right"><div class="copyright-footer">Copyright &#169; 2003 -2010 Thorsten Ottosen, Neil Groves<p>
+<td align="right"><div class="copyright-footer">Copyright &#169; 2003-2010 Thorsten Ottosen,
+      Neil Groves<p>
         Distributed under the Boost Software License, Version 1.0. (See accompanying
         file LICENSE_1_0.txt or copy at <a href="http://www.boost.org/LICENSE_1_0.txt" target="_top">http://www.boost.org/LICENSE_1_0.txt</a>)
       </p>
diff --git a/doc/html/range/reference/algorithms/non_mutating/adjacent_find.html b/doc/html/range/reference/algorithms/non_mutating/adjacent_find.html
index d8489ad..362f347 100644
--- a/doc/html/range/reference/algorithms/non_mutating/adjacent_find.html
+++ b/doc/html/range/reference/algorithms/non_mutating/adjacent_find.html
@@ -22,16 +22,15 @@
 <div class="spirit-nav">
 <a accesskey="p" href="../non_mutating.html"><img src="../../../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../non_mutating.html"><img src="../../../../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../../../../index.html"><img src="../../../../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="binary_search.html"><img src="../../../../../../../../doc/src/images/next.png" alt="Next"></a>
 </div>
-<div class="section">
+<div class="section range_reference_algorithms_non_mutating_adjacent_find">
 <div class="titlepage"><div><div><h5 class="title">
 <a name="range.reference.algorithms.non_mutating.adjacent_find"></a><a class="link" href="adjacent_find.html" title="adjacent_find">adjacent_find</a>
 </h5></div></div></div>
-<a name="range.reference.algorithms.non_mutating.adjacent_find.prototype"></a><h6>
-<a name="id711185"></a>
-            <a class="link" href="adjacent_find.html#range.reference.algorithms.non_mutating.adjacent_find.prototype">Prototype</a>
+<h6>
+<a name="range.reference.algorithms.non_mutating.adjacent_find.h0"></a>
+            <span><a name="range.reference.algorithms.non_mutating.adjacent_find.prototype"></a></span><a class="link" href="adjacent_find.html#range.reference.algorithms.non_mutating.adjacent_find.prototype">Prototype</a>
           </h6>
 <p>
-            
 </p>
 <pre class="programlisting"><span class="keyword">template</span><span class="special">&lt;</span><span class="keyword">class</span> <span class="identifier">ForwardRange</span><span class="special">&gt;</span>
 <span class="keyword">typename</span> <span class="identifier">range_iterator</span><span class="special">&lt;</span><span class="identifier">ForwardRange</span><span class="special">&gt;::</span><span class="identifier">type</span>
@@ -75,9 +74,9 @@
 </pre>
 <p>
           </p>
-<a name="range.reference.algorithms.non_mutating.adjacent_find.description"></a><h6>
-<a name="id712162"></a>
-            <a class="link" href="adjacent_find.html#range.reference.algorithms.non_mutating.adjacent_find.description">Description</a>
+<h6>
+<a name="range.reference.algorithms.non_mutating.adjacent_find.h1"></a>
+            <span><a name="range.reference.algorithms.non_mutating.adjacent_find.description"></a></span><a class="link" href="adjacent_find.html#range.reference.algorithms.non_mutating.adjacent_find.description">Description</a>
           </h6>
 <p>
             <span class="bold"><strong>Non-predicate versions:</strong></span>
@@ -96,16 +95,16 @@
             in <code class="computeroutput"><span class="identifier">rng</span></code> where <code class="computeroutput"><span class="identifier">pred</span><span class="special">(</span><span class="identifier">x</span><span class="special">,</span><span class="identifier">y</span><span class="special">)</span></code>
             is <code class="computeroutput"><span class="keyword">true</span></code>.
           </p>
-<a name="range.reference.algorithms.non_mutating.adjacent_find.definition"></a><h6>
-<a name="id712369"></a>
-            <a class="link" href="adjacent_find.html#range.reference.algorithms.non_mutating.adjacent_find.definition">Definition</a>
+<h6>
+<a name="range.reference.algorithms.non_mutating.adjacent_find.h2"></a>
+            <span><a name="range.reference.algorithms.non_mutating.adjacent_find.definition"></a></span><a class="link" href="adjacent_find.html#range.reference.algorithms.non_mutating.adjacent_find.definition">Definition</a>
           </h6>
 <p>
             Defined in the header file <code class="computeroutput"><span class="identifier">boost</span><span class="special">/</span><span class="identifier">range</span><span class="special">/</span><span class="identifier">algorithm</span><span class="special">/</span><span class="identifier">adjacent_find</span><span class="special">.</span><span class="identifier">hpp</span></code>
           </p>
-<a name="range.reference.algorithms.non_mutating.adjacent_find.requirements"></a><h6>
-<a name="id712440"></a>
-            <a class="link" href="adjacent_find.html#range.reference.algorithms.non_mutating.adjacent_find.requirements">Requirements</a>
+<h6>
+<a name="range.reference.algorithms.non_mutating.adjacent_find.h3"></a>
+            <span><a name="range.reference.algorithms.non_mutating.adjacent_find.requirements"></a></span><a class="link" href="adjacent_find.html#range.reference.algorithms.non_mutating.adjacent_find.requirements">Requirements</a>
           </h6>
 <p>
             <span class="bold"><strong>For the non-predicate versions of adjacent_find:</strong></span>
@@ -141,9 +140,9 @@
                 second argument type.
               </li>
 </ul></div>
-<a name="range.reference.algorithms.non_mutating.adjacent_find.complexity"></a><h6>
-<a name="id712629"></a>
-            <a class="link" href="adjacent_find.html#range.reference.algorithms.non_mutating.adjacent_find.complexity">Complexity</a>
+<h6>
+<a name="range.reference.algorithms.non_mutating.adjacent_find.h4"></a>
+            <span><a name="range.reference.algorithms.non_mutating.adjacent_find.complexity"></a></span><a class="link" href="adjacent_find.html#range.reference.algorithms.non_mutating.adjacent_find.complexity">Complexity</a>
           </h6>
 <p>
             Linear. If <code class="computeroutput"><span class="identifier">empty</span><span class="special">(</span><span class="identifier">rng</span><span class="special">)</span></code>
@@ -153,7 +152,8 @@
 </div>
 <table xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" width="100%"><tr>
 <td align="left"></td>
-<td align="right"><div class="copyright-footer">Copyright &#169; 2003 -2010 Thorsten Ottosen, Neil Groves<p>
+<td align="right"><div class="copyright-footer">Copyright &#169; 2003-2010 Thorsten Ottosen,
+      Neil Groves<p>
         Distributed under the Boost Software License, Version 1.0. (See accompanying
         file LICENSE_1_0.txt or copy at <a href="http://www.boost.org/LICENSE_1_0.txt" target="_top">http://www.boost.org/LICENSE_1_0.txt</a>)
       </p>
diff --git a/doc/html/range/reference/algorithms/non_mutating/binary_search.html b/doc/html/range/reference/algorithms/non_mutating/binary_search.html
index 2429e96..66bc3f1 100644
--- a/doc/html/range/reference/algorithms/non_mutating/binary_search.html
+++ b/doc/html/range/reference/algorithms/non_mutating/binary_search.html
@@ -22,16 +22,15 @@
 <div class="spirit-nav">
 <a accesskey="p" href="adjacent_find.html"><img src="../../../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../non_mutating.html"><img src="../../../../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../../../../index.html"><img src="../../../../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="count.html"><img src="../../../../../../../../doc/src/images/next.png" alt="Next"></a>
 </div>
-<div class="section">
+<div class="section range_reference_algorithms_non_mutating_binary_search">
 <div class="titlepage"><div><div><h5 class="title">
 <a name="range.reference.algorithms.non_mutating.binary_search"></a><a class="link" href="binary_search.html" title="binary_search">binary_search</a>
 </h5></div></div></div>
-<a name="range.reference.algorithms.non_mutating.binary_search.prototype"></a><h6>
-<a name="id712729"></a>
-            <a class="link" href="binary_search.html#range.reference.algorithms.non_mutating.binary_search.prototype">Prototype</a>
+<h6>
+<a name="range.reference.algorithms.non_mutating.binary_search.h0"></a>
+            <span><a name="range.reference.algorithms.non_mutating.binary_search.prototype"></a></span><a class="link" href="binary_search.html#range.reference.algorithms.non_mutating.binary_search.prototype">Prototype</a>
           </h6>
 <p>
-            
 </p>
 <pre class="programlisting"><span class="keyword">template</span><span class="special">&lt;</span><span class="keyword">class</span> <span class="identifier">ForwardRange</span><span class="special">,</span> <span class="keyword">class</span> <span class="identifier">Value</span><span class="special">&gt;</span>
 <span class="keyword">bool</span> <span class="identifier">binary_search</span><span class="special">(</span><span class="keyword">const</span> <span class="identifier">ForwardRange</span><span class="special">&amp;</span> <span class="identifier">rng</span><span class="special">,</span> <span class="keyword">const</span> <span class="identifier">Value</span><span class="special">&amp;</span> <span class="identifier">val</span><span class="special">);</span>
@@ -41,9 +40,9 @@
 </pre>
 <p>
           </p>
-<a name="range.reference.algorithms.non_mutating.binary_search.description"></a><h6>
-<a name="id713006"></a>
-            <a class="link" href="binary_search.html#range.reference.algorithms.non_mutating.binary_search.description">Description</a>
+<h6>
+<a name="range.reference.algorithms.non_mutating.binary_search.h1"></a>
+            <span><a name="range.reference.algorithms.non_mutating.binary_search.description"></a></span><a class="link" href="binary_search.html#range.reference.algorithms.non_mutating.binary_search.description">Description</a>
           </h6>
 <p>
             <code class="computeroutput"><span class="identifier">binary_search</span></code> returns
@@ -51,16 +50,16 @@
             value <code class="computeroutput"><span class="identifier">val</span></code> exists in the
             range <code class="computeroutput"><span class="identifier">rng</span></code>.
           </p>
-<a name="range.reference.algorithms.non_mutating.binary_search.definition"></a><h6>
-<a name="id713072"></a>
-            <a class="link" href="binary_search.html#range.reference.algorithms.non_mutating.binary_search.definition">Definition</a>
+<h6>
+<a name="range.reference.algorithms.non_mutating.binary_search.h2"></a>
+            <span><a name="range.reference.algorithms.non_mutating.binary_search.definition"></a></span><a class="link" href="binary_search.html#range.reference.algorithms.non_mutating.binary_search.definition">Definition</a>
           </h6>
 <p>
             Defined in the header file <code class="computeroutput"><span class="identifier">boost</span><span class="special">/</span><span class="identifier">range</span><span class="special">/</span><span class="identifier">algorithm</span><span class="special">/</span><span class="identifier">binary_search</span><span class="special">.</span><span class="identifier">hpp</span></code>
           </p>
-<a name="range.reference.algorithms.non_mutating.binary_search.requirements"></a><h6>
-<a name="id713142"></a>
-            <a class="link" href="binary_search.html#range.reference.algorithms.non_mutating.binary_search.requirements">Requirements</a>
+<h6>
+<a name="range.reference.algorithms.non_mutating.binary_search.h3"></a>
+            <span><a name="range.reference.algorithms.non_mutating.binary_search.requirements"></a></span><a class="link" href="binary_search.html#range.reference.algorithms.non_mutating.binary_search.requirements">Requirements</a>
           </h6>
 <p>
             <span class="bold"><strong>For the non-predicate versions of binary_search:</strong></span>
@@ -109,9 +108,9 @@
                 argument type.
               </li>
 </ul></div>
-<a name="range.reference.algorithms.non_mutating.binary_search.precondition_"></a><h6>
-<a name="id713411"></a>
-            <a class="link" href="binary_search.html#range.reference.algorithms.non_mutating.binary_search.precondition_">Precondition:</a>
+<h6>
+<a name="range.reference.algorithms.non_mutating.binary_search.h4"></a>
+            <span><a name="range.reference.algorithms.non_mutating.binary_search.precondition_"></a></span><a class="link" href="binary_search.html#range.reference.algorithms.non_mutating.binary_search.precondition_">Precondition:</a>
           </h6>
 <p>
             <span class="bold"><strong>For the non-predicate version:</strong></span>
@@ -127,9 +126,9 @@
             <code class="computeroutput"><span class="identifier">rng</span></code> is ordered in ascending
             order according to the function object <code class="computeroutput"><span class="identifier">pred</span></code>.
           </p>
-<a name="range.reference.algorithms.non_mutating.binary_search.complexity"></a><h6>
-<a name="id713503"></a>
-            <a class="link" href="binary_search.html#range.reference.algorithms.non_mutating.binary_search.complexity">Complexity</a>
+<h6>
+<a name="range.reference.algorithms.non_mutating.binary_search.h5"></a>
+            <span><a name="range.reference.algorithms.non_mutating.binary_search.complexity"></a></span><a class="link" href="binary_search.html#range.reference.algorithms.non_mutating.binary_search.complexity">Complexity</a>
           </h6>
 <p>
             For non-random-access ranges, the complexity is <code class="computeroutput"><span class="identifier">O</span><span class="special">(</span><span class="identifier">N</span><span class="special">)</span></code> where <code class="computeroutput"><span class="identifier">N</span></code>
@@ -142,7 +141,8 @@
 </div>
 <table xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" width="100%"><tr>
 <td align="left"></td>
-<td align="right"><div class="copyright-footer">Copyright &#169; 2003 -2010 Thorsten Ottosen, Neil Groves<p>
+<td align="right"><div class="copyright-footer">Copyright &#169; 2003-2010 Thorsten Ottosen,
+      Neil Groves<p>
         Distributed under the Boost Software License, Version 1.0. (See accompanying
         file LICENSE_1_0.txt or copy at <a href="http://www.boost.org/LICENSE_1_0.txt" target="_top">http://www.boost.org/LICENSE_1_0.txt</a>)
       </p>
diff --git a/doc/html/range/reference/algorithms/non_mutating/count.html b/doc/html/range/reference/algorithms/non_mutating/count.html
index 9ce79d3..6cb448c 100644
--- a/doc/html/range/reference/algorithms/non_mutating/count.html
+++ b/doc/html/range/reference/algorithms/non_mutating/count.html
@@ -22,16 +22,15 @@
 <div class="spirit-nav">
 <a accesskey="p" href="binary_search.html"><img src="../../../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../non_mutating.html"><img src="../../../../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../../../../index.html"><img src="../../../../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="count_if.html"><img src="../../../../../../../../doc/src/images/next.png" alt="Next"></a>
 </div>
-<div class="section">
+<div class="section range_reference_algorithms_non_mutating_count">
 <div class="titlepage"><div><div><h5 class="title">
 <a name="range.reference.algorithms.non_mutating.count"></a><a class="link" href="count.html" title="count">count</a>
 </h5></div></div></div>
-<a name="range.reference.algorithms.non_mutating.count.prototype"></a><h6>
-<a name="id713666"></a>
-            <a class="link" href="count.html#range.reference.algorithms.non_mutating.count.prototype">Prototype</a>
+<h6>
+<a name="range.reference.algorithms.non_mutating.count.h0"></a>
+            <span><a name="range.reference.algorithms.non_mutating.count.prototype"></a></span><a class="link" href="count.html#range.reference.algorithms.non_mutating.count.prototype">Prototype</a>
           </h6>
 <p>
-            
 </p>
 <pre class="programlisting"><span class="keyword">template</span><span class="special">&lt;</span><span class="keyword">class</span> <span class="identifier">SinglePassRange</span><span class="special">,</span> <span class="keyword">class</span> <span class="identifier">Value</span><span class="special">&gt;</span>
 <span class="keyword">typename</span> <span class="identifier">range_difference</span><span class="special">&lt;</span><span class="identifier">SinglePassRange</span><span class="special">&gt;::</span><span class="identifier">type</span>
@@ -43,9 +42,9 @@
 </pre>
 <p>
           </p>
-<a name="range.reference.algorithms.non_mutating.count.description"></a><h6>
-<a name="id713960"></a>
-            <a class="link" href="count.html#range.reference.algorithms.non_mutating.count.description">Description</a>
+<h6>
+<a name="range.reference.algorithms.non_mutating.count.h1"></a>
+            <span><a name="range.reference.algorithms.non_mutating.count.description"></a></span><a class="link" href="count.html#range.reference.algorithms.non_mutating.count.description">Description</a>
           </h6>
 <p>
             <code class="computeroutput"><span class="identifier">count</span></code> returns the number
@@ -53,16 +52,16 @@
             <span class="special">==</span> <span class="identifier">val</span></code>
             is <code class="computeroutput"><span class="keyword">true</span></code>.
           </p>
-<a name="range.reference.algorithms.non_mutating.count.definition"></a><h6>
-<a name="id714048"></a>
-            <a class="link" href="count.html#range.reference.algorithms.non_mutating.count.definition">Definition</a>
+<h6>
+<a name="range.reference.algorithms.non_mutating.count.h2"></a>
+            <span><a name="range.reference.algorithms.non_mutating.count.definition"></a></span><a class="link" href="count.html#range.reference.algorithms.non_mutating.count.definition">Definition</a>
           </h6>
 <p>
             Defined in the header file <code class="computeroutput"><span class="identifier">boost</span><span class="special">/</span><span class="identifier">range</span><span class="special">/</span><span class="identifier">algorithm</span><span class="special">/</span><span class="identifier">count</span><span class="special">.</span><span class="identifier">hpp</span></code>
           </p>
-<a name="range.reference.algorithms.non_mutating.count.requirements"></a><h6>
-<a name="id714118"></a>
-            <a class="link" href="count.html#range.reference.algorithms.non_mutating.count.requirements">Requirements</a>
+<h6>
+<a name="range.reference.algorithms.non_mutating.count.h3"></a>
+            <span><a name="range.reference.algorithms.non_mutating.count.requirements"></a></span><a class="link" href="count.html#range.reference.algorithms.non_mutating.count.requirements">Requirements</a>
           </h6>
 <div class="itemizedlist"><ul class="itemizedlist" type="disc">
 <li class="listitem">
@@ -83,9 +82,9 @@
                 value type can be compared for equality with an object of type <code class="computeroutput"><span class="identifier">Value</span></code>.
               </li>
 </ul></div>
-<a name="range.reference.algorithms.non_mutating.count.complexity"></a><h6>
-<a name="id714250"></a>
-            <a class="link" href="count.html#range.reference.algorithms.non_mutating.count.complexity">Complexity</a>
+<h6>
+<a name="range.reference.algorithms.non_mutating.count.h4"></a>
+            <span><a name="range.reference.algorithms.non_mutating.count.complexity"></a></span><a class="link" href="count.html#range.reference.algorithms.non_mutating.count.complexity">Complexity</a>
           </h6>
 <p>
             Linear. Exactly <code class="computeroutput"><span class="identifier">distance</span><span class="special">(</span><span class="identifier">rng</span><span class="special">)</span></code> comparisons.
@@ -93,7 +92,8 @@
 </div>
 <table xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" width="100%"><tr>
 <td align="left"></td>
-<td align="right"><div class="copyright-footer">Copyright &#169; 2003 -2010 Thorsten Ottosen, Neil Groves<p>
+<td align="right"><div class="copyright-footer">Copyright &#169; 2003-2010 Thorsten Ottosen,
+      Neil Groves<p>
         Distributed under the Boost Software License, Version 1.0. (See accompanying
         file LICENSE_1_0.txt or copy at <a href="http://www.boost.org/LICENSE_1_0.txt" target="_top">http://www.boost.org/LICENSE_1_0.txt</a>)
       </p>
diff --git a/doc/html/range/reference/algorithms/non_mutating/count_if.html b/doc/html/range/reference/algorithms/non_mutating/count_if.html
index 09b3f05..e369daf 100644
--- a/doc/html/range/reference/algorithms/non_mutating/count_if.html
+++ b/doc/html/range/reference/algorithms/non_mutating/count_if.html
@@ -22,16 +22,15 @@
 <div class="spirit-nav">
 <a accesskey="p" href="count.html"><img src="../../../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../non_mutating.html"><img src="../../../../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../../../../index.html"><img src="../../../../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="equal.html"><img src="../../../../../../../../doc/src/images/next.png" alt="Next"></a>
 </div>
-<div class="section">
+<div class="section range_reference_algorithms_non_mutating_count_if">
 <div class="titlepage"><div><div><h5 class="title">
 <a name="range.reference.algorithms.non_mutating.count_if"></a><a class="link" href="count_if.html" title="count_if">count_if</a>
 </h5></div></div></div>
-<a name="range.reference.algorithms.non_mutating.count_if.prototype"></a><h6>
-<a name="id714315"></a>
-            <a class="link" href="count_if.html#range.reference.algorithms.non_mutating.count_if.prototype">Prototype</a>
+<h6>
+<a name="range.reference.algorithms.non_mutating.count_if.h0"></a>
+            <span><a name="range.reference.algorithms.non_mutating.count_if.prototype"></a></span><a class="link" href="count_if.html#range.reference.algorithms.non_mutating.count_if.prototype">Prototype</a>
           </h6>
 <p>
-            
 </p>
 <pre class="programlisting"><span class="keyword">template</span><span class="special">&lt;</span><span class="keyword">class</span> <span class="identifier">SinglePassRange</span><span class="special">,</span> <span class="keyword">class</span> <span class="identifier">UnaryPredicate</span><span class="special">&gt;</span>
 <span class="keyword">typename</span> <span class="identifier">range_difference</span><span class="special">&lt;</span><span class="keyword">const</span> <span class="identifier">SinglePassRange</span><span class="special">&gt;::</span><span class="identifier">type</span>
@@ -39,9 +38,9 @@
 </pre>
 <p>
           </p>
-<a name="range.reference.algorithms.non_mutating.count_if.description"></a><h6>
-<a name="id714472"></a>
-            <a class="link" href="count_if.html#range.reference.algorithms.non_mutating.count_if.description">Description</a>
+<h6>
+<a name="range.reference.algorithms.non_mutating.count_if.h1"></a>
+            <span><a name="range.reference.algorithms.non_mutating.count_if.description"></a></span><a class="link" href="count_if.html#range.reference.algorithms.non_mutating.count_if.description">Description</a>
           </h6>
 <p>
             <code class="computeroutput"><span class="identifier">count_if</span></code> returns the
@@ -49,16 +48,16 @@
             in <code class="computeroutput"><span class="identifier">rng</span></code> where <code class="computeroutput"><span class="identifier">pred</span><span class="special">(</span><span class="identifier">x</span><span class="special">)</span></code>
             is <code class="computeroutput"><span class="keyword">true</span></code>.
           </p>
-<a name="range.reference.algorithms.non_mutating.count_if.definition"></a><h6>
-<a name="id714562"></a>
-            <a class="link" href="count_if.html#range.reference.algorithms.non_mutating.count_if.definition">Definition</a>
+<h6>
+<a name="range.reference.algorithms.non_mutating.count_if.h2"></a>
+            <span><a name="range.reference.algorithms.non_mutating.count_if.definition"></a></span><a class="link" href="count_if.html#range.reference.algorithms.non_mutating.count_if.definition">Definition</a>
           </h6>
 <p>
             Defined in the header file <code class="computeroutput"><span class="identifier">boost</span><span class="special">/</span><span class="identifier">range</span><span class="special">/</span><span class="identifier">algorithm</span><span class="special">/</span><span class="identifier">count_if</span><span class="special">.</span><span class="identifier">hpp</span></code>
           </p>
-<a name="range.reference.algorithms.non_mutating.count_if.requirements"></a><h6>
-<a name="id714631"></a>
-            <a class="link" href="count_if.html#range.reference.algorithms.non_mutating.count_if.requirements">Requirements</a>
+<h6>
+<a name="range.reference.algorithms.non_mutating.count_if.h3"></a>
+            <span><a name="range.reference.algorithms.non_mutating.count_if.requirements"></a></span><a class="link" href="count_if.html#range.reference.algorithms.non_mutating.count_if.requirements">Requirements</a>
           </h6>
 <div class="itemizedlist"><ul class="itemizedlist" type="disc">
 <li class="listitem">
@@ -79,9 +78,9 @@
                 is convertible to the argument type of <code class="computeroutput"><span class="identifier">UnaryPredicate</span></code>.
               </li>
 </ul></div>
-<a name="range.reference.algorithms.non_mutating.count_if.complexity"></a><h6>
-<a name="id714763"></a>
-            <a class="link" href="count_if.html#range.reference.algorithms.non_mutating.count_if.complexity">Complexity</a>
+<h6>
+<a name="range.reference.algorithms.non_mutating.count_if.h4"></a>
+            <span><a name="range.reference.algorithms.non_mutating.count_if.complexity"></a></span><a class="link" href="count_if.html#range.reference.algorithms.non_mutating.count_if.complexity">Complexity</a>
           </h6>
 <p>
             Linear. Exactly <code class="computeroutput"><span class="identifier">distance</span><span class="special">(</span><span class="identifier">rng</span><span class="special">)</span></code> invocations of <code class="computeroutput"><span class="identifier">pred</span></code>.
@@ -89,7 +88,8 @@
 </div>
 <table xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" width="100%"><tr>
 <td align="left"></td>
-<td align="right"><div class="copyright-footer">Copyright &#169; 2003 -2010 Thorsten Ottosen, Neil Groves<p>
+<td align="right"><div class="copyright-footer">Copyright &#169; 2003-2010 Thorsten Ottosen,
+      Neil Groves<p>
         Distributed under the Boost Software License, Version 1.0. (See accompanying
         file LICENSE_1_0.txt or copy at <a href="http://www.boost.org/LICENSE_1_0.txt" target="_top">http://www.boost.org/LICENSE_1_0.txt</a>)
       </p>
diff --git a/doc/html/range/reference/algorithms/non_mutating/equal.html b/doc/html/range/reference/algorithms/non_mutating/equal.html
index 5b555bb..558a19e 100644
--- a/doc/html/range/reference/algorithms/non_mutating/equal.html
+++ b/doc/html/range/reference/algorithms/non_mutating/equal.html
@@ -22,16 +22,15 @@
 <div class="spirit-nav">
 <a accesskey="p" href="count_if.html"><img src="../../../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../non_mutating.html"><img src="../../../../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../../../../index.html"><img src="../../../../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="equal_range.html"><img src="../../../../../../../../doc/src/images/next.png" alt="Next"></a>
 </div>
-<div class="section">
+<div class="section range_reference_algorithms_non_mutating_equal">
 <div class="titlepage"><div><div><h5 class="title">
 <a name="range.reference.algorithms.non_mutating.equal"></a><a class="link" href="equal.html" title="equal">equal</a>
 </h5></div></div></div>
-<a name="range.reference.algorithms.non_mutating.equal.prototype"></a><h6>
-<a name="id714837"></a>
-            <a class="link" href="equal.html#range.reference.algorithms.non_mutating.equal.prototype">Prototype</a>
+<h6>
+<a name="range.reference.algorithms.non_mutating.equal.h0"></a>
+            <span><a name="range.reference.algorithms.non_mutating.equal.prototype"></a></span><a class="link" href="equal.html#range.reference.algorithms.non_mutating.equal.prototype">Prototype</a>
           </h6>
 <p>
-            
 </p>
 <pre class="programlisting"><span class="keyword">template</span><span class="special">&lt;</span>
     <span class="keyword">class</span> <span class="identifier">SinglePassRange1</span><span class="special">,</span>
@@ -51,9 +50,9 @@
 </pre>
 <p>
           </p>
-<a name="range.reference.algorithms.non_mutating.equal.description"></a><h6>
-<a name="id715120"></a>
-            <a class="link" href="equal.html#range.reference.algorithms.non_mutating.equal.description">Description</a>
+<h6>
+<a name="range.reference.algorithms.non_mutating.equal.h1"></a>
+            <span><a name="range.reference.algorithms.non_mutating.equal.description"></a></span><a class="link" href="equal.html#range.reference.algorithms.non_mutating.equal.description">Description</a>
           </h6>
 <p>
             <code class="computeroutput"><span class="identifier">equal</span></code> returns <code class="computeroutput"><span class="keyword">true</span></code> if <code class="computeroutput"><span class="identifier">distance</span><span class="special">(</span><span class="identifier">rng1</span><span class="special">)</span></code> is equal to the <code class="computeroutput"><span class="identifier">distance</span><span class="special">(</span><span class="identifier">rng2</span><span class="special">)</span></code> and for each element <code class="computeroutput"><span class="identifier">x</span></code>
@@ -69,16 +68,16 @@
             returns <code class="computeroutput"><span class="keyword">true</span></code>. Elements are
             considered equal in the predicate version if <code class="computeroutput"><span class="identifier">pred</span><span class="special">(</span><span class="identifier">x</span><span class="special">,</span><span class="identifier">y</span><span class="special">)</span></code> is <code class="computeroutput"><span class="keyword">true</span></code>.
           </p>
-<a name="range.reference.algorithms.non_mutating.equal.definition"></a><h6>
-<a name="id715354"></a>
-            <a class="link" href="equal.html#range.reference.algorithms.non_mutating.equal.definition">Definition</a>
+<h6>
+<a name="range.reference.algorithms.non_mutating.equal.h2"></a>
+            <span><a name="range.reference.algorithms.non_mutating.equal.definition"></a></span><a class="link" href="equal.html#range.reference.algorithms.non_mutating.equal.definition">Definition</a>
           </h6>
 <p>
             Defined in the header file <code class="computeroutput"><span class="identifier">boost</span><span class="special">/</span><span class="identifier">range</span><span class="special">/</span><span class="identifier">algorithm</span><span class="special">/</span><span class="identifier">equal</span><span class="special">.</span><span class="identifier">hpp</span></code>
           </p>
-<a name="range.reference.algorithms.non_mutating.equal.requirements"></a><h6>
-<a name="id715424"></a>
-            <a class="link" href="equal.html#range.reference.algorithms.non_mutating.equal.requirements">Requirements</a>
+<h6>
+<a name="range.reference.algorithms.non_mutating.equal.h3"></a>
+            <span><a name="range.reference.algorithms.non_mutating.equal.requirements"></a></span><a class="link" href="equal.html#range.reference.algorithms.non_mutating.equal.requirements">Requirements</a>
           </h6>
 <p>
             <span class="bold"><strong>For the non-predicate versions:</strong></span>
@@ -137,9 +136,9 @@
                 second argument type.
               </li>
 </ul></div>
-<a name="range.reference.algorithms.non_mutating.equal.complexity"></a><h6>
-<a name="id715734"></a>
-            <a class="link" href="equal.html#range.reference.algorithms.non_mutating.equal.complexity">Complexity</a>
+<h6>
+<a name="range.reference.algorithms.non_mutating.equal.h4"></a>
+            <span><a name="range.reference.algorithms.non_mutating.equal.complexity"></a></span><a class="link" href="equal.html#range.reference.algorithms.non_mutating.equal.complexity">Complexity</a>
           </h6>
 <p>
             Linear. At most <code class="computeroutput"><span class="identifier">min</span><span class="special">(</span><span class="identifier">distance</span><span class="special">(</span><span class="identifier">rng1</span><span class="special">),</span> <span class="identifier">distance</span><span class="special">(</span><span class="identifier">rng2</span><span class="special">))</span></code>
@@ -148,7 +147,8 @@
 </div>
 <table xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" width="100%"><tr>
 <td align="left"></td>
-<td align="right"><div class="copyright-footer">Copyright &#169; 2003 -2010 Thorsten Ottosen, Neil Groves<p>
+<td align="right"><div class="copyright-footer">Copyright &#169; 2003-2010 Thorsten Ottosen,
+      Neil Groves<p>
         Distributed under the Boost Software License, Version 1.0. (See accompanying
         file LICENSE_1_0.txt or copy at <a href="http://www.boost.org/LICENSE_1_0.txt" target="_top">http://www.boost.org/LICENSE_1_0.txt</a>)
       </p>
diff --git a/doc/html/range/reference/algorithms/non_mutating/equal_range.html b/doc/html/range/reference/algorithms/non_mutating/equal_range.html
index bc8ceb3..d8d7b7b 100644
--- a/doc/html/range/reference/algorithms/non_mutating/equal_range.html
+++ b/doc/html/range/reference/algorithms/non_mutating/equal_range.html
@@ -22,16 +22,15 @@
 <div class="spirit-nav">
 <a accesskey="p" href="equal.html"><img src="../../../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../non_mutating.html"><img src="../../../../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../../../../index.html"><img src="../../../../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="for_each.html"><img src="../../../../../../../../doc/src/images/next.png" alt="Next"></a>
 </div>
-<div class="section">
+<div class="section range_reference_algorithms_non_mutating_equal_range">
 <div class="titlepage"><div><div><h5 class="title">
 <a name="range.reference.algorithms.non_mutating.equal_range"></a><a class="link" href="equal_range.html" title="equal_range">equal_range</a>
 </h5></div></div></div>
-<a name="range.reference.algorithms.non_mutating.equal_range.prototype"></a><h6>
-<a name="id715826"></a>
-            <a class="link" href="equal_range.html#range.reference.algorithms.non_mutating.equal_range.prototype">Prototype</a>
+<h6>
+<a name="range.reference.algorithms.non_mutating.equal_range.h0"></a>
+            <span><a name="range.reference.algorithms.non_mutating.equal_range.prototype"></a></span><a class="link" href="equal_range.html#range.reference.algorithms.non_mutating.equal_range.prototype">Prototype</a>
           </h6>
 <p>
-            
 </p>
 <pre class="programlisting"><span class="keyword">template</span><span class="special">&lt;</span>
     <span class="keyword">class</span> <span class="identifier">ForwardRange</span><span class="special">,</span>
@@ -65,13 +64,13 @@
     <span class="special">&gt;</span>
 <span class="identifier">std</span><span class="special">::</span><span class="identifier">pair</span><span class="special">&lt;</span><span class="keyword">typename</span> <span class="identifier">range_iterator</span><span class="special">&lt;</span><span class="keyword">const</span> <span class="identifier">ForwardRange</span><span class="special">&gt;::</span><span class="identifier">type</span><span class="special">,</span>
           <span class="keyword">typename</span> <span class="identifier">range_iterator</span><span class="special">&lt;</span><span class="keyword">const</span> <span class="identifier">ForwardRange</span><span class="special">&gt;::</span><span class="identifier">type</span><span class="special">&gt;</span>
-<span class="identifier">equal_range</span><span class="special">(</span><span class="keyword">const</span> <span class="identifier">ForwardRange</span><span class="special">&amp;</span> <span class="identifier">rng</span><span class="special">,</span> <span class="keyword">const</span> <span class="identifier">Value</span><span class="special">&amp;</span> <span class="identifier">val</span><span class="special">,</span> <span class="identifier">SortPredicate</span> <span class="identifier">pred</span><span class="special">);</span>                      
- </pre>
+<span class="identifier">equal_range</span><span class="special">(</span><span class="keyword">const</span> <span class="identifier">ForwardRange</span><span class="special">&amp;</span> <span class="identifier">rng</span><span class="special">,</span> <span class="keyword">const</span> <span class="identifier">Value</span><span class="special">&amp;</span> <span class="identifier">val</span><span class="special">,</span> <span class="identifier">SortPredicate</span> <span class="identifier">pred</span><span class="special">);</span>
+</pre>
 <p>
           </p>
-<a name="range.reference.algorithms.non_mutating.equal_range.description"></a><h6>
-<a name="id716698"></a>
-            <a class="link" href="equal_range.html#range.reference.algorithms.non_mutating.equal_range.description">Description</a>
+<h6>
+<a name="range.reference.algorithms.non_mutating.equal_range.h1"></a>
+            <span><a name="range.reference.algorithms.non_mutating.equal_range.description"></a></span><a class="link" href="equal_range.html#range.reference.algorithms.non_mutating.equal_range.description">Description</a>
           </h6>
 <p>
             <code class="computeroutput"><span class="identifier">equal_range</span></code> returns a
@@ -83,16 +82,16 @@
             the equality of elements is determined by <code class="computeroutput"><span class="keyword">operator</span><span class="special">&lt;</span></code>. For the predicate versions of <code class="computeroutput"><span class="identifier">equal_range</span></code> the equality of elements
             is determined by <code class="computeroutput"><span class="identifier">pred</span></code>.
           </p>
-<a name="range.reference.algorithms.non_mutating.equal_range.definition"></a><h6>
-<a name="id716841"></a>
-            <a class="link" href="equal_range.html#range.reference.algorithms.non_mutating.equal_range.definition">Definition</a>
+<h6>
+<a name="range.reference.algorithms.non_mutating.equal_range.h2"></a>
+            <span><a name="range.reference.algorithms.non_mutating.equal_range.definition"></a></span><a class="link" href="equal_range.html#range.reference.algorithms.non_mutating.equal_range.definition">Definition</a>
           </h6>
 <p>
             Defined in the header file <code class="computeroutput"><span class="identifier">boost</span><span class="special">/</span><span class="identifier">range</span><span class="special">/</span><span class="identifier">algorithm</span><span class="special">/</span><span class="identifier">equal_range</span><span class="special">.</span><span class="identifier">hpp</span></code>
           </p>
-<a name="range.reference.algorithms.non_mutating.equal_range.requirements"></a><h6>
-<a name="id716911"></a>
-            <a class="link" href="equal_range.html#range.reference.algorithms.non_mutating.equal_range.requirements">Requirements</a>
+<h6>
+<a name="range.reference.algorithms.non_mutating.equal_range.h3"></a>
+            <span><a name="range.reference.algorithms.non_mutating.equal_range.requirements"></a></span><a class="link" href="equal_range.html#range.reference.algorithms.non_mutating.equal_range.requirements">Requirements</a>
           </h6>
 <p>
             <span class="bold"><strong>For the non-predicate versions:</strong></span>
@@ -141,9 +140,9 @@
                 argument types.
               </li>
 </ul></div>
-<a name="range.reference.algorithms.non_mutating.equal_range.precondition_"></a><h6>
-<a name="id717180"></a>
-            <a class="link" href="equal_range.html#range.reference.algorithms.non_mutating.equal_range.precondition_">Precondition:</a>
+<h6>
+<a name="range.reference.algorithms.non_mutating.equal_range.h4"></a>
+            <span><a name="range.reference.algorithms.non_mutating.equal_range.precondition_"></a></span><a class="link" href="equal_range.html#range.reference.algorithms.non_mutating.equal_range.precondition_">Precondition:</a>
           </h6>
 <p>
             For the non-predicate versions: <code class="computeroutput"><span class="identifier">rng</span></code>
@@ -153,9 +152,9 @@
             For the predicate versions: <code class="computeroutput"><span class="identifier">rng</span></code>
             is ordered in ascending order according to <code class="computeroutput"><span class="identifier">pred</span></code>.
           </p>
-<a name="range.reference.algorithms.non_mutating.equal_range.complexity"></a><h6>
-<a name="id717254"></a>
-            <a class="link" href="equal_range.html#range.reference.algorithms.non_mutating.equal_range.complexity">Complexity</a>
+<h6>
+<a name="range.reference.algorithms.non_mutating.equal_range.h5"></a>
+            <span><a name="range.reference.algorithms.non_mutating.equal_range.complexity"></a></span><a class="link" href="equal_range.html#range.reference.algorithms.non_mutating.equal_range.complexity">Complexity</a>
           </h6>
 <p>
             For random-access ranges, the complexity is <code class="computeroutput"><span class="identifier">O</span><span class="special">(</span><span class="identifier">log</span> <span class="identifier">N</span><span class="special">)</span></code>,
@@ -164,7 +163,8 @@
 </div>
 <table xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" width="100%"><tr>
 <td align="left"></td>
-<td align="right"><div class="copyright-footer">Copyright &#169; 2003 -2010 Thorsten Ottosen, Neil Groves<p>
+<td align="right"><div class="copyright-footer">Copyright &#169; 2003-2010 Thorsten Ottosen,
+      Neil Groves<p>
         Distributed under the Boost Software License, Version 1.0. (See accompanying
         file LICENSE_1_0.txt or copy at <a href="http://www.boost.org/LICENSE_1_0.txt" target="_top">http://www.boost.org/LICENSE_1_0.txt</a>)
       </p>
diff --git a/doc/html/range/reference/algorithms/non_mutating/find.html b/doc/html/range/reference/algorithms/non_mutating/find.html
index 0cdb415..b37a0bc 100644
--- a/doc/html/range/reference/algorithms/non_mutating/find.html
+++ b/doc/html/range/reference/algorithms/non_mutating/find.html
@@ -22,16 +22,15 @@
 <div class="spirit-nav">
 <a accesskey="p" href="for_each.html"><img src="../../../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../non_mutating.html"><img src="../../../../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../../../../index.html"><img src="../../../../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="find_end.html"><img src="../../../../../../../../doc/src/images/next.png" alt="Next"></a>
 </div>
-<div class="section">
+<div class="section range_reference_algorithms_non_mutating_find">
 <div class="titlepage"><div><div><h5 class="title">
 <a name="range.reference.algorithms.non_mutating.find"></a><a class="link" href="find.html" title="find">find</a>
 </h5></div></div></div>
-<a name="range.reference.algorithms.non_mutating.find.prototype"></a><h6>
-<a name="id717917"></a>
-            <a class="link" href="find.html#range.reference.algorithms.non_mutating.find.prototype">Prototype</a>
+<h6>
+<a name="range.reference.algorithms.non_mutating.find.h0"></a>
+            <span><a name="range.reference.algorithms.non_mutating.find.prototype"></a></span><a class="link" href="find.html#range.reference.algorithms.non_mutating.find.prototype">Prototype</a>
           </h6>
 <p>
-            
 </p>
 <pre class="programlisting"><span class="keyword">template</span><span class="special">&lt;</span><span class="keyword">class</span> <span class="identifier">SinglePassRange</span><span class="special">,</span> <span class="keyword">class</span> <span class="identifier">Value</span><span class="special">&gt;</span>
 <span class="keyword">typename</span> <span class="identifier">range_iterator</span><span class="special">&lt;</span><span class="identifier">SinglePassRange</span><span class="special">&gt;::</span><span class="identifier">type</span>
@@ -47,9 +46,9 @@
 </pre>
 <p>
           </p>
-<a name="range.reference.algorithms.non_mutating.find.description"></a><h6>
-<a name="id718205"></a>
-            <a class="link" href="find.html#range.reference.algorithms.non_mutating.find.description">Description</a>
+<h6>
+<a name="range.reference.algorithms.non_mutating.find.h1"></a>
+            <span><a name="range.reference.algorithms.non_mutating.find.description"></a></span><a class="link" href="find.html#range.reference.algorithms.non_mutating.find.description">Description</a>
           </h6>
 <p>
             The versions of <code class="computeroutput"><span class="identifier">find</span></code>
@@ -58,16 +57,16 @@
             defines <code class="computeroutput"><span class="identifier">found</span></code> in the
             same manner as the returned iterator described above.
           </p>
-<a name="range.reference.algorithms.non_mutating.find.definition"></a><h6>
-<a name="id718322"></a>
-            <a class="link" href="find.html#range.reference.algorithms.non_mutating.find.definition">Definition</a>
+<h6>
+<a name="range.reference.algorithms.non_mutating.find.h2"></a>
+            <span><a name="range.reference.algorithms.non_mutating.find.definition"></a></span><a class="link" href="find.html#range.reference.algorithms.non_mutating.find.definition">Definition</a>
           </h6>
 <p>
             Defined in the header file <code class="computeroutput"><span class="identifier">boost</span><span class="special">/</span><span class="identifier">range</span><span class="special">/</span><span class="identifier">algorithm</span><span class="special">/</span><span class="identifier">find</span><span class="special">.</span><span class="identifier">hpp</span></code>
           </p>
-<a name="range.reference.algorithms.non_mutating.find.requirements"></a><h6>
-<a name="id718392"></a>
-            <a class="link" href="find.html#range.reference.algorithms.non_mutating.find.requirements">Requirements</a>
+<h6>
+<a name="range.reference.algorithms.non_mutating.find.h3"></a>
+            <span><a name="range.reference.algorithms.non_mutating.find.requirements"></a></span><a class="link" href="find.html#range.reference.algorithms.non_mutating.find.requirements">Requirements</a>
           </h6>
 <div class="itemizedlist"><ul class="itemizedlist" type="disc">
 <li class="listitem">
@@ -86,9 +85,9 @@
                 value type.
               </li>
 </ul></div>
-<a name="range.reference.algorithms.non_mutating.find.complexity"></a><h6>
-<a name="id718511"></a>
-            <a class="link" href="find.html#range.reference.algorithms.non_mutating.find.complexity">Complexity</a>
+<h6>
+<a name="range.reference.algorithms.non_mutating.find.h4"></a>
+            <span><a name="range.reference.algorithms.non_mutating.find.complexity"></a></span><a class="link" href="find.html#range.reference.algorithms.non_mutating.find.complexity">Complexity</a>
           </h6>
 <p>
             Linear. At most <code class="computeroutput"><span class="identifier">distance</span><span class="special">(</span><span class="identifier">rng</span><span class="special">)</span></code> comparisons for equality.
@@ -96,7 +95,8 @@
 </div>
 <table xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" width="100%"><tr>
 <td align="left"></td>
-<td align="right"><div class="copyright-footer">Copyright &#169; 2003 -2010 Thorsten Ottosen, Neil Groves<p>
+<td align="right"><div class="copyright-footer">Copyright &#169; 2003-2010 Thorsten Ottosen,
+      Neil Groves<p>
         Distributed under the Boost Software License, Version 1.0. (See accompanying
         file LICENSE_1_0.txt or copy at <a href="http://www.boost.org/LICENSE_1_0.txt" target="_top">http://www.boost.org/LICENSE_1_0.txt</a>)
       </p>
diff --git a/doc/html/range/reference/algorithms/non_mutating/find_end.html b/doc/html/range/reference/algorithms/non_mutating/find_end.html
index 2381696..5788b2a 100644
--- a/doc/html/range/reference/algorithms/non_mutating/find_end.html
+++ b/doc/html/range/reference/algorithms/non_mutating/find_end.html
@@ -22,16 +22,15 @@
 <div class="spirit-nav">
 <a accesskey="p" href="find.html"><img src="../../../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../non_mutating.html"><img src="../../../../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../../../../index.html"><img src="../../../../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="find_first_of.html"><img src="../../../../../../../../doc/src/images/next.png" alt="Next"></a>
 </div>
-<div class="section">
+<div class="section range_reference_algorithms_non_mutating_find_end">
 <div class="titlepage"><div><div><h5 class="title">
 <a name="range.reference.algorithms.non_mutating.find_end"></a><a class="link" href="find_end.html" title="find_end">find_end</a>
 </h5></div></div></div>
-<a name="range.reference.algorithms.non_mutating.find_end.prototype"></a><h6>
-<a name="id718575"></a>
-            <a class="link" href="find_end.html#range.reference.algorithms.non_mutating.find_end.prototype">Prototype</a>
+<h6>
+<a name="range.reference.algorithms.non_mutating.find_end.h0"></a>
+            <span><a name="range.reference.algorithms.non_mutating.find_end.prototype"></a></span><a class="link" href="find_end.html#range.reference.algorithms.non_mutating.find_end.prototype">Prototype</a>
           </h6>
 <p>
-            
 </p>
 <pre class="programlisting"><span class="keyword">template</span><span class="special">&lt;</span><span class="keyword">class</span> <span class="identifier">ForwardRange1</span><span class="special">,</span> <span class="keyword">class</span> <span class="identifier">ForwardRange2</span><span class="special">&gt;</span>
 <span class="keyword">typename</span> <span class="identifier">range_iterator</span><span class="special">&lt;</span><span class="identifier">ForwardRange1</span><span class="special">&gt;::</span><span class="identifier">type</span>
@@ -64,9 +63,9 @@
 </pre>
 <p>
           </p>
-<a name="range.reference.algorithms.non_mutating.find_end.description"></a><h6>
-<a name="id719235"></a>
-            <a class="link" href="find_end.html#range.reference.algorithms.non_mutating.find_end.description">Description</a>
+<h6>
+<a name="range.reference.algorithms.non_mutating.find_end.h1"></a>
+            <span><a name="range.reference.algorithms.non_mutating.find_end.description"></a></span><a class="link" href="find_end.html#range.reference.algorithms.non_mutating.find_end.description">Description</a>
           </h6>
 <p>
             The versions of <code class="computeroutput"><span class="identifier">find_end</span></code>
@@ -79,16 +78,16 @@
             defines <code class="computeroutput"><span class="identifier">found</span></code> in the
             same manner as the returned iterator described above.
           </p>
-<a name="range.reference.algorithms.non_mutating.find_end.definition"></a><h6>
-<a name="id719359"></a>
-            <a class="link" href="find_end.html#range.reference.algorithms.non_mutating.find_end.definition">Definition</a>
+<h6>
+<a name="range.reference.algorithms.non_mutating.find_end.h2"></a>
+            <span><a name="range.reference.algorithms.non_mutating.find_end.definition"></a></span><a class="link" href="find_end.html#range.reference.algorithms.non_mutating.find_end.definition">Definition</a>
           </h6>
 <p>
             Defined in the header file <code class="computeroutput"><span class="identifier">boost</span><span class="special">/</span><span class="identifier">range</span><span class="special">/</span><span class="identifier">algorithm</span><span class="special">/</span><span class="identifier">find_end</span><span class="special">.</span><span class="identifier">hpp</span></code>
           </p>
-<a name="range.reference.algorithms.non_mutating.find_end.requirements"></a><h6>
-<a name="id719430"></a>
-            <a class="link" href="find_end.html#range.reference.algorithms.non_mutating.find_end.requirements">Requirements</a>
+<h6>
+<a name="range.reference.algorithms.non_mutating.find_end.h3"></a>
+            <span><a name="range.reference.algorithms.non_mutating.find_end.requirements"></a></span><a class="link" href="find_end.html#range.reference.algorithms.non_mutating.find_end.requirements">Requirements</a>
           </h6>
 <p>
             <span class="bold"><strong>For the non-predicate versions:</strong></span>
@@ -146,9 +145,9 @@
                 second argument type.
               </li>
 </ul></div>
-<a name="range.reference.algorithms.non_mutating.find_end.complexity"></a><h6>
-<a name="id719742"></a>
-            <a class="link" href="find_end.html#range.reference.algorithms.non_mutating.find_end.complexity">Complexity</a>
+<h6>
+<a name="range.reference.algorithms.non_mutating.find_end.h4"></a>
+            <span><a name="range.reference.algorithms.non_mutating.find_end.complexity"></a></span><a class="link" href="find_end.html#range.reference.algorithms.non_mutating.find_end.complexity">Complexity</a>
           </h6>
 <p>
             The number of comparisons is proportional to <code class="computeroutput"><span class="identifier">distance</span><span class="special">(</span><span class="identifier">rng1</span><span class="special">)</span> <span class="special">*</span> <span class="identifier">distance</span><span class="special">(</span><span class="identifier">rng2</span><span class="special">)</span></code>. If both <code class="computeroutput"><span class="identifier">ForwardRange1</span></code>
@@ -159,7 +158,8 @@
 </div>
 <table xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" width="100%"><tr>
 <td align="left"></td>
-<td align="right"><div class="copyright-footer">Copyright &#169; 2003 -2010 Thorsten Ottosen, Neil Groves<p>
+<td align="right"><div class="copyright-footer">Copyright &#169; 2003-2010 Thorsten Ottosen,
+      Neil Groves<p>
         Distributed under the Boost Software License, Version 1.0. (See accompanying
         file LICENSE_1_0.txt or copy at <a href="http://www.boost.org/LICENSE_1_0.txt" target="_top">http://www.boost.org/LICENSE_1_0.txt</a>)
       </p>
diff --git a/doc/html/range/reference/algorithms/non_mutating/find_first_of.html b/doc/html/range/reference/algorithms/non_mutating/find_first_of.html
index 6421a4d..f9133a8 100644
--- a/doc/html/range/reference/algorithms/non_mutating/find_first_of.html
+++ b/doc/html/range/reference/algorithms/non_mutating/find_first_of.html
@@ -22,16 +22,15 @@
 <div class="spirit-nav">
 <a accesskey="p" href="find_end.html"><img src="../../../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../non_mutating.html"><img src="../../../../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../../../../index.html"><img src="../../../../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="find_if.html"><img src="../../../../../../../../doc/src/images/next.png" alt="Next"></a>
 </div>
-<div class="section">
+<div class="section range_reference_algorithms_non_mutating_find_first_of">
 <div class="titlepage"><div><div><h5 class="title">
 <a name="range.reference.algorithms.non_mutating.find_first_of"></a><a class="link" href="find_first_of.html" title="find_first_of">find_first_of</a>
 </h5></div></div></div>
-<a name="range.reference.algorithms.non_mutating.find_first_of.prototype"></a><h6>
-<a name="id719912"></a>
-            <a class="link" href="find_first_of.html#range.reference.algorithms.non_mutating.find_first_of.prototype">Prototype</a>
+<h6>
+<a name="range.reference.algorithms.non_mutating.find_first_of.h0"></a>
+            <span><a name="range.reference.algorithms.non_mutating.find_first_of.prototype"></a></span><a class="link" href="find_first_of.html#range.reference.algorithms.non_mutating.find_first_of.prototype">Prototype</a>
           </h6>
 <p>
-            
 </p>
 <pre class="programlisting"><span class="keyword">template</span><span class="special">&lt;</span><span class="keyword">class</span> <span class="identifier">SinglePassRange1</span><span class="special">,</span> <span class="keyword">class</span> <span class="identifier">ForwardRange2</span><span class="special">&gt;</span>
 <span class="keyword">typename</span> <span class="identifier">range_iterator</span><span class="special">&lt;</span><span class="identifier">SinglePassRange1</span><span class="special">&gt;::</span><span class="identifier">type</span>
@@ -64,9 +63,9 @@
 </pre>
 <p>
           </p>
-<a name="range.reference.algorithms.non_mutating.find_first_of.description"></a><h6>
-<a name="id720570"></a>
-            <a class="link" href="find_first_of.html#range.reference.algorithms.non_mutating.find_first_of.description">Description</a>
+<h6>
+<a name="range.reference.algorithms.non_mutating.find_first_of.h1"></a>
+            <span><a name="range.reference.algorithms.non_mutating.find_first_of.description"></a></span><a class="link" href="find_first_of.html#range.reference.algorithms.non_mutating.find_first_of.description">Description</a>
           </h6>
 <p>
             The versions of <code class="computeroutput"><span class="identifier">find_first_of</span></code>
@@ -84,16 +83,16 @@
             defines <code class="computeroutput"><span class="identifier">found</span></code> in the
             same manner as the returned iterator described above.
           </p>
-<a name="range.reference.algorithms.non_mutating.find_first_of.definition"></a><h6>
-<a name="id720699"></a>
-            <a class="link" href="find_first_of.html#range.reference.algorithms.non_mutating.find_first_of.definition">Definition</a>
+<h6>
+<a name="range.reference.algorithms.non_mutating.find_first_of.h2"></a>
+            <span><a name="range.reference.algorithms.non_mutating.find_first_of.definition"></a></span><a class="link" href="find_first_of.html#range.reference.algorithms.non_mutating.find_first_of.definition">Definition</a>
           </h6>
 <p>
             Defined in the header file <code class="computeroutput"><span class="identifier">boost</span><span class="special">/</span><span class="identifier">range</span><span class="special">/</span><span class="identifier">algorithm</span><span class="special">/</span><span class="identifier">find_first_of</span><span class="special">.</span><span class="identifier">hpp</span></code>
           </p>
-<a name="range.reference.algorithms.non_mutating.find_first_of.requirements"></a><h6>
-<a name="id720771"></a>
-            <a class="link" href="find_first_of.html#range.reference.algorithms.non_mutating.find_first_of.requirements">Requirements</a>
+<h6>
+<a name="range.reference.algorithms.non_mutating.find_first_of.h3"></a>
+            <span><a name="range.reference.algorithms.non_mutating.find_first_of.requirements"></a></span><a class="link" href="find_first_of.html#range.reference.algorithms.non_mutating.find_first_of.requirements">Requirements</a>
           </h6>
 <p>
             <span class="bold"><strong>For the non-predicate versions:</strong></span>
@@ -145,9 +144,9 @@
                 second argument type.
               </li>
 </ul></div>
-<a name="range.reference.algorithms.non_mutating.find_first_of.complexity"></a><h6>
-<a name="id721037"></a>
-            <a class="link" href="find_first_of.html#range.reference.algorithms.non_mutating.find_first_of.complexity">Complexity</a>
+<h6>
+<a name="range.reference.algorithms.non_mutating.find_first_of.h4"></a>
+            <span><a name="range.reference.algorithms.non_mutating.find_first_of.complexity"></a></span><a class="link" href="find_first_of.html#range.reference.algorithms.non_mutating.find_first_of.complexity">Complexity</a>
           </h6>
 <p>
             At most <code class="computeroutput"><span class="identifier">distance</span><span class="special">(</span><span class="identifier">rng1</span><span class="special">)</span> <span class="special">*</span> <span class="identifier">distance</span><span class="special">(</span><span class="identifier">rng2</span><span class="special">)</span></code> comparisons.
@@ -155,7 +154,8 @@
 </div>
 <table xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" width="100%"><tr>
 <td align="left"></td>
-<td align="right"><div class="copyright-footer">Copyright &#169; 2003 -2010 Thorsten Ottosen, Neil Groves<p>
+<td align="right"><div class="copyright-footer">Copyright &#169; 2003-2010 Thorsten Ottosen,
+      Neil Groves<p>
         Distributed under the Boost Software License, Version 1.0. (See accompanying
         file LICENSE_1_0.txt or copy at <a href="http://www.boost.org/LICENSE_1_0.txt" target="_top">http://www.boost.org/LICENSE_1_0.txt</a>)
       </p>
diff --git a/doc/html/range/reference/algorithms/non_mutating/find_if.html b/doc/html/range/reference/algorithms/non_mutating/find_if.html
index 836b675..56d7adc 100644
--- a/doc/html/range/reference/algorithms/non_mutating/find_if.html
+++ b/doc/html/range/reference/algorithms/non_mutating/find_if.html
@@ -22,16 +22,15 @@
 <div class="spirit-nav">
 <a accesskey="p" href="find_first_of.html"><img src="../../../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../non_mutating.html"><img src="../../../../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../../../../index.html"><img src="../../../../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="lexicographical_compare.html"><img src="../../../../../../../../doc/src/images/next.png" alt="Next"></a>
 </div>
-<div class="section">
+<div class="section range_reference_algorithms_non_mutating_find_if">
 <div class="titlepage"><div><div><h5 class="title">
 <a name="range.reference.algorithms.non_mutating.find_if"></a><a class="link" href="find_if.html" title="find_if">find_if</a>
 </h5></div></div></div>
-<a name="range.reference.algorithms.non_mutating.find_if.prototype"></a><h6>
-<a name="id721127"></a>
-            <a class="link" href="find_if.html#range.reference.algorithms.non_mutating.find_if.prototype">Prototype</a>
+<h6>
+<a name="range.reference.algorithms.non_mutating.find_if.h0"></a>
+            <span><a name="range.reference.algorithms.non_mutating.find_if.prototype"></a></span><a class="link" href="find_if.html#range.reference.algorithms.non_mutating.find_if.prototype">Prototype</a>
           </h6>
 <p>
-            
 </p>
 <pre class="programlisting"><span class="keyword">template</span><span class="special">&lt;</span><span class="keyword">class</span> <span class="identifier">SinglePassRange</span><span class="special">,</span> <span class="keyword">class</span> <span class="identifier">UnaryPredicate</span><span class="special">&gt;</span>
 <span class="keyword">typename</span> <span class="identifier">range_iterator</span><span class="special">&lt;</span><span class="identifier">SinglePassRange</span><span class="special">&gt;::</span><span class="identifier">type</span>
@@ -47,9 +46,9 @@
 </pre>
 <p>
           </p>
-<a name="range.reference.algorithms.non_mutating.find_if.description"></a><h6>
-<a name="id721417"></a>
-            <a class="link" href="find_if.html#range.reference.algorithms.non_mutating.find_if.description">Description</a>
+<h6>
+<a name="range.reference.algorithms.non_mutating.find_if.h1"></a>
+            <span><a name="range.reference.algorithms.non_mutating.find_if.description"></a></span><a class="link" href="find_if.html#range.reference.algorithms.non_mutating.find_if.description">Description</a>
           </h6>
 <p>
             The versions of <code class="computeroutput"><span class="identifier">find_if</span></code>
@@ -62,16 +61,16 @@
             that return a <code class="computeroutput"><span class="identifier">range_return</span></code>,
             defines found in the same manner as the returned iterator described above.
           </p>
-<a name="range.reference.algorithms.non_mutating.find_if.definition"></a><h6>
-<a name="id721545"></a>
-            <a class="link" href="find_if.html#range.reference.algorithms.non_mutating.find_if.definition">Definition</a>
+<h6>
+<a name="range.reference.algorithms.non_mutating.find_if.h2"></a>
+            <span><a name="range.reference.algorithms.non_mutating.find_if.definition"></a></span><a class="link" href="find_if.html#range.reference.algorithms.non_mutating.find_if.definition">Definition</a>
           </h6>
 <p>
             Defined in the header file <code class="computeroutput"><span class="identifier">boost</span><span class="special">/</span><span class="identifier">range</span><span class="special">/</span><span class="identifier">algorithm</span><span class="special">/</span><span class="identifier">find_if</span><span class="special">.</span><span class="identifier">hpp</span></code>
           </p>
-<a name="range.reference.algorithms.non_mutating.find_if.requirements"></a><h6>
-<a name="id721616"></a>
-            <a class="link" href="find_if.html#range.reference.algorithms.non_mutating.find_if.requirements">Requirements</a>
+<h6>
+<a name="range.reference.algorithms.non_mutating.find_if.h3"></a>
+            <span><a name="range.reference.algorithms.non_mutating.find_if.requirements"></a></span><a class="link" href="find_if.html#range.reference.algorithms.non_mutating.find_if.requirements">Requirements</a>
           </h6>
 <div class="itemizedlist"><ul class="itemizedlist" type="disc">
 <li class="listitem">
@@ -88,17 +87,17 @@
                 is convertible to the argument type of <code class="computeroutput"><span class="identifier">UnaryPredicate</span></code>.
               </li>
 </ul></div>
-<a name="range.reference.algorithms.non_mutating.find_if.precondition_"></a><h6>
-<a name="id721721"></a>
-            <a class="link" href="find_if.html#range.reference.algorithms.non_mutating.find_if.precondition_">Precondition:</a>
+<h6>
+<a name="range.reference.algorithms.non_mutating.find_if.h4"></a>
+            <span><a name="range.reference.algorithms.non_mutating.find_if.precondition_"></a></span><a class="link" href="find_if.html#range.reference.algorithms.non_mutating.find_if.precondition_">Precondition:</a>
           </h6>
 <p>
             For each iterator <code class="computeroutput"><span class="identifier">i</span></code> in
             <code class="computeroutput"><span class="identifier">rng</span></code>, <code class="computeroutput"><span class="special">*</span><span class="identifier">i</span></code> is in the domain of <code class="computeroutput"><span class="identifier">UnaryPredicate</span></code>.
           </p>
-<a name="range.reference.algorithms.non_mutating.find_if.complexity"></a><h6>
-<a name="id721791"></a>
-            <a class="link" href="find_if.html#range.reference.algorithms.non_mutating.find_if.complexity">Complexity</a>
+<h6>
+<a name="range.reference.algorithms.non_mutating.find_if.h5"></a>
+            <span><a name="range.reference.algorithms.non_mutating.find_if.complexity"></a></span><a class="link" href="find_if.html#range.reference.algorithms.non_mutating.find_if.complexity">Complexity</a>
           </h6>
 <p>
             Linear. At most <code class="computeroutput"><span class="identifier">distance</span><span class="special">(</span><span class="identifier">rng</span><span class="special">)</span></code> invocations of <code class="computeroutput"><span class="identifier">pred</span></code>.
@@ -106,7 +105,8 @@
 </div>
 <table xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" width="100%"><tr>
 <td align="left"></td>
-<td align="right"><div class="copyright-footer">Copyright &#169; 2003 -2010 Thorsten Ottosen, Neil Groves<p>
+<td align="right"><div class="copyright-footer">Copyright &#169; 2003-2010 Thorsten Ottosen,
+      Neil Groves<p>
         Distributed under the Boost Software License, Version 1.0. (See accompanying
         file LICENSE_1_0.txt or copy at <a href="http://www.boost.org/LICENSE_1_0.txt" target="_top">http://www.boost.org/LICENSE_1_0.txt</a>)
       </p>
diff --git a/doc/html/range/reference/algorithms/non_mutating/for_each.html b/doc/html/range/reference/algorithms/non_mutating/for_each.html
index daa7ec1..ff5390e 100644
--- a/doc/html/range/reference/algorithms/non_mutating/for_each.html
+++ b/doc/html/range/reference/algorithms/non_mutating/for_each.html
@@ -22,16 +22,15 @@
 <div class="spirit-nav">
 <a accesskey="p" href="equal_range.html"><img src="../../../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../non_mutating.html"><img src="../../../../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../../../../index.html"><img src="../../../../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="find.html"><img src="../../../../../../../../doc/src/images/next.png" alt="Next"></a>
 </div>
-<div class="section">
+<div class="section range_reference_algorithms_non_mutating_for_each">
 <div class="titlepage"><div><div><h5 class="title">
 <a name="range.reference.algorithms.non_mutating.for_each"></a><a class="link" href="for_each.html" title="for_each">for_each</a>
 </h5></div></div></div>
-<a name="range.reference.algorithms.non_mutating.for_each.prototype"></a><h6>
-<a name="id717348"></a>
-            <a class="link" href="for_each.html#range.reference.algorithms.non_mutating.for_each.prototype">Prototype</a>
+<h6>
+<a name="range.reference.algorithms.non_mutating.for_each.h0"></a>
+            <span><a name="range.reference.algorithms.non_mutating.for_each.prototype"></a></span><a class="link" href="for_each.html#range.reference.algorithms.non_mutating.for_each.prototype">Prototype</a>
           </h6>
 <p>
-            
 </p>
 <pre class="programlisting"><span class="keyword">template</span><span class="special">&lt;</span>
     <span class="keyword">class</span> <span class="identifier">SinglePassRange</span><span class="special">,</span>
@@ -43,13 +42,13 @@
     <span class="keyword">class</span> <span class="identifier">SinglePassRange</span><span class="special">,</span>
     <span class="keyword">class</span> <span class="identifier">UnaryFunction</span>
     <span class="special">&gt;</span>
-<span class="identifier">UnaryFunction</span> <span class="identifier">for_each</span><span class="special">(</span><span class="keyword">const</span> <span class="identifier">SinglePassRange</span><span class="special">&amp;</span> <span class="identifier">rng</span><span class="special">,</span> <span class="identifier">UnaryFunction</span> <span class="identifier">fun</span><span class="special">);</span>    
+<span class="identifier">UnaryFunction</span> <span class="identifier">for_each</span><span class="special">(</span><span class="keyword">const</span> <span class="identifier">SinglePassRange</span><span class="special">&amp;</span> <span class="identifier">rng</span><span class="special">,</span> <span class="identifier">UnaryFunction</span> <span class="identifier">fun</span><span class="special">);</span>
 </pre>
 <p>
           </p>
-<a name="range.reference.algorithms.non_mutating.for_each.description"></a><h6>
-<a name="id717573"></a>
-            <a class="link" href="for_each.html#range.reference.algorithms.non_mutating.for_each.description">Description</a>
+<h6>
+<a name="range.reference.algorithms.non_mutating.for_each.h1"></a>
+            <span><a name="range.reference.algorithms.non_mutating.for_each.description"></a></span><a class="link" href="for_each.html#range.reference.algorithms.non_mutating.for_each.description">Description</a>
           </h6>
 <p>
             <code class="computeroutput"><span class="identifier">for_each</span></code> traverses forward
@@ -57,16 +56,16 @@
             element <code class="computeroutput"><span class="identifier">x</span></code> it invokes
             <code class="computeroutput"><span class="identifier">fun</span><span class="special">(</span><span class="identifier">x</span><span class="special">)</span></code>.
           </p>
-<a name="range.reference.algorithms.non_mutating.for_each.definition"></a><h6>
-<a name="id717651"></a>
-            <a class="link" href="for_each.html#range.reference.algorithms.non_mutating.for_each.definition">Definition</a>
+<h6>
+<a name="range.reference.algorithms.non_mutating.for_each.h2"></a>
+            <span><a name="range.reference.algorithms.non_mutating.for_each.definition"></a></span><a class="link" href="for_each.html#range.reference.algorithms.non_mutating.for_each.definition">Definition</a>
           </h6>
 <p>
             Defined in the header file <code class="computeroutput"><span class="identifier">boost</span><span class="special">/</span><span class="identifier">range</span><span class="special">/</span><span class="identifier">algorithm</span><span class="special">/</span><span class="identifier">for_each</span><span class="special">.</span><span class="identifier">hpp</span></code>
           </p>
-<a name="range.reference.algorithms.non_mutating.for_each.requirements"></a><h6>
-<a name="id717722"></a>
-            <a class="link" href="for_each.html#range.reference.algorithms.non_mutating.for_each.requirements">Requirements</a>
+<h6>
+<a name="range.reference.algorithms.non_mutating.for_each.h3"></a>
+            <span><a name="range.reference.algorithms.non_mutating.for_each.requirements"></a></span><a class="link" href="for_each.html#range.reference.algorithms.non_mutating.for_each.requirements">Requirements</a>
           </h6>
 <div class="itemizedlist"><ul class="itemizedlist" type="disc">
 <li class="listitem">
@@ -88,9 +87,9 @@
                 argument type.
               </li>
 </ul></div>
-<a name="range.reference.algorithms.non_mutating.for_each.complexity"></a><h6>
-<a name="id717844"></a>
-            <a class="link" href="for_each.html#range.reference.algorithms.non_mutating.for_each.complexity">Complexity</a>
+<h6>
+<a name="range.reference.algorithms.non_mutating.for_each.h4"></a>
+            <span><a name="range.reference.algorithms.non_mutating.for_each.complexity"></a></span><a class="link" href="for_each.html#range.reference.algorithms.non_mutating.for_each.complexity">Complexity</a>
           </h6>
 <p>
             Linear. Exactly <code class="computeroutput"><span class="identifier">distance</span><span class="special">(</span><span class="identifier">rng</span><span class="special">)</span></code> applications of <code class="computeroutput"><span class="identifier">UnaryFunction</span></code>.
@@ -98,7 +97,8 @@
 </div>
 <table xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" width="100%"><tr>
 <td align="left"></td>
-<td align="right"><div class="copyright-footer">Copyright &#169; 2003 -2010 Thorsten Ottosen, Neil Groves<p>
+<td align="right"><div class="copyright-footer">Copyright &#169; 2003-2010 Thorsten Ottosen,
+      Neil Groves<p>
         Distributed under the Boost Software License, Version 1.0. (See accompanying
         file LICENSE_1_0.txt or copy at <a href="http://www.boost.org/LICENSE_1_0.txt" target="_top">http://www.boost.org/LICENSE_1_0.txt</a>)
       </p>
diff --git a/doc/html/range/reference/algorithms/non_mutating/lexicographical_compare.html b/doc/html/range/reference/algorithms/non_mutating/lexicographical_compare.html
index 704296a..669ad55 100644
--- a/doc/html/range/reference/algorithms/non_mutating/lexicographical_compare.html
+++ b/doc/html/range/reference/algorithms/non_mutating/lexicographical_compare.html
@@ -22,16 +22,15 @@
 <div class="spirit-nav">
 <a accesskey="p" href="find_if.html"><img src="../../../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../non_mutating.html"><img src="../../../../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../../../../index.html"><img src="../../../../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="lower_bound.html"><img src="../../../../../../../../doc/src/images/next.png" alt="Next"></a>
 </div>
-<div class="section">
+<div class="section range_reference_algorithms_non_mutating_lexicographical_compare">
 <div class="titlepage"><div><div><h5 class="title">
 <a name="range.reference.algorithms.non_mutating.lexicographical_compare"></a><a class="link" href="lexicographical_compare.html" title="lexicographical_compare">lexicographical_compare</a>
 </h5></div></div></div>
-<a name="range.reference.algorithms.non_mutating.lexicographical_compare.prototype"></a><h6>
-<a name="id721867"></a>
-            <a class="link" href="lexicographical_compare.html#range.reference.algorithms.non_mutating.lexicographical_compare.prototype">Prototype</a>
+<h6>
+<a name="range.reference.algorithms.non_mutating.lexicographical_compare.h0"></a>
+            <span><a name="range.reference.algorithms.non_mutating.lexicographical_compare.prototype"></a></span><a class="link" href="lexicographical_compare.html#range.reference.algorithms.non_mutating.lexicographical_compare.prototype">Prototype</a>
           </h6>
 <p>
-            
 </p>
 <pre class="programlisting"><span class="keyword">template</span><span class="special">&lt;</span>
     <span class="keyword">class</span> <span class="identifier">SinglePassRange1</span><span class="special">,</span>
@@ -47,13 +46,13 @@
     <span class="special">&gt;</span>
 <span class="keyword">bool</span> <span class="identifier">lexicographical_compare</span><span class="special">(</span><span class="keyword">const</span> <span class="identifier">SinglePassRange1</span><span class="special">&amp;</span> <span class="identifier">rng1</span><span class="special">,</span>
                              <span class="keyword">const</span> <span class="identifier">SinglePassRange2</span><span class="special">&amp;</span> <span class="identifier">rng2</span><span class="special">,</span>
-                             <span class="identifier">BinaryPredicate</span> <span class="identifier">pred</span><span class="special">);</span>    
+                             <span class="identifier">BinaryPredicate</span> <span class="identifier">pred</span><span class="special">);</span>
 </pre>
 <p>
           </p>
-<a name="range.reference.algorithms.non_mutating.lexicographical_compare.description"></a><h6>
-<a name="id722150"></a>
-            <a class="link" href="lexicographical_compare.html#range.reference.algorithms.non_mutating.lexicographical_compare.description">Description</a>
+<h6>
+<a name="range.reference.algorithms.non_mutating.lexicographical_compare.h1"></a>
+            <span><a name="range.reference.algorithms.non_mutating.lexicographical_compare.description"></a></span><a class="link" href="lexicographical_compare.html#range.reference.algorithms.non_mutating.lexicographical_compare.description">Description</a>
           </h6>
 <p>
             <code class="computeroutput"><span class="identifier">lexicographical_compare</span></code>
@@ -71,16 +70,16 @@
             and using <code class="computeroutput"><span class="identifier">pred</span></code> in the
             predicate versions.
           </p>
-<a name="range.reference.algorithms.non_mutating.lexicographical_compare.definition"></a><h6>
-<a name="id722318"></a>
-            <a class="link" href="lexicographical_compare.html#range.reference.algorithms.non_mutating.lexicographical_compare.definition">Definition</a>
+<h6>
+<a name="range.reference.algorithms.non_mutating.lexicographical_compare.h2"></a>
+            <span><a name="range.reference.algorithms.non_mutating.lexicographical_compare.definition"></a></span><a class="link" href="lexicographical_compare.html#range.reference.algorithms.non_mutating.lexicographical_compare.definition">Definition</a>
           </h6>
 <p>
             Defined in the header file <code class="computeroutput"><span class="identifier">boost</span><span class="special">/</span><span class="identifier">range</span><span class="special">/</span><span class="identifier">algorithm</span><span class="special">/</span><span class="identifier">lexicographical_compare</span><span class="special">.</span><span class="identifier">hpp</span></code>
           </p>
-<a name="range.reference.algorithms.non_mutating.lexicographical_compare.requirements"></a><h6>
-<a name="id722389"></a>
-            <a class="link" href="lexicographical_compare.html#range.reference.algorithms.non_mutating.lexicographical_compare.requirements">Requirements</a>
+<h6>
+<a name="range.reference.algorithms.non_mutating.lexicographical_compare.h3"></a>
+            <span><a name="range.reference.algorithms.non_mutating.lexicographical_compare.requirements"></a></span><a class="link" href="lexicographical_compare.html#range.reference.algorithms.non_mutating.lexicographical_compare.requirements">Requirements</a>
           </h6>
 <p>
             <span class="bold"><strong>For the non-predicate versions of lexicographical_compare:</strong></span>
@@ -143,9 +142,9 @@
                 second argument type.
               </li>
 </ul></div>
-<a name="range.reference.algorithms.non_mutating.lexicographical_compare.complexity"></a><h6>
-<a name="id722764"></a>
-            <a class="link" href="lexicographical_compare.html#range.reference.algorithms.non_mutating.lexicographical_compare.complexity">Complexity</a>
+<h6>
+<a name="range.reference.algorithms.non_mutating.lexicographical_compare.h4"></a>
+            <span><a name="range.reference.algorithms.non_mutating.lexicographical_compare.complexity"></a></span><a class="link" href="lexicographical_compare.html#range.reference.algorithms.non_mutating.lexicographical_compare.complexity">Complexity</a>
           </h6>
 <p>
             Linear. At most <code class="computeroutput"><span class="number">2</span> <span class="special">*</span>
@@ -155,7 +154,8 @@
 </div>
 <table xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" width="100%"><tr>
 <td align="left"></td>
-<td align="right"><div class="copyright-footer">Copyright &#169; 2003 -2010 Thorsten Ottosen, Neil Groves<p>
+<td align="right"><div class="copyright-footer">Copyright &#169; 2003-2010 Thorsten Ottosen,
+      Neil Groves<p>
         Distributed under the Boost Software License, Version 1.0. (See accompanying
         file LICENSE_1_0.txt or copy at <a href="http://www.boost.org/LICENSE_1_0.txt" target="_top">http://www.boost.org/LICENSE_1_0.txt</a>)
       </p>
diff --git a/doc/html/range/reference/algorithms/non_mutating/lower_bound.html b/doc/html/range/reference/algorithms/non_mutating/lower_bound.html
index b74ddd7..e3065cc 100644
--- a/doc/html/range/reference/algorithms/non_mutating/lower_bound.html
+++ b/doc/html/range/reference/algorithms/non_mutating/lower_bound.html
@@ -22,16 +22,15 @@
 <div class="spirit-nav">
 <a accesskey="p" href="lexicographical_compare.html"><img src="../../../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../non_mutating.html"><img src="../../../../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../../../../index.html"><img src="../../../../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="max_element.html"><img src="../../../../../../../../doc/src/images/next.png" alt="Next"></a>
 </div>
-<div class="section">
+<div class="section range_reference_algorithms_non_mutating_lower_bound">
 <div class="titlepage"><div><div><h5 class="title">
 <a name="range.reference.algorithms.non_mutating.lower_bound"></a><a class="link" href="lower_bound.html" title="lower_bound">lower_bound</a>
 </h5></div></div></div>
-<a name="range.reference.algorithms.non_mutating.lower_bound.prototype"></a><h6>
-<a name="id722868"></a>
-            <a class="link" href="lower_bound.html#range.reference.algorithms.non_mutating.lower_bound.prototype">Prototype</a>
+<h6>
+<a name="range.reference.algorithms.non_mutating.lower_bound.h0"></a>
+            <span><a name="range.reference.algorithms.non_mutating.lower_bound.prototype"></a></span><a class="link" href="lower_bound.html#range.reference.algorithms.non_mutating.lower_bound.prototype">Prototype</a>
           </h6>
 <p>
-            
 </p>
 <pre class="programlisting"><span class="keyword">template</span><span class="special">&lt;</span><span class="keyword">class</span> <span class="identifier">ForwardRange</span><span class="special">,</span> <span class="keyword">class</span> <span class="identifier">Value</span><span class="special">&gt;</span>
 <span class="keyword">typename</span> <span class="identifier">range_iterator</span><span class="special">&lt;</span><span class="identifier">ForwardRange</span><span class="special">&gt;::</span><span class="identifier">type</span>
@@ -47,9 +46,9 @@
 </pre>
 <p>
           </p>
-<a name="range.reference.algorithms.non_mutating.lower_bound.description"></a><h6>
-<a name="id723158"></a>
-            <a class="link" href="lower_bound.html#range.reference.algorithms.non_mutating.lower_bound.description">Description</a>
+<h6>
+<a name="range.reference.algorithms.non_mutating.lower_bound.h1"></a>
+            <span><a name="range.reference.algorithms.non_mutating.lower_bound.description"></a></span><a class="link" href="lower_bound.html#range.reference.algorithms.non_mutating.lower_bound.description">Description</a>
           </h6>
 <p>
             The versions of <code class="computeroutput"><span class="identifier">lower_bound</span></code>
@@ -70,16 +69,16 @@
             defines <code class="computeroutput"><span class="identifier">found</span></code> in the
             same manner as the returned iterator described above.
           </p>
-<a name="range.reference.algorithms.non_mutating.lower_bound.definition"></a><h6>
-<a name="id723347"></a>
-            <a class="link" href="lower_bound.html#range.reference.algorithms.non_mutating.lower_bound.definition">Definition</a>
+<h6>
+<a name="range.reference.algorithms.non_mutating.lower_bound.h2"></a>
+            <span><a name="range.reference.algorithms.non_mutating.lower_bound.definition"></a></span><a class="link" href="lower_bound.html#range.reference.algorithms.non_mutating.lower_bound.definition">Definition</a>
           </h6>
 <p>
             Defined in the header file <code class="computeroutput"><span class="identifier">boost</span><span class="special">/</span><span class="identifier">range</span><span class="special">/</span><span class="identifier">algorithm</span><span class="special">/</span><span class="identifier">lower_bound</span><span class="special">.</span><span class="identifier">hpp</span></code>
           </p>
-<a name="range.reference.algorithms.non_mutating.lower_bound.requirements"></a><h6>
-<a name="id723418"></a>
-            <a class="link" href="lower_bound.html#range.reference.algorithms.non_mutating.lower_bound.requirements">Requirements</a>
+<h6>
+<a name="range.reference.algorithms.non_mutating.lower_bound.h3"></a>
+            <span><a name="range.reference.algorithms.non_mutating.lower_bound.requirements"></a></span><a class="link" href="lower_bound.html#range.reference.algorithms.non_mutating.lower_bound.requirements">Requirements</a>
           </h6>
 <p>
             <span class="bold"><strong>For the non-predicate versions:</strong></span>
@@ -128,9 +127,9 @@
                 argument types.
               </li>
 </ul></div>
-<a name="range.reference.algorithms.non_mutating.lower_bound.precondition_"></a><h6>
-<a name="id723687"></a>
-            <a class="link" href="lower_bound.html#range.reference.algorithms.non_mutating.lower_bound.precondition_">Precondition:</a>
+<h6>
+<a name="range.reference.algorithms.non_mutating.lower_bound.h4"></a>
+            <span><a name="range.reference.algorithms.non_mutating.lower_bound.precondition_"></a></span><a class="link" href="lower_bound.html#range.reference.algorithms.non_mutating.lower_bound.precondition_">Precondition:</a>
           </h6>
 <p>
             <span class="bold"><strong>For the non-predicate versions:</strong></span>
@@ -146,9 +145,9 @@
             <code class="computeroutput"><span class="identifier">rng</span></code> is sorted in ascending
             order according to <code class="computeroutput"><span class="identifier">pred</span></code>.
           </p>
-<a name="range.reference.algorithms.non_mutating.lower_bound.complexity"></a><h6>
-<a name="id723780"></a>
-            <a class="link" href="lower_bound.html#range.reference.algorithms.non_mutating.lower_bound.complexity">Complexity</a>
+<h6>
+<a name="range.reference.algorithms.non_mutating.lower_bound.h5"></a>
+            <span><a name="range.reference.algorithms.non_mutating.lower_bound.complexity"></a></span><a class="link" href="lower_bound.html#range.reference.algorithms.non_mutating.lower_bound.complexity">Complexity</a>
           </h6>
 <p>
             For ranges that model the <a class="link" href="../../../concepts/random_access_range.html" title="Random Access Range">Random
@@ -161,7 +160,8 @@
 </div>
 <table xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" width="100%"><tr>
 <td align="left"></td>
-<td align="right"><div class="copyright-footer">Copyright &#169; 2003 -2010 Thorsten Ottosen, Neil Groves<p>
+<td align="right"><div class="copyright-footer">Copyright &#169; 2003-2010 Thorsten Ottosen,
+      Neil Groves<p>
         Distributed under the Boost Software License, Version 1.0. (See accompanying
         file LICENSE_1_0.txt or copy at <a href="http://www.boost.org/LICENSE_1_0.txt" target="_top">http://www.boost.org/LICENSE_1_0.txt</a>)
       </p>
diff --git a/doc/html/range/reference/algorithms/non_mutating/max_element.html b/doc/html/range/reference/algorithms/non_mutating/max_element.html
index 52f7c53..c9e242e 100644
--- a/doc/html/range/reference/algorithms/non_mutating/max_element.html
+++ b/doc/html/range/reference/algorithms/non_mutating/max_element.html
@@ -22,16 +22,15 @@
 <div class="spirit-nav">
 <a accesskey="p" href="lower_bound.html"><img src="../../../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../non_mutating.html"><img src="../../../../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../../../../index.html"><img src="../../../../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="min_element.html"><img src="../../../../../../../../doc/src/images/next.png" alt="Next"></a>
 </div>
-<div class="section">
+<div class="section range_reference_algorithms_non_mutating_max_element">
 <div class="titlepage"><div><div><h5 class="title">
 <a name="range.reference.algorithms.non_mutating.max_element"></a><a class="link" href="max_element.html" title="max_element">max_element</a>
 </h5></div></div></div>
-<a name="range.reference.algorithms.non_mutating.max_element.prototype"></a><h6>
-<a name="id723919"></a>
-            <a class="link" href="max_element.html#range.reference.algorithms.non_mutating.max_element.prototype">Prototype</a>
+<h6>
+<a name="range.reference.algorithms.non_mutating.max_element.h0"></a>
+            <span><a name="range.reference.algorithms.non_mutating.max_element.prototype"></a></span><a class="link" href="max_element.html#range.reference.algorithms.non_mutating.max_element.prototype">Prototype</a>
           </h6>
 <p>
-            
 </p>
 <pre class="programlisting"><span class="keyword">template</span><span class="special">&lt;</span><span class="keyword">class</span> <span class="identifier">ForwardRange</span><span class="special">&gt;</span>
 <span class="keyword">typename</span> <span class="identifier">range_iterator</span><span class="special">&lt;</span><span class="identifier">ForwardRange</span><span class="special">&gt;::</span><span class="identifier">type</span>
@@ -82,9 +81,9 @@
 </pre>
 <p>
           </p>
-<a name="range.reference.algorithms.non_mutating.max_element.description"></a><h6>
-<a name="id724905"></a>
-            <a class="link" href="max_element.html#range.reference.algorithms.non_mutating.max_element.description">Description</a>
+<h6>
+<a name="range.reference.algorithms.non_mutating.max_element.h1"></a>
+            <span><a name="range.reference.algorithms.non_mutating.max_element.description"></a></span><a class="link" href="max_element.html#range.reference.algorithms.non_mutating.max_element.description">Description</a>
           </h6>
 <p>
             The versions of <code class="computeroutput"><span class="identifier">max_element</span></code>
@@ -96,16 +95,16 @@
             defines <code class="computeroutput"><span class="identifier">found</span></code> in the
             same manner as the returned iterator described above.
           </p>
-<a name="range.reference.algorithms.non_mutating.max_element.definition"></a><h6>
-<a name="id725000"></a>
-            <a class="link" href="max_element.html#range.reference.algorithms.non_mutating.max_element.definition">Definition</a>
+<h6>
+<a name="range.reference.algorithms.non_mutating.max_element.h2"></a>
+            <span><a name="range.reference.algorithms.non_mutating.max_element.definition"></a></span><a class="link" href="max_element.html#range.reference.algorithms.non_mutating.max_element.definition">Definition</a>
           </h6>
 <p>
             Defined in the header file <code class="computeroutput"><span class="identifier">boost</span><span class="special">/</span><span class="identifier">range</span><span class="special">/</span><span class="identifier">algorithm</span><span class="special">/</span><span class="identifier">max_element</span><span class="special">.</span><span class="identifier">hpp</span></code>
           </p>
-<a name="range.reference.algorithms.non_mutating.max_element.requirements"></a><h6>
-<a name="id725071"></a>
-            <a class="link" href="max_element.html#range.reference.algorithms.non_mutating.max_element.requirements">Requirements</a>
+<h6>
+<a name="range.reference.algorithms.non_mutating.max_element.h3"></a>
+            <span><a name="range.reference.algorithms.non_mutating.max_element.requirements"></a></span><a class="link" href="max_element.html#range.reference.algorithms.non_mutating.max_element.requirements">Requirements</a>
           </h6>
 <p>
             <span class="bold"><strong>For the non-predicate versions:</strong></span>
@@ -140,9 +139,9 @@
                 argument types.
               </li>
 </ul></div>
-<a name="range.reference.algorithms.non_mutating.max_element.complexity"></a><h6>
-<a name="id725249"></a>
-            <a class="link" href="max_element.html#range.reference.algorithms.non_mutating.max_element.complexity">Complexity</a>
+<h6>
+<a name="range.reference.algorithms.non_mutating.max_element.h4"></a>
+            <span><a name="range.reference.algorithms.non_mutating.max_element.complexity"></a></span><a class="link" href="max_element.html#range.reference.algorithms.non_mutating.max_element.complexity">Complexity</a>
           </h6>
 <p>
             Linear. Zero comparisons if <code class="computeroutput"><span class="identifier">empty</span><span class="special">(</span><span class="identifier">rng</span><span class="special">)</span></code>, otherwise <code class="computeroutput"><span class="identifier">distance</span><span class="special">(</span><span class="identifier">rng</span><span class="special">)</span> <span class="special">-</span> <span class="number">1</span></code>
@@ -151,7 +150,8 @@
 </div>
 <table xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" width="100%"><tr>
 <td align="left"></td>
-<td align="right"><div class="copyright-footer">Copyright &#169; 2003 -2010 Thorsten Ottosen, Neil Groves<p>
+<td align="right"><div class="copyright-footer">Copyright &#169; 2003-2010 Thorsten Ottosen,
+      Neil Groves<p>
         Distributed under the Boost Software License, Version 1.0. (See accompanying
         file LICENSE_1_0.txt or copy at <a href="http://www.boost.org/LICENSE_1_0.txt" target="_top">http://www.boost.org/LICENSE_1_0.txt</a>)
       </p>
diff --git a/doc/html/range/reference/algorithms/non_mutating/min_element.html b/doc/html/range/reference/algorithms/non_mutating/min_element.html
index 26cd301..6c5e7da 100644
--- a/doc/html/range/reference/algorithms/non_mutating/min_element.html
+++ b/doc/html/range/reference/algorithms/non_mutating/min_element.html
@@ -22,16 +22,15 @@
 <div class="spirit-nav">
 <a accesskey="p" href="max_element.html"><img src="../../../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../non_mutating.html"><img src="../../../../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../../../../index.html"><img src="../../../../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="mismatch.html"><img src="../../../../../../../../doc/src/images/next.png" alt="Next"></a>
 </div>
-<div class="section">
+<div class="section range_reference_algorithms_non_mutating_min_element">
 <div class="titlepage"><div><div><h5 class="title">
 <a name="range.reference.algorithms.non_mutating.min_element"></a><a class="link" href="min_element.html" title="min_element">min_element</a>
 </h5></div></div></div>
-<a name="range.reference.algorithms.non_mutating.min_element.prototype"></a><h6>
-<a name="id725348"></a>
-            <a class="link" href="min_element.html#range.reference.algorithms.non_mutating.min_element.prototype">Prototype</a>
+<h6>
+<a name="range.reference.algorithms.non_mutating.min_element.h0"></a>
+            <span><a name="range.reference.algorithms.non_mutating.min_element.prototype"></a></span><a class="link" href="min_element.html#range.reference.algorithms.non_mutating.min_element.prototype">Prototype</a>
           </h6>
 <p>
-            
 </p>
 <pre class="programlisting"><span class="keyword">template</span><span class="special">&lt;</span><span class="keyword">class</span> <span class="identifier">ForwardRange</span><span class="special">&gt;</span>
 <span class="keyword">typename</span> <span class="identifier">range_iterator</span><span class="special">&lt;</span><span class="identifier">ForwardRange</span><span class="special">&gt;::</span><span class="identifier">type</span>
@@ -82,9 +81,9 @@
 </pre>
 <p>
           </p>
-<a name="range.reference.algorithms.non_mutating.min_element.description"></a><h6>
-<a name="id726335"></a>
-            <a class="link" href="min_element.html#range.reference.algorithms.non_mutating.min_element.description">Description</a>
+<h6>
+<a name="range.reference.algorithms.non_mutating.min_element.h1"></a>
+            <span><a name="range.reference.algorithms.non_mutating.min_element.description"></a></span><a class="link" href="min_element.html#range.reference.algorithms.non_mutating.min_element.description">Description</a>
           </h6>
 <p>
             The versions of <code class="computeroutput"><span class="identifier">min_element</span></code>
@@ -96,16 +95,16 @@
             defines <code class="computeroutput"><span class="identifier">found</span></code> in the
             same manner as the returned iterator described above.
           </p>
-<a name="range.reference.algorithms.non_mutating.min_element.definition"></a><h6>
-<a name="id726429"></a>
-            <a class="link" href="min_element.html#range.reference.algorithms.non_mutating.min_element.definition">Definition</a>
+<h6>
+<a name="range.reference.algorithms.non_mutating.min_element.h2"></a>
+            <span><a name="range.reference.algorithms.non_mutating.min_element.definition"></a></span><a class="link" href="min_element.html#range.reference.algorithms.non_mutating.min_element.definition">Definition</a>
           </h6>
 <p>
             Defined in the header file <code class="computeroutput"><span class="identifier">boost</span><span class="special">/</span><span class="identifier">range</span><span class="special">/</span><span class="identifier">algorithm</span><span class="special">/</span><span class="identifier">min_element</span><span class="special">.</span><span class="identifier">hpp</span></code>
           </p>
-<a name="range.reference.algorithms.non_mutating.min_element.requirements"></a><h6>
-<a name="id726500"></a>
-            <a class="link" href="min_element.html#range.reference.algorithms.non_mutating.min_element.requirements">Requirements</a>
+<h6>
+<a name="range.reference.algorithms.non_mutating.min_element.h3"></a>
+            <span><a name="range.reference.algorithms.non_mutating.min_element.requirements"></a></span><a class="link" href="min_element.html#range.reference.algorithms.non_mutating.min_element.requirements">Requirements</a>
           </h6>
 <p>
             <span class="bold"><strong>For the non-predicate versions:</strong></span>
@@ -140,9 +139,9 @@
                 argument types.
               </li>
 </ul></div>
-<a name="range.reference.algorithms.non_mutating.min_element.complexity"></a><h6>
-<a name="id726678"></a>
-            <a class="link" href="min_element.html#range.reference.algorithms.non_mutating.min_element.complexity">Complexity</a>
+<h6>
+<a name="range.reference.algorithms.non_mutating.min_element.h4"></a>
+            <span><a name="range.reference.algorithms.non_mutating.min_element.complexity"></a></span><a class="link" href="min_element.html#range.reference.algorithms.non_mutating.min_element.complexity">Complexity</a>
           </h6>
 <p>
             Linear. Zero comparisons if <code class="computeroutput"><span class="identifier">empty</span><span class="special">(</span><span class="identifier">rng</span><span class="special">)</span></code>, otherwise <code class="computeroutput"><span class="identifier">distance</span><span class="special">(</span><span class="identifier">rng</span><span class="special">)</span> <span class="special">-</span> <span class="number">1</span></code>
@@ -151,7 +150,8 @@
 </div>
 <table xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" width="100%"><tr>
 <td align="left"></td>
-<td align="right"><div class="copyright-footer">Copyright &#169; 2003 -2010 Thorsten Ottosen, Neil Groves<p>
+<td align="right"><div class="copyright-footer">Copyright &#169; 2003-2010 Thorsten Ottosen,
+      Neil Groves<p>
         Distributed under the Boost Software License, Version 1.0. (See accompanying
         file LICENSE_1_0.txt or copy at <a href="http://www.boost.org/LICENSE_1_0.txt" target="_top">http://www.boost.org/LICENSE_1_0.txt</a>)
       </p>
diff --git a/doc/html/range/reference/algorithms/non_mutating/mismatch.html b/doc/html/range/reference/algorithms/non_mutating/mismatch.html
index cbfad8a..df6cf62 100644
--- a/doc/html/range/reference/algorithms/non_mutating/mismatch.html
+++ b/doc/html/range/reference/algorithms/non_mutating/mismatch.html
@@ -22,16 +22,15 @@
 <div class="spirit-nav">
 <a accesskey="p" href="min_element.html"><img src="../../../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../non_mutating.html"><img src="../../../../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../../../../index.html"><img src="../../../../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="search.html"><img src="../../../../../../../../doc/src/images/next.png" alt="Next"></a>
 </div>
-<div class="section">
+<div class="section range_reference_algorithms_non_mutating_mismatch">
 <div class="titlepage"><div><div><h5 class="title">
 <a name="range.reference.algorithms.non_mutating.mismatch"></a><a class="link" href="mismatch.html" title="mismatch">mismatch</a>
 </h5></div></div></div>
-<a name="range.reference.algorithms.non_mutating.mismatch.prototype"></a><h6>
-<a name="id726777"></a>
-            <a class="link" href="mismatch.html#range.reference.algorithms.non_mutating.mismatch.prototype">Prototype</a>
+<h6>
+<a name="range.reference.algorithms.non_mutating.mismatch.h0"></a>
+            <span><a name="range.reference.algorithms.non_mutating.mismatch.prototype"></a></span><a class="link" href="mismatch.html#range.reference.algorithms.non_mutating.mismatch.prototype">Prototype</a>
           </h6>
 <p>
-            
 </p>
 <pre class="programlisting"><span class="keyword">template</span><span class="special">&lt;</span><span class="keyword">class</span> <span class="identifier">SinglePassRange1</span><span class="special">,</span> <span class="keyword">class</span> <span class="identifier">SinglePassRange2</span><span class="special">&gt;</span>
 <span class="identifier">std</span><span class="special">::</span><span class="identifier">pair</span><span class="special">&lt;</span>
@@ -104,9 +103,9 @@
 </pre>
 <p>
           </p>
-<a name="range.reference.algorithms.non_mutating.mismatch.description"></a><h6>
-<a name="id728481"></a>
-            <a class="link" href="mismatch.html#range.reference.algorithms.non_mutating.mismatch.description">Description</a>
+<h6>
+<a name="range.reference.algorithms.non_mutating.mismatch.h1"></a>
+            <span><a name="range.reference.algorithms.non_mutating.mismatch.description"></a></span><a class="link" href="mismatch.html#range.reference.algorithms.non_mutating.mismatch.description">Description</a>
           </h6>
 <p>
             <code class="computeroutput"><span class="identifier">mismatch</span></code> finds the first
@@ -116,16 +115,16 @@
 <p>
             Equality is determined by <code class="computeroutput"><span class="keyword">operator</span><span class="special">==</span></code> for non-predicate versions of <code class="computeroutput"><span class="identifier">mismatch</span></code>, and by satisfying <code class="computeroutput"><span class="identifier">pred</span></code> in the predicate versions.
           </p>
-<a name="range.reference.algorithms.non_mutating.mismatch.definition"></a><h6>
-<a name="id728578"></a>
-            <a class="link" href="mismatch.html#range.reference.algorithms.non_mutating.mismatch.definition">Definition</a>
+<h6>
+<a name="range.reference.algorithms.non_mutating.mismatch.h2"></a>
+            <span><a name="range.reference.algorithms.non_mutating.mismatch.definition"></a></span><a class="link" href="mismatch.html#range.reference.algorithms.non_mutating.mismatch.definition">Definition</a>
           </h6>
 <p>
             Defined in the header file <code class="computeroutput"><span class="identifier">boost</span><span class="special">/</span><span class="identifier">range</span><span class="special">/</span><span class="identifier">algorithm</span><span class="special">/</span><span class="identifier">mismatch</span><span class="special">.</span><span class="identifier">hpp</span></code>
           </p>
-<a name="range.reference.algorithms.non_mutating.mismatch.requirements"></a><h6>
-<a name="id728648"></a>
-            <a class="link" href="mismatch.html#range.reference.algorithms.non_mutating.mismatch.requirements">Requirements</a>
+<h6>
+<a name="range.reference.algorithms.non_mutating.mismatch.h3"></a>
+            <span><a name="range.reference.algorithms.non_mutating.mismatch.requirements"></a></span><a class="link" href="mismatch.html#range.reference.algorithms.non_mutating.mismatch.requirements">Requirements</a>
           </h6>
 <p>
             <span class="bold"><strong>For the non-predicate versions:</strong></span>
@@ -184,16 +183,16 @@
                 second argument type.
               </li>
 </ul></div>
-<a name="range.reference.algorithms.non_mutating.mismatch.precondition_"></a><h6>
-<a name="id728960"></a>
-            <a class="link" href="mismatch.html#range.reference.algorithms.non_mutating.mismatch.precondition_">Precondition:</a>
+<h6>
+<a name="range.reference.algorithms.non_mutating.mismatch.h4"></a>
+            <span><a name="range.reference.algorithms.non_mutating.mismatch.precondition_"></a></span><a class="link" href="mismatch.html#range.reference.algorithms.non_mutating.mismatch.precondition_">Precondition:</a>
           </h6>
 <p>
             <code class="computeroutput"><span class="identifier">distance</span><span class="special">(</span><span class="identifier">rng2</span><span class="special">)</span> <span class="special">&gt;=</span> <span class="identifier">distance</span><span class="special">(</span><span class="identifier">rng1</span><span class="special">)</span></code>
           </p>
-<a name="range.reference.algorithms.non_mutating.mismatch.complexity"></a><h6>
-<a name="id729032"></a>
-            <a class="link" href="mismatch.html#range.reference.algorithms.non_mutating.mismatch.complexity">Complexity</a>
+<h6>
+<a name="range.reference.algorithms.non_mutating.mismatch.h5"></a>
+            <span><a name="range.reference.algorithms.non_mutating.mismatch.complexity"></a></span><a class="link" href="mismatch.html#range.reference.algorithms.non_mutating.mismatch.complexity">Complexity</a>
           </h6>
 <p>
             Linear. At most <code class="computeroutput"><span class="identifier">distance</span><span class="special">(</span><span class="identifier">rng1</span><span class="special">)</span></code> comparisons.
@@ -201,7 +200,8 @@
 </div>
 <table xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" width="100%"><tr>
 <td align="left"></td>
-<td align="right"><div class="copyright-footer">Copyright &#169; 2003 -2010 Thorsten Ottosen, Neil Groves<p>
+<td align="right"><div class="copyright-footer">Copyright &#169; 2003-2010 Thorsten Ottosen,
+      Neil Groves<p>
         Distributed under the Boost Software License, Version 1.0. (See accompanying
         file LICENSE_1_0.txt or copy at <a href="http://www.boost.org/LICENSE_1_0.txt" target="_top">http://www.boost.org/LICENSE_1_0.txt</a>)
       </p>
diff --git a/doc/html/range/reference/algorithms/non_mutating/search.html b/doc/html/range/reference/algorithms/non_mutating/search.html
index 427642b..64a69b2 100644
--- a/doc/html/range/reference/algorithms/non_mutating/search.html
+++ b/doc/html/range/reference/algorithms/non_mutating/search.html
@@ -22,16 +22,15 @@
 <div class="spirit-nav">
 <a accesskey="p" href="mismatch.html"><img src="../../../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../non_mutating.html"><img src="../../../../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../../../../index.html"><img src="../../../../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="search_n.html"><img src="../../../../../../../../doc/src/images/next.png" alt="Next"></a>
 </div>
-<div class="section">
+<div class="section range_reference_algorithms_non_mutating_search">
 <div class="titlepage"><div><div><h5 class="title">
 <a name="range.reference.algorithms.non_mutating.search"></a><a class="link" href="search.html" title="search">search</a>
 </h5></div></div></div>
-<a name="range.reference.algorithms.non_mutating.search.prototype"></a><h6>
-<a name="id729096"></a>
-            <a class="link" href="search.html#range.reference.algorithms.non_mutating.search.prototype">Prototype</a>
+<h6>
+<a name="range.reference.algorithms.non_mutating.search.h0"></a>
+            <span><a name="range.reference.algorithms.non_mutating.search.prototype"></a></span><a class="link" href="search.html#range.reference.algorithms.non_mutating.search.prototype">Prototype</a>
           </h6>
 <p>
-            
 </p>
 <pre class="programlisting"><span class="keyword">template</span><span class="special">&lt;</span><span class="keyword">class</span> <span class="identifier">ForwardRange1</span><span class="special">,</span> <span class="keyword">class</span> <span class="identifier">ForwardRange2</span><span class="special">&gt;</span>
 <span class="keyword">typename</span> <span class="identifier">range_iterator</span><span class="special">&lt;</span><span class="identifier">ForwardRange1</span><span class="special">&gt;::</span><span class="identifier">type</span>
@@ -94,9 +93,9 @@
 </pre>
 <p>
           </p>
-<a name="range.reference.algorithms.non_mutating.search.description"></a><h6>
-<a name="id730434"></a>
-            <a class="link" href="search.html#range.reference.algorithms.non_mutating.search.description">Description</a>
+<h6>
+<a name="range.reference.algorithms.non_mutating.search.h1"></a>
+            <span><a name="range.reference.algorithms.non_mutating.search.description"></a></span><a class="link" href="search.html#range.reference.algorithms.non_mutating.search.description">Description</a>
           </h6>
 <p>
             The versions of <code class="computeroutput"><span class="identifier">search</span></code>
@@ -113,16 +112,16 @@
             defines <code class="computeroutput"><span class="identifier">found</span></code> in the
             same manner as the returned iterator described above.
           </p>
-<a name="range.reference.algorithms.non_mutating.search.definition"></a><h6>
-<a name="id730597"></a>
-            <a class="link" href="search.html#range.reference.algorithms.non_mutating.search.definition">Definition</a>
+<h6>
+<a name="range.reference.algorithms.non_mutating.search.h2"></a>
+            <span><a name="range.reference.algorithms.non_mutating.search.definition"></a></span><a class="link" href="search.html#range.reference.algorithms.non_mutating.search.definition">Definition</a>
           </h6>
 <p>
             Defined in the header file <code class="computeroutput"><span class="identifier">boost</span><span class="special">/</span><span class="identifier">range</span><span class="special">/</span><span class="identifier">algorithm</span><span class="special">/</span><span class="identifier">search</span><span class="special">.</span><span class="identifier">hpp</span></code>
           </p>
-<a name="range.reference.algorithms.non_mutating.search.requirements"></a><h6>
-<a name="id730668"></a>
-            <a class="link" href="search.html#range.reference.algorithms.non_mutating.search.requirements">Requirements</a>
+<h6>
+<a name="range.reference.algorithms.non_mutating.search.h3"></a>
+            <span><a name="range.reference.algorithms.non_mutating.search.requirements"></a></span><a class="link" href="search.html#range.reference.algorithms.non_mutating.search.requirements">Requirements</a>
           </h6>
 <p>
             <span class="bold"><strong>For the non-predicate versions:</strong></span>
@@ -181,9 +180,9 @@
                 second argument type.
               </li>
 </ul></div>
-<a name="range.reference.algorithms.non_mutating.search.complexity"></a><h6>
-<a name="id730979"></a>
-            <a class="link" href="search.html#range.reference.algorithms.non_mutating.search.complexity">Complexity</a>
+<h6>
+<a name="range.reference.algorithms.non_mutating.search.h4"></a>
+            <span><a name="range.reference.algorithms.non_mutating.search.complexity"></a></span><a class="link" href="search.html#range.reference.algorithms.non_mutating.search.complexity">Complexity</a>
           </h6>
 <p>
             Average complexity is Linear. Worst-case complexity is quadratic.
@@ -191,7 +190,8 @@
 </div>
 <table xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" width="100%"><tr>
 <td align="left"></td>
-<td align="right"><div class="copyright-footer">Copyright &#169; 2003 -2010 Thorsten Ottosen, Neil Groves<p>
+<td align="right"><div class="copyright-footer">Copyright &#169; 2003-2010 Thorsten Ottosen,
+      Neil Groves<p>
         Distributed under the Boost Software License, Version 1.0. (See accompanying
         file LICENSE_1_0.txt or copy at <a href="http://www.boost.org/LICENSE_1_0.txt" target="_top">http://www.boost.org/LICENSE_1_0.txt</a>)
       </p>
diff --git a/doc/html/range/reference/algorithms/non_mutating/search_n.html b/doc/html/range/reference/algorithms/non_mutating/search_n.html
index 6bc149d..852a89b 100644
--- a/doc/html/range/reference/algorithms/non_mutating/search_n.html
+++ b/doc/html/range/reference/algorithms/non_mutating/search_n.html
@@ -22,16 +22,15 @@
 <div class="spirit-nav">
 <a accesskey="p" href="search.html"><img src="../../../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../non_mutating.html"><img src="../../../../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../../../../index.html"><img src="../../../../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="upper_bound.html"><img src="../../../../../../../../doc/src/images/next.png" alt="Next"></a>
 </div>
-<div class="section">
+<div class="section range_reference_algorithms_non_mutating_search_n">
 <div class="titlepage"><div><div><h5 class="title">
 <a name="range.reference.algorithms.non_mutating.search_n"></a><a class="link" href="search_n.html" title="search_n">search_n</a>
 </h5></div></div></div>
-<a name="range.reference.algorithms.non_mutating.search_n.prototype"></a><h6>
-<a name="id731020"></a>
-            <a class="link" href="search_n.html#range.reference.algorithms.non_mutating.search_n.prototype">Prototype</a>
+<h6>
+<a name="range.reference.algorithms.non_mutating.search_n.h0"></a>
+            <span><a name="range.reference.algorithms.non_mutating.search_n.prototype"></a></span><a class="link" href="search_n.html#range.reference.algorithms.non_mutating.search_n.prototype">Prototype</a>
           </h6>
 <p>
-            
 </p>
 <pre class="programlisting"><span class="keyword">template</span><span class="special">&lt;</span><span class="keyword">class</span> <span class="identifier">ForwardRange</span><span class="special">,</span> <span class="keyword">class</span> <span class="identifier">Integer</span><span class="special">,</span> <span class="keyword">class</span> <span class="identifier">Value</span><span class="special">&gt;</span>
 <span class="keyword">typename</span> <span class="identifier">range_iterator</span><span class="special">&lt;</span><span class="identifier">ForwardRange</span><span class="special">&gt;::</span><span class="identifier">type</span>
@@ -53,25 +52,25 @@
 </pre>
 <p>
           </p>
-<a name="range.reference.algorithms.non_mutating.search_n.description"></a><h6>
-<a name="id731769"></a>
-            <a class="link" href="search_n.html#range.reference.algorithms.non_mutating.search_n.description">Description</a>
+<h6>
+<a name="range.reference.algorithms.non_mutating.search_n.h1"></a>
+            <span><a name="range.reference.algorithms.non_mutating.search_n.description"></a></span><a class="link" href="search_n.html#range.reference.algorithms.non_mutating.search_n.description">Description</a>
           </h6>
 <p>
             <code class="computeroutput"><span class="identifier">search_n</span></code> searches <code class="computeroutput"><span class="identifier">rng</span></code> for a sequence of length <code class="computeroutput"><span class="identifier">n</span></code> equal to <code class="computeroutput"><span class="identifier">value</span></code>
             where equality is determined by operator== in the non-predicate case,
             and by a predicate when one is supplied.
           </p>
-<a name="range.reference.algorithms.non_mutating.search_n.definition"></a><h6>
-<a name="id731836"></a>
-            <a class="link" href="search_n.html#range.reference.algorithms.non_mutating.search_n.definition">Definition</a>
+<h6>
+<a name="range.reference.algorithms.non_mutating.search_n.h2"></a>
+            <span><a name="range.reference.algorithms.non_mutating.search_n.definition"></a></span><a class="link" href="search_n.html#range.reference.algorithms.non_mutating.search_n.definition">Definition</a>
           </h6>
 <p>
             Defined in the header file <code class="computeroutput"><span class="identifier">boost</span><span class="special">/</span><span class="identifier">range</span><span class="special">/</span><span class="identifier">algorithm</span><span class="special">/</span><span class="identifier">search_n</span><span class="special">.</span><span class="identifier">hpp</span></code>
           </p>
-<a name="range.reference.algorithms.non_mutating.search_n.requirements"></a><h6>
-<a name="id731906"></a>
-            <a class="link" href="search_n.html#range.reference.algorithms.non_mutating.search_n.requirements">Requirements</a>
+<h6>
+<a name="range.reference.algorithms.non_mutating.search_n.h3"></a>
+            <span><a name="range.reference.algorithms.non_mutating.search_n.requirements"></a></span><a class="link" href="search_n.html#range.reference.algorithms.non_mutating.search_n.requirements">Requirements</a>
           </h6>
 <p>
             <span class="bold"><strong>For the non-predicate versions:</strong></span>
@@ -123,9 +122,9 @@
                 of the <code class="computeroutput"><span class="identifier">IntegerConcept</span></code>.
               </li>
 </ul></div>
-<a name="range.reference.algorithms.non_mutating.search_n.complexity"></a><h6>
-<a name="id732195"></a>
-            <a class="link" href="search_n.html#range.reference.algorithms.non_mutating.search_n.complexity">Complexity</a>
+<h6>
+<a name="range.reference.algorithms.non_mutating.search_n.h4"></a>
+            <span><a name="range.reference.algorithms.non_mutating.search_n.complexity"></a></span><a class="link" href="search_n.html#range.reference.algorithms.non_mutating.search_n.complexity">Complexity</a>
           </h6>
 <p>
             Average complexity is Linear. Worst-case complexity is quadratic.
@@ -133,7 +132,8 @@
 </div>
 <table xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" width="100%"><tr>
 <td align="left"></td>
-<td align="right"><div class="copyright-footer">Copyright &#169; 2003 -2010 Thorsten Ottosen, Neil Groves<p>
+<td align="right"><div class="copyright-footer">Copyright &#169; 2003-2010 Thorsten Ottosen,
+      Neil Groves<p>
         Distributed under the Boost Software License, Version 1.0. (See accompanying
         file LICENSE_1_0.txt or copy at <a href="http://www.boost.org/LICENSE_1_0.txt" target="_top">http://www.boost.org/LICENSE_1_0.txt</a>)
       </p>
diff --git a/doc/html/range/reference/algorithms/non_mutating/upper_bound.html b/doc/html/range/reference/algorithms/non_mutating/upper_bound.html
index 7c5b03e..bdc556a 100644
--- a/doc/html/range/reference/algorithms/non_mutating/upper_bound.html
+++ b/doc/html/range/reference/algorithms/non_mutating/upper_bound.html
@@ -22,16 +22,15 @@
 <div class="spirit-nav">
 <a accesskey="p" href="search_n.html"><img src="../../../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../non_mutating.html"><img src="../../../../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../../../../index.html"><img src="../../../../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="../set.html"><img src="../../../../../../../../doc/src/images/next.png" alt="Next"></a>
 </div>
-<div class="section">
+<div class="section range_reference_algorithms_non_mutating_upper_bound">
 <div class="titlepage"><div><div><h5 class="title">
 <a name="range.reference.algorithms.non_mutating.upper_bound"></a><a class="link" href="upper_bound.html" title="upper_bound">upper_bound</a>
 </h5></div></div></div>
-<a name="range.reference.algorithms.non_mutating.upper_bound.prototype"></a><h6>
-<a name="id732236"></a>
-            <a class="link" href="upper_bound.html#range.reference.algorithms.non_mutating.upper_bound.prototype">Prototype</a>
+<h6>
+<a name="range.reference.algorithms.non_mutating.upper_bound.h0"></a>
+            <span><a name="range.reference.algorithms.non_mutating.upper_bound.prototype"></a></span><a class="link" href="upper_bound.html#range.reference.algorithms.non_mutating.upper_bound.prototype">Prototype</a>
           </h6>
 <p>
-            
 </p>
 <pre class="programlisting"><span class="keyword">template</span><span class="special">&lt;</span><span class="keyword">class</span> <span class="identifier">ForwardRange</span><span class="special">,</span> <span class="keyword">class</span> <span class="identifier">Value</span><span class="special">&gt;</span>
 <span class="keyword">typename</span> <span class="identifier">range_iterator</span><span class="special">&lt;</span><span class="identifier">ForwardRange</span><span class="special">&gt;::</span><span class="identifier">type</span>
@@ -47,9 +46,9 @@
 </pre>
 <p>
           </p>
-<a name="range.reference.algorithms.non_mutating.upper_bound.description"></a><h6>
-<a name="id732525"></a>
-            <a class="link" href="upper_bound.html#range.reference.algorithms.non_mutating.upper_bound.description">Description</a>
+<h6>
+<a name="range.reference.algorithms.non_mutating.upper_bound.h1"></a>
+            <span><a name="range.reference.algorithms.non_mutating.upper_bound.description"></a></span><a class="link" href="upper_bound.html#range.reference.algorithms.non_mutating.upper_bound.description">Description</a>
           </h6>
 <p>
             The versions of <code class="computeroutput"><span class="identifier">upper_bound</span></code>
@@ -69,16 +68,16 @@
             defines <code class="computeroutput"><span class="identifier">found</span></code> in the
             same manner as the returned iterator described above.
           </p>
-<a name="range.reference.algorithms.non_mutating.upper_bound.definition"></a><h6>
-<a name="id732719"></a>
-            <a class="link" href="upper_bound.html#range.reference.algorithms.non_mutating.upper_bound.definition">Definition</a>
+<h6>
+<a name="range.reference.algorithms.non_mutating.upper_bound.h2"></a>
+            <span><a name="range.reference.algorithms.non_mutating.upper_bound.definition"></a></span><a class="link" href="upper_bound.html#range.reference.algorithms.non_mutating.upper_bound.definition">Definition</a>
           </h6>
 <p>
             Defined in the header file <code class="computeroutput"><span class="identifier">boost</span><span class="special">/</span><span class="identifier">range</span><span class="special">/</span><span class="identifier">algorithm</span><span class="special">/</span><span class="identifier">upper_bound</span><span class="special">.</span><span class="identifier">hpp</span></code>
           </p>
-<a name="range.reference.algorithms.non_mutating.upper_bound.requirements"></a><h6>
-<a name="id732790"></a>
-            <a class="link" href="upper_bound.html#range.reference.algorithms.non_mutating.upper_bound.requirements">Requirements</a>
+<h6>
+<a name="range.reference.algorithms.non_mutating.upper_bound.h3"></a>
+            <span><a name="range.reference.algorithms.non_mutating.upper_bound.requirements"></a></span><a class="link" href="upper_bound.html#range.reference.algorithms.non_mutating.upper_bound.requirements">Requirements</a>
           </h6>
 <p>
             <span class="bold"><strong>For the non-predicate versions:</strong></span>
@@ -127,9 +126,9 @@
                 argument types.
               </li>
 </ul></div>
-<a name="range.reference.algorithms.non_mutating.upper_bound.precondition_"></a><h6>
-<a name="id733059"></a>
-            <a class="link" href="upper_bound.html#range.reference.algorithms.non_mutating.upper_bound.precondition_">Precondition:</a>
+<h6>
+<a name="range.reference.algorithms.non_mutating.upper_bound.h4"></a>
+            <span><a name="range.reference.algorithms.non_mutating.upper_bound.precondition_"></a></span><a class="link" href="upper_bound.html#range.reference.algorithms.non_mutating.upper_bound.precondition_">Precondition:</a>
           </h6>
 <p>
             <span class="bold"><strong>For the non-predicate versions:</strong></span>
@@ -145,9 +144,9 @@
             <code class="computeroutput"><span class="identifier">rng</span></code> is sorted in ascending
             order according to <code class="computeroutput"><span class="identifier">pred</span></code>.
           </p>
-<a name="range.reference.algorithms.non_mutating.upper_bound.complexity"></a><h6>
-<a name="id733150"></a>
-            <a class="link" href="upper_bound.html#range.reference.algorithms.non_mutating.upper_bound.complexity">Complexity</a>
+<h6>
+<a name="range.reference.algorithms.non_mutating.upper_bound.h5"></a>
+            <span><a name="range.reference.algorithms.non_mutating.upper_bound.complexity"></a></span><a class="link" href="upper_bound.html#range.reference.algorithms.non_mutating.upper_bound.complexity">Complexity</a>
           </h6>
 <p>
             For ranges that model the <a class="link" href="../../../concepts/random_access_range.html" title="Random Access Range">Random
@@ -158,7 +157,8 @@
 </div>
 <table xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" width="100%"><tr>
 <td align="left"></td>
-<td align="right"><div class="copyright-footer">Copyright &#169; 2003 -2010 Thorsten Ottosen, Neil Groves<p>
+<td align="right"><div class="copyright-footer">Copyright &#169; 2003-2010 Thorsten Ottosen,
+      Neil Groves<p>
         Distributed under the Boost Software License, Version 1.0. (See accompanying
         file LICENSE_1_0.txt or copy at <a href="http://www.boost.org/LICENSE_1_0.txt" target="_top">http://www.boost.org/LICENSE_1_0.txt</a>)
       </p>
diff --git a/doc/html/range/reference/algorithms/numeric.html b/doc/html/range/reference/algorithms/numeric.html
index b71fd54..a1f263a 100644
--- a/doc/html/range/reference/algorithms/numeric.html
+++ b/doc/html/range/reference/algorithms/numeric.html
@@ -22,7 +22,7 @@
 <div class="spirit-nav">
 <a accesskey="p" href="new/remove_erase_if.html"><img src="../../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../algorithms.html"><img src="../../../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../../../index.html"><img src="../../../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="numeric/accumulate.html"><img src="../../../../../../../doc/src/images/next.png" alt="Next"></a>
 </div>
-<div class="section">
+<div class="section range_reference_algorithms_numeric">
 <div class="titlepage"><div><div><h4 class="title">
 <a name="range.reference.algorithms.numeric"></a><a class="link" href="numeric.html" title="Numeric algorithms">Numeric algorithms</a>
 </h4></div></div></div>
@@ -35,7 +35,8 @@
 </div>
 <table xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" width="100%"><tr>
 <td align="left"></td>
-<td align="right"><div class="copyright-footer">Copyright &#169; 2003 -2010 Thorsten Ottosen, Neil Groves<p>
+<td align="right"><div class="copyright-footer">Copyright &#169; 2003-2010 Thorsten Ottosen,
+      Neil Groves<p>
         Distributed under the Boost Software License, Version 1.0. (See accompanying
         file LICENSE_1_0.txt or copy at <a href="http://www.boost.org/LICENSE_1_0.txt" target="_top">http://www.boost.org/LICENSE_1_0.txt</a>)
       </p>
diff --git a/doc/html/range/reference/algorithms/numeric/accumulate.html b/doc/html/range/reference/algorithms/numeric/accumulate.html
index a98dc0f..46fd9e7 100644
--- a/doc/html/range/reference/algorithms/numeric/accumulate.html
+++ b/doc/html/range/reference/algorithms/numeric/accumulate.html
@@ -22,16 +22,15 @@
 <div class="spirit-nav">
 <a accesskey="p" href="../numeric.html"><img src="../../../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../numeric.html"><img src="../../../../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../../../../index.html"><img src="../../../../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="adjacent_difference.html"><img src="../../../../../../../../doc/src/images/next.png" alt="Next"></a>
 </div>
-<div class="section">
+<div class="section range_reference_algorithms_numeric_accumulate">
 <div class="titlepage"><div><div><h5 class="title">
 <a name="range.reference.algorithms.numeric.accumulate"></a><a class="link" href="accumulate.html" title="accumulate">accumulate</a>
 </h5></div></div></div>
-<a name="range.reference.algorithms.numeric.accumulate.prototype"></a><h6>
-<a name="id750741"></a>
-            <a class="link" href="accumulate.html#range.reference.algorithms.numeric.accumulate.prototype">Prototype</a>
+<h6>
+<a name="range.reference.algorithms.numeric.accumulate.h0"></a>
+            <span><a name="range.reference.algorithms.numeric.accumulate.prototype"></a></span><a class="link" href="accumulate.html#range.reference.algorithms.numeric.accumulate.prototype">Prototype</a>
           </h6>
 <p>
-            
 </p>
 <pre class="programlisting"><span class="keyword">template</span><span class="special">&lt;</span>
     <span class="keyword">class</span> <span class="identifier">SinglePassRange</span><span class="special">,</span>
@@ -51,9 +50,9 @@
 </pre>
 <p>
           </p>
-<a name="range.reference.algorithms.numeric.accumulate.description"></a><h6>
-<a name="id751002"></a>
-            <a class="link" href="accumulate.html#range.reference.algorithms.numeric.accumulate.description">Description</a>
+<h6>
+<a name="range.reference.algorithms.numeric.accumulate.h1"></a>
+            <span><a name="range.reference.algorithms.numeric.accumulate.description"></a></span><a class="link" href="accumulate.html#range.reference.algorithms.numeric.accumulate.description">Description</a>
           </h6>
 <p>
             <code class="computeroutput"><span class="identifier">accumulate</span></code> is a generalisation
@@ -62,20 +61,20 @@
 <p>
             The return value is the resultant value of the above algorithm.
           </p>
-<a name="range.reference.algorithms.numeric.accumulate.definition"></a><h6>
-<a name="id751077"></a>
-            <a class="link" href="accumulate.html#range.reference.algorithms.numeric.accumulate.definition">Definition</a>
+<h6>
+<a name="range.reference.algorithms.numeric.accumulate.h2"></a>
+            <span><a name="range.reference.algorithms.numeric.accumulate.definition"></a></span><a class="link" href="accumulate.html#range.reference.algorithms.numeric.accumulate.definition">Definition</a>
           </h6>
 <p>
             Defined in the header file <code class="computeroutput"><span class="identifier">boost</span><span class="special">/</span><span class="identifier">range</span><span class="special">/</span><span class="identifier">numeric</span><span class="special">.</span><span class="identifier">hpp</span></code>
           </p>
-<a name="range.reference.algorithms.numeric.accumulate.requirements"></a><h6>
-<a name="id751139"></a>
-            <a class="link" href="accumulate.html#range.reference.algorithms.numeric.accumulate.requirements">Requirements</a>
+<h6>
+<a name="range.reference.algorithms.numeric.accumulate.h3"></a>
+            <span><a name="range.reference.algorithms.numeric.accumulate.requirements"></a></span><a class="link" href="accumulate.html#range.reference.algorithms.numeric.accumulate.requirements">Requirements</a>
           </h6>
-<a name="range.reference.algorithms.numeric.accumulate.for_the_first_version"></a><h6>
-<a name="id751160"></a>
-            <a class="link" href="accumulate.html#range.reference.algorithms.numeric.accumulate.for_the_first_version">For
+<h6>
+<a name="range.reference.algorithms.numeric.accumulate.h4"></a>
+            <span><a name="range.reference.algorithms.numeric.accumulate.for_the_first_version"></a></span><a class="link" href="accumulate.html#range.reference.algorithms.numeric.accumulate.for_the_first_version">For
             the first version</a>
           </h6>
 <div class="orderedlist"><ol class="orderedlist" type="1">
@@ -98,9 +97,9 @@
                 The return type of the above operator is convertible to <code class="computeroutput"><span class="identifier">Value</span></code>.
               </li>
 </ol></div>
-<a name="range.reference.algorithms.numeric.accumulate.for_the_second_version"></a><h6>
-<a name="id751302"></a>
-            <a class="link" href="accumulate.html#range.reference.algorithms.numeric.accumulate.for_the_second_version">For
+<h6>
+<a name="range.reference.algorithms.numeric.accumulate.h5"></a>
+            <span><a name="range.reference.algorithms.numeric.accumulate.for_the_second_version"></a></span><a class="link" href="accumulate.html#range.reference.algorithms.numeric.accumulate.for_the_second_version">For
             the second version</a>
           </h6>
 <div class="orderedlist"><ol class="orderedlist" type="1">
@@ -132,9 +131,9 @@
                 is convertible to <code class="computeroutput"><span class="identifier">Value</span></code>.
               </li>
 </ol></div>
-<a name="range.reference.algorithms.numeric.accumulate.complexity"></a><h6>
-<a name="id751495"></a>
-            <a class="link" href="accumulate.html#range.reference.algorithms.numeric.accumulate.complexity">Complexity</a>
+<h6>
+<a name="range.reference.algorithms.numeric.accumulate.h6"></a>
+            <span><a name="range.reference.algorithms.numeric.accumulate.complexity"></a></span><a class="link" href="accumulate.html#range.reference.algorithms.numeric.accumulate.complexity">Complexity</a>
           </h6>
 <p>
             Linear. Exactly <code class="computeroutput"><span class="identifier">distance</span><span class="special">(</span><span class="identifier">source_rng</span><span class="special">)</span></code>.
@@ -142,7 +141,8 @@
 </div>
 <table xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" width="100%"><tr>
 <td align="left"></td>
-<td align="right"><div class="copyright-footer">Copyright &#169; 2003 -2010 Thorsten Ottosen, Neil Groves<p>
+<td align="right"><div class="copyright-footer">Copyright &#169; 2003-2010 Thorsten Ottosen,
+      Neil Groves<p>
         Distributed under the Boost Software License, Version 1.0. (See accompanying
         file LICENSE_1_0.txt or copy at <a href="http://www.boost.org/LICENSE_1_0.txt" target="_top">http://www.boost.org/LICENSE_1_0.txt</a>)
       </p>
diff --git a/doc/html/range/reference/algorithms/numeric/adjacent_difference.html b/doc/html/range/reference/algorithms/numeric/adjacent_difference.html
index c704d2a..198910f 100644
--- a/doc/html/range/reference/algorithms/numeric/adjacent_difference.html
+++ b/doc/html/range/reference/algorithms/numeric/adjacent_difference.html
@@ -22,16 +22,15 @@
 <div class="spirit-nav">
 <a accesskey="p" href="accumulate.html"><img src="../../../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../numeric.html"><img src="../../../../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../../../../index.html"><img src="../../../../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="inner_product.html"><img src="../../../../../../../../doc/src/images/next.png" alt="Next"></a>
 </div>
-<div class="section">
+<div class="section range_reference_algorithms_numeric_adjacent_difference">
 <div class="titlepage"><div><div><h5 class="title">
 <a name="range.reference.algorithms.numeric.adjacent_difference"></a><a class="link" href="adjacent_difference.html" title="adjacent_difference">adjacent_difference</a>
 </h5></div></div></div>
-<a name="range.reference.algorithms.numeric.adjacent_difference.prototype"></a><h6>
-<a name="id751560"></a>
-            <a class="link" href="adjacent_difference.html#range.reference.algorithms.numeric.adjacent_difference.prototype">Prototype</a>
+<h6>
+<a name="range.reference.algorithms.numeric.adjacent_difference.h0"></a>
+            <span><a name="range.reference.algorithms.numeric.adjacent_difference.prototype"></a></span><a class="link" href="adjacent_difference.html#range.reference.algorithms.numeric.adjacent_difference.prototype">Prototype</a>
           </h6>
 <p>
-            
 </p>
 <pre class="programlisting"><span class="keyword">template</span><span class="special">&lt;</span>
     <span class="keyword">class</span> <span class="identifier">SinglePassRange</span><span class="special">,</span>
@@ -53,9 +52,9 @@
 </pre>
 <p>
           </p>
-<a name="range.reference.algorithms.numeric.adjacent_difference.description"></a><h6>
-<a name="id751824"></a>
-            <a class="link" href="adjacent_difference.html#range.reference.algorithms.numeric.adjacent_difference.description">Description</a>
+<h6>
+<a name="range.reference.algorithms.numeric.adjacent_difference.h1"></a>
+            <span><a name="range.reference.algorithms.numeric.adjacent_difference.description"></a></span><a class="link" href="adjacent_difference.html#range.reference.algorithms.numeric.adjacent_difference.description">Description</a>
           </h6>
 <p>
             <code class="computeroutput"><span class="identifier">adjacent_difference</span></code> calculates
@@ -67,20 +66,20 @@
             to calculate the differences. The second version uses <code class="computeroutput"><span class="identifier">BinaryOperation</span></code>
             instead of <code class="computeroutput"><span class="keyword">operator</span><span class="special">-()</span></code>.
           </p>
-<a name="range.reference.algorithms.numeric.adjacent_difference.definition"></a><h6>
-<a name="id751925"></a>
-            <a class="link" href="adjacent_difference.html#range.reference.algorithms.numeric.adjacent_difference.definition">Definition</a>
+<h6>
+<a name="range.reference.algorithms.numeric.adjacent_difference.h2"></a>
+            <span><a name="range.reference.algorithms.numeric.adjacent_difference.definition"></a></span><a class="link" href="adjacent_difference.html#range.reference.algorithms.numeric.adjacent_difference.definition">Definition</a>
           </h6>
 <p>
             Defined in the header file <code class="computeroutput"><span class="identifier">boost</span><span class="special">/</span><span class="identifier">range</span><span class="special">/</span><span class="identifier">numeric</span><span class="special">.</span><span class="identifier">hpp</span></code>
           </p>
-<a name="range.reference.algorithms.numeric.adjacent_difference.requirements"></a><h6>
-<a name="id751986"></a>
-            <a class="link" href="adjacent_difference.html#range.reference.algorithms.numeric.adjacent_difference.requirements">Requirements</a>
+<h6>
+<a name="range.reference.algorithms.numeric.adjacent_difference.h3"></a>
+            <span><a name="range.reference.algorithms.numeric.adjacent_difference.requirements"></a></span><a class="link" href="adjacent_difference.html#range.reference.algorithms.numeric.adjacent_difference.requirements">Requirements</a>
           </h6>
-<a name="range.reference.algorithms.numeric.adjacent_difference.for_the_first_version"></a><h6>
-<a name="id752008"></a>
-            <a class="link" href="adjacent_difference.html#range.reference.algorithms.numeric.adjacent_difference.for_the_first_version">For
+<h6>
+<a name="range.reference.algorithms.numeric.adjacent_difference.h4"></a>
+            <span><a name="range.reference.algorithms.numeric.adjacent_difference.for_the_first_version"></a></span><a class="link" href="adjacent_difference.html#range.reference.algorithms.numeric.adjacent_difference.for_the_first_version">For
             the first version</a>
           </h6>
 <div class="orderedlist"><ol class="orderedlist" type="1">
@@ -109,9 +108,9 @@
                 set of value types.
               </li>
 </ol></div>
-<a name="range.reference.algorithms.numeric.adjacent_difference.for_the_second_version"></a><h6>
-<a name="id752216"></a>
-            <a class="link" href="adjacent_difference.html#range.reference.algorithms.numeric.adjacent_difference.for_the_second_version">For
+<h6>
+<a name="range.reference.algorithms.numeric.adjacent_difference.h5"></a>
+            <span><a name="range.reference.algorithms.numeric.adjacent_difference.for_the_second_version"></a></span><a class="link" href="adjacent_difference.html#range.reference.algorithms.numeric.adjacent_difference.for_the_second_version">For
             the second version</a>
           </h6>
 <div class="orderedlist"><ol class="orderedlist" type="1">
@@ -144,17 +143,17 @@
                 set of value types.
               </li>
 </ol></div>
-<a name="range.reference.algorithms.numeric.adjacent_difference.precondition_"></a><h6>
-<a name="id752409"></a>
-            <a class="link" href="adjacent_difference.html#range.reference.algorithms.numeric.adjacent_difference.precondition_">Precondition:</a>
+<h6>
+<a name="range.reference.algorithms.numeric.adjacent_difference.h6"></a>
+            <span><a name="range.reference.algorithms.numeric.adjacent_difference.precondition_"></a></span><a class="link" href="adjacent_difference.html#range.reference.algorithms.numeric.adjacent_difference.precondition_">Precondition:</a>
           </h6>
 <p>
             <code class="computeroutput"><span class="special">[</span><span class="identifier">result</span><span class="special">,</span> <span class="identifier">result</span>
             <span class="special">+</span> <span class="identifier">distance</span><span class="special">(</span><span class="identifier">rng</span><span class="special">))</span></code> is a valid range.
           </p>
-<a name="range.reference.algorithms.numeric.adjacent_difference.complexity"></a><h6>
-<a name="id752483"></a>
-            <a class="link" href="adjacent_difference.html#range.reference.algorithms.numeric.adjacent_difference.complexity">Complexity</a>
+<h6>
+<a name="range.reference.algorithms.numeric.adjacent_difference.h7"></a>
+            <span><a name="range.reference.algorithms.numeric.adjacent_difference.complexity"></a></span><a class="link" href="adjacent_difference.html#range.reference.algorithms.numeric.adjacent_difference.complexity">Complexity</a>
           </h6>
 <p>
             Linear. If <code class="computeroutput"><span class="identifier">empty</span><span class="special">(</span><span class="identifier">rng</span><span class="special">)</span></code>
@@ -164,7 +163,8 @@
 </div>
 <table xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" width="100%"><tr>
 <td align="left"></td>
-<td align="right"><div class="copyright-footer">Copyright &#169; 2003 -2010 Thorsten Ottosen, Neil Groves<p>
+<td align="right"><div class="copyright-footer">Copyright &#169; 2003-2010 Thorsten Ottosen,
+      Neil Groves<p>
         Distributed under the Boost Software License, Version 1.0. (See accompanying
         file LICENSE_1_0.txt or copy at <a href="http://www.boost.org/LICENSE_1_0.txt" target="_top">http://www.boost.org/LICENSE_1_0.txt</a>)
       </p>
diff --git a/doc/html/range/reference/algorithms/numeric/inner_product.html b/doc/html/range/reference/algorithms/numeric/inner_product.html
index bebd578..4c2742d 100644
--- a/doc/html/range/reference/algorithms/numeric/inner_product.html
+++ b/doc/html/range/reference/algorithms/numeric/inner_product.html
@@ -22,16 +22,15 @@
 <div class="spirit-nav">
 <a accesskey="p" href="adjacent_difference.html"><img src="../../../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../numeric.html"><img src="../../../../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../../../../index.html"><img src="../../../../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="partial_sum.html"><img src="../../../../../../../../doc/src/images/next.png" alt="Next"></a>
 </div>
-<div class="section">
+<div class="section range_reference_algorithms_numeric_inner_product">
 <div class="titlepage"><div><div><h5 class="title">
 <a name="range.reference.algorithms.numeric.inner_product"></a><a class="link" href="inner_product.html" title="inner_product">inner_product</a>
 </h5></div></div></div>
-<a name="range.reference.algorithms.numeric.inner_product.prototype"></a><h6>
-<a name="id752584"></a>
-            <a class="link" href="inner_product.html#range.reference.algorithms.numeric.inner_product.prototype">Prototype</a>
+<h6>
+<a name="range.reference.algorithms.numeric.inner_product.h0"></a>
+            <span><a name="range.reference.algorithms.numeric.inner_product.prototype"></a></span><a class="link" href="inner_product.html#range.reference.algorithms.numeric.inner_product.prototype">Prototype</a>
           </h6>
 <p>
-            
 </p>
 <pre class="programlisting"><span class="keyword">template</span><span class="special">&lt;</span><span class="keyword">class</span> <span class="identifier">SinglePassRange1</span><span class="special">,</span>
          <span class="keyword">class</span> <span class="identifier">SinglePassRange2</span><span class="special">,</span>
@@ -52,9 +51,9 @@
 </pre>
 <p>
           </p>
-<a name="range.reference.algorithms.numeric.inner_product.description"></a><h6>
-<a name="id752946"></a>
-            <a class="link" href="inner_product.html#range.reference.algorithms.numeric.inner_product.description">Description</a>
+<h6>
+<a name="range.reference.algorithms.numeric.inner_product.h1"></a>
+            <span><a name="range.reference.algorithms.numeric.inner_product.description"></a></span><a class="link" href="inner_product.html#range.reference.algorithms.numeric.inner_product.description">Description</a>
           </h6>
 <p>
             <code class="computeroutput"><span class="identifier">inner_product</span></code> calculates
@@ -65,20 +64,20 @@
             For further information on the <code class="computeroutput"><span class="identifier">inner_product</span></code>
             algorithm please see <a href="http://www.sgi.com/tech/stl/inner_product.html" target="_top">inner_product</a>.
           </p>
-<a name="range.reference.algorithms.numeric.inner_product.definition"></a><h6>
-<a name="id753022"></a>
-            <a class="link" href="inner_product.html#range.reference.algorithms.numeric.inner_product.definition">Definition</a>
+<h6>
+<a name="range.reference.algorithms.numeric.inner_product.h2"></a>
+            <span><a name="range.reference.algorithms.numeric.inner_product.definition"></a></span><a class="link" href="inner_product.html#range.reference.algorithms.numeric.inner_product.definition">Definition</a>
           </h6>
 <p>
             Defined in the header file <code class="computeroutput"><span class="identifier">boost</span><span class="special">/</span><span class="identifier">range</span><span class="special">/</span><span class="identifier">numeric</span><span class="special">.</span><span class="identifier">hpp</span></code>
           </p>
-<a name="range.reference.algorithms.numeric.inner_product.requirements"></a><h6>
-<a name="id753084"></a>
-            <a class="link" href="inner_product.html#range.reference.algorithms.numeric.inner_product.requirements">Requirements</a>
+<h6>
+<a name="range.reference.algorithms.numeric.inner_product.h3"></a>
+            <span><a name="range.reference.algorithms.numeric.inner_product.requirements"></a></span><a class="link" href="inner_product.html#range.reference.algorithms.numeric.inner_product.requirements">Requirements</a>
           </h6>
-<a name="range.reference.algorithms.numeric.inner_product.for_the_first_version"></a><h6>
-<a name="id753104"></a>
-            <a class="link" href="inner_product.html#range.reference.algorithms.numeric.inner_product.for_the_first_version">For
+<h6>
+<a name="range.reference.algorithms.numeric.inner_product.h4"></a>
+            <span><a name="range.reference.algorithms.numeric.inner_product.for_the_first_version"></a></span><a class="link" href="inner_product.html#range.reference.algorithms.numeric.inner_product.for_the_first_version">For
             the first version</a>
           </h6>
 <div class="orderedlist"><ol class="orderedlist" type="1">
@@ -111,9 +110,9 @@
                 is convertible to <code class="computeroutput"><span class="identifier">Value</span></code>.
               </li>
 </ol></div>
-<a name="range.reference.algorithms.numeric.inner_product.for_the_second_version"></a><h6>
-<a name="id753362"></a>
-            <a class="link" href="inner_product.html#range.reference.algorithms.numeric.inner_product.for_the_second_version">For
+<h6>
+<a name="range.reference.algorithms.numeric.inner_product.h5"></a>
+            <span><a name="range.reference.algorithms.numeric.inner_product.for_the_second_version"></a></span><a class="link" href="inner_product.html#range.reference.algorithms.numeric.inner_product.for_the_second_version">For
             the second version</a>
           </h6>
 <div class="orderedlist"><ol class="orderedlist" type="1">
@@ -160,16 +159,16 @@
                 is convertible to <code class="computeroutput"><span class="identifier">Value</span></code>.
               </li>
 </ol></div>
-<a name="range.reference.algorithms.numeric.inner_product.precondition_"></a><h6>
-<a name="id753663"></a>
-            <a class="link" href="inner_product.html#range.reference.algorithms.numeric.inner_product.precondition_">Precondition:</a>
+<h6>
+<a name="range.reference.algorithms.numeric.inner_product.h6"></a>
+            <span><a name="range.reference.algorithms.numeric.inner_product.precondition_"></a></span><a class="link" href="inner_product.html#range.reference.algorithms.numeric.inner_product.precondition_">Precondition:</a>
           </h6>
 <p>
             <code class="computeroutput"><span class="identifier">distance</span><span class="special">(</span><span class="identifier">rng2</span><span class="special">)</span> <span class="special">&gt;=</span> <span class="identifier">distance</span><span class="special">(</span><span class="identifier">rng1</span><span class="special">)</span></code> is a valid range.
           </p>
-<a name="range.reference.algorithms.numeric.inner_product.complexity"></a><h6>
-<a name="id753736"></a>
-            <a class="link" href="inner_product.html#range.reference.algorithms.numeric.inner_product.complexity">Complexity</a>
+<h6>
+<a name="range.reference.algorithms.numeric.inner_product.h7"></a>
+            <span><a name="range.reference.algorithms.numeric.inner_product.complexity"></a></span><a class="link" href="inner_product.html#range.reference.algorithms.numeric.inner_product.complexity">Complexity</a>
           </h6>
 <p>
             Linear. Exactly <code class="computeroutput"><span class="identifier">distance</span><span class="special">(</span><span class="identifier">rng</span><span class="special">)</span></code>.
@@ -177,7 +176,8 @@
 </div>
 <table xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" width="100%"><tr>
 <td align="left"></td>
-<td align="right"><div class="copyright-footer">Copyright &#169; 2003 -2010 Thorsten Ottosen, Neil Groves<p>
+<td align="right"><div class="copyright-footer">Copyright &#169; 2003-2010 Thorsten Ottosen,
+      Neil Groves<p>
         Distributed under the Boost Software License, Version 1.0. (See accompanying
         file LICENSE_1_0.txt or copy at <a href="http://www.boost.org/LICENSE_1_0.txt" target="_top">http://www.boost.org/LICENSE_1_0.txt</a>)
       </p>
diff --git a/doc/html/range/reference/algorithms/numeric/partial_sum.html b/doc/html/range/reference/algorithms/numeric/partial_sum.html
index 68accc1..a8c3835 100644
--- a/doc/html/range/reference/algorithms/numeric/partial_sum.html
+++ b/doc/html/range/reference/algorithms/numeric/partial_sum.html
@@ -22,16 +22,15 @@
 <div class="spirit-nav">
 <a accesskey="p" href="inner_product.html"><img src="../../../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../numeric.html"><img src="../../../../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../../../../index.html"><img src="../../../../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="../../ranges.html"><img src="../../../../../../../../doc/src/images/next.png" alt="Next"></a>
 </div>
-<div class="section">
+<div class="section range_reference_algorithms_numeric_partial_sum">
 <div class="titlepage"><div><div><h5 class="title">
 <a name="range.reference.algorithms.numeric.partial_sum"></a><a class="link" href="partial_sum.html" title="partial_sum">partial_sum</a>
 </h5></div></div></div>
-<a name="range.reference.algorithms.numeric.partial_sum.prototype"></a><h6>
-<a name="id753801"></a>
-            <a class="link" href="partial_sum.html#range.reference.algorithms.numeric.partial_sum.prototype">Prototype</a>
+<h6>
+<a name="range.reference.algorithms.numeric.partial_sum.h0"></a>
+            <span><a name="range.reference.algorithms.numeric.partial_sum.prototype"></a></span><a class="link" href="partial_sum.html#range.reference.algorithms.numeric.partial_sum.prototype">Prototype</a>
           </h6>
 <p>
-            
 </p>
 <pre class="programlisting"><span class="keyword">template</span><span class="special">&lt;</span><span class="keyword">class</span> <span class="identifier">SinglePassRange</span><span class="special">,</span>
          <span class="keyword">class</span> <span class="identifier">OutputIterator</span><span class="special">&gt;</span>
@@ -47,29 +46,29 @@
 </pre>
 <p>
           </p>
-<a name="range.reference.algorithms.numeric.partial_sum.description"></a><h6>
-<a name="id754058"></a>
-            <a class="link" href="partial_sum.html#range.reference.algorithms.numeric.partial_sum.description">Description</a>
+<h6>
+<a name="range.reference.algorithms.numeric.partial_sum.h1"></a>
+            <span><a name="range.reference.algorithms.numeric.partial_sum.description"></a></span><a class="link" href="partial_sum.html#range.reference.algorithms.numeric.partial_sum.description">Description</a>
           </h6>
 <p>
             <code class="computeroutput"><span class="identifier">partial_sum</span></code> calculates
             a generalised partial sum of <code class="computeroutput"><span class="identifier">rng</span></code>
             in the same manner as <code class="computeroutput"><span class="identifier">std</span><span class="special">::</span><span class="identifier">partial_sum</span><span class="special">(</span><span class="identifier">boost</span><span class="special">::</span><span class="identifier">begin</span><span class="special">(</span><span class="identifier">rng</span><span class="special">),</span> <span class="identifier">boost</span><span class="special">::</span><span class="identifier">end</span><span class="special">(</span><span class="identifier">rng</span><span class="special">),</span> <span class="identifier">out_it</span><span class="special">)</span></code>. See <a href="http://www.sgi.com/tech/stl/partial_sum.html" target="_top">partial_sum</a>.
           </p>
-<a name="range.reference.algorithms.numeric.partial_sum.definition"></a><h6>
-<a name="id754198"></a>
-            <a class="link" href="partial_sum.html#range.reference.algorithms.numeric.partial_sum.definition">Definition</a>
+<h6>
+<a name="range.reference.algorithms.numeric.partial_sum.h2"></a>
+            <span><a name="range.reference.algorithms.numeric.partial_sum.definition"></a></span><a class="link" href="partial_sum.html#range.reference.algorithms.numeric.partial_sum.definition">Definition</a>
           </h6>
 <p>
             Defined in the header file <code class="computeroutput"><span class="identifier">boost</span><span class="special">/</span><span class="identifier">range</span><span class="special">/</span><span class="identifier">numeric</span><span class="special">.</span><span class="identifier">hpp</span></code>
           </p>
-<a name="range.reference.algorithms.numeric.partial_sum.requirements"></a><h6>
-<a name="id754259"></a>
-            <a class="link" href="partial_sum.html#range.reference.algorithms.numeric.partial_sum.requirements">Requirements</a>
+<h6>
+<a name="range.reference.algorithms.numeric.partial_sum.h3"></a>
+            <span><a name="range.reference.algorithms.numeric.partial_sum.requirements"></a></span><a class="link" href="partial_sum.html#range.reference.algorithms.numeric.partial_sum.requirements">Requirements</a>
           </h6>
-<a name="range.reference.algorithms.numeric.partial_sum.for_the_first_version"></a><h6>
-<a name="id754280"></a>
-            <a class="link" href="partial_sum.html#range.reference.algorithms.numeric.partial_sum.for_the_first_version">For
+<h6>
+<a name="range.reference.algorithms.numeric.partial_sum.h4"></a>
+            <span><a name="range.reference.algorithms.numeric.partial_sum.for_the_first_version"></a></span><a class="link" href="partial_sum.html#range.reference.algorithms.numeric.partial_sum.for_the_first_version">For
             the first version</a>
           </h6>
 <div class="orderedlist"><ol class="orderedlist" type="1">
@@ -97,9 +96,9 @@
                 set of value types.
               </li>
 </ol></div>
-<a name="range.reference.algorithms.numeric.partial_sum.for_the_second_version"></a><h6>
-<a name="id754487"></a>
-            <a class="link" href="partial_sum.html#range.reference.algorithms.numeric.partial_sum.for_the_second_version">For
+<h6>
+<a name="range.reference.algorithms.numeric.partial_sum.h5"></a>
+            <span><a name="range.reference.algorithms.numeric.partial_sum.for_the_second_version"></a></span><a class="link" href="partial_sum.html#range.reference.algorithms.numeric.partial_sum.for_the_second_version">For
             the second version</a>
           </h6>
 <div class="orderedlist"><ol class="orderedlist" type="1">
@@ -126,17 +125,17 @@
                 set of value types.
               </li>
 </ol></div>
-<a name="range.reference.algorithms.numeric.partial_sum.precondition_"></a><h6>
-<a name="id754652"></a>
-            <a class="link" href="partial_sum.html#range.reference.algorithms.numeric.partial_sum.precondition_">Precondition:</a>
+<h6>
+<a name="range.reference.algorithms.numeric.partial_sum.h6"></a>
+            <span><a name="range.reference.algorithms.numeric.partial_sum.precondition_"></a></span><a class="link" href="partial_sum.html#range.reference.algorithms.numeric.partial_sum.precondition_">Precondition:</a>
           </h6>
 <p>
             <code class="computeroutput"><span class="special">[</span><span class="identifier">result</span><span class="special">,</span> <span class="identifier">result</span>
             <span class="special">+</span> <span class="identifier">distance</span><span class="special">(</span><span class="identifier">rng</span><span class="special">))</span></code> is a valid range.
           </p>
-<a name="range.reference.algorithms.numeric.partial_sum.complexity"></a><h6>
-<a name="id754726"></a>
-            <a class="link" href="partial_sum.html#range.reference.algorithms.numeric.partial_sum.complexity">Complexity</a>
+<h6>
+<a name="range.reference.algorithms.numeric.partial_sum.h7"></a>
+            <span><a name="range.reference.algorithms.numeric.partial_sum.complexity"></a></span><a class="link" href="partial_sum.html#range.reference.algorithms.numeric.partial_sum.complexity">Complexity</a>
           </h6>
 <p>
             Linear. If <code class="computeroutput"><span class="identifier">empty</span><span class="special">(</span><span class="identifier">rng</span><span class="special">)</span></code>
@@ -146,7 +145,8 @@
 </div>
 <table xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" width="100%"><tr>
 <td align="left"></td>
-<td align="right"><div class="copyright-footer">Copyright &#169; 2003 -2010 Thorsten Ottosen, Neil Groves<p>
+<td align="right"><div class="copyright-footer">Copyright &#169; 2003-2010 Thorsten Ottosen,
+      Neil Groves<p>
         Distributed under the Boost Software License, Version 1.0. (See accompanying
         file LICENSE_1_0.txt or copy at <a href="http://www.boost.org/LICENSE_1_0.txt" target="_top">http://www.boost.org/LICENSE_1_0.txt</a>)
       </p>
diff --git a/doc/html/range/reference/algorithms/permutation.html b/doc/html/range/reference/algorithms/permutation.html
index d596b34..8e49270 100644
--- a/doc/html/range/reference/algorithms/permutation.html
+++ b/doc/html/range/reference/algorithms/permutation.html
@@ -22,7 +22,7 @@
 <div class="spirit-nav">
 <a accesskey="p" href="heap/sort_heap.html"><img src="../../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../algorithms.html"><img src="../../../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../../../index.html"><img src="../../../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="permutation/next_permutation.html"><img src="../../../../../../../doc/src/images/next.png" alt="Next"></a>
 </div>
-<div class="section">
+<div class="section range_reference_algorithms_permutation">
 <div class="titlepage"><div><div><h4 class="title">
 <a name="range.reference.algorithms.permutation"></a><a class="link" href="permutation.html" title="Permutation algorithms">Permutation
         algorithms</a>
@@ -34,7 +34,8 @@
 </div>
 <table xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" width="100%"><tr>
 <td align="left"></td>
-<td align="right"><div class="copyright-footer">Copyright &#169; 2003 -2010 Thorsten Ottosen, Neil Groves<p>
+<td align="right"><div class="copyright-footer">Copyright &#169; 2003-2010 Thorsten Ottosen,
+      Neil Groves<p>
         Distributed under the Boost Software License, Version 1.0. (See accompanying
         file LICENSE_1_0.txt or copy at <a href="http://www.boost.org/LICENSE_1_0.txt" target="_top">http://www.boost.org/LICENSE_1_0.txt</a>)
       </p>
diff --git a/doc/html/range/reference/algorithms/permutation/next_permutation.html b/doc/html/range/reference/algorithms/permutation/next_permutation.html
index 1f30391..8100fe8 100644
--- a/doc/html/range/reference/algorithms/permutation/next_permutation.html
+++ b/doc/html/range/reference/algorithms/permutation/next_permutation.html
@@ -22,16 +22,15 @@
 <div class="spirit-nav">
 <a accesskey="p" href="../permutation.html"><img src="../../../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../permutation.html"><img src="../../../../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../../../../index.html"><img src="../../../../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="prev_permutation.html"><img src="../../../../../../../../doc/src/images/next.png" alt="Next"></a>
 </div>
-<div class="section">
+<div class="section range_reference_algorithms_permutation_next_permutation">
 <div class="titlepage"><div><div><h5 class="title">
 <a name="range.reference.algorithms.permutation.next_permutation"></a><a class="link" href="next_permutation.html" title="next_permutation">next_permutation</a>
 </h5></div></div></div>
-<a name="range.reference.algorithms.permutation.next_permutation.prototype"></a><h6>
-<a name="id743032"></a>
-            <a class="link" href="next_permutation.html#range.reference.algorithms.permutation.next_permutation.prototype">Prototype</a>
+<h6>
+<a name="range.reference.algorithms.permutation.next_permutation.h0"></a>
+            <span><a name="range.reference.algorithms.permutation.next_permutation.prototype"></a></span><a class="link" href="next_permutation.html#range.reference.algorithms.permutation.next_permutation.prototype">Prototype</a>
           </h6>
 <p>
-            
 </p>
 <pre class="programlisting"><span class="keyword">template</span><span class="special">&lt;</span><span class="keyword">class</span> <span class="identifier">BidirectionalRange</span><span class="special">&gt;</span>
 <span class="keyword">bool</span> <span class="identifier">next_permutation</span><span class="special">(</span><span class="identifier">BidirectionalRange</span><span class="special">&amp;</span> <span class="identifier">rng</span><span class="special">);</span>
@@ -47,9 +46,9 @@
 </pre>
 <p>
           </p>
-<a name="range.reference.algorithms.permutation.next_permutation.description"></a><h6>
-<a name="id743378"></a>
-            <a class="link" href="next_permutation.html#range.reference.algorithms.permutation.next_permutation.description">Description</a>
+<h6>
+<a name="range.reference.algorithms.permutation.next_permutation.h1"></a>
+            <span><a name="range.reference.algorithms.permutation.next_permutation.description"></a></span><a class="link" href="next_permutation.html#range.reference.algorithms.permutation.next_permutation.description">Description</a>
           </h6>
 <p>
             <code class="computeroutput"><span class="identifier">next_permutation</span></code> transforms
@@ -65,16 +64,16 @@
             by evaluating <code class="computeroutput"><span class="identifier">pred</span></code> in
             the predicate versions.
           </p>
-<a name="range.reference.algorithms.permutation.next_permutation.definition"></a><h6>
-<a name="id743477"></a>
-            <a class="link" href="next_permutation.html#range.reference.algorithms.permutation.next_permutation.definition">Definition</a>
+<h6>
+<a name="range.reference.algorithms.permutation.next_permutation.h2"></a>
+            <span><a name="range.reference.algorithms.permutation.next_permutation.definition"></a></span><a class="link" href="next_permutation.html#range.reference.algorithms.permutation.next_permutation.definition">Definition</a>
           </h6>
 <p>
             Defined in the header file <code class="computeroutput"><span class="identifier">boost</span><span class="special">/</span><span class="identifier">range</span><span class="special">/</span><span class="identifier">algorithm</span><span class="special">/</span><span class="identifier">permutation</span><span class="special">.</span><span class="identifier">hpp</span></code>
           </p>
-<a name="range.reference.algorithms.permutation.next_permutation.requirements"></a><h6>
-<a name="id743548"></a>
-            <a class="link" href="next_permutation.html#range.reference.algorithms.permutation.next_permutation.requirements">Requirements</a>
+<h6>
+<a name="range.reference.algorithms.permutation.next_permutation.h3"></a>
+            <span><a name="range.reference.algorithms.permutation.next_permutation.requirements"></a></span><a class="link" href="next_permutation.html#range.reference.algorithms.permutation.next_permutation.requirements">Requirements</a>
           </h6>
 <p>
             <span class="bold"><strong>For the non-predicate versions:</strong></span>
@@ -123,9 +122,9 @@
                 argument types.
               </li>
 </ul></div>
-<a name="range.reference.algorithms.permutation.next_permutation.complexity"></a><h6>
-<a name="id743796"></a>
-            <a class="link" href="next_permutation.html#range.reference.algorithms.permutation.next_permutation.complexity">Complexity</a>
+<h6>
+<a name="range.reference.algorithms.permutation.next_permutation.h4"></a>
+            <span><a name="range.reference.algorithms.permutation.next_permutation.complexity"></a></span><a class="link" href="next_permutation.html#range.reference.algorithms.permutation.next_permutation.complexity">Complexity</a>
           </h6>
 <p>
             Linear. At most <code class="computeroutput"><span class="identifier">distance</span><span class="special">(</span><span class="identifier">rng</span><span class="special">)</span> <span class="special">/</span> <span class="number">2</span></code>
@@ -134,7 +133,8 @@
 </div>
 <table xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" width="100%"><tr>
 <td align="left"></td>
-<td align="right"><div class="copyright-footer">Copyright &#169; 2003 -2010 Thorsten Ottosen, Neil Groves<p>
+<td align="right"><div class="copyright-footer">Copyright &#169; 2003-2010 Thorsten Ottosen,
+      Neil Groves<p>
         Distributed under the Boost Software License, Version 1.0. (See accompanying
         file LICENSE_1_0.txt or copy at <a href="http://www.boost.org/LICENSE_1_0.txt" target="_top">http://www.boost.org/LICENSE_1_0.txt</a>)
       </p>
diff --git a/doc/html/range/reference/algorithms/permutation/prev_permutation.html b/doc/html/range/reference/algorithms/permutation/prev_permutation.html
index c43900a..9fbc374 100644
--- a/doc/html/range/reference/algorithms/permutation/prev_permutation.html
+++ b/doc/html/range/reference/algorithms/permutation/prev_permutation.html
@@ -22,16 +22,15 @@
 <div class="spirit-nav">
 <a accesskey="p" href="next_permutation.html"><img src="../../../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../permutation.html"><img src="../../../../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../../../../index.html"><img src="../../../../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="../new.html"><img src="../../../../../../../../doc/src/images/next.png" alt="Next"></a>
 </div>
-<div class="section">
+<div class="section range_reference_algorithms_permutation_prev_permutation">
 <div class="titlepage"><div><div><h5 class="title">
 <a name="range.reference.algorithms.permutation.prev_permutation"></a><a class="link" href="prev_permutation.html" title="prev_permutation">prev_permutation</a>
 </h5></div></div></div>
-<a name="range.reference.algorithms.permutation.prev_permutation.prototype"></a><h6>
-<a name="id743872"></a>
-            <a class="link" href="prev_permutation.html#range.reference.algorithms.permutation.prev_permutation.prototype">Prototype</a>
+<h6>
+<a name="range.reference.algorithms.permutation.prev_permutation.h0"></a>
+            <span><a name="range.reference.algorithms.permutation.prev_permutation.prototype"></a></span><a class="link" href="prev_permutation.html#range.reference.algorithms.permutation.prev_permutation.prototype">Prototype</a>
           </h6>
 <p>
-            
 </p>
 <pre class="programlisting"><span class="keyword">template</span><span class="special">&lt;</span><span class="keyword">class</span> <span class="identifier">BidirectionalRange</span><span class="special">&gt;</span>
 <span class="keyword">bool</span> <span class="identifier">prev_permutation</span><span class="special">(</span><span class="identifier">BidirectionalRange</span><span class="special">&amp;</span> <span class="identifier">rng</span><span class="special">);</span>
@@ -47,9 +46,9 @@
 </pre>
 <p>
           </p>
-<a name="range.reference.algorithms.permutation.prev_permutation.description"></a><h6>
-<a name="id744218"></a>
-            <a class="link" href="prev_permutation.html#range.reference.algorithms.permutation.prev_permutation.description">Description</a>
+<h6>
+<a name="range.reference.algorithms.permutation.prev_permutation.h1"></a>
+            <span><a name="range.reference.algorithms.permutation.prev_permutation.description"></a></span><a class="link" href="prev_permutation.html#range.reference.algorithms.permutation.prev_permutation.description">Description</a>
           </h6>
 <p>
             <code class="computeroutput"><span class="identifier">prev_permutation</span></code> transforms
@@ -65,16 +64,16 @@
             by evaluating <code class="computeroutput"><span class="identifier">pred</span></code> in
             the predicate versions.
           </p>
-<a name="range.reference.algorithms.permutation.prev_permutation.definition"></a><h6>
-<a name="id744318"></a>
-            <a class="link" href="prev_permutation.html#range.reference.algorithms.permutation.prev_permutation.definition">Definition</a>
+<h6>
+<a name="range.reference.algorithms.permutation.prev_permutation.h2"></a>
+            <span><a name="range.reference.algorithms.permutation.prev_permutation.definition"></a></span><a class="link" href="prev_permutation.html#range.reference.algorithms.permutation.prev_permutation.definition">Definition</a>
           </h6>
 <p>
             Defined in the header file <code class="computeroutput"><span class="identifier">boost</span><span class="special">/</span><span class="identifier">range</span><span class="special">/</span><span class="identifier">algorithm</span><span class="special">/</span><span class="identifier">permutation</span><span class="special">.</span><span class="identifier">hpp</span></code>
           </p>
-<a name="range.reference.algorithms.permutation.prev_permutation.requirements"></a><h6>
-<a name="id744389"></a>
-            <a class="link" href="prev_permutation.html#range.reference.algorithms.permutation.prev_permutation.requirements">Requirements</a>
+<h6>
+<a name="range.reference.algorithms.permutation.prev_permutation.h3"></a>
+            <span><a name="range.reference.algorithms.permutation.prev_permutation.requirements"></a></span><a class="link" href="prev_permutation.html#range.reference.algorithms.permutation.prev_permutation.requirements">Requirements</a>
           </h6>
 <p>
             <span class="bold"><strong>For the non-predicate versions:</strong></span>
@@ -123,9 +122,9 @@
                 argument types.
               </li>
 </ul></div>
-<a name="range.reference.algorithms.permutation.prev_permutation.complexity"></a><h6>
-<a name="id744638"></a>
-            <a class="link" href="prev_permutation.html#range.reference.algorithms.permutation.prev_permutation.complexity">Complexity</a>
+<h6>
+<a name="range.reference.algorithms.permutation.prev_permutation.h4"></a>
+            <span><a name="range.reference.algorithms.permutation.prev_permutation.complexity"></a></span><a class="link" href="prev_permutation.html#range.reference.algorithms.permutation.prev_permutation.complexity">Complexity</a>
           </h6>
 <p>
             Linear. At most <code class="computeroutput"><span class="identifier">distance</span><span class="special">(</span><span class="identifier">rng</span><span class="special">)</span> <span class="special">/</span> <span class="number">2</span></code>
@@ -134,7 +133,8 @@
 </div>
 <table xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" width="100%"><tr>
 <td align="left"></td>
-<td align="right"><div class="copyright-footer">Copyright &#169; 2003 -2010 Thorsten Ottosen, Neil Groves<p>
+<td align="right"><div class="copyright-footer">Copyright &#169; 2003-2010 Thorsten Ottosen,
+      Neil Groves<p>
         Distributed under the Boost Software License, Version 1.0. (See accompanying
         file LICENSE_1_0.txt or copy at <a href="http://www.boost.org/LICENSE_1_0.txt" target="_top">http://www.boost.org/LICENSE_1_0.txt</a>)
       </p>
diff --git a/doc/html/range/reference/algorithms/set.html b/doc/html/range/reference/algorithms/set.html
index 2d31545..50dd1e3 100644
--- a/doc/html/range/reference/algorithms/set.html
+++ b/doc/html/range/reference/algorithms/set.html
@@ -22,7 +22,7 @@
 <div class="spirit-nav">
 <a accesskey="p" href="non_mutating/upper_bound.html"><img src="../../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../algorithms.html"><img src="../../../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../../../index.html"><img src="../../../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="set/includes.html"><img src="../../../../../../../doc/src/images/next.png" alt="Next"></a>
 </div>
-<div class="section">
+<div class="section range_reference_algorithms_set">
 <div class="titlepage"><div><div><h4 class="title">
 <a name="range.reference.algorithms.set"></a><a class="link" href="set.html" title="Set algorithms">Set algorithms</a>
 </h4></div></div></div>
@@ -36,7 +36,8 @@
 </div>
 <table xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" width="100%"><tr>
 <td align="left"></td>
-<td align="right"><div class="copyright-footer">Copyright &#169; 2003 -2010 Thorsten Ottosen, Neil Groves<p>
+<td align="right"><div class="copyright-footer">Copyright &#169; 2003-2010 Thorsten Ottosen,
+      Neil Groves<p>
         Distributed under the Boost Software License, Version 1.0. (See accompanying
         file LICENSE_1_0.txt or copy at <a href="http://www.boost.org/LICENSE_1_0.txt" target="_top">http://www.boost.org/LICENSE_1_0.txt</a>)
       </p>
diff --git a/doc/html/range/reference/algorithms/set/includes.html b/doc/html/range/reference/algorithms/set/includes.html
index 9baedb3..5684816 100644
--- a/doc/html/range/reference/algorithms/set/includes.html
+++ b/doc/html/range/reference/algorithms/set/includes.html
@@ -22,16 +22,15 @@
 <div class="spirit-nav">
 <a accesskey="p" href="../set.html"><img src="../../../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../set.html"><img src="../../../../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../../../../index.html"><img src="../../../../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="set_union.html"><img src="../../../../../../../../doc/src/images/next.png" alt="Next"></a>
 </div>
-<div class="section">
+<div class="section range_reference_algorithms_set_includes">
 <div class="titlepage"><div><div><h5 class="title">
 <a name="range.reference.algorithms.set.includes"></a><a class="link" href="includes.html" title="includes">includes</a>
 </h5></div></div></div>
-<a name="range.reference.algorithms.set.includes.prototype"></a><h6>
-<a name="id733300"></a>
-            <a class="link" href="includes.html#range.reference.algorithms.set.includes.prototype">Prototype</a>
+<h6>
+<a name="range.reference.algorithms.set.includes.h0"></a>
+            <span><a name="range.reference.algorithms.set.includes.prototype"></a></span><a class="link" href="includes.html#range.reference.algorithms.set.includes.prototype">Prototype</a>
           </h6>
 <p>
-            
 </p>
 <pre class="programlisting"><span class="keyword">template</span><span class="special">&lt;</span><span class="keyword">class</span> <span class="identifier">SinglePassRange1</span><span class="special">,</span> <span class="keyword">class</span> <span class="identifier">SinglePassRange2</span><span class="special">&gt;</span>
 <span class="keyword">bool</span> <span class="identifier">includes</span><span class="special">(</span><span class="keyword">const</span> <span class="identifier">SinglePassRange1</span><span class="special">&amp;</span> <span class="identifier">rng1</span><span class="special">,</span> <span class="keyword">const</span> <span class="identifier">SinglePassRange2</span><span class="special">&amp;</span> <span class="identifier">rng2</span><span class="special">);</span>
@@ -42,13 +41,13 @@
     <span class="keyword">class</span> <span class="identifier">BinaryPredicate</span>
     <span class="special">&gt;</span>
 <span class="keyword">bool</span> <span class="identifier">includes</span><span class="special">(</span><span class="keyword">const</span> <span class="identifier">SinglePassRange1</span><span class="special">&amp;</span> <span class="identifier">rng1</span><span class="special">,</span> <span class="keyword">const</span> <span class="identifier">SinglePassRange2</span><span class="special">&amp;</span> <span class="identifier">rng2</span><span class="special">,</span>
-              <span class="identifier">BinaryPredicate</span> <span class="identifier">pred</span><span class="special">);</span>    
+              <span class="identifier">BinaryPredicate</span> <span class="identifier">pred</span><span class="special">);</span>
 </pre>
 <p>
           </p>
-<a name="range.reference.algorithms.set.includes.description"></a><h6>
-<a name="id733580"></a>
-            <a class="link" href="includes.html#range.reference.algorithms.set.includes.description">Description</a>
+<h6>
+<a name="range.reference.algorithms.set.includes.h1"></a>
+            <span><a name="range.reference.algorithms.set.includes.description"></a></span><a class="link" href="includes.html#range.reference.algorithms.set.includes.description">Description</a>
           </h6>
 <p>
             <code class="computeroutput"><span class="identifier">includes</span></code> returns <code class="computeroutput"><span class="keyword">true</span></code> if and only if, for every element
@@ -58,16 +57,16 @@
             by evaluating <code class="computeroutput"><span class="identifier">pred</span></code> in
             the predicate versions.
           </p>
-<a name="range.reference.algorithms.set.includes.definition"></a><h6>
-<a name="id733674"></a>
-            <a class="link" href="includes.html#range.reference.algorithms.set.includes.definition">Definition</a>
+<h6>
+<a name="range.reference.algorithms.set.includes.h2"></a>
+            <span><a name="range.reference.algorithms.set.includes.definition"></a></span><a class="link" href="includes.html#range.reference.algorithms.set.includes.definition">Definition</a>
           </h6>
 <p>
             Defined in the header file <code class="computeroutput"><span class="identifier">boost</span><span class="special">/</span><span class="identifier">range</span><span class="special">/</span><span class="identifier">algorithm</span><span class="special">/</span><span class="identifier">set_algorithm</span><span class="special">.</span><span class="identifier">hpp</span></code>
           </p>
-<a name="range.reference.algorithms.set.includes.requirements"></a><h6>
-<a name="id733743"></a>
-            <a class="link" href="includes.html#range.reference.algorithms.set.includes.requirements">Requirements</a>
+<h6>
+<a name="range.reference.algorithms.set.includes.h3"></a>
+            <span><a name="range.reference.algorithms.set.includes.requirements"></a></span><a class="link" href="includes.html#range.reference.algorithms.set.includes.requirements">Requirements</a>
           </h6>
 <p>
             <span class="bold"><strong>For the non-predicate versions:</strong></span>
@@ -143,9 +142,9 @@
                 second argument types.
               </li>
 </ul></div>
-<a name="range.reference.algorithms.set.includes.precondition_"></a><h6>
-<a name="id734152"></a>
-            <a class="link" href="includes.html#range.reference.algorithms.set.includes.precondition_">Precondition:</a>
+<h6>
+<a name="range.reference.algorithms.set.includes.h4"></a>
+            <span><a name="range.reference.algorithms.set.includes.precondition_"></a></span><a class="link" href="includes.html#range.reference.algorithms.set.includes.precondition_">Precondition:</a>
           </h6>
 <p>
             <span class="bold"><strong>For the non-predicate versions:</strong></span>
@@ -161,9 +160,9 @@
             <code class="computeroutput"><span class="identifier">rng1</span></code> and <code class="computeroutput"><span class="identifier">rng2</span></code> are sorted in ascending order
             according to <code class="computeroutput"><span class="identifier">pred</span></code>.
           </p>
-<a name="range.reference.algorithms.set.includes.complexity"></a><h6>
-<a name="id734266"></a>
-            <a class="link" href="includes.html#range.reference.algorithms.set.includes.complexity">Complexity</a>
+<h6>
+<a name="range.reference.algorithms.set.includes.h5"></a>
+            <span><a name="range.reference.algorithms.set.includes.complexity"></a></span><a class="link" href="includes.html#range.reference.algorithms.set.includes.complexity">Complexity</a>
           </h6>
 <p>
             Linear. <code class="computeroutput"><span class="identifier">O</span><span class="special">(</span><span class="identifier">N</span><span class="special">)</span></code>,
@@ -172,7 +171,8 @@
 </div>
 <table xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" width="100%"><tr>
 <td align="left"></td>
-<td align="right"><div class="copyright-footer">Copyright &#169; 2003 -2010 Thorsten Ottosen, Neil Groves<p>
+<td align="right"><div class="copyright-footer">Copyright &#169; 2003-2010 Thorsten Ottosen,
+      Neil Groves<p>
         Distributed under the Boost Software License, Version 1.0. (See accompanying
         file LICENSE_1_0.txt or copy at <a href="http://www.boost.org/LICENSE_1_0.txt" target="_top">http://www.boost.org/LICENSE_1_0.txt</a>)
       </p>
diff --git a/doc/html/range/reference/algorithms/set/set_difference.html b/doc/html/range/reference/algorithms/set/set_difference.html
index 7712445..94536a0 100644
--- a/doc/html/range/reference/algorithms/set/set_difference.html
+++ b/doc/html/range/reference/algorithms/set/set_difference.html
@@ -22,16 +22,15 @@
 <div class="spirit-nav">
 <a accesskey="p" href="set_intersection.html"><img src="../../../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../set.html"><img src="../../../../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../../../../index.html"><img src="../../../../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="set_symmetric_difference.html"><img src="../../../../../../../../doc/src/images/next.png" alt="Next"></a>
 </div>
-<div class="section">
+<div class="section range_reference_algorithms_set_set_difference">
 <div class="titlepage"><div><div><h5 class="title">
 <a name="range.reference.algorithms.set.set_difference"></a><a class="link" href="set_difference.html" title="set_difference">set_difference</a>
 </h5></div></div></div>
-<a name="range.reference.algorithms.set.set_difference.prototype"></a><h6>
-<a name="id736793"></a>
-            <a class="link" href="set_difference.html#range.reference.algorithms.set.set_difference.prototype">Prototype</a>
+<h6>
+<a name="range.reference.algorithms.set.set_difference.h0"></a>
+            <span><a name="range.reference.algorithms.set.set_difference.prototype"></a></span><a class="link" href="set_difference.html#range.reference.algorithms.set.set_difference.prototype">Prototype</a>
           </h6>
 <p>
-            
 </p>
 <pre class="programlisting"><span class="keyword">template</span><span class="special">&lt;</span>
     <span class="keyword">class</span> <span class="identifier">SinglePassRange1</span><span class="special">,</span>
@@ -55,9 +54,9 @@
 </pre>
 <p>
           </p>
-<a name="range.reference.algorithms.set.set_difference.description"></a><h6>
-<a name="id737139"></a>
-            <a class="link" href="set_difference.html#range.reference.algorithms.set.set_difference.description">Description</a>
+<h6>
+<a name="range.reference.algorithms.set.set_difference.h1"></a>
+            <span><a name="range.reference.algorithms.set.set_difference.description"></a></span><a class="link" href="set_difference.html#range.reference.algorithms.set.set_difference.description">Description</a>
           </h6>
 <p>
             <code class="computeroutput"><span class="identifier">set_difference</span></code> constructs
@@ -69,16 +68,16 @@
             by evaluating <code class="computeroutput"><span class="identifier">pred</span></code> in
             the predicate versions.
           </p>
-<a name="range.reference.algorithms.set.set_difference.definition"></a><h6>
-<a name="id737226"></a>
-            <a class="link" href="set_difference.html#range.reference.algorithms.set.set_difference.definition">Definition</a>
+<h6>
+<a name="range.reference.algorithms.set.set_difference.h2"></a>
+            <span><a name="range.reference.algorithms.set.set_difference.definition"></a></span><a class="link" href="set_difference.html#range.reference.algorithms.set.set_difference.definition">Definition</a>
           </h6>
 <p>
             Defined in the header file <code class="computeroutput"><span class="identifier">boost</span><span class="special">/</span><span class="identifier">range</span><span class="special">/</span><span class="identifier">algorithm</span><span class="special">/</span><span class="identifier">set_algorithm</span><span class="special">.</span><span class="identifier">hpp</span></code>
           </p>
-<a name="range.reference.algorithms.set.set_difference.requirements"></a><h6>
-<a name="id737297"></a>
-            <a class="link" href="set_difference.html#range.reference.algorithms.set.set_difference.requirements">Requirements</a>
+<h6>
+<a name="range.reference.algorithms.set.set_difference.h3"></a>
+            <span><a name="range.reference.algorithms.set.set_difference.requirements"></a></span><a class="link" href="set_difference.html#range.reference.algorithms.set.set_difference.requirements">Requirements</a>
           </h6>
 <p>
             <span class="bold"><strong>For the non-predicate versions:</strong></span>
@@ -162,9 +161,9 @@
                 second argument types.
               </li>
 </ul></div>
-<a name="range.reference.algorithms.set.set_difference.precondition_"></a><h6>
-<a name="id737763"></a>
-            <a class="link" href="set_difference.html#range.reference.algorithms.set.set_difference.precondition_">Precondition:</a>
+<h6>
+<a name="range.reference.algorithms.set.set_difference.h4"></a>
+            <span><a name="range.reference.algorithms.set.set_difference.precondition_"></a></span><a class="link" href="set_difference.html#range.reference.algorithms.set.set_difference.precondition_">Precondition:</a>
           </h6>
 <p>
             <span class="bold"><strong>For the non-predicate versions:</strong></span>
@@ -180,9 +179,9 @@
             <code class="computeroutput"><span class="identifier">rng1</span></code> and <code class="computeroutput"><span class="identifier">rng2</span></code> are sorted in ascending order
             according to <code class="computeroutput"><span class="identifier">pred</span></code>.
           </p>
-<a name="range.reference.algorithms.set.set_difference.complexity"></a><h6>
-<a name="id737877"></a>
-            <a class="link" href="set_difference.html#range.reference.algorithms.set.set_difference.complexity">Complexity</a>
+<h6>
+<a name="range.reference.algorithms.set.set_difference.h5"></a>
+            <span><a name="range.reference.algorithms.set.set_difference.complexity"></a></span><a class="link" href="set_difference.html#range.reference.algorithms.set.set_difference.complexity">Complexity</a>
           </h6>
 <p>
             Linear. <code class="computeroutput"><span class="identifier">O</span><span class="special">(</span><span class="identifier">N</span><span class="special">)</span></code>,
@@ -191,7 +190,8 @@
 </div>
 <table xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" width="100%"><tr>
 <td align="left"></td>
-<td align="right"><div class="copyright-footer">Copyright &#169; 2003 -2010 Thorsten Ottosen, Neil Groves<p>
+<td align="right"><div class="copyright-footer">Copyright &#169; 2003-2010 Thorsten Ottosen,
+      Neil Groves<p>
         Distributed under the Boost Software License, Version 1.0. (See accompanying
         file LICENSE_1_0.txt or copy at <a href="http://www.boost.org/LICENSE_1_0.txt" target="_top">http://www.boost.org/LICENSE_1_0.txt</a>)
       </p>
diff --git a/doc/html/range/reference/algorithms/set/set_intersection.html b/doc/html/range/reference/algorithms/set/set_intersection.html
index 1a2040d..00cc949 100644
--- a/doc/html/range/reference/algorithms/set/set_intersection.html
+++ b/doc/html/range/reference/algorithms/set/set_intersection.html
@@ -22,16 +22,15 @@
 <div class="spirit-nav">
 <a accesskey="p" href="set_union.html"><img src="../../../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../set.html"><img src="../../../../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../../../../index.html"><img src="../../../../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="set_difference.html"><img src="../../../../../../../../doc/src/images/next.png" alt="Next"></a>
 </div>
-<div class="section">
+<div class="section range_reference_algorithms_set_set_intersection">
 <div class="titlepage"><div><div><h5 class="title">
 <a name="range.reference.algorithms.set.set_intersection"></a><a class="link" href="set_intersection.html" title="set_intersection">set_intersection</a>
 </h5></div></div></div>
-<a name="range.reference.algorithms.set.set_intersection.prototype"></a><h6>
-<a name="id735588"></a>
-            <a class="link" href="set_intersection.html#range.reference.algorithms.set.set_intersection.prototype">Prototype</a>
+<h6>
+<a name="range.reference.algorithms.set.set_intersection.h0"></a>
+            <span><a name="range.reference.algorithms.set.set_intersection.prototype"></a></span><a class="link" href="set_intersection.html#range.reference.algorithms.set.set_intersection.prototype">Prototype</a>
           </h6>
 <p>
-            
 </p>
 <pre class="programlisting"><span class="keyword">template</span><span class="special">&lt;</span>
     <span class="keyword">class</span> <span class="identifier">SinglePassRange1</span><span class="special">,</span>
@@ -51,13 +50,13 @@
 <span class="identifier">OutputIterator</span> <span class="identifier">set_intersection</span><span class="special">(</span><span class="keyword">const</span> <span class="identifier">SinglePassRange1</span><span class="special">&amp;</span> <span class="identifier">rng1</span><span class="special">,</span>
                                 <span class="keyword">const</span> <span class="identifier">SinglePassRange2</span><span class="special">&amp;</span> <span class="identifier">rng2</span><span class="special">,</span>
                                 <span class="identifier">OutputIterator</span>          <span class="identifier">out</span><span class="special">,</span>
-                                <span class="identifier">BinaryPredicate</span>         <span class="identifier">pred</span><span class="special">);</span>    
+                                <span class="identifier">BinaryPredicate</span>         <span class="identifier">pred</span><span class="special">);</span>
 </pre>
 <p>
           </p>
-<a name="range.reference.algorithms.set.set_intersection.description"></a><h6>
-<a name="id735934"></a>
-            <a class="link" href="set_intersection.html#range.reference.algorithms.set.set_intersection.description">Description</a>
+<h6>
+<a name="range.reference.algorithms.set.set_intersection.h1"></a>
+            <span><a name="range.reference.algorithms.set.set_intersection.description"></a></span><a class="link" href="set_intersection.html#range.reference.algorithms.set.set_intersection.description">Description</a>
           </h6>
 <p>
             <code class="computeroutput"><span class="identifier">set_intersection</span></code> constructs
@@ -69,16 +68,16 @@
             by evaluating <code class="computeroutput"><span class="identifier">pred</span></code> in
             the predicate versions.
           </p>
-<a name="range.reference.algorithms.set.set_intersection.definition"></a><h6>
-<a name="id736021"></a>
-            <a class="link" href="set_intersection.html#range.reference.algorithms.set.set_intersection.definition">Definition</a>
+<h6>
+<a name="range.reference.algorithms.set.set_intersection.h2"></a>
+            <span><a name="range.reference.algorithms.set.set_intersection.definition"></a></span><a class="link" href="set_intersection.html#range.reference.algorithms.set.set_intersection.definition">Definition</a>
           </h6>
 <p>
             Defined in the header file <code class="computeroutput"><span class="identifier">boost</span><span class="special">/</span><span class="identifier">range</span><span class="special">/</span><span class="identifier">algorithm</span><span class="special">/</span><span class="identifier">set_algorithm</span><span class="special">.</span><span class="identifier">hpp</span></code>
           </p>
-<a name="range.reference.algorithms.set.set_intersection.requirements"></a><h6>
-<a name="id736091"></a>
-            <a class="link" href="set_intersection.html#range.reference.algorithms.set.set_intersection.requirements">Requirements</a>
+<h6>
+<a name="range.reference.algorithms.set.set_intersection.h3"></a>
+            <span><a name="range.reference.algorithms.set.set_intersection.requirements"></a></span><a class="link" href="set_intersection.html#range.reference.algorithms.set.set_intersection.requirements">Requirements</a>
           </h6>
 <p>
             <span class="bold"><strong>For the non-predicate versions:</strong></span>
@@ -162,9 +161,9 @@
                 second argument types.
               </li>
 </ul></div>
-<a name="range.reference.algorithms.set.set_intersection.precondition_"></a><h6>
-<a name="id736557"></a>
-            <a class="link" href="set_intersection.html#range.reference.algorithms.set.set_intersection.precondition_">Precondition:</a>
+<h6>
+<a name="range.reference.algorithms.set.set_intersection.h4"></a>
+            <span><a name="range.reference.algorithms.set.set_intersection.precondition_"></a></span><a class="link" href="set_intersection.html#range.reference.algorithms.set.set_intersection.precondition_">Precondition:</a>
           </h6>
 <p>
             <span class="bold"><strong>For the non-predicate versions:</strong></span>
@@ -180,9 +179,9 @@
             <code class="computeroutput"><span class="identifier">rng1</span></code> and <code class="computeroutput"><span class="identifier">rng2</span></code> are sorted in ascending order
             according to <code class="computeroutput"><span class="identifier">pred</span></code>.
           </p>
-<a name="range.reference.algorithms.set.set_intersection.complexity"></a><h6>
-<a name="id736671"></a>
-            <a class="link" href="set_intersection.html#range.reference.algorithms.set.set_intersection.complexity">Complexity</a>
+<h6>
+<a name="range.reference.algorithms.set.set_intersection.h5"></a>
+            <span><a name="range.reference.algorithms.set.set_intersection.complexity"></a></span><a class="link" href="set_intersection.html#range.reference.algorithms.set.set_intersection.complexity">Complexity</a>
           </h6>
 <p>
             Linear. <code class="computeroutput"><span class="identifier">O</span><span class="special">(</span><span class="identifier">N</span><span class="special">)</span></code>,
@@ -191,7 +190,8 @@
 </div>
 <table xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" width="100%"><tr>
 <td align="left"></td>
-<td align="right"><div class="copyright-footer">Copyright &#169; 2003 -2010 Thorsten Ottosen, Neil Groves<p>
+<td align="right"><div class="copyright-footer">Copyright &#169; 2003-2010 Thorsten Ottosen,
+      Neil Groves<p>
         Distributed under the Boost Software License, Version 1.0. (See accompanying
         file LICENSE_1_0.txt or copy at <a href="http://www.boost.org/LICENSE_1_0.txt" target="_top">http://www.boost.org/LICENSE_1_0.txt</a>)
       </p>
diff --git a/doc/html/range/reference/algorithms/set/set_symmetric_difference.html b/doc/html/range/reference/algorithms/set/set_symmetric_difference.html
index 215facc..c4b2ef4 100644
--- a/doc/html/range/reference/algorithms/set/set_symmetric_difference.html
+++ b/doc/html/range/reference/algorithms/set/set_symmetric_difference.html
@@ -22,16 +22,15 @@
 <div class="spirit-nav">
 <a accesskey="p" href="set_difference.html"><img src="../../../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../set.html"><img src="../../../../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../../../../index.html"><img src="../../../../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="../heap.html"><img src="../../../../../../../../doc/src/images/next.png" alt="Next"></a>
 </div>
-<div class="section">
+<div class="section range_reference_algorithms_set_set_symmetric_difference">
 <div class="titlepage"><div><div><h5 class="title">
 <a name="range.reference.algorithms.set.set_symmetric_difference"></a><a class="link" href="set_symmetric_difference.html" title="set_symmetric_difference">set_symmetric_difference</a>
 </h5></div></div></div>
-<a name="range.reference.algorithms.set.set_symmetric_difference.prototype"></a><h6>
-<a name="id738000"></a>
-            <a class="link" href="set_symmetric_difference.html#range.reference.algorithms.set.set_symmetric_difference.prototype">Prototype</a>
+<h6>
+<a name="range.reference.algorithms.set.set_symmetric_difference.h0"></a>
+            <span><a name="range.reference.algorithms.set.set_symmetric_difference.prototype"></a></span><a class="link" href="set_symmetric_difference.html#range.reference.algorithms.set.set_symmetric_difference.prototype">Prototype</a>
           </h6>
 <p>
-            
 </p>
 <pre class="programlisting"><span class="keyword">template</span><span class="special">&lt;</span>
     <span class="keyword">class</span> <span class="identifier">SinglePassRange1</span><span class="special">,</span>
@@ -53,13 +52,13 @@
 <span class="identifier">set_symmetric_difference</span><span class="special">(</span><span class="keyword">const</span> <span class="identifier">SinglePassRange1</span><span class="special">&amp;</span> <span class="identifier">rng1</span><span class="special">,</span>
                          <span class="keyword">const</span> <span class="identifier">SinglePassRange2</span><span class="special">&amp;</span> <span class="identifier">rng2</span><span class="special">,</span>
                          <span class="identifier">OutputIterator</span>          <span class="identifier">out</span><span class="special">,</span>
-                         <span class="identifier">BinaryPredicate</span>         <span class="identifier">pred</span><span class="special">);</span>    
+                         <span class="identifier">BinaryPredicate</span>         <span class="identifier">pred</span><span class="special">);</span>
 </pre>
 <p>
           </p>
-<a name="range.reference.algorithms.set.set_symmetric_difference.description"></a><h6>
-<a name="id738347"></a>
-            <a class="link" href="set_symmetric_difference.html#range.reference.algorithms.set.set_symmetric_difference.description">Description</a>
+<h6>
+<a name="range.reference.algorithms.set.set_symmetric_difference.h1"></a>
+            <span><a name="range.reference.algorithms.set.set_symmetric_difference.description"></a></span><a class="link" href="set_symmetric_difference.html#range.reference.algorithms.set.set_symmetric_difference.description">Description</a>
           </h6>
 <p>
             <code class="computeroutput"><span class="identifier">set_symmetric_difference</span></code>
@@ -73,16 +72,16 @@
             by evaluating <code class="computeroutput"><span class="identifier">pred</span></code> in
             the predicate versions.
           </p>
-<a name="range.reference.algorithms.set.set_symmetric_difference.definition"></a><h6>
-<a name="id738434"></a>
-            <a class="link" href="set_symmetric_difference.html#range.reference.algorithms.set.set_symmetric_difference.definition">Definition</a>
+<h6>
+<a name="range.reference.algorithms.set.set_symmetric_difference.h2"></a>
+            <span><a name="range.reference.algorithms.set.set_symmetric_difference.definition"></a></span><a class="link" href="set_symmetric_difference.html#range.reference.algorithms.set.set_symmetric_difference.definition">Definition</a>
           </h6>
 <p>
             Defined in the header file <code class="computeroutput"><span class="identifier">boost</span><span class="special">/</span><span class="identifier">range</span><span class="special">/</span><span class="identifier">algorithm</span><span class="special">/</span><span class="identifier">set_algorithm</span><span class="special">.</span><span class="identifier">hpp</span></code>
           </p>
-<a name="range.reference.algorithms.set.set_symmetric_difference.requirements"></a><h6>
-<a name="id738504"></a>
-            <a class="link" href="set_symmetric_difference.html#range.reference.algorithms.set.set_symmetric_difference.requirements">Requirements</a>
+<h6>
+<a name="range.reference.algorithms.set.set_symmetric_difference.h3"></a>
+            <span><a name="range.reference.algorithms.set.set_symmetric_difference.requirements"></a></span><a class="link" href="set_symmetric_difference.html#range.reference.algorithms.set.set_symmetric_difference.requirements">Requirements</a>
           </h6>
 <p>
             <span class="bold"><strong>For the non-predicate versions:</strong></span>
@@ -166,9 +165,9 @@
                 second argument types.
               </li>
 </ul></div>
-<a name="range.reference.algorithms.set.set_symmetric_difference.precondition_"></a><h6>
-<a name="id738968"></a>
-            <a class="link" href="set_symmetric_difference.html#range.reference.algorithms.set.set_symmetric_difference.precondition_">Precondition:</a>
+<h6>
+<a name="range.reference.algorithms.set.set_symmetric_difference.h4"></a>
+            <span><a name="range.reference.algorithms.set.set_symmetric_difference.precondition_"></a></span><a class="link" href="set_symmetric_difference.html#range.reference.algorithms.set.set_symmetric_difference.precondition_">Precondition:</a>
           </h6>
 <p>
             <span class="bold"><strong>For the non-predicate versions:</strong></span>
@@ -184,9 +183,9 @@
             <code class="computeroutput"><span class="identifier">rng1</span></code> and <code class="computeroutput"><span class="identifier">rng2</span></code> are sorted in ascending order
             according to <code class="computeroutput"><span class="identifier">pred</span></code>.
           </p>
-<a name="range.reference.algorithms.set.set_symmetric_difference.complexity"></a><h6>
-<a name="id739082"></a>
-            <a class="link" href="set_symmetric_difference.html#range.reference.algorithms.set.set_symmetric_difference.complexity">Complexity</a>
+<h6>
+<a name="range.reference.algorithms.set.set_symmetric_difference.h5"></a>
+            <span><a name="range.reference.algorithms.set.set_symmetric_difference.complexity"></a></span><a class="link" href="set_symmetric_difference.html#range.reference.algorithms.set.set_symmetric_difference.complexity">Complexity</a>
           </h6>
 <p>
             Linear. <code class="computeroutput"><span class="identifier">O</span><span class="special">(</span><span class="identifier">N</span><span class="special">)</span></code>,
@@ -195,7 +194,8 @@
 </div>
 <table xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" width="100%"><tr>
 <td align="left"></td>
-<td align="right"><div class="copyright-footer">Copyright &#169; 2003 -2010 Thorsten Ottosen, Neil Groves<p>
+<td align="right"><div class="copyright-footer">Copyright &#169; 2003-2010 Thorsten Ottosen,
+      Neil Groves<p>
         Distributed under the Boost Software License, Version 1.0. (See accompanying
         file LICENSE_1_0.txt or copy at <a href="http://www.boost.org/LICENSE_1_0.txt" target="_top">http://www.boost.org/LICENSE_1_0.txt</a>)
       </p>
diff --git a/doc/html/range/reference/algorithms/set/set_union.html b/doc/html/range/reference/algorithms/set/set_union.html
index 5dc5176..f9d3f47 100644
--- a/doc/html/range/reference/algorithms/set/set_union.html
+++ b/doc/html/range/reference/algorithms/set/set_union.html
@@ -22,16 +22,15 @@
 <div class="spirit-nav">
 <a accesskey="p" href="includes.html"><img src="../../../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../set.html"><img src="../../../../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../../../../index.html"><img src="../../../../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="set_intersection.html"><img src="../../../../../../../../doc/src/images/next.png" alt="Next"></a>
 </div>
-<div class="section">
+<div class="section range_reference_algorithms_set_set_union">
 <div class="titlepage"><div><div><h5 class="title">
 <a name="range.reference.algorithms.set.set_union"></a><a class="link" href="set_union.html" title="set_union">set_union</a>
 </h5></div></div></div>
-<a name="range.reference.algorithms.set.set_union.prototype"></a><h6>
-<a name="id734387"></a>
-            <a class="link" href="set_union.html#range.reference.algorithms.set.set_union.prototype">Prototype</a>
+<h6>
+<a name="range.reference.algorithms.set.set_union.h0"></a>
+            <span><a name="range.reference.algorithms.set.set_union.prototype"></a></span><a class="link" href="set_union.html#range.reference.algorithms.set.set_union.prototype">Prototype</a>
           </h6>
 <p>
-            
 </p>
 <pre class="programlisting"><span class="keyword">template</span><span class="special">&lt;</span>
     <span class="keyword">class</span> <span class="identifier">SinglePassRange1</span><span class="special">,</span>
@@ -51,13 +50,13 @@
 <span class="identifier">OutputIterator</span> <span class="identifier">set_union</span><span class="special">(</span><span class="keyword">const</span> <span class="identifier">SinglePassRange1</span><span class="special">&amp;</span> <span class="identifier">rng1</span><span class="special">,</span>
                          <span class="keyword">const</span> <span class="identifier">SinglePassRange2</span><span class="special">&amp;</span> <span class="identifier">rng2</span><span class="special">,</span>
                          <span class="identifier">OutputIterator</span>          <span class="identifier">out</span><span class="special">,</span>
-                         <span class="identifier">BinaryPredicate</span>         <span class="identifier">pred</span><span class="special">);</span>    
- </pre>
+                         <span class="identifier">BinaryPredicate</span>         <span class="identifier">pred</span><span class="special">);</span>
+</pre>
 <p>
           </p>
-<a name="range.reference.algorithms.set.set_union.description"></a><h6>
-<a name="id734733"></a>
-            <a class="link" href="set_union.html#range.reference.algorithms.set.set_union.description">Description</a>
+<h6>
+<a name="range.reference.algorithms.set.set_union.h1"></a>
+            <span><a name="range.reference.algorithms.set.set_union.description"></a></span><a class="link" href="set_union.html#range.reference.algorithms.set.set_union.description">Description</a>
           </h6>
 <p>
             <code class="computeroutput"><span class="identifier">set_union</span></code> constructs
@@ -68,16 +67,16 @@
             in the non-predicate versions, and by evaluating <code class="computeroutput"><span class="identifier">pred</span></code>
             in the predicate versions.
           </p>
-<a name="range.reference.algorithms.set.set_union.definition"></a><h6>
-<a name="id734816"></a>
-            <a class="link" href="set_union.html#range.reference.algorithms.set.set_union.definition">Definition</a>
+<h6>
+<a name="range.reference.algorithms.set.set_union.h2"></a>
+            <span><a name="range.reference.algorithms.set.set_union.definition"></a></span><a class="link" href="set_union.html#range.reference.algorithms.set.set_union.definition">Definition</a>
           </h6>
 <p>
             Defined in the header file <code class="computeroutput"><span class="identifier">boost</span><span class="special">/</span><span class="identifier">range</span><span class="special">/</span><span class="identifier">algorithm</span><span class="special">/</span><span class="identifier">set_algorithm</span><span class="special">.</span><span class="identifier">hpp</span></code>
           </p>
-<a name="range.reference.algorithms.set.set_union.requirements"></a><h6>
-<a name="id734887"></a>
-            <a class="link" href="set_union.html#range.reference.algorithms.set.set_union.requirements">Requirements</a>
+<h6>
+<a name="range.reference.algorithms.set.set_union.h3"></a>
+            <span><a name="range.reference.algorithms.set.set_union.requirements"></a></span><a class="link" href="set_union.html#range.reference.algorithms.set.set_union.requirements">Requirements</a>
           </h6>
 <p>
             <span class="bold"><strong>For the non-predicate versions:</strong></span>
@@ -161,9 +160,9 @@
                 second argument types.
               </li>
 </ul></div>
-<a name="range.reference.algorithms.set.set_union.precondition_"></a><h6>
-<a name="id735352"></a>
-            <a class="link" href="set_union.html#range.reference.algorithms.set.set_union.precondition_">Precondition:</a>
+<h6>
+<a name="range.reference.algorithms.set.set_union.h4"></a>
+            <span><a name="range.reference.algorithms.set.set_union.precondition_"></a></span><a class="link" href="set_union.html#range.reference.algorithms.set.set_union.precondition_">Precondition:</a>
           </h6>
 <p>
             <span class="bold"><strong>For the non-predicate versions:</strong></span>
@@ -179,9 +178,9 @@
             <code class="computeroutput"><span class="identifier">rng1</span></code> and <code class="computeroutput"><span class="identifier">rng2</span></code> are sorted in ascending order
             according to <code class="computeroutput"><span class="identifier">pred</span></code>.
           </p>
-<a name="range.reference.algorithms.set.set_union.complexity"></a><h6>
-<a name="id735465"></a>
-            <a class="link" href="set_union.html#range.reference.algorithms.set.set_union.complexity">Complexity</a>
+<h6>
+<a name="range.reference.algorithms.set.set_union.h5"></a>
+            <span><a name="range.reference.algorithms.set.set_union.complexity"></a></span><a class="link" href="set_union.html#range.reference.algorithms.set.set_union.complexity">Complexity</a>
           </h6>
 <p>
             Linear. <code class="computeroutput"><span class="identifier">O</span><span class="special">(</span><span class="identifier">N</span><span class="special">)</span></code>,
@@ -190,7 +189,8 @@
 </div>
 <table xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" width="100%"><tr>
 <td align="left"></td>
-<td align="right"><div class="copyright-footer">Copyright &#169; 2003 -2010 Thorsten Ottosen, Neil Groves<p>
+<td align="right"><div class="copyright-footer">Copyright &#169; 2003-2010 Thorsten Ottosen,
+      Neil Groves<p>
         Distributed under the Boost Software License, Version 1.0. (See accompanying
         file LICENSE_1_0.txt or copy at <a href="http://www.boost.org/LICENSE_1_0.txt" target="_top">http://www.boost.org/LICENSE_1_0.txt</a>)
       </p>
diff --git a/doc/html/range/reference/concept_implementation.html b/doc/html/range/reference/concept_implementation.html
index 3c57172..83ec93c 100644
--- a/doc/html/range/reference/concept_implementation.html
+++ b/doc/html/range/reference/concept_implementation.html
@@ -22,7 +22,7 @@
 <div class="spirit-nav">
 <a accesskey="p" href="overview.html"><img src="../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../reference.html"><img src="../../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../../index.html"><img src="../../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="concept_implementation/synopsis.html"><img src="../../../../../../doc/src/images/next.png" alt="Next"></a>
 </div>
-<div class="section">
+<div class="section range_reference_concept_implementation">
 <div class="titlepage"><div><div><h3 class="title">
 <a name="range.reference.concept_implementation"></a><a class="link" href="concept_implementation.html" title="Range concept implementation">Range concept
       implementation</a>
@@ -34,7 +34,8 @@
 </div>
 <table xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" width="100%"><tr>
 <td align="left"></td>
-<td align="right"><div class="copyright-footer">Copyright &#169; 2003 -2010 Thorsten Ottosen, Neil Groves<p>
+<td align="right"><div class="copyright-footer">Copyright &#169; 2003-2010 Thorsten Ottosen,
+      Neil Groves<p>
         Distributed under the Boost Software License, Version 1.0. (See accompanying
         file LICENSE_1_0.txt or copy at <a href="http://www.boost.org/LICENSE_1_0.txt" target="_top">http://www.boost.org/LICENSE_1_0.txt</a>)
       </p>
diff --git a/doc/html/range/reference/concept_implementation/semantics.html b/doc/html/range/reference/concept_implementation/semantics.html
index 0aed2fa..2816dbb 100644
--- a/doc/html/range/reference/concept_implementation/semantics.html
+++ b/doc/html/range/reference/concept_implementation/semantics.html
@@ -22,7 +22,7 @@
 <div class="spirit-nav">
 <a accesskey="p" href="synopsis.html"><img src="../../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../concept_implementation.html"><img src="../../../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../../../index.html"><img src="../../../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="semantics/metafunctions.html"><img src="../../../../../../../doc/src/images/next.png" alt="Next"></a>
 </div>
-<div class="section">
+<div class="section range_reference_concept_implementation_semantics">
 <div class="titlepage"><div><div><h4 class="title">
 <a name="range.reference.concept_implementation.semantics"></a><a class="link" href="semantics.html" title="Semantics">Semantics</a>
 </h4></div></div></div>
@@ -30,9 +30,9 @@
 <dt><span class="section"><a href="semantics/metafunctions.html">Metafunctions</a></span></dt>
 <dt><span class="section"><a href="semantics/functions.html">Functions</a></span></dt>
 </dl></div>
-<a name="range.reference.concept_implementation.semantics.notation"></a><h6>
-<a name="id654700"></a>
-          <a class="link" href="semantics.html#range.reference.concept_implementation.semantics.notation">notation</a>
+<h6>
+<a name="range.reference.concept_implementation.semantics.h0"></a>
+          <span><a name="range.reference.concept_implementation.semantics.notation"></a></span><a class="link" href="semantics.html#range.reference.concept_implementation.semantics.notation">notation</a>
         </h6>
 <div class="informaltable"><table class="table">
 <colgroup>
@@ -149,7 +149,8 @@
 </div>
 <table xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" width="100%"><tr>
 <td align="left"></td>
-<td align="right"><div class="copyright-footer">Copyright &#169; 2003 -2010 Thorsten Ottosen, Neil Groves<p>
+<td align="right"><div class="copyright-footer">Copyright &#169; 2003-2010 Thorsten Ottosen,
+      Neil Groves<p>
         Distributed under the Boost Software License, Version 1.0. (See accompanying
         file LICENSE_1_0.txt or copy at <a href="http://www.boost.org/LICENSE_1_0.txt" target="_top">http://www.boost.org/LICENSE_1_0.txt</a>)
       </p>
diff --git a/doc/html/range/reference/concept_implementation/semantics/functions.html b/doc/html/range/reference/concept_implementation/semantics/functions.html
index 55f8a17..8f43cc6 100644
--- a/doc/html/range/reference/concept_implementation/semantics/functions.html
+++ b/doc/html/range/reference/concept_implementation/semantics/functions.html
@@ -22,7 +22,7 @@
 <div class="spirit-nav">
 <a accesskey="p" href="metafunctions.html"><img src="../../../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../semantics.html"><img src="../../../../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../../../../index.html"><img src="../../../../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="../../adaptors.html"><img src="../../../../../../../../doc/src/images/next.png" alt="Next"></a>
 </div>
-<div class="section">
+<div class="section range_reference_concept_implementation_semantics_functions">
 <div class="titlepage"><div><div><h5 class="title">
 <a name="range.reference.concept_implementation.semantics.functions"></a><a class="link" href="functions.html" title="Functions">Functions</a>
 </h5></div></div></div>
@@ -163,7 +163,7 @@
                   </td>
 <td>
                     <p>
-                      <code class="computeroutput"><span class="identifier">range_difference</span><span class="special">&lt;</span><span class="identifier">X</span><span class="special">&gt;::</span><span class="identifier">type</span></code>
+                      <code class="computeroutput"><span class="identifier">range_size</span><span class="special">&lt;</span><span class="identifier">X</span><span class="special">&gt;::</span><span class="identifier">type</span></code>
                     </p>
                   </td>
 <td>
@@ -396,7 +396,8 @@
 </div>
 <table xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" width="100%"><tr>
 <td align="left"></td>
-<td align="right"><div class="copyright-footer">Copyright &#169; 2003 -2010 Thorsten Ottosen, Neil Groves<p>
+<td align="right"><div class="copyright-footer">Copyright &#169; 2003-2010 Thorsten Ottosen,
+      Neil Groves<p>
         Distributed under the Boost Software License, Version 1.0. (See accompanying
         file LICENSE_1_0.txt or copy at <a href="http://www.boost.org/LICENSE_1_0.txt" target="_top">http://www.boost.org/LICENSE_1_0.txt</a>)
       </p>
diff --git a/doc/html/range/reference/concept_implementation/semantics/metafunctions.html b/doc/html/range/reference/concept_implementation/semantics/metafunctions.html
index bafa0af..db38cc5 100644
--- a/doc/html/range/reference/concept_implementation/semantics/metafunctions.html
+++ b/doc/html/range/reference/concept_implementation/semantics/metafunctions.html
@@ -22,7 +22,7 @@
 <div class="spirit-nav">
 <a accesskey="p" href="../semantics.html"><img src="../../../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../semantics.html"><img src="../../../../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../../../../index.html"><img src="../../../../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="functions.html"><img src="../../../../../../../../doc/src/images/next.png" alt="Next"></a>
 </div>
-<div class="section">
+<div class="section range_reference_concept_implementation_semantics_metafunctions">
 <div class="titlepage"><div><div><h5 class="title">
 <a name="range.reference.concept_implementation.semantics.metafunctions"></a><a class="link" href="metafunctions.html" title="Metafunctions">Metafunctions</a>
 </h5></div></div></div>
@@ -58,7 +58,6 @@
                   </td>
 <td>
                     <p>
-                      
 </p>
 <pre xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" class="table-programlisting"><span class="identifier">T</span><span class="special">::</span><span class="identifier">iterator</span>
 <span class="identifier">P</span><span class="special">::</span><span class="identifier">first_type</span>
@@ -82,7 +81,6 @@
                   </td>
 <td>
                     <p>
-                      
 </p>
 <pre xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" class="table-programlisting"><span class="identifier">T</span><span class="special">::</span><span class="identifier">const_iterator</span>
 <span class="identifier">P</span><span class="special">::</span><span class="identifier">first_type</span>
@@ -260,7 +258,8 @@
 </div>
 <table xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" width="100%"><tr>
 <td align="left"></td>
-<td align="right"><div class="copyright-footer">Copyright &#169; 2003 -2010 Thorsten Ottosen, Neil Groves<p>
+<td align="right"><div class="copyright-footer">Copyright &#169; 2003-2010 Thorsten Ottosen,
+      Neil Groves<p>
         Distributed under the Boost Software License, Version 1.0. (See accompanying
         file LICENSE_1_0.txt or copy at <a href="http://www.boost.org/LICENSE_1_0.txt" target="_top">http://www.boost.org/LICENSE_1_0.txt</a>)
       </p>
diff --git a/doc/html/range/reference/concept_implementation/synopsis.html b/doc/html/range/reference/concept_implementation/synopsis.html
index 9fdbc91..4f37610 100644
--- a/doc/html/range/reference/concept_implementation/synopsis.html
+++ b/doc/html/range/reference/concept_implementation/synopsis.html
@@ -22,19 +22,18 @@
 <div class="spirit-nav">
 <a accesskey="p" href="../concept_implementation.html"><img src="../../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../concept_implementation.html"><img src="../../../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../../../index.html"><img src="../../../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="semantics.html"><img src="../../../../../../../doc/src/images/next.png" alt="Next"></a>
 </div>
-<div class="section">
+<div class="section range_reference_concept_implementation_synopsis">
 <div class="titlepage"><div><div><h4 class="title">
 <a name="range.reference.concept_implementation.synopsis"></a><a class="link" href="synopsis.html" title="Synopsis">Synopsis</a>
 </h4></div></div></div>
 <p>
-          
 </p>
 <pre class="programlisting"><span class="keyword">namespace</span> <span class="identifier">boost</span>
 <span class="special">{</span>
-    <span class="comment">//
-</span>    <span class="comment">// Single Pass Range metafunctions
-</span>    <span class="comment">//
-</span>
+    <span class="comment">//</span>
+    <span class="comment">// Single Pass Range metafunctions</span>
+    <span class="comment">//</span>
+
     <span class="keyword">template</span><span class="special">&lt;</span> <span class="keyword">class</span> <span class="identifier">T</span> <span class="special">&gt;</span>
     <span class="keyword">struct</span> <span class="identifier">range_iterator</span><span class="special">;</span>
 
@@ -43,31 +42,31 @@
 
     <span class="keyword">template</span><span class="special">&lt;</span> <span class="keyword">class</span> <span class="identifier">T</span> <span class="special">&gt;</span>
     <span class="keyword">struct</span> <span class="identifier">range_reference</span><span class="special">;</span>
-    
+
     <span class="keyword">template</span><span class="special">&lt;</span> <span class="keyword">class</span> <span class="identifier">T</span> <span class="special">&gt;</span>
     <span class="keyword">struct</span> <span class="identifier">range_pointer</span><span class="special">;</span>
-    
+
     <span class="keyword">template</span><span class="special">&lt;</span> <span class="keyword">class</span> <span class="identifier">T</span> <span class="special">&gt;</span>
     <span class="keyword">struct</span> <span class="identifier">range_category</span><span class="special">;</span>
 
-    <span class="comment">//
-</span>    <span class="comment">// Forward Range metafunctions
-</span>    <span class="comment">//
-</span>
+    <span class="comment">//</span>
+    <span class="comment">// Forward Range metafunctions</span>
+    <span class="comment">//</span>
+
     <span class="keyword">template</span><span class="special">&lt;</span> <span class="keyword">class</span> <span class="identifier">T</span> <span class="special">&gt;</span>
     <span class="keyword">struct</span> <span class="identifier">range_difference</span><span class="special">;</span>
 
-    <span class="comment">//
-</span>    <span class="comment">// Bidirectional Range metafunctions
-</span>    <span class="comment">//
-</span>
+    <span class="comment">//</span>
+    <span class="comment">// Bidirectional Range metafunctions</span>
+    <span class="comment">//</span>
+
     <span class="keyword">template</span><span class="special">&lt;</span> <span class="keyword">class</span> <span class="identifier">T</span> <span class="special">&gt;</span>
     <span class="keyword">struct</span> <span class="identifier">range_reverse_iterator</span><span class="special">;</span>
 
-    <span class="comment">//
-</span>    <span class="comment">// Single Pass Range functions
-</span>    <span class="comment">//
-</span>
+    <span class="comment">//</span>
+    <span class="comment">// Single Pass Range functions</span>
+    <span class="comment">//</span>
+
     <span class="keyword">template</span><span class="special">&lt;</span> <span class="keyword">class</span> <span class="identifier">T</span> <span class="special">&gt;</span>
     <span class="keyword">typename</span> <span class="identifier">range_iterator</span><span class="special">&lt;</span><span class="identifier">T</span><span class="special">&gt;::</span><span class="identifier">type</span>
     <span class="identifier">begin</span><span class="special">(</span> <span class="identifier">T</span><span class="special">&amp;</span> <span class="identifier">r</span> <span class="special">);</span>
@@ -88,18 +87,18 @@
     <span class="keyword">bool</span>
     <span class="identifier">empty</span><span class="special">(</span> <span class="keyword">const</span> <span class="identifier">T</span><span class="special">&amp;</span> <span class="identifier">r</span> <span class="special">);</span>
 
-    <span class="comment">//
-</span>    <span class="comment">// Forward Range functions
-</span>    <span class="comment">//
-</span>
+    <span class="comment">//</span>
+    <span class="comment">// Forward Range functions</span>
+    <span class="comment">//</span>
+
     <span class="keyword">template</span><span class="special">&lt;</span> <span class="keyword">class</span> <span class="identifier">T</span> <span class="special">&gt;</span>
     <span class="keyword">typename</span> <span class="identifier">range_difference</span><span class="special">&lt;</span><span class="identifier">T</span><span class="special">&gt;::</span><span class="identifier">type</span>
     <span class="identifier">distance</span><span class="special">(</span> <span class="keyword">const</span> <span class="identifier">T</span><span class="special">&amp;</span> <span class="identifier">r</span> <span class="special">);</span>
 
-    <span class="comment">//
-</span>    <span class="comment">// Bidirectional Range functions
-</span>    <span class="comment">//
-</span>
+    <span class="comment">//</span>
+    <span class="comment">// Bidirectional Range functions</span>
+    <span class="comment">//</span>
+
     <span class="keyword">template</span><span class="special">&lt;</span> <span class="keyword">class</span> <span class="identifier">T</span> <span class="special">&gt;</span>
     <span class="keyword">typename</span> <span class="identifier">range_reverse_iterator</span><span class="special">&lt;</span><span class="identifier">T</span><span class="special">&gt;::</span><span class="identifier">type</span>
     <span class="identifier">rbegin</span><span class="special">(</span> <span class="identifier">T</span><span class="special">&amp;</span> <span class="identifier">r</span> <span class="special">);</span>
@@ -115,63 +114,64 @@
     <span class="keyword">template</span><span class="special">&lt;</span> <span class="keyword">class</span> <span class="identifier">T</span> <span class="special">&gt;</span>
     <span class="keyword">typename</span> <span class="identifier">range_reverse_iterator</span><span class="special">&lt;</span><span class="keyword">const</span> <span class="identifier">T</span><span class="special">&gt;::</span><span class="identifier">type</span>
     <span class="identifier">rend</span><span class="special">(</span> <span class="keyword">const</span> <span class="identifier">T</span><span class="special">&amp;</span> <span class="identifier">r</span> <span class="special">);</span>
-    
-    <span class="comment">//
-</span>    <span class="comment">// Random Access Range functions
-</span>    <span class="comment">//
-</span>    
+
+    <span class="comment">//</span>
+    <span class="comment">// Random Access Range functions</span>
+    <span class="comment">//</span>
+
     <span class="keyword">template</span><span class="special">&lt;</span> <span class="keyword">class</span> <span class="identifier">T</span> <span class="special">&gt;</span>
     <span class="keyword">typename</span> <span class="identifier">range_difference</span><span class="special">&lt;</span><span class="identifier">T</span><span class="special">&gt;::</span><span class="identifier">type</span>
     <span class="identifier">size</span><span class="special">(</span> <span class="keyword">const</span> <span class="identifier">T</span><span class="special">&amp;</span> <span class="identifier">r</span> <span class="special">);</span>
 
-    <span class="comment">//
-</span>    <span class="comment">// Special const Range functions
-</span>    <span class="comment">//
-</span>
+    <span class="comment">//</span>
+    <span class="comment">// Special const Range functions</span>
+    <span class="comment">//</span>
+
     <span class="keyword">template</span><span class="special">&lt;</span> <span class="keyword">class</span> <span class="identifier">T</span> <span class="special">&gt;</span>
-    <span class="keyword">typename</span> <span class="identifier">range_iterator</span><span class="special">&lt;</span><span class="keyword">const</span> <span class="identifier">T</span><span class="special">&gt;::</span><span class="identifier">type</span> 
+    <span class="keyword">typename</span> <span class="identifier">range_iterator</span><span class="special">&lt;</span><span class="keyword">const</span> <span class="identifier">T</span><span class="special">&gt;::</span><span class="identifier">type</span>
     <span class="identifier">const_begin</span><span class="special">(</span> <span class="keyword">const</span> <span class="identifier">T</span><span class="special">&amp;</span> <span class="identifier">r</span> <span class="special">);</span>
 
     <span class="keyword">template</span><span class="special">&lt;</span> <span class="keyword">class</span> <span class="identifier">T</span> <span class="special">&gt;</span>
-    <span class="keyword">typename</span> <span class="identifier">range_iterator</span><span class="special">&lt;</span><span class="keyword">const</span> <span class="identifier">T</span><span class="special">&gt;::</span><span class="identifier">type</span> 
+    <span class="keyword">typename</span> <span class="identifier">range_iterator</span><span class="special">&lt;</span><span class="keyword">const</span> <span class="identifier">T</span><span class="special">&gt;::</span><span class="identifier">type</span>
     <span class="identifier">const_end</span><span class="special">(</span> <span class="keyword">const</span> <span class="identifier">T</span><span class="special">&amp;</span> <span class="identifier">r</span> <span class="special">);</span>
 
     <span class="keyword">template</span><span class="special">&lt;</span> <span class="keyword">class</span> <span class="identifier">T</span> <span class="special">&gt;</span>
-    <span class="keyword">typename</span> <span class="identifier">range_reverse_iterator</span><span class="special">&lt;</span><span class="keyword">const</span> <span class="identifier">T</span><span class="special">&gt;::</span><span class="identifier">type</span> 
+    <span class="keyword">typename</span> <span class="identifier">range_reverse_iterator</span><span class="special">&lt;</span><span class="keyword">const</span> <span class="identifier">T</span><span class="special">&gt;::</span><span class="identifier">type</span>
     <span class="identifier">const_rbegin</span><span class="special">(</span> <span class="keyword">const</span> <span class="identifier">T</span><span class="special">&amp;</span> <span class="identifier">r</span> <span class="special">);</span>
 
     <span class="keyword">template</span><span class="special">&lt;</span> <span class="keyword">class</span> <span class="identifier">T</span> <span class="special">&gt;</span>
-    <span class="keyword">typename</span> <span class="identifier">range_reverse_iterator</span><span class="special">&lt;</span><span class="keyword">const</span> <span class="identifier">T</span><span class="special">&gt;::</span><span class="identifier">type</span> 
+    <span class="keyword">typename</span> <span class="identifier">range_reverse_iterator</span><span class="special">&lt;</span><span class="keyword">const</span> <span class="identifier">T</span><span class="special">&gt;::</span><span class="identifier">type</span>
     <span class="identifier">const_rend</span><span class="special">(</span> <span class="keyword">const</span> <span class="identifier">T</span><span class="special">&amp;</span> <span class="identifier">r</span> <span class="special">);</span>
-    
-    <span class="comment">//
-</span>    <span class="comment">// String utilities
-</span>    <span class="comment">//
-</span>    
+
+    <span class="comment">//</span>
+    <span class="comment">// String utilities</span>
+    <span class="comment">//</span>
+
     <span class="keyword">template</span><span class="special">&lt;</span> <span class="keyword">class</span> <span class="identifier">T</span> <span class="special">&gt;</span>
     <span class="identifier">iterator_range</span><span class="special">&lt;</span> <span class="special">...</span> <span class="identifier">see</span> <span class="identifier">below</span> <span class="special">...</span> <span class="special">&gt;</span>
     <span class="identifier">as_literal</span><span class="special">(</span> <span class="identifier">T</span><span class="special">&amp;</span> <span class="identifier">r</span> <span class="special">);</span>
-    
+
     <span class="keyword">template</span><span class="special">&lt;</span> <span class="keyword">class</span> <span class="identifier">T</span> <span class="special">&gt;</span>
     <span class="identifier">iterator_range</span><span class="special">&lt;</span> <span class="special">...</span> <span class="identifier">see</span> <span class="identifier">below</span> <span class="special">...</span> <span class="special">&gt;</span>
     <span class="identifier">as_literal</span><span class="special">(</span> <span class="keyword">const</span> <span class="identifier">T</span><span class="special">&amp;</span> <span class="identifier">r</span> <span class="special">);</span>
-    
+
     <span class="keyword">template</span><span class="special">&lt;</span> <span class="keyword">class</span> <span class="identifier">T</span> <span class="special">&gt;</span>
     <span class="identifier">iterator_range</span><span class="special">&lt;</span> <span class="keyword">typename</span> <span class="identifier">range_iterator</span><span class="special">&lt;</span><span class="identifier">T</span><span class="special">&gt;::</span><span class="identifier">type</span> <span class="special">&gt;</span>
     <span class="identifier">as_array</span><span class="special">(</span> <span class="identifier">T</span><span class="special">&amp;</span> <span class="identifier">r</span> <span class="special">);</span>
-    
+
     <span class="keyword">template</span><span class="special">&lt;</span> <span class="keyword">class</span> <span class="identifier">T</span> <span class="special">&gt;</span>
     <span class="identifier">iterator_range</span><span class="special">&lt;</span> <span class="keyword">typename</span> <span class="identifier">range_iterator</span><span class="special">&lt;</span><span class="keyword">const</span> <span class="identifier">T</span><span class="special">&gt;::</span><span class="identifier">type</span> <span class="special">&gt;</span>
     <span class="identifier">as_array</span><span class="special">(</span> <span class="keyword">const</span> <span class="identifier">T</span><span class="special">&amp;</span> <span class="identifier">r</span> <span class="special">);</span>
 
-<span class="special">}</span> <span class="comment">// namespace 'boost' 
-</span></pre>
+<span class="special">}</span> <span class="comment">// namespace 'boost'</span>
+</pre>
 <p>
         </p>
 </div>
 <table xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" width="100%"><tr>
 <td align="left"></td>
-<td align="right"><div class="copyright-footer">Copyright &#169; 2003 -2010 Thorsten Ottosen, Neil Groves<p>
+<td align="right"><div class="copyright-footer">Copyright &#169; 2003-2010 Thorsten Ottosen,
+      Neil Groves<p>
         Distributed under the Boost Software License, Version 1.0. (See accompanying
         file LICENSE_1_0.txt or copy at <a href="http://www.boost.org/LICENSE_1_0.txt" target="_top">http://www.boost.org/LICENSE_1_0.txt</a>)
       </p>
diff --git a/doc/html/range/reference/extending.html b/doc/html/range/reference/extending.html
index 6d418a1..37ef612 100644
--- a/doc/html/range/reference/extending.html
+++ b/doc/html/range/reference/extending.html
@@ -22,7 +22,7 @@
 <div class="spirit-nav">
 <a accesskey="p" href="utilities/join.html"><img src="../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../reference.html"><img src="../../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../../index.html"><img src="../../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="extending/method_1.html"><img src="../../../../../../doc/src/images/next.png" alt="Next"></a>
 </div>
-<div class="section">
+<div class="section range_reference_extending">
 <div class="titlepage"><div><div><h3 class="title">
 <a name="range.reference.extending"></a><a class="link" href="extending.html" title="Extending the library">Extending the library</a>
 </h3></div></div></div>
@@ -37,7 +37,8 @@
 </div>
 <table xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" width="100%"><tr>
 <td align="left"></td>
-<td align="right"><div class="copyright-footer">Copyright &#169; 2003 -2010 Thorsten Ottosen, Neil Groves<p>
+<td align="right"><div class="copyright-footer">Copyright &#169; 2003-2010 Thorsten Ottosen,
+      Neil Groves<p>
         Distributed under the Boost Software License, Version 1.0. (See accompanying
         file LICENSE_1_0.txt or copy at <a href="http://www.boost.org/LICENSE_1_0.txt" target="_top">http://www.boost.org/LICENSE_1_0.txt</a>)
       </p>
diff --git a/doc/html/range/reference/extending/method_1.html b/doc/html/range/reference/extending/method_1.html
index 24b054c..8599444 100644
--- a/doc/html/range/reference/extending/method_1.html
+++ b/doc/html/range/reference/extending/method_1.html
@@ -22,7 +22,7 @@
 <div class="spirit-nav">
 <a accesskey="p" href="../extending.html"><img src="../../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../extending.html"><img src="../../../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../../../index.html"><img src="../../../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="method_2.html"><img src="../../../../../../../doc/src/images/next.png" alt="Next"></a>
 </div>
-<div class="section">
+<div class="section range_reference_extending_method_1">
 <div class="titlepage"><div><div><h4 class="title">
 <a name="range.reference.extending.method_1"></a><a class="link" href="method_1.html" title="Method 1: provide member functions and nested types">Method 1: provide
         member functions and nested types</a>
@@ -147,7 +147,8 @@
 </div>
 <table xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" width="100%"><tr>
 <td align="left"></td>
-<td align="right"><div class="copyright-footer">Copyright &#169; 2003 -2010 Thorsten Ottosen, Neil Groves<p>
+<td align="right"><div class="copyright-footer">Copyright &#169; 2003-2010 Thorsten Ottosen,
+      Neil Groves<p>
         Distributed under the Boost Software License, Version 1.0. (See accompanying
         file LICENSE_1_0.txt or copy at <a href="http://www.boost.org/LICENSE_1_0.txt" target="_top">http://www.boost.org/LICENSE_1_0.txt</a>)
       </p>
diff --git a/doc/html/range/reference/extending/method_2.html b/doc/html/range/reference/extending/method_2.html
index 24e9a37..e817031 100644
--- a/doc/html/range/reference/extending/method_2.html
+++ b/doc/html/range/reference/extending/method_2.html
@@ -22,7 +22,7 @@
 <div class="spirit-nav">
 <a accesskey="p" href="method_1.html"><img src="../../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../extending.html"><img src="../../../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../../../index.html"><img src="../../../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="method_3.html"><img src="../../../../../../../doc/src/images/next.png" alt="Next"></a>
 </div>
-<div class="section">
+<div class="section range_reference_extending_method_2">
 <div class="titlepage"><div><div><h4 class="title">
 <a name="range.reference.extending.method_2"></a><a class="link" href="method_2.html" title="Method 2: provide free-standing functions and specialize metafunctions">Method 2: provide
         free-standing functions and specialize metafunctions</a>
@@ -164,33 +164,32 @@
           A complete example is given here:
         </p>
 <p>
-          
 </p>
 <pre class="programlisting"><span class="preprocessor">#include</span> <span class="special">&lt;</span><span class="identifier">boost</span><span class="special">/</span><span class="identifier">range</span><span class="special">.</span><span class="identifier">hpp</span><span class="special">&gt;</span>
-<span class="preprocessor">#include</span> <span class="special">&lt;</span><span class="identifier">iterator</span><span class="special">&gt;</span>         <span class="comment">// for std::iterator_traits, std::distance()
-</span>
+<span class="preprocessor">#include</span> <span class="special">&lt;</span><span class="identifier">iterator</span><span class="special">&gt;</span>         <span class="comment">// for std::iterator_traits, std::distance()</span>
+
 <span class="keyword">namespace</span> <span class="identifier">Foo</span>
 <span class="special">{</span>
-    <span class="comment">//
-</span>    <span class="comment">// Our sample UDT. A 'Pair'
-</span>    <span class="comment">// will work as a range when the stored
-</span>    <span class="comment">// elements are iterators.
-</span>    <span class="comment">//
-</span>    <span class="keyword">template</span><span class="special">&lt;</span> <span class="keyword">class</span> <span class="identifier">T</span> <span class="special">&gt;</span>
+    <span class="comment">//</span>
+    <span class="comment">// Our sample UDT. A 'Pair'</span>
+    <span class="comment">// will work as a range when the stored</span>
+    <span class="comment">// elements are iterators.</span>
+    <span class="comment">//</span>
+    <span class="keyword">template</span><span class="special">&lt;</span> <span class="keyword">class</span> <span class="identifier">T</span> <span class="special">&gt;</span>
     <span class="keyword">struct</span> <span class="identifier">Pair</span>
     <span class="special">{</span>
         <span class="identifier">T</span> <span class="identifier">first</span><span class="special">,</span> <span class="identifier">last</span><span class="special">;</span>
     <span class="special">};</span>
 
-<span class="special">}</span> <span class="comment">// namespace 'Foo'
-</span>
+<span class="special">}</span> <span class="comment">// namespace 'Foo'</span>
+
 <span class="keyword">namespace</span> <span class="identifier">boost</span>
 <span class="special">{</span>
-    <span class="comment">//
-</span>    <span class="comment">// Specialize metafunctions. We must include the range.hpp header.
-</span>    <span class="comment">// We must open the 'boost' namespace.
-</span>    <span class="comment">//
-</span>
+    <span class="comment">//</span>
+    <span class="comment">// Specialize metafunctions. We must include the range.hpp header.</span>
+    <span class="comment">// We must open the 'boost' namespace.</span>
+    <span class="comment">//</span>
+
 	<span class="keyword">template</span><span class="special">&lt;</span> <span class="keyword">class</span> <span class="identifier">T</span> <span class="special">&gt;</span>
 	<span class="keyword">struct</span> <span class="identifier">range_mutable_iterator</span><span class="special">&lt;</span> <span class="identifier">Foo</span><span class="special">::</span><span class="identifier">Pair</span><span class="special">&lt;</span><span class="identifier">T</span><span class="special">&gt;</span> <span class="special">&gt;</span>
 	<span class="special">{</span>
@@ -200,24 +199,24 @@
 	<span class="keyword">template</span><span class="special">&lt;</span> <span class="keyword">class</span> <span class="identifier">T</span> <span class="special">&gt;</span>
 	<span class="keyword">struct</span> <span class="identifier">range_const_iterator</span><span class="special">&lt;</span> <span class="identifier">Foo</span><span class="special">::</span><span class="identifier">Pair</span><span class="special">&lt;</span><span class="identifier">T</span><span class="special">&gt;</span> <span class="special">&gt;</span>
 	<span class="special">{</span>
-		<span class="comment">//
-</span>		<span class="comment">// Remark: this is defined similar to 'range_iterator'
-</span>		<span class="comment">//         because the 'Pair' type does not distinguish
-</span>		<span class="comment">//         between an iterator and a const_iterator.
-</span>		<span class="comment">//
-</span>		<span class="keyword">typedef</span> <span class="identifier">T</span> <span class="identifier">type</span><span class="special">;</span>
+		<span class="comment">//</span>
+		<span class="comment">// Remark: this is defined similar to 'range_iterator'</span>
+		<span class="comment">//         because the 'Pair' type does not distinguish</span>
+		<span class="comment">//         between an iterator and a const_iterator.</span>
+		<span class="comment">//</span>
+		<span class="keyword">typedef</span> <span class="identifier">T</span> <span class="identifier">type</span><span class="special">;</span>
 	<span class="special">};</span>
 
-<span class="special">}</span> <span class="comment">// namespace 'boost'
-</span>
+<span class="special">}</span> <span class="comment">// namespace 'boost'</span>
+
 <span class="keyword">namespace</span> <span class="identifier">Foo</span>
 <span class="special">{</span>
-	<span class="comment">//
-</span>	<span class="comment">// The required functions. These should be defined in
-</span>	<span class="comment">// the same namespace as 'Pair', in this case
-</span>	<span class="comment">// in namespace 'Foo'.
-</span>	<span class="comment">//
-</span>
+	<span class="comment">//</span>
+	<span class="comment">// The required functions. These should be defined in</span>
+	<span class="comment">// the same namespace as 'Pair', in this case</span>
+	<span class="comment">// in namespace 'Foo'.</span>
+	<span class="comment">//</span>
+
 	<span class="keyword">template</span><span class="special">&lt;</span> <span class="keyword">class</span> <span class="identifier">T</span> <span class="special">&gt;</span>
 	<span class="keyword">inline</span> <span class="identifier">T</span> <span class="identifier">range_begin</span><span class="special">(</span> <span class="identifier">Pair</span><span class="special">&lt;</span><span class="identifier">T</span><span class="special">&gt;&amp;</span> <span class="identifier">x</span> <span class="special">)</span>
 	<span class="special">{</span>
@@ -242,8 +241,8 @@
 		<span class="keyword">return</span> <span class="identifier">x</span><span class="special">.</span><span class="identifier">last</span><span class="special">;</span>
 	<span class="special">}</span>
 
-<span class="special">}</span> <span class="comment">// namespace 'Foo'
-</span>
+<span class="special">}</span> <span class="comment">// namespace 'Foo'</span>
+
 <span class="preprocessor">#include</span> <span class="special">&lt;</span><span class="identifier">vector</span><span class="special">&gt;</span>
 
 <span class="keyword">int</span> <span class="identifier">main</span><span class="special">(</span><span class="keyword">int</span> <span class="identifier">argc</span><span class="special">,</span> <span class="keyword">const</span> <span class="keyword">char</span><span class="special">*</span> <span class="identifier">argv</span><span class="special">[])</span>
@@ -252,10 +251,10 @@
 	<span class="identifier">std</span><span class="special">::</span><span class="identifier">vector</span><span class="special">&lt;</span><span class="keyword">int</span><span class="special">&gt;</span>                    <span class="identifier">vec</span><span class="special">;</span>
 	<span class="identifier">Foo</span><span class="special">::</span><span class="identifier">Pair</span><span class="special">&lt;</span><span class="identifier">iter</span><span class="special">&gt;</span>                     <span class="identifier">pair</span> <span class="special">=</span> <span class="special">{</span> <span class="identifier">vec</span><span class="special">.</span><span class="identifier">begin</span><span class="special">(),</span> <span class="identifier">vec</span><span class="special">.</span><span class="identifier">end</span><span class="special">()</span> <span class="special">};</span>
 	<span class="keyword">const</span> <span class="identifier">Foo</span><span class="special">::</span><span class="identifier">Pair</span><span class="special">&lt;</span><span class="identifier">iter</span><span class="special">&gt;&amp;</span>              <span class="identifier">cpair</span> <span class="special">=</span> <span class="identifier">pair</span><span class="special">;</span>
-	<span class="comment">//
-</span>	<span class="comment">// Notice that we call 'begin' etc with qualification.
-</span>	<span class="comment">//
-</span>	<span class="identifier">iter</span> <span class="identifier">i</span> <span class="special">=</span> <span class="identifier">boost</span><span class="special">::</span><span class="identifier">begin</span><span class="special">(</span> <span class="identifier">pair</span> <span class="special">);</span>
+	<span class="comment">//</span>
+	<span class="comment">// Notice that we call 'begin' etc with qualification.</span>
+	<span class="comment">//</span>
+	<span class="identifier">iter</span> <span class="identifier">i</span> <span class="special">=</span> <span class="identifier">boost</span><span class="special">::</span><span class="identifier">begin</span><span class="special">(</span> <span class="identifier">pair</span> <span class="special">);</span>
 	<span class="identifier">iter</span> <span class="identifier">e</span> <span class="special">=</span> <span class="identifier">boost</span><span class="special">::</span><span class="identifier">end</span><span class="special">(</span> <span class="identifier">pair</span> <span class="special">);</span>
 	<span class="identifier">i</span>      <span class="special">=</span> <span class="identifier">boost</span><span class="special">::</span><span class="identifier">begin</span><span class="special">(</span> <span class="identifier">cpair</span> <span class="special">);</span>
 	<span class="identifier">e</span>      <span class="special">=</span> <span class="identifier">boost</span><span class="special">::</span><span class="identifier">end</span><span class="special">(</span> <span class="identifier">cpair</span> <span class="special">);</span>
@@ -273,7 +272,8 @@
 </div>
 <table xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" width="100%"><tr>
 <td align="left"></td>
-<td align="right"><div class="copyright-footer">Copyright &#169; 2003 -2010 Thorsten Ottosen, Neil Groves<p>
+<td align="right"><div class="copyright-footer">Copyright &#169; 2003-2010 Thorsten Ottosen,
+      Neil Groves<p>
         Distributed under the Boost Software License, Version 1.0. (See accompanying
         file LICENSE_1_0.txt or copy at <a href="http://www.boost.org/LICENSE_1_0.txt" target="_top">http://www.boost.org/LICENSE_1_0.txt</a>)
       </p>
diff --git a/doc/html/range/reference/extending/method_3.html b/doc/html/range/reference/extending/method_3.html
index 3cee703..310d4cb 100644
--- a/doc/html/range/reference/extending/method_3.html
+++ b/doc/html/range/reference/extending/method_3.html
@@ -22,7 +22,7 @@
 <div class="spirit-nav">
 <a accesskey="p" href="method_2.html"><img src="../../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../extending.html"><img src="../../../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../../../index.html"><img src="../../../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="method_3/method_3_1.html"><img src="../../../../../../../doc/src/images/next.png" alt="Next"></a>
 </div>
-<div class="section">
+<div class="section range_reference_extending_method_3">
 <div class="titlepage"><div><div><h4 class="title">
 <a name="range.reference.extending.method_3"></a><a class="link" href="method_3.html" title="Method 3: provide range adaptor implementations">Method 3: provide
         range adaptor implementations</a>
@@ -36,7 +36,8 @@
 </div>
 <table xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" width="100%"><tr>
 <td align="left"></td>
-<td align="right"><div class="copyright-footer">Copyright &#169; 2003 -2010 Thorsten Ottosen, Neil Groves<p>
+<td align="right"><div class="copyright-footer">Copyright &#169; 2003-2010 Thorsten Ottosen,
+      Neil Groves<p>
         Distributed under the Boost Software License, Version 1.0. (See accompanying
         file LICENSE_1_0.txt or copy at <a href="http://www.boost.org/LICENSE_1_0.txt" target="_top">http://www.boost.org/LICENSE_1_0.txt</a>)
       </p>
diff --git a/doc/html/range/reference/extending/method_3/method_3_1.html b/doc/html/range/reference/extending/method_3/method_3_1.html
index 07c18f9..10283cb 100644
--- a/doc/html/range/reference/extending/method_3/method_3_1.html
+++ b/doc/html/range/reference/extending/method_3/method_3_1.html
@@ -22,7 +22,7 @@
 <div class="spirit-nav">
 <a accesskey="p" href="../method_3.html"><img src="../../../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../method_3.html"><img src="../../../../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../../../../index.html"><img src="../../../../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="method_3_2.html"><img src="../../../../../../../../doc/src/images/next.png" alt="Next"></a>
 </div>
-<div class="section">
+<div class="section range_reference_extending_method_3_method_3_1">
 <div class="titlepage"><div><div><h5 class="title">
 <a name="range.reference.extending.method_3.method_3_1"></a><a class="link" href="method_3_1.html" title="Method 3.1: Implement a Range Adaptor without arguments">Method
           3.1: Implement a Range Adaptor without arguments</a>
@@ -33,7 +33,7 @@
           </p>
 <div class="orderedlist"><ol class="orderedlist" type="1">
 <li class="listitem">
-                Provide a range for your return type, for example: 
+                Provide a range for your return type, for example:
 <pre class="programlisting"><span class="preprocessor">#include</span> <span class="special">&lt;</span><span class="identifier">boost</span><span class="special">/</span><span class="identifier">range</span><span class="special">/</span><span class="identifier">iterator_range</span><span class="special">.</span><span class="identifier">hpp</span><span class="special">&gt;</span>
 <span class="preprocessor">#include</span> <span class="special">&lt;</span><span class="identifier">boost</span><span class="special">/</span><span class="identifier">iterator</span><span class="special">/</span><span class="identifier">reverse_iterator</span><span class="special">.</span><span class="identifier">hpp</span><span class="special">&gt;</span>
 
@@ -60,7 +60,7 @@
               </li>
 <li class="listitem">
                 Provide a tag to uniquely identify your adaptor in the <code class="computeroutput"><span class="keyword">operator</span><span class="special">|</span></code>
-                function overload set 
+                function overload set
 <pre class="programlisting"><span class="keyword">namespace</span> <span class="identifier">detail</span> <span class="special">{</span>
     <span class="keyword">struct</span> <span class="identifier">reverse_forwarder</span> <span class="special">{};</span>
 <span class="special">}</span>
@@ -68,7 +68,6 @@
               </li>
 <li class="listitem">
                 Implement <code class="computeroutput"><span class="keyword">operator</span><span class="special">|</span></code>
-                
 <pre class="programlisting"><span class="keyword">template</span><span class="special">&lt;</span> <span class="keyword">class</span> <span class="identifier">BidirectionalRng</span> <span class="special">&gt;</span>
 <span class="keyword">inline</span> <span class="identifier">reverse_range</span><span class="special">&lt;</span><span class="identifier">BidirectionalRng</span><span class="special">&gt;</span>
 <span class="keyword">operator</span><span class="special">|(</span> <span class="identifier">BidirectionalRng</span><span class="special">&amp;</span> <span class="identifier">r</span><span class="special">,</span> <span class="identifier">detail</span><span class="special">::</span><span class="identifier">reverse_forwarder</span> <span class="special">)</span>
@@ -88,7 +87,8 @@
 </div>
 <table xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" width="100%"><tr>
 <td align="left"></td>
-<td align="right"><div class="copyright-footer">Copyright &#169; 2003 -2010 Thorsten Ottosen, Neil Groves<p>
+<td align="right"><div class="copyright-footer">Copyright &#169; 2003-2010 Thorsten Ottosen,
+      Neil Groves<p>
         Distributed under the Boost Software License, Version 1.0. (See accompanying
         file LICENSE_1_0.txt or copy at <a href="http://www.boost.org/LICENSE_1_0.txt" target="_top">http://www.boost.org/LICENSE_1_0.txt</a>)
       </p>
diff --git a/doc/html/range/reference/extending/method_3/method_3_2.html b/doc/html/range/reference/extending/method_3/method_3_2.html
index cb5235a..829179a 100644
--- a/doc/html/range/reference/extending/method_3/method_3_2.html
+++ b/doc/html/range/reference/extending/method_3/method_3_2.html
@@ -22,14 +22,14 @@
 <div class="spirit-nav">
 <a accesskey="p" href="method_3_1.html"><img src="../../../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../method_3.html"><img src="../../../../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../../../../index.html"><img src="../../../../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="../../../style_guide.html"><img src="../../../../../../../../doc/src/images/next.png" alt="Next"></a>
 </div>
-<div class="section">
+<div class="section range_reference_extending_method_3_method_3_2">
 <div class="titlepage"><div><div><h5 class="title">
 <a name="range.reference.extending.method_3.method_3_2"></a><a class="link" href="method_3_2.html" title="Method 3.2: Implement a Range Adaptor with arguments">Method
           3.2: Implement a Range Adaptor with arguments</a>
 </h5></div></div></div>
 <div class="orderedlist"><ol class="orderedlist" type="1">
 <li class="listitem">
-                Provide a range for your return type, for example: 
+                Provide a range for your return type, for example:
 <pre class="programlisting"><span class="preprocessor">#include</span> <span class="special">&lt;</span><span class="identifier">boost</span><span class="special">/</span><span class="identifier">range</span><span class="special">/</span><span class="identifier">adaptor</span><span class="special">/</span><span class="identifier">argument_fwd</span><span class="special">.</span><span class="identifier">hpp</span><span class="special">&gt;</span>
 <span class="preprocessor">#include</span> <span class="special">&lt;</span><span class="identifier">boost</span><span class="special">/</span><span class="identifier">range</span><span class="special">/</span><span class="identifier">iterator_range</span><span class="special">.</span><span class="identifier">hpp</span><span class="special">&gt;</span>
 <span class="preprocessor">#include</span> <span class="special">&lt;</span><span class="identifier">boost</span><span class="special">/</span><span class="identifier">iterator</span><span class="special">/</span><span class="identifier">transform_iterator</span><span class="special">.</span><span class="identifier">hpp</span><span class="special">&gt;</span>
@@ -88,7 +88,6 @@
             the right operand of <code class="computeroutput"><span class="keyword">operator</span><span class="special">|()</span></code>.
           </p>
 <p>
-            
 </p>
 <pre class="programlisting"><span class="keyword">template</span><span class="special">&lt;</span><span class="keyword">typename</span> <span class="identifier">T</span><span class="special">&gt;</span>
 <span class="keyword">class</span> <span class="identifier">replace_holder</span> <span class="special">:</span> <span class="keyword">public</span> <span class="identifier">boost</span><span class="special">::</span><span class="identifier">range_detail</span><span class="special">::</span><span class="identifier">holder2</span><span class="special">&lt;</span><span class="identifier">T</span><span class="special">&gt;</span>
@@ -107,7 +106,6 @@
                 Define an instance of the holder with the name of the adaptor
               </li></ol></div>
 <p>
-            
 </p>
 <pre class="programlisting"><span class="keyword">static</span> <span class="identifier">boost</span><span class="special">::</span><span class="identifier">range_detail</span><span class="special">::</span><span class="identifier">forwarder2</span><span class="special">&lt;</span><span class="identifier">replace_holder</span><span class="special">&gt;</span>
 <span class="identifier">replaced</span> <span class="special">=</span> <span class="identifier">boost</span><span class="special">::</span><span class="identifier">range_detail</span><span class="special">::</span><span class="identifier">forwarder2</span><span class="special">&lt;</span><span class="identifier">replace_holder</span><span class="special">&gt;();</span>
@@ -118,7 +116,6 @@
                 Define <code class="computeroutput"><span class="keyword">operator</span><span class="special">|</span></code>
               </li></ol></div>
 <p>
-            
 </p>
 <pre class="programlisting"><span class="keyword">template</span><span class="special">&lt;</span><span class="keyword">typename</span> <span class="identifier">SinglePassRange</span><span class="special">&gt;</span>
 <span class="keyword">inline</span> <span class="identifier">replace_range</span><span class="special">&lt;</span><span class="identifier">SinglePassRange</span><span class="special">&gt;</span>
@@ -141,7 +138,8 @@
 </div>
 <table xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" width="100%"><tr>
 <td align="left"></td>
-<td align="right"><div class="copyright-footer">Copyright &#169; 2003 -2010 Thorsten Ottosen, Neil Groves<p>
+<td align="right"><div class="copyright-footer">Copyright &#169; 2003-2010 Thorsten Ottosen,
+      Neil Groves<p>
         Distributed under the Boost Software License, Version 1.0. (See accompanying
         file LICENSE_1_0.txt or copy at <a href="http://www.boost.org/LICENSE_1_0.txt" target="_top">http://www.boost.org/LICENSE_1_0.txt</a>)
       </p>
diff --git a/doc/html/range/reference/overview.html b/doc/html/range/reference/overview.html
index 0005ece..75be70c 100644
--- a/doc/html/range/reference/overview.html
+++ b/doc/html/range/reference/overview.html
@@ -22,7 +22,7 @@
 <div class="spirit-nav">
 <a accesskey="p" href="../reference.html"><img src="../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../reference.html"><img src="../../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../../index.html"><img src="../../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="concept_implementation.html"><img src="../../../../../../doc/src/images/next.png" alt="Next"></a>
 </div>
-<div class="section">
+<div class="section range_reference_overview">
 <div class="titlepage"><div><div><h3 class="title">
 <a name="range.reference.overview"></a><a class="link" href="overview.html" title="Overview">Overview</a>
 </h3></div></div></div>
@@ -56,7 +56,8 @@
 </div>
 <table xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" width="100%"><tr>
 <td align="left"></td>
-<td align="right"><div class="copyright-footer">Copyright &#169; 2003 -2010 Thorsten Ottosen, Neil Groves<p>
+<td align="right"><div class="copyright-footer">Copyright &#169; 2003-2010 Thorsten Ottosen,
+      Neil Groves<p>
         Distributed under the Boost Software License, Version 1.0. (See accompanying
         file LICENSE_1_0.txt or copy at <a href="http://www.boost.org/LICENSE_1_0.txt" target="_top">http://www.boost.org/LICENSE_1_0.txt</a>)
       </p>
diff --git a/doc/html/range/reference/ranges.html b/doc/html/range/reference/ranges.html
index 37919c5..0fa4330 100644
--- a/doc/html/range/reference/ranges.html
+++ b/doc/html/range/reference/ranges.html
@@ -22,7 +22,7 @@
 <div class="spirit-nav">
 <a accesskey="p" href="algorithms/numeric/partial_sum.html"><img src="../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../reference.html"><img src="../../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../../index.html"><img src="../../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="ranges/any_range.html"><img src="../../../../../../doc/src/images/next.png" alt="Next"></a>
 </div>
-<div class="section">
+<div class="section range_reference_ranges">
 <div class="titlepage"><div><div><h3 class="title">
 <a name="range.reference.ranges"></a><a class="link" href="ranges.html" title="Provided Ranges">Provided Ranges</a>
 </h3></div></div></div>
@@ -35,7 +35,8 @@
 </div>
 <table xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" width="100%"><tr>
 <td align="left"></td>
-<td align="right"><div class="copyright-footer">Copyright &#169; 2003 -2010 Thorsten Ottosen, Neil Groves<p>
+<td align="right"><div class="copyright-footer">Copyright &#169; 2003-2010 Thorsten Ottosen,
+      Neil Groves<p>
         Distributed under the Boost Software License, Version 1.0. (See accompanying
         file LICENSE_1_0.txt or copy at <a href="http://www.boost.org/LICENSE_1_0.txt" target="_top">http://www.boost.org/LICENSE_1_0.txt</a>)
       </p>
diff --git a/doc/html/range/reference/ranges/any_range.html b/doc/html/range/reference/ranges/any_range.html
index 3659c9e..4fdbb28 100644
--- a/doc/html/range/reference/ranges/any_range.html
+++ b/doc/html/range/reference/ranges/any_range.html
@@ -22,13 +22,13 @@
 <div class="spirit-nav">
 <a accesskey="p" href="../ranges.html"><img src="../../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../ranges.html"><img src="../../../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../../../index.html"><img src="../../../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="counting_range.html"><img src="../../../../../../../doc/src/images/next.png" alt="Next"></a>
 </div>
-<div class="section">
+<div class="section range_reference_ranges_any_range">
 <div class="titlepage"><div><div><h4 class="title">
 <a name="range.reference.ranges.any_range"></a><a class="link" href="any_range.html" title="any_range">any_range</a>
 </h4></div></div></div>
-<a name="range.reference.ranges.any_range.description"></a><h6>
-<a name="id754843"></a>
-          <a class="link" href="any_range.html#range.reference.ranges.any_range.description">Description</a>
+<h6>
+<a name="range.reference.ranges.any_range.h0"></a>
+          <span><a name="range.reference.ranges.any_range.description"></a></span><a class="link" href="any_range.html#range.reference.ranges.any_range.description">Description</a>
         </h6>
 <p>
           <code class="computeroutput"><span class="identifier">any_range</span></code> is a range that
@@ -63,12 +63,11 @@
           for a Range Adaptor that returns <code class="computeroutput"><span class="identifier">any_range</span></code>
           instances.
         </p>
-<a name="range.reference.ranges.any_range.synopsis"></a><h6>
-<a name="id755211"></a>
-          <a class="link" href="any_range.html#range.reference.ranges.any_range.synopsis">Synopsis</a>
+<h6>
+<a name="range.reference.ranges.any_range.h1"></a>
+          <span><a name="range.reference.ranges.any_range.synopsis"></a></span><a class="link" href="any_range.html#range.reference.ranges.any_range.synopsis">Synopsis</a>
         </h6>
 <p>
-          
 </p>
 <pre class="programlisting"><span class="keyword">template</span><span class="special">&lt;</span>
     <span class="keyword">class</span> <span class="identifier">Value</span>
@@ -153,9 +152,9 @@
 </pre>
 <p>
         </p>
-<a name="range.reference.ranges.any_range.definition"></a><h6>
-<a name="id756420"></a>
-          <a class="link" href="any_range.html#range.reference.ranges.any_range.definition">Definition</a>
+<h6>
+<a name="range.reference.ranges.any_range.h2"></a>
+          <span><a name="range.reference.ranges.any_range.definition"></a></span><a class="link" href="any_range.html#range.reference.ranges.any_range.definition">Definition</a>
         </h6>
 <p>
           Defined in header file <code class="computeroutput"><span class="identifier">boost</span><span class="special">/</span><span class="identifier">range</span><span class="special">/</span><span class="identifier">any_range</span><span class="special">.</span><span class="identifier">hpp</span></code>
@@ -163,7 +162,8 @@
 </div>
 <table xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" width="100%"><tr>
 <td align="left"></td>
-<td align="right"><div class="copyright-footer">Copyright &#169; 2003 -2010 Thorsten Ottosen, Neil Groves<p>
+<td align="right"><div class="copyright-footer">Copyright &#169; 2003-2010 Thorsten Ottosen,
+      Neil Groves<p>
         Distributed under the Boost Software License, Version 1.0. (See accompanying
         file LICENSE_1_0.txt or copy at <a href="http://www.boost.org/LICENSE_1_0.txt" target="_top">http://www.boost.org/LICENSE_1_0.txt</a>)
       </p>
diff --git a/doc/html/range/reference/ranges/counting_range.html b/doc/html/range/reference/ranges/counting_range.html
index 21a8a16..4dc37ab 100644
--- a/doc/html/range/reference/ranges/counting_range.html
+++ b/doc/html/range/reference/ranges/counting_range.html
@@ -22,16 +22,15 @@
 <div class="spirit-nav">
 <a accesskey="p" href="any_range.html"><img src="../../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../ranges.html"><img src="../../../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../../../index.html"><img src="../../../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="istream_range.html"><img src="../../../../../../../doc/src/images/next.png" alt="Next"></a>
 </div>
-<div class="section">
+<div class="section range_reference_ranges_counting_range">
 <div class="titlepage"><div><div><h4 class="title">
 <a name="range.reference.ranges.counting_range"></a><a class="link" href="counting_range.html" title="counting_range">counting_range</a>
 </h4></div></div></div>
-<a name="range.reference.ranges.counting_range.prototype"></a><h6>
-<a name="id756497"></a>
-          <a class="link" href="counting_range.html#range.reference.ranges.counting_range.prototype">Prototype</a>
+<h6>
+<a name="range.reference.ranges.counting_range.h0"></a>
+          <span><a name="range.reference.ranges.counting_range.prototype"></a></span><a class="link" href="counting_range.html#range.reference.ranges.counting_range.prototype">Prototype</a>
         </h6>
 <p>
-          
 </p>
 <pre class="programlisting"><span class="keyword">template</span><span class="special">&lt;</span> <span class="keyword">class</span> <span class="identifier">Incrementable</span> <span class="special">&gt;</span> <span class="keyword">inline</span>
 <span class="identifier">iterator_range</span><span class="special">&lt;</span> <span class="identifier">counting_iterator</span><span class="special">&lt;</span><span class="identifier">Incrementable</span><span class="special">&gt;</span> <span class="special">&gt;</span>
@@ -47,9 +46,9 @@
 </pre>
 <p>
         </p>
-<a name="range.reference.ranges.counting_range.description"></a><h6>
-<a name="id756879"></a>
-          <a class="link" href="counting_range.html#range.reference.ranges.counting_range.description">Description</a>
+<h6>
+<a name="range.reference.ranges.counting_range.h1"></a>
+          <span><a name="range.reference.ranges.counting_range.description"></a></span><a class="link" href="counting_range.html#range.reference.ranges.counting_range.description">Description</a>
         </h6>
 <p>
           <code class="computeroutput"><span class="identifier">counting_range</span></code> is a function
@@ -57,16 +56,16 @@
           wrapping a <code class="computeroutput"><span class="identifier">counting_iterator</span></code>
           (from Boost.Iterator).
         </p>
-<a name="range.reference.ranges.counting_range.definition"></a><h6>
-<a name="id756935"></a>
-          <a class="link" href="counting_range.html#range.reference.ranges.counting_range.definition">Definition</a>
+<h6>
+<a name="range.reference.ranges.counting_range.h2"></a>
+          <span><a name="range.reference.ranges.counting_range.definition"></a></span><a class="link" href="counting_range.html#range.reference.ranges.counting_range.definition">Definition</a>
         </h6>
 <p>
           Defined in header file <code class="computeroutput"><span class="identifier">boost</span><span class="special">/</span><span class="identifier">range</span><span class="special">/</span><span class="identifier">counting_range</span><span class="special">.</span><span class="identifier">hpp</span></code>
         </p>
-<a name="range.reference.ranges.counting_range.requirements"></a><h6>
-<a name="id756996"></a>
-          <a class="link" href="counting_range.html#range.reference.ranges.counting_range.requirements">Requirements</a>
+<h6>
+<a name="range.reference.ranges.counting_range.h3"></a>
+          <span><a name="range.reference.ranges.counting_range.requirements"></a></span><a class="link" href="counting_range.html#range.reference.ranges.counting_range.requirements">Requirements</a>
         </h6>
 <div class="orderedlist"><ol class="orderedlist" type="1"><li class="listitem">
               <code class="computeroutput"><span class="identifier">Incrementable</span></code> is a
@@ -76,7 +75,8 @@
 </div>
 <table xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" width="100%"><tr>
 <td align="left"></td>
-<td align="right"><div class="copyright-footer">Copyright &#169; 2003 -2010 Thorsten Ottosen, Neil Groves<p>
+<td align="right"><div class="copyright-footer">Copyright &#169; 2003-2010 Thorsten Ottosen,
+      Neil Groves<p>
         Distributed under the Boost Software License, Version 1.0. (See accompanying
         file LICENSE_1_0.txt or copy at <a href="http://www.boost.org/LICENSE_1_0.txt" target="_top">http://www.boost.org/LICENSE_1_0.txt</a>)
       </p>
diff --git a/doc/html/range/reference/ranges/irange.html b/doc/html/range/reference/ranges/irange.html
index 6cc143c..9732152 100644
--- a/doc/html/range/reference/ranges/irange.html
+++ b/doc/html/range/reference/ranges/irange.html
@@ -22,16 +22,15 @@
 <div class="spirit-nav">
 <a accesskey="p" href="istream_range.html"><img src="../../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../ranges.html"><img src="../../../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../../../index.html"><img src="../../../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="../utilities.html"><img src="../../../../../../../doc/src/images/next.png" alt="Next"></a>
 </div>
-<div class="section">
+<div class="section range_reference_ranges_irange">
 <div class="titlepage"><div><div><h4 class="title">
 <a name="range.reference.ranges.irange"></a><a class="link" href="irange.html" title="irange">irange</a>
 </h4></div></div></div>
-<a name="range.reference.ranges.irange.prototype"></a><h6>
-<a name="id757425"></a>
-          <a class="link" href="irange.html#range.reference.ranges.irange.prototype">Prototype</a>
+<h6>
+<a name="range.reference.ranges.irange.h0"></a>
+          <span><a name="range.reference.ranges.irange.prototype"></a></span><a class="link" href="irange.html#range.reference.ranges.irange.prototype">Prototype</a>
         </h6>
 <p>
-          
 </p>
 <pre class="programlisting"><span class="keyword">template</span><span class="special">&lt;</span><span class="keyword">class</span> <span class="identifier">Integer</span><span class="special">&gt;</span>
 <span class="identifier">iterator_range</span><span class="special">&lt;</span> <span class="identifier">range_detail</span><span class="special">::</span><span class="identifier">integer_iterator</span><span class="special">&lt;</span><span class="identifier">Integer</span><span class="special">&gt;</span> <span class="special">&gt;</span>
@@ -43,9 +42,9 @@
 </pre>
 <p>
         </p>
-<a name="range.reference.ranges.irange.description"></a><h6>
-<a name="id757718"></a>
-          <a class="link" href="irange.html#range.reference.ranges.irange.description">Description</a>
+<h6>
+<a name="range.reference.ranges.irange.h1"></a>
+          <span><a name="range.reference.ranges.irange.description"></a></span><a class="link" href="irange.html#range.reference.ranges.irange.description">Description</a>
         </h6>
 <p>
           <code class="computeroutput"><span class="identifier">irange</span></code> is a function to
@@ -57,16 +56,16 @@
           Access Range</a> Concept. It should be noted that the <code class="computeroutput"><span class="identifier">first</span></code> and <code class="computeroutput"><span class="identifier">last</span></code>
           parameters denoted a half-open range.
         </p>
-<a name="range.reference.ranges.irange.definition"></a><h6>
-<a name="id757796"></a>
-          <a class="link" href="irange.html#range.reference.ranges.irange.definition">Definition</a>
+<h6>
+<a name="range.reference.ranges.irange.h2"></a>
+          <span><a name="range.reference.ranges.irange.definition"></a></span><a class="link" href="irange.html#range.reference.ranges.irange.definition">Definition</a>
         </h6>
 <p>
           Defined in the header file <code class="computeroutput"><span class="identifier">boost</span><span class="special">/</span><span class="identifier">range</span><span class="special">/</span><span class="identifier">irange</span><span class="special">.</span><span class="identifier">hpp</span></code>
         </p>
-<a name="range.reference.ranges.irange.requirements"></a><h6>
-<a name="id757857"></a>
-          <a class="link" href="irange.html#range.reference.ranges.irange.requirements">Requirements</a>
+<h6>
+<a name="range.reference.ranges.irange.h3"></a>
+          <span><a name="range.reference.ranges.irange.requirements"></a></span><a class="link" href="irange.html#range.reference.ranges.irange.requirements">Requirements</a>
         </h6>
 <div class="orderedlist"><ol class="orderedlist" type="1">
 <li class="listitem">
@@ -79,9 +78,9 @@
               Concept.
             </li>
 </ol></div>
-<a name="range.reference.ranges.irange.complexity"></a><h6>
-<a name="id757940"></a>
-          <a class="link" href="irange.html#range.reference.ranges.irange.complexity">Complexity</a>
+<h6>
+<a name="range.reference.ranges.irange.h4"></a>
+          <span><a name="range.reference.ranges.irange.complexity"></a></span><a class="link" href="irange.html#range.reference.ranges.irange.complexity">Complexity</a>
         </h6>
 <p>
           Constant. Since this function generates a new range the most significant
@@ -90,7 +89,8 @@
 </div>
 <table xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" width="100%"><tr>
 <td align="left"></td>
-<td align="right"><div class="copyright-footer">Copyright &#169; 2003 -2010 Thorsten Ottosen, Neil Groves<p>
+<td align="right"><div class="copyright-footer">Copyright &#169; 2003-2010 Thorsten Ottosen,
+      Neil Groves<p>
         Distributed under the Boost Software License, Version 1.0. (See accompanying
         file LICENSE_1_0.txt or copy at <a href="http://www.boost.org/LICENSE_1_0.txt" target="_top">http://www.boost.org/LICENSE_1_0.txt</a>)
       </p>
diff --git a/doc/html/range/reference/ranges/istream_range.html b/doc/html/range/reference/ranges/istream_range.html
index 8b11dde..e7562ef 100644
--- a/doc/html/range/reference/ranges/istream_range.html
+++ b/doc/html/range/reference/ranges/istream_range.html
@@ -22,16 +22,15 @@
 <div class="spirit-nav">
 <a accesskey="p" href="counting_range.html"><img src="../../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../ranges.html"><img src="../../../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../../../index.html"><img src="../../../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="irange.html"><img src="../../../../../../../doc/src/images/next.png" alt="Next"></a>
 </div>
-<div class="section">
+<div class="section range_reference_ranges_istream_range">
 <div class="titlepage"><div><div><h4 class="title">
 <a name="range.reference.ranges.istream_range"></a><a class="link" href="istream_range.html" title="istream_range">istream_range</a>
 </h4></div></div></div>
-<a name="range.reference.ranges.istream_range.prototype"></a><h6>
-<a name="id757067"></a>
-          <a class="link" href="istream_range.html#range.reference.ranges.istream_range.prototype">Prototype</a>
+<h6>
+<a name="range.reference.ranges.istream_range.h0"></a>
+          <span><a name="range.reference.ranges.istream_range.prototype"></a></span><a class="link" href="istream_range.html#range.reference.ranges.istream_range.prototype">Prototype</a>
         </h6>
 <p>
-          
 </p>
 <pre class="programlisting"><span class="keyword">template</span><span class="special">&lt;</span> <span class="keyword">class</span> <span class="identifier">Type</span><span class="special">,</span> <span class="keyword">class</span> <span class="identifier">Elem</span><span class="special">,</span> <span class="keyword">class</span> <span class="identifier">Traits</span> <span class="special">&gt;</span> <span class="keyword">inline</span>
 <span class="identifier">iterator_range</span><span class="special">&lt;</span> <span class="identifier">std</span><span class="special">::</span><span class="identifier">istream_iterator</span><span class="special">&lt;</span><span class="identifier">Type</span><span class="special">,</span> <span class="identifier">Elem</span><span class="special">,</span> <span class="identifier">Traits</span><span class="special">&gt;</span> <span class="special">&gt;</span>
@@ -39,18 +38,18 @@
 </pre>
 <p>
         </p>
-<a name="range.reference.ranges.istream_range.description"></a><h6>
-<a name="id757284"></a>
-          <a class="link" href="istream_range.html#range.reference.ranges.istream_range.description">Description</a>
+<h6>
+<a name="range.reference.ranges.istream_range.h1"></a>
+          <span><a name="range.reference.ranges.istream_range.description"></a></span><a class="link" href="istream_range.html#range.reference.ranges.istream_range.description">Description</a>
         </h6>
 <p>
           <code class="computeroutput"><span class="identifier">istream_range</span></code> is a function
           to generator that generates an <code class="computeroutput"><span class="identifier">iterator_range</span></code>
           wrapping a <code class="computeroutput"><span class="identifier">std</span><span class="special">::</span><span class="identifier">istream_iterator</span></code>.
         </p>
-<a name="range.reference.ranges.istream_range.definition"></a><h6>
-<a name="id757348"></a>
-          <a class="link" href="istream_range.html#range.reference.ranges.istream_range.definition">Definition</a>
+<h6>
+<a name="range.reference.ranges.istream_range.h2"></a>
+          <span><a name="range.reference.ranges.istream_range.definition"></a></span><a class="link" href="istream_range.html#range.reference.ranges.istream_range.definition">Definition</a>
         </h6>
 <p>
           Defined in header file <code class="computeroutput"><span class="identifier">boost</span><span class="special">/</span><span class="identifier">range</span><span class="special">/</span><span class="identifier">istream_range</span><span class="special">.</span><span class="identifier">hpp</span></code>
@@ -58,7 +57,8 @@
 </div>
 <table xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" width="100%"><tr>
 <td align="left"></td>
-<td align="right"><div class="copyright-footer">Copyright &#169; 2003 -2010 Thorsten Ottosen, Neil Groves<p>
+<td align="right"><div class="copyright-footer">Copyright &#169; 2003-2010 Thorsten Ottosen,
+      Neil Groves<p>
         Distributed under the Boost Software License, Version 1.0. (See accompanying
         file LICENSE_1_0.txt or copy at <a href="http://www.boost.org/LICENSE_1_0.txt" target="_top">http://www.boost.org/LICENSE_1_0.txt</a>)
       </p>
diff --git a/doc/html/range/reference/utilities.html b/doc/html/range/reference/utilities.html
index f4b5c90..906bf42 100644
--- a/doc/html/range/reference/utilities.html
+++ b/doc/html/range/reference/utilities.html
@@ -22,7 +22,7 @@
 <div class="spirit-nav">
 <a accesskey="p" href="ranges/irange.html"><img src="../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../reference.html"><img src="../../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../../index.html"><img src="../../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="utilities/iterator_range.html"><img src="../../../../../../doc/src/images/next.png" alt="Next"></a>
 </div>
-<div class="section">
+<div class="section range_reference_utilities">
 <div class="titlepage"><div><div><h3 class="title">
 <a name="range.reference.utilities"></a><a class="link" href="utilities.html" title="Utilities">Utilities</a>
 </h3></div></div></div>
@@ -69,7 +69,8 @@
 </div>
 <table xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" width="100%"><tr>
 <td align="left"></td>
-<td align="right"><div class="copyright-footer">Copyright &#169; 2003 -2010 Thorsten Ottosen, Neil Groves<p>
+<td align="right"><div class="copyright-footer">Copyright &#169; 2003-2010 Thorsten Ottosen,
+      Neil Groves<p>
         Distributed under the Boost Software License, Version 1.0. (See accompanying
         file LICENSE_1_0.txt or copy at <a href="http://www.boost.org/LICENSE_1_0.txt" target="_top">http://www.boost.org/LICENSE_1_0.txt</a>)
       </p>
diff --git a/doc/html/range/reference/utilities/iterator_range.html b/doc/html/range/reference/utilities/iterator_range.html
index bbe4521..bc6b928 100644
--- a/doc/html/range/reference/utilities/iterator_range.html
+++ b/doc/html/range/reference/utilities/iterator_range.html
@@ -22,7 +22,7 @@
 <div class="spirit-nav">
 <a accesskey="p" href="../utilities.html"><img src="../../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../utilities.html"><img src="../../../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../../../index.html"><img src="../../../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="sub_range.html"><img src="../../../../../../../doc/src/images/next.png" alt="Next"></a>
 </div>
-<div class="section">
+<div class="section range_reference_utilities_iterator_range">
 <div class="titlepage"><div><div><h4 class="title">
 <a name="range.reference.utilities.iterator_range"></a><a class="link" href="iterator_range.html" title="Class iterator_range">Class <code class="computeroutput"><span class="identifier">iterator_range</span></code></a>
 </h4></div></div></div>
@@ -47,70 +47,69 @@
           singularity limitation is simply propogated from the underlying iterator
           type.
         </p>
-<a name="range.reference.utilities.iterator_range.synopsis"></a><h5>
-<a name="id758301"></a>
-          <a class="link" href="iterator_range.html#range.reference.utilities.iterator_range.synopsis">Synopsis</a>
+<h5>
+<a name="range.reference.utilities.iterator_range.h0"></a>
+          <span><a name="range.reference.utilities.iterator_range.synopsis"></a></span><a class="link" href="iterator_range.html#range.reference.utilities.iterator_range.synopsis">Synopsis</a>
         </h5>
 <p>
-          
 </p>
 <pre class="programlisting"><span class="keyword">namespace</span> <span class="identifier">boost</span>
 <span class="special">{</span>
     <span class="keyword">template</span><span class="special">&lt;</span> <span class="keyword">class</span> <span class="identifier">ForwardTraversalIterator</span> <span class="special">&gt;</span>
     <span class="keyword">class</span> <span class="identifier">iterator_range</span>
     <span class="special">{</span>
-    <span class="keyword">public</span><span class="special">:</span> <span class="comment">// Forward Range types
-</span>        <span class="keyword">typedef</span> <span class="identifier">ForwardTraversalIterator</span>   <span class="identifier">iterator</span><span class="special">;</span>
+    <span class="keyword">public</span><span class="special">:</span> <span class="comment">// Forward Range types</span>
+        <span class="keyword">typedef</span> <span class="identifier">ForwardTraversalIterator</span>   <span class="identifier">iterator</span><span class="special">;</span>
         <span class="keyword">typedef</span> <span class="identifier">ForwardTraversalIterator</span>   <span class="identifier">const_iterator</span><span class="special">;</span>
         <span class="keyword">typedef</span> <span class="identifier">iterator_difference</span><span class="special">&lt;</span><span class="identifier">iterator</span><span class="special">&gt;::</span><span class="identifier">type</span> <span class="identifier">difference_type</span><span class="special">;</span>
 
-    <span class="keyword">public</span><span class="special">:</span> <span class="comment">// construction, assignment
-</span>        <span class="keyword">template</span><span class="special">&lt;</span> <span class="keyword">class</span> <span class="identifier">ForwardTraversalIterator2</span> <span class="special">&gt;</span>
+    <span class="keyword">public</span><span class="special">:</span> <span class="comment">// construction, assignment</span>
+        <span class="keyword">template</span><span class="special">&lt;</span> <span class="keyword">class</span> <span class="identifier">ForwardTraversalIterator2</span> <span class="special">&gt;</span>
         <span class="identifier">iterator_range</span><span class="special">(</span> <span class="identifier">ForwardTraversalIterator2</span> <span class="identifier">Begin</span><span class="special">,</span> <span class="identifier">ForwardTraversalIterator2</span> <span class="identifier">End</span> <span class="special">);</span>
-                    
+
         <span class="keyword">template</span><span class="special">&lt;</span> <span class="keyword">class</span> <span class="identifier">ForwardRange</span> <span class="special">&gt;</span>
         <span class="identifier">iterator_range</span><span class="special">(</span> <span class="identifier">ForwardRange</span><span class="special">&amp;</span> <span class="identifier">r</span> <span class="special">);</span>
-  
+
         <span class="keyword">template</span><span class="special">&lt;</span> <span class="keyword">class</span> <span class="identifier">ForwardRange</span> <span class="special">&gt;</span>
         <span class="identifier">iterator_range</span><span class="special">(</span> <span class="keyword">const</span> <span class="identifier">ForwardRange</span><span class="special">&amp;</span> <span class="identifier">r</span> <span class="special">);</span>
-        
+
         <span class="keyword">template</span><span class="special">&lt;</span> <span class="keyword">class</span> <span class="identifier">ForwardRange</span> <span class="special">&gt;</span>
         <span class="identifier">iterator_range</span><span class="special">&amp;</span> <span class="keyword">operator</span><span class="special">=(</span> <span class="identifier">ForwardRange</span><span class="special">&amp;</span> <span class="identifier">r</span> <span class="special">);</span>
 
         <span class="keyword">template</span><span class="special">&lt;</span> <span class="keyword">class</span> <span class="identifier">ForwardRange</span> <span class="special">&gt;</span>
         <span class="identifier">iterator_range</span><span class="special">&amp;</span> <span class="keyword">operator</span><span class="special">=(</span> <span class="keyword">const</span> <span class="identifier">ForwardRange</span><span class="special">&amp;</span> <span class="identifier">r</span> <span class="special">);</span>
-    
-    <span class="keyword">public</span><span class="special">:</span> <span class="comment">// Forward Range functions
-</span>        <span class="identifier">iterator</span>  <span class="identifier">begin</span><span class="special">()</span> <span class="keyword">const</span><span class="special">;</span>
+
+    <span class="keyword">public</span><span class="special">:</span> <span class="comment">// Forward Range functions</span>
+        <span class="identifier">iterator</span>  <span class="identifier">begin</span><span class="special">()</span> <span class="keyword">const</span><span class="special">;</span>
         <span class="identifier">iterator</span>  <span class="identifier">end</span><span class="special">()</span> <span class="keyword">const</span><span class="special">;</span>
-        
-    <span class="keyword">public</span><span class="special">:</span> <span class="comment">// convenience
-</span>        <span class="keyword">operator</span>    <span class="identifier">unspecified_bool_type</span><span class="special">()</span> <span class="keyword">const</span><span class="special">;</span>
+
+    <span class="keyword">public</span><span class="special">:</span> <span class="comment">// convenience</span>
+        <span class="keyword">operator</span>    <span class="identifier">unspecified_bool_type</span><span class="special">()</span> <span class="keyword">const</span><span class="special">;</span>
         <span class="keyword">bool</span>        <span class="identifier">equal</span><span class="special">(</span> <span class="keyword">const</span> <span class="identifier">iterator_range</span><span class="special">&amp;</span> <span class="special">)</span> <span class="keyword">const</span><span class="special">;</span>
         <span class="identifier">value_type</span><span class="special">&amp;</span> <span class="identifier">front</span><span class="special">()</span> <span class="keyword">const</span><span class="special">;</span>
         <span class="identifier">value_type</span><span class="special">&amp;</span> <span class="identifier">back</span><span class="special">()</span> <span class="keyword">const</span><span class="special">;</span>
         <span class="identifier">iterator_range</span><span class="special">&amp;</span> <span class="identifier">advance_begin</span><span class="special">(</span><span class="identifier">difference_type</span> <span class="identifier">n</span><span class="special">);</span>
         <span class="identifier">iterator_range</span><span class="special">&amp;</span> <span class="identifier">advance_end</span><span class="special">(</span><span class="identifier">difference_type</span> <span class="identifier">n</span><span class="special">);</span>
         <span class="keyword">bool</span>      <span class="identifier">empty</span><span class="special">()</span> <span class="keyword">const</span><span class="special">;</span>
-        <span class="comment">// for Random Access Range only: 
-</span>        <span class="identifier">reference</span> <span class="keyword">operator</span><span class="special">[](</span> <span class="identifier">difference_type</span> <span class="identifier">at</span> <span class="special">)</span> <span class="keyword">const</span><span class="special">;</span>
+        <span class="comment">// for Random Access Range only:</span>
+        <span class="identifier">reference</span> <span class="keyword">operator</span><span class="special">[](</span> <span class="identifier">difference_type</span> <span class="identifier">at</span> <span class="special">)</span> <span class="keyword">const</span><span class="special">;</span>
         <span class="identifier">value_type</span> <span class="keyword">operator</span><span class="special">()(</span> <span class="identifier">difference_type</span> <span class="identifier">at</span> <span class="special">)</span> <span class="keyword">const</span><span class="special">;</span>
         <span class="identifier">size_type</span> <span class="identifier">size</span><span class="special">()</span> <span class="keyword">const</span><span class="special">;</span>
     <span class="special">};</span>
-    
-    <span class="comment">// stream output
-</span>    <span class="keyword">template</span><span class="special">&lt;</span> <span class="keyword">class</span> <span class="identifier">ForwardTraversalIterator</span><span class="special">,</span> <span class="keyword">class</span> <span class="identifier">T</span><span class="special">,</span> <span class="keyword">class</span> <span class="identifier">Traits</span> <span class="special">&gt;</span>
-    <span class="identifier">std</span><span class="special">::</span><span class="identifier">basic_ostream</span><span class="special">&lt;</span><span class="identifier">T</span><span class="special">,</span><span class="identifier">Traits</span><span class="special">&gt;&amp;</span> 
+
+    <span class="comment">// stream output</span>
+    <span class="keyword">template</span><span class="special">&lt;</span> <span class="keyword">class</span> <span class="identifier">ForwardTraversalIterator</span><span class="special">,</span> <span class="keyword">class</span> <span class="identifier">T</span><span class="special">,</span> <span class="keyword">class</span> <span class="identifier">Traits</span> <span class="special">&gt;</span>
+    <span class="identifier">std</span><span class="special">::</span><span class="identifier">basic_ostream</span><span class="special">&lt;</span><span class="identifier">T</span><span class="special">,</span><span class="identifier">Traits</span><span class="special">&gt;&amp;</span>
     <span class="keyword">operator</span><span class="special">&lt;&lt;(</span> <span class="identifier">std</span><span class="special">::</span><span class="identifier">basic_ostream</span><span class="special">&lt;</span><span class="identifier">T</span><span class="special">,</span><span class="identifier">Traits</span><span class="special">&gt;&amp;</span> <span class="identifier">Os</span><span class="special">,</span>
                 <span class="keyword">const</span> <span class="identifier">iterator_range</span><span class="special">&lt;</span><span class="identifier">ForwardTraversalIterator</span><span class="special">&gt;&amp;</span> <span class="identifier">r</span> <span class="special">);</span>
 
-    <span class="comment">// comparison
-</span>    <span class="keyword">template</span><span class="special">&lt;</span> <span class="keyword">class</span> <span class="identifier">ForwardTraversalIterator</span><span class="special">,</span> <span class="keyword">class</span> <span class="identifier">ForwardTraversalIterator2</span> <span class="special">&gt;</span>
-    <span class="keyword">bool</span> <span class="keyword">operator</span><span class="special">==(</span> <span class="keyword">const</span> <span class="identifier">iterator_range</span><span class="special">&lt;</span><span class="identifier">ForwardTraversalIterator</span><span class="special">&gt;&amp;</span> <span class="identifier">l</span><span class="special">,</span> 
+    <span class="comment">// comparison</span>
+    <span class="keyword">template</span><span class="special">&lt;</span> <span class="keyword">class</span> <span class="identifier">ForwardTraversalIterator</span><span class="special">,</span> <span class="keyword">class</span> <span class="identifier">ForwardTraversalIterator2</span> <span class="special">&gt;</span>
+    <span class="keyword">bool</span> <span class="keyword">operator</span><span class="special">==(</span> <span class="keyword">const</span> <span class="identifier">iterator_range</span><span class="special">&lt;</span><span class="identifier">ForwardTraversalIterator</span><span class="special">&gt;&amp;</span> <span class="identifier">l</span><span class="special">,</span>
                      <span class="keyword">const</span> <span class="identifier">iterator_range</span><span class="special">&lt;</span><span class="identifier">ForwardTraversalIterator2</span><span class="special">&gt;&amp;</span> <span class="identifier">r</span> <span class="special">);</span>
 
     <span class="keyword">template</span><span class="special">&lt;</span> <span class="keyword">class</span> <span class="identifier">ForwardTraversalIterator</span><span class="special">,</span> <span class="keyword">class</span> <span class="identifier">ForwardRange</span> <span class="special">&gt;</span>
-    <span class="keyword">bool</span> <span class="keyword">operator</span><span class="special">==(</span> <span class="keyword">const</span> <span class="identifier">iterator_range</span><span class="special">&lt;</span><span class="identifier">ForwardTraversalIterator</span><span class="special">&gt;&amp;</span> <span class="identifier">l</span><span class="special">,</span> 
+    <span class="keyword">bool</span> <span class="keyword">operator</span><span class="special">==(</span> <span class="keyword">const</span> <span class="identifier">iterator_range</span><span class="special">&lt;</span><span class="identifier">ForwardTraversalIterator</span><span class="special">&gt;&amp;</span> <span class="identifier">l</span><span class="special">,</span>
                      <span class="keyword">const</span> <span class="identifier">ForwardRange</span><span class="special">&amp;</span> <span class="identifier">r</span> <span class="special">);</span>
 
     <span class="keyword">template</span><span class="special">&lt;</span> <span class="keyword">class</span> <span class="identifier">ForwardTraversalIterator</span><span class="special">,</span> <span class="keyword">class</span> <span class="identifier">ForwardRange</span> <span class="special">&gt;</span>
@@ -118,11 +117,11 @@
                      <span class="keyword">const</span> <span class="identifier">iterator_range</span><span class="special">&lt;</span><span class="identifier">ForwardTraversalIterator</span><span class="special">&gt;&amp;</span> <span class="identifier">r</span> <span class="special">);</span>
 
     <span class="keyword">template</span><span class="special">&lt;</span> <span class="keyword">class</span> <span class="identifier">ForwardTraversalIterator</span><span class="special">,</span> <span class="keyword">class</span> <span class="identifier">ForwardTraversalIterator2</span> <span class="special">&gt;</span>
-    <span class="keyword">bool</span> <span class="keyword">operator</span><span class="special">!=(</span> <span class="keyword">const</span> <span class="identifier">iterator_range</span><span class="special">&lt;</span><span class="identifier">ForwardTraversalIterator</span><span class="special">&gt;&amp;</span> <span class="identifier">l</span><span class="special">,</span> 
+    <span class="keyword">bool</span> <span class="keyword">operator</span><span class="special">!=(</span> <span class="keyword">const</span> <span class="identifier">iterator_range</span><span class="special">&lt;</span><span class="identifier">ForwardTraversalIterator</span><span class="special">&gt;&amp;</span> <span class="identifier">l</span><span class="special">,</span>
                      <span class="keyword">const</span> <span class="identifier">iterator_range</span><span class="special">&lt;</span><span class="identifier">ForwardTraversalIterator2</span><span class="special">&gt;&amp;</span> <span class="identifier">r</span> <span class="special">);</span>
 
     <span class="keyword">template</span><span class="special">&lt;</span> <span class="keyword">class</span> <span class="identifier">ForwardTraversalIterator</span><span class="special">,</span> <span class="keyword">class</span> <span class="identifier">ForwardRange</span> <span class="special">&gt;</span>
-    <span class="keyword">bool</span> <span class="keyword">operator</span><span class="special">!=(</span> <span class="keyword">const</span> <span class="identifier">iterator_range</span><span class="special">&lt;</span><span class="identifier">ForwardTraversalIterator</span><span class="special">&gt;&amp;</span> <span class="identifier">l</span><span class="special">,</span> 
+    <span class="keyword">bool</span> <span class="keyword">operator</span><span class="special">!=(</span> <span class="keyword">const</span> <span class="identifier">iterator_range</span><span class="special">&lt;</span><span class="identifier">ForwardTraversalIterator</span><span class="special">&gt;&amp;</span> <span class="identifier">l</span><span class="special">,</span>
                      <span class="keyword">const</span> <span class="identifier">ForwardRange</span><span class="special">&amp;</span> <span class="identifier">r</span> <span class="special">);</span>
 
     <span class="keyword">template</span><span class="special">&lt;</span> <span class="keyword">class</span> <span class="identifier">ForwardTraversalIterator</span><span class="special">,</span> <span class="keyword">class</span> <span class="identifier">ForwardRange</span> <span class="special">&gt;</span>
@@ -130,23 +129,23 @@
                      <span class="keyword">const</span> <span class="identifier">iterator_range</span><span class="special">&lt;</span><span class="identifier">ForwardTraversalIterator</span><span class="special">&gt;&amp;</span> <span class="identifier">r</span> <span class="special">);</span>
 
     <span class="keyword">template</span><span class="special">&lt;</span> <span class="keyword">class</span> <span class="identifier">ForwardTraversalIterator</span><span class="special">,</span> <span class="keyword">class</span> <span class="identifier">ForwardTraversalIterator2</span> <span class="special">&gt;</span>
-    <span class="keyword">bool</span> <span class="keyword">operator</span><span class="special">&lt;(</span> <span class="keyword">const</span> <span class="identifier">iterator_range</span><span class="special">&lt;</span><span class="identifier">ForwardTraversalIterator</span><span class="special">&gt;&amp;</span> <span class="identifier">l</span><span class="special">,</span> 
+    <span class="keyword">bool</span> <span class="keyword">operator</span><span class="special">&lt;(</span> <span class="keyword">const</span> <span class="identifier">iterator_range</span><span class="special">&lt;</span><span class="identifier">ForwardTraversalIterator</span><span class="special">&gt;&amp;</span> <span class="identifier">l</span><span class="special">,</span>
                     <span class="keyword">const</span> <span class="identifier">iterator_range</span><span class="special">&lt;</span><span class="identifier">ForwardTraversalIterator2</span><span class="special">&gt;&amp;</span> <span class="identifier">r</span> <span class="special">);</span>
 
     <span class="keyword">template</span><span class="special">&lt;</span> <span class="keyword">class</span> <span class="identifier">ForwardTraversalIterator</span><span class="special">,</span> <span class="keyword">class</span> <span class="identifier">ForwardRange</span> <span class="special">&gt;</span>
-    <span class="keyword">bool</span> <span class="keyword">operator</span><span class="special">&lt;(</span> <span class="keyword">const</span> <span class="identifier">iterator_range</span><span class="special">&lt;</span><span class="identifier">ForwardTraversalIterator</span><span class="special">&gt;&amp;</span> <span class="identifier">l</span><span class="special">,</span> 
+    <span class="keyword">bool</span> <span class="keyword">operator</span><span class="special">&lt;(</span> <span class="keyword">const</span> <span class="identifier">iterator_range</span><span class="special">&lt;</span><span class="identifier">ForwardTraversalIterator</span><span class="special">&gt;&amp;</span> <span class="identifier">l</span><span class="special">,</span>
                     <span class="keyword">const</span> <span class="identifier">ForwardRange</span><span class="special">&amp;</span> <span class="identifier">r</span> <span class="special">);</span>
 
     <span class="keyword">template</span><span class="special">&lt;</span> <span class="keyword">class</span> <span class="identifier">ForwardTraversalIterator</span><span class="special">,</span> <span class="keyword">class</span> <span class="identifier">ForwardRange</span> <span class="special">&gt;</span>
     <span class="keyword">bool</span> <span class="keyword">operator</span><span class="special">&lt;(</span> <span class="keyword">const</span> <span class="identifier">ForwardRange</span><span class="special">&amp;</span> <span class="identifier">l</span><span class="special">,</span>
                     <span class="keyword">const</span> <span class="identifier">iterator_range</span><span class="special">&lt;</span><span class="identifier">ForwardTraversalIterator</span><span class="special">&gt;&amp;</span> <span class="identifier">r</span> <span class="special">);</span>
- 
-    <span class="comment">// external construction
-</span>    <span class="keyword">template</span><span class="special">&lt;</span> <span class="keyword">class</span> <span class="identifier">ForwardTraversalIterator</span> <span class="special">&gt;</span>
+
+    <span class="comment">// external construction</span>
+    <span class="keyword">template</span><span class="special">&lt;</span> <span class="keyword">class</span> <span class="identifier">ForwardTraversalIterator</span> <span class="special">&gt;</span>
     <span class="identifier">iterator_range</span><span class="special">&lt;</span> <span class="identifier">ForwardTraversalIterator</span> <span class="special">&gt;</span>
-    <span class="identifier">make_iterator_range</span><span class="special">(</span> <span class="identifier">ForwardTraversalIterator</span> <span class="identifier">Begin</span><span class="special">,</span> 
+    <span class="identifier">make_iterator_range</span><span class="special">(</span> <span class="identifier">ForwardTraversalIterator</span> <span class="identifier">Begin</span><span class="special">,</span>
                          <span class="identifier">ForwardTraversalIterator</span> <span class="identifier">End</span> <span class="special">);</span>
-       
+
     <span class="keyword">template</span><span class="special">&lt;</span> <span class="keyword">class</span> <span class="identifier">ForwardRange</span> <span class="special">&gt;</span>
     <span class="identifier">iterator_range</span><span class="special">&lt;</span> <span class="keyword">typename</span> <span class="identifier">range_iterator</span><span class="special">&lt;</span><span class="identifier">ForwardRange</span><span class="special">&gt;::</span><span class="identifier">type</span> <span class="special">&gt;</span>
     <span class="identifier">make_iterator_range</span><span class="special">(</span> <span class="identifier">ForwardRange</span><span class="special">&amp;</span> <span class="identifier">r</span> <span class="special">);</span>
@@ -154,25 +153,25 @@
     <span class="keyword">template</span><span class="special">&lt;</span> <span class="keyword">class</span> <span class="identifier">ForwardRange</span> <span class="special">&gt;</span>
     <span class="identifier">iterator_range</span><span class="special">&lt;</span> <span class="keyword">typename</span> <span class="identifier">range_iterator</span><span class="special">&lt;</span><span class="keyword">const</span> <span class="identifier">ForwardRange</span><span class="special">&gt;::</span><span class="identifier">type</span> <span class="special">&gt;</span>
     <span class="identifier">make_iterator_range</span><span class="special">(</span> <span class="keyword">const</span> <span class="identifier">ForwardRange</span><span class="special">&amp;</span> <span class="identifier">r</span> <span class="special">);</span>
-    
+
     <span class="keyword">template</span><span class="special">&lt;</span> <span class="keyword">class</span> <span class="identifier">Range</span> <span class="special">&gt;</span>
     <span class="identifier">iterator_range</span><span class="special">&lt;</span> <span class="keyword">typename</span> <span class="identifier">range_iterator</span><span class="special">&lt;</span><span class="identifier">Range</span><span class="special">&gt;::</span><span class="identifier">type</span> <span class="special">&gt;</span>
     <span class="identifier">make_iterator_range</span><span class="special">(</span> <span class="identifier">Range</span><span class="special">&amp;</span> <span class="identifier">r</span><span class="special">,</span>
                          <span class="keyword">typename</span> <span class="identifier">range_difference</span><span class="special">&lt;</span><span class="identifier">Range</span><span class="special">&gt;::</span><span class="identifier">type</span> <span class="identifier">advance_begin</span><span class="special">,</span>
                          <span class="keyword">typename</span> <span class="identifier">range_difference</span><span class="special">&lt;</span><span class="identifier">Range</span><span class="special">&gt;::</span><span class="identifier">type</span> <span class="identifier">advance_end</span> <span class="special">);</span>
-    
+
     <span class="keyword">template</span><span class="special">&lt;</span> <span class="keyword">class</span> <span class="identifier">Range</span> <span class="special">&gt;</span>
     <span class="identifier">iterator_range</span><span class="special">&lt;</span> <span class="keyword">typename</span> <span class="identifier">range_iterator</span><span class="special">&lt;</span><span class="keyword">const</span> <span class="identifier">Range</span><span class="special">&gt;::</span><span class="identifier">type</span> <span class="special">&gt;</span>
-    <span class="identifier">make_iterator_range</span><span class="special">(</span> <span class="keyword">const</span> <span class="identifier">Range</span><span class="special">&amp;</span> <span class="identifier">r</span><span class="special">,</span> 
+    <span class="identifier">make_iterator_range</span><span class="special">(</span> <span class="keyword">const</span> <span class="identifier">Range</span><span class="special">&amp;</span> <span class="identifier">r</span><span class="special">,</span>
                          <span class="keyword">typename</span> <span class="identifier">range_difference</span><span class="special">&lt;</span><span class="keyword">const</span> <span class="identifier">Range</span><span class="special">&gt;::</span><span class="identifier">type</span> <span class="identifier">advance_begin</span><span class="special">,</span>
                          <span class="keyword">typename</span> <span class="identifier">range_difference</span><span class="special">&lt;</span><span class="keyword">const</span> <span class="identifier">Range</span><span class="special">&gt;::</span><span class="identifier">type</span> <span class="identifier">advance_end</span> <span class="special">);</span>
-    
-    <span class="comment">// convenience
-</span>    <span class="keyword">template</span><span class="special">&lt;</span> <span class="keyword">class</span> <span class="identifier">Sequence</span><span class="special">,</span> <span class="keyword">class</span> <span class="identifier">ForwardRange</span> <span class="special">&gt;</span>
+
+    <span class="comment">// convenience</span>
+    <span class="keyword">template</span><span class="special">&lt;</span> <span class="keyword">class</span> <span class="identifier">Sequence</span><span class="special">,</span> <span class="keyword">class</span> <span class="identifier">ForwardRange</span> <span class="special">&gt;</span>
     <span class="identifier">Sequence</span> <span class="identifier">copy_range</span><span class="special">(</span> <span class="keyword">const</span> <span class="identifier">ForwardRange</span><span class="special">&amp;</span> <span class="identifier">r</span> <span class="special">);</span>
-    
-<span class="special">}</span> <span class="comment">// namespace 'boost'
-</span></pre>
+
+<span class="special">}</span> <span class="comment">// namespace 'boost'</span>
+</pre>
 <p>
         </p>
 <p>
@@ -187,9 +186,9 @@
           are comparable; for example when we are dealing with const and non-const
           iterators from the same container.
         </p>
-<a name="range.reference.utilities.iterator_range.details_member_functions"></a><h5>
-<a name="id761507"></a>
-          <a class="link" href="iterator_range.html#range.reference.utilities.iterator_range.details_member_functions">Details
+<h5>
+<a name="range.reference.utilities.iterator_range.h1"></a>
+          <span><a name="range.reference.utilities.iterator_range.details_member_functions"></a></span><a class="link" href="iterator_range.html#range.reference.utilities.iterator_range.details_member_functions">Details
           member functions</a>
         </h5>
 <p>
@@ -206,9 +205,9 @@
             <span class="identifier">end</span><span class="special">()</span>
             <span class="special">==</span> <span class="identifier">r</span><span class="special">.</span><span class="identifier">end</span><span class="special">();</span></code>
           </p></blockquote></div>
-<a name="range.reference.utilities.iterator_range.details_functions"></a><h5>
-<a name="id761741"></a>
-          <a class="link" href="iterator_range.html#range.reference.utilities.iterator_range.details_functions">Details
+<h5>
+<a name="range.reference.utilities.iterator_range.h2"></a>
+          <span><a name="range.reference.utilities.iterator_range.details_functions"></a></span><a class="link" href="iterator_range.html#range.reference.utilities.iterator_range.details_functions">Details
           functions</a>
         </h5>
 <p>
@@ -238,10 +237,9 @@
             <span class="identifier">begin</span><span class="special">(</span><span class="identifier">l</span><span class="special">),</span> <span class="identifier">end</span><span class="special">(</span><span class="identifier">l</span><span class="special">),</span> <span class="identifier">begin</span><span class="special">(</span><span class="identifier">r</span><span class="special">),</span> <span class="identifier">end</span><span class="special">(</span><span class="identifier">r</span><span class="special">)</span> <span class="special">);</span></code>
           </p></blockquote></div>
 <p>
-          
 </p>
 <pre class="programlisting"><span class="identifier">iterator_range</span> <span class="identifier">make_iterator_range</span><span class="special">(</span> <span class="identifier">Range</span><span class="special">&amp;</span> <span class="identifier">r</span><span class="special">,</span>
-                                    <span class="keyword">typename</span> <span class="identifier">range_difference</span><span class="special">&lt;</span><span class="identifier">Range</span><span class="special">&gt;::</span><span class="identifier">type</span> <span class="identifier">advance_begin</span><span class="special">,</span> 
+                                    <span class="keyword">typename</span> <span class="identifier">range_difference</span><span class="special">&lt;</span><span class="identifier">Range</span><span class="special">&gt;::</span><span class="identifier">type</span> <span class="identifier">advance_begin</span><span class="special">,</span>
                                     <span class="keyword">typename</span> <span class="identifier">range_difference</span><span class="special">&lt;</span><span class="identifier">Range</span><span class="special">&gt;::</span><span class="identifier">type</span> <span class="identifier">advance_end</span> <span class="special">);</span>
 </pre>
 <p>
@@ -250,7 +248,6 @@
             <span class="emphasis"><em><span class="bold"><strong>Effects:</strong></span></em></span>
           </p></blockquote></div>
 <p>
-          
 </p>
 <pre class="programlisting"><span class="identifier">iterator</span> <span class="identifier">new_begin</span> <span class="special">=</span> <span class="identifier">begin</span><span class="special">(</span> <span class="identifier">r</span> <span class="special">),</span>
 <span class="identifier">iterator</span> <span class="identifier">new_end</span>   <span class="special">=</span> <span class="identifier">end</span><span class="special">(</span> <span class="identifier">r</span> <span class="special">);</span>
@@ -271,7 +268,8 @@
 </div>
 <table xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" width="100%"><tr>
 <td align="left"></td>
-<td align="right"><div class="copyright-footer">Copyright &#169; 2003 -2010 Thorsten Ottosen, Neil Groves<p>
+<td align="right"><div class="copyright-footer">Copyright &#169; 2003-2010 Thorsten Ottosen,
+      Neil Groves<p>
         Distributed under the Boost Software License, Version 1.0. (See accompanying
         file LICENSE_1_0.txt or copy at <a href="http://www.boost.org/LICENSE_1_0.txt" target="_top">http://www.boost.org/LICENSE_1_0.txt</a>)
       </p>
diff --git a/doc/html/range/reference/utilities/join.html b/doc/html/range/reference/utilities/join.html
index 6b7d849..59bb26a 100644
--- a/doc/html/range/reference/utilities/join.html
+++ b/doc/html/range/reference/utilities/join.html
@@ -22,7 +22,7 @@
 <div class="spirit-nav">
 <a accesskey="p" href="sub_range.html"><img src="../../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../utilities.html"><img src="../../../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../../../index.html"><img src="../../../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="../extending.html"><img src="../../../../../../../doc/src/images/next.png" alt="Next"></a>
 </div>
-<div class="section">
+<div class="section range_reference_utilities_join">
 <div class="titlepage"><div><div><h4 class="title">
 <a name="range.reference.utilities.join"></a><a class="link" href="join.html" title="Function join">Function join</a>
 </h4></div></div></div>
@@ -38,12 +38,11 @@
           Note that the joined range incurs a performance cost due to the need to
           check if the end of a range has been reached internally during traversal.
         </p>
-<a name="range.reference.utilities.join.synposis"></a><h5>
-<a name="id764138"></a>
-          <a class="link" href="join.html#range.reference.utilities.join.synposis">Synposis</a>
+<h5>
+<a name="range.reference.utilities.join.h0"></a>
+          <span><a name="range.reference.utilities.join.synposis"></a></span><a class="link" href="join.html#range.reference.utilities.join.synposis">Synposis</a>
         </h5>
 <p>
-          
 </p>
 <pre class="programlisting"><span class="keyword">template</span><span class="special">&lt;</span><span class="keyword">typename</span> <span class="identifier">SinglePassRange1</span><span class="special">,</span> <span class="keyword">typename</span> <span class="identifier">SinglePassRange2</span><span class="special">&gt;</span>
 <span class="identifier">joined_range</span><span class="special">&lt;</span><span class="keyword">const</span> <span class="identifier">SinglePassRange1</span><span class="special">,</span> <span class="keyword">const</span> <span class="identifier">SinglePassRange2</span><span class="special">&gt;</span>
@@ -107,9 +106,9 @@
               and <code class="computeroutput"><span class="identifier">rng2</span></code>.
             </li>
 </ul></div>
-<a name="range.reference.utilities.join.example"></a><h5>
-<a name="id764973"></a>
-          <a class="link" href="join.html#range.reference.utilities.join.example">Example</a>
+<h5>
+<a name="range.reference.utilities.join.h1"></a>
+          <span><a name="range.reference.utilities.join.example"></a></span><a class="link" href="join.html#range.reference.utilities.join.example">Example</a>
         </h5>
 <p>
           The expression <code class="computeroutput"><span class="identifier">join</span><span class="special">(</span><span class="identifier">irange</span><span class="special">(</span><span class="number">0</span><span class="special">,</span><span class="number">5</span><span class="special">),</span> <span class="identifier">irange</span><span class="special">(</span><span class="number">5</span><span class="special">,</span><span class="number">10</span><span class="special">))</span></code> would
@@ -118,7 +117,8 @@
 </div>
 <table xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" width="100%"><tr>
 <td align="left"></td>
-<td align="right"><div class="copyright-footer">Copyright &#169; 2003 -2010 Thorsten Ottosen, Neil Groves<p>
+<td align="right"><div class="copyright-footer">Copyright &#169; 2003-2010 Thorsten Ottosen,
+      Neil Groves<p>
         Distributed under the Boost Software License, Version 1.0. (See accompanying
         file LICENSE_1_0.txt or copy at <a href="http://www.boost.org/LICENSE_1_0.txt" target="_top">http://www.boost.org/LICENSE_1_0.txt</a>)
       </p>
diff --git a/doc/html/range/reference/utilities/sub_range.html b/doc/html/range/reference/utilities/sub_range.html
index c35e707..c48818a 100644
--- a/doc/html/range/reference/utilities/sub_range.html
+++ b/doc/html/range/reference/utilities/sub_range.html
@@ -22,7 +22,7 @@
 <div class="spirit-nav">
 <a accesskey="p" href="iterator_range.html"><img src="../../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../utilities.html"><img src="../../../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../../../index.html"><img src="../../../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="join.html"><img src="../../../../../../../doc/src/images/next.png" alt="Next"></a>
 </div>
-<div class="section">
+<div class="section range_reference_utilities_sub_range">
 <div class="titlepage"><div><div><h4 class="title">
 <a name="range.reference.utilities.sub_range"></a><a class="link" href="sub_range.html" title="Class sub_range">Class <code class="computeroutput"><span class="identifier">sub_range</span></code></a>
 </h4></div></div></div>
@@ -34,60 +34,59 @@
           since it knows what a corresponding <code class="computeroutput"><span class="identifier">const_iterator</span></code>
           is.
         </p>
-<a name="range.reference.utilities.sub_range.synopsis"></a><h5>
-<a name="id762873"></a>
-          <a class="link" href="sub_range.html#range.reference.utilities.sub_range.synopsis">Synopsis</a>
+<h5>
+<a name="range.reference.utilities.sub_range.h0"></a>
+          <span><a name="range.reference.utilities.sub_range.synopsis"></a></span><a class="link" href="sub_range.html#range.reference.utilities.sub_range.synopsis">Synopsis</a>
         </h5>
 <p>
-          
 </p>
 <pre class="programlisting"><span class="keyword">namespace</span> <span class="identifier">boost</span>
 <span class="special">{</span>
     <span class="keyword">template</span><span class="special">&lt;</span> <span class="keyword">class</span> <span class="identifier">ForwardRange</span> <span class="special">&gt;</span>
     <span class="keyword">class</span> <span class="identifier">sub_range</span> <span class="special">:</span> <span class="keyword">public</span> <span class="identifier">iterator_range</span><span class="special">&lt;</span> <span class="keyword">typename</span> <span class="identifier">range_iterator</span><span class="special">&lt;</span><span class="identifier">ForwardRange</span><span class="special">&gt;::</span><span class="identifier">type</span> <span class="special">&gt;</span>
     <span class="special">{</span>
-    <span class="keyword">public</span><span class="special">:</span> 
+    <span class="keyword">public</span><span class="special">:</span>
         <span class="keyword">typedef</span> <span class="keyword">typename</span> <span class="identifier">range_iterator</span><span class="special">&lt;</span><span class="identifier">ForwardRange</span><span class="special">&gt;::</span><span class="identifier">type</span> <span class="identifier">iterator</span><span class="special">;</span>
         <span class="keyword">typedef</span> <span class="keyword">typename</span> <span class="identifier">range_iterator</span><span class="special">&lt;</span><span class="keyword">const</span> <span class="identifier">ForwardRange</span><span class="special">&gt;::</span><span class="identifier">type</span>  <span class="identifier">const_iterator</span><span class="special">;</span>
         <span class="keyword">typedef</span> <span class="keyword">typename</span> <span class="identifier">iterator_difference</span><span class="special">&lt;</span><span class="identifier">iterator</span><span class="special">&gt;::</span><span class="identifier">type</span> <span class="identifier">difference_type</span><span class="special">;</span>
-    
-    <span class="keyword">public</span><span class="special">:</span> <span class="comment">// construction, assignment
-</span>        <span class="keyword">template</span><span class="special">&lt;</span> <span class="keyword">class</span> <span class="identifier">ForwardTraversalIterator</span> <span class="special">&gt;</span>
+
+    <span class="keyword">public</span><span class="special">:</span> <span class="comment">// construction, assignment</span>
+        <span class="keyword">template</span><span class="special">&lt;</span> <span class="keyword">class</span> <span class="identifier">ForwardTraversalIterator</span> <span class="special">&gt;</span>
         <span class="identifier">sub_range</span><span class="special">(</span> <span class="identifier">ForwardTraversalIterator</span> <span class="identifier">Begin</span><span class="special">,</span> <span class="identifier">ForwardTraversalIterator</span> <span class="identifier">End</span> <span class="special">);</span>
 
         <span class="keyword">template</span><span class="special">&lt;</span> <span class="keyword">class</span> <span class="identifier">ForwardRange2</span> <span class="special">&gt;</span>
         <span class="identifier">sub_range</span><span class="special">(</span> <span class="identifier">ForwardRange2</span><span class="special">&amp;</span> <span class="identifier">r</span> <span class="special">);</span>
-         
+
         <span class="keyword">template</span><span class="special">&lt;</span> <span class="keyword">class</span> <span class="identifier">ForwardRange2</span> <span class="special">&gt;</span>
         <span class="identifier">sub_range</span><span class="special">(</span> <span class="keyword">const</span> <span class="identifier">Range2</span><span class="special">&amp;</span> <span class="identifier">r</span> <span class="special">);</span>
-         
+
         <span class="keyword">template</span><span class="special">&lt;</span> <span class="keyword">class</span> <span class="identifier">ForwardRange2</span> <span class="special">&gt;</span>
         <span class="identifier">sub_range</span><span class="special">&amp;</span> <span class="keyword">operator</span><span class="special">=(</span> <span class="identifier">ForwardRange2</span><span class="special">&amp;</span> <span class="identifier">r</span> <span class="special">);</span>
 
         <span class="keyword">template</span><span class="special">&lt;</span> <span class="keyword">class</span> <span class="identifier">ForwardRange2</span> <span class="special">&gt;</span>
-        <span class="identifier">sub_range</span><span class="special">&amp;</span> <span class="keyword">operator</span><span class="special">=(</span> <span class="keyword">const</span> <span class="identifier">ForwardRange2</span><span class="special">&amp;</span> <span class="identifier">r</span> <span class="special">);</span>    
-    
-    <span class="keyword">public</span><span class="special">:</span>  <span class="comment">// Forward Range functions 
-</span>        <span class="identifier">iterator</span>        <span class="identifier">begin</span><span class="special">();</span>
+        <span class="identifier">sub_range</span><span class="special">&amp;</span> <span class="keyword">operator</span><span class="special">=(</span> <span class="keyword">const</span> <span class="identifier">ForwardRange2</span><span class="special">&amp;</span> <span class="identifier">r</span> <span class="special">);</span>
+
+    <span class="keyword">public</span><span class="special">:</span>  <span class="comment">// Forward Range functions</span>
+        <span class="identifier">iterator</span>        <span class="identifier">begin</span><span class="special">();</span>
         <span class="identifier">const_iterator</span>  <span class="identifier">begin</span><span class="special">()</span> <span class="keyword">const</span><span class="special">;</span>
         <span class="identifier">iterator</span>        <span class="identifier">end</span><span class="special">();</span>
-        <span class="identifier">const_iterator</span>  <span class="identifier">end</span><span class="special">()</span> <span class="keyword">const</span><span class="special">;</span>    
-        
-    <span class="keyword">public</span><span class="special">:</span> <span class="comment">// convenience 
-</span>        <span class="identifier">value_type</span><span class="special">&amp;</span>       <span class="identifier">front</span><span class="special">();</span>
+        <span class="identifier">const_iterator</span>  <span class="identifier">end</span><span class="special">()</span> <span class="keyword">const</span><span class="special">;</span>
+
+    <span class="keyword">public</span><span class="special">:</span> <span class="comment">// convenience</span>
+        <span class="identifier">value_type</span><span class="special">&amp;</span>       <span class="identifier">front</span><span class="special">();</span>
         <span class="keyword">const</span> <span class="identifier">value_type</span><span class="special">&amp;</span> <span class="identifier">front</span><span class="special">()</span> <span class="keyword">const</span><span class="special">;</span>
         <span class="identifier">value_type</span><span class="special">&amp;</span>       <span class="identifier">back</span><span class="special">();</span>
         <span class="keyword">const</span> <span class="identifier">value_type</span><span class="special">&amp;</span> <span class="identifier">back</span><span class="special">()</span> <span class="keyword">const</span><span class="special">;</span>
-        <span class="comment">// for Random Access Range only: 
-</span>        <span class="identifier">value_type</span><span class="special">&amp;</span>       <span class="keyword">operator</span><span class="special">[](</span> <span class="identifier">size_type</span> <span class="identifier">at</span> <span class="special">);</span>
+        <span class="comment">// for Random Access Range only:</span>
+        <span class="identifier">value_type</span><span class="special">&amp;</span>       <span class="keyword">operator</span><span class="special">[](</span> <span class="identifier">size_type</span> <span class="identifier">at</span> <span class="special">);</span>
         <span class="keyword">const</span> <span class="identifier">value_type</span><span class="special">&amp;</span> <span class="keyword">operator</span><span class="special">[](</span> <span class="identifier">size_type</span> <span class="identifier">at</span> <span class="special">)</span> <span class="keyword">const</span><span class="special">;</span>
-    
+
     <span class="keyword">public</span><span class="special">:</span>
-        <span class="comment">// rest of interface inherited from iterator_range
-</span>    <span class="special">};</span>
-    
-<span class="special">}</span> <span class="comment">// namespace 'boost'
-</span></pre>
+        <span class="comment">// rest of interface inherited from iterator_range</span>
+    <span class="special">};</span>
+
+<span class="special">}</span> <span class="comment">// namespace 'boost'</span>
+</pre>
 <p>
         </p>
 <p>
@@ -98,7 +97,6 @@
           <code class="computeroutput"><span class="identifier">sub_range</span></code>
         </p>
 <p>
-          
 </p>
 <pre class="programlisting"><span class="identifier">std</span><span class="special">::</span><span class="identifier">string</span> <span class="identifier">str</span><span class="special">(</span><span class="string">"hello"</span><span class="special">);</span>
 <span class="identifier">iterator_range</span><span class="special">&lt;</span><span class="identifier">std</span><span class="special">::</span><span class="identifier">string</span><span class="special">::</span><span class="identifier">iterator</span><span class="special">&gt;</span> <span class="identifier">ir</span> <span class="special">=</span> <span class="identifier">find_first</span><span class="special">(</span> <span class="identifier">str</span><span class="special">,</span> <span class="string">"ll"</span> <span class="special">);</span>
@@ -109,7 +107,8 @@
 </div>
 <table xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" width="100%"><tr>
 <td align="left"></td>
-<td align="right"><div class="copyright-footer">Copyright &#169; 2003 -2010 Thorsten Ottosen, Neil Groves<p>
+<td align="right"><div class="copyright-footer">Copyright &#169; 2003-2010 Thorsten Ottosen,
+      Neil Groves<p>
         Distributed under the Boost Software License, Version 1.0. (See accompanying
         file LICENSE_1_0.txt or copy at <a href="http://www.boost.org/LICENSE_1_0.txt" target="_top">http://www.boost.org/LICENSE_1_0.txt</a>)
       </p>
diff --git a/doc/html/range/style_guide.html b/doc/html/range/style_guide.html
index 5e36efd..dd9dfab 100644
--- a/doc/html/range/style_guide.html
+++ b/doc/html/range/style_guide.html
@@ -22,7 +22,7 @@
 <div class="spirit-nav">
 <a accesskey="p" href="reference/extending/method_3/method_3_2.html"><img src="../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../index.html"><img src="../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../index.html"><img src="../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="headers.html"><img src="../../../../../doc/src/images/next.png" alt="Next"></a>
 </div>
-<div class="section">
+<div class="section range_style_guide">
 <div class="titlepage"><div><div><h2 class="title" style="clear: both">
 <a name="range.style_guide"></a><a class="link" href="style_guide.html" title="Terminology and style guidelines">Terminology and style guidelines</a>
 </h2></div></div></div>
@@ -39,43 +39,41 @@
     </p>
 <div class="itemizedlist"><ul class="itemizedlist" type="disc">
 <li class="listitem">
-<p class="simpara">
           <span class="bold"><strong><span class="emphasis"><em>Value access</em></span></strong></span> category:
-        </p>
-<div class="itemizedlist"><ul class="itemizedlist" type="circle">
+          <div class="itemizedlist"><ul class="itemizedlist" type="circle">
 <li class="listitem">
-              Readable Range
-            </li>
+                Readable Range
+              </li>
 <li class="listitem">
-              Writeable Range
-            </li>
+                Writeable Range
+              </li>
 <li class="listitem">
-              Swappable Range
-            </li>
+                Swappable Range
+              </li>
 <li class="listitem">
-              Lvalue Range
-            </li>
+                Lvalue Range
+              </li>
 </ul></div>
-</li>
+        </li>
 <li class="listitem">
-<p class="simpara">
           <span class="bold"><strong><span class="emphasis"><em>Traversal</em></span></strong></span> category:
-        </p>
-<div class="itemizedlist"><ul class="itemizedlist" type="circle">
+          <div class="itemizedlist"><ul class="itemizedlist" type="circle">
 <li class="listitem">
-              <a class="link" href="concepts/single_pass_range.html" title="Single Pass Range">Single Pass Range</a>
-            </li>
+                <a class="link" href="concepts/single_pass_range.html" title="Single Pass Range">Single Pass Range</a>
+              </li>
 <li class="listitem">
-              <a class="link" href="concepts/forward_range.html" title="Forward Range">Forward Range</a>
-            </li>
+                <a class="link" href="concepts/forward_range.html" title="Forward Range">Forward Range</a>
+              </li>
 <li class="listitem">
-              <a class="link" href="concepts/bidirectional_range.html" title="Bidirectional Range">Bidirectional Range</a>
-            </li>
+                <a class="link" href="concepts/bidirectional_range.html" title="Bidirectional Range">Bidirectional
+                Range</a>
+              </li>
 <li class="listitem">
-              <a class="link" href="concepts/random_access_range.html" title="Random Access Range">Random Access Range</a>
-            </li>
+                <a class="link" href="concepts/random_access_range.html" title="Random Access Range">Random Access
+                Range</a>
+              </li>
 </ul></div>
-</li>
+        </li>
 </ul></div>
 <p>
       Notice how we have used the categories from the <a href="../../../../../libs/iterator/doc/new-iter-concepts.html" target="_top">new
@@ -117,7 +115,6 @@
       must be exactly defined. The iterator-based version looks like this:
     </p>
 <p>
-      
 </p>
 <pre class="programlisting"><span class="keyword">template</span><span class="special">&lt;</span> <span class="keyword">class</span> <span class="identifier">RandomAccessTraversalReadableWritableIterator</span> <span class="special">&gt;</span>
 <span class="keyword">void</span> <span class="identifier">sort</span><span class="special">(</span> <span class="identifier">RandomAccessTraversalReadableWritableIterator</span> <span class="identifier">first</span><span class="special">,</span>
@@ -129,7 +126,6 @@
       For ranges the interface becomes
     </p>
 <p>
-      
 </p>
 <pre class="programlisting"><span class="keyword">template</span><span class="special">&lt;</span> <span class="keyword">class</span> <span class="identifier">RandomAccessReadableWritableRange</span> <span class="special">&gt;</span>
 <span class="keyword">void</span> <span class="identifier">sort</span><span class="special">(</span> <span class="identifier">RandomAccessReadableWritableRange</span><span class="special">&amp;</span> <span class="identifier">r</span> <span class="special">);</span>
@@ -139,7 +135,8 @@
 </div>
 <table xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" width="100%"><tr>
 <td align="left"></td>
-<td align="right"><div class="copyright-footer">Copyright &#169; 2003 -2010 Thorsten Ottosen, Neil Groves<p>
+<td align="right"><div class="copyright-footer">Copyright &#169; 2003-2010 Thorsten Ottosen,
+      Neil Groves<p>
         Distributed under the Boost Software License, Version 1.0. (See accompanying
         file LICENSE_1_0.txt or copy at <a href="http://www.boost.org/LICENSE_1_0.txt" target="_top">http://www.boost.org/LICENSE_1_0.txt</a>)
       </p>
diff --git a/doc/html/range/upgrade.html b/doc/html/range/upgrade.html
index 3238193..4f26a86 100644
--- a/doc/html/range/upgrade.html
+++ b/doc/html/range/upgrade.html
@@ -7,7 +7,7 @@
 <link rel="home" href="../index.html" title="Chapter&#160;1.&#160;Range 2.0">
 <link rel="up" href="../index.html" title="Chapter&#160;1.&#160;Range 2.0">
 <link rel="prev" href="mfc_atl/references.html" title="References">
-<link rel="next" href="upgrade/upgrade_from_1_45.html" title="Upgrade from version 1.45">
+<link rel="next" href="upgrade/upgrade_from_1_49.html" title="Upgrade from version 1.49">
 </head>
 <body bgcolor="white" text="black" link="#0000FF" vlink="#840084" alink="#0000FF">
 <table cellpadding="2" width="100%"><tr>
@@ -20,13 +20,15 @@
 </tr></table>
 <hr>
 <div class="spirit-nav">
-<a accesskey="p" href="mfc_atl/references.html"><img src="../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../index.html"><img src="../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../index.html"><img src="../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="upgrade/upgrade_from_1_45.html"><img src="../../../../../doc/src/images/next.png" alt="Next"></a>
+<a accesskey="p" href="mfc_atl/references.html"><img src="../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../index.html"><img src="../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../index.html"><img src="../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="upgrade/upgrade_from_1_49.html"><img src="../../../../../doc/src/images/next.png" alt="Next"></a>
 </div>
-<div class="section">
+<div class="section range_upgrade">
 <div class="titlepage"><div><div><h2 class="title" style="clear: both">
 <a name="range.upgrade"></a><a class="link" href="upgrade.html" title="Upgrade version of Boost.Range">Upgrade version of Boost.Range</a>
 </h2></div></div></div>
 <div class="toc"><dl>
+<dt><span class="section"><a href="upgrade/upgrade_from_1_49.html">Upgrade from version
+      1.49</a></span></dt>
 <dt><span class="section"><a href="upgrade/upgrade_from_1_45.html">Upgrade from version
       1.45</a></span></dt>
 <dt><span class="section"><a href="upgrade/upgrade_from_1_42.html">Upgrade from version
@@ -37,7 +39,8 @@
 </div>
 <table xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" width="100%"><tr>
 <td align="left"></td>
-<td align="right"><div class="copyright-footer">Copyright &#169; 2003 -2010 Thorsten Ottosen, Neil Groves<p>
+<td align="right"><div class="copyright-footer">Copyright &#169; 2003-2010 Thorsten Ottosen,
+      Neil Groves<p>
         Distributed under the Boost Software License, Version 1.0. (See accompanying
         file LICENSE_1_0.txt or copy at <a href="http://www.boost.org/LICENSE_1_0.txt" target="_top">http://www.boost.org/LICENSE_1_0.txt</a>)
       </p>
@@ -45,7 +48,7 @@
 </tr></table>
 <hr>
 <div class="spirit-nav">
-<a accesskey="p" href="mfc_atl/references.html"><img src="../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../index.html"><img src="../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../index.html"><img src="../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="upgrade/upgrade_from_1_45.html"><img src="../../../../../doc/src/images/next.png" alt="Next"></a>
+<a accesskey="p" href="mfc_atl/references.html"><img src="../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../index.html"><img src="../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../index.html"><img src="../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="upgrade/upgrade_from_1_49.html"><img src="../../../../../doc/src/images/next.png" alt="Next"></a>
 </div>
 </body>
 </html>
diff --git a/doc/html/range/upgrade/upgrade_from_1_34.html b/doc/html/range/upgrade/upgrade_from_1_34.html
index f0de146..94ea981 100644
--- a/doc/html/range/upgrade/upgrade_from_1_34.html
+++ b/doc/html/range/upgrade/upgrade_from_1_34.html
@@ -22,7 +22,7 @@
 <div class="spirit-nav">
 <a accesskey="p" href="upgrade_from_1_42.html"><img src="../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../upgrade.html"><img src="../../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../../index.html"><img src="../../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="../portability.html"><img src="../../../../../../doc/src/images/next.png" alt="Next"></a>
 </div>
-<div class="section">
+<div class="section range_upgrade_upgrade_from_1_34">
 <div class="titlepage"><div><div><h3 class="title">
 <a name="range.upgrade.upgrade_from_1_34"></a><a class="link" href="upgrade_from_1_34.html" title="Upgrade from version 1.34">Upgrade from version
       1.34</a>
@@ -64,7 +64,8 @@
 </div>
 <table xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" width="100%"><tr>
 <td align="left"></td>
-<td align="right"><div class="copyright-footer">Copyright &#169; 2003 -2010 Thorsten Ottosen, Neil Groves<p>
+<td align="right"><div class="copyright-footer">Copyright &#169; 2003-2010 Thorsten Ottosen,
+      Neil Groves<p>
         Distributed under the Boost Software License, Version 1.0. (See accompanying
         file LICENSE_1_0.txt or copy at <a href="http://www.boost.org/LICENSE_1_0.txt" target="_top">http://www.boost.org/LICENSE_1_0.txt</a>)
       </p>
diff --git a/doc/html/range/upgrade/upgrade_from_1_42.html b/doc/html/range/upgrade/upgrade_from_1_42.html
index f8a5a48..dffdb75 100644
--- a/doc/html/range/upgrade/upgrade_from_1_42.html
+++ b/doc/html/range/upgrade/upgrade_from_1_42.html
@@ -22,7 +22,7 @@
 <div class="spirit-nav">
 <a accesskey="p" href="upgrade_from_1_45.html"><img src="../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../upgrade.html"><img src="../../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../../index.html"><img src="../../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="upgrade_from_1_34.html"><img src="../../../../../../doc/src/images/next.png" alt="Next"></a>
 </div>
-<div class="section">
+<div class="section range_upgrade_upgrade_from_1_42">
 <div class="titlepage"><div><div><h3 class="title">
 <a name="range.upgrade.upgrade_from_1_42"></a><a class="link" href="upgrade_from_1_42.html" title="Upgrade from version 1.42">Upgrade from version
       1.42</a>
@@ -54,7 +54,8 @@
 </div>
 <table xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" width="100%"><tr>
 <td align="left"></td>
-<td align="right"><div class="copyright-footer">Copyright &#169; 2003 -2010 Thorsten Ottosen, Neil Groves<p>
+<td align="right"><div class="copyright-footer">Copyright &#169; 2003-2010 Thorsten Ottosen,
+      Neil Groves<p>
         Distributed under the Boost Software License, Version 1.0. (See accompanying
         file LICENSE_1_0.txt or copy at <a href="http://www.boost.org/LICENSE_1_0.txt" target="_top">http://www.boost.org/LICENSE_1_0.txt</a>)
       </p>
diff --git a/doc/html/range/upgrade/upgrade_from_1_45.html b/doc/html/range/upgrade/upgrade_from_1_45.html
index 542b5c9..c191960 100644
--- a/doc/html/range/upgrade/upgrade_from_1_45.html
+++ b/doc/html/range/upgrade/upgrade_from_1_45.html
@@ -6,7 +6,7 @@
 <meta name="generator" content="DocBook XSL Stylesheets V1.75.2">
 <link rel="home" href="../../index.html" title="Chapter&#160;1.&#160;Range 2.0">
 <link rel="up" href="../upgrade.html" title="Upgrade version of Boost.Range">
-<link rel="prev" href="../upgrade.html" title="Upgrade version of Boost.Range">
+<link rel="prev" href="upgrade_from_1_49.html" title="Upgrade from version 1.49">
 <link rel="next" href="upgrade_from_1_42.html" title="Upgrade from version 1.42">
 </head>
 <body bgcolor="white" text="black" link="#0000FF" vlink="#840084" alink="#0000FF">
@@ -20,9 +20,9 @@
 </tr></table>
 <hr>
 <div class="spirit-nav">
-<a accesskey="p" href="../upgrade.html"><img src="../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../upgrade.html"><img src="../../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../../index.html"><img src="../../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="upgrade_from_1_42.html"><img src="../../../../../../doc/src/images/next.png" alt="Next"></a>
+<a accesskey="p" href="upgrade_from_1_49.html"><img src="../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../upgrade.html"><img src="../../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../../index.html"><img src="../../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="upgrade_from_1_42.html"><img src="../../../../../../doc/src/images/next.png" alt="Next"></a>
 </div>
-<div class="section">
+<div class="section range_upgrade_upgrade_from_1_45">
 <div class="titlepage"><div><div><h3 class="title">
 <a name="range.upgrade.upgrade_from_1_45"></a><a class="link" href="upgrade_from_1_45.html" title="Upgrade from version 1.45">Upgrade from version
       1.45</a>
@@ -50,7 +50,8 @@
 </div>
 <table xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" width="100%"><tr>
 <td align="left"></td>
-<td align="right"><div class="copyright-footer">Copyright &#169; 2003 -2010 Thorsten Ottosen, Neil Groves<p>
+<td align="right"><div class="copyright-footer">Copyright &#169; 2003-2010 Thorsten Ottosen,
+      Neil Groves<p>
         Distributed under the Boost Software License, Version 1.0. (See accompanying
         file LICENSE_1_0.txt or copy at <a href="http://www.boost.org/LICENSE_1_0.txt" target="_top">http://www.boost.org/LICENSE_1_0.txt</a>)
       </p>
@@ -58,7 +59,7 @@
 </tr></table>
 <hr>
 <div class="spirit-nav">
-<a accesskey="p" href="../upgrade.html"><img src="../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../upgrade.html"><img src="../../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../../index.html"><img src="../../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="upgrade_from_1_42.html"><img src="../../../../../../doc/src/images/next.png" alt="Next"></a>
+<a accesskey="p" href="upgrade_from_1_49.html"><img src="../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../upgrade.html"><img src="../../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../../index.html"><img src="../../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="upgrade_from_1_42.html"><img src="../../../../../../doc/src/images/next.png" alt="Next"></a>
 </div>
 </body>
 </html>
diff --git a/doc/html/range/upgrade/upgrade_from_1_49.html b/doc/html/range/upgrade/upgrade_from_1_49.html
new file mode 100644
index 0000000..5f97998
--- /dev/null
+++ b/doc/html/range/upgrade/upgrade_from_1_49.html
@@ -0,0 +1,50 @@
+<html>
+<head>
+<meta http-equiv="Content-Type" content="text/html; charset=US-ASCII">
+<title>Upgrade from version 1.49</title>
+<link rel="stylesheet" href="../../../../../../doc/src/boostbook.css" type="text/css">
+<meta name="generator" content="DocBook XSL Stylesheets V1.75.2">
+<link rel="home" href="../../index.html" title="Chapter&#160;1.&#160;Range 2.0">
+<link rel="up" href="../upgrade.html" title="Upgrade version of Boost.Range">
+<link rel="prev" href="../upgrade.html" title="Upgrade version of Boost.Range">
+<link rel="next" href="upgrade_from_1_45.html" title="Upgrade from version 1.45">
+</head>
+<body bgcolor="white" text="black" link="#0000FF" vlink="#840084" alink="#0000FF">
+<table cellpadding="2" width="100%"><tr>
+<td valign="top"><img alt="Boost C++ Libraries" width="277" height="86" src="../../../../../../boost.png"></td>
+<td align="center"><a href="../../../../../../index.html">Home</a></td>
+<td align="center"><a href="../../../../../../libs/libraries.htm">Libraries</a></td>
+<td align="center"><a href="http://www.boost.org/users/people.html">People</a></td>
+<td align="center"><a href="http://www.boost.org/users/faq.html">FAQ</a></td>
+<td align="center"><a href="../../../../../../more/index.htm">More</a></td>
+</tr></table>
+<hr>
+<div class="spirit-nav">
+<a accesskey="p" href="../upgrade.html"><img src="../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../upgrade.html"><img src="../../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../../index.html"><img src="../../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="upgrade_from_1_45.html"><img src="../../../../../../doc/src/images/next.png" alt="Next"></a>
+</div>
+<div class="section range_upgrade_upgrade_from_1_49">
+<div class="titlepage"><div><div><h3 class="title">
+<a name="range.upgrade.upgrade_from_1_49"></a><a class="link" href="upgrade_from_1_49.html" title="Upgrade from version 1.49">Upgrade from version
+      1.49</a>
+</h3></div></div></div>
+<div class="orderedlist"><ol class="orderedlist" type="1"><li class="listitem">
+            <a class="link" href="../reference/concept_implementation/semantics/functions.html" title="Functions"><code class="computeroutput"><span class="identifier">size</span></code></a> now returns the type Rng::size_type
+            if the range has size_type; otherwise range_size&lt;Rng&gt;::type is
+            used. This is the distance type promoted to an unsigned type.
+          </li></ol></div>
+</div>
+<table xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" width="100%"><tr>
+<td align="left"></td>
+<td align="right"><div class="copyright-footer">Copyright &#169; 2003-2010 Thorsten Ottosen,
+      Neil Groves<p>
+        Distributed under the Boost Software License, Version 1.0. (See accompanying
+        file LICENSE_1_0.txt or copy at <a href="http://www.boost.org/LICENSE_1_0.txt" target="_top">http://www.boost.org/LICENSE_1_0.txt</a>)
+      </p>
+</div></td>
+</tr></table>
+<hr>
+<div class="spirit-nav">
+<a accesskey="p" href="../upgrade.html"><img src="../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../upgrade.html"><img src="../../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../../index.html"><img src="../../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="upgrade_from_1_45.html"><img src="../../../../../../doc/src/images/next.png" alt="Next"></a>
+</div>
+</body>
+</html>
diff --git a/doc/upgrade.qbk b/doc/upgrade.qbk
index e97f761..482a825 100644
--- a/doc/upgrade.qbk
+++ b/doc/upgrade.qbk
@@ -11,6 +11,8 @@
 otherwise range_size<Rng>::type is used. This is the distance type promoted to
 an unsigned type.
 
+[endsect]
+
 [section:upgrade_from_1_45 Upgrade from version 1.45]
 
 # __size__ in addition to supporting __random_access_range__ now also supports extensibility via calls to the unqualified `range_calculate_size(rng)` function.

From bf4ca510ea6675fb9549a46c9c4e4879fe0711eb Mon Sep 17 00:00:00 2001
From: Nathan Ridge <zeratul976@hotmail.com>
Date: Thu, 13 Dec 2012 07:09:11 +0000
Subject: [PATCH 18/41] [range] fixed some doc typos (patch by Michel Morin)

[SVN r81889]
---
 doc/history_ack.qbk                                             | 2 +-
 doc/html/index.html                                             | 2 +-
 doc/html/range/history_ack.html                                 | 2 +-
 doc/html/range/reference/adaptors/reference/type_erased.html    | 2 +-
 doc/html/range/reference/algorithms/mutating/fill_n.html        | 2 +-
 .../algorithms/non_mutating/lexicographical_compare.html        | 2 +-
 doc/html/range/reference/algorithms/non_mutating/mismatch.html  | 2 +-
 doc/html/range/reference/algorithms/numeric/accumulate.html     | 2 +-
 doc/html/range/reference/utilities/iterator_range.html          | 2 +-
 doc/reference/adaptors/type_erased.qbk                          | 2 +-
 doc/reference/algorithm/fill_n.qbk                              | 2 +-
 doc/reference/algorithm/lexicographical_compare.qbk             | 2 +-
 doc/reference/algorithm/mismatch.qbk                            | 2 +-
 doc/reference/numeric/accumulate.qbk                            | 2 +-
 doc/reference/utilities.qbk                                     | 2 +-
 15 files changed, 15 insertions(+), 15 deletions(-)

diff --git a/doc/history_ack.qbk b/doc/history_ack.qbk
index f8c39e4..27f9e2a 100644
--- a/doc/history_ack.qbk
+++ b/doc/history_ack.qbk
@@ -20,7 +20,7 @@ Special thanks goes to
 * Pavel Vozenilek for help with porting the library
 * Jonathan Turkanis and John Torjo for help with documentation
 * Hartmut Kaiser for being review manager
-* Jonathan Turkanis for porting the lib (as far sa possible) to vc6 and vc7.
+* Jonathan Turkanis for porting the lib (as far as possible) to vc6 and vc7.
 
 The concept checks and their documentation was provided by Daniel Walker.
 
diff --git a/doc/html/index.html b/doc/html/index.html
index 01dcdb6..e67d025 100644
--- a/doc/html/index.html
+++ b/doc/html/index.html
@@ -147,7 +147,7 @@
   </p>
 </div>
 <table xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" width="100%"><tr>
-<td align="left"><p><small>Last revised: December 13, 2012 at 06:35:02 GMT</small></p></td>
+<td align="left"><p><small>Last revised: December 13, 2012 at 06:53:49 GMT</small></p></td>
 <td align="right"><div class="copyright-footer"></div></td>
 </tr></table>
 <hr>
diff --git a/doc/html/range/history_ack.html b/doc/html/range/history_ack.html
index f3f974e..0297e85 100644
--- a/doc/html/range/history_ack.html
+++ b/doc/html/range/history_ack.html
@@ -72,7 +72,7 @@
           Hartmut Kaiser for being review manager
         </li>
 <li class="listitem">
-          Jonathan Turkanis for porting the lib (as far sa possible) to vc6 and vc7.
+          Jonathan Turkanis for porting the lib (as far as possible) to vc6 and vc7.
         </li>
 </ul></div>
 <p>
diff --git a/doc/html/range/reference/adaptors/reference/type_erased.html b/doc/html/range/reference/adaptors/reference/type_erased.html
index c678e56..20430be 100644
--- a/doc/html/range/reference/adaptors/reference/type_erased.html
+++ b/doc/html/range/reference/adaptors/reference/type_erased.html
@@ -105,7 +105,7 @@
 <li class="listitem">
                       <code class="computeroutput"><span class="identifier">Traversal</span></code> is
                       the tag used to identify the traversal of the resultant range.
-                      Frequently it is desireable to set a traversal category lower
+                      Frequently it is desirable to set a traversal category lower
                       than the source container or range to maximize the number of
                       ranges that can convert to the <code class="computeroutput"><span class="identifier">any_range</span></code>.
                       If this is left as boost::use_default then <code class="computeroutput"><span class="identifier">Traversal</span></code>
diff --git a/doc/html/range/reference/algorithms/mutating/fill_n.html b/doc/html/range/reference/algorithms/mutating/fill_n.html
index 065b6df..0355369 100644
--- a/doc/html/range/reference/algorithms/mutating/fill_n.html
+++ b/doc/html/range/reference/algorithms/mutating/fill_n.html
@@ -43,7 +43,7 @@
           </h6>
 <p>
             <code class="computeroutput"><span class="identifier">fill_n</span></code> assigns the value
-            <code class="computeroutput"><span class="identifier">val</span></code> to <code class="computeroutput"><span class="identifier">n</span></code> elements in the range <code class="computeroutput"><span class="identifier">rng</span></code> begining with <code class="computeroutput"><span class="identifier">boost</span><span class="special">::</span><span class="identifier">begin</span><span class="special">(</span><span class="identifier">rng</span><span class="special">)</span></code>.
+            <code class="computeroutput"><span class="identifier">val</span></code> to <code class="computeroutput"><span class="identifier">n</span></code> elements in the range <code class="computeroutput"><span class="identifier">rng</span></code> beginning with <code class="computeroutput"><span class="identifier">boost</span><span class="special">::</span><span class="identifier">begin</span><span class="special">(</span><span class="identifier">rng</span><span class="special">)</span></code>.
           </p>
 <h6>
 <a name="range.reference.algorithms.mutating.fill_n.h2"></a>
diff --git a/doc/html/range/reference/algorithms/non_mutating/lexicographical_compare.html b/doc/html/range/reference/algorithms/non_mutating/lexicographical_compare.html
index 669ad55..7f28b05 100644
--- a/doc/html/range/reference/algorithms/non_mutating/lexicographical_compare.html
+++ b/doc/html/range/reference/algorithms/non_mutating/lexicographical_compare.html
@@ -107,7 +107,7 @@
                 Let <code class="computeroutput"><span class="identifier">x</span></code> be an object
                 of <code class="computeroutput"><span class="identifier">SinglePassRange1</span></code>'s
                 value type. Let <code class="computeroutput"><span class="identifier">y</span></code>
-                be an obect of <code class="computeroutput"><span class="identifier">SinglePassRange2</span></code>'s
+                be an object of <code class="computeroutput"><span class="identifier">SinglePassRange2</span></code>'s
                 value type. <code class="computeroutput"><span class="identifier">x</span> <span class="special">&lt;</span>
                 <span class="identifier">y</span></code> must be valid. <code class="computeroutput"><span class="identifier">y</span> <span class="special">&lt;</span>
                 <span class="identifier">x</span></code> must be valid.
diff --git a/doc/html/range/reference/algorithms/non_mutating/mismatch.html b/doc/html/range/reference/algorithms/non_mutating/mismatch.html
index df6cf62..b89faa4 100644
--- a/doc/html/range/reference/algorithms/non_mutating/mismatch.html
+++ b/doc/html/range/reference/algorithms/non_mutating/mismatch.html
@@ -109,7 +109,7 @@
           </h6>
 <p>
             <code class="computeroutput"><span class="identifier">mismatch</span></code> finds the first
-            position where the correseponding elements from the two ranges <code class="computeroutput"><span class="identifier">rng1</span></code> and <code class="computeroutput"><span class="identifier">rng2</span></code>
+            position where the corresponding elements from the two ranges <code class="computeroutput"><span class="identifier">rng1</span></code> and <code class="computeroutput"><span class="identifier">rng2</span></code>
             are not equal.
           </p>
 <p>
diff --git a/doc/html/range/reference/algorithms/numeric/accumulate.html b/doc/html/range/reference/algorithms/numeric/accumulate.html
index 46fd9e7..8303f4b 100644
--- a/doc/html/range/reference/algorithms/numeric/accumulate.html
+++ b/doc/html/range/reference/algorithms/numeric/accumulate.html
@@ -90,7 +90,7 @@
 <li class="listitem">
                 An <code class="computeroutput"><span class="keyword">operator</span><span class="special">+</span></code>
                 is defined for a left-hand operand of type <code class="computeroutput"><span class="identifier">Value</span></code>
-                and a right-hand operance of the <code class="computeroutput"><span class="identifier">SinglePassRange</span></code>
+                and a right-hand operand of the <code class="computeroutput"><span class="identifier">SinglePassRange</span></code>
                 value type.
               </li>
 <li class="listitem">
diff --git a/doc/html/range/reference/utilities/iterator_range.html b/doc/html/range/reference/utilities/iterator_range.html
index bc6b928..3470733 100644
--- a/doc/html/range/reference/utilities/iterator_range.html
+++ b/doc/html/range/reference/utilities/iterator_range.html
@@ -44,7 +44,7 @@
           then one can still call all its member functions. This design decision
           avoids the <code class="computeroutput"><span class="identifier">iterator_range</span></code>
           imposing limitations upon ranges of iterators that are not singular. Any
-          singularity limitation is simply propogated from the underlying iterator
+          singularity limitation is simply propagated from the underlying iterator
           type.
         </p>
 <h5>
diff --git a/doc/reference/adaptors/type_erased.qbk b/doc/reference/adaptors/type_erased.qbk
index a24bee7..9fb72a5 100644
--- a/doc/reference/adaptors/type_erased.qbk
+++ b/doc/reference/adaptors/type_erased.qbk
@@ -18,7 +18,7 @@ Let `Rng` be the type of `rng`.
 * [*Template parameters:]
     * `Value` is the `value_type` for the `any_range`. If this is set to boost::use_default, `Value` will be calculated from the
         range type when the adaptor is applied.
-    * `Traversal` is the tag used to identify the traversal of the resultant range. Frequently it is desireable to set a traversal category lower than the source container or range to maximize the number of ranges that can convert to the `any_range`. If this is left as boost::use_default then `Traversal` will be `typename boost::iterator_traversal<boost::range_iterator<Rng>::type>::type`
+    * `Traversal` is the tag used to identify the traversal of the resultant range. Frequently it is desirable to set a traversal category lower than the source container or range to maximize the number of ranges that can convert to the `any_range`. If this is left as boost::use_default then `Traversal` will be `typename boost::iterator_traversal<boost::range_iterator<Rng>::type>::type`
     * `Reference` is the `reference` for the `any_range`. `boost::use_default` will equate to `typename range_reference<Rng>::type`.
     * `Difference` is the `difference_type` for the any_range. `boost::use_default` will equate to `typename boost::range_difference<Rng>::type`
     * `Buffer` is the storage used to allocate the underlying iterator wrappers. This can typically be ignored, but is available as a template parameter for customization. Buffer must be a model of the `AnyIteratorBufferConcept`.
diff --git a/doc/reference/algorithm/fill_n.qbk b/doc/reference/algorithm/fill_n.qbk
index 6458255..1375d4e 100644
--- a/doc/reference/algorithm/fill_n.qbk
+++ b/doc/reference/algorithm/fill_n.qbk
@@ -14,7 +14,7 @@ ForwardRange& fill( ForwardRange& rng, Size n, const Value& val );
 
 [heading Description]
 
-`fill_n` assigns the value `val` to `n` elements in the range `rng` begining with `boost::begin(rng)`.
+`fill_n` assigns the value `val` to `n` elements in the range `rng` beginning with `boost::begin(rng)`.
 
 [heading Definition]
 
diff --git a/doc/reference/algorithm/lexicographical_compare.qbk b/doc/reference/algorithm/lexicographical_compare.qbk
index c8fad4b..8160b15 100644
--- a/doc/reference/algorithm/lexicographical_compare.qbk
+++ b/doc/reference/algorithm/lexicographical_compare.qbk
@@ -41,7 +41,7 @@ Defined in the header file `boost/range/algorithm/lexicographical_compare.hpp`
 * `SinglePassRange2` is a model of the __single_pass_range__ Concept.
 * `SinglePassRange1`'s value type is a model of the `LessThanComparableConcept`.
 * `SinglePassRange2`'s value type is a model of the `LessThanComparableConcept`.
-* Let `x` be an object of `SinglePassRange1`'s value type. Let `y` be an obect of `SinglePassRange2`'s value type. `x < y` must be valid. `y < x` must be valid.
+* Let `x` be an object of `SinglePassRange1`'s value type. Let `y` be an object of `SinglePassRange2`'s value type. `x < y` must be valid. `y < x` must be valid.
 
 [*For the predicate versions of lexicographical_compare:]
 
diff --git a/doc/reference/algorithm/mismatch.qbk b/doc/reference/algorithm/mismatch.qbk
index eb23928..3599733 100644
--- a/doc/reference/algorithm/mismatch.qbk
+++ b/doc/reference/algorithm/mismatch.qbk
@@ -80,7 +80,7 @@ mismatch(const SinglePassRange1& rng1, SinglePassRange2& rng2,
 
 [heading Description]
 
-`mismatch` finds the first position where the correseponding elements from the two ranges `rng1` and `rng2` are not equal.
+`mismatch` finds the first position where the corresponding elements from the two ranges `rng1` and `rng2` are not equal.
 
 Equality is determined by `operator==` for non-predicate versions of `mismatch`, and by satisfying `pred` in the predicate versions.
 
diff --git a/doc/reference/numeric/accumulate.qbk b/doc/reference/numeric/accumulate.qbk
index af5df1d..e151e63 100644
--- a/doc/reference/numeric/accumulate.qbk
+++ b/doc/reference/numeric/accumulate.qbk
@@ -42,7 +42,7 @@ Defined in the header file `boost/range/numeric.hpp`
 
 # `SinglePassRange` is a model of the __single_pass_range__ Concept.
 # `Value` is a model of the `AssignableConcept`.
-# An `operator+` is defined for a left-hand operand of type `Value` and a right-hand operance of the `SinglePassRange` value type.
+# An `operator+` is defined for a left-hand operand of type `Value` and a right-hand operand of the `SinglePassRange` value type.
 # The return type of the above operator is convertible to `Value`.
 
 [heading For the second version]
diff --git a/doc/reference/utilities.qbk b/doc/reference/utilities.qbk
index 25a7edb..0da1f52 100644
--- a/doc/reference/utilities.qbk
+++ b/doc/reference/utilities.qbk
@@ -21,7 +21,7 @@ The intention of the `iterator_range` class is to encapsulate two iterators so t
 
 If the template argument is not a model of __forward_traversal_iterator__, one can still use a subset of the interface. In particular, `size()` requires Random Access Traversal Iterators whereas `empty()` only requires Single Pass Iterators.
 
-Recall that many default constructed iterators are [*/singular/] and hence can only be assigned, but not compared or incremented or anything. However, if one creates a default constructed `iterator_range`, then one can still call all its member functions. This design decision avoids the `iterator_range` imposing limitations upon ranges of iterators that are not singular. Any singularity limitation is simply propogated from the underlying iterator type.
+Recall that many default constructed iterators are [*/singular/] and hence can only be assigned, but not compared or incremented or anything. However, if one creates a default constructed `iterator_range`, then one can still call all its member functions. This design decision avoids the `iterator_range` imposing limitations upon ranges of iterators that are not singular. Any singularity limitation is simply propagated from the underlying iterator type.
 
 
 [h4 Synopsis]

From f49e3477728054ec36d6bc40caaa8fe0c205f904 Mon Sep 17 00:00:00 2001
From: Nathan Ridge <zeratul976@hotmail.com>
Date: Thu, 13 Dec 2012 07:48:50 +0000
Subject: [PATCH 19/41] [range] added missing includes to any_range.hpp and
 related files; fixes #5603

[SVN r81890]
---
 include/boost/range/detail/any_iterator.hpp           | 2 ++
 include/boost/range/detail/any_iterator_interface.hpp | 6 +++++-
 include/boost/range/detail/any_iterator_wrapper.hpp   | 2 ++
 3 files changed, 9 insertions(+), 1 deletion(-)

diff --git a/include/boost/range/detail/any_iterator.hpp b/include/boost/range/detail/any_iterator.hpp
index 5705ff0..42991cc 100644
--- a/include/boost/range/detail/any_iterator.hpp
+++ b/include/boost/range/detail/any_iterator.hpp
@@ -14,12 +14,14 @@
 #include <boost/mpl/and.hpp>
 #include <boost/mpl/or.hpp>
 #include <boost/mpl/not.hpp>
+#include <boost/iterator/iterator_facade.hpp>
 #include <boost/type_traits/is_const.hpp>
 #include <boost/type_traits/is_reference.hpp>
 #include <boost/type_traits/remove_reference.hpp>
 #include <boost/range/detail/any_iterator_buffer.hpp>
 #include <boost/range/detail/any_iterator_interface.hpp>
 #include <boost/range/detail/any_iterator_wrapper.hpp>
+#include <boost/utility/enable_if.hpp>
 
 namespace boost
 {
diff --git a/include/boost/range/detail/any_iterator_interface.hpp b/include/boost/range/detail/any_iterator_interface.hpp
index d8f4de7..2451491 100644
--- a/include/boost/range/detail/any_iterator_interface.hpp
+++ b/include/boost/range/detail/any_iterator_interface.hpp
@@ -11,8 +11,12 @@
 #define BOOST_RANGE_DETAIL_ANY_ITERATOR_INTERFACE_HPP_INCLUDED
 
 #include <boost/range/detail/any_iterator_buffer.hpp>
-#include <boost/type_traits/add_reference.hpp>
+#include <boost/iterator/iterator_categories.hpp>
 #include <boost/type_traits/add_const.hpp>
+#include <boost/type_traits/add_reference.hpp>
+#include <boost/type_traits/is_reference.hpp>
+#include <boost/type_traits/remove_const.hpp>
+#include <boost/type_traits/remove_reference.hpp>
 
 namespace boost
 {
diff --git a/include/boost/range/detail/any_iterator_wrapper.hpp b/include/boost/range/detail/any_iterator_wrapper.hpp
index b5313a7..502e3e8 100644
--- a/include/boost/range/detail/any_iterator_wrapper.hpp
+++ b/include/boost/range/detail/any_iterator_wrapper.hpp
@@ -10,8 +10,10 @@
 #ifndef BOOST_RANGE_DETAIL_ANY_ITERATOR_WRAPPER_HPP_INCLUDED
 #define BOOST_RANGE_DETAIL_ANY_ITERATOR_WRAPPER_HPP_INCLUDED
 
+#include <boost/cast.hpp>
 #include <boost/range/config.hpp>
 #include <boost/range/detail/any_iterator_interface.hpp>
+#include <boost/range/concepts.hpp>
 
 namespace boost
 {

From b7f443e58300c0035d1726906ee57891a791cea2 Mon Sep 17 00:00:00 2001
From: Nathan Ridge <zeratul976@hotmail.com>
Date: Tue, 18 Dec 2012 09:25:08 +0000
Subject: [PATCH 20/41] [range] corrected undesirable namespace nesting in
 algorithm/search_n.hpp; fixes #6103

[SVN r82071]
---
 include/boost/range/algorithm/search_n.hpp | 4 ++--
 1 file changed, 2 insertions(+), 2 deletions(-)
 mode change 100755 => 100644 include/boost/range/algorithm/search_n.hpp

diff --git a/include/boost/range/algorithm/search_n.hpp b/include/boost/range/algorithm/search_n.hpp
old mode 100755
new mode 100644
index ca2b6ef..ccfb27a
--- a/include/boost/range/algorithm/search_n.hpp
+++ b/include/boost/range/algorithm/search_n.hpp
@@ -20,8 +20,6 @@
 
 namespace boost
 {
-    namespace range
-    {
 
 namespace range_detail
 {
@@ -235,6 +233,8 @@ namespace range_detail
     }
 } // namespace range_detail
 
+namespace range {
+
 /// \brief template function search
 ///
 /// range-based version of the search std algorithm

From 1d51c3afb22b51293c36ab18b8b4bc518d3dee99 Mon Sep 17 00:00:00 2001
From: Nathan Ridge <zeratul976@hotmail.com>
Date: Wed, 2 Jan 2013 05:27:02 +0000
Subject: [PATCH 21/41] [range] fixed #5775 (typo in the documentation of
 pop_heap())

[SVN r82313]
---
 doc/html/index.html                                    | 2 +-
 doc/html/range/reference/algorithms/heap/pop_heap.html | 4 ++--
 doc/reference/algorithm/pop_heap.qbk                   | 2 +-
 3 files changed, 4 insertions(+), 4 deletions(-)

diff --git a/doc/html/index.html b/doc/html/index.html
index e67d025..5584205 100644
--- a/doc/html/index.html
+++ b/doc/html/index.html
@@ -147,7 +147,7 @@
   </p>
 </div>
 <table xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" width="100%"><tr>
-<td align="left"><p><small>Last revised: December 13, 2012 at 06:53:49 GMT</small></p></td>
+<td align="left"><p><small>Last revised: January 02, 2013 at 05:22:10 GMT</small></p></td>
 <td align="right"><div class="copyright-footer"></div></td>
 </tr></table>
 <hr>
diff --git a/doc/html/range/reference/algorithms/heap/pop_heap.html b/doc/html/range/reference/algorithms/heap/pop_heap.html
index 633ba1f..996ba5d 100644
--- a/doc/html/range/reference/algorithms/heap/pop_heap.html
+++ b/doc/html/range/reference/algorithms/heap/pop_heap.html
@@ -52,8 +52,8 @@
           </h6>
 <p>
             <code class="computeroutput"><span class="identifier">pop_heap</span></code> removes the
-            largest element from the heap. It is assumed that <code class="computeroutput"><span class="identifier">begin</span><span class="special">(</span><span class="identifier">rng</span><span class="special">),</span> <span class="identifier">prior</span><span class="special">(</span><span class="identifier">end</span><span class="special">(</span><span class="identifier">rng</span><span class="special">))</span></code> is already a heap and that the element
-            to be added is <code class="computeroutput"><span class="special">*</span><span class="identifier">prior</span><span class="special">(</span><span class="identifier">end</span><span class="special">(</span><span class="identifier">rng</span><span class="special">))</span></code>.
+            largest element from the heap. It is assumed that <code class="computeroutput"><span class="identifier">begin</span><span class="special">(</span><span class="identifier">rng</span><span class="special">),</span> <span class="identifier">prior</span><span class="special">(</span><span class="identifier">end</span><span class="special">(</span><span class="identifier">rng</span><span class="special">))</span></code> is already a heap (and therefore the
+            largest element is <code class="computeroutput"><span class="special">*</span><span class="identifier">begin</span><span class="special">(</span><span class="identifier">rng</span><span class="special">)</span></code>).
           </p>
 <p>
             The ordering relationship is determined by using <code class="computeroutput"><span class="keyword">operator</span><span class="special">&lt;</span></code> in the non-predicate versions, and
diff --git a/doc/reference/algorithm/pop_heap.qbk b/doc/reference/algorithm/pop_heap.qbk
index 6950704..9008de4 100644
--- a/doc/reference/algorithm/pop_heap.qbk
+++ b/doc/reference/algorithm/pop_heap.qbk
@@ -23,7 +23,7 @@ const RandomAccessRange& pop_heap(const RandomAccessRange& rng, Compare pred);
 
 [heading Description]
 
-`pop_heap` removes the largest element from the heap. It is assumed that `begin(rng), prior(end(rng))` is already a heap and that the element to be added is `*prior(end(rng))`.
+`pop_heap` removes the largest element from the heap. It is assumed that `begin(rng), prior(end(rng))` is already a heap (and therefore the largest element is `*begin(rng)`).
 
 The ordering relationship is determined by using `operator<` in the non-predicate versions, and by evaluating `pred` in the predicate versions.
 

From 61979ff421f506da20800c7b3476abb24099abfd Mon Sep 17 00:00:00 2001
From: Nathan Ridge <zeratul976@hotmail.com>
Date: Wed, 2 Jan 2013 07:51:21 +0000
Subject: [PATCH 22/41] [range] fixed #6212 (missing step in documentation for
 how to write a range adaptor)

[SVN r82314]
---
 doc/html/index.html                                       | 2 +-
 .../range/reference/extending/method_3/method_3_1.html    | 8 ++++++++
 doc/reference/extending.qbk                               | 8 ++++++++
 3 files changed, 17 insertions(+), 1 deletion(-)

diff --git a/doc/html/index.html b/doc/html/index.html
index 5584205..a881af7 100644
--- a/doc/html/index.html
+++ b/doc/html/index.html
@@ -147,7 +147,7 @@
   </p>
 </div>
 <table xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" width="100%"><tr>
-<td align="left"><p><small>Last revised: January 02, 2013 at 05:22:10 GMT</small></p></td>
+<td align="left"><p><small>Last revised: January 02, 2013 at 07:48:08 GMT</small></p></td>
 <td align="right"><div class="copyright-footer"></div></td>
 </tr></table>
 <hr>
diff --git a/doc/html/range/reference/extending/method_3/method_3_1.html b/doc/html/range/reference/extending/method_3/method_3_1.html
index 10283cb..6628403 100644
--- a/doc/html/range/reference/extending/method_3/method_3_1.html
+++ b/doc/html/range/reference/extending/method_3/method_3_1.html
@@ -81,6 +81,14 @@
 <span class="special">{</span>
 	<span class="keyword">return</span> <span class="identifier">reverse_range</span><span class="special">&lt;</span><span class="keyword">const</span> <span class="identifier">BidirectionalRng</span><span class="special">&gt;(</span> <span class="identifier">r</span> <span class="special">);</span>
 <span class="special">}</span>
+</pre>
+              </li>
+<li class="listitem">
+                Declare the adaptor itself (it is a variable of the tag type).
+<pre class="programlisting"><span class="keyword">namespace</span>
+<span class="special">{</span>
+    <span class="keyword">const</span> <span class="identifier">detail</span><span class="special">::</span><span class="identifier">reverse_forwarder</span> <span class="identifier">reversed</span> <span class="special">=</span> <span class="identifier">detail</span><span class="special">::</span><span class="identifier">reverse_forwarder</span><span class="special">();</span>
+<span class="special">}</span>
 </pre>
               </li>
 </ol></div>
diff --git a/doc/reference/extending.qbk b/doc/reference/extending.qbk
index 6414e67..61687b1 100644
--- a/doc/reference/extending.qbk
+++ b/doc/reference/extending.qbk
@@ -218,6 +218,14 @@ operator|( const BidirectionalRng& r, detail::reverse_forwarder )
 }
 ``
 
+# Declare the adaptor itself (it is a variable of the tag type).
+``
+namespace
+{
+    const detail::reverse_forwarder reversed = detail::reverse_forwarder();
+}
+``
+
 [endsect]
 
 [section:method_3_2 Method 3.2: Implement a Range Adaptor with arguments]

From 958b4fbf6e1694e5e20d4892840169c695f342c1 Mon Sep 17 00:00:00 2001
From: Nathan Ridge <zeratul976@hotmail.com>
Date: Wed, 2 Jan 2013 08:05:30 +0000
Subject: [PATCH 23/41] [range] small clarification in documentation for how to
 write a range adaptor

[SVN r82315]
---
 doc/html/index.html                                         | 2 +-
 doc/html/range/reference/extending/method_3/method_3_1.html | 6 ++++++
 doc/reference/extending.qbk                                 | 4 ++++
 3 files changed, 11 insertions(+), 1 deletion(-)

diff --git a/doc/html/index.html b/doc/html/index.html
index a881af7..25f8d99 100644
--- a/doc/html/index.html
+++ b/doc/html/index.html
@@ -147,7 +147,7 @@
   </p>
 </div>
 <table xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" width="100%"><tr>
-<td align="left"><p><small>Last revised: January 02, 2013 at 07:48:08 GMT</small></p></td>
+<td align="left"><p><small>Last revised: January 02, 2013 at 08:04:07 GMT</small></p></td>
 <td align="right"><div class="copyright-footer"></div></td>
 </tr></table>
 <hr>
diff --git a/doc/html/range/reference/extending/method_3/method_3_1.html b/doc/html/range/reference/extending/method_3/method_3_1.html
index 6628403..a79e7b3 100644
--- a/doc/html/range/reference/extending/method_3/method_3_1.html
+++ b/doc/html/range/reference/extending/method_3/method_3_1.html
@@ -90,6 +90,12 @@
     <span class="keyword">const</span> <span class="identifier">detail</span><span class="special">::</span><span class="identifier">reverse_forwarder</span> <span class="identifier">reversed</span> <span class="special">=</span> <span class="identifier">detail</span><span class="special">::</span><span class="identifier">reverse_forwarder</span><span class="special">();</span>
 <span class="special">}</span>
 </pre>
+                Note that this last step only applies if the adaptor takes no arguments.
+                If the adaptor takes arguments (such as <code class="computeroutput"><span class="identifier">indexed</span></code>),
+                then there is no need for a variable. Instead, give the tag type
+                a constructor that takes the arguments (and store those arguments
+                in the tag object). A usage of the adaptor will then involve construction
+                of an object of the tag type.
               </li>
 </ol></div>
 </div>
diff --git a/doc/reference/extending.qbk b/doc/reference/extending.qbk
index 61687b1..a4657a2 100644
--- a/doc/reference/extending.qbk
+++ b/doc/reference/extending.qbk
@@ -225,6 +225,10 @@ namespace
     const detail::reverse_forwarder reversed = detail::reverse_forwarder();
 }
 ``
+Note that this last step only applies if the adaptor takes no arguments. If the adaptor takes arguments 
+(such as `indexed`), then there is no need for a variable. Instead, give the tag type a
+constructor that takes the arguments (and store those arguments in the tag object). A usage
+of the adaptor will then involve construction of an object of the tag type.
 
 [endsect]
 

From 3379affd4adfcb66c78d4e54620ebe412bcec73d Mon Sep 17 00:00:00 2001
From: Nathan Ridge <zeratul976@hotmail.com>
Date: Wed, 2 Jan 2013 08:09:46 +0000
Subject: [PATCH 24/41] [range] fixed #7585 (typo in documentation for
 'indexed' adaptor)

[SVN r82316]
---
 doc/html/index.html                                      | 2 +-
 doc/html/range/reference/adaptors/reference/indexed.html | 5 +++--
 doc/reference/adaptors/indexed.qbk                       | 4 ++--
 3 files changed, 6 insertions(+), 5 deletions(-)

diff --git a/doc/html/index.html b/doc/html/index.html
index 25f8d99..4280b73 100644
--- a/doc/html/index.html
+++ b/doc/html/index.html
@@ -147,7 +147,7 @@
   </p>
 </div>
 <table xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" width="100%"><tr>
-<td align="left"><p><small>Last revised: January 02, 2013 at 08:04:07 GMT</small></p></td>
+<td align="left"><p><small>Last revised: January 02, 2013 at 08:07:20 GMT</small></p></td>
 <td align="right"><div class="copyright-footer"></div></td>
 </tr></table>
 <hr>
diff --git a/doc/html/range/reference/adaptors/reference/indexed.html b/doc/html/range/reference/adaptors/reference/indexed.html
index ab6a776..a232c05 100644
--- a/doc/html/range/reference/adaptors/reference/indexed.html
+++ b/doc/html/range/reference/adaptors/reference/indexed.html
@@ -55,7 +55,7 @@
 <td>
                     <p>
                       <code class="computeroutput"><span class="identifier">rng</span> <span class="special">|</span>
-                      <span class="identifier">boost</span><span class="special">::</span><span class="identifier">adaptors</span><span class="special">::</span><span class="identifier">indexed</span></code>
+                      <span class="identifier">boost</span><span class="special">::</span><span class="identifier">adaptors</span><span class="special">::</span><span class="identifier">indexed</span><span class="special">(</span><span class="identifier">start_index</span><span class="special">)</span></code>
                     </p>
                   </td>
 </tr>
@@ -67,7 +67,8 @@
                   </td>
 <td>
                     <p>
-                      <code class="computeroutput"><span class="identifier">boost</span><span class="special">::</span><span class="identifier">adaptors</span><span class="special">::</span><span class="identifier">index</span><span class="special">(</span><span class="identifier">rng</span><span class="special">)</span></code>
+                      <code class="computeroutput"><span class="identifier">boost</span><span class="special">::</span><span class="identifier">adaptors</span><span class="special">::</span><span class="identifier">index</span><span class="special">(</span><span class="identifier">rng</span><span class="special">,</span>
+                      <span class="identifier">start_index</span><span class="special">)</span></code>
                     </p>
                   </td>
 </tr>
diff --git a/doc/reference/adaptors/indexed.qbk b/doc/reference/adaptors/indexed.qbk
index 9778f20..d41e625 100644
--- a/doc/reference/adaptors/indexed.qbk
+++ b/doc/reference/adaptors/indexed.qbk
@@ -7,8 +7,8 @@
 
 [table
     [[Syntax] [Code]]
-    [[Pipe] [`rng | boost::adaptors::indexed`]]
-    [[Function] [`boost::adaptors::index(rng)`]]
+    [[Pipe] [`rng | boost::adaptors::indexed(start_index)`]]
+    [[Function] [`boost::adaptors::index(rng, start_index)`]]
 ]
 
 * [*Returns:] A range adapted to return both the element and the associated index. The returned range consists of iterators that have in addition to the usual iterator member functions an `index()` member function that returns the appropriate index for the element in the sequence corresponding with the iterator.

From 17e4f7024d83cbb2bd564af0edeb177bf45579d0 Mon Sep 17 00:00:00 2001
From: Nathan Ridge <zeratul976@hotmail.com>
Date: Wed, 2 Jan 2013 23:41:58 +0000
Subject: [PATCH 25/41] [range] fixed #5160 (typo in replace_copy_if() example
 on intro page for range adaptors)

[SVN r82325]
---
 doc/html/index.html                                 | 2 +-
 doc/html/range/reference/adaptors/introduction.html | 2 +-
 doc/reference/adaptors.qbk                          | 2 +-
 3 files changed, 3 insertions(+), 3 deletions(-)

diff --git a/doc/html/index.html b/doc/html/index.html
index 4280b73..3415cbe 100644
--- a/doc/html/index.html
+++ b/doc/html/index.html
@@ -147,7 +147,7 @@
   </p>
 </div>
 <table xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" width="100%"><tr>
-<td align="left"><p><small>Last revised: January 02, 2013 at 08:07:20 GMT</small></p></td>
+<td align="left"><p><small>Last revised: January 02, 2013 at 23:39:56 GMT</small></p></td>
 <td align="right"><div class="copyright-footer"></div></td>
 </tr></table>
 <hr>
diff --git a/doc/html/range/reference/adaptors/introduction.html b/doc/html/range/reference/adaptors/introduction.html
index 3253f5c..665f9de 100644
--- a/doc/html/range/reference/adaptors/introduction.html
+++ b/doc/html/range/reference/adaptors/introduction.html
@@ -204,7 +204,7 @@
 <p>
 </p>
 <pre class="programlisting"><span class="identifier">std</span><span class="special">::</span><span class="identifier">vector</span><span class="special">&lt;</span><span class="keyword">int</span><span class="special">&gt;</span> <span class="identifier">vec</span><span class="special">;</span>
-<span class="identifier">boost</span><span class="special">::</span><span class="identifier">replace_copy_if</span><span class="special">(</span> <span class="identifier">rng</span><span class="special">,</span> <span class="identifier">std</span><span class="special">::</span><span class="identifier">back_inserter</span><span class="special">(</span><span class="identifier">vec</span><span class="special">),</span> <span class="identifier">pred</span> <span class="special">);</span>
+<span class="identifier">boost</span><span class="special">::</span><span class="identifier">replace_copy_if</span><span class="special">(</span> <span class="identifier">rng</span><span class="special">,</span> <span class="identifier">std</span><span class="special">::</span><span class="identifier">back_inserter</span><span class="special">(</span><span class="identifier">vec</span><span class="special">),</span> <span class="identifier">pred</span><span class="special">,</span> <span class="identifier">new_value</span> <span class="special">);</span>
 </pre>
 <p>
         </p>
diff --git a/doc/reference/adaptors.qbk b/doc/reference/adaptors.qbk
index 91401c0..96f2ca3 100644
--- a/doc/reference/adaptors.qbk
+++ b/doc/reference/adaptors.qbk
@@ -93,7 +93,7 @@ What this means is that ['*no*] algorithm with the `_if` suffix is needed. Furth
 
 ``
 std::vector<int> vec;
-boost::replace_copy_if( rng, std::back_inserter(vec), pred );
+boost::replace_copy_if( rng, std::back_inserter(vec), pred, new_value );
 ``
 
 With adaptors and algorithms we can express this as

From 36843ccdba25f698a5e6f1d3de74529003d1c902 Mon Sep 17 00:00:00 2001
From: Nathan Ridge <zeratul976@hotmail.com>
Date: Thu, 3 Jan 2013 01:01:55 +0000
Subject: [PATCH 26/41] [range] docs for writing adaptors: removed
 clarification added in r82315 (it was redundant); fixed typos that messed up
 numbering

[SVN r82326]
---
 doc/html/index.html                           |  2 +-
 .../extending/method_3/method_3_1.html        |  6 ----
 .../extending/method_3/method_3_2.html        | 31 +++++--------------
 doc/reference/extending.qbk                   |  8 -----
 4 files changed, 9 insertions(+), 38 deletions(-)

diff --git a/doc/html/index.html b/doc/html/index.html
index 3415cbe..02c06d1 100644
--- a/doc/html/index.html
+++ b/doc/html/index.html
@@ -147,7 +147,7 @@
   </p>
 </div>
 <table xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" width="100%"><tr>
-<td align="left"><p><small>Last revised: January 02, 2013 at 23:39:56 GMT</small></p></td>
+<td align="left"><p><small>Last revised: January 03, 2013 at 00:57:19 GMT</small></p></td>
 <td align="right"><div class="copyright-footer"></div></td>
 </tr></table>
 <hr>
diff --git a/doc/html/range/reference/extending/method_3/method_3_1.html b/doc/html/range/reference/extending/method_3/method_3_1.html
index a79e7b3..6628403 100644
--- a/doc/html/range/reference/extending/method_3/method_3_1.html
+++ b/doc/html/range/reference/extending/method_3/method_3_1.html
@@ -90,12 +90,6 @@
     <span class="keyword">const</span> <span class="identifier">detail</span><span class="special">::</span><span class="identifier">reverse_forwarder</span> <span class="identifier">reversed</span> <span class="special">=</span> <span class="identifier">detail</span><span class="special">::</span><span class="identifier">reverse_forwarder</span><span class="special">();</span>
 <span class="special">}</span>
 </pre>
-                Note that this last step only applies if the adaptor takes no arguments.
-                If the adaptor takes arguments (such as <code class="computeroutput"><span class="identifier">indexed</span></code>),
-                then there is no need for a variable. Instead, give the tag type
-                a constructor that takes the arguments (and store those arguments
-                in the tag object). A usage of the adaptor will then involve construction
-                of an object of the tag type.
               </li>
 </ol></div>
 </div>
diff --git a/doc/html/range/reference/extending/method_3/method_3_2.html b/doc/html/range/reference/extending/method_3/method_3_2.html
index 829179a..e21cd5f 100644
--- a/doc/html/range/reference/extending/method_3/method_3_2.html
+++ b/doc/html/range/reference/extending/method_3/method_3_2.html
@@ -80,15 +80,8 @@
               </li>
 <li class="listitem">
                 Implement a holder class to hold the arguments required to construct
-                the RangeAdaptor.
-              </li>
-</ol></div>
-<p>
-            The holder combines multiple parameters into one that can be passed as
-            the right operand of <code class="computeroutput"><span class="keyword">operator</span><span class="special">|()</span></code>.
-          </p>
-<p>
-</p>
+                the RangeAdaptor. The holder combines multiple parameters into one
+                that can be passed as the right operand of <code class="computeroutput"><span class="keyword">operator</span><span class="special">|()</span></code>.
 <pre class="programlisting"><span class="keyword">template</span><span class="special">&lt;</span><span class="keyword">typename</span> <span class="identifier">T</span><span class="special">&gt;</span>
 <span class="keyword">class</span> <span class="identifier">replace_holder</span> <span class="special">:</span> <span class="keyword">public</span> <span class="identifier">boost</span><span class="special">::</span><span class="identifier">range_detail</span><span class="special">::</span><span class="identifier">holder2</span><span class="special">&lt;</span><span class="identifier">T</span><span class="special">&gt;</span>
 <span class="special">{</span>
@@ -100,23 +93,15 @@
     <span class="keyword">void</span> <span class="keyword">operator</span><span class="special">=(</span><span class="keyword">const</span> <span class="identifier">replace_holder</span><span class="special">&amp;);</span>
 <span class="special">};</span>
 </pre>
-<p>
-          </p>
-<div class="orderedlist"><ol class="orderedlist" type="1"><li class="listitem">
+              </li>
+<li class="listitem">
                 Define an instance of the holder with the name of the adaptor
-              </li></ol></div>
-<p>
-</p>
 <pre class="programlisting"><span class="keyword">static</span> <span class="identifier">boost</span><span class="special">::</span><span class="identifier">range_detail</span><span class="special">::</span><span class="identifier">forwarder2</span><span class="special">&lt;</span><span class="identifier">replace_holder</span><span class="special">&gt;</span>
 <span class="identifier">replaced</span> <span class="special">=</span> <span class="identifier">boost</span><span class="special">::</span><span class="identifier">range_detail</span><span class="special">::</span><span class="identifier">forwarder2</span><span class="special">&lt;</span><span class="identifier">replace_holder</span><span class="special">&gt;();</span>
 </pre>
-<p>
-          </p>
-<div class="orderedlist"><ol class="orderedlist" type="1"><li class="listitem">
+              </li>
+<li class="listitem">
                 Define <code class="computeroutput"><span class="keyword">operator</span><span class="special">|</span></code>
-              </li></ol></div>
-<p>
-</p>
 <pre class="programlisting"><span class="keyword">template</span><span class="special">&lt;</span><span class="keyword">typename</span> <span class="identifier">SinglePassRange</span><span class="special">&gt;</span>
 <span class="keyword">inline</span> <span class="identifier">replace_range</span><span class="special">&lt;</span><span class="identifier">SinglePassRange</span><span class="special">&gt;</span>
 <span class="keyword">operator</span><span class="special">|(</span><span class="identifier">SinglePassRange</span><span class="special">&amp;</span> <span class="identifier">rng</span><span class="special">,</span>
@@ -133,8 +118,8 @@
     <span class="keyword">return</span> <span class="identifier">replace_range</span><span class="special">&lt;</span><span class="keyword">const</span> <span class="identifier">SinglePassRange</span><span class="special">&gt;(</span><span class="identifier">rng</span><span class="special">,</span> <span class="identifier">f</span><span class="special">.</span><span class="identifier">val1</span><span class="special">,</span> <span class="identifier">f</span><span class="special">.</span><span class="identifier">val2</span><span class="special">);</span>
 <span class="special">}</span>
 </pre>
-<p>
-          </p>
+              </li>
+</ol></div>
 </div>
 <table xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" width="100%"><tr>
 <td align="left"></td>
diff --git a/doc/reference/extending.qbk b/doc/reference/extending.qbk
index a4657a2..46652d6 100644
--- a/doc/reference/extending.qbk
+++ b/doc/reference/extending.qbk
@@ -225,10 +225,6 @@ namespace
     const detail::reverse_forwarder reversed = detail::reverse_forwarder();
 }
 ``
-Note that this last step only applies if the adaptor takes no arguments. If the adaptor takes arguments 
-(such as `indexed`), then there is no need for a variable. Instead, give the tag type a
-constructor that takes the arguments (and store those arguments in the tag object). A usage
-of the adaptor will then involve construction of an object of the tag type.
 
 [endsect]
 
@@ -285,9 +281,7 @@ public:
 ``
 
 # Implement a holder class to hold the arguments required to construct the RangeAdaptor.
-
 The holder combines multiple parameters into one that can be passed as the right operand of `operator|()`.
-
 ``
 template<typename T>
 class replace_holder : public boost::range_detail::holder2<T>
@@ -302,14 +296,12 @@ private:
 ``
 
 # Define an instance of the holder with the name of the adaptor
-
 ``
 static boost::range_detail::forwarder2<replace_holder>
 replaced = boost::range_detail::forwarder2<replace_holder>();
 ``
 
 # Define `operator|`
-
 ``
 template<typename SinglePassRange>
 inline replace_range<SinglePassRange>

From 86b169dab316af8203136c2bda05f98dcf0af734 Mon Sep 17 00:00:00 2001
From: Nathan Ridge <zeratul976@hotmail.com>
Date: Thu, 3 Jan 2013 01:06:39 +0000
Subject: [PATCH 27/41] [range] fixed #5440 (typo in documentation for
 'inner_product' algorithm)

[SVN r82327]
---
 doc/html/index.html                                            | 2 +-
 doc/html/range/reference/algorithms/numeric/inner_product.html | 3 ++-
 doc/reference/numeric/inner_product.qbk                        | 3 ++-
 3 files changed, 5 insertions(+), 3 deletions(-)

diff --git a/doc/html/index.html b/doc/html/index.html
index 02c06d1..0bcae2c 100644
--- a/doc/html/index.html
+++ b/doc/html/index.html
@@ -147,7 +147,7 @@
   </p>
 </div>
 <table xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" width="100%"><tr>
-<td align="left"><p><small>Last revised: January 03, 2013 at 00:57:19 GMT</small></p></td>
+<td align="left"><p><small>Last revised: January 03, 2013 at 01:05:23 GMT</small></p></td>
 <td align="right"><div class="copyright-footer"></div></td>
 </tr></table>
 <hr>
diff --git a/doc/html/range/reference/algorithms/numeric/inner_product.html b/doc/html/range/reference/algorithms/numeric/inner_product.html
index 4c2742d..2db9eb5 100644
--- a/doc/html/range/reference/algorithms/numeric/inner_product.html
+++ b/doc/html/range/reference/algorithms/numeric/inner_product.html
@@ -47,7 +47,8 @@
     <span class="identifier">Value</span> <span class="identifier">inner_product</span><span class="special">(</span> <span class="keyword">const</span> <span class="identifier">SinglePassRange1</span><span class="special">&amp;</span> <span class="identifier">rng1</span><span class="special">,</span>
                          <span class="keyword">const</span> <span class="identifier">SinglePassRange2</span><span class="special">&amp;</span> <span class="identifier">rng2</span><span class="special">,</span>
                          <span class="identifier">Value</span>                   <span class="identifier">init</span><span class="special">,</span>
-                         <span class="identifier">BinaryOperation1</span>        <span class="identifier">op1</span> <span class="special">);</span>
+                         <span class="identifier">BinaryOperation1</span>        <span class="identifier">op1</span><span class="special">,</span>
+                         <span class="identifier">BinaryOperation2</span>        <span class="identifier">op2</span> <span class="special">);</span>
 </pre>
 <p>
           </p>
diff --git a/doc/reference/numeric/inner_product.qbk b/doc/reference/numeric/inner_product.qbk
index 1c6fc51..bb4fc3c 100644
--- a/doc/reference/numeric/inner_product.qbk
+++ b/doc/reference/numeric/inner_product.qbk
@@ -23,7 +23,8 @@ template<class SinglePassRange1,
     Value inner_product( const SinglePassRange1& rng1,
                          const SinglePassRange2& rng2,
                          Value                   init,
-                         BinaryOperation1        op1 );
+                         BinaryOperation1        op1,
+                         BinaryOperation2        op2 );
 ``
 
 [heading Description]

From 4a44cc75c9a3a201428702fe9e4c28a5a20b47e2 Mon Sep 17 00:00:00 2001
From: Nathan Ridge <zeratul976@hotmail.com>
Date: Thu, 3 Jan 2013 23:44:30 +0000
Subject: [PATCH 28/41] [range] refactor use of examples in documentation to
 avoid redundancy

[SVN r82344]
---
 doc/html/index.html                           |   2 +-
 .../adaptors/reference/filtered.html          |   2 +
 .../reference/adaptors/reference/indexed.html |  21 ----
 .../adaptors/reference/reversed.html          |   2 +-
 .../reference/adaptors/reference/uniqued.html |   4 +-
 doc/reference/adaptors/adjacent_filtered.qbk  |  26 +----
 doc/reference/adaptors/copied.qbk             |  25 +---
 .../adaptors/examples/adjacent_filtered.cpp   |  32 ------
 doc/reference/adaptors/examples/copied.cpp    |  31 -----
 doc/reference/adaptors/examples/filtered.cpp  |  36 ------
 doc/reference/adaptors/examples/indexed.cpp   |  45 --------
 doc/reference/adaptors/examples/map_keys.cpp  |  33 ------
 .../adaptors/examples/map_values.cpp          |  33 ------
 doc/reference/adaptors/examples/replaced.cpp  |  31 -----
 .../adaptors/examples/replaced_if.cpp         |  35 ------
 doc/reference/adaptors/examples/reversed.cpp  |  31 -----
 doc/reference/adaptors/examples/sliced.cpp    |  31 -----
 doc/reference/adaptors/examples/strided.cpp   |  31 -----
 .../adaptors/examples/transformed.cpp         |  37 ------
 doc/reference/adaptors/examples/uniqued.cpp   |  31 -----
 doc/reference/adaptors/filtered.qbk           |  28 +----
 doc/reference/adaptors/indexed.qbk            |  59 +---------
 doc/reference/adaptors/indirected.qbk         |  26 +----
 doc/reference/adaptors/map_keys.qbk           |  27 +----
 doc/reference/adaptors/map_values.qbk         |  27 +----
 doc/reference/adaptors/replaced.qbk           |  25 +---
 doc/reference/adaptors/replaced_if.qbk        |  30 +----
 doc/reference/adaptors/reversed.qbk           |  25 +---
 doc/reference/adaptors/sliced.qbk             |  25 +---
 doc/reference/adaptors/strided.qbk            |  25 +---
 doc/reference/adaptors/transformed.qbk        |  31 +----
 doc/reference/adaptors/type_erased.qbk        |  90 +--------------
 doc/reference/adaptors/uniqued.qbk            |  23 +---
 test/Jamfile.v2                               |  14 ---
 .../adjacent_filtered_example.cpp             |  41 ++++---
 test/adaptor_test/copied_example.cpp          |  40 ++++---
 test/adaptor_test/filtered_example.cpp        |  49 ++++----
 test/adaptor_test/indexed_example.cpp         | 107 ++++++++++--------
 test/adaptor_test/indirected_example.cpp      |  44 +++----
 test/adaptor_test/map_keys_example.cpp        |  42 ++++---
 test/adaptor_test/map_values_example.cpp      |  42 ++++---
 test/adaptor_test/replaced_example.cpp        |  42 ++++---
 test/adaptor_test/replaced_if_example.cpp     |  51 +++++----
 test/adaptor_test/reversed_example.cpp        |  38 ++++---
 test/adaptor_test/sliced_example.cpp          |  42 ++++---
 test/adaptor_test/strided_example.cpp         |  42 ++++---
 test/adaptor_test/transformed_example.cpp     |  54 +++++----
 test/adaptor_test/type_erased_example.cpp     |  11 +-
 test/adaptor_test/uniqued_example.cpp         |  39 ++++---
 49 files changed, 432 insertions(+), 1226 deletions(-)
 delete mode 100644 doc/reference/adaptors/examples/adjacent_filtered.cpp
 delete mode 100644 doc/reference/adaptors/examples/copied.cpp
 delete mode 100644 doc/reference/adaptors/examples/filtered.cpp
 delete mode 100644 doc/reference/adaptors/examples/indexed.cpp
 delete mode 100644 doc/reference/adaptors/examples/map_keys.cpp
 delete mode 100644 doc/reference/adaptors/examples/map_values.cpp
 delete mode 100644 doc/reference/adaptors/examples/replaced.cpp
 delete mode 100644 doc/reference/adaptors/examples/replaced_if.cpp
 delete mode 100644 doc/reference/adaptors/examples/reversed.cpp
 delete mode 100644 doc/reference/adaptors/examples/sliced.cpp
 delete mode 100644 doc/reference/adaptors/examples/strided.cpp
 delete mode 100644 doc/reference/adaptors/examples/transformed.cpp
 delete mode 100644 doc/reference/adaptors/examples/uniqued.cpp

diff --git a/doc/html/index.html b/doc/html/index.html
index 0bcae2c..b37d1e2 100644
--- a/doc/html/index.html
+++ b/doc/html/index.html
@@ -147,7 +147,7 @@
   </p>
 </div>
 <table xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" width="100%"><tr>
-<td align="left"><p><small>Last revised: January 03, 2013 at 01:05:23 GMT</small></p></td>
+<td align="left"><p><small>Last revised: January 03, 2013 at 23:22:09 GMT</small></p></td>
 <td align="right"><div class="copyright-footer"></div></td>
 </tr></table>
 <hr>
diff --git a/doc/html/range/reference/adaptors/reference/filtered.html b/doc/html/range/reference/adaptors/reference/filtered.html
index 5d45709..1930ef4 100644
--- a/doc/html/range/reference/adaptors/reference/filtered.html
+++ b/doc/html/range/reference/adaptors/reference/filtered.html
@@ -132,6 +132,8 @@
     <span class="identifier">boost</span><span class="special">::</span><span class="identifier">copy</span><span class="special">(</span>
         <span class="identifier">input</span> <span class="special">|</span> <span class="identifier">filtered</span><span class="special">(</span><span class="identifier">is_even</span><span class="special">()),</span>
         <span class="identifier">std</span><span class="special">::</span><span class="identifier">ostream_iterator</span><span class="special">&lt;</span><span class="keyword">int</span><span class="special">&gt;(</span><span class="identifier">std</span><span class="special">::</span><span class="identifier">cout</span><span class="special">,</span> <span class="string">","</span><span class="special">));</span>
+
+    <span class="keyword">return</span> <span class="number">0</span><span class="special">;</span>
 <span class="special">}</span>
 </pre>
 <p>
diff --git a/doc/html/range/reference/adaptors/reference/indexed.html b/doc/html/range/reference/adaptors/reference/indexed.html
index a232c05..1dd722a 100644
--- a/doc/html/range/reference/adaptors/reference/indexed.html
+++ b/doc/html/range/reference/adaptors/reference/indexed.html
@@ -124,27 +124,6 @@
     <span class="identifier">display_element_and_index</span><span class="special">(</span><span class="identifier">boost</span><span class="special">::</span><span class="identifier">begin</span><span class="special">(</span><span class="identifier">rng</span><span class="special">),</span> <span class="identifier">boost</span><span class="special">::</span><span class="identifier">end</span><span class="special">(</span><span class="identifier">rng</span><span class="special">));</span>
 <span class="special">}</span>
 
-<span class="keyword">template</span><span class="special">&lt;</span><span class="keyword">class</span> <span class="identifier">Iterator1</span><span class="special">,</span> <span class="keyword">class</span> <span class="identifier">Iterator2</span><span class="special">&gt;</span>
-<span class="keyword">void</span> <span class="identifier">check_element_and_index</span><span class="special">(</span>
-        <span class="identifier">Iterator1</span> <span class="identifier">test_first</span><span class="special">,</span>
-        <span class="identifier">Iterator1</span> <span class="identifier">test_last</span><span class="special">,</span>
-        <span class="identifier">Iterator2</span> <span class="identifier">reference_first</span><span class="special">,</span>
-        <span class="identifier">Iterator2</span> <span class="identifier">reference_last</span><span class="special">)</span>
-<span class="special">{</span>
-    <span class="identifier">BOOST_CHECK_EQUAL</span><span class="special">(</span> <span class="identifier">std</span><span class="special">::</span><span class="identifier">distance</span><span class="special">(</span><span class="identifier">test_first</span><span class="special">,</span> <span class="identifier">test_last</span><span class="special">),</span>
-                       <span class="identifier">std</span><span class="special">::</span><span class="identifier">distance</span><span class="special">(</span><span class="identifier">reference_first</span><span class="special">,</span> <span class="identifier">reference_last</span><span class="special">)</span> <span class="special">);</span>
-
-    <span class="keyword">int</span> <span class="identifier">reference_index</span> <span class="special">=</span> <span class="number">0</span><span class="special">;</span>
-
-    <span class="identifier">Iterator1</span> <span class="identifier">test_it</span> <span class="special">=</span> <span class="identifier">test_first</span><span class="special">;</span>
-    <span class="identifier">Iterator2</span> <span class="identifier">reference_it</span> <span class="special">=</span> <span class="identifier">reference_first</span><span class="special">;</span>
-    <span class="keyword">for</span> <span class="special">(;</span> <span class="identifier">test_it</span> <span class="special">!=</span> <span class="identifier">test_last</span><span class="special">;</span> <span class="special">++</span><span class="identifier">test_it</span><span class="special">,</span> <span class="special">++</span><span class="identifier">reference_it</span><span class="special">,</span> <span class="special">++</span><span class="identifier">reference_index</span><span class="special">)</span>
-    <span class="special">{</span>
-        <span class="identifier">BOOST_CHECK_EQUAL</span><span class="special">(</span> <span class="special">*</span><span class="identifier">test_it</span><span class="special">,</span> <span class="special">*</span><span class="identifier">reference_it</span> <span class="special">);</span>
-        <span class="identifier">BOOST_CHECK_EQUAL</span><span class="special">(</span> <span class="identifier">test_it</span><span class="special">.</span><span class="identifier">index</span><span class="special">(),</span> <span class="identifier">reference_index</span> <span class="special">);</span>
-    <span class="special">}</span>
-<span class="special">}</span>
-
 <span class="keyword">int</span> <span class="identifier">main</span><span class="special">(</span><span class="keyword">int</span> <span class="identifier">argc</span><span class="special">,</span> <span class="keyword">const</span> <span class="keyword">char</span><span class="special">*</span> <span class="identifier">argv</span><span class="special">[])</span>
 <span class="special">{</span>
     <span class="keyword">using</span> <span class="keyword">namespace</span> <span class="identifier">boost</span><span class="special">::</span><span class="identifier">assign</span><span class="special">;</span>
diff --git a/doc/html/range/reference/adaptors/reference/reversed.html b/doc/html/range/reference/adaptors/reference/reversed.html
index 1db2af4..fa07854 100644
--- a/doc/html/range/reference/adaptors/reference/reversed.html
+++ b/doc/html/range/reference/adaptors/reference/reversed.html
@@ -104,7 +104,7 @@
 <span class="preprocessor">#include</span> <span class="special">&lt;</span><span class="identifier">iostream</span><span class="special">&gt;</span>
 <span class="preprocessor">#include</span> <span class="special">&lt;</span><span class="identifier">vector</span><span class="special">&gt;</span>
 
-<span class="keyword">void</span> <span class="identifier">reversed_example_test</span><span class="special">()</span>
+<span class="keyword">int</span> <span class="identifier">main</span><span class="special">(</span><span class="keyword">int</span> <span class="identifier">argc</span><span class="special">,</span> <span class="keyword">const</span> <span class="keyword">char</span><span class="special">*</span> <span class="identifier">argv</span><span class="special">[])</span>
 <span class="special">{</span>
     <span class="keyword">using</span> <span class="keyword">namespace</span> <span class="identifier">boost</span><span class="special">::</span><span class="identifier">adaptors</span><span class="special">;</span>
     <span class="keyword">using</span> <span class="keyword">namespace</span> <span class="identifier">boost</span><span class="special">::</span><span class="identifier">assign</span><span class="special">;</span>
diff --git a/doc/html/range/reference/adaptors/reference/uniqued.html b/doc/html/range/reference/adaptors/reference/uniqued.html
index 2ef82e0..2f2a430 100644
--- a/doc/html/range/reference/adaptors/reference/uniqued.html
+++ b/doc/html/range/reference/adaptors/reference/uniqued.html
@@ -109,7 +109,7 @@
 <span class="preprocessor">#include</span> <span class="special">&lt;</span><span class="identifier">iostream</span><span class="special">&gt;</span>
 <span class="preprocessor">#include</span> <span class="special">&lt;</span><span class="identifier">vector</span><span class="special">&gt;</span>
 
-<span class="keyword">void</span> <span class="identifier">uniqued_example_test</span><span class="special">()</span>
+<span class="keyword">int</span> <span class="identifier">main</span><span class="special">(</span><span class="keyword">int</span> <span class="identifier">argc</span><span class="special">,</span> <span class="keyword">const</span> <span class="keyword">char</span><span class="special">*</span> <span class="identifier">argv</span><span class="special">[])</span>
 <span class="special">{</span>
     <span class="keyword">using</span> <span class="keyword">namespace</span> <span class="identifier">boost</span><span class="special">::</span><span class="identifier">assign</span><span class="special">;</span>
     <span class="keyword">using</span> <span class="keyword">namespace</span> <span class="identifier">boost</span><span class="special">::</span><span class="identifier">adaptors</span><span class="special">;</span>
@@ -120,6 +120,8 @@
     <span class="identifier">boost</span><span class="special">::</span><span class="identifier">copy</span><span class="special">(</span>
         <span class="identifier">input</span> <span class="special">|</span> <span class="identifier">uniqued</span><span class="special">,</span>
         <span class="identifier">std</span><span class="special">::</span><span class="identifier">ostream_iterator</span><span class="special">&lt;</span><span class="keyword">int</span><span class="special">&gt;(</span><span class="identifier">std</span><span class="special">::</span><span class="identifier">cout</span><span class="special">,</span> <span class="string">","</span><span class="special">));</span>
+
+    <span class="keyword">return</span> <span class="number">0</span><span class="special">;</span>
 <span class="special">}</span>
 </pre>
 <p>
diff --git a/doc/reference/adaptors/adjacent_filtered.qbk b/doc/reference/adaptors/adjacent_filtered.qbk
index a15f992..076b691 100644
--- a/doc/reference/adaptors/adjacent_filtered.qbk
+++ b/doc/reference/adaptors/adjacent_filtered.qbk
@@ -19,30 +19,8 @@
 * [*Returned Range Category:] The minimum of the range category of `rng` and __forward_range__
 
 [section:adjacent_filtered_example adjacent_filtered example]
-``
-#include <boost/range/adaptor/adjacent_filtered.hpp>
-#include <boost/range/algorithm/copy.hpp>
-#include <boost/assign.hpp>
-#include <algorithm>
-#include <functional>
-#include <iostream>
-#include <vector>
-
-int main(int argc, const char* argv[])
-{
-    using namespace boost::assign;
-    using namespace boost::adaptors;
-
-    std::vector<int> input;
-    input += 1,1,2,2,2,3,4,5,6;
-
-    boost::copy(
-        input | adjacent_filtered(std::not_equal_to<int>()),
-        std::ostream_iterator<int>(std::cout, ","));
-
-    return 0;
-}
-``
+[import ../../../test/adaptor_test/adjacent_filtered_example.cpp]
+[adjacent_filtered_example]
 [endsect]
 
 This would produce the output:
diff --git a/doc/reference/adaptors/copied.qbk b/doc/reference/adaptors/copied.qbk
index 69ee46d..e38bf26 100644
--- a/doc/reference/adaptors/copied.qbk
+++ b/doc/reference/adaptors/copied.qbk
@@ -17,29 +17,8 @@
 * [*Returned Range Category:] __random_access_range__
 
 [section:copied_example copied example]
-``
-#include <boost/range/adaptor/copied.hpp>
-#include <boost/range/algorithm/copy.hpp>
-#include <boost/assign.hpp>
-#include <algorithm>
-#include <iostream>
-#include <vector>
-
-int main(int argc, const char* argv[])
-{
-    using namespace boost::assign;
-    using namespace boost::adaptors;
-
-    std::vector<int> input;
-    input += 1,2,3,4,5,6,7,8,9,10;
-
-    boost::copy(
-        input | copied(1, 5),
-        std::ostream_iterator<int>(std::cout, ","));
-
-    return 0;
-}
-``
+[import ../../../test/adaptor_test/copied_example.cpp]
+[copied_example]
 [endsect]
 
 This would produce the output:
diff --git a/doc/reference/adaptors/examples/adjacent_filtered.cpp b/doc/reference/adaptors/examples/adjacent_filtered.cpp
deleted file mode 100644
index cc7cd9b..0000000
--- a/doc/reference/adaptors/examples/adjacent_filtered.cpp
+++ /dev/null
@@ -1,32 +0,0 @@
-// Boost.Range library
-//
-//  Copyright Thorsten Ottosen 2003-2004. Use, modification and
-//  distribution is subject to the Boost Software License, Version
-//  1.0. (See accompanying file LICENSE_1_0.txt or copy at
-//  http://www.boost.org/LICENSE_1_0.txt)
-//
-// For more information, see http://www.boost.org/libs/range/
-//
-#include <boost/range/adaptor/adjacent_filtered.hpp>
-#include <boost/range/algorithm/copy.hpp>
-#include <boost/assign.hpp>
-#include <algorithm>
-#include <functional>
-#include <iostream>
-#include <vector>
-
-int main(int argc, const char* argv[])
-{
-    using namespace boost::assign;
-    using namespace boost::adaptors;
-    
-    std::vector<int> input;
-    input += 1,1,2,2,2,3,4,5,6;
-    
-    boost::copy(
-        input | adjacent_filtered(std::not_equal_to<int>()),
-        std::ostream_iterator<int>(std::cout, ","));
-        
-   return 0;
-}
-
diff --git a/doc/reference/adaptors/examples/copied.cpp b/doc/reference/adaptors/examples/copied.cpp
deleted file mode 100644
index 2de46ab..0000000
--- a/doc/reference/adaptors/examples/copied.cpp
+++ /dev/null
@@ -1,31 +0,0 @@
-// Boost.Range library
-//
-//  Copyright Thorsten Ottosen 2003-2004. Use, modification and
-//  distribution is subject to the Boost Software License, Version
-//  1.0. (See accompanying file LICENSE_1_0.txt or copy at
-//  http://www.boost.org/LICENSE_1_0.txt)
-//
-// For more information, see http://www.boost.org/libs/range/
-//
-#include <boost/range/adaptor/copied.hpp>
-#include <boost/range/algorithm/copy.hpp>
-#include <boost/assign.hpp>
-#include <algorithm>
-#include <iostream>
-#include <vector>
-
-int main(int argc, const char* argv[])
-{
-    using namespace boost::assign;
-    using namespace boost::adaptors;
-    
-    std::vector<int> input;
-    input += 1,2,3,4,5,6,7,8,9,10;
-    
-    boost::copy(
-        input | copied(1, 5),
-        std::ostream_iterator<int>(std::cout, ","));
-        
-    return 0;
-}
-
diff --git a/doc/reference/adaptors/examples/filtered.cpp b/doc/reference/adaptors/examples/filtered.cpp
deleted file mode 100644
index 6471237..0000000
--- a/doc/reference/adaptors/examples/filtered.cpp
+++ /dev/null
@@ -1,36 +0,0 @@
-// Boost.Range library
-//
-//  Copyright Thorsten Ottosen 2003-2004. Use, modification and
-//  distribution is subject to the Boost Software License, Version
-//  1.0. (See accompanying file LICENSE_1_0.txt or copy at
-//  http://www.boost.org/LICENSE_1_0.txt)
-//
-// For more information, see http://www.boost.org/libs/range/
-//
-#include <boost/range/adaptor/filtered.hpp>
-#include <boost/range/algorithm/copy.hpp>
-#include <boost/assign.hpp>
-#include <algorithm>
-#include <iostream>
-#include <vector>
-
-struct is_even
-{
-    bool operator()(int x) const { return x % 2 == 0; }
-};
-
-int main(int argc, const char* argv[])
-{
-    using namespace boost::assign;
-    using namespace boost::adaptors;
-    
-    std::vector<int> input;
-    input += 1,2,3,4,5,6,7,8,9;
-    
-    boost::copy(
-        input | filtered(is_even()),
-        std::ostream_iterator<int>(std::cout, ","));
-        
-    return 0;
-}
-
diff --git a/doc/reference/adaptors/examples/indexed.cpp b/doc/reference/adaptors/examples/indexed.cpp
deleted file mode 100644
index bb141e8..0000000
--- a/doc/reference/adaptors/examples/indexed.cpp
+++ /dev/null
@@ -1,45 +0,0 @@
-// Boost.Range library
-//
-//  Copyright Thorsten Ottosen 2003-2004. Use, modification and
-//  distribution is subject to the Boost Software License, Version
-//  1.0. (See accompanying file LICENSE_1_0.txt or copy at
-//  http://www.boost.org/LICENSE_1_0.txt)
-//
-// For more information, see http://www.boost.org/libs/range/
-//
-#include <boost/range/adaptor/indexed.hpp>
-#include <boost/range/algorithm/copy.hpp>
-#include <boost/assign.hpp>
-#include <algorithm>
-#include <iostream>
-#include <vector>
-
-template<typename Iterator>
-void display_element_and_index(Iterator first, Iterator last)
-{
-    for (Iterator it = first; it != last; ++it)
-    {
-        std::cout << "Element = " << *it
-                  << " Index = " << it.index() << std::endl;
-    }
-}
-
-template<typename SinglePassRange>
-void display_element_and_index(const SinglePassRange& rng)
-{
-    display_element_and_index(boost::begin(rng), boost::end(rng));
-}
-
-int main(int argc, const char* argv[])
-{
-    using namespace boost::assign;
-    using namespace boost::adaptors;
-    
-    std::vector<int> input;
-    input += 10,20,30,40,50,60,70,80,90;
-    
-    display_element_and_index( input | indexed(0) );
-    
-    return 0;
-}
-
diff --git a/doc/reference/adaptors/examples/map_keys.cpp b/doc/reference/adaptors/examples/map_keys.cpp
deleted file mode 100644
index 006e7e9..0000000
--- a/doc/reference/adaptors/examples/map_keys.cpp
+++ /dev/null
@@ -1,33 +0,0 @@
-// Boost.Range library
-//
-//  Copyright Thorsten Ottosen 2003-2004. Use, modification and
-//  distribution is subject to the Boost Software License, Version
-//  1.0. (See accompanying file LICENSE_1_0.txt or copy at
-//  http://www.boost.org/LICENSE_1_0.txt)
-//
-// For more information, see http://www.boost.org/libs/range/
-//
-#include <boost/range/adaptor/map.hpp>
-#include <boost/range/algorithm/copy.hpp>
-#include <boost/assign.hpp>
-#include <algorithm>
-#include <iostream>
-#include <map>
-#include <vector>
-
-int main(int argc, const char* argv[])
-{
-    using namespace boost::assign;
-    using namespace boost::adaptors;
-    
-    std::map<int, int> input;
-    for (int i = 0; i < 10; ++i)
-        input.insert(std::make_pair(i, i * 10));
-        
-    boost::copy(
-        input | map_keys,
-        std::ostream_iterator<int>(std::cout, ","));
-        
-    return 0;
-}
-
diff --git a/doc/reference/adaptors/examples/map_values.cpp b/doc/reference/adaptors/examples/map_values.cpp
deleted file mode 100644
index a0fa651..0000000
--- a/doc/reference/adaptors/examples/map_values.cpp
+++ /dev/null
@@ -1,33 +0,0 @@
-// Boost.Range library
-//
-//  Copyright Thorsten Ottosen 2003-2004. Use, modification and
-//  distribution is subject to the Boost Software License, Version
-//  1.0. (See accompanying file LICENSE_1_0.txt or copy at
-//  http://www.boost.org/LICENSE_1_0.txt)
-//
-// For more information, see http://www.boost.org/libs/range/
-//
-#include <boost/range/adaptor/map.hpp>
-#include <boost/range/algorithm/copy.hpp>
-#include <boost/assign.hpp>
-#include <algorithm>
-#include <iostream>
-#include <map>
-#include <vector>
-
-int main(int argc, const char* argv[])
-{
-    using namespace boost::assign;
-    using namespace boost::adaptors;
-    
-    std::map<int, int> input;
-    for (int i = 0; i < 10; ++i)
-        input.insert(std::make_pair(i, i * 10));
-        
-    boost::copy(
-        input | map_values,
-        std::ostream_iterator<int>(std::cout, ","));
-        
-    return 0;
-}
-
diff --git a/doc/reference/adaptors/examples/replaced.cpp b/doc/reference/adaptors/examples/replaced.cpp
deleted file mode 100644
index 7b85ba1..0000000
--- a/doc/reference/adaptors/examples/replaced.cpp
+++ /dev/null
@@ -1,31 +0,0 @@
-// Boost.Range library
-//
-//  Copyright Thorsten Ottosen 2003-2004. Use, modification and
-//  distribution is subject to the Boost Software License, Version
-//  1.0. (See accompanying file LICENSE_1_0.txt or copy at
-//  http://www.boost.org/LICENSE_1_0.txt)
-//
-// For more information, see http://www.boost.org/libs/range/
-//
-#include <boost/range/adaptor/replaced.hpp>
-#include <boost/range/algorithm/copy.hpp>
-#include <boost/assign.hpp>
-#include <algorithm>
-#include <iostream>
-#include <vector>
-
-int main(int argc, const char* argv[])
-{
-    using namespace boost::adaptors;
-    using namespace boost::assign;
-    
-    std::vector<int> input;
-    input += 1,2,3,2,5,2,7,2,9;
-    
-    boost::copy(
-        input | replaced(2, 10),
-        std::ostream_iterator<int>(std::cout, ","));
-        
-    return 0;
-}
-
diff --git a/doc/reference/adaptors/examples/replaced_if.cpp b/doc/reference/adaptors/examples/replaced_if.cpp
deleted file mode 100644
index 23952f7..0000000
--- a/doc/reference/adaptors/examples/replaced_if.cpp
+++ /dev/null
@@ -1,35 +0,0 @@
-// Boost.Range library
-//
-//  Copyright Thorsten Ottosen 2003-2004. Use, modification and
-//  distribution is subject to the Boost Software License, Version
-//  1.0. (See accompanying file LICENSE_1_0.txt or copy at
-//  http://www.boost.org/LICENSE_1_0.txt)
-//
-// For more information, see http://www.boost.org/libs/range/
-//
-#include <boost/range/adaptor/replaced_if.hpp>
-#include <boost/range/algorithm/copy.hpp>
-#include <boost/assign.hpp>
-#include <algorithm>
-#include <iostream>
-#include <vector>
-
-struct is_even
-{
-    bool operator()(int x) const { return x % 2 == 0; }
-};
-
-int main(int argc, const char* argv[])
-{
-    using namespace boost::adaptors;
-    using namespace boost::assign;
-    
-    std::vector<int> input;
-    input += 1,2,3,4,5,6,7,8,9;
-    
-    boost::copy(
-        input | replaced_if(is_even(), 10),
-        std::ostream_iterator<int>(std::cout, ","));
-        
-    return 0;
-}
diff --git a/doc/reference/adaptors/examples/reversed.cpp b/doc/reference/adaptors/examples/reversed.cpp
deleted file mode 100644
index 85696cb..0000000
--- a/doc/reference/adaptors/examples/reversed.cpp
+++ /dev/null
@@ -1,31 +0,0 @@
-// Boost.Range library
-//
-//  Copyright Thorsten Ottosen 2003-2004. Use, modification and
-//  distribution is subject to the Boost Software License, Version
-//  1.0. (See accompanying file LICENSE_1_0.txt or copy at
-//  http://www.boost.org/LICENSE_1_0.txt)
-//
-// For more information, see http://www.boost.org/libs/range/
-//
-#include <boost/range/adaptor/reversed.hpp>
-#include <boost/range/algorithm/copy.hpp>
-#include <boost/assign.hpp>
-#include <algorithm>
-#include <iostream>
-#include <vector>
-
-int main(int argc, const char* argv[])
-{
-    using namespace boost::adaptors;
-    using namespace boost::assign;
-    
-    std::vector<int> input;
-    input += 1,2,3,4,5,6,7,8,9;
-    
-    boost::copy(
-        input | reversed,
-        std::ostream_iterator<int>(std::cout, ","));
-        
-    return 0;
-}
-
diff --git a/doc/reference/adaptors/examples/sliced.cpp b/doc/reference/adaptors/examples/sliced.cpp
deleted file mode 100644
index cc8b9cb..0000000
--- a/doc/reference/adaptors/examples/sliced.cpp
+++ /dev/null
@@ -1,31 +0,0 @@
-// Boost.Range library
-//
-//  Copyright Thorsten Ottosen 2003-2004. Use, modification and
-//  distribution is subject to the Boost Software License, Version
-//  1.0. (See accompanying file LICENSE_1_0.txt or copy at
-//  http://www.boost.org/LICENSE_1_0.txt)
-//
-// For more information, see http://www.boost.org/libs/range/
-//
-#include <boost/range/adaptor/sliced.hpp>
-#include <boost/range/algorithm/copy.hpp>
-#include <boost/assign.hpp>
-#include <algorithm>
-#include <iostream>
-#include <vector>
-
-int main(int argc, const char* argv[])
-{
-    using namespace boost::adaptors;
-    using namespace boost::assign;
-    
-    std::vector<int> input;
-    input += 1,2,3,4,5,6,7,8,9;
-    
-    boost::copy(
-        input | sliced(2, 5),
-        std::ostream_iterator<int>(std::cout, ","));
-        
-    return 0;
-}
-
diff --git a/doc/reference/adaptors/examples/strided.cpp b/doc/reference/adaptors/examples/strided.cpp
deleted file mode 100644
index f12b72a..0000000
--- a/doc/reference/adaptors/examples/strided.cpp
+++ /dev/null
@@ -1,31 +0,0 @@
-// Boost.Range library
-//
-//  Copyright Thorsten Ottosen 2003-2004. Use, modification and
-//  distribution is subject to the Boost Software License, Version
-//  1.0. (See accompanying file LICENSE_1_0.txt or copy at
-//  http://www.boost.org/LICENSE_1_0.txt)
-//
-// For more information, see http://www.boost.org/libs/range/
-//
-#include <boost/range/adaptor/strided.hpp>
-#include <boost/range/algorithm/copy.hpp>
-#include <boost/assign.hpp>
-#include <algorithm>
-#include <iostream>
-#include <vector>
-
-int main(int argc, const char* argv[])
-{
-    using namespace boost::adaptors;
-    using namespace boost::assign;
-    
-    std::vector<int> input;
-    input += 1,2,3,4,5,6,7,8,9,10;
-    
-    boost::copy(
-        input | strided(2),
-        std::ostream_iterator<int>(std::cout, ","));
-        
-    return 0;
-}
-
diff --git a/doc/reference/adaptors/examples/transformed.cpp b/doc/reference/adaptors/examples/transformed.cpp
deleted file mode 100644
index 62bf5d4..0000000
--- a/doc/reference/adaptors/examples/transformed.cpp
+++ /dev/null
@@ -1,37 +0,0 @@
-// Boost.Range library
-//
-//  Copyright Thorsten Ottosen 2003-2004. Use, modification and
-//  distribution is subject to the Boost Software License, Version
-//  1.0. (See accompanying file LICENSE_1_0.txt or copy at
-//  http://www.boost.org/LICENSE_1_0.txt)
-//
-// For more information, see http://www.boost.org/libs/range/
-//
-#include <boost/range/adaptor/transformed.hpp>
-#include <boost/range/algorithm/copy.hpp>
-#include <boost/assign.hpp>
-#include <algorithm>
-#include <iostream>
-#include <vector>
-
-struct double_int
-{
-    typedef int result_type;
-    int operator()(int x) const { return x * 2; }
-};
-
-int main(int argc, const char* argv[])
-{
-    using namespace boost::adaptors;
-    using namespace boost::assign;
-    
-    std::vector<int> input;
-    input += 1,2,3,4,5,6,7,8,9,10;
-    
-    boost::copy(
-        input | transformed(double_int()),
-        std::ostream_iterator<int>(std::cout, ","));
-        
-    return 0;
-}
-
diff --git a/doc/reference/adaptors/examples/uniqued.cpp b/doc/reference/adaptors/examples/uniqued.cpp
deleted file mode 100644
index a7b2f8e..0000000
--- a/doc/reference/adaptors/examples/uniqued.cpp
+++ /dev/null
@@ -1,31 +0,0 @@
-// Boost.Range library
-//
-//  Copyright Thorsten Ottosen 2003-2004. Use, modification and
-//  distribution is subject to the Boost Software License, Version
-//  1.0. (See accompanying file LICENSE_1_0.txt or copy at
-//  http://www.boost.org/LICENSE_1_0.txt)
-//
-// For more information, see http://www.boost.org/libs/range/
-//
-#include <boost/range/adaptor/uniqued.hpp>
-#include <boost/range/algorithm/copy.hpp>
-#include <boost/assign.hpp>
-#include <algorithm>
-#include <iostream>
-#include <vector>
-
-int main(int argc, const char* argv[])
-{
-    using namespace boost::assign;
-    using namespace boost::adaptors;
-    
-    std::vector<int> input;
-    input += 1,1,2,2,2,3,4,5,6;
-    
-    boost::copy(
-        input | uniqued,
-        std::ostream_iterator<int>(std::cout, ","));
-        
-    return 0;
-}
-
diff --git a/doc/reference/adaptors/filtered.qbk b/doc/reference/adaptors/filtered.qbk
index 1b14524..a6c7924 100644
--- a/doc/reference/adaptors/filtered.qbk
+++ b/doc/reference/adaptors/filtered.qbk
@@ -19,32 +19,8 @@
 * [*Returned Range Category:] The minimum of the range category of `rng` and __bidirectional_range__
 
 [section:filtered_example filtered example]
-``
-#include <boost/range/adaptor/filtered.hpp>
-#include <boost/range/algorithm/copy.hpp>
-#include <boost/assign.hpp>
-#include <algorithm>
-#include <iostream>
-#include <vector>
-
-struct is_even
-{
-    bool operator()( int x ) const { return x % 2 == 0; }
-};
-
-int main(int argc, const char* argv[])
-{
-    using namespace boost::assign;
-    using namespace boost::adaptors;
-
-    std::vector<int> input;
-    input += 1,2,3,4,5,6,7,8,9;
-
-    boost::copy(
-        input | filtered(is_even()),
-        std::ostream_iterator<int>(std::cout, ","));
-}
-``
+[import ../../../test/adaptor_test/filtered_example.cpp]
+[filtered_example]
 [endsect]
 
 This would produce the output:
diff --git a/doc/reference/adaptors/indexed.qbk b/doc/reference/adaptors/indexed.qbk
index d41e625..117e1e3 100644
--- a/doc/reference/adaptors/indexed.qbk
+++ b/doc/reference/adaptors/indexed.qbk
@@ -17,63 +17,8 @@
 * [*Returned Range Category:] The range category of `rng`
 
 [section:indexed_example indexed example]
-``
-#include <boost/range/adaptor/indexed.hpp>
-#include <boost/range/algorithm/copy.hpp>
-#include <boost/assign.hpp>
-#include <algorithm>
-#include <iostream>
-#include <vector>
-
-template<class Iterator>
-void display_element_and_index(Iterator first, Iterator last)
-{
-    for (Iterator it = first; it != last; ++it)
-    {
-        std::cout << "Element = " << *it << " Index = " << it.index() << std::endl;
-    }
-}
-
-template<class SinglePassRange>
-void display_element_and_index(const SinglePassRange& rng)
-{
-    display_element_and_index(boost::begin(rng), boost::end(rng));
-}
-
-template<class Iterator1, class Iterator2>
-void check_element_and_index(
-        Iterator1 test_first,
-        Iterator1 test_last,
-        Iterator2 reference_first,
-        Iterator2 reference_last)
-{
-    BOOST_CHECK_EQUAL( std::distance(test_first, test_last),
-                       std::distance(reference_first, reference_last) );
-
-    int reference_index = 0;
-
-    Iterator1 test_it = test_first;
-    Iterator2 reference_it = reference_first;
-    for (; test_it != test_last; ++test_it, ++reference_it, ++reference_index)
-    {
-        BOOST_CHECK_EQUAL( *test_it, *reference_it );
-        BOOST_CHECK_EQUAL( test_it.index(), reference_index );
-    }
-}
-
-int main(int argc, const char* argv[])
-{
-    using namespace boost::assign;
-    using namespace boost::adaptors;
-
-    std::vector<int> input;
-    input += 10,20,30,40,50,60,70,80,90;
-
-    display_element_and_index( input | indexed(0) );
-
-    return 0;
-}
-``
+[import ../../../test/adaptor_test/indexed_example.cpp]
+[indexed_example]
 [endsect]
 
 This would produce the output:
diff --git a/doc/reference/adaptors/indirected.qbk b/doc/reference/adaptors/indirected.qbk
index 5a1ed05..c44c70d 100644
--- a/doc/reference/adaptors/indirected.qbk
+++ b/doc/reference/adaptors/indirected.qbk
@@ -18,30 +18,8 @@
 * [*Returned Range Category:] The range category of `rng`
 
 [section:indirected_example indirected example]
-``
-#include <boost/range/adaptor/indirected.hpp>
-#include <boost/range/algorithm/copy.hpp>
-#include <boost/shared_ptr.hpp>
-#include <algorithm>
-#include <iostream>
-#include <vector>
-
-int main(int argc, const char* argv[])
-{
-    using namespace boost::adaptors;
-
-    std::vector<boost::shared_ptr<int> > input;
-
-    for (int i = 0; i < 10; ++i)
-        input.push_back(boost::shared_ptr<int>(new int(i)));
-
-    boost::copy(
-        input | indirected,
-        std::ostream_iterator<int>(std::cout, ","));
-
-    return 0;
-}
-``
+[import ../../../test/adaptor_test/indirected_example.cpp]
+[indirected_example]
 [endsect]
 
 This would produce the output:
diff --git a/doc/reference/adaptors/map_keys.qbk b/doc/reference/adaptors/map_keys.qbk
index 01b9d34..8ead02b 100644
--- a/doc/reference/adaptors/map_keys.qbk
+++ b/doc/reference/adaptors/map_keys.qbk
@@ -18,31 +18,8 @@
 * [*Returned Range Category:] The range category of `rng`.
 
 [section:map_keys_example map_keys example]
-``
-#include <boost/range/adaptor/map.hpp>
-#include <boost/range/algorithm/copy.hpp>
-#include <boost/assign.hpp>
-#include <algorithm>
-#include <iostream>
-#include <map>
-#include <vector>
-
-int main(int argc, const char* argv[])
-{
-    using namespace boost::assign;
-    using namespace boost::adaptors;
-
-    std::map<int,int> input;
-    for (int i = 0; i < 10; ++i)
-        input.insert(std::make_pair(i, i * 10));
-
-    boost::copy(
-        input | map_keys,
-        std::ostream_iterator<int>(std::cout, ","));
-
-    return 0;
-}
-``
+[import ../../../test/adaptor_test/map_keys_example.cpp]
+[map_keys_example]
 [endsect]
 
 This would produce the output:
diff --git a/doc/reference/adaptors/map_values.qbk b/doc/reference/adaptors/map_values.qbk
index 17ad9c4..658e4ff 100644
--- a/doc/reference/adaptors/map_values.qbk
+++ b/doc/reference/adaptors/map_values.qbk
@@ -18,31 +18,8 @@
 * [*Returned Range Category:] The range category of `rng`.
 
 [section:map_values_example map_values example]
-``
-#include <boost/range/adaptor/map.hpp>
-#include <boost/range/algorithm/copy.hpp>
-#include <boost/assign.hpp>
-#include <algorithm>
-#include <iostream>
-#include <map>
-#include <vector>
-
-int main(int argc, const char* argv[])
-{
-    using namespace boost::assign;
-    using namespace boost::adaptors;
-
-    std::map<int,int> input;
-    for (int i = 0; i < 10; ++i)
-        input.insert(std::make_pair(i, i * 10));
-
-    boost::copy(
-        input | map_values,
-        std::ostream_iterator<int>(std::cout, ","));
-
-    return 0;
-}
-``
+[import ../../../test/adaptor_test/map_values_example.cpp]
+[map_values_example]
 [endsect]
 
 This would produce the output:
diff --git a/doc/reference/adaptors/replaced.qbk b/doc/reference/adaptors/replaced.qbk
index 3df708c..00285eb 100644
--- a/doc/reference/adaptors/replaced.qbk
+++ b/doc/reference/adaptors/replaced.qbk
@@ -20,29 +20,8 @@
 * [*Returned Range Category:] The range category of `rng`.
 
 [section:replaced_example replaced example]
-``
-#include <boost/range/adaptor/replaced.hpp>
-#include <boost/range/algorithm/copy.hpp>
-#include <boost/assign.hpp>
-#include <algorithm>
-#include <iostream>
-#include <vector>
-
-int main(int argc, const char* argv[])
-{
-    using namespace boost::adaptors;
-    using namespace boost::assign;
-
-    std::vector<int> input;
-    input += 1,2,3,2,5,2,7,2,9;
-
-    boost::copy(
-        input | replaced(2, 10),
-        std::ostream_iterator<int>(std::cout, ","));
-
-    return 0;
-}
-``
+[import ../../../test/adaptor_test/replaced_example.cpp]
+[replaced_example]
 [endsect]
 
 This would produce the output:
diff --git a/doc/reference/adaptors/replaced_if.qbk b/doc/reference/adaptors/replaced_if.qbk
index b160b34..81a92e6 100644
--- a/doc/reference/adaptors/replaced_if.qbk
+++ b/doc/reference/adaptors/replaced_if.qbk
@@ -20,34 +20,8 @@
 * [*Returned Range Category:] The range category of `rng`.
 
 [section:replaced_if_example replaced_if example]
-``
-#include <boost/range/adaptor/replaced_if.hpp>
-#include <boost/range/algorithm/copy.hpp>
-#include <boost/assign.hpp>
-#include <algorithm>
-#include <iostream>
-#include <vector>
-
-struct is_even
-{
-    bool operator()(int x) const { return x % 2 == 0; }
-};
-
-int main(int argc, const char* argv[])
-{
-    using namespace boost::adaptors;
-    using namespace boost::assign;
-
-    std::vector<int> input;
-    input += 1,2,3,4,5,6,7,8,9;
-
-    boost::copy(
-        input | replaced_if(is_even(), 10),
-        std::ostream_iterator<int>(std::cout, ","));
-
-    return 0;
-}
-``
+[import ../../../test/adaptor_test/replaced_if_example.cpp]
+[replaced_if_example]
 [endsect]
 
 This would produce the output:
diff --git a/doc/reference/adaptors/reversed.qbk b/doc/reference/adaptors/reversed.qbk
index 7116475..392fd7a 100644
--- a/doc/reference/adaptors/reversed.qbk
+++ b/doc/reference/adaptors/reversed.qbk
@@ -17,29 +17,8 @@
 * [*Returned Range Category:] The range category of `rng`.
 
 [section:reversed_example reversed example]
-``
-#include <boost/range/adaptor/reversed.hpp>
-#include <boost/range/algorithm/copy.hpp>
-#include <boost/assign.hpp>
-#include <algorithm>
-#include <iostream>
-#include <vector>
-
-void reversed_example_test()
-{
-    using namespace boost::adaptors;
-    using namespace boost::assign;
-
-    std::vector<int> input;
-    input += 1,2,3,4,5,6,7,8,9;
-
-    boost::copy(
-        input | reversed,
-        std::ostream_iterator<int>(std::cout, ","));
-
-    return 0;
-}
-``
+[import ../../../test/adaptor_test/reversed_example.cpp]
+[reversed_example]
 [endsect]
 
 This would produce the output:
diff --git a/doc/reference/adaptors/sliced.qbk b/doc/reference/adaptors/sliced.qbk
index 33b57ca..39f3387 100644
--- a/doc/reference/adaptors/sliced.qbk
+++ b/doc/reference/adaptors/sliced.qbk
@@ -18,29 +18,8 @@
 * [*Returned Range Category:] __random_access_range__
 
 [section:sliced_example sliced example]
-``
-#include <boost/range/adaptor/sliced.hpp>
-#include <boost/range/algorithm/copy.hpp>
-#include <boost/assign.hpp>
-#include <algorithm>
-#include <iostream>
-#include <vector>
-
-int main(int argc, const char* argv[])
-{
-    using namespace boost::adaptors;
-    using namespace boost::assign;
-
-    std::vector<int> input;
-    input += 1,2,3,4,5,6,7,8,9;
-
-    boost::copy(
-        input | sliced(2, 5),
-        std::ostream_iterator<int>(std::cout, ","));
-
-    return 0;
-}
-``
+[import ../../../test/adaptor_test/sliced_example.cpp]
+[sliced_example]
 [endsect]
 
 This would produce the output:
diff --git a/doc/reference/adaptors/strided.qbk b/doc/reference/adaptors/strided.qbk
index e219a83..a94822c 100644
--- a/doc/reference/adaptors/strided.qbk
+++ b/doc/reference/adaptors/strided.qbk
@@ -17,29 +17,8 @@
 * [*Returned Range Category:] The range category of `rng`.
 
 [section:strided_example strided example]
-``
-#include <boost/range/adaptor/strided.hpp>
-#include <boost/range/algorithm/copy.hpp>
-#include <boost/assign.hpp>
-#include <algorithm>
-#include <iostream>
-#include <vector>
-
-int main(int argc, const char* argv[])
-{
-    using namespace boost::adaptors;
-    using namespace boost::assign;
-
-    std::vector<int> input;
-    input += 1,2,3,4,5,6,7,8,9,10;
-
-    boost::copy(
-        input | strided(2),
-        std::ostream_iterator<int>(std::cout, ","));
-
-    return 0;
-}
-``
+[import ../../../test/adaptor_test/strided_example.cpp]
+[strided_example]
 [endsect]
 
 This would produce the output:
diff --git a/doc/reference/adaptors/transformed.qbk b/doc/reference/adaptors/transformed.qbk
index ec19583..5bb9828 100644
--- a/doc/reference/adaptors/transformed.qbk
+++ b/doc/reference/adaptors/transformed.qbk
@@ -19,35 +19,8 @@
 * [*Returned Range Category:] The range category of `rng`.
 
 [section:transformed_example transformed example]
-``
-#include <boost/range/adaptor/transformed.hpp>
-#include <boost/range/algorithm/copy.hpp>
-#include <boost/assign.hpp>
-#include <algorithm>
-#include <iostream>
-#include <vector>
-
-struct double_int
-{
-    typedef int result_type;
-    int operator()(int x) const { return x * 2; }
-};
-
-int main(int argc, const char* argv[])
-{
-    using namespace boost::adaptors;
-    using namespace boost::assign;
-
-    std::vector<int> input;
-    input += 1,2,3,4,5,6,7,8,9,10;
-
-    boost::copy(
-        input | transformed(double_int()),
-        std::ostream_iterator<int>(std::cout, ","));
-
-    return 0;
-}
-``
+[import ../../../test/adaptor_test/transformed_example.cpp]
+[transformed_example]
 [endsect]
 
 This would produce the output:
diff --git a/doc/reference/adaptors/type_erased.qbk b/doc/reference/adaptors/type_erased.qbk
index 9fb72a5..be547d3 100644
--- a/doc/reference/adaptors/type_erased.qbk
+++ b/doc/reference/adaptors/type_erased.qbk
@@ -49,94 +49,8 @@ public:
 ``
 
 [section:type_erased_example type-erased example]
-``
-#include <boost/range/adaptor/type_erased.hpp>
-#include <boost/range/algorithm/copy.hpp>
-#include <boost/assign.hpp>
-#include <boost/foreach.hpp>
-#include <algorithm>
-#include <iostream>
-#include <list>
-#include <vector>
-
-// The client interface from an OO perspective merely requires a sequence
-// of integers that can be forward traversed
-typedef boost::any_range<
-    int
-  , boost::forward_traversal_tag
-  , int
-  , std::ptrdiff_t
-> integer_range;
-
-namespace server
-{
-    void display_integers(const integer_range& rng)
-    {
-        boost::copy(rng,
-                    std::ostream_iterator<int>(std::cout, ","));
-
-        std::cout << std::endl;
-    }
-}
-
-namespace client
-{
-    void run()
-    {
-        using namespace boost::assign;
-        using namespace boost::adaptors;
-
-        // Under most conditions one would simply use an appropriate
-        // any_range as a function parameter. The type_erased adaptor
-        // is often superfluous. However because the type_erased
-        // adaptor is applied to a range, we can use default template
-        // arguments that are generated in conjunction with the
-        // range type to which we are applying the adaptor.
-
-        std::vector<int> input;
-        input += 1,2,3,4,5;
-
-        // Note that this call is to a non-template function
-        server::display_integers(input);
-
-        std::list<int> input2;
-        input2 += 6,7,8,9,10;
-
-        // Note that this call is to the same non-tempate function
-        server::display_integers(input2);
-
-        input2.clear();
-        input2 += 11,12,13,14,15;
-
-        // Calling using the adaptor looks like this:
-        // Notice that here I have a type_erased that would be a
-        // bidirectional_traversal_tag, but this is convertible
-        // to the forward_traversal_tag equivalent hence this
-        // works.
-        server::display_integers(input2 | type_erased<>());
-
-        // However we may simply wish to define an adaptor that
-        // takes a range and makes it into an appropriate
-        // forward_traversal any_range...
-        typedef boost::adaptors::type_erased<
-            boost::use_default
-          , boost::forward_traversal_tag
-        > type_erased_forward;
-
-        // This adaptor can turn other containers with different
-        // value_types and reference_types into the appropriate
-        // any_range.
-
-        server::display_integers(input2 | type_erased_forward());
-    }
-}
-
-int main(int argc, const char* argv[])
-{
-    client::run();
-    return 0;
-}
-``
+[import ../../../test/adaptor_test/type_erased_example.cpp]
+[type_erased_example]
 [endsect]
 
 This would produce the output:
diff --git a/doc/reference/adaptors/uniqued.qbk b/doc/reference/adaptors/uniqued.qbk
index a74d1a8..7df92f4 100644
--- a/doc/reference/adaptors/uniqued.qbk
+++ b/doc/reference/adaptors/uniqued.qbk
@@ -18,27 +18,8 @@
 * [*Returned Range Category:] The minimum of the range concept of `rng` and __forward_range__.
 
 [section:uniqued_example uniqued example]
-``
-#include <boost/range/adaptor/uniqued.hpp>
-#include <boost/range/algorithm/copy.hpp>
-#include <boost/assign.hpp>
-#include <algorithm>
-#include <iostream>
-#include <vector>
-
-void uniqued_example_test()
-{
-    using namespace boost::assign;
-    using namespace boost::adaptors;
-
-    std::vector<int> input;
-    input += 1,1,2,2,2,3,4,5,6;
-
-    boost::copy(
-        input | uniqued,
-        std::ostream_iterator<int>(std::cout, ","));
-}
-``
+[import ../../../test/adaptor_test/uniqued_example.cpp]
+[uniqued_example]
 [endsect]
 
 This would produce the output:
diff --git a/test/Jamfile.v2 b/test/Jamfile.v2
index afab584..4eb4506 100644
--- a/test/Jamfile.v2
+++ b/test/Jamfile.v2
@@ -31,21 +31,7 @@ rule range-test ( name : includes * )
 }
 
 test-suite range :
-    [ compile ../doc/reference/adaptors/examples/adjacent_filtered.cpp : : example_adjacent_filtered ]
-    [ compile ../doc/reference/adaptors/examples/copied.cpp : : example_copied ]
-    [ compile ../doc/reference/adaptors/examples/filtered.cpp : : example_filtered ]
-    [ compile ../doc/reference/adaptors/examples/indexed.cpp : : example_indexed ]
-    [ compile ../doc/reference/adaptors/examples/indirected.cpp : : example_indirected ]
-    [ compile ../doc/reference/adaptors/examples/map_keys.cpp : : example_map_keys ]
-    [ compile ../doc/reference/adaptors/examples/map_values.cpp : : example_map_values ]
-    [ compile ../doc/reference/adaptors/examples/replaced.cpp : : example_replaced ]
-    [ compile ../doc/reference/adaptors/examples/replaced_if.cpp : : example_replaced_if ]
-    [ compile ../doc/reference/adaptors/examples/reversed.cpp : : example_reversed ]
-    [ compile ../doc/reference/adaptors/examples/sliced.cpp : : example_sliced ]
-    [ compile ../doc/reference/adaptors/examples/strided.cpp : : example_strided ]
     [ compile ../doc/reference/adaptors/examples/tokenized.cpp : : example_tokenized ]
-    [ compile ../doc/reference/adaptors/examples/transformed.cpp : : example_transformed ]
-    [ compile ../doc/reference/adaptors/examples/uniqued.cpp : : example_uniqued ]
 	[ compile-fail compile_fail/iterator_range1.cpp ]
 	[ range-test adaptor_test/adjacent_filtered ]
 	[ range-test adaptor_test/copied ]
diff --git a/test/adaptor_test/adjacent_filtered_example.cpp b/test/adaptor_test/adjacent_filtered_example.cpp
index ce132d6..4611c83 100644
--- a/test/adaptor_test/adjacent_filtered_example.cpp
+++ b/test/adaptor_test/adjacent_filtered_example.cpp
@@ -8,6 +8,7 @@
 //
 // For more information, see http://www.boost.org/libs/range/
 //
+//[adjacent_filtered_example
 #include <boost/range/adaptor/adjacent_filtered.hpp>
 #include <boost/range/algorithm/copy.hpp>
 #include <boost/assign.hpp>
@@ -16,6 +17,7 @@
 #include <iostream>
 #include <vector>
 
+//<-
 #include <boost/range/algorithm_ext/push_back.hpp>
 
 #include <boost/test/test_tools.hpp>
@@ -23,27 +25,32 @@
 
 namespace
 {
-    void adjacent_filtered_example_test()
-    {
-        using namespace boost::assign;
-        using namespace boost::adaptors;
+void adjacent_filtered_example_test()
+//->
+//=int main(int argc, const char* argv[])
+{
+    using namespace boost::assign;
+    using namespace boost::adaptors;
 
-        std::vector<int> input;
-        input += 1,1,2,2,2,3,4,5,6;
+    std::vector<int> input;
+    input += 1,1,2,2,2,3,4,5,6;
 
-        boost::copy(
-            input | adjacent_filtered(std::not_equal_to<int>()),
-            std::ostream_iterator<int>(std::cout, ","));
+    boost::copy(
+        input | adjacent_filtered(std::not_equal_to<int>()),
+        std::ostream_iterator<int>(std::cout, ","));
+    
+//=    return 0;
+//=}
+//]
+    std::vector<int> reference;
+    reference += 1,2,3,4,5,6;
 
-        std::vector<int> reference;
-        reference += 1,2,3,4,5,6;
+    std::vector<int> test;
+    boost::push_back(test, input | adjacent_filtered(std::not_equal_to<int>()));
 
-        std::vector<int> test;
-        boost::push_back(test, input | adjacent_filtered(std::not_equal_to<int>()));
-
-        BOOST_CHECK_EQUAL_COLLECTIONS( reference.begin(), reference.end(),
-            test.begin(), test.end() );
-    }
+    BOOST_CHECK_EQUAL_COLLECTIONS( reference.begin(), reference.end(),
+        test.begin(), test.end() );
+}
 }
 
 boost::unit_test::test_suite*
diff --git a/test/adaptor_test/copied_example.cpp b/test/adaptor_test/copied_example.cpp
index 154a110..963ad87 100644
--- a/test/adaptor_test/copied_example.cpp
+++ b/test/adaptor_test/copied_example.cpp
@@ -8,6 +8,7 @@
 //
 // For more information, see http://www.boost.org/libs/range/
 //
+//[copied_example
 #include <boost/range/adaptor/copied.hpp>
 #include <boost/range/algorithm/copy.hpp>
 #include <boost/assign.hpp>
@@ -15,6 +16,7 @@
 #include <iostream>
 #include <vector>
 
+//<-
 #include <boost/range/algorithm_ext/push_back.hpp>
 
 #include <boost/test/test_tools.hpp>
@@ -22,28 +24,32 @@
 
 namespace
 {
-    void copied_example_test()
-    {
-        using namespace boost::assign;
-        using namespace boost::adaptors;
+void copied_example_test()
+//->
+//=int main(int argc, const char* argv[])
+{
+    using namespace boost::assign;
+    using namespace boost::adaptors;
 
-        std::vector<int> input;
-        input += 1,2,3,4,5,6,7,8,9,10;
+    std::vector<int> input;
+    input += 1,2,3,4,5,6,7,8,9,10;
 
-        boost::copy(
-            input | copied(1, 5),
-            std::ostream_iterator<int>(std::cout, ","));
+    boost::copy(
+        input | copied(1, 5),
+        std::ostream_iterator<int>(std::cout, ","));
 
+//=    return 0;
+//=}
+//]
+    std::vector<int> reference;
+    reference += 2,3,4,5;
 
-        std::vector<int> reference;
-        reference += 2,3,4,5;
+    std::vector<int> test;
+    boost::push_back(test, input | copied(1, 5));
 
-        std::vector<int> test;
-        boost::push_back(test, input | copied(1, 5));
-
-        BOOST_CHECK_EQUAL_COLLECTIONS( reference.begin(), reference.end(),
-            test.begin(), test.end() );
-    }
+    BOOST_CHECK_EQUAL_COLLECTIONS( reference.begin(), reference.end(),
+        test.begin(), test.end() );
+}
 }
 
 boost::unit_test::test_suite*
diff --git a/test/adaptor_test/filtered_example.cpp b/test/adaptor_test/filtered_example.cpp
index 6d0e262..668aba8 100644
--- a/test/adaptor_test/filtered_example.cpp
+++ b/test/adaptor_test/filtered_example.cpp
@@ -8,6 +8,7 @@
 //
 // For more information, see http://www.boost.org/libs/range/
 //
+//[filtered_example
 #include <boost/range/adaptor/filtered.hpp>
 #include <boost/range/algorithm/copy.hpp>
 #include <boost/assign.hpp>
@@ -15,6 +16,7 @@
 #include <iostream>
 #include <vector>
 
+//<-
 #include <boost/test/test_tools.hpp>
 #include <boost/test/unit_test.hpp>
 
@@ -22,32 +24,39 @@
 
 namespace 
 {
-    struct is_even
-    {
-        bool operator()( int x ) const { return x % 2 == 0; }
-    };
+//->    
+struct is_even
+{
+    bool operator()( int x ) const { return x % 2 == 0; }
+};
 
-    void filtered_example_test()
-    {
-        using namespace boost::assign;
-        using namespace boost::adaptors;
+//<-
+void filtered_example_test()
+//->
+//=int main(int argc, const char* argv[])
+{
+    using namespace boost::assign;
+    using namespace boost::adaptors;
 
-        std::vector<int> input;
-        input += 1,2,3,4,5,6,7,8,9;
+    std::vector<int> input;
+    input += 1,2,3,4,5,6,7,8,9;
 
-        boost::copy(
-            input | filtered(is_even()),
-            std::ostream_iterator<int>(std::cout, ","));
+    boost::copy(
+        input | filtered(is_even()),
+        std::ostream_iterator<int>(std::cout, ","));
 
-        std::vector<int> reference;
-        reference += 2,4,6,8;
+//=    return 0;
+//=}
+//]
+    std::vector<int> reference;
+    reference += 2,4,6,8;
 
-        std::vector<int> test;
-        boost::push_back(test, input | filtered(is_even()));
+    std::vector<int> test;
+    boost::push_back(test, input | filtered(is_even()));
 
-        BOOST_CHECK_EQUAL_COLLECTIONS( reference.begin(), reference.end(),
-            test.begin(), test.end() );
-    }
+    BOOST_CHECK_EQUAL_COLLECTIONS( reference.begin(), reference.end(),
+        test.begin(), test.end() );
+}
 }
 
 boost::unit_test::test_suite*
diff --git a/test/adaptor_test/indexed_example.cpp b/test/adaptor_test/indexed_example.cpp
index 14837d2..f921e3f 100644
--- a/test/adaptor_test/indexed_example.cpp
+++ b/test/adaptor_test/indexed_example.cpp
@@ -8,6 +8,7 @@
 //
 // For more information, see http://www.boost.org/libs/range/
 //
+//[indexed_example
 #include <boost/range/adaptor/indexed.hpp>
 #include <boost/range/algorithm/copy.hpp>
 #include <boost/assign.hpp>
@@ -15,6 +16,7 @@
 #include <iostream>
 #include <vector>
 
+//<-
 #include <boost/test/test_tools.hpp>
 #include <boost/test/unit_test.hpp>
 
@@ -22,65 +24,72 @@
 
 namespace 
 {
-    template<class Iterator>
-    void display_element_and_index(Iterator first, Iterator last)
+
+template<class Iterator1, class Iterator2>
+void check_element_and_index(
+        Iterator1 test_first,
+        Iterator1 test_last,
+        Iterator2 reference_first,
+        Iterator2 reference_last)
+{
+    BOOST_CHECK_EQUAL( std::distance(test_first, test_last),
+                       std::distance(reference_first, reference_last) );
+
+    int reference_index = 0;
+
+    Iterator1 test_it = test_first;
+    Iterator2 reference_it = reference_first;
+    for (; test_it != test_last; ++test_it, ++reference_it, ++reference_index)
     {
-        for (Iterator it = first; it != last; ++it)
-        {
-            std::cout << "Element = " << *it << " Index = " << it.index() << std::endl;
-        }
+        BOOST_CHECK_EQUAL( *test_it, *reference_it );
+        BOOST_CHECK_EQUAL( test_it.index(), reference_index );
     }
+}
 
-    template<class SinglePassRange>
-    void display_element_and_index(const SinglePassRange& rng)
+template<class SinglePassRange1, class SinglePassRange2>
+void check_element_and_index(
+    const SinglePassRange1& test_rng,
+    const SinglePassRange2& reference_rng)
+{
+    check_element_and_index(boost::begin(test_rng), boost::end(test_rng),
+        boost::begin(reference_rng), boost::end(reference_rng));
+}
+//->    
+template<class Iterator>
+void display_element_and_index(Iterator first, Iterator last)
+{
+    for (Iterator it = first; it != last; ++it)
     {
-        display_element_and_index(boost::begin(rng), boost::end(rng));
+        std::cout << "Element = " << *it << " Index = " << it.index() << std::endl;
     }
+}
 
-    template<class Iterator1, class Iterator2>
-    void check_element_and_index(
-            Iterator1 test_first,
-            Iterator1 test_last,
-            Iterator2 reference_first,
-            Iterator2 reference_last)
-    {
-        BOOST_CHECK_EQUAL( std::distance(test_first, test_last),
-                           std::distance(reference_first, reference_last) );
+template<class SinglePassRange>
+void display_element_and_index(const SinglePassRange& rng)
+{
+    display_element_and_index(boost::begin(rng), boost::end(rng));
+}
 
-        int reference_index = 0;
+//<-
+void indexed_example_test()
+//->
+//=int main(int argc, const char* argv[])
+{
+    using namespace boost::assign;
+    using namespace boost::adaptors;
 
-        Iterator1 test_it = test_first;
-        Iterator2 reference_it = reference_first;
-        for (; test_it != test_last; ++test_it, ++reference_it, ++reference_index)
-        {
-            BOOST_CHECK_EQUAL( *test_it, *reference_it );
-            BOOST_CHECK_EQUAL( test_it.index(), reference_index );
-        }
-    }
+    std::vector<int> input;
+    input += 10,20,30,40,50,60,70,80,90;
 
-    template<class SinglePassRange1, class SinglePassRange2>
-    void check_element_and_index(
-        const SinglePassRange1& test_rng,
-        const SinglePassRange2& reference_rng)
-    {
-        check_element_and_index(boost::begin(test_rng), boost::end(test_rng),
-            boost::begin(reference_rng), boost::end(reference_rng));
-    }
+    display_element_and_index( input | indexed(0) );
 
-    void indexed_example_test()
-    {
-        using namespace boost::assign;
-        using namespace boost::adaptors;
-
-        std::vector<int> input;
-        input += 10,20,30,40,50,60,70,80,90;
-
-        display_element_and_index( input | indexed(0) );
-
-        check_element_and_index(
-            input | indexed(0),
-            input);
-    }
+//=    return 0;
+//=}
+//]
+    check_element_and_index(
+        input | indexed(0),
+        input);
+}
 }
 
 boost::unit_test::test_suite*
diff --git a/test/adaptor_test/indirected_example.cpp b/test/adaptor_test/indirected_example.cpp
index 8e607a6..2828f15 100644
--- a/test/adaptor_test/indirected_example.cpp
+++ b/test/adaptor_test/indirected_example.cpp
@@ -8,6 +8,7 @@
 //
 // For more information, see http://www.boost.org/libs/range/
 //
+//[indirected_example
 #include <boost/range/adaptor/indirected.hpp>
 #include <boost/range/algorithm/copy.hpp>
 #include <boost/shared_ptr.hpp>
@@ -15,6 +16,7 @@
 #include <iostream>
 #include <vector>
 
+//<-
 #include <boost/test/test_tools.hpp>
 #include <boost/test/unit_test.hpp>
 
@@ -22,30 +24,34 @@
 
 namespace 
 {
-    void indirected_example_test()
-    {
-        using namespace boost::adaptors;
+void indirected_example_test()
+//->
+//=int main(int argc, const char* argv[])
+{
+    using namespace boost::adaptors;
 
-        std::vector<boost::shared_ptr<int> > input;
+    std::vector<boost::shared_ptr<int> > input;
 
-        for (int i = 0; i < 10; ++i)
-            input.push_back(boost::shared_ptr<int>(new int(i)));
-        
-        boost::copy(
-            input | indirected,
-            std::ostream_iterator<int>(std::cout, ","));
+    for (int i = 0; i < 10; ++i)
+        input.push_back(boost::shared_ptr<int>(new int(i)));
+    
+    boost::copy(
+        input | indirected,
+        std::ostream_iterator<int>(std::cout, ","));
 
+//=    return 0;
+//=}
+//]
+    std::vector<int> reference;
+    for (int i = 0; i < 10; ++i)
+        reference.push_back(i);
 
-        std::vector<int> reference;
-        for (int i = 0; i < 10; ++i)
-            reference.push_back(i);
+    std::vector<int> test;
+    boost::push_back(test, input | indirected);
 
-        std::vector<int> test;
-        boost::push_back(test, input | indirected);
-
-        BOOST_CHECK_EQUAL_COLLECTIONS( reference.begin(), reference.end(),
-            test.begin(), test.end() );
-    }
+    BOOST_CHECK_EQUAL_COLLECTIONS( reference.begin(), reference.end(),
+        test.begin(), test.end() );
+}
 }
 
 boost::unit_test::test_suite*
diff --git a/test/adaptor_test/map_keys_example.cpp b/test/adaptor_test/map_keys_example.cpp
index df85456..a506e1a 100644
--- a/test/adaptor_test/map_keys_example.cpp
+++ b/test/adaptor_test/map_keys_example.cpp
@@ -8,6 +8,7 @@
 //
 // For more information, see http://www.boost.org/libs/range/
 //
+//[map_keys_example
 #include <boost/range/adaptor/map.hpp>
 #include <boost/range/algorithm/copy.hpp>
 #include <boost/assign.hpp>
@@ -16,6 +17,7 @@
 #include <map>
 #include <vector>
 
+//<-
 #include <boost/test/test_tools.hpp>
 #include <boost/test/unit_test.hpp>
 
@@ -23,29 +25,33 @@
 
 namespace 
 {
-    void map_keys_example_test()
-    {
-        using namespace boost::assign;
-        using namespace boost::adaptors;
+void map_keys_example_test()
+//->
+//=int main(int argc, const char* argv[])
+{
+    using namespace boost::assign;
+    using namespace boost::adaptors;
 
-        std::map<int,int> input;
-        for (int i = 0; i < 10; ++i)
-            input.insert(std::make_pair(i, i * 10));
+    std::map<int,int> input;
+    for (int i = 0; i < 10; ++i)
+        input.insert(std::make_pair(i, i * 10));
 
-        boost::copy(
-            input | map_keys,
-            std::ostream_iterator<int>(std::cout, ","));
+    boost::copy(
+        input | map_keys,
+        std::ostream_iterator<int>(std::cout, ","));
 
-        
-        std::vector<int> reference;
-        reference += 0,1,2,3,4,5,6,7,8,9;
+//=    return 0;
+//=}
+//]
+    std::vector<int> reference;
+    reference += 0,1,2,3,4,5,6,7,8,9;
 
-        std::vector<int> test;
-        boost::push_back(test, input | map_keys);
+    std::vector<int> test;
+    boost::push_back(test, input | map_keys);
 
-        BOOST_CHECK_EQUAL_COLLECTIONS( reference.begin(), reference.end(),
-            test.begin(), test.end() );
-    }
+    BOOST_CHECK_EQUAL_COLLECTIONS( reference.begin(), reference.end(),
+        test.begin(), test.end() );
+}
 }
 
 boost::unit_test::test_suite*
diff --git a/test/adaptor_test/map_values_example.cpp b/test/adaptor_test/map_values_example.cpp
index dfb32e9..6821004 100644
--- a/test/adaptor_test/map_values_example.cpp
+++ b/test/adaptor_test/map_values_example.cpp
@@ -8,6 +8,7 @@
 //
 // For more information, see http://www.boost.org/libs/range/
 //
+//[map_values_example
 #include <boost/range/adaptor/map.hpp>
 #include <boost/range/algorithm/copy.hpp>
 #include <boost/assign.hpp>
@@ -16,6 +17,7 @@
 #include <map>
 #include <vector>
 
+//<-
 #include <boost/test/test_tools.hpp>
 #include <boost/test/unit_test.hpp>
 
@@ -23,29 +25,33 @@
 
 namespace 
 {
-    void map_values_example_test()
-    {
-        using namespace boost::assign;
-        using namespace boost::adaptors;
+void map_values_example_test()
+//->
+//=int main(int argc, const char* argv[])
+{
+    using namespace boost::assign;
+    using namespace boost::adaptors;
 
-        std::map<int,int> input;
-        for (int i = 0; i < 10; ++i)
-            input.insert(std::make_pair(i, i * 10));
+    std::map<int,int> input;
+    for (int i = 0; i < 10; ++i)
+        input.insert(std::make_pair(i, i * 10));
 
-        boost::copy(
-            input | map_values,
-            std::ostream_iterator<int>(std::cout, ","));
+    boost::copy(
+        input | map_values,
+        std::ostream_iterator<int>(std::cout, ","));
 
-        
-        std::vector<int> reference;
-        reference += 0,10,20,30,40,50,60,70,80,90;
+//=    return 0;
+//=}
+//]
+    std::vector<int> reference;
+    reference += 0,10,20,30,40,50,60,70,80,90;
 
-        std::vector<int> test;
-        boost::push_back(test, input | map_values);
+    std::vector<int> test;
+    boost::push_back(test, input | map_values);
 
-        BOOST_CHECK_EQUAL_COLLECTIONS( reference.begin(), reference.end(),
-            test.begin(), test.end() );
-    }
+    BOOST_CHECK_EQUAL_COLLECTIONS( reference.begin(), reference.end(),
+        test.begin(), test.end() );
+}
 }
 
 boost::unit_test::test_suite*
diff --git a/test/adaptor_test/replaced_example.cpp b/test/adaptor_test/replaced_example.cpp
index fc1d2db..fdb21aa 100644
--- a/test/adaptor_test/replaced_example.cpp
+++ b/test/adaptor_test/replaced_example.cpp
@@ -8,6 +8,7 @@
 //
 // For more information, see http://www.boost.org/libs/range/
 //
+//[replaced_example
 #include <boost/range/adaptor/replaced.hpp>
 #include <boost/range/algorithm/copy.hpp>
 #include <boost/assign.hpp>
@@ -15,6 +16,7 @@
 #include <iostream>
 #include <vector>
 
+//<-
 #include <boost/test/test_tools.hpp>
 #include <boost/test/unit_test.hpp>
 
@@ -22,28 +24,32 @@
 
 namespace 
 {
-    void replaced_example_test()
-    {
-        using namespace boost::adaptors;
-        using namespace boost::assign;
+void replaced_example_test()
+//->
+//=int main(int argc, const char* argv[])
+{
+    using namespace boost::adaptors;
+    using namespace boost::assign;
 
-        std::vector<int> input;
-        input += 1,2,3,2,5,2,7,2,9;
-        
-        boost::copy(
-            input | replaced(2, 10),
-            std::ostream_iterator<int>(std::cout, ","));
+    std::vector<int> input;
+    input += 1,2,3,2,5,2,7,2,9;
+    
+    boost::copy(
+        input | replaced(2, 10),
+        std::ostream_iterator<int>(std::cout, ","));
 
+//=    return 0;
+//=}
+//]
+    std::vector<int> reference;
+    reference += 1,10,3,10,5,10,7,10,9;
 
-        std::vector<int> reference;
-        reference += 1,10,3,10,5,10,7,10,9;
+    std::vector<int> test;
+    boost::push_back(test, input | replaced(2, 10));
 
-        std::vector<int> test;
-        boost::push_back(test, input | replaced(2, 10));
-
-        BOOST_CHECK_EQUAL_COLLECTIONS( reference.begin(), reference.end(),
-            test.begin(), test.end() );
-    }
+    BOOST_CHECK_EQUAL_COLLECTIONS( reference.begin(), reference.end(),
+        test.begin(), test.end() );
+}
 }
 
 boost::unit_test::test_suite*
diff --git a/test/adaptor_test/replaced_if_example.cpp b/test/adaptor_test/replaced_if_example.cpp
index c762c2f..58b8427 100644
--- a/test/adaptor_test/replaced_if_example.cpp
+++ b/test/adaptor_test/replaced_if_example.cpp
@@ -8,6 +8,7 @@
 //
 // For more information, see http://www.boost.org/libs/range/
 //
+//[replaced_if_example
 #include <boost/range/adaptor/replaced_if.hpp>
 #include <boost/range/algorithm/copy.hpp>
 #include <boost/assign.hpp>
@@ -15,6 +16,7 @@
 #include <iostream>
 #include <vector>
 
+//<-
 #include <boost/test/test_tools.hpp>
 #include <boost/test/unit_test.hpp>
 
@@ -22,32 +24,39 @@
 
 namespace 
 {
-    struct is_even
-    {
-        bool operator()(int x) const { return x % 2 == 0; }
-    };
+//->
+struct is_even
+{
+    bool operator()(int x) const { return x % 2 == 0; }
+};
 
-    void replaced_if_example_test()
-    {
-        using namespace boost::adaptors;
-        using namespace boost::assign;
+//<-
+void replaced_if_example_test()
+//->
+//=int main(int argc, const char* argv[])
+{
+    using namespace boost::adaptors;
+    using namespace boost::assign;
 
-        std::vector<int> input;
-        input += 1,2,3,4,5,6,7,8,9;
-        
-        boost::copy(
-            input | replaced_if(is_even(), 10),
-            std::ostream_iterator<int>(std::cout, ","));
+    std::vector<int> input;
+    input += 1,2,3,4,5,6,7,8,9;
+    
+    boost::copy(
+        input | replaced_if(is_even(), 10),
+        std::ostream_iterator<int>(std::cout, ","));
 
-        std::vector<int> reference;
-        reference += 1,10,3,10,5,10,7,10,9;
+//=    return 0;
+//=}
+//]
+    std::vector<int> reference;
+    reference += 1,10,3,10,5,10,7,10,9;
 
-        std::vector<int> test;
-        boost::push_back(test, input | replaced_if(is_even(), 10));
+    std::vector<int> test;
+    boost::push_back(test, input | replaced_if(is_even(), 10));
 
-        BOOST_CHECK_EQUAL_COLLECTIONS( reference.begin(), reference.end(),
-            test.begin(), test.end() );
-    }
+    BOOST_CHECK_EQUAL_COLLECTIONS( reference.begin(), reference.end(),
+        test.begin(), test.end() );
+}
 }
 
 boost::unit_test::test_suite*
diff --git a/test/adaptor_test/reversed_example.cpp b/test/adaptor_test/reversed_example.cpp
index 553e7d7..d176e84 100644
--- a/test/adaptor_test/reversed_example.cpp
+++ b/test/adaptor_test/reversed_example.cpp
@@ -8,6 +8,7 @@
 //
 // For more information, see http://www.boost.org/libs/range/
 //
+//[reversed_example
 #include <boost/range/adaptor/reversed.hpp>
 #include <boost/range/algorithm/copy.hpp>
 #include <boost/assign.hpp>
@@ -15,6 +16,7 @@
 #include <iostream>
 #include <vector>
 
+//<-
 #include <boost/test/test_tools.hpp>
 #include <boost/test/unit_test.hpp>
 
@@ -22,25 +24,29 @@
 
 namespace 
 {
-    void reversed_example_test()
-    {
-        using namespace boost::adaptors;
-        using namespace boost::assign;
+void reversed_example_test()
+//->
+//=int main(int argc, const char* argv[])
+{
+    using namespace boost::adaptors;
+    using namespace boost::assign;
 
-        std::vector<int> input;
-        input += 1,2,3,4,5,6,7,8,9;
-        
-        boost::copy(
-            input | reversed,
-            std::ostream_iterator<int>(std::cout, ","));
+    std::vector<int> input;
+    input += 1,2,3,4,5,6,7,8,9;
+    
+    boost::copy(
+        input | reversed,
+        std::ostream_iterator<int>(std::cout, ","));
 
+//=    return 0;
+//=}
+//]
+    std::vector<int> test;
+    boost::push_back(test, input | reversed);
 
-        std::vector<int> test;
-        boost::push_back(test, input | reversed);
-
-        BOOST_CHECK_EQUAL_COLLECTIONS( input.rbegin(), input.rend(),
-            test.begin(), test.end() );
-    }
+    BOOST_CHECK_EQUAL_COLLECTIONS( input.rbegin(), input.rend(),
+        test.begin(), test.end() );
+}
 }
 
 boost::unit_test::test_suite*
diff --git a/test/adaptor_test/sliced_example.cpp b/test/adaptor_test/sliced_example.cpp
index 5761844..39b14bf 100644
--- a/test/adaptor_test/sliced_example.cpp
+++ b/test/adaptor_test/sliced_example.cpp
@@ -8,6 +8,7 @@
 //
 // For more information, see http://www.boost.org/libs/range/
 //
+//[sliced_example
 #include <boost/range/adaptor/sliced.hpp>
 #include <boost/range/algorithm/copy.hpp>
 #include <boost/assign.hpp>
@@ -15,6 +16,7 @@
 #include <iostream>
 #include <vector>
 
+//<-
 #include <boost/test/test_tools.hpp>
 #include <boost/test/unit_test.hpp>
 
@@ -22,28 +24,32 @@
 
 namespace 
 {
-    void sliced_example_test()
-    {
-        using namespace boost::adaptors;
-        using namespace boost::assign;
+void sliced_example_test()
+//->
+//=int main(int argc, const char* argv[])
+{
+    using namespace boost::adaptors;
+    using namespace boost::assign;
 
-        std::vector<int> input;
-        input += 1,2,3,4,5,6,7,8,9;
-        
-        boost::copy(
-            input | sliced(2, 5),
-            std::ostream_iterator<int>(std::cout, ","));
+    std::vector<int> input;
+    input += 1,2,3,4,5,6,7,8,9;
+    
+    boost::copy(
+        input | sliced(2, 5),
+        std::ostream_iterator<int>(std::cout, ","));
 
+//=    return 0;
+//=}
+//]
+    std::vector<int> reference;
+    reference += 3,4,5;
 
-        std::vector<int> reference;
-        reference += 3,4,5;
+    std::vector<int> test;
+    boost::push_back(test, input | sliced(2, 5));
 
-        std::vector<int> test;
-        boost::push_back(test, input | sliced(2, 5));
-
-        BOOST_CHECK_EQUAL_COLLECTIONS( reference.begin(), reference.end(),
-            test.begin(), test.end() );
-    }
+    BOOST_CHECK_EQUAL_COLLECTIONS( reference.begin(), reference.end(),
+        test.begin(), test.end() );
+}
 }
 
 boost::unit_test::test_suite*
diff --git a/test/adaptor_test/strided_example.cpp b/test/adaptor_test/strided_example.cpp
index 5754c53..a94fbbf 100644
--- a/test/adaptor_test/strided_example.cpp
+++ b/test/adaptor_test/strided_example.cpp
@@ -8,6 +8,7 @@
 //
 // For more information, see http://www.boost.org/libs/range/
 //
+//[strided_example
 #include <boost/range/adaptor/strided.hpp>
 #include <boost/range/algorithm/copy.hpp>
 #include <boost/assign.hpp>
@@ -15,6 +16,7 @@
 #include <iostream>
 #include <vector>
 
+//<-
 #include <boost/test/test_tools.hpp>
 #include <boost/test/unit_test.hpp>
 
@@ -22,28 +24,32 @@
 
 namespace 
 {
-    void strided_example_test()
-    {
-        using namespace boost::adaptors;
-        using namespace boost::assign;
+void strided_example_test()
+//->
+//=int main(int argc, const char* argv[])
+{
+    using namespace boost::adaptors;
+    using namespace boost::assign;
 
-        std::vector<int> input;
-        input += 1,2,3,4,5,6,7,8,9,10;
-        
-        boost::copy(
-            input | strided(2),
-            std::ostream_iterator<int>(std::cout, ","));
+    std::vector<int> input;
+    input += 1,2,3,4,5,6,7,8,9,10;
+    
+    boost::copy(
+        input | strided(2),
+        std::ostream_iterator<int>(std::cout, ","));
 
+//=    return 0;
+//=}
+//]
+    std::vector<int> reference;
+    reference += 1,3,5,7,9;
 
-        std::vector<int> reference;
-        reference += 1,3,5,7,9;
+    std::vector<int> test;
+    boost::push_back(test, input | strided(2));
 
-        std::vector<int> test;
-        boost::push_back(test, input | strided(2));
-
-        BOOST_CHECK_EQUAL_COLLECTIONS( reference.begin(), reference.end(),
-            test.begin(), test.end() );
-    }
+    BOOST_CHECK_EQUAL_COLLECTIONS( reference.begin(), reference.end(),
+        test.begin(), test.end() );
+}
 }
 
 boost::unit_test::test_suite*
diff --git a/test/adaptor_test/transformed_example.cpp b/test/adaptor_test/transformed_example.cpp
index 3d05c95..109302b 100644
--- a/test/adaptor_test/transformed_example.cpp
+++ b/test/adaptor_test/transformed_example.cpp
@@ -8,6 +8,7 @@
 //
 // For more information, see http://www.boost.org/libs/range/
 //
+//[transformed_example
 #include <boost/range/adaptor/transformed.hpp>
 #include <boost/range/algorithm/copy.hpp>
 #include <boost/assign.hpp>
@@ -15,6 +16,7 @@
 #include <iostream>
 #include <vector>
 
+//<-
 #include <boost/test/test_tools.hpp>
 #include <boost/test/unit_test.hpp>
 
@@ -22,34 +24,40 @@
 
 namespace 
 {
-    struct double_int
-    {
-        typedef int result_type;
-        int operator()(int x) const { return x * 2; }
-    };
+//->
+struct double_int
+{
+    typedef int result_type;
+    int operator()(int x) const { return x * 2; }
+};
 
-    void transformed_example_test()
-    {
-        using namespace boost::adaptors;
-        using namespace boost::assign;
+//<-
+void transformed_example_test()
+//->
+//=int main(int argc, const char* argv[])
+{
+    using namespace boost::adaptors;
+    using namespace boost::assign;
 
-        std::vector<int> input;
-        input += 1,2,3,4,5,6,7,8,9,10;
-        
-        boost::copy(
-            input | transformed(double_int()),
-            std::ostream_iterator<int>(std::cout, ","));
+    std::vector<int> input;
+    input += 1,2,3,4,5,6,7,8,9,10;
+    
+    boost::copy(
+        input | transformed(double_int()),
+        std::ostream_iterator<int>(std::cout, ","));
 
+//=    return 0;
+//=}
+//]
+    std::vector<int> reference;
+    reference += 2,4,6,8,10,12,14,16,18,20;
 
-        std::vector<int> reference;
-        reference += 2,4,6,8,10,12,14,16,18,20;
+    std::vector<int> test;
+    boost::push_back(test, input | transformed(double_int()));
 
-        std::vector<int> test;
-        boost::push_back(test, input | transformed(double_int()));
-
-        BOOST_CHECK_EQUAL_COLLECTIONS( reference.begin(), reference.end(),
-            test.begin(), test.end() );
-    }
+    BOOST_CHECK_EQUAL_COLLECTIONS( reference.begin(), reference.end(),
+        test.begin(), test.end() );
+}
 }
 
 boost::unit_test::test_suite*
diff --git a/test/adaptor_test/type_erased_example.cpp b/test/adaptor_test/type_erased_example.cpp
index 754fba6..0d17eff 100644
--- a/test/adaptor_test/type_erased_example.cpp
+++ b/test/adaptor_test/type_erased_example.cpp
@@ -8,6 +8,7 @@
 //
 // For more information, see http://www.boost.org/libs/range/
 //
+//[type_erased_example
 #include <boost/range/adaptor/type_erased.hpp>
 #include <boost/range/algorithm/copy.hpp>
 #include <boost/assign.hpp>
@@ -16,7 +17,7 @@
 #include <iostream>
 #include <list>
 #include <vector>
-
+//<-
 #include <boost/test/test_tools.hpp>
 #include <boost/test/unit_test.hpp>
 
@@ -26,6 +27,7 @@ namespace
     {
         namespace type_erased_example
         {
+//->            
 
 // The client interface from an OO perspective merely requires a sequence
 // of integers that can be forward traversed
@@ -99,6 +101,13 @@ namespace client
     }
 }
 
+//=int main(int argc, const char* argv[])
+//={
+//=    client::run();
+//=    return 0;
+//=}
+//]
+
         } // namespace type_erased_example
     } // namespace boost_range_test
 } // anonymous namespace
diff --git a/test/adaptor_test/uniqued_example.cpp b/test/adaptor_test/uniqued_example.cpp
index c48c54a..184ff2d 100644
--- a/test/adaptor_test/uniqued_example.cpp
+++ b/test/adaptor_test/uniqued_example.cpp
@@ -8,6 +8,7 @@
 //
 // For more information, see http://www.boost.org/libs/range/
 //
+//[uniqued_example
 #include <boost/range/adaptor/uniqued.hpp>
 #include <boost/range/algorithm/copy.hpp>
 #include <boost/assign.hpp>
@@ -15,6 +16,7 @@
 #include <iostream>
 #include <vector>
 
+//<-
 #include <boost/range/algorithm_ext/push_back.hpp>
 
 #include <boost/test/test_tools.hpp>
@@ -22,27 +24,32 @@
 
 namespace
 {
-    void uniqued_example_test()
-    {
-        using namespace boost::assign;
-        using namespace boost::adaptors;
+void uniqued_example_test()
+//->
+//=int main(int argc, const char* argv[])
+{
+    using namespace boost::assign;
+    using namespace boost::adaptors;
 
-        std::vector<int> input;
-        input += 1,1,2,2,2,3,4,5,6;
+    std::vector<int> input;
+    input += 1,1,2,2,2,3,4,5,6;
 
-        boost::copy(
-            input | uniqued,
-            std::ostream_iterator<int>(std::cout, ","));
+    boost::copy(
+        input | uniqued,
+        std::ostream_iterator<int>(std::cout, ","));
 
-        std::vector<int> reference;
-        reference += 1,2,3,4,5,6;
+//=    return 0;
+//=}
+//]
+    std::vector<int> reference;
+    reference += 1,2,3,4,5,6;
 
-        std::vector<int> test;
-        boost::push_back( test, input | uniqued );
+    std::vector<int> test;
+    boost::push_back( test, input | uniqued );
 
-        BOOST_CHECK_EQUAL_COLLECTIONS( reference.begin(), reference.end(),
-            test.begin(), test.end() );
-    }
+    BOOST_CHECK_EQUAL_COLLECTIONS( reference.begin(), reference.end(),
+        test.begin(), test.end() );
+}
 }
 
 boost::unit_test::test_suite*

From fc88bc06ad8d69d87f251218726970b404dd98a8 Mon Sep 17 00:00:00 2001
From: Nathan Ridge <zeratul976@hotmail.com>
Date: Fri, 4 Jan 2013 00:58:17 +0000
Subject: [PATCH 29/41] [range] fixed #7843 (missing example in docs for
 'tokenized' range adaptor)

[SVN r82345]
---
 doc/html/index.html                           |  2 +-
 .../adaptors/reference/tokenized.html         | 45 +++++++++++++
 doc/reference/adaptors/examples/tokenized.cpp | 28 --------
 doc/reference/adaptors/tokenized.qbk          | 18 +++++
 test/Jamfile.v2                               |  4 +-
 test/adaptor_test/tokenized_example.cpp       | 65 +++++++++++++++++++
 6 files changed, 131 insertions(+), 31 deletions(-)
 delete mode 100644 doc/reference/adaptors/examples/tokenized.cpp
 create mode 100644 test/adaptor_test/tokenized_example.cpp

diff --git a/doc/html/index.html b/doc/html/index.html
index b37d1e2..9f990d6 100644
--- a/doc/html/index.html
+++ b/doc/html/index.html
@@ -147,7 +147,7 @@
   </p>
 </div>
 <table xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" width="100%"><tr>
-<td align="left"><p><small>Last revised: January 03, 2013 at 23:22:09 GMT</small></p></td>
+<td align="left"><p><small>Last revised: January 04, 2013 at 00:56:46 GMT</small></p></td>
 <td align="right"><div class="copyright-footer"></div></td>
 </tr></table>
 <hr>
diff --git a/doc/html/range/reference/adaptors/reference/tokenized.html b/doc/html/range/reference/adaptors/reference/tokenized.html
index 1b9a97d..80396f0 100644
--- a/doc/html/range/reference/adaptors/reference/tokenized.html
+++ b/doc/html/range/reference/adaptors/reference/tokenized.html
@@ -26,6 +26,7 @@
 <div class="titlepage"><div><div><h5 class="title">
 <a name="range.reference.adaptors.reference.tokenized"></a><a class="link" href="tokenized.html" title="tokenized">tokenized</a>
 </h5></div></div></div>
+<div class="toc"><dl><dt><span class="section"><a href="tokenized.html#range.reference.adaptors.reference.tokenized.tokenized_example">tokenized_example</a></span></dt></dl></div>
 <div class="informaltable"><table class="table">
 <colgroup>
 <col>
@@ -134,6 +135,50 @@
                 Access Range</a>
               </li>
 </ul></div>
+<div class="section range_reference_adaptors_reference_tokenized_tokenized_example">
+<div class="titlepage"><div><div><h6 class="title">
+<a name="range.reference.adaptors.reference.tokenized.tokenized_example"></a><a class="link" href="tokenized.html#range.reference.adaptors.reference.tokenized.tokenized_example" title="tokenized_example">tokenized_example</a>
+</h6></div></div></div>
+<p>
+</p>
+<pre class="programlisting"><span class="preprocessor">#include</span> <span class="special">&lt;</span><span class="identifier">boost</span><span class="special">/</span><span class="identifier">range</span><span class="special">/</span><span class="identifier">adaptor</span><span class="special">/</span><span class="identifier">tokenized</span><span class="special">.</span><span class="identifier">hpp</span><span class="special">&gt;</span>
+<span class="preprocessor">#include</span> <span class="special">&lt;</span><span class="identifier">boost</span><span class="special">/</span><span class="identifier">range</span><span class="special">/</span><span class="identifier">algorithm</span><span class="special">/</span><span class="identifier">copy</span><span class="special">.</span><span class="identifier">hpp</span><span class="special">&gt;</span>
+<span class="preprocessor">#include</span> <span class="special">&lt;</span><span class="identifier">boost</span><span class="special">/</span><span class="identifier">assign</span><span class="special">.</span><span class="identifier">hpp</span><span class="special">&gt;</span>
+<span class="preprocessor">#include</span> <span class="special">&lt;</span><span class="identifier">algorithm</span><span class="special">&gt;</span>
+<span class="preprocessor">#include</span> <span class="special">&lt;</span><span class="identifier">iostream</span><span class="special">&gt;</span>
+<span class="preprocessor">#include</span> <span class="special">&lt;</span><span class="identifier">vector</span><span class="special">&gt;</span>
+
+<span class="keyword">int</span> <span class="identifier">main</span><span class="special">(</span><span class="keyword">int</span> <span class="identifier">argc</span><span class="special">,</span> <span class="keyword">const</span> <span class="keyword">char</span><span class="special">*</span> <span class="identifier">argv</span><span class="special">[])</span>
+<span class="special">{</span>
+    <span class="keyword">using</span> <span class="keyword">namespace</span> <span class="identifier">boost</span><span class="special">::</span><span class="identifier">adaptors</span><span class="special">;</span>
+
+    <span class="keyword">typedef</span> <span class="identifier">boost</span><span class="special">::</span><span class="identifier">sub_match</span><span class="special">&lt;</span> <span class="identifier">std</span><span class="special">::</span><span class="identifier">string</span><span class="special">::</span><span class="identifier">iterator</span> <span class="special">&gt;</span> <span class="identifier">match_type</span><span class="special">;</span>
+
+    <span class="identifier">std</span><span class="special">::</span><span class="identifier">string</span> <span class="identifier">input</span> <span class="special">=</span> <span class="string">" a b c d e f g hijklmnopqrstuvwxyz"</span><span class="special">;</span>
+    <span class="identifier">boost</span><span class="special">::</span><span class="identifier">copy</span><span class="special">(</span>
+        <span class="identifier">input</span> <span class="special">|</span> <span class="identifier">tokenized</span><span class="special">(</span><span class="identifier">boost</span><span class="special">::</span><span class="identifier">regex</span><span class="special">(</span><span class="string">"\\w+"</span><span class="special">)),</span>
+        <span class="identifier">std</span><span class="special">::</span><span class="identifier">ostream_iterator</span><span class="special">&lt;</span><span class="identifier">match_type</span><span class="special">&gt;(</span><span class="identifier">std</span><span class="special">::</span><span class="identifier">cout</span><span class="special">,</span> <span class="string">"\n"</span><span class="special">));</span>
+
+    <span class="keyword">return</span> <span class="number">0</span><span class="special">;</span>
+<span class="special">}</span>
+</pre>
+<p>
+            </p>
+</div>
+<p>
+            This would produce the output:
+</p>
+<pre class="programlisting"><span class="identifier">a</span>
+<span class="identifier">b</span>
+<span class="identifier">c</span>
+<span class="identifier">d</span>
+<span class="identifier">e</span>
+<span class="identifier">f</span>
+<span class="identifier">g</span>
+<span class="identifier">hijklmnopqrstuvwxyz</span>
+</pre>
+<p>
+          </p>
 </div>
 <table xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" width="100%"><tr>
 <td align="left"></td>
diff --git a/doc/reference/adaptors/examples/tokenized.cpp b/doc/reference/adaptors/examples/tokenized.cpp
deleted file mode 100644
index 273eaf1..0000000
--- a/doc/reference/adaptors/examples/tokenized.cpp
+++ /dev/null
@@ -1,28 +0,0 @@
-// Boost.Range library
-//
-//  Copyright Thorsten Ottosen 2003-2004. Use, modification and
-//  distribution is subject to the Boost Software License, Version
-//  1.0. (See accompanying file LICENSE_1_0.txt or copy at
-//  http://www.boost.org/LICENSE_1_0.txt)
-//
-// For more information, see http://www.boost.org/libs/range/
-//
-#include <boost/range/adaptor/tokenized.hpp>
-#include <boost/range/algorithm_ext/push_back.hpp>
-#include <boost/assert.hpp>
-#include <algorithm>
-#include <string>
-#include <vector>
-
-int main(int argc, const char* argv[])
-{
-    using namespace boost::adaptors;
-    
-    std::string input = " a b c d e f g hijklmnopqrstuvwxyz";
-    std::vector< boost::sub_match< std::string::iterator > > result;
-    boost::push_back(result, input | tokenized(boost::regex("\\b")));
-    
-    BOOST_ASSERT( boost::size(result) == 16u );
-    
-    return 0;
-}
diff --git a/doc/reference/adaptors/tokenized.qbk b/doc/reference/adaptors/tokenized.qbk
index 2127785..0a480d4 100644
--- a/doc/reference/adaptors/tokenized.qbk
+++ b/doc/reference/adaptors/tokenized.qbk
@@ -44,6 +44,24 @@
 * [*Range Return Type:] `boost::tokenized_range<typeof(rng)>`
 * [*Returned Range Category:] __random_access_range__
 
+[section:tokenized_example tokenized_example]
+[import ../../../test/adaptor_test/tokenized_example.cpp]
+[tokenized_example]
+[endsect]
+
+This would produce the output:
+``
+a
+b
+c
+d
+e
+f
+g
+hijklmnopqrstuvwxyz
+
+``
+
 [endsect]
 
 
diff --git a/test/Jamfile.v2 b/test/Jamfile.v2
index 4eb4506..d76c141 100644
--- a/test/Jamfile.v2
+++ b/test/Jamfile.v2
@@ -31,7 +31,6 @@ rule range-test ( name : includes * )
 }
 
 test-suite range :
-    [ compile ../doc/reference/adaptors/examples/tokenized.cpp : : example_tokenized ]
 	[ compile-fail compile_fail/iterator_range1.cpp ]
 	[ range-test adaptor_test/adjacent_filtered ]
 	[ range-test adaptor_test/copied ]
@@ -47,6 +46,7 @@ test-suite range :
 	[ range-test adaptor_test/strided2 ]
 	[ range-test adaptor_test/tokenized ]
 	[ range-test adaptor_test/transformed ]
+	[ range-test adaptor_test/type_erased ]
 	[ range-test adaptor_test/uniqued ]
 	[ range-test adaptor_test/adjacent_filtered_example ]
 	[ range-test adaptor_test/copied_example ]
@@ -61,7 +61,7 @@ test-suite range :
 	[ range-test adaptor_test/sliced_example ]
 	[ range-test adaptor_test/strided_example ]
 	[ range-test adaptor_test/transformed_example ]
-	[ range-test adaptor_test/type_erased ]
+	[ range-test adaptor_test/tokenized_example ]
 	[ range-test adaptor_test/type_erased_example ]
 	[ range-test adaptor_test/uniqued_example ]
 	[ range-test algorithm_test/adjacent_find ]
diff --git a/test/adaptor_test/tokenized_example.cpp b/test/adaptor_test/tokenized_example.cpp
new file mode 100644
index 0000000..243e47f
--- /dev/null
+++ b/test/adaptor_test/tokenized_example.cpp
@@ -0,0 +1,65 @@
+// Boost.Range library
+//
+//  Copyright Neil Groves 2009. Use, modification and
+//  distribution is subject to the Boost Software License, Version
+//  1.0. (See accompanying file LICENSE_1_0.txt or copy at
+//  http://www.boost.org/LICENSE_1_0.txt)
+//
+//
+// For more information, see http://www.boost.org/libs/range/
+//
+//[tokenized_example
+#include <boost/range/adaptor/tokenized.hpp>
+#include <boost/range/algorithm/copy.hpp>
+#include <boost/assign.hpp>
+#include <algorithm>
+#include <iostream>
+#include <vector>
+
+//<-
+#include <boost/test/test_tools.hpp>
+#include <boost/test/unit_test.hpp>
+
+#include <boost/range/algorithm_ext/push_back.hpp>
+
+namespace 
+{
+void tokenized_example_test()
+//->
+//=int main(int argc, const char* argv[])
+{
+    using namespace boost::adaptors;
+    
+    typedef boost::sub_match< std::string::iterator > match_type;
+    
+    std::string input = " a b c d e f g hijklmnopqrstuvwxyz";
+    boost::copy(
+        input | tokenized(boost::regex("\\w+")),
+        std::ostream_iterator<match_type>(std::cout, "\n"));
+
+//=    return 0;
+//=}
+//]
+    using namespace boost::assign;
+
+    std::vector<std::string> reference;
+    reference += "a","b","c","d","e","f","g","hijklmnopqrstuvwxyz";
+    
+    std::vector<match_type> test;
+    boost::push_back(test, input | tokenized(boost::regex("\\w+")));
+    
+    BOOST_CHECK_EQUAL_COLLECTIONS( reference.begin(), reference.end(),
+        test.begin(), test.end() );
+}
+}
+
+boost::unit_test::test_suite*
+init_unit_test_suite(int argc, char* argv[])
+{
+    boost::unit_test::test_suite* test
+        = BOOST_TEST_SUITE( "RangeTestSuite.adaptor.tokenized_example" );
+
+    test->add( BOOST_TEST_CASE( &tokenized_example_test ) );
+
+    return test;
+}

From cbd915a988aeaf4e66523206d5e519570290298f Mon Sep 17 00:00:00 2001
From: Nathan Ridge <zeratul976@hotmail.com>
Date: Fri, 4 Jan 2013 01:18:36 +0000
Subject: [PATCH 30/41] [range] fixed #5314 (small mistakes in range adaptor
 examples)

[SVN r82346]
---
 doc/html/index.html                                    |  2 +-
 .../adaptors/reference/adjacent_filtered.html          |  4 ++--
 .../range/reference/adaptors/reference/copied.html     |  4 ++--
 .../range/reference/adaptors/reference/filtered.html   |  4 ++--
 .../range/reference/adaptors/reference/indexed.html    |  2 +-
 .../range/reference/adaptors/reference/indirected.html |  4 ++--
 .../range/reference/adaptors/reference/map_keys.html   |  4 ++--
 .../range/reference/adaptors/reference/map_values.html |  4 ++--
 .../range/reference/adaptors/reference/replaced.html   |  4 ++--
 .../reference/adaptors/reference/replaced_if.html      |  4 ++--
 .../range/reference/adaptors/reference/reversed.html   |  4 ++--
 .../range/reference/adaptors/reference/sliced.html     |  4 ++--
 .../range/reference/adaptors/reference/strided.html    |  4 ++--
 .../range/reference/adaptors/reference/tokenized.html  |  2 +-
 .../reference/adaptors/reference/transformed.html      |  4 ++--
 .../reference/adaptors/reference/type_erased.html      | 10 +++++-----
 .../range/reference/adaptors/reference/uniqued.html    |  4 ++--
 doc/reference/adaptors/adjacent_filtered.qbk           |  2 +-
 doc/reference/adaptors/copied.qbk                      |  2 +-
 doc/reference/adaptors/filtered.qbk                    |  2 +-
 doc/reference/adaptors/indirected.qbk                  |  2 +-
 doc/reference/adaptors/map_keys.qbk                    |  2 +-
 doc/reference/adaptors/map_values.qbk                  |  2 +-
 doc/reference/adaptors/replaced.qbk                    |  2 +-
 doc/reference/adaptors/replaced_if.qbk                 |  2 +-
 doc/reference/adaptors/reversed.qbk                    |  2 +-
 doc/reference/adaptors/sliced.qbk                      |  2 +-
 doc/reference/adaptors/strided.qbk                     |  2 +-
 doc/reference/adaptors/transformed.qbk                 |  2 +-
 doc/reference/adaptors/type_erased.qbk                 |  8 ++++----
 doc/reference/adaptors/uniqued.qbk                     |  2 +-
 test/adaptor_test/adjacent_filtered_example.cpp        |  2 +-
 test/adaptor_test/copied_example.cpp                   |  2 +-
 test/adaptor_test/filtered_example.cpp                 |  2 +-
 test/adaptor_test/indexed_example.cpp                  |  2 +-
 test/adaptor_test/indirected_example.cpp               |  2 +-
 test/adaptor_test/map_keys_example.cpp                 |  2 +-
 test/adaptor_test/map_values_example.cpp               |  2 +-
 test/adaptor_test/replaced_example.cpp                 |  2 +-
 test/adaptor_test/replaced_if_example.cpp              |  2 +-
 test/adaptor_test/reversed_example.cpp                 |  2 +-
 test/adaptor_test/sliced_example.cpp                   |  2 +-
 test/adaptor_test/strided_example.cpp                  |  2 +-
 test/adaptor_test/tokenized_example.cpp                |  2 +-
 test/adaptor_test/transformed_example.cpp              |  2 +-
 test/adaptor_test/type_erased_example.cpp              |  2 +-
 test/adaptor_test/uniqued_example.cpp                  |  2 +-
 47 files changed, 67 insertions(+), 67 deletions(-)

diff --git a/doc/html/index.html b/doc/html/index.html
index 9f990d6..2d151ca 100644
--- a/doc/html/index.html
+++ b/doc/html/index.html
@@ -147,7 +147,7 @@
   </p>
 </div>
 <table xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" width="100%"><tr>
-<td align="left"><p><small>Last revised: January 04, 2013 at 00:56:46 GMT</small></p></td>
+<td align="left"><p><small>Last revised: January 04, 2013 at 01:03:02 GMT</small></p></td>
 <td align="right"><div class="copyright-footer"></div></td>
 </tr></table>
 <hr>
diff --git a/doc/html/range/reference/adaptors/reference/adjacent_filtered.html b/doc/html/range/reference/adaptors/reference/adjacent_filtered.html
index f83b737..91772cf 100644
--- a/doc/html/range/reference/adaptors/reference/adjacent_filtered.html
+++ b/doc/html/range/reference/adaptors/reference/adjacent_filtered.html
@@ -112,7 +112,7 @@
 <pre class="programlisting"><span class="preprocessor">#include</span> <span class="special">&lt;</span><span class="identifier">boost</span><span class="special">/</span><span class="identifier">range</span><span class="special">/</span><span class="identifier">adaptor</span><span class="special">/</span><span class="identifier">adjacent_filtered</span><span class="special">.</span><span class="identifier">hpp</span><span class="special">&gt;</span>
 <span class="preprocessor">#include</span> <span class="special">&lt;</span><span class="identifier">boost</span><span class="special">/</span><span class="identifier">range</span><span class="special">/</span><span class="identifier">algorithm</span><span class="special">/</span><span class="identifier">copy</span><span class="special">.</span><span class="identifier">hpp</span><span class="special">&gt;</span>
 <span class="preprocessor">#include</span> <span class="special">&lt;</span><span class="identifier">boost</span><span class="special">/</span><span class="identifier">assign</span><span class="special">.</span><span class="identifier">hpp</span><span class="special">&gt;</span>
-<span class="preprocessor">#include</span> <span class="special">&lt;</span><span class="identifier">algorithm</span><span class="special">&gt;</span>
+<span class="preprocessor">#include</span> <span class="special">&lt;</span><span class="identifier">iterator</span><span class="special">&gt;</span>
 <span class="preprocessor">#include</span> <span class="special">&lt;</span><span class="identifier">functional</span><span class="special">&gt;</span>
 <span class="preprocessor">#include</span> <span class="special">&lt;</span><span class="identifier">iostream</span><span class="special">&gt;</span>
 <span class="preprocessor">#include</span> <span class="special">&lt;</span><span class="identifier">vector</span><span class="special">&gt;</span>
@@ -138,7 +138,7 @@
 <p>
             This would produce the output:
 </p>
-<pre class="programlisting"><span class="number">1</span><span class="special">,</span><span class="number">2</span><span class="special">,</span><span class="number">3</span><span class="special">,</span><span class="number">4</span><span class="special">,</span><span class="number">5</span><span class="special">,</span><span class="number">6</span>
+<pre class="programlisting"><span class="number">1</span><span class="special">,</span><span class="number">2</span><span class="special">,</span><span class="number">3</span><span class="special">,</span><span class="number">4</span><span class="special">,</span><span class="number">5</span><span class="special">,</span><span class="number">6</span><span class="special">,</span>
 </pre>
 <p>
           </p>
diff --git a/doc/html/range/reference/adaptors/reference/copied.html b/doc/html/range/reference/adaptors/reference/copied.html
index 6902098..16ba126 100644
--- a/doc/html/range/reference/adaptors/reference/copied.html
+++ b/doc/html/range/reference/adaptors/reference/copied.html
@@ -109,7 +109,7 @@
 <pre class="programlisting"><span class="preprocessor">#include</span> <span class="special">&lt;</span><span class="identifier">boost</span><span class="special">/</span><span class="identifier">range</span><span class="special">/</span><span class="identifier">adaptor</span><span class="special">/</span><span class="identifier">copied</span><span class="special">.</span><span class="identifier">hpp</span><span class="special">&gt;</span>
 <span class="preprocessor">#include</span> <span class="special">&lt;</span><span class="identifier">boost</span><span class="special">/</span><span class="identifier">range</span><span class="special">/</span><span class="identifier">algorithm</span><span class="special">/</span><span class="identifier">copy</span><span class="special">.</span><span class="identifier">hpp</span><span class="special">&gt;</span>
 <span class="preprocessor">#include</span> <span class="special">&lt;</span><span class="identifier">boost</span><span class="special">/</span><span class="identifier">assign</span><span class="special">.</span><span class="identifier">hpp</span><span class="special">&gt;</span>
-<span class="preprocessor">#include</span> <span class="special">&lt;</span><span class="identifier">algorithm</span><span class="special">&gt;</span>
+<span class="preprocessor">#include</span> <span class="special">&lt;</span><span class="identifier">iterator</span><span class="special">&gt;</span>
 <span class="preprocessor">#include</span> <span class="special">&lt;</span><span class="identifier">iostream</span><span class="special">&gt;</span>
 <span class="preprocessor">#include</span> <span class="special">&lt;</span><span class="identifier">vector</span><span class="special">&gt;</span>
 
@@ -134,7 +134,7 @@
 <p>
             This would produce the output:
 </p>
-<pre class="programlisting"><span class="number">2</span><span class="special">,</span><span class="number">3</span><span class="special">,</span><span class="number">4</span><span class="special">,</span><span class="number">5</span>
+<pre class="programlisting"><span class="number">2</span><span class="special">,</span><span class="number">3</span><span class="special">,</span><span class="number">4</span><span class="special">,</span><span class="number">5</span><span class="special">,</span>
 </pre>
 <p>
           </p>
diff --git a/doc/html/range/reference/adaptors/reference/filtered.html b/doc/html/range/reference/adaptors/reference/filtered.html
index 1930ef4..84c6df2 100644
--- a/doc/html/range/reference/adaptors/reference/filtered.html
+++ b/doc/html/range/reference/adaptors/reference/filtered.html
@@ -112,7 +112,7 @@
 <pre class="programlisting"><span class="preprocessor">#include</span> <span class="special">&lt;</span><span class="identifier">boost</span><span class="special">/</span><span class="identifier">range</span><span class="special">/</span><span class="identifier">adaptor</span><span class="special">/</span><span class="identifier">filtered</span><span class="special">.</span><span class="identifier">hpp</span><span class="special">&gt;</span>
 <span class="preprocessor">#include</span> <span class="special">&lt;</span><span class="identifier">boost</span><span class="special">/</span><span class="identifier">range</span><span class="special">/</span><span class="identifier">algorithm</span><span class="special">/</span><span class="identifier">copy</span><span class="special">.</span><span class="identifier">hpp</span><span class="special">&gt;</span>
 <span class="preprocessor">#include</span> <span class="special">&lt;</span><span class="identifier">boost</span><span class="special">/</span><span class="identifier">assign</span><span class="special">.</span><span class="identifier">hpp</span><span class="special">&gt;</span>
-<span class="preprocessor">#include</span> <span class="special">&lt;</span><span class="identifier">algorithm</span><span class="special">&gt;</span>
+<span class="preprocessor">#include</span> <span class="special">&lt;</span><span class="identifier">iterator</span><span class="special">&gt;</span>
 <span class="preprocessor">#include</span> <span class="special">&lt;</span><span class="identifier">iostream</span><span class="special">&gt;</span>
 <span class="preprocessor">#include</span> <span class="special">&lt;</span><span class="identifier">vector</span><span class="special">&gt;</span>
 
@@ -142,7 +142,7 @@
 <p>
             This would produce the output:
 </p>
-<pre class="programlisting"><span class="number">2</span><span class="special">,</span><span class="number">4</span><span class="special">,</span><span class="number">6</span><span class="special">,</span><span class="number">8</span>
+<pre class="programlisting"><span class="number">2</span><span class="special">,</span><span class="number">4</span><span class="special">,</span><span class="number">6</span><span class="special">,</span><span class="number">8</span><span class="special">,</span>
 </pre>
 <p>
           </p>
diff --git a/doc/html/range/reference/adaptors/reference/indexed.html b/doc/html/range/reference/adaptors/reference/indexed.html
index 1dd722a..4a2d29f 100644
--- a/doc/html/range/reference/adaptors/reference/indexed.html
+++ b/doc/html/range/reference/adaptors/reference/indexed.html
@@ -105,7 +105,7 @@
 <pre class="programlisting"><span class="preprocessor">#include</span> <span class="special">&lt;</span><span class="identifier">boost</span><span class="special">/</span><span class="identifier">range</span><span class="special">/</span><span class="identifier">adaptor</span><span class="special">/</span><span class="identifier">indexed</span><span class="special">.</span><span class="identifier">hpp</span><span class="special">&gt;</span>
 <span class="preprocessor">#include</span> <span class="special">&lt;</span><span class="identifier">boost</span><span class="special">/</span><span class="identifier">range</span><span class="special">/</span><span class="identifier">algorithm</span><span class="special">/</span><span class="identifier">copy</span><span class="special">.</span><span class="identifier">hpp</span><span class="special">&gt;</span>
 <span class="preprocessor">#include</span> <span class="special">&lt;</span><span class="identifier">boost</span><span class="special">/</span><span class="identifier">assign</span><span class="special">.</span><span class="identifier">hpp</span><span class="special">&gt;</span>
-<span class="preprocessor">#include</span> <span class="special">&lt;</span><span class="identifier">algorithm</span><span class="special">&gt;</span>
+<span class="preprocessor">#include</span> <span class="special">&lt;</span><span class="identifier">iterator</span><span class="special">&gt;</span>
 <span class="preprocessor">#include</span> <span class="special">&lt;</span><span class="identifier">iostream</span><span class="special">&gt;</span>
 <span class="preprocessor">#include</span> <span class="special">&lt;</span><span class="identifier">vector</span><span class="special">&gt;</span>
 
diff --git a/doc/html/range/reference/adaptors/reference/indirected.html b/doc/html/range/reference/adaptors/reference/indirected.html
index d185d79..f2ea353 100644
--- a/doc/html/range/reference/adaptors/reference/indirected.html
+++ b/doc/html/range/reference/adaptors/reference/indirected.html
@@ -108,7 +108,7 @@
 <pre class="programlisting"><span class="preprocessor">#include</span> <span class="special">&lt;</span><span class="identifier">boost</span><span class="special">/</span><span class="identifier">range</span><span class="special">/</span><span class="identifier">adaptor</span><span class="special">/</span><span class="identifier">indirected</span><span class="special">.</span><span class="identifier">hpp</span><span class="special">&gt;</span>
 <span class="preprocessor">#include</span> <span class="special">&lt;</span><span class="identifier">boost</span><span class="special">/</span><span class="identifier">range</span><span class="special">/</span><span class="identifier">algorithm</span><span class="special">/</span><span class="identifier">copy</span><span class="special">.</span><span class="identifier">hpp</span><span class="special">&gt;</span>
 <span class="preprocessor">#include</span> <span class="special">&lt;</span><span class="identifier">boost</span><span class="special">/</span><span class="identifier">shared_ptr</span><span class="special">.</span><span class="identifier">hpp</span><span class="special">&gt;</span>
-<span class="preprocessor">#include</span> <span class="special">&lt;</span><span class="identifier">algorithm</span><span class="special">&gt;</span>
+<span class="preprocessor">#include</span> <span class="special">&lt;</span><span class="identifier">iterator</span><span class="special">&gt;</span>
 <span class="preprocessor">#include</span> <span class="special">&lt;</span><span class="identifier">iostream</span><span class="special">&gt;</span>
 <span class="preprocessor">#include</span> <span class="special">&lt;</span><span class="identifier">vector</span><span class="special">&gt;</span>
 
@@ -134,7 +134,7 @@
 <p>
             This would produce the output:
 </p>
-<pre class="programlisting"><span class="number">0</span><span class="special">,</span><span class="number">1</span><span class="special">,</span><span class="number">2</span><span class="special">,</span><span class="number">3</span><span class="special">,</span><span class="number">4</span><span class="special">,</span><span class="number">5</span><span class="special">,</span><span class="number">6</span><span class="special">,</span><span class="number">7</span><span class="special">,</span><span class="number">8</span><span class="special">,</span><span class="number">9</span>
+<pre class="programlisting"><span class="number">0</span><span class="special">,</span><span class="number">1</span><span class="special">,</span><span class="number">2</span><span class="special">,</span><span class="number">3</span><span class="special">,</span><span class="number">4</span><span class="special">,</span><span class="number">5</span><span class="special">,</span><span class="number">6</span><span class="special">,</span><span class="number">7</span><span class="special">,</span><span class="number">8</span><span class="special">,</span><span class="number">9</span><span class="special">,</span>
 </pre>
 <p>
           </p>
diff --git a/doc/html/range/reference/adaptors/reference/map_keys.html b/doc/html/range/reference/adaptors/reference/map_keys.html
index 58c164f..c7f05a3 100644
--- a/doc/html/range/reference/adaptors/reference/map_keys.html
+++ b/doc/html/range/reference/adaptors/reference/map_keys.html
@@ -107,7 +107,7 @@
 <pre class="programlisting"><span class="preprocessor">#include</span> <span class="special">&lt;</span><span class="identifier">boost</span><span class="special">/</span><span class="identifier">range</span><span class="special">/</span><span class="identifier">adaptor</span><span class="special">/</span><span class="identifier">map</span><span class="special">.</span><span class="identifier">hpp</span><span class="special">&gt;</span>
 <span class="preprocessor">#include</span> <span class="special">&lt;</span><span class="identifier">boost</span><span class="special">/</span><span class="identifier">range</span><span class="special">/</span><span class="identifier">algorithm</span><span class="special">/</span><span class="identifier">copy</span><span class="special">.</span><span class="identifier">hpp</span><span class="special">&gt;</span>
 <span class="preprocessor">#include</span> <span class="special">&lt;</span><span class="identifier">boost</span><span class="special">/</span><span class="identifier">assign</span><span class="special">.</span><span class="identifier">hpp</span><span class="special">&gt;</span>
-<span class="preprocessor">#include</span> <span class="special">&lt;</span><span class="identifier">algorithm</span><span class="special">&gt;</span>
+<span class="preprocessor">#include</span> <span class="special">&lt;</span><span class="identifier">iterator</span><span class="special">&gt;</span>
 <span class="preprocessor">#include</span> <span class="special">&lt;</span><span class="identifier">iostream</span><span class="special">&gt;</span>
 <span class="preprocessor">#include</span> <span class="special">&lt;</span><span class="identifier">map</span><span class="special">&gt;</span>
 <span class="preprocessor">#include</span> <span class="special">&lt;</span><span class="identifier">vector</span><span class="special">&gt;</span>
@@ -134,7 +134,7 @@
 <p>
             This would produce the output:
 </p>
-<pre class="programlisting"><span class="number">0</span><span class="special">,</span><span class="number">1</span><span class="special">,</span><span class="number">2</span><span class="special">,</span><span class="number">3</span><span class="special">,</span><span class="number">4</span><span class="special">,</span><span class="number">5</span><span class="special">,</span><span class="number">6</span><span class="special">,</span><span class="number">7</span><span class="special">,</span><span class="number">8</span><span class="special">,</span><span class="number">9</span>
+<pre class="programlisting"><span class="number">0</span><span class="special">,</span><span class="number">1</span><span class="special">,</span><span class="number">2</span><span class="special">,</span><span class="number">3</span><span class="special">,</span><span class="number">4</span><span class="special">,</span><span class="number">5</span><span class="special">,</span><span class="number">6</span><span class="special">,</span><span class="number">7</span><span class="special">,</span><span class="number">8</span><span class="special">,</span><span class="number">9</span><span class="special">,</span>
 </pre>
 <p>
           </p>
diff --git a/doc/html/range/reference/adaptors/reference/map_values.html b/doc/html/range/reference/adaptors/reference/map_values.html
index d467ffb..22008da 100644
--- a/doc/html/range/reference/adaptors/reference/map_values.html
+++ b/doc/html/range/reference/adaptors/reference/map_values.html
@@ -109,7 +109,7 @@
 <pre class="programlisting"><span class="preprocessor">#include</span> <span class="special">&lt;</span><span class="identifier">boost</span><span class="special">/</span><span class="identifier">range</span><span class="special">/</span><span class="identifier">adaptor</span><span class="special">/</span><span class="identifier">map</span><span class="special">.</span><span class="identifier">hpp</span><span class="special">&gt;</span>
 <span class="preprocessor">#include</span> <span class="special">&lt;</span><span class="identifier">boost</span><span class="special">/</span><span class="identifier">range</span><span class="special">/</span><span class="identifier">algorithm</span><span class="special">/</span><span class="identifier">copy</span><span class="special">.</span><span class="identifier">hpp</span><span class="special">&gt;</span>
 <span class="preprocessor">#include</span> <span class="special">&lt;</span><span class="identifier">boost</span><span class="special">/</span><span class="identifier">assign</span><span class="special">.</span><span class="identifier">hpp</span><span class="special">&gt;</span>
-<span class="preprocessor">#include</span> <span class="special">&lt;</span><span class="identifier">algorithm</span><span class="special">&gt;</span>
+<span class="preprocessor">#include</span> <span class="special">&lt;</span><span class="identifier">iterator</span><span class="special">&gt;</span>
 <span class="preprocessor">#include</span> <span class="special">&lt;</span><span class="identifier">iostream</span><span class="special">&gt;</span>
 <span class="preprocessor">#include</span> <span class="special">&lt;</span><span class="identifier">map</span><span class="special">&gt;</span>
 <span class="preprocessor">#include</span> <span class="special">&lt;</span><span class="identifier">vector</span><span class="special">&gt;</span>
@@ -136,7 +136,7 @@
 <p>
             This would produce the output:
 </p>
-<pre class="programlisting"><span class="number">0</span><span class="special">,</span><span class="number">10</span><span class="special">,</span><span class="number">20</span><span class="special">,</span><span class="number">30</span><span class="special">,</span><span class="number">40</span><span class="special">,</span><span class="number">50</span><span class="special">,</span><span class="number">60</span><span class="special">,</span><span class="number">70</span><span class="special">,</span><span class="number">80</span><span class="special">,</span><span class="number">90</span>
+<pre class="programlisting"><span class="number">0</span><span class="special">,</span><span class="number">10</span><span class="special">,</span><span class="number">20</span><span class="special">,</span><span class="number">30</span><span class="special">,</span><span class="number">40</span><span class="special">,</span><span class="number">50</span><span class="special">,</span><span class="number">60</span><span class="special">,</span><span class="number">70</span><span class="special">,</span><span class="number">80</span><span class="special">,</span><span class="number">90</span><span class="special">,</span>
 </pre>
 <p>
           </p>
diff --git a/doc/html/range/reference/adaptors/reference/replaced.html b/doc/html/range/reference/adaptors/reference/replaced.html
index a0fc28e..d70b2d5 100644
--- a/doc/html/range/reference/adaptors/reference/replaced.html
+++ b/doc/html/range/reference/adaptors/reference/replaced.html
@@ -125,7 +125,7 @@
 <pre class="programlisting"><span class="preprocessor">#include</span> <span class="special">&lt;</span><span class="identifier">boost</span><span class="special">/</span><span class="identifier">range</span><span class="special">/</span><span class="identifier">adaptor</span><span class="special">/</span><span class="identifier">replaced</span><span class="special">.</span><span class="identifier">hpp</span><span class="special">&gt;</span>
 <span class="preprocessor">#include</span> <span class="special">&lt;</span><span class="identifier">boost</span><span class="special">/</span><span class="identifier">range</span><span class="special">/</span><span class="identifier">algorithm</span><span class="special">/</span><span class="identifier">copy</span><span class="special">.</span><span class="identifier">hpp</span><span class="special">&gt;</span>
 <span class="preprocessor">#include</span> <span class="special">&lt;</span><span class="identifier">boost</span><span class="special">/</span><span class="identifier">assign</span><span class="special">.</span><span class="identifier">hpp</span><span class="special">&gt;</span>
-<span class="preprocessor">#include</span> <span class="special">&lt;</span><span class="identifier">algorithm</span><span class="special">&gt;</span>
+<span class="preprocessor">#include</span> <span class="special">&lt;</span><span class="identifier">iterator</span><span class="special">&gt;</span>
 <span class="preprocessor">#include</span> <span class="special">&lt;</span><span class="identifier">iostream</span><span class="special">&gt;</span>
 <span class="preprocessor">#include</span> <span class="special">&lt;</span><span class="identifier">vector</span><span class="special">&gt;</span>
 
@@ -150,7 +150,7 @@
 <p>
             This would produce the output:
 </p>
-<pre class="programlisting"><span class="number">1</span><span class="special">,</span><span class="number">10</span><span class="special">,</span><span class="number">3</span><span class="special">,</span><span class="number">10</span><span class="special">,</span><span class="number">5</span><span class="special">,</span><span class="number">10</span><span class="special">,</span><span class="number">7</span><span class="special">,</span><span class="number">10</span><span class="special">,</span><span class="number">9</span>
+<pre class="programlisting"><span class="number">1</span><span class="special">,</span><span class="number">10</span><span class="special">,</span><span class="number">3</span><span class="special">,</span><span class="number">10</span><span class="special">,</span><span class="number">5</span><span class="special">,</span><span class="number">10</span><span class="special">,</span><span class="number">7</span><span class="special">,</span><span class="number">10</span><span class="special">,</span><span class="number">9</span><span class="special">,</span>
 </pre>
 <p>
           </p>
diff --git a/doc/html/range/reference/adaptors/reference/replaced_if.html b/doc/html/range/reference/adaptors/reference/replaced_if.html
index 05b26b3..e5363d3 100644
--- a/doc/html/range/reference/adaptors/reference/replaced_if.html
+++ b/doc/html/range/reference/adaptors/reference/replaced_if.html
@@ -121,7 +121,7 @@
 <pre class="programlisting"><span class="preprocessor">#include</span> <span class="special">&lt;</span><span class="identifier">boost</span><span class="special">/</span><span class="identifier">range</span><span class="special">/</span><span class="identifier">adaptor</span><span class="special">/</span><span class="identifier">replaced_if</span><span class="special">.</span><span class="identifier">hpp</span><span class="special">&gt;</span>
 <span class="preprocessor">#include</span> <span class="special">&lt;</span><span class="identifier">boost</span><span class="special">/</span><span class="identifier">range</span><span class="special">/</span><span class="identifier">algorithm</span><span class="special">/</span><span class="identifier">copy</span><span class="special">.</span><span class="identifier">hpp</span><span class="special">&gt;</span>
 <span class="preprocessor">#include</span> <span class="special">&lt;</span><span class="identifier">boost</span><span class="special">/</span><span class="identifier">assign</span><span class="special">.</span><span class="identifier">hpp</span><span class="special">&gt;</span>
-<span class="preprocessor">#include</span> <span class="special">&lt;</span><span class="identifier">algorithm</span><span class="special">&gt;</span>
+<span class="preprocessor">#include</span> <span class="special">&lt;</span><span class="identifier">iterator</span><span class="special">&gt;</span>
 <span class="preprocessor">#include</span> <span class="special">&lt;</span><span class="identifier">iostream</span><span class="special">&gt;</span>
 <span class="preprocessor">#include</span> <span class="special">&lt;</span><span class="identifier">vector</span><span class="special">&gt;</span>
 
@@ -151,7 +151,7 @@
 <p>
             This would produce the output:
 </p>
-<pre class="programlisting"><span class="number">1</span><span class="special">,</span><span class="number">10</span><span class="special">,</span><span class="number">3</span><span class="special">,</span><span class="number">10</span><span class="special">,</span><span class="number">5</span><span class="special">,</span><span class="number">10</span><span class="special">,</span><span class="number">7</span><span class="special">,</span><span class="number">10</span><span class="special">,</span><span class="number">9</span>
+<pre class="programlisting"><span class="number">1</span><span class="special">,</span><span class="number">10</span><span class="special">,</span><span class="number">3</span><span class="special">,</span><span class="number">10</span><span class="special">,</span><span class="number">5</span><span class="special">,</span><span class="number">10</span><span class="special">,</span><span class="number">7</span><span class="special">,</span><span class="number">10</span><span class="special">,</span><span class="number">9</span><span class="special">,</span>
 </pre>
 <p>
           </p>
diff --git a/doc/html/range/reference/adaptors/reference/reversed.html b/doc/html/range/reference/adaptors/reference/reversed.html
index fa07854..ab61716 100644
--- a/doc/html/range/reference/adaptors/reference/reversed.html
+++ b/doc/html/range/reference/adaptors/reference/reversed.html
@@ -100,7 +100,7 @@
 <pre class="programlisting"><span class="preprocessor">#include</span> <span class="special">&lt;</span><span class="identifier">boost</span><span class="special">/</span><span class="identifier">range</span><span class="special">/</span><span class="identifier">adaptor</span><span class="special">/</span><span class="identifier">reversed</span><span class="special">.</span><span class="identifier">hpp</span><span class="special">&gt;</span>
 <span class="preprocessor">#include</span> <span class="special">&lt;</span><span class="identifier">boost</span><span class="special">/</span><span class="identifier">range</span><span class="special">/</span><span class="identifier">algorithm</span><span class="special">/</span><span class="identifier">copy</span><span class="special">.</span><span class="identifier">hpp</span><span class="special">&gt;</span>
 <span class="preprocessor">#include</span> <span class="special">&lt;</span><span class="identifier">boost</span><span class="special">/</span><span class="identifier">assign</span><span class="special">.</span><span class="identifier">hpp</span><span class="special">&gt;</span>
-<span class="preprocessor">#include</span> <span class="special">&lt;</span><span class="identifier">algorithm</span><span class="special">&gt;</span>
+<span class="preprocessor">#include</span> <span class="special">&lt;</span><span class="identifier">iterator</span><span class="special">&gt;</span>
 <span class="preprocessor">#include</span> <span class="special">&lt;</span><span class="identifier">iostream</span><span class="special">&gt;</span>
 <span class="preprocessor">#include</span> <span class="special">&lt;</span><span class="identifier">vector</span><span class="special">&gt;</span>
 
@@ -125,7 +125,7 @@
 <p>
             This would produce the output:
 </p>
-<pre class="programlisting"><span class="number">9</span><span class="special">,</span><span class="number">8</span><span class="special">,</span><span class="number">7</span><span class="special">,</span><span class="number">6</span><span class="special">,</span><span class="number">5</span><span class="special">,</span><span class="number">4</span><span class="special">,</span><span class="number">3</span><span class="special">,</span><span class="number">2</span><span class="special">,</span><span class="number">1</span>
+<pre class="programlisting"><span class="number">9</span><span class="special">,</span><span class="number">8</span><span class="special">,</span><span class="number">7</span><span class="special">,</span><span class="number">6</span><span class="special">,</span><span class="number">5</span><span class="special">,</span><span class="number">4</span><span class="special">,</span><span class="number">3</span><span class="special">,</span><span class="number">2</span><span class="special">,</span><span class="number">1</span><span class="special">,</span>
 </pre>
 <p>
           </p>
diff --git a/doc/html/range/reference/adaptors/reference/sliced.html b/doc/html/range/reference/adaptors/reference/sliced.html
index 1f4e63d..664ee47 100644
--- a/doc/html/range/reference/adaptors/reference/sliced.html
+++ b/doc/html/range/reference/adaptors/reference/sliced.html
@@ -110,7 +110,7 @@
 <pre class="programlisting"><span class="preprocessor">#include</span> <span class="special">&lt;</span><span class="identifier">boost</span><span class="special">/</span><span class="identifier">range</span><span class="special">/</span><span class="identifier">adaptor</span><span class="special">/</span><span class="identifier">sliced</span><span class="special">.</span><span class="identifier">hpp</span><span class="special">&gt;</span>
 <span class="preprocessor">#include</span> <span class="special">&lt;</span><span class="identifier">boost</span><span class="special">/</span><span class="identifier">range</span><span class="special">/</span><span class="identifier">algorithm</span><span class="special">/</span><span class="identifier">copy</span><span class="special">.</span><span class="identifier">hpp</span><span class="special">&gt;</span>
 <span class="preprocessor">#include</span> <span class="special">&lt;</span><span class="identifier">boost</span><span class="special">/</span><span class="identifier">assign</span><span class="special">.</span><span class="identifier">hpp</span><span class="special">&gt;</span>
-<span class="preprocessor">#include</span> <span class="special">&lt;</span><span class="identifier">algorithm</span><span class="special">&gt;</span>
+<span class="preprocessor">#include</span> <span class="special">&lt;</span><span class="identifier">iterator</span><span class="special">&gt;</span>
 <span class="preprocessor">#include</span> <span class="special">&lt;</span><span class="identifier">iostream</span><span class="special">&gt;</span>
 <span class="preprocessor">#include</span> <span class="special">&lt;</span><span class="identifier">vector</span><span class="special">&gt;</span>
 
@@ -135,7 +135,7 @@
 <p>
             This would produce the output:
 </p>
-<pre class="programlisting"><span class="number">3</span><span class="special">,</span><span class="number">4</span><span class="special">,</span><span class="number">5</span>
+<pre class="programlisting"><span class="number">3</span><span class="special">,</span><span class="number">4</span><span class="special">,</span><span class="number">5</span><span class="special">,</span>
 </pre>
 <p>
           </p>
diff --git a/doc/html/range/reference/adaptors/reference/strided.html b/doc/html/range/reference/adaptors/reference/strided.html
index 8ff19e1..b16af14 100644
--- a/doc/html/range/reference/adaptors/reference/strided.html
+++ b/doc/html/range/reference/adaptors/reference/strided.html
@@ -102,7 +102,7 @@
 <pre class="programlisting"><span class="preprocessor">#include</span> <span class="special">&lt;</span><span class="identifier">boost</span><span class="special">/</span><span class="identifier">range</span><span class="special">/</span><span class="identifier">adaptor</span><span class="special">/</span><span class="identifier">strided</span><span class="special">.</span><span class="identifier">hpp</span><span class="special">&gt;</span>
 <span class="preprocessor">#include</span> <span class="special">&lt;</span><span class="identifier">boost</span><span class="special">/</span><span class="identifier">range</span><span class="special">/</span><span class="identifier">algorithm</span><span class="special">/</span><span class="identifier">copy</span><span class="special">.</span><span class="identifier">hpp</span><span class="special">&gt;</span>
 <span class="preprocessor">#include</span> <span class="special">&lt;</span><span class="identifier">boost</span><span class="special">/</span><span class="identifier">assign</span><span class="special">.</span><span class="identifier">hpp</span><span class="special">&gt;</span>
-<span class="preprocessor">#include</span> <span class="special">&lt;</span><span class="identifier">algorithm</span><span class="special">&gt;</span>
+<span class="preprocessor">#include</span> <span class="special">&lt;</span><span class="identifier">iterator</span><span class="special">&gt;</span>
 <span class="preprocessor">#include</span> <span class="special">&lt;</span><span class="identifier">iostream</span><span class="special">&gt;</span>
 <span class="preprocessor">#include</span> <span class="special">&lt;</span><span class="identifier">vector</span><span class="special">&gt;</span>
 
@@ -127,7 +127,7 @@
 <p>
             This would produce the output:
 </p>
-<pre class="programlisting"><span class="number">1</span><span class="special">,</span><span class="number">3</span><span class="special">,</span><span class="number">5</span><span class="special">,</span><span class="number">7</span><span class="special">,</span><span class="number">9</span>
+<pre class="programlisting"><span class="number">1</span><span class="special">,</span><span class="number">3</span><span class="special">,</span><span class="number">5</span><span class="special">,</span><span class="number">7</span><span class="special">,</span><span class="number">9</span><span class="special">,</span>
 </pre>
 <p>
           </p>
diff --git a/doc/html/range/reference/adaptors/reference/tokenized.html b/doc/html/range/reference/adaptors/reference/tokenized.html
index 80396f0..ec50b79 100644
--- a/doc/html/range/reference/adaptors/reference/tokenized.html
+++ b/doc/html/range/reference/adaptors/reference/tokenized.html
@@ -144,7 +144,7 @@
 <pre class="programlisting"><span class="preprocessor">#include</span> <span class="special">&lt;</span><span class="identifier">boost</span><span class="special">/</span><span class="identifier">range</span><span class="special">/</span><span class="identifier">adaptor</span><span class="special">/</span><span class="identifier">tokenized</span><span class="special">.</span><span class="identifier">hpp</span><span class="special">&gt;</span>
 <span class="preprocessor">#include</span> <span class="special">&lt;</span><span class="identifier">boost</span><span class="special">/</span><span class="identifier">range</span><span class="special">/</span><span class="identifier">algorithm</span><span class="special">/</span><span class="identifier">copy</span><span class="special">.</span><span class="identifier">hpp</span><span class="special">&gt;</span>
 <span class="preprocessor">#include</span> <span class="special">&lt;</span><span class="identifier">boost</span><span class="special">/</span><span class="identifier">assign</span><span class="special">.</span><span class="identifier">hpp</span><span class="special">&gt;</span>
-<span class="preprocessor">#include</span> <span class="special">&lt;</span><span class="identifier">algorithm</span><span class="special">&gt;</span>
+<span class="preprocessor">#include</span> <span class="special">&lt;</span><span class="identifier">iterator</span><span class="special">&gt;</span>
 <span class="preprocessor">#include</span> <span class="special">&lt;</span><span class="identifier">iostream</span><span class="special">&gt;</span>
 <span class="preprocessor">#include</span> <span class="special">&lt;</span><span class="identifier">vector</span><span class="special">&gt;</span>
 
diff --git a/doc/html/range/reference/adaptors/reference/transformed.html b/doc/html/range/reference/adaptors/reference/transformed.html
index 9a272b0..5f38ed5 100644
--- a/doc/html/range/reference/adaptors/reference/transformed.html
+++ b/doc/html/range/reference/adaptors/reference/transformed.html
@@ -113,7 +113,7 @@
 <pre class="programlisting"><span class="preprocessor">#include</span> <span class="special">&lt;</span><span class="identifier">boost</span><span class="special">/</span><span class="identifier">range</span><span class="special">/</span><span class="identifier">adaptor</span><span class="special">/</span><span class="identifier">transformed</span><span class="special">.</span><span class="identifier">hpp</span><span class="special">&gt;</span>
 <span class="preprocessor">#include</span> <span class="special">&lt;</span><span class="identifier">boost</span><span class="special">/</span><span class="identifier">range</span><span class="special">/</span><span class="identifier">algorithm</span><span class="special">/</span><span class="identifier">copy</span><span class="special">.</span><span class="identifier">hpp</span><span class="special">&gt;</span>
 <span class="preprocessor">#include</span> <span class="special">&lt;</span><span class="identifier">boost</span><span class="special">/</span><span class="identifier">assign</span><span class="special">.</span><span class="identifier">hpp</span><span class="special">&gt;</span>
-<span class="preprocessor">#include</span> <span class="special">&lt;</span><span class="identifier">algorithm</span><span class="special">&gt;</span>
+<span class="preprocessor">#include</span> <span class="special">&lt;</span><span class="identifier">iterator</span><span class="special">&gt;</span>
 <span class="preprocessor">#include</span> <span class="special">&lt;</span><span class="identifier">iostream</span><span class="special">&gt;</span>
 <span class="preprocessor">#include</span> <span class="special">&lt;</span><span class="identifier">vector</span><span class="special">&gt;</span>
 
@@ -144,7 +144,7 @@
 <p>
             This would produce the output:
 </p>
-<pre class="programlisting"><span class="number">2</span><span class="special">,</span><span class="number">4</span><span class="special">,</span><span class="number">6</span><span class="special">,</span><span class="number">8</span><span class="special">,</span><span class="number">10</span><span class="special">,</span><span class="number">12</span><span class="special">,</span><span class="number">14</span><span class="special">,</span><span class="number">16</span><span class="special">,</span><span class="number">18</span><span class="special">,</span><span class="number">20</span>
+<pre class="programlisting"><span class="number">2</span><span class="special">,</span><span class="number">4</span><span class="special">,</span><span class="number">6</span><span class="special">,</span><span class="number">8</span><span class="special">,</span><span class="number">10</span><span class="special">,</span><span class="number">12</span><span class="special">,</span><span class="number">14</span><span class="special">,</span><span class="number">16</span><span class="special">,</span><span class="number">18</span><span class="special">,</span><span class="number">20</span><span class="special">,</span>
 </pre>
 <p>
           </p>
diff --git a/doc/html/range/reference/adaptors/reference/type_erased.html b/doc/html/range/reference/adaptors/reference/type_erased.html
index 20430be..f0a5ce6 100644
--- a/doc/html/range/reference/adaptors/reference/type_erased.html
+++ b/doc/html/range/reference/adaptors/reference/type_erased.html
@@ -190,7 +190,7 @@
 <span class="preprocessor">#include</span> <span class="special">&lt;</span><span class="identifier">boost</span><span class="special">/</span><span class="identifier">range</span><span class="special">/</span><span class="identifier">algorithm</span><span class="special">/</span><span class="identifier">copy</span><span class="special">.</span><span class="identifier">hpp</span><span class="special">&gt;</span>
 <span class="preprocessor">#include</span> <span class="special">&lt;</span><span class="identifier">boost</span><span class="special">/</span><span class="identifier">assign</span><span class="special">.</span><span class="identifier">hpp</span><span class="special">&gt;</span>
 <span class="preprocessor">#include</span> <span class="special">&lt;</span><span class="identifier">boost</span><span class="special">/</span><span class="identifier">foreach</span><span class="special">.</span><span class="identifier">hpp</span><span class="special">&gt;</span>
-<span class="preprocessor">#include</span> <span class="special">&lt;</span><span class="identifier">algorithm</span><span class="special">&gt;</span>
+<span class="preprocessor">#include</span> <span class="special">&lt;</span><span class="identifier">iterator</span><span class="special">&gt;</span>
 <span class="preprocessor">#include</span> <span class="special">&lt;</span><span class="identifier">iostream</span><span class="special">&gt;</span>
 <span class="preprocessor">#include</span> <span class="special">&lt;</span><span class="identifier">list</span><span class="special">&gt;</span>
 <span class="preprocessor">#include</span> <span class="special">&lt;</span><span class="identifier">vector</span><span class="special">&gt;</span>
@@ -279,10 +279,10 @@
 <p>
             This would produce the output:
 </p>
-<pre class="programlisting"><span class="number">1</span><span class="special">,</span><span class="number">2</span><span class="special">,</span><span class="number">3</span><span class="special">,</span><span class="number">4</span><span class="special">,</span><span class="number">5</span>
-<span class="number">6</span><span class="special">,</span><span class="number">7</span><span class="special">,</span><span class="number">8</span><span class="special">,</span><span class="number">9</span><span class="special">,</span><span class="number">10</span>
-<span class="number">11</span><span class="special">,</span><span class="number">12</span><span class="special">,</span><span class="number">13</span><span class="special">,</span><span class="number">14</span><span class="special">,</span><span class="number">15</span>
-<span class="number">11</span><span class="special">,</span><span class="number">12</span><span class="special">,</span><span class="number">13</span><span class="special">,</span><span class="number">14</span><span class="special">,</span><span class="number">15</span>
+<pre class="programlisting"><span class="number">1</span><span class="special">,</span><span class="number">2</span><span class="special">,</span><span class="number">3</span><span class="special">,</span><span class="number">4</span><span class="special">,</span><span class="number">5</span><span class="special">,</span>
+<span class="number">6</span><span class="special">,</span><span class="number">7</span><span class="special">,</span><span class="number">8</span><span class="special">,</span><span class="number">9</span><span class="special">,</span><span class="number">10</span><span class="special">,</span>
+<span class="number">11</span><span class="special">,</span><span class="number">12</span><span class="special">,</span><span class="number">13</span><span class="special">,</span><span class="number">14</span><span class="special">,</span><span class="number">15</span><span class="special">,</span>
+<span class="number">11</span><span class="special">,</span><span class="number">12</span><span class="special">,</span><span class="number">13</span><span class="special">,</span><span class="number">14</span><span class="special">,</span><span class="number">15</span><span class="special">,</span>
 </pre>
 <p>
           </p>
diff --git a/doc/html/range/reference/adaptors/reference/uniqued.html b/doc/html/range/reference/adaptors/reference/uniqued.html
index 2f2a430..cf3b672 100644
--- a/doc/html/range/reference/adaptors/reference/uniqued.html
+++ b/doc/html/range/reference/adaptors/reference/uniqued.html
@@ -105,7 +105,7 @@
 <pre class="programlisting"><span class="preprocessor">#include</span> <span class="special">&lt;</span><span class="identifier">boost</span><span class="special">/</span><span class="identifier">range</span><span class="special">/</span><span class="identifier">adaptor</span><span class="special">/</span><span class="identifier">uniqued</span><span class="special">.</span><span class="identifier">hpp</span><span class="special">&gt;</span>
 <span class="preprocessor">#include</span> <span class="special">&lt;</span><span class="identifier">boost</span><span class="special">/</span><span class="identifier">range</span><span class="special">/</span><span class="identifier">algorithm</span><span class="special">/</span><span class="identifier">copy</span><span class="special">.</span><span class="identifier">hpp</span><span class="special">&gt;</span>
 <span class="preprocessor">#include</span> <span class="special">&lt;</span><span class="identifier">boost</span><span class="special">/</span><span class="identifier">assign</span><span class="special">.</span><span class="identifier">hpp</span><span class="special">&gt;</span>
-<span class="preprocessor">#include</span> <span class="special">&lt;</span><span class="identifier">algorithm</span><span class="special">&gt;</span>
+<span class="preprocessor">#include</span> <span class="special">&lt;</span><span class="identifier">iterator</span><span class="special">&gt;</span>
 <span class="preprocessor">#include</span> <span class="special">&lt;</span><span class="identifier">iostream</span><span class="special">&gt;</span>
 <span class="preprocessor">#include</span> <span class="special">&lt;</span><span class="identifier">vector</span><span class="special">&gt;</span>
 
@@ -130,7 +130,7 @@
 <p>
             This would produce the output:
 </p>
-<pre class="programlisting"><span class="number">1</span><span class="special">,</span><span class="number">2</span><span class="special">,</span><span class="number">3</span><span class="special">,</span><span class="number">4</span><span class="special">,</span><span class="number">5</span><span class="special">,</span><span class="number">6</span>
+<pre class="programlisting"><span class="number">1</span><span class="special">,</span><span class="number">2</span><span class="special">,</span><span class="number">3</span><span class="special">,</span><span class="number">4</span><span class="special">,</span><span class="number">5</span><span class="special">,</span><span class="number">6</span><span class="special">,</span>
 </pre>
 <p>
           </p>
diff --git a/doc/reference/adaptors/adjacent_filtered.qbk b/doc/reference/adaptors/adjacent_filtered.qbk
index 076b691..f8b4289 100644
--- a/doc/reference/adaptors/adjacent_filtered.qbk
+++ b/doc/reference/adaptors/adjacent_filtered.qbk
@@ -25,7 +25,7 @@
 
 This would produce the output:
 ``
-1,2,3,4,5,6
+1,2,3,4,5,6,
 ``
 [endsect]
 
diff --git a/doc/reference/adaptors/copied.qbk b/doc/reference/adaptors/copied.qbk
index e38bf26..2a8abcc 100644
--- a/doc/reference/adaptors/copied.qbk
+++ b/doc/reference/adaptors/copied.qbk
@@ -23,7 +23,7 @@
 
 This would produce the output:
 ``
-2,3,4,5
+2,3,4,5,
 ``
 [endsect]
 
diff --git a/doc/reference/adaptors/filtered.qbk b/doc/reference/adaptors/filtered.qbk
index a6c7924..3f84c94 100644
--- a/doc/reference/adaptors/filtered.qbk
+++ b/doc/reference/adaptors/filtered.qbk
@@ -25,7 +25,7 @@
 
 This would produce the output:
 ``
-2,4,6,8
+2,4,6,8,
 ``
 [endsect]
 
diff --git a/doc/reference/adaptors/indirected.qbk b/doc/reference/adaptors/indirected.qbk
index c44c70d..437a547 100644
--- a/doc/reference/adaptors/indirected.qbk
+++ b/doc/reference/adaptors/indirected.qbk
@@ -24,7 +24,7 @@
 
 This would produce the output:
 ``
-0,1,2,3,4,5,6,7,8,9
+0,1,2,3,4,5,6,7,8,9,
 ``
 [endsect]
 
diff --git a/doc/reference/adaptors/map_keys.qbk b/doc/reference/adaptors/map_keys.qbk
index 8ead02b..f9fbb9a 100644
--- a/doc/reference/adaptors/map_keys.qbk
+++ b/doc/reference/adaptors/map_keys.qbk
@@ -24,7 +24,7 @@
 
 This would produce the output:
 ``
-0,1,2,3,4,5,6,7,8,9
+0,1,2,3,4,5,6,7,8,9,
 ``
 [endsect]
 
diff --git a/doc/reference/adaptors/map_values.qbk b/doc/reference/adaptors/map_values.qbk
index 658e4ff..7941f47 100644
--- a/doc/reference/adaptors/map_values.qbk
+++ b/doc/reference/adaptors/map_values.qbk
@@ -24,7 +24,7 @@
 
 This would produce the output:
 ``
-0,10,20,30,40,50,60,70,80,90
+0,10,20,30,40,50,60,70,80,90,
 ``
 [endsect]
 
diff --git a/doc/reference/adaptors/replaced.qbk b/doc/reference/adaptors/replaced.qbk
index 00285eb..aae4ece 100644
--- a/doc/reference/adaptors/replaced.qbk
+++ b/doc/reference/adaptors/replaced.qbk
@@ -26,7 +26,7 @@
 
 This would produce the output:
 ``
-1,10,3,10,5,10,7,10,9
+1,10,3,10,5,10,7,10,9,
 ``
 [endsect]
 
diff --git a/doc/reference/adaptors/replaced_if.qbk b/doc/reference/adaptors/replaced_if.qbk
index 81a92e6..f00c46a 100644
--- a/doc/reference/adaptors/replaced_if.qbk
+++ b/doc/reference/adaptors/replaced_if.qbk
@@ -26,7 +26,7 @@
 
 This would produce the output:
 ``
-1,10,3,10,5,10,7,10,9
+1,10,3,10,5,10,7,10,9,
 ``
 [endsect]
 
diff --git a/doc/reference/adaptors/reversed.qbk b/doc/reference/adaptors/reversed.qbk
index 392fd7a..42f8e73 100644
--- a/doc/reference/adaptors/reversed.qbk
+++ b/doc/reference/adaptors/reversed.qbk
@@ -23,7 +23,7 @@
 
 This would produce the output:
 ``
-9,8,7,6,5,4,3,2,1
+9,8,7,6,5,4,3,2,1,
 ``
 [endsect]
 
diff --git a/doc/reference/adaptors/sliced.qbk b/doc/reference/adaptors/sliced.qbk
index 39f3387..e67ae30 100644
--- a/doc/reference/adaptors/sliced.qbk
+++ b/doc/reference/adaptors/sliced.qbk
@@ -24,7 +24,7 @@
 
 This would produce the output:
 ``
-3,4,5
+3,4,5,
 ``
 [endsect]
 
diff --git a/doc/reference/adaptors/strided.qbk b/doc/reference/adaptors/strided.qbk
index a94822c..a672e3d 100644
--- a/doc/reference/adaptors/strided.qbk
+++ b/doc/reference/adaptors/strided.qbk
@@ -23,7 +23,7 @@
 
 This would produce the output:
 ``
-1,3,5,7,9
+1,3,5,7,9,
 ``
 [endsect]
 
diff --git a/doc/reference/adaptors/transformed.qbk b/doc/reference/adaptors/transformed.qbk
index 5bb9828..c53cfd7 100644
--- a/doc/reference/adaptors/transformed.qbk
+++ b/doc/reference/adaptors/transformed.qbk
@@ -25,7 +25,7 @@
 
 This would produce the output:
 ``
-2,4,6,8,10,12,14,16,18,20
+2,4,6,8,10,12,14,16,18,20,
 ``
 [endsect]
 
diff --git a/doc/reference/adaptors/type_erased.qbk b/doc/reference/adaptors/type_erased.qbk
index be547d3..e55ff66 100644
--- a/doc/reference/adaptors/type_erased.qbk
+++ b/doc/reference/adaptors/type_erased.qbk
@@ -55,10 +55,10 @@ public:
 
 This would produce the output:
 ``
-1,2,3,4,5
-6,7,8,9,10
-11,12,13,14,15
-11,12,13,14,15
+1,2,3,4,5,
+6,7,8,9,10,
+11,12,13,14,15,
+11,12,13,14,15,
 ``
 [endsect]
 
diff --git a/doc/reference/adaptors/uniqued.qbk b/doc/reference/adaptors/uniqued.qbk
index 7df92f4..5b8e7f2 100644
--- a/doc/reference/adaptors/uniqued.qbk
+++ b/doc/reference/adaptors/uniqued.qbk
@@ -24,7 +24,7 @@
 
 This would produce the output:
 ``
-1,2,3,4,5,6
+1,2,3,4,5,6,
 ``
 [endsect]
 
diff --git a/test/adaptor_test/adjacent_filtered_example.cpp b/test/adaptor_test/adjacent_filtered_example.cpp
index 4611c83..83f7a8a 100644
--- a/test/adaptor_test/adjacent_filtered_example.cpp
+++ b/test/adaptor_test/adjacent_filtered_example.cpp
@@ -12,7 +12,7 @@
 #include <boost/range/adaptor/adjacent_filtered.hpp>
 #include <boost/range/algorithm/copy.hpp>
 #include <boost/assign.hpp>
-#include <algorithm>
+#include <iterator>
 #include <functional>
 #include <iostream>
 #include <vector>
diff --git a/test/adaptor_test/copied_example.cpp b/test/adaptor_test/copied_example.cpp
index 963ad87..c1d0e31 100644
--- a/test/adaptor_test/copied_example.cpp
+++ b/test/adaptor_test/copied_example.cpp
@@ -12,7 +12,7 @@
 #include <boost/range/adaptor/copied.hpp>
 #include <boost/range/algorithm/copy.hpp>
 #include <boost/assign.hpp>
-#include <algorithm>
+#include <iterator>
 #include <iostream>
 #include <vector>
 
diff --git a/test/adaptor_test/filtered_example.cpp b/test/adaptor_test/filtered_example.cpp
index 668aba8..e16d0af 100644
--- a/test/adaptor_test/filtered_example.cpp
+++ b/test/adaptor_test/filtered_example.cpp
@@ -12,7 +12,7 @@
 #include <boost/range/adaptor/filtered.hpp>
 #include <boost/range/algorithm/copy.hpp>
 #include <boost/assign.hpp>
-#include <algorithm>
+#include <iterator>
 #include <iostream>
 #include <vector>
 
diff --git a/test/adaptor_test/indexed_example.cpp b/test/adaptor_test/indexed_example.cpp
index f921e3f..1bcbf9c 100644
--- a/test/adaptor_test/indexed_example.cpp
+++ b/test/adaptor_test/indexed_example.cpp
@@ -12,7 +12,7 @@
 #include <boost/range/adaptor/indexed.hpp>
 #include <boost/range/algorithm/copy.hpp>
 #include <boost/assign.hpp>
-#include <algorithm>
+#include <iterator>
 #include <iostream>
 #include <vector>
 
diff --git a/test/adaptor_test/indirected_example.cpp b/test/adaptor_test/indirected_example.cpp
index 2828f15..8b538b5 100644
--- a/test/adaptor_test/indirected_example.cpp
+++ b/test/adaptor_test/indirected_example.cpp
@@ -12,7 +12,7 @@
 #include <boost/range/adaptor/indirected.hpp>
 #include <boost/range/algorithm/copy.hpp>
 #include <boost/shared_ptr.hpp>
-#include <algorithm>
+#include <iterator>
 #include <iostream>
 #include <vector>
 
diff --git a/test/adaptor_test/map_keys_example.cpp b/test/adaptor_test/map_keys_example.cpp
index a506e1a..99f8505 100644
--- a/test/adaptor_test/map_keys_example.cpp
+++ b/test/adaptor_test/map_keys_example.cpp
@@ -12,7 +12,7 @@
 #include <boost/range/adaptor/map.hpp>
 #include <boost/range/algorithm/copy.hpp>
 #include <boost/assign.hpp>
-#include <algorithm>
+#include <iterator>
 #include <iostream>
 #include <map>
 #include <vector>
diff --git a/test/adaptor_test/map_values_example.cpp b/test/adaptor_test/map_values_example.cpp
index 6821004..bfa533f 100644
--- a/test/adaptor_test/map_values_example.cpp
+++ b/test/adaptor_test/map_values_example.cpp
@@ -12,7 +12,7 @@
 #include <boost/range/adaptor/map.hpp>
 #include <boost/range/algorithm/copy.hpp>
 #include <boost/assign.hpp>
-#include <algorithm>
+#include <iterator>
 #include <iostream>
 #include <map>
 #include <vector>
diff --git a/test/adaptor_test/replaced_example.cpp b/test/adaptor_test/replaced_example.cpp
index fdb21aa..8e1f114 100644
--- a/test/adaptor_test/replaced_example.cpp
+++ b/test/adaptor_test/replaced_example.cpp
@@ -12,7 +12,7 @@
 #include <boost/range/adaptor/replaced.hpp>
 #include <boost/range/algorithm/copy.hpp>
 #include <boost/assign.hpp>
-#include <algorithm>
+#include <iterator>
 #include <iostream>
 #include <vector>
 
diff --git a/test/adaptor_test/replaced_if_example.cpp b/test/adaptor_test/replaced_if_example.cpp
index 58b8427..05b5e78 100644
--- a/test/adaptor_test/replaced_if_example.cpp
+++ b/test/adaptor_test/replaced_if_example.cpp
@@ -12,7 +12,7 @@
 #include <boost/range/adaptor/replaced_if.hpp>
 #include <boost/range/algorithm/copy.hpp>
 #include <boost/assign.hpp>
-#include <algorithm>
+#include <iterator>
 #include <iostream>
 #include <vector>
 
diff --git a/test/adaptor_test/reversed_example.cpp b/test/adaptor_test/reversed_example.cpp
index d176e84..585108f 100644
--- a/test/adaptor_test/reversed_example.cpp
+++ b/test/adaptor_test/reversed_example.cpp
@@ -12,7 +12,7 @@
 #include <boost/range/adaptor/reversed.hpp>
 #include <boost/range/algorithm/copy.hpp>
 #include <boost/assign.hpp>
-#include <algorithm>
+#include <iterator>
 #include <iostream>
 #include <vector>
 
diff --git a/test/adaptor_test/sliced_example.cpp b/test/adaptor_test/sliced_example.cpp
index 39b14bf..2b15691 100644
--- a/test/adaptor_test/sliced_example.cpp
+++ b/test/adaptor_test/sliced_example.cpp
@@ -12,7 +12,7 @@
 #include <boost/range/adaptor/sliced.hpp>
 #include <boost/range/algorithm/copy.hpp>
 #include <boost/assign.hpp>
-#include <algorithm>
+#include <iterator>
 #include <iostream>
 #include <vector>
 
diff --git a/test/adaptor_test/strided_example.cpp b/test/adaptor_test/strided_example.cpp
index a94fbbf..b1f8b42 100644
--- a/test/adaptor_test/strided_example.cpp
+++ b/test/adaptor_test/strided_example.cpp
@@ -12,7 +12,7 @@
 #include <boost/range/adaptor/strided.hpp>
 #include <boost/range/algorithm/copy.hpp>
 #include <boost/assign.hpp>
-#include <algorithm>
+#include <iterator>
 #include <iostream>
 #include <vector>
 
diff --git a/test/adaptor_test/tokenized_example.cpp b/test/adaptor_test/tokenized_example.cpp
index 243e47f..5f59bb1 100644
--- a/test/adaptor_test/tokenized_example.cpp
+++ b/test/adaptor_test/tokenized_example.cpp
@@ -12,7 +12,7 @@
 #include <boost/range/adaptor/tokenized.hpp>
 #include <boost/range/algorithm/copy.hpp>
 #include <boost/assign.hpp>
-#include <algorithm>
+#include <iterator>
 #include <iostream>
 #include <vector>
 
diff --git a/test/adaptor_test/transformed_example.cpp b/test/adaptor_test/transformed_example.cpp
index 109302b..ff4a689 100644
--- a/test/adaptor_test/transformed_example.cpp
+++ b/test/adaptor_test/transformed_example.cpp
@@ -12,7 +12,7 @@
 #include <boost/range/adaptor/transformed.hpp>
 #include <boost/range/algorithm/copy.hpp>
 #include <boost/assign.hpp>
-#include <algorithm>
+#include <iterator>
 #include <iostream>
 #include <vector>
 
diff --git a/test/adaptor_test/type_erased_example.cpp b/test/adaptor_test/type_erased_example.cpp
index 0d17eff..f8416ae 100644
--- a/test/adaptor_test/type_erased_example.cpp
+++ b/test/adaptor_test/type_erased_example.cpp
@@ -13,7 +13,7 @@
 #include <boost/range/algorithm/copy.hpp>
 #include <boost/assign.hpp>
 #include <boost/foreach.hpp>
-#include <algorithm>
+#include <iterator>
 #include <iostream>
 #include <list>
 #include <vector>
diff --git a/test/adaptor_test/uniqued_example.cpp b/test/adaptor_test/uniqued_example.cpp
index 184ff2d..cf1407a 100644
--- a/test/adaptor_test/uniqued_example.cpp
+++ b/test/adaptor_test/uniqued_example.cpp
@@ -12,7 +12,7 @@
 #include <boost/range/adaptor/uniqued.hpp>
 #include <boost/range/algorithm/copy.hpp>
 #include <boost/assign.hpp>
-#include <algorithm>
+#include <iterator>
 #include <iostream>
 #include <vector>
 

From f228ab608abadaf54b70d87070f4a06ab6798f7d Mon Sep 17 00:00:00 2001
From: Nathan Ridge <zeratul976@hotmail.com>
Date: Mon, 14 Jan 2013 09:04:57 +0000
Subject: [PATCH 31/41] [range] fixed #7866 (minor typo in docs)

[SVN r82486]
---
 doc/headers.qbk                     | 2 +-
 doc/html/index.html                 | 2 +-
 doc/html/range/headers/general.html | 2 +-
 3 files changed, 3 insertions(+), 3 deletions(-)

diff --git a/doc/headers.qbk b/doc/headers.qbk
index 0012c6a..3107018 100644
--- a/doc/headers.qbk
+++ b/doc/headers.qbk
@@ -8,7 +8,7 @@
 [section:general General]
 [table
     [[Header                              ] [Includes                   ] [Related Concept         ]]
-    [[`<boost/range.hpp>`                 ] [everything from Boost.Range version 1 (Boost versions 1.42 and below). Includes the core range functions and metafunctinos, but excludes Range Adaptors and Range Algorithms. ] [-                       ]]
+    [[`<boost/range.hpp>`                 ] [everything from Boost.Range version 1 (Boost versions 1.42 and below). Includes the core range functions and metafunctions, but excludes Range Adaptors and Range Algorithms. ] [-                       ]]
     [[`<boost/range/metafunctions.hpp>`   ] [every metafunction         ] [-                       ]]
     [[`<boost/range/functions.hpp>`       ] [every function             ] [-                       ]]
     [[`<boost/range/value_type.hpp>`      ] [__range_value__            ] [__single_pass_range__   ]]
diff --git a/doc/html/index.html b/doc/html/index.html
index 2d151ca..301224a 100644
--- a/doc/html/index.html
+++ b/doc/html/index.html
@@ -147,7 +147,7 @@
   </p>
 </div>
 <table xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" width="100%"><tr>
-<td align="left"><p><small>Last revised: January 04, 2013 at 01:03:02 GMT</small></p></td>
+<td align="left"><p><small>Last revised: January 14, 2013 at 08:50:06 GMT</small></p></td>
 <td align="right"><div class="copyright-footer"></div></td>
 </tr></table>
 <hr>
diff --git a/doc/html/range/headers/general.html b/doc/html/range/headers/general.html
index 7020f7a..c4abe19 100644
--- a/doc/html/range/headers/general.html
+++ b/doc/html/range/headers/general.html
@@ -59,7 +59,7 @@
 <td>
                 <p>
                   everything from Boost.Range version 1 (Boost versions 1.42 and
-                  below). Includes the core range functions and metafunctinos, but
+                  below). Includes the core range functions and metafunctions, but
                   excludes Range Adaptors and Range Algorithms.
                 </p>
               </td>

From 45a1acb980edb99fd19cba62b0821001eb7379e3 Mon Sep 17 00:00:00 2001
From: Nathan Ridge <zeratul976@hotmail.com>
Date: Thu, 24 Jan 2013 09:10:47 +0000
Subject: [PATCH 32/41] [range] fix some minor typos in comments - fixes #7916

[SVN r82594]
---
 include/boost/range/detail/any_iterator.hpp             | 2 +-
 include/boost/range/detail/collection_traits_detail.hpp | 8 ++++----
 include/boost/range/empty.hpp                           | 2 +-
 include/boost/range/irange.hpp                          | 2 +-
 include/boost/range/iterator_range_io.hpp               | 4 ++--
 test/adaptor_test/strided.cpp                           | 2 +-
 test/adl_conformance.cpp                                | 2 +-
 test/algorithm_example.cpp                              | 4 ++--
 test/algorithm_ext_test/push_front.cpp                  | 2 +-
 test/array.cpp                                          | 2 +-
 test/begin.cpp                                          | 2 +-
 test/const_ranges.cpp                                   | 2 +-
 test/end.cpp                                            | 2 +-
 test/extension_mechanism.cpp                            | 2 +-
 test/extension_size.cpp                                 | 2 +-
 test/iterator_pair.cpp                                  | 2 +-
 test/iterator_range.cpp                                 | 4 ++--
 test/partial_workaround.cpp                             | 2 +-
 test/reversible_range.cpp                               | 2 +-
 test/std_container.cpp                                  | 2 +-
 test/string.cpp                                         | 2 +-
 test/sub_range.cpp                                      | 2 +-
 22 files changed, 28 insertions(+), 28 deletions(-)
 mode change 100755 => 100644 include/boost/range/detail/collection_traits_detail.hpp
 mode change 100755 => 100644 include/boost/range/empty.hpp
 mode change 100755 => 100644 include/boost/range/iterator_range_io.hpp
 mode change 100755 => 100644 test/algorithm_example.cpp
 mode change 100755 => 100644 test/array.cpp
 mode change 100755 => 100644 test/partial_workaround.cpp

diff --git a/include/boost/range/detail/any_iterator.hpp b/include/boost/range/detail/any_iterator.hpp
index 42991cc..b45058e 100644
--- a/include/boost/range/detail/any_iterator.hpp
+++ b/include/boost/range/detail/any_iterator.hpp
@@ -558,7 +558,7 @@ namespace boost
                 }
 
                 // If this is a non-null iterator then we need to put
-                // a clone of this iterators impementation into the other
+                // a clone of this iterators implementation into the other
                 // iterator.
                 // We can't just swap because of the small buffer optimization.
                 if (m_impl)
diff --git a/include/boost/range/detail/collection_traits_detail.hpp b/include/boost/range/detail/collection_traits_detail.hpp
old mode 100755
new mode 100644
index 44fbde0..93652b5
--- a/include/boost/range/detail/collection_traits_detail.hpp
+++ b/include/boost/range/detail/collection_traits_detail.hpp
@@ -208,7 +208,7 @@ namespace boost {
 
             // array traits ( no partial specialization )
             /*
-                without parial specialization we are able to
+                without partial specialization we are able to
                 provide support only for a limited number of
                 types. Currently the primitive numeric types 
                 are supported
@@ -324,14 +324,14 @@ namespace boost {
 
 #endif // BOOST_NO_TEMPLATE_PARTIAL_SPECIALIZATION
             
-            // array lenght resolving
+            // array length resolving
             /*
                 Lenght of string contained in a static array could
                 be different from the size of the array.
-                For string processing we need the lenght without
+                For string processing we need the length without
                 terminating 0.
 
-                Therefore, the lenght is calulated for char and wchar_t
+                Therefore, the length is calculated for char and wchar_t
                 using char_traits, rather then simply returning
                 the array size.
             */
diff --git a/include/boost/range/empty.hpp b/include/boost/range/empty.hpp
old mode 100755
new mode 100644
index 78c4e85..36e58d7
--- a/include/boost/range/empty.hpp
+++ b/include/boost/range/empty.hpp
@@ -28,7 +28,7 @@ namespace boost
         return boost::begin( r ) == boost::end( r );
     }
 
-} // namepace 'boost'
+} // namespace 'boost'
 
 
 #endif
diff --git a/include/boost/range/irange.hpp b/include/boost/range/irange.hpp
index 3b5a6cc..248124f 100644
--- a/include/boost/range/irange.hpp
+++ b/include/boost/range/irange.hpp
@@ -100,7 +100,7 @@ namespace boost
         // While this design is less performant than some less
         // safe alternatives, the use of ranges and iterators to
         // perform counting will never be optimal anyhow, hence
-        // if optimal performance is desired a handcoded loop
+        // if optimal performance is desired a hand-coded loop
         // is the solution.
         template<typename Integer>
         class integer_iterator_with_step
diff --git a/include/boost/range/iterator_range_io.hpp b/include/boost/range/iterator_range_io.hpp
old mode 100755
new mode 100644
index 51e3a4f..8c29400
--- a/include/boost/range/iterator_range_io.hpp
+++ b/include/boost/range/iterator_range_io.hpp
@@ -48,7 +48,7 @@ namespace boost
 
         //! iterator_range output operator
         /*!
-            Output the range to an ostream. Elements are outputed
+            Output the range to an ostream. Elements are outputted
             in a sequence without separators.
         */
         template< typename IteratorT, typename Elem, typename Traits >
@@ -67,7 +67,7 @@ namespace boost
 
         //! iterator_range output operator
         /*!
-            Output the range to an ostream. Elements are outputed
+            Output the range to an ostream. Elements are outputted
             in a sequence without separators.
         */
         template< typename IteratorT >
diff --git a/test/adaptor_test/strided.cpp b/test/adaptor_test/strided.cpp
index 1198a10..aa80068 100644
--- a/test/adaptor_test/strided.cpp
+++ b/test/adaptor_test/strided.cpp
@@ -9,7 +9,7 @@
 // For more information, see http://www.boost.org/libs/range/
 //
 // The strided_defect_Trac5014 test case is a modified version of a test case
-// contribued by Michel Morin as part of the trac ticket.
+// contributed by Michel Morin as part of the trac ticket.
 //
 #include <boost/range/adaptor/strided.hpp>
 
diff --git a/test/adl_conformance.cpp b/test/adl_conformance.cpp
index 277c183..8bae491 100644
--- a/test/adl_conformance.cpp
+++ b/test/adl_conformance.cpp
@@ -11,7 +11,7 @@
 #include <boost/detail/workaround.hpp>
 
 #if BOOST_WORKAROUND(__BORLANDC__, BOOST_TESTED_AT(0x564))
-#  pragma warn -8091 // supress warning in Boost.Test
+#  pragma warn -8091 // suppress warning in Boost.Test
 #  pragma warn -8057 // unused argument argc/argv in Boost.Test
 #endif
 
diff --git a/test/algorithm_example.cpp b/test/algorithm_example.cpp
old mode 100755
new mode 100644
index 85e2b22..80c7875
--- a/test/algorithm_example.cpp
+++ b/test/algorithm_example.cpp
@@ -11,7 +11,7 @@
 #include <boost/detail/workaround.hpp>
 
 #if BOOST_WORKAROUND(__BORLANDC__, BOOST_TESTED_AT(0x564))
-#  pragma warn -8091 // supress warning in Boost.Test
+#  pragma warn -8091 // suppress warning in Boost.Test
 #  pragma warn -8057 // unused argument argc/argv in Boost.Test
 #endif
 
@@ -27,7 +27,7 @@
 namespace
 {
     //
-    // example: extrating bounds in a generic algorithm
+    // example: extracting bounds in a generic algorithm
     //
     template< typename Range, typename T >
     inline typename boost::range_iterator<Range>::type
diff --git a/test/algorithm_ext_test/push_front.cpp b/test/algorithm_ext_test/push_front.cpp
index a5f5fb9..071a7ce 100644
--- a/test/algorithm_ext_test/push_front.cpp
+++ b/test/algorithm_ext_test/push_front.cpp
@@ -43,7 +43,7 @@ namespace
         BOOST_CHECK_EQUAL_COLLECTIONS( reference.begin(), reference.end(),
             test.begin(), test.end() );
 
-        // copy the orignal reference sequence
+        // copy the original reference sequence
         Container reference_copy(reference);
         std::transform(reference.begin(), reference.end(), reference.begin(), DoubleValue());
 
diff --git a/test/array.cpp b/test/array.cpp
old mode 100755
new mode 100644
index b438dce..b913fde
--- a/test/array.cpp
+++ b/test/array.cpp
@@ -12,7 +12,7 @@
 #include <boost/detail/workaround.hpp>
 
 #if BOOST_WORKAROUND(__BORLANDC__, BOOST_TESTED_AT(0x564))
-#  pragma warn -8091 // supress warning in Boost.Test
+#  pragma warn -8091 // suppress warning in Boost.Test
 #  pragma warn -8057 // unused argument argc/argv in Boost.Test
 #endif
 
diff --git a/test/begin.cpp b/test/begin.cpp
index bbc11c1..f014535 100644
--- a/test/begin.cpp
+++ b/test/begin.cpp
@@ -11,7 +11,7 @@
 #include <boost/detail/workaround.hpp>
 
 #if BOOST_WORKAROUND(__BORLANDC__, BOOST_TESTED_AT(0x564))
-#  pragma warn -8091 // supress warning in Boost.Test
+#  pragma warn -8091 // suppress warning in Boost.Test
 #  pragma warn -8057 // unused argument argc/argv in Boost.Test
 #endif
 
diff --git a/test/const_ranges.cpp b/test/const_ranges.cpp
index cd0b06a..22bf83c 100644
--- a/test/const_ranges.cpp
+++ b/test/const_ranges.cpp
@@ -12,7 +12,7 @@
 #include <boost/detail/workaround.hpp>
 
 #if BOOST_WORKAROUND(__BORLANDC__, BOOST_TESTED_AT(0x564))
-#  pragma warn -8091 // supress warning in Boost.Test
+#  pragma warn -8091 // suppress warning in Boost.Test
 #  pragma warn -8057 // unused argument argc/argv in Boost.Test
 #endif
 
diff --git a/test/end.cpp b/test/end.cpp
index 3e989ff..c885555 100644
--- a/test/end.cpp
+++ b/test/end.cpp
@@ -11,7 +11,7 @@
 #include <boost/detail/workaround.hpp>
 
 #if BOOST_WORKAROUND(__BORLANDC__, BOOST_TESTED_AT(0x564))
-#  pragma warn -8091 // supress warning in Boost.Test
+#  pragma warn -8091 // suppress warning in Boost.Test
 #  pragma warn -8057 // unused argument argc/argv in Boost.Test
 #endif
 
diff --git a/test/extension_mechanism.cpp b/test/extension_mechanism.cpp
index 9e9891a..b8b7112 100644
--- a/test/extension_mechanism.cpp
+++ b/test/extension_mechanism.cpp
@@ -12,7 +12,7 @@
 #include <boost/detail/workaround.hpp>
 
 #if BOOST_WORKAROUND(__BORLANDC__, BOOST_TESTED_AT(0x564))
-#  pragma warn -8091 // supress warning in Boost.Test
+#  pragma warn -8091 // suppress warning in Boost.Test
 #  pragma warn -8057 // unused argument argc/argv in Boost.Test
 #endif
 
diff --git a/test/extension_size.cpp b/test/extension_size.cpp
index b6f15cd..6c7157f 100644
--- a/test/extension_size.cpp
+++ b/test/extension_size.cpp
@@ -12,7 +12,7 @@
 #include <boost/detail/workaround.hpp>
 
 #if BOOST_WORKAROUND(__BORLANDC__, BOOST_TESTED_AT(0x564))
-#  pragma warn -8091 // supress warning in Boost.Test
+#  pragma warn -8091 // suppress warning in Boost.Test
 #  pragma warn -8057 // unused argument argc/argv in Boost.Test
 #endif
 
diff --git a/test/iterator_pair.cpp b/test/iterator_pair.cpp
index 495bd6f..997b5fb 100644
--- a/test/iterator_pair.cpp
+++ b/test/iterator_pair.cpp
@@ -11,7 +11,7 @@
 #include <boost/detail/workaround.hpp>
 
 #if BOOST_WORKAROUND(__BORLANDC__, BOOST_TESTED_AT(0x564))
-#  pragma warn -8091 // supress warning in Boost.Test
+#  pragma warn -8091 // suppress warning in Boost.Test
 #  pragma warn -8057 // unused argument argc/argv in Boost.Test
 #endif
 
diff --git a/test/iterator_range.cpp b/test/iterator_range.cpp
index 1d9539b..a53ef16 100644
--- a/test/iterator_range.cpp
+++ b/test/iterator_range.cpp
@@ -13,7 +13,7 @@
 #include <boost/detail/workaround.hpp>
 
 #if BOOST_WORKAROUND(__BORLANDC__, BOOST_TESTED_AT(0x564))
-#  pragma warn -8091 // supress warning in Boost.Test
+#  pragma warn -8091 // suppress warning in Boost.Test
 #  pragma warn -8057 // unused argument argc/argv in Boost.Test
 #endif
 
@@ -235,7 +235,7 @@ boost::unit_test::test_suite* init_unit_test_suite( int argc, char* argv[] )
 
 //
 //
-// Check that constness is propgated correct from
+// Check that constness is propagated correct from
 // the iterator types.
 //
 // Test contributed by Larry Evans.
diff --git a/test/partial_workaround.cpp b/test/partial_workaround.cpp
old mode 100755
new mode 100644
index 76d902f..edaae71
--- a/test/partial_workaround.cpp
+++ b/test/partial_workaround.cpp
@@ -14,7 +14,7 @@
 #include <boost/test/test_tools.hpp>
 
 #if BOOST_WORKAROUND(__BORLANDC__, BOOST_TESTED_AT(0x564))
-#  pragma warn -8091 // supress warning in Boost.Test
+#  pragma warn -8091 // suppress warning in Boost.Test
 #  pragma warn -8057 // unused argument argc/argv in Boost.Test
 #endif
 
diff --git a/test/reversible_range.cpp b/test/reversible_range.cpp
index 98cc423..a3dd20c 100644
--- a/test/reversible_range.cpp
+++ b/test/reversible_range.cpp
@@ -12,7 +12,7 @@
 #include <boost/detail/workaround.hpp>
 
 #if BOOST_WORKAROUND(__BORLANDC__, BOOST_TESTED_AT(0x564))
-#  pragma warn -8091 // supress warning in Boost.Test
+#  pragma warn -8091 // suppress warning in Boost.Test
 #  pragma warn -8057 // unused argument argc/argv in Boost.Test
 #endif
 
diff --git a/test/std_container.cpp b/test/std_container.cpp
index 9b8f284..75a584f 100644
--- a/test/std_container.cpp
+++ b/test/std_container.cpp
@@ -12,7 +12,7 @@
 #include <boost/detail/workaround.hpp>
 
 #if BOOST_WORKAROUND(__BORLANDC__, BOOST_TESTED_AT(0x564))
-#  pragma warn -8091 // supress warning in Boost.Test
+#  pragma warn -8091 // suppress warning in Boost.Test
 #  pragma warn -8057 // unused argument argc/argv in Boost.Test
 #endif
 
diff --git a/test/string.cpp b/test/string.cpp
index f838519..9ff13f9 100644
--- a/test/string.cpp
+++ b/test/string.cpp
@@ -13,7 +13,7 @@
 #include <boost/detail/workaround.hpp>
 
 #if BOOST_WORKAROUND(__BORLANDC__, BOOST_TESTED_AT(0x564))
-#  pragma warn -8091 // supress warning in Boost.Test
+#  pragma warn -8091 // suppress warning in Boost.Test
 #  pragma warn -8057 // unused argument argc/argv in Boost.Test
 #endif
 
diff --git a/test/sub_range.cpp b/test/sub_range.cpp
index 80c942f..e0a8330 100644
--- a/test/sub_range.cpp
+++ b/test/sub_range.cpp
@@ -12,7 +12,7 @@
 #include <boost/detail/workaround.hpp>
 
 #if BOOST_WORKAROUND(__BORLANDC__, BOOST_TESTED_AT(0x564))
-#  pragma warn -8091 // supress warning in Boost.Test
+#  pragma warn -8091 // suppress warning in Boost.Test
 #  pragma warn -8057 // unused argument argc/argv in Boost.Test
 #endif
 

From 4971da58eef4b46fb34e0a1183ff23bf58592bcb Mon Sep 17 00:00:00 2001
From: Nathan Ridge <zeratul976@hotmail.com>
Date: Sat, 26 Jan 2013 03:59:06 +0000
Subject: [PATCH 33/41] [range] fixed #7926 (missing prototypes for lower_bound
 and upper_bound in docs)

[SVN r82621]
---
 doc/html/index.html                           |  2 +-
 .../algorithms/non_mutating/lower_bound.html  | 22 ++++++++++++++++++-
 .../algorithms/non_mutating/upper_bound.html  | 22 ++++++++++++++++++-
 doc/reference/algorithm/lower_bound.qbk       | 22 ++++++++++++++++++-
 doc/reference/algorithm/upper_bound.qbk       | 22 ++++++++++++++++++-
 5 files changed, 85 insertions(+), 5 deletions(-)

diff --git a/doc/html/index.html b/doc/html/index.html
index 301224a..b2cadbe 100644
--- a/doc/html/index.html
+++ b/doc/html/index.html
@@ -147,7 +147,7 @@
   </p>
 </div>
 <table xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" width="100%"><tr>
-<td align="left"><p><small>Last revised: January 14, 2013 at 08:50:06 GMT</small></p></td>
+<td align="left"><p><small>Last revised: January 26, 2013 at 03:49:11 GMT</small></p></td>
 <td align="right"><div class="copyright-footer"></div></td>
 </tr></table>
 <hr>
diff --git a/doc/html/range/reference/algorithms/non_mutating/lower_bound.html b/doc/html/range/reference/algorithms/non_mutating/lower_bound.html
index e3065cc..5bd4414 100644
--- a/doc/html/range/reference/algorithms/non_mutating/lower_bound.html
+++ b/doc/html/range/reference/algorithms/non_mutating/lower_bound.html
@@ -32,7 +32,10 @@
           </h6>
 <p>
 </p>
-<pre class="programlisting"><span class="keyword">template</span><span class="special">&lt;</span><span class="keyword">class</span> <span class="identifier">ForwardRange</span><span class="special">,</span> <span class="keyword">class</span> <span class="identifier">Value</span><span class="special">&gt;</span>
+<pre class="programlisting"><span class="keyword">template</span><span class="special">&lt;</span>
+    <span class="keyword">class</span> <span class="identifier">ForwardRange</span><span class="special">,</span>
+    <span class="keyword">class</span> <span class="identifier">Value</span>
+    <span class="special">&gt;</span>
 <span class="keyword">typename</span> <span class="identifier">range_iterator</span><span class="special">&lt;</span><span class="identifier">ForwardRange</span><span class="special">&gt;::</span><span class="identifier">type</span>
 <span class="identifier">lower_bound</span><span class="special">(</span><span class="identifier">ForwardRange</span><span class="special">&amp;</span> <span class="identifier">rng</span><span class="special">,</span> <span class="identifier">Value</span> <span class="identifier">val</span><span class="special">);</span>
 
@@ -43,6 +46,23 @@
     <span class="special">&gt;</span>
 <span class="keyword">typename</span> <span class="identifier">range_return</span><span class="special">&lt;</span><span class="identifier">ForwardRange</span><span class="special">,</span> <span class="identifier">re</span><span class="special">&gt;::</span><span class="identifier">type</span>
 <span class="identifier">lower_bound</span><span class="special">(</span><span class="identifier">ForwardRange</span><span class="special">&amp;</span> <span class="identifier">rng</span><span class="special">,</span> <span class="identifier">Value</span> <span class="identifier">val</span><span class="special">);</span>
+
+<span class="keyword">template</span><span class="special">&lt;</span>
+    <span class="keyword">class</span> <span class="identifier">ForwardRange</span><span class="special">,</span>
+    <span class="keyword">class</span> <span class="identifier">Value</span><span class="special">,</span>
+    <span class="keyword">class</span> <span class="identifier">SortPredicate</span>
+    <span class="special">&gt;</span>
+<span class="keyword">typename</span> <span class="identifier">range_iterator</span><span class="special">&lt;</span><span class="identifier">ForwardRange</span><span class="special">&gt;::</span><span class="identifier">type</span>
+<span class="identifier">lower_bound</span><span class="special">(</span><span class="identifier">ForwardRange</span><span class="special">&amp;</span> <span class="identifier">rng</span><span class="special">,</span> <span class="identifier">Value</span> <span class="identifier">val</span><span class="special">,</span> <span class="identifier">SortPredicate</span> <span class="identifier">pred</span><span class="special">);</span>
+
+<span class="keyword">template</span><span class="special">&lt;</span>
+    <span class="identifier">range_return_value</span> <span class="identifier">re</span><span class="special">,</span>
+    <span class="keyword">class</span> <span class="identifier">ForwardRange</span><span class="special">,</span>
+    <span class="keyword">class</span> <span class="identifier">Value</span><span class="special">,</span>
+    <span class="keyword">class</span> <span class="identifier">SortPredicate</span>
+    <span class="special">&gt;</span>
+<span class="keyword">typename</span> <span class="identifier">range_return</span><span class="special">&lt;</span><span class="identifier">ForwardRange</span><span class="special">,</span><span class="identifier">re</span><span class="special">&gt;::</span><span class="identifier">type</span>
+<span class="identifier">lower_bound</span><span class="special">(</span><span class="identifier">ForwardRange</span><span class="special">&amp;</span> <span class="identifier">rng</span><span class="special">,</span> <span class="identifier">Value</span> <span class="identifier">val</span><span class="special">,</span> <span class="identifier">SortPredicate</span> <span class="identifier">pred</span><span class="special">);</span>
 </pre>
 <p>
           </p>
diff --git a/doc/html/range/reference/algorithms/non_mutating/upper_bound.html b/doc/html/range/reference/algorithms/non_mutating/upper_bound.html
index bdc556a..a769f6f 100644
--- a/doc/html/range/reference/algorithms/non_mutating/upper_bound.html
+++ b/doc/html/range/reference/algorithms/non_mutating/upper_bound.html
@@ -32,7 +32,10 @@
           </h6>
 <p>
 </p>
-<pre class="programlisting"><span class="keyword">template</span><span class="special">&lt;</span><span class="keyword">class</span> <span class="identifier">ForwardRange</span><span class="special">,</span> <span class="keyword">class</span> <span class="identifier">Value</span><span class="special">&gt;</span>
+<pre class="programlisting"><span class="keyword">template</span><span class="special">&lt;</span>
+    <span class="keyword">class</span> <span class="identifier">ForwardRange</span><span class="special">,</span>
+    <span class="keyword">class</span> <span class="identifier">Value</span>
+    <span class="special">&gt;</span>
 <span class="keyword">typename</span> <span class="identifier">range_iterator</span><span class="special">&lt;</span><span class="identifier">ForwardRange</span><span class="special">&gt;::</span><span class="identifier">type</span>
 <span class="identifier">upper_bound</span><span class="special">(</span><span class="identifier">ForwardRange</span><span class="special">&amp;</span> <span class="identifier">rng</span><span class="special">,</span> <span class="identifier">Value</span> <span class="identifier">val</span><span class="special">);</span>
 
@@ -43,6 +46,23 @@
     <span class="special">&gt;</span>
 <span class="keyword">typename</span> <span class="identifier">range_return</span><span class="special">&lt;</span><span class="identifier">ForwardRange</span><span class="special">,</span> <span class="identifier">re</span><span class="special">&gt;::</span><span class="identifier">type</span>
 <span class="identifier">upper_bound</span><span class="special">(</span><span class="identifier">ForwardRange</span><span class="special">&amp;</span> <span class="identifier">rng</span><span class="special">,</span> <span class="identifier">Value</span> <span class="identifier">val</span><span class="special">);</span>
+
+<span class="keyword">template</span><span class="special">&lt;</span>
+    <span class="keyword">class</span> <span class="identifier">ForwardRange</span><span class="special">,</span>
+    <span class="keyword">class</span> <span class="identifier">Value</span><span class="special">,</span>
+    <span class="keyword">class</span> <span class="identifier">SortPredicate</span>
+    <span class="special">&gt;</span>
+<span class="keyword">typename</span> <span class="identifier">range_iterator</span><span class="special">&lt;</span><span class="identifier">ForwardRange</span><span class="special">&gt;::</span><span class="identifier">type</span>
+<span class="identifier">upper_bound</span><span class="special">(</span><span class="identifier">ForwardRange</span><span class="special">&amp;</span> <span class="identifier">rng</span><span class="special">,</span> <span class="identifier">Value</span> <span class="identifier">val</span><span class="special">,</span> <span class="identifier">SortPredicate</span> <span class="identifier">pred</span><span class="special">);</span>
+
+<span class="keyword">template</span><span class="special">&lt;</span>
+    <span class="identifier">range_return_value</span> <span class="identifier">re</span><span class="special">,</span>
+    <span class="keyword">class</span> <span class="identifier">ForwardRange</span><span class="special">,</span>
+    <span class="keyword">class</span> <span class="identifier">Value</span><span class="special">,</span>
+    <span class="keyword">class</span> <span class="identifier">SortPredicate</span>
+    <span class="special">&gt;</span>
+<span class="keyword">typename</span> <span class="identifier">range_return</span><span class="special">&lt;</span><span class="identifier">ForwardRange</span><span class="special">,</span><span class="identifier">re</span><span class="special">&gt;::</span><span class="identifier">type</span>
+<span class="identifier">upper_bound</span><span class="special">(</span><span class="identifier">ForwardRange</span><span class="special">&amp;</span> <span class="identifier">rng</span><span class="special">,</span> <span class="identifier">Value</span> <span class="identifier">val</span><span class="special">,</span> <span class="identifier">SortPredicate</span> <span class="identifier">pred</span><span class="special">);</span>
 </pre>
 <p>
           </p>
diff --git a/doc/reference/algorithm/lower_bound.qbk b/doc/reference/algorithm/lower_bound.qbk
index 58ed287..2917d26 100644
--- a/doc/reference/algorithm/lower_bound.qbk
+++ b/doc/reference/algorithm/lower_bound.qbk
@@ -8,7 +8,10 @@
 [heading Prototype]
 
 ``
-template<class ForwardRange, class Value>
+template<
+    class ForwardRange, 
+    class Value
+    >
 typename range_iterator<ForwardRange>::type
 lower_bound(ForwardRange& rng, Value val);
 
@@ -19,6 +22,23 @@ template<
     >
 typename range_return<ForwardRange, re>::type
 lower_bound(ForwardRange& rng, Value val);
+
+template<
+    class ForwardRange,
+    class Value,
+    class SortPredicate
+    >
+typename range_iterator<ForwardRange>::type
+lower_bound(ForwardRange& rng, Value val, SortPredicate pred);
+
+template<
+    range_return_value re,
+    class ForwardRange,
+    class Value,
+    class SortPredicate
+    >
+typename range_return<ForwardRange,re>::type
+lower_bound(ForwardRange& rng, Value val, SortPredicate pred);
 ``
 
 [heading Description]
diff --git a/doc/reference/algorithm/upper_bound.qbk b/doc/reference/algorithm/upper_bound.qbk
index cb79aee..d636a77 100644
--- a/doc/reference/algorithm/upper_bound.qbk
+++ b/doc/reference/algorithm/upper_bound.qbk
@@ -8,7 +8,10 @@
 [heading Prototype]
 
 ``
-template<class ForwardRange, class Value>
+template<
+    class ForwardRange, 
+    class Value
+    >
 typename range_iterator<ForwardRange>::type
 upper_bound(ForwardRange& rng, Value val);
 
@@ -19,6 +22,23 @@ template<
     >
 typename range_return<ForwardRange, re>::type
 upper_bound(ForwardRange& rng, Value val);
+
+template<
+    class ForwardRange,
+    class Value,
+    class SortPredicate
+    >
+typename range_iterator<ForwardRange>::type
+upper_bound(ForwardRange& rng, Value val, SortPredicate pred);
+
+template<
+    range_return_value re,
+    class ForwardRange,
+    class Value,
+    class SortPredicate
+    >
+typename range_return<ForwardRange,re>::type
+upper_bound(ForwardRange& rng, Value val, SortPredicate pred);
 ``
 
 [heading Description]

From fe79a8efdd44de009049be207fb1511b167fafc3 Mon Sep 17 00:00:00 2001
From: Nathan Ridge <zeratul976@hotmail.com>
Date: Wed, 27 Mar 2013 02:16:11 +0000
Subject: [PATCH 34/41] [range] allow iterator_range to be instantiated with a
 pointer to an array as the iterator type (refs #8338)

[SVN r83596]
---
 include/boost/range/iterator_range_core.hpp | 5 ++++-
 test/iterator_range.cpp                     | 5 +++++
 2 files changed, 9 insertions(+), 1 deletion(-)

diff --git a/include/boost/range/iterator_range_core.hpp b/include/boost/range/iterator_range_core.hpp
index 60c7670..6e68992 100644
--- a/include/boost/range/iterator_range_core.hpp
+++ b/include/boost/range/iterator_range_core.hpp
@@ -21,7 +21,9 @@
 #include <boost/assert.hpp>
 #include <boost/iterator/iterator_traits.hpp>
 #include <boost/iterator/iterator_facade.hpp>
+#include <boost/mpl/or.hpp>
 #include <boost/type_traits/is_abstract.hpp>
+#include <boost/type_traits/is_array.hpp>
 #include <boost/type_traits/is_pointer.hpp>
 #include <boost/range/functions.hpp>
 #include <boost/range/iterator.hpp>
@@ -167,7 +169,8 @@ namespace boost
 
         private: // for return value of operator()()
             typedef BOOST_DEDUCED_TYPENAME
-                boost::mpl::if_< boost::is_abstract<value_type>,
+                boost::mpl::if_< boost::mpl::or_< boost::is_abstract< value_type >, 
+                                                  boost::is_array< value_type > >,
                                  reference, value_type >::type abstract_value_type;
 
         public:
diff --git a/test/iterator_range.cpp b/test/iterator_range.cpp
index a53ef16..c914f43 100644
--- a/test/iterator_range.cpp
+++ b/test/iterator_range.cpp
@@ -101,6 +101,11 @@ void check_iterator_range()
     BOOST_CHECK( rrr == str );
 
     check_reference_type();
+    
+    // Check that an iterator range can be instantiated with
+    // a pointer to an array as an iterator.
+    int arr[2][2];
+    boost::make_iterator_range(arr, arr + 2);
 }
 
 namespace iterator_range_test_detail

From 1c18f42e8316dc071c518983fb3ac45bcc301e89 Mon Sep 17 00:00:00 2001
From: Nathan Ridge <zeratul976@hotmail.com>
Date: Thu, 30 May 2013 23:16:51 +0000
Subject: [PATCH 35/41] [range] Use correct iterator concepts when checking
 Boost.Range concepts (refs #6944).

[SVN r84566]
---
 include/boost/range/concepts.hpp |  8 +++---
 test/Jamfile.v2                  |  1 +
 test/ticket_6944.cpp             | 45 ++++++++++++++++++++++++++++++++
 3 files changed, 50 insertions(+), 4 deletions(-)
 create mode 100644 test/ticket_6944.cpp

diff --git a/include/boost/range/concepts.hpp b/include/boost/range/concepts.hpp
index 5965293..5a02a21 100644
--- a/include/boost/range/concepts.hpp
+++ b/include/boost/range/concepts.hpp
@@ -330,8 +330,8 @@ namespace boost {
     struct BidirectionalRangeConcept : ForwardRangeConcept<T>
     {
 #if BOOST_RANGE_ENABLE_CONCEPT_ASSERT
-        BOOST_RANGE_CONCEPT_ASSERT((BidirectionalIteratorConcept<BOOST_DEDUCED_TYPENAME BidirectionalRangeConcept::iterator>));
-        BOOST_RANGE_CONCEPT_ASSERT((BidirectionalIteratorConcept<BOOST_DEDUCED_TYPENAME BidirectionalRangeConcept::const_iterator>));
+        BOOST_RANGE_CONCEPT_ASSERT((range_detail::BidirectionalIteratorConcept<BOOST_DEDUCED_TYPENAME BidirectionalRangeConcept::iterator>));
+        BOOST_RANGE_CONCEPT_ASSERT((range_detail::BidirectionalIteratorConcept<BOOST_DEDUCED_TYPENAME BidirectionalRangeConcept::const_iterator>));
 #endif
     };
 
@@ -348,8 +348,8 @@ namespace boost {
     struct RandomAccessRangeConcept : BidirectionalRangeConcept<T>
     {
 #if BOOST_RANGE_ENABLE_CONCEPT_ASSERT
-        BOOST_RANGE_CONCEPT_ASSERT((RandomAccessIteratorConcept<BOOST_DEDUCED_TYPENAME RandomAccessRangeConcept::iterator>));
-        BOOST_RANGE_CONCEPT_ASSERT((RandomAccessIteratorConcept<BOOST_DEDUCED_TYPENAME RandomAccessRangeConcept::const_iterator>));
+        BOOST_RANGE_CONCEPT_ASSERT((range_detail::RandomAccessIteratorConcept<BOOST_DEDUCED_TYPENAME RandomAccessRangeConcept::iterator>));
+        BOOST_RANGE_CONCEPT_ASSERT((range_detail::RandomAccessIteratorConcept<BOOST_DEDUCED_TYPENAME RandomAccessRangeConcept::const_iterator>));
 #endif
     };
 
diff --git a/test/Jamfile.v2 b/test/Jamfile.v2
index d76c141..bcaa772 100644
--- a/test/Jamfile.v2
+++ b/test/Jamfile.v2
@@ -161,5 +161,6 @@ test-suite range :
 	[ range-test ticket_5544_terminate_irange ]
 	[ range-test ticket_5547 ]
 	[ range-test ticket_5556_is_sorted_namespace ]
+	[ range-test ticket_6944 ]
     ;
 
diff --git a/test/ticket_6944.cpp b/test/ticket_6944.cpp
new file mode 100644
index 0000000..cbf3903
--- /dev/null
+++ b/test/ticket_6944.cpp
@@ -0,0 +1,45 @@
+// Boost.Range library
+//
+//  Copyright Neil Groves 2011. Use, modification and
+//  distribution is subject to the Boost Software License, Version
+//  1.0. (See accompanying file LICENSE_1_0.txt or copy at
+//  http://www.boost.org/LICENSE_1_0.txt)
+//
+//
+// For more information, see http://www.boost.org/libs/range/
+//
+#include <boost/concept_check.hpp>
+#include <boost/iterator/iterator_adaptor.hpp>
+#include <boost/range/concepts.hpp>
+#include <boost/range/iterator_range.hpp>
+
+#include <boost/test/test_tools.hpp>
+#include <boost/test/unit_test.hpp>
+
+#include <vector>
+
+namespace boost
+{
+    namespace
+    {
+        // Ticket 6944 - Some Range concepts use the incorrect Iterator concept
+        typedef std::vector<int>::iterator iter_base;
+        struct iter : boost::iterator_adaptor<iter, iter_base, int, boost::use_default, int> {}; // will be deduced as random-access traversal but input category
+        typedef boost::iterator_range<iter> iter_range;
+        void test_ticket_6944()
+        {
+            BOOST_CONCEPT_ASSERT(( boost::RandomAccessRangeConcept<iter_range> ));
+        }
+    }
+}
+
+boost::unit_test::test_suite*
+init_unit_test_suite(int argc, char* argv[])
+{
+    boost::unit_test::test_suite* test
+        = BOOST_TEST_SUITE( "RangeTestSuite.ticket_6944" );
+
+    test->add( BOOST_TEST_CASE( &boost::test_ticket_6944 ) );
+
+    return test;
+}

From c908e04144aa1926c8de642ed650f04d23901985 Mon Sep 17 00:00:00 2001
From: Nathan Ridge <zeratul976@hotmail.com>
Date: Mon, 3 Jun 2013 09:00:46 +0000
Subject: [PATCH 36/41] [range] Make iterator of 'indexed' adaptor
 default-constructible (refs #7827).

[SVN r84617]
---
 include/boost/range/adaptor/indexed.hpp |  3 +++
 test/adaptor_test/indexed.cpp           |  6 ++++++
 test/test_utils.hpp                     | 24 ++++++++++++++++++++++++
 3 files changed, 33 insertions(+)
 mode change 100755 => 100644 include/boost/range/adaptor/indexed.hpp
 create mode 100644 test/test_utils.hpp

diff --git a/include/boost/range/adaptor/indexed.hpp b/include/boost/range/adaptor/indexed.hpp
old mode 100755
new mode 100644
index 5a523ce..cb2c127
--- a/include/boost/range/adaptor/indexed.hpp
+++ b/include/boost/range/adaptor/indexed.hpp
@@ -55,6 +55,9 @@ namespace boost
             index_type m_index;
 
         public:
+            indexed_iterator()
+            : m_index(index_type()) {}
+            
             explicit indexed_iterator( Iter i, index_type index )
             : base(i), m_index(index)
             {
diff --git a/test/adaptor_test/indexed.cpp b/test/adaptor_test/indexed.cpp
index 2a9c45d..a5bef4d 100644
--- a/test/adaptor_test/indexed.cpp
+++ b/test/adaptor_test/indexed.cpp
@@ -15,11 +15,14 @@
 
 #include <boost/assign.hpp>
 #include <boost/range/algorithm_ext.hpp>
+#include <boost/range/concepts.hpp>
 
 #include <algorithm>
 #include <list>
 #include <vector>
 
+#include "../test_utils.hpp"
+
 namespace boost
 {
     namespace
@@ -83,6 +86,9 @@ namespace boost
         {
             indexed_test_impl< std::vector< int > >();
             indexed_test_impl< std::list< int > >();
+            
+            check_random_access_range_concept(std::vector<int>() | boost::adaptors::indexed(0));
+            check_bidirectional_range_concept(std::list<int>() | boost::adaptors::indexed(0));
         }
     }
 }
diff --git a/test/test_utils.hpp b/test/test_utils.hpp
new file mode 100644
index 0000000..7af920a
--- /dev/null
+++ b/test/test_utils.hpp
@@ -0,0 +1,24 @@
+// Boost.Range library
+//
+//  Copyright Akira Takahashi 2013. Use, modification and
+//  distribution is subject to the Boost Software License, Version
+//  1.0. (See accompanying file LICENSE_1_0.txt or copy at
+//  http://www.boost.org/LICENSE_1_0.txt)
+//
+//
+// For more information, see http://www.boost.org/libs/range/
+//
+
+#include <boost/range/concepts.hpp>
+
+template <class RandomAccessRng>
+void check_random_access_range_concept(const RandomAccessRng& rng)
+{
+    BOOST_RANGE_CONCEPT_ASSERT(( boost::RandomAccessRangeConcept<RandomAccessRng> ));
+}
+
+template <class BidirectionalRng>
+void check_bidirectional_range_concept(const BidirectionalRng& rng)
+{
+    BOOST_RANGE_CONCEPT_ASSERT(( boost::BidirectionalRangeConcept<BidirectionalRng> ));
+}

From 991bd7f8be558b8ff5e2d293328595cf396e49c2 Mon Sep 17 00:00:00 2001
From: Nathan Ridge <zeratul976@hotmail.com>
Date: Wed, 5 Jun 2013 00:42:41 +0000
Subject: [PATCH 37/41] [range] Fixed a failing test on gcc 4.2 (refs #6944).

[SVN r84643]
---
 test/ticket_6944.cpp | 7 ++++---
 1 file changed, 4 insertions(+), 3 deletions(-)

diff --git a/test/ticket_6944.cpp b/test/ticket_6944.cpp
index cbf3903..43796a8 100644
--- a/test/ticket_6944.cpp
+++ b/test/ticket_6944.cpp
@@ -20,12 +20,13 @@
 
 namespace boost
 {
+    typedef std::vector<int>::iterator iter_base;
+    struct iter : boost::iterator_adaptor<iter, iter_base, int, boost::use_default, int> {}; // will be deduced as random-access traversal but input category
+    typedef boost::iterator_range<iter> iter_range;
+    
     namespace
     {
         // Ticket 6944 - Some Range concepts use the incorrect Iterator concept
-        typedef std::vector<int>::iterator iter_base;
-        struct iter : boost::iterator_adaptor<iter, iter_base, int, boost::use_default, int> {}; // will be deduced as random-access traversal but input category
-        typedef boost::iterator_range<iter> iter_range;
         void test_ticket_6944()
         {
             BOOST_CONCEPT_ASSERT(( boost::RandomAccessRangeConcept<iter_range> ));

From 3d3631744f147d14632f230f9f029531d0884b18 Mon Sep 17 00:00:00 2001
From: Nathan Ridge <zeratul976@hotmail.com>
Date: Wed, 5 Jun 2013 00:55:37 +0000
Subject: [PATCH 38/41] [range] Don't include <istream> unnecessarily in
 istream_range.hpp (refs #7408).

[SVN r84644]
---
 include/boost/range/istream_range.hpp | 2 +-
 1 file changed, 1 insertion(+), 1 deletion(-)
 mode change 100755 => 100644 include/boost/range/istream_range.hpp

diff --git a/include/boost/range/istream_range.hpp b/include/boost/range/istream_range.hpp
old mode 100755
new mode 100644
index c3f2248..5da87cc
--- a/include/boost/range/istream_range.hpp
+++ b/include/boost/range/istream_range.hpp
@@ -14,7 +14,7 @@
  */
 
 #include <iterator>
-#include <istream>
+#include <iosfwd>
 #include <boost/config.hpp>
 #include <boost/range/iterator_range.hpp>
 

From 1eb5554da9e1a5aa0d6c1d0b77d65a8948410aab Mon Sep 17 00:00:00 2001
From: Nathan Ridge <zeratul976@hotmail.com>
Date: Thu, 6 Jun 2013 23:06:55 +0000
Subject: [PATCH 39/41] [range] Choose the appropriate implementation of
 BOOST_RANGE_EXTRACT_OPTIONAL_TYPE() based on
 BOOST_NO_PARTIAL_SPECIALIZATION_IMPLICIT_DEFAULT_ARGS rather than
 BOOST_NO_PARTIAL_TEMPLATE_SPECIALIZATION (refs #8453).

[SVN r84663]
---
 include/boost/range/detail/extract_optional_type.hpp | 2 +-
 1 file changed, 1 insertion(+), 1 deletion(-)
 mode change 100755 => 100644 include/boost/range/detail/extract_optional_type.hpp

diff --git a/include/boost/range/detail/extract_optional_type.hpp b/include/boost/range/detail/extract_optional_type.hpp
old mode 100755
new mode 100644
index 8292e34..4a7f71a
--- a/include/boost/range/detail/extract_optional_type.hpp
+++ b/include/boost/range/detail/extract_optional_type.hpp
@@ -16,7 +16,7 @@
 
 #include <boost/config.hpp>
 
-#ifdef BOOST_NO_PARTIAL_TEMPLATE_SPECIALIZATION
+#ifdef BOOST_NO_PARTIAL_SPECIALIZATION_IMPLICIT_DEFAULT_ARGS
 
 #define BOOST_RANGE_EXTRACT_OPTIONAL_TYPE( a_typedef )                         \
     template< typename C >                                                     \

From 8be23dd1aaa1ed4b54c49ea2e7af53e5de6283b1 Mon Sep 17 00:00:00 2001
From: Nathan Ridge <zeratul976@hotmail.com>
Date: Sat, 8 Jun 2013 20:41:43 +0000
Subject: [PATCH 40/41] [range] Fix off-by-one error in implementation of
 irange() (refs #7731).

[SVN r84701]
---
 include/boost/range/irange.hpp |  2 +-
 test/irange.cpp                | 18 ++++++------------
 2 files changed, 7 insertions(+), 13 deletions(-)

diff --git a/include/boost/range/irange.hpp b/include/boost/range/irange.hpp
index 248124f..f35df47 100644
--- a/include/boost/range/irange.hpp
+++ b/include/boost/range/irange.hpp
@@ -217,7 +217,7 @@ namespace boost
         const std::ptrdiff_t sz = static_cast<std::ptrdiff_t>(step_size >= 0 ? step_size : -step_size);
         const Integer l = step_size >= 0 ? last : first;
         const Integer f = step_size >= 0 ? first : last;
-        const std::ptrdiff_t num_steps = (l + ((l-f) % sz) - f) / sz;
+        const std::ptrdiff_t num_steps = (l - f) / sz + ((l - f) % sz ? 1 : 0);
         BOOST_ASSERT(num_steps >= 0);
        
         return strided_integer_range<Integer>(
diff --git a/test/irange.cpp b/test/irange.cpp
index 358a2b1..659401b 100644
--- a/test/irange.cpp
+++ b/test/irange.cpp
@@ -35,15 +35,6 @@ namespace boost
                                        reference.begin(), reference.end() );
     }
     
-    template<typename Integer>
-    std::ptrdiff_t test_irange_calculate_num_steps(Integer first, Integer last, int step)
-    {
-        const std::ptrdiff_t sz = static_cast<std::ptrdiff_t>(step >= 0 ? step : -step);
-        const std::ptrdiff_t l = static_cast<std::ptrdiff_t>(step >= 0 ? last : first);
-        const std::ptrdiff_t f = static_cast<std::ptrdiff_t>(step >= 0 ? first : last);
-        return (l + ((l-f) % sz) - f) / sz;
-    }
-
     // Test an integer range with a runtime specified step size.
     template<typename Integer, typename IntegerInput>
     void test_irange_impl(IntegerInput first, IntegerInput last, int step)
@@ -58,9 +49,12 @@ namespace boost
         
         std::vector<Integer> reference;
 
-        const std::ptrdiff_t num_steps = test_irange_calculate_num_steps(first, last, step);        
-        Integer current_value = first;
-        for (std::ptrdiff_t i = 0; i < num_steps; ++i, current_value += step)
+        const std::ptrdiff_t first_p = static_cast<std::ptrdiff_t>(first);
+        const std::ptrdiff_t last_p = static_cast<std::ptrdiff_t>(last);
+        const std::ptrdiff_t step_p = static_cast<std::ptrdiff_t>(step);
+        for (std::ptrdiff_t current_value = first_p; 
+             step_p >= 0 ? current_value < last_p : current_value > last_p;
+             current_value += step_p)
             reference.push_back(current_value);
 
         std::vector<Integer> test;

From b0c1cf556f0ae04d111b0aaf0186f2c55f377ac2 Mon Sep 17 00:00:00 2001
From: Nathan Ridge <zeratul976@hotmail.com>
Date: Sun, 9 Jun 2013 02:34:36 +0000
Subject: [PATCH 41/41] [range] Fixed a bug in istream_range() that prevented
 it from working with character types other than 'char' (refs #7407).

[SVN r84707]
---
 include/boost/range/istream_range.hpp |  4 ++--
 test/istream_range.cpp                | 15 +++++++++++----
 2 files changed, 13 insertions(+), 6 deletions(-)

diff --git a/include/boost/range/istream_range.hpp b/include/boost/range/istream_range.hpp
index 5da87cc..a486317 100644
--- a/include/boost/range/istream_range.hpp
+++ b/include/boost/range/istream_range.hpp
@@ -27,8 +27,8 @@ namespace boost
         istream_range(std::basic_istream<Elem, Traits>& in)
         {
             return iterator_range<std::istream_iterator<Type, Elem, Traits> >(
-                std::istream_iterator<Type>(in),
-                std::istream_iterator<Type>());
+                std::istream_iterator<Type, Elem, Traits>(in),
+                std::istream_iterator<Type, Elem, Traits>());
         }
     } // namespace range
     using range::istream_range;
diff --git a/test/istream_range.cpp b/test/istream_range.cpp
index b3e16db..7d10313 100644
--- a/test/istream_range.cpp
+++ b/test/istream_range.cpp
@@ -19,15 +19,15 @@
 
 namespace
 {
-    // Test an integer range with a step size of 1.
-    void test_istream_range()
+    template <typename CharT>
+    void test_istream_range_impl()
     {
-        std::stringstream s;
+        std::basic_stringstream<CharT> s;
         std::vector<int> reference;
         for (int i = 0; i < 10; ++i)
         {
             reference.push_back(i);
-            s << i << " ";
+            s << i << CharT(' ');
         }
 
         std::vector<int> target;
@@ -36,6 +36,13 @@ namespace
         BOOST_CHECK_EQUAL_COLLECTIONS( reference.begin(), reference.end(),
             target.begin(), target.end() );
     }
+    
+    // Test an istream range.
+    void test_istream_range()
+    {
+        test_istream_range_impl<char>();
+        test_istream_range_impl<wchar_t>();
+    }
 
 } // namespace anonymous namespace