From 8e715b38104379ede1f1877fa2bc56a46fc8cd2b Mon Sep 17 00:00:00 2001
From: nobody <nobody@localhost>
Date: Tue, 21 Mar 2006 02:26:31 +0000
Subject: [PATCH 01/73] This commit was manufactured by cvs2svn to create
 branch 'RC_1_34_0'.

[SVN r33417]

From ee024f588b7e26e9be15861be74ddb87cda61c3e Mon Sep 17 00:00:00 2001
From: =?UTF-8?q?Thorsten=20J=C3=B8rgen=20Ottosen?=
 <thorsten.ottosen@gmail.com>
Date: Tue, 11 Apr 2006 20:12:31 +0000
Subject: [PATCH 02/73] applied borland patch

[SVN r33670]
---
 include/boost/range/iterator_range.hpp | 6 +++++-
 1 file changed, 5 insertions(+), 1 deletion(-)

diff --git a/include/boost/range/iterator_range.hpp b/include/boost/range/iterator_range.hpp
index b29df15..bd77ffa 100755
--- a/include/boost/range/iterator_range.hpp
+++ b/include/boost/range/iterator_range.hpp
@@ -261,8 +261,12 @@ namespace boost
             { 
                 if( singular )
                     return 0;
-                
+
+#if BOOST_WORKAROUND(__BORLANDC__, BOOST_TESTED_AT(0x582))
+                return std::distance<IteratorT>( m_Begin, m_End );
+#else                
                 return std::distance( m_Begin, m_End );
+#endif                
             }
             
             bool empty() const

From 12cf02586c1144b200a527964e39899eb17e6252 Mon Sep 17 00:00:00 2001
From: Daniel James <daniel@calamity.org.uk>
Date: Sat, 26 Aug 2006 14:28:38 +0000
Subject: [PATCH 03/73] Remove tabs

[SVN r34957]
---
 test/iterator_range.cpp | 12 ++++++------
 1 file changed, 6 insertions(+), 6 deletions(-)

diff --git a/test/iterator_range.cpp b/test/iterator_range.cpp
index 20696aa..7e036ab 100755
--- a/test/iterator_range.cpp
+++ b/test/iterator_range.cpp
@@ -26,7 +26,7 @@
 
 using namespace boost;
 using namespace std;
-	
+
 void check_reference_type();
 
 void check_iterator_range()
@@ -94,7 +94,7 @@ void check_iterator_range()
     rrr = make_iterator_range( rrr, -1, 1 );
     BOOST_CHECK( rrr == str );
 
-	check_reference_type();
+    check_reference_type();
 }
 
 
@@ -124,10 +124,10 @@ int test_iter_range( Container& a_cont )
     typedef BOOST_DEDUCED_TYPENAME range_result_iterator<Container>::type citer_type;
     typedef iterator_range<citer_type> riter_type;
     riter_type a_riter( make_iterator_range( a_cont ) );
-	a_riter.front();
-	a_riter.back();
-	int i = a_riter[0];
-	return i;
+    a_riter.front();
+    a_riter.back();
+    int i = a_riter[0];
+    return i;
 }
 
 

From e46eae81444a85496079887af935bfe96a64dc0d Mon Sep 17 00:00:00 2001
From: =?UTF-8?q?Thorsten=20J=C3=B8rgen=20Ottosen?=
 <thorsten.ottosen@gmail.com>
Date: Tue, 24 Oct 2006 10:37:46 +0000
Subject: [PATCH 04/73] *** empty log message ***

[SVN r35717]
---
 include/boost/range/detail/implementation_help.hpp | 2 +-
 1 file changed, 1 insertion(+), 1 deletion(-)

diff --git a/include/boost/range/detail/implementation_help.hpp b/include/boost/range/detail/implementation_help.hpp
index 77cc8cc..11c6612 100755
--- a/include/boost/range/detail/implementation_help.hpp
+++ b/include/boost/range/detail/implementation_help.hpp
@@ -43,7 +43,7 @@ namespace boost
 #else
         inline const wchar_t* str_end( const wchar_t* s, const wchar_t* )
         {
-            if( s == 0 && s[0] == 0 )
+            if( s == 0 || s[0] == 0 )
                 return s;
             while( *++s != 0 )
                 ;

From 3bd0d886c42c118e991f50af209ddcbbc6167e5b Mon Sep 17 00:00:00 2001
From: Rene Rivera <grafikrobot@gmail.com>
Date: Mon, 6 Nov 2006 17:10:46 +0000
Subject: [PATCH 05/73] Remove obsolete Boost.Build v1 files.

[SVN r35880]
---
 test/Jamfile | 41 -----------------------------------------
 1 file changed, 41 deletions(-)
 delete mode 100755 test/Jamfile

diff --git a/test/Jamfile b/test/Jamfile
deleted file mode 100755
index 4a8ef6d..0000000
--- a/test/Jamfile
+++ /dev/null
@@ -1,41 +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/
-#
-
-subproject libs/range/test ;
-
-import testing ;
-
-rule range-test ( name : includes * )
-{
-    return [
-        run $(name).cpp
-        <lib>../../test/build/boost_unit_test_framework
-        : 
-        : 
-        : <include>$(BOOST_ROOT)
-          $(includes)
-        ] ;
-}
-
-test-suite range :
-    [ range-test array ]
-    [ range-test iterator_pair ]
-    [ range-test std_container ]
-    [ range-test string ]
-    [ range-test iterator_range ]
-    [ range-test sub_range ]
-    [ range-test partial_workaround ]
-    [ range-test algorithm_example ]
-    [ range-test reversible_range ]
-    [ range-test const_ranges ]
-    [ range-test extension_mechanism ]
-#    [ range-test mfc : <include>$(VC71_ROOT)/atlmfc/include ] 
-    ;
-

From 523f8a59269adaf57feb1ddb8dfd48c4f1e97d9b Mon Sep 17 00:00:00 2001
From: Vladimir Prus <ghost@cs.msu.su>
Date: Fri, 10 Nov 2006 19:59:52 +0000
Subject: [PATCH 06/73] Merge from HEAD. Allow building of shared versions of
 some Boost.Test libraries. Adjust tests to use always use static linking to
 Boost.Test, since linking to the shared version requires test changes.

Patch from Juergen Hunold.


[SVN r35990]
---
 test/Jamfile.v2 | 2 +-
 1 file changed, 1 insertion(+), 1 deletion(-)

diff --git a/test/Jamfile.v2 b/test/Jamfile.v2
index fcc67f2..b6942ca 100644
--- a/test/Jamfile.v2
+++ b/test/Jamfile.v2
@@ -11,7 +11,7 @@
 rule range-test ( name : includes * )
 {
     return [
-        run $(name).cpp /boost/test//boost_unit_test_framework
+        run $(name).cpp /boost/test//boost_unit_test_framework/<link>static
         : 
         : 
         : $(includes)

From 33c8f3e3ecf577a342e4f7821db058380764f4e4 Mon Sep 17 00:00:00 2001
From: =?UTF-8?q?Thorsten=20J=C3=B8rgen=20Ottosen?=
 <thorsten.ottosen@gmail.com>
Date: Wed, 22 Nov 2006 22:27:28 +0000
Subject: [PATCH 07/73] *** empty log message ***

[SVN r36155]
---
 test/TODO                    | 1 -
 test/compat1.cpp             | 0
 test/extension_mechanism.cpp | 2 +-
 3 files changed, 1 insertion(+), 2 deletions(-)
 delete mode 100644 test/TODO
 delete mode 100755 test/compat1.cpp

diff --git a/test/TODO b/test/TODO
deleted file mode 100644
index 8b13789..0000000
--- a/test/TODO
+++ /dev/null
@@ -1 +0,0 @@
-
diff --git a/test/compat1.cpp b/test/compat1.cpp
deleted file mode 100755
index e69de29..0000000
diff --git a/test/extension_mechanism.cpp b/test/extension_mechanism.cpp
index 0a272c3..d355e4e 100755
--- a/test/extension_mechanism.cpp
+++ b/test/extension_mechanism.cpp
@@ -69,7 +69,7 @@ namespace Foo
         }
 
 
-    inline X::iterator boost_range_end( X& x )
+        inline X::iterator boost_range_end( X& x )
         {
                 return x.vec.end();
         }

From 21b558fe5e71622affbe507f7113101bea807bf2 Mon Sep 17 00:00:00 2001
From: =?UTF-8?q?Thorsten=20J=C3=B8rgen=20Ottosen?=
 <thorsten.ottosen@gmail.com>
Date: Wed, 22 Nov 2006 22:33:09 +0000
Subject: [PATCH 08/73] license info

[SVN r36156]
---
 doc/boost_range.html   | 2 +-
 doc/example.cpp        | 7 +++++++
 doc/examples.html      | 2 +-
 doc/faq.html           | 2 +-
 doc/headers.html       | 2 +-
 doc/history_ack.html   | 2 +-
 doc/intro.html         | 2 +-
 doc/portability.html   | 2 +-
 doc/range.html         | 2 +-
 doc/style.css          | 7 +++++++
 doc/style.html         | 2 +-
 doc/utility_class.html | 2 +-
 12 files changed, 24 insertions(+), 10 deletions(-)

diff --git a/doc/boost_range.html b/doc/boost_range.html
index 303f9d6..16ef3f3 100644
--- a/doc/boost_range.html
+++ b/doc/boost_range.html
@@ -727,7 +727,7 @@ class=identifier>T</span><span class=special>&amp; </span><span class=identifier
 		
 		<hr>
 		<p>
-			(C) Copyright Thorsten Ottosen 2003-2004
+			(C) Copyright Thorsten Ottosen 2003-2004. Use, modification and distribution is subject to the Boost Software License, Version 1.0.
 		</p>
 		<br>
 		<br>
diff --git a/doc/example.cpp b/doc/example.cpp
index afe448f..a45bbcc 100644
--- a/doc/example.cpp
+++ b/doc/example.cpp
@@ -1,3 +1,10 @@
+/*
+//  Copyright Thorsten Ottosen 2003-2005. Use, modification and
+//  distribution is subject to the Boost Software License, Version
+//  1.0. (See accompanying file LICENSE_1_0.txt or copy at
+//  http://www.boost.org/LICENSE_1_0.txt)
+*/
+
 #include <boost/range.hpp>
 #include <iterator>         // for std::iterator_traits, std::distance()
 
diff --git a/doc/examples.html b/doc/examples.html
index 6db7253..b0e4973 100755
--- a/doc/examples.html
+++ b/doc/examples.html
@@ -47,7 +47,7 @@
 
     <hr>
     <p>
-    (C) Copyright Thorsten Ottosen 2003-2004
+    (C) Copyright Thorsten Ottosen 2003-2004. Use, modification and distribution is subject to the Boost Software License, Version 1.0.
     </p>
 
     <br>
diff --git a/doc/faq.html b/doc/faq.html
index 34304ef..614725a 100755
--- a/doc/faq.html
+++ b/doc/faq.html
@@ -116,7 +116,7 @@ Cool indeed!
 
     <hr>
     <p>
-    (C) Copyright Thorsten Ottosen 2003-2004
+    (C) Copyright Thorsten Ottosen 2003-2004. Use, modification and distribution is subject to the Boost Software License, Version 1.0.
     </p>
 
     <br>
diff --git a/doc/headers.html b/doc/headers.html
index f8b12a3..4d320a1 100755
--- a/doc/headers.html
+++ b/doc/headers.html
@@ -154,7 +154,7 @@
 
     <hr>
     <p>
-    (C) Copyright Thorsten Ottosen 2003-2004
+    (C) Copyright Thorsten Ottosen 2003-2004. Use, modification and distribution is subject to the Boost Software License, Version 1.0.
     </p>
 
     <br>
diff --git a/doc/history_ack.html b/doc/history_ack.html
index 40ee5dc..ec3d887 100755
--- a/doc/history_ack.html
+++ b/doc/history_ack.html
@@ -61,7 +61,7 @@ C++ standard: <blockquote>
     
     <hr>
     <p>
-    (C) Copyright Thorsten Ottosen 2003-2006
+    (C) Copyright Thorsten Ottosen 2003-2006. Use, modification and distribution is subject to the Boost Software License, Version 1.0.
     </p>
 
     <br>
diff --git a/doc/intro.html b/doc/intro.html
index 444b4ca..a2a6701 100755
--- a/doc/intro.html
+++ b/doc/intro.html
@@ -146,7 +146,7 @@ Notice that we have to
 
     <hr>
     <p>
-    (C) Copyright Thorsten Ottosen 2003-2004
+    (C) Copyright Thorsten Ottosen 2003-2004. Use, modification and distribution is subject to the Boost Software License, Version 1.0.
     </p>
 
     <br>
diff --git a/doc/portability.html b/doc/portability.html
index ae3a264..2461222 100755
--- a/doc/portability.html
+++ b/doc/portability.html
@@ -75,7 +75,7 @@ href="http://boost.sourceforge.net/regression-logs/developer/range.html">here</a
 
     <hr>
     <p>
-    (C) Copyright Thorsten Ottosen 2003-2004
+    (C) Copyright Thorsten Ottosen 2003-2004. Use, modification and distribution is subject to the Boost Software License, Version 1.0.
     </p>
 
     <br>
diff --git a/doc/range.html b/doc/range.html
index 03a773d..0fe4c88 100755
--- a/doc/range.html
+++ b/doc/range.html
@@ -530,7 +530,7 @@ href="../../iterator/doc/new-iter-concepts.html#random-access-traversal-iterator
         </TR>
         <tr >
             <TD nowrap>Copyright &copy 2004</TD>
-            <TD>Thorsten Ottosen.
+            <TD>Thorsten Ottosen. Use, modification and distribution is subject to the Boost Software License, Version 1.0.
     </TABLE>
 
     <br>
diff --git a/doc/style.css b/doc/style.css
index 1890b52..227040a 100755
--- a/doc/style.css
+++ b/doc/style.css
@@ -1,3 +1,10 @@
+/*
+#//  Copyright Thorsten Ottosen 2003-2005. 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)
+*/
+
 pre{
   BORDER-RIGHT: gray 1pt solid;
   PADDING-RIGHT: 2pt;
diff --git a/doc/style.html b/doc/style.html
index 9a5617e..76a63f1 100755
--- a/doc/style.html
+++ b/doc/style.html
@@ -104,7 +104,7 @@
 
     <hr>
     <p>
-    (C) Copyright Thorsten Ottosen 2003-2004
+    (C) Copyright Thorsten Ottosen 2003-2004. Use, modification and distribution is subject to the Boost Software License, Version 1.0.
     </p>
 
     <br>
diff --git a/doc/utility_class.html b/doc/utility_class.html
index 33c95ae..6dfa78b 100644
--- a/doc/utility_class.html
+++ b/doc/utility_class.html
@@ -352,7 +352,7 @@ store the result
 
 <hr>
   <p>
-    (C) Copyright Thorsten Ottosen 2003-2004
+    (C) Copyright Thorsten Ottosen 2003-2004. Use, modification and distribution is subject to the Boost Software License, Version 1.0.
   </p>
 
   <br>

From fd448ffa316baf94e0622afcf8882b6d6b4b1b2e Mon Sep 17 00:00:00 2001
From: =?UTF-8?q?Thorsten=20J=C3=B8rgen=20Ottosen?=
 <thorsten.ottosen@gmail.com>
Date: Wed, 28 Feb 2007 22:27:50 +0000
Subject: [PATCH 09/73] removed invalid test

[SVN r37117]
---
 test/sub_range.cpp | 11 -----------
 1 file changed, 11 deletions(-)

diff --git a/test/sub_range.cpp b/test/sub_range.cpp
index 0b28fc1..f590b53 100755
--- a/test/sub_range.cpp
+++ b/test/sub_range.cpp
@@ -90,17 +90,6 @@ void check_sub_range()
     s.empty();
     r.size();
     s.size();
-    
-    irange singular_irange;
-    BOOST_CHECK( singular_irange.empty() );
-    BOOST_CHECK( singular_irange.size() == 0 );
-    
-    srange singular_srange;
-    BOOST_CHECK( singular_srange.empty() );
-    BOOST_CHECK( singular_srange.size() == 0 );
-
-    BOOST_CHECK( empty( singular_irange ) );
-    BOOST_CHECK( empty( singular_srange ) );
 
     srange rr = make_iterator_range( str );
     BOOST_CHECK( rr.equal( r ) );

From c54e15d3740e2c745502a7b997e52da9d75c73e1 Mon Sep 17 00:00:00 2001
From: nobody <nobody@localhost>
Date: Tue, 24 Jul 2007 19:28:14 +0000
Subject: [PATCH 10/73] This commit was manufactured by cvs2svn to create tag
 'Version_1_34_1'.

[SVN r38286]

From 25e932149c792b3a95991f7b8f442108c8d162b8 Mon Sep 17 00:00:00 2001
From: Beman Dawes <bdawes@acm.org>
Date: Fri, 5 Oct 2007 14:25:06 +0000
Subject: [PATCH 11/73] Starting point for releases

[SVN r39706]

From 901266b76a05b0afd8e2bd461febbac797a7d1d9 Mon Sep 17 00:00:00 2001
From: Beman Dawes <bdawes@acm.org>
Date: Sun, 25 Nov 2007 18:07:19 +0000
Subject: [PATCH 12/73] Full merge from trunk at revision 41356 of entire
 boost-root tree.

[SVN r41369]
---
 include/boost/range/as_array.hpp              |  45 +
 include/boost/range/as_literal.hpp            | 131 +++
 include/boost/range/atl.hpp                   | 733 +++++++++++++
 include/boost/range/begin.hpp                 | 105 +-
 include/boost/range/category.hpp              |  29 +
 include/boost/range/concepts.hpp              |  45 +-
 include/boost/range/config.hpp                |   3 +-
 include/boost/range/const_iterator.hpp        |  65 +-
 .../boost/range/const_reverse_iterator.hpp    |  17 +-
 include/boost/range/detail/as_literal.hpp     |  33 +
 include/boost/range/detail/begin.hpp          |  49 +-
 include/boost/range/detail/common.hpp         |   1 +
 include/boost/range/detail/const_iterator.hpp |  52 -
 include/boost/range/detail/detail_str.hpp     | 376 +++++++
 include/boost/range/detail/end.hpp            |  71 +-
 .../range/detail/implementation_help.hpp      |  71 +-
 include/boost/range/detail/iterator.hpp       |  52 +-
 include/boost/range/detail/mfc/carray.hpp     |  97 --
 include/boost/range/detail/mfc/cstring.hpp    |  92 --
 include/boost/range/detail/microsoft.hpp      | 931 +++++++++++++++++
 include/boost/range/detail/size_type.hpp      |  50 +-
 include/boost/range/detail/str_types.hpp      |  38 +
 include/boost/range/detail/value_type.hpp     |  50 -
 include/boost/range/difference_type.hpp       | 124 +--
 include/boost/range/distance.hpp              |  34 +
 include/boost/range/empty.hpp                 |  43 +-
 include/boost/range/end.hpp                   | 104 +-
 include/boost/range/functions.hpp             |   4 +-
 include/boost/range/iterator.hpp              | 140 +--
 include/boost/range/iterator_range.hpp        | 205 ++--
 include/boost/range/metafunctions.hpp         |  10 +-
 include/boost/range/mfc.hpp                   | 984 ++++++++++++++++++
 include/boost/range/mutable_iterator.hpp      |  64 ++
 include/boost/range/pointer.hpp               |  29 +
 include/boost/range/rbegin.hpp                |  19 +-
 include/boost/range/reference.hpp             |  29 +
 include/boost/range/rend.hpp                  |  19 +-
 include/boost/range/result_iterator.hpp       |  20 +-
 .../boost/range/reverse_result_iterator.hpp   |  17 +-
 include/boost/range/size.hpp                  | 109 +-
 include/boost/range/size_type.hpp             | 178 +---
 include/boost/range/sub_range.hpp             |  51 +-
 include/boost/range/value_type.hpp            | 124 +--
 43 files changed, 3818 insertions(+), 1625 deletions(-)
 create mode 100755 include/boost/range/as_array.hpp
 create mode 100755 include/boost/range/as_literal.hpp
 create mode 100644 include/boost/range/atl.hpp
 create mode 100755 include/boost/range/category.hpp
 create mode 100755 include/boost/range/detail/as_literal.hpp
 create mode 100755 include/boost/range/detail/detail_str.hpp
 delete mode 100755 include/boost/range/detail/mfc/carray.hpp
 delete mode 100755 include/boost/range/detail/mfc/cstring.hpp
 create mode 100644 include/boost/range/detail/microsoft.hpp
 create mode 100755 include/boost/range/detail/str_types.hpp
 create mode 100755 include/boost/range/distance.hpp
 create mode 100644 include/boost/range/mfc.hpp
 create mode 100755 include/boost/range/mutable_iterator.hpp
 create mode 100755 include/boost/range/pointer.hpp
 create mode 100755 include/boost/range/reference.hpp

diff --git a/include/boost/range/as_array.hpp b/include/boost/range/as_array.hpp
new file mode 100755
index 0000000..0723e60
--- /dev/null
+++ b/include/boost/range/as_array.hpp
@@ -0,0 +1,45 @@
+// Boost.Range library
+//
+//  Copyright Thorsten Ottosen 2006. 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/
+//
+
+#ifndef BOOST_RANGE_AS_ARRAY_HPP
+#define BOOST_RANGE_AS_ARRAY_HPP
+
+#if defined(_MSC_VER) && (_MSC_VER >= 1200)
+# pragma once
+#endif
+
+#include <boost/range/iterator_range.hpp>
+#include <boost/range/detail/str_types.hpp>
+
+namespace boost
+{
+
+    template< class R >
+    inline iterator_range< BOOST_DEDUCED_TYPENAME range_iterator<R>::type > 
+    as_array( R& r )
+    {
+        return boost::make_iterator_range( r );
+    }
+
+#ifndef BOOST_NO_FUNCTION_TEMPLATE_ORDERING
+
+    template< class Range >
+    inline boost::iterator_range< BOOST_DEDUCED_TYPENAME range_iterator<const Range>::type > 
+    as_array( const Range& r )
+    {
+        return boost::make_iterator_range( r );
+    }
+    
+#endif
+    
+}
+
+#endif
+
diff --git a/include/boost/range/as_literal.hpp b/include/boost/range/as_literal.hpp
new file mode 100755
index 0000000..72f0eb5
--- /dev/null
+++ b/include/boost/range/as_literal.hpp
@@ -0,0 +1,131 @@
+// Boost.Range library
+//
+//  Copyright Thorsten Ottosen 2006. 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/
+//
+
+#ifndef BOOST_RANGE_DETAIL_AS_LITERAL_HPP
+#define BOOST_RANGE_DETAIL_AS_LITERAL_HPP
+
+#if defined(_MSC_VER) && (_MSC_VER >= 1200)
+# pragma once
+#endif
+
+#if BOOST_NO_FUNCTION_TEMPLATE_ORDERING
+#include <boost/range/detail/as_literal.hpp>
+#else
+
+#include <boost/range/iterator_range.hpp>
+#include <boost/range/detail/str_types.hpp>
+
+#include <boost/detail/workaround.hpp>
+
+#include <cstring>
+#include <cwchar>
+
+namespace boost
+{
+    namespace range_detail
+    {
+        inline std::size_t length( const char* s )
+        {
+            return strlen( s );
+        }
+
+        inline std::size_t length( const wchar_t* s )
+        {
+            return wcslen( s );
+        }
+
+        //
+        // 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;
+        }
+
+        
+        inline bool is_char_ptr( wchar_t* )
+        {
+            return true;
+        }
+        
+        inline bool is_char_ptr( const wchar_t* )
+        {
+            return true;
+        }
+        
+        template< class T >
+        inline long is_char_ptr( T /* r */ )
+        {
+            return 0L;
+        }
+
+        template< class 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> 
+        make_range( T& r, long )
+        {
+            return boost::make_iterator_range( r );
+        }
+
+    }
+    
+    template< class Range >
+    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> 
+    as_literal( const Range& r )
+    {
+        return range_detail::make_range( r, range_detail::is_char_ptr(r) );
+    }
+
+    template< class Char, std::size_t sz >
+    inline iterator_range<Char*> as_literal( Char (&arr)[sz] )
+    {
+#if BOOST_WORKAROUND(__BORLANDC__, BOOST_TESTED_AT(0x590)) && __BORLANDC__ >= 0x590
+        return boost::make_iterator_range<Char*>( arr, arr + sz - 1 );
+#else
+        return boost::make_iterator_range( arr, arr + sz - 1 );
+#endif
+    }
+
+    
+    template< class Char, std::size_t sz >
+	inline iterator_range<const Char*> as_literal( const Char (&arr)[sz] )
+    {
+#if BOOST_WORKAROUND(__BORLANDC__, BOOST_TESTED_AT(0x590)) && __BORLANDC__ >= 0x590
+        return boost::make_iterator_range<const Char*>( arr, arr + sz - 1 );
+#else
+        return boost::make_iterator_range( arr, arr + sz - 1 );
+#endif
+	}
+}
+
+#endif // BOOST_NO_FUNCTION_TEMPLATE_ORDERING
+
+#endif
diff --git a/include/boost/range/atl.hpp b/include/boost/range/atl.hpp
new file mode 100644
index 0000000..ab492d9
--- /dev/null
+++ b/include/boost/range/atl.hpp
@@ -0,0 +1,733 @@
+#ifndef BOOST_RANGE_ATL_HPP
+#define BOOST_RANGE_ATL_HPP
+
+
+
+
+// Boost.Range ATL Extension
+//
+// Copyright Shunsuke Sogame 2005-2006.
+// Distributed under the Boost Software License, Version 1.0. 
+// (See accompanying file LICENSE_1_0.txt or copy at 
+// http://www.boost.org/LICENSE_1_0.txt)
+
+
+
+
+// config
+//
+
+
+#include <atldef.h> // _ATL_VER
+
+
+#if !defined(BOOST_RANGE_ATL_NO_COLLECTIONS)
+    #if (_ATL_VER < 0x0700)
+        #define BOOST_RANGE_ATL_NO_COLLECTIONS
+    #endif
+#endif
+
+
+#if !defined(BOOST_RANGE_ATL_HAS_OLD_CSIMPLE_XXX)
+    #if (_ATL_VER < 0x0700) // dubious
+        #define BOOST_RANGE_ATL_HAS_OLD_CSIMPLE_XXX
+    #endif
+#endif
+
+
+#if !defined(BOOST_RANGE_ATL_HAS_OLD_CSIMPLESTRING)
+    #if (_MSC_VER < 1310)   // from <boost/regex/mfc.hpp>, but dubious
+        #define BOOST_RANGE_ATL_HAS_OLD_CSIMPLESTRING
+    #endif
+#endif
+
+
+
+
+// forward declarations
+//
+
+
+#include <basetyps.h> // IID
+
+
+namespace ATL {
+
+
+#if !defined(BOOST_RANGE_ATL_NO_COLLECTIONS)
+
+
+    // arrays
+    //
+    template< class E, class ETraits >
+    class CAtlArray;
+
+    template< class E >
+    class CAutoPtrArray;
+
+    template< class I, const IID *piid >
+    class CInterfaceArray;
+
+
+    // lists
+    //
+    template< class E, class ETraits >
+    class CAtlList;
+
+    template< class E >
+    class CAutoPtrList;
+
+    template< class E, class Allocator >
+    class CHeapPtrList;
+
+    template< class I, const IID *piid >
+    class CInterfaceList;
+
+
+    // maps
+    //
+    template< class K, class V, class KTraits, class VTraits >
+    class CAtlMap;
+
+    template< class K, class V, class KTraits, class VTraits >
+    class CRBTree;
+
+    template< class K, class V, class KTraits, class VTraits >
+    class CRBMap;
+
+    template< class K, class V, class KTraits, class VTraits >
+    class CRBMultiMap;
+
+
+    // strings
+    //
+#if !defined(BOOST_RANGE_ATL_HAS_OLD_CSIMPLESTRING)
+    template< class BaseType, bool t_bMFCDLL >
+    class CSimpleStringT;
+#else
+    template< class BaseType >
+    class CSimpleStringT;
+#endif
+
+    template< class BaseType, class StringTraits >
+    class CStringT;
+
+    template< class StringType, int t_nChars >
+    class CFixedStringT;
+
+    template< class BaseType, const int t_nSize >
+    class CStaticString;
+
+
+#endif // !defined(BOOST_RANGE_ATL_NO_COLLECTIONS)
+
+
+    // simples
+    //
+#if !defined(BOOST_RANGE_ATL_HAS_OLD_CSIMPLE_XXX)
+
+    template< class T, class TEqual >
+    class CSimpleArray;
+
+    template< class TKey, class TVal, class TEqual >
+    class CSimpleMap;
+
+#else
+
+    template< class T >
+    class CSimpleArray;
+
+    template< class T >
+    class CSimpleValArray;
+
+    template< class TKey, class TVal >
+    class CSimpleMap;
+
+#endif // !defined(BOOST_RANGE_ATL_HAS_OLD_CSIMPLE_XXX)
+
+
+    // pointers
+    //
+    template< class E >
+    class CAutoPtr;
+
+    template< class T >
+    class CComPtr;
+
+    template< class T, const IID *piid >
+    class CComQIPtr;
+
+    template< class E, class Allocator >
+    class CHeapPtr;
+
+    template< class T >
+    class CAdapt;
+
+
+} // namespace ATL
+
+
+
+
+// indirect_iterator customizations
+//
+
+
+#include <boost/mpl/identity.hpp>
+#include <boost/pointee.hpp>
+
+
+namespace boost {
+
+
+    template< class E >
+    struct pointee< ATL::CAutoPtr<E> > :
+        mpl::identity<E>
+    { };
+
+    template< class T >
+    struct pointee< ATL::CComPtr<T> > :
+        mpl::identity<T>
+    { };
+
+    template< class T, const IID *piid >
+    struct pointee< ATL::CComQIPtr<T, piid> > :
+        mpl::identity<T>
+    { };
+
+    template< class E, class Allocator >
+    struct pointee< ATL::CHeapPtr<E, Allocator> > :
+        mpl::identity<E>
+    { };
+
+    template< class T >
+    struct pointee< ATL::CAdapt<T> > :
+        pointee<T>
+    { };
+
+
+} // namespace boost
+
+
+
+
+// extended customizations
+//
+
+
+#include <boost/iterator/indirect_iterator.hpp>
+#include <boost/iterator/zip_iterator.hpp>
+#include <boost/range/detail/microsoft.hpp>
+#include <boost/tuple/tuple.hpp>
+#include <atlbase.h> // CComBSTR
+
+
+namespace boost { namespace range_detail_microsoft {
+
+
+#if !defined(BOOST_RANGE_ATL_NO_COLLECTIONS)
+
+
+    // arrays
+    //
+
+    struct atl_array_functions :
+        array_functions
+    {
+        template< class Iterator, class X >
+        Iterator end(X& x) // redefine
+        {
+            return x.GetData() + x.GetCount(); // no 'GetSize()'
+        }
+    };
+
+
+    template< class E, class ETraits >
+    struct customization< ATL::CAtlArray<E, ETraits> > :
+        atl_array_functions
+    {
+        template< class X >
+        struct meta
+        {
+            typedef E val_t;
+
+            typedef val_t *mutable_iterator;
+            typedef val_t const *const_iterator;
+        };
+    };
+
+
+    template< class E >
+    struct customization< ATL::CAutoPtrArray<E> > :
+        atl_array_functions
+    {
+        template< class X >
+        struct meta
+        {
+            // ATL::CAutoPtr/CHeapPtr is no assignable.
+            typedef ATL::CAutoPtr<E> val_t;
+            typedef val_t *miter_t;
+            typedef val_t const *citer_t;
+
+            typedef indirect_iterator<miter_t> mutable_iterator;
+            typedef indirect_iterator<citer_t> const_iterator;
+        };
+    };
+
+
+    template< class I, const IID *piid >
+    struct customization< ATL::CInterfaceArray<I, piid> > :
+        atl_array_functions
+    {
+        template< class X >
+        struct meta
+        {
+            typedef ATL::CComQIPtr<I, piid> val_t;
+
+            typedef val_t *mutable_iterator;
+            typedef val_t const *const_iterator;
+        };
+    };
+
+
+    template< class E, class ETraits >
+    struct customization< ATL::CAtlList<E, ETraits> > :
+        list_functions
+    {
+        template< class X >
+        struct meta
+        {
+            typedef E val_t;
+
+            typedef list_iterator<X, val_t> mutable_iterator;
+            typedef list_iterator<X const, val_t const> const_iterator;
+        };
+    };
+
+
+    struct indirected_list_functions
+    {
+        template< class Iterator, class X >
+        Iterator begin(X& x)
+        {
+            typedef typename Iterator::base_type base_t; // == list_iterator
+            return Iterator(base_t(x, x.GetHeadPosition()));
+        }
+
+        template< class Iterator, class X >
+        Iterator end(X& x)
+        {
+            typedef typename Iterator::base_type base_t;
+            return Iterator(base_t(x, POSITION(0)));
+        }
+    };
+
+
+    template< class E >
+    struct customization< ATL::CAutoPtrList<E> > :
+        indirected_list_functions
+    {
+        template< class X >
+        struct meta
+        {
+            typedef ATL::CAutoPtr<E> val_t;
+            typedef list_iterator<X, val_t> miter_t;
+            typedef list_iterator<X const, val_t const> citer_t;
+
+            typedef indirect_iterator<miter_t> mutable_iterator;
+            typedef indirect_iterator<citer_t> const_iterator;
+        };
+    };
+
+
+    template< class E, class Allocator >
+    struct customization< ATL::CHeapPtrList<E, Allocator> > :
+        indirected_list_functions
+    {
+        template< class X >
+        struct meta
+        {
+            typedef ATL::CHeapPtr<E, Allocator> val_t;
+            typedef list_iterator<X, val_t> miter_t;
+            typedef list_iterator<X const, val_t const> citer_t;
+
+            typedef indirect_iterator<miter_t> mutable_iterator;
+            typedef indirect_iterator<citer_t> const_iterator;
+        };
+    };
+
+
+    template< class I, const IID *piid >
+    struct customization< ATL::CInterfaceList<I, piid> > :
+        list_functions
+    {
+        template< class X >
+        struct meta
+        {
+            typedef ATL::CComQIPtr<I, piid> val_t;
+
+            typedef list_iterator<X, val_t> mutable_iterator;
+            typedef list_iterator<X const, val_t const> const_iterator;
+        };
+    };
+
+
+    // maps
+    //
+
+    struct atl_rb_tree_tag
+    { };
+
+    template< >
+    struct customization< atl_rb_tree_tag > :
+        indirected_list_functions
+    {
+        template< class X >
+        struct meta
+        {
+            typedef typename X::CPair val_t;
+
+            typedef list_iterator<X, val_t *, val_t *> miter_t;
+            typedef list_iterator<X const, val_t const *, val_t const *> citer_t;
+            
+            typedef indirect_iterator<miter_t> mutable_iterator;
+            typedef indirect_iterator<citer_t> const_iterator;
+        };
+    };
+
+
+    template< class K, class V, class KTraits, class VTraits >
+    struct customization< ATL::CAtlMap<K, V, KTraits, VTraits> > :
+        customization< atl_rb_tree_tag >
+    {
+        template< class Iterator, class X >
+        Iterator begin(X& x) // redefine
+        {
+            typedef typename Iterator::base_type base_t; // == list_iterator
+            return Iterator(base_t(x, x.GetStartPosition())); // no 'GetHeadPosition'
+        }
+    };
+
+
+    // strings
+    //
+
+    struct atl_string_tag
+    { };
+
+    template< >
+    struct customization< atl_string_tag >
+    {
+        template< class X >
+        struct meta
+        {
+            typedef typename X::PXSTR mutable_iterator;
+            typedef typename X::PCXSTR const_iterator;
+        };
+
+        template< class Iterator, class X >
+        typename mutable_<Iterator, X>::type begin(X& x)
+        {
+            return x.GetBuffer(0);
+        }
+
+        template< class Iterator, class X >
+        Iterator begin(X const& x)
+        {
+            return x.GetString();
+        }
+
+        template< class Iterator, class X >
+        Iterator end(X& x)
+        {
+            return begin<Iterator>(x) + x.GetLength();
+        }
+    };
+
+
+    template< class BaseType, const int t_nSize >
+    struct customization< ATL::CStaticString<BaseType, t_nSize> >
+    {
+        template< class X >
+        struct meta
+        {
+            typedef BaseType const *mutable_iterator;
+            typedef mutable_iterator const_iterator;
+        };
+
+        template< class Iterator, class X >
+        Iterator begin(X const& x)
+        {
+            return x;
+        }
+
+        template< class Iterator, class X >
+        Iterator end(X const& x)
+        {
+            return begin<Iterator>(x) + X::GetLength();
+        }
+    };
+
+
+#endif // !defined(BOOST_RANGE_ATL_NO_COLLECTIONS)
+
+
+    template< >
+    struct customization< ATL::CComBSTR >
+    {
+        template< class X >
+        struct meta
+        {
+            typedef OLECHAR *mutable_iterator;
+            typedef OLECHAR const *const_iterator;
+        };
+
+        template< class Iterator, class X >
+        Iterator begin(X& x)
+        {
+            return x.operator BSTR();
+        }
+
+        template< class Iterator, class X >
+        Iterator end(X& x)
+        {
+            return begin<Iterator>(x) + x.Length();
+        }
+    };
+
+
+    // simples
+    //
+
+#if !defined(BOOST_RANGE_ATL_HAS_OLD_CSIMPLE_XXX)
+    template< class T, class TEqual >
+    struct customization< ATL::CSimpleArray<T, TEqual> > :
+#else
+    template< class T >
+    struct customization< ATL::CSimpleArray<T> > :
+#endif
+        array_functions
+    {
+        template< class X >
+        struct meta
+        {
+            typedef T val_t;
+
+            typedef val_t *mutable_iterator;
+            typedef val_t const *const_iterator;
+        };
+    };
+
+
+#if defined(BOOST_RANGE_ATL_HAS_OLD_CSIMPLE_XXX)
+
+    template< class T >
+    struct customization< ATL::CSimpleValArray<T> > :
+        array_functions
+    {
+        template< class X >
+        struct meta
+        {
+            typedef T val_t;
+
+            typedef val_t *mutable_iterator;
+            typedef val_t const *const_iterator;
+        };
+    };
+
+#endif // defined(BOOST_RANGE_ATL_HAS_OLD_CSIMPLE_XXX)
+
+
+#if !defined(BOOST_RANGE_ATL_HAS_OLD_CSIMPLE_XXX)
+    template< class TKey, class TVal, class TEqual >
+    struct customization< ATL::CSimpleMap<TKey, TVal, TEqual> >
+#else
+    template< class TKey, class TVal >
+    struct customization< ATL::CSimpleMap<TKey, TVal> >
+#endif
+    {
+        template< class X >
+        struct meta
+        {
+            typedef TKey k_val_t;
+            typedef k_val_t *k_miter_t;
+            typedef k_val_t const *k_citer_t;
+
+            typedef TVal v_val_t;
+            typedef v_val_t *v_miter_t;
+            typedef v_val_t const *v_citer_t;
+
+            // Topic:
+            // 'std::pair' can't contain references
+            // because of reference to reference problem.
+
+            typedef zip_iterator< tuple<k_miter_t, v_miter_t> > mutable_iterator;
+            typedef zip_iterator< tuple<k_citer_t, v_citer_t> > const_iterator;
+        };
+
+        template< class Iterator, class X >
+        Iterator begin(X& x)
+        {
+            return Iterator(boost::make_tuple(x.m_aKey, x.m_aVal));
+        }
+
+        template< class Iterator, class X >
+        Iterator end(X& x)
+        {
+            return Iterator(boost::make_tuple(x.m_aKey + x.GetSize(), x.m_aVal + x.GetSize()));
+        }
+    };
+
+
+} } // namespace boost::range_detail_microsoft
+
+
+
+
+// range customizations
+//
+
+
+#if !defined(BOOST_RANGE_ATL_NO_COLLECTIONS)
+
+
+    // arrays
+    //
+    BOOST_RANGE_DETAIL_MICROSOFT_CUSTOMIZATION_TEMPLATE(
+        boost::range_detail_microsoft::using_type_as_tag,
+        (ATL, BOOST_PP_NIL), CAtlArray, 2
+    )
+
+    BOOST_RANGE_DETAIL_MICROSOFT_CUSTOMIZATION_TEMPLATE(
+        boost::range_detail_microsoft::using_type_as_tag,
+        (ATL, BOOST_PP_NIL), CAutoPtrArray, 1
+    )
+
+    BOOST_RANGE_DETAIL_MICROSOFT_CUSTOMIZATION_TEMPLATE(
+        boost::range_detail_microsoft::using_type_as_tag,
+        (ATL, BOOST_PP_NIL), CInterfaceArray, (class)(const IID *)
+    )
+
+
+    // lists
+    //
+    BOOST_RANGE_DETAIL_MICROSOFT_CUSTOMIZATION_TEMPLATE(
+        boost::range_detail_microsoft::using_type_as_tag,
+        (ATL, BOOST_PP_NIL), CAtlList, 2
+    )
+
+    BOOST_RANGE_DETAIL_MICROSOFT_CUSTOMIZATION_TEMPLATE(
+        boost::range_detail_microsoft::using_type_as_tag,
+        (ATL, BOOST_PP_NIL), CAutoPtrList, 1
+    )
+
+    BOOST_RANGE_DETAIL_MICROSOFT_CUSTOMIZATION_TEMPLATE(
+        boost::range_detail_microsoft::using_type_as_tag,
+        (ATL, BOOST_PP_NIL), CHeapPtrList, 2
+    )
+
+    BOOST_RANGE_DETAIL_MICROSOFT_CUSTOMIZATION_TEMPLATE(
+        boost::range_detail_microsoft::using_type_as_tag,
+        (ATL, BOOST_PP_NIL), CInterfaceList, (class)(const IID *)
+    )
+
+
+    //maps
+    //
+    BOOST_RANGE_DETAIL_MICROSOFT_CUSTOMIZATION_TEMPLATE(
+        boost::range_detail_microsoft::using_type_as_tag,
+        (ATL, BOOST_PP_NIL), CAtlMap, 4
+    )
+
+    BOOST_RANGE_DETAIL_MICROSOFT_CUSTOMIZATION_TEMPLATE(
+        boost::range_detail_microsoft::atl_rb_tree_tag,
+        (ATL, BOOST_PP_NIL), CRBTree, 4
+    )
+
+    BOOST_RANGE_DETAIL_MICROSOFT_CUSTOMIZATION_TEMPLATE(
+        boost::range_detail_microsoft::atl_rb_tree_tag,
+        (ATL, BOOST_PP_NIL), CRBMap, 4
+    )
+
+    BOOST_RANGE_DETAIL_MICROSOFT_CUSTOMIZATION_TEMPLATE(
+        boost::range_detail_microsoft::atl_rb_tree_tag,
+        (ATL, BOOST_PP_NIL), CRBMultiMap, 4
+    )
+
+
+    // strings
+    //
+    #if !defined(BOOST_RANGE_ATL_HAS_OLD_CSIMPLESTRING)
+        BOOST_RANGE_DETAIL_MICROSOFT_CUSTOMIZATION_TEMPLATE(
+            boost::range_detail_microsoft::atl_string_tag,
+            (ATL, BOOST_PP_NIL), CSimpleStringT, (class)(bool)
+        )
+    #else
+        BOOST_RANGE_DETAIL_MICROSOFT_CUSTOMIZATION_TEMPLATE(
+            boost::range_detail_microsoft::atl_string_tag,
+            (ATL, BOOST_PP_NIL), CSimpleStringT, 1
+        )
+    #endif
+
+    BOOST_RANGE_DETAIL_MICROSOFT_CUSTOMIZATION_TEMPLATE(
+        boost::range_detail_microsoft::atl_string_tag,
+        (ATL, BOOST_PP_NIL), CStringT, 2
+    )
+
+    BOOST_RANGE_DETAIL_MICROSOFT_CUSTOMIZATION_TEMPLATE(
+        boost::range_detail_microsoft::atl_string_tag,
+        (ATL, BOOST_PP_NIL), CFixedStringT, (class)(int)
+    )
+
+    BOOST_RANGE_DETAIL_MICROSOFT_CUSTOMIZATION_TEMPLATE(
+        boost::range_detail_microsoft::using_type_as_tag,
+        (ATL, BOOST_PP_NIL), CStaticString, (class)(const int)
+    )
+
+
+#endif // !defined(BOOST_RANGE_ATL_NO_COLLECTIONS)
+
+
+BOOST_RANGE_DETAIL_MICROSOFT_CUSTOMIZATION_TYPE(
+    boost::range_detail_microsoft::using_type_as_tag,
+    (ATL, BOOST_PP_NIL), CComBSTR
+)
+
+
+// simples
+//
+#if !defined(BOOST_RANGE_ATL_HAS_OLD_CSIMPLE_XXX)
+
+    BOOST_RANGE_DETAIL_MICROSOFT_CUSTOMIZATION_TEMPLATE(
+        boost::range_detail_microsoft::using_type_as_tag,
+        (ATL, BOOST_PP_NIL), CSimpleArray, 2
+    )
+
+    BOOST_RANGE_DETAIL_MICROSOFT_CUSTOMIZATION_TEMPLATE(
+        boost::range_detail_microsoft::using_type_as_tag,
+        (ATL, BOOST_PP_NIL), CSimpleMap, 3
+    )
+
+#else
+
+    BOOST_RANGE_DETAIL_MICROSOFT_CUSTOMIZATION_TEMPLATE(
+        boost::range_detail_microsoft::using_type_as_tag,
+        (ATL, BOOST_PP_NIL), CSimpleArray, 1
+    )
+
+    BOOST_RANGE_DETAIL_MICROSOFT_CUSTOMIZATION_TEMPLATE(
+        boost::range_detail_microsoft::using_type_as_tag,
+        (ATL, BOOST_PP_NIL), CSimpleMap, 2
+    )
+
+    BOOST_RANGE_DETAIL_MICROSOFT_CUSTOMIZATION_TEMPLATE(
+        boost::range_detail_microsoft::using_type_as_tag,
+        (ATL, BOOST_PP_NIL), CSimpleValArray, 1
+    )
+
+#endif // !defined(BOOST_RANGE_ATL_HAS_OLD_CSIMPLE_XXX)
+
+
+
+
+#endif
diff --git a/include/boost/range/begin.hpp b/include/boost/range/begin.hpp
index d16ce1e..9abf313 100755
--- a/include/boost/range/begin.hpp
+++ b/include/boost/range/begin.hpp
@@ -15,7 +15,6 @@
 # pragma once
 #endif
 
-#include <boost/type_traits/remove_const.hpp>
 #include <boost/range/config.hpp>
 
 #ifdef BOOST_NO_FUNCTION_TEMPLATE_ORDERING
@@ -23,7 +22,6 @@
 #else
 
 #include <boost/range/iterator.hpp>
-#include <boost/range/const_iterator.hpp>
 
 namespace boost
 {
@@ -40,17 +38,14 @@ namespace range_detail
     //////////////////////////////////////////////////////////////////////
 
     template< typename C >
-    inline BOOST_DEDUCED_TYPENAME range_const_iterator<C>::type
-    boost_range_begin( const C& c )
-    {
-        return c.begin();
-    }
-
-    template< typename C >
-    inline BOOST_DEDUCED_TYPENAME range_iterator<
-                                                                        typename remove_const<C>::type >::type
-    boost_range_begin( C& c )
+    inline BOOST_DEDUCED_TYPENAME range_iterator<C>::type
+    range_begin( C& c )
     {
+        //
+        // If you get a compile-error here, it is most likely because
+        // you have not implemented range_begin() properly in
+        // the namespace of C
+        //
         return c.begin();
     }
 
@@ -59,13 +54,13 @@ namespace range_detail
     //////////////////////////////////////////////////////////////////////
 
     template< typename Iterator >
-    inline Iterator boost_range_begin( const std::pair<Iterator,Iterator>& p )
+    inline Iterator range_begin( const std::pair<Iterator,Iterator>& p )
     {
         return p.first;
     }
 
     template< typename Iterator >
-    inline Iterator boost_range_begin( std::pair<Iterator,Iterator>& p )
+    inline Iterator range_begin( std::pair<Iterator,Iterator>& p )
     {
         return p.first;
     }
@@ -74,66 +69,22 @@ namespace range_detail
     // array
     //////////////////////////////////////////////////////////////////////
 
+    //
+    // May this be discarded? Or is it needed for bad compilers?
+    //
     template< typename T, std::size_t sz >
-    inline const T* boost_range_begin( const T (&array)[sz] )
+    inline const T* range_begin( const T (&array)[sz] )
     {
         return array;
     }
 
     template< typename T, std::size_t sz >
-    inline T* boost_range_begin( T (&array)[sz] )
+    inline T* range_begin( T (&array)[sz] )
     {
         return array;
     }
 
 
-    //////////////////////////////////////////////////////////////////////
-    // string
-    //////////////////////////////////////////////////////////////////////
-
-#if 1 || BOOST_WORKAROUND(__MWERKS__, <= 0x3204 ) || BOOST_WORKAROUND(__BORLANDC__, BOOST_TESTED_AT(0x564))
-// CW up to 9.3 and borland have troubles with function ordering
-    inline const char* boost_range_begin( const char* s )
-    {
-        return s;
-    }
-
-    inline char* boost_range_begin( char* s )
-    {
-        return s;
-    }
-
-    inline const wchar_t* boost_range_begin( const wchar_t* s )
-    {
-        return s;
-    }
-
-    inline wchar_t* boost_range_begin( wchar_t* s )
-    {
-        return s;
-    }
-#else
-    inline const char* boost_range_begin( const char*& s )
-    {
-        return s;
-    }
-
-    inline char* boost_range_begin( char*& s )
-    {
-        return s;
-    }
-
-    inline const wchar_t* boost_range_begin( const wchar_t*& s )
-    {
-        return s;
-    }
-
-    inline wchar_t* boost_range_begin( wchar_t*& s )
-    {
-        return s;
-    }
-#endif
-
 #if !BOOST_WORKAROUND(__BORLANDC__, BOOST_TESTED_AT(0x564)) && \
     !BOOST_WORKAROUND(__GNUC__, < 3) \
     /**/
@@ -142,44 +93,27 @@ namespace range_detail
 
 
 template< class T >
-inline BOOST_DEDUCED_TYPENAME range_iterator<
-                        typename remove_const<T>::type >::type begin( T& r )
+inline BOOST_DEDUCED_TYPENAME range_iterator<T>::type begin( T& r )
 {
 #if !BOOST_WORKAROUND(__BORLANDC__, BOOST_TESTED_AT(0x564)) && \
     !BOOST_WORKAROUND(__GNUC__, < 3) \
     /**/
     using namespace range_detail;
 #endif
-    return boost_range_begin( r );
+    return range_begin( r );
 }
 
 template< class T >
-inline BOOST_DEDUCED_TYPENAME range_const_iterator<T>::type begin( const T& r )
+inline BOOST_DEDUCED_TYPENAME range_iterator<const T>::type begin( const T& r )
 {
 #if !BOOST_WORKAROUND(__BORLANDC__, BOOST_TESTED_AT(0x564)) && \
     !BOOST_WORKAROUND(__GNUC__, < 3) \
     /**/
     using namespace range_detail;
 #endif
-    return boost_range_begin( r );
+    return range_begin( r );
 }
 
-#if BOOST_WORKAROUND(__MWERKS__, <= 0x3003 ) || BOOST_WORKAROUND(__BORLANDC__, BOOST_TESTED_AT(0x564))
-// BCB and CW are not able to overload pointer when class overloads are also available.
-template<>
-inline range_const_iterator<const char*>::type begin<const char*>( const char*& r )
-{
-    return r;
-}
-
-template<>
-inline range_const_iterator<const wchar_t*>::type begin<const wchar_t*>( const wchar_t*& r )
-{
-    return r;
-}
-
-#endif
-
 } // namespace boost
 
 #endif // BOOST_NO_FUNCTION_TEMPLATE_ORDERING
@@ -187,7 +121,7 @@ inline range_const_iterator<const wchar_t*>::type begin<const wchar_t*>( const w
 namespace boost
 {
     template< class T >
-    inline BOOST_DEDUCED_TYPENAME range_const_iterator<T>::type
+    inline BOOST_DEDUCED_TYPENAME range_iterator<const T>::type
     const_begin( const T& r )
     {
         return boost::begin( r );
@@ -195,3 +129,4 @@ namespace boost
 }
 
 #endif
+
diff --git a/include/boost/range/category.hpp b/include/boost/range/category.hpp
new file mode 100755
index 0000000..1574605
--- /dev/null
+++ b/include/boost/range/category.hpp
@@ -0,0 +1,29 @@
+// Boost.Range library
+//
+//  Copyright Thorsten Ottosen 2003-2006. 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/
+//
+
+#ifndef BOOST_RANGE_CATEGORY_HPP
+#define BOOST_RANGE_CATEGORY_HPP
+
+#if defined(_MSC_VER) && (_MSC_VER >= 1200)
+# pragma once
+#endif
+
+#include <boost/range/config.hpp>
+#include <boost/range/iterator.hpp>
+#include <boost/iterator/iterator_traits.hpp>
+
+namespace boost
+{
+    template< class T >
+    struct range_category : iterator_category< typename range_iterator<T>::type >
+    { };
+}
+
+#endif
diff --git a/include/boost/range/concepts.hpp b/include/boost/range/concepts.hpp
index 2441d43..53a88dc 100755
--- a/include/boost/range/concepts.hpp
+++ b/include/boost/range/concepts.hpp
@@ -13,8 +13,8 @@
 
 #include <boost/concept_check.hpp>
 #include <boost/iterator/iterator_concepts.hpp>
-#include <boost/range/functions.hpp>
-#include <boost/range/metafunctions.hpp>
+#include <boost/range/begin.hpp>
+#include <boost/range/end.hpp>
 
 /*!
  * \file
@@ -57,10 +57,11 @@ namespace boost {
 
     //! Check if a type T models the SinglePassRange range concept.
     template<typename T>
-    struct SinglePassRangeConcept {
-        typedef typename range_value<T>::type range_value;
-        typedef typename range_iterator<T>::type range_iterator;
-        typedef typename range_const_iterator<T>::type range_const_iterator;
+    struct SinglePassRangeConcept 
+    {
+        typedef typename range_iterator<T const>::type  range_const_iterator;
+        typedef typename range_iterator<T>::type        range_iterator;
+
         void constraints()
         {
             function_requires<
@@ -70,9 +71,9 @@ namespace boost {
             >();
             i = boost::begin(a);
             i = boost::end(a);
-            b = boost::empty(a);
             const_constraints(a);
         }
+        
         void const_constraints(const T& a)
         {
             ci = boost::begin(a);
@@ -81,14 +82,12 @@ namespace boost {
         T a;
         range_iterator i;
         range_const_iterator ci;
-        bool b;
     };
 
     //! Check if a type T models the ForwardRange range concept.
     template<typename T>
-    struct ForwardRangeConcept {
-        typedef typename range_difference<T>::type range_difference;
-        typedef typename range_size<T>::type range_size;
+    struct ForwardRangeConcept 
+    {
         void constraints()
         {
             function_requires<
@@ -99,17 +98,13 @@ namespace boost {
                     typename range_iterator<T>::type
                 >
             >();
-            s = boost::size(a);
         }
-        T a;
-        range_size s;
     };
 
     //! Check if a type T models the BidirectionalRange range concept.
     template<typename T>
-    struct BidirectionalRangeConcept {
-        typedef typename range_reverse_iterator<T>::type range_reverse_iterator;
-        typedef typename range_const_reverse_iterator<T>::type range_const_reverse_iterator;
+    struct BidirectionalRangeConcept 
+    {
         void constraints()
         {
             function_requires<
@@ -120,23 +115,13 @@ namespace boost {
                     typename range_iterator<T>::type
                 >
             >();
-            i = boost::rbegin(a);
-            i = boost::rend(a);
-            const_constraints(a);
-            }
-        void const_constraints(const T& a)
-        {
-            ci = boost::rbegin(a);
-            ci = boost::rend(a);
         }
-        T a;
-        range_reverse_iterator i;
-        range_const_reverse_iterator ci;
     };
 
     //! Check if a type T models the RandomAccessRange range concept.
     template<typename T>
-    struct RandomAccessRangeConcept {
+    struct RandomAccessRangeConcept 
+    {
         void constraints()
         {
             function_requires<
@@ -147,7 +132,7 @@ namespace boost {
                     typename range_iterator<T>::type
                 >
             >();
-            }
+         }
     };
 
 } // namespace boost
diff --git a/include/boost/range/config.hpp b/include/boost/range/config.hpp
index 5f856bb..4e7fb24 100755
--- a/include/boost/range/config.hpp
+++ b/include/boost/range/config.hpp
@@ -37,8 +37,7 @@
 #error "macro already defined!"
 #endif
 
-//#if BOOST_WORKAROUND( BOOST_MSVC, < 1300 ) || __MWERKS__ <= 0x3003
-#if _MSC_VER <= 1300 && !defined( __COMO__ ) && !defined( __GNUC__ ) && __MWERKS__ <= 0x3003
+#if BOOST_WORKAROUND( BOOST_MSVC, < 1300 ) || BOOST_WORKAROUND( __MWERKS__, <= 0x3003 )
 #define BOOST_RANGE_NO_ARRAY_SUPPORT 1
 #endif
 
diff --git a/include/boost/range/const_iterator.hpp b/include/boost/range/const_iterator.hpp
index 4ba41b2..195f9d4 100755
--- a/include/boost/range/const_iterator.hpp
+++ b/include/boost/range/const_iterator.hpp
@@ -21,6 +21,7 @@
 #include <boost/range/detail/const_iterator.hpp>
 #else
 
+#include <boost/type_traits/remove_const.hpp>
 #include <cstddef>
 #include <utility>
 
@@ -46,12 +47,6 @@ namespace boost
         typedef Iterator type;
     };
     
-    template< typename Iterator >
-    struct range_const_iterator< const std::pair<Iterator,Iterator> >
-    {
-        typedef Iterator type;
-    };
-
     //////////////////////////////////////////////////////////////////////////
     // array
     //////////////////////////////////////////////////////////////////////////
@@ -62,64 +57,6 @@ namespace boost
         typedef const T* type;
     };
 
-    template< typename T, std::size_t sz >
-    struct range_const_iterator< const T[sz] >
-    {
-        typedef const T* type;
-    };
-
-    //////////////////////////////////////////////////////////////////////////
-    // string
-    //////////////////////////////////////////////////////////////////////////
-
-    template<>
-    struct range_const_iterator< char* >
-    {
-        typedef const char* type;
-    };
-
-    template<>
-    struct range_const_iterator< wchar_t* >
-    {
-        typedef const wchar_t* type;
-    };
-
-    template<>
-    struct range_const_iterator< const char* >
-    {
-        typedef const char* type;
-    };
-
-    template<>
-    struct range_const_iterator< const wchar_t* >
-    {
-        typedef const wchar_t* type;
-    };
-
-    template<>
-    struct range_const_iterator< char* const >
-    {
-        typedef const char* type;
-    };
-
-    template<>
-    struct range_const_iterator< wchar_t* const >
-    {
-        typedef const wchar_t* type;
-    };
-
-    template<>
-    struct range_const_iterator< const char* const >
-    {
-        typedef const char* type;
-    };
-
-    template<>
-    struct range_const_iterator< const wchar_t* const >
-    {
-        typedef const wchar_t* type;
-    };
-
 } // namespace boost
 
 #endif // BOOST_NO_TEMPLATE_PARTIAL_SPECIALIZATION
diff --git a/include/boost/range/const_reverse_iterator.hpp b/include/boost/range/const_reverse_iterator.hpp
index f33f63d..215bcc7 100755
--- a/include/boost/range/const_reverse_iterator.hpp
+++ b/include/boost/range/const_reverse_iterator.hpp
@@ -15,22 +15,17 @@
 # pragma once
 #endif
 
-#include <boost/range/config.hpp>
-#include <boost/range/const_iterator.hpp>
-#include <boost/iterator/reverse_iterator.hpp>
+#include <boost/range/reverse_iterator.hpp>
 
 namespace boost
 {
-    //////////////////////////////////////////////////////////////////////////
-    // default
-    //////////////////////////////////////////////////////////////////////////
+    //
+    // This interface is deprecated, use range_reverse_iterator<const T>
+    //
     
     template< typename C >
-    struct range_const_reverse_iterator
-    {
-        typedef reverse_iterator< 
-            BOOST_DEDUCED_TYPENAME range_const_iterator<C>::type > type;
-    };
+    struct range_const_reverse_iterator : range_reverse_iterator<const C>
+    { };
     
 } // namespace boost
 
diff --git a/include/boost/range/detail/as_literal.hpp b/include/boost/range/detail/as_literal.hpp
new file mode 100755
index 0000000..b4fd925
--- /dev/null
+++ b/include/boost/range/detail/as_literal.hpp
@@ -0,0 +1,33 @@
+// Boost.Range library
+//
+//  Copyright Thorsten Ottosen 2006. 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/
+//
+
+#ifndef BOOST_RANGE_AS_LITERAL_HPP
+#define BOOST_RANGE_AS_LITERAL_HPP
+
+#if defined(_MSC_VER) && (_MSC_VER >= 1200)
+# pragma once
+#endif
+
+#include <boost/range/detail/detail_str.hpp>
+#include <boost/range/iterator_range.hpp>
+
+namespace boost
+{
+    template< class Range >
+    inline iterator_range<BOOST_DEDUCED_TYPENAME range_iterator<Range>::type> 
+    as_literal( Range& r )
+    {
+        return ::boost::make_iterator_range( ::boost::range_detail::str_begin(r),
+                                             ::boost::range_detail::str_end(r) );
+    }
+
+}
+
+#endif
diff --git a/include/boost/range/detail/begin.hpp b/include/boost/range/detail/begin.hpp
index f516a14..06c2561 100755
--- a/include/boost/range/detail/begin.hpp
+++ b/include/boost/range/detail/begin.hpp
@@ -13,7 +13,7 @@
 
 #include <boost/config.hpp> // BOOST_MSVC
 #include <boost/detail/workaround.hpp>
-#include <boost/range/result_iterator.hpp>
+#include <boost/range/iterator.hpp>
 #include <boost/range/detail/common.hpp>
 #if BOOST_WORKAROUND(BOOST_MSVC, < 1310)
 # include <boost/range/value_type.hpp>
@@ -35,7 +35,7 @@ namespace boost
         struct range_begin<std_container_>
         {
             template< typename C >
-            static BOOST_RANGE_DEDUCED_TYPENAME range_result_iterator<C>::type fun( C& c )
+            static BOOST_RANGE_DEDUCED_TYPENAME range_iterator<C>::type fun( C& c )
             {
                 return c.begin();
             };
@@ -49,7 +49,7 @@ namespace boost
         struct range_begin<std_pair_>
         {
             template< typename P >
-            static BOOST_RANGE_DEDUCED_TYPENAME range_result_iterator<P>::type fun( const P& p )
+            static BOOST_RANGE_DEDUCED_TYPENAME range_iterator<P>::type fun( const P& p )
             {
                 return p.first;
             }
@@ -77,51 +77,10 @@ namespace boost
         #endif
         };
 
-        //////////////////////////////////////////////////////////////////////
-        // string
-        //////////////////////////////////////////////////////////////////////
-     
-        template<>
-        struct range_begin<char_ptr_>
-        {
-            static char* fun( char* s )
-            {
-                return s;
-            }
-        };
-
-        template<>
-        struct range_begin<const_char_ptr_>
-        {
-            static const char* fun( const char* s )
-            {
-                return s;
-            }
-        };
-        
-        template<>
-        struct range_begin<wchar_t_ptr_>
-        {
-            
-            static wchar_t* fun( wchar_t* s )
-            {
-                return s;
-            }
-        };
-
-        template<>
-        struct range_begin<const_wchar_t_ptr_>
-        {
-            static const wchar_t* fun( const wchar_t* s )
-            {
-                return s;
-            }
-        };
-
     } // namespace 'range_detail'
     
     template< typename C >
-    inline BOOST_RANGE_DEDUCED_TYPENAME range_result_iterator<C>::type 
+    inline BOOST_RANGE_DEDUCED_TYPENAME range_iterator<C>::type 
     begin( C& c )
     {
         return range_detail::range_begin< BOOST_RANGE_DEDUCED_TYPENAME range_detail::range<C>::type >::fun( c );
diff --git a/include/boost/range/detail/common.hpp b/include/boost/range/detail/common.hpp
index 36fada1..f7539f5 100755
--- a/include/boost/range/detail/common.hpp
+++ b/include/boost/range/detail/common.hpp
@@ -114,3 +114,4 @@ namespace boost
 }
         
 #endif
+
diff --git a/include/boost/range/detail/const_iterator.hpp b/include/boost/range/detail/const_iterator.hpp
index 3aef82a..e5cb34a 100755
--- a/include/boost/range/detail/const_iterator.hpp
+++ b/include/boost/range/detail/const_iterator.hpp
@@ -56,58 +56,6 @@ namespace boost
                     remove_extent<T>::type* type;
             };
         };
-        
-        template<>
-        struct range_const_iterator_<char_array_>
-        { 
-            template< typename T >
-            struct pts
-            {
-                typedef const BOOST_RANGE_DEDUCED_TYPENAME 
-                    remove_extent<T>::type* type;
-            };
-        };
-
-        template<>
-        struct range_const_iterator_<char_ptr_>
-        {
-            template< typename S >
-            struct pts
-            {
-                typedef const char* type; 
-            };         
-        };
-        
-        template<>
-        struct range_const_iterator_<const_char_ptr_>
-        {
-            template< typename S >
-            struct pts
-            {
-                typedef const char* type; 
-            };         
-        };
-
-        template<>
-        struct range_const_iterator_<wchar_t_ptr_>
-        {
-            template< typename S >
-            struct pts
-            {
-                typedef const wchar_t* type; 
-            };         
-        };
-
-        template<>
-        struct range_const_iterator_<const_wchar_t_ptr_>
-        {
-             template< typename S >
-             struct pts
-             {
-                 typedef const wchar_t* type; 
-             };         
-         };
-
     } 
     
     template< typename C >
diff --git a/include/boost/range/detail/detail_str.hpp b/include/boost/range/detail/detail_str.hpp
new file mode 100755
index 0000000..d5ad5b3
--- /dev/null
+++ b/include/boost/range/detail/detail_str.hpp
@@ -0,0 +1,376 @@
+// 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/
+//
+
+#ifndef BOOST_RANGE_DETAIL_DETAIL_STR_HPP
+#define BOOST_RANGE_DETAIL_DETAIL_STR_HPP
+
+#include <boost/config.hpp> // BOOST_MSVC
+#include <boost/range/iterator.hpp>
+
+namespace boost 
+{
+    
+    namespace range_detail
+    {
+        //
+        // iterator
+        //
+        
+        template<>
+        struct range_iterator_<char_array_>
+        { 
+            template< typename T >
+            struct pts
+            {
+                 typedef BOOST_RANGE_DEDUCED_TYPENAME 
+                    remove_extent<T>::type* type;
+            };
+        };
+
+        template<>
+        struct range_iterator_<char_ptr_>
+        {
+            template< typename S >
+            struct pts
+            {
+                typedef char* type; 
+            };         
+        };
+
+        template<>
+        struct range_iterator_<const_char_ptr_>
+        {
+            template< typename S >
+            struct pts
+            {
+                typedef const char* type;
+            };         
+        };
+
+        template<>
+        struct range_iterator_<wchar_t_ptr_>
+        {
+            template< typename S >
+            struct pts
+            {
+                typedef wchar_t* type; 
+            };         
+        };
+
+        template<>
+        struct range_iterator_<const_wchar_t_ptr_>
+        {
+             template< typename S >
+             struct pts
+             {
+                 typedef const wchar_t* type; 
+             };         
+        };
+
+
+        //
+        // const iterator
+        //
+
+        template<>
+        struct range_const_iterator_<char_array_>
+        { 
+            template< typename T >
+            struct pts
+            {
+                typedef const BOOST_RANGE_DEDUCED_TYPENAME 
+                    remove_extent<T>::type* type;
+            };
+        };
+
+        template<>
+        struct range_const_iterator_<char_ptr_>
+        {
+            template< typename S >
+            struct pts
+            {
+                typedef const char* type; 
+            };         
+        };
+
+        template<>
+        struct range_const_iterator_<const_char_ptr_>
+        {
+            template< typename S >
+            struct pts
+            {
+                typedef const char* type; 
+            };         
+        };
+
+        template<>
+        struct range_const_iterator_<wchar_t_ptr_>
+        {
+            template< typename S >
+            struct pts
+            {
+                typedef const wchar_t* type; 
+            };         
+        };
+
+        template<>
+        struct range_const_iterator_<const_wchar_t_ptr_>
+        {
+             template< typename S >
+             struct pts
+             {
+                 typedef const wchar_t* type; 
+             };         
+        };
+    }
+}
+
+#include <boost/range/detail/begin.hpp>
+#include <boost/range/detail/end.hpp>
+#include <boost/range/detail/size_type>
+#include <boost/range/detail/value_type>
+#include <boost/range/detail/common.hpp>
+
+namespace boost 
+{
+    
+    namespace range_detail
+    {
+        //
+        // str_begin()
+        //
+        template<>
+        struct range_begin<char_ptr_>
+        {
+            static char* fun( char* s )
+            {
+                return s;
+            }
+        };
+
+        template<>
+        struct range_begin<const_char_ptr_>
+        {
+            static const char* fun( const char* s )
+            {
+                return s;
+            }
+        };
+        
+        template<>
+        struct range_begin<wchar_t_ptr_>
+        {
+            
+            static wchar_t* fun( wchar_t* s )
+            {
+                return s;
+            }
+        };
+
+        template<>
+        struct range_begin<const_wchar_t_ptr_>
+        {
+            static const wchar_t* fun( const wchar_t* s )
+            {
+                return s;
+            }
+        };
+        
+        template< typename C >
+        inline BOOST_RANGE_DEDUCED_TYPENAME range_iterator<C>::type 
+        str_begin( C& c )
+        {
+            return range_detail::range_begin< BOOST_RANGE_DEDUCED_TYPENAME 
+                range_detail::range<C>::type >::fun( c );
+        }
+
+        //
+        // str_end()
+        //
+
+        template<>
+        struct range_end<char_array_>
+        {
+            template< typename T, std::size_t sz >
+            static T* fun( T BOOST_RANGE_ARRAY_REF()[sz] )
+            {
+                return boost::range_detail::array_end( boost_range_array );
+            }
+        };
+        
+        template<>
+        struct range_end<wchar_t_array_>
+        {
+            template< typename T, std::size_t sz >
+            static T* fun( T BOOST_RANGE_ARRAY_REF()[sz] )
+            {
+                return boost::range_detail::array_end( boost_range_array );
+            }
+        };
+        
+        template<>
+        struct range_end<char_ptr_>
+        {
+            static char* fun( char* s )
+            {
+                return boost::range_detail::str_end( s );
+            }
+        };
+
+        template<>
+        struct range_end<const_char_ptr_>
+        {
+            static const char* fun( const char* s )
+            {
+                return boost::range_detail::str_end( s );
+            }
+        };
+
+        template<>
+        struct range_end<wchar_t_ptr_>
+        {
+            static wchar_t* fun( wchar_t* s )
+            {
+                return boost::range_detail::str_end( s );
+            }
+        };
+
+
+        template<>
+        struct range_end<const_wchar_t_ptr_>
+        {
+            static const wchar_t* fun( const wchar_t* s )
+            {
+                return boost::range_detail::str_end( s );
+            }
+        };
+
+        template< typename C >
+        inline BOOST_RANGE_DEDUCED_TYPENAME range_iterator<C>::type 
+        str_end( C& c )
+        {
+            return range_detail::range_end< BOOST_RANGE_DEDUCED_TYPENAME 
+                range_detail::range<C>::type >::fun( c );
+        }
+
+        //
+        // size_type
+        //
+
+        template<>
+        struct range_size_type_<char_array_>
+        { 
+            template< typename A >
+            struct pts
+            {
+                typedef std::size_t type;
+            };
+        };
+
+        template<>
+        struct range_size_type_<char_ptr_>
+        {
+            template< typename S >
+            struct pts
+            {
+                typedef std::size_t type;
+            };         
+        };
+        
+        template<>
+        struct range_size_type_<const_char_ptr_>
+        {
+            template< typename S >
+            struct pts
+            {
+                typedef std::size_t type;
+            };         
+        };
+        
+        template<>
+        struct range_size_type_<wchar_t_ptr_>
+        {
+            template< typename S >
+            struct pts
+            {
+                typedef std::size_t type;
+            };         
+        };
+        
+        template<>
+        struct range_size_type_<const_wchar_t_ptr_>
+        {
+            template< typename S >
+            struct pts
+            {
+                typedef std::size_t type;
+            };         
+        };  
+
+        //
+        // value_type
+        //
+        
+        template<>
+        struct range_value_type_<char_array_>
+        { 
+            template< typename T >
+            struct pts
+            {
+                typedef char type;
+            };
+        };
+
+        template<>
+        struct range_value_type_<char_ptr_>
+        {
+             template< typename S >
+             struct pts
+             {
+                 typedef char type; 
+             };         
+        };
+        
+        template<>
+        struct range_value_type_<const_char_ptr_>
+        {
+             template< typename S >
+             struct pts
+             {
+                 typedef const char type;
+             };         
+        };
+        
+        template<>
+        struct range_value_type_<wchar_t_ptr_>
+        {
+             template< typename S >
+             struct pts
+             {
+                 typedef wchar_t type;
+             };         
+        };
+        
+        template<>
+        struct range_value_type_<const_wchar_t_ptr_>
+        {
+            template< typename S >
+            struct pts
+            {
+                typedef const wchar_t type;
+            };         
+        };
+
+    } // namespace 'range_detail'
+
+} // namespace 'boost'
+
+
+#endif
diff --git a/include/boost/range/detail/end.hpp b/include/boost/range/detail/end.hpp
index 410ae60..d6a7368 100755
--- a/include/boost/range/detail/end.hpp
+++ b/include/boost/range/detail/end.hpp
@@ -18,8 +18,7 @@
 # include <boost/range/detail/vc6/end.hpp>
 #else
 # include <boost/range/detail/implementation_help.hpp>
-# include <boost/range/detail/implementation_help.hpp>
-# include <boost/range/result_iterator.hpp>
+# include <boost/range/iterator.hpp>
 # include <boost/range/detail/common.hpp>
 # if BOOST_WORKAROUND(BOOST_MSVC, < 1310)
 #  include <boost/range/detail/remove_extent.hpp>
@@ -40,7 +39,7 @@ namespace boost
         struct range_end<std_container_>
         {
             template< typename C >
-            static BOOST_RANGE_DEDUCED_TYPENAME range_result_iterator<C>::type 
+            static BOOST_RANGE_DEDUCED_TYPENAME range_iterator<C>::type 
             fun( C& c )
             {
                 return c.end();
@@ -55,7 +54,7 @@ namespace boost
         struct range_end<std_pair_>
         {
             template< typename P >
-            static BOOST_RANGE_DEDUCED_TYPENAME range_result_iterator<P>::type 
+            static BOOST_RANGE_DEDUCED_TYPENAME range_iterator<P>::type 
             fun( const P& p )
             {
                 return p.second;
@@ -83,73 +82,11 @@ namespace boost
             }
         #endif
         };
-
-                
-        template<>
-        struct range_end<char_array_>
-        {
-            template< typename T, std::size_t sz >
-            static T* fun( T BOOST_RANGE_ARRAY_REF()[sz] )
-            {
-                return boost::range_detail::array_end( boost_range_array );
-            }
-        };
-        
-        template<>
-        struct range_end<wchar_t_array_>
-        {
-            template< typename T, std::size_t sz >
-            static T* fun( T BOOST_RANGE_ARRAY_REF()[sz] )
-            {
-                return boost::range_detail::array_end( boost_range_array );
-            }
-        };
-
-        //////////////////////////////////////////////////////////////////////
-        // string
-        //////////////////////////////////////////////////////////////////////
-        
-        template<>
-        struct range_end<char_ptr_>
-        {
-            static char* fun( char* s )
-            {
-                return boost::range_detail::str_end( s );
-            }
-        };
-
-        template<>
-        struct range_end<const_char_ptr_>
-        {
-            static const char* fun( const char* s )
-            {
-                return boost::range_detail::str_end( s );
-            }
-        };
-
-        template<>
-        struct range_end<wchar_t_ptr_>
-        {
-            static wchar_t* fun( wchar_t* s )
-            {
-                return boost::range_detail::str_end( s );
-            }
-        };
-
-
-        template<>
-        struct range_end<const_wchar_t_ptr_>
-        {
-            static const wchar_t* fun( const wchar_t* s )
-            {
-                return boost::range_detail::str_end( s );
-            }
-        };
         
     } // namespace 'range_detail'
     
     template< typename C >
-    inline BOOST_RANGE_DEDUCED_TYPENAME range_result_iterator<C>::type 
+    inline BOOST_RANGE_DEDUCED_TYPENAME range_iterator<C>::type 
     end( C& c )
     {
         return range_detail::range_end< BOOST_RANGE_DEDUCED_TYPENAME range_detail::range<C>::type >::fun( c );
diff --git a/include/boost/range/detail/implementation_help.hpp b/include/boost/range/detail/implementation_help.hpp
index 11c6612..da086f0 100755
--- a/include/boost/range/detail/implementation_help.hpp
+++ b/include/boost/range/detail/implementation_help.hpp
@@ -57,48 +57,16 @@ namespace boost
             return const_cast<Char*>( str_end( s, s ) );
         }
 
-        template< class T, std::size_t sz >
-        inline T* array_end( T BOOST_RANGE_ARRAY_REF()[sz], int )
-        {
-            return boost_range_array + sz;
-        }
-        
-        template< class T, std::size_t sz >
-        inline const T* array_end( const T BOOST_RANGE_ARRAY_REF()[sz], int )
-        {
-            return boost_range_array + sz;
-        }
-
-        template< class T, std::size_t sz >
-        inline T* array_end( T BOOST_RANGE_ARRAY_REF()[sz], char_or_wchar_t_array_tag )
-        {
-            return boost_range_array + sz - 1;
-        }
-        
-        template< class T, std::size_t sz >
-        inline const T* array_end( const T BOOST_RANGE_ARRAY_REF()[sz], char_or_wchar_t_array_tag )
-        {
-            return boost_range_array + sz - 1;
-        }
-
         template< class T, std::size_t sz >
         inline T* array_end( T BOOST_RANGE_ARRAY_REF()[sz] )
         {
-            typedef BOOST_RANGE_DEDUCED_TYPENAME boost::mpl::if_c< is_same<char,T>::value || is_same<wchar_t,T>::value,
-                                                                char_or_wchar_t_array_tag,
-                                                                int >::type tag;
-
-            return array_end<T,sz>( boost_range_array, tag() );
+            return boost_range_array + sz;
         }
         
         template< class T, std::size_t sz >
         inline const T* array_end( const T BOOST_RANGE_ARRAY_REF()[sz] )
         {
-            typedef BOOST_RANGE_DEDUCED_TYPENAME boost::mpl::if_c< is_same<char,T>::value || is_same<wchar_t,T>::value,
-                                                                char_or_wchar_t_array_tag,
-                                                                int >::type tag;
-        
-            return array_end<T,sz>( boost_range_array, tag() );
+            return boost_range_array + sz;
         }
 
         /////////////////////////////////////////////////////////////////////
@@ -110,48 +78,17 @@ namespace boost
         {
             return str_end( s ) - s;
         }
-         
-        template< class T, std::size_t sz >
-        inline std::size_t array_size( T BOOST_RANGE_ARRAY_REF()[sz], int )
-        {
-            return sz;
-        }
-       
-        template< class T, std::size_t sz >
-        inline std::size_t array_size( const T BOOST_RANGE_ARRAY_REF()[sz], int )
-        {
-            return sz;
-        }
-
-        template< class T, std::size_t sz >
-        inline std::size_t array_size( T BOOST_RANGE_ARRAY_REF()[sz], char_or_wchar_t_array_tag )
-        {
-            return sz - 1;
-        }
-                 
-        template< class T, std::size_t sz >
-        inline std::size_t array_size( const T BOOST_RANGE_ARRAY_REF()[sz], char_or_wchar_t_array_tag )
-        {
-            return sz - 1;
-        }
 
         template< class T, std::size_t sz >
         inline std::size_t array_size( T BOOST_RANGE_ARRAY_REF()[sz] )
         {
-            typedef BOOST_RANGE_DEDUCED_TYPENAME boost::mpl::if_c< is_same<const char,T>::value || is_same<const wchar_t,T>::value ||
-                                                                   is_same<char,T>::value       || is_same<wchar_t,T>::value,
-                                                                char_or_wchar_t_array_tag,
-                                                                int >::type tag;
-            return array_size<T,sz>( boost_range_array, tag() );
+            return sz;
         }
 
         template< class T, std::size_t sz >
         inline std::size_t array_size( const T BOOST_RANGE_ARRAY_REF()[sz] )
         {
-            typedef BOOST_RANGE_DEDUCED_TYPENAME boost::mpl::if_c< is_same<char,T>::value || is_same<wchar_t,T>::value,
-                                                                char_or_wchar_t_array_tag,
-                                                                int >::type tag;
-            return array_size<T,sz>( boost_range_array, tag() );
+            return sz;
         }
 
     } // namespace 'range_detail'
diff --git a/include/boost/range/detail/iterator.hpp b/include/boost/range/detail/iterator.hpp
index b9098e6..58346d4 100755
--- a/include/boost/range/detail/iterator.hpp
+++ b/include/boost/range/detail/iterator.hpp
@@ -64,60 +64,10 @@ namespace boost
             };
         };
         
-        template<>
-        struct range_iterator_<char_array_>
-        { 
-            template< typename T >
-            struct pts
-            {
-                 typedef BOOST_RANGE_DEDUCED_TYPENAME 
-                    remove_extent<T>::type* type;
-            };
-        };
-
-        template<>
-        struct range_iterator_<char_ptr_>
-        {
-            template< typename S >
-            struct pts
-            {
-                typedef char* type; 
-            };         
-        };
-        
-        template<>
-        struct range_iterator_<const_char_ptr_>
-        {
-            template< typename S >
-            struct pts
-            {
-                typedef const char* type;
-            };         
-        };
-
-        template<>
-        struct range_iterator_<wchar_t_ptr_>
-        {
-            template< typename S >
-            struct pts
-            {
-                typedef wchar_t* type; 
-            };         
-        };
-
-        template<>
-        struct range_iterator_<const_wchar_t_ptr_>
-        {
-             template< typename S >
-             struct pts
-             {
-                 typedef const wchar_t* type; 
-             };         
-         };
     } 
 
     template< typename C >
-    class range_iterator
+    class range_mutable_iterator
     {
         typedef BOOST_RANGE_DEDUCED_TYPENAME range_detail::range<C>::type c_type;
     public:
diff --git a/include/boost/range/detail/mfc/carray.hpp b/include/boost/range/detail/mfc/carray.hpp
deleted file mode 100755
index 71ab5cb..0000000
--- a/include/boost/range/detail/mfc/carray.hpp
+++ /dev/null
@@ -1,97 +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/
-//
-
-#if !defined( BOOST_RANGE_DETAIL_MFC_CARRAY_HPP ) && defined( BOOST_RANGE_ENABLE_MCF_CARRAY ) 
-#define BOOST_RANGE_DETAIL_MFC_CARRAY_HPP
-
-#if defined(_MSC_VER) && (_MSC_VER >= 1200)
-# pragma once
-#endif
-
-#include <afxtempl.h> // for CArray
-#include <boost/range/config.hpp>
-#include <boost/range/metafunctions.hpp>
-
-namespace boost
-{
-    template< class T, class U >
-    struct range_iterator< CArray<T,U> >
-    {
-        typedef T* type;
-    };
-
-    //
-    // Why is this needed?!?
-    //
-    template< class T, class U >
-    struct range_iterator< const CArray<T,U> >
-    {
-        typedef T* type;
-    };
-
-    template< class T, class U >
-    struct range_const_iterator< CArray<T,U> >
-    {
-        typedef const T* type;
-    };
-    
-    template< class T, class U >
-    struct range_difference< CArray<T,U> >
-    {
-        typedef std::ptrdiff_t type;
-    };
-    
-    template< class T, class U >
-    struct range_size< CArray<T,U> >
-    {
-        typedef int type;
-    };
-
-    template< class T, class U >
-    struct range_value< CArray<T,U> >
-    {
-        typedef T type;
-    };
-
-    template< class T, class U >
-    T* boost_range_begin( CArray<T,U>& r )
-    {
-        return r.GetData();
-    }
-        
-    template< class T, class U >
-    const T* boost_range_begin( const CArray<T,U>& r )
-    {
-        return r.GetData();
-    }
-
-    template< class T, class U >
-    int boost_range_size( const CArray<T,U>& r )
-    {
-        return r.GetSize();
-    }
-    
-    template< class T, class U >
-    T* boost_range_end( CArray<T,U>& r )
-    {
-        return boost_range_begin( r ) + boost_range_size( r );
-    }
-        
-    template< class T, class U >
-    const T* boost_range_end( const CArray<T,U>& r )
-    {
-        return boost_range_begin( r ) + boost_range_size( r );
-    }
-
-    // default 'empty()' ok
-
-} // namespace 'boost'
-
-#endif
diff --git a/include/boost/range/detail/mfc/cstring.hpp b/include/boost/range/detail/mfc/cstring.hpp
deleted file mode 100755
index ccb0745..0000000
--- a/include/boost/range/detail/mfc/cstring.hpp
+++ /dev/null
@@ -1,92 +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/
-//
-
-#if !defined(BOOST_RANGE_DETAIL_MFC_CSTRING_HPP) && defined(BOOST_RANGE_ENABLE_MFC)
-#define BOOST_RANGE_DETAIL_MFC_CSTRING_HPP
-
-#if defined(_MSC_VER) && (_MSC_VER >= 1200)
-# pragma once
-#endif
-
-#include <afx.h> // for CString
-#include <boost/range/config.hpp>
-#include <boost/range/metafunctions.hpp>
-
-namespace boost
-{
-    template<>
-    struct range_iterator< CString >
-    {
-        typedef TCHAR* type;
-    };
-
-    //
-    // Why is this needed?!?
-    //
-    template<>
-    struct range_iterator< const CString >
-    {
-        typedef TCHAR* type;
-    };
-
-    template<>
-    struct range_const_iterator< CString >
-    {
-        typedef const TCHAR* type;
-    };
-
-    template<>
-    struct range_difference< CString >
-    {
-        typedef std::ptrdiff_t type;
-    };
-
-    template<>
-    struct range_size< CString >
-    {
-        typedef int type;
-    };
-
-    template<>
-    struct range_value< CString >
-    {
-        typedef TCHAR type;
-    };
-
-    TCHAR* boost_range_begin( CString& r )
-    {
-        return r.GetBuffer(0);
-    }
-        
-    const TCHAR* boost_range_begin( const CString& r )
-    {
-        return (LPCTSTR)r;
-    }
-
-    int boost_range_size( const CString& r )
-    {
-        return r.GetLength();
-    }
-    
-    TCHAR* boost_range_end( CString& r )
-    {
-        return boost_range_begin( r ) + boost_range_size( r );
-    }
-        
-    const TCHAR* range_adl_end( const CString& r )
-    {
-        return boost_range_begin( r ) + boost_range_size( r );
-    }
-
-    // default 'empty()' ok
-
-} // namespace 'boost'
-
-#endif
diff --git a/include/boost/range/detail/microsoft.hpp b/include/boost/range/detail/microsoft.hpp
new file mode 100644
index 0000000..7b672c9
--- /dev/null
+++ b/include/boost/range/detail/microsoft.hpp
@@ -0,0 +1,931 @@
+#ifndef BOOST_RANGE_DETAIL_MICROSOFT_HPP
+#define BOOST_RANGE_DETAIL_MICROSOFT_HPP
+
+// Boost.Range MFC/ATL Extension
+//
+// Copyright Shunsuke Sogame 2005-2006.
+// Distributed under the Boost Software License, Version 1.0. 
+// (See accompanying file LICENSE_1_0.txt or copy at 
+// http://www.boost.org/LICENSE_1_0.txt)
+
+
+
+
+// config
+//
+
+
+#include <boost/range/iterator.hpp>
+
+
+#define BOOST_RANGE_DETAIL_MICROSOFT_RANGE_VERSION_1 1
+
+
+#if !defined(BOOST_RANGE_DETAIL_MICROSOFT_RANGE_VERSION_1)
+    #define BOOST_RANGE_DETAIL_MICROSOFT_range_mutable_iterator range_mutable_iterator
+    #define BOOST_RANGE_DETAIL_MICROSOFT_range_begin            range_begin
+    #define BOOST_RANGE_DETAIL_MICROSOFT_range_end              range_end
+#else
+    #define BOOST_RANGE_DETAIL_MICROSOFT_range_mutable_iterator range_mutable_iterator
+    #define BOOST_RANGE_DETAIL_MICROSOFT_range_begin            range_begin
+    #define BOOST_RANGE_DETAIL_MICROSOFT_range_end              range_end
+#endif
+
+
+
+
+// yet another customization way
+//
+
+
+#include <boost/iterator/iterator_traits.hpp> // iterator_difference
+#include <boost/mpl/identity.hpp>
+#include <boost/mpl/if.hpp>
+#include <boost/preprocessor/cat.hpp>
+#include <boost/preprocessor/control/iif.hpp>
+#include <boost/preprocessor/comma_if.hpp>
+#include <boost/preprocessor/detail/is_unary.hpp>
+#include <boost/preprocessor/list/for_each.hpp>
+#include <boost/preprocessor/repetition/enum_params.hpp>
+#include <boost/preprocessor/repetition/repeat.hpp>
+#include <boost/preprocessor/seq/for_each_i.hpp>
+#include <boost/preprocessor/seq/size.hpp>
+#include <boost/preprocessor/tuple/eat.hpp>
+#include <boost/range/const_iterator.hpp>
+#include <boost/range/size_type.hpp>
+#include <boost/type_traits/is_const.hpp>
+#include <boost/type_traits/is_same.hpp>
+#include <boost/type_traits/remove_cv.hpp>
+#include <boost/utility/addressof.hpp>
+#include <boost/utility/enable_if.hpp> // disable_if
+
+#if !defined(BOOST_RANGE_DETAIL_MICROSOFT_RANGE_VERSION_1)
+    #include <boost/range/mutable_iterator.hpp>
+#else
+    #include <iterator> // distance
+    #include <boost/range/begin.hpp>
+    #include <boost/range/end.hpp>
+    #include <boost/range/iterator.hpp>
+#endif
+
+
+namespace boost { namespace range_detail_microsoft {
+
+
+    // customization point
+    //
+
+    template< class Tag >
+    struct customization;
+
+
+    template< class T >
+    struct customization_tag;
+
+
+    struct using_type_as_tag
+    { };
+
+
+    // Topic:
+    // In fact, it is unnecessary for VC++.
+    // VC++'s behavior seems conforming, while GCC fails without this.
+    template< class Iterator, class T >
+    struct mutable_ :
+        disable_if< is_const<T>, Iterator >
+    { };
+
+
+    // helpers
+    //
+
+    template< class Tag, class T >
+    struct customization_tag_of
+    {
+        typedef typename mpl::if_< is_same<using_type_as_tag, Tag>,
+            T,
+            Tag
+        >::type type;
+    };
+
+
+    template< class T >
+    struct customization_of
+    {
+        typedef typename remove_cv<T>::type bare_t;
+        typedef typename customization_tag<bare_t>::type tag_t;
+        typedef customization<tag_t> type;
+    };
+
+
+    template< class T >
+    struct mutable_iterator_of
+    {
+        typedef typename remove_cv<T>::type bare_t;
+        typedef typename customization_of<bare_t>::type cust_t;
+        typedef typename cust_t::template meta<bare_t>::mutable_iterator type;
+    };
+
+
+    template< class T >
+    struct const_iterator_of
+    {
+        typedef typename remove_cv<T>::type bare_t;
+        typedef typename customization_of<bare_t>::type cust_t;
+        typedef typename cust_t::template meta<bare_t>::const_iterator type;
+    };
+
+
+    template< class T >
+    struct size_type_of
+    {
+        typedef typename range_detail_microsoft::mutable_iterator_of<T>::type miter_t;
+        typedef typename iterator_difference<miter_t>::type type;
+    };
+
+
+    template< class T > inline
+    typename mutable_iterator_of<T>::type
+    begin_of(T& x)
+    {
+        typedef typename customization_of<T>::type cust_t;
+        return cust_t().template begin<typename mutable_iterator_of<T>::type>(x);
+    }
+
+
+    template< class T > inline
+    typename const_iterator_of<T>::type
+    begin_of(T const& x)
+    {
+        typedef typename customization_of<T>::type cust_t;
+        return cust_t().template begin<typename const_iterator_of<T>::type>(x);
+    }
+
+
+    template< class T > inline
+    typename mutable_iterator_of<T>::type
+    end_of(T& x)
+    {
+        typedef typename customization_of<T>::type cust_t;
+        return cust_t().template end<typename mutable_iterator_of<T>::type>(x);
+    }
+
+
+    template< class T > inline
+    typename const_iterator_of<T>::type
+    end_of(T const& x)
+    {
+        typedef typename customization_of<T>::type cust_t;
+        return cust_t().template end<typename const_iterator_of<T>::type>(x);
+    }
+
+
+#if defined(BOOST_RANGE_DETAIL_MICROSOFT_RANGE_VERSION_1)
+
+    template< class T > inline
+    typename size_type_of<T>::type
+    size_of(T const& x)
+    {
+        return std::distance(boost::begin(x), boost::end(x));
+    }
+
+#endif
+
+
+    template< class Range >
+    struct compatible_mutable_iterator : 
+        BOOST_RANGE_DETAIL_MICROSOFT_range_mutable_iterator<Range>
+    { };
+
+
+} } // namespace boost::range_detail_microsoft
+
+
+#define BOOST_RANGE_DETAIL_MICROSOFT_CUSTOMIZATION_namespace_open(NamespaceList) \
+    BOOST_PP_LIST_FOR_EACH(BOOST_RANGE_DETAIL_MICROSOFT_CUSTOMIZATION_namespace_open_op, ~, NamespaceList) \
+/**/
+
+    #define BOOST_RANGE_DETAIL_MICROSOFT_CUSTOMIZATION_namespace_open_op(r, data, elem) \
+        namespace elem { \
+    /**/
+
+
+#define BOOST_RANGE_DETAIL_MICROSOFT_CUSTOMIZATION_namespace_close(NamespaceList) \
+    BOOST_PP_LIST_FOR_EACH(BOOST_RANGE_DETAIL_MICROSOFT_CUSTOMIZATION_namespace_close_op, ~, NamespaceList) \
+/**/
+
+    #define BOOST_RANGE_DETAIL_MICROSOFT_CUSTOMIZATION_namespace_close_op(r, data, elem) \
+        } \
+    /**/
+
+
+#define BOOST_RANGE_DETAIL_MICROSOFT_CUSTOMIZATION_namespace_expand_op(r, data, elem) \
+    :: elem \
+/**/
+
+
+#define BOOST_RANGE_DETAIL_MICROSOFT_CUSTOMIZATION_TYPE(Tag, NamespaceList, Name) \
+    namespace boost { namespace range_detail_microsoft { \
+        BOOST_RANGE_DETAIL_MICROSOFT_CUSTOMIZATION_TYPE_tag(Tag, BOOST_RANGE_DETAIL_MICROSOFT_CUSTOMIZATION_TYPE_fullname(NamespaceList, Name)) \
+    } } \
+    \
+    namespace boost { \
+        BOOST_RANGE_DETAIL_MICROSOFT_CUSTOMIZATION_TYPE_mutable_iterator(BOOST_RANGE_DETAIL_MICROSOFT_CUSTOMIZATION_TYPE_fullname(NamespaceList, Name)) \
+        BOOST_RANGE_DETAIL_MICROSOFT_CUSTOMIZATION_TYPE_const_iterator(BOOST_RANGE_DETAIL_MICROSOFT_CUSTOMIZATION_TYPE_fullname(NamespaceList, Name)) \
+        BOOST_RANGE_DETAIL_MICROSOFT_CUSTOMIZATION_TYPE_size_type(BOOST_RANGE_DETAIL_MICROSOFT_CUSTOMIZATION_TYPE_fullname(NamespaceList, Name)) \
+    } \
+    \
+    BOOST_RANGE_DETAIL_MICROSOFT_CUSTOMIZATION_namespace_open(NamespaceList) \
+        BOOST_RANGE_DETAIL_MICROSOFT_CUSTOMIZATION_TYPE_begin(BOOST_RANGE_DETAIL_MICROSOFT_CUSTOMIZATION_TYPE_fullname(NamespaceList, Name)) \
+        BOOST_RANGE_DETAIL_MICROSOFT_CUSTOMIZATION_TYPE_begin_const(BOOST_RANGE_DETAIL_MICROSOFT_CUSTOMIZATION_TYPE_fullname(NamespaceList, Name)) \
+        BOOST_RANGE_DETAIL_MICROSOFT_CUSTOMIZATION_TYPE_end(BOOST_RANGE_DETAIL_MICROSOFT_CUSTOMIZATION_TYPE_fullname(NamespaceList, Name)) \
+        BOOST_RANGE_DETAIL_MICROSOFT_CUSTOMIZATION_TYPE_end_const(BOOST_RANGE_DETAIL_MICROSOFT_CUSTOMIZATION_TYPE_fullname(NamespaceList, Name)) \
+        BOOST_RANGE_DETAIL_MICROSOFT_CUSTOMIZATION_TYPE_size(BOOST_RANGE_DETAIL_MICROSOFT_CUSTOMIZATION_TYPE_fullname(NamespaceList, Name)) \
+    BOOST_RANGE_DETAIL_MICROSOFT_CUSTOMIZATION_namespace_close(NamespaceList) \
+/**/
+
+
+    #define BOOST_RANGE_DETAIL_MICROSOFT_CUSTOMIZATION_TYPE_fullname(NamespaceList, Name) \
+        BOOST_PP_LIST_FOR_EACH(BOOST_RANGE_DETAIL_MICROSOFT_CUSTOMIZATION_namespace_expand_op, ~, NamespaceList) :: Name \
+    /**/
+
+
+    #define BOOST_RANGE_DETAIL_MICROSOFT_CUSTOMIZATION_TYPE_tag(Tag, Fullname) \
+        template< > \
+        struct customization_tag< Fullname > : \
+            customization_tag_of< Tag, Fullname > \
+        { }; \
+    /**/
+
+
+    // metafunctions
+    //
+
+    #define BOOST_RANGE_DETAIL_MICROSOFT_CUSTOMIZATION_TYPE_mutable_iterator(Fullname) \
+        template< > \
+        struct BOOST_RANGE_DETAIL_MICROSOFT_range_mutable_iterator< Fullname > : \
+            range_detail_microsoft::mutable_iterator_of< Fullname > \
+        { }; \
+    /**/
+
+
+    #define BOOST_RANGE_DETAIL_MICROSOFT_CUSTOMIZATION_TYPE_const_iterator(Fullname) \
+        template< > \
+        struct range_const_iterator< Fullname > : \
+            range_detail_microsoft::const_iterator_of< Fullname > \
+        { }; \
+    /**/
+
+
+    #define BOOST_RANGE_DETAIL_MICROSOFT_CUSTOMIZATION_TYPE_size_type(Fullname) \
+        template< > \
+        struct range_size< Fullname > : \
+            range_detail_microsoft::size_type_of< Fullname > \
+        { }; \
+    /**/
+
+
+    // functions
+    //
+
+    #define BOOST_RANGE_DETAIL_MICROSOFT_CUSTOMIZATION_TYPE_begin(Fullname) \
+        inline \
+        boost::range_detail_microsoft::mutable_iterator_of< Fullname >::type \
+        BOOST_RANGE_DETAIL_MICROSOFT_range_begin(Fullname& x) \
+        { \
+            return boost::range_detail_microsoft::begin_of(x); \
+        } \
+    /**/
+
+
+    #define BOOST_RANGE_DETAIL_MICROSOFT_CUSTOMIZATION_TYPE_begin_const(Fullname) \
+        inline \
+        boost::range_detail_microsoft::const_iterator_of< Fullname >::type \
+        BOOST_RANGE_DETAIL_MICROSOFT_range_begin(Fullname const& x) \
+        { \
+            return boost::range_detail_microsoft::begin_of(x); \
+        } \
+    /**/
+
+
+    #define BOOST_RANGE_DETAIL_MICROSOFT_CUSTOMIZATION_TYPE_end(Fullname) \
+        inline \
+        boost::range_detail_microsoft::mutable_iterator_of< Fullname >::type \
+        BOOST_RANGE_DETAIL_MICROSOFT_range_end(Fullname& x) \
+        { \
+            return boost::range_detail_microsoft::end_of(x); \
+        } \
+    /**/
+
+
+    #define BOOST_RANGE_DETAIL_MICROSOFT_CUSTOMIZATION_TYPE_end_const(Fullname) \
+        inline \
+        boost::range_detail_microsoft::const_iterator_of< Fullname >::type \
+        BOOST_RANGE_DETAIL_MICROSOFT_range_end(Fullname const& x) \
+        { \
+            return boost::range_detail_microsoft::end_of(x); \
+        } \
+    /**/
+
+
+    #if !defined(BOOST_RANGE_DETAIL_MICROSOFT_RANGE_VERSION_1)
+
+        #define BOOST_RANGE_DETAIL_MICROSOFT_CUSTOMIZATION_TYPE_size(Fullname) \
+        /**/
+
+    #else
+
+        #define BOOST_RANGE_DETAIL_MICROSOFT_CUSTOMIZATION_TYPE_size(Fullname) \
+            inline \
+            boost::range_detail_microsoft::size_type_of< Fullname >::type \
+            boost_range_size(Fullname const& x) \
+            { \
+                return boost::range_detail_microsoft::size_of(x); \
+            } \
+        /**/
+
+    #endif
+
+
+#define BOOST_RANGE_DETAIL_MICROSOFT_CUSTOMIZATION_TEMPLATE(Tag, NamespaceList, Name, ParamSeqOrCount) \
+    BOOST_RANGE_DETAIL_MICROSOFT_CUSTOMIZATION_TEMPLATE_impl( \
+        Tag, NamespaceList, Name, \
+        BOOST_RANGE_DETAIL_MICROSOFT_CUSTOMIZATION_TEMPLATE_to_param_seq(ParamSeqOrCount) \
+    ) \
+/**/
+
+    #define BOOST_RANGE_DETAIL_MICROSOFT_CUSTOMIZATION_TEMPLATE_to_param_seq(ParamSeqOrCount) \
+        BOOST_PP_IIF(BOOST_PP_IS_UNARY(ParamSeqOrCount), \
+            ParamSeqOrCount BOOST_PP_TUPLE_EAT(3), \
+            BOOST_PP_REPEAT \
+        )(ParamSeqOrCount, BOOST_RANGE_DETAIL_MICROSOFT_CUSTOMIZATION_TEMPLATE_to_param_seq_op, ~) \
+    /**/
+
+        #define BOOST_RANGE_DETAIL_MICROSOFT_CUSTOMIZATION_TEMPLATE_to_param_seq_op(z, n, _) \
+            (class) \
+        /**/
+
+
+#define BOOST_RANGE_DETAIL_MICROSOFT_CUSTOMIZATION_TEMPLATE_impl(Tag, NamespaceList, Name, ParamSeq) \
+    namespace boost { namespace range_detail_microsoft { \
+            BOOST_RANGE_DETAIL_MICROSOFT_CUSTOMIZATION_TEMPLATE_tag( \
+            Tag, \
+            BOOST_RANGE_DETAIL_MICROSOFT_CUSTOMIZATION_TEMPLATE_params(ParamSeq), \
+            BOOST_RANGE_DETAIL_MICROSOFT_CUSTOMIZATION_TEMPLATE_fullname(NamespaceList, Name, ParamSeq) \
+        ) \
+    } } \
+    \
+    namespace boost { \
+        BOOST_RANGE_DETAIL_MICROSOFT_CUSTOMIZATION_TEMPLATE_mutable_iterator( \
+            BOOST_RANGE_DETAIL_MICROSOFT_CUSTOMIZATION_TEMPLATE_params(ParamSeq), \
+            BOOST_RANGE_DETAIL_MICROSOFT_CUSTOMIZATION_TEMPLATE_fullname(NamespaceList, Name, ParamSeq) \
+        ) \
+        BOOST_RANGE_DETAIL_MICROSOFT_CUSTOMIZATION_TEMPLATE_const_iterator( \
+            BOOST_RANGE_DETAIL_MICROSOFT_CUSTOMIZATION_TEMPLATE_params(ParamSeq), \
+            BOOST_RANGE_DETAIL_MICROSOFT_CUSTOMIZATION_TEMPLATE_fullname(NamespaceList, Name, ParamSeq) \
+        ) \
+        \
+        BOOST_RANGE_DETAIL_MICROSOFT_CUSTOMIZATION_TEMPLATE_size_type( \
+            BOOST_RANGE_DETAIL_MICROSOFT_CUSTOMIZATION_TEMPLATE_params(ParamSeq), \
+            BOOST_RANGE_DETAIL_MICROSOFT_CUSTOMIZATION_TEMPLATE_fullname(NamespaceList, Name, ParamSeq) \
+        ) \
+    } \
+    \
+    BOOST_RANGE_DETAIL_MICROSOFT_CUSTOMIZATION_namespace_open(NamespaceList) \
+        BOOST_RANGE_DETAIL_MICROSOFT_CUSTOMIZATION_TEMPLATE_begin( \
+            BOOST_RANGE_DETAIL_MICROSOFT_CUSTOMIZATION_TEMPLATE_params(ParamSeq), \
+            BOOST_RANGE_DETAIL_MICROSOFT_CUSTOMIZATION_TEMPLATE_fullname(NamespaceList, Name, ParamSeq) \
+        ) \
+        BOOST_RANGE_DETAIL_MICROSOFT_CUSTOMIZATION_TEMPLATE_begin_const( \
+            BOOST_RANGE_DETAIL_MICROSOFT_CUSTOMIZATION_TEMPLATE_params(ParamSeq), \
+            BOOST_RANGE_DETAIL_MICROSOFT_CUSTOMIZATION_TEMPLATE_fullname(NamespaceList, Name, ParamSeq) \
+        ) \
+        BOOST_RANGE_DETAIL_MICROSOFT_CUSTOMIZATION_TEMPLATE_end( \
+            BOOST_RANGE_DETAIL_MICROSOFT_CUSTOMIZATION_TEMPLATE_params(ParamSeq), \
+            BOOST_RANGE_DETAIL_MICROSOFT_CUSTOMIZATION_TEMPLATE_fullname(NamespaceList, Name, ParamSeq) \
+        ) \
+        BOOST_RANGE_DETAIL_MICROSOFT_CUSTOMIZATION_TEMPLATE_end_const( \
+            BOOST_RANGE_DETAIL_MICROSOFT_CUSTOMIZATION_TEMPLATE_params(ParamSeq), \
+            BOOST_RANGE_DETAIL_MICROSOFT_CUSTOMIZATION_TEMPLATE_fullname(NamespaceList, Name, ParamSeq) \
+        ) \
+        BOOST_RANGE_DETAIL_MICROSOFT_CUSTOMIZATION_TEMPLATE_size( \
+            BOOST_RANGE_DETAIL_MICROSOFT_CUSTOMIZATION_TEMPLATE_params(ParamSeq), \
+            BOOST_RANGE_DETAIL_MICROSOFT_CUSTOMIZATION_TEMPLATE_fullname(NamespaceList, Name, ParamSeq) \
+        ) \
+    BOOST_RANGE_DETAIL_MICROSOFT_CUSTOMIZATION_namespace_close(NamespaceList) \
+/**/
+
+
+    #define BOOST_RANGE_DETAIL_MICROSOFT_CUSTOMIZATION_TEMPLATE_params(ParamSeq) \
+        BOOST_PP_SEQ_FOR_EACH_I(BOOST_RANGE_DETAIL_MICROSOFT_CUSTOMIZATION_TEMPLATE_params_op, ~, ParamSeq) \
+    /**/
+
+        #define BOOST_RANGE_DETAIL_MICROSOFT_CUSTOMIZATION_TEMPLATE_params_op(r, data, i, elem) \
+            BOOST_PP_COMMA_IF(i) elem BOOST_PP_CAT(T, i) \
+        /**/
+
+
+    #define BOOST_RANGE_DETAIL_MICROSOFT_CUSTOMIZATION_TEMPLATE_fullname(NamespaceList, Name, ParamSeq) \
+        BOOST_PP_LIST_FOR_EACH(BOOST_RANGE_DETAIL_MICROSOFT_CUSTOMIZATION_namespace_expand_op, ~, NamespaceList) \
+        :: Name < BOOST_PP_ENUM_PARAMS(BOOST_PP_SEQ_SIZE(ParamSeq), T) > \
+    /**/
+
+
+    #define BOOST_RANGE_DETAIL_MICROSOFT_CUSTOMIZATION_TEMPLATE_tag(Tag, Params, Fullname) \
+        template< Params > \
+        struct customization_tag< Fullname > : \
+            customization_tag_of< Tag, Fullname > \
+        { }; \
+    /**/
+
+
+    // metafunctions
+    //
+
+    #define BOOST_RANGE_DETAIL_MICROSOFT_CUSTOMIZATION_TEMPLATE_mutable_iterator(Params, Fullname) \
+        template< Params > \
+        struct BOOST_RANGE_DETAIL_MICROSOFT_range_mutable_iterator< Fullname > : \
+            range_detail_microsoft::mutable_iterator_of< Fullname > \
+        { }; \
+    /**/
+
+
+    #define BOOST_RANGE_DETAIL_MICROSOFT_CUSTOMIZATION_TEMPLATE_const_iterator(Params, Fullname) \
+        template< Params > \
+        struct range_const_iterator< Fullname > : \
+            range_detail_microsoft::const_iterator_of< Fullname > \
+        { }; \
+    /**/
+
+
+    #define BOOST_RANGE_DETAIL_MICROSOFT_CUSTOMIZATION_TEMPLATE_size_type(Params, Fullname) \
+        template< Params > \
+        struct range_size< Fullname > : \
+            range_detail_microsoft::size_type_of< Fullname > \
+        { }; \
+    /**/
+
+
+    // functions
+    //
+
+    #define BOOST_RANGE_DETAIL_MICROSOFT_CUSTOMIZATION_TEMPLATE_begin(Params, Fullname) \
+        template< Params > inline \
+        typename boost::range_detail_microsoft::mutable_iterator_of< Fullname >::type \
+        BOOST_RANGE_DETAIL_MICROSOFT_range_begin(Fullname& x) \
+        { \
+            return boost::range_detail_microsoft::begin_of(x); \
+        } \
+    /**/
+
+
+    #define BOOST_RANGE_DETAIL_MICROSOFT_CUSTOMIZATION_TEMPLATE_begin_const(Params, Fullname) \
+        template< Params > inline \
+        typename boost::range_detail_microsoft::const_iterator_of< Fullname >::type \
+        BOOST_RANGE_DETAIL_MICROSOFT_range_begin(Fullname const& x) \
+        { \
+            return boost::range_detail_microsoft::begin_of(x); \
+        } \
+    /**/
+
+
+    #define BOOST_RANGE_DETAIL_MICROSOFT_CUSTOMIZATION_TEMPLATE_end(Params, Fullname) \
+        template< Params > inline \
+        typename boost::range_detail_microsoft::mutable_iterator_of< Fullname >::type \
+        BOOST_RANGE_DETAIL_MICROSOFT_range_end(Fullname& x) \
+        { \
+            return boost::range_detail_microsoft::end_of(x); \
+        } \
+    /**/
+
+
+    #define BOOST_RANGE_DETAIL_MICROSOFT_CUSTOMIZATION_TEMPLATE_end_const(Params, Fullname) \
+        template< Params > inline \
+        typename boost::range_detail_microsoft::const_iterator_of< Fullname >::type \
+        BOOST_RANGE_DETAIL_MICROSOFT_range_end(Fullname const& x) \
+        { \
+            return boost::range_detail_microsoft::end_of(x); \
+        } \
+    /**/
+
+
+    #if !defined(BOOST_RANGE_DETAIL_MICROSOFT_RANGE_VERSION_1)
+
+        #define BOOST_RANGE_DETAIL_MICROSOFT_CUSTOMIZATION_TEMPLATE_size(Params, Fullname) \
+        /**/
+
+    #else
+
+        #define BOOST_RANGE_DETAIL_MICROSOFT_CUSTOMIZATION_TEMPLATE_size(Params, Fullname) \
+            template< Params > inline \
+            typename boost::range_detail_microsoft::size_type_of< Fullname >::type \
+            boost_range_size(Fullname const& x) \
+            { \
+                return boost::range_detail_microsoft::size_of(x); \
+            } \
+        /**/
+
+    #endif
+
+
+
+
+// list_iterator and helpers
+//
+
+
+#include <boost/assert.hpp>
+#include <boost/iterator/iterator_categories.hpp>
+#include <boost/iterator/iterator_facade.hpp>
+#include <boost/mpl/if.hpp>
+#include <boost/type_traits/is_same.hpp>
+
+
+// POSITION's header is undocumented, so is NULL.
+//
+struct __POSITION; // incomplete, but used as just a pointer.
+typedef __POSITION *POSITION;
+
+
+namespace boost { namespace range_detail_microsoft {
+
+
+    template<
+        class ListT,
+        class Value,
+        class Reference,
+        class Traversal
+    >
+    struct list_iterator;
+
+
+    template<
+        class ListT,
+        class Value,
+        class Reference,
+        class Traversal
+    >
+    struct list_iterator_super
+    {
+        typedef typename mpl::if_< is_same<use_default, Reference>,
+            Value&,
+            Reference
+        >::type ref_t;
+
+        typedef typename mpl::if_< is_same<use_default, Traversal>,
+            bidirectional_traversal_tag,
+            Traversal
+        >::type trv_t;
+
+        typedef iterator_facade<
+            list_iterator<ListT, Value, Reference, Traversal>,
+            Value,
+            trv_t,
+            ref_t
+        > type;
+    };
+
+
+    template<
+        class ListT,
+        class Value,
+        class Reference = use_default,
+        class Traversal = use_default
+    >
+    struct list_iterator :
+        list_iterator_super<ListT, Value, Reference, Traversal>::type
+    {
+    private:
+        typedef list_iterator self_t;
+        typedef typename list_iterator_super<ListT, Value, Reference, Traversal>::type super_t;
+        typedef typename super_t::reference ref_t;
+
+    public:
+        explicit list_iterator()
+        { }
+
+        explicit list_iterator(ListT& lst, POSITION pos) :
+            m_plst(boost::addressof(lst)), m_pos(pos)
+        { }
+
+    template< class, class, class, class > friend struct list_iterator;
+        template< class ListT_, class Value_, class Reference_, class Traversal_>
+        list_iterator(list_iterator<ListT_, Value_, Reference_, Traversal_> const& other) :
+            m_plst(other.m_plst), m_pos(other.m_pos)
+        { }
+
+    private:
+        ListT *m_plst;
+        POSITION m_pos;
+
+    friend class iterator_core_access;
+        ref_t dereference() const
+        {
+            BOOST_ASSERT(m_pos != 0 && "out of range");
+            return m_plst->GetAt(m_pos);
+        }
+
+        // A    B    C    D    x
+        // Head           Tail NULL(0)
+        //
+        void increment()
+        {
+            BOOST_ASSERT(m_pos != 0 && "out of range");
+            m_plst->GetNext(m_pos);
+        }
+
+        void decrement()
+        {
+            if (m_pos == 0) {
+                m_pos = m_plst->GetTailPosition();
+                return;
+            }
+
+            m_plst->GetPrev(m_pos);
+        }
+
+        bool equal(self_t const& other) const
+        {
+            BOOST_ASSERT(m_plst == other.m_plst && "iterators incompatible");
+            return m_pos == other.m_pos;
+        }
+    };
+
+
+    // customization helpers
+    //
+
+    struct array_functions
+    {
+        template< class Iterator, class X >
+        Iterator begin(X& x)
+        {
+            return x.GetData();
+        }
+
+        template< class Iterator, class X >
+        Iterator end(X& x)
+        {
+            return begin<Iterator>(x) + x.GetSize();
+        }
+    };
+
+
+    struct list_functions
+    {
+        template< class Iterator, class X >
+        Iterator begin(X& x)
+        {
+            return Iterator(x, x.GetHeadPosition());
+        }
+
+        template< class Iterator, class X >
+        Iterator end(X& x)
+        {
+            return Iterator(x, POSITION(0));
+        }
+    };
+
+
+} } // namespace boost::range_detail_microsoft
+
+
+
+
+// test
+//
+
+
+#if defined(BOOST_RANGE_DETAIL_MICROSOFT_TEST)
+
+
+#include <algorithm>
+#include <iterator>
+#include <vector>
+#include <boost/concept_check.hpp>
+#include <boost/next_prior.hpp>
+#include <boost/range/begin.hpp>
+#include <boost/range/concepts.hpp>
+#include <boost/range/const_iterator.hpp>
+#include <boost/range/difference_type.hpp>
+#include <boost/range/distance.hpp>
+#include <boost/range/empty.hpp>
+#include <boost/range/iterator_range.hpp>
+#include <boost/range/mutable_iterator.hpp>
+#include <boost/range/rbegin.hpp>
+#include <boost/range/rend.hpp>
+#include <boost/range/value_type.hpp>
+#include <boost/type_traits/is_same.hpp>
+
+
+namespace boost { namespace range_detail_microsoft {
+
+
+    template< class Range1, class Range2 >
+    bool test_equals(Range1 const& rng1, Range2 const& rng2)
+    {
+        return
+            boost::distance(rng1) == boost::distance(rng2) &&
+            std::equal(boost::begin(rng1), boost::end(rng1), boost::begin(rng2))
+        ;
+    }
+
+
+    template< class AssocContainer, class PairT >
+    bool test_find_key_and_mapped(AssocContainer const& ac, PairT const& pa)
+    {
+        typedef typename boost::range_const_iterator<AssocContainer>::type iter_t;
+        for (iter_t it = boost::const_begin(ac), last = boost::const_end(ac); it != last; ++it) {
+            if (it->first == pa.first && it->second == pa.second)
+                return true;
+        }
+
+        return false;
+    }
+
+
+    // test functions
+    //
+
+    template< class Range >
+    bool test_emptiness(Range& )
+    {
+        bool result = true;
+
+        Range emptyRng;
+        result = result && boost::empty(emptyRng);
+
+        return result;
+    }
+
+
+    template< class Range >
+    bool test_trivial(Range& rng)
+    {
+        bool result = true;
+
+        // convertibility check
+        typedef typename range_const_iterator<Range>::type citer_t;
+        citer_t cit = boost::begin(rng);
+        (void)cit; // unused
+
+        // mutability check
+        typedef typename range_value<Range>::type val_t;
+        val_t v = *boost::begin(rng);
+        *boost::begin(rng) = v;
+        result = result && *boost::begin(rng) == v;
+
+        return result;
+    }
+
+
+    template< class Range >
+    bool test_forward(Range& rng)
+    {
+        boost::function_requires< ForwardRangeConcept<Range> >();
+
+        bool result = (test_trivial)(rng);
+
+        typedef typename range_value<Range>::type val_t;
+
+        std::vector<val_t> saved;
+        std::copy(boost::begin(rng), boost::end(rng), std::back_inserter(saved));
+        std::rotate(boost::begin(saved), boost::next(boost::begin(saved)), boost::end(saved));
+
+        std::rotate(boost::begin(rng), boost::next(boost::begin(rng)), boost::end(rng));
+
+        return result && (test_equals)(saved, rng);
+    };
+
+
+    template< class Range >
+    bool test_bidirectional(Range& rng)
+    {
+        boost::function_requires< BidirectionalRangeConcept<Range> >();
+
+        bool result = (test_forward)(rng);
+
+        typedef typename range_value<Range>::type val_t;
+
+        std::vector<val_t> saved;
+        std::copy(boost::begin(rng), boost::end(rng), std::back_inserter(saved));
+
+        result = result && (test_equals)(
+            boost::make_iterator_range(boost::rbegin(saved), boost::rend(saved)),
+            boost::make_iterator_range(boost::rbegin(rng), boost::rend(rng))
+        );
+
+        return result;
+    }
+
+
+    template< class Range >
+    bool test_random_access(Range& rng)
+    {
+        boost::function_requires< RandomAccessRangeConcept<Range> >();
+
+        bool result = (test_bidirectional)(rng);
+
+        typedef typename range_value<Range>::type val_t;
+
+        std::vector<val_t> saved;
+        std::copy(boost::begin(rng), boost::end(rng), std::back_inserter(saved));
+        std::sort(boost::begin(saved), boost::end(saved));
+
+        std::random_shuffle(boost::begin(rng), boost::end(rng));
+        std::sort(boost::begin(rng), boost::end(rng));
+        result = result && (test_equals)(rng, saved);
+
+        std::random_shuffle(boost::begin(rng), boost::end(rng));
+        std::stable_sort(boost::begin(rng), boost::end(rng));
+        result = result && (test_equals)(rng, saved);
+
+        std::random_shuffle(boost::begin(rng), boost::end(rng));
+        std::partial_sort(boost::begin(rng), boost::end(rng), boost::end(rng));
+        result = result && (test_equals)(rng, saved);
+
+        return result;
+    }
+
+
+    // initializer
+    //
+
+    template< class ArrayT, class SampleRange >
+    bool test_init_array(ArrayT& arr, SampleRange const& sample)
+    {
+        typedef typename range_const_iterator<SampleRange>::type iter_t;
+        typedef typename range_value<SampleRange>::type val_t;
+
+        for (iter_t it = boost::const_begin(sample), last = boost::const_end(sample); it != last; ++it) {
+            val_t v = *it; // works around ATL3 CSimpleArray
+            arr.Add(v);
+        }
+
+        return (test_equals)(arr, sample);
+    }
+
+
+    template< class ListT, class SampleRange >
+    bool test_init_list(ListT& lst, SampleRange const& sample)
+    {
+        typedef typename range_const_iterator<SampleRange>::type iter_t;
+
+        for (iter_t it = boost::const_begin(sample), last = boost::const_end(sample); it != last; ++it) {
+            lst.AddTail(*it);
+        }
+
+        return (test_equals)(lst, sample);
+    }
+
+
+    template< class StringT, class SampleRange >
+    bool test_init_string(StringT& str, SampleRange const& sample)
+    {
+        typedef typename range_const_iterator<SampleRange>::type iter_t;
+        typedef typename range_value<SampleRange>::type val_t;
+
+        for (iter_t it = boost::const_begin(sample), last = boost::const_end(sample); it != last; ++it) {
+            str += *it;
+        }
+
+        return (test_equals)(str, sample);
+    }
+
+
+    template< class MapT, class SampleMap >
+    bool test_init_map(MapT& map, SampleMap const& sample)
+    {
+        typedef typename range_const_iterator<SampleMap>::type iter_t;
+
+        for (iter_t it = boost::const_begin(sample), last = boost::const_end(sample); it != last; ++it) {
+            map.SetAt(it->first, it->second);
+        }
+
+        return boost::distance(map) == boost::distance(sample);
+    }
+
+
+    // metafunction test
+    //
+
+    template< class Range, class Iter >
+    struct test_mutable_iter :
+        boost::is_same< typename boost::BOOST_RANGE_DETAIL_MICROSOFT_range_mutable_iterator<Range>::type, Iter >
+    { };
+
+
+    template< class Range, class Iter >
+    struct test_const_iter :
+        boost::is_same< typename boost::range_const_iterator<Range>::type, Iter >
+    { };
+
+
+} } // namespace boost::range_detail_microsoft
+
+
+#endif // defined(BOOST_RANGE_DETAIL_MICROSOFT_TEST)
+
+
+
+#endif
diff --git a/include/boost/range/detail/size_type.hpp b/include/boost/range/detail/size_type.hpp
index d4f0704..ec49f4d 100755
--- a/include/boost/range/detail/size_type.hpp
+++ b/include/boost/range/detail/size_type.hpp
@@ -54,55 +54,7 @@ namespace boost
             };
         };
 
-        template<>
-        struct range_size_type_<char_array_>
-        { 
-            template< typename A >
-            struct pts
-            {
-                typedef std::size_t type;
-            };
-        };
-
-        template<>
-        struct range_size_type_<char_ptr_>
-        {
-            template< typename S >
-            struct pts
-            {
-                typedef std::size_t type;
-            };         
-        };
-        
-        template<>
-        struct range_size_type_<const_char_ptr_>
-        {
-            template< typename S >
-            struct pts
-            {
-                typedef std::size_t type;
-            };         
-        };
-        
-        template<>
-        struct range_size_type_<wchar_t_ptr_>
-        {
-            template< typename S >
-            struct pts
-            {
-                typedef std::size_t type;
-            };         
-        };
-        
-        template<>
-        struct range_size_type_<const_wchar_t_ptr_>
-        {
-            template< typename S >
-            struct pts
-            {
-                typedef std::size_t type;
-            };         
-        };  
+  
     } 
     
     template< typename C >
diff --git a/include/boost/range/detail/str_types.hpp b/include/boost/range/detail/str_types.hpp
new file mode 100755
index 0000000..f8cab19
--- /dev/null
+++ b/include/boost/range/detail/str_types.hpp
@@ -0,0 +1,38 @@
+// Boost.Range library
+//
+//  Copyright Thorsten Ottosen 2006. 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/
+//
+
+#ifndef BOOST_RANGE_DETAIL_STR_TYPES_HPP
+#define BOOST_RANGE_DETAIL_STR_TYPES_HPP
+
+#include <boost/range/size_type.hpp>
+#include <boost/range/iterator.hpp>
+
+namespace boost
+{
+    template< class T >
+    struct range_mutable_iterator<T*>
+    {
+        typedef T* type;
+    };
+
+    template< class T >
+    struct range_const_iterator<T*>
+    {
+        typedef const T* type;
+    };
+
+    template< class T >
+    struct range_size<T*>
+    {
+       typedef std::size_t type;
+    };    
+}
+
+#endif
diff --git a/include/boost/range/detail/value_type.hpp b/include/boost/range/detail/value_type.hpp
index c3a4693..2784514 100755
--- a/include/boost/range/detail/value_type.hpp
+++ b/include/boost/range/detail/value_type.hpp
@@ -56,56 +56,6 @@ namespace boost
             };
         };
         
-        template<>
-        struct range_value_type_<char_array_>
-        { 
-            template< typename T >
-            struct pts
-            {
-                typedef char type;
-            };
-        };
-
-        template<>
-        struct range_value_type_<char_ptr_>
-        {
-            template< typename S >
-            struct pts
-            {
-                typedef char type; 
-            };         
-        };
-        
-        template<>
-        struct range_value_type_<const_char_ptr_>
-        {
-            template< typename S >
-            struct pts
-            {
-                typedef const char type;
-            };         
-        };
-
-        template<>
-        struct range_value_type_<wchar_t_ptr_>
-        {
-            template< typename S >
-            struct pts
-            {
-                typedef wchar_t type;
-            };         
-        };
-
-        template<>
-        struct range_value_type_<const_wchar_t_ptr_>
-        {
-             template< typename S >
-             struct pts
-             {
-                 typedef const wchar_t type;
-             };         
-         };
-
     } 
     
     template< typename C >
diff --git a/include/boost/range/difference_type.hpp b/include/boost/range/difference_type.hpp
index 33c56e3..164288f 100755
--- a/include/boost/range/difference_type.hpp
+++ b/include/boost/range/difference_type.hpp
@@ -16,130 +16,14 @@
 #endif
 
 #include <boost/range/config.hpp>
-#include <boost/range/const_iterator.hpp>
+#include <boost/range/iterator.hpp>
 #include <boost/iterator/iterator_traits.hpp>
 
 namespace boost
 {
-        template< class T >
-        struct range_difference
-        {
-                typedef BOOST_DEDUCED_TYPENAME iterator_difference<
-                        BOOST_DEDUCED_TYPENAME range_const_iterator<T>::type >::type
-                                type;
-        };
+    template< class T >
+    struct range_difference : iterator_difference< typename range_iterator<T>::type >
+    { };
 }
 
-//#ifdef BOOST_NO_TEMPLATE_PARTIAL_SPECIALIZATION
-//#include <boost/range/detail/difference_type.hpp>
-//#else
-
-/*
-#include <cstddef>
-#include <utility>
-
-namespace boost
-{
-    //////////////////////////////////////////////////////////////////////////
-    // default
-    //////////////////////////////////////////////////////////////////////////
-
-    template< typename C >
-    struct range_difference
-    {
-        typedef BOOST_DEDUCED_TYPENAME C::difference_type type;
-    };
-
-    //////////////////////////////////////////////////////////////////////////
-    // pair
-    //////////////////////////////////////////////////////////////////////////
-
-    template< typename Iterator >
-    struct range_difference< std::pair<Iterator,Iterator> >
-    {
-        typedef BOOST_DEDUCED_TYPENAME
-            iterator_difference<Iterator>::type type;
-    };
-
-    template< typename Iterator >
-    struct range_difference< const std::pair<Iterator,Iterator> >
-    {
-        typedef BOOST_DEDUCED_TYPENAME
-            iterator_difference<Iterator>::type type;
-    };
-
-
-    //////////////////////////////////////////////////////////////////////////
-    // array
-    //////////////////////////////////////////////////////////////////////////
-
-    template< typename T, std::size_t sz >
-    struct range_difference< T[sz] >
-    {
-        typedef std::ptrdiff_t type;
-    };
-
-    template< typename T, std::size_t sz >
-    struct range_difference< const T[sz] >
-    {
-        typedef std::ptrdiff_t type;
-    };
-
-    //////////////////////////////////////////////////////////////////////////
-    // string
-    //////////////////////////////////////////////////////////////////////////
-
-    template<>
-    struct range_difference< char* >
-    {
-        typedef std::ptrdiff_t type;
-    };
-
-    template<>
-    struct range_difference< wchar_t* >
-    {
-        typedef std::ptrdiff_t type;
-    };
-
-    template<>
-    struct range_difference< const char* >
-    {
-        typedef std::ptrdiff_t type;
-    };
-
-    template<>
-    struct range_difference< const wchar_t* >
-    {
-        typedef std::ptrdiff_t type;
-    };
-
-    template<>
-    struct range_difference< char* const >
-    {
-        typedef std::ptrdiff_t type;
-    };
-
-    template<>
-    struct range_difference< wchar_t* const >
-    {
-        typedef std::ptrdiff_t type;
-    };
-
-    template<>
-    struct range_difference< const char* const >
-    {
-        typedef std::ptrdiff_t type;
-    };
-
-    template<>
-    struct range_difference< const wchar_t* const >
-    {
-        typedef std::ptrdiff_t type;
-    };
-
-} // namespace boost
-
-#endif // BOOST_NO_TEMPLATE_PARTIAL_SPECIALIZATION
-*/
-
 #endif
diff --git a/include/boost/range/distance.hpp b/include/boost/range/distance.hpp
new file mode 100755
index 0000000..42a106d
--- /dev/null
+++ b/include/boost/range/distance.hpp
@@ -0,0 +1,34 @@
+// Boost.Range library
+//
+//  Copyright Thorsten Ottosen 2003-2006. 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/
+//
+
+#ifndef BOOST_RANGE_DISTANCE_HPP
+#define BOOST_RANGE_DISTANCE_HPP
+
+#if defined(_MSC_VER) && (_MSC_VER >= 1200)
+# pragma once
+#endif
+
+#include <boost/range/begin.hpp>
+#include <boost/range/end.hpp>
+#include <boost/range/difference_type.hpp>
+
+namespace boost 
+{
+
+    template< class T >
+    inline BOOST_DEDUCED_TYPENAME range_difference<T>::type 
+    distance( const T& r )
+    {
+        return std::distance( boost::begin( r ), boost::end( r ) );
+    }
+
+} // namespace 'boost'
+
+#endif
diff --git a/include/boost/range/empty.hpp b/include/boost/range/empty.hpp
index 7363262..78c4e85 100755
--- a/include/boost/range/empty.hpp
+++ b/include/boost/range/empty.hpp
@@ -16,52 +16,19 @@
 #endif
 
 #include <boost/range/config.hpp>
-//#ifdef BOOST_NO_FUNCTION_TEMPLATE_ORDERING
-//#include <boost/range/detail/empty.hpp>
-//#else
-
 #include <boost/range/begin.hpp>
 #include <boost/range/end.hpp>
 
 namespace boost 
 { 
-namespace range_detail 
-{
 
-        //////////////////////////////////////////////////////////////////////
-        // primary template
-        //////////////////////////////////////////////////////////////////////
-
-        template< typename C >
-        inline bool empty( const C& c )
-        {
-            return boost::begin( c ) == boost::end( c );
-        }
-
-        //////////////////////////////////////////////////////////////////////
-        // string
-        //////////////////////////////////////////////////////////////////////
-
-        inline bool empty( const char* const& s )
-        {
-            return s == 0 || s[0] == 0;
-        }
-
-        inline bool empty( const wchar_t* const& s )
-        {
-            return s == 0 || s[0] == 0;
-        }
-        
-} // namespace 'range_detail'
-
-template< class T >
-inline bool empty( const T& r )
-{
-    return range_detail::empty( r );
-}
+    template< class T >
+    inline bool empty( const T& r )
+    {
+        return boost::begin( r ) == boost::end( r );
+    }
 
 } // namepace 'boost'
 
-//#endif //  BOOST_NO_FUNCTION_TEMPLATE_ORDERING
 
 #endif
diff --git a/include/boost/range/end.hpp b/include/boost/range/end.hpp
index 493208f..b777a55 100755
--- a/include/boost/range/end.hpp
+++ b/include/boost/range/end.hpp
@@ -15,7 +15,6 @@
 # pragma once
 #endif
 
-#include <boost/type_traits/remove_const.hpp>
 #include <boost/range/config.hpp>
 
 #ifdef BOOST_NO_FUNCTION_TEMPLATE_ORDERING
@@ -39,19 +38,15 @@ namespace range_detail
         //////////////////////////////////////////////////////////////////////
         // primary template
         //////////////////////////////////////////////////////////////////////
-
         template< typename C >
-        inline BOOST_DEDUCED_TYPENAME range_const_iterator<C>::type
-        boost_range_end( const C& c )
-        {
-            return c.end();
-        }
-
-        template< typename C >
-                inline BOOST_DEDUCED_TYPENAME range_iterator<
-                                        typename remove_const<C>::type >::type
-        boost_range_end( C& c )
+        inline BOOST_DEDUCED_TYPENAME range_iterator<C>::type
+        range_end( C& c )
         {
+            //
+            // If you get a compile-error here, it is most likely because
+            // you have not implemented range_begin() properly in
+            // the namespace of C
+            //
             return c.end();
         }
 
@@ -60,13 +55,13 @@ namespace range_detail
         //////////////////////////////////////////////////////////////////////
 
         template< typename Iterator >
-        inline Iterator boost_range_end( const std::pair<Iterator,Iterator>& p )
+        inline Iterator range_end( const std::pair<Iterator,Iterator>& p )
         {
             return p.second;
         }
 
         template< typename Iterator >
-        inline Iterator boost_range_end( std::pair<Iterator,Iterator>& p )
+        inline Iterator range_end( std::pair<Iterator,Iterator>& p )
         {
             return p.second;
         }
@@ -76,64 +71,17 @@ namespace range_detail
         //////////////////////////////////////////////////////////////////////
 
         template< typename T, std::size_t sz >
-        inline const T* boost_range_end( const T (&array)[sz] )
+        inline const T* range_end( const T (&array)[sz] )
         {
             return range_detail::array_end<T,sz>( array );
         }
 
         template< typename T, std::size_t sz >
-        inline T* boost_range_end( T (&array)[sz] )
+        inline T* range_end( T (&array)[sz] )
         {
             return range_detail::array_end<T,sz>( array );
         }
 
-        //////////////////////////////////////////////////////////////////////
-        // string
-        //////////////////////////////////////////////////////////////////////
-
-#if 1 || BOOST_WORKAROUND(__MWERKS__, <= 0x3204 ) || BOOST_WORKAROUND(__BORLANDC__, BOOST_TESTED_AT(0x564))
-// CW up to 9.3 and borland have troubles with function ordering
-        inline char* boost_range_end( char* s )
-        {
-            return range_detail::str_end( s );
-        }
-
-        inline wchar_t* boost_range_end( wchar_t* s )
-        {
-            return range_detail::str_end( s );
-        }
-
-        inline const char* boost_range_end( const char* s )
-        {
-            return range_detail::str_end( s );
-        }
-
-        inline const wchar_t* boost_range_end( const wchar_t* s )
-        {
-            return range_detail::str_end( s );
-        }
-#else
-        inline char* boost_range_end( char*& s )
-        {
-            return range_detail::str_end( s );
-        }
-
-        inline wchar_t* boost_range_end( wchar_t*& s )
-        {
-            return range_detail::str_end( s );
-        }
-
-        inline const char* boost_range_end( const char*& s )
-        {
-            return range_detail::str_end( s );
-        }
-
-        inline const wchar_t* boost_range_end( const wchar_t*& s )
-        {
-            return range_detail::str_end( s );
-        }
-#endif
-
 #if !BOOST_WORKAROUND(__BORLANDC__, BOOST_TESTED_AT(0x564)) && \
     !BOOST_WORKAROUND(__GNUC__, < 3) \
     /**/
@@ -141,46 +89,27 @@ namespace range_detail
 #endif
 
 template< class T >
-inline BOOST_DEDUCED_TYPENAME range_iterator<
-                typename remove_const<T>::type >::type end( T& r )
+inline BOOST_DEDUCED_TYPENAME range_iterator<T>::type end( T& r )
 {
 #if !BOOST_WORKAROUND(__BORLANDC__, BOOST_TESTED_AT(0x564)) && \
     !BOOST_WORKAROUND(__GNUC__, < 3) \
     /**/
     using namespace range_detail;
 #endif
-    return boost_range_end( r );
+    return range_end( r );
 }
 
 template< class T >
-inline BOOST_DEDUCED_TYPENAME range_const_iterator<T>::type end( const T& r )
+inline BOOST_DEDUCED_TYPENAME range_iterator<const T>::type end( const T& r )
 {
 #if !BOOST_WORKAROUND(__BORLANDC__, BOOST_TESTED_AT(0x564)) && \
     !BOOST_WORKAROUND(__GNUC__, < 3) \
     /**/
     using namespace range_detail;
 #endif
-    return boost_range_end( r );
+    return range_end( r );
 }
 
-
-
-#if BOOST_WORKAROUND(__MWERKS__, <= 0x3003 ) || BOOST_WORKAROUND(__BORLANDC__, BOOST_TESTED_AT(0x564))
-// BCB and CW are not able to overload pointer when class overloads are also available.
-template<>
-inline range_const_iterator<const char*>::type end<const char*>( const char*& r )
-{
-    return range_detail::str_end( r );
-}
-
-template<>
-inline range_const_iterator<const wchar_t*>::type end<const wchar_t*>( const wchar_t*& r )
-{
-    return range_detail::str_end( r );
-}
-
-#endif
-
 } // namespace 'boost'
 
 
@@ -191,7 +120,7 @@ inline range_const_iterator<const wchar_t*>::type end<const wchar_t*>( const wch
 namespace boost
 {
     template< class T >
-    inline BOOST_DEDUCED_TYPENAME range_const_iterator<T>::type
+    inline BOOST_DEDUCED_TYPENAME range_iterator<const T>::type
     const_end( const T& r )
     {
         return boost::end( r );
@@ -199,3 +128,4 @@ namespace boost
 }
 
 #endif
+
diff --git a/include/boost/range/functions.hpp b/include/boost/range/functions.hpp
index 5b5fb54..b8b8608 100755
--- a/include/boost/range/functions.hpp
+++ b/include/boost/range/functions.hpp
@@ -1,6 +1,6 @@
 // Boost.Range library
 //
-//  Copyright Thorsten Ottosen 2003-2004. Use, modification and
+//  Copyright Thorsten Ottosen 2003-2006. 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)
@@ -18,8 +18,10 @@
 #include <boost/range/begin.hpp>
 #include <boost/range/end.hpp>
 #include <boost/range/size.hpp>
+#include <boost/range/distance.hpp>
 #include <boost/range/empty.hpp>
 #include <boost/range/rbegin.hpp>
 #include <boost/range/rend.hpp>
 
 #endif
+
diff --git a/include/boost/range/iterator.hpp b/include/boost/range/iterator.hpp
index 0225495..21798c5 100755
--- a/include/boost/range/iterator.hpp
+++ b/include/boost/range/iterator.hpp
@@ -11,118 +11,62 @@
 #ifndef BOOST_RANGE_ITERATOR_HPP
 #define BOOST_RANGE_ITERATOR_HPP
 
-#if defined(_MSC_VER) && (_MSC_VER >= 1200)
+#if defined(_MSC_VER) && (_MSC_VER >= 1020)
 # pragma once
 #endif
 
 #include <boost/range/config.hpp>
-
-#ifdef BOOST_NO_TEMPLATE_PARTIAL_SPECIALIZATION
-#include <boost/range/detail/iterator.hpp>
-#else
-
-#include <boost/iterator/iterator_traits.hpp>
-#include <cstddef>
-#include <utility>
+#include <boost/range/mutable_iterator.hpp>
+#include <boost/range/const_iterator.hpp>
+#include <boost/type_traits/is_const.hpp>
+#include <boost/type_traits/remove_const.hpp>
+#include <boost/mpl/eval_if.hpp>
 
 namespace boost
 {
-    //////////////////////////////////////////////////////////////////////////
-    // default
-    //////////////////////////////////////////////////////////////////////////
+
+#if BOOST_WORKAROUND(BOOST_MSVC, == 1310)  
+
+    namespace range_detail_vc7_1  
+    {  
+       template< typename C, typename Sig = void(C) >  
+       struct range_iterator  
+       {  
+           typedef BOOST_RANGE_DEDUCED_TYPENAME   
+               mpl::eval_if_c< is_const<C>::value,   
+                               range_const_iterator< typename remove_const<C>::type >,  
+                               range_mutable_iterator<C> >::type type;  
+       };  
     
+       template< typename C, typename T >  
+       struct range_iterator< C, void(T[]) >  
+       {  
+           typedef T* type;  
+       };       
+    }  
+    
+#endif  
+
     template< typename C >
     struct range_iterator
     {
-        typedef BOOST_DEDUCED_TYPENAME C::iterator type;
+#if BOOST_WORKAROUND(BOOST_MSVC, == 1310)
+  
+        typedef BOOST_RANGE_DEDUCED_TYPENAME  
+               range_detail_vc7_1::range_iterator<C>::type type;  
+           
+#else  
+
+        typedef BOOST_RANGE_DEDUCED_TYPENAME 
+            mpl::eval_if_c< is_const<C>::value, 
+                            range_const_iterator< typename remove_const<C>::type >,
+                            range_mutable_iterator<C> >::type type;
+        
+#endif         
     };
     
-    //////////////////////////////////////////////////////////////////////////
-    // pair
-    //////////////////////////////////////////////////////////////////////////
-
-    template< typename Iterator >
-    struct range_iterator< std::pair<Iterator,Iterator> >
-    {
-        typedef Iterator type;
-    };
-    
-    template< typename Iterator >
-    struct range_iterator< const std::pair<Iterator,Iterator> >
-    {
-        typedef Iterator type;
-    };
-
-    //////////////////////////////////////////////////////////////////////////
-    // array
-    //////////////////////////////////////////////////////////////////////////
-
-    template< typename T, std::size_t sz >
-    struct range_iterator< T[sz] >
-    {
-        typedef T* type;
-    };
-
-    template< typename T, std::size_t sz >
-    struct range_iterator< const T[sz] >
-    {
-        typedef const T* type;
-    };
-
-    //////////////////////////////////////////////////////////////////////////
-    // string
-    //////////////////////////////////////////////////////////////////////////
-
-    template<>
-    struct range_iterator< char* >
-    {
-        typedef char* type;
-    };
-
-    template<>
-    struct range_iterator< wchar_t* >
-    {
-        typedef wchar_t* type;
-    };
-
-    template<>
-    struct range_iterator< const char* >
-    {
-        typedef const char* type;
-    };
-
-    template<>
-    struct range_iterator< const wchar_t* >
-    {
-        typedef const wchar_t* type;
-    };
-
-    template<>
-    struct range_iterator< char* const >
-    {
-        typedef char* type;
-    };
-
-    template<>
-    struct range_iterator< wchar_t* const >
-    {
-        typedef wchar_t* type;
-    };
-
-    template<>
-    struct range_iterator< const char* const >
-    {
-        typedef const char* type;
-    };
-
-    template<>
-    struct range_iterator< const wchar_t* const >
-    {
-        typedef const wchar_t* type;
-    };
-
 } // namespace boost
 
-#endif // BOOST_NO_TEMPLATE_PARTIAL_SPECIALIZATION
+//#endif // BOOST_NO_TEMPLATE_PARTIAL_SPECIALIZATION
 
 #endif
diff --git a/include/boost/range/iterator_range.hpp b/include/boost/range/iterator_range.hpp
index bd77ffa..4304ecc 100755
--- a/include/boost/range/iterator_range.hpp
+++ b/include/boost/range/iterator_range.hpp
@@ -23,19 +23,24 @@
 
 #include <boost/detail/workaround.hpp>
 #include <boost/range/functions.hpp>
-#include <boost/range/result_iterator.hpp>
+#include <boost/range/iterator.hpp>
 #include <boost/range/difference_type.hpp>
 #include <boost/iterator/iterator_traits.hpp>    
 #include <boost/assert.hpp>
 #include <iterator>
 #include <algorithm>
-#ifndef BOOST_OLD_IOSTREAMS
-# include <ostream>
-#else
-# include <ostream.h>
-#endif
+#ifndef _STLP_NO_IOSTREAMS
+# ifndef BOOST_OLD_IOSTREAMS
+#  include <ostream>
+# else
+#  include <ostream.h>
+# endif
+#endif // _STLP_NO_IOSTREAMS
 #include <cstddef>
 
+#if BOOST_WORKAROUND(BOOST_MSVC, == 1310) || BOOST_WORKAROUND(BOOST_MSVC, == 1400) 
+    #pragma warning( disable : 4996 )
+#endif
 
 /*! \file
     Defines the \c iterator_class and related functions. 
@@ -70,7 +75,7 @@ namespace boost
         template< class Left, class Right >
         inline bool equal( const Left& l, const Right& r )
         {
-            typedef BOOST_DEDUCED_TYPENAME boost::range_size<Left>::type sz_type;
+            typedef BOOST_DEDUCED_TYPENAME boost::range_difference<Left>::type sz_type;
 
             sz_type l_size = boost::size( l ),
                     r_size = boost::size( r );
@@ -158,61 +163,66 @@ namespace boost
             //! iterator type
             typedef IteratorT iterator;
 
-            iterator_range() : m_Begin( iterator() ), m_End( iterator() ), 
-                               singular( true )
+            iterator_range() : m_Begin( iterator() ), m_End( iterator() )
+                #ifndef NDEBUG
+            , singular( true )
+                #endif
             { }
-/*
-#if BOOST_WORKAROUND(__BORLANDC__, BOOST_TESTED_AT(0x564))  
-            iterator_range( this_type r ) :
-            : m_Begin(r.begin()), m_End(r.end())
-            { }
-
-            this_type& operator=( this_type r )
-            {
-                m_Begin = r.begin();
-                m_End   = r.end();
-                return *this;
-            }
-#endif
-*/            
+           
             //! Constructor from a pair of iterators
             template< class Iterator >
             iterator_range( Iterator Begin, Iterator End ) : 
-                m_Begin(Begin), m_End(End), singular(false) {}
+                m_Begin(Begin), m_End(End)
+                #ifndef NDEBUG
+            , singular(false) 
+                 #endif
+            {}
 
             //! Constructor from a Range
             template< class Range >
             iterator_range( const Range& r ) : 
-                m_Begin( impl::adl_begin( r ) ), m_End( impl::adl_end( r ) ), 
-                singular(false) {}
-
+                m_Begin( impl::adl_begin( r ) ), m_End( impl::adl_end( r ) )
+                #ifndef NDEBUG
+            , singular(false) 
+                #endif
+            {}
+            
             //! Constructor from a Range
             template< class Range >
             iterator_range( Range& r ) : 
-                m_Begin( impl::adl_begin( r ) ), m_End( impl::adl_end( r ) ), 
-                singular(false) {}
+                m_Begin( impl::adl_begin( r ) ), m_End( impl::adl_end( r ) )
+                #ifndef NDEBUG
+            , singular(false) 
+                #endif
+            {}
 
             //! Constructor from a Range
             template< class Range >
             iterator_range( const Range& r, iterator_range_detail::const_range_tag ) : 
-                m_Begin( impl::adl_begin( r ) ), m_End( impl::adl_end( r ) ), 
-                singular(false) {}
+                m_Begin( impl::adl_begin( r ) ), m_End( impl::adl_end( r ) )
+                 #ifndef NDEBUG
+            , singular(false) 
+                #endif
+            {}
 
             //! Constructor from a Range
             template< class Range >
             iterator_range( Range& r, iterator_range_detail::range_tag ) : 
-                m_Begin( impl::adl_begin( r ) ), m_End( impl::adl_end( r ) ), 
-                singular(false) {}
+                m_Begin( impl::adl_begin( r ) ), m_End( impl::adl_end( r ) )
+                 #ifndef NDEBUG
+            , singular(false) 
+                #endif
+            {}
 
             #if !BOOST_WORKAROUND(BOOST_MSVC, < 1300)
             this_type& operator=( const this_type& r )    
             {
                 m_Begin  = r.begin(); 
                 m_End    = r.end();
-                //
-                // remark: this need not necessarily be true, but it does no harm
-                //
+
+                #ifndef NDEBUG
                 singular = r.singular;
+                #endif
                 return *this;
             }
             #endif
@@ -222,10 +232,9 @@ namespace boost
             {
                 m_Begin  = r.begin(); 
                 m_End    = r.end();
-                //
-                // remark: this need not necessarily be true, but it does no harm
-                //
-                singular = r.empty();
+                #ifndef NDEBUG
+                singular = r.is_singular();
+                #endif
                 return *this;
             }
                                       
@@ -234,7 +243,9 @@ namespace boost
             {
                 m_Begin  = impl::adl_begin( r ); 
                 m_End    = impl::adl_end( r );
+                #ifndef NDEBUG
                 singular = false;
+                #endif
                 return *this;
             }
 
@@ -243,37 +254,33 @@ namespace boost
             {
                 m_Begin  = impl::adl_begin( r ); 
                 m_End    = impl::adl_end( r );
+                #ifndef NDEBUG    
                 singular = false;
+                #endif
                 return *this;
             }
 
             IteratorT begin() const 
             { 
+                BOOST_ASSERT( !is_singular() );
                 return m_Begin; 
             }
 
             IteratorT end() const 
             { 
+                BOOST_ASSERT( !is_singular() );
                 return m_End; 
             } 
 
-            size_type size() const
+            difference_type size() const
             { 
-                if( singular )
-                    return 0;
-
-#if BOOST_WORKAROUND(__BORLANDC__, BOOST_TESTED_AT(0x582))
-                return std::distance<IteratorT>( m_Begin, m_End );
-#else                
-                return std::distance( m_Begin, m_End );
-#endif                
+                BOOST_ASSERT( !is_singular() );
+                return m_End - m_Begin;
             }
             
             bool empty() const
             {
-                if( singular )
-                    return true;
-                
+                BOOST_ASSERT( !is_singular() );
                 return m_Begin == m_End;
             }
 
@@ -292,7 +299,8 @@ namespace boost
 
             bool equal( const iterator_range& r ) const
             {
-                return singular == r.singular && m_Begin == r.m_Begin && m_End == r.m_End;
+                BOOST_ASSERT( !is_singular() );
+                return m_Begin == r.m_Begin && m_End == r.m_End;
             }
 
 
@@ -300,17 +308,20 @@ namespace boost
 
             bool operator==( const iterator_range& r ) const
             {
+                BOOST_ASSERT( !is_singular() );
                 return iterator_range_detail::equal( *this, r );
             }
 
             bool operator!=( const iterator_range& r ) const
             {
+                BOOST_ASSERT( !is_singular() );
                 return !operator==(r);
             }
 
            bool operator<( const iterator_range& r ) const
            {
-                return iterator_range_detail::less_than( *this, r );
+               BOOST_ASSERT( !is_singular() );
+               return iterator_range_detail::less_than( *this, r );
            }
 
 #endif            
@@ -329,21 +340,33 @@ namespace boost
                return *--last;
            }
     
-           reference operator[]( size_type sz ) const
+           reference operator[]( difference_type at ) const
            {
-               //BOOST_STATIC_ASSERT( is_random_access );
-               BOOST_ASSERT( sz < size() );
-               return m_Begin[sz];
+               BOOST_ASSERT( at >= 0 && at < size() );
+               return m_Begin[at];
+           }
+
+           //
+           // When storing transform iterators, operator[]()
+           // fails because it returns by reference. Therefore
+           // operator()() is provided for these cases.
+           //
+           value_type operator()( difference_type at ) const
+           {
+               BOOST_ASSERT( at >= 0 && at < size() );
+               return m_Begin[at];               
            }
 
            iterator_range& advance_begin( difference_type n )
            {
+               BOOST_ASSERT( !is_singular() );
                std::advance( m_Begin, n );
                return *this;
            }
            
            iterator_range& advance_end( difference_type n )
            {
+               BOOST_ASSERT( !is_singular() );
                std::advance( m_End, n );
                return *this;
            }
@@ -352,25 +375,31 @@ namespace boost
             // begin and end iterators
             IteratorT m_Begin;
             IteratorT m_End;
+
+            #ifndef NDEBUG
             bool      singular;
+            #endif
+
+            #ifndef NDEBUG
+        public:
+            bool is_singular() const
+            {
+                 return singular;
+            }
+            #endif
+
+        protected:
+            //
+            // Allow subclasses an easy way to access the
+            // base type
+            //
+            typedef iterator_range iterator_range_;
         };
 
 //  iterator range free-standing operators ---------------------------//
 
-#ifdef BOOST_NO_FUNCTION_TEMPLATE_ORDERING
-#else
-        template< class Iterator >
-        inline bool empty( const iterator_range<Iterator>& r )
-        {
-            //
-            // this will preserve the well-defined empty() even 
-            // though 'r' is singular.
-            //
-            return r.empty();
-        }
-#endif
-
-#ifndef BOOST_OLD_IOSTREAMS   
+#ifndef _STLP_NO_IOSTREAMS
+# ifndef BOOST_OLD_IOSTREAMS   
 
         //! iterator_range output operator
         /*!
@@ -384,12 +413,12 @@ namespace boost
         {
             std::copy( r.begin(), r.end(), 
                        std::ostream_iterator< BOOST_DEDUCED_TYPENAME 
-                                            iterator_value<IteratorT>::type, 
+                                              iterator_value<IteratorT>::type, 
                                               Elem, Traits>(Os) );
             return Os;
         }
 
-#else
+# else
 
         //! iterator_range output operator
         /*!
@@ -405,7 +434,8 @@ namespace boost
             return Os;
         }
 
-#endif
+# endif
+#endif // _STLP_NO_IOSTREAMS
 
         /////////////////////////////////////////////////////////////////////
         // comparison operators
@@ -500,10 +530,10 @@ namespace boost
 #ifdef BOOST_NO_FUNCTION_TEMPLATE_ORDERING
 
         template< typename Range >
-        inline iterator_range< BOOST_DEDUCED_TYPENAME range_result_iterator<Range>::type >
+        inline iterator_range< BOOST_DEDUCED_TYPENAME range_iterator<Range>::type >
         make_iterator_range( Range& r ) 
         {   
-            return iterator_range< BOOST_DEDUCED_TYPENAME range_result_iterator<Range>::type >
+            return iterator_range< BOOST_DEDUCED_TYPENAME range_iterator<Range>::type >
                 ( boost::begin( r ), boost::end( r ) );
         }
         
@@ -522,10 +552,10 @@ namespace boost
         }
 
         template< class ForwardRange >
-        inline iterator_range< BOOST_DEDUCED_TYPENAME range_const_iterator<ForwardRange>::type >
+        inline iterator_range< BOOST_DEDUCED_TYPENAME range_iterator<const ForwardRange>::type >
         make_iterator_range( const ForwardRange& r ) 
         {   
-           return iterator_range< BOOST_DEDUCED_TYPENAME range_const_iterator<ForwardRange>::type >
+           return iterator_range< BOOST_DEDUCED_TYPENAME range_iterator<const ForwardRange>::type >
                 ( r, iterator_range_detail::const_range_tag() );
         }
 
@@ -534,15 +564,19 @@ namespace boost
         namespace iterator_range_detail
         {    
             template< class Range >
-            inline iterator_range< BOOST_DEDUCED_TYPENAME range_result_iterator<Range>::type >
+            inline iterator_range< BOOST_DEDUCED_TYPENAME range_iterator<Range>::type >
             make_range_impl( Range& r, 
                              BOOST_DEDUCED_TYPENAME range_difference<Range>::type advance_begin,
                              BOOST_DEDUCED_TYPENAME range_difference<Range>::type advance_end )
             {
-                if( advance_begin == 0 && advance_end == 0 )
-                    return make_iterator_range( r );
+                //
+                // Not worth the effort
+                //
+                //if( advance_begin == 0 && advance_end == 0 )
+                //    return make_iterator_range( r );
+                //
 
-                BOOST_DEDUCED_TYPENAME range_result_iterator<Range>::type 
+                BOOST_DEDUCED_TYPENAME range_iterator<Range>::type 
                     new_begin = boost::begin( r ),
                     new_end   = boost::end( r );
                 std::advance( new_begin, advance_begin );
@@ -554,7 +588,7 @@ namespace boost
 #ifdef BOOST_NO_FUNCTION_TEMPLATE_ORDERING
 
         template< class Range >
-        inline iterator_range< BOOST_DEDUCED_TYPENAME range_result_iterator<Range>::type >
+        inline iterator_range< BOOST_DEDUCED_TYPENAME range_iterator<Range>::type >
         make_iterator_range( Range& r, 
                     BOOST_DEDUCED_TYPENAME range_difference<Range>::type advance_begin,
                     BOOST_DEDUCED_TYPENAME range_difference<Range>::type advance_end )
@@ -576,7 +610,7 @@ namespace boost
         }
 
         template< class Range >
-        inline iterator_range< BOOST_DEDUCED_TYPENAME range_const_iterator<Range>::type >
+        inline iterator_range< BOOST_DEDUCED_TYPENAME range_iterator<const Range>::type >
         make_iterator_range( const Range& r, 
                     BOOST_DEDUCED_TYPENAME range_difference<Range>::type advance_begin,
                     BOOST_DEDUCED_TYPENAME range_difference<Range>::type advance_end )
@@ -606,3 +640,4 @@ namespace boost
 #undef BOOST_OLD_IOSTREAMS
 
 #endif
+
diff --git a/include/boost/range/metafunctions.hpp b/include/boost/range/metafunctions.hpp
index 3bf899f..5b25a8f 100755
--- a/include/boost/range/metafunctions.hpp
+++ b/include/boost/range/metafunctions.hpp
@@ -16,13 +16,15 @@
 #endif
 
 #include <boost/range/iterator.hpp>
-#include <boost/range/const_iterator.hpp>
-#include <boost/range/value_type.hpp>
-#include <boost/range/size_type.hpp>
-#include <boost/range/difference_type.hpp>
 #include <boost/range/result_iterator.hpp>
 #include <boost/range/reverse_iterator.hpp>
 #include <boost/range/const_reverse_iterator.hpp>
 #include <boost/range/reverse_result_iterator.hpp>
+#include <boost/range/value_type.hpp>
+#include <boost/range/size_type.hpp>
+#include <boost/range/difference_type.hpp>
+#include <boost/range/category.hpp>
+#include <boost/range/reference.hpp>
+#include <boost/range/pointer.hpp>
 
 #endif
diff --git a/include/boost/range/mfc.hpp b/include/boost/range/mfc.hpp
new file mode 100644
index 0000000..058e54e
--- /dev/null
+++ b/include/boost/range/mfc.hpp
@@ -0,0 +1,984 @@
+#ifndef BOOST_RANGE_MFC_HPP
+#define BOOST_RANGE_MFC_HPP
+
+
+
+
+// Boost.Range MFC Extension
+//
+// Copyright Shunsuke Sogame 2005-2006.
+// Distributed under the Boost Software License, Version 1.0. 
+// (See accompanying file LICENSE_1_0.txt or copy at 
+// http://www.boost.org/LICENSE_1_0.txt)
+
+
+
+
+// config
+//
+
+
+#include <afx.h> // _MFC_VER
+
+
+#if !defined(BOOST_RANGE_MFC_NO_CPAIR)
+    #if (_MFC_VER < 0x0700) // dubious
+        #define BOOST_RANGE_MFC_NO_CPAIR
+    #endif
+#endif
+
+
+#if !defined(BOOST_RANGE_MFC_HAS_LEGACY_STRING)
+    #if (_MFC_VER < 0x0700) // dubious
+        #define BOOST_RANGE_MFC_HAS_LEGACY_STRING
+    #endif
+#endif
+
+
+// A const collection of old MFC doesn't return const reference.
+//
+#if !defined(BOOST_RANGE_MFC_CONST_COL_RETURNS_NON_REF)
+    #if (_MFC_VER < 0x0700) // dubious
+        #define BOOST_RANGE_MFC_CONST_COL_RETURNS_NON_REF
+    #endif
+#endif
+
+
+
+
+// forward declarations
+//
+
+
+template< class Type, class ArgType >
+class CArray;
+
+template< class Type, class ArgType >
+class CList;
+
+template< class Key, class ArgKey, class Mapped, class ArgMapped >
+class CMap;
+
+template< class BaseClass, class PtrType >
+class CTypedPtrArray;
+
+template< class BaseClass, class PtrType >
+class CTypedPtrList;
+
+template< class BaseClass, class KeyPtrType, class MappedPtrType >
+class CTypedPtrMap;
+
+
+
+
+// extended customizations
+//
+
+
+#include <cstddef> // ptrdiff_t
+#include <utility> // pair
+#include <boost/assert.hpp>
+#include <boost/mpl/if.hpp>
+#include <boost/range/atl.hpp>
+#include <boost/range/begin.hpp>
+#include <boost/range/const_iterator.hpp>
+#include <boost/range/detail/microsoft.hpp>
+#include <boost/range/end.hpp>
+#include <boost/iterator/iterator_adaptor.hpp>
+#include <boost/iterator/iterator_categories.hpp>
+#include <boost/iterator/iterator_facade.hpp>
+#include <boost/iterator/transform_iterator.hpp>
+#include <boost/type_traits/is_const.hpp>
+#include <boost/type_traits/remove_pointer.hpp>
+#include <boost/utility/addressof.hpp>
+#include <afx.h> // legacy CString
+#include <afxcoll.h> // CXXXArray, CXXXList, CMapXXXToXXX
+#include <tchar.h>
+
+
+namespace boost { namespace range_detail_microsoft {
+
+
+    // mfc_ptr_array_iterator
+    //
+    // 'void **' is not convertible to 'void const **',
+    // so we define...
+    //
+
+    template< class ArrayT, class PtrType >
+    struct mfc_ptr_array_iterator;
+
+    template< class ArrayT, class PtrType >
+    struct mfc_ptr_array_iterator_super
+    {
+        typedef iterator_adaptor<
+            mfc_ptr_array_iterator<ArrayT, PtrType>,
+            std::ptrdiff_t, // Base!
+            PtrType,        // Value
+            random_access_traversal_tag,
+            use_default,
+            std::ptrdiff_t  // Difference
+        > type;
+    };
+
+    template< class ArrayT, class PtrType >
+    struct mfc_ptr_array_iterator :
+        mfc_ptr_array_iterator_super<ArrayT, PtrType>::type
+    {
+    private:
+        typedef mfc_ptr_array_iterator self_t;
+        typedef typename mfc_ptr_array_iterator_super<ArrayT, PtrType>::type super_t;
+        typedef typename super_t::reference ref_t;
+
+    public:
+        explicit mfc_ptr_array_iterator()
+        { }
+
+        explicit mfc_ptr_array_iterator(ArrayT& arr, INT_PTR index) :
+            super_t(index), m_parr(boost::addressof(arr))
+        { }
+
+    template< class, class > friend struct mfc_ptr_array_iterator;
+        template< class ArrayT_, class PtrType_ >
+        mfc_ptr_array_iterator(mfc_ptr_array_iterator<ArrayT_, PtrType_> const& other) :
+            super_t(other.base()), m_parr(other.m_parr)
+        { }
+
+    private:
+        ArrayT *m_parr;
+
+    friend class iterator_core_access;
+        ref_t dereference() const
+        {
+            BOOST_ASSERT(0 <= this->base() && this->base() < m_parr->GetSize() && "out of range");
+            return *( m_parr->GetData() + this->base() );
+        }
+
+        bool equal(self_t const& other) const
+        {
+            BOOST_ASSERT(m_parr == other.m_parr && "iterators incompatible");
+            return this->base() == other.base();
+        }
+    };
+
+    struct mfc_ptr_array_functions
+    {
+        template< class Iterator, class X >
+        Iterator begin(X& x)
+        {
+            return Iterator(x, 0);
+        }
+
+        template< class Iterator, class X >
+        Iterator end(X& x)
+        {
+            return Iterator(x, x.GetSize());
+        }
+    };
+
+
+    // arrays
+    //
+
+    template< >
+    struct customization< ::CByteArray > :
+        array_functions
+    {
+        template< class X >
+        struct meta
+        {
+            typedef BYTE val_t;
+
+            typedef val_t *mutable_iterator;
+            typedef val_t const *const_iterator;
+        };
+    };
+
+
+    template< >
+    struct customization< ::CDWordArray > :
+        array_functions
+    {
+        template< class X >
+        struct meta
+        {
+            typedef DWORD val_t;
+
+            typedef val_t *mutable_iterator;
+            typedef val_t const *const_iterator;
+        };
+    };
+
+
+    template< >
+    struct customization< ::CObArray > :
+        mfc_ptr_array_functions
+    {
+        template< class X >
+        struct meta
+        {
+            typedef mfc_ptr_array_iterator<X, CObject *> mutable_iterator;
+            typedef mfc_ptr_array_iterator<X const, CObject const *> const_iterator;
+        };
+    };
+
+
+    template< >
+    struct customization< ::CPtrArray > :
+        mfc_ptr_array_functions
+    {
+        template< class X >
+        struct meta
+        {
+            typedef mfc_ptr_array_iterator<X, void *> mutable_iterator;
+            typedef mfc_ptr_array_iterator<X const, void const *> const_iterator;
+        };
+    };
+
+
+    template< >
+    struct customization< ::CStringArray > :
+        array_functions
+    {
+        template< class X >
+        struct meta
+        {
+            typedef ::CString val_t;
+
+            typedef val_t *mutable_iterator;
+            typedef val_t const *const_iterator;
+        };
+    };
+
+
+    template< >
+    struct customization< ::CUIntArray > :
+        array_functions
+    {
+        template< class X >
+        struct meta
+        {
+            typedef UINT val_t;
+
+            typedef val_t *mutable_iterator;
+            typedef val_t const *const_iterator;
+        };
+    };
+
+
+    template< >
+    struct customization< ::CWordArray > :
+        array_functions
+    {
+        template< class X >
+        struct meta
+        {
+            typedef WORD val_t;
+
+            typedef val_t *mutable_iterator;
+            typedef val_t const *const_iterator;
+        };
+    };
+
+
+    // lists
+    //
+
+    template< >
+    struct customization< ::CObList > :
+        list_functions
+    {
+        template< class X >
+        struct meta
+        {
+            typedef list_iterator<X, ::CObject *> mutable_iterator;
+    #if !defined(BOOST_RANGE_MFC_CONST_COL_RETURNS_NON_REF)
+            typedef list_iterator<X const, ::CObject const *> const_iterator;
+    #else
+            typedef list_iterator<X const, ::CObject const * const, ::CObject const * const> const_iterator;
+    #endif
+        };
+    };
+
+
+    template< >
+    struct customization< ::CPtrList > :
+        list_functions
+    {
+        template< class X >
+        struct meta
+        {
+            typedef list_iterator<X, void *> mutable_iterator;
+    #if !defined(BOOST_RANGE_MFC_CONST_COL_RETURNS_NON_REF)
+            typedef list_iterator<X const, void const *> const_iterator;
+    #else
+            typedef list_iterator<X const, void const * const, void const * const> const_iterator;
+    #endif
+        };
+    };
+
+
+    template< >
+    struct customization< ::CStringList > :
+        list_functions
+    {
+        template< class X >
+        struct meta
+        {
+            typedef ::CString val_t;
+
+            typedef list_iterator<X, val_t> mutable_iterator;
+    #if !defined(BOOST_RANGE_MFC_CONST_COL_RETURNS_NON_REF)
+            typedef list_iterator<X const, val_t const> const_iterator;
+    #else
+            typedef list_iterator<X const, val_t const, val_t const> const_iterator;
+    #endif
+        };
+    };
+
+
+    // mfc_map_iterator
+    //
+
+    template< class MapT, class KeyT, class MappedT >
+    struct mfc_map_iterator;
+
+    template< class MapT, class KeyT, class MappedT >
+    struct mfc_map_iterator_super
+    {
+        typedef iterator_facade<
+            mfc_map_iterator<MapT, KeyT, MappedT>,
+            std::pair<KeyT, MappedT>,
+            forward_traversal_tag,
+            std::pair<KeyT, MappedT> const
+        > type;
+    };
+
+    template< class MapT, class KeyT, class MappedT >
+    struct mfc_map_iterator :
+        mfc_map_iterator_super<MapT, KeyT, MappedT>::type
+    {
+    private:
+        typedef mfc_map_iterator self_t;
+        typedef typename mfc_map_iterator_super<MapT, KeyT, MappedT>::type super_t;
+        typedef typename super_t::reference ref_t;
+
+    public:
+        explicit mfc_map_iterator()
+        { }
+
+        explicit mfc_map_iterator(MapT const& map, POSITION pos) :
+            m_pmap(boost::addressof(map)), m_posNext(pos)
+        {
+            increment();
+        }
+
+        explicit mfc_map_iterator(MapT const& map) :
+            m_pmap(&map), m_pos(0) // end iterator
+        { }
+
+    template< class, class, class > friend struct mfc_map_iterator;
+        template< class MapT_, class KeyT_, class MappedT_>
+        mfc_map_iterator(mfc_map_iterator<MapT_, KeyT_, MappedT_> const& other) :
+            m_pmap(other.m_pmap),
+            m_pos(other.m_pos), m_posNext(other.m_posNext),
+            m_key(other.m_key), m_mapped(other.m_mapped)
+        { }
+
+    private:
+        MapT const *m_pmap;
+        POSITION m_pos, m_posNext;
+        KeyT m_key; MappedT m_mapped;
+
+    friend class iterator_core_access;
+        ref_t dereference() const
+        {
+            BOOST_ASSERT(m_pos != 0 && "out of range");
+            return std::make_pair(m_key, m_mapped);
+        }
+
+        void increment()
+        {
+            BOOST_ASSERT(m_pos != 0 && "out of range");
+
+            if (m_posNext == 0) {
+                m_pos = 0;
+                return;
+            }
+
+            m_pos = m_posNext;
+            m_pmap->GetNextAssoc(m_posNext, m_key, m_mapped);
+        }
+
+        bool equal(self_t const& other) const
+        {
+            BOOST_ASSERT(m_pmap == other.m_pmap && "iterators incompatible");
+            return m_pos == other.m_pos;
+        }
+    };
+
+    struct mfc_map_functions
+    {
+        template< class Iterator, class X >
+        Iterator begin(X& x)
+        {
+            return Iterator(x, x.GetStartPosition());
+        }
+
+        template< class Iterator, class X >
+        Iterator end(X& x)
+        {
+            return Iterator(x);
+        }
+    };
+
+
+#if !defined(BOOST_RANGE_MFC_NO_CPAIR)
+
+
+    // mfc_cpair_map_iterator
+    //
+    // used by ::CMap and ::CMapStringToString
+    //
+
+    template< class MapT, class PairT >
+    struct mfc_cpair_map_iterator;
+
+    template< class MapT, class PairT >
+    struct mfc_pget_map_iterator_super
+    {
+        typedef iterator_facade<
+            mfc_cpair_map_iterator<MapT, PairT>,
+            PairT,
+            forward_traversal_tag
+        > type;
+    };
+
+    template< class MapT, class PairT >
+    struct mfc_cpair_map_iterator :
+        mfc_pget_map_iterator_super<MapT, PairT>::type
+    {
+    private:
+        typedef mfc_cpair_map_iterator self_t;
+        typedef typename mfc_pget_map_iterator_super<MapT, PairT>::type super_t;
+        typedef typename super_t::reference ref_t;
+
+    public:
+        explicit mfc_cpair_map_iterator()
+        { }
+
+        explicit mfc_cpair_map_iterator(MapT& map, PairT *pp) :
+            m_pmap(boost::addressof(map)), m_pp(pp)
+        { }
+
+    template< class, class > friend struct mfc_cpair_map_iterator;
+        template< class MapT_, class PairT_>
+        mfc_cpair_map_iterator(mfc_cpair_map_iterator<MapT_, PairT_> const& other) :
+            m_pmap(other.m_pmap), m_pp(other.m_pp)
+        { }
+
+    private:
+        MapT  *m_pmap;
+        PairT *m_pp;
+
+    friend class iterator_core_access;
+        ref_t dereference() const
+        {
+            BOOST_ASSERT(m_pp != 0 && "out of range");
+            return *m_pp;
+        }
+
+        void increment()
+        {
+            BOOST_ASSERT(m_pp != 0 && "out of range");
+            m_pp = m_pmap->PGetNextAssoc(m_pp);
+        }
+
+        bool equal(self_t const& other) const
+        {
+            BOOST_ASSERT(m_pmap == other.m_pmap && "iterators incompatible");
+            return m_pp == other.m_pp;
+        }
+    };
+
+    struct mfc_cpair_map_functions
+    {
+        template< class Iterator, class X >
+        Iterator begin(X& x)
+        {
+            // Workaround:
+            // Assertion fails if empty.
+            // MFC document is wrong.
+    #if !defined(NDEBUG)
+            if (x.GetCount() == 0) 
+                return Iterator(x, 0);
+    #endif
+
+            return Iterator(x, x.PGetFirstAssoc());
+        }
+
+        template< class Iterator, class X >
+        Iterator end(X& x)
+        {
+            return Iterator(x, 0);
+        }
+    };
+
+
+#endif // !defined(BOOST_RANGE_MFC_NO_CPAIR)
+
+
+    // maps
+    //
+
+    template< >
+    struct customization< ::CMapPtrToWord > :
+        mfc_map_functions
+    {
+        template< class X >
+        struct meta
+        {
+            typedef void *key_t;
+            typedef WORD mapped_t;
+
+            typedef mfc_map_iterator<X, key_t, mapped_t> mutable_iterator;
+            typedef mutable_iterator const_iterator;
+        };
+    };
+
+
+    template< >
+    struct customization< ::CMapPtrToPtr > :
+        mfc_map_functions
+    {
+        template< class X >
+        struct meta
+        {
+            typedef void *key_t;
+            typedef void *mapped_t;
+
+            typedef mfc_map_iterator<X, key_t, mapped_t> mutable_iterator;
+            typedef mutable_iterator const_iterator;
+        };
+    };
+
+
+    template< >
+    struct customization< ::CMapStringToOb > :
+        mfc_map_functions
+    {
+        template< class X >
+        struct meta
+        {
+            typedef ::CString key_t;
+            typedef ::CObject *mapped_t;
+
+            typedef mfc_map_iterator<X, key_t, mapped_t> mutable_iterator;
+            typedef mutable_iterator const_iterator;
+        };
+    };
+
+
+    template< >
+    struct customization< ::CMapStringToPtr > :
+        mfc_map_functions
+    {
+        template< class X >
+        struct meta
+        {
+            typedef ::CString key_t;
+            typedef void *mapped_t;
+
+            typedef mfc_map_iterator<X, key_t, mapped_t> mutable_iterator;
+            typedef mutable_iterator const_iterator;
+        };
+    };
+
+
+    template< >
+    struct customization< ::CMapStringToString > :
+    #if !defined(BOOST_RANGE_MFC_NO_CPAIR)
+        mfc_cpair_map_functions
+    #else
+        mfc_map_functions
+    #endif
+    {
+        template< class X >
+        struct meta
+        {
+    #if !defined(BOOST_RANGE_MFC_NO_CPAIR)
+            typedef typename X::CPair pair_t;
+
+            typedef mfc_cpair_map_iterator<X, pair_t> mutable_iterator;
+            typedef mfc_cpair_map_iterator<X const, pair_t const> const_iterator;
+    #else
+            typedef ::CString key_t;
+            typedef ::CString mapped_t;
+
+            typedef mfc_map_iterator<X, key_t, mapped_t> mutable_iterator;
+            typedef mutable_iterator const_iterator;
+    #endif
+        };
+    };
+
+
+    template< >
+    struct customization< ::CMapWordToOb > :
+        mfc_map_functions
+    {
+        template< class X >
+        struct meta
+        {
+            typedef WORD key_t;
+            typedef ::CObject *mapped_t;
+
+            typedef mfc_map_iterator<X, key_t, mapped_t> mutable_iterator;
+            typedef mutable_iterator const_iterator;
+        };
+    };
+
+
+    template< >
+    struct customization< ::CMapWordToPtr > :
+        mfc_map_functions
+    {
+        template< class X >
+        struct meta
+        {
+            typedef WORD key_t;
+            typedef void *mapped_t;
+
+            typedef mfc_map_iterator<X, key_t, mapped_t> mutable_iterator;
+            typedef mutable_iterator const_iterator;
+        };
+    };
+
+
+    // templates
+    //
+
+    template< class Type, class ArgType >
+    struct customization< ::CArray<Type, ArgType> > :
+        array_functions
+    {
+        template< class X >
+        struct meta
+        {
+            typedef Type val_t;
+
+            typedef val_t *mutable_iterator;
+            typedef val_t const *const_iterator;
+        };
+    };
+
+
+    template< class Type, class ArgType >
+    struct customization< ::CList<Type, ArgType> > :
+        list_functions
+    {
+        template< class X >
+        struct meta
+        {
+            typedef Type val_t;
+
+            typedef list_iterator<X, val_t> mutable_iterator;
+    #if !defined(BOOST_RANGE_MFC_CONST_COL_RETURNS_NON_REF)
+            typedef list_iterator<X const, val_t const> const_iterator;
+    #else
+            typedef list_iterator<X const, val_t const, val_t const> const_iterator;
+    #endif
+        };
+    };
+
+
+    template< class Key, class ArgKey, class Mapped, class ArgMapped >
+    struct customization< ::CMap<Key, ArgKey, Mapped, ArgMapped> > :
+    #if !defined(BOOST_RANGE_MFC_NO_CPAIR)
+        mfc_cpair_map_functions
+    #else
+        mfc_map_functions
+    #endif
+    {
+        template< class X >
+        struct meta
+        {
+    #if !defined(BOOST_RANGE_MFC_NO_CPAIR)
+            typedef typename X::CPair pair_t;
+
+            typedef mfc_cpair_map_iterator<X, pair_t> mutable_iterator;
+            typedef mfc_cpair_map_iterator<X const, pair_t const> const_iterator;
+    #else
+            typedef Key key_t;
+            typedef Mapped mapped_t;
+
+            typedef mfc_map_iterator<X, key_t, mapped_t> mutable_iterator;
+            typedef mutable_iterator const_iterator;
+    #endif            
+        };
+    };
+
+
+    template< class BaseClass, class PtrType >
+    struct customization< ::CTypedPtrArray<BaseClass, PtrType> >
+    {
+        template< class X >
+        struct fun
+        {
+            typedef typename remove_pointer<PtrType>::type val_t;
+
+            typedef typename mpl::if_< is_const<X>,
+                val_t const,
+                val_t
+            >::type val_t_;
+
+            typedef val_t_ * const result_type;
+
+            template< class PtrType_ >
+            result_type operator()(PtrType_ p) const
+            {
+                return static_cast<result_type>(p);
+            }
+        };
+
+        template< class X >
+        struct meta
+        {
+            typedef typename compatible_mutable_iterator<BaseClass>::type miter_t;
+            typedef typename range_const_iterator<BaseClass>::type citer_t;
+
+            typedef transform_iterator<fun<X>, miter_t> mutable_iterator;
+            typedef transform_iterator<fun<X const>, citer_t> const_iterator;
+        };
+
+        template< class Iterator, class X >
+        Iterator begin(X& x)
+        {
+            return Iterator(boost::begin<BaseClass>(x), fun<X>());
+        }
+
+        template< class Iterator, class X >
+        Iterator end(X& x)
+        {
+            return Iterator(boost::end<BaseClass>(x), fun<X>());
+        }
+    };
+
+
+    template< class BaseClass, class PtrType >
+    struct customization< ::CTypedPtrList<BaseClass, PtrType> > :
+        list_functions
+    {
+        template< class X >
+        struct meta
+        {
+            typedef typename remove_pointer<PtrType>::type val_t;
+
+            // not l-value
+            typedef list_iterator<X, val_t * const, val_t * const> mutable_iterator;
+            typedef list_iterator<X const, val_t const * const, val_t const * const> const_iterator;
+        };
+    };
+
+
+    template< class BaseClass, class KeyPtrType, class MappedPtrType >
+    struct customization< ::CTypedPtrMap<BaseClass, KeyPtrType, MappedPtrType> > :
+        mfc_map_functions
+    {
+        template< class X >
+        struct meta
+        {
+            typedef mfc_map_iterator<X, KeyPtrType, MappedPtrType> mutable_iterator;
+            typedef mutable_iterator const_iterator;
+        };
+    };
+
+
+    // strings
+    //
+
+#if defined(BOOST_RANGE_MFC_HAS_LEGACY_STRING)
+
+    template< >
+    struct customization< ::CString >
+    {
+        template< class X >
+        struct meta
+        {
+            // LPTSTR/LPCTSTR is not always defined in <tchar.h>.
+            typedef TCHAR *mutable_iterator;
+            typedef TCHAR const *const_iterator;
+        };
+
+        template< class Iterator, class X >
+        typename mutable_<Iterator, X>::type begin(X& x)
+        {
+            return x.GetBuffer(0);
+        }
+
+        template< class Iterator, class X >
+        Iterator begin(X const& x)
+        {
+            return x;
+        }
+
+        template< class Iterator, class X >
+        Iterator end(X& x)
+        {
+            return begin<Iterator>(x) + x.GetLength();
+        }
+    };
+
+#endif // defined(BOOST_RANGE_MFC_HAS_LEGACY_STRING)
+
+
+} } // namespace boost::range_detail_microsoft
+
+
+
+
+// range customizations
+//
+
+
+// arrays
+//
+BOOST_RANGE_DETAIL_MICROSOFT_CUSTOMIZATION_TYPE(
+    boost::range_detail_microsoft::using_type_as_tag,
+    BOOST_PP_NIL, CByteArray
+)
+
+BOOST_RANGE_DETAIL_MICROSOFT_CUSTOMIZATION_TYPE(
+    boost::range_detail_microsoft::using_type_as_tag,
+    BOOST_PP_NIL, CDWordArray
+)
+
+BOOST_RANGE_DETAIL_MICROSOFT_CUSTOMIZATION_TYPE(
+    boost::range_detail_microsoft::using_type_as_tag,
+    BOOST_PP_NIL, CStringArray
+)
+
+BOOST_RANGE_DETAIL_MICROSOFT_CUSTOMIZATION_TYPE(
+    boost::range_detail_microsoft::using_type_as_tag,
+    BOOST_PP_NIL, CUIntArray
+)
+
+BOOST_RANGE_DETAIL_MICROSOFT_CUSTOMIZATION_TYPE(
+    boost::range_detail_microsoft::using_type_as_tag,
+    BOOST_PP_NIL, CWordArray
+)
+
+
+// lists
+//
+BOOST_RANGE_DETAIL_MICROSOFT_CUSTOMIZATION_TYPE(
+    boost::range_detail_microsoft::using_type_as_tag,
+    BOOST_PP_NIL, CObList
+)
+
+BOOST_RANGE_DETAIL_MICROSOFT_CUSTOMIZATION_TYPE(
+    boost::range_detail_microsoft::using_type_as_tag,
+    BOOST_PP_NIL, CPtrList
+)
+
+BOOST_RANGE_DETAIL_MICROSOFT_CUSTOMIZATION_TYPE(
+    boost::range_detail_microsoft::using_type_as_tag,
+    BOOST_PP_NIL, CStringList
+)
+
+BOOST_RANGE_DETAIL_MICROSOFT_CUSTOMIZATION_TYPE(
+    boost::range_detail_microsoft::using_type_as_tag,
+    BOOST_PP_NIL, CObArray
+)
+
+BOOST_RANGE_DETAIL_MICROSOFT_CUSTOMIZATION_TYPE(
+    boost::range_detail_microsoft::using_type_as_tag,
+    BOOST_PP_NIL, CPtrArray
+)
+
+
+// maps
+//
+BOOST_RANGE_DETAIL_MICROSOFT_CUSTOMIZATION_TYPE(
+    boost::range_detail_microsoft::using_type_as_tag,
+    BOOST_PP_NIL, CMapPtrToWord
+)
+
+BOOST_RANGE_DETAIL_MICROSOFT_CUSTOMIZATION_TYPE(
+    boost::range_detail_microsoft::using_type_as_tag,
+    BOOST_PP_NIL, CMapPtrToPtr
+)
+
+BOOST_RANGE_DETAIL_MICROSOFT_CUSTOMIZATION_TYPE(
+    boost::range_detail_microsoft::using_type_as_tag,
+    BOOST_PP_NIL, CMapStringToOb
+)
+
+BOOST_RANGE_DETAIL_MICROSOFT_CUSTOMIZATION_TYPE(
+    boost::range_detail_microsoft::using_type_as_tag,
+    BOOST_PP_NIL, CMapStringToPtr
+)
+
+BOOST_RANGE_DETAIL_MICROSOFT_CUSTOMIZATION_TYPE(
+    boost::range_detail_microsoft::using_type_as_tag,
+    BOOST_PP_NIL, CMapStringToString
+)
+
+BOOST_RANGE_DETAIL_MICROSOFT_CUSTOMIZATION_TYPE(
+    boost::range_detail_microsoft::using_type_as_tag,
+    BOOST_PP_NIL, CMapWordToOb
+)
+
+BOOST_RANGE_DETAIL_MICROSOFT_CUSTOMIZATION_TYPE(
+    boost::range_detail_microsoft::using_type_as_tag,
+    BOOST_PP_NIL, CMapWordToPtr
+)
+
+
+// templates
+//
+BOOST_RANGE_DETAIL_MICROSOFT_CUSTOMIZATION_TEMPLATE(
+    boost::range_detail_microsoft::using_type_as_tag,
+    BOOST_PP_NIL, CArray, 2
+)
+
+BOOST_RANGE_DETAIL_MICROSOFT_CUSTOMIZATION_TEMPLATE(
+    boost::range_detail_microsoft::using_type_as_tag,
+    BOOST_PP_NIL, CList, 2
+)
+
+BOOST_RANGE_DETAIL_MICROSOFT_CUSTOMIZATION_TEMPLATE(
+    boost::range_detail_microsoft::using_type_as_tag,
+    BOOST_PP_NIL, CMap, 4
+)
+
+BOOST_RANGE_DETAIL_MICROSOFT_CUSTOMIZATION_TEMPLATE(
+    boost::range_detail_microsoft::using_type_as_tag,
+    BOOST_PP_NIL, CTypedPtrArray, 2
+)
+
+BOOST_RANGE_DETAIL_MICROSOFT_CUSTOMIZATION_TEMPLATE(
+    boost::range_detail_microsoft::using_type_as_tag,
+    BOOST_PP_NIL, CTypedPtrList, 2
+)
+
+BOOST_RANGE_DETAIL_MICROSOFT_CUSTOMIZATION_TEMPLATE(
+    boost::range_detail_microsoft::using_type_as_tag,
+    BOOST_PP_NIL, CTypedPtrMap, 3
+)
+
+
+// strings
+//
+#if defined(BOOST_RANGE_MFC_HAS_LEGACY_STRING)
+
+    BOOST_RANGE_DETAIL_MICROSOFT_CUSTOMIZATION_TYPE(
+        boost::range_detail_microsoft::using_type_as_tag,
+        BOOST_PP_NIL, CString
+    )
+
+#endif
+
+
+
+
+#endif
diff --git a/include/boost/range/mutable_iterator.hpp b/include/boost/range/mutable_iterator.hpp
new file mode 100755
index 0000000..2f45c16
--- /dev/null
+++ b/include/boost/range/mutable_iterator.hpp
@@ -0,0 +1,64 @@
+// 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/
+//
+
+#ifndef BOOST_RANGE_MUTABLE_ITERATOR_HPP
+#define BOOST_RANGE_MUTABLE_ITERATOR_HPP
+
+#if defined(_MSC_VER) && (_MSC_VER >= 1200)
+# pragma once
+#endif
+
+#include <boost/range/config.hpp>
+
+#ifdef BOOST_NO_TEMPLATE_PARTIAL_SPECIALIZATION
+#include <boost/range/detail/iterator.hpp>
+#else
+
+#include <boost/iterator/iterator_traits.hpp>
+#include <cstddef>
+#include <utility>
+
+namespace boost
+{
+    //////////////////////////////////////////////////////////////////////////
+    // default
+    //////////////////////////////////////////////////////////////////////////
+    
+    template< typename C >
+    struct range_mutable_iterator
+    {
+        typedef BOOST_DEDUCED_TYPENAME C::iterator type;
+    };
+    
+    //////////////////////////////////////////////////////////////////////////
+    // pair
+    //////////////////////////////////////////////////////////////////////////
+
+    template< typename Iterator >
+    struct range_mutable_iterator< std::pair<Iterator,Iterator> >
+    {
+        typedef Iterator type;
+    };
+
+    //////////////////////////////////////////////////////////////////////////
+    // array
+    //////////////////////////////////////////////////////////////////////////
+
+    template< typename T, std::size_t sz >
+    struct range_mutable_iterator< T[sz] >
+    {
+        typedef T* type;
+    };
+
+} // namespace boost
+
+#endif // BOOST_NO_TEMPLATE_PARTIAL_SPECIALIZATION
+
+#endif
diff --git a/include/boost/range/pointer.hpp b/include/boost/range/pointer.hpp
new file mode 100755
index 0000000..e7431ff
--- /dev/null
+++ b/include/boost/range/pointer.hpp
@@ -0,0 +1,29 @@
+// Boost.Range library
+//
+//  Copyright Thorsten Ottosen 2003-2006. 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/
+//
+
+#ifndef BOOST_RANGE_POINTER_TYPE_HPP
+#define BOOST_RANGE_POINTER_TYPE_HPP
+
+#if defined(_MSC_VER) && (_MSC_VER >= 1200)
+# pragma once
+#endif
+
+#include <boost/range/config.hpp>
+#include <boost/range/iterator.hpp>
+#include <boost/iterator/iterator_traits.hpp>
+
+namespace boost
+{
+    template< class T >
+    struct range_pointer : iterator_pointer< typename range_iterator<T>::type >
+    { };
+}
+
+#endif
diff --git a/include/boost/range/rbegin.hpp b/include/boost/range/rbegin.hpp
index 0fcf00c..78e5f61 100755
--- a/include/boost/range/rbegin.hpp
+++ b/include/boost/range/rbegin.hpp
@@ -16,9 +16,7 @@
 #endif
 
 #include <boost/range/end.hpp>
-#include <boost/range/reverse_result_iterator.hpp>
 #include <boost/range/reverse_iterator.hpp>
-#include <boost/range/const_reverse_iterator.hpp>
 
 namespace boost
 {
@@ -26,30 +24,28 @@ namespace boost
 #ifdef BOOST_NO_FUNCTION_TEMPLATE_ORDERING
 
 template< class C >
-inline BOOST_DEDUCED_TYPENAME range_reverse_result_iterator<C>::type
+inline BOOST_DEDUCED_TYPENAME range_reverse_iterator<C>::type
 rbegin( C& c )
 {
-    return BOOST_DEDUCED_TYPENAME range_reverse_result_iterator<C>::type( end( c ) );
+    return BOOST_DEDUCED_TYPENAME range_reverse_iterator<C>::type( boost::end( c ) );
 }
 
 #else
 
 template< class C >
-inline BOOST_DEDUCED_TYPENAME range_reverse_iterator<
-                                                                typename remove_const<C>::type >::type
+inline BOOST_DEDUCED_TYPENAME range_reverse_iterator<C>::type
 rbegin( C& c )
 {
-    typedef BOOST_DEDUCED_TYPENAME range_reverse_iterator<
-                                                                typename remove_const<C>::type >::type
+    typedef BOOST_DEDUCED_TYPENAME range_reverse_iterator<C>::type
         iter_type;
     return iter_type( boost::end( c ) );
 }
 
 template< class C >
-inline BOOST_DEDUCED_TYPENAME range_const_reverse_iterator<C>::type
+inline BOOST_DEDUCED_TYPENAME range_reverse_iterator<const C>::type
 rbegin( const C& c )
 {
-    typedef BOOST_DEDUCED_TYPENAME range_const_reverse_iterator<C>::type
+    typedef BOOST_DEDUCED_TYPENAME range_reverse_iterator<const C>::type
         iter_type;
     return iter_type( boost::end( c ) );
 }
@@ -57,7 +53,7 @@ rbegin( const C& c )
 #endif // BOOST_NO_FUNCTION_TEMPLATE_ORDERING
 
 template< class T >
-inline BOOST_DEDUCED_TYPENAME range_const_reverse_iterator<T>::type
+inline BOOST_DEDUCED_TYPENAME range_reverse_iterator<const T>::type
 const_rbegin( const T& r )
 {
     return boost::rbegin( r );
@@ -66,3 +62,4 @@ const_rbegin( const T& r )
 } // namespace 'boost'
 
 #endif
+
diff --git a/include/boost/range/reference.hpp b/include/boost/range/reference.hpp
new file mode 100755
index 0000000..d308e43
--- /dev/null
+++ b/include/boost/range/reference.hpp
@@ -0,0 +1,29 @@
+// 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/
+//
+
+#ifndef BOOST_RANGE_REFERENCE_TYPE_HPP
+#define BOOST_RANGE_REFERENCE_TYPE_HPP
+
+#if defined(_MSC_VER) && (_MSC_VER >= 1200)
+# pragma once
+#endif
+
+#include <boost/range/config.hpp>
+#include <boost/range/iterator.hpp>
+#include <boost/iterator/iterator_traits.hpp>
+
+namespace boost
+{
+    template< class T >
+    struct range_reference : iterator_reference< typename range_iterator<T>::type >
+    { };
+}
+
+#endif
diff --git a/include/boost/range/rend.hpp b/include/boost/range/rend.hpp
index 3e91ff7..fd79aa2 100755
--- a/include/boost/range/rend.hpp
+++ b/include/boost/range/rend.hpp
@@ -16,9 +16,7 @@
 #endif
 
 #include <boost/range/begin.hpp>
-#include <boost/range/reverse_result_iterator.hpp>
 #include <boost/range/reverse_iterator.hpp>
-#include <boost/range/const_reverse_iterator.hpp>
 
 namespace boost
 {
@@ -26,30 +24,28 @@ namespace boost
 #ifdef BOOST_NO_FUNCTION_TEMPLATE_ORDERING
 
 template< class C >
-inline BOOST_DEDUCED_TYPENAME range_reverse_result_iterator<C>::type
+inline BOOST_DEDUCED_TYPENAME range_reverse_iterator<C>::type
 rend( C& c )
 {
-    return BOOST_DEDUCED_TYPENAME range_reverse_result_iterator<C>::type( boost::begin( c ) );
+    return BOOST_DEDUCED_TYPENAME range_reverse_iterator<C>::type( boost::begin( c ) );
 }
 
 #else
 
 template< class C >
-inline BOOST_DEDUCED_TYPENAME range_reverse_iterator<
-                                                                typename remove_const<C>::type >::type
+inline BOOST_DEDUCED_TYPENAME range_reverse_iterator<C>::type
 rend( C& c )
 {
-        typedef BOOST_DEDUCED_TYPENAME range_reverse_iterator<
-                                                                typename remove_const<C>::type >::type
+    typedef BOOST_DEDUCED_TYPENAME range_reverse_iterator<C>::type
                iter_type;
     return iter_type( boost::begin( c ) );
 }
 
 template< class C >
-inline BOOST_DEDUCED_TYPENAME range_const_reverse_iterator<C>::type
+inline BOOST_DEDUCED_TYPENAME range_reverse_iterator<const C>::type
 rend( const C& c )
 {
-    typedef BOOST_DEDUCED_TYPENAME range_const_reverse_iterator<C>::type
+    typedef BOOST_DEDUCED_TYPENAME range_reverse_iterator<const C>::type
         iter_type;
     return iter_type( boost::begin( c ) );
 }
@@ -57,7 +53,7 @@ rend( const C& c )
 #endif
 
 template< class T >
-inline BOOST_DEDUCED_TYPENAME range_const_reverse_iterator<T>::type
+inline BOOST_DEDUCED_TYPENAME range_reverse_iterator<const T>::type
 const_rend( const T& r )
 {
     return boost::rend( r );
@@ -66,3 +62,4 @@ const_rend( const T& r )
 } // namespace 'boost'
 
 #endif
+
diff --git a/include/boost/range/result_iterator.hpp b/include/boost/range/result_iterator.hpp
index 86e71cd..ba09c5f 100755
--- a/include/boost/range/result_iterator.hpp
+++ b/include/boost/range/result_iterator.hpp
@@ -15,29 +15,19 @@
 # pragma once
 #endif
 
-#include <boost/range/config.hpp>
 #include <boost/range/iterator.hpp>
-#include <boost/range/const_iterator.hpp>
-#include <boost/type_traits/is_const.hpp>
-#include <boost/mpl/if.hpp>
 
 namespace boost
 {
-    //////////////////////////////////////////////////////////////////////////
-    // default
-    //////////////////////////////////////////////////////////////////////////
+    //
+    // This interface is deprecated, use range_iterator<T>
+    //
     
     template< typename C >
-    struct range_result_iterator
-    {
-        typedef BOOST_RANGE_DEDUCED_TYPENAME 
-            mpl::if_< BOOST_DEDUCED_TYPENAME is_const<C>::type, 
-                      BOOST_DEDUCED_TYPENAME range_const_iterator<C>::type,
-                      BOOST_DEDUCED_TYPENAME range_iterator<C>::type >::type type;
-    };
+    struct range_result_iterator : range_iterator<C>
+    { };
     
 } // namespace boost
 
-//#endif // BOOST_NO_TEMPLATE_PARTIAL_SPECIALIZATION
 
 #endif
diff --git a/include/boost/range/reverse_result_iterator.hpp b/include/boost/range/reverse_result_iterator.hpp
index bb17389..62bf135 100755
--- a/include/boost/range/reverse_result_iterator.hpp
+++ b/include/boost/range/reverse_result_iterator.hpp
@@ -15,22 +15,17 @@
 # pragma once
 #endif
 
-#include <boost/range/config.hpp>
-#include <boost/range/result_iterator.hpp>
-#include <boost/iterator/reverse_iterator.hpp>
+#include <boost/range/reverse_iterator.hpp>
 
 namespace boost
 {
-    //////////////////////////////////////////////////////////////////////////
-    // default
-    //////////////////////////////////////////////////////////////////////////
+    //
+    // This interface is deprecated, use range_reverse_iterator<T>
+    //
    
     template< typename C >
-    struct range_reverse_result_iterator
-    {
-        typedef reverse_iterator< 
-            BOOST_RANGE_DEDUCED_TYPENAME range_result_iterator<C>::type > type;
-    };
+    struct range_reverse_result_iterator : range_reverse_iterator<C>
+    { };
     
 } // namespace boost
 
diff --git a/include/boost/range/size.hpp b/include/boost/range/size.hpp
index 88201da..311a692 100755
--- a/include/boost/range/size.hpp
+++ b/include/boost/range/size.hpp
@@ -15,109 +15,22 @@
 # pragma once
 #endif
 
-#include <boost/range/config.hpp>
-
-#ifdef BOOST_NO_FUNCTION_TEMPLATE_ORDERING
-#include <boost/range/detail/size.hpp>
-#else
-
-#include <boost/range/detail/implementation_help.hpp>
-#include <boost/range/size_type.hpp>
-#include <cstddef>
-#include <iterator>
-#include <utility>
+#include <boost/range/begin.hpp>
+#include <boost/range/end.hpp>
+#include <boost/range/difference_type.hpp>
+#include <boost/assert.hpp>
 
 namespace boost 
 {
 
-#if !BOOST_WORKAROUND(__BORLANDC__, BOOST_TESTED_AT(0x564))    
-namespace range_detail 
-{
-#endif
-        //////////////////////////////////////////////////////////////////////
-        // primary template
-        //////////////////////////////////////////////////////////////////////
-        
-        template< typename C >
-        inline BOOST_DEDUCED_TYPENAME C::size_type
-        boost_range_size(  const C& c )
-        {
-            return c.size(); 
-        }
-
-        //////////////////////////////////////////////////////////////////////
-        // pair
-        //////////////////////////////////////////////////////////////////////
-
-        template< typename Iterator >
-        inline std::size_t boost_range_size(  const std::pair<Iterator,Iterator>& p )
-        {
-            return std::distance( p.first, p.second );
-        }
-
-        //////////////////////////////////////////////////////////////////////
-        // array
-        //////////////////////////////////////////////////////////////////////
-
-        template< typename T, std::size_t sz >
-        inline std::size_t boost_range_size(  const T (&array)[sz] )
-        {
-            return range_detail::array_size<T,sz>( array ); 
-        }
-        
-        template< typename T, std::size_t sz >
-        inline std::size_t boost_range_size(  T (&array)[sz] )
-        {
-            return boost::range_detail::array_size<T,sz>( array );
-        }
-        
-        //////////////////////////////////////////////////////////////////////
-        // string
-        //////////////////////////////////////////////////////////////////////
-
-        inline std::size_t boost_range_size(  const char* const& s )
-        {
-            return boost::range_detail::str_size( s );
-        }
-
-        inline std::size_t boost_range_size(  const wchar_t* const& s )
-        {
-            return boost::range_detail::str_size( s );
-        }
-
-#if !BOOST_WORKAROUND(__BORLANDC__, BOOST_TESTED_AT(0x564))                
-} // namespace 'range_detail'
-#endif
-
-template< class T >
-inline BOOST_DEDUCED_TYPENAME range_size<T>::type size(  const T& r )
-{
-#if !BOOST_WORKAROUND(__BORLANDC__, BOOST_TESTED_AT(0x564))        
-    using namespace range_detail;
-#endif    
-    return boost_range_size( r );
-}
-
-
-#if BOOST_WORKAROUND(__MWERKS__, <= 0x3003 ) || BOOST_WORKAROUND(__BORLANDC__, BOOST_TESTED_AT(0x564))
-// BCB and CW are not able to overload pointer when class overloads are also available.
-inline range_size<const char*>::type size(  const char* r ) {
-    return range_detail::str_size( r );
-}
-inline range_size<char*>::type size(  char* r ) {
-    return range_detail::str_size( r );
-}
-inline range_size<const wchar_t*>::type size(  const wchar_t* r ) {
-    return range_detail::str_size( r );
-}
-inline range_size<wchar_t*>::type size(  wchar_t* r ) {
-    return range_detail::str_size( r );
-}
-#endif
-
+    template< class T >
+    inline BOOST_DEDUCED_TYPENAME range_difference<T>::type size( const T& r )
+    {
+        BOOST_ASSERT( (boost::end( r ) - boost::begin( r )) >= 0 &&
+                      "reachability invariant broken!" );
+        return boost::end( r ) - boost::begin( r );
+    }
 
 } // namespace 'boost'
 
-#endif // BOOST_NO_FUNCTION_TEMPLATE_ORDERING
-
 #endif
diff --git a/include/boost/range/size_type.hpp b/include/boost/range/size_type.hpp
index 57f191d..7ed8dfa 100755
--- a/include/boost/range/size_type.hpp
+++ b/include/boost/range/size_type.hpp
@@ -16,158 +16,60 @@
 #endif
 
 #include <boost/range/config.hpp>
-/*
-#include <boost/range/difference_type.hpp>
-
-namespace boost
-{
-        namespace range_detail
-        {
-                template< class T >
-                struct add_unsigned;
-
-                template<>
-                struct add_unsigned<short>
-                {
-                        typedef unsigned short type;
-                };
-
-                template<>
-                struct add_unsigned<int>
-                {
-                        typedef unsigned int type;
-                };
-
-                template<>
-                struct add_unsigned<long>
-                {
-                        typedef unsigned long type;
-                };
-
-#ifdef BOOST_HAS_LONG_LONG
-
-                template<>
-                struct add_unsigned<long long>
-                {
-                        typedef unsigned long long type;
-                };
-#endif
-
-        }
-
-        template< class T >
-        struct range_size
-        {
-                typedef BOOST_DEDUCED_TYPENAME range_detail::add_unsigned<
-                                        BOOST_DEDUCED_TYPENAME range_difference<T>::type >::type
-                        type;
-        };
-}
-*/
 
 #ifdef BOOST_NO_TEMPLATE_PARTIAL_SPECIALIZATION
 #include <boost/range/detail/size_type.hpp>
 #else
 
+#include <boost/type_traits/remove_const.hpp>
 #include <cstddef>
 #include <utility>
 
 namespace boost
 {
-    //////////////////////////////////////////////////////////////////////////
-    // default
-    //////////////////////////////////////////////////////////////////////////
-
-    template< typename C >
-    struct range_size
+    namespace detail
     {
-        typedef BOOST_DEDUCED_TYPENAME C::size_type type;
-    };
 
-    //////////////////////////////////////////////////////////////////////////
-    // pair
-    //////////////////////////////////////////////////////////////////////////
+        //////////////////////////////////////////////////////////////////////////
+        // default
+        //////////////////////////////////////////////////////////////////////////
+    
+        template< typename C >
+        struct range_size
+        {
+            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< typename Iterator >
-    struct range_size< std::pair<Iterator,Iterator> >
-    {
-        typedef std::size_t type;
-    };
-
-    template< typename Iterator >
-    struct range_size< const 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< typename T, std::size_t sz >
-    struct range_size< const T[sz] >
-    {
-        typedef std::size_t type;
-    };
-
-    //////////////////////////////////////////////////////////////////////////
-    // string
-    //////////////////////////////////////////////////////////////////////////
-
-    template<>
-    struct range_size< char* >
-    {
-        typedef std::size_t type;
-    };
-
-    template<>
-    struct range_size< wchar_t* >
-    {
-        typedef std::size_t type;
-    };
-
-    template<>
-    struct range_size< const char* >
-    {
-        typedef std::size_t type;
-    };
-
-    template<>
-    struct range_size< const wchar_t* >
-    {
-        typedef std::size_t type;
-    };
-
-    template<>
-    struct range_size< char* const >
-    {
-        typedef std::size_t type;
-    };
-
-    template<>
-    struct range_size< wchar_t* const >
-    {
-        typedef std::size_t type;
-    };
-
-    template<>
-    struct range_size< const char* const >
-    {
-        typedef std::size_t type;
-    };
-
-    template<>
-    struct range_size< const wchar_t* const >
-    {
-        typedef std::size_t type;
-    };
+    template< class T >
+    struct range_size : 
+        detail::range_size<T>
+    { };
 
+    template< class T >
+    struct range_size<const T > : range_size<T>
+    { };
+    
 } // namespace boost
 
 #endif // BOOST_NO_TEMPLATE_PARTIAL_SPECIALIZATION
diff --git a/include/boost/range/sub_range.hpp b/include/boost/range/sub_range.hpp
index 7781fca..802454b 100755
--- a/include/boost/range/sub_range.hpp
+++ b/include/boost/range/sub_range.hpp
@@ -11,10 +11,13 @@
 #ifndef BOOST_RANGE_SUB_RANGE_HPP
 #define BOOST_RANGE_SUB_RANGE_HPP
 
+#if BOOST_WORKAROUND(BOOST_MSVC, == 1310) || BOOST_WORKAROUND(BOOST_MSVC, == 1400) 
+    #pragma warning( disable : 4996 )
+#endif
+
 #include <boost/range/config.hpp>
 #include <boost/range/iterator_range.hpp>
 #include <boost/range/value_type.hpp>
-#include <boost/range/result_iterator.hpp>
 #include <boost/range/size_type.hpp>
 #include <boost/range/difference_type.hpp>
 #include <boost/assert.hpp>
@@ -23,34 +26,29 @@ namespace boost
 {
     
     template< class ForwardRange > 
-    class sub_range : public iterator_range< BOOST_DEDUCED_TYPENAME range_result_iterator<ForwardRange>::type > 
+    class sub_range : public iterator_range< BOOST_DEDUCED_TYPENAME range_iterator<ForwardRange>::type > 
     {
-        typedef BOOST_DEDUCED_TYPENAME range_result_iterator<ForwardRange>::type iterator_t;
+        typedef BOOST_DEDUCED_TYPENAME range_iterator<ForwardRange>::type iterator_t;
         typedef iterator_range< iterator_t  > base;
 
         typedef BOOST_DEDUCED_TYPENAME base::impl impl;
     public:
         typedef BOOST_DEDUCED_TYPENAME range_value<ForwardRange>::type            value_type;
-        typedef BOOST_DEDUCED_TYPENAME range_result_iterator<ForwardRange>::type  iterator;
-        typedef BOOST_DEDUCED_TYPENAME range_const_iterator<ForwardRange>::type   const_iterator;
+        typedef BOOST_DEDUCED_TYPENAME range_iterator<ForwardRange>::type         iterator;
+        typedef BOOST_DEDUCED_TYPENAME range_iterator<const ForwardRange>::type   const_iterator;
         typedef BOOST_DEDUCED_TYPENAME range_difference<ForwardRange>::type       difference_type;
         typedef BOOST_DEDUCED_TYPENAME range_size<ForwardRange>::type             size_type;
         typedef BOOST_DEDUCED_TYPENAME base::reference                            reference;
-        typedef BOOST_DEDUCED_TYPENAME iterator_reference<const_iterator>::type   const_reference;
 
     public:
         sub_range() : base() 
         { }
-
-/*        
-        template< class ForwardRange2 >
-        sub_range( sub_range<ForwardRange2> r ) :
-
-#if BOOST_WORKAROUND(BOOST_INTEL_CXX_VERSION, <= 800 )
-            base( impl::adl_begin( r ), impl::adl_end( r ) )
-#else
-            base( r )
-#endif */
+        
+#if BOOST_WORKAROUND(BOOST_MSVC, == 1310) || BOOST_WORKAROUND(BOOST_MSVC, == 1400) 
+        sub_range( const sub_range& r ) 
+            : base( static_cast<const base&>( r ) )  
+        { }  
+#endif
 
         template< class ForwardRange2 >
         sub_range( ForwardRange2& r ) : 
@@ -89,15 +87,11 @@ namespace boost
         {
             base::operator=( r );
             return *this;
-        }
+        }   
 
-        sub_range& operator=( sub_range r )
+        sub_range& operator=( const sub_range& r )
         {
-            //
-            // argument passed by value to avoid 
-            // const_iterator to iterator conversion
-            //
-            base::operator=( r );
+            base::operator=( static_cast<const base&>(r) );
             return *this;            
         }
         
@@ -107,7 +101,7 @@ namespace boost
         const_iterator  begin() const    { return base::begin(); }
         iterator        end()            { return base::end();   }
         const_iterator  end() const      { return base::end();   }
-        size_type       size() const     { return base::size();  }   
+        difference_type size() const     { return base::size();  }   
 
         
     public: // convenience
@@ -116,7 +110,7 @@ namespace boost
             return base::front();
         }
 
-        const_reference front() const
+        const value_type& front() const
         {
             return base::front();
         }
@@ -126,17 +120,17 @@ namespace boost
             return base::back();
         }
 
-        const_reference back() const
+        const value_type& back() const
         {
             return base::back();
         }
 
-        reference operator[]( size_type sz )
+        reference operator[]( difference_type sz )
         {
             return base::operator[](sz);
         }
 
-        const_reference operator[]( size_type sz ) const
+        const value_type& operator[]( difference_type sz ) const
         {
             return base::operator[](sz);
         }
@@ -168,3 +162,4 @@ namespace boost
 } // namespace 'boost'
 
 #endif
+
diff --git a/include/boost/range/value_type.hpp b/include/boost/range/value_type.hpp
index 15537b0..95c7580 100755
--- a/include/boost/range/value_type.hpp
+++ b/include/boost/range/value_type.hpp
@@ -18,129 +18,17 @@
 #include <boost/range/config.hpp>
 #include <boost/range/iterator.hpp>
 
-#ifdef BOOST_NO_TEMPLATE_PARTIAL_SPECIALIZATION
-#include <boost/range/detail/value_type.hpp>
-#else
+//#ifdef BOOST_NO_TEMPLATE_PARTIAL_SPECIALIZATION
+//#include <boost/range/detail/value_type.hpp>
+//#else
 
 #include <boost/iterator/iterator_traits.hpp>
 
 namespace boost
 {
-        template< class T >
-    struct range_value
-        {
-                typedef BOOST_DEDUCED_TYPENAME iterator_value<
-                        BOOST_DEDUCED_TYPENAME range_iterator<T>::type >::type
-                                type;
-        };
+    template< class T >
+    struct range_value : iterator_value< typename range_iterator<T>::type >
+    { };
 }
 
-/*
-#include <cstddef>
-#include <utility>
-
-
-namespace boost
-{
-    //////////////////////////////////////////////////////////////////////////
-    // default
-    //////////////////////////////////////////////////////////////////////////
-
-    template< typename C >
-    struct range_value
-    {
-        typedef BOOST_DEDUCED_TYPENAME C::value_type type;
-    };
-
-    //////////////////////////////////////////////////////////////////////////
-    // pair
-    //////////////////////////////////////////////////////////////////////////
-
-    template< typename Iterator >
-    struct range_value< std::pair<Iterator,Iterator> >
-    {
-        typedef BOOST_DEDUCED_TYPENAME
-            iterator_value<Iterator>::type type;
-    };
-
-
-    template< typename Iterator >
-    struct range_value< const std::pair<Iterator,Iterator> >
-    {
-        typedef BOOST_DEDUCED_TYPENAME
-            iterator_value<Iterator>::type type;
-    };
-
-    //////////////////////////////////////////////////////////////////////////
-    // array
-    //////////////////////////////////////////////////////////////////////////
-
-    template< typename T, std::size_t sz >
-    struct range_value< T[sz] >
-    {
-        typedef T type;
-    };
-
-    template< typename T, std::size_t sz >
-    struct range_value< const T[sz] >
-    {
-        typedef const T type;
-    };
-
-    //////////////////////////////////////////////////////////////////////////
-    // string
-    //////////////////////////////////////////////////////////////////////////
-
-    template<>
-    struct range_value< char* >
-    {
-        typedef char type;
-    };
-
-    template<>
-    struct range_value< wchar_t* >
-    {
-        typedef wchar_t type;
-    };
-
-    template<>
-    struct range_value< const char* >
-    {
-        typedef const char type;
-    };
-
-    template<>
-    struct range_value< const wchar_t* >
-    {
-        typedef const wchar_t type;
-    };
-
-    template<>
-    struct range_value< char* const >
-    {
-        typedef char type;
-    };
-
-    template<>
-    struct range_value< wchar_t* const >
-    {
-        typedef wchar_t type;
-    };
-
-    template<>
-    struct range_value< const char* const >
-    {
-        typedef const char type;
-    };
-
-    template<>
-    struct range_value< const wchar_t* const >
-    {
-        typedef const wchar_t type;
-    };
-
-} // namespace boost
-*/
-#endif // BOOST_NO_TEMPLATE_PARTIAL_SPECIALIZATION
-
 #endif

From a33d5c22c593af87a481a13390f28c5caa70a571 Mon Sep 17 00:00:00 2001
From: Beman Dawes <bdawes@acm.org>
Date: Sun, 25 Nov 2007 18:38:02 +0000
Subject: [PATCH 13/73] Full merge from trunk at revision 41356 of entire
 boost-root tree.

[SVN r41370]
---
 doc/Jamfile.v2               |   22 +
 doc/boost_range.html         | 1266 +++++++++++++++++-----------------
 doc/boost_range.qbk          | 1234 +++++++++++++++++++++++++++++++++
 doc/example.cpp              |    7 -
 doc/examples.html            |    6 +-
 doc/faq.html                 |    2 +-
 doc/headers.html             |   59 +-
 doc/history_ack.html         |    2 +-
 doc/intro.html               |   30 +-
 doc/mfc_atl.html             |  581 ++++++++++++++++
 doc/mfc_atl.rst              |  232 +++++++
 doc/portability.html         |    4 +-
 doc/range.html               |  211 +-----
 doc/style.css                |    7 -
 doc/style.html               |    2 +-
 doc/utility_class.html       |   73 +-
 index.html                   |   10 +-
 test/TODO                    |    1 +
 test/algorithm_example.cpp   |   13 +-
 test/array.cpp               |   10 +-
 test/atl.cpp                 |  623 +++++++++++++++++
 test/compat1.cpp             |    0
 test/extension_mechanism.cpp |   15 +-
 test/iterator_pair.cpp       |   19 +-
 test/iterator_range.cpp      |   26 +-
 test/mfc.cpp                 |  787 +++++++++++++++++++--
 test/partial_workaround.cpp  |    7 +-
 test/reversible_range.cpp    |   31 +-
 test/std_container.cpp       |   12 +-
 test/string.cpp              |  146 ++--
 test/sub_range.cpp           |   33 +-
 31 files changed, 4352 insertions(+), 1119 deletions(-)
 create mode 100644 doc/Jamfile.v2
 create mode 100644 doc/boost_range.qbk
 create mode 100644 doc/mfc_atl.html
 create mode 100644 doc/mfc_atl.rst
 create mode 100644 test/TODO
 create mode 100644 test/atl.cpp
 create mode 100755 test/compat1.cpp

diff --git a/doc/Jamfile.v2 b/doc/Jamfile.v2
new file mode 100644
index 0000000..0fafdd7
--- /dev/null
+++ b/doc/Jamfile.v2
@@ -0,0 +1,22 @@
+
+use-project boost : $(BOOST_ROOT) ;
+
+
+import boostbook : boostbook ;
+import quickbook ;
+
+xml boost_range : boost_range.qbk ;
+
+boostbook standalone
+  :
+    boost_range
+  :
+    <xsl:param>toc.max.depth=2
+    <xsl:param>toc.section.depth=4
+    <xsl:param>chunk.section.depth=2
+ 
+#    <xsl:param>generate.section.toc.level=4
+#    <xsl:param>chunk.first.sections=7
+#    <xsl:param>toc.section.depth=10
+  ;
+
diff --git a/doc/boost_range.html b/doc/boost_range.html
index 16ef3f3..ace1901 100644
--- a/doc/boost_range.html
+++ b/doc/boost_range.html
@@ -1,86 +1,87 @@
 <!DOCTYPE HTML PUBLIC "-//W3C//DTD HTML 4.01 Transitional//EN">
 <html>
-	<head>
-		<title>Boost.Range Reference </title>
-		<meta http-equiv="Content-Type" content="text/html; charset=iso-8859-1">
-		<link rel="stylesheet" href="style.css" type="text/css">
-	</head>
-	<body>
-		<table>
-			<tr>
-				<td><img src="../../../boost.png" width="100%" border="0"></td>
-				<td><h1><br>
-						Boost.Range
-					</h1>
-				</td>
-			</tr>
-		</table>
-		<h2>Synopsis and Reference
-		</h2>
-		<ul>
-			<li>
-				<a href="#overview">Overview</a>
-			<li>
-				<a href="#Synopsis">Synopsis</a>
-			<li>
-				<a href="#Semantics">Semantics</a>
-			<li>
-				<a href="#minimal_interface">Extending the library</a></li>
-		</ul>
-		<hr size="1">
-		<a name="overview"></a>
-		<h3>Overview</h3>
-		<p>
-			Four types of objects are currently supported by the library:
-			<ul>
-				<li>
-				standard-like containers
-				<li>
-					<code>std::pair&lt;iterator,iterator&gt;</code>
-				<li>
-					null terminated strings (this includes <code>char[]</code>,<code>wchar_t[]</code>,
-					<code>char*</code>, and <code>wchar_t*</code>)
-					<p>
-						<b>Warning:</b><i> support for null-terminated strings is deprecated and will 
-							disappear in the next Boost release (1.34). </i>
-					</p>
-				<li>
-					built-in arrays
-				</li>
-			</ul>
-			Even though the behavior of the primary templates are exactly such that 
-			standard containers will be supported by default, the requirements are much 
-			lower than the standard container requirements. For example, the utility class <a href="utility_class.html#iter_range">
-				<code>iterator_range</code></a> implements the <a href="#minimal_interface">minimal 
-				interface</a> required to make the class a <a href="range.html#forward_range">Forward 
-				Range</a>
-		.
-		<P></P>
-		<p>
-			Please also see <a href="range.html">Range concepts</a> for more details.
-		</p>
-		<a name="Synopsis"></a>
-		<h3>Synopsis</h3>
-		<p>
-			<pre>
+    <head>
+        <title>Boost.Range Reference </title>
+        <meta http-equiv="Content-Type" content="text/html; charset=iso-8859-1">
+        <link rel="stylesheet" href="style.css" type="text/css">
+    </head>
+    <body>
+        <table>
+            <tr>
+                <td><img src="../../../boost.png" width="100%" border="0"></td>
+                <td><h1><br>
+                        Boost.Range
+                    </h1>
+                </td>
+            </tr>
+        </table>
+        <h2>Synopsis and Reference
+        </h2>
+        <ul>
+            <li>
+                <a href="#overview">Overview</a>
+            <li>
+                <a href="#Synopsis">Synopsis</a>
+            <li>
+                <a href="#Semantics">Semantics</a>
+            <li>
+                <a href="#minimal_interface">Extending the library</a></li>
+        </ul>
+        <hr size="1">
+        <a name="overview"></a>
+        <h3>Overview</h3>
+        <p>
+            Three types of objects are currently supported by the library:
+            <ul>
+                <li>
+                standard-like containers
+                <li>
+                    <code>std::pair&lt;iterator,iterator&gt;</code>
+                  <li>
+                    built-in arrays
+                </li>
+            </ul>
+            Even though the behavior of the primary templates are exactly such that 
+            standard containers will be supported by default, the requirements are much 
+            lower than the standard container requirements. For example, the utility class <a href="utility_class.html#iter_range">
+                <code>iterator_range</code></a> implements the <a href="#minimal_interface">minimal 
+                interface</a> required to make the class a <a href="range.html#forward_range">Forward 
+                Range</a>
+        .
+        <P></P>
+        <p>
+            Please also see <a href="range.html">Range concepts</a> for more details.
+        </p>
+        <a name="Synopsis"></a>
+        <h3>Synopsis</h3>
+        <p>
+            <pre>
 <span class=keyword>namespace </span><span class=identifier>boost</span>
 <span class=special>{
     </span><span class=comment>//
     // Single Pass Range metafunctions
     //
-    
-    </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><a href="#range_value"><span 
-class=identifier>range_value</span></a><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><a href="#range_iterator"><span 
 class=identifier>range_iterator</span></a><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><a href="#range_const_iterator"><span 
-class=identifier>range_const_iterator</span></a><span class=special>;
+    </span><span class=keyword>struct </span><a href="#range_value"><span 
+class=identifier>range_value</span></a><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><a href="#range_reference"><span 
+class=identifier>range_reference</span></a><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><a href="#range_pointer"><span 
+class=identifier>range_pointer</span></a><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><a href="#range_category"><span 
+class=identifier>range_category</span></a><span class=special>;
+
     </span><span class=comment>//
     // Forward Range metafunctions
     //
@@ -89,10 +90,6 @@ class=identifier>range_const_iterator</span></a><span class=special>;
     </span><span class=keyword>struct </span><a href="#range_difference"><span 
 class=identifier>range_difference</span></a><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><a href="#range_size"><span 
-class=identifier>range_size</span></a><span class=special>;
-    
     </span><span class=comment>//
     // Bidirectional Range metafunctions
     //
@@ -101,56 +98,38 @@ class=identifier>range_size</span></a><span class=special>;
     </span><span class=keyword>struct </span><a 
 href="#range_reverse_iterator"><span
 class=identifier>range_reverse_iterator</span></a><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><a 
-href="#range_const_reverse_iterator"><span
-class=identifier>range_const_reverse_iterator</span></a><span class=special>;
     
-    </span><span class=comment>//
-    // Special metafunctions
-    //
-    
-    </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><a href="#range_result_iterator"><span 
-class=identifier>range_result_iterator</span></a><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><a 
-href="#range_reverse_result_iterator"><span
-class=identifier>range_reverse_result_iterator</span></a><span class=special>;
-
     </span><span class=comment>//
     // Single Pass Range functions
     //
     
     </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></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><a href="#begin"><span class=identifier>begin</span></a><span class=special>( </span><span class=identifier>T</span><span class=special>&amp; </span><span class=identifier>c </span><span class=special>);
+    </span><a href="#begin"><span class=identifier>begin</span></a><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=keyword></span><span class=keyword>typename </span><span class=identifier>range_const_iterator</span><span class=special>&lt;</span><span class=identifier>T</span><span class=special>&gt;::</span><span class=identifier>type
-    </span><a href="#begin"><span class=identifier>begin</span></a><span class=special>( </span><span class=keyword>const </span><span class=identifier>T</span><span class=special>&amp; </span><span class=identifier>c </span><span class=special>);
+    </span><span class=keyword></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><a href="#begin"><span class=identifier>begin</span></a><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></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><a href="#end"><span class=identifier>end</span></a><span class=special>( </span><span class=identifier>T</span><span class=special>&amp; </span><span class=identifier>c </span><span class=special>);
+    </span><a href="#end"><span class=identifier>end</span></a><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=keyword></span><span class=keyword>typename </span><span class=identifier>range_const_iterator</span><span class=special>&lt;</span><span class=identifier>T</span><span class=special>&gt;::</span><span class=identifier>type
-    </span><a href="#end"><span class=identifier>end</span></a><span class=special>( </span><span class=keyword>const </span><span class=identifier>T</span><span class=special>&amp; </span><span class=identifier>c </span><span class=special>);
+    </span><span class=keyword></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><a href="#end"><span class=identifier>end</span></a><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></span><span class=keyword>bool
-    </span><a href="#empty"><span class=identifier>empty</span></a><span class=special>( </span><span class=keyword>const </span><span class=identifier>T</span><span class=special>&amp; </span><span class=identifier>c </span><span class=special>);
+    </span><a href="#empty"><span class=identifier>empty</span></a><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>//
     // Forward Range functions
     //
     
     </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></span><span class=keyword>typename </span><span class=identifier>range_size</span><span class=special>&lt;</span><span class=identifier>T</span><span class=special>&gt;::</span><span class=identifier>type
-    </span><a href="#size"><span class=identifier>size</span></a><span class=special>( </span><span class=keyword>const </span><span class=identifier>T</span><span class=special>&amp; </span><span class=identifier>c </span><span class=special>);
+    </span><span class=keyword></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><a href="#size"><span class=identifier>distance</span></a><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>//
     // Bidirectional Range functions
@@ -158,546 +137,585 @@ class=identifier>range_reverse_result_iterator</span></a><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></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><a href="#rbegin"><span class=identifier>rbegin</span></a><span class=special>( </span><span class=identifier>T</span><span class=special>&amp; </span><span class=identifier>c </span><span class=special>);
+    </span><a href="#rbegin"><span class=identifier>rbegin</span></a><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=keyword></span><span class=keyword>typename </span><span class=identifier>range_const_reverse_iterator</span><span class=special>&lt;</span><span class=identifier>T</span><span class=special>&gt;::</span><span class=identifier>type
-    </span><a href="#rbegin"><span class=identifier>rbegin</span></a><span class=special>( </span><span class=keyword>const </span><span class=identifier>T</span><span class=special>&amp; </span><span class=identifier>c </span><span class=special>);
+    </span><span class=keyword></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><a href="#rbegin"><span class=identifier>rbegin</span></a><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></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><a href="#rend"><span class=identifier>rend</span></a><span class=special>( </span><span class=identifier>T</span><span class=special>&amp; </span><span class=identifier>c </span><span class=special>);
+    </span><a href="#rend"><span class=identifier>rend</span></a><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=keyword></span><span class=keyword>typename </span><span class=identifier>range_const_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=keyword></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><a href="#rend"><span class=identifier>rend</span></a><span class=special>( </span><span class=keyword>const </span><span 
-class=identifier>T</span><span class=special>&amp; </span><span class=identifier>c </span><span class=special>);
+class=identifier>T</span><span class=special>&amp; </span><span class=identifier>r </span><span class=special>);
     </span>
+    </span><span class=comment>//
+    // Random Access Range functions
+    //
+    
+    </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></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><a href="#size"><span class=identifier>size</span></a><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>//
     // Special const Range functions
     // 
     </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_const_iterator</span><span class=special>&lt;</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>
     <a href="#const_begin"><span class=identifier>const_begin</span></a><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_const_iterator</span><span class=special>&lt;</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>
     <a href="#const_end"><span class=identifier>const_end</span></a><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_const_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=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>
     <a href="#const_rbegin"><span class=identifier>const_rbegin</span></a><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_const_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=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>
     <a href="#const_rend"><span class=identifier>const_rend</span></a><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>//
+    // String utilities
+    //</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=identifier>see</span> <span class=identifier>below</span><span class=special>...&gt;</span> 
+    <span class=identifier><a href="#as_literal">as_literal</a></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=identifier>see</span> <span class=identifier>below</span><span class=special>...&gt;</span> 
+    <span class=identifier><a href="#as_array">as_literal</a></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><a href="#as_array">as_array</a></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><a href="#as_literal">as_array</a></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>
-		<P></P>
-		<a name="Semantics"></a>
-		<h3>Semantics</h3>
-		<h4>notation</h4>
-		<p>
-			<table cellpadding="5" border="1">
-				<tr>
-					<th>
-						Type
-						<th>
-							Object
-							<th>
-					Describes
-				</tr>
-				<tr>
-					<td><code>X</code>
-					<td><code>x</code>
-					<td>any type</td>
-				<tr>
-					<td><code>T</code>
-					</td>
-					<td><code>t</code>
-					<td>denotes behavior of the primary templates</td>
-				</tr>
-				<tr>
-					<td><code>P</code>
-					<td><code>p</code>
-					<td>denotes <code>std::pair&lt;iterator,iterator&gt;</code></td>
-				<tr>
-					<td><code>A[sz]</code>
-					<td><code>a</code>
-					<td>denotes an array of type <code>A</code> of size <code>sz</code>
-				<tr>
-				<tr>
-					<td><code>Char*</code>
-					<td><code>s</code>
-					<td>denotes either <code>char*</code> or <code>wchar_t*</code></td>
-				</tr>
-			</table>
-		</p>
-		<p>
-			Please notice in tables below that when four lines appear in a cell, the first 
-			line will describe the primary template, the second line pairs of iterators, 
-			the third line arrays and the last line null-terminated strings.
-		</p>
-		<h4>Metafunctions</h4>
-		<p>
-			<table border="1" cellpadding="5">
-				<tr>
-					<th>
-						Expression</th>
-					<th>
-						Return type</th>
-					<th>
-						Complexity</th>
-				</tr>
-				<tr>
-					<a name="range_value"></a>
-					<td><code>range_value&lt;X&gt;::type</code></td>
-					<td><code>T::value_type</code><br>
-						<code>boost::iterator_value&lt;P::first_type&gt;::type</code> <!--if <code>P</code> is an instantiation of <code>std::pair</code>--><br>
-						<code>A</code><br>
-						<code>Char</code>
-					<td>compile time</td>
-				</tr>
-				<tr>
-					<a name="range_iterator"></a>
-					<td><code>range_iterator&lt;X&gt;::type</code></td>
-					<td><code>T::iterator</code><br>
-						<code>P::first_type</code><br>
-						<code>A*</code><br>
-						<code>Char*</code>
-					<td>compile time</td>
-				</tr>
-				<tr>
-					<a name="range_const_iterator"></a>
-					<td><code>range_const_iterator&lt;X&gt;::type</code></td>
-					<td><code>T::const_iterator</code><br>
-						<code>P::first_type</code><br>
-						<code>const A*</code><br>
-						<code>const Char*</code>
-					<td>compile time</td>
-				</tr>
-				<tr>
-					<a name="range_difference"></a>
-					<td><code>range_difference&lt;X&gt;::type</code></td>
-					<td><code>T::difference_type</code><br>
-						<code>boost::iterator_difference&lt;P::first_type&gt;::type</code><br>
-						<code>std::ptrdiff_t</code><br>
-						<code>std::ptrdiff_t</code><br>
-					<td>compile time</td>
-				</tr>
-				<tr>
-					<a name="range_size"></a>
-					<td><code>range_size&lt;X&gt;::type</code></td>
-					<td><code>T::size_type</code><br>
-						<code>std::size_t</code><br>
-						<code>std::size_t</code><br>
-						<code>std::size_t</code><br>
-					<td>compile time</td>
-				</tr>
-				<tr>
-					<a name="range_result_iterator"></a>
-					<td><code>range_result_iterator&lt;X&gt;::type</code></td>
-					<td><code>range_const_iterator&lt;X&gt;::type</code> if <code>X</code> is <code>const</code>
-						<br>
-						<code>range_iterator&lt;X&gt;::type</code> otherwise
-					</td>
-					<td>compile time</td>
-				</tr>
-				<tr>
-					<a name="range_reverse_iterator"></a>
-					<td><code>range_reverse_iterator&lt;X&gt;::type</code></td>
-					<td><code>boost::reverse_iterator&lt; typename range_iterator&lt;T&gt;::type &gt;</code><br>
-					<td>compile time</td>
-				</tr>
-				<tr>
-					<a name="range_const_reverse_iterator"></a>
-					<td><code>range_const_reverse_iterator&lt;X&gt;::type</code></td>
-					<td><code>boost::reverse_iterator&lt; typename range_const_iterator&lt;T&gt;::type &gt;</code>
-						<br>
-					<td>compile time</td>
-				</tr>
-				<tr>
-					<a name="range_reverse_result_iterator"></a>
-					<td><code>range_reverse_result_iterator&lt;X&gt;::type</code></td>
-					<td><code>boost::reverse_iterator&lt; typename range_result_iterator&lt;T&gt;::type 
-							&gt;</code>
-					<td>compile time</td>
-				</tr>
-			</table>
-		</p>
-		<p>
-			The special metafunctions <code>range_result_iterator</code> and <code>range_reverse_result_iterator</code>
-			are not part of any Range concept, but they are very useful when implementing 
-			certain Range classes like <a href="utility_class.html#sub_range"><code>sub_range</code></a>
-			because of their ability to select iterators based on constness.
-		</p>
-		<h4>Functions</h4>
-		<p>
-			<table border="1" cellpadding="5">
-				<tr>
-					<th>
-						Expression</th>
-					<th>
-						Return type</th>
-					<th>
-						Returns</th>
-					<th>
-						Complexity</th>
-				</tr>
-				<tr>
-					<a name="begin"></a>
-					<td><code>begin(x)</code></td>
-					<td><code>range_result_iterator&lt;X&gt;::type</code></td>
-					<td>
-						<code>p.first</code> if <code>p</code> is of type <code>std::pair&ltT&gt;<code><br>
-						<code>a</code> if <code>a</code> is an array <br>
-						<code>s</code> if <code>s</code> is a string literal<br>
-						<code>boost_range_begin(x)</code> if that expression would invoke a function found by ADL <br>
-						<code>t.begin()</code> otherwise
+        <P></P>
+        <a name="Semantics"></a>
+        <h3>Semantics</h3>
+        <h4>notation</h4>
+        <p>
+            <table cellpadding="5" border="1">
+                <tr>
+                    <th>
+                        Type
+                        <th>
+                            Object
+                            <th>
+                    Describes
+                </tr>
+                <tr>
+                    <td><code>X</code>
+                    <td><code>x</code>
+                    <td>any type</td>
+                <tr>
+                    <td><code>T</code>
+                    </td>
+                    <td><code>t</code>
+                    <td>denotes behavior of the primary templates</td>
+                </tr>
+                <tr>
+                    <td><code>P</code>
+                    <td><code>p</code>
+                    <td>denotes <code>std::pair&lt;iterator,iterator&gt;</code></td>
+                <tr>
+                    <td><code>A[sz]</code>
+                    <td><code>a</code>
+                    <td>denotes an array of type <code>A</code> of size <code>sz</code>
+                <tr>
+                <tr>
+                    <td><code>Char*</code>
+                    <td><code>s</code>
+                    <td>denotes either <code>char*</code> or <code>wchar_t*</code></td>
+                </tr>
+            </table>
+        </p>
+        <p>
+            Please notice in tables below that when four lines appear in a cell, the first 
+            line will describe the primary template, the second line pairs of iterators, 
+            the third line arrays and the last line null-terminated strings.
+        </p>
+        <h4>Metafunctions</h4>
+        <p>
+            <table border="1" cellpadding="5">
+                <tr>
+                    <th>
+                        Expression</th>
+                    <th>
+                        Return type</th>
+                    <th>
+                        Complexity</th>
+                </tr>
+                <tr>
+                    <a name="range_iterator"></a>
+                    <td><code>range_iterator&lt;X&gt;::type</code></td>
+                    <td><code>T::iterator</code><br>
+                        <code>P::first_type</code><br>
+                        <code>A*</code><br>
+
+                    <td>compile time</td>
+                </tr>
+                <tr>
+                    <a name="range_const_iterator"></a>
+                    <td><code>range_iterator&lt;const X&gt;::type</code></td>
+                    <td><code>T::const_iterator</code><br>
+                        <code>P::first_type</code><br>
+                        <code>const A*</code><br>
+
+                    <td>compile time</td>
+                </tr>
+                <tr>
+                    <a name="range_value"></a>
+                    <td><code>range_value&lt;X&gt;::type</code></td>
+                    <td><code>boost::iterator_value&lt;range_iterator&lt;X&gt;::type&gt;::type</code>
+                     </td>  
+                    <td>compile time</td>
+                </tr>
+                <tr>
+                    <a name="range_reference"></a>
+                    <td><code>range_reference&lt;X&gt;::type</code></td>
+                    <td><code>boost::iterator_reference&lt;range_iterator&lt;X&gt;::type&gt;::type</code>
+                     </td>  
+                    <td>compile time</td>
+                </tr>
+
+                                <tr>
+                    <a name="range_pointer"></a>
+                    <td><code>range_pointer&lt;X&gt;::type</code></td>
+                    <td><code>boost::iterator_pointer&lt;range_iterator&lt;X&gt;::type&gt;::type</code>
+                     </td>  
+                    <td>compile time</td>
+                </tr>
+                
+                                <tr>
+                    <a name="range_category"></a>
+                    <td><code>range_category&lt;X&gt;::type</code></td>
+                    <td><code>boost::iterator_category&lt;range_iterator&lt;X&gt;::type&gt;::type</code>
+                     </td>  
+                    <td>compile time</td>
+                </tr>
+                <tr>
+                    <a name="range_difference"></a>
+                    <td><code>range_difference&lt;X&gt;::type</code></td>
+                    <td>
+                        <code>boost::iterator_difference&lt;range_iterator&lt;X&gt;::type&gt;::type</code></td>
+                        
+                    <td>compile time</td>
+                </tr>
+                </tr>
+
+                <tr>
+                    <a name="range_reverse_iterator"></a>
+                    <td><code>range_reverse_iterator&lt;X&gt;::type</code></td>
+                    <td><code>boost::reverse_iterator&lt;range_iterator&lt;X&gt;::type&gt;</code><br>
+                    <td>compile time</td>
+                </tr>
+                <tr>
+                    <a name="range_const_reverse_iterator"></a>
+                    <td><code>range_reverse_iterator&lt;const X&gt;::type</code></td>
+                    <td><code>boost::reverse_iterator&lt;range_iterator&lt;const X&gt;::type&gt;</code>
+                        <br>
+                    <td>compile time</td>
+                </tr>
+            </table>
+        </p>
+        <h4>Functions</h4>
+        <p>
+            <table border="1" cellpadding="5">
+                <tr>
+                    <th>
+                        Expression</th>
+                    <th>
+                        Return type</th>
+                    <th>
+                        Returns</th>
+                    <th>
+                        Complexity</th>
+                </tr>
+                <tr>
+                    <a name="begin"></a>
+                    <td><code>begin(x)</code></td>
+                    <td><code>range_iterator&lt;X&gt;::type</code></td>
+                    <td>
+                        <code>p.first</code> if <code>p</code> is of type <code>std::pair&ltT&gt;<code><br>
+                        <code>a</code> if <code>a</code> is an array <br>
+                        <code>range_begin(x)</code> if that expression would invoke a function found by ADL <br>
+                        <code>t.begin()</code> otherwise
    
-					<td>constant time</td>
-				</tr>
-				<tr>
-					<a name="end"></a>
-					<td><code>end(x)</code></td>
-					<td><code>range_result_iterator&lt;X&gt;::type</code></td>
-					<td>
-						<code>p.second</code> if <code>p</code> is of type <code>std::pair&ltT&gt;<code><br>
-						<code>a + sz</code> if <code>a</code> is an array of size <code>sz</code><br>
-						<code>s + std::char_traits&lt;X&gt;::length( s )</code> if <code>s</code> is a <code>Char*</code>
-						<br>
-						<code>s + sz - 1</code> if <code>s</code> is a string literal of size <code>sz</code>
-						<br>
-					    <code>boost_range_end(x)</code> if that expression would invoke a function found by ADL <br>
-						<code>t.end()</code> otherwise
-						
-					<td>linear if <code>X</code> is <code>Char*</code>
-						<br>
-						constant time otherwise</td>
-				</tr>
-				<tr>
-					<a name="empty"></a>
-					<td><code>empty(x)</code></td>
-					<td><code>bool</code></td>
-					<td><code>begin(x) == end( x )</code><br>
-					<td>linear if <code>X</code> is <code>Char*</code>
-						<br>
-						constant time otherwise<br>
-					</td>
-				</tr>
-				<tr>
-					<a name="size"></a>
-					<td><code>size(x)</code></td>
-					<td><code>range_size&lt;X&gt;::type</code></td>
-					<td>
-						<code>std::distance(p.first,p.second)</code> if <code>p</code> is of type <code>std::pair&ltT&gt;<code><br>
-						<code>sz</code> if <code>a</code> is an array of size <code>sz</code><br>
-						<code>end(s) - s</code> if <code>s</code> is a string literal or a <code>Char*</code><br>
-						<code>boost_range_size(x)</code> if that expression would invoke a function found by ADL <br>
-						<code>t.size()</code> otherwise
-					<td>linear if <code>X</code> is <code>Char*</code>
-						<br>
-						or if <code>std::distance()</code> is linear
-						<br>
-						constant time otherwise</td>
-				</tr>
-				<tr>
-					<a name="rbegin"></a>
-					<td><code>rbegin(x)</code></td>
-					<td><code>range_reverse_result_iterator&lt;X&gt;::type</code></td>
-					<td><code>range_reverse_result_iterator&lt;X&gt;::type( end(x) )</code>
-						<br>
-					<td>same as <code>end(x)</code>
-					</td>
-				</tr>
-				<tr>
-					<a name="rend"></a>
-					<td><code>rend(x)</code></td>
-					<td><code>range_reverse_result_iterator&lt;X&gt;::type</code></td>
-					<td><code>range_reverse_result_iterator&lt;X&gt;::type( begin(x) )</code>
-					<td>same as <code>begin(x)</code></td>
-				</tr>
-				<tr>
-					<a name="const_begin"></a>
-					<td><code>const_begin(x)</code></td>
-					<td><code>range_const_iterator&lt;X&gt;::type</code></td>
-					<td><code>range_const_iterator&lt;X&gt;::type( begin(x) )</code>
-						<br>
-					<td>same as <code>begin(x)</code>
-					</td>
-				</tr>
-				<tr>
-					<a name="const_end"></a>
-					<td><code>const_end(x)</code></td>
-					<td><code>range_const_iterator&lt;X&gt;::type</code></td>
-					<td><code>range_const_iterator&lt;X&gt;::type( end(x) )</code>
-					<td>same as <code>end(x)</code></td>
-				</tr>
-				<tr>
-					<a name="const_rbegin"></a>
-					<td><code>const_rbegin(x)</code></td>
-					<td><code>range_const_reverse_iterator&lt;X&gt;::type</code></td>
-					<td><code>range_const_reverse_iterator&lt;X&gt;::type( rbegin(x) )</code>
-						<br>
-					<td>same as <code>rbegin(x)</code>
-					</td>
-				</tr>
-				<tr>
-					<a name="const_rend"></a>
-					<td><code>const_rend(x)</code></td>
-					<td><code>range_const_reverse_iterator&lt;X&gt;::type</code></td>
-					<td><code>range_const_reverse_iterator&lt;X&gt;::type( rend(x) )</code>
-					<td>same as <code>rend(x)</code></td>
-				</tr>
-			</table>
-		</p>
-		<p>
-			The special <code>const</code> functions are not part of any Range concept, but 
-			are very useful when you want to document clearly that your code is read-only.
-		</p>
-		<hr>
-		<a name="minimal_interface"></a>
-		<h3>Extending the library</h3>
-		<ul>
-		<li><a href="#method1">Method 1: provide member functions and nested types</a></li>
-    	<li><a href="#method2">Method 2: provide free-standing functions and specialize metafunctions</a></li>
-		</ul>
+                    <td>constant time</td>
+                </tr>
+                <tr>
+                    <a name="end"></a>
+                    <td><code>end(x)</code></td>
+                    <td><code>range_iterator&lt;X&gt;::type</code></td>
+                    <td>
+                        <code>p.second</code> if <code>p</code> is of type <code>std::pair&ltT&gt;<code><br>
+                        <code>a + sz</code> if <code>a</code> is an array of size <code>sz</code>
+                        
+                        <br>
+                        <code>range_end(x)</code> if that expression would invoke a function found by ADL <br>
+                        <code>t.end()</code> otherwise
+                        
+                    <td>
+                        constant time </td>
+                </tr>
+                <tr>
+                    <a name="empty"></a>
+                    <td><code>empty(x)</code></td>
+                    <td><code>bool</code></td>
+                    <td><code>boost::begin(x) == boost::end(x)</code><br>
+                    <td> constant time <br>
+                    </td>
+                </tr>
+                <tr>
+                    <a name="distance"></a>
+                    <td><code>distance(x)</code></td>
+                    <td><code>range_difference&lt;X&gt;::type</code></td>
+                    <td>
+                        <code>
+                            std::distance(boost::begin(x),boost::end(x))
+                        </code>
+                         </td>
+                    <td>-</td>     
 
-		<!--<b>Warning:</b><i> If possible, then prefer method 1 if you want to be absolutely sure your code is forward compatible. 
-					   </i>-->
+                </tr>
 
-		<a name="method1"></a>
-		<h4>Method 1: provide member functions and nested types</h4>
-		
-		<p>
-		This procedure assumes that you have control over the types that should be made
-		conformant to a Range concept. If not, see <a href="#method2">method 2</a>.
-		</p>
-		
-		<p>
-			The primary templates in this library are implemented such that standard 
-			containers will work automatically and so will <code>boost::<a href="../../array/index.html">array</a></code>. 
-			Below is given an overview of which member functions and member types a class 
-			must specify to be useable as a certain Range concept.
-		</p>
-		<p>
-			<table cellpadding="5" border="1">
-				<tr>
-					<th>
-						Member function</th>
-					<th>
-						Related concept</th>
-				<tr>
-					<td><code>begin()</code></td>
-					<td><a href="range.html#single_pass_range">Single Pass Range</a></td>
-				</tr>
-				<tr>
-					<td><code>end()</code>
-					</td>
-					<td><a href="range.html#single_pass_range">Single Pass Range</a></td>
-				</tr>
-				<tr>
-					<td><code>size()</code></td>
-					<td><a href="range.html#forward_range">Forward Range</a></td>
-				</tr>
-			</table>
-		</p>
-		<p>
-			Notice that <code>rbegin()</code> and <code>rend()</code> member functions are 
-			not needed even though the container can support bidirectional iteration.
-		</p>
-		<p>
-			The required member types are:
-		</p>
-		<p>
-			<table cellpadding="5" border="1">
-				<tr>
-					<th>
-						Member type</th>
-					<th>
-						Related concept</th>
-				<tr>
-				<tr>
-					<td><code>iterator</code></td>
-					<td><a href="range.html#single_pass_range">Single Pass Range</a></td>
-				</tr>
-				<tr>
-					<td><code>const_iterator</code></td>
-					<td><a href="range.html#single_pass_range">Single Pass Range</a></td>
-				</tr>
-				<tr>
-					<td><code>size_type</code></td>
-					<td><a href="range.html#forward_range">Forward Range</a></td>
-				</tr>
-			</table>
-		</p>
-		<p>
-			Again one should notice that member types <code>reverse_iterator</code> and <code>const_reverse_iterator</code>
-			are not needed.
-		</p>
-		<a name="method2"></a>
-    	<h4>Method 2: provide free-standing functions and specialize metafunctions</h4>
+                <tr>
+                    <a name="size"></a>
+                    <td><code>size(x)</code></td>
+                    <td><code>range_difference&lt;X&gt;::type</code></td>
+                    <td><code> boost::end(x) - boost::begin(x)</code>
+                        
+                    <td>          constant time </td>
+                </tr>
+                <tr>
+                    <a name="rbegin"></a>
+                    <td><code>rbegin(x)</code></td>
+                    <td><code>range_reverse_iterator&lt;X&gt;::type</code></td>
+                    <td><code>range_reverse_iterator&lt;X&gt;::type( boost::end(x) )</code>
+                        <br>
+                    <td>constant time
+                    </td>
+                </tr>
+                <tr>
+                    <a name="rend"></a>
+                    <td><code>rend(x)</code></td>
+                    <td><code>range_reverse_iterator&lt;X&gt;::type</code></td>
+                    <td><code>range_reverse_iterator&lt;X&gt;::type( boost::begin(x) )</code>
+                    <td>constant time</td>
+                </tr>
+                <tr>
+                    <a name="const_begin"></a>
+                    <td><code>const_begin(x)</code></td>
+                    <td><code>range_iterator&lt;const X&gt;::type</code></td>
+                    <td><code>range_iterator&lt;const X&gt;::type( boost::begin(x) )</code>
+                        <br>
+                    <td>constant time
+                    </td>
+                </tr>
+                <tr>
+                    <a name="const_end"></a>
+                    <td><code>const_end(x)</code></td>
+                    <td><code>range_iterator&lt;const X&gt;::type</code></td>
+                    <td><code>range_iterator&lt;const X&gt;::type( boost::end(x) )</code>
+                    <td>constant time</td>
+                </tr>
+                <tr>
+                    <a name="const_rbegin"></a>
+                    <td><code>const_rbegin(x)</code></td>
+                    <td><code>range_reverse_iterator&lt;const X&gt;::type</code></td>
+                    <td><code>range_reverse_iterator&lt;const X&gt;::type( boost::rbegin(x) )</code>
+                        <br>
+                    <td>constant time
+                    </td>
+                </tr>
+                <tr>
+                    <a name="const_rend"></a>
+                    <td><code>const_rend(x)</code></td>
+                    <td><code>range_reverse_iterator&lt;const X&gt;::type</code></td>
+                    <td><code>range_reverse_iterator&lt;const X&gt;::type( boost::rend(x) )</code>                    
+        
+                    <td>constant time</td>
+                </tr>
+                 <tr>
+                    <a name="as_literal"></a>
+                    <td><code>as_literal(x)</code></td>
+                     <td><code>iterator_range&lt;U></code> where <code>U</code> is 
+                        <code>Char*</code> if <code>x</code> is a pointer to a 
+                        string and <code>U</code> is
+                        <code>range_iterator&lt;X>::type</code> otherwise
+                        </td>
+                     <td>
+                         
+                        <code>[a,a+sz-1)</code> if <code>a</code> is an array of size <code>sz</code><br>
+                            <code>[s,s + std::char_traits&lt;X&gt;::length(s))</code> if <code>s</code> is a <code>Char*</code>
+                                <br>
+                                    <code>[boost::begin(x),boost::end(x))</code> otherwise
 
-		<p>
-		This procedure assumes that you cannot (or do not wish to) change the types that should be made
-		conformant to a Range concept. If this is not true, see <a href="#method1">method 1</a>.
-		</p>
-		
-		<p>
-			The primary templates in this library are implemented such that
-			certain functions are found via argument-dependent-lookup (ADL).
-			Below is given an overview of which free-standing functions a class 
-			must specify to be useable as a certain Range concept.
-			Let <code>x</code> be a variable (<code>const</code> or mutable)
-			of the class in question.
-		</p>
-		<p>
-			<table cellpadding="5" border="1" ID="Table1">
-				<tr>
-					<th>
-						Function</th>
-					<th>
-						Related concept</th>
-				<tr>
-					<td><code>boost_range_begin(x)</code></td>
-					<td><a href="range.html#single_pass_range">Single Pass Range</a></td>
-				</tr>
-				<tr>
-					<td><code>boost_range_end(x)</code>
-					</td>
-					<td><a href="range.html#single_pass_range">Single Pass Range</a></td>
-				</tr>
-				<tr>
-					<td><code>boost_range_size(x)</code></td>
-					<td><a href="range.html#forward_range">Forward Range</a></td>
-				</tr>
-			</table>		
-		</p>
-		<p><code>boost_range_begin()</code> and <code>boost_range_end()</code> must be
-		overloaded for both <code>const</code> and mutable reference arguments.
-		</p>
-		
-		<p>
-		You must also specialize 3 metafunctions for your type <code>X</code>:
-		</p>
-		<p>
-			<table cellpadding="5" border="1" ID="Table2">
-				<tr>
-					<th>
-						Metafunction</th>
-					<th>
-						Related concept</th>
-				<tr>
-					<td><code>boost::range_iterator</code></td>
-					<td><a href="range.html#single_pass_range">Single Pass Range</a></td>
-				</tr>
-				<tr>
-					<td><code>boost::range_const_iterator</code></td>
-					<td><a href="range.html#single_pass_range">Single Pass Range</a></td>
-				</tr>
-				<tr>
-					<td><code>boost::range_size</code></td>
-					<td><a href="range.html#forward_range">Forward Range</a></td>
-				</tr>
-			</table>
-		</p>
-		<p>
-		A complete example is given here:
-		</p>
-		<blockquote>
-		<pre>
+
+                         
+                         </td>   
+                    <td>linear time for pointers to a string, constant time 
+                        otherwise</td>
+                </tr>
+                 <tr>
+                    <a name="as_array"></a>
+                    <td><code>as_array(x)</code></td>
+                     <td><code>iterator_range&lt;X></code>                       </td>
+                     <td>
+                                  <code>[boost::begin(x),boost::end(x))</code> 
+                                    
+
+
+                         
+                         </td>   
+                    <td>constant time otherwise</td>
+                </tr>
+
+            </table>
+        </p>
+        <p>
+            The special <code>const_</code>-named functions are useful when you 
+            want to document clearly that your code is read-only.
+        </p>
+            <p>
+                <code>as_literal()</code> can be used <i>internally</i> in string 
+                algorithm librararies to such that arrays of characters are 
+                handled correctly.
+                </p>
+            <p>
+                <code>as_array()</code> can be used with string algorithm libraries to make it clear that arrays of characters are handled like an array and not like a string. 
+                </p>    
+            <p>Notice that the above functions should always be called with 
+                qualification (<code>boost::</code>) to prevent <i>unintended</i> 
+                Argument Dependent Lookup (ADL).
+                </p>
+        <hr>
+        <a name="minimal_interface"></a>
+        <h3>Extending the library</h3>
+        <ul>
+        <li><a href="#method1">Method 1: provide member functions and nested types</a></li>
+            
+        <li><a href="#method2">Method 2: provide free-standing functions and specialize metafunctions</a></li>
+        </ul>
+
+        <!--<b>Warning:</b><i> If possible, then prefer method 1 if you want to be absolutely sure your code is forward compatible. 
+                       </i>-->
+
+        <a name="method1"></a>
+        <h4>Method 1: provide member functions and nested types</h4>
+        
+        <p>
+        This procedure assumes that you have control over the types that should be made
+        conformant to a Range concept. If not, see <a href="#method2">method 2</a>.
+        </p>
+        
+        <p>
+            The primary templates in this library are implemented such that standard 
+            containers will work automatically and so will <code>boost::<a href="../../array/index.html">array</a></code>. 
+            Below is given an overview of which member functions and member types a class 
+            must specify to be useable as a certain Range concept.
+        </p>
+        <p>
+            <table cellpadding="5" border="1">
+                <tr>
+                    <th>
+                        Member function</th>
+                    <th>
+                        Related concept</th>
+                <tr>
+                    <td><code>begin()</code></td>
+                    <td><a href="range.html#single_pass_range">Single Pass Range</a></td>
+                </tr>
+                <tr>
+                    <td><code>end()</code>
+                    </td>
+                    <td><a href="range.html#single_pass_range">Single Pass Range</a></td>
+                </tr>
+            </table>
+        </p>
+        <p>
+            Notice that <code>rbegin()</code> and <code>rend()</code> member functions are 
+            not needed even though the container can support bidirectional iteration.
+        </p>
+        <p>
+            The required member types are:
+        </p>
+        <p>
+            <table cellpadding="5" border="1">
+                <tr>
+                    <th>
+                        Member type</th>
+                    <th>
+                        Related concept</th>
+                <tr>
+                <tr>
+                    <td><code>iterator</code></td>
+                    <td><a href="range.html#single_pass_range">Single Pass Range</a></td>
+                </tr>
+                <tr>
+                    <td><code>const_iterator</code></td>
+                    <td><a href="range.html#single_pass_range">Single Pass Range</a></td>
+                </tr>
+            </table>
+        </p>
+        <p>
+            Again one should notice that member types <code>reverse_iterator</code> and <code>const_reverse_iterator</code>
+            are not needed.
+        </p>
+        <a name="method2"></a>
+        <h4>Method 2: provide free-standing functions and specialize metafunctions</h4>
+
+        <p>
+        This procedure assumes that you cannot (or do not wish to) change the types that should be made
+        conformant to a Range concept. If this is not true, see <a href="#method1">method 1</a>.
+        </p>
+        
+        <p>
+            The primary templates in this library are implemented such that
+            certain functions are found via argument-dependent-lookup (ADL).
+            Below is given an overview of which free-standing functions a class 
+            must specify to be useable as a certain Range concept.
+            Let <code>x</code> be a variable (<code>const</code> or mutable)
+            of the class in question.
+        </p>
+        <p>
+            <table cellpadding="5" border="1" ID="Table1">
+                <tr>
+                    <th>
+                        Function</th>
+                    <th>
+                        Related concept</th>
+                <tr>
+                    <td><code>range_begin(x)</code></td>
+                    <td><a href="range.html#single_pass_range">Single Pass Range</a></td>
+                </tr>
+                <tr>
+                    <td><code>range_end(x)</code>
+                    </td>
+                    <td><a href="range.html#single_pass_range">Single Pass Range</a></td>
+                </tr>
+
+            </table>        
+        </p>
+        <p><code>range_begin()</code> and <code>range_end()</code> must be
+        overloaded for both <code>const</code> and mutable reference arguments.
+        </p>
+        
+        <p>
+        You must also specialize two metafunctions for your type <code>X</code>:
+        </p>
+        <p>
+            <table cellpadding="5" border="1" ID="Table2">
+                <tr>
+                    <th>
+                        Metafunction</th>
+                    <th>
+                        Related concept</th>
+                <tr>
+                    <td><code>boost::range_mutable_iterator</code></td>
+                    <td><a href="range.html#single_pass_range">Single Pass Range</a></td>
+                </tr>
+                <tr>
+                    <td><code>boost::range_const_iterator</code></td>
+                    <td><a href="range.html#single_pass_range">Single Pass Range</a></td>
+                </tr>
+
+            </table>
+        </p>
+        <p>
+        A complete example is given here:
+        </p>
+        <blockquote>
+        <pre>
 <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=keyword>namespace</span> <span class=identifier>Foo</span>
 <span class=special>{</span>
-	<span class=comment>//
-	// Our sample UDT. A 'Pair'
-	// will work as a range when the stored
-	// elements are iterators.
-	//</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=comment>//
+    // Our sample UDT. A 'Pair'
+    // will work as a range when the stored
+    // elements are iterators.
+    //</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=keyword>namespace</span> <span class=identifier>boost</span>
 <span class=special>{</span>
-	<span class=comment>//
-	// Specialize metafunctions. We must include the range.hpp header.
-	// We must open the 'boost' namespace.
-	//</span>
+    <span class=comment>//
+    // Specialize metafunctions. We must include the range.hpp header.
+    // We must open the 'boost' namespace.
+    //</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>&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=keyword>typedef</span> <span class=identifier>T</span> <span class=identifier>type</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>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>
+        <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=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>//
-		// Remark: this is defined similar to 'range_iterator'
-		//         because the 'Pair' type does not distinguish
-		//         between an iterator and a const_iterator.
-		//</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=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_size</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=keyword>typedef</span> <span class=identifier>std</span><span class=special>::</span><span class=identifier>size_t</span> <span class=identifier>type</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>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>//
+        // Remark: this is defined similar to 'range_mutable_iterator'
+        //         because the 'Pair' type does not distinguish
+        //         between an iterator and a const_iterator.
+        //</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=keyword>namespace</span> <span class=identifier>Foo</span>
 <span class=special>{</span>
-	<span class=comment>//
-	// The required functions. These should be defined in
-	// the same namespace as 'Pair', in this case 
-	// in namespace 'Foo'.
-	//</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>boost_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> 
-		<span class=keyword>return</span> <span class=identifier>x</span><span class=special>.</span><span class=identifier>first</span><span class=special>;</span>
-	<span class=special>}</span>
+    <span class=comment>//
+    // The required functions. These should be defined in
+    // the same namespace as 'Pair', in this case 
+    // in namespace 'Foo'.
+    //</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> 
+        <span class=keyword>return</span> <span class=identifier>x</span><span class=special>.</span><span class=identifier>first</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>T</span> <span class=special>&gt;</span>
-	<span class=keyword>inline</span> <span class=identifier>T</span> <span class=identifier>boost_range_begin</span><span class=special>(</span> <span class=keyword>const</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> 
-		<span class=keyword>return</span> <span class=identifier>x</span><span class=special>.</span><span class=identifier>first</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>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=keyword>const</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> 
+        <span class=keyword>return</span> <span class=identifier>x</span><span class=special>.</span><span class=identifier>first</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>T</span> <span class=special>&gt;</span>
-	<span class=keyword>inline</span> <span class=identifier>T</span> <span class=identifier>boost_range_end</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> 
-		<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=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_end</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> 
+        <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=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>boost_range_end</span><span class=special>(</span> <span class=keyword>const</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> 
-		<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=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=keyword>typename</span> <span class=identifier>boost</span><span class=special>::</span><span class=identifier>range_size</span><span class=special>&lt;</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=identifier>type</span>
-	<span class=identifier>boost_range_size</span><span class=special>(</span> <span class=keyword>const</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>
-		<span class=keyword>return</span> <span class=identifier>std</span><span class=special>::</span><span class=identifier>distance</span><span class=special>(</span><span class=identifier>x</span><span class=special>.</span><span class=identifier>first</span><span class=special>,</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=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_end</span><span class=special>(</span> <span class=keyword>const</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> 
+        <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>
 
@@ -705,41 +723,41 @@ class=identifier>T</span><span class=special>&amp; </span><span class=identifier
 
 <span class=keyword>int</span> <span class=identifier>main</span><span class=special>()</span>
 <span class=special>{</span>
-	<span class=keyword>typedef</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>iter</span><span class=special>;</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>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>//
-	// Notice that we call 'begin' etc with qualification. 
-	//</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>
-	<span class=identifier>boost</span><span class=special>::</span><span class=identifier>range_size</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>iter</span><span class=special>&gt;</span> <span class=special>&gt;::</span><span class=identifier>type</span> <span class=identifier>s</span> <span class=special>=</span> <span class=identifier>boost</span><span class=special>::</span><span class=identifier>size</span><span class=special>(</span> <span class=identifier>pair</span> <span class=special>);</span>
-	<span class=identifier>s</span>      <span class=special>=</span> <span class=identifier>boost</span><span class=special>::</span><span class=identifier>size</span><span class=special>(</span> <span class=identifier>cpair</span> <span class=special>);</span>
-	<span class=identifier>boost</span><span class=special>::</span><span class=identifier>range_const_reverse_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>iter</span><span class=special>&gt;</span> <span class=special>&gt;::</span><span class=identifier>type</span>
-	<span class=identifier>ri</span>     <span class=special>=</span> <span class=identifier>boost</span><span class=special>::</span><span class=identifier>rbegin</span><span class=special>(</span> <span class=identifier>cpair</span> <span class=special>),</span>
-	<span class=identifier>re</span>     <span class=special>=</span> <span class=identifier>boost</span><span class=special>::</span><span class=identifier>rend</span><span class=special>(</span> <span class=identifier>cpair</span> <span class=special>);</span>
-<span class=special>}</span>	
+    <span class=keyword>typedef</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>iter</span><span class=special>;</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>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>//
+    // Notice that we call 'begin' etc with qualification. 
+    //</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>
+    <span class=identifier>boost</span><span class=special>::</span><span class=identifier>range_difference</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>iter</span><span class=special>&gt;</span> <span class=special>&gt;::</span><span class=identifier>type</span> <span class=identifier>s</span> <span class=special>=</span> <span class=identifier>boost</span><span class=special>::</span><span class=identifier>size</span><span class=special>(</span> <span class=identifier>pair</span> <span class=special>);</span>
+    <span class=identifier>s</span>      <span class=special>=</span> <span class=identifier>boost</span><span class=special>::</span><span class=identifier>size</span><span class=special>(</span> <span class=identifier>cpair</span> <span class=special>);</span>
+    <span class=identifier>boost</span><span class=special>::</span><span class=identifier>range_reverse_iterator</span><span class=special>&lt;</span> <span class=identifier>const 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=special>&gt;::</span><span class=identifier>type</span>
+    <span class=identifier>ri</span>     <span class=special>=</span> <span class=identifier>boost</span><span class=special>::</span><span class=identifier>rbegin</span><span class=special>(</span> <span class=identifier>cpair</span> <span class=special>),</span>
+    <span class=identifier>re</span>     <span class=special>=</span> <span class=identifier>boost</span><span class=special>::</span><span class=identifier>rend</span><span class=special>(</span> <span class=identifier>cpair</span> <span class=special>);</span>
+<span class=special>}</span>    
 </pre>
 </blockquote>
-		
-		<hr>
-		<p>
-			(C) Copyright Thorsten Ottosen 2003-2004. Use, modification and distribution is subject to the Boost Software License, Version 1.0.
-		</p>
-		<br>
-		<br>
-		<br>
-		<br>
-		<br>
-		<br>
-		<br>
-		<br>
-		<br>
-		<br>
-		<br>
-		<br>
-	</body>
+        
+        <hr>
+        <p>
+            (C) Copyright Thorsten Ottosen 2003-2007
+        </p>
+        <br>
+        <br>
+        <br>
+        <br>
+        <br>
+        <br>
+        <br>
+        <br>
+        <br>
+        <br>
+        <br>
+        <br>
+    </body>
 </html>
diff --git a/doc/boost_range.qbk b/doc/boost_range.qbk
new file mode 100644
index 0000000..80b5c8c
--- /dev/null
+++ b/doc/boost_range.qbk
@@ -0,0 +1,1234 @@
+[article Boost.Range Documentation
+    [quickbook 1.3]
+    [id boost.range]
+    [copyright 2003-2007 Thorsten Ottosen]
+    [license
+        Distributed under the Boost Software License, Version 1.0.
+        (See accompanying file LICENSE_1_0.txt or copy at
+        [@http://www.boost.org/LICENSE_1_0.txt])
+    ]
+]
+
+[/ Converted to Quickbook format by Darren Garvey, 2007]
+
+[def __ranges__                 [link boost.range.concepts Ranges]]
+[def __range_concepts__         [link boost.range.concepts Range concepts]]
+[def __forward_range__          [link boost.range.concepts.forward_range Forward Range]]
+[def __single_pass_range__      [link boost.range.concepts.single_pass_range Single Pass Range]]
+[def __bidirectional_range__    [link boost.range.concepts.bidirectional_range Bidirectional Range]]
+[def __random_access_range__    [link boost.range.concepts.random_access_range Random Access Range]]
+
+[def __iterator_range__         [link boost.range.utilities.iterator_range `iterator_range`]]
+[def __sub_range__              [link boost.range.utilities.sub_range `sub_range`]]
+[def __minimal_interface__      [link boost.range.reference.extending minimal interface]]
+[def __range_result_iterator__  [link boost.range.reference.semantics.metafunctions `range_result_iterator`]]
+[def __implementation_of_metafunctions__ [link boost.range.reference.semantics.metafunctions implementation of metafunctions]]
+[def __implementation_of_functions__     [link boost.range.reference.semantics.functions implementation of functions]]
+
+[def __single_pass_iterator__   [@../../libs/iterator/doc/new-iter-concepts.html#singls-pass-iterators-lib-single-pass-iterators Single Pass Iterator]]
+[def __forward_traversal_iterator__ [@../../libs/iterator/doc/new-iter-concepts.html#forward-traversal-iterators-lib-forward-traversal-iterators Forward Traversal Iterator]]
+[def __bidirectional_traversal_iterator__ [@../../libs/iterator/doc/new-iter-concepts.html#bidirectional-traversal-iterators-lib-bidirectional-traversal-iterators Bidirectional Traversal Iterator]]
+[def __random_access_traversal_iterator__ [@../../libs/iterator/doc/new-iter-concepts.html#random-access-traversal-iterators-lib-random-access-traversal-iterators Random Access Traversal Iterator]]
+[def __new_style_iterators__    [@../../libs/iterator/doc/new-iter-concepts.html new style iterators]]
+[def __iterator_concepts__      [@../../libs/iterator/doc/iterator_concepts.html Iterator concepts]]
+
+[def __container__              [@http://www.sgi.com/Technology/STL/Container.html Container]]
+[def __metafunctions__          [@../../libs/mpl/doc/refmanual/metafunction.html metafunctions]]
+[def __concept_check__          [@../../libs/concept_check/index.html Boost Concept Check library]]
+[def __boost_array__            [@../../libs/array/index.html boost::array]]
+[def __the_forwarding_problem__ [@http://std.dkuug.dk/jtc1/sc22/wg21/docs/papers/2002/n1385.htm The Forwarding Problem]]
+
+
+Boost.Range is a collection of concepts and utilities that are particularly useful for specifying and implementing generic algorithms.
+
+
+[section Introduction]
+
+Generic algorithms have so far been specified in terms of two or more iterators. Two iterators would together form a range of values that the algorithm could work on. This leads to a very general interface, but also to a somewhat clumsy use of the algorithms with redundant specification of container names. Therefore we would like to raise the abstraction level for algorithms so they specify their interface in terms of __ranges__ as much as possible.
+
+The most common form of ranges we are used to work with is standard library containers. However, one often finds it desirable to extend that code to work with other types that offer enough functionality to satisfy the needs of the generic code if a suitable layer of indirection is applied . For example, raw arrays are often suitable for use with generic code that works with containers, provided a suitable adapter is used. Likewise, null terminated strings can be treated as containers of characters, if suitably adapted.
+
+This library therefore provides the means to adapt standard-like containers, null terminated strings, `std::pairs` of iterators, and raw arrays (and more), such that the same generic code can work with them all. The basic idea is to add another layer of indirection using __metafunctions__ and free-standing functions so syntactic and/or semantic differences can be removed.
+
+The main advantages are
+
+* simpler implementation and specification of generic range algorithms
+* more flexible, compact and maintainable client code
+* correct handling of null-terminated strings
+
+[:[*Warning: support for null-terminated strings is deprecated and will disappear in the next Boost release (1.34).]]
+
+* safe use of built-in arrays (for legacy code; why else would you use built-in arrays?)
+
+Below are given a small example (the complete example can be found [@http://www.boost.org/libs/range/test/algorithm_example.cpp here] ):
+
+``
+        //
+        // example: extracting bounds in a generic algorithm
+        //
+        template< class ForwardReadableRange, class T >
+        inline typename boost::range_iterator< ForwardReadableRange >::type
+        find( ForwardReadableRange& c, const T& value )
+        {
+           return std::find( boost::begin( c ), boost::end( c ), value );
+        }
+
+        template< class ForwardReadableRange, class T >
+        inline typename boost::range_const_iterator< ForwardReadableRange >::type
+        find( const ForwardReadableRange& c, const T& value )
+        {
+           return std::find( boost::begin( c ), boost::end( c ), value );
+        }
+
+        //
+        // replace first value and return its index
+        //
+        template< class ForwardReadableWriteableRange, class T >
+        inline typename boost::range_size< ForwardReadableWriteableRange >::type
+        my_generic_replace( ForwardReadableWriteableRange& c, const T& value, const T& replacement )
+        {
+           typename boost::range_iterator< ForwardReadableWriteableRange >::type found = find( c, value );
+
+           if( found != boost::end( c ) )
+               *found = replacement;
+           return std::distance( boost::begin( c ), found );
+        }
+
+        //
+        // usage
+        //
+        const int N = 5;
+        std::vector<int> my_vector;
+        int values[] = { 1,2,3,4,5,6,7,8,9 };
+
+        my_vector.assign( values, boost::end( values ) );
+        typedef std::vector<int>::iterator iterator;
+        std::pair<iterator,iterator>       my_view( boost::begin( my_vector ),
+                                                    boost::begin( my_vector ) + N );
+        char  str_val[] = "a string";
+        char* str       = str_val;
+
+        std::cout << my_generic_replace( my_vector, 4, 2 );
+        std::cout << my_generic_replace( my_view, 4, 2 );
+        std::cout << my_generic_replace( str, 'a', 'b' );
+
+        // prints '3', '5' and '0'     
+``
+
+By using the free-standing functions and __metafunctions__, the code automatically works for all the types supported by this library; now and in the future. Notice that we have to provide two version of `find()` since we cannot forward a non-const rvalue with reference arguments (see this article about __the_forwarding_problem__ ).
+
+[endsect] 
+
+
+
+[section:concepts Range Concepts]
+
+[section Overview]
+
+A Range is a ['concept] similar to the STL [@http://www.sgi.com/Technology/STL/Container.html Container] concept. A Range provides iterators for accessing a half-open range `[first,one_past_last)` of elements and provides information about the number of elements in the Range. However, a Range has fewer requirements than a Container.
+
+The motivation for the Range concept is that there are many useful Container-like types that do not meet the full requirements of Container, and many algorithms that can be written with this reduced set of requirements. In particular, a Range does not necessarily
+
+* own the elements that can be accessed through it,
+* have copy semantics, 
+
+Because of the second requirement, a Range object must be passed by (const or non-const) reference in generic code.
+
+The operations that can be performed on a Range is dependent on the [@../../iterator/doc/new-iter-concepts.html#iterator-traversal-concepts-lib-iterator-traversal traversal category] of the underlying iterator type. Therefore the range concepts are named to reflect which traversal category its iterators support. See also terminology and style guidelines. for more information about naming of ranges.
+
+The concepts described below specifies associated types as [@../../libs/mpl/doc/refmanual/metafunction.html metafunctions] and all functions as free-standing functions to allow for a layer of indirection.
+
+[endsect]
+
+
+[section Single Pass Range]
+
+[h4 Notation]
+
+`X` 	A type that is a model of __single_pass_range__.
+`a` 	Object of type X.
+
+[h4 Description]
+
+A range `X` where `boost::range_iterator<X>::type` is a model of __single_pass_iterator__.
+
+[h4 Associated types]
+
+[table
+  []
+  [[Value type         ] [`boost::range_value<X>::type`         ] [The type of the object stored in a Range.]]
+  [[Iterator type      ] [`boost::range_iterator<X>::type`      ] [The type of iterator used to iterate through a Range's elements. The iterator's value type is expected to be the Range's value type. A conversion from the iterator type to the `const` iterator type must exist.]]
+  [[Const iterator type] [`boost::range_const_iterator<X>::type`] [A type of iterator that may be used to examine, but not to modify, a Range's elements.]]
+]
+
+[h4 Valid expressions]
+
+The following expressions must be valid.
+
+[table
+  [[Name              ] [Expression       ] [Return type        ]]
+  [[Beginning of range] [`boost::begin(a)`] [`boost::range_iterator<X>::type` if `a` is mutable,[br] `boost::range_const_iterator<X>::type` otherwise]]
+  [[End of range      ] [`boost::end(a)`  ] [`boost::range_iterator<X>::type` if `a` is mutable,[br] `boost::range_const_iterator<X>::type` otherwise]]
+  [[Is range empty?   ] [boost::empty(a)  ] [Convertible to bool]]
+]
+
+[h4 Expression semantics]
+
+[table
+  [[Expression       ] [Semantics                                                               ] [Postcondition]]
+  [[`boost::begin(a)`] [Returns an iterator pointing to the first element in the Range.         ] [`boost::begin(a)` is either dereferenceable or past-the-end. It is past-the-end if and only if `boost::size(a) == 0`.]]
+  [[`boost::end(a)`  ] [Returns an iterator pointing one past the last element in the Range.    ] [`boost::end(a)` is past-the-end.]]
+  [[`boost::empty(a)`] [Equivalent to `boost::begin(a) == boost::end(a)`. (But possibly faster.)] [-            ]]
+]
+
+[h4 Complexity guarantees]
+
+All three functions are at most amortized linear time. For most practical purposes, one can expect `boost::begin(a)`, `boost::end(a)` and `boost::empty(a)` to be amortized constant time.
+
+[h4 Invariants]
+
+[table
+  []
+  [[Valid range ] [For any Range `a`, `[boost::begin(a),boost::end(a))` is a valid range, that is, `boost::end(a)` is reachable from `boost::begin(a)` in a finite number of increments.]]
+
+  [[Completeness] [An algorithm that iterates through the range `[boost::begin(a),boost::end(a))` will pass through every element of `a`.]]
+]
+
+[h4 See also]
+
+__container__
+
+__implementation_of_metafunctions__
+
+__implementation_of_functions__
+
+[endsect]
+
+
+[section Forward Range]
+
+[h4 Notation]
+
+`X` 	A type that is a model of __forward_range__.
+`a` 	Object of type X.
+
+[h4 Description]
+
+A range `X` where `boost::range_iterator<X>::type` is a model of __forward_traversal_iterator__.
+
+[h4 Refinement of]
+
+__single_pass_range__
+
+[h4 Associated types]
+
+[table
+  []
+  [[Distance type] [`boost::range_difference<X>::type`] [A signed integral type used to represent the distance between two of the Range's iterators. This type must be the same as the iterator's distance type.]]
+  [[Size type    ] [`boost::range_size<X>::type`      ] [An unsigned integral type that can represent any nonnegative value of the Range's distance type.]]
+]
+
+[h4 Valid expressions]
+
+[table
+  [[Name         ] [Expression      ] [Return type                 ]]
+  [[Size of range] [`boost::size(a)`] [`boost::range_size<X>::type`]]
+]
+
+[h4 Expression semantics]
+
+[table
+  [[Expression      ] [Semantics] [Postcondition]]
+  [[`boost::size(a)`] [Returns the size of the Range, that is, its number of elements. Note `boost::size(a) == 0u` is equivalent to `boost::empty(a)`.] [`boost::size(a) >= 0`]]
+]
+
+[h4 Complexity guarantees]
+
+`boost::size(a)` is at most amortized linear time.
+
+[h4 Invariants]
+
+[table
+  []
+  [[Range size] [`boost::size(a)` is equal to the distance from `boost::begin(a)` to `boost::end(a)`.]]
+]
+
+[h4 See also]
+
+__implementation_of_metafunctions__
+
+__implementation_of_functions__
+
+[endsect]
+
+
+[section Bidirectional Range]
+
+[h4 Notation]
+
+`X` 	A type that is a model of __bidirectional_range__.
+`a` 	Object of type X.
+
+[h4 Description]
+
+This concept provides access to iterators that traverse in both directions (forward and reverse). The `boost::range_iterator<X>::type` iterator must meet all of the requirements of __bidirectional_traversal_iterator__.
+
+[h4 Refinement of]
+
+__forward_range__
+
+[h4 Associated types]
+
+[table
+  []
+  [[Reverse Iterator type      ] [`boost::range_reverse_iterator<X>::type`      ] [The type of iterator used to iterate through a Range's elements in reverse order. The iterator's value type is expected to be the Range's value type. A conversion from the reverse iterator type to the const reverse iterator type must exist.]]
+
+  [[Const reverse iterator type] [`boost::range_const_reverse_iterator<X>::type`] [A type of reverse iterator that may be used to examine, but not to modify, a Range's elements.]]
+]
+
+[h4 Valid expressions]
+
+[table
+  [[Name              ] [Expression        ] [Return type] [Semantics]]
+  [[Beginning of range] [`boost::rbegin(a)`] [`boost::range_reverse_iterator<X>::type` if `a` is mutable[br] `boost::range_const_reverse_iterator<X>::type` otherwise.] [Equivalent to `boost::range_reverse_iterator<X>::type(boost::end(a))`.]]
+
+  [[End of range      ] [`boost::rend(a)`  ] [`boost::range_reverse_iterator<X>::type` if `a` is mutable,[br] `boost::range_const_reverse_iterator<X>::type` otherwise.] [Equivalent to `boost::range_reverse_iterator<X>::type(boost::begin(a))`.]]
+]
+
+[h4 Complexity guarantees]
+
+`boost::rbegin(a)` has the same complexity as `boost::end(a)` and `boost::rend(a)` has the same complexity as `boost::begin(a)` from __forward_range__.
+
+[h4 Invariants]
+
+[table
+  []
+  [[Valid reverse range] [For any Bidirectional Range a, `[boost::rbegin(a),boost::rend(a))` is a valid range, that is, `boost::rend(a)` is reachable from `boost::rbegin(a)` in a finite number of increments.]]
+
+  [[Completeness       ] [`An algorithm that iterates through the range `[boost::rbegin(a),boost::rend(a))` will pass through every element of `a`.]]
+]
+
+[h4 See also]
+
+__implementation_of_metafunctions__
+
+__implementation_of_functions__
+
+[endsect]
+
+
+[section Random Access Range]
+
+[h4 Description]
+
+A range `X` where `boost::range_iterator<X>::type` is a model of __random_access_traversal_iterator__.
+
+[h4 Refinement of]
+
+__bidirectional_range__
+
+[endsect]
+
+
+[section Concept Checking]
+
+Each of the range concepts has a corresponding concept checking class in the file [@../../boost/range/concepts.hpp `boost/range/concepts.hpp`]. These classes may be used in conjunction with the __concept_check__ to insure that the type of a template parameter is compatible with a range concept. If not, a meaningful compile time error is generated. Checks are provided for the range concepts related to iterator traversal categories. For example, the following line checks that the type `T` models the __forward_range__ concept.
+
+``
+function_requires<ForwardRangeConcept<T> >();
+``
+    
+An additional concept check is required for the value access property of the range based on the range's iterator type. For example to check for a ForwardReadableRange, the following code is required.
+
+``
+function_requires<ForwardRangeConcept<T> >();
+    function_requires<
+        ReadableIteratorConcept<
+            typename range_iterator<T>::type
+        >
+    >();
+``    
+
+The following range concept checking classes are provided.
+
+* Class SinglePassRangeConcept checks for __single_pass_range__
+* Class ForwardRangeConcept checks for __forward_range__
+* Class BidirectionalRangeConcept checks for __bidirectional_range__
+* Class RandomAccessRangeConcept checks for __random_access_range__
+
+[h4 See also]
+
+[link boost.range.style_guide Range Terminology and style guidelines]
+
+__iterator_concepts__
+
+__concept_check__
+
+[endsect] 
+
+[endsect]
+
+
+
+[section Reference]
+
+[section Overview]
+
+Four types of objects are currently supported by the library:
+
+* standard-like containers
+* `std::pair<iterator,iterator>`
+* null terminated strings (this includes `char[]`,`wchar_t[]`, `char*`, and `wchar_t*`)
+
+[:[*Warning: ['support for null-terminated strings is deprecated and will disappear in the next Boost release (1.34).]]]
+
+* built-in arrays
+
+Even though the behavior of the primary templates are exactly such that standard containers will be supported by default, the requirements are much lower than the standard container requirements. For example, the utility class __iterator_range__ implements the __minimal_interface__ required to make the class a __forward_range__.
+
+Please also see __range_concepts__ for more details.
+
+[endsect]
+
+
+[section Synopsis]
+
+``
+namespace boost
+{
+    //
+    // Single Pass Range metafunctions
+    //
+
+    template< class T >
+    struct range_value;
+
+    template< class T >
+    struct range_iterator;
+
+    template< class T >
+    struct range_const_iterator;
+
+    //
+    // Forward Range metafunctions
+    //
+
+    template< class T >
+    struct range_difference;
+
+    template< class T >
+    struct range_size;
+
+    //
+    // Bidirectional Range metafunctions
+    //
+
+    template< class T >
+    struct range_reverse_iterator;
+
+    template< class T >
+    struct range_const_reverse_iterator;
+
+    //
+    // Special metafunctions
+    //
+
+    template< class T >
+    struct range_result_iterator;
+
+    template< class T >
+    struct range_reverse_result_iterator;
+
+    //
+    // Single Pass Range functions
+    //
+
+    template< class T >
+    typename range_iterator<T>::type
+    begin( T& c );
+
+    template< class T >
+    typename range_const_iterator<T>::type
+    begin( const T& c );
+
+    template< class T >
+    typename range_iterator<T>::type
+    end( T& c );
+
+    template< class T >
+    typename range_const_iterator<T>::type
+    end( const T& c );
+
+    template< class T >
+    bool
+    empty( const T& c );
+
+    //
+    // Forward Range functions
+    //
+
+    template< class T >
+    typename range_size<T>::type
+    size( const T& c );
+
+    //
+    // Bidirectional Range functions
+    //
+
+    template< class T >
+    typename range_reverse_iterator<T>::type
+    rbegin( T& c );
+
+    template< class T >
+    typename range_const_reverse_iterator<T>::type
+    rbegin( const T& c );
+
+    template< class T >
+    typename range_reverse_iterator<T>::type
+    rend( T& c );
+
+    template< class T >
+    typename range_const_reverse_iterator<T>::type
+    rend( const T& c );
+
+    //
+    // Special const Range functions
+    //
+
+    template< class T >
+    typename range_const_iterator<T>::type 
+    const_begin( const T& r );
+
+    template< class T >
+    typename range_const_iterator<T>::type 
+    const_end( const T& r );
+
+    template< class T >
+    typename range_const_reverse_iterator<T>::type 
+    const_rbegin( const T& r );
+
+    template< class T >
+    typename range_const_reverse_iterator<T>::type 
+    const_rend( const T& r );
+
+} // namespace 'boost' 
+``
+
+[endsect]
+
+
+[section Semantics]
+
+[h5 notation]
+
+[table
+  [[Type   ] [Object] [Describes                                ]]
+  [[`X`    ] [`x`   ] [any type                                 ]]
+  [[`T`    ] [`t`   ] [denotes behavior of the primary templates]]
+  [[`P`    ] [`p`   ] [denotes `std::pair<iterator,iterator>`   ]]
+  [[`A[sz]`] [`a`   ] [denotes an array of type `A` of size `sz`]]
+  [[`Char*`] [`s`   ] [denotes either `char*` or `wchar_t*`     ]]
+]
+
+Please notice in tables below that when four lines appear in a cell, the first line will describe the primary template, the second line pairs of iterators, the third line arrays and the last line null-terminated strings.
+
+[section Metafunctions]
+
+[table
+  [[Expression] [Return type] [Complexity]]
+  [[`range_value<X>::type`] [`T::value_type`[br]
+`boost::iterator_value<P::first_type>::type`[br]
+`A`[br]
+`Char`] [compile time]]
+  [[`range_iterator<X>::type`] [`T::iterator`[br]
+`P::first_type`[br]
+`A*`[br]
+`Char*`] [compile time]]
+  [[`range_const_iterator<X>::type`] [`T::const_iterator`[br]
+`P::first_type`[br]
+`const A*`[br]
+`const Char*`] [compile time]]
+  [[`range_difference<X>::type`] [`T::difference_type`[br]
+`boost::iterator_difference<P::first_type>::type`[br]
+`std::ptrdiff_t`[br]
+`std::ptrdiff_t`] [compile time]]
+  [[`range_size<X>::type`] [`T::size_type`[br]
+`std::size_t`[br]
+`std::size_t`[br]
+`std::size_t`] [compile time]]
+  [[`range_result_iterator<X>::type`] [`range_const_iterator<X>::type` if `X` is `const`[br]
+`range_iterator<X>::type` otherwise] [compile time]]
+  [[`range_reverse_iterator<X>::type`] [`boost::reverse_iterator< typename range_iterator<T>::type >`] [compile time]]
+  [[`range_const_reverse_iterator<X>::type`] [`boost::reverse_iterator< typename range_const_iterator<T>::type >`] [compile time]]
+  [[`range_reverse_result_iterator<X>::type`] [`boost::reverse_iterator< typename range_result_iterator<T>::type >`] [compile time]]
+]
+
+The special metafunctions `range_result_iterator` and `range_reverse_result_iterator` are not part of any Range concept, but they are very useful when implementing certain Range classes like __sub_range__ because of their ability to select iterators based on constness.
+
+[endsect]
+
+[section Functions]
+
+[table
+  [[Expression] [Return type] [Returns] [Complexity]]
+
+  [[`begin(x)`] [`range_result_iterator<X>::type`] [`p.first` if `p` is of type `std::pair<T>`[br]
+`a` if `a` is an array[br]
+`s` if `s` is a string literal[br]
+`boost_range_begin(x)` if that expression would invoke a function found by ADL[br]
+`t.begin()` otherwise] [constant time]]
+
+  [[`end(x)`] [`range_result_iterator<X>::type`] [`p.second` if `p` is of type `std::pair<T>`[br]
+`a + sz` if `a` is an array of size `sz`[br]
+`s + std::char_traits<X>::length( s )` if `s` is a `Char*`[br]
+`s + sz - 1` if `s` is a string literal of size `sz`[br]
+`boost_range_end(x)` if that expression would invoke a function found by ADL[br]
+`t.end()` otherwise] [linear if `X` is `Char*`
+constant time otherwise]]
+
+  [[`empty(x)`] [`bool`] [`begin(x) == end( x )`] [linear if `X` is `Char*`[br]
+constant time otherwise]]
+
+  [[`size(x)`] [`range_size<X>::type`] [`std::distance(p.first,p.second)` if `p` is of type `std::pair<T>`[br]
+`sz` if `a` is an array of size `sz`[br]
+`end(s) - s` if `s` is a string literal or a `Char*`[br]
+`boost_range_size(x)` if that expression would invoke a function found by ADL[br]
+`t.size()` otherwise] [linear if `X` is `Char*` or if `std::distance()` is linear[br]
+constant time otherwise]]
+
+  [[`rbegin(x)`] [`range_reverse_result_iterator<X>::type`] [`range_reverse_result_iterator<X>::type( end(x) )`] [same as `end(x)`]]
+
+  [[`rend(x)`] [`range_reverse_result_iterator<X>::type`] [`range_reverse_result_iterator<X>::type( begin(x) )`] [same as `begin(x)`]]
+
+  [[`const_begin(x)`] [`range_const_iterator<X>::type`] [`range_const_iterator<X>::type( begin(x) )`] [same as `begin(x)`]]
+
+  [[`const_end(x)`] [`range_const_iterator<X>::type`] [`range_const_iterator<X>::type( end(x) )`] [same as `end(x)`]]
+
+  [[`const_rbegin(x)`] [`range_const_reverse_iterator<X>::type`] [`range_const_reverse_iterator<X>::type( rbegin(x) )`] [same as `rbegin(x)`]]
+
+  [[`const_rend(x)`] [`range_const_reverse_iterator<X>::type`] [`range_const_reverse_iterator<X>::type( rend(x) )`] [same as `rend(x)`]]
+]
+
+The special const functions are not part of any Range concept, but are very useful when you want to document clearly that your code is read-only.
+
+[endsect]
+
+[endsect]
+
+[section:extending Extending the library]
+
+[section:method_1 Method 1: provide member functions and nested types]
+
+This procedure assumes that you have control over the types that should be made conformant to a Range concept. If not, see [link boost.range.reference.extending.method_2 method 2].
+
+The primary templates in this library are implemented such that standard containers will work automatically and so will __boost_array__. Below is given an overview of which member functions and member types a class must specify to be useable as a certain Range concept.
+
+[table
+  [[Member function] [Related concept      ]]
+  [[`begin()`      ] [__single_pass_range__]]
+  [[`end()`        ] [__single_pass_range__]]
+  [[`size()`       ] [__forward_range__    ]]
+]
+
+Notice that `rbegin()` and `rend()` member functions are not needed even though the container can support bidirectional iteration.
+
+The required member types are:
+
+[table
+  [[Member type     ] [Related concept      ]]
+  [[`iterator`      ] [__single_pass_range__]]
+  [[`const_iterator`] [__single_pass_range__]]
+  [[`size_type`     ] [__forward_range__    ]]
+]
+
+Again one should notice that member types `reverse_iterator` and `const_reverse_iterator` are not needed.
+
+[endsect]
+
+[section:method_2 Method 2: provide free-standing functions and specialize metafunctions]
+
+This procedure assumes that you cannot (or do not wish to) change the types that should be made conformant to a Range concept. If this is not true, see [link boost.range.reference.extending.method_1 method 1].
+
+The primary templates in this library are implemented such that certain functions are found via argument-dependent-lookup (ADL). Below is given an overview of which free-standing functions a class must specify to be useable as a certain Range concept. Let `x` be a variable (`const` or `mutable`) of the class in question.
+
+[table
+  [[Function              ] [Related concept      ]]
+  [[`boost_range_begin(x)`] [__single_pass_range__]]
+  [[`boost_range_end(x)`  ] [__single_pass_range__]]
+  [[`boost_range_size(x)` ] [__forward_range__    ]]
+]
+
+`boost_range_begin()` and `boost_range_end()` must be overloaded for both `const` and `mutable` reference arguments.
+
+You must also specialize 3 metafunctions for your type `X`:
+
+[table
+  [[Metafunction                 ] [Related concept      ]]
+  [[`boost::range_iterator`      ] [__single_pass_range__]]
+  [[`boost::range_const_iterator`] [__single_pass_range__]]
+  [[`boost::range_size`          ] [__forward_range__    ]]
+]
+
+A complete example is given here:
+
+``
+    #include <boost/range.hpp>
+    #include <iterator>         // for std::iterator_traits, std::distance()
+
+    namespace Foo
+    {
+        //
+        // Our sample UDT. A 'Pair'
+        // will work as a range when the stored
+        // elements are iterators.
+        //
+        template< class T >
+        struct Pair
+        {
+            T first, last;	
+        };
+
+    } // namespace 'Foo'
+
+    namespace boost
+    {
+        //
+        // Specialize metafunctions. We must include the range.hpp header.
+        // We must open the 'boost' namespace.
+        //
+
+    	template< class T >
+    	struct range_iterator< Foo::Pair<T> >
+    	{
+    		typedef T type;
+    	};
+
+    	template< class T >
+    	struct range_const_iterator< Foo::Pair<T> >
+    	{
+    		//
+    		// Remark: this is defined similar to 'range_iterator'
+    		//         because the 'Pair' type does not distinguish
+    		//         between an iterator and a const_iterator.
+    		//
+    		typedef T type;
+    	};
+
+    	template< class T >
+    	struct range_size< Foo::Pair<T> >
+    	{
+
+    		typedef std::size_t type;
+    	};
+
+    } // namespace 'boost'
+
+    namespace Foo
+    {
+    	//
+    	// The required functions. These should be defined in
+    	// the same namespace as 'Pair', in this case 
+    	// in namespace 'Foo'.
+    	//
+    	
+    	template< class T >
+    	inline T boost_range_begin( Pair<T>& x )
+    	{ 
+    		return x.first;
+    	}
+
+    	template< class T >
+    	inline T boost_range_begin( const Pair<T>& x )
+    	{ 
+    		return x.first;
+    	}
+
+    	template< class T >
+    	inline T boost_range_end( Pair<T>& x )
+    	{ 
+    		return x.last;
+    	}
+
+    	template< class T >
+    	inline T boost_range_end( const Pair<T>& x )
+    	{ 
+    		return x.last;
+    	}
+
+    	template< class T >
+    	inline typename boost::range_size< Pair<T> >::type
+    	boost_range_size( const Pair<T>& x )
+    	{
+    		return std::distance(x.first,x.last);
+    	}
+
+    } // namespace 'Foo'
+
+    #include <vector>
+
+    int main()
+    {
+    	typedef std::vector<int>::iterator  iter;
+    	std::vector<int>                    vec;
+    	Foo::Pair<iter>                     pair = { vec.begin(), vec.end() };
+    	const Foo::Pair<iter>&              cpair = pair; 
+    	//
+    	// Notice that we call 'begin' etc with qualification. 
+    	//
+    	iter i = boost::begin( pair );
+    	iter e = boost::end( pair );
+    	i      = boost::begin( cpair );
+    	e      = boost::end( cpair );
+    	boost::range_size< Foo::Pair<iter> >::type s = boost::size( pair );
+    	s      = boost::size( cpair );
+    	boost::range_const_reverse_iterator< Foo::Pair<iter> >::type
+    	ri     = boost::rbegin( cpair ),
+    	re     = boost::rend( cpair );
+    }	
+``
+
+[endsect]
+
+[endsect]
+
+[endsect]
+
+
+
+[section Utilities]
+
+Having an abstraction that encapsulates a pair of iterators is very useful. The standard library uses `std::pair` in some circumstances, but that class is cumbersome to use because we need to specify two template arguments, and for all range algorithm purposes we must enforce the two template arguments to be the same. Moreover, `std::pair<iterator,iterator>` is hardly self-documenting whereas more domain specific class names are. Therefore these two classes are provided:
+
+* Class `iterator_range`
+* Class `sub_range`
+
+The `iterator_range` class is templated on an __forward_traversal_iterator__ and should be used whenever fairly general code is needed. The `sub_range` class is templated on an __forward_range__ and it is less general, but a bit easier to use since its template argument is easier to specify. The biggest difference is, however, that a `sub_range` can propagate constness because it knows what a corresponding `const_iterator` is.
+
+Both classes can be used as ranges since they implement the __minimal_interface__ required for this to work automatically.
+
+[section:iterator_range Class `iterator_range`]
+
+The intention of the `iterator_range` class is to encapsulate two iterators so they fulfill the __forward_range__ concept. A few other functions are also provided for convenience.
+
+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 Forward 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 means that the `iterator_range` will still be usable in many contexts even though the iterators underneath are not.
+
+[h4 Synopsis]
+
+``
+namespace boost
+{
+    template< class ForwardTraversalIterator >
+    class iterator_range
+    {
+    public: // Forward Range types
+        typedef ...                        value_type;
+        typedef ...                        difference_type;
+        typedef ...                        size_type;
+        typedef ForwardTraversalIterator   iterator;
+        typedef ForwardTraversalIterator   const_iterator;
+
+    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;
+        size_type size() const;
+        bool      empty() const;
+        
+    public: // convenience
+        operator    unspecified_bool_type() const;
+        bool        equal( const iterator_range& ) const;
+        value_type& front() const;
+        value_type& back() const;
+        // for Random Access Range only: 
+        value_type& operator[]( size_type at ) const;
+    };
+    
+    // stream output
+    template< class ForwardTraversalIterator, class T, class 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, 
+                     const iterator_range<ForwardTraversalIterator2>& r );
+
+    template< class ForwardTraversalIterator, class ForwardRange >
+    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 );
+
+    template< class ForwardTraversalIterator, class ForwardTraversalIterator2 >
+    bool operator!=( const iterator_range<ForwardTraversalIterator>& l, 
+                     const iterator_range<ForwardTraversalIterator2>& r );
+
+    template< class ForwardTraversalIterator, class ForwardRange >
+    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 );
+
+    template< class ForwardTraversalIterator, class ForwardTraversalIterator2 >
+    bool operator<( const iterator_range<ForwardTraversalIterator>& l, 
+                    const iterator_range<ForwardTraversalIterator2>& r );
+
+    template< class ForwardTraversalIterator, class ForwardRange >
+    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, 
+                         ForwardTraversalIterator End );
+       
+    template< class ForwardRange >
+    iterator_range< typename iterator_of<ForwardRange>::type >
+    make_iterator_range( ForwardRange& r );
+
+    template< class ForwardRange >
+    iterator_range< typename const_iterator_of<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_const_iterator<Range>::type >
+    make_iterator_range( const Range& r, 
+                         typename range_difference<Range>::type advance_begin,
+                         typename range_difference<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).
+
+It is worth noticing that the templated constructors and assignment operators allow conversion from `iterator_range<iterator>` to `iterator_range<const_iterator>`. Similarly, since the comparison operators have two template arguments, we can compare ranges whenever the iterators are comparable; for example when we are dealing with const and non-const iterators from the same container.
+
+[h4 Details member functions]
+
+`operator unspecified_bool_type() const;`
+
+[:['[*Returns]] `!empty();`]
+
+`bool equal( iterator_range& r ) const;`
+
+[:['[*Returns]] `begin() == r.begin() && end() == r.end();`]
+
+[h4 Details functions]
+
+`bool operator==( const ForwardRange1& l, const ForwardRange2& r );`
+
+[:['[*Returns]] `size(l) != size(r) ? false : std::equal( begin(l), end(l), begin(r) );`]
+
+`bool operator!=( const ForwardRange1& l, const ForwardRange2& r );`
+
+[:['[*Returns]] `!( l == r );`]
+
+`bool operator<( const ForwardRange1& l, const ForwardRange2& r );`
+
+[:['[*Returns]] `std::lexicographical_compare( begin(l), end(l), begin(r), end(r) );`]
+
+``
+iterator_range make_iterator_range( Range& r,
+                                    typename range_difference<Range>::type advance_begin, 
+                                    typename range_difference<Range>::type advance_end );
+``
+
+[:['[*Effects:]]]
+
+``
+    iterator new_begin = begin( r ),
+    iterator new_end   = end( r );
+    std::advance( new_begin, advance_begin );
+    std::advance( new_end, advance_end );
+    return make_iterator_range( new_begin, new_end );
+``
+
+`Sequence copy_range( const ForwardRange& r );`
+
+[:['[*Returns]] `Sequence( begin(r), end(r) );`]
+
+[endsect]
+
+[section:sub_range Class `sub_range`]
+
+The `sub_range` class inherits all its functionality from the __iterator_range__ class. The `sub_range` class is often easier to use because one must specify the __forward_range__ template argument instead of an iterator. Moreover, the sub_range class can propagate constness since it knows what a corresponding `const_iterator` is.
+
+[h4 Synopsis]
+
+``
+namespace boost
+{
+    template< class ForwardRange >
+    class sub_range : public iterator_range< typename range_result_iterator<ForwardRange>::type >
+    {
+    public: 
+        typedef typename range_result_iterator<ForwardRange>::type iterator;
+        typedef typename range_const_iterator<ForwardRange>::type  const_iterator;
+    
+    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 
+        iterator        begin();
+        const_iterator  begin() const;
+        iterator        end();
+        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: 
+        value_type&       operator[]( size_type at );
+        const value_type& operator[]( size_type at ) const;
+    
+    public:
+        // rest of interface inherited from iterator_range
+    };
+    
+} // namespace 'boost'
+``
+
+The class should be trivial to use as seen below. Imagine that we have an algorithm that searches for a sub-string in a string. The result is an iterator_range, that delimits the match. We need to store the result from this algorithm. Here is an example of how we can do it with and without `sub_range`
+
+``
+std::string str("hello");
+iterator_range<std::string::iterator> ir = find_first( str, "ll" );
+sub_range<std::string>               sub = find_first( str, "ll" );
+``
+
+[endsect]
+
+[endsect]
+
+
+
+[section:style_guide Terminology and style guidelines]
+
+The use of a consistent terminology is as important for __ranges__ and range-based algorithms as it is for iterators and iterator-based algorithms. If a conventional set of names are adopted, we can avoid misunderstandings and write generic function prototypes that are ['self-documenting].
+
+Since ranges are characterized by a specific underlying iterator type, we get a type of range for each type of iterator. Hence we can speak of the following types of ranges:
+
+* ['Value access] category:
+  * Readable Range
+  * Writeable Range
+  * Swappable Range
+  * Lvalue Range 
+* ['Traversal] category:
+  * __single_pass_range__
+  * __forward_range__
+  * __bidirectional_range__
+  * __random_access_range__
+
+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 
+
+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.
+
+It might, however, be reasonable to specify only one category if the other category does not matter. For example, the __iterator_range__ can be constructed from a Forward Range. This means that we do not care about what ['value access] properties the Range has. Similarly, a Readable Range will be one that has the lowest possible ['traversal] property (Single Pass).
+
+As another example, consider how we specify the interface of `std::sort()`. Algorithms are usually more cumbersome to specify the interface of since both traversal and value access properties must be exactly defined. The iterator-based version looks like this:
+
+``
+   template< class RandomAccessTraversalReadableWritableIterator >
+   void sort( RandomAccessTraversalReadableWritableIterator first,
+              RandomAccessTraversalReadableWritableIterator last );
+`` 
+
+For ranges the interface becomes
+
+``
+   template< class RandomAccessReadableWritableRange >
+   void sort( RandomAccessReadableWritableRange& r );
+``
+ 
+[endsect]
+
+
+
+[section Library Headers]
+
+[table
+    [[Header                              ] [Includes                   ] [Related Concept         ]]
+    [[`<boost/range.hpp>`                 ] [everything                 ] [-                       ]]
+    [[`<boost/range/metafunctions.hpp>`   ] [every metafunction         ] [-                       ]]
+    [[`<boost/range/functions.hpp>`       ] [every function             ] [-                       ]]
+    [[`<boost/range/value_type.hpp>`      ] [`range_value`              ] [__single_pass_range__   ]]
+    [[`<boost/range/iterator.hpp>`        ] [`range_iterator`           ] [__single_pass_range__   ]]
+    [[`<boost/range/const_iterator.hpp>`  ] [`range_const_iterator`     ] [__single_pass_range__   ]]
+    [[`<boost/range/difference_type.hpp>` ] [`range_difference`         ] [__forward_range__       ]]
+    [[`<boost/range/size_type.hpp>`       ] [`range_size`               ] [__forward_range__       ]]
+    [[`<boost/range/result_iterator.hpp>` ] [`range_result_iterator`    ] [-                       ]]
+    [[`<boost/range/reverse_iterator.hpp>`] [`range_reverse_iterator`   ] [__bidirectional_range__ ]]
+    [[`<boost/range/const_reverse_iterator.hpp>`]
+                                            [`range_const_reverse_iterator`]
+                                                                          [_bidirectional_range__  ]]
+    [[`<boost/range/reverse_result_iterator.hpp>`]
+                                            [`range_reverse_result_iterator`]
+                                                                          [-                       ]]
+    [[`<boost/range/begin.hpp>`           ] [`begin` and `const_begin`  ] [__single_pass_range__   ]]
+    [[`<boost/range/end.hpp>`             ] [`end` and `const_end`      ] [__single_pass_range__   ]]
+    [[`<boost/range/empty.hpp>`           ] [`empty`                    ] [__single_pass_range__   ]]
+    [[`<boost/range/size.hpp>`            ] [`size`                     ] [__forward_range__       ]]
+    [[`<boost/range/rbegin.hpp>`          ] [`rbegin` and `const_rbegin`] [__bidirectional_range__ ]]
+    [[`<boost/range/rend.hpp>`            ] [`rend` and `const_rend`    ] [__bidirectional_range__ ]]
+    [[`<boost/range/iterator_range.hpp>`  ] [`iterator_range`           ] [-                       ]]
+    [[`<boost/range/sub_range.hpp>`       ] [`sub_range`                ] [-                       ]]
+    [[`<boost/range/concepts.hpp>`        ] [`concept checks`           ] [-                       ]]
+]
+
+[endsect]
+
+
+
+[section Examples]
+
+Some examples are given in the accompanying test files:
+
+* [@http://www.boost.org/libs/range/test/string.cpp string.cpp][br]
+shows how to implement a container version of `std::find()` that works with `char[]`,`wchar_t[]`,`char*`,`wchar_t*`.
+
+[:[*Warning: ['support for null-terminated strings is deprecated and will disappear in the next Boost release (1.34).]]]
+
+* [@http://www.boost.org/libs/range/test/algorithm_example.cpp algorithm_example.cpp][br]shows the replace example from the introduction.
+
+* [@http://www.boost.org/libs/range/test/iterator_range.cpp iterator_range.cpp]
+
+* [@http://www.boost.org/libs/range/test/sub_range.cpp sub_range.cpp]
+
+* [@http://www.boost.org/libs/range/test/iterator_pair.cpp iterator_pair.cpp]
+
+* [@http://www.boost.org/libs/range/test/reversible_range.cpp reversible_range.cpp]
+
+* [@http://www.boost.org/libs/range/test/std_container.cpp std_container.cpp]
+
+* [@http://www.boost.org/libs/range/test/array.cpp array.cpp]
+
+[endsect]
+
+
+
+[section Portability]
+
+A huge effort has been made to port the library to as many compilers as possible.
+
+Full support for built-in arrays require that the compiler supports class template partial specialization. For non-conforming compilers there might be a chance that it works anyway thanks to workarounds in the type traits library.
+Visual C++ 6/7.0 has a limited support for arrays: as long as the arrays are of built-in type it should work.
+
+Notice also that some compilers cannot do function template ordering properly. In that case one must rely of __range_result_iterator__ and a single function definition instead of overloaded versions for const and non-const arguments. So if one cares about old compilers, one should not pass rvalues to the functions.
+
+For maximum portability you should follow these guidelines:
+
+# do not use built-in arrays,
+# do not pass rvalues to `begin()`, `end()` and `iterator_range` Range constructors and assignment operators,
+# 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. 
+
+
+
+[endsect]
+
+
+
+[section FAQ]
+
+1. ['[*Why is there no difference between `range_iterator<C>::type`  and `range_const_iterator<C>::type` for `std::pair<iterator, iterator>`?]]
+
+[:In general it is not possible nor desirable to find a corresponding `const_iterator`. When it is possible to come up with one, the client might choose to construct a `std::pair<const_iterator,const_iterator>` object.]
+
+[:Note that an __iterator_range__ is somewhat more convenient than a `pair` and that a __sub_range__ does propagate const-ness.]
+
+2. ['[*Why is there not supplied more types or more functions?]]
+
+[:The library has been kept small because its current interface will serve most purposes. If and when a genuine need arises for more functionality, it can be implemented.]
+
+3. ['[*How should I implement generic algorithms for ranges?]]
+
+[:One should always start with a generic algorithm that takes two iterators (or more) as input. Then use Boost.Range to build handier versions on top of the iterator based algorithm. Please notice that once the range version of the algorithm is done, it makes sense not to expose the iterator version in the public interface.]
+
+4. ['[*Why is there no Incrementable Range concept?]]
+
+[:Even though we speak of incrementable iterators, it would not make much sense for ranges; for example, we cannot determine the size and emptiness of a range since we cannot even compare its iterators.]
+
+[:Note also that incrementable iterators are derived from output iterators and so there exist no output range.]
+
+[endsect]
+
+[section:history_ack History and Acknowledgement]
+
+The library have been under way for a long time. Dietmar Kühl originally intended to submit an `array_traits` class template which had most of the functionality present now, but only for arrays and standard containers.
+
+Meanwhile work on algorithms for containers in various contexts showed the need for handling pairs of iterators, and string libraries needed special treatment of character arrays. In the end it made sense to formalize the minimal requirements of these similar concepts. And the results are the Range concepts found in this library.
+
+The term Range was adopted because of paragraph 24.1/7 from the C++ standard:
+
+Most of the library's algorithmic templates that operate on data structures have interfaces that use ranges. A range is a pair of iterators that designate the beginning and end of the computation. A range [i, i) is an empty range; in general, a range [i, j) refers to the elements in the data structure starting with the one pointed to by i and up to but not including the one pointed to by j. Range [i, j) is valid if and only if j is reachable from i. The result of the application of functions in the library to invalid ranges is undefined. 
+
+Special thanks goes to
+
+* Pavol Droba for help with documentation and implementation
+* 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. 
+
+The concept checks and their documentation was provided by Daniel Walker. 
+
+[endsect]
\ No newline at end of file
diff --git a/doc/example.cpp b/doc/example.cpp
index a45bbcc..afe448f 100644
--- a/doc/example.cpp
+++ b/doc/example.cpp
@@ -1,10 +1,3 @@
-/*
-//  Copyright Thorsten Ottosen 2003-2005. Use, modification and
-//  distribution is subject to the Boost Software License, Version
-//  1.0. (See accompanying file LICENSE_1_0.txt or copy at
-//  http://www.boost.org/LICENSE_1_0.txt)
-*/
-
 #include <boost/range.hpp>
 #include <iterator>         // for std::iterator_traits, std::distance()
 
diff --git a/doc/examples.html b/doc/examples.html
index b0e4973..0ea235d 100755
--- a/doc/examples.html
+++ b/doc/examples.html
@@ -26,10 +26,6 @@
         </li>
         shows how to implement a container version of <code  >std::find()</code> that
         works with <code  >char[],wchar_t[],char*,wchar_t*.</code>
-        <p>
-         <b>Warning:</b><i> support for null-terminated strings is deprecated and will
-              disappear in the next Boost release (1.34). </i>
-        </p>
 
         <li  >
             <a href="../test/algorithm_example.cpp" target="_self" ><code  >algorithm_example.cpp</code></a>
@@ -47,7 +43,7 @@
 
     <hr>
     <p>
-    (C) Copyright Thorsten Ottosen 2003-2004. Use, modification and distribution is subject to the Boost Software License, Version 1.0.
+    (C) Copyright Thorsten Ottosen 2003-2004
     </p>
 
     <br>
diff --git a/doc/faq.html b/doc/faq.html
index 614725a..34304ef 100755
--- a/doc/faq.html
+++ b/doc/faq.html
@@ -116,7 +116,7 @@ Cool indeed!
 
     <hr>
     <p>
-    (C) Copyright Thorsten Ottosen 2003-2004. Use, modification and distribution is subject to the Boost Software License, Version 1.0.
+    (C) Copyright Thorsten Ottosen 2003-2004
     </p>
 
     <br>
diff --git a/doc/headers.html b/doc/headers.html
index 4d320a1..69987ce 100755
--- a/doc/headers.html
+++ b/doc/headers.html
@@ -50,6 +50,12 @@
                                                 >range_iterator</a></td>
             <td><a href="range.html#single_pass_range">Single Pass Range</a> </td>
         </tr>
+        <tr  >
+            <td  ><code  >&lt;boost/range/mutable_iterator.hpp&gt;</code></td>
+            <td  ><a href="boost_range.html#range_mutable_iterator"
+                                                >range_mutable_iterator</a></td>
+            <td><a href="range.html#single_pass_range">Single Pass Range</a> </td>
+        </tr>
         <tr  >
             <td  ><code  >&lt;boost/range/const_iterator.hpp&gt;</code></td>
             <td  ><a href="boost_range.html#range_const_iterator"
@@ -63,31 +69,23 @@
             <td><a href="range.html#forward_range">Forward Range</a> </td>
         </tr>
         <tr  >
-            <td  ><code  >&lt;boost/range/size_type.hpp&gt;</code></td>
-            <td  ><a href="boost_range.html#range_size" >range_size</a></td>
-            <td><a href="range.html#forward_range">Forward Range</a> </td>
-        </tr>
-        <tr  >
-            <td  ><code  >&lt;boost/range/result_iterator.hpp&gt;</code></td>
-            <td  ><a href="boost_range.html#range_result_iterator"
-                >range_result_iterator</a></td>
+            <td  ><code  >&lt;boost/range/pointer.hpp&gt;</code></td>
+            <td  ><a href="boost_range.html#range_pointer" 
+                >range_pointer</a></td>
             <td>- </td>
         </tr>
+        <tr  >
+            <td  ><code  >&lt;boost/range/category.hpp&gt;</code></td>
+            <td  ><a href="boost_range.html#range_category" 
+                >range_category</a></td>
+            <td>- </td>
+        </tr>
+
         <tr  >
             <td  ><code  >&lt;boost/range/reverse_iterator.hpp&gt;</code></td>
             <td  ><a href="boost_range.html#range_reverse_iterator" >range_reverse_iterator</a></td>
             <td><a href="range.html#bidirectional_range">Bidirectional Range</a> </td>
         </tr>
-        <tr  >
-            <td  ><code  >&lt;boost/range/const_reverse_iterator.hpp&gt;</code></td>
-            <td  ><a href="boost_range.html#range_const_reverse_iterator" >range_const_reverse_iterator</a></td>
-            <td><a href="range.html#bidirectional_range">Bidirectional Range</a> </td>
-        </tr>
-        <tr  >
-            <td  ><code  >&lt;boost/range/reverse_result_iterator.hpp&gt;</code></td>
-            <td  ><a href="boost_range.html#range_reverse_result_iterator">range_reverse_result_iterator</a></td>
-            <td>- </td>
-        </tr>
         <tr  >
             <td  ><code  >&lt;boost/range/begin.hpp&gt;</code></td>
             <td  >
@@ -109,10 +107,16 @@
             <td  ><a href="boost_range.html#empty" >empty</a></td>
             <td><a href="range.html#single_pass_range">Single Pass Range</a> </td>
         </tr>
+        <tr  >
+            <td  ><code  >&lt;boost/range/distance.hpp&gt;</code></td>
+            <td  ><a href="boost_range.html#distance" >distance</a></td>
+            <td><a href="range.html#forward_range">Forward Range</a> </td>
+        </tr>
         <tr  >
             <td  ><code  >&lt;boost/range/size.hpp&gt;</code></td>
             <td  ><a href="boost_range.html#size" >size</a></td>
-            <td><a href="range.html#forward_range">Forward Range</a> </td>
+            <td><a href="range.html#random_access_range">Random Access Range</a> 
+                </td>
         </tr>
         <tr  >
             <td  ><code  >&lt;boost/range/rbegin.hpp&gt;</code></td>
@@ -130,6 +134,21 @@
             </td>
             <td><a href="range.html#bidirectional_range">Bidirectional Range</a> </td>
         </tr>
+        <tr  >
+            <td  ><code  >&lt;boost/range/as_array.hpp&gt;</code></td>
+            <td  >
+                 <a href="boost_range.html#as_array" >as_array</a>
+            </td>
+            <td>-</td>
+        </tr>
+        <tr  >
+            <td  ><code  >&lt;boost/range/as_literal.hpp&gt;</code></td>
+            <td  >
+                 <a href="boost_range.html#as_literal" >as_literal</a>
+            </td>
+            <td>-</td>
+        </tr>
+
         <tr  >
             <td  ><code >&lt;boost/range/iterator_range.hpp&gt;</code></td>
             <td  ><a href="utility_class.html#iter_range"
@@ -154,7 +173,7 @@
 
     <hr>
     <p>
-    (C) Copyright Thorsten Ottosen 2003-2004. Use, modification and distribution is subject to the Boost Software License, Version 1.0.
+    (C) Copyright Thorsten Ottosen 2003-2007
     </p>
 
     <br>
diff --git a/doc/history_ack.html b/doc/history_ack.html
index ec3d887..40ee5dc 100755
--- a/doc/history_ack.html
+++ b/doc/history_ack.html
@@ -61,7 +61,7 @@ C++ standard: <blockquote>
     
     <hr>
     <p>
-    (C) Copyright Thorsten Ottosen 2003-2006. Use, modification and distribution is subject to the Boost Software License, Version 1.0.
+    (C) Copyright Thorsten Ottosen 2003-2006
     </p>
 
     <br>
diff --git a/doc/intro.html b/doc/intro.html
index a2a6701..8478d3e 100755
--- a/doc/intro.html
+++ b/doc/intro.html
@@ -35,16 +35,14 @@
     enough functionality to satisfy the needs of the generic code
     <i>if a suitable layer of indirection is applied </i>.  For
     example, raw arrays are often suitable for use with generic code that
-    works with containers, provided a suitable adapter is used. Likewise, null
-    terminated strings can be treated as containers of characters, if suitably
-    adapted.
+    works with containers, provided a suitable adapter is used. 
     </p>
 
     <p>
      This library therefore provides the means to adapt standard-like
-     containers,
-    null terminated strings, <code>std::pairs</code> of iterators, and raw
-    arrays (and more), such that the same generic code can work with them all.
+     containers, <code>std::pairs</code> of iterators, and raw arrays (and 
+     more), such that
+    the same generic code can work with them all.
 The basic idea is to add another layer of indirection using <a
 href="../../mpl/doc/refmanual/metafunction.html">metafunctions</a> and
 free-standing functions so syntactic and/or semantic differences can be removed.
@@ -60,22 +58,14 @@ free-standing functions so syntactic and/or semantic differences can be removed.
             more flexible, compact and maintainable client code
         </li>
         <li  >
-            correct handling of null-terminated strings
-            <p>
-            <b>Warning:</b><i> support for null-terminated strings is deprecated and will
-              disappear in the next Boost release (1.34). </i>
-             </p>
+        safe use of built-in arrays
         </li>
-        <li  >
-        safe use of built-in arrays (for legacy code; why else would you use
-        built-in arrays?) </li>
 
     </ul>
     </p>
     <p  >
-    Below are given a small example (the complete example can be found <a href="../test/algorithm_example.cpp" target="_self" >here</a>
-    ):
-    <blockquote>
+    Below are given a small example (the complete example can be found <a 
+    href="../test/algorithm_example.cpp" target="_self" >here</a>): <blockquote>
         <pre  >
 <span class=comment>
     //
@@ -89,7 +79,7 @@ free-standing functions so syntactic and/or semantic differences can be removed.
     </span><span class=special>}
 
     </span><span class=keyword>template</span><span class=special>&lt; </span><span class=keyword>class </span><span class=identifier>ForwardReadableRange</span><span class=special>, </span><span class=keyword>class </span><span class=identifier>T </span><span class=special>&gt;
-    </span><span class=keyword>inline </span><span class=keyword>typename </span><span class=identifier>boost</span><span class=special>::</span><span class=identifier>range_const_iterator</span><span class=special>&lt; </span><span
+    </span><span class=keyword>inline </span><span class=keyword>typename </span><span class=identifier>boost</span><span class=special>::</span><span class=identifier>range_iterator</span><span class=special>&lt; </span><span class=keyword>const </span><span
 class=identifier>ForwardReadableRange </span><span class=special>&gt;::</span><span class=identifier>type
     </span><span class=identifier>find</span><span class=special>( </span><span class=keyword>const </span><span class=identifier>ForwardReadableRange</span><span class=special>&amp; </span><span class=identifier>c</span><span class=special>, </span><span class=keyword>const </span><span class=identifier>T</span><span class=special>&amp; </span><span class=identifier>value </span><span class=special>)
     </span><span class=special>{
@@ -100,7 +90,7 @@ class=identifier>ForwardReadableRange </span><span class=special>&gt;::</span><s
     // replace first value and return its index
     //
     </span><span class=keyword>template</span><span class=special>&lt; </span><span class=keyword>class </span><span class=identifier>ForwardReadableWriteableRange</span><span class=special>, </span><span class=keyword>class </span><span class=identifier>T </span><span class=special>&gt;
-    </span><span class=keyword>inline </span><span class=keyword>typename </span><span class=identifier>boost</span><span class=special>::</span><span class=identifier>range_size</span><span class=special>&lt; </span><span class=identifier>ForwardReadableWriteableRange </span><span class=special>&gt;::</span><span class=identifier>type
+    </span><span class=keyword>inline </span><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>ForwardReadableWriteableRange </span><span class=special>&gt;::</span><span class=identifier>type
     </span><span class=identifier>my_generic_replace</span><span class=special>( </span><span class=identifier>ForwardReadableWriteableRange</span><span class=special>&amp; </span><span class=identifier>c</span><span class=special>, </span><span class=keyword>const </span><span class=identifier>T</span><span class=special>&amp; </span><span class=identifier>value</span><span class=special>, </span><span class=keyword>const </span><span class=identifier>T</span><span class=special>&amp; </span><span class=identifier>replacement </span><span class=special>)
     </span><span class=special>{
        </span><span class=keyword>typename </span><span class=identifier>boost</span><span class=special>::</span><span class=identifier>range_iterator</span><span class=special>&lt; </span><span class=identifier>ForwardReadableWriteableRange </span><span class=special>&gt;::</span><span class=identifier>type </span><span class=identifier>found </span><span class=special>= </span><span class=identifier>find</span><span class=special>( </span><span class=identifier>c</span><span class=special>, </span><span class=identifier>value </span><span class=special>);
@@ -146,7 +136,7 @@ Notice that we have to
 
     <hr>
     <p>
-    (C) Copyright Thorsten Ottosen 2003-2004. Use, modification and distribution is subject to the Boost Software License, Version 1.0.
+    (C) Copyright Thorsten Ottosen 2003-2007
     </p>
 
     <br>
diff --git a/doc/mfc_atl.html b/doc/mfc_atl.html
new file mode 100644
index 0000000..a022fe3
--- /dev/null
+++ b/doc/mfc_atl.html
@@ -0,0 +1,581 @@
+<?xml version="1.0" encoding="utf-8" ?>
+<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "http://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd">
+<html xmlns="http://www.w3.org/1999/xhtml" xml:lang="en" lang="en">
+<head>
+<meta http-equiv="Content-Type" content="text/html; charset=utf-8" />
+<meta name="generator" content="Docutils 0.3.10: http://docutils.sourceforge.net/" />
+<title>Boost Range MFC/ATL Extension</title>
+<meta name="author" content="Shunsuke Sogame" />
+<meta name="date" content="26th of May 2006" />
+<meta name="copyright" content="Shunsuke Sogame 2005-2006. Use, modification and distribution is subject to the Boost Software License, Version 1.0 (see LICENSE_1_0.txt)." />
+<style type="text/css">
+
+/*
+:Author: David Goodger
+:Contact: goodger@users.sourceforge.net
+:Date: $Date: 2005-09-25 17:49:54 +0200 (Sun, 25 Sep 2005) $
+:Revision: $Revision: 3901 $
+:Copyright: This stylesheet has been placed in the public domain.
+
+Default cascading style sheet for the HTML output of Docutils.
+
+See http://docutils.sf.net/docs/howto/html-stylesheets.html for how to
+customize this style sheet.
+*/
+
+/* "! important" is used here to override other ``margin-top`` and
+   ``margin-bottom`` styles that are later in the stylesheet or 
+   more specific.  See http://www.w3.org/TR/CSS1#the-cascade */
+.first {
+  margin-top: 0 ! important }
+
+.last, .with-subtitle {
+  margin-bottom: 0 ! important }
+
+.hidden {
+  display: none }
+
+a.toc-backref {
+  text-decoration: none ;
+  color: black }
+
+blockquote.epigraph {
+  margin: 2em 5em ; }
+
+dl.docutils dd {
+  margin-bottom: 0.5em }
+
+/* Uncomment (and remove this text!) to get bold-faced definition list terms
+dl.docutils dt {
+  font-weight: bold }
+*/
+
+div.abstract {
+  margin: 2em 5em }
+
+div.abstract p.topic-title {
+  font-weight: bold ;
+  text-align: center }
+
+div.admonition, div.attention, div.caution, div.danger, div.error,
+div.hint, div.important, div.note, div.tip, div.warning {
+  margin: 2em ;
+  border: medium outset ;
+  padding: 1em }
+
+div.admonition p.admonition-title, div.hint p.admonition-title,
+div.important p.admonition-title, div.note p.admonition-title,
+div.tip p.admonition-title {
+  font-weight: bold ;
+  font-family: sans-serif }
+
+div.attention p.admonition-title, div.caution p.admonition-title,
+div.danger p.admonition-title, div.error p.admonition-title,
+div.warning p.admonition-title {
+  color: red ;
+  font-weight: bold ;
+  font-family: sans-serif }
+
+/* Uncomment (and remove this text!) to get reduced vertical space in
+   compound paragraphs.
+div.compound .compound-first, div.compound .compound-middle {
+  margin-bottom: 0.5em }
+
+div.compound .compound-last, div.compound .compound-middle {
+  margin-top: 0.5em }
+*/
+
+div.dedication {
+  margin: 2em 5em ;
+  text-align: center ;
+  font-style: italic }
+
+div.dedication p.topic-title {
+  font-weight: bold ;
+  font-style: normal }
+
+div.figure {
+  margin-left: 2em }
+
+div.footer, div.header {
+  clear: both;
+  font-size: smaller }
+
+div.line-block {
+  display: block ;
+  margin-top: 1em ;
+  margin-bottom: 1em }
+
+div.line-block div.line-block {
+  margin-top: 0 ;
+  margin-bottom: 0 ;
+  margin-left: 1.5em }
+
+div.sidebar {
+  margin-left: 1em ;
+  border: medium outset ;
+  padding: 1em ;
+  background-color: #ffffee ;
+  width: 40% ;
+  float: right ;
+  clear: right }
+
+div.sidebar p.rubric {
+  font-family: sans-serif ;
+  font-size: medium }
+
+div.system-messages {
+  margin: 5em }
+
+div.system-messages h1 {
+  color: red }
+
+div.system-message {
+  border: medium outset ;
+  padding: 1em }
+
+div.system-message p.system-message-title {
+  color: red ;
+  font-weight: bold }
+
+div.topic {
+  margin: 2em }
+
+h1.section-subtitle, h2.section-subtitle, h3.section-subtitle,
+h4.section-subtitle, h5.section-subtitle, h6.section-subtitle {
+  margin-top: 0.4em }
+
+h1.title {
+  text-align: center }
+
+h2.subtitle {
+  text-align: center }
+
+hr.docutils {
+  width: 75% }
+
+img.align-left {
+  clear: left }
+
+img.align-right {
+  clear: right }
+
+img.borderless {
+  border: 0 }
+
+ol.simple, ul.simple {
+  margin-bottom: 1em }
+
+ol.arabic {
+  list-style: decimal }
+
+ol.loweralpha {
+  list-style: lower-alpha }
+
+ol.upperalpha {
+  list-style: upper-alpha }
+
+ol.lowerroman {
+  list-style: lower-roman }
+
+ol.upperroman {
+  list-style: upper-roman }
+
+p.attribution {
+  text-align: right ;
+  margin-left: 50% }
+
+p.caption {
+  font-style: italic }
+
+p.credits {
+  font-style: italic ;
+  font-size: smaller }
+
+p.label {
+  white-space: nowrap }
+
+p.rubric {
+  font-weight: bold ;
+  font-size: larger ;
+  color: maroon ;
+  text-align: center }
+
+p.sidebar-title {
+  font-family: sans-serif ;
+  font-weight: bold ;
+  font-size: larger }
+
+p.sidebar-subtitle {
+  font-family: sans-serif ;
+  font-weight: bold }
+
+p.topic-title {
+  font-weight: bold }
+
+pre.address {
+  margin-bottom: 0 ;
+  margin-top: 0 ;
+  font-family: serif ;
+  font-size: 100% }
+
+pre.line-block {
+  font-family: serif ;
+  font-size: 100% }
+
+pre.literal-block, pre.doctest-block {
+  margin-left: 2em ;
+  margin-right: 2em ;
+  background-color: #eeeeee }
+
+span.classifier {
+  font-family: sans-serif ;
+  font-style: oblique }
+
+span.classifier-delimiter {
+  font-family: sans-serif ;
+  font-weight: bold }
+
+span.interpreted {
+  font-family: sans-serif }
+
+span.option {
+  white-space: nowrap }
+
+span.pre {
+  white-space: pre }
+
+span.problematic {
+  color: red }
+
+span.section-subtitle {
+  /* font-size relative to parent (h1..h6 element) */
+  font-size: 80% }
+
+table.citation {
+  border-left: solid thin gray }
+
+table.docinfo {
+  margin: 2em 4em }
+
+table.docutils {
+  margin-top: 0.5em ;
+  margin-bottom: 0.5em }
+
+table.footnote {
+  border-left: solid thin black }
+
+table.docutils td, table.docutils th,
+table.docinfo td, table.docinfo th {
+  padding-left: 0.5em ;
+  padding-right: 0.5em ;
+  vertical-align: top }
+
+table.docutils th.field-name, table.docinfo th.docinfo-name {
+  font-weight: bold ;
+  text-align: left ;
+  white-space: nowrap ;
+  padding-left: 0 }
+
+h1 tt.docutils, h2 tt.docutils, h3 tt.docutils,
+h4 tt.docutils, h5 tt.docutils, h6 tt.docutils {
+  font-size: 100% }
+
+tt.docutils {
+  background-color: #eeeeee }
+
+ul.auto-toc {
+  list-style-type: none }
+
+</style>
+</head>
+<body>
+<div class="document" id="boost-range-mfc-atl-extension">
+<h1 class="title"><img alt="Boost" src="http://www.boost.org/libs/ptr_container/doc/boost.png" /> Range MFC/ATL Extension</h1>
+<table class="docinfo" frame="void" rules="none">
+<col class="docinfo-name" />
+<col class="docinfo-content" />
+<tbody valign="top">
+<tr><th class="docinfo-name">Author:</th>
+<td>Shunsuke Sogame</td></tr>
+<tr><th class="docinfo-name">Contact:</th>
+<td><a class="first last reference" href="mailto:mb2act&#64;yahoo.co.jp">mb2act&#64;yahoo.co.jp</a></td></tr>
+<tr><th class="docinfo-name">Date:</th>
+<td>26th of May 2006</td></tr>
+<tr><th class="docinfo-name">Copyright:</th>
+<td>Shunsuke Sogame 2005-2006. Use, modification and distribution is subject to the Boost Software License, Version 1.0 (see <a class="reference" href="http://www.boost.org/LICENSE_1_0.txt">LICENSE_1_0.txt</a>).</td></tr>
+</tbody>
+</table>
+<div class="section">
+<h1><a id="overview" name="overview">Overview</a></h1>
+<p>Boost.Range MFC/ATL Extension provides <a class="reference" href="../index.html">Boost.Range</a> support for MFC/ATL collection and string types.</p>
+<pre class="literal-block">
+CTypedPtrArray&lt;CPtrArray, CList&lt;CString&gt; *&gt; myArray;
+...
+BOOST_FOREACH (CList&lt;CString&gt; *theList, myArray)
+{
+    BOOST_FOREACH (CString&amp; str, *theList)
+    {
+        boost::to_upper(str);
+        std::sort(boost::begin(str), boost::end(str));
+        ...
+    }
+}
+</pre>
+<ul class="simple">
+<li><a class="reference" href="#requirements">Requirements</a></li>
+<li><a class="reference" href="#mfc-ranges">MFC Ranges</a></li>
+<li><a class="reference" href="#atl-ranges">ATL Ranges</a></li>
+<li><a class="reference" href="#const-ranges">const Ranges</a></li>
+<li><a class="reference" href="#references">References</a></li>
+</ul>
+</div>
+<div class="section">
+<h1><a id="requirements" name="requirements">Requirements</a></h1>
+<ul class="simple">
+<li><a class="reference" href="http://www.boost.org/">Boost C++ Libraries Version 1.34.0</a> or later (no compilation required)</li>
+<li>Visual C++ 7.1 or Visual C++ 8.0</li>
+</ul>
+</div>
+<div class="section">
+<h1><a id="mfc-ranges" name="mfc-ranges">MFC Ranges</a></h1>
+<p>If the <tt class="docutils literal"><span class="pre">&lt;boost/range/mfc.hpp&gt;</span></tt> is included before or after <a class="reference" href="../index.html">Boost.Range</a> headers,
+the MFC collections and strings become models of Range.
+The table below lists the Traversal Category and <tt class="docutils literal"><span class="pre">range_reference</span></tt> of MFC ranges.</p>
+<table border="1" class="docutils">
+<colgroup>
+<col width="34%" />
+<col width="21%" />
+<col width="45%" />
+</colgroup>
+<thead valign="bottom">
+<tr><th class="head"><tt class="docutils literal"><span class="pre">Range</span></tt></th>
+<th class="head">Traversal Category</th>
+<th class="head"><tt class="docutils literal"><span class="pre">range_reference&lt;Range&gt;::type</span></tt></th>
+</tr>
+</thead>
+<tbody valign="top">
+<tr><td><tt class="docutils literal"><span class="pre">CArray&lt;T,A&gt;</span></tt></td>
+<td>Random Access</td>
+<td><tt class="docutils literal"><span class="pre">T&amp;</span></tt></td>
+</tr>
+<tr><td><tt class="docutils literal"><span class="pre">CList&lt;T,A&gt;</span></tt></td>
+<td>Bidirectional</td>
+<td><tt class="docutils literal"><span class="pre">T&amp;</span></tt></td>
+</tr>
+<tr><td><tt class="docutils literal"><span class="pre">CMap&lt;K,AK,M,AM&gt;</span></tt></td>
+<td>Forward</td>
+<td><tt class="docutils literal"><span class="pre">Range::CPair&amp;</span></tt></td>
+</tr>
+<tr><td><tt class="docutils literal"><span class="pre">CTypedPtrArray&lt;B,T*&gt;</span></tt></td>
+<td>Random Access</td>
+<td><tt class="docutils literal"><span class="pre">T*</span> <span class="pre">const</span></tt></td>
+</tr>
+<tr><td><tt class="docutils literal"><span class="pre">CTypedPtrList&lt;B,T*&gt;</span></tt></td>
+<td>Bidirectional</td>
+<td><tt class="docutils literal"><span class="pre">T*</span> <span class="pre">const</span></tt></td>
+</tr>
+<tr><td><tt class="docutils literal"><span class="pre">CTypedPtrMap&lt;B,T*,V*&gt;</span></tt></td>
+<td>Forward</td>
+<td><tt class="docutils literal"><span class="pre">std::pair&lt;T*,V*&gt;</span> <span class="pre">const</span></tt></td>
+</tr>
+<tr><td><tt class="docutils literal"><span class="pre">CByteArray</span></tt></td>
+<td>Random Access</td>
+<td><tt class="docutils literal"><span class="pre">BYTE&amp;</span></tt></td>
+</tr>
+<tr><td><tt class="docutils literal"><span class="pre">CDWordArray</span></tt></td>
+<td>Random Access</td>
+<td><tt class="docutils literal"><span class="pre">DWORD&amp;</span></tt></td>
+</tr>
+<tr><td><tt class="docutils literal"><span class="pre">CObArray</span></tt></td>
+<td>Random Access</td>
+<td><tt class="docutils literal"><span class="pre">CObject*</span> <span class="pre">&amp;</span></tt></td>
+</tr>
+<tr><td><tt class="docutils literal"><span class="pre">CPtrArray</span></tt></td>
+<td>Random Access</td>
+<td><tt class="docutils literal"><span class="pre">void*</span> <span class="pre">&amp;</span></tt></td>
+</tr>
+<tr><td><tt class="docutils literal"><span class="pre">CStringArray</span></tt></td>
+<td>Random Access</td>
+<td><tt class="docutils literal"><span class="pre">CString&amp;</span></tt></td>
+</tr>
+<tr><td><tt class="docutils literal"><span class="pre">CUIntArray</span></tt></td>
+<td>Random Access</td>
+<td><tt class="docutils literal"><span class="pre">UINT&amp;</span></tt></td>
+</tr>
+<tr><td><tt class="docutils literal"><span class="pre">CWordArray</span></tt></td>
+<td>Random Access</td>
+<td><tt class="docutils literal"><span class="pre">WORD&amp;</span></tt></td>
+</tr>
+<tr><td><tt class="docutils literal"><span class="pre">CObList</span></tt></td>
+<td>Bidirectional</td>
+<td><tt class="docutils literal"><span class="pre">CObject*</span> <span class="pre">&amp;</span></tt></td>
+</tr>
+<tr><td><tt class="docutils literal"><span class="pre">CPtrList</span></tt></td>
+<td>Bidirectional</td>
+<td><tt class="docutils literal"><span class="pre">void*</span> <span class="pre">&amp;</span></tt></td>
+</tr>
+<tr><td><tt class="docutils literal"><span class="pre">CStringList</span></tt></td>
+<td>Bidirectional</td>
+<td><tt class="docutils literal"><span class="pre">CString&amp;</span></tt></td>
+</tr>
+<tr><td><tt class="docutils literal"><span class="pre">CMapPtrToWord</span></tt></td>
+<td>Forward</td>
+<td><tt class="docutils literal"><span class="pre">std::pair&lt;void*,WORD&gt;</span> <span class="pre">const</span></tt></td>
+</tr>
+<tr><td><tt class="docutils literal"><span class="pre">CMapPtrToPtr</span></tt></td>
+<td>Forward</td>
+<td><tt class="docutils literal"><span class="pre">std::pair&lt;void*,void*&gt;</span> <span class="pre">const</span></tt></td>
+</tr>
+<tr><td><tt class="docutils literal"><span class="pre">CMapStringToOb</span></tt></td>
+<td>Forward</td>
+<td><tt class="docutils literal"><span class="pre">std::pair&lt;String,CObject*&gt;</span> <span class="pre">const</span></tt></td>
+</tr>
+<tr><td><tt class="docutils literal"><span class="pre">CMapStringToString</span></tt></td>
+<td>Forward</td>
+<td><tt class="docutils literal"><span class="pre">Range::CPair&amp;</span></tt></td>
+</tr>
+<tr><td><tt class="docutils literal"><span class="pre">CMapWordToOb</span></tt></td>
+<td>Forward</td>
+<td><tt class="docutils literal"><span class="pre">std::pair&lt;WORD,CObject*&gt;</span> <span class="pre">const</span></tt></td>
+</tr>
+<tr><td><tt class="docutils literal"><span class="pre">CMapWordToPtr</span></tt></td>
+<td>Forward</td>
+<td><tt class="docutils literal"><span class="pre">std::pair&lt;WORD,void*&gt;</span> <span class="pre">const</span></tt></td>
+</tr>
+</tbody>
+</table>
+<p>Other <a class="reference" href="../index.html">Boost.Range</a> metafunctions are defined by the following.
+Let <tt class="docutils literal"><span class="pre">Range</span></tt> be any type listed above and <tt class="docutils literal"><span class="pre">ReF</span></tt> be the same as <tt class="docutils literal"><span class="pre">range_reference&lt;Range&gt;::type</span></tt>.
+<tt class="docutils literal"><span class="pre">range_value&lt;Range&gt;::type</span></tt> is the same as <tt class="docutils literal"><span class="pre">remove_reference&lt;remove_const&lt;Ref&gt;::type&gt;::type</span></tt>,
+<tt class="docutils literal"><span class="pre">range_difference&lt;Range&gt;::type</span></tt> is the same as <tt class="docutils literal"><span class="pre">std::ptrdiff_t</span></tt>, and
+<tt class="docutils literal"><span class="pre">range_pointer&lt;Range&gt;::type</span></tt> is the same as <tt class="docutils literal"><span class="pre">add_pointer&lt;remove_reference&lt;Ref&gt;::type&gt;::type</span></tt>.
+As for <tt class="docutils literal"><span class="pre">const</span> <span class="pre">Range</span></tt>, see <a class="reference" href="#const-ranges">const Ranges</a>.</p>
+</div>
+<div class="section">
+<h1><a id="atl-ranges" name="atl-ranges">ATL Ranges</a></h1>
+<p>If the <tt class="docutils literal"><span class="pre">&lt;boost/range/atl.hpp&gt;</span></tt> is included before or after <a class="reference" href="../index.html">Boost.Range</a> headers,
+the ATL collections and strings become models of Range.
+The table below lists the Traversal Category and <tt class="docutils literal"><span class="pre">range_reference</span></tt> of ATL ranges.</p>
+<table border="1" class="docutils">
+<colgroup>
+<col width="34%" />
+<col width="21%" />
+<col width="45%" />
+</colgroup>
+<thead valign="bottom">
+<tr><th class="head"><tt class="docutils literal"><span class="pre">Range</span></tt></th>
+<th class="head">Traversal Category</th>
+<th class="head"><tt class="docutils literal"><span class="pre">range_reference&lt;Range&gt;::type</span></tt></th>
+</tr>
+</thead>
+<tbody valign="top">
+<tr><td><tt class="docutils literal"><span class="pre">CAtlArray&lt;E,ET&gt;</span></tt></td>
+<td>Random Access</td>
+<td><tt class="docutils literal"><span class="pre">E&amp;</span></tt></td>
+</tr>
+<tr><td><tt class="docutils literal"><span class="pre">CAutoPtrArray&lt;E&gt;</span></tt></td>
+<td>Random Access</td>
+<td><tt class="docutils literal"><span class="pre">E&amp;</span></tt></td>
+</tr>
+<tr><td><tt class="docutils literal"><span class="pre">CInterfaceArray&lt;I,pi&gt;</span></tt></td>
+<td>Random Access</td>
+<td><tt class="docutils literal"><span class="pre">CComQIPtr&lt;I,pi&gt;&amp;</span></tt></td>
+</tr>
+<tr><td><tt class="docutils literal"><span class="pre">CAtlList&lt;E,ET&gt;</span></tt></td>
+<td>Bidirectional</td>
+<td><tt class="docutils literal"><span class="pre">E&amp;</span></tt></td>
+</tr>
+<tr><td><tt class="docutils literal"><span class="pre">CAutoPtrList&lt;E&gt;</span></tt></td>
+<td>Bidirectional</td>
+<td><tt class="docutils literal"><span class="pre">E&amp;</span></tt></td>
+</tr>
+<tr><td><tt class="docutils literal"><span class="pre">CHeapPtrList&lt;E,A&gt;</span></tt></td>
+<td>Bidirectional</td>
+<td><tt class="docutils literal"><span class="pre">E&amp;</span></tt></td>
+</tr>
+<tr><td><tt class="docutils literal"><span class="pre">CInterfaceList&lt;I,pi&gt;</span></tt></td>
+<td>Bidirectional</td>
+<td><tt class="docutils literal"><span class="pre">CComQIPtr&lt;I,pi&gt;&amp;</span></tt></td>
+</tr>
+<tr><td><tt class="docutils literal"><span class="pre">CAtlMap&lt;K,V,KT,VT&gt;</span></tt></td>
+<td>Forward</td>
+<td><tt class="docutils literal"><span class="pre">Range::CPair&amp;</span></tt></td>
+</tr>
+<tr><td><tt class="docutils literal"><span class="pre">CRBTree&lt;K,V,KT,VT&gt;</span></tt></td>
+<td>Bidirectional</td>
+<td><tt class="docutils literal"><span class="pre">Range::CPair&amp;</span></tt></td>
+</tr>
+<tr><td><tt class="docutils literal"><span class="pre">CRBMap&lt;K,V,KT,VT&gt;</span></tt></td>
+<td>Bidirectional</td>
+<td><tt class="docutils literal"><span class="pre">Range::CPair&amp;</span></tt></td>
+</tr>
+<tr><td><tt class="docutils literal"><span class="pre">CRBMultiMap&lt;K,V,KT,VT&gt;</span></tt></td>
+<td>Bidirectional</td>
+<td><tt class="docutils literal"><span class="pre">Range::CPair&amp;</span></tt></td>
+</tr>
+<tr><td><tt class="docutils literal"><span class="pre">CSimpleStringT&lt;B,b&gt;</span></tt></td>
+<td>Random Access</td>
+<td><tt class="docutils literal"><span class="pre">B&amp;</span></tt></td>
+</tr>
+<tr><td><tt class="docutils literal"><span class="pre">CStringT&lt;B,ST&gt;</span></tt></td>
+<td>Random Access</td>
+<td><tt class="docutils literal"><span class="pre">B&amp;</span></tt></td>
+</tr>
+<tr><td><tt class="docutils literal"><span class="pre">CFixedStringT&lt;S,n&gt;</span></tt></td>
+<td>Random Access</td>
+<td><tt class="docutils literal"><span class="pre">range_reference&lt;S&gt;::type</span></tt></td>
+</tr>
+<tr><td><tt class="docutils literal"><span class="pre">CStringT&lt;B,ST&gt;</span></tt></td>
+<td>Random Access</td>
+<td><tt class="docutils literal"><span class="pre">B&amp;</span></tt></td>
+</tr>
+<tr><td><tt class="docutils literal"><span class="pre">CComBSTR</span></tt></td>
+<td>Random Access</td>
+<td><tt class="docutils literal"><span class="pre">OLECHAR&amp;</span></tt></td>
+</tr>
+<tr><td><tt class="docutils literal"><span class="pre">CSimpleArray&lt;T,TE&gt;</span></tt></td>
+<td>Random Access</td>
+<td><tt class="docutils literal"><span class="pre">T&amp;</span></tt></td>
+</tr>
+</tbody>
+</table>
+<p>Other <a class="reference" href="../index.html">Boost.Range</a> metafunctions are defined by the following.
+Let <tt class="docutils literal"><span class="pre">Range</span></tt> be any type listed above and <tt class="docutils literal"><span class="pre">ReF</span></tt> be the same as <tt class="docutils literal"><span class="pre">range_reference&lt;Range&gt;::type</span></tt>.
+<tt class="docutils literal"><span class="pre">range_value&lt;Range&gt;::type</span></tt> is the same as <tt class="docutils literal"><span class="pre">remove_reference&lt;Ref&gt;::type</span></tt>,
+<tt class="docutils literal"><span class="pre">range_difference&lt;Range&gt;::type</span></tt> is the same as <tt class="docutils literal"><span class="pre">std::ptrdiff_t</span></tt>, and
+<tt class="docutils literal"><span class="pre">range_pointer&lt;Range&gt;::type</span></tt> is the same as <tt class="docutils literal"><span class="pre">add_pointer&lt;remove_reference&lt;Ref&gt;::type&gt;::type</span></tt>.
+As for <tt class="docutils literal"><span class="pre">const</span> <span class="pre">Range</span></tt>, see <a class="reference" href="#const-ranges">const Ranges</a>.</p>
+</div>
+<div class="section">
+<h1><a id="const-ranges" name="const-ranges">const Ranges</a></h1>
+<p><tt class="docutils literal"><span class="pre">range_reference&lt;const</span> <span class="pre">Range&gt;::type</span></tt> is defined by the following algorithm.
+Let <tt class="docutils literal"><span class="pre">Range</span></tt> be any type listed above and <tt class="docutils literal"><span class="pre">ReF</span></tt> be the same as <tt class="docutils literal"><span class="pre">range_reference&lt;Range&gt;::type</span></tt>.</p>
+<pre class="literal-block">
+if (Range is CObArray || Range is CObList)
+    return CObject const * &amp;
+else if (Range is CPtrArray || Range is CPtrList)
+    return void const * &amp;
+else if (there is a type X such that X&amp; is the same as ReF)
+    return X const &amp;
+else if (there is a type X such that X* const is the same as ReF)
+    return X const * const
+else
+    return ReF
+</pre>
+<p>Other <a class="reference" href="../index.html">Boost.Range</a> metafunctions are defined by the following.
+<tt class="docutils literal"><span class="pre">range_value&lt;const</span> <span class="pre">Range&gt;::type</span></tt> is the same as <tt class="docutils literal"><span class="pre">range_value&lt;Range&gt;::type</span></tt>,
+<tt class="docutils literal"><span class="pre">range_difference&lt;const</span> <span class="pre">Range&gt;::type</span></tt> is the same as <tt class="docutils literal"><span class="pre">std::ptrdiff_t</span></tt>, and
+<tt class="docutils literal"><span class="pre">range_pointer&lt;const</span> <span class="pre">Range&gt;::type</span></tt> is the same as <tt class="docutils literal"><span class="pre">add_pointer&lt;remove_reference&lt;range_reference&lt;const</span> <span class="pre">Range&gt;::type&gt;::type&gt;::type</span></tt>.</p>
+</div>
+<div class="section">
+<h1><a id="references" name="references">References</a></h1>
+<ul class="simple">
+<li><a class="reference" href="../index.html">Boost.Range</a></li>
+<li><a class="reference" href="http://msdn2.microsoft.com/en-us/library/942860sh.aspx">MFC Collections</a></li>
+<li><a class="reference" href="http://msdn2.microsoft.com/en-US/library/15e672bd.aspx">ATL Collection Classes</a></li>
+</ul>
+</div>
+</div>
+</body>
+</html>
diff --git a/doc/mfc_atl.rst b/doc/mfc_atl.rst
new file mode 100644
index 0000000..67498fb
--- /dev/null
+++ b/doc/mfc_atl.rst
@@ -0,0 +1,232 @@
+
+++++++++++++++++++++++++++++++++
+ |Boost| Range MFC/ATL Extension
+++++++++++++++++++++++++++++++++
+
+.. |Boost| image:: http://www.boost.org/libs/ptr_container/doc/boost.png
+
+
+
+:Author:        Shunsuke Sogame
+:Contact:       mb2act@yahoo.co.jp
+:date:          26th of May 2006
+:copyright:     Shunsuke Sogame 2005-2006. Use, modification and distribution is subject to the Boost Software License, Version 1.0 (see LICENSE_1_0.txt__).
+
+__ http://www.boost.org/LICENSE_1_0.txt
+
+
+
+========
+Overview
+========
+
+Boost.Range MFC/ATL Extension provides `Boost.Range`_ support for MFC/ATL collection and string types.
+
+
+.. parsed-literal::
+
+        CTypedPtrArray<CPtrArray, CList<CString> \*> myArray;
+        ...
+        BOOST_FOREACH (CList<CString> \*theList, myArray)
+        {
+            BOOST_FOREACH (CString& str, \*theList)
+            {
+                boost::to_upper(str);
+                std::sort(boost::begin(str), boost::end(str));
+                ...
+            }
+        }
+
+
+
+* `Requirements`_
+* `MFC Ranges`_
+* `ATL Ranges`_
+* `const Ranges`_
+* `References`_
+
+
+
+============
+Requirements
+============
+
+- `Boost C++ Libraries Version 1.34.0`__ or later (no compilation required)
+- Visual C++ 7.1 or Visual C++ 8.0
+
+__ Boost_
+
+
+
+==========
+MFC Ranges
+==========
+
+If the ``<boost/range/mfc.hpp>`` is included before or after `Boost.Range`_ headers,
+the MFC collections and strings become models of Range.
+The table below lists the Traversal Category and ``range_reference`` of MFC ranges.
+
+
+============================= ================== =======================================
+``Range``                     Traversal Category ``range_reference<Range>::type``
+============================= ================== =======================================
+``CArray<T,A>``               Random Access      ``T&``
+----------------------------- ------------------ ---------------------------------------
+``CList<T,A>``                Bidirectional      ``T&``
+----------------------------- ------------------ ---------------------------------------
+``CMap<K,AK,M,AM>``           Forward            ``Range::CPair&``
+----------------------------- ------------------ ---------------------------------------
+``CTypedPtrArray<B,T*>``      Random Access      ``T* const``
+----------------------------- ------------------ ---------------------------------------
+``CTypedPtrList<B,T*>``       Bidirectional      ``T* const``
+----------------------------- ------------------ ---------------------------------------
+``CTypedPtrMap<B,T*,V*>``     Forward            ``std::pair<T*,V*> const``
+----------------------------- ------------------ ---------------------------------------
+``CByteArray``                Random Access      ``BYTE&``
+----------------------------- ------------------ ---------------------------------------
+``CDWordArray``               Random Access      ``DWORD&``
+----------------------------- ------------------ ---------------------------------------
+``CObArray``                  Random Access      ``CObject* &``
+----------------------------- ------------------ ---------------------------------------
+``CPtrArray``                 Random Access      ``void* &``
+----------------------------- ------------------ ---------------------------------------
+``CStringArray``              Random Access      ``CString&``
+----------------------------- ------------------ ---------------------------------------
+``CUIntArray``                Random Access      ``UINT&``
+----------------------------- ------------------ ---------------------------------------
+``CWordArray``                Random Access      ``WORD&``
+----------------------------- ------------------ ---------------------------------------
+``CObList``                   Bidirectional      ``CObject* &``
+----------------------------- ------------------ ---------------------------------------
+``CPtrList``                  Bidirectional      ``void* &``
+----------------------------- ------------------ ---------------------------------------
+``CStringList``               Bidirectional      ``CString&``
+----------------------------- ------------------ ---------------------------------------
+``CMapPtrToWord``             Forward            ``std::pair<void*,WORD> const``
+----------------------------- ------------------ ---------------------------------------
+``CMapPtrToPtr``              Forward            ``std::pair<void*,void*> const``
+----------------------------- ------------------ ---------------------------------------
+``CMapStringToOb``            Forward            ``std::pair<String,CObject*> const``
+----------------------------- ------------------ ---------------------------------------
+``CMapStringToString``        Forward            ``Range::CPair&``
+----------------------------- ------------------ ---------------------------------------
+``CMapWordToOb``              Forward            ``std::pair<WORD,CObject*> const``
+----------------------------- ------------------ ---------------------------------------
+``CMapWordToPtr``             Forward            ``std::pair<WORD,void*> const``
+============================= ================== =======================================
+
+
+Other `Boost.Range`_ metafunctions are defined by the following.
+Let ``Range`` be any type listed above and ``ReF`` be the same as ``range_reference<Range>::type``.
+``range_value<Range>::type`` is the same as ``remove_reference<remove_const<Ref>::type>::type``,
+``range_difference<Range>::type`` is the same as ``std::ptrdiff_t``, and
+``range_pointer<Range>::type`` is the same as ``add_pointer<remove_reference<Ref>::type>::type``.
+As for ``const Range``, see `const Ranges`_.
+
+
+
+==========
+ATL Ranges
+==========
+
+If the ``<boost/range/atl.hpp>`` is included before or after `Boost.Range`_ headers,
+the ATL collections and strings become models of Range.
+The table below lists the Traversal Category and ``range_reference`` of ATL ranges.
+
+
+============================= ================== =======================================
+``Range``                     Traversal Category ``range_reference<Range>::type``
+============================= ================== =======================================
+``CAtlArray<E,ET>``           Random Access      ``E&``
+----------------------------- ------------------ ---------------------------------------
+``CAutoPtrArray<E>``          Random Access      ``E&``
+----------------------------- ------------------ ---------------------------------------
+``CInterfaceArray<I,pi>``     Random Access      ``CComQIPtr<I,pi>&``
+----------------------------- ------------------ ---------------------------------------
+``CAtlList<E,ET>``            Bidirectional      ``E&``
+----------------------------- ------------------ ---------------------------------------
+``CAutoPtrList<E>``           Bidirectional      ``E&``
+----------------------------- ------------------ ---------------------------------------
+``CHeapPtrList<E,A>``         Bidirectional      ``E&``
+----------------------------- ------------------ ---------------------------------------
+``CInterfaceList<I,pi>``      Bidirectional      ``CComQIPtr<I,pi>&``
+----------------------------- ------------------ ---------------------------------------
+``CAtlMap<K,V,KT,VT>``        Forward            ``Range::CPair&``
+----------------------------- ------------------ ---------------------------------------
+``CRBTree<K,V,KT,VT>``        Bidirectional      ``Range::CPair&``
+----------------------------- ------------------ ---------------------------------------
+``CRBMap<K,V,KT,VT>``         Bidirectional      ``Range::CPair&``
+----------------------------- ------------------ ---------------------------------------
+``CRBMultiMap<K,V,KT,VT>``    Bidirectional      ``Range::CPair&``
+----------------------------- ------------------ ---------------------------------------
+``CSimpleStringT<B,b>``       Random Access      ``B&``
+----------------------------- ------------------ ---------------------------------------
+``CStringT<B,ST>``            Random Access      ``B&``
+----------------------------- ------------------ ---------------------------------------
+``CFixedStringT<S,n>``        Random Access      ``range_reference<S>::type``
+----------------------------- ------------------ ---------------------------------------
+``CStringT<B,ST>``            Random Access      ``B&``
+----------------------------- ------------------ ---------------------------------------
+``CComBSTR``                  Random Access      ``OLECHAR&``
+----------------------------- ------------------ ---------------------------------------
+``CSimpleArray<T,TE>``        Random Access      ``T&``
+============================= ================== =======================================
+
+
+Other `Boost.Range`_ metafunctions are defined by the following.
+Let ``Range`` be any type listed above and ``ReF`` be the same as ``range_reference<Range>::type``.
+``range_value<Range>::type`` is the same as ``remove_reference<Ref>::type``,
+``range_difference<Range>::type`` is the same as ``std::ptrdiff_t``, and
+``range_pointer<Range>::type`` is the same as ``add_pointer<remove_reference<Ref>::type>::type``.
+As for ``const Range``, see `const Ranges`_.
+
+
+
+============
+const Ranges
+============
+
+``range_reference<const Range>::type`` is defined by the following algorithm.
+Let ``Range`` be any type listed above and ``ReF`` be the same as ``range_reference<Range>::type``.
+
+
+.. parsed-literal::
+
+    if (Range is CObArray || Range is CObList)
+        return CObject const \* &
+    else if (Range is CPtrArray || Range is CPtrList)
+        return void const \* &
+    else if (there is a type X such that X& is the same as ReF)
+        return X const &
+    else if (there is a type X such that X* const is the same as ReF)
+        return X const \* const
+    else
+        return ReF
+
+
+Other `Boost.Range`_ metafunctions are defined by the following.
+``range_value<const Range>::type`` is the same as ``range_value<Range>::type``,
+``range_difference<const Range>::type`` is the same as ``std::ptrdiff_t``, and
+``range_pointer<const Range>::type`` is the same as ``add_pointer<remove_reference<range_reference<const Range>::type>::type>::type``.
+
+
+
+==========
+References
+==========
+- `Boost.Range`_
+- `MFC Collections`__
+- `ATL Collection Classes`__
+
+__ http://msdn2.microsoft.com/en-us/library/942860sh.aspx
+__ http://msdn2.microsoft.com/en-US/library/15e672bd.aspx
+
+
+
+.. _Boost C++ Libraries: http://www.boost.org/
+.. _Boost: `Boost C++ Libraries`_
+.. _Boost.Range: ../index.html
+.. _forward: range.html#forward_range
+.. _bidirectional: range.html#forward_range
+.. _random access: range.html#random_access_range
+
diff --git a/doc/portability.html b/doc/portability.html
index 2461222..20b1355 100755
--- a/doc/portability.html
+++ b/doc/portability.html
@@ -36,7 +36,7 @@ href="http://boost.sourceforge.net/regression-logs/developer/range.html">here</a
     <p  >
     Notice also that some compilers cannot do function template ordering properly. 
     In that case one must rely of <a
-      href="boost_range.html#range_result_iterator"><code >range_result_iterator</code></a> 
+      href="boost_range.html#range_iterator"><code >range_iterator</code></a> 
       and a single function definition instead of overloaded versions for const and 
       non-const arguments.
 
@@ -75,7 +75,7 @@ href="http://boost.sourceforge.net/regression-logs/developer/range.html">here</a
 
     <hr>
     <p>
-    (C) Copyright Thorsten Ottosen 2003-2004. Use, modification and distribution is subject to the Boost Software License, Version 1.0.
+    (C) Copyright Thorsten Ottosen 2003-2004
     </p>
 
     <br>
diff --git a/doc/range.html b/doc/range.html
index 0fe4c88..dfe9345 100755
--- a/doc/range.html
+++ b/doc/range.html
@@ -50,7 +50,7 @@
                Range provides iterators for accessing a half-open range
 <code>[first,one_past_last)</code> of elements and provides
                information about the number of elements in the Range.  However, a Range has
-               fewer requirements than a Container.
+               <i>much</i> fewer requirements than a Container.
               </p>
               <p>
                The motivation for the Range concept is
@@ -78,9 +78,9 @@
     The operations that can be performed on a Range is dependent on the
     <a href="../../iterator/doc/new-iter-concepts.html#iterator-traversal-concepts-lib-iterator-traversal">traversal
 category</a> of the underlying iterator type. Therefore
-    the range concepts are named to reflect which traversal category its
-    iterators support. See also <a href="style.html">terminology and style guidelines.</a>
-    for more information about naming of ranges.</p>
+    the range concepts are named to reflect which traversal category their 
+    iterators support. See also <a href="style.html">terminology and style 
+    guidelines.</a> for more information about naming of ranges.</p>
 
     <p> The concepts described below specifies associated types as
 <a href="../../mpl/doc/refmanual/metafunction.html">metafunctions</a> and all
@@ -118,11 +118,7 @@ Single Pass Iterator</a>
     <h3>Associated types</h3>
 
     <table border="1" cellpadding="5">
-        <TR>
-            <TD VAlign="top">Value type</TD>
-            <TD VAlign="top"><code>boost::range_value&lt;X>::type</code></TD>
-            <TD VAlign="top">The type of the object stored in a Range.
-        </TR>
+
         <TR>
             <TD VAlign="top">Iterator type</TD>
             <TD VAlign="top"><code>boost::range_iterator&lt;X>::type</code></TD>
@@ -132,7 +128,7 @@ Single Pass Iterator</a>
         </TR>
         <TR>
             <TD VAlign="top">Const iterator type</TD>
-            <TD VAlign="top"><code>boost::range_const_iterator&lt;X>::type</code></TD>
+            <TD VAlign="top"><code>boost::range_iterator&lt;const X>::type</code></TD>
             <TD VAlign="top">A type of iterator that may be used to examine, but not to
             modify, a Range's elements.</TD>
         </TR>
@@ -161,20 +157,16 @@ Single Pass Iterator</a>
             <TD VAlign="top">Beginning of range</TD>
             <TD VAlign="top"><code>boost::begin(a)</code></TD>
             <TD VAlign="top"><code>boost::range_iterator&lt;X>::type</code> if
-<code>a</code> is mutable, <code>boost::range_const_iterator&lt;X>::type</code>
+<code>a</code> is mutable, <code>boost::range_iterator&lt;const X>::type</code>
 otherwise</TD> </TR>
         <TR>
             <TD VAlign="top">End of range</TD>
             <TD VAlign="top"><code>boost::end(a)</code></TD>
             <TD VAlign="top"><code>boost::range_iterator&lt;X>::type</code> if
-<code>a</code> is mutable, <code>boost::range_const_iterator&lt;X>::type</code>
+<code>a</code> is mutable, <code>boost::range_iterator&lt;const X>::type</code>
 otherwise</TD>
         </TR>
-        <tr>
-            <TD VAlign="top">Is range empty?</TD>
-            <TD VAlign="top"><code>boost::empty(a)</code></TD>
-            <TD VAlign="top">Convertible to <code>bool</code></TD>
-        </TR>
+
     </table>
     <h3>Expression semantics</h3>
 
@@ -188,7 +180,7 @@ otherwise</TD>
             <TD VAlign="top"><code>boost::begin(a)</code></TD>
             <TD VAlign="top">Returns an iterator pointing to the first element in the Range.</TD>
             <TD VAlign="top"><code>boost::begin(a)</code> is either dereferenceable or past-the-end. 
-            It is past-the-end if and only if <code>boost::size(a) == 0</code>.</TD>
+            It is past-the-end if and only if <code>boost::distance(a) == 0</code>.</TD>
         </TR>
         <TR>
             <TD VAlign="top"><code>boost::end(a)</code></TD>
@@ -196,19 +188,14 @@ otherwise</TD>
             Range.</TD>
             <TD VAlign="top"><code>boost::end(a)</code> is past-the-end.</TD>
         </TR>
-        <TR>
-            <TD VAlign="top"><code>boost::empty(a)</code></TD>
-            <TD VAlign="top">Equivalent to <code>boost::begin(a) == boost::end(a)</code>. (But possibly 
-            faster.)</TD>
-            <TD VAlign="top">&nbsp;-&nbsp;</TD>
-        </TR>
+ 
     </table>
 
     <h3>Complexity guarantees</h3>
 
-    All three functions are at most amortized linear time. For most practical 
-    purposes, one can expect <code>boost::begin(a)</code>, <code>boost::end(a)</code> and <code>boost::empty(a)</code> 
-    to be amortized constant time.
+    <code>boost::end(a)</code> is at most amortized linear time, <code>boost::begin(a)</code> is
+                                         amortized constant time. For most practical 
+        purposes, one can expect both to be amortized constant time.
 
     <h3>Invariants</h3>
     <Table border>
@@ -227,14 +214,17 @@ otherwise</TD>
 
 
     <h3>See also</h3> 
-            <p>
-            <A href="http://www.sgi.com/Technology/STL/Container.html">Container</A>
-            </p>
-            <p> <a href="boost_range.html#boost::range_value">implementation of
+                                                                     <p><a 
+                                                                     href="boost_range.html#minimal_interface">Extending the library for UDTs </a></p>
+            <p> <a href="boost_range.html#boost::rang_difference">Implementation of
                    metafunctions </a></p>
 
-            <p> <a href="boost_range.html#begin">implementation of 
+            <p> <a href="boost_range.html#begin">Implementation of 
                    functions </a></p>
+                        <p>
+            <A href="http://www.sgi.com/Technology/STL/Container.html">Container</A>
+            </p>
+       
 
     <hr>
     <a  name=forward_range><h2>Forward Range</h2>
@@ -261,76 +251,8 @@ href="../../iterator/doc/new-iter-concepts.html#forward-traversal-iterators-lib-
     <h3>Refinement of</h3> <a href="#single_pass_range">Single Pass 
 Range</a>
             
-    <h3>Associated types</h3>
-
-    <table cellpadding="5" border="1">
-        <TR>
-            <TD VAlign="top">Distance type</TD>
-            <TD VAlign="top"><code>boost::range_difference&lt;X>::type</code></TD>
-            <TD VAlign="top">A signed integral type used to represent the distance between 
-            two of the Range's iterators.  This type must be the same as the iterator's 
-            distance type.</TD>
-        </TR>
-        <TR>
-            <TD VAlign="top">Size type</TD>
-            <TD VAlign="top"><code>boost::range_size&lt;X>::type</code></TD>
-            <TD VAlign="top">An unsigned integral type that can represent any nonnegative 
-            value of the Range's distance type.</TD>
-        </tr>
-    </table>
-
-    <h3>Valid expressions</h3>
-
-    <table border="1" cellpadding="5">
-        <tr>
-            <th>Name</th>
-            <th>Expression</th>
-            <th>Return type</th>
-        </tr>
-        <TR>
-            <TD VAlign="top">Size of range</TD>
-            <TD VAlign="top"><code>boost::size(a)</code></TD>
-            <TD VAlign="top"><code>boost::range_size&lt;X>::type</code></TD>
-        </TR>
-    </table>
-
-    <h3>Expression semantics </h3>
-
-    <table border="1" cellpadding="5">
-        <TR>
-            <TH>Expression</TH>
-            <TH>Semantics</TH>
-            <TH>Postcondition</TH>
-        </TR>
-        <tr>
-            <TD VAlign="top"><code>boost::size(a)</code></TD>
-            <TD VAlign="top">Returns the size of the Range, that is, its number 
-of elements. Note <code>boost::size(a) == 0u</code> is equivalent to 
-<code>boost::empty(a).</code></TD>
-            <TD VAlign="top"><code>boost::size(a) &gt;= 0</TD>
-        </TR>
-    </table>
-
-   <h3>Complexity guarantees</h3>
-
-    <p><code>boost::size(a)</code> is at most amortized linear time.</p>
-
-    <h3>Invariants</h3>
-    <p>
-    <Table border="1" cellpadding="5">
-        <TR>
-            <TD VAlign="top">Range size</TD>
-            <TD VAlign="top"><code>boost::size(a)</code> is equal to the distance from <code>boost::begin(a)</code>
-            to <code>boost::end(a)</code>.</TD> </table>
-    </p>
-    
-        <h3>See also</h3> 
-            <p> <a href="boost_range.html#boost::range_difference">implementation of
-                   metafunctions </a></p>
-
-            <p> <a href="boost_range.html#size">implementation of 
-                   functions </a></p>
-
+  </p>
+  
     <hr>
 
     <a name="bidirectional_range"><h2>Bidirectional Range</h2>
@@ -356,83 +278,8 @@ s-lib-bidirectional-traversal-iterators">Bidirectional Traversal Iterator.</a>
       
     <h3>Refinement of</h3> <a href="#forward_range">Forward Range</a>
 
-    <h3>Associated types</h3>
-
-    <Table border>
-        <TR>
-            <TD VAlign="top">Reverse Iterator type</TD>
-            <TD VAlign="top"><code>boost::range_reverse_iterator&lt;X>::type</code></TD>
-            <TD VAlign="top">The type of iterator used to iterate through a Range's elements 
-            in reverse order.  The iterator's value type is expected to be the Range's value 
-            type.  A conversion from the reverse iterator type to the const reverse iterator 
-            type must exist. </TD>
-        </TR>
-        <TR>
-            <TD VAlign="top">Const reverse iterator type</TD>
-            <TD 
-VAlign="top"><code>boost::range_const_reverse_iterator&ltX>::type</code></TD>
-            <TD VAlign="top">A type of reverse iterator that may be used to examine, but not 
-            to modify, a Range's elements.</TD>
-        </TR>
-    </table>
-
-
-    <h3>Valid expressions</h3>
-
-    <Table border>
-        <TR>
-            <TH>Name</TH>
-            <TH>Expression</TH>
-            <TH>Return type</TH>
-            <TH>Semantics</TH>
-        </TR>
-        <TR>
-            <TD VAlign="top">Beginning of range</TD>
-            <TD VAlign="top"><code>boost::rbegin(a)</code></TD>
-            <TD VAlign="top"><code>boost::range_reverse_iterator&lt;X>::type</code> if
-<code>a</code> is mutable, <code>boost::range_const_reverse_iterator&lt;X>::type</code>
-otherwise.</TD>
-            <TD VAlign="top">Equivalent to 
-<code>boost::range_reverse_iterator&lt;X>::type(boost::end(a))</code>.</TD> </TR>
-        <TR>
-            <TD VAlign="top">End of range</TD>
-            <TD VAlign="top"><code>boost::rend(a)</code></TD>
-            <TD VAlign="top"><code>boost::range_reverse_iterator&lt;X>::type</code> if
-<code>a</code> is mutable, <code>boost::range_const_reverse_iterator&lt;X>::type</code>
-otherwise.</TD>
-            <TD VAlign="top">Equivalent to 
-<code>boost::range_reverse_iterator&lt;X>::type(boost::begin(a))</code>.</TD> </tr>
-
-    </table>
-
-    <h3>Complexity guarantees</h3>
-
-    <code>boost::rbegin(a)</code> has the same complexity as <code>boost::end(a)</code> and <code>boost::rend(a)</code> 
-    has the same complexity as <code>boost::begin(a)</code> from <a
-         href="#forward_range">Forward Range</a>.
-
-    <h3>Invariants</h3>
-    <p>
-    <Table border="1" cellpadding="5">
-        <TR>
-            <TD VAlign="top">Valid reverse range</TD>
-            <TD VAlign="top">For any Bidirectional Range <code>a</code>, <code>[boost::rbegin(a),boost::rend(a))</code> 
-            is a valid range, that is, <code>boost::rend(a)</code> is reachable from <code>boost::rbegin(a)</code> 
-            in a finite number of increments.</TD>
-        </TR>
-        <TR>
-            <TD VAlign="top">Completeness</TD>
-            <TD VAlign="top">An algorithm that iterates through the range <code>[boost::rbegin(a),boost::rend(a))</code>
-            will pass through every element of <code>a</code>.</TD>
-        </tr>
-    </table>
-   </p>
-   
-           <h3>See also</h3> 
-            <p> <a href="boost_range.html#boost::range_reverse_iterator">implementation of metafunctions </a></p>
-
-            <p> <a href="boost_range.html#rbegin">implementation of 
-                   functions </a></p>
+  
+</p>
 
     <hr>
 
@@ -455,7 +302,7 @@ href="../../iterator/doc/new-iter-concepts.html#random-access-traversal-iterator
     <a name=concept_checking><h2>Concept Checking</h2>
 
     Each of the range concepts has a corresponding concept checking
-    class in the file boost/range/concepts.hpp. These classes may be
+    class in the file <code><boost/range/concepts.hpp></codE>. These classes may be
     used in conjunction with the <a
     href="../../concept_check/concept_check.htm">Boost Concept
     Check</a> library to insure that the type of a template parameter
@@ -529,8 +376,8 @@ href="../../iterator/doc/new-iter-concepts.html#random-access-traversal-iterator
             <TD><A HREF=http://www.boost.org/people/jeremy_siek.htm>Jeremy Siek</A>
         </TR>
         <tr >
-            <TD nowrap>Copyright &copy 2004</TD>
-            <TD>Thorsten Ottosen. Use, modification and distribution is subject to the Boost Software License, Version 1.0.
+            <TD nowrap>Copyright &copy 2004-2007</TD>
+            <TD>Thorsten Ottosen.
     </TABLE>
 
     <br>
diff --git a/doc/style.css b/doc/style.css
index 227040a..1890b52 100755
--- a/doc/style.css
+++ b/doc/style.css
@@ -1,10 +1,3 @@
-/*
-#//  Copyright Thorsten Ottosen 2003-2005. 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)
-*/
-
 pre{
   BORDER-RIGHT: gray 1pt solid;
   PADDING-RIGHT: 2pt;
diff --git a/doc/style.html b/doc/style.html
index 76a63f1..9a5617e 100755
--- a/doc/style.html
+++ b/doc/style.html
@@ -104,7 +104,7 @@
 
     <hr>
     <p>
-    (C) Copyright Thorsten Ottosen 2003-2004. Use, modification and distribution is subject to the Boost Software License, Version 1.0.
+    (C) Copyright Thorsten Ottosen 2003-2004
     </p>
 
     <br>
diff --git a/doc/utility_class.html b/doc/utility_class.html
index 6dfa78b..f7b5535 100644
--- a/doc/utility_class.html
+++ b/doc/utility_class.html
@@ -59,19 +59,16 @@ corresponding <code>const_iterator</code> is. </p>
     <p>
     If the template argument is not a model of Forward Traversal Iterator, one can 
     still use a subset of the interface. In particular, <code>size()</code> requires 
-    Forward Traversal Iterators whereas <code>empty()</code> only requires Single 
+    Random Access Iterators whereas <code>empty()</code> only requires Single 
     Pass Iterators.
     </p>
 
     <p>
     Recall that many default constructed iterators 
     are <i>singular</i> and hence can only be assigned, but not compared or 
-    incremented or anything. However, if one creates a default constructed 
-    <code>iterator_range</code>, then one
-    can still call all its member functions. This means that the 
-    <code>iterator_range</code> will still be usable in many contexts even 
-    though the iterators underneath are not. 
-    </p>
+    incremented or anything. Likewise, if one creates a default constructed 
+    <code>iterator_range</code>, then one have to be careful about not doing
+    anything besides copying.    </p>
     
     <h3>Synopsis</h3>
 
@@ -82,12 +79,10 @@ corresponding <code>const_iterator</code> is. </p>
     </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=special>...                        </span><span class=identifier>value_type</span><span class=special>;
-        </span><span class=keyword>typedef </span><span class=special>...                        </span><span class=identifier>difference_type</span><span class=special>;
-        </span><span class=keyword>typedef </span><span class=special>...                        </span><span class=identifier>size_type</span><span class=special>;
-        </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>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><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>);
@@ -105,22 +100,24 @@ corresponding <code>const_iterator</code> is. </p>
         </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=identifier>iterator  </span><span class=identifier>end</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=keyword>bool      </span><span class=identifier>empty</span><span class=special>() </span><span class=keyword>const</span><span class=special>;
+        </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=identifier>difference_type </span><span class=identifier>size</span><span class=special>() </span><span class=keyword>const</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=keyword>public</span><span class=special>: </span><span class=comment>// convenience
-        </span><span class=keyword>operator    </span><a href="#unspecified_bool"><span class=identifier>unspecified_bool_type</span></a><span class=special>() </span><span class=keyword>const</span><span class=special>;
-    </span>    <span class=keyword>bool</span>        <span 
+        </span><span class=keyword>operator        </span><a href="#unspecified_bool"><span class=identifier>unspecified_bool_type</span></a><span class=special>() </span><span class=keyword>const</span><span class=special>;
+    </span>    <span class=keyword>bool</span>            <span 
 class=identifier><a href="#equal">equal</a></span><span
-class=special>( </span><span class=keyword>const <span 
-class=identifier>iterator_range</span><span class=special>& ) </span><span 
+class=special>( </span><span class=keyword>const</span> <span class=identifier>iterator_range</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=special>;</span>
+        <span class=identifier>reference       </span><span class=identifier>front</span><span class=special>() </span><span class=keyword>const</span><span class=special>;</span>
+        <span class=identifier>reference       </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=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=special>;</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><span class=special>};
     
     </span><span class=comment>// stream output
@@ -173,11 +170,11 @@ class=keyword>const;</span>
                          </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>iterator_of</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>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><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>const_iterator_of</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>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>
@@ -187,7 +184,7 @@ class=keyword>const;</span>
                          </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_const_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>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=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>
@@ -291,12 +288,14 @@ class can propagate constness since it knows what a corresponding
 <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_result_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=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>typedef </span><span class=keyword>typename </span><span class=identifier>range_result_iterator</span><span class=special>&lt;</span><span class=identifier>ForwardRange</span><spanclass=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_const_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>const_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=identifier>ForwardRange</span><spanclass=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=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>);
@@ -305,7 +304,7 @@ class can propagate constness since it knows what a corresponding
         </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=identifier>sub_range</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>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>);
@@ -325,8 +324,8 @@ class can propagate constness since it knows what a corresponding
         <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=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=identifier>value_type</span><span class=special>&amp;       </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=identifier>value_type</span><span class=special>&amp; </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=keyword>public</span><span class=special>:
         </span><span class=comment>// rest of interface inherited from <a href=#iter_range><code>iterator_range</code></a>
@@ -344,15 +343,15 @@ store the result
     from this algorithm. Here is an example of how we can do it with and without
 <code>sub_range</code>
     <pre>
-    <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>&quot;hello&quot;</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>&quot;ll&quot; </span><span class=special>);
-    </span><span class=identifier>sub_range</span><span class=special>&lt;</span><span class=identifier>std</span><span class=special>::</span><span class=identifier>string</span><span class=special>&gt;               </span><span class=identifier>sub </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>&quot;ll&quot; </span><span class=special>);</span>
+    <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>&quot;hello&quot;</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=identifier>as_literal</span><span class=special>(</span><span class=string>&quot;ll&quot;</span><span class=special>)</span> <span class=special>);</span>
+    <span class=identifier>sub_range</span><span class=special>&lt;</span><span class=identifier>std</span><span class=special>::</span><span class=identifier>string</span><span class=special>&gt;</span>               <span class=identifier>sub</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=identifier>as_literal</span><span class=special>(</span><span class=string>&quot;ll&quot;</span><span class=special>)</span> <span class=special>);</span>
 </pre>
  </p>
 
 <hr>
   <p>
-    (C) Copyright Thorsten Ottosen 2003-2004. Use, modification and distribution is subject to the Boost Software License, Version 1.0.
+    (C) Copyright Thorsten Ottosen 2003-2007
   </p>
 
   <br>
diff --git a/index.html b/index.html
index 05a90d3..5313690 100755
--- a/index.html
+++ b/index.html
@@ -18,7 +18,7 @@
   </table>
 
   <p>
-  Copyright © 2003-2004 Thorsten Ottosen
+  Copyright © 2003-2007 Thorsten Ottosen
   </p>
   <p>
   Use, modification and distribution is subject to the Boost Software License, Version 1.0
@@ -51,17 +51,15 @@
 
       <li> <a href="doc/style.html">Terminology and style guidelines </a>
       <li><a href="doc/headers.html">Headers</a> </li>
-      <li><a href="doc/examples.html">Examples</a>    
+      <li><a href="doc/examples.html">Examples</a>  
+          <li><a href="doc/mfc_atl.html">MFC/ATL mapping (courtesy of Shunsuke
+              Sogame)</a></li>  
       <li><a href="doc/portability.html">Portability</a>
       <li><a href="doc/faq.html">FAQ</a>    
       <li><a href="doc/history_ack.html">History and acknowledgment</a>    
           
   </ul>
 
-  <hr>
-  <p>
-    (C) Copyright Thorsten Ottosen 2003-2004
-  </p>
 
   <br>
   <br>
diff --git a/test/TODO b/test/TODO
new file mode 100644
index 0000000..8b13789
--- /dev/null
+++ b/test/TODO
@@ -0,0 +1 @@
+
diff --git a/test/algorithm_example.cpp b/test/algorithm_example.cpp
index cd6e0e0..85e2b22 100755
--- a/test/algorithm_example.cpp
+++ b/test/algorithm_example.cpp
@@ -17,6 +17,7 @@
 
 #include <boost/range/functions.hpp>
 #include <boost/range/metafunctions.hpp>
+#include <boost/range/as_literal.hpp>
 #include <boost/test/test_tools.hpp>
 #include <iostream>
 #include <algorithm>
@@ -36,7 +37,7 @@ namespace
     }
     
     template< typename Range, typename T >
-    inline typename boost::range_const_iterator<Range>::type 
+    inline typename boost::range_iterator<Range>::type 
     find( const Range& c, const T& value )
     {
        return std::find( boost::begin( c ), boost::end( c ), value );
@@ -46,7 +47,7 @@ namespace
     // replace first value and return its index
     //                                
     template< class Range, class T >
-    inline typename boost::range_size<Range>::type
+    inline typename boost::range_difference<Range>::type
     my_generic_replace( Range& c, const T& value, const T& replacement )
     {
        typename boost::range_iterator<Range>::type found = find( c, value );
@@ -63,19 +64,15 @@ void check_algorithm()
     //
     // usage
     //
-    const unsigned N = 5;                     
+    const int N = 5;                     
     std::vector<int> my_vector;
     int values[] = { 1,2,3,4,5,6,7,8,9 };
     my_vector.assign( values, values + 9 );
     typedef std::vector<int>::iterator iterator;
     std::pair<iterator,iterator>       my_view( boost::begin( my_vector ), 
                                                 boost::begin( my_vector ) + N );
-    char  str_val[] = "a string";
-    char* str       = str_val;
-    
-    BOOST_CHECK_EQUAL( my_generic_replace( my_vector, 4, 2 ), 3u );
+    BOOST_CHECK_EQUAL( my_generic_replace( my_vector, 4, 2 ), 3 );
     BOOST_CHECK_EQUAL( my_generic_replace( my_view, 4, 2 ), N );
-    BOOST_CHECK_EQUAL( my_generic_replace( str, 'a', 'b' ), 0u );
 
 }
 
diff --git a/test/array.cpp b/test/array.cpp
index d2f00b0..b438dce 100755
--- a/test/array.cpp
+++ b/test/array.cpp
@@ -42,16 +42,16 @@ void check_array()
     BOOST_STATIC_ASSERT(( is_same< range_const_iterator<array_t>::type, const int* >::value ));
     BOOST_STATIC_ASSERT(( is_same< range_difference<array_t>::type, std::ptrdiff_t >::value ));
     BOOST_STATIC_ASSERT(( is_same< range_size<array_t>::type, std::size_t >::value ));
-    BOOST_STATIC_ASSERT(( is_same< range_result_iterator<array_t>::type, int* >::value ));
-    BOOST_STATIC_ASSERT(( is_same< range_result_iterator<const array_t>::type, const int* >::value ));
+    BOOST_STATIC_ASSERT(( is_same< range_iterator<array_t>::type, int* >::value ));
+    BOOST_STATIC_ASSERT(( is_same< range_iterator<const array_t>::type, const int* >::value ));
     
     BOOST_STATIC_ASSERT(( is_same< range_value<const array_t>::type, const int >::value ));
     BOOST_STATIC_ASSERT(( is_same< range_iterator<const array_t>::type, const int* >::value ));
     BOOST_STATIC_ASSERT(( is_same< range_const_iterator<const array_t>::type, const int* >::value ));
     BOOST_STATIC_ASSERT(( is_same< range_difference<const array_t>::type, std::ptrdiff_t >::value ));
     BOOST_STATIC_ASSERT(( is_same< range_size<const array_t>::type, std::size_t >::value ));
-    BOOST_STATIC_ASSERT(( is_same< range_result_iterator<const array_t>::type, const int* >::value ));
-    BOOST_STATIC_ASSERT(( is_same< range_result_iterator<const array_t>::type, const int* >::value ));
+    BOOST_STATIC_ASSERT(( is_same< range_iterator<const array_t>::type, const int* >::value ));
+    BOOST_STATIC_ASSERT(( is_same< range_iterator<const array_t>::type, const int* >::value ));
 #endif
     
     BOOST_CHECK_EQUAL( begin( my_array ), my_array );
@@ -62,6 +62,8 @@ void check_array()
     BOOST_CHECK_EQUAL( end( ca ), ca + size( ca ) );
     BOOST_CHECK_EQUAL( empty( ca ),false );
 
+    const char A[] = "\0A";
+    BOOST_CHECK_EQUAL( boost::size(A), 3 );
 }
 
 using boost::unit_test::test_suite;
diff --git a/test/atl.cpp b/test/atl.cpp
new file mode 100644
index 0000000..50905b1
--- /dev/null
+++ b/test/atl.cpp
@@ -0,0 +1,623 @@
+
+
+// Boost.Range ATL Extension
+//
+// Copyright Shunsuke Sogame 2005-2006.
+// Distributed under the Boost Software License, Version 1.0. 
+// (See accompanying file LICENSE_1_0.txt or copy at 
+// http://www.boost.org/LICENSE_1_0.txt)
+
+
+// #include <pstade/vodka/drink.hpp>
+
+#include <boost/test/test_tools.hpp>
+#define _ATL_CSTRING_EXPLICIT_CONSTRUCTORS
+#define _ATL_NO_AUTOMATIC_NAMESPACE
+
+#define BOOST_LIB_NAME boost_test_exec_monitor
+#include <boost/config/auto_link.hpp>
+
+#define BOOST_RANGE_DETAIL_MICROSOFT_TEST
+#include <boost/range/atl.hpp> // can be placed first
+
+
+#include <map>
+#include <string>
+#include <boost/concept_check.hpp>
+#include <boost/mpl/if.hpp>
+#include <boost/range/begin.hpp>
+#include <boost/range/distance.hpp>
+#include <boost/range/iterator_range.hpp>
+#include <boost/static_assert.hpp>
+#include <boost/type_traits/is_same.hpp>
+
+
+#include <boost/foreach.hpp>
+
+
+#include <atlbase.h> // for ATL3 CSimpleArray/CSimpleValArray
+#if !(_ATL_VER < 0x0700)
+    #include <atlcoll.h>
+    #include <cstringt.h>
+    #include <atlsimpstr.h>
+    #include <atlstr.h>
+#endif
+
+
+namespace brdm = boost::range_detail_microsoft;
+
+
+#if !(_ATL_VER < 0x0700)
+
+
+template< class ArrayT, class SampleRange >
+bool test_init_auto_ptr_array(ArrayT& arr, SampleRange& sample)
+{
+    typedef typename boost::range_iterator<SampleRange>::type iter_t;
+
+    for (iter_t it = boost::begin(sample), last = boost::end(sample); it != last; ++it) {
+        arr.Add(*it); // moves ownership
+    }
+
+    return boost::distance(arr) == boost::distance(sample);
+}
+
+
+template< class ListT, class SampleRange >
+bool test_init_auto_ptr_list(ListT& lst, SampleRange& sample)
+{
+    typedef typename boost::range_iterator<SampleRange>::type iter_t;
+    typedef typename boost::range_value<SampleRange>::type val_t;
+
+    for (iter_t it = boost::begin(sample), last = boost::end(sample); it != last; ++it) {
+        lst.AddTail(*it); // moves ownership
+    }
+
+    return boost::distance(lst) == boost::distance(sample);
+}
+
+
+// Workaround:
+// CRBTree provides no easy access function, but yes, it is the range!
+//
+template< class AtlMapT, class KeyT, class MappedT >
+bool test_atl_map_has(AtlMapT& map, const KeyT& k, const MappedT m)
+{
+    typedef typename boost::range_iterator<AtlMapT>::type iter_t;
+
+    for (iter_t it = boost::begin(map), last = boost::end(map); it != last; ++it) {
+        if (it->m_key == k && it->m_value == m)
+            return true;
+    }
+
+    return false;
+}
+
+
+template< class AtlMapT, class MapT >
+bool test_atl_map(AtlMapT& map, const MapT& sample)
+{
+    typedef typename boost::range_iterator<AtlMapT>::type iter_t;
+    typedef typename boost::range_const_iterator<MapT>::type siter_t;
+
+    bool result = true;
+
+    result = result && (boost::distance(map) == boost::distance(sample));
+    if (!result)
+        return false;
+
+    {
+        for (iter_t it = boost::begin(map), last = boost::end(map); it != last; ++it) {
+            result = result && brdm::test_find_key_and_mapped(sample, std::make_pair(it->m_key, it->m_value));
+        }
+    }
+
+    {
+        for (siter_t it = boost::begin(sample), last = boost::end(sample); it != last; ++it) {
+            result = result && (test_atl_map_has)(map, it->first, it->second);
+        }
+    }
+
+    return result;
+}
+
+
+template< class MapT, class SampleMap >
+bool test_init_atl_multimap(MapT& map, const SampleMap& sample)
+{
+    typedef typename boost::range_const_iterator<SampleMap>::type iter_t;
+
+    for (iter_t it = boost::const_begin(sample), last = boost::const_end(sample); it != last; ++it) {
+        map.Insert(it->first, it->second);
+    }
+
+    return boost::distance(map) == boost::distance(sample);
+}
+
+
+// arrays
+//
+
+template< class Range >
+void test_CAtlArray(const Range& sample)
+{
+    typedef typename boost::range_value<Range>::type val_t;
+
+    typedef ATL::CAtlArray<val_t> rng_t;
+    BOOST_STATIC_ASSERT(( brdm::test_mutable_iter<rng_t, val_t *>::value ));
+    BOOST_STATIC_ASSERT(( brdm::test_const_iter  <rng_t, val_t const*>::value ));
+
+    rng_t rng;
+    BOOST_CHECK( brdm::test_init_array(rng, sample) );
+    BOOST_CHECK( brdm::test_random_access(rng) );
+    BOOST_CHECK( brdm::test_emptiness(rng) );
+}
+
+
+template< class ValT, class Range >
+void test_CAutoPtrArray(Range& sample)
+{
+    typedef ValT val_t;
+
+    typedef ATL::CAutoPtrArray<val_t> rng_t;
+    BOOST_STATIC_ASSERT(( brdm::test_mutable_iter<rng_t, boost::indirect_iterator< ATL::CAutoPtr<val_t> *> >::value ));
+    BOOST_STATIC_ASSERT(( brdm::test_const_iter  <rng_t, boost::indirect_iterator< ATL::CAutoPtr<val_t> const*> >::value ));
+
+    rng_t rng;
+    BOOST_CHECK( ::test_init_auto_ptr_array(rng, sample) );
+    BOOST_CHECK( brdm::test_random_access(rng) );
+    BOOST_CHECK( brdm::test_emptiness(rng) );
+}
+
+
+template< class I, class Range >
+void test_CInterfaceArray(const Range& sample)
+{
+    typedef typename boost::range_value<Range>::type val_t;
+
+    typedef ATL::CInterfaceArray<I> rng_t;
+    BOOST_STATIC_ASSERT(( brdm::test_mutable_iter<rng_t, ATL::CComQIPtr<I> * >::value ));
+    BOOST_STATIC_ASSERT(( brdm::test_const_iter  <rng_t, ATL::CComQIPtr<I> const* >::value ));
+
+    rng_t rng;
+    BOOST_CHECK( brdm::test_init_array(rng, sample) );
+    BOOST_CHECK( brdm::test_random_access(rng) );
+    BOOST_CHECK( brdm::test_emptiness(rng) );
+}
+
+
+// lists
+//
+
+template< class Range >
+void test_CAtlList(const Range& sample)
+{
+    typedef typename boost::range_value<Range>::type val_t;
+
+    typedef ATL::CAtlList<val_t> rng_t;
+    BOOST_STATIC_ASSERT(( brdm::test_mutable_iter< rng_t, brdm::list_iterator<rng_t,       val_t> >::value ));
+    BOOST_STATIC_ASSERT(( brdm::test_const_iter  < rng_t, brdm::list_iterator<rng_t const, val_t const> >::value ));
+
+    rng_t rng;
+    BOOST_CHECK( brdm::test_init_list(rng, sample) );
+    BOOST_CHECK( brdm::test_bidirectional(rng) );
+    BOOST_CHECK( brdm::test_emptiness(rng) );
+}
+
+
+template< class ValT, class Range >
+void test_CAutoPtrList(Range& sample)
+{
+    typedef ValT val_t;
+
+    typedef ATL::CAutoPtrList<val_t> rng_t;
+    BOOST_STATIC_ASSERT(( brdm::test_mutable_iter< rng_t, boost::indirect_iterator< brdm::list_iterator<rng_t,       ATL::CAutoPtr<val_t> > > >::value ));
+    BOOST_STATIC_ASSERT(( brdm::test_const_iter  < rng_t, boost::indirect_iterator< brdm::list_iterator<rng_t const, ATL::CAutoPtr<val_t> const> > >::value ));
+
+    rng_t rng;
+    BOOST_CHECK( ::test_init_auto_ptr_list(rng, sample) );
+    BOOST_CHECK( brdm::test_bidirectional(rng) );
+    BOOST_CHECK( brdm::test_emptiness(rng) );
+}
+
+
+template< class ValT, class Range >
+void test_CHeapPtrList(const Range& sample)
+{
+    typedef ValT val_t;
+
+    typedef ATL::CHeapPtrList<val_t> rng_t;
+    BOOST_STATIC_ASSERT(( brdm::test_mutable_iter< rng_t, boost::indirect_iterator< brdm::list_iterator<rng_t,       ATL::CHeapPtr<val_t> > > >::value ));
+    BOOST_STATIC_ASSERT(( brdm::test_const_iter  < rng_t, boost::indirect_iterator< brdm::list_iterator<rng_t const, ATL::CHeapPtr<val_t> const> > >::value ));
+
+    rng_t rng;
+    BOOST_CHECK( ::test_init_auto_ptr_list(rng, sample) );
+    BOOST_CHECK( brdm::test_bidirectional(rng) );
+    BOOST_CHECK( brdm::test_emptiness(rng) );
+}
+
+
+template< class I, class Range >
+void test_CInterfaceList(const Range& sample)
+{
+    typedef typename boost::range_value<Range>::type val_t;
+
+    typedef ATL::CInterfaceList<I> rng_t;
+    BOOST_STATIC_ASSERT(( brdm::test_mutable_iter< rng_t, brdm::list_iterator<rng_t,       ATL::CComQIPtr<I> > >::value ));
+    BOOST_STATIC_ASSERT(( brdm::test_const_iter  < rng_t, brdm::list_iterator<rng_t const, ATL::CComQIPtr<I> const> >::value ));
+
+    rng_t rng;
+    BOOST_CHECK( brdm::test_init_list(rng, sample) );
+    BOOST_CHECK( brdm::test_bidirectional(rng) );
+    BOOST_CHECK( brdm::test_emptiness(rng) );
+}
+
+
+// strings
+//
+
+template< class Range >
+void test_CSimpleStringT(const Range& sample)
+{
+    typedef typename boost::range_value<Range>::type val_t;
+
+    typedef typename boost::mpl::if_< boost::is_same<val_t, char>,
+        ATL::CAtlStringA,
+        ATL::CAtlStringW
+    >::type derived_t;
+
+    typedef ATL::CSimpleStringT<val_t> rng_t;
+    BOOST_STATIC_ASSERT(( brdm::test_mutable_iter<rng_t, typename rng_t::PXSTR>::value ));
+    BOOST_STATIC_ASSERT(( brdm::test_const_iter  <rng_t, typename rng_t::PCXSTR>::value ));
+
+    derived_t drng;
+    rng_t& rng = drng;
+    BOOST_CHECK( brdm::test_init_string(rng, sample) );
+    BOOST_CHECK( brdm::test_random_access(rng) );
+    // BOOST_CHECK( brdm::test_emptiness(rng) ); no default constructible
+}
+
+
+template< int n, class Range >
+void test_CFixedStringT(const Range& sample)
+{
+    typedef typename boost::range_value<Range>::type val_t;
+
+    typedef typename boost::mpl::if_< boost::is_same<val_t, char>,
+        ATL::CAtlStringA,
+        ATL::CAtlStringW
+    >::type base_t;
+
+    typedef ATL::CFixedStringT<base_t, n> rng_t;
+    BOOST_STATIC_ASSERT(( brdm::test_mutable_iter<rng_t, typename rng_t::PXSTR>::value ));
+    BOOST_STATIC_ASSERT(( brdm::test_const_iter  <rng_t, typename rng_t::PCXSTR>::value ));
+
+    rng_t rng;
+    BOOST_CHECK( brdm::test_init_string(rng, sample) );
+    BOOST_CHECK( brdm::test_random_access(rng) );
+    BOOST_CHECK( brdm::test_emptiness(rng) );
+}
+
+
+template< class Range >
+void test_CStringT(const Range& sample)
+{
+    typedef typename boost::range_value<Range>::type val_t;
+
+    typedef typename boost::mpl::if_< boost::is_same<val_t, char>,
+        ATL::CAtlStringA, // == CStringT<char, X>
+        ATL::CAtlStringW  // == CStringT<wchar_t, X>
+    >::type rng_t;
+
+    BOOST_STATIC_ASSERT(( brdm::test_mutable_iter<rng_t, typename rng_t::PXSTR>::value ));
+    BOOST_STATIC_ASSERT(( brdm::test_const_iter  <rng_t, typename rng_t::PCXSTR>::value ));
+
+    rng_t rng;
+    BOOST_CHECK( brdm::test_init_string(rng, sample) );
+    BOOST_CHECK( brdm::test_random_access(rng) );
+    BOOST_CHECK( brdm::test_emptiness(rng) );
+}
+
+
+template< class Range >
+void test_CStaticString(const Range& sample)
+{
+#if !defined(BOOST_RANGE_ATL_NO_TEST_UNDOCUMENTED_RANGE)
+    {
+        typedef ATL::CStaticString<char, 20> rng_t;
+        BOOST_STATIC_ASSERT(( brdm::test_mutable_iter<rng_t, char const *>::value ));
+        BOOST_STATIC_ASSERT(( brdm::test_const_iter  <rng_t, char const *>::value ));
+
+        rng_t rng("hello static string");
+        BOOST_CHECK( *(boost::begin(rng)+4) == 'o' );
+        BOOST_CHECK( *(boost::end(rng)-3) == 'i' );
+    }
+
+    {
+        typedef ATL::CStaticString<wchar_t, 40> rng_t;
+        BOOST_STATIC_ASSERT(( brdm::test_mutable_iter<rng_t, wchar_t const *>::value ));
+        BOOST_STATIC_ASSERT(( brdm::test_const_iter  <rng_t, wchar_t const *>::value ));
+
+        rng_t rng(L"hello static string");
+        BOOST_CHECK( *(boost::begin(rng)+4) == L'o' );
+        BOOST_CHECK( *(boost::end(rng)-3) == L'i' );
+    }
+#endif
+
+    (void)sample; // unused
+}
+
+
+#endif // !(_ATL_VER < 0x0700) 
+
+
+template< class Range >
+void test_CComBSTR(const Range& sample)
+{
+    typedef ATL::CComBSTR rng_t;
+    BOOST_STATIC_ASSERT(( brdm::test_mutable_iter<rng_t, OLECHAR *>::value ));
+    BOOST_STATIC_ASSERT(( brdm::test_const_iter  <rng_t, OLECHAR const*>::value ));
+
+    rng_t rng(OLESTR("hello CComBSTR range!"));
+    BOOST_CHECK( brdm::test_equals(rng, std::string("hello CComBSTR range!")) );
+    BOOST_CHECK( brdm::test_random_access(rng) );
+    BOOST_CHECK( brdm::test_emptiness(rng) );
+
+    (void)sample; // unused
+}
+
+
+// simples
+//
+
+template< class Range >
+void test_CSimpleArray(const Range& sample)
+{
+    typedef typename boost::range_value<Range>::type val_t;
+
+    typedef ATL::CSimpleArray<val_t> rng_t;
+    BOOST_STATIC_ASSERT(( brdm::test_mutable_iter<rng_t, val_t *>::value ));
+    BOOST_STATIC_ASSERT(( brdm::test_const_iter  <rng_t, val_t const*>::value ));
+
+    rng_t rng;
+    BOOST_CHECK( brdm::test_init_array(rng, sample) );
+    BOOST_CHECK( brdm::test_random_access(rng) );
+    BOOST_CHECK( brdm::test_emptiness(rng) );
+}
+
+
+template< class Range >
+void test_CSimpleMap(const Range& sample)
+{
+#if !defined(BOOST_RANGE_ATL_NO_TEST_UNDOCUMENTED_RANGE)
+
+    typedef ATL::CSimpleMap<int, double> rng_t;
+
+    rng_t rng;
+    rng.Add(3, 3.0);
+    rng.Add(4, 2.0);
+
+    BOOST_CHECK( boost::begin(rng)->get<0>() == 3.0 );
+    BOOST_CHECK( (boost::end(rng)-1)->get<1>() == 2.0 );
+
+#endif
+
+    (void)sample; // unused
+}
+
+
+template< class Range >
+void test_CSimpleValArray(const Range& sample)
+{
+    typedef typename boost::range_value<Range>::type val_t;
+
+    typedef ATL::CSimpleArray<val_t> rng_t;
+    BOOST_STATIC_ASSERT(( brdm::test_mutable_iter<rng_t, val_t *>::value ));
+    BOOST_STATIC_ASSERT(( brdm::test_const_iter  <rng_t, val_t const*>::value ));
+
+    rng_t rng;
+    BOOST_CHECK( brdm::test_init_array(rng, sample) );
+    BOOST_CHECK( brdm::test_random_access(rng) );
+    BOOST_CHECK( brdm::test_emptiness(rng) );
+}
+
+
+// maps
+//
+
+template< class MapT >
+void test_CAtlMap(const MapT& sample)
+{
+    typedef typename MapT::key_type k_t;
+    typedef typename MapT::mapped_type m_t;
+
+    typedef ATL::CAtlMap<k_t, m_t> rng_t;
+
+    rng_t rng;
+    boost::function_requires< boost::ForwardRangeConcept<rng_t> >();
+    BOOST_CHECK( brdm::test_init_map(rng, sample) );
+    BOOST_CHECK( ::test_atl_map(rng, sample) );
+}
+
+
+template< class MapT >
+void test_CRBTree(const MapT& sample)
+{
+    typedef typename MapT::key_type k_t;
+    typedef typename MapT::mapped_type m_t;
+
+    typedef ATL::CRBMap<k_t, m_t> derived_t;
+    typedef ATL::CRBTree<k_t, m_t> rng_t;
+
+    derived_t drng;
+    rng_t& rng = drng;
+
+    boost::function_requires< boost::BidirectionalRangeConcept<rng_t> >();
+    BOOST_CHECK( brdm::test_init_map(drng, sample) );
+    BOOST_CHECK( ::test_atl_map(rng, sample) );
+}
+
+
+template< class MapT >
+void test_CRBMap(const MapT& sample)
+{
+    typedef typename MapT::key_type k_t;
+    typedef typename MapT::mapped_type m_t;
+
+    typedef ATL::CRBMap<k_t, m_t> rng_t;
+
+    rng_t rng;
+    boost::function_requires< boost::BidirectionalRangeConcept<rng_t> >();
+    BOOST_CHECK( brdm::test_init_map(rng, sample) );
+    BOOST_CHECK( ::test_atl_map(rng, sample) );
+}
+
+
+template< class MapT >
+void test_CRBMultiMap(const MapT& sample)
+{
+    typedef typename MapT::key_type k_t;
+    typedef typename MapT::mapped_type m_t;
+
+    typedef ATL::CRBMultiMap<k_t, m_t> rng_t;
+
+    rng_t rng;
+    boost::function_requires< boost::BidirectionalRangeConcept<rng_t> >();
+    BOOST_CHECK( ::test_init_atl_multimap(rng, sample) );
+    BOOST_CHECK( ::test_atl_map(rng, sample) );
+}
+
+
+// main test
+//
+
+void test_atl()
+{
+
+    // ordinary ranges
+    //
+    {
+        std::string sample("rebecca judy and mary whiteberry chat monchy");
+#if !(_ATL_VER < 0x0700)
+        ::test_CAtlArray(sample);
+        ::test_CAtlList(sample);
+        ::test_CSimpleStringT(sample);
+        ::test_CFixedStringT<44>(sample);
+        ::test_CStringT(sample);
+        ::test_CStaticString(sample);
+#endif
+        ::test_CComBSTR(sample);
+        ::test_CSimpleArray(sample);
+        ::test_CSimpleMap(sample);
+        ::test_CSimpleValArray(sample);
+    }
+
+
+    {
+        std::wstring sample(L"rebecca judy and mary whiteberry chat monchy");
+#if !(_ATL_VER < 0x0700)
+        ::test_CAtlArray(sample);
+        ::test_CAtlList(sample);
+        ::test_CSimpleStringT(sample);
+        ::test_CFixedStringT<44>(sample);
+        ::test_CStringT(sample);
+        ::test_CStaticString(sample);
+#endif
+        ::test_CComBSTR(sample);
+        ::test_CSimpleArray(sample);
+        ::test_CSimpleMap(sample);
+        ::test_CSimpleValArray(sample);
+    }
+
+    // pointer ranges
+    //
+#if !(_ATL_VER < 0x0700)
+    {
+        typedef ATL::CAutoPtr<int> ptr_t;
+        ptr_t
+            ptr0(new int(3)), ptr1(new int(4)), ptr2(new int(5)), ptr3(new int(4)),
+            ptr4(new int(1)), ptr5(new int(2)), ptr6(new int(4)), ptr7(new int(0));
+
+        ptr_t ptrs[8] = {
+            ptr0, ptr1, ptr2, ptr3, ptr4, ptr5, ptr6, ptr7
+        };
+
+        boost::iterator_range< ptr_t * > workaround(ptrs, ptrs+8);
+        ::test_CAutoPtrArray<int>(workaround);
+    }
+
+    {
+        typedef ATL::CAutoPtr<int> ptr_t;
+        ptr_t
+            ptr0(new int(3)), ptr1(new int(4)), ptr2(new int(5)), ptr3(new int(4)),
+            ptr4(new int(1)), ptr5(new int(2)), ptr6(new int(4)), ptr7(new int(0));
+
+        ptr_t ptrs[8] = {
+            ptr0, ptr1, ptr2, ptr3, ptr4, ptr5, ptr6, ptr7
+        };
+
+        boost::iterator_range< ptr_t * > workaround(ptrs, ptrs+8);
+        ::test_CAutoPtrList<int>(workaround);
+    }
+
+    {
+        typedef ATL::CHeapPtr<int> ptr_t;
+        ptr_t ptrs[5]; {
+            ptrs[0].AllocateBytes(sizeof(int));
+            ptrs[1].AllocateBytes(sizeof(int));
+            ptrs[2].AllocateBytes(sizeof(int));
+            ptrs[3].AllocateBytes(sizeof(int));
+            ptrs[4].AllocateBytes(sizeof(int));
+        }
+
+        boost::iterator_range< ptr_t * > workaround(ptrs, ptrs+5);
+        ::test_CHeapPtrList<int>(workaround);
+    }
+
+
+    {
+        typedef ATL::CComQIPtr<IDispatch> ptr_t;
+        ptr_t ptrs[8];
+
+        boost::iterator_range< ptr_t * > workaround(ptrs, ptrs+8);
+        ::test_CInterfaceArray<IDispatch>(workaround);
+        ::test_CInterfaceList<IDispatch>(workaround);
+    }
+#endif
+
+    // maps
+    //
+    {
+#if !(_ATL_VER < 0x0700)
+        std::map<int, std::string> sample; {
+            sample[0] = "hello";
+            sample[1] = "range";
+            sample[2] = "atl";
+            sample[3] = "mfc";
+            sample[4] = "collections";
+        }
+
+        ::test_CAtlMap(sample);
+        ::test_CRBTree(sample);
+        ::test_CRBMap(sample);
+        ::test_CRBMultiMap(sample);
+#endif
+    }
+
+
+} // test_atl
+
+
+#include <boost/test/unit_test.hpp>
+using boost::unit_test::test_suite;
+
+
+test_suite *
+init_unit_test_suite(int argc, char* argv[])
+{
+    test_suite *test = BOOST_TEST_SUITE("ATL Range Test Suite");
+    test->add(BOOST_TEST_CASE(&test_atl));
+
+    (void)argc, (void)argv; // unused
+    return test;
+}
diff --git a/test/compat1.cpp b/test/compat1.cpp
new file mode 100755
index 0000000..e69de29
diff --git a/test/extension_mechanism.cpp b/test/extension_mechanism.cpp
index d355e4e..a206afb 100755
--- a/test/extension_mechanism.cpp
+++ b/test/extension_mechanism.cpp
@@ -25,7 +25,7 @@
 // Generic range algorithm
 //
 template< class Rng >
-typename boost::range_result_iterator<Rng>::type foo_algo( Rng& r )
+typename boost::range_iterator<Rng>::type foo_algo( Rng& r )
 {
         //
         // This will only compile for Rng = UDT if the qualified calls
@@ -44,7 +44,6 @@ namespace Foo
                 typedef std::vector<int>       data_t;
                 typedef data_t::iterator       iterator;
                 typedef data_t::const_iterator const_iterator;
-                typedef data_t::size_type      size_type;
 
                 data_t vec;
 
@@ -57,32 +56,28 @@ namespace Foo
         // to be defined because X defines the proper set of
         // nested types.
         //
-        inline X::iterator boost_range_begin( X& x )
+        inline X::iterator range_begin( X& x )
         {
                 return x.vec.begin();
         }
 
 
-        inline X::const_iterator boost_range_begin( const X& x )
+        inline X::const_iterator range_begin( const X& x )
         {
                 return x.vec.begin();
         }
 
 
-        inline X::iterator boost_range_end( X& x )
+        inline X::iterator range_end( X& x )
         {
                 return x.vec.end();
         }
 
-        inline X::const_iterator boost_range_end( const X& x )
+        inline X::const_iterator range_end( const X& x )
         {
                 return x.vec.end();
         }
 
-        inline X::size_type boost_range_size( const X& x )
-        {
-                return x.vec.size();
-        }
 }
 
 void check_extension()
diff --git a/test/iterator_pair.cpp b/test/iterator_pair.cpp
index 74358ef..2546817 100755
--- a/test/iterator_pair.cpp
+++ b/test/iterator_pair.cpp
@@ -15,6 +15,7 @@
 #  pragma warn -8057 // unused argument argc/argv in Boost.Test
 #endif
 
+#include <boost/range/concepts.hpp>
 #include <boost/range/functions.hpp>
 #include <boost/range/metafunctions.hpp>
 #include <boost/static_assert.hpp>
@@ -46,33 +47,35 @@ void check_iterator_pair()
     BOOST_STATIC_ASSERT(( is_same< range_difference<pair_t>::type,                           
                           detail::iterator_traits<pair_t::first_type>::difference_type >::value ));
     BOOST_STATIC_ASSERT(( is_same< range_size<pair_t>::type, std::size_t >::value ));
-    BOOST_STATIC_ASSERT(( is_same< range_result_iterator<pair_t>::type, pair_t::first_type >::value ));
-    BOOST_STATIC_ASSERT(( is_same< range_result_iterator<const_pair_t>::type, const_pair_t::first_type >::value ));
+    BOOST_STATIC_ASSERT(( is_same< range_iterator<pair_t>::type, pair_t::first_type >::value ));
+    BOOST_STATIC_ASSERT(( is_same< range_iterator<const_pair_t>::type, const_pair_t::first_type >::value ));
     
     BOOST_STATIC_ASSERT(( is_same< range_value<const_pair_tt>::type, 
                           detail::iterator_traits<const_pair_t::first_type>::value_type>::value ));
     BOOST_STATIC_ASSERT(( is_same< range_iterator<const_pair_tt>::type, const_pair_tt::first_type >::value ));
-    BOOST_STATIC_ASSERT(( is_same< range_const_iterator<const_pair_tt>::type, const_pair_tt::first_type >::value ));
+    //
+    // This behavior is not supported with v2.
+    //BOOST_STATIC_ASSERT(( is_same< range_const_iterator<const_pair_tt>::type, const_pair_tt::first_type >::value ));
     BOOST_STATIC_ASSERT(( is_same< range_difference<const_pair_tt>::type,                           
                           detail::iterator_traits<const_pair_tt::first_type>::difference_type >::value ));
     BOOST_STATIC_ASSERT(( is_same< range_size<const_pair_tt>::type, std::size_t >::value ));
-    BOOST_STATIC_ASSERT(( is_same< range_result_iterator<const_pair_tt>::type, const_pair_tt::first_type >::value ));
-    BOOST_STATIC_ASSERT(( is_same< range_result_iterator<const_pair_tt>::type, const_pair_tt::first_type >::value ));
+    BOOST_STATIC_ASSERT(( is_same< range_iterator<const_pair_tt>::type, const_pair_tt::first_type >::value ));
+    BOOST_STATIC_ASSERT(( is_same< range_iterator<const_pair_tt>::type, const_pair_tt::first_type >::value ));
 
     BOOST_CHECK( begin( pair ) == pair.first );
     BOOST_CHECK( end( pair )   == pair.second );
     BOOST_CHECK( empty( pair ) == (pair.first == pair.second) );
-    BOOST_CHECK( size( pair )  == std::size_t( std::distance( pair.first, pair.second ) ) );
+    BOOST_CHECK( size( pair )  == std::distance( pair.first, pair.second ) );
     
     BOOST_CHECK( begin( const_pair ) == const_pair.first );
     BOOST_CHECK( end( const_pair )   == const_pair.second );
     BOOST_CHECK( empty( const_pair ) == (const_pair.first == const_pair.second) );
-    BOOST_CHECK( size( const_pair )  == std::size_t( std::distance( const_pair.first, const_pair.second ) ) );
+    BOOST_CHECK( size( const_pair )  == std::distance( const_pair.first, const_pair.second ) );
 
     BOOST_CHECK( begin( constness_pair ) == constness_pair.first );
     BOOST_CHECK( end( constness_pair )   == constness_pair.second );
     BOOST_CHECK( empty( constness_pair ) == (constness_pair.first == const_pair.second) );
-    BOOST_CHECK( size( constness_pair )  == std::size_t( std::distance( constness_pair.first, constness_pair.second ) ) );
+    BOOST_CHECK( size( constness_pair )  == std::distance( constness_pair.first, constness_pair.second ) );
 
 }
 
diff --git a/test/iterator_range.cpp b/test/iterator_range.cpp
index 7e036ab..db531d3 100755
--- a/test/iterator_range.cpp
+++ b/test/iterator_range.cpp
@@ -8,6 +8,7 @@
 // For more information, see http://www.boost.org/libs/range/
 //
 
+//#include <boost/range/as_array.hpp>
 
 #include <boost/detail/workaround.hpp>
 
@@ -16,9 +17,9 @@
 #  pragma warn -8057 // unused argument argc/argv in Boost.Test
 #endif
 
-
 #include <boost/range/iterator_range.hpp>
 #include <boost/range/functions.hpp>
+#include <boost/range/as_literal.hpp> 
 #include <boost/test/test_tools.hpp>
 #include <boost/test/unit_test.hpp>
 #include <iostream>
@@ -65,6 +66,12 @@ void check_iterator_range()
     BOOST_CHECK_EQUAL( distance( r.begin(), r.end() ), 
                        distance( begin( r2 ), end( r2 ) ) );
     cout << r << r2;
+
+        
+#ifndef BOOST_NO_STD_WSTRING
+    wcout << make_iterator_range( wstring( L"a wide string" ) ) 
+          << make_iterator_range( L"another wide string" );
+#endif    
     
     string res  = copy_range<string>( r );
     BOOST_CHECK( equal( res.begin(), res.end(), r.begin() ) );
@@ -73,12 +80,12 @@ void check_iterator_range()
     BOOST_CHECK( rr.equal( r ) );
 
     rr  = make_iterator_range( str.begin(), str.begin() + 5 );
-    BOOST_CHECK( rr == "hello" );
-    BOOST_CHECK( rr != "hell" );
-    BOOST_CHECK( rr < "hello dude" );
-    BOOST_CHECK( "hello" == rr );
-    BOOST_CHECK( "hell"  != rr );
-    BOOST_CHECK( ! ("hello dude" < rr ) );
+    BOOST_CHECK( rr == as_literal("hello") );
+    BOOST_CHECK( rr != as_literal("hell") );
+    BOOST_CHECK( rr < as_literal("hello dude") );
+    BOOST_CHECK( as_literal("hello") == rr );
+    BOOST_CHECK( as_literal("hell")  != rr );
+    BOOST_CHECK( ! (as_literal("hello dude") < rr ) );
     irange rrr = rr;
     BOOST_CHECK( rrr == rr );
     BOOST_CHECK( !( rrr != rr ) );
@@ -88,9 +95,10 @@ void check_iterator_range()
     BOOST_CHECK_EQUAL( cr.front(), 'h' );
     BOOST_CHECK_EQUAL( cr.back(), 'd' );
     BOOST_CHECK_EQUAL( cr[1], 'e' );
+    BOOST_CHECK_EQUAL( cr(1), 'e' );
 
     rrr = make_iterator_range( str, 1, -1 );
-    BOOST_CHECK( rrr == "ello worl" );
+    BOOST_CHECK( rrr == as_literal("ello worl") );
     rrr = make_iterator_range( rrr, -1, 1 );
     BOOST_CHECK( rrr == str );
 
@@ -121,7 +129,7 @@ test_suite* init_unit_test_suite( int argc, char* argv[] )
 template< class Container >
 int test_iter_range( Container& a_cont )
 {
-    typedef BOOST_DEDUCED_TYPENAME range_result_iterator<Container>::type citer_type;
+    typedef BOOST_DEDUCED_TYPENAME range_iterator<Container>::type citer_type;
     typedef iterator_range<citer_type> riter_type;
     riter_type a_riter( make_iterator_range( a_cont ) );
     a_riter.front();
diff --git a/test/mfc.cpp b/test/mfc.cpp
index c429993..7a13e8e 100755
--- a/test/mfc.cpp
+++ b/test/mfc.cpp
@@ -1,86 +1,743 @@
-// 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/
+// Boost.Range MFC Extension
 //
+// Copyright Shunsuke Sogame 2005-2006.
+// Distributed under the Boost Software License, Version 1.0. 
+// (See accompanying file LICENSE_1_0.txt or copy at 
+// http://www.boost.org/LICENSE_1_0.txt)
 
-#define _MSL_USING_NAMESPACE 1
 
-#include <boost/detail/workaround.hpp>
+#include <afx.h> // must be here
 
-#if BOOST_WORKAROUND(__BORLANDC__, BOOST_TESTED_AT(0x564))
-#  pragma warn -8091 // supress warning in Boost.Test
-#  pragma warn -8057 // unused argument argc/argv in Boost.Test
-#endif
-
-#define BOOST_RANGE_ENABLE_MFC
-#define BOOST_RANGE_ENABLE_MCF_CARRAY
-
-/*
-#define WIN32
-#define _WINDOWS
-#define _MBCS
-#define _AFXDLL
-#define _ATL_DLL
-*/
-
-///Od /D "WIN32" /D "_WINDOWS" /D "_DEBUG" /D "_MBCS" /D "_AFXDLL" /D "_ATL_DLL" /Gm /EHsc /RTC1 
-// /MDd /Zc:wchar_t /Yu"stdafx.h" /Fp"Debug/Foo.pch" /Fo"Debug/" /Fd"Debug/vc70.pdb" /W3 /nologo /c /Wp64 /ZI /TP
-
-#include <boost/range.hpp>
-#include <boost/range/detail/mfc/carray.hpp>
-#include <boost/range/detail/mfc/cstring.hpp>
+// #include <pstade/vodka/drink.hpp>
 
 #include <boost/test/test_tools.hpp>
-#include <boost/config.hpp>
+#define _ATL_CSTRING_EXPLICIT_CONSTRUCTORS
+#define _ATL_NO_AUTOMATIC_NAMESPACE
+
+#define BOOST_LIB_NAME boost_test_exec_monitor
+#include <boost/config/auto_link.hpp>
+
+#define BOOST_RANGE_DETAIL_MICROSOFT_TEST
+#include <boost/range/mfc.hpp> // can be placed first
 
 
-void check_mfc()
+#include <map>
+#include <boost/concept_check.hpp>
+// #include <boost/foreach.hpp>
+#include <boost/range/begin.hpp>
+#include <boost/range/concepts.hpp>
+#include <boost/range/end.hpp>
+#include <boost/static_assert.hpp>
+#include <boost/algorithm/string.hpp>
+
+
+#include <afx.h>
+#include <afxcoll.h>
+#include <afxtempl.h>
+
+#if !(_ATL_VER < 0x0700)
+    #include <cstringt.h>
+    #include <atlsimpstr.h>
+    #include <atlstr.h>
+#endif
+
+
+namespace brdm = boost::range_detail_microsoft;
+
+
+// helpers
+//
+
+template< class MfcMapT, class MapT >
+bool test_mfc_map(MfcMapT& map, const MapT& sample)
 {
-    CString s = "hello world";
-    BOOST_CHECK( boost::begin( s ) + boost::size( s ) == boost::end( s ) );
-    BOOST_CHECK( boost::size( s ) == boost::size( "hello world" ) );
-    BOOST_CHECK( !boost::empty( s ) );
-    const CString cs( s );
-    BOOST_CHECK( boost::begin( cs ) + boost::size( cs ) == boost::end( cs ) );
-    BOOST_CHECK( boost::size( cs ) == boost::size( "hello world" ) );
-    BOOST_CHECK( !boost::empty( cs ) );
-    
-    CArray<int,int> a;
-    BOOST_CHECK( boost::empty( a ) );
-    a.Add( 5 );
-    a.Add( 10 );
-    BOOST_CHECK( boost::begin( a ) + boost::size( a ) == boost::end( a ) );
-    BOOST_CHECK( boost::size( a ) == 2 );
-    BOOST_CHECK( !boost::empty( a ) );
-    const CArray<int,int>& ca = a;
-    BOOST_CHECK( boost::begin( ca ) + boost::size( ca ) == boost::end( ca ) );
-    BOOST_CHECK( boost::size( ca ) == 2 );
-    BOOST_CHECK( !boost::empty( ca ) );
-    
+    typedef typename boost::range_iterator<MfcMapT>::type iter_t;
+    typedef typename boost::range_const_iterator<MapT>::type siter_t;
+
+    bool result = true;
+
+    result = result && (boost::distance(map) == boost::distance(sample));
+    if (!result)
+        return false;
+
+    {
+        for (iter_t it = boost::begin(map), last = boost::end(map); it != last; ++it) {
+            result = result && brdm::test_find_key_and_mapped(sample, *it);
+        }
+    }
+
+    {
+        for (siter_t it = boost::begin(sample), last = boost::end(sample); it != last; ++it) {
+            result = result && (map[it->first] == it->second);
+        }
+    }
+
+    return result;
 }
 
 
+template< class MfcMapT, class MapT >
+bool test_mfc_cpair_map(MfcMapT& map, const MapT& sample)
+{
+    typedef typename boost::range_iterator<MfcMapT>::type iter_t;
+    typedef typename boost::range_const_iterator<MapT>::type siter_t;
+
+    bool result = true;
+
+    result = result && (boost::distance(map) == boost::distance(sample));
+    if (!result)
+        return false;
+
+    {
+        for (iter_t it = boost::begin(map), last = boost::end(map); it != last; ++it) {
+            result = result && brdm::test_find_key_and_mapped(sample, std::make_pair(it->key, it->value));
+        }
+    }
+
+    {
+        for (siter_t it = boost::begin(sample), last = boost::end(sample); it != last; ++it) {
+            result = result && (map[it->first] == it->second);
+        }
+    }
+
+    return result;
+}
+
+
+// arrays
+//
+template< class Range >
+void test_CByteArray(const Range& sample)
+{
+    typedef typename boost::range_value<Range>::type val_t;
+
+    typedef ::CByteArray rng_t;
+    BOOST_STATIC_ASSERT(( brdm::test_mutable_iter<rng_t, BYTE *>::value ));
+    BOOST_STATIC_ASSERT(( brdm::test_const_iter  <rng_t, BYTE const*>::value ));
+
+    rng_t rng;
+    BOOST_CHECK( brdm::test_init_array(rng, sample) );
+    BOOST_CHECK( brdm::test_random_access(rng) );
+    BOOST_CHECK( brdm::test_emptiness(rng) );
+}
+
+
+template< class Range >
+void test_CDWordArray(const Range& sample)
+{
+    typedef typename boost::range_value<Range>::type val_t;
+
+    typedef ::CDWordArray rng_t;
+    BOOST_STATIC_ASSERT(( brdm::test_mutable_iter<rng_t, DWORD *>::value ));
+    BOOST_STATIC_ASSERT(( brdm::test_const_iter  <rng_t, DWORD const*>::value ));
+
+    rng_t rng;
+    BOOST_CHECK( brdm::test_init_array(rng, sample) );
+    BOOST_CHECK( brdm::test_random_access(rng) );
+    BOOST_CHECK( brdm::test_emptiness(rng) );
+}
+
+
+template< class Range >
+void test_CObArray(const Range& sample)
+{
+    typedef typename boost::range_value<Range>::type val_t;
+
+    typedef ::CObArray rng_t;
+    BOOST_STATIC_ASSERT(( brdm::test_mutable_iter<rng_t, brdm::mfc_ptr_array_iterator<rng_t, ::CObject *> >::value ));
+    BOOST_STATIC_ASSERT(( brdm::test_const_iter  <rng_t, brdm::mfc_ptr_array_iterator<const rng_t, const ::CObject *> >::value ));
+
+    rng_t rng;
+    BOOST_CHECK( brdm::test_init_array(rng, sample) );
+    BOOST_CHECK( brdm::test_random_access(rng) );
+    BOOST_CHECK( brdm::test_emptiness(rng) );
+}
+
+
+template< class Range >
+void test_CPtrArray(const Range& sample)
+{
+    typedef typename boost::range_value<Range>::type val_t;
+
+    typedef ::CPtrArray rng_t;
+    BOOST_STATIC_ASSERT(( brdm::test_mutable_iter<rng_t, brdm::mfc_ptr_array_iterator<rng_t, void *> >::value ));
+    BOOST_STATIC_ASSERT(( brdm::test_const_iter  <rng_t, brdm::mfc_ptr_array_iterator<const rng_t, const void *> >::value ));
+
+    rng_t rng;
+    BOOST_CHECK( brdm::test_init_array(rng, sample) );
+    BOOST_CHECK( brdm::test_random_access(rng) );
+    BOOST_CHECK( brdm::test_emptiness(rng) );
+}
+
+
+template< class Range >
+void test_CStringArray(const Range& sample)
+{
+    typedef typename boost::range_value<Range>::type val_t;
+
+    typedef ::CStringArray rng_t;
+    BOOST_STATIC_ASSERT(( brdm::test_mutable_iter<rng_t, ::CString *>::value ));
+    BOOST_STATIC_ASSERT(( brdm::test_const_iter  <rng_t, ::CString const *>::value ));
+
+    rng_t rng;
+    BOOST_CHECK( brdm::test_init_array(rng, sample) );
+    BOOST_CHECK( brdm::test_random_access(rng) );
+    BOOST_CHECK( brdm::test_emptiness(rng) );
+}
+
+
+template< class Range >
+void test_CUIntArray(const Range& sample)
+{
+    typedef typename boost::range_value<Range>::type val_t;
+
+    typedef ::CUIntArray rng_t;
+    BOOST_STATIC_ASSERT(( brdm::test_mutable_iter<rng_t, UINT *>::value ));
+    BOOST_STATIC_ASSERT(( brdm::test_const_iter  <rng_t, UINT const *>::value ));
+
+    rng_t rng;
+    BOOST_CHECK( brdm::test_init_array(rng, sample) );
+    BOOST_CHECK( brdm::test_random_access(rng) );
+    BOOST_CHECK( brdm::test_emptiness(rng) );
+}
+
+
+template< class Range >
+void test_CWordArray(const Range& sample)
+{
+    typedef typename boost::range_value<Range>::type val_t;
+
+    typedef ::CWordArray rng_t;
+    BOOST_STATIC_ASSERT(( brdm::test_mutable_iter<rng_t, WORD *>::value ));
+    BOOST_STATIC_ASSERT(( brdm::test_const_iter  <rng_t, WORD const *>::value ));
+
+    rng_t rng;
+    BOOST_CHECK( brdm::test_init_array(rng, sample) );
+    BOOST_CHECK( brdm::test_random_access(rng) );
+    BOOST_CHECK( brdm::test_emptiness(rng) );
+}
+
+
+// lists
+//
+
+template< class Range >
+void test_CObList(const Range& sample)
+{
+    typedef typename boost::range_value<Range>::type val_t;
+
+    typedef ::CObList rng_t;
+
+    BOOST_STATIC_ASSERT(( brdm::test_mutable_iter< rng_t, brdm::list_iterator<rng_t,       ::CObject *> >::value ));
+#if !defined(BOOST_RANGE_MFC_CONST_COL_RETURNS_NON_REF)
+    BOOST_STATIC_ASSERT(( brdm::test_const_iter  < rng_t, brdm::list_iterator<rng_t const, ::CObject const *> >::value ));
+#else
+    BOOST_STATIC_ASSERT(( brdm::test_const_iter  < rng_t, brdm::list_iterator<rng_t const, ::CObject const * const, ::CObject const * const> >::value ));
+#endif
+
+    rng_t rng;
+    BOOST_CHECK( brdm::test_init_list(rng, sample) );
+    BOOST_CHECK( brdm::test_bidirectional(rng) );
+    BOOST_CHECK( brdm::test_emptiness(rng) );
+}
+
+
+template< class Range >
+void test_CPtrList(const Range& sample)
+{
+    typedef typename boost::range_value<Range>::type val_t;
+
+    typedef ::CPtrList rng_t;
+
+    BOOST_STATIC_ASSERT(( brdm::test_mutable_iter< rng_t, brdm::list_iterator<rng_t,       void *> >::value ));
+#if !defined(BOOST_RANGE_MFC_CONST_COL_RETURNS_NON_REF)
+    BOOST_STATIC_ASSERT(( brdm::test_const_iter  < rng_t, brdm::list_iterator<rng_t const, void const *> >::value ));
+#else
+    BOOST_STATIC_ASSERT(( brdm::test_const_iter  < rng_t, brdm::list_iterator<rng_t const, void const * const, void const * const> >::value ));
+#endif
+
+    rng_t rng;
+    BOOST_CHECK( brdm::test_init_list(rng, sample) );
+    BOOST_CHECK( brdm::test_bidirectional(rng) );
+    BOOST_CHECK( brdm::test_emptiness(rng) );
+}
+
+
+template< class Range >
+void test_CStringList(const Range& sample)
+{
+    typedef typename boost::range_value<Range>::type val_t;
+
+    typedef ::CStringList rng_t;
+
+    BOOST_STATIC_ASSERT(( brdm::test_mutable_iter< rng_t, brdm::list_iterator<rng_t,       ::CString> >::value ));
+#if !defined(BOOST_RANGE_MFC_CONST_COL_RETURNS_NON_REF)
+    BOOST_STATIC_ASSERT(( brdm::test_const_iter  < rng_t, brdm::list_iterator<rng_t const, ::CString const> >::value ));
+#else
+    BOOST_STATIC_ASSERT(( brdm::test_const_iter  < rng_t, brdm::list_iterator<rng_t const, ::CString const, ::CString const> >::value ));
+#endif
+
+    rng_t rng;
+    BOOST_CHECK( brdm::test_init_list(rng, sample) );
+    BOOST_CHECK( brdm::test_bidirectional(rng) );
+    BOOST_CHECK( brdm::test_emptiness(rng) );
+}
+
+
+// maps
+//
+
+template< class MapT >
+void test_CMapPtrToWord(const MapT& sample)
+{
+    typedef ::CMapPtrToWord rng_t;
+
+    rng_t rng;
+    boost::function_requires< boost::ForwardRangeConcept<rng_t> >();
+    BOOST_CHECK( brdm::test_init_map(rng, sample) );
+    BOOST_CHECK( ::test_mfc_map(rng, sample) );
+    BOOST_CHECK( brdm::test_emptiness(rng) );
+}
+
+
+template< class MapT >
+void test_CMapPtrToPtr(const MapT& sample)
+{
+    typedef ::CMapPtrToPtr rng_t;
+
+    rng_t rng;
+    boost::function_requires< boost::ForwardRangeConcept<rng_t> >();
+    BOOST_CHECK( brdm::test_init_map(rng, sample) );
+    BOOST_CHECK( ::test_mfc_map(rng, sample) );
+    BOOST_CHECK( brdm::test_emptiness(rng) );
+}
+
+
+template< class MapT >
+void test_CMapStringToOb(const MapT& sample)
+{
+    typedef ::CMapStringToOb rng_t;
+
+    rng_t rng;
+    boost::function_requires< boost::ForwardRangeConcept<rng_t> >();
+    BOOST_CHECK( brdm::test_init_map(rng, sample) );
+    BOOST_CHECK( ::test_mfc_map(rng, sample) );
+    BOOST_CHECK( brdm::test_emptiness(rng) );
+}
+
+
+template< class MapT >
+void test_CMapStringToPtr(const MapT& sample)
+{
+    typedef ::CMapStringToPtr rng_t;
+
+    rng_t rng;
+    boost::function_requires< boost::ForwardRangeConcept<rng_t> >();
+    BOOST_CHECK( brdm::test_init_map(rng, sample) );
+    BOOST_CHECK( ::test_mfc_map(rng, sample) );
+    BOOST_CHECK( brdm::test_emptiness(rng) );
+}
+
+
+template< class MapT >
+void test_CMapStringToString(const MapT& sample)
+{
+    typedef ::CMapStringToString rng_t;
+
+    rng_t rng;
+    boost::function_requires< boost::ForwardRangeConcept<rng_t> >();
+    BOOST_CHECK( brdm::test_init_map(rng, sample) );
+#if !defined(BOOST_RANGE_MFC_NO_CPAIR)
+    BOOST_CHECK( ::test_mfc_cpair_map(rng, sample) );
+#endif
+    BOOST_CHECK( brdm::test_emptiness(rng) );
+}
+
+
+template< class MapT >
+void test_CMapWordToOb(const MapT& sample)
+{
+    typedef ::CMapWordToOb rng_t;
+
+    rng_t rng;
+    boost::function_requires< boost::ForwardRangeConcept<rng_t> >();
+    BOOST_CHECK( brdm::test_init_map(rng, sample) );
+    BOOST_CHECK( ::test_mfc_map(rng, sample) );
+    BOOST_CHECK( brdm::test_emptiness(rng) );
+}
+
+
+template< class MapT >
+void test_CMapWordToPtr(const MapT& sample)
+{
+    typedef ::CMapWordToPtr rng_t;
+
+    rng_t rng;
+    boost::function_requires< boost::ForwardRangeConcept<rng_t> >();
+    BOOST_CHECK( brdm::test_init_map(rng, sample) );
+    BOOST_CHECK( ::test_mfc_map(rng, sample) );
+    BOOST_CHECK( brdm::test_emptiness(rng) );
+}
+
+
+// templates
+//
+
+template< class Range >
+void test_CArray(const Range& sample)
+{
+    typedef typename boost::range_value<Range>::type val_t;
+
+    typedef ::CArray<val_t, const val_t&> rng_t; // An old MFC needs the second template argument.
+    BOOST_STATIC_ASSERT(( brdm::test_mutable_iter<rng_t, val_t *>::value ));
+    BOOST_STATIC_ASSERT(( brdm::test_const_iter  <rng_t, val_t const*>::value ));
+
+    rng_t rng;
+    BOOST_CHECK( brdm::test_init_array(rng, sample) );
+    BOOST_CHECK( brdm::test_random_access(rng) );
+    BOOST_CHECK( brdm::test_emptiness(rng) );
+}
+
+
+template< class Range >
+void test_CList(const Range& sample)
+{
+    typedef typename boost::range_value<Range>::type val_t;
+
+    typedef ::CList<val_t, const val_t&> rng_t;
+
+    BOOST_STATIC_ASSERT(( brdm::test_mutable_iter< rng_t, brdm::list_iterator<rng_t,       val_t> >::value ));
+#if !defined(BOOST_RANGE_MFC_CONST_COL_RETURNS_NON_REF)
+    BOOST_STATIC_ASSERT(( brdm::test_const_iter  < rng_t, brdm::list_iterator<rng_t const, val_t const> >::value ));
+#else
+    BOOST_STATIC_ASSERT(( brdm::test_const_iter  < rng_t, brdm::list_iterator<rng_t const, val_t const, val_t const> >::value ));
+#endif
+
+    rng_t rng;
+    BOOST_CHECK( brdm::test_init_list(rng, sample) );
+    BOOST_CHECK( brdm::test_bidirectional(rng) );
+    BOOST_CHECK( brdm::test_emptiness(rng) );
+}
+
+
+template< class MapT >
+void test_CMap(const MapT& sample)
+{
+    typedef typename MapT::key_type k_t;
+    typedef typename MapT::mapped_type m_t;
+
+    typedef ::CMap<k_t, const k_t&, m_t, const m_t&> rng_t;
+
+    rng_t rng;
+    boost::function_requires< boost::ForwardRangeConcept<rng_t> >();
+    BOOST_CHECK( brdm::test_init_map(rng, sample) );
+#if !defined(BOOST_RANGE_MFC_NO_CPAIR)
+    BOOST_CHECK( ::test_mfc_cpair_map(rng, sample) );
+#endif
+    BOOST_CHECK( brdm::test_emptiness(rng) );
+}
+
+
+void test_CTypedPtrArray()
+{
+    typedef ::CTypedPtrArray< ::CPtrArray, int * > rng_t;
+    boost::function_requires< boost::RandomAccessRangeConcept<rng_t> >();
+
+    rng_t rng;
+    int o1, o2, o3, o4, o5;
+    int *data[] = { &o1, &o2, &o3, &o4, &o5 };
+    BOOST_CHECK( brdm::test_init_array(rng, boost::make_iterator_range(data, data+5)) );
+
+    BOOST_CHECK( *(boost::begin(rng) + 2) == &o3 );
+    BOOST_CHECK( *(boost::end(rng) - 1) == &o5 );        
+
+    // BOOST_CHECK( brdm::test_random_access(rng) ); this range is not mutable
+    BOOST_CHECK( brdm::test_emptiness(rng) );
+}
+
+
+void test_CTypedPtrList()
+{
+    typedef ::CTypedPtrList< ::CObList, ::CObList * > rng_t;
+    boost::function_requires< boost::BidirectionalRangeConcept<rng_t> >();
+
+    rng_t rng;
+
+    ::CObList o1, o2, o3, o4, o5;
+    ::CObList *data[] = { &o1, &o2, &o3, &o4, &o5 };
+    BOOST_CHECK( brdm::test_init_list(rng, data) );
+
+    boost::range_iterator<rng_t>::type it = boost::begin(rng);
+    std::advance(it, 1);
+    BOOST_CHECK( *it == &o2 );
+    std::advance(it, 2);
+    BOOST_CHECK( *it == &o4 );
+
+    // BOOST_CHECK( brdm::test_bidirectional(rng) ); this range is not mutable
+    BOOST_CHECK( brdm::test_emptiness(rng) );
+}
+
+
+void test_CTypedPtrMap()
+{
+    typedef ::CTypedPtrMap< ::CMapStringToPtr, ::CString, int *> rng_t;
+    boost::function_requires< boost::ForwardRangeConcept<rng_t> >();
+
+    rng_t rng;
+    ::CString o0(_T('a')), o1(_T('c')), o2(_T('f')), o3(_T('q')), o4(_T('g'));
+    int d0, d1, d2, d3, d4;
+    std::map< ::CString, int * > data;
+    data[o0] = &d0, data[o1] = &d1, data[o2] = &d2, data[o3] = &d3, data[o4] = &d4;
+
+    BOOST_CHECK( brdm::test_init_map(rng, data) );
+    BOOST_CHECK( ::test_mfc_map(rng, data) );
+    BOOST_CHECK( brdm::test_emptiness(rng) );
+}
+
+
+// strings
+//
+#if defined(BOOST_RANGE_MFC_HAS_LEGACY_STRING)
+
+    template< class Range >
+    void test_CString(const Range& sample)
+    {
+        typedef typename boost::range_value<Range>::type val_t;
+
+        typedef ::CString rng_t; // An old MFC needs the second template argument.
+        BOOST_STATIC_ASSERT(( brdm::test_mutable_iter<rng_t, TCHAR *>::value ));
+        BOOST_STATIC_ASSERT(( brdm::test_const_iter  <rng_t, TCHAR const*>::value ));
+
+        rng_t rng;
+        BOOST_CHECK( brdm::test_init_string(rng, sample) );
+        BOOST_CHECK( brdm::test_random_access(rng) );
+        BOOST_CHECK( brdm::test_emptiness(rng) );
+    }
+
+#endif
+
+
+struct CPerson
+{
+    void hello_range() { };
+};
+
+
+void test_mfc()
+{
+#if 0
+    // overview
+    //
+    {
+        CTypedPtrArray<CPtrArray, CList<CString> *> myArray;
+        // ...
+        BOOST_FOREACH (CList<CString> *theList, myArray)
+        {
+            BOOST_FOREACH (CString& str, *theList)
+            {
+                boost::to_upper(str);
+                std::sort(boost::begin(str), boost::end(str));
+                // ...
+            }
+        }
+    }
+#endif
+
+    // arrays
+    //
+    {
+        BYTE data[] = { 4,5,1,3,5,12,3,1,3,1,6,1,3,60,1,1,5,1,3,1,10 };
+
+        ::test_CByteArray(boost::make_iterator_range(data, data+22));
+    }
+
+    {
+        DWORD data[] = { 4,5,1,3,5,12,3,1,3,1,6,1,3,60,1,1,5,1,3,1,10 };
+
+        test_CDWordArray(boost::make_iterator_range(data, data+22));
+    }
+
+    {
+        ::CObArray o1, o2, o3, o4, o5;
+        ::CObject *data[] = { &o1, &o2, &o3, &o4, &o5 };
+
+        ::test_CObArray(boost::make_iterator_range(data, data+5));
+    }
+
+    {
+        ::CPtrArray o1, o2, o3, o4, o5;
+        void *data[] = { &o1, &o2, &o3, &o4, &o5 };
+
+        ::test_CPtrArray(boost::make_iterator_range(data, data+5));
+    }
+
+    {
+        ::CString data[] = {
+            ::CString(_T('0')), ::CString(_T('1')), ::CString(_T('2')), ::CString(_T('3')),
+            ::CString(_T('4')), ::CString(_T('5')), ::CString(_T('6')), ::CString(_T('7'))
+        };
+
+        ::test_CStringArray(boost::make_iterator_range(data, data+8));
+    }
+
+    {
+        ::CUIntArray rng;
+        UINT data[] = { 4,5,1,3,5,12,3,1,3,1,6,1,3,60,1,1,5,1,3,1,10 };
+
+        ::test_CUIntArray(boost::make_iterator_range(data, data+22));
+    }
+
+    {
+        ::CWordArray rng;
+        WORD data[] = { 4,5,1,3,5,12,3,1,3,1,6,1,3,60,1,1,5,1,3,1,10 };
+
+        ::test_CWordArray(boost::make_iterator_range(data, data+22));
+    }
+
+    
+    // lists
+    //
+    {
+        ::CObList rng;
+        ::CObList o1, o2, o3, o4, o5;
+        ::CObject *data[] = { &o1, &o2, &o3, &o4, &o5 };
+
+        ::test_CObList(boost::make_iterator_range(data, data+5));
+    }
+
+    {
+        ::CPtrList rng;
+        ::CPtrList o1, o2, o3, o4, o5;
+        void *data[] = { &o1, &o2, &o3, &o4, &o5 };
+
+        ::test_CPtrList(boost::make_iterator_range(data, data+5));
+    }
+
+    {
+        ::CString data[] = {
+            ::CString(_T('0')), ::CString(_T('1')), ::CString(_T('2')), ::CString(_T('3')),
+            ::CString(_T('4')), ::CString(_T('5')), ::CString(_T('6')), ::CString(_T('7'))
+        };
+
+        ::test_CStringList(boost::make_iterator_range(data, data+8));
+    }
+
+
+    // maps
+    //
+    {
+        std::map<void *, WORD> data;
+        int o0, o1, o2, o3, o4;
+        data[&o0] = 15, data[&o1] = 14, data[&o2] = 3, data[&o3] = 6, data[&o4] = 1;
+
+        ::test_CMapPtrToWord(data);
+    }
+
+    {
+        std::map<void *, void*> data;
+        int o0, o1, o2, o3, o4;
+        data[&o0] = &o3, data[&o1] = &o2, data[&o2] = &o1, data[&o3] = &o0, data[&o4] = &o4;
+
+        ::test_CMapPtrToPtr(data);
+    }
+
+    {
+        std::map< ::CString, CObject * > data;
+        CObArray o0, o1, o2, o3, o4;
+        data[ ::CString('0') ] = &o0, data[ ::CString('1') ] = &o1, data[ ::CString('2') ] = &o2,
+        data[ ::CString('3') ] = &o3, data[ ::CString('4') ] = &o4;
+
+        ::test_CMapStringToOb(data);
+    }
+
+    {
+        std::map< ::CString, void * > data;
+        CObArray o0, o1, o2, o3, o4;
+        data[ ::CString('0') ] = &o0, data[ ::CString('1') ] = &o1, data[ ::CString('2') ] = &o2,
+        data[ ::CString('3') ] = &o3, data[ ::CString('4') ] = &o4;
+
+        ::test_CMapStringToPtr(data);
+    }
+
+    {
+        std::map< ::CString, ::CString > data;
+        CString o0('a'), o1('b'), o2('c'), o3('d'), o4('e');
+        data[ ::CString('0') ] = o0, data[ ::CString('1') ] = o1, data[ ::CString('2') ] = o2,
+        data[ ::CString('3') ] = o3, data[ ::CString('4') ] = o4;
+
+        ::test_CMapStringToString(data);
+    }
+
+    {
+        std::map< WORD, CObject * > data;
+        ::CDWordArray o0, o1, o2, o3, o4;
+        data[21] = &o3, data[52] = &o2, data[12] = &o1, data[76] = &o0, data[54] = &o4;
+
+        ::test_CMapWordToOb(data);
+    }
+
+    {
+        std::map< WORD, void * > data;
+        ::CDWordArray o0, o1, o2, o3, o4;
+        data[21] = &o3, data[52] = &o2, data[12] = &o1, data[76] = &o0, data[54] = &o4;
+
+        ::test_CMapWordToPtr(data);
+    }
+
+    // templates
+    //
+    {
+        std::string data("0987654321qwertyuiop");
+        ::test_CArray(data);
+        ::test_CList(data);
+    }    
+
+    {
+        std::wstring data(L"asdfghjklzxcvbnm");
+        ::test_CArray(data);
+        ::test_CList(data);
+    }    
+
+    {
+        std::map< int, std::string > data;
+        data[0] = "abcde", data[1] = "ajfie", data[2] = "lij", data[3] = "abc", data[4] = "ioiu";
+
+        ::test_CMap(data);
+    }
+
+
+    // typed
+    //
+    {
+        ::test_CTypedPtrArray();
+        ::test_CTypedPtrList();
+        ::test_CTypedPtrMap();
+    }
+
+
+    // strings
+    //
+#if defined(BOOST_RANGE_MFC_HAS_LEGACY_STRING)
+    {
+        std::string data("123456789 abcdefghijklmn");
+        ::test_CString(data);
+    }
+#endif
+
+
+} // test_mfc
+
 
 #include <boost/test/unit_test.hpp>
 using boost::unit_test::test_suite;
 
 
-test_suite* init_unit_test_suite( int argc, char* argv[] )
+test_suite *
+init_unit_test_suite(int argc, char* argv[])
 {
-    test_suite* test = BOOST_TEST_SUITE( "Range Test Suite" );
-
-    test->add( BOOST_TEST_CASE( &check_mfc ) );
+    test_suite *test = BOOST_TEST_SUITE("MFC Range Test Suite");
+    test->add(BOOST_TEST_CASE(&test_mfc));
 
+    (void)argc, (void)argv; // unused
     return test;
 }
-
-
-
-
-
-
diff --git a/test/partial_workaround.cpp b/test/partial_workaround.cpp
index ba014ae..8ac6f66 100755
--- a/test/partial_workaround.cpp
+++ b/test/partial_workaround.cpp
@@ -17,18 +17,15 @@
 #endif
 
 #ifdef BOOST_NO_TEMPLATE_PARTIAL_SPECIALIZATION
+//#define BOOST_NO_TEMPLATE_PARTIAL_SPECIALIZATION 1
 
 #include <boost/range/iterator.hpp>
 #include <boost/range/const_iterator.hpp>
 #include <boost/range/size_type.hpp>
 #include <boost/range/value_type.hpp>
 #include <boost/range/difference_type.hpp>
-#include <boost/range/result_iterator.hpp>
 
-#include <boost/range/begin.hpp>
-#include <boost/range/end.hpp>
-#include <boost/range/size.hpp>
-#include <boost/range/empty.hpp>
+#include <boost/range/functions.hpp>
 #include <boost/range/detail/sfinae.hpp>
 
 #include <boost/static_assert.hpp>
diff --git a/test/reversible_range.cpp b/test/reversible_range.cpp
index 26d953a..9dfe8d0 100755
--- a/test/reversible_range.cpp
+++ b/test/reversible_range.cpp
@@ -23,6 +23,7 @@
 #include <boost/static_assert.hpp>
 #include <boost/type_traits.hpp>
 #include <boost/test/test_tools.hpp>
+#include <boost/test/unit_test.hpp>
 #include <vector>
 #include <algorithm>
 
@@ -31,7 +32,7 @@ using namespace std;
 
 void check_iterator()
 {
-    typedef vector<char>                          vec_t;
+    typedef vector<int>                           vec_t;
     typedef vec_t::iterator                       iterator;
     typedef pair<iterator,iterator>               pair_t;
     typedef range_reverse_iterator<pair_t>::type  rev_iterator;
@@ -40,15 +41,8 @@ void check_iterator()
     vec_t                            vec;
     pair_t                           p    = make_pair( vec.begin(), vec.end() );
     rev_pair_t                       rp   = make_pair( rbegin( p ), rend( p ) );
-    char*                            str  = "mutable";
-    const char*                      cstr = "not mutable";
-    char                             a[]  = "mutable";
-    const char                       ca[] = "not mutable";                        
-    wchar_t*                         wstr = L"mutable";
-    const wchar_t*                   cwstr= L"not mutable";
-    wchar_t                          wa[] = L"mutable";
-    const wchar_t                    cwa[]= L"not mutable";
-         
+    int                             a[]  = {1,2,3,4,5,6,7,8,9,10};
+    const int                       ca[] = {1,2,3,4,5,6,7,8,9,10,11,12};                        
     BOOST_CHECK( rbegin( vec ) == range_reverse_iterator<vec_t>::type( vec.end() ) );
     BOOST_CHECK( rend( vec ) == range_reverse_iterator<vec_t>::type( vec.begin() ) );
     BOOST_CHECK( std::distance( rbegin( vec ), rend( vec ) ) == std::distance( begin( vec ), end( vec ) ) );
@@ -58,33 +52,16 @@ void check_iterator()
     BOOST_CHECK( std::distance( rbegin( p ), rend( p ) ) == std::distance( begin( rp ), end( rp ) ) );
     BOOST_CHECK( std::distance( begin( p ), end( p ) ) == std::distance( rbegin( rp ), rend( rp ) ) );
 
-    BOOST_CHECK_EQUAL( &*begin( str ), &*( rend( str ) - 1 ) );
-    BOOST_CHECK_EQUAL( &*( end( str ) - 1 ), &*rbegin( str ) );
-    BOOST_CHECK_EQUAL( &*begin( cstr ), &*( rend( cstr ) - 1 ) );
-    BOOST_CHECK_EQUAL( &*( end( cstr ) - 1 ), &*rbegin( cstr ) );
 
     BOOST_CHECK_EQUAL( &*begin( a ), &*( rend( a ) - 1 ) );
     BOOST_CHECK_EQUAL( &*( end( a ) - 1 ), &*rbegin( a ) );
     BOOST_CHECK_EQUAL( &*begin( ca ), &*( rend( ca ) - 1 ) );
     BOOST_CHECK_EQUAL( &*( end( ca ) - 1 ), &*rbegin( ca ) );
-
-    BOOST_CHECK_EQUAL( &*begin( wstr ), &*( rend( wstr ) - 1 ) );
-    BOOST_CHECK_EQUAL( &*( end( wstr ) - 1 ), &*rbegin( wstr ) );
-    BOOST_CHECK_EQUAL( &*begin( cwstr ), &*( rend( cwstr ) - 1 ) );
-    BOOST_CHECK_EQUAL( &*( end( cwstr ) - 1 ), &*rbegin( cwstr ) );
-    
-    BOOST_CHECK_EQUAL( &*begin( wa ), &*( rend( wa ) - 1 ) );
-    BOOST_CHECK_EQUAL( &*( end( wa ) - 1 ), &*rbegin( wa ) );
-    BOOST_CHECK_EQUAL( &*begin( cwa ), &*( rend( cwa ) - 1 ) );
-    BOOST_CHECK_EQUAL( &*( end( cwa ) - 1 ), &*rbegin( cwa ) );
-
 }
 
 
-#include <boost/test/unit_test.hpp>
 using boost::unit_test::test_suite;
 
-
 test_suite* init_unit_test_suite( int argc, char* argv[] )
 {
     test_suite* test = BOOST_TEST_SUITE( "Range Test Suite" );
diff --git a/test/std_container.cpp b/test/std_container.cpp
index a61e8d1..e2ee692 100755
--- a/test/std_container.cpp
+++ b/test/std_container.cpp
@@ -35,27 +35,25 @@ void check_std_container()
 
     BOOST_STATIC_ASSERT(( is_same< range_value<vec_t>::type, vec_t::value_type >::value ));
     BOOST_STATIC_ASSERT(( is_same< range_iterator<vec_t>::type, vec_t::iterator >::value ));
-    BOOST_STATIC_ASSERT(( is_same< range_const_iterator<vec_t>::type, vec_t::const_iterator >::value ));
+    BOOST_STATIC_ASSERT(( is_same< range_iterator<const vec_t>::type, vec_t::const_iterator >::value ));
     BOOST_STATIC_ASSERT(( is_same< range_difference<vec_t>::type, vec_t::difference_type >::value ));
     BOOST_STATIC_ASSERT(( is_same< range_size<vec_t>::type, vec_t::size_type >::value ));
-    BOOST_STATIC_ASSERT(( is_same< range_result_iterator<vec_t>::type, vec_t::iterator >::value ));
-    BOOST_STATIC_ASSERT(( is_same< range_result_iterator<const vec_t>::type, vec_t::const_iterator >::value ));
+    BOOST_STATIC_ASSERT(( is_same< range_iterator<vec_t>::type, vec_t::iterator >::value ));
+    BOOST_STATIC_ASSERT(( is_same< range_iterator<const vec_t>::type, vec_t::const_iterator >::value ));
     
     BOOST_STATIC_ASSERT(( is_same< range_value<const vec_t>::type, vec_t::value_type >::value ));
-    BOOST_STATIC_ASSERT(( is_same< range_iterator<const vec_t>::type, vec_t::iterator >::value ));
-    BOOST_STATIC_ASSERT(( is_same< range_const_iterator<const vec_t>::type, vec_t::const_iterator >::value ));
     BOOST_STATIC_ASSERT(( is_same< range_difference<const vec_t>::type, vec_t::difference_type >::value ));
     BOOST_STATIC_ASSERT(( is_same< range_size<const vec_t>::type, vec_t::size_type >::value ));
 
     BOOST_CHECK( begin( vec ) == vec.begin() );
     BOOST_CHECK( end( vec )   == vec.end() );
     BOOST_CHECK( empty( vec ) == vec.empty() );
-    BOOST_CHECK( size( vec ) == vec.size() );
+    BOOST_CHECK( (std::size_t)size( vec ) == vec.size() );
     
     BOOST_CHECK( begin( cvec ) == cvec.begin() );
     BOOST_CHECK( end( cvec )   == cvec.end() );
     BOOST_CHECK( empty( cvec ) == cvec.empty() );
-    BOOST_CHECK( size( cvec ) == cvec.size() );
+    BOOST_CHECK( (std::size_t)size( cvec ) == cvec.size() );
 
 }
 
diff --git a/test/string.cpp b/test/string.cpp
index 36f103b..9a2e5a8 100755
--- a/test/string.cpp
+++ b/test/string.cpp
@@ -17,7 +17,10 @@
 #  pragma warn -8057 // unused argument argc/argv in Boost.Test
 #endif
 
-#include <boost/range.hpp>
+#include <boost/range/as_array.hpp>
+#include <boost/range/as_literal.hpp>
+#include <boost/range/functions.hpp>
+#include <boost/range/metafunctions.hpp>
 #include <boost/static_assert.hpp>
 #include <boost/type_traits.hpp>
 #include <boost/test/test_tools.hpp>
@@ -26,36 +29,66 @@
 #include <fstream>
 #include <algorithm>
 
+template< class T >
+inline BOOST_DEDUCED_TYPENAME boost::range_iterator<T>::type
+str_begin( T& r )
+{
+    return boost::begin( boost::as_literal(r) ); 
+}
+
+template< class T >
+inline BOOST_DEDUCED_TYPENAME boost::range_iterator<T>::type
+str_end( T& r )
+{
+    return boost::end( boost::as_literal(r) ); 
+}
+
+template< class T >
+inline BOOST_DEDUCED_TYPENAME boost::range_size<T>::type
+str_size( const T& r )
+{
+    return boost::size( boost::as_literal(r) ); 
+}
+
+template< class T >
+inline bool
+str_empty( T& r )
+{
+    return boost::empty( boost::as_literal(r) ); 
+}
+
 template< typename Container, typename T >
 BOOST_DEDUCED_TYPENAME boost::range_iterator<Container>::type
 find( Container& c,  T value )
 {
-    return std::find( boost::begin( c ), boost::end( c ), value );
+    return std::find( str_begin(c), str_end(c), 
+                      value );
 }
 
 template< typename Container, typename T >
-BOOST_DEDUCED_TYPENAME boost::range_const_iterator<Container>::type
+BOOST_DEDUCED_TYPENAME boost::range_iterator<const Container>::type
 find( const Container& c, T value )
 {
-    return std::find( boost::begin( c ), boost::end( c ), value );
+    return std::find( str_begin(c), str_end(c), 
+                      value );
 }
 
 template< typename Container, typename T >
 BOOST_DEDUCED_TYPENAME boost::range_iterator<Container>::type
 find_mutable( Container& c,  T value )
-{
-    boost::size( c );
-    boost::end( c );
-    return std::find( boost::begin( c ), boost::end( c ), value );
+{ 
+    str_size( c );
+    return std::find( str_begin(c), str_end(c), 
+                      value );
 }
 
 template< typename Container, typename T >
-BOOST_DEDUCED_TYPENAME boost::range_const_iterator<Container>::type
+BOOST_DEDUCED_TYPENAME boost::range_iterator<const Container>::type
 find_const( const Container& c, T value )
 {
-    boost::size( c );
-    boost::end( c );
-    return std::find( boost::begin( c ), boost::end( c ), value );
+    str_size( c );
+    return std::find( str_begin(c), str_end(c), 
+                      value );
 }
 
 
@@ -72,62 +105,66 @@ void check_char()
 {
     typedef char*                  char_iterator_t;
     typedef char                   char_array_t[10];
-    const char*      char_s           = "a string";
-    char             my_string[]      = "another string";
-    const unsigned   my_string_length = 14;
-    char*            char_s2          = "a string";
+    const char*      char_s            = "a string";
+    char             my_string[]       = "another string";
+    const char       my_const_string[] = "another string";
+    const unsigned   my_string_length  = 14;
+    char*            char_s2           = "a string";
     
     BOOST_STATIC_ASSERT(( is_same<  range_value<char_iterator_t>::type, 
                                     detail::iterator_traits<char_iterator_t>::value_type>::value ));
     BOOST_STATIC_ASSERT(( is_same<  range_iterator<char_iterator_t>::type, char_iterator_t >::value ));
-    BOOST_STATIC_ASSERT(( is_same<  range_const_iterator<char_iterator_t>::type, const char* >::value ));
+
     BOOST_STATIC_ASSERT(( is_same<  range_difference<char_iterator_t>::type,                           
                                     ::std::ptrdiff_t >::value ));
     BOOST_STATIC_ASSERT(( is_same<  range_size<char_iterator_t>::type, std::size_t >::value ));
-    BOOST_STATIC_ASSERT(( is_same<  range_result_iterator<char_iterator_t>::type, char_iterator_t >::value ));
-    BOOST_STATIC_ASSERT(( is_same<  range_result_iterator<const char*>::type, const char* >::value ));
+    BOOST_STATIC_ASSERT(( is_same<  range_iterator<char_iterator_t>::type, char_iterator_t >::value ));
+    BOOST_STATIC_ASSERT(( is_same<  range_iterator<const char*>::type, const char* >::value ));
     
     BOOST_STATIC_ASSERT(( is_same< range_value<char_array_t>::type, 
                                     char>::value ));
     BOOST_STATIC_ASSERT(( is_same< range_iterator<char_array_t>::type, char* >::value ));
-    BOOST_STATIC_ASSERT(( is_same< range_const_iterator<char_array_t>::type, const char* >::value ));
+    BOOST_STATIC_ASSERT(( is_same< range_iterator<const char_array_t>::type, const char* >::value ));
     BOOST_STATIC_ASSERT(( is_same< range_difference<char_array_t>::type,                           
                                     ::std::ptrdiff_t >::value ));
     BOOST_STATIC_ASSERT(( is_same< range_size<char_array_t>::type, std::size_t >::value ));
-    BOOST_STATIC_ASSERT(( is_same< range_result_iterator<char_array_t>::type, char* >::value ));
-    BOOST_STATIC_ASSERT(( is_same< range_result_iterator<const char_array_t>::type, const char* >::value ));
+    BOOST_STATIC_ASSERT(( is_same< range_iterator<char_array_t>::type, char* >::value ));
+    BOOST_STATIC_ASSERT(( is_same< range_iterator<const char_array_t>::type, const char* >::value ));
 
-    BOOST_CHECK_EQUAL( begin( char_s ), char_s );
-    std::size_t sz = size( char_s );
-    const char* end1 = begin( char_s ) + sz; 
-    BOOST_CHECK_EQUAL( end( char_s ), end1 );
-    BOOST_CHECK_EQUAL( empty( char_s ), (char_s == 0 || char_s[0] == char()) );
+    BOOST_CHECK_EQUAL( str_begin( char_s ), char_s );
+    std::size_t sz = str_size(char_s);
+    const char* str_end1 = str_begin( char_s ) + sz; 
+    BOOST_CHECK_EQUAL( str_end( char_s ), str_end1 );
+    BOOST_CHECK_EQUAL( str_empty( char_s ), (char_s == 0 || char_s[0] == char()) );
     BOOST_CHECK_EQUAL( sz, std::char_traits<char>::length( char_s ) );
 /*    
-    BOOST_CHECK_EQUAL( begin( char_s2 ), char_s2 );
+    BOOST_CHECK_EQUAL( str_begin( char_s2 ), char_s2 );
     std::size_t sz2 = size( char_s2 );
-    const char* end12 = begin( char_s2 ) + sz;
-    BOOST_CHECK_EQUAL( end( char_s2 ), end12 );
+    const char* str_end12 = str_begin( char_s2 ) + sz;
+    BOOST_CHECK_EQUAL( str_end( char_s2 ), str_end12 );
     BOOST_CHECK_EQUAL( empty( char_s2 ), (char_s2 == 0 || char_s2[0] == char()) );
     BOOST_CHECK_EQUAL( sz2, std::char_traits<char>::length( char_s2 ) );
 */
-    BOOST_CHECK_EQUAL( begin( my_string ), my_string );
-    range_iterator<char_array_t>::type end2 = begin( my_string ) + size( my_string );
-    range_iterator<char_array_t>::type end3 = end( my_string );
-    BOOST_CHECK_EQUAL( end3, end2 );
-    BOOST_CHECK_EQUAL( empty( my_string ), (my_string == 0 || my_string[0] == char()) );
-    BOOST_CHECK_EQUAL( size( my_string ), my_string_length );
-    BOOST_CHECK_EQUAL( size( my_string ), std::char_traits<char>::length( my_string ) );
+    BOOST_CHECK_EQUAL( str_begin( my_string ), my_string );
+    range_iterator<char_array_t>::type str_end2 = str_begin( my_string ) + str_size(my_string);
+    range_iterator<char_array_t>::type str_end3 = str_end(my_string);
+    BOOST_CHECK_EQUAL( str_end3, str_end2 );
+    BOOST_CHECK_EQUAL( str_empty( my_string ), (my_string == 0 || my_string[0] == char()) );
+    BOOST_CHECK_EQUAL( str_size( my_string ), my_string_length );
+    BOOST_CHECK_EQUAL( str_size( my_string ), std::char_traits<char>::length( my_string ) );
 
     char to_search = 'n';
-    BOOST_CHECK( find_mutable( char_s, to_search ) != end( char_s ) );
-    BOOST_CHECK( find_const( char_s, to_search ) != end( char_s ) );
+    BOOST_CHECK( find_mutable( char_s, to_search ) != str_end( char_s ) );
+    BOOST_CHECK( find_const( char_s, to_search ) != str_end(char_s) );
 
-    BOOST_CHECK( find_mutable( my_string, to_search ) != end( my_string ) );
-    BOOST_CHECK( find_const( my_string, to_search ) != end( my_string ) );
+    BOOST_CHECK( find_mutable( my_string, to_search ) != str_end(my_string) );
+    BOOST_CHECK( find_const( my_string, to_search ) != str_end(my_string) );
 
-    BOOST_CHECK( find_mutable( char_s2, to_search ) != end( char_s2 ) );   
-    BOOST_CHECK( find_const( char_s2, to_search ) != end( char_s2 ) );   
+    BOOST_CHECK( find_mutable( char_s2, to_search ) != str_end(char_s) );   
+    BOOST_CHECK( find_const( char_s2, to_search ) != str_end(char_s2) );
+
+    BOOST_CHECK( find_const( as_array( my_string ), to_search ) != str_end(my_string) );
+    BOOST_CHECK( find_const( as_array( my_const_string ), to_search ) != str_end(my_string) );
 }
 
 
@@ -148,31 +185,31 @@ void check_string()
     BOOST_STATIC_ASSERT(( is_same< range_value<wchar_iterator_t>::type, 
                                    detail::iterator_traits<wchar_iterator_t>::value_type>::value ));
     BOOST_STATIC_ASSERT(( is_same< range_iterator<wchar_iterator_t>::type, wchar_iterator_t >::value ));
-    BOOST_STATIC_ASSERT(( is_same< range_const_iterator<wchar_iterator_t>::type, const wchar_t* >::value ));
+    BOOST_STATIC_ASSERT(( is_same< range_iterator<const wchar_t*>::type, const wchar_t* >::value ));
     BOOST_STATIC_ASSERT(( is_same< range_difference<wchar_iterator_t>::type,                           
                                    detail::iterator_traits<wchar_iterator_t>::difference_type >::value ));
     BOOST_STATIC_ASSERT(( is_same< range_size<wchar_iterator_t>::type, std::size_t >::value ));
-    BOOST_STATIC_ASSERT(( is_same< range_result_iterator<wchar_iterator_t>::type, wchar_iterator_t >::value ));
-    BOOST_STATIC_ASSERT(( is_same< range_result_iterator<const wchar_t*>::type, const wchar_t* >::value ));
+    BOOST_STATIC_ASSERT(( is_same< range_iterator<wchar_iterator_t>::type, wchar_iterator_t >::value ));
+    BOOST_STATIC_ASSERT(( is_same< range_iterator<const wchar_t*>::type, const wchar_t* >::value ));
     
-    std::size_t sz = size( char_ws );
-    BOOST_CHECK_EQUAL( begin( char_ws ), char_ws );
-    BOOST_CHECK_EQUAL( end( char_ws ), (begin( char_ws ) + sz) );
-    BOOST_CHECK_EQUAL( empty( char_ws ), (char_ws == 0 || char_ws[0] == wchar_t()) );
+    std::size_t sz = str_size( char_ws );
+    BOOST_CHECK_EQUAL( str_begin( char_ws ), char_ws );
+    BOOST_CHECK_EQUAL( str_end(char_ws), (str_begin( char_ws ) + sz) );
+    BOOST_CHECK_EQUAL( str_empty( char_ws ), (char_ws == 0 || char_ws[0] == wchar_t()) );
     BOOST_CHECK_EQUAL( sz, std::char_traits<wchar_t>::length( char_ws ) );
  /*       
     std::size_t sz2 = size( char_ws2 );
-    BOOST_CHECK_EQUAL( begin( char_ws2 ), char_ws2 );
-    BOOST_CHECK_EQUAL( end( char_ws2 ), (begin( char_ws2 ) + sz2) );
+    BOOST_CHECK_EQUAL( str_begin( char_ws2 ), char_ws2 );
+    BOOST_CHECK_EQUAL( str_end( char_ws2 ), (begin( char_ws2 ) + sz2) );
     BOOST_CHECK_EQUAL( empty( char_ws2 ), (char_ws2 == 0 || char_ws2[0] == wchar_t()) );
     BOOST_CHECK_EQUAL( sz2, std::char_traits<wchar_t>::length( char_ws2 ) );
    */ 
     wchar_t to_search = L'n';
-    BOOST_CHECK( find( char_ws, to_search ) != end( char_ws ) );    
+    BOOST_CHECK( find( char_ws, to_search ) != str_end(char_ws) );    
 
 #if BOOST_WORKAROUND(_MSC_VER, BOOST_TESTED_AT(1300))
 
-    BOOST_CHECK( find( my_wstring, to_search ) != end( my_wstring ) );
+    BOOST_CHECK( find( my_wstring, to_search ) != str_end(my_wstring) );
 
 #endif  
 #endif
@@ -181,7 +218,6 @@ void check_string()
 
 }
 
-
 #include <boost/test/unit_test.hpp>
 using boost::unit_test::test_suite;
 
diff --git a/test/sub_range.cpp b/test/sub_range.cpp
index f590b53..7d5bf05 100755
--- a/test/sub_range.cpp
+++ b/test/sub_range.cpp
@@ -17,6 +17,7 @@
 #endif
 
 #include <boost/range/sub_range.hpp>
+#include <boost/range/as_literal.hpp> 
 #include <boost/test/test_tools.hpp>
 #include <iostream>
 #include <string>
@@ -91,16 +92,31 @@ void check_sub_range()
     r.size();
     s.size();
 
+    //
+    // As of range v2 not legal anymore.
+    //
+    //irange singular_irange;
+    //BOOST_CHECK( singular_irange.empty() );
+    //BOOST_CHECK( singular_irange.size() == 0 );
+    //
+    //srange singular_srange;
+    //BOOST_CHECK( singular_srange.empty() );
+    //BOOST_CHECK( singular_srange.size() == 0 );
+    //
+    //BOOST_CHECK( empty( singular_irange ) );
+    //BOOST_CHECK( empty( singular_srange ) );
+    //
+
     srange rr = make_iterator_range( str );
     BOOST_CHECK( rr.equal( r ) );
 
     rr  = make_iterator_range( str.begin(), str.begin() + 5 );
-    BOOST_CHECK( rr == "hello" );
-    BOOST_CHECK( rr != "hell" );
-    BOOST_CHECK( rr < "hello dude" );
-    BOOST_CHECK( "hello" == rr );
-    BOOST_CHECK( "hell"  != rr );
-    BOOST_CHECK( ! ("hello dude" < rr ) );
+    BOOST_CHECK( rr == as_literal("hello") );
+    BOOST_CHECK( rr != as_literal("hell") );
+    BOOST_CHECK( rr < as_literal("hello dude") );
+    BOOST_CHECK( as_literal("hello") == rr );
+    BOOST_CHECK( as_literal("hell")  != rr );
+    BOOST_CHECK( ! (as_literal("hello dude") < rr ) );
     
     irange rrr = rr;
     BOOST_CHECK( rrr == rr );
@@ -111,15 +127,16 @@ void check_sub_range()
     BOOST_CHECK_EQUAL( cr.front(), 'h' );
     BOOST_CHECK_EQUAL( cr.back(), 'd' );
     BOOST_CHECK_EQUAL( cr[1], 'e' );
+    BOOST_CHECK_EQUAL( cr(1), 'e' );
 
     rrr = make_iterator_range( str, 1, -1 );
-    BOOST_CHECK( rrr == "ello worl" );
+    BOOST_CHECK( rrr == as_literal("ello worl") );
     rrr = make_iterator_range( rrr, -1, 1 );
     BOOST_CHECK( rrr == str );
     rrr.front() = 'H';
     rrr.back()  = 'D';
     rrr[1]      = 'E';
-    BOOST_CHECK( rrr == "HEllo worlD" );
+    BOOST_CHECK( rrr == as_literal("HEllo worlD") );
 }   
 
 #include <boost/test/unit_test.hpp>

From 5afec2b74f2e34d60d57e943c015569a5c955fc9 Mon Sep 17 00:00:00 2001
From: =?UTF-8?q?Thorsten=20J=C3=B8rgen=20Ottosen?=
 <thorsten.ottosen@gmail.com>
Date: Mon, 3 Dec 2007 08:51:22 +0000
Subject: [PATCH 14/73] merge from truck (boost::size()->boost::distance())

[SVN r41635]
---
 include/boost/range/iterator_range.hpp | 4 ++--
 1 file changed, 2 insertions(+), 2 deletions(-)

diff --git a/include/boost/range/iterator_range.hpp b/include/boost/range/iterator_range.hpp
index 4304ecc..31b8ea8 100755
--- a/include/boost/range/iterator_range.hpp
+++ b/include/boost/range/iterator_range.hpp
@@ -77,8 +77,8 @@ namespace boost
         {
             typedef BOOST_DEDUCED_TYPENAME boost::range_difference<Left>::type sz_type;
 
-            sz_type l_size = boost::size( l ),
-                    r_size = boost::size( r );
+            sz_type l_size = boost::distance( l ),
+                    r_size = boost::distance( r );
 
             if( l_size != r_size )
                 return false;

From dbfa1df08817cf28b68264d63b1be4ddaf848d42 Mon Sep 17 00:00:00 2001
From: =?UTF-8?q?Thorsten=20J=C3=B8rgen=20Ottosen?=
 <thorsten.ottosen@gmail.com>
Date: Mon, 3 Dec 2007 09:01:03 +0000
Subject: [PATCH 15/73] missing include (Ticket #1463)

[SVN r41637]
---
 include/boost/range/sub_range.hpp | 2 ++
 1 file changed, 2 insertions(+)

diff --git a/include/boost/range/sub_range.hpp b/include/boost/range/sub_range.hpp
index 802454b..35dfb27 100755
--- a/include/boost/range/sub_range.hpp
+++ b/include/boost/range/sub_range.hpp
@@ -11,6 +11,8 @@
 #ifndef BOOST_RANGE_SUB_RANGE_HPP
 #define BOOST_RANGE_SUB_RANGE_HPP
 
+#include <boost/detail/workaround.hpp>
+
 #if BOOST_WORKAROUND(BOOST_MSVC, == 1310) || BOOST_WORKAROUND(BOOST_MSVC, == 1400) 
     #pragma warning( disable : 4996 )
 #endif

From 8291ce67fcf1c9c98f354f314e728383f5140f76 Mon Sep 17 00:00:00 2001
From: =?UTF-8?q?Thorsten=20J=C3=B8rgen=20Ottosen?=
 <thorsten.ottosen@gmail.com>
Date: Wed, 5 Dec 2007 17:30:23 +0000
Subject: [PATCH 16/73] minor changes from trunk

[SVN r41751]
---
 include/boost/range/detail/sizer.hpp | 6 ++----
 1 file changed, 2 insertions(+), 4 deletions(-)

diff --git a/include/boost/range/detail/sizer.hpp b/include/boost/range/detail/sizer.hpp
index 5d75437..b4c1c91 100755
--- a/include/boost/range/detail/sizer.hpp
+++ b/include/boost/range/detail/sizer.hpp
@@ -25,12 +25,10 @@ namespace boost
     //////////////////////////////////////////////////////////////////////
     
     template< typename T, std::size_t sz >
-    char&
-    sizer( const T BOOST_RANGE_ARRAY_REF()[sz] )[sz];
+    char (& sizer( const T BOOST_RANGE_ARRAY_REF()[sz] ) )[sz];
     
     template< typename T, std::size_t sz >
-    char&
-    sizer( T BOOST_RANGE_ARRAY_REF()[sz] )[sz];
+    char (& sizer( T BOOST_RANGE_ARRAY_REF()[sz] ) )[sz];
 
 } // namespace 'boost'
 

From fd00cc129fc989c8f4e2c5f194ee4d189f17912b Mon Sep 17 00:00:00 2001
From: =?UTF-8?q?Thorsten=20J=C3=B8rgen=20Ottosen?=
 <thorsten.ottosen@gmail.com>
Date: Sat, 12 Jan 2008 12:38:46 +0000
Subject: [PATCH 17/73] doc fixes

[SVN r42692]
---
 doc/boost_range.html   | 2 +-
 doc/history_ack.html   | 8 ++++----
 doc/intro.html         | 3 +--
 doc/portability.html   | 2 +-
 doc/utility_class.html | 9 +++++----
 5 files changed, 12 insertions(+), 12 deletions(-)

diff --git a/doc/boost_range.html b/doc/boost_range.html
index ace1901..ed84e1a 100644
--- a/doc/boost_range.html
+++ b/doc/boost_range.html
@@ -493,7 +493,7 @@ class=identifier>T</span><span class=special>&amp; </span><span class=identifier
         </p>
             <p>
                 <code>as_literal()</code> can be used <i>internally</i> in string 
-                algorithm librararies to such that arrays of characters are 
+                algorithm librararies such that arrays of characters are 
                 handled correctly.
                 </p>
             <p>
diff --git a/doc/history_ack.html b/doc/history_ack.html
index 40ee5dc..81f27b7 100755
--- a/doc/history_ack.html
+++ b/doc/history_ack.html
@@ -18,10 +18,10 @@
 
     <h2  >History and Acknowledgement</h2><a name="History" ></a>
     <p  >
-    The library have been under way for a long time. Dietmar Kühl originally 
-    intended to submit an <code  >array_traits</code> class template which 
-    had most of the functionality present now, but only for arrays and standard 
-    containers. 
+    The library was under way for a long time. Dietmar Kühl originally intended
+    to submit an <code>array_traits</code> class template which had most of
+    the functionality present now, but only for arrays and standard containers.
+    I believe this was back in 2001 or 2002.
     </p>
     
     <p>
diff --git a/doc/intro.html b/doc/intro.html
index 8478d3e..4ed653b 100755
--- a/doc/intro.html
+++ b/doc/intro.html
@@ -63,8 +63,7 @@ free-standing functions so syntactic and/or semantic differences can be removed.
 
     </ul>
     </p>
-    <p  >
-    Below are given a small example (the complete example can be found <a 
+    <p  > Below is given a small example (the complete example can be found <a
     href="../test/algorithm_example.cpp" target="_self" >here</a>): <blockquote>
         <pre  >
 <span class=comment>
diff --git a/doc/portability.html b/doc/portability.html
index 20b1355..506d5b2 100755
--- a/doc/portability.html
+++ b/doc/portability.html
@@ -35,7 +35,7 @@ href="http://boost.sourceforge.net/regression-logs/developer/range.html">here</a
     </p>
     <p  >
     Notice also that some compilers cannot do function template ordering properly. 
-    In that case one must rely of <a
+    In that case one must rely on <a
       href="boost_range.html#range_iterator"><code >range_iterator</code></a> 
       and a single function definition instead of overloaded versions for const and 
       non-const arguments.
diff --git a/doc/utility_class.html b/doc/utility_class.html
index f7b5535..c4afe54 100644
--- a/doc/utility_class.html
+++ b/doc/utility_class.html
@@ -33,11 +33,12 @@
     </ul>
     </ul>
 
-    The <code>iterator_range</code> class is templated on an 
-    <a href="../../iterator/doc/new-iter-concepts.html#forward-traversal-iterators-lib-forward-traversal-iterators">Forward 
+    The <code>iterator_range</code> class is templated on a <a
+    href="../../iterator/doc/new-iter-concepts.html#forward-traversal-iterators-lib-forward-traversal-iterators">Forward 
     Traversal Iterator</a> and should be used whenever fairly general code is needed. 
-    The <code>sub_range</code> class is templated on an <a href="range.html#forward_range">Forward
-    Range</a> and it is less general, but a bit easier to use since its template 
+    The <code>sub_range</code> class is templated on a <a 
+    href="range.html#forward_range">Forward Range</a> and it is less general, 
+    but a bit easier to use since its template 
     argument is easier to specify. The biggest difference is, however, that a 
     <code>sub_range</code> can propagate constness because it knows what a 
 corresponding <code>const_iterator</code> is. </p>

From 4d381e856432e034353609845de319a7bdb8c487 Mon Sep 17 00:00:00 2001
From: =?UTF-8?q?Thorsten=20J=C3=B8rgen=20Ottosen?=
 <thorsten.ottosen@gmail.com>
Date: Sun, 13 Jan 2008 11:38:13 +0000
Subject: [PATCH 18/73] fixed #if -> #ifdef

[SVN r42716]
---
 include/boost/range/as_literal.hpp | 6 +++---
 1 file changed, 3 insertions(+), 3 deletions(-)

diff --git a/include/boost/range/as_literal.hpp b/include/boost/range/as_literal.hpp
index 72f0eb5..b0d7593 100755
--- a/include/boost/range/as_literal.hpp
+++ b/include/boost/range/as_literal.hpp
@@ -15,7 +15,7 @@
 # pragma once
 #endif
 
-#if BOOST_NO_FUNCTION_TEMPLATE_ORDERING
+#ifdef BOOST_NO_FUNCTION_TEMPLATE_ORDERING
 #include <boost/range/detail/as_literal.hpp>
 #else
 
@@ -116,14 +116,14 @@ namespace boost
 
     
     template< class Char, std::size_t sz >
-	inline iterator_range<const Char*> as_literal( const Char (&arr)[sz] )
+    inline iterator_range<const Char*> as_literal( const Char (&arr)[sz] )
     {
 #if BOOST_WORKAROUND(__BORLANDC__, BOOST_TESTED_AT(0x590)) && __BORLANDC__ >= 0x590
         return boost::make_iterator_range<const Char*>( arr, arr + sz - 1 );
 #else
         return boost::make_iterator_range( arr, arr + sz - 1 );
 #endif
-	}
+    }
 }
 
 #endif // BOOST_NO_FUNCTION_TEMPLATE_ORDERING

From 062e820882ffbde1959c7d74857dd5ce29db2bbb Mon Sep 17 00:00:00 2001
From: =?UTF-8?q?Thorsten=20J=C3=B8rgen=20Ottosen?=
 <thorsten.ottosen@gmail.com>
Date: Thu, 7 Feb 2008 08:38:07 +0000
Subject: [PATCH 19/73] cleanup to pass inspection tool

[SVN r43139]
---
 doc/Jamfile.v2         | 10 ++++++++++
 doc/boost_range.html   |  8 +++++++-
 doc/example.cpp        | 10 ++++++++++
 doc/examples.html      |  9 ++++++++-
 doc/faq.html           | 11 +++++++++--
 doc/headers.html       |  9 ++++++++-
 doc/history_ack.html   |  9 ++++++++-
 doc/intro.html         |  9 ++++++++-
 doc/portability.html   | 11 +++++++++--
 doc/range.html         | 36 +++++++++---------------------------
 doc/style.css          | 11 +++++++++++
 doc/style.html         |  8 +++++++-
 doc/utility_class.html | 15 +++++++++++----
 test/TODO              |  1 -
 test/compat1.cpp       |  0
 15 files changed, 115 insertions(+), 42 deletions(-)
 delete mode 100644 test/TODO
 delete mode 100755 test/compat1.cpp

diff --git a/doc/Jamfile.v2 b/doc/Jamfile.v2
index 0fafdd7..bfe0908 100644
--- a/doc/Jamfile.v2
+++ b/doc/Jamfile.v2
@@ -1,3 +1,13 @@
+#// Boost.Range library
+#//
+#//  Copyright Thorsten Ottosen 2003-2008. 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/
+#//
+
 
 use-project boost : $(BOOST_ROOT) ;
 
diff --git a/doc/boost_range.html b/doc/boost_range.html
index ed84e1a..465bd18 100644
--- a/doc/boost_range.html
+++ b/doc/boost_range.html
@@ -745,7 +745,13 @@ class=identifier>T</span><span class=special>&amp; </span><span class=identifier
         
         <hr>
         <p>
-            (C) Copyright Thorsten Ottosen 2003-2007
+          &copy; <a name="Copyright" id="Copyright">Copyright</a> Thorsten Ottosen 2008.
+        </p>
+        
+        <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">www.boost.org/LICENSE_1_0.txt</a>)
         </p>
         <br>
         <br>
diff --git a/doc/example.cpp b/doc/example.cpp
index afe448f..d3dec7c 100644
--- a/doc/example.cpp
+++ b/doc/example.cpp
@@ -1,3 +1,13 @@
+// Boost.Range library
+//
+//  Copyright Thorsten Ottosen 2003-2008. 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.hpp>
 #include <iterator>         // for std::iterator_traits, std::distance()
 
diff --git a/doc/examples.html b/doc/examples.html
index 0ea235d..0d24509 100755
--- a/doc/examples.html
+++ b/doc/examples.html
@@ -41,9 +41,16 @@
         <li> <a href="../test/array.cpp">array.cpp</a>     
     </ul>
 
+
     <hr>
     <p>
-    (C) Copyright Thorsten Ottosen 2003-2004
+      &copy; <a name="Copyright" id="Copyright">Copyright</a> Thorsten Ottosen 2008.
+    </p>
+
+    <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">www.boost.org/LICENSE_1_0.txt</a>)
     </p>
 
     <br>
diff --git a/doc/faq.html b/doc/faq.html
index 34304ef..244df80 100755
--- a/doc/faq.html
+++ b/doc/faq.html
@@ -114,9 +114,16 @@ Cool indeed!
     </ol>
 
 
-    <hr>
+      <hr>
     <p>
-    (C) Copyright Thorsten Ottosen 2003-2004
+      &copy; <a name="Copyright" id="Copyright">Copyright</a> Thorsten Ottosen 2008.
+    </p>
+
+    <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">www.boost.org/LICENSE_1_0.txt</a>)
     </p>
 
     <br>
diff --git a/doc/headers.html b/doc/headers.html
index 69987ce..7628591 100755
--- a/doc/headers.html
+++ b/doc/headers.html
@@ -173,7 +173,14 @@
 
     <hr>
     <p>
-    (C) Copyright Thorsten Ottosen 2003-2007
+      &copy; <a name="Copyright" id="Copyright">Copyright</a> Thorsten Ottosen 2008.
+    </p>
+
+    <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">www.boost.org/LICENSE_1_0.txt</a>)
     </p>
 
     <br>
diff --git a/doc/history_ack.html b/doc/history_ack.html
index 81f27b7..c8527ba 100755
--- a/doc/history_ack.html
+++ b/doc/history_ack.html
@@ -61,7 +61,14 @@ C++ standard: <blockquote>
     
     <hr>
     <p>
-    (C) Copyright Thorsten Ottosen 2003-2006
+      &copy; <a name="Copyright" id="Copyright">Copyright</a> Thorsten Ottosen 2008.
+    </p>
+
+    <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">www.boost.org/LICENSE_1_0.txt</a>)
     </p>
 
     <br>
diff --git a/doc/intro.html b/doc/intro.html
index 4ed653b..9f41c72 100755
--- a/doc/intro.html
+++ b/doc/intro.html
@@ -135,7 +135,14 @@ Notice that we have to
 
     <hr>
     <p>
-    (C) Copyright Thorsten Ottosen 2003-2007
+      &copy; <a name="Copyright" id="Copyright">Copyright</a> Thorsten Ottosen 2008.
+    </p>
+
+    <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">www.boost.org/LICENSE_1_0.txt</a>)
     </p>
 
     <br>
diff --git a/doc/portability.html b/doc/portability.html
index 506d5b2..9e63978 100755
--- a/doc/portability.html
+++ b/doc/portability.html
@@ -73,11 +73,18 @@ href="http://boost.sourceforge.net/regression-logs/developer/range.html">here</a
     </ol>
     </p>
 
-    <hr>
+     <hr>
     <p>
-    (C) Copyright Thorsten Ottosen 2003-2004
+      &copy; <a name="Copyright" id="Copyright">Copyright</a> Thorsten Ottosen 2008.
     </p>
 
+    <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">www.boost.org/LICENSE_1_0.txt</a>)
+    </p>>
+
     <br>
     <br>
     <br>
diff --git a/doc/range.html b/doc/range.html
index dfe9345..b140888 100755
--- a/doc/range.html
+++ b/doc/range.html
@@ -352,34 +352,16 @@ href="../../iterator/doc/new-iter-concepts.html#random-access-traversal-iterator
     <p> <a href="../../concept_check/concept_check.htm">Boost Concept Check library</a></p>
 
     <hr>
+    <p>
+      &copy; <a name="Copyright" id="Copyright">Copyright</a> Thorsten Ottosen 2008.
+    </p>
 
-    <!--
-    <h3>Notes</h3>
-
-    
-    <P>
-    <A name="1">[1]</A>
-
-    The reference type does not have to be a real C++ reference. The requirements of 
-    the reference type is that it <i>behaves</i> like a real reference. Hence the 
-    reference type must be convertible to the value_type and assignment through
-
-    <br>
-    <br>
-    <HR>
-    <br>
--->
-
-    <TABLE>
-        <TR valign="top">
-            <TD nowrap>Copyright &copy 2000</TD>
-            <TD><A HREF=http://www.boost.org/people/jeremy_siek.htm>Jeremy Siek</A>
-        </TR>
-        <tr >
-            <TD nowrap>Copyright &copy 2004-2007</TD>
-            <TD>Thorsten Ottosen.
-    </TABLE>
-
+    <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">www.boost.org/LICENSE_1_0.txt</a>)
+    </p>
     <br>
     <br>
     <br>
diff --git a/doc/style.css b/doc/style.css
index 1890b52..ce44c30 100755
--- a/doc/style.css
+++ b/doc/style.css
@@ -1,3 +1,14 @@
+/*
+// Boost.Range library
+//
+//  Copyright Thorsten Ottosen 2003-2008. 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/
+//
+*/
 pre{
   BORDER-RIGHT: gray 1pt solid;
   PADDING-RIGHT: 2pt;
diff --git a/doc/style.html b/doc/style.html
index 9a5617e..cd82c94 100755
--- a/doc/style.html
+++ b/doc/style.html
@@ -104,9 +104,15 @@
 
     <hr>
     <p>
-    (C) Copyright Thorsten Ottosen 2003-2004
+      &copy; <a name="Copyright" id="Copyright">Copyright</a> Thorsten Ottosen 2008.
     </p>
 
+    <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">www.boost.org/LICENSE_1_0.txt</a>)
+    </p>
     <br>
     <br>
     <br>
diff --git a/doc/utility_class.html b/doc/utility_class.html
index c4afe54..ea51503 100644
--- a/doc/utility_class.html
+++ b/doc/utility_class.html
@@ -350,10 +350,17 @@ store the result
 </pre>
  </p>
 
-<hr>
-  <p>
-    (C) Copyright Thorsten Ottosen 2003-2007
-  </p>
+    <hr>
+    <p>
+      &copy; <a name="Copyright" id="Copyright">Copyright</a> Thorsten Ottosen 2008.
+    </p>
+
+    <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">www.boost.org/LICENSE_1_0.txt</a>)
+    </p>
 
   <br>
   <br>
diff --git a/test/TODO b/test/TODO
deleted file mode 100644
index 8b13789..0000000
--- a/test/TODO
+++ /dev/null
@@ -1 +0,0 @@
-
diff --git a/test/compat1.cpp b/test/compat1.cpp
deleted file mode 100755
index e69de29..0000000

From d1c2c5ce3fe69f52bfe6065fedfe759c6a821445 Mon Sep 17 00:00:00 2001
From: =?UTF-8?q?Thorsten=20J=C3=B8rgen=20Ottosen?=
 <thorsten.ottosen@gmail.com>
Date: Tue, 24 Jun 2008 15:37:59 +0000
Subject: [PATCH 20/73] bug-fixes from trunk

[SVN r46647]
---
 include/boost/range/as_literal.hpp            | 24 ++++------
 include/boost/range/begin.hpp                 |  8 ++--
 include/boost/range/detail/as_literal.hpp     |  4 +-
 .../range/detail/implementation_help.hpp      |  4 ++
 include/boost/range/end.hpp                   |  8 ++--
 include/boost/range/iterator_range.hpp        | 46 +++++++++++++------
 include/boost/range/sub_range.hpp             | 26 ++++++++---
 7 files changed, 74 insertions(+), 46 deletions(-)
 mode change 100755 => 100644 include/boost/range/as_literal.hpp
 mode change 100755 => 100644 include/boost/range/begin.hpp
 mode change 100755 => 100644 include/boost/range/detail/as_literal.hpp
 mode change 100755 => 100644 include/boost/range/detail/implementation_help.hpp
 mode change 100755 => 100644 include/boost/range/end.hpp
 mode change 100755 => 100644 include/boost/range/iterator_range.hpp
 mode change 100755 => 100644 include/boost/range/sub_range.hpp

diff --git a/include/boost/range/as_literal.hpp b/include/boost/range/as_literal.hpp
old mode 100755
new mode 100644
index b0d7593..38cc9cf
--- a/include/boost/range/as_literal.hpp
+++ b/include/boost/range/as_literal.hpp
@@ -8,8 +8,8 @@
 // For more information, see http://www.boost.org/libs/range/
 //
 
-#ifndef BOOST_RANGE_DETAIL_AS_LITERAL_HPP
-#define BOOST_RANGE_DETAIL_AS_LITERAL_HPP
+#ifndef BOOST_RANGE_AS_LITERAL_HPP
+#define BOOST_RANGE_AS_LITERAL_HPP
 
 #if defined(_MSC_VER) && (_MSC_VER >= 1200)
 # pragma once
@@ -25,7 +25,9 @@
 #include <boost/detail/workaround.hpp>
 
 #include <cstring>
+#ifndef BOOST_NO_CWCHAR 
 #include <cwchar>
+#endif
 
 namespace boost
 {
@@ -36,10 +38,12 @@ namespace boost
             return strlen( s );
         }
 
+#ifndef BOOST_NO_INTRINSIC_WCHAR_T 
         inline std::size_t length( const wchar_t* s )
         {
             return wcslen( s );
         }
+#endif        
 
         //
         // Remark: the compiler cannot choose between T* and T[sz]
@@ -57,7 +61,7 @@ namespace boost
             return true;
         }
 
-        
+#ifndef BOOST_NO_INTRINSIC_WCHAR_T 
         inline bool is_char_ptr( wchar_t* )
         {
             return true;
@@ -67,6 +71,7 @@ namespace boost
         {
             return true;
         }
+#endif
         
         template< class T >
         inline long is_char_ptr( T /* r */ )
@@ -107,22 +112,13 @@ namespace boost
     template< class Char, std::size_t sz >
     inline iterator_range<Char*> as_literal( Char (&arr)[sz] )
     {
-#if BOOST_WORKAROUND(__BORLANDC__, BOOST_TESTED_AT(0x590)) && __BORLANDC__ >= 0x590
-        return boost::make_iterator_range<Char*>( arr, arr + sz - 1 );
-#else
-        return boost::make_iterator_range( arr, arr + sz - 1 );
-#endif
+        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] )
     {
-#if BOOST_WORKAROUND(__BORLANDC__, BOOST_TESTED_AT(0x590)) && __BORLANDC__ >= 0x590
-        return boost::make_iterator_range<const Char*>( arr, arr + sz - 1 );
-#else
-        return boost::make_iterator_range( arr, arr + sz - 1 );
-#endif
+        return range_detail::make_range( arr, range_detail::is_char_ptr(arr) );
     }
 }
 
diff --git a/include/boost/range/begin.hpp b/include/boost/range/begin.hpp
old mode 100755
new mode 100644
index 9abf313..a4a5e10
--- a/include/boost/range/begin.hpp
+++ b/include/boost/range/begin.hpp
@@ -73,15 +73,15 @@ namespace range_detail
     // May this be discarded? Or is it needed for bad compilers?
     //
     template< typename T, std::size_t sz >
-    inline const T* range_begin( const T (&array)[sz] )
+    inline const T* range_begin( const T (&a)[sz] )
     {
-        return array;
+        return a;
     }
 
     template< typename T, std::size_t sz >
-    inline T* range_begin( T (&array)[sz] )
+    inline T* range_begin( T (&a)[sz] )
     {
-        return array;
+        return a;
     }
 
 
diff --git a/include/boost/range/detail/as_literal.hpp b/include/boost/range/detail/as_literal.hpp
old mode 100755
new mode 100644
index b4fd925..0bd9a15
--- a/include/boost/range/detail/as_literal.hpp
+++ b/include/boost/range/detail/as_literal.hpp
@@ -8,8 +8,8 @@
 // For more information, see http://www.boost.org/libs/range/
 //
 
-#ifndef BOOST_RANGE_AS_LITERAL_HPP
-#define BOOST_RANGE_AS_LITERAL_HPP
+#ifndef BOOST_RANGE_DETAIL_AS_LITERAL_HPP
+#define BOOST_RANGE_DETAIL_AS_LITERAL_HPP
 
 #if defined(_MSC_VER) && (_MSC_VER >= 1200)
 # pragma once
diff --git a/include/boost/range/detail/implementation_help.hpp b/include/boost/range/detail/implementation_help.hpp
old mode 100755
new mode 100644
index da086f0..ca12fa4
--- a/include/boost/range/detail/implementation_help.hpp
+++ b/include/boost/range/detail/implementation_help.hpp
@@ -25,6 +25,8 @@ namespace boost
 {
     namespace range_detail
     {
+        template <typename T>
+        inline void boost_range_silence_warning( const T& ) { }
         
         /////////////////////////////////////////////////////////////////////
         // end() help
@@ -82,12 +84,14 @@ namespace boost
         template< class T, std::size_t sz >
         inline std::size_t array_size( T BOOST_RANGE_ARRAY_REF()[sz] )
         {
+            boost_range_silence_warning( boost_range_array );
             return sz;
         }
 
         template< class T, std::size_t sz >
         inline std::size_t array_size( const T BOOST_RANGE_ARRAY_REF()[sz] )
         {
+            boost_range_silence_warning( boost_range_array );
             return sz;
         }
 
diff --git a/include/boost/range/end.hpp b/include/boost/range/end.hpp
old mode 100755
new mode 100644
index b777a55..3063c02
--- a/include/boost/range/end.hpp
+++ b/include/boost/range/end.hpp
@@ -71,15 +71,15 @@ namespace range_detail
         //////////////////////////////////////////////////////////////////////
 
         template< typename T, std::size_t sz >
-        inline const T* range_end( const T (&array)[sz] )
+        inline const T* range_end( const T (&a)[sz] )
         {
-            return range_detail::array_end<T,sz>( array );
+            return range_detail::array_end<T,sz>( a );
         }
 
         template< typename T, std::size_t sz >
-        inline T* range_end( T (&array)[sz] )
+        inline T* range_end( T (&a)[sz] )
         {
-            return range_detail::array_end<T,sz>( array );
+            return range_detail::array_end<T,sz>( a );
         }
 
 #if !BOOST_WORKAROUND(__BORLANDC__, BOOST_TESTED_AT(0x564)) && \
diff --git a/include/boost/range/iterator_range.hpp b/include/boost/range/iterator_range.hpp
old mode 100755
new mode 100644
index 31b8ea8..d118224
--- a/include/boost/range/iterator_range.hpp
+++ b/include/boost/range/iterator_range.hpp
@@ -11,8 +11,15 @@
 #ifndef BOOST_RANGE_ITERATOR_RANGE_HPP
 #define BOOST_RANGE_ITERATOR_RANGE_HPP
 
-// From boost/dynamic_bitset.hpp; thanks to Matthias Troyer for Cray X1 patch.
 #include <boost/config.hpp> // Define __STL_CONFIG_H, if appropriate.
+#include <boost/detail/workaround.hpp>
+
+#if BOOST_WORKAROUND(BOOST_MSVC, BOOST_TESTED_AT(1500))
+    #pragma warning( push )
+    #pragma warning( disable : 4996 )
+#endif
+
+// From boost/dynamic_bitset.hpp; thanks to Matthias Troyer for Cray X1 patch.
 #ifndef BOOST_OLD_IOSTREAMS 
 # if defined(__STL_CONFIG_H) && \
     !defined (__STL_USE_NEW_IOSTREAMS) && !defined(__crayx1) \
@@ -21,12 +28,13 @@
 # endif
 #endif // #ifndef BOOST_OLD_IOSTREAMS
 
-#include <boost/detail/workaround.hpp>
+#include <boost/assert.hpp>
+#include <boost/iterator/iterator_traits.hpp>    
+#include <boost/type_traits/is_abstract.hpp>
 #include <boost/range/functions.hpp>
 #include <boost/range/iterator.hpp>
 #include <boost/range/difference_type.hpp>
-#include <boost/iterator/iterator_traits.hpp>    
-#include <boost/assert.hpp>
+#include <boost/utility/enable_if.hpp>
 #include <iterator>
 #include <algorithm>
 #ifndef _STLP_NO_IOSTREAMS
@@ -38,10 +46,6 @@
 #endif // _STLP_NO_IOSTREAMS
 #include <cstddef>
 
-#if BOOST_WORKAROUND(BOOST_MSVC, == 1310) || BOOST_WORKAROUND(BOOST_MSVC, == 1400) 
-    #pragma warning( disable : 4996 )
-#endif
-
 /*! \file
     Defines the \c iterator_class and related functions. 
     \c iterator_range is a simple wrapper of iterator pair idiom. It provides
@@ -163,6 +167,12 @@ namespace boost
             //! iterator type
             typedef IteratorT iterator;
 
+        private: // for return value of operator()()
+            typedef BOOST_DEDUCED_TYPENAME 
+                boost::mpl::if_< boost::is_abstract<value_type>,
+                                 reference, value_type >::type abstract_value_type;
+
+        public:
             iterator_range() : m_Begin( iterator() ), m_End( iterator() )
                 #ifndef NDEBUG
             , singular( true )
@@ -175,7 +185,7 @@ namespace boost
                 m_Begin(Begin), m_End(End)
                 #ifndef NDEBUG
             , singular(false) 
-                 #endif
+                #endif
             {}
 
             //! Constructor from a Range
@@ -200,7 +210,7 @@ namespace boost
             template< class Range >
             iterator_range( const Range& r, iterator_range_detail::const_range_tag ) : 
                 m_Begin( impl::adl_begin( r ) ), m_End( impl::adl_end( r ) )
-                 #ifndef NDEBUG
+                #ifndef NDEBUG
             , singular(false) 
                 #endif
             {}
@@ -209,7 +219,7 @@ namespace boost
             template< class Range >
             iterator_range( Range& r, iterator_range_detail::range_tag ) : 
                 m_Begin( impl::adl_begin( r ) ), m_End( impl::adl_end( r ) )
-                 #ifndef NDEBUG
+                #ifndef NDEBUG
             , singular(false) 
                 #endif
             {}
@@ -350,8 +360,8 @@ namespace boost
            // When storing transform iterators, operator[]()
            // fails because it returns by reference. Therefore
            // operator()() is provided for these cases.
-           //
-           value_type operator()( difference_type at ) const
+           // 
+           abstract_value_type operator()( difference_type at ) const                              
            {
                BOOST_ASSERT( at >= 0 && at < size() );
                return m_Begin[at];               
@@ -380,13 +390,15 @@ namespace boost
             bool      singular;
             #endif
 
-            #ifndef NDEBUG
         public:
             bool is_singular() const
             {
+                 #ifndef NDEBUG
                  return singular;
+                 #else
+                 return false;
+                 #endif
             }
-            #endif
 
         protected:
             //
@@ -639,5 +651,9 @@ namespace boost
 
 #undef BOOST_OLD_IOSTREAMS
 
+#if BOOST_WORKAROUND(BOOST_MSVC, BOOST_TESTED_AT(1500)) 
+    #pragma warning( pop )
+#endif
+
 #endif
 
diff --git a/include/boost/range/sub_range.hpp b/include/boost/range/sub_range.hpp
old mode 100755
new mode 100644
index 35dfb27..dc66692
--- a/include/boost/range/sub_range.hpp
+++ b/include/boost/range/sub_range.hpp
@@ -11,18 +11,20 @@
 #ifndef BOOST_RANGE_SUB_RANGE_HPP
 #define BOOST_RANGE_SUB_RANGE_HPP
 
-#include <boost/detail/workaround.hpp>
-
-#if BOOST_WORKAROUND(BOOST_MSVC, == 1310) || BOOST_WORKAROUND(BOOST_MSVC, == 1400) 
+#if BOOST_WORKAROUND(BOOST_MSVC, BOOST_TESTED_AT(1500)) 
+    #pragma warning( push )
     #pragma warning( disable : 4996 )
 #endif
 
+#include <boost/detail/workaround.hpp>
 #include <boost/range/config.hpp>
 #include <boost/range/iterator_range.hpp>
 #include <boost/range/value_type.hpp>
 #include <boost/range/size_type.hpp>
 #include <boost/range/difference_type.hpp>
 #include <boost/assert.hpp>
+#include <boost/type_traits/is_reference.hpp>
+#include <boost/type_traits/remove_reference.hpp>
 
 namespace boost
 {
@@ -41,12 +43,18 @@ namespace boost
         typedef BOOST_DEDUCED_TYPENAME range_difference<ForwardRange>::type       difference_type;
         typedef BOOST_DEDUCED_TYPENAME range_size<ForwardRange>::type             size_type;
         typedef BOOST_DEDUCED_TYPENAME base::reference                            reference;
+        
+    public: // for return value of front/back
+        typedef BOOST_DEDUCED_TYPENAME 
+                boost::mpl::if_< boost::is_reference<reference>,
+                                 const BOOST_DEDUCED_TYPENAME boost::remove_reference<reference>::type&, 
+                                 reference >::type const_reference;
 
     public:
         sub_range() : base() 
         { }
         
-#if BOOST_WORKAROUND(BOOST_MSVC, == 1310) || BOOST_WORKAROUND(BOOST_MSVC, == 1400) 
+#if BOOST_WORKAROUND(BOOST_MSVC, BOOST_TESTED_AT(1500) ) 
         sub_range( const sub_range& r ) 
             : base( static_cast<const base&>( r ) )  
         { }  
@@ -112,7 +120,7 @@ namespace boost
             return base::front();
         }
 
-        const value_type& front() const
+        const_reference front() const
         {
             return base::front();
         }
@@ -122,7 +130,7 @@ namespace boost
             return base::back();
         }
 
-        const value_type& back() const
+        const_reference back() const
         {
             return base::back();
         }
@@ -132,7 +140,7 @@ namespace boost
             return base::operator[](sz);
         }
 
-        const value_type& operator[]( difference_type sz ) const
+        const_reference operator[]( difference_type sz ) const
         {
             return base::operator[](sz);
         }
@@ -163,5 +171,9 @@ namespace boost
 
 } // namespace 'boost'
 
+#if BOOST_WORKAROUND(BOOST_MSVC, BOOST_TESTED_AT(1500)) 
+    #pragma warning( pop )
+#endif
+
 #endif
 

From b4f99d66b590ad1d8bb66211450fd62ed202b873 Mon Sep 17 00:00:00 2001
From: =?UTF-8?q?Thorsten=20J=C3=B8rgen=20Ottosen?=
 <thorsten.ottosen@gmail.com>
Date: Tue, 24 Jun 2008 15:38:50 +0000
Subject: [PATCH 21/73] bug-fixes from trunk

[SVN r46649]
---
 doc/history_ack.html        |  4 ++--
 doc/intro.html              |  2 +-
 doc/style.html              |  2 +-
 doc/utility_class.html      |  6 +++---
 index.html                  |  2 +-
 test/Jamfile.v2             |  4 ++--
 test/partial_workaround.cpp |  8 +++++++-
 test/string.cpp             | 34 ++++++++++++++++------------------
 8 files changed, 33 insertions(+), 29 deletions(-)
 mode change 100755 => 100644 doc/history_ack.html
 mode change 100755 => 100644 doc/intro.html
 mode change 100755 => 100644 doc/style.html
 mode change 100755 => 100644 index.html
 mode change 100755 => 100644 test/partial_workaround.cpp
 mode change 100755 => 100644 test/string.cpp

diff --git a/doc/history_ack.html b/doc/history_ack.html
old mode 100755
new mode 100644
index c8527ba..3191dd0
--- a/doc/history_ack.html
+++ b/doc/history_ack.html
@@ -19,9 +19,9 @@
     <h2  >History and Acknowledgement</h2><a name="History" ></a>
     <p  >
     The library was under way for a long time. Dietmar Kühl originally intended
-    to submit an <code>array_traits</code> class template which had most of
+    to submit an <code  >array_traits</code> class template which had most of
     the functionality present now, but only for arrays and standard containers.
-    I believe this was back in 2001 or 2002.
+        I believe this was back in 2001 or 2002.
     </p>
     
     <p>
diff --git a/doc/intro.html b/doc/intro.html
old mode 100755
new mode 100644
index 9f41c72..82f10dc
--- a/doc/intro.html
+++ b/doc/intro.html
@@ -24,7 +24,7 @@
     to a somewhat clumsy use of the algorithms with redundant specification
     of container names. Therefore we would like to raise the abstraction level
     for algorithms so they specify their interface in terms of <a
-    href=range.html>Ranges</a> as much as possible.
+    href="range.html">Ranges</a> as much as possible.
     </p>
 
     <p>
diff --git a/doc/style.html b/doc/style.html
old mode 100755
new mode 100644
index cd82c94..4240a8c
--- a/doc/style.html
+++ b/doc/style.html
@@ -53,7 +53,7 @@
                     <a href="range.html#bidirectional_range">Bidirectional Range</a> <li>
                     <a href="range.html#random_access_range">Random Access Range</a> </ul>
     </ul>
-    Notice how we have used the categories from the <a href=../../iterator/doc/new-iter-concepts.html>new 
+    Notice how we have used the categories from the <a href="../../iterator/doc/new-iter-concepts.html">new 
     style iterators</a>.
 
     <p>
diff --git a/doc/utility_class.html b/doc/utility_class.html
index ea51503..e100859 100644
--- a/doc/utility_class.html
+++ b/doc/utility_class.html
@@ -27,9 +27,9 @@
 
     <ul>
         <li>
-            Class <a href=#iter_range><code>iterator_range</code></a>
+            Class <a href="#iter_range"><code>iterator_range</code></a>
         <li>
-            Class <a href=#sub_range><code>sub_range</code></a>
+            Class <a href="#sub_range"><code>sub_range</code></a>
     </ul>
     </ul>
 
@@ -329,7 +329,7 @@ class can propagate constness since it knows what a corresponding
         <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>difference_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 <a href=#iter_range><code>iterator_range</code></a>
+        </span><span class=comment>// rest of interface inherited from <a href="#iter_range"><code>iterator_range</code></a>
     </span><span class=special>};
     </span>
 <span class=special>} </span><span class=comment>// namespace 'boost'</span>
diff --git a/index.html b/index.html
old mode 100755
new mode 100644
index 5313690..56ba4eb
--- a/index.html
+++ b/index.html
@@ -22,7 +22,7 @@
   </p>
   <p>
   Use, modification and distribution is subject to the Boost Software License, Version 1.0
-  (see <a href=http://www.boost.org/LICENSE_1_0.txt>
+  (see <a href="http://www.boost.org/LICENSE_1_0.txt">
    http://www.boost.org/LICENSE_1_0.txt</a>).
   </p>
 
diff --git a/test/Jamfile.v2 b/test/Jamfile.v2
index b6942ca..c82a6c9 100644
--- a/test/Jamfile.v2
+++ b/test/Jamfile.v2
@@ -12,9 +12,9 @@ rule range-test ( name : includes * )
 {
     return [
         run $(name).cpp /boost/test//boost_unit_test_framework/<link>static
+        :
         : 
-        : 
-        : $(includes)
+        : <toolset>gcc:<cxxflags>"-Wall -Wunused "
         ] ;
 }
 
diff --git a/test/partial_workaround.cpp b/test/partial_workaround.cpp
old mode 100755
new mode 100644
index 8ac6f66..76d902f
--- a/test/partial_workaround.cpp
+++ b/test/partial_workaround.cpp
@@ -10,6 +10,8 @@
 
 #include <boost/config.hpp>
 #include <boost/detail/workaround.hpp>
+#include <boost/range/detail/implementation_help.hpp>
+#include <boost/test/test_tools.hpp>
 
 #if BOOST_WORKAROUND(__BORLANDC__, BOOST_TESTED_AT(0x564))
 #  pragma warn -8091 // supress warning in Boost.Test
@@ -30,7 +32,6 @@
 
 #include <boost/static_assert.hpp>
 #include <boost/type_traits.hpp>
-#include <boost/test/test_tools.hpp>
 #include <iostream>
 #include <vector>
 
@@ -91,6 +92,11 @@ void check_partial_workaround()
 
 void check_partial_workaround()
 {
+    //
+    // test if warnings are generated
+    //
+    std::size_t s = boost::range_detail::array_size( "foo" );
+    BOOST_CHECK_EQUAL( s,  4u );
 }
 
 #endif
diff --git a/test/string.cpp b/test/string.cpp
old mode 100755
new mode 100644
index 9a2e5a8..127f70a
--- a/test/string.cpp
+++ b/test/string.cpp
@@ -137,14 +137,7 @@ void check_char()
     BOOST_CHECK_EQUAL( str_end( char_s ), str_end1 );
     BOOST_CHECK_EQUAL( str_empty( char_s ), (char_s == 0 || char_s[0] == char()) );
     BOOST_CHECK_EQUAL( sz, std::char_traits<char>::length( char_s ) );
-/*    
-    BOOST_CHECK_EQUAL( str_begin( char_s2 ), char_s2 );
-    std::size_t sz2 = size( char_s2 );
-    const char* str_end12 = str_begin( char_s2 ) + sz;
-    BOOST_CHECK_EQUAL( str_end( char_s2 ), str_end12 );
-    BOOST_CHECK_EQUAL( empty( char_s2 ), (char_s2 == 0 || char_s2[0] == char()) );
-    BOOST_CHECK_EQUAL( sz2, std::char_traits<char>::length( char_s2 ) );
-*/
+
     BOOST_CHECK_EQUAL( str_begin( my_string ), my_string );
     range_iterator<char_array_t>::type str_end2 = str_begin( my_string ) + str_size(my_string);
     range_iterator<char_array_t>::type str_end3 = str_end(my_string);
@@ -165,6 +158,20 @@ void check_char()
 
     BOOST_CHECK( find_const( as_array( my_string ), to_search ) != str_end(my_string) );
     BOOST_CHECK( find_const( as_array( my_const_string ), to_search ) != str_end(my_string) );
+
+    //
+    // Test that as_literal() always scan for null terminator
+    //
+    char an_array[] = "foo\0bar";
+    BOOST_CHECK_EQUAL( str_begin( an_array ), an_array );
+    BOOST_CHECK_EQUAL( str_end( an_array ), an_array + 3 );
+    BOOST_CHECK_EQUAL( str_size( an_array ), 3 );
+
+    const char a_const_array[] = "foobar\0doh";
+    BOOST_CHECK_EQUAL( str_begin( a_const_array ), a_const_array );
+    BOOST_CHECK_EQUAL( str_end( a_const_array ), a_const_array + 6 );
+    BOOST_CHECK_EQUAL( str_size( a_const_array ), 6 );
+
 }
 
 
@@ -172,9 +179,6 @@ void check_char()
 void check_string()
 {
     check_char();
-//    check_char<volatile char>();
-//    check_char<const char>();
-//    check_char<const volatile char>();
     
 #ifndef BOOST_NO_STD_WSTRING
     typedef wchar_t*               wchar_iterator_t;          
@@ -197,13 +201,7 @@ void check_string()
     BOOST_CHECK_EQUAL( str_end(char_ws), (str_begin( char_ws ) + sz) );
     BOOST_CHECK_EQUAL( str_empty( char_ws ), (char_ws == 0 || char_ws[0] == wchar_t()) );
     BOOST_CHECK_EQUAL( sz, std::char_traits<wchar_t>::length( char_ws ) );
- /*       
-    std::size_t sz2 = size( char_ws2 );
-    BOOST_CHECK_EQUAL( str_begin( char_ws2 ), char_ws2 );
-    BOOST_CHECK_EQUAL( str_end( char_ws2 ), (begin( char_ws2 ) + sz2) );
-    BOOST_CHECK_EQUAL( empty( char_ws2 ), (char_ws2 == 0 || char_ws2[0] == wchar_t()) );
-    BOOST_CHECK_EQUAL( sz2, std::char_traits<wchar_t>::length( char_ws2 ) );
-   */ 
+
     wchar_t to_search = L'n';
     BOOST_CHECK( find( char_ws, to_search ) != str_end(char_ws) );    
 

From e7902d439b1e86d1df5038001e0142b59ebb7e52 Mon Sep 17 00:00:00 2001
From: =?UTF-8?q?Thorsten=20J=C3=B8rgen=20Ottosen?=
 <thorsten.ottosen@gmail.com>
Date: Tue, 24 Jun 2008 15:42:48 +0000
Subject: [PATCH 22/73] more changes from trunk

[SVN r46652]
---
 doc/boost_range.html   | 110 ++++++++++++++++++++---------------------
 doc/examples.html      |   8 +--
 doc/faq.html           |   4 +-
 doc/headers.html       |   2 +-
 doc/intro.html         |   2 +-
 doc/portability.html   |   5 +-
 doc/range.html         |  14 +++---
 doc/utility_class.html |  27 +++++-----
 index.html             |   2 +-
 9 files changed, 87 insertions(+), 87 deletions(-)
 mode change 100755 => 100644 doc/examples.html
 mode change 100755 => 100644 doc/faq.html
 mode change 100755 => 100644 doc/headers.html
 mode change 100755 => 100644 doc/portability.html
 mode change 100755 => 100644 doc/range.html

diff --git a/doc/boost_range.html b/doc/boost_range.html
index 465bd18..b9fd0ca 100644
--- a/doc/boost_range.html
+++ b/doc/boost_range.html
@@ -152,7 +152,7 @@ class=identifier>range_reverse_iterator</span></a><span class=special>;
     </span><a href="#rend"><span class=identifier>rend</span></a><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><span class=comment>//
+    <span class=comment>//
     // Random Access Range functions
     //
     
@@ -235,7 +235,7 @@ class=identifier>T</span><span class=special>&amp; </span><span class=identifier
                     <td><code>A[sz]</code>
                     <td><code>a</code>
                     <td>denotes an array of type <code>A</code> of size <code>sz</code>
-                <tr>
+                </tr>
                 <tr>
                     <td><code>Char*</code>
                     <td><code>s</code>
@@ -259,9 +259,9 @@ class=identifier>T</span><span class=special>&amp; </span><span class=identifier
                     <th>
                         Complexity</th>
                 </tr>
-                <tr>
-                    <a name="range_iterator"></a>
-                    <td><code>range_iterator&lt;X&gt;::type</code></td>
+                
+                <tr >
+                    <td><a name="range_iterator"></a><code>range_iterator&lt;X&gt;::type</code></td>
                     <td><code>T::iterator</code><br>
                         <code>P::first_type</code><br>
                         <code>A*</code><br>
@@ -269,8 +269,8 @@ class=identifier>T</span><span class=special>&amp; </span><span class=identifier
                     <td>compile time</td>
                 </tr>
                 <tr>
-                    <a name="range_const_iterator"></a>
-                    <td><code>range_iterator&lt;const X&gt;::type</code></td>
+                    
+                    <td><a name="range_const_iterator"></a><code>range_iterator&lt;const X&gt;::type</code></td>
                     <td><code>T::const_iterator</code><br>
                         <code>P::first_type</code><br>
                         <code>const A*</code><br>
@@ -278,54 +278,53 @@ class=identifier>T</span><span class=special>&amp; </span><span class=identifier
                     <td>compile time</td>
                 </tr>
                 <tr>
-                    <a name="range_value"></a>
-                    <td><code>range_value&lt;X&gt;::type</code></td>
+                    
+                    <td><a name="range_value"></a><code>range_value&lt;X&gt;::type</code></td>
                     <td><code>boost::iterator_value&lt;range_iterator&lt;X&gt;::type&gt;::type</code>
                      </td>  
                     <td>compile time</td>
                 </tr>
                 <tr>
-                    <a name="range_reference"></a>
-                    <td><code>range_reference&lt;X&gt;::type</code></td>
+                    
+                    <td><a name="range_reference"></a><code>range_reference&lt;X&gt;::type</code></td>
                     <td><code>boost::iterator_reference&lt;range_iterator&lt;X&gt;::type&gt;::type</code>
                      </td>  
                     <td>compile time</td>
                 </tr>
 
                                 <tr>
-                    <a name="range_pointer"></a>
-                    <td><code>range_pointer&lt;X&gt;::type</code></td>
+                    
+                    <td><a name="range_pointer"></a><code>range_pointer&lt;X&gt;::type</code></td>
                     <td><code>boost::iterator_pointer&lt;range_iterator&lt;X&gt;::type&gt;::type</code>
                      </td>  
                     <td>compile time</td>
                 </tr>
                 
                                 <tr>
-                    <a name="range_category"></a>
-                    <td><code>range_category&lt;X&gt;::type</code></td>
+                    
+                    <td><a name="range_category"></a><code>range_category&lt;X&gt;::type</code></td>
                     <td><code>boost::iterator_category&lt;range_iterator&lt;X&gt;::type&gt;::type</code>
                      </td>  
                     <td>compile time</td>
                 </tr>
                 <tr>
-                    <a name="range_difference"></a>
-                    <td><code>range_difference&lt;X&gt;::type</code></td>
+                    
+                    <td><a name="range_difference"></a><code>range_difference&lt;X&gt;::type</code></td>
                     <td>
                         <code>boost::iterator_difference&lt;range_iterator&lt;X&gt;::type&gt;::type</code></td>
                         
                     <td>compile time</td>
                 </tr>
-                </tr>
 
                 <tr>
-                    <a name="range_reverse_iterator"></a>
-                    <td><code>range_reverse_iterator&lt;X&gt;::type</code></td>
+                    
+                    <td><a name="range_reverse_iterator"></a><code>range_reverse_iterator&lt;X&gt;::type</code></td>
                     <td><code>boost::reverse_iterator&lt;range_iterator&lt;X&gt;::type&gt;</code><br>
                     <td>compile time</td>
                 </tr>
                 <tr>
-                    <a name="range_const_reverse_iterator"></a>
-                    <td><code>range_reverse_iterator&lt;const X&gt;::type</code></td>
+                    
+                    <td><a name="range_const_reverse_iterator"></a><code>range_reverse_iterator&lt;const X&gt;::type</code></td>
                     <td><code>boost::reverse_iterator&lt;range_iterator&lt;const X&gt;::type&gt;</code>
                         <br>
                     <td>compile time</td>
@@ -346,11 +345,11 @@ class=identifier>T</span><span class=special>&amp; </span><span class=identifier
                         Complexity</th>
                 </tr>
                 <tr>
-                    <a name="begin"></a>
-                    <td><code>begin(x)</code></td>
+                    
+                    <td><a name="begin"></a><code>begin(x)</code></td>
                     <td><code>range_iterator&lt;X&gt;::type</code></td>
                     <td>
-                        <code>p.first</code> if <code>p</code> is of type <code>std::pair&ltT&gt;<code><br>
+                        <code>p.first</code> if <code>p</code> is of type <code>std::pair&lt;T&gt;<code><br>
                         <code>a</code> if <code>a</code> is an array <br>
                         <code>range_begin(x)</code> if that expression would invoke a function found by ADL <br>
                         <code>t.begin()</code> otherwise
@@ -358,11 +357,11 @@ class=identifier>T</span><span class=special>&amp; </span><span class=identifier
                     <td>constant time</td>
                 </tr>
                 <tr>
-                    <a name="end"></a>
-                    <td><code>end(x)</code></td>
+                    
+                    <td><a name="end"></a><code>end(x)</code></td>
                     <td><code>range_iterator&lt;X&gt;::type</code></td>
                     <td>
-                        <code>p.second</code> if <code>p</code> is of type <code>std::pair&ltT&gt;<code><br>
+                        <code>p.second</code> if <code>p</code> is of type <code>std::pair&lt;T&gt;<code><br>
                         <code>a + sz</code> if <code>a</code> is an array of size <code>sz</code>
                         
                         <br>
@@ -373,16 +372,16 @@ class=identifier>T</span><span class=special>&amp; </span><span class=identifier
                         constant time </td>
                 </tr>
                 <tr>
-                    <a name="empty"></a>
-                    <td><code>empty(x)</code></td>
+                    
+                    <td><a name="empty"></a><code>empty(x)</code></td>
                     <td><code>bool</code></td>
                     <td><code>boost::begin(x) == boost::end(x)</code><br>
                     <td> constant time <br>
                     </td>
                 </tr>
                 <tr>
-                    <a name="distance"></a>
-                    <td><code>distance(x)</code></td>
+                    
+                    <td><a name="distance"></a><code>distance(x)</code></td>
                     <td><code>range_difference&lt;X&gt;::type</code></td>
                     <td>
                         <code>
@@ -394,16 +393,16 @@ class=identifier>T</span><span class=special>&amp; </span><span class=identifier
                 </tr>
 
                 <tr>
-                    <a name="size"></a>
-                    <td><code>size(x)</code></td>
+                    
+                    <td><a name="size"></a><code>size(x)</code></td>
                     <td><code>range_difference&lt;X&gt;::type</code></td>
                     <td><code> boost::end(x) - boost::begin(x)</code>
                         
                     <td>          constant time </td>
                 </tr>
                 <tr>
-                    <a name="rbegin"></a>
-                    <td><code>rbegin(x)</code></td>
+                    
+                    <td><a name="rbegin"></a><code>rbegin(x)</code></td>
                     <td><code>range_reverse_iterator&lt;X&gt;::type</code></td>
                     <td><code>range_reverse_iterator&lt;X&gt;::type( boost::end(x) )</code>
                         <br>
@@ -411,15 +410,15 @@ class=identifier>T</span><span class=special>&amp; </span><span class=identifier
                     </td>
                 </tr>
                 <tr>
-                    <a name="rend"></a>
-                    <td><code>rend(x)</code></td>
+                   
+                    <td> <a name="rend"></a><code>rend(x)</code></td>
                     <td><code>range_reverse_iterator&lt;X&gt;::type</code></td>
                     <td><code>range_reverse_iterator&lt;X&gt;::type( boost::begin(x) )</code>
                     <td>constant time</td>
                 </tr>
                 <tr>
-                    <a name="const_begin"></a>
-                    <td><code>const_begin(x)</code></td>
+                    
+                    <td><a name="const_begin"></a><code>const_begin(x)</code></td>
                     <td><code>range_iterator&lt;const X&gt;::type</code></td>
                     <td><code>range_iterator&lt;const X&gt;::type( boost::begin(x) )</code>
                         <br>
@@ -427,15 +426,15 @@ class=identifier>T</span><span class=special>&amp; </span><span class=identifier
                     </td>
                 </tr>
                 <tr>
-                    <a name="const_end"></a>
-                    <td><code>const_end(x)</code></td>
+                    
+                    <td><a name="const_end"></a><code>const_end(x)</code></td>
                     <td><code>range_iterator&lt;const X&gt;::type</code></td>
                     <td><code>range_iterator&lt;const X&gt;::type( boost::end(x) )</code>
                     <td>constant time</td>
                 </tr>
                 <tr>
-                    <a name="const_rbegin"></a>
-                    <td><code>const_rbegin(x)</code></td>
+                    
+                    <td><a name="const_rbegin"></a><code>const_rbegin(x)</code></td>
                     <td><code>range_reverse_iterator&lt;const X&gt;::type</code></td>
                     <td><code>range_reverse_iterator&lt;const X&gt;::type( boost::rbegin(x) )</code>
                         <br>
@@ -443,16 +442,16 @@ class=identifier>T</span><span class=special>&amp; </span><span class=identifier
                     </td>
                 </tr>
                 <tr>
-                    <a name="const_rend"></a>
-                    <td><code>const_rend(x)</code></td>
+                    
+                    <td><a name="const_rend"></a><code>const_rend(x)</code></td>
                     <td><code>range_reverse_iterator&lt;const X&gt;::type</code></td>
                     <td><code>range_reverse_iterator&lt;const X&gt;::type( boost::rend(x) )</code>                    
         
                     <td>constant time</td>
                 </tr>
                  <tr>
-                    <a name="as_literal"></a>
-                    <td><code>as_literal(x)</code></td>
+                    
+                    <td><a name="as_literal"></a><code>as_literal(x)</code></td>
                      <td><code>iterator_range&lt;U></code> where <code>U</code> is 
                         <code>Char*</code> if <code>x</code> is a pointer to a 
                         string and <code>U</code> is
@@ -460,20 +459,21 @@ class=identifier>T</span><span class=special>&amp; </span><span class=identifier
                         </td>
                      <td>
                          
-                        <code>[a,a+sz-1)</code> if <code>a</code> is an array of size <code>sz</code><br>
-                            <code>[s,s + std::char_traits&lt;X&gt;::length(s))</code> if <code>s</code> is a <code>Char*</code>
+                       <!-- <code>[a,a+sz-1)</code> if <code>a</code> is an array 
+                       of size <code>sz</code><br>-->
+                            <code>[s,s + std::char_traits&lt;X&gt;::length(s))</code> if <code>s</code> is a <code>Char*</code> or an array of <code>Char</code>
                                 <br>
                                     <code>[boost::begin(x),boost::end(x))</code> otherwise
 
 
                          
                          </td>   
-                    <td>linear time for pointers to a string, constant time 
-                        otherwise</td>
+                    <td>linear time for pointers to a string or arrays of 
+                        <code>Char</code>, constant time otherwise</td>
                 </tr>
                  <tr>
-                    <a name="as_array"></a>
-                    <td><code>as_array(x)</code></td>
+                    
+                    <td><a name="as_array"></a><code>as_array(x)</code></td>
                      <td><code>iterator_range&lt;X></code>                       </td>
                      <td>
                                   <code>[boost::begin(x),boost::end(x))</code> 
@@ -561,7 +561,7 @@ class=identifier>T</span><span class=special>&amp; </span><span class=identifier
                         Member type</th>
                     <th>
                         Related concept</th>
-                <tr>
+                </tr>
                 <tr>
                     <td><code>iterator</code></td>
                     <td><a href="range.html#single_pass_range">Single Pass Range</a></td>
diff --git a/doc/examples.html b/doc/examples.html
old mode 100755
new mode 100644
index 0d24509..d1f9887
--- a/doc/examples.html
+++ b/doc/examples.html
@@ -23,16 +23,16 @@
     <ul  >
         <li  >
             <a href="../test/string.cpp" target="_self" ><code  >string.cpp</code></a>
-        </li>
+      
         shows how to implement a container version of <code  >std::find()</code> that
         works with <code  >char[],wchar_t[],char*,wchar_t*.</code>
-
+  </li>
         <li  >
             <a href="../test/algorithm_example.cpp" target="_self" ><code  >algorithm_example.cpp</code></a>
 
-        </li>
+      
         shows the replace example from the introduction.
-        
+          </li>
         <li> <a href="../test/iterator_range.cpp">iterator_range.cpp</a>
         <li> <a href="../test/sub_range.cpp">sub_range.cpp</a>
         <li> <a href="../test/iterator_pair.cpp">iterator_pair.cpp</a>     
diff --git a/doc/faq.html b/doc/faq.html
old mode 100755
new mode 100644
index 244df80..fcacf98
--- a/doc/faq.html
+++ b/doc/faq.html
@@ -22,7 +22,7 @@
         <li  >
             <i>Why is there no difference between <code  >range_iterator&lt;C&gt;::type</code>
             and <code  >range_const_iterator&lt;C&gt;::type</code> for <code>std::pair&lt;iterator, iterator&gt;</code></i>.
-        </li>
+
         <p  >
         In general it is not possible nor desirable to find a corresponding <code  >const_iterator</code>.
         When it is possible to come up with one, the client might choose to construct a <code  >std::pair&lt;const_iterator,const_iterator&gt;</code>
@@ -33,7 +33,7 @@
         is somewhat more convenient than a <code>pair</code> and that a <a
         href="utility_class.html#sub_range"><code>sub_range</code></a> does
        propagate const-ness. </p>
-
+        </li>
         <li  >
             <i>Why is there not supplied more types or more functions?</i>
             <p  >
diff --git a/doc/headers.html b/doc/headers.html
old mode 100755
new mode 100644
index 7628591..c896bff
--- a/doc/headers.html
+++ b/doc/headers.html
@@ -167,7 +167,7 @@
         </tr>
 
     </table>
-    <br
+    <br>
       </p>
 
 
diff --git a/doc/intro.html b/doc/intro.html
index 82f10dc..89d3504 100644
--- a/doc/intro.html
+++ b/doc/intro.html
@@ -108,7 +108,7 @@ class=identifier>ForwardReadableRange </span><span class=special>&gt;::</span><s
     </span>
     <span class=identifier>my_vector</span><span class=special>.</span><span
 class=identifier>assign</span><span class=special>( </span><span class=identifier>values</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>values </span><span class=special>) </span><span class=special>);</span>
-    </span><span class=keyword>typedef </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>iterator</span><span class=special>;
+    <span class=keyword>typedef </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>iterator</span><span class=special>;
     </span><span class=identifier>std</span><span class=special>::</span><span class=identifier>pair</span><span class=special>&lt;</span><span class=identifier>iterator</span><span class=special>,</span><span class=identifier>iterator</span><span class=special>&gt;       </span><span class=identifier>my_view</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>my_vector </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>my_vector </span><span class=special>) </span><span class=special>+ </span><span class=identifier>N </span><span class=special>);
     </span><span class=keyword>char  </span><span class=identifier>str_val</span><span class=special>[] </span><span class=special>= </span><span class=string>&quot;a string&quot;</span><span class=special>;
diff --git a/doc/portability.html b/doc/portability.html
old mode 100755
new mode 100644
index 9e63978..bb73e78
--- a/doc/portability.html
+++ b/doc/portability.html
@@ -29,9 +29,8 @@ href="http://boost.sourceforge.net/regression-logs/developer/range.html">here</a
     template partial specialization. For non-conforming compilers there might be a 
     chance that it works anyway thanks to workarounds in the type traits library.
     </p>
-    <pp>
-    Visual C++ 6/7.0 has a limited support for arrays: as long as the arrays are 
-    of built-in type it should work.
+    <p> Visual C++ 6/7.0 has a limited support for arrays: as long as the arrays
+    are of built-in type it should work.
     </p>
     <p  >
     Notice also that some compilers cannot do function template ordering properly. 
diff --git a/doc/range.html b/doc/range.html
old mode 100755
new mode 100644
index b140888..8646141
--- a/doc/range.html
+++ b/doc/range.html
@@ -1,3 +1,4 @@
+<!DOCTYPE HTML PUBLIC "-//W3C//DTD HTML 3.2//EN">
 <HTML>
 <!--
   -- Copyright (c) Jeremy Siek 2000
@@ -90,7 +91,7 @@ functions as free-standing functions to allow for a layer of indirection. </p>
 <code>boost</code></p>-->
 
     <hr>
-    <a name="single_pass_range">
+    <a name="single_pass_range"></a>
     <H2>Single Pass Range</H2>
 
     <h3>Notation</h3>
@@ -227,7 +228,7 @@ otherwise</TD>
        
 
     <hr>
-    <a  name=forward_range><h2>Forward Range</h2>
+    <a name=forward_range></a><h2>Forward Range</h2>
 
     <h3>Notation</h3>
     <Table>
@@ -255,7 +256,7 @@ Range</a>
   
     <hr>
 
-    <a name="bidirectional_range"><h2>Bidirectional Range</h2>
+    <a name="bidirectional_range"></a><h2>Bidirectional Range</h2>
 
     <h3>Notation</h3>
     <Table>
@@ -283,7 +284,8 @@ s-lib-bidirectional-traversal-iterators">Bidirectional Traversal Iterator.</a>
 
     <hr>
 
-    <a name=random_access_range><h2>Random Access Range</h2> <h3>Description</h3>
+    <a name=random_access_range></a><h2>Random Access Range</h2> 
+    <h3>Description</h3>
     <p>
     A range <code>X</code> where <code>boost::range_iterator&lt;X>::type</code> is a model
 of <a
@@ -299,10 +301,10 @@ href="../../iterator/doc/new-iter-concepts.html#random-access-traversal-iterator
 
     <hr>
 
-    <a name=concept_checking><h2>Concept Checking</h2>
+    <a name=concept_checking></a><h2>Concept Checking</h2>
 
     Each of the range concepts has a corresponding concept checking
-    class in the file <code><boost/range/concepts.hpp></codE>. These classes may be
+    class in the file <code>&lt;boost/range/concepts.hpp&gt;</code>. These classes may be
     used in conjunction with the <a
     href="../../concept_check/concept_check.htm">Boost Concept
     Check</a> library to insure that the type of a template parameter
diff --git a/doc/utility_class.html b/doc/utility_class.html
index e100859..956bf99 100644
--- a/doc/utility_class.html
+++ b/doc/utility_class.html
@@ -31,7 +31,6 @@
         <li>
             Class <a href="#sub_range"><code>sub_range</code></a>
     </ul>
-    </ul>
 
     The <code>iterator_range</code> class is templated on a <a
     href="../../iterator/doc/new-iter-concepts.html#forward-traversal-iterators-lib-forward-traversal-iterators">Forward 
@@ -84,7 +83,7 @@ corresponding <code>const_iterator</code> is. </p>
         </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><span class=keyword>public</span><span class=special>: </span><span class=comment>// construction, assignment
+    <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>);
                     
@@ -110,7 +109,7 @@ corresponding <code>const_iterator</code> is. </p>
         </span><span class=keyword>operator        </span><a href="#unspecified_bool"><span class=identifier>unspecified_bool_type</span></a><span class=special>() </span><span class=keyword>const</span><span class=special>;
     </span>    <span class=keyword>bool</span>            <span 
 class=identifier><a href="#equal">equal</a></span><span
-class=special>( </span><span class=keyword>const</span> <span class=identifier>iterator_range</span><span class=special>& ) </span><span 
+class=special>( </span><span class=keyword>const</span> <span class=identifier>iterator_range</span><span class=special>&amp; ) </span><span 
 class=keyword>const;</span>
         <span class=identifier>reference       </span><span class=identifier>front</span><span class=special>() </span><span class=keyword>const</span><span class=special>;</span>
         <span class=identifier>reference       </span><span class=identifier>back</span><span class=special>() </span><span class=keyword>const</span><span class=special>;</span>
@@ -119,7 +118,7 @@ class=keyword>const;</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><span class=special>};
+    <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;
@@ -164,7 +163,7 @@ class=keyword>const;</span>
     </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><span class=comment>// external construction
+    <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>, 
@@ -190,7 +189,7 @@ class=keyword>const;</span>
                          </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><span class=comment>// convenience
+    <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><a href="#copy_range"><span 
 class=identifier>copy_range</span></a><span class=special>( </span><span 
@@ -226,9 +225,9 @@ non-const iterators from the same container. </p>
      
 <p>
 <a name="equal"></a>      
-<code>bool equal( iterator_range& r ) const;</code>
+<code>bool equal( iterator_range&amp; r ) const;</code>
 <blockquote>
-    <i>Returns</i> <code>begin() == r.begin() && end() == r.end();</code>
+    <i>Returns</i> <code>begin() == r.begin() &amp;&amp; end() == r.end();</code>
 </blockquote>
 </p>      
 
@@ -236,21 +235,21 @@ non-const iterators from the same container. </p>
 
 <p> 
 <a name="comparison"></a>
-<code>bool operator==( const ForwardRange1& l, const ForwardRange2& r );</code>
+<code>bool operator==( const ForwardRange1&amp; l, const ForwardRange2&amp; r );</code>
 <blockquote>
     <i>Returns</i> <code>size(l) != size(r) ? false : std::equal( begin(l), end(l), begin(r) );</code> </blockquote> </p>
-<code>bool operator!=( const ForwardRange1& l, const ForwardRange2& r );</code>
+<code>bool operator!=( const ForwardRange1&amp; l, const ForwardRange2&amp; r );</code>
 <blockquote>
     <i>Returns</i> <code>!( l == r );</code>
 </blockquote>
-<code>bool operator<( const ForwardRange1& l, const ForwardRange2& r );</code>
+<code>bool operator<( const ForwardRange1&amp; l, const ForwardRange2&amp; r );</code>
 <blockquote>
     <i>Returns</i> <code>std::lexicographical_compare( begin(l), end(l), begin(r), end(r) );</code> </blockquote>
     
 <p>    
 <a name="make_iterator_range"></a>
 <pre>
-iterator_range make_iterator_range( Range& r, 
+iterator_range make_iterator_range( Range&amp; r, 
                                     typename range_difference&lt;Range>::type advance_begin, 
                                     typename range_difference&lt;Range>::type advance_end );
 </pre>
@@ -266,7 +265,7 @@ return make_iterator_range( new_begin, new_end );
 </blockquote>
 <p> 
 <a name="copy_range"></a> 
-<code>Sequence copy_range( const ForwardRange& r );</code>
+<code>Sequence copy_range( const ForwardRange&amp; r );</code>
 <blockquote>
     <i>Returns</i> <code>Sequence( begin(r), end(r) );</code>
 </blockquote>
@@ -292,7 +291,7 @@ class can propagate constness since it knows what a corresponding
     </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>typedef </span><span class=keyword>typename </span><span class=identifier>range_iterator</span><span class=special>&lt;</span><span class=identifier>ForwardRange</span><spanclass=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=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>
     
diff --git a/index.html b/index.html
index 56ba4eb..e846421 100644
--- a/index.html
+++ b/index.html
@@ -34,7 +34,7 @@
   </p>
   
   <ul>
-      <li> <a href="doc/intro.html">Introduction </a></code>
+      <li> <a href="doc/intro.html">Introduction </a>
           
       <li><a href="doc/range.html">Range concepts:</a>
       <ul>

From a85afbe470c500497e994d78c7988320f9cfa1bd Mon Sep 17 00:00:00 2001
From: =?UTF-8?q?Thorsten=20J=C3=B8rgen=20Ottosen?=
 <thorsten.ottosen@gmail.com>
Date: Wed, 16 Jul 2008 21:05:16 +0000
Subject: [PATCH 23/73] doc update

[SVN r47495]
---
 doc/upgrading.html | 78 ++++++++++++++++++++++++++++++++++++++++++++++
 index.html         |  2 ++
 2 files changed, 80 insertions(+)
 create mode 100644 doc/upgrading.html

diff --git a/doc/upgrading.html b/doc/upgrading.html
new file mode 100644
index 0000000..fdab5ab
--- /dev/null
+++ b/doc/upgrading.html
@@ -0,0 +1,78 @@
+<!DOCTYPE HTML PUBLIC "-//W3C//DTD HTML 3.2//EN">
+
+<html>
+<head>
+    <meta http-equiv="Content-Type" content="text/html; charset=ISO-8859-1">
+    <title>Boost.Range Upgrading </title> <link rel="stylesheet" 
+    href="style.css" type="text/css">
+</head>
+
+    <body>
+
+    <table border="0" >
+        <tr>
+            <td ><img src="../../../boost.png" border="0" ></td>
+            <td ><h1 align="center">Boost.Range </h1></td>
+        </tr>
+    </table>
+
+    <h2  >Upgrading from Boost v. 1.34.*</h2><a name="v1.34" ></a>
+    <p  >
+    Boost v. 1.35 introduced some larger refactorings of the library:
+    </p>
+    <ul  >
+        <li>Direct support for character arrays was abandoned in favor of 
+            uniform treatment of all arrays. Instead string algorithms can use
+            the new function <a
+            href="boost_range.html#as_literal">as_literal()</a>.</li>
+        <li><a 
+            href="file:///D:/boost/trunk/libs/range/doc/boost_range.html#size">boost::size()</a> now requires a Random Access Range. The old behavior is provided as <a 
+            href="file:///D:/boost/trunk/libs/range/doc/boost_range.html#distance">boost::distance()</a> </li>   
+        <li> <code>range_size&lt;T&gt;::type</code> has been completely removed 
+            in favor of <code>range_difference&lt;T&gt;::type</code>
+            <li>
+                <code>boost_range_begin()</code> and <code>boost_range_end()</code>
+                    have been renamed <code>range_begin()</code> and <code>range_begin()</code>, respectively.</li>
+
+
+            <li><code>range_result_iterator&lt;T&gt;::type</code> and
+            <code>range_reverse_result_iterator&lt;T&gt;::type</code> are have
+            been renamed 
+            <code>range_iterator&lt;T&gt;::type</code>    and 
+                <code>range_reverse_iterator&lt;T&gt;::type</code>. 
+            </li>     
+        <li>The procedure that makes a custom type work with the library 
+            has been greatly simplified. See <a 
+            href="boost_range.html#minimal_interface">extending the library </a> 
+            for details.</li>
+    </ul>
+
+
+    <hr>
+    <p>
+      &copy; <a name="Copyright" id="Copyright">Copyright</a> Thorsten Ottosen 2008.
+    </p>
+
+    <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">www.boost.org/LICENSE_1_0.txt</a>)
+    </p>
+
+    <br>
+    <br>
+    <br>
+    <br>
+    <br>
+    <br>
+    <br>
+    <br>
+    <br>
+    <br>
+    <br>
+    <br>
+
+
+    </body>
+</html>
+
diff --git a/index.html b/index.html
index e846421..3e5f4bb 100644
--- a/index.html
+++ b/index.html
@@ -55,6 +55,8 @@
           <li><a href="doc/mfc_atl.html">MFC/ATL mapping (courtesy of Shunsuke
               Sogame)</a></li>  
       <li><a href="doc/portability.html">Portability</a>
+          <li><a href="doc/upgrading.html">Upgrading from Boost v. 
+              1.34.*</a></li>
       <li><a href="doc/faq.html">FAQ</a>    
       <li><a href="doc/history_ack.html">History and acknowledgment</a>    
           

From 26b096f65db8b158f03b564f6df7c17d8e09ac14 Mon Sep 17 00:00:00 2001
From: =?UTF-8?q?Thorsten=20J=C3=B8rgen=20Ottosen?=
 <thorsten.ottosen@gmail.com>
Date: Tue, 22 Jul 2008 09:29:56 +0000
Subject: [PATCH 24/73] update in response to inspection report

[SVN r47681]
---
 doc/upgrading.html | 4 ++--
 1 file changed, 2 insertions(+), 2 deletions(-)

diff --git a/doc/upgrading.html b/doc/upgrading.html
index fdab5ab..f94e73b 100644
--- a/doc/upgrading.html
+++ b/doc/upgrading.html
@@ -26,8 +26,8 @@
             the new function <a
             href="boost_range.html#as_literal">as_literal()</a>.</li>
         <li><a 
-            href="file:///D:/boost/trunk/libs/range/doc/boost_range.html#size">boost::size()</a> now requires a Random Access Range. The old behavior is provided as <a 
-            href="file:///D:/boost/trunk/libs/range/doc/boost_range.html#distance">boost::distance()</a> </li>   
+            href="boost_range.html#size">boost::size()</a> now requires a Random Access Range. The old behavior is provided as <a 
+            href="boost_range.html#distance">boost::distance()</a> </li>   
         <li> <code>range_size&lt;T&gt;::type</code> has been completely removed 
             in favor of <code>range_difference&lt;T&gt;::type</code>
             <li>

From 12d904a5e416ca92df6232b2ca377e9773644a16 Mon Sep 17 00:00:00 2001
From: "Troy D. Straszheim" <troy@resophonic.com>
Date: Sat, 24 Jan 2009 18:57:20 +0000
Subject: [PATCH 25/73] merge of cmake build files from trunk per beman

[SVN r50756]
---
 CMakeLists.txt      | 22 ++++++++++++++++++++++
 doc/CMakeLists.txt  |  1 +
 module.cmake        |  1 +
 test/CMakeLists.txt | 19 +++++++++++++++++++
 4 files changed, 43 insertions(+)
 create mode 100644 CMakeLists.txt
 create mode 100644 doc/CMakeLists.txt
 create mode 100644 module.cmake
 create mode 100644 test/CMakeLists.txt

diff --git a/CMakeLists.txt b/CMakeLists.txt
new file mode 100644
index 0000000..f0c2263
--- /dev/null
+++ b/CMakeLists.txt
@@ -0,0 +1,22 @@
+#----------------------------------------------------------------------------
+# This file was automatically generated from the original CMakeLists.txt file
+# Add a variable to hold the headers for the library
+set (lib_headers
+    range.hpp
+    range
+)
+
+# Add a library target to the build system
+boost_library_project(
+  range
+  #  SRCDIRS 
+  TESTDIRS  test
+  HEADERS ${lib_headers}
+  DOCDIRS  doc
+  DESCRIPTION  "A new infrastructure for generic algorithms that builds on top of the new iterator concepts."
+  MODULARIZED 
+  AUTHORS  "Thorsten Ottosen <nesotto -at- cs.auc.dk>"
+  #  MAINTAINERS 
+)
+
+
diff --git a/doc/CMakeLists.txt b/doc/CMakeLists.txt
new file mode 100644
index 0000000..3aea8c0
--- /dev/null
+++ b/doc/CMakeLists.txt
@@ -0,0 +1 @@
+boost_add_documentation(boost_range.qbk)
\ No newline at end of file
diff --git a/module.cmake b/module.cmake
new file mode 100644
index 0000000..49c9bc9
--- /dev/null
+++ b/module.cmake
@@ -0,0 +1 @@
+boost_module(range DEPENDS algorithm)
\ No newline at end of file
diff --git a/test/CMakeLists.txt b/test/CMakeLists.txt
new file mode 100644
index 0000000..83d1210
--- /dev/null
+++ b/test/CMakeLists.txt
@@ -0,0 +1,19 @@
+boost_additional_test_dependencies(range BOOST_DEPENDS test)
+
+message(STATUS "libs/range/test: need -Wall -Wunused here when under gcc")
+set( test_compile_flags "")
+IF(CMAKE_COMPILER_IS_GNUCC)
+  SET(test_compile_flags "-Wall -Wunused")
+ENDIF(CMAKE_COMPILER_IS_GNUCC)
+
+boost_test_run(array DEPENDS boost_unit_test_framework COMPILE_FLAGS ${test_compile_flags})
+boost_test_run(iterator_pair DEPENDS boost_unit_test_framework COMPILE_FLAGS ${test_compile_flags})
+boost_test_run(std_container DEPENDS boost_unit_test_framework COMPILE_FLAGS ${test_compile_flags})
+boost_test_run(string DEPENDS boost_unit_test_framework COMPILE_FLAGS ${test_compile_flags})
+boost_test_run(iterator_range DEPENDS boost_unit_test_framework COMPILE_FLAGS ${test_compile_flags})
+boost_test_run(sub_range DEPENDS boost_unit_test_framework COMPILE_FLAGS ${test_compile_flags})
+boost_test_run(partial_workaround DEPENDS boost_unit_test_framework COMPILE_FLAGS ${test_compile_flags})
+boost_test_run(algorithm_example DEPENDS boost_unit_test_framework COMPILE_FLAGS ${test_compile_flags})
+boost_test_run(reversible_range DEPENDS boost_unit_test_framework COMPILE_FLAGS ${test_compile_flags})
+boost_test_run(const_ranges DEPENDS boost_unit_test_framework COMPILE_FLAGS ${test_compile_flags})
+boost_test_run(extension_mechanism DEPENDS boost_unit_test_framework COMPILE_FLAGS ${test_compile_flags})

From deefb61ec654371eedee92a29741265f95be0e74 Mon Sep 17 00:00:00 2001
From: John Maddock <john@johnmaddock.co.uk>
Date: Mon, 23 Feb 2009 18:39:32 +0000
Subject: [PATCH 26/73] Merge PDF build changes from Trunk.

[SVN r51417]
---
 doc/Jamfile.v2 | 1 +
 1 file changed, 1 insertion(+)

diff --git a/doc/Jamfile.v2 b/doc/Jamfile.v2
index bfe0908..fd54f7a 100644
--- a/doc/Jamfile.v2
+++ b/doc/Jamfile.v2
@@ -28,5 +28,6 @@ boostbook standalone
 #    <xsl:param>generate.section.toc.level=4
 #    <xsl:param>chunk.first.sections=7
 #    <xsl:param>toc.section.depth=10
+     <format>pdf:<xsl:param>boost.url.prefix=http://www.boost.org/doc/libs/release/doc/html
   ;
 

From c8c808b04efa04c5f35a20da7973cb3412d46414 Mon Sep 17 00:00:00 2001
From: =?UTF-8?q?Thorsten=20J=C3=B8rgen=20Ottosen?=
 <thorsten.ottosen@gmail.com>
Date: Sun, 5 Apr 2009 20:49:47 +0000
Subject: [PATCH 27/73] fix for bug Ticket #2903

[SVN r52204]
---
 include/boost/range/as_literal.hpp | 4 ++--
 1 file changed, 2 insertions(+), 2 deletions(-)

diff --git a/include/boost/range/as_literal.hpp b/include/boost/range/as_literal.hpp
index 38cc9cf..2f04ca8 100644
--- a/include/boost/range/as_literal.hpp
+++ b/include/boost/range/as_literal.hpp
@@ -38,7 +38,7 @@ namespace boost
             return strlen( s );
         }
 
-#ifndef BOOST_NO_INTRINSIC_WCHAR_T 
+#ifndef BOOST_NO_CWCHAR  
         inline std::size_t length( const wchar_t* s )
         {
             return wcslen( s );
@@ -61,7 +61,7 @@ namespace boost
             return true;
         }
 
-#ifndef BOOST_NO_INTRINSIC_WCHAR_T 
+#ifndef BOOST_NO_CWCHAR  
         inline bool is_char_ptr( wchar_t* )
         {
             return true;

From 90f4eca5cde90d98cddfc33f892bc6c1ee8010f6 Mon Sep 17 00:00:00 2001
From: Daniel James <daniel@calamity.org.uk>
Date: Sat, 16 May 2009 13:45:21 +0000
Subject: [PATCH 28/73] Merge in inspect checks for links in CSS files and
 external content. And fix a few of these issues.

Merged revisions 52663-52664,52666-52668,52712 via svnmerge from
https://svn.boost.org/svn/boost/trunk

........
  r52663 | danieljames | 2009-04-29 22:12:08 +0100 (Wed, 29 Apr 2009) | 1 line

  Check for invalid css links in html files as well as css files.
........
  r52664 | danieljames | 2009-04-29 22:12:32 +0100 (Wed, 29 Apr 2009) | 1 line

  Check for external links.
........
  r52666 | danieljames | 2009-04-29 22:19:12 +0100 (Wed, 29 Apr 2009) | 1 line

  Use local copies of the boost logo.
........
  r52667 | danieljames | 2009-04-29 22:19:40 +0100 (Wed, 29 Apr 2009) | 1 line

  Remove unused copy of boostbook.css
........
  r52668 | danieljames | 2009-04-29 22:19:56 +0100 (Wed, 29 Apr 2009) | 3 lines

  Fix a link to a header on trac.

  IMO it would be better to link to the local copy.
........
  r52712 | danieljames | 2009-05-01 21:51:10 +0100 (Fri, 01 May 2009) | 1 line

  Better inspect error for external content.
........


[SVN r53044]
---
 doc/mfc_atl.html | 2 +-
 1 file changed, 1 insertion(+), 1 deletion(-)

diff --git a/doc/mfc_atl.html b/doc/mfc_atl.html
index a022fe3..cc8eeb0 100644
--- a/doc/mfc_atl.html
+++ b/doc/mfc_atl.html
@@ -291,7 +291,7 @@ ul.auto-toc {
 </head>
 <body>
 <div class="document" id="boost-range-mfc-atl-extension">
-<h1 class="title"><img alt="Boost" src="http://www.boost.org/libs/ptr_container/doc/boost.png" /> Range MFC/ATL Extension</h1>
+<h1 class="title"><img alt="Boost" src="../../ptr_container/doc/boost.png" /> Range MFC/ATL Extension</h1>
 <table class="docinfo" frame="void" rules="none">
 <col class="docinfo-name" />
 <col class="docinfo-content" />

From a39946c55de83e91b116a49c5f96fe378a31adca Mon Sep 17 00:00:00 2001
From: "Troy D. Straszheim" <troy@resophonic.com>
Date: Wed, 22 Jul 2009 21:51:01 +0000
Subject: [PATCH 29/73] Add basic copyright/license to keep cmake out of the
 inspection report

[SVN r55095]
---
 CMakeLists.txt      | 6 ++++++
 doc/CMakeLists.txt  | 6 ++++++
 test/CMakeLists.txt | 6 ++++++
 3 files changed, 18 insertions(+)

diff --git a/CMakeLists.txt b/CMakeLists.txt
index f0c2263..44214cf 100644
--- a/CMakeLists.txt
+++ b/CMakeLists.txt
@@ -1,3 +1,9 @@
+#
+# Copyright Troy D. Straszheim
+#
+# Distributed under the Boost Software License, Version 1.0.
+# See http://www.boost.org/LICENSE_1_0.txt
+#
 #----------------------------------------------------------------------------
 # This file was automatically generated from the original CMakeLists.txt file
 # Add a variable to hold the headers for the library
diff --git a/doc/CMakeLists.txt b/doc/CMakeLists.txt
index 3aea8c0..2a15cc3 100644
--- a/doc/CMakeLists.txt
+++ b/doc/CMakeLists.txt
@@ -1 +1,7 @@
+#
+# Copyright Troy D. Straszheim
+#
+# Distributed under the Boost Software License, Version 1.0.
+# See http://www.boost.org/LICENSE_1_0.txt
+#
 boost_add_documentation(boost_range.qbk)
\ No newline at end of file
diff --git a/test/CMakeLists.txt b/test/CMakeLists.txt
index 83d1210..0907adc 100644
--- a/test/CMakeLists.txt
+++ b/test/CMakeLists.txt
@@ -1,3 +1,9 @@
+#
+# Copyright Troy D. Straszheim
+#
+# Distributed under the Boost Software License, Version 1.0.
+# See http://www.boost.org/LICENSE_1_0.txt
+#
 boost_additional_test_dependencies(range BOOST_DEPENDS test)
 
 message(STATUS "libs/range/test: need -Wall -Wunused here when under gcc")

From 29fa8779495f16770e288f0050e2fec6ce97d646 Mon Sep 17 00:00:00 2001
From: "Troy D. Straszheim" <troy@resophonic.com>
Date: Sat, 17 Oct 2009 01:10:45 +0000
Subject: [PATCH 30/73] rm cmake from the release branch before it goes out
 broken.  Policy dictates that you never commit to release, you commit to
 trunk and merge to release.

[SVN r56941]
---
 CMakeLists.txt      | 28 ----------------------------
 doc/CMakeLists.txt  |  7 -------
 module.cmake        |  1 -
 test/CMakeLists.txt | 25 -------------------------
 4 files changed, 61 deletions(-)
 delete mode 100644 CMakeLists.txt
 delete mode 100644 doc/CMakeLists.txt
 delete mode 100644 module.cmake
 delete mode 100644 test/CMakeLists.txt

diff --git a/CMakeLists.txt b/CMakeLists.txt
deleted file mode 100644
index 44214cf..0000000
--- a/CMakeLists.txt
+++ /dev/null
@@ -1,28 +0,0 @@
-#
-# Copyright Troy D. Straszheim
-#
-# Distributed under the Boost Software License, Version 1.0.
-# See http://www.boost.org/LICENSE_1_0.txt
-#
-#----------------------------------------------------------------------------
-# This file was automatically generated from the original CMakeLists.txt file
-# Add a variable to hold the headers for the library
-set (lib_headers
-    range.hpp
-    range
-)
-
-# Add a library target to the build system
-boost_library_project(
-  range
-  #  SRCDIRS 
-  TESTDIRS  test
-  HEADERS ${lib_headers}
-  DOCDIRS  doc
-  DESCRIPTION  "A new infrastructure for generic algorithms that builds on top of the new iterator concepts."
-  MODULARIZED 
-  AUTHORS  "Thorsten Ottosen <nesotto -at- cs.auc.dk>"
-  #  MAINTAINERS 
-)
-
-
diff --git a/doc/CMakeLists.txt b/doc/CMakeLists.txt
deleted file mode 100644
index 2a15cc3..0000000
--- a/doc/CMakeLists.txt
+++ /dev/null
@@ -1,7 +0,0 @@
-#
-# Copyright Troy D. Straszheim
-#
-# Distributed under the Boost Software License, Version 1.0.
-# See http://www.boost.org/LICENSE_1_0.txt
-#
-boost_add_documentation(boost_range.qbk)
\ No newline at end of file
diff --git a/module.cmake b/module.cmake
deleted file mode 100644
index 49c9bc9..0000000
--- a/module.cmake
+++ /dev/null
@@ -1 +0,0 @@
-boost_module(range DEPENDS algorithm)
\ No newline at end of file
diff --git a/test/CMakeLists.txt b/test/CMakeLists.txt
deleted file mode 100644
index 0907adc..0000000
--- a/test/CMakeLists.txt
+++ /dev/null
@@ -1,25 +0,0 @@
-#
-# Copyright Troy D. Straszheim
-#
-# Distributed under the Boost Software License, Version 1.0.
-# See http://www.boost.org/LICENSE_1_0.txt
-#
-boost_additional_test_dependencies(range BOOST_DEPENDS test)
-
-message(STATUS "libs/range/test: need -Wall -Wunused here when under gcc")
-set( test_compile_flags "")
-IF(CMAKE_COMPILER_IS_GNUCC)
-  SET(test_compile_flags "-Wall -Wunused")
-ENDIF(CMAKE_COMPILER_IS_GNUCC)
-
-boost_test_run(array DEPENDS boost_unit_test_framework COMPILE_FLAGS ${test_compile_flags})
-boost_test_run(iterator_pair DEPENDS boost_unit_test_framework COMPILE_FLAGS ${test_compile_flags})
-boost_test_run(std_container DEPENDS boost_unit_test_framework COMPILE_FLAGS ${test_compile_flags})
-boost_test_run(string DEPENDS boost_unit_test_framework COMPILE_FLAGS ${test_compile_flags})
-boost_test_run(iterator_range DEPENDS boost_unit_test_framework COMPILE_FLAGS ${test_compile_flags})
-boost_test_run(sub_range DEPENDS boost_unit_test_framework COMPILE_FLAGS ${test_compile_flags})
-boost_test_run(partial_workaround DEPENDS boost_unit_test_framework COMPILE_FLAGS ${test_compile_flags})
-boost_test_run(algorithm_example DEPENDS boost_unit_test_framework COMPILE_FLAGS ${test_compile_flags})
-boost_test_run(reversible_range DEPENDS boost_unit_test_framework COMPILE_FLAGS ${test_compile_flags})
-boost_test_run(const_ranges DEPENDS boost_unit_test_framework COMPILE_FLAGS ${test_compile_flags})
-boost_test_run(extension_mechanism DEPENDS boost_unit_test_framework COMPILE_FLAGS ${test_compile_flags})

From eea32403ef6affe4f7e558e5ab1f5c78e1f324c0 Mon Sep 17 00:00:00 2001
From: Neil Groves <neil@grovescomputing.com>
Date: Thu, 8 Apr 2010 19:34:17 +0000
Subject: [PATCH 31/73] Boost.Range merge of fixes from the trunk.

[SVN r61146]
---
 doc/Jamfile.v2                                |  18 +-
 doc/boost_range.qbk                           |  18 +-
 doc/html/index.html                           |   6 +-
 doc/html/quickbook_HTML.manifest              |   1 +
 doc/html/range/concepts.html                  |   2 +-
 .../range/concepts/bidirectional_range.html   |  20 +-
 doc/html/range/concepts/concept_checking.html |  10 +-
 doc/html/range/concepts/forward_range.html    |  14 +-
 doc/html/range/concepts/overview.html         |   2 +-
 .../range/concepts/random_access_range.html   |  16 +-
 .../range/concepts/single_pass_range.html     |  20 +-
 doc/html/range/examples.html                  |   2 +-
 doc/html/range/faq.html                       |   2 +-
 doc/html/range/history_ack.html               |   2 +-
 doc/html/range/introduction.html              |   6 +-
 doc/html/range/library_headers.html           |   2 +-
 doc/html/range/mfc_atl.html                   |   6 +-
 doc/html/range/mfc_atl/atl_ranges.html        |   2 +-
 doc/html/range/mfc_atl/const_ranges.html      |   2 +-
 doc/html/range/mfc_atl/mfc_ranges.html        |   2 +-
 doc/html/range/mfc_atl/references.html        |   2 +-
 doc/html/range/mfc_atl/requirements.html      |   2 +-
 doc/html/range/portability.html               |   2 +-
 doc/html/range/reference.html                 |   2 +-
 doc/html/range/reference/adaptors.html        |   2 +-
 .../adaptors_general_requirements.html        |   2 +-
 .../adaptors/adaptors_introduction.html       |   8 +-
 .../adaptors/adaptors_reference.html          |   2 +-
 .../adaptors_reference/adjacent_filtered.html |   2 +-
 .../adaptors/adaptors_reference/copied.html   |   2 +-
 .../adaptors/adaptors_reference/filtered.html |   2 +-
 .../adaptors/adaptors_reference/indexed.html  |   2 +-
 .../adaptors_reference/indirected.html        |   2 +-
 .../adaptors/adaptors_reference/map_keys.html |   2 +-
 .../adaptors_reference/map_values.html        |   2 +-
 .../adaptors/adaptors_reference/replaced.html |   2 +-
 .../adaptors_reference/replaced_if.html       |   2 +-
 .../adaptors/adaptors_reference/reversed.html |   2 +-
 .../adaptors/adaptors_reference/sliced.html   |   2 +-
 .../adaptors/adaptors_reference/strided.html  |   2 +-
 .../adaptors_reference/tokenized.html         |   2 +-
 .../adaptors_reference/transformed.html       |   2 +-
 .../adaptors/adaptors_reference/uniqued.html  |   2 +-
 .../reference/adaptors/adaptors_synopsis.html |   2 +-
 doc/html/range/reference/algorithms.html      |   2 +-
 .../reference/algorithms/heap_algorithms.html |   2 +-
 .../algorithms/heap_algorithms/make_heap.html |  12 +-
 .../algorithms/heap_algorithms/pop_heap.html  |  14 +-
 .../algorithms/heap_algorithms/push_heap.html |  14 +-
 .../algorithms/permutation_algorithms.html    |   2 +-
 .../next_permutation.html                     |  12 +-
 .../prev_permutation.html                     |  12 +-
 .../range_algorithm_introduction.html         |   2 +-
 .../range_algorithm_mutating_algorithms.html  |   2 +-
 .../copy.html                                 |  14 +-
 .../copy_backward.html                        |  14 +-
 .../fill.html                                 |  12 +-
 .../generate.html                             |  14 +-
 .../inplace_merge.html                        |  18 +-
 .../merge.html                                |  18 +-
 .../nth_element.html                          |  12 +-
 .../partial_sort.html                         |  12 +-
 .../partition.html                            |  12 +-
 .../random_shuffle.html                       |  14 +-
 .../remove.html                               |  12 +-
 .../remove_if.html                            |  12 +-
 .../replace.html                              |  12 +-
 .../replace_if.html                           |  12 +-
 .../rotate.html                               |  14 +-
 .../sort.html                                 |  12 +-
 .../stable_partition.html                     |  12 +-
 .../stable_sort.html                          |  12 +-
 .../transform.html                            |  14 +-
 .../unique.html                               |  12 +-
 .../range_algorithm_new_algorithms.html       |   4 +-
 .../range_algorithm_new_algorithms/erase.html |  12 +-
 .../for_each.html                             |  12 +-
 .../insert.html                               |  18 +-
 .../range_algorithm_new_algorithms/iota.html  |  96 +++++++
 .../overwrite.html                            |  18 +-
 .../push_back.html                            |  12 +-
 .../push_front.html                           |  12 +-
 .../remove_erase.html                         |  12 +-
 .../remove_erase_if.html                      |  12 +-
 ...nge_algorithm_non_mutating_algorithms.html |   2 +-
 .../adjacent_find.html                        |  12 +-
 .../binary_search.html                        |  14 +-
 .../count.html                                |  12 +-
 .../equal.html                                |  12 +-
 .../equal_range.html                          |  14 +-
 .../find.html                                 |  24 +-
 .../find_end.html                             |  42 +--
 .../find_first_of.html                        |  42 +--
 .../find_if.html                              |  26 +-
 .../for_each.html                             |  12 +-
 .../lexicographical_compare.html              |  12 +-
 .../lower_bound.html                          |  26 +-
 .../max_element.html                          |  12 +-
 .../min_element.html                          |  12 +-
 .../mismatch.html                             |  14 +-
 .../search.html                               |  12 +-
 .../upper_bound.html                          |  26 +-
 .../reference/algorithms/range_numeric.html   |   2 +-
 .../algorithms/range_numeric/accumulate.html  |  16 +-
 .../range_numeric/adjacent_difference.html    |  18 +-
 .../range_numeric/inner_product.html          |  18 +-
 .../algorithms/range_numeric/partial_sum.html |  18 +-
 .../reference/algorithms/set_algorithms.html  |   2 +-
 .../algorithms/set_algorithms/includes.html   |  14 +-
 .../set_algorithms/set_difference.html        |  14 +-
 .../set_algorithms/set_intersection.html      |  14 +-
 .../set_symmetric_difference.html             |  14 +-
 .../algorithms/set_algorithms/set_union.html  |  14 +-
 doc/html/range/reference/extending.html       |   2 +-
 .../range/reference/extending/method_1.html   |   4 +-
 .../range/reference/extending/method_2.html   |   2 +-
 .../range/reference/extending/method_3.html   |   2 +-
 .../extending/method_3/method_3_1.html        |   2 +-
 .../extending/method_3/method_3_2.html        |   2 +-
 doc/html/range/reference/overview.html        |   2 +-
 doc/html/range/reference/ranges.html          |   2 +-
 .../reference/ranges/counting_range.html      |  10 +-
 doc/html/range/reference/ranges/irange.html   |  12 +-
 .../range/reference/ranges/istream_range.html |   8 +-
 doc/html/range/reference/semantics.html       |   4 +-
 .../range/reference/semantics/functions.html  |   2 +-
 .../reference/semantics/metafunctions.html    |   2 +-
 doc/html/range/reference/synopsis.html        |   2 +-
 doc/html/range/style_guide.html               |   4 +-
 doc/html/range/upgrade.html                   |   2 +-
 doc/html/range/upgrade/upgrade_from_1_34.html |   2 +-
 doc/html/range/upgrade/upgrade_from_1_42.html |   2 +-
 doc/html/range/utilities.html                 |   4 +-
 doc/html/range/utilities/iterator_range.html  |  10 +-
 doc/html/range/utilities/join.html            |   6 +-
 doc/html/range/utilities/sub_range.html       |   4 +-
 doc/reference/algorithm_ext/iota.qbk          |   2 +-
 .../boost/range/adaptor/adjacent_filtered.hpp | 198 ++++++-------
 include/boost/range/adaptor/uniqued.hpp       |  42 +--
 include/boost/range/combine.hpp               | 272 +++++++++---------
 include/boost/range/size_type.hpp             |   3 +-
 test/combine.cpp                              |  20 +-
 test/iterator_range.cpp                       |   2 +-
 143 files changed, 903 insertions(+), 951 deletions(-)
 create mode 100644 doc/html/range/reference/algorithms/range_algorithm_new_algorithms/iota.html
 mode change 100755 => 100644 include/boost/range/size_type.hpp

diff --git a/doc/Jamfile.v2 b/doc/Jamfile.v2
index e286110..5195b32 100644
--- a/doc/Jamfile.v2
+++ b/doc/Jamfile.v2
@@ -8,20 +8,12 @@
 #// For more information, see http://www.boost.org/libs/range/
 #//
 
-
-#use-project boost : $(BOOST_ROOT) ;
-
 project boost/libs/range/doc ;
-import boostbook : boostbook ;
-#import quickbook ;
+using boostbook ;
 using quickbook ;
 
 path-constant images_location : html ;
 
-#xml boost_range : boost_range.qbk ;
-
-#boostbook standalone
-
 boostbook quickbook
   :
     boost_range.qbk
@@ -34,11 +26,7 @@ boostbook quickbook
     <xsl:param>toc.section.depth=3
     <xsl:param>toc.max.depth=3
     <xsl:param>generate.section.toc.level=4
- 
-#    <xsl:param>generate.section.toc.level=4
-#    <xsl:param>chunk.first.sections=7
-#    <xsl:param>toc.section.depth=10
-     <format>pdf:<xsl:param>boost.url.prefix=http://www.boost.org/doc/libs/release/doc/html
-     <format>pdf:<xsl:param>img.src.path=$(images_location)/
+    <format>pdf:<xsl:param>boost.url.prefix=http://www.boost.org/doc/libs/release/doc/html
+    <format>pdf:<xsl:param>img.src.path=$(images_location)/
   ;
 
diff --git a/doc/boost_range.qbk b/doc/boost_range.qbk
index 45af6c4..1d56b82 100644
--- a/doc/boost_range.qbk
+++ b/doc/boost_range.qbk
@@ -64,17 +64,17 @@
 [def __range_adaptors__         [link range.reference.adaptors Range adaptors]]
 [def __range_algorithms__       [link range.reference.algorithms Range algorithms]]
 
-[def __single_pass_iterator__   [@../../libs/iterator/doc/new-iter-concepts.html#singls-pass-iterators-lib-single-pass-iterators Single Pass Iterator]]
-[def __forward_traversal_iterator__ [@../../libs/iterator/doc/new-iter-concepts.html#forward-traversal-iterators-lib-forward-traversal-iterators Forward Traversal Iterator]]
-[def __bidirectional_traversal_iterator__ [@../../libs/iterator/doc/new-iter-concepts.html#bidirectional-traversal-iterators-lib-bidirectional-traversal-iterators Bidirectional Traversal Iterator]]
-[def __random_access_traversal_iterator__ [@../../libs/iterator/doc/new-iter-concepts.html#random-access-traversal-iterators-lib-random-access-traversal-iterators Random Access Traversal Iterator]]
-[def __new_style_iterators__    [@../../libs/iterator/doc/new-iter-concepts.html new style iterators]]
-[def __iterator_concepts__      [@../../libs/iterator/doc/iterator_concepts.html Iterator concepts]]
+[def __single_pass_iterator__   [@boost:/libs/iterator/doc/new-iter-concepts.html#singls-pass-iterators-lib-single-pass-iterators Single Pass Iterator]]
+[def __forward_traversal_iterator__ [@boost:/libs/iterator/doc/new-iter-concepts.html#forward-traversal-iterators-lib-forward-traversal-iterators Forward Traversal Iterator]]
+[def __bidirectional_traversal_iterator__ [@boost:/libs/iterator/doc/new-iter-concepts.html#bidirectional-traversal-iterators-lib-bidirectional-traversal-iterators Bidirectional Traversal Iterator]]
+[def __random_access_traversal_iterator__ [@boost:/libs/iterator/doc/new-iter-concepts.html#random-access-traversal-iterators-lib-random-access-traversal-iterators Random Access Traversal Iterator]]
+[def __new_style_iterators__    [@boost:/libs/iterator/doc/new-iter-concepts.html new style iterators]]
+[def __iterator_concepts__      [@boost:/libs/iterator/doc/iterator_concepts.html Iterator concepts]]
 
 [def __container__              [@http://www.sgi.com/Technology/STL/Container.html Container]]
-[def __metafunctions__          [@../../libs/mpl/doc/refmanual/metafunction.html metafunctions]]
-[def __concept_check__          [@../../libs/concept_check/index.html Boost Concept Check library]]
-[def __boost_array__            [@../../libs/array/index.html boost::array]]
+[def __metafunctions__          [@boost:/libs/mpl/doc/refmanual/metafunction.html metafunctions]]
+[def __concept_check__          [@boost:/libs/concept_check/index.html Boost Concept Check library]]
+[def __boost_array__            [@boost:/libs/array/index.html boost::array]]
 [def __the_forwarding_problem__ [@http://std.dkuug.dk/jtc1/sc22/wg21/docs/papers/2002/n1385.htm The Forwarding Problem]]
 
 [def __sgi_inner_product__      [@http://www.sgi.com/tech/stl/inner_product.html inner_product]]
diff --git a/doc/html/index.html b/doc/html/index.html
index 4f1a4a1..f5bb91c 100644
--- a/doc/html/index.html
+++ b/doc/html/index.html
@@ -3,7 +3,7 @@
 <meta http-equiv="Content-Type" content="text/html; charset=US-ASCII">
 <title>Chapter&#160;1.&#160;Range 2.0</title>
 <link rel="stylesheet" href="../../../../doc/html/boostbook.css" type="text/css">
-<meta name="generator" content="DocBook XSL Stylesheets V1.75.1">
+<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="next" href="range/introduction.html" title="Introduction">
 </head>
@@ -30,7 +30,7 @@
 </h3></div></div>
 <div><p class="copyright">Copyright &#169; 2003 -2010 Thorsten Ottosen, Neil Groves</p></div>
 <div><div class="legalnotice" title="Legal Notice">
-<a name="id2902944"></a><p>
+<a name="id621301"></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>
@@ -135,7 +135,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: April 03, 2010 at 08:56:46 GMT</small></p></td>
+<td align="left"><p><small>Last revised: April 05, 2010 at 17:25:33 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 b3be8f5..67e69fa 100644
--- a/doc/html/quickbook_HTML.manifest
+++ b/doc/html/quickbook_HTML.manifest
@@ -91,6 +91,7 @@ range/reference/algorithms/range_algorithm_new_algorithms.html
 range/reference/algorithms/range_algorithm_new_algorithms/erase.html
 range/reference/algorithms/range_algorithm_new_algorithms/for_each.html
 range/reference/algorithms/range_algorithm_new_algorithms/insert.html
+range/reference/algorithms/range_algorithm_new_algorithms/iota.html
 range/reference/algorithms/range_algorithm_new_algorithms/overwrite.html
 range/reference/algorithms/range_algorithm_new_algorithms/push_back.html
 range/reference/algorithms/range_algorithm_new_algorithms/push_front.html
diff --git a/doc/html/range/concepts.html b/doc/html/range/concepts.html
index c384122..c43b67c 100644
--- a/doc/html/range/concepts.html
+++ b/doc/html/range/concepts.html
@@ -3,7 +3,7 @@
 <meta http-equiv="Content-Type" content="text/html; charset=US-ASCII">
 <title>Range Concepts</title>
 <link rel="stylesheet" href="../../../../../doc/html/boostbook.css" type="text/css">
-<meta name="generator" content="DocBook XSL Stylesheets V1.75.1">
+<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="../index.html" title="Chapter&#160;1.&#160;Range 2.0">
 <link rel="prev" href="introduction.html" title="Introduction">
diff --git a/doc/html/range/concepts/bidirectional_range.html b/doc/html/range/concepts/bidirectional_range.html
index 796ca14..0fc965b 100644
--- a/doc/html/range/concepts/bidirectional_range.html
+++ b/doc/html/range/concepts/bidirectional_range.html
@@ -3,7 +3,7 @@
 <meta http-equiv="Content-Type" content="text/html; charset=US-ASCII">
 <title>Bidirectional Range</title>
 <link rel="stylesheet" href="../../../../../../doc/html/boostbook.css" type="text/css">
-<meta name="generator" content="DocBook XSL Stylesheets V1.75.1">
+<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="../concepts.html" title="Range Concepts">
 <link rel="prev" href="forward_range.html" title="Forward Range">
@@ -27,7 +27,7 @@
 <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="id2915351"></a>
+<a name="id632764"></a>
         <a class="link" href="bidirectional_range.html#range.concepts.bidirectional_range.notation">Notation</a>
       </h5>
 <div class="informaltable"><table class="table">
@@ -65,17 +65,17 @@
 </tbody>
 </table></div>
 <a name="range.concepts.bidirectional_range.description"></a><h5>
-<a name="id2915449"></a>
+<a name="id632852"></a>
         <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
         (forward and reverse). The <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> iterator must meet all of the requirements
-        of <a href="../../../../libs/iterator/doc/new-iter-concepts.html#bidirectional-traversal-iterators-lib-bidirectional-traversal-iterators" target="_top">Bidirectional
+        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="id2915514"></a>
+<a name="id632911"></a>
         <a class="link" href="bidirectional_range.html#range.concepts.bidirectional_range.refinement_of">Refinement
         of</a>
       </h5>
@@ -83,7 +83,7 @@
         <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="id2915543"></a>
+<a name="id632934"></a>
         <a class="link" href="bidirectional_range.html#range.concepts.bidirectional_range.associated_types">Associated
         types</a>
       </h5>
@@ -136,7 +136,7 @@
 </tbody>
 </table></div>
 <a name="range.concepts.bidirectional_range.valid_expressions"></a><h5>
-<a name="id2915709"></a>
+<a name="id633090"></a>
         <a class="link" href="bidirectional_range.html#range.concepts.bidirectional_range.valid_expressions">Valid
         expressions</a>
       </h5>
@@ -221,7 +221,7 @@
 </tbody>
 </table></div>
 <a name="range.concepts.bidirectional_range.complexity_guarantees"></a><h5>
-<a name="id2916188"></a>
+<a name="id633550"></a>
         <a class="link" href="bidirectional_range.html#range.concepts.bidirectional_range.complexity_guarantees">Complexity
         guarantees</a>
       </h5>
@@ -232,7 +232,7 @@
         <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="id2916338"></a>
+<a name="id633691"></a>
         <a class="link" href="bidirectional_range.html#range.concepts.bidirectional_range.invariants">Invariants</a>
       </h5>
 <div class="informaltable"><table class="table">
@@ -272,7 +272,7 @@
 </tbody>
 </table></div>
 <a name="range.concepts.bidirectional_range.see_also"></a><h5>
-<a name="id2916600"></a>
+<a name="id633940"></a>
         <a class="link" href="bidirectional_range.html#range.concepts.bidirectional_range.see_also">See also</a>
       </h5>
 <p>
diff --git a/doc/html/range/concepts/concept_checking.html b/doc/html/range/concepts/concept_checking.html
index 37175b4..a4aa1d9 100644
--- a/doc/html/range/concepts/concept_checking.html
+++ b/doc/html/range/concepts/concept_checking.html
@@ -3,7 +3,7 @@
 <meta http-equiv="Content-Type" content="text/html; charset=US-ASCII">
 <title>Concept Checking</title>
 <link rel="stylesheet" href="../../../../../../doc/html/boostbook.css" type="text/css">
-<meta name="generator" content="DocBook XSL Stylesheets V1.75.1">
+<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="../concepts.html" title="Range Concepts">
 <link rel="prev" href="random_access_range.html" title="Random Access Range">
@@ -29,7 +29,7 @@
 <p>
         Each of the range concepts has a corresponding concept checking class in
         the file <a href="../../../../boost/range/concepts.hpp" target="_top"><code class="computeroutput"><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">concepts</span><span class="special">.</span><span class="identifier">hpp</span><span class="special">&gt;</span></code></a>.
-        These classes may be used in conjunction with the <a href="../../../../libs/concept_check/index.html" target="_top">Boost
+        These classes may be used in conjunction with the <a href="../../../../../../libs/concept_check/index.html" target="_top">Boost
         Concept Check library</a> to ensure that the type of a template parameter
         is compatible with a range concept. If not, a meaningful compile time error
         is generated. Checks are provided for the range concepts related to iterator
@@ -79,17 +79,17 @@
 </li>
 </ul></div>
 <a name="range.concepts.concept_checking.see_also"></a><h5>
-<a name="id2917610"></a>
+<a name="id634869"></a>
         <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>
       </p>
 <p>
-        <a href="../../../../libs/iterator/doc/iterator_concepts.html" target="_top">Iterator concepts</a>
+        <a href="../../../../../../libs/iterator/doc/iterator_concepts.html" target="_top">Iterator concepts</a>
       </p>
 <p>
-        <a href="../../../../libs/concept_check/index.html" target="_top">Boost Concept Check library</a>
+        <a href="../../../../../../libs/concept_check/index.html" target="_top">Boost Concept Check library</a>
       </p>
 </div>
 <table xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" width="100%"><tr>
diff --git a/doc/html/range/concepts/forward_range.html b/doc/html/range/concepts/forward_range.html
index 9076b68..f82d8c5 100644
--- a/doc/html/range/concepts/forward_range.html
+++ b/doc/html/range/concepts/forward_range.html
@@ -3,7 +3,7 @@
 <meta http-equiv="Content-Type" content="text/html; charset=US-ASCII">
 <title>Forward Range</title>
 <link rel="stylesheet" href="../../../../../../doc/html/boostbook.css" type="text/css">
-<meta name="generator" content="DocBook XSL Stylesheets V1.75.1">
+<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="../concepts.html" title="Range Concepts">
 <link rel="prev" href="single_pass_range.html" title="Single Pass Range">
@@ -27,7 +27,7 @@
 <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="id2914944"></a>
+<a name="id632396"></a>
         <a class="link" href="forward_range.html#range.concepts.forward_range.notation">Notation</a>
       </h5>
 <div class="informaltable"><table class="table">
@@ -65,22 +65,22 @@
 </tbody>
 </table></div>
 <a name="range.concepts.forward_range.description"></a><h5>
-<a name="id2915040"></a>
+<a name="id632484"></a>
         <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
+        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="id2915112"></a>
+<a name="id632550"></a>
         <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="id2915141"></a>
+<a name="id632572"></a>
         <a class="link" href="forward_range.html#range.concepts.forward_range.associated_types">Associated
         types</a>
       </h5>
@@ -132,7 +132,7 @@
 </tbody>
 </table></div>
 <a name="range.concepts.forward_range.see_also"></a><h5>
-<a name="id2915298"></a>
+<a name="id632721"></a>
         <a class="link" href="forward_range.html#range.concepts.forward_range.see_also">See also</a>
       </h5>
 <p>
diff --git a/doc/html/range/concepts/overview.html b/doc/html/range/concepts/overview.html
index 7cd19e8..c2bb4d1 100644
--- a/doc/html/range/concepts/overview.html
+++ b/doc/html/range/concepts/overview.html
@@ -3,7 +3,7 @@
 <meta http-equiv="Content-Type" content="text/html; charset=US-ASCII">
 <title>Overview</title>
 <link rel="stylesheet" href="../../../../../../doc/html/boostbook.css" type="text/css">
-<meta name="generator" content="DocBook XSL Stylesheets V1.75.1">
+<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="../concepts.html" title="Range Concepts">
 <link rel="prev" href="../concepts.html" title="Range Concepts">
diff --git a/doc/html/range/concepts/random_access_range.html b/doc/html/range/concepts/random_access_range.html
index 97b3171..cc5d88e 100644
--- a/doc/html/range/concepts/random_access_range.html
+++ b/doc/html/range/concepts/random_access_range.html
@@ -3,7 +3,7 @@
 <meta http-equiv="Content-Type" content="text/html; charset=US-ASCII">
 <title>Random Access Range</title>
 <link rel="stylesheet" href="../../../../../../doc/html/boostbook.css" type="text/css">
-<meta name="generator" content="DocBook XSL Stylesheets V1.75.1">
+<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="../concepts.html" title="Range Concepts">
 <link rel="prev" href="bidirectional_range.html" title="Bidirectional Range">
@@ -27,15 +27,15 @@
 <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="id2916653"></a>
+<a name="id633982"></a>
         <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
+        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="id2916725"></a>
+<a name="id634048"></a>
         <a class="link" href="random_access_range.html#range.concepts.random_access_range.refinement_of">Refinement
         of</a>
       </h5>
@@ -43,7 +43,7 @@
         <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="id2916753"></a>
+<a name="id634071"></a>
         <a class="link" href="random_access_range.html#range.concepts.random_access_range.valid_expressions">Valid
         expressions</a>
       </h5>
@@ -89,7 +89,7 @@
 </tr></tbody>
 </table></div>
 <a name="range.concepts.random_access_range.expression_semantics"></a><h5>
-<a name="id2916900"></a>
+<a name="id634209"></a>
         <a class="link" href="random_access_range.html#range.concepts.random_access_range.expression_semantics">Expression
         semantics</a>
       </h5>
@@ -139,7 +139,7 @@
 </tr></tbody>
 </table></div>
 <a name="range.concepts.random_access_range.complexity_guarantees"></a><h5>
-<a name="id2917126"></a>
+<a name="id634425"></a>
         <a class="link" href="random_access_range.html#range.concepts.random_access_range.complexity_guarantees">Complexity
         guarantees</a>
       </h5>
@@ -147,7 +147,7 @@
         <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="id2917180"></a>
+<a name="id634473"></a>
         <a class="link" href="random_access_range.html#range.concepts.random_access_range.invariants">Invariants</a>
       </h5>
 <div class="informaltable"><table class="table">
diff --git a/doc/html/range/concepts/single_pass_range.html b/doc/html/range/concepts/single_pass_range.html
index 10669d1..9cb3123 100644
--- a/doc/html/range/concepts/single_pass_range.html
+++ b/doc/html/range/concepts/single_pass_range.html
@@ -3,7 +3,7 @@
 <meta http-equiv="Content-Type" content="text/html; charset=US-ASCII">
 <title>Single Pass Range</title>
 <link rel="stylesheet" href="../../../../../../doc/html/boostbook.css" type="text/css">
-<meta name="generator" content="DocBook XSL Stylesheets V1.75.1">
+<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="../concepts.html" title="Range Concepts">
 <link rel="prev" href="overview.html" title="Overview">
@@ -27,7 +27,7 @@
 <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="id2913566"></a>
+<a name="id631108"></a>
         <a class="link" href="single_pass_range.html#range.concepts.single_pass_range.notation">Notation</a>
       </h5>
 <div class="informaltable"><table class="table">
@@ -65,15 +65,15 @@
 </tbody>
 </table></div>
 <a name="range.concepts.single_pass_range.description"></a><h5>
-<a name="id2913668"></a>
+<a name="id631200"></a>
         <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
+        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="id2913740"></a>
+<a name="id631265"></a>
         <a class="link" href="single_pass_range.html#range.concepts.single_pass_range.associated_types">Associated
         types</a>
       </h5>
@@ -126,7 +126,7 @@
 </tbody>
 </table></div>
 <a name="range.concepts.single_pass_range.valid_expressions"></a><h5>
-<a name="id2913914"></a>
+<a name="id631427"></a>
         <a class="link" href="single_pass_range.html#range.concepts.single_pass_range.valid_expressions">Valid
         expressions</a>
       </h5>
@@ -198,7 +198,7 @@
 </tbody>
 </table></div>
 <a name="range.concepts.single_pass_range.expression_semantics"></a><h5>
-<a name="id2914248"></a>
+<a name="id631746"></a>
         <a class="link" href="single_pass_range.html#range.concepts.single_pass_range.expression_semantics">Expression
         semantics</a>
       </h5>
@@ -266,7 +266,7 @@
 </tbody>
 </table></div>
 <a name="range.concepts.single_pass_range.complexity_guarantees"></a><h5>
-<a name="id2914519"></a>
+<a name="id632003"></a>
         <a class="link" href="single_pass_range.html#range.concepts.single_pass_range.complexity_guarantees">Complexity
         guarantees</a>
       </h5>
@@ -276,7 +276,7 @@
         constant time.
       </p>
 <a name="range.concepts.single_pass_range.invariants"></a><h5>
-<a name="id2914602"></a>
+<a name="id632080"></a>
         <a class="link" href="single_pass_range.html#range.concepts.single_pass_range.invariants">Invariants</a>
       </h5>
 <div class="informaltable"><table class="table">
@@ -316,7 +316,7 @@
 </tbody>
 </table></div>
 <a name="range.concepts.single_pass_range.see_also"></a><h5>
-<a name="id2914873"></a>
+<a name="id632336"></a>
         <a class="link" href="single_pass_range.html#range.concepts.single_pass_range.see_also">See also</a>
       </h5>
 <p>
diff --git a/doc/html/range/examples.html b/doc/html/range/examples.html
index b272df8..f517040 100644
--- a/doc/html/range/examples.html
+++ b/doc/html/range/examples.html
@@ -3,7 +3,7 @@
 <meta http-equiv="Content-Type" content="text/html; charset=US-ASCII">
 <title>Examples</title>
 <link rel="stylesheet" href="../../../../../doc/html/boostbook.css" type="text/css">
-<meta name="generator" content="DocBook XSL Stylesheets V1.75.1">
+<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="../index.html" title="Chapter&#160;1.&#160;Range 2.0">
 <link rel="prev" href="library_headers.html" title="Library Headers">
diff --git a/doc/html/range/faq.html b/doc/html/range/faq.html
index 0c9d40b..a5ea15d 100644
--- a/doc/html/range/faq.html
+++ b/doc/html/range/faq.html
@@ -3,7 +3,7 @@
 <meta http-equiv="Content-Type" content="text/html; charset=US-ASCII">
 <title>FAQ</title>
 <link rel="stylesheet" href="../../../../../doc/html/boostbook.css" type="text/css">
-<meta name="generator" content="DocBook XSL Stylesheets V1.75.1">
+<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="../index.html" title="Chapter&#160;1.&#160;Range 2.0">
 <link rel="prev" href="portability.html" title="Portability">
diff --git a/doc/html/range/history_ack.html b/doc/html/range/history_ack.html
index 930b6b6..2401db3 100644
--- a/doc/html/range/history_ack.html
+++ b/doc/html/range/history_ack.html
@@ -3,7 +3,7 @@
 <meta http-equiv="Content-Type" content="text/html; charset=US-ASCII">
 <title>History and Acknowledgement</title>
 <link rel="stylesheet" href="../../../../../doc/html/boostbook.css" type="text/css">
-<meta name="generator" content="DocBook XSL Stylesheets V1.75.1">
+<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="../index.html" title="Chapter&#160;1.&#160;Range 2.0">
 <link rel="prev" href="faq.html" title="FAQ">
diff --git a/doc/html/range/introduction.html b/doc/html/range/introduction.html
index 8bce31d..e41a60c 100644
--- a/doc/html/range/introduction.html
+++ b/doc/html/range/introduction.html
@@ -3,7 +3,7 @@
 <meta http-equiv="Content-Type" content="text/html; charset=US-ASCII">
 <title>Introduction</title>
 <link rel="stylesheet" href="../../../../../doc/html/boostbook.css" type="text/css">
-<meta name="generator" content="DocBook XSL Stylesheets V1.75.1">
+<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="../index.html" title="Chapter&#160;1.&#160;Range 2.0">
 <link rel="prev" href="../index.html" title="Chapter&#160;1.&#160;Range 2.0">
@@ -50,7 +50,7 @@
       null terminated strings, <code class="computeroutput"><span class="identifier">std</span><span class="special">::</span><span class="identifier">pairs</span></code> of
       iterators, and raw arrays (and more), such that the same generic code can work
       with them all. The basic idea is to add another layer of indirection using
-      <a href="../../../libs/mpl/doc/refmanual/metafunction.html" target="_top">metafunctions</a>
+      <a href="../../../../../libs/mpl/doc/refmanual/metafunction.html" target="_top">metafunctions</a>
       and free-standing functions so syntactic and/or semantic differences can be
       removed.
     </p>
@@ -130,7 +130,7 @@
 <p>
     </p>
 <p>
-      By using the free-standing functions and <a href="../../../libs/mpl/doc/refmanual/metafunction.html" target="_top">metafunctions</a>,
+      By using the free-standing functions and <a href="../../../../../libs/mpl/doc/refmanual/metafunction.html" target="_top">metafunctions</a>,
       the code automatically works for all the types supported by this library; now
       and in the future. Notice that we have to provide two versions of <code class="computeroutput"><span class="identifier">find</span><span class="special">()</span></code> since
       we cannot forward a non-const rvalue with reference arguments (see this article
diff --git a/doc/html/range/library_headers.html b/doc/html/range/library_headers.html
index a5bd095..8f28283 100644
--- a/doc/html/range/library_headers.html
+++ b/doc/html/range/library_headers.html
@@ -3,7 +3,7 @@
 <meta http-equiv="Content-Type" content="text/html; charset=US-ASCII">
 <title>Library Headers</title>
 <link rel="stylesheet" href="../../../../../doc/html/boostbook.css" type="text/css">
-<meta name="generator" content="DocBook XSL Stylesheets V1.75.1">
+<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="../index.html" title="Chapter&#160;1.&#160;Range 2.0">
 <link rel="prev" href="style_guide.html" title="Terminology and style guidelines">
diff --git a/doc/html/range/mfc_atl.html b/doc/html/range/mfc_atl.html
index 8d5ed19..338e860 100644
--- a/doc/html/range/mfc_atl.html
+++ b/doc/html/range/mfc_atl.html
@@ -3,7 +3,7 @@
 <meta http-equiv="Content-Type" content="text/html; charset=US-ASCII">
 <title>MFC/ATL (courtesy of Shunsuke Sogame)</title>
 <link rel="stylesheet" href="../../../../../doc/html/boostbook.css" type="text/css">
-<meta name="generator" content="DocBook XSL Stylesheets V1.75.1">
+<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="../index.html" title="Chapter&#160;1.&#160;Range 2.0">
 <link rel="prev" href="examples.html" title="Examples">
@@ -34,7 +34,7 @@
 <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="id3026958"></a>
+<a name="id739258"></a>
       <a class="link" href="mfc_atl.html#range.mfc_atl.introduction">Introduction</a>
     </h5>
 <p>
@@ -100,7 +100,7 @@
 </tbody>
 </table></div>
 <a name="range.mfc_atl.overview"></a><h5>
-<a name="id3027096"></a>
+<a name="id739392"></a>
       <a class="link" href="mfc_atl.html#range.mfc_atl.overview">Overview</a>
     </h5>
 <p>
diff --git a/doc/html/range/mfc_atl/atl_ranges.html b/doc/html/range/mfc_atl/atl_ranges.html
index 65ee355..766375d 100644
--- a/doc/html/range/mfc_atl/atl_ranges.html
+++ b/doc/html/range/mfc_atl/atl_ranges.html
@@ -3,7 +3,7 @@
 <meta http-equiv="Content-Type" content="text/html; charset=US-ASCII">
 <title>ATL Ranges</title>
 <link rel="stylesheet" href="../../../../../../doc/html/boostbook.css" type="text/css">
-<meta name="generator" content="DocBook XSL Stylesheets V1.75.1">
+<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="../mfc_atl.html" title="MFC/ATL (courtesy of Shunsuke Sogame)">
 <link rel="prev" href="mfc_ranges.html" title="MFC Ranges">
diff --git a/doc/html/range/mfc_atl/const_ranges.html b/doc/html/range/mfc_atl/const_ranges.html
index 2e047f6..222c6d8 100644
--- a/doc/html/range/mfc_atl/const_ranges.html
+++ b/doc/html/range/mfc_atl/const_ranges.html
@@ -3,7 +3,7 @@
 <meta http-equiv="Content-Type" content="text/html; charset=US-ASCII">
 <title>const Ranges</title>
 <link rel="stylesheet" href="../../../../../../doc/html/boostbook.css" type="text/css">
-<meta name="generator" content="DocBook XSL Stylesheets V1.75.1">
+<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="../mfc_atl.html" title="MFC/ATL (courtesy of Shunsuke Sogame)">
 <link rel="prev" href="atl_ranges.html" title="ATL Ranges">
diff --git a/doc/html/range/mfc_atl/mfc_ranges.html b/doc/html/range/mfc_atl/mfc_ranges.html
index af0c6e9..9e6d001 100644
--- a/doc/html/range/mfc_atl/mfc_ranges.html
+++ b/doc/html/range/mfc_atl/mfc_ranges.html
@@ -3,7 +3,7 @@
 <meta http-equiv="Content-Type" content="text/html; charset=US-ASCII">
 <title>MFC Ranges</title>
 <link rel="stylesheet" href="../../../../../../doc/html/boostbook.css" type="text/css">
-<meta name="generator" content="DocBook XSL Stylesheets V1.75.1">
+<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="../mfc_atl.html" title="MFC/ATL (courtesy of Shunsuke Sogame)">
 <link rel="prev" href="requirements.html" title="Requirements">
diff --git a/doc/html/range/mfc_atl/references.html b/doc/html/range/mfc_atl/references.html
index 124a538..8afe82a 100644
--- a/doc/html/range/mfc_atl/references.html
+++ b/doc/html/range/mfc_atl/references.html
@@ -3,7 +3,7 @@
 <meta http-equiv="Content-Type" content="text/html; charset=US-ASCII">
 <title>References</title>
 <link rel="stylesheet" href="../../../../../../doc/html/boostbook.css" type="text/css">
-<meta name="generator" content="DocBook XSL Stylesheets V1.75.1">
+<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="../mfc_atl.html" title="MFC/ATL (courtesy of Shunsuke Sogame)">
 <link rel="prev" href="const_ranges.html" title="const Ranges">
diff --git a/doc/html/range/mfc_atl/requirements.html b/doc/html/range/mfc_atl/requirements.html
index 131433f..c49ac8c 100644
--- a/doc/html/range/mfc_atl/requirements.html
+++ b/doc/html/range/mfc_atl/requirements.html
@@ -3,7 +3,7 @@
 <meta http-equiv="Content-Type" content="text/html; charset=US-ASCII">
 <title>Requirements</title>
 <link rel="stylesheet" href="../../../../../../doc/html/boostbook.css" type="text/css">
-<meta name="generator" content="DocBook XSL Stylesheets V1.75.1">
+<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="../mfc_atl.html" title="MFC/ATL (courtesy of Shunsuke Sogame)">
 <link rel="prev" href="../mfc_atl.html" title="MFC/ATL (courtesy of Shunsuke Sogame)">
diff --git a/doc/html/range/portability.html b/doc/html/range/portability.html
index 901e0b1..63e3621 100644
--- a/doc/html/range/portability.html
+++ b/doc/html/range/portability.html
@@ -3,7 +3,7 @@
 <meta http-equiv="Content-Type" content="text/html; charset=US-ASCII">
 <title>Portability</title>
 <link rel="stylesheet" href="../../../../../doc/html/boostbook.css" type="text/css">
-<meta name="generator" content="DocBook XSL Stylesheets V1.75.1">
+<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="../index.html" title="Chapter&#160;1.&#160;Range 2.0">
 <link rel="prev" href="upgrade/upgrade_from_1_34.html" title="Upgrade from version 1.34">
diff --git a/doc/html/range/reference.html b/doc/html/range/reference.html
index 70c17dc..a76673a 100644
--- a/doc/html/range/reference.html
+++ b/doc/html/range/reference.html
@@ -3,7 +3,7 @@
 <meta http-equiv="Content-Type" content="text/html; charset=US-ASCII">
 <title>Reference</title>
 <link rel="stylesheet" href="../../../../../doc/html/boostbook.css" type="text/css">
-<meta name="generator" content="DocBook XSL Stylesheets V1.75.1">
+<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="../index.html" title="Chapter&#160;1.&#160;Range 2.0">
 <link rel="prev" href="concepts/concept_checking.html" title="Concept Checking">
diff --git a/doc/html/range/reference/adaptors.html b/doc/html/range/reference/adaptors.html
index 5ab0ecd..bc68382 100644
--- a/doc/html/range/reference/adaptors.html
+++ b/doc/html/range/reference/adaptors.html
@@ -3,7 +3,7 @@
 <meta http-equiv="Content-Type" content="text/html; charset=US-ASCII">
 <title>Range Adaptors</title>
 <link rel="stylesheet" href="../../../../../../doc/html/boostbook.css" type="text/css">
-<meta name="generator" content="DocBook XSL Stylesheets V1.75.1">
+<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="../reference.html" title="Reference">
 <link rel="prev" href="semantics/functions.html" title="Functions">
diff --git a/doc/html/range/reference/adaptors/adaptors_general_requirements.html b/doc/html/range/reference/adaptors/adaptors_general_requirements.html
index a815bae..ce2b17b 100644
--- a/doc/html/range/reference/adaptors/adaptors_general_requirements.html
+++ b/doc/html/range/reference/adaptors/adaptors_general_requirements.html
@@ -3,7 +3,7 @@
 <meta http-equiv="Content-Type" content="text/html; charset=US-ASCII">
 <title>General Requirements</title>
 <link rel="stylesheet" href="../../../../../../../doc/html/boostbook.css" type="text/css">
-<meta name="generator" content="DocBook XSL Stylesheets V1.75.1">
+<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="../adaptors.html" title="Range Adaptors">
 <link rel="prev" href="adaptors_synopsis.html" title="Synopsis">
diff --git a/doc/html/range/reference/adaptors/adaptors_introduction.html b/doc/html/range/reference/adaptors/adaptors_introduction.html
index efa54fd..3d61175 100644
--- a/doc/html/range/reference/adaptors/adaptors_introduction.html
+++ b/doc/html/range/reference/adaptors/adaptors_introduction.html
@@ -3,7 +3,7 @@
 <meta http-equiv="Content-Type" content="text/html; charset=US-ASCII">
 <title>Introduction and motivation</title>
 <link rel="stylesheet" href="../../../../../../../doc/html/boostbook.css" type="text/css">
-<meta name="generator" content="DocBook XSL Stylesheets V1.75.1">
+<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="../adaptors.html" title="Range Adaptors">
 <link rel="prev" href="../adaptors.html" title="Range Adaptors">
@@ -122,7 +122,7 @@
           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.adaptors_introduction.composition_of_adaptors"></a><h6>
-<a name="id2924577"></a>
+<a name="id641845"></a>
           <a class="link" href="adaptors_introduction.html#range.reference.adaptors.adaptors_introduction.composition_of_adaptors">Composition
           of Adaptors</a>
         </h6>
@@ -159,7 +159,7 @@
           is the design solution to this problem.
         </p>
 <a name="range.reference.adaptors.adaptors_introduction.range_adaptor_alternative_to_copy_if_algorithm"></a><h6>
-<a name="id2924887"></a>
+<a name="id642142"></a>
           <a class="link" href="adaptors_introduction.html#range.reference.adaptors.adaptors_introduction.range_adaptor_alternative_to_copy_if_algorithm">Range
           Adaptor alternative to copy_if algorithm</a>
         </h6>
@@ -176,7 +176,7 @@
 <p>
         </p>
 <a name="range.reference.adaptors.adaptors_introduction.range_adaptor_alternative_to_count_if_algorithm"></a><h6>
-<a name="id2925056"></a>
+<a name="id642307"></a>
           <a class="link" href="adaptors_introduction.html#range.reference.adaptors.adaptors_introduction.range_adaptor_alternative_to_count_if_algorithm">Range
           Adaptor alternative to count_if algorithm</a>
         </h6>
diff --git a/doc/html/range/reference/adaptors/adaptors_reference.html b/doc/html/range/reference/adaptors/adaptors_reference.html
index d284888..5a3dae6 100644
--- a/doc/html/range/reference/adaptors/adaptors_reference.html
+++ b/doc/html/range/reference/adaptors/adaptors_reference.html
@@ -3,7 +3,7 @@
 <meta http-equiv="Content-Type" content="text/html; charset=US-ASCII">
 <title>Reference</title>
 <link rel="stylesheet" href="../../../../../../../doc/html/boostbook.css" type="text/css">
-<meta name="generator" content="DocBook XSL Stylesheets V1.75.1">
+<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="../adaptors.html" title="Range Adaptors">
 <link rel="prev" href="adaptors_general_requirements.html" title="General Requirements">
diff --git a/doc/html/range/reference/adaptors/adaptors_reference/adjacent_filtered.html b/doc/html/range/reference/adaptors/adaptors_reference/adjacent_filtered.html
index fa763c8..df72e28 100644
--- a/doc/html/range/reference/adaptors/adaptors_reference/adjacent_filtered.html
+++ b/doc/html/range/reference/adaptors/adaptors_reference/adjacent_filtered.html
@@ -3,7 +3,7 @@
 <meta http-equiv="Content-Type" content="text/html; charset=US-ASCII">
 <title>adjacent_filtered</title>
 <link rel="stylesheet" href="../../../../../../../../doc/html/boostbook.css" type="text/css">
-<meta name="generator" content="DocBook XSL Stylesheets V1.75.1">
+<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="../adaptors_reference.html" title="Reference">
 <link rel="prev" href="../adaptors_reference.html" title="Reference">
diff --git a/doc/html/range/reference/adaptors/adaptors_reference/copied.html b/doc/html/range/reference/adaptors/adaptors_reference/copied.html
index 650e29a..b488800 100644
--- a/doc/html/range/reference/adaptors/adaptors_reference/copied.html
+++ b/doc/html/range/reference/adaptors/adaptors_reference/copied.html
@@ -3,7 +3,7 @@
 <meta http-equiv="Content-Type" content="text/html; charset=US-ASCII">
 <title>copied</title>
 <link rel="stylesheet" href="../../../../../../../../doc/html/boostbook.css" type="text/css">
-<meta name="generator" content="DocBook XSL Stylesheets V1.75.1">
+<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="../adaptors_reference.html" title="Reference">
 <link rel="prev" href="adjacent_filtered.html" title="adjacent_filtered">
diff --git a/doc/html/range/reference/adaptors/adaptors_reference/filtered.html b/doc/html/range/reference/adaptors/adaptors_reference/filtered.html
index 1551a9f..04d418d 100644
--- a/doc/html/range/reference/adaptors/adaptors_reference/filtered.html
+++ b/doc/html/range/reference/adaptors/adaptors_reference/filtered.html
@@ -3,7 +3,7 @@
 <meta http-equiv="Content-Type" content="text/html; charset=US-ASCII">
 <title>filtered</title>
 <link rel="stylesheet" href="../../../../../../../../doc/html/boostbook.css" type="text/css">
-<meta name="generator" content="DocBook XSL Stylesheets V1.75.1">
+<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="../adaptors_reference.html" title="Reference">
 <link rel="prev" href="copied.html" title="copied">
diff --git a/doc/html/range/reference/adaptors/adaptors_reference/indexed.html b/doc/html/range/reference/adaptors/adaptors_reference/indexed.html
index d8c8674..03ec01b 100644
--- a/doc/html/range/reference/adaptors/adaptors_reference/indexed.html
+++ b/doc/html/range/reference/adaptors/adaptors_reference/indexed.html
@@ -3,7 +3,7 @@
 <meta http-equiv="Content-Type" content="text/html; charset=US-ASCII">
 <title>indexed</title>
 <link rel="stylesheet" href="../../../../../../../../doc/html/boostbook.css" type="text/css">
-<meta name="generator" content="DocBook XSL Stylesheets V1.75.1">
+<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="../adaptors_reference.html" title="Reference">
 <link rel="prev" href="filtered.html" title="filtered">
diff --git a/doc/html/range/reference/adaptors/adaptors_reference/indirected.html b/doc/html/range/reference/adaptors/adaptors_reference/indirected.html
index adcd57a..391abcc 100644
--- a/doc/html/range/reference/adaptors/adaptors_reference/indirected.html
+++ b/doc/html/range/reference/adaptors/adaptors_reference/indirected.html
@@ -3,7 +3,7 @@
 <meta http-equiv="Content-Type" content="text/html; charset=US-ASCII">
 <title>indirected</title>
 <link rel="stylesheet" href="../../../../../../../../doc/html/boostbook.css" type="text/css">
-<meta name="generator" content="DocBook XSL Stylesheets V1.75.1">
+<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="../adaptors_reference.html" title="Reference">
 <link rel="prev" href="indexed.html" title="indexed">
diff --git a/doc/html/range/reference/adaptors/adaptors_reference/map_keys.html b/doc/html/range/reference/adaptors/adaptors_reference/map_keys.html
index 95c1746..7af39c9 100644
--- a/doc/html/range/reference/adaptors/adaptors_reference/map_keys.html
+++ b/doc/html/range/reference/adaptors/adaptors_reference/map_keys.html
@@ -3,7 +3,7 @@
 <meta http-equiv="Content-Type" content="text/html; charset=US-ASCII">
 <title>map_keys</title>
 <link rel="stylesheet" href="../../../../../../../../doc/html/boostbook.css" type="text/css">
-<meta name="generator" content="DocBook XSL Stylesheets V1.75.1">
+<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="../adaptors_reference.html" title="Reference">
 <link rel="prev" href="indirected.html" title="indirected">
diff --git a/doc/html/range/reference/adaptors/adaptors_reference/map_values.html b/doc/html/range/reference/adaptors/adaptors_reference/map_values.html
index 553a8f3..810ba7a 100644
--- a/doc/html/range/reference/adaptors/adaptors_reference/map_values.html
+++ b/doc/html/range/reference/adaptors/adaptors_reference/map_values.html
@@ -3,7 +3,7 @@
 <meta http-equiv="Content-Type" content="text/html; charset=US-ASCII">
 <title>map_values</title>
 <link rel="stylesheet" href="../../../../../../../../doc/html/boostbook.css" type="text/css">
-<meta name="generator" content="DocBook XSL Stylesheets V1.75.1">
+<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="../adaptors_reference.html" title="Reference">
 <link rel="prev" href="map_keys.html" title="map_keys">
diff --git a/doc/html/range/reference/adaptors/adaptors_reference/replaced.html b/doc/html/range/reference/adaptors/adaptors_reference/replaced.html
index 0990ede..6af8257 100644
--- a/doc/html/range/reference/adaptors/adaptors_reference/replaced.html
+++ b/doc/html/range/reference/adaptors/adaptors_reference/replaced.html
@@ -3,7 +3,7 @@
 <meta http-equiv="Content-Type" content="text/html; charset=US-ASCII">
 <title>replaced</title>
 <link rel="stylesheet" href="../../../../../../../../doc/html/boostbook.css" type="text/css">
-<meta name="generator" content="DocBook XSL Stylesheets V1.75.1">
+<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="../adaptors_reference.html" title="Reference">
 <link rel="prev" href="map_values.html" title="map_values">
diff --git a/doc/html/range/reference/adaptors/adaptors_reference/replaced_if.html b/doc/html/range/reference/adaptors/adaptors_reference/replaced_if.html
index abcf00f..f916472 100644
--- a/doc/html/range/reference/adaptors/adaptors_reference/replaced_if.html
+++ b/doc/html/range/reference/adaptors/adaptors_reference/replaced_if.html
@@ -3,7 +3,7 @@
 <meta http-equiv="Content-Type" content="text/html; charset=US-ASCII">
 <title>replaced_if</title>
 <link rel="stylesheet" href="../../../../../../../../doc/html/boostbook.css" type="text/css">
-<meta name="generator" content="DocBook XSL Stylesheets V1.75.1">
+<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="../adaptors_reference.html" title="Reference">
 <link rel="prev" href="replaced.html" title="replaced">
diff --git a/doc/html/range/reference/adaptors/adaptors_reference/reversed.html b/doc/html/range/reference/adaptors/adaptors_reference/reversed.html
index 52f4cda..2ef6d5d 100644
--- a/doc/html/range/reference/adaptors/adaptors_reference/reversed.html
+++ b/doc/html/range/reference/adaptors/adaptors_reference/reversed.html
@@ -3,7 +3,7 @@
 <meta http-equiv="Content-Type" content="text/html; charset=US-ASCII">
 <title>reversed</title>
 <link rel="stylesheet" href="../../../../../../../../doc/html/boostbook.css" type="text/css">
-<meta name="generator" content="DocBook XSL Stylesheets V1.75.1">
+<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="../adaptors_reference.html" title="Reference">
 <link rel="prev" href="replaced_if.html" title="replaced_if">
diff --git a/doc/html/range/reference/adaptors/adaptors_reference/sliced.html b/doc/html/range/reference/adaptors/adaptors_reference/sliced.html
index 9793092..8901fa0 100644
--- a/doc/html/range/reference/adaptors/adaptors_reference/sliced.html
+++ b/doc/html/range/reference/adaptors/adaptors_reference/sliced.html
@@ -3,7 +3,7 @@
 <meta http-equiv="Content-Type" content="text/html; charset=US-ASCII">
 <title>sliced</title>
 <link rel="stylesheet" href="../../../../../../../../doc/html/boostbook.css" type="text/css">
-<meta name="generator" content="DocBook XSL Stylesheets V1.75.1">
+<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="../adaptors_reference.html" title="Reference">
 <link rel="prev" href="reversed.html" title="reversed">
diff --git a/doc/html/range/reference/adaptors/adaptors_reference/strided.html b/doc/html/range/reference/adaptors/adaptors_reference/strided.html
index 6fcc281..ca37e60 100644
--- a/doc/html/range/reference/adaptors/adaptors_reference/strided.html
+++ b/doc/html/range/reference/adaptors/adaptors_reference/strided.html
@@ -3,7 +3,7 @@
 <meta http-equiv="Content-Type" content="text/html; charset=US-ASCII">
 <title>strided</title>
 <link rel="stylesheet" href="../../../../../../../../doc/html/boostbook.css" type="text/css">
-<meta name="generator" content="DocBook XSL Stylesheets V1.75.1">
+<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="../adaptors_reference.html" title="Reference">
 <link rel="prev" href="sliced.html" title="sliced">
diff --git a/doc/html/range/reference/adaptors/adaptors_reference/tokenized.html b/doc/html/range/reference/adaptors/adaptors_reference/tokenized.html
index fc4bc42..0b294b2 100644
--- a/doc/html/range/reference/adaptors/adaptors_reference/tokenized.html
+++ b/doc/html/range/reference/adaptors/adaptors_reference/tokenized.html
@@ -3,7 +3,7 @@
 <meta http-equiv="Content-Type" content="text/html; charset=US-ASCII">
 <title>tokenized</title>
 <link rel="stylesheet" href="../../../../../../../../doc/html/boostbook.css" type="text/css">
-<meta name="generator" content="DocBook XSL Stylesheets V1.75.1">
+<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="../adaptors_reference.html" title="Reference">
 <link rel="prev" href="strided.html" title="strided">
diff --git a/doc/html/range/reference/adaptors/adaptors_reference/transformed.html b/doc/html/range/reference/adaptors/adaptors_reference/transformed.html
index 56a6170..1947b6d 100644
--- a/doc/html/range/reference/adaptors/adaptors_reference/transformed.html
+++ b/doc/html/range/reference/adaptors/adaptors_reference/transformed.html
@@ -3,7 +3,7 @@
 <meta http-equiv="Content-Type" content="text/html; charset=US-ASCII">
 <title>transformed</title>
 <link rel="stylesheet" href="../../../../../../../../doc/html/boostbook.css" type="text/css">
-<meta name="generator" content="DocBook XSL Stylesheets V1.75.1">
+<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="../adaptors_reference.html" title="Reference">
 <link rel="prev" href="tokenized.html" title="tokenized">
diff --git a/doc/html/range/reference/adaptors/adaptors_reference/uniqued.html b/doc/html/range/reference/adaptors/adaptors_reference/uniqued.html
index 3b314ab..1f7d9fb 100644
--- a/doc/html/range/reference/adaptors/adaptors_reference/uniqued.html
+++ b/doc/html/range/reference/adaptors/adaptors_reference/uniqued.html
@@ -3,7 +3,7 @@
 <meta http-equiv="Content-Type" content="text/html; charset=US-ASCII">
 <title>uniqued</title>
 <link rel="stylesheet" href="../../../../../../../../doc/html/boostbook.css" type="text/css">
-<meta name="generator" content="DocBook XSL Stylesheets V1.75.1">
+<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="../adaptors_reference.html" title="Reference">
 <link rel="prev" href="transformed.html" title="transformed">
diff --git a/doc/html/range/reference/adaptors/adaptors_synopsis.html b/doc/html/range/reference/adaptors/adaptors_synopsis.html
index d0fea59..202a114 100644
--- a/doc/html/range/reference/adaptors/adaptors_synopsis.html
+++ b/doc/html/range/reference/adaptors/adaptors_synopsis.html
@@ -3,7 +3,7 @@
 <meta http-equiv="Content-Type" content="text/html; charset=US-ASCII">
 <title>Synopsis</title>
 <link rel="stylesheet" href="../../../../../../../doc/html/boostbook.css" type="text/css">
-<meta name="generator" content="DocBook XSL Stylesheets V1.75.1">
+<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="../adaptors.html" title="Range Adaptors">
 <link rel="prev" href="adaptors_introduction.html" title="Introduction and motivation">
diff --git a/doc/html/range/reference/algorithms.html b/doc/html/range/reference/algorithms.html
index fc70d02..99e1dad 100644
--- a/doc/html/range/reference/algorithms.html
+++ b/doc/html/range/reference/algorithms.html
@@ -3,7 +3,7 @@
 <meta http-equiv="Content-Type" content="text/html; charset=US-ASCII">
 <title>Range Algorithm</title>
 <link rel="stylesheet" href="../../../../../../doc/html/boostbook.css" type="text/css">
-<meta name="generator" content="DocBook XSL Stylesheets V1.75.1">
+<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="../reference.html" title="Reference">
 <link rel="prev" href="adaptors/adaptors_reference/uniqued.html" title="uniqued">
diff --git a/doc/html/range/reference/algorithms/heap_algorithms.html b/doc/html/range/reference/algorithms/heap_algorithms.html
index 25c45e4..2cdbaaa 100644
--- a/doc/html/range/reference/algorithms/heap_algorithms.html
+++ b/doc/html/range/reference/algorithms/heap_algorithms.html
@@ -3,7 +3,7 @@
 <meta http-equiv="Content-Type" content="text/html; charset=US-ASCII">
 <title>Heap algorithms</title>
 <link rel="stylesheet" href="../../../../../../../doc/html/boostbook.css" type="text/css">
-<meta name="generator" content="DocBook XSL Stylesheets V1.75.1">
+<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="../algorithms.html" title="Range Algorithm">
 <link rel="prev" href="set_algorithms/set_symmetric_difference.html" title="set_symmetric_difference">
diff --git a/doc/html/range/reference/algorithms/heap_algorithms/make_heap.html b/doc/html/range/reference/algorithms/heap_algorithms/make_heap.html
index d8d4033..083df4a 100644
--- a/doc/html/range/reference/algorithms/heap_algorithms/make_heap.html
+++ b/doc/html/range/reference/algorithms/heap_algorithms/make_heap.html
@@ -3,7 +3,7 @@
 <meta http-equiv="Content-Type" content="text/html; charset=US-ASCII">
 <title>make_heap</title>
 <link rel="stylesheet" href="../../../../../../../../doc/html/boostbook.css" type="text/css">
-<meta name="generator" content="DocBook XSL Stylesheets V1.75.1">
+<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="../heap_algorithms.html" title="Heap algorithms">
 <link rel="prev" href="pop_heap.html" title="pop_heap">
@@ -28,7 +28,7 @@
           make_heap</a>
 </h5></div></div></div>
 <a name="range.reference.algorithms.heap_algorithms.make_heap.prototype"></a><h6>
-<a name="id2999078"></a>
+<a name="id711672"></a>
             <a class="link" href="make_heap.html#range.reference.algorithms.heap_algorithms.make_heap.prototype">Prototype</a>
           </h6>
 <p>
@@ -49,7 +49,7 @@
 <p>
           </p>
 <a name="range.reference.algorithms.heap_algorithms.make_heap.description"></a><h6>
-<a name="id2999429"></a>
+<a name="id712018"></a>
             <a class="link" href="make_heap.html#range.reference.algorithms.heap_algorithms.make_heap.description">Description</a>
           </h6>
 <p>
@@ -61,14 +61,14 @@
             the predicate versions.
           </p>
 <a name="range.reference.algorithms.heap_algorithms.make_heap.definition"></a><h6>
-<a name="id2999509"></a>
+<a name="id712093"></a>
             <a class="link" href="make_heap.html#range.reference.algorithms.heap_algorithms.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_algorithms.make_heap.requirements"></a><h6>
-<a name="id2999583"></a>
+<a name="id712163"></a>
             <a class="link" href="make_heap.html#range.reference.algorithms.heap_algorithms.make_heap.requirements">Requirements</a>
           </h6>
 <p>
@@ -119,7 +119,7 @@
             </li>
 </ul></div>
 <a name="range.reference.algorithms.heap_algorithms.make_heap.complexity"></a><h6>
-<a name="id2999819"></a>
+<a name="id712385"></a>
             <a class="link" href="make_heap.html#range.reference.algorithms.heap_algorithms.make_heap.complexity">Complexity</a>
           </h6>
 <p>
diff --git a/doc/html/range/reference/algorithms/heap_algorithms/pop_heap.html b/doc/html/range/reference/algorithms/heap_algorithms/pop_heap.html
index f1588b7..2e45c55 100644
--- a/doc/html/range/reference/algorithms/heap_algorithms/pop_heap.html
+++ b/doc/html/range/reference/algorithms/heap_algorithms/pop_heap.html
@@ -3,7 +3,7 @@
 <meta http-equiv="Content-Type" content="text/html; charset=US-ASCII">
 <title>pop_heap</title>
 <link rel="stylesheet" href="../../../../../../../../doc/html/boostbook.css" type="text/css">
-<meta name="generator" content="DocBook XSL Stylesheets V1.75.1">
+<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="../heap_algorithms.html" title="Heap algorithms">
 <link rel="prev" href="push_heap.html" title="push_heap">
@@ -28,7 +28,7 @@
           pop_heap</a>
 </h5></div></div></div>
 <a name="range.reference.algorithms.heap_algorithms.pop_heap.prototype"></a><h6>
-<a name="id2998100"></a>
+<a name="id710726"></a>
             <a class="link" href="pop_heap.html#range.reference.algorithms.heap_algorithms.pop_heap.prototype">Prototype</a>
           </h6>
 <p>
@@ -49,7 +49,7 @@
 <p>
           </p>
 <a name="range.reference.algorithms.heap_algorithms.pop_heap.description"></a><h6>
-<a name="id2998449"></a>
+<a name="id711072"></a>
             <a class="link" href="pop_heap.html#range.reference.algorithms.heap_algorithms.pop_heap.description">Description</a>
           </h6>
 <p>
@@ -63,14 +63,14 @@
             the predicate versions.
           </p>
 <a name="range.reference.algorithms.heap_algorithms.pop_heap.definition"></a><h6>
-<a name="id2998609"></a>
+<a name="id711226"></a>
             <a class="link" href="pop_heap.html#range.reference.algorithms.heap_algorithms.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_algorithms.pop_heap.requirements"></a><h6>
-<a name="id2998681"></a>
+<a name="id711296"></a>
             <a class="link" href="pop_heap.html#range.reference.algorithms.heap_algorithms.pop_heap.requirements">Requirements</a>
           </h6>
 <p>
@@ -121,7 +121,7 @@
             </li>
 </ul></div>
 <a name="range.reference.algorithms.heap_algorithms.pop_heap.precondition_"></a><h6>
-<a name="id2998918"></a>
+<a name="id711519"></a>
             <a class="link" href="pop_heap.html#range.reference.algorithms.heap_algorithms.pop_heap.precondition_">Precondition:</a>
           </h6>
 <div class="itemizedlist"><ul class="itemizedlist" type="disc">
@@ -131,7 +131,7 @@
             </li>
 </ul></div>
 <a name="range.reference.algorithms.heap_algorithms.pop_heap.complexity"></a><h6>
-<a name="id2998989"></a>
+<a name="id711588"></a>
             <a class="link" href="pop_heap.html#range.reference.algorithms.heap_algorithms.pop_heap.complexity">Complexity</a>
           </h6>
 <p>
diff --git a/doc/html/range/reference/algorithms/heap_algorithms/push_heap.html b/doc/html/range/reference/algorithms/heap_algorithms/push_heap.html
index 35b64ca..9bcf219 100644
--- a/doc/html/range/reference/algorithms/heap_algorithms/push_heap.html
+++ b/doc/html/range/reference/algorithms/heap_algorithms/push_heap.html
@@ -3,7 +3,7 @@
 <meta http-equiv="Content-Type" content="text/html; charset=US-ASCII">
 <title>push_heap</title>
 <link rel="stylesheet" href="../../../../../../../../doc/html/boostbook.css" type="text/css">
-<meta name="generator" content="DocBook XSL Stylesheets V1.75.1">
+<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="../heap_algorithms.html" title="Heap algorithms">
 <link rel="prev" href="../heap_algorithms.html" title="Heap algorithms">
@@ -28,7 +28,7 @@
           push_heap</a>
 </h5></div></div></div>
 <a name="range.reference.algorithms.heap_algorithms.push_heap.prototype"></a><h6>
-<a name="id2997080"></a>
+<a name="id709740"></a>
             <a class="link" href="push_heap.html#range.reference.algorithms.heap_algorithms.push_heap.prototype">Prototype</a>
           </h6>
 <p>
@@ -49,7 +49,7 @@
 <p>
           </p>
 <a name="range.reference.algorithms.heap_algorithms.push_heap.description"></a><h6>
-<a name="id2997430"></a>
+<a name="id710087"></a>
             <a class="link" href="push_heap.html#range.reference.algorithms.heap_algorithms.push_heap.description">Description</a>
           </h6>
 <p>
@@ -63,14 +63,14 @@
             the predicate versions.
           </p>
 <a name="range.reference.algorithms.heap_algorithms.push_heap.definition"></a><h6>
-<a name="id2997595"></a>
+<a name="id710246"></a>
             <a class="link" href="push_heap.html#range.reference.algorithms.heap_algorithms.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_algorithms.push_heap.requirements"></a><h6>
-<a name="id2997669"></a>
+<a name="id710316"></a>
             <a class="link" href="push_heap.html#range.reference.algorithms.heap_algorithms.push_heap.requirements">Requirements</a>
           </h6>
 <p>
@@ -121,7 +121,7 @@
             </li>
 </ul></div>
 <a name="range.reference.algorithms.heap_algorithms.push_heap.precondition_"></a><h6>
-<a name="id2997905"></a>
+<a name="id710538"></a>
             <a class="link" href="push_heap.html#range.reference.algorithms.heap_algorithms.push_heap.precondition_">Precondition:</a>
           </h6>
 <div class="itemizedlist"><ul class="itemizedlist" type="disc">
@@ -131,7 +131,7 @@
             </li>
 </ul></div>
 <a name="range.reference.algorithms.heap_algorithms.push_heap.complexity"></a><h6>
-<a name="id2998022"></a>
+<a name="id710652"></a>
             <a class="link" href="push_heap.html#range.reference.algorithms.heap_algorithms.push_heap.complexity">Complexity</a>
           </h6>
 <p>
diff --git a/doc/html/range/reference/algorithms/permutation_algorithms.html b/doc/html/range/reference/algorithms/permutation_algorithms.html
index 12e33f9..a9e2392 100644
--- a/doc/html/range/reference/algorithms/permutation_algorithms.html
+++ b/doc/html/range/reference/algorithms/permutation_algorithms.html
@@ -3,7 +3,7 @@
 <meta http-equiv="Content-Type" content="text/html; charset=US-ASCII">
 <title>Permutation algorithms</title>
 <link rel="stylesheet" href="../../../../../../../doc/html/boostbook.css" type="text/css">
-<meta name="generator" content="DocBook XSL Stylesheets V1.75.1">
+<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="../algorithms.html" title="Range Algorithm">
 <link rel="prev" href="heap_algorithms/make_heap.html" title="make_heap">
diff --git a/doc/html/range/reference/algorithms/permutation_algorithms/next_permutation.html b/doc/html/range/reference/algorithms/permutation_algorithms/next_permutation.html
index 8521343..0a212cf 100644
--- a/doc/html/range/reference/algorithms/permutation_algorithms/next_permutation.html
+++ b/doc/html/range/reference/algorithms/permutation_algorithms/next_permutation.html
@@ -3,7 +3,7 @@
 <meta http-equiv="Content-Type" content="text/html; charset=US-ASCII">
 <title>next_permutation</title>
 <link rel="stylesheet" href="../../../../../../../../doc/html/boostbook.css" type="text/css">
-<meta name="generator" content="DocBook XSL Stylesheets V1.75.1">
+<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="../permutation_algorithms.html" title="Permutation algorithms">
 <link rel="prev" href="../permutation_algorithms.html" title="Permutation algorithms">
@@ -28,7 +28,7 @@
           next_permutation</a>
 </h5></div></div></div>
 <a name="range.reference.algorithms.permutation_algorithms.next_permutation.prototype"></a><h6>
-<a name="id2999919"></a>
+<a name="id712479"></a>
             <a class="link" href="next_permutation.html#range.reference.algorithms.permutation_algorithms.next_permutation.prototype">Prototype</a>
           </h6>
 <p>
@@ -49,7 +49,7 @@
 <p>
           </p>
 <a name="range.reference.algorithms.permutation_algorithms.next_permutation.description"></a><h6>
-<a name="id3000271"></a>
+<a name="id712826"></a>
             <a class="link" href="next_permutation.html#range.reference.algorithms.permutation_algorithms.next_permutation.description">Description</a>
           </h6>
 <p>
@@ -67,14 +67,14 @@
             the predicate versions.
           </p>
 <a name="range.reference.algorithms.permutation_algorithms.next_permutation.definition"></a><h6>
-<a name="id3000379"></a>
+<a name="id712925"></a>
             <a class="link" href="next_permutation.html#range.reference.algorithms.permutation_algorithms.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_algorithms.next_permutation.requirements"></a><h6>
-<a name="id3000453"></a>
+<a name="id712995"></a>
             <a class="link" href="next_permutation.html#range.reference.algorithms.permutation_algorithms.next_permutation.requirements">Requirements</a>
           </h6>
 <p>
@@ -125,7 +125,7 @@
             </li>
 </ul></div>
 <a name="range.reference.algorithms.permutation_algorithms.next_permutation.complexity"></a><h6>
-<a name="id3000690"></a>
+<a name="id713217"></a>
             <a class="link" href="next_permutation.html#range.reference.algorithms.permutation_algorithms.next_permutation.complexity">Complexity</a>
           </h6>
 <p>
diff --git a/doc/html/range/reference/algorithms/permutation_algorithms/prev_permutation.html b/doc/html/range/reference/algorithms/permutation_algorithms/prev_permutation.html
index a1e0d1d..06b9d1d 100644
--- a/doc/html/range/reference/algorithms/permutation_algorithms/prev_permutation.html
+++ b/doc/html/range/reference/algorithms/permutation_algorithms/prev_permutation.html
@@ -3,7 +3,7 @@
 <meta http-equiv="Content-Type" content="text/html; charset=US-ASCII">
 <title>prev_permutation</title>
 <link rel="stylesheet" href="../../../../../../../../doc/html/boostbook.css" type="text/css">
-<meta name="generator" content="DocBook XSL Stylesheets V1.75.1">
+<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="../permutation_algorithms.html" title="Permutation algorithms">
 <link rel="prev" href="next_permutation.html" title="next_permutation">
@@ -28,7 +28,7 @@
           prev_permutation</a>
 </h5></div></div></div>
 <a name="range.reference.algorithms.permutation_algorithms.prev_permutation.prototype"></a><h6>
-<a name="id3000774"></a>
+<a name="id713296"></a>
             <a class="link" href="prev_permutation.html#range.reference.algorithms.permutation_algorithms.prev_permutation.prototype">Prototype</a>
           </h6>
 <p>
@@ -49,7 +49,7 @@
 <p>
           </p>
 <a name="range.reference.algorithms.permutation_algorithms.prev_permutation.description"></a><h6>
-<a name="id3001123"></a>
+<a name="id713642"></a>
             <a class="link" href="prev_permutation.html#range.reference.algorithms.permutation_algorithms.prev_permutation.description">Description</a>
           </h6>
 <p>
@@ -67,14 +67,14 @@
             the predicate versions.
           </p>
 <a name="range.reference.algorithms.permutation_algorithms.prev_permutation.definition"></a><h6>
-<a name="id3001233"></a>
+<a name="id713741"></a>
             <a class="link" href="prev_permutation.html#range.reference.algorithms.permutation_algorithms.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_algorithms.prev_permutation.requirements"></a><h6>
-<a name="id3001308"></a>
+<a name="id713812"></a>
             <a class="link" href="prev_permutation.html#range.reference.algorithms.permutation_algorithms.prev_permutation.requirements">Requirements</a>
           </h6>
 <p>
@@ -125,7 +125,7 @@
             </li>
 </ul></div>
 <a name="range.reference.algorithms.permutation_algorithms.prev_permutation.complexity"></a><h6>
-<a name="id3001544"></a>
+<a name="id714034"></a>
             <a class="link" href="prev_permutation.html#range.reference.algorithms.permutation_algorithms.prev_permutation.complexity">Complexity</a>
           </h6>
 <p>
diff --git a/doc/html/range/reference/algorithms/range_algorithm_introduction.html b/doc/html/range/reference/algorithms/range_algorithm_introduction.html
index 9f15ed5..f0aa6c4 100644
--- a/doc/html/range/reference/algorithms/range_algorithm_introduction.html
+++ b/doc/html/range/reference/algorithms/range_algorithm_introduction.html
@@ -3,7 +3,7 @@
 <meta http-equiv="Content-Type" content="text/html; charset=US-ASCII">
 <title>Introduction and motivation</title>
 <link rel="stylesheet" href="../../../../../../../doc/html/boostbook.css" type="text/css">
-<meta name="generator" content="DocBook XSL Stylesheets V1.75.1">
+<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="../algorithms.html" title="Range Algorithm">
 <link rel="prev" href="../algorithms.html" title="Range Algorithm">
diff --git a/doc/html/range/reference/algorithms/range_algorithm_mutating_algorithms.html b/doc/html/range/reference/algorithms/range_algorithm_mutating_algorithms.html
index 80710b0..fcd52d1 100644
--- a/doc/html/range/reference/algorithms/range_algorithm_mutating_algorithms.html
+++ b/doc/html/range/reference/algorithms/range_algorithm_mutating_algorithms.html
@@ -3,7 +3,7 @@
 <meta http-equiv="Content-Type" content="text/html; charset=US-ASCII">
 <title>Mutating algorithms</title>
 <link rel="stylesheet" href="../../../../../../../doc/html/boostbook.css" type="text/css">
-<meta name="generator" content="DocBook XSL Stylesheets V1.75.1">
+<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="../algorithms.html" title="Range Algorithm">
 <link rel="prev" href="range_algorithm_introduction.html" title="Introduction and motivation">
diff --git a/doc/html/range/reference/algorithms/range_algorithm_mutating_algorithms/copy.html b/doc/html/range/reference/algorithms/range_algorithm_mutating_algorithms/copy.html
index 0decd23..e88c627 100644
--- a/doc/html/range/reference/algorithms/range_algorithm_mutating_algorithms/copy.html
+++ b/doc/html/range/reference/algorithms/range_algorithm_mutating_algorithms/copy.html
@@ -3,7 +3,7 @@
 <meta http-equiv="Content-Type" content="text/html; charset=US-ASCII">
 <title>Range Algorithm - copy</title>
 <link rel="stylesheet" href="../../../../../../../../doc/html/boostbook.css" type="text/css">
-<meta name="generator" content="DocBook XSL Stylesheets V1.75.1">
+<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="../range_algorithm_mutating_algorithms.html" title="Mutating algorithms">
 <link rel="prev" href="../range_algorithm_mutating_algorithms.html" title="Mutating algorithms">
@@ -28,7 +28,7 @@
           Range Algorithm - copy</a>
 </h5></div></div></div>
 <a name="range.reference.algorithms.range_algorithm_mutating_algorithms.copy.prototype"></a><h6>
-<a name="id2946077"></a>
+<a name="id663029"></a>
             <a class="link" href="copy.html#range.reference.algorithms.range_algorithm_mutating_algorithms.copy.prototype">Prototype</a>
           </h6>
 <p>
@@ -40,7 +40,7 @@
 <p>
           </p>
 <a name="range.reference.algorithms.range_algorithm_mutating_algorithms.copy.description"></a><h6>
-<a name="id2946209"></a>
+<a name="id663156"></a>
             <a class="link" href="copy.html#range.reference.algorithms.range_algorithm_mutating_algorithms.copy.description">Description</a>
           </h6>
 <p>
@@ -51,14 +51,14 @@
             <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.range_algorithm_mutating_algorithms.copy.definition"></a><h6>
-<a name="id2946343"></a>
+<a name="id663286"></a>
             <a class="link" href="copy.html#range.reference.algorithms.range_algorithm_mutating_algorithms.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.range_algorithm_mutating_algorithms.copy.requirements"></a><h6>
-<a name="id2946418"></a>
+<a name="id663356"></a>
             <a class="link" href="copy.html#range.reference.algorithms.range_algorithm_mutating_algorithms.copy.requirements">Requirements</a>
           </h6>
 <div class="itemizedlist"><ul class="itemizedlist" type="disc">
@@ -79,7 +79,7 @@
             </li>
 </ul></div>
 <a name="range.reference.algorithms.range_algorithm_mutating_algorithms.copy.precondition_"></a><h6>
-<a name="id2946528"></a>
+<a name="id663457"></a>
             <a class="link" href="copy.html#range.reference.algorithms.range_algorithm_mutating_algorithms.copy.precondition_">Precondition:</a>
           </h6>
 <div class="itemizedlist"><ul class="itemizedlist" type="disc">
@@ -93,7 +93,7 @@
             </li>
 </ul></div>
 <a name="range.reference.algorithms.range_algorithm_mutating_algorithms.copy.complexity"></a><h6>
-<a name="id2946635"></a>
+<a name="id663558"></a>
             <a class="link" href="copy.html#range.reference.algorithms.range_algorithm_mutating_algorithms.copy.complexity">Complexity</a>
           </h6>
 <p>
diff --git a/doc/html/range/reference/algorithms/range_algorithm_mutating_algorithms/copy_backward.html b/doc/html/range/reference/algorithms/range_algorithm_mutating_algorithms/copy_backward.html
index 541db9a..14d13c6 100644
--- a/doc/html/range/reference/algorithms/range_algorithm_mutating_algorithms/copy_backward.html
+++ b/doc/html/range/reference/algorithms/range_algorithm_mutating_algorithms/copy_backward.html
@@ -3,7 +3,7 @@
 <meta http-equiv="Content-Type" content="text/html; charset=US-ASCII">
 <title>Range Algorithm - copy_backward</title>
 <link rel="stylesheet" href="../../../../../../../../doc/html/boostbook.css" type="text/css">
-<meta name="generator" content="DocBook XSL Stylesheets V1.75.1">
+<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="../range_algorithm_mutating_algorithms.html" title="Mutating algorithms">
 <link rel="prev" href="copy.html" title="Range Algorithm - copy">
@@ -28,7 +28,7 @@
           Range Algorithm - copy_backward</a>
 </h5></div></div></div>
 <a name="range.reference.algorithms.range_algorithm_mutating_algorithms.copy_backward.prototype"></a><h6>
-<a name="id2946707"></a>
+<a name="id663623"></a>
             <a class="link" href="copy_backward.html#range.reference.algorithms.range_algorithm_mutating_algorithms.copy_backward.prototype">Prototype</a>
           </h6>
 <p>
@@ -42,7 +42,7 @@
 <p>
           </p>
 <a name="range.reference.algorithms.range_algorithm_mutating_algorithms.copy_backward.description"></a><h6>
-<a name="id2946840"></a>
+<a name="id663752"></a>
             <a class="link" href="copy_backward.html#range.reference.algorithms.range_algorithm_mutating_algorithms.copy_backward.description">Description</a>
           </h6>
 <p>
@@ -60,14 +60,14 @@
             denotes the <span class="bold"><strong>end</strong></span> of the output sequence.
           </p>
 <a name="range.reference.algorithms.range_algorithm_mutating_algorithms.copy_backward.definition"></a><h6>
-<a name="id2947001"></a>
+<a name="id663905"></a>
             <a class="link" href="copy_backward.html#range.reference.algorithms.range_algorithm_mutating_algorithms.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.range_algorithm_mutating_algorithms.copy_backward.requirements"></a><h6>
-<a name="id2947075"></a>
+<a name="id663975"></a>
             <a class="link" href="copy_backward.html#range.reference.algorithms.range_algorithm_mutating_algorithms.copy_backward.requirements">Requirements</a>
           </h6>
 <div class="itemizedlist"><ul class="itemizedlist" type="disc">
@@ -88,7 +88,7 @@
             </li>
 </ul></div>
 <a name="range.reference.algorithms.range_algorithm_mutating_algorithms.copy_backward.precondition_"></a><h6>
-<a name="id2947186"></a>
+<a name="id664078"></a>
             <a class="link" href="copy_backward.html#range.reference.algorithms.range_algorithm_mutating_algorithms.copy_backward.precondition_">Precondition:</a>
           </h6>
 <div class="itemizedlist"><ul class="itemizedlist" type="disc">
@@ -102,7 +102,7 @@
             </li>
 </ul></div>
 <a name="range.reference.algorithms.range_algorithm_mutating_algorithms.copy_backward.complexity"></a><h6>
-<a name="id2947292"></a>
+<a name="id664178"></a>
             <a class="link" href="copy_backward.html#range.reference.algorithms.range_algorithm_mutating_algorithms.copy_backward.complexity">Complexity</a>
           </h6>
 <p>
diff --git a/doc/html/range/reference/algorithms/range_algorithm_mutating_algorithms/fill.html b/doc/html/range/reference/algorithms/range_algorithm_mutating_algorithms/fill.html
index 4bb5340..f28518c 100644
--- a/doc/html/range/reference/algorithms/range_algorithm_mutating_algorithms/fill.html
+++ b/doc/html/range/reference/algorithms/range_algorithm_mutating_algorithms/fill.html
@@ -3,7 +3,7 @@
 <meta http-equiv="Content-Type" content="text/html; charset=US-ASCII">
 <title>Range Algorithm - fill</title>
 <link rel="stylesheet" href="../../../../../../../../doc/html/boostbook.css" type="text/css">
-<meta name="generator" content="DocBook XSL Stylesheets V1.75.1">
+<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="../range_algorithm_mutating_algorithms.html" title="Mutating algorithms">
 <link rel="prev" href="copy_backward.html" title="Range Algorithm - copy_backward">
@@ -28,7 +28,7 @@
           Range Algorithm - fill</a>
 </h5></div></div></div>
 <a name="range.reference.algorithms.range_algorithm_mutating_algorithms.fill.prototype"></a><h6>
-<a name="id2947365"></a>
+<a name="id664244"></a>
             <a class="link" href="fill.html#range.reference.algorithms.range_algorithm_mutating_algorithms.fill.prototype">Prototype</a>
           </h6>
 <p>
@@ -43,7 +43,7 @@
 <p>
           </p>
 <a name="range.reference.algorithms.range_algorithm_mutating_algorithms.fill.description"></a><h6>
-<a name="id2947614"></a>
+<a name="id664488"></a>
             <a class="link" href="fill.html#range.reference.algorithms.range_algorithm_mutating_algorithms.fill.description">Description</a>
           </h6>
 <p>
@@ -52,14 +52,14 @@
             in the range <code class="computeroutput"><span class="identifier">rng</span></code>.
           </p>
 <a name="range.reference.algorithms.range_algorithm_mutating_algorithms.fill.definition"></a><h6>
-<a name="id2947673"></a>
+<a name="id664544"></a>
             <a class="link" href="fill.html#range.reference.algorithms.range_algorithm_mutating_algorithms.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.range_algorithm_mutating_algorithms.fill.requirements"></a><h6>
-<a name="id2947747"></a>
+<a name="id664614"></a>
             <a class="link" href="fill.html#range.reference.algorithms.range_algorithm_mutating_algorithms.fill.requirements">Requirements</a>
           </h6>
 <div class="itemizedlist"><ul class="itemizedlist" type="disc">
@@ -82,7 +82,7 @@
             </li>
 </ul></div>
 <a name="range.reference.algorithms.range_algorithm_mutating_algorithms.fill.complexity"></a><h6>
-<a name="id2947862"></a>
+<a name="id664723"></a>
             <a class="link" href="fill.html#range.reference.algorithms.range_algorithm_mutating_algorithms.fill.complexity">Complexity</a>
           </h6>
 <p>
diff --git a/doc/html/range/reference/algorithms/range_algorithm_mutating_algorithms/generate.html b/doc/html/range/reference/algorithms/range_algorithm_mutating_algorithms/generate.html
index 1a5ba8a..68efa6a 100644
--- a/doc/html/range/reference/algorithms/range_algorithm_mutating_algorithms/generate.html
+++ b/doc/html/range/reference/algorithms/range_algorithm_mutating_algorithms/generate.html
@@ -3,7 +3,7 @@
 <meta http-equiv="Content-Type" content="text/html; charset=US-ASCII">
 <title>Range Algorithm - generate</title>
 <link rel="stylesheet" href="../../../../../../../../doc/html/boostbook.css" type="text/css">
-<meta name="generator" content="DocBook XSL Stylesheets V1.75.1">
+<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="../range_algorithm_mutating_algorithms.html" title="Mutating algorithms">
 <link rel="prev" href="fill.html" title="Range Algorithm - fill">
@@ -28,7 +28,7 @@
           Range Algorithm - generate</a>
 </h5></div></div></div>
 <a name="range.reference.algorithms.range_algorithm_mutating_algorithms.generate.prototype"></a><h6>
-<a name="id2947933"></a>
+<a name="id664786"></a>
             <a class="link" href="generate.html#range.reference.algorithms.range_algorithm_mutating_algorithms.generate.prototype">Prototype</a>
           </h6>
 <p>
@@ -43,7 +43,7 @@
 <p>
           </p>
 <a name="range.reference.algorithms.range_algorithm_mutating_algorithms.generate.description"></a><h6>
-<a name="id2948176"></a>
+<a name="id665026"></a>
             <a class="link" href="generate.html#range.reference.algorithms.range_algorithm_mutating_algorithms.generate.description">Description</a>
           </h6>
 <p>
@@ -53,14 +53,14 @@
             Returns the resultant range.
           </p>
 <a name="range.reference.algorithms.range_algorithm_mutating_algorithms.generate.definition"></a><h6>
-<a name="id2948241"></a>
+<a name="id665086"></a>
             <a class="link" href="generate.html#range.reference.algorithms.range_algorithm_mutating_algorithms.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.range_algorithm_mutating_algorithms.generate.requirements"></a><h6>
-<a name="id2948315"></a>
+<a name="id665155"></a>
             <a class="link" href="generate.html#range.reference.algorithms.range_algorithm_mutating_algorithms.generate.requirements">Requirements</a>
           </h6>
 <div class="itemizedlist"><ul class="itemizedlist" type="disc">
@@ -84,7 +84,7 @@
             </li>
 </ul></div>
 <a name="range.reference.algorithms.range_algorithm_mutating_algorithms.generate.precondition_"></a><h6>
-<a name="id2948442"></a>
+<a name="id665273"></a>
             <a class="link" href="generate.html#range.reference.algorithms.range_algorithm_mutating_algorithms.generate.precondition_">Precondition:</a>
           </h6>
 <div class="itemizedlist"><ul class="itemizedlist" type="disc">
@@ -98,7 +98,7 @@
             </li>
 </ul></div>
 <a name="range.reference.algorithms.range_algorithm_mutating_algorithms.generate.complexity"></a><h6>
-<a name="id2948549"></a>
+<a name="id665374"></a>
             <a class="link" href="generate.html#range.reference.algorithms.range_algorithm_mutating_algorithms.generate.complexity">Complexity</a>
           </h6>
 <p>
diff --git a/doc/html/range/reference/algorithms/range_algorithm_mutating_algorithms/inplace_merge.html b/doc/html/range/reference/algorithms/range_algorithm_mutating_algorithms/inplace_merge.html
index fafc9d5..46ef629 100644
--- a/doc/html/range/reference/algorithms/range_algorithm_mutating_algorithms/inplace_merge.html
+++ b/doc/html/range/reference/algorithms/range_algorithm_mutating_algorithms/inplace_merge.html
@@ -3,7 +3,7 @@
 <meta http-equiv="Content-Type" content="text/html; charset=US-ASCII">
 <title>Range Algorithm - inplace_merge</title>
 <link rel="stylesheet" href="../../../../../../../../doc/html/boostbook.css" type="text/css">
-<meta name="generator" content="DocBook XSL Stylesheets V1.75.1">
+<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="../range_algorithm_mutating_algorithms.html" title="Mutating algorithms">
 <link rel="prev" href="generate.html" title="Range Algorithm - generate">
@@ -28,7 +28,7 @@
           Range Algorithm - inplace_merge</a>
 </h5></div></div></div>
 <a name="range.reference.algorithms.range_algorithm_mutating_algorithms.inplace_merge.prototype"></a><h6>
-<a name="id2948621"></a>
+<a name="id665440"></a>
             <a class="link" href="inplace_merge.html#range.reference.algorithms.range_algorithm_mutating_algorithms.inplace_merge.prototype">Prototype</a>
           </h6>
 <p>
@@ -59,7 +59,7 @@
 <p>
           </p>
 <a name="range.reference.algorithms.range_algorithm_mutating_algorithms.inplace_merge.description"></a><h6>
-<a name="id2949185"></a>
+<a name="id665999"></a>
             <a class="link" href="inplace_merge.html#range.reference.algorithms.range_algorithm_mutating_algorithms.inplace_merge.description">Description</a>
           </h6>
 <p>
@@ -72,14 +72,14 @@
             input range is preserved.
           </p>
 <a name="range.reference.algorithms.range_algorithm_mutating_algorithms.inplace_merge.definition"></a><h6>
-<a name="id2949412"></a>
+<a name="id666216"></a>
             <a class="link" href="inplace_merge.html#range.reference.algorithms.range_algorithm_mutating_algorithms.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.range_algorithm_mutating_algorithms.inplace_merge.requirements"></a><h6>
-<a name="id2949487"></a>
+<a name="id666288"></a>
             <a class="link" href="inplace_merge.html#range.reference.algorithms.range_algorithm_mutating_algorithms.inplace_merge.requirements">Requirements</a>
           </h6>
 <p>
@@ -116,11 +116,11 @@
             argument types.
           </p>
 <a name="range.reference.algorithms.range_algorithm_mutating_algorithms.inplace_merge.precondition_"></a><h6>
-<a name="id2949742"></a>
+<a name="id666531"></a>
             <a class="link" href="inplace_merge.html#range.reference.algorithms.range_algorithm_mutating_algorithms.inplace_merge.precondition_">Precondition:</a>
           </h6>
 <a name="range.reference.algorithms.range_algorithm_mutating_algorithms.inplace_merge.for_the_non_predicate_version_"></a><h6>
-<a name="id2949767"></a>
+<a name="id666551"></a>
             <a class="link" href="inplace_merge.html#range.reference.algorithms.range_algorithm_mutating_algorithms.inplace_merge.for_the_non_predicate_version_">For
             the non-predicate version:</a>
           </h6>
@@ -143,7 +143,7 @@
             </li>
 </ul></div>
 <a name="range.reference.algorithms.range_algorithm_mutating_algorithms.inplace_merge.for_the_predicate_version_"></a><h6>
-<a name="id2950029"></a>
+<a name="id666805"></a>
             <a class="link" href="inplace_merge.html#range.reference.algorithms.range_algorithm_mutating_algorithms.inplace_merge.for_the_predicate_version_">For
             the predicate version:</a>
           </h6>
@@ -164,7 +164,7 @@
             </li>
 </ul></div>
 <a name="range.reference.algorithms.range_algorithm_mutating_algorithms.inplace_merge.complexity"></a><h6>
-<a name="id2950312"></a>
+<a name="id667078"></a>
             <a class="link" href="inplace_merge.html#range.reference.algorithms.range_algorithm_mutating_algorithms.inplace_merge.complexity">Complexity</a>
           </h6>
 <p>
diff --git a/doc/html/range/reference/algorithms/range_algorithm_mutating_algorithms/merge.html b/doc/html/range/reference/algorithms/range_algorithm_mutating_algorithms/merge.html
index 9bd570e..5747eef 100644
--- a/doc/html/range/reference/algorithms/range_algorithm_mutating_algorithms/merge.html
+++ b/doc/html/range/reference/algorithms/range_algorithm_mutating_algorithms/merge.html
@@ -3,7 +3,7 @@
 <meta http-equiv="Content-Type" content="text/html; charset=US-ASCII">
 <title>Range Algorithm - merge</title>
 <link rel="stylesheet" href="../../../../../../../../doc/html/boostbook.css" type="text/css">
-<meta name="generator" content="DocBook XSL Stylesheets V1.75.1">
+<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="../range_algorithm_mutating_algorithms.html" title="Mutating algorithms">
 <link rel="prev" href="inplace_merge.html" title="Range Algorithm - inplace_merge">
@@ -28,7 +28,7 @@
           Range Algorithm - merge</a>
 </h5></div></div></div>
 <a name="range.reference.algorithms.range_algorithm_mutating_algorithms.merge.prototype"></a><h6>
-<a name="id2950396"></a>
+<a name="id667157"></a>
             <a class="link" href="merge.html#range.reference.algorithms.range_algorithm_mutating_algorithms.merge.prototype">Prototype</a>
           </h6>
 <p>
@@ -57,7 +57,7 @@
 <p>
           </p>
 <a name="range.reference.algorithms.range_algorithm_mutating_algorithms.merge.description"></a><h6>
-<a name="id2950748"></a>
+<a name="id667503"></a>
             <a class="link" href="merge.html#range.reference.algorithms.range_algorithm_mutating_algorithms.merge.description">Description</a>
           </h6>
 <p>
@@ -76,14 +76,14 @@
             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.range_algorithm_mutating_algorithms.merge.definition"></a><h6>
-<a name="id2950931"></a>
+<a name="id667679"></a>
             <a class="link" href="merge.html#range.reference.algorithms.range_algorithm_mutating_algorithms.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.range_algorithm_mutating_algorithms.merge.requirements"></a><h6>
-<a name="id2951005"></a>
+<a name="id667750"></a>
             <a class="link" href="merge.html#range.reference.algorithms.range_algorithm_mutating_algorithms.merge.requirements">Requirements</a>
           </h6>
 <p>
@@ -151,11 +151,11 @@
             </li>
 </ul></div>
 <a name="range.reference.algorithms.range_algorithm_mutating_algorithms.merge.precondition_"></a><h6>
-<a name="id2951510"></a>
+<a name="id668233"></a>
             <a class="link" href="merge.html#range.reference.algorithms.range_algorithm_mutating_algorithms.merge.precondition_">Precondition:</a>
           </h6>
 <a name="range.reference.algorithms.range_algorithm_mutating_algorithms.merge.for_the_non_predicate_version_"></a><h6>
-<a name="id2951534"></a>
+<a name="id668255"></a>
             <a class="link" href="merge.html#range.reference.algorithms.range_algorithm_mutating_algorithms.merge.for_the_non_predicate_version_">For
             the non-predicate version:</a>
           </h6>
@@ -190,7 +190,7 @@
             </li>
 </ul></div>
 <a name="range.reference.algorithms.range_algorithm_mutating_algorithms.merge.for_the_predicate_version_"></a><h6>
-<a name="id2951995"></a>
+<a name="id668705"></a>
             <a class="link" href="merge.html#range.reference.algorithms.range_algorithm_mutating_algorithms.merge.for_the_predicate_version_">For
             the predicate version:</a>
           </h6>
@@ -221,7 +221,7 @@
             </li>
 </ul></div>
 <a name="range.reference.algorithms.range_algorithm_mutating_algorithms.merge.complexity"></a><h6>
-<a name="id2952479"></a>
+<a name="id669178"></a>
             <a class="link" href="merge.html#range.reference.algorithms.range_algorithm_mutating_algorithms.merge.complexity">Complexity</a>
           </h6>
 <p>
diff --git a/doc/html/range/reference/algorithms/range_algorithm_mutating_algorithms/nth_element.html b/doc/html/range/reference/algorithms/range_algorithm_mutating_algorithms/nth_element.html
index b8d27f0..75f8d71 100644
--- a/doc/html/range/reference/algorithms/range_algorithm_mutating_algorithms/nth_element.html
+++ b/doc/html/range/reference/algorithms/range_algorithm_mutating_algorithms/nth_element.html
@@ -3,7 +3,7 @@
 <meta http-equiv="Content-Type" content="text/html; charset=US-ASCII">
 <title>Range Algorithm - nth_element</title>
 <link rel="stylesheet" href="../../../../../../../../doc/html/boostbook.css" type="text/css">
-<meta name="generator" content="DocBook XSL Stylesheets V1.75.1">
+<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="../range_algorithm_mutating_algorithms.html" title="Mutating algorithms">
 <link rel="prev" href="merge.html" title="Range Algorithm - merge">
@@ -28,7 +28,7 @@
           Range Algorithm - nth_element</a>
 </h5></div></div></div>
 <a name="range.reference.algorithms.range_algorithm_mutating_algorithms.nth_element.prototype"></a><h6>
-<a name="id2952610"></a>
+<a name="id669302"></a>
             <a class="link" href="nth_element.html#range.reference.algorithms.range_algorithm_mutating_algorithms.nth_element.prototype">Prototype</a>
           </h6>
 <p>
@@ -55,7 +55,7 @@
 <p>
           </p>
 <a name="range.reference.algorithms.range_algorithm_mutating_algorithms.nth_element.description"></a><h6>
-<a name="id2953103"></a>
+<a name="id669789"></a>
             <a class="link" href="nth_element.html#range.reference.algorithms.range_algorithm_mutating_algorithms.nth_element.description">Description</a>
           </h6>
 <p>
@@ -66,14 +66,14 @@
             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.range_algorithm_mutating_algorithms.nth_element.definition"></a><h6>
-<a name="id2953187"></a>
+<a name="id669866"></a>
             <a class="link" href="nth_element.html#range.reference.algorithms.range_algorithm_mutating_algorithms.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.range_algorithm_mutating_algorithms.nth_element.requirements"></a><h6>
-<a name="id2953261"></a>
+<a name="id669937"></a>
             <a class="link" href="nth_element.html#range.reference.algorithms.range_algorithm_mutating_algorithms.nth_element.requirements">Requirements</a>
           </h6>
 <p>
@@ -124,7 +124,7 @@
             </li>
 </ul></div>
 <a name="range.reference.algorithms.range_algorithm_mutating_algorithms.nth_element.complexity"></a><h6>
-<a name="id2953497"></a>
+<a name="id670160"></a>
             <a class="link" href="nth_element.html#range.reference.algorithms.range_algorithm_mutating_algorithms.nth_element.complexity">Complexity</a>
           </h6>
 <p>
diff --git a/doc/html/range/reference/algorithms/range_algorithm_mutating_algorithms/partial_sort.html b/doc/html/range/reference/algorithms/range_algorithm_mutating_algorithms/partial_sort.html
index d218c43..1112ef2 100644
--- a/doc/html/range/reference/algorithms/range_algorithm_mutating_algorithms/partial_sort.html
+++ b/doc/html/range/reference/algorithms/range_algorithm_mutating_algorithms/partial_sort.html
@@ -3,7 +3,7 @@
 <meta http-equiv="Content-Type" content="text/html; charset=US-ASCII">
 <title>Range Algorithm - partial_sort</title>
 <link rel="stylesheet" href="../../../../../../../../doc/html/boostbook.css" type="text/css">
-<meta name="generator" content="DocBook XSL Stylesheets V1.75.1">
+<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="../range_algorithm_mutating_algorithms.html" title="Mutating algorithms">
 <link rel="prev" href="nth_element.html" title="Range Algorithm - nth_element">
@@ -28,7 +28,7 @@
           Range Algorithm - partial_sort</a>
 </h5></div></div></div>
 <a name="range.reference.algorithms.range_algorithm_mutating_algorithms.partial_sort.prototype"></a><h6>
-<a name="id2953568"></a>
+<a name="id670225"></a>
             <a class="link" href="partial_sort.html#range.reference.algorithms.range_algorithm_mutating_algorithms.partial_sort.prototype">Prototype</a>
           </h6>
 <p>
@@ -55,7 +55,7 @@
 <p>
           </p>
 <a name="range.reference.algorithms.range_algorithm_mutating_algorithms.partial_sort.description"></a><h6>
-<a name="id2954062"></a>
+<a name="id670711"></a>
             <a class="link" href="partial_sort.html#range.reference.algorithms.range_algorithm_mutating_algorithms.partial_sort.description">Description</a>
           </h6>
 <p>
@@ -71,14 +71,14 @@
             predicate instead.
           </p>
 <a name="range.reference.algorithms.range_algorithm_mutating_algorithms.partial_sort.definition"></a><h6>
-<a name="id2954249"></a>
+<a name="id670887"></a>
             <a class="link" href="partial_sort.html#range.reference.algorithms.range_algorithm_mutating_algorithms.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.range_algorithm_mutating_algorithms.partial_sort.requirements"></a><h6>
-<a name="id2954324"></a>
+<a name="id670959"></a>
             <a class="link" href="partial_sort.html#range.reference.algorithms.range_algorithm_mutating_algorithms.partial_sort.requirements">Requirements</a>
           </h6>
 <p>
@@ -129,7 +129,7 @@
             </li>
 </ul></div>
 <a name="range.reference.algorithms.range_algorithm_mutating_algorithms.partial_sort.complexity"></a><h6>
-<a name="id2954561"></a>
+<a name="id671180"></a>
             <a class="link" href="partial_sort.html#range.reference.algorithms.range_algorithm_mutating_algorithms.partial_sort.complexity">Complexity</a>
           </h6>
 <p>
diff --git a/doc/html/range/reference/algorithms/range_algorithm_mutating_algorithms/partition.html b/doc/html/range/reference/algorithms/range_algorithm_mutating_algorithms/partition.html
index 4136a2a..50b7b16 100644
--- a/doc/html/range/reference/algorithms/range_algorithm_mutating_algorithms/partition.html
+++ b/doc/html/range/reference/algorithms/range_algorithm_mutating_algorithms/partition.html
@@ -3,7 +3,7 @@
 <meta http-equiv="Content-Type" content="text/html; charset=US-ASCII">
 <title>Range Algorithm - partition</title>
 <link rel="stylesheet" href="../../../../../../../../doc/html/boostbook.css" type="text/css">
-<meta name="generator" content="DocBook XSL Stylesheets V1.75.1">
+<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="../range_algorithm_mutating_algorithms.html" title="Mutating algorithms">
 <link rel="prev" href="partial_sort.html" title="Range Algorithm - partial_sort">
@@ -28,7 +28,7 @@
           Range Algorithm - partition</a>
 </h5></div></div></div>
 <a name="range.reference.algorithms.range_algorithm_mutating_algorithms.partition.prototype"></a><h6>
-<a name="id2954685"></a>
+<a name="id671298"></a>
             <a class="link" href="partition.html#range.reference.algorithms.range_algorithm_mutating_algorithms.partition.prototype">Prototype</a>
           </h6>
 <p>
@@ -67,7 +67,7 @@
 <p>
           </p>
 <a name="range.reference.algorithms.range_algorithm_mutating_algorithms.partition.description"></a><h6>
-<a name="id2955271"></a>
+<a name="id671878"></a>
             <a class="link" href="partition.html#range.reference.algorithms.range_algorithm_mutating_algorithms.partition.description">Description</a>
           </h6>
 <p>
@@ -81,14 +81,14 @@
             corresponds to the middle iterator.
           </p>
 <a name="range.reference.algorithms.range_algorithm_mutating_algorithms.partition.definition"></a><h6>
-<a name="id2955358"></a>
+<a name="id671957"></a>
             <a class="link" href="partition.html#range.reference.algorithms.range_algorithm_mutating_algorithms.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.range_algorithm_mutating_algorithms.partition.requirements"></a><h6>
-<a name="id2955432"></a>
+<a name="id672027"></a>
             <a class="link" href="partition.html#range.reference.algorithms.range_algorithm_mutating_algorithms.partition.requirements">Requirements</a>
           </h6>
 <div class="itemizedlist"><ul class="itemizedlist" type="disc">
@@ -108,7 +108,7 @@
             </li>
 </ul></div>
 <a name="range.reference.algorithms.range_algorithm_mutating_algorithms.partition.complexity"></a><h6>
-<a name="id2955533"></a>
+<a name="id672122"></a>
             <a class="link" href="partition.html#range.reference.algorithms.range_algorithm_mutating_algorithms.partition.complexity">Complexity</a>
           </h6>
 <p>
diff --git a/doc/html/range/reference/algorithms/range_algorithm_mutating_algorithms/random_shuffle.html b/doc/html/range/reference/algorithms/range_algorithm_mutating_algorithms/random_shuffle.html
index 190f66f..023d799 100644
--- a/doc/html/range/reference/algorithms/range_algorithm_mutating_algorithms/random_shuffle.html
+++ b/doc/html/range/reference/algorithms/range_algorithm_mutating_algorithms/random_shuffle.html
@@ -3,7 +3,7 @@
 <meta http-equiv="Content-Type" content="text/html; charset=US-ASCII">
 <title>Range Algorithm - random_shuffle</title>
 <link rel="stylesheet" href="../../../../../../../../doc/html/boostbook.css" type="text/css">
-<meta name="generator" content="DocBook XSL Stylesheets V1.75.1">
+<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="../range_algorithm_mutating_algorithms.html" title="Mutating algorithms">
 <link rel="prev" href="partition.html" title="Range Algorithm - partition">
@@ -28,7 +28,7 @@
           Range Algorithm - random_shuffle</a>
 </h5></div></div></div>
 <a name="range.reference.algorithms.range_algorithm_mutating_algorithms.random_shuffle.prototype"></a><h6>
-<a name="id2955651"></a>
+<a name="id672234"></a>
             <a class="link" href="random_shuffle.html#range.reference.algorithms.range_algorithm_mutating_algorithms.random_shuffle.prototype">Prototype</a>
           </h6>
 <p>
@@ -49,7 +49,7 @@
 <p>
           </p>
 <a name="range.reference.algorithms.range_algorithm_mutating_algorithms.random_shuffle.description"></a><h6>
-<a name="id2956042"></a>
+<a name="id672620"></a>
             <a class="link" href="random_shuffle.html#range.reference.algorithms.range_algorithm_mutating_algorithms.random_shuffle.description">Description</a>
           </h6>
 <p>
@@ -61,14 +61,14 @@
             the shuffles range.
           </p>
 <a name="range.reference.algorithms.range_algorithm_mutating_algorithms.random_shuffle.definition"></a><h6>
-<a name="id2956138"></a>
+<a name="id672708"></a>
             <a class="link" href="random_shuffle.html#range.reference.algorithms.range_algorithm_mutating_algorithms.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.range_algorithm_mutating_algorithms.random_shuffle.requirements"></a><h6>
-<a name="id2956213"></a>
+<a name="id672780"></a>
             <a class="link" href="random_shuffle.html#range.reference.algorithms.range_algorithm_mutating_algorithms.random_shuffle.requirements">Requirements</a>
           </h6>
 <p>
@@ -99,7 +99,7 @@
             </li>
 </ul></div>
 <a name="range.reference.algorithms.range_algorithm_mutating_algorithms.random_shuffle.precondition_"></a><h6>
-<a name="id2956361"></a>
+<a name="id672918"></a>
             <a class="link" href="random_shuffle.html#range.reference.algorithms.range_algorithm_mutating_algorithms.random_shuffle.precondition_">Precondition:</a>
           </h6>
 <div class="itemizedlist"><ul class="itemizedlist" type="disc"><li class="listitem">
@@ -108,7 +108,7 @@
               maximum value.
             </li></ul></div>
 <a name="range.reference.algorithms.range_algorithm_mutating_algorithms.random_shuffle.complexity"></a><h6>
-<a name="id2956426"></a>
+<a name="id672979"></a>
             <a class="link" href="random_shuffle.html#range.reference.algorithms.range_algorithm_mutating_algorithms.random_shuffle.complexity">Complexity</a>
           </h6>
 <p>
diff --git a/doc/html/range/reference/algorithms/range_algorithm_mutating_algorithms/remove.html b/doc/html/range/reference/algorithms/range_algorithm_mutating_algorithms/remove.html
index 4cb906c..65ab605 100644
--- a/doc/html/range/reference/algorithms/range_algorithm_mutating_algorithms/remove.html
+++ b/doc/html/range/reference/algorithms/range_algorithm_mutating_algorithms/remove.html
@@ -3,7 +3,7 @@
 <meta http-equiv="Content-Type" content="text/html; charset=US-ASCII">
 <title>Range Algorithm - remove</title>
 <link rel="stylesheet" href="../../../../../../../../doc/html/boostbook.css" type="text/css">
-<meta name="generator" content="DocBook XSL Stylesheets V1.75.1">
+<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="../range_algorithm_mutating_algorithms.html" title="Mutating algorithms">
 <link rel="prev" href="random_shuffle.html" title="Range Algorithm - random_shuffle">
@@ -28,7 +28,7 @@
           Range Algorithm - remove</a>
 </h5></div></div></div>
 <a name="range.reference.algorithms.range_algorithm_mutating_algorithms.remove.prototype"></a><h6>
-<a name="id2956538"></a>
+<a name="id673083"></a>
             <a class="link" href="remove.html#range.reference.algorithms.range_algorithm_mutating_algorithms.remove.prototype">Prototype</a>
           </h6>
 <p>
@@ -67,7 +67,7 @@
 <p>
           </p>
 <a name="range.reference.algorithms.range_algorithm_mutating_algorithms.remove.description"></a><h6>
-<a name="id2957161"></a>
+<a name="id673700"></a>
             <a class="link" href="remove.html#range.reference.algorithms.range_algorithm_mutating_algorithms.remove.description">Description</a>
           </h6>
 <p>
@@ -84,14 +84,14 @@
             are dereferenceable, but the elements are unspecified.
           </p>
 <a name="range.reference.algorithms.range_algorithm_mutating_algorithms.remove.definition"></a><h6>
-<a name="id2957399"></a>
+<a name="id673928"></a>
             <a class="link" href="remove.html#range.reference.algorithms.range_algorithm_mutating_algorithms.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.range_algorithm_mutating_algorithms.remove.requirements"></a><h6>
-<a name="id2957473"></a>
+<a name="id673998"></a>
             <a class="link" href="remove.html#range.reference.algorithms.range_algorithm_mutating_algorithms.remove.requirements">Requirements</a>
           </h6>
 <div class="itemizedlist"><ul class="itemizedlist" type="disc">
@@ -114,7 +114,7 @@
             </li>
 </ul></div>
 <a name="range.reference.algorithms.range_algorithm_mutating_algorithms.remove.complexity"></a><h6>
-<a name="id2957588"></a>
+<a name="id674106"></a>
             <a class="link" href="remove.html#range.reference.algorithms.range_algorithm_mutating_algorithms.remove.complexity">Complexity</a>
           </h6>
 <p>
diff --git a/doc/html/range/reference/algorithms/range_algorithm_mutating_algorithms/remove_if.html b/doc/html/range/reference/algorithms/range_algorithm_mutating_algorithms/remove_if.html
index 9896adc..227aeb0 100644
--- a/doc/html/range/reference/algorithms/range_algorithm_mutating_algorithms/remove_if.html
+++ b/doc/html/range/reference/algorithms/range_algorithm_mutating_algorithms/remove_if.html
@@ -3,7 +3,7 @@
 <meta http-equiv="Content-Type" content="text/html; charset=US-ASCII">
 <title>Range Algorithm - remove_if</title>
 <link rel="stylesheet" href="../../../../../../../../doc/html/boostbook.css" type="text/css">
-<meta name="generator" content="DocBook XSL Stylesheets V1.75.1">
+<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="../range_algorithm_mutating_algorithms.html" title="Mutating algorithms">
 <link rel="prev" href="remove.html" title="Range Algorithm - remove">
@@ -28,7 +28,7 @@
           Range Algorithm - remove_if</a>
 </h5></div></div></div>
 <a name="range.reference.algorithms.range_algorithm_mutating_algorithms.remove_if.prototype"></a><h6>
-<a name="id2957672"></a>
+<a name="id674184"></a>
             <a class="link" href="remove_if.html#range.reference.algorithms.range_algorithm_mutating_algorithms.remove_if.prototype">Prototype</a>
           </h6>
 <p>
@@ -67,7 +67,7 @@
 <p>
           </p>
 <a name="range.reference.algorithms.range_algorithm_mutating_algorithms.remove_if.description"></a><h6>
-<a name="id2958256"></a>
+<a name="id674760"></a>
             <a class="link" href="remove_if.html#range.reference.algorithms.range_algorithm_mutating_algorithms.remove_if.description">Description</a>
           </h6>
 <p>
@@ -83,14 +83,14 @@
             are unspecified.
           </p>
 <a name="range.reference.algorithms.range_algorithm_mutating_algorithms.remove_if.definition"></a><h6>
-<a name="id2958488"></a>
+<a name="id674983"></a>
             <a class="link" href="remove_if.html#range.reference.algorithms.range_algorithm_mutating_algorithms.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.range_algorithm_mutating_algorithms.remove_if.requirements"></a><h6>
-<a name="id2958562"></a>
+<a name="id675053"></a>
             <a class="link" href="remove_if.html#range.reference.algorithms.range_algorithm_mutating_algorithms.remove_if.requirements">Requirements</a>
           </h6>
 <div class="itemizedlist"><ul class="itemizedlist" type="disc">
@@ -113,7 +113,7 @@
             </li>
 </ul></div>
 <a name="range.reference.algorithms.range_algorithm_mutating_algorithms.remove_if.complexity"></a><h6>
-<a name="id2958679"></a>
+<a name="id675161"></a>
             <a class="link" href="remove_if.html#range.reference.algorithms.range_algorithm_mutating_algorithms.remove_if.complexity">Complexity</a>
           </h6>
 <p>
diff --git a/doc/html/range/reference/algorithms/range_algorithm_mutating_algorithms/replace.html b/doc/html/range/reference/algorithms/range_algorithm_mutating_algorithms/replace.html
index ab4232d..e07aebb 100644
--- a/doc/html/range/reference/algorithms/range_algorithm_mutating_algorithms/replace.html
+++ b/doc/html/range/reference/algorithms/range_algorithm_mutating_algorithms/replace.html
@@ -3,7 +3,7 @@
 <meta http-equiv="Content-Type" content="text/html; charset=US-ASCII">
 <title>Range Algorithm - replace</title>
 <link rel="stylesheet" href="../../../../../../../../doc/html/boostbook.css" type="text/css">
-<meta name="generator" content="DocBook XSL Stylesheets V1.75.1">
+<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="../range_algorithm_mutating_algorithms.html" title="Mutating algorithms">
 <link rel="prev" href="remove_if.html" title="Range Algorithm - remove_if">
@@ -28,7 +28,7 @@
           Range Algorithm - replace</a>
 </h5></div></div></div>
 <a name="range.reference.algorithms.range_algorithm_mutating_algorithms.replace.prototype"></a><h6>
-<a name="id2958772"></a>
+<a name="id675247"></a>
             <a class="link" href="replace.html#range.reference.algorithms.range_algorithm_mutating_algorithms.replace.prototype">Prototype</a>
           </h6>
 <p>
@@ -49,7 +49,7 @@
 <p>
           </p>
 <a name="range.reference.algorithms.range_algorithm_mutating_algorithms.replace.description"></a><h6>
-<a name="id2959089"></a>
+<a name="id675560"></a>
             <a class="link" href="replace.html#range.reference.algorithms.range_algorithm_mutating_algorithms.replace.description">Description</a>
           </h6>
 <p>
@@ -58,14 +58,14 @@
             Return a reference to <code class="computeroutput"><span class="identifier">rng</span></code>.
           </p>
 <a name="range.reference.algorithms.range_algorithm_mutating_algorithms.replace.definition"></a><h6>
-<a name="id2959171"></a>
+<a name="id675637"></a>
             <a class="link" href="replace.html#range.reference.algorithms.range_algorithm_mutating_algorithms.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.range_algorithm_mutating_algorithms.replace.requirements"></a><h6>
-<a name="id2959245"></a>
+<a name="id675707"></a>
             <a class="link" href="replace.html#range.reference.algorithms.range_algorithm_mutating_algorithms.replace.requirements">Requirements</a>
           </h6>
 <div class="itemizedlist"><ul class="itemizedlist" type="disc">
@@ -94,7 +94,7 @@
             </li>
 </ul></div>
 <a name="range.reference.algorithms.range_algorithm_mutating_algorithms.replace.complexity"></a><h6>
-<a name="id2959397"></a>
+<a name="id675850"></a>
             <a class="link" href="replace.html#range.reference.algorithms.range_algorithm_mutating_algorithms.replace.complexity">Complexity</a>
           </h6>
 <p>
diff --git a/doc/html/range/reference/algorithms/range_algorithm_mutating_algorithms/replace_if.html b/doc/html/range/reference/algorithms/range_algorithm_mutating_algorithms/replace_if.html
index 7677651..fcf01b9 100644
--- a/doc/html/range/reference/algorithms/range_algorithm_mutating_algorithms/replace_if.html
+++ b/doc/html/range/reference/algorithms/range_algorithm_mutating_algorithms/replace_if.html
@@ -3,7 +3,7 @@
 <meta http-equiv="Content-Type" content="text/html; charset=US-ASCII">
 <title>Range Algorithm - replace_if</title>
 <link rel="stylesheet" href="../../../../../../../../doc/html/boostbook.css" type="text/css">
-<meta name="generator" content="DocBook XSL Stylesheets V1.75.1">
+<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="../range_algorithm_mutating_algorithms.html" title="Mutating algorithms">
 <link rel="prev" href="replace.html" title="Range Algorithm - replace">
@@ -28,7 +28,7 @@
           Range Algorithm - replace_if</a>
 </h5></div></div></div>
 <a name="range.reference.algorithms.range_algorithm_mutating_algorithms.replace_if.prototype"></a><h6>
-<a name="id2959506"></a>
+<a name="id675952"></a>
             <a class="link" href="replace_if.html#range.reference.algorithms.range_algorithm_mutating_algorithms.replace_if.prototype">Prototype</a>
           </h6>
 <p>
@@ -43,7 +43,7 @@
 <p>
           </p>
 <a name="range.reference.algorithms.range_algorithm_mutating_algorithms.replace_if.description"></a><h6>
-<a name="id2959831"></a>
+<a name="id676272"></a>
             <a class="link" href="replace_if.html#range.reference.algorithms.range_algorithm_mutating_algorithms.replace_if.description">Description</a>
           </h6>
 <p>
@@ -52,14 +52,14 @@
             Returns a reference to <code class="computeroutput"><span class="identifier">rng</span></code>.
           </p>
 <a name="range.reference.algorithms.range_algorithm_mutating_algorithms.replace_if.definition"></a><h6>
-<a name="id2959948"></a>
+<a name="id676383"></a>
             <a class="link" href="replace_if.html#range.reference.algorithms.range_algorithm_mutating_algorithms.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.range_algorithm_mutating_algorithms.replace_if.requirements"></a><h6>
-<a name="id2960024"></a>
+<a name="id676454"></a>
             <a class="link" href="replace_if.html#range.reference.algorithms.range_algorithm_mutating_algorithms.replace_if.requirements">Requirements</a>
           </h6>
 <div class="itemizedlist"><ul class="itemizedlist" type="disc">
@@ -91,7 +91,7 @@
             </li>
 </ul></div>
 <a name="range.reference.algorithms.range_algorithm_mutating_algorithms.replace_if.complexity"></a><h6>
-<a name="id2960192"></a>
+<a name="id676612"></a>
             <a class="link" href="replace_if.html#range.reference.algorithms.range_algorithm_mutating_algorithms.replace_if.complexity">Complexity</a>
           </h6>
 <p>
diff --git a/doc/html/range/reference/algorithms/range_algorithm_mutating_algorithms/rotate.html b/doc/html/range/reference/algorithms/range_algorithm_mutating_algorithms/rotate.html
index 55faad4..e4c574f 100644
--- a/doc/html/range/reference/algorithms/range_algorithm_mutating_algorithms/rotate.html
+++ b/doc/html/range/reference/algorithms/range_algorithm_mutating_algorithms/rotate.html
@@ -3,7 +3,7 @@
 <meta http-equiv="Content-Type" content="text/html; charset=US-ASCII">
 <title>Range Algorithm - rotate</title>
 <link rel="stylesheet" href="../../../../../../../../doc/html/boostbook.css" type="text/css">
-<meta name="generator" content="DocBook XSL Stylesheets V1.75.1">
+<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="../range_algorithm_mutating_algorithms.html" title="Mutating algorithms">
 <link rel="prev" href="replace_if.html" title="Range Algorithm - replace_if">
@@ -28,7 +28,7 @@
           Range Algorithm - rotate</a>
 </h5></div></div></div>
 <a name="range.reference.algorithms.range_algorithm_mutating_algorithms.rotate.prototype"></a><h6>
-<a name="id2960310"></a>
+<a name="id676724"></a>
             <a class="link" href="rotate.html#range.reference.algorithms.range_algorithm_mutating_algorithms.rotate.prototype">Prototype</a>
           </h6>
 <p>
@@ -45,7 +45,7 @@
 <p>
           </p>
 <a name="range.reference.algorithms.range_algorithm_mutating_algorithms.rotate.description"></a><h6>
-<a name="id2960572"></a>
+<a name="id676981"></a>
             <a class="link" href="rotate.html#range.reference.algorithms.range_algorithm_mutating_algorithms.rotate.description">Description</a>
           </h6>
 <p>
@@ -54,14 +54,14 @@
             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.range_algorithm_mutating_algorithms.rotate.definition"></a><h6>
-<a name="id2960700"></a>
+<a name="id677102"></a>
             <a class="link" href="rotate.html#range.reference.algorithms.range_algorithm_mutating_algorithms.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.range_algorithm_mutating_algorithms.rotate.requirements"></a><h6>
-<a name="id2960774"></a>
+<a name="id677174"></a>
             <a class="link" href="rotate.html#range.reference.algorithms.range_algorithm_mutating_algorithms.rotate.requirements">Requirements</a>
           </h6>
 <div class="itemizedlist"><ul class="itemizedlist" type="disc">
@@ -75,7 +75,7 @@
             </li>
 </ul></div>
 <a name="range.reference.algorithms.range_algorithm_mutating_algorithms.rotate.precondition_"></a><h6>
-<a name="id2960838"></a>
+<a name="id677233"></a>
             <a class="link" href="rotate.html#range.reference.algorithms.range_algorithm_mutating_algorithms.rotate.precondition_">Precondition:</a>
           </h6>
 <div class="itemizedlist"><ul class="itemizedlist" type="disc">
@@ -87,7 +87,7 @@
             </li>
 </ul></div>
 <a name="range.reference.algorithms.range_algorithm_mutating_algorithms.rotate.complexity"></a><h6>
-<a name="id2960949"></a>
+<a name="id677339"></a>
             <a class="link" href="rotate.html#range.reference.algorithms.range_algorithm_mutating_algorithms.rotate.complexity">Complexity</a>
           </h6>
 <p>
diff --git a/doc/html/range/reference/algorithms/range_algorithm_mutating_algorithms/sort.html b/doc/html/range/reference/algorithms/range_algorithm_mutating_algorithms/sort.html
index 290f8e7..31adcdf 100644
--- a/doc/html/range/reference/algorithms/range_algorithm_mutating_algorithms/sort.html
+++ b/doc/html/range/reference/algorithms/range_algorithm_mutating_algorithms/sort.html
@@ -3,7 +3,7 @@
 <meta http-equiv="Content-Type" content="text/html; charset=US-ASCII">
 <title>Range Algorithm - sort</title>
 <link rel="stylesheet" href="../../../../../../../../doc/html/boostbook.css" type="text/css">
-<meta name="generator" content="DocBook XSL Stylesheets V1.75.1">
+<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="../range_algorithm_mutating_algorithms.html" title="Mutating algorithms">
 <link rel="prev" href="rotate.html" title="Range Algorithm - rotate">
@@ -28,7 +28,7 @@
           Range Algorithm - sort</a>
 </h5></div></div></div>
 <a name="range.reference.algorithms.range_algorithm_mutating_algorithms.sort.prototype"></a><h6>
-<a name="id2961022"></a>
+<a name="id677405"></a>
             <a class="link" href="sort.html#range.reference.algorithms.range_algorithm_mutating_algorithms.sort.prototype">Prototype</a>
           </h6>
 <p>
@@ -49,7 +49,7 @@
 <p>
           </p>
 <a name="range.reference.algorithms.range_algorithm_mutating_algorithms.sort.description"></a><h6>
-<a name="id2961405"></a>
+<a name="id677781"></a>
             <a class="link" href="sort.html#range.reference.algorithms.range_algorithm_mutating_algorithms.sort.description">Description</a>
           </h6>
 <p>
@@ -72,14 +72,14 @@
             <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.range_algorithm_mutating_algorithms.sort.definition"></a><h6>
-<a name="id2961659"></a>
+<a name="id678027"></a>
             <a class="link" href="sort.html#range.reference.algorithms.range_algorithm_mutating_algorithms.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.range_algorithm_mutating_algorithms.sort.requirements"></a><h6>
-<a name="id2961733"></a>
+<a name="id678098"></a>
             <a class="link" href="sort.html#range.reference.algorithms.range_algorithm_mutating_algorithms.sort.requirements">Requirements</a>
           </h6>
 <p>
@@ -130,7 +130,7 @@
             </li>
 </ul></div>
 <a name="range.reference.algorithms.range_algorithm_mutating_algorithms.sort.complexity"></a><h6>
-<a name="id2961969"></a>
+<a name="id678319"></a>
             <a class="link" href="sort.html#range.reference.algorithms.range_algorithm_mutating_algorithms.sort.complexity">Complexity</a>
           </h6>
 <p>
diff --git a/doc/html/range/reference/algorithms/range_algorithm_mutating_algorithms/stable_partition.html b/doc/html/range/reference/algorithms/range_algorithm_mutating_algorithms/stable_partition.html
index eb0032a..a549bc5 100644
--- a/doc/html/range/reference/algorithms/range_algorithm_mutating_algorithms/stable_partition.html
+++ b/doc/html/range/reference/algorithms/range_algorithm_mutating_algorithms/stable_partition.html
@@ -3,7 +3,7 @@
 <meta http-equiv="Content-Type" content="text/html; charset=US-ASCII">
 <title>Range Algorithm - stable_partition</title>
 <link rel="stylesheet" href="../../../../../../../../doc/html/boostbook.css" type="text/css">
-<meta name="generator" content="DocBook XSL Stylesheets V1.75.1">
+<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="../range_algorithm_mutating_algorithms.html" title="Mutating algorithms">
 <link rel="prev" href="sort.html" title="Range Algorithm - sort">
@@ -28,7 +28,7 @@
           Range Algorithm - stable_partition</a>
 </h5></div></div></div>
 <a name="range.reference.algorithms.range_algorithm_mutating_algorithms.stable_partition.prototype"></a><h6>
-<a name="id2962090"></a>
+<a name="id678435"></a>
             <a class="link" href="stable_partition.html#range.reference.algorithms.range_algorithm_mutating_algorithms.stable_partition.prototype">Prototype</a>
           </h6>
 <p>
@@ -61,7 +61,7 @@
 <p>
           </p>
 <a name="range.reference.algorithms.range_algorithm_mutating_algorithms.stable_partition.description"></a><h6>
-<a name="id2962672"></a>
+<a name="id679008"></a>
             <a class="link" href="stable_partition.html#range.reference.algorithms.range_algorithm_mutating_algorithms.stable_partition.description">Description</a>
           </h6>
 <p>
@@ -83,14 +83,14 @@
             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.range_algorithm_mutating_algorithms.stable_partition.definition"></a><h6>
-<a name="id2962825"></a>
+<a name="id679150"></a>
             <a class="link" href="stable_partition.html#range.reference.algorithms.range_algorithm_mutating_algorithms.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.range_algorithm_mutating_algorithms.stable_partition.requirements"></a><h6>
-<a name="id2962900"></a>
+<a name="id679221"></a>
             <a class="link" href="stable_partition.html#range.reference.algorithms.range_algorithm_mutating_algorithms.stable_partition.requirements">Requirements</a>
           </h6>
 <div class="itemizedlist"><ul class="itemizedlist" type="disc">
@@ -108,7 +108,7 @@
             </li>
 </ul></div>
 <a name="range.reference.algorithms.range_algorithm_mutating_algorithms.stable_partition.complexity"></a><h6>
-<a name="id2962991"></a>
+<a name="id679305"></a>
             <a class="link" href="stable_partition.html#range.reference.algorithms.range_algorithm_mutating_algorithms.stable_partition.complexity">Complexity</a>
           </h6>
 <p>
diff --git a/doc/html/range/reference/algorithms/range_algorithm_mutating_algorithms/stable_sort.html b/doc/html/range/reference/algorithms/range_algorithm_mutating_algorithms/stable_sort.html
index 984024d..e02cfa3 100644
--- a/doc/html/range/reference/algorithms/range_algorithm_mutating_algorithms/stable_sort.html
+++ b/doc/html/range/reference/algorithms/range_algorithm_mutating_algorithms/stable_sort.html
@@ -3,7 +3,7 @@
 <meta http-equiv="Content-Type" content="text/html; charset=US-ASCII">
 <title>Range Algorithm - stable_sort</title>
 <link rel="stylesheet" href="../../../../../../../../doc/html/boostbook.css" type="text/css">
-<meta name="generator" content="DocBook XSL Stylesheets V1.75.1">
+<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="../range_algorithm_mutating_algorithms.html" title="Mutating algorithms">
 <link rel="prev" href="stable_partition.html" title="Range Algorithm - stable_partition">
@@ -28,7 +28,7 @@
           Range Algorithm - stable_sort</a>
 </h5></div></div></div>
 <a name="range.reference.algorithms.range_algorithm_mutating_algorithms.stable_sort.prototype"></a><h6>
-<a name="id2963166"></a>
+<a name="id679474"></a>
             <a class="link" href="stable_sort.html#range.reference.algorithms.range_algorithm_mutating_algorithms.stable_sort.prototype">Prototype</a>
           </h6>
 <p>
@@ -49,7 +49,7 @@
 <p>
           </p>
 <a name="range.reference.algorithms.range_algorithm_mutating_algorithms.stable_sort.description"></a><h6>
-<a name="id2963549"></a>
+<a name="id679851"></a>
             <a class="link" href="stable_sort.html#range.reference.algorithms.range_algorithm_mutating_algorithms.stable_sort.description">Description</a>
           </h6>
 <p>
@@ -72,14 +72,14 @@
             <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.range_algorithm_mutating_algorithms.stable_sort.definition"></a><h6>
-<a name="id2963804"></a>
+<a name="id680095"></a>
             <a class="link" href="stable_sort.html#range.reference.algorithms.range_algorithm_mutating_algorithms.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.range_algorithm_mutating_algorithms.stable_sort.requirements"></a><h6>
-<a name="id2963879"></a>
+<a name="id680166"></a>
             <a class="link" href="stable_sort.html#range.reference.algorithms.range_algorithm_mutating_algorithms.stable_sort.requirements">Requirements</a>
           </h6>
 <p>
@@ -130,7 +130,7 @@
             </li>
 </ul></div>
 <a name="range.reference.algorithms.range_algorithm_mutating_algorithms.stable_sort.complexity"></a><h6>
-<a name="id2964116"></a>
+<a name="id680387"></a>
             <a class="link" href="stable_sort.html#range.reference.algorithms.range_algorithm_mutating_algorithms.stable_sort.complexity">Complexity</a>
           </h6>
 <p>
diff --git a/doc/html/range/reference/algorithms/range_algorithm_mutating_algorithms/transform.html b/doc/html/range/reference/algorithms/range_algorithm_mutating_algorithms/transform.html
index 58da4ca..82c53ea 100644
--- a/doc/html/range/reference/algorithms/range_algorithm_mutating_algorithms/transform.html
+++ b/doc/html/range/reference/algorithms/range_algorithm_mutating_algorithms/transform.html
@@ -3,7 +3,7 @@
 <meta http-equiv="Content-Type" content="text/html; charset=US-ASCII">
 <title>Range Algorithm - transform</title>
 <link rel="stylesheet" href="../../../../../../../../doc/html/boostbook.css" type="text/css">
-<meta name="generator" content="DocBook XSL Stylesheets V1.75.1">
+<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="../range_algorithm_mutating_algorithms.html" title="Mutating algorithms">
 <link rel="prev" href="stable_sort.html" title="Range Algorithm - stable_sort">
@@ -28,7 +28,7 @@
           Range Algorithm - transform</a>
 </h5></div></div></div>
 <a name="range.reference.algorithms.range_algorithm_mutating_algorithms.transform.prototype"></a><h6>
-<a name="id2964305"></a>
+<a name="id680568"></a>
             <a class="link" href="transform.html#range.reference.algorithms.range_algorithm_mutating_algorithms.transform.prototype">Prototype</a>
           </h6>
 <p>
@@ -57,7 +57,7 @@
 <p>
           </p>
 <a name="range.reference.algorithms.range_algorithm_mutating_algorithms.transform.description"></a><h6>
-<a name="id2964646"></a>
+<a name="id680904"></a>
             <a class="link" href="transform.html#range.reference.algorithms.range_algorithm_mutating_algorithms.transform.description">Description</a>
           </h6>
 <p>
@@ -93,14 +93,14 @@
             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.range_algorithm_mutating_algorithms.transform.definition"></a><h6>
-<a name="id2965199"></a>
+<a name="id681443"></a>
             <a class="link" href="transform.html#range.reference.algorithms.range_algorithm_mutating_algorithms.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.range_algorithm_mutating_algorithms.transform.requirements"></a><h6>
-<a name="id2965273"></a>
+<a name="id681514"></a>
             <a class="link" href="transform.html#range.reference.algorithms.range_algorithm_mutating_algorithms.transform.requirements">Requirements</a>
           </h6>
 <p>
@@ -170,7 +170,7 @@
             </li>
 </ul></div>
 <a name="range.reference.algorithms.range_algorithm_mutating_algorithms.transform.precondition_"></a><h6>
-<a name="id2965628"></a>
+<a name="id681844"></a>
             <a class="link" href="transform.html#range.reference.algorithms.range_algorithm_mutating_algorithms.transform.precondition_">Precondition:</a>
           </h6>
 <p>
@@ -202,7 +202,7 @@
             </li>
 </ul></div>
 <a name="range.reference.algorithms.range_algorithm_mutating_algorithms.transform.complexity"></a><h6>
-<a name="id2966044"></a>
+<a name="id682252"></a>
             <a class="link" href="transform.html#range.reference.algorithms.range_algorithm_mutating_algorithms.transform.complexity">Complexity</a>
           </h6>
 <p>
diff --git a/doc/html/range/reference/algorithms/range_algorithm_mutating_algorithms/unique.html b/doc/html/range/reference/algorithms/range_algorithm_mutating_algorithms/unique.html
index aaa5525..13f388f 100644
--- a/doc/html/range/reference/algorithms/range_algorithm_mutating_algorithms/unique.html
+++ b/doc/html/range/reference/algorithms/range_algorithm_mutating_algorithms/unique.html
@@ -3,7 +3,7 @@
 <meta http-equiv="Content-Type" content="text/html; charset=US-ASCII">
 <title>Range Algorithm - unique</title>
 <link rel="stylesheet" href="../../../../../../../../doc/html/boostbook.css" type="text/css">
-<meta name="generator" content="DocBook XSL Stylesheets V1.75.1">
+<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="../range_algorithm_mutating_algorithms.html" title="Mutating algorithms">
 <link rel="prev" href="transform.html" title="Range Algorithm - transform">
@@ -28,7 +28,7 @@
           Range Algorithm - unique</a>
 </h5></div></div></div>
 <a name="range.reference.algorithms.range_algorithm_mutating_algorithms.unique.prototype"></a><h6>
-<a name="id2966171"></a>
+<a name="id682371"></a>
             <a class="link" href="unique.html#range.reference.algorithms.range_algorithm_mutating_algorithms.unique.prototype">Prototype</a>
           </h6>
 <p>
@@ -69,7 +69,7 @@
 <p>
           </p>
 <a name="range.reference.algorithms.range_algorithm_mutating_algorithms.unique.description"></a><h6>
-<a name="id2967204"></a>
+<a name="id683395"></a>
             <a class="link" href="unique.html#range.reference.algorithms.range_algorithm_mutating_algorithms.unique.description">Description</a>
           </h6>
 <p>
@@ -87,14 +87,14 @@
             type.
           </p>
 <a name="range.reference.algorithms.range_algorithm_mutating_algorithms.unique.definition"></a><h6>
-<a name="id2967328"></a>
+<a name="id683513"></a>
             <a class="link" href="unique.html#range.reference.algorithms.range_algorithm_mutating_algorithms.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.range_algorithm_mutating_algorithms.unique.requirements"></a><h6>
-<a name="id2967403"></a>
+<a name="id683584"></a>
             <a class="link" href="unique.html#range.reference.algorithms.range_algorithm_mutating_algorithms.unique.requirements">Requirements</a>
           </h6>
 <p>
@@ -138,7 +138,7 @@
             </li>
 </ul></div>
 <a name="range.reference.algorithms.range_algorithm_mutating_algorithms.unique.complexity"></a><h6>
-<a name="id2967617"></a>
+<a name="id683784"></a>
             <a class="link" href="unique.html#range.reference.algorithms.range_algorithm_mutating_algorithms.unique.complexity">Complexity</a>
           </h6>
 <p>
diff --git a/doc/html/range/reference/algorithms/range_algorithm_new_algorithms.html b/doc/html/range/reference/algorithms/range_algorithm_new_algorithms.html
index 7b34570..7976d61 100644
--- a/doc/html/range/reference/algorithms/range_algorithm_new_algorithms.html
+++ b/doc/html/range/reference/algorithms/range_algorithm_new_algorithms.html
@@ -3,7 +3,7 @@
 <meta http-equiv="Content-Type" content="text/html; charset=US-ASCII">
 <title>New algorithms</title>
 <link rel="stylesheet" href="../../../../../../../doc/html/boostbook.css" type="text/css">
-<meta name="generator" content="DocBook XSL Stylesheets V1.75.1">
+<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="../algorithms.html" title="Range Algorithm">
 <link rel="prev" href="permutation_algorithms/prev_permutation.html" title="prev_permutation">
@@ -34,6 +34,8 @@
           for_each</a></span></dt>
 <dt><span class="section"><a href="range_algorithm_new_algorithms/insert.html">
           insert</a></span></dt>
+<dt><span class="section"><a href="range_algorithm_new_algorithms/iota.html">
+          iota</a></span></dt>
 <dt><span class="section"><a href="range_algorithm_new_algorithms/overwrite.html">
           overwrite</a></span></dt>
 <dt><span class="section"><a href="range_algorithm_new_algorithms/push_back.html">
diff --git a/doc/html/range/reference/algorithms/range_algorithm_new_algorithms/erase.html b/doc/html/range/reference/algorithms/range_algorithm_new_algorithms/erase.html
index 3520dba..e3d64a6 100644
--- a/doc/html/range/reference/algorithms/range_algorithm_new_algorithms/erase.html
+++ b/doc/html/range/reference/algorithms/range_algorithm_new_algorithms/erase.html
@@ -3,7 +3,7 @@
 <meta http-equiv="Content-Type" content="text/html; charset=US-ASCII">
 <title>erase</title>
 <link rel="stylesheet" href="../../../../../../../../doc/html/boostbook.css" type="text/css">
-<meta name="generator" content="DocBook XSL Stylesheets V1.75.1">
+<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="../range_algorithm_new_algorithms.html" title="New algorithms">
 <link rel="prev" href="../range_algorithm_new_algorithms.html" title="New algorithms">
@@ -28,7 +28,7 @@
           erase</a>
 </h5></div></div></div>
 <a name="range.reference.algorithms.range_algorithm_new_algorithms.erase.prototype"></a><h6>
-<a name="id3001648"></a>
+<a name="id714130"></a>
             <a class="link" href="erase.html#range.reference.algorithms.range_algorithm_new_algorithms.erase.prototype">Prototype</a>
           </h6>
 <p>
@@ -44,7 +44,7 @@
 <p>
           </p>
 <a name="range.reference.algorithms.range_algorithm_new_algorithms.erase.description"></a><h6>
-<a name="id3001804"></a>
+<a name="id714284"></a>
             <a class="link" href="erase.html#range.reference.algorithms.range_algorithm_new_algorithms.erase.description">Description</a>
           </h6>
 <p>
@@ -53,14 +53,14 @@
             <code class="computeroutput"><span class="identifier">target</span></code>.
           </p>
 <a name="range.reference.algorithms.range_algorithm_new_algorithms.erase.definition"></a><h6>
-<a name="id3001865"></a>
+<a name="id714340"></a>
             <a class="link" href="erase.html#range.reference.algorithms.range_algorithm_new_algorithms.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.range_algorithm_new_algorithms.erase.requirements"></a><h6>
-<a name="id3001939"></a>
+<a name="id714411"></a>
             <a class="link" href="erase.html#range.reference.algorithms.range_algorithm_new_algorithms.erase.requirements">Requirements</a>
           </h6>
 <div class="orderedlist"><ol class="orderedlist" type="1"><li class="listitem">
@@ -68,7 +68,7 @@
               erase of an iterator range.
             </li></ol></div>
 <a name="range.reference.algorithms.range_algorithm_new_algorithms.erase.complexity"></a><h6>
-<a name="id3001985"></a>
+<a name="id714454"></a>
             <a class="link" href="erase.html#range.reference.algorithms.range_algorithm_new_algorithms.erase.complexity">Complexity</a>
           </h6>
 <p>
diff --git a/doc/html/range/reference/algorithms/range_algorithm_new_algorithms/for_each.html b/doc/html/range/reference/algorithms/range_algorithm_new_algorithms/for_each.html
index 4a1cb75..dfe62c3 100644
--- a/doc/html/range/reference/algorithms/range_algorithm_new_algorithms/for_each.html
+++ b/doc/html/range/reference/algorithms/range_algorithm_new_algorithms/for_each.html
@@ -3,7 +3,7 @@
 <meta http-equiv="Content-Type" content="text/html; charset=US-ASCII">
 <title>for_each</title>
 <link rel="stylesheet" href="../../../../../../../../doc/html/boostbook.css" type="text/css">
-<meta name="generator" content="DocBook XSL Stylesheets V1.75.1">
+<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="../range_algorithm_new_algorithms.html" title="New algorithms">
 <link rel="prev" href="erase.html" title="erase">
@@ -28,7 +28,7 @@
           for_each</a>
 </h5></div></div></div>
 <a name="range.reference.algorithms.range_algorithm_new_algorithms.for_each.prototype"></a><h6>
-<a name="id3002057"></a>
+<a name="id714521"></a>
             <a class="link" href="for_each.html#range.reference.algorithms.range_algorithm_new_algorithms.for_each.prototype">Prototype</a>
           </h6>
 <p>
@@ -73,7 +73,7 @@
 <p>
           </p>
 <a name="range.reference.algorithms.range_algorithm_new_algorithms.for_each.description"></a><h6>
-<a name="id3002641"></a>
+<a name="id715097"></a>
             <a class="link" href="for_each.html#range.reference.algorithms.range_algorithm_new_algorithms.for_each.description">Description</a>
           </h6>
 <p>
@@ -89,14 +89,14 @@
             It is safe to call this function with unequal length ranges.
           </p>
 <a name="range.reference.algorithms.range_algorithm_new_algorithms.for_each.definition"></a><h6>
-<a name="id3002805"></a>
+<a name="id715253"></a>
             <a class="link" href="for_each.html#range.reference.algorithms.range_algorithm_new_algorithms.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.range_algorithm_new_algorithms.for_each.requirements"></a><h6>
-<a name="id3002880"></a>
+<a name="id715324"></a>
             <a class="link" href="for_each.html#range.reference.algorithms.range_algorithm_new_algorithms.for_each.requirements">Requirements</a>
           </h6>
 <div class="orderedlist"><ol class="orderedlist" type="1">
@@ -126,7 +126,7 @@
             </li>
 </ol></div>
 <a name="range.reference.algorithms.range_algorithm_new_algorithms.for_each.complexity"></a><h6>
-<a name="id3003035"></a>
+<a name="id715469"></a>
             <a class="link" href="for_each.html#range.reference.algorithms.range_algorithm_new_algorithms.for_each.complexity">Complexity</a>
           </h6>
 <p>
diff --git a/doc/html/range/reference/algorithms/range_algorithm_new_algorithms/insert.html b/doc/html/range/reference/algorithms/range_algorithm_new_algorithms/insert.html
index fc06253..e0aa512 100644
--- a/doc/html/range/reference/algorithms/range_algorithm_new_algorithms/insert.html
+++ b/doc/html/range/reference/algorithms/range_algorithm_new_algorithms/insert.html
@@ -3,11 +3,11 @@
 <meta http-equiv="Content-Type" content="text/html; charset=US-ASCII">
 <title>insert</title>
 <link rel="stylesheet" href="../../../../../../../../doc/html/boostbook.css" type="text/css">
-<meta name="generator" content="DocBook XSL Stylesheets V1.75.1">
+<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="../range_algorithm_new_algorithms.html" title="New algorithms">
 <link rel="prev" href="for_each.html" title="for_each">
-<link rel="next" href="overwrite.html" title="overwrite">
+<link rel="next" href="iota.html" title="iota">
 </head>
 <body bgcolor="white" text="black" link="#0000FF" vlink="#840084" alink="#0000FF">
 <table cellpadding="2" width="100%"><tr>
@@ -20,7 +20,7 @@
 </tr></table>
 <hr>
 <div class="spirit-nav">
-<a accesskey="p" href="for_each.html"><img src="../../../../../../../../doc/html/images/prev.png" alt="Prev"></a><a accesskey="u" href="../range_algorithm_new_algorithms.html"><img src="../../../../../../../../doc/html/images/up.png" alt="Up"></a><a accesskey="h" href="../../../../index.html"><img src="../../../../../../../../doc/html/images/home.png" alt="Home"></a><a accesskey="n" href="overwrite.html"><img src="../../../../../../../../doc/html/images/next.png" alt="Next"></a>
+<a accesskey="p" href="for_each.html"><img src="../../../../../../../../doc/html/images/prev.png" alt="Prev"></a><a accesskey="u" href="../range_algorithm_new_algorithms.html"><img src="../../../../../../../../doc/html/images/up.png" alt="Up"></a><a accesskey="h" href="../../../../index.html"><img src="../../../../../../../../doc/html/images/home.png" alt="Home"></a><a accesskey="n" href="iota.html"><img src="../../../../../../../../doc/html/images/next.png" alt="Next"></a>
 </div>
 <div class="section" title="insert">
 <div class="titlepage"><div><div><h5 class="title">
@@ -28,7 +28,7 @@
           insert</a>
 </h5></div></div></div>
 <a name="range.reference.algorithms.range_algorithm_new_algorithms.insert.prototype"></a><h6>
-<a name="id3003146"></a>
+<a name="id715575"></a>
             <a class="link" href="insert.html#range.reference.algorithms.range_algorithm_new_algorithms.insert.prototype">Prototype</a>
           </h6>
 <p>
@@ -45,7 +45,7 @@
 <p>
           </p>
 <a name="range.reference.algorithms.range_algorithm_new_algorithms.insert.description"></a><h6>
-<a name="id3003312"></a>
+<a name="id715740"></a>
             <a class="link" href="insert.html#range.reference.algorithms.range_algorithm_new_algorithms.insert.description">Description</a>
           </h6>
 <p>
@@ -55,14 +55,14 @@
             <code class="computeroutput"><span class="identifier">target</span></code>.
           </p>
 <a name="range.reference.algorithms.range_algorithm_new_algorithms.insert.definition"></a><h6>
-<a name="id3003385"></a>
+<a name="id715807"></a>
             <a class="link" href="insert.html#range.reference.algorithms.range_algorithm_new_algorithms.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.range_algorithm_new_algorithms.insert.requirements"></a><h6>
-<a name="id3003459"></a>
+<a name="id715878"></a>
             <a class="link" href="insert.html#range.reference.algorithms.range_algorithm_new_algorithms.insert.requirements">Requirements</a>
           </h6>
 <div class="orderedlist"><ol class="orderedlist" type="1">
@@ -82,7 +82,7 @@
             </li>
 </ol></div>
 <a name="range.reference.algorithms.range_algorithm_new_algorithms.insert.complexity"></a><h6>
-<a name="id3003554"></a>
+<a name="id715967"></a>
             <a class="link" href="insert.html#range.reference.algorithms.range_algorithm_new_algorithms.insert.complexity">Complexity</a>
           </h6>
 <p>
@@ -100,7 +100,7 @@
 </tr></table>
 <hr>
 <div class="spirit-nav">
-<a accesskey="p" href="for_each.html"><img src="../../../../../../../../doc/html/images/prev.png" alt="Prev"></a><a accesskey="u" href="../range_algorithm_new_algorithms.html"><img src="../../../../../../../../doc/html/images/up.png" alt="Up"></a><a accesskey="h" href="../../../../index.html"><img src="../../../../../../../../doc/html/images/home.png" alt="Home"></a><a accesskey="n" href="overwrite.html"><img src="../../../../../../../../doc/html/images/next.png" alt="Next"></a>
+<a accesskey="p" href="for_each.html"><img src="../../../../../../../../doc/html/images/prev.png" alt="Prev"></a><a accesskey="u" href="../range_algorithm_new_algorithms.html"><img src="../../../../../../../../doc/html/images/up.png" alt="Up"></a><a accesskey="h" href="../../../../index.html"><img src="../../../../../../../../doc/html/images/home.png" alt="Home"></a><a accesskey="n" href="iota.html"><img src="../../../../../../../../doc/html/images/next.png" alt="Next"></a>
 </div>
 </body>
 </html>
diff --git a/doc/html/range/reference/algorithms/range_algorithm_new_algorithms/iota.html b/doc/html/range/reference/algorithms/range_algorithm_new_algorithms/iota.html
new file mode 100644
index 0000000..c36f96d
--- /dev/null
+++ b/doc/html/range/reference/algorithms/range_algorithm_new_algorithms/iota.html
@@ -0,0 +1,96 @@
+<html>
+<head>
+<meta http-equiv="Content-Type" content="text/html; charset=US-ASCII">
+<title>iota</title>
+<link rel="stylesheet" href="../../../../../../../../doc/html/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="../range_algorithm_new_algorithms.html" title="New algorithms">
+<link rel="prev" href="insert.html" title="insert">
+<link rel="next" href="overwrite.html" title="overwrite">
+</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="../../../../../../../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="insert.html"><img src="../../../../../../../../doc/html/images/prev.png" alt="Prev"></a><a accesskey="u" href="../range_algorithm_new_algorithms.html"><img src="../../../../../../../../doc/html/images/up.png" alt="Up"></a><a accesskey="h" href="../../../../index.html"><img src="../../../../../../../../doc/html/images/home.png" alt="Home"></a><a accesskey="n" href="overwrite.html"><img src="../../../../../../../../doc/html/images/next.png" alt="Next"></a>
+</div>
+<div class="section" title="iota">
+<div class="titlepage"><div><div><h5 class="title">
+<a name="range.reference.algorithms.range_algorithm_new_algorithms.iota"></a><a class="link" href="iota.html" title="iota">
+          iota</a>
+</h5></div></div></div>
+<a name="range.reference.algorithms.range_algorithm_new_algorithms.iota.prototype"></a><h6>
+<a name="id716034"></a>
+            <a class="link" href="iota.html#range.reference.algorithms.range_algorithm_new_algorithms.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">SinglePassRange</span><span class="special">,</span> <span class="keyword">class</span> <span class="identifier">Value</span><span class="special">&gt;</span>
+<span class="identifier">iota</span><span class="special">(</span><span class="identifier">SinglePassRange</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.range_algorithm_new_algorithms.iota.description"></a><h6>
+<a name="id716150"></a>
+            <a class="link" href="iota.html#range.reference.algorithms.range_algorithm_new_algorithms.iota.description">Description</a>
+          </h6>
+<p>
+            <code class="computeroutput"><span class="identifier">iota</span></code> traverses forward
+            through <code class="computeroutput"><span class="identifier">rng</span></code>, each element
+            <code class="computeroutput"><span class="identifier">y</span></code> in <code class="computeroutput"><span class="identifier">rng</span></code>
+            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.range_algorithm_new_algorithms.iota.definition"></a><h6>
+<a name="id716288"></a>
+            <a class="link" href="iota.html#range.reference.algorithms.range_algorithm_new_algorithms.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.range_algorithm_new_algorithms.iota.requirements"></a><h6>
+<a name="id716360"></a>
+            <a class="link" href="iota.html#range.reference.algorithms.range_algorithm_new_algorithms.iota.requirements">Requirements</a>
+          </h6>
+<div class="orderedlist"><ol class="orderedlist" type="1">
+<li class="listitem">
+<code class="computeroutput"><span class="identifier">SinglePassRange</span></code> is
+              a model of the <a class="link" href="../../../concepts/single_pass_range.html" title="Single Pass Range">Single
+              Pass Range</a> Concept.
+            </li>
+<li class="listitem">
+<code class="computeroutput"><span class="identifier">Value</span></code> is a model of
+              the <code class="computeroutput"><span class="identifier">Incrementable</span></code> Concept.
+            </li>
+</ol></div>
+<a name="range.reference.algorithms.range_algorithm_new_algorithms.iota.complexity"></a><h6>
+<a name="id716434"></a>
+            <a class="link" href="iota.html#range.reference.algorithms.range_algorithm_new_algorithms.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>.
+          </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>
+        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="insert.html"><img src="../../../../../../../../doc/html/images/prev.png" alt="Prev"></a><a accesskey="u" href="../range_algorithm_new_algorithms.html"><img src="../../../../../../../../doc/html/images/up.png" alt="Up"></a><a accesskey="h" href="../../../../index.html"><img src="../../../../../../../../doc/html/images/home.png" alt="Home"></a><a accesskey="n" href="overwrite.html"><img src="../../../../../../../../doc/html/images/next.png" alt="Next"></a>
+</div>
+</body>
+</html>
diff --git a/doc/html/range/reference/algorithms/range_algorithm_new_algorithms/overwrite.html b/doc/html/range/reference/algorithms/range_algorithm_new_algorithms/overwrite.html
index b856c39..189151b 100644
--- a/doc/html/range/reference/algorithms/range_algorithm_new_algorithms/overwrite.html
+++ b/doc/html/range/reference/algorithms/range_algorithm_new_algorithms/overwrite.html
@@ -3,10 +3,10 @@
 <meta http-equiv="Content-Type" content="text/html; charset=US-ASCII">
 <title>overwrite</title>
 <link rel="stylesheet" href="../../../../../../../../doc/html/boostbook.css" type="text/css">
-<meta name="generator" content="DocBook XSL Stylesheets V1.75.1">
+<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="../range_algorithm_new_algorithms.html" title="New algorithms">
-<link rel="prev" href="insert.html" title="insert">
+<link rel="prev" href="iota.html" title="iota">
 <link rel="next" href="push_back.html" title="push_back">
 </head>
 <body bgcolor="white" text="black" link="#0000FF" vlink="#840084" alink="#0000FF">
@@ -20,7 +20,7 @@
 </tr></table>
 <hr>
 <div class="spirit-nav">
-<a accesskey="p" href="insert.html"><img src="../../../../../../../../doc/html/images/prev.png" alt="Prev"></a><a accesskey="u" href="../range_algorithm_new_algorithms.html"><img src="../../../../../../../../doc/html/images/up.png" alt="Up"></a><a accesskey="h" href="../../../../index.html"><img src="../../../../../../../../doc/html/images/home.png" alt="Home"></a><a accesskey="n" href="push_back.html"><img src="../../../../../../../../doc/html/images/next.png" alt="Next"></a>
+<a accesskey="p" href="iota.html"><img src="../../../../../../../../doc/html/images/prev.png" alt="Prev"></a><a accesskey="u" href="../range_algorithm_new_algorithms.html"><img src="../../../../../../../../doc/html/images/up.png" alt="Up"></a><a accesskey="h" href="../../../../index.html"><img src="../../../../../../../../doc/html/images/home.png" alt="Home"></a><a accesskey="n" href="push_back.html"><img src="../../../../../../../../doc/html/images/next.png" alt="Next"></a>
 </div>
 <div class="section" title="overwrite">
 <div class="titlepage"><div><div><h5 class="title">
@@ -28,7 +28,7 @@
           overwrite</a>
 </h5></div></div></div>
 <a name="range.reference.algorithms.range_algorithm_new_algorithms.overwrite.prototype"></a><h6>
-<a name="id3003628"></a>
+<a name="id716511"></a>
             <a class="link" href="overwrite.html#range.reference.algorithms.range_algorithm_new_algorithms.overwrite.prototype">Prototype</a>
           </h6>
 <p>
@@ -44,7 +44,7 @@
 <p>
           </p>
 <a name="range.reference.algorithms.range_algorithm_new_algorithms.overwrite.description"></a><h6>
-<a name="id3003767"></a>
+<a name="id716646"></a>
             <a class="link" href="overwrite.html#range.reference.algorithms.range_algorithm_new_algorithms.overwrite.description">Description</a>
           </h6>
 <p>
@@ -53,14 +53,14 @@
             into the range <code class="computeroutput"><span class="identifier">to</span></code>.
           </p>
 <a name="range.reference.algorithms.range_algorithm_new_algorithms.overwrite.definition"></a><h6>
-<a name="id3003828"></a>
+<a name="id716703"></a>
             <a class="link" href="overwrite.html#range.reference.algorithms.range_algorithm_new_algorithms.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.range_algorithm_new_algorithms.overwrite.requirements"></a><h6>
-<a name="id3003902"></a>
+<a name="id716773"></a>
             <a class="link" href="overwrite.html#range.reference.algorithms.range_algorithm_new_algorithms.overwrite.requirements">Requirements</a>
           </h6>
 <div class="orderedlist"><ol class="orderedlist" type="1">
@@ -87,7 +87,7 @@
             </li>
 </ol></div>
 <a name="range.reference.algorithms.range_algorithm_new_algorithms.overwrite.complexity"></a><h6>
-<a name="id3004073"></a>
+<a name="id716934"></a>
             <a class="link" href="overwrite.html#range.reference.algorithms.range_algorithm_new_algorithms.overwrite.complexity">Complexity</a>
           </h6>
 <p>
@@ -105,7 +105,7 @@
 </tr></table>
 <hr>
 <div class="spirit-nav">
-<a accesskey="p" href="insert.html"><img src="../../../../../../../../doc/html/images/prev.png" alt="Prev"></a><a accesskey="u" href="../range_algorithm_new_algorithms.html"><img src="../../../../../../../../doc/html/images/up.png" alt="Up"></a><a accesskey="h" href="../../../../index.html"><img src="../../../../../../../../doc/html/images/home.png" alt="Home"></a><a accesskey="n" href="push_back.html"><img src="../../../../../../../../doc/html/images/next.png" alt="Next"></a>
+<a accesskey="p" href="iota.html"><img src="../../../../../../../../doc/html/images/prev.png" alt="Prev"></a><a accesskey="u" href="../range_algorithm_new_algorithms.html"><img src="../../../../../../../../doc/html/images/up.png" alt="Up"></a><a accesskey="h" href="../../../../index.html"><img src="../../../../../../../../doc/html/images/home.png" alt="Home"></a><a accesskey="n" href="push_back.html"><img src="../../../../../../../../doc/html/images/next.png" alt="Next"></a>
 </div>
 </body>
 </html>
diff --git a/doc/html/range/reference/algorithms/range_algorithm_new_algorithms/push_back.html b/doc/html/range/reference/algorithms/range_algorithm_new_algorithms/push_back.html
index 26741e2..1357275 100644
--- a/doc/html/range/reference/algorithms/range_algorithm_new_algorithms/push_back.html
+++ b/doc/html/range/reference/algorithms/range_algorithm_new_algorithms/push_back.html
@@ -3,7 +3,7 @@
 <meta http-equiv="Content-Type" content="text/html; charset=US-ASCII">
 <title>push_back</title>
 <link rel="stylesheet" href="../../../../../../../../doc/html/boostbook.css" type="text/css">
-<meta name="generator" content="DocBook XSL Stylesheets V1.75.1">
+<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="../range_algorithm_new_algorithms.html" title="New algorithms">
 <link rel="prev" href="overwrite.html" title="overwrite">
@@ -28,7 +28,7 @@
           push_back</a>
 </h5></div></div></div>
 <a name="range.reference.algorithms.range_algorithm_new_algorithms.push_back.prototype"></a><h6>
-<a name="id3004146"></a>
+<a name="id717001"></a>
             <a class="link" href="push_back.html#range.reference.algorithms.range_algorithm_new_algorithms.push_back.prototype">Prototype</a>
           </h6>
 <p>
@@ -44,7 +44,7 @@
 <p>
           </p>
 <a name="range.reference.algorithms.range_algorithm_new_algorithms.push_back.description"></a><h6>
-<a name="id3004285"></a>
+<a name="id717137"></a>
             <a class="link" href="push_back.html#range.reference.algorithms.range_algorithm_new_algorithms.push_back.description">Description</a>
           </h6>
 <p>
@@ -53,14 +53,14 @@
             to the back of the container <code class="computeroutput"><span class="identifier">target</span></code>.
           </p>
 <a name="range.reference.algorithms.range_algorithm_new_algorithms.push_back.definition"></a><h6>
-<a name="id3004346"></a>
+<a name="id717193"></a>
             <a class="link" href="push_back.html#range.reference.algorithms.range_algorithm_new_algorithms.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.range_algorithm_new_algorithms.push_back.requirements"></a><h6>
-<a name="id3004422"></a>
+<a name="id717265"></a>
             <a class="link" href="push_back.html#range.reference.algorithms.range_algorithm_new_algorithms.push_back.requirements">Requirements</a>
           </h6>
 <div class="orderedlist"><ol class="orderedlist" type="1">
@@ -80,7 +80,7 @@
             </li>
 </ol></div>
 <a name="range.reference.algorithms.range_algorithm_new_algorithms.push_back.complexity"></a><h6>
-<a name="id3004531"></a>
+<a name="id717368"></a>
             <a class="link" href="push_back.html#range.reference.algorithms.range_algorithm_new_algorithms.push_back.complexity">Complexity</a>
           </h6>
 <p>
diff --git a/doc/html/range/reference/algorithms/range_algorithm_new_algorithms/push_front.html b/doc/html/range/reference/algorithms/range_algorithm_new_algorithms/push_front.html
index 4afd63c..d91db73 100644
--- a/doc/html/range/reference/algorithms/range_algorithm_new_algorithms/push_front.html
+++ b/doc/html/range/reference/algorithms/range_algorithm_new_algorithms/push_front.html
@@ -3,7 +3,7 @@
 <meta http-equiv="Content-Type" content="text/html; charset=US-ASCII">
 <title>push_front</title>
 <link rel="stylesheet" href="../../../../../../../../doc/html/boostbook.css" type="text/css">
-<meta name="generator" content="DocBook XSL Stylesheets V1.75.1">
+<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="../range_algorithm_new_algorithms.html" title="New algorithms">
 <link rel="prev" href="push_back.html" title="push_back">
@@ -28,7 +28,7 @@
           push_front</a>
 </h5></div></div></div>
 <a name="range.reference.algorithms.range_algorithm_new_algorithms.push_front.prototype"></a><h6>
-<a name="id3004604"></a>
+<a name="id717434"></a>
             <a class="link" href="push_front.html#range.reference.algorithms.range_algorithm_new_algorithms.push_front.prototype">Prototype</a>
           </h6>
 <p>
@@ -44,7 +44,7 @@
 <p>
           </p>
 <a name="range.reference.algorithms.range_algorithm_new_algorithms.push_front.description"></a><h6>
-<a name="id3004742"></a>
+<a name="id717568"></a>
             <a class="link" href="push_front.html#range.reference.algorithms.range_algorithm_new_algorithms.push_front.description">Description</a>
           </h6>
 <p>
@@ -53,14 +53,14 @@
             to the front of the container <code class="computeroutput"><span class="identifier">target</span></code>.
           </p>
 <a name="range.reference.algorithms.range_algorithm_new_algorithms.push_front.definition"></a><h6>
-<a name="id3004804"></a>
+<a name="id717625"></a>
             <a class="link" href="push_front.html#range.reference.algorithms.range_algorithm_new_algorithms.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.range_algorithm_new_algorithms.push_front.requirements"></a><h6>
-<a name="id3004878"></a>
+<a name="id717696"></a>
             <a class="link" href="push_front.html#range.reference.algorithms.range_algorithm_new_algorithms.push_front.requirements">Requirements</a>
           </h6>
 <div class="orderedlist"><ol class="orderedlist" type="1">
@@ -80,7 +80,7 @@
             </li>
 </ol></div>
 <a name="range.reference.algorithms.range_algorithm_new_algorithms.push_front.complexity"></a><h6>
-<a name="id3004988"></a>
+<a name="id717799"></a>
             <a class="link" href="push_front.html#range.reference.algorithms.range_algorithm_new_algorithms.push_front.complexity">Complexity</a>
           </h6>
 <p>
diff --git a/doc/html/range/reference/algorithms/range_algorithm_new_algorithms/remove_erase.html b/doc/html/range/reference/algorithms/range_algorithm_new_algorithms/remove_erase.html
index f80666a..5963cab 100644
--- a/doc/html/range/reference/algorithms/range_algorithm_new_algorithms/remove_erase.html
+++ b/doc/html/range/reference/algorithms/range_algorithm_new_algorithms/remove_erase.html
@@ -3,7 +3,7 @@
 <meta http-equiv="Content-Type" content="text/html; charset=US-ASCII">
 <title>remove_erase</title>
 <link rel="stylesheet" href="../../../../../../../../doc/html/boostbook.css" type="text/css">
-<meta name="generator" content="DocBook XSL Stylesheets V1.75.1">
+<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="../range_algorithm_new_algorithms.html" title="New algorithms">
 <link rel="prev" href="push_front.html" title="push_front">
@@ -28,7 +28,7 @@
           remove_erase</a>
 </h5></div></div></div>
 <a name="range.reference.algorithms.range_algorithm_new_algorithms.remove_erase.prototype"></a><h6>
-<a name="id3005062"></a>
+<a name="id717866"></a>
             <a class="link" href="remove_erase.html#range.reference.algorithms.range_algorithm_new_algorithms.remove_erase.prototype">Prototype</a>
           </h6>
 <p>
@@ -44,7 +44,7 @@
 <p>
           </p>
 <a name="range.reference.algorithms.range_algorithm_new_algorithms.remove_erase.description"></a><h6>
-<a name="id3005199"></a>
+<a name="id718000"></a>
             <a class="link" href="remove_erase.html#range.reference.algorithms.range_algorithm_new_algorithms.remove_erase.description">Description</a>
           </h6>
 <p>
@@ -54,14 +54,14 @@
             algorithm which merely rearranges elements.
           </p>
 <a name="range.reference.algorithms.range_algorithm_new_algorithms.remove_erase.definition"></a><h6>
-<a name="id3005261"></a>
+<a name="id718057"></a>
             <a class="link" href="remove_erase.html#range.reference.algorithms.range_algorithm_new_algorithms.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.range_algorithm_new_algorithms.remove_erase.requirements"></a><h6>
-<a name="id3005336"></a>
+<a name="id718128"></a>
             <a class="link" href="remove_erase.html#range.reference.algorithms.range_algorithm_new_algorithms.remove_erase.requirements">Requirements</a>
           </h6>
 <div class="orderedlist"><ol class="orderedlist" type="1"><li class="listitem">
@@ -69,7 +69,7 @@
               erase of an iterator range.
             </li></ol></div>
 <a name="range.reference.algorithms.range_algorithm_new_algorithms.remove_erase.complexity"></a><h6>
-<a name="id3005383"></a>
+<a name="id718171"></a>
             <a class="link" href="remove_erase.html#range.reference.algorithms.range_algorithm_new_algorithms.remove_erase.complexity">Complexity</a>
           </h6>
 <p>
diff --git a/doc/html/range/reference/algorithms/range_algorithm_new_algorithms/remove_erase_if.html b/doc/html/range/reference/algorithms/range_algorithm_new_algorithms/remove_erase_if.html
index 0f4c190..4469f02 100644
--- a/doc/html/range/reference/algorithms/range_algorithm_new_algorithms/remove_erase_if.html
+++ b/doc/html/range/reference/algorithms/range_algorithm_new_algorithms/remove_erase_if.html
@@ -3,7 +3,7 @@
 <meta http-equiv="Content-Type" content="text/html; charset=US-ASCII">
 <title>remove_erase_if</title>
 <link rel="stylesheet" href="../../../../../../../../doc/html/boostbook.css" type="text/css">
-<meta name="generator" content="DocBook XSL Stylesheets V1.75.1">
+<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="../range_algorithm_new_algorithms.html" title="New algorithms">
 <link rel="prev" href="remove_erase.html" title="remove_erase">
@@ -28,7 +28,7 @@
           remove_erase_if</a>
 </h5></div></div></div>
 <a name="range.reference.algorithms.range_algorithm_new_algorithms.remove_erase_if.prototype"></a><h6>
-<a name="id3005455"></a>
+<a name="id718238"></a>
             <a class="link" href="remove_erase_if.html#range.reference.algorithms.range_algorithm_new_algorithms.remove_erase_if.prototype">Prototype</a>
           </h6>
 <p>
@@ -44,7 +44,7 @@
 <p>
           </p>
 <a name="range.reference.algorithms.range_algorithm_new_algorithms.remove_erase_if.description"></a><h6>
-<a name="id3005584"></a>
+<a name="id718362"></a>
             <a class="link" href="remove_erase_if.html#range.reference.algorithms.range_algorithm_new_algorithms.remove_erase_if.description">Description</a>
           </h6>
 <p>
@@ -55,14 +55,14 @@
             algorithm which merely rearranges elements.
           </p>
 <a name="range.reference.algorithms.range_algorithm_new_algorithms.remove_erase_if.definition"></a><h6>
-<a name="id3005671"></a>
+<a name="id718443"></a>
             <a class="link" href="remove_erase_if.html#range.reference.algorithms.range_algorithm_new_algorithms.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.range_algorithm_new_algorithms.remove_erase_if.requirements"></a><h6>
-<a name="id3005744"></a>
+<a name="id718513"></a>
             <a class="link" href="remove_erase_if.html#range.reference.algorithms.range_algorithm_new_algorithms.remove_erase_if.requirements">Requirements</a>
           </h6>
 <div class="orderedlist"><ol class="orderedlist" type="1">
@@ -76,7 +76,7 @@
             </li>
 </ol></div>
 <a name="range.reference.algorithms.range_algorithm_new_algorithms.remove_erase_if.complexity"></a><h6>
-<a name="id3005816"></a>
+<a name="id718581"></a>
             <a class="link" href="remove_erase_if.html#range.reference.algorithms.range_algorithm_new_algorithms.remove_erase_if.complexity">Complexity</a>
           </h6>
 <p>
diff --git a/doc/html/range/reference/algorithms/range_algorithm_non_mutating_algorithms.html b/doc/html/range/reference/algorithms/range_algorithm_non_mutating_algorithms.html
index 87820b8..2e8a2d1 100644
--- a/doc/html/range/reference/algorithms/range_algorithm_non_mutating_algorithms.html
+++ b/doc/html/range/reference/algorithms/range_algorithm_non_mutating_algorithms.html
@@ -3,7 +3,7 @@
 <meta http-equiv="Content-Type" content="text/html; charset=US-ASCII">
 <title>Non-mutating algorithms</title>
 <link rel="stylesheet" href="../../../../../../../doc/html/boostbook.css" type="text/css">
-<meta name="generator" content="DocBook XSL Stylesheets V1.75.1">
+<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="../algorithms.html" title="Range Algorithm">
 <link rel="prev" href="range_algorithm_mutating_algorithms/unique.html" title="Range Algorithm - unique">
diff --git a/doc/html/range/reference/algorithms/range_algorithm_non_mutating_algorithms/adjacent_find.html b/doc/html/range/reference/algorithms/range_algorithm_non_mutating_algorithms/adjacent_find.html
index e45a101..d14634a 100644
--- a/doc/html/range/reference/algorithms/range_algorithm_non_mutating_algorithms/adjacent_find.html
+++ b/doc/html/range/reference/algorithms/range_algorithm_non_mutating_algorithms/adjacent_find.html
@@ -3,7 +3,7 @@
 <meta http-equiv="Content-Type" content="text/html; charset=US-ASCII">
 <title>Range Algorithm - adjacent_find</title>
 <link rel="stylesheet" href="../../../../../../../../doc/html/boostbook.css" type="text/css">
-<meta name="generator" content="DocBook XSL Stylesheets V1.75.1">
+<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="../range_algorithm_non_mutating_algorithms.html" title="Non-mutating algorithms">
 <link rel="prev" href="../range_algorithm_non_mutating_algorithms.html" title="Non-mutating algorithms">
@@ -28,7 +28,7 @@
           Range Algorithm - adjacent_find</a>
 </h5></div></div></div>
 <a name="range.reference.algorithms.range_algorithm_non_mutating_algorithms.adjacent_find.prototype"></a><h6>
-<a name="id2967769"></a>
+<a name="id683926"></a>
             <a class="link" href="adjacent_find.html#range.reference.algorithms.range_algorithm_non_mutating_algorithms.adjacent_find.prototype">Prototype</a>
           </h6>
 <p>
@@ -77,7 +77,7 @@
 <p>
           </p>
 <a name="range.reference.algorithms.range_algorithm_non_mutating_algorithms.adjacent_find.description"></a><h6>
-<a name="id2968758"></a>
+<a name="id684902"></a>
             <a class="link" href="adjacent_find.html#range.reference.algorithms.range_algorithm_non_mutating_algorithms.adjacent_find.description">Description</a>
           </h6>
 <p>
@@ -98,14 +98,14 @@
             is <code class="computeroutput"><span class="keyword">true</span></code>.
           </p>
 <a name="range.reference.algorithms.range_algorithm_non_mutating_algorithms.adjacent_find.definition"></a><h6>
-<a name="id2968973"></a>
+<a name="id685110"></a>
             <a class="link" href="adjacent_find.html#range.reference.algorithms.range_algorithm_non_mutating_algorithms.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.range_algorithm_non_mutating_algorithms.adjacent_find.requirements"></a><h6>
-<a name="id2969047"></a>
+<a name="id685180"></a>
             <a class="link" href="adjacent_find.html#range.reference.algorithms.range_algorithm_non_mutating_algorithms.adjacent_find.requirements">Requirements</a>
           </h6>
 <p>
@@ -143,7 +143,7 @@
             </li>
 </ul></div>
 <a name="range.reference.algorithms.range_algorithm_non_mutating_algorithms.adjacent_find.complexity"></a><h6>
-<a name="id2969233"></a>
+<a name="id685353"></a>
             <a class="link" href="adjacent_find.html#range.reference.algorithms.range_algorithm_non_mutating_algorithms.adjacent_find.complexity">Complexity</a>
           </h6>
 <p>
diff --git a/doc/html/range/reference/algorithms/range_algorithm_non_mutating_algorithms/binary_search.html b/doc/html/range/reference/algorithms/range_algorithm_non_mutating_algorithms/binary_search.html
index 247d8bc..e87ccbe 100644
--- a/doc/html/range/reference/algorithms/range_algorithm_non_mutating_algorithms/binary_search.html
+++ b/doc/html/range/reference/algorithms/range_algorithm_non_mutating_algorithms/binary_search.html
@@ -3,7 +3,7 @@
 <meta http-equiv="Content-Type" content="text/html; charset=US-ASCII">
 <title>binary_search</title>
 <link rel="stylesheet" href="../../../../../../../../doc/html/boostbook.css" type="text/css">
-<meta name="generator" content="DocBook XSL Stylesheets V1.75.1">
+<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="../range_algorithm_non_mutating_algorithms.html" title="Non-mutating algorithms">
 <link rel="prev" href="adjacent_find.html" title="Range Algorithm - adjacent_find">
@@ -28,7 +28,7 @@
           binary_search</a>
 </h5></div></div></div>
 <a name="range.reference.algorithms.range_algorithm_non_mutating_algorithms.binary_search.prototype"></a><h6>
-<a name="id2969340"></a>
+<a name="id685455"></a>
             <a class="link" href="binary_search.html#range.reference.algorithms.range_algorithm_non_mutating_algorithms.binary_search.prototype">Prototype</a>
           </h6>
 <p>
@@ -43,7 +43,7 @@
 <p>
           </p>
 <a name="range.reference.algorithms.range_algorithm_non_mutating_algorithms.binary_search.description"></a><h6>
-<a name="id2969624"></a>
+<a name="id685734"></a>
             <a class="link" href="binary_search.html#range.reference.algorithms.range_algorithm_non_mutating_algorithms.binary_search.description">Description</a>
           </h6>
 <p>
@@ -53,14 +53,14 @@
             range <code class="computeroutput"><span class="identifier">rng</span></code>.
           </p>
 <a name="range.reference.algorithms.range_algorithm_non_mutating_algorithms.binary_search.definition"></a><h6>
-<a name="id2969697"></a>
+<a name="id685801"></a>
             <a class="link" href="binary_search.html#range.reference.algorithms.range_algorithm_non_mutating_algorithms.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.range_algorithm_non_mutating_algorithms.binary_search.requirements"></a><h6>
-<a name="id2969772"></a>
+<a name="id685873"></a>
             <a class="link" href="binary_search.html#range.reference.algorithms.range_algorithm_non_mutating_algorithms.binary_search.requirements">Requirements</a>
           </h6>
 <p>
@@ -111,7 +111,7 @@
             </li>
 </ul></div>
 <a name="range.reference.algorithms.range_algorithm_non_mutating_algorithms.binary_search.precondition_"></a><h6>
-<a name="id2970031"></a>
+<a name="id686117"></a>
             <a class="link" href="binary_search.html#range.reference.algorithms.range_algorithm_non_mutating_algorithms.binary_search.precondition_">Precondition:</a>
           </h6>
 <p>
@@ -129,7 +129,7 @@
             order according to the function object <code class="computeroutput"><span class="identifier">pred</span></code>.
           </p>
 <a name="range.reference.algorithms.range_algorithm_non_mutating_algorithms.binary_search.complexity"></a><h6>
-<a name="id2970130"></a>
+<a name="id686210"></a>
             <a class="link" href="binary_search.html#range.reference.algorithms.range_algorithm_non_mutating_algorithms.binary_search.complexity">Complexity</a>
           </h6>
 <p>
diff --git a/doc/html/range/reference/algorithms/range_algorithm_non_mutating_algorithms/count.html b/doc/html/range/reference/algorithms/range_algorithm_non_mutating_algorithms/count.html
index bdfc489..3e36aa5 100644
--- a/doc/html/range/reference/algorithms/range_algorithm_non_mutating_algorithms/count.html
+++ b/doc/html/range/reference/algorithms/range_algorithm_non_mutating_algorithms/count.html
@@ -3,7 +3,7 @@
 <meta http-equiv="Content-Type" content="text/html; charset=US-ASCII">
 <title>count</title>
 <link rel="stylesheet" href="../../../../../../../../doc/html/boostbook.css" type="text/css">
-<meta name="generator" content="DocBook XSL Stylesheets V1.75.1">
+<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="../range_algorithm_non_mutating_algorithms.html" title="Non-mutating algorithms">
 <link rel="prev" href="binary_search.html" title="binary_search">
@@ -28,7 +28,7 @@
           count</a>
 </h5></div></div></div>
 <a name="range.reference.algorithms.range_algorithm_non_mutating_algorithms.count.prototype"></a><h6>
-<a name="id2970306"></a>
+<a name="id686377"></a>
             <a class="link" href="count.html#range.reference.algorithms.range_algorithm_non_mutating_algorithms.count.prototype">Prototype</a>
           </h6>
 <p>
@@ -45,7 +45,7 @@
 <p>
           </p>
 <a name="range.reference.algorithms.range_algorithm_non_mutating_algorithms.count.description"></a><h6>
-<a name="id2970606"></a>
+<a name="id686672"></a>
             <a class="link" href="count.html#range.reference.algorithms.range_algorithm_non_mutating_algorithms.count.description">Description</a>
           </h6>
 <p>
@@ -55,14 +55,14 @@
             is <code class="computeroutput"><span class="keyword">true</span></code>.
           </p>
 <a name="range.reference.algorithms.range_algorithm_non_mutating_algorithms.count.definition"></a><h6>
-<a name="id2970698"></a>
+<a name="id686759"></a>
             <a class="link" href="count.html#range.reference.algorithms.range_algorithm_non_mutating_algorithms.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.range_algorithm_non_mutating_algorithms.count.requirements"></a><h6>
-<a name="id2970772"></a>
+<a name="id686830"></a>
             <a class="link" href="count.html#range.reference.algorithms.range_algorithm_non_mutating_algorithms.count.requirements">Requirements</a>
           </h6>
 <div class="itemizedlist"><ul class="itemizedlist" type="disc">
@@ -85,7 +85,7 @@
             </li>
 </ul></div>
 <a name="range.reference.algorithms.range_algorithm_non_mutating_algorithms.count.complexity"></a><h6>
-<a name="id2970901"></a>
+<a name="id686950"></a>
             <a class="link" href="count.html#range.reference.algorithms.range_algorithm_non_mutating_algorithms.count.complexity">Complexity</a>
           </h6>
 <p>
diff --git a/doc/html/range/reference/algorithms/range_algorithm_non_mutating_algorithms/equal.html b/doc/html/range/reference/algorithms/range_algorithm_non_mutating_algorithms/equal.html
index d6d54a1..bb6187c 100644
--- a/doc/html/range/reference/algorithms/range_algorithm_non_mutating_algorithms/equal.html
+++ b/doc/html/range/reference/algorithms/range_algorithm_non_mutating_algorithms/equal.html
@@ -3,7 +3,7 @@
 <meta http-equiv="Content-Type" content="text/html; charset=US-ASCII">
 <title>equal</title>
 <link rel="stylesheet" href="../../../../../../../../doc/html/boostbook.css" type="text/css">
-<meta name="generator" content="DocBook XSL Stylesheets V1.75.1">
+<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="../range_algorithm_non_mutating_algorithms.html" title="Non-mutating algorithms">
 <link rel="prev" href="count.html" title="count">
@@ -28,7 +28,7 @@
           equal</a>
 </h5></div></div></div>
 <a name="range.reference.algorithms.range_algorithm_non_mutating_algorithms.equal.prototype"></a><h6>
-<a name="id2970973"></a>
+<a name="id687016"></a>
             <a class="link" href="equal.html#range.reference.algorithms.range_algorithm_non_mutating_algorithms.equal.prototype">Prototype</a>
           </h6>
 <p>
@@ -53,7 +53,7 @@
 <p>
           </p>
 <a name="range.reference.algorithms.range_algorithm_non_mutating_algorithms.equal.description"></a><h6>
-<a name="id2971261"></a>
+<a name="id687299"></a>
             <a class="link" href="equal.html#range.reference.algorithms.range_algorithm_non_mutating_algorithms.equal.description">Description</a>
           </h6>
 <p>
@@ -71,14 +71,14 @@
             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.range_algorithm_non_mutating_algorithms.equal.definition"></a><h6>
-<a name="id2971506"></a>
+<a name="id687532"></a>
             <a class="link" href="equal.html#range.reference.algorithms.range_algorithm_non_mutating_algorithms.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.range_algorithm_non_mutating_algorithms.equal.requirements"></a><h6>
-<a name="id2971581"></a>
+<a name="id687603"></a>
             <a class="link" href="equal.html#range.reference.algorithms.range_algorithm_non_mutating_algorithms.equal.requirements">Requirements</a>
           </h6>
 <p>
@@ -139,7 +139,7 @@
             </li>
 </ul></div>
 <a name="range.reference.algorithms.range_algorithm_non_mutating_algorithms.equal.complexity"></a><h6>
-<a name="id2971878"></a>
+<a name="id687881"></a>
             <a class="link" href="equal.html#range.reference.algorithms.range_algorithm_non_mutating_algorithms.equal.complexity">Complexity</a>
           </h6>
 <p>
diff --git a/doc/html/range/reference/algorithms/range_algorithm_non_mutating_algorithms/equal_range.html b/doc/html/range/reference/algorithms/range_algorithm_non_mutating_algorithms/equal_range.html
index 94bd133..8ba9948 100644
--- a/doc/html/range/reference/algorithms/range_algorithm_non_mutating_algorithms/equal_range.html
+++ b/doc/html/range/reference/algorithms/range_algorithm_non_mutating_algorithms/equal_range.html
@@ -3,7 +3,7 @@
 <meta http-equiv="Content-Type" content="text/html; charset=US-ASCII">
 <title>equal_range</title>
 <link rel="stylesheet" href="../../../../../../../../doc/html/boostbook.css" type="text/css">
-<meta name="generator" content="DocBook XSL Stylesheets V1.75.1">
+<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="../range_algorithm_non_mutating_algorithms.html" title="Non-mutating algorithms">
 <link rel="prev" href="equal.html" title="equal">
@@ -28,7 +28,7 @@
           equal_range</a>
 </h5></div></div></div>
 <a name="range.reference.algorithms.range_algorithm_non_mutating_algorithms.equal_range.prototype"></a><h6>
-<a name="id2971979"></a>
+<a name="id687976"></a>
             <a class="link" href="equal_range.html#range.reference.algorithms.range_algorithm_non_mutating_algorithms.equal_range.prototype">Prototype</a>
           </h6>
 <p>
@@ -71,7 +71,7 @@
 <p>
           </p>
 <a name="range.reference.algorithms.range_algorithm_non_mutating_algorithms.equal_range.description"></a><h6>
-<a name="id2972861"></a>
+<a name="id688850"></a>
             <a class="link" href="equal_range.html#range.reference.algorithms.range_algorithm_non_mutating_algorithms.equal_range.description">Description</a>
           </h6>
 <p>
@@ -85,14 +85,14 @@
             is determined by <code class="computeroutput"><span class="identifier">pred</span></code>.
           </p>
 <a name="range.reference.algorithms.range_algorithm_non_mutating_algorithms.equal_range.definition"></a><h6>
-<a name="id2973015"></a>
+<a name="id688996"></a>
             <a class="link" href="equal_range.html#range.reference.algorithms.range_algorithm_non_mutating_algorithms.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.range_algorithm_non_mutating_algorithms.equal_range.requirements"></a><h6>
-<a name="id2973089"></a>
+<a name="id689068"></a>
             <a class="link" href="equal_range.html#range.reference.algorithms.range_algorithm_non_mutating_algorithms.equal_range.requirements">Requirements</a>
           </h6>
 <p>
@@ -143,7 +143,7 @@
             </li>
 </ul></div>
 <a name="range.reference.algorithms.range_algorithm_non_mutating_algorithms.equal_range.precondition_"></a><h6>
-<a name="id2973348"></a>
+<a name="id689312"></a>
             <a class="link" href="equal_range.html#range.reference.algorithms.range_algorithm_non_mutating_algorithms.equal_range.precondition_">Precondition:</a>
           </h6>
 <p>
@@ -155,7 +155,7 @@
             is ordered in ascending order according to <code class="computeroutput"><span class="identifier">pred</span></code>.
           </p>
 <a name="range.reference.algorithms.range_algorithm_non_mutating_algorithms.equal_range.complexity"></a><h6>
-<a name="id2973430"></a>
+<a name="id689388"></a>
             <a class="link" href="equal_range.html#range.reference.algorithms.range_algorithm_non_mutating_algorithms.equal_range.complexity">Complexity</a>
           </h6>
 <p>
diff --git a/doc/html/range/reference/algorithms/range_algorithm_non_mutating_algorithms/find.html b/doc/html/range/reference/algorithms/range_algorithm_non_mutating_algorithms/find.html
index 3e45381..05db375 100644
--- a/doc/html/range/reference/algorithms/range_algorithm_non_mutating_algorithms/find.html
+++ b/doc/html/range/reference/algorithms/range_algorithm_non_mutating_algorithms/find.html
@@ -3,7 +3,7 @@
 <meta http-equiv="Content-Type" content="text/html; charset=US-ASCII">
 <title>find</title>
 <link rel="stylesheet" href="../../../../../../../../doc/html/boostbook.css" type="text/css">
-<meta name="generator" content="DocBook XSL Stylesheets V1.75.1">
+<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="../range_algorithm_non_mutating_algorithms.html" title="Non-mutating algorithms">
 <link rel="prev" href="for_each.html" title="for_each">
@@ -28,7 +28,7 @@
           find</a>
 </h5></div></div></div>
 <a name="range.reference.algorithms.range_algorithm_non_mutating_algorithms.find.prototype"></a><h6>
-<a name="id2974122"></a>
+<a name="id690044"></a>
             <a class="link" href="find.html#range.reference.algorithms.range_algorithm_non_mutating_algorithms.find.prototype">Prototype</a>
           </h6>
 <p>
@@ -38,10 +38,6 @@
 <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>
 <span class="identifier">find</span><span class="special">(</span><span class="identifier">SinglePassRange</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">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="keyword">const</span> <span class="identifier">SinglePassRange</span><span class="special">&gt;::</span><span class="identifier">type</span>
-<span class="identifier">find</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">Value</span> <span class="identifier">val</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">SinglePassRange</span><span class="special">,</span>
@@ -49,19 +45,11 @@
     <span class="special">&gt;</span>
 <span class="keyword">typename</span> <span class="identifier">range_return</span><span class="special">&lt;</span><span class="identifier">SinglePassRange</span><span class="special">,</span> <span class="identifier">re</span><span class="special">&gt;::</span><span class="identifier">type</span>
 <span class="identifier">find</span><span class="special">(</span><span class="identifier">SinglePassRange</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="identifier">range_return_value</span> <span class="identifier">re</span><span class="special">,</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_return</span><span class="special">&lt;</span><span class="keyword">const</span> <span class="identifier">SinglePassRange</span><span class="special">,</span> <span class="identifier">re</span><span class="special">&gt;::</span><span class="identifier">type</span>
-<span class="identifier">find</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">Value</span> <span class="identifier">val</span><span class="special">);</span>
 </pre>
 <p>
           </p>
 <a name="range.reference.algorithms.range_algorithm_non_mutating_algorithms.find.description"></a><h6>
-<a name="id2974701"></a>
+<a name="id690333"></a>
             <a class="link" href="find.html#range.reference.algorithms.range_algorithm_non_mutating_algorithms.find.description">Description</a>
           </h6>
 <p>
@@ -72,14 +60,14 @@
             same manner as the returned iterator described above.
           </p>
 <a name="range.reference.algorithms.range_algorithm_non_mutating_algorithms.find.definition"></a><h6>
-<a name="id2974827"></a>
+<a name="id690450"></a>
             <a class="link" href="find.html#range.reference.algorithms.range_algorithm_non_mutating_algorithms.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.range_algorithm_non_mutating_algorithms.find.requirements"></a><h6>
-<a name="id2974902"></a>
+<a name="id690521"></a>
             <a class="link" href="find.html#range.reference.algorithms.range_algorithm_non_mutating_algorithms.find.requirements">Requirements</a>
           </h6>
 <div class="itemizedlist"><ul class="itemizedlist" type="disc">
@@ -100,7 +88,7 @@
             </li>
 </ul></div>
 <a name="range.reference.algorithms.range_algorithm_non_mutating_algorithms.find.complexity"></a><h6>
-<a name="id2975020"></a>
+<a name="id690630"></a>
             <a class="link" href="find.html#range.reference.algorithms.range_algorithm_non_mutating_algorithms.find.complexity">Complexity</a>
           </h6>
 <p>
diff --git a/doc/html/range/reference/algorithms/range_algorithm_non_mutating_algorithms/find_end.html b/doc/html/range/reference/algorithms/range_algorithm_non_mutating_algorithms/find_end.html
index 9412d18..b5ab6b0 100644
--- a/doc/html/range/reference/algorithms/range_algorithm_non_mutating_algorithms/find_end.html
+++ b/doc/html/range/reference/algorithms/range_algorithm_non_mutating_algorithms/find_end.html
@@ -3,7 +3,7 @@
 <meta http-equiv="Content-Type" content="text/html; charset=US-ASCII">
 <title>find_end</title>
 <link rel="stylesheet" href="../../../../../../../../doc/html/boostbook.css" type="text/css">
-<meta name="generator" content="DocBook XSL Stylesheets V1.75.1">
+<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="../range_algorithm_non_mutating_algorithms.html" title="Non-mutating algorithms">
 <link rel="prev" href="find.html" title="find">
@@ -28,7 +28,7 @@
           find_end</a>
 </h5></div></div></div>
 <a name="range.reference.algorithms.range_algorithm_non_mutating_algorithms.find_end.prototype"></a><h6>
-<a name="id2975092"></a>
+<a name="id690698"></a>
             <a class="link" href="find_end.html#range.reference.algorithms.range_algorithm_non_mutating_algorithms.find_end.prototype">Prototype</a>
           </h6>
 <p>
@@ -38,10 +38,6 @@
 <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>
 <span class="identifier">find_end</span><span class="special">(</span><span class="identifier">ForwardRange1</span><span class="special">&amp;</span> <span class="identifier">rng1</span><span class="special">,</span> <span class="keyword">const</span> <span class="identifier">ForwardRange2</span><span class="special">&amp;</span> <span class="identifier">rng2</span><span class="special">);</span>
 
-<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="keyword">const</span> <span class="identifier">ForwardRange1</span><span class="special">&gt;::</span><span class="identifier">type</span>
-<span class="identifier">find_end</span><span class="special">(</span><span class="keyword">const</span> <span class="identifier">ForwardRange1</span><span class="special">&amp;</span> <span class="identifier">rng1</span><span class="special">,</span> <span class="keyword">const</span> <span class="identifier">ForwardRange2</span><span class="special">&amp;</span> <span class="identifier">rng2</span><span class="special">);</span>
-
 <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">,</span>
@@ -50,15 +46,6 @@
 <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>
 <span class="identifier">find_end</span><span class="special">(</span><span class="identifier">ForwardRange1</span><span class="special">&amp;</span> <span class="identifier">rng1</span><span class="special">,</span> <span class="keyword">const</span> <span class="identifier">ForwardRange2</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="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">,</span>
-    <span class="keyword">class</span> <span class="identifier">BinaryPredicate</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">ForwardRange1</span><span class="special">&gt;::</span><span class="identifier">type</span>
-<span class="identifier">find_end</span><span class="special">(</span><span class="keyword">const</span> <span class="identifier">ForwardRange1</span><span class="special">&amp;</span> <span class="identifier">rng1</span><span class="special">,</span> <span class="keyword">const</span> <span class="identifier">ForwardRange2</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="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">ForwardRange1</span><span class="special">,</span>
@@ -67,14 +54,6 @@
 <span class="keyword">typename</span> <span class="identifier">range_return</span><span class="special">&lt;</span><span class="identifier">ForwardRange1</span><span class="special">,</span> <span class="identifier">re</span><span class="special">&gt;::</span><span class="identifier">type</span>
 <span class="identifier">find_end</span><span class="special">(</span><span class="identifier">ForwardRange1</span><span class="special">&amp;</span> <span class="identifier">rng1</span><span class="special">,</span> <span class="keyword">const</span> <span class="identifier">ForwardRange2</span><span class="special">&amp;</span> <span class="identifier">rng2</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">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_return</span><span class="special">&lt;</span><span class="keyword">const</span> <span class="identifier">ForwardRange1</span><span class="special">,</span> <span class="identifier">re</span><span class="special">&gt;::</span><span class="identifier">type</span>
-<span class="identifier">find_end</span><span class="special">(</span><span class="keyword">const</span> <span class="identifier">ForwardRange1</span><span class="special">&amp;</span> <span class="identifier">rng1</span><span class="special">,</span> <span class="keyword">const</span> <span class="identifier">ForwardRange2</span><span class="special">&amp;</span> <span class="identifier">rng2</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">ForwardRange1</span><span class="special">,</span>
@@ -83,20 +62,11 @@
     <span class="special">&gt;</span>
 <span class="keyword">typename</span> <span class="identifier">range_return</span><span class="special">&lt;</span><span class="identifier">ForwardRange1</span><span class="special">,</span> <span class="identifier">re</span><span class="special">&gt;::</span><span class="identifier">type</span>
 <span class="identifier">find_end</span><span class="special">(</span><span class="identifier">ForwardRange1</span><span class="special">&amp;</span> <span class="identifier">rng1</span><span class="special">,</span> <span class="keyword">const</span> <span class="identifier">ForwardRange2</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="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">ForwardRange1</span><span class="special">,</span>
-    <span class="keyword">class</span> <span class="identifier">ForwardRange2</span><span class="special">,</span>
-    <span class="keyword">class</span> <span class="identifier">BinaryPredicate</span>
-    <span class="special">&gt;</span>
-<span class="keyword">typename</span> <span class="identifier">range_return</span><span class="special">&lt;</span><span class="keyword">const</span> <span class="identifier">ForwardRange1</span><span class="special">,</span> <span class="identifier">re</span><span class="special">&gt;::</span><span class="identifier">type</span>
-<span class="identifier">find_end</span><span class="special">(</span><span class="keyword">const</span> <span class="identifier">ForwardRange1</span><span class="special">&amp;</span> <span class="identifier">rng1</span><span class="special">,</span> <span class="keyword">const</span> <span class="identifier">ForwardRange2</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>
 </pre>
 <p>
           </p>
 <a name="range.reference.algorithms.range_algorithm_non_mutating_algorithms.find_end.description"></a><h6>
-<a name="id2976440"></a>
+<a name="id691357"></a>
             <a class="link" href="find_end.html#range.reference.algorithms.range_algorithm_non_mutating_algorithms.find_end.description">Description</a>
           </h6>
 <p>
@@ -111,14 +81,14 @@
             same manner as the returned iterator described above.
           </p>
 <a name="range.reference.algorithms.range_algorithm_non_mutating_algorithms.find_end.definition"></a><h6>
-<a name="id2976576"></a>
+<a name="id691482"></a>
             <a class="link" href="find_end.html#range.reference.algorithms.range_algorithm_non_mutating_algorithms.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.range_algorithm_non_mutating_algorithms.find_end.requirements"></a><h6>
-<a name="id2976650"></a>
+<a name="id691555"></a>
             <a class="link" href="find_end.html#range.reference.algorithms.range_algorithm_non_mutating_algorithms.find_end.requirements">Requirements</a>
           </h6>
 <p>
@@ -178,7 +148,7 @@
             </li>
 </ul></div>
 <a name="range.reference.algorithms.range_algorithm_non_mutating_algorithms.find_end.complexity"></a><h6>
-<a name="id2976949"></a>
+<a name="id691833"></a>
             <a class="link" href="find_end.html#range.reference.algorithms.range_algorithm_non_mutating_algorithms.find_end.complexity">Complexity</a>
           </h6>
 <p>
diff --git a/doc/html/range/reference/algorithms/range_algorithm_non_mutating_algorithms/find_first_of.html b/doc/html/range/reference/algorithms/range_algorithm_non_mutating_algorithms/find_first_of.html
index 5f15b42..a8de6a4 100644
--- a/doc/html/range/reference/algorithms/range_algorithm_non_mutating_algorithms/find_first_of.html
+++ b/doc/html/range/reference/algorithms/range_algorithm_non_mutating_algorithms/find_first_of.html
@@ -3,7 +3,7 @@
 <meta http-equiv="Content-Type" content="text/html; charset=US-ASCII">
 <title>find_first_of</title>
 <link rel="stylesheet" href="../../../../../../../../doc/html/boostbook.css" type="text/css">
-<meta name="generator" content="DocBook XSL Stylesheets V1.75.1">
+<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="../range_algorithm_non_mutating_algorithms.html" title="Non-mutating algorithms">
 <link rel="prev" href="find_end.html" title="find_end">
@@ -28,7 +28,7 @@
           find_first_of</a>
 </h5></div></div></div>
 <a name="range.reference.algorithms.range_algorithm_non_mutating_algorithms.find_first_of.prototype"></a><h6>
-<a name="id2977132"></a>
+<a name="id692006"></a>
             <a class="link" href="find_first_of.html#range.reference.algorithms.range_algorithm_non_mutating_algorithms.find_first_of.prototype">Prototype</a>
           </h6>
 <p>
@@ -38,10 +38,6 @@
 <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>
 <span class="identifier">find_first_of</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="keyword">const</span> <span class="identifier">ForwardRange2</span><span class="special">&amp;</span> <span class="identifier">rng2</span><span class="special">);</span>
 
-<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="keyword">const</span> <span class="identifier">SinglePassRange1</span><span class="special">&gt;::</span><span class="identifier">type</span>
-<span class="identifier">find_first_of</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">ForwardRange2</span><span class="special">&amp;</span> <span class="identifier">rng2</span><span class="special">);</span>
-
 <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">,</span>
@@ -50,15 +46,6 @@
 <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>
 <span class="identifier">find_first_of</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="keyword">const</span> <span class="identifier">ForwardRange2</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="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">,</span>
-    <span class="keyword">class</span> <span class="identifier">BinaryPredicate</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">SinglePassRange1</span><span class="special">&gt;::</span><span class="identifier">type</span>
-<span class="identifier">find_first_of</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">ForwardRange2</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="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">SinglePassRange1</span><span class="special">,</span>
@@ -67,14 +54,6 @@
 <span class="keyword">typename</span> <span class="identifier">range_return</span><span class="special">&lt;</span><span class="identifier">SinglePassRange1</span><span class="special">,</span> <span class="identifier">re</span><span class="special">&gt;::</span><span class="identifier">type</span>
 <span class="identifier">find_first_of</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="keyword">const</span> <span class="identifier">ForwardRange2</span><span class="special">&amp;</span> <span class="identifier">rng2</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">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_return</span><span class="special">&lt;</span><span class="keyword">const</span> <span class="identifier">SinglePassRange1</span><span class="special">,</span> <span class="identifier">re</span><span class="special">&gt;::</span><span class="identifier">type</span>
-<span class="identifier">find_first_of</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">ForwardRange2</span><span class="special">&amp;</span> <span class="identifier">rng2</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">SinglePassRange1</span><span class="special">,</span>
@@ -83,20 +62,11 @@
     <span class="special">&gt;</span>
 <span class="keyword">typename</span> <span class="identifier">range_return</span><span class="special">&lt;</span><span class="identifier">SinglePassRange1</span><span class="special">,</span> <span class="identifier">re</span><span class="special">&gt;::</span><span class="identifier">type</span>
 <span class="identifier">find_first_of</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="keyword">const</span> <span class="identifier">ForwardRange2</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="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">SinglePassRange1</span><span class="special">,</span>
-    <span class="keyword">class</span> <span class="identifier">ForwardRange2</span><span class="special">,</span>
-    <span class="keyword">class</span> <span class="identifier">BinaryPredicate</span>
-    <span class="special">&gt;</span>
-<span class="keyword">typename</span> <span class="identifier">range_return</span><span class="special">&lt;</span><span class="keyword">const</span> <span class="identifier">SinglePassRange1</span><span class="special">,</span> <span class="identifier">re</span><span class="special">&gt;::</span><span class="identifier">type</span>
-<span class="identifier">find_first_of</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">ForwardRange2</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>
 </pre>
 <p>
           </p>
 <a name="range.reference.algorithms.range_algorithm_non_mutating_algorithms.find_first_of.description"></a><h6>
-<a name="id2978480"></a>
+<a name="id692666"></a>
             <a class="link" href="find_first_of.html#range.reference.algorithms.range_algorithm_non_mutating_algorithms.find_first_of.description">Description</a>
           </h6>
 <p>
@@ -116,14 +86,14 @@
             same manner as the returned iterator described above.
           </p>
 <a name="range.reference.algorithms.range_algorithm_non_mutating_algorithms.find_first_of.definition"></a><h6>
-<a name="id2978621"></a>
+<a name="id692797"></a>
             <a class="link" href="find_first_of.html#range.reference.algorithms.range_algorithm_non_mutating_algorithms.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.range_algorithm_non_mutating_algorithms.find_first_of.requirements"></a><h6>
-<a name="id2978697"></a>
+<a name="id692870"></a>
             <a class="link" href="find_first_of.html#range.reference.algorithms.range_algorithm_non_mutating_algorithms.find_first_of.requirements">Requirements</a>
           </h6>
 <p>
@@ -177,7 +147,7 @@
             </li>
 </ul></div>
 <a name="range.reference.algorithms.range_algorithm_non_mutating_algorithms.find_first_of.complexity"></a><h6>
-<a name="id2978954"></a>
+<a name="id693110"></a>
             <a class="link" href="find_first_of.html#range.reference.algorithms.range_algorithm_non_mutating_algorithms.find_first_of.complexity">Complexity</a>
           </h6>
 <p>
diff --git a/doc/html/range/reference/algorithms/range_algorithm_non_mutating_algorithms/find_if.html b/doc/html/range/reference/algorithms/range_algorithm_non_mutating_algorithms/find_if.html
index 424b833..07df166 100644
--- a/doc/html/range/reference/algorithms/range_algorithm_non_mutating_algorithms/find_if.html
+++ b/doc/html/range/reference/algorithms/range_algorithm_non_mutating_algorithms/find_if.html
@@ -3,7 +3,7 @@
 <meta http-equiv="Content-Type" content="text/html; charset=US-ASCII">
 <title>find_if</title>
 <link rel="stylesheet" href="../../../../../../../../doc/html/boostbook.css" type="text/css">
-<meta name="generator" content="DocBook XSL Stylesheets V1.75.1">
+<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="../range_algorithm_non_mutating_algorithms.html" title="Non-mutating algorithms">
 <link rel="prev" href="find_first_of.html" title="find_first_of">
@@ -28,7 +28,7 @@
           find_if</a>
 </h5></div></div></div>
 <a name="range.reference.algorithms.range_algorithm_non_mutating_algorithms.find_if.prototype"></a><h6>
-<a name="id2979052"></a>
+<a name="id693199"></a>
             <a class="link" href="find_if.html#range.reference.algorithms.range_algorithm_non_mutating_algorithms.find_if.prototype">Prototype</a>
           </h6>
 <p>
@@ -38,10 +38,6 @@
 <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>
 <span class="identifier">find_if</span><span class="special">(</span><span class="identifier">SinglePassRange</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">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="keyword">const</span> <span class="identifier">SinglePassRange</span><span class="special">&gt;::</span><span class="identifier">type</span>
-<span class="identifier">find_if</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">UnaryPredicate</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">SinglePassRange</span><span class="special">,</span>
@@ -49,19 +45,11 @@
     <span class="special">&gt;</span>
 <span class="keyword">typename</span> <span class="identifier">range_return</span><span class="special">&lt;</span><span class="identifier">SinglePassRange</span><span class="special">,</span> <span class="identifier">re</span><span class="special">&gt;::</span><span class="identifier">type</span>
 <span class="identifier">find_if</span><span class="special">(</span><span class="identifier">SinglePassRange</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">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">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_return</span><span class="special">&lt;</span><span class="keyword">const</span> <span class="identifier">SinglePassRange</span><span class="special">,</span> <span class="identifier">re</span><span class="special">&gt;::</span><span class="identifier">type</span>
-<span class="identifier">find_if</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">UnaryPredicate</span> <span class="identifier">pred</span><span class="special">);</span>
 </pre>
 <p>
           </p>
 <a name="range.reference.algorithms.range_algorithm_non_mutating_algorithms.find_if.description"></a><h6>
-<a name="id2979633"></a>
+<a name="id693489"></a>
             <a class="link" href="find_if.html#range.reference.algorithms.range_algorithm_non_mutating_algorithms.find_if.description">Description</a>
           </h6>
 <p>
@@ -76,14 +64,14 @@
             defines found in the same manner as the returned iterator described above.
           </p>
 <a name="range.reference.algorithms.range_algorithm_non_mutating_algorithms.find_if.definition"></a><h6>
-<a name="id2979770"></a>
+<a name="id693619"></a>
             <a class="link" href="find_if.html#range.reference.algorithms.range_algorithm_non_mutating_algorithms.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.range_algorithm_non_mutating_algorithms.find_if.requirements"></a><h6>
-<a name="id2979844"></a>
+<a name="id693689"></a>
             <a class="link" href="find_if.html#range.reference.algorithms.range_algorithm_non_mutating_algorithms.find_if.requirements">Requirements</a>
           </h6>
 <div class="itemizedlist"><ul class="itemizedlist" type="disc">
@@ -102,7 +90,7 @@
             </li>
 </ul></div>
 <a name="range.reference.algorithms.range_algorithm_non_mutating_algorithms.find_if.precondition_"></a><h6>
-<a name="id2979947"></a>
+<a name="id693785"></a>
             <a class="link" href="find_if.html#range.reference.algorithms.range_algorithm_non_mutating_algorithms.find_if.precondition_">Precondition:</a>
           </h6>
 <p>
@@ -110,7 +98,7 @@
             <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.range_algorithm_non_mutating_algorithms.find_if.complexity"></a><h6>
-<a name="id2980022"></a>
+<a name="id693855"></a>
             <a class="link" href="find_if.html#range.reference.algorithms.range_algorithm_non_mutating_algorithms.find_if.complexity">Complexity</a>
           </h6>
 <p>
diff --git a/doc/html/range/reference/algorithms/range_algorithm_non_mutating_algorithms/for_each.html b/doc/html/range/reference/algorithms/range_algorithm_non_mutating_algorithms/for_each.html
index 3c85cc0..f90bdc6 100644
--- a/doc/html/range/reference/algorithms/range_algorithm_non_mutating_algorithms/for_each.html
+++ b/doc/html/range/reference/algorithms/range_algorithm_non_mutating_algorithms/for_each.html
@@ -3,7 +3,7 @@
 <meta http-equiv="Content-Type" content="text/html; charset=US-ASCII">
 <title>for_each</title>
 <link rel="stylesheet" href="../../../../../../../../doc/html/boostbook.css" type="text/css">
-<meta name="generator" content="DocBook XSL Stylesheets V1.75.1">
+<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="../range_algorithm_non_mutating_algorithms.html" title="Non-mutating algorithms">
 <link rel="prev" href="equal_range.html" title="equal_range">
@@ -28,7 +28,7 @@
           for_each</a>
 </h5></div></div></div>
 <a name="range.reference.algorithms.range_algorithm_non_mutating_algorithms.for_each.prototype"></a><h6>
-<a name="id2973533"></a>
+<a name="id689482"></a>
             <a class="link" href="for_each.html#range.reference.algorithms.range_algorithm_non_mutating_algorithms.for_each.prototype">Prototype</a>
           </h6>
 <p>
@@ -49,7 +49,7 @@
 <p>
           </p>
 <a name="range.reference.algorithms.range_algorithm_non_mutating_algorithms.for_each.description"></a><h6>
-<a name="id2973762"></a>
+<a name="id689706"></a>
             <a class="link" href="for_each.html#range.reference.algorithms.range_algorithm_non_mutating_algorithms.for_each.description">Description</a>
           </h6>
 <p>
@@ -59,14 +59,14 @@
             <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.range_algorithm_non_mutating_algorithms.for_each.definition"></a><h6>
-<a name="id2973846"></a>
+<a name="id689786"></a>
             <a class="link" href="for_each.html#range.reference.algorithms.range_algorithm_non_mutating_algorithms.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.range_algorithm_non_mutating_algorithms.for_each.requirements"></a><h6>
-<a name="id2973920"></a>
+<a name="id689858"></a>
             <a class="link" href="for_each.html#range.reference.algorithms.range_algorithm_non_mutating_algorithms.for_each.requirements">Requirements</a>
           </h6>
 <div class="itemizedlist"><ul class="itemizedlist" type="disc">
@@ -90,7 +90,7 @@
             </li>
 </ul></div>
 <a name="range.reference.algorithms.range_algorithm_non_mutating_algorithms.for_each.complexity"></a><h6>
-<a name="id2974039"></a>
+<a name="id689966"></a>
             <a class="link" href="for_each.html#range.reference.algorithms.range_algorithm_non_mutating_algorithms.for_each.complexity">Complexity</a>
           </h6>
 <p>
diff --git a/doc/html/range/reference/algorithms/range_algorithm_non_mutating_algorithms/lexicographical_compare.html b/doc/html/range/reference/algorithms/range_algorithm_non_mutating_algorithms/lexicographical_compare.html
index 0cf9505..d10629d 100644
--- a/doc/html/range/reference/algorithms/range_algorithm_non_mutating_algorithms/lexicographical_compare.html
+++ b/doc/html/range/reference/algorithms/range_algorithm_non_mutating_algorithms/lexicographical_compare.html
@@ -3,7 +3,7 @@
 <meta http-equiv="Content-Type" content="text/html; charset=US-ASCII">
 <title>lexicographical_compare</title>
 <link rel="stylesheet" href="../../../../../../../../doc/html/boostbook.css" type="text/css">
-<meta name="generator" content="DocBook XSL Stylesheets V1.75.1">
+<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="../range_algorithm_non_mutating_algorithms.html" title="Non-mutating algorithms">
 <link rel="prev" href="find_if.html" title="find_if">
@@ -28,7 +28,7 @@
           lexicographical_compare</a>
 </h5></div></div></div>
 <a name="range.reference.algorithms.range_algorithm_non_mutating_algorithms.lexicographical_compare.prototype"></a><h6>
-<a name="id2980107"></a>
+<a name="id693934"></a>
             <a class="link" href="lexicographical_compare.html#range.reference.algorithms.range_algorithm_non_mutating_algorithms.lexicographical_compare.prototype">Prototype</a>
           </h6>
 <p>
@@ -53,7 +53,7 @@
 <p>
           </p>
 <a name="range.reference.algorithms.range_algorithm_non_mutating_algorithms.lexicographical_compare.description"></a><h6>
-<a name="id2980398"></a>
+<a name="id694218"></a>
             <a class="link" href="lexicographical_compare.html#range.reference.algorithms.range_algorithm_non_mutating_algorithms.lexicographical_compare.description">Description</a>
           </h6>
 <p>
@@ -73,14 +73,14 @@
             predicate versions.
           </p>
 <a name="range.reference.algorithms.range_algorithm_non_mutating_algorithms.lexicographical_compare.definition"></a><h6>
-<a name="id2980579"></a>
+<a name="id694385"></a>
             <a class="link" href="lexicographical_compare.html#range.reference.algorithms.range_algorithm_non_mutating_algorithms.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.range_algorithm_non_mutating_algorithms.lexicographical_compare.requirements"></a><h6>
-<a name="id2980656"></a>
+<a name="id694457"></a>
             <a class="link" href="lexicographical_compare.html#range.reference.algorithms.range_algorithm_non_mutating_algorithms.lexicographical_compare.requirements">Requirements</a>
           </h6>
 <p>
@@ -145,7 +145,7 @@
             </li>
 </ul></div>
 <a name="range.reference.algorithms.range_algorithm_non_mutating_algorithms.lexicographical_compare.complexity"></a><h6>
-<a name="id2981022"></a>
+<a name="id694801"></a>
             <a class="link" href="lexicographical_compare.html#range.reference.algorithms.range_algorithm_non_mutating_algorithms.lexicographical_compare.complexity">Complexity</a>
           </h6>
 <p>
diff --git a/doc/html/range/reference/algorithms/range_algorithm_non_mutating_algorithms/lower_bound.html b/doc/html/range/reference/algorithms/range_algorithm_non_mutating_algorithms/lower_bound.html
index 4e1f526..3eaa4e3 100644
--- a/doc/html/range/reference/algorithms/range_algorithm_non_mutating_algorithms/lower_bound.html
+++ b/doc/html/range/reference/algorithms/range_algorithm_non_mutating_algorithms/lower_bound.html
@@ -3,7 +3,7 @@
 <meta http-equiv="Content-Type" content="text/html; charset=US-ASCII">
 <title>lower_bound</title>
 <link rel="stylesheet" href="../../../../../../../../doc/html/boostbook.css" type="text/css">
-<meta name="generator" content="DocBook XSL Stylesheets V1.75.1">
+<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="../range_algorithm_non_mutating_algorithms.html" title="Non-mutating algorithms">
 <link rel="prev" href="lexicographical_compare.html" title="lexicographical_compare">
@@ -28,7 +28,7 @@
           lower_bound</a>
 </h5></div></div></div>
 <a name="range.reference.algorithms.range_algorithm_non_mutating_algorithms.lower_bound.prototype"></a><h6>
-<a name="id2981135"></a>
+<a name="id694907"></a>
             <a class="link" href="lower_bound.html#range.reference.algorithms.range_algorithm_non_mutating_algorithms.lower_bound.prototype">Prototype</a>
           </h6>
 <p>
@@ -38,10 +38,6 @@
 <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="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="keyword">const</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="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">Value</span> <span class="identifier">val</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>
@@ -49,19 +45,11 @@
     <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="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">&gt;</span>
-<span class="keyword">typename</span> <span class="identifier">range_return</span><span class="special">&lt;</span><span class="keyword">const</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="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">Value</span> <span class="identifier">val</span><span class="special">);</span>
 </pre>
 <p>
           </p>
 <a name="range.reference.algorithms.range_algorithm_non_mutating_algorithms.lower_bound.description"></a><h6>
-<a name="id2981715"></a>
+<a name="id695197"></a>
             <a class="link" href="lower_bound.html#range.reference.algorithms.range_algorithm_non_mutating_algorithms.lower_bound.description">Description</a>
           </h6>
 <p>
@@ -84,14 +72,14 @@
             same manner as the returned iterator described above.
           </p>
 <a name="range.reference.algorithms.range_algorithm_non_mutating_algorithms.lower_bound.definition"></a><h6>
-<a name="id2981915"></a>
+<a name="id695387"></a>
             <a class="link" href="lower_bound.html#range.reference.algorithms.range_algorithm_non_mutating_algorithms.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.range_algorithm_non_mutating_algorithms.lower_bound.requirements"></a><h6>
-<a name="id2981990"></a>
+<a name="id695459"></a>
             <a class="link" href="lower_bound.html#range.reference.algorithms.range_algorithm_non_mutating_algorithms.lower_bound.requirements">Requirements</a>
           </h6>
 <p>
@@ -142,7 +130,7 @@
             </li>
 </ul></div>
 <a name="range.reference.algorithms.range_algorithm_non_mutating_algorithms.lower_bound.precondition_"></a><h6>
-<a name="id2982250"></a>
+<a name="id695704"></a>
             <a class="link" href="lower_bound.html#range.reference.algorithms.range_algorithm_non_mutating_algorithms.lower_bound.precondition_">Precondition:</a>
           </h6>
 <p>
@@ -160,7 +148,7 @@
             order according to <code class="computeroutput"><span class="identifier">pred</span></code>.
           </p>
 <a name="range.reference.algorithms.range_algorithm_non_mutating_algorithms.lower_bound.complexity"></a><h6>
-<a name="id2982349"></a>
+<a name="id695796"></a>
             <a class="link" href="lower_bound.html#range.reference.algorithms.range_algorithm_non_mutating_algorithms.lower_bound.complexity">Complexity</a>
           </h6>
 <p>
diff --git a/doc/html/range/reference/algorithms/range_algorithm_non_mutating_algorithms/max_element.html b/doc/html/range/reference/algorithms/range_algorithm_non_mutating_algorithms/max_element.html
index 8ca03f7..552d3af 100644
--- a/doc/html/range/reference/algorithms/range_algorithm_non_mutating_algorithms/max_element.html
+++ b/doc/html/range/reference/algorithms/range_algorithm_non_mutating_algorithms/max_element.html
@@ -3,7 +3,7 @@
 <meta http-equiv="Content-Type" content="text/html; charset=US-ASCII">
 <title>max_element</title>
 <link rel="stylesheet" href="../../../../../../../../doc/html/boostbook.css" type="text/css">
-<meta name="generator" content="DocBook XSL Stylesheets V1.75.1">
+<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="../range_algorithm_non_mutating_algorithms.html" title="Non-mutating algorithms">
 <link rel="prev" href="lower_bound.html" title="lower_bound">
@@ -28,7 +28,7 @@
           max_element</a>
 </h5></div></div></div>
 <a name="range.reference.algorithms.range_algorithm_non_mutating_algorithms.max_element.prototype"></a><h6>
-<a name="id2982499"></a>
+<a name="id695936"></a>
             <a class="link" href="max_element.html#range.reference.algorithms.range_algorithm_non_mutating_algorithms.max_element.prototype">Prototype</a>
           </h6>
 <p>
@@ -84,7 +84,7 @@
 <p>
           </p>
 <a name="range.reference.algorithms.range_algorithm_non_mutating_algorithms.max_element.description"></a><h6>
-<a name="id2983495"></a>
+<a name="id696924"></a>
             <a class="link" href="max_element.html#range.reference.algorithms.range_algorithm_non_mutating_algorithms.max_element.description">Description</a>
           </h6>
 <p>
@@ -98,14 +98,14 @@
             same manner as the returned iterator described above.
           </p>
 <a name="range.reference.algorithms.range_algorithm_non_mutating_algorithms.max_element.definition"></a><h6>
-<a name="id2983599"></a>
+<a name="id697019"></a>
             <a class="link" href="max_element.html#range.reference.algorithms.range_algorithm_non_mutating_algorithms.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.range_algorithm_non_mutating_algorithms.max_element.requirements"></a><h6>
-<a name="id2983673"></a>
+<a name="id697092"></a>
             <a class="link" href="max_element.html#range.reference.algorithms.range_algorithm_non_mutating_algorithms.max_element.requirements">Requirements</a>
           </h6>
 <p>
@@ -142,7 +142,7 @@
             </li>
 </ul></div>
 <a name="range.reference.algorithms.range_algorithm_non_mutating_algorithms.max_element.complexity"></a><h6>
-<a name="id2983846"></a>
+<a name="id697255"></a>
             <a class="link" href="max_element.html#range.reference.algorithms.range_algorithm_non_mutating_algorithms.max_element.complexity">Complexity</a>
           </h6>
 <p>
diff --git a/doc/html/range/reference/algorithms/range_algorithm_non_mutating_algorithms/min_element.html b/doc/html/range/reference/algorithms/range_algorithm_non_mutating_algorithms/min_element.html
index 08903d1..675196b 100644
--- a/doc/html/range/reference/algorithms/range_algorithm_non_mutating_algorithms/min_element.html
+++ b/doc/html/range/reference/algorithms/range_algorithm_non_mutating_algorithms/min_element.html
@@ -3,7 +3,7 @@
 <meta http-equiv="Content-Type" content="text/html; charset=US-ASCII">
 <title>min_element</title>
 <link rel="stylesheet" href="../../../../../../../../doc/html/boostbook.css" type="text/css">
-<meta name="generator" content="DocBook XSL Stylesheets V1.75.1">
+<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="../range_algorithm_non_mutating_algorithms.html" title="Non-mutating algorithms">
 <link rel="prev" href="max_element.html" title="max_element">
@@ -28,7 +28,7 @@
           min_element</a>
 </h5></div></div></div>
 <a name="range.reference.algorithms.range_algorithm_non_mutating_algorithms.min_element.prototype"></a><h6>
-<a name="id2983954"></a>
+<a name="id697357"></a>
             <a class="link" href="min_element.html#range.reference.algorithms.range_algorithm_non_mutating_algorithms.min_element.prototype">Prototype</a>
           </h6>
 <p>
@@ -84,7 +84,7 @@
 <p>
           </p>
 <a name="range.reference.algorithms.range_algorithm_non_mutating_algorithms.min_element.description"></a><h6>
-<a name="id2984951"></a>
+<a name="id698344"></a>
             <a class="link" href="min_element.html#range.reference.algorithms.range_algorithm_non_mutating_algorithms.min_element.description">Description</a>
           </h6>
 <p>
@@ -98,14 +98,14 @@
             same manner as the returned iterator described above.
           </p>
 <a name="range.reference.algorithms.range_algorithm_non_mutating_algorithms.min_element.definition"></a><h6>
-<a name="id2985055"></a>
+<a name="id698440"></a>
             <a class="link" href="min_element.html#range.reference.algorithms.range_algorithm_non_mutating_algorithms.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.range_algorithm_non_mutating_algorithms.min_element.requirements"></a><h6>
-<a name="id2985130"></a>
+<a name="id698513"></a>
             <a class="link" href="min_element.html#range.reference.algorithms.range_algorithm_non_mutating_algorithms.min_element.requirements">Requirements</a>
           </h6>
 <p>
@@ -142,7 +142,7 @@
             </li>
 </ul></div>
 <a name="range.reference.algorithms.range_algorithm_non_mutating_algorithms.min_element.complexity"></a><h6>
-<a name="id2985304"></a>
+<a name="id698675"></a>
             <a class="link" href="min_element.html#range.reference.algorithms.range_algorithm_non_mutating_algorithms.min_element.complexity">Complexity</a>
           </h6>
 <p>
diff --git a/doc/html/range/reference/algorithms/range_algorithm_non_mutating_algorithms/mismatch.html b/doc/html/range/reference/algorithms/range_algorithm_non_mutating_algorithms/mismatch.html
index 5a168da..572dd69 100644
--- a/doc/html/range/reference/algorithms/range_algorithm_non_mutating_algorithms/mismatch.html
+++ b/doc/html/range/reference/algorithms/range_algorithm_non_mutating_algorithms/mismatch.html
@@ -3,7 +3,7 @@
 <meta http-equiv="Content-Type" content="text/html; charset=US-ASCII">
 <title>mismatch</title>
 <link rel="stylesheet" href="../../../../../../../../doc/html/boostbook.css" type="text/css">
-<meta name="generator" content="DocBook XSL Stylesheets V1.75.1">
+<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="../range_algorithm_non_mutating_algorithms.html" title="Non-mutating algorithms">
 <link rel="prev" href="min_element.html" title="min_element">
@@ -28,7 +28,7 @@
           mismatch</a>
 </h5></div></div></div>
 <a name="range.reference.algorithms.range_algorithm_non_mutating_algorithms.mismatch.prototype"></a><h6>
-<a name="id2985412"></a>
+<a name="id698775"></a>
             <a class="link" href="mismatch.html#range.reference.algorithms.range_algorithm_non_mutating_algorithms.mismatch.prototype">Prototype</a>
           </h6>
 <p>
@@ -106,7 +106,7 @@
 <p>
           </p>
 <a name="range.reference.algorithms.range_algorithm_non_mutating_algorithms.mismatch.description"></a><h6>
-<a name="id2987131"></a>
+<a name="id700480"></a>
             <a class="link" href="mismatch.html#range.reference.algorithms.range_algorithm_non_mutating_algorithms.mismatch.description">Description</a>
           </h6>
 <p>
@@ -124,14 +124,14 @@
             same manner as the returned iterator described above.
           </p>
 <a name="range.reference.algorithms.range_algorithm_non_mutating_algorithms.mismatch.definition"></a><h6>
-<a name="id2987273"></a>
+<a name="id700612"></a>
             <a class="link" href="mismatch.html#range.reference.algorithms.range_algorithm_non_mutating_algorithms.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.range_algorithm_non_mutating_algorithms.mismatch.requirements"></a><h6>
-<a name="id2987347"></a>
+<a name="id700685"></a>
             <a class="link" href="mismatch.html#range.reference.algorithms.range_algorithm_non_mutating_algorithms.mismatch.requirements">Requirements</a>
           </h6>
 <p>
@@ -192,14 +192,14 @@
             </li>
 </ul></div>
 <a name="range.reference.algorithms.range_algorithm_non_mutating_algorithms.mismatch.precondition_"></a><h6>
-<a name="id2987644"></a>
+<a name="id700965"></a>
             <a class="link" href="mismatch.html#range.reference.algorithms.range_algorithm_non_mutating_algorithms.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.range_algorithm_non_mutating_algorithms.mismatch.complexity"></a><h6>
-<a name="id2987721"></a>
+<a name="id701037"></a>
             <a class="link" href="mismatch.html#range.reference.algorithms.range_algorithm_non_mutating_algorithms.mismatch.complexity">Complexity</a>
           </h6>
 <p>
diff --git a/doc/html/range/reference/algorithms/range_algorithm_non_mutating_algorithms/search.html b/doc/html/range/reference/algorithms/range_algorithm_non_mutating_algorithms/search.html
index 1dcf8c0..03b528c 100644
--- a/doc/html/range/reference/algorithms/range_algorithm_non_mutating_algorithms/search.html
+++ b/doc/html/range/reference/algorithms/range_algorithm_non_mutating_algorithms/search.html
@@ -3,7 +3,7 @@
 <meta http-equiv="Content-Type" content="text/html; charset=US-ASCII">
 <title>search</title>
 <link rel="stylesheet" href="../../../../../../../../doc/html/boostbook.css" type="text/css">
-<meta name="generator" content="DocBook XSL Stylesheets V1.75.1">
+<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="../range_algorithm_non_mutating_algorithms.html" title="Non-mutating algorithms">
 <link rel="prev" href="mismatch.html" title="mismatch">
@@ -28,7 +28,7 @@
           search</a>
 </h5></div></div></div>
 <a name="range.reference.algorithms.range_algorithm_non_mutating_algorithms.search.prototype"></a><h6>
-<a name="id2987794"></a>
+<a name="id701103"></a>
             <a class="link" href="search.html#range.reference.algorithms.range_algorithm_non_mutating_algorithms.search.prototype">Prototype</a>
           </h6>
 <p>
@@ -96,7 +96,7 @@
 <p>
           </p>
 <a name="range.reference.algorithms.range_algorithm_non_mutating_algorithms.search.description"></a><h6>
-<a name="id2989144"></a>
+<a name="id702442"></a>
             <a class="link" href="search.html#range.reference.algorithms.range_algorithm_non_mutating_algorithms.search.description">Description</a>
           </h6>
 <p>
@@ -115,14 +115,14 @@
             same manner as the returned iterator described above.
           </p>
 <a name="range.reference.algorithms.range_algorithm_non_mutating_algorithms.search.definition"></a><h6>
-<a name="id2989320"></a>
+<a name="id702607"></a>
             <a class="link" href="search.html#range.reference.algorithms.range_algorithm_non_mutating_algorithms.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.range_algorithm_non_mutating_algorithms.search.requirements"></a><h6>
-<a name="id2989395"></a>
+<a name="id702678"></a>
             <a class="link" href="search.html#range.reference.algorithms.range_algorithm_non_mutating_algorithms.search.requirements">Requirements</a>
           </h6>
 <p>
@@ -183,7 +183,7 @@
             </li>
 </ul></div>
 <a name="range.reference.algorithms.range_algorithm_non_mutating_algorithms.search.complexity"></a><h6>
-<a name="id2989693"></a>
+<a name="id702956"></a>
             <a class="link" href="search.html#range.reference.algorithms.range_algorithm_non_mutating_algorithms.search.complexity">Complexity</a>
           </h6>
 <p>
diff --git a/doc/html/range/reference/algorithms/range_algorithm_non_mutating_algorithms/upper_bound.html b/doc/html/range/reference/algorithms/range_algorithm_non_mutating_algorithms/upper_bound.html
index 8db1558..e73149f 100644
--- a/doc/html/range/reference/algorithms/range_algorithm_non_mutating_algorithms/upper_bound.html
+++ b/doc/html/range/reference/algorithms/range_algorithm_non_mutating_algorithms/upper_bound.html
@@ -3,7 +3,7 @@
 <meta http-equiv="Content-Type" content="text/html; charset=US-ASCII">
 <title>upper_bound</title>
 <link rel="stylesheet" href="../../../../../../../../doc/html/boostbook.css" type="text/css">
-<meta name="generator" content="DocBook XSL Stylesheets V1.75.1">
+<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="../range_algorithm_non_mutating_algorithms.html" title="Non-mutating algorithms">
 <link rel="prev" href="search.html" title="search">
@@ -28,7 +28,7 @@
           upper_bound</a>
 </h5></div></div></div>
 <a name="range.reference.algorithms.range_algorithm_non_mutating_algorithms.upper_bound.prototype"></a><h6>
-<a name="id2989743"></a>
+<a name="id703000"></a>
             <a class="link" href="upper_bound.html#range.reference.algorithms.range_algorithm_non_mutating_algorithms.upper_bound.prototype">Prototype</a>
           </h6>
 <p>
@@ -38,10 +38,6 @@
 <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="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="keyword">const</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="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">Value</span> <span class="identifier">val</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>
@@ -49,19 +45,11 @@
     <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="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">&gt;</span>
-<span class="keyword">typename</span> <span class="identifier">range_return</span><span class="special">&lt;</span><span class="keyword">const</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="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">Value</span> <span class="identifier">val</span><span class="special">);</span>
 </pre>
 <p>
           </p>
 <a name="range.reference.algorithms.range_algorithm_non_mutating_algorithms.upper_bound.description"></a><h6>
-<a name="id2990323"></a>
+<a name="id703290"></a>
             <a class="link" href="upper_bound.html#range.reference.algorithms.range_algorithm_non_mutating_algorithms.upper_bound.description">Description</a>
           </h6>
 <p>
@@ -83,14 +71,14 @@
             same manner as the returned iterator described above.
           </p>
 <a name="range.reference.algorithms.range_algorithm_non_mutating_algorithms.upper_bound.definition"></a><h6>
-<a name="id2990527"></a>
+<a name="id703484"></a>
             <a class="link" href="upper_bound.html#range.reference.algorithms.range_algorithm_non_mutating_algorithms.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.range_algorithm_non_mutating_algorithms.upper_bound.requirements"></a><h6>
-<a name="id2990602"></a>
+<a name="id703555"></a>
             <a class="link" href="upper_bound.html#range.reference.algorithms.range_algorithm_non_mutating_algorithms.upper_bound.requirements">Requirements</a>
           </h6>
 <p>
@@ -141,7 +129,7 @@
             </li>
 </ul></div>
 <a name="range.reference.algorithms.range_algorithm_non_mutating_algorithms.upper_bound.precondition_"></a><h6>
-<a name="id2990862"></a>
+<a name="id703799"></a>
             <a class="link" href="upper_bound.html#range.reference.algorithms.range_algorithm_non_mutating_algorithms.upper_bound.precondition_">Precondition:</a>
           </h6>
 <p>
@@ -159,7 +147,7 @@
             order according to <code class="computeroutput"><span class="identifier">pred</span></code>.
           </p>
 <a name="range.reference.algorithms.range_algorithm_non_mutating_algorithms.upper_bound.complexity"></a><h6>
-<a name="id2990960"></a>
+<a name="id703891"></a>
             <a class="link" href="upper_bound.html#range.reference.algorithms.range_algorithm_non_mutating_algorithms.upper_bound.complexity">Complexity</a>
           </h6>
 <p>
diff --git a/doc/html/range/reference/algorithms/range_numeric.html b/doc/html/range/reference/algorithms/range_numeric.html
index c6c6767..9da4d83 100644
--- a/doc/html/range/reference/algorithms/range_numeric.html
+++ b/doc/html/range/reference/algorithms/range_numeric.html
@@ -3,7 +3,7 @@
 <meta http-equiv="Content-Type" content="text/html; charset=US-ASCII">
 <title>Numeric algorithms</title>
 <link rel="stylesheet" href="../../../../../../../doc/html/boostbook.css" type="text/css">
-<meta name="generator" content="DocBook XSL Stylesheets V1.75.1">
+<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="../algorithms.html" title="Range Algorithm">
 <link rel="prev" href="range_algorithm_new_algorithms/remove_erase_if.html" title="remove_erase_if">
diff --git a/doc/html/range/reference/algorithms/range_numeric/accumulate.html b/doc/html/range/reference/algorithms/range_numeric/accumulate.html
index 448b1fa..9351f90 100644
--- a/doc/html/range/reference/algorithms/range_numeric/accumulate.html
+++ b/doc/html/range/reference/algorithms/range_numeric/accumulate.html
@@ -3,7 +3,7 @@
 <meta http-equiv="Content-Type" content="text/html; charset=US-ASCII">
 <title>accumulate</title>
 <link rel="stylesheet" href="../../../../../../../../doc/html/boostbook.css" type="text/css">
-<meta name="generator" content="DocBook XSL Stylesheets V1.75.1">
+<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="../range_numeric.html" title="Numeric algorithms">
 <link rel="prev" href="../range_numeric.html" title="Numeric algorithms">
@@ -28,7 +28,7 @@
           accumulate</a>
 </h5></div></div></div>
 <a name="range.reference.algorithms.range_numeric.accumulate.prototype"></a><h6>
-<a name="id3005906"></a>
+<a name="id718665"></a>
             <a class="link" href="accumulate.html#range.reference.algorithms.range_numeric.accumulate.prototype">Prototype</a>
           </h6>
 <p>
@@ -53,7 +53,7 @@
 <p>
           </p>
 <a name="range.reference.algorithms.range_numeric.accumulate.description"></a><h6>
-<a name="id3006172"></a>
+<a name="id718927"></a>
             <a class="link" href="accumulate.html#range.reference.algorithms.range_numeric.accumulate.description">Description</a>
           </h6>
 <p>
@@ -64,18 +64,18 @@
             The return value is the resultant value of the above algorithm.
           </p>
 <a name="range.reference.algorithms.range_numeric.accumulate.definition"></a><h6>
-<a name="id3006252"></a>
+<a name="id719001"></a>
             <a class="link" href="accumulate.html#range.reference.algorithms.range_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.range_numeric.accumulate.requirements"></a><h6>
-<a name="id3006316"></a>
+<a name="id719064"></a>
             <a class="link" href="accumulate.html#range.reference.algorithms.range_numeric.accumulate.requirements">Requirements</a>
           </h6>
 <a name="range.reference.algorithms.range_numeric.accumulate.for_the_first_version"></a><h6>
-<a name="id3006339"></a>
+<a name="id719085"></a>
             <a class="link" href="accumulate.html#range.reference.algorithms.range_numeric.accumulate.for_the_first_version">For
             the first version</a>
           </h6>
@@ -100,7 +100,7 @@
             </li>
 </ol></div>
 <a name="range.reference.algorithms.range_numeric.accumulate.for_the_second_version"></a><h6>
-<a name="id3006477"></a>
+<a name="id719214"></a>
             <a class="link" href="accumulate.html#range.reference.algorithms.range_numeric.accumulate.for_the_second_version">For
             the second version</a>
           </h6>
@@ -134,7 +134,7 @@
             </li>
 </ol></div>
 <a name="range.reference.algorithms.range_numeric.accumulate.complexity"></a><h6>
-<a name="id3006661"></a>
+<a name="id719387"></a>
             <a class="link" href="accumulate.html#range.reference.algorithms.range_numeric.accumulate.complexity">Complexity</a>
           </h6>
 <p>
diff --git a/doc/html/range/reference/algorithms/range_numeric/adjacent_difference.html b/doc/html/range/reference/algorithms/range_numeric/adjacent_difference.html
index 8c76593..6680e82 100644
--- a/doc/html/range/reference/algorithms/range_numeric/adjacent_difference.html
+++ b/doc/html/range/reference/algorithms/range_numeric/adjacent_difference.html
@@ -3,7 +3,7 @@
 <meta http-equiv="Content-Type" content="text/html; charset=US-ASCII">
 <title>adjacent_difference</title>
 <link rel="stylesheet" href="../../../../../../../../doc/html/boostbook.css" type="text/css">
-<meta name="generator" content="DocBook XSL Stylesheets V1.75.1">
+<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="../range_numeric.html" title="Numeric algorithms">
 <link rel="prev" href="accumulate.html" title="accumulate">
@@ -28,7 +28,7 @@
           adjacent_difference</a>
 </h5></div></div></div>
 <a name="range.reference.algorithms.range_numeric.adjacent_difference.prototype"></a><h6>
-<a name="id3006732"></a>
+<a name="id719451"></a>
             <a class="link" href="adjacent_difference.html#range.reference.algorithms.range_numeric.adjacent_difference.prototype">Prototype</a>
           </h6>
 <p>
@@ -55,7 +55,7 @@
 <p>
           </p>
 <a name="range.reference.algorithms.range_numeric.adjacent_difference.description"></a><h6>
-<a name="id3007000"></a>
+<a name="id719714"></a>
             <a class="link" href="adjacent_difference.html#range.reference.algorithms.range_numeric.adjacent_difference.description">Description</a>
           </h6>
 <p>
@@ -69,18 +69,18 @@
             instead of <code class="computeroutput"><span class="keyword">operator</span><span class="special">-()</span></code>.
           </p>
 <a name="range.reference.algorithms.range_numeric.adjacent_difference.definition"></a><h6>
-<a name="id3007105"></a>
+<a name="id719816"></a>
             <a class="link" href="adjacent_difference.html#range.reference.algorithms.range_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.range_numeric.adjacent_difference.requirements"></a><h6>
-<a name="id3007170"></a>
+<a name="id719877"></a>
             <a class="link" href="adjacent_difference.html#range.reference.algorithms.range_numeric.adjacent_difference.requirements">Requirements</a>
           </h6>
 <a name="range.reference.algorithms.range_numeric.adjacent_difference.for_the_first_version"></a><h6>
-<a name="id3007194"></a>
+<a name="id719899"></a>
             <a class="link" href="adjacent_difference.html#range.reference.algorithms.range_numeric.adjacent_difference.for_the_first_version">For
             the first version</a>
           </h6>
@@ -111,7 +111,7 @@
             </li>
 </ol></div>
 <a name="range.reference.algorithms.range_numeric.adjacent_difference.for_the_second_version"></a><h6>
-<a name="id3007397"></a>
+<a name="id720090"></a>
             <a class="link" href="adjacent_difference.html#range.reference.algorithms.range_numeric.adjacent_difference.for_the_second_version">For
             the second version</a>
           </h6>
@@ -146,7 +146,7 @@
             </li>
 </ol></div>
 <a name="range.reference.algorithms.range_numeric.adjacent_difference.precondition_"></a><h6>
-<a name="id3007585"></a>
+<a name="id720265"></a>
             <a class="link" href="adjacent_difference.html#range.reference.algorithms.range_numeric.adjacent_difference.precondition_">Precondition:</a>
           </h6>
 <p>
@@ -154,7 +154,7 @@
             <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.range_numeric.adjacent_difference.complexity"></a><h6>
-<a name="id3007662"></a>
+<a name="id720338"></a>
             <a class="link" href="adjacent_difference.html#range.reference.algorithms.range_numeric.adjacent_difference.complexity">Complexity</a>
           </h6>
 <p>
diff --git a/doc/html/range/reference/algorithms/range_numeric/inner_product.html b/doc/html/range/reference/algorithms/range_numeric/inner_product.html
index 6d48b14..d2591e2 100644
--- a/doc/html/range/reference/algorithms/range_numeric/inner_product.html
+++ b/doc/html/range/reference/algorithms/range_numeric/inner_product.html
@@ -3,7 +3,7 @@
 <meta http-equiv="Content-Type" content="text/html; charset=US-ASCII">
 <title>inner_product</title>
 <link rel="stylesheet" href="../../../../../../../../doc/html/boostbook.css" type="text/css">
-<meta name="generator" content="DocBook XSL Stylesheets V1.75.1">
+<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="../range_numeric.html" title="Numeric algorithms">
 <link rel="prev" href="adjacent_difference.html" title="adjacent_difference">
@@ -28,7 +28,7 @@
           inner_product</a>
 </h5></div></div></div>
 <a name="range.reference.algorithms.range_numeric.inner_product.prototype"></a><h6>
-<a name="id3007769"></a>
+<a name="id720437"></a>
             <a class="link" href="inner_product.html#range.reference.algorithms.range_numeric.inner_product.prototype">Prototype</a>
           </h6>
 <p>
@@ -54,7 +54,7 @@
 <p>
           </p>
 <a name="range.reference.algorithms.range_numeric.inner_product.description"></a><h6>
-<a name="id3008135"></a>
+<a name="id720800"></a>
             <a class="link" href="inner_product.html#range.reference.algorithms.range_numeric.inner_product.description">Description</a>
           </h6>
 <p>
@@ -67,18 +67,18 @@
             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.range_numeric.inner_product.definition"></a><h6>
-<a name="id3008217"></a>
+<a name="id720877"></a>
             <a class="link" href="inner_product.html#range.reference.algorithms.range_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.range_numeric.inner_product.requirements"></a><h6>
-<a name="id3008282"></a>
+<a name="id720939"></a>
             <a class="link" href="inner_product.html#range.reference.algorithms.range_numeric.inner_product.requirements">Requirements</a>
           </h6>
 <a name="range.reference.algorithms.range_numeric.inner_product.for_the_first_version"></a><h6>
-<a name="id3008306"></a>
+<a name="id720959"></a>
             <a class="link" href="inner_product.html#range.reference.algorithms.range_numeric.inner_product.for_the_first_version">For
             the first version</a>
           </h6>
@@ -113,7 +113,7 @@
             </li>
 </ol></div>
 <a name="range.reference.algorithms.range_numeric.inner_product.for_the_second_version"></a><h6>
-<a name="id3008560"></a>
+<a name="id721200"></a>
             <a class="link" href="inner_product.html#range.reference.algorithms.range_numeric.inner_product.for_the_second_version">For
             the second version</a>
           </h6>
@@ -162,14 +162,14 @@
             </li>
 </ol></div>
 <a name="range.reference.algorithms.range_numeric.inner_product.precondition_"></a><h6>
-<a name="id3008846"></a>
+<a name="id721469"></a>
             <a class="link" href="inner_product.html#range.reference.algorithms.range_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.range_numeric.inner_product.complexity"></a><h6>
-<a name="id3008923"></a>
+<a name="id721542"></a>
             <a class="link" href="inner_product.html#range.reference.algorithms.range_numeric.inner_product.complexity">Complexity</a>
           </h6>
 <p>
diff --git a/doc/html/range/reference/algorithms/range_numeric/partial_sum.html b/doc/html/range/reference/algorithms/range_numeric/partial_sum.html
index b89e58e..b1aa0bf 100644
--- a/doc/html/range/reference/algorithms/range_numeric/partial_sum.html
+++ b/doc/html/range/reference/algorithms/range_numeric/partial_sum.html
@@ -3,7 +3,7 @@
 <meta http-equiv="Content-Type" content="text/html; charset=US-ASCII">
 <title>partial_sum</title>
 <link rel="stylesheet" href="../../../../../../../../doc/html/boostbook.css" type="text/css">
-<meta name="generator" content="DocBook XSL Stylesheets V1.75.1">
+<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="../range_numeric.html" title="Numeric algorithms">
 <link rel="prev" href="inner_product.html" title="inner_product">
@@ -28,7 +28,7 @@
           partial_sum</a>
 </h5></div></div></div>
 <a name="range.reference.algorithms.range_numeric.partial_sum.prototype"></a><h6>
-<a name="id3008994"></a>
+<a name="id721607"></a>
             <a class="link" href="partial_sum.html#range.reference.algorithms.range_numeric.partial_sum.prototype">Prototype</a>
           </h6>
 <p>
@@ -49,7 +49,7 @@
 <p>
           </p>
 <a name="range.reference.algorithms.range_numeric.partial_sum.description"></a><h6>
-<a name="id3009255"></a>
+<a name="id721863"></a>
             <a class="link" href="partial_sum.html#range.reference.algorithms.range_numeric.partial_sum.description">Description</a>
           </h6>
 <p>
@@ -58,18 +58,18 @@
             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.range_numeric.partial_sum.definition"></a><h6>
-<a name="id3009398"></a>
+<a name="id722002"></a>
             <a class="link" href="partial_sum.html#range.reference.algorithms.range_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.range_numeric.partial_sum.requirements"></a><h6>
-<a name="id3009462"></a>
+<a name="id722064"></a>
             <a class="link" href="partial_sum.html#range.reference.algorithms.range_numeric.partial_sum.requirements">Requirements</a>
           </h6>
 <a name="range.reference.algorithms.range_numeric.partial_sum.for_the_first_version"></a><h6>
-<a name="id3009486"></a>
+<a name="id722085"></a>
             <a class="link" href="partial_sum.html#range.reference.algorithms.range_numeric.partial_sum.for_the_first_version">For
             the first version</a>
           </h6>
@@ -99,7 +99,7 @@
             </li>
 </ol></div>
 <a name="range.reference.algorithms.range_numeric.partial_sum.for_the_second_version"></a><h6>
-<a name="id3009688"></a>
+<a name="id722276"></a>
             <a class="link" href="partial_sum.html#range.reference.algorithms.range_numeric.partial_sum.for_the_second_version">For
             the second version</a>
           </h6>
@@ -128,7 +128,7 @@
             </li>
 </ol></div>
 <a name="range.reference.algorithms.range_numeric.partial_sum.precondition_"></a><h6>
-<a name="id3009847"></a>
+<a name="id722425"></a>
             <a class="link" href="partial_sum.html#range.reference.algorithms.range_numeric.partial_sum.precondition_">Precondition:</a>
           </h6>
 <p>
@@ -136,7 +136,7 @@
             <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.range_numeric.partial_sum.complexity"></a><h6>
-<a name="id3009923"></a>
+<a name="id722499"></a>
             <a class="link" href="partial_sum.html#range.reference.algorithms.range_numeric.partial_sum.complexity">Complexity</a>
           </h6>
 <p>
diff --git a/doc/html/range/reference/algorithms/set_algorithms.html b/doc/html/range/reference/algorithms/set_algorithms.html
index b9888f5..447b470 100644
--- a/doc/html/range/reference/algorithms/set_algorithms.html
+++ b/doc/html/range/reference/algorithms/set_algorithms.html
@@ -3,7 +3,7 @@
 <meta http-equiv="Content-Type" content="text/html; charset=US-ASCII">
 <title>Set algorithms</title>
 <link rel="stylesheet" href="../../../../../../../doc/html/boostbook.css" type="text/css">
-<meta name="generator" content="DocBook XSL Stylesheets V1.75.1">
+<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="../algorithms.html" title="Range Algorithm">
 <link rel="prev" href="range_algorithm_non_mutating_algorithms/upper_bound.html" title="upper_bound">
diff --git a/doc/html/range/reference/algorithms/set_algorithms/includes.html b/doc/html/range/reference/algorithms/set_algorithms/includes.html
index 015474a..b8fabe5 100644
--- a/doc/html/range/reference/algorithms/set_algorithms/includes.html
+++ b/doc/html/range/reference/algorithms/set_algorithms/includes.html
@@ -3,7 +3,7 @@
 <meta http-equiv="Content-Type" content="text/html; charset=US-ASCII">
 <title>includes</title>
 <link rel="stylesheet" href="../../../../../../../../doc/html/boostbook.css" type="text/css">
-<meta name="generator" content="DocBook XSL Stylesheets V1.75.1">
+<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="../set_algorithms.html" title="Set algorithms">
 <link rel="prev" href="../set_algorithms.html" title="Set algorithms">
@@ -28,7 +28,7 @@
           includes</a>
 </h5></div></div></div>
 <a name="range.reference.algorithms.set_algorithms.includes.prototype"></a><h6>
-<a name="id2991122"></a>
+<a name="id704045"></a>
             <a class="link" href="includes.html#range.reference.algorithms.set_algorithms.includes.prototype">Prototype</a>
           </h6>
 <p>
@@ -48,7 +48,7 @@
 <p>
           </p>
 <a name="range.reference.algorithms.set_algorithms.includes.description"></a><h6>
-<a name="id2991406"></a>
+<a name="id704326"></a>
             <a class="link" href="includes.html#range.reference.algorithms.set_algorithms.includes.description">Description</a>
           </h6>
 <p>
@@ -60,14 +60,14 @@
             the predicate versions.
           </p>
 <a name="range.reference.algorithms.set_algorithms.includes.definition"></a><h6>
-<a name="id2991505"></a>
+<a name="id704419"></a>
             <a class="link" href="includes.html#range.reference.algorithms.set_algorithms.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_algorithms.includes.requirements"></a><h6>
-<a name="id2991578"></a>
+<a name="id704490"></a>
             <a class="link" href="includes.html#range.reference.algorithms.set_algorithms.includes.requirements">Requirements</a>
           </h6>
 <p>
@@ -145,7 +145,7 @@
             </li>
 </ul></div>
 <a name="range.reference.algorithms.set_algorithms.includes.precondition_"></a><h6>
-<a name="id2991970"></a>
+<a name="id704857"></a>
             <a class="link" href="includes.html#range.reference.algorithms.set_algorithms.includes.precondition_">Precondition:</a>
           </h6>
 <p>
@@ -163,7 +163,7 @@
             according to <code class="computeroutput"><span class="identifier">pred</span></code>.
           </p>
 <a name="range.reference.algorithms.set_algorithms.includes.complexity"></a><h6>
-<a name="id2992089"></a>
+<a name="id704971"></a>
             <a class="link" href="includes.html#range.reference.algorithms.set_algorithms.includes.complexity">Complexity</a>
           </h6>
 <p>
diff --git a/doc/html/range/reference/algorithms/set_algorithms/set_difference.html b/doc/html/range/reference/algorithms/set_algorithms/set_difference.html
index 58d8a54..95531ed 100644
--- a/doc/html/range/reference/algorithms/set_algorithms/set_difference.html
+++ b/doc/html/range/reference/algorithms/set_algorithms/set_difference.html
@@ -3,7 +3,7 @@
 <meta http-equiv="Content-Type" content="text/html; charset=US-ASCII">
 <title>set_difference</title>
 <link rel="stylesheet" href="../../../../../../../../doc/html/boostbook.css" type="text/css">
-<meta name="generator" content="DocBook XSL Stylesheets V1.75.1">
+<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="../set_algorithms.html" title="Set algorithms">
 <link rel="prev" href="set_intersection.html" title="set_intersection">
@@ -28,7 +28,7 @@
           set_difference</a>
 </h5></div></div></div>
 <a name="range.reference.algorithms.set_algorithms.set_difference.prototype"></a><h6>
-<a name="id2994636"></a>
+<a name="id707406"></a>
             <a class="link" href="set_difference.html#range.reference.algorithms.set_algorithms.set_difference.prototype">Prototype</a>
           </h6>
 <p>
@@ -57,7 +57,7 @@
 <p>
           </p>
 <a name="range.reference.algorithms.set_algorithms.set_difference.description"></a><h6>
-<a name="id2994983"></a>
+<a name="id707752"></a>
             <a class="link" href="set_difference.html#range.reference.algorithms.set_algorithms.set_difference.description">Description</a>
           </h6>
 <p>
@@ -71,14 +71,14 @@
             the predicate versions.
           </p>
 <a name="range.reference.algorithms.set_algorithms.set_difference.definition"></a><h6>
-<a name="id2995080"></a>
+<a name="id707838"></a>
             <a class="link" href="set_difference.html#range.reference.algorithms.set_algorithms.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_algorithms.set_difference.requirements"></a><h6>
-<a name="id2995154"></a>
+<a name="id707909"></a>
             <a class="link" href="set_difference.html#range.reference.algorithms.set_algorithms.set_difference.requirements">Requirements</a>
           </h6>
 <p>
@@ -164,7 +164,7 @@
             </li>
 </ul></div>
 <a name="range.reference.algorithms.set_algorithms.set_difference.precondition_"></a><h6>
-<a name="id2995598"></a>
+<a name="id708326"></a>
             <a class="link" href="set_difference.html#range.reference.algorithms.set_algorithms.set_difference.precondition_">Precondition:</a>
           </h6>
 <p>
@@ -182,7 +182,7 @@
             according to <code class="computeroutput"><span class="identifier">pred</span></code>.
           </p>
 <a name="range.reference.algorithms.set_algorithms.set_difference.complexity"></a><h6>
-<a name="id2995717"></a>
+<a name="id708440"></a>
             <a class="link" href="set_difference.html#range.reference.algorithms.set_algorithms.set_difference.complexity">Complexity</a>
           </h6>
 <p>
diff --git a/doc/html/range/reference/algorithms/set_algorithms/set_intersection.html b/doc/html/range/reference/algorithms/set_algorithms/set_intersection.html
index 65840cd..7367d86 100644
--- a/doc/html/range/reference/algorithms/set_algorithms/set_intersection.html
+++ b/doc/html/range/reference/algorithms/set_algorithms/set_intersection.html
@@ -3,7 +3,7 @@
 <meta http-equiv="Content-Type" content="text/html; charset=US-ASCII">
 <title>set_intersection</title>
 <link rel="stylesheet" href="../../../../../../../../doc/html/boostbook.css" type="text/css">
-<meta name="generator" content="DocBook XSL Stylesheets V1.75.1">
+<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="../set_algorithms.html" title="Set algorithms">
 <link rel="prev" href="set_union.html" title="set_union">
@@ -28,7 +28,7 @@
           set_intersection</a>
 </h5></div></div></div>
 <a name="range.reference.algorithms.set_algorithms.set_intersection.prototype"></a><h6>
-<a name="id2993424"></a>
+<a name="id706248"></a>
             <a class="link" href="set_intersection.html#range.reference.algorithms.set_algorithms.set_intersection.prototype">Prototype</a>
           </h6>
 <p>
@@ -57,7 +57,7 @@
 <p>
           </p>
 <a name="range.reference.algorithms.set_algorithms.set_intersection.description"></a><h6>
-<a name="id2993776"></a>
+<a name="id706594"></a>
             <a class="link" href="set_intersection.html#range.reference.algorithms.set_algorithms.set_intersection.description">Description</a>
           </h6>
 <p>
@@ -71,14 +71,14 @@
             the predicate versions.
           </p>
 <a name="range.reference.algorithms.set_algorithms.set_intersection.definition"></a><h6>
-<a name="id2993868"></a>
+<a name="id706681"></a>
             <a class="link" href="set_intersection.html#range.reference.algorithms.set_algorithms.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_algorithms.set_intersection.requirements"></a><h6>
-<a name="id2993942"></a>
+<a name="id706751"></a>
             <a class="link" href="set_intersection.html#range.reference.algorithms.set_algorithms.set_intersection.requirements">Requirements</a>
           </h6>
 <p>
@@ -164,7 +164,7 @@
             </li>
 </ul></div>
 <a name="range.reference.algorithms.set_algorithms.set_intersection.precondition_"></a><h6>
-<a name="id2994386"></a>
+<a name="id707167"></a>
             <a class="link" href="set_intersection.html#range.reference.algorithms.set_algorithms.set_intersection.precondition_">Precondition:</a>
           </h6>
 <p>
@@ -182,7 +182,7 @@
             according to <code class="computeroutput"><span class="identifier">pred</span></code>.
           </p>
 <a name="range.reference.algorithms.set_algorithms.set_intersection.complexity"></a><h6>
-<a name="id2994505"></a>
+<a name="id707282"></a>
             <a class="link" href="set_intersection.html#range.reference.algorithms.set_algorithms.set_intersection.complexity">Complexity</a>
           </h6>
 <p>
diff --git a/doc/html/range/reference/algorithms/set_algorithms/set_symmetric_difference.html b/doc/html/range/reference/algorithms/set_algorithms/set_symmetric_difference.html
index a25e8e4..52b58b7 100644
--- a/doc/html/range/reference/algorithms/set_algorithms/set_symmetric_difference.html
+++ b/doc/html/range/reference/algorithms/set_algorithms/set_symmetric_difference.html
@@ -3,7 +3,7 @@
 <meta http-equiv="Content-Type" content="text/html; charset=US-ASCII">
 <title>set_symmetric_difference</title>
 <link rel="stylesheet" href="../../../../../../../../doc/html/boostbook.css" type="text/css">
-<meta name="generator" content="DocBook XSL Stylesheets V1.75.1">
+<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="../set_algorithms.html" title="Set algorithms">
 <link rel="prev" href="set_difference.html" title="set_difference">
@@ -28,7 +28,7 @@
           set_symmetric_difference</a>
 </h5></div></div></div>
 <a name="range.reference.algorithms.set_algorithms.set_symmetric_difference.prototype"></a><h6>
-<a name="id2995848"></a>
+<a name="id708563"></a>
             <a class="link" href="set_symmetric_difference.html#range.reference.algorithms.set_algorithms.set_symmetric_difference.prototype">Prototype</a>
           </h6>
 <p>
@@ -59,7 +59,7 @@
 <p>
           </p>
 <a name="range.reference.algorithms.set_algorithms.set_symmetric_difference.description"></a><h6>
-<a name="id2996200"></a>
+<a name="id708909"></a>
             <a class="link" href="set_symmetric_difference.html#range.reference.algorithms.set_algorithms.set_symmetric_difference.description">Description</a>
           </h6>
 <p>
@@ -75,14 +75,14 @@
             the predicate versions.
           </p>
 <a name="range.reference.algorithms.set_algorithms.set_symmetric_difference.definition"></a><h6>
-<a name="id2996293"></a>
+<a name="id708997"></a>
             <a class="link" href="set_symmetric_difference.html#range.reference.algorithms.set_algorithms.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_algorithms.set_symmetric_difference.requirements"></a><h6>
-<a name="id2996367"></a>
+<a name="id709068"></a>
             <a class="link" href="set_symmetric_difference.html#range.reference.algorithms.set_algorithms.set_symmetric_difference.requirements">Requirements</a>
           </h6>
 <p>
@@ -168,7 +168,7 @@
             </li>
 </ul></div>
 <a name="range.reference.algorithms.set_algorithms.set_symmetric_difference.precondition_"></a><h6>
-<a name="id2996812"></a>
+<a name="id709485"></a>
             <a class="link" href="set_symmetric_difference.html#range.reference.algorithms.set_algorithms.set_symmetric_difference.precondition_">Precondition:</a>
           </h6>
 <p>
@@ -186,7 +186,7 @@
             according to <code class="computeroutput"><span class="identifier">pred</span></code>.
           </p>
 <a name="range.reference.algorithms.set_algorithms.set_symmetric_difference.complexity"></a><h6>
-<a name="id2996932"></a>
+<a name="id709600"></a>
             <a class="link" href="set_symmetric_difference.html#range.reference.algorithms.set_algorithms.set_symmetric_difference.complexity">Complexity</a>
           </h6>
 <p>
diff --git a/doc/html/range/reference/algorithms/set_algorithms/set_union.html b/doc/html/range/reference/algorithms/set_algorithms/set_union.html
index 90c343c..3a8abe3 100644
--- a/doc/html/range/reference/algorithms/set_algorithms/set_union.html
+++ b/doc/html/range/reference/algorithms/set_algorithms/set_union.html
@@ -3,7 +3,7 @@
 <meta http-equiv="Content-Type" content="text/html; charset=US-ASCII">
 <title>set_union</title>
 <link rel="stylesheet" href="../../../../../../../../doc/html/boostbook.css" type="text/css">
-<meta name="generator" content="DocBook XSL Stylesheets V1.75.1">
+<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="../set_algorithms.html" title="Set algorithms">
 <link rel="prev" href="includes.html" title="includes">
@@ -28,7 +28,7 @@
           set_union</a>
 </h5></div></div></div>
 <a name="range.reference.algorithms.set_algorithms.set_union.prototype"></a><h6>
-<a name="id2992218"></a>
+<a name="id705095"></a>
             <a class="link" href="set_union.html#range.reference.algorithms.set_algorithms.set_union.prototype">Prototype</a>
           </h6>
 <p>
@@ -57,7 +57,7 @@
 <p>
           </p>
 <a name="range.reference.algorithms.set_algorithms.set_union.description"></a><h6>
-<a name="id2992569"></a>
+<a name="id705441"></a>
             <a class="link" href="set_union.html#range.reference.algorithms.set_algorithms.set_union.description">Description</a>
           </h6>
 <p>
@@ -70,14 +70,14 @@
             in the predicate versions.
           </p>
 <a name="range.reference.algorithms.set_algorithms.set_union.definition"></a><h6>
-<a name="id2992658"></a>
+<a name="id705524"></a>
             <a class="link" href="set_union.html#range.reference.algorithms.set_algorithms.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_algorithms.set_union.requirements"></a><h6>
-<a name="id2992731"></a>
+<a name="id705594"></a>
             <a class="link" href="set_union.html#range.reference.algorithms.set_algorithms.set_union.requirements">Requirements</a>
           </h6>
 <p>
@@ -163,7 +163,7 @@
             </li>
 </ul></div>
 <a name="range.reference.algorithms.set_algorithms.set_union.precondition_"></a><h6>
-<a name="id2993175"></a>
+<a name="id706010"></a>
             <a class="link" href="set_union.html#range.reference.algorithms.set_algorithms.set_union.precondition_">Precondition:</a>
           </h6>
 <p>
@@ -181,7 +181,7 @@
             according to <code class="computeroutput"><span class="identifier">pred</span></code>.
           </p>
 <a name="range.reference.algorithms.set_algorithms.set_union.complexity"></a><h6>
-<a name="id2993294"></a>
+<a name="id706124"></a>
             <a class="link" href="set_union.html#range.reference.algorithms.set_algorithms.set_union.complexity">Complexity</a>
           </h6>
 <p>
diff --git a/doc/html/range/reference/extending.html b/doc/html/range/reference/extending.html
index fc32e83..37f4882 100644
--- a/doc/html/range/reference/extending.html
+++ b/doc/html/range/reference/extending.html
@@ -3,7 +3,7 @@
 <meta http-equiv="Content-Type" content="text/html; charset=US-ASCII">
 <title>Extending the library</title>
 <link rel="stylesheet" href="../../../../../../doc/html/boostbook.css" type="text/css">
-<meta name="generator" content="DocBook XSL Stylesheets V1.75.1">
+<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="../reference.html" title="Reference">
 <link rel="prev" href="ranges/irange.html" title="irange">
diff --git a/doc/html/range/reference/extending/method_1.html b/doc/html/range/reference/extending/method_1.html
index 3283d10..d9f66a7 100644
--- a/doc/html/range/reference/extending/method_1.html
+++ b/doc/html/range/reference/extending/method_1.html
@@ -3,7 +3,7 @@
 <meta http-equiv="Content-Type" content="text/html; charset=US-ASCII">
 <title>Method 1: provide member functions and nested types</title>
 <link rel="stylesheet" href="../../../../../../../doc/html/boostbook.css" type="text/css">
-<meta name="generator" content="DocBook XSL Stylesheets V1.75.1">
+<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="../extending.html" title="Extending the library">
 <link rel="prev" href="../extending.html" title="Extending the library">
@@ -34,7 +34,7 @@
         </p>
 <p>
           The primary templates in this library are implemented such that standard
-          containers will work automatically and so will <a href="../../../../../libs/array/index.html" target="_top">boost::array</a>.
+          containers will work automatically and so will <a href="../../../../../../../libs/array/index.html" target="_top">boost::array</a>.
           Below is given an overview of which member functions and member types a
           class must specify to be useable as a certain Range concept.
         </p>
diff --git a/doc/html/range/reference/extending/method_2.html b/doc/html/range/reference/extending/method_2.html
index f4f3524..eae4cbd 100644
--- a/doc/html/range/reference/extending/method_2.html
+++ b/doc/html/range/reference/extending/method_2.html
@@ -3,7 +3,7 @@
 <meta http-equiv="Content-Type" content="text/html; charset=US-ASCII">
 <title>Method 2: provide free-standing functions and specialize metafunctions</title>
 <link rel="stylesheet" href="../../../../../../../doc/html/boostbook.css" type="text/css">
-<meta name="generator" content="DocBook XSL Stylesheets V1.75.1">
+<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="../extending.html" title="Extending the library">
 <link rel="prev" href="method_1.html" title="Method 1: provide member functions and nested types">
diff --git a/doc/html/range/reference/extending/method_3.html b/doc/html/range/reference/extending/method_3.html
index f841237..3594ff8 100644
--- a/doc/html/range/reference/extending/method_3.html
+++ b/doc/html/range/reference/extending/method_3.html
@@ -3,7 +3,7 @@
 <meta http-equiv="Content-Type" content="text/html; charset=US-ASCII">
 <title>Method 3: provide range adaptor implementations</title>
 <link rel="stylesheet" href="../../../../../../../doc/html/boostbook.css" type="text/css">
-<meta name="generator" content="DocBook XSL Stylesheets V1.75.1">
+<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="../extending.html" title="Extending the library">
 <link rel="prev" href="method_2.html" title="Method 2: provide free-standing functions and specialize metafunctions">
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 e995bee..9370d65 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
@@ -3,7 +3,7 @@
 <meta http-equiv="Content-Type" content="text/html; charset=US-ASCII">
 <title>Method 3.1: Implement a Range Adaptor without arguments</title>
 <link rel="stylesheet" href="../../../../../../../../doc/html/boostbook.css" type="text/css">
-<meta name="generator" content="DocBook XSL Stylesheets V1.75.1">
+<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="../method_3.html" title="Method 3: provide range adaptor implementations">
 <link rel="prev" href="../method_3.html" title="Method 3: provide range adaptor implementations">
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 f0bae90..f153d0e 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
@@ -3,7 +3,7 @@
 <meta http-equiv="Content-Type" content="text/html; charset=US-ASCII">
 <title>Method 3.2: Implement a Range Adaptor with arguments</title>
 <link rel="stylesheet" href="../../../../../../../../doc/html/boostbook.css" type="text/css">
-<meta name="generator" content="DocBook XSL Stylesheets V1.75.1">
+<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="../method_3.html" title="Method 3: provide range adaptor implementations">
 <link rel="prev" href="method_3_1.html" title="Method 3.1: Implement a Range Adaptor without arguments">
diff --git a/doc/html/range/reference/overview.html b/doc/html/range/reference/overview.html
index ae0bbf0..8db874f 100644
--- a/doc/html/range/reference/overview.html
+++ b/doc/html/range/reference/overview.html
@@ -3,7 +3,7 @@
 <meta http-equiv="Content-Type" content="text/html; charset=US-ASCII">
 <title>Overview</title>
 <link rel="stylesheet" href="../../../../../../doc/html/boostbook.css" type="text/css">
-<meta name="generator" content="DocBook XSL Stylesheets V1.75.1">
+<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="../reference.html" title="Reference">
 <link rel="prev" href="../reference.html" title="Reference">
diff --git a/doc/html/range/reference/ranges.html b/doc/html/range/reference/ranges.html
index 2e16372..6e4ad0a 100644
--- a/doc/html/range/reference/ranges.html
+++ b/doc/html/range/reference/ranges.html
@@ -3,7 +3,7 @@
 <meta http-equiv="Content-Type" content="text/html; charset=US-ASCII">
 <title>Provided Ranges</title>
 <link rel="stylesheet" href="../../../../../../doc/html/boostbook.css" type="text/css">
-<meta name="generator" content="DocBook XSL Stylesheets V1.75.1">
+<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="../reference.html" title="Reference">
 <link rel="prev" href="algorithms/range_numeric/partial_sum.html" title="partial_sum">
diff --git a/doc/html/range/reference/ranges/counting_range.html b/doc/html/range/reference/ranges/counting_range.html
index b556488..e2ccb2c 100644
--- a/doc/html/range/reference/ranges/counting_range.html
+++ b/doc/html/range/reference/ranges/counting_range.html
@@ -3,7 +3,7 @@
 <meta http-equiv="Content-Type" content="text/html; charset=US-ASCII">
 <title>counting_range</title>
 <link rel="stylesheet" href="../../../../../../../doc/html/boostbook.css" type="text/css">
-<meta name="generator" content="DocBook XSL Stylesheets V1.75.1">
+<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="../ranges.html" title="Provided Ranges">
 <link rel="prev" href="../ranges.html" title="Provided Ranges">
@@ -27,7 +27,7 @@
 <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="id3010045"></a>
+<a name="id722615"></a>
           <a class="link" href="counting_range.html#range.reference.ranges.counting_range.prototype">Prototype</a>
         </h6>
 <p>
@@ -48,7 +48,7 @@
 <p>
         </p>
 <a name="range.reference.ranges.counting_range.description"></a><h6>
-<a name="id3010430"></a>
+<a name="id722997"></a>
           <a class="link" href="counting_range.html#range.reference.ranges.counting_range.description">Description</a>
         </h6>
 <p>
@@ -58,14 +58,14 @@
           (from Boost.Iterator).
         </p>
 <a name="range.reference.ranges.counting_range.definition"></a><h6>
-<a name="id3010489"></a>
+<a name="id723052"></a>
           <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="id3010553"></a>
+<a name="id723113"></a>
           <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">
diff --git a/doc/html/range/reference/ranges/irange.html b/doc/html/range/reference/ranges/irange.html
index f4565c0..cd481f0 100644
--- a/doc/html/range/reference/ranges/irange.html
+++ b/doc/html/range/reference/ranges/irange.html
@@ -3,7 +3,7 @@
 <meta http-equiv="Content-Type" content="text/html; charset=US-ASCII">
 <title>irange</title>
 <link rel="stylesheet" href="../../../../../../../doc/html/boostbook.css" type="text/css">
-<meta name="generator" content="DocBook XSL Stylesheets V1.75.1">
+<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="../ranges.html" title="Provided Ranges">
 <link rel="prev" href="istream_range.html" title="istream_range">
@@ -27,7 +27,7 @@
 <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="id3010994"></a>
+<a name="id723540"></a>
           <a class="link" href="irange.html#range.reference.ranges.irange.prototype">Prototype</a>
         </h6>
 <p>
@@ -44,7 +44,7 @@
 <p>
         </p>
 <a name="range.reference.ranges.irange.description"></a><h6>
-<a name="id3011289"></a>
+<a name="id723832"></a>
           <a class="link" href="irange.html#range.reference.ranges.irange.description">Description</a>
         </h6>
 <p>
@@ -58,14 +58,14 @@
           parameters denoted a half-open range.
         </p>
 <a name="range.reference.ranges.irange.definition"></a><h6>
-<a name="id3011370"></a>
+<a name="id723910"></a>
           <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="id3011433"></a>
+<a name="id723972"></a>
           <a class="link" href="irange.html#range.reference.ranges.irange.requirements">Requirements</a>
         </h6>
 <div class="orderedlist"><ol class="orderedlist" type="1">
@@ -79,7 +79,7 @@
           </li>
 </ol></div>
 <a name="range.reference.ranges.irange.complexity"></a><h6>
-<a name="id3011513"></a>
+<a name="id724049"></a>
           <a class="link" href="irange.html#range.reference.ranges.irange.complexity">Complexity</a>
         </h6>
 <p>
diff --git a/doc/html/range/reference/ranges/istream_range.html b/doc/html/range/reference/ranges/istream_range.html
index e7d81d8..063204d 100644
--- a/doc/html/range/reference/ranges/istream_range.html
+++ b/doc/html/range/reference/ranges/istream_range.html
@@ -3,7 +3,7 @@
 <meta http-equiv="Content-Type" content="text/html; charset=US-ASCII">
 <title>istream_range</title>
 <link rel="stylesheet" href="../../../../../../../doc/html/boostbook.css" type="text/css">
-<meta name="generator" content="DocBook XSL Stylesheets V1.75.1">
+<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="../ranges.html" title="Provided Ranges">
 <link rel="prev" href="counting_range.html" title="counting_range">
@@ -27,7 +27,7 @@
 <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="id3010627"></a>
+<a name="id723182"></a>
           <a class="link" href="istream_range.html#range.reference.ranges.istream_range.prototype">Prototype</a>
         </h6>
 <p>
@@ -40,7 +40,7 @@
 <p>
         </p>
 <a name="range.reference.ranges.istream_range.description"></a><h6>
-<a name="id3010846"></a>
+<a name="id723399"></a>
           <a class="link" href="istream_range.html#range.reference.ranges.istream_range.description">Description</a>
         </h6>
 <p>
@@ -49,7 +49,7 @@
           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="id3010913"></a>
+<a name="id723464"></a>
           <a class="link" href="istream_range.html#range.reference.ranges.istream_range.definition">Definition</a>
         </h6>
 <p>
diff --git a/doc/html/range/reference/semantics.html b/doc/html/range/reference/semantics.html
index fbb1aa8..4fa0645 100644
--- a/doc/html/range/reference/semantics.html
+++ b/doc/html/range/reference/semantics.html
@@ -3,7 +3,7 @@
 <meta http-equiv="Content-Type" content="text/html; charset=US-ASCII">
 <title>Semantics</title>
 <link rel="stylesheet" href="../../../../../../doc/html/boostbook.css" type="text/css">
-<meta name="generator" content="DocBook XSL Stylesheets V1.75.1">
+<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="../reference.html" title="Reference">
 <link rel="prev" href="synopsis.html" title="Synopsis">
@@ -31,7 +31,7 @@
 <dt><span class="section"><a href="semantics/functions.html">Functions</a></span></dt>
 </dl></div>
 <a name="range.reference.semantics.notation"></a><h5>
-<a name="id2919931"></a>
+<a name="id637171"></a>
         <a class="link" href="semantics.html#range.reference.semantics.notation">notation</a>
       </h5>
 <div class="informaltable"><table class="table">
diff --git a/doc/html/range/reference/semantics/functions.html b/doc/html/range/reference/semantics/functions.html
index 232b680..16bb7fb 100644
--- a/doc/html/range/reference/semantics/functions.html
+++ b/doc/html/range/reference/semantics/functions.html
@@ -3,7 +3,7 @@
 <meta http-equiv="Content-Type" content="text/html; charset=US-ASCII">
 <title>Functions</title>
 <link rel="stylesheet" href="../../../../../../../doc/html/boostbook.css" type="text/css">
-<meta name="generator" content="DocBook XSL Stylesheets V1.75.1">
+<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="../semantics.html" title="Semantics">
 <link rel="prev" href="metafunctions.html" title="Metafunctions">
diff --git a/doc/html/range/reference/semantics/metafunctions.html b/doc/html/range/reference/semantics/metafunctions.html
index 6df4902..cc2f4bd 100644
--- a/doc/html/range/reference/semantics/metafunctions.html
+++ b/doc/html/range/reference/semantics/metafunctions.html
@@ -3,7 +3,7 @@
 <meta http-equiv="Content-Type" content="text/html; charset=US-ASCII">
 <title>Metafunctions</title>
 <link rel="stylesheet" href="../../../../../../../doc/html/boostbook.css" type="text/css">
-<meta name="generator" content="DocBook XSL Stylesheets V1.75.1">
+<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="../semantics.html" title="Semantics">
 <link rel="prev" href="../semantics.html" title="Semantics">
diff --git a/doc/html/range/reference/synopsis.html b/doc/html/range/reference/synopsis.html
index 248e8c1..c950490 100644
--- a/doc/html/range/reference/synopsis.html
+++ b/doc/html/range/reference/synopsis.html
@@ -3,7 +3,7 @@
 <meta http-equiv="Content-Type" content="text/html; charset=US-ASCII">
 <title>Synopsis</title>
 <link rel="stylesheet" href="../../../../../../doc/html/boostbook.css" type="text/css">
-<meta name="generator" content="DocBook XSL Stylesheets V1.75.1">
+<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="../reference.html" title="Reference">
 <link rel="prev" href="overview.html" title="Overview">
diff --git a/doc/html/range/style_guide.html b/doc/html/range/style_guide.html
index f064884..48043c4 100644
--- a/doc/html/range/style_guide.html
+++ b/doc/html/range/style_guide.html
@@ -3,7 +3,7 @@
 <meta http-equiv="Content-Type" content="text/html; charset=US-ASCII">
 <title>Terminology and style guidelines</title>
 <link rel="stylesheet" href="../../../../../doc/html/boostbook.css" type="text/css">
-<meta name="generator" content="DocBook XSL Stylesheets V1.75.1">
+<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="../index.html" title="Chapter&#160;1.&#160;Range 2.0">
 <link rel="prev" href="utilities/join.html" title="Function join">
@@ -66,7 +66,7 @@
 </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
+      Notice how we have used the categories from the <a href="../../../../../libs/iterator/doc/new-iter-concepts.html" target="_top">new
       style iterators</a>.
     </p>
 <p>
diff --git a/doc/html/range/upgrade.html b/doc/html/range/upgrade.html
index ad53c37..27ddd2b 100644
--- a/doc/html/range/upgrade.html
+++ b/doc/html/range/upgrade.html
@@ -3,7 +3,7 @@
 <meta http-equiv="Content-Type" content="text/html; charset=US-ASCII">
 <title>Upgrade version of Boost.Range</title>
 <link rel="stylesheet" href="../../../../../doc/html/boostbook.css" type="text/css">
-<meta name="generator" content="DocBook XSL Stylesheets V1.75.1">
+<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="../index.html" title="Chapter&#160;1.&#160;Range 2.0">
 <link rel="prev" href="mfc_atl/references.html" title="References">
diff --git a/doc/html/range/upgrade/upgrade_from_1_34.html b/doc/html/range/upgrade/upgrade_from_1_34.html
index dfc4c52..587555c 100644
--- a/doc/html/range/upgrade/upgrade_from_1_34.html
+++ b/doc/html/range/upgrade/upgrade_from_1_34.html
@@ -3,7 +3,7 @@
 <meta http-equiv="Content-Type" content="text/html; charset=US-ASCII">
 <title>Upgrade from version 1.34</title>
 <link rel="stylesheet" href="../../../../../../doc/html/boostbook.css" type="text/css">
-<meta name="generator" content="DocBook XSL Stylesheets V1.75.1">
+<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_from_1_42.html" title="Upgrade from version 1.42">
diff --git a/doc/html/range/upgrade/upgrade_from_1_42.html b/doc/html/range/upgrade/upgrade_from_1_42.html
index 3fbc2d2..74059e4 100644
--- a/doc/html/range/upgrade/upgrade_from_1_42.html
+++ b/doc/html/range/upgrade/upgrade_from_1_42.html
@@ -3,7 +3,7 @@
 <meta http-equiv="Content-Type" content="text/html; charset=US-ASCII">
 <title>Upgrade from version 1.42</title>
 <link rel="stylesheet" href="../../../../../../doc/html/boostbook.css" type="text/css">
-<meta name="generator" content="DocBook XSL Stylesheets V1.75.1">
+<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">
diff --git a/doc/html/range/utilities.html b/doc/html/range/utilities.html
index d9caa5f..0ccd47c 100644
--- a/doc/html/range/utilities.html
+++ b/doc/html/range/utilities.html
@@ -3,7 +3,7 @@
 <meta http-equiv="Content-Type" content="text/html; charset=US-ASCII">
 <title>Utilities</title>
 <link rel="stylesheet" href="../../../../../doc/html/boostbook.css" type="text/css">
-<meta name="generator" content="DocBook XSL Stylesheets V1.75.1">
+<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="../index.html" title="Chapter&#160;1.&#160;Range 2.0">
 <link rel="prev" href="reference/extending/method_3/method_3_2.html" title="Method 3.2: Implement a Range Adaptor with arguments">
@@ -52,7 +52,7 @@
 </ul></div>
 <p>
       The <code class="computeroutput"><span class="identifier">iterator_range</span></code> class is
-      templated on an <a href="../../../libs/iterator/doc/new-iter-concepts.html#forward-traversal-iterators-lib-forward-traversal-iterators" target="_top">Forward
+      templated on an <a href="../../../../../libs/iterator/doc/new-iter-concepts.html#forward-traversal-iterators-lib-forward-traversal-iterators" target="_top">Forward
       Traversal Iterator</a> and should be used whenever fairly general code
       is needed. The <code class="computeroutput"><span class="identifier">sub_range</span></code> class
       is templated on an <a class="link" href="concepts/forward_range.html" title="Forward Range">Forward Range</a>
diff --git a/doc/html/range/utilities/iterator_range.html b/doc/html/range/utilities/iterator_range.html
index 07efc15..7956363 100644
--- a/doc/html/range/utilities/iterator_range.html
+++ b/doc/html/range/utilities/iterator_range.html
@@ -3,7 +3,7 @@
 <meta http-equiv="Content-Type" content="text/html; charset=US-ASCII">
 <title>Class iterator_range</title>
 <link rel="stylesheet" href="../../../../../../doc/html/boostbook.css" type="text/css">
-<meta name="generator" content="DocBook XSL Stylesheets V1.75.1">
+<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="../utilities.html" title="Utilities">
 <link rel="prev" href="../utilities.html" title="Utilities">
@@ -32,7 +32,7 @@
         Range</a> concept. A few other functions are also provided for convenience.
       </p>
 <p>
-        If the template argument is not a model of <a href="../../../../libs/iterator/doc/new-iter-concepts.html#forward-traversal-iterators-lib-forward-traversal-iterators" target="_top">Forward
+        If the template argument is not 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>, one can still use a subset of the interface.
         In particular, <code class="computeroutput"><span class="identifier">size</span><span class="special">()</span></code>
         requires Random Access Traversal Iterators whereas <code class="computeroutput"><span class="identifier">empty</span><span class="special">()</span></code> only requires Single Pass Iterators.
@@ -47,7 +47,7 @@
         limitation is simply propogated from the underlying iterator type.
       </p>
 <a name="range.utilities.iterator_range.synopsis"></a><h5>
-<a name="id3017779"></a>
+<a name="id730216"></a>
         <a class="link" href="iterator_range.html#range.utilities.iterator_range.synopsis">Synopsis</a>
       </h5>
 <p>
@@ -187,7 +187,7 @@
         iterators from the same container.
       </p>
 <a name="range.utilities.iterator_range.details_member_functions"></a><h5>
-<a name="id3021010"></a>
+<a name="id733421"></a>
         <a class="link" href="iterator_range.html#range.utilities.iterator_range.details_member_functions">Details
         member functions</a>
       </h5>
@@ -218,7 +218,7 @@
         </p>
 </blockquote></div>
 <a name="range.utilities.iterator_range.details_functions"></a><h5>
-<a name="id3021254"></a>
+<a name="id733661"></a>
         <a class="link" href="iterator_range.html#range.utilities.iterator_range.details_functions">Details
         functions</a>
       </h5>
diff --git a/doc/html/range/utilities/join.html b/doc/html/range/utilities/join.html
index c2c9e15..d430946 100644
--- a/doc/html/range/utilities/join.html
+++ b/doc/html/range/utilities/join.html
@@ -3,7 +3,7 @@
 <meta http-equiv="Content-Type" content="text/html; charset=US-ASCII">
 <title>Function join</title>
 <link rel="stylesheet" href="../../../../../../doc/html/boostbook.css" type="text/css">
-<meta name="generator" content="DocBook XSL Stylesheets V1.75.1">
+<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="../utilities.html" title="Utilities">
 <link rel="prev" href="sub_range.html" title="Class sub_range">
@@ -39,7 +39,7 @@
         if the end of a range has been reached internally during traversal.
       </p>
 <a name="range.utilities.join.synposis"></a><h5>
-<a name="id3023692"></a>
+<a name="id736071"></a>
         <a class="link" href="join.html#range.utilities.join.synposis">Synposis</a>
       </h5>
 <p>
@@ -65,7 +65,7 @@
 <p>
       </p>
 <a name="range.utilities.join.example"></a><h5>
-<a name="id3024239"></a>
+<a name="id736614"></a>
         <a class="link" href="join.html#range.utilities.join.example">Example</a>
       </h5>
 <p>
diff --git a/doc/html/range/utilities/sub_range.html b/doc/html/range/utilities/sub_range.html
index 0b474d7..517639f 100644
--- a/doc/html/range/utilities/sub_range.html
+++ b/doc/html/range/utilities/sub_range.html
@@ -3,7 +3,7 @@
 <meta http-equiv="Content-Type" content="text/html; charset=US-ASCII">
 <title>Class sub_range</title>
 <link rel="stylesheet" href="../../../../../../doc/html/boostbook.css" type="text/css">
-<meta name="generator" content="DocBook XSL Stylesheets V1.75.1">
+<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="../utilities.html" title="Utilities">
 <link rel="prev" href="iterator_range.html" title="Class iterator_range">
@@ -35,7 +35,7 @@
         is.
       </p>
 <a name="range.utilities.sub_range.synopsis"></a><h5>
-<a name="id3022414"></a>
+<a name="id734808"></a>
         <a class="link" href="sub_range.html#range.utilities.sub_range.synopsis">Synopsis</a>
       </h5>
 <p>
diff --git a/doc/reference/algorithm_ext/iota.qbk b/doc/reference/algorithm_ext/iota.qbk
index 37aba15..c098708 100644
--- a/doc/reference/algorithm_ext/iota.qbk
+++ b/doc/reference/algorithm_ext/iota.qbk
@@ -1,4 +1,4 @@
-[section:for_each for_each]
+[section:iota iota]
 
 [heading Prototype]
 
diff --git a/include/boost/range/adaptor/adjacent_filtered.hpp b/include/boost/range/adaptor/adjacent_filtered.hpp
index 4f0bb75..5f66711 100644
--- a/include/boost/range/adaptor/adjacent_filtered.hpp
+++ b/include/boost/range/adaptor/adjacent_filtered.hpp
@@ -30,94 +30,58 @@ namespace boost
 
 	namespace range_detail
 	{
-		template< class Iter, class R >
+		template< class Iter, class Pred, bool default_pass >
 		class skip_iterator
-		  : public boost::iterator_adaptor< skip_iterator<Iter,R>, Iter >
+		  : public boost::iterator_adaptor<
+                    skip_iterator<Iter,Pred,default_pass>,
+                    Iter,
+                    BOOST_DEDUCED_TYPENAME std::iterator_traits<Iter>::value_type,
+                    boost::forward_traversal_tag,
+                    BOOST_DEDUCED_TYPENAME std::iterator_traits<Iter>::reference,
+                    BOOST_DEDUCED_TYPENAME std::iterator_traits<Iter>::difference_type
+                >
+		  , private Pred
 		{
 		private:
-			typedef boost::iterator_adaptor< skip_iterator<Iter,R>, Iter >
-				  base_t;
-
-			R* range;
+			typedef boost::iterator_adaptor<
+                        skip_iterator<Iter,Pred,default_pass>,
+                        Iter,
+                        BOOST_DEDUCED_TYPENAME std::iterator_traits<Iter>::value_type,
+                        boost::forward_traversal_tag,
+                        BOOST_DEDUCED_TYPENAME std::iterator_traits<Iter>::reference,
+                        BOOST_DEDUCED_TYPENAME std::iterator_traits<Iter>::difference_type
+                    > base_t;
 
 		public:
-			typedef Iter wrapped_iter_t;
+            typedef Pred pred_t;
+			typedef Iter iter_t;
 
-			//
-			// The iterators are bound to the lifetime of the
-			// range and may not exist on their own. Hence it makes no
-			// sense to e.g. wrap them in reverse_iterators
-			// (that can OTOH be done in advance).
-			//
-			typedef std::input_iterator_tag iterator_category;
+            skip_iterator() : m_last() {}
 
-			explicit skip_iterator( R* r, Iter i )
-			  : base_t(i), range(r) {}
-
-			template< class OtherIter, class R2>
-			skip_iterator( const skip_iterator<OtherIter,R2>& other )
-			: base_t( other.base() ) {}
-
-			R* get_range() const { return range; }
-
-		 private:
-			friend class boost::iterator_core_access;
-
-			void increment()
-			{
-				BOOST_ASSERT( range != 0 );
-				range->increment_impl( this->base_reference() );
-			}
-
-			//
-			// Not needed ... just apply a reverse_iterator
-			//
-			void decrement()
+            skip_iterator(iter_t it, iter_t last, const Pred& pred)
+                : base_t(it)
+                , pred_t(pred)
+                , m_last(last)
             {
-                BOOST_ASSERT( false && "you can't decrement an adjacent_filter_iterator" );
+                move_to_next_valid();
             }
 
-			template< class D >
-			void advance( D n )
-            {
-                BOOST_ASSERT( false );
-            }
+			template<class OtherIter>
+			skip_iterator( const skip_iterator<OtherIter, pred_t, default_pass>& other )
+			: base_t(other.base())
+			, pred_t(other)
+			, m_last(other.m_last) {}
 
-		};
-
-		template< class P, class R >
-		struct adjacent_filter_range
-			: iterator_range< skip_iterator<
-			                    BOOST_DEDUCED_TYPENAME range_iterator<R>::type,
-			                    adjacent_filter_range<P,R>
-			                                >
-			                >
-		{
-		private:
-			typedef skip_iterator<
-			                    BOOST_DEDUCED_TYPENAME range_iterator<R>::type,
-			                    adjacent_filter_range<P,R>
-			                     >
-				skip_iter;
-			typedef iterator_range<skip_iter>
-				base_range;
-
-			typedef BOOST_DEDUCED_TYPENAME range_iterator<R>::type raw_iterator;
-
-			P m_bi_pred;
-
-			// Get the first element in the half-open range that
-			// passes the filter predicate.
-			// The adjacent_filter_range must only contain values that pass
-			// through the filter.
-			static raw_iterator to_valid(raw_iterator it, raw_iterator last, const P& bi_pred, bool default_pass)
+            void move_to_next_valid()
 			{
-				if (it != last)
+			    iter_t& it = this->base_reference();
+			    pred_t& bi_pred = *this;
+				if (it != m_last)
 				{
 					if (default_pass)
 					{
-						raw_iterator nxt = ::boost::next(it);
-						while (nxt != last && !bi_pred(*it, *nxt))
+						iter_t nxt = ::boost::next(it);
+						while (nxt != m_last && !bi_pred(*it, *nxt))
 						{
 							++it;
 							++nxt;
@@ -125,41 +89,61 @@ namespace boost
 					}
 					else
 					{
-						raw_iterator nxt = ::boost::next(it);
-						for(; nxt != last; ++it, ++nxt)
+						iter_t nxt = ::boost::next(it);
+						for(; nxt != m_last; ++it, ++nxt)
 						{
 							if (bi_pred(*it, *nxt))
 							{
 								break;
 							}
 						}
-						if (nxt == last)
+						if (nxt == m_last)
 						{
-							it = last;
+							it = m_last;
 						}
 					}
 				}
-				return it;
 			}
 
+			void increment()
+			{
+			    iter_t& it = this->base_reference();
+			    BOOST_ASSERT( it != m_last );
+			    ++it;
+			    move_to_next_valid();
+			}
+
+            iter_t m_last;
+		};
+
+		template< class P, class R, bool default_pass >
+		struct adjacent_filter_range
+			: iterator_range< skip_iterator<
+			                    BOOST_DEDUCED_TYPENAME range_iterator<R>::type,
+			                    P,
+			                    default_pass
+                            >
+                        >
+		{
+		private:
+			typedef skip_iterator<
+                        BOOST_DEDUCED_TYPENAME range_iterator<R>::type,
+                        P,
+                        default_pass
+                     >
+				skip_iter;
+
+			typedef iterator_range<skip_iter>
+				base_range;
+
+			typedef BOOST_DEDUCED_TYPENAME range_iterator<R>::type raw_iterator;
+
 		public:
-			adjacent_filter_range( const P& p, R& r, bool default_pass )
-			: base_range( skip_iter( this, to_valid(boost::begin(r), boost::end(r), p, default_pass)),
-						  skip_iter( this, boost::end(r)   ) ),
-			  m_bi_pred( p ),
-			  m_default_pass(default_pass)
+			adjacent_filter_range( const P& p, R& r )
+			: base_range( skip_iter( boost::begin(r), boost::end(r), p),
+						  skip_iter( boost::end(r), boost::end(r), p) )
 			{
 			}
-
-			void increment_impl( raw_iterator& current )
-			{
-				BOOST_ASSERT( current != this->end().base() );
-
-				current = to_valid(::boost::next(current), this->end().base(), m_bi_pred, m_default_pass);
-			}
-
-		private:
-			bool m_default_pass;
 		};
 
 		template< class T >
@@ -177,37 +161,37 @@ namespace boost
 		};
 
 		template< class ForwardRng, class BinPredicate >
-		inline adjacent_filter_range<BinPredicate, ForwardRng>
+		inline adjacent_filter_range<BinPredicate, ForwardRng, true>
 		operator|( ForwardRng& r,
 				   const adjacent_holder<BinPredicate>& f )
 		{
-			return adjacent_filter_range<BinPredicate, ForwardRng>( f.val, r, true );
+			return adjacent_filter_range<BinPredicate, ForwardRng, true>( f.val, r );
 		}
 
 		template< class ForwardRng, class BinPredicate >
-		inline adjacent_filter_range<BinPredicate, const ForwardRng>
+		inline adjacent_filter_range<BinPredicate, const ForwardRng, true>
 		operator|( const ForwardRng& r,
 				   const adjacent_holder<BinPredicate>& f )
 		{
 			return adjacent_filter_range<BinPredicate,
-				                         const ForwardRng>( f.val, r, true );
+				                         const ForwardRng, true>( f.val, r );
 		}
 
 		template< class ForwardRng, class BinPredicate >
-		inline adjacent_filter_range<BinPredicate, ForwardRng>
+		inline adjacent_filter_range<BinPredicate, ForwardRng, false>
 		operator|( ForwardRng& r,
 				   const adjacent_excl_holder<BinPredicate>& f )
 		{
-			return adjacent_filter_range<BinPredicate, ForwardRng>( f.val, r, false );
+			return adjacent_filter_range<BinPredicate, ForwardRng, false>( f.val, r );
 		}
 
 		template< class ForwardRng, class BinPredicate >
-		inline adjacent_filter_range<BinPredicate, ForwardRng>
+		inline adjacent_filter_range<BinPredicate, ForwardRng, false>
 		operator|( const ForwardRng& r,
 				   const adjacent_excl_holder<BinPredicate>& f )
 		{
 			return adjacent_filter_range<BinPredicate,
-										 const ForwardRng>( f.val, r, false );
+										 const ForwardRng, false>( f.val, r );
 		}
 
 	} // 'range_detail'
@@ -231,17 +215,17 @@ namespace boost
 		}
 
 	    template<class ForwardRng, class BinPredicate>
-	    inline adjacent_filter_range<BinPredicate, ForwardRng>
-	    adjacent_filter(ForwardRng& rng, BinPredicate filter_pred, bool default_pass = true)
+	    inline adjacent_filter_range<BinPredicate, ForwardRng, true>
+	    adjacent_filter(ForwardRng& rng, BinPredicate filter_pred)
 	    {
-	        return adjacent_filter_range<BinPredicate, ForwardRng>(filter_pred, rng, default_pass);
+	        return adjacent_filter_range<BinPredicate, ForwardRng, true>(filter_pred, rng);
 	    }
 
 	    template<class ForwardRng, class BinPredicate>
-	    inline adjacent_filter_range<BinPredicate, const ForwardRng>
-	    adjacent_filter(const ForwardRng& rng, BinPredicate filter_pred, bool default_pass = true)
+	    inline adjacent_filter_range<BinPredicate, const ForwardRng, true>
+	    adjacent_filter(const ForwardRng& rng, BinPredicate filter_pred)
 	    {
-	        return adjacent_filter_range<BinPredicate, const ForwardRng>(filter_pred, rng, default_pass);
+	        return adjacent_filter_range<BinPredicate, const ForwardRng, true>(filter_pred, rng);
 	    }
 
 	} // 'adaptors'
diff --git a/include/boost/range/adaptor/uniqued.hpp b/include/boost/range/adaptor/uniqued.hpp
index 28a30f2..ddaf3fe 100755
--- a/include/boost/range/adaptor/uniqued.hpp
+++ b/include/boost/range/adaptor/uniqued.hpp
@@ -15,68 +15,68 @@
 
 namespace boost
 {
-	
+
 	namespace range_detail
 	{
 		struct unique_forwarder { };
-		
+
 		struct unique_not_equal_to
 		{
 			typedef bool result_type;
-			
+
 			template< class T >
 			bool operator()( const T& l, const T& r ) const
 			{
 				return !(l == r);
 			}
 		};
-		
+
 		template<class ForwardRng>
-		class unique_range : public adjacent_filter_range<unique_not_equal_to, ForwardRng>
+		class unique_range : public adjacent_filter_range<unique_not_equal_to, ForwardRng, true>
 		{
-			typedef adjacent_filter_range<unique_not_equal_to, ForwardRng> base;
+			typedef adjacent_filter_range<unique_not_equal_to, ForwardRng, true> base;
 		public:
 		    explicit unique_range(ForwardRng& rng)
-		        : base(unique_not_equal_to(), rng, true)
+		        : base(unique_not_equal_to(), rng)
 		    {
 		    }
 		};
-		
+
 		template< class ForwardRng >
-		inline unique_range<ForwardRng> 
-		operator|( ForwardRng& r, 
+		inline unique_range<ForwardRng>
+		operator|( ForwardRng& r,
 				   unique_forwarder )
 		{
 			return unique_range<ForwardRng>(r);
 		}
-	
+
 		template< class ForwardRng >
-		inline unique_range<const ForwardRng> 
-		operator|( const ForwardRng& r, 
+		inline unique_range<const ForwardRng>
+		operator|( const ForwardRng& r,
 				   unique_forwarder )
 		{
 			return unique_range<const ForwardRng>(r);
 		}
-		
+
 	} // 'range_detail'
-	
+
 	using range_detail::unique_range;
-	
+
 	namespace adaptors
-	{ 
+	{
 		namespace
 		{
-			const range_detail::unique_forwarder uniqued = 
+			const range_detail::unique_forwarder uniqued =
 				       range_detail::unique_forwarder();
 		}
-		
+
 		template<class ForwardRange>
 		inline unique_range<ForwardRange>
 		unique(ForwardRange& rng)
 		{
 		    return unique_range<ForwardRange>(rng);
 	    }
-	    
+
 	    template<class ForwardRange>
 	    inline unique_range<const ForwardRange>
 	    unique(const ForwardRange& rng)
@@ -84,7 +84,7 @@ namespace boost
 	        return unique_range<const ForwardRange>(rng);
         }
 	} // 'adaptors'
-	
+
 }
 
 #endif
diff --git a/include/boost/range/combine.hpp b/include/boost/range/combine.hpp
index 31a540b..8b1be00 100755
--- a/include/boost/range/combine.hpp
+++ b/include/boost/range/combine.hpp
@@ -3,6 +3,7 @@
 
 #include <boost/iterator/zip_iterator.hpp>
 #include <boost/tuple/tuple.hpp>
+#include <boost/range/iterator.hpp>
 #include <boost/range/iterator_range.hpp>
 #include <boost/type_traits/is_void.hpp>
 #include <boost/type_traits/is_same.hpp>
@@ -14,40 +15,48 @@
 
 namespace boost
 {
-    namespace detail
+    namespace range_detail
     {
         struct void_ { typedef void_ type; };
     }
 
-    template<> struct range_iterator<detail::void_>
+    template<> struct range_iterator< ::boost::range_detail::void_ >
     {
-       typedef tuples::null_type type;
+       typedef ::boost::tuples::null_type type;
     };
 
-    namespace detail
+    namespace range_detail
     {
-        inline tuples::null_type range_begin( void_& ) 
-        { return tuples::null_type(); }
+        inline ::boost::tuples::null_type range_begin( ::boost::range_detail::void_& )
+        { return ::boost::tuples::null_type(); }
 
-        inline tuples::null_type range_end( void_& ) 
-        { return tuples::null_type(); }
+        inline ::boost::tuples::null_type range_begin( const ::boost::range_detail::void_& )
+        { return ::boost::tuples::null_type(); }
+
+        inline ::boost::tuples::null_type range_end( ::boost::range_detail::void_& )
+        { return ::boost::tuples::null_type(); }
+
+        inline ::boost::tuples::null_type range_end( const ::boost::range_detail::void_& )
+        { return ::boost::tuples::null_type(); }
 
         template< class T >
         struct tuple_iter
         {
-            typedef typename mpl::eval_if_c< is_same<T,void_>::value,
-                                             mpl::identity<tuples::null_type>,
-                                             range_iterator<T> >::type
-                type;
+            typedef BOOST_DEDUCED_TYPENAME ::boost::mpl::eval_if_c<
+                ::boost::is_same<T, ::boost::range_detail::void_ >::value,
+                ::boost::mpl::identity< ::boost::tuples::null_type >,
+                ::boost::range_iterator<T>
+            >::type type;
         };
 
         template< class Rng1, class Rng2 >
         struct tuple_range
         {
-            typedef typename mpl::eval_if_c< is_same<Rng1,void_>::value,
-                                             void_,
-                                             mpl::identity<Rng1> >::type
-                type; 
+            typedef BOOST_DEDUCED_TYPENAME ::boost::mpl::eval_if_c<
+                ::boost::is_same<Rng1, ::boost::range_detail::void_ >::value,
+                ::boost::range_detail::void_,
+                ::boost::mpl::identity<Rng1>
+            >::type type;
         };
 
         template
@@ -57,36 +66,37 @@ namespace boost
             class R3,
             class R4,
             class R5,
-            class R6 
+            class R6
         >
         struct generate_tuple
         {
-            typedef boost::tuple< typename tuple_iter<R1>::type,
-                                  typename tuple_iter<R2>::type,
-                                  typename tuple_iter<R3>::type,
-                                  typename tuple_iter<R4>::type,
-                                  typename tuple_iter<R5>::type,
-                                  typename tuple_iter<R6>::type >
-                type;
+            typedef ::boost::tuples::tuple<
+                        BOOST_DEDUCED_TYPENAME tuple_iter<R1>::type,
+                        BOOST_DEDUCED_TYPENAME tuple_iter<R2>::type,
+                        BOOST_DEDUCED_TYPENAME tuple_iter<R3>::type,
+                        BOOST_DEDUCED_TYPENAME tuple_iter<R4>::type,
+                        BOOST_DEDUCED_TYPENAME tuple_iter<R5>::type,
+                        BOOST_DEDUCED_TYPENAME tuple_iter<R6>::type
+                    > type;
 
             static type begin( R1& r1, R2& r2, R3& r3, R4& r4, R5& r5, R6& r6 )
             {
-                return make_tuple( boost::begin(r1),
-                                   boost::begin(r2),
-                                   boost::begin(r3),
-                                   boost::begin(r4),
-                                   boost::begin(r5),
-                                   boost::begin(r6) );
+                return ::boost::tuples::make_tuple( ::boost::begin(r1),
+                                                    ::boost::begin(r2),
+                                                    ::boost::begin(r3),
+                                                    ::boost::begin(r4),
+                                                    ::boost::begin(r5),
+                                                    ::boost::begin(r6) );
             }
 
             static type end( R1& r1, R2& r2, R3& r3, R4& r4, R5& r5, R6& r6 )
             {
-                return make_tuple( boost::end(r1),
-                                   boost::end(r2),
-                                   boost::end(r3),
-                                   boost::end(r4),
-                                   boost::end(r5),
-                                   boost::end(r6) );
+                return ::boost::tuples::make_tuple( ::boost::end(r1),
+                                                    ::boost::end(r2),
+                                                    ::boost::end(r3),
+                                                    ::boost::end(r4),
+                                                    ::boost::end(r5),
+                                                    ::boost::end(r6) );
             }
         };
 
@@ -101,54 +111,52 @@ namespace boost
         >
         struct zip_rng
             : iterator_range<
-                zip_iterator< typename generate_tuple<R1,R2,R3,R4,R5,R6>::type >
-                            >
+                zip_iterator<
+                    BOOST_DEDUCED_TYPENAME generate_tuple<R1,R2,R3,R4,R5,R6>::type
+                >
+            >
         {
         private:
-            typedef generate_tuple<R1,R2,R3,R4,R5,R6>
-                generator;
-            typedef typename generator::type
-                tuple;
-            typedef zip_iterator<tuple>
-                zip_iter;
-            typedef iterator_range<zip_iter>
-                base;
+            typedef generate_tuple<R1,R2,R3,R4,R5,R6>        generator_t;
+            typedef BOOST_DEDUCED_TYPENAME generator_t::type tuple_t;
+            typedef zip_iterator<tuple_t>                    zip_iter_t;
+            typedef iterator_range<zip_iter_t>               base_t;
 
         public:
             zip_rng( R1& r1, R2& r2, R3& r3, R4& r4, R5& r5, R6& r6 )
-            : base( zip_iter( generator::begin(r1,r2,r3,r4,r5,r6) ),
-                    zip_iter( generator::end(r1,r2,r3,r4,r5,r6) ) )
+            : base_t( zip_iter_t( generator_t::begin(r1,r2,r3,r4,r5,r6) ),
+                      zip_iter_t( generator_t::end(r1,r2,r3,r4,r5,r6) ) )
             {
-		BOOST_ASSERT(boost::distance(r1) <= boost::distance(r2));
-		BOOST_ASSERT(boost::distance(r1) <= boost::distance(r3));
-		BOOST_ASSERT(boost::distance(r1) <= boost::distance(r4));
-		BOOST_ASSERT(boost::distance(r1) <= boost::distance(r5));
-		BOOST_ASSERT(boost::distance(r1) <= boost::distance(r6));
+                BOOST_ASSERT(::boost::distance(r1) <= ::boost::distance(r2));
+                BOOST_ASSERT(::boost::distance(r1) <= ::boost::distance(r3));
+                BOOST_ASSERT(::boost::distance(r1) <= ::boost::distance(r4));
+                BOOST_ASSERT(::boost::distance(r1) <= ::boost::distance(r5));
+                BOOST_ASSERT(::boost::distance(r1) <= ::boost::distance(r6));
             }
 
             template< class Zip, class Rng >
             zip_rng( Zip& z, Rng& r )
-            : base( zip_iter( generator::begin( z, r ) ),
-                    zip_iter( generator::end( z, r ) ) )
+            : base_t( zip_iter_t( generator_t::begin( z, r ) ),
+                      zip_iter_t( generator_t::end( z, r ) ) )
             {
 
                 // @todo: tuple::begin( should be overloaded for this situation
             }
 
-            struct tuple_length : tuples::length<tuple>
+            struct tuple_length : ::boost::tuples::length<tuple_t>
             { };
 
             template< unsigned N >
             struct get
             {
                 template< class Z, class R >
-                static typename tuples::element<N,tuple>::type begin( Z& z, R& )
+                static BOOST_DEDUCED_TYPENAME ::boost::tuples::element<N,tuple_t>::type begin( Z& z, R& )
                 {
                     return get<N>( z.begin().get_iterator_tuple() );
                 }
 
                 template< class Z, class R >
-                static typename tuples::element<N,tuple>::type end( Z& z, R& r )
+                static BOOST_DEDUCED_TYPENAME ::boost::tuples::element<N,tuple_t>::type end( Z& z, R& r )
                 {
                     return get<N>( z.end().get_iterator_tuple() );
                 }
@@ -157,64 +165,70 @@ namespace boost
         };
 
         template< class Rng1, class Rng2 >
-        struct zip_range 
-            : iterator_range< 
-                zip_iterator< 
-                    tuple< typename range_iterator<Rng1>::type,
-                           typename range_iterator<Rng2>::type >
-                            > > 
+        struct zip_range
+            : iterator_range<
+                zip_iterator<
+                    ::boost::tuples::tuple<
+                        BOOST_DEDUCED_TYPENAME ::boost::range_iterator<Rng1>::type,
+                        BOOST_DEDUCED_TYPENAME ::boost::range_iterator<Rng2>::type
+                    >
+                >
+            >
         {
         private:
-            typedef zip_iterator< 
-                tuple< typename range_iterator<Rng1>::type,
-                       typename range_iterator<Rng2>::type >
+            typedef zip_iterator<
+                        ::boost::tuples::tuple<
+                            BOOST_DEDUCED_TYPENAME ::boost::range_iterator<Rng1>::type,
+                            BOOST_DEDUCED_TYPENAME ::boost::range_iterator<Rng2>::type
                         >
-                zip_iter;
-            typedef iterator_range<zip_iter>
-                base;
+                    > zip_iter_t;
+            typedef iterator_range<zip_iter_t> base_t;
 
         public:
             zip_range( Rng1& r1, Rng2& r2 )
-            : base( zip_iter( make_tuple(boost::begin(r1), 
-                                         boost::begin(r2)) ),
-                    zip_iter( make_tuple(boost::end(r1), 
-                                         boost::end(r2)) ) )
+            : base_t( zip_iter_t( ::boost::tuples::make_tuple(::boost::begin(r1),
+                                                              ::boost::begin(r2)) ),
+                      zip_iter_t( ::boost::tuples::make_tuple(::boost::end(r1),
+                                                              ::boost::end(r2)) ) )
             {
-		BOOST_ASSERT(boost::distance(r1) <= boost::distance(r2));
+                BOOST_ASSERT(::boost::distance(r1) <= ::boost::distance(r2));
             }
         };
 
         template< class Rng1, class Rng2, class Rng3 >
-        struct zip_range3 
-            : iterator_range< 
-                zip_iterator< 
-                    tuple< typename range_iterator<Rng1>::type,
-                           typename range_iterator<Rng2>::type,
-                           typename range_iterator<Rng3>::type >
-                            > > 
+        struct zip_range3
+            : iterator_range<
+                zip_iterator<
+                    ::boost::tuples::tuple<
+                        BOOST_DEDUCED_TYPENAME ::boost::range_iterator<Rng1>::type,
+                        BOOST_DEDUCED_TYPENAME ::boost::range_iterator<Rng2>::type,
+                        BOOST_DEDUCED_TYPENAME ::boost::range_iterator<Rng3>::type
+                    >
+                >
+            >
         {
         private:
-            typedef zip_iterator< 
-                tuple< typename range_iterator<Rng1>::type,
-                       typename range_iterator<Rng2>::type, 
-                       typename range_iterator<Rng3>::type >
-                        >
-                zip_iter;
-            typedef iterator_range<zip_iter>
-                base;
+            typedef zip_iterator<
+                ::boost::tuples::tuple<
+                    BOOST_DEDUCED_TYPENAME ::boost::range_iterator<Rng1>::type,
+                    BOOST_DEDUCED_TYPENAME ::boost::range_iterator<Rng2>::type,
+                    BOOST_DEDUCED_TYPENAME ::boost::range_iterator<Rng3>::type
+                >
+            > zip_iter_t;
+            typedef iterator_range<zip_iter_t> base_t;
 
         public:
             zip_range3( Rng1& r1, Rng2& r2, Rng3& r3 )
-            : base( zip_iter( make_tuple(boost::begin(r1), 
-                                         boost::begin(r2),
-                                         boost::begin(r3)) ),
-                    zip_iter( make_tuple(boost::end(r1), 
-                                         boost::end(r2),
-                                         boost::end(r3)) )
-                   )
+            : base_t( zip_iter_t( ::boost::tuples::make_tuple(::boost::begin(r1),
+                                                              ::boost::begin(r2),
+                                                              ::boost::begin(r3)) ),
+                      zip_iter_t( ::boost::tuples::make_tuple(::boost::end(r1),
+                                                              ::boost::end(r2),
+                                                              ::boost::end(r3)) )
+                    )
             {
-		BOOST_ASSERT(distance(r1) <= distance(r2));
-		BOOST_ASSERT(distance(r1) <= distance(r3));
+                BOOST_ASSERT(::boost::distance(r1) <= ::boost::distance(r2));
+                BOOST_ASSERT(::boost::distance(r1) <= ::boost::distance(r3));
             }
         };
 
@@ -222,89 +236,61 @@ namespace boost
         struct combine_tag {};
 
         template< class Rng >
-        inline zip_rng<Rng> 
+        inline zip_rng<Rng>
         operator&( combine_tag, Rng& r )
         {
             return zip_rng<Rng>(r);
         }
 
         template< class Rng >
-        inline iterator_range<const Rng> 
+        inline iterator_range<const Rng>
         operator&( combine_tag, const Rng& r )
         {
             return iterator_range<const Rng>(r);
         }
 
         template
-        < 
-            class R1, 
+        <
+            class R1,
             class R2,
             class R3,
             class R4,
             class R5,
             class Rng
         >
-        inline typename zip_rng<R1,R2,R3,R4,R5>::next 
-        operator&( const zip_rng<R1,R2,R3,R4,R5>& zip, 
+        inline BOOST_DEDUCED_TYPENAME zip_rng<R1,R2,R3,R4,R5>::next
+        operator&( const zip_rng<R1,R2,R3,R4,R5>& zip,
                    Rng& r )
         {
             return zip_rng<R1,R2,R3,R4,R5>::next( zip, r );
         }
 
-        //
-        // This one should be able to be made generic
-        //
-        // template
-        // <
-        //     class R1, 
-        //     class R2 = void, 
-        //     class R3 = void, 
-        //     class R4 = void, 
-        //     class R5 = void,
-        //     class R6 = void
-        // >
-        // inline zip_range<R1,R2,R3,R4,R4,R5,R6>::type
-        // x
-        //
-        //
-        /*
-        template< class Rng1, class Rng2, class Rng3 >
-        inline zip_range3<Rng1,Rng2,Rng3>
-        operator&( const zip_range<Rng1,Rng2>& r1, const Rng3& r3 )
-        {
-            return zip_range3<Rn1,Rng2,Rng3>(
-        }*/
-
-    } // namespace 'detail'
+    } // namespace range_detail
 
     template< class Rng1, class Rng2 >
-    inline detail::zip_range<Rng1,Rng2> combine( Rng1& r1, Rng2& r2 )
+    inline ::boost::range_detail::zip_range<Rng1, Rng2> combine( Rng1& r1, Rng2& r2 )
     {
-        return detail::zip_range<Rng1,Rng2>(r1,r2);
+        return ::boost::range_detail::zip_range<Rng1, Rng2>(r1, r2);
     }
 
     template< class Rng1, class Rng2 >
-    inline detail::zip_range<const Rng1,Rng2> combine( const Rng1& r1, Rng2& r2 )
+    inline ::boost::range_detail::zip_range<const Rng1, Rng2> combine( const Rng1& r1, Rng2& r2 )
     {
-        return detail::zip_range<const Rng1,Rng2>(r1,r2);
+        return ::boost::range_detail::zip_range<const Rng1, Rng2>(r1, r2);
     }
 
     template< class Rng1, class Rng2 >
-    inline detail::zip_range<Rng1,const Rng2> combine( Rng1& r1, const Rng2& r2 )
+    inline ::boost::range_detail::zip_range<Rng1, const Rng2> combine( Rng1& r1, const Rng2& r2 )
     {
-        return detail::zip_range<Rng1,Rng2>(r1,r2);
+        return ::boost::range_detail::zip_range<Rng1, const Rng2>(r1, r2);
     }
 
     template< class Rng1, class Rng2 >
-    inline detail::zip_range<const Rng1,const Rng2> combine( const Rng1& r1, const Rng2& r2 )
+    inline ::boost::range_detail::zip_range<const Rng1, const Rng2> combine( const Rng1& r1, const Rng2& r2 )
     {
-        return detail::zip_range<const Rng1,const Rng2>(r1,r2);
+        return ::boost::range_detail::zip_range<const Rng1, const Rng2>(r1, r2);
     }
 
-    //
-    // @todo: find a solution that scales better
-    //        instead of adding 6 overloads!
-    //
-}
+} // namespace boost
 
 #endif
diff --git a/include/boost/range/size_type.hpp b/include/boost/range/size_type.hpp
old mode 100755
new mode 100644
index 7ed8dfa..9993d55
--- a/include/boost/range/size_type.hpp
+++ b/include/boost/range/size_type.hpp
@@ -67,7 +67,8 @@ namespace boost
     { };
 
     template< class T >
-    struct range_size<const T > : range_size<T>
+    struct range_size<const T >
+		: detail::range_size<T>
     { };
     
 } // namespace boost
diff --git a/test/combine.cpp b/test/combine.cpp
index 9e29a11..c020626 100644
--- a/test/combine.cpp
+++ b/test/combine.cpp
@@ -11,7 +11,7 @@
 #include <boost/range/combine.hpp>
 #include <boost/test/test_tools.hpp>
 #include <boost/test/unit_test.hpp>
-#include <boost/assign/list_of.hpp>
+#include <boost/tuple/tuple.hpp>
 #include <boost/foreach.hpp>
 #include <vector>
 
@@ -26,23 +26,25 @@ struct add
 };
 
 template< class CombinedRng >
-void apply( const CombinedRng& r ) 
+void apply( const CombinedRng& r )
 {
     std::vector<int> v;
-    for( typename boost::range_iterator<const CombinedRng>::type 
-            i = boost::begin(r),
-            e = boost::end(r);
-         i != e; ++i )
+    typedef BOOST_DEDUCED_TYPENAME boost::range_iterator<const CombinedRng>::type iterator_t;
+
+    iterator_t e = boost::end(r);
+    for (iterator_t i = boost::begin(r); i != e; ++i)
     {
-        
     }
 }
 
 void test_combine()
 {
     std::vector<int> v1, v2, v3;
-    v1 = boost::assign::list_of(1)(2)(3)(4);
-    v2 = boost::assign::list_of(1)(2)(3)(4);
+    for (int i = 1; i <= 4; ++i)
+    {
+        v1.push_back(i);
+        v2.push_back(i);
+    }
 
     int i1, i2;
     BOOST_FOREACH( boost::tie( i1, i2 ), boost::combine(v1,v2) )
diff --git a/test/iterator_range.cpp b/test/iterator_range.cpp
index 47bc565..cf22463 100644
--- a/test/iterator_range.cpp
+++ b/test/iterator_range.cpp
@@ -61,7 +61,7 @@ void check_iterator_range()
     BOOST_CHECK_EQUAL( r2.size(), size( r2 ) );
 
     BOOST_CHECK_EQUAL( std::distance( r.begin(), r.end() ),
-                       std::distance( begin( r2 ), end( r2 ) ) );
+		               std::distance( boost::begin( r2 ), boost::end( r2 ) ) );
     std::cout << r << r2;
 
 

From 13b748a22869ebf04fc7a43c419e4bcb4b2e99ff Mon Sep 17 00:00:00 2001
From: Neil Groves <neil@grovescomputing.com>
Date: Sat, 10 Apr 2010 15:25:56 +0000
Subject: [PATCH 32/73] Boost.Range removed deprecated html documentation.

[SVN r61181]
---
 doc/boost_range.html                          | 769 ------------------
 doc/examples.html                             |  72 --
 doc/faq.html                                  | 145 ----
 doc/headers.html                              | 202 -----
 doc/history_ack.html                          |  90 --
 .../range_algorithm_introduction.html         | 257 ------
 .../range_algorithm_mutating_algorithms.html  |  50 --
 .../copy.html                                 | 115 ---
 .../copy_backward.html                        | 124 ---
 .../range_algorithm_new_algorithms.html       |  41 -
 ...nge_algorithm_non_mutating_algorithms.html |  42 -
 doc/intro.html                                | 164 ----
 doc/istream_range.html                        |  64 --
 doc/mfc_atl.html                              | 581 -------------
 doc/portability.html                          | 103 ---
 doc/range.html                                | 379 ---------
 doc/style.html                                | 132 ---
 doc/upgrading.html                            |  78 --
 doc/utility_class.html                        | 380 ---------
 19 files changed, 3788 deletions(-)
 delete mode 100644 doc/boost_range.html
 delete mode 100644 doc/examples.html
 delete mode 100644 doc/faq.html
 delete mode 100644 doc/headers.html
 delete mode 100644 doc/history_ack.html
 delete mode 100644 doc/html/range/reference/range_algorithm/range_algorithm_introduction.html
 delete mode 100644 doc/html/range/reference/range_algorithm/range_algorithm_mutating_algorithms.html
 delete mode 100644 doc/html/range/reference/range_algorithm/range_algorithm_mutating_algorithms/copy.html
 delete mode 100644 doc/html/range/reference/range_algorithm/range_algorithm_mutating_algorithms/copy_backward.html
 delete mode 100644 doc/html/range/reference/range_algorithm/range_algorithm_new_algorithms.html
 delete mode 100644 doc/html/range/reference/range_algorithm/range_algorithm_non_mutating_algorithms.html
 delete mode 100644 doc/intro.html
 delete mode 100755 doc/istream_range.html
 delete mode 100644 doc/mfc_atl.html
 delete mode 100644 doc/portability.html
 delete mode 100644 doc/range.html
 delete mode 100644 doc/style.html
 delete mode 100644 doc/upgrading.html
 delete mode 100644 doc/utility_class.html

diff --git a/doc/boost_range.html b/doc/boost_range.html
deleted file mode 100644
index b9fd0ca..0000000
--- a/doc/boost_range.html
+++ /dev/null
@@ -1,769 +0,0 @@
-<!DOCTYPE HTML PUBLIC "-//W3C//DTD HTML 4.01 Transitional//EN">
-<html>
-    <head>
-        <title>Boost.Range Reference </title>
-        <meta http-equiv="Content-Type" content="text/html; charset=iso-8859-1">
-        <link rel="stylesheet" href="style.css" type="text/css">
-    </head>
-    <body>
-        <table>
-            <tr>
-                <td><img src="../../../boost.png" width="100%" border="0"></td>
-                <td><h1><br>
-                        Boost.Range
-                    </h1>
-                </td>
-            </tr>
-        </table>
-        <h2>Synopsis and Reference
-        </h2>
-        <ul>
-            <li>
-                <a href="#overview">Overview</a>
-            <li>
-                <a href="#Synopsis">Synopsis</a>
-            <li>
-                <a href="#Semantics">Semantics</a>
-            <li>
-                <a href="#minimal_interface">Extending the library</a></li>
-        </ul>
-        <hr size="1">
-        <a name="overview"></a>
-        <h3>Overview</h3>
-        <p>
-            Three types of objects are currently supported by the library:
-            <ul>
-                <li>
-                standard-like containers
-                <li>
-                    <code>std::pair&lt;iterator,iterator&gt;</code>
-                  <li>
-                    built-in arrays
-                </li>
-            </ul>
-            Even though the behavior of the primary templates are exactly such that 
-            standard containers will be supported by default, the requirements are much 
-            lower than the standard container requirements. For example, the utility class <a href="utility_class.html#iter_range">
-                <code>iterator_range</code></a> implements the <a href="#minimal_interface">minimal 
-                interface</a> required to make the class a <a href="range.html#forward_range">Forward 
-                Range</a>
-        .
-        <P></P>
-        <p>
-            Please also see <a href="range.html">Range concepts</a> for more details.
-        </p>
-        <a name="Synopsis"></a>
-        <h3>Synopsis</h3>
-        <p>
-            <pre>
-<span class=keyword>namespace </span><span class=identifier>boost</span>
-<span class=special>{
-    </span><span class=comment>//
-    // Single Pass Range metafunctions
-    //
-                   
-    </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><a href="#range_iterator"><span 
-class=identifier>range_iterator</span></a><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><a href="#range_value"><span 
-class=identifier>range_value</span></a><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><a href="#range_reference"><span 
-class=identifier>range_reference</span></a><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><a href="#range_pointer"><span 
-class=identifier>range_pointer</span></a><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><a href="#range_category"><span 
-class=identifier>range_category</span></a><span class=special>;
-
-    </span><span class=comment>//
-    // Forward Range metafunctions
-    //
-    
-    </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><a href="#range_difference"><span 
-class=identifier>range_difference</span></a><span class=special>;
-    
-    </span><span class=comment>//
-    // Bidirectional Range metafunctions
-    //
-    
-    </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><a 
-href="#range_reverse_iterator"><span
-class=identifier>range_reverse_iterator</span></a><span class=special>;
-    
-    </span><span class=comment>//
-    // Single Pass Range functions
-    //
-    
-    </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></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><a href="#begin"><span class=identifier>begin</span></a><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=keyword></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><a href="#begin"><span class=identifier>begin</span></a><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></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><a href="#end"><span class=identifier>end</span></a><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=keyword></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><a href="#end"><span class=identifier>end</span></a><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></span><span class=keyword>bool
-    </span><a href="#empty"><span class=identifier>empty</span></a><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>//
-    // Forward Range functions
-    //
-    
-    </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></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><a href="#size"><span class=identifier>distance</span></a><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>//
-    // Bidirectional Range functions
-    //
-                     
-    </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></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><a href="#rbegin"><span class=identifier>rbegin</span></a><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=keyword></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><a href="#rbegin"><span class=identifier>rbegin</span></a><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></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><a href="#rend"><span class=identifier>rend</span></a><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=keyword></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><a href="#rend"><span class=identifier>rend</span></a><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>//
-    // Random Access Range functions
-    //
-    
-    </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></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><a href="#size"><span class=identifier>size</span></a><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>//
-    // Special const Range functions
-    // 
-    </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>
-    <a href="#const_begin"><span class=identifier>const_begin</span></a><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>
-    <a href="#const_end"><span class=identifier>const_end</span></a><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>
-    <a href="#const_rbegin"><span class=identifier>const_rbegin</span></a><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>
-    <a href="#const_rend"><span class=identifier>const_rend</span></a><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>//
-    // String utilities
-    //</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=identifier>see</span> <span class=identifier>below</span><span class=special>...&gt;</span> 
-    <span class=identifier><a href="#as_literal">as_literal</a></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=identifier>see</span> <span class=identifier>below</span><span class=special>...&gt;</span> 
-    <span class=identifier><a href="#as_array">as_literal</a></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><a href="#as_array">as_array</a></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><a href="#as_literal">as_array</a></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>
-        <P></P>
-        <a name="Semantics"></a>
-        <h3>Semantics</h3>
-        <h4>notation</h4>
-        <p>
-            <table cellpadding="5" border="1">
-                <tr>
-                    <th>
-                        Type
-                        <th>
-                            Object
-                            <th>
-                    Describes
-                </tr>
-                <tr>
-                    <td><code>X</code>
-                    <td><code>x</code>
-                    <td>any type</td>
-                <tr>
-                    <td><code>T</code>
-                    </td>
-                    <td><code>t</code>
-                    <td>denotes behavior of the primary templates</td>
-                </tr>
-                <tr>
-                    <td><code>P</code>
-                    <td><code>p</code>
-                    <td>denotes <code>std::pair&lt;iterator,iterator&gt;</code></td>
-                <tr>
-                    <td><code>A[sz]</code>
-                    <td><code>a</code>
-                    <td>denotes an array of type <code>A</code> of size <code>sz</code>
-                </tr>
-                <tr>
-                    <td><code>Char*</code>
-                    <td><code>s</code>
-                    <td>denotes either <code>char*</code> or <code>wchar_t*</code></td>
-                </tr>
-            </table>
-        </p>
-        <p>
-            Please notice in tables below that when four lines appear in a cell, the first 
-            line will describe the primary template, the second line pairs of iterators, 
-            the third line arrays and the last line null-terminated strings.
-        </p>
-        <h4>Metafunctions</h4>
-        <p>
-            <table border="1" cellpadding="5">
-                <tr>
-                    <th>
-                        Expression</th>
-                    <th>
-                        Return type</th>
-                    <th>
-                        Complexity</th>
-                </tr>
-                
-                <tr >
-                    <td><a name="range_iterator"></a><code>range_iterator&lt;X&gt;::type</code></td>
-                    <td><code>T::iterator</code><br>
-                        <code>P::first_type</code><br>
-                        <code>A*</code><br>
-
-                    <td>compile time</td>
-                </tr>
-                <tr>
-                    
-                    <td><a name="range_const_iterator"></a><code>range_iterator&lt;const X&gt;::type</code></td>
-                    <td><code>T::const_iterator</code><br>
-                        <code>P::first_type</code><br>
-                        <code>const A*</code><br>
-
-                    <td>compile time</td>
-                </tr>
-                <tr>
-                    
-                    <td><a name="range_value"></a><code>range_value&lt;X&gt;::type</code></td>
-                    <td><code>boost::iterator_value&lt;range_iterator&lt;X&gt;::type&gt;::type</code>
-                     </td>  
-                    <td>compile time</td>
-                </tr>
-                <tr>
-                    
-                    <td><a name="range_reference"></a><code>range_reference&lt;X&gt;::type</code></td>
-                    <td><code>boost::iterator_reference&lt;range_iterator&lt;X&gt;::type&gt;::type</code>
-                     </td>  
-                    <td>compile time</td>
-                </tr>
-
-                                <tr>
-                    
-                    <td><a name="range_pointer"></a><code>range_pointer&lt;X&gt;::type</code></td>
-                    <td><code>boost::iterator_pointer&lt;range_iterator&lt;X&gt;::type&gt;::type</code>
-                     </td>  
-                    <td>compile time</td>
-                </tr>
-                
-                                <tr>
-                    
-                    <td><a name="range_category"></a><code>range_category&lt;X&gt;::type</code></td>
-                    <td><code>boost::iterator_category&lt;range_iterator&lt;X&gt;::type&gt;::type</code>
-                     </td>  
-                    <td>compile time</td>
-                </tr>
-                <tr>
-                    
-                    <td><a name="range_difference"></a><code>range_difference&lt;X&gt;::type</code></td>
-                    <td>
-                        <code>boost::iterator_difference&lt;range_iterator&lt;X&gt;::type&gt;::type</code></td>
-                        
-                    <td>compile time</td>
-                </tr>
-
-                <tr>
-                    
-                    <td><a name="range_reverse_iterator"></a><code>range_reverse_iterator&lt;X&gt;::type</code></td>
-                    <td><code>boost::reverse_iterator&lt;range_iterator&lt;X&gt;::type&gt;</code><br>
-                    <td>compile time</td>
-                </tr>
-                <tr>
-                    
-                    <td><a name="range_const_reverse_iterator"></a><code>range_reverse_iterator&lt;const X&gt;::type</code></td>
-                    <td><code>boost::reverse_iterator&lt;range_iterator&lt;const X&gt;::type&gt;</code>
-                        <br>
-                    <td>compile time</td>
-                </tr>
-            </table>
-        </p>
-        <h4>Functions</h4>
-        <p>
-            <table border="1" cellpadding="5">
-                <tr>
-                    <th>
-                        Expression</th>
-                    <th>
-                        Return type</th>
-                    <th>
-                        Returns</th>
-                    <th>
-                        Complexity</th>
-                </tr>
-                <tr>
-                    
-                    <td><a name="begin"></a><code>begin(x)</code></td>
-                    <td><code>range_iterator&lt;X&gt;::type</code></td>
-                    <td>
-                        <code>p.first</code> if <code>p</code> is of type <code>std::pair&lt;T&gt;<code><br>
-                        <code>a</code> if <code>a</code> is an array <br>
-                        <code>range_begin(x)</code> if that expression would invoke a function found by ADL <br>
-                        <code>t.begin()</code> otherwise
-   
-                    <td>constant time</td>
-                </tr>
-                <tr>
-                    
-                    <td><a name="end"></a><code>end(x)</code></td>
-                    <td><code>range_iterator&lt;X&gt;::type</code></td>
-                    <td>
-                        <code>p.second</code> if <code>p</code> is of type <code>std::pair&lt;T&gt;<code><br>
-                        <code>a + sz</code> if <code>a</code> is an array of size <code>sz</code>
-                        
-                        <br>
-                        <code>range_end(x)</code> if that expression would invoke a function found by ADL <br>
-                        <code>t.end()</code> otherwise
-                        
-                    <td>
-                        constant time </td>
-                </tr>
-                <tr>
-                    
-                    <td><a name="empty"></a><code>empty(x)</code></td>
-                    <td><code>bool</code></td>
-                    <td><code>boost::begin(x) == boost::end(x)</code><br>
-                    <td> constant time <br>
-                    </td>
-                </tr>
-                <tr>
-                    
-                    <td><a name="distance"></a><code>distance(x)</code></td>
-                    <td><code>range_difference&lt;X&gt;::type</code></td>
-                    <td>
-                        <code>
-                            std::distance(boost::begin(x),boost::end(x))
-                        </code>
-                         </td>
-                    <td>-</td>     
-
-                </tr>
-
-                <tr>
-                    
-                    <td><a name="size"></a><code>size(x)</code></td>
-                    <td><code>range_difference&lt;X&gt;::type</code></td>
-                    <td><code> boost::end(x) - boost::begin(x)</code>
-                        
-                    <td>          constant time </td>
-                </tr>
-                <tr>
-                    
-                    <td><a name="rbegin"></a><code>rbegin(x)</code></td>
-                    <td><code>range_reverse_iterator&lt;X&gt;::type</code></td>
-                    <td><code>range_reverse_iterator&lt;X&gt;::type( boost::end(x) )</code>
-                        <br>
-                    <td>constant time
-                    </td>
-                </tr>
-                <tr>
-                   
-                    <td> <a name="rend"></a><code>rend(x)</code></td>
-                    <td><code>range_reverse_iterator&lt;X&gt;::type</code></td>
-                    <td><code>range_reverse_iterator&lt;X&gt;::type( boost::begin(x) )</code>
-                    <td>constant time</td>
-                </tr>
-                <tr>
-                    
-                    <td><a name="const_begin"></a><code>const_begin(x)</code></td>
-                    <td><code>range_iterator&lt;const X&gt;::type</code></td>
-                    <td><code>range_iterator&lt;const X&gt;::type( boost::begin(x) )</code>
-                        <br>
-                    <td>constant time
-                    </td>
-                </tr>
-                <tr>
-                    
-                    <td><a name="const_end"></a><code>const_end(x)</code></td>
-                    <td><code>range_iterator&lt;const X&gt;::type</code></td>
-                    <td><code>range_iterator&lt;const X&gt;::type( boost::end(x) )</code>
-                    <td>constant time</td>
-                </tr>
-                <tr>
-                    
-                    <td><a name="const_rbegin"></a><code>const_rbegin(x)</code></td>
-                    <td><code>range_reverse_iterator&lt;const X&gt;::type</code></td>
-                    <td><code>range_reverse_iterator&lt;const X&gt;::type( boost::rbegin(x) )</code>
-                        <br>
-                    <td>constant time
-                    </td>
-                </tr>
-                <tr>
-                    
-                    <td><a name="const_rend"></a><code>const_rend(x)</code></td>
-                    <td><code>range_reverse_iterator&lt;const X&gt;::type</code></td>
-                    <td><code>range_reverse_iterator&lt;const X&gt;::type( boost::rend(x) )</code>                    
-        
-                    <td>constant time</td>
-                </tr>
-                 <tr>
-                    
-                    <td><a name="as_literal"></a><code>as_literal(x)</code></td>
-                     <td><code>iterator_range&lt;U></code> where <code>U</code> is 
-                        <code>Char*</code> if <code>x</code> is a pointer to a 
-                        string and <code>U</code> is
-                        <code>range_iterator&lt;X>::type</code> otherwise
-                        </td>
-                     <td>
-                         
-                       <!-- <code>[a,a+sz-1)</code> if <code>a</code> is an array 
-                       of size <code>sz</code><br>-->
-                            <code>[s,s + std::char_traits&lt;X&gt;::length(s))</code> if <code>s</code> is a <code>Char*</code> or an array of <code>Char</code>
-                                <br>
-                                    <code>[boost::begin(x),boost::end(x))</code> otherwise
-
-
-                         
-                         </td>   
-                    <td>linear time for pointers to a string or arrays of 
-                        <code>Char</code>, constant time otherwise</td>
-                </tr>
-                 <tr>
-                    
-                    <td><a name="as_array"></a><code>as_array(x)</code></td>
-                     <td><code>iterator_range&lt;X></code>                       </td>
-                     <td>
-                                  <code>[boost::begin(x),boost::end(x))</code> 
-                                    
-
-
-                         
-                         </td>   
-                    <td>constant time otherwise</td>
-                </tr>
-
-            </table>
-        </p>
-        <p>
-            The special <code>const_</code>-named functions are useful when you 
-            want to document clearly that your code is read-only.
-        </p>
-            <p>
-                <code>as_literal()</code> can be used <i>internally</i> in string 
-                algorithm librararies such that arrays of characters are 
-                handled correctly.
-                </p>
-            <p>
-                <code>as_array()</code> can be used with string algorithm libraries to make it clear that arrays of characters are handled like an array and not like a string. 
-                </p>    
-            <p>Notice that the above functions should always be called with 
-                qualification (<code>boost::</code>) to prevent <i>unintended</i> 
-                Argument Dependent Lookup (ADL).
-                </p>
-        <hr>
-        <a name="minimal_interface"></a>
-        <h3>Extending the library</h3>
-        <ul>
-        <li><a href="#method1">Method 1: provide member functions and nested types</a></li>
-            
-        <li><a href="#method2">Method 2: provide free-standing functions and specialize metafunctions</a></li>
-        </ul>
-
-        <!--<b>Warning:</b><i> If possible, then prefer method 1 if you want to be absolutely sure your code is forward compatible. 
-                       </i>-->
-
-        <a name="method1"></a>
-        <h4>Method 1: provide member functions and nested types</h4>
-        
-        <p>
-        This procedure assumes that you have control over the types that should be made
-        conformant to a Range concept. If not, see <a href="#method2">method 2</a>.
-        </p>
-        
-        <p>
-            The primary templates in this library are implemented such that standard 
-            containers will work automatically and so will <code>boost::<a href="../../array/index.html">array</a></code>. 
-            Below is given an overview of which member functions and member types a class 
-            must specify to be useable as a certain Range concept.
-        </p>
-        <p>
-            <table cellpadding="5" border="1">
-                <tr>
-                    <th>
-                        Member function</th>
-                    <th>
-                        Related concept</th>
-                <tr>
-                    <td><code>begin()</code></td>
-                    <td><a href="range.html#single_pass_range">Single Pass Range</a></td>
-                </tr>
-                <tr>
-                    <td><code>end()</code>
-                    </td>
-                    <td><a href="range.html#single_pass_range">Single Pass Range</a></td>
-                </tr>
-            </table>
-        </p>
-        <p>
-            Notice that <code>rbegin()</code> and <code>rend()</code> member functions are 
-            not needed even though the container can support bidirectional iteration.
-        </p>
-        <p>
-            The required member types are:
-        </p>
-        <p>
-            <table cellpadding="5" border="1">
-                <tr>
-                    <th>
-                        Member type</th>
-                    <th>
-                        Related concept</th>
-                </tr>
-                <tr>
-                    <td><code>iterator</code></td>
-                    <td><a href="range.html#single_pass_range">Single Pass Range</a></td>
-                </tr>
-                <tr>
-                    <td><code>const_iterator</code></td>
-                    <td><a href="range.html#single_pass_range">Single Pass Range</a></td>
-                </tr>
-            </table>
-        </p>
-        <p>
-            Again one should notice that member types <code>reverse_iterator</code> and <code>const_reverse_iterator</code>
-            are not needed.
-        </p>
-        <a name="method2"></a>
-        <h4>Method 2: provide free-standing functions and specialize metafunctions</h4>
-
-        <p>
-        This procedure assumes that you cannot (or do not wish to) change the types that should be made
-        conformant to a Range concept. If this is not true, see <a href="#method1">method 1</a>.
-        </p>
-        
-        <p>
-            The primary templates in this library are implemented such that
-            certain functions are found via argument-dependent-lookup (ADL).
-            Below is given an overview of which free-standing functions a class 
-            must specify to be useable as a certain Range concept.
-            Let <code>x</code> be a variable (<code>const</code> or mutable)
-            of the class in question.
-        </p>
-        <p>
-            <table cellpadding="5" border="1" ID="Table1">
-                <tr>
-                    <th>
-                        Function</th>
-                    <th>
-                        Related concept</th>
-                <tr>
-                    <td><code>range_begin(x)</code></td>
-                    <td><a href="range.html#single_pass_range">Single Pass Range</a></td>
-                </tr>
-                <tr>
-                    <td><code>range_end(x)</code>
-                    </td>
-                    <td><a href="range.html#single_pass_range">Single Pass Range</a></td>
-                </tr>
-
-            </table>        
-        </p>
-        <p><code>range_begin()</code> and <code>range_end()</code> must be
-        overloaded for both <code>const</code> and mutable reference arguments.
-        </p>
-        
-        <p>
-        You must also specialize two metafunctions for your type <code>X</code>:
-        </p>
-        <p>
-            <table cellpadding="5" border="1" ID="Table2">
-                <tr>
-                    <th>
-                        Metafunction</th>
-                    <th>
-                        Related concept</th>
-                <tr>
-                    <td><code>boost::range_mutable_iterator</code></td>
-                    <td><a href="range.html#single_pass_range">Single Pass Range</a></td>
-                </tr>
-                <tr>
-                    <td><code>boost::range_const_iterator</code></td>
-                    <td><a href="range.html#single_pass_range">Single Pass Range</a></td>
-                </tr>
-
-            </table>
-        </p>
-        <p>
-        A complete example is given here:
-        </p>
-        <blockquote>
-        <pre>
-<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=keyword>namespace</span> <span class=identifier>Foo</span>
-<span class=special>{</span>
-    <span class=comment>//
-    // Our sample UDT. A 'Pair'
-    // will work as a range when the stored
-    // elements are iterators.
-    //</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=keyword>namespace</span> <span class=identifier>boost</span>
-<span class=special>{</span>
-    <span class=comment>//
-    // Specialize metafunctions. We must include the range.hpp header.
-    // We must open the 'boost' namespace.
-    //</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>
-        <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=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>//
-        // Remark: this is defined similar to 'range_mutable_iterator'
-        //         because the 'Pair' type does not distinguish
-        //         between an iterator and a const_iterator.
-        //</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=keyword>namespace</span> <span class=identifier>Foo</span>
-<span class=special>{</span>
-    <span class=comment>//
-    // The required functions. These should be defined in
-    // the same namespace as 'Pair', in this case 
-    // in namespace 'Foo'.
-    //</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> 
-        <span class=keyword>return</span> <span class=identifier>x</span><span class=special>.</span><span class=identifier>first</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>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=keyword>const</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> 
-        <span class=keyword>return</span> <span class=identifier>x</span><span class=special>.</span><span class=identifier>first</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>T</span> <span class=special>&gt;</span>
-    <span class=keyword>inline</span> <span class=identifier>T</span> <span class=identifier>range_end</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> 
-        <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=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_end</span><span class=special>(</span> <span class=keyword>const</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> 
-        <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=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=special>{</span>
-    <span class=keyword>typedef</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>iter</span><span class=special>;</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>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>//
-    // Notice that we call 'begin' etc with qualification. 
-    //</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>
-    <span class=identifier>boost</span><span class=special>::</span><span class=identifier>range_difference</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>iter</span><span class=special>&gt;</span> <span class=special>&gt;::</span><span class=identifier>type</span> <span class=identifier>s</span> <span class=special>=</span> <span class=identifier>boost</span><span class=special>::</span><span class=identifier>size</span><span class=special>(</span> <span class=identifier>pair</span> <span class=special>);</span>
-    <span class=identifier>s</span>      <span class=special>=</span> <span class=identifier>boost</span><span class=special>::</span><span class=identifier>size</span><span class=special>(</span> <span class=identifier>cpair</span> <span class=special>);</span>
-    <span class=identifier>boost</span><span class=special>::</span><span class=identifier>range_reverse_iterator</span><span class=special>&lt;</span> <span class=identifier>const 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=special>&gt;::</span><span class=identifier>type</span>
-    <span class=identifier>ri</span>     <span class=special>=</span> <span class=identifier>boost</span><span class=special>::</span><span class=identifier>rbegin</span><span class=special>(</span> <span class=identifier>cpair</span> <span class=special>),</span>
-    <span class=identifier>re</span>     <span class=special>=</span> <span class=identifier>boost</span><span class=special>::</span><span class=identifier>rend</span><span class=special>(</span> <span class=identifier>cpair</span> <span class=special>);</span>
-<span class=special>}</span>    
-</pre>
-</blockquote>
-        
-        <hr>
-        <p>
-          &copy; <a name="Copyright" id="Copyright">Copyright</a> Thorsten Ottosen 2008.
-        </p>
-        
-        <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">www.boost.org/LICENSE_1_0.txt</a>)
-        </p>
-        <br>
-        <br>
-        <br>
-        <br>
-        <br>
-        <br>
-        <br>
-        <br>
-        <br>
-        <br>
-        <br>
-        <br>
-    </body>
-</html>
diff --git a/doc/examples.html b/doc/examples.html
deleted file mode 100644
index d1f9887..0000000
--- a/doc/examples.html
+++ /dev/null
@@ -1,72 +0,0 @@
-<!DOCTYPE HTML PUBLIC "-//W3C//DTD HTML 3.2//EN">
-
-<html>
-<head>
-    <meta http-equiv="Content-Type" content="text/html; charset=ISO-8859-1">
-    <title>Boost.Range Examples </title>
-    <link rel="stylesheet" href="style.css" type="text/css">
-</head>
-
-    <body>
-
-    <table border="0" >
-        <tr>
-            <td ><img src="../../../boost.png" border="0" ></td>
-            <td ><h1 align="center">Boost.Range </h1></td>
-        </tr>
-    </table>
-
-    <h2  >Examples</h2><a name="Examples" ></a>
-    <p  >
-    Some examples are given in the accompanying test files:
-    </p>
-    <ul  >
-        <li  >
-            <a href="../test/string.cpp" target="_self" ><code  >string.cpp</code></a>
-      
-        shows how to implement a container version of <code  >std::find()</code> that
-        works with <code  >char[],wchar_t[],char*,wchar_t*.</code>
-  </li>
-        <li  >
-            <a href="../test/algorithm_example.cpp" target="_self" ><code  >algorithm_example.cpp</code></a>
-
-      
-        shows the replace example from the introduction.
-          </li>
-        <li> <a href="../test/iterator_range.cpp">iterator_range.cpp</a>
-        <li> <a href="../test/sub_range.cpp">sub_range.cpp</a>
-        <li> <a href="../test/iterator_pair.cpp">iterator_pair.cpp</a>     
-        <li> <a href="../test/reversible_range.cpp">reversible_range.cpp</a>
-        <li> <a href="../test/std_container.cpp">std_container.cpp</a>
-        <li> <a href="../test/array.cpp">array.cpp</a>     
-    </ul>
-
-
-    <hr>
-    <p>
-      &copy; <a name="Copyright" id="Copyright">Copyright</a> Thorsten Ottosen 2008.
-    </p>
-
-    <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">www.boost.org/LICENSE_1_0.txt</a>)
-    </p>
-
-    <br>
-    <br>
-    <br>
-    <br>
-    <br>
-    <br>
-    <br>
-    <br>
-    <br>
-    <br>
-    <br>
-    <br>
-
-
-    </body>
-</html>
-
diff --git a/doc/faq.html b/doc/faq.html
deleted file mode 100644
index fcacf98..0000000
--- a/doc/faq.html
+++ /dev/null
@@ -1,145 +0,0 @@
-<!DOCTYPE HTML PUBLIC "-//W3C//DTD HTML 3.2//EN">
-
-<html>
-<head>
-    <meta http-equiv="Content-Type" content="text/html; charset=ISO-8859-1">
-    <title>Boost.Range FAQ </title>
-    <link rel="stylesheet" href="style.css" type="text/css">
-</head>
-
-    <body>
-
-    <table border="0" >
-        <tr>
-            <td ><img src="../../../boost.png" border="0" ></td>
-            <td ><h1 align="center">Boost.Range</h1></td>
-        </tr>
-    </table>
-
-    <p>
-    <h2  >FAQ</h2> <a name="FAQ" ></a>
-    <ol  >
-        <li  >
-            <i>Why is there no difference between <code  >range_iterator&lt;C&gt;::type</code>
-            and <code  >range_const_iterator&lt;C&gt;::type</code> for <code>std::pair&lt;iterator, iterator&gt;</code></i>.
-
-        <p  >
-        In general it is not possible nor desirable to find a corresponding <code  >const_iterator</code>.
-        When it is possible to come up with one, the client might choose to construct a <code  >std::pair&lt;const_iterator,const_iterator&gt;</code>
-        object.
-        </p>
-        <p>
-        Note that an <a href="utility_class.html#iter_range">iterator_range</a>
-        is somewhat more convenient than a <code>pair</code> and that a <a
-        href="utility_class.html#sub_range"><code>sub_range</code></a> does
-       propagate const-ness. </p>
-        </li>
-        <li  >
-            <i>Why is there not supplied more types or more functions?</i>
-            <p  >
-            The library has been kept small because its current interface will
-            serve most
-            purposes. If and when a genuine need arises for more functionality, it can be
-            implemented.
-            </p>
-        </li>
-        <li  >
-            <i>How should I implement generic algorithms for ranges?</i>
-            <p  >
-            One should always start with a generic algorithm that takes two iterators (or
-            more) as input. Then use Boost.Range to build handier versions on top of the
-            iterator based algorithm. Please notice that once the range version of the
-            algorithm is done, it makes sense <i>not</i> to expose the iterator version in
-            the public interface.
-            </p>
-        </li>
-        <li>
-            <i>Why is there no Incrementable Range concept?</i>
-            <p>
-            Even though we speak of incrementable iterators, it would not make
-            much sense for ranges; for example, we cannot determine the size and
-            emptiness of a range since we cannot even compare
-            its iterators.
-            </p>
-            <p>
-            Note also that incrementable iterators are derived from output
-            iterators and so there exist no output range.
-             </p>
-        </li>
-        <!--
-        <li>
-            <i>Should I use qualified syntax, for example
-<blockquote><pre>
-<span class=identifier>boost</span><span class=special>::</span><span class=identifier>begin</span><span class=special>( </span><span class=identifier>r </span><span class=special>); </span>
-</pre></blockquote>
-            instead of
-            <blockquote>
-<pre><span class=keyword>using </span><span class=keyword>namespace </span><span class=identifier>boost</span><span class=special>;</span>
-<span class=identifier>begin</span><span class=special>( </span><span class=identifier>r </span><span class=special>)</span></pre></blockquote>
-            when calling functions in this library? If so, can I still rely on argument
-            dependent lookup (ADL) to kick in?</i>
-            <p>
-            The answer to the first question is that "it's up to you". The
-            answer to the second question is Yes. Normally qualified syntax
-            disables ADL, but the functions are implemented in a special
-            manner that preserves ADL properties. The trick was explained by
-            Daniel Frey on comp.lang.std.c++ in the thread "Whence Swap" and
-            it is best explained by some code: <blockquote>
-    <pre>
-<span class=keyword>namespace </span><span class=identifier>boost</span>
-<span class=special>{
-    </span><span class=keyword>namespace </span><span class=identifier>range_detail
-    </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=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><span class=special>{ </span><span class=comment>/* normal implementation */ </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>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><span class=special>{
-        </span><span class=comment>//
-        // Create ADL hook
-        //
-        </span><span class=keyword>using </span><span class=identifier>range_detail</span><span class=special>::</span><span class=identifier>begin</span><span class=special>;
-        </span><span class=keyword>return </span><span class=identifier>begin</span><span class=special>( </span><span class=identifier>r </span><span class=special>);
-    </span><span class=special>}</span>
-<span class=special>}    </span>
-</pre>
-</blockquote>
-Cool indeed!
-</p>
-     -->
-
-    </ol>
-
-
-      <hr>
-    <p>
-      &copy; <a name="Copyright" id="Copyright">Copyright</a> Thorsten Ottosen 2008.
-    </p>
-
-    <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">www.boost.org/LICENSE_1_0.txt</a>)
-    </p>
-
-    <br>
-    <br>
-    <br>
-    <br>
-    <br>
-    <br>
-    <br>
-    <br>
-    <br>
-    <br>
-    <br>
-    <br>
-
-
-    </body>
-</html>
-
diff --git a/doc/headers.html b/doc/headers.html
deleted file mode 100644
index c896bff..0000000
--- a/doc/headers.html
+++ /dev/null
@@ -1,202 +0,0 @@
-<!DOCTYPE HTML PUBLIC "-//W3C//DTD HTML 3.2//EN">
-
-<html>
-<head>
-    <meta http-equiv="Content-Type" content="text/html; charset=ISO-8859-1">
-    <title>Boost.Range Headers </title>
-    <link rel="stylesheet" href="style.css" type="text/css">
-</head>
-
-    <body>
-
-    <table border="0" >
-        <tr>
-            <td ><img src="../../../boost.png" border="0" ></td>
-            <td ><h1 align="center">Boost.Range</h1></td>
-        </tr>
-    </table>
-
-    <p>
-    <h2  >Library headers</h2><a name="Library headers" ></a>
-    <table cellpadding="5" border="1" >
-        <tr  >
-            <th  >Header</th>
-            <th  >Includes</th>
-            <th>Related concept </th>
-        </tr>
-        <tr  >
-            <td  ><code  >&lt;boost/range.hpp&gt;</code></td>
-            <td  >everything</td>
-            <td>- </td>
-        </tr>
-        <tr  >
-            <td  ><code  >&lt;boost/range/metafunctions.hpp&gt;</code></td>
-            <td  >every metafunction</td>
-            <td>- </td>
-        </tr>
-        <tr  >
-            <td  ><code  >&lt;boost/range/functions.hpp&gt;</code></td>
-            <td  >every function</td>
-            <td>- </td>
-        </tr>
-        <tr  >
-            <td  ><code  >&lt;boost/range/value_type.hpp&gt;</code></td>
-            <td  ><a href="boost_range.html#range_value" >range_value</a></td>
-            <td><a href="range.html#single_pass_range">Single Pass Range</a></td>
-        </tr>
-        <tr  >
-            <td  ><code  >&lt;boost/range/iterator.hpp&gt;</code></td>
-            <td  ><a href="boost_range.html#range_iterator"
-                                                >range_iterator</a></td>
-            <td><a href="range.html#single_pass_range">Single Pass Range</a> </td>
-        </tr>
-        <tr  >
-            <td  ><code  >&lt;boost/range/mutable_iterator.hpp&gt;</code></td>
-            <td  ><a href="boost_range.html#range_mutable_iterator"
-                                                >range_mutable_iterator</a></td>
-            <td><a href="range.html#single_pass_range">Single Pass Range</a> </td>
-        </tr>
-        <tr  >
-            <td  ><code  >&lt;boost/range/const_iterator.hpp&gt;</code></td>
-            <td  ><a href="boost_range.html#range_const_iterator"
-                                                >range_const_iterator</a></td>
-            <td><a href="range.html#single_pass_range">Single Pass Range</a> </td>
-        </tr>
-        <tr  >
-            <td  ><code  >&lt;boost/range/difference_type.hpp&gt;</code></td>
-            <td  ><a href="boost_range.html#range_difference"
-                                >range_difference</a></td>
-            <td><a href="range.html#forward_range">Forward Range</a> </td>
-        </tr>
-        <tr  >
-            <td  ><code  >&lt;boost/range/pointer.hpp&gt;</code></td>
-            <td  ><a href="boost_range.html#range_pointer" 
-                >range_pointer</a></td>
-            <td>- </td>
-        </tr>
-        <tr  >
-            <td  ><code  >&lt;boost/range/category.hpp&gt;</code></td>
-            <td  ><a href="boost_range.html#range_category" 
-                >range_category</a></td>
-            <td>- </td>
-        </tr>
-
-        <tr  >
-            <td  ><code  >&lt;boost/range/reverse_iterator.hpp&gt;</code></td>
-            <td  ><a href="boost_range.html#range_reverse_iterator" >range_reverse_iterator</a></td>
-            <td><a href="range.html#bidirectional_range">Bidirectional Range</a> </td>
-        </tr>
-        <tr  >
-            <td  ><code  >&lt;boost/range/begin.hpp&gt;</code></td>
-            <td  >
-                <a href="boost_range.html#begin" >begin</a> and 
-                <a href="boost_range.html#const_begin" >const_begin</a>
-            </td>
-            <td><a href="range.html#single_pass_range">Single Pass Range</a> </td>
-        </tr>
-        <tr  >
-            <td  ><code  >&lt;boost/range/end.hpp&gt;</code></td>
-            <td  >
-                 <a href="boost_range.html#end" >end</a> and 
-                 <a href="boost_range.html#const_end" >const_end</a> 
-            </td> 
-            <td><a href="range.html#single_pass_range">Single Pass Range</a> </td>
-        </tr>
-        <tr  >
-            <td  ><code  >&lt;boost/range/empty.hpp&gt;</code></td>
-            <td  ><a href="boost_range.html#empty" >empty</a></td>
-            <td><a href="range.html#single_pass_range">Single Pass Range</a> </td>
-        </tr>
-        <tr  >
-            <td  ><code  >&lt;boost/range/distance.hpp&gt;</code></td>
-            <td  ><a href="boost_range.html#distance" >distance</a></td>
-            <td><a href="range.html#forward_range">Forward Range</a> </td>
-        </tr>
-        <tr  >
-            <td  ><code  >&lt;boost/range/size.hpp&gt;</code></td>
-            <td  ><a href="boost_range.html#size" >size</a></td>
-            <td><a href="range.html#random_access_range">Random Access Range</a> 
-                </td>
-        </tr>
-        <tr  >
-            <td  ><code  >&lt;boost/range/rbegin.hpp&gt;</code></td>
-            <td  >
-                <a href="boost_range.html#rbegin" >rbegin</a> and
-                <a href="boost_range.html#const_rbegin" >const_rbegin</a>
-            </td>
-            <td><a href="range.html#bidirectional_range">Bidirectional Range</a> </td>
-        </tr>
-        <tr  >
-            <td  ><code  >&lt;boost/range/rend.hpp&gt;</code></td>
-            <td  >
-                 <a href="boost_range.html#rend" >rend</a> and
-                 <a href="boost_range.html#const_rend" >const_rend</a>
-            </td>
-            <td><a href="range.html#bidirectional_range">Bidirectional Range</a> </td>
-        </tr>
-        <tr  >
-            <td  ><code  >&lt;boost/range/as_array.hpp&gt;</code></td>
-            <td  >
-                 <a href="boost_range.html#as_array" >as_array</a>
-            </td>
-            <td>-</td>
-        </tr>
-        <tr  >
-            <td  ><code  >&lt;boost/range/as_literal.hpp&gt;</code></td>
-            <td  >
-                 <a href="boost_range.html#as_literal" >as_literal</a>
-            </td>
-            <td>-</td>
-        </tr>
-
-        <tr  >
-            <td  ><code >&lt;boost/range/iterator_range.hpp&gt;</code></td>
-            <td  ><a href="utility_class.html#iter_range"
-                                                                                >iterator_range</a></td>
-            <td>- </td>
-        </tr>
-        <tr  >
-            <td  ><code  >&lt;boost/range/sub_range.hpp&gt;</code></td>
-            <td  ><a href="utility_class.html#sub_range" >sub_range</a></td>
-            <td>- </td>
-        </tr>
-        <tr  >
-            <td  ><code  >&lt;boost/range/concepts.hpp&gt;</code></td>
-            <td  ><a href="range.html#concept_checking" >concept checks</a></td>
-            <td>- </td>
-        </tr>
-
-    </table>
-    <br>
-      </p>
-
-
-    <hr>
-    <p>
-      &copy; <a name="Copyright" id="Copyright">Copyright</a> Thorsten Ottosen 2008.
-    </p>
-
-    <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">www.boost.org/LICENSE_1_0.txt</a>)
-    </p>
-
-    <br>
-    <br>
-    <br>
-    <br>
-    <br>
-    <br>
-    <br>
-    <br>
-    <br>
-    <br>
-    <br>
-    <br>
-
-
-    </body>
-</html>
-
diff --git a/doc/history_ack.html b/doc/history_ack.html
deleted file mode 100644
index 3191dd0..0000000
--- a/doc/history_ack.html
+++ /dev/null
@@ -1,90 +0,0 @@
-<!DOCTYPE HTML PUBLIC "-//W3C//DTD HTML 3.2//EN">
-
-<html>
-<head>
-    <meta http-equiv="Content-Type" content="text/html; charset=ISO-8859-1">
-    <title>Boost.Range History and Acknowledgement </title>
-    <link rel="stylesheet" href="style.css" type="text/css">
-</head>
-
-    <body>
-
-    <table border="0" >
-        <tr>
-            <td><img src="../../../boost.png" border="0" ></td>
-            <td><h1 align="center">Boost.Range </h1></td>
-        </tr>
-    </table>
-
-    <h2  >History and Acknowledgement</h2><a name="History" ></a>
-    <p  >
-    The library was under way for a long time. Dietmar Kühl originally intended
-    to submit an <code  >array_traits</code> class template which had most of
-    the functionality present now, but only for arrays and standard containers.
-        I believe this was back in 2001 or 2002.
-    </p>
-    
-    <p>
-    Meanwhile work on algorithms for containers in various contexts showed the 
-    need for handling pairs of iterators, and string libraries needed special 
-    treatment of character arrays. In the end it made sense to formalize the 
-    minimal requirements of these similar concepts. And the results are the 
-    Range concepts found in this library. </p>
-    
-    <p>
-    The term Range was adopted because of paragraph <code>24.1/7</code> from the 
-C++ standard: <blockquote>
-  Most of the library's algorithmic templates that operate on data
-  structures have interfaces that use ranges.  A <i>range</i> is a pair of
-  iterators that designate the beginning and end of the computation. A
-  range [i, i) is an empty range; in general, a range [i, j) refers to
-  the elements in the data structure starting with the one pointed to
-  by i and up to but not including the one pointed to by j. Range [i,
-  j) is valid if and only if j is reachable from i. The result of the
-  application of functions in the library to invalid ranges is
-  undefined.
-   </blockquote>
-    
-    <p>
-    Special thanks goes to    
-    <ul>
-        <li> Pavol Droba for help with documentation and implementation
-        <li> Pavel Vozenilek for help with porting the library
-        <li> Jonathan Turkanis and John Torjo for help with documentation    
-        <li> Hartmut Kaiser for being review manager
-        <li> Jonathan Turkanis for porting the lib (as far sa possible) to
-             vc6 and vc7.
-    </ul>
-    </p>
-    <p>
-    The concept checks and their documentation was provided by Daniel Walker.
-    
-    <hr>
-    <p>
-      &copy; <a name="Copyright" id="Copyright">Copyright</a> Thorsten Ottosen 2008.
-    </p>
-
-    <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">www.boost.org/LICENSE_1_0.txt</a>)
-    </p>
-
-    <br>
-    <br>
-    <br>
-    <br>
-    <br>
-    <br>
-    <br>
-    <br>
-    <br>
-    <br>
-    <br>
-    <br>
-
-
-    </body>
-</html>
-
diff --git a/doc/html/range/reference/range_algorithm/range_algorithm_introduction.html b/doc/html/range/reference/range_algorithm/range_algorithm_introduction.html
deleted file mode 100644
index e24351f..0000000
--- a/doc/html/range/reference/range_algorithm/range_algorithm_introduction.html
+++ /dev/null
@@ -1,257 +0,0 @@
-<html>
-<head>
-<meta http-equiv="Content-Type" content="text/html; charset=US-ASCII">
-<title>Introduction and motivation</title>
-<link rel="stylesheet" href="../../../../../../../doc/html/boostbook.css" type="text/css">
-<meta name="generator" content="DocBook XSL Stylesheets V1.75.1">
-<link rel="home" href="../../../index.html" title="Chapter&#160;1.&#160;Range 2.0">
-<link rel="up" href="../range_algorithm.html" title="Range Algorithm">
-<link rel="prev" href="../range_algorithm.html" title="Range Algorithm">
-<link rel="next" href="range_algorithm_mutating_algorithms.html" title="Mutating algorithms">
-</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="../../../../../../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="../range_algorithm.html"><img src="../../../../../../../doc/html/images/prev.png" alt="Prev"></a><a accesskey="u" href="../range_algorithm.html"><img src="../../../../../../../doc/html/images/up.png" alt="Up"></a><a accesskey="h" href="../../../index.html"><img src="../../../../../../../doc/html/images/home.png" alt="Home"></a><a accesskey="n" href="range_algorithm_mutating_algorithms.html"><img src="../../../../../../../doc/html/images/next.png" alt="Next"></a>
-</div>
-<div class="section" title="Introduction and motivation">
-<div class="titlepage"><div><div><h4 class="title">
-<a name="range.reference.range_algorithm.range_algorithm_introduction"></a><a class="link" href="range_algorithm_introduction.html" title="Introduction and motivation">
-        Introduction and motivation</a>
-</h4></div></div></div>
-<p>
-          In its most simple form a <span class="bold"><strong>Range Algorithm</strong></span>
-          (or range-based algorithm) is simply an iterator-based algorithm where
-          the <span class="emphasis"><em>two</em></span> iterator arguments have been replaced by
-          <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>
-
-<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">sort</span><span class="special">(</span><span class="identifier">vec</span><span class="special">);</span>
-</pre>
-<p>
-        </p>
-<p>
-          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>
-<p>
-        </p>
-<p>
-          However, the return type of range algorithms is almost always different
-          from that of existing iterator-based algorithms.
-        </p>
-<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 
-</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>
-<p>
-          to first sort the range and then run <code class="computeroutput"><span class="identifier">unique</span><span class="special">()</span></code> on the sorted range.
-        </p>
-<p>
-          Algorithms like <code class="computeroutput"><span class="identifier">boost</span><span class="special">::</span><span class="identifier">unique</span><span class="special">()</span></code>
-          fall into another group of algorithms that return (potentially) narrowed
-          views of the original range. By default <code class="computeroutput"><span class="identifier">boost</span><span class="special">::</span><span class="identifier">unique</span><span class="special">(</span><span class="identifier">rng</span><span class="special">)</span></code> returns the range <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">found</span><span class="special">)</span></code>
-          where <code class="computeroutput"><span class="identifier">found</span></code> denotes the
-          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 
-</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>
-</pre>
-<p>
-        </p>
-<p>
-          Algorithms like <code class="computeroutput"><span class="identifier">boost</span><span class="special">::</span><span class="identifier">unique</span></code> usually return the same range:
-          <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">found</span><span class="special">)</span></code>. However, this behaviour may be changed
-          by supplying the algorithms with a template argument:
-        </p>
-<div class="informaltable"><table class="table">
-<colgroup>
-<col>
-<col>
-</colgroup>
-<thead><tr>
-<th>
-                <p>
-                  Expression
-                </p>
-                </th>
-<th>
-                <p>
-                  Return
-                </p>
-                </th>
-</tr></thead>
-<tbody>
-<tr>
-<td>
-                <p>
-                  <code class="computeroutput"><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</span><span class="special">&gt;(</span><span class="identifier">rng</span><span class="special">)</span></code>
-                </p>
-                </td>
-<td>
-                <p>
-                  returns a single iterator like <code class="computeroutput"><span class="identifier">std</span><span class="special">::</span><span class="identifier">unique</span></code>
-                </p>
-                </td>
-</tr>
-<tr>
-<td>
-                <p>
-                  <code class="computeroutput"><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_begin_found</span><span class="special">&gt;(</span><span class="identifier">rng</span><span class="special">)</span></code>
-                </p>
-                </td>
-<td>
-                <p>
-                  returns the range <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">found</span><span class="special">)</span></code>
-                  (this is the default)
-                </p>
-                </td>
-</tr>
-<tr>
-<td>
-                <p>
-                  <code class="computeroutput"><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_begin_next</span><span class="special">&gt;(</span><span class="identifier">rng</span><span class="special">)</span></code>
-                </p>
-                </td>
-<td>
-                <p>
-                  returns the range <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">next</span><span class="special">(</span><span class="identifier">found</span><span class="special">))</span></code>
-                </p>
-                </td>
-</tr>
-<tr>
-<td>
-                <p>
-                  <code class="computeroutput"><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">rng</span><span class="special">)</span></code>
-                </p>
-                </td>
-<td>
-                <p>
-                  returns the range <code class="computeroutput"><span class="special">[</span><span class="identifier">found</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>
-                </td>
-</tr>
-<tr>
-<td>
-                <p>
-                  <code class="computeroutput"><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">rng</span><span class="special">)</span></code>
-                </p>
-                </td>
-<td>
-                <p>
-                  returns the range <code class="computeroutput"><span class="special">[</span><span class="identifier">boost</span><span class="special">::</span><span class="identifier">next</span><span class="special">(</span><span class="identifier">found</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>
-                </td>
-</tr>
-<tr>
-<td>
-                <p>
-                  <code class="computeroutput"><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_begin_end</span><span class="special">&gt;(</span><span class="identifier">rng</span><span class="special">)</span></code>
-                </p>
-                </td>
-<td>
-                <p>
-                  returns the entire original range.
-                </p>
-                </td>
-</tr>
-</tbody>
-</table></div>
-<p>
-          This functionality has the following advantages:
-        </p>
-<div class="orderedlist"><ol class="orderedlist" type="1">
-<li class="listitem">
-            it allows for <span class="emphasis"><em><span class="bold"><strong>seamless functional-style
-            programming</strong></span></em></span> where you do not need to use named
-            local variables to store intermediate results
-          </li>
-<li class="listitem">
-            it is very <span class="emphasis"><em><span class="bold"><strong>safe</strong></span></em></span>
-            because the algorithm can verify out-of-bounds conditions and handle
-            tricky conditions that lead to empty ranges
-          </li>
-</ol></div>
-<p>
-          For example, consider how easy we may erase the duplicates in a sorted
-          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>
-</pre>
-<p>
-        </p>
-<p>
-          Notice the use of <code class="computeroutput"><span class="identifier">boost</span><span class="special">::</span><span class="identifier">return_found_end</span></code>.
-          What if we wanted to erase all the duplicates except one of them? In old-fashined
-          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>
-
-<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>
-</pre>
-<p>
-        </p>
-<p>
-          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>
-<p>
-          and there is no need to worry about generating an invalid range. Furthermore,
-          if the container is complex, calling <code class="computeroutput"><span class="identifier">vec</span><span class="special">.</span><span class="identifier">begin</span><span class="special">()</span></code> several times will be more expensive
-          than using a range algorithm.
-        </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>
-        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="../range_algorithm.html"><img src="../../../../../../../doc/html/images/prev.png" alt="Prev"></a><a accesskey="u" href="../range_algorithm.html"><img src="../../../../../../../doc/html/images/up.png" alt="Up"></a><a accesskey="h" href="../../../index.html"><img src="../../../../../../../doc/html/images/home.png" alt="Home"></a><a accesskey="n" href="range_algorithm_mutating_algorithms.html"><img src="../../../../../../../doc/html/images/next.png" alt="Next"></a>
-</div>
-</body>
-</html>
diff --git a/doc/html/range/reference/range_algorithm/range_algorithm_mutating_algorithms.html b/doc/html/range/reference/range_algorithm/range_algorithm_mutating_algorithms.html
deleted file mode 100644
index 5c11829..0000000
--- a/doc/html/range/reference/range_algorithm/range_algorithm_mutating_algorithms.html
+++ /dev/null
@@ -1,50 +0,0 @@
-<html>
-<head>
-<meta http-equiv="Content-Type" content="text/html; charset=US-ASCII">
-<title>Mutating algorithms</title>
-<link rel="stylesheet" href="../../../../../../../doc/html/boostbook.css" type="text/css">
-<meta name="generator" content="DocBook XSL Stylesheets V1.75.1">
-<link rel="home" href="../../../index.html" title="Chapter&#160;1.&#160;Range 2.0">
-<link rel="up" href="../range_algorithm.html" title="Range Algorithm">
-<link rel="prev" href="range_algorithm_introduction.html" title="Introduction and motivation">
-<link rel="next" href="range_algorithm_mutating_algorithms/copy.html" title="Range Algorithm - copy">
-</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="../../../../../../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="range_algorithm_introduction.html"><img src="../../../../../../../doc/html/images/prev.png" alt="Prev"></a><a accesskey="u" href="../range_algorithm.html"><img src="../../../../../../../doc/html/images/up.png" alt="Up"></a><a accesskey="h" href="../../../index.html"><img src="../../../../../../../doc/html/images/home.png" alt="Home"></a><a accesskey="n" href="range_algorithm_mutating_algorithms/copy.html"><img src="../../../../../../../doc/html/images/next.png" alt="Next"></a>
-</div>
-<div class="section" title="Mutating algorithms">
-<div class="titlepage"><div><div><h4 class="title">
-<a name="range.reference.range_algorithm.range_algorithm_mutating_algorithms"></a><a class="link" href="range_algorithm_mutating_algorithms.html" title="Mutating algorithms">
-        Mutating algorithms</a>
-</h4></div></div></div>
-<div class="toc"><dl>
-<dt><span class="section"><a href="range_algorithm_mutating_algorithms/copy.html">
-          Range Algorithm - copy</a></span></dt>
-<dt><span class="section"><a href="range_algorithm_mutating_algorithms/copy_backward.html">
-          Range Algorithm - copy_backward</a></span></dt>
-</dl></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="range_algorithm_introduction.html"><img src="../../../../../../../doc/html/images/prev.png" alt="Prev"></a><a accesskey="u" href="../range_algorithm.html"><img src="../../../../../../../doc/html/images/up.png" alt="Up"></a><a accesskey="h" href="../../../index.html"><img src="../../../../../../../doc/html/images/home.png" alt="Home"></a><a accesskey="n" href="range_algorithm_mutating_algorithms/copy.html"><img src="../../../../../../../doc/html/images/next.png" alt="Next"></a>
-</div>
-</body>
-</html>
diff --git a/doc/html/range/reference/range_algorithm/range_algorithm_mutating_algorithms/copy.html b/doc/html/range/reference/range_algorithm/range_algorithm_mutating_algorithms/copy.html
deleted file mode 100644
index 4bf5ab0..0000000
--- a/doc/html/range/reference/range_algorithm/range_algorithm_mutating_algorithms/copy.html
+++ /dev/null
@@ -1,115 +0,0 @@
-<html>
-<head>
-<meta http-equiv="Content-Type" content="text/html; charset=US-ASCII">
-<title>Range Algorithm - copy</title>
-<link rel="stylesheet" href="../../../../../../../../doc/html/boostbook.css" type="text/css">
-<meta name="generator" content="DocBook XSL Stylesheets V1.75.1">
-<link rel="home" href="../../../../index.html" title="Chapter&#160;1.&#160;Range 2.0">
-<link rel="up" href="../range_algorithm_mutating_algorithms.html" title="Mutating algorithms">
-<link rel="prev" href="../range_algorithm_mutating_algorithms.html" title="Mutating algorithms">
-<link rel="next" href="copy_backward.html" title="Range Algorithm - copy_backward">
-</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="../../../../../../../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="../range_algorithm_mutating_algorithms.html"><img src="../../../../../../../../doc/html/images/prev.png" alt="Prev"></a><a accesskey="u" href="../range_algorithm_mutating_algorithms.html"><img src="../../../../../../../../doc/html/images/up.png" alt="Up"></a><a accesskey="h" href="../../../../index.html"><img src="../../../../../../../../doc/html/images/home.png" alt="Home"></a><a accesskey="n" href="copy_backward.html"><img src="../../../../../../../../doc/html/images/next.png" alt="Next"></a>
-</div>
-<div class="section" title="Range Algorithm - copy">
-<div class="titlepage"><div><div><h5 class="title">
-<a name="range.reference.range_algorithm.range_algorithm_mutating_algorithms.copy"></a><a class="link" href="copy.html" title="Range Algorithm - copy">
-          Range Algorithm - copy</a>
-</h5></div></div></div>
-<a name="range.reference.range_algorithm.range_algorithm_mutating_algorithms.copy.prototype"></a><h6>
-<a name="id2722672"></a>
-            <a class="link" href="copy.html#range.reference.range_algorithm.range_algorithm_mutating_algorithms.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.range_algorithm.range_algorithm_mutating_algorithms.copy.description"></a><h6>
-<a name="id2722804"></a>
-            <a class="link" href="copy.html#range.reference.range_algorithm.range_algorithm_mutating_algorithms.copy.description">Description</a>
-          </h6>
-<p>
-            <code class="computeroutput"><span class="identifier">copy</span></code> copies all elements
-            from <code class="computeroutput"><span class="identifier">source_rng</span></code> to the
-            range <code class="computeroutput"><span class="special">[</span><span class="identifier">out_it</span><span class="special">,</span> <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>. 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.range_algorithm.range_algorithm_mutating_algorithms.copy.definition"></a><h6>
-<a name="id2722938"></a>
-            <a class="link" href="copy.html#range.reference.range_algorithm.range_algorithm_mutating_algorithms.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.range_algorithm.range_algorithm_mutating_algorithms.copy.requirements"></a><h6>
-<a name="id2723012"></a>
-            <a class="link" href="copy.html#range.reference.range_algorithm.range_algorithm_mutating_algorithms.copy.requirements">Requirements</a>
-          </h6>
-<div class="itemizedlist"><ul class="itemizedlist" type="disc">
-<li class="listitem">
-<code class="computeroutput"><span class="identifier">SinglePassRange</span></code> is
-              a model of the <code class="computeroutput"><span class="identifier">SinglePassRangeConcept</span></code>.
-            </li>
-<li class="listitem">
-<code class="computeroutput"><span class="identifier">OutputIterator</span></code> is a
-              model of the <code class="computeroutput"><span class="identifier">OutputIteratorConcept</span></code>.
-            </li>
-<li class="listitem">
-              The <code class="computeroutput"><span class="identifier">value_type</span></code> of
-              <code class="computeroutput"><span class="identifier">SinglePassRange</span></code> is
-              convertible to a type in <code class="computeroutput"><span class="identifier">OutputIterator</span></code>'s
-              set of value types.
-            </li>
-</ul></div>
-<a name="range.reference.range_algorithm.range_algorithm_mutating_algorithms.copy.precondition_"></a><h6>
-<a name="id2723128"></a>
-            <a class="link" href="copy.html#range.reference.range_algorithm.range_algorithm_mutating_algorithms.copy.precondition_">Precondition:</a>
-          </h6>
-<div class="itemizedlist"><ul class="itemizedlist" type="disc">
-<li class="listitem">
-<code class="computeroutput"><span class="identifier">out_it</span></code> is not an iterator
-              within the <code class="computeroutput"><span class="identifier">source_rng</span></code>.
-            </li>
-<li class="listitem">
-<code class="computeroutput"><span class="special">[</span><span class="identifier">out_it</span><span class="special">,</span> <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> is a valid range.
-            </li>
-</ul></div>
-<a name="range.reference.range_algorithm.range_algorithm_mutating_algorithms.copy.complexity"></a><h6>
-<a name="id2723234"></a>
-            <a class="link" href="copy.html#range.reference.range_algorithm.range_algorithm_mutating_algorithms.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.
-          </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>
-        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="../range_algorithm_mutating_algorithms.html"><img src="../../../../../../../../doc/html/images/prev.png" alt="Prev"></a><a accesskey="u" href="../range_algorithm_mutating_algorithms.html"><img src="../../../../../../../../doc/html/images/up.png" alt="Up"></a><a accesskey="h" href="../../../../index.html"><img src="../../../../../../../../doc/html/images/home.png" alt="Home"></a><a accesskey="n" href="copy_backward.html"><img src="../../../../../../../../doc/html/images/next.png" alt="Next"></a>
-</div>
-</body>
-</html>
diff --git a/doc/html/range/reference/range_algorithm/range_algorithm_mutating_algorithms/copy_backward.html b/doc/html/range/reference/range_algorithm/range_algorithm_mutating_algorithms/copy_backward.html
deleted file mode 100644
index de14a89..0000000
--- a/doc/html/range/reference/range_algorithm/range_algorithm_mutating_algorithms/copy_backward.html
+++ /dev/null
@@ -1,124 +0,0 @@
-<html>
-<head>
-<meta http-equiv="Content-Type" content="text/html; charset=US-ASCII">
-<title>Range Algorithm - copy_backward</title>
-<link rel="stylesheet" href="../../../../../../../../doc/html/boostbook.css" type="text/css">
-<meta name="generator" content="DocBook XSL Stylesheets V1.75.1">
-<link rel="home" href="../../../../index.html" title="Chapter&#160;1.&#160;Range 2.0">
-<link rel="up" href="../range_algorithm_mutating_algorithms.html" title="Mutating algorithms">
-<link rel="prev" href="copy.html" title="Range Algorithm - copy">
-<link rel="next" href="../range_algorithm_non_mutating_algorithms.html" title="Non-mutating algorithms">
-</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="../../../../../../../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="copy.html"><img src="../../../../../../../../doc/html/images/prev.png" alt="Prev"></a><a accesskey="u" href="../range_algorithm_mutating_algorithms.html"><img src="../../../../../../../../doc/html/images/up.png" alt="Up"></a><a accesskey="h" href="../../../../index.html"><img src="../../../../../../../../doc/html/images/home.png" alt="Home"></a><a accesskey="n" href="../range_algorithm_non_mutating_algorithms.html"><img src="../../../../../../../../doc/html/images/next.png" alt="Next"></a>
-</div>
-<div class="section" title="Range Algorithm - copy_backward">
-<div class="titlepage"><div><div><h5 class="title">
-<a name="range.reference.range_algorithm.range_algorithm_mutating_algorithms.copy_backward"></a><a class="link" href="copy_backward.html" title="Range Algorithm - copy_backward">
-          Range Algorithm - copy_backward</a>
-</h5></div></div></div>
-<a name="range.reference.range_algorithm.range_algorithm_mutating_algorithms.copy_backward.prototype"></a><h6>
-<a name="id2723305"></a>
-            <a class="link" href="copy_backward.html#range.reference.range_algorithm.range_algorithm_mutating_algorithms.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>
-        <span class="identifier">copy_backward</span><span class="special">(</span><span class="keyword">const</span> <span class="identifier">BidirectionalRange</span><span class="special">&amp;</span> <span class="identifier">source_rng</span><span class="special">,</span>
-                      <span class="identifier">BidirectionalOutputIterator</span> <span class="identifier">out_it</span><span class="special">);</span>
-</pre>
-<p>
-          </p>
-<a name="range.reference.range_algorithm.range_algorithm_mutating_algorithms.copy_backward.description"></a><h6>
-<a name="id2723438"></a>
-            <a class="link" href="copy_backward.html#range.reference.range_algorithm.range_algorithm_mutating_algorithms.copy_backward.description">Description</a>
-          </h6>
-<p>
-            <code class="computeroutput"><span class="identifier">copy_backward</span></code> copies
-            all elements from <code class="computeroutput"><span class="identifier">source_rng</span></code>
-            to the range <code class="computeroutput"><span class="special">[</span><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> <span class="identifier">out_it</span><span class="special">)</span></code>.
-          </p>
-<p>
-            The values are copied in reverse order. 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>
-<p>
-            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.range_algorithm.range_algorithm_mutating_algorithms.copy_backward.definition"></a><h6>
-<a name="id2723599"></a>
-            <a class="link" href="copy_backward.html#range.reference.range_algorithm.range_algorithm_mutating_algorithms.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.range_algorithm.range_algorithm_mutating_algorithms.copy_backward.requirements"></a><h6>
-<a name="id2723674"></a>
-            <a class="link" href="copy_backward.html#range.reference.range_algorithm.range_algorithm_mutating_algorithms.copy_backward.requirements">Requirements</a>
-          </h6>
-<div class="itemizedlist"><ul class="itemizedlist" type="disc">
-<li class="listitem">
-<code class="computeroutput"><span class="identifier">BidirectionalRange</span></code>
-              is a model of the <code class="computeroutput"><span class="identifier">SinglePassRangeConcept</span></code>.
-            </li>
-<li class="listitem">
-<code class="computeroutput"><span class="identifier">OutputIterator</span></code> is a
-              model of the <code class="computeroutput"><span class="identifier">OutputIteratorConcept</span></code>.
-            </li>
-<li class="listitem">
-              The <code class="computeroutput"><span class="identifier">value_type</span></code> of
-              <code class="computeroutput"><span class="identifier">SinglePassRange</span></code> is
-              convertible to a type in <code class="computeroutput"><span class="identifier">OutputIterator</span></code>'s
-              set of value types.
-            </li>
-</ul></div>
-<a name="range.reference.range_algorithm.range_algorithm_mutating_algorithms.copy_backward.precondition_"></a><h6>
-<a name="id2723791"></a>
-            <a class="link" href="copy_backward.html#range.reference.range_algorithm.range_algorithm_mutating_algorithms.copy_backward.precondition_">Precondition:</a>
-          </h6>
-<div class="itemizedlist"><ul class="itemizedlist" type="disc">
-<li class="listitem">
-<code class="computeroutput"><span class="identifier">out_it</span></code> is not an iterator
-              within the <code class="computeroutput"><span class="identifier">source_rng</span></code>.
-            </li>
-<li class="listitem">
-<code class="computeroutput"><span class="special">[</span><span class="identifier">out_it</span><span class="special">,</span> <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> is a valid range.
-            </li>
-</ul></div>
-<a name="range.reference.range_algorithm.range_algorithm_mutating_algorithms.copy_backward.complexity"></a><h6>
-<a name="id2723899"></a>
-            <a class="link" href="copy_backward.html#range.reference.range_algorithm.range_algorithm_mutating_algorithms.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.
-          </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>
-        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="copy.html"><img src="../../../../../../../../doc/html/images/prev.png" alt="Prev"></a><a accesskey="u" href="../range_algorithm_mutating_algorithms.html"><img src="../../../../../../../../doc/html/images/up.png" alt="Up"></a><a accesskey="h" href="../../../../index.html"><img src="../../../../../../../../doc/html/images/home.png" alt="Home"></a><a accesskey="n" href="../range_algorithm_non_mutating_algorithms.html"><img src="../../../../../../../../doc/html/images/next.png" alt="Next"></a>
-</div>
-</body>
-</html>
diff --git a/doc/html/range/reference/range_algorithm/range_algorithm_new_algorithms.html b/doc/html/range/reference/range_algorithm/range_algorithm_new_algorithms.html
deleted file mode 100644
index a7f08e5..0000000
--- a/doc/html/range/reference/range_algorithm/range_algorithm_new_algorithms.html
+++ /dev/null
@@ -1,41 +0,0 @@
-<html>
-<head>
-<meta http-equiv="Content-Type" content="text/html; charset=US-ASCII">
-<title></title>
-<link rel="stylesheet" href="../../../../../../../doc/html/boostbook.css" type="text/css">
-<meta name="generator" content="DocBook XSL Stylesheets V1.75.1">
-<link rel="home" href="../../../index.html" title="Chapter&#160;1.&#160;Range 2.0">
-<link rel="up" href="../range_algorithm.html" title="Range Algorithm">
-<link rel="prev" href="range_algorithm_non_mutating_algorithms.html" title="Non-mutating algorithms">
-<link rel="next" href="../extending.html" title="Extending the library">
-</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="../../../../../../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="range_algorithm_non_mutating_algorithms.html"><img src="../../../../../../../doc/html/images/prev.png" alt="Prev"></a><a accesskey="u" href="../range_algorithm.html"><img src="../../../../../../../doc/html/images/up.png" alt="Up"></a><a accesskey="h" href="../../../index.html"><img src="../../../../../../../doc/html/images/home.png" alt="Home"></a><a accesskey="n" href="../extending.html"><img src="../../../../../../../doc/html/images/next.png" alt="Next"></a>
-</div>
-<div class="section"><div class="titlepage"><div><div><h4 class="title">
-<a name="range.reference.range_algorithm.range_algorithm_new_algorithms"></a><a class="link" href="range_algorithm_new_algorithms.html">???</a>
-</h4></div></div></div></div>
-<table xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" width="100%"><tr>
-<td align="left"></td>
-<td align="right"><div class="copyright-footer">Copyright &#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="range_algorithm_non_mutating_algorithms.html"><img src="../../../../../../../doc/html/images/prev.png" alt="Prev"></a><a accesskey="u" href="../range_algorithm.html"><img src="../../../../../../../doc/html/images/up.png" alt="Up"></a><a accesskey="h" href="../../../index.html"><img src="../../../../../../../doc/html/images/home.png" alt="Home"></a><a accesskey="n" href="../extending.html"><img src="../../../../../../../doc/html/images/next.png" alt="Next"></a>
-</div>
-</body>
-</html>
diff --git a/doc/html/range/reference/range_algorithm/range_algorithm_non_mutating_algorithms.html b/doc/html/range/reference/range_algorithm/range_algorithm_non_mutating_algorithms.html
deleted file mode 100644
index 9974a92..0000000
--- a/doc/html/range/reference/range_algorithm/range_algorithm_non_mutating_algorithms.html
+++ /dev/null
@@ -1,42 +0,0 @@
-<html>
-<head>
-<meta http-equiv="Content-Type" content="text/html; charset=US-ASCII">
-<title>Non-mutating algorithms</title>
-<link rel="stylesheet" href="../../../../../../../doc/html/boostbook.css" type="text/css">
-<meta name="generator" content="DocBook XSL Stylesheets V1.75.1">
-<link rel="home" href="../../../index.html" title="Chapter&#160;1.&#160;Range 2.0">
-<link rel="up" href="../range_algorithm.html" title="Range Algorithm">
-<link rel="prev" href="range_algorithm_mutating_algorithms/copy_backward.html" title="Range Algorithm - copy_backward">
-<link rel="next" href="range_algorithm_new_algorithms.html" title="">
-</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="../../../../../../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="range_algorithm_mutating_algorithms/copy_backward.html"><img src="../../../../../../../doc/html/images/prev.png" alt="Prev"></a><a accesskey="u" href="../range_algorithm.html"><img src="../../../../../../../doc/html/images/up.png" alt="Up"></a><a accesskey="h" href="../../../index.html"><img src="../../../../../../../doc/html/images/home.png" alt="Home"></a><a accesskey="n" href="range_algorithm_new_algorithms.html"><img src="../../../../../../../doc/html/images/next.png" alt="Next"></a>
-</div>
-<div class="section" title="Non-mutating algorithms"><div class="titlepage"><div><div><h4 class="title">
-<a name="range.reference.range_algorithm.range_algorithm_non_mutating_algorithms"></a><a class="link" href="range_algorithm_non_mutating_algorithms.html" title="Non-mutating algorithms">
-        Non-mutating algorithms</a>
-</h4></div></div></div></div>
-<table xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" width="100%"><tr>
-<td align="left"></td>
-<td align="right"><div class="copyright-footer">Copyright &#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="range_algorithm_mutating_algorithms/copy_backward.html"><img src="../../../../../../../doc/html/images/prev.png" alt="Prev"></a><a accesskey="u" href="../range_algorithm.html"><img src="../../../../../../../doc/html/images/up.png" alt="Up"></a><a accesskey="h" href="../../../index.html"><img src="../../../../../../../doc/html/images/home.png" alt="Home"></a><a accesskey="n" href="range_algorithm_new_algorithms.html"><img src="../../../../../../../doc/html/images/next.png" alt="Next"></a>
-</div>
-</body>
-</html>
diff --git a/doc/intro.html b/doc/intro.html
deleted file mode 100644
index 89d3504..0000000
--- a/doc/intro.html
+++ /dev/null
@@ -1,164 +0,0 @@
-<!DOCTYPE HTML PUBLIC "-//W3C//DTD HTML 3.2//EN">
-
-<html>
-<head>
-    <meta http-equiv="Content-Type" content="text/html; charset=ISO-8859-1">
-    <title>Boost.Range Introduction </title>
-    <link rel="stylesheet" href="style.css" type="text/css">
-</head>
-
-    <body>
-
-    <table border="0" >
-        <tr>
-            <td ><img src="../../../boost.png" border="0" ></td>
-            <td ><h1 align="center">Boost.Range</h1></td>
-        </tr>
-    </table>
-
-    <h2>Introduction</h2>
-    <p>
-    Generic algorithms have so far been specified in terms of two or more
-    iterators. Two iterators would together form a range of values that the
-    algorithm could work on. This leads to a very general interface, but also
-    to a somewhat clumsy use of the algorithms with redundant specification
-    of container names. Therefore we would like to raise the abstraction level
-    for algorithms so they specify their interface in terms of <a
-    href="range.html">Ranges</a> as much as possible.
-    </p>
-
-    <p>
-    The most common form of ranges we are used to work with is standard library
-    containers. However, one
-    often finds it desirable to extend that code to work with other types that
-    offer
-    enough functionality to satisfy the needs of the generic code
-    <i>if a suitable layer of indirection is applied </i>.  For
-    example, raw arrays are often suitable for use with generic code that
-    works with containers, provided a suitable adapter is used. 
-    </p>
-
-    <p>
-     This library therefore provides the means to adapt standard-like
-     containers, <code>std::pairs</code> of iterators, and raw arrays (and 
-     more), such that
-    the same generic code can work with them all.
-The basic idea is to add another layer of indirection using <a
-href="../../mpl/doc/refmanual/metafunction.html">metafunctions</a> and
-free-standing functions so syntactic and/or semantic differences can be removed.
-</p>
-
-    <p  >
-    The main advantages are
-    <ul  >
-        <li  >
-            simpler implementation and specification of generic range algorithms
-        </li>
-        <li  >
-            more flexible, compact and maintainable client code
-        </li>
-        <li  >
-        safe use of built-in arrays
-        </li>
-
-    </ul>
-    </p>
-    <p  > Below is given a small example (the complete example can be found <a
-    href="../test/algorithm_example.cpp" target="_self" >here</a>): <blockquote>
-        <pre  >
-<span class=comment>
-    //
-    // example: extracting bounds in a generic algorithm
-    //
-    </span><span class=keyword>template</span><span class=special>&lt; </span><span class=keyword>class </span><span class=identifier>ForwardReadableRange</span><span class=special>, </span><span class=keyword>class </span><span class=identifier>T </span><span class=special>&gt;
-    </span><span class=keyword>inline </span><span class=keyword>typename </span><span class=identifier>boost</span><span class=special>::</span><span class=identifier>range_iterator</span><span class=special>&lt; </span><span class=identifier>ForwardReadableRange </span><span class=special>&gt;::</span><span class=identifier>type
-    </span><span class=identifier>find</span><span class=special>( </span><span class=identifier>ForwardReadableRange</span><span class=special>&amp; </span><span class=identifier>c</span><span class=special>, </span><span class=keyword>const </span><span class=identifier>T</span><span class=special>&amp; </span><span class=identifier>value </span><span class=special>)
-    </span><span class=special>{
-       </span><span class=keyword>return </span><span class=identifier>std</span><span class=special>::</span><span class=identifier>find</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>c </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>c </span><span class=special>), </span><span class=identifier>value </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>ForwardReadableRange</span><span class=special>, </span><span class=keyword>class </span><span class=identifier>T </span><span class=special>&gt;
-    </span><span class=keyword>inline </span><span class=keyword>typename </span><span class=identifier>boost</span><span class=special>::</span><span class=identifier>range_iterator</span><span class=special>&lt; </span><span class=keyword>const </span><span
-class=identifier>ForwardReadableRange </span><span class=special>&gt;::</span><span class=identifier>type
-    </span><span class=identifier>find</span><span class=special>( </span><span class=keyword>const </span><span class=identifier>ForwardReadableRange</span><span class=special>&amp; </span><span class=identifier>c</span><span class=special>, </span><span class=keyword>const </span><span class=identifier>T</span><span class=special>&amp; </span><span class=identifier>value </span><span class=special>)
-    </span><span class=special>{
-       </span><span class=keyword>return </span><span class=identifier>std</span><span class=special>::</span><span class=identifier>find</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>c </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>c </span><span class=special>), </span><span class=identifier>value </span><span class=special>);
-    </span><span class=special>}
-
-    </span><span class=comment>//
-    // replace first value and return its index
-    //
-    </span><span class=keyword>template</span><span class=special>&lt; </span><span class=keyword>class </span><span class=identifier>ForwardReadableWriteableRange</span><span class=special>, </span><span class=keyword>class </span><span class=identifier>T </span><span class=special>&gt;
-    </span><span class=keyword>inline </span><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>ForwardReadableWriteableRange </span><span class=special>&gt;::</span><span class=identifier>type
-    </span><span class=identifier>my_generic_replace</span><span class=special>( </span><span class=identifier>ForwardReadableWriteableRange</span><span class=special>&amp; </span><span class=identifier>c</span><span class=special>, </span><span class=keyword>const </span><span class=identifier>T</span><span class=special>&amp; </span><span class=identifier>value</span><span class=special>, </span><span class=keyword>const </span><span class=identifier>T</span><span class=special>&amp; </span><span class=identifier>replacement </span><span class=special>)
-    </span><span class=special>{
-       </span><span class=keyword>typename </span><span class=identifier>boost</span><span class=special>::</span><span class=identifier>range_iterator</span><span class=special>&lt; </span><span class=identifier>ForwardReadableWriteableRange </span><span class=special>&gt;::</span><span class=identifier>type </span><span class=identifier>found </span><span class=special>= </span><span class=identifier>find</span><span class=special>( </span><span class=identifier>c</span><span class=special>, </span><span class=identifier>value </span><span class=special>);
-
-       </span><span class=keyword>if</span><span class=special>( </span><span class=identifier>found </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>c </span><span class=special>) </span><span class=special>)
-           </span><span class=special>*</span><span class=identifier>found </span><span class=special>= </span><span class=identifier>replacement</span><span class=special>;
-       </span><span class=keyword>return </span><span class=identifier>std</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>c </span><span class=special>), </span><span class=identifier>found </span><span class=special>);
-    </span><span class=special>}
-
-    </span><span class=comment>//
-    // usage
-    //
-    </span><span class=keyword>const </span><span class=keyword>int </span><span class=identifier>N </span><span class=special>= </span><span class=number>5</span><span class=special>;
-    </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>my_vector</span><span class=special>;
-    </span><span class=keyword>int </span><span class=identifier>values</span><span class=special>[] </span><span class=special>= </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>
-    <span class=identifier>my_vector</span><span class=special>.</span><span
-class=identifier>assign</span><span class=special>( </span><span class=identifier>values</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>values </span><span class=special>) </span><span class=special>);</span>
-    <span class=keyword>typedef </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>iterator</span><span class=special>;
-    </span><span class=identifier>std</span><span class=special>::</span><span class=identifier>pair</span><span class=special>&lt;</span><span class=identifier>iterator</span><span class=special>,</span><span class=identifier>iterator</span><span class=special>&gt;       </span><span class=identifier>my_view</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>my_vector </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>my_vector </span><span class=special>) </span><span class=special>+ </span><span class=identifier>N </span><span class=special>);
-    </span><span class=keyword>char  </span><span class=identifier>str_val</span><span class=special>[] </span><span class=special>= </span><span class=string>&quot;a string&quot;</span><span class=special>;
-    </span><span class=keyword>char</span><span class=special>* </span><span class=identifier>str       </span><span class=special>= </span><span class=identifier>str_val</span><span class=special>;
-
-    </span><span class=identifier>std</span><span class=special>::</span><span class=identifier>cout </span><span class=special>&lt;&lt; </span><span class=identifier>my_generic_replace</span><span class=special>( </span><span class=identifier>my_vector</span><span class=special>, </span><span class=number>4</span><span class=special>, </span><span class=number>2 </span><span class=special>);
-    </span><span class=identifier>std</span><span class=special>::</span><span class=identifier>cout </span><span class=special>&lt;&lt; </span><span class=identifier>my_generic_replace</span><span class=special>( </span><span class=identifier>my_view</span><span class=special>, </span><span class=number>4</span><span class=special>, </span><span class=number>2 </span><span class=special>);
-    </span><span class=identifier>std</span><span class=special>::</span><span class=identifier>cout </span><span class=special>&lt;&lt; </span><span class=identifier>my_generic_replace</span><span class=special>( </span><span class=identifier>str</span><span class=special>, </span><span class=literal>'a'</span><span class=special>, </span><span class=literal>'b' </span><span class=special>);
-</span>
-    <span class=comment>// prints '3', '5' and '0'     </span>
-    </pre>
-    </blockquote>
-
-    By using the free-standing functions and <a
-href="../../mpl/doc/refmanual/metafunction.html">metafunctions</a>, the code automatically
-    works for all the types supported by this library; now and in the future.
-Notice that we have to
-    provide two version of <code  >find()</code> since we cannot forward a non-const
-    rvalue with reference arguments (see this article about  <a href="http://std.dkuug.dk/jtc1/sc22/wg21/docs/papers/2002/n1385.htm" target="_self" >The
-    Forwarding Problem</a> ).
-
-    </p>
-
-
-    <hr>
-    <p>
-      &copy; <a name="Copyright" id="Copyright">Copyright</a> Thorsten Ottosen 2008.
-    </p>
-
-    <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">www.boost.org/LICENSE_1_0.txt</a>)
-    </p>
-
-    <br>
-    <br>
-    <br>
-    <br>
-    <br>
-    <br>
-    <br>
-    <br>
-    <br>
-    <br>
-    <br>
-    <br>
-
-
-    </body>
-</html>
-
diff --git a/doc/istream_range.html b/doc/istream_range.html
deleted file mode 100755
index 8f41fc4..0000000
--- a/doc/istream_range.html
+++ /dev/null
@@ -1,64 +0,0 @@
-<!DOCTYPE HTML PUBLIC "-//W3C//DTD HTML 3.2//EN">
-
-<html>
-<head>
-    <meta http-equiv="Content-Type" content="text/html; charset=ISO-8859-1" />
-    <title>Boost.Range Utilities</title>
-    <link rel="stylesheet" href="style.css" type="text/css" />
-</head>
-
-    <body>
-    <table border="0" >
-        <tr>
-            <td ><img src="../../../boost.png" border="0" /></td>
-            <td ><h1 align="center">Boost.Range</h1></td>
-        </tr>
-    </table>
-    <a name="istream_range"></a> <h1>Function <code>istream_range</code></h1>
-    <p>
-    The intention of the <code>istream_range</code> function is to construct
-    a new range with a pair of <code>std::istream_iterator</code>s that wrap a
-    specified <code>std::basic_istream</code> instance.
-    </p>
-
-    <h3>Synopsis</h3>
-
-    <pre>
-<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">
-        Type,</span><span class="identifier"> <span style="color: #0000ff">class <span style="color: #000000">
-            Elem</span><span style="color: #000000">, <span style="color: #0000ff">class <span
-                style="color: #000000">Traits </span></span></span></span></span><span class="special">&gt; <span style="color: #0000ff">inline</span>
-    </span><span class="keyword"></span><span class="identifier">range&lt; std::istream_iterator&lt;Type, Elem, Traits&gt; &gt;
-    istream_range(std::basic_istream&lt;Elem, Traits&gt;&amp; in);
-}    </pre>
-    
-    <p>
-      &copy; <a name="Copyright" id="Copyright">Copyright</a> Neil Groves 2009.
-</p>
-
-    <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">www.boost.org/LICENSE_1_0.txt</a>)
-    </p>
-
-  <br />
-  <br />
-  <br />
-  <br />
-  <br />
-  <br />
-  <br />
-  <br />
-  <br />
-  <br />
-  <br />
-  <br />
-  
-    
-    </body>
-</html>
-
diff --git a/doc/mfc_atl.html b/doc/mfc_atl.html
deleted file mode 100644
index cc8eeb0..0000000
--- a/doc/mfc_atl.html
+++ /dev/null
@@ -1,581 +0,0 @@
-<?xml version="1.0" encoding="utf-8" ?>
-<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "http://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd">
-<html xmlns="http://www.w3.org/1999/xhtml" xml:lang="en" lang="en">
-<head>
-<meta http-equiv="Content-Type" content="text/html; charset=utf-8" />
-<meta name="generator" content="Docutils 0.3.10: http://docutils.sourceforge.net/" />
-<title>Boost Range MFC/ATL Extension</title>
-<meta name="author" content="Shunsuke Sogame" />
-<meta name="date" content="26th of May 2006" />
-<meta name="copyright" content="Shunsuke Sogame 2005-2006. Use, modification and distribution is subject to the Boost Software License, Version 1.0 (see LICENSE_1_0.txt)." />
-<style type="text/css">
-
-/*
-:Author: David Goodger
-:Contact: goodger@users.sourceforge.net
-:Date: $Date: 2005-09-25 17:49:54 +0200 (Sun, 25 Sep 2005) $
-:Revision: $Revision: 3901 $
-:Copyright: This stylesheet has been placed in the public domain.
-
-Default cascading style sheet for the HTML output of Docutils.
-
-See http://docutils.sf.net/docs/howto/html-stylesheets.html for how to
-customize this style sheet.
-*/
-
-/* "! important" is used here to override other ``margin-top`` and
-   ``margin-bottom`` styles that are later in the stylesheet or 
-   more specific.  See http://www.w3.org/TR/CSS1#the-cascade */
-.first {
-  margin-top: 0 ! important }
-
-.last, .with-subtitle {
-  margin-bottom: 0 ! important }
-
-.hidden {
-  display: none }
-
-a.toc-backref {
-  text-decoration: none ;
-  color: black }
-
-blockquote.epigraph {
-  margin: 2em 5em ; }
-
-dl.docutils dd {
-  margin-bottom: 0.5em }
-
-/* Uncomment (and remove this text!) to get bold-faced definition list terms
-dl.docutils dt {
-  font-weight: bold }
-*/
-
-div.abstract {
-  margin: 2em 5em }
-
-div.abstract p.topic-title {
-  font-weight: bold ;
-  text-align: center }
-
-div.admonition, div.attention, div.caution, div.danger, div.error,
-div.hint, div.important, div.note, div.tip, div.warning {
-  margin: 2em ;
-  border: medium outset ;
-  padding: 1em }
-
-div.admonition p.admonition-title, div.hint p.admonition-title,
-div.important p.admonition-title, div.note p.admonition-title,
-div.tip p.admonition-title {
-  font-weight: bold ;
-  font-family: sans-serif }
-
-div.attention p.admonition-title, div.caution p.admonition-title,
-div.danger p.admonition-title, div.error p.admonition-title,
-div.warning p.admonition-title {
-  color: red ;
-  font-weight: bold ;
-  font-family: sans-serif }
-
-/* Uncomment (and remove this text!) to get reduced vertical space in
-   compound paragraphs.
-div.compound .compound-first, div.compound .compound-middle {
-  margin-bottom: 0.5em }
-
-div.compound .compound-last, div.compound .compound-middle {
-  margin-top: 0.5em }
-*/
-
-div.dedication {
-  margin: 2em 5em ;
-  text-align: center ;
-  font-style: italic }
-
-div.dedication p.topic-title {
-  font-weight: bold ;
-  font-style: normal }
-
-div.figure {
-  margin-left: 2em }
-
-div.footer, div.header {
-  clear: both;
-  font-size: smaller }
-
-div.line-block {
-  display: block ;
-  margin-top: 1em ;
-  margin-bottom: 1em }
-
-div.line-block div.line-block {
-  margin-top: 0 ;
-  margin-bottom: 0 ;
-  margin-left: 1.5em }
-
-div.sidebar {
-  margin-left: 1em ;
-  border: medium outset ;
-  padding: 1em ;
-  background-color: #ffffee ;
-  width: 40% ;
-  float: right ;
-  clear: right }
-
-div.sidebar p.rubric {
-  font-family: sans-serif ;
-  font-size: medium }
-
-div.system-messages {
-  margin: 5em }
-
-div.system-messages h1 {
-  color: red }
-
-div.system-message {
-  border: medium outset ;
-  padding: 1em }
-
-div.system-message p.system-message-title {
-  color: red ;
-  font-weight: bold }
-
-div.topic {
-  margin: 2em }
-
-h1.section-subtitle, h2.section-subtitle, h3.section-subtitle,
-h4.section-subtitle, h5.section-subtitle, h6.section-subtitle {
-  margin-top: 0.4em }
-
-h1.title {
-  text-align: center }
-
-h2.subtitle {
-  text-align: center }
-
-hr.docutils {
-  width: 75% }
-
-img.align-left {
-  clear: left }
-
-img.align-right {
-  clear: right }
-
-img.borderless {
-  border: 0 }
-
-ol.simple, ul.simple {
-  margin-bottom: 1em }
-
-ol.arabic {
-  list-style: decimal }
-
-ol.loweralpha {
-  list-style: lower-alpha }
-
-ol.upperalpha {
-  list-style: upper-alpha }
-
-ol.lowerroman {
-  list-style: lower-roman }
-
-ol.upperroman {
-  list-style: upper-roman }
-
-p.attribution {
-  text-align: right ;
-  margin-left: 50% }
-
-p.caption {
-  font-style: italic }
-
-p.credits {
-  font-style: italic ;
-  font-size: smaller }
-
-p.label {
-  white-space: nowrap }
-
-p.rubric {
-  font-weight: bold ;
-  font-size: larger ;
-  color: maroon ;
-  text-align: center }
-
-p.sidebar-title {
-  font-family: sans-serif ;
-  font-weight: bold ;
-  font-size: larger }
-
-p.sidebar-subtitle {
-  font-family: sans-serif ;
-  font-weight: bold }
-
-p.topic-title {
-  font-weight: bold }
-
-pre.address {
-  margin-bottom: 0 ;
-  margin-top: 0 ;
-  font-family: serif ;
-  font-size: 100% }
-
-pre.line-block {
-  font-family: serif ;
-  font-size: 100% }
-
-pre.literal-block, pre.doctest-block {
-  margin-left: 2em ;
-  margin-right: 2em ;
-  background-color: #eeeeee }
-
-span.classifier {
-  font-family: sans-serif ;
-  font-style: oblique }
-
-span.classifier-delimiter {
-  font-family: sans-serif ;
-  font-weight: bold }
-
-span.interpreted {
-  font-family: sans-serif }
-
-span.option {
-  white-space: nowrap }
-
-span.pre {
-  white-space: pre }
-
-span.problematic {
-  color: red }
-
-span.section-subtitle {
-  /* font-size relative to parent (h1..h6 element) */
-  font-size: 80% }
-
-table.citation {
-  border-left: solid thin gray }
-
-table.docinfo {
-  margin: 2em 4em }
-
-table.docutils {
-  margin-top: 0.5em ;
-  margin-bottom: 0.5em }
-
-table.footnote {
-  border-left: solid thin black }
-
-table.docutils td, table.docutils th,
-table.docinfo td, table.docinfo th {
-  padding-left: 0.5em ;
-  padding-right: 0.5em ;
-  vertical-align: top }
-
-table.docutils th.field-name, table.docinfo th.docinfo-name {
-  font-weight: bold ;
-  text-align: left ;
-  white-space: nowrap ;
-  padding-left: 0 }
-
-h1 tt.docutils, h2 tt.docutils, h3 tt.docutils,
-h4 tt.docutils, h5 tt.docutils, h6 tt.docutils {
-  font-size: 100% }
-
-tt.docutils {
-  background-color: #eeeeee }
-
-ul.auto-toc {
-  list-style-type: none }
-
-</style>
-</head>
-<body>
-<div class="document" id="boost-range-mfc-atl-extension">
-<h1 class="title"><img alt="Boost" src="../../ptr_container/doc/boost.png" /> Range MFC/ATL Extension</h1>
-<table class="docinfo" frame="void" rules="none">
-<col class="docinfo-name" />
-<col class="docinfo-content" />
-<tbody valign="top">
-<tr><th class="docinfo-name">Author:</th>
-<td>Shunsuke Sogame</td></tr>
-<tr><th class="docinfo-name">Contact:</th>
-<td><a class="first last reference" href="mailto:mb2act&#64;yahoo.co.jp">mb2act&#64;yahoo.co.jp</a></td></tr>
-<tr><th class="docinfo-name">Date:</th>
-<td>26th of May 2006</td></tr>
-<tr><th class="docinfo-name">Copyright:</th>
-<td>Shunsuke Sogame 2005-2006. Use, modification and distribution is subject to the Boost Software License, Version 1.0 (see <a class="reference" href="http://www.boost.org/LICENSE_1_0.txt">LICENSE_1_0.txt</a>).</td></tr>
-</tbody>
-</table>
-<div class="section">
-<h1><a id="overview" name="overview">Overview</a></h1>
-<p>Boost.Range MFC/ATL Extension provides <a class="reference" href="../index.html">Boost.Range</a> support for MFC/ATL collection and string types.</p>
-<pre class="literal-block">
-CTypedPtrArray&lt;CPtrArray, CList&lt;CString&gt; *&gt; myArray;
-...
-BOOST_FOREACH (CList&lt;CString&gt; *theList, myArray)
-{
-    BOOST_FOREACH (CString&amp; str, *theList)
-    {
-        boost::to_upper(str);
-        std::sort(boost::begin(str), boost::end(str));
-        ...
-    }
-}
-</pre>
-<ul class="simple">
-<li><a class="reference" href="#requirements">Requirements</a></li>
-<li><a class="reference" href="#mfc-ranges">MFC Ranges</a></li>
-<li><a class="reference" href="#atl-ranges">ATL Ranges</a></li>
-<li><a class="reference" href="#const-ranges">const Ranges</a></li>
-<li><a class="reference" href="#references">References</a></li>
-</ul>
-</div>
-<div class="section">
-<h1><a id="requirements" name="requirements">Requirements</a></h1>
-<ul class="simple">
-<li><a class="reference" href="http://www.boost.org/">Boost C++ Libraries Version 1.34.0</a> or later (no compilation required)</li>
-<li>Visual C++ 7.1 or Visual C++ 8.0</li>
-</ul>
-</div>
-<div class="section">
-<h1><a id="mfc-ranges" name="mfc-ranges">MFC Ranges</a></h1>
-<p>If the <tt class="docutils literal"><span class="pre">&lt;boost/range/mfc.hpp&gt;</span></tt> is included before or after <a class="reference" href="../index.html">Boost.Range</a> headers,
-the MFC collections and strings become models of Range.
-The table below lists the Traversal Category and <tt class="docutils literal"><span class="pre">range_reference</span></tt> of MFC ranges.</p>
-<table border="1" class="docutils">
-<colgroup>
-<col width="34%" />
-<col width="21%" />
-<col width="45%" />
-</colgroup>
-<thead valign="bottom">
-<tr><th class="head"><tt class="docutils literal"><span class="pre">Range</span></tt></th>
-<th class="head">Traversal Category</th>
-<th class="head"><tt class="docutils literal"><span class="pre">range_reference&lt;Range&gt;::type</span></tt></th>
-</tr>
-</thead>
-<tbody valign="top">
-<tr><td><tt class="docutils literal"><span class="pre">CArray&lt;T,A&gt;</span></tt></td>
-<td>Random Access</td>
-<td><tt class="docutils literal"><span class="pre">T&amp;</span></tt></td>
-</tr>
-<tr><td><tt class="docutils literal"><span class="pre">CList&lt;T,A&gt;</span></tt></td>
-<td>Bidirectional</td>
-<td><tt class="docutils literal"><span class="pre">T&amp;</span></tt></td>
-</tr>
-<tr><td><tt class="docutils literal"><span class="pre">CMap&lt;K,AK,M,AM&gt;</span></tt></td>
-<td>Forward</td>
-<td><tt class="docutils literal"><span class="pre">Range::CPair&amp;</span></tt></td>
-</tr>
-<tr><td><tt class="docutils literal"><span class="pre">CTypedPtrArray&lt;B,T*&gt;</span></tt></td>
-<td>Random Access</td>
-<td><tt class="docutils literal"><span class="pre">T*</span> <span class="pre">const</span></tt></td>
-</tr>
-<tr><td><tt class="docutils literal"><span class="pre">CTypedPtrList&lt;B,T*&gt;</span></tt></td>
-<td>Bidirectional</td>
-<td><tt class="docutils literal"><span class="pre">T*</span> <span class="pre">const</span></tt></td>
-</tr>
-<tr><td><tt class="docutils literal"><span class="pre">CTypedPtrMap&lt;B,T*,V*&gt;</span></tt></td>
-<td>Forward</td>
-<td><tt class="docutils literal"><span class="pre">std::pair&lt;T*,V*&gt;</span> <span class="pre">const</span></tt></td>
-</tr>
-<tr><td><tt class="docutils literal"><span class="pre">CByteArray</span></tt></td>
-<td>Random Access</td>
-<td><tt class="docutils literal"><span class="pre">BYTE&amp;</span></tt></td>
-</tr>
-<tr><td><tt class="docutils literal"><span class="pre">CDWordArray</span></tt></td>
-<td>Random Access</td>
-<td><tt class="docutils literal"><span class="pre">DWORD&amp;</span></tt></td>
-</tr>
-<tr><td><tt class="docutils literal"><span class="pre">CObArray</span></tt></td>
-<td>Random Access</td>
-<td><tt class="docutils literal"><span class="pre">CObject*</span> <span class="pre">&amp;</span></tt></td>
-</tr>
-<tr><td><tt class="docutils literal"><span class="pre">CPtrArray</span></tt></td>
-<td>Random Access</td>
-<td><tt class="docutils literal"><span class="pre">void*</span> <span class="pre">&amp;</span></tt></td>
-</tr>
-<tr><td><tt class="docutils literal"><span class="pre">CStringArray</span></tt></td>
-<td>Random Access</td>
-<td><tt class="docutils literal"><span class="pre">CString&amp;</span></tt></td>
-</tr>
-<tr><td><tt class="docutils literal"><span class="pre">CUIntArray</span></tt></td>
-<td>Random Access</td>
-<td><tt class="docutils literal"><span class="pre">UINT&amp;</span></tt></td>
-</tr>
-<tr><td><tt class="docutils literal"><span class="pre">CWordArray</span></tt></td>
-<td>Random Access</td>
-<td><tt class="docutils literal"><span class="pre">WORD&amp;</span></tt></td>
-</tr>
-<tr><td><tt class="docutils literal"><span class="pre">CObList</span></tt></td>
-<td>Bidirectional</td>
-<td><tt class="docutils literal"><span class="pre">CObject*</span> <span class="pre">&amp;</span></tt></td>
-</tr>
-<tr><td><tt class="docutils literal"><span class="pre">CPtrList</span></tt></td>
-<td>Bidirectional</td>
-<td><tt class="docutils literal"><span class="pre">void*</span> <span class="pre">&amp;</span></tt></td>
-</tr>
-<tr><td><tt class="docutils literal"><span class="pre">CStringList</span></tt></td>
-<td>Bidirectional</td>
-<td><tt class="docutils literal"><span class="pre">CString&amp;</span></tt></td>
-</tr>
-<tr><td><tt class="docutils literal"><span class="pre">CMapPtrToWord</span></tt></td>
-<td>Forward</td>
-<td><tt class="docutils literal"><span class="pre">std::pair&lt;void*,WORD&gt;</span> <span class="pre">const</span></tt></td>
-</tr>
-<tr><td><tt class="docutils literal"><span class="pre">CMapPtrToPtr</span></tt></td>
-<td>Forward</td>
-<td><tt class="docutils literal"><span class="pre">std::pair&lt;void*,void*&gt;</span> <span class="pre">const</span></tt></td>
-</tr>
-<tr><td><tt class="docutils literal"><span class="pre">CMapStringToOb</span></tt></td>
-<td>Forward</td>
-<td><tt class="docutils literal"><span class="pre">std::pair&lt;String,CObject*&gt;</span> <span class="pre">const</span></tt></td>
-</tr>
-<tr><td><tt class="docutils literal"><span class="pre">CMapStringToString</span></tt></td>
-<td>Forward</td>
-<td><tt class="docutils literal"><span class="pre">Range::CPair&amp;</span></tt></td>
-</tr>
-<tr><td><tt class="docutils literal"><span class="pre">CMapWordToOb</span></tt></td>
-<td>Forward</td>
-<td><tt class="docutils literal"><span class="pre">std::pair&lt;WORD,CObject*&gt;</span> <span class="pre">const</span></tt></td>
-</tr>
-<tr><td><tt class="docutils literal"><span class="pre">CMapWordToPtr</span></tt></td>
-<td>Forward</td>
-<td><tt class="docutils literal"><span class="pre">std::pair&lt;WORD,void*&gt;</span> <span class="pre">const</span></tt></td>
-</tr>
-</tbody>
-</table>
-<p>Other <a class="reference" href="../index.html">Boost.Range</a> metafunctions are defined by the following.
-Let <tt class="docutils literal"><span class="pre">Range</span></tt> be any type listed above and <tt class="docutils literal"><span class="pre">ReF</span></tt> be the same as <tt class="docutils literal"><span class="pre">range_reference&lt;Range&gt;::type</span></tt>.
-<tt class="docutils literal"><span class="pre">range_value&lt;Range&gt;::type</span></tt> is the same as <tt class="docutils literal"><span class="pre">remove_reference&lt;remove_const&lt;Ref&gt;::type&gt;::type</span></tt>,
-<tt class="docutils literal"><span class="pre">range_difference&lt;Range&gt;::type</span></tt> is the same as <tt class="docutils literal"><span class="pre">std::ptrdiff_t</span></tt>, and
-<tt class="docutils literal"><span class="pre">range_pointer&lt;Range&gt;::type</span></tt> is the same as <tt class="docutils literal"><span class="pre">add_pointer&lt;remove_reference&lt;Ref&gt;::type&gt;::type</span></tt>.
-As for <tt class="docutils literal"><span class="pre">const</span> <span class="pre">Range</span></tt>, see <a class="reference" href="#const-ranges">const Ranges</a>.</p>
-</div>
-<div class="section">
-<h1><a id="atl-ranges" name="atl-ranges">ATL Ranges</a></h1>
-<p>If the <tt class="docutils literal"><span class="pre">&lt;boost/range/atl.hpp&gt;</span></tt> is included before or after <a class="reference" href="../index.html">Boost.Range</a> headers,
-the ATL collections and strings become models of Range.
-The table below lists the Traversal Category and <tt class="docutils literal"><span class="pre">range_reference</span></tt> of ATL ranges.</p>
-<table border="1" class="docutils">
-<colgroup>
-<col width="34%" />
-<col width="21%" />
-<col width="45%" />
-</colgroup>
-<thead valign="bottom">
-<tr><th class="head"><tt class="docutils literal"><span class="pre">Range</span></tt></th>
-<th class="head">Traversal Category</th>
-<th class="head"><tt class="docutils literal"><span class="pre">range_reference&lt;Range&gt;::type</span></tt></th>
-</tr>
-</thead>
-<tbody valign="top">
-<tr><td><tt class="docutils literal"><span class="pre">CAtlArray&lt;E,ET&gt;</span></tt></td>
-<td>Random Access</td>
-<td><tt class="docutils literal"><span class="pre">E&amp;</span></tt></td>
-</tr>
-<tr><td><tt class="docutils literal"><span class="pre">CAutoPtrArray&lt;E&gt;</span></tt></td>
-<td>Random Access</td>
-<td><tt class="docutils literal"><span class="pre">E&amp;</span></tt></td>
-</tr>
-<tr><td><tt class="docutils literal"><span class="pre">CInterfaceArray&lt;I,pi&gt;</span></tt></td>
-<td>Random Access</td>
-<td><tt class="docutils literal"><span class="pre">CComQIPtr&lt;I,pi&gt;&amp;</span></tt></td>
-</tr>
-<tr><td><tt class="docutils literal"><span class="pre">CAtlList&lt;E,ET&gt;</span></tt></td>
-<td>Bidirectional</td>
-<td><tt class="docutils literal"><span class="pre">E&amp;</span></tt></td>
-</tr>
-<tr><td><tt class="docutils literal"><span class="pre">CAutoPtrList&lt;E&gt;</span></tt></td>
-<td>Bidirectional</td>
-<td><tt class="docutils literal"><span class="pre">E&amp;</span></tt></td>
-</tr>
-<tr><td><tt class="docutils literal"><span class="pre">CHeapPtrList&lt;E,A&gt;</span></tt></td>
-<td>Bidirectional</td>
-<td><tt class="docutils literal"><span class="pre">E&amp;</span></tt></td>
-</tr>
-<tr><td><tt class="docutils literal"><span class="pre">CInterfaceList&lt;I,pi&gt;</span></tt></td>
-<td>Bidirectional</td>
-<td><tt class="docutils literal"><span class="pre">CComQIPtr&lt;I,pi&gt;&amp;</span></tt></td>
-</tr>
-<tr><td><tt class="docutils literal"><span class="pre">CAtlMap&lt;K,V,KT,VT&gt;</span></tt></td>
-<td>Forward</td>
-<td><tt class="docutils literal"><span class="pre">Range::CPair&amp;</span></tt></td>
-</tr>
-<tr><td><tt class="docutils literal"><span class="pre">CRBTree&lt;K,V,KT,VT&gt;</span></tt></td>
-<td>Bidirectional</td>
-<td><tt class="docutils literal"><span class="pre">Range::CPair&amp;</span></tt></td>
-</tr>
-<tr><td><tt class="docutils literal"><span class="pre">CRBMap&lt;K,V,KT,VT&gt;</span></tt></td>
-<td>Bidirectional</td>
-<td><tt class="docutils literal"><span class="pre">Range::CPair&amp;</span></tt></td>
-</tr>
-<tr><td><tt class="docutils literal"><span class="pre">CRBMultiMap&lt;K,V,KT,VT&gt;</span></tt></td>
-<td>Bidirectional</td>
-<td><tt class="docutils literal"><span class="pre">Range::CPair&amp;</span></tt></td>
-</tr>
-<tr><td><tt class="docutils literal"><span class="pre">CSimpleStringT&lt;B,b&gt;</span></tt></td>
-<td>Random Access</td>
-<td><tt class="docutils literal"><span class="pre">B&amp;</span></tt></td>
-</tr>
-<tr><td><tt class="docutils literal"><span class="pre">CStringT&lt;B,ST&gt;</span></tt></td>
-<td>Random Access</td>
-<td><tt class="docutils literal"><span class="pre">B&amp;</span></tt></td>
-</tr>
-<tr><td><tt class="docutils literal"><span class="pre">CFixedStringT&lt;S,n&gt;</span></tt></td>
-<td>Random Access</td>
-<td><tt class="docutils literal"><span class="pre">range_reference&lt;S&gt;::type</span></tt></td>
-</tr>
-<tr><td><tt class="docutils literal"><span class="pre">CStringT&lt;B,ST&gt;</span></tt></td>
-<td>Random Access</td>
-<td><tt class="docutils literal"><span class="pre">B&amp;</span></tt></td>
-</tr>
-<tr><td><tt class="docutils literal"><span class="pre">CComBSTR</span></tt></td>
-<td>Random Access</td>
-<td><tt class="docutils literal"><span class="pre">OLECHAR&amp;</span></tt></td>
-</tr>
-<tr><td><tt class="docutils literal"><span class="pre">CSimpleArray&lt;T,TE&gt;</span></tt></td>
-<td>Random Access</td>
-<td><tt class="docutils literal"><span class="pre">T&amp;</span></tt></td>
-</tr>
-</tbody>
-</table>
-<p>Other <a class="reference" href="../index.html">Boost.Range</a> metafunctions are defined by the following.
-Let <tt class="docutils literal"><span class="pre">Range</span></tt> be any type listed above and <tt class="docutils literal"><span class="pre">ReF</span></tt> be the same as <tt class="docutils literal"><span class="pre">range_reference&lt;Range&gt;::type</span></tt>.
-<tt class="docutils literal"><span class="pre">range_value&lt;Range&gt;::type</span></tt> is the same as <tt class="docutils literal"><span class="pre">remove_reference&lt;Ref&gt;::type</span></tt>,
-<tt class="docutils literal"><span class="pre">range_difference&lt;Range&gt;::type</span></tt> is the same as <tt class="docutils literal"><span class="pre">std::ptrdiff_t</span></tt>, and
-<tt class="docutils literal"><span class="pre">range_pointer&lt;Range&gt;::type</span></tt> is the same as <tt class="docutils literal"><span class="pre">add_pointer&lt;remove_reference&lt;Ref&gt;::type&gt;::type</span></tt>.
-As for <tt class="docutils literal"><span class="pre">const</span> <span class="pre">Range</span></tt>, see <a class="reference" href="#const-ranges">const Ranges</a>.</p>
-</div>
-<div class="section">
-<h1><a id="const-ranges" name="const-ranges">const Ranges</a></h1>
-<p><tt class="docutils literal"><span class="pre">range_reference&lt;const</span> <span class="pre">Range&gt;::type</span></tt> is defined by the following algorithm.
-Let <tt class="docutils literal"><span class="pre">Range</span></tt> be any type listed above and <tt class="docutils literal"><span class="pre">ReF</span></tt> be the same as <tt class="docutils literal"><span class="pre">range_reference&lt;Range&gt;::type</span></tt>.</p>
-<pre class="literal-block">
-if (Range is CObArray || Range is CObList)
-    return CObject const * &amp;
-else if (Range is CPtrArray || Range is CPtrList)
-    return void const * &amp;
-else if (there is a type X such that X&amp; is the same as ReF)
-    return X const &amp;
-else if (there is a type X such that X* const is the same as ReF)
-    return X const * const
-else
-    return ReF
-</pre>
-<p>Other <a class="reference" href="../index.html">Boost.Range</a> metafunctions are defined by the following.
-<tt class="docutils literal"><span class="pre">range_value&lt;const</span> <span class="pre">Range&gt;::type</span></tt> is the same as <tt class="docutils literal"><span class="pre">range_value&lt;Range&gt;::type</span></tt>,
-<tt class="docutils literal"><span class="pre">range_difference&lt;const</span> <span class="pre">Range&gt;::type</span></tt> is the same as <tt class="docutils literal"><span class="pre">std::ptrdiff_t</span></tt>, and
-<tt class="docutils literal"><span class="pre">range_pointer&lt;const</span> <span class="pre">Range&gt;::type</span></tt> is the same as <tt class="docutils literal"><span class="pre">add_pointer&lt;remove_reference&lt;range_reference&lt;const</span> <span class="pre">Range&gt;::type&gt;::type&gt;::type</span></tt>.</p>
-</div>
-<div class="section">
-<h1><a id="references" name="references">References</a></h1>
-<ul class="simple">
-<li><a class="reference" href="../index.html">Boost.Range</a></li>
-<li><a class="reference" href="http://msdn2.microsoft.com/en-us/library/942860sh.aspx">MFC Collections</a></li>
-<li><a class="reference" href="http://msdn2.microsoft.com/en-US/library/15e672bd.aspx">ATL Collection Classes</a></li>
-</ul>
-</div>
-</div>
-</body>
-</html>
diff --git a/doc/portability.html b/doc/portability.html
deleted file mode 100644
index bb73e78..0000000
--- a/doc/portability.html
+++ /dev/null
@@ -1,103 +0,0 @@
-<!DOCTYPE HTML PUBLIC "-//W3C//DTD HTML 3.2//EN">
-
-<html>
-<head>
-    <meta http-equiv="Content-Type" content="text/html; charset=ISO-8859-1">
-    <title>Boost.Range Portability </title>
-    <link rel="stylesheet" href="style.css" type="text/css">
-</head>
-
-    <body>
-
-    <table border="0" >
-        <tr>
-            <td ><img src="../../../boost.png" border="0" ></td>
-            <td ><h1 align="center">Boost.Range</h1></td>
-        </tr>
-    </table>
-
-    <h2>Portability</h2><a name="Portability" ></a>
-
-    <p>
-    A huge effort has been made to port the library to as many compilers as possible. 
-<!--    The results of the test-suites can be found <a 
-href="http://boost.sourceforge.net/regression-logs/developer/range.html">here</a
->.--> </p>
-
-    <p>
-    Full support for built-in arrays require that the compiler supports class 
-    template partial specialization. For non-conforming compilers there might be a 
-    chance that it works anyway thanks to workarounds in the type traits library.
-    </p>
-    <p> Visual C++ 6/7.0 has a limited support for arrays: as long as the arrays
-    are of built-in type it should work.
-    </p>
-    <p  >
-    Notice also that some compilers cannot do function template ordering properly. 
-    In that case one must rely on <a
-      href="boost_range.html#range_iterator"><code >range_iterator</code></a> 
-      and a single function definition instead of overloaded versions for const and 
-      non-const arguments.
-
-    So if one cares about old compilers, one should not pass rvalues to the 
-    functions.
-    </p>
-
-    <p>
-    For maximum portability you should follow these guidelines:
-
-    <ol>
-        <li>
-            do not use built-in arrays,
-        <li>
-            do not pass rvalues to <a
-           href="boost_range.html#begin"><code>begin()</code></a>, <a
-           href="boost_range.html#end"><code>end()</code></a> and <a href="utility_class.html#iter_range">
-            <code>iterator_range</code></a> Range constructors and assignment operators,
-        <li>
-            use <a href="boost_range.html#const_begin"><code>const_begin()</code></a> 
-            and <a href="boost_range.html#const_begin"><code>const_end()</code></a>
-            whenever your code by intention is read-only; this will also solve
-            most rvalue problems,
-         <li>
-            do not rely on ADL:
-            <ul>
-                <li>
-                    if you overload functions, include that header <i>before</i> the headers in this 
-                    library,
-                <li>
-                    put all overloads in namespace <code>boost</code>.
-            </ul>
-            
-    </ol>
-    </p>
-
-     <hr>
-    <p>
-      &copy; <a name="Copyright" id="Copyright">Copyright</a> Thorsten Ottosen 2008.
-    </p>
-
-    <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">www.boost.org/LICENSE_1_0.txt</a>)
-    </p>>
-
-    <br>
-    <br>
-    <br>
-    <br>
-    <br>
-    <br>
-    <br>
-    <br>
-    <br>
-    <br>
-    <br>
-    <br>
-
-
-    </body>
-</html>
-
diff --git a/doc/range.html b/doc/range.html
deleted file mode 100644
index 8646141..0000000
--- a/doc/range.html
+++ /dev/null
@@ -1,379 +0,0 @@
-<!DOCTYPE HTML PUBLIC "-//W3C//DTD HTML 3.2//EN">
-<HTML>
-<!--
-  -- Copyright (c) Jeremy Siek 2000
-  --
-  -- Permission to use, copy, modify, distribute and sell this software
-  -- and its documentation for any purpose is hereby granted without fee,
-  -- provided that the above copyright notice appears in all copies and
-  -- that both that copyright notice and this permission notice appear
-  -- in supporting documentation.  Silicon Graphics makes no
-  -- representations about the suitability of this software for any
-  -- purpose.  It is provided "as is" without express or implied warranty.
-  -->
-<Head>
-    <meta http-equiv="Content-Type" content="text/html; charset=ISO-8859-1">
-    <Title>Range Concepts</Title>
-    <link rel="stylesheet" href="style.css" type="text/css">
-</HEAD>
-
-    <table border="0" >
-        <tr>
-            <td ><img src="../../../boost.png" border="0" ></td>
-            <td ><h1 align="center">Boost.Range </h1></td>
-        </tr>
-    </table>
-
-    <h2>Range concepts </h2>
-
-    <ul>
-        <li>
-            <a href="#overview">Overview</a>
-        <li>
-            <a href="#single_pass_range">Single Pass Range</a>
-        <li>
-            <a href="#forward_range">Forward Range</a>
-        <li>
-            <a href="#bidirectional_range">Bidirectional Range</a>
-        <li>
-            <a href="#random_access_range">Random Access Range</a>
-        <li>
-            <a href="#concept_checking">Concept Checking</a>
-    </ul>
-
-    <a name="overview"></a>
-    <hr>
-    <h3>Overview</h3>
-
-    <p>
-    A Range is a <i>concept</i> similar to the STL <a
-               href="http://www.sgi.com/Technology/STL/Container.html">Container</a> concept. A
-               Range provides iterators for accessing a half-open range
-<code>[first,one_past_last)</code> of elements and provides
-               information about the number of elements in the Range.  However, a Range has
-               <i>much</i> fewer requirements than a Container.
-              </p>
-              <p>
-               The motivation for the Range concept is
-               that there are many useful Container-like types that do not meet the full
-               requirements of Container, and many algorithms that can be written with this
-               reduced set of requirements. In particular, a Range does not necessarily
-
-    <ul>
-        <li>
-            own the elements that can be accessed through it,
-        <li>
-            have copy semantics,
-            <!--
-        <li>
-            require that the associated reference type is a real C++ reference.
-            -->
-    </ul>
-
-
-    Because of the second requirement, a Range object must be passed by
-   (const or non-const) reference in generic code.
-
-    </p>
-    <p>
-    The operations that can be performed on a Range is dependent on the
-    <a href="../../iterator/doc/new-iter-concepts.html#iterator-traversal-concepts-lib-iterator-traversal">traversal
-category</a> of the underlying iterator type. Therefore
-    the range concepts are named to reflect which traversal category their 
-    iterators support. See also <a href="style.html">terminology and style 
-    guidelines.</a> for more information about naming of ranges.</p>
-
-    <p> The concepts described below specifies associated types as
-<a href="../../mpl/doc/refmanual/metafunction.html">metafunctions</a> and all
-functions as free-standing functions to allow for a layer of indirection. </p>
-
-<!--<p><i>Notice that these metafunctions must be defined in namespace </i>
-<code>boost</code></p>-->
-
-    <hr>
-    <a name="single_pass_range"></a>
-    <H2>Single Pass Range</H2>
-
-    <h3>Notation</h3>
-    <Table>
-        <TR>
-            <TD VAlign="top"><code>X</code></TD>
-            <TD VAlign="top">A type that is a model of Single Pass Range.</TD>
-        </TR>
-        <TR>
-            <TD VAlign="top"><code>a</code></TD>
-            <TD VAlign="top">Object of type <code>X</code>.</TD>
-        </TR>
-    </table>
-
-
-    <h3>Description</h3>
-    <p>
-    A range X where <code>boost::range_iterator&lt;X>::type</code> is a model of <a
-href="../../iterator/doc/new-iter-concepts.html#single-pass-iterators-lib-single-pass-iterators">
-Single Pass Iterator</a>
-
-    </p>
-
-
-    <h3>Associated types</h3>
-
-    <table border="1" cellpadding="5">
-
-        <TR>
-            <TD VAlign="top">Iterator type</TD>
-            <TD VAlign="top"><code>boost::range_iterator&lt;X>::type</code></TD>
-            <TD VAlign="top">The type of iterator used to iterate through a Range's elements.
-            The iterator's value type is expected to be the Range's value type.  A
-            conversion from the iterator type to the const iterator type must exist.
-        </TR>
-        <TR>
-            <TD VAlign="top">Const iterator type</TD>
-            <TD VAlign="top"><code>boost::range_iterator&lt;const X>::type</code></TD>
-            <TD VAlign="top">A type of iterator that may be used to examine, but not to
-            modify, a Range's elements.</TD>
-        </TR>
-        <!--
-        <TR>
-            <TD VAlign="top">Reference type</TD>
-            <TD VAlign="top"><code>reference_of&lt;X>::type</code></TD>
-            <TD VAlign="top">A type that behaves like a reference to the Range's value type. <a href="#1">[1]</a></TD>
-        </TR>
-            -->
-    </table>
-
-
-    <h3>Valid expressions</h3>
-
-    The following expressions must be valid.
-    <p>
-
-    <Table border="1" cellpadding="5">
-        <TR>
-            <TH>Name</TH>
-            <TH>Expression</TH>
-            <TH>Return type</TH>
-        </TR>
-        <TR>
-            <TD VAlign="top">Beginning of range</TD>
-            <TD VAlign="top"><code>boost::begin(a)</code></TD>
-            <TD VAlign="top"><code>boost::range_iterator&lt;X>::type</code> if
-<code>a</code> is mutable, <code>boost::range_iterator&lt;const X>::type</code>
-otherwise</TD> </TR>
-        <TR>
-            <TD VAlign="top">End of range</TD>
-            <TD VAlign="top"><code>boost::end(a)</code></TD>
-            <TD VAlign="top"><code>boost::range_iterator&lt;X>::type</code> if
-<code>a</code> is mutable, <code>boost::range_iterator&lt;const X>::type</code>
-otherwise</TD>
-        </TR>
-
-    </table>
-    <h3>Expression semantics</h3>
-
-    <Table border>
-        <TR>
-            <TH>Expression</TH>
-            <TH>Semantics</TH>
-            <TH>Postcondition</TH>
-        </TR>
-        <TR>
-            <TD VAlign="top"><code>boost::begin(a)</code></TD>
-            <TD VAlign="top">Returns an iterator pointing to the first element in the Range.</TD>
-            <TD VAlign="top"><code>boost::begin(a)</code> is either dereferenceable or past-the-end. 
-            It is past-the-end if and only if <code>boost::distance(a) == 0</code>.</TD>
-        </TR>
-        <TR>
-            <TD VAlign="top"><code>boost::end(a)</code></TD>
-            <TD VAlign="top">Returns an iterator pointing one past the last element in the 
-            Range.</TD>
-            <TD VAlign="top"><code>boost::end(a)</code> is past-the-end.</TD>
-        </TR>
- 
-    </table>
-
-    <h3>Complexity guarantees</h3>
-
-    <code>boost::end(a)</code> is at most amortized linear time, <code>boost::begin(a)</code> is
-                                         amortized constant time. For most practical 
-        purposes, one can expect both to be amortized constant time.
-
-    <h3>Invariants</h3>
-    <Table border>
-        <TR>
-            <TD VAlign="top">Valid range</TD>
-            <TD VAlign="top">For any Range <code>a</code>, <code>[boost::begin(a),boost::end(a))</code> is 
-            a valid range, that is, <code>boost::end(a)</code> is reachable from <code>boost::begin(a)</code> 
-            in a finite number of increments.</TD>
-        </TR>
-        <TR>
-            <TD VAlign="top">Completeness</TD>
-            <TD VAlign="top">An algorithm that iterates through the range <code>[boost::begin(a),boost::end(a))</code> 
-            will pass through every element of <code>a</code>.</TD>
-        </tr>
-    </table>
-
-
-    <h3>See also</h3> 
-                                                                     <p><a 
-                                                                     href="boost_range.html#minimal_interface">Extending the library for UDTs </a></p>
-            <p> <a href="boost_range.html#boost::rang_difference">Implementation of
-                   metafunctions </a></p>
-
-            <p> <a href="boost_range.html#begin">Implementation of 
-                   functions </a></p>
-                        <p>
-            <A href="http://www.sgi.com/Technology/STL/Container.html">Container</A>
-            </p>
-       
-
-    <hr>
-    <a name=forward_range></a><h2>Forward Range</h2>
-
-    <h3>Notation</h3>
-    <Table>
-        <TR>
-            <TD VAlign="top"><code>X</code></TD>
-            <TD VAlign="top">A type that is a model of Forward Range.</TD>
-        </TR>
-        <TR>
-            <TD VAlign="top"><code>a</code></TD>
-            <TD VAlign="top">Object of type <code>X</code>.</TD>
-        </TR>
-    </table>
-
-    <h3>Description</h3>
-    <p>
-    A range <code>X</code> where <code>boost::range_iterator&lt;X>::type</code> is a model
-of <a 
-href="../../iterator/doc/new-iter-concepts.html#forward-traversal-iterators-lib-forward-traversal-iterators">Forward Traversal Iterator</a>
-    </p>
-
-    <h3>Refinement of</h3> <a href="#single_pass_range">Single Pass 
-Range</a>
-            
-  </p>
-  
-    <hr>
-
-    <a name="bidirectional_range"></a><h2>Bidirectional Range</h2>
-
-    <h3>Notation</h3>
-    <Table>
-        <TR>
-            <TD VAlign="top"><code>X</code></TD>
-            <TD VAlign="top">A type that is a model of Bidirectional Range.</TD>
-        </TR>
-        <TR>
-            <TD VAlign="top"><code>a</code></TD>
-            <TD VAlign="top">Object of type <code>X</code>.</TD>
-        </TR>
-    </table>
-
-    <h3>Description</h3> This concept provides access to iterators that traverse in 
-    both directions (forward and reverse). The 
-<code>boost::range_iterator&lt;X>::type</code> iterator must meet all of the requirements
-of <a
-href="../../iterator/doc/new-iter-concepts.html#bidirectional-traversal-iterator
-s-lib-bidirectional-traversal-iterators">Bidirectional Traversal Iterator.</a>
-      
-    <h3>Refinement of</h3> <a href="#forward_range">Forward Range</a>
-
-  
-</p>
-
-    <hr>
-
-    <a name=random_access_range></a><h2>Random Access Range</h2> 
-    <h3>Description</h3>
-    <p>
-    A range <code>X</code> where <code>boost::range_iterator&lt;X>::type</code> is a model
-of <a
-      
-href="../../iterator/doc/new-iter-concepts.html#random-access-traversal-iterators
--lib-random-access-traversal-iterators">Random Access Traversal Iterator</a>
-    </p>
-
-    <h3>Refinement of</h3>
-    <p>
-    <a href="#bidirectional_range">Bidirectional Range</a>
-    </p>
-
-    <hr>
-
-    <a name=concept_checking></a><h2>Concept Checking</h2>
-
-    Each of the range concepts has a corresponding concept checking
-    class in the file <code>&lt;boost/range/concepts.hpp&gt;</code>. These classes may be
-    used in conjunction with the <a
-    href="../../concept_check/concept_check.htm">Boost Concept
-    Check</a> library to insure that the type of a template parameter
-    is compatible with a range concept. If not, a meaningful compile
-    time error is generated. Checks are provided for the range
-    concepts related to iterator traversal categories. For example,
-    the following line checks that the type <code>T</code> models the
-    <a href="#forward_range">ForwardRange</a> concept.
-
-    <pre>
-    function_requires&lt;ForwardRangeConcept&lt;T&gt; &gt;();
-    </pre>
-
-    An additional concept check is required for the value access
-    property of the range based on the range's iterator type. For
-    example to check for a ForwardReadableRange, the following code is
-    required.
-
-    <pre>
-    function_requires&lt;ForwardRangeConcept&lt;T&gt; &gt;();
-    function_requires&lt;
-        ReadableIteratorConcept&lt;
-            typename range_iterator&lt;T&gt;::type
-        &gt;
-    &gt;();
-    </pre>
-
-    The following range concept checking classes are provided.
-    <ul>
-        <li>
-            Class <code>SinglePassRangeConcept</code> checks for <a
-            href="#single_pass_range">Single Pass Range</a>
-        <li>
-            Class <code>ForwardRangeConcept</code> checks for <a
-            href="#forward_range">Forward Range</a>
-        <li>
-            Class <code>BidirectionalRangeConcept</code> checks for <a
-            href="#bidirectional_range">Bidirectional Range</a>
-        <li>
-            Class <code>RandomAccessRangeConcept</code> checks for <a
-            href="#random_access_range">Random Access Range</a>
-    </ul>
-
-    <h3>See also</h3> 
-    <p> <a href="style.html">Range Terminology and style guidelines</a></p>
-    <p> <a href="../../iterator/doc/iterator_concepts.html">Iterator Concepts</a></p>
-    <p> <a href="../../concept_check/concept_check.htm">Boost Concept Check library</a></p>
-
-    <hr>
-    <p>
-      &copy; <a name="Copyright" id="Copyright">Copyright</a> Thorsten Ottosen 2008.
-    </p>
-
-    <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">www.boost.org/LICENSE_1_0.txt</a>)
-    </p>
-    <br>
-    <br>
-    <br>
-    <br>
-    <br>
-    <br>
-    <br>
-    <br>
-    <br>
-    <br>
-    
-    </BODY>
-</HTML>
diff --git a/doc/style.html b/doc/style.html
deleted file mode 100644
index 4240a8c..0000000
--- a/doc/style.html
+++ /dev/null
@@ -1,132 +0,0 @@
-<!DOCTYPE HTML PUBLIC "-//W3C//DTD HTML 3.2//EN">
-
-<html>
-<head>
-    <meta http-equiv="Content-Type" content="text/html; charset=ISO-8859-1">
-    <title>Boost.Range Terminology and Style Guidelines </title>
-    <link rel="stylesheet" href="style.css" type="text/css">
-</head>
-
-    <body>
-
-    <table border="0" >
-        <tr>
-            <td ><img src="../../../boost.png" border="0" ></td>
-            <td ><h1 align="center">Boost.Range </h1></td>
-        </tr>
-    </table>
-
-    <h2>Terminology and style guidelines </h2>
-
-    <p>
-    The use of a consistent terminology is as important for <a href="range.html">Range</a>s 
-    and range-based algorithms as it is for iterators and iterator-based algorithms. 
-    If a conventional set of names are adopted, we can avoid misunderstandings and 
-    write generic function prototypes that are <i>self-documenting</i>.
-    </p>
-
-    <p>
-    Since ranges are characterized by a specific underlying iterator type, we get a 
-    type of range for each type of iterator. Hence we can speak of the following 
-    types of ranges:
-    <ul>
-        <li>
-            <i>Value access</i> category:
-            <ul>
-                <li>
-                    Readable Range
-                <li>
-                    Writeable Range
-                <li>
-                    Swappable Range
-                <li>
-                    Lvalue Range
-            </ul>
-        <li>
-            <i>Traversal</i> category:
-            <ul>
-                <li>
-                    <a href="range.html#single_pass_range">Single Pass Range</a>
-                <li>
-                    <a href="range.html#forward_range">Forward Range</a>
-                <li>
-                    <a href="range.html#bidirectional_range">Bidirectional Range</a> <li>
-                    <a href="range.html#random_access_range">Random Access Range</a> </ul>
-    </ul>
-    Notice how we have used the categories from the <a href="../../iterator/doc/new-iter-concepts.html">new 
-    style iterators</a>.
-
-    <p>
-    Notice that an iterator (and therefore an range) has one <i>traversal</i> 
-    property and one or more properties from the <i>value access</i> category. So in 
-    reality we will mostly talk about mixtures such as
-    <ul>
-        <li>
-            Random Access Readable Writeable Range
-        <li>
-            Forward Lvalue Range
-    </ul>
-    By convention, we should always specify the <i>traversal</i> property first as 
-    done above. This seems reasonable since there will only be one <i>traversal</i> 
-    property, but perhaps many <i>value access</i> properties.
-    </p>
-
-    <p>
-    It might, however, be reasonable to specify only one category if the other 
-    category does not matter. For example, the <a
-   href="utility_class.html#iter_range">iterator_range</a> can be constructed from 
-   a Forward Range. This means that we do not care about what <i>value access</i> 
-   properties the Range has. Similarly, a Readable Range will be one that has the 
-   lowest possible <i>traversal</i> property (Single Pass).
-    </p>
-
-    <p>
-    As another example, consider how we specify the interface of <code>std::sort()</code>. 
-    Algorithms are usually more cumbersome to specify the interface of since both <i>traversal</i> 
-    and <i>value access</i> properties must be exactly defined. The iterator-based 
-        version looks like this:
-
-    <pre>
-   <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><span class=identifier>RandomAccessTraversalReadableWritableIterator </span><span class=identifier>last </span><span class=special>);</span>
-   </pre>
-    For ranges the interface becomes
-
-    <pre>
-   <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>
-   </pre>
-    </p>
-    <p>
-
-    </p>
-
-    <hr>
-    <p>
-      &copy; <a name="Copyright" id="Copyright">Copyright</a> Thorsten Ottosen 2008.
-    </p>
-
-    <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">www.boost.org/LICENSE_1_0.txt</a>)
-    </p>
-    <br>
-    <br>
-    <br>
-    <br>
-    <br>
-    <br>
-    <br>
-    <br>
-    <br>
-    <br>
-    <br>
-    <br>
-
-
-    </body>
-</html>
-
diff --git a/doc/upgrading.html b/doc/upgrading.html
deleted file mode 100644
index f94e73b..0000000
--- a/doc/upgrading.html
+++ /dev/null
@@ -1,78 +0,0 @@
-<!DOCTYPE HTML PUBLIC "-//W3C//DTD HTML 3.2//EN">
-
-<html>
-<head>
-    <meta http-equiv="Content-Type" content="text/html; charset=ISO-8859-1">
-    <title>Boost.Range Upgrading </title> <link rel="stylesheet" 
-    href="style.css" type="text/css">
-</head>
-
-    <body>
-
-    <table border="0" >
-        <tr>
-            <td ><img src="../../../boost.png" border="0" ></td>
-            <td ><h1 align="center">Boost.Range </h1></td>
-        </tr>
-    </table>
-
-    <h2  >Upgrading from Boost v. 1.34.*</h2><a name="v1.34" ></a>
-    <p  >
-    Boost v. 1.35 introduced some larger refactorings of the library:
-    </p>
-    <ul  >
-        <li>Direct support for character arrays was abandoned in favor of 
-            uniform treatment of all arrays. Instead string algorithms can use
-            the new function <a
-            href="boost_range.html#as_literal">as_literal()</a>.</li>
-        <li><a 
-            href="boost_range.html#size">boost::size()</a> now requires a Random Access Range. The old behavior is provided as <a 
-            href="boost_range.html#distance">boost::distance()</a> </li>   
-        <li> <code>range_size&lt;T&gt;::type</code> has been completely removed 
-            in favor of <code>range_difference&lt;T&gt;::type</code>
-            <li>
-                <code>boost_range_begin()</code> and <code>boost_range_end()</code>
-                    have been renamed <code>range_begin()</code> and <code>range_begin()</code>, respectively.</li>
-
-
-            <li><code>range_result_iterator&lt;T&gt;::type</code> and
-            <code>range_reverse_result_iterator&lt;T&gt;::type</code> are have
-            been renamed 
-            <code>range_iterator&lt;T&gt;::type</code>    and 
-                <code>range_reverse_iterator&lt;T&gt;::type</code>. 
-            </li>     
-        <li>The procedure that makes a custom type work with the library 
-            has been greatly simplified. See <a 
-            href="boost_range.html#minimal_interface">extending the library </a> 
-            for details.</li>
-    </ul>
-
-
-    <hr>
-    <p>
-      &copy; <a name="Copyright" id="Copyright">Copyright</a> Thorsten Ottosen 2008.
-    </p>
-
-    <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">www.boost.org/LICENSE_1_0.txt</a>)
-    </p>
-
-    <br>
-    <br>
-    <br>
-    <br>
-    <br>
-    <br>
-    <br>
-    <br>
-    <br>
-    <br>
-    <br>
-    <br>
-
-
-    </body>
-</html>
-
diff --git a/doc/utility_class.html b/doc/utility_class.html
deleted file mode 100644
index 956bf99..0000000
--- a/doc/utility_class.html
+++ /dev/null
@@ -1,380 +0,0 @@
-<!DOCTYPE HTML PUBLIC "-//W3C//DTD HTML 3.2//EN">
-
-<html>
-<head>
-    <meta http-equiv="Content-Type" content="text/html; charset=ISO-8859-1">
-    <title>Boost.Range Utilities </title>
-    <link rel="stylesheet" href="style.css" type="text/css">
-</head>
-
-    <body>
-    <table border="0" >
-        <tr>
-            <td ><img src="../../../boost.png" border="0" ></td>
-            <td ><h1 align="center">Boost.Range</h1></td>
-        </tr>
-    </table>
-
-    <h2>Utilities</h2>
-    <p>
-    Having an abstraction that encapsulates a pair of iterators is very useful. The 
-    standard library uses <code>std::pair</code> in some circumstances, but that 
-    class is cumbersome to use because we need to specify two template arguments, 
-    and for all range algorithm purposes we must enforce the two template arguments 
-    to be the same. Moreover, <code>std::pair&lt;iterator,iterator></code> is hardly 
-    self-documenting whereas more domain specific class names are. Therefore these 
-    two classes are provided:
-
-    <ul>
-        <li>
-            Class <a href="#iter_range"><code>iterator_range</code></a>
-        <li>
-            Class <a href="#sub_range"><code>sub_range</code></a>
-    </ul>
-
-    The <code>iterator_range</code> class is templated on a <a
-    href="../../iterator/doc/new-iter-concepts.html#forward-traversal-iterators-lib-forward-traversal-iterators">Forward 
-    Traversal Iterator</a> and should be used whenever fairly general code is needed. 
-    The <code>sub_range</code> class is templated on a <a 
-    href="range.html#forward_range">Forward Range</a> and it is less general, 
-    but a bit easier to use since its template 
-    argument is easier to specify. The biggest difference is, however, that a 
-    <code>sub_range</code> can propagate constness because it knows what a 
-corresponding <code>const_iterator</code> is. </p>
-    
-    <p>
-    Both classes can be used as ranges since they implement the <a 
-    href="boost_range.html#minimal_interface">minimal interface</a>
-    required for this to work automatically.
-    </p>
-
-    <hr>
-    <a name=iter_range></a> <h1>Class <code>iterator_range</code></h1>
-    <p>
-    The intention of the <code>iterator_range</code> class is to encapsulate two 
-    iterators so they fulfill the <a
-      href="range.html#forward_range">Forward Range</a> concept. A few other 
-    functions are also provided for convenience.
-    </p>
-    <p>
-    If the template argument is not a model of Forward Traversal Iterator, one can 
-    still use a subset of the interface. In particular, <code>size()</code> requires 
-    Random Access Iterators whereas <code>empty()</code> only requires Single 
-    Pass Iterators.
-    </p>
-
-    <p>
-    Recall that many default constructed iterators 
-    are <i>singular</i> and hence can only be assigned, but not compared or 
-    incremented or anything. Likewise, if one creates a default constructed 
-    <code>iterator_range</code>, then one have to be careful about not doing
-    anything besides copying.    </p>
-    
-    <h3>Synopsis</h3>
-
-    <pre>
-<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>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=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=identifier>iterator        </span><span class=identifier>end</span><span class=special>() </span><span class=keyword>const</span><span class=special>;
-        </span><span class=identifier>difference_type </span><span class=identifier>size</span><span class=special>() </span><span class=keyword>const</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=keyword>public</span><span class=special>: </span><span class=comment>// convenience
-        </span><span class=keyword>operator        </span><a href="#unspecified_bool"><span class=identifier>unspecified_bool_type</span></a><span class=special>() </span><span class=keyword>const</span><span class=special>;
-    </span>    <span class=keyword>bool</span>            <span 
-class=identifier><a href="#equal">equal</a></span><span
-class=special>( </span><span class=keyword>const</span> <span class=identifier>iterator_range</span><span class=special>&amp; ) </span><span 
-class=keyword>const;</span>
-        <span class=identifier>reference       </span><span class=identifier>front</span><span class=special>() </span><span class=keyword>const</span><span class=special>;</span>
-        <span class=identifier>reference       </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=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=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=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>// <a href="#comparison">comparison</a>
-    </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>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>==( </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=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>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>!=( </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=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>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>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=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>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><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><a href="#make_iterator_range">make_iterator_range</a></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=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=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><a href="#copy_range"><span 
-class=identifier>copy_range</span></a><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>
-
-<p>
- If an instance of
-<code>iterator_range</code> is constructed by a client with two iterators, the
-client must ensure that the two iterators delimit a valid closed-open range
-<code>[begin,end)</code>.
- </p>
-
-<p>
-It is worth noticing that the templated constructors and assignment operators
-allow conversion from <code>iterator_range&lt;iterator></code> to
-<code>iterator_range&lt;const_iterator></code>. Similarly, since the comparison
-operators have two template arguments, we can compare ranges whenever the 
-iterators are comparable; for example when we are dealing with const and 
-non-const iterators from the same container. </p>
- 
- <h3>Details member functions</h3>
- 
-<p> 
-<a name="unspecified_bool"></a> 
-<code>operator  unspecified_bool_type() const; </code>
- <blockquote>
-<i>Returns</i> <code>!empty();</code>
- </blockquote>
-</p>
-     
-<p>
-<a name="equal"></a>      
-<code>bool equal( iterator_range&amp; r ) const;</code>
-<blockquote>
-    <i>Returns</i> <code>begin() == r.begin() &amp;&amp; end() == r.end();</code>
-</blockquote>
-</p>      
-
- <h3>Details functions</h3>
-
-<p> 
-<a name="comparison"></a>
-<code>bool operator==( const ForwardRange1&amp; l, const ForwardRange2&amp; r );</code>
-<blockquote>
-    <i>Returns</i> <code>size(l) != size(r) ? false : std::equal( begin(l), end(l), begin(r) );</code> </blockquote> </p>
-<code>bool operator!=( const ForwardRange1&amp; l, const ForwardRange2&amp; r );</code>
-<blockquote>
-    <i>Returns</i> <code>!( l == r );</code>
-</blockquote>
-<code>bool operator<( const ForwardRange1&amp; l, const ForwardRange2&amp; r );</code>
-<blockquote>
-    <i>Returns</i> <code>std::lexicographical_compare( begin(l), end(l), begin(r), end(r) );</code> </blockquote>
-    
-<p>    
-<a name="make_iterator_range"></a>
-<pre>
-iterator_range make_iterator_range( Range&amp; r, 
-                                    typename range_difference&lt;Range>::type advance_begin, 
-                                    typename range_difference&lt;Range>::type advance_end );
-</pre>
-<blockquote>
-    <i>Effects</i>:
-<pre>
-iterator new_begin = begin( r ),
-iterator new_end   = end( r );
-std::advance( new_begin, advance_begin );
-std::advance( new_end, advance_end );
-return make_iterator_range( new_begin, new_end );
-</pre>
-</blockquote>
-<p> 
-<a name="copy_range"></a> 
-<code>Sequence copy_range( const ForwardRange&amp; r );</code>
-<blockquote>
-    <i>Returns</i> <code>Sequence( begin(r), end(r) );</code>
-</blockquote>
-</p>
-
-<hr> <a name=sub_range></a>
-<h1>Class <code>sub_range</code></h1>
-
-The <code>sub_range</code> class inherits all its functionality
-from the <a href="#iter_range"><code>iterator_range</code></a> class.
-The <code>sub_range</code> class is often easier to use because
-one must specify the <a href="range.html#forward_range">Forward Range</a>
-template argument instead of an iterator. Moreover, the <code>sub_range</code>
-class can propagate constness since it knows what a corresponding 
-<code>const_iterator</code> is.
-
-<h3>Synopsis</h3>
-
-<pre>
-<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>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=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>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=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>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=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>difference_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>difference_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 <a href="#iter_range"><code>iterator_range</code></a>
-    </span><span class=special>};
-    </span>
-<span class=special>} </span><span class=comment>// namespace 'boost'</span>
-</pre>
-    
-    <p>
-    The class should be trivial to use as seen below.
-   Imagine that we have an algorithm that searches for a sub-string in a string.
-    The
-    result is an <code>iterator_range</code>, that delimits the match. We need to
-store the result
-    from this algorithm. Here is an example of how we can do it with and without
-<code>sub_range</code>
-    <pre>
-    <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>&quot;hello&quot;</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=identifier>as_literal</span><span class=special>(</span><span class=string>&quot;ll&quot;</span><span class=special>)</span> <span class=special>);</span>
-    <span class=identifier>sub_range</span><span class=special>&lt;</span><span class=identifier>std</span><span class=special>::</span><span class=identifier>string</span><span class=special>&gt;</span>               <span class=identifier>sub</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=identifier>as_literal</span><span class=special>(</span><span class=string>&quot;ll&quot;</span><span class=special>)</span> <span class=special>);</span>
-</pre>
- </p>
-
-    <hr>
-    <p>
-      &copy; <a name="Copyright" id="Copyright">Copyright</a> Thorsten Ottosen 2008.
-    </p>
-
-    <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">www.boost.org/LICENSE_1_0.txt</a>)
-    </p>
-
-  <br>
-  <br>
-  <br>
-  <br>
-  <br>
-  <br>
-  <br>
-  <br>
-  <br>
-  <br>
-  <br>
-  <br>
-  
-    
-    </body>
-</html>
-

From dfc30e334dfa96bb21ddbaf10087afda586e6dc6 Mon Sep 17 00:00:00 2001
From: Neil Groves <neil@grovescomputing.com>
Date: Wed, 14 Apr 2010 21:15:41 +0000
Subject: [PATCH 33/73] Boost.Range merged defect fix for iterator_range.

[SVN r61280]
---
 include/boost/range/iterator_range_core.hpp | 12 ------------
 1 file changed, 12 deletions(-)

diff --git a/include/boost/range/iterator_range_core.hpp b/include/boost/range/iterator_range_core.hpp
index c1822fb..497b1e3 100755
--- a/include/boost/range/iterator_range_core.hpp
+++ b/include/boost/range/iterator_range_core.hpp
@@ -290,23 +290,11 @@ namespace boost
                return *--last;
            }
 
-
-#ifdef __SUNPRO_CC
            reference operator[]( difference_type at ) const
            {
                BOOST_ASSERT( at >= 0 && at < size() );
                return m_Begin[at];
            }
-#else
-           BOOST_DEDUCED_TYPENAME boost::detail::operator_brackets_result<iterator, value_type, reference>::type
-           operator[]( difference_type at ) const
-           {
-               BOOST_ASSERT( at >= 0 && at < size() );
-
-               typedef boost::detail::use_operator_brackets_proxy<value_type,reference> use_proxy;
-               return boost::detail::make_operator_brackets_result<iterator>(m_Begin + at, use_proxy());
-           }
-#endif
 
            //
            // When storing transform iterators, operator[]()

From a47f15a98fe609d701c4d034cf116cb03612d202 Mon Sep 17 00:00:00 2001
From: Neil Groves <neil@grovescomputing.com>
Date: Fri, 23 Apr 2010 22:50:56 +0000
Subject: [PATCH 34/73] Boost.Range merge from trunk to release. This is
 motivated by the need to correct the istream_range, to correct the
 adaptors.hpp header file, and correct the return types of various range
 algorithms.

[SVN r61517]
---
 doc/counting_range.html                       |  70 -----
 doc/headers.qbk                               |   2 +-
 doc/html/index.html                           |   6 +-
 doc/html/quickbook_HTML.manifest              |   2 +
 doc/html/range/concepts.html                  |   2 +-
 .../range/concepts/bidirectional_range.html   |  18 +-
 doc/html/range/concepts/concept_checking.html |   4 +-
 doc/html/range/concepts/forward_range.html    |  12 +-
 doc/html/range/concepts/overview.html         |   2 +-
 .../range/concepts/random_access_range.html   |  14 +-
 .../range/concepts/single_pass_range.html     |  18 +-
 doc/html/range/examples.html                  |   2 +-
 doc/html/range/faq.html                       |   2 +-
 doc/html/range/history_ack.html               |   2 +-
 doc/html/range/introduction.html              |   2 +-
 doc/html/range/library_headers.html           |   6 +-
 doc/html/range/mfc_atl.html                   |   6 +-
 doc/html/range/mfc_atl/atl_ranges.html        |   2 +-
 doc/html/range/mfc_atl/const_ranges.html      |   2 +-
 doc/html/range/mfc_atl/mfc_ranges.html        |   2 +-
 doc/html/range/mfc_atl/references.html        |   2 +-
 doc/html/range/mfc_atl/requirements.html      |   2 +-
 doc/html/range/portability.html               |   2 +-
 doc/html/range/reference.html                 |   2 +-
 doc/html/range/reference/adaptors.html        |   2 +-
 .../adaptors_general_requirements.html        |   2 +-
 .../adaptors/adaptors_introduction.html       |   8 +-
 .../adaptors/adaptors_reference.html          |   2 +-
 .../adaptors_reference/adjacent_filtered.html |   2 +-
 .../adaptors/adaptors_reference/copied.html   |   2 +-
 .../adaptors/adaptors_reference/filtered.html |   2 +-
 .../adaptors/adaptors_reference/indexed.html  |   2 +-
 .../adaptors_reference/indirected.html        |   2 +-
 .../adaptors/adaptors_reference/map_keys.html |   2 +-
 .../adaptors_reference/map_values.html        |   2 +-
 .../adaptors/adaptors_reference/replaced.html |   2 +-
 .../adaptors_reference/replaced_if.html       |   2 +-
 .../adaptors/adaptors_reference/reversed.html |   2 +-
 .../adaptors/adaptors_reference/sliced.html   |   2 +-
 .../adaptors/adaptors_reference/strided.html  |   2 +-
 .../adaptors_reference/tokenized.html         |   2 +-
 .../adaptors_reference/transformed.html       |   2 +-
 .../adaptors/adaptors_reference/uniqued.html  |   2 +-
 .../reference/adaptors/adaptors_synopsis.html |   2 +-
 doc/html/range/reference/algorithms.html      |   2 +-
 .../reference/algorithms/heap_algorithms.html |   4 +-
 .../algorithms/heap_algorithms/make_heap.html |  26 +-
 .../algorithms/heap_algorithms/pop_heap.html  |  22 +-
 .../algorithms/heap_algorithms/push_heap.html |  22 +-
 .../algorithms/heap_algorithms/sort_heap.html | 153 ++++++++++
 .../algorithms/permutation_algorithms.html    |   8 +-
 .../next_permutation.html                     |  20 +-
 .../prev_permutation.html                     |  20 +-
 .../range_algorithm_introduction.html         |   2 +-
 .../range_algorithm_mutating_algorithms.html  |   4 +-
 .../copy.html                                 |  14 +-
 .../copy_backward.html                        |  14 +-
 .../fill.html                                 |  23 +-
 .../fill_n.html                               | 102 +++++++
 .../generate.html                             |  20 +-
 .../inplace_merge.html                        |  18 +-
 .../merge.html                                |  18 +-
 .../nth_element.html                          |  42 +--
 .../partial_sort.html                         |  42 +--
 .../partition.html                            |  12 +-
 .../random_shuffle.html                       |  14 +-
 .../remove.html                               |  12 +-
 .../remove_if.html                            |  12 +-
 .../replace.html                              |  12 +-
 .../replace_if.html                           |  12 +-
 .../rotate.html                               |  14 +-
 .../sort.html                                 |  12 +-
 .../stable_partition.html                     |  12 +-
 .../stable_sort.html                          |  12 +-
 .../transform.html                            |  14 +-
 .../unique.html                               |  12 +-
 .../range_algorithm_new_algorithms.html       |   2 +-
 .../range_algorithm_new_algorithms/erase.html |  30 +-
 .../for_each.html                             |  12 +-
 .../insert.html                               |  18 +-
 .../range_algorithm_new_algorithms/iota.html  |  22 +-
 .../overwrite.html                            |  12 +-
 .../push_back.html                            |  16 +-
 .../push_front.html                           |  16 +-
 .../remove_erase.html                         |  23 +-
 .../remove_erase_if.html                      |  21 +-
 ...nge_algorithm_non_mutating_algorithms.html |   2 +-
 .../adjacent_find.html                        |  12 +-
 .../binary_search.html                        |  14 +-
 .../count.html                                |  12 +-
 .../equal.html                                |  12 +-
 .../equal_range.html                          |  14 +-
 .../find.html                                 |  12 +-
 .../find_end.html                             |  12 +-
 .../find_first_of.html                        |  12 +-
 .../find_if.html                              |  14 +-
 .../for_each.html                             |  12 +-
 .../lexicographical_compare.html              |  12 +-
 .../lower_bound.html                          |  14 +-
 .../max_element.html                          |  12 +-
 .../min_element.html                          |  12 +-
 .../mismatch.html                             |  14 +-
 .../search.html                               |  12 +-
 .../upper_bound.html                          |  14 +-
 .../reference/algorithms/range_numeric.html   |   2 +-
 .../algorithms/range_numeric/accumulate.html  |  16 +-
 .../range_numeric/adjacent_difference.html    |  18 +-
 .../range_numeric/inner_product.html          |  18 +-
 .../algorithms/range_numeric/partial_sum.html |  18 +-
 .../reference/algorithms/set_algorithms.html  |   2 +-
 .../algorithms/set_algorithms/includes.html   |  14 +-
 .../set_algorithms/set_difference.html        |  14 +-
 .../set_algorithms/set_intersection.html      |  14 +-
 .../set_symmetric_difference.html             |  14 +-
 .../algorithms/set_algorithms/set_union.html  |  14 +-
 doc/html/range/reference/extending.html       |   2 +-
 .../range/reference/extending/method_1.html   |   2 +-
 .../range/reference/extending/method_2.html   |   2 +-
 .../range/reference/extending/method_3.html   |   2 +-
 .../extending/method_3/method_3_1.html        |   2 +-
 .../extending/method_3/method_3_2.html        |   2 +-
 doc/html/range/reference/overview.html        |   2 +-
 doc/html/range/reference/ranges.html          |   2 +-
 .../reference/ranges/counting_range.html      |  10 +-
 doc/html/range/reference/ranges/irange.html   |  12 +-
 .../range/reference/ranges/istream_range.html |   8 +-
 doc/html/range/reference/semantics.html       |   4 +-
 .../range/reference/semantics/functions.html  |   2 +-
 .../reference/semantics/metafunctions.html    |   2 +-
 doc/html/range/reference/synopsis.html        |   2 +-
 doc/html/range/style_guide.html               |   2 +-
 doc/html/range/upgrade.html                   |   2 +-
 doc/html/range/upgrade/upgrade_from_1_34.html |   2 +-
 doc/html/range/upgrade/upgrade_from_1_42.html |   2 +-
 doc/html/range/utilities.html                 |   2 +-
 doc/html/range/utilities/iterator_range.html  |   8 +-
 doc/html/range/utilities/join.html            |   6 +-
 doc/html/range/utilities/sub_range.html       |   4 +-
 doc/reference/algorithm/fill.qbk              |   5 +-
 doc/reference/algorithm/fill_n.qbk            |  31 ++
 doc/reference/algorithm/make_heap.qbk         |  10 +-
 doc/reference/algorithm/next_permutation.qbk  |  10 +-
 doc/reference/algorithm/nth_element.qbk       |  30 +-
 doc/reference/algorithm/partial_sort.qbk      |  30 +-
 doc/reference/algorithm/pop_heap.qbk          |  10 +-
 doc/reference/algorithm/prev_permutation.qbk  |  10 +-
 doc/reference/algorithm/push_heap.qbk         |  10 +-
 doc/reference/algorithm/sort_heap.qbk         |  10 +-
 doc/reference/algorithm_ext/erase.qbk         |  14 +-
 doc/reference/algorithm_ext/insert.qbk        |   6 +-
 doc/reference/algorithm_ext/iota.qbk          |   6 +-
 doc/reference/algorithm_ext/push_back.qbk     |   4 +-
 doc/reference/algorithm_ext/push_front.qbk    |   4 +-
 doc/reference/algorithm_ext/remove_erase.qbk  |  11 +-
 .../algorithm_ext/remove_erase_if.qbk         |   9 +-
 doc/reference/algorithms.qbk                  |   2 +
 .../boost/range/adaptor/adjacent_filtered.hpp | 288 +++++++++---------
 include/boost/range/adaptor/argument_fwd.hpp  |  92 +++---
 include/boost/range/adaptor/copied.hpp        |  52 ++--
 include/boost/range/adaptor/filtered.hpp      | 134 ++++----
 include/boost/range/adaptor/indexed.hpp       | 128 ++++----
 include/boost/range/adaptor/indirected.hpp    |  96 +++---
 include/boost/range/adaptor/map.hpp           | 284 ++++++++---------
 include/boost/range/adaptor/replaced.hpp      | 160 +++++-----
 include/boost/range/adaptor/replaced_if.hpp   | 184 +++++------
 include/boost/range/adaptor/reversed.hpp      | 132 ++++----
 include/boost/range/adaptor/strided.hpp       | 226 +++++++-------
 include/boost/range/adaptor/tokenized.hpp     | 214 ++++++-------
 include/boost/range/adaptor/transformed.hpp   | 152 ++++-----
 include/boost/range/adaptor/uniqued.hpp       | 126 ++++----
 include/boost/range/adaptors.hpp              |   3 +-
 include/boost/range/algorithm/equal.hpp       |   2 +-
 include/boost/range/algorithm/generate.hpp    |   9 -
 .../boost/range/algorithm/heap_algorithm.hpp  |  88 +-----
 include/boost/range/algorithm/nth_element.hpp |  16 +-
 .../boost/range/algorithm/partial_sort.hpp    |  25 +-
 .../range/algorithm/partial_sort_copy.hpp     |  16 +-
 include/boost/range/algorithm/partition.hpp   |  20 --
 .../boost/range/algorithm/random_shuffle.hpp  |  18 --
 include/boost/range/algorithm/remove.hpp      |  20 --
 .../boost/range/algorithm/remove_copy_if.hpp  |   2 +-
 include/boost/range/algorithm/remove_if.hpp   |  20 --
 include/boost/range/algorithm/replace.hpp     |  11 -
 include/boost/range/algorithm/replace_if.hpp  |  11 -
 include/boost/range/algorithm/reverse.hpp     |   9 -
 .../boost/range/algorithm/reverse_copy.hpp    |  10 +-
 include/boost/range/algorithm/rotate.hpp      |  15 +-
 include/boost/range/algorithm/rotate_copy.hpp |   6 +-
 include/boost/range/algorithm/search.hpp      |  14 +-
 include/boost/range/algorithm/search_n.hpp    |  50 +--
 include/boost/range/algorithm/sort.hpp        |  18 --
 include/boost/range/algorithm/stable_sort.hpp |  18 --
 include/boost/range/algorithm/swap_ranges.hpp |  12 +-
 .../boost/range/algorithm_ext/for_each.hpp    |  78 ++---
 include/boost/range/counting_range.hpp        |  58 ++--
 .../detail/demote_iterator_traversal_tag.hpp  |   8 +-
 include/boost/range/istream_range.hpp         |  23 +-
 include/boost/range/join.hpp                  |  44 +--
 include/boost/range/numeric.hpp               | 102 +++----
 include/boost/range/size_type.hpp             |   2 +-
 include/boost/range/unbounded_range.hpp       |  73 -----
 test/Jamfile.v2                               |   3 +
 .../adjacent_filtered_example.cpp             |   2 +-
 test/adaptor_test/copied_example.cpp          |   2 +-
 test/adaptor_test/strided2.cpp                |  67 ++++
 test/algorithm_ext_test/push_front.cpp        |  19 +-
 test/algorithm_test/find.cpp                  |  20 +-
 test/algorithm_test/find_end.cpp              |  38 +--
 test/algorithm_test/find_first_of.cpp         |  38 +--
 test/algorithm_test/find_if.cpp               |  20 +-
 test/algorithm_test/for_each.cpp              |   2 +-
 test/algorithm_test/lower_bound.cpp           |  44 +--
 test/algorithm_test/max_element.cpp           |  34 +--
 test/algorithm_test/min_element.cpp           |  34 +--
 test/algorithm_test/partition.cpp             |  18 +-
 test/algorithm_test/stable_partition.cpp      |  18 +-
 test/algorithm_test/unique.cpp                |  34 +--
 test/algorithm_test/upper_bound.cpp           |  48 +--
 test/counting_range.cpp                       |   2 +-
 test/istream_range.cpp                        |  51 ++++
 test/iterator_range.cpp                       |   2 +-
 test/pointer_as_iterator.cpp                  |  39 +++
 test/test_driver/range_return_test_driver.hpp |  30 +-
 223 files changed, 2754 insertions(+), 2666 deletions(-)
 delete mode 100755 doc/counting_range.html
 create mode 100644 doc/html/range/reference/algorithms/heap_algorithms/sort_heap.html
 create mode 100644 doc/html/range/reference/algorithms/range_algorithm_mutating_algorithms/fill_n.html
 create mode 100644 doc/reference/algorithm/fill_n.qbk
 delete mode 100755 include/boost/range/unbounded_range.hpp
 create mode 100644 test/adaptor_test/strided2.cpp
 create mode 100644 test/istream_range.cpp
 create mode 100644 test/pointer_as_iterator.cpp

diff --git a/doc/counting_range.html b/doc/counting_range.html
deleted file mode 100755
index c44edcc..0000000
--- a/doc/counting_range.html
+++ /dev/null
@@ -1,70 +0,0 @@
-<!DOCTYPE HTML PUBLIC "-//W3C//DTD HTML 3.2//EN">
-
-<html>
-<head>
-    <meta http-equiv="Content-Type" content="text/html; charset=ISO-8859-1" />
-    <title>Boost.Range Utilities</title>
-    <link rel="stylesheet" href="style.css" type="text/css" />
-</head>
-
-    <body>
-    <table border="0" >
-        <tr>
-            <td ><img src="../../../boost.png" border="0" /></td>
-            <td ><h1 align="center">Boost.Range</h1></td>
-        </tr>
-    </table>
-    <a name="counting_range"></a> <h1>Function <code>counting_range</code></h1>
-    <p>
-    The intention of the <code>counting_range</code> function is to construct
-    a new range with iterators that are wrapped in a
-    <code>counting_iterator</code> (from Boost.Iterator)
-    </p>
-
-    <h3>Synopsis</h3>
-
-    <pre><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">Incrementable</span><span class="identifier"> </span><span class="special">&gt; <span style="color: #0000ff">inline</span>
-    </span><span class="keyword"></span><span class="identifier">range&lt; counting_iterator&lt;Incrementable&gt; &gt;
-    counting_range(Incrementable first, Incrementable last);
-
-    <span class="keyword">template</span><span class="special">&lt; </span><span class="keyword">class </span><span class="identifier">SinglePassRange</span><span class="identifier"> </span><span class="special">&gt; </span><span class="keyword">inline
-    </span><span class="identifier">range&lt; counting_iterator&lt;<span class="keyword">typename</span> range_iterator&lt;SinglePassRange&gt;::type &gt;
-    counting_range(<span class="keyword">const</span> Range&amp; rng);
-
-    </span><span class="keyword">template</span><span class="special">&lt; </span><span class="keyword">class </span><span class="identifier">SinglePassRange</span><span class="identifier"> </span><span class="special">&gt; <span style="color: #0000ff">inline</span></span>
-    <span class="identifier">range&lt; counting_iterator&lt;<span style="color: #0000ff">typename</span> range_iterator&lt;SinglePassRange&gt;::type &gt;
-    counting_range(Range&amp; rng);
-        </span></span><span class="special"></span><span class="special"></span><span class="special">    </span>
-<span class="special">} </span><span class="comment">// namespace 'boost'</span>
-    </pre>
-    
-    <p>
-      &copy; <a name="Copyright" id="Copyright">Copyright</a> Neil Groves 2009.
-</p>
-
-    <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">www.boost.org/LICENSE_1_0.txt</a>)
-    </p>
-
-  <br />
-  <br />
-  <br />
-  <br />
-  <br />
-  <br />
-  <br />
-  <br />
-  <br />
-  <br />
-  <br />
-  <br />
-  
-    
-    </body>
-</html>
-
diff --git a/doc/headers.qbk b/doc/headers.qbk
index 6edefbd..9e29745 100644
--- a/doc/headers.qbk
+++ b/doc/headers.qbk
@@ -2,7 +2,7 @@
 
 [table
     [[Header                              ] [Includes                   ] [Related Concept         ]]
-    [[`<boost/range.hpp>`                 ] [everything                 ] [-                       ]]
+    [[`<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/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 f5bb91c..27ee9ba 100644
--- a/doc/html/index.html
+++ b/doc/html/index.html
@@ -3,7 +3,7 @@
 <meta http-equiv="Content-Type" content="text/html; charset=US-ASCII">
 <title>Chapter&#160;1.&#160;Range 2.0</title>
 <link rel="stylesheet" href="../../../../doc/html/boostbook.css" type="text/css">
-<meta name="generator" content="DocBook XSL Stylesheets V1.75.2">
+<meta name="generator" content="DocBook XSL Stylesheets V1.75.1">
 <link rel="home" href="index.html" title="Chapter&#160;1.&#160;Range 2.0">
 <link rel="next" href="range/introduction.html" title="Introduction">
 </head>
@@ -30,7 +30,7 @@
 </h3></div></div>
 <div><p class="copyright">Copyright &#169; 2003 -2010 Thorsten Ottosen, Neil Groves</p></div>
 <div><div class="legalnotice" title="Legal Notice">
-<a name="id621301"></a><p>
+<a name="id3005003"></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>
@@ -135,7 +135,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: April 05, 2010 at 17:25:33 GMT</small></p></td>
+<td align="left"><p><small>Last revised: April 11, 2010 at 21:49:16 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 67e69fa..df8f151 100644
--- a/doc/html/quickbook_HTML.manifest
+++ b/doc/html/quickbook_HTML.manifest
@@ -39,6 +39,7 @@ range/reference/algorithms/range_algorithm_mutating_algorithms.html
 range/reference/algorithms/range_algorithm_mutating_algorithms/copy.html
 range/reference/algorithms/range_algorithm_mutating_algorithms/copy_backward.html
 range/reference/algorithms/range_algorithm_mutating_algorithms/fill.html
+range/reference/algorithms/range_algorithm_mutating_algorithms/fill_n.html
 range/reference/algorithms/range_algorithm_mutating_algorithms/generate.html
 range/reference/algorithms/range_algorithm_mutating_algorithms/inplace_merge.html
 range/reference/algorithms/range_algorithm_mutating_algorithms/merge.html
@@ -84,6 +85,7 @@ range/reference/algorithms/heap_algorithms.html
 range/reference/algorithms/heap_algorithms/push_heap.html
 range/reference/algorithms/heap_algorithms/pop_heap.html
 range/reference/algorithms/heap_algorithms/make_heap.html
+range/reference/algorithms/heap_algorithms/sort_heap.html
 range/reference/algorithms/permutation_algorithms.html
 range/reference/algorithms/permutation_algorithms/next_permutation.html
 range/reference/algorithms/permutation_algorithms/prev_permutation.html
diff --git a/doc/html/range/concepts.html b/doc/html/range/concepts.html
index c43b67c..c384122 100644
--- a/doc/html/range/concepts.html
+++ b/doc/html/range/concepts.html
@@ -3,7 +3,7 @@
 <meta http-equiv="Content-Type" content="text/html; charset=US-ASCII">
 <title>Range Concepts</title>
 <link rel="stylesheet" href="../../../../../doc/html/boostbook.css" type="text/css">
-<meta name="generator" content="DocBook XSL Stylesheets V1.75.2">
+<meta name="generator" content="DocBook XSL Stylesheets V1.75.1">
 <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="introduction.html" title="Introduction">
diff --git a/doc/html/range/concepts/bidirectional_range.html b/doc/html/range/concepts/bidirectional_range.html
index 0fc965b..e3ae956 100644
--- a/doc/html/range/concepts/bidirectional_range.html
+++ b/doc/html/range/concepts/bidirectional_range.html
@@ -3,7 +3,7 @@
 <meta http-equiv="Content-Type" content="text/html; charset=US-ASCII">
 <title>Bidirectional Range</title>
 <link rel="stylesheet" href="../../../../../../doc/html/boostbook.css" type="text/css">
-<meta name="generator" content="DocBook XSL Stylesheets V1.75.2">
+<meta name="generator" content="DocBook XSL Stylesheets V1.75.1">
 <link rel="home" href="../../index.html" title="Chapter&#160;1.&#160;Range 2.0">
 <link rel="up" href="../concepts.html" title="Range Concepts">
 <link rel="prev" href="forward_range.html" title="Forward Range">
@@ -27,7 +27,7 @@
 <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="id632764"></a>
+<a name="id3017410"></a>
         <a class="link" href="bidirectional_range.html#range.concepts.bidirectional_range.notation">Notation</a>
       </h5>
 <div class="informaltable"><table class="table">
@@ -65,7 +65,7 @@
 </tbody>
 </table></div>
 <a name="range.concepts.bidirectional_range.description"></a><h5>
-<a name="id632852"></a>
+<a name="id3017508"></a>
         <a class="link" href="bidirectional_range.html#range.concepts.bidirectional_range.description">Description</a>
       </h5>
 <p>
@@ -75,7 +75,7 @@
         Traversal Iterator</a>.
       </p>
 <a name="range.concepts.bidirectional_range.refinement_of"></a><h5>
-<a name="id632911"></a>
+<a name="id3017574"></a>
         <a class="link" href="bidirectional_range.html#range.concepts.bidirectional_range.refinement_of">Refinement
         of</a>
       </h5>
@@ -83,7 +83,7 @@
         <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="id632934"></a>
+<a name="id3017602"></a>
         <a class="link" href="bidirectional_range.html#range.concepts.bidirectional_range.associated_types">Associated
         types</a>
       </h5>
@@ -136,7 +136,7 @@
 </tbody>
 </table></div>
 <a name="range.concepts.bidirectional_range.valid_expressions"></a><h5>
-<a name="id633090"></a>
+<a name="id3017768"></a>
         <a class="link" href="bidirectional_range.html#range.concepts.bidirectional_range.valid_expressions">Valid
         expressions</a>
       </h5>
@@ -221,7 +221,7 @@
 </tbody>
 </table></div>
 <a name="range.concepts.bidirectional_range.complexity_guarantees"></a><h5>
-<a name="id633550"></a>
+<a name="id3018247"></a>
         <a class="link" href="bidirectional_range.html#range.concepts.bidirectional_range.complexity_guarantees">Complexity
         guarantees</a>
       </h5>
@@ -232,7 +232,7 @@
         <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="id633691"></a>
+<a name="id3018398"></a>
         <a class="link" href="bidirectional_range.html#range.concepts.bidirectional_range.invariants">Invariants</a>
       </h5>
 <div class="informaltable"><table class="table">
@@ -272,7 +272,7 @@
 </tbody>
 </table></div>
 <a name="range.concepts.bidirectional_range.see_also"></a><h5>
-<a name="id633940"></a>
+<a name="id3018659"></a>
         <a class="link" href="bidirectional_range.html#range.concepts.bidirectional_range.see_also">See also</a>
       </h5>
 <p>
diff --git a/doc/html/range/concepts/concept_checking.html b/doc/html/range/concepts/concept_checking.html
index a4aa1d9..b5d5407 100644
--- a/doc/html/range/concepts/concept_checking.html
+++ b/doc/html/range/concepts/concept_checking.html
@@ -3,7 +3,7 @@
 <meta http-equiv="Content-Type" content="text/html; charset=US-ASCII">
 <title>Concept Checking</title>
 <link rel="stylesheet" href="../../../../../../doc/html/boostbook.css" type="text/css">
-<meta name="generator" content="DocBook XSL Stylesheets V1.75.2">
+<meta name="generator" content="DocBook XSL Stylesheets V1.75.1">
 <link rel="home" href="../../index.html" title="Chapter&#160;1.&#160;Range 2.0">
 <link rel="up" href="../concepts.html" title="Range Concepts">
 <link rel="prev" href="random_access_range.html" title="Random Access Range">
@@ -79,7 +79,7 @@
 </li>
 </ul></div>
 <a name="range.concepts.concept_checking.see_also"></a><h5>
-<a name="id634869"></a>
+<a name="id3019669"></a>
         <a class="link" href="concept_checking.html#range.concepts.concept_checking.see_also">See also</a>
       </h5>
 <p>
diff --git a/doc/html/range/concepts/forward_range.html b/doc/html/range/concepts/forward_range.html
index f82d8c5..919f6dd 100644
--- a/doc/html/range/concepts/forward_range.html
+++ b/doc/html/range/concepts/forward_range.html
@@ -3,7 +3,7 @@
 <meta http-equiv="Content-Type" content="text/html; charset=US-ASCII">
 <title>Forward Range</title>
 <link rel="stylesheet" href="../../../../../../doc/html/boostbook.css" type="text/css">
-<meta name="generator" content="DocBook XSL Stylesheets V1.75.2">
+<meta name="generator" content="DocBook XSL Stylesheets V1.75.1">
 <link rel="home" href="../../index.html" title="Chapter&#160;1.&#160;Range 2.0">
 <link rel="up" href="../concepts.html" title="Range Concepts">
 <link rel="prev" href="single_pass_range.html" title="Single Pass Range">
@@ -27,7 +27,7 @@
 <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="id632396"></a>
+<a name="id3017003"></a>
         <a class="link" href="forward_range.html#range.concepts.forward_range.notation">Notation</a>
       </h5>
 <div class="informaltable"><table class="table">
@@ -65,7 +65,7 @@
 </tbody>
 </table></div>
 <a name="range.concepts.forward_range.description"></a><h5>
-<a name="id632484"></a>
+<a name="id3017099"></a>
         <a class="link" href="forward_range.html#range.concepts.forward_range.description">Description</a>
       </h5>
 <p>
@@ -73,14 +73,14 @@
         Traversal Iterator</a>.
       </p>
 <a name="range.concepts.forward_range.refinement_of"></a><h5>
-<a name="id632550"></a>
+<a name="id3017171"></a>
         <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="id632572"></a>
+<a name="id3017200"></a>
         <a class="link" href="forward_range.html#range.concepts.forward_range.associated_types">Associated
         types</a>
       </h5>
@@ -132,7 +132,7 @@
 </tbody>
 </table></div>
 <a name="range.concepts.forward_range.see_also"></a><h5>
-<a name="id632721"></a>
+<a name="id3017357"></a>
         <a class="link" href="forward_range.html#range.concepts.forward_range.see_also">See also</a>
       </h5>
 <p>
diff --git a/doc/html/range/concepts/overview.html b/doc/html/range/concepts/overview.html
index c2bb4d1..7cd19e8 100644
--- a/doc/html/range/concepts/overview.html
+++ b/doc/html/range/concepts/overview.html
@@ -3,7 +3,7 @@
 <meta http-equiv="Content-Type" content="text/html; charset=US-ASCII">
 <title>Overview</title>
 <link rel="stylesheet" href="../../../../../../doc/html/boostbook.css" type="text/css">
-<meta name="generator" content="DocBook XSL Stylesheets V1.75.2">
+<meta name="generator" content="DocBook XSL Stylesheets V1.75.1">
 <link rel="home" href="../../index.html" title="Chapter&#160;1.&#160;Range 2.0">
 <link rel="up" href="../concepts.html" title="Range Concepts">
 <link rel="prev" href="../concepts.html" title="Range Concepts">
diff --git a/doc/html/range/concepts/random_access_range.html b/doc/html/range/concepts/random_access_range.html
index cc5d88e..a695e97 100644
--- a/doc/html/range/concepts/random_access_range.html
+++ b/doc/html/range/concepts/random_access_range.html
@@ -3,7 +3,7 @@
 <meta http-equiv="Content-Type" content="text/html; charset=US-ASCII">
 <title>Random Access Range</title>
 <link rel="stylesheet" href="../../../../../../doc/html/boostbook.css" type="text/css">
-<meta name="generator" content="DocBook XSL Stylesheets V1.75.2">
+<meta name="generator" content="DocBook XSL Stylesheets V1.75.1">
 <link rel="home" href="../../index.html" title="Chapter&#160;1.&#160;Range 2.0">
 <link rel="up" href="../concepts.html" title="Range Concepts">
 <link rel="prev" href="bidirectional_range.html" title="Bidirectional Range">
@@ -27,7 +27,7 @@
 <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="id633982"></a>
+<a name="id3018712"></a>
         <a class="link" href="random_access_range.html#range.concepts.random_access_range.description">Description</a>
       </h5>
 <p>
@@ -35,7 +35,7 @@
         Access Traversal Iterator</a>.
       </p>
 <a name="range.concepts.random_access_range.refinement_of"></a><h5>
-<a name="id634048"></a>
+<a name="id3018784"></a>
         <a class="link" href="random_access_range.html#range.concepts.random_access_range.refinement_of">Refinement
         of</a>
       </h5>
@@ -43,7 +43,7 @@
         <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="id634071"></a>
+<a name="id3018812"></a>
         <a class="link" href="random_access_range.html#range.concepts.random_access_range.valid_expressions">Valid
         expressions</a>
       </h5>
@@ -89,7 +89,7 @@
 </tr></tbody>
 </table></div>
 <a name="range.concepts.random_access_range.expression_semantics"></a><h5>
-<a name="id634209"></a>
+<a name="id3018959"></a>
         <a class="link" href="random_access_range.html#range.concepts.random_access_range.expression_semantics">Expression
         semantics</a>
       </h5>
@@ -139,7 +139,7 @@
 </tr></tbody>
 </table></div>
 <a name="range.concepts.random_access_range.complexity_guarantees"></a><h5>
-<a name="id634425"></a>
+<a name="id3019185"></a>
         <a class="link" href="random_access_range.html#range.concepts.random_access_range.complexity_guarantees">Complexity
         guarantees</a>
       </h5>
@@ -147,7 +147,7 @@
         <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="id634473"></a>
+<a name="id3019239"></a>
         <a class="link" href="random_access_range.html#range.concepts.random_access_range.invariants">Invariants</a>
       </h5>
 <div class="informaltable"><table class="table">
diff --git a/doc/html/range/concepts/single_pass_range.html b/doc/html/range/concepts/single_pass_range.html
index 9cb3123..5588147 100644
--- a/doc/html/range/concepts/single_pass_range.html
+++ b/doc/html/range/concepts/single_pass_range.html
@@ -3,7 +3,7 @@
 <meta http-equiv="Content-Type" content="text/html; charset=US-ASCII">
 <title>Single Pass Range</title>
 <link rel="stylesheet" href="../../../../../../doc/html/boostbook.css" type="text/css">
-<meta name="generator" content="DocBook XSL Stylesheets V1.75.2">
+<meta name="generator" content="DocBook XSL Stylesheets V1.75.1">
 <link rel="home" href="../../index.html" title="Chapter&#160;1.&#160;Range 2.0">
 <link rel="up" href="../concepts.html" title="Range Concepts">
 <link rel="prev" href="overview.html" title="Overview">
@@ -27,7 +27,7 @@
 <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="id631108"></a>
+<a name="id3015625"></a>
         <a class="link" href="single_pass_range.html#range.concepts.single_pass_range.notation">Notation</a>
       </h5>
 <div class="informaltable"><table class="table">
@@ -65,7 +65,7 @@
 </tbody>
 </table></div>
 <a name="range.concepts.single_pass_range.description"></a><h5>
-<a name="id631200"></a>
+<a name="id3015727"></a>
         <a class="link" href="single_pass_range.html#range.concepts.single_pass_range.description">Description</a>
       </h5>
 <p>
@@ -73,7 +73,7 @@
         Pass Iterator</a>.
       </p>
 <a name="range.concepts.single_pass_range.associated_types"></a><h5>
-<a name="id631265"></a>
+<a name="id3015799"></a>
         <a class="link" href="single_pass_range.html#range.concepts.single_pass_range.associated_types">Associated
         types</a>
       </h5>
@@ -126,7 +126,7 @@
 </tbody>
 </table></div>
 <a name="range.concepts.single_pass_range.valid_expressions"></a><h5>
-<a name="id631427"></a>
+<a name="id3015973"></a>
         <a class="link" href="single_pass_range.html#range.concepts.single_pass_range.valid_expressions">Valid
         expressions</a>
       </h5>
@@ -198,7 +198,7 @@
 </tbody>
 </table></div>
 <a name="range.concepts.single_pass_range.expression_semantics"></a><h5>
-<a name="id631746"></a>
+<a name="id3016307"></a>
         <a class="link" href="single_pass_range.html#range.concepts.single_pass_range.expression_semantics">Expression
         semantics</a>
       </h5>
@@ -266,7 +266,7 @@
 </tbody>
 </table></div>
 <a name="range.concepts.single_pass_range.complexity_guarantees"></a><h5>
-<a name="id632003"></a>
+<a name="id3016578"></a>
         <a class="link" href="single_pass_range.html#range.concepts.single_pass_range.complexity_guarantees">Complexity
         guarantees</a>
       </h5>
@@ -276,7 +276,7 @@
         constant time.
       </p>
 <a name="range.concepts.single_pass_range.invariants"></a><h5>
-<a name="id632080"></a>
+<a name="id3016661"></a>
         <a class="link" href="single_pass_range.html#range.concepts.single_pass_range.invariants">Invariants</a>
       </h5>
 <div class="informaltable"><table class="table">
@@ -316,7 +316,7 @@
 </tbody>
 </table></div>
 <a name="range.concepts.single_pass_range.see_also"></a><h5>
-<a name="id632336"></a>
+<a name="id3016932"></a>
         <a class="link" href="single_pass_range.html#range.concepts.single_pass_range.see_also">See also</a>
       </h5>
 <p>
diff --git a/doc/html/range/examples.html b/doc/html/range/examples.html
index f517040..b272df8 100644
--- a/doc/html/range/examples.html
+++ b/doc/html/range/examples.html
@@ -3,7 +3,7 @@
 <meta http-equiv="Content-Type" content="text/html; charset=US-ASCII">
 <title>Examples</title>
 <link rel="stylesheet" href="../../../../../doc/html/boostbook.css" type="text/css">
-<meta name="generator" content="DocBook XSL Stylesheets V1.75.2">
+<meta name="generator" content="DocBook XSL Stylesheets V1.75.1">
 <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="library_headers.html" title="Library Headers">
diff --git a/doc/html/range/faq.html b/doc/html/range/faq.html
index a5ea15d..0c9d40b 100644
--- a/doc/html/range/faq.html
+++ b/doc/html/range/faq.html
@@ -3,7 +3,7 @@
 <meta http-equiv="Content-Type" content="text/html; charset=US-ASCII">
 <title>FAQ</title>
 <link rel="stylesheet" href="../../../../../doc/html/boostbook.css" type="text/css">
-<meta name="generator" content="DocBook XSL Stylesheets V1.75.2">
+<meta name="generator" content="DocBook XSL Stylesheets V1.75.1">
 <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="portability.html" title="Portability">
diff --git a/doc/html/range/history_ack.html b/doc/html/range/history_ack.html
index 2401db3..930b6b6 100644
--- a/doc/html/range/history_ack.html
+++ b/doc/html/range/history_ack.html
@@ -3,7 +3,7 @@
 <meta http-equiv="Content-Type" content="text/html; charset=US-ASCII">
 <title>History and Acknowledgement</title>
 <link rel="stylesheet" href="../../../../../doc/html/boostbook.css" type="text/css">
-<meta name="generator" content="DocBook XSL Stylesheets V1.75.2">
+<meta name="generator" content="DocBook XSL Stylesheets V1.75.1">
 <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="faq.html" title="FAQ">
diff --git a/doc/html/range/introduction.html b/doc/html/range/introduction.html
index e41a60c..7bedc97 100644
--- a/doc/html/range/introduction.html
+++ b/doc/html/range/introduction.html
@@ -3,7 +3,7 @@
 <meta http-equiv="Content-Type" content="text/html; charset=US-ASCII">
 <title>Introduction</title>
 <link rel="stylesheet" href="../../../../../doc/html/boostbook.css" type="text/css">
-<meta name="generator" content="DocBook XSL Stylesheets V1.75.2">
+<meta name="generator" content="DocBook XSL Stylesheets V1.75.1">
 <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="../index.html" title="Chapter&#160;1.&#160;Range 2.0">
diff --git a/doc/html/range/library_headers.html b/doc/html/range/library_headers.html
index 8f28283..58ddcff 100644
--- a/doc/html/range/library_headers.html
+++ b/doc/html/range/library_headers.html
@@ -3,7 +3,7 @@
 <meta http-equiv="Content-Type" content="text/html; charset=US-ASCII">
 <title>Library Headers</title>
 <link rel="stylesheet" href="../../../../../doc/html/boostbook.css" type="text/css">
-<meta name="generator" content="DocBook XSL Stylesheets V1.75.2">
+<meta name="generator" content="DocBook XSL Stylesheets V1.75.1">
 <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="style_guide.html" title="Terminology and style guidelines">
@@ -58,7 +58,9 @@
             </td>
 <td>
               <p>
-                everything
+                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.
               </p>
             </td>
 <td>
diff --git a/doc/html/range/mfc_atl.html b/doc/html/range/mfc_atl.html
index 338e860..63558aa 100644
--- a/doc/html/range/mfc_atl.html
+++ b/doc/html/range/mfc_atl.html
@@ -3,7 +3,7 @@
 <meta http-equiv="Content-Type" content="text/html; charset=US-ASCII">
 <title>MFC/ATL (courtesy of Shunsuke Sogame)</title>
 <link rel="stylesheet" href="../../../../../doc/html/boostbook.css" type="text/css">
-<meta name="generator" content="DocBook XSL Stylesheets V1.75.2">
+<meta name="generator" content="DocBook XSL Stylesheets V1.75.1">
 <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="examples.html" title="Examples">
@@ -34,7 +34,7 @@
 <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="id739258"></a>
+<a name="id3128780"></a>
       <a class="link" href="mfc_atl.html#range.mfc_atl.introduction">Introduction</a>
     </h5>
 <p>
@@ -100,7 +100,7 @@
 </tbody>
 </table></div>
 <a name="range.mfc_atl.overview"></a><h5>
-<a name="id739392"></a>
+<a name="id3128918"></a>
       <a class="link" href="mfc_atl.html#range.mfc_atl.overview">Overview</a>
     </h5>
 <p>
diff --git a/doc/html/range/mfc_atl/atl_ranges.html b/doc/html/range/mfc_atl/atl_ranges.html
index 766375d..65ee355 100644
--- a/doc/html/range/mfc_atl/atl_ranges.html
+++ b/doc/html/range/mfc_atl/atl_ranges.html
@@ -3,7 +3,7 @@
 <meta http-equiv="Content-Type" content="text/html; charset=US-ASCII">
 <title>ATL Ranges</title>
 <link rel="stylesheet" href="../../../../../../doc/html/boostbook.css" type="text/css">
-<meta name="generator" content="DocBook XSL Stylesheets V1.75.2">
+<meta name="generator" content="DocBook XSL Stylesheets V1.75.1">
 <link rel="home" href="../../index.html" title="Chapter&#160;1.&#160;Range 2.0">
 <link rel="up" href="../mfc_atl.html" title="MFC/ATL (courtesy of Shunsuke Sogame)">
 <link rel="prev" href="mfc_ranges.html" title="MFC Ranges">
diff --git a/doc/html/range/mfc_atl/const_ranges.html b/doc/html/range/mfc_atl/const_ranges.html
index 222c6d8..2e047f6 100644
--- a/doc/html/range/mfc_atl/const_ranges.html
+++ b/doc/html/range/mfc_atl/const_ranges.html
@@ -3,7 +3,7 @@
 <meta http-equiv="Content-Type" content="text/html; charset=US-ASCII">
 <title>const Ranges</title>
 <link rel="stylesheet" href="../../../../../../doc/html/boostbook.css" type="text/css">
-<meta name="generator" content="DocBook XSL Stylesheets V1.75.2">
+<meta name="generator" content="DocBook XSL Stylesheets V1.75.1">
 <link rel="home" href="../../index.html" title="Chapter&#160;1.&#160;Range 2.0">
 <link rel="up" href="../mfc_atl.html" title="MFC/ATL (courtesy of Shunsuke Sogame)">
 <link rel="prev" href="atl_ranges.html" title="ATL Ranges">
diff --git a/doc/html/range/mfc_atl/mfc_ranges.html b/doc/html/range/mfc_atl/mfc_ranges.html
index 9e6d001..af0c6e9 100644
--- a/doc/html/range/mfc_atl/mfc_ranges.html
+++ b/doc/html/range/mfc_atl/mfc_ranges.html
@@ -3,7 +3,7 @@
 <meta http-equiv="Content-Type" content="text/html; charset=US-ASCII">
 <title>MFC Ranges</title>
 <link rel="stylesheet" href="../../../../../../doc/html/boostbook.css" type="text/css">
-<meta name="generator" content="DocBook XSL Stylesheets V1.75.2">
+<meta name="generator" content="DocBook XSL Stylesheets V1.75.1">
 <link rel="home" href="../../index.html" title="Chapter&#160;1.&#160;Range 2.0">
 <link rel="up" href="../mfc_atl.html" title="MFC/ATL (courtesy of Shunsuke Sogame)">
 <link rel="prev" href="requirements.html" title="Requirements">
diff --git a/doc/html/range/mfc_atl/references.html b/doc/html/range/mfc_atl/references.html
index 8afe82a..124a538 100644
--- a/doc/html/range/mfc_atl/references.html
+++ b/doc/html/range/mfc_atl/references.html
@@ -3,7 +3,7 @@
 <meta http-equiv="Content-Type" content="text/html; charset=US-ASCII">
 <title>References</title>
 <link rel="stylesheet" href="../../../../../../doc/html/boostbook.css" type="text/css">
-<meta name="generator" content="DocBook XSL Stylesheets V1.75.2">
+<meta name="generator" content="DocBook XSL Stylesheets V1.75.1">
 <link rel="home" href="../../index.html" title="Chapter&#160;1.&#160;Range 2.0">
 <link rel="up" href="../mfc_atl.html" title="MFC/ATL (courtesy of Shunsuke Sogame)">
 <link rel="prev" href="const_ranges.html" title="const Ranges">
diff --git a/doc/html/range/mfc_atl/requirements.html b/doc/html/range/mfc_atl/requirements.html
index c49ac8c..131433f 100644
--- a/doc/html/range/mfc_atl/requirements.html
+++ b/doc/html/range/mfc_atl/requirements.html
@@ -3,7 +3,7 @@
 <meta http-equiv="Content-Type" content="text/html; charset=US-ASCII">
 <title>Requirements</title>
 <link rel="stylesheet" href="../../../../../../doc/html/boostbook.css" type="text/css">
-<meta name="generator" content="DocBook XSL Stylesheets V1.75.2">
+<meta name="generator" content="DocBook XSL Stylesheets V1.75.1">
 <link rel="home" href="../../index.html" title="Chapter&#160;1.&#160;Range 2.0">
 <link rel="up" href="../mfc_atl.html" title="MFC/ATL (courtesy of Shunsuke Sogame)">
 <link rel="prev" href="../mfc_atl.html" title="MFC/ATL (courtesy of Shunsuke Sogame)">
diff --git a/doc/html/range/portability.html b/doc/html/range/portability.html
index 63e3621..901e0b1 100644
--- a/doc/html/range/portability.html
+++ b/doc/html/range/portability.html
@@ -3,7 +3,7 @@
 <meta http-equiv="Content-Type" content="text/html; charset=US-ASCII">
 <title>Portability</title>
 <link rel="stylesheet" href="../../../../../doc/html/boostbook.css" type="text/css">
-<meta name="generator" content="DocBook XSL Stylesheets V1.75.2">
+<meta name="generator" content="DocBook XSL Stylesheets V1.75.1">
 <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="upgrade/upgrade_from_1_34.html" title="Upgrade from version 1.34">
diff --git a/doc/html/range/reference.html b/doc/html/range/reference.html
index a76673a..70c17dc 100644
--- a/doc/html/range/reference.html
+++ b/doc/html/range/reference.html
@@ -3,7 +3,7 @@
 <meta http-equiv="Content-Type" content="text/html; charset=US-ASCII">
 <title>Reference</title>
 <link rel="stylesheet" href="../../../../../doc/html/boostbook.css" type="text/css">
-<meta name="generator" content="DocBook XSL Stylesheets V1.75.2">
+<meta name="generator" content="DocBook XSL Stylesheets V1.75.1">
 <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="concepts/concept_checking.html" title="Concept Checking">
diff --git a/doc/html/range/reference/adaptors.html b/doc/html/range/reference/adaptors.html
index bc68382..5ab0ecd 100644
--- a/doc/html/range/reference/adaptors.html
+++ b/doc/html/range/reference/adaptors.html
@@ -3,7 +3,7 @@
 <meta http-equiv="Content-Type" content="text/html; charset=US-ASCII">
 <title>Range Adaptors</title>
 <link rel="stylesheet" href="../../../../../../doc/html/boostbook.css" type="text/css">
-<meta name="generator" content="DocBook XSL Stylesheets V1.75.2">
+<meta name="generator" content="DocBook XSL Stylesheets V1.75.1">
 <link rel="home" href="../../index.html" title="Chapter&#160;1.&#160;Range 2.0">
 <link rel="up" href="../reference.html" title="Reference">
 <link rel="prev" href="semantics/functions.html" title="Functions">
diff --git a/doc/html/range/reference/adaptors/adaptors_general_requirements.html b/doc/html/range/reference/adaptors/adaptors_general_requirements.html
index ce2b17b..a815bae 100644
--- a/doc/html/range/reference/adaptors/adaptors_general_requirements.html
+++ b/doc/html/range/reference/adaptors/adaptors_general_requirements.html
@@ -3,7 +3,7 @@
 <meta http-equiv="Content-Type" content="text/html; charset=US-ASCII">
 <title>General Requirements</title>
 <link rel="stylesheet" href="../../../../../../../doc/html/boostbook.css" type="text/css">
-<meta name="generator" content="DocBook XSL Stylesheets V1.75.2">
+<meta name="generator" content="DocBook XSL Stylesheets V1.75.1">
 <link rel="home" href="../../../index.html" title="Chapter&#160;1.&#160;Range 2.0">
 <link rel="up" href="../adaptors.html" title="Range Adaptors">
 <link rel="prev" href="adaptors_synopsis.html" title="Synopsis">
diff --git a/doc/html/range/reference/adaptors/adaptors_introduction.html b/doc/html/range/reference/adaptors/adaptors_introduction.html
index 3d61175..e1e4e26 100644
--- a/doc/html/range/reference/adaptors/adaptors_introduction.html
+++ b/doc/html/range/reference/adaptors/adaptors_introduction.html
@@ -3,7 +3,7 @@
 <meta http-equiv="Content-Type" content="text/html; charset=US-ASCII">
 <title>Introduction and motivation</title>
 <link rel="stylesheet" href="../../../../../../../doc/html/boostbook.css" type="text/css">
-<meta name="generator" content="DocBook XSL Stylesheets V1.75.2">
+<meta name="generator" content="DocBook XSL Stylesheets V1.75.1">
 <link rel="home" href="../../../index.html" title="Chapter&#160;1.&#160;Range 2.0">
 <link rel="up" href="../adaptors.html" title="Range Adaptors">
 <link rel="prev" href="../adaptors.html" title="Range Adaptors">
@@ -122,7 +122,7 @@
           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.adaptors_introduction.composition_of_adaptors"></a><h6>
-<a name="id641845"></a>
+<a name="id3026637"></a>
           <a class="link" href="adaptors_introduction.html#range.reference.adaptors.adaptors_introduction.composition_of_adaptors">Composition
           of Adaptors</a>
         </h6>
@@ -159,7 +159,7 @@
           is the design solution to this problem.
         </p>
 <a name="range.reference.adaptors.adaptors_introduction.range_adaptor_alternative_to_copy_if_algorithm"></a><h6>
-<a name="id642142"></a>
+<a name="id3026947"></a>
           <a class="link" href="adaptors_introduction.html#range.reference.adaptors.adaptors_introduction.range_adaptor_alternative_to_copy_if_algorithm">Range
           Adaptor alternative to copy_if algorithm</a>
         </h6>
@@ -176,7 +176,7 @@
 <p>
         </p>
 <a name="range.reference.adaptors.adaptors_introduction.range_adaptor_alternative_to_count_if_algorithm"></a><h6>
-<a name="id642307"></a>
+<a name="id3027116"></a>
           <a class="link" href="adaptors_introduction.html#range.reference.adaptors.adaptors_introduction.range_adaptor_alternative_to_count_if_algorithm">Range
           Adaptor alternative to count_if algorithm</a>
         </h6>
diff --git a/doc/html/range/reference/adaptors/adaptors_reference.html b/doc/html/range/reference/adaptors/adaptors_reference.html
index 5a3dae6..d284888 100644
--- a/doc/html/range/reference/adaptors/adaptors_reference.html
+++ b/doc/html/range/reference/adaptors/adaptors_reference.html
@@ -3,7 +3,7 @@
 <meta http-equiv="Content-Type" content="text/html; charset=US-ASCII">
 <title>Reference</title>
 <link rel="stylesheet" href="../../../../../../../doc/html/boostbook.css" type="text/css">
-<meta name="generator" content="DocBook XSL Stylesheets V1.75.2">
+<meta name="generator" content="DocBook XSL Stylesheets V1.75.1">
 <link rel="home" href="../../../index.html" title="Chapter&#160;1.&#160;Range 2.0">
 <link rel="up" href="../adaptors.html" title="Range Adaptors">
 <link rel="prev" href="adaptors_general_requirements.html" title="General Requirements">
diff --git a/doc/html/range/reference/adaptors/adaptors_reference/adjacent_filtered.html b/doc/html/range/reference/adaptors/adaptors_reference/adjacent_filtered.html
index df72e28..fa763c8 100644
--- a/doc/html/range/reference/adaptors/adaptors_reference/adjacent_filtered.html
+++ b/doc/html/range/reference/adaptors/adaptors_reference/adjacent_filtered.html
@@ -3,7 +3,7 @@
 <meta http-equiv="Content-Type" content="text/html; charset=US-ASCII">
 <title>adjacent_filtered</title>
 <link rel="stylesheet" href="../../../../../../../../doc/html/boostbook.css" type="text/css">
-<meta name="generator" content="DocBook XSL Stylesheets V1.75.2">
+<meta name="generator" content="DocBook XSL Stylesheets V1.75.1">
 <link rel="home" href="../../../../index.html" title="Chapter&#160;1.&#160;Range 2.0">
 <link rel="up" href="../adaptors_reference.html" title="Reference">
 <link rel="prev" href="../adaptors_reference.html" title="Reference">
diff --git a/doc/html/range/reference/adaptors/adaptors_reference/copied.html b/doc/html/range/reference/adaptors/adaptors_reference/copied.html
index b488800..650e29a 100644
--- a/doc/html/range/reference/adaptors/adaptors_reference/copied.html
+++ b/doc/html/range/reference/adaptors/adaptors_reference/copied.html
@@ -3,7 +3,7 @@
 <meta http-equiv="Content-Type" content="text/html; charset=US-ASCII">
 <title>copied</title>
 <link rel="stylesheet" href="../../../../../../../../doc/html/boostbook.css" type="text/css">
-<meta name="generator" content="DocBook XSL Stylesheets V1.75.2">
+<meta name="generator" content="DocBook XSL Stylesheets V1.75.1">
 <link rel="home" href="../../../../index.html" title="Chapter&#160;1.&#160;Range 2.0">
 <link rel="up" href="../adaptors_reference.html" title="Reference">
 <link rel="prev" href="adjacent_filtered.html" title="adjacent_filtered">
diff --git a/doc/html/range/reference/adaptors/adaptors_reference/filtered.html b/doc/html/range/reference/adaptors/adaptors_reference/filtered.html
index 04d418d..1551a9f 100644
--- a/doc/html/range/reference/adaptors/adaptors_reference/filtered.html
+++ b/doc/html/range/reference/adaptors/adaptors_reference/filtered.html
@@ -3,7 +3,7 @@
 <meta http-equiv="Content-Type" content="text/html; charset=US-ASCII">
 <title>filtered</title>
 <link rel="stylesheet" href="../../../../../../../../doc/html/boostbook.css" type="text/css">
-<meta name="generator" content="DocBook XSL Stylesheets V1.75.2">
+<meta name="generator" content="DocBook XSL Stylesheets V1.75.1">
 <link rel="home" href="../../../../index.html" title="Chapter&#160;1.&#160;Range 2.0">
 <link rel="up" href="../adaptors_reference.html" title="Reference">
 <link rel="prev" href="copied.html" title="copied">
diff --git a/doc/html/range/reference/adaptors/adaptors_reference/indexed.html b/doc/html/range/reference/adaptors/adaptors_reference/indexed.html
index 03ec01b..d8c8674 100644
--- a/doc/html/range/reference/adaptors/adaptors_reference/indexed.html
+++ b/doc/html/range/reference/adaptors/adaptors_reference/indexed.html
@@ -3,7 +3,7 @@
 <meta http-equiv="Content-Type" content="text/html; charset=US-ASCII">
 <title>indexed</title>
 <link rel="stylesheet" href="../../../../../../../../doc/html/boostbook.css" type="text/css">
-<meta name="generator" content="DocBook XSL Stylesheets V1.75.2">
+<meta name="generator" content="DocBook XSL Stylesheets V1.75.1">
 <link rel="home" href="../../../../index.html" title="Chapter&#160;1.&#160;Range 2.0">
 <link rel="up" href="../adaptors_reference.html" title="Reference">
 <link rel="prev" href="filtered.html" title="filtered">
diff --git a/doc/html/range/reference/adaptors/adaptors_reference/indirected.html b/doc/html/range/reference/adaptors/adaptors_reference/indirected.html
index 391abcc..adcd57a 100644
--- a/doc/html/range/reference/adaptors/adaptors_reference/indirected.html
+++ b/doc/html/range/reference/adaptors/adaptors_reference/indirected.html
@@ -3,7 +3,7 @@
 <meta http-equiv="Content-Type" content="text/html; charset=US-ASCII">
 <title>indirected</title>
 <link rel="stylesheet" href="../../../../../../../../doc/html/boostbook.css" type="text/css">
-<meta name="generator" content="DocBook XSL Stylesheets V1.75.2">
+<meta name="generator" content="DocBook XSL Stylesheets V1.75.1">
 <link rel="home" href="../../../../index.html" title="Chapter&#160;1.&#160;Range 2.0">
 <link rel="up" href="../adaptors_reference.html" title="Reference">
 <link rel="prev" href="indexed.html" title="indexed">
diff --git a/doc/html/range/reference/adaptors/adaptors_reference/map_keys.html b/doc/html/range/reference/adaptors/adaptors_reference/map_keys.html
index 7af39c9..95c1746 100644
--- a/doc/html/range/reference/adaptors/adaptors_reference/map_keys.html
+++ b/doc/html/range/reference/adaptors/adaptors_reference/map_keys.html
@@ -3,7 +3,7 @@
 <meta http-equiv="Content-Type" content="text/html; charset=US-ASCII">
 <title>map_keys</title>
 <link rel="stylesheet" href="../../../../../../../../doc/html/boostbook.css" type="text/css">
-<meta name="generator" content="DocBook XSL Stylesheets V1.75.2">
+<meta name="generator" content="DocBook XSL Stylesheets V1.75.1">
 <link rel="home" href="../../../../index.html" title="Chapter&#160;1.&#160;Range 2.0">
 <link rel="up" href="../adaptors_reference.html" title="Reference">
 <link rel="prev" href="indirected.html" title="indirected">
diff --git a/doc/html/range/reference/adaptors/adaptors_reference/map_values.html b/doc/html/range/reference/adaptors/adaptors_reference/map_values.html
index 810ba7a..553a8f3 100644
--- a/doc/html/range/reference/adaptors/adaptors_reference/map_values.html
+++ b/doc/html/range/reference/adaptors/adaptors_reference/map_values.html
@@ -3,7 +3,7 @@
 <meta http-equiv="Content-Type" content="text/html; charset=US-ASCII">
 <title>map_values</title>
 <link rel="stylesheet" href="../../../../../../../../doc/html/boostbook.css" type="text/css">
-<meta name="generator" content="DocBook XSL Stylesheets V1.75.2">
+<meta name="generator" content="DocBook XSL Stylesheets V1.75.1">
 <link rel="home" href="../../../../index.html" title="Chapter&#160;1.&#160;Range 2.0">
 <link rel="up" href="../adaptors_reference.html" title="Reference">
 <link rel="prev" href="map_keys.html" title="map_keys">
diff --git a/doc/html/range/reference/adaptors/adaptors_reference/replaced.html b/doc/html/range/reference/adaptors/adaptors_reference/replaced.html
index 6af8257..0990ede 100644
--- a/doc/html/range/reference/adaptors/adaptors_reference/replaced.html
+++ b/doc/html/range/reference/adaptors/adaptors_reference/replaced.html
@@ -3,7 +3,7 @@
 <meta http-equiv="Content-Type" content="text/html; charset=US-ASCII">
 <title>replaced</title>
 <link rel="stylesheet" href="../../../../../../../../doc/html/boostbook.css" type="text/css">
-<meta name="generator" content="DocBook XSL Stylesheets V1.75.2">
+<meta name="generator" content="DocBook XSL Stylesheets V1.75.1">
 <link rel="home" href="../../../../index.html" title="Chapter&#160;1.&#160;Range 2.0">
 <link rel="up" href="../adaptors_reference.html" title="Reference">
 <link rel="prev" href="map_values.html" title="map_values">
diff --git a/doc/html/range/reference/adaptors/adaptors_reference/replaced_if.html b/doc/html/range/reference/adaptors/adaptors_reference/replaced_if.html
index f916472..abcf00f 100644
--- a/doc/html/range/reference/adaptors/adaptors_reference/replaced_if.html
+++ b/doc/html/range/reference/adaptors/adaptors_reference/replaced_if.html
@@ -3,7 +3,7 @@
 <meta http-equiv="Content-Type" content="text/html; charset=US-ASCII">
 <title>replaced_if</title>
 <link rel="stylesheet" href="../../../../../../../../doc/html/boostbook.css" type="text/css">
-<meta name="generator" content="DocBook XSL Stylesheets V1.75.2">
+<meta name="generator" content="DocBook XSL Stylesheets V1.75.1">
 <link rel="home" href="../../../../index.html" title="Chapter&#160;1.&#160;Range 2.0">
 <link rel="up" href="../adaptors_reference.html" title="Reference">
 <link rel="prev" href="replaced.html" title="replaced">
diff --git a/doc/html/range/reference/adaptors/adaptors_reference/reversed.html b/doc/html/range/reference/adaptors/adaptors_reference/reversed.html
index 2ef6d5d..52f4cda 100644
--- a/doc/html/range/reference/adaptors/adaptors_reference/reversed.html
+++ b/doc/html/range/reference/adaptors/adaptors_reference/reversed.html
@@ -3,7 +3,7 @@
 <meta http-equiv="Content-Type" content="text/html; charset=US-ASCII">
 <title>reversed</title>
 <link rel="stylesheet" href="../../../../../../../../doc/html/boostbook.css" type="text/css">
-<meta name="generator" content="DocBook XSL Stylesheets V1.75.2">
+<meta name="generator" content="DocBook XSL Stylesheets V1.75.1">
 <link rel="home" href="../../../../index.html" title="Chapter&#160;1.&#160;Range 2.0">
 <link rel="up" href="../adaptors_reference.html" title="Reference">
 <link rel="prev" href="replaced_if.html" title="replaced_if">
diff --git a/doc/html/range/reference/adaptors/adaptors_reference/sliced.html b/doc/html/range/reference/adaptors/adaptors_reference/sliced.html
index 8901fa0..9793092 100644
--- a/doc/html/range/reference/adaptors/adaptors_reference/sliced.html
+++ b/doc/html/range/reference/adaptors/adaptors_reference/sliced.html
@@ -3,7 +3,7 @@
 <meta http-equiv="Content-Type" content="text/html; charset=US-ASCII">
 <title>sliced</title>
 <link rel="stylesheet" href="../../../../../../../../doc/html/boostbook.css" type="text/css">
-<meta name="generator" content="DocBook XSL Stylesheets V1.75.2">
+<meta name="generator" content="DocBook XSL Stylesheets V1.75.1">
 <link rel="home" href="../../../../index.html" title="Chapter&#160;1.&#160;Range 2.0">
 <link rel="up" href="../adaptors_reference.html" title="Reference">
 <link rel="prev" href="reversed.html" title="reversed">
diff --git a/doc/html/range/reference/adaptors/adaptors_reference/strided.html b/doc/html/range/reference/adaptors/adaptors_reference/strided.html
index ca37e60..6fcc281 100644
--- a/doc/html/range/reference/adaptors/adaptors_reference/strided.html
+++ b/doc/html/range/reference/adaptors/adaptors_reference/strided.html
@@ -3,7 +3,7 @@
 <meta http-equiv="Content-Type" content="text/html; charset=US-ASCII">
 <title>strided</title>
 <link rel="stylesheet" href="../../../../../../../../doc/html/boostbook.css" type="text/css">
-<meta name="generator" content="DocBook XSL Stylesheets V1.75.2">
+<meta name="generator" content="DocBook XSL Stylesheets V1.75.1">
 <link rel="home" href="../../../../index.html" title="Chapter&#160;1.&#160;Range 2.0">
 <link rel="up" href="../adaptors_reference.html" title="Reference">
 <link rel="prev" href="sliced.html" title="sliced">
diff --git a/doc/html/range/reference/adaptors/adaptors_reference/tokenized.html b/doc/html/range/reference/adaptors/adaptors_reference/tokenized.html
index 0b294b2..fc4bc42 100644
--- a/doc/html/range/reference/adaptors/adaptors_reference/tokenized.html
+++ b/doc/html/range/reference/adaptors/adaptors_reference/tokenized.html
@@ -3,7 +3,7 @@
 <meta http-equiv="Content-Type" content="text/html; charset=US-ASCII">
 <title>tokenized</title>
 <link rel="stylesheet" href="../../../../../../../../doc/html/boostbook.css" type="text/css">
-<meta name="generator" content="DocBook XSL Stylesheets V1.75.2">
+<meta name="generator" content="DocBook XSL Stylesheets V1.75.1">
 <link rel="home" href="../../../../index.html" title="Chapter&#160;1.&#160;Range 2.0">
 <link rel="up" href="../adaptors_reference.html" title="Reference">
 <link rel="prev" href="strided.html" title="strided">
diff --git a/doc/html/range/reference/adaptors/adaptors_reference/transformed.html b/doc/html/range/reference/adaptors/adaptors_reference/transformed.html
index 1947b6d..56a6170 100644
--- a/doc/html/range/reference/adaptors/adaptors_reference/transformed.html
+++ b/doc/html/range/reference/adaptors/adaptors_reference/transformed.html
@@ -3,7 +3,7 @@
 <meta http-equiv="Content-Type" content="text/html; charset=US-ASCII">
 <title>transformed</title>
 <link rel="stylesheet" href="../../../../../../../../doc/html/boostbook.css" type="text/css">
-<meta name="generator" content="DocBook XSL Stylesheets V1.75.2">
+<meta name="generator" content="DocBook XSL Stylesheets V1.75.1">
 <link rel="home" href="../../../../index.html" title="Chapter&#160;1.&#160;Range 2.0">
 <link rel="up" href="../adaptors_reference.html" title="Reference">
 <link rel="prev" href="tokenized.html" title="tokenized">
diff --git a/doc/html/range/reference/adaptors/adaptors_reference/uniqued.html b/doc/html/range/reference/adaptors/adaptors_reference/uniqued.html
index 1f7d9fb..3b314ab 100644
--- a/doc/html/range/reference/adaptors/adaptors_reference/uniqued.html
+++ b/doc/html/range/reference/adaptors/adaptors_reference/uniqued.html
@@ -3,7 +3,7 @@
 <meta http-equiv="Content-Type" content="text/html; charset=US-ASCII">
 <title>uniqued</title>
 <link rel="stylesheet" href="../../../../../../../../doc/html/boostbook.css" type="text/css">
-<meta name="generator" content="DocBook XSL Stylesheets V1.75.2">
+<meta name="generator" content="DocBook XSL Stylesheets V1.75.1">
 <link rel="home" href="../../../../index.html" title="Chapter&#160;1.&#160;Range 2.0">
 <link rel="up" href="../adaptors_reference.html" title="Reference">
 <link rel="prev" href="transformed.html" title="transformed">
diff --git a/doc/html/range/reference/adaptors/adaptors_synopsis.html b/doc/html/range/reference/adaptors/adaptors_synopsis.html
index 202a114..d0fea59 100644
--- a/doc/html/range/reference/adaptors/adaptors_synopsis.html
+++ b/doc/html/range/reference/adaptors/adaptors_synopsis.html
@@ -3,7 +3,7 @@
 <meta http-equiv="Content-Type" content="text/html; charset=US-ASCII">
 <title>Synopsis</title>
 <link rel="stylesheet" href="../../../../../../../doc/html/boostbook.css" type="text/css">
-<meta name="generator" content="DocBook XSL Stylesheets V1.75.2">
+<meta name="generator" content="DocBook XSL Stylesheets V1.75.1">
 <link rel="home" href="../../../index.html" title="Chapter&#160;1.&#160;Range 2.0">
 <link rel="up" href="../adaptors.html" title="Range Adaptors">
 <link rel="prev" href="adaptors_introduction.html" title="Introduction and motivation">
diff --git a/doc/html/range/reference/algorithms.html b/doc/html/range/reference/algorithms.html
index 99e1dad..fc70d02 100644
--- a/doc/html/range/reference/algorithms.html
+++ b/doc/html/range/reference/algorithms.html
@@ -3,7 +3,7 @@
 <meta http-equiv="Content-Type" content="text/html; charset=US-ASCII">
 <title>Range Algorithm</title>
 <link rel="stylesheet" href="../../../../../../doc/html/boostbook.css" type="text/css">
-<meta name="generator" content="DocBook XSL Stylesheets V1.75.2">
+<meta name="generator" content="DocBook XSL Stylesheets V1.75.1">
 <link rel="home" href="../../index.html" title="Chapter&#160;1.&#160;Range 2.0">
 <link rel="up" href="../reference.html" title="Reference">
 <link rel="prev" href="adaptors/adaptors_reference/uniqued.html" title="uniqued">
diff --git a/doc/html/range/reference/algorithms/heap_algorithms.html b/doc/html/range/reference/algorithms/heap_algorithms.html
index 2cdbaaa..018906e 100644
--- a/doc/html/range/reference/algorithms/heap_algorithms.html
+++ b/doc/html/range/reference/algorithms/heap_algorithms.html
@@ -3,7 +3,7 @@
 <meta http-equiv="Content-Type" content="text/html; charset=US-ASCII">
 <title>Heap algorithms</title>
 <link rel="stylesheet" href="../../../../../../../doc/html/boostbook.css" type="text/css">
-<meta name="generator" content="DocBook XSL Stylesheets V1.75.2">
+<meta name="generator" content="DocBook XSL Stylesheets V1.75.1">
 <link rel="home" href="../../../index.html" title="Chapter&#160;1.&#160;Range 2.0">
 <link rel="up" href="../algorithms.html" title="Range Algorithm">
 <link rel="prev" href="set_algorithms/set_symmetric_difference.html" title="set_symmetric_difference">
@@ -33,6 +33,8 @@
           pop_heap</a></span></dt>
 <dt><span class="section"><a href="heap_algorithms/make_heap.html">
           make_heap</a></span></dt>
+<dt><span class="section"><a href="heap_algorithms/sort_heap.html">
+          sort_heap</a></span></dt>
 </dl></div>
 </div>
 <table xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" width="100%"><tr>
diff --git a/doc/html/range/reference/algorithms/heap_algorithms/make_heap.html b/doc/html/range/reference/algorithms/heap_algorithms/make_heap.html
index 083df4a..f261c6a 100644
--- a/doc/html/range/reference/algorithms/heap_algorithms/make_heap.html
+++ b/doc/html/range/reference/algorithms/heap_algorithms/make_heap.html
@@ -3,11 +3,11 @@
 <meta http-equiv="Content-Type" content="text/html; charset=US-ASCII">
 <title>make_heap</title>
 <link rel="stylesheet" href="../../../../../../../../doc/html/boostbook.css" type="text/css">
-<meta name="generator" content="DocBook XSL Stylesheets V1.75.2">
+<meta name="generator" content="DocBook XSL Stylesheets V1.75.1">
 <link rel="home" href="../../../../index.html" title="Chapter&#160;1.&#160;Range 2.0">
 <link rel="up" href="../heap_algorithms.html" title="Heap algorithms">
 <link rel="prev" href="pop_heap.html" title="pop_heap">
-<link rel="next" href="../permutation_algorithms.html" title="Permutation algorithms">
+<link rel="next" href="sort_heap.html" title="sort_heap">
 </head>
 <body bgcolor="white" text="black" link="#0000FF" vlink="#840084" alink="#0000FF">
 <table cellpadding="2" width="100%"><tr>
@@ -20,7 +20,7 @@
 </tr></table>
 <hr>
 <div class="spirit-nav">
-<a accesskey="p" href="pop_heap.html"><img src="../../../../../../../../doc/html/images/prev.png" alt="Prev"></a><a accesskey="u" href="../heap_algorithms.html"><img src="../../../../../../../../doc/html/images/up.png" alt="Up"></a><a accesskey="h" href="../../../../index.html"><img src="../../../../../../../../doc/html/images/home.png" alt="Home"></a><a accesskey="n" href="../permutation_algorithms.html"><img src="../../../../../../../../doc/html/images/next.png" alt="Next"></a>
+<a accesskey="p" href="pop_heap.html"><img src="../../../../../../../../doc/html/images/prev.png" alt="Prev"></a><a accesskey="u" href="../heap_algorithms.html"><img src="../../../../../../../../doc/html/images/up.png" alt="Up"></a><a accesskey="h" href="../../../../index.html"><img src="../../../../../../../../doc/html/images/home.png" alt="Home"></a><a accesskey="n" href="sort_heap.html"><img src="../../../../../../../../doc/html/images/next.png" alt="Next"></a>
 </div>
 <div class="section" title="make_heap">
 <div class="titlepage"><div><div><h5 class="title">
@@ -28,28 +28,28 @@
           make_heap</a>
 </h5></div></div></div>
 <a name="range.reference.algorithms.heap_algorithms.make_heap.prototype"></a><h6>
-<a name="id711672"></a>
+<a name="id3099191"></a>
             <a class="link" href="make_heap.html#range.reference.algorithms.heap_algorithms.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="keyword">void</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>
+<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>
 
 <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="keyword">void</span> <span class="identifier">make_heap</span><span class="special">(</span><span class="keyword">const</span> <span class="identifier">RandomAccessRange</span><span class="special">&amp;</span> <span class="identifier">rng</span><span class="special">);</span>
+<span class="keyword">const</span> <span class="identifier">RandomAccessRange</span><span class="special">&amp;</span> <span class="identifier">make_heap</span><span class="special">(</span><span class="keyword">const</span> <span class="identifier">RandomAccessRange</span><span class="special">&amp;</span> <span class="identifier">rng</span><span class="special">);</span>
 
 <span class="keyword">template</span><span class="special">&lt;</span><span class="keyword">class</span> <span class="identifier">RandomAccessRange</span><span class="special">,</span> <span class="keyword">class</span> <span class="identifier">Compare</span><span class="special">&gt;</span>
-<span class="keyword">void</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> <span class="identifier">Compare</span> <span class="identifier">pred</span><span class="special">);</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> <span class="identifier">Compare</span> <span class="identifier">pred</span><span class="special">);</span>
 
 <span class="keyword">template</span><span class="special">&lt;</span><span class="keyword">class</span> <span class="identifier">RandomAccessRange</span><span class="special">,</span> <span class="keyword">class</span> <span class="identifier">Compare</span><span class="special">&gt;</span>
-<span class="keyword">void</span> <span class="identifier">make_heap</span><span class="special">(</span><span class="keyword">const</span> <span class="identifier">RandomAccessRange</span><span class="special">&amp;</span> <span class="identifier">rng</span><span class="special">,</span> <span class="identifier">Compare</span> <span class="identifier">pred</span><span class="special">);</span>
+<span class="keyword">const</span> <span class="identifier">RandomAccessRange</span><span class="special">&amp;</span> <span class="identifier">make_heap</span><span class="special">(</span><span class="keyword">const</span> <span class="identifier">RandomAccessRange</span><span class="special">&amp;</span> <span class="identifier">rng</span><span class="special">,</span> <span class="identifier">Compare</span> <span class="identifier">pred</span><span class="special">);</span>
 </pre>
 <p>
           </p>
 <a name="range.reference.algorithms.heap_algorithms.make_heap.description"></a><h6>
-<a name="id712018"></a>
+<a name="id3099573"></a>
             <a class="link" href="make_heap.html#range.reference.algorithms.heap_algorithms.make_heap.description">Description</a>
           </h6>
 <p>
@@ -61,14 +61,14 @@
             the predicate versions.
           </p>
 <a name="range.reference.algorithms.heap_algorithms.make_heap.definition"></a><h6>
-<a name="id712093"></a>
+<a name="id3099653"></a>
             <a class="link" href="make_heap.html#range.reference.algorithms.heap_algorithms.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_algorithms.make_heap.requirements"></a><h6>
-<a name="id712163"></a>
+<a name="id3099726"></a>
             <a class="link" href="make_heap.html#range.reference.algorithms.heap_algorithms.make_heap.requirements">Requirements</a>
           </h6>
 <p>
@@ -119,7 +119,7 @@
             </li>
 </ul></div>
 <a name="range.reference.algorithms.heap_algorithms.make_heap.complexity"></a><h6>
-<a name="id712385"></a>
+<a name="id3099962"></a>
             <a class="link" href="make_heap.html#range.reference.algorithms.heap_algorithms.make_heap.complexity">Complexity</a>
           </h6>
 <p>
@@ -138,7 +138,7 @@
 </tr></table>
 <hr>
 <div class="spirit-nav">
-<a accesskey="p" href="pop_heap.html"><img src="../../../../../../../../doc/html/images/prev.png" alt="Prev"></a><a accesskey="u" href="../heap_algorithms.html"><img src="../../../../../../../../doc/html/images/up.png" alt="Up"></a><a accesskey="h" href="../../../../index.html"><img src="../../../../../../../../doc/html/images/home.png" alt="Home"></a><a accesskey="n" href="../permutation_algorithms.html"><img src="../../../../../../../../doc/html/images/next.png" alt="Next"></a>
+<a accesskey="p" href="pop_heap.html"><img src="../../../../../../../../doc/html/images/prev.png" alt="Prev"></a><a accesskey="u" href="../heap_algorithms.html"><img src="../../../../../../../../doc/html/images/up.png" alt="Up"></a><a accesskey="h" href="../../../../index.html"><img src="../../../../../../../../doc/html/images/home.png" alt="Home"></a><a accesskey="n" href="sort_heap.html"><img src="../../../../../../../../doc/html/images/next.png" alt="Next"></a>
 </div>
 </body>
 </html>
diff --git a/doc/html/range/reference/algorithms/heap_algorithms/pop_heap.html b/doc/html/range/reference/algorithms/heap_algorithms/pop_heap.html
index 2e45c55..3759ef1 100644
--- a/doc/html/range/reference/algorithms/heap_algorithms/pop_heap.html
+++ b/doc/html/range/reference/algorithms/heap_algorithms/pop_heap.html
@@ -3,7 +3,7 @@
 <meta http-equiv="Content-Type" content="text/html; charset=US-ASCII">
 <title>pop_heap</title>
 <link rel="stylesheet" href="../../../../../../../../doc/html/boostbook.css" type="text/css">
-<meta name="generator" content="DocBook XSL Stylesheets V1.75.2">
+<meta name="generator" content="DocBook XSL Stylesheets V1.75.1">
 <link rel="home" href="../../../../index.html" title="Chapter&#160;1.&#160;Range 2.0">
 <link rel="up" href="../heap_algorithms.html" title="Heap algorithms">
 <link rel="prev" href="push_heap.html" title="push_heap">
@@ -28,28 +28,28 @@
           pop_heap</a>
 </h5></div></div></div>
 <a name="range.reference.algorithms.heap_algorithms.pop_heap.prototype"></a><h6>
-<a name="id710726"></a>
+<a name="id3098182"></a>
             <a class="link" href="pop_heap.html#range.reference.algorithms.heap_algorithms.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="keyword">void</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>
+<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>
 
 <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="keyword">void</span> <span class="identifier">pop_heap</span><span class="special">(</span><span class="keyword">const</span> <span class="identifier">RandomAccessRange</span><span class="special">&amp;</span> <span class="identifier">rng</span><span class="special">);</span>
+<span class="keyword">const</span> <span class="identifier">RandomAccessRange</span><span class="special">&amp;</span> <span class="identifier">pop_heap</span><span class="special">(</span><span class="keyword">const</span> <span class="identifier">RandomAccessRange</span><span class="special">&amp;</span> <span class="identifier">rng</span><span class="special">);</span>
 
 <span class="keyword">template</span><span class="special">&lt;</span><span class="keyword">class</span> <span class="identifier">RandomAccessRange</span><span class="special">,</span> <span class="keyword">class</span> <span class="identifier">Compare</span><span class="special">&gt;</span>
-<span class="keyword">void</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> <span class="identifier">Compare</span> <span class="identifier">pred</span><span class="special">);</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> <span class="identifier">Compare</span> <span class="identifier">pred</span><span class="special">);</span>
 
 <span class="keyword">template</span><span class="special">&lt;</span><span class="keyword">class</span> <span class="identifier">RandomAccessRange</span><span class="special">,</span> <span class="keyword">class</span> <span class="identifier">Compare</span><span class="special">&gt;</span>
-<span class="keyword">void</span> <span class="identifier">pop_heap</span><span class="special">(</span><span class="keyword">const</span> <span class="identifier">RandomAccessRange</span><span class="special">&amp;</span> <span class="identifier">rng</span><span class="special">,</span> <span class="identifier">Compare</span> <span class="identifier">pred</span><span class="special">);</span>
+<span class="keyword">const</span> <span class="identifier">RandomAccessRange</span><span class="special">&amp;</span> <span class="identifier">pop_heap</span><span class="special">(</span><span class="keyword">const</span> <span class="identifier">RandomAccessRange</span><span class="special">&amp;</span> <span class="identifier">rng</span><span class="special">,</span> <span class="identifier">Compare</span> <span class="identifier">pred</span><span class="special">);</span>
 </pre>
 <p>
           </p>
 <a name="range.reference.algorithms.heap_algorithms.pop_heap.description"></a><h6>
-<a name="id711072"></a>
+<a name="id3098562"></a>
             <a class="link" href="pop_heap.html#range.reference.algorithms.heap_algorithms.pop_heap.description">Description</a>
           </h6>
 <p>
@@ -63,14 +63,14 @@
             the predicate versions.
           </p>
 <a name="range.reference.algorithms.heap_algorithms.pop_heap.definition"></a><h6>
-<a name="id711226"></a>
+<a name="id3098722"></a>
             <a class="link" href="pop_heap.html#range.reference.algorithms.heap_algorithms.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_algorithms.pop_heap.requirements"></a><h6>
-<a name="id711296"></a>
+<a name="id3098795"></a>
             <a class="link" href="pop_heap.html#range.reference.algorithms.heap_algorithms.pop_heap.requirements">Requirements</a>
           </h6>
 <p>
@@ -121,7 +121,7 @@
             </li>
 </ul></div>
 <a name="range.reference.algorithms.heap_algorithms.pop_heap.precondition_"></a><h6>
-<a name="id711519"></a>
+<a name="id3099031"></a>
             <a class="link" href="pop_heap.html#range.reference.algorithms.heap_algorithms.pop_heap.precondition_">Precondition:</a>
           </h6>
 <div class="itemizedlist"><ul class="itemizedlist" type="disc">
@@ -131,7 +131,7 @@
             </li>
 </ul></div>
 <a name="range.reference.algorithms.heap_algorithms.pop_heap.complexity"></a><h6>
-<a name="id711588"></a>
+<a name="id3099102"></a>
             <a class="link" href="pop_heap.html#range.reference.algorithms.heap_algorithms.pop_heap.complexity">Complexity</a>
           </h6>
 <p>
diff --git a/doc/html/range/reference/algorithms/heap_algorithms/push_heap.html b/doc/html/range/reference/algorithms/heap_algorithms/push_heap.html
index 9bcf219..9857d21 100644
--- a/doc/html/range/reference/algorithms/heap_algorithms/push_heap.html
+++ b/doc/html/range/reference/algorithms/heap_algorithms/push_heap.html
@@ -3,7 +3,7 @@
 <meta http-equiv="Content-Type" content="text/html; charset=US-ASCII">
 <title>push_heap</title>
 <link rel="stylesheet" href="../../../../../../../../doc/html/boostbook.css" type="text/css">
-<meta name="generator" content="DocBook XSL Stylesheets V1.75.2">
+<meta name="generator" content="DocBook XSL Stylesheets V1.75.1">
 <link rel="home" href="../../../../index.html" title="Chapter&#160;1.&#160;Range 2.0">
 <link rel="up" href="../heap_algorithms.html" title="Heap algorithms">
 <link rel="prev" href="../heap_algorithms.html" title="Heap algorithms">
@@ -28,28 +28,28 @@
           push_heap</a>
 </h5></div></div></div>
 <a name="range.reference.algorithms.heap_algorithms.push_heap.prototype"></a><h6>
-<a name="id709740"></a>
+<a name="id3097132"></a>
             <a class="link" href="push_heap.html#range.reference.algorithms.heap_algorithms.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="keyword">void</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>
+<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>
 
 <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="keyword">void</span> <span class="identifier">push_heap</span><span class="special">(</span><span class="keyword">const</span> <span class="identifier">RandomAccessRange</span><span class="special">&amp;</span> <span class="identifier">rng</span><span class="special">);</span>
+<span class="keyword">const</span> <span class="identifier">RandomAccessRange</span><span class="special">&amp;</span> <span class="identifier">push_heap</span><span class="special">(</span><span class="keyword">const</span> <span class="identifier">RandomAccessRange</span><span class="special">&amp;</span> <span class="identifier">rng</span><span class="special">);</span>
 
 <span class="keyword">template</span><span class="special">&lt;</span><span class="keyword">class</span> <span class="identifier">RandomAccessRange</span><span class="special">,</span> <span class="keyword">class</span> <span class="identifier">Compare</span><span class="special">&gt;</span>
-<span class="keyword">void</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> <span class="identifier">Compare</span> <span class="identifier">pred</span><span class="special">);</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> <span class="identifier">Compare</span> <span class="identifier">pred</span><span class="special">);</span>
 
 <span class="keyword">template</span><span class="special">&lt;</span><span class="keyword">class</span> <span class="identifier">RandomAccessRange</span><span class="special">,</span> <span class="keyword">class</span> <span class="identifier">Compare</span><span class="special">&gt;</span>
-<span class="keyword">void</span> <span class="identifier">push_heap</span><span class="special">(</span><span class="keyword">const</span> <span class="identifier">RandomAccessRange</span><span class="special">&amp;</span> <span class="identifier">rng</span><span class="special">,</span> <span class="identifier">Compare</span> <span class="identifier">pred</span><span class="special">);</span>
+<span class="keyword">const</span> <span class="identifier">RandomAccessRange</span><span class="special">&amp;</span> <span class="identifier">push_heap</span><span class="special">(</span><span class="keyword">const</span> <span class="identifier">RandomAccessRange</span><span class="special">&amp;</span> <span class="identifier">rng</span><span class="special">,</span> <span class="identifier">Compare</span> <span class="identifier">pred</span><span class="special">);</span>
 </pre>
 <p>
           </p>
 <a name="range.reference.algorithms.heap_algorithms.push_heap.description"></a><h6>
-<a name="id710087"></a>
+<a name="id3097513"></a>
             <a class="link" href="push_heap.html#range.reference.algorithms.heap_algorithms.push_heap.description">Description</a>
           </h6>
 <p>
@@ -63,14 +63,14 @@
             the predicate versions.
           </p>
 <a name="range.reference.algorithms.heap_algorithms.push_heap.definition"></a><h6>
-<a name="id710246"></a>
+<a name="id3097678"></a>
             <a class="link" href="push_heap.html#range.reference.algorithms.heap_algorithms.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_algorithms.push_heap.requirements"></a><h6>
-<a name="id710316"></a>
+<a name="id3097751"></a>
             <a class="link" href="push_heap.html#range.reference.algorithms.heap_algorithms.push_heap.requirements">Requirements</a>
           </h6>
 <p>
@@ -121,7 +121,7 @@
             </li>
 </ul></div>
 <a name="range.reference.algorithms.heap_algorithms.push_heap.precondition_"></a><h6>
-<a name="id710538"></a>
+<a name="id3097987"></a>
             <a class="link" href="push_heap.html#range.reference.algorithms.heap_algorithms.push_heap.precondition_">Precondition:</a>
           </h6>
 <div class="itemizedlist"><ul class="itemizedlist" type="disc">
@@ -131,7 +131,7 @@
             </li>
 </ul></div>
 <a name="range.reference.algorithms.heap_algorithms.push_heap.complexity"></a><h6>
-<a name="id710652"></a>
+<a name="id3098104"></a>
             <a class="link" href="push_heap.html#range.reference.algorithms.heap_algorithms.push_heap.complexity">Complexity</a>
           </h6>
 <p>
diff --git a/doc/html/range/reference/algorithms/heap_algorithms/sort_heap.html b/doc/html/range/reference/algorithms/heap_algorithms/sort_heap.html
new file mode 100644
index 0000000..c9c5746
--- /dev/null
+++ b/doc/html/range/reference/algorithms/heap_algorithms/sort_heap.html
@@ -0,0 +1,153 @@
+<html>
+<head>
+<meta http-equiv="Content-Type" content="text/html; charset=US-ASCII">
+<title>sort_heap</title>
+<link rel="stylesheet" href="../../../../../../../../doc/html/boostbook.css" type="text/css">
+<meta name="generator" content="DocBook XSL Stylesheets V1.75.1">
+<link rel="home" href="../../../../index.html" title="Chapter&#160;1.&#160;Range 2.0">
+<link rel="up" href="../heap_algorithms.html" title="Heap algorithms">
+<link rel="prev" href="make_heap.html" title="make_heap">
+<link rel="next" href="../permutation_algorithms.html" title="Permutation algorithms">
+</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="../../../../../../../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="make_heap.html"><img src="../../../../../../../../doc/html/images/prev.png" alt="Prev"></a><a accesskey="u" href="../heap_algorithms.html"><img src="../../../../../../../../doc/html/images/up.png" alt="Up"></a><a accesskey="h" href="../../../../index.html"><img src="../../../../../../../../doc/html/images/home.png" alt="Home"></a><a accesskey="n" href="../permutation_algorithms.html"><img src="../../../../../../../../doc/html/images/next.png" alt="Next"></a>
+</div>
+<div class="section" title="sort_heap">
+<div class="titlepage"><div><div><h5 class="title">
+<a name="range.reference.algorithms.heap_algorithms.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_algorithms.sort_heap.prototype"></a><h6>
+<a name="id3100042"></a>
+            <a class="link" href="sort_heap.html#range.reference.algorithms.heap_algorithms.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>
+
+<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="keyword">const</span> <span class="identifier">RandomAccessRange</span><span class="special">&amp;</span> <span class="identifier">sort_heap</span><span class="special">(</span><span class="keyword">const</span> <span class="identifier">RandomAccessRange</span><span class="special">&amp;</span> <span class="identifier">rng</span><span class="special">);</span>
+
+<span class="keyword">template</span><span class="special">&lt;</span><span class="keyword">class</span> <span class="identifier">RandomAccessRange</span><span class="special">,</span> <span class="keyword">class</span> <span class="identifier">Compare</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> <span class="identifier">Compare</span> <span class="identifier">pred</span><span class="special">);</span>
+
+<span class="keyword">template</span><span class="special">&lt;</span><span class="keyword">class</span> <span class="identifier">RandomAccessRange</span><span class="special">,</span> <span class="keyword">class</span> <span class="identifier">Compare</span><span class="special">&gt;</span>
+<span class="keyword">const</span> <span class="identifier">RandomAccessRange</span><span class="special">&amp;</span> <span class="identifier">sort_heap</span><span class="special">(</span><span class="keyword">const</span> <span class="identifier">RandomAccessRange</span><span class="special">&amp;</span> <span class="identifier">rng</span><span class="special">,</span> <span class="identifier">Compare</span> <span class="identifier">pred</span><span class="special">);</span>
+</pre>
+<p>
+          </p>
+<a name="range.reference.algorithms.heap_algorithms.sort_heap.description"></a><h6>
+<a name="id3100424"></a>
+            <a class="link" href="sort_heap.html#range.reference.algorithms.heap_algorithms.sort_heap.description">Description</a>
+          </h6>
+<p>
+            <code class="computeroutput"><span class="identifier">sort_heap</span></code> turns a heap
+            into a sorted range.
+          </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
+            by evaluating <code class="computeroutput"><span class="identifier">pred</span></code> in
+            the predicate versions.
+          </p>
+<a name="range.reference.algorithms.heap_algorithms.sort_heap.definition"></a><h6>
+<a name="id3100494"></a>
+            <a class="link" href="sort_heap.html#range.reference.algorithms.heap_algorithms.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_algorithms.sort_heap.requirements"></a><h6>
+<a name="id3100567"></a>
+            <a class="link" href="sort_heap.html#range.reference.algorithms.heap_algorithms.sort_heap.requirements">Requirements</a>
+          </h6>
+<p>
+            <span class="bold"><strong>For the non-predicate versions:</strong></span>
+          </p>
+<div class="itemizedlist"><ul class="itemizedlist" type="disc">
+<li class="listitem">
+<code class="computeroutput"><span class="identifier">RandomAccessRange</span></code> is
+              a model of the <a class="link" href="../../../concepts/random_access_range.html" title="Random Access Range">Random
+              Access Range</a> Concept.
+            </li>
+<li class="listitem">
+<code class="computeroutput"><span class="identifier">RandomAccessRange</span></code> is
+              mutable.
+            </li>
+<li class="listitem">
+<code class="computeroutput"><span class="identifier">RandomAccessRange</span></code>'s
+              value type is a model of the <code class="computeroutput"><span class="identifier">LessThanComparableConcept</span></code>.
+            </li>
+<li class="listitem">
+              The ordering of objects of type <code class="computeroutput"><span class="identifier">RandomAccessRange</span></code>'s
+              value type is a <span class="bold"><strong><span class="emphasis"><em>strict weak ordering</em></span></strong></span>,
+              as defined in the <code class="computeroutput"><span class="identifier">LessThanComparableConcept</span></code>
+              requirements.
+            </li>
+</ul></div>
+<p>
+            <span class="bold"><strong>For the predicate versions:</strong></span>
+          </p>
+<div class="itemizedlist"><ul class="itemizedlist" type="disc">
+<li class="listitem">
+<code class="computeroutput"><span class="identifier">RandomAccessRange</span></code> is
+              a model of the <a class="link" href="../../../concepts/random_access_range.html" title="Random Access Range">Random
+              Access Range</a> Concept.
+            </li>
+<li class="listitem">
+<code class="computeroutput"><span class="identifier">RandomAccessRange</span></code> is
+              mutable.
+            </li>
+<li class="listitem">
+<code class="computeroutput"><span class="identifier">Compare</span></code> is a model
+              of the <code class="computeroutput"><span class="identifier">StrictWeakOrderingConcept</span></code>.
+            </li>
+<li class="listitem">
+<code class="computeroutput"><span class="identifier">RandomAccessRange</span></code>'s
+              value type is convertible to both of <code class="computeroutput"><span class="identifier">Compare</span></code>'s
+              argument types.
+            </li>
+</ul></div>
+<a name="range.reference.algorithms.heap_algorithms.sort_heap.precondition_"></a><h6>
+<a name="id3100803"></a>
+            <a class="link" href="sort_heap.html#range.reference.algorithms.heap_algorithms.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_algorithms.sort_heap.complexity"></a><h6>
+<a name="id3100840"></a>
+            <a class="link" href="sort_heap.html#range.reference.algorithms.heap_algorithms.sort_heap.complexity">Complexity</a>
+          </h6>
+<p>
+            At most <code class="computeroutput"><span class="identifier">N</span> <span class="special">*</span>
+            <span class="identifier">log</span><span class="special">(</span><span class="identifier">N</span><span class="special">)</span></code>
+            comparisons, where <code class="computeroutput"><span class="identifier">N</span></code>
+            is <code class="computeroutput"><span class="identifier">distance</span><span class="special">(</span><span class="identifier">rng</span><span class="special">)</span></code>.
+          </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>
+        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="make_heap.html"><img src="../../../../../../../../doc/html/images/prev.png" alt="Prev"></a><a accesskey="u" href="../heap_algorithms.html"><img src="../../../../../../../../doc/html/images/up.png" alt="Up"></a><a accesskey="h" href="../../../../index.html"><img src="../../../../../../../../doc/html/images/home.png" alt="Home"></a><a accesskey="n" href="../permutation_algorithms.html"><img src="../../../../../../../../doc/html/images/next.png" alt="Next"></a>
+</div>
+</body>
+</html>
diff --git a/doc/html/range/reference/algorithms/permutation_algorithms.html b/doc/html/range/reference/algorithms/permutation_algorithms.html
index a9e2392..16bd254 100644
--- a/doc/html/range/reference/algorithms/permutation_algorithms.html
+++ b/doc/html/range/reference/algorithms/permutation_algorithms.html
@@ -3,10 +3,10 @@
 <meta http-equiv="Content-Type" content="text/html; charset=US-ASCII">
 <title>Permutation algorithms</title>
 <link rel="stylesheet" href="../../../../../../../doc/html/boostbook.css" type="text/css">
-<meta name="generator" content="DocBook XSL Stylesheets V1.75.2">
+<meta name="generator" content="DocBook XSL Stylesheets V1.75.1">
 <link rel="home" href="../../../index.html" title="Chapter&#160;1.&#160;Range 2.0">
 <link rel="up" href="../algorithms.html" title="Range Algorithm">
-<link rel="prev" href="heap_algorithms/make_heap.html" title="make_heap">
+<link rel="prev" href="heap_algorithms/sort_heap.html" title="sort_heap">
 <link rel="next" href="permutation_algorithms/next_permutation.html" title="next_permutation">
 </head>
 <body bgcolor="white" text="black" link="#0000FF" vlink="#840084" alink="#0000FF">
@@ -20,7 +20,7 @@
 </tr></table>
 <hr>
 <div class="spirit-nav">
-<a accesskey="p" href="heap_algorithms/make_heap.html"><img src="../../../../../../../doc/html/images/prev.png" alt="Prev"></a><a accesskey="u" href="../algorithms.html"><img src="../../../../../../../doc/html/images/up.png" alt="Up"></a><a accesskey="h" href="../../../index.html"><img src="../../../../../../../doc/html/images/home.png" alt="Home"></a><a accesskey="n" href="permutation_algorithms/next_permutation.html"><img src="../../../../../../../doc/html/images/next.png" alt="Next"></a>
+<a accesskey="p" href="heap_algorithms/sort_heap.html"><img src="../../../../../../../doc/html/images/prev.png" alt="Prev"></a><a accesskey="u" href="../algorithms.html"><img src="../../../../../../../doc/html/images/up.png" alt="Up"></a><a accesskey="h" href="../../../index.html"><img src="../../../../../../../doc/html/images/home.png" alt="Home"></a><a accesskey="n" href="permutation_algorithms/next_permutation.html"><img src="../../../../../../../doc/html/images/next.png" alt="Next"></a>
 </div>
 <div class="section" title="Permutation algorithms">
 <div class="titlepage"><div><div><h4 class="title">
@@ -44,7 +44,7 @@
 </tr></table>
 <hr>
 <div class="spirit-nav">
-<a accesskey="p" href="heap_algorithms/make_heap.html"><img src="../../../../../../../doc/html/images/prev.png" alt="Prev"></a><a accesskey="u" href="../algorithms.html"><img src="../../../../../../../doc/html/images/up.png" alt="Up"></a><a accesskey="h" href="../../../index.html"><img src="../../../../../../../doc/html/images/home.png" alt="Home"></a><a accesskey="n" href="permutation_algorithms/next_permutation.html"><img src="../../../../../../../doc/html/images/next.png" alt="Next"></a>
+<a accesskey="p" href="heap_algorithms/sort_heap.html"><img src="../../../../../../../doc/html/images/prev.png" alt="Prev"></a><a accesskey="u" href="../algorithms.html"><img src="../../../../../../../doc/html/images/up.png" alt="Up"></a><a accesskey="h" href="../../../index.html"><img src="../../../../../../../doc/html/images/home.png" alt="Home"></a><a accesskey="n" href="permutation_algorithms/next_permutation.html"><img src="../../../../../../../doc/html/images/next.png" alt="Next"></a>
 </div>
 </body>
 </html>
diff --git a/doc/html/range/reference/algorithms/permutation_algorithms/next_permutation.html b/doc/html/range/reference/algorithms/permutation_algorithms/next_permutation.html
index 0a212cf..8691969 100644
--- a/doc/html/range/reference/algorithms/permutation_algorithms/next_permutation.html
+++ b/doc/html/range/reference/algorithms/permutation_algorithms/next_permutation.html
@@ -3,7 +3,7 @@
 <meta http-equiv="Content-Type" content="text/html; charset=US-ASCII">
 <title>next_permutation</title>
 <link rel="stylesheet" href="../../../../../../../../doc/html/boostbook.css" type="text/css">
-<meta name="generator" content="DocBook XSL Stylesheets V1.75.2">
+<meta name="generator" content="DocBook XSL Stylesheets V1.75.1">
 <link rel="home" href="../../../../index.html" title="Chapter&#160;1.&#160;Range 2.0">
 <link rel="up" href="../permutation_algorithms.html" title="Permutation algorithms">
 <link rel="prev" href="../permutation_algorithms.html" title="Permutation algorithms">
@@ -28,28 +28,28 @@
           next_permutation</a>
 </h5></div></div></div>
 <a name="range.reference.algorithms.permutation_algorithms.next_permutation.prototype"></a><h6>
-<a name="id712479"></a>
+<a name="id3100976"></a>
             <a class="link" href="next_permutation.html#range.reference.algorithms.permutation_algorithms.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">void</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>
+<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>
 
 <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">void</span> <span class="identifier">next_permutation</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="keyword">bool</span> <span class="identifier">next_permutation</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="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">Compare</span><span class="special">&gt;</span>
-<span class="keyword">void</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> <span class="identifier">Compare</span> <span class="identifier">pred</span><span class="special">);</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> <span class="identifier">Compare</span> <span class="identifier">pred</span><span class="special">);</span>
 
 <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">Compare</span><span class="special">&gt;</span>
-<span class="keyword">void</span> <span class="identifier">next_permutation</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">Compare</span> <span class="identifier">pred</span><span class="special">);</span>
+<span class="keyword">bool</span> <span class="identifier">next_permutation</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">Compare</span> <span class="identifier">pred</span><span class="special">);</span>
 </pre>
 <p>
           </p>
 <a name="range.reference.algorithms.permutation_algorithms.next_permutation.description"></a><h6>
-<a name="id712826"></a>
+<a name="id3101328"></a>
             <a class="link" href="next_permutation.html#range.reference.algorithms.permutation_algorithms.next_permutation.description">Description</a>
           </h6>
 <p>
@@ -67,14 +67,14 @@
             the predicate versions.
           </p>
 <a name="range.reference.algorithms.permutation_algorithms.next_permutation.definition"></a><h6>
-<a name="id712925"></a>
+<a name="id3101435"></a>
             <a class="link" href="next_permutation.html#range.reference.algorithms.permutation_algorithms.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_algorithms.next_permutation.requirements"></a><h6>
-<a name="id712995"></a>
+<a name="id3101510"></a>
             <a class="link" href="next_permutation.html#range.reference.algorithms.permutation_algorithms.next_permutation.requirements">Requirements</a>
           </h6>
 <p>
@@ -125,7 +125,7 @@
             </li>
 </ul></div>
 <a name="range.reference.algorithms.permutation_algorithms.next_permutation.complexity"></a><h6>
-<a name="id713217"></a>
+<a name="id3101746"></a>
             <a class="link" href="next_permutation.html#range.reference.algorithms.permutation_algorithms.next_permutation.complexity">Complexity</a>
           </h6>
 <p>
diff --git a/doc/html/range/reference/algorithms/permutation_algorithms/prev_permutation.html b/doc/html/range/reference/algorithms/permutation_algorithms/prev_permutation.html
index 06b9d1d..2521275 100644
--- a/doc/html/range/reference/algorithms/permutation_algorithms/prev_permutation.html
+++ b/doc/html/range/reference/algorithms/permutation_algorithms/prev_permutation.html
@@ -3,7 +3,7 @@
 <meta http-equiv="Content-Type" content="text/html; charset=US-ASCII">
 <title>prev_permutation</title>
 <link rel="stylesheet" href="../../../../../../../../doc/html/boostbook.css" type="text/css">
-<meta name="generator" content="DocBook XSL Stylesheets V1.75.2">
+<meta name="generator" content="DocBook XSL Stylesheets V1.75.1">
 <link rel="home" href="../../../../index.html" title="Chapter&#160;1.&#160;Range 2.0">
 <link rel="up" href="../permutation_algorithms.html" title="Permutation algorithms">
 <link rel="prev" href="next_permutation.html" title="next_permutation">
@@ -28,28 +28,28 @@
           prev_permutation</a>
 </h5></div></div></div>
 <a name="range.reference.algorithms.permutation_algorithms.prev_permutation.prototype"></a><h6>
-<a name="id713296"></a>
+<a name="id3101830"></a>
             <a class="link" href="prev_permutation.html#range.reference.algorithms.permutation_algorithms.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">void</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>
+<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>
 
 <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">void</span> <span class="identifier">prev_permutation</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="keyword">bool</span> <span class="identifier">prev_permutation</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="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">Compare</span><span class="special">&gt;</span>
-<span class="keyword">void</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> <span class="identifier">Compare</span> <span class="identifier">pred</span><span class="special">);</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> <span class="identifier">Compare</span> <span class="identifier">pred</span><span class="special">);</span>
 
 <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">Compare</span><span class="special">&gt;</span>
-<span class="keyword">void</span> <span class="identifier">prev_permutation</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">Compare</span> <span class="identifier">pred</span><span class="special">);</span>
+<span class="keyword">bool</span> <span class="identifier">prev_permutation</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">Compare</span> <span class="identifier">pred</span><span class="special">);</span>
 </pre>
 <p>
           </p>
 <a name="range.reference.algorithms.permutation_algorithms.prev_permutation.description"></a><h6>
-<a name="id713642"></a>
+<a name="id3102182"></a>
             <a class="link" href="prev_permutation.html#range.reference.algorithms.permutation_algorithms.prev_permutation.description">Description</a>
           </h6>
 <p>
@@ -67,14 +67,14 @@
             the predicate versions.
           </p>
 <a name="range.reference.algorithms.permutation_algorithms.prev_permutation.definition"></a><h6>
-<a name="id713741"></a>
+<a name="id3102290"></a>
             <a class="link" href="prev_permutation.html#range.reference.algorithms.permutation_algorithms.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_algorithms.prev_permutation.requirements"></a><h6>
-<a name="id713812"></a>
+<a name="id3102364"></a>
             <a class="link" href="prev_permutation.html#range.reference.algorithms.permutation_algorithms.prev_permutation.requirements">Requirements</a>
           </h6>
 <p>
@@ -125,7 +125,7 @@
             </li>
 </ul></div>
 <a name="range.reference.algorithms.permutation_algorithms.prev_permutation.complexity"></a><h6>
-<a name="id714034"></a>
+<a name="id3102600"></a>
             <a class="link" href="prev_permutation.html#range.reference.algorithms.permutation_algorithms.prev_permutation.complexity">Complexity</a>
           </h6>
 <p>
diff --git a/doc/html/range/reference/algorithms/range_algorithm_introduction.html b/doc/html/range/reference/algorithms/range_algorithm_introduction.html
index f0aa6c4..9f15ed5 100644
--- a/doc/html/range/reference/algorithms/range_algorithm_introduction.html
+++ b/doc/html/range/reference/algorithms/range_algorithm_introduction.html
@@ -3,7 +3,7 @@
 <meta http-equiv="Content-Type" content="text/html; charset=US-ASCII">
 <title>Introduction and motivation</title>
 <link rel="stylesheet" href="../../../../../../../doc/html/boostbook.css" type="text/css">
-<meta name="generator" content="DocBook XSL Stylesheets V1.75.2">
+<meta name="generator" content="DocBook XSL Stylesheets V1.75.1">
 <link rel="home" href="../../../index.html" title="Chapter&#160;1.&#160;Range 2.0">
 <link rel="up" href="../algorithms.html" title="Range Algorithm">
 <link rel="prev" href="../algorithms.html" title="Range Algorithm">
diff --git a/doc/html/range/reference/algorithms/range_algorithm_mutating_algorithms.html b/doc/html/range/reference/algorithms/range_algorithm_mutating_algorithms.html
index fcd52d1..a69db43 100644
--- a/doc/html/range/reference/algorithms/range_algorithm_mutating_algorithms.html
+++ b/doc/html/range/reference/algorithms/range_algorithm_mutating_algorithms.html
@@ -3,7 +3,7 @@
 <meta http-equiv="Content-Type" content="text/html; charset=US-ASCII">
 <title>Mutating algorithms</title>
 <link rel="stylesheet" href="../../../../../../../doc/html/boostbook.css" type="text/css">
-<meta name="generator" content="DocBook XSL Stylesheets V1.75.2">
+<meta name="generator" content="DocBook XSL Stylesheets V1.75.1">
 <link rel="home" href="../../../index.html" title="Chapter&#160;1.&#160;Range 2.0">
 <link rel="up" href="../algorithms.html" title="Range Algorithm">
 <link rel="prev" href="range_algorithm_introduction.html" title="Introduction and motivation">
@@ -34,6 +34,8 @@
           Range Algorithm - copy_backward</a></span></dt>
 <dt><span class="section"><a href="range_algorithm_mutating_algorithms/fill.html">
           Range Algorithm - fill</a></span></dt>
+<dt><span class="section"><a href="range_algorithm_mutating_algorithms/fill_n.html">
+          Range Algorithm - fill_n</a></span></dt>
 <dt><span class="section"><a href="range_algorithm_mutating_algorithms/generate.html">
           Range Algorithm - generate</a></span></dt>
 <dt><span class="section"><a href="range_algorithm_mutating_algorithms/inplace_merge.html">
diff --git a/doc/html/range/reference/algorithms/range_algorithm_mutating_algorithms/copy.html b/doc/html/range/reference/algorithms/range_algorithm_mutating_algorithms/copy.html
index e88c627..7050fd9 100644
--- a/doc/html/range/reference/algorithms/range_algorithm_mutating_algorithms/copy.html
+++ b/doc/html/range/reference/algorithms/range_algorithm_mutating_algorithms/copy.html
@@ -3,7 +3,7 @@
 <meta http-equiv="Content-Type" content="text/html; charset=US-ASCII">
 <title>Range Algorithm - copy</title>
 <link rel="stylesheet" href="../../../../../../../../doc/html/boostbook.css" type="text/css">
-<meta name="generator" content="DocBook XSL Stylesheets V1.75.2">
+<meta name="generator" content="DocBook XSL Stylesheets V1.75.1">
 <link rel="home" href="../../../../index.html" title="Chapter&#160;1.&#160;Range 2.0">
 <link rel="up" href="../range_algorithm_mutating_algorithms.html" title="Mutating algorithms">
 <link rel="prev" href="../range_algorithm_mutating_algorithms.html" title="Mutating algorithms">
@@ -28,7 +28,7 @@
           Range Algorithm - copy</a>
 </h5></div></div></div>
 <a name="range.reference.algorithms.range_algorithm_mutating_algorithms.copy.prototype"></a><h6>
-<a name="id663029"></a>
+<a name="id3048136"></a>
             <a class="link" href="copy.html#range.reference.algorithms.range_algorithm_mutating_algorithms.copy.prototype">Prototype</a>
           </h6>
 <p>
@@ -40,7 +40,7 @@
 <p>
           </p>
 <a name="range.reference.algorithms.range_algorithm_mutating_algorithms.copy.description"></a><h6>
-<a name="id663156"></a>
+<a name="id3048268"></a>
             <a class="link" href="copy.html#range.reference.algorithms.range_algorithm_mutating_algorithms.copy.description">Description</a>
           </h6>
 <p>
@@ -51,14 +51,14 @@
             <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.range_algorithm_mutating_algorithms.copy.definition"></a><h6>
-<a name="id663286"></a>
+<a name="id3048403"></a>
             <a class="link" href="copy.html#range.reference.algorithms.range_algorithm_mutating_algorithms.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.range_algorithm_mutating_algorithms.copy.requirements"></a><h6>
-<a name="id663356"></a>
+<a name="id3048477"></a>
             <a class="link" href="copy.html#range.reference.algorithms.range_algorithm_mutating_algorithms.copy.requirements">Requirements</a>
           </h6>
 <div class="itemizedlist"><ul class="itemizedlist" type="disc">
@@ -79,7 +79,7 @@
             </li>
 </ul></div>
 <a name="range.reference.algorithms.range_algorithm_mutating_algorithms.copy.precondition_"></a><h6>
-<a name="id663457"></a>
+<a name="id3048588"></a>
             <a class="link" href="copy.html#range.reference.algorithms.range_algorithm_mutating_algorithms.copy.precondition_">Precondition:</a>
           </h6>
 <div class="itemizedlist"><ul class="itemizedlist" type="disc">
@@ -93,7 +93,7 @@
             </li>
 </ul></div>
 <a name="range.reference.algorithms.range_algorithm_mutating_algorithms.copy.complexity"></a><h6>
-<a name="id663558"></a>
+<a name="id3048694"></a>
             <a class="link" href="copy.html#range.reference.algorithms.range_algorithm_mutating_algorithms.copy.complexity">Complexity</a>
           </h6>
 <p>
diff --git a/doc/html/range/reference/algorithms/range_algorithm_mutating_algorithms/copy_backward.html b/doc/html/range/reference/algorithms/range_algorithm_mutating_algorithms/copy_backward.html
index 14d13c6..5047d02 100644
--- a/doc/html/range/reference/algorithms/range_algorithm_mutating_algorithms/copy_backward.html
+++ b/doc/html/range/reference/algorithms/range_algorithm_mutating_algorithms/copy_backward.html
@@ -3,7 +3,7 @@
 <meta http-equiv="Content-Type" content="text/html; charset=US-ASCII">
 <title>Range Algorithm - copy_backward</title>
 <link rel="stylesheet" href="../../../../../../../../doc/html/boostbook.css" type="text/css">
-<meta name="generator" content="DocBook XSL Stylesheets V1.75.2">
+<meta name="generator" content="DocBook XSL Stylesheets V1.75.1">
 <link rel="home" href="../../../../index.html" title="Chapter&#160;1.&#160;Range 2.0">
 <link rel="up" href="../range_algorithm_mutating_algorithms.html" title="Mutating algorithms">
 <link rel="prev" href="copy.html" title="Range Algorithm - copy">
@@ -28,7 +28,7 @@
           Range Algorithm - copy_backward</a>
 </h5></div></div></div>
 <a name="range.reference.algorithms.range_algorithm_mutating_algorithms.copy_backward.prototype"></a><h6>
-<a name="id663623"></a>
+<a name="id3048766"></a>
             <a class="link" href="copy_backward.html#range.reference.algorithms.range_algorithm_mutating_algorithms.copy_backward.prototype">Prototype</a>
           </h6>
 <p>
@@ -42,7 +42,7 @@
 <p>
           </p>
 <a name="range.reference.algorithms.range_algorithm_mutating_algorithms.copy_backward.description"></a><h6>
-<a name="id663752"></a>
+<a name="id3048900"></a>
             <a class="link" href="copy_backward.html#range.reference.algorithms.range_algorithm_mutating_algorithms.copy_backward.description">Description</a>
           </h6>
 <p>
@@ -60,14 +60,14 @@
             denotes the <span class="bold"><strong>end</strong></span> of the output sequence.
           </p>
 <a name="range.reference.algorithms.range_algorithm_mutating_algorithms.copy_backward.definition"></a><h6>
-<a name="id663905"></a>
+<a name="id3049060"></a>
             <a class="link" href="copy_backward.html#range.reference.algorithms.range_algorithm_mutating_algorithms.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.range_algorithm_mutating_algorithms.copy_backward.requirements"></a><h6>
-<a name="id663975"></a>
+<a name="id3049134"></a>
             <a class="link" href="copy_backward.html#range.reference.algorithms.range_algorithm_mutating_algorithms.copy_backward.requirements">Requirements</a>
           </h6>
 <div class="itemizedlist"><ul class="itemizedlist" type="disc">
@@ -88,7 +88,7 @@
             </li>
 </ul></div>
 <a name="range.reference.algorithms.range_algorithm_mutating_algorithms.copy_backward.precondition_"></a><h6>
-<a name="id664078"></a>
+<a name="id3049245"></a>
             <a class="link" href="copy_backward.html#range.reference.algorithms.range_algorithm_mutating_algorithms.copy_backward.precondition_">Precondition:</a>
           </h6>
 <div class="itemizedlist"><ul class="itemizedlist" type="disc">
@@ -102,7 +102,7 @@
             </li>
 </ul></div>
 <a name="range.reference.algorithms.range_algorithm_mutating_algorithms.copy_backward.complexity"></a><h6>
-<a name="id664178"></a>
+<a name="id3049352"></a>
             <a class="link" href="copy_backward.html#range.reference.algorithms.range_algorithm_mutating_algorithms.copy_backward.complexity">Complexity</a>
           </h6>
 <p>
diff --git a/doc/html/range/reference/algorithms/range_algorithm_mutating_algorithms/fill.html b/doc/html/range/reference/algorithms/range_algorithm_mutating_algorithms/fill.html
index f28518c..30c1bc4 100644
--- a/doc/html/range/reference/algorithms/range_algorithm_mutating_algorithms/fill.html
+++ b/doc/html/range/reference/algorithms/range_algorithm_mutating_algorithms/fill.html
@@ -3,11 +3,11 @@
 <meta http-equiv="Content-Type" content="text/html; charset=US-ASCII">
 <title>Range Algorithm - fill</title>
 <link rel="stylesheet" href="../../../../../../../../doc/html/boostbook.css" type="text/css">
-<meta name="generator" content="DocBook XSL Stylesheets V1.75.2">
+<meta name="generator" content="DocBook XSL Stylesheets V1.75.1">
 <link rel="home" href="../../../../index.html" title="Chapter&#160;1.&#160;Range 2.0">
 <link rel="up" href="../range_algorithm_mutating_algorithms.html" title="Mutating algorithms">
 <link rel="prev" href="copy_backward.html" title="Range Algorithm - copy_backward">
-<link rel="next" href="generate.html" title="Range Algorithm - generate">
+<link rel="next" href="fill_n.html" title="Range Algorithm - fill_n">
 </head>
 <body bgcolor="white" text="black" link="#0000FF" vlink="#840084" alink="#0000FF">
 <table cellpadding="2" width="100%"><tr>
@@ -20,7 +20,7 @@
 </tr></table>
 <hr>
 <div class="spirit-nav">
-<a accesskey="p" href="copy_backward.html"><img src="../../../../../../../../doc/html/images/prev.png" alt="Prev"></a><a accesskey="u" href="../range_algorithm_mutating_algorithms.html"><img src="../../../../../../../../doc/html/images/up.png" alt="Up"></a><a accesskey="h" href="../../../../index.html"><img src="../../../../../../../../doc/html/images/home.png" alt="Home"></a><a accesskey="n" href="generate.html"><img src="../../../../../../../../doc/html/images/next.png" alt="Next"></a>
+<a accesskey="p" href="copy_backward.html"><img src="../../../../../../../../doc/html/images/prev.png" alt="Prev"></a><a accesskey="u" href="../range_algorithm_mutating_algorithms.html"><img src="../../../../../../../../doc/html/images/up.png" alt="Up"></a><a accesskey="h" href="../../../../index.html"><img src="../../../../../../../../doc/html/images/home.png" alt="Home"></a><a accesskey="n" href="fill_n.html"><img src="../../../../../../../../doc/html/images/next.png" alt="Next"></a>
 </div>
 <div class="section" title="Range Algorithm - fill">
 <div class="titlepage"><div><div><h5 class="title">
@@ -28,22 +28,19 @@
           Range Algorithm - fill</a>
 </h5></div></div></div>
 <a name="range.reference.algorithms.range_algorithm_mutating_algorithms.fill.prototype"></a><h6>
-<a name="id664244"></a>
+<a name="id3049424"></a>
             <a class="link" href="fill.html#range.reference.algorithms.range_algorithm_mutating_algorithms.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="keyword">void</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>
-
-<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">void</span> <span class="identifier">fill</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">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.range_algorithm_mutating_algorithms.fill.description"></a><h6>
-<a name="id664488"></a>
+<a name="id3049568"></a>
             <a class="link" href="fill.html#range.reference.algorithms.range_algorithm_mutating_algorithms.fill.description">Description</a>
           </h6>
 <p>
@@ -52,14 +49,14 @@
             in the range <code class="computeroutput"><span class="identifier">rng</span></code>.
           </p>
 <a name="range.reference.algorithms.range_algorithm_mutating_algorithms.fill.definition"></a><h6>
-<a name="id664544"></a>
+<a name="id3049627"></a>
             <a class="link" href="fill.html#range.reference.algorithms.range_algorithm_mutating_algorithms.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.range_algorithm_mutating_algorithms.fill.requirements"></a><h6>
-<a name="id664614"></a>
+<a name="id3049701"></a>
             <a class="link" href="fill.html#range.reference.algorithms.range_algorithm_mutating_algorithms.fill.requirements">Requirements</a>
           </h6>
 <div class="itemizedlist"><ul class="itemizedlist" type="disc">
@@ -82,7 +79,7 @@
             </li>
 </ul></div>
 <a name="range.reference.algorithms.range_algorithm_mutating_algorithms.fill.complexity"></a><h6>
-<a name="id664723"></a>
+<a name="id3049816"></a>
             <a class="link" href="fill.html#range.reference.algorithms.range_algorithm_mutating_algorithms.fill.complexity">Complexity</a>
           </h6>
 <p>
@@ -99,7 +96,7 @@
 </tr></table>
 <hr>
 <div class="spirit-nav">
-<a accesskey="p" href="copy_backward.html"><img src="../../../../../../../../doc/html/images/prev.png" alt="Prev"></a><a accesskey="u" href="../range_algorithm_mutating_algorithms.html"><img src="../../../../../../../../doc/html/images/up.png" alt="Up"></a><a accesskey="h" href="../../../../index.html"><img src="../../../../../../../../doc/html/images/home.png" alt="Home"></a><a accesskey="n" href="generate.html"><img src="../../../../../../../../doc/html/images/next.png" alt="Next"></a>
+<a accesskey="p" href="copy_backward.html"><img src="../../../../../../../../doc/html/images/prev.png" alt="Prev"></a><a accesskey="u" href="../range_algorithm_mutating_algorithms.html"><img src="../../../../../../../../doc/html/images/up.png" alt="Up"></a><a accesskey="h" href="../../../../index.html"><img src="../../../../../../../../doc/html/images/home.png" alt="Home"></a><a accesskey="n" href="fill_n.html"><img src="../../../../../../../../doc/html/images/next.png" alt="Next"></a>
 </div>
 </body>
 </html>
diff --git a/doc/html/range/reference/algorithms/range_algorithm_mutating_algorithms/fill_n.html b/doc/html/range/reference/algorithms/range_algorithm_mutating_algorithms/fill_n.html
new file mode 100644
index 0000000..a202dea
--- /dev/null
+++ b/doc/html/range/reference/algorithms/range_algorithm_mutating_algorithms/fill_n.html
@@ -0,0 +1,102 @@
+<html>
+<head>
+<meta http-equiv="Content-Type" content="text/html; charset=US-ASCII">
+<title>Range Algorithm - fill_n</title>
+<link rel="stylesheet" href="../../../../../../../../doc/html/boostbook.css" type="text/css">
+<meta name="generator" content="DocBook XSL Stylesheets V1.75.1">
+<link rel="home" href="../../../../index.html" title="Chapter&#160;1.&#160;Range 2.0">
+<link rel="up" href="../range_algorithm_mutating_algorithms.html" title="Mutating algorithms">
+<link rel="prev" href="fill.html" title="Range Algorithm - fill">
+<link rel="next" href="generate.html" title="Range Algorithm - generate">
+</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="../../../../../../../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="fill.html"><img src="../../../../../../../../doc/html/images/prev.png" alt="Prev"></a><a accesskey="u" href="../range_algorithm_mutating_algorithms.html"><img src="../../../../../../../../doc/html/images/up.png" alt="Up"></a><a accesskey="h" href="../../../../index.html"><img src="../../../../../../../../doc/html/images/home.png" alt="Home"></a><a accesskey="n" href="generate.html"><img src="../../../../../../../../doc/html/images/next.png" alt="Next"></a>
+</div>
+<div class="section" title="Range Algorithm - fill_n">
+<div class="titlepage"><div><div><h5 class="title">
+<a name="range.reference.algorithms.range_algorithm_mutating_algorithms.fill_n"></a><a class="link" href="fill_n.html" title="Range Algorithm - fill_n">
+          Range Algorithm - fill_n</a>
+</h5></div></div></div>
+<a name="range.reference.algorithms.range_algorithm_mutating_algorithms.fill_n.prototype"></a><h6>
+<a name="id3049888"></a>
+            <a class="link" href="fill_n.html#range.reference.algorithms.range_algorithm_mutating_algorithms.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.range_algorithm_mutating_algorithms.fill_n.description"></a><h6>
+<a name="id3050063"></a>
+            <a class="link" href="fill_n.html#range.reference.algorithms.range_algorithm_mutating_algorithms.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.range_algorithm_mutating_algorithms.fill_n.definition"></a><h6>
+<a name="id3050167"></a>
+            <a class="link" href="fill_n.html#range.reference.algorithms.range_algorithm_mutating_algorithms.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.range_algorithm_mutating_algorithms.fill_n.requirements"></a><h6>
+<a name="id3050241"></a>
+            <a class="link" href="fill_n.html#range.reference.algorithms.range_algorithm_mutating_algorithms.fill_n.requirements">Requirements</a>
+          </h6>
+<div class="itemizedlist"><ul class="itemizedlist" type="disc">
+<li class="listitem">
+<code class="computeroutput"><span class="identifier">ForwardRange</span></code> is a model
+              of the <a class="link" href="../../../concepts/forward_range.html" title="Forward Range">Forward Range</a>
+              Concept.
+            </li>
+<li class="listitem">
+<code class="computeroutput"><span class="identifier">ForwardRange</span></code> is mutable.
+            </li>
+<li class="listitem">
+<code class="computeroutput"><span class="identifier">Value</span></code> is a model of
+              the <code class="computeroutput"><span class="identifier">AssignableConcept</span></code>.
+            </li>
+<li class="listitem">
+<code class="computeroutput"><span class="identifier">Value</span></code> is convertible
+              to <code class="computeroutput"><span class="identifier">ForwardRange</span></code>'s value
+              type.
+            </li>
+</ul></div>
+<a name="range.reference.algorithms.range_algorithm_mutating_algorithms.fill_n.complexity"></a><h6>
+<a name="id3050355"></a>
+            <a class="link" href="fill_n.html#range.reference.algorithms.range_algorithm_mutating_algorithms.fill_n.complexity">Complexity</a>
+          </h6>
+<p>
+            Linear. Exactly <code class="computeroutput"><span class="identifier">n</span></code> assignments
+            are performed.
+          </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>
+        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="fill.html"><img src="../../../../../../../../doc/html/images/prev.png" alt="Prev"></a><a accesskey="u" href="../range_algorithm_mutating_algorithms.html"><img src="../../../../../../../../doc/html/images/up.png" alt="Up"></a><a accesskey="h" href="../../../../index.html"><img src="../../../../../../../../doc/html/images/home.png" alt="Home"></a><a accesskey="n" href="generate.html"><img src="../../../../../../../../doc/html/images/next.png" alt="Next"></a>
+</div>
+</body>
+</html>
diff --git a/doc/html/range/reference/algorithms/range_algorithm_mutating_algorithms/generate.html b/doc/html/range/reference/algorithms/range_algorithm_mutating_algorithms/generate.html
index 68efa6a..a76b480 100644
--- a/doc/html/range/reference/algorithms/range_algorithm_mutating_algorithms/generate.html
+++ b/doc/html/range/reference/algorithms/range_algorithm_mutating_algorithms/generate.html
@@ -3,10 +3,10 @@
 <meta http-equiv="Content-Type" content="text/html; charset=US-ASCII">
 <title>Range Algorithm - generate</title>
 <link rel="stylesheet" href="../../../../../../../../doc/html/boostbook.css" type="text/css">
-<meta name="generator" content="DocBook XSL Stylesheets V1.75.2">
+<meta name="generator" content="DocBook XSL Stylesheets V1.75.1">
 <link rel="home" href="../../../../index.html" title="Chapter&#160;1.&#160;Range 2.0">
 <link rel="up" href="../range_algorithm_mutating_algorithms.html" title="Mutating algorithms">
-<link rel="prev" href="fill.html" title="Range Algorithm - fill">
+<link rel="prev" href="fill_n.html" title="Range Algorithm - fill_n">
 <link rel="next" href="inplace_merge.html" title="Range Algorithm - inplace_merge">
 </head>
 <body bgcolor="white" text="black" link="#0000FF" vlink="#840084" alink="#0000FF">
@@ -20,7 +20,7 @@
 </tr></table>
 <hr>
 <div class="spirit-nav">
-<a accesskey="p" href="fill.html"><img src="../../../../../../../../doc/html/images/prev.png" alt="Prev"></a><a accesskey="u" href="../range_algorithm_mutating_algorithms.html"><img src="../../../../../../../../doc/html/images/up.png" alt="Up"></a><a accesskey="h" href="../../../../index.html"><img src="../../../../../../../../doc/html/images/home.png" alt="Home"></a><a accesskey="n" href="inplace_merge.html"><img src="../../../../../../../../doc/html/images/next.png" alt="Next"></a>
+<a accesskey="p" href="fill_n.html"><img src="../../../../../../../../doc/html/images/prev.png" alt="Prev"></a><a accesskey="u" href="../range_algorithm_mutating_algorithms.html"><img src="../../../../../../../../doc/html/images/up.png" alt="Up"></a><a accesskey="h" href="../../../../index.html"><img src="../../../../../../../../doc/html/images/home.png" alt="Home"></a><a accesskey="n" href="inplace_merge.html"><img src="../../../../../../../../doc/html/images/next.png" alt="Next"></a>
 </div>
 <div class="section" title="Range Algorithm - generate">
 <div class="titlepage"><div><div><h5 class="title">
@@ -28,7 +28,7 @@
           Range Algorithm - generate</a>
 </h5></div></div></div>
 <a name="range.reference.algorithms.range_algorithm_mutating_algorithms.generate.prototype"></a><h6>
-<a name="id664786"></a>
+<a name="id3050413"></a>
             <a class="link" href="generate.html#range.reference.algorithms.range_algorithm_mutating_algorithms.generate.prototype">Prototype</a>
           </h6>
 <p>
@@ -43,7 +43,7 @@
 <p>
           </p>
 <a name="range.reference.algorithms.range_algorithm_mutating_algorithms.generate.description"></a><h6>
-<a name="id665026"></a>
+<a name="id3050656"></a>
             <a class="link" href="generate.html#range.reference.algorithms.range_algorithm_mutating_algorithms.generate.description">Description</a>
           </h6>
 <p>
@@ -53,14 +53,14 @@
             Returns the resultant range.
           </p>
 <a name="range.reference.algorithms.range_algorithm_mutating_algorithms.generate.definition"></a><h6>
-<a name="id665086"></a>
+<a name="id3050720"></a>
             <a class="link" href="generate.html#range.reference.algorithms.range_algorithm_mutating_algorithms.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.range_algorithm_mutating_algorithms.generate.requirements"></a><h6>
-<a name="id665155"></a>
+<a name="id3050795"></a>
             <a class="link" href="generate.html#range.reference.algorithms.range_algorithm_mutating_algorithms.generate.requirements">Requirements</a>
           </h6>
 <div class="itemizedlist"><ul class="itemizedlist" type="disc">
@@ -84,7 +84,7 @@
             </li>
 </ul></div>
 <a name="range.reference.algorithms.range_algorithm_mutating_algorithms.generate.precondition_"></a><h6>
-<a name="id665273"></a>
+<a name="id3050922"></a>
             <a class="link" href="generate.html#range.reference.algorithms.range_algorithm_mutating_algorithms.generate.precondition_">Precondition:</a>
           </h6>
 <div class="itemizedlist"><ul class="itemizedlist" type="disc">
@@ -98,7 +98,7 @@
             </li>
 </ul></div>
 <a name="range.reference.algorithms.range_algorithm_mutating_algorithms.generate.complexity"></a><h6>
-<a name="id665374"></a>
+<a name="id3051028"></a>
             <a class="link" href="generate.html#range.reference.algorithms.range_algorithm_mutating_algorithms.generate.complexity">Complexity</a>
           </h6>
 <p>
@@ -115,7 +115,7 @@
 </tr></table>
 <hr>
 <div class="spirit-nav">
-<a accesskey="p" href="fill.html"><img src="../../../../../../../../doc/html/images/prev.png" alt="Prev"></a><a accesskey="u" href="../range_algorithm_mutating_algorithms.html"><img src="../../../../../../../../doc/html/images/up.png" alt="Up"></a><a accesskey="h" href="../../../../index.html"><img src="../../../../../../../../doc/html/images/home.png" alt="Home"></a><a accesskey="n" href="inplace_merge.html"><img src="../../../../../../../../doc/html/images/next.png" alt="Next"></a>
+<a accesskey="p" href="fill_n.html"><img src="../../../../../../../../doc/html/images/prev.png" alt="Prev"></a><a accesskey="u" href="../range_algorithm_mutating_algorithms.html"><img src="../../../../../../../../doc/html/images/up.png" alt="Up"></a><a accesskey="h" href="../../../../index.html"><img src="../../../../../../../../doc/html/images/home.png" alt="Home"></a><a accesskey="n" href="inplace_merge.html"><img src="../../../../../../../../doc/html/images/next.png" alt="Next"></a>
 </div>
 </body>
 </html>
diff --git a/doc/html/range/reference/algorithms/range_algorithm_mutating_algorithms/inplace_merge.html b/doc/html/range/reference/algorithms/range_algorithm_mutating_algorithms/inplace_merge.html
index 46ef629..e0aa7fc 100644
--- a/doc/html/range/reference/algorithms/range_algorithm_mutating_algorithms/inplace_merge.html
+++ b/doc/html/range/reference/algorithms/range_algorithm_mutating_algorithms/inplace_merge.html
@@ -3,7 +3,7 @@
 <meta http-equiv="Content-Type" content="text/html; charset=US-ASCII">
 <title>Range Algorithm - inplace_merge</title>
 <link rel="stylesheet" href="../../../../../../../../doc/html/boostbook.css" type="text/css">
-<meta name="generator" content="DocBook XSL Stylesheets V1.75.2">
+<meta name="generator" content="DocBook XSL Stylesheets V1.75.1">
 <link rel="home" href="../../../../index.html" title="Chapter&#160;1.&#160;Range 2.0">
 <link rel="up" href="../range_algorithm_mutating_algorithms.html" title="Mutating algorithms">
 <link rel="prev" href="generate.html" title="Range Algorithm - generate">
@@ -28,7 +28,7 @@
           Range Algorithm - inplace_merge</a>
 </h5></div></div></div>
 <a name="range.reference.algorithms.range_algorithm_mutating_algorithms.inplace_merge.prototype"></a><h6>
-<a name="id665440"></a>
+<a name="id3051100"></a>
             <a class="link" href="inplace_merge.html#range.reference.algorithms.range_algorithm_mutating_algorithms.inplace_merge.prototype">Prototype</a>
           </h6>
 <p>
@@ -59,7 +59,7 @@
 <p>
           </p>
 <a name="range.reference.algorithms.range_algorithm_mutating_algorithms.inplace_merge.description"></a><h6>
-<a name="id665999"></a>
+<a name="id3051664"></a>
             <a class="link" href="inplace_merge.html#range.reference.algorithms.range_algorithm_mutating_algorithms.inplace_merge.description">Description</a>
           </h6>
 <p>
@@ -72,14 +72,14 @@
             input range is preserved.
           </p>
 <a name="range.reference.algorithms.range_algorithm_mutating_algorithms.inplace_merge.definition"></a><h6>
-<a name="id666216"></a>
+<a name="id3051892"></a>
             <a class="link" href="inplace_merge.html#range.reference.algorithms.range_algorithm_mutating_algorithms.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.range_algorithm_mutating_algorithms.inplace_merge.requirements"></a><h6>
-<a name="id666288"></a>
+<a name="id3051966"></a>
             <a class="link" href="inplace_merge.html#range.reference.algorithms.range_algorithm_mutating_algorithms.inplace_merge.requirements">Requirements</a>
           </h6>
 <p>
@@ -116,11 +116,11 @@
             argument types.
           </p>
 <a name="range.reference.algorithms.range_algorithm_mutating_algorithms.inplace_merge.precondition_"></a><h6>
-<a name="id666531"></a>
+<a name="id3052222"></a>
             <a class="link" href="inplace_merge.html#range.reference.algorithms.range_algorithm_mutating_algorithms.inplace_merge.precondition_">Precondition:</a>
           </h6>
 <a name="range.reference.algorithms.range_algorithm_mutating_algorithms.inplace_merge.for_the_non_predicate_version_"></a><h6>
-<a name="id666551"></a>
+<a name="id3052246"></a>
             <a class="link" href="inplace_merge.html#range.reference.algorithms.range_algorithm_mutating_algorithms.inplace_merge.for_the_non_predicate_version_">For
             the non-predicate version:</a>
           </h6>
@@ -143,7 +143,7 @@
             </li>
 </ul></div>
 <a name="range.reference.algorithms.range_algorithm_mutating_algorithms.inplace_merge.for_the_predicate_version_"></a><h6>
-<a name="id666805"></a>
+<a name="id3052508"></a>
             <a class="link" href="inplace_merge.html#range.reference.algorithms.range_algorithm_mutating_algorithms.inplace_merge.for_the_predicate_version_">For
             the predicate version:</a>
           </h6>
@@ -164,7 +164,7 @@
             </li>
 </ul></div>
 <a name="range.reference.algorithms.range_algorithm_mutating_algorithms.inplace_merge.complexity"></a><h6>
-<a name="id667078"></a>
+<a name="id3052791"></a>
             <a class="link" href="inplace_merge.html#range.reference.algorithms.range_algorithm_mutating_algorithms.inplace_merge.complexity">Complexity</a>
           </h6>
 <p>
diff --git a/doc/html/range/reference/algorithms/range_algorithm_mutating_algorithms/merge.html b/doc/html/range/reference/algorithms/range_algorithm_mutating_algorithms/merge.html
index 5747eef..e2b5d56 100644
--- a/doc/html/range/reference/algorithms/range_algorithm_mutating_algorithms/merge.html
+++ b/doc/html/range/reference/algorithms/range_algorithm_mutating_algorithms/merge.html
@@ -3,7 +3,7 @@
 <meta http-equiv="Content-Type" content="text/html; charset=US-ASCII">
 <title>Range Algorithm - merge</title>
 <link rel="stylesheet" href="../../../../../../../../doc/html/boostbook.css" type="text/css">
-<meta name="generator" content="DocBook XSL Stylesheets V1.75.2">
+<meta name="generator" content="DocBook XSL Stylesheets V1.75.1">
 <link rel="home" href="../../../../index.html" title="Chapter&#160;1.&#160;Range 2.0">
 <link rel="up" href="../range_algorithm_mutating_algorithms.html" title="Mutating algorithms">
 <link rel="prev" href="inplace_merge.html" title="Range Algorithm - inplace_merge">
@@ -28,7 +28,7 @@
           Range Algorithm - merge</a>
 </h5></div></div></div>
 <a name="range.reference.algorithms.range_algorithm_mutating_algorithms.merge.prototype"></a><h6>
-<a name="id667157"></a>
+<a name="id3052876"></a>
             <a class="link" href="merge.html#range.reference.algorithms.range_algorithm_mutating_algorithms.merge.prototype">Prototype</a>
           </h6>
 <p>
@@ -57,7 +57,7 @@
 <p>
           </p>
 <a name="range.reference.algorithms.range_algorithm_mutating_algorithms.merge.description"></a><h6>
-<a name="id667503"></a>
+<a name="id3053227"></a>
             <a class="link" href="merge.html#range.reference.algorithms.range_algorithm_mutating_algorithms.merge.description">Description</a>
           </h6>
 <p>
@@ -76,14 +76,14 @@
             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.range_algorithm_mutating_algorithms.merge.definition"></a><h6>
-<a name="id667679"></a>
+<a name="id3053411"></a>
             <a class="link" href="merge.html#range.reference.algorithms.range_algorithm_mutating_algorithms.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.range_algorithm_mutating_algorithms.merge.requirements"></a><h6>
-<a name="id667750"></a>
+<a name="id3053484"></a>
             <a class="link" href="merge.html#range.reference.algorithms.range_algorithm_mutating_algorithms.merge.requirements">Requirements</a>
           </h6>
 <p>
@@ -151,11 +151,11 @@
             </li>
 </ul></div>
 <a name="range.reference.algorithms.range_algorithm_mutating_algorithms.merge.precondition_"></a><h6>
-<a name="id668233"></a>
+<a name="id3053989"></a>
             <a class="link" href="merge.html#range.reference.algorithms.range_algorithm_mutating_algorithms.merge.precondition_">Precondition:</a>
           </h6>
 <a name="range.reference.algorithms.range_algorithm_mutating_algorithms.merge.for_the_non_predicate_version_"></a><h6>
-<a name="id668255"></a>
+<a name="id3054013"></a>
             <a class="link" href="merge.html#range.reference.algorithms.range_algorithm_mutating_algorithms.merge.for_the_non_predicate_version_">For
             the non-predicate version:</a>
           </h6>
@@ -190,7 +190,7 @@
             </li>
 </ul></div>
 <a name="range.reference.algorithms.range_algorithm_mutating_algorithms.merge.for_the_predicate_version_"></a><h6>
-<a name="id668705"></a>
+<a name="id3054474"></a>
             <a class="link" href="merge.html#range.reference.algorithms.range_algorithm_mutating_algorithms.merge.for_the_predicate_version_">For
             the predicate version:</a>
           </h6>
@@ -221,7 +221,7 @@
             </li>
 </ul></div>
 <a name="range.reference.algorithms.range_algorithm_mutating_algorithms.merge.complexity"></a><h6>
-<a name="id669178"></a>
+<a name="id3054959"></a>
             <a class="link" href="merge.html#range.reference.algorithms.range_algorithm_mutating_algorithms.merge.complexity">Complexity</a>
           </h6>
 <p>
diff --git a/doc/html/range/reference/algorithms/range_algorithm_mutating_algorithms/nth_element.html b/doc/html/range/reference/algorithms/range_algorithm_mutating_algorithms/nth_element.html
index 75f8d71..5b42602 100644
--- a/doc/html/range/reference/algorithms/range_algorithm_mutating_algorithms/nth_element.html
+++ b/doc/html/range/reference/algorithms/range_algorithm_mutating_algorithms/nth_element.html
@@ -3,7 +3,7 @@
 <meta http-equiv="Content-Type" content="text/html; charset=US-ASCII">
 <title>Range Algorithm - nth_element</title>
 <link rel="stylesheet" href="../../../../../../../../doc/html/boostbook.css" type="text/css">
-<meta name="generator" content="DocBook XSL Stylesheets V1.75.2">
+<meta name="generator" content="DocBook XSL Stylesheets V1.75.1">
 <link rel="home" href="../../../../index.html" title="Chapter&#160;1.&#160;Range 2.0">
 <link rel="up" href="../range_algorithm_mutating_algorithms.html" title="Mutating algorithms">
 <link rel="prev" href="merge.html" title="Range Algorithm - merge">
@@ -28,34 +28,38 @@
           Range Algorithm - nth_element</a>
 </h5></div></div></div>
 <a name="range.reference.algorithms.range_algorithm_mutating_algorithms.nth_element.prototype"></a><h6>
-<a name="id669302"></a>
+<a name="id3055090"></a>
             <a class="link" href="nth_element.html#range.reference.algorithms.range_algorithm_mutating_algorithms.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="keyword">void</span> <span class="identifier">nth_element</span><span class="special">(</span><span class="identifier">RandomAccessRange</span><span class="special">&amp;</span> <span class="identifier">rng</span><span class="special">,</span>
-                 <span class="keyword">typename</span> <span class="identifier">range_iterator</span><span class="special">&lt;</span><span class="identifier">RandomAccessRange</span><span class="special">&gt;::</span><span class="identifier">type</span> <span class="identifier">nth</span><span class="special">);</span>
-                 
+<span class="identifier">RandomAccessRange</span><span class="special">&amp;</span> <span class="identifier">nth_element</span><span class="special">(</span>
+    <span class="identifier">RandomAccessRange</span><span class="special">&amp;</span> <span class="identifier">rng</span><span class="special">,</span>
+    <span class="keyword">typename</span> <span class="identifier">range_iterator</span><span class="special">&lt;</span><span class="identifier">RandomAccessRange</span><span class="special">&gt;::</span><span class="identifier">type</span> <span class="identifier">nth</span><span class="special">);</span>
+
 <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="keyword">void</span> <span class="identifier">nth_element</span><span class="special">(</span><span class="keyword">const</span> <span class="identifier">RandomAccessRange</span><span class="special">&amp;</span> <span class="identifier">rng</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">RandomAccessRange</span><span class="special">&gt;::</span><span class="identifier">type</span> <span class="identifier">nth</span><span class="special">);</span>
-                 
+<span class="keyword">const</span> <span class="identifier">RandomAccessRange</span><span class="special">&amp;</span> <span class="identifier">nth_element</span><span class="special">(</span>
+    <span class="keyword">const</span> <span class="identifier">RandomAccessRange</span><span class="special">&amp;</span> <span class="identifier">rng</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">RandomAccessRange</span><span class="special">&gt;::</span><span class="identifier">type</span> <span class="identifier">nth</span><span class="special">);</span>
+
 <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="keyword">void</span> <span class="identifier">nth_element</span><span class="special">(</span><span class="identifier">RandomAccessRange</span><span class="special">&amp;</span> <span class="identifier">rng</span><span class="special">,</span>
-                 <span class="keyword">typename</span> <span class="identifier">range_iterator</span><span class="special">&lt;</span><span class="identifier">RandomAccessRange</span><span class="special">&gt;::</span><span class="identifier">type</span> <span class="identifier">nth</span><span class="special">,</span>
-                 <span class="identifier">BinaryPredicate</span> <span class="identifier">sort_pred</span><span class="special">);</span>
-                 
+<span class="identifier">RandomAccessRange</span><span class="special">&amp;</span> <span class="identifier">nth_element</span><span class="special">(</span>
+    <span class="identifier">RandomAccessRange</span><span class="special">&amp;</span> <span class="identifier">rng</span><span class="special">,</span>
+    <span class="keyword">typename</span> <span class="identifier">range_iterator</span><span class="special">&lt;</span><span class="identifier">RandomAccessRange</span><span class="special">&gt;::</span><span class="identifier">type</span> <span class="identifier">nth</span><span class="special">,</span>
+    <span class="identifier">BinaryPredicate</span> <span class="identifier">sort_pred</span><span class="special">);</span>
+
 <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="keyword">void</span> <span class="identifier">nth_element</span><span class="special">(</span><span class="keyword">const</span> <span class="identifier">RandomAccessRange</span><span class="special">&amp;</span> <span class="identifier">rng</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">RandomAccessRange</span><span class="special">&gt;::</span><span class="identifier">type</span> <span class="identifier">nth</span><span class="special">,</span>
-                 <span class="identifier">BinaryPredicate</span> <span class="identifier">sort_pred</span><span class="special">);</span>
+<span class="keyword">const</span> <span class="identifier">RandomAccessRange</span><span class="special">&amp;</span> <span class="identifier">nth_element</span><span class="special">(</span>
+    <span class="keyword">const</span> <span class="identifier">RandomAccessRange</span><span class="special">&amp;</span> <span class="identifier">rng</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">RandomAccessRange</span><span class="special">&gt;::</span><span class="identifier">type</span> <span class="identifier">nth</span><span class="special">,</span>
+    <span class="identifier">BinaryPredicate</span> <span class="identifier">sort_pred</span><span class="special">);</span>
 </pre>
 <p>
           </p>
 <a name="range.reference.algorithms.range_algorithm_mutating_algorithms.nth_element.description"></a><h6>
-<a name="id669789"></a>
+<a name="id3055618"></a>
             <a class="link" href="nth_element.html#range.reference.algorithms.range_algorithm_mutating_algorithms.nth_element.description">Description</a>
           </h6>
 <p>
@@ -66,14 +70,14 @@
             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.range_algorithm_mutating_algorithms.nth_element.definition"></a><h6>
-<a name="id669866"></a>
+<a name="id3055700"></a>
             <a class="link" href="nth_element.html#range.reference.algorithms.range_algorithm_mutating_algorithms.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.range_algorithm_mutating_algorithms.nth_element.requirements"></a><h6>
-<a name="id669937"></a>
+<a name="id3055775"></a>
             <a class="link" href="nth_element.html#range.reference.algorithms.range_algorithm_mutating_algorithms.nth_element.requirements">Requirements</a>
           </h6>
 <p>
@@ -124,7 +128,7 @@
             </li>
 </ul></div>
 <a name="range.reference.algorithms.range_algorithm_mutating_algorithms.nth_element.complexity"></a><h6>
-<a name="id670160"></a>
+<a name="id3056012"></a>
             <a class="link" href="nth_element.html#range.reference.algorithms.range_algorithm_mutating_algorithms.nth_element.complexity">Complexity</a>
           </h6>
 <p>
diff --git a/doc/html/range/reference/algorithms/range_algorithm_mutating_algorithms/partial_sort.html b/doc/html/range/reference/algorithms/range_algorithm_mutating_algorithms/partial_sort.html
index 1112ef2..a202f53 100644
--- a/doc/html/range/reference/algorithms/range_algorithm_mutating_algorithms/partial_sort.html
+++ b/doc/html/range/reference/algorithms/range_algorithm_mutating_algorithms/partial_sort.html
@@ -3,7 +3,7 @@
 <meta http-equiv="Content-Type" content="text/html; charset=US-ASCII">
 <title>Range Algorithm - partial_sort</title>
 <link rel="stylesheet" href="../../../../../../../../doc/html/boostbook.css" type="text/css">
-<meta name="generator" content="DocBook XSL Stylesheets V1.75.2">
+<meta name="generator" content="DocBook XSL Stylesheets V1.75.1">
 <link rel="home" href="../../../../index.html" title="Chapter&#160;1.&#160;Range 2.0">
 <link rel="up" href="../range_algorithm_mutating_algorithms.html" title="Mutating algorithms">
 <link rel="prev" href="nth_element.html" title="Range Algorithm - nth_element">
@@ -28,34 +28,38 @@
           Range Algorithm - partial_sort</a>
 </h5></div></div></div>
 <a name="range.reference.algorithms.range_algorithm_mutating_algorithms.partial_sort.prototype"></a><h6>
-<a name="id670225"></a>
+<a name="id3056083"></a>
             <a class="link" href="partial_sort.html#range.reference.algorithms.range_algorithm_mutating_algorithms.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="keyword">void</span> <span class="identifier">partial_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>
-                  <span class="keyword">typename</span> <span class="identifier">range_iterator</span><span class="special">&lt;</span><span class="identifier">RandomAccessRange</span><span class="special">&gt;::</span><span class="identifier">type</span> <span class="identifier">middle</span><span class="special">);</span>
-                 
+<span class="identifier">RandomAccessRange</span><span class="special">&amp;</span> <span class="identifier">partial_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>
+    <span class="keyword">typename</span> <span class="identifier">range_iterator</span><span class="special">&lt;</span><span class="identifier">RandomAccessRange</span><span class="special">&gt;::</span><span class="identifier">type</span> <span class="identifier">middle</span><span class="special">);</span>
+
 <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="keyword">void</span> <span class="identifier">partial_sort</span><span class="special">(</span><span class="keyword">const</span> <span class="identifier">RandomAccessRange</span><span class="special">&amp;</span> <span class="identifier">rng</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">RandomAccessRange</span><span class="special">&gt;::</span><span class="identifier">type</span> <span class="identifier">middle</span><span class="special">);</span>
-                 
+<span class="keyword">const</span> <span class="identifier">RandomAccessRange</span><span class="special">&amp;</span> <span class="identifier">partial_sort</span><span class="special">(</span>
+    <span class="keyword">const</span> <span class="identifier">RandomAccessRange</span><span class="special">&amp;</span> <span class="identifier">rng</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">RandomAccessRange</span><span class="special">&gt;::</span><span class="identifier">type</span> <span class="identifier">middle</span><span class="special">);</span>
+
 <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="keyword">void</span> <span class="identifier">partial_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>
-                  <span class="keyword">typename</span> <span class="identifier">range_iterator</span><span class="special">&lt;</span><span class="identifier">RandomAccessRange</span><span class="special">&gt;::</span><span class="identifier">type</span> <span class="identifier">middle</span><span class="special">,</span>
-                  <span class="identifier">BinaryPredicate</span> <span class="identifier">sort_pred</span><span class="special">);</span>
-                 
+<span class="identifier">RandomAccessRange</span><span class="special">&amp;</span> <span class="identifier">partial_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>
+    <span class="keyword">typename</span> <span class="identifier">range_iterator</span><span class="special">&lt;</span><span class="identifier">RandomAccessRange</span><span class="special">&gt;::</span><span class="identifier">type</span> <span class="identifier">middle</span><span class="special">,</span>
+    <span class="identifier">BinaryPredicate</span> <span class="identifier">sort_pred</span><span class="special">);</span>
+
 <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="keyword">void</span> <span class="identifier">partial_sort</span><span class="special">(</span><span class="keyword">const</span> <span class="identifier">RandomAccessRange</span><span class="special">&amp;</span> <span class="identifier">rng</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">RandomAccessRange</span><span class="special">&gt;::</span><span class="identifier">type</span> <span class="identifier">middle</span><span class="special">,</span>
-                  <span class="identifier">BinaryPredicate</span> <span class="identifier">sort_pred</span><span class="special">);</span>
+<span class="keyword">const</span> <span class="identifier">RandomAccessRange</span><span class="special">&amp;</span> <span class="identifier">partial_sort</span><span class="special">(</span>
+    <span class="keyword">const</span> <span class="identifier">RandomAccessRange</span><span class="special">&amp;</span> <span class="identifier">rng</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">RandomAccessRange</span><span class="special">&gt;::</span><span class="identifier">type</span> <span class="identifier">middle</span><span class="special">,</span>
+    <span class="identifier">BinaryPredicate</span> <span class="identifier">sort_pred</span><span class="special">);</span>
 </pre>
 <p>
           </p>
 <a name="range.reference.algorithms.range_algorithm_mutating_algorithms.partial_sort.description"></a><h6>
-<a name="id670711"></a>
+<a name="id3056612"></a>
             <a class="link" href="partial_sort.html#range.reference.algorithms.range_algorithm_mutating_algorithms.partial_sort.description">Description</a>
           </h6>
 <p>
@@ -71,14 +75,14 @@
             predicate instead.
           </p>
 <a name="range.reference.algorithms.range_algorithm_mutating_algorithms.partial_sort.definition"></a><h6>
-<a name="id670887"></a>
+<a name="id3056798"></a>
             <a class="link" href="partial_sort.html#range.reference.algorithms.range_algorithm_mutating_algorithms.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.range_algorithm_mutating_algorithms.partial_sort.requirements"></a><h6>
-<a name="id670959"></a>
+<a name="id3056873"></a>
             <a class="link" href="partial_sort.html#range.reference.algorithms.range_algorithm_mutating_algorithms.partial_sort.requirements">Requirements</a>
           </h6>
 <p>
@@ -129,7 +133,7 @@
             </li>
 </ul></div>
 <a name="range.reference.algorithms.range_algorithm_mutating_algorithms.partial_sort.complexity"></a><h6>
-<a name="id671180"></a>
+<a name="id3057110"></a>
             <a class="link" href="partial_sort.html#range.reference.algorithms.range_algorithm_mutating_algorithms.partial_sort.complexity">Complexity</a>
           </h6>
 <p>
diff --git a/doc/html/range/reference/algorithms/range_algorithm_mutating_algorithms/partition.html b/doc/html/range/reference/algorithms/range_algorithm_mutating_algorithms/partition.html
index 50b7b16..e2d73d7 100644
--- a/doc/html/range/reference/algorithms/range_algorithm_mutating_algorithms/partition.html
+++ b/doc/html/range/reference/algorithms/range_algorithm_mutating_algorithms/partition.html
@@ -3,7 +3,7 @@
 <meta http-equiv="Content-Type" content="text/html; charset=US-ASCII">
 <title>Range Algorithm - partition</title>
 <link rel="stylesheet" href="../../../../../../../../doc/html/boostbook.css" type="text/css">
-<meta name="generator" content="DocBook XSL Stylesheets V1.75.2">
+<meta name="generator" content="DocBook XSL Stylesheets V1.75.1">
 <link rel="home" href="../../../../index.html" title="Chapter&#160;1.&#160;Range 2.0">
 <link rel="up" href="../range_algorithm_mutating_algorithms.html" title="Mutating algorithms">
 <link rel="prev" href="partial_sort.html" title="Range Algorithm - partial_sort">
@@ -28,7 +28,7 @@
           Range Algorithm - partition</a>
 </h5></div></div></div>
 <a name="range.reference.algorithms.range_algorithm_mutating_algorithms.partition.prototype"></a><h6>
-<a name="id671298"></a>
+<a name="id3057234"></a>
             <a class="link" href="partition.html#range.reference.algorithms.range_algorithm_mutating_algorithms.partition.prototype">Prototype</a>
           </h6>
 <p>
@@ -67,7 +67,7 @@
 <p>
           </p>
 <a name="range.reference.algorithms.range_algorithm_mutating_algorithms.partition.description"></a><h6>
-<a name="id671878"></a>
+<a name="id3057821"></a>
             <a class="link" href="partition.html#range.reference.algorithms.range_algorithm_mutating_algorithms.partition.description">Description</a>
           </h6>
 <p>
@@ -81,14 +81,14 @@
             corresponds to the middle iterator.
           </p>
 <a name="range.reference.algorithms.range_algorithm_mutating_algorithms.partition.definition"></a><h6>
-<a name="id671957"></a>
+<a name="id3057908"></a>
             <a class="link" href="partition.html#range.reference.algorithms.range_algorithm_mutating_algorithms.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.range_algorithm_mutating_algorithms.partition.requirements"></a><h6>
-<a name="id672027"></a>
+<a name="id3057981"></a>
             <a class="link" href="partition.html#range.reference.algorithms.range_algorithm_mutating_algorithms.partition.requirements">Requirements</a>
           </h6>
 <div class="itemizedlist"><ul class="itemizedlist" type="disc">
@@ -108,7 +108,7 @@
             </li>
 </ul></div>
 <a name="range.reference.algorithms.range_algorithm_mutating_algorithms.partition.complexity"></a><h6>
-<a name="id672122"></a>
+<a name="id3058084"></a>
             <a class="link" href="partition.html#range.reference.algorithms.range_algorithm_mutating_algorithms.partition.complexity">Complexity</a>
           </h6>
 <p>
diff --git a/doc/html/range/reference/algorithms/range_algorithm_mutating_algorithms/random_shuffle.html b/doc/html/range/reference/algorithms/range_algorithm_mutating_algorithms/random_shuffle.html
index 023d799..64643c5 100644
--- a/doc/html/range/reference/algorithms/range_algorithm_mutating_algorithms/random_shuffle.html
+++ b/doc/html/range/reference/algorithms/range_algorithm_mutating_algorithms/random_shuffle.html
@@ -3,7 +3,7 @@
 <meta http-equiv="Content-Type" content="text/html; charset=US-ASCII">
 <title>Range Algorithm - random_shuffle</title>
 <link rel="stylesheet" href="../../../../../../../../doc/html/boostbook.css" type="text/css">
-<meta name="generator" content="DocBook XSL Stylesheets V1.75.2">
+<meta name="generator" content="DocBook XSL Stylesheets V1.75.1">
 <link rel="home" href="../../../../index.html" title="Chapter&#160;1.&#160;Range 2.0">
 <link rel="up" href="../range_algorithm_mutating_algorithms.html" title="Mutating algorithms">
 <link rel="prev" href="partition.html" title="Range Algorithm - partition">
@@ -28,7 +28,7 @@
           Range Algorithm - random_shuffle</a>
 </h5></div></div></div>
 <a name="range.reference.algorithms.range_algorithm_mutating_algorithms.random_shuffle.prototype"></a><h6>
-<a name="id672234"></a>
+<a name="id3058202"></a>
             <a class="link" href="random_shuffle.html#range.reference.algorithms.range_algorithm_mutating_algorithms.random_shuffle.prototype">Prototype</a>
           </h6>
 <p>
@@ -49,7 +49,7 @@
 <p>
           </p>
 <a name="range.reference.algorithms.range_algorithm_mutating_algorithms.random_shuffle.description"></a><h6>
-<a name="id672620"></a>
+<a name="id3058593"></a>
             <a class="link" href="random_shuffle.html#range.reference.algorithms.range_algorithm_mutating_algorithms.random_shuffle.description">Description</a>
           </h6>
 <p>
@@ -61,14 +61,14 @@
             the shuffles range.
           </p>
 <a name="range.reference.algorithms.range_algorithm_mutating_algorithms.random_shuffle.definition"></a><h6>
-<a name="id672708"></a>
+<a name="id3058689"></a>
             <a class="link" href="random_shuffle.html#range.reference.algorithms.range_algorithm_mutating_algorithms.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.range_algorithm_mutating_algorithms.random_shuffle.requirements"></a><h6>
-<a name="id672780"></a>
+<a name="id3058764"></a>
             <a class="link" href="random_shuffle.html#range.reference.algorithms.range_algorithm_mutating_algorithms.random_shuffle.requirements">Requirements</a>
           </h6>
 <p>
@@ -99,7 +99,7 @@
             </li>
 </ul></div>
 <a name="range.reference.algorithms.range_algorithm_mutating_algorithms.random_shuffle.precondition_"></a><h6>
-<a name="id672918"></a>
+<a name="id3058911"></a>
             <a class="link" href="random_shuffle.html#range.reference.algorithms.range_algorithm_mutating_algorithms.random_shuffle.precondition_">Precondition:</a>
           </h6>
 <div class="itemizedlist"><ul class="itemizedlist" type="disc"><li class="listitem">
@@ -108,7 +108,7 @@
               maximum value.
             </li></ul></div>
 <a name="range.reference.algorithms.range_algorithm_mutating_algorithms.random_shuffle.complexity"></a><h6>
-<a name="id672979"></a>
+<a name="id3058977"></a>
             <a class="link" href="random_shuffle.html#range.reference.algorithms.range_algorithm_mutating_algorithms.random_shuffle.complexity">Complexity</a>
           </h6>
 <p>
diff --git a/doc/html/range/reference/algorithms/range_algorithm_mutating_algorithms/remove.html b/doc/html/range/reference/algorithms/range_algorithm_mutating_algorithms/remove.html
index 65ab605..016b1aa 100644
--- a/doc/html/range/reference/algorithms/range_algorithm_mutating_algorithms/remove.html
+++ b/doc/html/range/reference/algorithms/range_algorithm_mutating_algorithms/remove.html
@@ -3,7 +3,7 @@
 <meta http-equiv="Content-Type" content="text/html; charset=US-ASCII">
 <title>Range Algorithm - remove</title>
 <link rel="stylesheet" href="../../../../../../../../doc/html/boostbook.css" type="text/css">
-<meta name="generator" content="DocBook XSL Stylesheets V1.75.2">
+<meta name="generator" content="DocBook XSL Stylesheets V1.75.1">
 <link rel="home" href="../../../../index.html" title="Chapter&#160;1.&#160;Range 2.0">
 <link rel="up" href="../range_algorithm_mutating_algorithms.html" title="Mutating algorithms">
 <link rel="prev" href="random_shuffle.html" title="Range Algorithm - random_shuffle">
@@ -28,7 +28,7 @@
           Range Algorithm - remove</a>
 </h5></div></div></div>
 <a name="range.reference.algorithms.range_algorithm_mutating_algorithms.remove.prototype"></a><h6>
-<a name="id673083"></a>
+<a name="id3059089"></a>
             <a class="link" href="remove.html#range.reference.algorithms.range_algorithm_mutating_algorithms.remove.prototype">Prototype</a>
           </h6>
 <p>
@@ -67,7 +67,7 @@
 <p>
           </p>
 <a name="range.reference.algorithms.range_algorithm_mutating_algorithms.remove.description"></a><h6>
-<a name="id673700"></a>
+<a name="id3059711"></a>
             <a class="link" href="remove.html#range.reference.algorithms.range_algorithm_mutating_algorithms.remove.description">Description</a>
           </h6>
 <p>
@@ -84,14 +84,14 @@
             are dereferenceable, but the elements are unspecified.
           </p>
 <a name="range.reference.algorithms.range_algorithm_mutating_algorithms.remove.definition"></a><h6>
-<a name="id673928"></a>
+<a name="id3059949"></a>
             <a class="link" href="remove.html#range.reference.algorithms.range_algorithm_mutating_algorithms.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.range_algorithm_mutating_algorithms.remove.requirements"></a><h6>
-<a name="id673998"></a>
+<a name="id3060023"></a>
             <a class="link" href="remove.html#range.reference.algorithms.range_algorithm_mutating_algorithms.remove.requirements">Requirements</a>
           </h6>
 <div class="itemizedlist"><ul class="itemizedlist" type="disc">
@@ -114,7 +114,7 @@
             </li>
 </ul></div>
 <a name="range.reference.algorithms.range_algorithm_mutating_algorithms.remove.complexity"></a><h6>
-<a name="id674106"></a>
+<a name="id3060139"></a>
             <a class="link" href="remove.html#range.reference.algorithms.range_algorithm_mutating_algorithms.remove.complexity">Complexity</a>
           </h6>
 <p>
diff --git a/doc/html/range/reference/algorithms/range_algorithm_mutating_algorithms/remove_if.html b/doc/html/range/reference/algorithms/range_algorithm_mutating_algorithms/remove_if.html
index 227aeb0..51cb94c 100644
--- a/doc/html/range/reference/algorithms/range_algorithm_mutating_algorithms/remove_if.html
+++ b/doc/html/range/reference/algorithms/range_algorithm_mutating_algorithms/remove_if.html
@@ -3,7 +3,7 @@
 <meta http-equiv="Content-Type" content="text/html; charset=US-ASCII">
 <title>Range Algorithm - remove_if</title>
 <link rel="stylesheet" href="../../../../../../../../doc/html/boostbook.css" type="text/css">
-<meta name="generator" content="DocBook XSL Stylesheets V1.75.2">
+<meta name="generator" content="DocBook XSL Stylesheets V1.75.1">
 <link rel="home" href="../../../../index.html" title="Chapter&#160;1.&#160;Range 2.0">
 <link rel="up" href="../range_algorithm_mutating_algorithms.html" title="Mutating algorithms">
 <link rel="prev" href="remove.html" title="Range Algorithm - remove">
@@ -28,7 +28,7 @@
           Range Algorithm - remove_if</a>
 </h5></div></div></div>
 <a name="range.reference.algorithms.range_algorithm_mutating_algorithms.remove_if.prototype"></a><h6>
-<a name="id674184"></a>
+<a name="id3060223"></a>
             <a class="link" href="remove_if.html#range.reference.algorithms.range_algorithm_mutating_algorithms.remove_if.prototype">Prototype</a>
           </h6>
 <p>
@@ -67,7 +67,7 @@
 <p>
           </p>
 <a name="range.reference.algorithms.range_algorithm_mutating_algorithms.remove_if.description"></a><h6>
-<a name="id674760"></a>
+<a name="id3060807"></a>
             <a class="link" href="remove_if.html#range.reference.algorithms.range_algorithm_mutating_algorithms.remove_if.description">Description</a>
           </h6>
 <p>
@@ -83,14 +83,14 @@
             are unspecified.
           </p>
 <a name="range.reference.algorithms.range_algorithm_mutating_algorithms.remove_if.definition"></a><h6>
-<a name="id674983"></a>
+<a name="id3061039"></a>
             <a class="link" href="remove_if.html#range.reference.algorithms.range_algorithm_mutating_algorithms.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.range_algorithm_mutating_algorithms.remove_if.requirements"></a><h6>
-<a name="id675053"></a>
+<a name="id3061113"></a>
             <a class="link" href="remove_if.html#range.reference.algorithms.range_algorithm_mutating_algorithms.remove_if.requirements">Requirements</a>
           </h6>
 <div class="itemizedlist"><ul class="itemizedlist" type="disc">
@@ -113,7 +113,7 @@
             </li>
 </ul></div>
 <a name="range.reference.algorithms.range_algorithm_mutating_algorithms.remove_if.complexity"></a><h6>
-<a name="id675161"></a>
+<a name="id3061230"></a>
             <a class="link" href="remove_if.html#range.reference.algorithms.range_algorithm_mutating_algorithms.remove_if.complexity">Complexity</a>
           </h6>
 <p>
diff --git a/doc/html/range/reference/algorithms/range_algorithm_mutating_algorithms/replace.html b/doc/html/range/reference/algorithms/range_algorithm_mutating_algorithms/replace.html
index e07aebb..dab9ee6 100644
--- a/doc/html/range/reference/algorithms/range_algorithm_mutating_algorithms/replace.html
+++ b/doc/html/range/reference/algorithms/range_algorithm_mutating_algorithms/replace.html
@@ -3,7 +3,7 @@
 <meta http-equiv="Content-Type" content="text/html; charset=US-ASCII">
 <title>Range Algorithm - replace</title>
 <link rel="stylesheet" href="../../../../../../../../doc/html/boostbook.css" type="text/css">
-<meta name="generator" content="DocBook XSL Stylesheets V1.75.2">
+<meta name="generator" content="DocBook XSL Stylesheets V1.75.1">
 <link rel="home" href="../../../../index.html" title="Chapter&#160;1.&#160;Range 2.0">
 <link rel="up" href="../range_algorithm_mutating_algorithms.html" title="Mutating algorithms">
 <link rel="prev" href="remove_if.html" title="Range Algorithm - remove_if">
@@ -28,7 +28,7 @@
           Range Algorithm - replace</a>
 </h5></div></div></div>
 <a name="range.reference.algorithms.range_algorithm_mutating_algorithms.replace.prototype"></a><h6>
-<a name="id675247"></a>
+<a name="id3061322"></a>
             <a class="link" href="replace.html#range.reference.algorithms.range_algorithm_mutating_algorithms.replace.prototype">Prototype</a>
           </h6>
 <p>
@@ -49,7 +49,7 @@
 <p>
           </p>
 <a name="range.reference.algorithms.range_algorithm_mutating_algorithms.replace.description"></a><h6>
-<a name="id675560"></a>
+<a name="id3061640"></a>
             <a class="link" href="replace.html#range.reference.algorithms.range_algorithm_mutating_algorithms.replace.description">Description</a>
           </h6>
 <p>
@@ -58,14 +58,14 @@
             Return a reference to <code class="computeroutput"><span class="identifier">rng</span></code>.
           </p>
 <a name="range.reference.algorithms.range_algorithm_mutating_algorithms.replace.definition"></a><h6>
-<a name="id675637"></a>
+<a name="id3061721"></a>
             <a class="link" href="replace.html#range.reference.algorithms.range_algorithm_mutating_algorithms.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.range_algorithm_mutating_algorithms.replace.requirements"></a><h6>
-<a name="id675707"></a>
+<a name="id3061795"></a>
             <a class="link" href="replace.html#range.reference.algorithms.range_algorithm_mutating_algorithms.replace.requirements">Requirements</a>
           </h6>
 <div class="itemizedlist"><ul class="itemizedlist" type="disc">
@@ -94,7 +94,7 @@
             </li>
 </ul></div>
 <a name="range.reference.algorithms.range_algorithm_mutating_algorithms.replace.complexity"></a><h6>
-<a name="id675850"></a>
+<a name="id3061947"></a>
             <a class="link" href="replace.html#range.reference.algorithms.range_algorithm_mutating_algorithms.replace.complexity">Complexity</a>
           </h6>
 <p>
diff --git a/doc/html/range/reference/algorithms/range_algorithm_mutating_algorithms/replace_if.html b/doc/html/range/reference/algorithms/range_algorithm_mutating_algorithms/replace_if.html
index fcf01b9..946b18c 100644
--- a/doc/html/range/reference/algorithms/range_algorithm_mutating_algorithms/replace_if.html
+++ b/doc/html/range/reference/algorithms/range_algorithm_mutating_algorithms/replace_if.html
@@ -3,7 +3,7 @@
 <meta http-equiv="Content-Type" content="text/html; charset=US-ASCII">
 <title>Range Algorithm - replace_if</title>
 <link rel="stylesheet" href="../../../../../../../../doc/html/boostbook.css" type="text/css">
-<meta name="generator" content="DocBook XSL Stylesheets V1.75.2">
+<meta name="generator" content="DocBook XSL Stylesheets V1.75.1">
 <link rel="home" href="../../../../index.html" title="Chapter&#160;1.&#160;Range 2.0">
 <link rel="up" href="../range_algorithm_mutating_algorithms.html" title="Mutating algorithms">
 <link rel="prev" href="replace.html" title="Range Algorithm - replace">
@@ -28,7 +28,7 @@
           Range Algorithm - replace_if</a>
 </h5></div></div></div>
 <a name="range.reference.algorithms.range_algorithm_mutating_algorithms.replace_if.prototype"></a><h6>
-<a name="id675952"></a>
+<a name="id3062057"></a>
             <a class="link" href="replace_if.html#range.reference.algorithms.range_algorithm_mutating_algorithms.replace_if.prototype">Prototype</a>
           </h6>
 <p>
@@ -43,7 +43,7 @@
 <p>
           </p>
 <a name="range.reference.algorithms.range_algorithm_mutating_algorithms.replace_if.description"></a><h6>
-<a name="id676272"></a>
+<a name="id3062382"></a>
             <a class="link" href="replace_if.html#range.reference.algorithms.range_algorithm_mutating_algorithms.replace_if.description">Description</a>
           </h6>
 <p>
@@ -52,14 +52,14 @@
             Returns a reference to <code class="computeroutput"><span class="identifier">rng</span></code>.
           </p>
 <a name="range.reference.algorithms.range_algorithm_mutating_algorithms.replace_if.definition"></a><h6>
-<a name="id676383"></a>
+<a name="id3062499"></a>
             <a class="link" href="replace_if.html#range.reference.algorithms.range_algorithm_mutating_algorithms.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.range_algorithm_mutating_algorithms.replace_if.requirements"></a><h6>
-<a name="id676454"></a>
+<a name="id3062574"></a>
             <a class="link" href="replace_if.html#range.reference.algorithms.range_algorithm_mutating_algorithms.replace_if.requirements">Requirements</a>
           </h6>
 <div class="itemizedlist"><ul class="itemizedlist" type="disc">
@@ -91,7 +91,7 @@
             </li>
 </ul></div>
 <a name="range.reference.algorithms.range_algorithm_mutating_algorithms.replace_if.complexity"></a><h6>
-<a name="id676612"></a>
+<a name="id3062742"></a>
             <a class="link" href="replace_if.html#range.reference.algorithms.range_algorithm_mutating_algorithms.replace_if.complexity">Complexity</a>
           </h6>
 <p>
diff --git a/doc/html/range/reference/algorithms/range_algorithm_mutating_algorithms/rotate.html b/doc/html/range/reference/algorithms/range_algorithm_mutating_algorithms/rotate.html
index e4c574f..2660663 100644
--- a/doc/html/range/reference/algorithms/range_algorithm_mutating_algorithms/rotate.html
+++ b/doc/html/range/reference/algorithms/range_algorithm_mutating_algorithms/rotate.html
@@ -3,7 +3,7 @@
 <meta http-equiv="Content-Type" content="text/html; charset=US-ASCII">
 <title>Range Algorithm - rotate</title>
 <link rel="stylesheet" href="../../../../../../../../doc/html/boostbook.css" type="text/css">
-<meta name="generator" content="DocBook XSL Stylesheets V1.75.2">
+<meta name="generator" content="DocBook XSL Stylesheets V1.75.1">
 <link rel="home" href="../../../../index.html" title="Chapter&#160;1.&#160;Range 2.0">
 <link rel="up" href="../range_algorithm_mutating_algorithms.html" title="Mutating algorithms">
 <link rel="prev" href="replace_if.html" title="Range Algorithm - replace_if">
@@ -28,7 +28,7 @@
           Range Algorithm - rotate</a>
 </h5></div></div></div>
 <a name="range.reference.algorithms.range_algorithm_mutating_algorithms.rotate.prototype"></a><h6>
-<a name="id676724"></a>
+<a name="id3062861"></a>
             <a class="link" href="rotate.html#range.reference.algorithms.range_algorithm_mutating_algorithms.rotate.prototype">Prototype</a>
           </h6>
 <p>
@@ -45,7 +45,7 @@
 <p>
           </p>
 <a name="range.reference.algorithms.range_algorithm_mutating_algorithms.rotate.description"></a><h6>
-<a name="id676981"></a>
+<a name="id3063123"></a>
             <a class="link" href="rotate.html#range.reference.algorithms.range_algorithm_mutating_algorithms.rotate.description">Description</a>
           </h6>
 <p>
@@ -54,14 +54,14 @@
             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.range_algorithm_mutating_algorithms.rotate.definition"></a><h6>
-<a name="id677102"></a>
+<a name="id3063250"></a>
             <a class="link" href="rotate.html#range.reference.algorithms.range_algorithm_mutating_algorithms.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.range_algorithm_mutating_algorithms.rotate.requirements"></a><h6>
-<a name="id677174"></a>
+<a name="id3063325"></a>
             <a class="link" href="rotate.html#range.reference.algorithms.range_algorithm_mutating_algorithms.rotate.requirements">Requirements</a>
           </h6>
 <div class="itemizedlist"><ul class="itemizedlist" type="disc">
@@ -75,7 +75,7 @@
             </li>
 </ul></div>
 <a name="range.reference.algorithms.range_algorithm_mutating_algorithms.rotate.precondition_"></a><h6>
-<a name="id677233"></a>
+<a name="id3063389"></a>
             <a class="link" href="rotate.html#range.reference.algorithms.range_algorithm_mutating_algorithms.rotate.precondition_">Precondition:</a>
           </h6>
 <div class="itemizedlist"><ul class="itemizedlist" type="disc">
@@ -87,7 +87,7 @@
             </li>
 </ul></div>
 <a name="range.reference.algorithms.range_algorithm_mutating_algorithms.rotate.complexity"></a><h6>
-<a name="id677339"></a>
+<a name="id3063500"></a>
             <a class="link" href="rotate.html#range.reference.algorithms.range_algorithm_mutating_algorithms.rotate.complexity">Complexity</a>
           </h6>
 <p>
diff --git a/doc/html/range/reference/algorithms/range_algorithm_mutating_algorithms/sort.html b/doc/html/range/reference/algorithms/range_algorithm_mutating_algorithms/sort.html
index 31adcdf..0fc2893 100644
--- a/doc/html/range/reference/algorithms/range_algorithm_mutating_algorithms/sort.html
+++ b/doc/html/range/reference/algorithms/range_algorithm_mutating_algorithms/sort.html
@@ -3,7 +3,7 @@
 <meta http-equiv="Content-Type" content="text/html; charset=US-ASCII">
 <title>Range Algorithm - sort</title>
 <link rel="stylesheet" href="../../../../../../../../doc/html/boostbook.css" type="text/css">
-<meta name="generator" content="DocBook XSL Stylesheets V1.75.2">
+<meta name="generator" content="DocBook XSL Stylesheets V1.75.1">
 <link rel="home" href="../../../../index.html" title="Chapter&#160;1.&#160;Range 2.0">
 <link rel="up" href="../range_algorithm_mutating_algorithms.html" title="Mutating algorithms">
 <link rel="prev" href="rotate.html" title="Range Algorithm - rotate">
@@ -28,7 +28,7 @@
           Range Algorithm - sort</a>
 </h5></div></div></div>
 <a name="range.reference.algorithms.range_algorithm_mutating_algorithms.sort.prototype"></a><h6>
-<a name="id677405"></a>
+<a name="id3063573"></a>
             <a class="link" href="sort.html#range.reference.algorithms.range_algorithm_mutating_algorithms.sort.prototype">Prototype</a>
           </h6>
 <p>
@@ -49,7 +49,7 @@
 <p>
           </p>
 <a name="range.reference.algorithms.range_algorithm_mutating_algorithms.sort.description"></a><h6>
-<a name="id677781"></a>
+<a name="id3063955"></a>
             <a class="link" href="sort.html#range.reference.algorithms.range_algorithm_mutating_algorithms.sort.description">Description</a>
           </h6>
 <p>
@@ -72,14 +72,14 @@
             <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.range_algorithm_mutating_algorithms.sort.definition"></a><h6>
-<a name="id678027"></a>
+<a name="id3064210"></a>
             <a class="link" href="sort.html#range.reference.algorithms.range_algorithm_mutating_algorithms.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.range_algorithm_mutating_algorithms.sort.requirements"></a><h6>
-<a name="id678098"></a>
+<a name="id3064284"></a>
             <a class="link" href="sort.html#range.reference.algorithms.range_algorithm_mutating_algorithms.sort.requirements">Requirements</a>
           </h6>
 <p>
@@ -130,7 +130,7 @@
             </li>
 </ul></div>
 <a name="range.reference.algorithms.range_algorithm_mutating_algorithms.sort.complexity"></a><h6>
-<a name="id678319"></a>
+<a name="id3064520"></a>
             <a class="link" href="sort.html#range.reference.algorithms.range_algorithm_mutating_algorithms.sort.complexity">Complexity</a>
           </h6>
 <p>
diff --git a/doc/html/range/reference/algorithms/range_algorithm_mutating_algorithms/stable_partition.html b/doc/html/range/reference/algorithms/range_algorithm_mutating_algorithms/stable_partition.html
index a549bc5..d4178a2 100644
--- a/doc/html/range/reference/algorithms/range_algorithm_mutating_algorithms/stable_partition.html
+++ b/doc/html/range/reference/algorithms/range_algorithm_mutating_algorithms/stable_partition.html
@@ -3,7 +3,7 @@
 <meta http-equiv="Content-Type" content="text/html; charset=US-ASCII">
 <title>Range Algorithm - stable_partition</title>
 <link rel="stylesheet" href="../../../../../../../../doc/html/boostbook.css" type="text/css">
-<meta name="generator" content="DocBook XSL Stylesheets V1.75.2">
+<meta name="generator" content="DocBook XSL Stylesheets V1.75.1">
 <link rel="home" href="../../../../index.html" title="Chapter&#160;1.&#160;Range 2.0">
 <link rel="up" href="../range_algorithm_mutating_algorithms.html" title="Mutating algorithms">
 <link rel="prev" href="sort.html" title="Range Algorithm - sort">
@@ -28,7 +28,7 @@
           Range Algorithm - stable_partition</a>
 </h5></div></div></div>
 <a name="range.reference.algorithms.range_algorithm_mutating_algorithms.stable_partition.prototype"></a><h6>
-<a name="id678435"></a>
+<a name="id3064641"></a>
             <a class="link" href="stable_partition.html#range.reference.algorithms.range_algorithm_mutating_algorithms.stable_partition.prototype">Prototype</a>
           </h6>
 <p>
@@ -61,7 +61,7 @@
 <p>
           </p>
 <a name="range.reference.algorithms.range_algorithm_mutating_algorithms.stable_partition.description"></a><h6>
-<a name="id679008"></a>
+<a name="id3065223"></a>
             <a class="link" href="stable_partition.html#range.reference.algorithms.range_algorithm_mutating_algorithms.stable_partition.description">Description</a>
           </h6>
 <p>
@@ -83,14 +83,14 @@
             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.range_algorithm_mutating_algorithms.stable_partition.definition"></a><h6>
-<a name="id679150"></a>
+<a name="id3065376"></a>
             <a class="link" href="stable_partition.html#range.reference.algorithms.range_algorithm_mutating_algorithms.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.range_algorithm_mutating_algorithms.stable_partition.requirements"></a><h6>
-<a name="id679221"></a>
+<a name="id3065451"></a>
             <a class="link" href="stable_partition.html#range.reference.algorithms.range_algorithm_mutating_algorithms.stable_partition.requirements">Requirements</a>
           </h6>
 <div class="itemizedlist"><ul class="itemizedlist" type="disc">
@@ -108,7 +108,7 @@
             </li>
 </ul></div>
 <a name="range.reference.algorithms.range_algorithm_mutating_algorithms.stable_partition.complexity"></a><h6>
-<a name="id679305"></a>
+<a name="id3065542"></a>
             <a class="link" href="stable_partition.html#range.reference.algorithms.range_algorithm_mutating_algorithms.stable_partition.complexity">Complexity</a>
           </h6>
 <p>
diff --git a/doc/html/range/reference/algorithms/range_algorithm_mutating_algorithms/stable_sort.html b/doc/html/range/reference/algorithms/range_algorithm_mutating_algorithms/stable_sort.html
index e02cfa3..d0e3ddf 100644
--- a/doc/html/range/reference/algorithms/range_algorithm_mutating_algorithms/stable_sort.html
+++ b/doc/html/range/reference/algorithms/range_algorithm_mutating_algorithms/stable_sort.html
@@ -3,7 +3,7 @@
 <meta http-equiv="Content-Type" content="text/html; charset=US-ASCII">
 <title>Range Algorithm - stable_sort</title>
 <link rel="stylesheet" href="../../../../../../../../doc/html/boostbook.css" type="text/css">
-<meta name="generator" content="DocBook XSL Stylesheets V1.75.2">
+<meta name="generator" content="DocBook XSL Stylesheets V1.75.1">
 <link rel="home" href="../../../../index.html" title="Chapter&#160;1.&#160;Range 2.0">
 <link rel="up" href="../range_algorithm_mutating_algorithms.html" title="Mutating algorithms">
 <link rel="prev" href="stable_partition.html" title="Range Algorithm - stable_partition">
@@ -28,7 +28,7 @@
           Range Algorithm - stable_sort</a>
 </h5></div></div></div>
 <a name="range.reference.algorithms.range_algorithm_mutating_algorithms.stable_sort.prototype"></a><h6>
-<a name="id679474"></a>
+<a name="id3065717"></a>
             <a class="link" href="stable_sort.html#range.reference.algorithms.range_algorithm_mutating_algorithms.stable_sort.prototype">Prototype</a>
           </h6>
 <p>
@@ -49,7 +49,7 @@
 <p>
           </p>
 <a name="range.reference.algorithms.range_algorithm_mutating_algorithms.stable_sort.description"></a><h6>
-<a name="id679851"></a>
+<a name="id3066100"></a>
             <a class="link" href="stable_sort.html#range.reference.algorithms.range_algorithm_mutating_algorithms.stable_sort.description">Description</a>
           </h6>
 <p>
@@ -72,14 +72,14 @@
             <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.range_algorithm_mutating_algorithms.stable_sort.definition"></a><h6>
-<a name="id680095"></a>
+<a name="id3066355"></a>
             <a class="link" href="stable_sort.html#range.reference.algorithms.range_algorithm_mutating_algorithms.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.range_algorithm_mutating_algorithms.stable_sort.requirements"></a><h6>
-<a name="id680166"></a>
+<a name="id3066430"></a>
             <a class="link" href="stable_sort.html#range.reference.algorithms.range_algorithm_mutating_algorithms.stable_sort.requirements">Requirements</a>
           </h6>
 <p>
@@ -130,7 +130,7 @@
             </li>
 </ul></div>
 <a name="range.reference.algorithms.range_algorithm_mutating_algorithms.stable_sort.complexity"></a><h6>
-<a name="id680387"></a>
+<a name="id3066667"></a>
             <a class="link" href="stable_sort.html#range.reference.algorithms.range_algorithm_mutating_algorithms.stable_sort.complexity">Complexity</a>
           </h6>
 <p>
diff --git a/doc/html/range/reference/algorithms/range_algorithm_mutating_algorithms/transform.html b/doc/html/range/reference/algorithms/range_algorithm_mutating_algorithms/transform.html
index 82c53ea..110d48d 100644
--- a/doc/html/range/reference/algorithms/range_algorithm_mutating_algorithms/transform.html
+++ b/doc/html/range/reference/algorithms/range_algorithm_mutating_algorithms/transform.html
@@ -3,7 +3,7 @@
 <meta http-equiv="Content-Type" content="text/html; charset=US-ASCII">
 <title>Range Algorithm - transform</title>
 <link rel="stylesheet" href="../../../../../../../../doc/html/boostbook.css" type="text/css">
-<meta name="generator" content="DocBook XSL Stylesheets V1.75.2">
+<meta name="generator" content="DocBook XSL Stylesheets V1.75.1">
 <link rel="home" href="../../../../index.html" title="Chapter&#160;1.&#160;Range 2.0">
 <link rel="up" href="../range_algorithm_mutating_algorithms.html" title="Mutating algorithms">
 <link rel="prev" href="stable_sort.html" title="Range Algorithm - stable_sort">
@@ -28,7 +28,7 @@
           Range Algorithm - transform</a>
 </h5></div></div></div>
 <a name="range.reference.algorithms.range_algorithm_mutating_algorithms.transform.prototype"></a><h6>
-<a name="id680568"></a>
+<a name="id3066856"></a>
             <a class="link" href="transform.html#range.reference.algorithms.range_algorithm_mutating_algorithms.transform.prototype">Prototype</a>
           </h6>
 <p>
@@ -57,7 +57,7 @@
 <p>
           </p>
 <a name="range.reference.algorithms.range_algorithm_mutating_algorithms.transform.description"></a><h6>
-<a name="id680904"></a>
+<a name="id3067196"></a>
             <a class="link" href="transform.html#range.reference.algorithms.range_algorithm_mutating_algorithms.transform.description">Description</a>
           </h6>
 <p>
@@ -93,14 +93,14 @@
             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.range_algorithm_mutating_algorithms.transform.definition"></a><h6>
-<a name="id681443"></a>
+<a name="id3067749"></a>
             <a class="link" href="transform.html#range.reference.algorithms.range_algorithm_mutating_algorithms.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.range_algorithm_mutating_algorithms.transform.requirements"></a><h6>
-<a name="id681514"></a>
+<a name="id3067824"></a>
             <a class="link" href="transform.html#range.reference.algorithms.range_algorithm_mutating_algorithms.transform.requirements">Requirements</a>
           </h6>
 <p>
@@ -170,7 +170,7 @@
             </li>
 </ul></div>
 <a name="range.reference.algorithms.range_algorithm_mutating_algorithms.transform.precondition_"></a><h6>
-<a name="id681844"></a>
+<a name="id3068178"></a>
             <a class="link" href="transform.html#range.reference.algorithms.range_algorithm_mutating_algorithms.transform.precondition_">Precondition:</a>
           </h6>
 <p>
@@ -202,7 +202,7 @@
             </li>
 </ul></div>
 <a name="range.reference.algorithms.range_algorithm_mutating_algorithms.transform.complexity"></a><h6>
-<a name="id682252"></a>
+<a name="id3068595"></a>
             <a class="link" href="transform.html#range.reference.algorithms.range_algorithm_mutating_algorithms.transform.complexity">Complexity</a>
           </h6>
 <p>
diff --git a/doc/html/range/reference/algorithms/range_algorithm_mutating_algorithms/unique.html b/doc/html/range/reference/algorithms/range_algorithm_mutating_algorithms/unique.html
index 13f388f..ec4bf26 100644
--- a/doc/html/range/reference/algorithms/range_algorithm_mutating_algorithms/unique.html
+++ b/doc/html/range/reference/algorithms/range_algorithm_mutating_algorithms/unique.html
@@ -3,7 +3,7 @@
 <meta http-equiv="Content-Type" content="text/html; charset=US-ASCII">
 <title>Range Algorithm - unique</title>
 <link rel="stylesheet" href="../../../../../../../../doc/html/boostbook.css" type="text/css">
-<meta name="generator" content="DocBook XSL Stylesheets V1.75.2">
+<meta name="generator" content="DocBook XSL Stylesheets V1.75.1">
 <link rel="home" href="../../../../index.html" title="Chapter&#160;1.&#160;Range 2.0">
 <link rel="up" href="../range_algorithm_mutating_algorithms.html" title="Mutating algorithms">
 <link rel="prev" href="transform.html" title="Range Algorithm - transform">
@@ -28,7 +28,7 @@
           Range Algorithm - unique</a>
 </h5></div></div></div>
 <a name="range.reference.algorithms.range_algorithm_mutating_algorithms.unique.prototype"></a><h6>
-<a name="id682371"></a>
+<a name="id3068722"></a>
             <a class="link" href="unique.html#range.reference.algorithms.range_algorithm_mutating_algorithms.unique.prototype">Prototype</a>
           </h6>
 <p>
@@ -69,7 +69,7 @@
 <p>
           </p>
 <a name="range.reference.algorithms.range_algorithm_mutating_algorithms.unique.description"></a><h6>
-<a name="id683395"></a>
+<a name="id3069755"></a>
             <a class="link" href="unique.html#range.reference.algorithms.range_algorithm_mutating_algorithms.unique.description">Description</a>
           </h6>
 <p>
@@ -87,14 +87,14 @@
             type.
           </p>
 <a name="range.reference.algorithms.range_algorithm_mutating_algorithms.unique.definition"></a><h6>
-<a name="id683513"></a>
+<a name="id3069879"></a>
             <a class="link" href="unique.html#range.reference.algorithms.range_algorithm_mutating_algorithms.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.range_algorithm_mutating_algorithms.unique.requirements"></a><h6>
-<a name="id683584"></a>
+<a name="id3069954"></a>
             <a class="link" href="unique.html#range.reference.algorithms.range_algorithm_mutating_algorithms.unique.requirements">Requirements</a>
           </h6>
 <p>
@@ -138,7 +138,7 @@
             </li>
 </ul></div>
 <a name="range.reference.algorithms.range_algorithm_mutating_algorithms.unique.complexity"></a><h6>
-<a name="id683784"></a>
+<a name="id3070168"></a>
             <a class="link" href="unique.html#range.reference.algorithms.range_algorithm_mutating_algorithms.unique.complexity">Complexity</a>
           </h6>
 <p>
diff --git a/doc/html/range/reference/algorithms/range_algorithm_new_algorithms.html b/doc/html/range/reference/algorithms/range_algorithm_new_algorithms.html
index 7976d61..5182eaf 100644
--- a/doc/html/range/reference/algorithms/range_algorithm_new_algorithms.html
+++ b/doc/html/range/reference/algorithms/range_algorithm_new_algorithms.html
@@ -3,7 +3,7 @@
 <meta http-equiv="Content-Type" content="text/html; charset=US-ASCII">
 <title>New algorithms</title>
 <link rel="stylesheet" href="../../../../../../../doc/html/boostbook.css" type="text/css">
-<meta name="generator" content="DocBook XSL Stylesheets V1.75.2">
+<meta name="generator" content="DocBook XSL Stylesheets V1.75.1">
 <link rel="home" href="../../../index.html" title="Chapter&#160;1.&#160;Range 2.0">
 <link rel="up" href="../algorithms.html" title="Range Algorithm">
 <link rel="prev" href="permutation_algorithms/prev_permutation.html" title="prev_permutation">
diff --git a/doc/html/range/reference/algorithms/range_algorithm_new_algorithms/erase.html b/doc/html/range/reference/algorithms/range_algorithm_new_algorithms/erase.html
index e3d64a6..6d13233 100644
--- a/doc/html/range/reference/algorithms/range_algorithm_new_algorithms/erase.html
+++ b/doc/html/range/reference/algorithms/range_algorithm_new_algorithms/erase.html
@@ -3,7 +3,7 @@
 <meta http-equiv="Content-Type" content="text/html; charset=US-ASCII">
 <title>erase</title>
 <link rel="stylesheet" href="../../../../../../../../doc/html/boostbook.css" type="text/css">
-<meta name="generator" content="DocBook XSL Stylesheets V1.75.2">
+<meta name="generator" content="DocBook XSL Stylesheets V1.75.1">
 <link rel="home" href="../../../../index.html" title="Chapter&#160;1.&#160;Range 2.0">
 <link rel="up" href="../range_algorithm_new_algorithms.html" title="New algorithms">
 <link rel="prev" href="../range_algorithm_new_algorithms.html" title="New algorithms">
@@ -28,23 +28,21 @@
           erase</a>
 </h5></div></div></div>
 <a name="range.reference.algorithms.range_algorithm_new_algorithms.erase.prototype"></a><h6>
-<a name="id714130"></a>
+<a name="id3102704"></a>
             <a class="link" href="erase.html#range.reference.algorithms.range_algorithm_new_algorithms.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">SinglePassRange</span>
-    <span class="special">&gt;</span>
-<span class="keyword">void</span> <span class="identifier">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>
-           <span class="identifier">iterator_range</span><span class="special">&lt;</span><span class="keyword">typename</span> <span class="identifier">Container</span><span class="special">::</span><span class="identifier">iterator</span><span class="special">&gt;</span> <span class="identifier">to_erase</span><span class="special">);</span>
+<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>
+    <span class="identifier">Container</span><span class="special">&amp;</span> <span class="identifier">target</span><span class="special">,</span>
+    <span class="identifier">iterator_range</span><span class="special">&lt;</span><span class="keyword">typename</span> <span class="identifier">Container</span><span class="special">::</span><span class="identifier">iterator</span><span class="special">&gt;</span> <span class="identifier">to_erase</span><span class="special">);</span>
 </pre>
 <p>
           </p>
 <a name="range.reference.algorithms.range_algorithm_new_algorithms.erase.description"></a><h6>
-<a name="id714284"></a>
+<a name="id3102848"></a>
             <a class="link" href="erase.html#range.reference.algorithms.range_algorithm_new_algorithms.erase.description">Description</a>
           </h6>
 <p>
@@ -52,15 +50,23 @@
             <code class="computeroutput"><span class="identifier">to_erase</span></code> from the container
             <code class="computeroutput"><span class="identifier">target</span></code>.
           </p>
+<p>
+            <code class="computeroutput"><span class="identifier">remove_erase</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</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">value</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>
+<p>
+            <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.range_algorithm_new_algorithms.erase.definition"></a><h6>
-<a name="id714340"></a>
+<a name="id3103154"></a>
             <a class="link" href="erase.html#range.reference.algorithms.range_algorithm_new_algorithms.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.range_algorithm_new_algorithms.erase.requirements"></a><h6>
-<a name="id714411"></a>
+<a name="id3103229"></a>
             <a class="link" href="erase.html#range.reference.algorithms.range_algorithm_new_algorithms.erase.requirements">Requirements</a>
           </h6>
 <div class="orderedlist"><ol class="orderedlist" type="1"><li class="listitem">
@@ -68,7 +74,7 @@
               erase of an iterator range.
             </li></ol></div>
 <a name="range.reference.algorithms.range_algorithm_new_algorithms.erase.complexity"></a><h6>
-<a name="id714454"></a>
+<a name="id3103276"></a>
             <a class="link" href="erase.html#range.reference.algorithms.range_algorithm_new_algorithms.erase.complexity">Complexity</a>
           </h6>
 <p>
diff --git a/doc/html/range/reference/algorithms/range_algorithm_new_algorithms/for_each.html b/doc/html/range/reference/algorithms/range_algorithm_new_algorithms/for_each.html
index dfe62c3..2577357 100644
--- a/doc/html/range/reference/algorithms/range_algorithm_new_algorithms/for_each.html
+++ b/doc/html/range/reference/algorithms/range_algorithm_new_algorithms/for_each.html
@@ -3,7 +3,7 @@
 <meta http-equiv="Content-Type" content="text/html; charset=US-ASCII">
 <title>for_each</title>
 <link rel="stylesheet" href="../../../../../../../../doc/html/boostbook.css" type="text/css">
-<meta name="generator" content="DocBook XSL Stylesheets V1.75.2">
+<meta name="generator" content="DocBook XSL Stylesheets V1.75.1">
 <link rel="home" href="../../../../index.html" title="Chapter&#160;1.&#160;Range 2.0">
 <link rel="up" href="../range_algorithm_new_algorithms.html" title="New algorithms">
 <link rel="prev" href="erase.html" title="erase">
@@ -28,7 +28,7 @@
           for_each</a>
 </h5></div></div></div>
 <a name="range.reference.algorithms.range_algorithm_new_algorithms.for_each.prototype"></a><h6>
-<a name="id714521"></a>
+<a name="id3103348"></a>
             <a class="link" href="for_each.html#range.reference.algorithms.range_algorithm_new_algorithms.for_each.prototype">Prototype</a>
           </h6>
 <p>
@@ -73,7 +73,7 @@
 <p>
           </p>
 <a name="range.reference.algorithms.range_algorithm_new_algorithms.for_each.description"></a><h6>
-<a name="id715097"></a>
+<a name="id3103932"></a>
             <a class="link" href="for_each.html#range.reference.algorithms.range_algorithm_new_algorithms.for_each.description">Description</a>
           </h6>
 <p>
@@ -89,14 +89,14 @@
             It is safe to call this function with unequal length ranges.
           </p>
 <a name="range.reference.algorithms.range_algorithm_new_algorithms.for_each.definition"></a><h6>
-<a name="id715253"></a>
+<a name="id3104096"></a>
             <a class="link" href="for_each.html#range.reference.algorithms.range_algorithm_new_algorithms.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.range_algorithm_new_algorithms.for_each.requirements"></a><h6>
-<a name="id715324"></a>
+<a name="id3104171"></a>
             <a class="link" href="for_each.html#range.reference.algorithms.range_algorithm_new_algorithms.for_each.requirements">Requirements</a>
           </h6>
 <div class="orderedlist"><ol class="orderedlist" type="1">
@@ -126,7 +126,7 @@
             </li>
 </ol></div>
 <a name="range.reference.algorithms.range_algorithm_new_algorithms.for_each.complexity"></a><h6>
-<a name="id715469"></a>
+<a name="id3104326"></a>
             <a class="link" href="for_each.html#range.reference.algorithms.range_algorithm_new_algorithms.for_each.complexity">Complexity</a>
           </h6>
 <p>
diff --git a/doc/html/range/reference/algorithms/range_algorithm_new_algorithms/insert.html b/doc/html/range/reference/algorithms/range_algorithm_new_algorithms/insert.html
index e0aa512..7321ce8 100644
--- a/doc/html/range/reference/algorithms/range_algorithm_new_algorithms/insert.html
+++ b/doc/html/range/reference/algorithms/range_algorithm_new_algorithms/insert.html
@@ -3,7 +3,7 @@
 <meta http-equiv="Content-Type" content="text/html; charset=US-ASCII">
 <title>insert</title>
 <link rel="stylesheet" href="../../../../../../../../doc/html/boostbook.css" type="text/css">
-<meta name="generator" content="DocBook XSL Stylesheets V1.75.2">
+<meta name="generator" content="DocBook XSL Stylesheets V1.75.1">
 <link rel="home" href="../../../../index.html" title="Chapter&#160;1.&#160;Range 2.0">
 <link rel="up" href="../range_algorithm_new_algorithms.html" title="New algorithms">
 <link rel="prev" href="for_each.html" title="for_each">
@@ -28,7 +28,7 @@
           insert</a>
 </h5></div></div></div>
 <a name="range.reference.algorithms.range_algorithm_new_algorithms.insert.prototype"></a><h6>
-<a name="id715575"></a>
+<a name="id3104437"></a>
             <a class="link" href="insert.html#range.reference.algorithms.range_algorithm_new_algorithms.insert.prototype">Prototype</a>
           </h6>
 <p>
@@ -38,14 +38,14 @@
     <span class="keyword">class</span> <span class="identifier">Container</span><span class="special">,</span>
     <span class="keyword">class</span> <span class="identifier">SinglePassRange</span>
     <span class="special">&gt;</span>
-<span class="keyword">void</span> <span class="identifier">insert</span><span class="special">(</span><span class="identifier">Container</span><span class="special">&amp;</span> <span class="identifier">target</span><span class="special">,</span>
-            <span class="keyword">typename</span> <span class="identifier">Container</span><span class="special">::</span><span class="identifier">iterator</span> <span class="identifier">before</span><span class="special">,</span>
-            <span class="keyword">const</span> <span class="identifier">SinglePassRange</span><span class="special">&amp;</span> <span class="identifier">from</span><span class="special">);</span>
+<span class="identifier">Container</span><span class="special">&amp;</span> <span class="identifier">insert</span><span class="special">(</span><span class="identifier">Container</span><span class="special">&amp;</span> <span class="identifier">target</span><span class="special">,</span>
+                  <span class="keyword">typename</span> <span class="identifier">Container</span><span class="special">::</span><span class="identifier">iterator</span> <span class="identifier">before</span><span class="special">,</span>
+                  <span class="keyword">const</span> <span class="identifier">SinglePassRange</span><span class="special">&amp;</span> <span class="identifier">from</span><span class="special">);</span>
 </pre>
 <p>
           </p>
 <a name="range.reference.algorithms.range_algorithm_new_algorithms.insert.description"></a><h6>
-<a name="id715740"></a>
+<a name="id3104610"></a>
             <a class="link" href="insert.html#range.reference.algorithms.range_algorithm_new_algorithms.insert.description">Description</a>
           </h6>
 <p>
@@ -55,14 +55,14 @@
             <code class="computeroutput"><span class="identifier">target</span></code>.
           </p>
 <a name="range.reference.algorithms.range_algorithm_new_algorithms.insert.definition"></a><h6>
-<a name="id715807"></a>
+<a name="id3104682"></a>
             <a class="link" href="insert.html#range.reference.algorithms.range_algorithm_new_algorithms.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.range_algorithm_new_algorithms.insert.requirements"></a><h6>
-<a name="id715878"></a>
+<a name="id3104756"></a>
             <a class="link" href="insert.html#range.reference.algorithms.range_algorithm_new_algorithms.insert.requirements">Requirements</a>
           </h6>
 <div class="orderedlist"><ol class="orderedlist" type="1">
@@ -82,7 +82,7 @@
             </li>
 </ol></div>
 <a name="range.reference.algorithms.range_algorithm_new_algorithms.insert.complexity"></a><h6>
-<a name="id715967"></a>
+<a name="id3104850"></a>
             <a class="link" href="insert.html#range.reference.algorithms.range_algorithm_new_algorithms.insert.complexity">Complexity</a>
           </h6>
 <p>
diff --git a/doc/html/range/reference/algorithms/range_algorithm_new_algorithms/iota.html b/doc/html/range/reference/algorithms/range_algorithm_new_algorithms/iota.html
index c36f96d..ea0a6f4 100644
--- a/doc/html/range/reference/algorithms/range_algorithm_new_algorithms/iota.html
+++ b/doc/html/range/reference/algorithms/range_algorithm_new_algorithms/iota.html
@@ -3,7 +3,7 @@
 <meta http-equiv="Content-Type" content="text/html; charset=US-ASCII">
 <title>iota</title>
 <link rel="stylesheet" href="../../../../../../../../doc/html/boostbook.css" type="text/css">
-<meta name="generator" content="DocBook XSL Stylesheets V1.75.2">
+<meta name="generator" content="DocBook XSL Stylesheets V1.75.1">
 <link rel="home" href="../../../../index.html" title="Chapter&#160;1.&#160;Range 2.0">
 <link rel="up" href="../range_algorithm_new_algorithms.html" title="New algorithms">
 <link rel="prev" href="insert.html" title="insert">
@@ -28,19 +28,19 @@
           iota</a>
 </h5></div></div></div>
 <a name="range.reference.algorithms.range_algorithm_new_algorithms.iota.prototype"></a><h6>
-<a name="id716034"></a>
+<a name="id3104923"></a>
             <a class="link" href="iota.html#range.reference.algorithms.range_algorithm_new_algorithms.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">SinglePassRange</span><span class="special">,</span> <span class="keyword">class</span> <span class="identifier">Value</span><span class="special">&gt;</span>
-<span class="identifier">iota</span><span class="special">(</span><span class="identifier">SinglePassRange</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 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.range_algorithm_new_algorithms.iota.description"></a><h6>
-<a name="id716150"></a>
+<a name="id3105053"></a>
             <a class="link" href="iota.html#range.reference.algorithms.range_algorithm_new_algorithms.iota.description">Description</a>
           </h6>
 <p>
@@ -51,21 +51,21 @@
             <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.range_algorithm_new_algorithms.iota.definition"></a><h6>
-<a name="id716288"></a>
+<a name="id3105195"></a>
             <a class="link" href="iota.html#range.reference.algorithms.range_algorithm_new_algorithms.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.range_algorithm_new_algorithms.iota.requirements"></a><h6>
-<a name="id716360"></a>
+<a name="id3105266"></a>
             <a class="link" href="iota.html#range.reference.algorithms.range_algorithm_new_algorithms.iota.requirements">Requirements</a>
           </h6>
 <div class="orderedlist"><ol class="orderedlist" type="1">
 <li class="listitem">
-<code class="computeroutput"><span class="identifier">SinglePassRange</span></code> is
-              a model of the <a class="link" href="../../../concepts/single_pass_range.html" title="Single Pass Range">Single
-              Pass Range</a> Concept.
+<code class="computeroutput"><span class="identifier">ForwardRange</span></code> is a model
+              of the <a class="link" href="../../../concepts/forward_range.html" title="Forward Range">Forward Range</a>
+              Concept.
             </li>
 <li class="listitem">
 <code class="computeroutput"><span class="identifier">Value</span></code> is a model of
@@ -73,7 +73,7 @@
             </li>
 </ol></div>
 <a name="range.reference.algorithms.range_algorithm_new_algorithms.iota.complexity"></a><h6>
-<a name="id716434"></a>
+<a name="id3105345"></a>
             <a class="link" href="iota.html#range.reference.algorithms.range_algorithm_new_algorithms.iota.complexity">Complexity</a>
           </h6>
 <p>
diff --git a/doc/html/range/reference/algorithms/range_algorithm_new_algorithms/overwrite.html b/doc/html/range/reference/algorithms/range_algorithm_new_algorithms/overwrite.html
index 189151b..d0a5b5e 100644
--- a/doc/html/range/reference/algorithms/range_algorithm_new_algorithms/overwrite.html
+++ b/doc/html/range/reference/algorithms/range_algorithm_new_algorithms/overwrite.html
@@ -3,7 +3,7 @@
 <meta http-equiv="Content-Type" content="text/html; charset=US-ASCII">
 <title>overwrite</title>
 <link rel="stylesheet" href="../../../../../../../../doc/html/boostbook.css" type="text/css">
-<meta name="generator" content="DocBook XSL Stylesheets V1.75.2">
+<meta name="generator" content="DocBook XSL Stylesheets V1.75.1">
 <link rel="home" href="../../../../index.html" title="Chapter&#160;1.&#160;Range 2.0">
 <link rel="up" href="../range_algorithm_new_algorithms.html" title="New algorithms">
 <link rel="prev" href="iota.html" title="iota">
@@ -28,7 +28,7 @@
           overwrite</a>
 </h5></div></div></div>
 <a name="range.reference.algorithms.range_algorithm_new_algorithms.overwrite.prototype"></a><h6>
-<a name="id716511"></a>
+<a name="id3105428"></a>
             <a class="link" href="overwrite.html#range.reference.algorithms.range_algorithm_new_algorithms.overwrite.prototype">Prototype</a>
           </h6>
 <p>
@@ -44,7 +44,7 @@
 <p>
           </p>
 <a name="range.reference.algorithms.range_algorithm_new_algorithms.overwrite.description"></a><h6>
-<a name="id716646"></a>
+<a name="id3105567"></a>
             <a class="link" href="overwrite.html#range.reference.algorithms.range_algorithm_new_algorithms.overwrite.description">Description</a>
           </h6>
 <p>
@@ -53,14 +53,14 @@
             into the range <code class="computeroutput"><span class="identifier">to</span></code>.
           </p>
 <a name="range.reference.algorithms.range_algorithm_new_algorithms.overwrite.definition"></a><h6>
-<a name="id716703"></a>
+<a name="id3105628"></a>
             <a class="link" href="overwrite.html#range.reference.algorithms.range_algorithm_new_algorithms.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.range_algorithm_new_algorithms.overwrite.requirements"></a><h6>
-<a name="id716773"></a>
+<a name="id3105702"></a>
             <a class="link" href="overwrite.html#range.reference.algorithms.range_algorithm_new_algorithms.overwrite.requirements">Requirements</a>
           </h6>
 <div class="orderedlist"><ol class="orderedlist" type="1">
@@ -87,7 +87,7 @@
             </li>
 </ol></div>
 <a name="range.reference.algorithms.range_algorithm_new_algorithms.overwrite.complexity"></a><h6>
-<a name="id716934"></a>
+<a name="id3105873"></a>
             <a class="link" href="overwrite.html#range.reference.algorithms.range_algorithm_new_algorithms.overwrite.complexity">Complexity</a>
           </h6>
 <p>
diff --git a/doc/html/range/reference/algorithms/range_algorithm_new_algorithms/push_back.html b/doc/html/range/reference/algorithms/range_algorithm_new_algorithms/push_back.html
index 1357275..8029406 100644
--- a/doc/html/range/reference/algorithms/range_algorithm_new_algorithms/push_back.html
+++ b/doc/html/range/reference/algorithms/range_algorithm_new_algorithms/push_back.html
@@ -3,7 +3,7 @@
 <meta http-equiv="Content-Type" content="text/html; charset=US-ASCII">
 <title>push_back</title>
 <link rel="stylesheet" href="../../../../../../../../doc/html/boostbook.css" type="text/css">
-<meta name="generator" content="DocBook XSL Stylesheets V1.75.2">
+<meta name="generator" content="DocBook XSL Stylesheets V1.75.1">
 <link rel="home" href="../../../../index.html" title="Chapter&#160;1.&#160;Range 2.0">
 <link rel="up" href="../range_algorithm_new_algorithms.html" title="New algorithms">
 <link rel="prev" href="overwrite.html" title="overwrite">
@@ -28,7 +28,7 @@
           push_back</a>
 </h5></div></div></div>
 <a name="range.reference.algorithms.range_algorithm_new_algorithms.push_back.prototype"></a><h6>
-<a name="id717001"></a>
+<a name="id3105946"></a>
             <a class="link" href="push_back.html#range.reference.algorithms.range_algorithm_new_algorithms.push_back.prototype">Prototype</a>
           </h6>
 <p>
@@ -38,13 +38,13 @@
     <span class="keyword">class</span> <span class="identifier">Container</span><span class="special">,</span>
     <span class="keyword">class</span> <span class="identifier">SinglePassRange</span>
     <span class="special">&gt;</span>
-<span class="keyword">void</span> <span class="identifier">push_back</span><span class="special">(</span><span class="identifier">Container</span><span class="special">&amp;</span> <span class="identifier">target</span><span class="special">,</span>
-               <span class="keyword">const</span> <span class="identifier">SinglePassRange</span><span class="special">&amp;</span> <span class="identifier">from</span><span class="special">);</span>
+<span class="identifier">Container</span><span class="special">&amp;</span> <span class="identifier">push_back</span><span class="special">(</span><span class="identifier">Container</span><span class="special">&amp;</span> <span class="identifier">target</span><span class="special">,</span>
+                     <span class="keyword">const</span> <span class="identifier">SinglePassRange</span><span class="special">&amp;</span> <span class="identifier">from</span><span class="special">);</span>
 </pre>
 <p>
           </p>
 <a name="range.reference.algorithms.range_algorithm_new_algorithms.push_back.description"></a><h6>
-<a name="id717137"></a>
+<a name="id3106090"></a>
             <a class="link" href="push_back.html#range.reference.algorithms.range_algorithm_new_algorithms.push_back.description">Description</a>
           </h6>
 <p>
@@ -53,14 +53,14 @@
             to the back of the container <code class="computeroutput"><span class="identifier">target</span></code>.
           </p>
 <a name="range.reference.algorithms.range_algorithm_new_algorithms.push_back.definition"></a><h6>
-<a name="id717193"></a>
+<a name="id3106151"></a>
             <a class="link" href="push_back.html#range.reference.algorithms.range_algorithm_new_algorithms.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.range_algorithm_new_algorithms.push_back.requirements"></a><h6>
-<a name="id717265"></a>
+<a name="id3106226"></a>
             <a class="link" href="push_back.html#range.reference.algorithms.range_algorithm_new_algorithms.push_back.requirements">Requirements</a>
           </h6>
 <div class="orderedlist"><ol class="orderedlist" type="1">
@@ -80,7 +80,7 @@
             </li>
 </ol></div>
 <a name="range.reference.algorithms.range_algorithm_new_algorithms.push_back.complexity"></a><h6>
-<a name="id717368"></a>
+<a name="id3106336"></a>
             <a class="link" href="push_back.html#range.reference.algorithms.range_algorithm_new_algorithms.push_back.complexity">Complexity</a>
           </h6>
 <p>
diff --git a/doc/html/range/reference/algorithms/range_algorithm_new_algorithms/push_front.html b/doc/html/range/reference/algorithms/range_algorithm_new_algorithms/push_front.html
index d91db73..462cc72 100644
--- a/doc/html/range/reference/algorithms/range_algorithm_new_algorithms/push_front.html
+++ b/doc/html/range/reference/algorithms/range_algorithm_new_algorithms/push_front.html
@@ -3,7 +3,7 @@
 <meta http-equiv="Content-Type" content="text/html; charset=US-ASCII">
 <title>push_front</title>
 <link rel="stylesheet" href="../../../../../../../../doc/html/boostbook.css" type="text/css">
-<meta name="generator" content="DocBook XSL Stylesheets V1.75.2">
+<meta name="generator" content="DocBook XSL Stylesheets V1.75.1">
 <link rel="home" href="../../../../index.html" title="Chapter&#160;1.&#160;Range 2.0">
 <link rel="up" href="../range_algorithm_new_algorithms.html" title="New algorithms">
 <link rel="prev" href="push_back.html" title="push_back">
@@ -28,7 +28,7 @@
           push_front</a>
 </h5></div></div></div>
 <a name="range.reference.algorithms.range_algorithm_new_algorithms.push_front.prototype"></a><h6>
-<a name="id717434"></a>
+<a name="id3106409"></a>
             <a class="link" href="push_front.html#range.reference.algorithms.range_algorithm_new_algorithms.push_front.prototype">Prototype</a>
           </h6>
 <p>
@@ -38,13 +38,13 @@
     <span class="keyword">class</span> <span class="identifier">Container</span><span class="special">,</span>
     <span class="keyword">class</span> <span class="identifier">SinglePassRange</span>
     <span class="special">&gt;</span>
-<span class="keyword">void</span> <span class="identifier">push_front</span><span class="special">(</span><span class="identifier">Container</span><span class="special">&amp;</span> <span class="identifier">target</span><span class="special">,</span>
-                <span class="keyword">const</span> <span class="identifier">SinglePassRange</span><span class="special">&amp;</span> <span class="identifier">from</span><span class="special">);</span>
+<span class="identifier">Container</span><span class="special">&amp;</span> <span class="identifier">push_front</span><span class="special">(</span><span class="identifier">Container</span><span class="special">&amp;</span> <span class="identifier">target</span><span class="special">,</span>
+                      <span class="keyword">const</span> <span class="identifier">SinglePassRange</span><span class="special">&amp;</span> <span class="identifier">from</span><span class="special">);</span>
 </pre>
 <p>
           </p>
 <a name="range.reference.algorithms.range_algorithm_new_algorithms.push_front.description"></a><h6>
-<a name="id717568"></a>
+<a name="id3106552"></a>
             <a class="link" href="push_front.html#range.reference.algorithms.range_algorithm_new_algorithms.push_front.description">Description</a>
           </h6>
 <p>
@@ -53,14 +53,14 @@
             to the front of the container <code class="computeroutput"><span class="identifier">target</span></code>.
           </p>
 <a name="range.reference.algorithms.range_algorithm_new_algorithms.push_front.definition"></a><h6>
-<a name="id717625"></a>
+<a name="id3106613"></a>
             <a class="link" href="push_front.html#range.reference.algorithms.range_algorithm_new_algorithms.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.range_algorithm_new_algorithms.push_front.requirements"></a><h6>
-<a name="id717696"></a>
+<a name="id3106688"></a>
             <a class="link" href="push_front.html#range.reference.algorithms.range_algorithm_new_algorithms.push_front.requirements">Requirements</a>
           </h6>
 <div class="orderedlist"><ol class="orderedlist" type="1">
@@ -80,7 +80,7 @@
             </li>
 </ol></div>
 <a name="range.reference.algorithms.range_algorithm_new_algorithms.push_front.complexity"></a><h6>
-<a name="id717799"></a>
+<a name="id3106797"></a>
             <a class="link" href="push_front.html#range.reference.algorithms.range_algorithm_new_algorithms.push_front.complexity">Complexity</a>
           </h6>
 <p>
diff --git a/doc/html/range/reference/algorithms/range_algorithm_new_algorithms/remove_erase.html b/doc/html/range/reference/algorithms/range_algorithm_new_algorithms/remove_erase.html
index 5963cab..c268e1a 100644
--- a/doc/html/range/reference/algorithms/range_algorithm_new_algorithms/remove_erase.html
+++ b/doc/html/range/reference/algorithms/range_algorithm_new_algorithms/remove_erase.html
@@ -3,7 +3,7 @@
 <meta http-equiv="Content-Type" content="text/html; charset=US-ASCII">
 <title>remove_erase</title>
 <link rel="stylesheet" href="../../../../../../../../doc/html/boostbook.css" type="text/css">
-<meta name="generator" content="DocBook XSL Stylesheets V1.75.2">
+<meta name="generator" content="DocBook XSL Stylesheets V1.75.1">
 <link rel="home" href="../../../../index.html" title="Chapter&#160;1.&#160;Range 2.0">
 <link rel="up" href="../range_algorithm_new_algorithms.html" title="New algorithms">
 <link rel="prev" href="push_front.html" title="push_front">
@@ -28,40 +28,37 @@
           remove_erase</a>
 </h5></div></div></div>
 <a name="range.reference.algorithms.range_algorithm_new_algorithms.remove_erase.prototype"></a><h6>
-<a name="id717866"></a>
+<a name="id3106872"></a>
             <a class="link" href="remove_erase.html#range.reference.algorithms.range_algorithm_new_algorithms.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">T</span>
-    <span class="special">&gt;</span>
-<span class="keyword">void</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>
-                  <span class="keyword">const</span> <span class="identifier">T</span><span class="special">&amp;</span> <span class="identifier">val</span><span class="special">);</span>
+<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>
+                        <span class="keyword">const</span> <span class="identifier">Value</span><span class="special">&amp;</span> <span class="identifier">value</span><span class="special">);</span>
 </pre>
 <p>
           </p>
 <a name="range.reference.algorithms.range_algorithm_new_algorithms.remove_erase.description"></a><h6>
-<a name="id718000"></a>
+<a name="id3107012"></a>
             <a class="link" href="remove_erase.html#range.reference.algorithms.range_algorithm_new_algorithms.remove_erase.description">Description</a>
           </h6>
 <p>
             <code class="computeroutput"><span class="identifier">remove_erase</span></code> actually
-            eliminates the elements equal to <code class="computeroutput"><span class="identifier">val</span></code>
+            eliminates the elements equal to <code class="computeroutput"><span class="identifier">value</span></code>
             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.range_algorithm_new_algorithms.remove_erase.definition"></a><h6>
-<a name="id718057"></a>
+<a name="id3107074"></a>
             <a class="link" href="remove_erase.html#range.reference.algorithms.range_algorithm_new_algorithms.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.range_algorithm_new_algorithms.remove_erase.requirements"></a><h6>
-<a name="id718128"></a>
+<a name="id3107149"></a>
             <a class="link" href="remove_erase.html#range.reference.algorithms.range_algorithm_new_algorithms.remove_erase.requirements">Requirements</a>
           </h6>
 <div class="orderedlist"><ol class="orderedlist" type="1"><li class="listitem">
@@ -69,7 +66,7 @@
               erase of an iterator range.
             </li></ol></div>
 <a name="range.reference.algorithms.range_algorithm_new_algorithms.remove_erase.complexity"></a><h6>
-<a name="id718171"></a>
+<a name="id3107196"></a>
             <a class="link" href="remove_erase.html#range.reference.algorithms.range_algorithm_new_algorithms.remove_erase.complexity">Complexity</a>
           </h6>
 <p>
diff --git a/doc/html/range/reference/algorithms/range_algorithm_new_algorithms/remove_erase_if.html b/doc/html/range/reference/algorithms/range_algorithm_new_algorithms/remove_erase_if.html
index 4469f02..0dd87cd 100644
--- a/doc/html/range/reference/algorithms/range_algorithm_new_algorithms/remove_erase_if.html
+++ b/doc/html/range/reference/algorithms/range_algorithm_new_algorithms/remove_erase_if.html
@@ -3,7 +3,7 @@
 <meta http-equiv="Content-Type" content="text/html; charset=US-ASCII">
 <title>remove_erase_if</title>
 <link rel="stylesheet" href="../../../../../../../../doc/html/boostbook.css" type="text/css">
-<meta name="generator" content="DocBook XSL Stylesheets V1.75.2">
+<meta name="generator" content="DocBook XSL Stylesheets V1.75.1">
 <link rel="home" href="../../../../index.html" title="Chapter&#160;1.&#160;Range 2.0">
 <link rel="up" href="../range_algorithm_new_algorithms.html" title="New algorithms">
 <link rel="prev" href="remove_erase.html" title="remove_erase">
@@ -28,23 +28,20 @@
           remove_erase_if</a>
 </h5></div></div></div>
 <a name="range.reference.algorithms.range_algorithm_new_algorithms.remove_erase_if.prototype"></a><h6>
-<a name="id718238"></a>
+<a name="id3107269"></a>
             <a class="link" href="remove_erase_if.html#range.reference.algorithms.range_algorithm_new_algorithms.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="keyword">void</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>
-                  <span class="identifier">Pred</span> <span class="identifier">pred</span><span class="special">);</span>
+<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>
+                           <span class="identifier">Pred</span> <span class="identifier">pred</span><span class="special">);</span>
 </pre>
 <p>
           </p>
 <a name="range.reference.algorithms.range_algorithm_new_algorithms.remove_erase_if.description"></a><h6>
-<a name="id718362"></a>
+<a name="id3107400"></a>
             <a class="link" href="remove_erase_if.html#range.reference.algorithms.range_algorithm_new_algorithms.remove_erase_if.description">Description</a>
           </h6>
 <p>
@@ -55,14 +52,14 @@
             algorithm which merely rearranges elements.
           </p>
 <a name="range.reference.algorithms.range_algorithm_new_algorithms.remove_erase_if.definition"></a><h6>
-<a name="id718443"></a>
+<a name="id3107486"></a>
             <a class="link" href="remove_erase_if.html#range.reference.algorithms.range_algorithm_new_algorithms.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.range_algorithm_new_algorithms.remove_erase_if.requirements"></a><h6>
-<a name="id718513"></a>
+<a name="id3107560"></a>
             <a class="link" href="remove_erase_if.html#range.reference.algorithms.range_algorithm_new_algorithms.remove_erase_if.requirements">Requirements</a>
           </h6>
 <div class="orderedlist"><ol class="orderedlist" type="1">
@@ -76,7 +73,7 @@
             </li>
 </ol></div>
 <a name="range.reference.algorithms.range_algorithm_new_algorithms.remove_erase_if.complexity"></a><h6>
-<a name="id718581"></a>
+<a name="id3107632"></a>
             <a class="link" href="remove_erase_if.html#range.reference.algorithms.range_algorithm_new_algorithms.remove_erase_if.complexity">Complexity</a>
           </h6>
 <p>
diff --git a/doc/html/range/reference/algorithms/range_algorithm_non_mutating_algorithms.html b/doc/html/range/reference/algorithms/range_algorithm_non_mutating_algorithms.html
index 2e8a2d1..87820b8 100644
--- a/doc/html/range/reference/algorithms/range_algorithm_non_mutating_algorithms.html
+++ b/doc/html/range/reference/algorithms/range_algorithm_non_mutating_algorithms.html
@@ -3,7 +3,7 @@
 <meta http-equiv="Content-Type" content="text/html; charset=US-ASCII">
 <title>Non-mutating algorithms</title>
 <link rel="stylesheet" href="../../../../../../../doc/html/boostbook.css" type="text/css">
-<meta name="generator" content="DocBook XSL Stylesheets V1.75.2">
+<meta name="generator" content="DocBook XSL Stylesheets V1.75.1">
 <link rel="home" href="../../../index.html" title="Chapter&#160;1.&#160;Range 2.0">
 <link rel="up" href="../algorithms.html" title="Range Algorithm">
 <link rel="prev" href="range_algorithm_mutating_algorithms/unique.html" title="Range Algorithm - unique">
diff --git a/doc/html/range/reference/algorithms/range_algorithm_non_mutating_algorithms/adjacent_find.html b/doc/html/range/reference/algorithms/range_algorithm_non_mutating_algorithms/adjacent_find.html
index d14634a..f71cc25 100644
--- a/doc/html/range/reference/algorithms/range_algorithm_non_mutating_algorithms/adjacent_find.html
+++ b/doc/html/range/reference/algorithms/range_algorithm_non_mutating_algorithms/adjacent_find.html
@@ -3,7 +3,7 @@
 <meta http-equiv="Content-Type" content="text/html; charset=US-ASCII">
 <title>Range Algorithm - adjacent_find</title>
 <link rel="stylesheet" href="../../../../../../../../doc/html/boostbook.css" type="text/css">
-<meta name="generator" content="DocBook XSL Stylesheets V1.75.2">
+<meta name="generator" content="DocBook XSL Stylesheets V1.75.1">
 <link rel="home" href="../../../../index.html" title="Chapter&#160;1.&#160;Range 2.0">
 <link rel="up" href="../range_algorithm_non_mutating_algorithms.html" title="Non-mutating algorithms">
 <link rel="prev" href="../range_algorithm_non_mutating_algorithms.html" title="Non-mutating algorithms">
@@ -28,7 +28,7 @@
           Range Algorithm - adjacent_find</a>
 </h5></div></div></div>
 <a name="range.reference.algorithms.range_algorithm_non_mutating_algorithms.adjacent_find.prototype"></a><h6>
-<a name="id683926"></a>
+<a name="id3070320"></a>
             <a class="link" href="adjacent_find.html#range.reference.algorithms.range_algorithm_non_mutating_algorithms.adjacent_find.prototype">Prototype</a>
           </h6>
 <p>
@@ -77,7 +77,7 @@
 <p>
           </p>
 <a name="range.reference.algorithms.range_algorithm_non_mutating_algorithms.adjacent_find.description"></a><h6>
-<a name="id684902"></a>
+<a name="id3071309"></a>
             <a class="link" href="adjacent_find.html#range.reference.algorithms.range_algorithm_non_mutating_algorithms.adjacent_find.description">Description</a>
           </h6>
 <p>
@@ -98,14 +98,14 @@
             is <code class="computeroutput"><span class="keyword">true</span></code>.
           </p>
 <a name="range.reference.algorithms.range_algorithm_non_mutating_algorithms.adjacent_find.definition"></a><h6>
-<a name="id685110"></a>
+<a name="id3071523"></a>
             <a class="link" href="adjacent_find.html#range.reference.algorithms.range_algorithm_non_mutating_algorithms.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.range_algorithm_non_mutating_algorithms.adjacent_find.requirements"></a><h6>
-<a name="id685180"></a>
+<a name="id3071597"></a>
             <a class="link" href="adjacent_find.html#range.reference.algorithms.range_algorithm_non_mutating_algorithms.adjacent_find.requirements">Requirements</a>
           </h6>
 <p>
@@ -143,7 +143,7 @@
             </li>
 </ul></div>
 <a name="range.reference.algorithms.range_algorithm_non_mutating_algorithms.adjacent_find.complexity"></a><h6>
-<a name="id685353"></a>
+<a name="id3071783"></a>
             <a class="link" href="adjacent_find.html#range.reference.algorithms.range_algorithm_non_mutating_algorithms.adjacent_find.complexity">Complexity</a>
           </h6>
 <p>
diff --git a/doc/html/range/reference/algorithms/range_algorithm_non_mutating_algorithms/binary_search.html b/doc/html/range/reference/algorithms/range_algorithm_non_mutating_algorithms/binary_search.html
index e87ccbe..64a95a8 100644
--- a/doc/html/range/reference/algorithms/range_algorithm_non_mutating_algorithms/binary_search.html
+++ b/doc/html/range/reference/algorithms/range_algorithm_non_mutating_algorithms/binary_search.html
@@ -3,7 +3,7 @@
 <meta http-equiv="Content-Type" content="text/html; charset=US-ASCII">
 <title>binary_search</title>
 <link rel="stylesheet" href="../../../../../../../../doc/html/boostbook.css" type="text/css">
-<meta name="generator" content="DocBook XSL Stylesheets V1.75.2">
+<meta name="generator" content="DocBook XSL Stylesheets V1.75.1">
 <link rel="home" href="../../../../index.html" title="Chapter&#160;1.&#160;Range 2.0">
 <link rel="up" href="../range_algorithm_non_mutating_algorithms.html" title="Non-mutating algorithms">
 <link rel="prev" href="adjacent_find.html" title="Range Algorithm - adjacent_find">
@@ -28,7 +28,7 @@
           binary_search</a>
 </h5></div></div></div>
 <a name="range.reference.algorithms.range_algorithm_non_mutating_algorithms.binary_search.prototype"></a><h6>
-<a name="id685455"></a>
+<a name="id3071892"></a>
             <a class="link" href="binary_search.html#range.reference.algorithms.range_algorithm_non_mutating_algorithms.binary_search.prototype">Prototype</a>
           </h6>
 <p>
@@ -43,7 +43,7 @@
 <p>
           </p>
 <a name="range.reference.algorithms.range_algorithm_non_mutating_algorithms.binary_search.description"></a><h6>
-<a name="id685734"></a>
+<a name="id3072176"></a>
             <a class="link" href="binary_search.html#range.reference.algorithms.range_algorithm_non_mutating_algorithms.binary_search.description">Description</a>
           </h6>
 <p>
@@ -53,14 +53,14 @@
             range <code class="computeroutput"><span class="identifier">rng</span></code>.
           </p>
 <a name="range.reference.algorithms.range_algorithm_non_mutating_algorithms.binary_search.definition"></a><h6>
-<a name="id685801"></a>
+<a name="id3072248"></a>
             <a class="link" href="binary_search.html#range.reference.algorithms.range_algorithm_non_mutating_algorithms.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.range_algorithm_non_mutating_algorithms.binary_search.requirements"></a><h6>
-<a name="id685873"></a>
+<a name="id3072323"></a>
             <a class="link" href="binary_search.html#range.reference.algorithms.range_algorithm_non_mutating_algorithms.binary_search.requirements">Requirements</a>
           </h6>
 <p>
@@ -111,7 +111,7 @@
             </li>
 </ul></div>
 <a name="range.reference.algorithms.range_algorithm_non_mutating_algorithms.binary_search.precondition_"></a><h6>
-<a name="id686117"></a>
+<a name="id3072583"></a>
             <a class="link" href="binary_search.html#range.reference.algorithms.range_algorithm_non_mutating_algorithms.binary_search.precondition_">Precondition:</a>
           </h6>
 <p>
@@ -129,7 +129,7 @@
             order according to the function object <code class="computeroutput"><span class="identifier">pred</span></code>.
           </p>
 <a name="range.reference.algorithms.range_algorithm_non_mutating_algorithms.binary_search.complexity"></a><h6>
-<a name="id686210"></a>
+<a name="id3072682"></a>
             <a class="link" href="binary_search.html#range.reference.algorithms.range_algorithm_non_mutating_algorithms.binary_search.complexity">Complexity</a>
           </h6>
 <p>
diff --git a/doc/html/range/reference/algorithms/range_algorithm_non_mutating_algorithms/count.html b/doc/html/range/reference/algorithms/range_algorithm_non_mutating_algorithms/count.html
index 3e36aa5..73a26b8 100644
--- a/doc/html/range/reference/algorithms/range_algorithm_non_mutating_algorithms/count.html
+++ b/doc/html/range/reference/algorithms/range_algorithm_non_mutating_algorithms/count.html
@@ -3,7 +3,7 @@
 <meta http-equiv="Content-Type" content="text/html; charset=US-ASCII">
 <title>count</title>
 <link rel="stylesheet" href="../../../../../../../../doc/html/boostbook.css" type="text/css">
-<meta name="generator" content="DocBook XSL Stylesheets V1.75.2">
+<meta name="generator" content="DocBook XSL Stylesheets V1.75.1">
 <link rel="home" href="../../../../index.html" title="Chapter&#160;1.&#160;Range 2.0">
 <link rel="up" href="../range_algorithm_non_mutating_algorithms.html" title="Non-mutating algorithms">
 <link rel="prev" href="binary_search.html" title="binary_search">
@@ -28,7 +28,7 @@
           count</a>
 </h5></div></div></div>
 <a name="range.reference.algorithms.range_algorithm_non_mutating_algorithms.count.prototype"></a><h6>
-<a name="id686377"></a>
+<a name="id3072858"></a>
             <a class="link" href="count.html#range.reference.algorithms.range_algorithm_non_mutating_algorithms.count.prototype">Prototype</a>
           </h6>
 <p>
@@ -45,7 +45,7 @@
 <p>
           </p>
 <a name="range.reference.algorithms.range_algorithm_non_mutating_algorithms.count.description"></a><h6>
-<a name="id686672"></a>
+<a name="id3073157"></a>
             <a class="link" href="count.html#range.reference.algorithms.range_algorithm_non_mutating_algorithms.count.description">Description</a>
           </h6>
 <p>
@@ -55,14 +55,14 @@
             is <code class="computeroutput"><span class="keyword">true</span></code>.
           </p>
 <a name="range.reference.algorithms.range_algorithm_non_mutating_algorithms.count.definition"></a><h6>
-<a name="id686759"></a>
+<a name="id3073249"></a>
             <a class="link" href="count.html#range.reference.algorithms.range_algorithm_non_mutating_algorithms.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.range_algorithm_non_mutating_algorithms.count.requirements"></a><h6>
-<a name="id686830"></a>
+<a name="id3073324"></a>
             <a class="link" href="count.html#range.reference.algorithms.range_algorithm_non_mutating_algorithms.count.requirements">Requirements</a>
           </h6>
 <div class="itemizedlist"><ul class="itemizedlist" type="disc">
@@ -85,7 +85,7 @@
             </li>
 </ul></div>
 <a name="range.reference.algorithms.range_algorithm_non_mutating_algorithms.count.complexity"></a><h6>
-<a name="id686950"></a>
+<a name="id3073452"></a>
             <a class="link" href="count.html#range.reference.algorithms.range_algorithm_non_mutating_algorithms.count.complexity">Complexity</a>
           </h6>
 <p>
diff --git a/doc/html/range/reference/algorithms/range_algorithm_non_mutating_algorithms/equal.html b/doc/html/range/reference/algorithms/range_algorithm_non_mutating_algorithms/equal.html
index bb6187c..d581af7 100644
--- a/doc/html/range/reference/algorithms/range_algorithm_non_mutating_algorithms/equal.html
+++ b/doc/html/range/reference/algorithms/range_algorithm_non_mutating_algorithms/equal.html
@@ -3,7 +3,7 @@
 <meta http-equiv="Content-Type" content="text/html; charset=US-ASCII">
 <title>equal</title>
 <link rel="stylesheet" href="../../../../../../../../doc/html/boostbook.css" type="text/css">
-<meta name="generator" content="DocBook XSL Stylesheets V1.75.2">
+<meta name="generator" content="DocBook XSL Stylesheets V1.75.1">
 <link rel="home" href="../../../../index.html" title="Chapter&#160;1.&#160;Range 2.0">
 <link rel="up" href="../range_algorithm_non_mutating_algorithms.html" title="Non-mutating algorithms">
 <link rel="prev" href="count.html" title="count">
@@ -28,7 +28,7 @@
           equal</a>
 </h5></div></div></div>
 <a name="range.reference.algorithms.range_algorithm_non_mutating_algorithms.equal.prototype"></a><h6>
-<a name="id687016"></a>
+<a name="id3073524"></a>
             <a class="link" href="equal.html#range.reference.algorithms.range_algorithm_non_mutating_algorithms.equal.prototype">Prototype</a>
           </h6>
 <p>
@@ -53,7 +53,7 @@
 <p>
           </p>
 <a name="range.reference.algorithms.range_algorithm_non_mutating_algorithms.equal.description"></a><h6>
-<a name="id687299"></a>
+<a name="id3073812"></a>
             <a class="link" href="equal.html#range.reference.algorithms.range_algorithm_non_mutating_algorithms.equal.description">Description</a>
           </h6>
 <p>
@@ -71,14 +71,14 @@
             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.range_algorithm_non_mutating_algorithms.equal.definition"></a><h6>
-<a name="id687532"></a>
+<a name="id3074057"></a>
             <a class="link" href="equal.html#range.reference.algorithms.range_algorithm_non_mutating_algorithms.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.range_algorithm_non_mutating_algorithms.equal.requirements"></a><h6>
-<a name="id687603"></a>
+<a name="id3074132"></a>
             <a class="link" href="equal.html#range.reference.algorithms.range_algorithm_non_mutating_algorithms.equal.requirements">Requirements</a>
           </h6>
 <p>
@@ -139,7 +139,7 @@
             </li>
 </ul></div>
 <a name="range.reference.algorithms.range_algorithm_non_mutating_algorithms.equal.complexity"></a><h6>
-<a name="id687881"></a>
+<a name="id3074430"></a>
             <a class="link" href="equal.html#range.reference.algorithms.range_algorithm_non_mutating_algorithms.equal.complexity">Complexity</a>
           </h6>
 <p>
diff --git a/doc/html/range/reference/algorithms/range_algorithm_non_mutating_algorithms/equal_range.html b/doc/html/range/reference/algorithms/range_algorithm_non_mutating_algorithms/equal_range.html
index 8ba9948..88d3af6 100644
--- a/doc/html/range/reference/algorithms/range_algorithm_non_mutating_algorithms/equal_range.html
+++ b/doc/html/range/reference/algorithms/range_algorithm_non_mutating_algorithms/equal_range.html
@@ -3,7 +3,7 @@
 <meta http-equiv="Content-Type" content="text/html; charset=US-ASCII">
 <title>equal_range</title>
 <link rel="stylesheet" href="../../../../../../../../doc/html/boostbook.css" type="text/css">
-<meta name="generator" content="DocBook XSL Stylesheets V1.75.2">
+<meta name="generator" content="DocBook XSL Stylesheets V1.75.1">
 <link rel="home" href="../../../../index.html" title="Chapter&#160;1.&#160;Range 2.0">
 <link rel="up" href="../range_algorithm_non_mutating_algorithms.html" title="Non-mutating algorithms">
 <link rel="prev" href="equal.html" title="equal">
@@ -28,7 +28,7 @@
           equal_range</a>
 </h5></div></div></div>
 <a name="range.reference.algorithms.range_algorithm_non_mutating_algorithms.equal_range.prototype"></a><h6>
-<a name="id687976"></a>
+<a name="id3074530"></a>
             <a class="link" href="equal_range.html#range.reference.algorithms.range_algorithm_non_mutating_algorithms.equal_range.prototype">Prototype</a>
           </h6>
 <p>
@@ -71,7 +71,7 @@
 <p>
           </p>
 <a name="range.reference.algorithms.range_algorithm_non_mutating_algorithms.equal_range.description"></a><h6>
-<a name="id688850"></a>
+<a name="id3075412"></a>
             <a class="link" href="equal_range.html#range.reference.algorithms.range_algorithm_non_mutating_algorithms.equal_range.description">Description</a>
           </h6>
 <p>
@@ -85,14 +85,14 @@
             is determined by <code class="computeroutput"><span class="identifier">pred</span></code>.
           </p>
 <a name="range.reference.algorithms.range_algorithm_non_mutating_algorithms.equal_range.definition"></a><h6>
-<a name="id688996"></a>
+<a name="id3075566"></a>
             <a class="link" href="equal_range.html#range.reference.algorithms.range_algorithm_non_mutating_algorithms.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.range_algorithm_non_mutating_algorithms.equal_range.requirements"></a><h6>
-<a name="id689068"></a>
+<a name="id3075640"></a>
             <a class="link" href="equal_range.html#range.reference.algorithms.range_algorithm_non_mutating_algorithms.equal_range.requirements">Requirements</a>
           </h6>
 <p>
@@ -143,7 +143,7 @@
             </li>
 </ul></div>
 <a name="range.reference.algorithms.range_algorithm_non_mutating_algorithms.equal_range.precondition_"></a><h6>
-<a name="id689312"></a>
+<a name="id3075899"></a>
             <a class="link" href="equal_range.html#range.reference.algorithms.range_algorithm_non_mutating_algorithms.equal_range.precondition_">Precondition:</a>
           </h6>
 <p>
@@ -155,7 +155,7 @@
             is ordered in ascending order according to <code class="computeroutput"><span class="identifier">pred</span></code>.
           </p>
 <a name="range.reference.algorithms.range_algorithm_non_mutating_algorithms.equal_range.complexity"></a><h6>
-<a name="id689388"></a>
+<a name="id3075982"></a>
             <a class="link" href="equal_range.html#range.reference.algorithms.range_algorithm_non_mutating_algorithms.equal_range.complexity">Complexity</a>
           </h6>
 <p>
diff --git a/doc/html/range/reference/algorithms/range_algorithm_non_mutating_algorithms/find.html b/doc/html/range/reference/algorithms/range_algorithm_non_mutating_algorithms/find.html
index 05db375..f9fff13 100644
--- a/doc/html/range/reference/algorithms/range_algorithm_non_mutating_algorithms/find.html
+++ b/doc/html/range/reference/algorithms/range_algorithm_non_mutating_algorithms/find.html
@@ -3,7 +3,7 @@
 <meta http-equiv="Content-Type" content="text/html; charset=US-ASCII">
 <title>find</title>
 <link rel="stylesheet" href="../../../../../../../../doc/html/boostbook.css" type="text/css">
-<meta name="generator" content="DocBook XSL Stylesheets V1.75.2">
+<meta name="generator" content="DocBook XSL Stylesheets V1.75.1">
 <link rel="home" href="../../../../index.html" title="Chapter&#160;1.&#160;Range 2.0">
 <link rel="up" href="../range_algorithm_non_mutating_algorithms.html" title="Non-mutating algorithms">
 <link rel="prev" href="for_each.html" title="for_each">
@@ -28,7 +28,7 @@
           find</a>
 </h5></div></div></div>
 <a name="range.reference.algorithms.range_algorithm_non_mutating_algorithms.find.prototype"></a><h6>
-<a name="id690044"></a>
+<a name="id3076673"></a>
             <a class="link" href="find.html#range.reference.algorithms.range_algorithm_non_mutating_algorithms.find.prototype">Prototype</a>
           </h6>
 <p>
@@ -49,7 +49,7 @@
 <p>
           </p>
 <a name="range.reference.algorithms.range_algorithm_non_mutating_algorithms.find.description"></a><h6>
-<a name="id690333"></a>
+<a name="id3076968"></a>
             <a class="link" href="find.html#range.reference.algorithms.range_algorithm_non_mutating_algorithms.find.description">Description</a>
           </h6>
 <p>
@@ -60,14 +60,14 @@
             same manner as the returned iterator described above.
           </p>
 <a name="range.reference.algorithms.range_algorithm_non_mutating_algorithms.find.definition"></a><h6>
-<a name="id690450"></a>
+<a name="id3077093"></a>
             <a class="link" href="find.html#range.reference.algorithms.range_algorithm_non_mutating_algorithms.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.range_algorithm_non_mutating_algorithms.find.requirements"></a><h6>
-<a name="id690521"></a>
+<a name="id3077169"></a>
             <a class="link" href="find.html#range.reference.algorithms.range_algorithm_non_mutating_algorithms.find.requirements">Requirements</a>
           </h6>
 <div class="itemizedlist"><ul class="itemizedlist" type="disc">
@@ -88,7 +88,7 @@
             </li>
 </ul></div>
 <a name="range.reference.algorithms.range_algorithm_non_mutating_algorithms.find.complexity"></a><h6>
-<a name="id690630"></a>
+<a name="id3077286"></a>
             <a class="link" href="find.html#range.reference.algorithms.range_algorithm_non_mutating_algorithms.find.complexity">Complexity</a>
           </h6>
 <p>
diff --git a/doc/html/range/reference/algorithms/range_algorithm_non_mutating_algorithms/find_end.html b/doc/html/range/reference/algorithms/range_algorithm_non_mutating_algorithms/find_end.html
index b5ab6b0..f6a9b8b 100644
--- a/doc/html/range/reference/algorithms/range_algorithm_non_mutating_algorithms/find_end.html
+++ b/doc/html/range/reference/algorithms/range_algorithm_non_mutating_algorithms/find_end.html
@@ -3,7 +3,7 @@
 <meta http-equiv="Content-Type" content="text/html; charset=US-ASCII">
 <title>find_end</title>
 <link rel="stylesheet" href="../../../../../../../../doc/html/boostbook.css" type="text/css">
-<meta name="generator" content="DocBook XSL Stylesheets V1.75.2">
+<meta name="generator" content="DocBook XSL Stylesheets V1.75.1">
 <link rel="home" href="../../../../index.html" title="Chapter&#160;1.&#160;Range 2.0">
 <link rel="up" href="../range_algorithm_non_mutating_algorithms.html" title="Non-mutating algorithms">
 <link rel="prev" href="find.html" title="find">
@@ -28,7 +28,7 @@
           find_end</a>
 </h5></div></div></div>
 <a name="range.reference.algorithms.range_algorithm_non_mutating_algorithms.find_end.prototype"></a><h6>
-<a name="id690698"></a>
+<a name="id3077359"></a>
             <a class="link" href="find_end.html#range.reference.algorithms.range_algorithm_non_mutating_algorithms.find_end.prototype">Prototype</a>
           </h6>
 <p>
@@ -66,7 +66,7 @@
 <p>
           </p>
 <a name="range.reference.algorithms.range_algorithm_non_mutating_algorithms.find_end.description"></a><h6>
-<a name="id691357"></a>
+<a name="id3078027"></a>
             <a class="link" href="find_end.html#range.reference.algorithms.range_algorithm_non_mutating_algorithms.find_end.description">Description</a>
           </h6>
 <p>
@@ -81,14 +81,14 @@
             same manner as the returned iterator described above.
           </p>
 <a name="range.reference.algorithms.range_algorithm_non_mutating_algorithms.find_end.definition"></a><h6>
-<a name="id691482"></a>
+<a name="id3078162"></a>
             <a class="link" href="find_end.html#range.reference.algorithms.range_algorithm_non_mutating_algorithms.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.range_algorithm_non_mutating_algorithms.find_end.requirements"></a><h6>
-<a name="id691555"></a>
+<a name="id3078236"></a>
             <a class="link" href="find_end.html#range.reference.algorithms.range_algorithm_non_mutating_algorithms.find_end.requirements">Requirements</a>
           </h6>
 <p>
@@ -148,7 +148,7 @@
             </li>
 </ul></div>
 <a name="range.reference.algorithms.range_algorithm_non_mutating_algorithms.find_end.complexity"></a><h6>
-<a name="id691833"></a>
+<a name="id3078536"></a>
             <a class="link" href="find_end.html#range.reference.algorithms.range_algorithm_non_mutating_algorithms.find_end.complexity">Complexity</a>
           </h6>
 <p>
diff --git a/doc/html/range/reference/algorithms/range_algorithm_non_mutating_algorithms/find_first_of.html b/doc/html/range/reference/algorithms/range_algorithm_non_mutating_algorithms/find_first_of.html
index a8de6a4..cb3cc79 100644
--- a/doc/html/range/reference/algorithms/range_algorithm_non_mutating_algorithms/find_first_of.html
+++ b/doc/html/range/reference/algorithms/range_algorithm_non_mutating_algorithms/find_first_of.html
@@ -3,7 +3,7 @@
 <meta http-equiv="Content-Type" content="text/html; charset=US-ASCII">
 <title>find_first_of</title>
 <link rel="stylesheet" href="../../../../../../../../doc/html/boostbook.css" type="text/css">
-<meta name="generator" content="DocBook XSL Stylesheets V1.75.2">
+<meta name="generator" content="DocBook XSL Stylesheets V1.75.1">
 <link rel="home" href="../../../../index.html" title="Chapter&#160;1.&#160;Range 2.0">
 <link rel="up" href="../range_algorithm_non_mutating_algorithms.html" title="Non-mutating algorithms">
 <link rel="prev" href="find_end.html" title="find_end">
@@ -28,7 +28,7 @@
           find_first_of</a>
 </h5></div></div></div>
 <a name="range.reference.algorithms.range_algorithm_non_mutating_algorithms.find_first_of.prototype"></a><h6>
-<a name="id692006"></a>
+<a name="id3078718"></a>
             <a class="link" href="find_first_of.html#range.reference.algorithms.range_algorithm_non_mutating_algorithms.find_first_of.prototype">Prototype</a>
           </h6>
 <p>
@@ -66,7 +66,7 @@
 <p>
           </p>
 <a name="range.reference.algorithms.range_algorithm_non_mutating_algorithms.find_first_of.description"></a><h6>
-<a name="id692666"></a>
+<a name="id3079387"></a>
             <a class="link" href="find_first_of.html#range.reference.algorithms.range_algorithm_non_mutating_algorithms.find_first_of.description">Description</a>
           </h6>
 <p>
@@ -86,14 +86,14 @@
             same manner as the returned iterator described above.
           </p>
 <a name="range.reference.algorithms.range_algorithm_non_mutating_algorithms.find_first_of.definition"></a><h6>
-<a name="id692797"></a>
+<a name="id3079527"></a>
             <a class="link" href="find_first_of.html#range.reference.algorithms.range_algorithm_non_mutating_algorithms.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.range_algorithm_non_mutating_algorithms.find_first_of.requirements"></a><h6>
-<a name="id692870"></a>
+<a name="id3079602"></a>
             <a class="link" href="find_first_of.html#range.reference.algorithms.range_algorithm_non_mutating_algorithms.find_first_of.requirements">Requirements</a>
           </h6>
 <p>
@@ -147,7 +147,7 @@
             </li>
 </ul></div>
 <a name="range.reference.algorithms.range_algorithm_non_mutating_algorithms.find_first_of.complexity"></a><h6>
-<a name="id693110"></a>
+<a name="id3079860"></a>
             <a class="link" href="find_first_of.html#range.reference.algorithms.range_algorithm_non_mutating_algorithms.find_first_of.complexity">Complexity</a>
           </h6>
 <p>
diff --git a/doc/html/range/reference/algorithms/range_algorithm_non_mutating_algorithms/find_if.html b/doc/html/range/reference/algorithms/range_algorithm_non_mutating_algorithms/find_if.html
index 07df166..44cdde4 100644
--- a/doc/html/range/reference/algorithms/range_algorithm_non_mutating_algorithms/find_if.html
+++ b/doc/html/range/reference/algorithms/range_algorithm_non_mutating_algorithms/find_if.html
@@ -3,7 +3,7 @@
 <meta http-equiv="Content-Type" content="text/html; charset=US-ASCII">
 <title>find_if</title>
 <link rel="stylesheet" href="../../../../../../../../doc/html/boostbook.css" type="text/css">
-<meta name="generator" content="DocBook XSL Stylesheets V1.75.2">
+<meta name="generator" content="DocBook XSL Stylesheets V1.75.1">
 <link rel="home" href="../../../../index.html" title="Chapter&#160;1.&#160;Range 2.0">
 <link rel="up" href="../range_algorithm_non_mutating_algorithms.html" title="Non-mutating algorithms">
 <link rel="prev" href="find_first_of.html" title="find_first_of">
@@ -28,7 +28,7 @@
           find_if</a>
 </h5></div></div></div>
 <a name="range.reference.algorithms.range_algorithm_non_mutating_algorithms.find_if.prototype"></a><h6>
-<a name="id693199"></a>
+<a name="id3079958"></a>
             <a class="link" href="find_if.html#range.reference.algorithms.range_algorithm_non_mutating_algorithms.find_if.prototype">Prototype</a>
           </h6>
 <p>
@@ -49,7 +49,7 @@
 <p>
           </p>
 <a name="range.reference.algorithms.range_algorithm_non_mutating_algorithms.find_if.description"></a><h6>
-<a name="id693489"></a>
+<a name="id3080253"></a>
             <a class="link" href="find_if.html#range.reference.algorithms.range_algorithm_non_mutating_algorithms.find_if.description">Description</a>
           </h6>
 <p>
@@ -64,14 +64,14 @@
             defines found in the same manner as the returned iterator described above.
           </p>
 <a name="range.reference.algorithms.range_algorithm_non_mutating_algorithms.find_if.definition"></a><h6>
-<a name="id693619"></a>
+<a name="id3080390"></a>
             <a class="link" href="find_if.html#range.reference.algorithms.range_algorithm_non_mutating_algorithms.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.range_algorithm_non_mutating_algorithms.find_if.requirements"></a><h6>
-<a name="id693689"></a>
+<a name="id3080464"></a>
             <a class="link" href="find_if.html#range.reference.algorithms.range_algorithm_non_mutating_algorithms.find_if.requirements">Requirements</a>
           </h6>
 <div class="itemizedlist"><ul class="itemizedlist" type="disc">
@@ -90,7 +90,7 @@
             </li>
 </ul></div>
 <a name="range.reference.algorithms.range_algorithm_non_mutating_algorithms.find_if.precondition_"></a><h6>
-<a name="id693785"></a>
+<a name="id3080567"></a>
             <a class="link" href="find_if.html#range.reference.algorithms.range_algorithm_non_mutating_algorithms.find_if.precondition_">Precondition:</a>
           </h6>
 <p>
@@ -98,7 +98,7 @@
             <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.range_algorithm_non_mutating_algorithms.find_if.complexity"></a><h6>
-<a name="id693855"></a>
+<a name="id3080643"></a>
             <a class="link" href="find_if.html#range.reference.algorithms.range_algorithm_non_mutating_algorithms.find_if.complexity">Complexity</a>
           </h6>
 <p>
diff --git a/doc/html/range/reference/algorithms/range_algorithm_non_mutating_algorithms/for_each.html b/doc/html/range/reference/algorithms/range_algorithm_non_mutating_algorithms/for_each.html
index f90bdc6..0ea9130 100644
--- a/doc/html/range/reference/algorithms/range_algorithm_non_mutating_algorithms/for_each.html
+++ b/doc/html/range/reference/algorithms/range_algorithm_non_mutating_algorithms/for_each.html
@@ -3,7 +3,7 @@
 <meta http-equiv="Content-Type" content="text/html; charset=US-ASCII">
 <title>for_each</title>
 <link rel="stylesheet" href="../../../../../../../../doc/html/boostbook.css" type="text/css">
-<meta name="generator" content="DocBook XSL Stylesheets V1.75.2">
+<meta name="generator" content="DocBook XSL Stylesheets V1.75.1">
 <link rel="home" href="../../../../index.html" title="Chapter&#160;1.&#160;Range 2.0">
 <link rel="up" href="../range_algorithm_non_mutating_algorithms.html" title="Non-mutating algorithms">
 <link rel="prev" href="equal_range.html" title="equal_range">
@@ -28,7 +28,7 @@
           for_each</a>
 </h5></div></div></div>
 <a name="range.reference.algorithms.range_algorithm_non_mutating_algorithms.for_each.prototype"></a><h6>
-<a name="id689482"></a>
+<a name="id3076084"></a>
             <a class="link" href="for_each.html#range.reference.algorithms.range_algorithm_non_mutating_algorithms.for_each.prototype">Prototype</a>
           </h6>
 <p>
@@ -49,7 +49,7 @@
 <p>
           </p>
 <a name="range.reference.algorithms.range_algorithm_non_mutating_algorithms.for_each.description"></a><h6>
-<a name="id689706"></a>
+<a name="id3076313"></a>
             <a class="link" href="for_each.html#range.reference.algorithms.range_algorithm_non_mutating_algorithms.for_each.description">Description</a>
           </h6>
 <p>
@@ -59,14 +59,14 @@
             <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.range_algorithm_non_mutating_algorithms.for_each.definition"></a><h6>
-<a name="id689786"></a>
+<a name="id3076397"></a>
             <a class="link" href="for_each.html#range.reference.algorithms.range_algorithm_non_mutating_algorithms.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.range_algorithm_non_mutating_algorithms.for_each.requirements"></a><h6>
-<a name="id689858"></a>
+<a name="id3076472"></a>
             <a class="link" href="for_each.html#range.reference.algorithms.range_algorithm_non_mutating_algorithms.for_each.requirements">Requirements</a>
           </h6>
 <div class="itemizedlist"><ul class="itemizedlist" type="disc">
@@ -90,7 +90,7 @@
             </li>
 </ul></div>
 <a name="range.reference.algorithms.range_algorithm_non_mutating_algorithms.for_each.complexity"></a><h6>
-<a name="id689966"></a>
+<a name="id3076590"></a>
             <a class="link" href="for_each.html#range.reference.algorithms.range_algorithm_non_mutating_algorithms.for_each.complexity">Complexity</a>
           </h6>
 <p>
diff --git a/doc/html/range/reference/algorithms/range_algorithm_non_mutating_algorithms/lexicographical_compare.html b/doc/html/range/reference/algorithms/range_algorithm_non_mutating_algorithms/lexicographical_compare.html
index d10629d..0978050 100644
--- a/doc/html/range/reference/algorithms/range_algorithm_non_mutating_algorithms/lexicographical_compare.html
+++ b/doc/html/range/reference/algorithms/range_algorithm_non_mutating_algorithms/lexicographical_compare.html
@@ -3,7 +3,7 @@
 <meta http-equiv="Content-Type" content="text/html; charset=US-ASCII">
 <title>lexicographical_compare</title>
 <link rel="stylesheet" href="../../../../../../../../doc/html/boostbook.css" type="text/css">
-<meta name="generator" content="DocBook XSL Stylesheets V1.75.2">
+<meta name="generator" content="DocBook XSL Stylesheets V1.75.1">
 <link rel="home" href="../../../../index.html" title="Chapter&#160;1.&#160;Range 2.0">
 <link rel="up" href="../range_algorithm_non_mutating_algorithms.html" title="Non-mutating algorithms">
 <link rel="prev" href="find_if.html" title="find_if">
@@ -28,7 +28,7 @@
           lexicographical_compare</a>
 </h5></div></div></div>
 <a name="range.reference.algorithms.range_algorithm_non_mutating_algorithms.lexicographical_compare.prototype"></a><h6>
-<a name="id693934"></a>
+<a name="id3080727"></a>
             <a class="link" href="lexicographical_compare.html#range.reference.algorithms.range_algorithm_non_mutating_algorithms.lexicographical_compare.prototype">Prototype</a>
           </h6>
 <p>
@@ -53,7 +53,7 @@
 <p>
           </p>
 <a name="range.reference.algorithms.range_algorithm_non_mutating_algorithms.lexicographical_compare.description"></a><h6>
-<a name="id694218"></a>
+<a name="id3081018"></a>
             <a class="link" href="lexicographical_compare.html#range.reference.algorithms.range_algorithm_non_mutating_algorithms.lexicographical_compare.description">Description</a>
           </h6>
 <p>
@@ -73,14 +73,14 @@
             predicate versions.
           </p>
 <a name="range.reference.algorithms.range_algorithm_non_mutating_algorithms.lexicographical_compare.definition"></a><h6>
-<a name="id694385"></a>
+<a name="id3081200"></a>
             <a class="link" href="lexicographical_compare.html#range.reference.algorithms.range_algorithm_non_mutating_algorithms.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.range_algorithm_non_mutating_algorithms.lexicographical_compare.requirements"></a><h6>
-<a name="id694457"></a>
+<a name="id3081276"></a>
             <a class="link" href="lexicographical_compare.html#range.reference.algorithms.range_algorithm_non_mutating_algorithms.lexicographical_compare.requirements">Requirements</a>
           </h6>
 <p>
@@ -145,7 +145,7 @@
             </li>
 </ul></div>
 <a name="range.reference.algorithms.range_algorithm_non_mutating_algorithms.lexicographical_compare.complexity"></a><h6>
-<a name="id694801"></a>
+<a name="id3081642"></a>
             <a class="link" href="lexicographical_compare.html#range.reference.algorithms.range_algorithm_non_mutating_algorithms.lexicographical_compare.complexity">Complexity</a>
           </h6>
 <p>
diff --git a/doc/html/range/reference/algorithms/range_algorithm_non_mutating_algorithms/lower_bound.html b/doc/html/range/reference/algorithms/range_algorithm_non_mutating_algorithms/lower_bound.html
index 3eaa4e3..3a5a05d 100644
--- a/doc/html/range/reference/algorithms/range_algorithm_non_mutating_algorithms/lower_bound.html
+++ b/doc/html/range/reference/algorithms/range_algorithm_non_mutating_algorithms/lower_bound.html
@@ -3,7 +3,7 @@
 <meta http-equiv="Content-Type" content="text/html; charset=US-ASCII">
 <title>lower_bound</title>
 <link rel="stylesheet" href="../../../../../../../../doc/html/boostbook.css" type="text/css">
-<meta name="generator" content="DocBook XSL Stylesheets V1.75.2">
+<meta name="generator" content="DocBook XSL Stylesheets V1.75.1">
 <link rel="home" href="../../../../index.html" title="Chapter&#160;1.&#160;Range 2.0">
 <link rel="up" href="../range_algorithm_non_mutating_algorithms.html" title="Non-mutating algorithms">
 <link rel="prev" href="lexicographical_compare.html" title="lexicographical_compare">
@@ -28,7 +28,7 @@
           lower_bound</a>
 </h5></div></div></div>
 <a name="range.reference.algorithms.range_algorithm_non_mutating_algorithms.lower_bound.prototype"></a><h6>
-<a name="id694907"></a>
+<a name="id3081755"></a>
             <a class="link" href="lower_bound.html#range.reference.algorithms.range_algorithm_non_mutating_algorithms.lower_bound.prototype">Prototype</a>
           </h6>
 <p>
@@ -49,7 +49,7 @@
 <p>
           </p>
 <a name="range.reference.algorithms.range_algorithm_non_mutating_algorithms.lower_bound.description"></a><h6>
-<a name="id695197"></a>
+<a name="id3082050"></a>
             <a class="link" href="lower_bound.html#range.reference.algorithms.range_algorithm_non_mutating_algorithms.lower_bound.description">Description</a>
           </h6>
 <p>
@@ -72,14 +72,14 @@
             same manner as the returned iterator described above.
           </p>
 <a name="range.reference.algorithms.range_algorithm_non_mutating_algorithms.lower_bound.definition"></a><h6>
-<a name="id695387"></a>
+<a name="id3082251"></a>
             <a class="link" href="lower_bound.html#range.reference.algorithms.range_algorithm_non_mutating_algorithms.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.range_algorithm_non_mutating_algorithms.lower_bound.requirements"></a><h6>
-<a name="id695459"></a>
+<a name="id3082325"></a>
             <a class="link" href="lower_bound.html#range.reference.algorithms.range_algorithm_non_mutating_algorithms.lower_bound.requirements">Requirements</a>
           </h6>
 <p>
@@ -130,7 +130,7 @@
             </li>
 </ul></div>
 <a name="range.reference.algorithms.range_algorithm_non_mutating_algorithms.lower_bound.precondition_"></a><h6>
-<a name="id695704"></a>
+<a name="id3082585"></a>
             <a class="link" href="lower_bound.html#range.reference.algorithms.range_algorithm_non_mutating_algorithms.lower_bound.precondition_">Precondition:</a>
           </h6>
 <p>
@@ -148,7 +148,7 @@
             order according to <code class="computeroutput"><span class="identifier">pred</span></code>.
           </p>
 <a name="range.reference.algorithms.range_algorithm_non_mutating_algorithms.lower_bound.complexity"></a><h6>
-<a name="id695796"></a>
+<a name="id3082684"></a>
             <a class="link" href="lower_bound.html#range.reference.algorithms.range_algorithm_non_mutating_algorithms.lower_bound.complexity">Complexity</a>
           </h6>
 <p>
diff --git a/doc/html/range/reference/algorithms/range_algorithm_non_mutating_algorithms/max_element.html b/doc/html/range/reference/algorithms/range_algorithm_non_mutating_algorithms/max_element.html
index 552d3af..0e042fd 100644
--- a/doc/html/range/reference/algorithms/range_algorithm_non_mutating_algorithms/max_element.html
+++ b/doc/html/range/reference/algorithms/range_algorithm_non_mutating_algorithms/max_element.html
@@ -3,7 +3,7 @@
 <meta http-equiv="Content-Type" content="text/html; charset=US-ASCII">
 <title>max_element</title>
 <link rel="stylesheet" href="../../../../../../../../doc/html/boostbook.css" type="text/css">
-<meta name="generator" content="DocBook XSL Stylesheets V1.75.2">
+<meta name="generator" content="DocBook XSL Stylesheets V1.75.1">
 <link rel="home" href="../../../../index.html" title="Chapter&#160;1.&#160;Range 2.0">
 <link rel="up" href="../range_algorithm_non_mutating_algorithms.html" title="Non-mutating algorithms">
 <link rel="prev" href="lower_bound.html" title="lower_bound">
@@ -28,7 +28,7 @@
           max_element</a>
 </h5></div></div></div>
 <a name="range.reference.algorithms.range_algorithm_non_mutating_algorithms.max_element.prototype"></a><h6>
-<a name="id695936"></a>
+<a name="id3082835"></a>
             <a class="link" href="max_element.html#range.reference.algorithms.range_algorithm_non_mutating_algorithms.max_element.prototype">Prototype</a>
           </h6>
 <p>
@@ -84,7 +84,7 @@
 <p>
           </p>
 <a name="range.reference.algorithms.range_algorithm_non_mutating_algorithms.max_element.description"></a><h6>
-<a name="id696924"></a>
+<a name="id3083831"></a>
             <a class="link" href="max_element.html#range.reference.algorithms.range_algorithm_non_mutating_algorithms.max_element.description">Description</a>
           </h6>
 <p>
@@ -98,14 +98,14 @@
             same manner as the returned iterator described above.
           </p>
 <a name="range.reference.algorithms.range_algorithm_non_mutating_algorithms.max_element.definition"></a><h6>
-<a name="id697019"></a>
+<a name="id3083934"></a>
             <a class="link" href="max_element.html#range.reference.algorithms.range_algorithm_non_mutating_algorithms.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.range_algorithm_non_mutating_algorithms.max_element.requirements"></a><h6>
-<a name="id697092"></a>
+<a name="id3084009"></a>
             <a class="link" href="max_element.html#range.reference.algorithms.range_algorithm_non_mutating_algorithms.max_element.requirements">Requirements</a>
           </h6>
 <p>
@@ -142,7 +142,7 @@
             </li>
 </ul></div>
 <a name="range.reference.algorithms.range_algorithm_non_mutating_algorithms.max_element.complexity"></a><h6>
-<a name="id697255"></a>
+<a name="id3084182"></a>
             <a class="link" href="max_element.html#range.reference.algorithms.range_algorithm_non_mutating_algorithms.max_element.complexity">Complexity</a>
           </h6>
 <p>
diff --git a/doc/html/range/reference/algorithms/range_algorithm_non_mutating_algorithms/min_element.html b/doc/html/range/reference/algorithms/range_algorithm_non_mutating_algorithms/min_element.html
index 675196b..4752df4 100644
--- a/doc/html/range/reference/algorithms/range_algorithm_non_mutating_algorithms/min_element.html
+++ b/doc/html/range/reference/algorithms/range_algorithm_non_mutating_algorithms/min_element.html
@@ -3,7 +3,7 @@
 <meta http-equiv="Content-Type" content="text/html; charset=US-ASCII">
 <title>min_element</title>
 <link rel="stylesheet" href="../../../../../../../../doc/html/boostbook.css" type="text/css">
-<meta name="generator" content="DocBook XSL Stylesheets V1.75.2">
+<meta name="generator" content="DocBook XSL Stylesheets V1.75.1">
 <link rel="home" href="../../../../index.html" title="Chapter&#160;1.&#160;Range 2.0">
 <link rel="up" href="../range_algorithm_non_mutating_algorithms.html" title="Non-mutating algorithms">
 <link rel="prev" href="max_element.html" title="max_element">
@@ -28,7 +28,7 @@
           min_element</a>
 </h5></div></div></div>
 <a name="range.reference.algorithms.range_algorithm_non_mutating_algorithms.min_element.prototype"></a><h6>
-<a name="id697357"></a>
+<a name="id3084290"></a>
             <a class="link" href="min_element.html#range.reference.algorithms.range_algorithm_non_mutating_algorithms.min_element.prototype">Prototype</a>
           </h6>
 <p>
@@ -84,7 +84,7 @@
 <p>
           </p>
 <a name="range.reference.algorithms.range_algorithm_non_mutating_algorithms.min_element.description"></a><h6>
-<a name="id698344"></a>
+<a name="id3085286"></a>
             <a class="link" href="min_element.html#range.reference.algorithms.range_algorithm_non_mutating_algorithms.min_element.description">Description</a>
           </h6>
 <p>
@@ -98,14 +98,14 @@
             same manner as the returned iterator described above.
           </p>
 <a name="range.reference.algorithms.range_algorithm_non_mutating_algorithms.min_element.definition"></a><h6>
-<a name="id698440"></a>
+<a name="id3085390"></a>
             <a class="link" href="min_element.html#range.reference.algorithms.range_algorithm_non_mutating_algorithms.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.range_algorithm_non_mutating_algorithms.min_element.requirements"></a><h6>
-<a name="id698513"></a>
+<a name="id3085465"></a>
             <a class="link" href="min_element.html#range.reference.algorithms.range_algorithm_non_mutating_algorithms.min_element.requirements">Requirements</a>
           </h6>
 <p>
@@ -142,7 +142,7 @@
             </li>
 </ul></div>
 <a name="range.reference.algorithms.range_algorithm_non_mutating_algorithms.min_element.complexity"></a><h6>
-<a name="id698675"></a>
+<a name="id3085639"></a>
             <a class="link" href="min_element.html#range.reference.algorithms.range_algorithm_non_mutating_algorithms.min_element.complexity">Complexity</a>
           </h6>
 <p>
diff --git a/doc/html/range/reference/algorithms/range_algorithm_non_mutating_algorithms/mismatch.html b/doc/html/range/reference/algorithms/range_algorithm_non_mutating_algorithms/mismatch.html
index 572dd69..3af4682 100644
--- a/doc/html/range/reference/algorithms/range_algorithm_non_mutating_algorithms/mismatch.html
+++ b/doc/html/range/reference/algorithms/range_algorithm_non_mutating_algorithms/mismatch.html
@@ -3,7 +3,7 @@
 <meta http-equiv="Content-Type" content="text/html; charset=US-ASCII">
 <title>mismatch</title>
 <link rel="stylesheet" href="../../../../../../../../doc/html/boostbook.css" type="text/css">
-<meta name="generator" content="DocBook XSL Stylesheets V1.75.2">
+<meta name="generator" content="DocBook XSL Stylesheets V1.75.1">
 <link rel="home" href="../../../../index.html" title="Chapter&#160;1.&#160;Range 2.0">
 <link rel="up" href="../range_algorithm_non_mutating_algorithms.html" title="Non-mutating algorithms">
 <link rel="prev" href="min_element.html" title="min_element">
@@ -28,7 +28,7 @@
           mismatch</a>
 </h5></div></div></div>
 <a name="range.reference.algorithms.range_algorithm_non_mutating_algorithms.mismatch.prototype"></a><h6>
-<a name="id698775"></a>
+<a name="id3085747"></a>
             <a class="link" href="mismatch.html#range.reference.algorithms.range_algorithm_non_mutating_algorithms.mismatch.prototype">Prototype</a>
           </h6>
 <p>
@@ -106,7 +106,7 @@
 <p>
           </p>
 <a name="range.reference.algorithms.range_algorithm_non_mutating_algorithms.mismatch.description"></a><h6>
-<a name="id700480"></a>
+<a name="id3087466"></a>
             <a class="link" href="mismatch.html#range.reference.algorithms.range_algorithm_non_mutating_algorithms.mismatch.description">Description</a>
           </h6>
 <p>
@@ -124,14 +124,14 @@
             same manner as the returned iterator described above.
           </p>
 <a name="range.reference.algorithms.range_algorithm_non_mutating_algorithms.mismatch.definition"></a><h6>
-<a name="id700612"></a>
+<a name="id3087609"></a>
             <a class="link" href="mismatch.html#range.reference.algorithms.range_algorithm_non_mutating_algorithms.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.range_algorithm_non_mutating_algorithms.mismatch.requirements"></a><h6>
-<a name="id700685"></a>
+<a name="id3087682"></a>
             <a class="link" href="mismatch.html#range.reference.algorithms.range_algorithm_non_mutating_algorithms.mismatch.requirements">Requirements</a>
           </h6>
 <p>
@@ -192,14 +192,14 @@
             </li>
 </ul></div>
 <a name="range.reference.algorithms.range_algorithm_non_mutating_algorithms.mismatch.precondition_"></a><h6>
-<a name="id700965"></a>
+<a name="id3087980"></a>
             <a class="link" href="mismatch.html#range.reference.algorithms.range_algorithm_non_mutating_algorithms.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.range_algorithm_non_mutating_algorithms.mismatch.complexity"></a><h6>
-<a name="id701037"></a>
+<a name="id3088056"></a>
             <a class="link" href="mismatch.html#range.reference.algorithms.range_algorithm_non_mutating_algorithms.mismatch.complexity">Complexity</a>
           </h6>
 <p>
diff --git a/doc/html/range/reference/algorithms/range_algorithm_non_mutating_algorithms/search.html b/doc/html/range/reference/algorithms/range_algorithm_non_mutating_algorithms/search.html
index 03b528c..93994e9 100644
--- a/doc/html/range/reference/algorithms/range_algorithm_non_mutating_algorithms/search.html
+++ b/doc/html/range/reference/algorithms/range_algorithm_non_mutating_algorithms/search.html
@@ -3,7 +3,7 @@
 <meta http-equiv="Content-Type" content="text/html; charset=US-ASCII">
 <title>search</title>
 <link rel="stylesheet" href="../../../../../../../../doc/html/boostbook.css" type="text/css">
-<meta name="generator" content="DocBook XSL Stylesheets V1.75.2">
+<meta name="generator" content="DocBook XSL Stylesheets V1.75.1">
 <link rel="home" href="../../../../index.html" title="Chapter&#160;1.&#160;Range 2.0">
 <link rel="up" href="../range_algorithm_non_mutating_algorithms.html" title="Non-mutating algorithms">
 <link rel="prev" href="mismatch.html" title="mismatch">
@@ -28,7 +28,7 @@
           search</a>
 </h5></div></div></div>
 <a name="range.reference.algorithms.range_algorithm_non_mutating_algorithms.search.prototype"></a><h6>
-<a name="id701103"></a>
+<a name="id3088129"></a>
             <a class="link" href="search.html#range.reference.algorithms.range_algorithm_non_mutating_algorithms.search.prototype">Prototype</a>
           </h6>
 <p>
@@ -96,7 +96,7 @@
 <p>
           </p>
 <a name="range.reference.algorithms.range_algorithm_non_mutating_algorithms.search.description"></a><h6>
-<a name="id702442"></a>
+<a name="id3089479"></a>
             <a class="link" href="search.html#range.reference.algorithms.range_algorithm_non_mutating_algorithms.search.description">Description</a>
           </h6>
 <p>
@@ -115,14 +115,14 @@
             same manner as the returned iterator described above.
           </p>
 <a name="range.reference.algorithms.range_algorithm_non_mutating_algorithms.search.definition"></a><h6>
-<a name="id702607"></a>
+<a name="id3089656"></a>
             <a class="link" href="search.html#range.reference.algorithms.range_algorithm_non_mutating_algorithms.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.range_algorithm_non_mutating_algorithms.search.requirements"></a><h6>
-<a name="id702678"></a>
+<a name="id3089731"></a>
             <a class="link" href="search.html#range.reference.algorithms.range_algorithm_non_mutating_algorithms.search.requirements">Requirements</a>
           </h6>
 <p>
@@ -183,7 +183,7 @@
             </li>
 </ul></div>
 <a name="range.reference.algorithms.range_algorithm_non_mutating_algorithms.search.complexity"></a><h6>
-<a name="id702956"></a>
+<a name="id3090029"></a>
             <a class="link" href="search.html#range.reference.algorithms.range_algorithm_non_mutating_algorithms.search.complexity">Complexity</a>
           </h6>
 <p>
diff --git a/doc/html/range/reference/algorithms/range_algorithm_non_mutating_algorithms/upper_bound.html b/doc/html/range/reference/algorithms/range_algorithm_non_mutating_algorithms/upper_bound.html
index e73149f..14f5248 100644
--- a/doc/html/range/reference/algorithms/range_algorithm_non_mutating_algorithms/upper_bound.html
+++ b/doc/html/range/reference/algorithms/range_algorithm_non_mutating_algorithms/upper_bound.html
@@ -3,7 +3,7 @@
 <meta http-equiv="Content-Type" content="text/html; charset=US-ASCII">
 <title>upper_bound</title>
 <link rel="stylesheet" href="../../../../../../../../doc/html/boostbook.css" type="text/css">
-<meta name="generator" content="DocBook XSL Stylesheets V1.75.2">
+<meta name="generator" content="DocBook XSL Stylesheets V1.75.1">
 <link rel="home" href="../../../../index.html" title="Chapter&#160;1.&#160;Range 2.0">
 <link rel="up" href="../range_algorithm_non_mutating_algorithms.html" title="Non-mutating algorithms">
 <link rel="prev" href="search.html" title="search">
@@ -28,7 +28,7 @@
           upper_bound</a>
 </h5></div></div></div>
 <a name="range.reference.algorithms.range_algorithm_non_mutating_algorithms.upper_bound.prototype"></a><h6>
-<a name="id703000"></a>
+<a name="id3090079"></a>
             <a class="link" href="upper_bound.html#range.reference.algorithms.range_algorithm_non_mutating_algorithms.upper_bound.prototype">Prototype</a>
           </h6>
 <p>
@@ -49,7 +49,7 @@
 <p>
           </p>
 <a name="range.reference.algorithms.range_algorithm_non_mutating_algorithms.upper_bound.description"></a><h6>
-<a name="id703290"></a>
+<a name="id3090374"></a>
             <a class="link" href="upper_bound.html#range.reference.algorithms.range_algorithm_non_mutating_algorithms.upper_bound.description">Description</a>
           </h6>
 <p>
@@ -71,14 +71,14 @@
             same manner as the returned iterator described above.
           </p>
 <a name="range.reference.algorithms.range_algorithm_non_mutating_algorithms.upper_bound.definition"></a><h6>
-<a name="id703484"></a>
+<a name="id3090578"></a>
             <a class="link" href="upper_bound.html#range.reference.algorithms.range_algorithm_non_mutating_algorithms.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.range_algorithm_non_mutating_algorithms.upper_bound.requirements"></a><h6>
-<a name="id703555"></a>
+<a name="id3090654"></a>
             <a class="link" href="upper_bound.html#range.reference.algorithms.range_algorithm_non_mutating_algorithms.upper_bound.requirements">Requirements</a>
           </h6>
 <p>
@@ -129,7 +129,7 @@
             </li>
 </ul></div>
 <a name="range.reference.algorithms.range_algorithm_non_mutating_algorithms.upper_bound.precondition_"></a><h6>
-<a name="id703799"></a>
+<a name="id3090913"></a>
             <a class="link" href="upper_bound.html#range.reference.algorithms.range_algorithm_non_mutating_algorithms.upper_bound.precondition_">Precondition:</a>
           </h6>
 <p>
@@ -147,7 +147,7 @@
             order according to <code class="computeroutput"><span class="identifier">pred</span></code>.
           </p>
 <a name="range.reference.algorithms.range_algorithm_non_mutating_algorithms.upper_bound.complexity"></a><h6>
-<a name="id703891"></a>
+<a name="id3091011"></a>
             <a class="link" href="upper_bound.html#range.reference.algorithms.range_algorithm_non_mutating_algorithms.upper_bound.complexity">Complexity</a>
           </h6>
 <p>
diff --git a/doc/html/range/reference/algorithms/range_numeric.html b/doc/html/range/reference/algorithms/range_numeric.html
index 9da4d83..c6c6767 100644
--- a/doc/html/range/reference/algorithms/range_numeric.html
+++ b/doc/html/range/reference/algorithms/range_numeric.html
@@ -3,7 +3,7 @@
 <meta http-equiv="Content-Type" content="text/html; charset=US-ASCII">
 <title>Numeric algorithms</title>
 <link rel="stylesheet" href="../../../../../../../doc/html/boostbook.css" type="text/css">
-<meta name="generator" content="DocBook XSL Stylesheets V1.75.2">
+<meta name="generator" content="DocBook XSL Stylesheets V1.75.1">
 <link rel="home" href="../../../index.html" title="Chapter&#160;1.&#160;Range 2.0">
 <link rel="up" href="../algorithms.html" title="Range Algorithm">
 <link rel="prev" href="range_algorithm_new_algorithms/remove_erase_if.html" title="remove_erase_if">
diff --git a/doc/html/range/reference/algorithms/range_numeric/accumulate.html b/doc/html/range/reference/algorithms/range_numeric/accumulate.html
index 9351f90..26970d8 100644
--- a/doc/html/range/reference/algorithms/range_numeric/accumulate.html
+++ b/doc/html/range/reference/algorithms/range_numeric/accumulate.html
@@ -3,7 +3,7 @@
 <meta http-equiv="Content-Type" content="text/html; charset=US-ASCII">
 <title>accumulate</title>
 <link rel="stylesheet" href="../../../../../../../../doc/html/boostbook.css" type="text/css">
-<meta name="generator" content="DocBook XSL Stylesheets V1.75.2">
+<meta name="generator" content="DocBook XSL Stylesheets V1.75.1">
 <link rel="home" href="../../../../index.html" title="Chapter&#160;1.&#160;Range 2.0">
 <link rel="up" href="../range_numeric.html" title="Numeric algorithms">
 <link rel="prev" href="../range_numeric.html" title="Numeric algorithms">
@@ -28,7 +28,7 @@
           accumulate</a>
 </h5></div></div></div>
 <a name="range.reference.algorithms.range_numeric.accumulate.prototype"></a><h6>
-<a name="id718665"></a>
+<a name="id3107722"></a>
             <a class="link" href="accumulate.html#range.reference.algorithms.range_numeric.accumulate.prototype">Prototype</a>
           </h6>
 <p>
@@ -53,7 +53,7 @@
 <p>
           </p>
 <a name="range.reference.algorithms.range_numeric.accumulate.description"></a><h6>
-<a name="id718927"></a>
+<a name="id3107987"></a>
             <a class="link" href="accumulate.html#range.reference.algorithms.range_numeric.accumulate.description">Description</a>
           </h6>
 <p>
@@ -64,18 +64,18 @@
             The return value is the resultant value of the above algorithm.
           </p>
 <a name="range.reference.algorithms.range_numeric.accumulate.definition"></a><h6>
-<a name="id719001"></a>
+<a name="id3108068"></a>
             <a class="link" href="accumulate.html#range.reference.algorithms.range_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.range_numeric.accumulate.requirements"></a><h6>
-<a name="id719064"></a>
+<a name="id3108132"></a>
             <a class="link" href="accumulate.html#range.reference.algorithms.range_numeric.accumulate.requirements">Requirements</a>
           </h6>
 <a name="range.reference.algorithms.range_numeric.accumulate.for_the_first_version"></a><h6>
-<a name="id719085"></a>
+<a name="id3108156"></a>
             <a class="link" href="accumulate.html#range.reference.algorithms.range_numeric.accumulate.for_the_first_version">For
             the first version</a>
           </h6>
@@ -100,7 +100,7 @@
             </li>
 </ol></div>
 <a name="range.reference.algorithms.range_numeric.accumulate.for_the_second_version"></a><h6>
-<a name="id719214"></a>
+<a name="id3108294"></a>
             <a class="link" href="accumulate.html#range.reference.algorithms.range_numeric.accumulate.for_the_second_version">For
             the second version</a>
           </h6>
@@ -134,7 +134,7 @@
             </li>
 </ol></div>
 <a name="range.reference.algorithms.range_numeric.accumulate.complexity"></a><h6>
-<a name="id719387"></a>
+<a name="id3108477"></a>
             <a class="link" href="accumulate.html#range.reference.algorithms.range_numeric.accumulate.complexity">Complexity</a>
           </h6>
 <p>
diff --git a/doc/html/range/reference/algorithms/range_numeric/adjacent_difference.html b/doc/html/range/reference/algorithms/range_numeric/adjacent_difference.html
index 6680e82..9358698 100644
--- a/doc/html/range/reference/algorithms/range_numeric/adjacent_difference.html
+++ b/doc/html/range/reference/algorithms/range_numeric/adjacent_difference.html
@@ -3,7 +3,7 @@
 <meta http-equiv="Content-Type" content="text/html; charset=US-ASCII">
 <title>adjacent_difference</title>
 <link rel="stylesheet" href="../../../../../../../../doc/html/boostbook.css" type="text/css">
-<meta name="generator" content="DocBook XSL Stylesheets V1.75.2">
+<meta name="generator" content="DocBook XSL Stylesheets V1.75.1">
 <link rel="home" href="../../../../index.html" title="Chapter&#160;1.&#160;Range 2.0">
 <link rel="up" href="../range_numeric.html" title="Numeric algorithms">
 <link rel="prev" href="accumulate.html" title="accumulate">
@@ -28,7 +28,7 @@
           adjacent_difference</a>
 </h5></div></div></div>
 <a name="range.reference.algorithms.range_numeric.adjacent_difference.prototype"></a><h6>
-<a name="id719451"></a>
+<a name="id3108549"></a>
             <a class="link" href="adjacent_difference.html#range.reference.algorithms.range_numeric.adjacent_difference.prototype">Prototype</a>
           </h6>
 <p>
@@ -55,7 +55,7 @@
 <p>
           </p>
 <a name="range.reference.algorithms.range_numeric.adjacent_difference.description"></a><h6>
-<a name="id719714"></a>
+<a name="id3108817"></a>
             <a class="link" href="adjacent_difference.html#range.reference.algorithms.range_numeric.adjacent_difference.description">Description</a>
           </h6>
 <p>
@@ -69,18 +69,18 @@
             instead of <code class="computeroutput"><span class="keyword">operator</span><span class="special">-()</span></code>.
           </p>
 <a name="range.reference.algorithms.range_numeric.adjacent_difference.definition"></a><h6>
-<a name="id719816"></a>
+<a name="id3108923"></a>
             <a class="link" href="adjacent_difference.html#range.reference.algorithms.range_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.range_numeric.adjacent_difference.requirements"></a><h6>
-<a name="id719877"></a>
+<a name="id3108988"></a>
             <a class="link" href="adjacent_difference.html#range.reference.algorithms.range_numeric.adjacent_difference.requirements">Requirements</a>
           </h6>
 <a name="range.reference.algorithms.range_numeric.adjacent_difference.for_the_first_version"></a><h6>
-<a name="id719899"></a>
+<a name="id3109012"></a>
             <a class="link" href="adjacent_difference.html#range.reference.algorithms.range_numeric.adjacent_difference.for_the_first_version">For
             the first version</a>
           </h6>
@@ -111,7 +111,7 @@
             </li>
 </ol></div>
 <a name="range.reference.algorithms.range_numeric.adjacent_difference.for_the_second_version"></a><h6>
-<a name="id720090"></a>
+<a name="id3109215"></a>
             <a class="link" href="adjacent_difference.html#range.reference.algorithms.range_numeric.adjacent_difference.for_the_second_version">For
             the second version</a>
           </h6>
@@ -146,7 +146,7 @@
             </li>
 </ol></div>
 <a name="range.reference.algorithms.range_numeric.adjacent_difference.precondition_"></a><h6>
-<a name="id720265"></a>
+<a name="id3109402"></a>
             <a class="link" href="adjacent_difference.html#range.reference.algorithms.range_numeric.adjacent_difference.precondition_">Precondition:</a>
           </h6>
 <p>
@@ -154,7 +154,7 @@
             <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.range_numeric.adjacent_difference.complexity"></a><h6>
-<a name="id720338"></a>
+<a name="id3109479"></a>
             <a class="link" href="adjacent_difference.html#range.reference.algorithms.range_numeric.adjacent_difference.complexity">Complexity</a>
           </h6>
 <p>
diff --git a/doc/html/range/reference/algorithms/range_numeric/inner_product.html b/doc/html/range/reference/algorithms/range_numeric/inner_product.html
index d2591e2..a040134 100644
--- a/doc/html/range/reference/algorithms/range_numeric/inner_product.html
+++ b/doc/html/range/reference/algorithms/range_numeric/inner_product.html
@@ -3,7 +3,7 @@
 <meta http-equiv="Content-Type" content="text/html; charset=US-ASCII">
 <title>inner_product</title>
 <link rel="stylesheet" href="../../../../../../../../doc/html/boostbook.css" type="text/css">
-<meta name="generator" content="DocBook XSL Stylesheets V1.75.2">
+<meta name="generator" content="DocBook XSL Stylesheets V1.75.1">
 <link rel="home" href="../../../../index.html" title="Chapter&#160;1.&#160;Range 2.0">
 <link rel="up" href="../range_numeric.html" title="Numeric algorithms">
 <link rel="prev" href="adjacent_difference.html" title="adjacent_difference">
@@ -28,7 +28,7 @@
           inner_product</a>
 </h5></div></div></div>
 <a name="range.reference.algorithms.range_numeric.inner_product.prototype"></a><h6>
-<a name="id720437"></a>
+<a name="id3109586"></a>
             <a class="link" href="inner_product.html#range.reference.algorithms.range_numeric.inner_product.prototype">Prototype</a>
           </h6>
 <p>
@@ -54,7 +54,7 @@
 <p>
           </p>
 <a name="range.reference.algorithms.range_numeric.inner_product.description"></a><h6>
-<a name="id720800"></a>
+<a name="id3109952"></a>
             <a class="link" href="inner_product.html#range.reference.algorithms.range_numeric.inner_product.description">Description</a>
           </h6>
 <p>
@@ -67,18 +67,18 @@
             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.range_numeric.inner_product.definition"></a><h6>
-<a name="id720877"></a>
+<a name="id3110035"></a>
             <a class="link" href="inner_product.html#range.reference.algorithms.range_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.range_numeric.inner_product.requirements"></a><h6>
-<a name="id720939"></a>
+<a name="id3110099"></a>
             <a class="link" href="inner_product.html#range.reference.algorithms.range_numeric.inner_product.requirements">Requirements</a>
           </h6>
 <a name="range.reference.algorithms.range_numeric.inner_product.for_the_first_version"></a><h6>
-<a name="id720959"></a>
+<a name="id3110124"></a>
             <a class="link" href="inner_product.html#range.reference.algorithms.range_numeric.inner_product.for_the_first_version">For
             the first version</a>
           </h6>
@@ -113,7 +113,7 @@
             </li>
 </ol></div>
 <a name="range.reference.algorithms.range_numeric.inner_product.for_the_second_version"></a><h6>
-<a name="id721200"></a>
+<a name="id3110378"></a>
             <a class="link" href="inner_product.html#range.reference.algorithms.range_numeric.inner_product.for_the_second_version">For
             the second version</a>
           </h6>
@@ -162,14 +162,14 @@
             </li>
 </ol></div>
 <a name="range.reference.algorithms.range_numeric.inner_product.precondition_"></a><h6>
-<a name="id721469"></a>
+<a name="id3110664"></a>
             <a class="link" href="inner_product.html#range.reference.algorithms.range_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.range_numeric.inner_product.complexity"></a><h6>
-<a name="id721542"></a>
+<a name="id3110741"></a>
             <a class="link" href="inner_product.html#range.reference.algorithms.range_numeric.inner_product.complexity">Complexity</a>
           </h6>
 <p>
diff --git a/doc/html/range/reference/algorithms/range_numeric/partial_sum.html b/doc/html/range/reference/algorithms/range_numeric/partial_sum.html
index b1aa0bf..e1ce532 100644
--- a/doc/html/range/reference/algorithms/range_numeric/partial_sum.html
+++ b/doc/html/range/reference/algorithms/range_numeric/partial_sum.html
@@ -3,7 +3,7 @@
 <meta http-equiv="Content-Type" content="text/html; charset=US-ASCII">
 <title>partial_sum</title>
 <link rel="stylesheet" href="../../../../../../../../doc/html/boostbook.css" type="text/css">
-<meta name="generator" content="DocBook XSL Stylesheets V1.75.2">
+<meta name="generator" content="DocBook XSL Stylesheets V1.75.1">
 <link rel="home" href="../../../../index.html" title="Chapter&#160;1.&#160;Range 2.0">
 <link rel="up" href="../range_numeric.html" title="Numeric algorithms">
 <link rel="prev" href="inner_product.html" title="inner_product">
@@ -28,7 +28,7 @@
           partial_sum</a>
 </h5></div></div></div>
 <a name="range.reference.algorithms.range_numeric.partial_sum.prototype"></a><h6>
-<a name="id721607"></a>
+<a name="id3110811"></a>
             <a class="link" href="partial_sum.html#range.reference.algorithms.range_numeric.partial_sum.prototype">Prototype</a>
           </h6>
 <p>
@@ -49,7 +49,7 @@
 <p>
           </p>
 <a name="range.reference.algorithms.range_numeric.partial_sum.description"></a><h6>
-<a name="id721863"></a>
+<a name="id3111072"></a>
             <a class="link" href="partial_sum.html#range.reference.algorithms.range_numeric.partial_sum.description">Description</a>
           </h6>
 <p>
@@ -58,18 +58,18 @@
             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.range_numeric.partial_sum.definition"></a><h6>
-<a name="id722002"></a>
+<a name="id3111216"></a>
             <a class="link" href="partial_sum.html#range.reference.algorithms.range_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.range_numeric.partial_sum.requirements"></a><h6>
-<a name="id722064"></a>
+<a name="id3111280"></a>
             <a class="link" href="partial_sum.html#range.reference.algorithms.range_numeric.partial_sum.requirements">Requirements</a>
           </h6>
 <a name="range.reference.algorithms.range_numeric.partial_sum.for_the_first_version"></a><h6>
-<a name="id722085"></a>
+<a name="id3111303"></a>
             <a class="link" href="partial_sum.html#range.reference.algorithms.range_numeric.partial_sum.for_the_first_version">For
             the first version</a>
           </h6>
@@ -99,7 +99,7 @@
             </li>
 </ol></div>
 <a name="range.reference.algorithms.range_numeric.partial_sum.for_the_second_version"></a><h6>
-<a name="id722276"></a>
+<a name="id3111505"></a>
             <a class="link" href="partial_sum.html#range.reference.algorithms.range_numeric.partial_sum.for_the_second_version">For
             the second version</a>
           </h6>
@@ -128,7 +128,7 @@
             </li>
 </ol></div>
 <a name="range.reference.algorithms.range_numeric.partial_sum.precondition_"></a><h6>
-<a name="id722425"></a>
+<a name="id3111664"></a>
             <a class="link" href="partial_sum.html#range.reference.algorithms.range_numeric.partial_sum.precondition_">Precondition:</a>
           </h6>
 <p>
@@ -136,7 +136,7 @@
             <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.range_numeric.partial_sum.complexity"></a><h6>
-<a name="id722499"></a>
+<a name="id3111741"></a>
             <a class="link" href="partial_sum.html#range.reference.algorithms.range_numeric.partial_sum.complexity">Complexity</a>
           </h6>
 <p>
diff --git a/doc/html/range/reference/algorithms/set_algorithms.html b/doc/html/range/reference/algorithms/set_algorithms.html
index 447b470..b9888f5 100644
--- a/doc/html/range/reference/algorithms/set_algorithms.html
+++ b/doc/html/range/reference/algorithms/set_algorithms.html
@@ -3,7 +3,7 @@
 <meta http-equiv="Content-Type" content="text/html; charset=US-ASCII">
 <title>Set algorithms</title>
 <link rel="stylesheet" href="../../../../../../../doc/html/boostbook.css" type="text/css">
-<meta name="generator" content="DocBook XSL Stylesheets V1.75.2">
+<meta name="generator" content="DocBook XSL Stylesheets V1.75.1">
 <link rel="home" href="../../../index.html" title="Chapter&#160;1.&#160;Range 2.0">
 <link rel="up" href="../algorithms.html" title="Range Algorithm">
 <link rel="prev" href="range_algorithm_non_mutating_algorithms/upper_bound.html" title="upper_bound">
diff --git a/doc/html/range/reference/algorithms/set_algorithms/includes.html b/doc/html/range/reference/algorithms/set_algorithms/includes.html
index b8fabe5..0c538d9 100644
--- a/doc/html/range/reference/algorithms/set_algorithms/includes.html
+++ b/doc/html/range/reference/algorithms/set_algorithms/includes.html
@@ -3,7 +3,7 @@
 <meta http-equiv="Content-Type" content="text/html; charset=US-ASCII">
 <title>includes</title>
 <link rel="stylesheet" href="../../../../../../../../doc/html/boostbook.css" type="text/css">
-<meta name="generator" content="DocBook XSL Stylesheets V1.75.2">
+<meta name="generator" content="DocBook XSL Stylesheets V1.75.1">
 <link rel="home" href="../../../../index.html" title="Chapter&#160;1.&#160;Range 2.0">
 <link rel="up" href="../set_algorithms.html" title="Set algorithms">
 <link rel="prev" href="../set_algorithms.html" title="Set algorithms">
@@ -28,7 +28,7 @@
           includes</a>
 </h5></div></div></div>
 <a name="range.reference.algorithms.set_algorithms.includes.prototype"></a><h6>
-<a name="id704045"></a>
+<a name="id3091173"></a>
             <a class="link" href="includes.html#range.reference.algorithms.set_algorithms.includes.prototype">Prototype</a>
           </h6>
 <p>
@@ -48,7 +48,7 @@
 <p>
           </p>
 <a name="range.reference.algorithms.set_algorithms.includes.description"></a><h6>
-<a name="id704326"></a>
+<a name="id3091457"></a>
             <a class="link" href="includes.html#range.reference.algorithms.set_algorithms.includes.description">Description</a>
           </h6>
 <p>
@@ -60,14 +60,14 @@
             the predicate versions.
           </p>
 <a name="range.reference.algorithms.set_algorithms.includes.definition"></a><h6>
-<a name="id704419"></a>
+<a name="id3091556"></a>
             <a class="link" href="includes.html#range.reference.algorithms.set_algorithms.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_algorithms.includes.requirements"></a><h6>
-<a name="id704490"></a>
+<a name="id3091629"></a>
             <a class="link" href="includes.html#range.reference.algorithms.set_algorithms.includes.requirements">Requirements</a>
           </h6>
 <p>
@@ -145,7 +145,7 @@
             </li>
 </ul></div>
 <a name="range.reference.algorithms.set_algorithms.includes.precondition_"></a><h6>
-<a name="id704857"></a>
+<a name="id3092021"></a>
             <a class="link" href="includes.html#range.reference.algorithms.set_algorithms.includes.precondition_">Precondition:</a>
           </h6>
 <p>
@@ -163,7 +163,7 @@
             according to <code class="computeroutput"><span class="identifier">pred</span></code>.
           </p>
 <a name="range.reference.algorithms.set_algorithms.includes.complexity"></a><h6>
-<a name="id704971"></a>
+<a name="id3092140"></a>
             <a class="link" href="includes.html#range.reference.algorithms.set_algorithms.includes.complexity">Complexity</a>
           </h6>
 <p>
diff --git a/doc/html/range/reference/algorithms/set_algorithms/set_difference.html b/doc/html/range/reference/algorithms/set_algorithms/set_difference.html
index 95531ed..e02ebe2 100644
--- a/doc/html/range/reference/algorithms/set_algorithms/set_difference.html
+++ b/doc/html/range/reference/algorithms/set_algorithms/set_difference.html
@@ -3,7 +3,7 @@
 <meta http-equiv="Content-Type" content="text/html; charset=US-ASCII">
 <title>set_difference</title>
 <link rel="stylesheet" href="../../../../../../../../doc/html/boostbook.css" type="text/css">
-<meta name="generator" content="DocBook XSL Stylesheets V1.75.2">
+<meta name="generator" content="DocBook XSL Stylesheets V1.75.1">
 <link rel="home" href="../../../../index.html" title="Chapter&#160;1.&#160;Range 2.0">
 <link rel="up" href="../set_algorithms.html" title="Set algorithms">
 <link rel="prev" href="set_intersection.html" title="set_intersection">
@@ -28,7 +28,7 @@
           set_difference</a>
 </h5></div></div></div>
 <a name="range.reference.algorithms.set_algorithms.set_difference.prototype"></a><h6>
-<a name="id707406"></a>
+<a name="id3094687"></a>
             <a class="link" href="set_difference.html#range.reference.algorithms.set_algorithms.set_difference.prototype">Prototype</a>
           </h6>
 <p>
@@ -57,7 +57,7 @@
 <p>
           </p>
 <a name="range.reference.algorithms.set_algorithms.set_difference.description"></a><h6>
-<a name="id707752"></a>
+<a name="id3095038"></a>
             <a class="link" href="set_difference.html#range.reference.algorithms.set_algorithms.set_difference.description">Description</a>
           </h6>
 <p>
@@ -71,14 +71,14 @@
             the predicate versions.
           </p>
 <a name="range.reference.algorithms.set_algorithms.set_difference.definition"></a><h6>
-<a name="id707838"></a>
+<a name="id3095131"></a>
             <a class="link" href="set_difference.html#range.reference.algorithms.set_algorithms.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_algorithms.set_difference.requirements"></a><h6>
-<a name="id707909"></a>
+<a name="id3095205"></a>
             <a class="link" href="set_difference.html#range.reference.algorithms.set_algorithms.set_difference.requirements">Requirements</a>
           </h6>
 <p>
@@ -164,7 +164,7 @@
             </li>
 </ul></div>
 <a name="range.reference.algorithms.set_algorithms.set_difference.precondition_"></a><h6>
-<a name="id708326"></a>
+<a name="id3095649"></a>
             <a class="link" href="set_difference.html#range.reference.algorithms.set_algorithms.set_difference.precondition_">Precondition:</a>
           </h6>
 <p>
@@ -182,7 +182,7 @@
             according to <code class="computeroutput"><span class="identifier">pred</span></code>.
           </p>
 <a name="range.reference.algorithms.set_algorithms.set_difference.complexity"></a><h6>
-<a name="id708440"></a>
+<a name="id3095768"></a>
             <a class="link" href="set_difference.html#range.reference.algorithms.set_algorithms.set_difference.complexity">Complexity</a>
           </h6>
 <p>
diff --git a/doc/html/range/reference/algorithms/set_algorithms/set_intersection.html b/doc/html/range/reference/algorithms/set_algorithms/set_intersection.html
index 7367d86..ce4af10 100644
--- a/doc/html/range/reference/algorithms/set_algorithms/set_intersection.html
+++ b/doc/html/range/reference/algorithms/set_algorithms/set_intersection.html
@@ -3,7 +3,7 @@
 <meta http-equiv="Content-Type" content="text/html; charset=US-ASCII">
 <title>set_intersection</title>
 <link rel="stylesheet" href="../../../../../../../../doc/html/boostbook.css" type="text/css">
-<meta name="generator" content="DocBook XSL Stylesheets V1.75.2">
+<meta name="generator" content="DocBook XSL Stylesheets V1.75.1">
 <link rel="home" href="../../../../index.html" title="Chapter&#160;1.&#160;Range 2.0">
 <link rel="up" href="../set_algorithms.html" title="Set algorithms">
 <link rel="prev" href="set_union.html" title="set_union">
@@ -28,7 +28,7 @@
           set_intersection</a>
 </h5></div></div></div>
 <a name="range.reference.algorithms.set_algorithms.set_intersection.prototype"></a><h6>
-<a name="id706248"></a>
+<a name="id3093475"></a>
             <a class="link" href="set_intersection.html#range.reference.algorithms.set_algorithms.set_intersection.prototype">Prototype</a>
           </h6>
 <p>
@@ -57,7 +57,7 @@
 <p>
           </p>
 <a name="range.reference.algorithms.set_algorithms.set_intersection.description"></a><h6>
-<a name="id706594"></a>
+<a name="id3093827"></a>
             <a class="link" href="set_intersection.html#range.reference.algorithms.set_algorithms.set_intersection.description">Description</a>
           </h6>
 <p>
@@ -71,14 +71,14 @@
             the predicate versions.
           </p>
 <a name="range.reference.algorithms.set_algorithms.set_intersection.definition"></a><h6>
-<a name="id706681"></a>
+<a name="id3093920"></a>
             <a class="link" href="set_intersection.html#range.reference.algorithms.set_algorithms.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_algorithms.set_intersection.requirements"></a><h6>
-<a name="id706751"></a>
+<a name="id3093992"></a>
             <a class="link" href="set_intersection.html#range.reference.algorithms.set_algorithms.set_intersection.requirements">Requirements</a>
           </h6>
 <p>
@@ -164,7 +164,7 @@
             </li>
 </ul></div>
 <a name="range.reference.algorithms.set_algorithms.set_intersection.precondition_"></a><h6>
-<a name="id707167"></a>
+<a name="id3094437"></a>
             <a class="link" href="set_intersection.html#range.reference.algorithms.set_algorithms.set_intersection.precondition_">Precondition:</a>
           </h6>
 <p>
@@ -182,7 +182,7 @@
             according to <code class="computeroutput"><span class="identifier">pred</span></code>.
           </p>
 <a name="range.reference.algorithms.set_algorithms.set_intersection.complexity"></a><h6>
-<a name="id707282"></a>
+<a name="id3094556"></a>
             <a class="link" href="set_intersection.html#range.reference.algorithms.set_algorithms.set_intersection.complexity">Complexity</a>
           </h6>
 <p>
diff --git a/doc/html/range/reference/algorithms/set_algorithms/set_symmetric_difference.html b/doc/html/range/reference/algorithms/set_algorithms/set_symmetric_difference.html
index 52b58b7..c33f771 100644
--- a/doc/html/range/reference/algorithms/set_algorithms/set_symmetric_difference.html
+++ b/doc/html/range/reference/algorithms/set_algorithms/set_symmetric_difference.html
@@ -3,7 +3,7 @@
 <meta http-equiv="Content-Type" content="text/html; charset=US-ASCII">
 <title>set_symmetric_difference</title>
 <link rel="stylesheet" href="../../../../../../../../doc/html/boostbook.css" type="text/css">
-<meta name="generator" content="DocBook XSL Stylesheets V1.75.2">
+<meta name="generator" content="DocBook XSL Stylesheets V1.75.1">
 <link rel="home" href="../../../../index.html" title="Chapter&#160;1.&#160;Range 2.0">
 <link rel="up" href="../set_algorithms.html" title="Set algorithms">
 <link rel="prev" href="set_difference.html" title="set_difference">
@@ -28,7 +28,7 @@
           set_symmetric_difference</a>
 </h5></div></div></div>
 <a name="range.reference.algorithms.set_algorithms.set_symmetric_difference.prototype"></a><h6>
-<a name="id708563"></a>
+<a name="id3095898"></a>
             <a class="link" href="set_symmetric_difference.html#range.reference.algorithms.set_algorithms.set_symmetric_difference.prototype">Prototype</a>
           </h6>
 <p>
@@ -59,7 +59,7 @@
 <p>
           </p>
 <a name="range.reference.algorithms.set_algorithms.set_symmetric_difference.description"></a><h6>
-<a name="id708909"></a>
+<a name="id3096249"></a>
             <a class="link" href="set_symmetric_difference.html#range.reference.algorithms.set_algorithms.set_symmetric_difference.description">Description</a>
           </h6>
 <p>
@@ -75,14 +75,14 @@
             the predicate versions.
           </p>
 <a name="range.reference.algorithms.set_algorithms.set_symmetric_difference.definition"></a><h6>
-<a name="id708997"></a>
+<a name="id3096344"></a>
             <a class="link" href="set_symmetric_difference.html#range.reference.algorithms.set_algorithms.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_algorithms.set_symmetric_difference.requirements"></a><h6>
-<a name="id709068"></a>
+<a name="id3096418"></a>
             <a class="link" href="set_symmetric_difference.html#range.reference.algorithms.set_algorithms.set_symmetric_difference.requirements">Requirements</a>
           </h6>
 <p>
@@ -168,7 +168,7 @@
             </li>
 </ul></div>
 <a name="range.reference.algorithms.set_algorithms.set_symmetric_difference.precondition_"></a><h6>
-<a name="id709485"></a>
+<a name="id3096863"></a>
             <a class="link" href="set_symmetric_difference.html#range.reference.algorithms.set_algorithms.set_symmetric_difference.precondition_">Precondition:</a>
           </h6>
 <p>
@@ -186,7 +186,7 @@
             according to <code class="computeroutput"><span class="identifier">pred</span></code>.
           </p>
 <a name="range.reference.algorithms.set_algorithms.set_symmetric_difference.complexity"></a><h6>
-<a name="id709600"></a>
+<a name="id3096983"></a>
             <a class="link" href="set_symmetric_difference.html#range.reference.algorithms.set_algorithms.set_symmetric_difference.complexity">Complexity</a>
           </h6>
 <p>
diff --git a/doc/html/range/reference/algorithms/set_algorithms/set_union.html b/doc/html/range/reference/algorithms/set_algorithms/set_union.html
index 3a8abe3..93ec40f 100644
--- a/doc/html/range/reference/algorithms/set_algorithms/set_union.html
+++ b/doc/html/range/reference/algorithms/set_algorithms/set_union.html
@@ -3,7 +3,7 @@
 <meta http-equiv="Content-Type" content="text/html; charset=US-ASCII">
 <title>set_union</title>
 <link rel="stylesheet" href="../../../../../../../../doc/html/boostbook.css" type="text/css">
-<meta name="generator" content="DocBook XSL Stylesheets V1.75.2">
+<meta name="generator" content="DocBook XSL Stylesheets V1.75.1">
 <link rel="home" href="../../../../index.html" title="Chapter&#160;1.&#160;Range 2.0">
 <link rel="up" href="../set_algorithms.html" title="Set algorithms">
 <link rel="prev" href="includes.html" title="includes">
@@ -28,7 +28,7 @@
           set_union</a>
 </h5></div></div></div>
 <a name="range.reference.algorithms.set_algorithms.set_union.prototype"></a><h6>
-<a name="id705095"></a>
+<a name="id3092269"></a>
             <a class="link" href="set_union.html#range.reference.algorithms.set_algorithms.set_union.prototype">Prototype</a>
           </h6>
 <p>
@@ -57,7 +57,7 @@
 <p>
           </p>
 <a name="range.reference.algorithms.set_algorithms.set_union.description"></a><h6>
-<a name="id705441"></a>
+<a name="id3092620"></a>
             <a class="link" href="set_union.html#range.reference.algorithms.set_algorithms.set_union.description">Description</a>
           </h6>
 <p>
@@ -70,14 +70,14 @@
             in the predicate versions.
           </p>
 <a name="range.reference.algorithms.set_algorithms.set_union.definition"></a><h6>
-<a name="id705524"></a>
+<a name="id3092710"></a>
             <a class="link" href="set_union.html#range.reference.algorithms.set_algorithms.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_algorithms.set_union.requirements"></a><h6>
-<a name="id705594"></a>
+<a name="id3092782"></a>
             <a class="link" href="set_union.html#range.reference.algorithms.set_algorithms.set_union.requirements">Requirements</a>
           </h6>
 <p>
@@ -163,7 +163,7 @@
             </li>
 </ul></div>
 <a name="range.reference.algorithms.set_algorithms.set_union.precondition_"></a><h6>
-<a name="id706010"></a>
+<a name="id3093226"></a>
             <a class="link" href="set_union.html#range.reference.algorithms.set_algorithms.set_union.precondition_">Precondition:</a>
           </h6>
 <p>
@@ -181,7 +181,7 @@
             according to <code class="computeroutput"><span class="identifier">pred</span></code>.
           </p>
 <a name="range.reference.algorithms.set_algorithms.set_union.complexity"></a><h6>
-<a name="id706124"></a>
+<a name="id3093345"></a>
             <a class="link" href="set_union.html#range.reference.algorithms.set_algorithms.set_union.complexity">Complexity</a>
           </h6>
 <p>
diff --git a/doc/html/range/reference/extending.html b/doc/html/range/reference/extending.html
index 37f4882..fc32e83 100644
--- a/doc/html/range/reference/extending.html
+++ b/doc/html/range/reference/extending.html
@@ -3,7 +3,7 @@
 <meta http-equiv="Content-Type" content="text/html; charset=US-ASCII">
 <title>Extending the library</title>
 <link rel="stylesheet" href="../../../../../../doc/html/boostbook.css" type="text/css">
-<meta name="generator" content="DocBook XSL Stylesheets V1.75.2">
+<meta name="generator" content="DocBook XSL Stylesheets V1.75.1">
 <link rel="home" href="../../index.html" title="Chapter&#160;1.&#160;Range 2.0">
 <link rel="up" href="../reference.html" title="Reference">
 <link rel="prev" href="ranges/irange.html" title="irange">
diff --git a/doc/html/range/reference/extending/method_1.html b/doc/html/range/reference/extending/method_1.html
index d9f66a7..632687b 100644
--- a/doc/html/range/reference/extending/method_1.html
+++ b/doc/html/range/reference/extending/method_1.html
@@ -3,7 +3,7 @@
 <meta http-equiv="Content-Type" content="text/html; charset=US-ASCII">
 <title>Method 1: provide member functions and nested types</title>
 <link rel="stylesheet" href="../../../../../../../doc/html/boostbook.css" type="text/css">
-<meta name="generator" content="DocBook XSL Stylesheets V1.75.2">
+<meta name="generator" content="DocBook XSL Stylesheets V1.75.1">
 <link rel="home" href="../../../index.html" title="Chapter&#160;1.&#160;Range 2.0">
 <link rel="up" href="../extending.html" title="Extending the library">
 <link rel="prev" href="../extending.html" title="Extending the library">
diff --git a/doc/html/range/reference/extending/method_2.html b/doc/html/range/reference/extending/method_2.html
index eae4cbd..f4f3524 100644
--- a/doc/html/range/reference/extending/method_2.html
+++ b/doc/html/range/reference/extending/method_2.html
@@ -3,7 +3,7 @@
 <meta http-equiv="Content-Type" content="text/html; charset=US-ASCII">
 <title>Method 2: provide free-standing functions and specialize metafunctions</title>
 <link rel="stylesheet" href="../../../../../../../doc/html/boostbook.css" type="text/css">
-<meta name="generator" content="DocBook XSL Stylesheets V1.75.2">
+<meta name="generator" content="DocBook XSL Stylesheets V1.75.1">
 <link rel="home" href="../../../index.html" title="Chapter&#160;1.&#160;Range 2.0">
 <link rel="up" href="../extending.html" title="Extending the library">
 <link rel="prev" href="method_1.html" title="Method 1: provide member functions and nested types">
diff --git a/doc/html/range/reference/extending/method_3.html b/doc/html/range/reference/extending/method_3.html
index 3594ff8..f841237 100644
--- a/doc/html/range/reference/extending/method_3.html
+++ b/doc/html/range/reference/extending/method_3.html
@@ -3,7 +3,7 @@
 <meta http-equiv="Content-Type" content="text/html; charset=US-ASCII">
 <title>Method 3: provide range adaptor implementations</title>
 <link rel="stylesheet" href="../../../../../../../doc/html/boostbook.css" type="text/css">
-<meta name="generator" content="DocBook XSL Stylesheets V1.75.2">
+<meta name="generator" content="DocBook XSL Stylesheets V1.75.1">
 <link rel="home" href="../../../index.html" title="Chapter&#160;1.&#160;Range 2.0">
 <link rel="up" href="../extending.html" title="Extending the library">
 <link rel="prev" href="method_2.html" title="Method 2: provide free-standing functions and specialize metafunctions">
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 9370d65..e995bee 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
@@ -3,7 +3,7 @@
 <meta http-equiv="Content-Type" content="text/html; charset=US-ASCII">
 <title>Method 3.1: Implement a Range Adaptor without arguments</title>
 <link rel="stylesheet" href="../../../../../../../../doc/html/boostbook.css" type="text/css">
-<meta name="generator" content="DocBook XSL Stylesheets V1.75.2">
+<meta name="generator" content="DocBook XSL Stylesheets V1.75.1">
 <link rel="home" href="../../../../index.html" title="Chapter&#160;1.&#160;Range 2.0">
 <link rel="up" href="../method_3.html" title="Method 3: provide range adaptor implementations">
 <link rel="prev" href="../method_3.html" title="Method 3: provide range adaptor implementations">
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 f153d0e..f0bae90 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
@@ -3,7 +3,7 @@
 <meta http-equiv="Content-Type" content="text/html; charset=US-ASCII">
 <title>Method 3.2: Implement a Range Adaptor with arguments</title>
 <link rel="stylesheet" href="../../../../../../../../doc/html/boostbook.css" type="text/css">
-<meta name="generator" content="DocBook XSL Stylesheets V1.75.2">
+<meta name="generator" content="DocBook XSL Stylesheets V1.75.1">
 <link rel="home" href="../../../../index.html" title="Chapter&#160;1.&#160;Range 2.0">
 <link rel="up" href="../method_3.html" title="Method 3: provide range adaptor implementations">
 <link rel="prev" href="method_3_1.html" title="Method 3.1: Implement a Range Adaptor without arguments">
diff --git a/doc/html/range/reference/overview.html b/doc/html/range/reference/overview.html
index 8db874f..ae0bbf0 100644
--- a/doc/html/range/reference/overview.html
+++ b/doc/html/range/reference/overview.html
@@ -3,7 +3,7 @@
 <meta http-equiv="Content-Type" content="text/html; charset=US-ASCII">
 <title>Overview</title>
 <link rel="stylesheet" href="../../../../../../doc/html/boostbook.css" type="text/css">
-<meta name="generator" content="DocBook XSL Stylesheets V1.75.2">
+<meta name="generator" content="DocBook XSL Stylesheets V1.75.1">
 <link rel="home" href="../../index.html" title="Chapter&#160;1.&#160;Range 2.0">
 <link rel="up" href="../reference.html" title="Reference">
 <link rel="prev" href="../reference.html" title="Reference">
diff --git a/doc/html/range/reference/ranges.html b/doc/html/range/reference/ranges.html
index 6e4ad0a..2e16372 100644
--- a/doc/html/range/reference/ranges.html
+++ b/doc/html/range/reference/ranges.html
@@ -3,7 +3,7 @@
 <meta http-equiv="Content-Type" content="text/html; charset=US-ASCII">
 <title>Provided Ranges</title>
 <link rel="stylesheet" href="../../../../../../doc/html/boostbook.css" type="text/css">
-<meta name="generator" content="DocBook XSL Stylesheets V1.75.2">
+<meta name="generator" content="DocBook XSL Stylesheets V1.75.1">
 <link rel="home" href="../../index.html" title="Chapter&#160;1.&#160;Range 2.0">
 <link rel="up" href="../reference.html" title="Reference">
 <link rel="prev" href="algorithms/range_numeric/partial_sum.html" title="partial_sum">
diff --git a/doc/html/range/reference/ranges/counting_range.html b/doc/html/range/reference/ranges/counting_range.html
index e2ccb2c..7bc2c80 100644
--- a/doc/html/range/reference/ranges/counting_range.html
+++ b/doc/html/range/reference/ranges/counting_range.html
@@ -3,7 +3,7 @@
 <meta http-equiv="Content-Type" content="text/html; charset=US-ASCII">
 <title>counting_range</title>
 <link rel="stylesheet" href="../../../../../../../doc/html/boostbook.css" type="text/css">
-<meta name="generator" content="DocBook XSL Stylesheets V1.75.2">
+<meta name="generator" content="DocBook XSL Stylesheets V1.75.1">
 <link rel="home" href="../../../index.html" title="Chapter&#160;1.&#160;Range 2.0">
 <link rel="up" href="../ranges.html" title="Provided Ranges">
 <link rel="prev" href="../ranges.html" title="Provided Ranges">
@@ -27,7 +27,7 @@
 <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="id722615"></a>
+<a name="id3111863"></a>
           <a class="link" href="counting_range.html#range.reference.ranges.counting_range.prototype">Prototype</a>
         </h6>
 <p>
@@ -48,7 +48,7 @@
 <p>
         </p>
 <a name="range.reference.ranges.counting_range.description"></a><h6>
-<a name="id722997"></a>
+<a name="id3112247"></a>
           <a class="link" href="counting_range.html#range.reference.ranges.counting_range.description">Description</a>
         </h6>
 <p>
@@ -58,14 +58,14 @@
           (from Boost.Iterator).
         </p>
 <a name="range.reference.ranges.counting_range.definition"></a><h6>
-<a name="id723052"></a>
+<a name="id3112306"></a>
           <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="id723113"></a>
+<a name="id3112370"></a>
           <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">
diff --git a/doc/html/range/reference/ranges/irange.html b/doc/html/range/reference/ranges/irange.html
index cd481f0..fc88a82 100644
--- a/doc/html/range/reference/ranges/irange.html
+++ b/doc/html/range/reference/ranges/irange.html
@@ -3,7 +3,7 @@
 <meta http-equiv="Content-Type" content="text/html; charset=US-ASCII">
 <title>irange</title>
 <link rel="stylesheet" href="../../../../../../../doc/html/boostbook.css" type="text/css">
-<meta name="generator" content="DocBook XSL Stylesheets V1.75.2">
+<meta name="generator" content="DocBook XSL Stylesheets V1.75.1">
 <link rel="home" href="../../../index.html" title="Chapter&#160;1.&#160;Range 2.0">
 <link rel="up" href="../ranges.html" title="Provided Ranges">
 <link rel="prev" href="istream_range.html" title="istream_range">
@@ -27,7 +27,7 @@
 <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="id723540"></a>
+<a name="id3112811"></a>
           <a class="link" href="irange.html#range.reference.ranges.irange.prototype">Prototype</a>
         </h6>
 <p>
@@ -44,7 +44,7 @@
 <p>
         </p>
 <a name="range.reference.ranges.irange.description"></a><h6>
-<a name="id723832"></a>
+<a name="id3113106"></a>
           <a class="link" href="irange.html#range.reference.ranges.irange.description">Description</a>
         </h6>
 <p>
@@ -58,14 +58,14 @@
           parameters denoted a half-open range.
         </p>
 <a name="range.reference.ranges.irange.definition"></a><h6>
-<a name="id723910"></a>
+<a name="id3113188"></a>
           <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="id723972"></a>
+<a name="id3113250"></a>
           <a class="link" href="irange.html#range.reference.ranges.irange.requirements">Requirements</a>
         </h6>
 <div class="orderedlist"><ol class="orderedlist" type="1">
@@ -79,7 +79,7 @@
           </li>
 </ol></div>
 <a name="range.reference.ranges.irange.complexity"></a><h6>
-<a name="id724049"></a>
+<a name="id3113330"></a>
           <a class="link" href="irange.html#range.reference.ranges.irange.complexity">Complexity</a>
         </h6>
 <p>
diff --git a/doc/html/range/reference/ranges/istream_range.html b/doc/html/range/reference/ranges/istream_range.html
index 063204d..db454bc 100644
--- a/doc/html/range/reference/ranges/istream_range.html
+++ b/doc/html/range/reference/ranges/istream_range.html
@@ -3,7 +3,7 @@
 <meta http-equiv="Content-Type" content="text/html; charset=US-ASCII">
 <title>istream_range</title>
 <link rel="stylesheet" href="../../../../../../../doc/html/boostbook.css" type="text/css">
-<meta name="generator" content="DocBook XSL Stylesheets V1.75.2">
+<meta name="generator" content="DocBook XSL Stylesheets V1.75.1">
 <link rel="home" href="../../../index.html" title="Chapter&#160;1.&#160;Range 2.0">
 <link rel="up" href="../ranges.html" title="Provided Ranges">
 <link rel="prev" href="counting_range.html" title="counting_range">
@@ -27,7 +27,7 @@
 <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="id723182"></a>
+<a name="id3112444"></a>
           <a class="link" href="istream_range.html#range.reference.ranges.istream_range.prototype">Prototype</a>
         </h6>
 <p>
@@ -40,7 +40,7 @@
 <p>
         </p>
 <a name="range.reference.ranges.istream_range.description"></a><h6>
-<a name="id723399"></a>
+<a name="id3112664"></a>
           <a class="link" href="istream_range.html#range.reference.ranges.istream_range.description">Description</a>
         </h6>
 <p>
@@ -49,7 +49,7 @@
           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="id723464"></a>
+<a name="id3112731"></a>
           <a class="link" href="istream_range.html#range.reference.ranges.istream_range.definition">Definition</a>
         </h6>
 <p>
diff --git a/doc/html/range/reference/semantics.html b/doc/html/range/reference/semantics.html
index 4fa0645..5ab20fe 100644
--- a/doc/html/range/reference/semantics.html
+++ b/doc/html/range/reference/semantics.html
@@ -3,7 +3,7 @@
 <meta http-equiv="Content-Type" content="text/html; charset=US-ASCII">
 <title>Semantics</title>
 <link rel="stylesheet" href="../../../../../../doc/html/boostbook.css" type="text/css">
-<meta name="generator" content="DocBook XSL Stylesheets V1.75.2">
+<meta name="generator" content="DocBook XSL Stylesheets V1.75.1">
 <link rel="home" href="../../index.html" title="Chapter&#160;1.&#160;Range 2.0">
 <link rel="up" href="../reference.html" title="Reference">
 <link rel="prev" href="synopsis.html" title="Synopsis">
@@ -31,7 +31,7 @@
 <dt><span class="section"><a href="semantics/functions.html">Functions</a></span></dt>
 </dl></div>
 <a name="range.reference.semantics.notation"></a><h5>
-<a name="id637171"></a>
+<a name="id3021991"></a>
         <a class="link" href="semantics.html#range.reference.semantics.notation">notation</a>
       </h5>
 <div class="informaltable"><table class="table">
diff --git a/doc/html/range/reference/semantics/functions.html b/doc/html/range/reference/semantics/functions.html
index 16bb7fb..232b680 100644
--- a/doc/html/range/reference/semantics/functions.html
+++ b/doc/html/range/reference/semantics/functions.html
@@ -3,7 +3,7 @@
 <meta http-equiv="Content-Type" content="text/html; charset=US-ASCII">
 <title>Functions</title>
 <link rel="stylesheet" href="../../../../../../../doc/html/boostbook.css" type="text/css">
-<meta name="generator" content="DocBook XSL Stylesheets V1.75.2">
+<meta name="generator" content="DocBook XSL Stylesheets V1.75.1">
 <link rel="home" href="../../../index.html" title="Chapter&#160;1.&#160;Range 2.0">
 <link rel="up" href="../semantics.html" title="Semantics">
 <link rel="prev" href="metafunctions.html" title="Metafunctions">
diff --git a/doc/html/range/reference/semantics/metafunctions.html b/doc/html/range/reference/semantics/metafunctions.html
index cc2f4bd..6df4902 100644
--- a/doc/html/range/reference/semantics/metafunctions.html
+++ b/doc/html/range/reference/semantics/metafunctions.html
@@ -3,7 +3,7 @@
 <meta http-equiv="Content-Type" content="text/html; charset=US-ASCII">
 <title>Metafunctions</title>
 <link rel="stylesheet" href="../../../../../../../doc/html/boostbook.css" type="text/css">
-<meta name="generator" content="DocBook XSL Stylesheets V1.75.2">
+<meta name="generator" content="DocBook XSL Stylesheets V1.75.1">
 <link rel="home" href="../../../index.html" title="Chapter&#160;1.&#160;Range 2.0">
 <link rel="up" href="../semantics.html" title="Semantics">
 <link rel="prev" href="../semantics.html" title="Semantics">
diff --git a/doc/html/range/reference/synopsis.html b/doc/html/range/reference/synopsis.html
index c950490..248e8c1 100644
--- a/doc/html/range/reference/synopsis.html
+++ b/doc/html/range/reference/synopsis.html
@@ -3,7 +3,7 @@
 <meta http-equiv="Content-Type" content="text/html; charset=US-ASCII">
 <title>Synopsis</title>
 <link rel="stylesheet" href="../../../../../../doc/html/boostbook.css" type="text/css">
-<meta name="generator" content="DocBook XSL Stylesheets V1.75.2">
+<meta name="generator" content="DocBook XSL Stylesheets V1.75.1">
 <link rel="home" href="../../index.html" title="Chapter&#160;1.&#160;Range 2.0">
 <link rel="up" href="../reference.html" title="Reference">
 <link rel="prev" href="overview.html" title="Overview">
diff --git a/doc/html/range/style_guide.html b/doc/html/range/style_guide.html
index 48043c4..b3e147a 100644
--- a/doc/html/range/style_guide.html
+++ b/doc/html/range/style_guide.html
@@ -3,7 +3,7 @@
 <meta http-equiv="Content-Type" content="text/html; charset=US-ASCII">
 <title>Terminology and style guidelines</title>
 <link rel="stylesheet" href="../../../../../doc/html/boostbook.css" type="text/css">
-<meta name="generator" content="DocBook XSL Stylesheets V1.75.2">
+<meta name="generator" content="DocBook XSL Stylesheets V1.75.1">
 <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="utilities/join.html" title="Function join">
diff --git a/doc/html/range/upgrade.html b/doc/html/range/upgrade.html
index 27ddd2b..ad53c37 100644
--- a/doc/html/range/upgrade.html
+++ b/doc/html/range/upgrade.html
@@ -3,7 +3,7 @@
 <meta http-equiv="Content-Type" content="text/html; charset=US-ASCII">
 <title>Upgrade version of Boost.Range</title>
 <link rel="stylesheet" href="../../../../../doc/html/boostbook.css" type="text/css">
-<meta name="generator" content="DocBook XSL Stylesheets V1.75.2">
+<meta name="generator" content="DocBook XSL Stylesheets V1.75.1">
 <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">
diff --git a/doc/html/range/upgrade/upgrade_from_1_34.html b/doc/html/range/upgrade/upgrade_from_1_34.html
index 587555c..dfc4c52 100644
--- a/doc/html/range/upgrade/upgrade_from_1_34.html
+++ b/doc/html/range/upgrade/upgrade_from_1_34.html
@@ -3,7 +3,7 @@
 <meta http-equiv="Content-Type" content="text/html; charset=US-ASCII">
 <title>Upgrade from version 1.34</title>
 <link rel="stylesheet" href="../../../../../../doc/html/boostbook.css" type="text/css">
-<meta name="generator" content="DocBook XSL Stylesheets V1.75.2">
+<meta name="generator" content="DocBook XSL Stylesheets V1.75.1">
 <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_from_1_42.html" title="Upgrade from version 1.42">
diff --git a/doc/html/range/upgrade/upgrade_from_1_42.html b/doc/html/range/upgrade/upgrade_from_1_42.html
index 74059e4..3fbc2d2 100644
--- a/doc/html/range/upgrade/upgrade_from_1_42.html
+++ b/doc/html/range/upgrade/upgrade_from_1_42.html
@@ -3,7 +3,7 @@
 <meta http-equiv="Content-Type" content="text/html; charset=US-ASCII">
 <title>Upgrade from version 1.42</title>
 <link rel="stylesheet" href="../../../../../../doc/html/boostbook.css" type="text/css">
-<meta name="generator" content="DocBook XSL Stylesheets V1.75.2">
+<meta name="generator" content="DocBook XSL Stylesheets V1.75.1">
 <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">
diff --git a/doc/html/range/utilities.html b/doc/html/range/utilities.html
index 0ccd47c..6c16a00 100644
--- a/doc/html/range/utilities.html
+++ b/doc/html/range/utilities.html
@@ -3,7 +3,7 @@
 <meta http-equiv="Content-Type" content="text/html; charset=US-ASCII">
 <title>Utilities</title>
 <link rel="stylesheet" href="../../../../../doc/html/boostbook.css" type="text/css">
-<meta name="generator" content="DocBook XSL Stylesheets V1.75.2">
+<meta name="generator" content="DocBook XSL Stylesheets V1.75.1">
 <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="reference/extending/method_3/method_3_2.html" title="Method 3.2: Implement a Range Adaptor with arguments">
diff --git a/doc/html/range/utilities/iterator_range.html b/doc/html/range/utilities/iterator_range.html
index 7956363..0902337 100644
--- a/doc/html/range/utilities/iterator_range.html
+++ b/doc/html/range/utilities/iterator_range.html
@@ -3,7 +3,7 @@
 <meta http-equiv="Content-Type" content="text/html; charset=US-ASCII">
 <title>Class iterator_range</title>
 <link rel="stylesheet" href="../../../../../../doc/html/boostbook.css" type="text/css">
-<meta name="generator" content="DocBook XSL Stylesheets V1.75.2">
+<meta name="generator" content="DocBook XSL Stylesheets V1.75.1">
 <link rel="home" href="../../index.html" title="Chapter&#160;1.&#160;Range 2.0">
 <link rel="up" href="../utilities.html" title="Utilities">
 <link rel="prev" href="../utilities.html" title="Utilities">
@@ -47,7 +47,7 @@
         limitation is simply propogated from the underlying iterator type.
       </p>
 <a name="range.utilities.iterator_range.synopsis"></a><h5>
-<a name="id730216"></a>
+<a name="id3119597"></a>
         <a class="link" href="iterator_range.html#range.utilities.iterator_range.synopsis">Synopsis</a>
       </h5>
 <p>
@@ -187,7 +187,7 @@
         iterators from the same container.
       </p>
 <a name="range.utilities.iterator_range.details_member_functions"></a><h5>
-<a name="id733421"></a>
+<a name="id3122828"></a>
         <a class="link" href="iterator_range.html#range.utilities.iterator_range.details_member_functions">Details
         member functions</a>
       </h5>
@@ -218,7 +218,7 @@
         </p>
 </blockquote></div>
 <a name="range.utilities.iterator_range.details_functions"></a><h5>
-<a name="id733661"></a>
+<a name="id3123073"></a>
         <a class="link" href="iterator_range.html#range.utilities.iterator_range.details_functions">Details
         functions</a>
       </h5>
diff --git a/doc/html/range/utilities/join.html b/doc/html/range/utilities/join.html
index d430946..e73c51e 100644
--- a/doc/html/range/utilities/join.html
+++ b/doc/html/range/utilities/join.html
@@ -3,7 +3,7 @@
 <meta http-equiv="Content-Type" content="text/html; charset=US-ASCII">
 <title>Function join</title>
 <link rel="stylesheet" href="../../../../../../doc/html/boostbook.css" type="text/css">
-<meta name="generator" content="DocBook XSL Stylesheets V1.75.2">
+<meta name="generator" content="DocBook XSL Stylesheets V1.75.1">
 <link rel="home" href="../../index.html" title="Chapter&#160;1.&#160;Range 2.0">
 <link rel="up" href="../utilities.html" title="Utilities">
 <link rel="prev" href="sub_range.html" title="Class sub_range">
@@ -39,7 +39,7 @@
         if the end of a range has been reached internally during traversal.
       </p>
 <a name="range.utilities.join.synposis"></a><h5>
-<a name="id736071"></a>
+<a name="id3125510"></a>
         <a class="link" href="join.html#range.utilities.join.synposis">Synposis</a>
       </h5>
 <p>
@@ -65,7 +65,7 @@
 <p>
       </p>
 <a name="range.utilities.join.example"></a><h5>
-<a name="id736614"></a>
+<a name="id3126057"></a>
         <a class="link" href="join.html#range.utilities.join.example">Example</a>
       </h5>
 <p>
diff --git a/doc/html/range/utilities/sub_range.html b/doc/html/range/utilities/sub_range.html
index 517639f..e30fba7 100644
--- a/doc/html/range/utilities/sub_range.html
+++ b/doc/html/range/utilities/sub_range.html
@@ -3,7 +3,7 @@
 <meta http-equiv="Content-Type" content="text/html; charset=US-ASCII">
 <title>Class sub_range</title>
 <link rel="stylesheet" href="../../../../../../doc/html/boostbook.css" type="text/css">
-<meta name="generator" content="DocBook XSL Stylesheets V1.75.2">
+<meta name="generator" content="DocBook XSL Stylesheets V1.75.1">
 <link rel="home" href="../../index.html" title="Chapter&#160;1.&#160;Range 2.0">
 <link rel="up" href="../utilities.html" title="Utilities">
 <link rel="prev" href="iterator_range.html" title="Class iterator_range">
@@ -35,7 +35,7 @@
         is.
       </p>
 <a name="range.utilities.sub_range.synopsis"></a><h5>
-<a name="id734808"></a>
+<a name="id3124232"></a>
         <a class="link" href="sub_range.html#range.utilities.sub_range.synopsis">Synopsis</a>
       </h5>
 <p>
diff --git a/doc/reference/algorithm/fill.qbk b/doc/reference/algorithm/fill.qbk
index e8419ab..9e16492 100644
--- a/doc/reference/algorithm/fill.qbk
+++ b/doc/reference/algorithm/fill.qbk
@@ -4,10 +4,7 @@
 
 ``
 template<class ForwardRange, class Value>
-void fill( ForwardRange& rng, const Value& val );
-
-template<class ForwardRange, class Value>
-void fill( const ForwardRange& rng, const Value& val );
+ForwardRange& fill( ForwardRange& rng, const Value& val );
 ``
 
 [heading Description]
diff --git a/doc/reference/algorithm/fill_n.qbk b/doc/reference/algorithm/fill_n.qbk
new file mode 100644
index 0000000..a17695c
--- /dev/null
+++ b/doc/reference/algorithm/fill_n.qbk
@@ -0,0 +1,31 @@
+[section:fill_n Range Algorithm - fill_n]
+
+[heading Prototype]
+
+``
+template<class ForwardRange, class Size, class Value>
+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)`.
+
+[heading Definition]
+
+Defined in the header file `boost/range/algorithm/fill_n.hpp`
+
+[heading Requirements]
+
+* `ForwardRange` is a model of the __forward_range__ Concept.
+* `ForwardRange` is mutable.
+* `Value` is a model of the `AssignableConcept`.
+* `Value` is convertible to `ForwardRange`'s value type.
+
+[heading Complexity]
+
+Linear. Exactly `n` assignments are performed.
+
+[endsect]
+
+
diff --git a/doc/reference/algorithm/make_heap.qbk b/doc/reference/algorithm/make_heap.qbk
index 6f54a15..13238fc 100644
--- a/doc/reference/algorithm/make_heap.qbk
+++ b/doc/reference/algorithm/make_heap.qbk
@@ -4,16 +4,16 @@
 
 ``
 template<class RandomAccessRange>
-void make_heap(RandomAccessRange& rng);
+RandomAccessRange& make_heap(RandomAccessRange& rng);
 
 template<class RandomAccessRange>
-void make_heap(const RandomAccessRange& rng);
+const RandomAccessRange& make_heap(const RandomAccessRange& rng);
 
 template<class RandomAccessRange, class Compare>
-void make_heap(RandomAccessRange& rng, Compare pred);
+RandomAccessRange& make_heap(RandomAccessRange& rng, Compare pred);
 
 template<class RandomAccessRange, class Compare>
-void make_heap(const RandomAccessRange& rng, Compare pred);
+const RandomAccessRange& make_heap(const RandomAccessRange& rng, Compare pred);
 ``
 
 [heading Description]
@@ -21,7 +21,7 @@ void make_heap(const RandomAccessRange& rng, Compare pred);
 `make_heap` turns `rng` into a heap.
 
 The ordering relationship is determined by using `operator<` in the non-predicate versions, and by evaluating `pred` in the predicate versions.
- 
+
 [heading Definition]
 
 Defined in the header file `boost/range/algorithm/heap_algorithm.hpp`
diff --git a/doc/reference/algorithm/next_permutation.qbk b/doc/reference/algorithm/next_permutation.qbk
index 37b901a..3da1383 100644
--- a/doc/reference/algorithm/next_permutation.qbk
+++ b/doc/reference/algorithm/next_permutation.qbk
@@ -4,16 +4,16 @@
 
 ``
 template<class BidirectionalRange>
-void next_permutation(BidirectionalRange& rng);
+bool next_permutation(BidirectionalRange& rng);
 
 template<class BidirectionalRange>
-void next_permutation(const BidirectionalRange& rng);
+bool next_permutation(const BidirectionalRange& rng);
 
 template<class BidirectionalRange, class Compare>
-void next_permutation(BidirectionalRange& rng, Compare pred);
+bool next_permutation(BidirectionalRange& rng, Compare pred);
 
 template<class BidirectionalRange, class Compare>
-void next_permutation(const BidirectionalRange& rng, Compare pred);
+bool next_permutation(const BidirectionalRange& rng, Compare pred);
 ``
 
 [heading Description]
@@ -21,7 +21,7 @@ void next_permutation(const BidirectionalRange& rng, Compare pred);
 `next_permutation` transforms the range of elements `rng` into the lexicographically next greater permutation of the elements if such a permutation exists. If one does not exist then the range is transformed into the lexicographically smallest permutation and `false` is returned. `true` is returned when the next greater permutation is successfully generated.
 
 The ordering relationship is determined by using `operator<` in the non-predicate versions, and by evaluating `pred` in the predicate versions.
- 
+
 [heading Definition]
 
 Defined in the header file `boost/range/algorithm/permutation.hpp`
diff --git a/doc/reference/algorithm/nth_element.qbk b/doc/reference/algorithm/nth_element.qbk
index 69c87a8..9b888b6 100644
--- a/doc/reference/algorithm/nth_element.qbk
+++ b/doc/reference/algorithm/nth_element.qbk
@@ -4,22 +4,26 @@
 
 ``
 template<class RandomAccessRange>
-void nth_element(RandomAccessRange& rng,
-                 typename range_iterator<RandomAccessRange>::type nth);
-                 
+RandomAccessRange& nth_element(
+    RandomAccessRange& rng,
+    typename range_iterator<RandomAccessRange>::type nth);
+
 template<class RandomAccessRange>
-void nth_element(const RandomAccessRange& rng,
-                 typename range_iterator<const RandomAccessRange>::type nth);
-                 
+const RandomAccessRange& nth_element(
+    const RandomAccessRange& rng,
+    typename range_iterator<const RandomAccessRange>::type nth);
+
 template<class RandomAccessRange>
-void nth_element(RandomAccessRange& rng,
-                 typename range_iterator<RandomAccessRange>::type nth,
-                 BinaryPredicate sort_pred);
-                 
+RandomAccessRange& nth_element(
+    RandomAccessRange& rng,
+    typename range_iterator<RandomAccessRange>::type nth,
+    BinaryPredicate sort_pred);
+
 template<class RandomAccessRange>
-void nth_element(const RandomAccessRange& rng,
-                 typename range_iterator<const RandomAccessRange>::type nth,
-                 BinaryPredicate sort_pred);
+const RandomAccessRange& nth_element(
+    const RandomAccessRange& rng,
+    typename range_iterator<const RandomAccessRange>::type nth,
+    BinaryPredicate sort_pred);
 ``
 
 [heading Description]
diff --git a/doc/reference/algorithm/partial_sort.qbk b/doc/reference/algorithm/partial_sort.qbk
index 298c16f..794415a 100644
--- a/doc/reference/algorithm/partial_sort.qbk
+++ b/doc/reference/algorithm/partial_sort.qbk
@@ -4,22 +4,26 @@
 
 ``
 template<class RandomAccessRange>
-void partial_sort(RandomAccessRange& rng,
-                  typename range_iterator<RandomAccessRange>::type middle);
-                 
+RandomAccessRange& partial_sort(
+    RandomAccessRange& rng,
+    typename range_iterator<RandomAccessRange>::type middle);
+
 template<class RandomAccessRange>
-void partial_sort(const RandomAccessRange& rng,
-                  typename range_iterator<const RandomAccessRange>::type middle);
-                 
+const RandomAccessRange& partial_sort(
+    const RandomAccessRange& rng,
+    typename range_iterator<const RandomAccessRange>::type middle);
+
 template<class RandomAccessRange>
-void partial_sort(RandomAccessRange& rng,
-                  typename range_iterator<RandomAccessRange>::type middle,
-                  BinaryPredicate sort_pred);
-                 
+RandomAccessRange& partial_sort(
+    RandomAccessRange& rng,
+    typename range_iterator<RandomAccessRange>::type middle,
+    BinaryPredicate sort_pred);
+
 template<class RandomAccessRange>
-void partial_sort(const RandomAccessRange& rng,
-                  typename range_iterator<const RandomAccessRange>::type middle,
-                  BinaryPredicate sort_pred);
+const RandomAccessRange& partial_sort(
+    const RandomAccessRange& rng,
+    typename range_iterator<const RandomAccessRange>::type middle,
+    BinaryPredicate sort_pred);
 ``
 
 [heading Description]
diff --git a/doc/reference/algorithm/pop_heap.qbk b/doc/reference/algorithm/pop_heap.qbk
index 4479d46..8b3d900 100644
--- a/doc/reference/algorithm/pop_heap.qbk
+++ b/doc/reference/algorithm/pop_heap.qbk
@@ -4,16 +4,16 @@
 
 ``
 template<class RandomAccessRange>
-void pop_heap(RandomAccessRange& rng);
+RandomAccessRange& pop_heap(RandomAccessRange& rng);
 
 template<class RandomAccessRange>
-void pop_heap(const RandomAccessRange& rng);
+const RandomAccessRange& pop_heap(const RandomAccessRange& rng);
 
 template<class RandomAccessRange, class Compare>
-void pop_heap(RandomAccessRange& rng, Compare pred);
+RandomAccessRange& pop_heap(RandomAccessRange& rng, Compare pred);
 
 template<class RandomAccessRange, class Compare>
-void pop_heap(const RandomAccessRange& rng, Compare pred);
+const RandomAccessRange& pop_heap(const RandomAccessRange& rng, Compare pred);
 ``
 
 [heading Description]
@@ -21,7 +21,7 @@ void pop_heap(const RandomAccessRange& rng, Compare pred);
 `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))`.
 
 The ordering relationship is determined by using `operator<` in the non-predicate versions, and by evaluating `pred` in the predicate versions.
- 
+
 [heading Definition]
 
 Defined in the header file `boost/range/algorithm/heap_algorithm.hpp`
diff --git a/doc/reference/algorithm/prev_permutation.qbk b/doc/reference/algorithm/prev_permutation.qbk
index 11642a4..d40eb6a 100644
--- a/doc/reference/algorithm/prev_permutation.qbk
+++ b/doc/reference/algorithm/prev_permutation.qbk
@@ -4,16 +4,16 @@
 
 ``
 template<class BidirectionalRange>
-void prev_permutation(BidirectionalRange& rng);
+bool prev_permutation(BidirectionalRange& rng);
 
 template<class BidirectionalRange>
-void prev_permutation(const BidirectionalRange& rng);
+bool prev_permutation(const BidirectionalRange& rng);
 
 template<class BidirectionalRange, class Compare>
-void prev_permutation(BidirectionalRange& rng, Compare pred);
+bool prev_permutation(BidirectionalRange& rng, Compare pred);
 
 template<class BidirectionalRange, class Compare>
-void prev_permutation(const BidirectionalRange& rng, Compare pred);
+bool prev_permutation(const BidirectionalRange& rng, Compare pred);
 ``
 
 [heading Description]
@@ -21,7 +21,7 @@ void prev_permutation(const BidirectionalRange& rng, Compare pred);
 `prev_permutation` transforms the range of elements `rng` into the lexicographically next smaller permutation of the elements if such a permutation exists. If one does not exist then the range is transformed into the lexicographically largest permutation and `false` is returned. `true` is returned when the next smaller permutation is successfully generated.
 
 The ordering relationship is determined by using `operator<` in the non-predicate versions, and by evaluating `pred` in the predicate versions.
- 
+
 [heading Definition]
 
 Defined in the header file `boost/range/algorithm/permutation.hpp`
diff --git a/doc/reference/algorithm/push_heap.qbk b/doc/reference/algorithm/push_heap.qbk
index eae2466..ddc7df2 100644
--- a/doc/reference/algorithm/push_heap.qbk
+++ b/doc/reference/algorithm/push_heap.qbk
@@ -4,16 +4,16 @@
 
 ``
 template<class RandomAccessRange>
-void push_heap(RandomAccessRange& rng);
+RandomAccessRange& push_heap(RandomAccessRange& rng);
 
 template<class RandomAccessRange>
-void push_heap(const RandomAccessRange& rng);
+const RandomAccessRange& push_heap(const RandomAccessRange& rng);
 
 template<class RandomAccessRange, class Compare>
-void push_heap(RandomAccessRange& rng, Compare pred);
+RandomAccessRange& push_heap(RandomAccessRange& rng, Compare pred);
 
 template<class RandomAccessRange, class Compare>
-void push_heap(const RandomAccessRange& rng, Compare pred);
+const RandomAccessRange& push_heap(const RandomAccessRange& rng, Compare pred);
 ``
 
 [heading Description]
@@ -21,7 +21,7 @@ void push_heap(const RandomAccessRange& rng, Compare pred);
 `push_heap` adds an element to a 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))`.
 
 The ordering relationship is determined by using `operator<` in the non-predicate versions, and by evaluating `pred` in the predicate versions.
- 
+
 [heading Definition]
 
 Defined in the header file `boost/range/algorithm/heap_algorithm.hpp`
diff --git a/doc/reference/algorithm/sort_heap.qbk b/doc/reference/algorithm/sort_heap.qbk
index 9a24887..13e4133 100644
--- a/doc/reference/algorithm/sort_heap.qbk
+++ b/doc/reference/algorithm/sort_heap.qbk
@@ -4,16 +4,16 @@
 
 ``
 template<class RandomAccessRange>
-void sort_heap(RandomAccessRange& rng);
+RandomAccessRange& sort_heap(RandomAccessRange& rng);
 
 template<class RandomAccessRange>
-void sort_heap(const RandomAccessRange& rng);
+const RandomAccessRange& sort_heap(const RandomAccessRange& rng);
 
 template<class RandomAccessRange, class Compare>
-void sort_heap(RandomAccessRange& rng, Compare pred);
+RandomAccessRange& sort_heap(RandomAccessRange& rng, Compare pred);
 
 template<class RandomAccessRange, class Compare>
-void sort_heap(const RandomAccessRange& rng, Compare pred);
+const RandomAccessRange& sort_heap(const RandomAccessRange& rng, Compare pred);
 ``
 
 [heading Description]
@@ -21,7 +21,7 @@ void sort_heap(const RandomAccessRange& rng, Compare pred);
 `sort_heap` turns a heap into a sorted range.
 
 The ordering relationship is determined by using `operator<` in the non-predicate versions, and by evaluating `pred` in the predicate versions.
- 
+
 [heading Definition]
 
 Defined in the header file `boost/range/algorithm/heap_algorithm.hpp`
diff --git a/doc/reference/algorithm_ext/erase.qbk b/doc/reference/algorithm_ext/erase.qbk
index 64c48a8..5e8c746 100644
--- a/doc/reference/algorithm_ext/erase.qbk
+++ b/doc/reference/algorithm_ext/erase.qbk
@@ -3,18 +3,20 @@
 [heading Prototype]
 
 ``
-template<
-    class Container,
-    class SinglePassRange
-    >
-void erase(Container& target,
-           iterator_range<typename Container::iterator> to_erase);
+template<class Container>
+Container& erase(
+    Container& target,
+    iterator_range<typename Container::iterator> to_erase);
 ``
 
 [heading Description]
 
 `erase` the iterator range `to_erase` from the container `target`.
 
+`remove_erase` performs the frequently used combination equivalent to `target.erase(std::remove(target.begin(), target.end(), value), target.end());`
+
+`remove_erase_if` performs the frequently used combination equivalent to `target.erase(std::remove_if(target.begin(), target.end(), pred), target.end());`
+
 [heading Definition]
 
 Defined in the header file `boost/range/algorithm_ext/erase.hpp`
diff --git a/doc/reference/algorithm_ext/insert.qbk b/doc/reference/algorithm_ext/insert.qbk
index 1d9c567..4d5dc39 100644
--- a/doc/reference/algorithm_ext/insert.qbk
+++ b/doc/reference/algorithm_ext/insert.qbk
@@ -7,9 +7,9 @@ template<
     class Container,
     class SinglePassRange
     >
-void insert(Container& target,
-            typename Container::iterator before,
-            const SinglePassRange& from);
+Container& insert(Container& target,
+                  typename Container::iterator before,
+                  const SinglePassRange& from);
 ``
 
 [heading Description]
diff --git a/doc/reference/algorithm_ext/iota.qbk b/doc/reference/algorithm_ext/iota.qbk
index c098708..36cd7ab 100644
--- a/doc/reference/algorithm_ext/iota.qbk
+++ b/doc/reference/algorithm_ext/iota.qbk
@@ -3,8 +3,8 @@
 [heading Prototype]
 
 ``
-template<class SinglePassRange, class Value>
-iota(SinglePassRange& rng, Value x);
+template<class ForwardRange, class Value>
+ForwardRange& iota(ForwardRange& rng, Value x);
 ``
 
 [heading Description]
@@ -18,7 +18,7 @@ Defined in the header file `boost/range/algorithm_ext/iota.hpp`
 
 [heading Requirements]
 
-# `SinglePassRange` is a model of the __single_pass_range__ Concept.
+# `ForwardRange` is a model of the __forward_range__ Concept.
 # `Value` is a model of the `Incrementable` Concept.
 
 [heading Complexity]
diff --git a/doc/reference/algorithm_ext/push_back.qbk b/doc/reference/algorithm_ext/push_back.qbk
index f3c8952..101fd30 100644
--- a/doc/reference/algorithm_ext/push_back.qbk
+++ b/doc/reference/algorithm_ext/push_back.qbk
@@ -7,8 +7,8 @@ template<
     class Container,
     class SinglePassRange
     >
-void push_back(Container& target,
-               const SinglePassRange& from);
+Container& push_back(Container& target,
+                     const SinglePassRange& from);
 ``
 
 [heading Description]
diff --git a/doc/reference/algorithm_ext/push_front.qbk b/doc/reference/algorithm_ext/push_front.qbk
index d827105..edb540c 100644
--- a/doc/reference/algorithm_ext/push_front.qbk
+++ b/doc/reference/algorithm_ext/push_front.qbk
@@ -7,8 +7,8 @@ template<
     class Container,
     class SinglePassRange
     >
-void push_front(Container& target,
-                const SinglePassRange& from);
+Container& push_front(Container& target,
+                      const SinglePassRange& from);
 ``
 
 [heading Description]
diff --git a/doc/reference/algorithm_ext/remove_erase.qbk b/doc/reference/algorithm_ext/remove_erase.qbk
index 0164768..25fb564 100644
--- a/doc/reference/algorithm_ext/remove_erase.qbk
+++ b/doc/reference/algorithm_ext/remove_erase.qbk
@@ -3,17 +3,14 @@
 [heading Prototype]
 
 ``
-template<
-    class Container,
-    class T
-    >
-void remove_erase(Container& target,
-                  const T& val);
+template<class Container, class Value>
+Container& remove_erase(Container& target,
+                        const Value& value);
 ``
 
 [heading Description]
 
-`remove_erase` actually eliminates the elements equal to `val` from the container. This
+`remove_erase` actually eliminates the elements equal to `value` from the container. This
 is in contrast to the `remove` algorithm which merely rearranges elements.
 
 [heading Definition]
diff --git a/doc/reference/algorithm_ext/remove_erase_if.qbk b/doc/reference/algorithm_ext/remove_erase_if.qbk
index f0ae749..0b8648e 100644
--- a/doc/reference/algorithm_ext/remove_erase_if.qbk
+++ b/doc/reference/algorithm_ext/remove_erase_if.qbk
@@ -3,12 +3,9 @@
 [heading Prototype]
 
 ``
-template<
-    class Container,
-    class Pred
-    >
-void remove_erase(Container& target,
-                  Pred pred);
+template<class Container, class Pred>
+Container& remove_erase_if(Container& target,
+                           Pred pred);
 ``
 
 [heading Description]
diff --git a/doc/reference/algorithms.qbk b/doc/reference/algorithms.qbk
index 00b3edb..dca35d4 100644
--- a/doc/reference/algorithms.qbk
+++ b/doc/reference/algorithms.qbk
@@ -82,6 +82,7 @@ and there is no need to worry about generating an invalid range. Furthermore, if
 [include algorithm/copy.qbk]
 [include algorithm/copy_backward.qbk]
 [include algorithm/fill.qbk]
+[include algorithm/fill_n.qbk]
 [include algorithm/generate.qbk]
 [include algorithm/inplace_merge.qbk]
 [include algorithm/merge.qbk]
@@ -133,6 +134,7 @@ and there is no need to worry about generating an invalid range. Furthermore, if
 [include algorithm/push_heap.qbk]
 [include algorithm/pop_heap.qbk]
 [include algorithm/make_heap.qbk]
+[include algorithm/sort_heap.qbk]
 [endsect]
 
 [section:permutation_algorithms Permutation algorithms]
diff --git a/include/boost/range/adaptor/adjacent_filtered.hpp b/include/boost/range/adaptor/adjacent_filtered.hpp
index 5f66711..c01f1c1 100644
--- a/include/boost/range/adaptor/adjacent_filtered.hpp
+++ b/include/boost/range/adaptor/adjacent_filtered.hpp
@@ -28,11 +28,11 @@
 namespace boost
 {
 
-	namespace range_detail
-	{
-		template< class Iter, class Pred, bool default_pass >
-		class skip_iterator
-		  : public boost::iterator_adaptor<
+    namespace range_detail
+    {
+        template< class Iter, class Pred, bool default_pass >
+        class skip_iterator
+          : public boost::iterator_adaptor<
                     skip_iterator<Iter,Pred,default_pass>,
                     Iter,
                     BOOST_DEDUCED_TYPENAME std::iterator_traits<Iter>::value_type,
@@ -40,10 +40,10 @@ namespace boost
                     BOOST_DEDUCED_TYPENAME std::iterator_traits<Iter>::reference,
                     BOOST_DEDUCED_TYPENAME std::iterator_traits<Iter>::difference_type
                 >
-		  , private Pred
-		{
-		private:
-			typedef boost::iterator_adaptor<
+          , private Pred
+        {
+        private:
+            typedef boost::iterator_adaptor<
                         skip_iterator<Iter,Pred,default_pass>,
                         Iter,
                         BOOST_DEDUCED_TYPENAME std::iterator_traits<Iter>::value_type,
@@ -52,9 +52,9 @@ namespace boost
                         BOOST_DEDUCED_TYPENAME std::iterator_traits<Iter>::difference_type
                     > base_t;
 
-		public:
+        public:
             typedef Pred pred_t;
-			typedef Iter iter_t;
+            typedef Iter iter_t;
 
             skip_iterator() : m_last() {}
 
@@ -66,169 +66,169 @@ namespace boost
                 move_to_next_valid();
             }
 
-			template<class OtherIter>
-			skip_iterator( const skip_iterator<OtherIter, pred_t, default_pass>& other )
-			: base_t(other.base())
-			, pred_t(other)
-			, m_last(other.m_last) {}
+            template<class OtherIter>
+            skip_iterator( const skip_iterator<OtherIter, pred_t, default_pass>& other )
+            : base_t(other.base())
+            , pred_t(other)
+            , m_last(other.m_last) {}
 
             void move_to_next_valid()
-			{
-			    iter_t& it = this->base_reference();
-			    pred_t& bi_pred = *this;
-				if (it != m_last)
-				{
-					if (default_pass)
-					{
-						iter_t nxt = ::boost::next(it);
-						while (nxt != m_last && !bi_pred(*it, *nxt))
-						{
-							++it;
-							++nxt;
-						}
-					}
-					else
-					{
-						iter_t nxt = ::boost::next(it);
-						for(; nxt != m_last; ++it, ++nxt)
-						{
-							if (bi_pred(*it, *nxt))
-							{
-								break;
-							}
-						}
-						if (nxt == m_last)
-						{
-							it = m_last;
-						}
-					}
-				}
-			}
+            {
+                iter_t& it = this->base_reference();
+                pred_t& bi_pred = *this;
+                if (it != m_last)
+                {
+                    if (default_pass)
+                    {
+                        iter_t nxt = ::boost::next(it);
+                        while (nxt != m_last && !bi_pred(*it, *nxt))
+                        {
+                            ++it;
+                            ++nxt;
+                        }
+                    }
+                    else
+                    {
+                        iter_t nxt = ::boost::next(it);
+                        for(; nxt != m_last; ++it, ++nxt)
+                        {
+                            if (bi_pred(*it, *nxt))
+                            {
+                                break;
+                            }
+                        }
+                        if (nxt == m_last)
+                        {
+                            it = m_last;
+                        }
+                    }
+                }
+            }
 
-			void increment()
-			{
-			    iter_t& it = this->base_reference();
-			    BOOST_ASSERT( it != m_last );
-			    ++it;
-			    move_to_next_valid();
-			}
+            void increment()
+            {
+                iter_t& it = this->base_reference();
+                BOOST_ASSERT( it != m_last );
+                ++it;
+                move_to_next_valid();
+            }
 
             iter_t m_last;
-		};
+        };
 
-		template< class P, class R, bool default_pass >
-		struct adjacent_filter_range
-			: iterator_range< skip_iterator<
-			                    BOOST_DEDUCED_TYPENAME range_iterator<R>::type,
-			                    P,
-			                    default_pass
+        template< class P, class R, bool default_pass >
+        struct adjacent_filter_range
+            : iterator_range< skip_iterator<
+                                BOOST_DEDUCED_TYPENAME range_iterator<R>::type,
+                                P,
+                                default_pass
                             >
                         >
-		{
-		private:
-			typedef skip_iterator<
+        {
+        private:
+            typedef skip_iterator<
                         BOOST_DEDUCED_TYPENAME range_iterator<R>::type,
                         P,
                         default_pass
                      >
-				skip_iter;
+                skip_iter;
 
-			typedef iterator_range<skip_iter>
-				base_range;
+            typedef iterator_range<skip_iter>
+                base_range;
 
-			typedef BOOST_DEDUCED_TYPENAME range_iterator<R>::type raw_iterator;
+            typedef BOOST_DEDUCED_TYPENAME range_iterator<R>::type raw_iterator;
 
-		public:
-			adjacent_filter_range( const P& p, R& r )
-			: base_range( skip_iter( boost::begin(r), boost::end(r), p),
-						  skip_iter( boost::end(r), boost::end(r), p) )
-			{
-			}
-		};
+        public:
+            adjacent_filter_range( const P& p, R& r )
+            : base_range( skip_iter( boost::begin(r), boost::end(r), p),
+                          skip_iter( boost::end(r), boost::end(r), p) )
+            {
+            }
+        };
 
-		template< class T >
-		struct adjacent_holder : holder<T>
-		{
-			adjacent_holder( T r ) : holder<T>(r)
-			{ }
-		};
+        template< class T >
+        struct adjacent_holder : holder<T>
+        {
+            adjacent_holder( T r ) : holder<T>(r)
+            { }
+        };
 
-		template< class T >
-		struct adjacent_excl_holder : holder<T>
-		{
-			adjacent_excl_holder( T r ) : holder<T>(r)
-			{ }
-		};
+        template< class T >
+        struct adjacent_excl_holder : holder<T>
+        {
+            adjacent_excl_holder( T r ) : holder<T>(r)
+            { }
+        };
 
-		template< class ForwardRng, class BinPredicate >
-		inline adjacent_filter_range<BinPredicate, ForwardRng, true>
-		operator|( ForwardRng& r,
-				   const adjacent_holder<BinPredicate>& f )
-		{
-			return adjacent_filter_range<BinPredicate, ForwardRng, true>( f.val, r );
-		}
+        template< class ForwardRng, class BinPredicate >
+        inline adjacent_filter_range<BinPredicate, ForwardRng, true>
+        operator|( ForwardRng& r,
+                   const adjacent_holder<BinPredicate>& f )
+        {
+            return adjacent_filter_range<BinPredicate, ForwardRng, true>( f.val, r );
+        }
 
-		template< class ForwardRng, class BinPredicate >
-		inline adjacent_filter_range<BinPredicate, const ForwardRng, true>
-		operator|( const ForwardRng& r,
-				   const adjacent_holder<BinPredicate>& f )
-		{
-			return adjacent_filter_range<BinPredicate,
-				                         const ForwardRng, true>( f.val, r );
-		}
+        template< class ForwardRng, class BinPredicate >
+        inline adjacent_filter_range<BinPredicate, const ForwardRng, true>
+        operator|( const ForwardRng& r,
+                   const adjacent_holder<BinPredicate>& f )
+        {
+            return adjacent_filter_range<BinPredicate,
+                                         const ForwardRng, true>( f.val, r );
+        }
 
-		template< class ForwardRng, class BinPredicate >
-		inline adjacent_filter_range<BinPredicate, ForwardRng, false>
-		operator|( ForwardRng& r,
-				   const adjacent_excl_holder<BinPredicate>& f )
-		{
-			return adjacent_filter_range<BinPredicate, ForwardRng, false>( f.val, r );
-		}
+        template< class ForwardRng, class BinPredicate >
+        inline adjacent_filter_range<BinPredicate, ForwardRng, false>
+        operator|( ForwardRng& r,
+                   const adjacent_excl_holder<BinPredicate>& f )
+        {
+            return adjacent_filter_range<BinPredicate, ForwardRng, false>( f.val, r );
+        }
 
-		template< class ForwardRng, class BinPredicate >
-		inline adjacent_filter_range<BinPredicate, ForwardRng, false>
-		operator|( const ForwardRng& r,
-				   const adjacent_excl_holder<BinPredicate>& f )
-		{
-			return adjacent_filter_range<BinPredicate,
-										 const ForwardRng, false>( f.val, r );
-		}
+        template< class ForwardRng, class BinPredicate >
+        inline adjacent_filter_range<BinPredicate, ForwardRng, false>
+        operator|( const ForwardRng& r,
+                   const adjacent_excl_holder<BinPredicate>& f )
+        {
+            return adjacent_filter_range<BinPredicate,
+                                         const ForwardRng, false>( f.val, r );
+        }
 
-	} // 'range_detail'
+    } // 'range_detail'
 
-	// Bring adjacent_filter_range into the boost namespace so that users of
-	// this library may specify the return type of the '|' operator and
-	// adjacent_filter()
-	using range_detail::adjacent_filter_range;
+    // Bring adjacent_filter_range into the boost namespace so that users of
+    // this library may specify the return type of the '|' operator and
+    // adjacent_filter()
+    using range_detail::adjacent_filter_range;
 
-	namespace adaptors
-	{
-		namespace
-		{
-			const range_detail::forwarder<range_detail::adjacent_holder>
+    namespace adaptors
+    {
+        namespace
+        {
+            const range_detail::forwarder<range_detail::adjacent_holder>
                 adjacent_filtered =
                    range_detail::forwarder<range_detail::adjacent_holder>();
 
-			const range_detail::forwarder<range_detail::adjacent_excl_holder>
-				adjacent_filtered_excl =
-					range_detail::forwarder<range_detail::adjacent_excl_holder>();
-		}
+            const range_detail::forwarder<range_detail::adjacent_excl_holder>
+                adjacent_filtered_excl =
+                    range_detail::forwarder<range_detail::adjacent_excl_holder>();
+        }
 
-	    template<class ForwardRng, class BinPredicate>
-	    inline adjacent_filter_range<BinPredicate, ForwardRng, true>
-	    adjacent_filter(ForwardRng& rng, BinPredicate filter_pred)
-	    {
-	        return adjacent_filter_range<BinPredicate, ForwardRng, true>(filter_pred, rng);
-	    }
+        template<class ForwardRng, class BinPredicate>
+        inline adjacent_filter_range<BinPredicate, ForwardRng, true>
+        adjacent_filter(ForwardRng& rng, BinPredicate filter_pred)
+        {
+            return adjacent_filter_range<BinPredicate, ForwardRng, true>(filter_pred, rng);
+        }
 
-	    template<class ForwardRng, class BinPredicate>
-	    inline adjacent_filter_range<BinPredicate, const ForwardRng, true>
-	    adjacent_filter(const ForwardRng& rng, BinPredicate filter_pred)
-	    {
-	        return adjacent_filter_range<BinPredicate, const ForwardRng, true>(filter_pred, rng);
-	    }
+        template<class ForwardRng, class BinPredicate>
+        inline adjacent_filter_range<BinPredicate, const ForwardRng, true>
+        adjacent_filter(const ForwardRng& rng, BinPredicate filter_pred)
+        {
+            return adjacent_filter_range<BinPredicate, const ForwardRng, true>(filter_pred, rng);
+        }
 
-	} // 'adaptors'
+    } // 'adaptors'
 
 }
 
diff --git a/include/boost/range/adaptor/argument_fwd.hpp b/include/boost/range/adaptor/argument_fwd.hpp
index 357056b..fbfd40c 100755
--- a/include/boost/range/adaptor/argument_fwd.hpp
+++ b/include/boost/range/adaptor/argument_fwd.hpp
@@ -20,57 +20,57 @@
 
 namespace boost
 {
-	namespace range_detail
-	{  
-		template< class T >
-		struct holder
-		{
-			T val;
-			holder( T t ) : val(t)
-			{ }
-		};
+    namespace range_detail
+    {  
+        template< class T >
+        struct holder
+        {
+            T val;
+            holder( T t ) : val(t)
+            { }
+        };
 
-		template< class T >
-		struct holder2
-		{
-			T val1, val2;
-			holder2( T t, T u ) : val1(t), val2(u)
-			{ }
-		};
-		
-		template< template<class> class Holder >
-		struct forwarder
-		{
-			template< class T >
-			Holder<T> operator()( T t ) const
-			{
-				return Holder<T>(t);
-			}
-		};
+        template< class T >
+        struct holder2
+        {
+            T val1, val2;
+            holder2( T t, T u ) : val1(t), val2(u)
+            { }
+        };
+        
+        template< template<class> class Holder >
+        struct forwarder
+        {
+            template< class T >
+            Holder<T> operator()( T t ) const
+            {
+                return Holder<T>(t);
+            }
+        };
 
-		template< template<class> class Holder >
-		struct forwarder2
-		{
-			template< class T >
-			Holder<T> operator()( T t, T u ) const
-			{
-				return Holder<T>(t,u);
-			}
-		};
+        template< template<class> class Holder >
+        struct forwarder2
+        {
+            template< class T >
+            Holder<T> operator()( T t, T u ) const
+            {
+                return Holder<T>(t,u);
+            }
+        };
 
-		template< template<class,class> class Holder >
-		struct forwarder2TU
-		{
-			template< class T, class U >
-			Holder<T, U> operator()( T t, U u ) const
-			{
-				return Holder<T, U>(t, u);
-			}
-		};
+        template< template<class,class> class Holder >
+        struct forwarder2TU
+        {
+            template< class T, class U >
+            Holder<T, U> operator()( T t, U u ) const
+            {
+                return Holder<T, U>(t, u);
+            }
+        };
 
 
-	} 
-		
+    } 
+        
 }
 
 #ifdef BOOST_MSVC
diff --git a/include/boost/range/adaptor/copied.hpp b/include/boost/range/adaptor/copied.hpp
index 1862b5f..f4cf2d1 100755
--- a/include/boost/range/adaptor/copied.hpp
+++ b/include/boost/range/adaptor/copied.hpp
@@ -18,40 +18,40 @@
 
 namespace boost
 {
-	namespace adaptors
-	{
-	    struct copied
-	    {
-	        copied(std::size_t t_, std::size_t u_)
+    namespace adaptors
+    {
+        struct copied
+        {
+            copied(std::size_t t_, std::size_t u_)
                 : t(t_), u(u_) {}
 
             std::size_t t;
             std::size_t u;
-	    };
+        };
 
-		template< class CopyableRandomAccessRng >
-		inline CopyableRandomAccessRng
-		operator|( const CopyableRandomAccessRng& r, const copied& f )
-		{
-			iterator_range<
-				BOOST_DEDUCED_TYPENAME range_iterator<const
-				                               CopyableRandomAccessRng>::type >
-			temp( adaptors::slice( r, f.t, f.u ) );
-			return CopyableRandomAccessRng( temp.begin(), temp.end() );
-		}
+        template< class CopyableRandomAccessRng >
+        inline CopyableRandomAccessRng
+        operator|( const CopyableRandomAccessRng& r, const copied& f )
+        {
+            iterator_range<
+                BOOST_DEDUCED_TYPENAME range_iterator<const
+                                               CopyableRandomAccessRng>::type >
+            temp( adaptors::slice( r, f.t, f.u ) );
+            return CopyableRandomAccessRng( temp.begin(), temp.end() );
+        }
 
-		template<class CopyableRandomAccessRange>
-		inline CopyableRandomAccessRange
-		copy(const CopyableRandomAccessRange& rng, std::size_t t, std::size_t u)
-		{
-		    iterator_range<
-		        BOOST_DEDUCED_TYPENAME range_iterator<const
-		            CopyableRandomAccessRange>::type> temp(
-		                adaptors::slice(rng, t, u));
+        template<class CopyableRandomAccessRange>
+        inline CopyableRandomAccessRange
+        copy(const CopyableRandomAccessRange& rng, std::size_t t, std::size_t u)
+        {
+            iterator_range<
+                BOOST_DEDUCED_TYPENAME range_iterator<const
+                    CopyableRandomAccessRange>::type> temp(
+                        adaptors::slice(rng, t, u));
 
             return CopyableRandomAccessRange( temp.begin(), temp.end() );
-		}
-	} // 'adaptors'
+        }
+    } // 'adaptors'
 
 }
 
diff --git a/include/boost/range/adaptor/filtered.hpp b/include/boost/range/adaptor/filtered.hpp
index 1bc4799..62888e7 100755
--- a/include/boost/range/adaptor/filtered.hpp
+++ b/include/boost/range/adaptor/filtered.hpp
@@ -17,84 +17,84 @@
 
 namespace boost
 {
-	namespace range_detail
-	{
-		template< class P, class R >
-		struct filter_range :
+    namespace range_detail
+    {
+        template< class P, class R >
+        struct filter_range :
             boost::iterator_range<
                 boost::filter_iterator< P,
-				    BOOST_DEDUCED_TYPENAME range_iterator<R>::type
+                    BOOST_DEDUCED_TYPENAME range_iterator<R>::type
                 >
             >
-		{
-		private:
-			typedef boost::iterator_range<
+        {
+        private:
+            typedef boost::iterator_range<
                         boost::filter_iterator< P,
                             BOOST_DEDUCED_TYPENAME range_iterator<R>::type
                         >
                     > base;
-		public:
-			filter_range( P p, R& r )
-			: base( make_filter_iterator( p, boost::begin(r), boost::end(r) ),
-					make_filter_iterator( p, boost::end(r), boost::end(r) ) )
-			{ }
-		};
+        public:
+            filter_range( P p, R& r )
+            : base( make_filter_iterator( p, boost::begin(r), boost::end(r) ),
+                    make_filter_iterator( p, boost::end(r), boost::end(r) ) )
+            { }
+        };
 
-		template< class T >
-		struct filter_holder : holder<T>
-		{
-			filter_holder( T r ) : holder<T>(r)
-			{ }
-		};
+        template< class T >
+        struct filter_holder : holder<T>
+        {
+            filter_holder( T r ) : holder<T>(r)
+            { }
+        };
 
-		template< class InputRng, class Predicate >
-		inline filter_range<Predicate, InputRng>
-		operator|( InputRng& r,
-				   const filter_holder<Predicate>& f )
-		{
-			return filter_range<Predicate, InputRng>( f.val, r );
-		}
-
-		template< class InputRng, class Predicate >
-		inline filter_range<Predicate, const InputRng>
-		operator|( const InputRng& r,
-				   const filter_holder<Predicate>& f )
-		{
-			return filter_range<Predicate, const InputRng>( f.val, r );
-		}
-
-	} // 'range_detail'
-
-	// Unusual use of 'using' is intended to bring filter_range into the boost namespace
-	// while leaving the mechanics of the '|' operator in range_detail and maintain
-	// argument dependent lookup.
-	// filter_range logically needs to be in the boost namespace to allow user of
-	// the library to define the return type for filter()
-	using range_detail::filter_range;
-
-	namespace adaptors
-	{
-		namespace
-		{
-			const range_detail::forwarder<range_detail::filter_holder>
-				    filtered =
-				       range_detail::forwarder<range_detail::filter_holder>();
-		}
-
-		template<class InputRange, class Predicate>
-		inline filter_range<Predicate, InputRange>
-		filter(InputRange& rng, Predicate filter_pred)
-		{
-		    return range_detail::filter_range<Predicate, InputRange>( filter_pred, rng );
-	    }
-
-	    template<class InputRange, class Predicate>
-	    inline filter_range<Predicate, const InputRange>
-	    filter(const InputRange& rng, Predicate filter_pred)
-	    {
-	        return range_detail::filter_range<Predicate, const InputRange>( filter_pred, rng );
+        template< class InputRng, class Predicate >
+        inline filter_range<Predicate, InputRng>
+        operator|( InputRng& r,
+                   const filter_holder<Predicate>& f )
+        {
+            return filter_range<Predicate, InputRng>( f.val, r );
         }
-	} // 'adaptors'
+
+        template< class InputRng, class Predicate >
+        inline filter_range<Predicate, const InputRng>
+        operator|( const InputRng& r,
+                   const filter_holder<Predicate>& f )
+        {
+            return filter_range<Predicate, const InputRng>( f.val, r );
+        }
+
+    } // 'range_detail'
+
+    // Unusual use of 'using' is intended to bring filter_range into the boost namespace
+    // while leaving the mechanics of the '|' operator in range_detail and maintain
+    // argument dependent lookup.
+    // filter_range logically needs to be in the boost namespace to allow user of
+    // the library to define the return type for filter()
+    using range_detail::filter_range;
+
+    namespace adaptors
+    {
+        namespace
+        {
+            const range_detail::forwarder<range_detail::filter_holder>
+                    filtered =
+                       range_detail::forwarder<range_detail::filter_holder>();
+        }
+
+        template<class InputRange, class Predicate>
+        inline filter_range<Predicate, InputRange>
+        filter(InputRange& rng, Predicate filter_pred)
+        {
+            return range_detail::filter_range<Predicate, InputRange>( filter_pred, rng );
+        }
+
+        template<class InputRange, class Predicate>
+        inline filter_range<Predicate, const InputRange>
+        filter(const InputRange& rng, Predicate filter_pred)
+        {
+            return range_detail::filter_range<Predicate, const InputRange>( filter_pred, rng );
+        }
+    } // 'adaptors'
 
 }
 
diff --git a/include/boost/range/adaptor/indexed.hpp b/include/boost/range/adaptor/indexed.hpp
index 7050185..5a523ce 100755
--- a/include/boost/range/adaptor/indexed.hpp
+++ b/include/boost/range/adaptor/indexed.hpp
@@ -40,56 +40,56 @@ namespace boost
         };
     }
 
-	namespace range_detail
-	{
-		template< class Iter >
-		class indexed_iterator
-			: public boost::iterator_adaptor< indexed_iterator<Iter>, Iter >
-		{
-		private:
-			typedef boost::iterator_adaptor< indexed_iterator<Iter>, Iter >
-				  base;
+    namespace range_detail
+    {
+        template< class Iter >
+        class indexed_iterator
+            : public boost::iterator_adaptor< indexed_iterator<Iter>, Iter >
+        {
+        private:
+            typedef boost::iterator_adaptor< indexed_iterator<Iter>, Iter >
+                  base;
 
-			typedef BOOST_DEDUCED_TYPENAME base::difference_type index_type;
+            typedef BOOST_DEDUCED_TYPENAME base::difference_type index_type;
 
-			index_type m_index;
+            index_type m_index;
 
-		public:
-			explicit indexed_iterator( Iter i, index_type index )
-			: base(i), m_index(index)
-			{
-				BOOST_ASSERT( m_index >= 0 && "Indexed Iterator out of bounds" );
-			}
+        public:
+            explicit indexed_iterator( Iter i, index_type index )
+            : base(i), m_index(index)
+            {
+                BOOST_ASSERT( m_index >= 0 && "Indexed Iterator out of bounds" );
+            }
 
-			index_type index() const
-			{
-				return m_index;
-			}
+            index_type index() const
+            {
+                return m_index;
+            }
 
-		 private:
-			friend class boost::iterator_core_access;
+         private:
+            friend class boost::iterator_core_access;
 
-			void increment()
-			{
+            void increment()
+            {
                 ++m_index;
                 ++(this->base_reference());
-			}
+            }
 
 
-			void decrement()
+            void decrement()
             {
                 BOOST_ASSERT( m_index > 0 && "Indexed Iterator out of bounds" );
                 --m_index;
                 --(this->base_reference());
             }
 
-			void advance( index_type n )
+            void advance( index_type n )
             {
                 m_index += n;
                 BOOST_ASSERT( m_index >= 0 && "Indexed Iterator out of bounds" );
                 this->base_reference() += n;
             }
-		};
+        };
 
         template< class Rng >
         struct indexed_range :
@@ -107,45 +107,45 @@ namespace boost
             { }
         };
 
-	} // 'range_detail'
+    } // 'range_detail'
 
-	// Make this available to users of this library. It will sometimes be
-	// required since it is the return type of operator '|' and
-	// index().
-	using range_detail::indexed_range;
+    // Make this available to users of this library. It will sometimes be
+    // required since it is the return type of operator '|' and
+    // index().
+    using range_detail::indexed_range;
 
-	namespace adaptors
-	{
+    namespace adaptors
+    {
         template< class SinglePassRange >
-		inline indexed_range<SinglePassRange>
-		operator|( SinglePassRange& r,
-				   const indexed& f )
-		{
-			return indexed_range<SinglePassRange>( f.val, r );
-		}
-
-		template< class SinglePassRange >
-		inline indexed_range<const SinglePassRange>
-		operator|( const SinglePassRange& r,
-				   const indexed& f )
-		{
-			return indexed_range<const SinglePassRange>( f.val, r );
-		}
-
-		template<class SinglePassRange, class Index>
-		inline indexed_range<SinglePassRange>
-		index(SinglePassRange& rng, Index index_value)
-		{
-		    return indexed_range<SinglePassRange>(index_value, rng);
-	    }
-
-	    template<class SinglePassRange, class Index>
-	    inline indexed_range<const SinglePassRange>
-	    index(const SinglePassRange& rng, Index index_value)
-	    {
-	        return indexed_range<const SinglePassRange>(index_value, rng);
+        inline indexed_range<SinglePassRange>
+        operator|( SinglePassRange& r,
+                   const indexed& f )
+        {
+            return indexed_range<SinglePassRange>( f.val, r );
         }
-	} // 'adaptors'
+
+        template< class SinglePassRange >
+        inline indexed_range<const SinglePassRange>
+        operator|( const SinglePassRange& r,
+                   const indexed& f )
+        {
+            return indexed_range<const SinglePassRange>( f.val, r );
+        }
+
+        template<class SinglePassRange, class Index>
+        inline indexed_range<SinglePassRange>
+        index(SinglePassRange& rng, Index index_value)
+        {
+            return indexed_range<SinglePassRange>(index_value, rng);
+        }
+
+        template<class SinglePassRange, class Index>
+        inline indexed_range<const SinglePassRange>
+        index(const SinglePassRange& rng, Index index_value)
+        {
+            return indexed_range<const SinglePassRange>(index_value, rng);
+        }
+    } // 'adaptors'
 
 }
 
diff --git a/include/boost/range/adaptor/indirected.hpp b/include/boost/range/adaptor/indirected.hpp
index 5b13cfb..4abb3ec 100644
--- a/include/boost/range/adaptor/indirected.hpp
+++ b/include/boost/range/adaptor/indirected.hpp
@@ -16,72 +16,72 @@
 
 namespace boost
 {
-	namespace range_detail
-	{
-		template< class R >
-		struct indirect_range :
-			public boost::iterator_range<
+    namespace range_detail
+    {
+        template< class R >
+        struct indirect_range :
+            public boost::iterator_range<
                         boost::indirect_iterator<
                             BOOST_DEDUCED_TYPENAME range_iterator<R>::type
                         >
                     >
-		{
-		private:
-			typedef boost::iterator_range<
+        {
+        private:
+            typedef boost::iterator_range<
                         boost::indirect_iterator<
                             BOOST_DEDUCED_TYPENAME range_iterator<R>::type
                         >
                     >
-				base;
+                base;
 
-		public:
-			explicit indirect_range( R& r )
+        public:
+            explicit indirect_range( R& r )
                 : base( r )
-			{ }
-		};
+            { }
+        };
 
-		struct indirect_forwarder {};
+        struct indirect_forwarder {};
 
-		template< class InputRng >
-		inline indirect_range<InputRng>
-		operator|( InputRng& r, indirect_forwarder )
-		{
-			return indirect_range<InputRng>( r );
-		}
+        template< class InputRng >
+        inline indirect_range<InputRng>
+        operator|( InputRng& r, indirect_forwarder )
+        {
+            return indirect_range<InputRng>( r );
+        }
 
-		template< class InputRng >
-		inline indirect_range<const InputRng>
-		operator|( const InputRng& r, indirect_forwarder )
-		{
-			return indirect_range<const InputRng>( r );
-		}
+        template< class InputRng >
+        inline indirect_range<const InputRng>
+        operator|( const InputRng& r, indirect_forwarder )
+        {
+            return indirect_range<const InputRng>( r );
+        }
 
-	} // 'range_detail'
+    } // 'range_detail'
 
-	using range_detail::indirect_range;
+    using range_detail::indirect_range;
 
-	namespace adaptors
-	{
-		namespace
-		{
-			const range_detail::indirect_forwarder indirected =
-				                            range_detail::indirect_forwarder();
-		}
+    namespace adaptors
+    {
+        namespace
+        {
+            const range_detail::indirect_forwarder indirected =
+                                            range_detail::indirect_forwarder();
+        }
 
-		template<class InputRange>
-		inline indirect_range<InputRange>
-		indirect(InputRange& rng)
-		{
-		    return indirect_range<InputRange>(rng);
-		}
+        template<class InputRange>
+        inline indirect_range<InputRange>
+        indirect(InputRange& rng)
+        {
+            return indirect_range<InputRange>(rng);
+        }
 
-		template<class InputRange>
-		inline indirect_range<const InputRange>
-		indirect(const InputRange& rng)
-		{
-		    return indirect_range<const InputRange>(rng);
-	    }
-	} // 'adaptors'
+        template<class InputRange>
+        inline indirect_range<const InputRange>
+        indirect(const InputRange& rng)
+        {
+            return indirect_range<const InputRange>(rng);
+        }
+    } // 'adaptors'
 
 }
 
diff --git a/include/boost/range/adaptor/map.hpp b/include/boost/range/adaptor/map.hpp
index f790e1a..a8a2c20 100755
--- a/include/boost/range/adaptor/map.hpp
+++ b/include/boost/range/adaptor/map.hpp
@@ -17,161 +17,161 @@
 
 namespace boost
 {
-	namespace range_detail
-	{
-		struct map_keys_forwarder {};
-		struct map_values_forwarder {};
+    namespace range_detail
+    {
+        struct map_keys_forwarder {};
+        struct map_values_forwarder {};
 
-		template< class Map >
-		struct select_first
-		{
-			typedef BOOST_DEDUCED_TYPENAME Map::value_type pair_t;
-			typedef const BOOST_DEDUCED_TYPENAME pair_t::first_type& 
-				result_type;  
+        template< class Map >
+        struct select_first
+        {
+            typedef BOOST_DEDUCED_TYPENAME Map::value_type pair_t;
+            typedef const BOOST_DEDUCED_TYPENAME pair_t::first_type& 
+                result_type;  
 
-			result_type operator()( const pair_t& r ) const
-			{
-				return r.first;
-			}
-		};
+            result_type operator()( const pair_t& r ) const
+            {
+                return r.first;
+            }
+        };
 
-		template< class Map >
-		struct select_second_mutable
-		{
-			typedef BOOST_DEDUCED_TYPENAME Map::value_type pair_t;
-			typedef BOOST_DEDUCED_TYPENAME pair_t::second_type& result_type;  
+        template< class Map >
+        struct select_second_mutable
+        {
+            typedef BOOST_DEDUCED_TYPENAME Map::value_type pair_t;
+            typedef BOOST_DEDUCED_TYPENAME pair_t::second_type& result_type;  
 
-			result_type operator()( pair_t& r ) const
-			{
-				return r.second;
-			}
-		};
+            result_type operator()( pair_t& r ) const
+            {
+                return r.second;
+            }
+        };
 
-		template< class Map >
-		struct select_second_const
-		{
-			typedef BOOST_DEDUCED_TYPENAME Map::value_type pair_t;
-			typedef const BOOST_DEDUCED_TYPENAME pair_t::second_type& 
-				result_type;  
-			
-			result_type operator()( const pair_t& r ) const
-			{
-				return r.second;
-			}
-		};
-		
-		template<class StdPairRng>
-		class select_first_range
-			: public transform_range<
-						select_first<StdPairRng>,
-						const StdPairRng>
-		{
-		    typedef transform_range<select_first<StdPairRng>, const StdPairRng> base;
-		public:
-			typedef select_first<StdPairRng> transform_fn_type;
-			typedef const StdPairRng source_range_type;
+        template< class Map >
+        struct select_second_const
+        {
+            typedef BOOST_DEDUCED_TYPENAME Map::value_type pair_t;
+            typedef const BOOST_DEDUCED_TYPENAME pair_t::second_type& 
+                result_type;  
+            
+            result_type operator()( const pair_t& r ) const
+            {
+                return r.second;
+            }
+        };
+        
+        template<class StdPairRng>
+        class select_first_range
+            : public transform_range<
+                        select_first<StdPairRng>,
+                        const StdPairRng>
+        {
+            typedef transform_range<select_first<StdPairRng>, const StdPairRng> base;
+        public:
+            typedef select_first<StdPairRng> transform_fn_type;
+            typedef const StdPairRng source_range_type;
 
-		    select_first_range(transform_fn_type fn, source_range_type& rng)
-		        : base(fn, rng)
-		    {
-		    }
+            select_first_range(transform_fn_type fn, source_range_type& rng)
+                : base(fn, rng)
+            {
+            }
 
-			select_first_range(const base& other) : base(other) {}
-		};
-		
-		template<class StdPairRng>
-		class select_second_mutable_range
-			: public transform_range<
-						select_second_mutable<StdPairRng>,
-						StdPairRng>
-		{
-		    typedef transform_range<select_second_mutable<StdPairRng>, StdPairRng> base;
-		public:
-			typedef select_second_mutable<StdPairRng> transform_fn_type;
-			typedef StdPairRng source_range_type;
+            select_first_range(const base& other) : base(other) {}
+        };
+        
+        template<class StdPairRng>
+        class select_second_mutable_range
+            : public transform_range<
+                        select_second_mutable<StdPairRng>,
+                        StdPairRng>
+        {
+            typedef transform_range<select_second_mutable<StdPairRng>, StdPairRng> base;
+        public:
+            typedef select_second_mutable<StdPairRng> transform_fn_type;
+            typedef StdPairRng source_range_type;
 
-		    select_second_mutable_range(transform_fn_type fn, source_range_type& rng)
-		        : base(fn, rng)
-		    {
-		    }
+            select_second_mutable_range(transform_fn_type fn, source_range_type& rng)
+                : base(fn, rng)
+            {
+            }
 
-			select_second_mutable_range(const base& other) : base(other) {}
-		};
-		
-		template<class StdPairRng>
-		class select_second_const_range
-			: public transform_range<
-						select_second_const<StdPairRng>,
-						const StdPairRng>
-		{
-		    typedef transform_range<select_second_const<StdPairRng>, const StdPairRng> base;
-		public:
-			typedef select_second_const<StdPairRng> transform_fn_type;
-			typedef const StdPairRng source_range_type;
+            select_second_mutable_range(const base& other) : base(other) {}
+        };
+        
+        template<class StdPairRng>
+        class select_second_const_range
+            : public transform_range<
+                        select_second_const<StdPairRng>,
+                        const StdPairRng>
+        {
+            typedef transform_range<select_second_const<StdPairRng>, const StdPairRng> base;
+        public:
+            typedef select_second_const<StdPairRng> transform_fn_type;
+            typedef const StdPairRng source_range_type;
 
-		    select_second_const_range(transform_fn_type fn, source_range_type& rng)
-		        : base(fn, rng)
-		    {
-		    }
+            select_second_const_range(transform_fn_type fn, source_range_type& rng)
+                : base(fn, rng)
+            {
+            }
 
-			select_second_const_range(const base& other) : base(other) {}
-	    };
-		
-		template< class StdPairRng >
-		inline select_first_range<StdPairRng> 
-		operator|( const StdPairRng& r, map_keys_forwarder )
-		{
-			return operator|( r, 
-			  boost::adaptors::transformed( select_first<StdPairRng>() ) );
-		}
+            select_second_const_range(const base& other) : base(other) {}
+        };
+        
+        template< class StdPairRng >
+        inline select_first_range<StdPairRng> 
+        operator|( const StdPairRng& r, map_keys_forwarder )
+        {
+            return operator|( r, 
+              boost::adaptors::transformed( select_first<StdPairRng>() ) );
+        }
 
-		template< class StdPairRng >
-		inline select_second_mutable_range<StdPairRng> 
-		operator|( StdPairRng& r, map_values_forwarder )
-		{
-			return operator|( r, 
-		  boost::adaptors::transformed( select_second_mutable<StdPairRng>() ) );
-		}
+        template< class StdPairRng >
+        inline select_second_mutable_range<StdPairRng> 
+        operator|( StdPairRng& r, map_values_forwarder )
+        {
+            return operator|( r, 
+          boost::adaptors::transformed( select_second_mutable<StdPairRng>() ) );
+        }
 
-		template< class StdPairRng >
-		inline select_second_const_range<StdPairRng>
-		operator|( const StdPairRng& r, map_values_forwarder )
-		{
-			return operator|( r, 
-		   boost::adaptors::transformed( select_second_const<StdPairRng>() ) ); 
-		}
-		
-	} // 'range_detail'
-	
-	using range_detail::select_first_range;
-	using range_detail::select_second_mutable_range;
-	using range_detail::select_second_const_range;
+        template< class StdPairRng >
+        inline select_second_const_range<StdPairRng>
+        operator|( const StdPairRng& r, map_values_forwarder )
+        {
+            return operator|( r, 
+           boost::adaptors::transformed( select_second_const<StdPairRng>() ) ); 
+        }
+        
+    } // 'range_detail'
+    
+    using range_detail::select_first_range;
+    using range_detail::select_second_mutable_range;
+    using range_detail::select_second_const_range;
 
-	namespace adaptors
-	{ 
-		namespace
-		{
-			const range_detail::map_keys_forwarder map_keys = 
-				                            range_detail::map_keys_forwarder();
+    namespace adaptors
+    { 
+        namespace
+        {
+            const range_detail::map_keys_forwarder map_keys = 
+                                            range_detail::map_keys_forwarder();
 
-			const range_detail::map_values_forwarder map_values = 
-							               range_detail::map_values_forwarder();
-		}
-		
-		template<class StdPairRange>
-		inline select_first_range<StdPairRange>
-		keys(const StdPairRange& rng)
-		{
-		    return select_first_range<StdPairRange>(
-		        range_detail::select_first<StdPairRange>(), rng );
-	    }
-	    
-	    template<class StdPairRange>
-	    inline select_second_const_range<StdPairRange>
-	    values(const StdPairRange& rng)
-	    {
-	        return select_second_const_range<StdPairRange>(
-	            range_detail::select_second_const<StdPairRange>(), rng );
+            const range_detail::map_values_forwarder map_values = 
+                                           range_detail::map_values_forwarder();
+        }
+        
+        template<class StdPairRange>
+        inline select_first_range<StdPairRange>
+        keys(const StdPairRange& rng)
+        {
+            return select_first_range<StdPairRange>(
+                range_detail::select_first<StdPairRange>(), rng );
+        }
+        
+        template<class StdPairRange>
+        inline select_second_const_range<StdPairRange>
+        values(const StdPairRange& rng)
+        {
+            return select_second_const_range<StdPairRange>(
+                range_detail::select_second_const<StdPairRange>(), rng );
         }
         
         template<class StdPairRange>
@@ -181,8 +181,8 @@ namespace boost
             return select_second_mutable_range<StdPairRange>(
                 range_detail::select_second_mutable<StdPairRange>(), rng );
         }
-	} // 'adaptors'
-	
+    } // 'adaptors'
+    
 }
 
 #endif
diff --git a/include/boost/range/adaptor/replaced.hpp b/include/boost/range/adaptor/replaced.hpp
index bdc0a2d..3c40918 100644
--- a/include/boost/range/adaptor/replaced.hpp
+++ b/include/boost/range/adaptor/replaced.hpp
@@ -22,99 +22,99 @@
 
 namespace boost
 {
-	namespace range_detail
-	{
-		template< class Value >
-		class replace_value
-		{
-		public:
-			typedef const Value& result_type;
-			typedef const Value& first_argument_type;
+    namespace range_detail
+    {
+        template< class Value >
+        class replace_value
+        {
+        public:
+            typedef const Value& result_type;
+            typedef const Value& first_argument_type;
 
-			replace_value(const Value& from, const Value& to)
-				:	m_from(from), m_to(to)
-			{
-			}
+            replace_value(const Value& from, const Value& to)
+                :   m_from(from), m_to(to)
+            {
+            }
 
-			const Value& operator()(const Value& x) const
-			{
-				return (x == m_from) ? m_to : x;
-			}
+            const Value& operator()(const Value& x) const
+            {
+                return (x == m_from) ? m_to : x;
+            }
 
-		private:
-			Value m_from;
-			Value m_to;
-		};
+        private:
+            Value m_from;
+            Value m_to;
+        };
 
-		template< class R >
-		class replace_range :
-			public boost::iterator_range<
-				boost::transform_iterator<
-					replace_value< BOOST_DEDUCED_TYPENAME range_value<R>::type >,
-					BOOST_DEDUCED_TYPENAME range_iterator<R>::type > >
-		{
-		private:
-			typedef replace_value< BOOST_DEDUCED_TYPENAME range_value<R>::type > Fn;
+        template< class R >
+        class replace_range :
+            public boost::iterator_range<
+                boost::transform_iterator<
+                    replace_value< BOOST_DEDUCED_TYPENAME range_value<R>::type >,
+                    BOOST_DEDUCED_TYPENAME range_iterator<R>::type > >
+        {
+        private:
+            typedef replace_value< BOOST_DEDUCED_TYPENAME range_value<R>::type > Fn;
 
-			typedef boost::iterator_range<
-				boost::transform_iterator<
-					replace_value< BOOST_DEDUCED_TYPENAME range_value<R>::type >,
-					BOOST_DEDUCED_TYPENAME range_iterator<R>::type > > base_t;
+            typedef boost::iterator_range<
+                boost::transform_iterator<
+                    replace_value< BOOST_DEDUCED_TYPENAME range_value<R>::type >,
+                    BOOST_DEDUCED_TYPENAME range_iterator<R>::type > > base_t;
 
-		public:
-			typedef BOOST_DEDUCED_TYPENAME range_value<R>::type value_type;
+        public:
+            typedef BOOST_DEDUCED_TYPENAME range_value<R>::type value_type;
 
-			replace_range( R& r, value_type from, value_type to )
-				: base_t( make_transform_iterator( boost::begin(r), Fn(from, to) ),
-						  make_transform_iterator( boost::end(r), Fn(from, to) ) )
-			{ }
-		};
+            replace_range( R& r, value_type from, value_type to )
+                : base_t( make_transform_iterator( boost::begin(r), Fn(from, to) ),
+                          make_transform_iterator( boost::end(r), Fn(from, to) ) )
+            { }
+        };
 
-		template< class T >
-		class replace_holder : public holder2<T>
-		{
-		public:
-			replace_holder( const T& from, const T& to )
-				: holder2<T>(from, to)
-			{ }
-		private:
-			// not assignable
-			void operator=(const replace_holder&);
-		};
+        template< class T >
+        class replace_holder : public holder2<T>
+        {
+        public:
+            replace_holder( const T& from, const T& to )
+                : holder2<T>(from, to)
+            { }
+        private:
+            // not assignable
+            void operator=(const replace_holder&);
+        };
 
-		template< class InputRng >
-		inline replace_range<InputRng>
-		operator|( InputRng& r,
-				   const replace_holder<BOOST_DEDUCED_TYPENAME range_value<InputRng>::type>& f )
-		{
-			return replace_range<InputRng>(r, f.val1, f.val2);
-		}
+        template< class InputRng >
+        inline replace_range<InputRng>
+        operator|( InputRng& r,
+                   const replace_holder<BOOST_DEDUCED_TYPENAME range_value<InputRng>::type>& f )
+        {
+            return replace_range<InputRng>(r, f.val1, f.val2);
+        }
 
-		template< class InputRng >
-		inline replace_range<const InputRng>
-		operator|( const InputRng& r,
-				   const replace_holder<BOOST_DEDUCED_TYPENAME range_value<InputRng>::type>& f )
-		{
-			return replace_range<const InputRng>(r, f.val1, f.val2);
-		}
-	} // 'range_detail'
+        template< class InputRng >
+        inline replace_range<const InputRng>
+        operator|( const InputRng& r,
+                   const replace_holder<BOOST_DEDUCED_TYPENAME range_value<InputRng>::type>& f )
+        {
+            return replace_range<const InputRng>(r, f.val1, f.val2);
+        }
+    } // 'range_detail'
 
     using range_detail::replace_range;
 
-	namespace adaptors
-	{
-		namespace
-		{
-			const range_detail::forwarder2<range_detail::replace_holder>
-				replaced =
-					range_detail::forwarder2<range_detail::replace_holder>();
-		}
+    namespace adaptors
+    {
+        namespace
+        {
+            const range_detail::forwarder2<range_detail::replace_holder>
+                replaced =
+                    range_detail::forwarder2<range_detail::replace_holder>();
+        }
 
-		template<class InputRange>
-		inline replace_range<InputRange>
-		replace(InputRange& rng,
-		        BOOST_DEDUCED_TYPENAME range_value<InputRange>::type from,
-		        BOOST_DEDUCED_TYPENAME range_value<InputRange>::type to)
+        template<class InputRange>
+        inline replace_range<InputRange>
+        replace(InputRange& rng,
+                BOOST_DEDUCED_TYPENAME range_value<InputRange>::type from,
+                BOOST_DEDUCED_TYPENAME range_value<InputRange>::type to)
         {
             return replace_range<InputRange>(rng, from, to);
         }
@@ -128,7 +128,7 @@ namespace boost
             return replace_range<const InputRange>(rng, from ,to);
         }
 
-	} // 'adaptors'
+    } // 'adaptors'
 } // 'boost'
 
 #endif // include guard
diff --git a/include/boost/range/adaptor/replaced_if.hpp b/include/boost/range/adaptor/replaced_if.hpp
index 22264a2..9353abd 100644
--- a/include/boost/range/adaptor/replaced_if.hpp
+++ b/include/boost/range/adaptor/replaced_if.hpp
@@ -22,115 +22,115 @@
 
 namespace boost
 {
-	namespace range_detail
-	{
-		template< class Pred, class Value >
-		class replace_value_if
-		{
-		public:
-			typedef const Value& result_type;
-			typedef const Value& first_argument_type;
+    namespace range_detail
+    {
+        template< class Pred, class Value >
+        class replace_value_if
+        {
+        public:
+            typedef const Value& result_type;
+            typedef const Value& first_argument_type;
 
-			replace_value_if(const Pred& pred, const Value& to)
-				:	m_pred(pred), m_to(to)
-			{
-			}
+            replace_value_if(const Pred& pred, const Value& to)
+                :   m_pred(pred), m_to(to)
+            {
+            }
 
-			const Value& operator()(const Value& x) const
-			{
-				return m_pred(x) ? m_to : x;
-			}
+            const Value& operator()(const Value& x) const
+            {
+                return m_pred(x) ? m_to : x;
+            }
 
-		private:
-			Pred  m_pred;
-			Value m_to;
-		};
+        private:
+            Pred  m_pred;
+            Value m_to;
+        };
 
-		template< class Pred, class R >
-		class replace_if_range :
-			public boost::iterator_range<
-				boost::transform_iterator<
-					replace_value_if< Pred, BOOST_DEDUCED_TYPENAME range_value<R>::type >,
-					BOOST_DEDUCED_TYPENAME range_iterator<R>::type > >
-		{
-		private:
-			typedef replace_value_if< Pred, BOOST_DEDUCED_TYPENAME range_value<R>::type > Fn;
+        template< class Pred, class R >
+        class replace_if_range :
+            public boost::iterator_range<
+                boost::transform_iterator<
+                    replace_value_if< Pred, BOOST_DEDUCED_TYPENAME range_value<R>::type >,
+                    BOOST_DEDUCED_TYPENAME range_iterator<R>::type > >
+        {
+        private:
+            typedef replace_value_if< Pred, BOOST_DEDUCED_TYPENAME range_value<R>::type > Fn;
 
-			typedef boost::iterator_range<
-				boost::transform_iterator<
-					replace_value_if< Pred, BOOST_DEDUCED_TYPENAME range_value<R>::type >,
-					BOOST_DEDUCED_TYPENAME range_iterator<R>::type > > base_t;
+            typedef boost::iterator_range<
+                boost::transform_iterator<
+                    replace_value_if< Pred, BOOST_DEDUCED_TYPENAME range_value<R>::type >,
+                    BOOST_DEDUCED_TYPENAME range_iterator<R>::type > > base_t;
 
-		public:
-			typedef BOOST_DEDUCED_TYPENAME range_value<R>::type value_type;
+        public:
+            typedef BOOST_DEDUCED_TYPENAME range_value<R>::type value_type;
 
-			replace_if_range( R& r, const Pred& pred, value_type to )
-				: base_t( make_transform_iterator( boost::begin(r), Fn(pred, to) ),
-						  make_transform_iterator( boost::end(r), Fn(pred, to) ) )
-			{ }
-		};
+            replace_if_range( R& r, const Pred& pred, value_type to )
+                : base_t( make_transform_iterator( boost::begin(r), Fn(pred, to) ),
+                          make_transform_iterator( boost::end(r), Fn(pred, to) ) )
+            { }
+        };
 
-		template< class Pred, class T >
-		class replace_if_holder
-		{
-		public:
-			replace_if_holder( const Pred& pred, const T& to )
-				: m_pred(pred), m_to(to)
-			{ }
+        template< class Pred, class T >
+        class replace_if_holder
+        {
+        public:
+            replace_if_holder( const Pred& pred, const T& to )
+                : m_pred(pred), m_to(to)
+            { }
 
-			const Pred& pred() const { return m_pred; }
-			const T& to() const { return m_to; }
+            const Pred& pred() const { return m_pred; }
+            const T& to() const { return m_to; }
 
-		private:
-			Pred m_pred;
-			T m_to;
-		};
+        private:
+            Pred m_pred;
+            T m_to;
+        };
 
-		template< class Pred, class InputRng >
-		inline replace_if_range<Pred, InputRng>
-		operator|( InputRng& r,
-				   const replace_if_holder<Pred, BOOST_DEDUCED_TYPENAME range_value<InputRng>::type>& f )
-		{
-			return replace_if_range<Pred, InputRng>(r, f.pred(), f.to());
-		}
+        template< class Pred, class InputRng >
+        inline replace_if_range<Pred, InputRng>
+        operator|( InputRng& r,
+                   const replace_if_holder<Pred, BOOST_DEDUCED_TYPENAME range_value<InputRng>::type>& f )
+        {
+            return replace_if_range<Pred, InputRng>(r, f.pred(), f.to());
+        }
 
-		template< class Pred, class InputRng >
-		inline replace_if_range<Pred, const InputRng>
-		operator|( const InputRng& r,
-				   const replace_if_holder<Pred, BOOST_DEDUCED_TYPENAME range_value<InputRng>::type>& f )
-		{
-			return replace_if_range<Pred, const InputRng>(r, f.pred(), f.to());
-		}
-	} // 'range_detail'
+        template< class Pred, class InputRng >
+        inline replace_if_range<Pred, const InputRng>
+        operator|( const InputRng& r,
+                   const replace_if_holder<Pred, BOOST_DEDUCED_TYPENAME range_value<InputRng>::type>& f )
+        {
+            return replace_if_range<Pred, const InputRng>(r, f.pred(), f.to());
+        }
+    } // 'range_detail'
 
     using range_detail::replace_if_range;
 
-	namespace adaptors
-	{
-		namespace
-		{
-			const range_detail::forwarder2TU<range_detail::replace_if_holder>
-				replaced_if =
-					range_detail::forwarder2TU<range_detail::replace_if_holder>();
-		}
-		
-	    template<class Pred, class InputRange>
-	    inline replace_if_range<Pred, InputRange>
-	    replace_if(InputRange& rng, Pred pred,
+    namespace adaptors
+    {
+        namespace
+        {
+            const range_detail::forwarder2TU<range_detail::replace_if_holder>
+                replaced_if =
+                    range_detail::forwarder2TU<range_detail::replace_if_holder>();
+        }
+        
+        template<class Pred, class InputRange>
+        inline replace_if_range<Pred, InputRange>
+        replace_if(InputRange& rng, Pred pred,
                    BOOST_DEDUCED_TYPENAME range_value<InputRange>::type to)
-	    {
-	        return range_detail::replace_if_range<Pred, InputRange>(rng, pred, to);
-	    }
+        {
+            return range_detail::replace_if_range<Pred, InputRange>(rng, pred, to);
+        }
 
-	    template<class Pred, class InputRange>
-	    inline replace_if_range<Pred, const InputRange>
-	    replace_if(const InputRange& rng, Pred pred,
-	               BOOST_DEDUCED_TYPENAME range_value<const InputRange>::type to)
-	    {
-	        return range_detail::replace_if_range<Pred, const InputRange>(rng, pred, to);
-	    }
-	} // 'adaptors'
-	
+        template<class Pred, class InputRange>
+        inline replace_if_range<Pred, const InputRange>
+        replace_if(const InputRange& rng, Pred pred,
+                   BOOST_DEDUCED_TYPENAME range_value<const InputRange>::type to)
+        {
+            return range_detail::replace_if_range<Pred, const InputRange>(rng, pred, to);
+        }
+    } // 'adaptors'
+    
 } // 'boost'
 
 #endif // include guard
diff --git a/include/boost/range/adaptor/reversed.hpp b/include/boost/range/adaptor/reversed.hpp
index afe7517..229702b 100755
--- a/include/boost/range/adaptor/reversed.hpp
+++ b/include/boost/range/adaptor/reversed.hpp
@@ -16,75 +16,75 @@
 
 namespace boost
 {
-	namespace range_detail
-	{
-		template< class R >
-		struct reverse_range : 
-			public boost::iterator_range< 
-			          boost::reverse_iterator<
-			            BOOST_DEDUCED_TYPENAME range_iterator<R>::type 
-			                                  >
-			                             >
-		{
-		private:
-			typedef boost::iterator_range< 
-			          boost::reverse_iterator<
-			            BOOST_DEDUCED_TYPENAME range_iterator<R>::type 
-			                                  >
-			                             >
-				base;
-			
-		public:
-			typedef boost::reverse_iterator<BOOST_DEDUCED_TYPENAME range_iterator<R>::type> iterator;
+    namespace range_detail
+    {
+        template< class R >
+        struct reverse_range : 
+            public boost::iterator_range< 
+                      boost::reverse_iterator<
+                        BOOST_DEDUCED_TYPENAME range_iterator<R>::type 
+                                              >
+                                         >
+        {
+        private:
+            typedef boost::iterator_range< 
+                      boost::reverse_iterator<
+                        BOOST_DEDUCED_TYPENAME range_iterator<R>::type 
+                                              >
+                                         >
+                base;
+            
+        public:
+            typedef boost::reverse_iterator<BOOST_DEDUCED_TYPENAME range_iterator<R>::type> iterator;
 
-			reverse_range( R& r ) 
-				: base( iterator(boost::end(r)), iterator(boost::begin(r)) )
-			{ }
-		};
+            reverse_range( R& r ) 
+                : base( iterator(boost::end(r)), iterator(boost::begin(r)) )
+            { }
+        };
 
-		struct reverse_forwarder {};
-		
-		template< class BidirectionalRng >
-		inline reverse_range<BidirectionalRng> 
-		operator|( BidirectionalRng& r, reverse_forwarder )
-		{
-			return reverse_range<BidirectionalRng>( r );   
-		}
-	
-		template< class BidirectionalRng >
-		inline reverse_range<const BidirectionalRng> 
-		operator|( const BidirectionalRng& r, reverse_forwarder )
-		{
-			return reverse_range<const BidirectionalRng>( r );   
-		}
-		
-	} // 'range_detail'
-	
-	using range_detail::reverse_range;
-
-	namespace adaptors
-	{ 
-		namespace
-		{
-			const range_detail::reverse_forwarder reversed = 
-				                            range_detail::reverse_forwarder();
-		}
-		
-		template<class BidirectionalRange>
-		inline reverse_range<BidirectionalRange>
-		reverse(BidirectionalRange& rng)
-		{
-		    return reverse_range<BidirectionalRange>(rng);
-	    }
-	    
-	    template<class BidirectionalRange>
-	    inline reverse_range<const BidirectionalRange>
-	    reverse(const BidirectionalRange& rng)
-	    {
-	        return reverse_range<const BidirectionalRange>(rng);
+        struct reverse_forwarder {};
+        
+        template< class BidirectionalRng >
+        inline reverse_range<BidirectionalRng> 
+        operator|( BidirectionalRng& r, reverse_forwarder )
+        {
+            return reverse_range<BidirectionalRng>( r );   
         }
-	} // 'adaptors'
-	
+    
+        template< class BidirectionalRng >
+        inline reverse_range<const BidirectionalRng> 
+        operator|( const BidirectionalRng& r, reverse_forwarder )
+        {
+            return reverse_range<const BidirectionalRng>( r );   
+        }
+        
+    } // 'range_detail'
+    
+    using range_detail::reverse_range;
+
+    namespace adaptors
+    { 
+        namespace
+        {
+            const range_detail::reverse_forwarder reversed = 
+                                            range_detail::reverse_forwarder();
+        }
+        
+        template<class BidirectionalRange>
+        inline reverse_range<BidirectionalRange>
+        reverse(BidirectionalRange& rng)
+        {
+            return reverse_range<BidirectionalRange>(rng);
+        }
+        
+        template<class BidirectionalRange>
+        inline reverse_range<const BidirectionalRange>
+        reverse(const BidirectionalRange& rng)
+        {
+            return reverse_range<const BidirectionalRange>(rng);
+        }
+    } // 'adaptors'
+    
 } // 'boost'
 
 #endif
diff --git a/include/boost/range/adaptor/strided.hpp b/include/boost/range/adaptor/strided.hpp
index 0c394b2..5f4c4fa 100755
--- a/include/boost/range/adaptor/strided.hpp
+++ b/include/boost/range/adaptor/strided.hpp
@@ -18,132 +18,132 @@
 
 namespace boost
 {
-	namespace range_detail
-	{
+    namespace range_detail
+    {
 
-		template<typename BaseIterator>
-		class strided_iterator
-			: public iterator_adaptor<
-						strided_iterator<BaseIterator>,
-						BaseIterator>
-		{
-			friend class iterator_core_access;
+        template<typename BaseIterator>
+        class strided_iterator
+            : public iterator_adaptor<
+                        strided_iterator<BaseIterator>,
+                        BaseIterator>
+        {
+            friend class iterator_core_access;
 
-			typedef iterator_adaptor<strided_iterator<BaseIterator>, BaseIterator> super_t;
-		
-		public:
-			typedef BOOST_DEDUCED_TYPENAME std::iterator_traits<BaseIterator>::difference_type			difference_type;
-				
-			strided_iterator() : m_stride() { }
-		
-			strided_iterator(const strided_iterator& other)
-				: super_t(other), m_stride(other.m_stride) { }
-		
-			explicit strided_iterator(BaseIterator base_it, difference_type stride)
-				: super_t(base_it), m_stride(stride) { }
-		
-			strided_iterator&
-			operator=(const strided_iterator& other)
-			{
-				super_t::operator=(other);
-			
-				// Is the interoperation of the stride safe?
-				m_stride = other.m_stride;
-				return *this;
-			}
-		
-			void increment() { std::advance(this->base_reference(), m_stride); }
-		
-			void decrement() { std::advance(this->base_reference(), -m_stride); }
-		
-			void advance(difference_type n)	{ std::advance(this->base_reference(), n * m_stride); }
-		
-			difference_type
-			distance_to(const strided_iterator& other) const
-			{
-				return std::distance(this->base_reference(), other.base_reference()) / m_stride;
-			}
+            typedef iterator_adaptor<strided_iterator<BaseIterator>, BaseIterator> super_t;
+        
+        public:
+            typedef BOOST_DEDUCED_TYPENAME std::iterator_traits<BaseIterator>::difference_type          difference_type;
+                
+            strided_iterator() : m_stride() { }
+        
+            strided_iterator(const strided_iterator& other)
+                : super_t(other), m_stride(other.m_stride) { }
+        
+            explicit strided_iterator(BaseIterator base_it, difference_type stride)
+                : super_t(base_it), m_stride(stride) { }
+        
+            strided_iterator&
+            operator=(const strided_iterator& other)
+            {
+                super_t::operator=(other);
+            
+                // Is the interoperation of the stride safe?
+                m_stride = other.m_stride;
+                return *this;
+            }
+        
+            void increment() { std::advance(this->base_reference(), m_stride); }
+        
+            void decrement() { std::advance(this->base_reference(), -m_stride); }
+        
+            void advance(difference_type n) { std::advance(this->base_reference(), n * m_stride); }
+        
+            difference_type
+            distance_to(const strided_iterator& other) const
+            {
+                return std::distance(this->base_reference(), other.base_reference()) / m_stride;
+            }
 
-			// Using the compiler generated copy constructor and
-			// and assignment operator
-		
-		private:
-			difference_type m_stride;
-		};
-	
-		template<class BaseIterator> inline
-		strided_iterator<BaseIterator>
-		make_strided_iterator(
-			const BaseIterator& first,
-			BOOST_DEDUCED_TYPENAME std::iterator_traits<BaseIterator>::difference_type stride)
-		{
-			return strided_iterator<BaseIterator>(first, stride);
-		}
+            // Using the compiler generated copy constructor and
+            // and assignment operator
+        
+        private:
+            difference_type m_stride;
+        };
+    
+        template<class BaseIterator> inline
+        strided_iterator<BaseIterator>
+        make_strided_iterator(
+            const BaseIterator& first,
+            BOOST_DEDUCED_TYPENAME std::iterator_traits<BaseIterator>::difference_type stride)
+        {
+            return strided_iterator<BaseIterator>(first, stride);
+        }
 
-		template< class Rng >
-		class strided_range
-			: public iterator_range<range_detail::strided_iterator<BOOST_DEDUCED_TYPENAME range_iterator<Rng>::type> >
-		{
-			typedef range_detail::strided_iterator<BOOST_DEDUCED_TYPENAME range_iterator<Rng>::type> iter_type;
-			typedef iterator_range<iter_type> super_t;
-		public:
-			template< typename Difference >
-			strided_range(Difference stride, Rng& rng)
+        template< class Rng >
+        class strided_range
+            : public iterator_range<range_detail::strided_iterator<BOOST_DEDUCED_TYPENAME range_iterator<Rng>::type> >
+        {
+            typedef range_detail::strided_iterator<BOOST_DEDUCED_TYPENAME range_iterator<Rng>::type> iter_type;
+            typedef iterator_range<iter_type> super_t;
+        public:
+            template< typename Difference >
+            strided_range(Difference stride, Rng& rng)
                 : super_t(make_strided_iterator(boost::begin(rng), stride),
                     make_strided_iterator(boost::end(rng), stride))
-			{
-			}
-		};
+            {
+            }
+        };
 
-		template<class Difference>
-		class strided_holder : public holder<Difference>
-		{
-		public:
-			strided_holder(Difference value) : holder<Difference>(value) {}
-		};
+        template<class Difference>
+        class strided_holder : public holder<Difference>
+        {
+        public:
+            strided_holder(Difference value) : holder<Difference>(value) {}
+        };
 
-		template<class Rng, class Difference>
-		inline strided_range<Rng>
-		operator|(Rng& rng, const strided_holder<Difference>& stride)
-		{
-			return strided_range<Rng>(stride.val, rng);
-		}
+        template<class Rng, class Difference>
+        inline strided_range<Rng>
+        operator|(Rng& rng, const strided_holder<Difference>& stride)
+        {
+            return strided_range<Rng>(stride.val, rng);
+        }
 
-		template<class Rng, class Difference>
-		inline strided_range<const Rng>
-		operator|(const Rng& rng, const strided_holder<Difference>& stride)
-		{
-			return strided_range<const Rng>(stride.val, rng);
-		}
+        template<class Rng, class Difference>
+        inline strided_range<const Rng>
+        operator|(const Rng& rng, const strided_holder<Difference>& stride)
+        {
+            return strided_range<const Rng>(stride.val, rng);
+        }
 
-	} // namespace range_detail
-	
-	using range_detail::strided_range;
+    } // namespace range_detail
+    
+    using range_detail::strided_range;
 
-	namespace adaptors
-	{
-	
-		namespace
-		{
-			const range_detail::forwarder<range_detail::strided_holder>
-				strided = range_detail::forwarder<range_detail::strided_holder>();
-		}
-		
-		template<class Range, class Difference>
-		inline strided_range<Range>
-		stride(Range& rng, Difference step)
-		{
-		    return strided_range<Range>(step, rng);
-	    }
-	    
-	    template<class Range, class Difference>
-	    inline strided_range<const Range>
-	    stride(const Range& rng, Difference step)
-	    {
-	        return strided_range<const Range>(step, rng);
+    namespace adaptors
+    {
+    
+        namespace
+        {
+            const range_detail::forwarder<range_detail::strided_holder>
+                strided = range_detail::forwarder<range_detail::strided_holder>();
         }
         
-	} // namespace 'adaptors'
+        template<class Range, class Difference>
+        inline strided_range<Range>
+        stride(Range& rng, Difference step)
+        {
+            return strided_range<Range>(step, rng);
+        }
+        
+        template<class Range, class Difference>
+        inline strided_range<const Range>
+        stride(const Range& rng, Difference step)
+        {
+            return strided_range<const Range>(step, rng);
+        }
+        
+    } // namespace 'adaptors'
 } // namespace 'boost'
 
 #endif
diff --git a/include/boost/range/adaptor/tokenized.hpp b/include/boost/range/adaptor/tokenized.hpp
index c81d515..6b6a6fa 100755
--- a/include/boost/range/adaptor/tokenized.hpp
+++ b/include/boost/range/adaptor/tokenized.hpp
@@ -16,122 +16,122 @@
 
 namespace boost
 {
-	namespace range_detail
-	{
+    namespace range_detail
+    {
 
-		template< class R >
-		struct token_range : 
-			public boost::iterator_range< 
-					  boost::regex_token_iterator< 
-   						  BOOST_DEDUCED_TYPENAME range_iterator<R>::type 
-											  >
-										 >
-		{
-		private:
-			typedef  		  
-				boost::regex_token_iterator< 
-						  BOOST_DEDUCED_TYPENAME range_iterator<R>::type 
-											>
-				regex_iter;
-			
-			typedef BOOST_DEDUCED_TYPENAME regex_iter::regex_type 
-				regex_type;
-		
-			typedef boost::iterator_range<regex_iter> 
-				base;
+        template< class R >
+        struct token_range : 
+            public boost::iterator_range< 
+                      boost::regex_token_iterator< 
+                          BOOST_DEDUCED_TYPENAME range_iterator<R>::type 
+                                              >
+                                         >
+        {
+        private:
+            typedef           
+                boost::regex_token_iterator< 
+                          BOOST_DEDUCED_TYPENAME range_iterator<R>::type 
+                                            >
+                regex_iter;
+            
+            typedef BOOST_DEDUCED_TYPENAME regex_iter::regex_type 
+                regex_type;
+        
+            typedef boost::iterator_range<regex_iter> 
+                base;
 
-		public:
-			template< class Regex, class Submatch, class Flag >
-			token_range( R& r, const Regex& re, const Submatch& sub, Flag f )
-			  : base( regex_iter( boost::begin(r), boost::end(r), 
-								  regex_type(re), sub, f ),
-					  regex_iter() )
-			{ }
-		};
+        public:
+            template< class Regex, class Submatch, class Flag >
+            token_range( R& r, const Regex& re, const Submatch& sub, Flag f )
+              : base( regex_iter( boost::begin(r), boost::end(r), 
+                                  regex_type(re), sub, f ),
+                      regex_iter() )
+            { }
+        };
 
-		template< class T, class U, class V >
-		struct regex_holder
-		{
-			const T&  re;
-			const U&  sub;
-			V         f;
+        template< class T, class U, class V >
+        struct regex_holder
+        {
+            const T&  re;
+            const U&  sub;
+            V         f;
 
-			regex_holder( const T& rex, const U& subm, V flag ) :
-				re(rex), sub(subm), f(flag)
-			{ }
-		private:
-			// Not assignable
-			void operator=(const regex_holder&);
-		};
+            regex_holder( const T& rex, const U& subm, V flag ) :
+                re(rex), sub(subm), f(flag)
+            { }
+        private:
+            // Not assignable
+            void operator=(const regex_holder&);
+        };
 
-		struct regex_forwarder
-		{			
-			template< class Regex >
-			regex_holder<Regex,int,regex_constants::match_flag_type>
-			operator()( const Regex& re, 
-						int submatch = 0,    
-						regex_constants::match_flag_type f = 
-							regex_constants::match_default ) const
-		    {
-				return regex_holder<Regex,int,
-					       regex_constants::match_flag_type>( re, submatch, f );
-			}
-			 
-			template< class Regex, class Submatch >
-			regex_holder<Regex,Submatch,regex_constants::match_flag_type> 
-			operator()( const Regex& re, 
-						const Submatch& sub, 
-						regex_constants::match_flag_type f = 
-						    regex_constants::match_default ) const
-			{
-				return regex_holder<Regex,Submatch,
-					       regex_constants::match_flag_type>( re, sub, f ); 
-			}
-		};
-		
-		template< class BidirectionalRng, class R, class S, class F >
-		inline token_range<BidirectionalRng> 
-		operator|( BidirectionalRng& r, 
-				   const regex_holder<R,S,F>& f )
-		{
-			return token_range<BidirectionalRng>( r, f.re, f.sub, f.f );   
-		}
+        struct regex_forwarder
+        {           
+            template< class Regex >
+            regex_holder<Regex,int,regex_constants::match_flag_type>
+            operator()( const Regex& re, 
+                        int submatch = 0,    
+                        regex_constants::match_flag_type f = 
+                            regex_constants::match_default ) const
+            {
+                return regex_holder<Regex,int,
+                           regex_constants::match_flag_type>( re, submatch, f );
+            }
+             
+            template< class Regex, class Submatch >
+            regex_holder<Regex,Submatch,regex_constants::match_flag_type> 
+            operator()( const Regex& re, 
+                        const Submatch& sub, 
+                        regex_constants::match_flag_type f = 
+                            regex_constants::match_default ) const
+            {
+                return regex_holder<Regex,Submatch,
+                           regex_constants::match_flag_type>( re, sub, f ); 
+            }
+        };
+        
+        template< class BidirectionalRng, class R, class S, class F >
+        inline token_range<BidirectionalRng> 
+        operator|( BidirectionalRng& r, 
+                   const regex_holder<R,S,F>& f )
+        {
+            return token_range<BidirectionalRng>( r, f.re, f.sub, f.f );   
+        }
 
-		template< class BidirectionalRng, class R, class S, class F  >
-		inline token_range<const BidirectionalRng> 
-		operator|( const BidirectionalRng& r, 
-				   const regex_holder<R,S,F>& f )
-		{
-			return token_range<const BidirectionalRng>( r, f.re, f.sub, f.f );
-		}
-		
-	} // 'range_detail'
+        template< class BidirectionalRng, class R, class S, class F  >
+        inline token_range<const BidirectionalRng> 
+        operator|( const BidirectionalRng& r, 
+                   const regex_holder<R,S,F>& f )
+        {
+            return token_range<const BidirectionalRng>( r, f.re, f.sub, f.f );
+        }
+        
+    } // 'range_detail'
 
     using range_detail::token_range;
 
-	namespace adaptors
-	{ 
-		namespace
-		{
-			const range_detail::regex_forwarder tokenized = 
-				    range_detail::regex_forwarder();
-		}
-		
-		template<class BidirectionalRange, class Regex, class Submatch, class Flag>
-		inline token_range<BidirectionalRange>
-		tokenize(BidirectionalRange& rng, const Regex& reg, const Submatch& sub, Flag f)
-		{
-		    return token_range<BidirectionalRange>(rng, reg, sub, f);
-		}
-		
-		template<class BidirectionalRange, class Regex, class Submatch, class Flag>
-		inline token_range<const BidirectionalRange>
-		tokenize(const BidirectionalRange& rng, const Regex& reg, const Submatch& sub, Flag f)
-		{
-		    return token_range<const BidirectionalRange>(rng, reg, sub, f);
-	    }
-	} // 'adaptors'
-	
+    namespace adaptors
+    { 
+        namespace
+        {
+            const range_detail::regex_forwarder tokenized = 
+                    range_detail::regex_forwarder();
+        }
+        
+        template<class BidirectionalRange, class Regex, class Submatch, class Flag>
+        inline token_range<BidirectionalRange>
+        tokenize(BidirectionalRange& rng, const Regex& reg, const Submatch& sub, Flag f)
+        {
+            return token_range<BidirectionalRange>(rng, reg, sub, f);
+        }
+        
+        template<class BidirectionalRange, class Regex, class Submatch, class Flag>
+        inline token_range<const BidirectionalRange>
+        tokenize(const BidirectionalRange& rng, const Regex& reg, const Submatch& sub, Flag f)
+        {
+            return token_range<const BidirectionalRange>(rng, reg, sub, f);
+        }
+    } // 'adaptors'
+    
 }
 
 #endif
diff --git a/include/boost/range/adaptor/transformed.hpp b/include/boost/range/adaptor/transformed.hpp
index 0eeaee7..00297ca 100755
--- a/include/boost/range/adaptor/transformed.hpp
+++ b/include/boost/range/adaptor/transformed.hpp
@@ -17,87 +17,87 @@
 
 namespace boost
 {
-	namespace range_detail
-	{
+    namespace range_detail
+    {
 
-		template< class F, class R >
-		struct transform_range : 
-			public boost::iterator_range< 
-					  boost::transform_iterator< F,
-   						  BOOST_DEDUCED_TYPENAME range_iterator<R>::type 
-											  >
-										 >
-		{
-		private:
-			typedef boost::iterator_range< 
-					  boost::transform_iterator< F,
-						BOOST_DEDUCED_TYPENAME range_iterator<R>::type 
-											  >
-										 >
-				base;
+        template< class F, class R >
+        struct transform_range : 
+            public boost::iterator_range< 
+                      boost::transform_iterator< F,
+                          BOOST_DEDUCED_TYPENAME range_iterator<R>::type 
+                                              >
+                                         >
+        {
+        private:
+            typedef boost::iterator_range< 
+                      boost::transform_iterator< F,
+                        BOOST_DEDUCED_TYPENAME range_iterator<R>::type 
+                                              >
+                                         >
+                base;
 
-		public:
-		    typedef F transform_fn_type;
-		    typedef R source_range_type;
-		    
-			transform_range( F f, R& r )
-				: base( make_transform_iterator( boost::begin(r), f ),
-						make_transform_iterator( boost::end(r), f ) ) 
-			
-			{ }
-		};
+        public:
+            typedef F transform_fn_type;
+            typedef R source_range_type;
+            
+            transform_range( F f, R& r )
+                : base( make_transform_iterator( boost::begin(r), f ),
+                        make_transform_iterator( boost::end(r), f ) ) 
+            
+            { }
+        };
 
-		template< class T >
-		struct transform_holder : holder<T>
-		{
-			transform_holder( T r ) : holder<T>(r)
-			{ }
-		};
-		
-		template< class InputRng, class UnaryFunction >
-		inline transform_range<UnaryFunction,InputRng> 
-		operator|( InputRng& r, 
-				   const transform_holder<UnaryFunction>& f )
-		{
-			return transform_range<UnaryFunction,InputRng>( f.val, r );   
-		}
-	
-		template< class InputRng, class UnaryFunction >
-		inline transform_range<UnaryFunction, const InputRng> 
-		operator|( const InputRng& r, 
-				   const transform_holder<UnaryFunction>& f )
-		{
-		   return transform_range<UnaryFunction, const InputRng>( f.val, r );   
-		}
-		
-	} // 'range_detail'
+        template< class T >
+        struct transform_holder : holder<T>
+        {
+            transform_holder( T r ) : holder<T>(r)
+            { }
+        };
+        
+        template< class InputRng, class UnaryFunction >
+        inline transform_range<UnaryFunction,InputRng> 
+        operator|( InputRng& r, 
+                   const transform_holder<UnaryFunction>& f )
+        {
+            return transform_range<UnaryFunction,InputRng>( f.val, r );   
+        }
+    
+        template< class InputRng, class UnaryFunction >
+        inline transform_range<UnaryFunction, const InputRng> 
+        operator|( const InputRng& r, 
+                   const transform_holder<UnaryFunction>& f )
+        {
+           return transform_range<UnaryFunction, const InputRng>( f.val, r );   
+        }
+        
+    } // 'range_detail'
 
-	using range_detail::transform_range;
-		
-	namespace adaptors
-	{ 
-		namespace
-		{
-			const range_detail::forwarder<range_detail::transform_holder> 
-				    transformed = 
+    using range_detail::transform_range;
+        
+    namespace adaptors
+    { 
+        namespace
+        {
+            const range_detail::forwarder<range_detail::transform_holder> 
+                    transformed = 
                       range_detail::forwarder<range_detail::transform_holder>();
-		}
-		
-		template<class UnaryFunction, class InputRange>
-		inline transform_range<UnaryFunction, InputRange>
-		transform(InputRange& rng, UnaryFunction fn)
-		{
-		    return transform_range<UnaryFunction, InputRange>(fn, rng);
-		}
-		
-		template<class UnaryFunction, class InputRange>
-		inline transform_range<UnaryFunction, const InputRange>
-		transform(const InputRange& rng, UnaryFunction fn)
-		{
-		    return transform_range<UnaryFunction, const InputRange>(fn, rng);
-	    }
-	} // 'adaptors'
-	
+        }
+        
+        template<class UnaryFunction, class InputRange>
+        inline transform_range<UnaryFunction, InputRange>
+        transform(InputRange& rng, UnaryFunction fn)
+        {
+            return transform_range<UnaryFunction, InputRange>(fn, rng);
+        }
+        
+        template<class UnaryFunction, class InputRange>
+        inline transform_range<UnaryFunction, const InputRange>
+        transform(const InputRange& rng, UnaryFunction fn)
+        {
+            return transform_range<UnaryFunction, const InputRange>(fn, rng);
+        }
+    } // 'adaptors'
+    
 }
 
 #endif
diff --git a/include/boost/range/adaptor/uniqued.hpp b/include/boost/range/adaptor/uniqued.hpp
index ddaf3fe..ad6f7f4 100755
--- a/include/boost/range/adaptor/uniqued.hpp
+++ b/include/boost/range/adaptor/uniqued.hpp
@@ -16,74 +16,74 @@
 namespace boost
 {
 
-	namespace range_detail
-	{
-		struct unique_forwarder { };
+    namespace range_detail
+    {
+        struct unique_forwarder { };
 
-		struct unique_not_equal_to
-		{
-			typedef bool result_type;
+        struct unique_not_equal_to
+        {
+            typedef bool result_type;
 
-			template< class T >
-			bool operator()( const T& l, const T& r ) const
-			{
-				return !(l == r);
-			}
-		};
+            template< class T >
+            bool operator()( const T& l, const T& r ) const
+            {
+                return !(l == r);
+            }
+        };
 
-		template<class ForwardRng>
-		class unique_range : public adjacent_filter_range<unique_not_equal_to, ForwardRng, true>
-		{
-			typedef adjacent_filter_range<unique_not_equal_to, ForwardRng, true> base;
-		public:
-		    explicit unique_range(ForwardRng& rng)
-		        : base(unique_not_equal_to(), rng)
-		    {
-		    }
-		};
+        template<class ForwardRng>
+        class unique_range : public adjacent_filter_range<unique_not_equal_to, ForwardRng, true>
+        {
+            typedef adjacent_filter_range<unique_not_equal_to, ForwardRng, true> base;
+        public:
+            explicit unique_range(ForwardRng& rng)
+                : base(unique_not_equal_to(), rng)
+            {
+            }
+        };
 
-		template< class ForwardRng >
-		inline unique_range<ForwardRng>
-		operator|( ForwardRng& r,
-				   unique_forwarder )
-		{
-			return unique_range<ForwardRng>(r);
-		}
-
-		template< class ForwardRng >
-		inline unique_range<const ForwardRng>
-		operator|( const ForwardRng& r,
-				   unique_forwarder )
-		{
-			return unique_range<const ForwardRng>(r);
-		}
-
-	} // 'range_detail'
-
-	using range_detail::unique_range;
-
-	namespace adaptors
-	{
-		namespace
-		{
-			const range_detail::unique_forwarder uniqued =
-				       range_detail::unique_forwarder();
-		}
-
-		template<class ForwardRange>
-		inline unique_range<ForwardRange>
-		unique(ForwardRange& rng)
-		{
-		    return unique_range<ForwardRange>(rng);
-	    }
-
-	    template<class ForwardRange>
-	    inline unique_range<const ForwardRange>
-	    unique(const ForwardRange& rng)
-	    {
-	        return unique_range<const ForwardRange>(rng);
+        template< class ForwardRng >
+        inline unique_range<ForwardRng>
+        operator|( ForwardRng& r,
+                   unique_forwarder )
+        {
+            return unique_range<ForwardRng>(r);
         }
-	} // 'adaptors'
+
+        template< class ForwardRng >
+        inline unique_range<const ForwardRng>
+        operator|( const ForwardRng& r,
+                   unique_forwarder )
+        {
+            return unique_range<const ForwardRng>(r);
+        }
+
+    } // 'range_detail'
+
+    using range_detail::unique_range;
+
+    namespace adaptors
+    {
+        namespace
+        {
+            const range_detail::unique_forwarder uniqued =
+                       range_detail::unique_forwarder();
+        }
+
+        template<class ForwardRange>
+        inline unique_range<ForwardRange>
+        unique(ForwardRange& rng)
+        {
+            return unique_range<ForwardRange>(rng);
+        }
+
+        template<class ForwardRange>
+        inline unique_range<const ForwardRange>
+        unique(const ForwardRange& rng)
+        {
+            return unique_range<const ForwardRange>(rng);
+        }
+    } // 'adaptors'
 
 }
 
diff --git a/include/boost/range/adaptors.hpp b/include/boost/range/adaptors.hpp
index a1fad4f..92062a9 100755
--- a/include/boost/range/adaptors.hpp
+++ b/include/boost/range/adaptors.hpp
@@ -22,8 +22,9 @@
 #include <boost/range/adaptor/replaced_if.hpp>
 #include <boost/range/adaptor/reversed.hpp>
 #include <boost/range/adaptor/sliced.hpp>
+#include <boost/range/adaptor/strided.hpp>
 #include <boost/range/adaptor/tokenized.hpp>
 #include <boost/range/adaptor/transformed.hpp>
 #include <boost/range/adaptor/uniqued.hpp>
 
-#endif 
+#endif
diff --git a/include/boost/range/algorithm/equal.hpp b/include/boost/range/algorithm/equal.hpp
index e210ef5..7226440 100755
--- a/include/boost/range/algorithm/equal.hpp
+++ b/include/boost/range/algorithm/equal.hpp
@@ -20,7 +20,7 @@ namespace boost
     {
         // An implementation of equality comparison that is optimized for iterator
         // traversal categories less than RandomAccessTraversal.
-		template< class SinglePassTraversalReadableIterator1,
+        template< class SinglePassTraversalReadableIterator1,
                   class SinglePassTraversalReadableIterator2,
                   class IteratorCategoryTag1,
                   class IteratorCategoryTag2 >
diff --git a/include/boost/range/algorithm/generate.hpp b/include/boost/range/algorithm/generate.hpp
index 97a0d9d..bd63a48 100755
--- a/include/boost/range/algorithm/generate.hpp
+++ b/include/boost/range/algorithm/generate.hpp
@@ -33,15 +33,6 @@ inline ForwardRange& generate( ForwardRange& rng, Generator gen )
     return rng;
 }
 
-/// \overload
-template< class ForwardRange, class Generator >
-inline const ForwardRange& generate(const ForwardRange& rng, Generator gen)
-{
-    BOOST_RANGE_CONCEPT_ASSERT(( ForwardRangeConcept<const ForwardRange> ));
-    std::generate(boost::begin(rng), boost::end(rng), gen);
-    return rng;
-}
-
     } // namespace range
     using range::generate;
 } // namespace boost
diff --git a/include/boost/range/algorithm/heap_algorithm.hpp b/include/boost/range/algorithm/heap_algorithm.hpp
index 857a30f..64df3e9 100755
--- a/include/boost/range/algorithm/heap_algorithm.hpp
+++ b/include/boost/range/algorithm/heap_algorithm.hpp
@@ -27,34 +27,20 @@ namespace boost
 /// \pre RandomAccessRange is a model of the RandomAccessRangeConcept
 /// \pre Compare is a model of the BinaryPredicateConcept
 template<class RandomAccessRange>
-inline void push_heap(RandomAccessRange& rng)
+inline RandomAccessRange& push_heap(RandomAccessRange& rng)
 {
     BOOST_RANGE_CONCEPT_ASSERT(( RandomAccessRangeConcept<RandomAccessRange> ));
     std::push_heap(boost::begin(rng), boost::end(rng));
-}
-
-/// \overload
-template<class RandomAccessRange>
-inline void push_heap(const RandomAccessRange& rng)
-{
-    BOOST_RANGE_CONCEPT_ASSERT(( RandomAccessRangeConcept<const RandomAccessRange> ));
-    std::push_heap(boost::begin(rng), boost::end(rng));
+    return rng;
 }
 
 /// \overload
 template<class RandomAccessRange, class Compare>
-inline void push_heap(RandomAccessRange& rng, Compare comp_pred)
+inline RandomAccessRange& push_heap(RandomAccessRange& rng, Compare comp_pred)
 {
     BOOST_RANGE_CONCEPT_ASSERT(( RandomAccessRangeConcept<RandomAccessRange> ));
     std::push_heap(boost::begin(rng), boost::end(rng), comp_pred);
-}
-
-/// \overload
-template<class RandomAccessRange, class Compare>
-inline void push_heap(const RandomAccessRange& rng, Compare comp_pred)
-{
-    BOOST_RANGE_CONCEPT_ASSERT(( RandomAccessRangeConcept<const RandomAccessRange> ));
-    std::push_heap(boost::begin(rng), boost::end(rng), comp_pred);
+    return rng;
 }
 
 /// \brief template function pop_heap
@@ -64,34 +50,20 @@ inline void push_heap(const RandomAccessRange& rng, Compare comp_pred)
 /// \pre RandomAccessRange is a model of the RandomAccessRangeConcept
 /// \pre Compare is a model of the BinaryPredicateConcept
 template<class RandomAccessRange>
-inline void pop_heap(RandomAccessRange& rng)
+inline RandomAccessRange& pop_heap(RandomAccessRange& rng)
 {
     BOOST_RANGE_CONCEPT_ASSERT(( RandomAccessRangeConcept<RandomAccessRange> ));
     std::pop_heap(boost::begin(rng), boost::end(rng));
-}
-
-/// \overload
-template<class RandomAccessRange>
-inline void pop_heap(const RandomAccessRange& rng)
-{
-    BOOST_RANGE_CONCEPT_ASSERT(( RandomAccessRangeConcept<const RandomAccessRange> ));
-    std::pop_heap(boost::begin(rng),boost::end(rng));
+    return rng;
 }
 
 /// \overload
 template<class RandomAccessRange, class Compare>
-inline void pop_heap(RandomAccessRange& rng, Compare comp_pred)
+inline RandomAccessRange& pop_heap(RandomAccessRange& rng, Compare comp_pred)
 {
     BOOST_RANGE_CONCEPT_ASSERT(( RandomAccessRangeConcept<RandomAccessRange> ));
     std::pop_heap(boost::begin(rng), boost::end(rng), comp_pred);
-}
-
-/// \overload
-template<class RandomAccessRange, class Compare>
-inline void pop_heap(const RandomAccessRange& rng, Compare comp_pred)
-{
-    BOOST_RANGE_CONCEPT_ASSERT(( RandomAccessRangeConcept<const RandomAccessRange> ));
-    std::pop_heap(boost::begin(rng), boost::end(rng), comp_pred);
+    return rng;
 }
 
 /// \brief template function make_heap
@@ -101,34 +73,20 @@ inline void pop_heap(const RandomAccessRange& rng, Compare comp_pred)
 /// \pre RandomAccessRange is a model of the RandomAccessRangeConcept
 /// \pre Compare is a model of the BinaryPredicateConcept
 template<class RandomAccessRange>
-inline void make_heap(RandomAccessRange& rng)
+inline RandomAccessRange& make_heap(RandomAccessRange& rng)
 {
     BOOST_RANGE_CONCEPT_ASSERT(( RandomAccessRangeConcept<RandomAccessRange> ));
     std::make_heap(boost::begin(rng), boost::end(rng));
-}
-
-/// \overload
-template<class RandomAccessRange>
-inline void make_heap(const RandomAccessRange& rng)
-{
-    BOOST_RANGE_CONCEPT_ASSERT(( RandomAccessRangeConcept<const RandomAccessRange> ));
-    std::make_heap(boost::begin(rng),boost::end(rng));
+    return rng;
 }
 
 /// \overload
 template<class RandomAccessRange, class Compare>
-inline void make_heap(RandomAccessRange& rng, Compare comp_pred)
+inline RandomAccessRange& make_heap(RandomAccessRange& rng, Compare comp_pred)
 {
     BOOST_RANGE_CONCEPT_ASSERT(( RandomAccessRangeConcept<RandomAccessRange> ));
     std::make_heap(boost::begin(rng), boost::end(rng), comp_pred);
-}
-
-/// \overload
-template<class RandomAccessRange, class Compare>
-inline void make_heap(const RandomAccessRange& rng, Compare comp_pred)
-{
-    BOOST_RANGE_CONCEPT_ASSERT(( RandomAccessRangeConcept<const RandomAccessRange> ));
-    std::make_heap(boost::begin(rng), boost::end(rng), comp_pred);
+    return rng;
 }
 
 /// \brief template function sort_heap
@@ -138,34 +96,20 @@ inline void make_heap(const RandomAccessRange& rng, Compare comp_pred)
 /// \pre RandomAccessRange is a model of the RandomAccessRangeConcept
 /// \pre Compare is a model of the BinaryPredicateConcept
 template<class RandomAccessRange>
-inline void sort_heap(RandomAccessRange& rng)
+inline RandomAccessRange& sort_heap(RandomAccessRange& rng)
 {
     BOOST_RANGE_CONCEPT_ASSERT(( RandomAccessRangeConcept<RandomAccessRange> ));
     std::sort_heap(boost::begin(rng), boost::end(rng));
-}
-
-/// \overload
-template<class RandomAccessRange>
-inline void sort_heap(const RandomAccessRange& rng)
-{
-    BOOST_RANGE_CONCEPT_ASSERT(( RandomAccessRangeConcept<const RandomAccessRange> ));
-    std::sort_heap(boost::begin(rng), boost::end(rng));
+    return rng;
 }
 
 /// \overload
 template<class RandomAccessRange, class Compare>
-inline void sort_heap(RandomAccessRange& rng, Compare comp_pred)
+inline RandomAccessRange& sort_heap(RandomAccessRange& rng, Compare comp_pred)
 {
     BOOST_RANGE_CONCEPT_ASSERT(( RandomAccessRangeConcept<RandomAccessRange> ));
     std::sort_heap(boost::begin(rng), boost::end(rng), comp_pred);
-}
-
-/// \overload
-template<class RandomAccessRange, class Compare>
-inline void sort_heap(const RandomAccessRange& rng, Compare comp_pred)
-{
-    BOOST_RANGE_CONCEPT_ASSERT(( RandomAccessRangeConcept<const RandomAccessRange> ));
-    std::sort_heap(boost::begin(rng), boost::end(rng), comp_pred);
+    return rng;
 }
 
     } // namespace range
diff --git a/include/boost/range/algorithm/nth_element.hpp b/include/boost/range/algorithm/nth_element.hpp
index 3e06baf..a605595 100755
--- a/include/boost/range/algorithm/nth_element.hpp
+++ b/include/boost/range/algorithm/nth_element.hpp
@@ -27,40 +27,44 @@ namespace boost
 /// \pre RandomAccessRange is a model of the RandomAccessRangeConcept
 /// \pre BinaryPredicate is a model of the BinaryPredicateConcept
 template<class RandomAccessRange>
-inline void nth_element(RandomAccessRange& rng,
+inline RandomAccessRange& nth_element(RandomAccessRange& rng,
     BOOST_DEDUCED_TYPENAME range_iterator<RandomAccessRange>::type nth)
 {
     BOOST_RANGE_CONCEPT_ASSERT(( RandomAccessRangeConcept<RandomAccessRange> ));
     std::nth_element(boost::begin(rng), nth, boost::end(rng));
+    return rng;
 }
 
 /// \overload
 template<class RandomAccessRange>
-inline void nth_element(const RandomAccessRange& rng,
+inline const RandomAccessRange& nth_element(const RandomAccessRange& rng,
     BOOST_DEDUCED_TYPENAME range_iterator<const RandomAccessRange>::type nth)
 {
     BOOST_RANGE_CONCEPT_ASSERT(( RandomAccessRangeConcept<const RandomAccessRange> ));
-    std::nth_element(boost::begin(rng),nth,boost::end(rng));
+    std::nth_element(boost::begin(rng), nth, boost::end(rng));
+    return rng;
 }
 
 /// \overload
 template<class RandomAccessRange, class BinaryPredicate>
-inline void nth_element(RandomAccessRange& rng,
+inline RandomAccessRange& nth_element(RandomAccessRange& rng,
     BOOST_DEDUCED_TYPENAME range_iterator<RandomAccessRange>::type nth,
     BinaryPredicate sort_pred)
 {
     BOOST_RANGE_CONCEPT_ASSERT(( RandomAccessRangeConcept<RandomAccessRange> ));
     std::nth_element(boost::begin(rng), nth, boost::end(rng), sort_pred);
+    return rng;
 }
 
 /// \overload
 template<class RandomAccessRange, class BinaryPredicate>
-inline void nth_element(const RandomAccessRange& rng,
+inline const RandomAccessRange& nth_element(const RandomAccessRange& rng,
     BOOST_DEDUCED_TYPENAME range_iterator<const RandomAccessRange>::type nth,
     BinaryPredicate sort_pred)
 {
     BOOST_RANGE_CONCEPT_ASSERT(( RandomAccessRangeConcept<const RandomAccessRange> ));
-    std::nth_element(boost::begin(rng),nth,boost::end(rng), sort_pred);
+    std::nth_element(boost::begin(rng), nth, boost::end(rng), sort_pred);
+    return rng;
 }
 
     } // namespace range
diff --git a/include/boost/range/algorithm/partial_sort.hpp b/include/boost/range/algorithm/partial_sort.hpp
index e38c4be..1797c55 100755
--- a/include/boost/range/algorithm/partial_sort.hpp
+++ b/include/boost/range/algorithm/partial_sort.hpp
@@ -27,41 +27,24 @@ namespace boost
 /// \pre RandomAccessRange is a model of the RandomAccessRangeConcept
 /// \pre BinaryPredicate is a model of the BinaryPredicateConcept
 template<class RandomAccessRange>
-inline void partial_sort(RandomAccessRange& rng,
+inline RandomAccessRange& partial_sort(RandomAccessRange& rng,
     BOOST_DEDUCED_TYPENAME range_iterator<RandomAccessRange>::type middle)
 {
     BOOST_RANGE_CONCEPT_ASSERT(( RandomAccessRangeConcept<RandomAccessRange> ));
     std::partial_sort(boost::begin(rng), middle, boost::end(rng));
-}
-
-/// \overload
-template<class RandomAccessRange>
-inline void partial_sort(const RandomAccessRange& rng,
-    BOOST_DEDUCED_TYPENAME range_iterator<const RandomAccessRange>::type middle)
-{
-    BOOST_RANGE_CONCEPT_ASSERT(( RandomAccessRangeConcept<const RandomAccessRange> ));
-    std::partial_sort(boost::begin(rng), middle, boost::end(rng));
+    return rng;
 }
 
 /// \overload
 template<class RandomAccessRange, class BinaryPredicate>
-inline void partial_sort(RandomAccessRange& rng,
+inline RandomAccessRange& partial_sort(RandomAccessRange& rng,
     BOOST_DEDUCED_TYPENAME range_iterator<RandomAccessRange>::type middle,
     BinaryPredicate sort_pred)
 {
     BOOST_RANGE_CONCEPT_ASSERT(( RandomAccessRangeConcept<RandomAccessRange> ));
     std::partial_sort(boost::begin(rng), middle, boost::end(rng),
                         sort_pred);
-}
-
-/// \overload
-template<class RandomAccessRange, class BinaryPredicate>
-inline void partial_sort(const RandomAccessRange& rng,
-    BOOST_DEDUCED_TYPENAME range_iterator<const RandomAccessRange>::type middle,
-    BinaryPredicate sort_pred)
-{
-    BOOST_RANGE_CONCEPT_ASSERT(( RandomAccessRangeConcept<const RandomAccessRange> ));
-    std::partial_sort(boost::begin(rng), middle, boost::end(rng), sort_pred);
+    return rng;
 }
 
     } // namespace range
diff --git a/include/boost/range/algorithm/partial_sort_copy.hpp b/include/boost/range/algorithm/partial_sort_copy.hpp
index 8cf3510..a2fe761 100755
--- a/include/boost/range/algorithm/partial_sort_copy.hpp
+++ b/include/boost/range/algorithm/partial_sort_copy.hpp
@@ -28,30 +28,24 @@ namespace boost
 /// \pre SinglePassRange is a model of the SinglePassRangeConcept
 /// \pre RandomAccessRange is a model of the Mutable_RandomAccessRangeConcept
 /// \pre BinaryPredicate is a model of the BinaryPredicateConcept
-template<typename SinglePassRange, typename RandomAccessRange>
-inline typename range_iterator<RandomAccessRange>::type
+template<class SinglePassRange, class RandomAccessRange>
+inline BOOST_DEDUCED_TYPENAME range_iterator<RandomAccessRange>::type
 partial_sort_copy(const SinglePassRange& rng1, RandomAccessRange& rng2)
 {
     BOOST_RANGE_CONCEPT_ASSERT((SinglePassRangeConcept<SinglePassRange>));
-    BOOST_RANGE_CONCEPT_ASSERT((WriteableRandomAccessRangeConcept<RandomAccessRange>));
-    BOOST_RANGE_CONCEPT_ASSERT((range_detail::SameTypeConcept<typename range_value<SinglePassRange>::type, typename range_value<RandomAccessRange>::type>));
-    BOOST_RANGE_CONCEPT_ASSERT((LessThanComparableConcept<typename range_value<SinglePassRange>::type>));
 
     return std::partial_sort_copy(boost::begin(rng1), boost::end(rng1),
         boost::begin(rng2), boost::end(rng2));
 }
 
 /// \overload
-template<typename SinglePassRange, typename RandomAccessRange,
-         typename BinaryPredicate>
-inline typename range_iterator<RandomAccessRange>::type
+template<class SinglePassRange, class RandomAccessRange,
+         class BinaryPredicate>
+inline BOOST_DEDUCED_TYPENAME range_iterator<RandomAccessRange>::type
 partial_sort_copy(const SinglePassRange& rng1, RandomAccessRange& rng2,
     BinaryPredicate pred)
 {
     BOOST_RANGE_CONCEPT_ASSERT((SinglePassRangeConcept<SinglePassRange>));
-    BOOST_RANGE_CONCEPT_ASSERT((WriteableRandomAccessRangeConcept<RandomAccessRange>));
-    BOOST_RANGE_CONCEPT_ASSERT((range_detail::SameTypeConcept<typename range_value<SinglePassRange>::type, typename range_value<RandomAccessRange>::type>));
-    BOOST_RANGE_CONCEPT_ASSERT((BinaryPredicateConcept<BinaryPredicate, typename range_value<RandomAccessRange>::type, typename range_value<RandomAccessRange>::type>));
 
     return std::partial_sort_copy(boost::begin(rng1), boost::end(rng1),
         boost::begin(rng2), boost::end(rng2), pred);
diff --git a/include/boost/range/algorithm/partition.hpp b/include/boost/range/algorithm/partition.hpp
index 05f41da..6404918 100755
--- a/include/boost/range/algorithm/partition.hpp
+++ b/include/boost/range/algorithm/partition.hpp
@@ -34,15 +34,6 @@ partition(ForwardRange& rng, UnaryPredicate pred)
     return std::partition(boost::begin(rng),boost::end(rng),pred);
 }
 
-/// \overload
-template<class ForwardRange, class UnaryPredicate>
-inline BOOST_DEDUCED_TYPENAME range_iterator<const ForwardRange>::type
-partition(const ForwardRange& rng, UnaryPredicate pred)
-{
-    BOOST_RANGE_CONCEPT_ASSERT(( ForwardRangeConcept<const ForwardRange> ));
-    return std::partition(boost::begin(rng),boost::end(rng),pred);
-}
-
 // range_return overloads
 
 /// \overload
@@ -56,17 +47,6 @@ partition(ForwardRange& rng, UnaryPredicate pred)
         pack(std::partition(boost::begin(rng), boost::end(rng), pred), rng);
 }
 
-/// \overload
-template< range_return_value re, class ForwardRange,
-          class UnaryPredicate >
-inline BOOST_DEDUCED_TYPENAME range_return<const ForwardRange,re>::type
-partition(const ForwardRange& rng, UnaryPredicate pred)
-{
-    BOOST_RANGE_CONCEPT_ASSERT(( ForwardRangeConcept<const ForwardRange> ));
-    return boost::range_return<const ForwardRange,re>::
-        pack(std::partition(boost::begin(rng), boost::end(rng), pred), rng);
-}
-
     } // namespace range
     using range::partition;
 } // namespace boost
diff --git a/include/boost/range/algorithm/random_shuffle.hpp b/include/boost/range/algorithm/random_shuffle.hpp
index eeae3d7..0b17333 100755
--- a/include/boost/range/algorithm/random_shuffle.hpp
+++ b/include/boost/range/algorithm/random_shuffle.hpp
@@ -34,15 +34,6 @@ inline RandomAccessRange& random_shuffle(RandomAccessRange& rng)
     return rng;
 }
 
-/// \overload
-template<class RandomAccessRange>
-inline const RandomAccessRange& random_shuffle(const RandomAccessRange& rng)
-{
-    BOOST_RANGE_CONCEPT_ASSERT(( RandomAccessRangeConcept<const RandomAccessRange> ));
-    std::random_shuffle(boost::begin(rng),boost::end(rng));
-    return rng;
-}
-
 /// \overload
 template<class RandomAccessRange, class Generator>
 inline RandomAccessRange& random_shuffle(RandomAccessRange& rng, Generator& gen)
@@ -52,15 +43,6 @@ inline RandomAccessRange& random_shuffle(RandomAccessRange& rng, Generator& gen)
     return rng;
 }
 
-/// \overload
-template<class RandomAccessRange, class Generator>
-inline const RandomAccessRange& random_shuffle(const RandomAccessRange& rng, Generator& gen)
-{
-    BOOST_RANGE_CONCEPT_ASSERT(( RandomAccessRangeConcept<const RandomAccessRange> ));
-    std::random_shuffle(boost::begin(rng), boost::end(rng), gen);
-    return rng;
-}
-
     } // namespace range
     using range::random_shuffle;
 } // namespace boost
diff --git a/include/boost/range/algorithm/remove.hpp b/include/boost/range/algorithm/remove.hpp
index 699a7cd..638dff2 100755
--- a/include/boost/range/algorithm/remove.hpp
+++ b/include/boost/range/algorithm/remove.hpp
@@ -34,15 +34,6 @@ remove(ForwardRange& rng, const Value& val)
     return std::remove(boost::begin(rng),boost::end(rng),val);
 }
 
-/// \overload
-template< class ForwardRange, class Value >
-inline BOOST_DEDUCED_TYPENAME range_iterator<const ForwardRange>::type
-remove(const ForwardRange& rng, const Value& val)
-{
-    BOOST_RANGE_CONCEPT_ASSERT(( ForwardRangeConcept<const ForwardRange> ));
-    return std::remove(boost::begin(rng),boost::end(rng),val);
-}
-
 // range_return overloads
 
 /// \overload
@@ -56,17 +47,6 @@ remove(ForwardRange& rng, const Value& val)
         rng);
 }
 
-/// \overload
-template< range_return_value re, class ForwardRange, class Value >
-inline BOOST_DEDUCED_TYPENAME range_return<const ForwardRange,re>::type
-remove(const ForwardRange& rng, const Value& val)
-{
-    BOOST_RANGE_CONCEPT_ASSERT(( ForwardRangeConcept<const ForwardRange> ));
-    return range_return<const ForwardRange,re>::pack(
-        std::remove(boost::begin(rng), boost::end(rng), val),
-        rng);
-}
-
     } // namespace range
     using range::remove;
 } // namespace boost
diff --git a/include/boost/range/algorithm/remove_copy_if.hpp b/include/boost/range/algorithm/remove_copy_if.hpp
index 665b359..791a38f 100755
--- a/include/boost/range/algorithm/remove_copy_if.hpp
+++ b/include/boost/range/algorithm/remove_copy_if.hpp
@@ -31,7 +31,7 @@ namespace boost
     remove_copy_if(SinglePassRange& rng, OutputIterator out_it, Predicate pred)
     {
         boost::function_requires< SinglePassRangeConcept<SinglePassRange> >();
-		return std::remove_copy_if(boost::begin(rng), boost::end(rng), out_it, pred); 
+        return std::remove_copy_if(boost::begin(rng), boost::end(rng), out_it, pred); 
     }
 }
 
diff --git a/include/boost/range/algorithm/remove_if.hpp b/include/boost/range/algorithm/remove_if.hpp
index babcddc..349e7a4 100755
--- a/include/boost/range/algorithm/remove_if.hpp
+++ b/include/boost/range/algorithm/remove_if.hpp
@@ -35,15 +35,6 @@ remove_if(ForwardRange& rng, UnaryPredicate pred)
     return std::remove_if(boost::begin(rng), boost::end(rng), pred);
 }
 
-/// \overload
-template< class ForwardRange, class UnaryPredicate >
-inline BOOST_DEDUCED_TYPENAME boost::range_iterator<const ForwardRange>::type
-remove_if(const ForwardRange& rng, UnaryPredicate pred)
-{
-    BOOST_RANGE_CONCEPT_ASSERT(( ForwardRangeConcept<const ForwardRange> ));
-    return std::remove_if(boost::begin(rng),boost::end(rng),pred);
-}
-
 // range_return overloads
 
 /// \overload
@@ -57,17 +48,6 @@ remove_if(ForwardRange& rng, UnaryPredicate pred)
         rng);
 }
 
-/// \overload
-template< range_return_value re, class ForwardRange, class UnaryPredicate >
-inline BOOST_DEDUCED_TYPENAME range_return<const ForwardRange,re>::type
-remove_if(const ForwardRange& rng, UnaryPredicate pred)
-{
-    BOOST_RANGE_CONCEPT_ASSERT(( ForwardRangeConcept<const ForwardRange> ));
-    return range_return<const ForwardRange,re>::pack(
-        std::remove_if(boost::begin(rng), boost::end(rng), pred),
-        rng);
-}
-
     } // namespace range
     using range::remove_if;
 } // namespace boost
diff --git a/include/boost/range/algorithm/replace.hpp b/include/boost/range/algorithm/replace.hpp
index 44d3e4c..3f2d72c 100755
--- a/include/boost/range/algorithm/replace.hpp
+++ b/include/boost/range/algorithm/replace.hpp
@@ -35,17 +35,6 @@ replace(ForwardRange& rng, const Value& what,
     return rng;
 }
 
-/// \overload
-template< class ForwardRange, class Value >
-inline const ForwardRange&
-replace(const ForwardRange& rng, const Value& what,
-        const Value& with_what)
-{
-    BOOST_RANGE_CONCEPT_ASSERT(( ForwardRangeConcept<const ForwardRange> ));
-    std::replace(boost::begin(rng), boost::end(rng), what, with_what);
-    return rng;
-}
-
     } // namespace range
     using range::replace;
 } // namespace boost;
diff --git a/include/boost/range/algorithm/replace_if.hpp b/include/boost/range/algorithm/replace_if.hpp
index 93d5a1f..393a4ca 100755
--- a/include/boost/range/algorithm/replace_if.hpp
+++ b/include/boost/range/algorithm/replace_if.hpp
@@ -36,17 +36,6 @@ inline ForwardRange&
     return rng;
 }
 
-/// \overload
-template< class ForwardRange, class UnaryPredicate, class Value >
-inline const ForwardRange&
-    replace_if(const ForwardRange& rng, UnaryPredicate pred,
-               const Value& val)
-{
-    BOOST_RANGE_CONCEPT_ASSERT(( ForwardRangeConcept<const ForwardRange> ));
-    std::replace_if(boost::begin(rng), boost::end(rng), pred, val);
-    return rng;
-}
-
     } // namespace range
     using range::replace_if;
 } // namespace boost
diff --git a/include/boost/range/algorithm/reverse.hpp b/include/boost/range/algorithm/reverse.hpp
index 20a7eb1..8741d66 100755
--- a/include/boost/range/algorithm/reverse.hpp
+++ b/include/boost/range/algorithm/reverse.hpp
@@ -34,15 +34,6 @@ inline BidirectionalRange& reverse(BidirectionalRange& rng)
     return rng;
 }
 
-/// \overload
-template<class BidirectionalRange>
-inline const BidirectionalRange& reverse(const BidirectionalRange& rng)
-{
-    BOOST_RANGE_CONCEPT_ASSERT(( BidirectionalRangeConcept<const BidirectionalRange> ));
-    std::reverse(boost::begin(rng), boost::end(rng));
-    return rng;
-}
-
     } // namespace range
     using range::reverse;
 } // namespace boost
diff --git a/include/boost/range/algorithm/reverse_copy.hpp b/include/boost/range/algorithm/reverse_copy.hpp
index 381f157..d86145d 100755
--- a/include/boost/range/algorithm/reverse_copy.hpp
+++ b/include/boost/range/algorithm/reverse_copy.hpp
@@ -26,15 +26,7 @@ namespace boost
 /// range-based version of the reverse_copy std algorithm
 ///
 /// \pre BidirectionalRange is a model of the BidirectionalRangeConcept
-template<typename BidirectionalRange, typename OutputIterator>
-inline OutputIterator reverse_copy(BidirectionalRange& rng, OutputIterator out)
-{
-    BOOST_RANGE_CONCEPT_ASSERT(( BidirectionalRangeConcept<BidirectionalRange> ));
-    return std::reverse_copy(boost::begin(rng), boost::end(rng), out);
-}
-
-/// \overload
-template<typename BidirectionalRange, typename OutputIterator>
+template<class BidirectionalRange, class OutputIterator>
 inline OutputIterator reverse_copy(const BidirectionalRange& rng, OutputIterator out)
 {
     BOOST_RANGE_CONCEPT_ASSERT(( BidirectionalRangeConcept<BidirectionalRange> ));
diff --git a/include/boost/range/algorithm/rotate.hpp b/include/boost/range/algorithm/rotate.hpp
index 2372a00..aef6062 100755
--- a/include/boost/range/algorithm/rotate.hpp
+++ b/include/boost/range/algorithm/rotate.hpp
@@ -25,26 +25,15 @@ namespace boost
 /// range-based version of the rotate std algorithm
 ///
 /// \pre Rng meets the requirements for a Forward range
-template<typename ForwardRange>
+template<class ForwardRange>
 inline ForwardRange& rotate(ForwardRange& rng,
-    typename range_iterator<ForwardRange>::type middle)
+    BOOST_DEDUCED_TYPENAME range_iterator<ForwardRange>::type middle)
 {
     BOOST_RANGE_CONCEPT_ASSERT(( ForwardRangeConcept<ForwardRange> ));
     std::rotate(boost::begin(rng), middle, boost::end(rng));
     return rng;
 }
 
-/// \overload
-template<typename ForwardRange>
-inline const ForwardRange&
-    rotate(const ForwardRange& rng,
-           typename range_iterator<const ForwardRange>::type middle)
-{
-    BOOST_RANGE_CONCEPT_ASSERT(( ForwardRangeConcept<const ForwardRange> ));
-    std::rotate(boost::begin(rng), middle, boost::end(rng));
-    return rng;
-}
-
     } // namespace range
     using range::rotate;
 } // namespace boost
diff --git a/include/boost/range/algorithm/rotate_copy.hpp b/include/boost/range/algorithm/rotate_copy.hpp
index 9030f73..0409ac5 100755
--- a/include/boost/range/algorithm/rotate_copy.hpp
+++ b/include/boost/range/algorithm/rotate_copy.hpp
@@ -28,9 +28,9 @@ namespace boost
     /// \pre Rng meets the requirements for a Forward range
     template<typename ForwardRange, typename OutputIterator>
     inline OutputIterator rotate_copy(
-        const ForwardRange&                                 rng,
-        typename range_iterator<const ForwardRange>::type   middle,
-        OutputIterator                                      target
+        const ForwardRange&                                             rng,
+        BOOST_DEDUCED_TYPENAME range_iterator<const ForwardRange>::type middle,
+        OutputIterator                                                  target
         )
     {
         BOOST_RANGE_CONCEPT_ASSERT(( ForwardRangeConcept<const ForwardRange> ));
diff --git a/include/boost/range/algorithm/search.hpp b/include/boost/range/algorithm/search.hpp
index 45d7ade..28cc6e6 100755
--- a/include/boost/range/algorithm/search.hpp
+++ b/include/boost/range/algorithm/search.hpp
@@ -45,8 +45,8 @@ search(const ForwardRange1& rng1, const ForwardRange2& rng2)
 {
     BOOST_RANGE_CONCEPT_ASSERT(( ForwardRangeConcept<const ForwardRange1> ));
     BOOST_RANGE_CONCEPT_ASSERT(( ForwardRangeConcept<const ForwardRange2> ));
-    return std::search(boost::begin(rng1),boost::end(rng1),
-                       boost::begin(rng2),boost::end(rng2));
+    return std::search(boost::begin(rng1), boost::end(rng1),
+                       boost::begin(rng2), boost::end(rng2));
 }
 
 /// \overload
@@ -63,13 +63,12 @@ search(ForwardRange1& rng1, const ForwardRange2& rng2, BinaryPredicate pred)
 /// \overload
 template< class ForwardRange1, class ForwardRange2, class BinaryPredicate >
 inline BOOST_DEDUCED_TYPENAME range_iterator<const ForwardRange1>::type
-search(const ForwardRange1& rng1, const ForwardRange2& rng2,
-        BinaryPredicate pred)
+search(const ForwardRange1& rng1, const ForwardRange2& rng2, BinaryPredicate pred)
 {
     BOOST_RANGE_CONCEPT_ASSERT(( ForwardRangeConcept<const ForwardRange1> ));
     BOOST_RANGE_CONCEPT_ASSERT(( ForwardRangeConcept<const ForwardRange2> ));
-    return std::search(boost::begin(rng1),boost::end(rng1),
-                       boost::begin(rng2),boost::end(rng2),pred);
+    return std::search(boost::begin(rng1), boost::end(rng1),
+                       boost::begin(rng2), boost::end(rng2), pred);
 }
 
 // range_return overloads
@@ -118,8 +117,7 @@ search(ForwardRange1& rng1, const ForwardRange2& rng2, BinaryPredicate pred)
 template< range_return_value re, class ForwardRange1, class ForwardRange2,
           class BinaryPredicate >
 inline BOOST_DEDUCED_TYPENAME range_return<const ForwardRange1,re>::type
-search(const ForwardRange1& rng1, const ForwardRange2& rng2,
-        BinaryPredicate pred)
+search(const ForwardRange1& rng1, const ForwardRange2& rng2, BinaryPredicate pred)
 {
     BOOST_RANGE_CONCEPT_ASSERT(( ForwardRangeConcept<const ForwardRange1> ));
     BOOST_RANGE_CONCEPT_ASSERT(( ForwardRangeConcept<const ForwardRange2> ));
diff --git a/include/boost/range/algorithm/search_n.hpp b/include/boost/range/algorithm/search_n.hpp
index cd0340b..2ced140 100755
--- a/include/boost/range/algorithm/search_n.hpp
+++ b/include/boost/range/algorithm/search_n.hpp
@@ -31,8 +31,8 @@ namespace boost
 /// \pre Value is a model of the EqualityComparableConcept
 /// \pre ForwardRange's value type is a model of the EqualityComparableConcept
 /// \pre Object's of ForwardRange's value type can be compared for equality with Objects of type Value
-template< typename ForwardRange, typename Integer, typename Value >
-inline typename range_iterator<ForwardRange>::type
+template< class ForwardRange, class Integer, class Value >
+inline BOOST_DEDUCED_TYPENAME range_iterator<ForwardRange>::type
 search_n(ForwardRange& rng, Integer count, const Value& value)
 {
     BOOST_RANGE_CONCEPT_ASSERT((ForwardRangeConcept<ForwardRange>));
@@ -40,8 +40,8 @@ search_n(ForwardRange& rng, Integer count, const Value& value)
 }
 
 /// \overload
-template< typename ForwardRange, typename Integer, typename Value >
-inline typename range_iterator<const ForwardRange>::type
+template< class ForwardRange, class Integer, class Value >
+inline BOOST_DEDUCED_TYPENAME range_iterator<const ForwardRange>::type
 search_n(const ForwardRange& rng, Integer count, const Value& value)
 {
     BOOST_RANGE_CONCEPT_ASSERT((ForwardRangeConcept<ForwardRange>));
@@ -49,29 +49,29 @@ search_n(const ForwardRange& rng, Integer count, const Value& value)
 }
 
 /// \overload
-template< typename ForwardRange, typename Integer, class Value,
-          typename BinaryPredicate >
-inline typename range_iterator<ForwardRange>::type
+template< class ForwardRange, class Integer, class Value,
+          class BinaryPredicate >
+inline BOOST_DEDUCED_TYPENAME range_iterator<ForwardRange>::type
 search_n(ForwardRange& rng, Integer count, const Value& value,
          BinaryPredicate binary_pred)
 {
     BOOST_RANGE_CONCEPT_ASSERT((ForwardRangeConcept<ForwardRange>));
     BOOST_RANGE_CONCEPT_ASSERT((BinaryPredicateConcept<BinaryPredicate,
-        typename range_value<ForwardRange>::type, const Value&>));
+        BOOST_DEDUCED_TYPENAME range_value<ForwardRange>::type, const Value&>));
     return std::search_n(boost::begin(rng), boost::end(rng),
         count, value, binary_pred);
 }
 
 /// \overload
-template< typename ForwardRange, typename Integer, typename Value,
-          typename BinaryPredicate >
-inline typename range_iterator<const ForwardRange>::type
+template< class ForwardRange, class Integer, class Value,
+          class BinaryPredicate >
+inline BOOST_DEDUCED_TYPENAME range_iterator<const ForwardRange>::type
 search_n(const ForwardRange& rng, Integer count, const Value& value,
          BinaryPredicate binary_pred)
 {
     BOOST_RANGE_CONCEPT_ASSERT((ForwardRangeConcept<ForwardRange>));
     BOOST_RANGE_CONCEPT_ASSERT((BinaryPredicateConcept<BinaryPredicate,
-        typename range_value<const ForwardRange>::type, const Value&>));
+        BOOST_DEDUCED_TYPENAME range_value<const ForwardRange>::type, const Value&>));
     return std::search_n(boost::begin(rng), boost::end(rng),
         count, value, binary_pred);
 }
@@ -79,9 +79,9 @@ search_n(const ForwardRange& rng, Integer count, const Value& value,
 // range_return overloads
 
 /// \overload
-template< range_return_value re, typename ForwardRange, typename Integer,
-          typename Value >
-inline typename range_return<ForwardRange,re>::type
+template< range_return_value re, class ForwardRange, class Integer,
+          class Value >
+inline BOOST_DEDUCED_TYPENAME range_return<ForwardRange,re>::type
 search_n(ForwardRange& rng, Integer count, const Value& value)
 {
     BOOST_RANGE_CONCEPT_ASSERT((ForwardRangeConcept<ForwardRange>));
@@ -92,9 +92,9 @@ search_n(ForwardRange& rng, Integer count, const Value& value)
 }
 
 /// \overload
-template< range_return_value re, typename ForwardRange, typename Integer,
+template< range_return_value re, class ForwardRange, class Integer,
           class Value >
-inline typename range_return<const ForwardRange,re>::type
+inline BOOST_DEDUCED_TYPENAME range_return<const ForwardRange,re>::type
 search_n(const ForwardRange& rng, Integer count, const Value& value)
 {
     BOOST_RANGE_CONCEPT_ASSERT((ForwardRangeConcept<ForwardRange>));
@@ -105,15 +105,15 @@ search_n(const ForwardRange& rng, Integer count, const Value& value)
 }
 
 /// \overload
-template< range_return_value re, typename ForwardRange, typename Integer,
-          typename Value, typename BinaryPredicate >
-inline typename range_return<ForwardRange,re>::type
+template< range_return_value re, class ForwardRange, class Integer,
+          class Value, class BinaryPredicate >
+inline BOOST_DEDUCED_TYPENAME range_return<ForwardRange,re>::type
 search_n(ForwardRange& rng, Integer count, const Value& value,
          BinaryPredicate pred)
 {
     BOOST_RANGE_CONCEPT_ASSERT((ForwardRangeConcept<ForwardRange>));
     BOOST_RANGE_CONCEPT_ASSERT((BinaryPredicateConcept<BinaryPredicate,
-        typename range_value<ForwardRange>::type,
+        BOOST_DEDUCED_TYPENAME range_value<ForwardRange>::type,
         const Value&>));
     return range_return<ForwardRange,re>::
         pack(std::search_n(boost::begin(rng), boost::end(rng),
@@ -122,15 +122,15 @@ search_n(ForwardRange& rng, Integer count, const Value& value,
 }
 
 /// \overload
-template< range_return_value re, typename ForwardRange, typename Integer,
-          typename Value, typename BinaryPredicate >
-inline typename range_return<const ForwardRange,re>::type
+template< range_return_value re, class ForwardRange, class Integer,
+          class Value, class BinaryPredicate >
+inline BOOST_DEDUCED_TYPENAME range_return<const ForwardRange,re>::type
 search_n(const ForwardRange& rng, Integer count, const Value& value,
          BinaryPredicate pred)
 {
     BOOST_RANGE_CONCEPT_ASSERT((ForwardRangeConcept<ForwardRange>));
     BOOST_RANGE_CONCEPT_ASSERT((BinaryPredicateConcept<BinaryPredicate,
-        typename range_value<const ForwardRange>::type,
+        BOOST_DEDUCED_TYPENAME range_value<const ForwardRange>::type,
         const Value&>));
     return range_return<const ForwardRange,re>::
         pack(std::search_n(boost::begin(rng), boost::end(rng),
diff --git a/include/boost/range/algorithm/sort.hpp b/include/boost/range/algorithm/sort.hpp
index a160907..0c6e3b2 100755
--- a/include/boost/range/algorithm/sort.hpp
+++ b/include/boost/range/algorithm/sort.hpp
@@ -34,15 +34,6 @@ inline RandomAccessRange& sort(RandomAccessRange& rng)
     return rng;
 }
 
-/// \overload
-template<class RandomAccessRange>
-inline const RandomAccessRange& sort(const RandomAccessRange& rng)
-{
-    BOOST_RANGE_CONCEPT_ASSERT(( RandomAccessRangeConcept<const RandomAccessRange> ));
-    std::sort(boost::begin(rng),boost::end(rng));
-    return rng;
-}
-
 /// \overload
 template<class RandomAccessRange, class BinaryPredicate>
 inline RandomAccessRange& sort(RandomAccessRange& rng, BinaryPredicate pred)
@@ -52,15 +43,6 @@ inline RandomAccessRange& sort(RandomAccessRange& rng, BinaryPredicate pred)
     return rng;
 }
 
-/// \overload
-template<class RandomAccessRange, class BinaryPredicate>
-inline const RandomAccessRange& sort(const RandomAccessRange& rng, BinaryPredicate pred)
-{
-    BOOST_RANGE_CONCEPT_ASSERT(( RandomAccessRangeConcept<const RandomAccessRange> ));
-    std::sort(boost::begin(rng), boost::end(rng), pred);
-    return rng;
-}
-
     } // namespace range
     using range::sort;
 } // namespace boost
diff --git a/include/boost/range/algorithm/stable_sort.hpp b/include/boost/range/algorithm/stable_sort.hpp
index d18da4d..6a27aa4 100755
--- a/include/boost/range/algorithm/stable_sort.hpp
+++ b/include/boost/range/algorithm/stable_sort.hpp
@@ -34,15 +34,6 @@ inline RandomAccessRange& stable_sort(RandomAccessRange& rng)
     return rng;
 }
 
-/// \overload
-template<class RandomAccessRange>
-inline const RandomAccessRange& stable_sort(const RandomAccessRange& rng)
-{
-    BOOST_RANGE_CONCEPT_ASSERT(( RandomAccessRangeConcept<const RandomAccessRange> ));
-    std::stable_sort(boost::begin(rng), boost::end(rng));
-    return rng;
-}
-
 /// \overload
 template<class RandomAccessRange, class BinaryPredicate>
 inline RandomAccessRange& stable_sort(RandomAccessRange& rng, BinaryPredicate sort_pred)
@@ -52,15 +43,6 @@ inline RandomAccessRange& stable_sort(RandomAccessRange& rng, BinaryPredicate so
     return rng;
 }
 
-/// \overload
-template<class RandomAccessRange, class BinaryPredicate>
-inline const RandomAccessRange& stable_sort(const RandomAccessRange& rng, BinaryPredicate sort_pred)
-{
-    BOOST_RANGE_CONCEPT_ASSERT(( RandomAccessRangeConcept<const RandomAccessRange> ));
-    std::stable_sort(boost::begin(rng), boost::end(rng), sort_pred);
-    return rng;
-}
-
     } // namespace range
     using range::stable_sort;
 } // namespace boost
diff --git a/include/boost/range/algorithm/swap_ranges.hpp b/include/boost/range/algorithm/swap_ranges.hpp
index 1acee0d..5b8967a 100755
--- a/include/boost/range/algorithm/swap_ranges.hpp
+++ b/include/boost/range/algorithm/swap_ranges.hpp
@@ -22,7 +22,7 @@ namespace boost
 {
     namespace range_detail
     {
-        template<typename Iterator1, typename Iterator2>
+        template<class Iterator1, class Iterator2>
         void swap_ranges_impl(Iterator1 it1, Iterator1 last1,
                               Iterator2 it2, Iterator2 last2,
                               single_pass_traversal_tag,
@@ -36,7 +36,7 @@ namespace boost
             }
         }
 
-        template<typename Iterator1, typename Iterator2>
+        template<class Iterator1, class Iterator2>
         void swap_ranges_impl(Iterator1 it1, Iterator1 last1,
                               Iterator2 it2, Iterator2 last2,
                               random_access_traversal_tag,
@@ -47,13 +47,13 @@ namespace boost
             std::swap_ranges(it1, last1, it2);
         }
 
-        template<typename Iterator1, typename Iterator2>
+        template<class Iterator1, class Iterator2>
         void swap_ranges_impl(Iterator1 first1, Iterator1 last1,
                               Iterator2 first2, Iterator2 last2)
         {
             swap_ranges_impl(first1, last1, first2, last2,
-                typename iterator_traversal<Iterator1>::type(),
-                typename iterator_traversal<Iterator2>::type());
+                BOOST_DEDUCED_TYPENAME iterator_traversal<Iterator1>::type(),
+                BOOST_DEDUCED_TYPENAME iterator_traversal<Iterator2>::type());
         }
     } // namespace range_detail
 
@@ -66,7 +66,7 @@ namespace boost
 ///
 /// \pre SinglePassRange1 is a model of the SinglePassRangeConcept
 /// \pre SinglePassRange2 is a model of the SinglePassRangeConcept
-template< typename SinglePassRange1, typename SinglePassRange2 >
+template< class SinglePassRange1, class SinglePassRange2 >
 inline SinglePassRange2&
 swap_ranges(SinglePassRange1& range1, SinglePassRange2& range2)
 {
diff --git a/include/boost/range/algorithm_ext/for_each.hpp b/include/boost/range/algorithm_ext/for_each.hpp
index 6a3b35c..a470e2b 100755
--- a/include/boost/range/algorithm_ext/for_each.hpp
+++ b/include/boost/range/algorithm_ext/for_each.hpp
@@ -19,55 +19,55 @@
 
 namespace boost
 {
-	namespace range_detail
-	{
-		template<class InputIterator1, class InputIterator2, class Fn2>
-		inline Fn2 for_each_impl(InputIterator1 first1, InputIterator1 last1,
-								 InputIterator2 first2, InputIterator2 last2,
-								 Fn2 fn)
-		{
-			for (; first1 != last1 && first2 != last2; ++first1, ++first2)
-			{
-				fn(*first1, *first2);
-			}
-			return fn;
-		}
-	}
+    namespace range_detail
+    {
+        template<class InputIterator1, class InputIterator2, class Fn2>
+        inline Fn2 for_each_impl(InputIterator1 first1, InputIterator1 last1,
+                                 InputIterator2 first2, InputIterator2 last2,
+                                 Fn2 fn)
+        {
+            for (; first1 != last1 && first2 != last2; ++first1, ++first2)
+            {
+                fn(*first1, *first2);
+            }
+            return fn;
+        }
+    }
 
-	namespace range
-	{
-	    template<class SinglePassRange1, class SinglePassRange2, class Fn2>
-	    inline Fn2 for_each(const SinglePassRange1& rng1, const SinglePassRange2& rng2, Fn2 fn)
-	    {
-	        BOOST_RANGE_CONCEPT_ASSERT(( SinglePassRangeConcept<const SinglePassRange1> ));
-	        BOOST_RANGE_CONCEPT_ASSERT(( SinglePassRangeConcept<const SinglePassRange2> ));
+    namespace range
+    {
+        template<class SinglePassRange1, class SinglePassRange2, class Fn2>
+        inline Fn2 for_each(const SinglePassRange1& rng1, const SinglePassRange2& rng2, Fn2 fn)
+        {
+            BOOST_RANGE_CONCEPT_ASSERT(( SinglePassRangeConcept<const SinglePassRange1> ));
+            BOOST_RANGE_CONCEPT_ASSERT(( SinglePassRangeConcept<const SinglePassRange2> ));
 
-	        return ::boost::range_detail::for_each_impl(
+            return ::boost::range_detail::for_each_impl(
                 ::boost::begin(rng1), ::boost::end(rng1),
                 ::boost::begin(rng2), ::boost::end(rng2), fn);
-	    }
+        }
 
-	    template<class SinglePassRange1, class SinglePassRange2, class Fn2>
-	    inline Fn2 for_each(const SinglePassRange1& rng1, SinglePassRange2& rng2, Fn2 fn)
-	    {
-	        BOOST_RANGE_CONCEPT_ASSERT(( SinglePassRangeConcept<const SinglePassRange1> ));
-	        BOOST_RANGE_CONCEPT_ASSERT(( SinglePassRangeConcept<SinglePassRange2> ));
+        template<class SinglePassRange1, class SinglePassRange2, class Fn2>
+        inline Fn2 for_each(const SinglePassRange1& rng1, SinglePassRange2& rng2, Fn2 fn)
+        {
+            BOOST_RANGE_CONCEPT_ASSERT(( SinglePassRangeConcept<const SinglePassRange1> ));
+            BOOST_RANGE_CONCEPT_ASSERT(( SinglePassRangeConcept<SinglePassRange2> ));
 
-	        return ::boost::range_detail::for_each_impl(
+            return ::boost::range_detail::for_each_impl(
                 ::boost::begin(rng1), ::boost::end(rng1),
                 ::boost::begin(rng2), ::boost::end(rng2), fn);
-	    }
+        }
 
-	    template<class SinglePassRange1, class SinglePassRange2, class Fn2>
-	    inline Fn2 for_each(SinglePassRange1& rng1, const SinglePassRange2& rng2, Fn2 fn)
-	    {
-	        BOOST_RANGE_CONCEPT_ASSERT(( SinglePassRangeConcept<SinglePassRange1> ));
-	        BOOST_RANGE_CONCEPT_ASSERT(( SinglePassRangeConcept<const SinglePassRange2> ));
+        template<class SinglePassRange1, class SinglePassRange2, class Fn2>
+        inline Fn2 for_each(SinglePassRange1& rng1, const SinglePassRange2& rng2, Fn2 fn)
+        {
+            BOOST_RANGE_CONCEPT_ASSERT(( SinglePassRangeConcept<SinglePassRange1> ));
+            BOOST_RANGE_CONCEPT_ASSERT(( SinglePassRangeConcept<const SinglePassRange2> ));
 
-	        return ::boost::range_detail::for_each_impl(
+            return ::boost::range_detail::for_each_impl(
                 ::boost::begin(rng1), ::boost::end(rng1),
                 ::boost::begin(rng2), ::boost::end(rng2), fn);
-	    }
+        }
 
         template<class SinglePassRange1, class SinglePassRange2, class Fn2>
         inline Fn2 for_each(SinglePassRange1& rng1, SinglePassRange2& rng2, Fn2 fn)
@@ -79,8 +79,8 @@ namespace boost
                 ::boost::begin(rng1), ::boost::end(rng1),
                 ::boost::begin(rng2), ::boost::end(rng2), fn);
         }
-	} // namespace range
-	using range::for_each;
+    } // namespace range
+    using range::for_each;
 } // namespace boost
 
 #endif // include guard
diff --git a/include/boost/range/counting_range.hpp b/include/boost/range/counting_range.hpp
index c1ca5ec..bf22f7c 100755
--- a/include/boost/range/counting_range.hpp
+++ b/include/boost/range/counting_range.hpp
@@ -25,41 +25,41 @@
 namespace boost
 {
 
-	template<class Value>
-	inline iterator_range<counting_iterator<Value> >
-	counting_range(Value first, Value last)
-	{
-		typedef counting_iterator<Value> counting_iterator_t;
-		typedef iterator_range<counting_iterator_t> result_t;
-		return result_t(counting_iterator_t(first),
-						counting_iterator_t(last));
-	}
+    template<class Value>
+    inline iterator_range<counting_iterator<Value> >
+    counting_range(Value first, Value last)
+    {
+        typedef counting_iterator<Value> counting_iterator_t;
+        typedef iterator_range<counting_iterator_t> result_t;
+        return result_t(counting_iterator_t(first),
+                        counting_iterator_t(last));
+    }
 
-	template<class Range>
-	inline iterator_range<counting_iterator<BOOST_DEDUCED_TYPENAME range_value<const Range>::type> >
-	counting_range(const Range& rng)
-	{
-		typedef counting_iterator<BOOST_DEDUCED_TYPENAME range_value<const Range>::type> counting_iterator_t;
-		typedef iterator_range<counting_iterator_t> result_t;
-		return boost::empty(rng)
-			? result_t()
-			: result_t(
+    template<class Range>
+    inline iterator_range<counting_iterator<BOOST_DEDUCED_TYPENAME range_value<const Range>::type> >
+    counting_range(const Range& rng)
+    {
+        typedef counting_iterator<BOOST_DEDUCED_TYPENAME range_value<const Range>::type> counting_iterator_t;
+        typedef iterator_range<counting_iterator_t> result_t;
+        return boost::empty(rng)
+            ? result_t()
+            : result_t(
                 counting_iterator_t(*boost::begin(rng)),
                 counting_iterator_t(*boost::prior(boost::end(rng))));
-	}
+    }
 
-	template<class Range>
-	inline iterator_range<counting_iterator<BOOST_DEDUCED_TYPENAME range_value<Range>::type> >
-	counting_range(Range& rng)
-	{
-		typedef counting_iterator<BOOST_DEDUCED_TYPENAME range_value<Range>::type> counting_iterator_t;
-		typedef iterator_range<counting_iterator_t> result_t;
-		return boost::empty(rng)
-			? result_t()
-			: result_t(
+    template<class Range>
+    inline iterator_range<counting_iterator<BOOST_DEDUCED_TYPENAME range_value<Range>::type> >
+    counting_range(Range& rng)
+    {
+        typedef counting_iterator<BOOST_DEDUCED_TYPENAME range_value<Range>::type> counting_iterator_t;
+        typedef iterator_range<counting_iterator_t> result_t;
+        return boost::empty(rng)
+            ? result_t()
+            : result_t(
                 counting_iterator_t(*boost::begin(rng)),
                 counting_iterator_t(*boost::prior(boost::end(rng))));
-	}
+    }
 } // namespace boost
 
 #if BOOST_MSVC >= 1400
diff --git a/include/boost/range/detail/demote_iterator_traversal_tag.hpp b/include/boost/range/detail/demote_iterator_traversal_tag.hpp
index 4351c85..5d77678 100755
--- a/include/boost/range/detail/demote_iterator_traversal_tag.hpp
+++ b/include/boost/range/detail/demote_iterator_traversal_tag.hpp
@@ -15,8 +15,8 @@
 
 namespace boost
 {
-	namespace range_detail
-	{
+    namespace range_detail
+    {
 
 template<class IteratorTraversalTag1, class IteratorTraversalTag2>
 struct demote_iterator_traversal_tag
@@ -26,7 +26,7 @@ struct demote_iterator_traversal_tag
 #define BOOST_DEMOTE_TRAVERSAL_TAG( Tag1, Tag2, ResultTag ) \
 template<> struct demote_iterator_traversal_tag< Tag1 , Tag2 > \
 { \
-	typedef ResultTag type; \
+    typedef ResultTag type; \
 };
 
 BOOST_DEMOTE_TRAVERSAL_TAG( no_traversal_tag, no_traversal_tag,            no_traversal_tag )
@@ -73,7 +73,7 @@ BOOST_DEMOTE_TRAVERSAL_TAG( random_access_traversal_tag, random_access_traversal
 
 #undef BOOST_DEMOTE_TRAVERSAL_TAG
 
-	} // namespace range_detail
+    } // namespace range_detail
 } // namespace boost
 
 #endif // include guard
diff --git a/include/boost/range/istream_range.hpp b/include/boost/range/istream_range.hpp
index fac17a4..f0e9ef4 100755
--- a/include/boost/range/istream_range.hpp
+++ b/include/boost/range/istream_range.hpp
@@ -16,19 +16,24 @@
  */
 
 #include <iterator>
+#include <istream>
 #include <boost/config.hpp>
-#include <boost/range/range.hpp>
+#include <boost/range/iterator_range.hpp>
 
 namespace boost
 {
-	template<class Type, class Elem, class Traits> inline
-		range<std::istream_iterator<Type, Elem, Traits> >
-	istream_range(std::basic_istream<Elem, Traits>& in)
-	{
-		return range<std::istream_iterator<Type, Elem, Traits> >(
-			std::istream_iterator<Type>(in),
-			std::istream_iterator<Type>());
-	}
+    namespace range
+    {
+        template<class Type, class Elem, class Traits> inline
+            iterator_range<std::istream_iterator<Type, Elem, Traits> >
+        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>());
+        }
+    } // namespace range
+    using range::istream_range;
 } // namespace boost
 
 #endif // include guard
diff --git a/include/boost/range/join.hpp b/include/boost/range/join.hpp
index 374df86..518026c 100644
--- a/include/boost/range/join.hpp
+++ b/include/boost/range/join.hpp
@@ -21,46 +21,46 @@ namespace boost
 
 template<class SinglePassRange1, class SinglePassRange2>
 iterator_range<range_detail::join_iterator<
-	BOOST_DEDUCED_TYPENAME range_iterator<const SinglePassRange1>::type,
-	BOOST_DEDUCED_TYPENAME range_iterator<const SinglePassRange2>::type,
-	BOOST_DEDUCED_TYPENAME add_const<
-		BOOST_DEDUCED_TYPENAME range_value<const SinglePassRange1>::type>::type>
+    BOOST_DEDUCED_TYPENAME range_iterator<const SinglePassRange1>::type,
+    BOOST_DEDUCED_TYPENAME range_iterator<const SinglePassRange2>::type,
+    BOOST_DEDUCED_TYPENAME add_const<
+        BOOST_DEDUCED_TYPENAME range_value<const SinglePassRange1>::type>::type>
 >
 join(const SinglePassRange1& r1, const SinglePassRange2& r2)
 {
     BOOST_RANGE_CONCEPT_ASSERT(( SinglePassRangeConcept<SinglePassRange1> ));
     BOOST_RANGE_CONCEPT_ASSERT(( SinglePassRangeConcept<SinglePassRange2> ));
 
-	typedef range_detail::join_iterator<
-				BOOST_DEDUCED_TYPENAME range_iterator<const SinglePassRange1>::type,
-				BOOST_DEDUCED_TYPENAME range_iterator<const SinglePassRange2>::type,
-				BOOST_DEDUCED_TYPENAME add_const<
-					BOOST_DEDUCED_TYPENAME range_value<const SinglePassRange1>::type>::type> iterator_t;
+    typedef range_detail::join_iterator<
+                BOOST_DEDUCED_TYPENAME range_iterator<const SinglePassRange1>::type,
+                BOOST_DEDUCED_TYPENAME range_iterator<const SinglePassRange2>::type,
+                BOOST_DEDUCED_TYPENAME add_const<
+                    BOOST_DEDUCED_TYPENAME range_value<const SinglePassRange1>::type>::type> iterator_t;
 
-	return iterator_range<iterator_t>(
-		iterator_t(r1, r2, range_detail::join_iterator_begin_tag()),
-		iterator_t(r1, r2, range_detail::join_iterator_end_tag()));
+    return iterator_range<iterator_t>(
+        iterator_t(r1, r2, range_detail::join_iterator_begin_tag()),
+        iterator_t(r1, r2, range_detail::join_iterator_end_tag()));
 }
 
 template<class SinglePassRange1, class SinglePassRange2>
 iterator_range<range_detail::join_iterator<
-	BOOST_DEDUCED_TYPENAME range_iterator<SinglePassRange1>::type,
-	BOOST_DEDUCED_TYPENAME range_iterator<SinglePassRange2>::type,
-	BOOST_DEDUCED_TYPENAME range_value<SinglePassRange1>::type>
+    BOOST_DEDUCED_TYPENAME range_iterator<SinglePassRange1>::type,
+    BOOST_DEDUCED_TYPENAME range_iterator<SinglePassRange2>::type,
+    BOOST_DEDUCED_TYPENAME range_value<SinglePassRange1>::type>
 >
 join(SinglePassRange1& r1, SinglePassRange2& r2)
 {
     BOOST_RANGE_CONCEPT_ASSERT(( SinglePassRangeConcept<SinglePassRange1> ));
     BOOST_RANGE_CONCEPT_ASSERT(( SinglePassRangeConcept<SinglePassRange2> ));
 
-	typedef range_detail::join_iterator<
-		BOOST_DEDUCED_TYPENAME range_iterator<SinglePassRange1>::type,
-		BOOST_DEDUCED_TYPENAME range_iterator<SinglePassRange2>::type,
-		BOOST_DEDUCED_TYPENAME range_value<SinglePassRange1>::type> iterator_t;
+    typedef range_detail::join_iterator<
+        BOOST_DEDUCED_TYPENAME range_iterator<SinglePassRange1>::type,
+        BOOST_DEDUCED_TYPENAME range_iterator<SinglePassRange2>::type,
+        BOOST_DEDUCED_TYPENAME range_value<SinglePassRange1>::type> iterator_t;
 
-	return iterator_range<iterator_t>(
-		iterator_t(r1, r2, range_detail::join_iterator_begin_tag()),
-		iterator_t(r1, r2, range_detail::join_iterator_end_tag()));
+    return iterator_range<iterator_t>(
+        iterator_t(r1, r2, range_detail::join_iterator_begin_tag()),
+        iterator_t(r1, r2, range_detail::join_iterator_end_tag()));
 }
 
 } // namespace boost
diff --git a/include/boost/range/numeric.hpp b/include/boost/range/numeric.hpp
index 17e2cfe..0a76151 100755
--- a/include/boost/range/numeric.hpp
+++ b/include/boost/range/numeric.hpp
@@ -20,7 +20,7 @@
 // http://www.boost.org/LICENSE_1_0.txt)
 
 #if defined(_MSC_VER) && _MSC_VER >= 1000
-	#pragma once
+    #pragma once
 #endif
 
 #ifndef BOOST_RANGE_NUMERIC_HPP
@@ -36,82 +36,82 @@
 
 namespace boost
 {
-	template< class SinglePassRange, class Value >
-	inline Value accumulate( const SinglePassRange& rng, Value init )
-	{
+    template< class SinglePassRange, class Value >
+    inline Value accumulate( const SinglePassRange& rng, Value init )
+    {
         boost::function_requires< SinglePassRangeConcept<SinglePassRange> >();
-		return std::accumulate( boost::begin(rng), boost::end(rng), init );
-	}
+        return std::accumulate( boost::begin(rng), boost::end(rng), init );
+    }
 
-	template< class SinglePassRange, class Value, class BinaryOperation >
-	inline Value accumulate( const SinglePassRange& rng, Value init, BinaryOperation op )
-	{
+    template< class SinglePassRange, class Value, class BinaryOperation >
+    inline Value accumulate( const SinglePassRange& rng, Value init, BinaryOperation op )
+    {
         boost::function_requires< SinglePassRangeConcept<SinglePassRange> >();
-		return std::accumulate( boost::begin(rng), boost::end(rng), init, op );
-	}
+        return std::accumulate( boost::begin(rng), boost::end(rng), init, op );
+    }
 
 
-	template< class SinglePassRange1, class SinglePassRange2, class Value >
-	inline Value inner_product( const SinglePassRange1& rng1, const SinglePassRange2& rng2, Value init )
-	{
+    template< class SinglePassRange1, class SinglePassRange2, class Value >
+    inline Value inner_product( const SinglePassRange1& rng1, const SinglePassRange2& rng2, Value init )
+    {
         boost::function_requires< SinglePassRangeConcept<SinglePassRange1> >();
         boost::function_requires< SinglePassRangeConcept<SinglePassRange2> >();
         BOOST_ASSERT( boost::distance(rng2) >= boost::distance(rng1) );
-		return std::inner_product( boost::begin(rng1), boost::end(rng1), 
+        return std::inner_product( boost::begin(rng1), boost::end(rng1), 
             boost::begin(rng2), init ); 
-	}
+    }
 
-	template< class SinglePassRange1,
+    template< class SinglePassRange1,
               class SinglePassRange2,
               class Value, 
-		      class BinaryOperation1, class BinaryOperation2 >
-	inline Value inner_product( const SinglePassRange1& rng1, const SinglePassRange2& rng2,
+              class BinaryOperation1, class BinaryOperation2 >
+    inline Value inner_product( const SinglePassRange1& rng1, const SinglePassRange2& rng2,
                                 Value init, 
-							    BinaryOperation1 op1, BinaryOperation2 op2 )
-	{
+                                BinaryOperation1 op1, BinaryOperation2 op2 )
+    {
         boost::function_requires< SinglePassRangeConcept<SinglePassRange1> >();
         boost::function_requires< SinglePassRangeConcept<SinglePassRange2> >();
         BOOST_ASSERT( boost::distance(rng2) >= boost::distance(rng1) );
 
-		return std::inner_product( boost::begin(rng1), boost::end(rng1), 
+        return std::inner_product( boost::begin(rng1), boost::end(rng1), 
                                    boost::begin(rng2), init, op1, op2 ); 
-	}
+    }
 
-	template< class SinglePassRange, class OutputIterator >
-	inline OutputIterator partial_sum ( const SinglePassRange& rng, 
-										OutputIterator result )
-	{
+    template< class SinglePassRange, class OutputIterator >
+    inline OutputIterator partial_sum ( const SinglePassRange& rng, 
+                                        OutputIterator result )
+    {
         boost::function_requires< SinglePassRangeConcept<SinglePassRange> >();
-		return std::partial_sum( boost::begin(rng), boost::end(rng), result );
-	}
+        return std::partial_sum( boost::begin(rng), boost::end(rng), result );
+    }
 
-	template< class SinglePassRange, class OutputIterator, class BinaryOperation >
-	inline OutputIterator partial_sum ( const SinglePassRange& rng, OutputIterator result, 
-										BinaryOperation op )
-	{
+    template< class SinglePassRange, class OutputIterator, class BinaryOperation >
+    inline OutputIterator partial_sum ( const SinglePassRange& rng, OutputIterator result, 
+                                        BinaryOperation op )
+    {
         boost::function_requires< SinglePassRangeConcept<SinglePassRange> >();
-		return std::partial_sum( boost::begin(rng), boost::end(rng), result, op );
-	}
+        return std::partial_sum( boost::begin(rng), boost::end(rng), result, op );
+    }
 
-	template< class SinglePassRange, class OutputIterator >
-	inline OutputIterator adjacent_difference ( const SinglePassRange& rng,
-												OutputIterator result )
-	{
+    template< class SinglePassRange, class OutputIterator >
+    inline OutputIterator adjacent_difference ( const SinglePassRange& rng,
+                                                OutputIterator result )
+    {
         boost::function_requires< SinglePassRangeConcept<SinglePassRange> >();
-		return std::adjacent_difference( boost::begin(rng), boost::end(rng), 
-										 result );
-	}
+        return std::adjacent_difference( boost::begin(rng), boost::end(rng), 
+                                         result );
+    }
 
-	template< class SinglePassRange, class OutputIterator, class BinaryOperation >
-	inline OutputIterator adjacent_difference ( const SinglePassRange& rng,
-												OutputIterator result,
-												BinaryOperation op )
-	{
+    template< class SinglePassRange, class OutputIterator, class BinaryOperation >
+    inline OutputIterator adjacent_difference ( const SinglePassRange& rng,
+                                                OutputIterator result,
+                                                BinaryOperation op )
+    {
         boost::function_requires< SinglePassRangeConcept<SinglePassRange> >();
-		return std::adjacent_difference( boost::begin(rng), boost::end(rng), 
-										 result, op );
-	}
-	
+        return std::adjacent_difference( boost::begin(rng), boost::end(rng), 
+                                         result, op );
+    }
+    
 }
 
 #endif
diff --git a/include/boost/range/size_type.hpp b/include/boost/range/size_type.hpp
index 9993d55..8c184f8 100644
--- a/include/boost/range/size_type.hpp
+++ b/include/boost/range/size_type.hpp
@@ -68,7 +68,7 @@ namespace boost
 
     template< class T >
     struct range_size<const T >
-		: detail::range_size<T>
+        : detail::range_size<T>
     { };
     
 } // namespace boost
diff --git a/include/boost/range/unbounded_range.hpp b/include/boost/range/unbounded_range.hpp
deleted file mode 100755
index 570a0a4..0000000
--- a/include/boost/range/unbounded_range.hpp
+++ /dev/null
@@ -1,73 +0,0 @@
-#ifndef BOOST_RANGE_UNBOUNDED_RANGE_HPP
-#define BOOST_RANGE_UNBOUNDED_RANGE_HPP
-
-#include <boost/range/iterator_range.hpp>
-#include <boost/config.hpp>
-
-namespace boost
-{
-    template< class Iter >
-    struct unbounded_iterator_range : iterator_range<Iter>
-    {
-        explicit unbounded_iterator_range( Iter r ) 
-          : iterator_range<Iter>( r, r ) 
-        {
-            //
-            // Remark: by storing the same iterator
-            // twice, we can still allow
-            // comparison to execute without leading to
-            // operations on singular iterators 
-            //
-        }
-        
-    private:
-
-        bool empty() const
-        {
-            return false;
-        }
-        //
-        // Hide members that are illegal to use.
-        //
-        /*
-        void end() const;
-        void size() const;
-        void empty() const;
-        void equal() const;
-        operator bool() const;
-        bool operator==( unbounded_iterator_range );
-        bool operator!=( unbounded_iterator_range );
-        template< class S >
-        void operator[]( S s ) const;
-        template< class D >
-        void advance_end( D d ) const;
-        void back() const;
-        */
-    };
-
-    template< class Iter >
-    inline unbounded_iterator_range<Iter> unbounded_range( Iter r )
-    {
-        return unbounded_iterator_range<Iter>(r);
-    }
-
-    namespace detail
-    {
-        char is_unbounded_range( ... );
-        template< class Iter >
-        long is_unbounded_range( const unbounded_iterator_range<Iter>* );
-    }
-
-    template< class T >
-    struct is_unbounded_range
-    {
-    private:
-        static T* ptr_;
-        
-    public:
-        BOOST_STATIC_CONSTANT( bool, 
-              value = sizeof(long) == sizeof(detail::is_unbounded_range(ptr_) ) ); 
-    };
-}
-
-#endif
diff --git a/test/Jamfile.v2 b/test/Jamfile.v2
index 97600d5..2b2466f 100644
--- a/test/Jamfile.v2
+++ b/test/Jamfile.v2
@@ -42,6 +42,7 @@ test-suite range :
 	[ range-test adaptor_test/reversed ]
 	[ range-test adaptor_test/sliced ]
 	[ range-test adaptor_test/strided ]
+	[ range-test adaptor_test/strided2 ]
 	[ range-test adaptor_test/tokenized ]
 	[ range-test adaptor_test/transformed ]
 	[ range-test adaptor_test/uniqued ]
@@ -128,11 +129,13 @@ test-suite range :
 	[ range-test counting_range ]
 	[ range-test extension_mechanism ]
 	[ range-test irange ]
+	[ range-test istream_range ]
 	[ range-test iterator_pair ]
 	[ range-test iterator_range ]
 #   	[ range-test mfc : <include>$(VC71_ROOT)/atlmfc/include ]
     [ range-test join ]
 	[ range-test partial_workaround ]
+	[ range-test pointer_as_iterator ]
 	[ range-test reversible_range ]
 	[ range-test std_container ]
 	[ range-test string ]
diff --git a/test/adaptor_test/adjacent_filtered_example.cpp b/test/adaptor_test/adjacent_filtered_example.cpp
index b3538e8..ce132d6 100644
--- a/test/adaptor_test/adjacent_filtered_example.cpp
+++ b/test/adaptor_test/adjacent_filtered_example.cpp
@@ -55,4 +55,4 @@ init_unit_test_suite(int argc, char* argv[])
     test->add( BOOST_TEST_CASE( &adjacent_filtered_example_test ) );
 
     return test;
-}
\ No newline at end of file
+}
diff --git a/test/adaptor_test/copied_example.cpp b/test/adaptor_test/copied_example.cpp
index f662a45..154a110 100644
--- a/test/adaptor_test/copied_example.cpp
+++ b/test/adaptor_test/copied_example.cpp
@@ -55,4 +55,4 @@ init_unit_test_suite(int argc, char* argv[])
     test->add( BOOST_TEST_CASE( &copied_example_test ) );
 
     return test;
-}
\ No newline at end of file
+}
diff --git a/test/adaptor_test/strided2.cpp b/test/adaptor_test/strided2.cpp
new file mode 100644
index 0000000..4ac91f5
--- /dev/null
+++ b/test/adaptor_test/strided2.cpp
@@ -0,0 +1,67 @@
+// Boost.Range library
+//
+//  Copyright Neil Groves 2010. 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/
+//
+
+// This test was added due to a report that the Range Adaptors:
+// 1. Caused havoc when using namespace boost::adaptors was used
+// 2. Did not work with non-member functions
+// 3. The strided adaptor could not be composed with sliced
+//
+// None of these issues could be reproduced on GCC 4.4, but this
+// work makes for useful additional test coverage since this
+// uses chaining of adaptors and non-member functions whereas
+// most of the tests avoid this use case.
+
+#include <boost/range/adaptor/strided.hpp>
+#include <boost/range/adaptor/sliced.hpp>
+#include <boost/range/adaptor/transformed.hpp>
+#include <boost/range/irange.hpp>
+
+#include <boost/test/test_tools.hpp>
+#include <boost/test/unit_test.hpp>
+
+#include <boost/assign.hpp>
+#include <boost/range/algorithm_ext.hpp>
+
+#include <algorithm>
+#include <vector>
+
+namespace boost
+{
+    namespace
+    {
+        int times_two(int x) { return x * 2; }
+
+        void strided_test2()
+        {
+            using namespace boost::adaptors;
+            using namespace boost::assign;
+            std::vector<int> v;
+            boost::push_back(v, boost::irange(0,10));
+            std::vector<int> z;
+            boost::push_back(z, v | sliced(2,6) | strided(2) | transformed(&times_two));
+            std::vector<int> reference;
+            reference += 4,8;
+            BOOST_CHECK_EQUAL_COLLECTIONS( reference.begin(), reference.end(),
+                z.begin(), z.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.strided2" );
+
+    test->add( BOOST_TEST_CASE( &boost::strided_test2 ) );
+
+    return test;
+}
diff --git a/test/algorithm_ext_test/push_front.cpp b/test/algorithm_ext_test/push_front.cpp
index ebc09a8..a5f5fb9 100644
--- a/test/algorithm_ext_test/push_front.cpp
+++ b/test/algorithm_ext_test/push_front.cpp
@@ -21,6 +21,15 @@
 
 namespace
 {
+    struct DoubleValue
+    {
+        template< class Value >
+        Value operator()(Value x)
+        {
+            return x * 2;
+        }
+    };
+
     template< class Container >
     void test_push_front_impl(std::size_t n)
     {
@@ -34,10 +43,14 @@ namespace
         BOOST_CHECK_EQUAL_COLLECTIONS( reference.begin(), reference.end(),
             test.begin(), test.end() );
 
-        // Do it again to push onto non-empty container
-        reference.insert(reference.begin(), reference.begin(), reference.end());
+        // copy the orignal reference sequence
+        Container reference_copy(reference);
+        std::transform(reference.begin(), reference.end(), reference.begin(), DoubleValue());
 
-        boost::push_front(test, boost::irange<std::size_t>(0, n));
+        // Do it again to push onto non-empty container
+        reference.insert(reference.end(), reference_copy.begin(), reference_copy.end());
+
+        boost::push_front(test, boost::irange<std::size_t>(0, n * 2, 2));
 
         BOOST_CHECK_EQUAL_COLLECTIONS( reference.begin(), reference.end(),
             test.begin(), test.end() );
diff --git a/test/algorithm_test/find.cpp b/test/algorithm_test/find.cpp
index 6b3d532..fd179f1 100644
--- a/test/algorithm_test/find.cpp
+++ b/test/algorithm_test/find.cpp
@@ -36,16 +36,16 @@ namespace boost
                 return boost::find(cont, 3);
             }
 
-	        template<range_return_value return_type>
-	        struct test_range
-	        {
-		        template<class Container, class Policy>
-		        BOOST_DEDUCED_TYPENAME range_return<Container,return_type>::type
-		        operator()(Policy&, Container& cont)
-		        {
-		            return boost::find<return_type>(cont, 3);
-		        }
-	        };
+            template<range_return_value return_type>
+            struct test_range
+            {
+                template<class Container, class Policy>
+                BOOST_DEDUCED_TYPENAME range_return<Container,return_type>::type
+                operator()(Policy&, Container& cont)
+                {
+                    return boost::find<return_type>(cont, 3);
+                }
+            };
 
             template<class Container>
             BOOST_DEDUCED_TYPENAME range_iterator<Container>::type
diff --git a/test/algorithm_test/find_end.cpp b/test/algorithm_test/find_end.cpp
index fb44e52..a126e87 100644
--- a/test/algorithm_test/find_end.cpp
+++ b/test/algorithm_test/find_end.cpp
@@ -35,7 +35,7 @@ namespace boost
             {
             }
 
-	        container2_t cont() { return m_cont; }
+            container2_t cont() { return m_cont; }
 
             template<class Container>
             BOOST_DEDUCED_TYPENAME range_iterator<Container>::type
@@ -45,14 +45,14 @@ namespace boost
             }
 
             template<range_return_value return_type>
-	        struct test_range
-	        {
-		        template<class Container, class Policy>
-		        BOOST_DEDUCED_TYPENAME range_return<Container,return_type>::type
-		        operator()(Policy& policy, Container& cont)
-		        {
-		            return boost::find_end<return_type>(cont, policy.cont());
-		        }
+            struct test_range
+            {
+                template<class Container, class Policy>
+                BOOST_DEDUCED_TYPENAME range_return<Container,return_type>::type
+                operator()(Policy& policy, Container& cont)
+                {
+                    return boost::find_end<return_type>(cont, policy.cont());
+                }
             };
 
             template<class Container>
@@ -77,8 +77,8 @@ namespace boost
             {
             }
 
-	        container2_t& cont() { return m_cont; }
-	        BinaryPredicate& pred() { return m_pred; }
+            container2_t& cont() { return m_cont; }
+            BinaryPredicate& pred() { return m_pred; }
 
             template<class Container>
             BOOST_DEDUCED_TYPENAME range_iterator<Container>::type
@@ -88,14 +88,14 @@ namespace boost
             }
 
             template<range_return_value return_type>
-	        struct test_range
-	        {
-		        template<class Container, class Policy>
-		        BOOST_DEDUCED_TYPENAME range_return<Container,return_type>::type
-		        operator()(Policy& policy, Container& cont)
-		        {
-		            return boost::find_end<return_type>(cont, policy.cont(), policy.pred());
-		        }
+            struct test_range
+            {
+                template<class Container, class Policy>
+                BOOST_DEDUCED_TYPENAME range_return<Container,return_type>::type
+                operator()(Policy& policy, Container& cont)
+                {
+                    return boost::find_end<return_type>(cont, policy.cont(), policy.pred());
+                }
             };
 
             template<class Container>
diff --git a/test/algorithm_test/find_first_of.cpp b/test/algorithm_test/find_first_of.cpp
index b3d18e2..9ff7adb 100644
--- a/test/algorithm_test/find_first_of.cpp
+++ b/test/algorithm_test/find_first_of.cpp
@@ -35,7 +35,7 @@ namespace boost
             {
             }
 
-	        container2_t& cont() { return m_cont; }
+            container2_t& cont() { return m_cont; }
 
             template<class Container>
             BOOST_DEDUCED_TYPENAME range_iterator<Container>::type
@@ -45,14 +45,14 @@ namespace boost
             }
 
             template<range_return_value return_type>
-	        struct test_range
-	        {
-		        template<class Container, class Policy>
-		        BOOST_DEDUCED_TYPENAME range_return<Container,return_type>::type
-		        operator()(Policy& policy, Container& cont)
-		        {
-		            return boost::find_first_of<return_type>(cont, policy.cont());
-		        }
+            struct test_range
+            {
+                template<class Container, class Policy>
+                BOOST_DEDUCED_TYPENAME range_return<Container,return_type>::type
+                operator()(Policy& policy, Container& cont)
+                {
+                    return boost::find_first_of<return_type>(cont, policy.cont());
+                }
             };
 
             template<class Container>
@@ -77,8 +77,8 @@ namespace boost
             {
             }
 
-	        container2_t& cont() { return m_cont; }
-	        BinaryPredicate& pred() { return m_pred; }
+            container2_t& cont() { return m_cont; }
+            BinaryPredicate& pred() { return m_pred; }
 
             template<class Container>
             BOOST_DEDUCED_TYPENAME range_iterator<Container>::type
@@ -88,14 +88,14 @@ namespace boost
             }
 
             template<range_return_value return_type>
-	        struct test_range
-	        {
-		        template<class Container, class Policy>
-		        BOOST_DEDUCED_TYPENAME range_return<Container,return_type>::type
-		        operator()(Policy& policy, Container& cont)
-		        {
-		            return boost::find_first_of<return_type>(cont, policy.cont(), policy.pred());
-		        }
+            struct test_range
+            {
+                template<class Container, class Policy>
+                BOOST_DEDUCED_TYPENAME range_return<Container,return_type>::type
+                operator()(Policy& policy, Container& cont)
+                {
+                    return boost::find_first_of<return_type>(cont, policy.cont(), policy.pred());
+                }
             };
 
             template<class Container>
diff --git a/test/algorithm_test/find_if.cpp b/test/algorithm_test/find_if.cpp
index 4ee85a2..a5fe459 100644
--- a/test/algorithm_test/find_if.cpp
+++ b/test/algorithm_test/find_if.cpp
@@ -41,15 +41,15 @@ namespace boost
                 return boost::find_if(cont, m_pred);
             }
 
-	        template<range_return_value return_type>
-	        struct test_range
-	        {
-		        template<class Container>
-		        BOOST_DEDUCED_TYPENAME range_return<Container,return_type>::type
-		        operator()(find_if_test_policy& policy, Container& cont)
-		        {
-		            return boost::find_if<return_type>(cont, policy.pred());
-		        }
+            template<range_return_value return_type>
+            struct test_range
+            {
+                template<class Container>
+                BOOST_DEDUCED_TYPENAME range_return<Container,return_type>::type
+                operator()(find_if_test_policy& policy, Container& cont)
+                {
+                    return boost::find_if<return_type>(cont, policy.pred());
+                }
             };
 
             template<class Container>
@@ -59,7 +59,7 @@ namespace boost
                 return std::find_if(cont.begin(), cont.end(), m_pred);
             }
 
-	        UnaryPredicate& pred() { return m_pred; }
+            UnaryPredicate& pred() { return m_pred; }
 
         private:
             UnaryPredicate m_pred;
diff --git a/test/algorithm_test/for_each.cpp b/test/algorithm_test/for_each.cpp
index 56f2ef5..ac517ad 100644
--- a/test/algorithm_test/for_each.cpp
+++ b/test/algorithm_test/for_each.cpp
@@ -83,4 +83,4 @@ init_unit_test_suite(int argc, char* argv[])
     test->add( BOOST_TEST_CASE( &boost::test_for_each ) );
     
     return test;
-}
\ No newline at end of file
+}
diff --git a/test/algorithm_test/lower_bound.cpp b/test/algorithm_test/lower_bound.cpp
index 44cc120..ca622bc 100644
--- a/test/algorithm_test/lower_bound.cpp
+++ b/test/algorithm_test/lower_bound.cpp
@@ -36,16 +36,16 @@ namespace boost
                 return boost::lower_bound(cont, 5);
             }
 
-	        template<range_return_value return_type>
-	        struct test_range
-	        {
-	            template<class Container, class Policy>
-		        BOOST_DEDUCED_TYPENAME range_return<Container,return_type>::type
-		        operator()(Policy&, Container& cont)
-		        {
-		            return boost::lower_bound<return_type>(cont, 5);
-		        }
-	        };
+            template<range_return_value return_type>
+            struct test_range
+            {
+                template<class Container, class Policy>
+                BOOST_DEDUCED_TYPENAME range_return<Container,return_type>::type
+                operator()(Policy&, Container& cont)
+                {
+                    return boost::lower_bound<return_type>(cont, 5);
+                }
+            };
 
             template< class Container >
             BOOST_DEDUCED_TYPENAME range_iterator<Container>::type
@@ -66,15 +66,15 @@ namespace boost
             }
 
             template< range_return_value return_type >
-	        struct test_range
-	        {
-		        template<class Container, class Policy>
-		        BOOST_DEDUCED_TYPENAME range_return<Container,return_type>::type
-		        operator()(Policy& policy, Container& cont)
-		        {
-		            return boost::lower_bound<return_type>(
-			            cont, 5, policy.pred());
-		        }
+            struct test_range
+            {
+                template<class Container, class Policy>
+                BOOST_DEDUCED_TYPENAME range_return<Container,return_type>::type
+                operator()(Policy& policy, Container& cont)
+                {
+                    return boost::lower_bound<return_type>(
+                        cont, 5, policy.pred());
+                }
             };
 
             template<class Container>
@@ -85,10 +85,10 @@ namespace boost
                         cont.begin(), cont.end(), 5, m_pred);
             }
 
-	        BinaryPredicate& pred() { return m_pred; }
+            BinaryPredicate& pred() { return m_pred; }
 
-	    private:
-	        BinaryPredicate m_pred;
+        private:
+            BinaryPredicate m_pred;
         };
 
         template<class Container,
diff --git a/test/algorithm_test/max_element.cpp b/test/algorithm_test/max_element.cpp
index a9f76b8..d4c70ca 100644
--- a/test/algorithm_test/max_element.cpp
+++ b/test/algorithm_test/max_element.cpp
@@ -37,14 +37,14 @@ namespace boost
             }
 
             template<range_return_value return_type>
-	        struct test_range
-	        {
-		        template<class Container, class Policy>
-		        BOOST_DEDUCED_TYPENAME range_return<Container,return_type>::type
-		        operator()(Policy&, Container& cont)
-		        {
-		            return boost::max_element<return_type>(cont);
-		        }
+            struct test_range
+            {
+                template<class Container, class Policy>
+                BOOST_DEDUCED_TYPENAME range_return<Container,return_type>::type
+                operator()(Policy&, Container& cont)
+                {
+                    return boost::max_element<return_type>(cont);
+                }
             };
 
             template< class Container >
@@ -66,17 +66,17 @@ namespace boost
                 return boost::max_element(cont, Pred());
             }
 
-	        Pred pred() const { return Pred(); }
+            Pred pred() const { return Pred(); }
 
             template< range_return_value return_type >
-	        struct test_range
-	        {
-		        template< class Container, class Policy >
-		        BOOST_DEDUCED_TYPENAME range_return<Container,return_type>::type
-		        operator()(Policy& policy, Container& cont)
-		        {
-		            return boost::max_element<return_type>(cont, policy.pred());
-		        }
+            struct test_range
+            {
+                template< class Container, class Policy >
+                BOOST_DEDUCED_TYPENAME range_return<Container,return_type>::type
+                operator()(Policy& policy, Container& cont)
+                {
+                    return boost::max_element<return_type>(cont, policy.pred());
+                }
             };
 
             template< class Container >
diff --git a/test/algorithm_test/min_element.cpp b/test/algorithm_test/min_element.cpp
index 400372d..c68a655 100644
--- a/test/algorithm_test/min_element.cpp
+++ b/test/algorithm_test/min_element.cpp
@@ -37,14 +37,14 @@ namespace boost
             }
 
             template< range_return_value return_type >
-	        struct test_range
-	        {
-		        template< class Container, class Policy >
-		        BOOST_DEDUCED_TYPENAME range_return<Container,return_type>::type
-		        operator()(Policy&, Container& cont)
-		        {
-		            return boost::min_element<return_type>(cont);
-	            }
+            struct test_range
+            {
+                template< class Container, class Policy >
+                BOOST_DEDUCED_TYPENAME range_return<Container,return_type>::type
+                operator()(Policy&, Container& cont)
+                {
+                    return boost::min_element<return_type>(cont);
+                }
             };
 
             template< class Container >
@@ -66,17 +66,17 @@ namespace boost
                 return boost::min_element(cont, Pred());
             }
 
-	        Pred pred() const { return Pred(); }
+            Pred pred() const { return Pred(); }
 
             template< range_return_value return_type >
-	        struct test_range
-	        {
-		        template< class Container, class Policy >
-		        BOOST_DEDUCED_TYPENAME range_return<Container,return_type>::type
-		        operator()(Policy& policy, Container& cont)
-		        {
-		            return boost::min_element<return_type>(cont, policy.pred());
-		        }
+            struct test_range
+            {
+                template< class Container, class Policy >
+                BOOST_DEDUCED_TYPENAME range_return<Container,return_type>::type
+                operator()(Policy& policy, Container& cont)
+                {
+                    return boost::min_element<return_type>(cont, policy.pred());
+                }
             };
 
             template< class Container >
diff --git a/test/algorithm_test/partition.cpp b/test/algorithm_test/partition.cpp
index e71c9a7..3f0ce61 100644
--- a/test/algorithm_test/partition.cpp
+++ b/test/algorithm_test/partition.cpp
@@ -44,17 +44,17 @@ namespace boost
                 return boost::partition(cont, UnaryPredicate());
             }
 
-	        UnaryPredicate pred() const { return UnaryPredicate(); }
+            UnaryPredicate pred() const { return UnaryPredicate(); }
 
             template< range_return_value return_type >
-	        struct test_range
-	        {
-		        template< class Container, class Policy >
-		        BOOST_DEDUCED_TYPENAME range_return<Container,return_type>::type
-		        operator()(Policy& policy, Container& cont)
-	            {
-		            return boost::partition<return_type>(cont, policy.pred());
-		        }
+            struct test_range
+            {
+                template< class Container, class Policy >
+                BOOST_DEDUCED_TYPENAME range_return<Container,return_type>::type
+                operator()(Policy& policy, Container& cont)
+                {
+                    return boost::partition<return_type>(cont, policy.pred());
+                }
             };
 
             template< class Container >
diff --git a/test/algorithm_test/stable_partition.cpp b/test/algorithm_test/stable_partition.cpp
index 99db6be..fad4bef 100644
--- a/test/algorithm_test/stable_partition.cpp
+++ b/test/algorithm_test/stable_partition.cpp
@@ -44,17 +44,17 @@ namespace boost
                 return boost::stable_partition(cont, UnaryPredicate());
             }
 
-	        UnaryPredicate pred() const { return UnaryPredicate(); }
+            UnaryPredicate pred() const { return UnaryPredicate(); }
 
             template< range_return_value return_type >
-	        struct test_range
-	        {
-		        template< class Container, class Policy >
-		        BOOST_DEDUCED_TYPENAME range_return<Container,return_type>::type
-		        operator()(Policy& policy, Container& cont)
-		        {
-		            return boost::stable_partition<return_type>(cont, policy.pred());
-		        }
+            struct test_range
+            {
+                template< class Container, class Policy >
+                BOOST_DEDUCED_TYPENAME range_return<Container,return_type>::type
+                operator()(Policy& policy, Container& cont)
+                {
+                    return boost::stable_partition<return_type>(cont, policy.pred());
+                }
             };
 
             template< class Container >
diff --git a/test/algorithm_test/unique.cpp b/test/algorithm_test/unique.cpp
index f5d75cf..2e2ebfa 100644
--- a/test/algorithm_test/unique.cpp
+++ b/test/algorithm_test/unique.cpp
@@ -41,14 +41,14 @@ namespace boost
             }
 
             template< range_return_value return_type >
-	        struct test_range
-	        {
-		        template< class Container, class Policy >
-		        BOOST_DEDUCED_TYPENAME range_return<Container,return_type>::type
-		        operator()(Policy&, Container& cont)
-		        {
-		            return boost::unique<return_type>(cont);
-		        }
+            struct test_range
+            {
+                template< class Container, class Policy >
+                BOOST_DEDUCED_TYPENAME range_return<Container,return_type>::type
+                operator()(Policy&, Container& cont)
+                {
+                    return boost::unique<return_type>(cont);
+                }
             };
 
             template< class Container >
@@ -73,17 +73,17 @@ namespace boost
                 return std::unique(cont.begin(), cont.end(), Pred());
             }
 
-	        Pred pred() const { return Pred(); }
+            Pred pred() const { return Pred(); }
 
             template< range_return_value return_type >
-	        struct test_range
-	        {
-		        template< class Container, class Policy >
-		        BOOST_DEDUCED_TYPENAME range_return<Container,return_type>::type
-		        operator()(Policy& policy, Container& cont)
-		        {
-		            return boost::unique<return_type>(cont, policy.pred());
-		        }
+            struct test_range
+            {
+                template< class Container, class Policy >
+                BOOST_DEDUCED_TYPENAME range_return<Container,return_type>::type
+                operator()(Policy& policy, Container& cont)
+                {
+                    return boost::unique<return_type>(cont, policy.pred());
+                }
             };
 
             template< class Container >
diff --git a/test/algorithm_test/upper_bound.cpp b/test/algorithm_test/upper_bound.cpp
index 3df7164..2eb64cf 100644
--- a/test/algorithm_test/upper_bound.cpp
+++ b/test/algorithm_test/upper_bound.cpp
@@ -35,16 +35,16 @@ namespace boost
                 return boost::upper_bound(cont, 5);
             }
 
-	        template<range_return_value result_type>
-	        struct test_range
-	        {
-		        template<class Container, class Policy>
-		        BOOST_DEDUCED_TYPENAME range_return<Container,result_type>::type
-		        operator()(Policy&, Container& cont)
-		        {
-		            return boost::upper_bound<result_type>(cont, 5);
-		        }
-	        };
+            template<range_return_value result_type>
+            struct test_range
+            {
+                template<class Container, class Policy>
+                BOOST_DEDUCED_TYPENAME range_return<Container,result_type>::type
+                operator()(Policy&, Container& cont)
+                {
+                    return boost::upper_bound<result_type>(cont, 5);
+                }
+            };
 
             template< class Container >
             BOOST_DEDUCED_TYPENAME range_iterator<Container>::type
@@ -65,15 +65,15 @@ namespace boost
             }
 
             template< range_return_value result_type>
-	        struct test_range
-	        {
-		        template< class Container, class Policy >
-		        BOOST_DEDUCED_TYPENAME range_return<Container,result_type>::type
-		        operator()(Policy& policy, Container& cont)
-		        {
-		            return boost::upper_bound<result_type>(
-				        cont, 5, policy.pred());
-		        }
+            struct test_range
+            {
+                template< class Container, class Policy >
+                BOOST_DEDUCED_TYPENAME range_return<Container,result_type>::type
+                operator()(Policy& policy, Container& cont)
+                {
+                    return boost::upper_bound<result_type>(
+                        cont, 5, policy.pred());
+                }
             };
 
             template<class Container>
@@ -83,11 +83,11 @@ namespace boost
                 return std::upper_bound(
                         cont.begin(), cont.end(), 5, BinaryPredicate());
             }
-	    
-	        BinaryPredicate& pred() { return m_pred; }
-	    
-	    private:
-	        BinaryPredicate m_pred;
+        
+            BinaryPredicate& pred() { return m_pred; }
+        
+        private:
+            BinaryPredicate m_pred;
         };
 
         template<class Container,
diff --git a/test/counting_range.cpp b/test/counting_range.cpp
index b5d79a1..18aceba 100644
--- a/test/counting_range.cpp
+++ b/test/counting_range.cpp
@@ -70,4 +70,4 @@ init_unit_test_suite(int argc, char* argv[])
     test->add( BOOST_TEST_CASE( &boost::counting_range_test ) );
 
     return test;
-}
\ No newline at end of file
+}
diff --git a/test/istream_range.cpp b/test/istream_range.cpp
new file mode 100644
index 0000000..b3e16db
--- /dev/null
+++ b/test/istream_range.cpp
@@ -0,0 +1,51 @@
+// Boost.Range library
+//
+//  Copyright Neil Groves 2010. 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/istream_range.hpp>
+#include <boost/range/algorithm_ext.hpp>
+#include <boost/range/begin.hpp>
+#include <boost/range/end.hpp>
+#include <boost/test/test_tools.hpp>
+#include <boost/test/unit_test.hpp>
+#include <sstream>
+#include <vector>
+
+namespace
+{
+    // Test an integer range with a step size of 1.
+    void test_istream_range()
+    {
+        std::stringstream s;
+        std::vector<int> reference;
+        for (int i = 0; i < 10; ++i)
+        {
+            reference.push_back(i);
+            s << i << " ";
+        }
+
+        std::vector<int> target;
+        boost::push_back(target, boost::range::istream_range<int>(s));
+
+        BOOST_CHECK_EQUAL_COLLECTIONS( reference.begin(), reference.end(),
+            target.begin(), target.end() );
+    }
+
+} // namespace anonymous namespace
+
+boost::unit_test::test_suite*
+init_unit_test_suite(int argc, char* argv[])
+{
+    boost::unit_test::test_suite* test
+        = BOOST_TEST_SUITE( "RangeTestSuite.istream_range" );
+
+    test->add(BOOST_TEST_CASE( &test_istream_range ));
+
+    return test;
+}
diff --git a/test/iterator_range.cpp b/test/iterator_range.cpp
index cf22463..7c53a8b 100644
--- a/test/iterator_range.cpp
+++ b/test/iterator_range.cpp
@@ -61,7 +61,7 @@ void check_iterator_range()
     BOOST_CHECK_EQUAL( r2.size(), size( r2 ) );
 
     BOOST_CHECK_EQUAL( std::distance( r.begin(), r.end() ),
-		               std::distance( boost::begin( r2 ), boost::end( r2 ) ) );
+                       std::distance( boost::begin( r2 ), boost::end( r2 ) ) );
     std::cout << r << r2;
 
 
diff --git a/test/pointer_as_iterator.cpp b/test/pointer_as_iterator.cpp
new file mode 100644
index 0000000..e0e28d0
--- /dev/null
+++ b/test/pointer_as_iterator.cpp
@@ -0,0 +1,39 @@
+// Boost.Range library
+//
+//  Copyright Neil Groves 2010. 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/iterator_range.hpp>
+#include <boost/range/begin.hpp>
+#include <boost/range/end.hpp>
+#include <boost/array.hpp>
+#include <boost/test/test_tools.hpp>
+#include <boost/test/unit_test.hpp>
+#include <iostream>
+#include <vector>
+
+namespace
+{
+    void test_pointer_as_iterator()
+    {
+        boost::array<int,3> arr;
+        boost::iterator_range<const int*> r(arr.begin(), arr.end());
+        r[0];
+    }
+} // anonymous namespace
+
+boost::unit_test::test_suite*
+init_unit_test_suite(int argc, char* argv[])
+{
+    boost::unit_test::test_suite* test
+        = BOOST_TEST_SUITE( "RangeTestSuite.pointer_as_iterator" );
+
+    test->add(BOOST_TEST_CASE( &test_pointer_as_iterator ));
+
+    return test;
+}
diff --git a/test/test_driver/range_return_test_driver.hpp b/test/test_driver/range_return_test_driver.hpp
index 6f4fc3b..eb52474 100644
--- a/test/test_driver/range_return_test_driver.hpp
+++ b/test/test_driver/range_return_test_driver.hpp
@@ -379,25 +379,25 @@ namespace boost
                                                    range_result, reference_it);
             }
 
-	        template< range_return_value result_type, class Container, class TestPolicy >
-	        struct test_range
-	        {
-		        void operator()(Container& cont, TestPolicy policy)
-		        {
-		            typedef BOOST_DEDUCED_TYPENAME range_iterator<Container>::type iterator_t;
-		            typedef BOOST_DEDUCED_TYPENAME range_return<Container, result_type>::type range_return_t;
-		            typedef BOOST_DEDUCED_TYPENAME TestPolicy::template test_range<result_type> test_range_t;
+            template< range_return_value result_type, class Container, class TestPolicy >
+            struct test_range
+            {
+                void operator()(Container& cont, TestPolicy policy)
+                {
+                    typedef BOOST_DEDUCED_TYPENAME range_iterator<Container>::type iterator_t;
+                    typedef BOOST_DEDUCED_TYPENAME range_return<Container, result_type>::type range_return_t;
+                    typedef BOOST_DEDUCED_TYPENAME TestPolicy::template test_range<result_type> test_range_t;
 
-		            Container reference(cont);
-		            Container test_cont(cont);
+                    Container reference(cont);
+                    Container test_cont(cont);
 
-		            range_return_t range_result = test_range_t()(policy, test_cont);
-		            iterator_t reference_it = policy.reference(reference);
+                    range_return_t range_result = test_range_t()(policy, test_cont);
+                    iterator_t reference_it = policy.reference(reference);
 
-		            check_results<result_type>::check(test_cont, reference,
+                    check_results<result_type>::check(test_cont, reference,
                                                          range_result, reference_it);
-		        }
-	        };
+                }
+            };
         };
     }
 }

From f9eeb5d447718df30e5d6ae5997e90676ae5d30e Mon Sep 17 00:00:00 2001
From: Neil Groves <neil@grovescomputing.com>
Date: Fri, 23 Apr 2010 23:18:59 +0000
Subject: [PATCH 35/73] Boost.Range correct missing items from merge by merging
 these changes manually. This changeset is what should have happened with the
 prior svn merge operation.

[SVN r61519]
---
 include/boost/range/algorithm/fill_n.hpp         | 1 +
 include/boost/range/algorithm_ext/erase.hpp      | 9 ++++++---
 include/boost/range/algorithm_ext/insert.hpp     | 7 ++++---
 include/boost/range/algorithm_ext/iota.hpp       | 4 +++-
 include/boost/range/algorithm_ext/push_back.hpp  | 3 ++-
 include/boost/range/algorithm_ext/push_front.hpp | 3 ++-
 6 files changed, 18 insertions(+), 9 deletions(-)

diff --git a/include/boost/range/algorithm/fill_n.hpp b/include/boost/range/algorithm/fill_n.hpp
index f827135..29d7d6f 100755
--- a/include/boost/range/algorithm/fill_n.hpp
+++ b/include/boost/range/algorithm/fill_n.hpp
@@ -26,6 +26,7 @@ namespace boost
 /// range-based version of the fill_n std algorithm
 ///
 /// \pre ForwardRange is a model of the ForwardRangeConcept
+/// \pre n <= std::distance(boost::begin(rng), boost::end(rng))
 template< class ForwardRange, class Size, class Value >
 inline ForwardRange& fill_n(ForwardRange& rng, Size n, const Value& val)
 {
diff --git a/include/boost/range/algorithm_ext/erase.hpp b/include/boost/range/algorithm_ext/erase.hpp
index 3b0e037..107d32b 100755
--- a/include/boost/range/algorithm_ext/erase.hpp
+++ b/include/boost/range/algorithm_ext/erase.hpp
@@ -24,29 +24,32 @@ namespace boost
     {
 
 template< class Container >
-inline void erase( Container& on,
+inline Container& erase( Container& on,
       iterator_range<BOOST_DEDUCED_TYPENAME Container::iterator> to_erase )
 {
     BOOST_RANGE_CONCEPT_ASSERT(( ForwardRangeConcept<Container> ));
     on.erase( boost::begin(to_erase), boost::end(to_erase) );
+    return on;
 }
 
 template< class Container, class T >
-inline void remove_erase( Container& on, const T& val )
+inline Container& remove_erase( Container& on, const T& val )
 {
     BOOST_RANGE_CONCEPT_ASSERT(( ForwardRangeConcept<Container> ));
     on.erase(
         std::remove(boost::begin(on), boost::end(on), val),
         boost::end(on));
+    return on;
 }
 
 template< class Container, class Pred >
-inline void remove_erase_if( Container& on, Pred pred )
+inline Container& remove_erase_if( Container& on, Pred pred )
 {
     BOOST_RANGE_CONCEPT_ASSERT(( ForwardRangeConcept<Container> ));
     on.erase(
         std::remove_if(boost::begin(on), boost::end(on), pred),
         boost::end(on));
+    return on;
 }
 
     } // namespace range
diff --git a/include/boost/range/algorithm_ext/insert.hpp b/include/boost/range/algorithm_ext/insert.hpp
index a887f15..b9adfdd 100755
--- a/include/boost/range/algorithm_ext/insert.hpp
+++ b/include/boost/range/algorithm_ext/insert.hpp
@@ -23,15 +23,16 @@ namespace boost
     {
 
 template< class Container, class Range >
-inline void insert( Container& on,
-                    BOOST_DEDUCED_TYPENAME Container::iterator before,
-                    const Range& from )
+inline Container& insert( Container& on,
+                          BOOST_DEDUCED_TYPENAME Container::iterator before,
+                          const Range& from )
 {
     BOOST_RANGE_CONCEPT_ASSERT(( ForwardRangeConcept<Container> ));
     BOOST_RANGE_CONCEPT_ASSERT(( SinglePassRangeConcept<Range> ));
     BOOST_ASSERT( (void*)&on != (void*)&from &&
                   "cannot copy from a container to itself" );
     on.insert( before, boost::begin(from), boost::end(from) );
+    return on;
 }
 
     } // namespace range
diff --git a/include/boost/range/algorithm_ext/iota.hpp b/include/boost/range/algorithm_ext/iota.hpp
index 4a03a59..65cbc89 100644
--- a/include/boost/range/algorithm_ext/iota.hpp
+++ b/include/boost/range/algorithm_ext/iota.hpp
@@ -22,7 +22,7 @@ namespace boost
     {
 
 template< class ForwardRange, class Value >
-inline void iota( ForwardRange& rng, Value x )
+inline ForwardRange& iota( ForwardRange& rng, Value x )
 {
     BOOST_CONCEPT_ASSERT(( ForwardRangeConcept<ForwardRange> ));
     typedef BOOST_DEDUCED_TYPENAME range_iterator<ForwardRange>::type iterator_t;
@@ -30,6 +30,8 @@ inline void iota( ForwardRange& rng, Value x )
     iterator_t last_target = ::boost::end(rng);
     for (iterator_t target = ::boost::begin(rng); target != last_target; ++target, ++x)
         *target = x;
+
+    return rng;
 }
 
     } // namespace range
diff --git a/include/boost/range/algorithm_ext/push_back.hpp b/include/boost/range/algorithm_ext/push_back.hpp
index e52de41..51a7a7b 100755
--- a/include/boost/range/algorithm_ext/push_back.hpp
+++ b/include/boost/range/algorithm_ext/push_back.hpp
@@ -23,13 +23,14 @@ namespace boost
     {
 
 template< class Container, class Range >
-inline void push_back( Container& on, const Range& from )
+inline Container& push_back( Container& on, const Range& from )
 {
     BOOST_RANGE_CONCEPT_ASSERT(( SinglePassRangeConcept<Container> ));
     BOOST_RANGE_CONCEPT_ASSERT(( SinglePassRangeConcept<const Range> ));
     BOOST_ASSERT( (void*)&on != (void*)&from &&
                   "cannot copy from a container to itself" );
     on.insert( on.end(), boost::begin(from), boost::end(from) );
+    return on;
 }
 
     } // namespace range
diff --git a/include/boost/range/algorithm_ext/push_front.hpp b/include/boost/range/algorithm_ext/push_front.hpp
index 6ee269b..470d793 100755
--- a/include/boost/range/algorithm_ext/push_front.hpp
+++ b/include/boost/range/algorithm_ext/push_front.hpp
@@ -23,13 +23,14 @@ namespace boost
     {
 
 template< class Container, class Range >
-inline void push_front( Container& on, const Range& from )
+inline Container& push_front( Container& on, const Range& from )
 {
     BOOST_RANGE_CONCEPT_ASSERT(( SinglePassRangeConcept<Container> ));
     BOOST_RANGE_CONCEPT_ASSERT(( SinglePassRangeConcept<const Range> ));
     BOOST_ASSERT( (void*)&on != (void*)&from &&
                   "cannot copy from a container to itself" );
     on.insert( on.begin(), boost::begin(from), boost::end(from) );
+    return on;
 }
 
     } // namespace range

From 88001ada3797e2d54f0b6fc81f51c498a0815bc7 Mon Sep 17 00:00:00 2001
From: Douglas Gregor <doug.gregor@gmail.com>
Date: Sun, 9 May 2010 01:23:32 +0000
Subject: [PATCH 36/73] Merge standards-conformance fixes for Boost.Range

[SVN r61864]
---
 test/extension_mechanism.cpp | 2 ++
 1 file changed, 2 insertions(+)
 mode change 100755 => 100644 test/extension_mechanism.cpp

diff --git a/test/extension_mechanism.cpp b/test/extension_mechanism.cpp
old mode 100755
new mode 100644
index a206afb..9e9891a
--- a/test/extension_mechanism.cpp
+++ b/test/extension_mechanism.cpp
@@ -41,6 +41,8 @@ namespace Foo
         //
         struct X
         {
+          X() : vec() { }
+
                 typedef std::vector<int>       data_t;
                 typedef data_t::iterator       iterator;
                 typedef data_t::const_iterator const_iterator;

From 794fd3e226ac14fb3f75737258cb3ecc4eccd898 Mon Sep 17 00:00:00 2001
From: Douglas Gregor <doug.gregor@gmail.com>
Date: Sun, 9 May 2010 01:32:55 +0000
Subject: [PATCH 37/73] Move Boost.Range's join_iterator intrusive_ptr_add_ref
 and intrusive_ptr_release where ADL will actually find them

[SVN r61867]
---
 include/boost/range/detail/join_iterator.hpp | 9 ++-------
 1 file changed, 2 insertions(+), 7 deletions(-)

diff --git a/include/boost/range/detail/join_iterator.hpp b/include/boost/range/detail/join_iterator.hpp
index 792f834..76ebbfe 100644
--- a/include/boost/range/detail/join_iterator.hpp
+++ b/include/boost/range/detail/join_iterator.hpp
@@ -71,24 +71,19 @@ private:
     mutable reference_count_t count;
 };
 
-} // range_detail
-
 template<typename Iterator1, typename Iterator2>
-inline void intrusive_ptr_add_ref(const range_detail::join_iterator_link<Iterator1,Iterator2>* p)
+inline void intrusive_ptr_add_ref(const join_iterator_link<Iterator1,Iterator2>* p)
 {
     p->add_reference();
 }
 
 template<typename Iterator1, typename Iterator2>
-inline void intrusive_ptr_release(const range_detail::join_iterator_link<Iterator1,Iterator2>* p)
+inline void intrusive_ptr_release(const join_iterator_link<Iterator1,Iterator2>* p)
 {
     if (p->release_reference())
         delete p;
 }
 
-namespace range_detail
-{
-
 class join_iterator_begin_tag {};
 class join_iterator_end_tag {};
 

From ca2328ed872151a470dcb4417aac319cbff37c25 Mon Sep 17 00:00:00 2001
From: Daniel James <daniel@calamity.org.uk>
Date: Sat, 26 Jun 2010 12:30:09 +0000
Subject: [PATCH 38/73] Merge documentation fixes.

* Use `doc/src/*.css` instead of `doc/html/*.css`.
* Remove wiki and people directories.
* Some documentation fixes.
* Left out `minimal.css` changes and boostbook changes because of clashes.


[SVN r63347]
---
 doc/Jamfile.v2 | 2 --
 1 file changed, 2 deletions(-)

diff --git a/doc/Jamfile.v2 b/doc/Jamfile.v2
index 5195b32..82a8d7f 100644
--- a/doc/Jamfile.v2
+++ b/doc/Jamfile.v2
@@ -19,8 +19,6 @@ boostbook quickbook
     boost_range.qbk
   :
     <xsl:param>boost.root=../../../..
-    <xsl:param>boost.libraries=../../../libraries.htm
-    <xsl:param>html.stylesheet=../../../../doc/html/boostbook.css
     <xsl:param>chunk.section.depth=4
     <xsl:param>chunk.first.sections=1
     <xsl:param>toc.section.depth=3

From 26c095d0228413e8c4335c80658594658cb08a4d Mon Sep 17 00:00:00 2001
From: Neil Groves <neil@grovescomputing.com>
Date: Sun, 18 Jul 2010 11:36:34 +0000
Subject: [PATCH 39/73] Boost.Range merge of bug fixes and documentation

[SVN r64120]
---
 doc/history_ack.qbk                           |   9 +-
 doc/html/index.html                           |  18 +-
 doc/html/range/concepts.html                  |  12 +-
 .../range/concepts/bidirectional_range.html   |  28 +-
 doc/html/range/concepts/concept_checking.html |  38 +--
 doc/html/range/concepts/forward_range.html    |  22 +-
 doc/html/range/concepts/overview.html         |  20 +-
 .../range/concepts/random_access_range.html   |  24 +-
 .../range/concepts/single_pass_range.html     |  28 +-
 doc/html/range/examples.html                  |  48 ++--
 doc/html/range/faq.html                       | 109 +++-----
 doc/html/range/history_ack.html               |  84 +++---
 doc/html/range/introduction.html              | 123 ++++-----
 doc/html/range/library_headers.html           |  12 +-
 doc/html/range/library_headers/adaptors.html  |  12 +-
 doc/html/range/library_headers/algorithm.html |  12 +-
 .../library_headers/algorithm_extensions.html |  12 +-
 doc/html/range/library_headers/general.html   |  12 +-
 doc/html/range/mfc_atl.html                   |  16 +-
 doc/html/range/mfc_atl/atl_ranges.html        |  12 +-
 doc/html/range/mfc_atl/const_ranges.html      |  12 +-
 doc/html/range/mfc_atl/mfc_ranges.html        |  12 +-
 doc/html/range/mfc_atl/references.html        |  28 +-
 doc/html/range/mfc_atl/requirements.html      |  20 +-
 doc/html/range/portability.html               |  52 ++--
 doc/html/range/reference.html                 |  12 +-
 doc/html/range/reference/adaptors.html        |  12 +-
 .../adaptors/adaptors_reference.html          |  75 -----
 .../adaptors/general_requirements.html        |  66 ++---
 .../reference/adaptors/introduction.html      |  46 ++--
 .../range/reference/adaptors/reference.html   |  12 +-
 .../adaptors/reference/adjacent_filtered.html |  49 ++--
 .../reference/adaptors/reference/copied.html  |  48 ++--
 .../adaptors/reference/filtered.html          |  50 ++--
 .../reference/adaptors/reference/indexed.html |  40 +--
 .../adaptors/reference/indirected.html        |  43 +--
 .../adaptors/reference/map_keys.html          |  41 +--
 .../adaptors/reference/map_values.html        |  41 +--
 .../adaptors/reference/replaced.html          |  64 +++--
 .../adaptors/reference/replaced_if.html       |  59 ++--
 .../adaptors/reference/reversed.html          |  32 +--
 .../reference/adaptors/reference/sliced.html  |  44 +--
 .../reference/adaptors/reference/strided.html |  42 +--
 .../adaptors/reference/tokenized.html         |  79 +++---
 .../adaptors/reference/transformed.html       |  49 ++--
 .../reference/adaptors/reference/uniqued.html |  40 +--
 doc/html/range/reference/algorithms.html      |  12 +-
 doc/html/range/reference/algorithms/heap.html |  12 +-
 .../reference/algorithms/heap/make_heap.html  |  80 +++---
 .../reference/algorithms/heap/pop_heap.html   |  90 +++---
 .../reference/algorithms/heap/push_heap.html  |  90 +++---
 .../reference/algorithms/heap/sort_heap.html  |  82 +++---
 .../range/reference/algorithms/mutating.html  |  12 +-
 .../reference/algorithms/mutating/copy.html   |  60 ++--
 .../algorithms/mutating/copy_backward.html    |  60 ++--
 .../reference/algorithms/mutating/fill.html   |  48 ++--
 .../reference/algorithms/mutating/fill_n.html |  48 ++--
 .../algorithms/mutating/generate.html         |  64 ++---
 .../algorithms/mutating/inplace_merge.html    | 104 +++----
 .../reference/algorithms/mutating/merge.html  | 206 +++++++-------
 .../algorithms/mutating/nth_element.html      |  80 +++---
 .../algorithms/mutating/partial_sort.html     |  80 +++---
 .../algorithms/mutating/partition.html        |  44 +--
 .../algorithms/mutating/random_shuffle.html   |  62 ++---
 .../reference/algorithms/mutating/remove.html |  48 ++--
 .../algorithms/mutating/remove_copy.html      |  48 ++--
 .../algorithms/mutating/remove_copy_if.html   |  40 +--
 .../algorithms/mutating/remove_if.html        |  48 ++--
 .../algorithms/mutating/replace.html          |  58 ++--
 .../algorithms/mutating/replace_copy.html     |  54 ++--
 .../algorithms/mutating/replace_copy_if.html  |  60 ++--
 .../algorithms/mutating/replace_if.html       |  62 ++---
 .../algorithms/mutating/reverse.html          |  36 +--
 .../algorithms/mutating/reverse_copy.html     |  42 +--
 .../reference/algorithms/mutating/rotate.html |  44 +--
 .../algorithms/mutating/rotate_copy.html      |  50 ++--
 .../reference/algorithms/mutating/sort.html   |  80 +++---
 .../algorithms/mutating/stable_partition.html |  40 +--
 .../algorithms/mutating/stable_sort.html      |  80 +++---
 .../algorithms/mutating/swap_ranges.html      |  50 ++--
 .../algorithms/mutating/transform.html        | 140 +++++-----
 .../reference/algorithms/mutating/unique.html |  68 ++---
 .../algorithms/mutating/unique_copy.html      |  84 +++---
 doc/html/range/reference/algorithms/new.html  |  12 +-
 .../reference/algorithms/new/copy_n.html      |  42 +--
 .../range/reference/algorithms/new/erase.html |  28 +-
 .../reference/algorithms/new/for_each.html    |  60 ++--
 .../reference/algorithms/new/insert.html      |  44 +--
 .../range/reference/algorithms/new/iota.html  |  37 +--
 .../reference/algorithms/new/is_sorted.html   |  44 +--
 .../reference/algorithms/new/overwrite.html   |  58 ++--
 .../reference/algorithms/new/push_back.html   |  44 +--
 .../reference/algorithms/new/push_front.html  |  44 +--
 .../algorithms/new/remove_erase.html          |  28 +-
 .../algorithms/new/remove_erase_if.html       |  34 +--
 .../reference/algorithms/non_mutating.html    |  12 +-
 .../non_mutating/adjacent_find.html           |  60 ++--
 .../non_mutating/binary_search.html           |  82 +++---
 .../algorithms/non_mutating/count.html        |  48 ++--
 .../algorithms/non_mutating/count_if.html     |  48 ++--
 .../algorithms/non_mutating/equal.html        |  96 +++----
 .../algorithms/non_mutating/equal_range.html  |  82 +++---
 .../algorithms/non_mutating/find.html         |  46 ++--
 .../algorithms/non_mutating/find_end.html     |  94 +++----
 .../non_mutating/find_first_of.html           |  86 +++---
 .../algorithms/non_mutating/find_if.html      |  44 +--
 .../algorithms/non_mutating/for_each.html     |  50 ++--
 .../non_mutating/lexicographical_compare.html | 104 +++----
 .../algorithms/non_mutating/lower_bound.html  |  82 +++---
 .../algorithms/non_mutating/max_element.html  |  58 ++--
 .../algorithms/non_mutating/min_element.html  |  58 ++--
 .../algorithms/non_mutating/mismatch.html     |  98 +++----
 .../algorithms/non_mutating/search.html       |  96 +++----
 .../algorithms/non_mutating/search_n.html     |  84 +++---
 .../algorithms/non_mutating/upper_bound.html  |  82 +++---
 .../range/reference/algorithms/numeric.html   |  12 +-
 .../algorithms/numeric/accumulate.html        |  96 +++----
 .../numeric/adjacent_difference.html          | 110 ++++----
 .../algorithms/numeric/inner_product.html     | 138 +++++-----
 .../algorithms/numeric/partial_sum.html       |  98 +++----
 .../reference/algorithms/permutation.html     |  12 +-
 .../permutation/next_permutation.html         |  80 +++---
 .../permutation/prev_permutation.html         |  80 +++---
 .../range_algorithm_introduction.html         | 257 ++++++++++++++++++
 doc/html/range/reference/algorithms/set.html  |  12 +-
 .../reference/algorithms/set/includes.html    | 126 ++++-----
 .../algorithms/set/set_difference.html        | 138 +++++-----
 .../algorithms/set/set_intersection.html      | 138 +++++-----
 .../set/set_symmetric_difference.html         | 138 +++++-----
 .../reference/algorithms/set/set_union.html   | 138 +++++-----
 .../reference/concept_implementation.html     |  12 +-
 .../concept_implementation/semantics.html     |  14 +-
 .../semantics/functions.html                  |  12 +-
 .../semantics/metafunctions.html              |  12 +-
 .../concept_implementation/synopsis.html      |  12 +-
 doc/html/range/reference/extending.html       |  12 +-
 .../range/reference/extending/method_1.html   |  12 +-
 .../range/reference/extending/method_2.html   |  12 +-
 .../range/reference/extending/method_3.html   |  12 +-
 .../extending/method_3/method_3_1.html        |  28 +-
 .../extending/method_3/method_3_2.html        |  30 +-
 doc/html/range/reference/overview.html        |  70 +++++
 doc/html/range/reference/ranges.html          |  12 +-
 .../reference/ranges/counting_range.html      |  28 +-
 doc/html/range/reference/ranges/irange.html   |  35 +--
 .../range/reference/ranges/istream_range.html |  18 +-
 doc/html/range/reference/utilities.html       |  24 +-
 .../reference/utilities/iterator_range.html   | 113 +++-----
 doc/html/range/reference/utilities/join.html  |  16 +-
 .../range/reference/utilities/sub_range.html  |  14 +-
 doc/html/range/style_guide.html               |  66 +++--
 doc/html/range/upgrade.html                   |  12 +-
 doc/html/range/upgrade/upgrade_from_1_34.html |  56 ++--
 doc/html/range/upgrade/upgrade_from_1_42.html |  38 +--
 doc/introduction.qbk                          |  71 ++---
 doc/reference/adaptors/adjacent_filtered.html | 101 -------
 doc/reference/adaptors/copied.html            |  93 -------
 doc/reference/adaptors/filtered.html          | 108 --------
 doc/reference/adaptors/indexed.html           | 117 --------
 doc/reference/adaptors/indirected.html        |  95 -------
 doc/reference/adaptors/map_keys.html          |  99 -------
 doc/reference/adaptors/map_values.html        |  98 -------
 doc/reference/adaptors/replaced.html          | 107 --------
 doc/reference/adaptors/replaced_if.html       | 114 --------
 doc/reference/adaptors/reversed.html          |  91 -------
 doc/reference/adaptors/sliced.html            |  94 -------
 doc/reference/adaptors/strided.html           |  94 -------
 doc/reference/adaptors/tokenized.html         | 118 --------
 doc/reference/adaptors/transformed.html       | 107 --------
 doc/reference/adaptors/uniqued.html           |  95 -------
 .../boost/range/adaptor/adjacent_filtered.hpp |   9 +-
 include/boost/range/adaptor/map.hpp           |  56 ++--
 include/boost/range/adaptor/replaced.hpp      |  22 +-
 include/boost/range/adaptor/sliced.hpp        |  28 +-
 include/boost/range/algorithm/copy.hpp        |   2 +-
 .../boost/range/algorithm/copy_backward.hpp   |   2 +-
 include/boost/range/algorithm/equal.hpp       |   8 +-
 include/boost/range/algorithm/fill.hpp        |   9 +
 include/boost/range/algorithm/fill_n.hpp      |  10 +
 include/boost/range/algorithm/find.hpp        |  30 +-
 include/boost/range/algorithm/find_end.hpp    |  73 ++++-
 .../boost/range/algorithm/find_first_of.hpp   |  74 ++++-
 include/boost/range/algorithm/find_if.hpp     |  30 +-
 include/boost/range/algorithm/generate.hpp    |   9 +
 .../boost/range/algorithm/heap_algorithm.hpp  |  72 +++++
 include/boost/range/algorithm/lower_bound.hpp |  63 ++++-
 .../boost/range/algorithm/partial_sort.hpp    |  22 ++
 .../range/algorithm/partial_sort_copy.hpp     |  28 +-
 include/boost/range/algorithm/partition.hpp   |  20 ++
 .../boost/range/algorithm/random_shuffle.hpp  |  18 ++
 include/boost/range/algorithm/remove.hpp      |  20 ++
 include/boost/range/algorithm/remove_copy.hpp |   4 +-
 .../boost/range/algorithm/remove_copy_if.hpp  |   6 +-
 include/boost/range/algorithm/remove_if.hpp   |  20 ++
 include/boost/range/algorithm/replace.hpp     |  11 +
 .../boost/range/algorithm/replace_copy.hpp    |   4 +-
 .../boost/range/algorithm/replace_copy_if.hpp |   4 +-
 include/boost/range/algorithm/replace_if.hpp  |  11 +
 include/boost/range/algorithm/reverse.hpp     |   9 +
 .../boost/range/algorithm/reverse_copy.hpp    |   2 +-
 include/boost/range/algorithm/rotate.hpp      |  10 +
 include/boost/range/algorithm/search_n.hpp    |   8 +-
 include/boost/range/algorithm/sort.hpp        |  18 ++
 include/boost/range/algorithm/stable_sort.hpp |  18 ++
 include/boost/range/algorithm/swap_ranges.hpp |  45 +++
 include/boost/range/algorithm/upper_bound.hpp |  64 ++++-
 include/boost/range/algorithm_ext/iota.hpp    |  13 +
 .../boost/range/algorithm_ext/is_sorted.hpp   |   6 +-
 .../boost/range/algorithm_ext/overwrite.hpp   |  27 ++
 include/boost/range/detail/join_iterator.hpp  |  84 ++----
 include/boost/range/irange.hpp                |  40 ++-
 include/boost/range/join.hpp                  |  71 +++--
 include/boost/range/numeric.hpp               |  47 ++--
 test/Jamfile.v2                               |   9 +
 test/adaptor_test/map.cpp                     |  44 +++
 test/algorithm_test/adjacent_find.cpp         |   8 +-
 test/algorithm_test/binary_search.cpp         |   4 +
 test/algorithm_test/copy.cpp                  |   7 +
 test/algorithm_test/copy_backward.cpp         |   4 +
 test/algorithm_test/copy_n.cpp                |  70 +++++
 test/algorithm_test/count.cpp                 |  40 +--
 test/algorithm_test/count_if.cpp              |  14 +
 test/algorithm_test/equal.cpp                 |  40 +++
 test/algorithm_test/equal_range.cpp           |  14 +-
 test/algorithm_test/fill.cpp                  |   6 +
 test/algorithm_test/find.cpp                  |  14 +-
 test/algorithm_test/find_end.cpp              |  28 +-
 test/algorithm_test/find_first_of.cpp         |  32 ++-
 test/algorithm_test/find_if.cpp               |  10 +-
 test/algorithm_test/for_each.cpp              |  21 +-
 test/algorithm_test/generate.cpp              |   6 +
 test/algorithm_test/heap.cpp                  |  23 ++
 test/algorithm_test/includes.cpp              |   8 +
 test/algorithm_test/inplace_merge.cpp         |  19 ++
 .../lexicographical_compare.cpp               |  14 +-
 test/algorithm_test/lower_bound.cpp           |  23 +-
 test/algorithm_test/max_element.cpp           |  24 +-
 test/algorithm_test/merge.cpp                 |  80 ++++++
 test/algorithm_test/min_element.cpp           |  22 +-
 test/algorithm_test/mismatch.cpp              | 245 ++++++++++-------
 test/algorithm_test/next_permutation.cpp      |  21 +-
 test/algorithm_test/nth_element.cpp           |  26 ++
 test/algorithm_test/partial_sort.cpp          |  22 ++
 test/algorithm_test/partition.cpp             |  32 ++-
 test/algorithm_test/prev_permutation.cpp      |  24 +-
 test/algorithm_test/random_shuffle.cpp        |  19 ++
 test/algorithm_test/remove.cpp                |  11 +-
 test/algorithm_test/remove_copy.cpp           | 107 ++++++++
 test/algorithm_test/remove_copy_if.cpp        | 113 ++++++++
 test/algorithm_test/remove_if.cpp             |  12 +-
 test/algorithm_test/replace.cpp               |   9 +-
 test/algorithm_test/replace_copy.cpp          | 110 ++++++++
 test/algorithm_test/replace_copy_if.cpp       | 115 ++++++++
 test/algorithm_test/replace_if.cpp            |  10 +-
 test/algorithm_test/reverse.cpp               |  12 +-
 test/algorithm_test/reverse_copy.cpp          |  97 +++++++
 test/algorithm_test/rotate.cpp                |  16 +-
 test/algorithm_test/rotate_copy.cpp           | 112 ++++++++
 test/algorithm_test/search.cpp                |  16 ++
 test/algorithm_test/search_n.cpp              |  93 +++++++
 test/algorithm_test/set_difference.cpp        |  44 +++
 test/algorithm_test/set_intersection.cpp      |  44 +++
 .../set_symmetric_difference.cpp              |  44 +++
 test/algorithm_test/set_union.cpp             |  40 +++
 test/algorithm_test/sort.cpp                  |  16 +-
 test/algorithm_test/stable_partition.cpp      |  28 +-
 test/algorithm_test/stable_sort.cpp           |  22 +-
 test/algorithm_test/swap_ranges.cpp           | 116 ++++++++
 test/algorithm_test/transform.cpp             |  34 ++-
 test/algorithm_test/unique.cpp                |  26 +-
 test/algorithm_test/unique_copy.cpp           | 158 +++++++++++
 test/algorithm_test/upper_bound.cpp           |  25 +-
 test/replace_copy.cpp                         |   0
 test/string.cpp                               |  58 +++-
 test/test_function/true_predicate.hpp         |  29 ++
 275 files changed, 7445 insertions(+), 5987 deletions(-)
 delete mode 100644 doc/html/range/reference/adaptors/adaptors_reference.html
 create mode 100644 doc/html/range/reference/algorithms/range_algorithm_introduction.html
 create mode 100644 doc/html/range/reference/overview.html
 delete mode 100755 doc/reference/adaptors/adjacent_filtered.html
 delete mode 100755 doc/reference/adaptors/copied.html
 delete mode 100755 doc/reference/adaptors/filtered.html
 delete mode 100755 doc/reference/adaptors/indexed.html
 delete mode 100755 doc/reference/adaptors/indirected.html
 delete mode 100755 doc/reference/adaptors/map_keys.html
 delete mode 100755 doc/reference/adaptors/map_values.html
 delete mode 100755 doc/reference/adaptors/replaced.html
 delete mode 100755 doc/reference/adaptors/replaced_if.html
 delete mode 100755 doc/reference/adaptors/reversed.html
 delete mode 100755 doc/reference/adaptors/sliced.html
 delete mode 100755 doc/reference/adaptors/strided.html
 delete mode 100755 doc/reference/adaptors/tokenized.html
 delete mode 100755 doc/reference/adaptors/transformed.html
 delete mode 100755 doc/reference/adaptors/uniqued.html
 create mode 100644 test/algorithm_test/copy_n.cpp
 create mode 100644 test/algorithm_test/remove_copy.cpp
 create mode 100644 test/algorithm_test/remove_copy_if.cpp
 create mode 100644 test/algorithm_test/replace_copy.cpp
 create mode 100644 test/algorithm_test/replace_copy_if.cpp
 create mode 100644 test/algorithm_test/reverse_copy.cpp
 create mode 100644 test/algorithm_test/rotate_copy.cpp
 create mode 100644 test/algorithm_test/search_n.cpp
 create mode 100644 test/algorithm_test/swap_ranges.cpp
 create mode 100644 test/algorithm_test/unique_copy.cpp
 create mode 100644 test/replace_copy.cpp
 create mode 100644 test/test_function/true_predicate.hpp

diff --git a/doc/history_ack.qbk b/doc/history_ack.qbk
index 545b3ab..73ce9e8 100644
--- a/doc/history_ack.qbk
+++ b/doc/history_ack.qbk
@@ -26,11 +26,18 @@ the result of a merge of all of the RangeEx features into Boost.Range.
 There were an enormous number of very significant contributors through all
 stages of this library.
 
+Prior to Boost.RangeEx there had been a number of Range library implementations,
+these include library implementations by Eric Niebler, Adobe,
+Shunsuke Sogame etc. Eric Niebler contributed the Range Adaptor idea which is
+arguably the single biggest innovation in this library. Inevitably a great deal
+of commonality evolved in each of these libraries, but a considerable amount
+of effort was expended to learn from all of the divergent techniques.
+
 The people in the following list all made contributions in the form of reviews,
 user feedback, design suggestions, or defect detection:
 
 * Thorsten Ottosen: review management, design advice, documentation feedback
-* Eric Niebler:     feedback
+* Eric Niebler:     early implementation, and review feedback
 * Joel de Guzman:   review
 * Mathias Gaunard:  review
 * David Abrahams:   implementation advice
diff --git a/doc/html/index.html b/doc/html/index.html
index f6095bd..90355b6 100644
--- a/doc/html/index.html
+++ b/doc/html/index.html
@@ -2,8 +2,8 @@
 <head>
 <meta http-equiv="Content-Type" content="text/html; charset=US-ASCII">
 <title>Chapter&#160;1.&#160;Range 2.0</title>
-<link rel="stylesheet" href="../../../../doc/html/boostbook.css" type="text/css">
-<meta name="generator" content="DocBook XSL Stylesheets V1.75.1">
+<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="next" href="range/introduction.html" title="Introduction">
 </head>
@@ -11,14 +11,14 @@
 <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="../../../libraries.htm">Libraries</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="n" href="range/introduction.html"><img src="../../../../doc/html/images/next.png" alt="Next"></a></div>
-<div class="chapter" title="Chapter&#160;1.&#160;Range 2.0">
+<div class="spirit-nav"><a accesskey="n" href="range/introduction.html"><img src="../../../../doc/src/images/next.png" alt="Next"></a></div>
+<div class="chapter">
 <div class="titlepage"><div>
 <div><h2 class="title">
 <a name="range"></a>Chapter&#160;1.&#160;Range 2.0</h2></div>
@@ -29,8 +29,8 @@
 <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><div class="legalnotice" title="Legal Notice">
-<a name="id2680258"></a><p>
+<div><div class="legalnotice">
+<a name="id3255322"></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>
@@ -142,10 +142,10 @@
   </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: April 28, 2010 at 17:51:33 GMT</small></p></td>
+<td align="left"><p><small>Last revised: July 17, 2010 at 19:34:42 GMT</small></p></td>
 <td align="right"><div class="copyright-footer"></div></td>
 </tr></table>
 <hr>
-<div class="spirit-nav"><a accesskey="n" href="range/introduction.html"><img src="../../../../doc/html/images/next.png" alt="Next"></a></div>
+<div class="spirit-nav"><a accesskey="n" href="range/introduction.html"><img src="../../../../doc/src/images/next.png" alt="Next"></a></div>
 </body>
 </html>
diff --git a/doc/html/range/concepts.html b/doc/html/range/concepts.html
index c384122..b071de6 100644
--- a/doc/html/range/concepts.html
+++ b/doc/html/range/concepts.html
@@ -2,8 +2,8 @@
 <head>
 <meta http-equiv="Content-Type" content="text/html; charset=US-ASCII">
 <title>Range Concepts</title>
-<link rel="stylesheet" href="../../../../../doc/html/boostbook.css" type="text/css">
-<meta name="generator" content="DocBook XSL Stylesheets V1.75.1">
+<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="../index.html" title="Chapter&#160;1.&#160;Range 2.0">
 <link rel="prev" href="introduction.html" title="Introduction">
@@ -13,16 +13,16 @@
 <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="../../../../libraries.htm">Libraries</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="introduction.html"><img src="../../../../../doc/html/images/prev.png" alt="Prev"></a><a accesskey="u" href="../index.html"><img src="../../../../../doc/html/images/up.png" alt="Up"></a><a accesskey="h" href="../index.html"><img src="../../../../../doc/html/images/home.png" alt="Home"></a><a accesskey="n" href="concepts/overview.html"><img src="../../../../../doc/html/images/next.png" alt="Next"></a>
+<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" title="Range Concepts">
+<div class="section">
 <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>
@@ -45,7 +45,7 @@
 </tr></table>
 <hr>
 <div class="spirit-nav">
-<a accesskey="p" href="introduction.html"><img src="../../../../../doc/html/images/prev.png" alt="Prev"></a><a accesskey="u" href="../index.html"><img src="../../../../../doc/html/images/up.png" alt="Up"></a><a accesskey="h" href="../index.html"><img src="../../../../../doc/html/images/home.png" alt="Home"></a><a accesskey="n" href="concepts/overview.html"><img src="../../../../../doc/html/images/next.png" alt="Next"></a>
+<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>
 </body>
 </html>
diff --git a/doc/html/range/concepts/bidirectional_range.html b/doc/html/range/concepts/bidirectional_range.html
index 72c8c28..a8decd6 100644
--- a/doc/html/range/concepts/bidirectional_range.html
+++ b/doc/html/range/concepts/bidirectional_range.html
@@ -2,8 +2,8 @@
 <head>
 <meta http-equiv="Content-Type" content="text/html; charset=US-ASCII">
 <title>Bidirectional Range</title>
-<link rel="stylesheet" href="../../../../../../doc/html/boostbook.css" type="text/css">
-<meta name="generator" content="DocBook XSL Stylesheets V1.75.1">
+<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="../concepts.html" title="Range Concepts">
 <link rel="prev" href="forward_range.html" title="Forward Range">
@@ -13,21 +13,21 @@
 <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="../../../../../libraries.htm">Libraries</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="forward_range.html"><img src="../../../../../../doc/html/images/prev.png" alt="Prev"></a><a accesskey="u" href="../concepts.html"><img src="../../../../../../doc/html/images/up.png" alt="Up"></a><a accesskey="h" href="../../index.html"><img src="../../../../../../doc/html/images/home.png" alt="Home"></a><a accesskey="n" href="random_access_range.html"><img src="../../../../../../doc/html/images/next.png" alt="Next"></a>
+<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" title="Bidirectional Range">
+<div class="section">
 <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="id2692676"></a>
+<a name="id3266571"></a>
         <a class="link" href="bidirectional_range.html#range.concepts.bidirectional_range.notation">Notation</a>
       </h5>
 <div class="informaltable"><table class="table">
@@ -65,7 +65,7 @@
 </tbody>
 </table></div>
 <a name="range.concepts.bidirectional_range.description"></a><h5>
-<a name="id2692774"></a>
+<a name="id3266668"></a>
         <a class="link" href="bidirectional_range.html#range.concepts.bidirectional_range.description">Description</a>
       </h5>
 <p>
@@ -75,7 +75,7 @@
         Traversal Iterator</a>.
       </p>
 <a name="range.concepts.bidirectional_range.refinement_of"></a><h5>
-<a name="id2692840"></a>
+<a name="id3266734"></a>
         <a class="link" href="bidirectional_range.html#range.concepts.bidirectional_range.refinement_of">Refinement
         of</a>
       </h5>
@@ -83,7 +83,7 @@
         <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="id2692868"></a>
+<a name="id3266763"></a>
         <a class="link" href="bidirectional_range.html#range.concepts.bidirectional_range.associated_types">Associated
         types</a>
       </h5>
@@ -136,7 +136,7 @@
 </tbody>
 </table></div>
 <a name="range.concepts.bidirectional_range.valid_expressions"></a><h5>
-<a name="id2693034"></a>
+<a name="id3266927"></a>
         <a class="link" href="bidirectional_range.html#range.concepts.bidirectional_range.valid_expressions">Valid
         expressions</a>
       </h5>
@@ -221,7 +221,7 @@
 </tbody>
 </table></div>
 <a name="range.concepts.bidirectional_range.complexity_guarantees"></a><h5>
-<a name="id2693513"></a>
+<a name="id3267406"></a>
         <a class="link" href="bidirectional_range.html#range.concepts.bidirectional_range.complexity_guarantees">Complexity
         guarantees</a>
       </h5>
@@ -232,7 +232,7 @@
         <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="id2693664"></a>
+<a name="id3267557"></a>
         <a class="link" href="bidirectional_range.html#range.concepts.bidirectional_range.invariants">Invariants</a>
       </h5>
 <div class="informaltable"><table class="table">
@@ -272,7 +272,7 @@
 </tbody>
 </table></div>
 <a name="range.concepts.bidirectional_range.see_also"></a><h5>
-<a name="id2693925"></a>
+<a name="id3267818"></a>
         <a class="link" href="bidirectional_range.html#range.concepts.bidirectional_range.see_also">See also</a>
       </h5>
 <p>
@@ -294,7 +294,7 @@
 </tr></table>
 <hr>
 <div class="spirit-nav">
-<a accesskey="p" href="forward_range.html"><img src="../../../../../../doc/html/images/prev.png" alt="Prev"></a><a accesskey="u" href="../concepts.html"><img src="../../../../../../doc/html/images/up.png" alt="Up"></a><a accesskey="h" href="../../index.html"><img src="../../../../../../doc/html/images/home.png" alt="Home"></a><a accesskey="n" href="random_access_range.html"><img src="../../../../../../doc/html/images/next.png" alt="Next"></a>
+<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>
 </body>
 </html>
diff --git a/doc/html/range/concepts/concept_checking.html b/doc/html/range/concepts/concept_checking.html
index 30d3850..ca397ff 100644
--- a/doc/html/range/concepts/concept_checking.html
+++ b/doc/html/range/concepts/concept_checking.html
@@ -2,8 +2,8 @@
 <head>
 <meta http-equiv="Content-Type" content="text/html; charset=US-ASCII">
 <title>Concept Checking</title>
-<link rel="stylesheet" href="../../../../../../doc/html/boostbook.css" type="text/css">
-<meta name="generator" content="DocBook XSL Stylesheets V1.75.1">
+<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="../concepts.html" title="Range Concepts">
 <link rel="prev" href="random_access_range.html" title="Random Access Range">
@@ -13,16 +13,16 @@
 <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="../../../../../libraries.htm">Libraries</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="random_access_range.html"><img src="../../../../../../doc/html/images/prev.png" alt="Prev"></a><a accesskey="u" href="../concepts.html"><img src="../../../../../../doc/html/images/up.png" alt="Up"></a><a accesskey="h" href="../../index.html"><img src="../../../../../../doc/html/images/home.png" alt="Home"></a><a accesskey="n" href="../reference.html"><img src="../../../../../../doc/html/images/next.png" alt="Next"></a>
+<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" title="Concept Checking">
+<div class="section">
 <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>
@@ -62,24 +62,24 @@
       </p>
 <div class="itemizedlist"><ul class="itemizedlist" type="disc">
 <li class="listitem">
-          Class SinglePassRangeConcept checks for <a class="link" href="single_pass_range.html" title="Single Pass Range">Single
-          Pass Range</a>
-</li>
+            Class SinglePassRangeConcept checks for <a class="link" href="single_pass_range.html" title="Single Pass Range">Single
+            Pass Range</a>
+          </li>
 <li class="listitem">
-          Class ForwardRangeConcept checks for <a class="link" href="forward_range.html" title="Forward Range">Forward
-          Range</a>
-</li>
+            Class ForwardRangeConcept checks for <a class="link" href="forward_range.html" title="Forward Range">Forward
+            Range</a>
+          </li>
 <li class="listitem">
-          Class BidirectionalRangeConcept checks for <a class="link" href="bidirectional_range.html" title="Bidirectional Range">Bidirectional
-          Range</a>
-</li>
+            Class BidirectionalRangeConcept checks for <a class="link" href="bidirectional_range.html" title="Bidirectional Range">Bidirectional
+            Range</a>
+          </li>
 <li class="listitem">
-          Class RandomAccessRangeConcept checks for <a class="link" href="random_access_range.html" title="Random Access Range">Random
-          Access Range</a>
-</li>
+            Class RandomAccessRangeConcept checks for <a class="link" href="random_access_range.html" title="Random Access Range">Random
+            Access Range</a>
+          </li>
 </ul></div>
 <a name="range.concepts.concept_checking.see_also"></a><h5>
-<a name="id2694938"></a>
+<a name="id3268844"></a>
         <a class="link" href="concept_checking.html#range.concepts.concept_checking.see_also">See also</a>
       </h5>
 <p>
@@ -102,7 +102,7 @@
 </tr></table>
 <hr>
 <div class="spirit-nav">
-<a accesskey="p" href="random_access_range.html"><img src="../../../../../../doc/html/images/prev.png" alt="Prev"></a><a accesskey="u" href="../concepts.html"><img src="../../../../../../doc/html/images/up.png" alt="Up"></a><a accesskey="h" href="../../index.html"><img src="../../../../../../doc/html/images/home.png" alt="Home"></a><a accesskey="n" href="../reference.html"><img src="../../../../../../doc/html/images/next.png" alt="Next"></a>
+<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>
 </body>
 </html>
diff --git a/doc/html/range/concepts/forward_range.html b/doc/html/range/concepts/forward_range.html
index 61ec9e8..1910a37 100644
--- a/doc/html/range/concepts/forward_range.html
+++ b/doc/html/range/concepts/forward_range.html
@@ -2,8 +2,8 @@
 <head>
 <meta http-equiv="Content-Type" content="text/html; charset=US-ASCII">
 <title>Forward Range</title>
-<link rel="stylesheet" href="../../../../../../doc/html/boostbook.css" type="text/css">
-<meta name="generator" content="DocBook XSL Stylesheets V1.75.1">
+<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="../concepts.html" title="Range Concepts">
 <link rel="prev" href="single_pass_range.html" title="Single Pass Range">
@@ -13,21 +13,21 @@
 <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="../../../../../libraries.htm">Libraries</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="single_pass_range.html"><img src="../../../../../../doc/html/images/prev.png" alt="Prev"></a><a accesskey="u" href="../concepts.html"><img src="../../../../../../doc/html/images/up.png" alt="Up"></a><a accesskey="h" href="../../index.html"><img src="../../../../../../doc/html/images/home.png" alt="Home"></a><a accesskey="n" href="bidirectional_range.html"><img src="../../../../../../doc/html/images/next.png" alt="Next"></a>
+<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" title="Forward Range">
+<div class="section">
 <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="id2692268"></a>
+<a name="id3266161"></a>
         <a class="link" href="forward_range.html#range.concepts.forward_range.notation">Notation</a>
       </h5>
 <div class="informaltable"><table class="table">
@@ -65,7 +65,7 @@
 </tbody>
 </table></div>
 <a name="range.concepts.forward_range.description"></a><h5>
-<a name="id2692364"></a>
+<a name="id3266257"></a>
         <a class="link" href="forward_range.html#range.concepts.forward_range.description">Description</a>
       </h5>
 <p>
@@ -73,14 +73,14 @@
         Traversal Iterator</a>.
       </p>
 <a name="range.concepts.forward_range.refinement_of"></a><h5>
-<a name="id2692436"></a>
+<a name="id3266329"></a>
         <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="id2692465"></a>
+<a name="id3266358"></a>
         <a class="link" href="forward_range.html#range.concepts.forward_range.associated_types">Associated
         types</a>
       </h5>
@@ -132,7 +132,7 @@
 </tbody>
 </table></div>
 <a name="range.concepts.forward_range.see_also"></a><h5>
-<a name="id2692622"></a>
+<a name="id3266515"></a>
         <a class="link" href="forward_range.html#range.concepts.forward_range.see_also">See also</a>
       </h5>
 <p>
@@ -154,7 +154,7 @@
 </tr></table>
 <hr>
 <div class="spirit-nav">
-<a accesskey="p" href="single_pass_range.html"><img src="../../../../../../doc/html/images/prev.png" alt="Prev"></a><a accesskey="u" href="../concepts.html"><img src="../../../../../../doc/html/images/up.png" alt="Up"></a><a accesskey="h" href="../../index.html"><img src="../../../../../../doc/html/images/home.png" alt="Home"></a><a accesskey="n" href="bidirectional_range.html"><img src="../../../../../../doc/html/images/next.png" alt="Next"></a>
+<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>
 </body>
 </html>
diff --git a/doc/html/range/concepts/overview.html b/doc/html/range/concepts/overview.html
index 7cd19e8..0fa9643 100644
--- a/doc/html/range/concepts/overview.html
+++ b/doc/html/range/concepts/overview.html
@@ -2,8 +2,8 @@
 <head>
 <meta http-equiv="Content-Type" content="text/html; charset=US-ASCII">
 <title>Overview</title>
-<link rel="stylesheet" href="../../../../../../doc/html/boostbook.css" type="text/css">
-<meta name="generator" content="DocBook XSL Stylesheets V1.75.1">
+<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="../concepts.html" title="Range Concepts">
 <link rel="prev" href="../concepts.html" title="Range Concepts">
@@ -13,16 +13,16 @@
 <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="../../../../../libraries.htm">Libraries</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="../concepts.html"><img src="../../../../../../doc/html/images/prev.png" alt="Prev"></a><a accesskey="u" href="../concepts.html"><img src="../../../../../../doc/html/images/up.png" alt="Up"></a><a accesskey="h" href="../../index.html"><img src="../../../../../../doc/html/images/home.png" alt="Home"></a><a accesskey="n" href="single_pass_range.html"><img src="../../../../../../doc/html/images/next.png" alt="Next"></a>
+<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" title="Overview">
+<div class="section">
 <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>
@@ -41,11 +41,11 @@
       </p>
 <div class="itemizedlist"><ul class="itemizedlist" type="disc">
 <li class="listitem">
-          own the elements that can be accessed through it,
-        </li>
+            own the elements that can be accessed through it,
+          </li>
 <li class="listitem">
-          have copy semantics,
-        </li>
+            have copy semantics,
+          </li>
 </ul></div>
 <p>
         Because of the second requirement, a Range object must be passed by (const
@@ -73,7 +73,7 @@
 </tr></table>
 <hr>
 <div class="spirit-nav">
-<a accesskey="p" href="../concepts.html"><img src="../../../../../../doc/html/images/prev.png" alt="Prev"></a><a accesskey="u" href="../concepts.html"><img src="../../../../../../doc/html/images/up.png" alt="Up"></a><a accesskey="h" href="../../index.html"><img src="../../../../../../doc/html/images/home.png" alt="Home"></a><a accesskey="n" href="single_pass_range.html"><img src="../../../../../../doc/html/images/next.png" alt="Next"></a>
+<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>
 </body>
 </html>
diff --git a/doc/html/range/concepts/random_access_range.html b/doc/html/range/concepts/random_access_range.html
index 379410e..05cbdc0 100644
--- a/doc/html/range/concepts/random_access_range.html
+++ b/doc/html/range/concepts/random_access_range.html
@@ -2,8 +2,8 @@
 <head>
 <meta http-equiv="Content-Type" content="text/html; charset=US-ASCII">
 <title>Random Access Range</title>
-<link rel="stylesheet" href="../../../../../../doc/html/boostbook.css" type="text/css">
-<meta name="generator" content="DocBook XSL Stylesheets V1.75.1">
+<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="../concepts.html" title="Range Concepts">
 <link rel="prev" href="bidirectional_range.html" title="Bidirectional Range">
@@ -13,21 +13,21 @@
 <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="../../../../../libraries.htm">Libraries</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="bidirectional_range.html"><img src="../../../../../../doc/html/images/prev.png" alt="Prev"></a><a accesskey="u" href="../concepts.html"><img src="../../../../../../doc/html/images/up.png" alt="Up"></a><a accesskey="h" href="../../index.html"><img src="../../../../../../doc/html/images/home.png" alt="Home"></a><a accesskey="n" href="concept_checking.html"><img src="../../../../../../doc/html/images/next.png" alt="Next"></a>
+<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" title="Random Access Range">
+<div class="section">
 <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="id2693982"></a>
+<a name="id3267875"></a>
         <a class="link" href="random_access_range.html#range.concepts.random_access_range.description">Description</a>
       </h5>
 <p>
@@ -35,7 +35,7 @@
         Access Traversal Iterator</a>.
       </p>
 <a name="range.concepts.random_access_range.refinement_of"></a><h5>
-<a name="id2694053"></a>
+<a name="id3267947"></a>
         <a class="link" href="random_access_range.html#range.concepts.random_access_range.refinement_of">Refinement
         of</a>
       </h5>
@@ -43,7 +43,7 @@
         <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="id2694081"></a>
+<a name="id3267975"></a>
         <a class="link" href="random_access_range.html#range.concepts.random_access_range.valid_expressions">Valid
         expressions</a>
       </h5>
@@ -89,7 +89,7 @@
 </tr></tbody>
 </table></div>
 <a name="range.concepts.random_access_range.expression_semantics"></a><h5>
-<a name="id2694229"></a>
+<a name="id3268122"></a>
         <a class="link" href="random_access_range.html#range.concepts.random_access_range.expression_semantics">Expression
         semantics</a>
       </h5>
@@ -139,7 +139,7 @@
 </tr></tbody>
 </table></div>
 <a name="range.concepts.random_access_range.complexity_guarantees"></a><h5>
-<a name="id2694455"></a>
+<a name="id3268348"></a>
         <a class="link" href="random_access_range.html#range.concepts.random_access_range.complexity_guarantees">Complexity
         guarantees</a>
       </h5>
@@ -147,7 +147,7 @@
         <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="id2694508"></a>
+<a name="id3268402"></a>
         <a class="link" href="random_access_range.html#range.concepts.random_access_range.invariants">Invariants</a>
       </h5>
 <div class="informaltable"><table class="table">
@@ -181,7 +181,7 @@
 </tr></table>
 <hr>
 <div class="spirit-nav">
-<a accesskey="p" href="bidirectional_range.html"><img src="../../../../../../doc/html/images/prev.png" alt="Prev"></a><a accesskey="u" href="../concepts.html"><img src="../../../../../../doc/html/images/up.png" alt="Up"></a><a accesskey="h" href="../../index.html"><img src="../../../../../../doc/html/images/home.png" alt="Home"></a><a accesskey="n" href="concept_checking.html"><img src="../../../../../../doc/html/images/next.png" alt="Next"></a>
+<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>
 </body>
 </html>
diff --git a/doc/html/range/concepts/single_pass_range.html b/doc/html/range/concepts/single_pass_range.html
index 32bcef4..a2372ac 100644
--- a/doc/html/range/concepts/single_pass_range.html
+++ b/doc/html/range/concepts/single_pass_range.html
@@ -2,8 +2,8 @@
 <head>
 <meta http-equiv="Content-Type" content="text/html; charset=US-ASCII">
 <title>Single Pass Range</title>
-<link rel="stylesheet" href="../../../../../../doc/html/boostbook.css" type="text/css">
-<meta name="generator" content="DocBook XSL Stylesheets V1.75.1">
+<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="../concepts.html" title="Range Concepts">
 <link rel="prev" href="overview.html" title="Overview">
@@ -13,21 +13,21 @@
 <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="../../../../../libraries.htm">Libraries</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="overview.html"><img src="../../../../../../doc/html/images/prev.png" alt="Prev"></a><a accesskey="u" href="../concepts.html"><img src="../../../../../../doc/html/images/up.png" alt="Up"></a><a accesskey="h" href="../../index.html"><img src="../../../../../../doc/html/images/home.png" alt="Home"></a><a accesskey="n" href="forward_range.html"><img src="../../../../../../doc/html/images/next.png" alt="Next"></a>
+<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" title="Single Pass Range">
+<div class="section">
 <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="id2690886"></a>
+<a name="id3214203"></a>
         <a class="link" href="single_pass_range.html#range.concepts.single_pass_range.notation">Notation</a>
       </h5>
 <div class="informaltable"><table class="table">
@@ -65,7 +65,7 @@
 </tbody>
 </table></div>
 <a name="range.concepts.single_pass_range.description"></a><h5>
-<a name="id2690988"></a>
+<a name="id3214311"></a>
         <a class="link" href="single_pass_range.html#range.concepts.single_pass_range.description">Description</a>
       </h5>
 <p>
@@ -73,7 +73,7 @@
         Pass Iterator</a>.
       </p>
 <a name="range.concepts.single_pass_range.associated_types"></a><h5>
-<a name="id2691060"></a>
+<a name="id3264954"></a>
         <a class="link" href="single_pass_range.html#range.concepts.single_pass_range.associated_types">Associated
         types</a>
       </h5>
@@ -126,7 +126,7 @@
 </tbody>
 </table></div>
 <a name="range.concepts.single_pass_range.valid_expressions"></a><h5>
-<a name="id2691234"></a>
+<a name="id3265128"></a>
         <a class="link" href="single_pass_range.html#range.concepts.single_pass_range.valid_expressions">Valid
         expressions</a>
       </h5>
@@ -198,7 +198,7 @@
 </tbody>
 </table></div>
 <a name="range.concepts.single_pass_range.expression_semantics"></a><h5>
-<a name="id2691568"></a>
+<a name="id3265461"></a>
         <a class="link" href="single_pass_range.html#range.concepts.single_pass_range.expression_semantics">Expression
         semantics</a>
       </h5>
@@ -266,7 +266,7 @@
 </tbody>
 </table></div>
 <a name="range.concepts.single_pass_range.complexity_guarantees"></a><h5>
-<a name="id2691839"></a>
+<a name="id3265731"></a>
         <a class="link" href="single_pass_range.html#range.concepts.single_pass_range.complexity_guarantees">Complexity
         guarantees</a>
       </h5>
@@ -276,7 +276,7 @@
         constant time.
       </p>
 <a name="range.concepts.single_pass_range.invariants"></a><h5>
-<a name="id2691922"></a>
+<a name="id3265815"></a>
         <a class="link" href="single_pass_range.html#range.concepts.single_pass_range.invariants">Invariants</a>
       </h5>
 <div class="informaltable"><table class="table">
@@ -316,7 +316,7 @@
 </tbody>
 </table></div>
 <a name="range.concepts.single_pass_range.see_also"></a><h5>
-<a name="id2692193"></a>
+<a name="id3266086"></a>
         <a class="link" href="single_pass_range.html#range.concepts.single_pass_range.see_also">See also</a>
       </h5>
 <p>
@@ -344,7 +344,7 @@
 </tr></table>
 <hr>
 <div class="spirit-nav">
-<a accesskey="p" href="overview.html"><img src="../../../../../../doc/html/images/prev.png" alt="Prev"></a><a accesskey="u" href="../concepts.html"><img src="../../../../../../doc/html/images/up.png" alt="Up"></a><a accesskey="h" href="../../index.html"><img src="../../../../../../doc/html/images/home.png" alt="Home"></a><a accesskey="n" href="forward_range.html"><img src="../../../../../../doc/html/images/next.png" alt="Next"></a>
+<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>
 </body>
 </html>
diff --git a/doc/html/range/examples.html b/doc/html/range/examples.html
index 4be5b97..14aad79 100644
--- a/doc/html/range/examples.html
+++ b/doc/html/range/examples.html
@@ -2,8 +2,8 @@
 <head>
 <meta http-equiv="Content-Type" content="text/html; charset=US-ASCII">
 <title>Examples</title>
-<link rel="stylesheet" href="../../../../../doc/html/boostbook.css" type="text/css">
-<meta name="generator" content="DocBook XSL Stylesheets V1.75.1">
+<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="../index.html" title="Chapter&#160;1.&#160;Range 2.0">
 <link rel="prev" href="library_headers/algorithm_extensions.html" title="Algorithm Extensions">
@@ -13,16 +13,16 @@
 <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="../../../../libraries.htm">Libraries</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="library_headers/algorithm_extensions.html"><img src="../../../../../doc/html/images/prev.png" alt="Prev"></a><a accesskey="u" href="../index.html"><img src="../../../../../doc/html/images/up.png" alt="Up"></a><a accesskey="h" href="../index.html"><img src="../../../../../doc/html/images/home.png" alt="Home"></a><a accesskey="n" href="mfc_atl.html"><img src="../../../../../doc/html/images/next.png" alt="Next"></a>
+<a accesskey="p" href="library_headers/algorithm_extensions.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" title="Examples">
+<div class="section">
 <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>
@@ -31,19 +31,31 @@
     </p>
 <div class="itemizedlist"><ul class="itemizedlist" type="disc">
 <li class="listitem">
-<a href="http://www.boost.org/libs/range/test/string.cpp" target="_top">string.cpp</a>
-        shows how to implement a container version of <code class="computeroutput"><span class="identifier">std</span><span class="special">::</span><span class="identifier">find</span><span class="special">()</span></code> that works with <code class="computeroutput"><span class="keyword">char</span><span class="special">[]</span></code>,<code class="computeroutput"><span class="keyword">wchar_t</span><span class="special">[]</span></code>,<code class="computeroutput"><span class="keyword">char</span><span class="special">*</span></code>,<code class="computeroutput"><span class="keyword">wchar_t</span><span class="special">*</span></code>.
-      </li>
+          <a href="http://www.boost.org/libs/range/test/string.cpp" target="_top">string.cpp</a>
+          shows how to implement a container version of <code class="computeroutput"><span class="identifier">std</span><span class="special">::</span><span class="identifier">find</span><span class="special">()</span></code> that works with <code class="computeroutput"><span class="keyword">char</span><span class="special">[]</span></code>,<code class="computeroutput"><span class="keyword">wchar_t</span><span class="special">[]</span></code>,<code class="computeroutput"><span class="keyword">char</span><span class="special">*</span></code>,<code class="computeroutput"><span class="keyword">wchar_t</span><span class="special">*</span></code>.
+        </li>
 <li class="listitem">
-<a href="http://www.boost.org/libs/range/test/algorithm_example.cpp" target="_top">algorithm_example.cpp</a>
-        shows the replace example from the introduction.
-      </li>
-<li class="listitem"><a href="http://www.boost.org/libs/range/test/iterator_range.cpp" target="_top">iterator_range.cpp</a></li>
-<li class="listitem"><a href="http://www.boost.org/libs/range/test/sub_range.cpp" target="_top">sub_range.cpp</a></li>
-<li class="listitem"><a href="http://www.boost.org/libs/range/test/iterator_pair.cpp" target="_top">iterator_pair.cpp</a></li>
-<li class="listitem"><a href="http://www.boost.org/libs/range/test/reversible_range.cpp" target="_top">reversible_range.cpp</a></li>
-<li class="listitem"><a href="http://www.boost.org/libs/range/test/std_container.cpp" target="_top">std_container.cpp</a></li>
-<li class="listitem"><a href="http://www.boost.org/libs/range/test/array.cpp" target="_top">array.cpp</a></li>
+          <a href="http://www.boost.org/libs/range/test/algorithm_example.cpp" target="_top">algorithm_example.cpp</a>
+          shows the replace example from the introduction.
+        </li>
+<li class="listitem">
+          <a href="http://www.boost.org/libs/range/test/iterator_range.cpp" target="_top">iterator_range.cpp</a>
+        </li>
+<li class="listitem">
+          <a href="http://www.boost.org/libs/range/test/sub_range.cpp" target="_top">sub_range.cpp</a>
+        </li>
+<li class="listitem">
+          <a href="http://www.boost.org/libs/range/test/iterator_pair.cpp" target="_top">iterator_pair.cpp</a>
+        </li>
+<li class="listitem">
+          <a href="http://www.boost.org/libs/range/test/reversible_range.cpp" target="_top">reversible_range.cpp</a>
+        </li>
+<li class="listitem">
+          <a href="http://www.boost.org/libs/range/test/std_container.cpp" target="_top">std_container.cpp</a>
+        </li>
+<li class="listitem">
+          <a href="http://www.boost.org/libs/range/test/array.cpp" target="_top">array.cpp</a>
+        </li>
 </ul></div>
 </div>
 <table xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" width="100%"><tr>
@@ -56,7 +68,7 @@
 </tr></table>
 <hr>
 <div class="spirit-nav">
-<a accesskey="p" href="library_headers/algorithm_extensions.html"><img src="../../../../../doc/html/images/prev.png" alt="Prev"></a><a accesskey="u" href="../index.html"><img src="../../../../../doc/html/images/up.png" alt="Up"></a><a accesskey="h" href="../index.html"><img src="../../../../../doc/html/images/home.png" alt="Home"></a><a accesskey="n" href="mfc_atl.html"><img src="../../../../../doc/html/images/next.png" alt="Next"></a>
+<a accesskey="p" href="library_headers/algorithm_extensions.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>
 </body>
 </html>
diff --git a/doc/html/range/faq.html b/doc/html/range/faq.html
index cb21529..6a689f1 100644
--- a/doc/html/range/faq.html
+++ b/doc/html/range/faq.html
@@ -2,8 +2,8 @@
 <head>
 <meta http-equiv="Content-Type" content="text/html; charset=US-ASCII">
 <title>FAQ</title>
-<link rel="stylesheet" href="../../../../../doc/html/boostbook.css" type="text/css">
-<meta name="generator" content="DocBook XSL Stylesheets V1.75.1">
+<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="../index.html" title="Chapter&#160;1.&#160;Range 2.0">
 <link rel="prev" href="portability.html" title="Portability">
@@ -13,16 +13,16 @@
 <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="../../../../libraries.htm">Libraries</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="portability.html"><img src="../../../../../doc/html/images/prev.png" alt="Prev"></a><a accesskey="u" href="../index.html"><img src="../../../../../doc/html/images/up.png" alt="Up"></a><a accesskey="h" href="../index.html"><img src="../../../../../doc/html/images/home.png" alt="Home"></a><a accesskey="n" href="history_ack.html"><img src="../../../../../doc/html/images/next.png" alt="Next"></a>
+<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" title="FAQ">
+<div class="section">
 <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>
@@ -31,84 +31,47 @@
       and <code class="computeroutput"><span class="identifier">range_const_iterator</span><span class="special">&lt;</span><span class="identifier">C</span><span class="special">&gt;::</span><span class="identifier">type</span></code>
       for <code class="computeroutput"><span class="identifier">std</span><span class="special">::</span><span class="identifier">pair</span><span class="special">&lt;</span><span class="identifier">iterator</span><span class="special">,</span> <span class="identifier">iterator</span><span class="special">&gt;</span></code>?</strong></span></em></span>
     </p>
-<div class="blockquote"><blockquote class="blockquote">
-<p>
-        </p>
-<p>
-          In general it is not possible nor desirable to find a corresponding <code class="computeroutput"><span class="identifier">const_iterator</span></code>. When it is possible to
-          come up with one, the client might choose to construct a <code class="computeroutput"><span class="identifier">std</span><span class="special">::</span><span class="identifier">pair</span><span class="special">&lt;</span><span class="identifier">const_iterator</span><span class="special">,</span><span class="identifier">const_iterator</span><span class="special">&gt;</span></code>
-          object.
-        </p>
-<p>
-      </p>
-</blockquote></div>
-<div class="blockquote"><blockquote class="blockquote">
-<p>
-        </p>
-<p>
-          Note that an <a class="link" href="reference/utilities/iterator_range.html" title="Class iterator_range"><code class="computeroutput"><span class="identifier">iterator_range</span></code></a> is somewhat more
-          convenient than a <code class="computeroutput"><span class="identifier">pair</span></code>
-          and that a <a class="link" href="reference/utilities/sub_range.html" title="Class sub_range"><code class="computeroutput"><span class="identifier">sub_range</span></code></a> does propagate const-ness.
-        </p>
-<p>
-      </p>
-</blockquote></div>
+<div class="blockquote"><blockquote class="blockquote"><p>
+        In general it is not possible nor desirable to find a corresponding <code class="computeroutput"><span class="identifier">const_iterator</span></code>. When it is possible to
+        come up with one, the client might choose to construct a <code class="computeroutput"><span class="identifier">std</span><span class="special">::</span><span class="identifier">pair</span><span class="special">&lt;</span><span class="identifier">const_iterator</span><span class="special">,</span><span class="identifier">const_iterator</span><span class="special">&gt;</span></code> object.
+      </p></blockquote></div>
+<div class="blockquote"><blockquote class="blockquote"><p>
+        Note that an <a class="link" href="reference/utilities/iterator_range.html" title="Class iterator_range"><code class="computeroutput"><span class="identifier">iterator_range</span></code></a> is somewhat more
+        convenient than a <code class="computeroutput"><span class="identifier">pair</span></code> and
+        that a <a class="link" href="reference/utilities/sub_range.html" title="Class sub_range"><code class="computeroutput"><span class="identifier">sub_range</span></code></a> does propagate const-ness.
+      </p></blockquote></div>
 <p>
       2. <span class="emphasis"><em><span class="bold"><strong>Why is there not supplied more types or
       more functions?</strong></span></em></span>
     </p>
-<div class="blockquote"><blockquote class="blockquote">
-<p>
-        </p>
-<p>
-          The library has been kept small because its current interface will serve
-          most purposes. If and when a genuine need arises for more functionality,
-          it can be implemented.
-        </p>
-<p>
-      </p>
-</blockquote></div>
+<div class="blockquote"><blockquote class="blockquote"><p>
+        The library has been kept small because its current interface will serve
+        most purposes. If and when a genuine need arises for more functionality,
+        it can be implemented.
+      </p></blockquote></div>
 <p>
       3. <span class="emphasis"><em><span class="bold"><strong>How should I implement generic algorithms
       for ranges?</strong></span></em></span>
     </p>
-<div class="blockquote"><blockquote class="blockquote">
-<p>
-        </p>
-<p>
-          One should always start with a generic algorithm that takes two iterators
-          (or more) as input. Then use Boost.Range to build handier versions on top
-          of the iterator based algorithm. Please notice that once the range version
-          of the algorithm is done, it makes sense not to expose the iterator version
-          in the public interface.
-        </p>
-<p>
-      </p>
-</blockquote></div>
+<div class="blockquote"><blockquote class="blockquote"><p>
+        One should always start with a generic algorithm that takes two iterators
+        (or more) as input. Then use Boost.Range to build handier versions on top
+        of the iterator based algorithm. Please notice that once the range version
+        of the algorithm is done, it makes sense not to expose the iterator version
+        in the public interface.
+      </p></blockquote></div>
 <p>
       4. <span class="emphasis"><em><span class="bold"><strong>Why is there no Incrementable Range concept?</strong></span></em></span>
     </p>
-<div class="blockquote"><blockquote class="blockquote">
-<p>
-        </p>
-<p>
-          Even though we speak of incrementable iterators, it would not make much
-          sense for ranges; for example, we cannot determine the size and emptiness
-          of a range since we cannot even compare its iterators.
-        </p>
-<p>
-      </p>
-</blockquote></div>
-<div class="blockquote"><blockquote class="blockquote">
-<p>
-        </p>
-<p>
-          Note also that incrementable iterators are derived from output iterators
-          and so there exist no output range.
-        </p>
-<p>
-      </p>
-</blockquote></div>
+<div class="blockquote"><blockquote class="blockquote"><p>
+        Even though we speak of incrementable iterators, it would not make much sense
+        for ranges; for example, we cannot determine the size and emptiness of a
+        range since we cannot even compare its iterators.
+      </p></blockquote></div>
+<div class="blockquote"><blockquote class="blockquote"><p>
+        Note also that incrementable iterators are derived from output iterators
+        and so there exist no output range.
+      </p></blockquote></div>
 </div>
 <table xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" width="100%"><tr>
 <td align="left"></td>
@@ -120,7 +83,7 @@
 </tr></table>
 <hr>
 <div class="spirit-nav">
-<a accesskey="p" href="portability.html"><img src="../../../../../doc/html/images/prev.png" alt="Prev"></a><a accesskey="u" href="../index.html"><img src="../../../../../doc/html/images/up.png" alt="Up"></a><a accesskey="h" href="../index.html"><img src="../../../../../doc/html/images/home.png" alt="Home"></a><a accesskey="n" href="history_ack.html"><img src="../../../../../doc/html/images/next.png" alt="Next"></a>
+<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>
 </body>
 </html>
diff --git a/doc/html/range/history_ack.html b/doc/html/range/history_ack.html
index 37d497d..66191b9 100644
--- a/doc/html/range/history_ack.html
+++ b/doc/html/range/history_ack.html
@@ -2,8 +2,8 @@
 <head>
 <meta http-equiv="Content-Type" content="text/html; charset=US-ASCII">
 <title>History and Acknowledgement</title>
-<link rel="stylesheet" href="../../../../../doc/html/boostbook.css" type="text/css">
-<meta name="generator" content="DocBook XSL Stylesheets V1.75.1">
+<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="../index.html" title="Chapter&#160;1.&#160;Range 2.0">
 <link rel="prev" href="faq.html" title="FAQ">
@@ -12,21 +12,21 @@
 <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="../../../../libraries.htm">Libraries</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="faq.html"><img src="../../../../../doc/html/images/prev.png" alt="Prev"></a><a accesskey="u" href="../index.html"><img src="../../../../../doc/html/images/up.png" alt="Up"></a><a accesskey="h" href="../index.html"><img src="../../../../../doc/html/images/home.png" alt="Home"></a>
+<a accesskey="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" title="History and Acknowledgement">
+<div class="section">
 <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="id2824280"></a>
+<a name="id3400213"></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>
@@ -60,26 +60,26 @@
     </p>
 <div class="itemizedlist"><ul class="itemizedlist" type="disc">
 <li class="listitem">
-        Pavol Droba for help with documentation and implementation
-      </li>
+          Pavol Droba for help with documentation and implementation
+        </li>
 <li class="listitem">
-        Pavel Vozenilek for help with porting the library
-      </li>
+          Pavel Vozenilek for help with porting the library
+        </li>
 <li class="listitem">
-        Jonathan Turkanis and John Torjo for help with documentation
-      </li>
+          Jonathan Turkanis and John Torjo for help with documentation
+        </li>
 <li class="listitem">
-        Hartmut Kaiser for being review manager
-      </li>
+          Hartmut Kaiser for being review manager
+        </li>
 <li class="listitem">
-        Jonathan Turkanis for porting the lib (as far sa possible) to vc6 and vc7.
-      </li>
+          Jonathan Turkanis for porting the lib (as far sa possible) to vc6 and vc7.
+        </li>
 </ul></div>
 <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="id2824384"></a>
+<a name="id3213698"></a>
       <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>
@@ -91,41 +91,49 @@
       There were an enormous number of very significant contributors through all
       stages of this library.
     </p>
+<p>
+      Prior to Boost.RangeEx there had been a number of Range library implementations,
+      these include library implementations by Eric Niebler, Adobe, Shunsuke Sogame
+      etc. Eric Niebler contributed the Range Adaptor idea which is arguably the
+      single biggest innovation in this library. Inevitably a great deal of commonality
+      evolved in each of these libraries, but a considerable amount of effort was
+      expended to learn from all of the divergent techniques.
+    </p>
 <p>
       The people in the following list all made contributions in the form of reviews,
       user feedback, design suggestions, or defect detection:
     </p>
 <div class="itemizedlist"><ul class="itemizedlist" type="disc">
 <li class="listitem">
-        Thorsten Ottosen: review management, design advice, documentation feedback
-      </li>
+          Thorsten Ottosen: review management, design advice, documentation feedback
+        </li>
 <li class="listitem">
-        Eric Niebler: feedback
-      </li>
+          Eric Niebler: early implementation, and review feedback
+        </li>
 <li class="listitem">
-        Joel de Guzman: review
-      </li>
+          Joel de Guzman: review
+        </li>
 <li class="listitem">
-        Mathias Gaunard: review
-      </li>
+          Mathias Gaunard: review
+        </li>
 <li class="listitem">
-        David Abrahams: implementation advice
-      </li>
+          David Abrahams: implementation advice
+        </li>
 <li class="listitem">
-        Robert Jones: defect reports, usage feedback
-      </li>
+          Robert Jones: defect reports, usage feedback
+        </li>
 <li class="listitem">
-        Sean Parent: contributed experience from the Adobe range library
-      </li>
+          Sean Parent: contributed experience from the Adobe range library
+        </li>
 <li class="listitem">
-        Arno Schoedl: implementations, and review
-      </li>
+          Arno Schoedl: implementations, and review
+        </li>
 <li class="listitem">
-        Rogier van Dalen: review
-      </li>
+          Rogier van Dalen: review
+        </li>
 <li class="listitem">
-        Vincente Botet: review, documentation feedback
-      </li>
+          Vincente Botet: review, documentation feedback
+        </li>
 </ul></div>
 <p>
       Regardless of how I write this section it will never truly fairly capture the
@@ -142,7 +150,7 @@
 </tr></table>
 <hr>
 <div class="spirit-nav">
-<a accesskey="p" href="faq.html"><img src="../../../../../doc/html/images/prev.png" alt="Prev"></a><a accesskey="u" href="../index.html"><img src="../../../../../doc/html/images/up.png" alt="Up"></a><a accesskey="h" href="../index.html"><img src="../../../../../doc/html/images/home.png" alt="Home"></a>
+<a accesskey="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>
 </body>
 </html>
diff --git a/doc/html/range/introduction.html b/doc/html/range/introduction.html
index 7bedc97..5ea6f50 100644
--- a/doc/html/range/introduction.html
+++ b/doc/html/range/introduction.html
@@ -2,8 +2,8 @@
 <head>
 <meta http-equiv="Content-Type" content="text/html; charset=US-ASCII">
 <title>Introduction</title>
-<link rel="stylesheet" href="../../../../../doc/html/boostbook.css" type="text/css">
-<meta name="generator" content="DocBook XSL Stylesheets V1.75.1">
+<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="../index.html" title="Chapter&#160;1.&#160;Range 2.0">
 <link rel="prev" href="../index.html" title="Chapter&#160;1.&#160;Range 2.0">
@@ -13,16 +13,16 @@
 <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="../../../../libraries.htm">Libraries</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="../index.html"><img src="../../../../../doc/html/images/prev.png" alt="Prev"></a><a accesskey="u" href="../index.html"><img src="../../../../../doc/html/images/up.png" alt="Up"></a><a accesskey="h" href="../index.html"><img src="../../../../../doc/html/images/home.png" alt="Home"></a><a accesskey="n" href="concepts.html"><img src="../../../../../doc/html/images/next.png" alt="Next"></a>
+<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" title="Introduction">
+<div class="section">
 <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>
@@ -59,83 +59,58 @@
     </p>
 <div class="itemizedlist"><ul class="itemizedlist" type="disc">
 <li class="listitem">
-        simpler implementation and specification of generic range algorithms
-      </li>
+          simpler implementation and specification of generic range algorithms
+        </li>
 <li class="listitem">
-        more flexible, compact and maintainable client code
-      </li>
+          more flexible, compact and maintainable client code
+        </li>
 <li class="listitem">
-        safe use of built-in arrays (for legacy code; why else would you use built-in
-        arrays?)
-      </li>
+          safe use of built-in arrays (for legacy code; why else would you use built-in
+          arrays?)
+        </li>
 </ul></div>
-<p>
-      Below are given a small example (the complete example can be found <a href="http://www.boost.org/libs/range/test/algorithm_example.cpp" target="_top">here</a>
-      ):
-    </p>
+<a name="range.introduction.example___iterate_over_the_values_in_a_map"></a><h4>
+<a name="id3215930"></a>
+      <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="comment">//
-</span><span class="comment">// example: extracting bounds in a generic algorithm
-</span><span class="comment">//
-</span><span class="keyword">template</span><span class="special">&lt;</span> <span class="keyword">class</span> <span class="identifier">ForwardReadableRange</span><span class="special">,</span> <span class="keyword">class</span> <span class="identifier">T</span> <span class="special">&gt;</span>
-<span class="keyword">inline</span> <span class="keyword">typename</span> <span class="identifier">boost</span><span class="special">::</span><span class="identifier">range_iterator</span><span class="special">&lt;</span> <span class="identifier">ForwardReadableRange</span> <span class="special">&gt;::</span><span class="identifier">type</span>
-<span class="identifier">find</span><span class="special">(</span> <span class="identifier">ForwardReadableRange</span><span class="special">&amp;</span> <span class="identifier">c</span><span class="special">,</span> <span class="keyword">const</span> <span class="identifier">T</span><span class="special">&amp;</span> <span class="identifier">value</span> <span class="special">)</span>
-<span class="special">{</span>
-   <span class="keyword">return</span> <span class="identifier">std</span><span class="special">::</span><span class="identifier">find</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">c</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">c</span> <span class="special">),</span> <span class="identifier">value</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">ForwardReadableRange</span><span class="special">,</span> <span class="keyword">class</span> <span class="identifier">T</span> <span class="special">&gt;</span>
-<span class="keyword">inline</span> <span class="keyword">typename</span> <span class="identifier">boost</span><span class="special">::</span><span class="identifier">range_iterator</span><span class="special">&lt;</span> <span class="keyword">const</span> <span class="identifier">ForwardReadableRange</span> <span class="special">&gt;::</span><span class="identifier">type</span>
-<span class="identifier">find</span><span class="special">(</span> <span class="keyword">const</span> <span class="identifier">ForwardReadableRange</span><span class="special">&amp;</span> <span class="identifier">c</span><span class="special">,</span> <span class="keyword">const</span> <span class="identifier">T</span><span class="special">&amp;</span> <span class="identifier">value</span> <span class="special">)</span>
-<span class="special">{</span>
-   <span class="keyword">return</span> <span class="identifier">std</span><span class="special">::</span><span class="identifier">find</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">c</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">c</span> <span class="special">),</span> <span class="identifier">value</span> <span class="special">);</span>
-<span class="special">}</span>
-
-<span class="comment">//
-</span><span class="comment">// replace first value and return its index
-</span><span class="comment">//
-</span><span class="keyword">template</span><span class="special">&lt;</span> <span class="keyword">class</span> <span class="identifier">ForwardReadableWriteableRange</span><span class="special">,</span> <span class="keyword">class</span> <span class="identifier">T</span> <span class="special">&gt;</span>
-<span class="keyword">inline</span> <span class="keyword">typename</span> <span class="identifier">boost</span><span class="special">::</span><span class="identifier">range_size</span><span class="special">&lt;</span> <span class="identifier">ForwardReadableWriteableRange</span> <span class="special">&gt;::</span><span class="identifier">type</span>
-<span class="identifier">my_generic_replace</span><span class="special">(</span> <span class="identifier">ForwardReadableWriteableRange</span><span class="special">&amp;</span> <span class="identifier">c</span><span class="special">,</span> <span class="keyword">const</span> <span class="identifier">T</span><span class="special">&amp;</span> <span class="identifier">value</span><span class="special">,</span> <span class="keyword">const</span> <span class="identifier">T</span><span class="special">&amp;</span> <span class="identifier">replacement</span> <span class="special">)</span>
-<span class="special">{</span>
-   <span class="keyword">typename</span> <span class="identifier">boost</span><span class="special">::</span><span class="identifier">range_iterator</span><span class="special">&lt;</span> <span class="identifier">ForwardReadableWriteableRange</span> <span class="special">&gt;::</span><span class="identifier">type</span> <span class="identifier">found</span> <span class="special">=</span> <span class="identifier">find</span><span class="special">(</span> <span class="identifier">c</span><span class="special">,</span> <span class="identifier">value</span> <span class="special">);</span>
-
-   <span class="keyword">if</span><span class="special">(</span> <span class="identifier">found</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">c</span> <span class="special">)</span> <span class="special">)</span>
-       <span class="special">*</span><span class="identifier">found</span> <span class="special">=</span> <span class="identifier">replacement</span><span class="special">;</span>
-   <span class="keyword">return</span> <span class="identifier">std</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">c</span> <span class="special">),</span> <span class="identifier">found</span> <span class="special">);</span>
-<span class="special">}</span>
-
-<span class="comment">//
-</span><span class="comment">// usage
-</span><span class="comment">//
-</span><span class="keyword">const</span> <span class="keyword">int</span> <span class="identifier">N</span> <span class="special">=</span> <span class="number">5</span><span class="special">;</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">my_vector</span><span class="special">;</span>
-<span class="keyword">int</span> <span class="identifier">values</span><span class="special">[]</span> <span class="special">=</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>
-
-<span class="identifier">my_vector</span><span class="special">.</span><span class="identifier">assign</span><span class="special">(</span> <span class="identifier">values</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">values</span> <span class="special">)</span> <span class="special">);</span>
-<span class="keyword">typedef</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">iterator</span><span class="special">;</span>
-<span class="identifier">std</span><span class="special">::</span><span class="identifier">pair</span><span class="special">&lt;</span><span class="identifier">iterator</span><span class="special">,</span><span class="identifier">iterator</span><span class="special">&gt;</span>       <span class="identifier">my_view</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">my_vector</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">my_vector</span> <span class="special">)</span> <span class="special">+</span> <span class="identifier">N</span> <span class="special">);</span>
-<span class="keyword">char</span>  <span class="identifier">str_val</span><span class="special">[]</span> <span class="special">=</span> <span class="string">"a string"</span><span class="special">;</span>
-<span class="keyword">char</span><span class="special">*</span> <span class="identifier">str</span>       <span class="special">=</span> <span class="identifier">str_val</span><span class="special">;</span>
-
-<span class="identifier">std</span><span class="special">::</span><span class="identifier">cout</span> <span class="special">&lt;&lt;</span> <span class="identifier">my_generic_replace</span><span class="special">(</span> <span class="identifier">my_vector</span><span class="special">,</span> <span class="number">4</span><span class="special">,</span> <span class="number">2</span> <span class="special">);</span>
-<span class="identifier">std</span><span class="special">::</span><span class="identifier">cout</span> <span class="special">&lt;&lt;</span> <span class="identifier">my_generic_replace</span><span class="special">(</span> <span class="identifier">my_view</span><span class="special">,</span> <span class="number">4</span><span class="special">,</span> <span class="number">2</span> <span class="special">);</span>
-<span class="identifier">std</span><span class="special">::</span><span class="identifier">cout</span> <span class="special">&lt;&lt;</span> <span class="identifier">my_generic_replace</span><span class="special">(</span> <span class="identifier">str</span><span class="special">,</span> <span class="char">'a'</span><span class="special">,</span> <span class="char">'b'</span> <span class="special">);</span>
-
-<span class="comment">// prints '3', '5' and '0'
-</span></pre>
+<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="identifier">for_each</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">fn</span> <span class="special">);</span>
+</pre>
 <p>
     </p>
+<a name="range.introduction.example___iterate_over_the_keys_in_a_map"></a><h4>
+<a name="id3216055"></a>
+      <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>
+<span class="identifier">for_each</span><span class="special">(</span> <span class="identifier">my_map</span> <span class="special">|</span> <span class="identifier">map_keys</span><span class="special">,</span> <span class="identifier">fn</span> <span class="special">);</span>
+</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="id3213872"></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
+      - 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>
+</pre>
 <p>
-      By using the free-standing functions and <a href="../../../../../libs/mpl/doc/refmanual/metafunction.html" target="_top">metafunctions</a>,
-      the code automatically works for all the types supported by this library; now
-      and in the future. Notice that we have to provide two versions of <code class="computeroutput"><span class="identifier">find</span><span class="special">()</span></code> since
-      we cannot forward a non-const rvalue with reference arguments (see this article
-      about <a href="http://std.dkuug.dk/jtc1/sc22/wg21/docs/papers/2002/n1385.htm" target="_top">The
-      Forwarding Problem</a> ).
     </p>
 </div>
 <table xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" width="100%"><tr>
@@ -148,7 +123,7 @@
 </tr></table>
 <hr>
 <div class="spirit-nav">
-<a accesskey="p" href="../index.html"><img src="../../../../../doc/html/images/prev.png" alt="Prev"></a><a accesskey="u" href="../index.html"><img src="../../../../../doc/html/images/up.png" alt="Up"></a><a accesskey="h" href="../index.html"><img src="../../../../../doc/html/images/home.png" alt="Home"></a><a accesskey="n" href="concepts.html"><img src="../../../../../doc/html/images/next.png" alt="Next"></a>
+<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>
 </body>
 </html>
diff --git a/doc/html/range/library_headers.html b/doc/html/range/library_headers.html
index 0e06413..93a048f 100644
--- a/doc/html/range/library_headers.html
+++ b/doc/html/range/library_headers.html
@@ -2,8 +2,8 @@
 <head>
 <meta http-equiv="Content-Type" content="text/html; charset=US-ASCII">
 <title>Library Headers</title>
-<link rel="stylesheet" href="../../../../../doc/html/boostbook.css" type="text/css">
-<meta name="generator" content="DocBook XSL Stylesheets V1.75.1">
+<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="../index.html" title="Chapter&#160;1.&#160;Range 2.0">
 <link rel="prev" href="style_guide.html" title="Terminology and style guidelines">
@@ -13,16 +13,16 @@
 <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="../../../../libraries.htm">Libraries</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="style_guide.html"><img src="../../../../../doc/html/images/prev.png" alt="Prev"></a><a accesskey="u" href="../index.html"><img src="../../../../../doc/html/images/up.png" alt="Up"></a><a accesskey="h" href="../index.html"><img src="../../../../../doc/html/images/home.png" alt="Home"></a><a accesskey="n" href="library_headers/general.html"><img src="../../../../../doc/html/images/next.png" alt="Next"></a>
+<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="library_headers/general.html"><img src="../../../../../doc/src/images/next.png" alt="Next"></a>
 </div>
-<div class="section" title="Library Headers">
+<div class="section">
 <div class="titlepage"><div><div><h2 class="title" style="clear: both">
 <a name="range.library_headers"></a><a class="link" href="library_headers.html" title="Library Headers">Library Headers</a>
 </h2></div></div></div>
@@ -44,7 +44,7 @@
 </tr></table>
 <hr>
 <div class="spirit-nav">
-<a accesskey="p" href="style_guide.html"><img src="../../../../../doc/html/images/prev.png" alt="Prev"></a><a accesskey="u" href="../index.html"><img src="../../../../../doc/html/images/up.png" alt="Up"></a><a accesskey="h" href="../index.html"><img src="../../../../../doc/html/images/home.png" alt="Home"></a><a accesskey="n" href="library_headers/general.html"><img src="../../../../../doc/html/images/next.png" alt="Next"></a>
+<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="library_headers/general.html"><img src="../../../../../doc/src/images/next.png" alt="Next"></a>
 </div>
 </body>
 </html>
diff --git a/doc/html/range/library_headers/adaptors.html b/doc/html/range/library_headers/adaptors.html
index f8810a4..d6948ea 100644
--- a/doc/html/range/library_headers/adaptors.html
+++ b/doc/html/range/library_headers/adaptors.html
@@ -2,8 +2,8 @@
 <head>
 <meta http-equiv="Content-Type" content="text/html; charset=US-ASCII">
 <title>Adaptors</title>
-<link rel="stylesheet" href="../../../../../../doc/html/boostbook.css" type="text/css">
-<meta name="generator" content="DocBook XSL Stylesheets V1.75.1">
+<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="../library_headers.html" title="Library Headers">
 <link rel="prev" href="general.html" title="General">
@@ -13,16 +13,16 @@
 <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="../../../../../libraries.htm">Libraries</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="general.html"><img src="../../../../../../doc/html/images/prev.png" alt="Prev"></a><a accesskey="u" href="../library_headers.html"><img src="../../../../../../doc/html/images/up.png" alt="Up"></a><a accesskey="h" href="../../index.html"><img src="../../../../../../doc/html/images/home.png" alt="Home"></a><a accesskey="n" href="algorithm.html"><img src="../../../../../../doc/html/images/next.png" alt="Next"></a>
+<a accesskey="p" href="general.html"><img src="../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../library_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" title="Adaptors">
+<div class="section">
 <div class="titlepage"><div><div><h3 class="title">
 <a name="range.library_headers.adaptors"></a><a class="link" href="adaptors.html" title="Adaptors">Adaptors</a>
 </h3></div></div></div>
@@ -226,7 +226,7 @@
 </tr></table>
 <hr>
 <div class="spirit-nav">
-<a accesskey="p" href="general.html"><img src="../../../../../../doc/html/images/prev.png" alt="Prev"></a><a accesskey="u" href="../library_headers.html"><img src="../../../../../../doc/html/images/up.png" alt="Up"></a><a accesskey="h" href="../../index.html"><img src="../../../../../../doc/html/images/home.png" alt="Home"></a><a accesskey="n" href="algorithm.html"><img src="../../../../../../doc/html/images/next.png" alt="Next"></a>
+<a accesskey="p" href="general.html"><img src="../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../library_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>
 </body>
 </html>
diff --git a/doc/html/range/library_headers/algorithm.html b/doc/html/range/library_headers/algorithm.html
index 6beb47e..cab83e7 100644
--- a/doc/html/range/library_headers/algorithm.html
+++ b/doc/html/range/library_headers/algorithm.html
@@ -2,8 +2,8 @@
 <head>
 <meta http-equiv="Content-Type" content="text/html; charset=US-ASCII">
 <title>Algorithm</title>
-<link rel="stylesheet" href="../../../../../../doc/html/boostbook.css" type="text/css">
-<meta name="generator" content="DocBook XSL Stylesheets V1.75.1">
+<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="../library_headers.html" title="Library Headers">
 <link rel="prev" href="adaptors.html" title="Adaptors">
@@ -13,16 +13,16 @@
 <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="../../../../../libraries.htm">Libraries</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="adaptors.html"><img src="../../../../../../doc/html/images/prev.png" alt="Prev"></a><a accesskey="u" href="../library_headers.html"><img src="../../../../../../doc/html/images/up.png" alt="Up"></a><a accesskey="h" href="../../index.html"><img src="../../../../../../doc/html/images/home.png" alt="Home"></a><a accesskey="n" href="algorithm_extensions.html"><img src="../../../../../../doc/html/images/next.png" alt="Next"></a>
+<a accesskey="p" href="adaptors.html"><img src="../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../library_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_extensions.html"><img src="../../../../../../doc/src/images/next.png" alt="Next"></a>
 </div>
-<div class="section" title="Algorithm">
+<div class="section">
 <div class="titlepage"><div><div><h3 class="title">
 <a name="range.library_headers.algorithm"></a><a class="link" href="algorithm.html" title="Algorithm">Algorithm</a>
 </h3></div></div></div>
@@ -677,7 +677,7 @@
 </tr></table>
 <hr>
 <div class="spirit-nav">
-<a accesskey="p" href="adaptors.html"><img src="../../../../../../doc/html/images/prev.png" alt="Prev"></a><a accesskey="u" href="../library_headers.html"><img src="../../../../../../doc/html/images/up.png" alt="Up"></a><a accesskey="h" href="../../index.html"><img src="../../../../../../doc/html/images/home.png" alt="Home"></a><a accesskey="n" href="algorithm_extensions.html"><img src="../../../../../../doc/html/images/next.png" alt="Next"></a>
+<a accesskey="p" href="adaptors.html"><img src="../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../library_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_extensions.html"><img src="../../../../../../doc/src/images/next.png" alt="Next"></a>
 </div>
 </body>
 </html>
diff --git a/doc/html/range/library_headers/algorithm_extensions.html b/doc/html/range/library_headers/algorithm_extensions.html
index f3dd061..7a4db8f 100644
--- a/doc/html/range/library_headers/algorithm_extensions.html
+++ b/doc/html/range/library_headers/algorithm_extensions.html
@@ -2,8 +2,8 @@
 <head>
 <meta http-equiv="Content-Type" content="text/html; charset=US-ASCII">
 <title>Algorithm Extensions</title>
-<link rel="stylesheet" href="../../../../../../doc/html/boostbook.css" type="text/css">
-<meta name="generator" content="DocBook XSL Stylesheets V1.75.1">
+<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="../library_headers.html" title="Library Headers">
 <link rel="prev" href="algorithm.html" title="Algorithm">
@@ -13,16 +13,16 @@
 <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="../../../../../libraries.htm">Libraries</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="algorithm.html"><img src="../../../../../../doc/html/images/prev.png" alt="Prev"></a><a accesskey="u" href="../library_headers.html"><img src="../../../../../../doc/html/images/up.png" alt="Up"></a><a accesskey="h" href="../../index.html"><img src="../../../../../../doc/html/images/home.png" alt="Home"></a><a accesskey="n" href="../examples.html"><img src="../../../../../../doc/html/images/next.png" alt="Next"></a>
+<a accesskey="p" href="algorithm.html"><img src="../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../library_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" title="Algorithm Extensions">
+<div class="section">
 <div class="titlepage"><div><div><h3 class="title">
 <a name="range.library_headers.algorithm_extensions"></a><a class="link" href="algorithm_extensions.html" title="Algorithm Extensions">Algorithm
       Extensions</a>
@@ -166,7 +166,7 @@
 </tr></table>
 <hr>
 <div class="spirit-nav">
-<a accesskey="p" href="algorithm.html"><img src="../../../../../../doc/html/images/prev.png" alt="Prev"></a><a accesskey="u" href="../library_headers.html"><img src="../../../../../../doc/html/images/up.png" alt="Up"></a><a accesskey="h" href="../../index.html"><img src="../../../../../../doc/html/images/home.png" alt="Home"></a><a accesskey="n" href="../examples.html"><img src="../../../../../../doc/html/images/next.png" alt="Next"></a>
+<a accesskey="p" href="algorithm.html"><img src="../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../library_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>
 </body>
 </html>
diff --git a/doc/html/range/library_headers/general.html b/doc/html/range/library_headers/general.html
index 558fe74..5996f99 100644
--- a/doc/html/range/library_headers/general.html
+++ b/doc/html/range/library_headers/general.html
@@ -2,8 +2,8 @@
 <head>
 <meta http-equiv="Content-Type" content="text/html; charset=US-ASCII">
 <title>General</title>
-<link rel="stylesheet" href="../../../../../../doc/html/boostbook.css" type="text/css">
-<meta name="generator" content="DocBook XSL Stylesheets V1.75.1">
+<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="../library_headers.html" title="Library Headers">
 <link rel="prev" href="../library_headers.html" title="Library Headers">
@@ -13,16 +13,16 @@
 <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="../../../../../libraries.htm">Libraries</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="../library_headers.html"><img src="../../../../../../doc/html/images/prev.png" alt="Prev"></a><a accesskey="u" href="../library_headers.html"><img src="../../../../../../doc/html/images/up.png" alt="Up"></a><a accesskey="h" href="../../index.html"><img src="../../../../../../doc/html/images/home.png" alt="Home"></a><a accesskey="n" href="adaptors.html"><img src="../../../../../../doc/html/images/next.png" alt="Next"></a>
+<a accesskey="p" href="../library_headers.html"><img src="../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../library_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" title="General">
+<div class="section">
 <div class="titlepage"><div><div><h3 class="title">
 <a name="range.library_headers.general"></a><a class="link" href="general.html" title="General">General</a>
 </h3></div></div></div>
@@ -545,7 +545,7 @@
 </tr></table>
 <hr>
 <div class="spirit-nav">
-<a accesskey="p" href="../library_headers.html"><img src="../../../../../../doc/html/images/prev.png" alt="Prev"></a><a accesskey="u" href="../library_headers.html"><img src="../../../../../../doc/html/images/up.png" alt="Up"></a><a accesskey="h" href="../../index.html"><img src="../../../../../../doc/html/images/home.png" alt="Home"></a><a accesskey="n" href="adaptors.html"><img src="../../../../../../doc/html/images/next.png" alt="Next"></a>
+<a accesskey="p" href="../library_headers.html"><img src="../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../library_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>
 </body>
 </html>
diff --git a/doc/html/range/mfc_atl.html b/doc/html/range/mfc_atl.html
index c0f1c6d..72221f9 100644
--- a/doc/html/range/mfc_atl.html
+++ b/doc/html/range/mfc_atl.html
@@ -2,8 +2,8 @@
 <head>
 <meta http-equiv="Content-Type" content="text/html; charset=US-ASCII">
 <title>MFC/ATL (courtesy of Shunsuke Sogame)</title>
-<link rel="stylesheet" href="../../../../../doc/html/boostbook.css" type="text/css">
-<meta name="generator" content="DocBook XSL Stylesheets V1.75.1">
+<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="../index.html" title="Chapter&#160;1.&#160;Range 2.0">
 <link rel="prev" href="examples.html" title="Examples">
@@ -13,16 +13,16 @@
 <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="../../../../libraries.htm">Libraries</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="examples.html"><img src="../../../../../doc/html/images/prev.png" alt="Prev"></a><a accesskey="u" href="../index.html"><img src="../../../../../doc/html/images/up.png" alt="Up"></a><a accesskey="h" href="../index.html"><img src="../../../../../doc/html/images/home.png" alt="Home"></a><a accesskey="n" href="mfc_atl/requirements.html"><img src="../../../../../doc/html/images/next.png" alt="Next"></a>
+<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" title="MFC/ATL (courtesy of Shunsuke Sogame)">
+<div class="section">
 <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>
@@ -34,7 +34,7 @@
 <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="id2817920"></a>
+<a name="id3393805"></a>
       <a class="link" href="mfc_atl.html#range.mfc_atl.introduction">Introduction</a>
     </h5>
 <p>
@@ -100,7 +100,7 @@
 </tbody>
 </table></div>
 <a name="range.mfc_atl.overview"></a><h5>
-<a name="id2818057"></a>
+<a name="id3393943"></a>
       <a class="link" href="mfc_atl.html#range.mfc_atl.overview">Overview</a>
     </h5>
 <p>
@@ -135,7 +135,7 @@
 </tr></table>
 <hr>
 <div class="spirit-nav">
-<a accesskey="p" href="examples.html"><img src="../../../../../doc/html/images/prev.png" alt="Prev"></a><a accesskey="u" href="../index.html"><img src="../../../../../doc/html/images/up.png" alt="Up"></a><a accesskey="h" href="../index.html"><img src="../../../../../doc/html/images/home.png" alt="Home"></a><a accesskey="n" href="mfc_atl/requirements.html"><img src="../../../../../doc/html/images/next.png" alt="Next"></a>
+<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>
 </body>
 </html>
diff --git a/doc/html/range/mfc_atl/atl_ranges.html b/doc/html/range/mfc_atl/atl_ranges.html
index 65ee355..6c96f33 100644
--- a/doc/html/range/mfc_atl/atl_ranges.html
+++ b/doc/html/range/mfc_atl/atl_ranges.html
@@ -2,8 +2,8 @@
 <head>
 <meta http-equiv="Content-Type" content="text/html; charset=US-ASCII">
 <title>ATL Ranges</title>
-<link rel="stylesheet" href="../../../../../../doc/html/boostbook.css" type="text/css">
-<meta name="generator" content="DocBook XSL Stylesheets V1.75.1">
+<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="../mfc_atl.html" title="MFC/ATL (courtesy of Shunsuke Sogame)">
 <link rel="prev" href="mfc_ranges.html" title="MFC Ranges">
@@ -13,16 +13,16 @@
 <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="../../../../../libraries.htm">Libraries</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="mfc_ranges.html"><img src="../../../../../../doc/html/images/prev.png" alt="Prev"></a><a accesskey="u" href="../mfc_atl.html"><img src="../../../../../../doc/html/images/up.png" alt="Up"></a><a accesskey="h" href="../../index.html"><img src="../../../../../../doc/html/images/home.png" alt="Home"></a><a accesskey="n" href="const_ranges.html"><img src="../../../../../../doc/html/images/next.png" alt="Next"></a>
+<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" title="ATL Ranges">
+<div class="section">
 <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>
@@ -368,7 +368,7 @@
 </tr></table>
 <hr>
 <div class="spirit-nav">
-<a accesskey="p" href="mfc_ranges.html"><img src="../../../../../../doc/html/images/prev.png" alt="Prev"></a><a accesskey="u" href="../mfc_atl.html"><img src="../../../../../../doc/html/images/up.png" alt="Up"></a><a accesskey="h" href="../../index.html"><img src="../../../../../../doc/html/images/home.png" alt="Home"></a><a accesskey="n" href="const_ranges.html"><img src="../../../../../../doc/html/images/next.png" alt="Next"></a>
+<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>
 </body>
 </html>
diff --git a/doc/html/range/mfc_atl/const_ranges.html b/doc/html/range/mfc_atl/const_ranges.html
index 2e047f6..cf41223 100644
--- a/doc/html/range/mfc_atl/const_ranges.html
+++ b/doc/html/range/mfc_atl/const_ranges.html
@@ -2,8 +2,8 @@
 <head>
 <meta http-equiv="Content-Type" content="text/html; charset=US-ASCII">
 <title>const Ranges</title>
-<link rel="stylesheet" href="../../../../../../doc/html/boostbook.css" type="text/css">
-<meta name="generator" content="DocBook XSL Stylesheets V1.75.1">
+<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="../mfc_atl.html" title="MFC/ATL (courtesy of Shunsuke Sogame)">
 <link rel="prev" href="atl_ranges.html" title="ATL Ranges">
@@ -13,16 +13,16 @@
 <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="../../../../../libraries.htm">Libraries</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="atl_ranges.html"><img src="../../../../../../doc/html/images/prev.png" alt="Prev"></a><a accesskey="u" href="../mfc_atl.html"><img src="../../../../../../doc/html/images/up.png" alt="Up"></a><a accesskey="h" href="../../index.html"><img src="../../../../../../doc/html/images/home.png" alt="Home"></a><a accesskey="n" href="references.html"><img src="../../../../../../doc/html/images/next.png" alt="Next"></a>
+<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" title="const Ranges">
+<div class="section">
 <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>
@@ -119,7 +119,7 @@
 </tr></table>
 <hr>
 <div class="spirit-nav">
-<a accesskey="p" href="atl_ranges.html"><img src="../../../../../../doc/html/images/prev.png" alt="Prev"></a><a accesskey="u" href="../mfc_atl.html"><img src="../../../../../../doc/html/images/up.png" alt="Up"></a><a accesskey="h" href="../../index.html"><img src="../../../../../../doc/html/images/home.png" alt="Home"></a><a accesskey="n" href="references.html"><img src="../../../../../../doc/html/images/next.png" alt="Next"></a>
+<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>
 </body>
 </html>
diff --git a/doc/html/range/mfc_atl/mfc_ranges.html b/doc/html/range/mfc_atl/mfc_ranges.html
index af0c6e9..57655a2 100644
--- a/doc/html/range/mfc_atl/mfc_ranges.html
+++ b/doc/html/range/mfc_atl/mfc_ranges.html
@@ -2,8 +2,8 @@
 <head>
 <meta http-equiv="Content-Type" content="text/html; charset=US-ASCII">
 <title>MFC Ranges</title>
-<link rel="stylesheet" href="../../../../../../doc/html/boostbook.css" type="text/css">
-<meta name="generator" content="DocBook XSL Stylesheets V1.75.1">
+<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="../mfc_atl.html" title="MFC/ATL (courtesy of Shunsuke Sogame)">
 <link rel="prev" href="requirements.html" title="Requirements">
@@ -13,16 +13,16 @@
 <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="../../../../../libraries.htm">Libraries</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="requirements.html"><img src="../../../../../../doc/html/images/prev.png" alt="Prev"></a><a accesskey="u" href="../mfc_atl.html"><img src="../../../../../../doc/html/images/up.png" alt="Up"></a><a accesskey="h" href="../../index.html"><img src="../../../../../../doc/html/images/home.png" alt="Home"></a><a accesskey="n" href="atl_ranges.html"><img src="../../../../../../doc/html/images/next.png" alt="Next"></a>
+<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" title="MFC Ranges">
+<div class="section">
 <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>
@@ -474,7 +474,7 @@
 </tr></table>
 <hr>
 <div class="spirit-nav">
-<a accesskey="p" href="requirements.html"><img src="../../../../../../doc/html/images/prev.png" alt="Prev"></a><a accesskey="u" href="../mfc_atl.html"><img src="../../../../../../doc/html/images/up.png" alt="Up"></a><a accesskey="h" href="../../index.html"><img src="../../../../../../doc/html/images/home.png" alt="Home"></a><a accesskey="n" href="atl_ranges.html"><img src="../../../../../../doc/html/images/next.png" alt="Next"></a>
+<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>
 </body>
 </html>
diff --git a/doc/html/range/mfc_atl/references.html b/doc/html/range/mfc_atl/references.html
index 124a538..1d0a7a4 100644
--- a/doc/html/range/mfc_atl/references.html
+++ b/doc/html/range/mfc_atl/references.html
@@ -2,8 +2,8 @@
 <head>
 <meta http-equiv="Content-Type" content="text/html; charset=US-ASCII">
 <title>References</title>
-<link rel="stylesheet" href="../../../../../../doc/html/boostbook.css" type="text/css">
-<meta name="generator" content="DocBook XSL Stylesheets V1.75.1">
+<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="../mfc_atl.html" title="MFC/ATL (courtesy of Shunsuke Sogame)">
 <link rel="prev" href="const_ranges.html" title="const Ranges">
@@ -13,25 +13,31 @@
 <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="../../../../../libraries.htm">Libraries</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="const_ranges.html"><img src="../../../../../../doc/html/images/prev.png" alt="Prev"></a><a accesskey="u" href="../mfc_atl.html"><img src="../../../../../../doc/html/images/up.png" alt="Up"></a><a accesskey="h" href="../../index.html"><img src="../../../../../../doc/html/images/home.png" alt="Home"></a><a accesskey="n" href="../upgrade.html"><img src="../../../../../../doc/html/images/next.png" alt="Next"></a>
+<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" title="References">
+<div class="section">
 <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>
 <div class="orderedlist"><ol class="orderedlist" type="1">
-<li class="listitem"><a class="link" href="../../index.html" title="Chapter&#160;1.&#160;Range 2.0">Boost.Range</a></li>
-<li class="listitem"><a href="http://msdn.microsoft.com/en-us/library/942860sh.aspx" target="_top">MFC
-          Collection Classes</a></li>
-<li class="listitem"><a href="http://msdn.microsoft.com/en-us/library/15e672bd.aspx" target="_top">ATL
-          Collection Classes</a></li>
+<li class="listitem">
+            <a class="link" href="../../index.html" title="Chapter&#160;1.&#160;Range 2.0">Boost.Range</a>
+          </li>
+<li class="listitem">
+            <a href="http://msdn.microsoft.com/en-us/library/942860sh.aspx" target="_top">MFC
+            Collection Classes</a>
+          </li>
+<li class="listitem">
+            <a href="http://msdn.microsoft.com/en-us/library/15e672bd.aspx" target="_top">ATL
+            Collection Classes</a>
+          </li>
 </ol></div>
 </div>
 <table xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" width="100%"><tr>
@@ -44,7 +50,7 @@
 </tr></table>
 <hr>
 <div class="spirit-nav">
-<a accesskey="p" href="const_ranges.html"><img src="../../../../../../doc/html/images/prev.png" alt="Prev"></a><a accesskey="u" href="../mfc_atl.html"><img src="../../../../../../doc/html/images/up.png" alt="Up"></a><a accesskey="h" href="../../index.html"><img src="../../../../../../doc/html/images/home.png" alt="Home"></a><a accesskey="n" href="../upgrade.html"><img src="../../../../../../doc/html/images/next.png" alt="Next"></a>
+<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>
 </body>
 </html>
diff --git a/doc/html/range/mfc_atl/requirements.html b/doc/html/range/mfc_atl/requirements.html
index 131433f..8c0a80a 100644
--- a/doc/html/range/mfc_atl/requirements.html
+++ b/doc/html/range/mfc_atl/requirements.html
@@ -2,8 +2,8 @@
 <head>
 <meta http-equiv="Content-Type" content="text/html; charset=US-ASCII">
 <title>Requirements</title>
-<link rel="stylesheet" href="../../../../../../doc/html/boostbook.css" type="text/css">
-<meta name="generator" content="DocBook XSL Stylesheets V1.75.1">
+<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="../mfc_atl.html" title="MFC/ATL (courtesy of Shunsuke Sogame)">
 <link rel="prev" href="../mfc_atl.html" title="MFC/ATL (courtesy of Shunsuke Sogame)">
@@ -13,26 +13,26 @@
 <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="../../../../../libraries.htm">Libraries</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="../mfc_atl.html"><img src="../../../../../../doc/html/images/prev.png" alt="Prev"></a><a accesskey="u" href="../mfc_atl.html"><img src="../../../../../../doc/html/images/up.png" alt="Up"></a><a accesskey="h" href="../../index.html"><img src="../../../../../../doc/html/images/home.png" alt="Home"></a><a accesskey="n" href="mfc_ranges.html"><img src="../../../../../../doc/html/images/next.png" alt="Next"></a>
+<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" title="Requirements">
+<div class="section">
 <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>
 <div class="itemizedlist"><ul class="itemizedlist" type="disc">
 <li class="listitem">
-          Boost C++ Libraries Version 1.34.0 or later (no compilation required)
-        </li>
+            Boost C++ Libraries Version 1.34.0 or later (no compilation required)
+          </li>
 <li class="listitem">
-          Visual C++ 7.1 or later (for MFC and ATL)
-        </li>
+            Visual C++ 7.1 or later (for MFC and ATL)
+          </li>
 </ul></div>
 </div>
 <table xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" width="100%"><tr>
@@ -45,7 +45,7 @@
 </tr></table>
 <hr>
 <div class="spirit-nav">
-<a accesskey="p" href="../mfc_atl.html"><img src="../../../../../../doc/html/images/prev.png" alt="Prev"></a><a accesskey="u" href="../mfc_atl.html"><img src="../../../../../../doc/html/images/up.png" alt="Up"></a><a accesskey="h" href="../../index.html"><img src="../../../../../../doc/html/images/home.png" alt="Home"></a><a accesskey="n" href="mfc_ranges.html"><img src="../../../../../../doc/html/images/next.png" alt="Next"></a>
+<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>
 </body>
 </html>
diff --git a/doc/html/range/portability.html b/doc/html/range/portability.html
index 45d3a07..e2afd81 100644
--- a/doc/html/range/portability.html
+++ b/doc/html/range/portability.html
@@ -2,8 +2,8 @@
 <head>
 <meta http-equiv="Content-Type" content="text/html; charset=US-ASCII">
 <title>Portability</title>
-<link rel="stylesheet" href="../../../../../doc/html/boostbook.css" type="text/css">
-<meta name="generator" content="DocBook XSL Stylesheets V1.75.1">
+<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="../index.html" title="Chapter&#160;1.&#160;Range 2.0">
 <link rel="prev" href="upgrade/upgrade_from_1_34.html" title="Upgrade from version 1.34">
@@ -13,16 +13,16 @@
 <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="../../../../libraries.htm">Libraries</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/upgrade_from_1_34.html"><img src="../../../../../doc/html/images/prev.png" alt="Prev"></a><a accesskey="u" href="../index.html"><img src="../../../../../doc/html/images/up.png" alt="Up"></a><a accesskey="h" href="../index.html"><img src="../../../../../doc/html/images/home.png" alt="Home"></a><a accesskey="n" href="faq.html"><img src="../../../../../doc/html/images/next.png" alt="Next"></a>
+<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" title="Portability">
+<div class="section">
 <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>
@@ -47,32 +47,32 @@
     </p>
 <div class="orderedlist"><ol class="orderedlist" type="1">
 <li class="listitem">
-        do not use built-in arrays,
-      </li>
+          do not use built-in arrays,
+        </li>
 <li class="listitem">
-        do not pass rvalues to <a class="link" href="reference/concept_implementation/semantics/functions.html" title="Functions"><code class="computeroutput"><span class="identifier">begin</span></code></a><code class="computeroutput"><span class="special">()</span></code>,
-        <a class="link" href="reference/concept_implementation/semantics/functions.html" title="Functions"><code class="computeroutput"><span class="identifier">end</span></code></a><code class="computeroutput"><span class="special">()</span></code>
-        and <a class="link" href="reference/utilities/iterator_range.html" title="Class iterator_range"><code class="computeroutput"><span class="identifier">iterator_range</span></code></a> Range constructors
-        and assignment operators,
-      </li>
+          do not pass rvalues to <a class="link" href="reference/concept_implementation/semantics/functions.html" title="Functions"><code class="computeroutput"><span class="identifier">begin</span></code></a><code class="computeroutput"><span class="special">()</span></code>,
+          <a class="link" href="reference/concept_implementation/semantics/functions.html" title="Functions"><code class="computeroutput"><span class="identifier">end</span></code></a><code class="computeroutput"><span class="special">()</span></code>
+          and <a class="link" href="reference/utilities/iterator_range.html" title="Class iterator_range"><code class="computeroutput"><span class="identifier">iterator_range</span></code></a> Range constructors
+          and assignment operators,
+        </li>
 <li class="listitem">
-        use <a class="link" href="reference/concept_implementation/semantics/functions.html" title="Functions"><code class="computeroutput"><span class="identifier">const_begin</span></code></a><code class="computeroutput"><span class="special">()</span></code>
-        and <a class="link" href="reference/concept_implementation/semantics/functions.html" title="Functions"><code class="computeroutput"><span class="identifier">const_end</span></code></a><code class="computeroutput"><span class="special">()</span></code>
-        whenever your code by intention is read-only; this will also solve most rvalue
-        problems,
-      </li>
+          use <a class="link" href="reference/concept_implementation/semantics/functions.html" title="Functions"><code class="computeroutput"><span class="identifier">const_begin</span></code></a><code class="computeroutput"><span class="special">()</span></code>
+          and <a class="link" href="reference/concept_implementation/semantics/functions.html" title="Functions"><code class="computeroutput"><span class="identifier">const_end</span></code></a><code class="computeroutput"><span class="special">()</span></code>
+          whenever your code by intention is read-only; this will also solve most
+          rvalue problems,
+        </li>
 <li class="listitem">
-        do not rely on ADL:
-        <div class="itemizedlist"><ul class="itemizedlist" type="disc">
+          do not rely on ADL:
+          <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>
@@ -85,7 +85,7 @@
 </tr></table>
 <hr>
 <div class="spirit-nav">
-<a accesskey="p" href="upgrade/upgrade_from_1_34.html"><img src="../../../../../doc/html/images/prev.png" alt="Prev"></a><a accesskey="u" href="../index.html"><img src="../../../../../doc/html/images/up.png" alt="Up"></a><a accesskey="h" href="../index.html"><img src="../../../../../doc/html/images/home.png" alt="Home"></a><a accesskey="n" href="faq.html"><img src="../../../../../doc/html/images/next.png" alt="Next"></a>
+<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>
 </body>
 </html>
diff --git a/doc/html/range/reference.html b/doc/html/range/reference.html
index cbff24d..9b31bb4 100644
--- a/doc/html/range/reference.html
+++ b/doc/html/range/reference.html
@@ -2,8 +2,8 @@
 <head>
 <meta http-equiv="Content-Type" content="text/html; charset=US-ASCII">
 <title>Reference</title>
-<link rel="stylesheet" href="../../../../../doc/html/boostbook.css" type="text/css">
-<meta name="generator" content="DocBook XSL Stylesheets V1.75.1">
+<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="../index.html" title="Chapter&#160;1.&#160;Range 2.0">
 <link rel="prev" href="concepts/concept_checking.html" title="Concept Checking">
@@ -13,16 +13,16 @@
 <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="../../../../libraries.htm">Libraries</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="concepts/concept_checking.html"><img src="../../../../../doc/html/images/prev.png" alt="Prev"></a><a accesskey="u" href="../index.html"><img src="../../../../../doc/html/images/up.png" alt="Up"></a><a accesskey="h" href="../index.html"><img src="../../../../../doc/html/images/home.png" alt="Home"></a><a accesskey="n" href="reference/overview.html"><img src="../../../../../doc/html/images/next.png" alt="Next"></a>
+<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" title="Reference">
+<div class="section">
 <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>
@@ -89,7 +89,7 @@
 </tr></table>
 <hr>
 <div class="spirit-nav">
-<a accesskey="p" href="concepts/concept_checking.html"><img src="../../../../../doc/html/images/prev.png" alt="Prev"></a><a accesskey="u" href="../index.html"><img src="../../../../../doc/html/images/up.png" alt="Up"></a><a accesskey="h" href="../index.html"><img src="../../../../../doc/html/images/home.png" alt="Home"></a><a accesskey="n" href="reference/overview.html"><img src="../../../../../doc/html/images/next.png" alt="Next"></a>
+<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>
 </body>
 </html>
diff --git a/doc/html/range/reference/adaptors.html b/doc/html/range/reference/adaptors.html
index b649558..59564f9 100644
--- a/doc/html/range/reference/adaptors.html
+++ b/doc/html/range/reference/adaptors.html
@@ -2,8 +2,8 @@
 <head>
 <meta http-equiv="Content-Type" content="text/html; charset=US-ASCII">
 <title>Range Adaptors</title>
-<link rel="stylesheet" href="../../../../../../doc/html/boostbook.css" type="text/css">
-<meta name="generator" content="DocBook XSL Stylesheets V1.75.1">
+<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="../reference.html" title="Reference">
 <link rel="prev" href="concept_implementation/semantics/functions.html" title="Functions">
@@ -13,16 +13,16 @@
 <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="../../../../../libraries.htm">Libraries</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="concept_implementation/semantics/functions.html"><img src="../../../../../../doc/html/images/prev.png" alt="Prev"></a><a accesskey="u" href="../reference.html"><img src="../../../../../../doc/html/images/up.png" alt="Up"></a><a accesskey="h" href="../../index.html"><img src="../../../../../../doc/html/images/home.png" alt="Home"></a><a accesskey="n" href="adaptors/introduction.html"><img src="../../../../../../doc/html/images/next.png" alt="Next"></a>
+<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" title="Range Adaptors">
+<div class="section">
 <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>
@@ -44,7 +44,7 @@
 </tr></table>
 <hr>
 <div class="spirit-nav">
-<a accesskey="p" href="concept_implementation/semantics/functions.html"><img src="../../../../../../doc/html/images/prev.png" alt="Prev"></a><a accesskey="u" href="../reference.html"><img src="../../../../../../doc/html/images/up.png" alt="Up"></a><a accesskey="h" href="../../index.html"><img src="../../../../../../doc/html/images/home.png" alt="Home"></a><a accesskey="n" href="adaptors/introduction.html"><img src="../../../../../../doc/html/images/next.png" alt="Next"></a>
+<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>
 </body>
 </html>
diff --git a/doc/html/range/reference/adaptors/adaptors_reference.html b/doc/html/range/reference/adaptors/adaptors_reference.html
deleted file mode 100644
index d284888..0000000
--- a/doc/html/range/reference/adaptors/adaptors_reference.html
+++ /dev/null
@@ -1,75 +0,0 @@
-<html>
-<head>
-<meta http-equiv="Content-Type" content="text/html; charset=US-ASCII">
-<title>Reference</title>
-<link rel="stylesheet" href="../../../../../../../doc/html/boostbook.css" type="text/css">
-<meta name="generator" content="DocBook XSL Stylesheets V1.75.1">
-<link rel="home" href="../../../index.html" title="Chapter&#160;1.&#160;Range 2.0">
-<link rel="up" href="../adaptors.html" title="Range Adaptors">
-<link rel="prev" href="adaptors_general_requirements.html" title="General Requirements">
-<link rel="next" href="adaptors_reference/adjacent_filtered.html" title="adjacent_filtered">
-</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="../../../../../../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="adaptors_general_requirements.html"><img src="../../../../../../../doc/html/images/prev.png" alt="Prev"></a><a accesskey="u" href="../adaptors.html"><img src="../../../../../../../doc/html/images/up.png" alt="Up"></a><a accesskey="h" href="../../../index.html"><img src="../../../../../../../doc/html/images/home.png" alt="Home"></a><a accesskey="n" href="adaptors_reference/adjacent_filtered.html"><img src="../../../../../../../doc/html/images/next.png" alt="Next"></a>
-</div>
-<div class="section" title="Reference">
-<div class="titlepage"><div><div><h4 class="title">
-<a name="range.reference.adaptors.adaptors_reference"></a><a class="link" href="adaptors_reference.html" title="Reference"> Reference</a>
-</h4></div></div></div>
-<div class="toc"><dl>
-<dt><span class="section"><a href="adaptors_reference/adjacent_filtered.html">
-          adjacent_filtered</a></span></dt>
-<dt><span class="section"><a href="adaptors_reference/copied.html">
-          copied</a></span></dt>
-<dt><span class="section"><a href="adaptors_reference/filtered.html">
-          filtered</a></span></dt>
-<dt><span class="section"><a href="adaptors_reference/indexed.html">
-          indexed</a></span></dt>
-<dt><span class="section"><a href="adaptors_reference/indirected.html">
-          indirected</a></span></dt>
-<dt><span class="section"><a href="adaptors_reference/map_keys.html">
-          map_keys</a></span></dt>
-<dt><span class="section"><a href="adaptors_reference/map_values.html">
-          map_values</a></span></dt>
-<dt><span class="section"><a href="adaptors_reference/replaced.html">
-          replaced</a></span></dt>
-<dt><span class="section"><a href="adaptors_reference/replaced_if.html">
-          replaced_if</a></span></dt>
-<dt><span class="section"><a href="adaptors_reference/reversed.html">
-          reversed</a></span></dt>
-<dt><span class="section"><a href="adaptors_reference/sliced.html">
-          sliced</a></span></dt>
-<dt><span class="section"><a href="adaptors_reference/strided.html">
-          strided</a></span></dt>
-<dt><span class="section"><a href="adaptors_reference/tokenized.html">
-          tokenized</a></span></dt>
-<dt><span class="section"><a href="adaptors_reference/transformed.html">
-          transformed</a></span></dt>
-<dt><span class="section"><a href="adaptors_reference/uniqued.html">
-          uniqued</a></span></dt>
-</dl></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="adaptors_general_requirements.html"><img src="../../../../../../../doc/html/images/prev.png" alt="Prev"></a><a accesskey="u" href="../adaptors.html"><img src="../../../../../../../doc/html/images/up.png" alt="Up"></a><a accesskey="h" href="../../../index.html"><img src="../../../../../../../doc/html/images/home.png" alt="Home"></a><a accesskey="n" href="adaptors_reference/adjacent_filtered.html"><img src="../../../../../../../doc/html/images/next.png" alt="Next"></a>
-</div>
-</body>
-</html>
diff --git a/doc/html/range/reference/adaptors/general_requirements.html b/doc/html/range/reference/adaptors/general_requirements.html
index 63abc37..83d19c0 100644
--- a/doc/html/range/reference/adaptors/general_requirements.html
+++ b/doc/html/range/reference/adaptors/general_requirements.html
@@ -2,8 +2,8 @@
 <head>
 <meta http-equiv="Content-Type" content="text/html; charset=US-ASCII">
 <title>General Requirements</title>
-<link rel="stylesheet" href="../../../../../../../doc/html/boostbook.css" type="text/css">
-<meta name="generator" content="DocBook XSL Stylesheets V1.75.1">
+<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="../adaptors.html" title="Range Adaptors">
 <link rel="prev" href="introduction.html" title="Introduction and motivation">
@@ -13,16 +13,16 @@
 <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="../../../../../../libraries.htm">Libraries</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="introduction.html"><img src="../../../../../../../doc/html/images/prev.png" alt="Prev"></a><a accesskey="u" href="../adaptors.html"><img src="../../../../../../../doc/html/images/up.png" alt="Up"></a><a accesskey="h" href="../../../index.html"><img src="../../../../../../../doc/html/images/home.png" alt="Home"></a><a accesskey="n" href="reference.html"><img src="../../../../../../../doc/html/images/next.png" alt="Next"></a>
+<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" title="General Requirements">
+<div class="section">
 <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>
@@ -33,40 +33,40 @@
         </p>
 <div class="itemizedlist"><ul class="itemizedlist" type="disc">
 <li class="listitem">
-<code class="computeroutput"><span class="identifier">fwdRng</span></code> is an expression
-            of a type <code class="computeroutput"><span class="identifier">R</span></code> that models
-            <code class="computeroutput"><span class="identifier">ForwardRange</span></code>
-</li>
+              <code class="computeroutput"><span class="identifier">fwdRng</span></code> is an expression
+              of a type <code class="computeroutput"><span class="identifier">R</span></code> that models
+              <code class="computeroutput"><span class="identifier">ForwardRange</span></code>
+            </li>
 <li class="listitem">
-<code class="computeroutput"><span class="identifier">biRng</span></code> is an expression
-            of a type <code class="computeroutput"><span class="identifier">R</span></code> that models
-            <code class="computeroutput"><span class="identifier">BidirectionalRange</span></code>
-</li>
+              <code class="computeroutput"><span class="identifier">biRng</span></code> is an expression
+              of a type <code class="computeroutput"><span class="identifier">R</span></code> that models
+              <code class="computeroutput"><span class="identifier">BidirectionalRange</span></code>
+            </li>
 <li class="listitem">
-<code class="computeroutput"><span class="identifier">rndRng</span></code> is an expression
-            of a type <code class="computeroutput"><span class="identifier">R</span></code> that models
-            <code class="computeroutput"><span class="identifier">RandomAccessRange</span></code>
-</li>
+              <code class="computeroutput"><span class="identifier">rndRng</span></code> is an expression
+              of a type <code class="computeroutput"><span class="identifier">R</span></code> that models
+              <code class="computeroutput"><span class="identifier">RandomAccessRange</span></code>
+            </li>
 <li class="listitem">
-<code class="computeroutput"><span class="identifier">pred</span></code> is an expression
-            of a type that models <code class="computeroutput"><span class="identifier">UnaryPredicate</span></code>
-</li>
+              <code class="computeroutput"><span class="identifier">pred</span></code> is an expression
+              of a type that models <code class="computeroutput"><span class="identifier">UnaryPredicate</span></code>
+            </li>
 <li class="listitem">
-<code class="computeroutput"><span class="identifier">bi_pred</span></code> is an expression
-            of a type that models <code class="computeroutput"><span class="identifier">BinaryPredicate</span></code>
-</li>
+              <code class="computeroutput"><span class="identifier">bi_pred</span></code> is an expression
+              of a type that models <code class="computeroutput"><span class="identifier">BinaryPredicate</span></code>
+            </li>
 <li class="listitem">
-<code class="computeroutput"><span class="identifier">fun</span></code> is an expression
-            of a type that models <code class="computeroutput"><span class="identifier">UnaryFunction</span></code>
-</li>
+              <code class="computeroutput"><span class="identifier">fun</span></code> is an expression
+              of a type that models <code class="computeroutput"><span class="identifier">UnaryFunction</span></code>
+            </li>
 <li class="listitem">
-<code class="computeroutput"><span class="identifier">value</span></code>, <code class="computeroutput"><span class="identifier">new_value</span></code> and <code class="computeroutput"><span class="identifier">old_value</span></code>
-            are objects convertible to <code class="computeroutput"><span class="identifier">boost</span><span class="special">::</span><span class="identifier">range_value</span><span class="special">&lt;</span><span class="identifier">R</span><span class="special">&gt;::</span><span class="identifier">type</span></code>
-</li>
+              <code class="computeroutput"><span class="identifier">value</span></code>, <code class="computeroutput"><span class="identifier">new_value</span></code> and <code class="computeroutput"><span class="identifier">old_value</span></code>
+              are objects convertible to <code class="computeroutput"><span class="identifier">boost</span><span class="special">::</span><span class="identifier">range_value</span><span class="special">&lt;</span><span class="identifier">R</span><span class="special">&gt;::</span><span class="identifier">type</span></code>
+            </li>
 <li class="listitem">
-<code class="computeroutput"><span class="identifier">n</span><span class="special">,</span><span class="identifier">m</span></code> are integer expressions convertible
-            to <code class="computeroutput"><span class="identifier">range_difference</span><span class="special">&lt;</span><span class="identifier">R</span><span class="special">&gt;::</span><span class="identifier">type</span></code>
-</li>
+              <code class="computeroutput"><span class="identifier">n</span><span class="special">,</span><span class="identifier">m</span></code> are integer expressions convertible
+              to <code class="computeroutput"><span class="identifier">range_difference</span><span class="special">&lt;</span><span class="identifier">R</span><span class="special">&gt;::</span><span class="identifier">type</span></code>
+            </li>
 </ul></div>
 <p>
           Also note that <code class="computeroutput"><span class="identifier">boost</span><span class="special">::</span><span class="identifier">range_value</span><span class="special">&lt;</span><span class="identifier">R</span><span class="special">&gt;::</span><span class="identifier">type</span></code> must be implicitly convertible to
@@ -135,7 +135,7 @@
 </tr></table>
 <hr>
 <div class="spirit-nav">
-<a accesskey="p" href="introduction.html"><img src="../../../../../../../doc/html/images/prev.png" alt="Prev"></a><a accesskey="u" href="../adaptors.html"><img src="../../../../../../../doc/html/images/up.png" alt="Up"></a><a accesskey="h" href="../../../index.html"><img src="../../../../../../../doc/html/images/home.png" alt="Home"></a><a accesskey="n" href="reference.html"><img src="../../../../../../../doc/html/images/next.png" alt="Next"></a>
+<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>
 </body>
 </html>
diff --git a/doc/html/range/reference/adaptors/introduction.html b/doc/html/range/reference/adaptors/introduction.html
index 1982491..bdf55ce 100644
--- a/doc/html/range/reference/adaptors/introduction.html
+++ b/doc/html/range/reference/adaptors/introduction.html
@@ -2,8 +2,8 @@
 <head>
 <meta http-equiv="Content-Type" content="text/html; charset=US-ASCII">
 <title>Introduction and motivation</title>
-<link rel="stylesheet" href="../../../../../../../doc/html/boostbook.css" type="text/css">
-<meta name="generator" content="DocBook XSL Stylesheets V1.75.1">
+<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="../adaptors.html" title="Range Adaptors">
 <link rel="prev" href="../adaptors.html" title="Range Adaptors">
@@ -13,16 +13,16 @@
 <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="../../../../../../libraries.htm">Libraries</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="../adaptors.html"><img src="../../../../../../../doc/html/images/prev.png" alt="Prev"></a><a accesskey="u" href="../adaptors.html"><img src="../../../../../../../doc/html/images/up.png" alt="Up"></a><a accesskey="h" href="../../../index.html"><img src="../../../../../../../doc/html/images/home.png" alt="Home"></a><a accesskey="n" href="general_requirements.html"><img src="../../../../../../../doc/html/images/next.png" alt="Next"></a>
+<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" title="Introduction and motivation">
+<div class="section">
 <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>
@@ -122,7 +122,7 @@
           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="id2701931"></a>
+<a name="id3275775"></a>
           <a class="link" href="introduction.html#range.reference.adaptors.introduction.composition_of_adaptors">Composition
           of Adaptors</a>
         </h6>
@@ -132,8 +132,14 @@
           to algorithms. For example, consider these Range algorithms:
         </p>
 <div class="itemizedlist"><ul class="itemizedlist" type="disc">
-<li class="listitem"><code class="computeroutput"><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">out</span> <span class="special">)</span></code></li>
-<li class="listitem"><code class="computeroutput"><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">pred</span> <span class="special">)</span></code></li>
+<li class="listitem">
+              <code class="computeroutput"><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">out</span> <span class="special">)</span></code>
+            </li>
+<li class="listitem">
+              <code class="computeroutput"><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">pred</span> <span class="special">)</span></code>
+            </li>
 </ul></div>
 <p>
           What should we do if we only want to copy an element <code class="computeroutput"><span class="identifier">a</span></code>
@@ -142,13 +148,17 @@
           The naive answer would be to use these algorithms:
         </p>
 <div class="itemizedlist"><ul class="itemizedlist" type="disc">
-<li class="listitem"><code class="computeroutput"><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></code></li>
-<li class="listitem"><code class="computeroutput"><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></code></li>
+<li class="listitem">
+              <code class="computeroutput"><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></code>
+            </li>
+<li class="listitem">
+              <code class="computeroutput"><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></code>
+            </li>
 </ul></div>
 <p>
           These algorithms are only defined to maintain a one to one relationship
@@ -159,7 +169,7 @@
           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="id2702239"></a>
+<a name="id3276074"></a>
           <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>
@@ -176,7 +186,7 @@
 <p>
         </p>
 <a name="range.reference.adaptors.introduction.range_adaptor_alternative_to_count_if_algorithm"></a><h6>
-<a name="id2702408"></a>
+<a name="id3276244"></a>
           <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>
@@ -268,7 +278,7 @@
 </tr></table>
 <hr>
 <div class="spirit-nav">
-<a accesskey="p" href="../adaptors.html"><img src="../../../../../../../doc/html/images/prev.png" alt="Prev"></a><a accesskey="u" href="../adaptors.html"><img src="../../../../../../../doc/html/images/up.png" alt="Up"></a><a accesskey="h" href="../../../index.html"><img src="../../../../../../../doc/html/images/home.png" alt="Home"></a><a accesskey="n" href="general_requirements.html"><img src="../../../../../../../doc/html/images/next.png" alt="Next"></a>
+<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>
 </body>
 </html>
diff --git a/doc/html/range/reference/adaptors/reference.html b/doc/html/range/reference/adaptors/reference.html
index a76fbcb..b026090 100644
--- a/doc/html/range/reference/adaptors/reference.html
+++ b/doc/html/range/reference/adaptors/reference.html
@@ -2,8 +2,8 @@
 <head>
 <meta http-equiv="Content-Type" content="text/html; charset=US-ASCII">
 <title>Reference</title>
-<link rel="stylesheet" href="../../../../../../../doc/html/boostbook.css" type="text/css">
-<meta name="generator" content="DocBook XSL Stylesheets V1.75.1">
+<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="../adaptors.html" title="Range Adaptors">
 <link rel="prev" href="general_requirements.html" title="General Requirements">
@@ -13,16 +13,16 @@
 <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="../../../../../../libraries.htm">Libraries</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="general_requirements.html"><img src="../../../../../../../doc/html/images/prev.png" alt="Prev"></a><a accesskey="u" href="../adaptors.html"><img src="../../../../../../../doc/html/images/up.png" alt="Up"></a><a accesskey="h" href="../../../index.html"><img src="../../../../../../../doc/html/images/home.png" alt="Home"></a><a accesskey="n" href="reference/adjacent_filtered.html"><img src="../../../../../../../doc/html/images/next.png" alt="Next"></a>
+<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" title="Reference">
+<div class="section">
 <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>
@@ -57,7 +57,7 @@
 </tr></table>
 <hr>
 <div class="spirit-nav">
-<a accesskey="p" href="general_requirements.html"><img src="../../../../../../../doc/html/images/prev.png" alt="Prev"></a><a accesskey="u" href="../adaptors.html"><img src="../../../../../../../doc/html/images/up.png" alt="Up"></a><a accesskey="h" href="../../../index.html"><img src="../../../../../../../doc/html/images/home.png" alt="Home"></a><a accesskey="n" href="reference/adjacent_filtered.html"><img src="../../../../../../../doc/html/images/next.png" alt="Next"></a>
+<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>
 </body>
 </html>
diff --git a/doc/html/range/reference/adaptors/reference/adjacent_filtered.html b/doc/html/range/reference/adaptors/reference/adjacent_filtered.html
index c6d4404..31128ea 100644
--- a/doc/html/range/reference/adaptors/reference/adjacent_filtered.html
+++ b/doc/html/range/reference/adaptors/reference/adjacent_filtered.html
@@ -2,8 +2,8 @@
 <head>
 <meta http-equiv="Content-Type" content="text/html; charset=US-ASCII">
 <title>adjacent_filtered</title>
-<link rel="stylesheet" href="../../../../../../../../doc/html/boostbook.css" type="text/css">
-<meta name="generator" content="DocBook XSL Stylesheets V1.75.1">
+<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="../reference.html" title="Reference">
 <link rel="prev" href="../reference.html" title="Reference">
@@ -13,16 +13,16 @@
 <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="../../../../../../../libraries.htm">Libraries</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="../reference.html"><img src="../../../../../../../../doc/html/images/prev.png" alt="Prev"></a><a accesskey="u" href="../reference.html"><img src="../../../../../../../../doc/html/images/up.png" alt="Up"></a><a accesskey="h" href="../../../../index.html"><img src="../../../../../../../../doc/html/images/home.png" alt="Home"></a><a accesskey="n" href="copied.html"><img src="../../../../../../../../doc/html/images/next.png" alt="Next"></a>
+<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" title="adjacent_filtered">
+<div class="section">
 <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>
@@ -77,29 +77,30 @@
 </table></div>
 <div class="itemizedlist"><ul class="itemizedlist" type="disc">
 <li class="listitem">
-<span class="bold"><strong>Precondition:</strong></span> The <code class="computeroutput"><span class="identifier">value_type</span></code>
-              of the range is convertible to both argument types of <code class="computeroutput"><span class="identifier">bi_pred</span></code>.
-            </li>
+                <span class="bold"><strong>Precondition:</strong></span> The <code class="computeroutput"><span class="identifier">value_type</span></code> of the range is convertible
+                to both argument types of <code class="computeroutput"><span class="identifier">bi_pred</span></code>.
+              </li>
 <li class="listitem">
-<span class="bold"><strong>Postcondition:</strong></span> 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> in the returned range, <code class="computeroutput"><span class="identifier">bi_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>.
-            </li>
+                <span class="bold"><strong>Postcondition:</strong></span> 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> in the returned range, <code class="computeroutput"><span class="identifier">bi_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>.
+              </li>
 <li class="listitem">
-<span class="bold"><strong>Throws:</strong></span> Whatever the copy constructor
-              of <code class="computeroutput"><span class="identifier">bi_pred</span></code> might throw.
-            </li>
+                <span class="bold"><strong>Throws:</strong></span> Whatever the copy constructor
+                of <code class="computeroutput"><span class="identifier">bi_pred</span></code> might
+                throw.
+              </li>
 <li class="listitem">
-<span class="bold"><strong>Range Category:</strong></span><a class="link" href="../../../concepts/single_pass_range.html" title="Single Pass Range">Single
-              Pass Range</a>
-</li>
+                <span class="bold"><strong>Range Category:</strong></span> <a class="link" href="../../../concepts/single_pass_range.html" title="Single Pass Range">Single
+                Pass Range</a>
+              </li>
 <li class="listitem">
-<span class="bold"><strong>Returned Range Category:</strong></span> The minimum
-              of the range category of <code class="computeroutput"><span class="identifier">rng</span></code>
-              and <a class="link" href="../../../concepts/forward_range.html" title="Forward Range">Forward Range</a>
-</li>
+                <span class="bold"><strong>Returned Range Category:</strong></span> The minimum
+                of the range category of <code class="computeroutput"><span class="identifier">rng</span></code>
+                and <a class="link" href="../../../concepts/forward_range.html" title="Forward Range">Forward Range</a>
+              </li>
 </ul></div>
-<div class="section" title="adjacent_filtered example">
+<div class="section">
 <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>
@@ -151,7 +152,7 @@
 </tr></table>
 <hr>
 <div class="spirit-nav">
-<a accesskey="p" href="../reference.html"><img src="../../../../../../../../doc/html/images/prev.png" alt="Prev"></a><a accesskey="u" href="../reference.html"><img src="../../../../../../../../doc/html/images/up.png" alt="Up"></a><a accesskey="h" href="../../../../index.html"><img src="../../../../../../../../doc/html/images/home.png" alt="Home"></a><a accesskey="n" href="copied.html"><img src="../../../../../../../../doc/html/images/next.png" alt="Next"></a>
+<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>
 </body>
 </html>
diff --git a/doc/html/range/reference/adaptors/reference/copied.html b/doc/html/range/reference/adaptors/reference/copied.html
index 24b72f1..b690eba 100644
--- a/doc/html/range/reference/adaptors/reference/copied.html
+++ b/doc/html/range/reference/adaptors/reference/copied.html
@@ -2,8 +2,8 @@
 <head>
 <meta http-equiv="Content-Type" content="text/html; charset=US-ASCII">
 <title>copied</title>
-<link rel="stylesheet" href="../../../../../../../../doc/html/boostbook.css" type="text/css">
-<meta name="generator" content="DocBook XSL Stylesheets V1.75.1">
+<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="../reference.html" title="Reference">
 <link rel="prev" href="adjacent_filtered.html" title="adjacent_filtered">
@@ -13,16 +13,16 @@
 <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="../../../../../../../libraries.htm">Libraries</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="adjacent_filtered.html"><img src="../../../../../../../../doc/html/images/prev.png" alt="Prev"></a><a accesskey="u" href="../reference.html"><img src="../../../../../../../../doc/html/images/up.png" alt="Up"></a><a accesskey="h" href="../../../../index.html"><img src="../../../../../../../../doc/html/images/home.png" alt="Home"></a><a accesskey="n" href="filtered.html"><img src="../../../../../../../../doc/html/images/next.png" alt="Next"></a>
+<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" title="copied">
+<div class="section">
 <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>
@@ -78,28 +78,28 @@
 </table></div>
 <div class="itemizedlist"><ul class="itemizedlist" type="disc">
 <li class="listitem">
-<span class="bold"><strong>Precondition:</strong></span><code class="computeroutput"><span class="number">0</span>
-              <span class="special">&lt;=</span> <span class="identifier">n</span>
-              <span class="special">&amp;&amp;</span> <span class="identifier">n</span>
-              <span class="special">&lt;=</span> <span class="identifier">m</span>
-              <span class="special">&amp;&amp;</span> <span class="identifier">m</span>
-              <span class="special">&lt;</span> <span class="identifier">distance</span><span class="special">(</span><span class="identifier">rng</span><span class="special">)</span></code>
-</li>
+                <span class="bold"><strong>Precondition:</strong></span> <code class="computeroutput"><span class="number">0</span>
+                <span class="special">&lt;=</span> <span class="identifier">n</span>
+                <span class="special">&amp;&amp;</span> <span class="identifier">n</span>
+                <span class="special">&lt;=</span> <span class="identifier">m</span>
+                <span class="special">&amp;&amp;</span> <span class="identifier">m</span>
+                <span class="special">&lt;</span> <span class="identifier">distance</span><span class="special">(</span><span class="identifier">rng</span><span class="special">)</span></code>
+              </li>
 <li class="listitem">
-<span class="bold"><strong>Returns:</strong></span> A new <code class="computeroutput"><span class="identifier">iterator_range</span></code>
-              that holds the sliced range <code class="computeroutput"><span class="special">[</span><span class="identifier">n</span><span class="special">,</span><span class="identifier">m</span><span class="special">)</span></code>
-              of the original range.
-            </li>
+                <span class="bold"><strong>Returns:</strong></span> A new <code class="computeroutput"><span class="identifier">iterator_range</span></code>
+                that holds the sliced range <code class="computeroutput"><span class="special">[</span><span class="identifier">n</span><span class="special">,</span><span class="identifier">m</span><span class="special">)</span></code>
+                of the original range.
+              </li>
 <li class="listitem">
-<span class="bold"><strong>Range Category:</strong></span><a class="link" href="../../../concepts/random_access_range.html" title="Random Access Range">Random
-              Access Range</a>
-</li>
+                <span class="bold"><strong>Range Category:</strong></span> <a class="link" href="../../../concepts/random_access_range.html" title="Random Access Range">Random
+                Access Range</a>
+              </li>
 <li class="listitem">
-<span class="bold"><strong>Returned Range Category:</strong></span><a class="link" href="../../../concepts/random_access_range.html" title="Random Access Range">Random
-              Access Range</a>
-</li>
+                <span class="bold"><strong>Returned Range Category:</strong></span> <a class="link" href="../../../concepts/random_access_range.html" title="Random Access Range">Random
+                Access Range</a>
+              </li>
 </ul></div>
-<div class="section" title="copied example">
+<div class="section">
 <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>
@@ -150,7 +150,7 @@
 </tr></table>
 <hr>
 <div class="spirit-nav">
-<a accesskey="p" href="adjacent_filtered.html"><img src="../../../../../../../../doc/html/images/prev.png" alt="Prev"></a><a accesskey="u" href="../reference.html"><img src="../../../../../../../../doc/html/images/up.png" alt="Up"></a><a accesskey="h" href="../../../../index.html"><img src="../../../../../../../../doc/html/images/home.png" alt="Home"></a><a accesskey="n" href="filtered.html"><img src="../../../../../../../../doc/html/images/next.png" alt="Next"></a>
+<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>
 </body>
 </html>
diff --git a/doc/html/range/reference/adaptors/reference/filtered.html b/doc/html/range/reference/adaptors/reference/filtered.html
index 6ce9f3c..1d21ce0 100644
--- a/doc/html/range/reference/adaptors/reference/filtered.html
+++ b/doc/html/range/reference/adaptors/reference/filtered.html
@@ -2,8 +2,8 @@
 <head>
 <meta http-equiv="Content-Type" content="text/html; charset=US-ASCII">
 <title>filtered</title>
-<link rel="stylesheet" href="../../../../../../../../doc/html/boostbook.css" type="text/css">
-<meta name="generator" content="DocBook XSL Stylesheets V1.75.1">
+<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="../reference.html" title="Reference">
 <link rel="prev" href="copied.html" title="copied">
@@ -13,16 +13,16 @@
 <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="../../../../../../../libraries.htm">Libraries</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="copied.html"><img src="../../../../../../../../doc/html/images/prev.png" alt="Prev"></a><a accesskey="u" href="../reference.html"><img src="../../../../../../../../doc/html/images/up.png" alt="Up"></a><a accesskey="h" href="../../../../index.html"><img src="../../../../../../../../doc/html/images/home.png" alt="Home"></a><a accesskey="n" href="indexed.html"><img src="../../../../../../../../doc/html/images/next.png" alt="Next"></a>
+<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" title="filtered">
+<div class="section">
 <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>
@@ -76,30 +76,30 @@
 </table></div>
 <div class="itemizedlist"><ul class="itemizedlist" type="disc">
 <li class="listitem">
-<span class="bold"><strong>Precondition:</strong></span> The <code class="computeroutput"><span class="identifier">value_type</span></code>
-              of the range is convertible to the argument type of <code class="computeroutput"><span class="identifier">pred</span></code>.
-            </li>
+                <span class="bold"><strong>Precondition:</strong></span> The <code class="computeroutput"><span class="identifier">value_type</span></code> of the range is convertible
+                to the argument type of <code class="computeroutput"><span class="identifier">pred</span></code>.
+              </li>
 <li class="listitem">
-<span class="bold"><strong>Postcondition:</strong></span> For all adjacent elements
-              <code class="computeroutput"><span class="special">[</span><span class="identifier">x</span><span class="special">]</span></code> in the returned range, <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>.
-            </li>
+                <span class="bold"><strong>Postcondition:</strong></span> For all adjacent
+                elements <code class="computeroutput"><span class="special">[</span><span class="identifier">x</span><span class="special">]</span></code> in the returned range, <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>.
+              </li>
 <li class="listitem">
-<span class="bold"><strong>Throws:</strong></span> Whatever the copy constructor
-              of <code class="computeroutput"><span class="identifier">pred</span></code> might throw.
-            </li>
+                <span class="bold"><strong>Throws:</strong></span> Whatever the copy constructor
+                of <code class="computeroutput"><span class="identifier">pred</span></code> might throw.
+              </li>
 <li class="listitem">
-<span class="bold"><strong>Range Category:</strong></span><a class="link" href="../../../concepts/forward_range.html" title="Forward Range">Forward
-              Range</a>
-</li>
+                <span class="bold"><strong>Range Category:</strong></span> <a class="link" href="../../../concepts/forward_range.html" title="Forward Range">Forward
+                Range</a>
+              </li>
 <li class="listitem">
-<span class="bold"><strong>Returned Range Category:</strong></span> The minimum
-              of the range category of <code class="computeroutput"><span class="identifier">rng</span></code>
-              and <a class="link" href="../../../concepts/bidirectional_range.html" title="Bidirectional Range">Bidirectional
-              Range</a>
-</li>
+                <span class="bold"><strong>Returned Range Category:</strong></span> The minimum
+                of the range category of <code class="computeroutput"><span class="identifier">rng</span></code>
+                and <a class="link" href="../../../concepts/bidirectional_range.html" title="Bidirectional Range">Bidirectional
+                Range</a>
+              </li>
 </ul></div>
-<div class="section" title="filtered example">
+<div class="section">
 <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>
@@ -153,7 +153,7 @@
 </tr></table>
 <hr>
 <div class="spirit-nav">
-<a accesskey="p" href="copied.html"><img src="../../../../../../../../doc/html/images/prev.png" alt="Prev"></a><a accesskey="u" href="../reference.html"><img src="../../../../../../../../doc/html/images/up.png" alt="Up"></a><a accesskey="h" href="../../../../index.html"><img src="../../../../../../../../doc/html/images/home.png" alt="Home"></a><a accesskey="n" href="indexed.html"><img src="../../../../../../../../doc/html/images/next.png" alt="Next"></a>
+<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>
 </body>
 </html>
diff --git a/doc/html/range/reference/adaptors/reference/indexed.html b/doc/html/range/reference/adaptors/reference/indexed.html
index 3ef95df..45bcbef 100644
--- a/doc/html/range/reference/adaptors/reference/indexed.html
+++ b/doc/html/range/reference/adaptors/reference/indexed.html
@@ -2,8 +2,8 @@
 <head>
 <meta http-equiv="Content-Type" content="text/html; charset=US-ASCII">
 <title>indexed</title>
-<link rel="stylesheet" href="../../../../../../../../doc/html/boostbook.css" type="text/css">
-<meta name="generator" content="DocBook XSL Stylesheets V1.75.1">
+<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="../reference.html" title="Reference">
 <link rel="prev" href="filtered.html" title="filtered">
@@ -13,16 +13,16 @@
 <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="../../../../../../../libraries.htm">Libraries</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="filtered.html"><img src="../../../../../../../../doc/html/images/prev.png" alt="Prev"></a><a accesskey="u" href="../reference.html"><img src="../../../../../../../../doc/html/images/up.png" alt="Up"></a><a accesskey="h" href="../../../../index.html"><img src="../../../../../../../../doc/html/images/home.png" alt="Home"></a><a accesskey="n" href="indirected.html"><img src="../../../../../../../../doc/html/images/next.png" alt="Next"></a>
+<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" title="indexed">
+<div class="section">
 <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>
@@ -75,23 +75,23 @@
 </table></div>
 <div class="itemizedlist"><ul class="itemizedlist" type="disc">
 <li class="listitem">
-<span class="bold"><strong>Returns:</strong></span> 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 <code class="computeroutput"><span class="identifier">index</span><span class="special">()</span></code>
-              member function that returns the appropriate index for the element
-              in the sequence corresponding with the iterator.
-            </li>
+                <span class="bold"><strong>Returns:</strong></span> 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 <code class="computeroutput"><span class="identifier">index</span><span class="special">()</span></code>
+                member function that returns the appropriate index for the element
+                in the sequence corresponding with the iterator.
+              </li>
 <li class="listitem">
-<span class="bold"><strong>Range Category:</strong></span><a class="link" href="../../../concepts/single_pass_range.html" title="Single Pass Range">Single
-              Pass Range</a>
-</li>
+                <span class="bold"><strong>Range Category:</strong></span> <a class="link" href="../../../concepts/single_pass_range.html" title="Single Pass Range">Single
+                Pass Range</a>
+              </li>
 <li class="listitem">
-<span class="bold"><strong>Returned Range Category:</strong></span> The range
-              category of <code class="computeroutput"><span class="identifier">rng</span></code>
-</li>
+                <span class="bold"><strong>Returned Range Category:</strong></span> The range
+                category of <code class="computeroutput"><span class="identifier">rng</span></code>
+              </li>
 </ul></div>
-<div class="section" title="indexed example">
+<div class="section">
 <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>
@@ -184,7 +184,7 @@
 </tr></table>
 <hr>
 <div class="spirit-nav">
-<a accesskey="p" href="filtered.html"><img src="../../../../../../../../doc/html/images/prev.png" alt="Prev"></a><a accesskey="u" href="../reference.html"><img src="../../../../../../../../doc/html/images/up.png" alt="Up"></a><a accesskey="h" href="../../../../index.html"><img src="../../../../../../../../doc/html/images/home.png" alt="Home"></a><a accesskey="n" href="indirected.html"><img src="../../../../../../../../doc/html/images/next.png" alt="Next"></a>
+<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>
 </body>
 </html>
diff --git a/doc/html/range/reference/adaptors/reference/indirected.html b/doc/html/range/reference/adaptors/reference/indirected.html
index 7dc0558..7360891 100644
--- a/doc/html/range/reference/adaptors/reference/indirected.html
+++ b/doc/html/range/reference/adaptors/reference/indirected.html
@@ -2,8 +2,8 @@
 <head>
 <meta http-equiv="Content-Type" content="text/html; charset=US-ASCII">
 <title>indirected</title>
-<link rel="stylesheet" href="../../../../../../../../doc/html/boostbook.css" type="text/css">
-<meta name="generator" content="DocBook XSL Stylesheets V1.75.1">
+<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="../reference.html" title="Reference">
 <link rel="prev" href="indexed.html" title="indexed">
@@ -13,16 +13,16 @@
 <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="../../../../../../../libraries.htm">Libraries</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="indexed.html"><img src="../../../../../../../../doc/html/images/prev.png" alt="Prev"></a><a accesskey="u" href="../reference.html"><img src="../../../../../../../../doc/html/images/up.png" alt="Up"></a><a accesskey="h" href="../../../../index.html"><img src="../../../../../../../../doc/html/images/home.png" alt="Home"></a><a accesskey="n" href="map_keys.html"><img src="../../../../../../../../doc/html/images/next.png" alt="Next"></a>
+<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" title="indirected">
+<div class="section">
 <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>
@@ -75,24 +75,27 @@
 </table></div>
 <div class="itemizedlist"><ul class="itemizedlist" type="disc">
 <li class="listitem">
-<span class="bold"><strong>Precondition:</strong></span> The <code class="computeroutput"><span class="identifier">value_type</span></code>
-              of the range defines unary <code class="computeroutput"><span class="keyword">operator</span><span class="special">*()</span></code>
-</li>
+                <span class="bold"><strong>Precondition:</strong></span> The <code class="computeroutput"><span class="identifier">value_type</span></code> of the range defines
+                unary <code class="computeroutput"><span class="keyword">operator</span><span class="special">*()</span></code>
+              </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 range, <code class="computeroutput"><span class="identifier">x</span></code> is the result of <code class="computeroutput"><span class="special">*</span><span class="identifier">y</span></code>
-              where <code class="computeroutput"><span class="identifier">y</span></code> is the corresponding
-              element in the original range.
-            </li>
+                <span class="bold"><strong>Postcondition:</strong></span> For all elements
+                <code class="computeroutput"><span class="identifier">x</span></code> in the returned
+                range, <code class="computeroutput"><span class="identifier">x</span></code> is the result
+                of <code class="computeroutput"><span class="special">*</span><span class="identifier">y</span></code>
+                where <code class="computeroutput"><span class="identifier">y</span></code> is the corresponding
+                element in the original range.
+              </li>
 <li class="listitem">
-<span class="bold"><strong>Range Category:</strong></span><a class="link" href="../../../concepts/single_pass_range.html" title="Single Pass Range">Single
-              Pass Range</a>
-</li>
+                <span class="bold"><strong>Range Category:</strong></span> <a class="link" href="../../../concepts/single_pass_range.html" title="Single Pass Range">Single
+                Pass Range</a>
+              </li>
 <li class="listitem">
-<span class="bold"><strong>Returned Range Category:</strong></span> The range
-              category of <code class="computeroutput"><span class="identifier">rng</span></code>
-</li>
+                <span class="bold"><strong>Returned Range Category:</strong></span> The range
+                category of <code class="computeroutput"><span class="identifier">rng</span></code>
+              </li>
 </ul></div>
-<div class="section" title="indirected example">
+<div class="section">
 <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>
@@ -144,7 +147,7 @@
 </tr></table>
 <hr>
 <div class="spirit-nav">
-<a accesskey="p" href="indexed.html"><img src="../../../../../../../../doc/html/images/prev.png" alt="Prev"></a><a accesskey="u" href="../reference.html"><img src="../../../../../../../../doc/html/images/up.png" alt="Up"></a><a accesskey="h" href="../../../../index.html"><img src="../../../../../../../../doc/html/images/home.png" alt="Home"></a><a accesskey="n" href="map_keys.html"><img src="../../../../../../../../doc/html/images/next.png" alt="Next"></a>
+<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>
 </body>
 </html>
diff --git a/doc/html/range/reference/adaptors/reference/map_keys.html b/doc/html/range/reference/adaptors/reference/map_keys.html
index 6c69774..3b8e621 100644
--- a/doc/html/range/reference/adaptors/reference/map_keys.html
+++ b/doc/html/range/reference/adaptors/reference/map_keys.html
@@ -2,8 +2,8 @@
 <head>
 <meta http-equiv="Content-Type" content="text/html; charset=US-ASCII">
 <title>map_keys</title>
-<link rel="stylesheet" href="../../../../../../../../doc/html/boostbook.css" type="text/css">
-<meta name="generator" content="DocBook XSL Stylesheets V1.75.1">
+<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="../reference.html" title="Reference">
 <link rel="prev" href="indirected.html" title="indirected">
@@ -13,16 +13,16 @@
 <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="../../../../../../../libraries.htm">Libraries</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="indirected.html"><img src="../../../../../../../../doc/html/images/prev.png" alt="Prev"></a><a accesskey="u" href="../reference.html"><img src="../../../../../../../../doc/html/images/up.png" alt="Up"></a><a accesskey="h" href="../../../../index.html"><img src="../../../../../../../../doc/html/images/home.png" alt="Home"></a><a accesskey="n" href="map_values.html"><img src="../../../../../../../../doc/html/images/next.png" alt="Next"></a>
+<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" title="map_keys">
+<div class="section">
 <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>
@@ -75,23 +75,26 @@
 </table></div>
 <div class="itemizedlist"><ul class="itemizedlist" type="disc">
 <li class="listitem">
-<span class="bold"><strong>Precondition:</strong></span> The <code class="computeroutput"><span class="identifier">value_type</span></code>
-              of the range is an instantiation of <code class="computeroutput"><span class="identifier">std</span><span class="special">::</span><span class="identifier">pair</span></code>.
-            </li>
+                <span class="bold"><strong>Precondition:</strong></span> The <code class="computeroutput"><span class="identifier">value_type</span></code> of the range is an instantiation
+                of <code class="computeroutput"><span class="identifier">std</span><span class="special">::</span><span class="identifier">pair</span></code>.
+              </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 range, <code class="computeroutput"><span class="identifier">x</span></code> is the result of <code class="computeroutput"><span class="identifier">y</span><span class="special">.</span><span class="identifier">first</span></code> where <code class="computeroutput"><span class="identifier">y</span></code>
-              is the corresponding element in the original range.
-            </li>
+                <span class="bold"><strong>Postcondition:</strong></span> For all elements
+                <code class="computeroutput"><span class="identifier">x</span></code> in the returned
+                range, <code class="computeroutput"><span class="identifier">x</span></code> is the result
+                of <code class="computeroutput"><span class="identifier">y</span><span class="special">.</span><span class="identifier">first</span></code> where <code class="computeroutput"><span class="identifier">y</span></code>
+                is the corresponding element in the original range.
+              </li>
 <li class="listitem">
-<span class="bold"><strong>Range Category:</strong></span><a class="link" href="../../../concepts/single_pass_range.html" title="Single Pass Range">Single
-              Pass Range</a>
-</li>
+                <span class="bold"><strong>Range Category:</strong></span> <a class="link" href="../../../concepts/single_pass_range.html" title="Single Pass Range">Single
+                Pass Range</a>
+              </li>
 <li class="listitem">
-<span class="bold"><strong>Returned Range Category:</strong></span> The range
-              category of <code class="computeroutput"><span class="identifier">rng</span></code>.
-            </li>
+                <span class="bold"><strong>Returned Range Category:</strong></span> The range
+                category of <code class="computeroutput"><span class="identifier">rng</span></code>.
+              </li>
 </ul></div>
-<div class="section" title="map_keys example">
+<div class="section">
 <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>
@@ -144,7 +147,7 @@
 </tr></table>
 <hr>
 <div class="spirit-nav">
-<a accesskey="p" href="indirected.html"><img src="../../../../../../../../doc/html/images/prev.png" alt="Prev"></a><a accesskey="u" href="../reference.html"><img src="../../../../../../../../doc/html/images/up.png" alt="Up"></a><a accesskey="h" href="../../../../index.html"><img src="../../../../../../../../doc/html/images/home.png" alt="Home"></a><a accesskey="n" href="map_values.html"><img src="../../../../../../../../doc/html/images/next.png" alt="Next"></a>
+<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>
 </body>
 </html>
diff --git a/doc/html/range/reference/adaptors/reference/map_values.html b/doc/html/range/reference/adaptors/reference/map_values.html
index 6a906b2..c55f9ae 100644
--- a/doc/html/range/reference/adaptors/reference/map_values.html
+++ b/doc/html/range/reference/adaptors/reference/map_values.html
@@ -2,8 +2,8 @@
 <head>
 <meta http-equiv="Content-Type" content="text/html; charset=US-ASCII">
 <title>map_values</title>
-<link rel="stylesheet" href="../../../../../../../../doc/html/boostbook.css" type="text/css">
-<meta name="generator" content="DocBook XSL Stylesheets V1.75.1">
+<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="../reference.html" title="Reference">
 <link rel="prev" href="map_keys.html" title="map_keys">
@@ -13,16 +13,16 @@
 <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="../../../../../../../libraries.htm">Libraries</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="map_keys.html"><img src="../../../../../../../../doc/html/images/prev.png" alt="Prev"></a><a accesskey="u" href="../reference.html"><img src="../../../../../../../../doc/html/images/up.png" alt="Up"></a><a accesskey="h" href="../../../../index.html"><img src="../../../../../../../../doc/html/images/home.png" alt="Home"></a><a accesskey="n" href="replaced.html"><img src="../../../../../../../../doc/html/images/next.png" alt="Next"></a>
+<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" title="map_values">
+<div class="section">
 <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>
@@ -75,23 +75,26 @@
 </table></div>
 <div class="itemizedlist"><ul class="itemizedlist" type="disc">
 <li class="listitem">
-<span class="bold"><strong>Precondition:</strong></span> The <code class="computeroutput"><span class="identifier">value_type</span></code>
-              of the range is an instantiation of <code class="computeroutput"><span class="identifier">std</span><span class="special">::</span><span class="identifier">pair</span></code>.
-            </li>
+                <span class="bold"><strong>Precondition:</strong></span> The <code class="computeroutput"><span class="identifier">value_type</span></code> of the range is an instantiation
+                of <code class="computeroutput"><span class="identifier">std</span><span class="special">::</span><span class="identifier">pair</span></code>.
+              </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 range, <code class="computeroutput"><span class="identifier">x</span></code> is the result of <code class="computeroutput"><span class="identifier">y</span><span class="special">.</span><span class="identifier">second</span></code> where <code class="computeroutput"><span class="identifier">y</span></code>
-              is the corresponding element in the original range.
-            </li>
+                <span class="bold"><strong>Postcondition:</strong></span> For all elements
+                <code class="computeroutput"><span class="identifier">x</span></code> in the returned
+                range, <code class="computeroutput"><span class="identifier">x</span></code> is the result
+                of <code class="computeroutput"><span class="identifier">y</span><span class="special">.</span><span class="identifier">second</span></code> where <code class="computeroutput"><span class="identifier">y</span></code>
+                is the corresponding element in the original range.
+              </li>
 <li class="listitem">
-<span class="bold"><strong>Range Category:</strong></span><a class="link" href="../../../concepts/single_pass_range.html" title="Single Pass Range">Single
-              Pass Range</a>
-</li>
+                <span class="bold"><strong>Range Category:</strong></span> <a class="link" href="../../../concepts/single_pass_range.html" title="Single Pass Range">Single
+                Pass Range</a>
+              </li>
 <li class="listitem">
-<span class="bold"><strong>Returned Range Category:</strong></span> The range
-              category of <code class="computeroutput"><span class="identifier">rng</span></code>.
-            </li>
+                <span class="bold"><strong>Returned Range Category:</strong></span> The range
+                category of <code class="computeroutput"><span class="identifier">rng</span></code>.
+              </li>
 </ul></div>
-<div class="section" title="map_values example">
+<div class="section">
 <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>
@@ -144,7 +147,7 @@
 </tr></table>
 <hr>
 <div class="spirit-nav">
-<a accesskey="p" href="map_keys.html"><img src="../../../../../../../../doc/html/images/prev.png" alt="Prev"></a><a accesskey="u" href="../reference.html"><img src="../../../../../../../../doc/html/images/up.png" alt="Up"></a><a accesskey="h" href="../../../../index.html"><img src="../../../../../../../../doc/html/images/home.png" alt="Home"></a><a accesskey="n" href="replaced.html"><img src="../../../../../../../../doc/html/images/next.png" alt="Next"></a>
+<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>
 </body>
 </html>
diff --git a/doc/html/range/reference/adaptors/reference/replaced.html b/doc/html/range/reference/adaptors/reference/replaced.html
index 3bcfff4..da45959 100644
--- a/doc/html/range/reference/adaptors/reference/replaced.html
+++ b/doc/html/range/reference/adaptors/reference/replaced.html
@@ -2,8 +2,8 @@
 <head>
 <meta http-equiv="Content-Type" content="text/html; charset=US-ASCII">
 <title>replaced</title>
-<link rel="stylesheet" href="../../../../../../../../doc/html/boostbook.css" type="text/css">
-<meta name="generator" content="DocBook XSL Stylesheets V1.75.1">
+<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="../reference.html" title="Reference">
 <link rel="prev" href="map_values.html" title="map_values">
@@ -13,16 +13,16 @@
 <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="../../../../../../../libraries.htm">Libraries</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="map_values.html"><img src="../../../../../../../../doc/html/images/prev.png" alt="Prev"></a><a accesskey="u" href="../reference.html"><img src="../../../../../../../../doc/html/images/up.png" alt="Up"></a><a accesskey="h" href="../../../../index.html"><img src="../../../../../../../../doc/html/images/home.png" alt="Home"></a><a accesskey="n" href="replaced_if.html"><img src="../../../../../../../../doc/html/images/next.png" alt="Next"></a>
+<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" title="replaced">
+<div class="section">
 <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,37 +78,41 @@
 </table></div>
 <div class="itemizedlist"><ul class="itemizedlist" type="disc">
 <li class="listitem">
-<span class="bold"><strong>Precondition:</strong></span><div class="itemizedlist"><ul class="itemizedlist" type="circle">
+                <span class="bold"><strong>Precondition:</strong></span>
+                <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 range, the value
-              <code class="computeroutput"><span class="identifier">x</span></code> is equal to the value
-              of <code class="computeroutput"><span class="special">(</span><span class="identifier">y</span>
-              <span class="special">==</span> <span class="identifier">old_value</span><span class="special">)</span> <span class="special">?</span> <span class="identifier">new_value</span> <span class="special">:</span>
-              <span class="identifier">y</span></code> where <code class="computeroutput"><span class="identifier">y</span></code>
-              is the corresponding element in the original range.
-            </li>
+                <span class="bold"><strong>Postcondition:</strong></span> For all elements
+                <code class="computeroutput"><span class="identifier">x</span></code> in the returned
+                range, the value <code class="computeroutput"><span class="identifier">x</span></code>
+                is equal to the value of <code class="computeroutput"><span class="special">(</span><span class="identifier">y</span> <span class="special">==</span>
+                <span class="identifier">old_value</span><span class="special">)</span>
+                <span class="special">?</span> <span class="identifier">new_value</span>
+                <span class="special">:</span> <span class="identifier">y</span></code>
+                where <code class="computeroutput"><span class="identifier">y</span></code> is the corresponding
+                element in the original range.
+              </li>
 <li class="listitem">
-<span class="bold"><strong>Range Category:</strong></span><a class="link" href="../../../concepts/forward_range.html" title="Forward Range">Forward
-              Range</a>
-</li>
+                <span class="bold"><strong>Range Category:</strong></span> <a class="link" href="../../../concepts/forward_range.html" title="Forward Range">Forward
+                Range</a>
+              </li>
 <li class="listitem">
-<span class="bold"><strong>Returned Range Category:</strong></span> The range
-              category of <code class="computeroutput"><span class="identifier">rng</span></code>.
-            </li>
+                <span class="bold"><strong>Returned Range Category:</strong></span> The range
+                category of <code class="computeroutput"><span class="identifier">rng</span></code>.
+              </li>
 </ul></div>
-<div class="section" title="replaced example">
+<div class="section">
 <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>
@@ -159,7 +163,7 @@
 </tr></table>
 <hr>
 <div class="spirit-nav">
-<a accesskey="p" href="map_values.html"><img src="../../../../../../../../doc/html/images/prev.png" alt="Prev"></a><a accesskey="u" href="../reference.html"><img src="../../../../../../../../doc/html/images/up.png" alt="Up"></a><a accesskey="h" href="../../../../index.html"><img src="../../../../../../../../doc/html/images/home.png" alt="Home"></a><a accesskey="n" href="replaced_if.html"><img src="../../../../../../../../doc/html/images/next.png" alt="Next"></a>
+<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>
 </body>
 </html>
diff --git a/doc/html/range/reference/adaptors/reference/replaced_if.html b/doc/html/range/reference/adaptors/reference/replaced_if.html
index dbd181e..b3b77e3 100644
--- a/doc/html/range/reference/adaptors/reference/replaced_if.html
+++ b/doc/html/range/reference/adaptors/reference/replaced_if.html
@@ -2,8 +2,8 @@
 <head>
 <meta http-equiv="Content-Type" content="text/html; charset=US-ASCII">
 <title>replaced_if</title>
-<link rel="stylesheet" href="../../../../../../../../doc/html/boostbook.css" type="text/css">
-<meta name="generator" content="DocBook XSL Stylesheets V1.75.1">
+<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="../reference.html" title="Reference">
 <link rel="prev" href="replaced.html" title="replaced">
@@ -13,16 +13,16 @@
 <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="../../../../../../../libraries.htm">Libraries</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="replaced.html"><img src="../../../../../../../../doc/html/images/prev.png" alt="Prev"></a><a accesskey="u" href="../reference.html"><img src="../../../../../../../../doc/html/images/up.png" alt="Up"></a><a accesskey="h" href="../../../../index.html"><img src="../../../../../../../../doc/html/images/home.png" alt="Home"></a><a accesskey="n" href="reversed.html"><img src="../../../../../../../../doc/html/images/next.png" alt="Next"></a>
+<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" title="replaced_if">
+<div class="section">
 <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>
@@ -79,36 +79,37 @@
 </table></div>
 <div class="itemizedlist"><ul class="itemizedlist" type="disc">
 <li class="listitem">
-<span class="bold"><strong>Precondition:</strong></span><div class="itemizedlist"><ul class="itemizedlist" type="circle">
+                <span class="bold"><strong>Precondition:</strong></span>
+                <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 range,
-              the value <code class="computeroutput"><span class="identifier">x</span></code> is equal
-              to the value of <code class="computeroutput"><span class="identifier">pred</span><span class="special">(</span><span class="identifier">y</span><span class="special">)</span> <span class="special">?</span> <span class="identifier">new_value</span> <span class="special">:</span>
-              <span class="identifier">y</span></code> where <code class="computeroutput"><span class="identifier">y</span></code>
-              is the corresponding element in the original range.
-            </li>
+                <span class="bold"><strong>Postconditions:</strong></span> For all elements
+                <code class="computeroutput"><span class="identifier">x</span></code> in the returned
+                range, the value <code class="computeroutput"><span class="identifier">x</span></code>
+                is equal to the value of <code class="computeroutput"><span class="identifier">pred</span><span class="special">(</span><span class="identifier">y</span><span class="special">)</span> <span class="special">?</span> <span class="identifier">new_value</span> <span class="special">:</span>
+                <span class="identifier">y</span></code> where <code class="computeroutput"><span class="identifier">y</span></code>
+                is the corresponding element in the original range.
+              </li>
 <li class="listitem">
-<span class="bold"><strong>Range Category:</strong></span><a class="link" href="../../../concepts/forward_range.html" title="Forward Range">Forward
-              Range</a>
-</li>
+                <span class="bold"><strong>Range Category:</strong></span> <a class="link" href="../../../concepts/forward_range.html" title="Forward Range">Forward
+                Range</a>
+              </li>
 <li class="listitem">
-<span class="bold"><strong>Returned Range Category:</strong></span> The range
-              category of <code class="computeroutput"><span class="identifier">rng</span></code>.
-            </li>
+                <span class="bold"><strong>Returned Range Category:</strong></span> The range
+                category of <code class="computeroutput"><span class="identifier">rng</span></code>.
+              </li>
 </ul></div>
-<div class="section" title="replaced_if example">
+<div class="section">
 <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>
@@ -164,7 +165,7 @@
 </tr></table>
 <hr>
 <div class="spirit-nav">
-<a accesskey="p" href="replaced.html"><img src="../../../../../../../../doc/html/images/prev.png" alt="Prev"></a><a accesskey="u" href="../reference.html"><img src="../../../../../../../../doc/html/images/up.png" alt="Up"></a><a accesskey="h" href="../../../../index.html"><img src="../../../../../../../../doc/html/images/home.png" alt="Home"></a><a accesskey="n" href="reversed.html"><img src="../../../../../../../../doc/html/images/next.png" alt="Next"></a>
+<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>
 </body>
 </html>
diff --git a/doc/html/range/reference/adaptors/reference/reversed.html b/doc/html/range/reference/adaptors/reference/reversed.html
index f8d2f26..2b192f9 100644
--- a/doc/html/range/reference/adaptors/reference/reversed.html
+++ b/doc/html/range/reference/adaptors/reference/reversed.html
@@ -2,8 +2,8 @@
 <head>
 <meta http-equiv="Content-Type" content="text/html; charset=US-ASCII">
 <title>reversed</title>
-<link rel="stylesheet" href="../../../../../../../../doc/html/boostbook.css" type="text/css">
-<meta name="generator" content="DocBook XSL Stylesheets V1.75.1">
+<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="../reference.html" title="Reference">
 <link rel="prev" href="replaced_if.html" title="replaced_if">
@@ -13,16 +13,16 @@
 <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="../../../../../../../libraries.htm">Libraries</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="replaced_if.html"><img src="../../../../../../../../doc/html/images/prev.png" alt="Prev"></a><a accesskey="u" href="../reference.html"><img src="../../../../../../../../doc/html/images/up.png" alt="Up"></a><a accesskey="h" href="../../../../index.html"><img src="../../../../../../../../doc/html/images/home.png" alt="Home"></a><a accesskey="n" href="sliced.html"><img src="../../../../../../../../doc/html/images/next.png" alt="Next"></a>
+<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" title="reversed">
+<div class="section">
 <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>
@@ -75,19 +75,19 @@
 </table></div>
 <div class="itemizedlist"><ul class="itemizedlist" type="disc">
 <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">reverse_iterator</span></code>.
-            </li>
+                <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">reverse_iterator</span></code>.
+              </li>
 <li class="listitem">
-<span class="bold"><strong>Range Category:</strong></span><a class="link" href="../../../concepts/bidirectional_range.html" title="Bidirectional Range">Bidirectional
-              Range</a>
-</li>
+                <span class="bold"><strong>Range Category:</strong></span> <a class="link" href="../../../concepts/bidirectional_range.html" title="Bidirectional Range">Bidirectional
+                Range</a>
+              </li>
 <li class="listitem">
-<span class="bold"><strong>Returned Range Category:</strong></span> The range
-              category of <code class="computeroutput"><span class="identifier">rng</span></code>.
-            </li>
+                <span class="bold"><strong>Returned Range Category:</strong></span> The range
+                category of <code class="computeroutput"><span class="identifier">rng</span></code>.
+              </li>
 </ul></div>
-<div class="section" title="reversed example">
+<div class="section">
 <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>
@@ -138,7 +138,7 @@
 </tr></table>
 <hr>
 <div class="spirit-nav">
-<a accesskey="p" href="replaced_if.html"><img src="../../../../../../../../doc/html/images/prev.png" alt="Prev"></a><a accesskey="u" href="../reference.html"><img src="../../../../../../../../doc/html/images/up.png" alt="Up"></a><a accesskey="h" href="../../../../index.html"><img src="../../../../../../../../doc/html/images/home.png" alt="Home"></a><a accesskey="n" href="sliced.html"><img src="../../../../../../../../doc/html/images/next.png" alt="Next"></a>
+<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>
 </body>
 </html>
diff --git a/doc/html/range/reference/adaptors/reference/sliced.html b/doc/html/range/reference/adaptors/reference/sliced.html
index 757aaaf..c0dfed0 100644
--- a/doc/html/range/reference/adaptors/reference/sliced.html
+++ b/doc/html/range/reference/adaptors/reference/sliced.html
@@ -2,8 +2,8 @@
 <head>
 <meta http-equiv="Content-Type" content="text/html; charset=US-ASCII">
 <title>sliced</title>
-<link rel="stylesheet" href="../../../../../../../../doc/html/boostbook.css" type="text/css">
-<meta name="generator" content="DocBook XSL Stylesheets V1.75.1">
+<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="../reference.html" title="Reference">
 <link rel="prev" href="reversed.html" title="reversed">
@@ -13,16 +13,16 @@
 <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="../../../../../../../libraries.htm">Libraries</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="reversed.html"><img src="../../../../../../../../doc/html/images/prev.png" alt="Prev"></a><a accesskey="u" href="../reference.html"><img src="../../../../../../../../doc/html/images/up.png" alt="Up"></a><a accesskey="h" href="../../../../index.html"><img src="../../../../../../../../doc/html/images/home.png" alt="Home"></a><a accesskey="n" href="strided.html"><img src="../../../../../../../../doc/html/images/next.png" alt="Next"></a>
+<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" title="sliced">
+<div class="section">
 <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>
@@ -78,26 +78,26 @@
 </table></div>
 <div class="itemizedlist"><ul class="itemizedlist" type="disc">
 <li class="listitem">
-<span class="bold"><strong>Precondition:</strong></span><code class="computeroutput"><span class="number">0</span>
-              <span class="special">&lt;=</span> <span class="identifier">n</span>
-              <span class="special">&amp;&amp;</span> <span class="identifier">n</span>
-              <span class="special">&lt;=</span> <span class="identifier">m</span>
-              <span class="special">&amp;&amp;</span> <span class="identifier">m</span>
-              <span class="special">&lt;</span> <span class="identifier">distance</span><span class="special">(</span><span class="identifier">rng</span><span class="special">)</span></code>
-</li>
+                <span class="bold"><strong>Precondition:</strong></span> <code class="computeroutput"><span class="number">0</span>
+                <span class="special">&lt;=</span> <span class="identifier">n</span>
+                <span class="special">&amp;&amp;</span> <span class="identifier">n</span>
+                <span class="special">&lt;=</span> <span class="identifier">m</span>
+                <span class="special">&amp;&amp;</span> <span class="identifier">m</span>
+                <span class="special">&lt;</span> <span class="identifier">distance</span><span class="special">(</span><span class="identifier">rng</span><span class="special">)</span></code>
+              </li>
 <li class="listitem">
-<span class="bold"><strong>Returns:</strong></span><code class="computeroutput"><span class="identifier">make_range</span><span class="special">(</span><span class="identifier">rng</span><span class="special">,</span> <span class="identifier">n</span><span class="special">,</span> <span class="identifier">m</span><span class="special">)</span></code>
-</li>
+                <span class="bold"><strong>Returns:</strong></span> <code class="computeroutput"><span class="identifier">make_range</span><span class="special">(</span><span class="identifier">rng</span><span class="special">,</span> <span class="identifier">n</span><span class="special">,</span> <span class="identifier">m</span><span class="special">)</span></code>
+              </li>
 <li class="listitem">
-<span class="bold"><strong>Range Category:</strong></span><a class="link" href="../../../concepts/random_access_range.html" title="Random Access Range">Random
-              Access Range</a>
-</li>
+                <span class="bold"><strong>Range Category:</strong></span> <a class="link" href="../../../concepts/random_access_range.html" title="Random Access Range">Random
+                Access Range</a>
+              </li>
 <li class="listitem">
-<span class="bold"><strong>Returned Range Category:</strong></span><a class="link" href="../../../concepts/random_access_range.html" title="Random Access Range">Random
-              Access Range</a>
-</li>
+                <span class="bold"><strong>Returned Range Category:</strong></span> <a class="link" href="../../../concepts/random_access_range.html" title="Random Access Range">Random
+                Access Range</a>
+              </li>
 </ul></div>
-<div class="section" title="sliced example">
+<div class="section">
 <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>
@@ -148,7 +148,7 @@
 </tr></table>
 <hr>
 <div class="spirit-nav">
-<a accesskey="p" href="reversed.html"><img src="../../../../../../../../doc/html/images/prev.png" alt="Prev"></a><a accesskey="u" href="../reference.html"><img src="../../../../../../../../doc/html/images/up.png" alt="Up"></a><a accesskey="h" href="../../../../index.html"><img src="../../../../../../../../doc/html/images/home.png" alt="Home"></a><a accesskey="n" href="strided.html"><img src="../../../../../../../../doc/html/images/next.png" alt="Next"></a>
+<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>
 </body>
 </html>
diff --git a/doc/html/range/reference/adaptors/reference/strided.html b/doc/html/range/reference/adaptors/reference/strided.html
index b641325..2cbb302 100644
--- a/doc/html/range/reference/adaptors/reference/strided.html
+++ b/doc/html/range/reference/adaptors/reference/strided.html
@@ -2,8 +2,8 @@
 <head>
 <meta http-equiv="Content-Type" content="text/html; charset=US-ASCII">
 <title>strided</title>
-<link rel="stylesheet" href="../../../../../../../../doc/html/boostbook.css" type="text/css">
-<meta name="generator" content="DocBook XSL Stylesheets V1.75.1">
+<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="../reference.html" title="Reference">
 <link rel="prev" href="sliced.html" title="sliced">
@@ -13,16 +13,16 @@
 <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="../../../../../../../libraries.htm">Libraries</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="sliced.html"><img src="../../../../../../../../doc/html/images/prev.png" alt="Prev"></a><a accesskey="u" href="../reference.html"><img src="../../../../../../../../doc/html/images/up.png" alt="Up"></a><a accesskey="h" href="../../../../index.html"><img src="../../../../../../../../doc/html/images/home.png" alt="Home"></a><a accesskey="n" href="tokenized.html"><img src="../../../../../../../../doc/html/images/next.png" alt="Next"></a>
+<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="tokenized.html"><img src="../../../../../../../../doc/src/images/next.png" alt="Next"></a>
 </div>
-<div class="section" title="strided">
+<div class="section">
 <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>
@@ -76,25 +76,25 @@
 </table></div>
 <div class="itemizedlist"><ul class="itemizedlist" type="disc">
 <li class="listitem">
-<span class="bold"><strong>Precondition:</strong></span><code class="computeroutput"><span class="number">0</span>
-              <span class="special">&lt;=</span> <span class="identifier">n</span>
-              <span class="special">&amp;&amp;</span> <span class="identifier">n</span>
-              <span class="special">&lt;</span> <span class="identifier">distance</span><span class="special">(</span><span class="identifier">rng</span><span class="special">)</span></code>
-</li>
+                <span class="bold"><strong>Precondition:</strong></span> <code class="computeroutput"><span class="number">0</span>
+                <span class="special">&lt;=</span> <span class="identifier">n</span>
+                <span class="special">&amp;&amp;</span> <span class="identifier">n</span>
+                <span class="special">&lt;</span> <span class="identifier">distance</span><span class="special">(</span><span class="identifier">rng</span><span class="special">)</span></code>
+              </li>
 <li class="listitem">
-<span class="bold"><strong>Returns:</strong></span> A new range based on <code class="computeroutput"><span class="identifier">rng</span></code> where traversal is performed
-              in steps of <code class="computeroutput"><span class="identifier">n</span></code>.
-            </li>
+                <span class="bold"><strong>Returns:</strong></span> A new range based on <code class="computeroutput"><span class="identifier">rng</span></code> where traversal is performed
+                in steps of <code class="computeroutput"><span class="identifier">n</span></code>.
+              </li>
 <li class="listitem">
-<span class="bold"><strong>Range Category:</strong></span><a class="link" href="../../../concepts/random_access_range.html" title="Random Access Range">Random
-              Access Range</a>
-</li>
+                <span class="bold"><strong>Range Category:</strong></span> <a class="link" href="../../../concepts/random_access_range.html" title="Random Access Range">Random
+                Access Range</a>
+              </li>
 <li class="listitem">
-<span class="bold"><strong>Returned Range Category:</strong></span><a class="link" href="../../../concepts/random_access_range.html" title="Random Access Range">Random
-              Access Range</a>
-</li>
+                <span class="bold"><strong>Returned Range Category:</strong></span> <a class="link" href="../../../concepts/random_access_range.html" title="Random Access Range">Random
+                Access Range</a>
+              </li>
 </ul></div>
-<div class="section" title="strided example">
+<div class="section">
 <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>
@@ -145,7 +145,7 @@
 </tr></table>
 <hr>
 <div class="spirit-nav">
-<a accesskey="p" href="sliced.html"><img src="../../../../../../../../doc/html/images/prev.png" alt="Prev"></a><a accesskey="u" href="../reference.html"><img src="../../../../../../../../doc/html/images/up.png" alt="Up"></a><a accesskey="h" href="../../../../index.html"><img src="../../../../../../../../doc/html/images/home.png" alt="Home"></a><a accesskey="n" href="tokenized.html"><img src="../../../../../../../../doc/html/images/next.png" alt="Next"></a>
+<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="tokenized.html"><img src="../../../../../../../../doc/src/images/next.png" alt="Next"></a>
 </div>
 </body>
 </html>
diff --git a/doc/html/range/reference/adaptors/reference/tokenized.html b/doc/html/range/reference/adaptors/reference/tokenized.html
index 32f57e6..66e5cd7 100644
--- a/doc/html/range/reference/adaptors/reference/tokenized.html
+++ b/doc/html/range/reference/adaptors/reference/tokenized.html
@@ -2,8 +2,8 @@
 <head>
 <meta http-equiv="Content-Type" content="text/html; charset=US-ASCII">
 <title>tokenized</title>
-<link rel="stylesheet" href="../../../../../../../../doc/html/boostbook.css" type="text/css">
-<meta name="generator" content="DocBook XSL Stylesheets V1.75.1">
+<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="../reference.html" title="Reference">
 <link rel="prev" href="strided.html" title="strided">
@@ -13,16 +13,16 @@
 <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="../../../../../../../libraries.htm">Libraries</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="strided.html"><img src="../../../../../../../../doc/html/images/prev.png" alt="Prev"></a><a accesskey="u" href="../reference.html"><img src="../../../../../../../../doc/html/images/up.png" alt="Up"></a><a accesskey="h" href="../../../../index.html"><img src="../../../../../../../../doc/html/images/home.png" alt="Home"></a><a accesskey="n" href="transformed.html"><img src="../../../../../../../../doc/html/images/next.png" alt="Next"></a>
+<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="transformed.html"><img src="../../../../../../../../doc/src/images/next.png" alt="Next"></a>
 </div>
-<div class="section" title="tokenized">
+<div class="section">
 <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>
@@ -88,47 +88,50 @@
 </table></div>
 <div class="itemizedlist"><ul class="itemizedlist" type="disc">
 <li class="listitem">
-<span class="bold"><strong>Precondition:</strong></span><div class="itemizedlist"><ul class="itemizedlist" type="circle">
+                <span class="bold"><strong>Precondition:</strong></span>
+                <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 iterator in the range would be constructed by forwarding
-              all the arguments of <code class="computeroutput"><span class="identifier">tokenized</span><span class="special">()</span></code> to the <code class="computeroutput"><span class="identifier">regex_token_iterator</span></code>
-              constructor.
-            </li>
+                <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
+                iterator in the range would be constructed by forwarding all the
+                arguments of <code class="computeroutput"><span class="identifier">tokenized</span><span class="special">()</span></code> to the <code class="computeroutput"><span class="identifier">regex_token_iterator</span></code>
+                constructor.
+              </li>
 <li class="listitem">
-<span class="bold"><strong>Throws:</strong></span> Whatever constructing and
-              copying equivalent <code class="computeroutput"><span class="identifier">regex_token_iterator</span></code>s
-              might throw.
-            </li>
+                <span class="bold"><strong>Throws:</strong></span> Whatever constructing and
+                copying equivalent <code class="computeroutput"><span class="identifier">regex_token_iterator</span></code>s
+                might throw.
+              </li>
 <li class="listitem">
-<span class="bold"><strong>Range Category:</strong></span><a class="link" href="../../../concepts/random_access_range.html" title="Random Access Range">Random
-              Access Range</a>
-</li>
+                <span class="bold"><strong>Range Category:</strong></span> <a class="link" href="../../../concepts/random_access_range.html" title="Random Access Range">Random
+                Access Range</a>
+              </li>
 <li class="listitem">
-<span class="bold"><strong>Returned Range Category:</strong></span><a class="link" href="../../../concepts/random_access_range.html" title="Random Access Range">Random
-              Access Range</a>
-</li>
+                <span class="bold"><strong>Returned Range Category:</strong></span> <a class="link" href="../../../concepts/random_access_range.html" title="Random Access Range">Random
+                Access Range</a>
+              </li>
 </ul></div>
 </div>
 <table xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" width="100%"><tr>
@@ -141,7 +144,7 @@
 </tr></table>
 <hr>
 <div class="spirit-nav">
-<a accesskey="p" href="strided.html"><img src="../../../../../../../../doc/html/images/prev.png" alt="Prev"></a><a accesskey="u" href="../reference.html"><img src="../../../../../../../../doc/html/images/up.png" alt="Up"></a><a accesskey="h" href="../../../../index.html"><img src="../../../../../../../../doc/html/images/home.png" alt="Home"></a><a accesskey="n" href="transformed.html"><img src="../../../../../../../../doc/html/images/next.png" alt="Next"></a>
+<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="transformed.html"><img src="../../../../../../../../doc/src/images/next.png" alt="Next"></a>
 </div>
 </body>
 </html>
diff --git a/doc/html/range/reference/adaptors/reference/transformed.html b/doc/html/range/reference/adaptors/reference/transformed.html
index 43b8758..9631986 100644
--- a/doc/html/range/reference/adaptors/reference/transformed.html
+++ b/doc/html/range/reference/adaptors/reference/transformed.html
@@ -2,8 +2,8 @@
 <head>
 <meta http-equiv="Content-Type" content="text/html; charset=US-ASCII">
 <title>transformed</title>
-<link rel="stylesheet" href="../../../../../../../../doc/html/boostbook.css" type="text/css">
-<meta name="generator" content="DocBook XSL Stylesheets V1.75.1">
+<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="../reference.html" title="Reference">
 <link rel="prev" href="tokenized.html" title="tokenized">
@@ -13,16 +13,16 @@
 <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="../../../../../../../libraries.htm">Libraries</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="tokenized.html"><img src="../../../../../../../../doc/html/images/prev.png" alt="Prev"></a><a accesskey="u" href="../reference.html"><img src="../../../../../../../../doc/html/images/up.png" alt="Up"></a><a accesskey="h" href="../../../../index.html"><img src="../../../../../../../../doc/html/images/home.png" alt="Home"></a><a accesskey="n" href="uniqued.html"><img src="../../../../../../../../doc/html/images/next.png" alt="Next"></a>
+<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" title="transformed">
+<div class="section">
 <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>
@@ -77,28 +77,31 @@
 </table></div>
 <div class="itemizedlist"><ul class="itemizedlist" type="disc">
 <li class="listitem">
-<span class="bold"><strong>Precondition:</strong></span> The <code class="computeroutput"><span class="identifier">value_type</span></code>
-              of the range is convertible to the argument type of <code class="computeroutput"><span class="identifier">fun</span></code>.
-            </li>
+                <span class="bold"><strong>Precondition:</strong></span> The <code class="computeroutput"><span class="identifier">value_type</span></code> of the range is convertible
+                to the argument type of <code class="computeroutput"><span class="identifier">fun</span></code>.
+              </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 range, <code class="computeroutput"><span class="identifier">x</span></code> is the result of <code class="computeroutput"><span class="identifier">fun</span><span class="special">(</span><span class="identifier">y</span><span class="special">)</span></code>
-              where <code class="computeroutput"><span class="identifier">y</span></code> is the corresponding
-              element in the original range.
-            </li>
+                <span class="bold"><strong>Postcondition:</strong></span> For all elements
+                <code class="computeroutput"><span class="identifier">x</span></code> in the returned
+                range, <code class="computeroutput"><span class="identifier">x</span></code> is the result
+                of <code class="computeroutput"><span class="identifier">fun</span><span class="special">(</span><span class="identifier">y</span><span class="special">)</span></code>
+                where <code class="computeroutput"><span class="identifier">y</span></code> is the corresponding
+                element in the original range.
+              </li>
 <li class="listitem">
-<span class="bold"><strong>Throws:</strong></span> Whatever the copy-constructor
-              of <code class="computeroutput"><span class="identifier">fun</span></code> might throw.
-            </li>
+                <span class="bold"><strong>Throws:</strong></span> Whatever the copy-constructor
+                of <code class="computeroutput"><span class="identifier">fun</span></code> might throw.
+              </li>
 <li class="listitem">
-<span class="bold"><strong>Range Category:</strong></span><a class="link" href="../../../concepts/single_pass_range.html" title="Single Pass Range">Single
-              Pass Range</a>
-</li>
+                <span class="bold"><strong>Range Category:</strong></span> <a class="link" href="../../../concepts/single_pass_range.html" title="Single Pass Range">Single
+                Pass Range</a>
+              </li>
 <li class="listitem">
-<span class="bold"><strong>Returned Range Category:</strong></span> The range
-              category of <code class="computeroutput"><span class="identifier">rng</span></code>.
-            </li>
+                <span class="bold"><strong>Returned Range Category:</strong></span> The range
+                category of <code class="computeroutput"><span class="identifier">rng</span></code>.
+              </li>
 </ul></div>
-<div class="section" title="transformed example">
+<div class="section">
 <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>
@@ -155,7 +158,7 @@
 </tr></table>
 <hr>
 <div class="spirit-nav">
-<a accesskey="p" href="tokenized.html"><img src="../../../../../../../../doc/html/images/prev.png" alt="Prev"></a><a accesskey="u" href="../reference.html"><img src="../../../../../../../../doc/html/images/up.png" alt="Up"></a><a accesskey="h" href="../../../../index.html"><img src="../../../../../../../../doc/html/images/home.png" alt="Home"></a><a accesskey="n" href="uniqued.html"><img src="../../../../../../../../doc/html/images/next.png" alt="Next"></a>
+<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>
 </body>
 </html>
diff --git a/doc/html/range/reference/adaptors/reference/uniqued.html b/doc/html/range/reference/adaptors/reference/uniqued.html
index 65fdc6e..6ab4c59 100644
--- a/doc/html/range/reference/adaptors/reference/uniqued.html
+++ b/doc/html/range/reference/adaptors/reference/uniqued.html
@@ -2,8 +2,8 @@
 <head>
 <meta http-equiv="Content-Type" content="text/html; charset=US-ASCII">
 <title>uniqued</title>
-<link rel="stylesheet" href="../../../../../../../../doc/html/boostbook.css" type="text/css">
-<meta name="generator" content="DocBook XSL Stylesheets V1.75.1">
+<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="../reference.html" title="Reference">
 <link rel="prev" href="transformed.html" title="transformed">
@@ -13,16 +13,16 @@
 <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="../../../../../../../libraries.htm">Libraries</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="transformed.html"><img src="../../../../../../../../doc/html/images/prev.png" alt="Prev"></a><a accesskey="u" href="../reference.html"><img src="../../../../../../../../doc/html/images/up.png" alt="Up"></a><a accesskey="h" href="../../../../index.html"><img src="../../../../../../../../doc/html/images/home.png" alt="Home"></a><a accesskey="n" href="../../algorithms.html"><img src="../../../../../../../../doc/html/images/next.png" alt="Next"></a>
+<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" title="uniqued">
+<div class="section">
 <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>
@@ -75,24 +75,24 @@
 </table></div>
 <div class="itemizedlist"><ul class="itemizedlist" type="disc">
 <li class="listitem">
-<span class="bold"><strong>Precondition:</strong></span> The <code class="computeroutput"><span class="identifier">value_type</span></code>
-              of the range is comparable with <code class="computeroutput"><span class="keyword">operator</span><span class="special">==()</span></code>.
-            </li>
+                <span class="bold"><strong>Precondition:</strong></span> The <code class="computeroutput"><span class="identifier">value_type</span></code> of the range is comparable
+                with <code class="computeroutput"><span class="keyword">operator</span><span class="special">==()</span></code>.
+              </li>
 <li class="listitem">
-<span class="bold"><strong>Postcondition:</strong></span> 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> in the returned range, <code class="computeroutput"><span class="identifier">x</span><span class="special">==</span><span class="identifier">y</span></code> is false.
-            </li>
+                <span class="bold"><strong>Postcondition:</strong></span> 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> in the returned range, <code class="computeroutput"><span class="identifier">x</span><span class="special">==</span><span class="identifier">y</span></code> is false.
+              </li>
 <li class="listitem">
-<span class="bold"><strong>Range Category:</strong></span><a class="link" href="../../../concepts/forward_range.html" title="Forward Range">Forward
-              Range</a>
-</li>
+                <span class="bold"><strong>Range Category:</strong></span> <a class="link" href="../../../concepts/forward_range.html" title="Forward Range">Forward
+                Range</a>
+              </li>
 <li class="listitem">
-<span class="bold"><strong>Returned Range Category:</strong></span> The minimum
-              of the range concept of <code class="computeroutput"><span class="identifier">rng</span></code>
-              and <a class="link" href="../../../concepts/forward_range.html" title="Forward Range">Forward Range</a>.
-            </li>
+                <span class="bold"><strong>Returned Range Category:</strong></span> The minimum
+                of the range concept of <code class="computeroutput"><span class="identifier">rng</span></code>
+                and <a class="link" href="../../../concepts/forward_range.html" title="Forward Range">Forward Range</a>.
+              </li>
 </ul></div>
-<div class="section" title="uniqued example">
+<div class="section">
 <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>
@@ -141,7 +141,7 @@
 </tr></table>
 <hr>
 <div class="spirit-nav">
-<a accesskey="p" href="transformed.html"><img src="../../../../../../../../doc/html/images/prev.png" alt="Prev"></a><a accesskey="u" href="../reference.html"><img src="../../../../../../../../doc/html/images/up.png" alt="Up"></a><a accesskey="h" href="../../../../index.html"><img src="../../../../../../../../doc/html/images/home.png" alt="Home"></a><a accesskey="n" href="../../algorithms.html"><img src="../../../../../../../../doc/html/images/next.png" alt="Next"></a>
+<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>
 </body>
 </html>
diff --git a/doc/html/range/reference/algorithms.html b/doc/html/range/reference/algorithms.html
index a8b27ff..0bc9f39 100644
--- a/doc/html/range/reference/algorithms.html
+++ b/doc/html/range/reference/algorithms.html
@@ -2,8 +2,8 @@
 <head>
 <meta http-equiv="Content-Type" content="text/html; charset=US-ASCII">
 <title>Range Algorithm</title>
-<link rel="stylesheet" href="../../../../../../doc/html/boostbook.css" type="text/css">
-<meta name="generator" content="DocBook XSL Stylesheets V1.75.1">
+<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="../reference.html" title="Reference">
 <link rel="prev" href="adaptors/reference/uniqued.html" title="uniqued">
@@ -13,16 +13,16 @@
 <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="../../../../../libraries.htm">Libraries</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="adaptors/reference/uniqued.html"><img src="../../../../../../doc/html/images/prev.png" alt="Prev"></a><a accesskey="u" href="../reference.html"><img src="../../../../../../doc/html/images/up.png" alt="Up"></a><a accesskey="h" href="../../index.html"><img src="../../../../../../doc/html/images/home.png" alt="Home"></a><a accesskey="n" href="algorithms/range_algorithm_introduction.html"><img src="../../../../../../doc/html/images/next.png" alt="Next"></a>
+<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/range_algorithm_introduction.html"><img src="../../../../../../doc/src/images/next.png" alt="Next"></a>
 </div>
-<div class="section" title="Range Algorithm">
+<div class="section">
 <div class="titlepage"><div><div><h3 class="title">
 <a name="range.reference.algorithms"></a><a class="link" href="algorithms.html" title="Range Algorithm"> Range Algorithm</a>
 </h3></div></div></div>
@@ -50,7 +50,7 @@
 </tr></table>
 <hr>
 <div class="spirit-nav">
-<a accesskey="p" href="adaptors/reference/uniqued.html"><img src="../../../../../../doc/html/images/prev.png" alt="Prev"></a><a accesskey="u" href="../reference.html"><img src="../../../../../../doc/html/images/up.png" alt="Up"></a><a accesskey="h" href="../../index.html"><img src="../../../../../../doc/html/images/home.png" alt="Home"></a><a accesskey="n" href="algorithms/range_algorithm_introduction.html"><img src="../../../../../../doc/html/images/next.png" alt="Next"></a>
+<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/range_algorithm_introduction.html"><img src="../../../../../../doc/src/images/next.png" alt="Next"></a>
 </div>
 </body>
 </html>
diff --git a/doc/html/range/reference/algorithms/heap.html b/doc/html/range/reference/algorithms/heap.html
index c06c707..045ea7b 100644
--- a/doc/html/range/reference/algorithms/heap.html
+++ b/doc/html/range/reference/algorithms/heap.html
@@ -2,8 +2,8 @@
 <head>
 <meta http-equiv="Content-Type" content="text/html; charset=US-ASCII">
 <title>Heap algorithms</title>
-<link rel="stylesheet" href="../../../../../../../doc/html/boostbook.css" type="text/css">
-<meta name="generator" content="DocBook XSL Stylesheets V1.75.1">
+<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="../algorithms.html" title="Range Algorithm">
 <link rel="prev" href="set/set_symmetric_difference.html" title="set_symmetric_difference">
@@ -13,16 +13,16 @@
 <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="../../../../../../libraries.htm">Libraries</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="set/set_symmetric_difference.html"><img src="../../../../../../../doc/html/images/prev.png" alt="Prev"></a><a accesskey="u" href="../algorithms.html"><img src="../../../../../../../doc/html/images/up.png" alt="Up"></a><a accesskey="h" href="../../../index.html"><img src="../../../../../../../doc/html/images/home.png" alt="Home"></a><a accesskey="n" href="heap/push_heap.html"><img src="../../../../../../../doc/html/images/next.png" alt="Next"></a>
+<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" title="Heap algorithms">
+<div class="section">
 <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>
@@ -43,7 +43,7 @@
 </tr></table>
 <hr>
 <div class="spirit-nav">
-<a accesskey="p" href="set/set_symmetric_difference.html"><img src="../../../../../../../doc/html/images/prev.png" alt="Prev"></a><a accesskey="u" href="../algorithms.html"><img src="../../../../../../../doc/html/images/up.png" alt="Up"></a><a accesskey="h" href="../../../index.html"><img src="../../../../../../../doc/html/images/home.png" alt="Home"></a><a accesskey="n" href="heap/push_heap.html"><img src="../../../../../../../doc/html/images/next.png" alt="Next"></a>
+<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>
 </body>
 </html>
diff --git a/doc/html/range/reference/algorithms/heap/make_heap.html b/doc/html/range/reference/algorithms/heap/make_heap.html
index a847fc7..ce7157e 100644
--- a/doc/html/range/reference/algorithms/heap/make_heap.html
+++ b/doc/html/range/reference/algorithms/heap/make_heap.html
@@ -2,8 +2,8 @@
 <head>
 <meta http-equiv="Content-Type" content="text/html; charset=US-ASCII">
 <title>make_heap</title>
-<link rel="stylesheet" href="../../../../../../../../doc/html/boostbook.css" type="text/css">
-<meta name="generator" content="DocBook XSL Stylesheets V1.75.1">
+<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="../heap.html" title="Heap algorithms">
 <link rel="prev" href="pop_heap.html" title="pop_heap">
@@ -13,21 +13,21 @@
 <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="../../../../../../../libraries.htm">Libraries</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="pop_heap.html"><img src="../../../../../../../../doc/html/images/prev.png" alt="Prev"></a><a accesskey="u" href="../heap.html"><img src="../../../../../../../../doc/html/images/up.png" alt="Up"></a><a accesskey="h" href="../../../../index.html"><img src="../../../../../../../../doc/html/images/home.png" alt="Home"></a><a accesskey="n" href="sort_heap.html"><img src="../../../../../../../../doc/html/images/next.png" alt="Next"></a>
+<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" title="make_heap">
+<div class="section">
 <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="id2780519"></a>
+<a name="id3355962"></a>
             <a class="link" href="make_heap.html#range.reference.algorithms.heap.make_heap.prototype">Prototype</a>
           </h6>
 <p>
@@ -48,7 +48,7 @@
 <p>
           </p>
 <a name="range.reference.algorithms.heap.make_heap.description"></a><h6>
-<a name="id2780898"></a>
+<a name="id3356341"></a>
             <a class="link" href="make_heap.html#range.reference.algorithms.heap.make_heap.description">Description</a>
           </h6>
 <p>
@@ -60,14 +60,14 @@
             the predicate versions.
           </p>
 <a name="range.reference.algorithms.heap.make_heap.definition"></a><h6>
-<a name="id2780978"></a>
+<a name="id3356421"></a>
             <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="id2781051"></a>
+<a name="id3356494"></a>
             <a class="link" href="make_heap.html#range.reference.algorithms.heap.make_heap.requirements">Requirements</a>
           </h6>
 <p>
@@ -75,50 +75,50 @@
           </p>
 <div class="itemizedlist"><ul class="itemizedlist" type="disc">
 <li class="listitem">
-<code class="computeroutput"><span class="identifier">RandomAccessRange</span></code> is
-              a model of the <a class="link" href="../../../concepts/random_access_range.html" title="Random Access Range">Random
-              Access Range</a> Concept.
-            </li>
+                <code class="computeroutput"><span class="identifier">RandomAccessRange</span></code>
+                is a model of the <a class="link" href="../../../concepts/random_access_range.html" title="Random Access Range">Random
+                Access Range</a> Concept.
+              </li>
 <li class="listitem">
-<code class="computeroutput"><span class="identifier">RandomAccessRange</span></code> is
-              mutable.
-            </li>
+                <code class="computeroutput"><span class="identifier">RandomAccessRange</span></code>
+                is mutable.
+              </li>
 <li class="listitem">
-<code class="computeroutput"><span class="identifier">RandomAccessRange</span></code>'s
-              value type is a model of the <code class="computeroutput"><span class="identifier">LessThanComparableConcept</span></code>.
-            </li>
+                <code class="computeroutput"><span class="identifier">RandomAccessRange</span></code>'s
+                value type is a model of the <code class="computeroutput"><span class="identifier">LessThanComparableConcept</span></code>.
+              </li>
 <li class="listitem">
-              The ordering of objects of type <code class="computeroutput"><span class="identifier">RandomAccessRange</span></code>'s
-              value type is a <span class="bold"><strong><span class="emphasis"><em>strict weak ordering</em></span></strong></span>,
-              as defined in the <code class="computeroutput"><span class="identifier">LessThanComparableConcept</span></code>
-              requirements.
-            </li>
+                The ordering of objects of type <code class="computeroutput"><span class="identifier">RandomAccessRange</span></code>'s
+                value type is a <span class="bold"><strong><span class="emphasis"><em>strict weak ordering</em></span></strong></span>,
+                as defined in the <code class="computeroutput"><span class="identifier">LessThanComparableConcept</span></code>
+                requirements.
+              </li>
 </ul></div>
 <p>
             <span class="bold"><strong>For the predicate versions:</strong></span>
           </p>
 <div class="itemizedlist"><ul class="itemizedlist" type="disc">
 <li class="listitem">
-<code class="computeroutput"><span class="identifier">RandomAccessRange</span></code> is
-              a model of the <a class="link" href="../../../concepts/random_access_range.html" title="Random Access Range">Random
-              Access Range</a> Concept.
-            </li>
+                <code class="computeroutput"><span class="identifier">RandomAccessRange</span></code>
+                is a model of the <a class="link" href="../../../concepts/random_access_range.html" title="Random Access Range">Random
+                Access Range</a> Concept.
+              </li>
 <li class="listitem">
-<code class="computeroutput"><span class="identifier">RandomAccessRange</span></code> is
-              mutable.
-            </li>
+                <code class="computeroutput"><span class="identifier">RandomAccessRange</span></code>
+                is mutable.
+              </li>
 <li class="listitem">
-<code class="computeroutput"><span class="identifier">Compare</span></code> is a model
-              of the <code class="computeroutput"><span class="identifier">StrictWeakOrderingConcept</span></code>.
-            </li>
+                <code class="computeroutput"><span class="identifier">Compare</span></code> is a model
+                of the <code class="computeroutput"><span class="identifier">StrictWeakOrderingConcept</span></code>.
+              </li>
 <li class="listitem">
-<code class="computeroutput"><span class="identifier">RandomAccessRange</span></code>'s
-              value type is convertible to both of <code class="computeroutput"><span class="identifier">Compare</span></code>'s
-              argument types.
-            </li>
+                <code class="computeroutput"><span class="identifier">RandomAccessRange</span></code>'s
+                value type is convertible to both of <code class="computeroutput"><span class="identifier">Compare</span></code>'s
+                argument types.
+              </li>
 </ul></div>
 <a name="range.reference.algorithms.heap.make_heap.complexity"></a><h6>
-<a name="id2781286"></a>
+<a name="id3356755"></a>
             <a class="link" href="make_heap.html#range.reference.algorithms.heap.make_heap.complexity">Complexity</a>
           </h6>
 <p>
@@ -137,7 +137,7 @@
 </tr></table>
 <hr>
 <div class="spirit-nav">
-<a accesskey="p" href="pop_heap.html"><img src="../../../../../../../../doc/html/images/prev.png" alt="Prev"></a><a accesskey="u" href="../heap.html"><img src="../../../../../../../../doc/html/images/up.png" alt="Up"></a><a accesskey="h" href="../../../../index.html"><img src="../../../../../../../../doc/html/images/home.png" alt="Home"></a><a accesskey="n" href="sort_heap.html"><img src="../../../../../../../../doc/html/images/next.png" alt="Next"></a>
+<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>
 </body>
 </html>
diff --git a/doc/html/range/reference/algorithms/heap/pop_heap.html b/doc/html/range/reference/algorithms/heap/pop_heap.html
index 6cf064d..b00c3ac 100644
--- a/doc/html/range/reference/algorithms/heap/pop_heap.html
+++ b/doc/html/range/reference/algorithms/heap/pop_heap.html
@@ -2,8 +2,8 @@
 <head>
 <meta http-equiv="Content-Type" content="text/html; charset=US-ASCII">
 <title>pop_heap</title>
-<link rel="stylesheet" href="../../../../../../../../doc/html/boostbook.css" type="text/css">
-<meta name="generator" content="DocBook XSL Stylesheets V1.75.1">
+<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="../heap.html" title="Heap algorithms">
 <link rel="prev" href="push_heap.html" title="push_heap">
@@ -13,21 +13,21 @@
 <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="../../../../../../../libraries.htm">Libraries</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="push_heap.html"><img src="../../../../../../../../doc/html/images/prev.png" alt="Prev"></a><a accesskey="u" href="../heap.html"><img src="../../../../../../../../doc/html/images/up.png" alt="Up"></a><a accesskey="h" href="../../../../index.html"><img src="../../../../../../../../doc/html/images/home.png" alt="Home"></a><a accesskey="n" href="make_heap.html"><img src="../../../../../../../../doc/html/images/next.png" alt="Next"></a>
+<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" title="pop_heap">
+<div class="section">
 <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="id2779514"></a>
+<a name="id3354924"></a>
             <a class="link" href="pop_heap.html#range.reference.algorithms.heap.pop_heap.prototype">Prototype</a>
           </h6>
 <p>
@@ -48,7 +48,7 @@
 <p>
           </p>
 <a name="range.reference.algorithms.heap.pop_heap.description"></a><h6>
-<a name="id2779893"></a>
+<a name="id3355304"></a>
             <a class="link" href="pop_heap.html#range.reference.algorithms.heap.pop_heap.description">Description</a>
           </h6>
 <p>
@@ -62,14 +62,14 @@
             the predicate versions.
           </p>
 <a name="range.reference.algorithms.heap.pop_heap.definition"></a><h6>
-<a name="id2780053"></a>
+<a name="id3355464"></a>
             <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="id2780124"></a>
+<a name="id3355535"></a>
             <a class="link" href="pop_heap.html#range.reference.algorithms.heap.pop_heap.requirements">Requirements</a>
           </h6>
 <p>
@@ -77,60 +77,62 @@
           </p>
 <div class="itemizedlist"><ul class="itemizedlist" type="disc">
 <li class="listitem">
-<code class="computeroutput"><span class="identifier">RandomAccessRange</span></code> is
-              a model of the <a class="link" href="../../../concepts/random_access_range.html" title="Random Access Range">Random
-              Access Range</a> Concept.
-            </li>
+                <code class="computeroutput"><span class="identifier">RandomAccessRange</span></code>
+                is a model of the <a class="link" href="../../../concepts/random_access_range.html" title="Random Access Range">Random
+                Access Range</a> Concept.
+              </li>
 <li class="listitem">
-<code class="computeroutput"><span class="identifier">RandomAccessRange</span></code> is
-              mutable.
-            </li>
+                <code class="computeroutput"><span class="identifier">RandomAccessRange</span></code>
+                is mutable.
+              </li>
 <li class="listitem">
-<code class="computeroutput"><span class="identifier">RandomAccessRange</span></code>'s
-              value type is a model of the <code class="computeroutput"><span class="identifier">LessThanComparableConcept</span></code>.
-            </li>
+                <code class="computeroutput"><span class="identifier">RandomAccessRange</span></code>'s
+                value type is a model of the <code class="computeroutput"><span class="identifier">LessThanComparableConcept</span></code>.
+              </li>
 <li class="listitem">
-              The ordering of objects of type <code class="computeroutput"><span class="identifier">RandomAccessRange</span></code>'s
-              value type is a <span class="bold"><strong><span class="emphasis"><em>strict weak ordering</em></span></strong></span>,
-              as defined in the <code class="computeroutput"><span class="identifier">LessThanComparableConcept</span></code>
-              requirements.
-            </li>
+                The ordering of objects of type <code class="computeroutput"><span class="identifier">RandomAccessRange</span></code>'s
+                value type is a <span class="bold"><strong><span class="emphasis"><em>strict weak ordering</em></span></strong></span>,
+                as defined in the <code class="computeroutput"><span class="identifier">LessThanComparableConcept</span></code>
+                requirements.
+              </li>
 </ul></div>
 <p>
             <span class="bold"><strong>For the predicate versions:</strong></span>
           </p>
 <div class="itemizedlist"><ul class="itemizedlist" type="disc">
 <li class="listitem">
-<code class="computeroutput"><span class="identifier">RandomAccessRange</span></code> is
-              a model of the <a class="link" href="../../../concepts/random_access_range.html" title="Random Access Range">Random
-              Access Range</a> Concept.
-            </li>
+                <code class="computeroutput"><span class="identifier">RandomAccessRange</span></code>
+                is a model of the <a class="link" href="../../../concepts/random_access_range.html" title="Random Access Range">Random
+                Access Range</a> Concept.
+              </li>
 <li class="listitem">
-<code class="computeroutput"><span class="identifier">RandomAccessRange</span></code> is
-              mutable.
-            </li>
+                <code class="computeroutput"><span class="identifier">RandomAccessRange</span></code>
+                is mutable.
+              </li>
 <li class="listitem">
-<code class="computeroutput"><span class="identifier">Compare</span></code> is a model
-              of the <code class="computeroutput"><span class="identifier">StrictWeakOrderingConcept</span></code>.
-            </li>
+                <code class="computeroutput"><span class="identifier">Compare</span></code> is a model
+                of the <code class="computeroutput"><span class="identifier">StrictWeakOrderingConcept</span></code>.
+              </li>
 <li class="listitem">
-<code class="computeroutput"><span class="identifier">RandomAccessRange</span></code>'s
-              value type is convertible to both of <code class="computeroutput"><span class="identifier">Compare</span></code>'s
-              argument types.
-            </li>
+                <code class="computeroutput"><span class="identifier">RandomAccessRange</span></code>'s
+                value type is convertible to both of <code class="computeroutput"><span class="identifier">Compare</span></code>'s
+                argument types.
+              </li>
 </ul></div>
 <a name="range.reference.algorithms.heap.pop_heap.precondition_"></a><h6>
-<a name="id2780359"></a>
+<a name="id3355796"></a>
             <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"><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></li>
 <li class="listitem">
-<code class="computeroutput"><span class="identifier">rng</span></code> is a heap.
-            </li>
+                <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>
+              </li>
+<li class="listitem">
+                <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="id2780431"></a>
+<a name="id3355874"></a>
             <a class="link" href="pop_heap.html#range.reference.algorithms.heap.pop_heap.complexity">Complexity</a>
           </h6>
 <p>
@@ -149,7 +151,7 @@
 </tr></table>
 <hr>
 <div class="spirit-nav">
-<a accesskey="p" href="push_heap.html"><img src="../../../../../../../../doc/html/images/prev.png" alt="Prev"></a><a accesskey="u" href="../heap.html"><img src="../../../../../../../../doc/html/images/up.png" alt="Up"></a><a accesskey="h" href="../../../../index.html"><img src="../../../../../../../../doc/html/images/home.png" alt="Home"></a><a accesskey="n" href="make_heap.html"><img src="../../../../../../../../doc/html/images/next.png" alt="Next"></a>
+<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>
 </body>
 </html>
diff --git a/doc/html/range/reference/algorithms/heap/push_heap.html b/doc/html/range/reference/algorithms/heap/push_heap.html
index f4497b6..ece6dbf 100644
--- a/doc/html/range/reference/algorithms/heap/push_heap.html
+++ b/doc/html/range/reference/algorithms/heap/push_heap.html
@@ -2,8 +2,8 @@
 <head>
 <meta http-equiv="Content-Type" content="text/html; charset=US-ASCII">
 <title>push_heap</title>
-<link rel="stylesheet" href="../../../../../../../../doc/html/boostbook.css" type="text/css">
-<meta name="generator" content="DocBook XSL Stylesheets V1.75.1">
+<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="../heap.html" title="Heap algorithms">
 <link rel="prev" href="../heap.html" title="Heap algorithms">
@@ -13,21 +13,21 @@
 <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="../../../../../../../libraries.htm">Libraries</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="../heap.html"><img src="../../../../../../../../doc/html/images/prev.png" alt="Prev"></a><a accesskey="u" href="../heap.html"><img src="../../../../../../../../doc/html/images/up.png" alt="Up"></a><a accesskey="h" href="../../../../index.html"><img src="../../../../../../../../doc/html/images/home.png" alt="Home"></a><a accesskey="n" href="pop_heap.html"><img src="../../../../../../../../doc/html/images/next.png" alt="Next"></a>
+<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" title="push_heap">
+<div class="section">
 <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="id2778470"></a>
+<a name="id3353848"></a>
             <a class="link" href="push_heap.html#range.reference.algorithms.heap.push_heap.prototype">Prototype</a>
           </h6>
 <p>
@@ -48,7 +48,7 @@
 <p>
           </p>
 <a name="range.reference.algorithms.heap.push_heap.description"></a><h6>
-<a name="id2778848"></a>
+<a name="id3354226"></a>
             <a class="link" href="push_heap.html#range.reference.algorithms.heap.push_heap.description">Description</a>
           </h6>
 <p>
@@ -62,14 +62,14 @@
             the predicate versions.
           </p>
 <a name="range.reference.algorithms.heap.push_heap.definition"></a><h6>
-<a name="id2779011"></a>
+<a name="id3354389"></a>
             <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="id2779084"></a>
+<a name="id3354462"></a>
             <a class="link" href="push_heap.html#range.reference.algorithms.heap.push_heap.requirements">Requirements</a>
           </h6>
 <p>
@@ -77,60 +77,62 @@
           </p>
 <div class="itemizedlist"><ul class="itemizedlist" type="disc">
 <li class="listitem">
-<code class="computeroutput"><span class="identifier">RandomAccessRange</span></code> is
-              a model of the <a class="link" href="../../../concepts/random_access_range.html" title="Random Access Range">Random
-              Access Range</a> Concept.
-            </li>
+                <code class="computeroutput"><span class="identifier">RandomAccessRange</span></code>
+                is a model of the <a class="link" href="../../../concepts/random_access_range.html" title="Random Access Range">Random
+                Access Range</a> Concept.
+              </li>
 <li class="listitem">
-<code class="computeroutput"><span class="identifier">RandomAccessRange</span></code> is
-              mutable.
-            </li>
+                <code class="computeroutput"><span class="identifier">RandomAccessRange</span></code>
+                is mutable.
+              </li>
 <li class="listitem">
-<code class="computeroutput"><span class="identifier">RandomAccessRange</span></code>'s
-              value type is a model of the <code class="computeroutput"><span class="identifier">LessThanComparableConcept</span></code>.
-            </li>
+                <code class="computeroutput"><span class="identifier">RandomAccessRange</span></code>'s
+                value type is a model of the <code class="computeroutput"><span class="identifier">LessThanComparableConcept</span></code>.
+              </li>
 <li class="listitem">
-              The ordering of objects of type <code class="computeroutput"><span class="identifier">RandomAccessRange</span></code>'s
-              value type is a <span class="bold"><strong><span class="emphasis"><em>strict weak ordering</em></span></strong></span>,
-              as defined in the <code class="computeroutput"><span class="identifier">LessThanComparableConcept</span></code>
-              requirements.
-            </li>
+                The ordering of objects of type <code class="computeroutput"><span class="identifier">RandomAccessRange</span></code>'s
+                value type is a <span class="bold"><strong><span class="emphasis"><em>strict weak ordering</em></span></strong></span>,
+                as defined in the <code class="computeroutput"><span class="identifier">LessThanComparableConcept</span></code>
+                requirements.
+              </li>
 </ul></div>
 <p>
             <span class="bold"><strong>For the predicate versions:</strong></span>
           </p>
 <div class="itemizedlist"><ul class="itemizedlist" type="disc">
 <li class="listitem">
-<code class="computeroutput"><span class="identifier">RandomAccessRange</span></code> is
-              a model of the <a class="link" href="../../../concepts/random_access_range.html" title="Random Access Range">Random
-              Access Range</a> Concept.
-            </li>
+                <code class="computeroutput"><span class="identifier">RandomAccessRange</span></code>
+                is a model of the <a class="link" href="../../../concepts/random_access_range.html" title="Random Access Range">Random
+                Access Range</a> Concept.
+              </li>
 <li class="listitem">
-<code class="computeroutput"><span class="identifier">RandomAccessRange</span></code> is
-              mutable.
-            </li>
+                <code class="computeroutput"><span class="identifier">RandomAccessRange</span></code>
+                is mutable.
+              </li>
 <li class="listitem">
-<code class="computeroutput"><span class="identifier">Compare</span></code> is a model
-              of the <code class="computeroutput"><span class="identifier">StrictWeakOrderingConcept</span></code>.
-            </li>
+                <code class="computeroutput"><span class="identifier">Compare</span></code> is a model
+                of the <code class="computeroutput"><span class="identifier">StrictWeakOrderingConcept</span></code>.
+              </li>
 <li class="listitem">
-<code class="computeroutput"><span class="identifier">RandomAccessRange</span></code>'s
-              value type is convertible to both of <code class="computeroutput"><span class="identifier">Compare</span></code>'s
-              argument types.
-            </li>
+                <code class="computeroutput"><span class="identifier">RandomAccessRange</span></code>'s
+                value type is convertible to both of <code class="computeroutput"><span class="identifier">Compare</span></code>'s
+                argument types.
+              </li>
 </ul></div>
 <a name="range.reference.algorithms.heap.push_heap.precondition_"></a><h6>
-<a name="id2779319"></a>
+<a name="id3354723"></a>
             <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"><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></li>
 <li class="listitem">
-<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>
+                <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>
+              </li>
+<li class="listitem">
+                <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="id2779436"></a>
+<a name="id3354847"></a>
             <a class="link" href="push_heap.html#range.reference.algorithms.heap.push_heap.complexity">Complexity</a>
           </h6>
 <p>
@@ -147,7 +149,7 @@
 </tr></table>
 <hr>
 <div class="spirit-nav">
-<a accesskey="p" href="../heap.html"><img src="../../../../../../../../doc/html/images/prev.png" alt="Prev"></a><a accesskey="u" href="../heap.html"><img src="../../../../../../../../doc/html/images/up.png" alt="Up"></a><a accesskey="h" href="../../../../index.html"><img src="../../../../../../../../doc/html/images/home.png" alt="Home"></a><a accesskey="n" href="pop_heap.html"><img src="../../../../../../../../doc/html/images/next.png" alt="Next"></a>
+<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>
 </body>
 </html>
diff --git a/doc/html/range/reference/algorithms/heap/sort_heap.html b/doc/html/range/reference/algorithms/heap/sort_heap.html
index c5bb9b3..77a5dab 100644
--- a/doc/html/range/reference/algorithms/heap/sort_heap.html
+++ b/doc/html/range/reference/algorithms/heap/sort_heap.html
@@ -2,8 +2,8 @@
 <head>
 <meta http-equiv="Content-Type" content="text/html; charset=US-ASCII">
 <title>sort_heap</title>
-<link rel="stylesheet" href="../../../../../../../../doc/html/boostbook.css" type="text/css">
-<meta name="generator" content="DocBook XSL Stylesheets V1.75.1">
+<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="../heap.html" title="Heap algorithms">
 <link rel="prev" href="make_heap.html" title="make_heap">
@@ -13,21 +13,21 @@
 <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="../../../../../../../libraries.htm">Libraries</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="make_heap.html"><img src="../../../../../../../../doc/html/images/prev.png" alt="Prev"></a><a accesskey="u" href="../heap.html"><img src="../../../../../../../../doc/html/images/up.png" alt="Up"></a><a accesskey="h" href="../../../../index.html"><img src="../../../../../../../../doc/html/images/home.png" alt="Home"></a><a accesskey="n" href="../permutation.html"><img src="../../../../../../../../doc/html/images/next.png" alt="Next"></a>
+<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" title="sort_heap">
+<div class="section">
 <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="id2781365"></a>
+<a name="id3356834"></a>
             <a class="link" href="sort_heap.html#range.reference.algorithms.heap.sort_heap.prototype">Prototype</a>
           </h6>
 <p>
@@ -48,7 +48,7 @@
 <p>
           </p>
 <a name="range.reference.algorithms.heap.sort_heap.description"></a><h6>
-<a name="id2781744"></a>
+<a name="id3357213"></a>
             <a class="link" href="sort_heap.html#range.reference.algorithms.heap.sort_heap.description">Description</a>
           </h6>
 <p>
@@ -61,14 +61,14 @@
             the predicate versions.
           </p>
 <a name="range.reference.algorithms.heap.sort_heap.definition"></a><h6>
-<a name="id2781813"></a>
+<a name="id3357282"></a>
             <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="id2781885"></a>
+<a name="id3357353"></a>
             <a class="link" href="sort_heap.html#range.reference.algorithms.heap.sort_heap.requirements">Requirements</a>
           </h6>
 <p>
@@ -76,57 +76,57 @@
           </p>
 <div class="itemizedlist"><ul class="itemizedlist" type="disc">
 <li class="listitem">
-<code class="computeroutput"><span class="identifier">RandomAccessRange</span></code> is
-              a model of the <a class="link" href="../../../concepts/random_access_range.html" title="Random Access Range">Random
-              Access Range</a> Concept.
-            </li>
+                <code class="computeroutput"><span class="identifier">RandomAccessRange</span></code>
+                is a model of the <a class="link" href="../../../concepts/random_access_range.html" title="Random Access Range">Random
+                Access Range</a> Concept.
+              </li>
 <li class="listitem">
-<code class="computeroutput"><span class="identifier">RandomAccessRange</span></code> is
-              mutable.
-            </li>
+                <code class="computeroutput"><span class="identifier">RandomAccessRange</span></code>
+                is mutable.
+              </li>
 <li class="listitem">
-<code class="computeroutput"><span class="identifier">RandomAccessRange</span></code>'s
-              value type is a model of the <code class="computeroutput"><span class="identifier">LessThanComparableConcept</span></code>.
-            </li>
+                <code class="computeroutput"><span class="identifier">RandomAccessRange</span></code>'s
+                value type is a model of the <code class="computeroutput"><span class="identifier">LessThanComparableConcept</span></code>.
+              </li>
 <li class="listitem">
-              The ordering of objects of type <code class="computeroutput"><span class="identifier">RandomAccessRange</span></code>'s
-              value type is a <span class="bold"><strong><span class="emphasis"><em>strict weak ordering</em></span></strong></span>,
-              as defined in the <code class="computeroutput"><span class="identifier">LessThanComparableConcept</span></code>
-              requirements.
-            </li>
+                The ordering of objects of type <code class="computeroutput"><span class="identifier">RandomAccessRange</span></code>'s
+                value type is a <span class="bold"><strong><span class="emphasis"><em>strict weak ordering</em></span></strong></span>,
+                as defined in the <code class="computeroutput"><span class="identifier">LessThanComparableConcept</span></code>
+                requirements.
+              </li>
 </ul></div>
 <p>
             <span class="bold"><strong>For the predicate versions:</strong></span>
           </p>
 <div class="itemizedlist"><ul class="itemizedlist" type="disc">
 <li class="listitem">
-<code class="computeroutput"><span class="identifier">RandomAccessRange</span></code> is
-              a model of the <a class="link" href="../../../concepts/random_access_range.html" title="Random Access Range">Random
-              Access Range</a> Concept.
-            </li>
+                <code class="computeroutput"><span class="identifier">RandomAccessRange</span></code>
+                is a model of the <a class="link" href="../../../concepts/random_access_range.html" title="Random Access Range">Random
+                Access Range</a> Concept.
+              </li>
 <li class="listitem">
-<code class="computeroutput"><span class="identifier">RandomAccessRange</span></code> is
-              mutable.
-            </li>
+                <code class="computeroutput"><span class="identifier">RandomAccessRange</span></code>
+                is mutable.
+              </li>
 <li class="listitem">
-<code class="computeroutput"><span class="identifier">Compare</span></code> is a model
-              of the <code class="computeroutput"><span class="identifier">StrictWeakOrderingConcept</span></code>.
-            </li>
+                <code class="computeroutput"><span class="identifier">Compare</span></code> is a model
+                of the <code class="computeroutput"><span class="identifier">StrictWeakOrderingConcept</span></code>.
+              </li>
 <li class="listitem">
-<code class="computeroutput"><span class="identifier">RandomAccessRange</span></code>'s
-              value type is convertible to both of <code class="computeroutput"><span class="identifier">Compare</span></code>'s
-              argument types.
-            </li>
+                <code class="computeroutput"><span class="identifier">RandomAccessRange</span></code>'s
+                value type is convertible to both of <code class="computeroutput"><span class="identifier">Compare</span></code>'s
+                argument types.
+              </li>
 </ul></div>
 <a name="range.reference.algorithms.heap.sort_heap.precondition_"></a><h6>
-<a name="id2782120"></a>
+<a name="id3357614"></a>
             <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="id2782156"></a>
+<a name="id3357651"></a>
             <a class="link" href="sort_heap.html#range.reference.algorithms.heap.sort_heap.complexity">Complexity</a>
           </h6>
 <p>
@@ -146,7 +146,7 @@
 </tr></table>
 <hr>
 <div class="spirit-nav">
-<a accesskey="p" href="make_heap.html"><img src="../../../../../../../../doc/html/images/prev.png" alt="Prev"></a><a accesskey="u" href="../heap.html"><img src="../../../../../../../../doc/html/images/up.png" alt="Up"></a><a accesskey="h" href="../../../../index.html"><img src="../../../../../../../../doc/html/images/home.png" alt="Home"></a><a accesskey="n" href="../permutation.html"><img src="../../../../../../../../doc/html/images/next.png" alt="Next"></a>
+<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>
 </body>
 </html>
diff --git a/doc/html/range/reference/algorithms/mutating.html b/doc/html/range/reference/algorithms/mutating.html
index 1990363..7a7d945 100644
--- a/doc/html/range/reference/algorithms/mutating.html
+++ b/doc/html/range/reference/algorithms/mutating.html
@@ -2,8 +2,8 @@
 <head>
 <meta http-equiv="Content-Type" content="text/html; charset=US-ASCII">
 <title>Mutating algorithms</title>
-<link rel="stylesheet" href="../../../../../../../doc/html/boostbook.css" type="text/css">
-<meta name="generator" content="DocBook XSL Stylesheets V1.75.1">
+<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="../algorithms.html" title="Range Algorithm">
 <link rel="prev" href="range_algorithm_introduction.html" title="Introduction and motivation">
@@ -13,16 +13,16 @@
 <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="../../../../../../libraries.htm">Libraries</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="range_algorithm_introduction.html"><img src="../../../../../../../doc/html/images/prev.png" alt="Prev"></a><a accesskey="u" href="../algorithms.html"><img src="../../../../../../../doc/html/images/up.png" alt="Up"></a><a accesskey="h" href="../../../index.html"><img src="../../../../../../../doc/html/images/home.png" alt="Home"></a><a accesskey="n" href="mutating/copy.html"><img src="../../../../../../../doc/html/images/next.png" alt="Next"></a>
+<a accesskey="p" href="range_algorithm_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" title="Mutating algorithms">
+<div class="section">
 <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>
@@ -85,7 +85,7 @@
 </tr></table>
 <hr>
 <div class="spirit-nav">
-<a accesskey="p" href="range_algorithm_introduction.html"><img src="../../../../../../../doc/html/images/prev.png" alt="Prev"></a><a accesskey="u" href="../algorithms.html"><img src="../../../../../../../doc/html/images/up.png" alt="Up"></a><a accesskey="h" href="../../../index.html"><img src="../../../../../../../doc/html/images/home.png" alt="Home"></a><a accesskey="n" href="mutating/copy.html"><img src="../../../../../../../doc/html/images/next.png" alt="Next"></a>
+<a accesskey="p" href="range_algorithm_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>
 </body>
 </html>
diff --git a/doc/html/range/reference/algorithms/mutating/copy.html b/doc/html/range/reference/algorithms/mutating/copy.html
index 854c4ac..671e761 100644
--- a/doc/html/range/reference/algorithms/mutating/copy.html
+++ b/doc/html/range/reference/algorithms/mutating/copy.html
@@ -2,8 +2,8 @@
 <head>
 <meta http-equiv="Content-Type" content="text/html; charset=US-ASCII">
 <title>copy</title>
-<link rel="stylesheet" href="../../../../../../../../doc/html/boostbook.css" type="text/css">
-<meta name="generator" content="DocBook XSL Stylesheets V1.75.1">
+<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="../mutating.html" title="Mutating algorithms">
 <link rel="prev" href="../mutating.html" title="Mutating algorithms">
@@ -13,21 +13,21 @@
 <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="../../../../../../../libraries.htm">Libraries</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="../mutating.html"><img src="../../../../../../../../doc/html/images/prev.png" alt="Prev"></a><a accesskey="u" href="../mutating.html"><img src="../../../../../../../../doc/html/images/up.png" alt="Up"></a><a accesskey="h" href="../../../../index.html"><img src="../../../../../../../../doc/html/images/home.png" alt="Home"></a><a accesskey="n" href="copy_backward.html"><img src="../../../../../../../../doc/html/images/next.png" alt="Next"></a>
+<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" title="copy">
+<div class="section">
 <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="id2722930"></a>
+<a name="id3297033"></a>
             <a class="link" href="copy.html#range.reference.algorithms.mutating.copy.prototype">Prototype</a>
           </h6>
 <p>
@@ -39,7 +39,7 @@
 <p>
           </p>
 <a name="range.reference.algorithms.mutating.copy.description"></a><h6>
-<a name="id2723058"></a>
+<a name="id3297162"></a>
             <a class="link" href="copy.html#range.reference.algorithms.mutating.copy.description">Description</a>
           </h6>
 <p>
@@ -50,49 +50,49 @@
             <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="id2723192"></a>
+<a name="id3297296"></a>
             <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="id2723263"></a>
+<a name="id3297367"></a>
             <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">
-<code class="computeroutput"><span class="identifier">SinglePassRange</span></code> is
-              a model of the <a class="link" href="../../../concepts/single_pass_range.html" title="Single Pass Range">Single
-              Pass Range</a> Concept.
-            </li>
+                <code class="computeroutput"><span class="identifier">SinglePassRange</span></code> is
+                a model of the <a class="link" href="../../../concepts/single_pass_range.html" title="Single Pass Range">Single
+                Pass Range</a> Concept.
+              </li>
 <li class="listitem">
-<code class="computeroutput"><span class="identifier">OutputIterator</span></code> is a
-              model of the <code class="computeroutput"><span class="identifier">OutputIteratorConcept</span></code>.
-            </li>
+                <code class="computeroutput"><span class="identifier">OutputIterator</span></code> is
+                a model of the <code class="computeroutput"><span class="identifier">OutputIteratorConcept</span></code>.
+              </li>
 <li class="listitem">
-              The <code class="computeroutput"><span class="identifier">value_type</span></code> of
-              <a class="link" href="../../../concepts/single_pass_range.html" title="Single Pass Range">Single Pass Range</a>
-              Concept is convertible to a type in <code class="computeroutput"><span class="identifier">OutputIterator</span></code>'s
-              set of value types.
-            </li>
+                The <code class="computeroutput"><span class="identifier">value_type</span></code> of
+                <a class="link" href="../../../concepts/single_pass_range.html" title="Single Pass Range">Single Pass Range</a>
+                Concept is convertible to a type in <code class="computeroutput"><span class="identifier">OutputIterator</span></code>'s
+                set of value types.
+              </li>
 </ul></div>
 <a name="range.reference.algorithms.mutating.copy.precondition_"></a><h6>
-<a name="id2723371"></a>
+<a name="id3297485"></a>
             <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">
-<code class="computeroutput"><span class="identifier">out_it</span></code> is not an iterator
-              within the <code class="computeroutput"><span class="identifier">source_rng</span></code>.
-            </li>
+                <code class="computeroutput"><span class="identifier">out_it</span></code> is not an
+                iterator within the <code class="computeroutput"><span class="identifier">source_rng</span></code>.
+              </li>
 <li class="listitem">
-<code class="computeroutput"><span class="special">[</span><span class="identifier">out_it</span><span class="special">,</span> <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> is a valid range.
-            </li>
+                <code class="computeroutput"><span class="special">[</span><span class="identifier">out_it</span><span class="special">,</span> <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> is a valid range.
+              </li>
 </ul></div>
 <a name="range.reference.algorithms.mutating.copy.complexity"></a><h6>
-<a name="id2723476"></a>
+<a name="id3297596"></a>
             <a class="link" href="copy.html#range.reference.algorithms.mutating.copy.complexity">Complexity</a>
           </h6>
 <p>
@@ -109,7 +109,7 @@
 </tr></table>
 <hr>
 <div class="spirit-nav">
-<a accesskey="p" href="../mutating.html"><img src="../../../../../../../../doc/html/images/prev.png" alt="Prev"></a><a accesskey="u" href="../mutating.html"><img src="../../../../../../../../doc/html/images/up.png" alt="Up"></a><a accesskey="h" href="../../../../index.html"><img src="../../../../../../../../doc/html/images/home.png" alt="Home"></a><a accesskey="n" href="copy_backward.html"><img src="../../../../../../../../doc/html/images/next.png" alt="Next"></a>
+<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>
 </body>
 </html>
diff --git a/doc/html/range/reference/algorithms/mutating/copy_backward.html b/doc/html/range/reference/algorithms/mutating/copy_backward.html
index c1d1266..7c909c1 100644
--- a/doc/html/range/reference/algorithms/mutating/copy_backward.html
+++ b/doc/html/range/reference/algorithms/mutating/copy_backward.html
@@ -2,8 +2,8 @@
 <head>
 <meta http-equiv="Content-Type" content="text/html; charset=US-ASCII">
 <title>copy_backward</title>
-<link rel="stylesheet" href="../../../../../../../../doc/html/boostbook.css" type="text/css">
-<meta name="generator" content="DocBook XSL Stylesheets V1.75.1">
+<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="../mutating.html" title="Mutating algorithms">
 <link rel="prev" href="copy.html" title="copy">
@@ -13,22 +13,22 @@
 <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="../../../../../../../libraries.htm">Libraries</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="copy.html"><img src="../../../../../../../../doc/html/images/prev.png" alt="Prev"></a><a accesskey="u" href="../mutating.html"><img src="../../../../../../../../doc/html/images/up.png" alt="Up"></a><a accesskey="h" href="../../../../index.html"><img src="../../../../../../../../doc/html/images/home.png" alt="Home"></a><a accesskey="n" href="fill.html"><img src="../../../../../../../../doc/html/images/next.png" alt="Next"></a>
+<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" title="copy_backward">
+<div class="section">
 <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="id2723543"></a>
+<a name="id3297663"></a>
             <a class="link" href="copy_backward.html#range.reference.algorithms.mutating.copy_backward.prototype">Prototype</a>
           </h6>
 <p>
@@ -42,7 +42,7 @@
 <p>
           </p>
 <a name="range.reference.algorithms.mutating.copy_backward.description"></a><h6>
-<a name="id2723675"></a>
+<a name="id3297796"></a>
             <a class="link" href="copy_backward.html#range.reference.algorithms.mutating.copy_backward.description">Description</a>
           </h6>
 <p>
@@ -60,49 +60,49 @@
             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="id2723835"></a>
+<a name="id3297955"></a>
             <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="id2723908"></a>
+<a name="id3298028"></a>
             <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">
-<code class="computeroutput"><span class="identifier">BidirectionalRange</span></code>
-              is a model of <a class="link" href="../../../concepts/bidirectional_range.html" title="Bidirectional Range">Bidirectional
-              Range</a> Concept.
-            </li>
+                <code class="computeroutput"><span class="identifier">BidirectionalRange</span></code>
+                is a model of <a class="link" href="../../../concepts/bidirectional_range.html" title="Bidirectional Range">Bidirectional
+                Range</a> Concept.
+              </li>
 <li class="listitem">
-<code class="computeroutput"><span class="identifier">OutputIterator</span></code> is a
-              model of the <code class="computeroutput"><span class="identifier">OutputIteratorConcept</span></code>.
-            </li>
+                <code class="computeroutput"><span class="identifier">OutputIterator</span></code> is
+                a model of the <code class="computeroutput"><span class="identifier">OutputIteratorConcept</span></code>.
+              </li>
 <li class="listitem">
-              The <code class="computeroutput"><span class="identifier">value_type</span></code> of
-              <a class="link" href="../../../concepts/bidirectional_range.html" title="Bidirectional Range">Bidirectional Range</a>
-              Concept is convertible to a type in <code class="computeroutput"><span class="identifier">OutputIterator</span></code>'s
-              set of value types.
-            </li>
+                The <code class="computeroutput"><span class="identifier">value_type</span></code> of
+                <a class="link" href="../../../concepts/bidirectional_range.html" title="Bidirectional Range">Bidirectional
+                Range</a> Concept is convertible to a type in <code class="computeroutput"><span class="identifier">OutputIterator</span></code>'s
+                set of value types.
+              </li>
 </ul></div>
 <a name="range.reference.algorithms.mutating.copy_backward.precondition_"></a><h6>
-<a name="id2724016"></a>
+<a name="id3298146"></a>
             <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">
-<code class="computeroutput"><span class="identifier">out_it</span></code> is not an iterator
-              within the <code class="computeroutput"><span class="identifier">source_rng</span></code>.
-            </li>
+                <code class="computeroutput"><span class="identifier">out_it</span></code> is not an
+                iterator within the <code class="computeroutput"><span class="identifier">source_rng</span></code>.
+              </li>
 <li class="listitem">
-<code class="computeroutput"><span class="special">[</span><span class="identifier">out_it</span><span class="special">,</span> <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> is a valid range.
-            </li>
+                <code class="computeroutput"><span class="special">[</span><span class="identifier">out_it</span><span class="special">,</span> <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> is a valid range.
+              </li>
 </ul></div>
 <a name="range.reference.algorithms.mutating.copy_backward.complexity"></a><h6>
-<a name="id2724120"></a>
+<a name="id3298257"></a>
             <a class="link" href="copy_backward.html#range.reference.algorithms.mutating.copy_backward.complexity">Complexity</a>
           </h6>
 <p>
@@ -119,7 +119,7 @@
 </tr></table>
 <hr>
 <div class="spirit-nav">
-<a accesskey="p" href="copy.html"><img src="../../../../../../../../doc/html/images/prev.png" alt="Prev"></a><a accesskey="u" href="../mutating.html"><img src="../../../../../../../../doc/html/images/up.png" alt="Up"></a><a accesskey="h" href="../../../../index.html"><img src="../../../../../../../../doc/html/images/home.png" alt="Home"></a><a accesskey="n" href="fill.html"><img src="../../../../../../../../doc/html/images/next.png" alt="Next"></a>
+<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>
 </body>
 </html>
diff --git a/doc/html/range/reference/algorithms/mutating/fill.html b/doc/html/range/reference/algorithms/mutating/fill.html
index 5f5da38..013fa91 100644
--- a/doc/html/range/reference/algorithms/mutating/fill.html
+++ b/doc/html/range/reference/algorithms/mutating/fill.html
@@ -2,8 +2,8 @@
 <head>
 <meta http-equiv="Content-Type" content="text/html; charset=US-ASCII">
 <title>fill</title>
-<link rel="stylesheet" href="../../../../../../../../doc/html/boostbook.css" type="text/css">
-<meta name="generator" content="DocBook XSL Stylesheets V1.75.1">
+<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="../mutating.html" title="Mutating algorithms">
 <link rel="prev" href="copy_backward.html" title="copy_backward">
@@ -13,21 +13,21 @@
 <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="../../../../../../../libraries.htm">Libraries</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="copy_backward.html"><img src="../../../../../../../../doc/html/images/prev.png" alt="Prev"></a><a accesskey="u" href="../mutating.html"><img src="../../../../../../../../doc/html/images/up.png" alt="Up"></a><a accesskey="h" href="../../../../index.html"><img src="../../../../../../../../doc/html/images/home.png" alt="Home"></a><a accesskey="n" href="fill_n.html"><img src="../../../../../../../../doc/html/images/next.png" alt="Next"></a>
+<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" title="fill">
+<div class="section">
 <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="id2724189"></a>
+<a name="id3298327"></a>
             <a class="link" href="fill.html#range.reference.algorithms.mutating.fill.prototype">Prototype</a>
           </h6>
 <p>
@@ -39,7 +39,7 @@
 <p>
           </p>
 <a name="range.reference.algorithms.mutating.fill.description"></a><h6>
-<a name="id2724329"></a>
+<a name="id3298466"></a>
             <a class="link" href="fill.html#range.reference.algorithms.mutating.fill.description">Description</a>
           </h6>
 <p>
@@ -48,37 +48,37 @@
             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="id2724387"></a>
+<a name="id3298524"></a>
             <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="id2724457"></a>
+<a name="id3298595"></a>
             <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">
-<code class="computeroutput"><span class="identifier">ForwardRange</span></code> is a model
-              of the <a class="link" href="../../../concepts/forward_range.html" title="Forward Range">Forward Range</a>
-              Concept.
-            </li>
+                <code class="computeroutput"><span class="identifier">ForwardRange</span></code> is a
+                model of the <a class="link" href="../../../concepts/forward_range.html" title="Forward Range">Forward
+                Range</a> Concept.
+              </li>
 <li class="listitem">
-<code class="computeroutput"><span class="identifier">ForwardRange</span></code> is mutable.
-            </li>
+                <code class="computeroutput"><span class="identifier">ForwardRange</span></code> is mutable.
+              </li>
 <li class="listitem">
-<code class="computeroutput"><span class="identifier">Value</span></code> is a model of
-              the <code class="computeroutput"><span class="identifier">AssignableConcept</span></code>.
-            </li>
+                <code class="computeroutput"><span class="identifier">Value</span></code> is a model
+                of the <code class="computeroutput"><span class="identifier">AssignableConcept</span></code>.
+              </li>
 <li class="listitem">
-<code class="computeroutput"><span class="identifier">Value</span></code> is convertible
-              to <code class="computeroutput"><span class="identifier">ForwardRange</span></code>'s value
-              type.
-            </li>
+                <code class="computeroutput"><span class="identifier">Value</span></code> is convertible
+                to <code class="computeroutput"><span class="identifier">ForwardRange</span></code>'s
+                value type.
+              </li>
 </ul></div>
 <a name="range.reference.algorithms.mutating.fill.complexity"></a><h6>
-<a name="id2724571"></a>
+<a name="id3298723"></a>
             <a class="link" href="fill.html#range.reference.algorithms.mutating.fill.complexity">Complexity</a>
           </h6>
 <p>
@@ -95,7 +95,7 @@
 </tr></table>
 <hr>
 <div class="spirit-nav">
-<a accesskey="p" href="copy_backward.html"><img src="../../../../../../../../doc/html/images/prev.png" alt="Prev"></a><a accesskey="u" href="../mutating.html"><img src="../../../../../../../../doc/html/images/up.png" alt="Up"></a><a accesskey="h" href="../../../../index.html"><img src="../../../../../../../../doc/html/images/home.png" alt="Home"></a><a accesskey="n" href="fill_n.html"><img src="../../../../../../../../doc/html/images/next.png" alt="Next"></a>
+<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>
 </body>
 </html>
diff --git a/doc/html/range/reference/algorithms/mutating/fill_n.html b/doc/html/range/reference/algorithms/mutating/fill_n.html
index 5d09a06..a37bd29 100644
--- a/doc/html/range/reference/algorithms/mutating/fill_n.html
+++ b/doc/html/range/reference/algorithms/mutating/fill_n.html
@@ -2,8 +2,8 @@
 <head>
 <meta http-equiv="Content-Type" content="text/html; charset=US-ASCII">
 <title>fill_n</title>
-<link rel="stylesheet" href="../../../../../../../../doc/html/boostbook.css" type="text/css">
-<meta name="generator" content="DocBook XSL Stylesheets V1.75.1">
+<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="../mutating.html" title="Mutating algorithms">
 <link rel="prev" href="fill.html" title="fill">
@@ -13,21 +13,21 @@
 <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="../../../../../../../libraries.htm">Libraries</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="fill.html"><img src="../../../../../../../../doc/html/images/prev.png" alt="Prev"></a><a accesskey="u" href="../mutating.html"><img src="../../../../../../../../doc/html/images/up.png" alt="Up"></a><a accesskey="h" href="../../../../index.html"><img src="../../../../../../../../doc/html/images/home.png" alt="Home"></a><a accesskey="n" href="generate.html"><img src="../../../../../../../../doc/html/images/next.png" alt="Next"></a>
+<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" title="fill_n">
+<div class="section">
 <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="id2724638"></a>
+<a name="id3298789"></a>
             <a class="link" href="fill_n.html#range.reference.algorithms.mutating.fill_n.prototype">Prototype</a>
           </h6>
 <p>
@@ -39,7 +39,7 @@
 <p>
           </p>
 <a name="range.reference.algorithms.mutating.fill_n.description"></a><h6>
-<a name="id2724811"></a>
+<a name="id3298962"></a>
             <a class="link" href="fill_n.html#range.reference.algorithms.mutating.fill_n.description">Description</a>
           </h6>
 <p>
@@ -47,37 +47,37 @@
             <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="id2724912"></a>
+<a name="id3299063"></a>
             <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="id2724984"></a>
+<a name="id3299135"></a>
             <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">
-<code class="computeroutput"><span class="identifier">ForwardRange</span></code> is a model
-              of the <a class="link" href="../../../concepts/forward_range.html" title="Forward Range">Forward Range</a>
-              Concept.
-            </li>
+                <code class="computeroutput"><span class="identifier">ForwardRange</span></code> is a
+                model of the <a class="link" href="../../../concepts/forward_range.html" title="Forward Range">Forward
+                Range</a> Concept.
+              </li>
 <li class="listitem">
-<code class="computeroutput"><span class="identifier">ForwardRange</span></code> is mutable.
-            </li>
+                <code class="computeroutput"><span class="identifier">ForwardRange</span></code> is mutable.
+              </li>
 <li class="listitem">
-<code class="computeroutput"><span class="identifier">Value</span></code> is a model of
-              the <code class="computeroutput"><span class="identifier">AssignableConcept</span></code>.
-            </li>
+                <code class="computeroutput"><span class="identifier">Value</span></code> is a model
+                of the <code class="computeroutput"><span class="identifier">AssignableConcept</span></code>.
+              </li>
 <li class="listitem">
-<code class="computeroutput"><span class="identifier">Value</span></code> is convertible
-              to <code class="computeroutput"><span class="identifier">ForwardRange</span></code>'s value
-              type.
-            </li>
+                <code class="computeroutput"><span class="identifier">Value</span></code> is convertible
+                to <code class="computeroutput"><span class="identifier">ForwardRange</span></code>'s
+                value type.
+              </li>
 </ul></div>
 <a name="range.reference.algorithms.mutating.fill_n.complexity"></a><h6>
-<a name="id2725098"></a>
+<a name="id3299262"></a>
             <a class="link" href="fill_n.html#range.reference.algorithms.mutating.fill_n.complexity">Complexity</a>
           </h6>
 <p>
@@ -95,7 +95,7 @@
 </tr></table>
 <hr>
 <div class="spirit-nav">
-<a accesskey="p" href="fill.html"><img src="../../../../../../../../doc/html/images/prev.png" alt="Prev"></a><a accesskey="u" href="../mutating.html"><img src="../../../../../../../../doc/html/images/up.png" alt="Up"></a><a accesskey="h" href="../../../../index.html"><img src="../../../../../../../../doc/html/images/home.png" alt="Home"></a><a accesskey="n" href="generate.html"><img src="../../../../../../../../doc/html/images/next.png" alt="Next"></a>
+<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>
 </body>
 </html>
diff --git a/doc/html/range/reference/algorithms/mutating/generate.html b/doc/html/range/reference/algorithms/mutating/generate.html
index 7bdf2ff..a81fca5 100644
--- a/doc/html/range/reference/algorithms/mutating/generate.html
+++ b/doc/html/range/reference/algorithms/mutating/generate.html
@@ -2,8 +2,8 @@
 <head>
 <meta http-equiv="Content-Type" content="text/html; charset=US-ASCII">
 <title>generate</title>
-<link rel="stylesheet" href="../../../../../../../../doc/html/boostbook.css" type="text/css">
-<meta name="generator" content="DocBook XSL Stylesheets V1.75.1">
+<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="../mutating.html" title="Mutating algorithms">
 <link rel="prev" href="fill_n.html" title="fill_n">
@@ -13,21 +13,21 @@
 <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="../../../../../../../libraries.htm">Libraries</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="fill_n.html"><img src="../../../../../../../../doc/html/images/prev.png" alt="Prev"></a><a accesskey="u" href="../mutating.html"><img src="../../../../../../../../doc/html/images/up.png" alt="Up"></a><a accesskey="h" href="../../../../index.html"><img src="../../../../../../../../doc/html/images/home.png" alt="Home"></a><a accesskey="n" href="inplace_merge.html"><img src="../../../../../../../../doc/html/images/next.png" alt="Next"></a>
+<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" title="generate">
+<div class="section">
 <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="id2725153"></a>
+<a name="id3299317"></a>
             <a class="link" href="generate.html#range.reference.algorithms.mutating.generate.prototype">Prototype</a>
           </h6>
 <p>
@@ -42,7 +42,7 @@
 <p>
           </p>
 <a name="range.reference.algorithms.mutating.generate.description"></a><h6>
-<a name="id2725395"></a>
+<a name="id3299558"></a>
             <a class="link" href="generate.html#range.reference.algorithms.mutating.generate.description">Description</a>
           </h6>
 <p>
@@ -52,52 +52,52 @@
             Returns the resultant range.
           </p>
 <a name="range.reference.algorithms.mutating.generate.definition"></a><h6>
-<a name="id2725458"></a>
+<a name="id3299621"></a>
             <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="id2725530"></a>
+<a name="id3299693"></a>
             <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">
-<code class="computeroutput"><span class="identifier">ForwardRange</span></code> is a model
-              of the <a class="link" href="../../../concepts/forward_range.html" title="Forward Range">Forward Range</a>
-              Concept.
-            </li>
+                <code class="computeroutput"><span class="identifier">ForwardRange</span></code> is a
+                model of the <a class="link" href="../../../concepts/forward_range.html" title="Forward Range">Forward
+                Range</a> Concept.
+              </li>
 <li class="listitem">
-<code class="computeroutput"><span class="identifier">ForwardRange</span></code> is mutable.
-            </li>
+                <code class="computeroutput"><span class="identifier">ForwardRange</span></code> is mutable.
+              </li>
 <li class="listitem">
-<code class="computeroutput"><span class="identifier">Generator</span></code> is a model
-              of the <code class="computeroutput"><span class="identifier">GeneratorConcept</span></code>.
-            </li>
+                <code class="computeroutput"><span class="identifier">Generator</span></code> is a model
+                of the <code class="computeroutput"><span class="identifier">GeneratorConcept</span></code>.
+              </li>
 <li class="listitem">
-              The <code class="computeroutput"><span class="identifier">value_type</span></code> of
-              <code class="computeroutput"><span class="identifier">SinglePassRange</span></code> is
-              convertible to a type in <code class="computeroutput"><span class="identifier">OutputIterator</span></code>'s
-              set of value types.
-            </li>
+                The <code class="computeroutput"><span class="identifier">value_type</span></code> of
+                <code class="computeroutput"><span class="identifier">SinglePassRange</span></code> is
+                convertible to a type in <code class="computeroutput"><span class="identifier">OutputIterator</span></code>'s
+                set of value types.
+              </li>
 </ul></div>
 <a name="range.reference.algorithms.mutating.generate.precondition_"></a><h6>
-<a name="id2725655"></a>
+<a name="id3299832"></a>
             <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">
-<code class="computeroutput"><span class="identifier">out_it</span></code> is not an iterator
-              within <code class="computeroutput"><span class="identifier">rng</span></code>.
-            </li>
+                <code class="computeroutput"><span class="identifier">out_it</span></code> is not an
+                iterator within <code class="computeroutput"><span class="identifier">rng</span></code>.
+              </li>
 <li class="listitem">
-<code class="computeroutput"><span class="special">[</span><span class="identifier">out_it</span><span class="special">,</span> <span class="identifier">out_it</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.
-            </li>
+                <code class="computeroutput"><span class="special">[</span><span class="identifier">out_it</span><span class="special">,</span> <span class="identifier">out_it</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.
+              </li>
 </ul></div>
 <a name="range.reference.algorithms.mutating.generate.complexity"></a><h6>
-<a name="id2725758"></a>
+<a name="id3299942"></a>
             <a class="link" href="generate.html#range.reference.algorithms.mutating.generate.complexity">Complexity</a>
           </h6>
 <p>
@@ -114,7 +114,7 @@
 </tr></table>
 <hr>
 <div class="spirit-nav">
-<a accesskey="p" href="fill_n.html"><img src="../../../../../../../../doc/html/images/prev.png" alt="Prev"></a><a accesskey="u" href="../mutating.html"><img src="../../../../../../../../doc/html/images/up.png" alt="Up"></a><a accesskey="h" href="../../../../index.html"><img src="../../../../../../../../doc/html/images/home.png" alt="Home"></a><a accesskey="n" href="inplace_merge.html"><img src="../../../../../../../../doc/html/images/next.png" alt="Next"></a>
+<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>
 </body>
 </html>
diff --git a/doc/html/range/reference/algorithms/mutating/inplace_merge.html b/doc/html/range/reference/algorithms/mutating/inplace_merge.html
index 8d4d6c5..b77680d 100644
--- a/doc/html/range/reference/algorithms/mutating/inplace_merge.html
+++ b/doc/html/range/reference/algorithms/mutating/inplace_merge.html
@@ -2,8 +2,8 @@
 <head>
 <meta http-equiv="Content-Type" content="text/html; charset=US-ASCII">
 <title>inplace_merge</title>
-<link rel="stylesheet" href="../../../../../../../../doc/html/boostbook.css" type="text/css">
-<meta name="generator" content="DocBook XSL Stylesheets V1.75.1">
+<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="../mutating.html" title="Mutating algorithms">
 <link rel="prev" href="generate.html" title="generate">
@@ -13,22 +13,22 @@
 <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="../../../../../../../libraries.htm">Libraries</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="generate.html"><img src="../../../../../../../../doc/html/images/prev.png" alt="Prev"></a><a accesskey="u" href="../mutating.html"><img src="../../../../../../../../doc/html/images/up.png" alt="Up"></a><a accesskey="h" href="../../../../index.html"><img src="../../../../../../../../doc/html/images/home.png" alt="Home"></a><a accesskey="n" href="merge.html"><img src="../../../../../../../../doc/html/images/next.png" alt="Next"></a>
+<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" title="inplace_merge">
+<div class="section">
 <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="id2725826"></a>
+<a name="id3300009"></a>
             <a class="link" href="inplace_merge.html#range.reference.algorithms.mutating.inplace_merge.prototype">Prototype</a>
           </h6>
 <p>
@@ -59,7 +59,7 @@
 <p>
           </p>
 <a name="range.reference.algorithms.mutating.inplace_merge.description"></a><h6>
-<a name="id2726392"></a>
+<a name="id3300574"></a>
             <a class="link" href="inplace_merge.html#range.reference.algorithms.mutating.inplace_merge.description">Description</a>
           </h6>
 <p>
@@ -72,14 +72,14 @@
             input range is preserved.
           </p>
 <a name="range.reference.algorithms.mutating.inplace_merge.definition"></a><h6>
-<a name="id2726617"></a>
+<a name="id3300799"></a>
             <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="id2726690"></a>
+<a name="id3300872"></a>
             <a class="link" href="inplace_merge.html#range.reference.algorithms.mutating.inplace_merge.requirements">Requirements</a>
           </h6>
 <p>
@@ -87,23 +87,23 @@
           </p>
 <div class="itemizedlist"><ul class="itemizedlist" type="disc">
 <li class="listitem">
-<code class="computeroutput"><span class="identifier">BidirectionalRange</span></code>
-              is a model of the <a class="link" href="../../../concepts/bidirectional_range.html" title="Bidirectional Range">Bidirectional
-              Range</a> Concept.
-            </li>
+                <code class="computeroutput"><span class="identifier">BidirectionalRange</span></code>
+                is a model of the <a class="link" href="../../../concepts/bidirectional_range.html" title="Bidirectional Range">Bidirectional
+                Range</a> Concept.
+              </li>
 <li class="listitem">
-<code class="computeroutput"><span class="identifier">BidirectionalRange</span></code>
-              is mutable.
-            </li>
+                <code class="computeroutput"><span class="identifier">BidirectionalRange</span></code>
+                is mutable.
+              </li>
 <li class="listitem">
-<code class="computeroutput"><span class="identifier">range_value</span><span class="special">&lt;</span><span class="identifier">BidirectionalRange</span><span class="special">&gt;::</span><span class="identifier">type</span></code> is a model of <code class="computeroutput"><span class="identifier">LessThanComparableConcept</span></code>
-</li>
+                <code class="computeroutput"><span class="identifier">range_value</span><span class="special">&lt;</span><span class="identifier">BidirectionalRange</span><span class="special">&gt;::</span><span class="identifier">type</span></code> is a model of <code class="computeroutput"><span class="identifier">LessThanComparableConcept</span></code>
+              </li>
 <li class="listitem">
-              The ordering on objects of <code class="computeroutput"><span class="identifier">range_type</span><span class="special">&lt;</span><span class="identifier">BidirectionalRange</span><span class="special">&gt;::</span><span class="identifier">type</span></code>
-              is a <span class="bold"><strong><span class="emphasis"><em>strict weak ordering</em></span></strong></span>,
-              as defined in the <code class="computeroutput"><span class="identifier">LessThanComparableConcept</span></code>
-              requirements.
-            </li>
+                The ordering on objects of <code class="computeroutput"><span class="identifier">range_type</span><span class="special">&lt;</span><span class="identifier">BidirectionalRange</span><span class="special">&gt;::</span><span class="identifier">type</span></code>
+                is a <span class="bold"><strong><span class="emphasis"><em>strict weak ordering</em></span></strong></span>,
+                as defined in the <code class="computeroutput"><span class="identifier">LessThanComparableConcept</span></code>
+                requirements.
+              </li>
 </ul></div>
 <p>
             <span class="bold"><strong>For the predicate version:</strong></span> * <code class="computeroutput"><span class="identifier">BidirectionalRange</span></code> is a model of the
@@ -116,55 +116,55 @@
             argument types.
           </p>
 <a name="range.reference.algorithms.mutating.inplace_merge.precondition_"></a><h6>
-<a name="id2726944"></a>
+<a name="id3301140"></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.for_the_non_predicate_version_"></a><h6>
-<a name="id2726968"></a>
+<a name="id3301163"></a>
             <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">
 <li class="listitem">
-<code class="computeroutput"><span class="identifier">middle</span></code> is in the range
-              <code class="computeroutput"><span class="identifier">rng</span></code>.
-            </li>
+                <code class="computeroutput"><span class="identifier">middle</span></code> is in the
+                range <code class="computeroutput"><span class="identifier">rng</span></code>.
+              </li>
 <li class="listitem">
-<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> is in ascending order. That is for
-              each pair of 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">y</span> <span class="special">&lt;</span>
-              <span class="identifier">x</span></code> is <code class="computeroutput"><span class="keyword">false</span></code>.
-            </li>
+                <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> is in ascending order. That is for
+                each pair of 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">y</span> <span class="special">&lt;</span>
+                <span class="identifier">x</span></code> is <code class="computeroutput"><span class="keyword">false</span></code>.
+              </li>
 <li class="listitem">
-<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 in ascending order. That is for
-              each pair of 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">y</span> <span class="special">&lt;</span>
-              <span class="identifier">x</span></code> is <code class="computeroutput"><span class="keyword">false</span></code>.
-            </li>
+                <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 in ascending order. That is
+                for each pair of 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">y</span> <span class="special">&lt;</span>
+                <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="id2727228"></a>
+<a name="id3301433"></a>
             <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">
 <li class="listitem">
-<code class="computeroutput"><span class="identifier">middle</span></code> is in the range
-              <code class="computeroutput"><span class="identifier">rng</span></code>.
-            </li>
+                <code class="computeroutput"><span class="identifier">middle</span></code> is in the
+                range <code class="computeroutput"><span class="identifier">rng</span></code>.
+              </li>
 <li class="listitem">
-<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> is in ascending order. That is for
-              each pair of 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>.
-            </li>
+                <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> is in ascending order. That is for
+                each pair of 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>.
+              </li>
 <li class="listitem">
-<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 in ascending order. That is for
-              each pair of 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>.
-            </li>
+                <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 in ascending order. That is
+                for each pair of 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>.
+              </li>
 </ul></div>
 <a name="range.reference.algorithms.mutating.inplace_merge.complexity"></a><h6>
-<a name="id2727510"></a>
+<a name="id3301724"></a>
             <a class="link" href="inplace_merge.html#range.reference.algorithms.mutating.inplace_merge.complexity">Complexity</a>
           </h6>
 <p>
@@ -181,7 +181,7 @@
 </tr></table>
 <hr>
 <div class="spirit-nav">
-<a accesskey="p" href="generate.html"><img src="../../../../../../../../doc/html/images/prev.png" alt="Prev"></a><a accesskey="u" href="../mutating.html"><img src="../../../../../../../../doc/html/images/up.png" alt="Up"></a><a accesskey="h" href="../../../../index.html"><img src="../../../../../../../../doc/html/images/home.png" alt="Home"></a><a accesskey="n" href="merge.html"><img src="../../../../../../../../doc/html/images/next.png" alt="Next"></a>
+<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>
 </body>
 </html>
diff --git a/doc/html/range/reference/algorithms/mutating/merge.html b/doc/html/range/reference/algorithms/mutating/merge.html
index d66fc41..7fc40e8 100644
--- a/doc/html/range/reference/algorithms/mutating/merge.html
+++ b/doc/html/range/reference/algorithms/mutating/merge.html
@@ -2,8 +2,8 @@
 <head>
 <meta http-equiv="Content-Type" content="text/html; charset=US-ASCII">
 <title>merge</title>
-<link rel="stylesheet" href="../../../../../../../../doc/html/boostbook.css" type="text/css">
-<meta name="generator" content="DocBook XSL Stylesheets V1.75.1">
+<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="../mutating.html" title="Mutating algorithms">
 <link rel="prev" href="inplace_merge.html" title="inplace_merge">
@@ -13,21 +13,21 @@
 <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="../../../../../../../libraries.htm">Libraries</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="inplace_merge.html"><img src="../../../../../../../../doc/html/images/prev.png" alt="Prev"></a><a accesskey="u" href="../mutating.html"><img src="../../../../../../../../doc/html/images/up.png" alt="Up"></a><a accesskey="h" href="../../../../index.html"><img src="../../../../../../../../doc/html/images/home.png" alt="Home"></a><a accesskey="n" href="nth_element.html"><img src="../../../../../../../../doc/html/images/next.png" alt="Next"></a>
+<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" title="merge">
+<div class="section">
 <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="id2727593"></a>
+<a name="id3301807"></a>
             <a class="link" href="merge.html#range.reference.algorithms.mutating.merge.prototype">Prototype</a>
           </h6>
 <p>
@@ -56,7 +56,7 @@
 <p>
           </p>
 <a name="range.reference.algorithms.mutating.merge.description"></a><h6>
-<a name="id2727942"></a>
+<a name="id3302156"></a>
             <a class="link" href="merge.html#range.reference.algorithms.mutating.merge.description">Description</a>
           </h6>
 <p>
@@ -75,14 +75,14 @@
             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="id2728122"></a>
+<a name="id3302337"></a>
             <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="id2728195"></a>
+<a name="id3302410"></a>
             <a class="link" href="merge.html#range.reference.algorithms.mutating.merge.requirements">Requirements</a>
           </h6>
 <p>
@@ -90,137 +90,147 @@
           </p>
 <div class="itemizedlist"><ul class="itemizedlist" type="disc">
 <li class="listitem">
-<code class="computeroutput"><span class="identifier">SinglePassRange1</span></code> is
-              a model of the <a class="link" href="../../../concepts/single_pass_range.html" title="Single Pass Range">Single
-              Pass Range</a> Concept.
-            </li>
+                <code class="computeroutput"><span class="identifier">SinglePassRange1</span></code>
+                is a model of the <a class="link" href="../../../concepts/single_pass_range.html" title="Single Pass Range">Single
+                Pass Range</a> Concept.
+              </li>
 <li class="listitem">
-<code class="computeroutput"><span class="identifier">SinglePassRange2</span></code> is
-              a model of the <a class="link" href="../../../concepts/single_pass_range.html" title="Single Pass Range">Single
-              Pass Range</a> Concept.
-            </li>
+                <code class="computeroutput"><span class="identifier">SinglePassRange2</span></code>
+                is a model of the <a class="link" href="../../../concepts/single_pass_range.html" title="Single Pass Range">Single
+                Pass Range</a> Concept.
+              </li>
 <li class="listitem">
-<code class="computeroutput"><span class="identifier">range_value</span><span class="special">&lt;</span><span class="identifier">SinglePassRange1</span><span class="special">&gt;::</span><span class="identifier">type</span></code> is the same as <code class="computeroutput"><span class="identifier">range_value</span><span class="special">&lt;</span><span class="identifier">SinglePassRange2</span><span class="special">&gt;::</span><span class="identifier">type</span></code>.
-            </li>
+                <code class="computeroutput"><span class="identifier">range_value</span><span class="special">&lt;</span><span class="identifier">SinglePassRange1</span><span class="special">&gt;::</span><span class="identifier">type</span></code> is the same as <code class="computeroutput"><span class="identifier">range_value</span><span class="special">&lt;</span><span class="identifier">SinglePassRange2</span><span class="special">&gt;::</span><span class="identifier">type</span></code>.
+              </li>
 <li class="listitem">
-<code class="computeroutput"><span class="identifier">range_value</span><span class="special">&lt;</span><span class="identifier">SinglePassRange1</span><span class="special">&gt;::</span><span class="identifier">type</span></code> is a model of the <code class="computeroutput"><span class="identifier">LessThanComparableConcept</span></code>.
-            </li>
+                <code class="computeroutput"><span class="identifier">range_value</span><span class="special">&lt;</span><span class="identifier">SinglePassRange1</span><span class="special">&gt;::</span><span class="identifier">type</span></code> is a model of the <code class="computeroutput"><span class="identifier">LessThanComparableConcept</span></code>.
+              </li>
 <li class="listitem">
-              The ordering on objects of <code class="computeroutput"><span class="identifier">range_value</span><span class="special">&lt;</span><span class="identifier">SinglePassRange1</span><span class="special">&gt;::</span><span class="identifier">type</span></code>
-              is a <span class="bold"><strong><span class="emphasis"><em>strict weak ordering</em></span></strong></span>,
-              as defined in the <code class="computeroutput"><span class="identifier">LessThanComparableConcept</span></code>
-              requirements.
-            </li>
+                The ordering on objects of <code class="computeroutput"><span class="identifier">range_value</span><span class="special">&lt;</span><span class="identifier">SinglePassRange1</span><span class="special">&gt;::</span><span class="identifier">type</span></code>
+                is a <span class="bold"><strong><span class="emphasis"><em>strict weak ordering</em></span></strong></span>,
+                as defined in the <code class="computeroutput"><span class="identifier">LessThanComparableConcept</span></code>
+                requirements.
+              </li>
 <li class="listitem">
-<code class="computeroutput"><span class="identifier">range_value</span><span class="special">&lt;</span><span class="identifier">SinglePassRange1</span><span class="special">&gt;::</span><span class="identifier">type</span></code> is convertible to a type in
-              <code class="computeroutput"><span class="identifier">OutputIterator</span></code>'s set
-              of value types.
-            </li>
+                <code class="computeroutput"><span class="identifier">range_value</span><span class="special">&lt;</span><span class="identifier">SinglePassRange1</span><span class="special">&gt;::</span><span class="identifier">type</span></code> is convertible to a type in
+                <code class="computeroutput"><span class="identifier">OutputIterator</span></code>'s
+                set of value types.
+              </li>
 </ul></div>
 <p>
             <span class="bold"><strong>For the predicate version:</strong></span>
           </p>
 <div class="itemizedlist"><ul class="itemizedlist" type="disc">
 <li class="listitem">
-<code class="computeroutput"><span class="identifier">SinglePassRange1</span></code> is
-              a model of the <a class="link" href="../../../concepts/single_pass_range.html" title="Single Pass Range">Single
-              Pass Range</a> Concept.
-            </li>
+                <code class="computeroutput"><span class="identifier">SinglePassRange1</span></code>
+                is a model of the <a class="link" href="../../../concepts/single_pass_range.html" title="Single Pass Range">Single
+                Pass Range</a> Concept.
+              </li>
 <li class="listitem">
-<code class="computeroutput"><span class="identifier">SinglePassRange2</span></code> is
-              a model of the <a class="link" href="../../../concepts/single_pass_range.html" title="Single Pass Range">Single
-              Pass Range</a> Concept.
-            </li>
+                <code class="computeroutput"><span class="identifier">SinglePassRange2</span></code>
+                is a model of the <a class="link" href="../../../concepts/single_pass_range.html" title="Single Pass Range">Single
+                Pass Range</a> Concept.
+              </li>
 <li class="listitem">
-<code class="computeroutput"><span class="identifier">range_value</span><span class="special">&lt;</span><span class="identifier">SinglePassRange1</span><span class="special">&gt;::</span><span class="identifier">type</span></code> is the same as <code class="computeroutput"><span class="identifier">range_value</span><span class="special">&lt;</span><span class="identifier">SinglePassRange2</span><span class="special">&gt;::</span><span class="identifier">type</span></code>.
-            </li>
+                <code class="computeroutput"><span class="identifier">range_value</span><span class="special">&lt;</span><span class="identifier">SinglePassRange1</span><span class="special">&gt;::</span><span class="identifier">type</span></code> is the same as <code class="computeroutput"><span class="identifier">range_value</span><span class="special">&lt;</span><span class="identifier">SinglePassRange2</span><span class="special">&gt;::</span><span class="identifier">type</span></code>.
+              </li>
 <li class="listitem">
-<code class="computeroutput"><span class="identifier">BinaryPredicate</span></code> is
-              a model of the <code class="computeroutput"><span class="identifier">StrictWeakOrderingConcept</span></code>.
-            </li>
+                <code class="computeroutput"><span class="identifier">BinaryPredicate</span></code> is
+                a model of the <code class="computeroutput"><span class="identifier">StrictWeakOrderingConcept</span></code>.
+              </li>
 <li class="listitem">
-<code class="computeroutput"><span class="identifier">SinglePassRange1</span></code>'s
-              value type is convertible to both <code class="computeroutput"><span class="identifier">BinaryPredicate</span></code>'s
-              argument types.
-            </li>
+                <code class="computeroutput"><span class="identifier">SinglePassRange1</span></code>'s
+                value type is convertible to both <code class="computeroutput"><span class="identifier">BinaryPredicate</span></code>'s
+                argument types.
+              </li>
 <li class="listitem">
-<code class="computeroutput"><span class="identifier">range_value</span><span class="special">&lt;</span><span class="identifier">SinglePassRange1</span><span class="special">&gt;::</span><span class="identifier">type</span></code> is convertible to a type in
-              <code class="computeroutput"><span class="identifier">OutputIterator</span></code>'s set
-              of value types.
-            </li>
+                <code class="computeroutput"><span class="identifier">range_value</span><span class="special">&lt;</span><span class="identifier">SinglePassRange1</span><span class="special">&gt;::</span><span class="identifier">type</span></code> is convertible to a type in
+                <code class="computeroutput"><span class="identifier">OutputIterator</span></code>'s
+                set of value types.
+              </li>
 </ul></div>
 <a name="range.reference.algorithms.mutating.merge.precondition_"></a><h6>
-<a name="id2728698"></a>
+<a name="id3302953"></a>
             <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="id2728721"></a>
+<a name="id3302976"></a>
             <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">
 <li class="listitem">
-              The elements of <code class="computeroutput"><span class="identifier">rng1</span></code>
-              are in ascending order. That is, for each adjacent element pair <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> of <code class="computeroutput"><span class="identifier">rng1</span></code>,
-              <code class="computeroutput"><span class="identifier">y</span> <span class="special">&lt;</span>
-              <span class="identifier">x</span> <span class="special">==</span>
-              <span class="keyword">false</span></code>.
-            </li>
+                The elements of <code class="computeroutput"><span class="identifier">rng1</span></code>
+                are in ascending order. That is, for each adjacent element pair
+                <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> of <code class="computeroutput"><span class="identifier">rng1</span></code>,
+                <code class="computeroutput"><span class="identifier">y</span> <span class="special">&lt;</span>
+                <span class="identifier">x</span> <span class="special">==</span>
+                <span class="keyword">false</span></code>.
+              </li>
 <li class="listitem">
-              The elements of <code class="computeroutput"><span class="identifier">rng2</span></code>
-              are in ascending order. That is, for each adjacent element pair <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> of <code class="computeroutput"><span class="identifier">rng2</span></code>,
-              <code class="computeroutput"><span class="identifier">y</span> <span class="special">&lt;</span>
-              <span class="identifier">x</span> <span class="special">==</span>
-              <span class="keyword">false</span></code>.
-            </li>
+                The elements of <code class="computeroutput"><span class="identifier">rng2</span></code>
+                are in ascending order. That is, for each adjacent element pair
+                <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> of <code class="computeroutput"><span class="identifier">rng2</span></code>,
+                <code class="computeroutput"><span class="identifier">y</span> <span class="special">&lt;</span>
+                <span class="identifier">x</span> <span class="special">==</span>
+                <span class="keyword">false</span></code>.
+              </li>
 <li class="listitem">
-              The ranges <code class="computeroutput"><span class="identifier">rng1</span></code> and
-              <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">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>
-              do not overlap.
-            </li>
+                The ranges <code class="computeroutput"><span class="identifier">rng1</span></code> and
+                <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">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>
+                do not overlap.
+              </li>
 <li class="listitem">
-              The ranges <code class="computeroutput"><span class="identifier">rng2</span></code> and
-              <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">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>
-              do not overlap.
-            </li>
+                The ranges <code class="computeroutput"><span class="identifier">rng2</span></code> and
+                <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">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>
+                do not overlap.
+              </li>
 <li class="listitem">
-<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">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>
-              is a valid range.
-            </li>
+                <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">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>
+                is a valid range.
+              </li>
 </ul></div>
 <a name="range.reference.algorithms.mutating.merge.for_the_predicate_version_"></a><h6>
-<a name="id2729182"></a>
+<a name="id3303453"></a>
             <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">
 <li class="listitem">
-              The elements of <code class="computeroutput"><span class="identifier">rng1</span></code>
-              are in ascending order. That is, for each adjacent element pair <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>, of <code class="computeroutput"><span class="identifier">rng1</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>.
-            </li>
+                The elements of <code class="computeroutput"><span class="identifier">rng1</span></code>
+                are in ascending order. That is, for each adjacent element pair
+                <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>, of <code class="computeroutput"><span class="identifier">rng1</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>.
+              </li>
 <li class="listitem">
-              The elements of <code class="computeroutput"><span class="identifier">rng2</span></code>
-              are in ascending order. That is, for each adjacent element pair <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>, of <code class="computeroutput"><span class="identifier">rng2</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>.
-            </li>
+                The elements of <code class="computeroutput"><span class="identifier">rng2</span></code>
+                are in ascending order. That is, for each adjacent element pair
+                <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>, of <code class="computeroutput"><span class="identifier">rng2</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>.
+              </li>
 <li class="listitem">
-              The ranges <code class="computeroutput"><span class="identifier">rng1</span></code> and
-              <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">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>
-              do not overlap.
-            </li>
+                The ranges <code class="computeroutput"><span class="identifier">rng1</span></code> and
+                <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">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>
+                do not overlap.
+              </li>
 <li class="listitem">
-              The ranges <code class="computeroutput"><span class="identifier">rng2</span></code> and
-              <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">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>
-              do not overlap.
-            </li>
+                The ranges <code class="computeroutput"><span class="identifier">rng2</span></code> and
+                <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">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>
+                do not overlap.
+              </li>
 <li class="listitem">
-<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">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>
-              is a valid range.
-            </li>
+                <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">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>
+                is a valid range.
+              </li>
 </ul></div>
 <a name="range.reference.algorithms.mutating.merge.complexity"></a><h6>
-<a name="id2729665"></a>
+<a name="id3303954"></a>
             <a class="link" href="merge.html#range.reference.algorithms.mutating.merge.complexity">Complexity</a>
           </h6>
 <p>
@@ -240,7 +250,7 @@
 </tr></table>
 <hr>
 <div class="spirit-nav">
-<a accesskey="p" href="inplace_merge.html"><img src="../../../../../../../../doc/html/images/prev.png" alt="Prev"></a><a accesskey="u" href="../mutating.html"><img src="../../../../../../../../doc/html/images/up.png" alt="Up"></a><a accesskey="h" href="../../../../index.html"><img src="../../../../../../../../doc/html/images/home.png" alt="Home"></a><a accesskey="n" href="nth_element.html"><img src="../../../../../../../../doc/html/images/next.png" alt="Next"></a>
+<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>
 </body>
 </html>
diff --git a/doc/html/range/reference/algorithms/mutating/nth_element.html b/doc/html/range/reference/algorithms/mutating/nth_element.html
index cd13253..1f3b2ef 100644
--- a/doc/html/range/reference/algorithms/mutating/nth_element.html
+++ b/doc/html/range/reference/algorithms/mutating/nth_element.html
@@ -2,8 +2,8 @@
 <head>
 <meta http-equiv="Content-Type" content="text/html; charset=US-ASCII">
 <title>nth_element</title>
-<link rel="stylesheet" href="../../../../../../../../doc/html/boostbook.css" type="text/css">
-<meta name="generator" content="DocBook XSL Stylesheets V1.75.1">
+<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="../mutating.html" title="Mutating algorithms">
 <link rel="prev" href="merge.html" title="merge">
@@ -13,22 +13,22 @@
 <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="../../../../../../../libraries.htm">Libraries</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="merge.html"><img src="../../../../../../../../doc/html/images/prev.png" alt="Prev"></a><a accesskey="u" href="../mutating.html"><img src="../../../../../../../../doc/html/images/up.png" alt="Up"></a><a accesskey="h" href="../../../../index.html"><img src="../../../../../../../../doc/html/images/home.png" alt="Home"></a><a accesskey="n" href="partial_sort.html"><img src="../../../../../../../../doc/html/images/next.png" alt="Next"></a>
+<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" title="nth_element">
+<div class="section">
 <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="id2729791"></a>
+<a name="id3304080"></a>
             <a class="link" href="nth_element.html#range.reference.algorithms.mutating.nth_element.prototype">Prototype</a>
           </h6>
 <p>
@@ -59,7 +59,7 @@
 <p>
           </p>
 <a name="range.reference.algorithms.mutating.nth_element.description"></a><h6>
-<a name="id2730317"></a>
+<a name="id3304606"></a>
             <a class="link" href="nth_element.html#range.reference.algorithms.mutating.nth_element.description">Description</a>
           </h6>
 <p>
@@ -70,14 +70,14 @@
             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="id2730399"></a>
+<a name="id3304688"></a>
             <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="id2730472"></a>
+<a name="id3304761"></a>
             <a class="link" href="nth_element.html#range.reference.algorithms.mutating.nth_element.requirements">Requirements</a>
           </h6>
 <p>
@@ -85,50 +85,50 @@
           </p>
 <div class="itemizedlist"><ul class="itemizedlist" type="disc">
 <li class="listitem">
-<code class="computeroutput"><span class="identifier">RandomAccessRange</span></code> is
-              a model of the <a class="link" href="../../../concepts/random_access_range.html" title="Random Access Range">Random
-              Access Range</a> Concept.
-            </li>
+                <code class="computeroutput"><span class="identifier">RandomAccessRange</span></code>
+                is a model of the <a class="link" href="../../../concepts/random_access_range.html" title="Random Access Range">Random
+                Access Range</a> Concept.
+              </li>
 <li class="listitem">
-<code class="computeroutput"><span class="identifier">RandomAccessRange</span></code> is
-              mutable.
-            </li>
+                <code class="computeroutput"><span class="identifier">RandomAccessRange</span></code>
+                is mutable.
+              </li>
 <li class="listitem">
-<code class="computeroutput"><span class="identifier">RandomAccessRange</span></code>'s
-              value type is a model of the <code class="computeroutput"><span class="identifier">LessThanComparableConcept</span></code>.
-            </li>
+                <code class="computeroutput"><span class="identifier">RandomAccessRange</span></code>'s
+                value type is a model of the <code class="computeroutput"><span class="identifier">LessThanComparableConcept</span></code>.
+              </li>
 <li class="listitem">
-              The ordering relation on <code class="computeroutput"><span class="identifier">RandomAccessRange</span></code>'s
-              value type is a <span class="bold"><strong><span class="emphasis"><em>strict weak ordering</em></span></strong></span>,
-              as defined in the <code class="computeroutput"><span class="identifier">LessThanComparableConcept</span></code>
-              requirements.
-            </li>
+                The ordering relation on <code class="computeroutput"><span class="identifier">RandomAccessRange</span></code>'s
+                value type is a <span class="bold"><strong><span class="emphasis"><em>strict weak ordering</em></span></strong></span>,
+                as defined in the <code class="computeroutput"><span class="identifier">LessThanComparableConcept</span></code>
+                requirements.
+              </li>
 </ul></div>
 <p>
             <span class="bold"><strong>For the predicate version:</strong></span>
           </p>
 <div class="itemizedlist"><ul class="itemizedlist" type="disc">
 <li class="listitem">
-<code class="computeroutput"><span class="identifier">RandomAccessRange</span></code> is
-              a model of the <a class="link" href="../../../concepts/random_access_range.html" title="Random Access Range">Random
-              Access Range</a> Concept.
-            </li>
+                <code class="computeroutput"><span class="identifier">RandomAccessRange</span></code>
+                is a model of the <a class="link" href="../../../concepts/random_access_range.html" title="Random Access Range">Random
+                Access Range</a> Concept.
+              </li>
 <li class="listitem">
-<code class="computeroutput"><span class="identifier">RandomAccessRange</span></code> is
-              mutable.
-            </li>
+                <code class="computeroutput"><span class="identifier">RandomAccessRange</span></code>
+                is mutable.
+              </li>
 <li class="listitem">
-<code class="computeroutput"><span class="identifier">BinaryPredicate</span></code> is
-              a model of the <code class="computeroutput"><span class="identifier">StrictWeakOrderingConcept</span></code>.
-            </li>
+                <code class="computeroutput"><span class="identifier">BinaryPredicate</span></code> is
+                a model of the <code class="computeroutput"><span class="identifier">StrictWeakOrderingConcept</span></code>.
+              </li>
 <li class="listitem">
-<code class="computeroutput"><span class="identifier">RandomAccessRange</span></code>'s
-              value type is convertible to both of <code class="computeroutput"><span class="identifier">BinaryPredicate</span></code>'s
-              argument types.
-            </li>
+                <code class="computeroutput"><span class="identifier">RandomAccessRange</span></code>'s
+                value type is convertible to both of <code class="computeroutput"><span class="identifier">BinaryPredicate</span></code>'s
+                argument types.
+              </li>
 </ul></div>
 <a name="range.reference.algorithms.mutating.nth_element.complexity"></a><h6>
-<a name="id2730706"></a>
+<a name="id3305021"></a>
             <a class="link" href="nth_element.html#range.reference.algorithms.mutating.nth_element.complexity">Complexity</a>
           </h6>
 <p>
@@ -145,7 +145,7 @@
 </tr></table>
 <hr>
 <div class="spirit-nav">
-<a accesskey="p" href="merge.html"><img src="../../../../../../../../doc/html/images/prev.png" alt="Prev"></a><a accesskey="u" href="../mutating.html"><img src="../../../../../../../../doc/html/images/up.png" alt="Up"></a><a accesskey="h" href="../../../../index.html"><img src="../../../../../../../../doc/html/images/home.png" alt="Home"></a><a accesskey="n" href="partial_sort.html"><img src="../../../../../../../../doc/html/images/next.png" alt="Next"></a>
+<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>
 </body>
 </html>
diff --git a/doc/html/range/reference/algorithms/mutating/partial_sort.html b/doc/html/range/reference/algorithms/mutating/partial_sort.html
index 7938cd3..57faa7d 100644
--- a/doc/html/range/reference/algorithms/mutating/partial_sort.html
+++ b/doc/html/range/reference/algorithms/mutating/partial_sort.html
@@ -2,8 +2,8 @@
 <head>
 <meta http-equiv="Content-Type" content="text/html; charset=US-ASCII">
 <title>partial_sort</title>
-<link rel="stylesheet" href="../../../../../../../../doc/html/boostbook.css" type="text/css">
-<meta name="generator" content="DocBook XSL Stylesheets V1.75.1">
+<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="../mutating.html" title="Mutating algorithms">
 <link rel="prev" href="nth_element.html" title="nth_element">
@@ -13,22 +13,22 @@
 <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="../../../../../../../libraries.htm">Libraries</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="nth_element.html"><img src="../../../../../../../../doc/html/images/prev.png" alt="Prev"></a><a accesskey="u" href="../mutating.html"><img src="../../../../../../../../doc/html/images/up.png" alt="Up"></a><a accesskey="h" href="../../../../index.html"><img src="../../../../../../../../doc/html/images/home.png" alt="Home"></a><a accesskey="n" href="partition.html"><img src="../../../../../../../../doc/html/images/next.png" alt="Next"></a>
+<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" title="partial_sort">
+<div class="section">
 <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="id2730773"></a>
+<a name="id3305088"></a>
             <a class="link" href="partial_sort.html#range.reference.algorithms.mutating.partial_sort.prototype">Prototype</a>
           </h6>
 <p>
@@ -59,7 +59,7 @@
 <p>
           </p>
 <a name="range.reference.algorithms.mutating.partial_sort.description"></a><h6>
-<a name="id2731300"></a>
+<a name="id3305615"></a>
             <a class="link" href="partial_sort.html#range.reference.algorithms.mutating.partial_sort.description">Description</a>
           </h6>
 <p>
@@ -75,14 +75,14 @@
             predicate instead.
           </p>
 <a name="range.reference.algorithms.mutating.partial_sort.definition"></a><h6>
-<a name="id2731483"></a>
+<a name="id3305798"></a>
             <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="id2731557"></a>
+<a name="id3305872"></a>
             <a class="link" href="partial_sort.html#range.reference.algorithms.mutating.partial_sort.requirements">Requirements</a>
           </h6>
 <p>
@@ -90,50 +90,50 @@
           </p>
 <div class="itemizedlist"><ul class="itemizedlist" type="disc">
 <li class="listitem">
-<code class="computeroutput"><span class="identifier">RandomAccessRange</span></code> is
-              a model of the <a class="link" href="../../../concepts/random_access_range.html" title="Random Access Range">Random
-              Access Range</a> Concept.
-            </li>
+                <code class="computeroutput"><span class="identifier">RandomAccessRange</span></code>
+                is a model of the <a class="link" href="../../../concepts/random_access_range.html" title="Random Access Range">Random
+                Access Range</a> Concept.
+              </li>
 <li class="listitem">
-<code class="computeroutput"><span class="identifier">RandomAccessRange</span></code> is
-              mutable.
-            </li>
+                <code class="computeroutput"><span class="identifier">RandomAccessRange</span></code>
+                is mutable.
+              </li>
 <li class="listitem">
-<code class="computeroutput"><span class="identifier">RandomAccessRange</span></code>'s
-              value type is a model of the <code class="computeroutput"><span class="identifier">LessThanComparableConcept</span></code>.
-            </li>
+                <code class="computeroutput"><span class="identifier">RandomAccessRange</span></code>'s
+                value type is a model of the <code class="computeroutput"><span class="identifier">LessThanComparableConcept</span></code>.
+              </li>
 <li class="listitem">
-              The ordering relation on <code class="computeroutput"><span class="identifier">RandomAccessRange</span></code>'s
-              value type is a <span class="bold"><strong><span class="emphasis"><em>strict weak ordering</em></span></strong></span>,
-              as defined in the <code class="computeroutput"><span class="identifier">LessThanComparableConcept</span></code>
-              requirements.
-            </li>
+                The ordering relation on <code class="computeroutput"><span class="identifier">RandomAccessRange</span></code>'s
+                value type is a <span class="bold"><strong><span class="emphasis"><em>strict weak ordering</em></span></strong></span>,
+                as defined in the <code class="computeroutput"><span class="identifier">LessThanComparableConcept</span></code>
+                requirements.
+              </li>
 </ul></div>
 <p>
             <span class="bold"><strong>For the predicate version:</strong></span>
           </p>
 <div class="itemizedlist"><ul class="itemizedlist" type="disc">
 <li class="listitem">
-<code class="computeroutput"><span class="identifier">RandomAccessRange</span></code> is
-              a model of the <a class="link" href="../../../concepts/random_access_range.html" title="Random Access Range">Random
-              Access Range</a> Concept.
-            </li>
+                <code class="computeroutput"><span class="identifier">RandomAccessRange</span></code>
+                is a model of the <a class="link" href="../../../concepts/random_access_range.html" title="Random Access Range">Random
+                Access Range</a> Concept.
+              </li>
 <li class="listitem">
-<code class="computeroutput"><span class="identifier">RandomAccessRange</span></code> is
-              mutable.
-            </li>
+                <code class="computeroutput"><span class="identifier">RandomAccessRange</span></code>
+                is mutable.
+              </li>
 <li class="listitem">
-<code class="computeroutput"><span class="identifier">BinaryPredicate</span></code> is
-              a model of the <code class="computeroutput"><span class="identifier">StrictWeakOrderingConcept</span></code>.
-            </li>
+                <code class="computeroutput"><span class="identifier">BinaryPredicate</span></code> is
+                a model of the <code class="computeroutput"><span class="identifier">StrictWeakOrderingConcept</span></code>.
+              </li>
 <li class="listitem">
-<code class="computeroutput"><span class="identifier">RandomAccessRange</span></code>'s
-              value type is convertible to both of <code class="computeroutput"><span class="identifier">BinaryPredicate</span></code>'s
-              argument types.
-            </li>
+                <code class="computeroutput"><span class="identifier">RandomAccessRange</span></code>'s
+                value type is convertible to both of <code class="computeroutput"><span class="identifier">BinaryPredicate</span></code>'s
+                argument types.
+              </li>
 </ul></div>
 <a name="range.reference.algorithms.mutating.partial_sort.complexity"></a><h6>
-<a name="id2731792"></a>
+<a name="id3306131"></a>
             <a class="link" href="partial_sort.html#range.reference.algorithms.mutating.partial_sort.complexity">Complexity</a>
           </h6>
 <p>
@@ -150,7 +150,7 @@
 </tr></table>
 <hr>
 <div class="spirit-nav">
-<a accesskey="p" href="nth_element.html"><img src="../../../../../../../../doc/html/images/prev.png" alt="Prev"></a><a accesskey="u" href="../mutating.html"><img src="../../../../../../../../doc/html/images/up.png" alt="Up"></a><a accesskey="h" href="../../../../index.html"><img src="../../../../../../../../doc/html/images/home.png" alt="Home"></a><a accesskey="n" href="partition.html"><img src="../../../../../../../../doc/html/images/next.png" alt="Next"></a>
+<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>
 </body>
 </html>
diff --git a/doc/html/range/reference/algorithms/mutating/partition.html b/doc/html/range/reference/algorithms/mutating/partition.html
index 79bd88c..597612c 100644
--- a/doc/html/range/reference/algorithms/mutating/partition.html
+++ b/doc/html/range/reference/algorithms/mutating/partition.html
@@ -2,8 +2,8 @@
 <head>
 <meta http-equiv="Content-Type" content="text/html; charset=US-ASCII">
 <title>partition</title>
-<link rel="stylesheet" href="../../../../../../../../doc/html/boostbook.css" type="text/css">
-<meta name="generator" content="DocBook XSL Stylesheets V1.75.1">
+<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="../mutating.html" title="Mutating algorithms">
 <link rel="prev" href="partial_sort.html" title="partial_sort">
@@ -13,21 +13,21 @@
 <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="../../../../../../../libraries.htm">Libraries</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="partial_sort.html"><img src="../../../../../../../../doc/html/images/prev.png" alt="Prev"></a><a accesskey="u" href="../mutating.html"><img src="../../../../../../../../doc/html/images/up.png" alt="Up"></a><a accesskey="h" href="../../../../index.html"><img src="../../../../../../../../doc/html/images/home.png" alt="Home"></a><a accesskey="n" href="random_shuffle.html"><img src="../../../../../../../../doc/html/images/next.png" alt="Next"></a>
+<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" title="partition">
+<div class="section">
 <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="id2731911"></a>
+<a name="id3306251"></a>
             <a class="link" href="partition.html#range.reference.algorithms.mutating.partition.prototype">Prototype</a>
           </h6>
 <p>
@@ -66,7 +66,7 @@
 <p>
           </p>
 <a name="range.reference.algorithms.mutating.partition.description"></a><h6>
-<a name="id2732495"></a>
+<a name="id3306834"></a>
             <a class="link" href="partition.html#range.reference.algorithms.mutating.partition.description">Description</a>
           </h6>
 <p>
@@ -80,34 +80,34 @@
             corresponds to the middle iterator.
           </p>
 <a name="range.reference.algorithms.mutating.partition.definition"></a><h6>
-<a name="id2732579"></a>
+<a name="id3306918"></a>
             <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="id2732650"></a>
+<a name="id3306990"></a>
             <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">
-<code class="computeroutput"><span class="identifier">ForwardRange</span></code> is a model
-              of the <a class="link" href="../../../concepts/forward_range.html" title="Forward Range">Forward Range</a>
-              Concept.
-            </li>
+                <code class="computeroutput"><span class="identifier">ForwardRange</span></code> is a
+                model of the <a class="link" href="../../../concepts/forward_range.html" title="Forward Range">Forward
+                Range</a> Concept.
+              </li>
 <li class="listitem">
-<code class="computeroutput"><span class="identifier">UnaryPredicate</span></code> is a
-              model of the <code class="computeroutput"><span class="identifier">PredicateConcept</span></code>.
-            </li>
+                <code class="computeroutput"><span class="identifier">UnaryPredicate</span></code> is
+                a model of the <code class="computeroutput"><span class="identifier">PredicateConcept</span></code>.
+              </li>
 <li class="listitem">
-<code class="computeroutput"><span class="identifier">ForwardRange</span></code>'s value
-              type is convertible to <code class="computeroutput"><span class="identifier">UnaryPredicate</span></code>'s
-              argument type.
-            </li>
+                <code class="computeroutput"><span class="identifier">ForwardRange</span></code>'s value
+                type is convertible to <code class="computeroutput"><span class="identifier">UnaryPredicate</span></code>'s
+                argument type.
+              </li>
 </ul></div>
 <a name="range.reference.algorithms.mutating.partition.complexity"></a><h6>
-<a name="id2732750"></a>
+<a name="id3307099"></a>
             <a class="link" href="partition.html#range.reference.algorithms.mutating.partition.complexity">Complexity</a>
           </h6>
 <p>
@@ -126,7 +126,7 @@
 </tr></table>
 <hr>
 <div class="spirit-nav">
-<a accesskey="p" href="partial_sort.html"><img src="../../../../../../../../doc/html/images/prev.png" alt="Prev"></a><a accesskey="u" href="../mutating.html"><img src="../../../../../../../../doc/html/images/up.png" alt="Up"></a><a accesskey="h" href="../../../../index.html"><img src="../../../../../../../../doc/html/images/home.png" alt="Home"></a><a accesskey="n" href="random_shuffle.html"><img src="../../../../../../../../doc/html/images/next.png" alt="Next"></a>
+<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>
 </body>
 </html>
diff --git a/doc/html/range/reference/algorithms/mutating/random_shuffle.html b/doc/html/range/reference/algorithms/mutating/random_shuffle.html
index d94fc5a..ece4438 100644
--- a/doc/html/range/reference/algorithms/mutating/random_shuffle.html
+++ b/doc/html/range/reference/algorithms/mutating/random_shuffle.html
@@ -2,8 +2,8 @@
 <head>
 <meta http-equiv="Content-Type" content="text/html; charset=US-ASCII">
 <title>random_shuffle</title>
-<link rel="stylesheet" href="../../../../../../../../doc/html/boostbook.css" type="text/css">
-<meta name="generator" content="DocBook XSL Stylesheets V1.75.1">
+<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="../mutating.html" title="Mutating algorithms">
 <link rel="prev" href="partition.html" title="partition">
@@ -13,22 +13,22 @@
 <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="../../../../../../../libraries.htm">Libraries</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="partition.html"><img src="../../../../../../../../doc/html/images/prev.png" alt="Prev"></a><a accesskey="u" href="../mutating.html"><img src="../../../../../../../../doc/html/images/up.png" alt="Up"></a><a accesskey="h" href="../../../../index.html"><img src="../../../../../../../../doc/html/images/home.png" alt="Home"></a><a accesskey="n" href="remove.html"><img src="../../../../../../../../doc/html/images/next.png" alt="Next"></a>
+<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" title="random_shuffle">
+<div class="section">
 <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="id2732864"></a>
+<a name="id3307214"></a>
             <a class="link" href="random_shuffle.html#range.reference.algorithms.mutating.random_shuffle.prototype">Prototype</a>
           </h6>
 <p>
@@ -49,7 +49,7 @@
 <p>
           </p>
 <a name="range.reference.algorithms.mutating.random_shuffle.description"></a><h6>
-<a name="id2733253"></a>
+<a name="id3307604"></a>
             <a class="link" href="random_shuffle.html#range.reference.algorithms.mutating.random_shuffle.description">Description</a>
           </h6>
 <p>
@@ -61,54 +61,54 @@
             the shuffles range.
           </p>
 <a name="range.reference.algorithms.mutating.random_shuffle.definition"></a><h6>
-<a name="id2733348"></a>
+<a name="id3307699"></a>
             <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="id2733421"></a>
+<a name="id3307772"></a>
             <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>
           </p>
 <div class="itemizedlist"><ul class="itemizedlist" type="disc"><li class="listitem">
-<code class="computeroutput"><span class="identifier">RandomAccessRange</span></code> is
-              a model of the <a class="link" href="../../../concepts/random_access_range.html" title="Random Access Range">Random
-              Access Range</a> Concept.
-            </li></ul></div>
+                <code class="computeroutput"><span class="identifier">RandomAccessRange</span></code>
+                is a model of the <a class="link" href="../../../concepts/random_access_range.html" title="Random Access Range">Random
+                Access Range</a> Concept.
+              </li></ul></div>
 <p>
             <span class="bold"><strong>For the version with a Generator:</strong></span>
           </p>
 <div class="itemizedlist"><ul class="itemizedlist" type="disc">
 <li class="listitem">
-<code class="computeroutput"><span class="identifier">RandomAccessRange</span></code> is
-              a model of the <a class="link" href="../../../concepts/random_access_range.html" title="Random Access Range">Random
-              Access Range</a> Concept.
-            </li>
+                <code class="computeroutput"><span class="identifier">RandomAccessRange</span></code>
+                is a model of the <a class="link" href="../../../concepts/random_access_range.html" title="Random Access Range">Random
+                Access Range</a> Concept.
+              </li>
 <li class="listitem">
-<code class="computeroutput"><span class="identifier">Generator</span></code> is a model
-              of the <code class="computeroutput"><span class="identifier">RandomNumberGeneratorConcept</span></code>.
-            </li>
+                <code class="computeroutput"><span class="identifier">Generator</span></code> is a model
+                of the <code class="computeroutput"><span class="identifier">RandomNumberGeneratorConcept</span></code>.
+              </li>
 <li class="listitem">
-<code class="computeroutput"><span class="identifier">RandomAccessRange</span></code>'s
-              distance type is convertible to <code class="computeroutput"><span class="identifier">Generator</span></code>'s
-              argument type.
-            </li>
+                <code class="computeroutput"><span class="identifier">RandomAccessRange</span></code>'s
+                distance type is convertible to <code class="computeroutput"><span class="identifier">Generator</span></code>'s
+                argument type.
+              </li>
 </ul></div>
 <a name="range.reference.algorithms.mutating.random_shuffle.precondition_"></a><h6>
-<a name="id2733566"></a>
+<a name="id3307930"></a>
             <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>
+                <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="id2733631"></a>
+<a name="id3307998"></a>
             <a class="link" href="random_shuffle.html#range.reference.algorithms.mutating.random_shuffle.complexity">Complexity</a>
           </h6>
 <p>
@@ -126,7 +126,7 @@
 </tr></table>
 <hr>
 <div class="spirit-nav">
-<a accesskey="p" href="partition.html"><img src="../../../../../../../../doc/html/images/prev.png" alt="Prev"></a><a accesskey="u" href="../mutating.html"><img src="../../../../../../../../doc/html/images/up.png" alt="Up"></a><a accesskey="h" href="../../../../index.html"><img src="../../../../../../../../doc/html/images/home.png" alt="Home"></a><a accesskey="n" href="remove.html"><img src="../../../../../../../../doc/html/images/next.png" alt="Next"></a>
+<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>
 </body>
 </html>
diff --git a/doc/html/range/reference/algorithms/mutating/remove.html b/doc/html/range/reference/algorithms/mutating/remove.html
index de178ea..58f2b6b 100644
--- a/doc/html/range/reference/algorithms/mutating/remove.html
+++ b/doc/html/range/reference/algorithms/mutating/remove.html
@@ -2,8 +2,8 @@
 <head>
 <meta http-equiv="Content-Type" content="text/html; charset=US-ASCII">
 <title>remove</title>
-<link rel="stylesheet" href="../../../../../../../../doc/html/boostbook.css" type="text/css">
-<meta name="generator" content="DocBook XSL Stylesheets V1.75.1">
+<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="../mutating.html" title="Mutating algorithms">
 <link rel="prev" href="random_shuffle.html" title="random_shuffle">
@@ -13,21 +13,21 @@
 <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="../../../../../../../libraries.htm">Libraries</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="random_shuffle.html"><img src="../../../../../../../../doc/html/images/prev.png" alt="Prev"></a><a accesskey="u" href="../mutating.html"><img src="../../../../../../../../doc/html/images/up.png" alt="Up"></a><a accesskey="h" href="../../../../index.html"><img src="../../../../../../../../doc/html/images/home.png" alt="Home"></a><a accesskey="n" href="remove_copy.html"><img src="../../../../../../../../doc/html/images/next.png" alt="Next"></a>
+<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" title="remove">
+<div class="section">
 <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="id2733739"></a>
+<a name="id3308106"></a>
             <a class="link" href="remove.html#range.reference.algorithms.mutating.remove.prototype">Prototype</a>
           </h6>
 <p>
@@ -66,7 +66,7 @@
 <p>
           </p>
 <a name="range.reference.algorithms.mutating.remove.description"></a><h6>
-<a name="id2734360"></a>
+<a name="id3308725"></a>
             <a class="link" href="remove.html#range.reference.algorithms.mutating.remove.description">Description</a>
           </h6>
 <p>
@@ -83,37 +83,37 @@
             are dereferenceable, but the elements are unspecified.
           </p>
 <a name="range.reference.algorithms.mutating.remove.definition"></a><h6>
-<a name="id2734595"></a>
+<a name="id3308962"></a>
             <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="id2734668"></a>
+<a name="id3309035"></a>
             <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">
-<code class="computeroutput"><span class="identifier">ForwardRange</span></code> is a model
-              of the <a class="link" href="../../../concepts/forward_range.html" title="Forward Range">Forward Range</a>
-              Concept.
-            </li>
+                <code class="computeroutput"><span class="identifier">ForwardRange</span></code> is a
+                model of the <a class="link" href="../../../concepts/forward_range.html" title="Forward Range">Forward
+                Range</a> Concept.
+              </li>
 <li class="listitem">
-<code class="computeroutput"><span class="identifier">ForwardRange</span></code> is mutable.
-            </li>
+                <code class="computeroutput"><span class="identifier">ForwardRange</span></code> is mutable.
+              </li>
 <li class="listitem">
-<code class="computeroutput"><span class="identifier">Value</span></code> is a model of
-              the <code class="computeroutput"><span class="identifier">EqualityComparableConcept</span></code>.
-            </li>
+                <code class="computeroutput"><span class="identifier">Value</span></code> is a model
+                of the <code class="computeroutput"><span class="identifier">EqualityComparableConcept</span></code>.
+              </li>
 <li class="listitem">
-              Objects of type <code class="computeroutput"><span class="identifier">Value</span></code>
-              can be compared for equality with objects of <code class="computeroutput"><span class="identifier">ForwardRange</span></code>'s
-              value type.
-            </li>
+                Objects of type <code class="computeroutput"><span class="identifier">Value</span></code>
+                can be compared for equality with objects of <code class="computeroutput"><span class="identifier">ForwardRange</span></code>'s
+                value type.
+              </li>
 </ul></div>
 <a name="range.reference.algorithms.mutating.remove.complexity"></a><h6>
-<a name="id2734782"></a>
+<a name="id3309163"></a>
             <a class="link" href="remove.html#range.reference.algorithms.mutating.remove.complexity">Complexity</a>
           </h6>
 <p>
@@ -132,7 +132,7 @@
 </tr></table>
 <hr>
 <div class="spirit-nav">
-<a accesskey="p" href="random_shuffle.html"><img src="../../../../../../../../doc/html/images/prev.png" alt="Prev"></a><a accesskey="u" href="../mutating.html"><img src="../../../../../../../../doc/html/images/up.png" alt="Up"></a><a accesskey="h" href="../../../../index.html"><img src="../../../../../../../../doc/html/images/home.png" alt="Home"></a><a accesskey="n" href="remove_copy.html"><img src="../../../../../../../../doc/html/images/next.png" alt="Next"></a>
+<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>
 </body>
 </html>
diff --git a/doc/html/range/reference/algorithms/mutating/remove_copy.html b/doc/html/range/reference/algorithms/mutating/remove_copy.html
index b775716..c948593 100644
--- a/doc/html/range/reference/algorithms/mutating/remove_copy.html
+++ b/doc/html/range/reference/algorithms/mutating/remove_copy.html
@@ -2,8 +2,8 @@
 <head>
 <meta http-equiv="Content-Type" content="text/html; charset=US-ASCII">
 <title>remove_copy</title>
-<link rel="stylesheet" href="../../../../../../../../doc/html/boostbook.css" type="text/css">
-<meta name="generator" content="DocBook XSL Stylesheets V1.75.1">
+<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="../mutating.html" title="Mutating algorithms">
 <link rel="prev" href="remove.html" title="remove">
@@ -13,22 +13,22 @@
 <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="../../../../../../../libraries.htm">Libraries</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="remove.html"><img src="../../../../../../../../doc/html/images/prev.png" alt="Prev"></a><a accesskey="u" href="../mutating.html"><img src="../../../../../../../../doc/html/images/up.png" alt="Up"></a><a accesskey="h" href="../../../../index.html"><img src="../../../../../../../../doc/html/images/home.png" alt="Home"></a><a accesskey="n" href="remove_copy_if.html"><img src="../../../../../../../../doc/html/images/next.png" alt="Next"></a>
+<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" title="remove_copy">
+<div class="section">
 <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="id2734862"></a>
+<a name="id3309242"></a>
             <a class="link" href="remove_copy.html#range.reference.algorithms.mutating.remove_copy.prototype">Prototype</a>
           </h6>
 <p>
@@ -45,7 +45,7 @@
 <p>
           </p>
 <a name="range.reference.algorithms.mutating.remove_copy.description"></a><h6>
-<a name="id2735168"></a>
+<a name="id3309548"></a>
             <a class="link" href="remove_copy.html#range.reference.algorithms.mutating.remove_copy.description">Description</a>
           </h6>
 <p>
@@ -54,37 +54,37 @@
             <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="id2735257"></a>
+<a name="id3309638"></a>
             <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="id2735330"></a>
+<a name="id3309712"></a>
             <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">
-<code class="computeroutput"><span class="identifier">ForwardRange</span></code> is a model
-              of the <a class="link" href="../../../concepts/forward_range.html" title="Forward Range">Forward Range</a>
-              Concept.
-            </li>
+                <code class="computeroutput"><span class="identifier">ForwardRange</span></code> is a
+                model of the <a class="link" href="../../../concepts/forward_range.html" title="Forward Range">Forward
+                Range</a> Concept.
+              </li>
 <li class="listitem">
-<code class="computeroutput"><span class="identifier">ForwardRange</span></code> is mutable.
-            </li>
+                <code class="computeroutput"><span class="identifier">ForwardRange</span></code> is mutable.
+              </li>
 <li class="listitem">
-<code class="computeroutput"><span class="identifier">Value</span></code> is a model of
-              the <code class="computeroutput"><span class="identifier">EqualityComparableConcept</span></code>.
-            </li>
+                <code class="computeroutput"><span class="identifier">Value</span></code> is a model
+                of the <code class="computeroutput"><span class="identifier">EqualityComparableConcept</span></code>.
+              </li>
 <li class="listitem">
-              Objects of type <code class="computeroutput"><span class="identifier">Value</span></code>
-              can be compared for equality with objects of <code class="computeroutput"><span class="identifier">ForwardRange</span></code>'s
-              value type.
-            </li>
+                Objects of type <code class="computeroutput"><span class="identifier">Value</span></code>
+                can be compared for equality with objects of <code class="computeroutput"><span class="identifier">ForwardRange</span></code>'s
+                value type.
+              </li>
 </ul></div>
 <a name="range.reference.algorithms.mutating.remove_copy.complexity"></a><h6>
-<a name="id2735444"></a>
+<a name="id3309838"></a>
             <a class="link" href="remove_copy.html#range.reference.algorithms.mutating.remove_copy.complexity">Complexity</a>
           </h6>
 <p>
@@ -103,7 +103,7 @@
 </tr></table>
 <hr>
 <div class="spirit-nav">
-<a accesskey="p" href="remove.html"><img src="../../../../../../../../doc/html/images/prev.png" alt="Prev"></a><a accesskey="u" href="../mutating.html"><img src="../../../../../../../../doc/html/images/up.png" alt="Up"></a><a accesskey="h" href="../../../../index.html"><img src="../../../../../../../../doc/html/images/home.png" alt="Home"></a><a accesskey="n" href="remove_copy_if.html"><img src="../../../../../../../../doc/html/images/next.png" alt="Next"></a>
+<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>
 </body>
 </html>
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 3f25b68..d631aab 100644
--- a/doc/html/range/reference/algorithms/mutating/remove_copy_if.html
+++ b/doc/html/range/reference/algorithms/mutating/remove_copy_if.html
@@ -2,8 +2,8 @@
 <head>
 <meta http-equiv="Content-Type" content="text/html; charset=US-ASCII">
 <title>remove_copy_if</title>
-<link rel="stylesheet" href="../../../../../../../../doc/html/boostbook.css" type="text/css">
-<meta name="generator" content="DocBook XSL Stylesheets V1.75.1">
+<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="../mutating.html" title="Mutating algorithms">
 <link rel="prev" href="remove_copy.html" title="remove_copy">
@@ -13,22 +13,22 @@
 <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="../../../../../../../libraries.htm">Libraries</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="remove_copy.html"><img src="../../../../../../../../doc/html/images/prev.png" alt="Prev"></a><a accesskey="u" href="../mutating.html"><img src="../../../../../../../../doc/html/images/up.png" alt="Up"></a><a accesskey="h" href="../../../../index.html"><img src="../../../../../../../../doc/html/images/home.png" alt="Home"></a><a accesskey="n" href="remove_if.html"><img src="../../../../../../../../doc/html/images/next.png" alt="Next"></a>
+<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" title="remove_copy_if">
+<div class="section">
 <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="id2735525"></a>
+<a name="id3309919"></a>
             <a class="link" href="remove_copy_if.html#range.reference.algorithms.mutating.remove_copy_if.prototype">Prototype</a>
           </h6>
 <p>
@@ -45,7 +45,7 @@
 <p>
           </p>
 <a name="range.reference.algorithms.mutating.remove_copy_if.description"></a><h6>
-<a name="id2735810"></a>
+<a name="id3310205"></a>
             <a class="link" href="remove_copy_if.html#range.reference.algorithms.mutating.remove_copy_if.description">Description</a>
           </h6>
 <p>
@@ -55,32 +55,32 @@
             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="id2735904"></a>
+<a name="id3310298"></a>
             <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="id2735977"></a>
+<a name="id3310371"></a>
             <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">
-<code class="computeroutput"><span class="identifier">ForwardRange</span></code> is a model
-              of the <a class="link" href="../../../concepts/forward_range.html" title="Forward Range">Forward Range</a>
-              Concept.
-            </li>
+                <code class="computeroutput"><span class="identifier">ForwardRange</span></code> is a
+                model of the <a class="link" href="../../../concepts/forward_range.html" title="Forward Range">Forward
+                Range</a> Concept.
+              </li>
 <li class="listitem">
-<code class="computeroutput"><span class="identifier">ForwardRange</span></code> is mutable.
-            </li>
+                <code class="computeroutput"><span class="identifier">ForwardRange</span></code> is mutable.
+              </li>
 <li class="listitem">
-<code class="computeroutput"><span class="identifier">UnaryPred</span></code> is a model
-              of the <code class="computeroutput"><span class="identifier">UnaryPredicateConcept</span></code>.
-            </li>
+                <code class="computeroutput"><span class="identifier">UnaryPred</span></code> is a model
+                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="id2736066"></a>
+<a name="id3310469"></a>
             <a class="link" href="remove_copy_if.html#range.reference.algorithms.mutating.remove_copy_if.complexity">Complexity</a>
           </h6>
 <p>
@@ -98,7 +98,7 @@
 </tr></table>
 <hr>
 <div class="spirit-nav">
-<a accesskey="p" href="remove_copy.html"><img src="../../../../../../../../doc/html/images/prev.png" alt="Prev"></a><a accesskey="u" href="../mutating.html"><img src="../../../../../../../../doc/html/images/up.png" alt="Up"></a><a accesskey="h" href="../../../../index.html"><img src="../../../../../../../../doc/html/images/home.png" alt="Home"></a><a accesskey="n" href="remove_if.html"><img src="../../../../../../../../doc/html/images/next.png" alt="Next"></a>
+<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>
 </body>
 </html>
diff --git a/doc/html/range/reference/algorithms/mutating/remove_if.html b/doc/html/range/reference/algorithms/mutating/remove_if.html
index 95a933c..460b087 100644
--- a/doc/html/range/reference/algorithms/mutating/remove_if.html
+++ b/doc/html/range/reference/algorithms/mutating/remove_if.html
@@ -2,8 +2,8 @@
 <head>
 <meta http-equiv="Content-Type" content="text/html; charset=US-ASCII">
 <title>remove_if</title>
-<link rel="stylesheet" href="../../../../../../../../doc/html/boostbook.css" type="text/css">
-<meta name="generator" content="DocBook XSL Stylesheets V1.75.1">
+<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="../mutating.html" title="Mutating algorithms">
 <link rel="prev" href="remove_copy_if.html" title="remove_copy_if">
@@ -13,21 +13,21 @@
 <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="../../../../../../../libraries.htm">Libraries</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="remove_copy_if.html"><img src="../../../../../../../../doc/html/images/prev.png" alt="Prev"></a><a accesskey="u" href="../mutating.html"><img src="../../../../../../../../doc/html/images/up.png" alt="Up"></a><a accesskey="h" href="../../../../index.html"><img src="../../../../../../../../doc/html/images/home.png" alt="Home"></a><a accesskey="n" href="replace.html"><img src="../../../../../../../../doc/html/images/next.png" alt="Next"></a>
+<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" title="remove_if">
+<div class="section">
 <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="id2736144"></a>
+<a name="id3310547"></a>
             <a class="link" href="remove_if.html#range.reference.algorithms.mutating.remove_if.prototype">Prototype</a>
           </h6>
 <p>
@@ -66,7 +66,7 @@
 <p>
           </p>
 <a name="range.reference.algorithms.mutating.remove_if.description"></a><h6>
-<a name="id2736727"></a>
+<a name="id3311130"></a>
             <a class="link" href="remove_if.html#range.reference.algorithms.mutating.remove_if.description">Description</a>
           </h6>
 <p>
@@ -82,37 +82,37 @@
             are unspecified.
           </p>
 <a name="range.reference.algorithms.mutating.remove_if.definition"></a><h6>
-<a name="id2736957"></a>
+<a name="id3311360"></a>
             <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="id2737030"></a>
+<a name="id3311432"></a>
             <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">
-<code class="computeroutput"><span class="identifier">ForwardRange</span></code> is a model
-              of the <a class="link" href="../../../concepts/forward_range.html" title="Forward Range">Forward Range</a>
-              Concept.
-            </li>
+                <code class="computeroutput"><span class="identifier">ForwardRange</span></code> is a
+                model of the <a class="link" href="../../../concepts/forward_range.html" title="Forward Range">Forward
+                Range</a> Concept.
+              </li>
 <li class="listitem">
-<code class="computeroutput"><span class="identifier">ForwardRange</span></code> is mutable.
-            </li>
+                <code class="computeroutput"><span class="identifier">ForwardRange</span></code> is mutable.
+              </li>
 <li class="listitem">
-<code class="computeroutput"><span class="identifier">UnaryPredicate</span></code> is a
-              model of the <code class="computeroutput"><span class="identifier">PredicateConcept</span></code>.
-            </li>
+                <code class="computeroutput"><span class="identifier">UnaryPredicate</span></code> is
+                a model of the <code class="computeroutput"><span class="identifier">PredicateConcept</span></code>.
+              </li>
 <li class="listitem">
-<code class="computeroutput"><span class="identifier">ForwardRange</span></code>'s value
-              type is convertible to <code class="computeroutput"><span class="identifier">UnaryPredicate</span></code>'s
-              argument type.
-            </li>
+                <code class="computeroutput"><span class="identifier">ForwardRange</span></code>'s value
+                type is convertible to <code class="computeroutput"><span class="identifier">UnaryPredicate</span></code>'s
+                argument type.
+              </li>
 </ul></div>
 <a name="range.reference.algorithms.mutating.remove_if.complexity"></a><h6>
-<a name="id2737144"></a>
+<a name="id3311560"></a>
             <a class="link" href="remove_if.html#range.reference.algorithms.mutating.remove_if.complexity">Complexity</a>
           </h6>
 <p>
@@ -131,7 +131,7 @@
 </tr></table>
 <hr>
 <div class="spirit-nav">
-<a accesskey="p" href="remove_copy_if.html"><img src="../../../../../../../../doc/html/images/prev.png" alt="Prev"></a><a accesskey="u" href="../mutating.html"><img src="../../../../../../../../doc/html/images/up.png" alt="Up"></a><a accesskey="h" href="../../../../index.html"><img src="../../../../../../../../doc/html/images/home.png" alt="Home"></a><a accesskey="n" href="replace.html"><img src="../../../../../../../../doc/html/images/next.png" alt="Next"></a>
+<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>
 </body>
 </html>
diff --git a/doc/html/range/reference/algorithms/mutating/replace.html b/doc/html/range/reference/algorithms/mutating/replace.html
index abbffc3..efd4c78 100644
--- a/doc/html/range/reference/algorithms/mutating/replace.html
+++ b/doc/html/range/reference/algorithms/mutating/replace.html
@@ -2,8 +2,8 @@
 <head>
 <meta http-equiv="Content-Type" content="text/html; charset=US-ASCII">
 <title>replace</title>
-<link rel="stylesheet" href="../../../../../../../../doc/html/boostbook.css" type="text/css">
-<meta name="generator" content="DocBook XSL Stylesheets V1.75.1">
+<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="../mutating.html" title="Mutating algorithms">
 <link rel="prev" href="remove_if.html" title="remove_if">
@@ -13,21 +13,21 @@
 <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="../../../../../../../libraries.htm">Libraries</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="remove_if.html"><img src="../../../../../../../../doc/html/images/prev.png" alt="Prev"></a><a accesskey="u" href="../mutating.html"><img src="../../../../../../../../doc/html/images/up.png" alt="Up"></a><a accesskey="h" href="../../../../index.html"><img src="../../../../../../../../doc/html/images/home.png" alt="Home"></a><a accesskey="n" href="replace_copy.html"><img src="../../../../../../../../doc/html/images/next.png" alt="Next"></a>
+<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" title="replace">
+<div class="section">
 <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="id2737235"></a>
+<a name="id3311650"></a>
             <a class="link" href="replace.html#range.reference.algorithms.mutating.replace.prototype">Prototype</a>
           </h6>
 <p>
@@ -48,7 +48,7 @@
 <p>
           </p>
 <a name="range.reference.algorithms.mutating.replace.description"></a><h6>
-<a name="id2737550"></a>
+<a name="id3311965"></a>
             <a class="link" href="replace.html#range.reference.algorithms.mutating.replace.description">Description</a>
           </h6>
 <p>
@@ -57,43 +57,43 @@
             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="id2737629"></a>
+<a name="id3312045"></a>
             <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="id2737700"></a>
+<a name="id3312117"></a>
             <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">
-<code class="computeroutput"><span class="identifier">ForwardRange</span></code> is a model
-              of the <a class="link" href="../../../concepts/forward_range.html" title="Forward Range">Forward Range</a>
-              Concept.
-            </li>
+                <code class="computeroutput"><span class="identifier">ForwardRange</span></code> is a
+                model of the <a class="link" href="../../../concepts/forward_range.html" title="Forward Range">Forward
+                Range</a> Concept.
+              </li>
 <li class="listitem">
-<code class="computeroutput"><span class="identifier">ForwardRange</span></code> is mutable.
-            </li>
+                <code class="computeroutput"><span class="identifier">ForwardRange</span></code> is mutable.
+              </li>
 <li class="listitem">
-<code class="computeroutput"><span class="identifier">Value</span></code> is convertible
-              to <code class="computeroutput"><span class="identifier">ForwardRange</span></code>'s value
-              type.
-            </li>
+                <code class="computeroutput"><span class="identifier">Value</span></code> is convertible
+                to <code class="computeroutput"><span class="identifier">ForwardRange</span></code>'s
+                value type.
+              </li>
 <li class="listitem">
-<code class="computeroutput"><span class="identifier">Value</span></code> is a model of
-              the <code class="computeroutput"><span class="identifier">AssignableConcept</span></code>.
-            </li>
+                <code class="computeroutput"><span class="identifier">Value</span></code> is a model
+                of the <code class="computeroutput"><span class="identifier">AssignableConcept</span></code>.
+              </li>
 <li class="listitem">
-<code class="computeroutput"><span class="identifier">Value</span></code> is a model of
-              the <code class="computeroutput"><span class="identifier">EqualityComparableConcept</span></code>,
-              and may be compared for equality with objects of <code class="computeroutput"><span class="identifier">ForwardRange</span></code>'s
-              value type.
-            </li>
+                <code class="computeroutput"><span class="identifier">Value</span></code> is a model
+                of the <code class="computeroutput"><span class="identifier">EqualityComparableConcept</span></code>,
+                and may be compared for equality with objects of <code class="computeroutput"><span class="identifier">ForwardRange</span></code>'s
+                value type.
+              </li>
 </ul></div>
 <a name="range.reference.algorithms.mutating.replace.complexity"></a><h6>
-<a name="id2737851"></a>
+<a name="id3312284"></a>
             <a class="link" href="replace.html#range.reference.algorithms.mutating.replace.complexity">Complexity</a>
           </h6>
 <p>
@@ -112,7 +112,7 @@
 </tr></table>
 <hr>
 <div class="spirit-nav">
-<a accesskey="p" href="remove_if.html"><img src="../../../../../../../../doc/html/images/prev.png" alt="Prev"></a><a accesskey="u" href="../mutating.html"><img src="../../../../../../../../doc/html/images/up.png" alt="Up"></a><a accesskey="h" href="../../../../index.html"><img src="../../../../../../../../doc/html/images/home.png" alt="Home"></a><a accesskey="n" href="replace_copy.html"><img src="../../../../../../../../doc/html/images/next.png" alt="Next"></a>
+<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>
 </body>
 </html>
diff --git a/doc/html/range/reference/algorithms/mutating/replace_copy.html b/doc/html/range/reference/algorithms/mutating/replace_copy.html
index a5678bd..ccc4e22 100644
--- a/doc/html/range/reference/algorithms/mutating/replace_copy.html
+++ b/doc/html/range/reference/algorithms/mutating/replace_copy.html
@@ -2,8 +2,8 @@
 <head>
 <meta http-equiv="Content-Type" content="text/html; charset=US-ASCII">
 <title>replace_copy</title>
-<link rel="stylesheet" href="../../../../../../../../doc/html/boostbook.css" type="text/css">
-<meta name="generator" content="DocBook XSL Stylesheets V1.75.1">
+<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="../mutating.html" title="Mutating algorithms">
 <link rel="prev" href="replace.html" title="replace">
@@ -13,22 +13,22 @@
 <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="../../../../../../../libraries.htm">Libraries</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="replace.html"><img src="../../../../../../../../doc/html/images/prev.png" alt="Prev"></a><a accesskey="u" href="../mutating.html"><img src="../../../../../../../../doc/html/images/up.png" alt="Up"></a><a accesskey="h" href="../../../../index.html"><img src="../../../../../../../../doc/html/images/home.png" alt="Home"></a><a accesskey="n" href="replace_copy_if.html"><img src="../../../../../../../../doc/html/images/next.png" alt="Next"></a>
+<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" title="replace_copy">
+<div class="section">
 <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="id2737956"></a>
+<a name="id3312389"></a>
             <a class="link" href="replace_copy.html#range.reference.algorithms.mutating.replace_copy.prototype">Prototype</a>
           </h6>
 <p>
@@ -41,7 +41,7 @@
 <p>
           </p>
 <a name="range.reference.algorithms.mutating.replace_copy.description"></a><h6>
-<a name="id2738156"></a>
+<a name="id3312588"></a>
             <a class="link" href="replace_copy.html#range.reference.algorithms.mutating.replace_copy.description">Description</a>
           </h6>
 <p>
@@ -54,41 +54,41 @@
             <span class="identifier">x</span></code>.
           </p>
 <a name="range.reference.algorithms.mutating.replace_copy.definition"></a><h6>
-<a name="id2738270"></a>
+<a name="id3312702"></a>
             <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="id2738342"></a>
+<a name="id3312771"></a>
             <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">
-<code class="computeroutput"><span class="identifier">ForwardRange</span></code> is a model
-              of the <a class="link" href="../../../concepts/forward_range.html" title="Forward Range">Forward Range</a>
-              Concept.
-            </li>
+                <code class="computeroutput"><span class="identifier">ForwardRange</span></code> is a
+                model of the <a class="link" href="../../../concepts/forward_range.html" title="Forward Range">Forward
+                Range</a> Concept.
+              </li>
 <li class="listitem">
-<code class="computeroutput"><span class="identifier">ForwardRange</span></code> is mutable.
-            </li>
+                <code class="computeroutput"><span class="identifier">ForwardRange</span></code> is mutable.
+              </li>
 <li class="listitem">
-<code class="computeroutput"><span class="identifier">Value</span></code> is convertible
-              to <code class="computeroutput"><span class="identifier">ForwardRange</span></code>'s value
-              type.
-            </li>
+                <code class="computeroutput"><span class="identifier">Value</span></code> is convertible
+                to <code class="computeroutput"><span class="identifier">ForwardRange</span></code>'s
+                value type.
+              </li>
 <li class="listitem">
-<code class="computeroutput"><span class="identifier">Value</span></code> is a model of
-              the <code class="computeroutput"><span class="identifier">AssignableConcept</span></code>.
-            </li>
+                <code class="computeroutput"><span class="identifier">Value</span></code> is a model
+                of the <code class="computeroutput"><span class="identifier">AssignableConcept</span></code>.
+              </li>
 <li class="listitem">
-<code class="computeroutput"><span class="identifier">OutputIterator</span></code> is a
-              model of the <code class="computeroutput"><span class="identifier">OutputIteratorConcept</span></code>.
-            </li>
+                <code class="computeroutput"><span class="identifier">OutputIterator</span></code> is
+                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="id2738482"></a>
+<a name="id3312931"></a>
             <a class="link" href="replace_copy.html#range.reference.algorithms.mutating.replace_copy.complexity">Complexity</a>
           </h6>
 <p>
@@ -106,7 +106,7 @@
 </tr></table>
 <hr>
 <div class="spirit-nav">
-<a accesskey="p" href="replace.html"><img src="../../../../../../../../doc/html/images/prev.png" alt="Prev"></a><a accesskey="u" href="../mutating.html"><img src="../../../../../../../../doc/html/images/up.png" alt="Up"></a><a accesskey="h" href="../../../../index.html"><img src="../../../../../../../../doc/html/images/home.png" alt="Home"></a><a accesskey="n" href="replace_copy_if.html"><img src="../../../../../../../../doc/html/images/next.png" alt="Next"></a>
+<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>
 </body>
 </html>
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 17607de..60f4f9c 100644
--- a/doc/html/range/reference/algorithms/mutating/replace_copy_if.html
+++ b/doc/html/range/reference/algorithms/mutating/replace_copy_if.html
@@ -2,8 +2,8 @@
 <head>
 <meta http-equiv="Content-Type" content="text/html; charset=US-ASCII">
 <title>replace_copy_if</title>
-<link rel="stylesheet" href="../../../../../../../../doc/html/boostbook.css" type="text/css">
-<meta name="generator" content="DocBook XSL Stylesheets V1.75.1">
+<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="../mutating.html" title="Mutating algorithms">
 <link rel="prev" href="replace_copy.html" title="replace_copy">
@@ -13,22 +13,22 @@
 <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="../../../../../../../libraries.htm">Libraries</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="replace_copy.html"><img src="../../../../../../../../doc/html/images/prev.png" alt="Prev"></a><a accesskey="u" href="../mutating.html"><img src="../../../../../../../../doc/html/images/up.png" alt="Up"></a><a accesskey="h" href="../../../../index.html"><img src="../../../../../../../../doc/html/images/home.png" alt="Home"></a><a accesskey="n" href="replace_if.html"><img src="../../../../../../../../doc/html/images/next.png" alt="Next"></a>
+<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" title="replace_copy_if">
+<div class="section">
 <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="id2738563"></a>
+<a name="id3313012"></a>
             <a class="link" href="replace_copy_if.html#range.reference.algorithms.mutating.replace_copy_if.prototype">Prototype</a>
           </h6>
 <p>
@@ -41,7 +41,7 @@
 <p>
           </p>
 <a name="range.reference.algorithms.mutating.replace_copy_if.description"></a><h6>
-<a name="id2738767"></a>
+<a name="id3313216"></a>
             <a class="link" href="replace_copy_if.html#range.reference.algorithms.mutating.replace_copy_if.description">Description</a>
           </h6>
 <p>
@@ -52,45 +52,45 @@
             <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="id2738883"></a>
+<a name="id3313332"></a>
             <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="id2738957"></a>
+<a name="id3313406"></a>
             <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">
-<code class="computeroutput"><span class="identifier">ForwardRange</span></code> is a model
-              of the <a class="link" href="../../../concepts/forward_range.html" title="Forward Range">Forward Range</a>
-              Concept.
-            </li>
+                <code class="computeroutput"><span class="identifier">ForwardRange</span></code> is a
+                model of the <a class="link" href="../../../concepts/forward_range.html" title="Forward Range">Forward
+                Range</a> Concept.
+              </li>
 <li class="listitem">
-<code class="computeroutput"><span class="identifier">ForwardRange</span></code> is mutable.
-            </li>
+                <code class="computeroutput"><span class="identifier">ForwardRange</span></code> is mutable.
+              </li>
 <li class="listitem">
-<code class="computeroutput"><span class="identifier">Value</span></code> is convertible
-              to <code class="computeroutput"><span class="identifier">ForwardRange</span></code>'s value
-              type.
-            </li>
+                <code class="computeroutput"><span class="identifier">Value</span></code> is convertible
+                to <code class="computeroutput"><span class="identifier">ForwardRange</span></code>'s
+                value type.
+              </li>
 <li class="listitem">
-<code class="computeroutput"><span class="identifier">Value</span></code> is a model of
-              the <code class="computeroutput"><span class="identifier">AssignableConcept</span></code>.
-            </li>
+                <code class="computeroutput"><span class="identifier">Value</span></code> is a model
+                of the <code class="computeroutput"><span class="identifier">AssignableConcept</span></code>.
+              </li>
 <li class="listitem">
-<code class="computeroutput"><span class="identifier">OutputIterator</span></code> is a
-              model of the <code class="computeroutput"><span class="identifier">OutputIteratorConcept</span></code>.
-            </li>
+                <code class="computeroutput"><span class="identifier">OutputIterator</span></code> is
+                a model of the <code class="computeroutput"><span class="identifier">OutputIteratorConcept</span></code>.
+              </li>
 <li class="listitem">
-<code class="computeroutput"><span class="identifier">UnaryPredicate</span></code> is a
-              model of the <code class="computeroutput"><span class="identifier">UnaryPredicateConcept</span></code>.
-            </li>
+                <code class="computeroutput"><span class="identifier">UnaryPredicate</span></code> is
+                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="id2739123"></a>
+<a name="id3313592"></a>
             <a class="link" href="replace_copy_if.html#range.reference.algorithms.mutating.replace_copy_if.complexity">Complexity</a>
           </h6>
 <p>
@@ -108,7 +108,7 @@
 </tr></table>
 <hr>
 <div class="spirit-nav">
-<a accesskey="p" href="replace_copy.html"><img src="../../../../../../../../doc/html/images/prev.png" alt="Prev"></a><a accesskey="u" href="../mutating.html"><img src="../../../../../../../../doc/html/images/up.png" alt="Up"></a><a accesskey="h" href="../../../../index.html"><img src="../../../../../../../../doc/html/images/home.png" alt="Home"></a><a accesskey="n" href="replace_if.html"><img src="../../../../../../../../doc/html/images/next.png" alt="Next"></a>
+<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>
 </body>
 </html>
diff --git a/doc/html/range/reference/algorithms/mutating/replace_if.html b/doc/html/range/reference/algorithms/mutating/replace_if.html
index 110c753..293ae92 100644
--- a/doc/html/range/reference/algorithms/mutating/replace_if.html
+++ b/doc/html/range/reference/algorithms/mutating/replace_if.html
@@ -2,8 +2,8 @@
 <head>
 <meta http-equiv="Content-Type" content="text/html; charset=US-ASCII">
 <title>replace_if</title>
-<link rel="stylesheet" href="../../../../../../../../doc/html/boostbook.css" type="text/css">
-<meta name="generator" content="DocBook XSL Stylesheets V1.75.1">
+<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="../mutating.html" title="Mutating algorithms">
 <link rel="prev" href="replace_copy_if.html" title="replace_copy_if">
@@ -13,22 +13,22 @@
 <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="../../../../../../../libraries.htm">Libraries</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="replace_copy_if.html"><img src="../../../../../../../../doc/html/images/prev.png" alt="Prev"></a><a accesskey="u" href="../mutating.html"><img src="../../../../../../../../doc/html/images/up.png" alt="Up"></a><a accesskey="h" href="../../../../index.html"><img src="../../../../../../../../doc/html/images/home.png" alt="Home"></a><a accesskey="n" href="reverse.html"><img src="../../../../../../../../doc/html/images/next.png" alt="Next"></a>
+<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" title="replace_if">
+<div class="section">
 <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="id2739213"></a>
+<a name="id3313682"></a>
             <a class="link" href="replace_if.html#range.reference.algorithms.mutating.replace_if.prototype">Prototype</a>
           </h6>
 <p>
@@ -43,7 +43,7 @@
 <p>
           </p>
 <a name="range.reference.algorithms.mutating.replace_if.description"></a><h6>
-<a name="id2739536"></a>
+<a name="id3314004"></a>
             <a class="link" href="replace_if.html#range.reference.algorithms.mutating.replace_if.description">Description</a>
           </h6>
 <p>
@@ -52,46 +52,46 @@
             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="id2739650"></a>
+<a name="id3314119"></a>
             <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="id2739722"></a>
+<a name="id3314191"></a>
             <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">
-<code class="computeroutput"><span class="identifier">ForwardRange</span></code> is a model
-              of the <a class="link" href="../../../concepts/forward_range.html" title="Forward Range">Forward Range</a>
-              Concept.
-            </li>
+                <code class="computeroutput"><span class="identifier">ForwardRange</span></code> is a
+                model of the <a class="link" href="../../../concepts/forward_range.html" title="Forward Range">Forward
+                Range</a> Concept.
+              </li>
 <li class="listitem">
-<code class="computeroutput"><span class="identifier">ForwardRange</span></code> is mutable.
-            </li>
+                <code class="computeroutput"><span class="identifier">ForwardRange</span></code> is mutable.
+              </li>
 <li class="listitem">
-<code class="computeroutput"><span class="identifier">UnaryPredicate</span></code> is a
-              model of the <code class="computeroutput"><span class="identifier">PredicateConcept</span></code>
-</li>
+                <code class="computeroutput"><span class="identifier">UnaryPredicate</span></code> is
+                a model of the <code class="computeroutput"><span class="identifier">PredicateConcept</span></code>
+              </li>
 <li class="listitem">
-<code class="computeroutput"><span class="identifier">ForwardRange</span></code>'s value
-              type is convertible to <code class="computeroutput"><span class="identifier">UnaryPredicate</span></code>'s
-              argument type.
-            </li>
+                <code class="computeroutput"><span class="identifier">ForwardRange</span></code>'s value
+                type is convertible to <code class="computeroutput"><span class="identifier">UnaryPredicate</span></code>'s
+                argument type.
+              </li>
 <li class="listitem">
-<code class="computeroutput"><span class="identifier">Value</span></code> is convertible
-              to <code class="computeroutput"><span class="identifier">ForwardRange</span></code>'s value
-              type.
-            </li>
+                <code class="computeroutput"><span class="identifier">Value</span></code> is convertible
+                to <code class="computeroutput"><span class="identifier">ForwardRange</span></code>'s
+                value type.
+              </li>
 <li class="listitem">
-<code class="computeroutput"><span class="identifier">Value</span></code> is a model of
-              the <code class="computeroutput"><span class="identifier">AssignableConcept</span></code>.
-            </li>
+                <code class="computeroutput"><span class="identifier">Value</span></code> is a model
+                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="id2739888"></a>
+<a name="id3314376"></a>
             <a class="link" href="replace_if.html#range.reference.algorithms.mutating.replace_if.complexity">Complexity</a>
           </h6>
 <p>
@@ -111,7 +111,7 @@
 </tr></table>
 <hr>
 <div class="spirit-nav">
-<a accesskey="p" href="replace_copy_if.html"><img src="../../../../../../../../doc/html/images/prev.png" alt="Prev"></a><a accesskey="u" href="../mutating.html"><img src="../../../../../../../../doc/html/images/up.png" alt="Up"></a><a accesskey="h" href="../../../../index.html"><img src="../../../../../../../../doc/html/images/home.png" alt="Home"></a><a accesskey="n" href="reverse.html"><img src="../../../../../../../../doc/html/images/next.png" alt="Next"></a>
+<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>
 </body>
 </html>
diff --git a/doc/html/range/reference/algorithms/mutating/reverse.html b/doc/html/range/reference/algorithms/mutating/reverse.html
index 0ae4ef5..253d901 100644
--- a/doc/html/range/reference/algorithms/mutating/reverse.html
+++ b/doc/html/range/reference/algorithms/mutating/reverse.html
@@ -2,8 +2,8 @@
 <head>
 <meta http-equiv="Content-Type" content="text/html; charset=US-ASCII">
 <title>reverse</title>
-<link rel="stylesheet" href="../../../../../../../../doc/html/boostbook.css" type="text/css">
-<meta name="generator" content="DocBook XSL Stylesheets V1.75.1">
+<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="../mutating.html" title="Mutating algorithms">
 <link rel="prev" href="replace_if.html" title="replace_if">
@@ -13,21 +13,21 @@
 <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="../../../../../../../libraries.htm">Libraries</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="replace_if.html"><img src="../../../../../../../../doc/html/images/prev.png" alt="Prev"></a><a accesskey="u" href="../mutating.html"><img src="../../../../../../../../doc/html/images/up.png" alt="Up"></a><a accesskey="h" href="../../../../index.html"><img src="../../../../../../../../doc/html/images/home.png" alt="Home"></a><a accesskey="n" href="reverse_copy.html"><img src="../../../../../../../../doc/html/images/next.png" alt="Next"></a>
+<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" title="reverse">
+<div class="section">
 <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="id2740001"></a>
+<a name="id3314490"></a>
             <a class="link" href="reverse.html#range.reference.algorithms.mutating.reverse.prototype">Prototype</a>
           </h6>
 <p>
@@ -42,7 +42,7 @@
 <p>
           </p>
 <a name="range.reference.algorithms.mutating.reverse.description"></a><h6>
-<a name="id2740175"></a>
+<a name="id3314664"></a>
             <a class="link" href="reverse.html#range.reference.algorithms.mutating.reverse.description">Description</a>
           </h6>
 <p>
@@ -50,29 +50,29 @@
             Returns a reference to the reversed range.
           </p>
 <a name="range.reference.algorithms.mutating.reverse.definition"></a><h6>
-<a name="id2740213"></a>
+<a name="id3314702"></a>
             <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="id2740286"></a>
+<a name="id3314774"></a>
             <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">
-<code class="computeroutput"><span class="identifier">BidirectionalRange</span></code>
-              is a model of the <a class="link" href="../../../concepts/bidirectional_range.html" title="Bidirectional Range">Bidirectional
-              Range</a> Concept.
-            </li>
+                <code class="computeroutput"><span class="identifier">BidirectionalRange</span></code>
+                is a model of the <a class="link" href="../../../concepts/bidirectional_range.html" title="Bidirectional Range">Bidirectional
+                Range</a> Concept.
+              </li>
 <li class="listitem">
-<code class="computeroutput"><span class="identifier">BidirectionalRange</span></code>
-              is mutable.
-            </li>
+                <code class="computeroutput"><span class="identifier">BidirectionalRange</span></code>
+                is mutable.
+              </li>
 </ul></div>
 <a name="range.reference.algorithms.mutating.reverse.complexity"></a><h6>
-<a name="id2740348"></a>
+<a name="id3314843"></a>
             <a class="link" href="reverse.html#range.reference.algorithms.mutating.reverse.complexity">Complexity</a>
           </h6>
 <p>
@@ -90,7 +90,7 @@
 </tr></table>
 <hr>
 <div class="spirit-nav">
-<a accesskey="p" href="replace_if.html"><img src="../../../../../../../../doc/html/images/prev.png" alt="Prev"></a><a accesskey="u" href="../mutating.html"><img src="../../../../../../../../doc/html/images/up.png" alt="Up"></a><a accesskey="h" href="../../../../index.html"><img src="../../../../../../../../doc/html/images/home.png" alt="Home"></a><a accesskey="n" href="reverse_copy.html"><img src="../../../../../../../../doc/html/images/next.png" alt="Next"></a>
+<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>
 </body>
 </html>
diff --git a/doc/html/range/reference/algorithms/mutating/reverse_copy.html b/doc/html/range/reference/algorithms/mutating/reverse_copy.html
index 34a4b9a..4795437 100644
--- a/doc/html/range/reference/algorithms/mutating/reverse_copy.html
+++ b/doc/html/range/reference/algorithms/mutating/reverse_copy.html
@@ -2,8 +2,8 @@
 <head>
 <meta http-equiv="Content-Type" content="text/html; charset=US-ASCII">
 <title>reverse_copy</title>
-<link rel="stylesheet" href="../../../../../../../../doc/html/boostbook.css" type="text/css">
-<meta name="generator" content="DocBook XSL Stylesheets V1.75.1">
+<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="../mutating.html" title="Mutating algorithms">
 <link rel="prev" href="reverse.html" title="reverse">
@@ -13,22 +13,22 @@
 <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="../../../../../../../libraries.htm">Libraries</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="reverse.html"><img src="../../../../../../../../doc/html/images/prev.png" alt="Prev"></a><a accesskey="u" href="../mutating.html"><img src="../../../../../../../../doc/html/images/up.png" alt="Up"></a><a accesskey="h" href="../../../../index.html"><img src="../../../../../../../../doc/html/images/home.png" alt="Home"></a><a accesskey="n" href="rotate.html"><img src="../../../../../../../../doc/html/images/next.png" alt="Next"></a>
+<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" title="reverse_copy">
+<div class="section">
 <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="id2740444"></a>
+<a name="id3314939"></a>
             <a class="link" href="reverse_copy.html#range.reference.algorithms.mutating.reverse_copy.prototype">Prototype</a>
           </h6>
 <p>
@@ -40,7 +40,7 @@
 <p>
           </p>
 <a name="range.reference.algorithms.mutating.reverse_copy.description"></a><h6>
-<a name="id2740575"></a>
+<a name="id3315069"></a>
             <a class="link" href="reverse_copy.html#range.reference.algorithms.mutating.reverse_copy.description">Description</a>
           </h6>
 <p>
@@ -50,33 +50,33 @@
             Returns the output iterator one passed the last copied element.
           </p>
 <a name="range.reference.algorithms.mutating.reverse_copy.definition"></a><h6>
-<a name="id2740635"></a>
+<a name="id3315129"></a>
             <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="id2740708"></a>
+<a name="id3315202"></a>
             <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">
-<code class="computeroutput"><span class="identifier">BidirectionalRange</span></code>
-              is a model of the <a class="link" href="../../../concepts/bidirectional_range.html" title="Bidirectional Range">Bidirectional
-              Range</a> Concept.
-            </li>
+                <code class="computeroutput"><span class="identifier">BidirectionalRange</span></code>
+                is a model of the <a class="link" href="../../../concepts/bidirectional_range.html" title="Bidirectional Range">Bidirectional
+                Range</a> Concept.
+              </li>
 <li class="listitem">
-<code class="computeroutput"><span class="identifier">BidirectionalRange</span></code>
-              is mutable.
-            </li>
+                <code class="computeroutput"><span class="identifier">BidirectionalRange</span></code>
+                is mutable.
+              </li>
 <li class="listitem">
-<code class="computeroutput"><span class="identifier">OutputIterator</span></code> is a
-              model of the <code class="computeroutput"><span class="identifier">OutputIteratorConcept</span></code>.
-            </li>
+                <code class="computeroutput"><span class="identifier">OutputIterator</span></code> is
+                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="id2740796"></a>
+<a name="id3315300"></a>
             <a class="link" href="reverse_copy.html#range.reference.algorithms.mutating.reverse_copy.complexity">Complexity</a>
           </h6>
 <p>
@@ -95,7 +95,7 @@
 </tr></table>
 <hr>
 <div class="spirit-nav">
-<a accesskey="p" href="reverse.html"><img src="../../../../../../../../doc/html/images/prev.png" alt="Prev"></a><a accesskey="u" href="../mutating.html"><img src="../../../../../../../../doc/html/images/up.png" alt="Up"></a><a accesskey="h" href="../../../../index.html"><img src="../../../../../../../../doc/html/images/home.png" alt="Home"></a><a accesskey="n" href="rotate.html"><img src="../../../../../../../../doc/html/images/next.png" alt="Next"></a>
+<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>
 </body>
 </html>
diff --git a/doc/html/range/reference/algorithms/mutating/rotate.html b/doc/html/range/reference/algorithms/mutating/rotate.html
index b0dc3e4..9e7cbb4 100644
--- a/doc/html/range/reference/algorithms/mutating/rotate.html
+++ b/doc/html/range/reference/algorithms/mutating/rotate.html
@@ -2,8 +2,8 @@
 <head>
 <meta http-equiv="Content-Type" content="text/html; charset=US-ASCII">
 <title>rotate</title>
-<link rel="stylesheet" href="../../../../../../../../doc/html/boostbook.css" type="text/css">
-<meta name="generator" content="DocBook XSL Stylesheets V1.75.1">
+<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="../mutating.html" title="Mutating algorithms">
 <link rel="prev" href="reverse_copy.html" title="reverse_copy">
@@ -13,21 +13,21 @@
 <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="../../../../../../../libraries.htm">Libraries</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="reverse_copy.html"><img src="../../../../../../../../doc/html/images/prev.png" alt="Prev"></a><a accesskey="u" href="../mutating.html"><img src="../../../../../../../../doc/html/images/up.png" alt="Up"></a><a accesskey="h" href="../../../../index.html"><img src="../../../../../../../../doc/html/images/home.png" alt="Home"></a><a accesskey="n" href="rotate_copy.html"><img src="../../../../../../../../doc/html/images/next.png" alt="Next"></a>
+<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" title="rotate">
+<div class="section">
 <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="id2740874"></a>
+<a name="id3315378"></a>
             <a class="link" href="rotate.html#range.reference.algorithms.mutating.rotate.prototype">Prototype</a>
           </h6>
 <p>
@@ -44,7 +44,7 @@
 <p>
           </p>
 <a name="range.reference.algorithms.mutating.rotate.description"></a><h6>
-<a name="id2741135"></a>
+<a name="id3315639"></a>
             <a class="link" href="rotate.html#range.reference.algorithms.mutating.rotate.description">Description</a>
           </h6>
 <p>
@@ -53,40 +53,40 @@
             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="id2741260"></a>
+<a name="id3315764"></a>
             <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="id2741334"></a>
+<a name="id3315837"></a>
             <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">
-<code class="computeroutput"><span class="identifier">ForwardRange</span></code> is a model
-              of the <a class="link" href="../../../concepts/forward_range.html" title="Forward Range">Forward Range</a>
-              Concept.
-            </li>
+                <code class="computeroutput"><span class="identifier">ForwardRange</span></code> is a
+                model of the <a class="link" href="../../../concepts/forward_range.html" title="Forward Range">Forward
+                Range</a> Concept.
+              </li>
 <li class="listitem">
-<code class="computeroutput"><span class="identifier">ForwardRange</span></code> is mutable.
-            </li>
+                <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="id2741396"></a>
+<a name="id3315906"></a>
             <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">
-<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> is a valid range.
-            </li>
+                <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> is a valid range.
+              </li>
 <li class="listitem">
-<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>
+                <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="id2741506"></a>
+<a name="id3316023"></a>
             <a class="link" href="rotate.html#range.reference.algorithms.mutating.rotate.complexity">Complexity</a>
           </h6>
 <p>
@@ -103,7 +103,7 @@
 </tr></table>
 <hr>
 <div class="spirit-nav">
-<a accesskey="p" href="reverse_copy.html"><img src="../../../../../../../../doc/html/images/prev.png" alt="Prev"></a><a accesskey="u" href="../mutating.html"><img src="../../../../../../../../doc/html/images/up.png" alt="Up"></a><a accesskey="h" href="../../../../index.html"><img src="../../../../../../../../doc/html/images/home.png" alt="Home"></a><a accesskey="n" href="rotate_copy.html"><img src="../../../../../../../../doc/html/images/next.png" alt="Next"></a>
+<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>
 </body>
 </html>
diff --git a/doc/html/range/reference/algorithms/mutating/rotate_copy.html b/doc/html/range/reference/algorithms/mutating/rotate_copy.html
index 293f540..53643bd 100644
--- a/doc/html/range/reference/algorithms/mutating/rotate_copy.html
+++ b/doc/html/range/reference/algorithms/mutating/rotate_copy.html
@@ -2,8 +2,8 @@
 <head>
 <meta http-equiv="Content-Type" content="text/html; charset=US-ASCII">
 <title>rotate_copy</title>
-<link rel="stylesheet" href="../../../../../../../../doc/html/boostbook.css" type="text/css">
-<meta name="generator" content="DocBook XSL Stylesheets V1.75.1">
+<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="../mutating.html" title="Mutating algorithms">
 <link rel="prev" href="rotate.html" title="rotate">
@@ -13,22 +13,22 @@
 <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="../../../../../../../libraries.htm">Libraries</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="rotate.html"><img src="../../../../../../../../doc/html/images/prev.png" alt="Prev"></a><a accesskey="u" href="../mutating.html"><img src="../../../../../../../../doc/html/images/up.png" alt="Up"></a><a accesskey="h" href="../../../../index.html"><img src="../../../../../../../../doc/html/images/home.png" alt="Home"></a><a accesskey="n" href="sort.html"><img src="../../../../../../../../doc/html/images/next.png" alt="Next"></a>
+<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" title="rotate_copy">
+<div class="section">
 <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="id2741574"></a>
+<a name="id3316091"></a>
             <a class="link" href="rotate_copy.html#range.reference.algorithms.mutating.rotate_copy.prototype">Prototype</a>
           </h6>
 <p>
@@ -43,7 +43,7 @@
 <p>
           </p>
 <a name="range.reference.algorithms.mutating.rotate_copy.description"></a><h6>
-<a name="id2741745"></a>
+<a name="id3316262"></a>
             <a class="link" href="rotate_copy.html#range.reference.algorithms.mutating.rotate_copy.description">Description</a>
           </h6>
 <p>
@@ -52,44 +52,44 @@
             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="id2741870"></a>
+<a name="id3316386"></a>
             <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="id2741943"></a>
+<a name="id3316460"></a>
             <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">
-<code class="computeroutput"><span class="identifier">ForwardRange</span></code> is a model
-              of the <a class="link" href="../../../concepts/forward_range.html" title="Forward Range">Forward Range</a>
-              Concept.
-            </li>
+                <code class="computeroutput"><span class="identifier">ForwardRange</span></code> is a
+                model of the <a class="link" href="../../../concepts/forward_range.html" title="Forward Range">Forward
+                Range</a> Concept.
+              </li>
 <li class="listitem">
-<code class="computeroutput"><span class="identifier">ForwardRange</span></code> is mutable.
-            </li>
+                <code class="computeroutput"><span class="identifier">ForwardRange</span></code> is mutable.
+              </li>
 <li class="listitem">
-<code class="computeroutput"><span class="identifier">OutputIterator</span></code> is a
-              model of the <code class="computeroutput"><span class="identifier">OutputIteratorConcept</span></code>.
-            </li>
+                <code class="computeroutput"><span class="identifier">OutputIterator</span></code> is
+                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="id2742032"></a>
+<a name="id3316558"></a>
             <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">
-<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> is a valid range.
-            </li>
+                <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> is a valid range.
+              </li>
 <li class="listitem">
-<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>
+                <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="id2742141"></a>
+<a name="id3316674"></a>
             <a class="link" href="rotate_copy.html#range.reference.algorithms.mutating.rotate_copy.complexity">Complexity</a>
           </h6>
 <p>
@@ -106,7 +106,7 @@
 </tr></table>
 <hr>
 <div class="spirit-nav">
-<a accesskey="p" href="rotate.html"><img src="../../../../../../../../doc/html/images/prev.png" alt="Prev"></a><a accesskey="u" href="../mutating.html"><img src="../../../../../../../../doc/html/images/up.png" alt="Up"></a><a accesskey="h" href="../../../../index.html"><img src="../../../../../../../../doc/html/images/home.png" alt="Home"></a><a accesskey="n" href="sort.html"><img src="../../../../../../../../doc/html/images/next.png" alt="Next"></a>
+<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>
 </body>
 </html>
diff --git a/doc/html/range/reference/algorithms/mutating/sort.html b/doc/html/range/reference/algorithms/mutating/sort.html
index ffa09ad..fa727b8 100644
--- a/doc/html/range/reference/algorithms/mutating/sort.html
+++ b/doc/html/range/reference/algorithms/mutating/sort.html
@@ -2,8 +2,8 @@
 <head>
 <meta http-equiv="Content-Type" content="text/html; charset=US-ASCII">
 <title>sort</title>
-<link rel="stylesheet" href="../../../../../../../../doc/html/boostbook.css" type="text/css">
-<meta name="generator" content="DocBook XSL Stylesheets V1.75.1">
+<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="../mutating.html" title="Mutating algorithms">
 <link rel="prev" href="rotate_copy.html" title="rotate_copy">
@@ -13,21 +13,21 @@
 <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="../../../../../../../libraries.htm">Libraries</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="rotate_copy.html"><img src="../../../../../../../../doc/html/images/prev.png" alt="Prev"></a><a accesskey="u" href="../mutating.html"><img src="../../../../../../../../doc/html/images/up.png" alt="Up"></a><a accesskey="h" href="../../../../index.html"><img src="../../../../../../../../doc/html/images/home.png" alt="Home"></a><a accesskey="n" href="stable_partition.html"><img src="../../../../../../../../doc/html/images/next.png" alt="Next"></a>
+<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" title="sort">
+<div class="section">
 <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="id2742208"></a>
+<a name="id3316742"></a>
             <a class="link" href="sort.html#range.reference.algorithms.mutating.sort.prototype">Prototype</a>
           </h6>
 <p>
@@ -48,7 +48,7 @@
 <p>
           </p>
 <a name="range.reference.algorithms.mutating.sort.description"></a><h6>
-<a name="id2742588"></a>
+<a name="id3317122"></a>
             <a class="link" href="sort.html#range.reference.algorithms.mutating.sort.description">Description</a>
           </h6>
 <p>
@@ -71,14 +71,14 @@
             <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="id2742842"></a>
+<a name="id3317374"></a>
             <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="id2742913"></a>
+<a name="id3317446"></a>
             <a class="link" href="sort.html#range.reference.algorithms.mutating.sort.requirements">Requirements</a>
           </h6>
 <p>
@@ -86,50 +86,50 @@
           </p>
 <div class="itemizedlist"><ul class="itemizedlist" type="disc">
 <li class="listitem">
-<code class="computeroutput"><span class="identifier">RandomAccessRange</span></code> is
-              a model of the <a class="link" href="../../../concepts/random_access_range.html" title="Random Access Range">Random
-              Access Range</a> Concept.
-            </li>
+                <code class="computeroutput"><span class="identifier">RandomAccessRange</span></code>
+                is a model of the <a class="link" href="../../../concepts/random_access_range.html" title="Random Access Range">Random
+                Access Range</a> Concept.
+              </li>
 <li class="listitem">
-<code class="computeroutput"><span class="identifier">RandomAccessRange</span></code> is
-              mutable.
-            </li>
+                <code class="computeroutput"><span class="identifier">RandomAccessRange</span></code>
+                is mutable.
+              </li>
 <li class="listitem">
-<code class="computeroutput"><span class="identifier">RandomAccessRange</span></code>'s
-              value type is a model of the <code class="computeroutput"><span class="identifier">LessThanComparableConcept</span></code>.
-            </li>
+                <code class="computeroutput"><span class="identifier">RandomAccessRange</span></code>'s
+                value type is a model of the <code class="computeroutput"><span class="identifier">LessThanComparableConcept</span></code>.
+              </li>
 <li class="listitem">
-              The ordering relation on <code class="computeroutput"><span class="identifier">RandomAccessRange</span></code>'s
-              value type is a <span class="bold"><strong>strict weak ordering</strong></span>,
-              as defined in the <code class="computeroutput"><span class="identifier">LessThanComparableConcept</span></code>
-              requirements.
-            </li>
+                The ordering relation on <code class="computeroutput"><span class="identifier">RandomAccessRange</span></code>'s
+                value type is a <span class="bold"><strong>strict weak ordering</strong></span>,
+                as defined in the <code class="computeroutput"><span class="identifier">LessThanComparableConcept</span></code>
+                requirements.
+              </li>
 </ul></div>
 <p>
             <span class="bold"><strong>For versions of sort with a predicate</strong></span>
           </p>
 <div class="itemizedlist"><ul class="itemizedlist" type="disc">
 <li class="listitem">
-<code class="computeroutput"><span class="identifier">RandomAccessRange</span></code> is
-              a model of the <a class="link" href="../../../concepts/random_access_range.html" title="Random Access Range">Random
-              Access Range</a> Concept.
-            </li>
+                <code class="computeroutput"><span class="identifier">RandomAccessRange</span></code>
+                is a model of the <a class="link" href="../../../concepts/random_access_range.html" title="Random Access Range">Random
+                Access Range</a> Concept.
+              </li>
 <li class="listitem">
-<code class="computeroutput"><span class="identifier">RandomAccessRange</span></code> is
-              mutable.
-            </li>
+                <code class="computeroutput"><span class="identifier">RandomAccessRange</span></code>
+                is mutable.
+              </li>
 <li class="listitem">
-<code class="computeroutput"><span class="identifier">BinaryPredicate</span></code> is
-              a model of the <code class="computeroutput"><span class="identifier">StrictWeakOrderingConcept</span></code>.
-            </li>
+                <code class="computeroutput"><span class="identifier">BinaryPredicate</span></code> is
+                a model of the <code class="computeroutput"><span class="identifier">StrictWeakOrderingConcept</span></code>.
+              </li>
 <li class="listitem">
-<code class="computeroutput"><span class="identifier">RandomAccessRange</span></code>'s
-              value type is convertible to both of <code class="computeroutput"><span class="identifier">BinaryPredicate</span></code>'s
-              argument types.
-            </li>
+                <code class="computeroutput"><span class="identifier">RandomAccessRange</span></code>'s
+                value type is convertible to both of <code class="computeroutput"><span class="identifier">BinaryPredicate</span></code>'s
+                argument types.
+              </li>
 </ul></div>
 <a name="range.reference.algorithms.mutating.sort.complexity"></a><h6>
-<a name="id2743149"></a>
+<a name="id3317707"></a>
             <a class="link" href="sort.html#range.reference.algorithms.mutating.sort.complexity">Complexity</a>
           </h6>
 <p>
@@ -147,7 +147,7 @@
 </tr></table>
 <hr>
 <div class="spirit-nav">
-<a accesskey="p" href="rotate_copy.html"><img src="../../../../../../../../doc/html/images/prev.png" alt="Prev"></a><a accesskey="u" href="../mutating.html"><img src="../../../../../../../../doc/html/images/up.png" alt="Up"></a><a accesskey="h" href="../../../../index.html"><img src="../../../../../../../../doc/html/images/home.png" alt="Home"></a><a accesskey="n" href="stable_partition.html"><img src="../../../../../../../../doc/html/images/next.png" alt="Next"></a>
+<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>
 </body>
 </html>
diff --git a/doc/html/range/reference/algorithms/mutating/stable_partition.html b/doc/html/range/reference/algorithms/mutating/stable_partition.html
index c12efc0..59a763d 100644
--- a/doc/html/range/reference/algorithms/mutating/stable_partition.html
+++ b/doc/html/range/reference/algorithms/mutating/stable_partition.html
@@ -2,8 +2,8 @@
 <head>
 <meta http-equiv="Content-Type" content="text/html; charset=US-ASCII">
 <title>stable_partition</title>
-<link rel="stylesheet" href="../../../../../../../../doc/html/boostbook.css" type="text/css">
-<meta name="generator" content="DocBook XSL Stylesheets V1.75.1">
+<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="../mutating.html" title="Mutating algorithms">
 <link rel="prev" href="sort.html" title="sort">
@@ -13,22 +13,22 @@
 <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="../../../../../../../libraries.htm">Libraries</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="sort.html"><img src="../../../../../../../../doc/html/images/prev.png" alt="Prev"></a><a accesskey="u" href="../mutating.html"><img src="../../../../../../../../doc/html/images/up.png" alt="Up"></a><a accesskey="h" href="../../../../index.html"><img src="../../../../../../../../doc/html/images/home.png" alt="Home"></a><a accesskey="n" href="stable_sort.html"><img src="../../../../../../../../doc/html/images/next.png" alt="Next"></a>
+<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" title="stable_partition">
+<div class="section">
 <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="id2743267"></a>
+<a name="id3317825"></a>
             <a class="link" href="stable_partition.html#range.reference.algorithms.mutating.stable_partition.prototype">Prototype</a>
           </h6>
 <p>
@@ -61,7 +61,7 @@
 <p>
           </p>
 <a name="range.reference.algorithms.mutating.stable_partition.description"></a><h6>
-<a name="id2743847"></a>
+<a name="id3318405"></a>
             <a class="link" href="stable_partition.html#range.reference.algorithms.mutating.stable_partition.description">Description</a>
           </h6>
 <p>
@@ -83,32 +83,32 @@
             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="id2743997"></a>
+<a name="id3318556"></a>
             <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="id2744071"></a>
+<a name="id3318629"></a>
             <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">
-<code class="computeroutput"><span class="identifier">ForwardRange</span></code> is a model
-              of the <a class="link" href="../../../concepts/forward_range.html" title="Forward Range">Forward Range</a>
-              Concept.
-            </li>
+                <code class="computeroutput"><span class="identifier">ForwardRange</span></code> is a
+                model of the <a class="link" href="../../../concepts/forward_range.html" title="Forward Range">Forward
+                Range</a> Concept.
+              </li>
 <li class="listitem">
-<code class="computeroutput"><span class="identifier">ForwardRange</span></code> is mutable.
-            </li>
+                <code class="computeroutput"><span class="identifier">ForwardRange</span></code> is mutable.
+              </li>
 <li class="listitem">
-<code class="computeroutput"><span class="identifier">UnaryPredicate</span></code> is a
-              model of the <code class="computeroutput"><span class="identifier">PredicateConcept</span></code>.
-            </li>
+                <code class="computeroutput"><span class="identifier">UnaryPredicate</span></code> is
+                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="id2744160"></a>
+<a name="id3318728"></a>
             <a class="link" href="stable_partition.html#range.reference.algorithms.mutating.stable_partition.complexity">Complexity</a>
           </h6>
 <p>
@@ -129,7 +129,7 @@
 </tr></table>
 <hr>
 <div class="spirit-nav">
-<a accesskey="p" href="sort.html"><img src="../../../../../../../../doc/html/images/prev.png" alt="Prev"></a><a accesskey="u" href="../mutating.html"><img src="../../../../../../../../doc/html/images/up.png" alt="Up"></a><a accesskey="h" href="../../../../index.html"><img src="../../../../../../../../doc/html/images/home.png" alt="Home"></a><a accesskey="n" href="stable_sort.html"><img src="../../../../../../../../doc/html/images/next.png" alt="Next"></a>
+<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>
 </body>
 </html>
diff --git a/doc/html/range/reference/algorithms/mutating/stable_sort.html b/doc/html/range/reference/algorithms/mutating/stable_sort.html
index 7f4e1a5..8d9a6c0 100644
--- a/doc/html/range/reference/algorithms/mutating/stable_sort.html
+++ b/doc/html/range/reference/algorithms/mutating/stable_sort.html
@@ -2,8 +2,8 @@
 <head>
 <meta http-equiv="Content-Type" content="text/html; charset=US-ASCII">
 <title>stable_sort</title>
-<link rel="stylesheet" href="../../../../../../../../doc/html/boostbook.css" type="text/css">
-<meta name="generator" content="DocBook XSL Stylesheets V1.75.1">
+<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="../mutating.html" title="Mutating algorithms">
 <link rel="prev" href="stable_partition.html" title="stable_partition">
@@ -13,22 +13,22 @@
 <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="../../../../../../../libraries.htm">Libraries</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="stable_partition.html"><img src="../../../../../../../../doc/html/images/prev.png" alt="Prev"></a><a accesskey="u" href="../mutating.html"><img src="../../../../../../../../doc/html/images/up.png" alt="Up"></a><a accesskey="h" href="../../../../index.html"><img src="../../../../../../../../doc/html/images/home.png" alt="Home"></a><a accesskey="n" href="swap_ranges.html"><img src="../../../../../../../../doc/html/images/next.png" alt="Next"></a>
+<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" title="stable_sort">
+<div class="section">
 <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="id2744333"></a>
+<a name="id3318901"></a>
             <a class="link" href="stable_sort.html#range.reference.algorithms.mutating.stable_sort.prototype">Prototype</a>
           </h6>
 <p>
@@ -49,7 +49,7 @@
 <p>
           </p>
 <a name="range.reference.algorithms.mutating.stable_sort.description"></a><h6>
-<a name="id2744711"></a>
+<a name="id3319281"></a>
             <a class="link" href="stable_sort.html#range.reference.algorithms.mutating.stable_sort.description">Description</a>
           </h6>
 <p>
@@ -72,14 +72,14 @@
             <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="id2744964"></a>
+<a name="id3319533"></a>
             <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="id2745038"></a>
+<a name="id3319606"></a>
             <a class="link" href="stable_sort.html#range.reference.algorithms.mutating.stable_sort.requirements">Requirements</a>
           </h6>
 <p>
@@ -87,50 +87,50 @@
           </p>
 <div class="itemizedlist"><ul class="itemizedlist" type="disc">
 <li class="listitem">
-<code class="computeroutput"><span class="identifier">RandomAccessRange</span></code> is
-              a model of the <a class="link" href="../../../concepts/random_access_range.html" title="Random Access Range">Random
-              Access Range</a> Concept.
-            </li>
+                <code class="computeroutput"><span class="identifier">RandomAccessRange</span></code>
+                is a model of the <a class="link" href="../../../concepts/random_access_range.html" title="Random Access Range">Random
+                Access Range</a> Concept.
+              </li>
 <li class="listitem">
-<code class="computeroutput"><span class="identifier">RandomAccessRange</span></code> is
-              mutable.
-            </li>
+                <code class="computeroutput"><span class="identifier">RandomAccessRange</span></code>
+                is mutable.
+              </li>
 <li class="listitem">
-<code class="computeroutput"><span class="identifier">RandomAccessRange</span></code>'s
-              value type is a model of the <code class="computeroutput"><span class="identifier">LessThanComparableConcept</span></code>.
-            </li>
+                <code class="computeroutput"><span class="identifier">RandomAccessRange</span></code>'s
+                value type is a model of the <code class="computeroutput"><span class="identifier">LessThanComparableConcept</span></code>.
+              </li>
 <li class="listitem">
-              The ordering relation on <code class="computeroutput"><span class="identifier">RandomAccessRange</span></code>'s
-              value type is a <span class="bold"><strong>strict weak ordering</strong></span>,
-              as defined in the <code class="computeroutput"><span class="identifier">LessThanComparableConcept</span></code>
-              requirements.
-            </li>
+                The ordering relation on <code class="computeroutput"><span class="identifier">RandomAccessRange</span></code>'s
+                value type is a <span class="bold"><strong>strict weak ordering</strong></span>,
+                as defined in the <code class="computeroutput"><span class="identifier">LessThanComparableConcept</span></code>
+                requirements.
+              </li>
 </ul></div>
 <p>
             <span class="bold"><strong>For versions of stable_sort with a predicate:</strong></span>
           </p>
 <div class="itemizedlist"><ul class="itemizedlist" type="disc">
 <li class="listitem">
-<code class="computeroutput"><span class="identifier">RandomAccessRange</span></code> is
-              a model of the <a class="link" href="../../../concepts/random_access_range.html" title="Random Access Range">Random
-              Access Range</a> Concept.
-            </li>
+                <code class="computeroutput"><span class="identifier">RandomAccessRange</span></code>
+                is a model of the <a class="link" href="../../../concepts/random_access_range.html" title="Random Access Range">Random
+                Access Range</a> Concept.
+              </li>
 <li class="listitem">
-<code class="computeroutput"><span class="identifier">RandomAccessRange</span></code> is
-              mutable.
-            </li>
+                <code class="computeroutput"><span class="identifier">RandomAccessRange</span></code>
+                is mutable.
+              </li>
 <li class="listitem">
-<code class="computeroutput"><span class="identifier">BinaryPredicate</span></code> is
-              a model of the <code class="computeroutput"><span class="identifier">StrictWeakOrderingConcept</span></code>.
-            </li>
+                <code class="computeroutput"><span class="identifier">BinaryPredicate</span></code> is
+                a model of the <code class="computeroutput"><span class="identifier">StrictWeakOrderingConcept</span></code>.
+              </li>
 <li class="listitem">
-<code class="computeroutput"><span class="identifier">RandomAccessRange</span></code>'s
-              value type is convertible to both of <code class="computeroutput"><span class="identifier">BinaryPredicate</span></code>'s
-              argument types.
-            </li>
+                <code class="computeroutput"><span class="identifier">RandomAccessRange</span></code>'s
+                value type is convertible to both of <code class="computeroutput"><span class="identifier">BinaryPredicate</span></code>'s
+                argument types.
+              </li>
 </ul></div>
 <a name="range.reference.algorithms.mutating.stable_sort.complexity"></a><h6>
-<a name="id2745272"></a>
+<a name="id3319866"></a>
             <a class="link" href="stable_sort.html#range.reference.algorithms.mutating.stable_sort.complexity">Complexity</a>
           </h6>
 <p>
@@ -151,7 +151,7 @@
 </tr></table>
 <hr>
 <div class="spirit-nav">
-<a accesskey="p" href="stable_partition.html"><img src="../../../../../../../../doc/html/images/prev.png" alt="Prev"></a><a accesskey="u" href="../mutating.html"><img src="../../../../../../../../doc/html/images/up.png" alt="Up"></a><a accesskey="h" href="../../../../index.html"><img src="../../../../../../../../doc/html/images/home.png" alt="Home"></a><a accesskey="n" href="swap_ranges.html"><img src="../../../../../../../../doc/html/images/next.png" alt="Next"></a>
+<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>
 </body>
 </html>
diff --git a/doc/html/range/reference/algorithms/mutating/swap_ranges.html b/doc/html/range/reference/algorithms/mutating/swap_ranges.html
index a9fc9fa..42e33ce 100644
--- a/doc/html/range/reference/algorithms/mutating/swap_ranges.html
+++ b/doc/html/range/reference/algorithms/mutating/swap_ranges.html
@@ -2,8 +2,8 @@
 <head>
 <meta http-equiv="Content-Type" content="text/html; charset=US-ASCII">
 <title>swap_ranges</title>
-<link rel="stylesheet" href="../../../../../../../../doc/html/boostbook.css" type="text/css">
-<meta name="generator" content="DocBook XSL Stylesheets V1.75.1">
+<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="../mutating.html" title="Mutating algorithms">
 <link rel="prev" href="stable_sort.html" title="stable_sort">
@@ -13,22 +13,22 @@
 <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="../../../../../../../libraries.htm">Libraries</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="stable_sort.html"><img src="../../../../../../../../doc/html/images/prev.png" alt="Prev"></a><a accesskey="u" href="../mutating.html"><img src="../../../../../../../../doc/html/images/up.png" alt="Up"></a><a accesskey="h" href="../../../../index.html"><img src="../../../../../../../../doc/html/images/home.png" alt="Home"></a><a accesskey="n" href="transform.html"><img src="../../../../../../../../doc/html/images/next.png" alt="Next"></a>
+<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" title="swap_ranges">
+<div class="section">
 <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="id2745458"></a>
+<a name="id3320052"></a>
             <a class="link" href="swap_ranges.html#range.reference.algorithms.mutating.swap_ranges.prototype">Prototype</a>
           </h6>
 <p>
@@ -40,7 +40,7 @@
 <p>
           </p>
 <a name="range.reference.algorithms.mutating.swap_ranges.description"></a><h6>
-<a name="id2745592"></a>
+<a name="id3320186"></a>
             <a class="link" href="swap_ranges.html#range.reference.algorithms.mutating.swap_ranges.description">Description</a>
           </h6>
 <p>
@@ -50,38 +50,38 @@
             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="id2745683"></a>
+<a name="id3320277"></a>
             <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="id2745757"></a>
+<a name="id3320350"></a>
             <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">
-<code class="computeroutput"><span class="identifier">SinglePassRange1</span></code> is
-              a model of the <a class="link" href="../../../concepts/single_pass_range.html" title="Single Pass Range">Single
-              Pass Range</a> Concept.
-            </li>
+                <code class="computeroutput"><span class="identifier">SinglePassRange1</span></code>
+                is a model of the <a class="link" href="../../../concepts/single_pass_range.html" title="Single Pass Range">Single
+                Pass Range</a> Concept.
+              </li>
 <li class="listitem">
-<code class="computeroutput"><span class="identifier">SinglePassRange1</span></code> is
-              mutable.
-            </li>
+                <code class="computeroutput"><span class="identifier">SinglePassRange1</span></code>
+                is mutable.
+              </li>
 <li class="listitem">
-<code class="computeroutput"><span class="identifier">SinglePassRange2</span></code> is
-              a model of the <a class="link" href="../../../concepts/single_pass_range.html" title="Single Pass Range">Single
-              Pass Range</a> Concept.
-            </li>
+                <code class="computeroutput"><span class="identifier">SinglePassRange2</span></code>
+                is a model of the <a class="link" href="../../../concepts/single_pass_range.html" title="Single Pass Range">Single
+                Pass Range</a> Concept.
+              </li>
 <li class="listitem">
-<code class="computeroutput"><span class="identifier">SinglePassRange2</span></code> is
-              mutable.
-            </li>
+                <code class="computeroutput"><span class="identifier">SinglePassRange2</span></code>
+                is mutable.
+              </li>
 </ul></div>
 <a name="range.reference.algorithms.mutating.swap_ranges.complexity"></a><h6>
-<a name="id2745857"></a>
+<a name="id3320463"></a>
             <a class="link" href="swap_ranges.html#range.reference.algorithms.mutating.swap_ranges.complexity">Complexity</a>
           </h6>
 <p>
@@ -98,7 +98,7 @@
 </tr></table>
 <hr>
 <div class="spirit-nav">
-<a accesskey="p" href="stable_sort.html"><img src="../../../../../../../../doc/html/images/prev.png" alt="Prev"></a><a accesskey="u" href="../mutating.html"><img src="../../../../../../../../doc/html/images/up.png" alt="Up"></a><a accesskey="h" href="../../../../index.html"><img src="../../../../../../../../doc/html/images/home.png" alt="Home"></a><a accesskey="n" href="transform.html"><img src="../../../../../../../../doc/html/images/next.png" alt="Next"></a>
+<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>
 </body>
 </html>
diff --git a/doc/html/range/reference/algorithms/mutating/transform.html b/doc/html/range/reference/algorithms/mutating/transform.html
index 9247576..ca1a530 100644
--- a/doc/html/range/reference/algorithms/mutating/transform.html
+++ b/doc/html/range/reference/algorithms/mutating/transform.html
@@ -2,8 +2,8 @@
 <head>
 <meta http-equiv="Content-Type" content="text/html; charset=US-ASCII">
 <title>transform</title>
-<link rel="stylesheet" href="../../../../../../../../doc/html/boostbook.css" type="text/css">
-<meta name="generator" content="DocBook XSL Stylesheets V1.75.1">
+<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="../mutating.html" title="Mutating algorithms">
 <link rel="prev" href="swap_ranges.html" title="swap_ranges">
@@ -13,21 +13,21 @@
 <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="../../../../../../../libraries.htm">Libraries</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="swap_ranges.html"><img src="../../../../../../../../doc/html/images/prev.png" alt="Prev"></a><a accesskey="u" href="../mutating.html"><img src="../../../../../../../../doc/html/images/up.png" alt="Up"></a><a accesskey="h" href="../../../../index.html"><img src="../../../../../../../../doc/html/images/home.png" alt="Home"></a><a accesskey="n" href="unique.html"><img src="../../../../../../../../doc/html/images/next.png" alt="Next"></a>
+<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" title="transform">
+<div class="section">
 <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="id2745927"></a>
+<a name="id3320533"></a>
             <a class="link" href="transform.html#range.reference.algorithms.mutating.transform.prototype">Prototype</a>
           </h6>
 <p>
@@ -56,7 +56,7 @@
 <p>
           </p>
 <a name="range.reference.algorithms.mutating.transform.description"></a><h6>
-<a name="id2746265"></a>
+<a name="id3320872"></a>
             <a class="link" href="transform.html#range.reference.algorithms.mutating.transform.description">Description</a>
           </h6>
 <p>
@@ -92,14 +92,14 @@
             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="id2746815"></a>
+<a name="id3321422"></a>
             <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="id2746887"></a>
+<a name="id3321494"></a>
             <a class="link" href="transform.html#range.reference.algorithms.mutating.transform.requirements">Requirements</a>
           </h6>
 <p>
@@ -107,69 +107,69 @@
           </p>
 <div class="itemizedlist"><ul class="itemizedlist" type="disc">
 <li class="listitem">
-<code class="computeroutput"><span class="identifier">SinglePassRange1</span></code> is
-              a model of the <a class="link" href="../../../concepts/single_pass_range.html" title="Single Pass Range">Single
-              Pass Range</a> Concept.
-            </li>
+                <code class="computeroutput"><span class="identifier">SinglePassRange1</span></code>
+                is a model of the <a class="link" href="../../../concepts/single_pass_range.html" title="Single Pass Range">Single
+                Pass Range</a> Concept.
+              </li>
 <li class="listitem">
-<code class="computeroutput"><span class="identifier">OutputIterator</span></code> is a
-              model of the <code class="computeroutput"><span class="identifier">OutputIteratorConcept</span></code>.
-            </li>
+                <code class="computeroutput"><span class="identifier">OutputIterator</span></code> is
+                a model of the <code class="computeroutput"><span class="identifier">OutputIteratorConcept</span></code>.
+              </li>
 <li class="listitem">
-<code class="computeroutput"><span class="identifier">UnaryOperation</span></code> is a
-              model of the <code class="computeroutput"><span class="identifier">UnaryFunctionConcept</span></code>.
-            </li>
+                <code class="computeroutput"><span class="identifier">UnaryOperation</span></code> is
+                a model of the <code class="computeroutput"><span class="identifier">UnaryFunctionConcept</span></code>.
+              </li>
 <li class="listitem">
-<code class="computeroutput"><span class="identifier">SinglePassRange1</span></code>'s
-              value type must be convertible to <code class="computeroutput"><span class="identifier">UnaryFunction</span></code>'s
-              argument type.
-            </li>
+                <code class="computeroutput"><span class="identifier">SinglePassRange1</span></code>'s
+                value type must be convertible to <code class="computeroutput"><span class="identifier">UnaryFunction</span></code>'s
+                argument type.
+              </li>
 <li class="listitem">
-<code class="computeroutput"><span class="identifier">UnaryFunction</span></code>'s result
-              type must be convertible to a type in <code class="computeroutput"><span class="identifier">OutputIterator</span></code>'s
-              set of value types.
-            </li>
+                <code class="computeroutput"><span class="identifier">UnaryFunction</span></code>'s result
+                type must be convertible to a type in <code class="computeroutput"><span class="identifier">OutputIterator</span></code>'s
+                set of value types.
+              </li>
 </ul></div>
 <p>
             <span class="bold"><strong>For the binary versions of transform:</strong></span>
           </p>
 <div class="itemizedlist"><ul class="itemizedlist" type="disc">
 <li class="listitem">
-<code class="computeroutput"><span class="identifier">SinglePassRange1</span></code> is
-              a model of the <a class="link" href="../../../concepts/single_pass_range.html" title="Single Pass Range">Single
-              Pass Range</a> Concept.
-            </li>
+                <code class="computeroutput"><span class="identifier">SinglePassRange1</span></code>
+                is a model of the <a class="link" href="../../../concepts/single_pass_range.html" title="Single Pass Range">Single
+                Pass Range</a> Concept.
+              </li>
 <li class="listitem">
-<code class="computeroutput"><span class="identifier">SinglePassRange2</span></code> is
-              a model of the <a class="link" href="../../../concepts/single_pass_range.html" title="Single Pass Range">Single
-              Pass Range</a> Concept.
-            </li>
+                <code class="computeroutput"><span class="identifier">SinglePassRange2</span></code>
+                is a model of the <a class="link" href="../../../concepts/single_pass_range.html" title="Single Pass Range">Single
+                Pass Range</a> Concept.
+              </li>
 <li class="listitem">
-<code class="computeroutput"><span class="identifier">OutputIterator</span></code> is a
-              model of the <code class="computeroutput"><span class="identifier">OutputIteratorConcept</span></code>.
-            </li>
+                <code class="computeroutput"><span class="identifier">OutputIterator</span></code> is
+                a model of the <code class="computeroutput"><span class="identifier">OutputIteratorConcept</span></code>.
+              </li>
 <li class="listitem">
-<code class="computeroutput"><span class="identifier">BinaryOperation</span></code> is
-              a model of the <code class="computeroutput"><span class="identifier">BinaryFunctionConcept</span></code>.
-            </li>
+                <code class="computeroutput"><span class="identifier">BinaryOperation</span></code> is
+                a model of the <code class="computeroutput"><span class="identifier">BinaryFunctionConcept</span></code>.
+              </li>
 <li class="listitem">
-<code class="computeroutput"><span class="identifier">SinglePassRange1</span></code>'s
-              value type must be convertible to <code class="computeroutput"><span class="identifier">BinaryFunction</span></code>'s
-              first argument type.
-            </li>
+                <code class="computeroutput"><span class="identifier">SinglePassRange1</span></code>'s
+                value type must be convertible to <code class="computeroutput"><span class="identifier">BinaryFunction</span></code>'s
+                first argument type.
+              </li>
 <li class="listitem">
-<code class="computeroutput"><span class="identifier">SinglePassRange2</span></code>'s
-              value type must be convertible to <code class="computeroutput"><span class="identifier">BinaryFunction</span></code>'s
-              second argument type.
-            </li>
+                <code class="computeroutput"><span class="identifier">SinglePassRange2</span></code>'s
+                value type must be convertible to <code class="computeroutput"><span class="identifier">BinaryFunction</span></code>'s
+                second argument type.
+              </li>
 <li class="listitem">
-<code class="computeroutput"><span class="identifier">BinaryOperation</span></code>'s result
-              type must be convertible to a type in <code class="computeroutput"><span class="identifier">OutputIterator</span></code>'s
-              set of value types.
-            </li>
+                <code class="computeroutput"><span class="identifier">BinaryOperation</span></code>'s
+                result type must be convertible to a type in <code class="computeroutput"><span class="identifier">OutputIterator</span></code>'s
+                set of value types.
+              </li>
 </ul></div>
 <a name="range.reference.algorithms.mutating.transform.precondition_"></a><h6>
-<a name="id2747239"></a>
+<a name="id3321884"></a>
             <a class="link" href="transform.html#range.reference.algorithms.mutating.transform.precondition_">Precondition:</a>
           </h6>
 <p>
@@ -177,31 +177,33 @@
           </p>
 <div class="itemizedlist"><ul class="itemizedlist" type="disc">
 <li class="listitem">
-<code class="computeroutput"><span class="identifier">out</span></code> is not an iterator
-              within the range <code class="computeroutput"><span class="special">[</span><span class="identifier">begin</span><span class="special">(</span><span class="identifier">rng1</span><span class="special">)</span> <span class="special">+</span> <span class="number">1</span><span class="special">,</span> <span class="identifier">end</span><span class="special">(</span><span class="identifier">rng1</span><span class="special">))</span></code>.
-            </li>
+                <code class="computeroutput"><span class="identifier">out</span></code> is not an iterator
+                within the range <code class="computeroutput"><span class="special">[</span><span class="identifier">begin</span><span class="special">(</span><span class="identifier">rng1</span><span class="special">)</span> <span class="special">+</span> <span class="number">1</span><span class="special">,</span> <span class="identifier">end</span><span class="special">(</span><span class="identifier">rng1</span><span class="special">))</span></code>.
+              </li>
 <li class="listitem">
-<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">distance</span><span class="special">(</span><span class="identifier">rng1</span><span class="special">))</span></code> is a valid range.
-            </li>
+                <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">distance</span><span class="special">(</span><span class="identifier">rng1</span><span class="special">))</span></code> is a valid range.
+              </li>
 </ul></div>
 <p>
             <span class="bold"><strong>For the binary version of transform:</strong></span>
           </p>
 <div class="itemizedlist"><ul class="itemizedlist" type="disc">
 <li class="listitem">
-<code class="computeroutput"><span class="identifier">out</span></code> is not an iterator
-              within the range <code class="computeroutput"><span class="special">[</span><span class="identifier">begin</span><span class="special">(</span><span class="identifier">rng1</span><span class="special">)</span> <span class="special">+</span> <span class="number">1</span><span class="special">,</span> <span class="identifier">end</span><span class="special">(</span><span class="identifier">rng1</span><span class="special">))</span></code>.
-            </li>
+                <code class="computeroutput"><span class="identifier">out</span></code> is not an iterator
+                within the range <code class="computeroutput"><span class="special">[</span><span class="identifier">begin</span><span class="special">(</span><span class="identifier">rng1</span><span class="special">)</span> <span class="special">+</span> <span class="number">1</span><span class="special">,</span> <span class="identifier">end</span><span class="special">(</span><span class="identifier">rng1</span><span class="special">))</span></code>.
+              </li>
 <li class="listitem">
-<code class="computeroutput"><span class="identifier">out</span></code> is not an iterator
-              within the range <code class="computeroutput"><span class="special">[</span><span class="identifier">begin</span><span class="special">(</span><span class="identifier">rng2</span><span class="special">)</span> <span class="special">+</span> <span class="number">1</span><span class="special">,</span> <span class="identifier">end</span><span class="special">(</span><span class="identifier">rng2</span><span class="special">))</span></code>.
-            </li>
+                <code class="computeroutput"><span class="identifier">out</span></code> is not an iterator
+                within the range <code class="computeroutput"><span class="special">[</span><span class="identifier">begin</span><span class="special">(</span><span class="identifier">rng2</span><span class="special">)</span> <span class="special">+</span> <span class="number">1</span><span class="special">,</span> <span class="identifier">end</span><span class="special">(</span><span class="identifier">rng2</span><span class="special">))</span></code>.
+              </li>
 <li class="listitem">
-<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">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>
+                <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">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="id2747654"></a>
+<a name="id3322316"></a>
             <a class="link" href="transform.html#range.reference.algorithms.mutating.transform.complexity">Complexity</a>
           </h6>
 <p>
@@ -219,7 +221,7 @@
 </tr></table>
 <hr>
 <div class="spirit-nav">
-<a accesskey="p" href="swap_ranges.html"><img src="../../../../../../../../doc/html/images/prev.png" alt="Prev"></a><a accesskey="u" href="../mutating.html"><img src="../../../../../../../../doc/html/images/up.png" alt="Up"></a><a accesskey="h" href="../../../../index.html"><img src="../../../../../../../../doc/html/images/home.png" alt="Home"></a><a accesskey="n" href="unique.html"><img src="../../../../../../../../doc/html/images/next.png" alt="Next"></a>
+<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>
 </body>
 </html>
diff --git a/doc/html/range/reference/algorithms/mutating/unique.html b/doc/html/range/reference/algorithms/mutating/unique.html
index 961a44f..7c0c1b8 100644
--- a/doc/html/range/reference/algorithms/mutating/unique.html
+++ b/doc/html/range/reference/algorithms/mutating/unique.html
@@ -2,8 +2,8 @@
 <head>
 <meta http-equiv="Content-Type" content="text/html; charset=US-ASCII">
 <title>unique</title>
-<link rel="stylesheet" href="../../../../../../../../doc/html/boostbook.css" type="text/css">
-<meta name="generator" content="DocBook XSL Stylesheets V1.75.1">
+<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="../mutating.html" title="Mutating algorithms">
 <link rel="prev" href="transform.html" title="transform">
@@ -13,21 +13,21 @@
 <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="../../../../../../../libraries.htm">Libraries</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="transform.html"><img src="../../../../../../../../doc/html/images/prev.png" alt="Prev"></a><a accesskey="u" href="../mutating.html"><img src="../../../../../../../../doc/html/images/up.png" alt="Up"></a><a accesskey="h" href="../../../../index.html"><img src="../../../../../../../../doc/html/images/home.png" alt="Home"></a><a accesskey="n" href="unique_copy.html"><img src="../../../../../../../../doc/html/images/next.png" alt="Next"></a>
+<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" title="unique">
+<div class="section">
 <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="id2747774"></a>
+<a name="id3322436"></a>
             <a class="link" href="unique.html#range.reference.algorithms.mutating.unique.prototype">Prototype</a>
           </h6>
 <p>
@@ -68,7 +68,7 @@
 <p>
           </p>
 <a name="range.reference.algorithms.mutating.unique.description"></a><h6>
-<a name="id2748806"></a>
+<a name="id3323468"></a>
             <a class="link" href="unique.html#range.reference.algorithms.mutating.unique.description">Description</a>
           </h6>
 <p>
@@ -86,14 +86,14 @@
             type.
           </p>
 <a name="range.reference.algorithms.mutating.unique.definition"></a><h6>
-<a name="id2748929"></a>
+<a name="id3323591"></a>
             <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="id2749001"></a>
+<a name="id3323664"></a>
             <a class="link" href="unique.html#range.reference.algorithms.mutating.unique.requirements">Requirements</a>
           </h6>
 <p>
@@ -101,43 +101,43 @@
           </p>
 <div class="itemizedlist"><ul class="itemizedlist" type="disc">
 <li class="listitem">
-<code class="computeroutput"><span class="identifier">ForwardRange</span></code> is a model
-              of the <a class="link" href="../../../concepts/forward_range.html" title="Forward Range">Forward Range</a>
-              Concept.
-            </li>
+                <code class="computeroutput"><span class="identifier">ForwardRange</span></code> is a
+                model of the <a class="link" href="../../../concepts/forward_range.html" title="Forward Range">Forward
+                Range</a> Concept.
+              </li>
 <li class="listitem">
-<code class="computeroutput"><span class="identifier">ForwardRange</span></code> is mutable.
-            </li>
+                <code class="computeroutput"><span class="identifier">ForwardRange</span></code> is mutable.
+              </li>
 <li class="listitem">
-<code class="computeroutput"><span class="identifier">ForwardRange</span></code>'s value
-              type is a model of the <code class="computeroutput"><span class="identifier">EqualityComparableConcept</span></code>.
-            </li>
+                <code class="computeroutput"><span class="identifier">ForwardRange</span></code>'s value
+                type is a model of the <code class="computeroutput"><span class="identifier">EqualityComparableConcept</span></code>.
+              </li>
 </ul></div>
 <p>
             <span class="bold"><strong>For the predicate versions of unique:</strong></span>
           </p>
 <div class="itemizedlist"><ul class="itemizedlist" type="disc">
 <li class="listitem">
-<code class="computeroutput"><span class="identifier">ForwardRange</span></code> is a model
-              of the <a class="link" href="../../../concepts/forward_range.html" title="Forward Range">Forward Range</a>
-              Concept.
-            </li>
+                <code class="computeroutput"><span class="identifier">ForwardRange</span></code> is a
+                model of the <a class="link" href="../../../concepts/forward_range.html" title="Forward Range">Forward
+                Range</a> Concept.
+              </li>
 <li class="listitem">
-<code class="computeroutput"><span class="identifier">ForwardRange</span></code> is mutable.
-            </li>
+                <code class="computeroutput"><span class="identifier">ForwardRange</span></code> is mutable.
+              </li>
 <li class="listitem">
-<code class="computeroutput"><span class="identifier">BinaryPredicate</span></code> is
-              a model of the <code class="computeroutput"><span class="identifier">BinaryPredicateConcept</span></code>.
-            </li>
+                <code class="computeroutput"><span class="identifier">BinaryPredicate</span></code> is
+                a model of the <code class="computeroutput"><span class="identifier">BinaryPredicateConcept</span></code>.
+              </li>
 <li class="listitem">
-<code class="computeroutput"><span class="identifier">ForwardRange</span></code>'s value
-              type is convertible to <code class="computeroutput"><span class="identifier">BinaryPredicate</span></code>'s
-              first argument type and to <code class="computeroutput"><span class="identifier">BinaryPredicate</span></code>'s
-              second argument type.
-            </li>
+                <code class="computeroutput"><span class="identifier">ForwardRange</span></code>'s value
+                type is convertible to <code class="computeroutput"><span class="identifier">BinaryPredicate</span></code>'s
+                first argument type and to <code class="computeroutput"><span class="identifier">BinaryPredicate</span></code>'s
+                second argument type.
+              </li>
 </ul></div>
 <a name="range.reference.algorithms.mutating.unique.complexity"></a><h6>
-<a name="id2749214"></a>
+<a name="id3323898"></a>
             <a class="link" href="unique.html#range.reference.algorithms.mutating.unique.complexity">Complexity</a>
           </h6>
 <p>
@@ -157,7 +157,7 @@
 </tr></table>
 <hr>
 <div class="spirit-nav">
-<a accesskey="p" href="transform.html"><img src="../../../../../../../../doc/html/images/prev.png" alt="Prev"></a><a accesskey="u" href="../mutating.html"><img src="../../../../../../../../doc/html/images/up.png" alt="Up"></a><a accesskey="h" href="../../../../index.html"><img src="../../../../../../../../doc/html/images/home.png" alt="Home"></a><a accesskey="n" href="unique_copy.html"><img src="../../../../../../../../doc/html/images/next.png" alt="Next"></a>
+<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>
 </body>
 </html>
diff --git a/doc/html/range/reference/algorithms/mutating/unique_copy.html b/doc/html/range/reference/algorithms/mutating/unique_copy.html
index e0de9fc..b202b52 100644
--- a/doc/html/range/reference/algorithms/mutating/unique_copy.html
+++ b/doc/html/range/reference/algorithms/mutating/unique_copy.html
@@ -2,8 +2,8 @@
 <head>
 <meta http-equiv="Content-Type" content="text/html; charset=US-ASCII">
 <title>unique_copy</title>
-<link rel="stylesheet" href="../../../../../../../../doc/html/boostbook.css" type="text/css">
-<meta name="generator" content="DocBook XSL Stylesheets V1.75.1">
+<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="../mutating.html" title="Mutating algorithms">
 <link rel="prev" href="unique.html" title="unique">
@@ -13,22 +13,22 @@
 <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="../../../../../../../libraries.htm">Libraries</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="unique.html"><img src="../../../../../../../../doc/html/images/prev.png" alt="Prev"></a><a accesskey="u" href="../mutating.html"><img src="../../../../../../../../doc/html/images/up.png" alt="Up"></a><a accesskey="h" href="../../../../index.html"><img src="../../../../../../../../doc/html/images/home.png" alt="Home"></a><a accesskey="n" href="../non_mutating.html"><img src="../../../../../../../../doc/html/images/next.png" alt="Next"></a>
+<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" title="unique_copy">
+<div class="section">
 <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="id2749341"></a>
+<a name="id3324025"></a>
             <a class="link" href="unique_copy.html#range.reference.algorithms.mutating.unique_copy.prototype">Prototype</a>
           </h6>
 <p>
@@ -43,7 +43,7 @@
 <p>
           </p>
 <a name="range.reference.algorithms.mutating.unique_copy.description"></a><h6>
-<a name="id2749601"></a>
+<a name="id3324286"></a>
             <a class="link" href="unique_copy.html#range.reference.algorithms.mutating.unique_copy.description">Description</a>
           </h6>
 <p>
@@ -56,14 +56,14 @@
             value type.
           </p>
 <a name="range.reference.algorithms.mutating.unique_copy.definition"></a><h6>
-<a name="id2749691"></a>
+<a name="id3324376"></a>
             <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="id2749767"></a>
+<a name="id3324451"></a>
             <a class="link" href="unique_copy.html#range.reference.algorithms.mutating.unique_copy.requirements">Requirements</a>
           </h6>
 <p>
@@ -71,53 +71,53 @@
           </p>
 <div class="itemizedlist"><ul class="itemizedlist" type="disc">
 <li class="listitem">
-<code class="computeroutput"><span class="identifier">SinglePassRange</span></code> is
-              a model of the <a class="link" href="../../../concepts/single_pass_range.html" title="Single Pass Range">Single
-              Pass Range</a> Concept.
-            </li>
+                <code class="computeroutput"><span class="identifier">SinglePassRange</span></code> is
+                a model of the <a class="link" href="../../../concepts/single_pass_range.html" title="Single Pass Range">Single
+                Pass Range</a> Concept.
+              </li>
 <li class="listitem">
-<code class="computeroutput"><span class="identifier">SinglePassRange</span></code> is
-              mutable.
-            </li>
+                <code class="computeroutput"><span class="identifier">SinglePassRange</span></code> is
+                mutable.
+              </li>
 <li class="listitem">
-<code class="computeroutput"><span class="identifier">SinglePassRange</span></code>'s value
-              type is a model of the <code class="computeroutput"><span class="identifier">EqualityComparableConcept</span></code>.
-            </li>
+                <code class="computeroutput"><span class="identifier">SinglePassRange</span></code>'s
+                value type is a model of the <code class="computeroutput"><span class="identifier">EqualityComparableConcept</span></code>.
+              </li>
 <li class="listitem">
-<code class="computeroutput"><span class="identifier">OutputIterator</span></code> is a
-              model of the <code class="computeroutput"><span class="identifier">OutputIteratorConcept</span></code>.
-            </li>
+                <code class="computeroutput"><span class="identifier">OutputIterator</span></code> is
+                a model of the <code class="computeroutput"><span class="identifier">OutputIteratorConcept</span></code>.
+              </li>
 </ul></div>
 <p>
             <span class="bold"><strong>For the predicate versions of unique:</strong></span>
           </p>
 <div class="itemizedlist"><ul class="itemizedlist" type="disc">
 <li class="listitem">
-<code class="computeroutput"><span class="identifier">SinglePassRange</span></code> is
-              a model of the <a class="link" href="../../../concepts/single_pass_range.html" title="Single Pass Range">Single
-              Pass Range</a> Concept.
-            </li>
+                <code class="computeroutput"><span class="identifier">SinglePassRange</span></code> is
+                a model of the <a class="link" href="../../../concepts/single_pass_range.html" title="Single Pass Range">Single
+                Pass Range</a> Concept.
+              </li>
 <li class="listitem">
-<code class="computeroutput"><span class="identifier">SinglePassRange</span></code> is
-              mutable.
-            </li>
+                <code class="computeroutput"><span class="identifier">SinglePassRange</span></code> is
+                mutable.
+              </li>
 <li class="listitem">
-<code class="computeroutput"><span class="identifier">BinaryPredicate</span></code> is
-              a model of the <code class="computeroutput"><span class="identifier">BinaryPredicateConcept</span></code>.
-            </li>
+                <code class="computeroutput"><span class="identifier">BinaryPredicate</span></code> is
+                a model of the <code class="computeroutput"><span class="identifier">BinaryPredicateConcept</span></code>.
+              </li>
 <li class="listitem">
-<code class="computeroutput"><span class="identifier">SinglePassRange</span></code>'s value
-              type is convertible to <code class="computeroutput"><span class="identifier">BinaryPredicate</span></code>'s
-              first argument type and to <code class="computeroutput"><span class="identifier">BinaryPredicate</span></code>'s
-              second argument type.
-            </li>
+                <code class="computeroutput"><span class="identifier">SinglePassRange</span></code>'s
+                value type is convertible to <code class="computeroutput"><span class="identifier">BinaryPredicate</span></code>'s
+                first argument type and to <code class="computeroutput"><span class="identifier">BinaryPredicate</span></code>'s
+                second argument type.
+              </li>
 <li class="listitem">
-<code class="computeroutput"><span class="identifier">OutputIterator</span></code> is a
-              model of the <code class="computeroutput"><span class="identifier">OutputIteratorConcept</span></code>.
-            </li>
+                <code class="computeroutput"><span class="identifier">OutputIterator</span></code> is
+                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="id2750031"></a>
+<a name="id3324744"></a>
             <a class="link" href="unique_copy.html#range.reference.algorithms.mutating.unique_copy.complexity">Complexity</a>
           </h6>
 <p>
@@ -137,7 +137,7 @@
 </tr></table>
 <hr>
 <div class="spirit-nav">
-<a accesskey="p" href="unique.html"><img src="../../../../../../../../doc/html/images/prev.png" alt="Prev"></a><a accesskey="u" href="../mutating.html"><img src="../../../../../../../../doc/html/images/up.png" alt="Up"></a><a accesskey="h" href="../../../../index.html"><img src="../../../../../../../../doc/html/images/home.png" alt="Home"></a><a accesskey="n" href="../non_mutating.html"><img src="../../../../../../../../doc/html/images/next.png" alt="Next"></a>
+<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>
 </body>
 </html>
diff --git a/doc/html/range/reference/algorithms/new.html b/doc/html/range/reference/algorithms/new.html
index d07ac11..2fc36d9 100644
--- a/doc/html/range/reference/algorithms/new.html
+++ b/doc/html/range/reference/algorithms/new.html
@@ -2,8 +2,8 @@
 <head>
 <meta http-equiv="Content-Type" content="text/html; charset=US-ASCII">
 <title>New algorithms</title>
-<link rel="stylesheet" href="../../../../../../../doc/html/boostbook.css" type="text/css">
-<meta name="generator" content="DocBook XSL Stylesheets V1.75.1">
+<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="../algorithms.html" title="Range Algorithm">
 <link rel="prev" href="permutation/prev_permutation.html" title="prev_permutation">
@@ -13,16 +13,16 @@
 <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="../../../../../../libraries.htm">Libraries</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="permutation/prev_permutation.html"><img src="../../../../../../../doc/html/images/prev.png" alt="Prev"></a><a accesskey="u" href="../algorithms.html"><img src="../../../../../../../doc/html/images/up.png" alt="Up"></a><a accesskey="h" href="../../../index.html"><img src="../../../../../../../doc/html/images/home.png" alt="Home"></a><a accesskey="n" href="new/copy_n.html"><img src="../../../../../../../doc/html/images/next.png" alt="Next"></a>
+<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" title="New algorithms">
+<div class="section">
 <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>
@@ -51,7 +51,7 @@
 </tr></table>
 <hr>
 <div class="spirit-nav">
-<a accesskey="p" href="permutation/prev_permutation.html"><img src="../../../../../../../doc/html/images/prev.png" alt="Prev"></a><a accesskey="u" href="../algorithms.html"><img src="../../../../../../../doc/html/images/up.png" alt="Up"></a><a accesskey="h" href="../../../index.html"><img src="../../../../../../../doc/html/images/home.png" alt="Home"></a><a accesskey="n" href="new/copy_n.html"><img src="../../../../../../../doc/html/images/next.png" alt="Next"></a>
+<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>
 </body>
 </html>
diff --git a/doc/html/range/reference/algorithms/new/copy_n.html b/doc/html/range/reference/algorithms/new/copy_n.html
index b84b29e..0a6c5cc 100644
--- a/doc/html/range/reference/algorithms/new/copy_n.html
+++ b/doc/html/range/reference/algorithms/new/copy_n.html
@@ -2,8 +2,8 @@
 <head>
 <meta http-equiv="Content-Type" content="text/html; charset=US-ASCII">
 <title>copy_n</title>
-<link rel="stylesheet" href="../../../../../../../../doc/html/boostbook.css" type="text/css">
-<meta name="generator" content="DocBook XSL Stylesheets V1.75.1">
+<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="../new.html" title="New algorithms">
 <link rel="prev" href="../new.html" title="New algorithms">
@@ -13,21 +13,21 @@
 <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="../../../../../../../libraries.htm">Libraries</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="../new.html"><img src="../../../../../../../../doc/html/images/prev.png" alt="Prev"></a><a accesskey="u" href="../new.html"><img src="../../../../../../../../doc/html/images/up.png" alt="Up"></a><a accesskey="h" href="../../../../index.html"><img src="../../../../../../../../doc/html/images/home.png" alt="Home"></a><a accesskey="n" href="erase.html"><img src="../../../../../../../../doc/html/images/next.png" alt="Next"></a>
+<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" title="copy_n">
+<div class="section">
 <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="id2784007"></a>
+<a name="id3359554"></a>
             <a class="link" href="copy_n.html#range.reference.algorithms.new.copy_n.prototype">Prototype</a>
           </h6>
 <p>
@@ -39,7 +39,7 @@
 <p>
           </p>
 <a name="range.reference.algorithms.new.copy_n.description"></a><h6>
-<a name="id2784168"></a>
+<a name="id3359714"></a>
             <a class="link" href="copy_n.html#range.reference.algorithms.new.copy_n.description">Description</a>
           </h6>
 <p>
@@ -53,33 +53,33 @@
             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="id2784342"></a>
+<a name="id3359889"></a>
             <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="id2784414"></a>
+<a name="id3359961"></a>
             <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">
-<code class="computeroutput"><span class="identifier">SinglePassRange</span></code> is
-              a model of the <a class="link" href="../../../concepts/single_pass_range.html" title="Single Pass Range">Single
-              Pass Range</a> Concept.
-            </li>
+                <code class="computeroutput"><span class="identifier">SinglePassRange</span></code> is
+                a model of the <a class="link" href="../../../concepts/single_pass_range.html" title="Single Pass Range">Single
+                Pass Range</a> Concept.
+              </li>
 <li class="listitem">
-<code class="computeroutput"><span class="identifier">Size</span></code> is a model of
-              the <code class="computeroutput"><span class="identifier">Integer</span></code> Concept.
-            </li>
+                <code class="computeroutput"><span class="identifier">Size</span></code> is a model of
+                the <code class="computeroutput"><span class="identifier">Integer</span></code> Concept.
+              </li>
 <li class="listitem">
-<code class="computeroutput"><span class="identifier">OutputIterator</span></code> is a
-              model of the <code class="computeroutput"><span class="identifier">OutputIteratorConcept</span></code>.
-            </li>
+                <code class="computeroutput"><span class="identifier">OutputIterator</span></code> is
+                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="id2784518"></a>
+<a name="id3360074"></a>
             <a class="link" href="copy_n.html#range.reference.algorithms.new.copy_n.complexity">Complexity</a>
           </h6>
 <p>
@@ -97,7 +97,7 @@
 </tr></table>
 <hr>
 <div class="spirit-nav">
-<a accesskey="p" href="../new.html"><img src="../../../../../../../../doc/html/images/prev.png" alt="Prev"></a><a accesskey="u" href="../new.html"><img src="../../../../../../../../doc/html/images/up.png" alt="Up"></a><a accesskey="h" href="../../../../index.html"><img src="../../../../../../../../doc/html/images/home.png" alt="Home"></a><a accesskey="n" href="erase.html"><img src="../../../../../../../../doc/html/images/next.png" alt="Next"></a>
+<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>
 </body>
 </html>
diff --git a/doc/html/range/reference/algorithms/new/erase.html b/doc/html/range/reference/algorithms/new/erase.html
index 47a5197..346a24e 100644
--- a/doc/html/range/reference/algorithms/new/erase.html
+++ b/doc/html/range/reference/algorithms/new/erase.html
@@ -2,8 +2,8 @@
 <head>
 <meta http-equiv="Content-Type" content="text/html; charset=US-ASCII">
 <title>erase</title>
-<link rel="stylesheet" href="../../../../../../../../doc/html/boostbook.css" type="text/css">
-<meta name="generator" content="DocBook XSL Stylesheets V1.75.1">
+<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="../new.html" title="New algorithms">
 <link rel="prev" href="copy_n.html" title="copy_n">
@@ -13,21 +13,21 @@
 <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="../../../../../../../libraries.htm">Libraries</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="copy_n.html"><img src="../../../../../../../../doc/html/images/prev.png" alt="Prev"></a><a accesskey="u" href="../new.html"><img src="../../../../../../../../doc/html/images/up.png" alt="Up"></a><a accesskey="h" href="../../../../index.html"><img src="../../../../../../../../doc/html/images/home.png" alt="Home"></a><a accesskey="n" href="for_each.html"><img src="../../../../../../../../doc/html/images/next.png" alt="Next"></a>
+<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" title="erase">
+<div class="section">
 <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="id2784574"></a>
+<a name="id3360129"></a>
             <a class="link" href="erase.html#range.reference.algorithms.new.erase.prototype">Prototype</a>
           </h6>
 <p>
@@ -41,7 +41,7 @@
 <p>
           </p>
 <a name="range.reference.algorithms.new.erase.description"></a><h6>
-<a name="id2784716"></a>
+<a name="id3360271"></a>
             <a class="link" href="erase.html#range.reference.algorithms.new.erase.description">Description</a>
           </h6>
 <p>
@@ -58,22 +58,22 @@
             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="id2785020"></a>
+<a name="id3360577"></a>
             <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="id2785093"></a>
+<a name="id3360649"></a>
             <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>
+                <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="id2785138"></a>
+<a name="id3360697"></a>
             <a class="link" href="erase.html#range.reference.algorithms.new.erase.complexity">Complexity</a>
           </h6>
 <p>
@@ -90,7 +90,7 @@
 </tr></table>
 <hr>
 <div class="spirit-nav">
-<a accesskey="p" href="copy_n.html"><img src="../../../../../../../../doc/html/images/prev.png" alt="Prev"></a><a accesskey="u" href="../new.html"><img src="../../../../../../../../doc/html/images/up.png" alt="Up"></a><a accesskey="h" href="../../../../index.html"><img src="../../../../../../../../doc/html/images/home.png" alt="Home"></a><a accesskey="n" href="for_each.html"><img src="../../../../../../../../doc/html/images/next.png" alt="Next"></a>
+<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>
 </body>
 </html>
diff --git a/doc/html/range/reference/algorithms/new/for_each.html b/doc/html/range/reference/algorithms/new/for_each.html
index c9c5db1..8983318 100644
--- a/doc/html/range/reference/algorithms/new/for_each.html
+++ b/doc/html/range/reference/algorithms/new/for_each.html
@@ -2,8 +2,8 @@
 <head>
 <meta http-equiv="Content-Type" content="text/html; charset=US-ASCII">
 <title>for_each</title>
-<link rel="stylesheet" href="../../../../../../../../doc/html/boostbook.css" type="text/css">
-<meta name="generator" content="DocBook XSL Stylesheets V1.75.1">
+<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="../new.html" title="New algorithms">
 <link rel="prev" href="erase.html" title="erase">
@@ -13,21 +13,21 @@
 <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="../../../../../../../libraries.htm">Libraries</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="erase.html"><img src="../../../../../../../../doc/html/images/prev.png" alt="Prev"></a><a accesskey="u" href="../new.html"><img src="../../../../../../../../doc/html/images/up.png" alt="Up"></a><a accesskey="h" href="../../../../index.html"><img src="../../../../../../../../doc/html/images/home.png" alt="Home"></a><a accesskey="n" href="insert.html"><img src="../../../../../../../../doc/html/images/next.png" alt="Next"></a>
+<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" title="for_each">
+<div class="section">
 <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="id2785205"></a>
+<a name="id3360764"></a>
             <a class="link" href="for_each.html#range.reference.algorithms.new.for_each.prototype">Prototype</a>
           </h6>
 <p>
@@ -72,7 +72,7 @@
 <p>
           </p>
 <a name="range.reference.algorithms.new.for_each.description"></a><h6>
-<a name="id2785786"></a>
+<a name="id3361346"></a>
             <a class="link" href="for_each.html#range.reference.algorithms.new.for_each.description">Description</a>
           </h6>
 <p>
@@ -88,44 +88,44 @@
             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="id2785949"></a>
+<a name="id3361508"></a>
             <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="id2786021"></a>
+<a name="id3361580"></a>
             <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">
-<code class="computeroutput"><span class="identifier">SinglePassRange1</span></code> is
-              a model of the <a class="link" href="../../../concepts/single_pass_range.html" title="Single Pass Range">Single
-              Pass Range</a> Concept.
-            </li>
+                <code class="computeroutput"><span class="identifier">SinglePassRange1</span></code>
+                is a model of the <a class="link" href="../../../concepts/single_pass_range.html" title="Single Pass Range">Single
+                Pass Range</a> Concept.
+              </li>
 <li class="listitem">
-<code class="computeroutput"><span class="identifier">SinglePassRange2</span></code> is
-              a model of the <a class="link" href="../../../concepts/single_pass_range.html" title="Single Pass Range">Single
-              Pass Range</a> Concept.
-            </li>
+                <code class="computeroutput"><span class="identifier">SinglePassRange2</span></code>
+                is a model of the <a class="link" href="../../../concepts/single_pass_range.html" title="Single Pass Range">Single
+                Pass Range</a> Concept.
+              </li>
 <li class="listitem">
-<code class="computeroutput"><span class="identifier">BinaryFunction</span></code> is a
-              model of the <code class="computeroutput"><span class="identifier">BinaryFunctionConcept</span></code>.
-            </li>
+                <code class="computeroutput"><span class="identifier">BinaryFunction</span></code> is
+                a model of the <code class="computeroutput"><span class="identifier">BinaryFunctionConcept</span></code>.
+              </li>
 <li class="listitem">
-<code class="computeroutput"><span class="identifier">SinglePassRange1</span></code>'s
-              value type is convertible to <code class="computeroutput"><span class="identifier">BinaryFunction</span></code>'s
-              first argument type.
-            </li>
+                <code class="computeroutput"><span class="identifier">SinglePassRange1</span></code>'s
+                value type is convertible to <code class="computeroutput"><span class="identifier">BinaryFunction</span></code>'s
+                first argument type.
+              </li>
 <li class="listitem">
-<code class="computeroutput"><span class="identifier">SinglepassRange2</span></code>'s
-              value type is convertible to <code class="computeroutput"><span class="identifier">BinaryFunction</span></code>'s
-              second argument type.
-            </li>
+                <code class="computeroutput"><span class="identifier">SinglepassRange2</span></code>'s
+                value type is convertible to <code class="computeroutput"><span class="identifier">BinaryFunction</span></code>'s
+                second argument type.
+              </li>
 </ol></div>
 <a name="range.reference.algorithms.new.for_each.complexity"></a><h6>
-<a name="id2786176"></a>
+<a name="id3361752"></a>
             <a class="link" href="for_each.html#range.reference.algorithms.new.for_each.complexity">Complexity</a>
           </h6>
 <p>
@@ -143,7 +143,7 @@
 </tr></table>
 <hr>
 <div class="spirit-nav">
-<a accesskey="p" href="erase.html"><img src="../../../../../../../../doc/html/images/prev.png" alt="Prev"></a><a accesskey="u" href="../new.html"><img src="../../../../../../../../doc/html/images/up.png" alt="Up"></a><a accesskey="h" href="../../../../index.html"><img src="../../../../../../../../doc/html/images/home.png" alt="Home"></a><a accesskey="n" href="insert.html"><img src="../../../../../../../../doc/html/images/next.png" alt="Next"></a>
+<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>
 </body>
 </html>
diff --git a/doc/html/range/reference/algorithms/new/insert.html b/doc/html/range/reference/algorithms/new/insert.html
index 013ca65..7da8357 100644
--- a/doc/html/range/reference/algorithms/new/insert.html
+++ b/doc/html/range/reference/algorithms/new/insert.html
@@ -2,8 +2,8 @@
 <head>
 <meta http-equiv="Content-Type" content="text/html; charset=US-ASCII">
 <title>insert</title>
-<link rel="stylesheet" href="../../../../../../../../doc/html/boostbook.css" type="text/css">
-<meta name="generator" content="DocBook XSL Stylesheets V1.75.1">
+<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="../new.html" title="New algorithms">
 <link rel="prev" href="for_each.html" title="for_each">
@@ -13,21 +13,21 @@
 <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="../../../../../../../libraries.htm">Libraries</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="for_each.html"><img src="../../../../../../../../doc/html/images/prev.png" alt="Prev"></a><a accesskey="u" href="../new.html"><img src="../../../../../../../../doc/html/images/up.png" alt="Up"></a><a accesskey="h" href="../../../../index.html"><img src="../../../../../../../../doc/html/images/home.png" alt="Home"></a><a accesskey="n" href="iota.html"><img src="../../../../../../../../doc/html/images/next.png" alt="Next"></a>
+<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" title="insert">
+<div class="section">
 <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="id2786284"></a>
+<a name="id3361860"></a>
             <a class="link" href="insert.html#range.reference.algorithms.new.insert.prototype">Prototype</a>
           </h6>
 <p>
@@ -44,7 +44,7 @@
 <p>
           </p>
 <a name="range.reference.algorithms.new.insert.description"></a><h6>
-<a name="id2786456"></a>
+<a name="id3362031"></a>
             <a class="link" href="insert.html#range.reference.algorithms.new.insert.description">Description</a>
           </h6>
 <p>
@@ -54,34 +54,34 @@
             <code class="computeroutput"><span class="identifier">target</span></code>.
           </p>
 <a name="range.reference.algorithms.new.insert.definition"></a><h6>
-<a name="id2786526"></a>
+<a name="id3362101"></a>
             <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="id2786598"></a>
+<a name="id3362173"></a>
             <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">
-<code class="computeroutput"><span class="identifier">SinglePassRange</span></code> is
-              a model of the <a class="link" href="../../../concepts/single_pass_range.html" title="Single Pass Range">Single
-              Pass Range</a> Concept.
-            </li>
+                <code class="computeroutput"><span class="identifier">SinglePassRange</span></code> is
+                a model of the <a class="link" href="../../../concepts/single_pass_range.html" title="Single Pass Range">Single
+                Pass Range</a> Concept.
+              </li>
 <li class="listitem">
-<code class="computeroutput"><span class="identifier">Container</span></code> supports
-              insert at a specified position.
-            </li>
+                <code class="computeroutput"><span class="identifier">Container</span></code> supports
+                insert at a specified position.
+              </li>
 <li class="listitem">
-<code class="computeroutput"><span class="identifier">SinglePassRange</span></code>'s value
-              type is convertible to <code class="computeroutput"><span class="identifier">Container</span></code>'s
-              value type.
-            </li>
+                <code class="computeroutput"><span class="identifier">SinglePassRange</span></code>'s
+                value type is convertible to <code class="computeroutput"><span class="identifier">Container</span></code>'s
+                value type.
+              </li>
 </ol></div>
 <a name="range.reference.algorithms.new.insert.complexity"></a><h6>
-<a name="id2786690"></a>
+<a name="id3362277"></a>
             <a class="link" href="insert.html#range.reference.algorithms.new.insert.complexity">Complexity</a>
           </h6>
 <p>
@@ -99,7 +99,7 @@
 </tr></table>
 <hr>
 <div class="spirit-nav">
-<a accesskey="p" href="for_each.html"><img src="../../../../../../../../doc/html/images/prev.png" alt="Prev"></a><a accesskey="u" href="../new.html"><img src="../../../../../../../../doc/html/images/up.png" alt="Up"></a><a accesskey="h" href="../../../../index.html"><img src="../../../../../../../../doc/html/images/home.png" alt="Home"></a><a accesskey="n" href="iota.html"><img src="../../../../../../../../doc/html/images/next.png" alt="Next"></a>
+<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>
 </body>
 </html>
diff --git a/doc/html/range/reference/algorithms/new/iota.html b/doc/html/range/reference/algorithms/new/iota.html
index 00613b2..8693b0b 100644
--- a/doc/html/range/reference/algorithms/new/iota.html
+++ b/doc/html/range/reference/algorithms/new/iota.html
@@ -2,8 +2,8 @@
 <head>
 <meta http-equiv="Content-Type" content="text/html; charset=US-ASCII">
 <title>iota</title>
-<link rel="stylesheet" href="../../../../../../../../doc/html/boostbook.css" type="text/css">
-<meta name="generator" content="DocBook XSL Stylesheets V1.75.1">
+<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="../new.html" title="New algorithms">
 <link rel="prev" href="insert.html" title="insert">
@@ -13,21 +13,21 @@
 <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="../../../../../../../libraries.htm">Libraries</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="insert.html"><img src="../../../../../../../../doc/html/images/prev.png" alt="Prev"></a><a accesskey="u" href="../new.html"><img src="../../../../../../../../doc/html/images/up.png" alt="Up"></a><a accesskey="h" href="../../../../index.html"><img src="../../../../../../../../doc/html/images/home.png" alt="Home"></a><a accesskey="n" href="is_sorted.html"><img src="../../../../../../../../doc/html/images/next.png" alt="Next"></a>
+<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" title="iota">
+<div class="section">
 <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="id2786760"></a>
+<a name="id3362344"></a>
             <a class="link" href="iota.html#range.reference.algorithms.new.iota.prototype">Prototype</a>
           </h6>
 <p>
@@ -39,7 +39,7 @@
 <p>
           </p>
 <a name="range.reference.algorithms.new.iota.description"></a><h6>
-<a name="id2786887"></a>
+<a name="id3362473"></a>
             <a class="link" href="iota.html#range.reference.algorithms.new.iota.description">Description</a>
           </h6>
 <p>
@@ -50,29 +50,30 @@
             <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="id2787028"></a>
+<a name="id3362614"></a>
             <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="id2787100"></a>
+<a name="id3362686"></a>
             <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">
-<code class="computeroutput"><span class="identifier">ForwardRange</span></code> is a model
-              of the <a class="link" href="../../../concepts/forward_range.html" title="Forward Range">Forward Range</a>
-              Concept.
-            </li>
+                <code class="computeroutput"><span class="identifier">ForwardRange</span></code> is a
+                model of the <a class="link" href="../../../concepts/forward_range.html" title="Forward Range">Forward
+                Range</a> Concept.
+              </li>
 <li class="listitem">
-<code class="computeroutput"><span class="identifier">Value</span></code> is a model of
-              the <code class="computeroutput"><span class="identifier">Incrementable</span></code> Concept.
-            </li>
+                <code class="computeroutput"><span class="identifier">Value</span></code> is a model
+                of the <code class="computeroutput"><span class="identifier">Incrementable</span></code>
+                Concept.
+              </li>
 </ol></div>
 <a name="range.reference.algorithms.new.iota.complexity"></a><h6>
-<a name="id2787177"></a>
+<a name="id3362769"></a>
             <a class="link" href="iota.html#range.reference.algorithms.new.iota.complexity">Complexity</a>
           </h6>
 <p>
@@ -89,7 +90,7 @@
 </tr></table>
 <hr>
 <div class="spirit-nav">
-<a accesskey="p" href="insert.html"><img src="../../../../../../../../doc/html/images/prev.png" alt="Prev"></a><a accesskey="u" href="../new.html"><img src="../../../../../../../../doc/html/images/up.png" alt="Up"></a><a accesskey="h" href="../../../../index.html"><img src="../../../../../../../../doc/html/images/home.png" alt="Home"></a><a accesskey="n" href="is_sorted.html"><img src="../../../../../../../../doc/html/images/next.png" alt="Next"></a>
+<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>
 </body>
 </html>
diff --git a/doc/html/range/reference/algorithms/new/is_sorted.html b/doc/html/range/reference/algorithms/new/is_sorted.html
index 167665d..f5a2462 100644
--- a/doc/html/range/reference/algorithms/new/is_sorted.html
+++ b/doc/html/range/reference/algorithms/new/is_sorted.html
@@ -2,8 +2,8 @@
 <head>
 <meta http-equiv="Content-Type" content="text/html; charset=US-ASCII">
 <title>is_sorted</title>
-<link rel="stylesheet" href="../../../../../../../../doc/html/boostbook.css" type="text/css">
-<meta name="generator" content="DocBook XSL Stylesheets V1.75.1">
+<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="../new.html" title="New algorithms">
 <link rel="prev" href="iota.html" title="iota">
@@ -13,21 +13,21 @@
 <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="../../../../../../../libraries.htm">Libraries</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="iota.html"><img src="../../../../../../../../doc/html/images/prev.png" alt="Prev"></a><a accesskey="u" href="../new.html"><img src="../../../../../../../../doc/html/images/up.png" alt="Up"></a><a accesskey="h" href="../../../../index.html"><img src="../../../../../../../../doc/html/images/home.png" alt="Home"></a><a accesskey="n" href="overwrite.html"><img src="../../../../../../../../doc/html/images/next.png" alt="Next"></a>
+<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" title="is_sorted">
+<div class="section">
 <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="id2787256"></a>
+<a name="id3362848"></a>
             <a class="link" href="is_sorted.html#range.reference.algorithms.new.is_sorted.prototype">Prototype</a>
           </h6>
 <p>
@@ -42,7 +42,7 @@
 <p>
           </p>
 <a name="range.reference.algorithms.new.is_sorted.description"></a><h6>
-<a name="id2787451"></a>
+<a name="id3363044"></a>
             <a class="link" href="is_sorted.html#range.reference.algorithms.new.is_sorted.description">Description</a>
           </h6>
 <p>
@@ -58,34 +58,34 @@
             is <code class="computeroutput"><span class="keyword">true</span></code>.
           </p>
 <a name="range.reference.algorithms.new.is_sorted.definition"></a><h6>
-<a name="id2787648"></a>
+<a name="id3363240"></a>
             <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="id2787720"></a>
+<a name="id3363312"></a>
             <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">
-<code class="computeroutput"><span class="identifier">SinglePassRange</span></code> is
-              a model of the <a class="link" href="../../../concepts/single_pass_range.html" title="Single Pass Range">Single
-              Pass Range</a> Concept.
-            </li>
+                <code class="computeroutput"><span class="identifier">SinglePassRange</span></code> is
+                a model of the <a class="link" href="../../../concepts/single_pass_range.html" title="Single Pass Range">Single
+                Pass Range</a> Concept.
+              </li>
 <li class="listitem">
-<code class="computeroutput"><span class="identifier">BinaryPredicate</span></code> is
-              a model of the <code class="computeroutput"><span class="identifier">BinaryPredicate</span></code>
-              Concept.
-            </li>
+                <code class="computeroutput"><span class="identifier">BinaryPredicate</span></code> is
+                a model of the <code class="computeroutput"><span class="identifier">BinaryPredicate</span></code>
+                Concept.
+              </li>
 <li class="listitem">
-              The value type of <code class="computeroutput"><span class="identifier">SinglePassRange</span></code>
-              is convertible to both argument types of <code class="computeroutput"><span class="identifier">BinaryPredicate</span></code>.
-            </li>
+                The value type of <code class="computeroutput"><span class="identifier">SinglePassRange</span></code>
+                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="id2787827"></a>
+<a name="id3363428"></a>
             <a class="link" href="is_sorted.html#range.reference.algorithms.new.is_sorted.complexity">Complexity</a>
           </h6>
 <p>
@@ -102,7 +102,7 @@
 </tr></table>
 <hr>
 <div class="spirit-nav">
-<a accesskey="p" href="iota.html"><img src="../../../../../../../../doc/html/images/prev.png" alt="Prev"></a><a accesskey="u" href="../new.html"><img src="../../../../../../../../doc/html/images/up.png" alt="Up"></a><a accesskey="h" href="../../../../index.html"><img src="../../../../../../../../doc/html/images/home.png" alt="Home"></a><a accesskey="n" href="overwrite.html"><img src="../../../../../../../../doc/html/images/next.png" alt="Next"></a>
+<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>
 </body>
 </html>
diff --git a/doc/html/range/reference/algorithms/new/overwrite.html b/doc/html/range/reference/algorithms/new/overwrite.html
index 3ef0cfb..6072237 100644
--- a/doc/html/range/reference/algorithms/new/overwrite.html
+++ b/doc/html/range/reference/algorithms/new/overwrite.html
@@ -2,8 +2,8 @@
 <head>
 <meta http-equiv="Content-Type" content="text/html; charset=US-ASCII">
 <title>overwrite</title>
-<link rel="stylesheet" href="../../../../../../../../doc/html/boostbook.css" type="text/css">
-<meta name="generator" content="DocBook XSL Stylesheets V1.75.1">
+<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="../new.html" title="New algorithms">
 <link rel="prev" href="is_sorted.html" title="is_sorted">
@@ -13,21 +13,21 @@
 <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="../../../../../../../libraries.htm">Libraries</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="is_sorted.html"><img src="../../../../../../../../doc/html/images/prev.png" alt="Prev"></a><a accesskey="u" href="../new.html"><img src="../../../../../../../../doc/html/images/up.png" alt="Up"></a><a accesskey="h" href="../../../../index.html"><img src="../../../../../../../../doc/html/images/home.png" alt="Home"></a><a accesskey="n" href="push_back.html"><img src="../../../../../../../../doc/html/images/next.png" alt="Next"></a>
+<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" title="overwrite">
+<div class="section">
 <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="id2787894"></a>
+<a name="id3363496"></a>
             <a class="link" href="overwrite.html#range.reference.algorithms.new.overwrite.prototype">Prototype</a>
           </h6>
 <p>
@@ -43,7 +43,7 @@
 <p>
           </p>
 <a name="range.reference.algorithms.new.overwrite.description"></a><h6>
-<a name="id2788030"></a>
+<a name="id3363632"></a>
             <a class="link" href="overwrite.html#range.reference.algorithms.new.overwrite.description">Description</a>
           </h6>
 <p>
@@ -52,41 +52,43 @@
             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="id2788090"></a>
+<a name="id3363691"></a>
             <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="id2788162"></a>
+<a name="id3363763"></a>
             <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">
-<code class="computeroutput"><span class="identifier">SinglePassRange1</span></code> is
-              a model of the <a class="link" href="../../../concepts/single_pass_range.html" title="Single Pass Range">Single
-              Pass Range</a> Concept.
-            </li>
+                <code class="computeroutput"><span class="identifier">SinglePassRange1</span></code>
+                is a model of the <a class="link" href="../../../concepts/single_pass_range.html" title="Single Pass Range">Single
+                Pass Range</a> Concept.
+              </li>
 <li class="listitem">
-<code class="computeroutput"><span class="identifier">SinglePassRange2</span></code> is
-              a model of the <a class="link" href="../../../concepts/single_pass_range.html" title="Single Pass Range">Single
-              Pass Range</a> Concept.
-            </li>
+                <code class="computeroutput"><span class="identifier">SinglePassRange2</span></code>
+                is a model of the <a class="link" href="../../../concepts/single_pass_range.html" title="Single Pass Range">Single
+                Pass Range</a> Concept.
+              </li>
 <li class="listitem">
-<code class="computeroutput"><span class="identifier">SinglePassRange2</span></code> is
-              mutable.
-            </li>
-<li class="listitem"><code class="computeroutput"><span class="identifier">distance</span><span class="special">(</span><span class="identifier">SinglePassRange1</span><span class="special">)</span>
-              <span class="special">&lt;=</span> <span class="identifier">distance</span><span class="special">(</span><span class="identifier">SinglePassRange2</span><span class="special">)</span></code></li>
+                <code class="computeroutput"><span class="identifier">SinglePassRange2</span></code>
+                is mutable.
+              </li>
 <li class="listitem">
-<code class="computeroutput"><span class="identifier">SinglePassRange1</span></code>'s
-              value type is convertible to <code class="computeroutput"><span class="identifier">SinglePassRange2</span></code>'s
-              value type.
-            </li>
+                <code class="computeroutput"><span class="identifier">distance</span><span class="special">(</span><span class="identifier">SinglePassRange1</span><span class="special">)</span>
+                <span class="special">&lt;=</span> <span class="identifier">distance</span><span class="special">(</span><span class="identifier">SinglePassRange2</span><span class="special">)</span></code>
+              </li>
+<li class="listitem">
+                <code class="computeroutput"><span class="identifier">SinglePassRange1</span></code>'s
+                value type is convertible to <code class="computeroutput"><span class="identifier">SinglePassRange2</span></code>'s
+                value type.
+              </li>
 </ol></div>
 <a name="range.reference.algorithms.new.overwrite.complexity"></a><h6>
-<a name="id2788331"></a>
+<a name="id3363949"></a>
             <a class="link" href="overwrite.html#range.reference.algorithms.new.overwrite.complexity">Complexity</a>
           </h6>
 <p>
@@ -104,7 +106,7 @@
 </tr></table>
 <hr>
 <div class="spirit-nav">
-<a accesskey="p" href="is_sorted.html"><img src="../../../../../../../../doc/html/images/prev.png" alt="Prev"></a><a accesskey="u" href="../new.html"><img src="../../../../../../../../doc/html/images/up.png" alt="Up"></a><a accesskey="h" href="../../../../index.html"><img src="../../../../../../../../doc/html/images/home.png" alt="Home"></a><a accesskey="n" href="push_back.html"><img src="../../../../../../../../doc/html/images/next.png" alt="Next"></a>
+<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>
 </body>
 </html>
diff --git a/doc/html/range/reference/algorithms/new/push_back.html b/doc/html/range/reference/algorithms/new/push_back.html
index b5a0ff1..ecd5949 100644
--- a/doc/html/range/reference/algorithms/new/push_back.html
+++ b/doc/html/range/reference/algorithms/new/push_back.html
@@ -2,8 +2,8 @@
 <head>
 <meta http-equiv="Content-Type" content="text/html; charset=US-ASCII">
 <title>push_back</title>
-<link rel="stylesheet" href="../../../../../../../../doc/html/boostbook.css" type="text/css">
-<meta name="generator" content="DocBook XSL Stylesheets V1.75.1">
+<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="../new.html" title="New algorithms">
 <link rel="prev" href="overwrite.html" title="overwrite">
@@ -13,21 +13,21 @@
 <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="../../../../../../../libraries.htm">Libraries</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="overwrite.html"><img src="../../../../../../../../doc/html/images/prev.png" alt="Prev"></a><a accesskey="u" href="../new.html"><img src="../../../../../../../../doc/html/images/up.png" alt="Up"></a><a accesskey="h" href="../../../../index.html"><img src="../../../../../../../../doc/html/images/home.png" alt="Home"></a><a accesskey="n" href="push_front.html"><img src="../../../../../../../../doc/html/images/next.png" alt="Next"></a>
+<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" title="push_back">
+<div class="section">
 <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="id2788400"></a>
+<a name="id3364018"></a>
             <a class="link" href="push_back.html#range.reference.algorithms.new.push_back.prototype">Prototype</a>
           </h6>
 <p>
@@ -43,7 +43,7 @@
 <p>
           </p>
 <a name="range.reference.algorithms.new.push_back.description"></a><h6>
-<a name="id2788540"></a>
+<a name="id3364158"></a>
             <a class="link" href="push_back.html#range.reference.algorithms.new.push_back.description">Description</a>
           </h6>
 <p>
@@ -52,34 +52,34 @@
             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="id2788601"></a>
+<a name="id3364218"></a>
             <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="id2788672"></a>
+<a name="id3364290"></a>
             <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">
-<code class="computeroutput"><span class="identifier">SinglePassRange</span></code> is
-              a model of the <a class="link" href="../../../concepts/single_pass_range.html" title="Single Pass Range">Single
-              Pass Range</a> Concept.
-            </li>
+                <code class="computeroutput"><span class="identifier">SinglePassRange</span></code> is
+                a model of the <a class="link" href="../../../concepts/single_pass_range.html" title="Single Pass Range">Single
+                Pass Range</a> Concept.
+              </li>
 <li class="listitem">
-<code class="computeroutput"><span class="identifier">Container</span></code> supports
-              insert at <code class="computeroutput"><span class="identifier">end</span><span class="special">()</span></code>.
-            </li>
+                <code class="computeroutput"><span class="identifier">Container</span></code> supports
+                insert at <code class="computeroutput"><span class="identifier">end</span><span class="special">()</span></code>.
+              </li>
 <li class="listitem">
-<code class="computeroutput"><span class="identifier">SinglePassRange</span></code>'s value
-              type is convertible to <code class="computeroutput"><span class="identifier">Container</span></code>'s
-              value type.
-            </li>
+                <code class="computeroutput"><span class="identifier">SinglePassRange</span></code>'s
+                value type is convertible to <code class="computeroutput"><span class="identifier">Container</span></code>'s
+                value type.
+              </li>
 </ol></div>
 <a name="range.reference.algorithms.new.push_back.complexity"></a><h6>
-<a name="id2788781"></a>
+<a name="id3364410"></a>
             <a class="link" href="push_back.html#range.reference.algorithms.new.push_back.complexity">Complexity</a>
           </h6>
 <p>
@@ -97,7 +97,7 @@
 </tr></table>
 <hr>
 <div class="spirit-nav">
-<a accesskey="p" href="overwrite.html"><img src="../../../../../../../../doc/html/images/prev.png" alt="Prev"></a><a accesskey="u" href="../new.html"><img src="../../../../../../../../doc/html/images/up.png" alt="Up"></a><a accesskey="h" href="../../../../index.html"><img src="../../../../../../../../doc/html/images/home.png" alt="Home"></a><a accesskey="n" href="push_front.html"><img src="../../../../../../../../doc/html/images/next.png" alt="Next"></a>
+<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>
 </body>
 </html>
diff --git a/doc/html/range/reference/algorithms/new/push_front.html b/doc/html/range/reference/algorithms/new/push_front.html
index a8b3381..13e2fe4 100644
--- a/doc/html/range/reference/algorithms/new/push_front.html
+++ b/doc/html/range/reference/algorithms/new/push_front.html
@@ -2,8 +2,8 @@
 <head>
 <meta http-equiv="Content-Type" content="text/html; charset=US-ASCII">
 <title>push_front</title>
-<link rel="stylesheet" href="../../../../../../../../doc/html/boostbook.css" type="text/css">
-<meta name="generator" content="DocBook XSL Stylesheets V1.75.1">
+<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="../new.html" title="New algorithms">
 <link rel="prev" href="push_back.html" title="push_back">
@@ -13,21 +13,21 @@
 <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="../../../../../../../libraries.htm">Libraries</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="push_back.html"><img src="../../../../../../../../doc/html/images/prev.png" alt="Prev"></a><a accesskey="u" href="../new.html"><img src="../../../../../../../../doc/html/images/up.png" alt="Up"></a><a accesskey="h" href="../../../../index.html"><img src="../../../../../../../../doc/html/images/home.png" alt="Home"></a><a accesskey="n" href="remove_erase.html"><img src="../../../../../../../../doc/html/images/next.png" alt="Next"></a>
+<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" title="push_front">
+<div class="section">
 <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="id2788851"></a>
+<a name="id3364478"></a>
             <a class="link" href="push_front.html#range.reference.algorithms.new.push_front.prototype">Prototype</a>
           </h6>
 <p>
@@ -43,7 +43,7 @@
 <p>
           </p>
 <a name="range.reference.algorithms.new.push_front.description"></a><h6>
-<a name="id2788990"></a>
+<a name="id3364617"></a>
             <a class="link" href="push_front.html#range.reference.algorithms.new.push_front.description">Description</a>
           </h6>
 <p>
@@ -52,34 +52,34 @@
             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="id2789049"></a>
+<a name="id3364677"></a>
             <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="id2789122"></a>
+<a name="id3364750"></a>
             <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">
-<code class="computeroutput"><span class="identifier">SinglePassRange</span></code> is
-              a model of the <a class="link" href="../../../concepts/single_pass_range.html" title="Single Pass Range">Single
-              Pass Range</a> Concept.
-            </li>
+                <code class="computeroutput"><span class="identifier">SinglePassRange</span></code> is
+                a model of the <a class="link" href="../../../concepts/single_pass_range.html" title="Single Pass Range">Single
+                Pass Range</a> Concept.
+              </li>
 <li class="listitem">
-<code class="computeroutput"><span class="identifier">Container</span></code> supports
-              insert at <code class="computeroutput"><span class="identifier">begin</span><span class="special">()</span></code>.
-            </li>
+                <code class="computeroutput"><span class="identifier">Container</span></code> supports
+                insert at <code class="computeroutput"><span class="identifier">begin</span><span class="special">()</span></code>.
+              </li>
 <li class="listitem">
-<code class="computeroutput"><span class="identifier">SinglePassRange</span></code>'s value
-              type is convertible to <code class="computeroutput"><span class="identifier">Container</span></code>'s
-              value type.
-            </li>
+                <code class="computeroutput"><span class="identifier">SinglePassRange</span></code>'s
+                value type is convertible to <code class="computeroutput"><span class="identifier">Container</span></code>'s
+                value type.
+              </li>
 </ol></div>
 <a name="range.reference.algorithms.new.push_front.complexity"></a><h6>
-<a name="id2789230"></a>
+<a name="id3364869"></a>
             <a class="link" href="push_front.html#range.reference.algorithms.new.push_front.complexity">Complexity</a>
           </h6>
 <p>
@@ -97,7 +97,7 @@
 </tr></table>
 <hr>
 <div class="spirit-nav">
-<a accesskey="p" href="push_back.html"><img src="../../../../../../../../doc/html/images/prev.png" alt="Prev"></a><a accesskey="u" href="../new.html"><img src="../../../../../../../../doc/html/images/up.png" alt="Up"></a><a accesskey="h" href="../../../../index.html"><img src="../../../../../../../../doc/html/images/home.png" alt="Home"></a><a accesskey="n" href="remove_erase.html"><img src="../../../../../../../../doc/html/images/next.png" alt="Next"></a>
+<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>
 </body>
 </html>
diff --git a/doc/html/range/reference/algorithms/new/remove_erase.html b/doc/html/range/reference/algorithms/new/remove_erase.html
index 6dd59be..0982bc7 100644
--- a/doc/html/range/reference/algorithms/new/remove_erase.html
+++ b/doc/html/range/reference/algorithms/new/remove_erase.html
@@ -2,8 +2,8 @@
 <head>
 <meta http-equiv="Content-Type" content="text/html; charset=US-ASCII">
 <title>remove_erase</title>
-<link rel="stylesheet" href="../../../../../../../../doc/html/boostbook.css" type="text/css">
-<meta name="generator" content="DocBook XSL Stylesheets V1.75.1">
+<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="../new.html" title="New algorithms">
 <link rel="prev" href="push_front.html" title="push_front">
@@ -13,21 +13,21 @@
 <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="../../../../../../../libraries.htm">Libraries</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="push_front.html"><img src="../../../../../../../../doc/html/images/prev.png" alt="Prev"></a><a accesskey="u" href="../new.html"><img src="../../../../../../../../doc/html/images/up.png" alt="Up"></a><a accesskey="h" href="../../../../index.html"><img src="../../../../../../../../doc/html/images/home.png" alt="Home"></a><a accesskey="n" href="remove_erase_if.html"><img src="../../../../../../../../doc/html/images/next.png" alt="Next"></a>
+<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" title="remove_erase">
+<div class="section">
 <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="id2789301"></a>
+<a name="id3364938"></a>
             <a class="link" href="remove_erase.html#range.reference.algorithms.new.remove_erase.prototype">Prototype</a>
           </h6>
 <p>
@@ -40,7 +40,7 @@
 <p>
           </p>
 <a name="range.reference.algorithms.new.remove_erase.description"></a><h6>
-<a name="id2789440"></a>
+<a name="id3365078"></a>
             <a class="link" href="remove_erase.html#range.reference.algorithms.new.remove_erase.description">Description</a>
           </h6>
 <p>
@@ -50,22 +50,22 @@
             algorithm which merely rearranges elements.
           </p>
 <a name="range.reference.algorithms.new.remove_erase.definition"></a><h6>
-<a name="id2789501"></a>
+<a name="id3365139"></a>
             <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="id2789574"></a>
+<a name="id3365211"></a>
             <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>
+                <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="id2789618"></a>
+<a name="id3365260"></a>
             <a class="link" href="remove_erase.html#range.reference.algorithms.new.remove_erase.complexity">Complexity</a>
           </h6>
 <p>
@@ -82,7 +82,7 @@
 </tr></table>
 <hr>
 <div class="spirit-nav">
-<a accesskey="p" href="push_front.html"><img src="../../../../../../../../doc/html/images/prev.png" alt="Prev"></a><a accesskey="u" href="../new.html"><img src="../../../../../../../../doc/html/images/up.png" alt="Up"></a><a accesskey="h" href="../../../../index.html"><img src="../../../../../../../../doc/html/images/home.png" alt="Home"></a><a accesskey="n" href="remove_erase_if.html"><img src="../../../../../../../../doc/html/images/next.png" alt="Next"></a>
+<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>
 </body>
 </html>
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 ab20e8f..b9f2d9a 100644
--- a/doc/html/range/reference/algorithms/new/remove_erase_if.html
+++ b/doc/html/range/reference/algorithms/new/remove_erase_if.html
@@ -2,8 +2,8 @@
 <head>
 <meta http-equiv="Content-Type" content="text/html; charset=US-ASCII">
 <title>remove_erase_if</title>
-<link rel="stylesheet" href="../../../../../../../../doc/html/boostbook.css" type="text/css">
-<meta name="generator" content="DocBook XSL Stylesheets V1.75.1">
+<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="../new.html" title="New algorithms">
 <link rel="prev" href="remove_erase.html" title="remove_erase">
@@ -13,22 +13,22 @@
 <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="../../../../../../../libraries.htm">Libraries</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="remove_erase.html"><img src="../../../../../../../../doc/html/images/prev.png" alt="Prev"></a><a accesskey="u" href="../new.html"><img src="../../../../../../../../doc/html/images/up.png" alt="Up"></a><a accesskey="h" href="../../../../index.html"><img src="../../../../../../../../doc/html/images/home.png" alt="Home"></a><a accesskey="n" href="../numeric.html"><img src="../../../../../../../../doc/html/images/next.png" alt="Next"></a>
+<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" title="remove_erase_if">
+<div class="section">
 <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="id2789688"></a>
+<a name="id3365329"></a>
             <a class="link" href="remove_erase_if.html#range.reference.algorithms.new.remove_erase_if.prototype">Prototype</a>
           </h6>
 <p>
@@ -41,7 +41,7 @@
 <p>
           </p>
 <a name="range.reference.algorithms.new.remove_erase_if.description"></a><h6>
-<a name="id2789817"></a>
+<a name="id3365458"></a>
             <a class="link" href="remove_erase_if.html#range.reference.algorithms.new.remove_erase_if.description">Description</a>
           </h6>
 <p>
@@ -52,28 +52,28 @@
             algorithm which merely rearranges elements.
           </p>
 <a name="range.reference.algorithms.new.remove_erase_if.definition"></a><h6>
-<a name="id2789902"></a>
+<a name="id3365543"></a>
             <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="id2789974"></a>
+<a name="id3365615"></a>
             <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">
-<code class="computeroutput"><span class="identifier">Container</span></code> supports
-              erase of an iterator range.
-            </li>
+                <code class="computeroutput"><span class="identifier">Container</span></code> supports
+                erase of an iterator range.
+              </li>
 <li class="listitem">
-<code class="computeroutput"><span class="identifier">Pred</span></code> is a model of
-              the <code class="computeroutput"><span class="identifier">Predicate</span></code> Concept.
-            </li>
+                <code class="computeroutput"><span class="identifier">Pred</span></code> is a model of
+                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="id2790045"></a>
+<a name="id3365693"></a>
             <a class="link" href="remove_erase_if.html#range.reference.algorithms.new.remove_erase_if.complexity">Complexity</a>
           </h6>
 <p>
@@ -90,7 +90,7 @@
 </tr></table>
 <hr>
 <div class="spirit-nav">
-<a accesskey="p" href="remove_erase.html"><img src="../../../../../../../../doc/html/images/prev.png" alt="Prev"></a><a accesskey="u" href="../new.html"><img src="../../../../../../../../doc/html/images/up.png" alt="Up"></a><a accesskey="h" href="../../../../index.html"><img src="../../../../../../../../doc/html/images/home.png" alt="Home"></a><a accesskey="n" href="../numeric.html"><img src="../../../../../../../../doc/html/images/next.png" alt="Next"></a>
+<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>
 </body>
 </html>
diff --git a/doc/html/range/reference/algorithms/non_mutating.html b/doc/html/range/reference/algorithms/non_mutating.html
index f25a857..ef22f2d 100644
--- a/doc/html/range/reference/algorithms/non_mutating.html
+++ b/doc/html/range/reference/algorithms/non_mutating.html
@@ -2,8 +2,8 @@
 <head>
 <meta http-equiv="Content-Type" content="text/html; charset=US-ASCII">
 <title>Non-mutating algorithms</title>
-<link rel="stylesheet" href="../../../../../../../doc/html/boostbook.css" type="text/css">
-<meta name="generator" content="DocBook XSL Stylesheets V1.75.1">
+<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="../algorithms.html" title="Range Algorithm">
 <link rel="prev" href="mutating/unique_copy.html" title="unique_copy">
@@ -13,16 +13,16 @@
 <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="../../../../../../libraries.htm">Libraries</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="mutating/unique_copy.html"><img src="../../../../../../../doc/html/images/prev.png" alt="Prev"></a><a accesskey="u" href="../algorithms.html"><img src="../../../../../../../doc/html/images/up.png" alt="Up"></a><a accesskey="h" href="../../../index.html"><img src="../../../../../../../doc/html/images/home.png" alt="Home"></a><a accesskey="n" href="non_mutating/adjacent_find.html"><img src="../../../../../../../doc/html/images/next.png" alt="Next"></a>
+<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" title="Non-mutating algorithms">
+<div class="section">
 <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>
@@ -75,7 +75,7 @@
 </tr></table>
 <hr>
 <div class="spirit-nav">
-<a accesskey="p" href="mutating/unique_copy.html"><img src="../../../../../../../doc/html/images/prev.png" alt="Prev"></a><a accesskey="u" href="../algorithms.html"><img src="../../../../../../../doc/html/images/up.png" alt="Up"></a><a accesskey="h" href="../../../index.html"><img src="../../../../../../../doc/html/images/home.png" alt="Home"></a><a accesskey="n" href="non_mutating/adjacent_find.html"><img src="../../../../../../../doc/html/images/next.png" alt="Next"></a>
+<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>
 </body>
 </html>
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 4bece6d..c909827 100644
--- a/doc/html/range/reference/algorithms/non_mutating/adjacent_find.html
+++ b/doc/html/range/reference/algorithms/non_mutating/adjacent_find.html
@@ -2,8 +2,8 @@
 <head>
 <meta http-equiv="Content-Type" content="text/html; charset=US-ASCII">
 <title>adjacent_find</title>
-<link rel="stylesheet" href="../../../../../../../../doc/html/boostbook.css" type="text/css">
-<meta name="generator" content="DocBook XSL Stylesheets V1.75.1">
+<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="../non_mutating.html" title="Non-mutating algorithms">
 <link rel="prev" href="../non_mutating.html" title="Non-mutating algorithms">
@@ -13,22 +13,22 @@
 <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="../../../../../../../libraries.htm">Libraries</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="../non_mutating.html"><img src="../../../../../../../../doc/html/images/prev.png" alt="Prev"></a><a accesskey="u" href="../non_mutating.html"><img src="../../../../../../../../doc/html/images/up.png" alt="Up"></a><a accesskey="h" href="../../../../index.html"><img src="../../../../../../../../doc/html/images/home.png" alt="Home"></a><a accesskey="n" href="binary_search.html"><img src="../../../../../../../../doc/html/images/next.png" alt="Next"></a>
+<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" title="adjacent_find">
+<div class="section">
 <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="id2750177"></a>
+<a name="id3324890"></a>
             <a class="link" href="adjacent_find.html#range.reference.algorithms.non_mutating.adjacent_find.prototype">Prototype</a>
           </h6>
 <p>
@@ -77,7 +77,7 @@
 <p>
           </p>
 <a name="range.reference.algorithms.non_mutating.adjacent_find.description"></a><h6>
-<a name="id2751163"></a>
+<a name="id3325877"></a>
             <a class="link" href="adjacent_find.html#range.reference.algorithms.non_mutating.adjacent_find.description">Description</a>
           </h6>
 <p>
@@ -98,14 +98,14 @@
             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="id2751377"></a>
+<a name="id3326090"></a>
             <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="id2751450"></a>
+<a name="id3326163"></a>
             <a class="link" href="adjacent_find.html#range.reference.algorithms.non_mutating.adjacent_find.requirements">Requirements</a>
           </h6>
 <p>
@@ -113,37 +113,37 @@
           </p>
 <div class="itemizedlist"><ul class="itemizedlist" type="disc">
 <li class="listitem">
-<code class="computeroutput"><span class="identifier">ForwardRange</span></code> is a model
-              of the <a class="link" href="../../../concepts/forward_range.html" title="Forward Range">Forward Range</a>
-              Concept.
-            </li>
+                <code class="computeroutput"><span class="identifier">ForwardRange</span></code> is a
+                model of the <a class="link" href="../../../concepts/forward_range.html" title="Forward Range">Forward
+                Range</a> Concept.
+              </li>
 <li class="listitem">
-<code class="computeroutput"><span class="identifier">ForwardRange</span></code>'s value
-              type is a model of the <code class="computeroutput"><span class="identifier">EqualityComparableConcept</span></code>.
-            </li>
+                <code class="computeroutput"><span class="identifier">ForwardRange</span></code>'s value
+                type is a model of the <code class="computeroutput"><span class="identifier">EqualityComparableConcept</span></code>.
+              </li>
 </ul></div>
 <p>
             <span class="bold"><strong>For the predicate versions of adjacent_find:</strong></span>
           </p>
 <div class="itemizedlist"><ul class="itemizedlist" type="disc">
 <li class="listitem">
-<code class="computeroutput"><span class="identifier">ForwardRange</span></code> is a model
-              of the <a class="link" href="../../../concepts/forward_range.html" title="Forward Range">Forward Range</a>
-              Concept.
-            </li>
+                <code class="computeroutput"><span class="identifier">ForwardRange</span></code> is a
+                model of the <a class="link" href="../../../concepts/forward_range.html" title="Forward Range">Forward
+                Range</a> Concept.
+              </li>
 <li class="listitem">
-<code class="computeroutput"><span class="identifier">BinaryPredicate</span></code> is
-              a model of the <code class="computeroutput"><span class="identifier">BinaryPredicateConcept</span></code>.
-            </li>
+                <code class="computeroutput"><span class="identifier">BinaryPredicate</span></code> is
+                a model of the <code class="computeroutput"><span class="identifier">BinaryPredicateConcept</span></code>.
+              </li>
 <li class="listitem">
-<code class="computeroutput"><span class="identifier">ForwardRange</span></code>'s value
-              type is convertible to <code class="computeroutput"><span class="identifier">BinaryPredicate</span></code>'s
-              first argument type and to <code class="computeroutput"><span class="identifier">BinaryPredicate</span></code>'s
-              second argument type.
-            </li>
+                <code class="computeroutput"><span class="identifier">ForwardRange</span></code>'s value
+                type is convertible to <code class="computeroutput"><span class="identifier">BinaryPredicate</span></code>'s
+                first argument type and to <code class="computeroutput"><span class="identifier">BinaryPredicate</span></code>'s
+                second argument type.
+              </li>
 </ul></div>
 <a name="range.reference.algorithms.non_mutating.adjacent_find.complexity"></a><h6>
-<a name="id2751634"></a>
+<a name="id3326363"></a>
             <a class="link" href="adjacent_find.html#range.reference.algorithms.non_mutating.adjacent_find.complexity">Complexity</a>
           </h6>
 <p>
@@ -162,7 +162,7 @@
 </tr></table>
 <hr>
 <div class="spirit-nav">
-<a accesskey="p" href="../non_mutating.html"><img src="../../../../../../../../doc/html/images/prev.png" alt="Prev"></a><a accesskey="u" href="../non_mutating.html"><img src="../../../../../../../../doc/html/images/up.png" alt="Up"></a><a accesskey="h" href="../../../../index.html"><img src="../../../../../../../../doc/html/images/home.png" alt="Home"></a><a accesskey="n" href="binary_search.html"><img src="../../../../../../../../doc/html/images/next.png" alt="Next"></a>
+<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>
 </body>
 </html>
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 fcbbbbb..96c6476 100644
--- a/doc/html/range/reference/algorithms/non_mutating/binary_search.html
+++ b/doc/html/range/reference/algorithms/non_mutating/binary_search.html
@@ -2,8 +2,8 @@
 <head>
 <meta http-equiv="Content-Type" content="text/html; charset=US-ASCII">
 <title>binary_search</title>
-<link rel="stylesheet" href="../../../../../../../../doc/html/boostbook.css" type="text/css">
-<meta name="generator" content="DocBook XSL Stylesheets V1.75.1">
+<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="../non_mutating.html" title="Non-mutating algorithms">
 <link rel="prev" href="adjacent_find.html" title="adjacent_find">
@@ -13,22 +13,22 @@
 <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="../../../../../../../libraries.htm">Libraries</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="adjacent_find.html"><img src="../../../../../../../../doc/html/images/prev.png" alt="Prev"></a><a accesskey="u" href="../non_mutating.html"><img src="../../../../../../../../doc/html/images/up.png" alt="Up"></a><a accesskey="h" href="../../../../index.html"><img src="../../../../../../../../doc/html/images/home.png" alt="Home"></a><a accesskey="n" href="count.html"><img src="../../../../../../../../doc/html/images/next.png" alt="Next"></a>
+<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" title="binary_search">
+<div class="section">
 <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="id2751739"></a>
+<a name="id3326468"></a>
             <a class="link" href="binary_search.html#range.reference.algorithms.non_mutating.binary_search.prototype">Prototype</a>
           </h6>
 <p>
@@ -43,7 +43,7 @@
 <p>
           </p>
 <a name="range.reference.algorithms.non_mutating.binary_search.description"></a><h6>
-<a name="id2752020"></a>
+<a name="id3326749"></a>
             <a class="link" href="binary_search.html#range.reference.algorithms.non_mutating.binary_search.description">Description</a>
           </h6>
 <p>
@@ -53,14 +53,14 @@
             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="id2752090"></a>
+<a name="id3326820"></a>
             <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="id2752164"></a>
+<a name="id3326894"></a>
             <a class="link" href="binary_search.html#range.reference.algorithms.non_mutating.binary_search.requirements">Requirements</a>
           </h6>
 <p>
@@ -68,50 +68,50 @@
           </p>
 <div class="itemizedlist"><ul class="itemizedlist" type="disc">
 <li class="listitem">
-<code class="computeroutput"><span class="identifier">ForwardRange</span></code> is a model
-              of the <a class="link" href="../../../concepts/forward_range.html" title="Forward Range">Forward Range</a>
-              Concept.
-            </li>
+                <code class="computeroutput"><span class="identifier">ForwardRange</span></code> is a
+                model of the <a class="link" href="../../../concepts/forward_range.html" title="Forward Range">Forward
+                Range</a> Concept.
+              </li>
 <li class="listitem">
-<code class="computeroutput"><span class="identifier">Value</span></code> is a model of
-              the <code class="computeroutput"><span class="identifier">LessThanComparableConcept</span></code>.
-            </li>
+                <code class="computeroutput"><span class="identifier">Value</span></code> is a model
+                of the <code class="computeroutput"><span class="identifier">LessThanComparableConcept</span></code>.
+              </li>
 <li class="listitem">
-              The ordering of objects of type <code class="computeroutput"><span class="identifier">Value</span></code>
-              is a <span class="bold"><strong><span class="emphasis"><em>strict weak ordering</em></span></strong></span>,
-              as defined in the <code class="computeroutput"><span class="identifier">LessThanComparableConcept</span></code>
-              requirements.
-            </li>
+                The ordering of objects of type <code class="computeroutput"><span class="identifier">Value</span></code>
+                is a <span class="bold"><strong><span class="emphasis"><em>strict weak ordering</em></span></strong></span>,
+                as defined in the <code class="computeroutput"><span class="identifier">LessThanComparableConcept</span></code>
+                requirements.
+              </li>
 <li class="listitem">
-<code class="computeroutput"><span class="identifier">ForwardRange</span></code>'s value
-              type is the same type as <code class="computeroutput"><span class="identifier">Value</span></code>.
-            </li>
+                <code class="computeroutput"><span class="identifier">ForwardRange</span></code>'s value
+                type is the same type as <code class="computeroutput"><span class="identifier">Value</span></code>.
+              </li>
 </ul></div>
 <p>
             <span class="bold"><strong>For the predicate versions of binary_search:</strong></span>
           </p>
 <div class="itemizedlist"><ul class="itemizedlist" type="disc">
 <li class="listitem">
-<code class="computeroutput"><span class="identifier">ForwardRange</span></code> is a model
-              of the <a class="link" href="../../../concepts/forward_range.html" title="Forward Range">Forward Range</a>
-              Concept.
-            </li>
+                <code class="computeroutput"><span class="identifier">ForwardRange</span></code> is a
+                model of the <a class="link" href="../../../concepts/forward_range.html" title="Forward Range">Forward
+                Range</a> Concept.
+              </li>
 <li class="listitem">
-<code class="computeroutput"><span class="identifier">BinaryPredicate</span></code> is
-              a model of the <code class="computeroutput"><span class="identifier">StrictWeakOrderingConcept</span></code>.
-            </li>
+                <code class="computeroutput"><span class="identifier">BinaryPredicate</span></code> is
+                a model of the <code class="computeroutput"><span class="identifier">StrictWeakOrderingConcept</span></code>.
+              </li>
 <li class="listitem">
-<code class="computeroutput"><span class="identifier">ForwardRange</span></code>'s value
-              type is the same type as <code class="computeroutput"><span class="identifier">Value</span></code>.
-            </li>
+                <code class="computeroutput"><span class="identifier">ForwardRange</span></code>'s value
+                type is the same type as <code class="computeroutput"><span class="identifier">Value</span></code>.
+              </li>
 <li class="listitem">
-<code class="computeroutput"><span class="identifier">ForwardRange</span></code>'s value
-              type is convertible to <code class="computeroutput"><span class="identifier">BinaryPredicate</span></code>'s
-              argument type.
-            </li>
+                <code class="computeroutput"><span class="identifier">ForwardRange</span></code>'s value
+                type is convertible to <code class="computeroutput"><span class="identifier">BinaryPredicate</span></code>'s
+                argument type.
+              </li>
 </ul></div>
 <a name="range.reference.algorithms.non_mutating.binary_search.precondition_"></a><h6>
-<a name="id2752422"></a>
+<a name="id3327177"></a>
             <a class="link" href="binary_search.html#range.reference.algorithms.non_mutating.binary_search.precondition_">Precondition:</a>
           </h6>
 <p>
@@ -129,7 +129,7 @@
             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="id2752518"></a>
+<a name="id3327273"></a>
             <a class="link" href="binary_search.html#range.reference.algorithms.non_mutating.binary_search.complexity">Complexity</a>
           </h6>
 <p>
@@ -151,7 +151,7 @@
 </tr></table>
 <hr>
 <div class="spirit-nav">
-<a accesskey="p" href="adjacent_find.html"><img src="../../../../../../../../doc/html/images/prev.png" alt="Prev"></a><a accesskey="u" href="../non_mutating.html"><img src="../../../../../../../../doc/html/images/up.png" alt="Up"></a><a accesskey="h" href="../../../../index.html"><img src="../../../../../../../../doc/html/images/home.png" alt="Home"></a><a accesskey="n" href="count.html"><img src="../../../../../../../../doc/html/images/next.png" alt="Next"></a>
+<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>
 </body>
 </html>
diff --git a/doc/html/range/reference/algorithms/non_mutating/count.html b/doc/html/range/reference/algorithms/non_mutating/count.html
index e1b7195..1360a5c 100644
--- a/doc/html/range/reference/algorithms/non_mutating/count.html
+++ b/doc/html/range/reference/algorithms/non_mutating/count.html
@@ -2,8 +2,8 @@
 <head>
 <meta http-equiv="Content-Type" content="text/html; charset=US-ASCII">
 <title>count</title>
-<link rel="stylesheet" href="../../../../../../../../doc/html/boostbook.css" type="text/css">
-<meta name="generator" content="DocBook XSL Stylesheets V1.75.1">
+<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="../non_mutating.html" title="Non-mutating algorithms">
 <link rel="prev" href="binary_search.html" title="binary_search">
@@ -13,21 +13,21 @@
 <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="../../../../../../../libraries.htm">Libraries</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="binary_search.html"><img src="../../../../../../../../doc/html/images/prev.png" alt="Prev"></a><a accesskey="u" href="../non_mutating.html"><img src="../../../../../../../../doc/html/images/up.png" alt="Up"></a><a accesskey="h" href="../../../../index.html"><img src="../../../../../../../../doc/html/images/home.png" alt="Home"></a><a accesskey="n" href="count_if.html"><img src="../../../../../../../../doc/html/images/next.png" alt="Next"></a>
+<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" title="count">
+<div class="section">
 <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="id2752688"></a>
+<a name="id3327443"></a>
             <a class="link" href="count.html#range.reference.algorithms.non_mutating.count.prototype">Prototype</a>
           </h6>
 <p>
@@ -44,7 +44,7 @@
 <p>
           </p>
 <a name="range.reference.algorithms.non_mutating.count.description"></a><h6>
-<a name="id2752985"></a>
+<a name="id3327740"></a>
             <a class="link" href="count.html#range.reference.algorithms.non_mutating.count.description">Description</a>
           </h6>
 <p>
@@ -54,37 +54,37 @@
             is <code class="computeroutput"><span class="keyword">true</span></code>.
           </p>
 <a name="range.reference.algorithms.non_mutating.count.definition"></a><h6>
-<a name="id2753076"></a>
+<a name="id3327831"></a>
             <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="id2753148"></a>
+<a name="id3327903"></a>
             <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">
-<code class="computeroutput"><span class="identifier">SinglePassRange</span></code> is
-              a model of the <a class="link" href="../../../concepts/single_pass_range.html" title="Single Pass Range">Single
-              Pass Range</a> Concept.
-            </li>
+                <code class="computeroutput"><span class="identifier">SinglePassRange</span></code> is
+                a model of the <a class="link" href="../../../concepts/single_pass_range.html" title="Single Pass Range">Single
+                Pass Range</a> Concept.
+              </li>
 <li class="listitem">
-<code class="computeroutput"><span class="identifier">Value</span></code> is a model of
-              the <code class="computeroutput"><span class="identifier">EqualityComparableConcept</span></code>.
-            </li>
+                <code class="computeroutput"><span class="identifier">Value</span></code> is a model
+                of the <code class="computeroutput"><span class="identifier">EqualityComparableConcept</span></code>.
+              </li>
 <li class="listitem">
-<code class="computeroutput"><span class="identifier">SinglePassRange</span></code>'s value
-              type is a model of the <code class="computeroutput"><span class="identifier">EqualityComparableConcept</span></code>.
-            </li>
+                <code class="computeroutput"><span class="identifier">SinglePassRange</span></code>'s
+                value type is a model of the <code class="computeroutput"><span class="identifier">EqualityComparableConcept</span></code>.
+              </li>
 <li class="listitem">
-              An object of <code class="computeroutput"><span class="identifier">SinglePassRange</span></code>'s
-              value type can be compared for equality with an object of type <code class="computeroutput"><span class="identifier">Value</span></code>.
-            </li>
+                An object of <code class="computeroutput"><span class="identifier">SinglePassRange</span></code>'s
+                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="id2753275"></a>
+<a name="id3328043"></a>
             <a class="link" href="count.html#range.reference.algorithms.non_mutating.count.complexity">Complexity</a>
           </h6>
 <p>
@@ -101,7 +101,7 @@
 </tr></table>
 <hr>
 <div class="spirit-nav">
-<a accesskey="p" href="binary_search.html"><img src="../../../../../../../../doc/html/images/prev.png" alt="Prev"></a><a accesskey="u" href="../non_mutating.html"><img src="../../../../../../../../doc/html/images/up.png" alt="Up"></a><a accesskey="h" href="../../../../index.html"><img src="../../../../../../../../doc/html/images/home.png" alt="Home"></a><a accesskey="n" href="count_if.html"><img src="../../../../../../../../doc/html/images/next.png" alt="Next"></a>
+<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>
 </body>
 </html>
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 53b05ad..5e6e850 100644
--- a/doc/html/range/reference/algorithms/non_mutating/count_if.html
+++ b/doc/html/range/reference/algorithms/non_mutating/count_if.html
@@ -2,8 +2,8 @@
 <head>
 <meta http-equiv="Content-Type" content="text/html; charset=US-ASCII">
 <title>count_if</title>
-<link rel="stylesheet" href="../../../../../../../../doc/html/boostbook.css" type="text/css">
-<meta name="generator" content="DocBook XSL Stylesheets V1.75.1">
+<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="../non_mutating.html" title="Non-mutating algorithms">
 <link rel="prev" href="count.html" title="count">
@@ -13,22 +13,22 @@
 <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="../../../../../../../libraries.htm">Libraries</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="count.html"><img src="../../../../../../../../doc/html/images/prev.png" alt="Prev"></a><a accesskey="u" href="../non_mutating.html"><img src="../../../../../../../../doc/html/images/up.png" alt="Up"></a><a accesskey="h" href="../../../../index.html"><img src="../../../../../../../../doc/html/images/home.png" alt="Home"></a><a accesskey="n" href="equal.html"><img src="../../../../../../../../doc/html/images/next.png" alt="Next"></a>
+<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" title="count_if">
+<div class="section">
 <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="id2753344"></a>
+<a name="id3328112"></a>
             <a class="link" href="count_if.html#range.reference.algorithms.non_mutating.count_if.prototype">Prototype</a>
           </h6>
 <p>
@@ -41,7 +41,7 @@
 <p>
           </p>
 <a name="range.reference.algorithms.non_mutating.count_if.description"></a><h6>
-<a name="id2753505"></a>
+<a name="id3328274"></a>
             <a class="link" href="count_if.html#range.reference.algorithms.non_mutating.count_if.description">Description</a>
           </h6>
 <p>
@@ -51,37 +51,37 @@
             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="id2753600"></a>
+<a name="id3328368"></a>
             <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="id2753672"></a>
+<a name="id3328440"></a>
             <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">
-<code class="computeroutput"><span class="identifier">SinglePassRange</span></code> is
-              a model of the <a class="link" href="../../../concepts/single_pass_range.html" title="Single Pass Range">Single
-              Pass Range</a> Concept.
-            </li>
+                <code class="computeroutput"><span class="identifier">SinglePassRange</span></code> is
+                a model of the <a class="link" href="../../../concepts/single_pass_range.html" title="Single Pass Range">Single
+                Pass Range</a> Concept.
+              </li>
 <li class="listitem">
-<code class="computeroutput"><span class="identifier">UnaryPredicate</span></code> is a
-              model of the <code class="computeroutput"><span class="identifier">UnaryPredicateConcept</span></code>.
-            </li>
+                <code class="computeroutput"><span class="identifier">UnaryPredicate</span></code> is
+                a model of the <code class="computeroutput"><span class="identifier">UnaryPredicateConcept</span></code>.
+              </li>
 <li class="listitem">
-<code class="computeroutput"><span class="identifier">SinglePassRange</span></code>'s value
-              type is a model of the <code class="computeroutput"><span class="identifier">EqualityComparableConcept</span></code>.
-            </li>
+                <code class="computeroutput"><span class="identifier">SinglePassRange</span></code>'s
+                value type is a model of the <code class="computeroutput"><span class="identifier">EqualityComparableConcept</span></code>.
+              </li>
 <li class="listitem">
-              The value type of <code class="computeroutput"><span class="identifier">SinglePassRange</span></code>
-              is convertible to the argument type of <code class="computeroutput"><span class="identifier">UnaryPredicate</span></code>.
-            </li>
+                The value type of <code class="computeroutput"><span class="identifier">SinglePassRange</span></code>
+                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="id2753799"></a>
+<a name="id3328579"></a>
             <a class="link" href="count_if.html#range.reference.algorithms.non_mutating.count_if.complexity">Complexity</a>
           </h6>
 <p>
@@ -98,7 +98,7 @@
 </tr></table>
 <hr>
 <div class="spirit-nav">
-<a accesskey="p" href="count.html"><img src="../../../../../../../../doc/html/images/prev.png" alt="Prev"></a><a accesskey="u" href="../non_mutating.html"><img src="../../../../../../../../doc/html/images/up.png" alt="Up"></a><a accesskey="h" href="../../../../index.html"><img src="../../../../../../../../doc/html/images/home.png" alt="Home"></a><a accesskey="n" href="equal.html"><img src="../../../../../../../../doc/html/images/next.png" alt="Next"></a>
+<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>
 </body>
 </html>
diff --git a/doc/html/range/reference/algorithms/non_mutating/equal.html b/doc/html/range/reference/algorithms/non_mutating/equal.html
index 6f0e022..0556a2a 100644
--- a/doc/html/range/reference/algorithms/non_mutating/equal.html
+++ b/doc/html/range/reference/algorithms/non_mutating/equal.html
@@ -2,8 +2,8 @@
 <head>
 <meta http-equiv="Content-Type" content="text/html; charset=US-ASCII">
 <title>equal</title>
-<link rel="stylesheet" href="../../../../../../../../doc/html/boostbook.css" type="text/css">
-<meta name="generator" content="DocBook XSL Stylesheets V1.75.1">
+<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="../non_mutating.html" title="Non-mutating algorithms">
 <link rel="prev" href="count_if.html" title="count_if">
@@ -13,21 +13,21 @@
 <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="../../../../../../../libraries.htm">Libraries</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="count_if.html"><img src="../../../../../../../../doc/html/images/prev.png" alt="Prev"></a><a accesskey="u" href="../non_mutating.html"><img src="../../../../../../../../doc/html/images/up.png" alt="Up"></a><a accesskey="h" href="../../../../index.html"><img src="../../../../../../../../doc/html/images/home.png" alt="Home"></a><a accesskey="n" href="equal_range.html"><img src="../../../../../../../../doc/html/images/next.png" alt="Next"></a>
+<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" title="equal">
+<div class="section">
 <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="id2753878"></a>
+<a name="id3328658"></a>
             <a class="link" href="equal.html#range.reference.algorithms.non_mutating.equal.prototype">Prototype</a>
           </h6>
 <p>
@@ -52,7 +52,7 @@
 <p>
           </p>
 <a name="range.reference.algorithms.non_mutating.equal.description"></a><h6>
-<a name="id2754164"></a>
+<a name="id3328944"></a>
             <a class="link" href="equal.html#range.reference.algorithms.non_mutating.equal.description">Description</a>
           </h6>
 <p>
@@ -70,14 +70,14 @@
             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="id2754407"></a>
+<a name="id3329186"></a>
             <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="id2754480"></a>
+<a name="id3329260"></a>
             <a class="link" href="equal.html#range.reference.algorithms.non_mutating.equal.requirements">Requirements</a>
           </h6>
 <p>
@@ -85,60 +85,60 @@
           </p>
 <div class="itemizedlist"><ul class="itemizedlist" type="disc">
 <li class="listitem">
-<code class="computeroutput"><span class="identifier">SinglePassRange1</span></code> is
-              a model of the <a class="link" href="../../../concepts/single_pass_range.html" title="Single Pass Range">Single
-              Pass Range</a> Concept.
-            </li>
+                <code class="computeroutput"><span class="identifier">SinglePassRange1</span></code>
+                is a model of the <a class="link" href="../../../concepts/single_pass_range.html" title="Single Pass Range">Single
+                Pass Range</a> Concept.
+              </li>
 <li class="listitem">
-<code class="computeroutput"><span class="identifier">SinglePassRange2</span></code> is
-              a model of the <a class="link" href="../../../concepts/single_pass_range.html" title="Single Pass Range">Single
-              Pass Range</a> Concept.
-            </li>
+                <code class="computeroutput"><span class="identifier">SinglePassRange2</span></code>
+                is a model of the <a class="link" href="../../../concepts/single_pass_range.html" title="Single Pass Range">Single
+                Pass Range</a> Concept.
+              </li>
 <li class="listitem">
-<code class="computeroutput"><span class="identifier">SinglePassRange1</span></code>'s
-              value type is a model of the <code class="computeroutput"><span class="identifier">EqualityComparableConcept</span></code>.
-            </li>
+                <code class="computeroutput"><span class="identifier">SinglePassRange1</span></code>'s
+                value type is a model of the <code class="computeroutput"><span class="identifier">EqualityComparableConcept</span></code>.
+              </li>
 <li class="listitem">
-<code class="computeroutput"><span class="identifier">SinglePassRange2</span></code>'s
-              value type is a model of the <code class="computeroutput"><span class="identifier">EqualityComparableConcept</span></code>.
-            </li>
+                <code class="computeroutput"><span class="identifier">SinglePassRange2</span></code>'s
+                value type is a model of the <code class="computeroutput"><span class="identifier">EqualityComparableConcept</span></code>.
+              </li>
 <li class="listitem">
-<code class="computeroutput"><span class="identifier">SinglePassRange1</span></code>'s
-              value type can be compared for equality with <code class="computeroutput"><span class="identifier">SinglePassRange2</span></code>'s
-              value type.
-            </li>
+                <code class="computeroutput"><span class="identifier">SinglePassRange1</span></code>'s
+                value type can be compared for equality with <code class="computeroutput"><span class="identifier">SinglePassRange2</span></code>'s
+                value type.
+              </li>
 </ul></div>
 <p>
             <span class="bold"><strong>For the predicate versions:</strong></span>
           </p>
 <div class="itemizedlist"><ul class="itemizedlist" type="disc">
 <li class="listitem">
-<code class="computeroutput"><span class="identifier">SinglePassRange1</span></code> is
-              a model of the <a class="link" href="../../../concepts/single_pass_range.html" title="Single Pass Range">Single
-              Pass Range</a> Concept.
-            </li>
+                <code class="computeroutput"><span class="identifier">SinglePassRange1</span></code>
+                is a model of the <a class="link" href="../../../concepts/single_pass_range.html" title="Single Pass Range">Single
+                Pass Range</a> Concept.
+              </li>
 <li class="listitem">
-<code class="computeroutput"><span class="identifier">SinglePassRange2</span></code> is
-              a model of the <a class="link" href="../../../concepts/single_pass_range.html" title="Single Pass Range">Single
-              Pass Range</a> Concept.
-            </li>
+                <code class="computeroutput"><span class="identifier">SinglePassRange2</span></code>
+                is a model of the <a class="link" href="../../../concepts/single_pass_range.html" title="Single Pass Range">Single
+                Pass Range</a> Concept.
+              </li>
 <li class="listitem">
-<code class="computeroutput"><span class="identifier">BinaryPredicate</span></code> is
-              a model of the <code class="computeroutput"><span class="identifier">BinaryPredicateConcept</span></code>.
-            </li>
+                <code class="computeroutput"><span class="identifier">BinaryPredicate</span></code> is
+                a model of the <code class="computeroutput"><span class="identifier">BinaryPredicateConcept</span></code>.
+              </li>
 <li class="listitem">
-<code class="computeroutput"><span class="identifier">SinglePassRange1</span></code>'s
-              value type is convertible to <code class="computeroutput"><span class="identifier">BinaryPredicate</span></code>'s
-              first argument type.
-            </li>
+                <code class="computeroutput"><span class="identifier">SinglePassRange1</span></code>'s
+                value type is convertible to <code class="computeroutput"><span class="identifier">BinaryPredicate</span></code>'s
+                first argument type.
+              </li>
 <li class="listitem">
-<code class="computeroutput"><span class="identifier">SinglePassRange2</span></code>'s
-              value type is convertible to <code class="computeroutput"><span class="identifier">BinaryPredicate</span></code>'s
-              second argument type.
-            </li>
+                <code class="computeroutput"><span class="identifier">SinglePassRange2</span></code>'s
+                value type is convertible to <code class="computeroutput"><span class="identifier">BinaryPredicate</span></code>'s
+                second argument type.
+              </li>
 </ul></div>
 <a name="range.reference.algorithms.non_mutating.equal.complexity"></a><h6>
-<a name="id2754774"></a>
+<a name="id3329588"></a>
             <a class="link" href="equal.html#range.reference.algorithms.non_mutating.equal.complexity">Complexity</a>
           </h6>
 <p>
@@ -156,7 +156,7 @@
 </tr></table>
 <hr>
 <div class="spirit-nav">
-<a accesskey="p" href="count_if.html"><img src="../../../../../../../../doc/html/images/prev.png" alt="Prev"></a><a accesskey="u" href="../non_mutating.html"><img src="../../../../../../../../doc/html/images/up.png" alt="Up"></a><a accesskey="h" href="../../../../index.html"><img src="../../../../../../../../doc/html/images/home.png" alt="Home"></a><a accesskey="n" href="equal_range.html"><img src="../../../../../../../../doc/html/images/next.png" alt="Next"></a>
+<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>
 </body>
 </html>
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 7aa0fc1..766ee8a 100644
--- a/doc/html/range/reference/algorithms/non_mutating/equal_range.html
+++ b/doc/html/range/reference/algorithms/non_mutating/equal_range.html
@@ -2,8 +2,8 @@
 <head>
 <meta http-equiv="Content-Type" content="text/html; charset=US-ASCII">
 <title>equal_range</title>
-<link rel="stylesheet" href="../../../../../../../../doc/html/boostbook.css" type="text/css">
-<meta name="generator" content="DocBook XSL Stylesheets V1.75.1">
+<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="../non_mutating.html" title="Non-mutating algorithms">
 <link rel="prev" href="equal.html" title="equal">
@@ -13,22 +13,22 @@
 <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="../../../../../../../libraries.htm">Libraries</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="equal.html"><img src="../../../../../../../../doc/html/images/prev.png" alt="Prev"></a><a accesskey="u" href="../non_mutating.html"><img src="../../../../../../../../doc/html/images/up.png" alt="Up"></a><a accesskey="h" href="../../../../index.html"><img src="../../../../../../../../doc/html/images/home.png" alt="Home"></a><a accesskey="n" href="for_each.html"><img src="../../../../../../../../doc/html/images/next.png" alt="Next"></a>
+<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" title="equal_range">
+<div class="section">
 <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="id2754871"></a>
+<a name="id3329684"></a>
             <a class="link" href="equal_range.html#range.reference.algorithms.non_mutating.equal_range.prototype">Prototype</a>
           </h6>
 <p>
@@ -71,7 +71,7 @@
 <p>
           </p>
 <a name="range.reference.algorithms.non_mutating.equal_range.description"></a><h6>
-<a name="id2755750"></a>
+<a name="id3330564"></a>
             <a class="link" href="equal_range.html#range.reference.algorithms.non_mutating.equal_range.description">Description</a>
           </h6>
 <p>
@@ -85,14 +85,14 @@
             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="id2755903"></a>
+<a name="id3330716"></a>
             <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="id2755976"></a>
+<a name="id3330789"></a>
             <a class="link" href="equal_range.html#range.reference.algorithms.non_mutating.equal_range.requirements">Requirements</a>
           </h6>
 <p>
@@ -100,50 +100,50 @@
           </p>
 <div class="itemizedlist"><ul class="itemizedlist" type="disc">
 <li class="listitem">
-<code class="computeroutput"><span class="identifier">ForwardRange</span></code> is a model
-              of the <a class="link" href="../../../concepts/forward_range.html" title="Forward Range">Forward Range</a>
-              Concept.
-            </li>
+                <code class="computeroutput"><span class="identifier">ForwardRange</span></code> is a
+                model of the <a class="link" href="../../../concepts/forward_range.html" title="Forward Range">Forward
+                Range</a> Concept.
+              </li>
 <li class="listitem">
-<code class="computeroutput"><span class="identifier">Value</span></code> is a model of
-              the <code class="computeroutput"><span class="identifier">LessThanComparableConcept</span></code>.
-            </li>
+                <code class="computeroutput"><span class="identifier">Value</span></code> is a model
+                of the <code class="computeroutput"><span class="identifier">LessThanComparableConcept</span></code>.
+              </li>
 <li class="listitem">
-              The ordering of objects of type <code class="computeroutput"><span class="identifier">Value</span></code>
-              is a <span class="bold"><strong><span class="emphasis"><em>strict weak ordering</em></span></strong></span>,
-              as defined in the <code class="computeroutput"><span class="identifier">LessThanComparableConcept</span></code>
-              requirements.
-            </li>
+                The ordering of objects of type <code class="computeroutput"><span class="identifier">Value</span></code>
+                is a <span class="bold"><strong><span class="emphasis"><em>strict weak ordering</em></span></strong></span>,
+                as defined in the <code class="computeroutput"><span class="identifier">LessThanComparableConcept</span></code>
+                requirements.
+              </li>
 <li class="listitem">
-<code class="computeroutput"><span class="identifier">ForwardRange</span></code>'s value
-              type is the same type as <code class="computeroutput"><span class="identifier">Value</span></code>.
-            </li>
+                <code class="computeroutput"><span class="identifier">ForwardRange</span></code>'s value
+                type is the same type as <code class="computeroutput"><span class="identifier">Value</span></code>.
+              </li>
 </ul></div>
 <p>
             <span class="bold"><strong>For the predicate versions:</strong></span>
           </p>
 <div class="itemizedlist"><ul class="itemizedlist" type="disc">
 <li class="listitem">
-<code class="computeroutput"><span class="identifier">ForwardRange</span></code> is a model
-              of the <a class="link" href="../../../concepts/forward_range.html" title="Forward Range">Forward Range</a>
-              Concept.
-            </li>
+                <code class="computeroutput"><span class="identifier">ForwardRange</span></code> is a
+                model of the <a class="link" href="../../../concepts/forward_range.html" title="Forward Range">Forward
+                Range</a> Concept.
+              </li>
 <li class="listitem">
-<code class="computeroutput"><span class="identifier">SortPredicate</span></code> is a
-              model of the <code class="computeroutput"><span class="identifier">StrictWeakOrderingConcept</span></code>.
-            </li>
+                <code class="computeroutput"><span class="identifier">SortPredicate</span></code> is
+                a model of the <code class="computeroutput"><span class="identifier">StrictWeakOrderingConcept</span></code>.
+              </li>
 <li class="listitem">
-<code class="computeroutput"><span class="identifier">ForwardRange</span></code>'s value
-              type is the same as <code class="computeroutput"><span class="identifier">Value</span></code>.
-            </li>
+                <code class="computeroutput"><span class="identifier">ForwardRange</span></code>'s value
+                type is the same as <code class="computeroutput"><span class="identifier">Value</span></code>.
+              </li>
 <li class="listitem">
-<code class="computeroutput"><span class="identifier">ForwardRange</span></code>'s value
-              type is convertible to both of <code class="computeroutput"><span class="identifier">SortPredicate</span></code>'s
-              argument types.
-            </li>
+                <code class="computeroutput"><span class="identifier">ForwardRange</span></code>'s value
+                type is convertible to both of <code class="computeroutput"><span class="identifier">SortPredicate</span></code>'s
+                argument types.
+              </li>
 </ul></div>
 <a name="range.reference.algorithms.non_mutating.equal_range.precondition_"></a><h6>
-<a name="id2756232"></a>
+<a name="id3331071"></a>
             <a class="link" href="equal_range.html#range.reference.algorithms.non_mutating.equal_range.precondition_">Precondition:</a>
           </h6>
 <p>
@@ -155,7 +155,7 @@
             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="id2756312"></a>
+<a name="id3331151"></a>
             <a class="link" href="equal_range.html#range.reference.algorithms.non_mutating.equal_range.complexity">Complexity</a>
           </h6>
 <p>
@@ -173,7 +173,7 @@
 </tr></table>
 <hr>
 <div class="spirit-nav">
-<a accesskey="p" href="equal.html"><img src="../../../../../../../../doc/html/images/prev.png" alt="Prev"></a><a accesskey="u" href="../non_mutating.html"><img src="../../../../../../../../doc/html/images/up.png" alt="Up"></a><a accesskey="h" href="../../../../index.html"><img src="../../../../../../../../doc/html/images/home.png" alt="Home"></a><a accesskey="n" href="for_each.html"><img src="../../../../../../../../doc/html/images/next.png" alt="Next"></a>
+<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>
 </body>
 </html>
diff --git a/doc/html/range/reference/algorithms/non_mutating/find.html b/doc/html/range/reference/algorithms/non_mutating/find.html
index 485e44a..80ac8a1 100644
--- a/doc/html/range/reference/algorithms/non_mutating/find.html
+++ b/doc/html/range/reference/algorithms/non_mutating/find.html
@@ -2,8 +2,8 @@
 <head>
 <meta http-equiv="Content-Type" content="text/html; charset=US-ASCII">
 <title>find</title>
-<link rel="stylesheet" href="../../../../../../../../doc/html/boostbook.css" type="text/css">
-<meta name="generator" content="DocBook XSL Stylesheets V1.75.1">
+<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="../non_mutating.html" title="Non-mutating algorithms">
 <link rel="prev" href="for_each.html" title="for_each">
@@ -13,21 +13,21 @@
 <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="../../../../../../../libraries.htm">Libraries</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="for_each.html"><img src="../../../../../../../../doc/html/images/prev.png" alt="Prev"></a><a accesskey="u" href="../non_mutating.html"><img src="../../../../../../../../doc/html/images/up.png" alt="Up"></a><a accesskey="h" href="../../../../index.html"><img src="../../../../../../../../doc/html/images/home.png" alt="Home"></a><a accesskey="n" href="find_end.html"><img src="../../../../../../../../doc/html/images/next.png" alt="Next"></a>
+<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" title="find">
+<div class="section">
 <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="id2756989"></a>
+<a name="id3331842"></a>
             <a class="link" href="find.html#range.reference.algorithms.non_mutating.find.prototype">Prototype</a>
           </h6>
 <p>
@@ -48,7 +48,7 @@
 <p>
           </p>
 <a name="range.reference.algorithms.non_mutating.find.description"></a><h6>
-<a name="id2757282"></a>
+<a name="id3332134"></a>
             <a class="link" href="find.html#range.reference.algorithms.non_mutating.find.description">Description</a>
           </h6>
 <p>
@@ -59,35 +59,35 @@
             same manner as the returned iterator described above.
           </p>
 <a name="range.reference.algorithms.non_mutating.find.definition"></a><h6>
-<a name="id2757405"></a>
+<a name="id3332258"></a>
             <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="id2757478"></a>
+<a name="id3332330"></a>
             <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">
-<code class="computeroutput"><span class="identifier">SinglePassRange</span></code> is
-              a model of the <a class="link" href="../../../concepts/single_pass_range.html" title="Single Pass Range">Single
-              Pass Range</a> Concept.
-            </li>
+                <code class="computeroutput"><span class="identifier">SinglePassRange</span></code> is
+                a model of the <a class="link" href="../../../concepts/single_pass_range.html" title="Single Pass Range">Single
+                Pass Range</a> Concept.
+              </li>
 <li class="listitem">
-<code class="computeroutput"><span class="identifier">Value</span></code> is a model of
-              the <code class="computeroutput"><span class="identifier">EqualityComparableConcept</span></code>.
-            </li>
+                <code class="computeroutput"><span class="identifier">Value</span></code> is a model
+                of the <code class="computeroutput"><span class="identifier">EqualityComparableConcept</span></code>.
+              </li>
 <li class="listitem">
-              The <code class="computeroutput"><span class="keyword">operator</span><span class="special">==</span></code>
-              is defined for type <code class="computeroutput"><span class="identifier">Value</span></code>
-              to be compared with the <code class="computeroutput"><span class="identifier">SinglePassRange</span></code>'s
-              value type.
-            </li>
+                The <code class="computeroutput"><span class="keyword">operator</span><span class="special">==</span></code>
+                is defined for type <code class="computeroutput"><span class="identifier">Value</span></code>
+                to be compared with the <code class="computeroutput"><span class="identifier">SinglePassRange</span></code>'s
+                value type.
+              </li>
 </ul></div>
 <a name="range.reference.algorithms.non_mutating.find.complexity"></a><h6>
-<a name="id2757593"></a>
+<a name="id3332456"></a>
             <a class="link" href="find.html#range.reference.algorithms.non_mutating.find.complexity">Complexity</a>
           </h6>
 <p>
@@ -104,7 +104,7 @@
 </tr></table>
 <hr>
 <div class="spirit-nav">
-<a accesskey="p" href="for_each.html"><img src="../../../../../../../../doc/html/images/prev.png" alt="Prev"></a><a accesskey="u" href="../non_mutating.html"><img src="../../../../../../../../doc/html/images/up.png" alt="Up"></a><a accesskey="h" href="../../../../index.html"><img src="../../../../../../../../doc/html/images/home.png" alt="Home"></a><a accesskey="n" href="find_end.html"><img src="../../../../../../../../doc/html/images/next.png" alt="Next"></a>
+<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>
 </body>
 </html>
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 f11bb47..40847b3 100644
--- a/doc/html/range/reference/algorithms/non_mutating/find_end.html
+++ b/doc/html/range/reference/algorithms/non_mutating/find_end.html
@@ -2,8 +2,8 @@
 <head>
 <meta http-equiv="Content-Type" content="text/html; charset=US-ASCII">
 <title>find_end</title>
-<link rel="stylesheet" href="../../../../../../../../doc/html/boostbook.css" type="text/css">
-<meta name="generator" content="DocBook XSL Stylesheets V1.75.1">
+<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="../non_mutating.html" title="Non-mutating algorithms">
 <link rel="prev" href="find.html" title="find">
@@ -13,22 +13,22 @@
 <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="../../../../../../../libraries.htm">Libraries</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="find.html"><img src="../../../../../../../../doc/html/images/prev.png" alt="Prev"></a><a accesskey="u" href="../non_mutating.html"><img src="../../../../../../../../doc/html/images/up.png" alt="Up"></a><a accesskey="h" href="../../../../index.html"><img src="../../../../../../../../doc/html/images/home.png" alt="Home"></a><a accesskey="n" href="find_first_of.html"><img src="../../../../../../../../doc/html/images/next.png" alt="Next"></a>
+<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" title="find_end">
+<div class="section">
 <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="id2757661"></a>
+<a name="id3332524"></a>
             <a class="link" href="find_end.html#range.reference.algorithms.non_mutating.find_end.prototype">Prototype</a>
           </h6>
 <p>
@@ -66,7 +66,7 @@
 <p>
           </p>
 <a name="range.reference.algorithms.non_mutating.find_end.description"></a><h6>
-<a name="id2758327"></a>
+<a name="id3333189"></a>
             <a class="link" href="find_end.html#range.reference.algorithms.non_mutating.find_end.description">Description</a>
           </h6>
 <p>
@@ -81,14 +81,14 @@
             same manner as the returned iterator described above.
           </p>
 <a name="range.reference.algorithms.non_mutating.find_end.definition"></a><h6>
-<a name="id2758462"></a>
+<a name="id3333324"></a>
             <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="id2758535"></a>
+<a name="id3333397"></a>
             <a class="link" href="find_end.html#range.reference.algorithms.non_mutating.find_end.requirements">Requirements</a>
           </h6>
 <p>
@@ -96,59 +96,59 @@
           </p>
 <div class="itemizedlist"><ul class="itemizedlist" type="disc">
 <li class="listitem">
-<code class="computeroutput"><span class="identifier">ForwardRange1</span></code> is a
-              model of the <a class="link" href="../../../concepts/forward_range.html" title="Forward Range">Forward Range</a>
-              Concept.
-            </li>
+                <code class="computeroutput"><span class="identifier">ForwardRange1</span></code> is
+                a model of the <a class="link" href="../../../concepts/forward_range.html" title="Forward Range">Forward
+                Range</a> Concept.
+              </li>
 <li class="listitem">
-<code class="computeroutput"><span class="identifier">ForwardRange2</span></code> is a
-              model of the <a class="link" href="../../../concepts/forward_range.html" title="Forward Range">Forward Range</a>
-              Concept.
-            </li>
+                <code class="computeroutput"><span class="identifier">ForwardRange2</span></code> is
+                a model of the <a class="link" href="../../../concepts/forward_range.html" title="Forward Range">Forward
+                Range</a> Concept.
+              </li>
 <li class="listitem">
-<code class="computeroutput"><span class="identifier">ForwardRange1</span></code>'s value
-              type is a model of the <code class="computeroutput"><span class="identifier">EqualityComparableConcept</span></code>.
-            </li>
+                <code class="computeroutput"><span class="identifier">ForwardRange1</span></code>'s value
+                type is a model of the <code class="computeroutput"><span class="identifier">EqualityComparableConcept</span></code>.
+              </li>
 <li class="listitem">
-<code class="computeroutput"><span class="identifier">ForwardRange2</span></code>'s value
-              type is a model of the <code class="computeroutput"><span class="identifier">EqualityComparableConcept</span></code>.
-            </li>
+                <code class="computeroutput"><span class="identifier">ForwardRange2</span></code>'s value
+                type is a model of the <code class="computeroutput"><span class="identifier">EqualityComparableConcept</span></code>.
+              </li>
 <li class="listitem">
-              Objects of <code class="computeroutput"><span class="identifier">ForwardRange1</span></code>'s
-              value type can be compared for equality with objects of <code class="computeroutput"><span class="identifier">ForwardRange2</span></code>'s value type.
-            </li>
+                Objects of <code class="computeroutput"><span class="identifier">ForwardRange1</span></code>'s
+                value type can be compared for equality with objects of <code class="computeroutput"><span class="identifier">ForwardRange2</span></code>'s value type.
+              </li>
 </ul></div>
 <p>
             <span class="bold"><strong>For the predicate versions:</strong></span>
           </p>
 <div class="itemizedlist"><ul class="itemizedlist" type="disc">
 <li class="listitem">
-<code class="computeroutput"><span class="identifier">ForwardRange1</span></code> is a
-              model of the <a class="link" href="../../../concepts/forward_range.html" title="Forward Range">Forward Range</a>
-              Concept.
-            </li>
+                <code class="computeroutput"><span class="identifier">ForwardRange1</span></code> is
+                a model of the <a class="link" href="../../../concepts/forward_range.html" title="Forward Range">Forward
+                Range</a> Concept.
+              </li>
 <li class="listitem">
-<code class="computeroutput"><span class="identifier">ForwardRange2</span></code> is a
-              model of the <a class="link" href="../../../concepts/forward_range.html" title="Forward Range">Forward Range</a>
-              Concept.
-            </li>
+                <code class="computeroutput"><span class="identifier">ForwardRange2</span></code> is
+                a model of the <a class="link" href="../../../concepts/forward_range.html" title="Forward Range">Forward
+                Range</a> Concept.
+              </li>
 <li class="listitem">
-<code class="computeroutput"><span class="identifier">BinaryPredicate</span></code> is
-              a model of the <code class="computeroutput"><span class="identifier">BinaryPredicateConcept</span></code>.
-            </li>
+                <code class="computeroutput"><span class="identifier">BinaryPredicate</span></code> is
+                a model of the <code class="computeroutput"><span class="identifier">BinaryPredicateConcept</span></code>.
+              </li>
 <li class="listitem">
-<code class="computeroutput"><span class="identifier">ForwardRange1</span></code>'s value
-              type is convertible to <code class="computeroutput"><span class="identifier">BinaryPredicate</span></code>'s
-              first argument type.
-            </li>
+                <code class="computeroutput"><span class="identifier">ForwardRange1</span></code>'s value
+                type is convertible to <code class="computeroutput"><span class="identifier">BinaryPredicate</span></code>'s
+                first argument type.
+              </li>
 <li class="listitem">
-<code class="computeroutput"><span class="identifier">ForwardRange2</span></code>'s value
-              type is convertible to <code class="computeroutput"><span class="identifier">BinaryPredicate</span></code>'s
-              second argument type.
-            </li>
+                <code class="computeroutput"><span class="identifier">ForwardRange2</span></code>'s value
+                type is convertible to <code class="computeroutput"><span class="identifier">BinaryPredicate</span></code>'s
+                second argument type.
+              </li>
 </ul></div>
 <a name="range.reference.algorithms.non_mutating.find_end.complexity"></a><h6>
-<a name="id2758832"></a>
+<a name="id3333727"></a>
             <a class="link" href="find_end.html#range.reference.algorithms.non_mutating.find_end.complexity">Complexity</a>
           </h6>
 <p>
@@ -168,7 +168,7 @@
 </tr></table>
 <hr>
 <div class="spirit-nav">
-<a accesskey="p" href="find.html"><img src="../../../../../../../../doc/html/images/prev.png" alt="Prev"></a><a accesskey="u" href="../non_mutating.html"><img src="../../../../../../../../doc/html/images/up.png" alt="Up"></a><a accesskey="h" href="../../../../index.html"><img src="../../../../../../../../doc/html/images/home.png" alt="Home"></a><a accesskey="n" href="find_first_of.html"><img src="../../../../../../../../doc/html/images/next.png" alt="Next"></a>
+<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>
 </body>
 </html>
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 972690f..ab764df 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
@@ -2,8 +2,8 @@
 <head>
 <meta http-equiv="Content-Type" content="text/html; charset=US-ASCII">
 <title>find_first_of</title>
-<link rel="stylesheet" href="../../../../../../../../doc/html/boostbook.css" type="text/css">
-<meta name="generator" content="DocBook XSL Stylesheets V1.75.1">
+<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="../non_mutating.html" title="Non-mutating algorithms">
 <link rel="prev" href="find_end.html" title="find_end">
@@ -13,22 +13,22 @@
 <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="../../../../../../../libraries.htm">Libraries</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="find_end.html"><img src="../../../../../../../../doc/html/images/prev.png" alt="Prev"></a><a accesskey="u" href="../non_mutating.html"><img src="../../../../../../../../doc/html/images/up.png" alt="Up"></a><a accesskey="h" href="../../../../index.html"><img src="../../../../../../../../doc/html/images/home.png" alt="Home"></a><a accesskey="n" href="find_if.html"><img src="../../../../../../../../doc/html/images/next.png" alt="Next"></a>
+<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" title="find_first_of">
+<div class="section">
 <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="id2759010"></a>
+<a name="id3333904"></a>
             <a class="link" href="find_first_of.html#range.reference.algorithms.non_mutating.find_first_of.prototype">Prototype</a>
           </h6>
 <p>
@@ -66,7 +66,7 @@
 <p>
           </p>
 <a name="range.reference.algorithms.non_mutating.find_first_of.description"></a><h6>
-<a name="id2759676"></a>
+<a name="id3334571"></a>
             <a class="link" href="find_first_of.html#range.reference.algorithms.non_mutating.find_first_of.description">Description</a>
           </h6>
 <p>
@@ -86,14 +86,14 @@
             same manner as the returned iterator described above.
           </p>
 <a name="range.reference.algorithms.non_mutating.find_first_of.definition"></a><h6>
-<a name="id2759815"></a>
+<a name="id3334710"></a>
             <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="id2759889"></a>
+<a name="id3334784"></a>
             <a class="link" href="find_first_of.html#range.reference.algorithms.non_mutating.find_first_of.requirements">Requirements</a>
           </h6>
 <p>
@@ -101,53 +101,53 @@
           </p>
 <div class="itemizedlist"><ul class="itemizedlist" type="disc">
 <li class="listitem">
-<code class="computeroutput"><span class="identifier">SinglePassRange1</span></code> is
-              a model of the <a class="link" href="../../../concepts/single_pass_range.html" title="Single Pass Range">Single
-              Pass Range</a> Concept.
-            </li>
+                <code class="computeroutput"><span class="identifier">SinglePassRange1</span></code>
+                is a model of the <a class="link" href="../../../concepts/single_pass_range.html" title="Single Pass Range">Single
+                Pass Range</a> Concept.
+              </li>
 <li class="listitem">
-<code class="computeroutput"><span class="identifier">ForwardRange2</span></code> is a
-              model of the <a class="link" href="../../../concepts/forward_range.html" title="Forward Range">Forward Range</a>
-              Concept.
-            </li>
+                <code class="computeroutput"><span class="identifier">ForwardRange2</span></code> is
+                a model of the <a class="link" href="../../../concepts/forward_range.html" title="Forward Range">Forward
+                Range</a> Concept.
+              </li>
 <li class="listitem">
-<code class="computeroutput"><span class="identifier">SinglePassRange1</span></code>'s
-              value type is a model of the <code class="computeroutput"><span class="identifier">EqualityComparableConcept</span></code>,
-              and can be compared for equality with <code class="computeroutput"><span class="identifier">ForwardRange2</span></code>'s
-              value type.
-            </li>
+                <code class="computeroutput"><span class="identifier">SinglePassRange1</span></code>'s
+                value type is a model of the <code class="computeroutput"><span class="identifier">EqualityComparableConcept</span></code>,
+                and can be compared for equality with <code class="computeroutput"><span class="identifier">ForwardRange2</span></code>'s
+                value type.
+              </li>
 </ul></div>
 <p>
             <span class="bold"><strong>For the predicate versions:</strong></span>
           </p>
 <div class="itemizedlist"><ul class="itemizedlist" type="disc">
 <li class="listitem">
-<code class="computeroutput"><span class="identifier">SinglePassRange1</span></code> is
-              a model of the <a class="link" href="../../../concepts/single_pass_range.html" title="Single Pass Range">Single
-              Pass Range</a> Concept.
-            </li>
+                <code class="computeroutput"><span class="identifier">SinglePassRange1</span></code>
+                is a model of the <a class="link" href="../../../concepts/single_pass_range.html" title="Single Pass Range">Single
+                Pass Range</a> Concept.
+              </li>
 <li class="listitem">
-<code class="computeroutput"><span class="identifier">ForwardRange2</span></code> is a
-              model of the <a class="link" href="../../../concepts/forward_range.html" title="Forward Range">Forward Range</a>
-              Concept.
-            </li>
+                <code class="computeroutput"><span class="identifier">ForwardRange2</span></code> is
+                a model of the <a class="link" href="../../../concepts/forward_range.html" title="Forward Range">Forward
+                Range</a> Concept.
+              </li>
 <li class="listitem">
-<code class="computeroutput"><span class="identifier">BinaryPredicate</span></code> is
-              a model of the <code class="computeroutput"><span class="identifier">BinaryPredicateConcept</span></code>.
-            </li>
+                <code class="computeroutput"><span class="identifier">BinaryPredicate</span></code> is
+                a model of the <code class="computeroutput"><span class="identifier">BinaryPredicateConcept</span></code>.
+              </li>
 <li class="listitem">
-<code class="computeroutput"><span class="identifier">SinglePassRange1</span></code>'s
-              value type is convertible to <code class="computeroutput"><span class="identifier">BinaryPredicate</span></code>'s
-              first argument type.
-            </li>
+                <code class="computeroutput"><span class="identifier">SinglePassRange1</span></code>'s
+                value type is convertible to <code class="computeroutput"><span class="identifier">BinaryPredicate</span></code>'s
+                first argument type.
+              </li>
 <li class="listitem">
-<code class="computeroutput"><span class="identifier">ForwardRange2</span></code>'s value
-              type is convertible to <code class="computeroutput"><span class="identifier">BinaryPredicate</span></code>'s
-              second argument type.
-            </li>
+                <code class="computeroutput"><span class="identifier">ForwardRange2</span></code>'s value
+                type is convertible to <code class="computeroutput"><span class="identifier">BinaryPredicate</span></code>'s
+                second argument type.
+              </li>
 </ul></div>
 <a name="range.reference.algorithms.non_mutating.find_first_of.complexity"></a><h6>
-<a name="id2760145"></a>
+<a name="id3335066"></a>
             <a class="link" href="find_first_of.html#range.reference.algorithms.non_mutating.find_first_of.complexity">Complexity</a>
           </h6>
 <p>
@@ -164,7 +164,7 @@
 </tr></table>
 <hr>
 <div class="spirit-nav">
-<a accesskey="p" href="find_end.html"><img src="../../../../../../../../doc/html/images/prev.png" alt="Prev"></a><a accesskey="u" href="../non_mutating.html"><img src="../../../../../../../../doc/html/images/up.png" alt="Up"></a><a accesskey="h" href="../../../../index.html"><img src="../../../../../../../../doc/html/images/home.png" alt="Home"></a><a accesskey="n" href="find_if.html"><img src="../../../../../../../../doc/html/images/next.png" alt="Next"></a>
+<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>
 </body>
 </html>
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 59ab8d3..caa16d2 100644
--- a/doc/html/range/reference/algorithms/non_mutating/find_if.html
+++ b/doc/html/range/reference/algorithms/non_mutating/find_if.html
@@ -2,8 +2,8 @@
 <head>
 <meta http-equiv="Content-Type" content="text/html; charset=US-ASCII">
 <title>find_if</title>
-<link rel="stylesheet" href="../../../../../../../../doc/html/boostbook.css" type="text/css">
-<meta name="generator" content="DocBook XSL Stylesheets V1.75.1">
+<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="../non_mutating.html" title="Non-mutating algorithms">
 <link rel="prev" href="find_first_of.html" title="find_first_of">
@@ -13,22 +13,22 @@
 <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="../../../../../../../libraries.htm">Libraries</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="find_first_of.html"><img src="../../../../../../../../doc/html/images/prev.png" alt="Prev"></a><a accesskey="u" href="../non_mutating.html"><img src="../../../../../../../../doc/html/images/up.png" alt="Up"></a><a accesskey="h" href="../../../../index.html"><img src="../../../../../../../../doc/html/images/home.png" alt="Home"></a><a accesskey="n" href="lexicographical_compare.html"><img src="../../../../../../../../doc/html/images/next.png" alt="Next"></a>
+<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" title="find_if">
+<div class="section">
 <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="id2760238"></a>
+<a name="id3335161"></a>
             <a class="link" href="find_if.html#range.reference.algorithms.non_mutating.find_if.prototype">Prototype</a>
           </h6>
 <p>
@@ -49,7 +49,7 @@
 <p>
           </p>
 <a name="range.reference.algorithms.non_mutating.find_if.description"></a><h6>
-<a name="id2760533"></a>
+<a name="id3335453"></a>
             <a class="link" href="find_if.html#range.reference.algorithms.non_mutating.find_if.description">Description</a>
           </h6>
 <p>
@@ -64,33 +64,33 @@
             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="id2760669"></a>
+<a name="id3335590"></a>
             <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="id2760744"></a>
+<a name="id3335664"></a>
             <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">
-<code class="computeroutput"><span class="identifier">SinglePassRange</span></code> is
-              a model of the <a class="link" href="../../../concepts/single_pass_range.html" title="Single Pass Range">Single
-              Pass Range</a> Concept.
-            </li>
+                <code class="computeroutput"><span class="identifier">SinglePassRange</span></code> is
+                a model of the <a class="link" href="../../../concepts/single_pass_range.html" title="Single Pass Range">Single
+                Pass Range</a> Concept.
+              </li>
 <li class="listitem">
-<code class="computeroutput"><span class="identifier">UnaryPredicate</span></code> is a
-              model of the <code class="computeroutput"><span class="identifier">PredicateConcept</span></code>.
-            </li>
+                <code class="computeroutput"><span class="identifier">UnaryPredicate</span></code> is
+                a model of the <code class="computeroutput"><span class="identifier">PredicateConcept</span></code>.
+              </li>
 <li class="listitem">
-              The value type of <code class="computeroutput"><span class="identifier">SinglePassRange</span></code>
-              is convertible to the argument type of <code class="computeroutput"><span class="identifier">UnaryPredicate</span></code>.
-            </li>
+                The value type of <code class="computeroutput"><span class="identifier">SinglePassRange</span></code>
+                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="id2760845"></a>
+<a name="id3335775"></a>
             <a class="link" href="find_if.html#range.reference.algorithms.non_mutating.find_if.precondition_">Precondition:</a>
           </h6>
 <p>
@@ -98,7 +98,7 @@
             <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="id2760918"></a>
+<a name="id3335849"></a>
             <a class="link" href="find_if.html#range.reference.algorithms.non_mutating.find_if.complexity">Complexity</a>
           </h6>
 <p>
@@ -115,7 +115,7 @@
 </tr></table>
 <hr>
 <div class="spirit-nav">
-<a accesskey="p" href="find_first_of.html"><img src="../../../../../../../../doc/html/images/prev.png" alt="Prev"></a><a accesskey="u" href="../non_mutating.html"><img src="../../../../../../../../doc/html/images/up.png" alt="Up"></a><a accesskey="h" href="../../../../index.html"><img src="../../../../../../../../doc/html/images/home.png" alt="Home"></a><a accesskey="n" href="lexicographical_compare.html"><img src="../../../../../../../../doc/html/images/next.png" alt="Next"></a>
+<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>
 </body>
 </html>
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 7d8792f..c8584f7 100644
--- a/doc/html/range/reference/algorithms/non_mutating/for_each.html
+++ b/doc/html/range/reference/algorithms/non_mutating/for_each.html
@@ -2,8 +2,8 @@
 <head>
 <meta http-equiv="Content-Type" content="text/html; charset=US-ASCII">
 <title>for_each</title>
-<link rel="stylesheet" href="../../../../../../../../doc/html/boostbook.css" type="text/css">
-<meta name="generator" content="DocBook XSL Stylesheets V1.75.1">
+<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="../non_mutating.html" title="Non-mutating algorithms">
 <link rel="prev" href="equal_range.html" title="equal_range">
@@ -13,22 +13,22 @@
 <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="../../../../../../../libraries.htm">Libraries</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="equal_range.html"><img src="../../../../../../../../doc/html/images/prev.png" alt="Prev"></a><a accesskey="u" href="../non_mutating.html"><img src="../../../../../../../../doc/html/images/up.png" alt="Up"></a><a accesskey="h" href="../../../../index.html"><img src="../../../../../../../../doc/html/images/home.png" alt="Home"></a><a accesskey="n" href="find.html"><img src="../../../../../../../../doc/html/images/next.png" alt="Next"></a>
+<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" title="for_each">
+<div class="section">
 <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="id2756411"></a>
+<a name="id3331251"></a>
             <a class="link" href="for_each.html#range.reference.algorithms.non_mutating.for_each.prototype">Prototype</a>
           </h6>
 <p>
@@ -49,7 +49,7 @@
 <p>
           </p>
 <a name="range.reference.algorithms.non_mutating.for_each.description"></a><h6>
-<a name="id2756639"></a>
+<a name="id3331478"></a>
             <a class="link" href="for_each.html#range.reference.algorithms.non_mutating.for_each.description">Description</a>
           </h6>
 <p>
@@ -59,38 +59,38 @@
             <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="id2756721"></a>
+<a name="id3331560"></a>
             <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="id2756794"></a>
+<a name="id3331633"></a>
             <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">
-<code class="computeroutput"><span class="identifier">SinglePassRange</span></code> is
-              a model of the <a class="link" href="../../../concepts/single_pass_range.html" title="Single Pass Range">Single
-              Pass Range</a> Concept.
-            </li>
+                <code class="computeroutput"><span class="identifier">SinglePassRange</span></code> is
+                a model of the <a class="link" href="../../../concepts/single_pass_range.html" title="Single Pass Range">Single
+                Pass Range</a> Concept.
+              </li>
 <li class="listitem">
-<code class="computeroutput"><span class="identifier">UnaryFunction</span></code> is a
-              model of the <code class="computeroutput"><span class="identifier">UnaryFunctionConcept</span></code>.
-            </li>
+                <code class="computeroutput"><span class="identifier">UnaryFunction</span></code> is
+                a model of the <code class="computeroutput"><span class="identifier">UnaryFunctionConcept</span></code>.
+              </li>
 <li class="listitem">
-<code class="computeroutput"><span class="identifier">UnaryFunction</span></code> does
-              not apply any non-constant operation through its argument.
-            </li>
+                <code class="computeroutput"><span class="identifier">UnaryFunction</span></code> does
+                not apply any non-constant operation through its argument.
+              </li>
 <li class="listitem">
-<code class="computeroutput"><span class="identifier">SinglePassRange</span></code>'s value
-              type is convertible to <code class="computeroutput"><span class="identifier">UnaryFunction</span></code>'s
-              argument type.
-            </li>
+                <code class="computeroutput"><span class="identifier">SinglePassRange</span></code>'s
+                value type is convertible to <code class="computeroutput"><span class="identifier">UnaryFunction</span></code>'s
+                argument type.
+              </li>
 </ul></div>
 <a name="range.reference.algorithms.non_mutating.for_each.complexity"></a><h6>
-<a name="id2756910"></a>
+<a name="id3331762"></a>
             <a class="link" href="for_each.html#range.reference.algorithms.non_mutating.for_each.complexity">Complexity</a>
           </h6>
 <p>
@@ -107,7 +107,7 @@
 </tr></table>
 <hr>
 <div class="spirit-nav">
-<a accesskey="p" href="equal_range.html"><img src="../../../../../../../../doc/html/images/prev.png" alt="Prev"></a><a accesskey="u" href="../non_mutating.html"><img src="../../../../../../../../doc/html/images/up.png" alt="Up"></a><a accesskey="h" href="../../../../index.html"><img src="../../../../../../../../doc/html/images/home.png" alt="Home"></a><a accesskey="n" href="find.html"><img src="../../../../../../../../doc/html/images/next.png" alt="Next"></a>
+<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>
 </body>
 </html>
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 e3e37ef..257ab7b 100644
--- a/doc/html/range/reference/algorithms/non_mutating/lexicographical_compare.html
+++ b/doc/html/range/reference/algorithms/non_mutating/lexicographical_compare.html
@@ -2,8 +2,8 @@
 <head>
 <meta http-equiv="Content-Type" content="text/html; charset=US-ASCII">
 <title>lexicographical_compare</title>
-<link rel="stylesheet" href="../../../../../../../../doc/html/boostbook.css" type="text/css">
-<meta name="generator" content="DocBook XSL Stylesheets V1.75.1">
+<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="../non_mutating.html" title="Non-mutating algorithms">
 <link rel="prev" href="find_if.html" title="find_if">
@@ -13,22 +13,22 @@
 <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="../../../../../../../libraries.htm">Libraries</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="find_if.html"><img src="../../../../../../../../doc/html/images/prev.png" alt="Prev"></a><a accesskey="u" href="../non_mutating.html"><img src="../../../../../../../../doc/html/images/up.png" alt="Up"></a><a accesskey="h" href="../../../../index.html"><img src="../../../../../../../../doc/html/images/home.png" alt="Home"></a><a accesskey="n" href="lower_bound.html"><img src="../../../../../../../../doc/html/images/next.png" alt="Next"></a>
+<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" title="lexicographical_compare">
+<div class="section">
 <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="id2761000"></a>
+<a name="id3335930"></a>
             <a class="link" href="lexicographical_compare.html#range.reference.algorithms.non_mutating.lexicographical_compare.prototype">Prototype</a>
           </h6>
 <p>
@@ -53,7 +53,7 @@
 <p>
           </p>
 <a name="range.reference.algorithms.non_mutating.lexicographical_compare.description"></a><h6>
-<a name="id2761287"></a>
+<a name="id3336217"></a>
             <a class="link" href="lexicographical_compare.html#range.reference.algorithms.non_mutating.lexicographical_compare.description">Description</a>
           </h6>
 <p>
@@ -73,14 +73,14 @@
             predicate versions.
           </p>
 <a name="range.reference.algorithms.non_mutating.lexicographical_compare.definition"></a><h6>
-<a name="id2761465"></a>
+<a name="id3336395"></a>
             <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="id2761540"></a>
+<a name="id3336470"></a>
             <a class="link" href="lexicographical_compare.html#range.reference.algorithms.non_mutating.lexicographical_compare.requirements">Requirements</a>
           </h6>
 <p>
@@ -88,64 +88,64 @@
           </p>
 <div class="itemizedlist"><ul class="itemizedlist" type="disc">
 <li class="listitem">
-<code class="computeroutput"><span class="identifier">SinglePassRange1</span></code> is
-              a model of the <a class="link" href="../../../concepts/single_pass_range.html" title="Single Pass Range">Single
-              Pass Range</a> Concept.
-            </li>
+                <code class="computeroutput"><span class="identifier">SinglePassRange1</span></code>
+                is a model of the <a class="link" href="../../../concepts/single_pass_range.html" title="Single Pass Range">Single
+                Pass Range</a> Concept.
+              </li>
 <li class="listitem">
-<code class="computeroutput"><span class="identifier">SinglePassRange2</span></code> is
-              a model of the <a class="link" href="../../../concepts/single_pass_range.html" title="Single Pass Range">Single
-              Pass Range</a> Concept.
-            </li>
+                <code class="computeroutput"><span class="identifier">SinglePassRange2</span></code>
+                is a model of the <a class="link" href="../../../concepts/single_pass_range.html" title="Single Pass Range">Single
+                Pass Range</a> Concept.
+              </li>
 <li class="listitem">
-<code class="computeroutput"><span class="identifier">SinglePassRange1</span></code>'s
-              value type is a model of the <code class="computeroutput"><span class="identifier">LessThanComparableConcept</span></code>.
-            </li>
+                <code class="computeroutput"><span class="identifier">SinglePassRange1</span></code>'s
+                value type is a model of the <code class="computeroutput"><span class="identifier">LessThanComparableConcept</span></code>.
+              </li>
 <li class="listitem">
-<code class="computeroutput"><span class="identifier">SinglePassRange2</span></code>'s
-              value type is a model of the <code class="computeroutput"><span class="identifier">LessThanComparableConcept</span></code>.
-            </li>
+                <code class="computeroutput"><span class="identifier">SinglePassRange2</span></code>'s
+                value type is a model of the <code class="computeroutput"><span class="identifier">LessThanComparableConcept</span></code>.
+              </li>
 <li class="listitem">
-              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
-              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.
-            </li>
+                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
+                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.
+              </li>
 </ul></div>
 <p>
             <span class="bold"><strong>For the predicate versions of lexicographical_compare:</strong></span>
           </p>
 <div class="itemizedlist"><ul class="itemizedlist" type="disc">
 <li class="listitem">
-<code class="computeroutput"><span class="identifier">SinglePassRange1</span></code> is
-              a model of the <a class="link" href="../../../concepts/single_pass_range.html" title="Single Pass Range">Single
-              Pass Range</a> Concept.
-            </li>
+                <code class="computeroutput"><span class="identifier">SinglePassRange1</span></code>
+                is a model of the <a class="link" href="../../../concepts/single_pass_range.html" title="Single Pass Range">Single
+                Pass Range</a> Concept.
+              </li>
 <li class="listitem">
-<code class="computeroutput"><span class="identifier">SinglePassRange2</span></code> is
-              a model of the <a class="link" href="../../../concepts/single_pass_range.html" title="Single Pass Range">Single
-              Pass Range</a> Concept.
-            </li>
+                <code class="computeroutput"><span class="identifier">SinglePassRange2</span></code>
+                is a model of the <a class="link" href="../../../concepts/single_pass_range.html" title="Single Pass Range">Single
+                Pass Range</a> Concept.
+              </li>
 <li class="listitem">
-<code class="computeroutput"><span class="identifier">BinaryPredicate</span></code> is
-              a model of the <code class="computeroutput"><span class="identifier">BinaryPredicateConcept</span></code>.
-            </li>
+                <code class="computeroutput"><span class="identifier">BinaryPredicate</span></code> is
+                a model of the <code class="computeroutput"><span class="identifier">BinaryPredicateConcept</span></code>.
+              </li>
 <li class="listitem">
-<code class="computeroutput"><span class="identifier">SinglePassRange1</span></code>'s
-              value type is convertible to <code class="computeroutput"><span class="identifier">BinaryPredicate</span></code>'s
-              first argument type.
-            </li>
+                <code class="computeroutput"><span class="identifier">SinglePassRange1</span></code>'s
+                value type is convertible to <code class="computeroutput"><span class="identifier">BinaryPredicate</span></code>'s
+                first argument type.
+              </li>
 <li class="listitem">
-<code class="computeroutput"><span class="identifier">SinglePassRange2</span></code>'s
-              value type is convertible to <code class="computeroutput"><span class="identifier">BinaryPredicate</span></code>'s
-              second argument type.
-            </li>
+                <code class="computeroutput"><span class="identifier">SinglePassRange2</span></code>'s
+                value type is convertible to <code class="computeroutput"><span class="identifier">BinaryPredicate</span></code>'s
+                second argument type.
+              </li>
 </ul></div>
 <a name="range.reference.algorithms.non_mutating.lexicographical_compare.complexity"></a><h6>
-<a name="id2761903"></a>
+<a name="id3336866"></a>
             <a class="link" href="lexicographical_compare.html#range.reference.algorithms.non_mutating.lexicographical_compare.complexity">Complexity</a>
           </h6>
 <p>
@@ -164,7 +164,7 @@
 </tr></table>
 <hr>
 <div class="spirit-nav">
-<a accesskey="p" href="find_if.html"><img src="../../../../../../../../doc/html/images/prev.png" alt="Prev"></a><a accesskey="u" href="../non_mutating.html"><img src="../../../../../../../../doc/html/images/up.png" alt="Up"></a><a accesskey="h" href="../../../../index.html"><img src="../../../../../../../../doc/html/images/home.png" alt="Home"></a><a accesskey="n" href="lower_bound.html"><img src="../../../../../../../../doc/html/images/next.png" alt="Next"></a>
+<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>
 </body>
 </html>
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 f18a5bc..0f92df5 100644
--- a/doc/html/range/reference/algorithms/non_mutating/lower_bound.html
+++ b/doc/html/range/reference/algorithms/non_mutating/lower_bound.html
@@ -2,8 +2,8 @@
 <head>
 <meta http-equiv="Content-Type" content="text/html; charset=US-ASCII">
 <title>lower_bound</title>
-<link rel="stylesheet" href="../../../../../../../../doc/html/boostbook.css" type="text/css">
-<meta name="generator" content="DocBook XSL Stylesheets V1.75.1">
+<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="../non_mutating.html" title="Non-mutating algorithms">
 <link rel="prev" href="lexicographical_compare.html" title="lexicographical_compare">
@@ -13,22 +13,22 @@
 <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="../../../../../../../libraries.htm">Libraries</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="lexicographical_compare.html"><img src="../../../../../../../../doc/html/images/prev.png" alt="Prev"></a><a accesskey="u" href="../non_mutating.html"><img src="../../../../../../../../doc/html/images/up.png" alt="Up"></a><a accesskey="h" href="../../../../index.html"><img src="../../../../../../../../doc/html/images/home.png" alt="Home"></a><a accesskey="n" href="max_element.html"><img src="../../../../../../../../doc/html/images/next.png" alt="Next"></a>
+<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" title="lower_bound">
+<div class="section">
 <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="id2762011"></a>
+<a name="id3336973"></a>
             <a class="link" href="lower_bound.html#range.reference.algorithms.non_mutating.lower_bound.prototype">Prototype</a>
           </h6>
 <p>
@@ -49,7 +49,7 @@
 <p>
           </p>
 <a name="range.reference.algorithms.non_mutating.lower_bound.description"></a><h6>
-<a name="id2762305"></a>
+<a name="id3337268"></a>
             <a class="link" href="lower_bound.html#range.reference.algorithms.non_mutating.lower_bound.description">Description</a>
           </h6>
 <p>
@@ -72,14 +72,14 @@
             same manner as the returned iterator described above.
           </p>
 <a name="range.reference.algorithms.non_mutating.lower_bound.definition"></a><h6>
-<a name="id2762505"></a>
+<a name="id3337467"></a>
             <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="id2762577"></a>
+<a name="id3337539"></a>
             <a class="link" href="lower_bound.html#range.reference.algorithms.non_mutating.lower_bound.requirements">Requirements</a>
           </h6>
 <p>
@@ -87,50 +87,50 @@
           </p>
 <div class="itemizedlist"><ul class="itemizedlist" type="disc">
 <li class="listitem">
-<code class="computeroutput"><span class="identifier">ForwardRange</span></code> is a model
-              of the <a class="link" href="../../../concepts/forward_range.html" title="Forward Range">Forward Range</a>
-              Concept.
-            </li>
+                <code class="computeroutput"><span class="identifier">ForwardRange</span></code> is a
+                model of the <a class="link" href="../../../concepts/forward_range.html" title="Forward Range">Forward
+                Range</a> Concept.
+              </li>
 <li class="listitem">
-<code class="computeroutput"><span class="identifier">Value</span></code> is a model of
-              the <code class="computeroutput"><span class="identifier">LessThanComparableConcept</span></code>.
-            </li>
+                <code class="computeroutput"><span class="identifier">Value</span></code> is a model
+                of the <code class="computeroutput"><span class="identifier">LessThanComparableConcept</span></code>.
+              </li>
 <li class="listitem">
-              The ordering of objects of type <code class="computeroutput"><span class="identifier">Value</span></code>
-              is a <span class="bold"><strong><span class="emphasis"><em>strict weak ordering</em></span></strong></span>,
-              as defined in the <code class="computeroutput"><span class="identifier">LessThanComparableConcept</span></code>
-              requirements.
-            </li>
+                The ordering of objects of type <code class="computeroutput"><span class="identifier">Value</span></code>
+                is a <span class="bold"><strong><span class="emphasis"><em>strict weak ordering</em></span></strong></span>,
+                as defined in the <code class="computeroutput"><span class="identifier">LessThanComparableConcept</span></code>
+                requirements.
+              </li>
 <li class="listitem">
-<code class="computeroutput"><span class="identifier">ForwardRange</span></code>'s value
-              type is the same type as <code class="computeroutput"><span class="identifier">Value</span></code>.
-            </li>
+                <code class="computeroutput"><span class="identifier">ForwardRange</span></code>'s value
+                type is the same type as <code class="computeroutput"><span class="identifier">Value</span></code>.
+              </li>
 </ul></div>
 <p>
             <span class="bold"><strong>For the predicate versions:</strong></span>
           </p>
 <div class="itemizedlist"><ul class="itemizedlist" type="disc">
 <li class="listitem">
-<code class="computeroutput"><span class="identifier">ForwardRange</span></code> is a model
-              of the <a class="link" href="../../../concepts/forward_range.html" title="Forward Range">Forward Range</a>
-              Concept.
-            </li>
+                <code class="computeroutput"><span class="identifier">ForwardRange</span></code> is a
+                model of the <a class="link" href="../../../concepts/forward_range.html" title="Forward Range">Forward
+                Range</a> Concept.
+              </li>
 <li class="listitem">
-<code class="computeroutput"><span class="identifier">BinaryPredicate</span></code> is
-              a model of the <code class="computeroutput"><span class="identifier">StrictWeakOrderingConcept</span></code>.
-            </li>
+                <code class="computeroutput"><span class="identifier">BinaryPredicate</span></code> is
+                a model of the <code class="computeroutput"><span class="identifier">StrictWeakOrderingConcept</span></code>.
+              </li>
 <li class="listitem">
-<code class="computeroutput"><span class="identifier">ForwardRange</span></code>'s value
-              type is the same type as <code class="computeroutput"><span class="identifier">Value</span></code>.
-            </li>
+                <code class="computeroutput"><span class="identifier">ForwardRange</span></code>'s value
+                type is the same type as <code class="computeroutput"><span class="identifier">Value</span></code>.
+              </li>
 <li class="listitem">
-<code class="computeroutput"><span class="identifier">ForwardRange</span></code>'s value
-              type is convertible to both of <code class="computeroutput"><span class="identifier">BinaryPredicate</span></code>'s
-              argument types.
-            </li>
+                <code class="computeroutput"><span class="identifier">ForwardRange</span></code>'s value
+                type is convertible to both of <code class="computeroutput"><span class="identifier">BinaryPredicate</span></code>'s
+                argument types.
+              </li>
 </ul></div>
 <a name="range.reference.algorithms.non_mutating.lower_bound.precondition_"></a><h6>
-<a name="id2762834"></a>
+<a name="id3337822"></a>
             <a class="link" href="lower_bound.html#range.reference.algorithms.non_mutating.lower_bound.precondition_">Precondition:</a>
           </h6>
 <p>
@@ -148,7 +148,7 @@
             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="id2762931"></a>
+<a name="id3337919"></a>
             <a class="link" href="lower_bound.html#range.reference.algorithms.non_mutating.lower_bound.complexity">Complexity</a>
           </h6>
 <p>
@@ -170,7 +170,7 @@
 </tr></table>
 <hr>
 <div class="spirit-nav">
-<a accesskey="p" href="lexicographical_compare.html"><img src="../../../../../../../../doc/html/images/prev.png" alt="Prev"></a><a accesskey="u" href="../non_mutating.html"><img src="../../../../../../../../doc/html/images/up.png" alt="Up"></a><a accesskey="h" href="../../../../index.html"><img src="../../../../../../../../doc/html/images/home.png" alt="Home"></a><a accesskey="n" href="max_element.html"><img src="../../../../../../../../doc/html/images/next.png" alt="Next"></a>
+<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>
 </body>
 </html>
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 9216f88..173b281 100644
--- a/doc/html/range/reference/algorithms/non_mutating/max_element.html
+++ b/doc/html/range/reference/algorithms/non_mutating/max_element.html
@@ -2,8 +2,8 @@
 <head>
 <meta http-equiv="Content-Type" content="text/html; charset=US-ASCII">
 <title>max_element</title>
-<link rel="stylesheet" href="../../../../../../../../doc/html/boostbook.css" type="text/css">
-<meta name="generator" content="DocBook XSL Stylesheets V1.75.1">
+<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="../non_mutating.html" title="Non-mutating algorithms">
 <link rel="prev" href="lower_bound.html" title="lower_bound">
@@ -13,22 +13,22 @@
 <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="../../../../../../../libraries.htm">Libraries</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="lower_bound.html"><img src="../../../../../../../../doc/html/images/prev.png" alt="Prev"></a><a accesskey="u" href="../non_mutating.html"><img src="../../../../../../../../doc/html/images/up.png" alt="Up"></a><a accesskey="h" href="../../../../index.html"><img src="../../../../../../../../doc/html/images/home.png" alt="Home"></a><a accesskey="n" href="min_element.html"><img src="../../../../../../../../doc/html/images/next.png" alt="Next"></a>
+<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" title="max_element">
+<div class="section">
 <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="id2763077"></a>
+<a name="id3338066"></a>
             <a class="link" href="max_element.html#range.reference.algorithms.non_mutating.max_element.prototype">Prototype</a>
           </h6>
 <p>
@@ -84,7 +84,7 @@
 <p>
           </p>
 <a name="range.reference.algorithms.non_mutating.max_element.description"></a><h6>
-<a name="id2764072"></a>
+<a name="id3339061"></a>
             <a class="link" href="max_element.html#range.reference.algorithms.non_mutating.max_element.description">Description</a>
           </h6>
 <p>
@@ -98,14 +98,14 @@
             same manner as the returned iterator described above.
           </p>
 <a name="range.reference.algorithms.non_mutating.max_element.definition"></a><h6>
-<a name="id2764175"></a>
+<a name="id3339163"></a>
             <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="id2764248"></a>
+<a name="id3339237"></a>
             <a class="link" href="max_element.html#range.reference.algorithms.non_mutating.max_element.requirements">Requirements</a>
           </h6>
 <p>
@@ -113,36 +113,36 @@
           </p>
 <div class="itemizedlist"><ul class="itemizedlist" type="disc">
 <li class="listitem">
-<code class="computeroutput"><span class="identifier">ForwardRange</span></code> is a model
-              of the <a class="link" href="../../../concepts/forward_range.html" title="Forward Range">Forward Range</a>
-              Concept.
-            </li>
+                <code class="computeroutput"><span class="identifier">ForwardRange</span></code> is a
+                model of the <a class="link" href="../../../concepts/forward_range.html" title="Forward Range">Forward
+                Range</a> Concept.
+              </li>
 <li class="listitem">
-<code class="computeroutput"><span class="identifier">ForwardRange</span></code>'s value
-              type is a model of the <code class="computeroutput"><span class="identifier">LessThanComparableConcept</span></code>.
-            </li>
+                <code class="computeroutput"><span class="identifier">ForwardRange</span></code>'s value
+                type is a model of the <code class="computeroutput"><span class="identifier">LessThanComparableConcept</span></code>.
+              </li>
 </ul></div>
 <p>
             <span class="bold"><strong>For the predicate versions:</strong></span>
           </p>
 <div class="itemizedlist"><ul class="itemizedlist" type="disc">
 <li class="listitem">
-<code class="computeroutput"><span class="identifier">ForwardRange</span></code> is a model
-              of the <a class="link" href="../../../concepts/forward_range.html" title="Forward Range">Forward Range</a>
-              Concept.
-            </li>
+                <code class="computeroutput"><span class="identifier">ForwardRange</span></code> is a
+                model of the <a class="link" href="../../../concepts/forward_range.html" title="Forward Range">Forward
+                Range</a> Concept.
+              </li>
 <li class="listitem">
-<code class="computeroutput"><span class="identifier">BinaryPredicate</span></code> is
-              a model of the <code class="computeroutput"><span class="identifier">BinaryPredicateConcept</span></code>.
-            </li>
+                <code class="computeroutput"><span class="identifier">BinaryPredicate</span></code> is
+                a model of the <code class="computeroutput"><span class="identifier">BinaryPredicateConcept</span></code>.
+              </li>
 <li class="listitem">
-<code class="computeroutput"><span class="identifier">ForwardRange</span></code>'s value
-              type is convertible to both of <code class="computeroutput"><span class="identifier">BinaryPredicate</span></code>'s
-              argument types.
-            </li>
+                <code class="computeroutput"><span class="identifier">ForwardRange</span></code>'s value
+                type is convertible to both of <code class="computeroutput"><span class="identifier">BinaryPredicate</span></code>'s
+                argument types.
+              </li>
 </ul></div>
 <a name="range.reference.algorithms.non_mutating.max_element.complexity"></a><h6>
-<a name="id2764420"></a>
+<a name="id3339424"></a>
             <a class="link" href="max_element.html#range.reference.algorithms.non_mutating.max_element.complexity">Complexity</a>
           </h6>
 <p>
@@ -160,7 +160,7 @@
 </tr></table>
 <hr>
 <div class="spirit-nav">
-<a accesskey="p" href="lower_bound.html"><img src="../../../../../../../../doc/html/images/prev.png" alt="Prev"></a><a accesskey="u" href="../non_mutating.html"><img src="../../../../../../../../doc/html/images/up.png" alt="Up"></a><a accesskey="h" href="../../../../index.html"><img src="../../../../../../../../doc/html/images/home.png" alt="Home"></a><a accesskey="n" href="min_element.html"><img src="../../../../../../../../doc/html/images/next.png" alt="Next"></a>
+<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>
 </body>
 </html>
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 4abd6a8..14f7973 100644
--- a/doc/html/range/reference/algorithms/non_mutating/min_element.html
+++ b/doc/html/range/reference/algorithms/non_mutating/min_element.html
@@ -2,8 +2,8 @@
 <head>
 <meta http-equiv="Content-Type" content="text/html; charset=US-ASCII">
 <title>min_element</title>
-<link rel="stylesheet" href="../../../../../../../../doc/html/boostbook.css" type="text/css">
-<meta name="generator" content="DocBook XSL Stylesheets V1.75.1">
+<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="../non_mutating.html" title="Non-mutating algorithms">
 <link rel="prev" href="max_element.html" title="max_element">
@@ -13,22 +13,22 @@
 <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="../../../../../../../libraries.htm">Libraries</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="max_element.html"><img src="../../../../../../../../doc/html/images/prev.png" alt="Prev"></a><a accesskey="u" href="../non_mutating.html"><img src="../../../../../../../../doc/html/images/up.png" alt="Up"></a><a accesskey="h" href="../../../../index.html"><img src="../../../../../../../../doc/html/images/home.png" alt="Home"></a><a accesskey="n" href="mismatch.html"><img src="../../../../../../../../doc/html/images/next.png" alt="Next"></a>
+<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" title="min_element">
+<div class="section">
 <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="id2764523"></a>
+<a name="id3339527"></a>
             <a class="link" href="min_element.html#range.reference.algorithms.non_mutating.min_element.prototype">Prototype</a>
           </h6>
 <p>
@@ -84,7 +84,7 @@
 <p>
           </p>
 <a name="range.reference.algorithms.non_mutating.min_element.description"></a><h6>
-<a name="id2765518"></a>
+<a name="id3340522"></a>
             <a class="link" href="min_element.html#range.reference.algorithms.non_mutating.min_element.description">Description</a>
           </h6>
 <p>
@@ -98,14 +98,14 @@
             same manner as the returned iterator described above.
           </p>
 <a name="range.reference.algorithms.non_mutating.min_element.definition"></a><h6>
-<a name="id2765621"></a>
+<a name="id3340625"></a>
             <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="id2765694"></a>
+<a name="id3340699"></a>
             <a class="link" href="min_element.html#range.reference.algorithms.non_mutating.min_element.requirements">Requirements</a>
           </h6>
 <p>
@@ -113,36 +113,36 @@
           </p>
 <div class="itemizedlist"><ul class="itemizedlist" type="disc">
 <li class="listitem">
-<code class="computeroutput"><span class="identifier">ForwardRange</span></code> is a model
-              of the <a class="link" href="../../../concepts/forward_range.html" title="Forward Range">Forward Range</a>
-              Concept.
-            </li>
+                <code class="computeroutput"><span class="identifier">ForwardRange</span></code> is a
+                model of the <a class="link" href="../../../concepts/forward_range.html" title="Forward Range">Forward
+                Range</a> Concept.
+              </li>
 <li class="listitem">
-<code class="computeroutput"><span class="identifier">ForwardRange</span></code>'s value
-              type is a model of the <code class="computeroutput"><span class="identifier">LessThanComparableConcept</span></code>.
-            </li>
+                <code class="computeroutput"><span class="identifier">ForwardRange</span></code>'s value
+                type is a model of the <code class="computeroutput"><span class="identifier">LessThanComparableConcept</span></code>.
+              </li>
 </ul></div>
 <p>
             <span class="bold"><strong>For the predicate versions:</strong></span>
           </p>
 <div class="itemizedlist"><ul class="itemizedlist" type="disc">
 <li class="listitem">
-<code class="computeroutput"><span class="identifier">ForwardRange</span></code> is a model
-              of the <a class="link" href="../../../concepts/forward_range.html" title="Forward Range">Forward Range</a>
-              Concept.
-            </li>
+                <code class="computeroutput"><span class="identifier">ForwardRange</span></code> is a
+                model of the <a class="link" href="../../../concepts/forward_range.html" title="Forward Range">Forward
+                Range</a> Concept.
+              </li>
 <li class="listitem">
-<code class="computeroutput"><span class="identifier">BinaryPredicate</span></code> is
-              a model of the <code class="computeroutput"><span class="identifier">BinaryPredicateConcept</span></code>.
-            </li>
+                <code class="computeroutput"><span class="identifier">BinaryPredicate</span></code> is
+                a model of the <code class="computeroutput"><span class="identifier">BinaryPredicateConcept</span></code>.
+              </li>
 <li class="listitem">
-<code class="computeroutput"><span class="identifier">ForwardRange</span></code>'s value
-              type is convertible to both of <code class="computeroutput"><span class="identifier">BinaryPredicate</span></code>'s
-              argument types.
-            </li>
+                <code class="computeroutput"><span class="identifier">ForwardRange</span></code>'s value
+                type is convertible to both of <code class="computeroutput"><span class="identifier">BinaryPredicate</span></code>'s
+                argument types.
+              </li>
 </ul></div>
 <a name="range.reference.algorithms.non_mutating.min_element.complexity"></a><h6>
-<a name="id2765866"></a>
+<a name="id3340886"></a>
             <a class="link" href="min_element.html#range.reference.algorithms.non_mutating.min_element.complexity">Complexity</a>
           </h6>
 <p>
@@ -160,7 +160,7 @@
 </tr></table>
 <hr>
 <div class="spirit-nav">
-<a accesskey="p" href="max_element.html"><img src="../../../../../../../../doc/html/images/prev.png" alt="Prev"></a><a accesskey="u" href="../non_mutating.html"><img src="../../../../../../../../doc/html/images/up.png" alt="Up"></a><a accesskey="h" href="../../../../index.html"><img src="../../../../../../../../doc/html/images/home.png" alt="Home"></a><a accesskey="n" href="mismatch.html"><img src="../../../../../../../../doc/html/images/next.png" alt="Next"></a>
+<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>
 </body>
 </html>
diff --git a/doc/html/range/reference/algorithms/non_mutating/mismatch.html b/doc/html/range/reference/algorithms/non_mutating/mismatch.html
index d740dce..0ae3639 100644
--- a/doc/html/range/reference/algorithms/non_mutating/mismatch.html
+++ b/doc/html/range/reference/algorithms/non_mutating/mismatch.html
@@ -2,8 +2,8 @@
 <head>
 <meta http-equiv="Content-Type" content="text/html; charset=US-ASCII">
 <title>mismatch</title>
-<link rel="stylesheet" href="../../../../../../../../doc/html/boostbook.css" type="text/css">
-<meta name="generator" content="DocBook XSL Stylesheets V1.75.1">
+<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="../non_mutating.html" title="Non-mutating algorithms">
 <link rel="prev" href="min_element.html" title="min_element">
@@ -13,22 +13,22 @@
 <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="../../../../../../../libraries.htm">Libraries</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="min_element.html"><img src="../../../../../../../../doc/html/images/prev.png" alt="Prev"></a><a accesskey="u" href="../non_mutating.html"><img src="../../../../../../../../doc/html/images/up.png" alt="Up"></a><a accesskey="h" href="../../../../index.html"><img src="../../../../../../../../doc/html/images/home.png" alt="Home"></a><a accesskey="n" href="search.html"><img src="../../../../../../../../doc/html/images/next.png" alt="Next"></a>
+<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" title="mismatch">
+<div class="section">
 <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="id2765970"></a>
+<a name="id3340990"></a>
             <a class="link" href="mismatch.html#range.reference.algorithms.non_mutating.mismatch.prototype">Prototype</a>
           </h6>
 <p>
@@ -106,7 +106,7 @@
 <p>
           </p>
 <a name="range.reference.algorithms.non_mutating.mismatch.description"></a><h6>
-<a name="id2767688"></a>
+<a name="id3342708"></a>
             <a class="link" href="mismatch.html#range.reference.algorithms.non_mutating.mismatch.description">Description</a>
           </h6>
 <p>
@@ -118,14 +118,14 @@
             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="id2767790"></a>
+<a name="id3342810"></a>
             <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="id2767863"></a>
+<a name="id3342883"></a>
             <a class="link" href="mismatch.html#range.reference.algorithms.non_mutating.mismatch.requirements">Requirements</a>
           </h6>
 <p>
@@ -133,67 +133,67 @@
           </p>
 <div class="itemizedlist"><ul class="itemizedlist" type="disc">
 <li class="listitem">
-<code class="computeroutput"><span class="identifier">SinglePassRange1</span></code> is
-              a model of the <a class="link" href="../../../concepts/single_pass_range.html" title="Single Pass Range">Single
-              Pass Range</a> Concept.
-            </li>
+                <code class="computeroutput"><span class="identifier">SinglePassRange1</span></code>
+                is a model of the <a class="link" href="../../../concepts/single_pass_range.html" title="Single Pass Range">Single
+                Pass Range</a> Concept.
+              </li>
 <li class="listitem">
-<code class="computeroutput"><span class="identifier">SinglePassRange2</span></code> is
-              a model of the <a class="link" href="../../../concepts/single_pass_range.html" title="Single Pass Range">Single
-              Pass Range</a> Concept.
-            </li>
+                <code class="computeroutput"><span class="identifier">SinglePassRange2</span></code>
+                is a model of the <a class="link" href="../../../concepts/single_pass_range.html" title="Single Pass Range">Single
+                Pass Range</a> Concept.
+              </li>
 <li class="listitem">
-<code class="computeroutput"><span class="identifier">SinglePassRange1</span></code>'s
-              value type is a model of the <code class="computeroutput"><span class="identifier">EqualityComparableConcept</span></code>.
-            </li>
+                <code class="computeroutput"><span class="identifier">SinglePassRange1</span></code>'s
+                value type is a model of the <code class="computeroutput"><span class="identifier">EqualityComparableConcept</span></code>.
+              </li>
 <li class="listitem">
-<code class="computeroutput"><span class="identifier">SinglePassRange2</span></code>'s
-              value type is a model of the <code class="computeroutput"><span class="identifier">EqualityComparableConcept</span></code>.
-            </li>
+                <code class="computeroutput"><span class="identifier">SinglePassRange2</span></code>'s
+                value type is a model of the <code class="computeroutput"><span class="identifier">EqualityComparableConcept</span></code>.
+              </li>
 <li class="listitem">
-<code class="computeroutput"><span class="identifier">SinglePassRange1</span></code>s value
-              type can be compared for equality with <code class="computeroutput"><span class="identifier">SinglePassRange2</span></code>'s
-              value type.
-            </li>
+                <code class="computeroutput"><span class="identifier">SinglePassRange1</span></code>s
+                value type can be compared for equality with <code class="computeroutput"><span class="identifier">SinglePassRange2</span></code>'s
+                value type.
+              </li>
 </ul></div>
 <p>
             <span class="bold"><strong>For the predicate versions:</strong></span>
           </p>
 <div class="itemizedlist"><ul class="itemizedlist" type="disc">
 <li class="listitem">
-<code class="computeroutput"><span class="identifier">SinglePassRange1</span></code> is
-              a model of the <a class="link" href="../../../concepts/single_pass_range.html" title="Single Pass Range">Single
-              Pass Range</a> Concept.
-            </li>
+                <code class="computeroutput"><span class="identifier">SinglePassRange1</span></code>
+                is a model of the <a class="link" href="../../../concepts/single_pass_range.html" title="Single Pass Range">Single
+                Pass Range</a> Concept.
+              </li>
 <li class="listitem">
-<code class="computeroutput"><span class="identifier">SinglePassRange2</span></code> is
-              a model of the <a class="link" href="../../../concepts/single_pass_range.html" title="Single Pass Range">Single
-              Pass Range</a> Concept.
-            </li>
+                <code class="computeroutput"><span class="identifier">SinglePassRange2</span></code>
+                is a model of the <a class="link" href="../../../concepts/single_pass_range.html" title="Single Pass Range">Single
+                Pass Range</a> Concept.
+              </li>
 <li class="listitem">
-<code class="computeroutput"><span class="identifier">BinaryPredicate</span></code> is
-              a model of the <code class="computeroutput"><span class="identifier">BinaryPredicateConcept</span></code>.
-            </li>
+                <code class="computeroutput"><span class="identifier">BinaryPredicate</span></code> is
+                a model of the <code class="computeroutput"><span class="identifier">BinaryPredicateConcept</span></code>.
+              </li>
 <li class="listitem">
-<code class="computeroutput"><span class="identifier">SinglePassRange1</span></code>'s
-              value type is convertible to <code class="computeroutput"><span class="identifier">BinaryPredicate</span></code>'s
-              first argument type.
-            </li>
+                <code class="computeroutput"><span class="identifier">SinglePassRange1</span></code>'s
+                value type is convertible to <code class="computeroutput"><span class="identifier">BinaryPredicate</span></code>'s
+                first argument type.
+              </li>
 <li class="listitem">
-<code class="computeroutput"><span class="identifier">SinglePassRange2</span></code>'s
-              value type is convertible to <code class="computeroutput"><span class="identifier">BinaryPredicate</span></code>'s
-              second argument type.
-            </li>
+                <code class="computeroutput"><span class="identifier">SinglePassRange2</span></code>'s
+                value type is convertible to <code class="computeroutput"><span class="identifier">BinaryPredicate</span></code>'s
+                second argument type.
+              </li>
 </ul></div>
 <a name="range.reference.algorithms.non_mutating.mismatch.precondition_"></a><h6>
-<a name="id2768160"></a>
+<a name="id3343213"></a>
             <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="id2768235"></a>
+<a name="id3343288"></a>
             <a class="link" href="mismatch.html#range.reference.algorithms.non_mutating.mismatch.complexity">Complexity</a>
           </h6>
 <p>
@@ -210,7 +210,7 @@
 </tr></table>
 <hr>
 <div class="spirit-nav">
-<a accesskey="p" href="min_element.html"><img src="../../../../../../../../doc/html/images/prev.png" alt="Prev"></a><a accesskey="u" href="../non_mutating.html"><img src="../../../../../../../../doc/html/images/up.png" alt="Up"></a><a accesskey="h" href="../../../../index.html"><img src="../../../../../../../../doc/html/images/home.png" alt="Home"></a><a accesskey="n" href="search.html"><img src="../../../../../../../../doc/html/images/next.png" alt="Next"></a>
+<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>
 </body>
 </html>
diff --git a/doc/html/range/reference/algorithms/non_mutating/search.html b/doc/html/range/reference/algorithms/non_mutating/search.html
index 9746802..9c4f86a 100644
--- a/doc/html/range/reference/algorithms/non_mutating/search.html
+++ b/doc/html/range/reference/algorithms/non_mutating/search.html
@@ -2,8 +2,8 @@
 <head>
 <meta http-equiv="Content-Type" content="text/html; charset=US-ASCII">
 <title>search</title>
-<link rel="stylesheet" href="../../../../../../../../doc/html/boostbook.css" type="text/css">
-<meta name="generator" content="DocBook XSL Stylesheets V1.75.1">
+<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="../non_mutating.html" title="Non-mutating algorithms">
 <link rel="prev" href="mismatch.html" title="mismatch">
@@ -13,22 +13,22 @@
 <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="../../../../../../../libraries.htm">Libraries</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="mismatch.html"><img src="../../../../../../../../doc/html/images/prev.png" alt="Prev"></a><a accesskey="u" href="../non_mutating.html"><img src="../../../../../../../../doc/html/images/up.png" alt="Up"></a><a accesskey="h" href="../../../../index.html"><img src="../../../../../../../../doc/html/images/home.png" alt="Home"></a><a accesskey="n" href="search_n.html"><img src="../../../../../../../../doc/html/images/next.png" alt="Next"></a>
+<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" title="search">
+<div class="section">
 <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="id2768305"></a>
+<a name="id3343358"></a>
             <a class="link" href="search.html#range.reference.algorithms.non_mutating.search.prototype">Prototype</a>
           </h6>
 <p>
@@ -96,7 +96,7 @@
 <p>
           </p>
 <a name="range.reference.algorithms.non_mutating.search.description"></a><h6>
-<a name="id2769651"></a>
+<a name="id3344704"></a>
             <a class="link" href="search.html#range.reference.algorithms.non_mutating.search.description">Description</a>
           </h6>
 <p>
@@ -115,14 +115,14 @@
             same manner as the returned iterator described above.
           </p>
 <a name="range.reference.algorithms.non_mutating.search.definition"></a><h6>
-<a name="id2769825"></a>
+<a name="id3344878"></a>
             <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="id2769898"></a>
+<a name="id3344951"></a>
             <a class="link" href="search.html#range.reference.algorithms.non_mutating.search.requirements">Requirements</a>
           </h6>
 <p>
@@ -130,60 +130,60 @@
           </p>
 <div class="itemizedlist"><ul class="itemizedlist" type="disc">
 <li class="listitem">
-<code class="computeroutput"><span class="identifier">ForwardRange1</span></code> is a
-              model of the <a class="link" href="../../../concepts/forward_range.html" title="Forward Range">Forward Range</a>
-              Concept.
-            </li>
+                <code class="computeroutput"><span class="identifier">ForwardRange1</span></code> is
+                a model of the <a class="link" href="../../../concepts/forward_range.html" title="Forward Range">Forward
+                Range</a> Concept.
+              </li>
 <li class="listitem">
-<code class="computeroutput"><span class="identifier">ForwardRange2</span></code> is a
-              model of the <a class="link" href="../../../concepts/forward_range.html" title="Forward Range">Forward Range</a>
-              Concept.
-            </li>
+                <code class="computeroutput"><span class="identifier">ForwardRange2</span></code> is
+                a model of the <a class="link" href="../../../concepts/forward_range.html" title="Forward Range">Forward
+                Range</a> Concept.
+              </li>
 <li class="listitem">
-<code class="computeroutput"><span class="identifier">ForwardRange1</span></code>'s value
-              type is a model of the <code class="computeroutput"><span class="identifier">EqualityComparableConcept</span></code>.
-            </li>
+                <code class="computeroutput"><span class="identifier">ForwardRange1</span></code>'s value
+                type is a model of the <code class="computeroutput"><span class="identifier">EqualityComparableConcept</span></code>.
+              </li>
 <li class="listitem">
-<code class="computeroutput"><span class="identifier">ForwardRange2</span></code>'s value
-              type is a model of the <code class="computeroutput"><span class="identifier">EqualityComparableConcept</span></code>.
-            </li>
+                <code class="computeroutput"><span class="identifier">ForwardRange2</span></code>'s value
+                type is a model of the <code class="computeroutput"><span class="identifier">EqualityComparableConcept</span></code>.
+              </li>
 <li class="listitem">
-<code class="computeroutput"><span class="identifier">ForwardRange1</span></code>s value
-              type can be compared for equality with <code class="computeroutput"><span class="identifier">ForwardRange2</span></code>'s
-              value type.
-            </li>
+                <code class="computeroutput"><span class="identifier">ForwardRange1</span></code>s value
+                type can be compared for equality with <code class="computeroutput"><span class="identifier">ForwardRange2</span></code>'s
+                value type.
+              </li>
 </ul></div>
 <p>
             <span class="bold"><strong>For the predicate versions:</strong></span>
           </p>
 <div class="itemizedlist"><ul class="itemizedlist" type="disc">
 <li class="listitem">
-<code class="computeroutput"><span class="identifier">ForwardRange1</span></code> is a
-              model of the <a class="link" href="../../../concepts/forward_range.html" title="Forward Range">Forward Range</a>
-              Concept.
-            </li>
+                <code class="computeroutput"><span class="identifier">ForwardRange1</span></code> is
+                a model of the <a class="link" href="../../../concepts/forward_range.html" title="Forward Range">Forward
+                Range</a> Concept.
+              </li>
 <li class="listitem">
-<code class="computeroutput"><span class="identifier">ForwardRange2</span></code> is a
-              model of the <a class="link" href="../../../concepts/forward_range.html" title="Forward Range">Forward Range</a>
-              Concept.
-            </li>
+                <code class="computeroutput"><span class="identifier">ForwardRange2</span></code> is
+                a model of the <a class="link" href="../../../concepts/forward_range.html" title="Forward Range">Forward
+                Range</a> Concept.
+              </li>
 <li class="listitem">
-<code class="computeroutput"><span class="identifier">BinaryPredicate</span></code> is
-              a model of the <code class="computeroutput"><span class="identifier">BinaryPredicateConcept</span></code>.
-            </li>
+                <code class="computeroutput"><span class="identifier">BinaryPredicate</span></code> is
+                a model of the <code class="computeroutput"><span class="identifier">BinaryPredicateConcept</span></code>.
+              </li>
 <li class="listitem">
-<code class="computeroutput"><span class="identifier">ForwardRange1</span></code>'s value
-              type is convertible to <code class="computeroutput"><span class="identifier">BinaryPredicate</span></code>'s
-              first argument type.
-            </li>
+                <code class="computeroutput"><span class="identifier">ForwardRange1</span></code>'s value
+                type is convertible to <code class="computeroutput"><span class="identifier">BinaryPredicate</span></code>'s
+                first argument type.
+              </li>
 <li class="listitem">
-<code class="computeroutput"><span class="identifier">ForwardRange2</span></code>'s value
-              type is convertible to <code class="computeroutput"><span class="identifier">BinaryPredicate</span></code>'s
-              second argument type.
-            </li>
+                <code class="computeroutput"><span class="identifier">ForwardRange2</span></code>'s value
+                type is convertible to <code class="computeroutput"><span class="identifier">BinaryPredicate</span></code>'s
+                second argument type.
+              </li>
 </ul></div>
 <a name="range.reference.algorithms.non_mutating.search.complexity"></a><h6>
-<a name="id2770194"></a>
+<a name="id3345279"></a>
             <a class="link" href="search.html#range.reference.algorithms.non_mutating.search.complexity">Complexity</a>
           </h6>
 <p>
@@ -200,7 +200,7 @@
 </tr></table>
 <hr>
 <div class="spirit-nav">
-<a accesskey="p" href="mismatch.html"><img src="../../../../../../../../doc/html/images/prev.png" alt="Prev"></a><a accesskey="u" href="../non_mutating.html"><img src="../../../../../../../../doc/html/images/up.png" alt="Up"></a><a accesskey="h" href="../../../../index.html"><img src="../../../../../../../../doc/html/images/home.png" alt="Home"></a><a accesskey="n" href="search_n.html"><img src="../../../../../../../../doc/html/images/next.png" alt="Next"></a>
+<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>
 </body>
 </html>
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 2b94b7f..1961ecf 100644
--- a/doc/html/range/reference/algorithms/non_mutating/search_n.html
+++ b/doc/html/range/reference/algorithms/non_mutating/search_n.html
@@ -2,8 +2,8 @@
 <head>
 <meta http-equiv="Content-Type" content="text/html; charset=US-ASCII">
 <title>search_n</title>
-<link rel="stylesheet" href="../../../../../../../../doc/html/boostbook.css" type="text/css">
-<meta name="generator" content="DocBook XSL Stylesheets V1.75.1">
+<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="../non_mutating.html" title="Non-mutating algorithms">
 <link rel="prev" href="search.html" title="search">
@@ -13,22 +13,22 @@
 <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="../../../../../../../libraries.htm">Libraries</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="search.html"><img src="../../../../../../../../doc/html/images/prev.png" alt="Prev"></a><a accesskey="u" href="../non_mutating.html"><img src="../../../../../../../../doc/html/images/up.png" alt="Up"></a><a accesskey="h" href="../../../../index.html"><img src="../../../../../../../../doc/html/images/home.png" alt="Home"></a><a accesskey="n" href="upper_bound.html"><img src="../../../../../../../../doc/html/images/next.png" alt="Next"></a>
+<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" title="search_n">
+<div class="section">
 <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="id2770237"></a>
+<a name="id3345322"></a>
             <a class="link" href="search_n.html#range.reference.algorithms.non_mutating.search_n.prototype">Prototype</a>
           </h6>
 <p>
@@ -55,7 +55,7 @@
 <p>
           </p>
 <a name="range.reference.algorithms.non_mutating.search_n.description"></a><h6>
-<a name="id2770993"></a>
+<a name="id3346078"></a>
             <a class="link" href="search_n.html#range.reference.algorithms.non_mutating.search_n.description">Description</a>
           </h6>
 <p>
@@ -64,14 +64,14 @@
             and by a predicate when one is supplied.
           </p>
 <a name="range.reference.algorithms.non_mutating.search_n.definition"></a><h6>
-<a name="id2771064"></a>
+<a name="id3346150"></a>
             <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="id2771137"></a>
+<a name="id3346222"></a>
             <a class="link" href="search_n.html#range.reference.algorithms.non_mutating.search_n.requirements">Requirements</a>
           </h6>
 <p>
@@ -79,53 +79,53 @@
           </p>
 <div class="itemizedlist"><ul class="itemizedlist" type="disc">
 <li class="listitem">
-<code class="computeroutput"><span class="identifier">ForwardRange</span></code> is a model
-              of the <a class="link" href="../../../concepts/forward_range.html" title="Forward Range">Forward Range</a>
-              Concept.
-            </li>
+                <code class="computeroutput"><span class="identifier">ForwardRange</span></code> is a
+                model of the <a class="link" href="../../../concepts/forward_range.html" title="Forward Range">Forward
+                Range</a> Concept.
+              </li>
 <li class="listitem">
-<code class="computeroutput"><span class="identifier">ForwardRange</span></code>'s value
-              type is a model of the <code class="computeroutput"><span class="identifier">EqualityComparableConcept</span></code>.
-            </li>
+                <code class="computeroutput"><span class="identifier">ForwardRange</span></code>'s value
+                type is a model of the <code class="computeroutput"><span class="identifier">EqualityComparableConcept</span></code>.
+              </li>
 <li class="listitem">
-<code class="computeroutput"><span class="identifier">ForwardRange</span></code>s value
-              type can be compared for equality with <code class="computeroutput"><span class="identifier">Value</span></code>.
-            </li>
+                <code class="computeroutput"><span class="identifier">ForwardRange</span></code>s value
+                type can be compared for equality with <code class="computeroutput"><span class="identifier">Value</span></code>.
+              </li>
 <li class="listitem">
-<code class="computeroutput"><span class="identifier">Integer</span></code> is a model
-              of the <code class="computeroutput"><span class="identifier">IntegerConcept</span></code>.
-            </li>
+                <code class="computeroutput"><span class="identifier">Integer</span></code> is a model
+                of the <code class="computeroutput"><span class="identifier">IntegerConcept</span></code>.
+              </li>
 </ul></div>
 <p>
             <span class="bold"><strong>For the predicate versions:</strong></span>
           </p>
 <div class="itemizedlist"><ul class="itemizedlist" type="disc">
 <li class="listitem">
-<code class="computeroutput"><span class="identifier">ForwardRange</span></code> is a model
-              of the <a class="link" href="../../../concepts/forward_range.html" title="Forward Range">Forward Range</a>
-              Concept.
-            </li>
+                <code class="computeroutput"><span class="identifier">ForwardRange</span></code> is a
+                model of the <a class="link" href="../../../concepts/forward_range.html" title="Forward Range">Forward
+                Range</a> Concept.
+              </li>
 <li class="listitem">
-<code class="computeroutput"><span class="identifier">BinaryPredicate</span></code> is
-              a model of the <code class="computeroutput"><span class="identifier">BinaryPredicateConcept</span></code>.
-            </li>
+                <code class="computeroutput"><span class="identifier">BinaryPredicate</span></code> is
+                a model of the <code class="computeroutput"><span class="identifier">BinaryPredicateConcept</span></code>.
+              </li>
 <li class="listitem">
-<code class="computeroutput"><span class="identifier">ForwardRange</span></code>'s value
-              type is convertible to <code class="computeroutput"><span class="identifier">BinaryPredicate</span></code>'s
-              first argument type.
-            </li>
+                <code class="computeroutput"><span class="identifier">ForwardRange</span></code>'s value
+                type is convertible to <code class="computeroutput"><span class="identifier">BinaryPredicate</span></code>'s
+                first argument type.
+              </li>
 <li class="listitem">
-<code class="computeroutput"><span class="identifier">Value</span></code> is convertible
-              to <code class="computeroutput"><span class="identifier">BinaryPredicate</span></code>'s
-              second argument type.
-            </li>
+                <code class="computeroutput"><span class="identifier">Value</span></code> is convertible
+                to <code class="computeroutput"><span class="identifier">BinaryPredicate</span></code>'s
+                second argument type.
+              </li>
 <li class="listitem">
-<code class="computeroutput"><span class="identifier">Integer</span></code> is a model
-              of the <code class="computeroutput"><span class="identifier">IntegerConcept</span></code>.
-            </li>
+                <code class="computeroutput"><span class="identifier">Integer</span></code> is a model
+                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="id2771410"></a>
+<a name="id3346525"></a>
             <a class="link" href="search_n.html#range.reference.algorithms.non_mutating.search_n.complexity">Complexity</a>
           </h6>
 <p>
@@ -142,7 +142,7 @@
 </tr></table>
 <hr>
 <div class="spirit-nav">
-<a accesskey="p" href="search.html"><img src="../../../../../../../../doc/html/images/prev.png" alt="Prev"></a><a accesskey="u" href="../non_mutating.html"><img src="../../../../../../../../doc/html/images/up.png" alt="Up"></a><a accesskey="h" href="../../../../index.html"><img src="../../../../../../../../doc/html/images/home.png" alt="Home"></a><a accesskey="n" href="upper_bound.html"><img src="../../../../../../../../doc/html/images/next.png" alt="Next"></a>
+<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>
 </body>
 </html>
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 1bf73d6..0ef9e03 100644
--- a/doc/html/range/reference/algorithms/non_mutating/upper_bound.html
+++ b/doc/html/range/reference/algorithms/non_mutating/upper_bound.html
@@ -2,8 +2,8 @@
 <head>
 <meta http-equiv="Content-Type" content="text/html; charset=US-ASCII">
 <title>upper_bound</title>
-<link rel="stylesheet" href="../../../../../../../../doc/html/boostbook.css" type="text/css">
-<meta name="generator" content="DocBook XSL Stylesheets V1.75.1">
+<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="../non_mutating.html" title="Non-mutating algorithms">
 <link rel="prev" href="search_n.html" title="search_n">
@@ -13,22 +13,22 @@
 <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="../../../../../../../libraries.htm">Libraries</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="search_n.html"><img src="../../../../../../../../doc/html/images/prev.png" alt="Prev"></a><a accesskey="u" href="../non_mutating.html"><img src="../../../../../../../../doc/html/images/up.png" alt="Up"></a><a accesskey="h" href="../../../../index.html"><img src="../../../../../../../../doc/html/images/home.png" alt="Home"></a><a accesskey="n" href="../set.html"><img src="../../../../../../../../doc/html/images/next.png" alt="Next"></a>
+<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" title="upper_bound">
+<div class="section">
 <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="id2771458"></a>
+<a name="id3346572"></a>
             <a class="link" href="upper_bound.html#range.reference.algorithms.non_mutating.upper_bound.prototype">Prototype</a>
           </h6>
 <p>
@@ -49,7 +49,7 @@
 <p>
           </p>
 <a name="range.reference.algorithms.non_mutating.upper_bound.description"></a><h6>
-<a name="id2771751"></a>
+<a name="id3346866"></a>
             <a class="link" href="upper_bound.html#range.reference.algorithms.non_mutating.upper_bound.description">Description</a>
           </h6>
 <p>
@@ -71,14 +71,14 @@
             same manner as the returned iterator described above.
           </p>
 <a name="range.reference.algorithms.non_mutating.upper_bound.definition"></a><h6>
-<a name="id2771954"></a>
+<a name="id3347068"></a>
             <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="id2772028"></a>
+<a name="id3347142"></a>
             <a class="link" href="upper_bound.html#range.reference.algorithms.non_mutating.upper_bound.requirements">Requirements</a>
           </h6>
 <p>
@@ -86,50 +86,50 @@
           </p>
 <div class="itemizedlist"><ul class="itemizedlist" type="disc">
 <li class="listitem">
-<code class="computeroutput"><span class="identifier">ForwardRange</span></code> is a model
-              of the <a class="link" href="../../../concepts/forward_range.html" title="Forward Range">Forward Range</a>
-              Concept.
-            </li>
+                <code class="computeroutput"><span class="identifier">ForwardRange</span></code> is a
+                model of the <a class="link" href="../../../concepts/forward_range.html" title="Forward Range">Forward
+                Range</a> Concept.
+              </li>
 <li class="listitem">
-<code class="computeroutput"><span class="identifier">Value</span></code> is a model of
-              the <code class="computeroutput"><span class="identifier">LessThanComparableConcept</span></code>.
-            </li>
+                <code class="computeroutput"><span class="identifier">Value</span></code> is a model
+                of the <code class="computeroutput"><span class="identifier">LessThanComparableConcept</span></code>.
+              </li>
 <li class="listitem">
-              The ordering of objects of type <code class="computeroutput"><span class="identifier">Value</span></code>
-              is a <span class="bold"><strong><span class="emphasis"><em>strict weak ordering</em></span></strong></span>,
-              as defined in the <code class="computeroutput"><span class="identifier">LessThanComparableConcept</span></code>
-              requirements.
-            </li>
+                The ordering of objects of type <code class="computeroutput"><span class="identifier">Value</span></code>
+                is a <span class="bold"><strong><span class="emphasis"><em>strict weak ordering</em></span></strong></span>,
+                as defined in the <code class="computeroutput"><span class="identifier">LessThanComparableConcept</span></code>
+                requirements.
+              </li>
 <li class="listitem">
-<code class="computeroutput"><span class="identifier">ForwardRange</span></code>'s value
-              type is the same type as <code class="computeroutput"><span class="identifier">Value</span></code>.
-            </li>
+                <code class="computeroutput"><span class="identifier">ForwardRange</span></code>'s value
+                type is the same type as <code class="computeroutput"><span class="identifier">Value</span></code>.
+              </li>
 </ul></div>
 <p>
             <span class="bold"><strong>For the predicate versions:</strong></span>
           </p>
 <div class="itemizedlist"><ul class="itemizedlist" type="disc">
 <li class="listitem">
-<code class="computeroutput"><span class="identifier">ForwardRange</span></code> is a model
-              of the <a class="link" href="../../../concepts/forward_range.html" title="Forward Range">Forward Range</a>
-              Concept.
-            </li>
+                <code class="computeroutput"><span class="identifier">ForwardRange</span></code> is a
+                model of the <a class="link" href="../../../concepts/forward_range.html" title="Forward Range">Forward
+                Range</a> Concept.
+              </li>
 <li class="listitem">
-<code class="computeroutput"><span class="identifier">BinaryPredicate</span></code> is
-              a model of the <code class="computeroutput"><span class="identifier">StrictWeakOrderingConcept</span></code>.
-            </li>
+                <code class="computeroutput"><span class="identifier">BinaryPredicate</span></code> is
+                a model of the <code class="computeroutput"><span class="identifier">StrictWeakOrderingConcept</span></code>.
+              </li>
 <li class="listitem">
-<code class="computeroutput"><span class="identifier">ForwardRange</span></code>'s value
-              type is the same type as <code class="computeroutput"><span class="identifier">Value</span></code>.
-            </li>
+                <code class="computeroutput"><span class="identifier">ForwardRange</span></code>'s value
+                type is the same type as <code class="computeroutput"><span class="identifier">Value</span></code>.
+              </li>
 <li class="listitem">
-<code class="computeroutput"><span class="identifier">ForwardRange</span></code>'s value
-              type is convertible to both of <code class="computeroutput"><span class="identifier">BinaryPredicate</span></code>'s
-              argument types.
-            </li>
+                <code class="computeroutput"><span class="identifier">ForwardRange</span></code>'s value
+                type is convertible to both of <code class="computeroutput"><span class="identifier">BinaryPredicate</span></code>'s
+                argument types.
+              </li>
 </ul></div>
 <a name="range.reference.algorithms.non_mutating.upper_bound.precondition_"></a><h6>
-<a name="id2772285"></a>
+<a name="id3347425"></a>
             <a class="link" href="upper_bound.html#range.reference.algorithms.non_mutating.upper_bound.precondition_">Precondition:</a>
           </h6>
 <p>
@@ -147,7 +147,7 @@
             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="id2772382"></a>
+<a name="id3347522"></a>
             <a class="link" href="upper_bound.html#range.reference.algorithms.non_mutating.upper_bound.complexity">Complexity</a>
           </h6>
 <p>
@@ -167,7 +167,7 @@
 </tr></table>
 <hr>
 <div class="spirit-nav">
-<a accesskey="p" href="search_n.html"><img src="../../../../../../../../doc/html/images/prev.png" alt="Prev"></a><a accesskey="u" href="../non_mutating.html"><img src="../../../../../../../../doc/html/images/up.png" alt="Up"></a><a accesskey="h" href="../../../../index.html"><img src="../../../../../../../../doc/html/images/home.png" alt="Home"></a><a accesskey="n" href="../set.html"><img src="../../../../../../../../doc/html/images/next.png" alt="Next"></a>
+<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>
 </body>
 </html>
diff --git a/doc/html/range/reference/algorithms/numeric.html b/doc/html/range/reference/algorithms/numeric.html
index 90818fa..99b3631 100644
--- a/doc/html/range/reference/algorithms/numeric.html
+++ b/doc/html/range/reference/algorithms/numeric.html
@@ -2,8 +2,8 @@
 <head>
 <meta http-equiv="Content-Type" content="text/html; charset=US-ASCII">
 <title>Numeric algorithms</title>
-<link rel="stylesheet" href="../../../../../../../doc/html/boostbook.css" type="text/css">
-<meta name="generator" content="DocBook XSL Stylesheets V1.75.1">
+<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="../algorithms.html" title="Range Algorithm">
 <link rel="prev" href="new/remove_erase_if.html" title="remove_erase_if">
@@ -13,16 +13,16 @@
 <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="../../../../../../libraries.htm">Libraries</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="new/remove_erase_if.html"><img src="../../../../../../../doc/html/images/prev.png" alt="Prev"></a><a accesskey="u" href="../algorithms.html"><img src="../../../../../../../doc/html/images/up.png" alt="Up"></a><a accesskey="h" href="../../../index.html"><img src="../../../../../../../doc/html/images/home.png" alt="Home"></a><a accesskey="n" href="numeric/accumulate.html"><img src="../../../../../../../doc/html/images/next.png" alt="Next"></a>
+<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" title="Numeric algorithms">
+<div class="section">
 <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>
@@ -46,7 +46,7 @@
 </tr></table>
 <hr>
 <div class="spirit-nav">
-<a accesskey="p" href="new/remove_erase_if.html"><img src="../../../../../../../doc/html/images/prev.png" alt="Prev"></a><a accesskey="u" href="../algorithms.html"><img src="../../../../../../../doc/html/images/up.png" alt="Up"></a><a accesskey="h" href="../../../index.html"><img src="../../../../../../../doc/html/images/home.png" alt="Home"></a><a accesskey="n" href="numeric/accumulate.html"><img src="../../../../../../../doc/html/images/next.png" alt="Next"></a>
+<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>
 </body>
 </html>
diff --git a/doc/html/range/reference/algorithms/numeric/accumulate.html b/doc/html/range/reference/algorithms/numeric/accumulate.html
index 4ba0962..6ea2097 100644
--- a/doc/html/range/reference/algorithms/numeric/accumulate.html
+++ b/doc/html/range/reference/algorithms/numeric/accumulate.html
@@ -2,8 +2,8 @@
 <head>
 <meta http-equiv="Content-Type" content="text/html; charset=US-ASCII">
 <title>accumulate</title>
-<link rel="stylesheet" href="../../../../../../../../doc/html/boostbook.css" type="text/css">
-<meta name="generator" content="DocBook XSL Stylesheets V1.75.1">
+<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="../numeric.html" title="Numeric algorithms">
 <link rel="prev" href="../numeric.html" title="Numeric algorithms">
@@ -13,21 +13,21 @@
 <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="../../../../../../../libraries.htm">Libraries</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="../numeric.html"><img src="../../../../../../../../doc/html/images/prev.png" alt="Prev"></a><a accesskey="u" href="../numeric.html"><img src="../../../../../../../../doc/html/images/up.png" alt="Up"></a><a accesskey="h" href="../../../../index.html"><img src="../../../../../../../../doc/html/images/home.png" alt="Home"></a><a accesskey="n" href="adjacent_difference.html"><img src="../../../../../../../../doc/html/images/next.png" alt="Next"></a>
+<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" title="accumulate">
+<div class="section">
 <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="id2790133"></a>
+<a name="id3365780"></a>
             <a class="link" href="accumulate.html#range.reference.algorithms.numeric.accumulate.prototype">Prototype</a>
           </h6>
 <p>
@@ -52,7 +52,7 @@
 <p>
           </p>
 <a name="range.reference.algorithms.numeric.accumulate.description"></a><h6>
-<a name="id2790397"></a>
+<a name="id3366045"></a>
             <a class="link" href="accumulate.html#range.reference.algorithms.numeric.accumulate.description">Description</a>
           </h6>
 <p>
@@ -63,77 +63,77 @@
             The return value is the resultant value of the above algorithm.
           </p>
 <a name="range.reference.algorithms.numeric.accumulate.definition"></a><h6>
-<a name="id2790477"></a>
+<a name="id3366125"></a>
             <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="id2790541"></a>
+<a name="id3366189"></a>
             <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="id2790565"></a>
+<a name="id3366213"></a>
             <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">
 <li class="listitem">
-<code class="computeroutput"><span class="identifier">SinglePassRange</span></code> is
-              a model of the <a class="link" href="../../../concepts/single_pass_range.html" title="Single Pass Range">Single
-              Pass Range</a> Concept.
-            </li>
+                <code class="computeroutput"><span class="identifier">SinglePassRange</span></code> is
+                a model of the <a class="link" href="../../../concepts/single_pass_range.html" title="Single Pass Range">Single
+                Pass Range</a> Concept.
+              </li>
 <li class="listitem">
-<code class="computeroutput"><span class="identifier">Value</span></code> is a model of
-              the <code class="computeroutput"><span class="identifier">AssignableConcept</span></code>.
-            </li>
+                <code class="computeroutput"><span class="identifier">Value</span></code> is a model
+                of the <code class="computeroutput"><span class="identifier">AssignableConcept</span></code>.
+              </li>
 <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>
-              value type.
-            </li>
+                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>
+                value type.
+              </li>
 <li class="listitem">
-              The return type of the above operator is convertible to <code class="computeroutput"><span class="identifier">Value</span></code>.
-            </li>
+                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="id2790703"></a>
+<a name="id3366363"></a>
             <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">
 <li class="listitem">
-<code class="computeroutput"><span class="identifier">SinglePassRange</span></code> is
-              a model of the <a class="link" href="../../../concepts/single_pass_range.html" title="Single Pass Range">Single
-              Pass Range</a> Concept.
-            </li>
+                <code class="computeroutput"><span class="identifier">SinglePassRange</span></code> is
+                a model of the <a class="link" href="../../../concepts/single_pass_range.html" title="Single Pass Range">Single
+                Pass Range</a> Concept.
+              </li>
 <li class="listitem">
-<code class="computeroutput"><span class="identifier">Value</span></code> is a model of
-              the <code class="computeroutput"><span class="identifier">AssignableConcept</span></code>.
-            </li>
+                <code class="computeroutput"><span class="identifier">Value</span></code> is a model
+                of the <code class="computeroutput"><span class="identifier">AssignableConcept</span></code>.
+              </li>
 <li class="listitem">
-<code class="computeroutput"><span class="identifier">BinaryOperation</span></code> is
-              a model of the <code class="computeroutput"><span class="identifier">BinaryFunctionConcept</span></code>.
-            </li>
+                <code class="computeroutput"><span class="identifier">BinaryOperation</span></code> is
+                a model of the <code class="computeroutput"><span class="identifier">BinaryFunctionConcept</span></code>.
+              </li>
 <li class="listitem">
-<code class="computeroutput"><span class="identifier">Value</span></code> is convertible
-              to <code class="computeroutput"><span class="identifier">BinaryOperation</span></code>'s
-              first argument type.
-            </li>
+                <code class="computeroutput"><span class="identifier">Value</span></code> is convertible
+                to <code class="computeroutput"><span class="identifier">BinaryOperation</span></code>'s
+                first argument type.
+              </li>
 <li class="listitem">
-<code class="computeroutput"><span class="identifier">SinglePassRange</span></code>'s value
-              type is convertible to <code class="computeroutput"><span class="identifier">BinaryOperation</span></code>'s
-              second argument type.
-            </li>
+                <code class="computeroutput"><span class="identifier">SinglePassRange</span></code>'s
+                value type is convertible to <code class="computeroutput"><span class="identifier">BinaryOperation</span></code>'s
+                second argument type.
+              </li>
 <li class="listitem">
-              The return type of <code class="computeroutput"><span class="identifier">BinaryOperation</span></code>
-              is convertible to <code class="computeroutput"><span class="identifier">Value</span></code>.
-            </li>
+                The return type of <code class="computeroutput"><span class="identifier">BinaryOperation</span></code>
+                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="id2790887"></a>
+<a name="id3366566"></a>
             <a class="link" href="accumulate.html#range.reference.algorithms.numeric.accumulate.complexity">Complexity</a>
           </h6>
 <p>
@@ -150,7 +150,7 @@
 </tr></table>
 <hr>
 <div class="spirit-nav">
-<a accesskey="p" href="../numeric.html"><img src="../../../../../../../../doc/html/images/prev.png" alt="Prev"></a><a accesskey="u" href="../numeric.html"><img src="../../../../../../../../doc/html/images/up.png" alt="Up"></a><a accesskey="h" href="../../../../index.html"><img src="../../../../../../../../doc/html/images/home.png" alt="Home"></a><a accesskey="n" href="adjacent_difference.html"><img src="../../../../../../../../doc/html/images/next.png" alt="Next"></a>
+<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>
 </body>
 </html>
diff --git a/doc/html/range/reference/algorithms/numeric/adjacent_difference.html b/doc/html/range/reference/algorithms/numeric/adjacent_difference.html
index 5dff5f8..57d2bf8 100644
--- a/doc/html/range/reference/algorithms/numeric/adjacent_difference.html
+++ b/doc/html/range/reference/algorithms/numeric/adjacent_difference.html
@@ -2,8 +2,8 @@
 <head>
 <meta http-equiv="Content-Type" content="text/html; charset=US-ASCII">
 <title>adjacent_difference</title>
-<link rel="stylesheet" href="../../../../../../../../doc/html/boostbook.css" type="text/css">
-<meta name="generator" content="DocBook XSL Stylesheets V1.75.1">
+<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="../numeric.html" title="Numeric algorithms">
 <link rel="prev" href="accumulate.html" title="accumulate">
@@ -13,22 +13,22 @@
 <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="../../../../../../../libraries.htm">Libraries</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="accumulate.html"><img src="../../../../../../../../doc/html/images/prev.png" alt="Prev"></a><a accesskey="u" href="../numeric.html"><img src="../../../../../../../../doc/html/images/up.png" alt="Up"></a><a accesskey="h" href="../../../../index.html"><img src="../../../../../../../../doc/html/images/home.png" alt="Home"></a><a accesskey="n" href="inner_product.html"><img src="../../../../../../../../doc/html/images/next.png" alt="Next"></a>
+<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" title="adjacent_difference">
+<div class="section">
 <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="id2790957"></a>
+<a name="id3366638"></a>
             <a class="link" href="adjacent_difference.html#range.reference.algorithms.numeric.adjacent_difference.prototype">Prototype</a>
           </h6>
 <p>
@@ -55,7 +55,7 @@
 <p>
           </p>
 <a name="range.reference.algorithms.numeric.adjacent_difference.description"></a><h6>
-<a name="id2791226"></a>
+<a name="id3366906"></a>
             <a class="link" href="adjacent_difference.html#range.reference.algorithms.numeric.adjacent_difference.description">Description</a>
           </h6>
 <p>
@@ -69,84 +69,84 @@
             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="id2791332"></a>
+<a name="id3367013"></a>
             <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="id2791397"></a>
+<a name="id3367077"></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.for_the_first_version"></a><h6>
-<a name="id2791421"></a>
+<a name="id3367102"></a>
             <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">
 <li class="listitem">
-<code class="computeroutput"><span class="identifier">SinglePassRange</span></code> is
-              a model of the <a class="link" href="../../../concepts/single_pass_range.html" title="Single Pass Range">Single
-              Pass Range</a> Concept.
-            </li>
+                <code class="computeroutput"><span class="identifier">SinglePassRange</span></code> is
+                a model of the <a class="link" href="../../../concepts/single_pass_range.html" title="Single Pass Range">Single
+                Pass Range</a> Concept.
+              </li>
 <li class="listitem">
-<code class="computeroutput"><span class="identifier">OutputIterator</span></code> is a
-              model of the <code class="computeroutput"><span class="identifier">OutputIteratorConcept</span></code>.
-            </li>
+                <code class="computeroutput"><span class="identifier">OutputIterator</span></code> is
+                a model of the <code class="computeroutput"><span class="identifier">OutputIteratorConcept</span></code>.
+              </li>
 <li class="listitem">
-              If <code class="computeroutput"><span class="identifier">x</span></code> and <code class="computeroutput"><span class="identifier">y</span></code> are objects of <code class="computeroutput"><span class="identifier">SinglePassRange</span></code>'s
-              value type, then <code class="computeroutput"><span class="identifier">x</span> <span class="special">-</span> <span class="identifier">y</span></code>
-              is defined.
-            </li>
+                If <code class="computeroutput"><span class="identifier">x</span></code> and <code class="computeroutput"><span class="identifier">y</span></code> are objects of <code class="computeroutput"><span class="identifier">SinglePassRange</span></code>'s value type, then
+                <code class="computeroutput"><span class="identifier">x</span> <span class="special">-</span>
+                <span class="identifier">y</span></code> is defined.
+              </li>
 <li class="listitem">
-              The value type of <code class="computeroutput"><span class="identifier">SinglePassRange</span></code>
-              is convertible to a type in <code class="computeroutput"><span class="identifier">OutputIterator</span></code>'s
-              set of value types.
-            </li>
+                The value type of <code class="computeroutput"><span class="identifier">SinglePassRange</span></code>
+                is convertible to a type in <code class="computeroutput"><span class="identifier">OutputIterator</span></code>'s
+                set of value types.
+              </li>
 <li class="listitem">
-              The return type of <code class="computeroutput"><span class="identifier">x</span> <span class="special">-</span> <span class="identifier">y</span></code>
-              is convertible to a type in <code class="computeroutput"><span class="identifier">OutputIterator</span></code>'s
-              set of value types.
-            </li>
+                The return type of <code class="computeroutput"><span class="identifier">x</span> <span class="special">-</span> <span class="identifier">y</span></code>
+                is convertible to a type in <code class="computeroutput"><span class="identifier">OutputIterator</span></code>'s
+                set of value types.
+              </li>
 </ol></div>
 <a name="range.reference.algorithms.numeric.adjacent_difference.for_the_second_version"></a><h6>
-<a name="id2791624"></a>
+<a name="id3367322"></a>
             <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">
 <li class="listitem">
-<code class="computeroutput"><span class="identifier">SinglePassRange</span></code> is
-              a model of the <a class="link" href="../../../concepts/single_pass_range.html" title="Single Pass Range">Single
-              Pass Range</a> Concept.
-            </li>
+                <code class="computeroutput"><span class="identifier">SinglePassRange</span></code> is
+                a model of the <a class="link" href="../../../concepts/single_pass_range.html" title="Single Pass Range">Single
+                Pass Range</a> Concept.
+              </li>
 <li class="listitem">
-<code class="computeroutput"><span class="identifier">OutputIterator</span></code> is a
-              model of the <code class="computeroutput"><span class="identifier">OutputIteratorConcept</span></code>.
-            </li>
+                <code class="computeroutput"><span class="identifier">OutputIterator</span></code> is
+                a model of the <code class="computeroutput"><span class="identifier">OutputIteratorConcept</span></code>.
+              </li>
 <li class="listitem">
-<code class="computeroutput"><span class="identifier">BinaryOperation</span></code> is
-              a model of the <code class="computeroutput"><span class="identifier">BinaryFunctionConcept</span></code>.
-            </li>
+                <code class="computeroutput"><span class="identifier">BinaryOperation</span></code> is
+                a model of the <code class="computeroutput"><span class="identifier">BinaryFunctionConcept</span></code>.
+              </li>
 <li class="listitem">
-              The value type of <code class="computeroutput"><span class="identifier">SinglePassRange</span></code>
-              is convertible to <code class="computeroutput"><span class="identifier">BinaryOperation</span></code>'s
-              first and second argument types.
-            </li>
+                The value type of <code class="computeroutput"><span class="identifier">SinglePassRange</span></code>
+                is convertible to <code class="computeroutput"><span class="identifier">BinaryOperation</span></code>'s
+                first and second argument types.
+              </li>
 <li class="listitem">
-              The value type of <code class="computeroutput"><span class="identifier">SinglePassRange</span></code>
-              is convertible to a type in <code class="computeroutput"><span class="identifier">OutputIterator</span></code>'s
-              set of value types.
-            </li>
+                The value type of <code class="computeroutput"><span class="identifier">SinglePassRange</span></code>
+                is convertible to a type in <code class="computeroutput"><span class="identifier">OutputIterator</span></code>'s
+                set of value types.
+              </li>
 <li class="listitem">
-              The result type of <code class="computeroutput"><span class="identifier">BinaryOperation</span></code>
-              is convertible to a type in <code class="computeroutput"><span class="identifier">OutputIterator</span></code>'s
-              set of value types.
-            </li>
+                The result type of <code class="computeroutput"><span class="identifier">BinaryOperation</span></code>
+                is convertible to a type in <code class="computeroutput"><span class="identifier">OutputIterator</span></code>'s
+                set of value types.
+              </li>
 </ol></div>
 <a name="range.reference.algorithms.numeric.adjacent_difference.precondition_"></a><h6>
-<a name="id2791810"></a>
+<a name="id3367527"></a>
             <a class="link" href="adjacent_difference.html#range.reference.algorithms.numeric.adjacent_difference.precondition_">Precondition:</a>
           </h6>
 <p>
@@ -154,7 +154,7 @@
             <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="id2791887"></a>
+<a name="id3367604"></a>
             <a class="link" href="adjacent_difference.html#range.reference.algorithms.numeric.adjacent_difference.complexity">Complexity</a>
           </h6>
 <p>
@@ -173,7 +173,7 @@
 </tr></table>
 <hr>
 <div class="spirit-nav">
-<a accesskey="p" href="accumulate.html"><img src="../../../../../../../../doc/html/images/prev.png" alt="Prev"></a><a accesskey="u" href="../numeric.html"><img src="../../../../../../../../doc/html/images/up.png" alt="Up"></a><a accesskey="h" href="../../../../index.html"><img src="../../../../../../../../doc/html/images/home.png" alt="Home"></a><a accesskey="n" href="inner_product.html"><img src="../../../../../../../../doc/html/images/next.png" alt="Next"></a>
+<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>
 </body>
 </html>
diff --git a/doc/html/range/reference/algorithms/numeric/inner_product.html b/doc/html/range/reference/algorithms/numeric/inner_product.html
index 7872880..76a07fc 100644
--- a/doc/html/range/reference/algorithms/numeric/inner_product.html
+++ b/doc/html/range/reference/algorithms/numeric/inner_product.html
@@ -2,8 +2,8 @@
 <head>
 <meta http-equiv="Content-Type" content="text/html; charset=US-ASCII">
 <title>inner_product</title>
-<link rel="stylesheet" href="../../../../../../../../doc/html/boostbook.css" type="text/css">
-<meta name="generator" content="DocBook XSL Stylesheets V1.75.1">
+<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="../numeric.html" title="Numeric algorithms">
 <link rel="prev" href="adjacent_difference.html" title="adjacent_difference">
@@ -13,22 +13,22 @@
 <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="../../../../../../../libraries.htm">Libraries</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="adjacent_difference.html"><img src="../../../../../../../../doc/html/images/prev.png" alt="Prev"></a><a accesskey="u" href="../numeric.html"><img src="../../../../../../../../doc/html/images/up.png" alt="Up"></a><a accesskey="h" href="../../../../index.html"><img src="../../../../../../../../doc/html/images/home.png" alt="Home"></a><a accesskey="n" href="partial_sum.html"><img src="../../../../../../../../doc/html/images/next.png" alt="Next"></a>
+<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" title="inner_product">
+<div class="section">
 <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="id2791993"></a>
+<a name="id3367710"></a>
             <a class="link" href="inner_product.html#range.reference.algorithms.numeric.inner_product.prototype">Prototype</a>
           </h6>
 <p>
@@ -54,7 +54,7 @@
 <p>
           </p>
 <a name="range.reference.algorithms.numeric.inner_product.description"></a><h6>
-<a name="id2792360"></a>
+<a name="id3368077"></a>
             <a class="link" href="inner_product.html#range.reference.algorithms.numeric.inner_product.description">Description</a>
           </h6>
 <p>
@@ -67,109 +67,109 @@
             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="id2792441"></a>
+<a name="id3368158"></a>
             <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="id2792506"></a>
+<a name="id3368223"></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.for_the_first_version"></a><h6>
-<a name="id2792529"></a>
+<a name="id3368246"></a>
             <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">
 <li class="listitem">
-<code class="computeroutput"><span class="identifier">SinglePassRange1</span></code> is
-              a model of the <a class="link" href="../../../concepts/single_pass_range.html" title="Single Pass Range">Single
-              Pass Range</a> Concept.
-            </li>
+                <code class="computeroutput"><span class="identifier">SinglePassRange1</span></code>
+                is a model of the <a class="link" href="../../../concepts/single_pass_range.html" title="Single Pass Range">Single
+                Pass Range</a> Concept.
+              </li>
 <li class="listitem">
-<code class="computeroutput"><span class="identifier">SinglePassRange2</span></code> is
-              a model of the <a class="link" href="../../../concepts/single_pass_range.html" title="Single Pass Range">Single
-              Pass Range</a> Concept.
-            </li>
+                <code class="computeroutput"><span class="identifier">SinglePassRange2</span></code>
+                is a model of the <a class="link" href="../../../concepts/single_pass_range.html" title="Single Pass Range">Single
+                Pass Range</a> Concept.
+              </li>
 <li class="listitem">
-<code class="computeroutput"><span class="identifier">Value</span></code> is a model of
-              the <code class="computeroutput"><span class="identifier">AssignableConcept</span></code>.
-            </li>
+                <code class="computeroutput"><span class="identifier">Value</span></code> is a model
+                of the <code class="computeroutput"><span class="identifier">AssignableConcept</span></code>.
+              </li>
 <li class="listitem">
-              If <code class="computeroutput"><span class="identifier">x</span></code> is an object of
-              type <code class="computeroutput"><span class="identifier">Value</span></code>, <code class="computeroutput"><span class="identifier">y</span></code> is an object of <code class="computeroutput"><span class="identifier">SinglePassRange1</span></code>'s
-              value type, and <code class="computeroutput"><span class="identifier">z</span></code> is
-              an object of <code class="computeroutput"><span class="identifier">SinglePassRange2</span></code>'s
-              value type, then <code class="computeroutput"><span class="identifier">x</span> <span class="special">+</span> <span class="identifier">y</span> <span class="special">*</span> <span class="identifier">z</span></code>
-              is defined.
-            </li>
+                If <code class="computeroutput"><span class="identifier">x</span></code> is an object
+                of type <code class="computeroutput"><span class="identifier">Value</span></code>, <code class="computeroutput"><span class="identifier">y</span></code> is an object of <code class="computeroutput"><span class="identifier">SinglePassRange1</span></code>'s value type,
+                and <code class="computeroutput"><span class="identifier">z</span></code> is an object
+                of <code class="computeroutput"><span class="identifier">SinglePassRange2</span></code>'s
+                value type, then <code class="computeroutput"><span class="identifier">x</span> <span class="special">+</span> <span class="identifier">y</span> <span class="special">*</span> <span class="identifier">z</span></code>
+                is defined.
+              </li>
 <li class="listitem">
-              The result type of the expression <code class="computeroutput"><span class="identifier">x</span>
-              <span class="special">+</span> <span class="identifier">y</span>
-              <span class="special">*</span> <span class="identifier">z</span></code>
-              is convertible to <code class="computeroutput"><span class="identifier">Value</span></code>.
-            </li>
+                The result type of the expression <code class="computeroutput"><span class="identifier">x</span>
+                <span class="special">+</span> <span class="identifier">y</span>
+                <span class="special">*</span> <span class="identifier">z</span></code>
+                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="id2792781"></a>
+<a name="id3368514"></a>
             <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">
 <li class="listitem">
-<code class="computeroutput"><span class="identifier">SinglePassRange1</span></code> is
-              a model of the <a class="link" href="../../../concepts/single_pass_range.html" title="Single Pass Range">Single
-              Pass Range</a> Concept.
-            </li>
+                <code class="computeroutput"><span class="identifier">SinglePassRange1</span></code>
+                is a model of the <a class="link" href="../../../concepts/single_pass_range.html" title="Single Pass Range">Single
+                Pass Range</a> Concept.
+              </li>
 <li class="listitem">
-<code class="computeroutput"><span class="identifier">SinglePassRange2</span></code> is
-              a model of the <a class="link" href="../../../concepts/single_pass_range.html" title="Single Pass Range">Single
-              Pass Range</a> Concept.
-            </li>
+                <code class="computeroutput"><span class="identifier">SinglePassRange2</span></code>
+                is a model of the <a class="link" href="../../../concepts/single_pass_range.html" title="Single Pass Range">Single
+                Pass Range</a> Concept.
+              </li>
 <li class="listitem">
-<code class="computeroutput"><span class="identifier">Value</span></code> is a model of
-              the <code class="computeroutput"><span class="identifier">AssignableConcept</span></code>.
-            </li>
+                <code class="computeroutput"><span class="identifier">Value</span></code> is a model
+                of the <code class="computeroutput"><span class="identifier">AssignableConcept</span></code>.
+              </li>
 <li class="listitem">
-<code class="computeroutput"><span class="identifier">BinaryOperation1</span></code> is
-              a model of the <code class="computeroutput"><span class="identifier">BinaryFunctionConcept</span></code>.
-            </li>
+                <code class="computeroutput"><span class="identifier">BinaryOperation1</span></code>
+                is a model of the <code class="computeroutput"><span class="identifier">BinaryFunctionConcept</span></code>.
+              </li>
 <li class="listitem">
-<code class="computeroutput"><span class="identifier">BinaryOperation2</span></code> is
-              a model of the <code class="computeroutput"><span class="identifier">BinaryFunctionConcept</span></code>.
-            </li>
+                <code class="computeroutput"><span class="identifier">BinaryOperation2</span></code>
+                is a model of the <code class="computeroutput"><span class="identifier">BinaryFunctionConcept</span></code>.
+              </li>
 <li class="listitem">
-              The value type of <code class="computeroutput"><span class="identifier">SinglePassRange1</span></code>
-              is convertible to the first argument type of <code class="computeroutput"><span class="identifier">BinaryOperation2</span></code>.
-            </li>
+                The value type of <code class="computeroutput"><span class="identifier">SinglePassRange1</span></code>
+                is convertible to the first argument type of <code class="computeroutput"><span class="identifier">BinaryOperation2</span></code>.
+              </li>
 <li class="listitem">
-              The value type of <code class="computeroutput"><span class="identifier">SinglePassRange2</span></code>
-              is convertible to the second argument type of <code class="computeroutput"><span class="identifier">BinaryOperation2</span></code>.
-            </li>
+                The value type of <code class="computeroutput"><span class="identifier">SinglePassRange2</span></code>
+                is convertible to the second argument type of <code class="computeroutput"><span class="identifier">BinaryOperation2</span></code>.
+              </li>
 <li class="listitem">
-<code class="computeroutput"><span class="identifier">Value</span></code> is convertible
-              to the value type of <code class="computeroutput"><span class="identifier">BinaryOperation1</span></code>.
-            </li>
+                <code class="computeroutput"><span class="identifier">Value</span></code> is convertible
+                to the value type of <code class="computeroutput"><span class="identifier">BinaryOperation1</span></code>.
+              </li>
 <li class="listitem">
-              The return type of <code class="computeroutput"><span class="identifier">BinaryOperation2</span></code>
-              is convertible to the second argument type of <code class="computeroutput"><span class="identifier">BinaryOperation1</span></code>.
-            </li>
+                The return type of <code class="computeroutput"><span class="identifier">BinaryOperation2</span></code>
+                is convertible to the second argument type of <code class="computeroutput"><span class="identifier">BinaryOperation1</span></code>.
+              </li>
 <li class="listitem">
-              The return type of <code class="computeroutput"><span class="identifier">BinaryOperation1</span></code>
-              is convertible to <code class="computeroutput"><span class="identifier">Value</span></code>.
-            </li>
+                The return type of <code class="computeroutput"><span class="identifier">BinaryOperation1</span></code>
+                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="id2793067"></a>
+<a name="id3368832"></a>
             <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="id2793142"></a>
+<a name="id3368908"></a>
             <a class="link" href="inner_product.html#range.reference.algorithms.numeric.inner_product.complexity">Complexity</a>
           </h6>
 <p>
@@ -186,7 +186,7 @@
 </tr></table>
 <hr>
 <div class="spirit-nav">
-<a accesskey="p" href="adjacent_difference.html"><img src="../../../../../../../../doc/html/images/prev.png" alt="Prev"></a><a accesskey="u" href="../numeric.html"><img src="../../../../../../../../doc/html/images/up.png" alt="Up"></a><a accesskey="h" href="../../../../index.html"><img src="../../../../../../../../doc/html/images/home.png" alt="Home"></a><a accesskey="n" href="partial_sum.html"><img src="../../../../../../../../doc/html/images/next.png" alt="Next"></a>
+<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>
 </body>
 </html>
diff --git a/doc/html/range/reference/algorithms/numeric/partial_sum.html b/doc/html/range/reference/algorithms/numeric/partial_sum.html
index cddd838..0967f12 100644
--- a/doc/html/range/reference/algorithms/numeric/partial_sum.html
+++ b/doc/html/range/reference/algorithms/numeric/partial_sum.html
@@ -2,8 +2,8 @@
 <head>
 <meta http-equiv="Content-Type" content="text/html; charset=US-ASCII">
 <title>partial_sum</title>
-<link rel="stylesheet" href="../../../../../../../../doc/html/boostbook.css" type="text/css">
-<meta name="generator" content="DocBook XSL Stylesheets V1.75.1">
+<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="../numeric.html" title="Numeric algorithms">
 <link rel="prev" href="inner_product.html" title="inner_product">
@@ -13,22 +13,22 @@
 <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="../../../../../../../libraries.htm">Libraries</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="inner_product.html"><img src="../../../../../../../../doc/html/images/prev.png" alt="Prev"></a><a accesskey="u" href="../numeric.html"><img src="../../../../../../../../doc/html/images/up.png" alt="Up"></a><a accesskey="h" href="../../../../index.html"><img src="../../../../../../../../doc/html/images/home.png" alt="Home"></a><a accesskey="n" href="../../ranges.html"><img src="../../../../../../../../doc/html/images/next.png" alt="Next"></a>
+<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" title="partial_sum">
+<div class="section">
 <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="id2793211"></a>
+<a name="id3368977"></a>
             <a class="link" href="partial_sum.html#range.reference.algorithms.numeric.partial_sum.prototype">Prototype</a>
           </h6>
 <p>
@@ -49,7 +49,7 @@
 <p>
           </p>
 <a name="range.reference.algorithms.numeric.partial_sum.description"></a><h6>
-<a name="id2793472"></a>
+<a name="id3369235"></a>
             <a class="link" href="partial_sum.html#range.reference.algorithms.numeric.partial_sum.description">Description</a>
           </h6>
 <p>
@@ -58,77 +58,77 @@
             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="id2793615"></a>
+<a name="id3369379"></a>
             <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="id2793678"></a>
+<a name="id3369443"></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.for_the_first_version"></a><h6>
-<a name="id2793701"></a>
+<a name="id3369466"></a>
             <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">
 <li class="listitem">
-<code class="computeroutput"><span class="identifier">SinglePassRange</span></code> is
-              a model of the <a class="link" href="../../../concepts/single_pass_range.html" title="Single Pass Range">Single
-              Pass Range</a> Concept.
-            </li>
+                <code class="computeroutput"><span class="identifier">SinglePassRange</span></code> is
+                a model of the <a class="link" href="../../../concepts/single_pass_range.html" title="Single Pass Range">Single
+                Pass Range</a> Concept.
+              </li>
 <li class="listitem">
-<code class="computeroutput"><span class="identifier">OutputIterator</span></code> is a
-              model of the <code class="computeroutput"><span class="identifier">OutputIteratorConcept</span></code>.
-            </li>
+                <code class="computeroutput"><span class="identifier">OutputIterator</span></code> is
+                a model of the <code class="computeroutput"><span class="identifier">OutputIteratorConcept</span></code>.
+              </li>
 <li class="listitem">
-              If <code class="computeroutput"><span class="identifier">x</span></code> and <code class="computeroutput"><span class="identifier">y</span></code> are objects of <code class="computeroutput"><span class="identifier">SinglePassRange</span></code>'s
-              value type, then <code class="computeroutput"><span class="identifier">x</span> <span class="special">+</span> <span class="identifier">y</span></code>
-              is defined.
-            </li>
+                If <code class="computeroutput"><span class="identifier">x</span></code> and <code class="computeroutput"><span class="identifier">y</span></code> are objects of <code class="computeroutput"><span class="identifier">SinglePassRange</span></code>'s value type, then
+                <code class="computeroutput"><span class="identifier">x</span> <span class="special">+</span>
+                <span class="identifier">y</span></code> is defined.
+              </li>
 <li class="listitem">
-              The return type of <code class="computeroutput"><span class="identifier">x</span> <span class="special">+</span> <span class="identifier">y</span></code>
-              is convertible to the value type of <code class="computeroutput"><span class="identifier">SinglePassRange</span></code>.
-            </li>
+                The return type of <code class="computeroutput"><span class="identifier">x</span> <span class="special">+</span> <span class="identifier">y</span></code>
+                is convertible to the value type of <code class="computeroutput"><span class="identifier">SinglePassRange</span></code>.
+              </li>
 <li class="listitem">
-              The value type of <code class="computeroutput"><span class="identifier">SinglePassRange</span></code>
-              is convertible to a type in <code class="computeroutput"><span class="identifier">OutputIterator</span></code>'s
-              set of value types.
-            </li>
+                The value type of <code class="computeroutput"><span class="identifier">SinglePassRange</span></code>
+                is convertible to a type in <code class="computeroutput"><span class="identifier">OutputIterator</span></code>'s
+                set of value types.
+              </li>
 </ol></div>
 <a name="range.reference.algorithms.numeric.partial_sum.for_the_second_version"></a><h6>
-<a name="id2793904"></a>
+<a name="id3369685"></a>
             <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">
 <li class="listitem">
-<code class="computeroutput"><span class="identifier">SinglePassRange</span></code> is
-              a model of the <a class="link" href="../../../concepts/single_pass_range.html" title="Single Pass Range">Single
-              Pass Range</a> Concept.
-            </li>
+                <code class="computeroutput"><span class="identifier">SinglePassRange</span></code> is
+                a model of the <a class="link" href="../../../concepts/single_pass_range.html" title="Single Pass Range">Single
+                Pass Range</a> Concept.
+              </li>
 <li class="listitem">
-<code class="computeroutput"><span class="identifier">OutputIterator</span></code> is a
-              model of the <code class="computeroutput"><span class="identifier">OutputIteratorConcept</span></code>.
-            </li>
+                <code class="computeroutput"><span class="identifier">OutputIterator</span></code> is
+                a model of the <code class="computeroutput"><span class="identifier">OutputIteratorConcept</span></code>.
+              </li>
 <li class="listitem">
-<code class="computeroutput"><span class="identifier">BinaryOperation</span></code> is
-              a model of the <code class="computeroutput"><span class="identifier">BinaryFunctionConcept</span></code>.
-            </li>
+                <code class="computeroutput"><span class="identifier">BinaryOperation</span></code> is
+                a model of the <code class="computeroutput"><span class="identifier">BinaryFunctionConcept</span></code>.
+              </li>
 <li class="listitem">
-              The result type of <code class="computeroutput"><span class="identifier">BinaryOperation</span></code>
-              is convertible to the value type of <code class="computeroutput"><span class="identifier">SinglePassRange</span></code>.
-            </li>
+                The result type of <code class="computeroutput"><span class="identifier">BinaryOperation</span></code>
+                is convertible to the value type of <code class="computeroutput"><span class="identifier">SinglePassRange</span></code>.
+              </li>
 <li class="listitem">
-              The value type of <code class="computeroutput"><span class="identifier">SinglePassRange</span></code>
-              is convertible to a type in <code class="computeroutput"><span class="identifier">OutputIterator</span></code>'s
-              set of value types.
-            </li>
+                The value type of <code class="computeroutput"><span class="identifier">SinglePassRange</span></code>
+                is convertible to a type in <code class="computeroutput"><span class="identifier">OutputIterator</span></code>'s
+                set of value types.
+              </li>
 </ol></div>
 <a name="range.reference.algorithms.numeric.partial_sum.precondition_"></a><h6>
-<a name="id2794063"></a>
+<a name="id3369862"></a>
             <a class="link" href="partial_sum.html#range.reference.algorithms.numeric.partial_sum.precondition_">Precondition:</a>
           </h6>
 <p>
@@ -136,7 +136,7 @@
             <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="id2794139"></a>
+<a name="id3369938"></a>
             <a class="link" href="partial_sum.html#range.reference.algorithms.numeric.partial_sum.complexity">Complexity</a>
           </h6>
 <p>
@@ -155,7 +155,7 @@
 </tr></table>
 <hr>
 <div class="spirit-nav">
-<a accesskey="p" href="inner_product.html"><img src="../../../../../../../../doc/html/images/prev.png" alt="Prev"></a><a accesskey="u" href="../numeric.html"><img src="../../../../../../../../doc/html/images/up.png" alt="Up"></a><a accesskey="h" href="../../../../index.html"><img src="../../../../../../../../doc/html/images/home.png" alt="Home"></a><a accesskey="n" href="../../ranges.html"><img src="../../../../../../../../doc/html/images/next.png" alt="Next"></a>
+<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>
 </body>
 </html>
diff --git a/doc/html/range/reference/algorithms/permutation.html b/doc/html/range/reference/algorithms/permutation.html
index c859468..cf2da0e 100644
--- a/doc/html/range/reference/algorithms/permutation.html
+++ b/doc/html/range/reference/algorithms/permutation.html
@@ -2,8 +2,8 @@
 <head>
 <meta http-equiv="Content-Type" content="text/html; charset=US-ASCII">
 <title>Permutation algorithms</title>
-<link rel="stylesheet" href="../../../../../../../doc/html/boostbook.css" type="text/css">
-<meta name="generator" content="DocBook XSL Stylesheets V1.75.1">
+<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="../algorithms.html" title="Range Algorithm">
 <link rel="prev" href="heap/sort_heap.html" title="sort_heap">
@@ -13,16 +13,16 @@
 <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="../../../../../../libraries.htm">Libraries</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="heap/sort_heap.html"><img src="../../../../../../../doc/html/images/prev.png" alt="Prev"></a><a accesskey="u" href="../algorithms.html"><img src="../../../../../../../doc/html/images/up.png" alt="Up"></a><a accesskey="h" href="../../../index.html"><img src="../../../../../../../doc/html/images/home.png" alt="Home"></a><a accesskey="n" href="permutation/next_permutation.html"><img src="../../../../../../../doc/html/images/next.png" alt="Next"></a>
+<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" title="Permutation algorithms">
+<div class="section">
 <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>
@@ -44,7 +44,7 @@
 </tr></table>
 <hr>
 <div class="spirit-nav">
-<a accesskey="p" href="heap/sort_heap.html"><img src="../../../../../../../doc/html/images/prev.png" alt="Prev"></a><a accesskey="u" href="../algorithms.html"><img src="../../../../../../../doc/html/images/up.png" alt="Up"></a><a accesskey="h" href="../../../index.html"><img src="../../../../../../../doc/html/images/home.png" alt="Home"></a><a accesskey="n" href="permutation/next_permutation.html"><img src="../../../../../../../doc/html/images/next.png" alt="Next"></a>
+<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>
 </body>
 </html>
diff --git a/doc/html/range/reference/algorithms/permutation/next_permutation.html b/doc/html/range/reference/algorithms/permutation/next_permutation.html
index 3f23383..c7533d7 100644
--- a/doc/html/range/reference/algorithms/permutation/next_permutation.html
+++ b/doc/html/range/reference/algorithms/permutation/next_permutation.html
@@ -2,8 +2,8 @@
 <head>
 <meta http-equiv="Content-Type" content="text/html; charset=US-ASCII">
 <title>next_permutation</title>
-<link rel="stylesheet" href="../../../../../../../../doc/html/boostbook.css" type="text/css">
-<meta name="generator" content="DocBook XSL Stylesheets V1.75.1">
+<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="../permutation.html" title="Permutation algorithms">
 <link rel="prev" href="../permutation.html" title="Permutation algorithms">
@@ -13,22 +13,22 @@
 <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="../../../../../../../libraries.htm">Libraries</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="../permutation.html"><img src="../../../../../../../../doc/html/images/prev.png" alt="Prev"></a><a accesskey="u" href="../permutation.html"><img src="../../../../../../../../doc/html/images/up.png" alt="Up"></a><a accesskey="h" href="../../../../index.html"><img src="../../../../../../../../doc/html/images/home.png" alt="Home"></a><a accesskey="n" href="prev_permutation.html"><img src="../../../../../../../../doc/html/images/next.png" alt="Next"></a>
+<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" title="next_permutation">
+<div class="section">
 <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="id2782291"></a>
+<a name="id3357786"></a>
             <a class="link" href="next_permutation.html#range.reference.algorithms.permutation.next_permutation.prototype">Prototype</a>
           </h6>
 <p>
@@ -49,7 +49,7 @@
 <p>
           </p>
 <a name="range.reference.algorithms.permutation.next_permutation.description"></a><h6>
-<a name="id2782641"></a>
+<a name="id3358135"></a>
             <a class="link" href="next_permutation.html#range.reference.algorithms.permutation.next_permutation.description">Description</a>
           </h6>
 <p>
@@ -67,14 +67,14 @@
             the predicate versions.
           </p>
 <a name="range.reference.algorithms.permutation.next_permutation.definition"></a><h6>
-<a name="id2782749"></a>
+<a name="id3358243"></a>
             <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="id2782822"></a>
+<a name="id3358317"></a>
             <a class="link" href="next_permutation.html#range.reference.algorithms.permutation.next_permutation.requirements">Requirements</a>
           </h6>
 <p>
@@ -82,50 +82,50 @@
           </p>
 <div class="itemizedlist"><ul class="itemizedlist" type="disc">
 <li class="listitem">
-<code class="computeroutput"><span class="identifier">BidirectionalRange</span></code>
-              is a model of the <a class="link" href="../../../concepts/bidirectional_range.html" title="Bidirectional Range">Bidirectional
-              Range</a> Concept.
-            </li>
+                <code class="computeroutput"><span class="identifier">BidirectionalRange</span></code>
+                is a model of the <a class="link" href="../../../concepts/bidirectional_range.html" title="Bidirectional Range">Bidirectional
+                Range</a> Concept.
+              </li>
 <li class="listitem">
-<code class="computeroutput"><span class="identifier">BidirectionalRange</span></code>
-              is mutable.
-            </li>
+                <code class="computeroutput"><span class="identifier">BidirectionalRange</span></code>
+                is mutable.
+              </li>
 <li class="listitem">
-<code class="computeroutput"><span class="identifier">BidirectionalRange</span></code>'s
-              value type is a model of the <code class="computeroutput"><span class="identifier">LessThanComparableConcept</span></code>.
-            </li>
+                <code class="computeroutput"><span class="identifier">BidirectionalRange</span></code>'s
+                value type is a model of the <code class="computeroutput"><span class="identifier">LessThanComparableConcept</span></code>.
+              </li>
 <li class="listitem">
-              The ordering of objects of type <code class="computeroutput"><span class="identifier">BidirectionalRange</span></code>'s
-              value type is a <span class="bold"><strong><span class="emphasis"><em>strict weak ordering</em></span></strong></span>,
-              as defined in the <code class="computeroutput"><span class="identifier">LessThanComparableConcept</span></code>
-              requirements.
-            </li>
+                The ordering of objects of type <code class="computeroutput"><span class="identifier">BidirectionalRange</span></code>'s
+                value type is a <span class="bold"><strong><span class="emphasis"><em>strict weak ordering</em></span></strong></span>,
+                as defined in the <code class="computeroutput"><span class="identifier">LessThanComparableConcept</span></code>
+                requirements.
+              </li>
 </ul></div>
 <p>
             <span class="bold"><strong>For the predicate versions:</strong></span>
           </p>
 <div class="itemizedlist"><ul class="itemizedlist" type="disc">
 <li class="listitem">
-<code class="computeroutput"><span class="identifier">BidirectionalRange</span></code>
-              is a model of the <a class="link" href="../../../concepts/bidirectional_range.html" title="Bidirectional Range">Bidirectional
-              Range</a> Concept.
-            </li>
+                <code class="computeroutput"><span class="identifier">BidirectionalRange</span></code>
+                is a model of the <a class="link" href="../../../concepts/bidirectional_range.html" title="Bidirectional Range">Bidirectional
+                Range</a> Concept.
+              </li>
 <li class="listitem">
-<code class="computeroutput"><span class="identifier">BidirectionalRange</span></code>
-              is mutable.
-            </li>
+                <code class="computeroutput"><span class="identifier">BidirectionalRange</span></code>
+                is mutable.
+              </li>
 <li class="listitem">
-<code class="computeroutput"><span class="identifier">Compare</span></code> is a model
-              of the <code class="computeroutput"><span class="identifier">StrictWeakOrderingConcept</span></code>.
-            </li>
+                <code class="computeroutput"><span class="identifier">Compare</span></code> is a model
+                of the <code class="computeroutput"><span class="identifier">StrictWeakOrderingConcept</span></code>.
+              </li>
 <li class="listitem">
-<code class="computeroutput"><span class="identifier">BidirectionalRange</span></code>'s
-              value type is convertible to both of <code class="computeroutput"><span class="identifier">Compare</span></code>'s
-              argument types.
-            </li>
+                <code class="computeroutput"><span class="identifier">BidirectionalRange</span></code>'s
+                value type is convertible to both of <code class="computeroutput"><span class="identifier">Compare</span></code>'s
+                argument types.
+              </li>
 </ul></div>
 <a name="range.reference.algorithms.permutation.next_permutation.complexity"></a><h6>
-<a name="id2783058"></a>
+<a name="id3358579"></a>
             <a class="link" href="next_permutation.html#range.reference.algorithms.permutation.next_permutation.complexity">Complexity</a>
           </h6>
 <p>
@@ -143,7 +143,7 @@
 </tr></table>
 <hr>
 <div class="spirit-nav">
-<a accesskey="p" href="../permutation.html"><img src="../../../../../../../../doc/html/images/prev.png" alt="Prev"></a><a accesskey="u" href="../permutation.html"><img src="../../../../../../../../doc/html/images/up.png" alt="Up"></a><a accesskey="h" href="../../../../index.html"><img src="../../../../../../../../doc/html/images/home.png" alt="Home"></a><a accesskey="n" href="prev_permutation.html"><img src="../../../../../../../../doc/html/images/next.png" alt="Next"></a>
+<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>
 </body>
 </html>
diff --git a/doc/html/range/reference/algorithms/permutation/prev_permutation.html b/doc/html/range/reference/algorithms/permutation/prev_permutation.html
index 3cb4d46..090c6c0 100644
--- a/doc/html/range/reference/algorithms/permutation/prev_permutation.html
+++ b/doc/html/range/reference/algorithms/permutation/prev_permutation.html
@@ -2,8 +2,8 @@
 <head>
 <meta http-equiv="Content-Type" content="text/html; charset=US-ASCII">
 <title>prev_permutation</title>
-<link rel="stylesheet" href="../../../../../../../../doc/html/boostbook.css" type="text/css">
-<meta name="generator" content="DocBook XSL Stylesheets V1.75.1">
+<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="../permutation.html" title="Permutation algorithms">
 <link rel="prev" href="next_permutation.html" title="next_permutation">
@@ -13,22 +13,22 @@
 <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="../../../../../../../libraries.htm">Libraries</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="next_permutation.html"><img src="../../../../../../../../doc/html/images/prev.png" alt="Prev"></a><a accesskey="u" href="../permutation.html"><img src="../../../../../../../../doc/html/images/up.png" alt="Up"></a><a accesskey="h" href="../../../../index.html"><img src="../../../../../../../../doc/html/images/home.png" alt="Home"></a><a accesskey="n" href="../new.html"><img src="../../../../../../../../doc/html/images/next.png" alt="Next"></a>
+<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" title="prev_permutation">
+<div class="section">
 <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="id2783140"></a>
+<a name="id3358659"></a>
             <a class="link" href="prev_permutation.html#range.reference.algorithms.permutation.prev_permutation.prototype">Prototype</a>
           </h6>
 <p>
@@ -49,7 +49,7 @@
 <p>
           </p>
 <a name="range.reference.algorithms.permutation.prev_permutation.description"></a><h6>
-<a name="id2783490"></a>
+<a name="id3359011"></a>
             <a class="link" href="prev_permutation.html#range.reference.algorithms.permutation.prev_permutation.description">Description</a>
           </h6>
 <p>
@@ -67,14 +67,14 @@
             the predicate versions.
           </p>
 <a name="range.reference.algorithms.permutation.prev_permutation.definition"></a><h6>
-<a name="id2783598"></a>
+<a name="id3359119"></a>
             <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="id2783672"></a>
+<a name="id3359193"></a>
             <a class="link" href="prev_permutation.html#range.reference.algorithms.permutation.prev_permutation.requirements">Requirements</a>
           </h6>
 <p>
@@ -82,50 +82,50 @@
           </p>
 <div class="itemizedlist"><ul class="itemizedlist" type="disc">
 <li class="listitem">
-<code class="computeroutput"><span class="identifier">BidirectionalRange</span></code>
-              is a model of the <a class="link" href="../../../concepts/bidirectional_range.html" title="Bidirectional Range">Bidirectional
-              Range</a> Concept.
-            </li>
+                <code class="computeroutput"><span class="identifier">BidirectionalRange</span></code>
+                is a model of the <a class="link" href="../../../concepts/bidirectional_range.html" title="Bidirectional Range">Bidirectional
+                Range</a> Concept.
+              </li>
 <li class="listitem">
-<code class="computeroutput"><span class="identifier">BidirectionalRange</span></code>
-              is mutable.
-            </li>
+                <code class="computeroutput"><span class="identifier">BidirectionalRange</span></code>
+                is mutable.
+              </li>
 <li class="listitem">
-<code class="computeroutput"><span class="identifier">BidirectionalRange</span></code>'s
-              value type is a model of the <code class="computeroutput"><span class="identifier">LessThanComparableConcept</span></code>.
-            </li>
+                <code class="computeroutput"><span class="identifier">BidirectionalRange</span></code>'s
+                value type is a model of the <code class="computeroutput"><span class="identifier">LessThanComparableConcept</span></code>.
+              </li>
 <li class="listitem">
-              The ordering of objects of type <code class="computeroutput"><span class="identifier">BidirectionalRange</span></code>'s
-              value type is a <span class="bold"><strong><span class="emphasis"><em>strict weak ordering</em></span></strong></span>,
-              as defined in the <code class="computeroutput"><span class="identifier">LessThanComparableConcept</span></code>
-              requirements.
-            </li>
+                The ordering of objects of type <code class="computeroutput"><span class="identifier">BidirectionalRange</span></code>'s
+                value type is a <span class="bold"><strong><span class="emphasis"><em>strict weak ordering</em></span></strong></span>,
+                as defined in the <code class="computeroutput"><span class="identifier">LessThanComparableConcept</span></code>
+                requirements.
+              </li>
 </ul></div>
 <p>
             <span class="bold"><strong>For the predicate versions:</strong></span>
           </p>
 <div class="itemizedlist"><ul class="itemizedlist" type="disc">
 <li class="listitem">
-<code class="computeroutput"><span class="identifier">BidirectionalRange</span></code>
-              is a model of the <a class="link" href="../../../concepts/bidirectional_range.html" title="Bidirectional Range">Bidirectional
-              Range</a> Concept.
-            </li>
+                <code class="computeroutput"><span class="identifier">BidirectionalRange</span></code>
+                is a model of the <a class="link" href="../../../concepts/bidirectional_range.html" title="Bidirectional Range">Bidirectional
+                Range</a> Concept.
+              </li>
 <li class="listitem">
-<code class="computeroutput"><span class="identifier">BidirectionalRange</span></code>
-              is mutable.
-            </li>
+                <code class="computeroutput"><span class="identifier">BidirectionalRange</span></code>
+                is mutable.
+              </li>
 <li class="listitem">
-<code class="computeroutput"><span class="identifier">Compare</span></code> is a model
-              of the <code class="computeroutput"><span class="identifier">StrictWeakOrderingConcept</span></code>.
-            </li>
+                <code class="computeroutput"><span class="identifier">Compare</span></code> is a model
+                of the <code class="computeroutput"><span class="identifier">StrictWeakOrderingConcept</span></code>.
+              </li>
 <li class="listitem">
-<code class="computeroutput"><span class="identifier">BidirectionalRange</span></code>'s
-              value type is convertible to both of <code class="computeroutput"><span class="identifier">Compare</span></code>'s
-              argument types.
-            </li>
+                <code class="computeroutput"><span class="identifier">BidirectionalRange</span></code>'s
+                value type is convertible to both of <code class="computeroutput"><span class="identifier">Compare</span></code>'s
+                argument types.
+              </li>
 </ul></div>
 <a name="range.reference.algorithms.permutation.prev_permutation.complexity"></a><h6>
-<a name="id2783909"></a>
+<a name="id3359455"></a>
             <a class="link" href="prev_permutation.html#range.reference.algorithms.permutation.prev_permutation.complexity">Complexity</a>
           </h6>
 <p>
@@ -143,7 +143,7 @@
 </tr></table>
 <hr>
 <div class="spirit-nav">
-<a accesskey="p" href="next_permutation.html"><img src="../../../../../../../../doc/html/images/prev.png" alt="Prev"></a><a accesskey="u" href="../permutation.html"><img src="../../../../../../../../doc/html/images/up.png" alt="Up"></a><a accesskey="h" href="../../../../index.html"><img src="../../../../../../../../doc/html/images/home.png" alt="Home"></a><a accesskey="n" href="../new.html"><img src="../../../../../../../../doc/html/images/next.png" alt="Next"></a>
+<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>
 </body>
 </html>
diff --git a/doc/html/range/reference/algorithms/range_algorithm_introduction.html b/doc/html/range/reference/algorithms/range_algorithm_introduction.html
new file mode 100644
index 0000000..36667b3
--- /dev/null
+++ b/doc/html/range/reference/algorithms/range_algorithm_introduction.html
@@ -0,0 +1,257 @@
+<html>
+<head>
+<meta http-equiv="Content-Type" content="text/html; charset=US-ASCII">
+<title>Introduction and motivation</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="../algorithms.html" title="Range Algorithm">
+<link rel="prev" href="../algorithms.html" title="Range Algorithm">
+<link rel="next" href="mutating.html" title="Mutating algorithms">
+</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="../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="titlepage"><div><div><h4 class="title">
+<a name="range.reference.algorithms.range_algorithm_introduction"></a><a class="link" href="range_algorithm_introduction.html" title="Introduction and motivation">
+        Introduction and motivation</a>
+</h4></div></div></div>
+<p>
+          In its most simple form a <span class="bold"><strong>Range Algorithm</strong></span>
+          (or range-based algorithm) is simply an iterator-based algorithm where
+          the <span class="emphasis"><em>two</em></span> iterator arguments have been replaced by
+          <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>
+
+<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">sort</span><span class="special">(</span><span class="identifier">vec</span><span class="special">);</span>
+</pre>
+<p>
+        </p>
+<p>
+          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>
+<p>
+        </p>
+<p>
+          However, the return type of range algorithms is almost always different
+          from that of existing iterator-based algorithms.
+        </p>
+<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 
+</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>
+<p>
+          to first sort the range and then run <code class="computeroutput"><span class="identifier">unique</span><span class="special">()</span></code> on the sorted range.
+        </p>
+<p>
+          Algorithms like <code class="computeroutput"><span class="identifier">boost</span><span class="special">::</span><span class="identifier">unique</span><span class="special">()</span></code>
+          fall into another group of algorithms that return (potentially) narrowed
+          views of the original range. By default <code class="computeroutput"><span class="identifier">boost</span><span class="special">::</span><span class="identifier">unique</span><span class="special">(</span><span class="identifier">rng</span><span class="special">)</span></code> returns the range <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">found</span><span class="special">)</span></code>
+          where <code class="computeroutput"><span class="identifier">found</span></code> denotes the
+          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 
+</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>
+</pre>
+<p>
+        </p>
+<p>
+          Algorithms like <code class="computeroutput"><span class="identifier">boost</span><span class="special">::</span><span class="identifier">unique</span></code> usually return the same range:
+          <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">found</span><span class="special">)</span></code>. However, this behaviour may be changed
+          by supplying the algorithms with a template argument:
+        </p>
+<div class="informaltable"><table class="table">
+<colgroup>
+<col>
+<col>
+</colgroup>
+<thead><tr>
+<th>
+                  <p>
+                    Expression
+                  </p>
+                </th>
+<th>
+                  <p>
+                    Return
+                  </p>
+                </th>
+</tr></thead>
+<tbody>
+<tr>
+<td>
+                  <p>
+                    <code class="computeroutput"><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</span><span class="special">&gt;(</span><span class="identifier">rng</span><span class="special">)</span></code>
+                  </p>
+                </td>
+<td>
+                  <p>
+                    returns a single iterator like <code class="computeroutput"><span class="identifier">std</span><span class="special">::</span><span class="identifier">unique</span></code>
+                  </p>
+                </td>
+</tr>
+<tr>
+<td>
+                  <p>
+                    <code class="computeroutput"><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_begin_found</span><span class="special">&gt;(</span><span class="identifier">rng</span><span class="special">)</span></code>
+                  </p>
+                </td>
+<td>
+                  <p>
+                    returns the range <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">found</span><span class="special">)</span></code>
+                    (this is the default)
+                  </p>
+                </td>
+</tr>
+<tr>
+<td>
+                  <p>
+                    <code class="computeroutput"><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_begin_next</span><span class="special">&gt;(</span><span class="identifier">rng</span><span class="special">)</span></code>
+                  </p>
+                </td>
+<td>
+                  <p>
+                    returns the range <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">next</span><span class="special">(</span><span class="identifier">found</span><span class="special">))</span></code>
+                  </p>
+                </td>
+</tr>
+<tr>
+<td>
+                  <p>
+                    <code class="computeroutput"><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">rng</span><span class="special">)</span></code>
+                  </p>
+                </td>
+<td>
+                  <p>
+                    returns the range <code class="computeroutput"><span class="special">[</span><span class="identifier">found</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>
+                </td>
+</tr>
+<tr>
+<td>
+                  <p>
+                    <code class="computeroutput"><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">rng</span><span class="special">)</span></code>
+                  </p>
+                </td>
+<td>
+                  <p>
+                    returns the range <code class="computeroutput"><span class="special">[</span><span class="identifier">boost</span><span class="special">::</span><span class="identifier">next</span><span class="special">(</span><span class="identifier">found</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>
+                </td>
+</tr>
+<tr>
+<td>
+                  <p>
+                    <code class="computeroutput"><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_begin_end</span><span class="special">&gt;(</span><span class="identifier">rng</span><span class="special">)</span></code>
+                  </p>
+                </td>
+<td>
+                  <p>
+                    returns the entire original range.
+                  </p>
+                </td>
+</tr>
+</tbody>
+</table></div>
+<p>
+          This functionality has the following advantages:
+        </p>
+<div class="orderedlist"><ol class="orderedlist" type="1">
+<li class="listitem">
+              it allows for <span class="emphasis"><em><span class="bold"><strong>seamless functional-style
+              programming</strong></span></em></span> where you do not need to use named
+              local variables to store intermediate results
+            </li>
+<li class="listitem">
+              it is very <span class="emphasis"><em><span class="bold"><strong>safe</strong></span></em></span>
+              because the algorithm can verify out-of-bounds conditions and handle
+              tricky conditions that lead to empty ranges
+            </li>
+</ol></div>
+<p>
+          For example, consider how easy we may erase the duplicates in a sorted
+          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>
+</pre>
+<p>
+        </p>
+<p>
+          Notice the use of <code class="computeroutput"><span class="identifier">boost</span><span class="special">::</span><span class="identifier">return_found_end</span></code>.
+          What if we wanted to erase all the duplicates except one of them? In old-fashined
+          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>
+
+<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>
+</pre>
+<p>
+        </p>
+<p>
+          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>
+<p>
+          and there is no need to worry about generating an invalid range. Furthermore,
+          if the container is complex, calling <code class="computeroutput"><span class="identifier">vec</span><span class="special">.</span><span class="identifier">end</span><span class="special">()</span></code> several times will be more expensive
+          than using a range algorithm.
+        </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>
+        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="../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>
+</body>
+</html>
diff --git a/doc/html/range/reference/algorithms/set.html b/doc/html/range/reference/algorithms/set.html
index 7de08c4..2e0ae8b 100644
--- a/doc/html/range/reference/algorithms/set.html
+++ b/doc/html/range/reference/algorithms/set.html
@@ -2,8 +2,8 @@
 <head>
 <meta http-equiv="Content-Type" content="text/html; charset=US-ASCII">
 <title>Set algorithms</title>
-<link rel="stylesheet" href="../../../../../../../doc/html/boostbook.css" type="text/css">
-<meta name="generator" content="DocBook XSL Stylesheets V1.75.1">
+<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="../algorithms.html" title="Range Algorithm">
 <link rel="prev" href="non_mutating/upper_bound.html" title="upper_bound">
@@ -13,16 +13,16 @@
 <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="../../../../../../libraries.htm">Libraries</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="non_mutating/upper_bound.html"><img src="../../../../../../../doc/html/images/prev.png" alt="Prev"></a><a accesskey="u" href="../algorithms.html"><img src="../../../../../../../doc/html/images/up.png" alt="Up"></a><a accesskey="h" href="../../../index.html"><img src="../../../../../../../doc/html/images/home.png" alt="Home"></a><a accesskey="n" href="set/includes.html"><img src="../../../../../../../doc/html/images/next.png" alt="Next"></a>
+<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" title="Set algorithms">
+<div class="section">
 <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>
@@ -46,7 +46,7 @@
 </tr></table>
 <hr>
 <div class="spirit-nav">
-<a accesskey="p" href="non_mutating/upper_bound.html"><img src="../../../../../../../doc/html/images/prev.png" alt="Prev"></a><a accesskey="u" href="../algorithms.html"><img src="../../../../../../../doc/html/images/up.png" alt="Up"></a><a accesskey="h" href="../../../index.html"><img src="../../../../../../../doc/html/images/home.png" alt="Home"></a><a accesskey="n" href="set/includes.html"><img src="../../../../../../../doc/html/images/next.png" alt="Next"></a>
+<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>
 </body>
 </html>
diff --git a/doc/html/range/reference/algorithms/set/includes.html b/doc/html/range/reference/algorithms/set/includes.html
index d03a126..0e7e4b6 100644
--- a/doc/html/range/reference/algorithms/set/includes.html
+++ b/doc/html/range/reference/algorithms/set/includes.html
@@ -2,8 +2,8 @@
 <head>
 <meta http-equiv="Content-Type" content="text/html; charset=US-ASCII">
 <title>includes</title>
-<link rel="stylesheet" href="../../../../../../../../doc/html/boostbook.css" type="text/css">
-<meta name="generator" content="DocBook XSL Stylesheets V1.75.1">
+<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="../set.html" title="Set algorithms">
 <link rel="prev" href="../set.html" title="Set algorithms">
@@ -13,21 +13,21 @@
 <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="../../../../../../../libraries.htm">Libraries</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="../set.html"><img src="../../../../../../../../doc/html/images/prev.png" alt="Prev"></a><a accesskey="u" href="../set.html"><img src="../../../../../../../../doc/html/images/up.png" alt="Up"></a><a accesskey="h" href="../../../../index.html"><img src="../../../../../../../../doc/html/images/home.png" alt="Home"></a><a accesskey="n" href="set_union.html"><img src="../../../../../../../../doc/html/images/next.png" alt="Next"></a>
+<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" title="includes">
+<div class="section">
 <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="id2772542"></a>
+<a name="id3347682"></a>
             <a class="link" href="includes.html#range.reference.algorithms.set.includes.prototype">Prototype</a>
           </h6>
 <p>
@@ -47,7 +47,7 @@
 <p>
           </p>
 <a name="range.reference.algorithms.set.includes.description"></a><h6>
-<a name="id2772825"></a>
+<a name="id3347965"></a>
             <a class="link" href="includes.html#range.reference.algorithms.set.includes.description">Description</a>
           </h6>
 <p>
@@ -59,14 +59,14 @@
             the predicate versions.
           </p>
 <a name="range.reference.algorithms.set.includes.definition"></a><h6>
-<a name="id2772922"></a>
+<a name="id3348062"></a>
             <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="id2772994"></a>
+<a name="id3348134"></a>
             <a class="link" href="includes.html#range.reference.algorithms.set.includes.requirements">Requirements</a>
           </h6>
 <p>
@@ -74,77 +74,77 @@
           </p>
 <div class="itemizedlist"><ul class="itemizedlist" type="disc">
 <li class="listitem">
-<code class="computeroutput"><span class="identifier">SinglePassRange1</span></code> is
-              a model of the <a class="link" href="../../../concepts/single_pass_range.html" title="Single Pass Range">Single
-              Pass Range</a> Concept.
-            </li>
+                <code class="computeroutput"><span class="identifier">SinglePassRange1</span></code>
+                is a model of the <a class="link" href="../../../concepts/single_pass_range.html" title="Single Pass Range">Single
+                Pass Range</a> Concept.
+              </li>
 <li class="listitem">
-<code class="computeroutput"><span class="identifier">SinglePassRange2</span></code> is
-              a model of the <a class="link" href="../../../concepts/single_pass_range.html" title="Single Pass Range">Single
-              Pass Range</a> Concept.
-            </li>
+                <code class="computeroutput"><span class="identifier">SinglePassRange2</span></code>
+                is a model of the <a class="link" href="../../../concepts/single_pass_range.html" title="Single Pass Range">Single
+                Pass Range</a> Concept.
+              </li>
 <li class="listitem">
-<code class="computeroutput"><span class="identifier">SinglePassRange1</span></code> and
-              <code class="computeroutput"><span class="identifier">SinglePassRange2</span></code> have
-              the same value type.
-            </li>
+                <code class="computeroutput"><span class="identifier">SinglePassRange1</span></code>
+                and <code class="computeroutput"><span class="identifier">SinglePassRange2</span></code>
+                have the same value type.
+              </li>
 <li class="listitem">
-<code class="computeroutput"><span class="identifier">SinglePassRange1</span></code>'s
-              value type is a model of the <code class="computeroutput"><span class="identifier">LessThanComparableConcept</span></code>.
-            </li>
+                <code class="computeroutput"><span class="identifier">SinglePassRange1</span></code>'s
+                value type is a model of the <code class="computeroutput"><span class="identifier">LessThanComparableConcept</span></code>.
+              </li>
 <li class="listitem">
-<code class="computeroutput"><span class="identifier">SinglePassRange2</span></code>'s
-              value type is a model of the <code class="computeroutput"><span class="identifier">LessThanComparableConcept</span></code>.
-            </li>
+                <code class="computeroutput"><span class="identifier">SinglePassRange2</span></code>'s
+                value type is a model of the <code class="computeroutput"><span class="identifier">LessThanComparableConcept</span></code>.
+              </li>
 <li class="listitem">
-              The ordering of objects of type <code class="computeroutput"><span class="identifier">SinglePassRange1</span></code>'s
-              value type is a <span class="bold"><strong><span class="emphasis"><em>strict weak ordering</em></span></strong></span>,
-              as defined in the <code class="computeroutput"><span class="identifier">LessThanComparableConcept</span></code>
-              requirements.
-            </li>
+                The ordering of objects of type <code class="computeroutput"><span class="identifier">SinglePassRange1</span></code>'s
+                value type is a <span class="bold"><strong><span class="emphasis"><em>strict weak ordering</em></span></strong></span>,
+                as defined in the <code class="computeroutput"><span class="identifier">LessThanComparableConcept</span></code>
+                requirements.
+              </li>
 <li class="listitem">
-              The ordering of objects of type <code class="computeroutput"><span class="identifier">SinglePassRange2</span></code>'s
-              value type is a <span class="bold"><strong><span class="emphasis"><em>strict weak ordering</em></span></strong></span>,
-              as defined in the <code class="computeroutput"><span class="identifier">LessThanComparableConcept</span></code>
-              requirements.
-            </li>
+                The ordering of objects of type <code class="computeroutput"><span class="identifier">SinglePassRange2</span></code>'s
+                value type is a <span class="bold"><strong><span class="emphasis"><em>strict weak ordering</em></span></strong></span>,
+                as defined in the <code class="computeroutput"><span class="identifier">LessThanComparableConcept</span></code>
+                requirements.
+              </li>
 </ul></div>
 <p>
             <span class="bold"><strong>For the predicate versions:</strong></span>
           </p>
 <div class="itemizedlist"><ul class="itemizedlist" type="disc">
 <li class="listitem">
-<code class="computeroutput"><span class="identifier">SinglePassRange1</span></code> is
-              a model of the <a class="link" href="../../../concepts/single_pass_range.html" title="Single Pass Range">Single
-              Pass Range</a> Concept.
-            </li>
+                <code class="computeroutput"><span class="identifier">SinglePassRange1</span></code>
+                is a model of the <a class="link" href="../../../concepts/single_pass_range.html" title="Single Pass Range">Single
+                Pass Range</a> Concept.
+              </li>
 <li class="listitem">
-<code class="computeroutput"><span class="identifier">SinglePassRange2</span></code> is
-              a model of the <a class="link" href="../../../concepts/single_pass_range.html" title="Single Pass Range">Single
-              Pass Range</a> Concept.
-            </li>
+                <code class="computeroutput"><span class="identifier">SinglePassRange2</span></code>
+                is a model of the <a class="link" href="../../../concepts/single_pass_range.html" title="Single Pass Range">Single
+                Pass Range</a> Concept.
+              </li>
 <li class="listitem">
-<code class="computeroutput"><span class="identifier">SinglePassRange1</span></code> and
-              <code class="computeroutput"><span class="identifier">SinglePassRange2</span></code> have
-              the same value type.
-            </li>
+                <code class="computeroutput"><span class="identifier">SinglePassRange1</span></code>
+                and <code class="computeroutput"><span class="identifier">SinglePassRange2</span></code>
+                have the same value type.
+              </li>
 <li class="listitem">
-<code class="computeroutput"><span class="identifier">BinaryPredicate</span></code> is
-              a model of the <code class="computeroutput"><span class="identifier">StrictWeakOrderingConcept</span></code>.
-            </li>
+                <code class="computeroutput"><span class="identifier">BinaryPredicate</span></code> is
+                a model of the <code class="computeroutput"><span class="identifier">StrictWeakOrderingConcept</span></code>.
+              </li>
 <li class="listitem">
-<code class="computeroutput"><span class="identifier">SinglePassRange1</span></code>'s
-              value type is convertible to <code class="computeroutput"><span class="identifier">BinaryPredicate</span></code>'s
-              first argument type.
-            </li>
+                <code class="computeroutput"><span class="identifier">SinglePassRange1</span></code>'s
+                value type is convertible to <code class="computeroutput"><span class="identifier">BinaryPredicate</span></code>'s
+                first argument type.
+              </li>
 <li class="listitem">
-<code class="computeroutput"><span class="identifier">SinglePassRange2</span></code>'s
-              value type is convertible to <code class="computeroutput"><span class="identifier">BinaryPredicate</span></code>'s
-              second argument types.
-            </li>
+                <code class="computeroutput"><span class="identifier">SinglePassRange2</span></code>'s
+                value type is convertible to <code class="computeroutput"><span class="identifier">BinaryPredicate</span></code>'s
+                second argument types.
+              </li>
 </ul></div>
 <a name="range.reference.algorithms.set.includes.precondition_"></a><h6>
-<a name="id2773384"></a>
+<a name="id3348567"></a>
             <a class="link" href="includes.html#range.reference.algorithms.set.includes.precondition_">Precondition:</a>
           </h6>
 <p>
@@ -162,7 +162,7 @@
             according to <code class="computeroutput"><span class="identifier">pred</span></code>.
           </p>
 <a name="range.reference.algorithms.set.includes.complexity"></a><h6>
-<a name="id2773503"></a>
+<a name="id3348686"></a>
             <a class="link" href="includes.html#range.reference.algorithms.set.includes.complexity">Complexity</a>
           </h6>
 <p>
@@ -180,7 +180,7 @@
 </tr></table>
 <hr>
 <div class="spirit-nav">
-<a accesskey="p" href="../set.html"><img src="../../../../../../../../doc/html/images/prev.png" alt="Prev"></a><a accesskey="u" href="../set.html"><img src="../../../../../../../../doc/html/images/up.png" alt="Up"></a><a accesskey="h" href="../../../../index.html"><img src="../../../../../../../../doc/html/images/home.png" alt="Home"></a><a accesskey="n" href="set_union.html"><img src="../../../../../../../../doc/html/images/next.png" alt="Next"></a>
+<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>
 </body>
 </html>
diff --git a/doc/html/range/reference/algorithms/set/set_difference.html b/doc/html/range/reference/algorithms/set/set_difference.html
index 3084d87..c53281e 100644
--- a/doc/html/range/reference/algorithms/set/set_difference.html
+++ b/doc/html/range/reference/algorithms/set/set_difference.html
@@ -2,8 +2,8 @@
 <head>
 <meta http-equiv="Content-Type" content="text/html; charset=US-ASCII">
 <title>set_difference</title>
-<link rel="stylesheet" href="../../../../../../../../doc/html/boostbook.css" type="text/css">
-<meta name="generator" content="DocBook XSL Stylesheets V1.75.1">
+<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="../set.html" title="Set algorithms">
 <link rel="prev" href="set_intersection.html" title="set_intersection">
@@ -13,21 +13,21 @@
 <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="../../../../../../../libraries.htm">Libraries</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="set_intersection.html"><img src="../../../../../../../../doc/html/images/prev.png" alt="Prev"></a><a accesskey="u" href="../set.html"><img src="../../../../../../../../doc/html/images/up.png" alt="Up"></a><a accesskey="h" href="../../../../index.html"><img src="../../../../../../../../doc/html/images/home.png" alt="Home"></a><a accesskey="n" href="set_symmetric_difference.html"><img src="../../../../../../../../doc/html/images/next.png" alt="Next"></a>
+<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" title="set_difference">
+<div class="section">
 <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="id2776036"></a>
+<a name="id3351318"></a>
             <a class="link" href="set_difference.html#range.reference.algorithms.set.set_difference.prototype">Prototype</a>
           </h6>
 <p>
@@ -56,7 +56,7 @@
 <p>
           </p>
 <a name="range.reference.algorithms.set.set_difference.description"></a><h6>
-<a name="id2776387"></a>
+<a name="id3351669"></a>
             <a class="link" href="set_difference.html#range.reference.algorithms.set.set_difference.description">Description</a>
           </h6>
 <p>
@@ -70,14 +70,14 @@
             the predicate versions.
           </p>
 <a name="range.reference.algorithms.set.set_difference.definition"></a><h6>
-<a name="id2776479"></a>
+<a name="id3351760"></a>
             <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="id2776552"></a>
+<a name="id3351833"></a>
             <a class="link" href="set_difference.html#range.reference.algorithms.set.set_difference.requirements">Requirements</a>
           </h6>
 <p>
@@ -85,85 +85,85 @@
           </p>
 <div class="itemizedlist"><ul class="itemizedlist" type="disc">
 <li class="listitem">
-<code class="computeroutput"><span class="identifier">SinglePassRange1</span></code> is
-              a model of the <a class="link" href="../../../concepts/single_pass_range.html" title="Single Pass Range">Single
-              Pass Range</a> Concept.
-            </li>
+                <code class="computeroutput"><span class="identifier">SinglePassRange1</span></code>
+                is a model of the <a class="link" href="../../../concepts/single_pass_range.html" title="Single Pass Range">Single
+                Pass Range</a> Concept.
+              </li>
 <li class="listitem">
-<code class="computeroutput"><span class="identifier">SinglePassRange2</span></code> is
-              a model of the <a class="link" href="../../../concepts/single_pass_range.html" title="Single Pass Range">Single
-              Pass Range</a> Concept.
-            </li>
+                <code class="computeroutput"><span class="identifier">SinglePassRange2</span></code>
+                is a model of the <a class="link" href="../../../concepts/single_pass_range.html" title="Single Pass Range">Single
+                Pass Range</a> Concept.
+              </li>
 <li class="listitem">
-<code class="computeroutput"><span class="identifier">OutputIterator</span></code> is a
-              model of the <code class="computeroutput"><span class="identifier">OutputIteratorConcept</span></code>.
-            </li>
+                <code class="computeroutput"><span class="identifier">OutputIterator</span></code> is
+                a model of the <code class="computeroutput"><span class="identifier">OutputIteratorConcept</span></code>.
+              </li>
 <li class="listitem">
-<code class="computeroutput"><span class="identifier">SinglePassRange1</span></code> and
-              <code class="computeroutput"><span class="identifier">SinglePassRange2</span></code> have
-              the same value type.
-            </li>
+                <code class="computeroutput"><span class="identifier">SinglePassRange1</span></code>
+                and <code class="computeroutput"><span class="identifier">SinglePassRange2</span></code>
+                have the same value type.
+              </li>
 <li class="listitem">
-<code class="computeroutput"><span class="identifier">SinglePassRange1</span></code>'s
-              value type is a model of the <code class="computeroutput"><span class="identifier">LessThanComparableConcept</span></code>.
-            </li>
+                <code class="computeroutput"><span class="identifier">SinglePassRange1</span></code>'s
+                value type is a model of the <code class="computeroutput"><span class="identifier">LessThanComparableConcept</span></code>.
+              </li>
 <li class="listitem">
-<code class="computeroutput"><span class="identifier">SinglePassRange2</span></code>'s
-              value type is a model of the <code class="computeroutput"><span class="identifier">LessThanComparableConcept</span></code>.
-            </li>
+                <code class="computeroutput"><span class="identifier">SinglePassRange2</span></code>'s
+                value type is a model of the <code class="computeroutput"><span class="identifier">LessThanComparableConcept</span></code>.
+              </li>
 <li class="listitem">
-              The ordering of objects of type <code class="computeroutput"><span class="identifier">SinglePassRange1</span></code>'s
-              value type is a <span class="bold"><strong><span class="emphasis"><em>strict weak ordering</em></span></strong></span>,
-              as defined in the <code class="computeroutput"><span class="identifier">LessThanComparableConcept</span></code>
-              requirements.
-            </li>
+                The ordering of objects of type <code class="computeroutput"><span class="identifier">SinglePassRange1</span></code>'s
+                value type is a <span class="bold"><strong><span class="emphasis"><em>strict weak ordering</em></span></strong></span>,
+                as defined in the <code class="computeroutput"><span class="identifier">LessThanComparableConcept</span></code>
+                requirements.
+              </li>
 <li class="listitem">
-              The ordering of objects of type <code class="computeroutput"><span class="identifier">SinglePassRange2</span></code>'s
-              value type is a <span class="bold"><strong><span class="emphasis"><em>strict weak ordering</em></span></strong></span>,
-              as defined in the <code class="computeroutput"><span class="identifier">LessThanComparableConcept</span></code>
-              requirements.
-            </li>
+                The ordering of objects of type <code class="computeroutput"><span class="identifier">SinglePassRange2</span></code>'s
+                value type is a <span class="bold"><strong><span class="emphasis"><em>strict weak ordering</em></span></strong></span>,
+                as defined in the <code class="computeroutput"><span class="identifier">LessThanComparableConcept</span></code>
+                requirements.
+              </li>
 </ul></div>
 <p>
             <span class="bold"><strong>For the predicate versions:</strong></span>
           </p>
 <div class="itemizedlist"><ul class="itemizedlist" type="disc">
 <li class="listitem">
-<code class="computeroutput"><span class="identifier">SinglePassRange1</span></code> is
-              a model of the <a class="link" href="../../../concepts/single_pass_range.html" title="Single Pass Range">Single
-              Pass Range</a> Concept.
-            </li>
+                <code class="computeroutput"><span class="identifier">SinglePassRange1</span></code>
+                is a model of the <a class="link" href="../../../concepts/single_pass_range.html" title="Single Pass Range">Single
+                Pass Range</a> Concept.
+              </li>
 <li class="listitem">
-<code class="computeroutput"><span class="identifier">SinglePassRange2</span></code> is
-              a model of the <a class="link" href="../../../concepts/single_pass_range.html" title="Single Pass Range">Single
-              Pass Range</a> Concept.
-            </li>
+                <code class="computeroutput"><span class="identifier">SinglePassRange2</span></code>
+                is a model of the <a class="link" href="../../../concepts/single_pass_range.html" title="Single Pass Range">Single
+                Pass Range</a> Concept.
+              </li>
 <li class="listitem">
-<code class="computeroutput"><span class="identifier">OutputIterator</span></code> is a
-              model of the <code class="computeroutput"><span class="identifier">OutputIteratorConcept</span></code>.
-            </li>
+                <code class="computeroutput"><span class="identifier">OutputIterator</span></code> is
+                a model of the <code class="computeroutput"><span class="identifier">OutputIteratorConcept</span></code>.
+              </li>
 <li class="listitem">
-<code class="computeroutput"><span class="identifier">SinglePassRange1</span></code> and
-              <code class="computeroutput"><span class="identifier">SinglePassRange2</span></code> have
-              the same value type.
-            </li>
+                <code class="computeroutput"><span class="identifier">SinglePassRange1</span></code>
+                and <code class="computeroutput"><span class="identifier">SinglePassRange2</span></code>
+                have the same value type.
+              </li>
 <li class="listitem">
-<code class="computeroutput"><span class="identifier">BinaryPredicate</span></code> is
-              a model of the <code class="computeroutput"><span class="identifier">StrictWeakOrderingConcept</span></code>.
-            </li>
+                <code class="computeroutput"><span class="identifier">BinaryPredicate</span></code> is
+                a model of the <code class="computeroutput"><span class="identifier">StrictWeakOrderingConcept</span></code>.
+              </li>
 <li class="listitem">
-<code class="computeroutput"><span class="identifier">SinglePassRange1</span></code>'s
-              value type is convertible to <code class="computeroutput"><span class="identifier">BinaryPredicate</span></code>'s
-              first argument type.
-            </li>
+                <code class="computeroutput"><span class="identifier">SinglePassRange1</span></code>'s
+                value type is convertible to <code class="computeroutput"><span class="identifier">BinaryPredicate</span></code>'s
+                first argument type.
+              </li>
 <li class="listitem">
-<code class="computeroutput"><span class="identifier">SinglePassRange2</span></code>'s
-              value type is convertible to <code class="computeroutput"><span class="identifier">BinaryPredicate</span></code>'s
-              second argument types.
-            </li>
+                <code class="computeroutput"><span class="identifier">SinglePassRange2</span></code>'s
+                value type is convertible to <code class="computeroutput"><span class="identifier">BinaryPredicate</span></code>'s
+                second argument types.
+              </li>
 </ul></div>
 <a name="range.reference.algorithms.set.set_difference.precondition_"></a><h6>
-<a name="id2776996"></a>
+<a name="id3352325"></a>
             <a class="link" href="set_difference.html#range.reference.algorithms.set.set_difference.precondition_">Precondition:</a>
           </h6>
 <p>
@@ -181,7 +181,7 @@
             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="id2777114"></a>
+<a name="id3352443"></a>
             <a class="link" href="set_difference.html#range.reference.algorithms.set.set_difference.complexity">Complexity</a>
           </h6>
 <p>
@@ -199,7 +199,7 @@
 </tr></table>
 <hr>
 <div class="spirit-nav">
-<a accesskey="p" href="set_intersection.html"><img src="../../../../../../../../doc/html/images/prev.png" alt="Prev"></a><a accesskey="u" href="../set.html"><img src="../../../../../../../../doc/html/images/up.png" alt="Up"></a><a accesskey="h" href="../../../../index.html"><img src="../../../../../../../../doc/html/images/home.png" alt="Home"></a><a accesskey="n" href="set_symmetric_difference.html"><img src="../../../../../../../../doc/html/images/next.png" alt="Next"></a>
+<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>
 </body>
 </html>
diff --git a/doc/html/range/reference/algorithms/set/set_intersection.html b/doc/html/range/reference/algorithms/set/set_intersection.html
index a817f35..b77838f 100644
--- a/doc/html/range/reference/algorithms/set/set_intersection.html
+++ b/doc/html/range/reference/algorithms/set/set_intersection.html
@@ -2,8 +2,8 @@
 <head>
 <meta http-equiv="Content-Type" content="text/html; charset=US-ASCII">
 <title>set_intersection</title>
-<link rel="stylesheet" href="../../../../../../../../doc/html/boostbook.css" type="text/css">
-<meta name="generator" content="DocBook XSL Stylesheets V1.75.1">
+<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="../set.html" title="Set algorithms">
 <link rel="prev" href="set_union.html" title="set_union">
@@ -13,22 +13,22 @@
 <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="../../../../../../../libraries.htm">Libraries</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="set_union.html"><img src="../../../../../../../../doc/html/images/prev.png" alt="Prev"></a><a accesskey="u" href="../set.html"><img src="../../../../../../../../doc/html/images/up.png" alt="Up"></a><a accesskey="h" href="../../../../index.html"><img src="../../../../../../../../doc/html/images/home.png" alt="Home"></a><a accesskey="n" href="set_difference.html"><img src="../../../../../../../../doc/html/images/next.png" alt="Next"></a>
+<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" title="set_intersection">
+<div class="section">
 <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="id2774830"></a>
+<a name="id3350062"></a>
             <a class="link" href="set_intersection.html#range.reference.algorithms.set.set_intersection.prototype">Prototype</a>
           </h6>
 <p>
@@ -57,7 +57,7 @@
 <p>
           </p>
 <a name="range.reference.algorithms.set.set_intersection.description"></a><h6>
-<a name="id2775180"></a>
+<a name="id3350412"></a>
             <a class="link" href="set_intersection.html#range.reference.algorithms.set.set_intersection.description">Description</a>
           </h6>
 <p>
@@ -71,14 +71,14 @@
             the predicate versions.
           </p>
 <a name="range.reference.algorithms.set.set_intersection.definition"></a><h6>
-<a name="id2775273"></a>
+<a name="id3350504"></a>
             <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="id2775347"></a>
+<a name="id3350578"></a>
             <a class="link" href="set_intersection.html#range.reference.algorithms.set.set_intersection.requirements">Requirements</a>
           </h6>
 <p>
@@ -86,85 +86,85 @@
           </p>
 <div class="itemizedlist"><ul class="itemizedlist" type="disc">
 <li class="listitem">
-<code class="computeroutput"><span class="identifier">SinglePassRange1</span></code> is
-              a model of the <a class="link" href="../../../concepts/single_pass_range.html" title="Single Pass Range">Single
-              Pass Range</a> Concept.
-            </li>
+                <code class="computeroutput"><span class="identifier">SinglePassRange1</span></code>
+                is a model of the <a class="link" href="../../../concepts/single_pass_range.html" title="Single Pass Range">Single
+                Pass Range</a> Concept.
+              </li>
 <li class="listitem">
-<code class="computeroutput"><span class="identifier">SinglePassRange2</span></code> is
-              a model of the <a class="link" href="../../../concepts/single_pass_range.html" title="Single Pass Range">Single
-              Pass Range</a> Concept.
-            </li>
+                <code class="computeroutput"><span class="identifier">SinglePassRange2</span></code>
+                is a model of the <a class="link" href="../../../concepts/single_pass_range.html" title="Single Pass Range">Single
+                Pass Range</a> Concept.
+              </li>
 <li class="listitem">
-<code class="computeroutput"><span class="identifier">OutputIterator</span></code> is a
-              model of the <code class="computeroutput"><span class="identifier">OutputIteratorConcept</span></code>.
-            </li>
+                <code class="computeroutput"><span class="identifier">OutputIterator</span></code> is
+                a model of the <code class="computeroutput"><span class="identifier">OutputIteratorConcept</span></code>.
+              </li>
 <li class="listitem">
-<code class="computeroutput"><span class="identifier">SinglePassRange1</span></code> and
-              <code class="computeroutput"><span class="identifier">SinglePassRange2</span></code> have
-              the same value type.
-            </li>
+                <code class="computeroutput"><span class="identifier">SinglePassRange1</span></code>
+                and <code class="computeroutput"><span class="identifier">SinglePassRange2</span></code>
+                have the same value type.
+              </li>
 <li class="listitem">
-<code class="computeroutput"><span class="identifier">SinglePassRange1</span></code>'s
-              value type is a model of the <code class="computeroutput"><span class="identifier">LessThanComparableConcept</span></code>.
-            </li>
+                <code class="computeroutput"><span class="identifier">SinglePassRange1</span></code>'s
+                value type is a model of the <code class="computeroutput"><span class="identifier">LessThanComparableConcept</span></code>.
+              </li>
 <li class="listitem">
-<code class="computeroutput"><span class="identifier">SinglePassRange2</span></code>'s
-              value type is a model of the <code class="computeroutput"><span class="identifier">LessThanComparableConcept</span></code>.
-            </li>
+                <code class="computeroutput"><span class="identifier">SinglePassRange2</span></code>'s
+                value type is a model of the <code class="computeroutput"><span class="identifier">LessThanComparableConcept</span></code>.
+              </li>
 <li class="listitem">
-              The ordering of objects of type <code class="computeroutput"><span class="identifier">SinglePassRange1</span></code>'s
-              value type is a <span class="bold"><strong><span class="emphasis"><em>strict weak ordering</em></span></strong></span>,
-              as defined in the <code class="computeroutput"><span class="identifier">LessThanComparableConcept</span></code>
-              requirements.
-            </li>
+                The ordering of objects of type <code class="computeroutput"><span class="identifier">SinglePassRange1</span></code>'s
+                value type is a <span class="bold"><strong><span class="emphasis"><em>strict weak ordering</em></span></strong></span>,
+                as defined in the <code class="computeroutput"><span class="identifier">LessThanComparableConcept</span></code>
+                requirements.
+              </li>
 <li class="listitem">
-              The ordering of objects of type <code class="computeroutput"><span class="identifier">SinglePassRange2</span></code>'s
-              value type is a <span class="bold"><strong><span class="emphasis"><em>strict weak ordering</em></span></strong></span>,
-              as defined in the <code class="computeroutput"><span class="identifier">LessThanComparableConcept</span></code>
-              requirements.
-            </li>
+                The ordering of objects of type <code class="computeroutput"><span class="identifier">SinglePassRange2</span></code>'s
+                value type is a <span class="bold"><strong><span class="emphasis"><em>strict weak ordering</em></span></strong></span>,
+                as defined in the <code class="computeroutput"><span class="identifier">LessThanComparableConcept</span></code>
+                requirements.
+              </li>
 </ul></div>
 <p>
             <span class="bold"><strong>For the predicate versions:</strong></span>
           </p>
 <div class="itemizedlist"><ul class="itemizedlist" type="disc">
 <li class="listitem">
-<code class="computeroutput"><span class="identifier">SinglePassRange1</span></code> is
-              a model of the <a class="link" href="../../../concepts/single_pass_range.html" title="Single Pass Range">Single
-              Pass Range</a> Concept.
-            </li>
+                <code class="computeroutput"><span class="identifier">SinglePassRange1</span></code>
+                is a model of the <a class="link" href="../../../concepts/single_pass_range.html" title="Single Pass Range">Single
+                Pass Range</a> Concept.
+              </li>
 <li class="listitem">
-<code class="computeroutput"><span class="identifier">SinglePassRange2</span></code> is
-              a model of the <a class="link" href="../../../concepts/single_pass_range.html" title="Single Pass Range">Single
-              Pass Range</a> Concept.
-            </li>
+                <code class="computeroutput"><span class="identifier">SinglePassRange2</span></code>
+                is a model of the <a class="link" href="../../../concepts/single_pass_range.html" title="Single Pass Range">Single
+                Pass Range</a> Concept.
+              </li>
 <li class="listitem">
-<code class="computeroutput"><span class="identifier">OutputIterator</span></code> is a
-              model of the <code class="computeroutput"><span class="identifier">OutputIteratorConcept</span></code>.
-            </li>
+                <code class="computeroutput"><span class="identifier">OutputIterator</span></code> is
+                a model of the <code class="computeroutput"><span class="identifier">OutputIteratorConcept</span></code>.
+              </li>
 <li class="listitem">
-<code class="computeroutput"><span class="identifier">SinglePassRange1</span></code> and
-              <code class="computeroutput"><span class="identifier">SinglePassRange2</span></code> have
-              the same value type.
-            </li>
+                <code class="computeroutput"><span class="identifier">SinglePassRange1</span></code>
+                and <code class="computeroutput"><span class="identifier">SinglePassRange2</span></code>
+                have the same value type.
+              </li>
 <li class="listitem">
-<code class="computeroutput"><span class="identifier">BinaryPredicate</span></code> is
-              a model of the <code class="computeroutput"><span class="identifier">StrictWeakOrderingConcept</span></code>.
-            </li>
+                <code class="computeroutput"><span class="identifier">BinaryPredicate</span></code> is
+                a model of the <code class="computeroutput"><span class="identifier">StrictWeakOrderingConcept</span></code>.
+              </li>
 <li class="listitem">
-<code class="computeroutput"><span class="identifier">SinglePassRange1</span></code>'s
-              value type is convertible to <code class="computeroutput"><span class="identifier">BinaryPredicate</span></code>'s
-              first argument type.
-            </li>
+                <code class="computeroutput"><span class="identifier">SinglePassRange1</span></code>'s
+                value type is convertible to <code class="computeroutput"><span class="identifier">BinaryPredicate</span></code>'s
+                first argument type.
+              </li>
 <li class="listitem">
-<code class="computeroutput"><span class="identifier">SinglePassRange2</span></code>'s
-              value type is convertible to <code class="computeroutput"><span class="identifier">BinaryPredicate</span></code>'s
-              second argument types.
-            </li>
+                <code class="computeroutput"><span class="identifier">SinglePassRange2</span></code>'s
+                value type is convertible to <code class="computeroutput"><span class="identifier">BinaryPredicate</span></code>'s
+                second argument types.
+              </li>
 </ul></div>
 <a name="range.reference.algorithms.set.set_intersection.precondition_"></a><h6>
-<a name="id2775790"></a>
+<a name="id3351071"></a>
             <a class="link" href="set_intersection.html#range.reference.algorithms.set.set_intersection.precondition_">Precondition:</a>
           </h6>
 <p>
@@ -182,7 +182,7 @@
             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="id2775910"></a>
+<a name="id3351190"></a>
             <a class="link" href="set_intersection.html#range.reference.algorithms.set.set_intersection.complexity">Complexity</a>
           </h6>
 <p>
@@ -200,7 +200,7 @@
 </tr></table>
 <hr>
 <div class="spirit-nav">
-<a accesskey="p" href="set_union.html"><img src="../../../../../../../../doc/html/images/prev.png" alt="Prev"></a><a accesskey="u" href="../set.html"><img src="../../../../../../../../doc/html/images/up.png" alt="Up"></a><a accesskey="h" href="../../../../index.html"><img src="../../../../../../../../doc/html/images/home.png" alt="Home"></a><a accesskey="n" href="set_difference.html"><img src="../../../../../../../../doc/html/images/next.png" alt="Next"></a>
+<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>
 </body>
 </html>
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 659877c..bef721c 100644
--- a/doc/html/range/reference/algorithms/set/set_symmetric_difference.html
+++ b/doc/html/range/reference/algorithms/set/set_symmetric_difference.html
@@ -2,8 +2,8 @@
 <head>
 <meta http-equiv="Content-Type" content="text/html; charset=US-ASCII">
 <title>set_symmetric_difference</title>
-<link rel="stylesheet" href="../../../../../../../../doc/html/boostbook.css" type="text/css">
-<meta name="generator" content="DocBook XSL Stylesheets V1.75.1">
+<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="../set.html" title="Set algorithms">
 <link rel="prev" href="set_difference.html" title="set_difference">
@@ -13,22 +13,22 @@
 <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="../../../../../../../libraries.htm">Libraries</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="set_difference.html"><img src="../../../../../../../../doc/html/images/prev.png" alt="Prev"></a><a accesskey="u" href="../set.html"><img src="../../../../../../../../doc/html/images/up.png" alt="Up"></a><a accesskey="h" href="../../../../index.html"><img src="../../../../../../../../doc/html/images/home.png" alt="Home"></a><a accesskey="n" href="../heap.html"><img src="../../../../../../../../doc/html/images/next.png" alt="Next"></a>
+<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" title="set_symmetric_difference">
+<div class="section">
 <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="id2777243"></a>
+<a name="id3352573"></a>
             <a class="link" href="set_symmetric_difference.html#range.reference.algorithms.set.set_symmetric_difference.prototype">Prototype</a>
           </h6>
 <p>
@@ -59,7 +59,7 @@
 <p>
           </p>
 <a name="range.reference.algorithms.set.set_symmetric_difference.description"></a><h6>
-<a name="id2777594"></a>
+<a name="id3352924"></a>
             <a class="link" href="set_symmetric_difference.html#range.reference.algorithms.set.set_symmetric_difference.description">Description</a>
           </h6>
 <p>
@@ -75,14 +75,14 @@
             the predicate versions.
           </p>
 <a name="range.reference.algorithms.set.set_symmetric_difference.definition"></a><h6>
-<a name="id2777688"></a>
+<a name="id3353017"></a>
             <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="id2777761"></a>
+<a name="id3353091"></a>
             <a class="link" href="set_symmetric_difference.html#range.reference.algorithms.set.set_symmetric_difference.requirements">Requirements</a>
           </h6>
 <p>
@@ -90,85 +90,85 @@
           </p>
 <div class="itemizedlist"><ul class="itemizedlist" type="disc">
 <li class="listitem">
-<code class="computeroutput"><span class="identifier">SinglePassRange1</span></code> is
-              a model of the <a class="link" href="../../../concepts/single_pass_range.html" title="Single Pass Range">Single
-              Pass Range</a> Concept.
-            </li>
+                <code class="computeroutput"><span class="identifier">SinglePassRange1</span></code>
+                is a model of the <a class="link" href="../../../concepts/single_pass_range.html" title="Single Pass Range">Single
+                Pass Range</a> Concept.
+              </li>
 <li class="listitem">
-<code class="computeroutput"><span class="identifier">SinglePassRange2</span></code> is
-              a model of the <a class="link" href="../../../concepts/single_pass_range.html" title="Single Pass Range">Single
-              Pass Range</a> Concept.
-            </li>
+                <code class="computeroutput"><span class="identifier">SinglePassRange2</span></code>
+                is a model of the <a class="link" href="../../../concepts/single_pass_range.html" title="Single Pass Range">Single
+                Pass Range</a> Concept.
+              </li>
 <li class="listitem">
-<code class="computeroutput"><span class="identifier">OutputIterator</span></code> is a
-              model of the <code class="computeroutput"><span class="identifier">OutputIteratorConcept</span></code>.
-            </li>
+                <code class="computeroutput"><span class="identifier">OutputIterator</span></code> is
+                a model of the <code class="computeroutput"><span class="identifier">OutputIteratorConcept</span></code>.
+              </li>
 <li class="listitem">
-<code class="computeroutput"><span class="identifier">SinglePassRange1</span></code> and
-              <code class="computeroutput"><span class="identifier">SinglePassRange2</span></code> have
-              the same value type.
-            </li>
+                <code class="computeroutput"><span class="identifier">SinglePassRange1</span></code>
+                and <code class="computeroutput"><span class="identifier">SinglePassRange2</span></code>
+                have the same value type.
+              </li>
 <li class="listitem">
-<code class="computeroutput"><span class="identifier">SinglePassRange1</span></code>'s
-              value type is a model of the <code class="computeroutput"><span class="identifier">LessThanComparableConcept</span></code>.
-            </li>
+                <code class="computeroutput"><span class="identifier">SinglePassRange1</span></code>'s
+                value type is a model of the <code class="computeroutput"><span class="identifier">LessThanComparableConcept</span></code>.
+              </li>
 <li class="listitem">
-<code class="computeroutput"><span class="identifier">SinglePassRange2</span></code>'s
-              value type is a model of the <code class="computeroutput"><span class="identifier">LessThanComparableConcept</span></code>.
-            </li>
+                <code class="computeroutput"><span class="identifier">SinglePassRange2</span></code>'s
+                value type is a model of the <code class="computeroutput"><span class="identifier">LessThanComparableConcept</span></code>.
+              </li>
 <li class="listitem">
-              The ordering of objects of type <code class="computeroutput"><span class="identifier">SinglePassRange1</span></code>'s
-              value type is a <span class="bold"><strong><span class="emphasis"><em>strict weak ordering</em></span></strong></span>,
-              as defined in the <code class="computeroutput"><span class="identifier">LessThanComparableConcept</span></code>
-              requirements.
-            </li>
+                The ordering of objects of type <code class="computeroutput"><span class="identifier">SinglePassRange1</span></code>'s
+                value type is a <span class="bold"><strong><span class="emphasis"><em>strict weak ordering</em></span></strong></span>,
+                as defined in the <code class="computeroutput"><span class="identifier">LessThanComparableConcept</span></code>
+                requirements.
+              </li>
 <li class="listitem">
-              The ordering of objects of type <code class="computeroutput"><span class="identifier">SinglePassRange2</span></code>'s
-              value type is a <span class="bold"><strong><span class="emphasis"><em>strict weak ordering</em></span></strong></span>,
-              as defined in the <code class="computeroutput"><span class="identifier">LessThanComparableConcept</span></code>
-              requirements.
-            </li>
+                The ordering of objects of type <code class="computeroutput"><span class="identifier">SinglePassRange2</span></code>'s
+                value type is a <span class="bold"><strong><span class="emphasis"><em>strict weak ordering</em></span></strong></span>,
+                as defined in the <code class="computeroutput"><span class="identifier">LessThanComparableConcept</span></code>
+                requirements.
+              </li>
 </ul></div>
 <p>
             <span class="bold"><strong>For the predicate versions:</strong></span>
           </p>
 <div class="itemizedlist"><ul class="itemizedlist" type="disc">
 <li class="listitem">
-<code class="computeroutput"><span class="identifier">SinglePassRange1</span></code> is
-              a model of the <a class="link" href="../../../concepts/single_pass_range.html" title="Single Pass Range">Single
-              Pass Range</a> Concept.
-            </li>
+                <code class="computeroutput"><span class="identifier">SinglePassRange1</span></code>
+                is a model of the <a class="link" href="../../../concepts/single_pass_range.html" title="Single Pass Range">Single
+                Pass Range</a> Concept.
+              </li>
 <li class="listitem">
-<code class="computeroutput"><span class="identifier">SinglePassRange2</span></code> is
-              a model of the <a class="link" href="../../../concepts/single_pass_range.html" title="Single Pass Range">Single
-              Pass Range</a> Concept.
-            </li>
+                <code class="computeroutput"><span class="identifier">SinglePassRange2</span></code>
+                is a model of the <a class="link" href="../../../concepts/single_pass_range.html" title="Single Pass Range">Single
+                Pass Range</a> Concept.
+              </li>
 <li class="listitem">
-<code class="computeroutput"><span class="identifier">OutputIterator</span></code> is a
-              model of the <code class="computeroutput"><span class="identifier">OutputIteratorConcept</span></code>.
-            </li>
+                <code class="computeroutput"><span class="identifier">OutputIterator</span></code> is
+                a model of the <code class="computeroutput"><span class="identifier">OutputIteratorConcept</span></code>.
+              </li>
 <li class="listitem">
-<code class="computeroutput"><span class="identifier">SinglePassRange1</span></code> and
-              <code class="computeroutput"><span class="identifier">SinglePassRange2</span></code> have
-              the same value type.
-            </li>
+                <code class="computeroutput"><span class="identifier">SinglePassRange1</span></code>
+                and <code class="computeroutput"><span class="identifier">SinglePassRange2</span></code>
+                have the same value type.
+              </li>
 <li class="listitem">
-<code class="computeroutput"><span class="identifier">BinaryPredicate</span></code> is
-              a model of the <code class="computeroutput"><span class="identifier">StrictWeakOrderingConcept</span></code>.
-            </li>
+                <code class="computeroutput"><span class="identifier">BinaryPredicate</span></code> is
+                a model of the <code class="computeroutput"><span class="identifier">StrictWeakOrderingConcept</span></code>.
+              </li>
 <li class="listitem">
-<code class="computeroutput"><span class="identifier">SinglePassRange1</span></code>'s
-              value type is convertible to <code class="computeroutput"><span class="identifier">BinaryPredicate</span></code>'s
-              first argument type.
-            </li>
+                <code class="computeroutput"><span class="identifier">SinglePassRange1</span></code>'s
+                value type is convertible to <code class="computeroutput"><span class="identifier">BinaryPredicate</span></code>'s
+                first argument type.
+              </li>
 <li class="listitem">
-<code class="computeroutput"><span class="identifier">SinglePassRange2</span></code>'s
-              value type is convertible to <code class="computeroutput"><span class="identifier">BinaryPredicate</span></code>'s
-              second argument types.
-            </li>
+                <code class="computeroutput"><span class="identifier">SinglePassRange2</span></code>'s
+                value type is convertible to <code class="computeroutput"><span class="identifier">BinaryPredicate</span></code>'s
+                second argument types.
+              </li>
 </ul></div>
 <a name="range.reference.algorithms.set.set_symmetric_difference.precondition_"></a><h6>
-<a name="id2778205"></a>
+<a name="id3353582"></a>
             <a class="link" href="set_symmetric_difference.html#range.reference.algorithms.set.set_symmetric_difference.precondition_">Precondition:</a>
           </h6>
 <p>
@@ -186,7 +186,7 @@
             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="id2778325"></a>
+<a name="id3353703"></a>
             <a class="link" href="set_symmetric_difference.html#range.reference.algorithms.set.set_symmetric_difference.complexity">Complexity</a>
           </h6>
 <p>
@@ -204,7 +204,7 @@
 </tr></table>
 <hr>
 <div class="spirit-nav">
-<a accesskey="p" href="set_difference.html"><img src="../../../../../../../../doc/html/images/prev.png" alt="Prev"></a><a accesskey="u" href="../set.html"><img src="../../../../../../../../doc/html/images/up.png" alt="Up"></a><a accesskey="h" href="../../../../index.html"><img src="../../../../../../../../doc/html/images/home.png" alt="Home"></a><a accesskey="n" href="../heap.html"><img src="../../../../../../../../doc/html/images/next.png" alt="Next"></a>
+<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>
 </body>
 </html>
diff --git a/doc/html/range/reference/algorithms/set/set_union.html b/doc/html/range/reference/algorithms/set/set_union.html
index ccc1783..026159c 100644
--- a/doc/html/range/reference/algorithms/set/set_union.html
+++ b/doc/html/range/reference/algorithms/set/set_union.html
@@ -2,8 +2,8 @@
 <head>
 <meta http-equiv="Content-Type" content="text/html; charset=US-ASCII">
 <title>set_union</title>
-<link rel="stylesheet" href="../../../../../../../../doc/html/boostbook.css" type="text/css">
-<meta name="generator" content="DocBook XSL Stylesheets V1.75.1">
+<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="../set.html" title="Set algorithms">
 <link rel="prev" href="includes.html" title="includes">
@@ -13,21 +13,21 @@
 <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="../../../../../../../libraries.htm">Libraries</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="includes.html"><img src="../../../../../../../../doc/html/images/prev.png" alt="Prev"></a><a accesskey="u" href="../set.html"><img src="../../../../../../../../doc/html/images/up.png" alt="Up"></a><a accesskey="h" href="../../../../index.html"><img src="../../../../../../../../doc/html/images/home.png" alt="Home"></a><a accesskey="n" href="set_intersection.html"><img src="../../../../../../../../doc/html/images/next.png" alt="Next"></a>
+<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" title="set_union">
+<div class="section">
 <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="id2773630"></a>
+<a name="id3348812"></a>
             <a class="link" href="set_union.html#range.reference.algorithms.set.set_union.prototype">Prototype</a>
           </h6>
 <p>
@@ -56,7 +56,7 @@
 <p>
           </p>
 <a name="range.reference.algorithms.set.set_union.description"></a><h6>
-<a name="id2773978"></a>
+<a name="id3349162"></a>
             <a class="link" href="set_union.html#range.reference.algorithms.set.set_union.description">Description</a>
           </h6>
 <p>
@@ -69,14 +69,14 @@
             in the predicate versions.
           </p>
 <a name="range.reference.algorithms.set.set_union.definition"></a><h6>
-<a name="id2774069"></a>
+<a name="id3349252"></a>
             <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="id2774141"></a>
+<a name="id3349324"></a>
             <a class="link" href="set_union.html#range.reference.algorithms.set.set_union.requirements">Requirements</a>
           </h6>
 <p>
@@ -84,85 +84,85 @@
           </p>
 <div class="itemizedlist"><ul class="itemizedlist" type="disc">
 <li class="listitem">
-<code class="computeroutput"><span class="identifier">SinglePassRange1</span></code> is
-              a model of the <a class="link" href="../../../concepts/single_pass_range.html" title="Single Pass Range">Single
-              Pass Range</a> Concept.
-            </li>
+                <code class="computeroutput"><span class="identifier">SinglePassRange1</span></code>
+                is a model of the <a class="link" href="../../../concepts/single_pass_range.html" title="Single Pass Range">Single
+                Pass Range</a> Concept.
+              </li>
 <li class="listitem">
-<code class="computeroutput"><span class="identifier">SinglePassRange2</span></code> is
-              a model of the <a class="link" href="../../../concepts/single_pass_range.html" title="Single Pass Range">Single
-              Pass Range</a> Concept.
-            </li>
+                <code class="computeroutput"><span class="identifier">SinglePassRange2</span></code>
+                is a model of the <a class="link" href="../../../concepts/single_pass_range.html" title="Single Pass Range">Single
+                Pass Range</a> Concept.
+              </li>
 <li class="listitem">
-<code class="computeroutput"><span class="identifier">OutputIterator</span></code> is a
-              model of the <code class="computeroutput"><span class="identifier">OutputIteratorConcept</span></code>.
-            </li>
+                <code class="computeroutput"><span class="identifier">OutputIterator</span></code> is
+                a model of the <code class="computeroutput"><span class="identifier">OutputIteratorConcept</span></code>.
+              </li>
 <li class="listitem">
-<code class="computeroutput"><span class="identifier">SinglePassRange1</span></code> and
-              <code class="computeroutput"><span class="identifier">SinglePassRange2</span></code> have
-              the same value type.
-            </li>
+                <code class="computeroutput"><span class="identifier">SinglePassRange1</span></code>
+                and <code class="computeroutput"><span class="identifier">SinglePassRange2</span></code>
+                have the same value type.
+              </li>
 <li class="listitem">
-<code class="computeroutput"><span class="identifier">SinglePassRange1</span></code>'s
-              value type is a model of the <code class="computeroutput"><span class="identifier">LessThanComparableConcept</span></code>.
-            </li>
+                <code class="computeroutput"><span class="identifier">SinglePassRange1</span></code>'s
+                value type is a model of the <code class="computeroutput"><span class="identifier">LessThanComparableConcept</span></code>.
+              </li>
 <li class="listitem">
-<code class="computeroutput"><span class="identifier">SinglePassRange2</span></code>'s
-              value type is a model of the <code class="computeroutput"><span class="identifier">LessThanComparableConcept</span></code>.
-            </li>
+                <code class="computeroutput"><span class="identifier">SinglePassRange2</span></code>'s
+                value type is a model of the <code class="computeroutput"><span class="identifier">LessThanComparableConcept</span></code>.
+              </li>
 <li class="listitem">
-              The ordering of objects of type <code class="computeroutput"><span class="identifier">SinglePassRange1</span></code>'s
-              value type is a <span class="bold"><strong><span class="emphasis"><em>strict weak ordering</em></span></strong></span>,
-              as defined in the <code class="computeroutput"><span class="identifier">LessThanComparableConcept</span></code>
-              requirements.
-            </li>
+                The ordering of objects of type <code class="computeroutput"><span class="identifier">SinglePassRange1</span></code>'s
+                value type is a <span class="bold"><strong><span class="emphasis"><em>strict weak ordering</em></span></strong></span>,
+                as defined in the <code class="computeroutput"><span class="identifier">LessThanComparableConcept</span></code>
+                requirements.
+              </li>
 <li class="listitem">
-              The ordering of objects of type <code class="computeroutput"><span class="identifier">SinglePassRange2</span></code>'s
-              value type is a <span class="bold"><strong><span class="emphasis"><em>strict weak ordering</em></span></strong></span>,
-              as defined in the <code class="computeroutput"><span class="identifier">LessThanComparableConcept</span></code>
-              requirements.
-            </li>
+                The ordering of objects of type <code class="computeroutput"><span class="identifier">SinglePassRange2</span></code>'s
+                value type is a <span class="bold"><strong><span class="emphasis"><em>strict weak ordering</em></span></strong></span>,
+                as defined in the <code class="computeroutput"><span class="identifier">LessThanComparableConcept</span></code>
+                requirements.
+              </li>
 </ul></div>
 <p>
             <span class="bold"><strong>For the predicate versions:</strong></span>
           </p>
 <div class="itemizedlist"><ul class="itemizedlist" type="disc">
 <li class="listitem">
-<code class="computeroutput"><span class="identifier">SinglePassRange1</span></code> is
-              a model of the <a class="link" href="../../../concepts/single_pass_range.html" title="Single Pass Range">Single
-              Pass Range</a> Concept.
-            </li>
+                <code class="computeroutput"><span class="identifier">SinglePassRange1</span></code>
+                is a model of the <a class="link" href="../../../concepts/single_pass_range.html" title="Single Pass Range">Single
+                Pass Range</a> Concept.
+              </li>
 <li class="listitem">
-<code class="computeroutput"><span class="identifier">SinglePassRange2</span></code> is
-              a model of the <a class="link" href="../../../concepts/single_pass_range.html" title="Single Pass Range">Single
-              Pass Range</a> Concept.
-            </li>
+                <code class="computeroutput"><span class="identifier">SinglePassRange2</span></code>
+                is a model of the <a class="link" href="../../../concepts/single_pass_range.html" title="Single Pass Range">Single
+                Pass Range</a> Concept.
+              </li>
 <li class="listitem">
-<code class="computeroutput"><span class="identifier">OutputIterator</span></code> is a
-              model of the <code class="computeroutput"><span class="identifier">OutputIteratorConcept</span></code>.
-            </li>
+                <code class="computeroutput"><span class="identifier">OutputIterator</span></code> is
+                a model of the <code class="computeroutput"><span class="identifier">OutputIteratorConcept</span></code>.
+              </li>
 <li class="listitem">
-<code class="computeroutput"><span class="identifier">SinglePassRange1</span></code> and
-              <code class="computeroutput"><span class="identifier">SinglePassRange2</span></code> have
-              the same value type.
-            </li>
+                <code class="computeroutput"><span class="identifier">SinglePassRange1</span></code>
+                and <code class="computeroutput"><span class="identifier">SinglePassRange2</span></code>
+                have the same value type.
+              </li>
 <li class="listitem">
-<code class="computeroutput"><span class="identifier">BinaryPredicate</span></code> is
-              a model of the <code class="computeroutput"><span class="identifier">StrictWeakOrderingConcept</span></code>.
-            </li>
+                <code class="computeroutput"><span class="identifier">BinaryPredicate</span></code> is
+                a model of the <code class="computeroutput"><span class="identifier">StrictWeakOrderingConcept</span></code>.
+              </li>
 <li class="listitem">
-<code class="computeroutput"><span class="identifier">SinglePassRange1</span></code>'s
-              value type is convertible to <code class="computeroutput"><span class="identifier">BinaryPredicate</span></code>'s
-              first argument type.
-            </li>
+                <code class="computeroutput"><span class="identifier">SinglePassRange1</span></code>'s
+                value type is convertible to <code class="computeroutput"><span class="identifier">BinaryPredicate</span></code>'s
+                first argument type.
+              </li>
 <li class="listitem">
-<code class="computeroutput"><span class="identifier">SinglePassRange2</span></code>'s
-              value type is convertible to <code class="computeroutput"><span class="identifier">BinaryPredicate</span></code>'s
-              second argument types.
-            </li>
+                <code class="computeroutput"><span class="identifier">SinglePassRange2</span></code>'s
+                value type is convertible to <code class="computeroutput"><span class="identifier">BinaryPredicate</span></code>'s
+                second argument types.
+              </li>
 </ul></div>
 <a name="range.reference.algorithms.set.set_union.precondition_"></a><h6>
-<a name="id2774584"></a>
+<a name="id3349816"></a>
             <a class="link" href="set_union.html#range.reference.algorithms.set.set_union.precondition_">Precondition:</a>
           </h6>
 <p>
@@ -180,7 +180,7 @@
             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="id2774703"></a>
+<a name="id3349934"></a>
             <a class="link" href="set_union.html#range.reference.algorithms.set.set_union.complexity">Complexity</a>
           </h6>
 <p>
@@ -198,7 +198,7 @@
 </tr></table>
 <hr>
 <div class="spirit-nav">
-<a accesskey="p" href="includes.html"><img src="../../../../../../../../doc/html/images/prev.png" alt="Prev"></a><a accesskey="u" href="../set.html"><img src="../../../../../../../../doc/html/images/up.png" alt="Up"></a><a accesskey="h" href="../../../../index.html"><img src="../../../../../../../../doc/html/images/home.png" alt="Home"></a><a accesskey="n" href="set_intersection.html"><img src="../../../../../../../../doc/html/images/next.png" alt="Next"></a>
+<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>
 </body>
 </html>
diff --git a/doc/html/range/reference/concept_implementation.html b/doc/html/range/reference/concept_implementation.html
index 0d150f3..f2c4792 100644
--- a/doc/html/range/reference/concept_implementation.html
+++ b/doc/html/range/reference/concept_implementation.html
@@ -2,8 +2,8 @@
 <head>
 <meta http-equiv="Content-Type" content="text/html; charset=US-ASCII">
 <title>Range concept implementation</title>
-<link rel="stylesheet" href="../../../../../../doc/html/boostbook.css" type="text/css">
-<meta name="generator" content="DocBook XSL Stylesheets V1.75.1">
+<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="../reference.html" title="Reference">
 <link rel="prev" href="overview.html" title="Overview">
@@ -13,16 +13,16 @@
 <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="../../../../../libraries.htm">Libraries</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="overview.html"><img src="../../../../../../doc/html/images/prev.png" alt="Prev"></a><a accesskey="u" href="../reference.html"><img src="../../../../../../doc/html/images/up.png" alt="Up"></a><a accesskey="h" href="../../index.html"><img src="../../../../../../doc/html/images/home.png" alt="Home"></a><a accesskey="n" href="concept_implementation/synopsis.html"><img src="../../../../../../doc/html/images/next.png" alt="Next"></a>
+<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" title="Range concept implementation">
+<div class="section">
 <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>
@@ -42,7 +42,7 @@
 </tr></table>
 <hr>
 <div class="spirit-nav">
-<a accesskey="p" href="overview.html"><img src="../../../../../../doc/html/images/prev.png" alt="Prev"></a><a accesskey="u" href="../reference.html"><img src="../../../../../../doc/html/images/up.png" alt="Up"></a><a accesskey="h" href="../../index.html"><img src="../../../../../../doc/html/images/home.png" alt="Home"></a><a accesskey="n" href="concept_implementation/synopsis.html"><img src="../../../../../../doc/html/images/next.png" alt="Next"></a>
+<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>
 </body>
 </html>
diff --git a/doc/html/range/reference/concept_implementation/semantics.html b/doc/html/range/reference/concept_implementation/semantics.html
index 1493f51..59fc394 100644
--- a/doc/html/range/reference/concept_implementation/semantics.html
+++ b/doc/html/range/reference/concept_implementation/semantics.html
@@ -2,8 +2,8 @@
 <head>
 <meta http-equiv="Content-Type" content="text/html; charset=US-ASCII">
 <title>Semantics</title>
-<link rel="stylesheet" href="../../../../../../../doc/html/boostbook.css" type="text/css">
-<meta name="generator" content="DocBook XSL Stylesheets V1.75.1">
+<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="../concept_implementation.html" title="Range concept implementation">
 <link rel="prev" href="synopsis.html" title="Synopsis">
@@ -13,16 +13,16 @@
 <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="../../../../../../libraries.htm">Libraries</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="synopsis.html"><img src="../../../../../../../doc/html/images/prev.png" alt="Prev"></a><a accesskey="u" href="../concept_implementation.html"><img src="../../../../../../../doc/html/images/up.png" alt="Up"></a><a accesskey="h" href="../../../index.html"><img src="../../../../../../../doc/html/images/home.png" alt="Home"></a><a accesskey="n" href="semantics/metafunctions.html"><img src="../../../../../../../doc/html/images/next.png" alt="Next"></a>
+<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" title="Semantics">
+<div class="section">
 <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>
@@ -31,7 +31,7 @@
 <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="id2697281"></a>
+<a name="id3271198"></a>
           <a class="link" href="semantics.html#range.reference.concept_implementation.semantics.notation">notation</a>
         </h6>
 <div class="informaltable"><table class="table">
@@ -157,7 +157,7 @@
 </tr></table>
 <hr>
 <div class="spirit-nav">
-<a accesskey="p" href="synopsis.html"><img src="../../../../../../../doc/html/images/prev.png" alt="Prev"></a><a accesskey="u" href="../concept_implementation.html"><img src="../../../../../../../doc/html/images/up.png" alt="Up"></a><a accesskey="h" href="../../../index.html"><img src="../../../../../../../doc/html/images/home.png" alt="Home"></a><a accesskey="n" href="semantics/metafunctions.html"><img src="../../../../../../../doc/html/images/next.png" alt="Next"></a>
+<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>
 </body>
 </html>
diff --git a/doc/html/range/reference/concept_implementation/semantics/functions.html b/doc/html/range/reference/concept_implementation/semantics/functions.html
index 0c0ef81..895d32d 100644
--- a/doc/html/range/reference/concept_implementation/semantics/functions.html
+++ b/doc/html/range/reference/concept_implementation/semantics/functions.html
@@ -2,8 +2,8 @@
 <head>
 <meta http-equiv="Content-Type" content="text/html; charset=US-ASCII">
 <title>Functions</title>
-<link rel="stylesheet" href="../../../../../../../../doc/html/boostbook.css" type="text/css">
-<meta name="generator" content="DocBook XSL Stylesheets V1.75.1">
+<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="../semantics.html" title="Semantics">
 <link rel="prev" href="metafunctions.html" title="Metafunctions">
@@ -13,16 +13,16 @@
 <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="../../../../../../../libraries.htm">Libraries</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="metafunctions.html"><img src="../../../../../../../../doc/html/images/prev.png" alt="Prev"></a><a accesskey="u" href="../semantics.html"><img src="../../../../../../../../doc/html/images/up.png" alt="Up"></a><a accesskey="h" href="../../../../index.html"><img src="../../../../../../../../doc/html/images/home.png" alt="Home"></a><a accesskey="n" href="../../adaptors.html"><img src="../../../../../../../../doc/html/images/next.png" alt="Next"></a>
+<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" title="Functions">
+<div class="section">
 <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>
@@ -402,7 +402,7 @@
 </tr></table>
 <hr>
 <div class="spirit-nav">
-<a accesskey="p" href="metafunctions.html"><img src="../../../../../../../../doc/html/images/prev.png" alt="Prev"></a><a accesskey="u" href="../semantics.html"><img src="../../../../../../../../doc/html/images/up.png" alt="Up"></a><a accesskey="h" href="../../../../index.html"><img src="../../../../../../../../doc/html/images/home.png" alt="Home"></a><a accesskey="n" href="../../adaptors.html"><img src="../../../../../../../../doc/html/images/next.png" alt="Next"></a>
+<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>
 </body>
 </html>
diff --git a/doc/html/range/reference/concept_implementation/semantics/metafunctions.html b/doc/html/range/reference/concept_implementation/semantics/metafunctions.html
index 779a3b7..1a03534 100644
--- a/doc/html/range/reference/concept_implementation/semantics/metafunctions.html
+++ b/doc/html/range/reference/concept_implementation/semantics/metafunctions.html
@@ -2,8 +2,8 @@
 <head>
 <meta http-equiv="Content-Type" content="text/html; charset=US-ASCII">
 <title>Metafunctions</title>
-<link rel="stylesheet" href="../../../../../../../../doc/html/boostbook.css" type="text/css">
-<meta name="generator" content="DocBook XSL Stylesheets V1.75.1">
+<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="../semantics.html" title="Semantics">
 <link rel="prev" href="../semantics.html" title="Semantics">
@@ -13,16 +13,16 @@
 <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="../../../../../../../libraries.htm">Libraries</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="../semantics.html"><img src="../../../../../../../../doc/html/images/prev.png" alt="Prev"></a><a accesskey="u" href="../semantics.html"><img src="../../../../../../../../doc/html/images/up.png" alt="Up"></a><a accesskey="h" href="../../../../index.html"><img src="../../../../../../../../doc/html/images/home.png" alt="Home"></a><a accesskey="n" href="functions.html"><img src="../../../../../../../../doc/html/images/next.png" alt="Next"></a>
+<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" title="Metafunctions">
+<div class="section">
 <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>
@@ -230,7 +230,7 @@
 </tr></table>
 <hr>
 <div class="spirit-nav">
-<a accesskey="p" href="../semantics.html"><img src="../../../../../../../../doc/html/images/prev.png" alt="Prev"></a><a accesskey="u" href="../semantics.html"><img src="../../../../../../../../doc/html/images/up.png" alt="Up"></a><a accesskey="h" href="../../../../index.html"><img src="../../../../../../../../doc/html/images/home.png" alt="Home"></a><a accesskey="n" href="functions.html"><img src="../../../../../../../../doc/html/images/next.png" alt="Next"></a>
+<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>
 </body>
 </html>
diff --git a/doc/html/range/reference/concept_implementation/synopsis.html b/doc/html/range/reference/concept_implementation/synopsis.html
index 9dffad1..9fdbc91 100644
--- a/doc/html/range/reference/concept_implementation/synopsis.html
+++ b/doc/html/range/reference/concept_implementation/synopsis.html
@@ -2,8 +2,8 @@
 <head>
 <meta http-equiv="Content-Type" content="text/html; charset=US-ASCII">
 <title>Synopsis</title>
-<link rel="stylesheet" href="../../../../../../../doc/html/boostbook.css" type="text/css">
-<meta name="generator" content="DocBook XSL Stylesheets V1.75.1">
+<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="../concept_implementation.html" title="Range concept implementation">
 <link rel="prev" href="../concept_implementation.html" title="Range concept implementation">
@@ -13,16 +13,16 @@
 <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="../../../../../../libraries.htm">Libraries</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="../concept_implementation.html"><img src="../../../../../../../doc/html/images/prev.png" alt="Prev"></a><a accesskey="u" href="../concept_implementation.html"><img src="../../../../../../../doc/html/images/up.png" alt="Up"></a><a accesskey="h" href="../../../index.html"><img src="../../../../../../../doc/html/images/home.png" alt="Home"></a><a accesskey="n" href="semantics.html"><img src="../../../../../../../doc/html/images/next.png" alt="Next"></a>
+<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" title="Synopsis">
+<div class="section">
 <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>
@@ -179,7 +179,7 @@
 </tr></table>
 <hr>
 <div class="spirit-nav">
-<a accesskey="p" href="../concept_implementation.html"><img src="../../../../../../../doc/html/images/prev.png" alt="Prev"></a><a accesskey="u" href="../concept_implementation.html"><img src="../../../../../../../doc/html/images/up.png" alt="Up"></a><a accesskey="h" href="../../../index.html"><img src="../../../../../../../doc/html/images/home.png" alt="Home"></a><a accesskey="n" href="semantics.html"><img src="../../../../../../../doc/html/images/next.png" alt="Next"></a>
+<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>
 </body>
 </html>
diff --git a/doc/html/range/reference/extending.html b/doc/html/range/reference/extending.html
index a9d7524..8ca7be8 100644
--- a/doc/html/range/reference/extending.html
+++ b/doc/html/range/reference/extending.html
@@ -2,8 +2,8 @@
 <head>
 <meta http-equiv="Content-Type" content="text/html; charset=US-ASCII">
 <title>Extending the library</title>
-<link rel="stylesheet" href="../../../../../../doc/html/boostbook.css" type="text/css">
-<meta name="generator" content="DocBook XSL Stylesheets V1.75.1">
+<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="../reference.html" title="Reference">
 <link rel="prev" href="utilities/join.html" title="Function join">
@@ -13,16 +13,16 @@
 <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="../../../../../libraries.htm">Libraries</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="utilities/join.html"><img src="../../../../../../doc/html/images/prev.png" alt="Prev"></a><a accesskey="u" href="../reference.html"><img src="../../../../../../doc/html/images/up.png" alt="Up"></a><a accesskey="h" href="../../index.html"><img src="../../../../../../doc/html/images/home.png" alt="Home"></a><a accesskey="n" href="extending/method_1.html"><img src="../../../../../../doc/html/images/next.png" alt="Next"></a>
+<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" title="Extending the library">
+<div class="section">
 <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>
@@ -45,7 +45,7 @@
 </tr></table>
 <hr>
 <div class="spirit-nav">
-<a accesskey="p" href="utilities/join.html"><img src="../../../../../../doc/html/images/prev.png" alt="Prev"></a><a accesskey="u" href="../reference.html"><img src="../../../../../../doc/html/images/up.png" alt="Up"></a><a accesskey="h" href="../../index.html"><img src="../../../../../../doc/html/images/home.png" alt="Home"></a><a accesskey="n" href="extending/method_1.html"><img src="../../../../../../doc/html/images/next.png" alt="Next"></a>
+<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>
 </body>
 </html>
diff --git a/doc/html/range/reference/extending/method_1.html b/doc/html/range/reference/extending/method_1.html
index 632687b..910d2de 100644
--- a/doc/html/range/reference/extending/method_1.html
+++ b/doc/html/range/reference/extending/method_1.html
@@ -2,8 +2,8 @@
 <head>
 <meta http-equiv="Content-Type" content="text/html; charset=US-ASCII">
 <title>Method 1: provide member functions and nested types</title>
-<link rel="stylesheet" href="../../../../../../../doc/html/boostbook.css" type="text/css">
-<meta name="generator" content="DocBook XSL Stylesheets V1.75.1">
+<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="../extending.html" title="Extending the library">
 <link rel="prev" href="../extending.html" title="Extending the library">
@@ -13,16 +13,16 @@
 <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="../../../../../../libraries.htm">Libraries</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="../extending.html"><img src="../../../../../../../doc/html/images/prev.png" alt="Prev"></a><a accesskey="u" href="../extending.html"><img src="../../../../../../../doc/html/images/up.png" alt="Up"></a><a accesskey="h" href="../../../index.html"><img src="../../../../../../../doc/html/images/home.png" alt="Home"></a><a accesskey="n" href="method_2.html"><img src="../../../../../../../doc/html/images/next.png" alt="Next"></a>
+<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" title="Method 1: provide member functions and nested types">
+<div class="section">
 <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>
@@ -155,7 +155,7 @@
 </tr></table>
 <hr>
 <div class="spirit-nav">
-<a accesskey="p" href="../extending.html"><img src="../../../../../../../doc/html/images/prev.png" alt="Prev"></a><a accesskey="u" href="../extending.html"><img src="../../../../../../../doc/html/images/up.png" alt="Up"></a><a accesskey="h" href="../../../index.html"><img src="../../../../../../../doc/html/images/home.png" alt="Home"></a><a accesskey="n" href="method_2.html"><img src="../../../../../../../doc/html/images/next.png" alt="Next"></a>
+<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>
 </body>
 </html>
diff --git a/doc/html/range/reference/extending/method_2.html b/doc/html/range/reference/extending/method_2.html
index f4f3524..3828c8b 100644
--- a/doc/html/range/reference/extending/method_2.html
+++ b/doc/html/range/reference/extending/method_2.html
@@ -2,8 +2,8 @@
 <head>
 <meta http-equiv="Content-Type" content="text/html; charset=US-ASCII">
 <title>Method 2: provide free-standing functions and specialize metafunctions</title>
-<link rel="stylesheet" href="../../../../../../../doc/html/boostbook.css" type="text/css">
-<meta name="generator" content="DocBook XSL Stylesheets V1.75.1">
+<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="../extending.html" title="Extending the library">
 <link rel="prev" href="method_1.html" title="Method 1: provide member functions and nested types">
@@ -13,16 +13,16 @@
 <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="../../../../../../libraries.htm">Libraries</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="method_1.html"><img src="../../../../../../../doc/html/images/prev.png" alt="Prev"></a><a accesskey="u" href="../extending.html"><img src="../../../../../../../doc/html/images/up.png" alt="Up"></a><a accesskey="h" href="../../../index.html"><img src="../../../../../../../doc/html/images/home.png" alt="Home"></a><a accesskey="n" href="method_3.html"><img src="../../../../../../../doc/html/images/next.png" alt="Next"></a>
+<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" title="Method 2: provide free-standing functions and specialize metafunctions">
+<div class="section">
 <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>
@@ -261,7 +261,7 @@
 </tr></table>
 <hr>
 <div class="spirit-nav">
-<a accesskey="p" href="method_1.html"><img src="../../../../../../../doc/html/images/prev.png" alt="Prev"></a><a accesskey="u" href="../extending.html"><img src="../../../../../../../doc/html/images/up.png" alt="Up"></a><a accesskey="h" href="../../../index.html"><img src="../../../../../../../doc/html/images/home.png" alt="Home"></a><a accesskey="n" href="method_3.html"><img src="../../../../../../../doc/html/images/next.png" alt="Next"></a>
+<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>
 </body>
 </html>
diff --git a/doc/html/range/reference/extending/method_3.html b/doc/html/range/reference/extending/method_3.html
index f841237..2ec9d4d 100644
--- a/doc/html/range/reference/extending/method_3.html
+++ b/doc/html/range/reference/extending/method_3.html
@@ -2,8 +2,8 @@
 <head>
 <meta http-equiv="Content-Type" content="text/html; charset=US-ASCII">
 <title>Method 3: provide range adaptor implementations</title>
-<link rel="stylesheet" href="../../../../../../../doc/html/boostbook.css" type="text/css">
-<meta name="generator" content="DocBook XSL Stylesheets V1.75.1">
+<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="../extending.html" title="Extending the library">
 <link rel="prev" href="method_2.html" title="Method 2: provide free-standing functions and specialize metafunctions">
@@ -13,16 +13,16 @@
 <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="../../../../../../libraries.htm">Libraries</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="method_2.html"><img src="../../../../../../../doc/html/images/prev.png" alt="Prev"></a><a accesskey="u" href="../extending.html"><img src="../../../../../../../doc/html/images/up.png" alt="Up"></a><a accesskey="h" href="../../../index.html"><img src="../../../../../../../doc/html/images/home.png" alt="Home"></a><a accesskey="n" href="method_3/method_3_1.html"><img src="../../../../../../../doc/html/images/next.png" alt="Next"></a>
+<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" title="Method 3: provide range adaptor implementations">
+<div class="section">
 <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>
@@ -44,7 +44,7 @@
 </tr></table>
 <hr>
 <div class="spirit-nav">
-<a accesskey="p" href="method_2.html"><img src="../../../../../../../doc/html/images/prev.png" alt="Prev"></a><a accesskey="u" href="../extending.html"><img src="../../../../../../../doc/html/images/up.png" alt="Up"></a><a accesskey="h" href="../../../index.html"><img src="../../../../../../../doc/html/images/home.png" alt="Home"></a><a accesskey="n" href="method_3/method_3_1.html"><img src="../../../../../../../doc/html/images/next.png" alt="Next"></a>
+<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>
 </body>
 </html>
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 e995bee..3c038e6 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
@@ -2,8 +2,8 @@
 <head>
 <meta http-equiv="Content-Type" content="text/html; charset=US-ASCII">
 <title>Method 3.1: Implement a Range Adaptor without arguments</title>
-<link rel="stylesheet" href="../../../../../../../../doc/html/boostbook.css" type="text/css">
-<meta name="generator" content="DocBook XSL Stylesheets V1.75.1">
+<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="../method_3.html" title="Method 3: provide range adaptor implementations">
 <link rel="prev" href="../method_3.html" title="Method 3: provide range adaptor implementations">
@@ -13,16 +13,16 @@
 <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="../../../../../../../libraries.htm">Libraries</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="../method_3.html"><img src="../../../../../../../../doc/html/images/prev.png" alt="Prev"></a><a accesskey="u" href="../method_3.html"><img src="../../../../../../../../doc/html/images/up.png" alt="Up"></a><a accesskey="h" href="../../../../index.html"><img src="../../../../../../../../doc/html/images/home.png" alt="Home"></a><a accesskey="n" href="method_3_2.html"><img src="../../../../../../../../doc/html/images/next.png" alt="Next"></a>
+<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" title="Method 3.1: Implement a Range Adaptor without arguments">
+<div class="section">
 <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>
 
@@ -57,17 +57,19 @@
     <span class="special">{</span> <span class="special">}</span>
 <span class="special">};</span>
 </pre>
-</li>
+              </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 
+                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 
 <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>
 </pre>
-</li>
+              </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>
+                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>
 <span class="special">{</span>
@@ -81,7 +83,7 @@
 	<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>
 </ol></div>
 </div>
 <table xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" width="100%"><tr>
@@ -94,7 +96,7 @@
 </tr></table>
 <hr>
 <div class="spirit-nav">
-<a accesskey="p" href="../method_3.html"><img src="../../../../../../../../doc/html/images/prev.png" alt="Prev"></a><a accesskey="u" href="../method_3.html"><img src="../../../../../../../../doc/html/images/up.png" alt="Up"></a><a accesskey="h" href="../../../../index.html"><img src="../../../../../../../../doc/html/images/home.png" alt="Home"></a><a accesskey="n" href="method_3_2.html"><img src="../../../../../../../../doc/html/images/next.png" alt="Next"></a>
+<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>
 </body>
 </html>
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 2a0be9d..1f2102d 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
@@ -2,8 +2,8 @@
 <head>
 <meta http-equiv="Content-Type" content="text/html; charset=US-ASCII">
 <title>Method 3.2: Implement a Range Adaptor with arguments</title>
-<link rel="stylesheet" href="../../../../../../../../doc/html/boostbook.css" type="text/css">
-<meta name="generator" content="DocBook XSL Stylesheets V1.75.1">
+<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="../method_3.html" title="Method 3: provide range adaptor implementations">
 <link rel="prev" href="method_3_1.html" title="Method 3.1: Implement a Range Adaptor without arguments">
@@ -13,23 +13,23 @@
 <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="../../../../../../../libraries.htm">Libraries</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="method_3_1.html"><img src="../../../../../../../../doc/html/images/prev.png" alt="Prev"></a><a accesskey="u" href="../method_3.html"><img src="../../../../../../../../doc/html/images/up.png" alt="Up"></a><a accesskey="h" href="../../../../index.html"><img src="../../../../../../../../doc/html/images/home.png" alt="Home"></a><a accesskey="n" href="../../../style_guide.html"><img src="../../../../../../../../doc/html/images/next.png" alt="Next"></a>
+<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" title="Method 3.2: Implement a Range Adaptor with arguments">
+<div class="section">
 <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>
@@ -77,11 +77,11 @@
      <span class="special">}</span>
  <span class="special">};</span>
 </pre>
-</li>
+              </li>
 <li class="listitem">
-              Implement a holder class to hold the arguments required to construct
-              the RangeAdaptor.
-            </li>
+                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
@@ -104,8 +104,8 @@
 <p>
           </p>
 <div class="orderedlist"><ol class="orderedlist" type="1"><li class="listitem">
-              Define an instance of the holder with the name of the adaptor
-            </li></ol></div>
+                Define an instance of the holder with the name of the adaptor
+              </li></ol></div>
 <p>
             
 </p>
@@ -115,8 +115,8 @@
 <p>
           </p>
 <div class="orderedlist"><ol class="orderedlist" type="1"><li class="listitem">
-              Define <code class="computeroutput"><span class="keyword">operator</span><span class="special">|</span></code>
-</li></ol></div>
+                Define <code class="computeroutput"><span class="keyword">operator</span><span class="special">|</span></code>
+              </li></ol></div>
 <p>
             
 </p>
@@ -149,7 +149,7 @@
 </tr></table>
 <hr>
 <div class="spirit-nav">
-<a accesskey="p" href="method_3_1.html"><img src="../../../../../../../../doc/html/images/prev.png" alt="Prev"></a><a accesskey="u" href="../method_3.html"><img src="../../../../../../../../doc/html/images/up.png" alt="Up"></a><a accesskey="h" href="../../../../index.html"><img src="../../../../../../../../doc/html/images/home.png" alt="Home"></a><a accesskey="n" href="../../../style_guide.html"><img src="../../../../../../../../doc/html/images/next.png" alt="Next"></a>
+<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>
 </body>
 </html>
diff --git a/doc/html/range/reference/overview.html b/doc/html/range/reference/overview.html
new file mode 100644
index 0000000..0005ece
--- /dev/null
+++ b/doc/html/range/reference/overview.html
@@ -0,0 +1,70 @@
+<html>
+<head>
+<meta http-equiv="Content-Type" content="text/html; charset=US-ASCII">
+<title>Overview</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="../reference.html" title="Reference">
+<link rel="prev" href="../reference.html" title="Reference">
+<link rel="next" href="concept_implementation.html" title="Range concept implementation">
+</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="../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="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>
+<p>
+        Three types of objects are currently supported by the library:
+      </p>
+<div class="itemizedlist"><ul class="itemizedlist" type="disc">
+<li class="listitem">
+            standard-like containers
+          </li>
+<li class="listitem">
+            <code class="computeroutput"><span class="identifier">std</span><span class="special">::</span><span class="identifier">pair</span><span class="special">&lt;</span><span class="identifier">iterator</span><span class="special">,</span><span class="identifier">iterator</span><span class="special">&gt;</span></code>
+          </li>
+<li class="listitem">
+            built-in arrays
+          </li>
+</ul></div>
+<p>
+        Even though the behavior of the primary templates are exactly such that standard
+        containers will be supported by default, the requirements are much lower
+        than the standard container requirements. For example, the utility class
+        <a class="link" href="utilities/iterator_range.html" title="Class iterator_range"><code class="computeroutput"><span class="identifier">iterator_range</span></code></a>
+        implements the <a class="link" href="extending.html" title="Extending the library">minimal interface</a>
+        required to make the class a <a class="link" href="../concepts/forward_range.html" title="Forward Range">Forward
+        Range</a>.
+      </p>
+<p>
+        Please also see <a class="link" href="../concepts.html" title="Range Concepts">Range concepts</a> for
+        more details.
+      </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>
+        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="../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>
+</body>
+</html>
diff --git a/doc/html/range/reference/ranges.html b/doc/html/range/reference/ranges.html
index d1d6017..6f8c5af 100644
--- a/doc/html/range/reference/ranges.html
+++ b/doc/html/range/reference/ranges.html
@@ -2,8 +2,8 @@
 <head>
 <meta http-equiv="Content-Type" content="text/html; charset=US-ASCII">
 <title>Provided Ranges</title>
-<link rel="stylesheet" href="../../../../../../doc/html/boostbook.css" type="text/css">
-<meta name="generator" content="DocBook XSL Stylesheets V1.75.1">
+<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="../reference.html" title="Reference">
 <link rel="prev" href="algorithms/numeric/partial_sum.html" title="partial_sum">
@@ -13,16 +13,16 @@
 <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="../../../../../libraries.htm">Libraries</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="algorithms/numeric/partial_sum.html"><img src="../../../../../../doc/html/images/prev.png" alt="Prev"></a><a accesskey="u" href="../reference.html"><img src="../../../../../../doc/html/images/up.png" alt="Up"></a><a accesskey="h" href="../../index.html"><img src="../../../../../../doc/html/images/home.png" alt="Home"></a><a accesskey="n" href="ranges/counting_range.html"><img src="../../../../../../doc/html/images/next.png" alt="Next"></a>
+<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/counting_range.html"><img src="../../../../../../doc/src/images/next.png" alt="Next"></a>
 </div>
-<div class="section" title="Provided Ranges">
+<div class="section">
 <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>
@@ -42,7 +42,7 @@
 </tr></table>
 <hr>
 <div class="spirit-nav">
-<a accesskey="p" href="algorithms/numeric/partial_sum.html"><img src="../../../../../../doc/html/images/prev.png" alt="Prev"></a><a accesskey="u" href="../reference.html"><img src="../../../../../../doc/html/images/up.png" alt="Up"></a><a accesskey="h" href="../../index.html"><img src="../../../../../../doc/html/images/home.png" alt="Home"></a><a accesskey="n" href="ranges/counting_range.html"><img src="../../../../../../doc/html/images/next.png" alt="Next"></a>
+<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/counting_range.html"><img src="../../../../../../doc/src/images/next.png" alt="Next"></a>
 </div>
 </body>
 </html>
diff --git a/doc/html/range/reference/ranges/counting_range.html b/doc/html/range/reference/ranges/counting_range.html
index 566a7f2..b1d7294 100644
--- a/doc/html/range/reference/ranges/counting_range.html
+++ b/doc/html/range/reference/ranges/counting_range.html
@@ -2,8 +2,8 @@
 <head>
 <meta http-equiv="Content-Type" content="text/html; charset=US-ASCII">
 <title>counting_range</title>
-<link rel="stylesheet" href="../../../../../../../doc/html/boostbook.css" type="text/css">
-<meta name="generator" content="DocBook XSL Stylesheets V1.75.1">
+<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="../ranges.html" title="Provided Ranges">
 <link rel="prev" href="../ranges.html" title="Provided Ranges">
@@ -13,21 +13,21 @@
 <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="../../../../../../libraries.htm">Libraries</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="../ranges.html"><img src="../../../../../../../doc/html/images/prev.png" alt="Prev"></a><a accesskey="u" href="../ranges.html"><img src="../../../../../../../doc/html/images/up.png" alt="Up"></a><a accesskey="h" href="../../../index.html"><img src="../../../../../../../doc/html/images/home.png" alt="Home"></a><a accesskey="n" href="istream_range.html"><img src="../../../../../../../doc/html/images/next.png" alt="Next"></a>
+<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="istream_range.html"><img src="../../../../../../../doc/src/images/next.png" alt="Next"></a>
 </div>
-<div class="section" title="counting_range">
+<div class="section">
 <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="id2794262"></a>
+<a name="id3370060"></a>
           <a class="link" href="counting_range.html#range.reference.ranges.counting_range.prototype">Prototype</a>
         </h6>
 <p>
@@ -48,7 +48,7 @@
 <p>
         </p>
 <a name="range.reference.ranges.counting_range.description"></a><h6>
-<a name="id2794647"></a>
+<a name="id3370446"></a>
           <a class="link" href="counting_range.html#range.reference.ranges.counting_range.description">Description</a>
         </h6>
 <p>
@@ -58,21 +58,21 @@
           (from Boost.Iterator).
         </p>
 <a name="range.reference.ranges.counting_range.definition"></a><h6>
-<a name="id2794705"></a>
+<a name="id3370504"></a>
           <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="id2794769"></a>
+<a name="id3370568"></a>
           <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 model
-            of the <code class="computeroutput"><span class="identifier">Incrementable</span></code>
-            Concept.
-          </li></ol></div>
+              <code class="computeroutput"><span class="identifier">Incrementable</span></code> is a
+              model of the <code class="computeroutput"><span class="identifier">Incrementable</span></code>
+              Concept.
+            </li></ol></div>
 </div>
 <table xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" width="100%"><tr>
 <td align="left"></td>
@@ -84,7 +84,7 @@
 </tr></table>
 <hr>
 <div class="spirit-nav">
-<a accesskey="p" href="../ranges.html"><img src="../../../../../../../doc/html/images/prev.png" alt="Prev"></a><a accesskey="u" href="../ranges.html"><img src="../../../../../../../doc/html/images/up.png" alt="Up"></a><a accesskey="h" href="../../../index.html"><img src="../../../../../../../doc/html/images/home.png" alt="Home"></a><a accesskey="n" href="istream_range.html"><img src="../../../../../../../doc/html/images/next.png" alt="Next"></a>
+<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="istream_range.html"><img src="../../../../../../../doc/src/images/next.png" alt="Next"></a>
 </div>
 </body>
 </html>
diff --git a/doc/html/range/reference/ranges/irange.html b/doc/html/range/reference/ranges/irange.html
index 358791b..da9b33a 100644
--- a/doc/html/range/reference/ranges/irange.html
+++ b/doc/html/range/reference/ranges/irange.html
@@ -2,8 +2,8 @@
 <head>
 <meta http-equiv="Content-Type" content="text/html; charset=US-ASCII">
 <title>irange</title>
-<link rel="stylesheet" href="../../../../../../../doc/html/boostbook.css" type="text/css">
-<meta name="generator" content="DocBook XSL Stylesheets V1.75.1">
+<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="../ranges.html" title="Provided Ranges">
 <link rel="prev" href="istream_range.html" title="istream_range">
@@ -13,21 +13,21 @@
 <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="../../../../../../libraries.htm">Libraries</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="istream_range.html"><img src="../../../../../../../doc/html/images/prev.png" alt="Prev"></a><a accesskey="u" href="../ranges.html"><img src="../../../../../../../doc/html/images/up.png" alt="Up"></a><a accesskey="h" href="../../../index.html"><img src="../../../../../../../doc/html/images/home.png" alt="Home"></a><a accesskey="n" href="../utilities.html"><img src="../../../../../../../doc/html/images/next.png" alt="Next"></a>
+<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" title="irange">
+<div class="section">
 <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="id2795210"></a>
+<a name="id3371012"></a>
           <a class="link" href="irange.html#range.reference.ranges.irange.prototype">Prototype</a>
         </h6>
 <p>
@@ -44,7 +44,7 @@
 <p>
         </p>
 <a name="range.reference.ranges.irange.description"></a><h6>
-<a name="id2795506"></a>
+<a name="id3371308"></a>
           <a class="link" href="irange.html#range.reference.ranges.irange.description">Description</a>
         </h6>
 <p>
@@ -58,28 +58,29 @@
           parameters denoted a half-open range.
         </p>
 <a name="range.reference.ranges.irange.definition"></a><h6>
-<a name="id2795587"></a>
+<a name="id3371389"></a>
           <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="id2795650"></a>
+<a name="id3371452"></a>
           <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">
-<code class="computeroutput"><span class="identifier">Integer</span></code> is a model of
-            the <code class="computeroutput"><span class="identifier">Integer</span></code> Concept.
-          </li>
+              <code class="computeroutput"><span class="identifier">Integer</span></code> is a model
+              of the <code class="computeroutput"><span class="identifier">Integer</span></code> Concept.
+            </li>
 <li class="listitem">
-<code class="computeroutput"><span class="identifier">StepSize</span></code> is a model of
-            the <code class="computeroutput"><span class="identifier">SignedInteger</span></code> Concept.
-          </li>
+              <code class="computeroutput"><span class="identifier">StepSize</span></code> is a model
+              of the <code class="computeroutput"><span class="identifier">SignedInteger</span></code>
+              Concept.
+            </li>
 </ol></div>
 <a name="range.reference.ranges.irange.complexity"></a><h6>
-<a name="id2795730"></a>
+<a name="id3371539"></a>
           <a class="link" href="irange.html#range.reference.ranges.irange.complexity">Complexity</a>
         </h6>
 <p>
@@ -97,7 +98,7 @@
 </tr></table>
 <hr>
 <div class="spirit-nav">
-<a accesskey="p" href="istream_range.html"><img src="../../../../../../../doc/html/images/prev.png" alt="Prev"></a><a accesskey="u" href="../ranges.html"><img src="../../../../../../../doc/html/images/up.png" alt="Up"></a><a accesskey="h" href="../../../index.html"><img src="../../../../../../../doc/html/images/home.png" alt="Home"></a><a accesskey="n" href="../utilities.html"><img src="../../../../../../../doc/html/images/next.png" alt="Next"></a>
+<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>
 </body>
 </html>
diff --git a/doc/html/range/reference/ranges/istream_range.html b/doc/html/range/reference/ranges/istream_range.html
index eda91a4..52bb89c 100644
--- a/doc/html/range/reference/ranges/istream_range.html
+++ b/doc/html/range/reference/ranges/istream_range.html
@@ -2,8 +2,8 @@
 <head>
 <meta http-equiv="Content-Type" content="text/html; charset=US-ASCII">
 <title>istream_range</title>
-<link rel="stylesheet" href="../../../../../../../doc/html/boostbook.css" type="text/css">
-<meta name="generator" content="DocBook XSL Stylesheets V1.75.1">
+<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="../ranges.html" title="Provided Ranges">
 <link rel="prev" href="counting_range.html" title="counting_range">
@@ -13,21 +13,21 @@
 <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="../../../../../../libraries.htm">Libraries</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="counting_range.html"><img src="../../../../../../../doc/html/images/prev.png" alt="Prev"></a><a accesskey="u" href="../ranges.html"><img src="../../../../../../../doc/html/images/up.png" alt="Up"></a><a accesskey="h" href="../../../index.html"><img src="../../../../../../../doc/html/images/home.png" alt="Home"></a><a accesskey="n" href="irange.html"><img src="../../../../../../../doc/html/images/next.png" alt="Next"></a>
+<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" title="istream_range">
+<div class="section">
 <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="id2794843"></a>
+<a name="id3370645"></a>
           <a class="link" href="istream_range.html#range.reference.ranges.istream_range.prototype">Prototype</a>
         </h6>
 <p>
@@ -40,7 +40,7 @@
 <p>
         </p>
 <a name="range.reference.ranges.istream_range.description"></a><h6>
-<a name="id2795062"></a>
+<a name="id3370864"></a>
           <a class="link" href="istream_range.html#range.reference.ranges.istream_range.description">Description</a>
         </h6>
 <p>
@@ -49,7 +49,7 @@
           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="id2795130"></a>
+<a name="id3370932"></a>
           <a class="link" href="istream_range.html#range.reference.ranges.istream_range.definition">Definition</a>
         </h6>
 <p>
@@ -66,7 +66,7 @@
 </tr></table>
 <hr>
 <div class="spirit-nav">
-<a accesskey="p" href="counting_range.html"><img src="../../../../../../../doc/html/images/prev.png" alt="Prev"></a><a accesskey="u" href="../ranges.html"><img src="../../../../../../../doc/html/images/up.png" alt="Up"></a><a accesskey="h" href="../../../index.html"><img src="../../../../../../../doc/html/images/home.png" alt="Home"></a><a accesskey="n" href="irange.html"><img src="../../../../../../../doc/html/images/next.png" alt="Next"></a>
+<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>
 </body>
 </html>
diff --git a/doc/html/range/reference/utilities.html b/doc/html/range/reference/utilities.html
index f2f39b2..45e60d3 100644
--- a/doc/html/range/reference/utilities.html
+++ b/doc/html/range/reference/utilities.html
@@ -2,8 +2,8 @@
 <head>
 <meta http-equiv="Content-Type" content="text/html; charset=US-ASCII">
 <title>Utilities</title>
-<link rel="stylesheet" href="../../../../../../doc/html/boostbook.css" type="text/css">
-<meta name="generator" content="DocBook XSL Stylesheets V1.75.1">
+<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="../reference.html" title="Reference">
 <link rel="prev" href="ranges/irange.html" title="irange">
@@ -13,16 +13,16 @@
 <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="../../../../../libraries.htm">Libraries</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="ranges/irange.html"><img src="../../../../../../doc/html/images/prev.png" alt="Prev"></a><a accesskey="u" href="../reference.html"><img src="../../../../../../doc/html/images/up.png" alt="Up"></a><a accesskey="h" href="../../index.html"><img src="../../../../../../doc/html/images/home.png" alt="Home"></a><a accesskey="n" href="utilities/iterator_range.html"><img src="../../../../../../doc/html/images/next.png" alt="Next"></a>
+<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" title="Utilities">
+<div class="section">
 <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>
@@ -41,14 +41,14 @@
       </p>
 <div class="itemizedlist"><ul class="itemizedlist" type="disc">
 <li class="listitem">
-          Class <code class="computeroutput"><span class="identifier">iterator_range</span></code>
-</li>
+            Class <code class="computeroutput"><span class="identifier">iterator_range</span></code>
+          </li>
 <li class="listitem">
-          Class <code class="computeroutput"><span class="identifier">sub_range</span></code>
-</li>
+            Class <code class="computeroutput"><span class="identifier">sub_range</span></code>
+          </li>
 <li class="listitem">
-          Function <code class="computeroutput"><span class="identifier">join</span></code>
-</li>
+            Function <code class="computeroutput"><span class="identifier">join</span></code>
+          </li>
 </ul></div>
 <p>
         The <code class="computeroutput"><span class="identifier">iterator_range</span></code> class
@@ -77,7 +77,7 @@
 </tr></table>
 <hr>
 <div class="spirit-nav">
-<a accesskey="p" href="ranges/irange.html"><img src="../../../../../../doc/html/images/prev.png" alt="Prev"></a><a accesskey="u" href="../reference.html"><img src="../../../../../../doc/html/images/up.png" alt="Up"></a><a accesskey="h" href="../../index.html"><img src="../../../../../../doc/html/images/home.png" alt="Home"></a><a accesskey="n" href="utilities/iterator_range.html"><img src="../../../../../../doc/html/images/next.png" alt="Next"></a>
+<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>
 </body>
 </html>
diff --git a/doc/html/range/reference/utilities/iterator_range.html b/doc/html/range/reference/utilities/iterator_range.html
index a0fc0c0..27df4a0 100644
--- a/doc/html/range/reference/utilities/iterator_range.html
+++ b/doc/html/range/reference/utilities/iterator_range.html
@@ -2,8 +2,8 @@
 <head>
 <meta http-equiv="Content-Type" content="text/html; charset=US-ASCII">
 <title>Class iterator_range</title>
-<link rel="stylesheet" href="../../../../../../../doc/html/boostbook.css" type="text/css">
-<meta name="generator" content="DocBook XSL Stylesheets V1.75.1">
+<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="../utilities.html" title="Utilities">
 <link rel="prev" href="../utilities.html" title="Utilities">
@@ -13,16 +13,16 @@
 <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="../../../../../../libraries.htm">Libraries</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="../utilities.html"><img src="../../../../../../../doc/html/images/prev.png" alt="Prev"></a><a accesskey="u" href="../utilities.html"><img src="../../../../../../../doc/html/images/up.png" alt="Up"></a><a accesskey="h" href="../../../index.html"><img src="../../../../../../../doc/html/images/home.png" alt="Home"></a><a accesskey="n" href="sub_range.html"><img src="../../../../../../../doc/html/images/next.png" alt="Next"></a>
+<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" title="Class iterator_range">
+<div class="section">
 <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>
@@ -48,7 +48,7 @@
           type.
         </p>
 <a name="range.reference.utilities.iterator_range.synopsis"></a><h5>
-<a name="id2796113"></a>
+<a name="id3371932"></a>
           <a class="link" href="iterator_range.html#range.reference.utilities.iterator_range.synopsis">Synopsis</a>
         </h5>
 <p>
@@ -188,39 +188,26 @@
           iterators from the same container.
         </p>
 <a name="range.reference.utilities.iterator_range.details_member_functions"></a><h5>
-<a name="id2799346"></a>
+<a name="id3375164"></a>
           <a class="link" href="iterator_range.html#range.reference.utilities.iterator_range.details_member_functions">Details
           member functions</a>
         </h5>
 <p>
           <code class="computeroutput"><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></code>
         </p>
-<div class="blockquote"><blockquote class="blockquote">
-<p>
-            </p>
-<p>
-              <span class="emphasis"><em><span class="bold"><strong>Returns</strong></span></em></span> <code class="computeroutput"><span class="special">!</span><span class="identifier">empty</span><span class="special">();</span></code>
-            </p>
-<p>
-          </p>
-</blockquote></div>
+<div class="blockquote"><blockquote class="blockquote"><p>
+            <span class="emphasis"><em><span class="bold"><strong>Returns</strong></span></em></span> <code class="computeroutput"><span class="special">!</span><span class="identifier">empty</span><span class="special">();</span></code>
+          </p></blockquote></div>
 <p>
           <code class="computeroutput"><span class="keyword">bool</span> <span class="identifier">equal</span><span class="special">(</span> <span class="identifier">iterator_range</span><span class="special">&amp;</span> <span class="identifier">r</span> <span class="special">)</span> <span class="keyword">const</span><span class="special">;</span></code>
         </p>
-<div class="blockquote"><blockquote class="blockquote">
-<p>
-            </p>
-<p>
-              <span class="emphasis"><em><span class="bold"><strong>Returns</strong></span></em></span> <code class="computeroutput"><span class="identifier">begin</span><span class="special">()</span>
-              <span class="special">==</span> <span class="identifier">r</span><span class="special">.</span><span class="identifier">begin</span><span class="special">()</span> <span class="special">&amp;&amp;</span>
-              <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>
-<p>
-          </p>
-</blockquote></div>
+<div class="blockquote"><blockquote class="blockquote"><p>
+            <span class="emphasis"><em><span class="bold"><strong>Returns</strong></span></em></span> <code class="computeroutput"><span class="identifier">begin</span><span class="special">()</span> <span class="special">==</span> <span class="identifier">r</span><span class="special">.</span><span class="identifier">begin</span><span class="special">()</span> <span class="special">&amp;&amp;</span>
+            <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="id2799590"></a>
+<a name="id3375402"></a>
           <a class="link" href="iterator_range.html#range.reference.utilities.iterator_range.details_functions">Details
           functions</a>
         </h5>
@@ -229,45 +216,27 @@
           <span class="identifier">l</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></code>
         </p>
-<div class="blockquote"><blockquote class="blockquote">
-<p>
-            </p>
-<p>
-              <span class="emphasis"><em><span class="bold"><strong>Returns</strong></span></em></span> <code class="computeroutput"><span class="identifier">size</span><span class="special">(</span><span class="identifier">l</span><span class="special">)</span> <span class="special">!=</span> <span class="identifier">size</span><span class="special">(</span><span class="identifier">r</span><span class="special">)</span> <span class="special">?</span> <span class="keyword">false</span> <span class="special">:</span> <span class="identifier">std</span><span class="special">::</span><span class="identifier">equal</span><span class="special">(</span>
-              <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="special">);</span></code>
-            </p>
-<p>
-          </p>
-</blockquote></div>
+<div class="blockquote"><blockquote class="blockquote"><p>
+            <span class="emphasis"><em><span class="bold"><strong>Returns</strong></span></em></span> <code class="computeroutput"><span class="identifier">size</span><span class="special">(</span><span class="identifier">l</span><span class="special">)</span> <span class="special">!=</span> <span class="identifier">size</span><span class="special">(</span><span class="identifier">r</span><span class="special">)</span> <span class="special">?</span> <span class="keyword">false</span>
+            <span class="special">:</span> <span class="identifier">std</span><span class="special">::</span><span class="identifier">equal</span><span class="special">(</span> <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="special">);</span></code>
+          </p></blockquote></div>
 <p>
           <code class="computeroutput"><span class="keyword">bool</span> <span class="keyword">operator</span><span class="special">!=(</span> <span class="keyword">const</span> <span class="identifier">ForwardRange1</span><span class="special">&amp;</span>
           <span class="identifier">l</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></code>
         </p>
-<div class="blockquote"><blockquote class="blockquote">
-<p>
-            </p>
-<p>
-              <span class="emphasis"><em><span class="bold"><strong>Returns</strong></span></em></span> <code class="computeroutput"><span class="special">!(</span> <span class="identifier">l</span> <span class="special">==</span> <span class="identifier">r</span> <span class="special">);</span></code>
-            </p>
-<p>
-          </p>
-</blockquote></div>
+<div class="blockquote"><blockquote class="blockquote"><p>
+            <span class="emphasis"><em><span class="bold"><strong>Returns</strong></span></em></span> <code class="computeroutput"><span class="special">!(</span> <span class="identifier">l</span> <span class="special">==</span> <span class="identifier">r</span> <span class="special">);</span></code>
+          </p></blockquote></div>
 <p>
           <code class="computeroutput"><span class="keyword">bool</span> <span class="keyword">operator</span><span class="special">&lt;(</span> <span class="keyword">const</span> <span class="identifier">ForwardRange1</span><span class="special">&amp;</span>
           <span class="identifier">l</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></code>
         </p>
-<div class="blockquote"><blockquote class="blockquote">
-<p>
-            </p>
-<p>
-              <span class="emphasis"><em><span class="bold"><strong>Returns</strong></span></em></span> <code class="computeroutput"><span class="identifier">std</span><span class="special">::</span><span class="identifier">lexicographical_compare</span><span class="special">(</span>
-              <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>
-<p>
-          </p>
-</blockquote></div>
+<div class="blockquote"><blockquote class="blockquote"><p>
+            <span class="emphasis"><em><span class="bold"><strong>Returns</strong></span></em></span> <code class="computeroutput"><span class="identifier">std</span><span class="special">::</span><span class="identifier">lexicographical_compare</span><span class="special">(</span>
+            <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>
@@ -277,15 +246,9 @@
 </pre>
 <p>
         </p>
-<div class="blockquote"><blockquote class="blockquote">
-<p>
-            </p>
-<p>
-              <span class="emphasis"><em><span class="bold"><strong>Effects:</strong></span></em></span>
-            </p>
-<p>
-          </p>
-</blockquote></div>
+<div class="blockquote"><blockquote class="blockquote"><p>
+            <span class="emphasis"><em><span class="bold"><strong>Effects:</strong></span></em></span>
+          </p></blockquote></div>
 <p>
           
 </p>
@@ -301,16 +264,10 @@
           <code class="computeroutput"><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></code>
         </p>
-<div class="blockquote"><blockquote class="blockquote">
-<p>
-            </p>
-<p>
-              <span class="emphasis"><em><span class="bold"><strong>Returns</strong></span></em></span> <code class="computeroutput"><span class="identifier">Sequence</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>
-<p>
-          </p>
-</blockquote></div>
+<div class="blockquote"><blockquote class="blockquote"><p>
+            <span class="emphasis"><em><span class="bold"><strong>Returns</strong></span></em></span> <code class="computeroutput"><span class="identifier">Sequence</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>
 </div>
 <table xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" width="100%"><tr>
 <td align="left"></td>
@@ -322,7 +279,7 @@
 </tr></table>
 <hr>
 <div class="spirit-nav">
-<a accesskey="p" href="../utilities.html"><img src="../../../../../../../doc/html/images/prev.png" alt="Prev"></a><a accesskey="u" href="../utilities.html"><img src="../../../../../../../doc/html/images/up.png" alt="Up"></a><a accesskey="h" href="../../../index.html"><img src="../../../../../../../doc/html/images/home.png" alt="Home"></a><a accesskey="n" href="sub_range.html"><img src="../../../../../../../doc/html/images/next.png" alt="Next"></a>
+<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>
 </body>
 </html>
diff --git a/doc/html/range/reference/utilities/join.html b/doc/html/range/reference/utilities/join.html
index 349f282..458ed2e 100644
--- a/doc/html/range/reference/utilities/join.html
+++ b/doc/html/range/reference/utilities/join.html
@@ -2,8 +2,8 @@
 <head>
 <meta http-equiv="Content-Type" content="text/html; charset=US-ASCII">
 <title>Function join</title>
-<link rel="stylesheet" href="../../../../../../../doc/html/boostbook.css" type="text/css">
-<meta name="generator" content="DocBook XSL Stylesheets V1.75.1">
+<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="../utilities.html" title="Utilities">
 <link rel="prev" href="sub_range.html" title="Class sub_range">
@@ -13,16 +13,16 @@
 <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="../../../../../../libraries.htm">Libraries</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="sub_range.html"><img src="../../../../../../../doc/html/images/prev.png" alt="Prev"></a><a accesskey="u" href="../utilities.html"><img src="../../../../../../../doc/html/images/up.png" alt="Up"></a><a accesskey="h" href="../../../index.html"><img src="../../../../../../../doc/html/images/home.png" alt="Home"></a><a accesskey="n" href="../extending.html"><img src="../../../../../../../doc/html/images/next.png" alt="Next"></a>
+<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" title="Function join">
+<div class="section">
 <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>
@@ -39,7 +39,7 @@
           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="id2802030"></a>
+<a name="id3377826"></a>
           <a class="link" href="join.html#range.reference.utilities.join.synposis">Synposis</a>
         </h5>
 <p>
@@ -65,7 +65,7 @@
 <p>
         </p>
 <a name="range.reference.utilities.join.example"></a><h5>
-<a name="id2802577"></a>
+<a name="id3378374"></a>
           <a class="link" href="join.html#range.reference.utilities.join.example">Example</a>
         </h5>
 <p>
@@ -83,7 +83,7 @@
 </tr></table>
 <hr>
 <div class="spirit-nav">
-<a accesskey="p" href="sub_range.html"><img src="../../../../../../../doc/html/images/prev.png" alt="Prev"></a><a accesskey="u" href="../utilities.html"><img src="../../../../../../../doc/html/images/up.png" alt="Up"></a><a accesskey="h" href="../../../index.html"><img src="../../../../../../../doc/html/images/home.png" alt="Home"></a><a accesskey="n" href="../extending.html"><img src="../../../../../../../doc/html/images/next.png" alt="Next"></a>
+<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>
 </body>
 </html>
diff --git a/doc/html/range/reference/utilities/sub_range.html b/doc/html/range/reference/utilities/sub_range.html
index 8c75a91..684c838 100644
--- a/doc/html/range/reference/utilities/sub_range.html
+++ b/doc/html/range/reference/utilities/sub_range.html
@@ -2,8 +2,8 @@
 <head>
 <meta http-equiv="Content-Type" content="text/html; charset=US-ASCII">
 <title>Class sub_range</title>
-<link rel="stylesheet" href="../../../../../../../doc/html/boostbook.css" type="text/css">
-<meta name="generator" content="DocBook XSL Stylesheets V1.75.1">
+<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="../utilities.html" title="Utilities">
 <link rel="prev" href="iterator_range.html" title="Class iterator_range">
@@ -13,16 +13,16 @@
 <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="../../../../../../libraries.htm">Libraries</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="iterator_range.html"><img src="../../../../../../../doc/html/images/prev.png" alt="Prev"></a><a accesskey="u" href="../utilities.html"><img src="../../../../../../../doc/html/images/up.png" alt="Up"></a><a accesskey="h" href="../../../index.html"><img src="../../../../../../../doc/html/images/home.png" alt="Home"></a><a accesskey="n" href="join.html"><img src="../../../../../../../doc/html/images/next.png" alt="Next"></a>
+<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" title="Class sub_range">
+<div class="section">
 <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>
@@ -35,7 +35,7 @@
           is.
         </p>
 <a name="range.reference.utilities.sub_range.synopsis"></a><h5>
-<a name="id2800752"></a>
+<a name="id3376547"></a>
           <a class="link" href="sub_range.html#range.reference.utilities.sub_range.synopsis">Synopsis</a>
         </h5>
 <p>
@@ -117,7 +117,7 @@
 </tr></table>
 <hr>
 <div class="spirit-nav">
-<a accesskey="p" href="iterator_range.html"><img src="../../../../../../../doc/html/images/prev.png" alt="Prev"></a><a accesskey="u" href="../utilities.html"><img src="../../../../../../../doc/html/images/up.png" alt="Up"></a><a accesskey="h" href="../../../index.html"><img src="../../../../../../../doc/html/images/home.png" alt="Home"></a><a accesskey="n" href="join.html"><img src="../../../../../../../doc/html/images/next.png" alt="Next"></a>
+<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>
 </body>
 </html>
diff --git a/doc/html/range/style_guide.html b/doc/html/range/style_guide.html
index c9f3e34..c5e6877 100644
--- a/doc/html/range/style_guide.html
+++ b/doc/html/range/style_guide.html
@@ -2,8 +2,8 @@
 <head>
 <meta http-equiv="Content-Type" content="text/html; charset=US-ASCII">
 <title>Terminology and style guidelines</title>
-<link rel="stylesheet" href="../../../../../doc/html/boostbook.css" type="text/css">
-<meta name="generator" content="DocBook XSL Stylesheets V1.75.1">
+<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="../index.html" title="Chapter&#160;1.&#160;Range 2.0">
 <link rel="prev" href="reference/extending/method_3/method_3_2.html" title="Method 3.2: Implement a Range Adaptor with arguments">
@@ -13,16 +13,16 @@
 <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="../../../../libraries.htm">Libraries</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="reference/extending/method_3/method_3_2.html"><img src="../../../../../doc/html/images/prev.png" alt="Prev"></a><a accesskey="u" href="../index.html"><img src="../../../../../doc/html/images/up.png" alt="Up"></a><a accesskey="h" href="../index.html"><img src="../../../../../doc/html/images/home.png" alt="Home"></a><a accesskey="n" href="library_headers.html"><img src="../../../../../doc/html/images/next.png" alt="Next"></a>
+<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="library_headers.html"><img src="../../../../../doc/src/images/next.png" alt="Next"></a>
 </div>
-<div class="section" title="Terminology and style guidelines">
+<div class="section">
 <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,31 +39,41 @@
     </p>
 <div class="itemizedlist"><ul class="itemizedlist" type="disc">
 <li class="listitem">
-<span class="bold"><strong><span class="emphasis"><em>Value access</em></span></strong></span> category:
-        <div class="itemizedlist"><ul class="itemizedlist" type="circle">
+          <span class="bold"><strong><span class="emphasis"><em>Value access</em></span></strong></span> category:
+          <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">
-<span class="bold"><strong><span class="emphasis"><em>Traversal</em></span></strong></span> category:
-        <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>
-<li class="listitem"><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>
-<li class="listitem"><a class="link" href="concepts/random_access_range.html" title="Random Access Range">Random Access Range</a></li>
+          <span class="bold"><strong><span class="emphasis"><em>Traversal</em></span></strong></span> category:
+          <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>
+<li class="listitem">
+                <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>
+<li class="listitem">
+                <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
@@ -77,11 +87,11 @@
     </p>
 <div class="itemizedlist"><ul class="itemizedlist" type="disc">
 <li class="listitem">
-        Random Access Readable Writeable Range
-      </li>
+          Random Access Readable Writeable Range
+        </li>
 <li class="listitem">
-        Forward Lvalue Range
-      </li>
+          Forward Lvalue Range
+        </li>
 </ul></div>
 <p>
       By convention, we should always specify the <span class="bold"><strong><span class="emphasis"><em>traversal</em></span></strong></span>
@@ -135,7 +145,7 @@
 </tr></table>
 <hr>
 <div class="spirit-nav">
-<a accesskey="p" href="reference/extending/method_3/method_3_2.html"><img src="../../../../../doc/html/images/prev.png" alt="Prev"></a><a accesskey="u" href="../index.html"><img src="../../../../../doc/html/images/up.png" alt="Up"></a><a accesskey="h" href="../index.html"><img src="../../../../../doc/html/images/home.png" alt="Home"></a><a accesskey="n" href="library_headers.html"><img src="../../../../../doc/html/images/next.png" alt="Next"></a>
+<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="library_headers.html"><img src="../../../../../doc/src/images/next.png" alt="Next"></a>
 </div>
 </body>
 </html>
diff --git a/doc/html/range/upgrade.html b/doc/html/range/upgrade.html
index ad53c37..2e6a068 100644
--- a/doc/html/range/upgrade.html
+++ b/doc/html/range/upgrade.html
@@ -2,8 +2,8 @@
 <head>
 <meta http-equiv="Content-Type" content="text/html; charset=US-ASCII">
 <title>Upgrade version of Boost.Range</title>
-<link rel="stylesheet" href="../../../../../doc/html/boostbook.css" type="text/css">
-<meta name="generator" content="DocBook XSL Stylesheets V1.75.1">
+<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="../index.html" title="Chapter&#160;1.&#160;Range 2.0">
 <link rel="prev" href="mfc_atl/references.html" title="References">
@@ -13,16 +13,16 @@
 <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="../../../../libraries.htm">Libraries</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="mfc_atl/references.html"><img src="../../../../../doc/html/images/prev.png" alt="Prev"></a><a accesskey="u" href="../index.html"><img src="../../../../../doc/html/images/up.png" alt="Up"></a><a accesskey="h" href="../index.html"><img src="../../../../../doc/html/images/home.png" alt="Home"></a><a accesskey="n" href="upgrade/upgrade_from_1_42.html"><img src="../../../../../doc/html/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_42.html"><img src="../../../../../doc/src/images/next.png" alt="Next"></a>
 </div>
-<div class="section" title="Upgrade version of Boost.Range">
+<div class="section">
 <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>
@@ -43,7 +43,7 @@
 </tr></table>
 <hr>
 <div class="spirit-nav">
-<a accesskey="p" href="mfc_atl/references.html"><img src="../../../../../doc/html/images/prev.png" alt="Prev"></a><a accesskey="u" href="../index.html"><img src="../../../../../doc/html/images/up.png" alt="Up"></a><a accesskey="h" href="../index.html"><img src="../../../../../doc/html/images/home.png" alt="Home"></a><a accesskey="n" href="upgrade/upgrade_from_1_42.html"><img src="../../../../../doc/html/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_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_34.html b/doc/html/range/upgrade/upgrade_from_1_34.html
index 1275e9c..bc22cb6 100644
--- a/doc/html/range/upgrade/upgrade_from_1_34.html
+++ b/doc/html/range/upgrade/upgrade_from_1_34.html
@@ -2,8 +2,8 @@
 <head>
 <meta http-equiv="Content-Type" content="text/html; charset=US-ASCII">
 <title>Upgrade from version 1.34</title>
-<link rel="stylesheet" href="../../../../../../doc/html/boostbook.css" type="text/css">
-<meta name="generator" content="DocBook XSL Stylesheets V1.75.1">
+<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_from_1_42.html" title="Upgrade from version 1.42">
@@ -13,16 +13,16 @@
 <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="../../../../../libraries.htm">Libraries</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_from_1_42.html"><img src="../../../../../../doc/html/images/prev.png" alt="Prev"></a><a accesskey="u" href="../upgrade.html"><img src="../../../../../../doc/html/images/up.png" alt="Up"></a><a accesskey="h" href="../../index.html"><img src="../../../../../../doc/html/images/home.png" alt="Home"></a><a accesskey="n" href="../portability.html"><img src="../../../../../../doc/html/images/next.png" alt="Next"></a>
+<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" title="Upgrade from version 1.34">
+<div class="section">
 <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>
@@ -32,32 +32,34 @@
       </p>
 <div class="orderedlist"><ol class="orderedlist" type="1">
 <li class="listitem">
-          Direct support for character arrays was abandoned in favor of uniform treatment
-          of all arrays. Instead string algorithms can use the new function <a class="link" href="../reference/concept_implementation/semantics/functions.html" title="Functions"><code class="computeroutput"><span class="identifier">as_literal</span></code></a><code class="computeroutput"><span class="special">()</span></code>.
-        </li>
+            Direct support for character arrays was abandoned in favor of uniform
+            treatment of all arrays. Instead string algorithms can use the new function
+            <a class="link" href="../reference/concept_implementation/semantics/functions.html" title="Functions"><code class="computeroutput"><span class="identifier">as_literal</span></code></a><code class="computeroutput"><span class="special">()</span></code>.
+          </li>
 <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 requires a <a class="link" href="../concepts/random_access_range.html" title="Random Access Range">Random
-          Access Range</a>. The old behavior is provided as <a class="link" href="../reference/concept_implementation/semantics/functions.html" title="Functions"><code class="computeroutput"><span class="identifier">distance</span></code></a><code class="computeroutput"><span class="special">()</span></code>.
-        </li>
+            <a class="link" href="../reference/concept_implementation/semantics/functions.html" title="Functions"><code class="computeroutput"><span class="identifier">size</span></code></a> now requires a <a class="link" href="../concepts/random_access_range.html" title="Random Access Range">Random
+            Access Range</a>. The old behavior is provided as <a class="link" href="../reference/concept_implementation/semantics/functions.html" title="Functions"><code class="computeroutput"><span class="identifier">distance</span></code></a><code class="computeroutput"><span class="special">()</span></code>.
+          </li>
 <li class="listitem">
-<code class="computeroutput"><span class="identifier">range_size</span><span class="special">&lt;</span><span class="identifier">T</span><span class="special">&gt;::</span><span class="identifier">type</span></code> has been completely removed in favor
-          of <code class="computeroutput"><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></code>
-</li>
+            <code class="computeroutput"><span class="identifier">range_size</span><span class="special">&lt;</span><span class="identifier">T</span><span class="special">&gt;::</span><span class="identifier">type</span></code> has been completely removed in
+            favor of <code class="computeroutput"><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></code>
+          </li>
 <li class="listitem">
-<code class="computeroutput"><span class="identifier">boost_range_begin</span><span class="special">()</span></code>
-          and <code class="computeroutput"><span class="identifier">boost_range_end</span><span class="special">()</span></code>
-          have been renamed <code class="computeroutput"><span class="identifier">range_begin</span><span class="special">()</span></code> and <code class="computeroutput"><span class="identifier">range_end</span><span class="special">()</span></code> respectively.
-        </li>
+            <code class="computeroutput"><span class="identifier">boost_range_begin</span><span class="special">()</span></code>
+            and <code class="computeroutput"><span class="identifier">boost_range_end</span><span class="special">()</span></code>
+            have been renamed <code class="computeroutput"><span class="identifier">range_begin</span><span class="special">()</span></code> and <code class="computeroutput"><span class="identifier">range_end</span><span class="special">()</span></code> respectively.
+          </li>
 <li class="listitem">
-<code class="computeroutput"><span class="identifier">range_result_iterator</span><span class="special">&lt;</span><span class="identifier">T</span><span class="special">&gt;::</span><span class="identifier">type</span></code> and <code class="computeroutput"><span class="identifier">range_reverse_result_iterator</span><span class="special">&lt;</span><span class="identifier">T</span><span class="special">&gt;::</span><span class="identifier">type</span></code>
-          have been renamed <code class="computeroutput"><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></code>
-          and <code class="computeroutput"><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></code>.
-        </li>
+            <code class="computeroutput"><span class="identifier">range_result_iterator</span><span class="special">&lt;</span><span class="identifier">T</span><span class="special">&gt;::</span><span class="identifier">type</span></code>
+            and <code class="computeroutput"><span class="identifier">range_reverse_result_iterator</span><span class="special">&lt;</span><span class="identifier">T</span><span class="special">&gt;::</span><span class="identifier">type</span></code>
+            have been renamed <code class="computeroutput"><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></code>
+            and <code class="computeroutput"><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></code>.
+          </li>
 <li class="listitem">
-          The procedure that makes a custom type work with the library has been greatly
-          simplified. See <a class="link" href="../reference/extending.html" title="Extending the library">Extending the
-          library for UDTs</a> for details.
-        </li>
+            The procedure that makes a custom type work with the library has been
+            greatly simplified. See <a class="link" href="../reference/extending.html" title="Extending the library">Extending
+            the library for UDTs</a> for details.
+          </li>
 </ol></div>
 </div>
 <table xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" width="100%"><tr>
@@ -70,7 +72,7 @@
 </tr></table>
 <hr>
 <div class="spirit-nav">
-<a accesskey="p" href="upgrade_from_1_42.html"><img src="../../../../../../doc/html/images/prev.png" alt="Prev"></a><a accesskey="u" href="../upgrade.html"><img src="../../../../../../doc/html/images/up.png" alt="Up"></a><a accesskey="h" href="../../index.html"><img src="../../../../../../doc/html/images/home.png" alt="Home"></a><a accesskey="n" href="../portability.html"><img src="../../../../../../doc/html/images/next.png" alt="Next"></a>
+<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>
 </body>
 </html>
diff --git a/doc/html/range/upgrade/upgrade_from_1_42.html b/doc/html/range/upgrade/upgrade_from_1_42.html
index 3fbc2d2..3174dc1 100644
--- a/doc/html/range/upgrade/upgrade_from_1_42.html
+++ b/doc/html/range/upgrade/upgrade_from_1_42.html
@@ -2,8 +2,8 @@
 <head>
 <meta http-equiv="Content-Type" content="text/html; charset=US-ASCII">
 <title>Upgrade from version 1.42</title>
-<link rel="stylesheet" href="../../../../../../doc/html/boostbook.css" type="text/css">
-<meta name="generator" content="DocBook XSL Stylesheets V1.75.1">
+<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">
@@ -13,16 +13,16 @@
 <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="../../../../../libraries.htm">Libraries</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/html/images/prev.png" alt="Prev"></a><a accesskey="u" href="../upgrade.html"><img src="../../../../../../doc/html/images/up.png" alt="Up"></a><a accesskey="h" href="../../index.html"><img src="../../../../../../doc/html/images/home.png" alt="Home"></a><a accesskey="n" href="upgrade_from_1_34.html"><img src="../../../../../../doc/html/images/next.png" alt="Next"></a>
+<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_34.html"><img src="../../../../../../doc/src/images/next.png" alt="Next"></a>
 </div>
-<div class="section" title="Upgrade from version 1.42">
+<div class="section">
 <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>
@@ -31,22 +31,26 @@
         New features:
       </p>
 <div class="orderedlist"><ol class="orderedlist" type="1">
-<li class="listitem"><a class="link" href="../reference/adaptors.html" title="Range Adaptors">Range adaptors</a></li>
-<li class="listitem"><a class="link" href="../reference/algorithms.html" title="Range Algorithm">Range algorithms</a></li>
+<li class="listitem">
+            <a class="link" href="../reference/adaptors.html" title="Range Adaptors">Range adaptors</a>
+          </li>
+<li class="listitem">
+            <a class="link" href="../reference/algorithms.html" title="Range Algorithm">Range algorithms</a>
+          </li>
 </ol></div>
 <p>
         Removed:
       </p>
 <div class="orderedlist"><ol class="orderedlist" type="1"><li class="listitem">
-<code class="computeroutput"><span class="identifier">iterator_range</span></code> no longer
-          has a <code class="computeroutput"><span class="identifier">is_singular</span></code> member
-          function. The singularity restrictions have been removed from the <code class="computeroutput"><span class="identifier">iterator_range</span></code> class since this added
-          restrictions to ranges of iterators whose default constructors were not
-          singular. Previously the <code class="computeroutput"><span class="identifier">is_singular</span></code>
-          member function always returned <code class="computeroutput"><span class="keyword">false</span></code>
-          in release build configurations, hence it is not anticipated that this
-          interface change will produce difficulty in upgrading.
-        </li></ol></div>
+            <code class="computeroutput"><span class="identifier">iterator_range</span></code> no longer
+            has a <code class="computeroutput"><span class="identifier">is_singular</span></code> member
+            function. The singularity restrictions have been removed from the <code class="computeroutput"><span class="identifier">iterator_range</span></code> class since this added
+            restrictions to ranges of iterators whose default constructors were not
+            singular. Previously the <code class="computeroutput"><span class="identifier">is_singular</span></code>
+            member function always returned <code class="computeroutput"><span class="keyword">false</span></code>
+            in release build configurations, hence it is not anticipated that this
+            interface change will produce difficulty in upgrading.
+          </li></ol></div>
 </div>
 <table xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" width="100%"><tr>
 <td align="left"></td>
@@ -58,7 +62,7 @@
 </tr></table>
 <hr>
 <div class="spirit-nav">
-<a accesskey="p" href="../upgrade.html"><img src="../../../../../../doc/html/images/prev.png" alt="Prev"></a><a accesskey="u" href="../upgrade.html"><img src="../../../../../../doc/html/images/up.png" alt="Up"></a><a accesskey="h" href="../../index.html"><img src="../../../../../../doc/html/images/home.png" alt="Home"></a><a accesskey="n" href="upgrade_from_1_34.html"><img src="../../../../../../doc/html/images/next.png" alt="Next"></a>
+<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_34.html"><img src="../../../../../../doc/src/images/next.png" alt="Next"></a>
 </div>
 </body>
 </html>
diff --git a/doc/introduction.qbk b/doc/introduction.qbk
index c25eeae..7fc83df 100644
--- a/doc/introduction.qbk
+++ b/doc/introduction.qbk
@@ -12,62 +12,27 @@ The main advantages are
 * more flexible, compact and maintainable client code
 * safe use of built-in arrays (for legacy code; why else would you use built-in arrays?)
 
-Below are given a small example (the complete example can be found [@http://www.boost.org/libs/range/test/algorithm_example.cpp here] ):
-
+[heading Example - Iterate over the values in a map]
 ``
-        //
-        // example: extracting bounds in a generic algorithm
-        //
-        template< class ForwardReadableRange, class T >
-        inline typename boost::range_iterator< ForwardReadableRange >::type
-        find( ForwardReadableRange& c, const T& value )
-        {
-           return std::find( boost::begin( c ), boost::end( c ), value );
-        }
-
-        template< class ForwardReadableRange, class T >
-        inline typename boost::range_iterator< const ForwardReadableRange >::type
-        find( const ForwardReadableRange& c, const T& value )
-        {
-           return std::find( boost::begin( c ), boost::end( c ), value );
-        }
-
-        //
-        // replace first value and return its index
-        //
-        template< class ForwardReadableWriteableRange, class T >
-        inline typename boost::range_size< ForwardReadableWriteableRange >::type
-        my_generic_replace( ForwardReadableWriteableRange& c, const T& value, const T& replacement )
-        {
-           typename boost::range_iterator< ForwardReadableWriteableRange >::type found = find( c, value );
-
-           if( found != boost::end( c ) )
-               *found = replacement;
-           return std::distance( boost::begin( c ), found );
-        }
-
-        //
-        // usage
-        //
-        const int N = 5;
-        std::vector<int> my_vector;
-        int values[] = { 1,2,3,4,5,6,7,8,9 };
-
-        my_vector.assign( values, boost::end( values ) );
-        typedef std::vector<int>::iterator iterator;
-        std::pair<iterator,iterator>       my_view( boost::begin( my_vector ),
-                                                    boost::begin( my_vector ) + N );
-        char  str_val[] = "a string";
-        char* str       = str_val;
-
-        std::cout << my_generic_replace( my_vector, 4, 2 );
-        std::cout << my_generic_replace( my_view, 4, 2 );
-        std::cout << my_generic_replace( str, 'a', 'b' );
-
-        // prints '3', '5' and '0'
+using namespace boost;
+using namespace boost::adaptors;
+for_each( my_map | map_values, fn );
 ``
 
-By using the free-standing functions and __metafunctions__, the code automatically works for all the types supported by this library; now and in the future. Notice that we have to provide two versions of `find()` since we cannot forward a non-const rvalue with reference arguments (see this article about __the_forwarding_problem__ ).
+[heading Example - Iterate over the keys in a map]
+``
+using namespace boost;
+using namespace boost::adaptors;
+for_each( my_map | map_keys, fn );
+``
+
+[heading Example - Push the even values from a map in reverse order into the container `target`]
+``
+using namespace boost;
+using namespace boost::adaptors;
+// Assume that is_even is a predicate that has been implemented elsewhere...
+push_back(target, my_map | map_values | filtered(is_even()) | reversed);
+``
 
 [endsect]
 
diff --git a/doc/reference/adaptors/adjacent_filtered.html b/doc/reference/adaptors/adjacent_filtered.html
deleted file mode 100755
index a5da75a..0000000
--- a/doc/reference/adaptors/adjacent_filtered.html
+++ /dev/null
@@ -1,101 +0,0 @@
-<!DOCTYPE HTML PUBLIC "-//W3C//DTD HTML 3.2//EN">
-
-<html>
-<head>
-    <meta http-equiv="Content-Type" content="text/html; charset=ISO-8859-1">
-    <title>Boost.Range Range Adaptors </title>
-    <link rel="stylesheet" href="../style.css" type="text/css">
-</head>
-
-    <body>
-
-    <table border="0" >
-        <tr>
-            <td ><img src="../../../boost.png" border="0" /></td>
-            <td ><h1 align="center">Boost.Range </h1></td>
-        </tr>
-    </table>
-
-    <h2> Range Adaptors </h2>
-    
-    <hr />
-    <a name="adjacent_filtered"></a>
-    <h4><code>adjacent_filtered</code></h4>
-    <blockquote>
-        <pre>            rng | boost::adaptors::adjacent_filtered( bi_pred )
-        </pre>
-        <pre>            boost::make_adjacent_filtered_range( rng, bi_pred )
-        </pre>
-    </blockquote>
-    <ul>
-        <li>
-            <b>Precondition:</b>
-            The value-type of the range is convertible to both argument types
-            of <code>bi_pred</code>.
-        </li>
-        <li>
-            <b>Postcondition:</b>
-            For all adjacent elements <code>[x,y]</code> in the returned range, 
-            <code>bi_pred(x,y)</code> is <code>true</code>.
-        </li>
-        <li>
-            <b>Throws:</b>
-            Whatever the copy-constructor of bi_pred might throw.
-        </li>
-        <li>
-            <b>Range Category:</b>
-            SinglePassRange
-        </li>
-    </ul>
-    
-    <hr />
-    <h3>Example</h3>
-    <pre>
-        <span class="keyword">#include</span> &lt;boost/range/adaptor/adjacent_filtered.hpp&gt;
-        <span class="keyword">#include</span> &lt;boost/range/algorithm/copy.hpp&gt;
-        <span class="keyword">#include</span> &lt;boost/assign.hpp&gt;
-        <span class="keyword">#include</span> &lt;algorithm&gt;
-        <span class="keyword">#include</span> &lt;functional&gt;
-        <span class="keyword">#include</span> &lt;iostream&gt;
-        <span class="keyword">#include</span> &lt;vector&gt;
-        
-        <span class="keyword">int</span> main(<span class="keyword">int</span> argc, <span class="keyword">const char</span>* argv[])
-        {
-            <span class="keyword">using namespace</span> boost::assign;
-            <span class="keyword">using namespace</span> boost::adaptors;
-            
-            std::vector&lt;<span class="keyword">int</span>&gt; input;
-            input += 1,1,2,2,2,3,4,5,6;
-            
-            boost::copy(
-                input | adjacent_filtered(std::not_equal_to&lt;<span class="keyword">int</span>&gt;()),
-                std::ostream_iterator&lt;<span class="keyword">int</span>&gt;(std::cout, ","));
-                
-            <span class="keyword">return</span> 0;
-        }
-    </pre>
-    <p>
-        This would produce the output:<br />
-        <code>1,2,3,4,5,6</code><br />
-    </p>
-    <hr />
-    <p>
-    (C) Copyright Neil Groves 2009
-    (C) Copyright Thorsten Ottosen 2003-2004
-    </p>
-
-    <br />
-    <br />
-    <br />
-    <br />
-    <br />
-    <br />
-    <br />
-    <br />
-    <br />
-    <br />
-    <br />
-    <br />
-    </body>
-</html>
-
diff --git a/doc/reference/adaptors/copied.html b/doc/reference/adaptors/copied.html
deleted file mode 100755
index 12b3351..0000000
--- a/doc/reference/adaptors/copied.html
+++ /dev/null
@@ -1,93 +0,0 @@
-<!DOCTYPE HTML PUBLIC "-//W3C//DTD HTML 3.2//EN">
-
-<html>
-<head>
-    <meta http-equiv="Content-Type" content="text/html; charset=ISO-8859-1">
-    <title>Boost.Range Range Adaptors </title>
-    <link rel="stylesheet" href="../style.css" type="text/css">
-</head>
-
-    <body>
-
-    <table border="0" >
-        <tr>
-            <td ><img src="../../../boost.png" border="0" /></td>
-            <td ><h1 align="center">Boost.Range </h1></td>
-        </tr>
-    </table>
-
-    <h2> Range Adaptors </h2>
-    
-    <hr />
-    <a name="copied"></a>
-    <h4><code>copied</code></h4>
-    <blockquote>
-        <pre>rng | boost::adaptors::copied( n, m )</pre>
-        <pre>boost::make_copied_range( rng, n, m )</pre>
-    </blockquote>
-    <ul>
-        <li>
-            <b>Precondition:</b>
-            <code>0 &lt;= n &amp;&amp; n &lt;= m &amp;&amp; m &lt; distance(rng)</code>
-        </li>    
-        <li>
-            <b>Returns:</b>
-            A new <code>iterator_range</code> that holds the sliced range
-            <code>[n,m)</code> of the original range.
-        </li>
-        <li>
-            <b>Range Category:</b>
-            RandomAccessRange
-        </li>
-    </ul>
-    
-    <hr />
-    <h3>Example</h3>
-    <pre>
-    <span class="keyword">#include</span> &lt;boost/range/adaptor/copied.hpp&gt;
-    <span class="keyword">#include</span> &lt;boost/range/algorithm/copy.hpp&gt;
-    <span class="keyword">#include</span> &lt;boost/assign.hpp&gt;
-    <span class="keyword">#include</span> &lt;algorithm&gt;
-    <span class="keyword">#include</span> &lt;iostream&gt;
-    <span class="keyword">#include</span> &lt;vector&gt;
-
-    <span class="keyword">int</span> main(<span class="keyword">int</span> argc, <span class="keyword">const char</span>* argv[])
-    {
-        <span class="keyword">using namespace</span> boost::assign;
-        <span class="keyword">using namespace</span> boost::adaptors;
-
-        std::vector&lt;<span class="keyword">int</span>&gt; input;
-        input += 1,2,3,4,5,6,7,8,9,10;
-
-        boost::copy(
-            input | copied(1, 5),
-            std::ostream_iterator&lt;<span class="keyword">int</span>&gt;(std::cout, ","));
-
-        <span class="keyword">return</span> 0;
-    }
-    </pre>
-    <p>
-        This would produce the output:
-        <code>2,3,4,5</code>
-    </p>
-    <hr />
-    <p>
-    (C) Copyright Neil Groves 2009
-    (C) Copyright Thorsten Ottosen 2003-2004
-    </p>
-
-    <br />
-    <br />
-    <br />
-    <br />
-    <br />
-    <br />
-    <br />
-    <br />
-    <br />
-    <br />
-    <br />
-    <br />
-    </body>
-</html>
-
diff --git a/doc/reference/adaptors/filtered.html b/doc/reference/adaptors/filtered.html
deleted file mode 100755
index 055c826..0000000
--- a/doc/reference/adaptors/filtered.html
+++ /dev/null
@@ -1,108 +0,0 @@
-<!DOCTYPE HTML PUBLIC "-//W3C//DTD HTML 3.2//EN">
-
-<html>
-<head>
-    <meta http-equiv="Content-Type" content="text/html; charset=ISO-8859-1">
-    <title>Boost.Range Range Adaptors </title>
-    <link rel="stylesheet" href="../style.css" type="text/css">
-</head>
-
-    <body>
-
-    <table border="0" >
-        <tr>
-            <td ><img src="../../../boost.png" border="0" /></td>
-            <td ><h1 align="center">Boost.Range </h1></td>
-        </tr>
-    </table>
-
-    <h2> Range Adaptors </h2>
-    
-    <hr />
-    <a name="filtered"></a>
-    <h4><code>filtered</code></h4>
-    <blockquote>
-        <pre>rng | boost::adaptors::filtered( pred )</pre>
-        <pre>boost::make_filtered_range( rng, pred )</pre>
-    </blockquote>
-    <ul>
-        <li>
-            <b>Precondition:</b>
-            The value-type of the range is convertible to the argument type of
-            <code>pred</code>.
-        </li>    
-        <li>
-            <b>Postcondition:</b>
-            For all elements <code>x</code> in the returned range, 
-            <code>pred(x)</code> is <code>true</code>
-        </li>
-        <li>
-            <b>Throws:</b>
-            Whatever the copy-constructor of pred might throw.
-        </li>
-        <li>
-            <b>Range Category:</b>
-            ForwardRange
-        </li>
-        <li>
-            <b>Returned Range Category:</b>
-            ForwardRange
-        </li>
-    </ul>
-    
-    <hr />
-    <h3>Example</h3>
-    <pre>
-        <span class="keyword">#include</span> &lt;boost/range/adaptor/filtered.hpp&gt;
-        <span class="keyword">#include</span> &lt;boost/range/algorithm/copy.hpp&gt;
-        <span class="keyword">#include</span> &lt;boost/assign.hpp&gt;
-        <span class="keyword">#include</span> &lt;algorithm&gt;
-        <span class="keyword">#include</span> &lt;iostream&gt;
-        <span class="keyword">#include</span> &lt;vector&gt;
-
-        <span class="keyword">struct</span> is_even
-        {
-            <span class="keyword">bool operator</span>()(<span class="keyword">int</span> x) <span class="keyword">const</span> { <span class="keyword">return</span> x % 2 == 0; }
-        };
-        
-        <span class="keyword">int</span> main(<span class="keyword">int</span> argc, <span class="keyword">const char</span>* argv[])
-        {
-            <span class="keyword">using namespace</span> boost::assign;
-            <span class="keyword">using namespace</span> boost::adaptors;
-            
-            std::vector&lt;<span class="keyword">int</span>&gt; input;
-            input += 1,2,3,4,5,6,7,8,9;
-
-            boost::copy(
-                input | filtered(is_even()),
-                std::ostream_iterator&lt;<span class="keyword">int</span>&gt;(std::cout, ","));
-
-            <span class="keyword">return</span> 0;
-        }
-    </pre>
-    <p>
-        This would produce the output: <br />
-        <code>2,4,6,8</code>
-    </p>
-
-    <hr />
-    <p>
-    (C) Copyright Neil Groves 2009
-    (C) Copyright Thorsten Ottosen 2003-2004
-    </p>
-
-    <br />
-    <br />
-    <br />
-    <br />
-    <br />
-    <br />
-    <br />
-    <br />
-    <br />
-    <br />
-    <br />
-    <br />
-    </body>
-</html>
-
diff --git a/doc/reference/adaptors/indexed.html b/doc/reference/adaptors/indexed.html
deleted file mode 100755
index 74e0d04..0000000
--- a/doc/reference/adaptors/indexed.html
+++ /dev/null
@@ -1,117 +0,0 @@
-<!DOCTYPE HTML PUBLIC "-//W3C//DTD HTML 3.2//EN">
-
-<html>
-<head>
-    <meta http-equiv="Content-Type" content="text/html; charset=ISO-8859-1">
-    <title>Boost.Range Range Adaptors </title>
-    <link rel="stylesheet" href="../style.css" type="text/css">
-</head>
-
-    <body>
-
-    <table border="0" >
-        <tr>
-            <td ><img src="../../../boost.png" border="0" /></td>
-            <td ><h1 align="center">Boost.Range </h1></td>
-        </tr>
-    </table>
-
-    <h2> Range Adaptors </h2>
-    
-    <hr />
-    <a name="indexed"></a>
-    <h4><code>indexed</code></h4>
-    <blockquote>
-        <pre>rng | boost::adaptors::indexed</pre>
-        <pre>boost::make_indexed_range( rng )</pre>
-    </blockquote>
-    <ul>
-        <li>
-            <b>Returns:</b>
-            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
-            <code>index()</code> member function that returns the appropriate
-            index for the element in the sequence corresponding with the
-            iterator.
-        </li>
-        <li>
-            <b>Range Category:</b>
-            SinglePassRange
-        </li>
-    </ul>
-    <hr />
-    <h3>Example</h3>
-    <pre>
-        <span class="keyword">#include</span> &lt;boost/range/adaptor/indexed.hpp&gt;
-        <span class="keyword">#include</span> &lt;boost/range/algorithm/copy.hpp&gt;
-        <span class="keyword">#include</span> &lt;boost/assign.hpp&gt;
-        <span class="keyword">#include</span> &lt;algorithm&gt;
-        <span class="keyword">#include</span> &lt;iostream&gt;
-        <span class="keyword">#include</span> &lt;vector&gt;
-        
-        <span class="keyword">template</span>&lt;<span class="keyword">class</span> Iterator&gt;
-        void display_element_and_index(Iterator first, Iterator last)
-        {
-            <span class="keyword">for</span> (Iterator it = first; it != last; ++it)
-            {
-                std::cout << "Element = " << *it
-                          << " Index = " << it.index() << std::endl;
-            }
-        }
-        
-        <span class="keyword">template</span>&lt;<span class="keyword">class</span> SinglePassRange&gt;
-        void display_element_and_index(<span class="keyword">const</span> SinglePassRange& rng)
-        {
-            display_element_and_index(boost::begin(rng), boost::end(rng));
-        }
-        
-        <span class="keyword">int</span> main(<span class="keyword">int</span> argc, <span class="keyword">const char</span>* argv[])
-        {
-            <span class="keyword">using namespace</span> boost::assign;
-            <span class="keyword">using namespace</span> boost::adaptors;
-            
-            std::vector&lt;<span class="keyword">int</span>&gt; input;
-            input += 10,20,30,40,50,60,70,80,90;
-            
-            display_element_and_index( input | indexed(0) );
-            
-            <span class="keyword">return</span> 0;
-        }
-    </pre>
-    <p>
-        This produces the output: <br />
-        <code>
-        Element = 10 Index = 0 <br />
-        Element = 20 Index = 1 <br />
-        Element = 30 Index = 2 <br />
-        Element = 40 Index = 3 <br />
-        Element = 50 Index = 4 <br />
-        Element = 60 Index = 5 <br />
-        Element = 70 Index = 6 <br />
-        Element = 80 Index = 7 <br />
-        Element = 90 Index = 8 <br />
-        </code>
-    </p>
-    <hr />
-    <p>
-    (C) Copyright Neil Groves 2009
-    (C) Copyright Thorsten Ottosen 2003-2004
-    </p>
-
-    <br />
-    <br />
-    <br />
-    <br />
-    <br />
-    <br />
-    <br />
-    <br />
-    <br />
-    <br />
-    <br />
-    <br />
-    </body>
-</html>
-
diff --git a/doc/reference/adaptors/indirected.html b/doc/reference/adaptors/indirected.html
deleted file mode 100755
index 0a56e32..0000000
--- a/doc/reference/adaptors/indirected.html
+++ /dev/null
@@ -1,95 +0,0 @@
-<!DOCTYPE HTML PUBLIC "-//W3C//DTD HTML 3.2//EN">
-
-<html>
-<head>
-    <meta http-equiv="Content-Type" content="text/html; charset=ISO-8859-1">
-    <title>Boost.Range Range Adaptors </title>
-    <link rel="stylesheet" href="../style.css" type="text/css">
-</head>
-
-    <body>
-
-    <table border="0" >
-        <tr>
-            <td ><img src="../../../boost.png" border="0" /></td>
-            <td ><h1 align="center">Boost.Range </h1></td>
-        </tr>
-    </table>
-
-    <h2> Range Adaptors </h2>
-    
-    <hr />
-    <a name="indirected"></a>
-    <h4><code>indirected</code></h4>
-    <blockquote>
-        <pre>rng | boost::adaptors::indirected</pre>
-        <pre>boost::make_indirected_range( rng )</pre>
-    </blockquote>
-    <ul>
-        <li>
-            <b>Precondition:</b>
-            The value-type of the range defines unary <code>operator*()</code>
-        </li>
-        <li>
-            <b>Postcondition:</b>
-            For all elements <code>x</code> in the returned range,
-            <code>x</code> is the result of <code>*y</code> where
-            <code>y</code> is the corresponding element in the original range.
-        </li>
-        <li>
-            <b>Range Category:</b>
-            SinglePassRange
-        </li>
-    </ul>
-    
-    <hr />
-    <h3>Example</h3>
-    <pre>
-        <span class="keyword">#include</span> &lt;boost/range/adaptor/indirected.hpp&gt;
-        <span class="keyword">#include</span> &lt;boost/range/algorithm/copy.hpp&gt;
-        <span class="keyword">#include</span> &lt;boost/shared_ptr.hpp&gt;
-        <span class="keyword">#include</span> &lt;algorithm&gt;
-        <span class="keyword">#include</span> &lt;iostream&gt;
-        <span class="keyword">#include</span> &lt;vector&gt;
-        
-        <span class="keyword">int</span> main(<span class="keyword">int</span> argc, <span class="keyword">const char</span>* argv[])
-        {
-            <span class="keyword">using namespace</span> boost::adaptors;
-            
-            std::vector&lt;boost::shared_ptr&lt;<span class="keyword">int</span>&gt; &gt; input;
-            
-            <span class="keyword">for</span> (<span class="keyword">int</span> i = 0; i < 10; ++i)
-                input.push_back(boost::shared_ptr&lt;<span class="keyword">int</span>&gt;(<span class="keyword">new int</span>(i)));
-                
-            boost::copy(
-                input | indirected,
-                std::ostream_iterator&lt;<span class="keyword">int</span>&gt;(std::cout, ","));
-                
-            <span class="keyword">return</span> 0;
-        }
-    </pre>
-    <p>
-        This produces the output: <br />
-        <code>0,1,2,3,4,5,6,7,8,9</code>
-    </p>
-    <hr />
-    <p>
-    (C) Copyright Neil Groves 2009
-    (C) Copyright Thorsten Ottosen 2003-2004
-    </p>
-
-    <br />
-    <br />
-    <br />
-    <br />
-    <br />
-    <br />
-    <br />
-    <br />
-    <br />
-    <br />
-    <br />
-    <br />
-    </body>
-</html>
-
diff --git a/doc/reference/adaptors/map_keys.html b/doc/reference/adaptors/map_keys.html
deleted file mode 100755
index a1eec17..0000000
--- a/doc/reference/adaptors/map_keys.html
+++ /dev/null
@@ -1,99 +0,0 @@
-<!DOCTYPE HTML PUBLIC "-//W3C//DTD HTML 3.2//EN">
-
-<html>
-<head>
-    <meta http-equiv="Content-Type" content="text/html; charset=ISO-8859-1">
-    <title>Boost.Range Range Adaptors </title>
-    <link rel="stylesheet" href="../style.css" type="text/css">
-</head>
-
-    <body>
-
-    <table border="0" >
-        <tr>
-            <td ><img src="../../../boost.png" border="0" /></td>
-            <td ><h1 align="center">Boost.Range </h1></td>
-        </tr>
-    </table>
-
-    <h2> Range Adaptors </h2>
-    
-    <hr />
-    <a name="map_keys"></a>
-    <h4><code>map_keys</code></h4>
-    <blockquote>
-        <pre>rng | boost::adaptors::map_keys</pre>
-        <pre>boost::make_map_key_range( rng )</pre>
-    </blockquote>
-    <ul>
-        <li>
-            <b>Precondition:</b>
-            The value-type of the range is an instantiation of std::pair.
-        </li>
-        <li>
-            <b>Postcondition:</b>
-            For all elements <code>x</code> in the returned range,
-            <code>x</code> is the result of <code>y.first</code> where
-            <code>y</code> is the corresponding element in the original range.
-        </li>
-        <li>
-            <b>Range Category:</b>
-            SinglePassRange
-        </li>
-    </ul>
-    
-    <hr />
-    <h3>Example</h3>
-    <pre>
-        <span class="keyword">#include</span> &lt;boost/range/adaptor/map.hpp&gt;
-        <span class="keyword">#include</span> &lt;boost/range/algorithm/copy.hpp&gt;
-        <span class="keyword">#include</span> &lt;boost/assign.hpp&gt;
-        <span class="keyword">#include</span> &lt;algorithm&gt;
-        <span class="keyword">#include</span> &lt;iostream&gt;
-        <span class="keyword">#include</span> &lt;map&gt;
-        <span class="keyword">#include</span> &lt;vector&gt;
-        
-        <span class="keyword">int</span> main(<span class="keyword">int</span> argc, <span class="keyword">const char</span>* argv[])
-        {
-            <span class="keyword">using namespace</span> boost::assign;
-            <span class="keyword">using namespace</span> boost::adaptors;
-            
-            std::map&lt;<span class="keyword">int</span>,<span class="keyword">int</span>&gt; input;
-            <span class="keyword">for</span> (<span class="keyword">int</span> i = 0; i < 10; ++i)
-                input.insert(std::make_pair(i, i * 10));
-                
-            boost::copy(
-                input | map_keys,
-                std::ostream_iterator&lt;<span class="keyword">int</span>&gt;(std::cout, ","));
-                
-            <span class="keyword">return</span> 0;
-        }
-    </pre>
-    <p>
-        This produces the output: <br />
-        <code>
-        0,1,2,3,4,5,6,7,8,9
-        </code>
-    </p>
-    
-    <hr />
-    <p>
-    (C) Copyright Neil Groves 2009
-    (C) Copyright Thorsten Ottosen 2003-2004
-    </p>
-
-    <br />
-    <br />
-    <br />
-    <br />
-    <br />
-    <br />
-    <br />
-    <br />
-    <br />
-    <br />
-    <br />
-    <br />
-    </body>
-</html>
-
diff --git a/doc/reference/adaptors/map_values.html b/doc/reference/adaptors/map_values.html
deleted file mode 100755
index bc3c165..0000000
--- a/doc/reference/adaptors/map_values.html
+++ /dev/null
@@ -1,98 +0,0 @@
-<!DOCTYPE HTML PUBLIC "-//W3C//DTD HTML 3.2//EN">
-
-<html>
-<head>
-    <meta http-equiv="Content-Type" content="text/html; charset=ISO-8859-1">
-    <title>Boost.Range Range Adaptors </title>
-    <link rel="stylesheet" href="../style.css" type="text/css">
-</head>
-
-    <body>
-
-    <table border="0" >
-        <tr>
-            <td ><img src="../../../boost.png" border="0" /></td>
-            <td ><h1 align="center">Boost.Range </h1></td>
-        </tr>
-    </table>
-
-    <h2> Range Adaptors </h2>
-    
-    <hr />
-    <a name="map_values"></a>
-    <h4><code>map_values</code></h4>
-    <blockquote>
-        <pre>rng | boost::adaptors::map_values</pre>
-        <pre>boost::make_map_value_range( rng )</pre>
-    </blockquote>
-    <ul>
-        <li>
-            <b>Precondition:</b>
-            The value-type of the range is an instantiation of std::pair.
-        </li>
-        <li>
-            <b>Postcondition:</b>
-            For all elements <code>x</code> in the returned range,
-            <code>x</code> is the result of <code>y.second</code> where
-            <code>y</code> is the corresponding element in the original range.
-        </li>    
-        <li>
-            <b>Range Category:</b>
-            SinglePassRange
-        </li>
-    </ul>
-    <hr />
-    <h3>Example</h3>
-    <pre>
-        <span class="keyword">#include</span> &lt;boost/range/adaptor/map.hpp&gt;
-        <span class="keyword">#include</span> &lt;boost/range/algorithm/copy.hpp&gt;
-        <span class="keyword">#include</span> &lt;boost/assign.hpp&gt;
-        <span class="keyword">#include</span> &lt;algorithm&gt;
-        <span class="keyword">#include</span> &lt;iostream&gt;
-        <span class="keyword">#include</span> &lt;map&gt;
-        <span class="keyword">#include</span> &lt;vector&gt;
-        
-        <span class="keyword">int</span> main(<span class="keyword">int</span> argc, <span class="keyword">const char</span>* argv[])
-        {
-            <span class="keyword">using namespace</span> boost::assign;
-            <span class="keyword">using namespace</span> boost::adaptors;
-            
-            std::map&lt;<span class="keyword">int</span>,<span class="keyword">int</span>&gt; input;
-            <span class="keyword">for</span> (<span class="keyword">int</span> i = 0; i < 10; ++i)
-                input.insert(std::make_pair(i, i * 10));
-                
-            boost::copy(
-                input | map_values,
-                std::ostream_iterator&lt;<span class="keyword">int</span>&gt;(std::cout, ","));
-                
-            <span class="keyword">return</span> 0;
-        }
-    </pre>
-    <p>
-        This produces the output: <br />
-        <code>
-        0,10,20,30,40,50,60,70,80,90
-        </code>
-    </p>
-    
-    <hr />
-    <p>
-    (C) Copyright Neil Groves 2009
-    (C) Copyright Thorsten Ottosen 2003-2004
-    </p>
-
-    <br />
-    <br />
-    <br />
-    <br />
-    <br />
-    <br />
-    <br />
-    <br />
-    <br />
-    <br />
-    <br />
-    <br />
-    </body>
-</html>
-
diff --git a/doc/reference/adaptors/replaced.html b/doc/reference/adaptors/replaced.html
deleted file mode 100755
index 861277f..0000000
--- a/doc/reference/adaptors/replaced.html
+++ /dev/null
@@ -1,107 +0,0 @@
-<!DOCTYPE HTML PUBLIC "-//W3C//DTD HTML 3.2//EN">
-
-<html>
-<head>
-    <meta http-equiv="Content-Type" content="text/html; charset=ISO-8859-1">
-    <title>Boost.Range Range Adaptors </title>
-    <link rel="stylesheet" href="../style.css" type="text/css">
-</head>
-
-    <body>
-
-    <table border="0" >
-        <tr>
-            <td ><img src="../../../boost.png" border="0" /></td>
-            <td ><h1 align="center">Boost.Range </h1></td>
-        </tr>
-    </table>
-
-    <h2> Range Adaptors </h2>
-    
-    <hr />
-    <a name="replaced"></a>
-    <h4><code>replaced</code></h4>
-    <blockquote>
-        <pre>rng | boost::adaptors::replaced( new_value, old_value )</pre>
-        <pre>boost::make_replaced_range( rng, new_value, old_value )</pre>
-    </blockquote>
-    <ul>
-        <li>
-            <b>Precondition:</b>
-            <ul>
-                <li>
-                    <code>new_value</code> is convertible to the value-type of
-                    the range.
-                </li>
-                <li>
-                    <code>old_value</code> is convertible to the value-type of
-                    the range.
-                </li>
-            </ul>
-        </li>
-        <li>
-            <b>Postcondition:</b>
-            For all elements <code>x</code> in the returned range, the value
-            <code>x</code> is equal to the value of
-            <code>(y == old_value) ? new_value : y</code>
-            where <code>y</code> is the corresponding element in the original
-            range.
-        </li>
-        <li>
-            <b>Range Category:</b>
-            ForwardRange
-        </li>
-    </ul>
-    <hr />
-    <h3>Example</h3>
-    <pre>
-        <span class="keyword">#include</span> &lt;boost/range/adaptor/replaced.hpp&gt;
-        <span class="keyword">#include</span> &lt;boost/range/algorithm/copy.hpp&gt;
-        <span class="keyword">#include</span> &lt;boost/assign.hpp&gt;
-        <span class="keyword">#include</span> &lt;algorithm&gt;
-        <span class="keyword">#include</span> &lt;iostream&gt;
-        <span class="keyword">#include</span> &lt;vector&gt;
-        
-        <span class="keyword">int</span> main(<span class="keyword">int</span> argc, <span class="keyword">const char</span>* argv[])
-        {
-            <span class="keyword">using namespace</span> boost::adaptors;
-            <span class="keyword">using namespace</span> boost::assign;
-            
-            std::vector&lt;<span class="keyword">int</span>&gt; input;
-            input += 1,2,3,2,5,2,7,2,9;
-            
-            boost::copy(
-                input | replaced(2, 10),
-                std::ostream_iterator&lt;<span class="keyword">int</span>&gt;(std::cout, ","));
-                
-            <span class="keyword">return</span> 0;
-        }
-    </pre>
-    <p>
-    This produces the output: <br />
-    <code>
-    1,10,3,10,5,10,7,10,9
-    </code>
-    </p>
-    
-    <hr />
-    <p>
-    (C) Copyright Neil Groves 2009
-    (C) Copyright Thorsten Ottosen 2003-2004
-    </p>
-
-    <br />
-    <br />
-    <br />
-    <br />
-    <br />
-    <br />
-    <br />
-    <br />
-    <br />
-    <br />
-    <br />
-    <br />
-    </body>
-</html>
-
diff --git a/doc/reference/adaptors/replaced_if.html b/doc/reference/adaptors/replaced_if.html
deleted file mode 100755
index cde3678..0000000
--- a/doc/reference/adaptors/replaced_if.html
+++ /dev/null
@@ -1,114 +0,0 @@
-<!DOCTYPE HTML PUBLIC "-//W3C//DTD HTML 3.2//EN">
-
-<html>
-<head>
-    <meta http-equiv="Content-Type" content="text/html; charset=ISO-8859-1">
-    <title>Boost.Range Range Adaptors </title>
-    <link rel="stylesheet" href="../style.css" type="text/css">
-</head>
-
-    <body>
-
-    <table border="0" >
-        <tr>
-            <td ><img src="../../../boost.png" border="0" /></td>
-            <td ><h1 align="center">Boost.Range </h1></td>
-        </tr>
-    </table>
-
-    <h2> Range Adaptors </h2>
-    
-    <hr />
-    <a name="replaced_if"></a>
-    <h4><code>replaced_if</code></h4>
-    <blockquote>
-        <pre>rng | boost::adaptors::replaced_if( pred, new_value )</pre>
-        <pre>boost::make_replaced_if_range( rng, pred, new_value )</pre>
-    </blockquote>
-    <ul>
-        <li>
-            <b>Precondition:</b>
-            <ul>
-                <li>
-                    The range value-type is convertible to the argument type
-                    of <code>pred</code>.
-                </li>
-                <li>
-                    <code>new_value</code> is convertible to the value-type
-                    of the range.
-                </li>
-            </ul>
-        </li>
-        <li>
-            <b>Postconditions:</b>
-            For all elements <code>[x]</code> in the returned range, the value
-            <code>x</code> is equal to the value of
-            <code>pred(y) ? new_value : y</code>
-            where <code>y</code> is the corresponding element in the original
-            range.
-        </li>
-        <li>
-            <b>Range Category:</b>
-            ForwardRange
-        </li>
-    </ul>
-    
-    <hr />
-    <h3>Example</h3>
-    <pre>
-        <span class="keyword">#include</span> &lt;boost/range/adaptor/replaced_if.hpp&gt;
-        <span class="keyword">#include</span> &lt;boost/range/algorithm/copy.hpp&gt;
-        <span class="keyword">#include</span> &lt;boost/assign.hpp&gt;
-        <span class="keyword">#include</span> &lt;algorithm&gt;
-        <span class="keyword">#include</span> &lt;iostream&gt;
-        <span class="keyword">#include</span> &lt;vector&gt;
-        
-        <span class="keyword">struct</span> is_even
-        {
-            <span class="keyword">bool operator</span>()(<span class="keyword">int</span> x) <span class="keyword">const</span> { <span class="keyword">return</span> x % 2 == 0; }
-        };
-        
-        <span class="keyword">int</span> main(<span class="keyword">int</span> argc, <span class="keyword">const char</span>* argv[])
-        {
-            <span class="keyword">using namespace</span> boost::adaptors;
-            <span class="keyword">using namespace</span> boost::assign;
-            
-            std::vector&lt;<span class="keyword">int</span>&gt; input;
-            input += 1,2,3,4,5,6,7,8,9;
-            
-            boost::copy(
-                input | replaced_if(is_even(), 10),
-                std::ostream_iterator&lt;<span class="keyword">int</span>&gt;(std::cout, ","));
-                
-            <span class="keyword">return</span> 0;
-        }
-        
-    </pre>
-    <p>
-        This produces the output: <br />
-        <code>
-        1,10,3,10,5,10,7,10,9
-        </code>
-    </p>
-    
-    <hr />
-    <p>
-    (C) Copyright Neil Groves 2009
-    (C) Copyright Thorsten Ottosen 2003-2004
-    </p>
-
-    <br />
-    <br />
-    <br />
-    <br />
-    <br />
-    <br />
-    <br />
-    <br />
-    <br />
-    <br />
-    <br />
-    <br />
-    </body>
-</html>
-
diff --git a/doc/reference/adaptors/reversed.html b/doc/reference/adaptors/reversed.html
deleted file mode 100755
index 0aea1ee..0000000
--- a/doc/reference/adaptors/reversed.html
+++ /dev/null
@@ -1,91 +0,0 @@
-<!DOCTYPE HTML PUBLIC "-//W3C//DTD HTML 3.2//EN">
-
-<html>
-<head>
-    <meta http-equiv="Content-Type" content="text/html; charset=ISO-8859-1">
-    <title>Boost.Range Range Adaptors </title>
-    <link rel="stylesheet" href="../style.css" type="text/css">
-</head>
-
-    <body>
-
-    <table border="0" >
-        <tr>
-            <td ><img src="../../../boost.png" border="0" /></td>
-            <td ><h1 align="center">Boost.Range </h1></td>
-        </tr>
-    </table>
-
-    <h2> Range Adaptors </h2>
-    
-    <hr />
-    <a name="reversed"></a>
-    <h4><code>reversed</code></h4>
-    <blockquote>
-        <pre>rng | boost::adaptors::reversed</pre>
-        <pre>boost::make_reversed_range( rng )</pre>
-    </blockquote>
-    <ul>
-        <li>
-            <b>Returns:</b>
-            A range whose iterators behave as if they were the original
-            iterators wrapped in <code>reverse_iterator</code>.
-        </li>
-        <li>
-            <b>Range Category:</b>
-            BidirectionalRange
-        </li>
-    </ul>
-    <hr />
-    <h3>Example</h3>
-    <pre>
-        <span class="keyword">#include</span> &lt;boost/range/adaptor/reversed.hpp&gt;
-        <span class="keyword">#include</span> &lt;boost/range/algorithm/copy.hpp&gt;
-        <span class="keyword">#include</span> &lt;boost/assign.hpp&gt;
-        <span class="keyword">#include</span> &lt;algorithm&gt;
-        <span class="keyword">#include</span> &lt;iostream&gt;
-        <span class="keyword">#include</span> &lt;vector&gt;
-        
-        <span class="keyword">int</span> main(<span class="keyword">int</span> argc, <span class="keyword">const char</span>* argv[])
-        {
-            <span class="keyword">using namespace</span> boost::adaptors;
-            <span class="keyword">using namespace</span> boost::assign;
-            
-            std::vector&lt;<span class="keyword">int</span>&gt; input;
-            input += 1,2,3,4,5,6,7,8,9;
-            
-            boost::copy(
-                input | reversed,
-                std::ostream_iterator&lt;<span class="keyword">int</span>&gt;(std::cout, ","));
-                
-            <span class="keyword">return</span> 0;
-        }
-    </pre>
-    <p>
-        This produces the output: <br />
-        <code>
-            9,8,7,6,5,4,3,2,1
-        </code>
-    </p>
-    
-    <hr />
-    <p>
-    (C) Copyright Neil Groves 2009
-    (C) Copyright Thorsten Ottosen 2003-2004
-    </p>
-
-    <br />
-    <br />
-    <br />
-    <br />
-    <br />
-    <br />
-    <br />
-    <br />
-    <br />
-    <br />
-    <br />
-    <br />
-    </body>
-</html>
-
diff --git a/doc/reference/adaptors/sliced.html b/doc/reference/adaptors/sliced.html
deleted file mode 100755
index d979392..0000000
--- a/doc/reference/adaptors/sliced.html
+++ /dev/null
@@ -1,94 +0,0 @@
-<!DOCTYPE HTML PUBLIC "-//W3C//DTD HTML 3.2//EN">
-
-<html>
-<head>
-    <meta http-equiv="Content-Type" content="text/html; charset=ISO-8859-1">
-    <title>Boost.Range Range Adaptors </title>
-    <link rel="stylesheet" href="../style.css" type="text/css">
-</head>
-
-    <body>
-
-    <table border="0" >
-        <tr>
-            <td ><img src="../../../boost.png" border="0" /></td>
-            <td ><h1 align="center">Boost.Range </h1></td>
-        </tr>
-    </table>
-
-    <h2> Range Adaptors </h2>
-    
-    <hr />
-    <a name="sliced"></a>
-    <h4><code>sliced</code></h4>
-    <blockquote>
-        <pre>rng | boost::adaptors::sliced( n, m )</pre>
-        <pre>boost::make_sliced_range( rng, n, m )</pre>
-    </blockquote>
-    <ul>
-        <li>
-            <b>Precondition:</b>
-            <code>0 <= n && n <= m && m < distance(rng)</code>
-        </li>
-        <li>
-            <b>Returns:</b>
-            <code>make_range(rng, n, m)</code>
-        </li>
-        <li>
-            <b>Range Category:</b>
-            RandomAccessRange
-        </li>
-    </ul>
-    <hr />
-    <h3>Example</h3>
-    <pre>
-        <span class="keyword">#include</span> &lt;boost/range/adaptor/sliced.hpp&gt;
-        <span class="keyword">#include</span> &lt;boost/range/algorithm/copy.hpp&gt;
-        <span class="keyword">#include</span> &lt;boost/assign.hpp&gt;
-        <span class="keyword">#include</span> &lt;algorithm&gt;
-        <span class="keyword">#include</span> &lt;iostream&gt;
-        <span class="keyword">#include</span> &lt;vector&gt;
-        
-        <span class="keyword">int</span> main(<span class="keyword">int</span> argc, <span class="keyword">const char</span>* argv[])
-        {
-            <span class="keyword">using namespace</span> boost::adaptors;
-            <span class="keyword">using namespace</span> boost::assign;
-            
-            std::vector&lt;<span class="keyword">int</span>&gt; input;
-            input += 1,2,3,4,5,6,7,8,9;
-            
-            boost::copy(
-                input | sliced(2, 5),
-                std::ostream_iterator&lt;<span class="keyword">int</span>&gt;(std::cout, ","));
-                
-            <span class="keyword">return</span> 0;
-        }
-    </pre>
-    <p>
-        This produces the output: <br />
-        <code>
-            3,4,5
-        </code>
-    </p>
-    
-    <hr />
-    <p>
-    (C) Copyright Neil Groves 2009
-    (C) Copyright Thorsten Ottosen 2003-2004
-    </p>
-
-    <br />
-    <br />
-    <br />
-    <br />
-    <br />
-    <br />
-    <br />
-    <br />
-    <br />
-    <br />
-    <br />
-    <br />
-    </body>
-</html>
-
diff --git a/doc/reference/adaptors/strided.html b/doc/reference/adaptors/strided.html
deleted file mode 100755
index 3e23af5..0000000
--- a/doc/reference/adaptors/strided.html
+++ /dev/null
@@ -1,94 +0,0 @@
-<!DOCTYPE HTML PUBLIC "-//W3C//DTD HTML 3.2//EN">
-
-<html>
-<head>
-    <meta http-equiv="Content-Type" content="text/html; charset=ISO-8859-1">
-    <title>Boost.Range Range Adaptors </title>
-    <link rel="stylesheet" href="../style.css" type="text/css">
-</head>
-
-    <body>
-
-    <table border="0" >
-        <tr>
-            <td ><img src="../../../boost.png" border="0" /></td>
-            <td ><h1 align="center">Boost.Range </h1></td>
-        </tr>
-    </table>
-
-    <h2> Range Adaptors </h2>
-    
-    <hr />
-    <a name="strided"></a>
-    <h4><code>strided</code></h4>
-    <blockquote>
-        <pre>rng | boost::adaptors::strided( n )</pre>
-        <pre>boost::make_strided_range( rng, n )</pre>
-    </blockquote>
-    <ul>
-        <li>
-            <b>Precondition:</b>
-            <code>0 <= n && n &lt;= distance(rng)</code>
-        </li>
-        <li>
-            <b>Returns:</b>
-            A new range based on <code>rng</code> where traversal is performed in steps of <code>n</code>.
-        </li>
-        <li>
-            <b>Range Category:</b>
-            RandomAccessRange
-        </li>
-    </ul>
-    <hr />
-    <h3>Example</h3>
-    <pre>
-        <span class="keyword">#include</span> &lt;boost/range/adaptor/strided.hpp&gt;
-        <span class="keyword">#include</span> &lt;boost/range/algorithm/copy.hpp&gt;
-        <span class="keyword">#include</span> &lt;boost/assign.hpp&gt;
-        <span class="keyword">#include</span> &lt;algorithm&gt;
-        <span class="keyword">#include</span> &lt;iostream&gt;
-        <span class="keyword">#include</span> &lt;vector&gt;
-        
-        <span class="keyword">int</span> main(<span class="keyword">int</span> argc, <span class="keyword">const char</span>* argv[])
-        {
-            <span class="keyword">using namespace</span> boost::adaptors;
-            <span class="keyword">using namespace</span> boost::assign;
-            
-            std::vector&lt;<span class="keyword">int</span>&gt; input;
-            input += 1,2,3,4,5,6,7,8,9,10;
-            
-            boost::copy(
-                input | strided(2),
-                std::ostream_iterator&lt;<span class="keyword">int</span>&gt;(std::cout, ","));
-                
-            <span class="keyword">return</span> 0;
-        }
-    </pre>
-    <p>
-        This produces the output:
-        <code>
-            1,3,5,7,9
-        </code>
-    </p>
-    
-    <hr />
-    <p>
-    (C) Copyright Neil Groves 2009
-    (C) Copyright Thorsten Ottosen 2003-2004
-    </p>
-
-    <br />
-    <br />
-    <br />
-    <br />
-    <br />
-    <br />
-    <br />
-    <br />
-    <br />
-    <br />
-    <br />
-    <br />
-    </body>
-</html>
-
diff --git a/doc/reference/adaptors/tokenized.html b/doc/reference/adaptors/tokenized.html
deleted file mode 100755
index 304e91d..0000000
--- a/doc/reference/adaptors/tokenized.html
+++ /dev/null
@@ -1,118 +0,0 @@
-<!DOCTYPE HTML PUBLIC "-//W3C//DTD HTML 3.2//EN">
-
-<html>
-<head>
-    <meta http-equiv="Content-Type" content="text/html; charset=ISO-8859-1">
-    <title>Boost.Range Range Adaptors </title>
-    <link rel="stylesheet" href="../style.css" type="text/css">
-</head>
-
-    <body>
-
-    <table border="0" >
-        <tr>
-            <td ><img src="../../../boost.png" border="0" /></td>
-            <td ><h1 align="center">Boost.Range </h1></td>
-        </tr>
-    </table>
-
-    <h2> Range Adaptors </h2>
-    
-    <hr />
-    <a name="tokenized"></a>
-    <h4><code>tokenized</code></h4>
-    <blockquote>
-        <pre>rng | boost::adaptors::tokenized( regex )</pre>
-        <pre>rng | boost::adaptors::tokenized( regex, i )</pre>
-        <pre>rng | boost::adaptors::tokenized( regex, rndRng )</pre>
-        <pre>rng | boost::adaptors::tokenized( regex, i, flags )</pre>
-        <pre>rng | boost::adaptors::tokenized( regex, rndRng, flags )</pre>
-        <pre>boost::make_tokenized_range( rng, regex, i, flags )</pre>
-        <pre>boost::make_tokenized_range( rng, regex, rngRng, flags )</pre>
-    </blockquote>
-    <ul>
-        <li>
-            <b>Precondition:</b>
-            <ul>
-                <li>
-                    Let <code>T</code> denote
-                    <code>typename range_value< decltype(rng) >::type</code>,
-                    then <code>regex</code> has the type
-                    <code>basic_regex&lt;T&gt;</code> or is
-                    implicitly convertible to one of these types.
-                </li>
-                <li>
-                    <code>i</code> has the type <code>int</code>.
-                </li>
-                <li>
-                    the value-type of <code>rndRng</code> is <code>int</code>.
-                </li>
-                <li>
-                    <code>flags</code> has the type
-                    <code>regex_constants::syntax_option_type</code>.
-                </li>
-            </ul>
-        </li>
-        <li>
-            <b>Returns:</b>
-            A range whose iterators behave as if they were the
-            original iterators wrapped in <code>regex_token_iterator</code>.
-            The first iterator in the range would be constructed by
-            forwarding all the arguments of <code>tokenized()</code> to the
-            <code>regex_token_iterator</code> constructor.
-        </li>
-        <li>
-            <b>Throws:</b>
-            Whatever constructing and copying equivalent
-            <code>regex_token_iterator</code>s might throw.
-        </li>
-        <li>
-            <b>Range Category:</b>
-            RandomAccessRange
-        </li>
-    </ul>
-    <hr />
-    <h3>Example</h3>
-    <pre>
-        <span class="keyword">#include</span> &lt;boost/range/adaptor/tokenized.hpp&gt;
-        <span class="keyword">#include</span> &lt;boost/range/algorithm_ext/push_back.hpp&gt;
-        <span class="keyword">#include</span> &lt;boost/assert.hpp&gt;
-        <span class="keyword">#include</span> &lt;algorithm&gt;
-        <span class="keyword">#include</span> &lt;string&gt;
-        <span class="keyword">#include</span> &lt;vector&gt;
-        
-        <span class="keyword">int</span> main(<span class="keyword">int</span> argc, <span class="keyword">const char</span>* argv)
-        {
-            <span class="keyword">using namespace</span> 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 );
-            
-            <span class="keyword">return</span> 0;
-        }
-    </pre>
-    
-    <hr />
-    <p>
-    (C) Copyright Neil Groves 2009
-    (C) Copyright Thorsten Ottosen 2003-2004
-    </p>
-
-    <br />
-    <br />
-    <br />
-    <br />
-    <br />
-    <br />
-    <br />
-    <br />
-    <br />
-    <br />
-    <br />
-    <br />
-    </body>
-</html>
-
diff --git a/doc/reference/adaptors/transformed.html b/doc/reference/adaptors/transformed.html
deleted file mode 100755
index 4069f9a..0000000
--- a/doc/reference/adaptors/transformed.html
+++ /dev/null
@@ -1,107 +0,0 @@
-<!DOCTYPE HTML PUBLIC "-//W3C//DTD HTML 3.2//EN">
-
-<html>
-<head>
-    <meta http-equiv="Content-Type" content="text/html; charset=ISO-8859-1">
-    <title>Boost.Range Range Adaptors </title>
-    <link rel="stylesheet" href="../style.css" type="text/css">
-</head>
-
-    <body>
-
-    <table border="0" >
-        <tr>
-            <td ><img src="../../../boost.png" border="0" /></td>
-            <td ><h1 align="center">Boost.Range </h1></td>
-        </tr>
-    </table>
-
-    <h2> Range Adaptors </h2>
-    
-    <hr />
-    <a name="transformed"></a>
-    <h4><code>transformed</code></h4>
-    <blockquote>
-        <pre>rng | boost::adaptors::transformed( fun )</pre>
-        <pre>boost::make_transformed_range( rng, fun )</pre>
-    </blockquote>
-    <ul>
-        <li>
-            <b>Precondition:</b>
-            The value-type of the range is convertible to the argument type
-            of fun.
-        </li>
-        <li>
-            <b>Postcondition:</b>
-            For all elements <code>x</code> in the returned range, 
-            <code>x</code> is the result of <code>fun(y)</code> where
-            <code>y</code> is the corresponding element in the original range.
-        </li>
-        <li>
-            <b>Throws:</b>
-            Whatever the copy-constructor of <code>fun</code> might throw.
-        </li>
-        <li>
-            <b>Range Category:</b>
-            SinglePassRange
-        </li>
-    </ul>
-    <hr />
-    <h3>Example</h3>
-    <pre>
-        <span class="keyword">#include</span> &lt;boost/range/adaptor/transformed.hpp&gt;
-        <span class="keyword">#include</span> &lt;boost/range/algorithm/copy.hpp&gt;
-        <span class="keyword">#include</span> &lt;boost/range/assign.hpp&gt;
-        <span class="keyword">#include</span> &lt;algorithm&gt;
-        <span class="keyword">#include</span> &lt;iostream&gt;
-        <span class="keyword">#include</span> &lt;vector&gt;
-        
-        <span class="keyword">struct</span> double_int
-        {
-            <span class="keyword">typedef int</span> result_type;
-            <span class="keyword">int operator</span>()(<span class="keyword">int</span> x) <span class="keyword">const</span> { <span class="keyword">return</span> x * 2; }
-        };
-        
-        <span class="keyword">int</span> main(<span class="keyword">int</span> argc, <span class="keyword">const char</span>* argv[])
-        {
-            <span class="keyword">using namespace</span> boost::adaptors;
-            <span class="keyword">using namespace</span> boost::assign;
-            
-            std::vector&lt;<span class="keyword">int</span>&gt; input;
-            input += 1,2,3,4,5,6,7,8,9,10;
-            
-            boost::copy(
-                input | transformed(double_int()),
-                std::ostream_iterator&lt;int&gt;(std::cout, ","));
-                
-            <span class="keyword">return</span> 0;
-        }
-    </pre>
-    <p>
-        This produces the output: <br />
-        <code>
-            2,4,6,8,10,12,14,16,18,20
-        </code>
-    </p>
-    
-    <hr />
-    <p>
-    (C) Copyright Neil Groves 2009
-    (C) Copyright Thorsten Ottosen 2003-2004
-    </p>
-
-    <br />
-    <br />
-    <br />
-    <br />
-    <br />
-    <br />
-    <br />
-    <br />
-    <br />
-    <br />
-    <br />
-    <br />
-    </body>
-</html>
-
diff --git a/doc/reference/adaptors/uniqued.html b/doc/reference/adaptors/uniqued.html
deleted file mode 100755
index 43ca130..0000000
--- a/doc/reference/adaptors/uniqued.html
+++ /dev/null
@@ -1,95 +0,0 @@
-<!DOCTYPE HTML PUBLIC "-//W3C//DTD HTML 3.2//EN">
-
-<html>
-<head>
-    <meta http-equiv="Content-Type" content="text/html; charset=ISO-8859-1">
-    <title>Boost.Range Range Adaptors </title>
-    <link rel="stylesheet" href="../style.css" type="text/css">
-</head>
-
-    <body>
-
-    <table border="0" >
-        <tr>
-            <td ><img src="../../../boost.png" border="0" /></td>
-            <td ><h1 align="center">Boost.Range </h1></td>
-        </tr>
-    </table>
-
-    <h2> Range Adaptors </h2>
-    
-    <hr />
-    <a name="uniqued"></a>
-    <h4><code>uniqued</code></h4>
-    <blockquote>
-        <pre>rng | boost::adaptors::uniqued</pre>
-        <pre>boost::make_uniqued_range( rng )</pre>
-    </blockquote>
-    <ul>
-        <li>
-            <b>Precondition:</b>
-            The value-type of the range is comparable with
-            <code>operator==()</code>.
-        </li>
-        <li>
-            <b>Postcondition:</b>
-            For all adjacent elements <code>[x,y]</code> in the returned range,
-            <code>x==y</code> is false.
-        </li>
-        <li>
-            <b>Range Category:</b>
-            ForwardRange
-        </li>
-    </ul>
-    
-    <hr />
-    <h3>Example</h3>
-    
-    <pre>
-    #include &lt;boost/range/adaptor/uniqued.hpp&gt;
-    #include &lt;boost/range/algorithm/copy.hpp&gt;
-    #include &lt;boost/assign.hpp&gt;
-    #include &lt;algorithm&gt;
-    #include &lt;iostream&gt;
-    #include &lt;vector&gt;
-    
-    int main(int argc, const char* argv)
-    {
-        using namespace boost::assign;
-        using namespace boost::adaptors;
-        
-        std::vector&lt;int&gt; input;
-	input += 1,1,2,2,2,3,4,5,6;
-        
-	boost::copy(
-	    input | uniqued,
-            std::ostream_iterator&lt;int&gt;(std::cout, ",") );
-         
-        return 0;
-    }
-   </pre>
-   <p>
-        This would produce the output:<br />
-        <code>1,2,3,4,5,6</code><br />
-    </p>
-    <hr />
-    <p>
-    (C) Copyright Neil Groves 2009
-    (C) Copyright Thorsten Ottosen 2003-2004
-    </p>
-
-    <br />
-    <br />
-    <br />
-    <br />
-    <br />
-    <br />
-    <br />
-    <br />
-    <br />
-    <br />
-    <br />
-    <br />
-    </body>
-</html>
-
diff --git a/include/boost/range/adaptor/adjacent_filtered.hpp b/include/boost/range/adaptor/adjacent_filtered.hpp
index c01f1c1..f63a599 100644
--- a/include/boost/range/adaptor/adjacent_filtered.hpp
+++ b/include/boost/range/adaptor/adjacent_filtered.hpp
@@ -27,7 +27,6 @@
 
 namespace boost
 {
-
     namespace range_detail
     {
         template< class Iter, class Pred, bool default_pass >
@@ -140,10 +139,14 @@ namespace boost
 
         public:
             adjacent_filter_range( const P& p, R& r )
-            : base_range( skip_iter( boost::begin(r), boost::end(r), p),
-                          skip_iter( boost::end(r), boost::end(r), p) )
+            : base_range(skip_iter(boost::begin(r), boost::end(r), p),
+                         skip_iter(boost::end(r), boost::end(r), p))
             {
             }
+
+        private:
+            P m_pred;
+            R* m_range;
         };
 
         template< class T >
diff --git a/include/boost/range/adaptor/map.hpp b/include/boost/range/adaptor/map.hpp
index a8a2c20..6d08ea7 100755
--- a/include/boost/range/adaptor/map.hpp
+++ b/include/boost/range/adaptor/map.hpp
@@ -25,9 +25,9 @@ namespace boost
         template< class Map >
         struct select_first
         {
-            typedef BOOST_DEDUCED_TYPENAME Map::value_type pair_t;
-            typedef const BOOST_DEDUCED_TYPENAME pair_t::first_type& 
-                result_type;  
+            typedef BOOST_DEDUCED_TYPENAME range_value<Map>::type pair_t;
+            typedef const BOOST_DEDUCED_TYPENAME pair_t::first_type&
+                result_type;
 
             result_type operator()( const pair_t& r ) const
             {
@@ -38,8 +38,8 @@ namespace boost
         template< class Map >
         struct select_second_mutable
         {
-            typedef BOOST_DEDUCED_TYPENAME Map::value_type pair_t;
-            typedef BOOST_DEDUCED_TYPENAME pair_t::second_type& result_type;  
+            typedef BOOST_DEDUCED_TYPENAME range_value<Map>::type pair_t;
+            typedef BOOST_DEDUCED_TYPENAME pair_t::second_type& result_type;
 
             result_type operator()( pair_t& r ) const
             {
@@ -50,16 +50,16 @@ namespace boost
         template< class Map >
         struct select_second_const
         {
-            typedef BOOST_DEDUCED_TYPENAME Map::value_type pair_t;
-            typedef const BOOST_DEDUCED_TYPENAME pair_t::second_type& 
-                result_type;  
-            
+            typedef BOOST_DEDUCED_TYPENAME range_value<Map>::type pair_t;
+            typedef const BOOST_DEDUCED_TYPENAME pair_t::second_type&
+                result_type;
+
             result_type operator()( const pair_t& r ) const
             {
                 return r.second;
             }
         };
-        
+
         template<class StdPairRng>
         class select_first_range
             : public transform_range<
@@ -78,7 +78,7 @@ namespace boost
 
             select_first_range(const base& other) : base(other) {}
         };
-        
+
         template<class StdPairRng>
         class select_second_mutable_range
             : public transform_range<
@@ -97,7 +97,7 @@ namespace boost
 
             select_second_mutable_range(const base& other) : base(other) {}
         };
-        
+
         template<class StdPairRng>
         class select_second_const_range
             : public transform_range<
@@ -116,20 +116,20 @@ namespace boost
 
             select_second_const_range(const base& other) : base(other) {}
         };
-        
+
         template< class StdPairRng >
-        inline select_first_range<StdPairRng> 
+        inline select_first_range<StdPairRng>
         operator|( const StdPairRng& r, map_keys_forwarder )
         {
-            return operator|( r, 
+            return operator|( r,
               boost::adaptors::transformed( select_first<StdPairRng>() ) );
         }
 
         template< class StdPairRng >
-        inline select_second_mutable_range<StdPairRng> 
+        inline select_second_mutable_range<StdPairRng>
         operator|( StdPairRng& r, map_values_forwarder )
         {
-            return operator|( r, 
+            return operator|( r,
           boost::adaptors::transformed( select_second_mutable<StdPairRng>() ) );
         }
 
@@ -137,27 +137,27 @@ namespace boost
         inline select_second_const_range<StdPairRng>
         operator|( const StdPairRng& r, map_values_forwarder )
         {
-            return operator|( r, 
-           boost::adaptors::transformed( select_second_const<StdPairRng>() ) ); 
+            return operator|( r,
+           boost::adaptors::transformed( select_second_const<StdPairRng>() ) );
         }
-        
+
     } // 'range_detail'
-    
+
     using range_detail::select_first_range;
     using range_detail::select_second_mutable_range;
     using range_detail::select_second_const_range;
 
     namespace adaptors
-    { 
+    {
         namespace
         {
-            const range_detail::map_keys_forwarder map_keys = 
+            const range_detail::map_keys_forwarder map_keys =
                                             range_detail::map_keys_forwarder();
 
-            const range_detail::map_values_forwarder map_values = 
+            const range_detail::map_values_forwarder map_values =
                                            range_detail::map_values_forwarder();
         }
-        
+
         template<class StdPairRange>
         inline select_first_range<StdPairRange>
         keys(const StdPairRange& rng)
@@ -165,7 +165,7 @@ namespace boost
             return select_first_range<StdPairRange>(
                 range_detail::select_first<StdPairRange>(), rng );
         }
-        
+
         template<class StdPairRange>
         inline select_second_const_range<StdPairRange>
         values(const StdPairRange& rng)
@@ -173,7 +173,7 @@ namespace boost
             return select_second_const_range<StdPairRange>(
                 range_detail::select_second_const<StdPairRange>(), rng );
         }
-        
+
         template<class StdPairRange>
         inline select_second_mutable_range<StdPairRange>
         values(StdPairRange& rng)
@@ -182,7 +182,7 @@ namespace boost
                 range_detail::select_second_mutable<StdPairRange>(), rng );
         }
     } // 'adaptors'
-    
+
 }
 
 #endif
diff --git a/include/boost/range/adaptor/replaced.hpp b/include/boost/range/adaptor/replaced.hpp
index 3c40918..deeb8da 100644
--- a/include/boost/range/adaptor/replaced.hpp
+++ b/include/boost/range/adaptor/replaced.hpp
@@ -47,7 +47,7 @@ namespace boost
         };
 
         template< class R >
-        class replace_range :
+        class replaced_range :
             public boost::iterator_range<
                 boost::transform_iterator<
                     replace_value< BOOST_DEDUCED_TYPENAME range_value<R>::type >,
@@ -64,7 +64,7 @@ namespace boost
         public:
             typedef BOOST_DEDUCED_TYPENAME range_value<R>::type value_type;
 
-            replace_range( R& r, value_type from, value_type to )
+            replaced_range( R& r, value_type from, value_type to )
                 : base_t( make_transform_iterator( boost::begin(r), Fn(from, to) ),
                           make_transform_iterator( boost::end(r), Fn(from, to) ) )
             { }
@@ -83,23 +83,23 @@ namespace boost
         };
 
         template< class InputRng >
-        inline replace_range<InputRng>
+        inline replaced_range<InputRng>
         operator|( InputRng& r,
                    const replace_holder<BOOST_DEDUCED_TYPENAME range_value<InputRng>::type>& f )
         {
-            return replace_range<InputRng>(r, f.val1, f.val2);
+            return replaced_range<InputRng>(r, f.val1, f.val2);
         }
 
         template< class InputRng >
-        inline replace_range<const InputRng>
+        inline replaced_range<const InputRng>
         operator|( const InputRng& r,
                    const replace_holder<BOOST_DEDUCED_TYPENAME range_value<InputRng>::type>& f )
         {
-            return replace_range<const InputRng>(r, f.val1, f.val2);
+            return replaced_range<const InputRng>(r, f.val1, f.val2);
         }
     } // 'range_detail'
 
-    using range_detail::replace_range;
+    using range_detail::replaced_range;
 
     namespace adaptors
     {
@@ -111,21 +111,21 @@ namespace boost
         }
 
         template<class InputRange>
-        inline replace_range<InputRange>
+        inline replaced_range<InputRange>
         replace(InputRange& rng,
                 BOOST_DEDUCED_TYPENAME range_value<InputRange>::type from,
                 BOOST_DEDUCED_TYPENAME range_value<InputRange>::type to)
         {
-            return replace_range<InputRange>(rng, from, to);
+            return replaced_range<InputRange>(rng, from, to);
         }
 
         template<class InputRange>
-        inline replace_range<const InputRange>
+        inline replaced_range<const InputRange>
         replace(const InputRange& rng,
                 BOOST_DEDUCED_TYPENAME range_value<const InputRange>::type from,
                 BOOST_DEDUCED_TYPENAME range_value<const InputRange>::type to)
         {
-            return replace_range<const InputRange>(rng, from ,to);
+            return replaced_range<const InputRange>(rng, from ,to);
         }
 
     } // 'adaptors'
diff --git a/include/boost/range/adaptor/sliced.hpp b/include/boost/range/adaptor/sliced.hpp
index eb506e0..03c6894 100755
--- a/include/boost/range/adaptor/sliced.hpp
+++ b/include/boost/range/adaptor/sliced.hpp
@@ -28,14 +28,26 @@ namespace boost
         };
 
 		template< class RandomAccessRange >
-		inline iterator_range< BOOST_DEDUCED_TYPENAME range_iterator<RandomAccessRange>::type >
+		class sliced_range : public boost::iterator_range< BOOST_DEDUCED_TYPENAME range_iterator<RandomAccessRange>::type >
+		{
+			typedef boost::iterator_range< BOOST_DEDUCED_TYPENAME range_iterator<RandomAccessRange>::type > base_t;
+		public:
+			template<typename Rng, typename T, typename U>
+			sliced_range(Rng& rng, T t, U u)
+				: base_t(boost::make_iterator_range(rng, t, u - boost::size(rng)))
+			{
+			}
+		};
+
+		template< class RandomAccessRange >
+		inline sliced_range<RandomAccessRange>
 		slice( RandomAccessRange& rng, std::size_t t, std::size_t u )
 		{
 			BOOST_ASSERT( t <= u && "error in slice indices" );
             BOOST_ASSERT( static_cast<std::size_t>(boost::size(rng)) >= u &&
 						  "second slice index out of bounds" );
 
-			return boost::make_iterator_range( rng, t, u - boost::size(rng) );
+			return sliced_range<RandomAccessRange>(rng, t, u);
 		}
 
 		template< class RandomAccessRange >
@@ -46,23 +58,21 @@ namespace boost
 		    BOOST_ASSERT( static_cast<std::size_t>(boost::size(rng)) >= u &&
 		                  "second slice index out of bounds" );
 
-            return boost::make_iterator_range( rng, t, u - boost::size(rng) );
+            return sliced_range<const RandomAccessRange>(rng, t, u);
 		}
 
 		template< class RandomAccessRange >
-		inline iterator_range<
-			     BOOST_DEDUCED_TYPENAME range_iterator<RandomAccessRange>::type >
+		inline sliced_range<RandomAccessRange>
 		operator|( RandomAccessRange& r, const sliced& f )
 		{
-			return adaptors::slice( r, f.t, f.u );
+			return sliced_range<RandomAccessRange>( r, f.t, f.u );
 		}
 
 		template< class RandomAccessRange >
-		inline iterator_range<
-				 BOOST_DEDUCED_TYPENAME range_iterator<const RandomAccessRange>::type >
+		inline sliced_range<const RandomAccessRange>
 		operator|( const RandomAccessRange& r, const sliced& f )
 		{
-			return adaptors::slice( r, f.t, f.u );
+			return sliced_range<const RandomAccessRange>( r, f.t, f.u );
 		}
 
     } // namespace adaptors
diff --git a/include/boost/range/algorithm/copy.hpp b/include/boost/range/algorithm/copy.hpp
index dc5a0c3..f15b31f 100644
--- a/include/boost/range/algorithm/copy.hpp
+++ b/include/boost/range/algorithm/copy.hpp
@@ -30,7 +30,7 @@ namespace boost
 template< class SinglePassRange, class OutputIterator >
 inline OutputIterator copy(const SinglePassRange& rng, OutputIterator out)
 {
-    BOOST_RANGE_CONCEPT_ASSERT(( SinglePassRangeConcept<SinglePassRange> ));
+    BOOST_RANGE_CONCEPT_ASSERT(( SinglePassRangeConcept<const SinglePassRange> ));
     return std::copy(boost::begin(rng),boost::end(rng),out);
 }
 
diff --git a/include/boost/range/algorithm/copy_backward.hpp b/include/boost/range/algorithm/copy_backward.hpp
index 52dc922..c95c6f1 100755
--- a/include/boost/range/algorithm/copy_backward.hpp
+++ b/include/boost/range/algorithm/copy_backward.hpp
@@ -32,7 +32,7 @@ inline BidirectionalTraversalWriteableIterator
 copy_backward(const BidirectionalRange& rng,
               BidirectionalTraversalWriteableIterator out)
 {
-    BOOST_RANGE_CONCEPT_ASSERT(( BidirectionalRangeConcept<BidirectionalRange> ));
+    BOOST_RANGE_CONCEPT_ASSERT(( BidirectionalRangeConcept<const BidirectionalRange> ));
     return std::copy_backward(boost::begin(rng), boost::end(rng), out);
 }
 
diff --git a/include/boost/range/algorithm/equal.hpp b/include/boost/range/algorithm/equal.hpp
index 7226440..a3ebc29 100755
--- a/include/boost/range/algorithm/equal.hpp
+++ b/include/boost/range/algorithm/equal.hpp
@@ -159,8 +159,8 @@ namespace boost
         template< class SinglePassRange1, class SinglePassRange2 >
         inline bool equal( const SinglePassRange1& rng1, const SinglePassRange2& rng2 )
         {
-            BOOST_RANGE_CONCEPT_ASSERT(( SinglePassRangeConcept<SinglePassRange1> ));
-            BOOST_RANGE_CONCEPT_ASSERT(( SinglePassRangeConcept<SinglePassRange2> ));
+            BOOST_RANGE_CONCEPT_ASSERT(( SinglePassRangeConcept<const SinglePassRange1> ));
+            BOOST_RANGE_CONCEPT_ASSERT(( SinglePassRangeConcept<const SinglePassRange2> ));
 
             return ::boost::range_detail::equal(
                 ::boost::begin(rng1), ::boost::end(rng1),
@@ -172,8 +172,8 @@ namespace boost
         inline bool equal( const SinglePassRange1& rng1, const SinglePassRange2& rng2,
                            BinaryPredicate pred )
         {
-            BOOST_RANGE_CONCEPT_ASSERT(( SinglePassRangeConcept<SinglePassRange1> ));
-            BOOST_RANGE_CONCEPT_ASSERT(( SinglePassRangeConcept<SinglePassRange2> ));
+            BOOST_RANGE_CONCEPT_ASSERT(( SinglePassRangeConcept<const SinglePassRange1> ));
+            BOOST_RANGE_CONCEPT_ASSERT(( SinglePassRangeConcept<const SinglePassRange2> ));
 
             return ::boost::range_detail::equal(
                 ::boost::begin(rng1), ::boost::end(rng1),
diff --git a/include/boost/range/algorithm/fill.hpp b/include/boost/range/algorithm/fill.hpp
index 72c5d58..95231a8 100755
--- a/include/boost/range/algorithm/fill.hpp
+++ b/include/boost/range/algorithm/fill.hpp
@@ -33,6 +33,15 @@ inline ForwardRange& fill(ForwardRange& rng, const Value& val)
     return rng;
 }
 
+/// \overload
+template< class ForwardRange, class Value >
+inline const ForwardRange& fill(const ForwardRange& rng, const Value& val)
+{
+    BOOST_RANGE_CONCEPT_ASSERT(( ForwardRangeConcept<const ForwardRange> ));
+    std::fill(boost::begin(rng), boost::end(rng), val);
+    return rng;
+}
+
     } // namespace range
     using range::fill;
 }
diff --git a/include/boost/range/algorithm/fill_n.hpp b/include/boost/range/algorithm/fill_n.hpp
index 29d7d6f..02a0c2a 100755
--- a/include/boost/range/algorithm/fill_n.hpp
+++ b/include/boost/range/algorithm/fill_n.hpp
@@ -36,6 +36,16 @@ inline ForwardRange& fill_n(ForwardRange& rng, Size n, const Value& val)
     return rng;
 }
 
+/// \overload
+template< class ForwardRange, class Size, class Value >
+inline const ForwardRange& fill_n(const ForwardRange& rng, Size n, const Value& val)
+{
+    BOOST_RANGE_CONCEPT_ASSERT(( ForwardRangeConcept<const ForwardRange> ));
+    BOOST_ASSERT( static_cast<Size>(std::distance(boost::begin(rng), boost::end(rng))) >= n );
+    std::fill_n(boost::begin(rng), n, val);
+    return rng;
+}
+
     } // namespace range
     using range::fill_n;
 } // namespace boost
diff --git a/include/boost/range/algorithm/find.hpp b/include/boost/range/algorithm/find.hpp
index b4bf6d9..72c5cf1 100755
--- a/include/boost/range/algorithm/find.hpp
+++ b/include/boost/range/algorithm/find.hpp
@@ -27,18 +27,33 @@ namespace boost
 ///
 /// \pre SinglePassRange is a model of the SinglePassRangeConcept
 template< class SinglePassRange, class Value >
-inline BOOST_DEDUCED_TYPENAME range_iterator<SinglePassRange>::type
+inline BOOST_DEDUCED_TYPENAME disable_if<
+    is_const<SinglePassRange>,
+    BOOST_DEDUCED_TYPENAME range_iterator<SinglePassRange>::type
+>::type
 find( SinglePassRange& rng, const Value& val )
 {
     BOOST_RANGE_CONCEPT_ASSERT(( SinglePassRangeConcept<SinglePassRange> ));
     return std::find(boost::begin(rng), boost::end(rng), val);
 }
 
+/// \overload
+template< class SinglePassRange, class Value >
+inline BOOST_DEDUCED_TYPENAME range_iterator<const SinglePassRange>::type
+find( const SinglePassRange& rng, const Value& val )
+{
+    BOOST_RANGE_CONCEPT_ASSERT(( SinglePassRangeConcept<const SinglePassRange> ));
+    return std::find(boost::begin(rng), boost::end(rng), val);
+}
+
 // range_return overloads
 
 /// \overload
 template< range_return_value re, class SinglePassRange, class Value >
-inline BOOST_DEDUCED_TYPENAME range_return<SinglePassRange,re>::type
+inline BOOST_DEDUCED_TYPENAME disable_if<
+    is_const<SinglePassRange>,
+    BOOST_DEDUCED_TYPENAME range_return<SinglePassRange,re>::type
+>::type
 find( SinglePassRange& rng, const Value& val )
 {
     BOOST_RANGE_CONCEPT_ASSERT(( SinglePassRangeConcept<SinglePassRange> ));
@@ -47,6 +62,17 @@ find( SinglePassRange& rng, const Value& val )
              rng);
 }
 
+/// \overload
+template< range_return_value re, class SinglePassRange, class Value >
+inline BOOST_DEDUCED_TYPENAME range_return<const SinglePassRange,re>::type
+find( const SinglePassRange& rng, const Value& val )
+{
+    BOOST_RANGE_CONCEPT_ASSERT(( SinglePassRangeConcept<const SinglePassRange> ));
+    return range_return<const SinglePassRange,re>::
+        pack(std::find(boost::begin(rng), boost::end(rng), val),
+             rng);
+}
+
     } // namespace range
     using range::find;
 }
diff --git a/include/boost/range/algorithm/find_end.hpp b/include/boost/range/algorithm/find_end.hpp
index 864d4b0..757e999 100755
--- a/include/boost/range/algorithm/find_end.hpp
+++ b/include/boost/range/algorithm/find_end.hpp
@@ -29,7 +29,10 @@ namespace boost
 /// \pre ForwardRange2 is a model of the ForwardRangeConcept
 /// \pre BinaryPredicate is a model of the BinaryPredicateConcept
 template< class ForwardRange1, class ForwardRange2 >
-inline BOOST_DEDUCED_TYPENAME range_iterator< ForwardRange1 >::type
+inline BOOST_DEDUCED_TYPENAME disable_if<
+    is_const<ForwardRange1>,
+    BOOST_DEDUCED_TYPENAME range_iterator< ForwardRange1 >::type
+>::type
 find_end(ForwardRange1 & rng1, const ForwardRange2& rng2)
 {
     BOOST_RANGE_CONCEPT_ASSERT(( ForwardRangeConcept<ForwardRange1> ));
@@ -39,9 +42,24 @@ find_end(ForwardRange1 & rng1, const ForwardRange2& rng2)
                          boost::begin(rng2),boost::end(rng2));
 }
 
+/// \overload
+template< class ForwardRange1, class ForwardRange2 >
+inline BOOST_DEDUCED_TYPENAME range_iterator< const ForwardRange1 >::type
+find_end(const ForwardRange1 & rng1, const ForwardRange2& rng2)
+{
+    BOOST_RANGE_CONCEPT_ASSERT(( ForwardRangeConcept<const ForwardRange1> ));
+    BOOST_RANGE_CONCEPT_ASSERT(( ForwardRangeConcept<const ForwardRange2> ));
+
+    return std::find_end(boost::begin(rng1),boost::end(rng1),
+                         boost::begin(rng2),boost::end(rng2));
+}
+
 /// \overload
 template< class ForwardRange1, class ForwardRange2, class BinaryPredicate >
-inline BOOST_DEDUCED_TYPENAME range_iterator<ForwardRange1>::type
+inline BOOST_DEDUCED_TYPENAME disable_if<
+    is_const<ForwardRange1>,
+    BOOST_DEDUCED_TYPENAME range_iterator<ForwardRange1>::type
+>::type
 find_end(ForwardRange1 & rng1, const ForwardRange2& rng2, BinaryPredicate pred)
 {
     BOOST_RANGE_CONCEPT_ASSERT(( ForwardRangeConcept<ForwardRange1> ));
@@ -51,9 +69,24 @@ find_end(ForwardRange1 & rng1, const ForwardRange2& rng2, BinaryPredicate pred)
                          boost::begin(rng2),boost::end(rng2),pred);
 }
 
+/// \overload
+template< class ForwardRange1, class ForwardRange2, class BinaryPredicate >
+inline BOOST_DEDUCED_TYPENAME range_iterator<const ForwardRange1>::type
+find_end(const ForwardRange1& rng1, const ForwardRange2& rng2, BinaryPredicate pred)
+{
+    BOOST_RANGE_CONCEPT_ASSERT(( ForwardRangeConcept<const ForwardRange1> ));
+    BOOST_RANGE_CONCEPT_ASSERT(( ForwardRangeConcept<const ForwardRange2> ));
+
+    return std::find_end(boost::begin(rng1),boost::end(rng1),
+                         boost::begin(rng2),boost::end(rng2),pred);
+}
+
 /// \overload
 template< range_return_value re, class ForwardRange1, class ForwardRange2 >
-inline BOOST_DEDUCED_TYPENAME range_return<ForwardRange1,re>::type
+inline BOOST_DEDUCED_TYPENAME disable_if<
+    is_const<ForwardRange1>,
+    BOOST_DEDUCED_TYPENAME range_return<ForwardRange1,re>::type
+>::type
 find_end(ForwardRange1& rng1, const ForwardRange2& rng2)
 {
     BOOST_RANGE_CONCEPT_ASSERT(( ForwardRangeConcept<ForwardRange1> ));
@@ -65,10 +98,27 @@ find_end(ForwardRange1& rng1, const ForwardRange2& rng2)
              rng1);
 }
 
+/// \overload
+template< range_return_value re, class ForwardRange1, class ForwardRange2 >
+inline BOOST_DEDUCED_TYPENAME range_return<const ForwardRange1,re>::type
+find_end(const ForwardRange1& rng1, const ForwardRange2& rng2)
+{
+    BOOST_RANGE_CONCEPT_ASSERT(( ForwardRangeConcept<const ForwardRange1> ));
+    BOOST_RANGE_CONCEPT_ASSERT(( ForwardRangeConcept<const ForwardRange2> ));
+
+    return range_return<const ForwardRange1,re>::
+        pack(std::find_end(boost::begin(rng1), boost::end(rng1),
+                           boost::begin(rng2), boost::end(rng2)),
+             rng1);
+}
+
 /// \overload
 template< range_return_value re, class ForwardRange1, class ForwardRange2,
           class BinaryPredicate >
-inline BOOST_DEDUCED_TYPENAME range_return<ForwardRange1,re>::type
+inline BOOST_DEDUCED_TYPENAME disable_if<
+    is_const<ForwardRange1>,
+    BOOST_DEDUCED_TYPENAME range_return<ForwardRange1,re>::type
+>::type
 find_end(ForwardRange1& rng1, const ForwardRange2& rng2, BinaryPredicate pred)
 {
     BOOST_RANGE_CONCEPT_ASSERT(( ForwardRangeConcept<ForwardRange1> ));
@@ -80,6 +130,21 @@ find_end(ForwardRange1& rng1, const ForwardRange2& rng2, BinaryPredicate pred)
              rng1);
 }
 
+/// \overload
+template< range_return_value re, class ForwardRange1, class ForwardRange2,
+          class BinaryPredicate >
+inline BOOST_DEDUCED_TYPENAME range_return<const ForwardRange1,re>::type
+find_end(const ForwardRange1& rng1, const ForwardRange2& rng2, BinaryPredicate pred)
+{
+    BOOST_RANGE_CONCEPT_ASSERT(( ForwardRangeConcept<const ForwardRange1> ));
+    BOOST_RANGE_CONCEPT_ASSERT(( ForwardRangeConcept<const ForwardRange2> ));
+
+    return range_return<const ForwardRange1,re>::
+        pack(std::find_end(boost::begin(rng1), boost::end(rng1),
+                           boost::begin(rng2), boost::end(rng2), pred),
+             rng1);
+}
+
     } // namespace range
     using range::find_end;
 } // namespace boost
diff --git a/include/boost/range/algorithm/find_first_of.hpp b/include/boost/range/algorithm/find_first_of.hpp
index f7543b7..4cb5989 100755
--- a/include/boost/range/algorithm/find_first_of.hpp
+++ b/include/boost/range/algorithm/find_first_of.hpp
@@ -29,7 +29,10 @@ namespace boost
 /// \pre ForwardRange2 is a model of the ForwardRangeConcept
 /// \pre BinaryPredicate is a model of the BinaryPredicateConcept
 template< class SinglePassRange1, class ForwardRange2 >
-inline BOOST_DEDUCED_TYPENAME range_iterator<SinglePassRange1>::type
+inline BOOST_DEDUCED_TYPENAME disable_if<
+    is_const<SinglePassRange1>,
+    BOOST_DEDUCED_TYPENAME range_iterator<SinglePassRange1>::type
+>::type
 find_first_of(SinglePassRange1 & rng1, ForwardRange2 const & rng2)
 {
     BOOST_RANGE_CONCEPT_ASSERT(( SinglePassRangeConcept<SinglePassRange1> ));
@@ -39,9 +42,24 @@ find_first_of(SinglePassRange1 & rng1, ForwardRange2 const & rng2)
                               boost::begin(rng2),boost::end(rng2));
 }
 
+/// \overload
+template< class SinglePassRange1, class ForwardRange2 >
+inline BOOST_DEDUCED_TYPENAME range_iterator<const SinglePassRange1>::type
+find_first_of(const SinglePassRange1& rng1, const ForwardRange2& rng2)
+{
+    BOOST_RANGE_CONCEPT_ASSERT(( SinglePassRangeConcept<const SinglePassRange1> ));
+    BOOST_RANGE_CONCEPT_ASSERT(( ForwardRangeConcept<const ForwardRange2> ));
+
+    return std::find_first_of(boost::begin(rng1),boost::end(rng1),
+                              boost::begin(rng2),boost::end(rng2));
+}
+
 /// \overload
 template< class SinglePassRange1, class ForwardRange2, class BinaryPredicate >
-inline BOOST_DEDUCED_TYPENAME range_iterator<SinglePassRange1>::type
+inline BOOST_DEDUCED_TYPENAME disable_if<
+    is_const<SinglePassRange1>,
+    BOOST_DEDUCED_TYPENAME range_iterator<SinglePassRange1>::type
+>::type
 find_first_of(SinglePassRange1 & rng1, ForwardRange2 const & rng2, BinaryPredicate pred)
 {
     BOOST_RANGE_CONCEPT_ASSERT(( SinglePassRangeConcept<SinglePassRange1> ));
@@ -51,10 +69,25 @@ find_first_of(SinglePassRange1 & rng1, ForwardRange2 const & rng2, BinaryPredica
                               boost::begin(rng2),boost::end(rng2),pred);
 }
 
+/// \overload
+template< class SinglePassRange1, class ForwardRange2, class BinaryPredicate >
+inline BOOST_DEDUCED_TYPENAME range_iterator<const SinglePassRange1>::type
+find_first_of(const SinglePassRange1& rng1, const ForwardRange2& rng2, BinaryPredicate pred)
+{
+    BOOST_RANGE_CONCEPT_ASSERT(( SinglePassRangeConcept<const SinglePassRange1> ));
+    BOOST_RANGE_CONCEPT_ASSERT(( ForwardRangeConcept<const ForwardRange2> ));
+
+    return std::find_first_of(boost::begin(rng1),boost::end(rng1),
+                              boost::begin(rng2),boost::end(rng2),pred);
+}
+
 // range return overloads
 /// \overload
 template< range_return_value re, class SinglePassRange1, class ForwardRange2 >
-inline BOOST_DEDUCED_TYPENAME range_return<SinglePassRange1,re>::type
+inline BOOST_DEDUCED_TYPENAME disable_if<
+    is_const<SinglePassRange1>,
+    BOOST_DEDUCED_TYPENAME range_return<SinglePassRange1,re>::type
+>::type
 find_first_of(SinglePassRange1& rng1, const ForwardRange2& rng2)
 {
     BOOST_RANGE_CONCEPT_ASSERT(( SinglePassRangeConcept<SinglePassRange1> ));
@@ -66,10 +99,27 @@ find_first_of(SinglePassRange1& rng1, const ForwardRange2& rng2)
              rng1);
 }
 
+/// \overload
+template< range_return_value re, class SinglePassRange1, class ForwardRange2 >
+inline BOOST_DEDUCED_TYPENAME range_return<const SinglePassRange1,re>::type
+find_first_of(const SinglePassRange1& rng1, const ForwardRange2& rng2)
+{
+    BOOST_RANGE_CONCEPT_ASSERT(( SinglePassRangeConcept<const SinglePassRange1> ));
+    BOOST_RANGE_CONCEPT_ASSERT(( ForwardRangeConcept<const ForwardRange2> ));
+
+    return range_return<const SinglePassRange1,re>::
+        pack(std::find_first_of(boost::begin(rng1), boost::end(rng1),
+                                boost::begin(rng2), boost::end(rng2)),
+             rng1);
+}
+
 /// \overload
 template< range_return_value re, class SinglePassRange1, class ForwardRange2,
           class BinaryPredicate >
-inline BOOST_DEDUCED_TYPENAME range_return<SinglePassRange1,re>::type
+inline BOOST_DEDUCED_TYPENAME disable_if<
+    is_const<SinglePassRange1>,
+    BOOST_DEDUCED_TYPENAME range_return<SinglePassRange1,re>::type
+>::type
 find_first_of(SinglePassRange1 & rng1, const ForwardRange2& rng2,
               BinaryPredicate pred)
 {
@@ -82,6 +132,22 @@ find_first_of(SinglePassRange1 & rng1, const ForwardRange2& rng2,
              rng1);
 }
 
+/// \overload
+template< range_return_value re, class SinglePassRange1, class ForwardRange2,
+          class BinaryPredicate >
+inline BOOST_DEDUCED_TYPENAME range_return<const SinglePassRange1,re>::type
+find_first_of(const SinglePassRange1 & rng1, const ForwardRange2& rng2,
+              BinaryPredicate pred)
+{
+    BOOST_RANGE_CONCEPT_ASSERT(( SinglePassRangeConcept<const SinglePassRange1> ));
+    BOOST_RANGE_CONCEPT_ASSERT(( ForwardRangeConcept<const ForwardRange2> ));
+
+    return range_return<const SinglePassRange1,re>::
+        pack(std::find_first_of(boost::begin(rng1), boost::end(rng1),
+                                boost::begin(rng2), boost::end(rng2), pred),
+             rng1);
+}
+
     } // namespace range
     using range::find_first_of;
 } // namespace boost
diff --git a/include/boost/range/algorithm/find_if.hpp b/include/boost/range/algorithm/find_if.hpp
index 3254d8c..2d1926d 100755
--- a/include/boost/range/algorithm/find_if.hpp
+++ b/include/boost/range/algorithm/find_if.hpp
@@ -28,18 +28,33 @@ namespace boost
 /// \pre SinglePassRange is a model of the SinglePassRangeConcept
 /// \pre UnaryPredicate is a model of the UnaryPredicateConcept
 template< class SinglePassRange, class UnaryPredicate >
-inline BOOST_DEDUCED_TYPENAME range_iterator<SinglePassRange>::type
+inline BOOST_DEDUCED_TYPENAME disable_if<
+    is_const<SinglePassRange>,
+    BOOST_DEDUCED_TYPENAME range_iterator<SinglePassRange>::type
+>::type
 find_if( SinglePassRange& rng, UnaryPredicate pred )
 {
     BOOST_RANGE_CONCEPT_ASSERT(( SinglePassRangeConcept<SinglePassRange> ));
     return std::find_if(boost::begin(rng), boost::end(rng), pred);
 }
 
+/// \overload
+template< class SinglePassRange, class UnaryPredicate >
+inline BOOST_DEDUCED_TYPENAME range_iterator<const SinglePassRange>::type
+find_if( const SinglePassRange& rng, UnaryPredicate pred )
+{
+    BOOST_RANGE_CONCEPT_ASSERT(( SinglePassRangeConcept<const SinglePassRange> ));
+    return std::find_if(boost::begin(rng), boost::end(rng), pred);
+}
+
 // range_return overloads
 
 /// \overload
 template< range_return_value re, class SinglePassRange, class UnaryPredicate >
-inline BOOST_DEDUCED_TYPENAME range_return<SinglePassRange,re>::type
+inline BOOST_DEDUCED_TYPENAME disable_if<
+    is_const<SinglePassRange>,
+    BOOST_DEDUCED_TYPENAME range_return<SinglePassRange,re>::type
+>::type
 find_if( SinglePassRange& rng, UnaryPredicate pred )
 {
     BOOST_RANGE_CONCEPT_ASSERT(( SinglePassRangeConcept<SinglePassRange> ));
@@ -48,6 +63,17 @@ find_if( SinglePassRange& rng, UnaryPredicate pred )
              rng);
 }
 
+/// \overload
+template< range_return_value re, class SinglePassRange, class UnaryPredicate >
+inline BOOST_DEDUCED_TYPENAME range_return<const SinglePassRange,re>::type
+find_if( const SinglePassRange& rng, UnaryPredicate pred )
+{
+    BOOST_RANGE_CONCEPT_ASSERT(( SinglePassRangeConcept<const SinglePassRange> ));
+    return range_return<const SinglePassRange,re>::
+        pack(std::find_if(boost::begin(rng), boost::end(rng), pred),
+             rng);
+}
+
     } // namespace range
     using range::find_if;
 } // namespace boost
diff --git a/include/boost/range/algorithm/generate.hpp b/include/boost/range/algorithm/generate.hpp
index bd63a48..324412c 100755
--- a/include/boost/range/algorithm/generate.hpp
+++ b/include/boost/range/algorithm/generate.hpp
@@ -33,6 +33,15 @@ inline ForwardRange& generate( ForwardRange& rng, Generator gen )
     return rng;
 }
 
+/// \overload
+template< class ForwardRange, class Generator >
+inline const ForwardRange& generate( const ForwardRange& rng, Generator gen )
+{
+    BOOST_RANGE_CONCEPT_ASSERT(( ForwardRangeConcept<const ForwardRange> ));
+    std::generate(boost::begin(rng), boost::end(rng), gen);
+    return rng;
+}
+
     } // namespace range
     using range::generate;
 } // namespace boost
diff --git a/include/boost/range/algorithm/heap_algorithm.hpp b/include/boost/range/algorithm/heap_algorithm.hpp
index 64df3e9..584920d 100755
--- a/include/boost/range/algorithm/heap_algorithm.hpp
+++ b/include/boost/range/algorithm/heap_algorithm.hpp
@@ -34,6 +34,15 @@ inline RandomAccessRange& push_heap(RandomAccessRange& rng)
     return rng;
 }
 
+/// \overload
+template<class RandomAccessRange>
+inline const RandomAccessRange& push_heap(const RandomAccessRange& rng)
+{
+    BOOST_RANGE_CONCEPT_ASSERT(( RandomAccessRangeConcept<const RandomAccessRange> ));
+    std::push_heap(boost::begin(rng), boost::end(rng));
+    return rng;
+}
+
 /// \overload
 template<class RandomAccessRange, class Compare>
 inline RandomAccessRange& push_heap(RandomAccessRange& rng, Compare comp_pred)
@@ -43,6 +52,15 @@ inline RandomAccessRange& push_heap(RandomAccessRange& rng, Compare comp_pred)
     return rng;
 }
 
+/// \overload
+template<class RandomAccessRange, class Compare>
+inline const RandomAccessRange& push_heap(const RandomAccessRange& rng, Compare comp_pred)
+{
+    BOOST_RANGE_CONCEPT_ASSERT(( RandomAccessRangeConcept<const RandomAccessRange> ));
+    std::push_heap(boost::begin(rng), boost::end(rng), comp_pred);
+    return rng;
+}
+
 /// \brief template function pop_heap
 ///
 /// range-based version of the pop_heap std algorithm
@@ -57,6 +75,15 @@ inline RandomAccessRange& pop_heap(RandomAccessRange& rng)
     return rng;
 }
 
+/// \overload
+template<class RandomAccessRange>
+inline const RandomAccessRange& pop_heap(const RandomAccessRange& rng)
+{
+    BOOST_RANGE_CONCEPT_ASSERT(( RandomAccessRangeConcept<const RandomAccessRange> ));
+    std::pop_heap(boost::begin(rng), boost::end(rng));
+    return rng;
+}
+
 /// \overload
 template<class RandomAccessRange, class Compare>
 inline RandomAccessRange& pop_heap(RandomAccessRange& rng, Compare comp_pred)
@@ -66,6 +93,15 @@ inline RandomAccessRange& pop_heap(RandomAccessRange& rng, Compare comp_pred)
     return rng;
 }
 
+/// \overload
+template<class RandomAccessRange, class Compare>
+inline const RandomAccessRange& pop_heap(const RandomAccessRange& rng, Compare comp_pred)
+{
+    BOOST_RANGE_CONCEPT_ASSERT(( RandomAccessRangeConcept<const RandomAccessRange> ));
+    std::pop_heap(boost::begin(rng), boost::end(rng), comp_pred);
+    return rng;
+}
+
 /// \brief template function make_heap
 ///
 /// range-based version of the make_heap std algorithm
@@ -80,6 +116,15 @@ inline RandomAccessRange& make_heap(RandomAccessRange& rng)
     return rng;
 }
 
+/// \overload
+template<class RandomAccessRange>
+inline const RandomAccessRange& make_heap(const RandomAccessRange& rng)
+{
+    BOOST_RANGE_CONCEPT_ASSERT(( RandomAccessRangeConcept<const RandomAccessRange> ));
+    std::make_heap(boost::begin(rng), boost::end(rng));
+    return rng;
+}
+
 /// \overload
 template<class RandomAccessRange, class Compare>
 inline RandomAccessRange& make_heap(RandomAccessRange& rng, Compare comp_pred)
@@ -89,6 +134,15 @@ inline RandomAccessRange& make_heap(RandomAccessRange& rng, Compare comp_pred)
     return rng;
 }
 
+/// \overload
+template<class RandomAccessRange, class Compare>
+inline const RandomAccessRange& make_heap(const RandomAccessRange& rng, Compare comp_pred)
+{
+    BOOST_RANGE_CONCEPT_ASSERT(( RandomAccessRangeConcept<const RandomAccessRange> ));
+    std::make_heap(boost::begin(rng), boost::end(rng), comp_pred);
+    return rng;
+}
+
 /// \brief template function sort_heap
 ///
 /// range-based version of the sort_heap std algorithm
@@ -103,6 +157,15 @@ inline RandomAccessRange& sort_heap(RandomAccessRange& rng)
     return rng;
 }
 
+/// \overload
+template<class RandomAccessRange>
+inline const RandomAccessRange& sort_heap(const RandomAccessRange& rng)
+{
+    BOOST_RANGE_CONCEPT_ASSERT(( RandomAccessRangeConcept<const RandomAccessRange> ));
+    std::sort_heap(boost::begin(rng), boost::end(rng));
+    return rng;
+}
+
 /// \overload
 template<class RandomAccessRange, class Compare>
 inline RandomAccessRange& sort_heap(RandomAccessRange& rng, Compare comp_pred)
@@ -112,6 +175,15 @@ inline RandomAccessRange& sort_heap(RandomAccessRange& rng, Compare comp_pred)
     return rng;
 }
 
+/// \overload
+template<class RandomAccessRange, class Compare>
+inline const RandomAccessRange& sort_heap(const RandomAccessRange& rng, Compare comp_pred)
+{
+    BOOST_RANGE_CONCEPT_ASSERT(( RandomAccessRangeConcept<const RandomAccessRange> ));
+    std::sort_heap(boost::begin(rng), boost::end(rng), comp_pred);
+    return rng;
+}
+
     } // namespace range
     using range::push_heap;
     using range::pop_heap;
diff --git a/include/boost/range/algorithm/lower_bound.hpp b/include/boost/range/algorithm/lower_bound.hpp
index 5d3945e..cb5e639 100755
--- a/include/boost/range/algorithm/lower_bound.hpp
+++ b/include/boost/range/algorithm/lower_bound.hpp
@@ -27,23 +27,52 @@ namespace boost
 ///
 /// \pre ForwardRange is a model of the ForwardRangeConcept
 template< class ForwardRange, class Value >
-inline BOOST_DEDUCED_TYPENAME range_iterator<ForwardRange>::type
+inline BOOST_DEDUCED_TYPENAME disable_if<
+    is_const<ForwardRange>,
+    BOOST_DEDUCED_TYPENAME range_iterator<ForwardRange>::type
+>::type
 lower_bound( ForwardRange& rng, Value val )
 {
     BOOST_RANGE_CONCEPT_ASSERT(( ForwardRangeConcept<ForwardRange> ));
     return std::lower_bound(boost::begin(rng), boost::end(rng), val);
 }
+
+/// \overload
+template< class ForwardRange, class Value >
+inline BOOST_DEDUCED_TYPENAME range_iterator<const ForwardRange>::type
+lower_bound( const ForwardRange& rng, Value val )
+{
+    BOOST_RANGE_CONCEPT_ASSERT(( ForwardRangeConcept<const ForwardRange> ));
+    return std::lower_bound(boost::begin(rng), boost::end(rng), val);
+}
+
 /// \overload
 template< class ForwardRange, class Value, class SortPredicate >
-inline BOOST_DEDUCED_TYPENAME range_iterator<ForwardRange>::type
+inline BOOST_DEDUCED_TYPENAME disable_if<
+    is_const<ForwardRange>,
+    BOOST_DEDUCED_TYPENAME range_iterator<ForwardRange>::type
+>::type
 lower_bound( ForwardRange& rng, Value val, SortPredicate pred )
 {
     BOOST_RANGE_CONCEPT_ASSERT(( ForwardRangeConcept<ForwardRange> ));
     return std::lower_bound(boost::begin(rng), boost::end(rng), val, pred);
 }
+
+/// \overload
+template< class ForwardRange, class Value, class SortPredicate >
+inline BOOST_DEDUCED_TYPENAME range_iterator<const ForwardRange>::type
+lower_bound( const ForwardRange& rng, Value val, SortPredicate pred )
+{
+    BOOST_RANGE_CONCEPT_ASSERT(( ForwardRangeConcept<const ForwardRange> ));
+    return std::lower_bound(boost::begin(rng), boost::end(rng), val, pred);
+}
+
 /// \overload
 template< range_return_value re, class ForwardRange, class Value >
-inline BOOST_DEDUCED_TYPENAME range_return<ForwardRange,re>::type
+inline BOOST_DEDUCED_TYPENAME disable_if<
+    is_const<ForwardRange>,
+    BOOST_DEDUCED_TYPENAME range_return<ForwardRange,re>::type
+>::type
 lower_bound( ForwardRange& rng, Value val )
 {
     BOOST_RANGE_CONCEPT_ASSERT(( ForwardRangeConcept<ForwardRange> ));
@@ -51,9 +80,24 @@ lower_bound( ForwardRange& rng, Value val )
         pack(std::lower_bound(boost::begin(rng), boost::end(rng), val),
              rng);
 }
+
+/// \overload
+template< range_return_value re, class ForwardRange, class Value >
+inline BOOST_DEDUCED_TYPENAME range_return<const ForwardRange,re>::type
+lower_bound( const ForwardRange& rng, Value val )
+{
+    BOOST_RANGE_CONCEPT_ASSERT(( ForwardRangeConcept<const ForwardRange> ));
+    return range_return<const ForwardRange,re>::
+        pack(std::lower_bound(boost::begin(rng), boost::end(rng), val),
+             rng);
+}
+
 /// \overload
 template< range_return_value re, class ForwardRange, class Value, class SortPredicate >
-inline BOOST_DEDUCED_TYPENAME range_return<ForwardRange,re>::type
+inline BOOST_DEDUCED_TYPENAME disable_if<
+    is_const<ForwardRange>,
+    BOOST_DEDUCED_TYPENAME range_return<ForwardRange,re>::type
+>::type
 lower_bound( ForwardRange& rng, Value val, SortPredicate pred )
 {
     BOOST_RANGE_CONCEPT_ASSERT(( ForwardRangeConcept<ForwardRange> ));
@@ -62,6 +106,17 @@ lower_bound( ForwardRange& rng, Value val, SortPredicate pred )
              rng);
 }
 
+/// \overload
+template< range_return_value re, class ForwardRange, class Value, class SortPredicate >
+inline BOOST_DEDUCED_TYPENAME range_return<const ForwardRange,re>::type
+lower_bound( const ForwardRange& rng, Value val, SortPredicate pred )
+{
+    BOOST_RANGE_CONCEPT_ASSERT(( ForwardRangeConcept<const ForwardRange> ));
+    return range_return<const ForwardRange,re>::
+        pack(std::lower_bound(boost::begin(rng), boost::end(rng), val, pred),
+             rng);
+}
+
     } // namespace range
     using range::lower_bound;
 } // namespace boost
diff --git a/include/boost/range/algorithm/partial_sort.hpp b/include/boost/range/algorithm/partial_sort.hpp
index 1797c55..d7044cd 100755
--- a/include/boost/range/algorithm/partial_sort.hpp
+++ b/include/boost/range/algorithm/partial_sort.hpp
@@ -35,6 +35,16 @@ inline RandomAccessRange& partial_sort(RandomAccessRange& rng,
     return rng;
 }
 
+/// \overload
+template<class RandomAccessRange>
+inline const RandomAccessRange& partial_sort(const RandomAccessRange& rng,
+    BOOST_DEDUCED_TYPENAME range_iterator<const RandomAccessRange>::type middle)
+{
+    BOOST_RANGE_CONCEPT_ASSERT(( RandomAccessRangeConcept<const RandomAccessRange> ));
+    std::partial_sort(boost::begin(rng), middle, boost::end(rng));
+    return rng;
+}
+
 /// \overload
 template<class RandomAccessRange, class BinaryPredicate>
 inline RandomAccessRange& partial_sort(RandomAccessRange& rng,
@@ -47,6 +57,18 @@ inline RandomAccessRange& partial_sort(RandomAccessRange& rng,
     return rng;
 }
 
+/// \overload
+template<class RandomAccessRange, class BinaryPredicate>
+inline const RandomAccessRange& partial_sort(const RandomAccessRange& rng,
+    BOOST_DEDUCED_TYPENAME range_iterator<const RandomAccessRange>::type middle,
+    BinaryPredicate sort_pred)
+{
+    BOOST_RANGE_CONCEPT_ASSERT(( RandomAccessRangeConcept<const RandomAccessRange> ));
+    std::partial_sort(boost::begin(rng), middle, boost::end(rng),
+                        sort_pred);
+    return rng;
+}
+
     } // namespace range
     using range::partial_sort;
 } // namespace boost
diff --git a/include/boost/range/algorithm/partial_sort_copy.hpp b/include/boost/range/algorithm/partial_sort_copy.hpp
index a2fe761..9129389 100755
--- a/include/boost/range/algorithm/partial_sort_copy.hpp
+++ b/include/boost/range/algorithm/partial_sort_copy.hpp
@@ -32,7 +32,18 @@ template<class SinglePassRange, class RandomAccessRange>
 inline BOOST_DEDUCED_TYPENAME range_iterator<RandomAccessRange>::type
 partial_sort_copy(const SinglePassRange& rng1, RandomAccessRange& rng2)
 {
-    BOOST_RANGE_CONCEPT_ASSERT((SinglePassRangeConcept<SinglePassRange>));
+    BOOST_RANGE_CONCEPT_ASSERT((SinglePassRangeConcept<const SinglePassRange>));
+
+    return std::partial_sort_copy(boost::begin(rng1), boost::end(rng1),
+        boost::begin(rng2), boost::end(rng2));
+}
+
+/// \overload
+template<class SinglePassRange, class RandomAccessRange>
+inline BOOST_DEDUCED_TYPENAME range_iterator<RandomAccessRange>::type
+partial_sort_copy(const SinglePassRange& rng1, const RandomAccessRange& rng2)
+{
+    BOOST_RANGE_CONCEPT_ASSERT((SinglePassRangeConcept<const SinglePassRange>));
 
     return std::partial_sort_copy(boost::begin(rng1), boost::end(rng1),
         boost::begin(rng2), boost::end(rng2));
@@ -45,7 +56,20 @@ inline BOOST_DEDUCED_TYPENAME range_iterator<RandomAccessRange>::type
 partial_sort_copy(const SinglePassRange& rng1, RandomAccessRange& rng2,
     BinaryPredicate pred)
 {
-    BOOST_RANGE_CONCEPT_ASSERT((SinglePassRangeConcept<SinglePassRange>));
+    BOOST_RANGE_CONCEPT_ASSERT((SinglePassRangeConcept<const SinglePassRange>));
+
+    return std::partial_sort_copy(boost::begin(rng1), boost::end(rng1),
+        boost::begin(rng2), boost::end(rng2), pred);
+}
+
+/// \overload
+template<class SinglePassRange, class RandomAccessRange,
+         class BinaryPredicate>
+inline BOOST_DEDUCED_TYPENAME range_iterator<const RandomAccessRange>::type
+partial_sort_copy(const SinglePassRange& rng1, const RandomAccessRange& rng2,
+    BinaryPredicate pred)
+{
+    BOOST_RANGE_CONCEPT_ASSERT((SinglePassRangeConcept<const SinglePassRange>));
 
     return std::partial_sort_copy(boost::begin(rng1), boost::end(rng1),
         boost::begin(rng2), boost::end(rng2), pred);
diff --git a/include/boost/range/algorithm/partition.hpp b/include/boost/range/algorithm/partition.hpp
index 6404918..b814a24 100755
--- a/include/boost/range/algorithm/partition.hpp
+++ b/include/boost/range/algorithm/partition.hpp
@@ -34,6 +34,15 @@ partition(ForwardRange& rng, UnaryPredicate pred)
     return std::partition(boost::begin(rng),boost::end(rng),pred);
 }
 
+/// \overload
+template<class ForwardRange, class UnaryPredicate>
+inline BOOST_DEDUCED_TYPENAME range_iterator<ForwardRange>::type
+partition(const ForwardRange& rng, UnaryPredicate pred)
+{
+    BOOST_RANGE_CONCEPT_ASSERT(( ForwardRangeConcept<const ForwardRange> ));
+    return std::partition(boost::begin(rng),boost::end(rng),pred);
+}
+
 // range_return overloads
 
 /// \overload
@@ -47,6 +56,17 @@ partition(ForwardRange& rng, UnaryPredicate pred)
         pack(std::partition(boost::begin(rng), boost::end(rng), pred), rng);
 }
 
+/// \overload
+template< range_return_value re, class ForwardRange,
+          class UnaryPredicate >
+inline BOOST_DEDUCED_TYPENAME range_return<const ForwardRange,re>::type
+partition(const ForwardRange& rng, UnaryPredicate pred)
+{
+    BOOST_RANGE_CONCEPT_ASSERT(( ForwardRangeConcept<const ForwardRange> ));
+    return boost::range_return<const ForwardRange,re>::
+        pack(std::partition(boost::begin(rng), boost::end(rng), pred), rng);
+}
+
     } // namespace range
     using range::partition;
 } // namespace boost
diff --git a/include/boost/range/algorithm/random_shuffle.hpp b/include/boost/range/algorithm/random_shuffle.hpp
index 0b17333..95bbd97 100755
--- a/include/boost/range/algorithm/random_shuffle.hpp
+++ b/include/boost/range/algorithm/random_shuffle.hpp
@@ -34,6 +34,15 @@ inline RandomAccessRange& random_shuffle(RandomAccessRange& rng)
     return rng;
 }
 
+/// \overload
+template<class RandomAccessRange>
+inline const RandomAccessRange& random_shuffle(const RandomAccessRange& rng)
+{
+    BOOST_RANGE_CONCEPT_ASSERT(( RandomAccessRangeConcept<const RandomAccessRange> ));
+    std::random_shuffle(boost::begin(rng), boost::end(rng));
+    return rng;
+}
+
 /// \overload
 template<class RandomAccessRange, class Generator>
 inline RandomAccessRange& random_shuffle(RandomAccessRange& rng, Generator& gen)
@@ -43,6 +52,15 @@ inline RandomAccessRange& random_shuffle(RandomAccessRange& rng, Generator& gen)
     return rng;
 }
 
+/// \overload
+template<class RandomAccessRange, class Generator>
+inline const RandomAccessRange& random_shuffle(const RandomAccessRange& rng, Generator& gen)
+{
+    BOOST_RANGE_CONCEPT_ASSERT(( RandomAccessRangeConcept<const RandomAccessRange> ));
+    std::random_shuffle(boost::begin(rng), boost::end(rng), gen);
+    return rng;
+}
+
     } // namespace range
     using range::random_shuffle;
 } // namespace boost
diff --git a/include/boost/range/algorithm/remove.hpp b/include/boost/range/algorithm/remove.hpp
index 638dff2..699a7cd 100755
--- a/include/boost/range/algorithm/remove.hpp
+++ b/include/boost/range/algorithm/remove.hpp
@@ -34,6 +34,15 @@ remove(ForwardRange& rng, const Value& val)
     return std::remove(boost::begin(rng),boost::end(rng),val);
 }
 
+/// \overload
+template< class ForwardRange, class Value >
+inline BOOST_DEDUCED_TYPENAME range_iterator<const ForwardRange>::type
+remove(const ForwardRange& rng, const Value& val)
+{
+    BOOST_RANGE_CONCEPT_ASSERT(( ForwardRangeConcept<const ForwardRange> ));
+    return std::remove(boost::begin(rng),boost::end(rng),val);
+}
+
 // range_return overloads
 
 /// \overload
@@ -47,6 +56,17 @@ remove(ForwardRange& rng, const Value& val)
         rng);
 }
 
+/// \overload
+template< range_return_value re, class ForwardRange, class Value >
+inline BOOST_DEDUCED_TYPENAME range_return<const ForwardRange,re>::type
+remove(const ForwardRange& rng, const Value& val)
+{
+    BOOST_RANGE_CONCEPT_ASSERT(( ForwardRangeConcept<const ForwardRange> ));
+    return range_return<const ForwardRange,re>::pack(
+        std::remove(boost::begin(rng), boost::end(rng), val),
+        rng);
+}
+
     } // namespace range
     using range::remove;
 } // namespace boost
diff --git a/include/boost/range/algorithm/remove_copy.hpp b/include/boost/range/algorithm/remove_copy.hpp
index 0d3d83d..b65747e 100755
--- a/include/boost/range/algorithm/remove_copy.hpp
+++ b/include/boost/range/algorithm/remove_copy.hpp
@@ -31,9 +31,9 @@ namespace boost
 /// InputIterator's value type.
 template< class SinglePassRange, class OutputIterator, class Value >
 inline OutputIterator
-remove_copy(SinglePassRange& rng, OutputIterator out_it, const Value& val)
+remove_copy(const SinglePassRange& rng, OutputIterator out_it, const Value& val)
 {
-    BOOST_RANGE_CONCEPT_ASSERT(( SinglePassRangeConcept<SinglePassRange> ));
+    BOOST_RANGE_CONCEPT_ASSERT(( SinglePassRangeConcept<const SinglePassRange> ));
     return std::remove_copy(boost::begin(rng), boost::end(rng), out_it, val);
 }
 
diff --git a/include/boost/range/algorithm/remove_copy_if.hpp b/include/boost/range/algorithm/remove_copy_if.hpp
index 791a38f..8d9c37b 100755
--- a/include/boost/range/algorithm/remove_copy_if.hpp
+++ b/include/boost/range/algorithm/remove_copy_if.hpp
@@ -28,10 +28,10 @@ namespace boost
     /// \pre out_it is not an iterator in the range rng
     template< class SinglePassRange, class OutputIterator, class Predicate >
     inline OutputIterator
-    remove_copy_if(SinglePassRange& rng, OutputIterator out_it, Predicate pred)
+    remove_copy_if(const SinglePassRange& rng, OutputIterator out_it, Predicate pred)
     {
-        boost::function_requires< SinglePassRangeConcept<SinglePassRange> >();
-        return std::remove_copy_if(boost::begin(rng), boost::end(rng), out_it, pred); 
+        BOOST_RANGE_CONCEPT_ASSERT(( SinglePassRangeConcept<const SinglePassRange> ));
+        return std::remove_copy_if(boost::begin(rng), boost::end(rng), out_it, pred);
     }
 }
 
diff --git a/include/boost/range/algorithm/remove_if.hpp b/include/boost/range/algorithm/remove_if.hpp
index 349e7a4..a965df0 100755
--- a/include/boost/range/algorithm/remove_if.hpp
+++ b/include/boost/range/algorithm/remove_if.hpp
@@ -35,6 +35,15 @@ remove_if(ForwardRange& rng, UnaryPredicate pred)
     return std::remove_if(boost::begin(rng), boost::end(rng), pred);
 }
 
+/// \overload
+template< class ForwardRange, class UnaryPredicate >
+inline BOOST_DEDUCED_TYPENAME boost::range_iterator<const ForwardRange>::type
+remove_if(const ForwardRange& rng, UnaryPredicate pred)
+{
+    BOOST_RANGE_CONCEPT_ASSERT(( ForwardRangeConcept<const ForwardRange> ));
+    return std::remove_if(boost::begin(rng), boost::end(rng), pred);
+}
+
 // range_return overloads
 
 /// \overload
@@ -48,6 +57,17 @@ remove_if(ForwardRange& rng, UnaryPredicate pred)
         rng);
 }
 
+/// \overload
+template< range_return_value re, class ForwardRange, class UnaryPredicate >
+inline BOOST_DEDUCED_TYPENAME range_return<const ForwardRange,re>::type
+remove_if(const ForwardRange& rng, UnaryPredicate pred)
+{
+    BOOST_RANGE_CONCEPT_ASSERT(( ForwardRangeConcept<const ForwardRange> ));
+    return range_return<const ForwardRange,re>::pack(
+        std::remove_if(boost::begin(rng), boost::end(rng), pred),
+        rng);
+}
+
     } // namespace range
     using range::remove_if;
 } // namespace boost
diff --git a/include/boost/range/algorithm/replace.hpp b/include/boost/range/algorithm/replace.hpp
index 3f2d72c..44d3e4c 100755
--- a/include/boost/range/algorithm/replace.hpp
+++ b/include/boost/range/algorithm/replace.hpp
@@ -35,6 +35,17 @@ replace(ForwardRange& rng, const Value& what,
     return rng;
 }
 
+/// \overload
+template< class ForwardRange, class Value >
+inline const ForwardRange&
+replace(const ForwardRange& rng, const Value& what,
+        const Value& with_what)
+{
+    BOOST_RANGE_CONCEPT_ASSERT(( ForwardRangeConcept<const ForwardRange> ));
+    std::replace(boost::begin(rng), boost::end(rng), what, with_what);
+    return rng;
+}
+
     } // namespace range
     using range::replace;
 } // namespace boost;
diff --git a/include/boost/range/algorithm/replace_copy.hpp b/include/boost/range/algorithm/replace_copy.hpp
index 36c91ce..0c02005 100755
--- a/include/boost/range/algorithm/replace_copy.hpp
+++ b/include/boost/range/algorithm/replace_copy.hpp
@@ -27,10 +27,10 @@ namespace boost
 /// \pre ForwardRange is a model of the ForwardRangeConcept
 template< class ForwardRange, class OutputIterator, class Value >
 inline OutputIterator
-replace_copy(ForwardRange& rng, OutputIterator out_it, const Value& what,
+replace_copy(const ForwardRange& rng, OutputIterator out_it, const Value& what,
         const Value& with_what)
 {
-    BOOST_RANGE_CONCEPT_ASSERT(( ForwardRangeConcept<ForwardRange> ));
+    BOOST_RANGE_CONCEPT_ASSERT(( ForwardRangeConcept<const ForwardRange> ));
     return std::replace_copy(boost::begin(rng), boost::end(rng), out_it,
         what, with_what);
 }
diff --git a/include/boost/range/algorithm/replace_copy_if.hpp b/include/boost/range/algorithm/replace_copy_if.hpp
index 5d4bfb6..d313151 100755
--- a/include/boost/range/algorithm/replace_copy_if.hpp
+++ b/include/boost/range/algorithm/replace_copy_if.hpp
@@ -31,10 +31,10 @@ namespace boost
 /// \pre Value is convertible to a type in OutputIterator's set of value types.
 template< class ForwardRange, class OutputIterator, class Predicate, class Value >
 inline OutputIterator
-replace_copy_if(ForwardRange& rng, OutputIterator out_it, Predicate pred,
+replace_copy_if(const ForwardRange& rng, OutputIterator out_it, Predicate pred,
         const Value& with_what)
 {
-    BOOST_RANGE_CONCEPT_ASSERT(( ForwardRangeConcept<ForwardRange> ));
+    BOOST_RANGE_CONCEPT_ASSERT(( ForwardRangeConcept<const ForwardRange> ));
     return std::replace_copy_if(boost::begin(rng), boost::end(rng), out_it,
         pred, with_what);
 }
diff --git a/include/boost/range/algorithm/replace_if.hpp b/include/boost/range/algorithm/replace_if.hpp
index 393a4ca..93d5a1f 100755
--- a/include/boost/range/algorithm/replace_if.hpp
+++ b/include/boost/range/algorithm/replace_if.hpp
@@ -36,6 +36,17 @@ inline ForwardRange&
     return rng;
 }
 
+/// \overload
+template< class ForwardRange, class UnaryPredicate, class Value >
+inline const ForwardRange&
+    replace_if(const ForwardRange& rng, UnaryPredicate pred,
+               const Value& val)
+{
+    BOOST_RANGE_CONCEPT_ASSERT(( ForwardRangeConcept<const ForwardRange> ));
+    std::replace_if(boost::begin(rng), boost::end(rng), pred, val);
+    return rng;
+}
+
     } // namespace range
     using range::replace_if;
 } // namespace boost
diff --git a/include/boost/range/algorithm/reverse.hpp b/include/boost/range/algorithm/reverse.hpp
index 8741d66..20a7eb1 100755
--- a/include/boost/range/algorithm/reverse.hpp
+++ b/include/boost/range/algorithm/reverse.hpp
@@ -34,6 +34,15 @@ inline BidirectionalRange& reverse(BidirectionalRange& rng)
     return rng;
 }
 
+/// \overload
+template<class BidirectionalRange>
+inline const BidirectionalRange& reverse(const BidirectionalRange& rng)
+{
+    BOOST_RANGE_CONCEPT_ASSERT(( BidirectionalRangeConcept<const BidirectionalRange> ));
+    std::reverse(boost::begin(rng), boost::end(rng));
+    return rng;
+}
+
     } // namespace range
     using range::reverse;
 } // namespace boost
diff --git a/include/boost/range/algorithm/reverse_copy.hpp b/include/boost/range/algorithm/reverse_copy.hpp
index d86145d..f1990ad 100755
--- a/include/boost/range/algorithm/reverse_copy.hpp
+++ b/include/boost/range/algorithm/reverse_copy.hpp
@@ -29,7 +29,7 @@ namespace boost
 template<class BidirectionalRange, class OutputIterator>
 inline OutputIterator reverse_copy(const BidirectionalRange& rng, OutputIterator out)
 {
-    BOOST_RANGE_CONCEPT_ASSERT(( BidirectionalRangeConcept<BidirectionalRange> ));
+    BOOST_RANGE_CONCEPT_ASSERT(( BidirectionalRangeConcept<const BidirectionalRange> ));
     return std::reverse_copy(boost::begin(rng), boost::end(rng), out);
 }
 
diff --git a/include/boost/range/algorithm/rotate.hpp b/include/boost/range/algorithm/rotate.hpp
index aef6062..ca4b223 100755
--- a/include/boost/range/algorithm/rotate.hpp
+++ b/include/boost/range/algorithm/rotate.hpp
@@ -34,6 +34,16 @@ inline ForwardRange& rotate(ForwardRange& rng,
     return rng;
 }
 
+/// \overload
+template<class ForwardRange>
+inline const ForwardRange& rotate(const ForwardRange& rng,
+    BOOST_DEDUCED_TYPENAME range_iterator<const ForwardRange>::type middle)
+{
+    BOOST_RANGE_CONCEPT_ASSERT(( ForwardRangeConcept<const ForwardRange> ));
+    std::rotate(boost::begin(rng), middle, boost::end(rng));
+    return rng;
+}
+
     } // namespace range
     using range::rotate;
 } // namespace boost
diff --git a/include/boost/range/algorithm/search_n.hpp b/include/boost/range/algorithm/search_n.hpp
index 2ced140..b69bc6d 100755
--- a/include/boost/range/algorithm/search_n.hpp
+++ b/include/boost/range/algorithm/search_n.hpp
@@ -44,7 +44,7 @@ template< class ForwardRange, class Integer, class Value >
 inline BOOST_DEDUCED_TYPENAME range_iterator<const ForwardRange>::type
 search_n(const ForwardRange& rng, Integer count, const Value& value)
 {
-    BOOST_RANGE_CONCEPT_ASSERT((ForwardRangeConcept<ForwardRange>));
+    BOOST_RANGE_CONCEPT_ASSERT((ForwardRangeConcept<const ForwardRange>));
     return std::search_n(boost::begin(rng), boost::end(rng), count, value);
 }
 
@@ -69,7 +69,7 @@ inline BOOST_DEDUCED_TYPENAME range_iterator<const ForwardRange>::type
 search_n(const ForwardRange& rng, Integer count, const Value& value,
          BinaryPredicate binary_pred)
 {
-    BOOST_RANGE_CONCEPT_ASSERT((ForwardRangeConcept<ForwardRange>));
+    BOOST_RANGE_CONCEPT_ASSERT((ForwardRangeConcept<const ForwardRange>));
     BOOST_RANGE_CONCEPT_ASSERT((BinaryPredicateConcept<BinaryPredicate,
         BOOST_DEDUCED_TYPENAME range_value<const ForwardRange>::type, const Value&>));
     return std::search_n(boost::begin(rng), boost::end(rng),
@@ -97,7 +97,7 @@ template< range_return_value re, class ForwardRange, class Integer,
 inline BOOST_DEDUCED_TYPENAME range_return<const ForwardRange,re>::type
 search_n(const ForwardRange& rng, Integer count, const Value& value)
 {
-    BOOST_RANGE_CONCEPT_ASSERT((ForwardRangeConcept<ForwardRange>));
+    BOOST_RANGE_CONCEPT_ASSERT((ForwardRangeConcept<const ForwardRange>));
     return range_return<const ForwardRange,re>::
         pack(std::search_n(boost::begin(rng), boost::end(rng),
                            count, value),
@@ -128,7 +128,7 @@ inline BOOST_DEDUCED_TYPENAME range_return<const ForwardRange,re>::type
 search_n(const ForwardRange& rng, Integer count, const Value& value,
          BinaryPredicate pred)
 {
-    BOOST_RANGE_CONCEPT_ASSERT((ForwardRangeConcept<ForwardRange>));
+    BOOST_RANGE_CONCEPT_ASSERT((ForwardRangeConcept<const ForwardRange>));
     BOOST_RANGE_CONCEPT_ASSERT((BinaryPredicateConcept<BinaryPredicate,
         BOOST_DEDUCED_TYPENAME range_value<const ForwardRange>::type,
         const Value&>));
diff --git a/include/boost/range/algorithm/sort.hpp b/include/boost/range/algorithm/sort.hpp
index 0c6e3b2..45eecde 100755
--- a/include/boost/range/algorithm/sort.hpp
+++ b/include/boost/range/algorithm/sort.hpp
@@ -34,6 +34,15 @@ inline RandomAccessRange& sort(RandomAccessRange& rng)
     return rng;
 }
 
+/// \overload
+template<class RandomAccessRange>
+inline const RandomAccessRange& sort(const RandomAccessRange& rng)
+{
+    BOOST_RANGE_CONCEPT_ASSERT(( RandomAccessRangeConcept<const RandomAccessRange> ));
+    std::sort(boost::begin(rng), boost::end(rng));
+    return rng;
+}
+
 /// \overload
 template<class RandomAccessRange, class BinaryPredicate>
 inline RandomAccessRange& sort(RandomAccessRange& rng, BinaryPredicate pred)
@@ -43,6 +52,15 @@ inline RandomAccessRange& sort(RandomAccessRange& rng, BinaryPredicate pred)
     return rng;
 }
 
+/// \overload
+template<class RandomAccessRange, class BinaryPredicate>
+inline const RandomAccessRange& sort(const RandomAccessRange& rng, BinaryPredicate pred)
+{
+    BOOST_RANGE_CONCEPT_ASSERT(( RandomAccessRangeConcept<const RandomAccessRange> ));
+    std::sort(boost::begin(rng), boost::end(rng), pred);
+    return rng;
+}
+
     } // namespace range
     using range::sort;
 } // namespace boost
diff --git a/include/boost/range/algorithm/stable_sort.hpp b/include/boost/range/algorithm/stable_sort.hpp
index 6a27aa4..d18da4d 100755
--- a/include/boost/range/algorithm/stable_sort.hpp
+++ b/include/boost/range/algorithm/stable_sort.hpp
@@ -34,6 +34,15 @@ inline RandomAccessRange& stable_sort(RandomAccessRange& rng)
     return rng;
 }
 
+/// \overload
+template<class RandomAccessRange>
+inline const RandomAccessRange& stable_sort(const RandomAccessRange& rng)
+{
+    BOOST_RANGE_CONCEPT_ASSERT(( RandomAccessRangeConcept<const RandomAccessRange> ));
+    std::stable_sort(boost::begin(rng), boost::end(rng));
+    return rng;
+}
+
 /// \overload
 template<class RandomAccessRange, class BinaryPredicate>
 inline RandomAccessRange& stable_sort(RandomAccessRange& rng, BinaryPredicate sort_pred)
@@ -43,6 +52,15 @@ inline RandomAccessRange& stable_sort(RandomAccessRange& rng, BinaryPredicate so
     return rng;
 }
 
+/// \overload
+template<class RandomAccessRange, class BinaryPredicate>
+inline const RandomAccessRange& stable_sort(const RandomAccessRange& rng, BinaryPredicate sort_pred)
+{
+    BOOST_RANGE_CONCEPT_ASSERT(( RandomAccessRangeConcept<const RandomAccessRange> ));
+    std::stable_sort(boost::begin(rng), boost::end(rng), sort_pred);
+    return rng;
+}
+
     } // namespace range
     using range::stable_sort;
 } // namespace boost
diff --git a/include/boost/range/algorithm/swap_ranges.hpp b/include/boost/range/algorithm/swap_ranges.hpp
index 5b8967a..52b0162 100755
--- a/include/boost/range/algorithm/swap_ranges.hpp
+++ b/include/boost/range/algorithm/swap_ranges.hpp
@@ -80,6 +80,51 @@ swap_ranges(SinglePassRange1& range1, SinglePassRange2& range2)
     return range2;
 }
 
+/// \overload
+template< class SinglePassRange1, class SinglePassRange2 >
+inline SinglePassRange2&
+swap_ranges(const SinglePassRange1& range1, SinglePassRange2& range2)
+{
+    BOOST_RANGE_CONCEPT_ASSERT((SinglePassRangeConcept<const SinglePassRange1>));
+    BOOST_RANGE_CONCEPT_ASSERT((SinglePassRangeConcept<SinglePassRange2>));
+
+    boost::range_detail::swap_ranges_impl(
+        boost::begin(range1), boost::end(range1),
+        boost::begin(range2), boost::end(range2));
+
+    return range2;
+}
+
+/// \overload
+template< class SinglePassRange1, class SinglePassRange2 >
+inline const SinglePassRange2&
+swap_ranges(SinglePassRange1& range1, const SinglePassRange2& range2)
+{
+    BOOST_RANGE_CONCEPT_ASSERT((SinglePassRangeConcept<SinglePassRange1>));
+    BOOST_RANGE_CONCEPT_ASSERT((SinglePassRangeConcept<const SinglePassRange2>));
+
+    boost::range_detail::swap_ranges_impl(
+        boost::begin(range1), boost::end(range1),
+        boost::begin(range2), boost::end(range2));
+
+    return range2;
+}
+
+/// \overload
+template< class SinglePassRange1, class SinglePassRange2 >
+inline const SinglePassRange2&
+swap_ranges(const SinglePassRange1& range1, const SinglePassRange2& range2)
+{
+    BOOST_RANGE_CONCEPT_ASSERT((SinglePassRangeConcept<const SinglePassRange1>));
+    BOOST_RANGE_CONCEPT_ASSERT((SinglePassRangeConcept<const SinglePassRange2>));
+
+    boost::range_detail::swap_ranges_impl(
+        boost::begin(range1), boost::end(range1),
+        boost::begin(range2), boost::end(range2));
+
+    return range2;
+}
+
     } // namespace range
     using range::swap_ranges;
 } // namespace boost
diff --git a/include/boost/range/algorithm/upper_bound.hpp b/include/boost/range/algorithm/upper_bound.hpp
index 8aa26bd..c8acbc6 100755
--- a/include/boost/range/algorithm/upper_bound.hpp
+++ b/include/boost/range/algorithm/upper_bound.hpp
@@ -27,24 +27,53 @@ namespace boost
 ///
 /// \pre ForwardRange is a model of the ForwardRangeConcept
 template< class ForwardRange, class Value >
-inline BOOST_DEDUCED_TYPENAME range_iterator<ForwardRange>::type
+inline
+BOOST_DEDUCED_TYPENAME disable_if<
+    is_const<ForwardRange>,
+    BOOST_DEDUCED_TYPENAME range_iterator<ForwardRange>::type
+>::type
 upper_bound( ForwardRange& rng, Value val )
 {
     BOOST_RANGE_CONCEPT_ASSERT(( ForwardRangeConcept<ForwardRange> ));
     return std::upper_bound(boost::begin(rng), boost::end(rng), val);
 }
+
 /// \overload
+template< class ForwardRange, class Value >
+BOOST_DEDUCED_TYPENAME range_iterator<const ForwardRange>::type
+upper_bound( const ForwardRange& rng, Value val )
+{
+    BOOST_RANGE_CONCEPT_ASSERT(( ForwardRangeConcept<const ForwardRange> ));
+    return std::upper_bound(boost::begin(rng), boost::end(rng), val);
+}
+
 /// \overload
 template< class ForwardRange, class Value, class SortPredicate >
-inline BOOST_DEDUCED_TYPENAME range_iterator<ForwardRange>::type
+inline BOOST_DEDUCED_TYPENAME disable_if<
+    is_const<ForwardRange>,
+    BOOST_DEDUCED_TYPENAME range_iterator<ForwardRange>::type
+>::type
 upper_bound( ForwardRange& rng, Value val, SortPredicate pred )
 {
     BOOST_RANGE_CONCEPT_ASSERT(( ForwardRangeConcept<ForwardRange> ));
     return std::upper_bound(boost::begin(rng), boost::end(rng), val, pred);
 }
+
+/// \overload
+template< class ForwardRange, class Value, class SortPredicate >
+inline BOOST_DEDUCED_TYPENAME range_iterator<const ForwardRange>::type
+upper_bound( const ForwardRange& rng, Value val, SortPredicate pred )
+{
+    BOOST_RANGE_CONCEPT_ASSERT(( ForwardRangeConcept<const ForwardRange> ));
+    return std::upper_bound(boost::begin(rng), boost::end(rng), val, pred);
+}
+
 /// \overload
 template< range_return_value re, class ForwardRange, class Value >
-inline BOOST_DEDUCED_TYPENAME range_return<ForwardRange,re>::type
+inline BOOST_DEDUCED_TYPENAME disable_if<
+    is_const<ForwardRange>,
+    BOOST_DEDUCED_TYPENAME range_return<ForwardRange,re>::type
+>::type
 upper_bound( ForwardRange& rng, Value val )
 {
     BOOST_RANGE_CONCEPT_ASSERT(( ForwardRangeConcept<ForwardRange> ));
@@ -52,10 +81,25 @@ upper_bound( ForwardRange& rng, Value val )
         pack(std::upper_bound(boost::begin(rng), boost::end(rng), val),
              rng);
 }
+
+/// \overload
+template< range_return_value re, class ForwardRange, class Value >
+inline BOOST_DEDUCED_TYPENAME range_return<const ForwardRange,re>::type
+upper_bound( const ForwardRange& rng, Value val )
+{
+    BOOST_RANGE_CONCEPT_ASSERT(( ForwardRangeConcept<const ForwardRange> ));
+    return range_return<const ForwardRange,re>::
+        pack(std::upper_bound(boost::begin(rng), boost::end(rng), val),
+             rng);
+}
+
 /// \overload
 template< range_return_value re, class ForwardRange, class Value,
           class SortPredicate >
-inline BOOST_DEDUCED_TYPENAME range_return<ForwardRange,re>::type
+inline BOOST_DEDUCED_TYPENAME disable_if<
+    is_const<ForwardRange>,
+    BOOST_DEDUCED_TYPENAME range_return<ForwardRange,re>::type
+>::type
 upper_bound( ForwardRange& rng, Value val, SortPredicate pred )
 {
     BOOST_RANGE_CONCEPT_ASSERT(( ForwardRangeConcept<ForwardRange> ));
@@ -64,6 +108,18 @@ upper_bound( ForwardRange& rng, Value val, SortPredicate pred )
              rng);
 }
 
+/// \overload
+template< range_return_value re, class ForwardRange, class Value,
+          class SortPredicate >
+inline BOOST_DEDUCED_TYPENAME range_return<const ForwardRange,re>::type
+upper_bound( const ForwardRange& rng, Value val, SortPredicate pred )
+{
+    BOOST_RANGE_CONCEPT_ASSERT(( ForwardRangeConcept<const ForwardRange> ));
+    return range_return<const ForwardRange,re>::
+        pack(std::upper_bound(boost::begin(rng), boost::end(rng), val, pred),
+             rng);
+}
+
     } // namespace range
     using range::upper_bound;
 } // namespace boost
diff --git a/include/boost/range/algorithm_ext/iota.hpp b/include/boost/range/algorithm_ext/iota.hpp
index 65cbc89..f7af446 100644
--- a/include/boost/range/algorithm_ext/iota.hpp
+++ b/include/boost/range/algorithm_ext/iota.hpp
@@ -34,6 +34,19 @@ inline ForwardRange& iota( ForwardRange& rng, Value x )
     return rng;
 }
 
+template< class ForwardRange, class Value >
+inline const ForwardRange& iota( const ForwardRange& rng, Value x )
+{
+    BOOST_CONCEPT_ASSERT(( ForwardRangeConcept<const ForwardRange> ));
+    typedef BOOST_DEDUCED_TYPENAME range_iterator<const ForwardRange>::type iterator_t;
+    
+    iterator_t last_target = ::boost::end(rng);
+    for (iterator_t target = ::boost::begin(rng); target != last_target; ++target, ++x)
+        *target = x;
+    
+    return rng;
+}
+
     } // namespace range
     using range::iota;
 } // namespace boost
diff --git a/include/boost/range/algorithm_ext/is_sorted.hpp b/include/boost/range/algorithm_ext/is_sorted.hpp
index 69ead10..54fc038 100755
--- a/include/boost/range/algorithm_ext/is_sorted.hpp
+++ b/include/boost/range/algorithm_ext/is_sorted.hpp
@@ -51,7 +51,7 @@ template<class SinglePassRange>
 inline bool is_sorted(const SinglePassRange& rng)
 {
     BOOST_RANGE_CONCEPT_ASSERT((SinglePassRangeConcept<const SinglePassRange>));
-    BOOST_RANGE_CONCEPT_ASSERT((LessThanComparableConcept<BOOST_DEDUCED_TYPENAME range_value<SinglePassRange>::type>));
+    BOOST_RANGE_CONCEPT_ASSERT((LessThanComparableConcept<BOOST_DEDUCED_TYPENAME range_value<const SinglePassRange>::type>));
     return range_detail::is_sorted(boost::begin(rng), boost::end(rng));
 }
 
@@ -59,8 +59,8 @@ inline bool is_sorted(const SinglePassRange& rng)
 template<class SinglePassRange, class BinaryPredicate>
 inline bool is_sorted(const SinglePassRange& rng, BinaryPredicate pred)
 {
-    BOOST_RANGE_CONCEPT_ASSERT((SinglePassRangeConcept<SinglePassRange>));
-    BOOST_RANGE_CONCEPT_ASSERT((BinaryPredicateConcept<BinaryPredicate, BOOST_DEDUCED_TYPENAME range_value<SinglePassRange>::type, BOOST_DEDUCED_TYPENAME range_value<SinglePassRange>::type>));
+    BOOST_RANGE_CONCEPT_ASSERT((SinglePassRangeConcept<const SinglePassRange>));
+    BOOST_RANGE_CONCEPT_ASSERT((BinaryPredicateConcept<BinaryPredicate, BOOST_DEDUCED_TYPENAME range_value<const SinglePassRange>::type, BOOST_DEDUCED_TYPENAME range_value<const SinglePassRange>::type>));
     return range_detail::is_sorted(boost::begin(rng), boost::end(rng), pred);
 }
 
diff --git a/include/boost/range/algorithm_ext/overwrite.hpp b/include/boost/range/algorithm_ext/overwrite.hpp
index d2cf4ed..f84f6ea 100755
--- a/include/boost/range/algorithm_ext/overwrite.hpp
+++ b/include/boost/range/algorithm_ext/overwrite.hpp
@@ -50,6 +50,33 @@ inline void overwrite( const SinglePassRange1& from, SinglePassRange2& to )
     }
 }
 
+template< class SinglePassRange1, class SinglePassRange2 >
+inline void overwrite( const SinglePassRange1& from, const SinglePassRange2& to )
+{
+    BOOST_RANGE_CONCEPT_ASSERT(( SinglePassRangeConcept<const SinglePassRange1> ));
+    BOOST_RANGE_CONCEPT_ASSERT(( SinglePassRangeConcept<const SinglePassRange2> ));
+
+    BOOST_DEDUCED_TYPENAME range_iterator<const SinglePassRange1>::type
+        i = boost::begin(from), e = boost::end(from);
+
+    BOOST_DEDUCED_TYPENAME range_iterator<const SinglePassRange2>::type
+        out = boost::begin(to);
+
+#ifndef NDEBUG
+    BOOST_DEDUCED_TYPENAME range_iterator<const SinglePassRange2>::type
+        last_out = boost::end(to);
+#endif
+
+    for( ; i != e; ++out, ++i )
+    {
+#ifndef NDEBUG
+        BOOST_ASSERT( out != last_out
+            && "out of bounds in boost::overwrite()" );
+#endif
+        *out = *i;
+    }
+}
+
     } // namespace range
     using range::overwrite;
 } // namespace boost
diff --git a/include/boost/range/detail/join_iterator.hpp b/include/boost/range/detail/join_iterator.hpp
index 76ebbfe..d22292b 100644
--- a/include/boost/range/detail/join_iterator.hpp
+++ b/include/boost/range/detail/join_iterator.hpp
@@ -12,9 +12,9 @@
 #define BOOST_RANGE_DETAIL_JOIN_ITERATOR_HPP_INCLUDED
 
 #include <iterator>
+#include <boost/assert.hpp>
 #include <boost/iterator/iterator_traits.hpp>
 #include <boost/iterator/iterator_facade.hpp>
-#include <boost/intrusive_ptr.hpp>
 #include <boost/range/begin.hpp>
 #include <boost/range/end.hpp>
 #include <boost/range/empty.hpp>
@@ -30,21 +30,6 @@ namespace boost
 template<typename Iterator1, typename Iterator2>
 struct join_iterator_link
 {
-private:
-    class reference_count_t
-    {
-    public:
-        reference_count_t() : m_count(0u) {}
-        reference_count_t(const reference_count_t&) : m_count(0u) {}
-        reference_count_t& operator=(const reference_count_t&) { return *this; }
-
-        void increment() { ++m_count; }
-        bool decrement() { return --m_count ? false : true; }
-
-    private:
-        unsigned int m_count;
-    };
-
 public:
     join_iterator_link(Iterator1 last1, Iterator2 first2)
         :    last1(last1)
@@ -52,38 +37,13 @@ public:
     {
     }
 
-    void add_reference() const
-    {
-        count.increment();
-    }
-
-    bool release_reference() const
-    {
-        return count.decrement();
-    }
-
     Iterator1 last1;
     Iterator2 first2;
 
 private:
     join_iterator_link() /* = delete */ ;
-
-    mutable reference_count_t count;
 };
 
-template<typename Iterator1, typename Iterator2>
-inline void intrusive_ptr_add_ref(const join_iterator_link<Iterator1,Iterator2>* p)
-{
-    p->add_reference();
-}
-
-template<typename Iterator1, typename Iterator2>
-inline void intrusive_ptr_release(const join_iterator_link<Iterator1,Iterator2>* p)
-{
-    if (p->release_reference())
-        delete p;
-}
-
 class join_iterator_begin_tag {};
 class join_iterator_end_tag {};
 
@@ -174,12 +134,16 @@ public:
     typedef Iterator1 iterator1_t;
     typedef Iterator2 iterator2_t;
 
-    join_iterator() : m_section(0u) {}
+    join_iterator()
+        : m_section(0u)
+        , m_it(0u, iterator1_t(), iterator2_t())
+        , m_link(link_t(iterator1_t(), iterator2_t()))
+    {}
 
     join_iterator(unsigned int section, Iterator1 current1, Iterator1 last1, Iterator2 first2, Iterator2 current2)
         : m_section(section)
         , m_it(section, current1, current2)
-        , m_link(new link_t(last1, first2))
+        , m_link(link_t(last1, first2))
         {
         }
 
@@ -187,7 +151,7 @@ public:
     join_iterator(Range1& r1, Range2& r2, join_iterator_begin_tag)
         : m_section(boost::empty(r1) ? 1u : 0u)
         , m_it(boost::empty(r1) ? 1u : 0u, boost::begin(r1), boost::begin(r2))
-        , m_link(new link_t(boost::end(r1), boost::begin(r2)))
+        , m_link(link_t(boost::end(r1), boost::begin(r2)))
     {
     }
 
@@ -195,7 +159,7 @@ public:
     join_iterator(const Range1& r1, const Range2& r2, join_iterator_begin_tag)
         : m_section(boost::empty(r1) ? 1u : 0u)
         , m_it(boost::empty(r1) ? 1u : 0u, boost::const_begin(r1), boost::const_begin(r2))
-        , m_link(new link_t(boost::const_end(r1), boost::const_begin(r2)))
+        , m_link(link_t(boost::const_end(r1), boost::const_begin(r2)))
     {
     }
 
@@ -203,7 +167,7 @@ public:
     join_iterator(Range1& r1, Range2& r2, join_iterator_end_tag)
         : m_section(1u)
         , m_it(1u, boost::end(r1), boost::end(r2))
-        , m_link(new link_t(boost::end(r1), boost::begin(r2)))
+        , m_link(link_t(boost::end(r1), boost::begin(r2)))
     {
     }
 
@@ -211,7 +175,7 @@ public:
     join_iterator(const Range1& r1, const Range2& r2, join_iterator_end_tag)
         : m_section(1u)
         , m_it(1u, boost::const_end(r1), boost::const_end(r2))
-        , m_link(new link_t(boost::const_end(r1), boost::const_begin(r2)))
+        , m_link(link_t(boost::const_end(r1), boost::const_begin(r2)))
     {
     }
 
@@ -223,9 +187,9 @@ private:
         else
         {
             ++m_it.it1();
-            if (m_it.it1() == m_link->last1)
+            if (m_it.it1() == m_link.last1)
             {
-                m_it.it2() = m_link->first2;
+                m_it.it2() = m_link.first2;
                 m_section = 1u;
             }
         }
@@ -235,9 +199,9 @@ private:
     {
         if (m_section)
         {
-            if (m_it.it2() == m_link->first2)
+            if (m_it.it2() == m_link.first2)
             {
-                m_it.it1() = boost::prior(m_link->last1);
+                m_it.it1() = boost::prior(m_link.last1);
                 m_section = 0u;
             }
             else
@@ -275,8 +239,8 @@ private:
                 result = other.m_it.it2() - m_it.it2();
             else
             {
-                result = (m_link->first2 - m_it.it2())
-                       + (other.m_it.it1() - m_link->last1);
+                result = (m_link.first2 - m_it.it2())
+                       + (other.m_it.it1() - m_link.last1);
 
                 BOOST_ASSERT( result <= 0 );
             }
@@ -285,8 +249,8 @@ private:
         {
             if (other.m_section)
             {
-                result = (m_link->last1 - m_it.it1())
-                       + (other.m_it.it2() - m_link->first2);
+                result = (m_link.last1 - m_it.it1())
+                       + (other.m_it.it2() - m_link.first2);
             }
             else
                 result = other.m_it.it1() - m_it.it1();
@@ -300,7 +264,7 @@ private:
         BOOST_ASSERT( m_section == 1u );
         if (offset < 0)
         {
-            difference_t r2_dist = m_link->first2 - m_it.it2();
+            difference_t r2_dist = m_link.first2 - m_it.it2();
             BOOST_ASSERT( r2_dist <= 0 );
             if (offset >= r2_dist)
                 std::advance(m_it.it2(), offset);
@@ -308,7 +272,7 @@ private:
             {
                 difference_t r1_dist = offset - r2_dist;
                 BOOST_ASSERT( r1_dist <= 0 );
-                m_it.it1() = m_link->last1 + r1_dist;
+                m_it.it1() = m_link.last1 + r1_dist;
                 m_section = 0u;
             }
         }
@@ -322,7 +286,7 @@ private:
         BOOST_ASSERT( m_section == 0u );
         if (offset > 0)
         {
-            difference_t r1_dist = m_link->last1 - m_it.it1();
+            difference_t r1_dist = m_link.last1 - m_it.it1();
             BOOST_ASSERT( r1_dist >= 0 );
             if (offset < r1_dist)
                 std::advance(m_it.it1(), offset);
@@ -330,7 +294,7 @@ private:
             {
                 difference_t r2_dist = offset - r1_dist;
                 BOOST_ASSERT( r2_dist >= 0 );
-                m_it.it2() = m_link->first2 + r2_dist;
+                m_it.it2() = m_link.first2 + r2_dist;
                 m_section = 1u;
             }
         }
@@ -340,7 +304,7 @@ private:
 
     unsigned int m_section;
     iterator_union m_it;
-    intrusive_ptr<const link_t> m_link;
+    link_t m_link;
 
     friend class ::boost::iterator_core_access;
 };
diff --git a/include/boost/range/irange.hpp b/include/boost/range/irange.hpp
index ee25d45..8045550 100644
--- a/include/boost/range/irange.hpp
+++ b/include/boost/range/irange.hpp
@@ -173,28 +173,54 @@ namespace boost
     } // namespace range_detail
 
     template<typename Integer>
-    iterator_range< range_detail::integer_iterator<Integer> >
-        irange(Integer first, Integer last)
+    class integer_range
+        : public iterator_range< range_detail::integer_iterator<Integer> >
+    {
+        typedef range_detail::integer_iterator<Integer> iterator_t;
+        typedef iterator_range<iterator_t> base_t;
+    public:
+        integer_range(Integer first, Integer last)
+            : base_t(iterator_t(first), iterator_t(last))
+        {
+        }
+    };
+
+    template<typename Integer>
+    class strided_integer_range
+    : public iterator_range< range_detail::integer_iterator_with_step<Integer> >
+    {
+        typedef range_detail::integer_iterator_with_step<Integer> iterator_t;
+        typedef iterator_range<iterator_t> base_t;
+    public:
+        template<typename Iterator>
+        strided_integer_range(Iterator first, Iterator last)
+            : base_t(first, last)
+        {
+        }
+    };
+
+    template<typename Integer>
+    integer_range<Integer>
+    irange(Integer first, Integer last)
     {
         BOOST_ASSERT( first <= last );
-        return boost::iterator_range< range_detail::integer_iterator<Integer> >(
-                range_detail::integer_iterator<Integer>(first),
-                range_detail::integer_iterator<Integer>(last));
+        return integer_range<Integer>(first, last);
     }
 
     template<typename Integer, typename StepSize>
-    iterator_range< range_detail::integer_iterator_with_step<Integer> >
+    strided_integer_range<Integer>
         irange(Integer first, Integer last, StepSize step_size)
     {
         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 last_step
             = (static_cast<std::ptrdiff_t>(last) - static_cast<std::ptrdiff_t>(first))
             / (static_cast<std::ptrdiff_t>(step_size));
 
-        return boost::iterator_range< iterator_t >(
+        return strided_integer_range<Integer>(
             iterator_t(first, 0, step_size),
             iterator_t(first, last_step, step_size));
     }
diff --git a/include/boost/range/join.hpp b/include/boost/range/join.hpp
index 518026c..ad0217e 100644
--- a/include/boost/range/join.hpp
+++ b/include/boost/range/join.hpp
@@ -18,49 +18,64 @@
 
 namespace boost
 {
+    namespace range_detail
+    {
 
 template<class SinglePassRange1, class SinglePassRange2>
-iterator_range<range_detail::join_iterator<
-    BOOST_DEDUCED_TYPENAME range_iterator<const SinglePassRange1>::type,
-    BOOST_DEDUCED_TYPENAME range_iterator<const SinglePassRange2>::type,
-    BOOST_DEDUCED_TYPENAME add_const<
-        BOOST_DEDUCED_TYPENAME range_value<const SinglePassRange1>::type>::type>
->
+class joined_type
+{
+public:
+    typedef iterator_range<
+        range_detail::join_iterator<
+            BOOST_DEDUCED_TYPENAME range_iterator<SinglePassRange1>::type,
+            BOOST_DEDUCED_TYPENAME range_iterator<SinglePassRange2>::type,
+            BOOST_DEDUCED_TYPENAME range_value<SinglePassRange1>::type
+        >
+    > type;
+};
+
+    } // namespace range_detail
+
+template<class SinglePassRange1, class SinglePassRange2>
+class joined_range
+    : public range_detail::joined_type<SinglePassRange1, SinglePassRange2>::type
+{
+    typedef range_detail::join_iterator<
+        BOOST_DEDUCED_TYPENAME range_iterator<SinglePassRange1>::type,
+        BOOST_DEDUCED_TYPENAME range_iterator<SinglePassRange2>::type,
+        BOOST_DEDUCED_TYPENAME range_value<SinglePassRange1>::type
+        > iterator_t;
+
+    typedef BOOST_DEDUCED_TYPENAME range_detail::joined_type<
+                    SinglePassRange1, SinglePassRange2>::type base_t;
+public:
+    joined_range(SinglePassRange1& rng1, SinglePassRange2& rng2)
+        : base_t(
+            iterator_t(rng1, rng2, range_detail::join_iterator_begin_tag()),
+            iterator_t(rng1, rng2, range_detail::join_iterator_end_tag())
+        )
+    {
+    }
+};
+
+template<class SinglePassRange1, class SinglePassRange2>
+joined_range<const SinglePassRange1, const SinglePassRange2>
 join(const SinglePassRange1& r1, const SinglePassRange2& r2)
 {
     BOOST_RANGE_CONCEPT_ASSERT(( SinglePassRangeConcept<SinglePassRange1> ));
     BOOST_RANGE_CONCEPT_ASSERT(( SinglePassRangeConcept<SinglePassRange2> ));
 
-    typedef range_detail::join_iterator<
-                BOOST_DEDUCED_TYPENAME range_iterator<const SinglePassRange1>::type,
-                BOOST_DEDUCED_TYPENAME range_iterator<const SinglePassRange2>::type,
-                BOOST_DEDUCED_TYPENAME add_const<
-                    BOOST_DEDUCED_TYPENAME range_value<const SinglePassRange1>::type>::type> iterator_t;
-
-    return iterator_range<iterator_t>(
-        iterator_t(r1, r2, range_detail::join_iterator_begin_tag()),
-        iterator_t(r1, r2, range_detail::join_iterator_end_tag()));
+    return joined_range<const SinglePassRange1, const SinglePassRange2>(r1, r2);
 }
 
 template<class SinglePassRange1, class SinglePassRange2>
-iterator_range<range_detail::join_iterator<
-    BOOST_DEDUCED_TYPENAME range_iterator<SinglePassRange1>::type,
-    BOOST_DEDUCED_TYPENAME range_iterator<SinglePassRange2>::type,
-    BOOST_DEDUCED_TYPENAME range_value<SinglePassRange1>::type>
->
+joined_range<SinglePassRange1, SinglePassRange2>
 join(SinglePassRange1& r1, SinglePassRange2& r2)
 {
     BOOST_RANGE_CONCEPT_ASSERT(( SinglePassRangeConcept<SinglePassRange1> ));
     BOOST_RANGE_CONCEPT_ASSERT(( SinglePassRangeConcept<SinglePassRange2> ));
 
-    typedef range_detail::join_iterator<
-        BOOST_DEDUCED_TYPENAME range_iterator<SinglePassRange1>::type,
-        BOOST_DEDUCED_TYPENAME range_iterator<SinglePassRange2>::type,
-        BOOST_DEDUCED_TYPENAME range_value<SinglePassRange1>::type> iterator_t;
-
-    return iterator_range<iterator_t>(
-        iterator_t(r1, r2, range_detail::join_iterator_begin_tag()),
-        iterator_t(r1, r2, range_detail::join_iterator_end_tag()));
+    return joined_range<SinglePassRange1, SinglePassRange2>(r1, r2);
 }
 
 } // namespace boost
diff --git a/include/boost/range/numeric.hpp b/include/boost/range/numeric.hpp
index 0a76151..b01b73a 100755
--- a/include/boost/range/numeric.hpp
+++ b/include/boost/range/numeric.hpp
@@ -7,13 +7,13 @@
 // Distributed under the Boost Software License, Version 1.0. (See
 // accompanying file LICENSE_1_0.txt or copy at
 // http://www.boost.org/LICENSE_1_0.txt)
-// 
+//
 
 // Copyright 2006 Thorsten Ottosen.
 // Distributed under the Boost Software License, Version 1.0. (See
 // accompanying file LICENSE_1_0.txt or copy at
 // http://www.boost.org/LICENSE_1_0.txt)
-// 
+//
 // Copyright 2004 Eric Niebler.
 // Distributed under the Boost Software License, Version 1.0. (See
 // accompanying file LICENSE_1_0.txt or copy at
@@ -31,6 +31,7 @@
 #include <boost/range/begin.hpp>
 #include <boost/range/end.hpp>
 #include <boost/range/concepts.hpp>
+#include <boost/range/distance.hpp>
 #include <numeric>
 
 
@@ -39,14 +40,14 @@ namespace boost
     template< class SinglePassRange, class Value >
     inline Value accumulate( const SinglePassRange& rng, Value init )
     {
-        boost::function_requires< SinglePassRangeConcept<SinglePassRange> >();
+        BOOST_RANGE_CONCEPT_ASSERT(( SinglePassRangeConcept<SinglePassRange> ));
         return std::accumulate( boost::begin(rng), boost::end(rng), init );
     }
 
     template< class SinglePassRange, class Value, class BinaryOperation >
     inline Value accumulate( const SinglePassRange& rng, Value init, BinaryOperation op )
     {
-        boost::function_requires< SinglePassRangeConcept<SinglePassRange> >();
+        BOOST_RANGE_CONCEPT_ASSERT(( SinglePassRangeConcept<const SinglePassRange> ));
         return std::accumulate( boost::begin(rng), boost::end(rng), init, op );
     }
 
@@ -54,42 +55,42 @@ namespace boost
     template< class SinglePassRange1, class SinglePassRange2, class Value >
     inline Value inner_product( const SinglePassRange1& rng1, const SinglePassRange2& rng2, Value init )
     {
-        boost::function_requires< SinglePassRangeConcept<SinglePassRange1> >();
-        boost::function_requires< SinglePassRangeConcept<SinglePassRange2> >();
+        BOOST_RANGE_CONCEPT_ASSERT(( SinglePassRangeConcept<const SinglePassRange1> ));
+        BOOST_RANGE_CONCEPT_ASSERT(( SinglePassRangeConcept<const SinglePassRange2> ));
         BOOST_ASSERT( boost::distance(rng2) >= boost::distance(rng1) );
-        return std::inner_product( boost::begin(rng1), boost::end(rng1), 
-            boost::begin(rng2), init ); 
+        return std::inner_product( boost::begin(rng1), boost::end(rng1),
+            boost::begin(rng2), init );
     }
 
     template< class SinglePassRange1,
               class SinglePassRange2,
-              class Value, 
+              class Value,
               class BinaryOperation1, class BinaryOperation2 >
     inline Value inner_product( const SinglePassRange1& rng1, const SinglePassRange2& rng2,
-                                Value init, 
+                                Value init,
                                 BinaryOperation1 op1, BinaryOperation2 op2 )
     {
-        boost::function_requires< SinglePassRangeConcept<SinglePassRange1> >();
-        boost::function_requires< SinglePassRangeConcept<SinglePassRange2> >();
+        BOOST_RANGE_CONCEPT_ASSERT(( SinglePassRangeConcept<const SinglePassRange1> ));
+        BOOST_RANGE_CONCEPT_ASSERT(( SinglePassRangeConcept<const SinglePassRange2> ));
         BOOST_ASSERT( boost::distance(rng2) >= boost::distance(rng1) );
 
-        return std::inner_product( boost::begin(rng1), boost::end(rng1), 
-                                   boost::begin(rng2), init, op1, op2 ); 
+        return std::inner_product( boost::begin(rng1), boost::end(rng1),
+                                   boost::begin(rng2), init, op1, op2 );
     }
 
     template< class SinglePassRange, class OutputIterator >
-    inline OutputIterator partial_sum ( const SinglePassRange& rng, 
+    inline OutputIterator partial_sum ( const SinglePassRange& rng,
                                         OutputIterator result )
     {
-        boost::function_requires< SinglePassRangeConcept<SinglePassRange> >();
+        BOOST_RANGE_CONCEPT_ASSERT(( SinglePassRangeConcept<const SinglePassRange> ));
         return std::partial_sum( boost::begin(rng), boost::end(rng), result );
     }
 
     template< class SinglePassRange, class OutputIterator, class BinaryOperation >
-    inline OutputIterator partial_sum ( const SinglePassRange& rng, OutputIterator result, 
+    inline OutputIterator partial_sum ( const SinglePassRange& rng, OutputIterator result,
                                         BinaryOperation op )
     {
-        boost::function_requires< SinglePassRangeConcept<SinglePassRange> >();
+        BOOST_RANGE_CONCEPT_ASSERT(( SinglePassRangeConcept<const SinglePassRange> ));
         return std::partial_sum( boost::begin(rng), boost::end(rng), result, op );
     }
 
@@ -97,8 +98,8 @@ namespace boost
     inline OutputIterator adjacent_difference ( const SinglePassRange& rng,
                                                 OutputIterator result )
     {
-        boost::function_requires< SinglePassRangeConcept<SinglePassRange> >();
-        return std::adjacent_difference( boost::begin(rng), boost::end(rng), 
+        BOOST_RANGE_CONCEPT_ASSERT(( SinglePassRangeConcept<const SinglePassRange> ));
+        return std::adjacent_difference( boost::begin(rng), boost::end(rng),
                                          result );
     }
 
@@ -107,11 +108,11 @@ namespace boost
                                                 OutputIterator result,
                                                 BinaryOperation op )
     {
-        boost::function_requires< SinglePassRangeConcept<SinglePassRange> >();
-        return std::adjacent_difference( boost::begin(rng), boost::end(rng), 
+        BOOST_RANGE_CONCEPT_ASSERT(( SinglePassRangeConcept<SinglePassRange> ));
+        return std::adjacent_difference( boost::begin(rng), boost::end(rng),
                                          result, op );
     }
-    
+
 }
 
 #endif
diff --git a/test/Jamfile.v2 b/test/Jamfile.v2
index 2b2466f..645f5f9 100644
--- a/test/Jamfile.v2
+++ b/test/Jamfile.v2
@@ -91,12 +91,19 @@ test-suite range :
 	[ range-test algorithm_test/prev_permutation ]
 	[ range-test algorithm_test/random_shuffle ]
 	[ range-test algorithm_test/remove ]
+	[ range-test algorithm_test/remove_copy ]
+	[ range-test algorithm_test/remove_copy_if ]
 	[ range-test algorithm_test/remove_if ]
 	[ range-test algorithm_test/replace ]
+	[ range-test algorithm_test/replace_copy ]
+	[ range-test algorithm_test/replace_copy_if ]
 	[ range-test algorithm_test/replace_if ]
 	[ range-test algorithm_test/reverse ]
+	[ range-test algorithm_test/reverse_copy ]
 	[ range-test algorithm_test/rotate ]
+	[ range-test algorithm_test/rotate_copy ]
 	[ range-test algorithm_test/search ]
+	[ range-test algorithm_test/search_n ]
 	[ range-test algorithm_test/set_difference ]
 	[ range-test algorithm_test/set_intersection ]
 	[ range-test algorithm_test/set_symmetric_difference ]
@@ -104,8 +111,10 @@ test-suite range :
 	[ range-test algorithm_test/sort ]
 	[ range-test algorithm_test/stable_partition ]
 	[ range-test algorithm_test/stable_sort ]
+	[ range-test algorithm_test/swap_ranges ]
 	[ range-test algorithm_test/transform ]
 	[ range-test algorithm_test/unique ]
+	[ range-test algorithm_test/unique_copy ]
 	[ range-test algorithm_test/upper_bound ]
 	[ range-test algorithm_ext_test/copy_n ]
 	[ range-test algorithm_ext_test/erase ]
diff --git a/test/adaptor_test/map.cpp b/test/adaptor_test/map.cpp
index 73859b4..615b467 100644
--- a/test/adaptor_test/map.cpp
+++ b/test/adaptor_test/map.cpp
@@ -13,6 +13,7 @@
 #include <boost/test/test_tools.hpp>
 #include <boost/test/unit_test.hpp>
 
+#include <boost/array.hpp>
 #include <boost/assign.hpp>
 #include <boost/range/algorithm_ext.hpp>
 
@@ -111,6 +112,48 @@ namespace boost
         {
             map_test_impl< std::map<int,int> >();
         }
+
+        void test_trac_item_4388()
+        {
+            typedef std::pair<int,char> pair_t;
+            const boost::array<pair_t,3> ar = {{
+                pair_t(3, 'a'),
+                pair_t(1, 'b'),
+                pair_t(4, 'c')
+            }};
+
+            const boost::array<int, 3> expected_keys = {{ 3, 1, 4 }};
+            const boost::array<char, 3> expected_values = {{ 'a', 'b', 'c' }};
+
+            {
+                std::vector<int> test;
+                boost::push_back(test, ar | boost::adaptors::map_keys);
+                BOOST_CHECK_EQUAL_COLLECTIONS(
+                    expected_keys.begin(), expected_keys.end(),
+                    test.begin(), test.end()
+                );
+            }
+
+            {
+                std::vector<char> test;
+                boost::push_back(test, ar | boost::adaptors::map_values);
+                BOOST_CHECK_EQUAL_COLLECTIONS(
+                    expected_values.begin(), expected_values.end(),
+                    test.begin(), test.end()
+                );
+            }
+
+            {
+                std::vector<char> test;
+                boost::array<std::pair<int, char>, 3> src(ar);
+                boost::push_back(test, src | boost::adaptors::map_values);
+                BOOST_CHECK_EQUAL_COLLECTIONS(
+                    expected_values.begin(), expected_values.end(),
+                    test.begin(), test.end()
+                );
+            }
+        }
+
     }
 }
 
@@ -122,6 +165,7 @@ init_unit_test_suite(int argc, char* argv[])
         = BOOST_TEST_SUITE( "RangeTestSuite.adaptor.map" );
 
     test->add( BOOST_TEST_CASE( &boost::map_test ) );
+    test->add( BOOST_TEST_CASE( &boost::test_trac_item_4388 ) );
 
     return test;
 }
diff --git a/test/algorithm_test/adjacent_find.cpp b/test/algorithm_test/adjacent_find.cpp
index 914736b..63b65e8 100644
--- a/test/algorithm_test/adjacent_find.cpp
+++ b/test/algorithm_test/adjacent_find.cpp
@@ -9,7 +9,7 @@
 // For more information, see http://www.boost.org/libs/range/
 //
 #include <boost/range/algorithm/adjacent_find.hpp>
-
+#include <boost/range/iterator_range.hpp>
 #include <boost/test/test_tools.hpp>
 #include <boost/test/unit_test.hpp>
 
@@ -38,14 +38,18 @@ namespace boost
 
             BOOST_CHECK( boost::adjacent_find(cont) == cont.end() );
             BOOST_CHECK( boost::adjacent_find(cref_cont) == cref_cont.end() );
+            BOOST_CHECK( boost::adjacent_find(boost::make_iterator_range(cont)) == cont.end() );
             BOOST_CHECK( boost::adjacent_find(cont, pred) == cont.end() );
             BOOST_CHECK( boost::adjacent_find(cref_cont, pred) == cref_cont.end() );
+            BOOST_CHECK( boost::adjacent_find(boost::make_iterator_range(cont), pred) == cont.end() );
 
             cont += 1;
             BOOST_CHECK( boost::adjacent_find(cont) == cont.end() );
             BOOST_CHECK( boost::adjacent_find(cref_cont) == cref_cont.end() );
+            BOOST_CHECK( boost::adjacent_find(boost::make_iterator_range(cont)) == cont.end() );
             BOOST_CHECK( boost::adjacent_find(cont, pred) == cont.end() );
             BOOST_CHECK( boost::adjacent_find(cref_cont, pred) == cref_cont.end() );
+            BOOST_CHECK( boost::adjacent_find(boost::make_iterator_range(cont), pred) == cont.end() );
 
             cont += 2,3,4,5,5,5,6,7,8,9;
             iterator_t it = boost::adjacent_find(cont);
@@ -57,6 +61,8 @@ namespace boost
             {
                 BOOST_CHECK( *it == 5 );
             }
+            BOOST_CHECK( it == boost::adjacent_find(boost::make_iterator_range(cont)) );
+            BOOST_CHECK( it_pred == boost::adjacent_find(boost::make_iterator_range(cont), pred) );
             const_iterator_t cit = boost::adjacent_find(cref_cont);
             const_iterator_t cit_pred = boost::adjacent_find(cref_cont, pred);
             BOOST_CHECK( cit == cit_pred );
diff --git a/test/algorithm_test/binary_search.cpp b/test/algorithm_test/binary_search.cpp
index e0aca31..2646c2e 100644
--- a/test/algorithm_test/binary_search.cpp
+++ b/test/algorithm_test/binary_search.cpp
@@ -37,6 +37,8 @@ namespace boost
 
             BOOST_CHECK( reference_result == test_result );
 
+            BOOST_CHECK( test_result == boost::binary_search(boost::make_iterator_range(test), 5) );
+
             BOOST_CHECK_EQUAL_COLLECTIONS(
                 reference.begin(), reference.end(),
                 test.begin(), test.end()
@@ -68,6 +70,8 @@ namespace boost
 
             bool test_result = boost::binary_search(test, 5, pred);
 
+            BOOST_CHECK( test_result == boost::binary_search(boost::make_iterator_range(test), 5, pred) );
+
             BOOST_CHECK( reference_result == test_result );
 
             BOOST_CHECK_EQUAL_COLLECTIONS(
diff --git a/test/algorithm_test/copy.cpp b/test/algorithm_test/copy.cpp
index 932d190..47f4172 100644
--- a/test/algorithm_test/copy.cpp
+++ b/test/algorithm_test/copy.cpp
@@ -42,6 +42,13 @@ namespace boost
                 target.begin(), target.end(),
                 source.begin(), source.end()
                 );
+
+            it == boost::copy(boost::make_iterator_range(source), target.begin());
+            
+            BOOST_CHECK( it == target.end() );
+
+            BOOST_CHECK_EQUAL_COLLECTIONS(target.begin(), target.end(),
+                                          source.begin(), source.end());
         }
 
         void test_copy()
diff --git a/test/algorithm_test/copy_backward.cpp b/test/algorithm_test/copy_backward.cpp
index d66082a..3fd5679 100644
--- a/test/algorithm_test/copy_backward.cpp
+++ b/test/algorithm_test/copy_backward.cpp
@@ -39,6 +39,10 @@ namespace boost
             BOOST_CHECK( it == target.end() );
             BOOST_CHECK_EQUAL_COLLECTIONS( target.begin(), target.end(),
                 source.rbegin(), source.rend() );
+                
+            BOOST_CHECK( it == boost::copy_backward(boost::make_iterator_range(source), target.begin()) );
+            BOOST_CHECK_EQUAL_COLLECTIONS( target.begin(), target.end(),
+                                           source.rbegin(), source.rend() );
         }
 
         void test_copy_backward()
diff --git a/test/algorithm_test/copy_n.cpp b/test/algorithm_test/copy_n.cpp
new file mode 100644
index 0000000..230eb03
--- /dev/null
+++ b/test/algorithm_test/copy_n.cpp
@@ -0,0 +1,70 @@
+// 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/
+//
+#include <boost/range/algorithm/copy_n.hpp>
+
+#include <boost/test/test_tools.hpp>
+#include <boost/test/unit_test.hpp>
+
+#include <boost/assign.hpp>
+#include <boost/range/iterator.hpp>
+#include <algorithm>
+#include <list>
+#include <set>
+#include <vector>
+
+namespace
+{
+    template< class Container >
+    void test_copy_n_impl()
+    {
+        Container source;
+        typedef BOOST_DEDUCED_TYPENAME Container::value_type value_t;
+
+        std::vector<value_t> target;
+        target.resize(source.size());
+
+        typedef BOOST_DEDUCED_TYPENAME range_iterator< std::vector<value_t> >::type iterator_t;
+        iterator_t it = boost::copy(source, target.begin());
+
+        BOOST_CHECK( it == target.end() );
+
+        BOOST_CHECK_EQUAL_COLLECTIONS(
+            target.begin(), target.end(),
+            source.begin(), source.end()
+            );
+
+        it = boost::copy(boost::make_iterator_range(source), target.begin());
+
+        BOOST_CHECK( it == target.end() );
+
+        BOOST_CHECK_EQUAL_COLLECTIONS(target.begin(), target.end(),
+                                      source.begin(), source.end());
+    }
+
+    void test_copy_n()
+    {
+        test_copy_n_impl< std::vector<int> >();
+        test_copy_n_impl< std::list<int> >();
+        test_copy_n_impl< std::set<int> >();
+        test_copy_n_impl< std::multiset<int> >();
+    }
+}
+
+boost::unit_test::test_suite*
+init_unit_test_suite(int argc, char* argv[])
+{
+    boost::unit_test::test_suite* test
+        = BOOST_TEST_SUITE( "RangeTestSuite.algorithm.copy_n" );
+
+    test->add( BOOST_TEST_CASE( &::test_copy_n ) );
+
+    return test;
+}
diff --git a/test/algorithm_test/count.cpp b/test/algorithm_test/count.cpp
index d364710..90b2090 100644
--- a/test/algorithm_test/count.cpp
+++ b/test/algorithm_test/count.cpp
@@ -31,28 +31,36 @@ namespace boost
             Container cont;
             const Container& cref_cont = cont;
 
-            BOOST_CHECK_EQUAL( 0u, boost::count(cont, 0) );
-            BOOST_CHECK_EQUAL( 0u, boost::count(cref_cont, 0) );
+            BOOST_CHECK_EQUAL( 0u, boost::count(cont, 0u) );
+            BOOST_CHECK_EQUAL( 0u, boost::count(cref_cont, 0u) );
+            BOOST_CHECK_EQUAL( 0u, boost::count(boost::make_iterator_range(cont), 0u) );
 
             cont += 1;
-            BOOST_CHECK_EQUAL( 0u, boost::count(cont, 0) );
-            BOOST_CHECK_EQUAL( 0u, boost::count(cref_cont, 0) );
-            BOOST_CHECK_EQUAL( 1u, boost::count(cont, 1) );
-            BOOST_CHECK_EQUAL( 1u, boost::count(cref_cont, 1) );
+            BOOST_CHECK_EQUAL( 0u, boost::count(cont, 0u) );
+            BOOST_CHECK_EQUAL( 0u, boost::count(cref_cont, 0u) );
+            BOOST_CHECK_EQUAL( 0u, boost::count(boost::make_iterator_range(cont), 0u) );
+            BOOST_CHECK_EQUAL( 1u, boost::count(cont, 1u) );
+            BOOST_CHECK_EQUAL( 1u, boost::count(cref_cont, 1u) );
+            BOOST_CHECK_EQUAL( 1u, boost::count(boost::make_iterator_range(cont), 1u) );
 
             cont += 2,3,4,5,6,7,8,9;
-            BOOST_CHECK_EQUAL( 0u, boost::count(cont, 0) );
-            BOOST_CHECK_EQUAL( 0u, boost::count(cref_cont, 0) );
-            BOOST_CHECK_EQUAL( 1u, boost::count(cont, 1) );
-            BOOST_CHECK_EQUAL( 1u, boost::count(cref_cont, 1) );
+            BOOST_CHECK_EQUAL( 0u, boost::count(cont, 0u) );
+            BOOST_CHECK_EQUAL( 0u, boost::count(cref_cont, 0u) );
+            BOOST_CHECK_EQUAL( 0u, boost::count(boost::make_iterator_range(cont), 0u) );
+            BOOST_CHECK_EQUAL( 1u, boost::count(cont, 1u) );
+            BOOST_CHECK_EQUAL( 1u, boost::count(cref_cont, 1u) );
+            BOOST_CHECK_EQUAL( 1u, boost::count(boost::make_iterator_range(cont), 1u) );
 
             cont += 2;
-            BOOST_CHECK_EQUAL( 0u, boost::count(cont, 0) );
-            BOOST_CHECK_EQUAL( 0u, boost::count(cref_cont, 0) );
-            BOOST_CHECK_EQUAL( 1u, boost::count(cont, 1) );
-            BOOST_CHECK_EQUAL( 1u, boost::count(cref_cont, 1) );
-            BOOST_CHECK_EQUAL( 2u, boost::count(cont, 2) );
-            BOOST_CHECK_EQUAL( 2u, boost::count(cref_cont, 2) );
+            BOOST_CHECK_EQUAL( 0u, boost::count(cont, 0u) );
+            BOOST_CHECK_EQUAL( 0u, boost::count(cref_cont, 0u) );
+            BOOST_CHECK_EQUAL( 0u, boost::count(boost::make_iterator_range(cont), 0u) );
+            BOOST_CHECK_EQUAL( 1u, boost::count(cont, 1u) );
+            BOOST_CHECK_EQUAL( 1u, boost::count(cref_cont, 1u) );
+            BOOST_CHECK_EQUAL( 1u, boost::count(boost::make_iterator_range(cont), 1u) );
+            BOOST_CHECK_EQUAL( 2u, boost::count(cont, 2u) );
+            BOOST_CHECK_EQUAL( 2u, boost::count(cref_cont, 2u) );
+            BOOST_CHECK_EQUAL( 2u, boost::count(boost::make_iterator_range(cont), 2u) );
         }
 
         void test_count()
diff --git a/test/algorithm_test/count_if.cpp b/test/algorithm_test/count_if.cpp
index 11526b4..c3d1b8b 100644
--- a/test/algorithm_test/count_if.cpp
+++ b/test/algorithm_test/count_if.cpp
@@ -15,6 +15,7 @@
 
 #include <boost/assign.hpp>
 #include "../test_function/false_predicate.hpp"
+#include "../test_function/true_predicate.hpp"
 #include "../test_function/equal_to_x.hpp"
 #include <algorithm>
 #include <list>
@@ -38,29 +39,42 @@ namespace boost
 
             BOOST_CHECK_EQUAL( 0u, boost::count_if(cont, pred_t(0)) );
             BOOST_CHECK_EQUAL( 0u, boost::count_if(cref_cont, pred_t(0)) );
+            BOOST_CHECK_EQUAL( 0u, boost::count_if(boost::make_iterator_range(cont), pred_t(0)) );
 
             cont += 1;
             BOOST_CHECK_EQUAL( 0u, boost::count_if(cont, pred_t(0)) );
             BOOST_CHECK_EQUAL( 0u, boost::count_if(cref_cont, pred_t(0)) );
+            BOOST_CHECK_EQUAL( 0u, boost::count_if(boost::make_iterator_range(cont), pred_t(0)) );
             BOOST_CHECK_EQUAL( 1u, boost::count_if(cont, pred_t(1)) );
             BOOST_CHECK_EQUAL( 1u, boost::count_if(cref_cont, pred_t(1)) );
+            BOOST_CHECK_EQUAL( 1u, boost::count_if(boost::make_iterator_range(cont), pred_t(1)) );
 
             cont += 2,3,4,5,6,7,8,9;
             BOOST_CHECK_EQUAL( 0u, boost::count_if(cont, pred_t(0)) );
             BOOST_CHECK_EQUAL( 0u, boost::count_if(cref_cont, pred_t(0)) );
+            BOOST_CHECK_EQUAL( 0u, boost::count_if(boost::make_iterator_range(cont), pred_t(0)) );
             BOOST_CHECK_EQUAL( 1u, boost::count_if(cont, pred_t(1)) );
             BOOST_CHECK_EQUAL( 1u, boost::count_if(cref_cont, pred_t(1)) );
+            BOOST_CHECK_EQUAL( 1u, boost::count_if(boost::make_iterator_range(cont), pred_t(1)) );
 
             cont += 2;
             BOOST_CHECK_EQUAL( 0u, boost::count_if(cont, pred_t(0)) );
             BOOST_CHECK_EQUAL( 0u, boost::count_if(cref_cont, pred_t(0)) );
+            BOOST_CHECK_EQUAL( 0u, boost::count_if(boost::make_iterator_range(cont), pred_t(0)) );
             BOOST_CHECK_EQUAL( 1u, boost::count_if(cont, pred_t(1)) );
             BOOST_CHECK_EQUAL( 1u, boost::count_if(cref_cont, pred_t(1)) );
+            BOOST_CHECK_EQUAL( 1u, boost::count_if(boost::make_iterator_range(cont), pred_t(1)) );
             BOOST_CHECK_EQUAL( 2u, boost::count_if(cont, pred_t(2)) );
             BOOST_CHECK_EQUAL( 2u, boost::count_if(cref_cont, pred_t(2)) );
+            BOOST_CHECK_EQUAL( 2u, boost::count_if(boost::make_iterator_range(cont), pred_t(2)) );
 
             BOOST_CHECK_EQUAL( 0u, boost::count_if(cont, false_predicate()) );
             BOOST_CHECK_EQUAL( 0u, boost::count_if(cref_cont, false_predicate()) );
+            BOOST_CHECK_EQUAL( 0u, boost::count_if(boost::make_iterator_range(cont), false_predicate()) );
+
+            BOOST_CHECK_EQUAL( cont.size(), boost::count_if(cont, true_predicate()) );
+            BOOST_CHECK_EQUAL( cont.size(), boost::count_if(cref_cont, true_predicate()) );
+            BOOST_CHECK_EQUAL( cont.size(), boost::count_if(boost::make_iterator_range(cont), true_predicate()) );
         }
 
         void test_count_if()
diff --git a/test/algorithm_test/equal.cpp b/test/algorithm_test/equal.cpp
index d750706..243f064 100644
--- a/test/algorithm_test/equal.cpp
+++ b/test/algorithm_test/equal.cpp
@@ -38,30 +38,70 @@ namespace boost
             Container2& cont2 = mcont2;
 
             BOOST_CHECK( boost::equal(cont1, cont2) );
+            BOOST_CHECK( boost::equal(boost::make_iterator_range(cont1), cont2) );
+            BOOST_CHECK( boost::equal(cont1, boost::make_iterator_range(cont2)) );
+            BOOST_CHECK( boost::equal(boost::make_iterator_range(cont1), boost::make_iterator_range(cont2)) );
             BOOST_CHECK( boost::equal(cont1, cont2, std::equal_to<int>()) );
+            BOOST_CHECK( boost::equal(boost::make_iterator_range(cont1), cont2, std::equal_to<int>()) );
+            BOOST_CHECK( boost::equal(cont1, boost::make_iterator_range(cont2), std::equal_to<int>()) );
+            BOOST_CHECK( boost::equal(boost::make_iterator_range(cont1), boost::make_iterator_range(cont2), std::equal_to<int>()) );
             BOOST_CHECK( boost::equal(cont1, cont2, std::not_equal_to<int>()) );
+            BOOST_CHECK( boost::equal(boost::make_iterator_range(cont1), cont2, std::not_equal_to<int>()) );
+            BOOST_CHECK( boost::equal(boost::make_iterator_range(cont1), boost::make_iterator_range(cont2), std::not_equal_to<int>()) );
 
             mcont1 += 1;
             BOOST_CHECK( !boost::equal(cont1, cont2) );
+            BOOST_CHECK( !boost::equal(boost::make_iterator_range(cont1), cont2) );
+            BOOST_CHECK( !boost::equal(cont1, boost::make_iterator_range(cont2)) );
+            BOOST_CHECK( !boost::equal(boost::make_iterator_range(cont1), boost::make_iterator_range(cont2)) );
             BOOST_CHECK( !boost::equal(cont1, cont2, std::equal_to<int>()) );
+            BOOST_CHECK( !boost::equal(boost::make_iterator_range(cont1), cont2, std::equal_to<int>()) );
+            BOOST_CHECK( !boost::equal(cont1, boost::make_iterator_range(cont2), std::equal_to<int>()) );
+            BOOST_CHECK( !boost::equal(boost::make_iterator_range(cont1), boost::make_iterator_range(cont2), std::equal_to<int>()) );
             BOOST_CHECK( !boost::equal(cont1, cont2, std::not_equal_to<int>()) );
+            BOOST_CHECK( !boost::equal(boost::make_iterator_range(cont1), cont2, std::not_equal_to<int>()) );
+            BOOST_CHECK( !boost::equal(boost::make_iterator_range(cont1), boost::make_iterator_range(cont2), std::not_equal_to<int>()) );
 
             mcont1.clear();
             mcont2 += 1;
             BOOST_CHECK( !boost::equal(cont1, cont2) );
+            BOOST_CHECK( !boost::equal(boost::make_iterator_range(cont1), cont2) );
+            BOOST_CHECK( !boost::equal(boost::make_iterator_range(cont1), boost::make_iterator_range(cont2)) );
             BOOST_CHECK( !boost::equal(cont1, cont2, std::equal_to<int>()) );
+            BOOST_CHECK( !boost::equal(boost::make_iterator_range(cont1), cont2, std::equal_to<int>()) );
+            BOOST_CHECK( !boost::equal(boost::make_iterator_range(cont1), boost::make_iterator_range(cont2), std::equal_to<int>()) );
             BOOST_CHECK( !boost::equal(cont1, cont2, std::not_equal_to<int>()) );
+            BOOST_CHECK( !boost::equal(boost::make_iterator_range(cont1), cont2, std::not_equal_to<int>()) );
+            BOOST_CHECK( !boost::equal(boost::make_iterator_range(cont1), boost::make_iterator_range(cont2), std::not_equal_to<int>()) );
 
             mcont1 += 1;
             BOOST_CHECK( boost::equal(cont1, cont2) );
+            BOOST_CHECK( boost::equal(boost::make_iterator_range(cont1), cont2) );
+            BOOST_CHECK( boost::equal(cont1, boost::make_iterator_range(cont2)) );
+            BOOST_CHECK( boost::equal(boost::make_iterator_range(cont1), boost::make_iterator_range(cont2)) );
             BOOST_CHECK( boost::equal(cont1, cont2, std::equal_to<int>()) );
+            BOOST_CHECK( boost::equal(boost::make_iterator_range(cont1), cont2, std::equal_to<int>()) );
+            BOOST_CHECK( boost::equal(cont1, boost::make_iterator_range(cont2), std::equal_to<int>()) );
+            BOOST_CHECK( boost::equal(boost::make_iterator_range(cont1), boost::make_iterator_range(cont2), std::equal_to<int>()) );
             BOOST_CHECK( !boost::equal(cont1, cont2, std::not_equal_to<int>()) );
+            BOOST_CHECK( !boost::equal(boost::make_iterator_range(cont1), cont2, std::not_equal_to<int>()) );
+            BOOST_CHECK( !boost::equal(cont1, boost::make_iterator_range(cont2), std::not_equal_to<int>()) );
+            BOOST_CHECK( !boost::equal(boost::make_iterator_range(cont1), boost::make_iterator_range(cont2), std::not_equal_to<int>()) );
 
             mcont1 += 2,3,4,5,6,7,8,9;
             mcont2 += 2,3,4,5,6,7,8,9;
             BOOST_CHECK( boost::equal(cont1, cont2) );
+            BOOST_CHECK( boost::equal(boost::make_iterator_range(cont1), cont2) );
+            BOOST_CHECK( boost::equal(cont1, boost::make_iterator_range(cont2)) );
+            BOOST_CHECK( boost::equal(boost::make_iterator_range(cont1), boost::make_iterator_range(cont2)) );
             BOOST_CHECK( boost::equal(cont1, cont2, std::equal_to<int>()) );
+            BOOST_CHECK( boost::equal(boost::make_iterator_range(cont1), cont2, std::equal_to<int>()) );
+            BOOST_CHECK( boost::equal(cont1, boost::make_iterator_range(cont2), std::equal_to<int>()) );
+            BOOST_CHECK( boost::equal(boost::make_iterator_range(cont1), boost::make_iterator_range(cont2), std::equal_to<int>()) );
             BOOST_CHECK( !boost::equal(cont1, cont2, std::not_equal_to<int>()) );
+            BOOST_CHECK( !boost::equal(boost::make_iterator_range(cont1), cont2, std::not_equal_to<int>()) );
+            BOOST_CHECK( !boost::equal(cont1, boost::make_iterator_range(cont2), std::not_equal_to<int>()) );
+            BOOST_CHECK( !boost::equal(boost::make_iterator_range(cont1), boost::make_iterator_range(cont2), std::not_equal_to<int>()) );
         }
 
         template< class Container1, class Container2 >
diff --git a/test/algorithm_test/equal_range.cpp b/test/algorithm_test/equal_range.cpp
index 652508c..612f1a4 100644
--- a/test/algorithm_test/equal_range.cpp
+++ b/test/algorithm_test/equal_range.cpp
@@ -70,8 +70,11 @@ namespace boost
 
             pair_t test_result = boost::equal_range(test, 5);
 
-            check_result(reference, reference_result,
-                         test, test_result);
+            check_result(reference, reference_result, test, test_result);
+
+            pair_t test_result2 = boost::equal_range(boost::make_iterator_range(test), 5);
+
+            check_result(reference, reference_result, test, test_result2);
         }
 
         template<class Container, class BinaryPredicate>
@@ -107,8 +110,11 @@ namespace boost
 
             pair_t test_result = boost::equal_range(test, 5, BinaryPredicate());
 
-            check_result(reference, reference_result,
-                         test, test_result);
+            check_result(reference, reference_result, test, test_result);
+
+            pair_t test_result2 = boost::equal_range(boost::make_iterator_range(test), 5, BinaryPredicate());
+
+            check_result(reference, reference_result, test, test_result2);
         }
 
         template<class Container>
diff --git a/test/algorithm_test/fill.cpp b/test/algorithm_test/fill.cpp
index 93dba7e..2f975c4 100644
--- a/test/algorithm_test/fill.cpp
+++ b/test/algorithm_test/fill.cpp
@@ -36,6 +36,12 @@ namespace boost
 
             BOOST_CHECK_EQUAL_COLLECTIONS( reference.begin(), reference.end(),
                 target.begin(), target.end() );
+
+            Container target2(cont);
+            boost::fill(boost::make_iterator_range(target2), 1);
+
+            BOOST_CHECK_EQUAL_COLLECTIONS( reference.begin(), reference.end(),
+                                           target2.begin(), target2.end() );
         }
 
         template< class Container >
diff --git a/test/algorithm_test/find.cpp b/test/algorithm_test/find.cpp
index fd179f1..6eb1528 100644
--- a/test/algorithm_test/find.cpp
+++ b/test/algorithm_test/find.cpp
@@ -33,7 +33,11 @@ namespace boost
             BOOST_DEDUCED_TYPENAME range_iterator<Container>::type
             test_iter(Container& cont)
             {
-                return boost::find(cont, 3);
+                typedef BOOST_DEDUCED_TYPENAME range_iterator<Container>::type iter_t;
+                iter_t result = boost::find(cont, 3);
+                iter_t result2 = boost::find(boost::make_iterator_range(cont), 3);
+                BOOST_CHECK( result == result2 );
+                return result;
             }
 
             template<range_return_value return_type>
@@ -43,7 +47,11 @@ namespace boost
                 BOOST_DEDUCED_TYPENAME range_return<Container,return_type>::type
                 operator()(Policy&, Container& cont)
                 {
-                    return boost::find<return_type>(cont, 3);
+                    typedef BOOST_DEDUCED_TYPENAME range_return<Container,return_type>::type result_t;
+                    result_t result = boost::find<return_type>(cont, 3);
+                    result_t result2 = boost::find<return_type>(boost::make_iterator_range(cont), 3);
+                    BOOST_CHECK( result == result2 );
+                    return result;
                 }
             };
 
@@ -90,6 +98,8 @@ namespace boost
             std::vector<int> vi;
             const std::vector<int>& cvi = vi;
             std::vector<int>::const_iterator it = boost::find(vi, 0);
+            std::vector<int>::const_iterator it2 = boost::find(cvi, 0);
+            BOOST_CHECK( it == it2 );
         }
     }
 }
diff --git a/test/algorithm_test/find_end.cpp b/test/algorithm_test/find_end.cpp
index a126e87..0592d5f 100644
--- a/test/algorithm_test/find_end.cpp
+++ b/test/algorithm_test/find_end.cpp
@@ -41,7 +41,12 @@ namespace boost
             BOOST_DEDUCED_TYPENAME range_iterator<Container>::type
             test_iter(Container& cont)
             {
-                return boost::find_end(cont, m_cont);
+                typedef BOOST_DEDUCED_TYPENAME range_iterator<Container>::type iter_t;
+                iter_t result = boost::find_end(cont, m_cont);
+                BOOST_CHECK( result == boost::find_end(boost::make_iterator_range(cont), m_cont) );
+                BOOST_CHECK( result == boost::find_end(cont, boost::make_iterator_range(m_cont)) );
+                BOOST_CHECK( result == boost::find_end(boost::make_iterator_range(cont), boost::make_iterator_range(m_cont)) );
+                return result;
             }
 
             template<range_return_value return_type>
@@ -51,7 +56,13 @@ namespace boost
                 BOOST_DEDUCED_TYPENAME range_return<Container,return_type>::type
                 operator()(Policy& policy, Container& cont)
                 {
-                    return boost::find_end<return_type>(cont, policy.cont());
+                    typedef BOOST_DEDUCED_TYPENAME range_return<Container,return_type>::type result_t;
+                    result_t result = boost::find_end<return_type>(cont, policy.cont());
+                    BOOST_CHECK( result == boost::find_end<return_type>(boost::make_iterator_range(cont), policy.cont()) );
+                    BOOST_CHECK( result == boost::find_end<return_type>(cont, boost::make_iterator_range(policy.cont())) );
+                    BOOST_CHECK( result == boost::find_end<return_type>(boost::make_iterator_range(cont),
+                                                                        boost::make_iterator_range(policy.cont())) );
+                    return result;
                 }
             };
 
@@ -84,7 +95,12 @@ namespace boost
             BOOST_DEDUCED_TYPENAME range_iterator<Container>::type
             test_iter(Container& cont)
             {
-                return boost::find_end(cont, m_cont, m_pred);
+                typedef BOOST_DEDUCED_TYPENAME range_iterator<Container>::type iter_t;
+                iter_t it = boost::find_end(cont, m_cont, m_pred);
+                BOOST_CHECK( it == boost::find_end(boost::make_iterator_range(cont), m_cont, m_pred) );
+                BOOST_CHECK( it == boost::find_end(cont, boost::make_iterator_range(m_cont), m_pred) );
+                BOOST_CHECK( it == boost::find_end(boost::make_iterator_range(cont), boost::make_iterator_range(m_cont), m_pred) );
+                return it;
             }
 
             template<range_return_value return_type>
@@ -94,6 +110,12 @@ namespace boost
                 BOOST_DEDUCED_TYPENAME range_return<Container,return_type>::type
                 operator()(Policy& policy, Container& cont)
                 {
+                    typedef BOOST_DEDUCED_TYPENAME range_return<Container,return_type>::type result_t;
+                    result_t result = boost::find_end<return_type>(cont, policy.cont(), policy.pred());
+                    BOOST_CHECK( result == boost::find_end<return_type>(boost::make_iterator_range(cont), policy.cont(), policy.pred()) );
+                    BOOST_CHECK( result == boost::find_end<return_type>(cont, boost::make_iterator_range(policy.cont()), policy.pred()) );
+                    BOOST_CHECK( result == boost::find_end<return_type>(boost::make_iterator_range(cont),
+                                                                        boost::make_iterator_range(policy.cont()), policy.pred()) );
                     return boost::find_end<return_type>(cont, policy.cont(), policy.pred());
                 }
             };
diff --git a/test/algorithm_test/find_first_of.cpp b/test/algorithm_test/find_first_of.cpp
index 9ff7adb..c96d36a 100644
--- a/test/algorithm_test/find_first_of.cpp
+++ b/test/algorithm_test/find_first_of.cpp
@@ -41,7 +41,12 @@ namespace boost
             BOOST_DEDUCED_TYPENAME range_iterator<Container>::type
             test_iter(Container& cont)
             {
-                return boost::find_first_of(cont, m_cont);
+                typedef BOOST_DEDUCED_TYPENAME range_iterator<Container>::type iter_t;
+                iter_t result = boost::find_first_of(cont, m_cont);
+                BOOST_CHECK( result == boost::find_first_of(boost::make_iterator_range(cont), m_cont) );
+                BOOST_CHECK( result == boost::find_first_of(cont, boost::make_iterator_range(m_cont)) );
+                BOOST_CHECK( result == boost::find_first_of(boost::make_iterator_range(cont), boost::make_iterator_range(m_cont)) );
+                return result;
             }
 
             template<range_return_value return_type>
@@ -51,7 +56,12 @@ namespace boost
                 BOOST_DEDUCED_TYPENAME range_return<Container,return_type>::type
                 operator()(Policy& policy, Container& cont)
                 {
-                    return boost::find_first_of<return_type>(cont, policy.cont());
+                    typedef BOOST_DEDUCED_TYPENAME range_return<Container,return_type>::type result_t;
+                    result_t result = boost::find_first_of<return_type>(cont, policy.cont());
+                    BOOST_CHECK( result == boost::find_first_of<return_type>(boost::make_iterator_range(cont), policy.cont()) );
+                    BOOST_CHECK( result == boost::find_first_of<return_type>(cont, boost::make_iterator_range(policy.cont())) );
+                    BOOST_CHECK( result == boost::find_first_of<return_type>(boost::make_iterator_range(cont), boost::make_iterator_range(policy.cont())) );
+                    return result;
                 }
             };
 
@@ -84,7 +94,12 @@ namespace boost
             BOOST_DEDUCED_TYPENAME range_iterator<Container>::type
             test_iter(Container& cont)
             {
-                return boost::find_first_of(cont, m_cont, m_pred);
+                typedef BOOST_DEDUCED_TYPENAME range_iterator<Container>::type iter_t;
+                iter_t result = boost::find_first_of(cont, m_cont, m_pred);
+                BOOST_CHECK( result == boost::find_first_of(boost::make_iterator_range(cont), m_cont, m_pred) );
+                BOOST_CHECK( result == boost::find_first_of(cont, boost::make_iterator_range(m_cont), m_pred) );
+                BOOST_CHECK( result == boost::find_first_of(boost::make_iterator_range(cont), boost::make_iterator_range(m_cont), m_pred) );
+                return result;
             }
 
             template<range_return_value return_type>
@@ -94,7 +109,12 @@ namespace boost
                 BOOST_DEDUCED_TYPENAME range_return<Container,return_type>::type
                 operator()(Policy& policy, Container& cont)
                 {
-                    return boost::find_first_of<return_type>(cont, policy.cont(), policy.pred());
+                    typedef BOOST_DEDUCED_TYPENAME range_return<Container,return_type>::type result_t;
+                    result_t result = boost::find_first_of<return_type>(cont, policy.cont(), policy.pred());
+                    BOOST_CHECK( result == boost::find_first_of<return_type>(boost::make_iterator_range(cont), policy.cont(), policy.pred()) );
+                    BOOST_CHECK( result == boost::find_first_of<return_type>(cont, boost::make_iterator_range(policy.cont()), policy.pred()) );
+                    BOOST_CHECK( result == boost::find_first_of<return_type>(boost::make_iterator_range(cont), boost::make_iterator_range(policy.cont()), policy.pred()) );
+                    return result;
                 }
             };
 
@@ -103,8 +123,8 @@ namespace boost
             reference(Container& cont)
             {
                 return std::find_first_of(cont.begin(), cont.end(),
-                                     m_cont.begin(), m_cont.end(),
-                                     m_pred);
+                                          m_cont.begin(), m_cont.end(),
+                                          m_pred);
             }
 
         private:
diff --git a/test/algorithm_test/find_if.cpp b/test/algorithm_test/find_if.cpp
index a5fe459..04fe6f2 100644
--- a/test/algorithm_test/find_if.cpp
+++ b/test/algorithm_test/find_if.cpp
@@ -38,7 +38,10 @@ namespace boost
             BOOST_DEDUCED_TYPENAME range_iterator<Container>::type
             test_iter(Container& cont)
             {
-                return boost::find_if(cont, m_pred);
+                typedef BOOST_DEDUCED_TYPENAME range_iterator<Container>::type iter_t;
+                iter_t result = boost::find_if(cont, m_pred);
+                BOOST_CHECK( result == boost::find_if(boost::make_iterator_range(cont), m_pred) );
+                return result;
             }
 
             template<range_return_value return_type>
@@ -48,7 +51,10 @@ namespace boost
                 BOOST_DEDUCED_TYPENAME range_return<Container,return_type>::type
                 operator()(find_if_test_policy& policy, Container& cont)
                 {
-                    return boost::find_if<return_type>(cont, policy.pred());
+                    typedef BOOST_DEDUCED_TYPENAME range_return<Container,return_type>::type result_t;
+                    result_t result = boost::find_if<return_type>(cont, policy.pred());
+                    BOOST_CHECK( result == boost::find_if<return_type>(boost::make_iterator_range(cont), policy.pred()) );
+                    return result;
                 }
             };
 
diff --git a/test/algorithm_test/for_each.cpp b/test/algorithm_test/for_each.cpp
index ac517ad..2ef51bf 100644
--- a/test/algorithm_test/for_each.cpp
+++ b/test/algorithm_test/for_each.cpp
@@ -26,6 +26,12 @@ namespace boost
 {
     namespace
     {
+        template< class Range >
+        unsigned int udistance(Range& rng)
+        {
+            return static_cast<unsigned int>(boost::distance(rng));
+        }
+
         template< class SinglePassRange >
         void test_for_each_impl( SinglePassRange rng )
         {
@@ -35,12 +41,15 @@ namespace boost
 
             // Test the mutable version
             fn_t result_fn = boost::for_each(rng, fn_t(rng));
-            BOOST_CHECK_EQUAL( boost::distance(rng), result_fn.invocation_count() );
+            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() );
 
             // Test the constant version
             const SinglePassRange& cref_rng = rng;
             result_fn = boost::for_each(cref_rng, fn_t(cref_rng));
-            BOOST_CHECK_EQUAL( boost::distance(cref_rng), result_fn.invocation_count() );
+            BOOST_CHECK_EQUAL( boost::udistance(cref_rng), result_fn.invocation_count() );
         }
 
         template< class Container >
@@ -51,7 +60,7 @@ namespace boost
             // Test empty
             Container cont;
             test_for_each_impl(cont);
-            
+
             // Test one element
             cont += 0;
             test_for_each_impl(cont);
@@ -63,7 +72,7 @@ namespace boost
 
         void test_for_each()
         {
-            boost::array<int, 10> a = { 0,1,2,3,4,5,6,7,8,9 };
+            boost::array<int, 10> a = {{ 0,1,2,3,4,5,6,7,8,9 }};
             test_for_each_impl(a);
 
             test_for_each_t< std::vector<int> >();
@@ -79,8 +88,8 @@ init_unit_test_suite(int argc, char* argv[])
 {
     boost::unit_test::test_suite* test
         = BOOST_TEST_SUITE( "RangeTestSuite.algorithm.for_each" );
-    
+
     test->add( BOOST_TEST_CASE( &boost::test_for_each ) );
-    
+
     return test;
 }
diff --git a/test/algorithm_test/generate.cpp b/test/algorithm_test/generate.cpp
index ab47b06..d8fc0e6 100644
--- a/test/algorithm_test/generate.cpp
+++ b/test/algorithm_test/generate.cpp
@@ -49,6 +49,12 @@ namespace boost
 
             BOOST_CHECK_EQUAL_COLLECTIONS( reference.begin(), reference.end(),
                 test.begin(), test.end() );
+                
+            Container test2(cont);
+            boost::generate(boost::make_iterator_range(test2), generator_fn());
+            
+            BOOST_CHECK_EQUAL_COLLECTIONS( reference.begin(), reference.end(),
+                                           test2.begin(), test2.end() );
         }
 
         template< class Container >
diff --git a/test/algorithm_test/heap.cpp b/test/algorithm_test/heap.cpp
index 933d1f6..74b7fa3 100644
--- a/test/algorithm_test/heap.cpp
+++ b/test/algorithm_test/heap.cpp
@@ -41,28 +41,39 @@ namespace boost
             reference += 1,2,3,4,5,6,7,8,9;
 
             std::vector<int> test_cont(reference);
+            std::vector<int> test_cont2(reference);
 
             std::make_heap(reference.begin(), reference.end());
             boost::make_heap(test_cont);
             check_equal(reference, test_cont);
+            boost::make_heap(boost::make_iterator_range(test_cont2));
+            check_equal(reference, test_cont2);
 
             std::push_heap(reference.begin(), reference.end());
             boost::push_heap(test_cont);
             check_equal(reference, test_cont);
+            boost::push_heap(boost::make_iterator_range(test_cont2));
+            check_equal(reference, test_cont2);
 
             std::make_heap(reference.begin(), reference.end());
             boost::make_heap(test_cont);
+            boost::make_heap(boost::make_iterator_range(test_cont2));
 
             std::sort_heap(reference.begin(), reference.end());
             boost::sort_heap(test_cont);
             check_equal(reference, test_cont);
+            boost::sort_heap(boost::make_iterator_range(test_cont2));
+            check_equal(reference, test_cont2);
 
             std::make_heap(reference.begin(), reference.end());
             boost::make_heap(test_cont);
+            boost::make_heap(boost::make_iterator_range(test_cont2));
 
             std::pop_heap(reference.begin(), reference.end());
             boost::pop_heap(test_cont);
             check_equal(reference, test_cont);
+            boost::pop_heap(boost::make_iterator_range(test_cont2));
+            check_equal(reference, test_cont2);
         }
 
         template<class BinaryPredicate>
@@ -75,30 +86,42 @@ namespace boost
             std::sort(reference.begin(), reference.end(), pred);
 
             std::vector<int> test_cont(reference);
+            std::vector<int> test_cont2(reference);
 
             std::make_heap(reference.begin(), reference.end(), pred);
             boost::make_heap(test_cont, pred);
             check_equal(reference, test_cont);
+            boost::make_heap(boost::make_iterator_range(test_cont2), pred);
+            check_equal(reference, test_cont2);
 
             reference.push_back(5);
             test_cont.push_back(5);
+            test_cont2.push_back(5);
             std::push_heap(reference.begin(), reference.end(), pred);
             boost::push_heap(test_cont, pred);
             check_equal(reference, test_cont);
+            boost::push_heap(boost::make_iterator_range(test_cont2), pred);
+            check_equal(reference, test_cont2);
 
             std::make_heap(reference.begin(), reference.end(), pred);
             boost::make_heap(test_cont, pred);
+            boost::make_heap(boost::make_iterator_range(test_cont2), pred);
 
             std::sort_heap(reference.begin(), reference.end(), pred);
             boost::sort_heap(test_cont, pred);
             check_equal(reference, test_cont);
+            boost::sort_heap(boost::make_iterator_range(test_cont2), pred);
+            check_equal(reference, test_cont2);
 
             std::make_heap(reference.begin(), reference.end(), pred);
             boost::make_heap(test_cont, pred);
+            boost::make_heap(boost::make_iterator_range(test_cont2), pred);
 
             std::pop_heap(reference.begin(), reference.end(), pred);
             boost::pop_heap(test_cont, pred);
             check_equal(reference, test_cont);
+            boost::pop_heap(boost::make_iterator_range(test_cont2), pred);
+            check_equal(reference, test_cont2);
         }
 
         void test_heap()
diff --git a/test/algorithm_test/includes.cpp b/test/algorithm_test/includes.cpp
index f928957..8977532 100644
--- a/test/algorithm_test/includes.cpp
+++ b/test/algorithm_test/includes.cpp
@@ -46,6 +46,10 @@ namespace boost
                 old_cont2.begin(), old_cont2.end(),
                 cont2.begin(), cont2.end()
                 );
+                
+            BOOST_CHECK( test_result == boost::includes(boost::make_iterator_range(cont1), cont2) );
+            BOOST_CHECK( test_result == boost::includes(cont1, boost::make_iterator_range(cont2)) );
+            BOOST_CHECK( test_result == boost::includes(boost::make_iterator_range(cont1), boost::make_iterator_range(cont2)) );
         }
 
         template<class Container, class BinaryPredicate>
@@ -88,6 +92,10 @@ namespace boost
                 old_cont2.begin(), old_cont2.end(),
                 cont2.begin(), cont2.end()
                 );
+                
+            BOOST_CHECK( test_result == boost::includes(boost::make_iterator_range(cont1), cont2, pred) );
+            BOOST_CHECK( test_result == boost::includes(cont1, boost::make_iterator_range(cont2), pred) );
+            BOOST_CHECK( test_result == boost::includes(boost::make_iterator_range(cont1), boost::make_iterator_range(cont2), pred) );
         }
 
         template<class Container1, class Container2>
diff --git a/test/algorithm_test/inplace_merge.cpp b/test/algorithm_test/inplace_merge.cpp
index f109257..d0cad73 100644
--- a/test/algorithm_test/inplace_merge.cpp
+++ b/test/algorithm_test/inplace_merge.cpp
@@ -35,6 +35,7 @@ namespace boost
                                     cont2.begin(), cont2.end());
 
             std::vector<value_t> test_target(reference_target);
+            std::vector<value_t> test_target2(reference_target);
 
             std::inplace_merge(reference_target.begin(),
                                reference_target.begin() + cont1.size(),
@@ -47,6 +48,14 @@ namespace boost
                 reference_target.begin(), reference_target.end(),
                 test_target.begin(), test_target.end()
                 );
+                
+            boost::inplace_merge(boost::make_iterator_range(test_target2),
+                                 test_target2.begin() + cont1.size());
+                                 
+            BOOST_CHECK_EQUAL_COLLECTIONS(
+                reference_target.begin(), reference_target.end(),
+                test_target2.begin(), test_target2.end()
+                );
         }
 
         template<class Container, class BinaryPredicate>
@@ -75,6 +84,7 @@ namespace boost
                                     cont2.begin(), cont2.end());
 
             std::vector<value_t> test_target(reference_target);
+            std::vector<value_t> test_target2(reference_target);
 
             std::inplace_merge(reference_target.begin(),
                                reference_target.begin() + cont1.size(),
@@ -88,6 +98,15 @@ namespace boost
                 reference_target.begin(), reference_target.end(),
                 test_target.begin(), test_target.end()
                 );
+
+            boost::inplace_merge(boost::make_iterator_range(test_target2),
+                                 test_target2.begin() + cont1.size(),
+                                 pred);
+                                 
+            BOOST_CHECK_EQUAL_COLLECTIONS(
+                reference_target.begin(), reference_target.end(),
+                test_target2.begin(), test_target2.end()
+                );
         }
 
         template<class Container1, class Container2>
diff --git a/test/algorithm_test/lexicographical_compare.cpp b/test/algorithm_test/lexicographical_compare.cpp
index c57f390..f724bd1 100644
--- a/test/algorithm_test/lexicographical_compare.cpp
+++ b/test/algorithm_test/lexicographical_compare.cpp
@@ -28,13 +28,16 @@ namespace boost
         void test_lexicographical_compare_impl_nopred(ForwardRange1& rng1,
                                                       ForwardRange2& rng2)
         {
-            bool reference = std::lexicographical_compare(
+            const bool reference = std::lexicographical_compare(
                 boost::begin(rng1), boost::end(rng1),
                 boost::begin(rng2), boost::end(rng2));
 
-            bool test = boost::lexicographical_compare(rng1, rng2);
+            const bool test = boost::lexicographical_compare(rng1, rng2);
 
             BOOST_CHECK( reference == test );
+            BOOST_CHECK( test == boost::lexicographical_compare(boost::make_iterator_range(rng1), rng2) );
+            BOOST_CHECK( test == boost::lexicographical_compare(rng1, boost::make_iterator_range(rng2)) );
+            BOOST_CHECK( test == boost::lexicographical_compare(boost::make_iterator_range(rng1), boost::make_iterator_range(rng2)) );
         }
 
         template<class ForwardRange1, class ForwardRange2,
@@ -43,14 +46,17 @@ namespace boost
                                                     ForwardRange2& rng2,
                                                     BinaryPredicate pred)
         {
-            bool reference = std::lexicographical_compare(
+            const bool reference = std::lexicographical_compare(
                 boost::begin(rng1), boost::end(rng1),
                 boost::begin(rng2), boost::end(rng2),
                 pred);
 
-            bool test = boost::lexicographical_compare(rng1, rng2, pred);
+            const bool test = boost::lexicographical_compare(rng1, rng2, pred);
 
             BOOST_CHECK( reference == test );
+            BOOST_CHECK( test == boost::lexicographical_compare(boost::make_iterator_range(rng1), rng2, pred) );
+            BOOST_CHECK( test == boost::lexicographical_compare(rng1, boost::make_iterator_range(rng2), pred) );
+            BOOST_CHECK( test == boost::lexicographical_compare(boost::make_iterator_range(rng1), boost::make_iterator_range(rng2), pred) );
         }
 
         template<class Container1, class Container2>
diff --git a/test/algorithm_test/lower_bound.cpp b/test/algorithm_test/lower_bound.cpp
index ca622bc..e627708 100644
--- a/test/algorithm_test/lower_bound.cpp
+++ b/test/algorithm_test/lower_bound.cpp
@@ -33,7 +33,10 @@ namespace boost
             BOOST_DEDUCED_TYPENAME range_iterator<Container>::type
             test_iter(Container& cont)
             {
-                return boost::lower_bound(cont, 5);
+                typedef BOOST_DEDUCED_TYPENAME range_iterator<Container>::type iter_t;
+                iter_t result = boost::lower_bound(cont, 5);
+                BOOST_CHECK( result == boost::lower_bound(boost::make_iterator_range(cont), 5) );
+                return result;
             }
 
             template<range_return_value return_type>
@@ -43,7 +46,10 @@ namespace boost
                 BOOST_DEDUCED_TYPENAME range_return<Container,return_type>::type
                 operator()(Policy&, Container& cont)
                 {
-                    return boost::lower_bound<return_type>(cont, 5);
+                    typedef BOOST_DEDUCED_TYPENAME range_return<Container,return_type>::type result_t;
+                    result_t result = boost::lower_bound<return_type>(cont, 5);
+                    BOOST_CHECK( result == boost::lower_bound<return_type>(boost::make_iterator_range(cont), 5) );
+                    return result;
                 }
             };
 
@@ -62,7 +68,11 @@ namespace boost
             BOOST_DEDUCED_TYPENAME range_iterator<Container>::type
             test_iter(Container& cont)
             {
-                return boost::lower_bound(cont, 5, m_pred);
+                typedef BOOST_DEDUCED_TYPENAME range_iterator<Container>::type iter_t;
+                iter_t result = boost::lower_bound(cont, 5, m_pred);
+                BOOST_CHECK( result == boost::lower_bound(
+                                        boost::make_iterator_range(cont), 5, m_pred) );
+                return result;
             }
 
             template< range_return_value return_type >
@@ -72,8 +82,11 @@ namespace boost
                 BOOST_DEDUCED_TYPENAME range_return<Container,return_type>::type
                 operator()(Policy& policy, Container& cont)
                 {
-                    return boost::lower_bound<return_type>(
-                        cont, 5, policy.pred());
+                    typedef BOOST_DEDUCED_TYPENAME range_return<Container,return_type>::type result_t;
+                    result_t result = boost::lower_bound<return_type>(cont, 5, policy.pred());
+                    BOOST_CHECK( result == boost::lower_bound<return_type>(
+                                            boost::make_iterator_range(cont), 5, policy.pred()) );
+                    return result;
                 }
             };
 
diff --git a/test/algorithm_test/max_element.cpp b/test/algorithm_test/max_element.cpp
index d4c70ca..c4c6cb9 100644
--- a/test/algorithm_test/max_element.cpp
+++ b/test/algorithm_test/max_element.cpp
@@ -33,7 +33,11 @@ namespace boost
             BOOST_DEDUCED_TYPENAME range_iterator<Container>::type
             test_iter(Container& cont)
             {
-                return boost::max_element(cont);
+                typedef BOOST_DEDUCED_TYPENAME range_iterator<Container>::type iter_t;
+                iter_t result = boost::max_element(cont);
+                BOOST_CHECK( result == boost::max_element(
+                                            boost::make_iterator_range(cont)) );
+                return result;
             }
 
             template<range_return_value return_type>
@@ -43,7 +47,11 @@ namespace boost
                 BOOST_DEDUCED_TYPENAME range_return<Container,return_type>::type
                 operator()(Policy&, Container& cont)
                 {
-                    return boost::max_element<return_type>(cont);
+                    typedef BOOST_DEDUCED_TYPENAME range_return<Container,return_type>::type result_t;
+                    result_t result = boost::max_element<return_type>(cont);
+                    BOOST_CHECK( result == boost::max_element<return_type>(
+                                                boost::make_iterator_range(cont)) );
+                    return result;
                 }
             };
 
@@ -63,7 +71,11 @@ namespace boost
             BOOST_DEDUCED_TYPENAME range_iterator<Container>::type
             test_iter(Container& cont)
             {
-                return boost::max_element(cont, Pred());
+                typedef BOOST_DEDUCED_TYPENAME range_iterator<Container>::type iter_t;
+                iter_t result = boost::max_element(cont, Pred());
+                BOOST_CHECK( result == boost::max_element(
+                                            boost::make_iterator_range(cont), Pred()) );
+                return result;
             }
 
             Pred pred() const { return Pred(); }
@@ -75,7 +87,11 @@ namespace boost
                 BOOST_DEDUCED_TYPENAME range_return<Container,return_type>::type
                 operator()(Policy& policy, Container& cont)
                 {
-                    return boost::max_element<return_type>(cont, policy.pred());
+                    typedef BOOST_DEDUCED_TYPENAME range_return<Container,return_type>::type result_t;
+                    result_t result = boost::max_element<return_type>(cont, policy.pred());
+                    BOOST_CHECK( result == boost::max_element<return_type>(
+                                                boost::make_iterator_range(cont), policy.pred()) );
+                    return result;
                 }
             };
 
diff --git a/test/algorithm_test/merge.cpp b/test/algorithm_test/merge.cpp
index aed7cd7..5038782 100644
--- a/test/algorithm_test/merge.cpp
+++ b/test/algorithm_test/merge.cpp
@@ -51,6 +51,46 @@ namespace boost
                 reference_target.begin(), reference_target.end(),
                 test_target.begin(), test_target.end()
                 );
+                
+            test_it = boost::merge(boost::make_iterator_range(cont1),
+                                   cont2, test_target.begin());
+                                   
+            BOOST_CHECK_EQUAL(
+                std::distance<iterator_t>(reference_target.begin(), reference_it),
+                std::distance<iterator_t>(test_target.begin(), test_it)
+                );
+                
+            BOOST_CHECK_EQUAL_COLLECTIONS(
+                reference_target.begin(), reference_target.end(),
+                test_target.begin(), test_target.end()
+                );
+                
+            test_it = boost::merge(cont1, boost::make_iterator_range(cont2),
+                                   test_target.begin());
+                                   
+            BOOST_CHECK_EQUAL(
+                std::distance<iterator_t>(reference_target.begin(), reference_it),
+                std::distance<iterator_t>(test_target.begin(), test_it)
+                );
+                
+            BOOST_CHECK_EQUAL_COLLECTIONS(
+                reference_target.begin(), reference_target.end(),
+                test_target.begin(), test_target.end()
+                );
+                
+            test_it = boost::merge(boost::make_iterator_range(cont1),
+                                   boost::make_iterator_range(cont2),
+                                   test_target.begin());
+                                   
+            BOOST_CHECK_EQUAL(
+                std::distance<iterator_t>(reference_target.begin(), reference_it),
+                std::distance<iterator_t>(test_target.begin(), test_it)
+                );
+                
+            BOOST_CHECK_EQUAL_COLLECTIONS(
+                reference_target.begin(), reference_target.end(),
+                test_target.begin(), test_target.end()
+                );
         }
 
         template<class Container, class BinaryPredicate>
@@ -95,6 +135,46 @@ namespace boost
                 reference_target.begin(), reference_target.end(),
                 test_target.begin(), test_target.end()
                 );
+                
+            test_it = boost::merge(boost::make_iterator_range(cont1), cont2,
+                                   test_target.begin(), pred);
+                                   
+            BOOST_CHECK_EQUAL(
+                std::distance(reference_target.begin(), reference_it),
+                std::distance(test_target.begin(), test_it)
+                );
+                
+            BOOST_CHECK_EQUAL_COLLECTIONS(
+                reference_target.begin(), reference_target.end(),
+                test_target.begin(), test_target.end()
+                );
+                
+            test_it = boost::merge(cont1, boost::make_iterator_range(cont2),
+                                   test_target.begin(), pred);
+                                   
+            BOOST_CHECK_EQUAL(
+                std::distance(reference_target.begin(), reference_it),
+                std::distance(test_target.begin(), test_it)
+                );
+                
+            BOOST_CHECK_EQUAL_COLLECTIONS(
+                reference_target.begin(), reference_target.end(),
+                test_target.begin(), test_target.end()
+                );
+                
+            test_it = boost::merge(boost::make_iterator_range(cont1),
+                                   boost::make_iterator_range(cont2),
+                                   test_target.begin(), pred);
+                                   
+            BOOST_CHECK_EQUAL(
+                std::distance(reference_target.begin(), reference_it),
+                std::distance(test_target.begin(), test_it)
+                );
+                
+            BOOST_CHECK_EQUAL_COLLECTIONS(
+                reference_target.begin(), reference_target.end(),
+                test_target.begin(), test_target.end()
+                );
         }
 
         template<class Container1, class Container2>
diff --git a/test/algorithm_test/min_element.cpp b/test/algorithm_test/min_element.cpp
index c68a655..c8fceda 100644
--- a/test/algorithm_test/min_element.cpp
+++ b/test/algorithm_test/min_element.cpp
@@ -33,7 +33,10 @@ namespace boost
             BOOST_DEDUCED_TYPENAME range_iterator<Container>::type
             test_iter(Container& cont)
             {
-                return boost::min_element(cont);
+                typedef BOOST_DEDUCED_TYPENAME range_iterator<Container>::type iter_t;
+                iter_t result = boost::min_element(cont);
+                BOOST_CHECK( result == boost::min_element(boost::make_iterator_range(cont)) );
+                return result;
             }
 
             template< range_return_value return_type >
@@ -43,7 +46,10 @@ namespace boost
                 BOOST_DEDUCED_TYPENAME range_return<Container,return_type>::type
                 operator()(Policy&, Container& cont)
                 {
-                    return boost::min_element<return_type>(cont);
+                    typedef BOOST_DEDUCED_TYPENAME range_return<Container,return_type>::type result_t;
+                    result_t result = boost::min_element<return_type>(cont);
+                    BOOST_CHECK( result == boost::min_element<return_type>(boost::make_iterator_range(cont)) );
+                    return result;
                 }
             };
 
@@ -63,7 +69,11 @@ namespace boost
             BOOST_DEDUCED_TYPENAME range_iterator<Container>::type
             test_iter(Container& cont)
             {
-                return boost::min_element(cont, Pred());
+                typedef BOOST_DEDUCED_TYPENAME range_iterator<Container>::type iter_t;
+                iter_t result = boost::min_element(cont, Pred());
+                BOOST_CHECK( result == boost::min_element(
+                                        boost::make_iterator_range(cont), Pred()) );
+                return result;
             }
 
             Pred pred() const { return Pred(); }
@@ -75,7 +85,11 @@ namespace boost
                 BOOST_DEDUCED_TYPENAME range_return<Container,return_type>::type
                 operator()(Policy& policy, Container& cont)
                 {
-                    return boost::min_element<return_type>(cont, policy.pred());
+                    typedef BOOST_DEDUCED_TYPENAME range_return<Container,return_type>::type result_t;
+                    result_t result = boost::min_element<return_type>(cont, policy.pred());
+                    BOOST_CHECK( result == boost::min_element<return_type>(
+                                    boost::make_iterator_range(cont), policy.pred()) );
+                    return result;
                 }
             };
 
diff --git a/test/algorithm_test/mismatch.cpp b/test/algorithm_test/mismatch.cpp
index eb8f5e7..2336e59 100644
--- a/test/algorithm_test/mismatch.cpp
+++ b/test/algorithm_test/mismatch.cpp
@@ -23,6 +23,130 @@ namespace boost
 {
     namespace
     {
+        template< class Container1, class Container2 >
+        void eval_mismatch(Container1& cont1,
+                           Container2& cont2,
+                           BOOST_DEDUCED_TYPENAME range_iterator<Container1>::type ref_it1,
+                           BOOST_DEDUCED_TYPENAME range_iterator<Container2>::type ref_it2
+                           )
+        {
+            typedef BOOST_DEDUCED_TYPENAME range_iterator<Container1>::type iter1_t;
+            typedef BOOST_DEDUCED_TYPENAME range_iterator<Container2>::type iter2_t;
+            typedef std::pair<iter1_t, iter2_t> result_pair_t;
+            
+            result_pair_t result = boost::mismatch(cont1, cont2);
+            BOOST_CHECK( result.first == ref_it1 );
+            BOOST_CHECK( result.second == ref_it2 );
+            
+            result = boost::mismatch(boost::make_iterator_range(cont1),
+                                     cont2);
+            BOOST_CHECK( result.first == ref_it1 );
+            BOOST_CHECK( result.second == ref_it2 );
+            
+            result = boost::mismatch(cont1,
+                                     boost::make_iterator_range(cont2));
+            BOOST_CHECK( result.first == ref_it1 );
+            BOOST_CHECK( result.second == ref_it2 );
+            
+            result = boost::mismatch(boost::make_iterator_range(cont1),
+                                     boost::make_iterator_range(cont2));
+            BOOST_CHECK( result.first == ref_it1 );
+            BOOST_CHECK( result.second == ref_it2 );
+        }
+        
+        template< class Container1, class Container2, class Pred >
+        void eval_mismatch(Container1& cont1,
+                           Container2& cont2,
+                           Pred pred,
+                           BOOST_DEDUCED_TYPENAME range_iterator<Container1>::type ref_it1,
+                           BOOST_DEDUCED_TYPENAME range_iterator<Container2>::type ref_it2
+                           )
+        {
+            typedef BOOST_DEDUCED_TYPENAME range_iterator<Container1>::type iter1_t;
+            typedef BOOST_DEDUCED_TYPENAME range_iterator<Container2>::type iter2_t;
+            typedef std::pair<iter1_t, iter2_t> result_pair_t;
+            
+            result_pair_t result = boost::mismatch(cont1, cont2, pred);
+            BOOST_CHECK( result.first == ref_it1 );
+            BOOST_CHECK( result.second == ref_it2 );
+            
+            result = boost::mismatch(boost::make_iterator_range(cont1),
+                                     cont2, pred);
+            BOOST_CHECK( result.first == ref_it1 );
+            BOOST_CHECK( result.second == ref_it2 );
+            
+            result = boost::mismatch(cont1,
+                                     boost::make_iterator_range(cont2), pred);
+            BOOST_CHECK( result.first == ref_it1 );
+            BOOST_CHECK( result.second == ref_it2 );
+            
+            result = boost::mismatch(boost::make_iterator_range(cont1),
+                                     boost::make_iterator_range(cont2),
+                                     pred);
+            BOOST_CHECK( result.first == ref_it1 );
+            BOOST_CHECK( result.second == ref_it2 );
+        }
+        
+        template< class Container1, class Container2 >
+        void eval_mismatch(Container1& cont1,
+                           Container2& cont2,
+                           const int ref1,
+                           const int ref2)
+        {
+            typedef BOOST_DEDUCED_TYPENAME range_iterator<Container1>::type iter1_t;
+            typedef BOOST_DEDUCED_TYPENAME range_iterator<Container2>::type iter2_t;
+            typedef std::pair<iter1_t, iter2_t> result_pair_t;
+            
+            result_pair_t result = boost::mismatch(cont1, cont2);
+            BOOST_CHECK_EQUAL( ref1, *result.first );
+            BOOST_CHECK_EQUAL( ref2, *result.second );
+            
+            result = boost::mismatch(boost::make_iterator_range(cont1), cont2);
+            BOOST_CHECK_EQUAL( ref1, *result.first );
+            BOOST_CHECK_EQUAL( ref2, *result.second );
+            
+            result = boost::mismatch(cont1, boost::make_iterator_range(cont2));
+            BOOST_CHECK_EQUAL( ref1, *result.first );
+            BOOST_CHECK_EQUAL( ref2, *result.second );
+            
+            result = boost::mismatch(boost::make_iterator_range(cont1),
+                                     boost::make_iterator_range(cont2));
+            BOOST_CHECK_EQUAL( ref1, *result.first );
+            BOOST_CHECK_EQUAL( ref2, *result.second );
+        }
+        
+        template< class Container1, class Container2, class Pred >
+        void eval_mismatch(Container1& cont1,
+                           Container2& cont2,
+                           Pred pred,
+                           const int ref1,
+                           const int ref2)
+        {
+            typedef BOOST_DEDUCED_TYPENAME range_iterator<Container1>::type iter1_t;
+            typedef BOOST_DEDUCED_TYPENAME range_iterator<Container2>::type iter2_t;
+            typedef std::pair<iter1_t, iter2_t> result_pair_t;
+            
+            result_pair_t result = boost::mismatch(cont1, cont2, pred);
+            BOOST_CHECK_EQUAL( ref1, *result.first );
+            BOOST_CHECK_EQUAL( ref2, *result.second );
+            
+            result = boost::mismatch(boost::make_iterator_range(cont1),
+                                     cont2, pred);
+            BOOST_CHECK_EQUAL( ref1, *result.first );
+            BOOST_CHECK_EQUAL( ref2, *result.second );
+            
+            result = boost::mismatch(cont1, boost::make_iterator_range(cont2),
+                                     pred);
+            BOOST_CHECK_EQUAL( ref1, *result.first );
+            BOOST_CHECK_EQUAL( ref2, *result.second );
+            
+            result = boost::mismatch(boost::make_iterator_range(cont1),
+                                     boost::make_iterator_range(cont2),
+                                     pred);
+            BOOST_CHECK_EQUAL( ref1, *result.first );
+            BOOST_CHECK_EQUAL( ref2, *result.second );
+        }
+        
         template< class Container1, class Container2 >
         void test_mismatch_impl()
         {
@@ -46,107 +170,42 @@ namespace boost
             typedef std::pair<iterator1_t,       const_iterator2_t> pair_mcit_t;
             typedef std::pair<const_iterator1_t, const_iterator2_t> pair_ccit_t;
 
-            pair_mmit_t pair_mmit = boost::mismatch(cont1, cont2);
-            BOOST_CHECK( pair_mmit.first == cont1.end() );
-            BOOST_CHECK( pair_mmit.second == cont2.end() );
-            pair_mmit = boost::mismatch(cont1, cont2, std::equal_to<int>());
-            BOOST_CHECK( pair_mmit.first == cont1.end() );
-            BOOST_CHECK( pair_mmit.second == cont2.end() );
-
-            pair_cmit_t pair_cmit = boost::mismatch(cref_cont1, cont2);
-            BOOST_CHECK( pair_cmit.first == cref_cont1.end() );
-            BOOST_CHECK( pair_cmit.second == cont2.end() );
-            pair_cmit = boost::mismatch(cref_cont1, cont2, std::equal_to<int>());
-            BOOST_CHECK( pair_cmit.first == cref_cont1.end() );
-            BOOST_CHECK( pair_cmit.second == cont2.end() );
-
-            pair_mcit_t pair_mcit = boost::mismatch(cont1, cref_cont2);
-            BOOST_CHECK( pair_mcit.first == cont1.end() );
-            BOOST_CHECK( pair_mcit.second == cref_cont2.end() );
-            pair_mcit = boost::mismatch(cont1, cref_cont2, std::equal_to<int>());
-            BOOST_CHECK( pair_mcit.first == cont1.end() );
-            BOOST_CHECK( pair_mcit.second == cref_cont2.end() );
-
-            pair_ccit_t pair_ccit = boost::mismatch(cref_cont1, cref_cont2);
-            BOOST_CHECK( pair_ccit.first == cref_cont1.end() );
-            BOOST_CHECK( pair_ccit.second == cref_cont2.end() );
-            pair_ccit = boost::mismatch(cref_cont1, cref_cont2, std::equal_to<int>());
-            BOOST_CHECK( pair_ccit.first == cref_cont1.end() );
-            BOOST_CHECK( pair_ccit.second == cref_cont2.end() );
+            eval_mismatch(cont1, cont2, cont1.end(), cont2.end());
+            eval_mismatch(cont1, cont2, std::equal_to<int>(), cont1.end(), cont2.end());
+            eval_mismatch(cref_cont1, cont2, cref_cont1.end(), cont2.end());
+            eval_mismatch(cref_cont1, cont2, std::equal_to<int>(), cref_cont1.end(), cont2.end());
+            eval_mismatch(cont1, cref_cont2, cont1.end(), cref_cont2.end());
+            eval_mismatch(cont1, cref_cont2, std::equal_to<int>(), cont1.end(), cref_cont2.end());
+            eval_mismatch(cref_cont1, cref_cont2, cref_cont1.end(), cref_cont2.end());
+            eval_mismatch(cref_cont1, cref_cont2, std::equal_to<int>(), cref_cont1.end(), cref_cont2.end());
 
             cont1 += 1,2,3,4;
             cont2 += 1,2,3,4;
-            pair_mmit = boost::mismatch(cont1, cont2);
-            BOOST_CHECK( pair_mmit.first == cont1.end() );
-            BOOST_CHECK( pair_mmit.second == cont2.end() );
-            pair_mmit = boost::mismatch(cont1, cont2, std::equal_to<int>());
-            BOOST_CHECK( pair_mmit.first == cont1.end() );
-            BOOST_CHECK( pair_mmit.second == cont2.end() );
-
-            pair_cmit = boost::mismatch(cref_cont1, cont2);
-            BOOST_CHECK( pair_cmit.first == cref_cont1.end() );
-            BOOST_CHECK( pair_cmit.second == cont2.end() );
-            pair_cmit = boost::mismatch(cref_cont1, cont2, std::equal_to<int>());
-            BOOST_CHECK( pair_cmit.first == cref_cont1.end() );
-            BOOST_CHECK( pair_cmit.second == cont2.end() );
-
-            pair_mcit = boost::mismatch(cont1, cref_cont2);
-            BOOST_CHECK( pair_mcit.first == cont1.end() );
-            BOOST_CHECK( pair_mcit.second == cref_cont2.end() );
-            pair_mcit = boost::mismatch(cont1, cref_cont2, std::equal_to<int>());
-            BOOST_CHECK( pair_mcit.first == cont1.end() );
-            BOOST_CHECK( pair_mcit.second == cref_cont2.end() );
-
-            pair_ccit = boost::mismatch(cref_cont1, cref_cont2);
-            BOOST_CHECK( pair_ccit.first == cref_cont1.end() );
-            BOOST_CHECK( pair_ccit.second == cref_cont2.end() );
-            pair_ccit = boost::mismatch(cref_cont1, cref_cont2, std::equal_to<int>());
-            BOOST_CHECK( pair_ccit.first == cref_cont1.end() );
-            BOOST_CHECK( pair_ccit.second == cref_cont2.end() );
+            eval_mismatch(cont1, cont2, cont1.end(), cont2.end());
+            eval_mismatch(cont1, cont2, std::equal_to<int>(), cont1.end(), cont2.end());
+            eval_mismatch(cref_cont1, cont2, cref_cont1.end(), cont2.end());
+            eval_mismatch(cref_cont1, cont2, std::equal_to<int>(), cref_cont1.end(), cont2.end());
+            eval_mismatch(cont1, cref_cont2, cont1.end(), cref_cont2.end());
+            eval_mismatch(cont1, cref_cont2, std::equal_to<int>(), cont1.end(), cref_cont2.end());
+            eval_mismatch(cref_cont1, cref_cont2, cref_cont1.end(), cref_cont2.end());
+            eval_mismatch(cref_cont1, cref_cont2, std::equal_to<int>(), cref_cont1.end(), cref_cont2.end());
 
             cont1.clear();
             cont2.clear();
             cont1 += 1,2,3,4;
             cont2 += 1,2,5,4;
-            pair_mmit = boost::mismatch(cont1, cont2);
-            BOOST_CHECK( pair_mmit.first != cont1.end() && *pair_mmit.first == 3 );
-            BOOST_CHECK( pair_mmit.second != cont2.end() && *pair_mmit.second == 5 );
-            pair_mmit = boost::mismatch(cont1, cont2, std::equal_to<int>());
-            BOOST_CHECK( pair_mmit.first != cont1.end() && *pair_mmit.first == 3 );
-            BOOST_CHECK( pair_mmit.second != cont2.end() && *pair_mmit.second == 5 );
-            pair_mmit = boost::mismatch(cont1, cont2, std::not_equal_to<int>());
-            BOOST_CHECK( pair_mmit.first == cont1.begin() );
-            BOOST_CHECK( pair_mmit.second == cont2.begin() );
-
-            pair_cmit = boost::mismatch(cref_cont1, cont2);
-            BOOST_CHECK( pair_cmit.first != cref_cont1.end() && *pair_cmit.first == 3 );
-            BOOST_CHECK( pair_cmit.second != cont2.end() && *pair_cmit.second == 5 );
-            pair_cmit = boost::mismatch(cref_cont1, cont2, std::equal_to<int>());
-            BOOST_CHECK( pair_cmit.first != cref_cont1.end() && *pair_cmit.first == 3 );
-            BOOST_CHECK( pair_cmit.second != cont2.end() && *pair_cmit.second == 5 );
-            pair_cmit = boost::mismatch(cref_cont1, cont2, std::not_equal_to<int>());
-            BOOST_CHECK( pair_cmit.first == cref_cont1.begin() );
-            BOOST_CHECK( pair_cmit.second == cont2.begin() );
-
-            pair_mcit = boost::mismatch(cont1, cref_cont2);
-            BOOST_CHECK( pair_mcit.first != cont1.end() && *pair_mcit.first == 3 );
-            BOOST_CHECK( pair_mcit.second != cref_cont2.end() && *pair_mcit.second == 5 );
-            pair_mcit = boost::mismatch(cont1, cref_cont2, std::equal_to<int>());
-            BOOST_CHECK( pair_mcit.first != cont1.end() && *pair_mcit.first == 3 );
-            BOOST_CHECK( pair_mcit.second != cref_cont2.end() && *pair_mcit.second == 5 );
-            pair_mcit = boost::mismatch(cont1, cref_cont2, std::not_equal_to<int>());
-            BOOST_CHECK( pair_mcit.first == cont1.begin() );
-            BOOST_CHECK( pair_mcit.second == cref_cont2.begin() );
-
-            pair_ccit = boost::mismatch(cref_cont1, cref_cont2);
-            BOOST_CHECK( pair_ccit.first != cref_cont1.end() && *pair_ccit.first == 3 );
-            BOOST_CHECK( pair_ccit.second != cref_cont2.end() && *pair_ccit.second == 5 );
-            pair_ccit = boost::mismatch(cref_cont1, cref_cont2, std::equal_to<int>());
-            BOOST_CHECK( pair_ccit.first != cref_cont1.end() && *pair_ccit.first == 3 );
-            BOOST_CHECK( pair_ccit.second != cref_cont2.end() && *pair_ccit.second == 5 );
-            pair_ccit = boost::mismatch(cref_cont1, cref_cont2, std::not_equal_to<int>());
-            BOOST_CHECK( pair_ccit.first == cref_cont1.begin() );
-            BOOST_CHECK( pair_ccit.second == cref_cont2.begin() );
+            eval_mismatch(cont1, cont2, 3, 5);
+            eval_mismatch(cont1, cont2, std::equal_to<int>(), 3, 5);
+            eval_mismatch(cont1, cont2, std::not_equal_to<int>(), cont1.begin(), cont2.begin());
+            eval_mismatch(cref_cont1, cont2, 3, 5);
+            eval_mismatch(cref_cont1, cont2, std::equal_to<int>(), 3, 5);
+            eval_mismatch(cref_cont1, cont2, std::not_equal_to<int>(), cref_cont1.begin(), cont2.begin());
+            eval_mismatch(cont1, cref_cont2, 3, 5);
+            eval_mismatch(cont1, cref_cont2, std::equal_to<int>(), 3, 5);
+            eval_mismatch(cont1, cref_cont2, std::not_equal_to<int>(), cont1.begin(), cref_cont2.begin());
+            eval_mismatch(cref_cont1, cref_cont2, 3, 5);
+            eval_mismatch(cref_cont1, cref_cont2, std::equal_to<int>(), 3, 5);
+            eval_mismatch(cref_cont1, cref_cont2, std::not_equal_to<int>(), cref_cont1.begin(), cref_cont2.begin());
         }
 
         void test_mismatch()
diff --git a/test/algorithm_test/next_permutation.cpp b/test/algorithm_test/next_permutation.cpp
index c2d782b..ee1c371 100644
--- a/test/algorithm_test/next_permutation.cpp
+++ b/test/algorithm_test/next_permutation.cpp
@@ -29,11 +29,19 @@ namespace boost
             const bool reference_ret
                 = std::next_permutation(reference.begin(), reference.end());
 
-            const bool test_ret
-                = boost::next_permutation(test);
+            const bool test_ret = boost::next_permutation(test);
 
             BOOST_CHECK( reference_ret == test_ret );
 
+            BOOST_CHECK_EQUAL_COLLECTIONS(
+                reference.begin(), reference.end(),
+                test.begin(), test.end()
+                );
+                
+            test = cont;
+            
+            BOOST_CHECK( test_ret == boost::next_permutation(boost::make_iterator_range(test)) );
+            
             BOOST_CHECK_EQUAL_COLLECTIONS(
                 reference.begin(), reference.end(),
                 test.begin(), test.end()
@@ -56,6 +64,15 @@ namespace boost
 
             BOOST_CHECK( reference_ret == test_ret );
 
+            BOOST_CHECK_EQUAL_COLLECTIONS(
+                reference.begin(), reference.end(),
+                test.begin(), test.end()
+                );
+                
+            test = cont;
+            
+            BOOST_CHECK( test_ret == boost::next_permutation(boost::make_iterator_range(test), pred) );
+            
             BOOST_CHECK_EQUAL_COLLECTIONS(
                 reference.begin(), reference.end(),
                 test.begin(), test.end()
diff --git a/test/algorithm_test/nth_element.cpp b/test/algorithm_test/nth_element.cpp
index dac2a2f..df241e9 100644
--- a/test/algorithm_test/nth_element.cpp
+++ b/test/algorithm_test/nth_element.cpp
@@ -29,7 +29,21 @@ namespace boost
             template<class Container, class Iterator>
             void test_nth_element(Container& cont, Iterator mid)
             {
+                const Container old_cont(cont);
+                
                 boost::nth_element(cont, mid);
+                
+                // Test the same operation on the container, for the
+                // case where a temporary is passed as the first
+                // argument.
+                Container cont2(old_cont);
+                const std::size_t index = std::distance(cont.begin(), mid);
+                Iterator mid2(cont2.begin());
+                std::advance(mid2, index);
+                boost::nth_element(boost::make_iterator_range(cont2), mid2);
+                
+                BOOST_CHECK_EQUAL_COLLECTIONS( cont.begin(), cont.end(),
+                                               cont2.begin(), cont2.end() );
             }
 
             template<class Container, class Iterator>
@@ -45,7 +59,19 @@ namespace boost
             template<class Container, class Iterator>
             void test_nth_element(Container& cont, Iterator mid)
             {
+                const Container old_cont(cont);
+                
                 boost::nth_element(cont, mid, BinaryPredicate());
+                
+                Container cont2(old_cont);
+                const std::size_t index = std::distance(cont.begin(), mid);
+                Iterator mid2(cont2.begin());
+                std::advance(mid2, index);
+                boost::nth_element(boost::make_iterator_range(cont2), mid2,
+                                   BinaryPredicate());
+                                   
+                BOOST_CHECK_EQUAL_COLLECTIONS( cont.begin(), cont.end(),
+                                               cont2.begin(), cont2.end() );
             }
 
             template<class Container, class Iterator>
diff --git a/test/algorithm_test/partial_sort.cpp b/test/algorithm_test/partial_sort.cpp
index 62ff64b..c13f7f1 100644
--- a/test/algorithm_test/partial_sort.cpp
+++ b/test/algorithm_test/partial_sort.cpp
@@ -31,7 +31,18 @@ namespace boost
             template<class Container, class Iterator>
             void test_partial_sort(Container& cont, Iterator mid)
             {
+                const Container old_cont(cont);
+                
                 boost::partial_sort(cont, mid);
+                
+                const std::size_t index = std::distance(cont.begin(), mid);
+                Container cont2(old_cont);
+                Iterator mid2(cont2.begin());
+                std::advance(mid2, index);
+                boost::partial_sort(cont2, mid2);
+                
+                BOOST_CHECK_EQUAL_COLLECTIONS( cont.begin(), cont.end(),
+                                               cont2.begin(), cont2.end() );
             }
 
             template<class Container, class Iterator>
@@ -47,7 +58,18 @@ namespace boost
             template<class Container, class Iterator>
             void test_partial_sort(Container& cont, Iterator mid)
             {
+                const Container old_cont(cont);
+                
                 boost::partial_sort(cont, mid, BinaryPredicate());
+                
+                const std::size_t index = std::distance(cont.begin(), mid);
+                Container cont2(old_cont);
+                Iterator mid2(cont2.begin());
+                std::advance(mid2, index);
+                boost::partial_sort(cont2, mid2, BinaryPredicate());
+                
+                BOOST_CHECK_EQUAL_COLLECTIONS( cont.begin(), cont.end(),
+                                               cont2.begin(), cont2.end() );
             }
 
             template<class Container, class Iterator>
diff --git a/test/algorithm_test/partition.cpp b/test/algorithm_test/partition.cpp
index 3f0ce61..0160dae 100644
--- a/test/algorithm_test/partition.cpp
+++ b/test/algorithm_test/partition.cpp
@@ -41,7 +41,21 @@ namespace boost
             BOOST_DEDUCED_TYPENAME range_iterator<Container>::type
             test_iter(Container& cont)
             {
-                return boost::partition(cont, UnaryPredicate());
+                typedef BOOST_DEDUCED_TYPENAME range_iterator<Container>::type iter_t;
+
+                const Container old_cont(cont);
+                Container cont2(old_cont);
+                iter_t result = boost::partition(cont, UnaryPredicate());
+
+                boost::partition(cont2, UnaryPredicate());
+                cont2 = old_cont;
+                boost::partition(
+                    boost::make_iterator_range(cont2), UnaryPredicate());
+
+                BOOST_CHECK_EQUAL_COLLECTIONS( cont.begin(), cont.end(),
+                                               cont2.begin(), cont2.end() );
+
+                return result;
             }
 
             UnaryPredicate pred() const { return UnaryPredicate(); }
@@ -53,7 +67,21 @@ namespace boost
                 BOOST_DEDUCED_TYPENAME range_return<Container,return_type>::type
                 operator()(Policy& policy, Container& cont)
                 {
-                    return boost::partition<return_type>(cont, policy.pred());
+                    typedef BOOST_DEDUCED_TYPENAME range_return<Container,return_type>::type result_t;
+
+                    const Container old_cont(cont);
+                    Container cont2(old_cont);
+                    result_t result = boost::partition<return_type>(cont, policy.pred());
+
+                    // Test that operation a temporary created by using
+                    // make_iterator_range.
+                    boost::partition<return_type>(
+                        boost::make_iterator_range(cont2), policy.pred());
+
+                    BOOST_CHECK_EQUAL_COLLECTIONS( cont.begin(), cont.end(),
+                                                   cont2.begin(), cont2.end() );
+
+                    return result;
                 }
             };
 
diff --git a/test/algorithm_test/prev_permutation.cpp b/test/algorithm_test/prev_permutation.cpp
index e1073c9..a4adc7b 100644
--- a/test/algorithm_test/prev_permutation.cpp
+++ b/test/algorithm_test/prev_permutation.cpp
@@ -25,12 +25,12 @@ namespace boost
         {
             Container reference(cont);
             Container test(cont);
+            Container test2(cont);
 
             const bool reference_ret
                 = std::prev_permutation(reference.begin(), reference.end());
 
-            const bool test_ret
-                = boost::prev_permutation(test);
+            const bool test_ret = boost::prev_permutation(test);
 
             BOOST_CHECK( reference_ret == test_ret );
 
@@ -38,6 +38,14 @@ namespace boost
                 reference.begin(), reference.end(),
                 test.begin(), test.end()
                 );
+
+            BOOST_CHECK( test_ret == boost::prev_permutation(
+                                boost::make_iterator_range(test2)) );
+                                
+            BOOST_CHECK_EQUAL_COLLECTIONS(
+                reference.begin(), reference.end(),
+                test2.begin(), test2.end()
+                );
         }
 
         template<class Container, class BinaryPredicate>
@@ -46,13 +54,13 @@ namespace boost
         {
             Container reference(cont);
             Container test(cont);
+            Container test2(cont);
 
             const bool reference_ret
                 = std::prev_permutation(reference.begin(), reference.end(),
                                         pred);
 
-            const bool test_ret
-                = boost::prev_permutation(test, pred);
+            const bool test_ret = boost::prev_permutation(test, pred);
 
             BOOST_CHECK( reference_ret == test_ret );
 
@@ -60,6 +68,14 @@ namespace boost
                 reference.begin(), reference.end(),
                 test.begin(), test.end()
                 );
+                
+            BOOST_CHECK( test_ret == boost::prev_permutation(
+                boost::make_iterator_range(test2), pred) );
+                
+            BOOST_CHECK_EQUAL_COLLECTIONS(
+                reference.begin(), reference.end(),
+                test2.begin(), test2.end()
+                );
         }
 
         template<class Container>
diff --git a/test/algorithm_test/random_shuffle.cpp b/test/algorithm_test/random_shuffle.cpp
index ba55f51..410749a 100644
--- a/test/algorithm_test/random_shuffle.cpp
+++ b/test/algorithm_test/random_shuffle.cpp
@@ -110,6 +110,14 @@ namespace boost
                 {
                     shuffled = true;
                 }
+                
+                // Verify that the shuffle can be performed on a
+                // temporary range
+                Container test2(cont);
+                boost::random_shuffle(boost::make_iterator_range(test2));
+                ok = test_shuffle_result(cont, test2);
+                if (!ok)
+                    break;
             }
         }
 
@@ -124,6 +132,17 @@ namespace boost
             {
                 BOOST_CHECK( gen.invocation_count() > 0 );
             }
+            
+            // Test that random shuffle works when 
+            // passed a temporary range
+            RandomGenerator gen2;
+            Container cont2(old_cont);
+            boost::random_shuffle(boost::make_iterator_range(cont2), gen2);
+            test_shuffle_result(cont2, old_cont);
+            if (cont2.size() > 2)
+            {
+                BOOST_CHECK( gen2.invocation_count() > 0 );
+            }
         }
 
         template<class Container>
diff --git a/test/algorithm_test/remove.cpp b/test/algorithm_test/remove.cpp
index 46e6591..3e4ab16 100644
--- a/test/algorithm_test/remove.cpp
+++ b/test/algorithm_test/remove.cpp
@@ -43,7 +43,16 @@ namespace boost
                                std::distance(reference.begin(), reference_it) );
 
             BOOST_CHECK_EQUAL_COLLECTIONS( reference.begin(), reference.end(),
-                test.begin(), test.end() );
+                                           test.begin(), test.end() );
+                                           
+            Container test2(c);
+            iterator_t test_it2 = boost::remove(test2, to_remove);
+            
+            BOOST_CHECK_EQUAL( std::distance(test2.begin(), test_it2),
+                               std::distance(reference.begin(), reference_it) );
+                               
+            BOOST_CHECK_EQUAL_COLLECTIONS( reference.begin(), reference.end(),
+                                           test2.begin(), test2.end() );
         }
 
         template< class Container >
diff --git a/test/algorithm_test/remove_copy.cpp b/test/algorithm_test/remove_copy.cpp
new file mode 100644
index 0000000..4050ef4
--- /dev/null
+++ b/test/algorithm_test/remove_copy.cpp
@@ -0,0 +1,107 @@
+// 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/
+//
+#include <boost/range/algorithm/remove_copy.hpp>
+
+#include <boost/test/test_tools.hpp>
+#include <boost/test/unit_test.hpp>
+
+#include <boost/assign.hpp>
+#include <boost/bind.hpp>
+#include <algorithm>
+#include <functional>
+#include <list>
+#include <numeric>
+#include <deque>
+#include <vector>
+
+namespace
+{
+    template<typename Iterator, typename Value>
+    void test_append(Iterator target, Value value)
+    {
+        *target++ = value;
+    }
+
+    template< class Container, class Value >
+    void test_remove_copy_impl( const Container& c, Value to_remove )
+    {
+        typedef typename boost::range_value<Container>::type value_type;
+        std::vector<value_type> reference;
+
+        typedef BOOST_DEDUCED_TYPENAME std::vector<value_type>::iterator iterator_t;
+
+        test_append(
+            std::remove_copy(c.begin(), c.end(),
+                                std::back_inserter(reference), to_remove),
+            to_remove);
+
+        std::vector<value_type> test;
+        test_append(
+            boost::remove_copy(c, std::back_inserter(test), to_remove),
+            to_remove);
+
+        BOOST_CHECK_EQUAL_COLLECTIONS( reference.begin(), reference.end(),
+            test.begin(), test.end() );
+            
+        std::vector<value_type> test2;
+        test_append(
+            boost::remove_copy(boost::make_iterator_range(c),
+                               std::back_inserter(test2), to_remove),
+            to_remove);
+                               
+        BOOST_CHECK_EQUAL_COLLECTIONS( reference.begin(), reference.end(),
+                                       test2.begin(), test2.end() );
+    }
+
+    template< class Container >
+    void test_remove_copy_impl()
+    {
+        using namespace boost::assign;
+
+        Container cont;
+        test_remove_copy_impl(cont, 0);
+
+        cont.clear();
+        cont += 1;
+        test_remove_copy_impl(cont, 0);
+        test_remove_copy_impl(cont, 1);
+
+        cont.clear();
+        cont += 1,1,1,1,1;
+        test_remove_copy_impl(cont, 0);
+        test_remove_copy_impl(cont, 1);
+
+        cont.clear();
+        cont += 1,2,3,4,5,6,7,8,9;
+        test_remove_copy_impl(cont, 1);
+        test_remove_copy_impl(cont, 9);
+        test_remove_copy_impl(cont, 4);
+    }
+
+    void test_remove_copy()
+    {
+        test_remove_copy_impl< std::vector<int> >();
+        test_remove_copy_impl< std::list<int> >();
+        test_remove_copy_impl< std::deque<int> >();
+    }
+}
+
+boost::unit_test::test_suite*
+init_unit_test_suite(int argc, char* argv[])
+{
+    boost::unit_test::test_suite* test
+        = BOOST_TEST_SUITE( "RangeTestSuite.algorithm.remove_copy" );
+
+    test->add( BOOST_TEST_CASE( &test_remove_copy ) );
+
+    return test;
+}
+
diff --git a/test/algorithm_test/remove_copy_if.cpp b/test/algorithm_test/remove_copy_if.cpp
new file mode 100644
index 0000000..c269c2a
--- /dev/null
+++ b/test/algorithm_test/remove_copy_if.cpp
@@ -0,0 +1,113 @@
+// 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/
+//
+#include <boost/range/algorithm/remove_copy_if.hpp>
+
+#include <boost/test/test_tools.hpp>
+#include <boost/test/unit_test.hpp>
+
+#include <boost/assign.hpp>
+#include <boost/bind.hpp>
+#include <algorithm>
+#include <functional>
+#include <list>
+#include <numeric>
+#include <deque>
+#include <vector>
+
+namespace
+{
+    template< class Iterator, class Value >
+    void test_append(Iterator target, Value value)
+    {
+        *target++ = value;
+    }
+
+    template< class Container, class UnaryPredicate >
+    void test_remove_copy_if_impl( const Container& c, UnaryPredicate pred )
+    {
+        typedef BOOST_DEDUCED_TYPENAME boost::range_value<const Container>::type value_type;
+        std::vector<value_type> reference;
+
+        test_append(
+            std::remove_copy_if(c.begin(), c.end(), std::back_inserter(reference), pred),
+            value_type()
+            );
+
+        std::vector<value_type> test;
+        test_append(
+            boost::remove_copy_if(c, std::back_inserter(test), pred),
+            value_type()
+            );
+
+        BOOST_CHECK_EQUAL_COLLECTIONS( reference.begin(), reference.end(),
+                                       test.begin(), test.end() );
+                                       
+        std::vector<value_type> test2;
+        test_append(
+            boost::remove_copy_if(boost::make_iterator_range(c),
+                                  std::back_inserter(test2), pred),
+            value_type()
+            );
+            
+        BOOST_CHECK_EQUAL_COLLECTIONS( reference.begin(), reference.end(),
+                                       test2.begin(), test2.end() );
+    }
+
+    template< class Container >
+    void test_remove_copy_if_( const Container& c, int to_remove )
+    {
+        test_remove_copy_if_impl(c, boost::bind(std::equal_to<int>(), _1, to_remove));
+        test_remove_copy_if_impl(c, boost::bind(std::not_equal_to<int>(), _1, to_remove));
+    }
+
+    template< class Container >
+    void test_remove_copy_if_impl()
+    {
+        using namespace boost::assign;
+
+        Container cont;
+        test_remove_copy_if_(cont, 0);
+
+        cont.clear();
+        cont += 1;
+        test_remove_copy_if_(cont, 0);
+        test_remove_copy_if_(cont, 1);
+
+        cont.clear();
+        cont += 1,1,1,1,1;
+        test_remove_copy_if_(cont, 0);
+        test_remove_copy_if_(cont, 1);
+
+        cont.clear();
+        cont += 1,2,3,4,5,6,7,8,9;
+        test_remove_copy_if_(cont, 1);
+        test_remove_copy_if_(cont, 9);
+        test_remove_copy_if_(cont, 4);
+    }
+
+    inline void test_remove_copy_if()
+    {
+        test_remove_copy_if_impl< std::vector<int> >();
+        test_remove_copy_if_impl< std::list<int> >();
+        test_remove_copy_if_impl< std::deque<int> >();
+    }
+}
+
+boost::unit_test::test_suite*
+init_unit_test_suite(int argc, char* argv[])
+{
+    boost::unit_test::test_suite* test
+        = BOOST_TEST_SUITE( "RangeTestSuite.algorithm.remove_copy_if" );
+
+    test->add( BOOST_TEST_CASE( &test_remove_copy_if ) );
+
+    return test;
+}
diff --git a/test/algorithm_test/remove_if.cpp b/test/algorithm_test/remove_if.cpp
index 1e77e7b..58fc07f 100644
--- a/test/algorithm_test/remove_if.cpp
+++ b/test/algorithm_test/remove_if.cpp
@@ -43,7 +43,17 @@ namespace boost
                                std::distance(reference.begin(), reference_it) );
 
             BOOST_CHECK_EQUAL_COLLECTIONS( reference.begin(), reference.end(),
-                test.begin(), test.end() );
+                                           test.begin(), test.end() );
+                
+            Container test2(c);
+            iterator_t test_it2 = boost::remove_if(
+                boost::make_iterator_range(test2), pred);
+                
+            BOOST_CHECK_EQUAL( std::distance(test2.begin(), test_it2),
+                               std::distance(reference.begin(), reference_it) );
+                               
+            BOOST_CHECK_EQUAL_COLLECTIONS( reference.begin(), reference.end(),
+                                           test2.begin(), test2.end() );
         }
 
         template< class Container >
diff --git a/test/algorithm_test/replace.cpp b/test/algorithm_test/replace.cpp
index 4a882dc..356024f 100644
--- a/test/algorithm_test/replace.cpp
+++ b/test/algorithm_test/replace.cpp
@@ -36,7 +36,14 @@ namespace boost
             boost::replace(target, what, with_what);
 
             BOOST_CHECK_EQUAL_COLLECTIONS( reference.begin(), reference.end(),
-                target.begin(), target.end() );
+                                           target.begin(), target.end() );
+                
+            std::vector<int> target2(cont.begin(), cont.end());
+            boost::replace(boost::make_iterator_range(target2), what,
+                           with_what);
+                           
+            BOOST_CHECK_EQUAL_COLLECTIONS( reference.begin(), reference.end(),
+                                           target2.begin(), target2.end() );
 
         }
 
diff --git a/test/algorithm_test/replace_copy.cpp b/test/algorithm_test/replace_copy.cpp
new file mode 100644
index 0000000..6ae12e2
--- /dev/null
+++ b/test/algorithm_test/replace_copy.cpp
@@ -0,0 +1,110 @@
+// 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/
+//
+#include <boost/range/algorithm/replace_copy.hpp>
+
+#include <boost/test/test_tools.hpp>
+#include <boost/test/unit_test.hpp>
+
+#include <boost/assign.hpp>
+#include <boost/bind.hpp>
+#include <algorithm>
+#include <functional>
+#include <list>
+#include <numeric>
+#include <deque>
+#include <vector>
+
+namespace
+{
+    template<typename Iterator, typename Value>
+    void test_append(Iterator target, Value value)
+    {
+        *target++ = value;
+    }
+
+    template< class Container, class Value >
+    void test_replace_copy_impl( const Container& c, Value to_replace )
+    {
+        const Value replace_with = to_replace * 2;
+
+        typedef typename boost::range_value<Container>::type value_type;
+        std::vector<value_type> reference;
+
+        typedef BOOST_DEDUCED_TYPENAME std::vector<value_type>::iterator iterator_t;
+
+        test_append(
+            std::replace_copy(c.begin(), c.end(),
+                                std::back_inserter(reference), to_replace, replace_with),
+            to_replace);
+
+        std::vector<value_type> test;
+        test_append(
+            boost::replace_copy(c, std::back_inserter(test), to_replace, replace_with),
+            to_replace);
+
+        BOOST_CHECK_EQUAL_COLLECTIONS( reference.begin(), reference.end(),
+                                       test.begin(), test.end() );
+            
+        std::vector<value_type> test2;
+        test_append(
+            boost::replace_copy(boost::make_iterator_range(c),
+                                std::back_inserter(test2), to_replace,
+                                replace_with),
+            to_replace);
+            
+        BOOST_CHECK_EQUAL_COLLECTIONS( reference.begin(), reference.end(),
+                                       test2.begin(), test2.end() );
+    }
+
+    template< class Container >
+    void test_replace_copy_impl()
+    {
+        using namespace boost::assign;
+
+        Container cont;
+        test_replace_copy_impl(cont, 0);
+
+        cont.clear();
+        cont += 1;
+        test_replace_copy_impl(cont, 0);
+        test_replace_copy_impl(cont, 1);
+
+        cont.clear();
+        cont += 1,1,1,1,1;
+        test_replace_copy_impl(cont, 0);
+        test_replace_copy_impl(cont, 1);
+
+        cont.clear();
+        cont += 1,2,3,4,5,6,7,8,9;
+        test_replace_copy_impl(cont, 1);
+        test_replace_copy_impl(cont, 9);
+        test_replace_copy_impl(cont, 4);
+    }
+
+    void test_replace_copy()
+    {
+        test_replace_copy_impl< std::vector<int> >();
+        test_replace_copy_impl< std::list<int> >();
+        test_replace_copy_impl< std::deque<int> >();
+    }
+}
+
+boost::unit_test::test_suite*
+init_unit_test_suite(int argc, char* argv[])
+{
+    boost::unit_test::test_suite* test
+        = BOOST_TEST_SUITE( "RangeTestSuite.algorithm.replace_copy" );
+
+    test->add( BOOST_TEST_CASE( &test_replace_copy ) );
+
+    return test;
+}
+
diff --git a/test/algorithm_test/replace_copy_if.cpp b/test/algorithm_test/replace_copy_if.cpp
new file mode 100644
index 0000000..6873547
--- /dev/null
+++ b/test/algorithm_test/replace_copy_if.cpp
@@ -0,0 +1,115 @@
+// 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/
+//
+#include <boost/range/algorithm/replace_copy_if.hpp>
+
+#include <boost/test/test_tools.hpp>
+#include <boost/test/unit_test.hpp>
+
+#include <boost/assign.hpp>
+#include <boost/bind.hpp>
+#include <algorithm>
+#include <functional>
+#include <list>
+#include <numeric>
+#include <deque>
+#include <vector>
+
+namespace
+{
+    template< class Iterator, class Value >
+    void test_append(Iterator target, Value value)
+    {
+        *target++ = value;
+    }
+
+    template< class Container, class UnaryPredicate >
+    void test_replace_copy_if_impl( const Container& c, UnaryPredicate pred )
+    {
+        typedef BOOST_DEDUCED_TYPENAME boost::range_value<const Container>::type value_type;
+        const value_type replace_with = value_type();
+        std::vector<value_type> reference;
+
+        test_append(
+            std::replace_copy_if(c.begin(), c.end(), std::back_inserter(reference), pred, replace_with),
+            value_type()
+            );
+
+        std::vector<value_type> test;
+        test_append(
+            boost::replace_copy_if(c, std::back_inserter(test), pred, replace_with),
+            value_type()
+            );
+
+        BOOST_CHECK_EQUAL_COLLECTIONS( reference.begin(), reference.end(),
+                                       test.begin(), test.end() );
+            
+        std::vector<value_type> test2;
+        test_append(
+            boost::replace_copy_if(boost::make_iterator_range(c),
+                                   std::back_inserter(test2), pred,
+                                   replace_with),
+            value_type()
+            );
+            
+        BOOST_CHECK_EQUAL_COLLECTIONS( reference.begin(), reference.end(),
+                                       test2.begin(), test2.end() );
+    }
+
+    template< class Container >
+    void test_replace_copy_if_( const Container& c, int to_replace )
+    {
+        test_replace_copy_if_impl(c, boost::bind(std::equal_to<int>(), _1, to_replace));
+        test_replace_copy_if_impl(c, boost::bind(std::not_equal_to<int>(), _1, to_replace));
+    }
+
+    template< class Container >
+    void test_replace_copy_if_impl()
+    {
+        using namespace boost::assign;
+
+        Container cont;
+        test_replace_copy_if_(cont, 0);
+
+        cont.clear();
+        cont += 1;
+        test_replace_copy_if_(cont, 0);
+        test_replace_copy_if_(cont, 1);
+
+        cont.clear();
+        cont += 1,1,1,1,1;
+        test_replace_copy_if_(cont, 0);
+        test_replace_copy_if_(cont, 1);
+
+        cont.clear();
+        cont += 1,2,3,4,5,6,7,8,9;
+        test_replace_copy_if_(cont, 1);
+        test_replace_copy_if_(cont, 9);
+        test_replace_copy_if_(cont, 4);
+    }
+
+    inline void test_replace_copy_if()
+    {
+        test_replace_copy_if_impl< std::vector<int> >();
+        test_replace_copy_if_impl< std::list<int> >();
+        test_replace_copy_if_impl< std::deque<int> >();
+    }
+}
+
+boost::unit_test::test_suite*
+init_unit_test_suite(int argc, char* argv[])
+{
+    boost::unit_test::test_suite* test
+        = BOOST_TEST_SUITE( "RangeTestSuite.algorithm.replace_copy_if" );
+
+    test->add( BOOST_TEST_CASE( &test_replace_copy_if ) );
+
+    return test;
+}
diff --git a/test/algorithm_test/replace_if.cpp b/test/algorithm_test/replace_if.cpp
index e1dd26f..12d7293 100644
--- a/test/algorithm_test/replace_if.cpp
+++ b/test/algorithm_test/replace_if.cpp
@@ -40,8 +40,14 @@ namespace boost
             boost::replace_if(target, boost::bind(pred, _1, what), with_what);
 
             BOOST_CHECK_EQUAL_COLLECTIONS( reference.begin(), reference.end(),
-                target.begin(), target.end() );
-
+                                           target.begin(), target.end() );
+                
+            std::vector<int> target2(cont.begin(), cont.end());
+            boost::replace_if(boost::make_iterator_range(target2),
+                              boost::bind(pred, _1, what), with_what);
+                              
+            BOOST_CHECK_EQUAL_COLLECTIONS( reference.begin(), reference.end(),
+                                           target2.begin(), target2.end() );
         }
 
         template< class Container >
diff --git a/test/algorithm_test/reverse.cpp b/test/algorithm_test/reverse.cpp
index 611a464..3ad63cb 100644
--- a/test/algorithm_test/reverse.cpp
+++ b/test/algorithm_test/reverse.cpp
@@ -29,14 +29,16 @@ namespace boost
         {
             Container reference(cont);
             Container test(cont);
+            Container test2(cont);
 
             boost::reverse(test);
             std::reverse(reference.begin(), reference.end());
-
-            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::reverse(boost::make_iterator_range(test2));
+            BOOST_CHECK_EQUAL_COLLECTIONS( reference.begin(), reference.end(),
+                                           test2.begin(), test2.end() );
         }
 
         template<class Container>
diff --git a/test/algorithm_test/reverse_copy.cpp b/test/algorithm_test/reverse_copy.cpp
new file mode 100644
index 0000000..92ef485
--- /dev/null
+++ b/test/algorithm_test/reverse_copy.cpp
@@ -0,0 +1,97 @@
+//  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/
+//
+#include <boost/range/algorithm/reverse_copy.hpp>
+
+#include <boost/test/test_tools.hpp>
+#include <boost/test/unit_test.hpp>
+
+#include <boost/assign.hpp>
+#include <boost/bind.hpp>
+#include <algorithm>
+#include <functional>
+#include <list>
+#include <numeric>
+#include <deque>
+#include <vector>
+
+namespace
+{
+    template<class OutputIterator, class Value>
+    void test_append(OutputIterator out, Value value)
+    {
+        *out++ = value;
+    }
+
+    template<class Container>
+    void test_reverse_copy_impl(Container& cont)
+    {
+        typedef BOOST_DEDUCED_TYPENAME boost::range_value<Container>::type value_type;
+        std::vector<value_type> reference;
+        std::vector<value_type> test;
+
+        test_append(
+            std::reverse_copy(cont.begin(), cont.end(), std::back_inserter(reference)),
+            value_type()
+            );
+
+        test_append(
+            boost::reverse_copy(cont, std::back_inserter(test)),
+            value_type()
+            );
+
+        BOOST_CHECK_EQUAL_COLLECTIONS( reference.begin(), reference.end(),
+                                       test.begin(), test.end() );
+            
+        test.clear();
+        
+        test_append(
+            boost::reverse_copy(boost::make_iterator_range(cont),
+                                std::back_inserter(test)),
+            value_type()
+            );
+            
+        BOOST_CHECK_EQUAL_COLLECTIONS( reference.begin(), reference.end(),
+                                       test.begin(), test.end() );
+    }
+
+    template<class Container>
+    void test_reverse_copy_impl()
+    {
+        using namespace boost::assign;
+
+        Container cont;
+        test_reverse_copy_impl(cont);
+
+        cont.clear();
+        cont += 1;
+        test_reverse_copy_impl(cont);
+
+        cont.clear();
+        cont += 1,2,3,4,5,6,7,8,9;
+        test_reverse_copy_impl(cont);
+    }
+
+    void test_reverse_copy()
+    {
+        test_reverse_copy_impl< std::vector<int> >();
+        test_reverse_copy_impl< std::list<int> >();
+        test_reverse_copy_impl< std::deque<int> >();
+    }
+}
+
+boost::unit_test::test_suite*
+init_unit_test_suite(int argc, char* argv[])
+{
+    boost::unit_test::test_suite* test
+        = BOOST_TEST_SUITE( "RangeTestSuite.algorithm.reverse_copy" );
+
+    test->add( BOOST_TEST_CASE( &::test_reverse_copy ) );
+
+    return test;
+}
diff --git a/test/algorithm_test/rotate.cpp b/test/algorithm_test/rotate.cpp
index f8b394a..b6b7af2 100644
--- a/test/algorithm_test/rotate.cpp
+++ b/test/algorithm_test/rotate.cpp
@@ -42,10 +42,18 @@ namespace boost
 
             boost::rotate(test, test_where_it);
 
-            BOOST_CHECK_EQUAL_COLLECTIONS(
-                reference.begin(), reference.end(),
-                test.begin(), test.end()
-                );
+            BOOST_CHECK_EQUAL_COLLECTIONS( reference.begin(), reference.end(),
+                                           test.begin(), test.end() );
+                
+            test = cont;
+            test_where_it = test.begin();
+            std::advance(test_where_it,
+                         std::distance(cont.begin(), where_it));
+                         
+            boost::rotate(boost::make_iterator_range(test), test_where_it);
+            
+            BOOST_CHECK_EQUAL_COLLECTIONS( reference.begin(), reference.end(),
+                                           test.begin(), test.end() );
         }
 
         template<class Container>
diff --git a/test/algorithm_test/rotate_copy.cpp b/test/algorithm_test/rotate_copy.cpp
new file mode 100644
index 0000000..5615479
--- /dev/null
+++ b/test/algorithm_test/rotate_copy.cpp
@@ -0,0 +1,112 @@
+//  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/
+//
+#include <boost/range/algorithm/rotate_copy.hpp>
+
+#include <boost/test/test_tools.hpp>
+#include <boost/test/unit_test.hpp>
+
+#include <boost/assign.hpp>
+#include <boost/bind.hpp>
+#include <algorithm>
+#include <functional>
+#include <list>
+#include <numeric>
+#include <deque>
+#include <vector>
+
+namespace
+{
+    template<class OutputIterator, class Value>
+    void test_append(OutputIterator target, Value value)
+    {
+        *target++ = value;
+    }
+
+    template<class Container, class Iterator>
+    void test_rotate_copy_impl(Container& cont, Iterator where_it)
+    {
+        typedef BOOST_DEDUCED_TYPENAME boost::range_value<Container>::type value_type;
+        std::vector<value_type> reference;
+        std::vector<value_type> test;
+
+        typedef BOOST_DEDUCED_TYPENAME boost::range_iterator<Container>::type iterator_t;
+
+        test_append(
+            std::rotate_copy(cont.begin(), where_it, cont.end(),
+                std::back_inserter(reference)),
+            value_type()
+            );
+
+        test_append(
+            boost::rotate_copy(cont, where_it, std::back_inserter(test)),
+            value_type()
+            );
+
+        BOOST_CHECK_EQUAL_COLLECTIONS( reference.begin(), reference.end(),
+                                       test.begin(), test.end() );
+            
+        test.clear();
+        
+        test_append(
+            boost::rotate_copy(boost::make_iterator_range(cont), where_it,
+                               std::back_inserter(test)),
+            value_type()
+            );
+            
+        BOOST_CHECK_EQUAL_COLLECTIONS( reference.begin(), reference.end(),
+                                       test.begin(), test.end() );
+    }
+
+    template<class Container>
+    void test_rotate_copy_impl(Container& cont)
+    {
+        typedef BOOST_DEDUCED_TYPENAME boost::range_iterator<Container>::type iterator_t;
+
+        iterator_t last = cont.end();
+        for (iterator_t it = cont.begin(); it != last; ++it)
+        {
+            test_rotate_copy_impl(cont, it);
+        }
+    }
+
+    template<class Container>
+    void test_rotate_copy_impl()
+    {
+        using namespace boost::assign;
+
+        Container cont;
+        test_rotate_copy_impl(cont);
+
+        cont.clear();
+        cont += 1;
+        test_rotate_copy_impl(cont);
+
+        cont.clear();
+        cont += 1,2,3,4,5,6,7,8,9;
+        test_rotate_copy_impl(cont);
+    }
+
+    void test_rotate_copy()
+    {
+        test_rotate_copy_impl< std::vector<int> >();
+        test_rotate_copy_impl< std::list<int> >();
+        test_rotate_copy_impl< std::deque<int> >();
+    }
+}
+
+boost::unit_test::test_suite*
+init_unit_test_suite(int argc, char* argv[])
+{
+    boost::unit_test::test_suite* test
+        = BOOST_TEST_SUITE( "RangeTestSuite.algorithm.rotate_copy" );
+
+    test->add( BOOST_TEST_CASE( &test_rotate_copy ) );
+
+    return test;
+}
diff --git a/test/algorithm_test/search.cpp b/test/algorithm_test/search.cpp
index 460f70d..91f19bd 100644
--- a/test/algorithm_test/search.cpp
+++ b/test/algorithm_test/search.cpp
@@ -33,9 +33,25 @@ namespace boost
             const Container2& ccont2 = cont2;
 
             iterator1_t it = boost::search(cont1, cont2);
+            BOOST_CHECK( it == boost::search(boost::make_iterator_range(cont1), cont2) );
+            BOOST_CHECK( it == boost::search(cont1, boost::make_iterator_range(cont2)) );
+            BOOST_CHECK( it == boost::search(boost::make_iterator_range(cont1),
+                                             boost::make_iterator_range(cont2)) );
             iterator1_t it2 = boost::search(cont1, ccont2);
+            BOOST_CHECK( it2 == boost::search(boost::make_iterator_range(cont1), ccont2) );
+            BOOST_CHECK( it2 == boost::search(cont1, boost::make_iterator_range(ccont2)) );
+            BOOST_CHECK( it2 == boost::search(boost::make_iterator_range(cont1),
+                                              boost::make_iterator_range(ccont2)) );
             const_iterator1_t cit = boost::search(ccont1, cont2);
+            BOOST_CHECK( cit == boost::search(boost::make_iterator_range(ccont1), cont2) );
+            BOOST_CHECK( cit == boost::search(ccont1, boost::make_iterator_range(cont2)) );
+            BOOST_CHECK( cit == boost::search(boost::make_iterator_range(ccont1),
+                                              boost::make_iterator_range(cont2)) );
             const_iterator1_t cit2 = boost::search(ccont1, ccont2);
+            BOOST_CHECK( cit2 == boost::search(boost::make_iterator_range(ccont1), ccont2) );
+            BOOST_CHECK( cit2 == boost::search(ccont1, boost::make_iterator_range(ccont2)) );
+            BOOST_CHECK( cit2 == boost::search(boost::make_iterator_range(ccont1),
+                                               boost::make_iterator_range(ccont2)) );
 
             BOOST_CHECK( it == std::search(cont1.begin(), cont1.end(), cont2.begin(), cont2.end()) );
             BOOST_CHECK( it2 == std::search(cont1.begin(), cont1.end(), ccont2.begin(), ccont2.end()) );
diff --git a/test/algorithm_test/search_n.cpp b/test/algorithm_test/search_n.cpp
new file mode 100644
index 0000000..3b0aa91
--- /dev/null
+++ b/test/algorithm_test/search_n.cpp
@@ -0,0 +1,93 @@
+// 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/
+//
+#include <boost/range/algorithm/search_n.hpp>
+
+#include <boost/test/test_tools.hpp>
+#include <boost/test/unit_test.hpp>
+
+#include <boost/assign.hpp>
+#include <algorithm>
+#include <list>
+#include <set>
+#include <vector>
+
+namespace
+{
+    template< class Container1, class Value >
+    void test_search_n_impl(Container1& cont1, Value value)
+    {
+        typedef BOOST_DEDUCED_TYPENAME Container1::const_iterator const_iterator1_t;
+        typedef BOOST_DEDUCED_TYPENAME Container1::iterator iterator1_t;
+
+        const Container1& ccont1 = cont1;
+
+        for (std::size_t n = 0; n < cont1.size(); ++n)
+        {
+            iterator1_t it = boost::search_n(cont1, n, value);
+            BOOST_CHECK( it == boost::search_n(boost::make_iterator_range(cont1), n, value) );
+            BOOST_CHECK( it == std::search_n(cont1.begin(), cont1.end(), n, value) );
+
+            const_iterator1_t cit = boost::search_n(ccont1, n, value);
+            BOOST_CHECK( cit == boost::search_n(boost::make_iterator_range(ccont1), n, value) );
+            BOOST_CHECK( cit == std::search_n(ccont1.begin(), ccont1.end(), n, value) );
+        }
+    }
+
+    template< class Container1, class Container2 >
+    void test_search_n_impl()
+    {
+        using namespace boost::assign;
+
+        Container1 cont1;
+
+        test_search_n_impl(cont1, 1);
+
+        cont1 += 1;
+        test_search_n_impl(cont1, 1);
+        test_search_n_impl(cont1, 0);
+
+        cont1.clear();
+        cont1 += 1,1;
+        test_search_n_impl(cont1, 1);
+        test_search_n_impl(cont1, 0);
+
+        cont1 += 1,1,1;
+        test_search_n_impl(cont1, 1);
+        test_search_n_impl(cont1, 0);
+
+        cont1.clear();
+        cont1 += 1,2,3,4,5,6,7,8,9;
+        test_search_n_impl(cont1, 1);
+        test_search_n_impl(cont1, 2);
+        test_search_n_impl(cont1, 5);
+        test_search_n_impl(cont1, 9);
+    }
+
+    void test_search_n()
+    {
+        test_search_n_impl< std::list<int>, std::list<int> >();
+        test_search_n_impl< std::vector<int>, std::vector<int> >();
+        test_search_n_impl< std::set<int>, std::set<int> >();
+        test_search_n_impl< std::list<int>, std::vector<int> >();
+        test_search_n_impl< std::vector<int>, std::list<int> >();
+    }
+}
+
+boost::unit_test::test_suite*
+init_unit_test_suite(int argc, char* argv[])
+{
+    boost::unit_test::test_suite* test
+        = BOOST_TEST_SUITE( "RangeTestSuite.algorithm.search_n" );
+
+    test->add( BOOST_TEST_CASE( &test_search_n ) );
+
+    return test;
+}
diff --git a/test/algorithm_test/set_difference.cpp b/test/algorithm_test/set_difference.cpp
index 7fb0974..84dc62c 100644
--- a/test/algorithm_test/set_difference.cpp
+++ b/test/algorithm_test/set_difference.cpp
@@ -62,6 +62,28 @@ namespace boost
 
             check_result(reference, reference_result,
                          test_cont, test_result);
+                         
+            test_result = boost::set_difference(
+                            boost::make_iterator_range(cont1), cont2,
+                            test_cont.begin());
+            
+            check_result(reference, reference_result,
+                         test_cont, test_result);
+                         
+            test_result = boost::set_difference(
+                            cont1, boost::make_iterator_range(cont2),
+                            test_cont.begin());
+                            
+            check_result(reference, reference_result,
+                         test_cont, test_result);
+                         
+            test_result = boost::set_difference(
+                            boost::make_iterator_range(cont1),
+                            boost::make_iterator_range(cont2),
+                            test_cont.begin());
+                            
+            check_result(reference, reference_result,
+                         test_cont, test_result);
         }
 
         template<class Container, class BinaryPredicate>
@@ -100,6 +122,28 @@ namespace boost
 
             check_result(reference, reference_result,
                          test_cont, test_result);
+                         
+            test_result = boost::set_difference(
+                            boost::make_iterator_range(cont1), cont2,
+                            test_cont.begin(), pred);
+                            
+            check_result(reference, reference_result,
+                         test_cont, test_result);
+                         
+            test_result = boost::set_difference(
+                            cont1, boost::make_iterator_range(cont2),
+                            test_cont.begin(), pred);
+                            
+            check_result(reference, reference_result,
+                         test_cont, test_result);
+                         
+            test_result = boost::set_difference(
+                            boost::make_iterator_range(cont1),
+                            boost::make_iterator_range(cont2),
+                            test_cont.begin(), pred);
+                            
+            check_result(reference, reference_result,
+                         test_cont, test_result);
         }
 
         template<class Container1, class Container2>
diff --git a/test/algorithm_test/set_intersection.cpp b/test/algorithm_test/set_intersection.cpp
index 5e2ce1b..213bbdf 100644
--- a/test/algorithm_test/set_intersection.cpp
+++ b/test/algorithm_test/set_intersection.cpp
@@ -62,6 +62,28 @@ namespace boost
 
             check_result(reference, reference_result,
                          test_cont, test_result);
+                         
+            test_result = boost::set_intersection(
+                            boost::make_iterator_range(cont1), cont2,
+                            test_cont.begin());
+                            
+            check_result(reference, reference_result,
+                         test_cont, test_result);
+                         
+            test_result = boost::set_intersection(
+                            cont1, boost::make_iterator_range(cont2),
+                            test_cont.begin());
+                            
+            check_result(reference, reference_result,
+                         test_cont, test_result);
+                         
+            test_result = boost::set_intersection(
+                            boost::make_iterator_range(cont1),
+                            boost::make_iterator_range(cont2),
+                            test_cont.begin());
+                            
+            check_result(reference, reference_result,
+                         test_cont, test_result);
         }
 
         template<class Container, class BinaryPredicate>
@@ -100,6 +122,28 @@ namespace boost
 
             check_result(reference, reference_result,
                          test_cont, test_result);
+                         
+            test_result = boost::set_intersection(
+                            boost::make_iterator_range(cont1), cont2,
+                            test_cont.begin(), pred);
+                            
+            check_result(reference, reference_result,
+                         test_cont, test_result);
+                         
+            test_result = boost::set_intersection(
+                            cont1, boost::make_iterator_range(cont2),
+                            test_cont.begin(), pred);
+                            
+            check_result(reference, reference_result,
+                         test_cont, test_result);
+                         
+            test_result = boost::set_intersection(
+                            boost::make_iterator_range(cont1),
+                            boost::make_iterator_range(cont2),
+                            test_cont.begin(), pred);
+                            
+            check_result(reference, reference_result,
+                         test_cont, test_result);
         }
 
         template<class Container1, class Container2>
diff --git a/test/algorithm_test/set_symmetric_difference.cpp b/test/algorithm_test/set_symmetric_difference.cpp
index 149532c..b792fd8 100644
--- a/test/algorithm_test/set_symmetric_difference.cpp
+++ b/test/algorithm_test/set_symmetric_difference.cpp
@@ -63,6 +63,28 @@ namespace boost
 
             check_result(reference, reference_result,
                          test_cont, test_result);
+                         
+            test_result = boost::set_symmetric_difference(
+                            boost::make_iterator_range(cont1), cont2,
+                            test_cont.begin());
+                            
+            check_result(reference, reference_result,
+                         test_cont, test_result);
+                         
+            test_result = boost::set_symmetric_difference(
+                            cont1, boost::make_iterator_range(cont2),
+                            test_cont.begin());
+                            
+            check_result(reference, reference_result,
+                         test_cont, test_result);
+                         
+            test_result = boost::set_symmetric_difference(
+                            boost::make_iterator_range(cont1),
+                            boost::make_iterator_range(cont2),
+                            test_cont.begin());
+                            
+            check_result(reference, reference_result,
+                         test_cont, test_result);
         }
 
         template<class Container, class BinaryPredicate>
@@ -102,6 +124,28 @@ namespace boost
 
             check_result(reference, reference_result,
                          test_cont, test_result);
+                         
+            test_result = boost::set_symmetric_difference(
+                            boost::make_iterator_range(cont1), cont2,
+                            test_cont.begin(), pred);
+                            
+            check_result(reference, reference_result,
+                         test_cont, test_result);
+                         
+            test_result = boost::set_symmetric_difference(
+                            cont1, boost::make_iterator_range(cont2),
+                            test_cont.begin(), pred);
+                            
+            check_result(reference, reference_result,
+                         test_cont, test_result);
+                         
+            test_result = boost::set_symmetric_difference(
+                            boost::make_iterator_range(cont1),
+                            boost::make_iterator_range(cont2),
+                            test_cont.begin(), pred);
+                            
+            check_result(reference, reference_result,
+                         test_cont, test_result);
         }
 
         template<class Container1, class Container2>
diff --git a/test/algorithm_test/set_union.cpp b/test/algorithm_test/set_union.cpp
index f9450b3..7f9f10a 100644
--- a/test/algorithm_test/set_union.cpp
+++ b/test/algorithm_test/set_union.cpp
@@ -62,6 +62,26 @@ namespace boost
 
             check_result(reference, reference_result,
                          test_cont, test_result);
+                         
+            test_result = boost::set_union(boost::make_iterator_range(cont1),
+                                           cont2, test_cont.begin());
+                                           
+            check_result(reference, reference_result,
+                         test_cont, test_result);
+                         
+            test_result = boost::set_union(cont1,
+                                           boost::make_iterator_range(cont2),
+                                           test_cont.begin());
+                                           
+            check_result(reference, reference_result,
+                         test_cont, test_result);
+                         
+            test_result = boost::set_union(boost::make_iterator_range(cont1),
+                                           boost::make_iterator_range(cont2),
+                                           test_cont.begin());
+                                           
+            check_result(reference, reference_result,
+                         test_cont, test_result);
         }
 
         template<class Container, class BinaryPredicate>
@@ -100,6 +120,26 @@ namespace boost
 
             check_result(reference, reference_result,
                          test_cont, test_result);
+                         
+            test_result = boost::set_union(boost::make_iterator_range(cont1),
+                                           cont2, test_cont.begin(), pred);
+                                           
+            check_result(reference, reference_result,
+                         test_cont, test_result);
+                         
+            test_result = boost::set_union(cont1,
+                                           boost::make_iterator_range(cont2),
+                                           test_cont.begin(), pred);
+                                           
+            check_result(reference, reference_result,
+                         test_cont, test_result);
+                         
+            test_result = boost::set_union(boost::make_iterator_range(cont1),
+                                           boost::make_iterator_range(cont2),
+                                           test_cont.begin(), pred);
+                                           
+            check_result(reference, reference_result,
+                         test_cont, test_result);
         }
 
         template<class Container1, class Container2>
diff --git a/test/algorithm_test/sort.cpp b/test/algorithm_test/sort.cpp
index b1b26e7..c6611f7 100644
--- a/test/algorithm_test/sort.cpp
+++ b/test/algorithm_test/sort.cpp
@@ -33,10 +33,13 @@ namespace boost
             boost::sort(test);
             std::sort(reference.begin(), reference.end());
 
-            BOOST_CHECK_EQUAL_COLLECTIONS(
-                reference.begin(), reference.end(),
-                test.begin(), test.end()
-                );
+            BOOST_CHECK_EQUAL_COLLECTIONS( reference.begin(), reference.end(),
+                                           test.begin(), test.end() );
+                                           
+            Container test2(cont);
+            boost::sort(boost::make_iterator_range(test2));
+            BOOST_CHECK_EQUAL_COLLECTIONS( reference.begin(), reference.end(),
+                                           test2.begin(), test2.end() );
         }
 
         template<class Container, class BinaryPredicate>
@@ -52,6 +55,11 @@ namespace boost
                 reference.begin(), reference.end(),
                 test.begin(), test.end()
                 );
+                
+            Container test2(cont);
+            boost::sort(boost::make_iterator_range(test2), pred);
+            BOOST_CHECK_EQUAL_COLLECTIONS( reference.begin(), reference.end(),
+                                           test2.begin(), test2.end() );
         }
 
         template<class Container>
diff --git a/test/algorithm_test/stable_partition.cpp b/test/algorithm_test/stable_partition.cpp
index fad4bef..5f55b7d 100644
--- a/test/algorithm_test/stable_partition.cpp
+++ b/test/algorithm_test/stable_partition.cpp
@@ -41,7 +41,21 @@ namespace boost
             BOOST_DEDUCED_TYPENAME range_iterator<Container>::type
             test_iter(Container& cont)
             {
-                return boost::stable_partition(cont, UnaryPredicate());
+                Container cont2(cont);
+                
+                typedef BOOST_DEDUCED_TYPENAME range_iterator<Container>::type iter_t;
+                iter_t result = boost::stable_partition(cont, UnaryPredicate());
+                
+                iter_t temp_result = boost::stable_partition(
+                    boost::make_iterator_range(cont2), UnaryPredicate());
+                    
+                BOOST_CHECK_EQUAL( std::distance(cont.begin(), result),
+                                   std::distance(cont2.begin(), temp_result) );
+                                   
+                BOOST_CHECK_EQUAL_COLLECTIONS( cont.begin(), cont.end(),
+                                               cont2.begin(), cont2.end() );
+                
+                return result;
             }
 
             UnaryPredicate pred() const { return UnaryPredicate(); }
@@ -53,7 +67,17 @@ namespace boost
                 BOOST_DEDUCED_TYPENAME range_return<Container,return_type>::type
                 operator()(Policy& policy, Container& cont)
                 {
-                    return boost::stable_partition<return_type>(cont, policy.pred());
+                    typedef BOOST_DEDUCED_TYPENAME range_return<Container,return_type>::type result_t;
+                    Container cont2(cont);
+                    result_t result = boost::stable_partition<return_type>(cont, policy.pred());
+                    
+                    result_t result2 = boost::stable_partition<return_type>(
+                                        boost::make_iterator_range(cont2), policy.pred());
+                                        
+                    BOOST_CHECK_EQUAL_COLLECTIONS( cont2.begin(), cont2.end(),
+                                                   cont.begin(), cont.end() );
+                                        
+                    return result;
                 }
             };
 
diff --git a/test/algorithm_test/stable_sort.cpp b/test/algorithm_test/stable_sort.cpp
index eb5518c..8372bd6 100644
--- a/test/algorithm_test/stable_sort.cpp
+++ b/test/algorithm_test/stable_sort.cpp
@@ -33,10 +33,13 @@ namespace boost
             boost::stable_sort(test);
             std::stable_sort(reference.begin(), reference.end());
 
-            BOOST_CHECK_EQUAL_COLLECTIONS(
-                reference.begin(), reference.end(),
-                test.begin(), test.end()
-                );
+            BOOST_CHECK_EQUAL_COLLECTIONS( reference.begin(), reference.end(),
+                                           test.begin(), test.end() );
+                
+            test = cont;
+            boost::stable_sort(boost::make_iterator_range(test));
+            BOOST_CHECK_EQUAL_COLLECTIONS( reference.begin(), reference.end(),
+                                           test.begin(), test.end() );
         }
 
         template<class Container, class BinaryPredicate>
@@ -48,10 +51,13 @@ namespace boost
             boost::stable_sort(test, pred);
             std::stable_sort(reference.begin(), reference.end(), pred);
 
-            BOOST_CHECK_EQUAL_COLLECTIONS(
-                reference.begin(), reference.end(),
-                test.begin(), test.end()
-                );
+            BOOST_CHECK_EQUAL_COLLECTIONS( reference.begin(), reference.end(),
+                                           test.begin(), test.end() );
+                                           
+            test = cont;
+            boost::stable_sort(boost::make_iterator_range(test), pred);
+            BOOST_CHECK_EQUAL_COLLECTIONS( reference.begin(), reference.end(),
+                                           test.begin(), test.end() );
         }
 
         template<class Container>
diff --git a/test/algorithm_test/swap_ranges.cpp b/test/algorithm_test/swap_ranges.cpp
new file mode 100644
index 0000000..a96bfac
--- /dev/null
+++ b/test/algorithm_test/swap_ranges.cpp
@@ -0,0 +1,116 @@
+// 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/
+//
+#include <boost/range/algorithm/swap_ranges.hpp>
+
+#include <boost/test/test_tools.hpp>
+#include <boost/test/unit_test.hpp>
+
+#include <boost/assign.hpp>
+#include <boost/bind.hpp>
+#include <algorithm>
+#include <functional>
+#include <list>
+#include <numeric>
+#include <deque>
+#include <vector>
+
+namespace
+{
+    template<class Container1, class Container2>
+    void test_swap_ranges_impl(const Container1& source1, const Container2& source2)
+    {
+        Container1 reference1(source1);
+        Container2 reference2(source2);
+        std::swap_ranges(reference1.begin(), reference1.end(), reference2.begin());
+
+        Container1 test1(source1);
+        Container2 test2(source2);
+        boost::swap_ranges(test1, test2);
+
+        BOOST_CHECK_EQUAL_COLLECTIONS( reference1.begin(), reference1.end(),
+                                       test1.begin(), test1.end() );
+
+        BOOST_CHECK_EQUAL_COLLECTIONS( reference2.begin(), reference2.end(),
+                                       test2.begin(), test2.end() );
+                                       
+        test1 = source1;
+        test2 = source2;
+        boost::swap_ranges(boost::make_iterator_range(test1), test2);
+        BOOST_CHECK_EQUAL_COLLECTIONS( reference1.begin(), reference1.end(),
+                                       test1.begin(), test1.end() );
+        BOOST_CHECK_EQUAL_COLLECTIONS( reference2.begin(), reference2.end(),
+                                       test2.begin(), test2.end() );
+                                       
+        test1 = source1;
+        test2 = source2;
+        boost::swap_ranges(test1, boost::make_iterator_range(test2));
+        BOOST_CHECK_EQUAL_COLLECTIONS( reference1.begin(), reference1.end(),
+                                       test1.begin(), test1.end() );
+        BOOST_CHECK_EQUAL_COLLECTIONS( reference2.begin(), reference2.end(),
+                                       test2.begin(), test2.end() );
+                                       
+        test1 = source1;
+        test2 = source2;
+        boost::swap_ranges(boost::make_iterator_range(test1),
+                           boost::make_iterator_range(test2));
+        BOOST_CHECK_EQUAL_COLLECTIONS( reference1.begin(), reference1.end(),
+                                       test1.begin(), test1.end() );
+        BOOST_CHECK_EQUAL_COLLECTIONS( reference2.begin(), reference2.end(),
+                                       test2.begin(), test2.end() );
+    }
+
+    template<class Container1, class Container2>
+    void test_swap_ranges_impl()
+    {
+        using namespace boost::assign;
+
+        Container1 c1;
+        Container2 c2;
+
+        test_swap_ranges_impl(c1, c2);
+
+        c1.clear();
+        c1 += 1;
+        c2.clear();
+        c2 += 2;
+        test_swap_ranges_impl(c1, c2);
+
+        c1.clear();
+        c1 += 1,2,3,4,5,6,7,8,9,10;
+        c2.clear();
+        c2 += 10,9,8,7,6,5,4,3,2,1;
+        test_swap_ranges_impl(c1, c2);
+    }
+
+    inline void test_swap_ranges()
+    {
+        test_swap_ranges_impl< std::vector<int>, std::vector<int> >();
+        test_swap_ranges_impl< std::vector<int>, std::list<int> >();
+        test_swap_ranges_impl< std::vector<int>, std::deque<int> >();
+        test_swap_ranges_impl< std::list<int>, std::vector<int> >();
+        test_swap_ranges_impl< std::list<int>, std::list<int> >();
+        test_swap_ranges_impl< std::list<int>, std::deque<int> >();
+        test_swap_ranges_impl< std::deque<int>, std::vector<int> >();
+        test_swap_ranges_impl< std::deque<int>, std::list<int> >();
+        test_swap_ranges_impl< std::deque<int>, std::deque<int> >();
+    }
+}
+
+boost::unit_test::test_suite*
+init_unit_test_suite(int argc, char* argv[])
+{
+    boost::unit_test::test_suite* test
+        = BOOST_TEST_SUITE( "RangeTestSuite.algorithm.swap_ranges" );
+
+    test->add( BOOST_TEST_CASE( &test_swap_ranges ) );
+
+    return test;
+}
diff --git a/test/algorithm_test/transform.cpp b/test/algorithm_test/transform.cpp
index 7f016a2..3e37180 100644
--- a/test/algorithm_test/transform.cpp
+++ b/test/algorithm_test/transform.cpp
@@ -47,16 +47,23 @@ namespace boost
 
             BOOST_CHECK( test_it == target.end() );
             BOOST_CHECK_EQUAL_COLLECTIONS( reference.begin(), reference.end(),
-                target.begin(), target.end() );
-
+                                           target.begin(), target.end() );
+                
+            BOOST_CHECK( test_it == boost::transform(boost::make_iterator_range(cont), target.begin(), fn) );
+            BOOST_CHECK_EQUAL_COLLECTIONS( reference.begin(), reference.end(),
+                                           target.begin(), target.end() );
+                                           
             target.clear();
             target.resize(ccont.size());
 
             test_it = boost::transform(ccont, target.begin(), fn);
-
+            
             BOOST_CHECK( test_it == target.end() );
             BOOST_CHECK_EQUAL_COLLECTIONS( reference.begin(), reference.end(),
-                target.begin(), target.end() );
+                                           target.begin(), target.end() );
+            BOOST_CHECK( test_it == boost::transform(boost::make_iterator_range(ccont), target.begin(), fn) );
+            BOOST_CHECK_EQUAL_COLLECTIONS( reference.begin(), reference.end(),
+                                           target.begin(), target.end() );
         }
 
         template< class Container >
@@ -97,10 +104,25 @@ namespace boost
 
             iterator_t test_it
                 = boost::transform(cont1, cont2, target.begin(), fn);
-
+                
             BOOST_CHECK( test_it == target.end() );
             BOOST_CHECK_EQUAL_COLLECTIONS( reference.begin(), reference.end(),
-                target.begin(), target.end() );
+                                           target.begin(), target.end() );
+                                           
+            BOOST_CHECK( test_it == boost::transform(boost::make_iterator_range(cont1), cont2, target.begin(), fn) );
+            BOOST_CHECK_EQUAL_COLLECTIONS( reference.begin(), reference.end(),
+                                           target.begin(), target.end() );
+                                           
+            BOOST_CHECK( test_it == boost::transform(cont1, boost::make_iterator_range(cont2), target.begin(), fn) );
+            BOOST_CHECK_EQUAL_COLLECTIONS( reference.begin(), reference.end(),
+                                           target.begin(), target.end() );
+                                           
+            BOOST_CHECK( test_it == boost::transform(boost::make_iterator_range(cont1),
+                                                     boost::make_iterator_range(cont2),
+                                                     target.begin(), fn) );
+            BOOST_CHECK_EQUAL_COLLECTIONS( reference.begin(), reference.end(),
+                                           target.begin(), target.end() );
+                         
 
             target.clear();
             target.resize(ccont1.size());
diff --git a/test/algorithm_test/unique.cpp b/test/algorithm_test/unique.cpp
index 2e2ebfa..49af0e3 100644
--- a/test/algorithm_test/unique.cpp
+++ b/test/algorithm_test/unique.cpp
@@ -47,7 +47,18 @@ namespace boost
                 BOOST_DEDUCED_TYPENAME range_return<Container,return_type>::type
                 operator()(Policy&, Container& cont)
                 {
-                    return boost::unique<return_type>(cont);
+                    typedef BOOST_DEDUCED_TYPENAME range_return<Container,return_type>::type result_t;
+                    
+                    Container cont2(cont);
+                    
+                    result_t result = boost::unique<return_type>(cont);
+                    
+                    boost::unique<return_type>(boost::make_iterator_range(cont2));
+                    
+                    BOOST_CHECK_EQUAL_COLLECTIONS( cont.begin(), cont.end(),
+                                                   cont2.begin(), cont2.end() );
+                    
+                    return result;
                 }
             };
 
@@ -82,7 +93,18 @@ namespace boost
                 BOOST_DEDUCED_TYPENAME range_return<Container,return_type>::type
                 operator()(Policy& policy, Container& cont)
                 {
-                    return boost::unique<return_type>(cont, policy.pred());
+                    typedef BOOST_DEDUCED_TYPENAME range_return<Container,return_type>::type result_t;
+                    
+                    Container cont2(cont);
+                    
+                    result_t result = boost::unique<return_type>(cont, policy.pred());
+                    
+                    boost::unique<return_type>(boost::make_iterator_range(cont2), policy.pred());
+                    
+                    BOOST_CHECK_EQUAL_COLLECTIONS( cont.begin(), cont.end(),
+                                                   cont2.begin(), cont2.end() );
+                    
+                    return result;
                 }
             };
 
diff --git a/test/algorithm_test/unique_copy.cpp b/test/algorithm_test/unique_copy.cpp
new file mode 100644
index 0000000..21f107a
--- /dev/null
+++ b/test/algorithm_test/unique_copy.cpp
@@ -0,0 +1,158 @@
+// 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/
+//
+#include <boost/range/algorithm/unique_copy.hpp>
+
+#include <boost/test/test_tools.hpp>
+#include <boost/test/unit_test.hpp>
+
+#include <boost/assign.hpp>
+#include <boost/bind.hpp>
+#include <algorithm>
+#include <functional>
+#include <list>
+#include <numeric>
+#include <deque>
+#include <vector>
+
+namespace
+{
+    template<class OutputIterator, class Value>
+    void test_append(OutputIterator target, Value value)
+    {
+        *target++ = value;
+    }
+
+    template<class Container>
+    void test_unique_copy_impl(Container& c)
+    {
+        typedef BOOST_DEDUCED_TYPENAME boost::range_value<Container>::type value_type;
+        std::vector<value_type> reference;
+        std::vector<value_type> test;
+
+        test_append(
+            std::unique_copy(c.begin(), c.end(), std::back_inserter(reference)),
+            value_type()
+            );
+
+        test_append(
+            boost::unique_copy(c, std::back_inserter(test)),
+            value_type()
+            );
+
+        BOOST_CHECK_EQUAL_COLLECTIONS(reference.begin(), reference.end(),
+                                      test.begin(), test.end());
+                                      
+        test.clear();
+        
+        test_append(
+            boost::unique_copy(boost::make_iterator_range(c),
+                               std::back_inserter(test)),
+            value_type()
+            );
+            
+        BOOST_CHECK_EQUAL_COLLECTIONS(reference.begin(), reference.end(),
+                                      test.begin(), test.end());
+    }
+
+    template<class Container, class Pred>
+    void test_unique_copy_impl(Container& c, Pred pred)
+    {
+        typedef BOOST_DEDUCED_TYPENAME boost::range_value<Container>::type value_type;
+        std::vector<value_type> reference;
+        std::vector<value_type> test;
+
+        test_append(
+            std::unique_copy(c.begin(), c.end(), std::back_inserter(reference), pred),
+            value_type()
+            );
+
+        test_append(
+            boost::unique_copy(c, std::back_inserter(test), pred),
+            value_type()
+            );
+
+        BOOST_CHECK_EQUAL_COLLECTIONS(reference.begin(), reference.end(),
+                                      test.begin(), test.end());
+                                      
+        test.clear();
+        
+        test_append(
+            boost::unique_copy(boost::make_iterator_range(c),
+                               std::back_inserter(test), pred),
+            value_type()
+            );
+            
+        BOOST_CHECK_EQUAL_COLLECTIONS(reference.begin(), reference.end(),
+                                      test.begin(), test.end());
+    }
+
+    template<class Container, class Pred>
+    void test_unique_copy_driver(Pred pred)
+    {
+        using namespace boost::assign;
+
+        typedef BOOST_DEDUCED_TYPENAME Container::value_type value_t;
+
+        Container cont;
+
+        test_unique_copy_impl(cont);
+        test_unique_copy_impl(cont, pred);
+
+        cont.clear();
+        cont += 1;
+
+        std::vector<value_t> temp(cont.begin(), cont.end());
+        std::sort(temp.begin(), temp.end());
+        cont.assign(temp.begin(), temp.end());
+        test_unique_copy_impl(cont);
+
+        std::sort(temp.begin(), temp.end(), pred);
+        cont.assign(temp.begin(), temp.end());
+        test_unique_copy_impl(cont, pred);
+
+        cont.clear();
+        cont += 1,2,2,2,2,3,4,5,6,7,8,9;
+
+        temp.assign(cont.begin(), cont.end());
+        std::sort(temp.begin(), temp.end());
+        cont.assign(temp.begin(), temp.end());
+        test_unique_copy_impl(cont);
+
+        std::sort(temp.begin(), temp.end(), pred);
+        cont.assign(temp.begin(), temp.end());
+        test_unique_copy_impl(cont, pred);
+    }
+
+    template<class Container>
+    void test_unique_copy_impl()
+    {
+        test_unique_copy_driver<Container>(std::less<int>());
+        test_unique_copy_driver<Container>(std::greater<int>());
+    }
+
+    void test_unique_copy()
+    {
+        test_unique_copy_impl< std::vector<int> >();
+        test_unique_copy_impl< std::list<int> >();
+        test_unique_copy_impl< std::deque<int> >();
+    }
+}
+
+boost::unit_test::test_suite*
+init_unit_test_suite(int argc, char* argv[])
+{
+    boost::unit_test::test_suite* test
+        = BOOST_TEST_SUITE( "RangeTestSuite.algorithm.unique_copy" );
+
+    test->add( BOOST_TEST_CASE( &test_unique_copy ) );
+
+    return test;
+}
diff --git a/test/algorithm_test/upper_bound.cpp b/test/algorithm_test/upper_bound.cpp
index 2eb64cf..95e3965 100644
--- a/test/algorithm_test/upper_bound.cpp
+++ b/test/algorithm_test/upper_bound.cpp
@@ -32,7 +32,10 @@ namespace boost
             BOOST_DEDUCED_TYPENAME range_iterator<Container>::type
             test_iter(Container& cont)
             {
-                return boost::upper_bound(cont, 5);
+                typedef BOOST_DEDUCED_TYPENAME range_iterator<Container>::type iter_t;
+                iter_t result = boost::upper_bound(cont, 5);
+                BOOST_CHECK( result == boost::upper_bound(boost::make_iterator_range(cont), 5) );
+                return result;
             }
 
             template<range_return_value result_type>
@@ -42,7 +45,10 @@ namespace boost
                 BOOST_DEDUCED_TYPENAME range_return<Container,result_type>::type
                 operator()(Policy&, Container& cont)
                 {
-                    return boost::upper_bound<result_type>(cont, 5);
+                    typedef BOOST_DEDUCED_TYPENAME range_return<Container,result_type>::type result_t;
+                    result_t result = boost::upper_bound<result_type>(cont, 5);
+                    BOOST_CHECK( result == boost::upper_bound<result_type>(boost::make_iterator_range(cont), 5) );
+                    return result;
                 }
             };
 
@@ -61,7 +67,10 @@ namespace boost
             BOOST_DEDUCED_TYPENAME range_iterator<Container>::type
             test_iter(Container& cont)
             {
-                return boost::upper_bound(cont, 5, BinaryPredicate());
+                typedef BOOST_DEDUCED_TYPENAME range_iterator<Container>::type iter_t;
+                iter_t result = boost::upper_bound(cont, 5, BinaryPredicate());
+                BOOST_CHECK( result == boost::upper_bound(boost::make_iterator_range(cont), 5, BinaryPredicate()) );
+                return result;
             }
 
             template< range_return_value result_type>
@@ -71,8 +80,14 @@ namespace boost
                 BOOST_DEDUCED_TYPENAME range_return<Container,result_type>::type
                 operator()(Policy& policy, Container& cont)
                 {
-                    return boost::upper_bound<result_type>(
-                        cont, 5, policy.pred());
+                    typedef BOOST_DEDUCED_TYPENAME range_return<Container,result_type>::type result_t;
+                    
+                    result_t result = boost::upper_bound<result_type>(cont, 5, policy.pred());
+                    
+                    BOOST_CHECK( result == boost::upper_bound<result_type>(
+                        boost::make_iterator_range(cont), 5, policy.pred()) );
+                        
+                    return result;
                 }
             };
 
diff --git a/test/replace_copy.cpp b/test/replace_copy.cpp
new file mode 100644
index 0000000..e69de29
diff --git a/test/string.cpp b/test/string.cpp
index 127f70a..f73abb0 100644
--- a/test/string.cpp
+++ b/test/string.cpp
@@ -17,6 +17,7 @@
 #  pragma warn -8057 // unused argument argc/argv in Boost.Test
 #endif
 
+#include <boost/array.hpp>
 #include <boost/range/as_array.hpp>
 #include <boost/range/as_literal.hpp>
 #include <boost/range/functions.hpp>
@@ -29,6 +30,34 @@
 #include <fstream>
 #include <algorithm>
 
+namespace
+{
+    template< class CharT, std::size_t Length >
+    class test_string
+    {
+    public:
+        typedef CharT value_type;
+        typedef value_type* pointer;
+        typedef const value_type* const_pointer;
+        typedef std::size_t size_type;
+        typedef value_type array_t[Length];
+        typedef const value_type const_array_t[Length];
+        
+        explicit test_string(const CharT literal_sz[])
+        {
+            std::copy(literal_sz, literal_sz + Length, m_buffer.data());
+            m_buffer[Length] = value_type();
+        }
+
+        const_pointer const_sz() const { return m_buffer.data(); }
+        pointer mutable_sz() { return m_buffer.data(); }
+
+    private:
+        typedef boost::array<value_type, Length + 1> buffer_t;
+        buffer_t m_buffer;
+    };
+}
+
 template< class T >
 inline BOOST_DEDUCED_TYPENAME boost::range_iterator<T>::type
 str_begin( T& r )
@@ -105,11 +134,15 @@ void check_char()
 {
     typedef char*                  char_iterator_t;
     typedef char                   char_array_t[10];
-    const char*      char_s            = "a string";
-    char             my_string[]       = "another string";
+    
+    test_string<char, 8> a_string("a string");
+    test_string<char, 14> another_string("another string");
+
+    const char*      char_s = a_string.const_sz();
+    char             my_string[] = "another_string";
     const char       my_const_string[] = "another string";
-    const unsigned   my_string_length  = 14;
-    char*            char_s2           = "a string";
+    const unsigned   my_string_length = 14;
+    char*            char_s2 = a_string.mutable_sz();
     
     BOOST_STATIC_ASSERT(( is_same<  range_value<char_iterator_t>::type, 
                                     detail::iterator_traits<char_iterator_t>::value_type>::value ));
@@ -181,10 +214,14 @@ void check_string()
     check_char();
     
 #ifndef BOOST_NO_STD_WSTRING
-    typedef wchar_t*               wchar_iterator_t;          
-    const wchar_t*  char_ws      = L"a wide string";
+    typedef wchar_t*               wchar_iterator_t;
+
+    test_string<wchar_t, 13> a_wide_string(L"a wide string");
+    test_string<wchar_t, 19> another_wide_string(L"another wide string");
+    
+    const wchar_t*  char_ws      = a_wide_string.const_sz();
     wchar_t         my_wstring[] = L"another wide string";
-    wchar_t*        char_ws2     = L"a wide string";
+    wchar_t*        char_ws2     = a_wide_string.mutable_sz();
             
     BOOST_STATIC_ASSERT(( is_same< range_value<wchar_iterator_t>::type, 
                                    detail::iterator_traits<wchar_iterator_t>::value_type>::value ));
@@ -203,12 +240,17 @@ void check_string()
     BOOST_CHECK_EQUAL( sz, std::char_traits<wchar_t>::length( char_ws ) );
 
     wchar_t to_search = L'n';
-    BOOST_CHECK( find( char_ws, to_search ) != str_end(char_ws) );    
+    BOOST_CHECK( find( char_ws, to_search ) != str_end(char_ws) );
+    BOOST_CHECK( find( char_ws2, to_search ) != str_end(char_ws2) );
 
 #if BOOST_WORKAROUND(_MSC_VER, BOOST_TESTED_AT(1300))
 
     BOOST_CHECK( find( my_wstring, to_search ) != str_end(my_wstring) );
 
+#else
+
+    boost::ignore_unused_variable_warning( my_wstring );
+    
 #endif  
 #endif
     
diff --git a/test/test_function/true_predicate.hpp b/test/test_function/true_predicate.hpp
new file mode 100644
index 0000000..87a0dca
--- /dev/null
+++ b/test/test_function/true_predicate.hpp
@@ -0,0 +1,29 @@
+// Boost.Range library
+//
+//  Copyright Neil Groves 2010. 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/
+//
+#ifndef BOOST_RANGE_TEST_TEST_FUNCTION_TRUE_PREDICATE_HPP_INCLUDED
+#define BOOST_RANGE_TEST_TEST_FUNCTION_TRUE_PREDICATE_HPP_INCLUDED
+
+namespace boost
+{
+    namespace range_test_function
+    {
+        struct true_predicate
+        {
+            typedef bool result_type;
+
+            bool operator()() const { return true; }
+            template<class Arg> bool operator()(Arg) const { return true; }
+            template<class Arg1, class Arg2> bool operator()(Arg1,Arg2) const { return true; }
+        };
+    }
+}
+
+#endif // include guard

From fb8994f51c00146117979a8432bc309bf8af1253 Mon Sep 17 00:00:00 2001
From: Daniel James <daniel@calamity.org.uk>
Date: Mon, 19 Jul 2010 23:29:09 +0000
Subject: [PATCH 40/73] Merge documentation changes.

[SVN r64186]
---
 .../adaptors_general_requirements.html        | 141 ------
 .../adaptors/adaptors_introduction.html       | 274 ------------
 .../reference/adaptors/adaptors_synopsis.html |  67 ---
 doc/html/range/reference/algorithms/non.html  |  64 ---
 .../concept_implementation/overview.html      |  68 ---
 doc/html/range/reference/range_algorithm.html |  52 ---
 .../range/reference/ranges/introduction.html  |  46 --
 .../range/reference/ranges/reference.html     |  50 ---
 .../ranges/reference/counting_range.html      |  91 ----
 .../reference/ranges/reference/irange.html    | 104 -----
 .../ranges/reference/istream_range.html       |  73 ----
 .../range/reference/semantics/functions.html  | 408 ------------------
 .../reference/semantics/metafunctions.html    | 236 ----------
 doc/html/range/reference/synopsis.html        | 185 --------
 .../range/upgrade/upgrade_1_34_to_1_35.html   |  77 ----
 doc/html/range/utilities/iterator_range.html  | 322 --------------
 doc/html/range/utilities/join.html            |  89 ----
 doc/html/range/utilities/sub_range.html       | 122 ------
 18 files changed, 2469 deletions(-)
 delete mode 100644 doc/html/range/reference/adaptors/adaptors_general_requirements.html
 delete mode 100644 doc/html/range/reference/adaptors/adaptors_introduction.html
 delete mode 100644 doc/html/range/reference/adaptors/adaptors_synopsis.html
 delete mode 100644 doc/html/range/reference/algorithms/non.html
 delete mode 100644 doc/html/range/reference/concept_implementation/overview.html
 delete mode 100644 doc/html/range/reference/range_algorithm.html
 delete mode 100644 doc/html/range/reference/ranges/introduction.html
 delete mode 100644 doc/html/range/reference/ranges/reference.html
 delete mode 100644 doc/html/range/reference/ranges/reference/counting_range.html
 delete mode 100644 doc/html/range/reference/ranges/reference/irange.html
 delete mode 100644 doc/html/range/reference/ranges/reference/istream_range.html
 delete mode 100644 doc/html/range/reference/semantics/functions.html
 delete mode 100644 doc/html/range/reference/semantics/metafunctions.html
 delete mode 100644 doc/html/range/reference/synopsis.html
 delete mode 100644 doc/html/range/upgrade/upgrade_1_34_to_1_35.html
 delete mode 100644 doc/html/range/utilities/iterator_range.html
 delete mode 100644 doc/html/range/utilities/join.html
 delete mode 100644 doc/html/range/utilities/sub_range.html

diff --git a/doc/html/range/reference/adaptors/adaptors_general_requirements.html b/doc/html/range/reference/adaptors/adaptors_general_requirements.html
deleted file mode 100644
index a815bae..0000000
--- a/doc/html/range/reference/adaptors/adaptors_general_requirements.html
+++ /dev/null
@@ -1,141 +0,0 @@
-<html>
-<head>
-<meta http-equiv="Content-Type" content="text/html; charset=US-ASCII">
-<title>General Requirements</title>
-<link rel="stylesheet" href="../../../../../../../doc/html/boostbook.css" type="text/css">
-<meta name="generator" content="DocBook XSL Stylesheets V1.75.1">
-<link rel="home" href="../../../index.html" title="Chapter&#160;1.&#160;Range 2.0">
-<link rel="up" href="../adaptors.html" title="Range Adaptors">
-<link rel="prev" href="adaptors_synopsis.html" title="Synopsis">
-<link rel="next" href="adaptors_reference.html" title="Reference">
-</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="../../../../../../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="adaptors_synopsis.html"><img src="../../../../../../../doc/html/images/prev.png" alt="Prev"></a><a accesskey="u" href="../adaptors.html"><img src="../../../../../../../doc/html/images/up.png" alt="Up"></a><a accesskey="h" href="../../../index.html"><img src="../../../../../../../doc/html/images/home.png" alt="Home"></a><a accesskey="n" href="adaptors_reference.html"><img src="../../../../../../../doc/html/images/next.png" alt="Next"></a>
-</div>
-<div class="section" title="General Requirements">
-<div class="titlepage"><div><div><h4 class="title">
-<a name="range.reference.adaptors.adaptors_general_requirements"></a><a class="link" href="adaptors_general_requirements.html" title="General Requirements">
-        General Requirements</a>
-</h4></div></div></div>
-<p>
-          In the description of generator expressions, the following notation is
-          used:
-        </p>
-<div class="itemizedlist"><ul class="itemizedlist" type="disc">
-<li class="listitem">
-<code class="computeroutput"><span class="identifier">fwdRng</span></code> is an expression
-            of a type <code class="computeroutput"><span class="identifier">R</span></code> that models
-            <code class="computeroutput"><span class="identifier">ForwardRange</span></code>
-</li>
-<li class="listitem">
-<code class="computeroutput"><span class="identifier">biRng</span></code> is an expression
-            of a type <code class="computeroutput"><span class="identifier">R</span></code> that models
-            <code class="computeroutput"><span class="identifier">BidirectionalRange</span></code>
-</li>
-<li class="listitem">
-<code class="computeroutput"><span class="identifier">rndRng</span></code> is an expression
-            of a type <code class="computeroutput"><span class="identifier">R</span></code> that models
-            <code class="computeroutput"><span class="identifier">RandomAccessRange</span></code>
-</li>
-<li class="listitem">
-<code class="computeroutput"><span class="identifier">pred</span></code> is an expression
-            of a type that models <code class="computeroutput"><span class="identifier">UnaryPredicate</span></code>
-</li>
-<li class="listitem">
-<code class="computeroutput"><span class="identifier">bi_pred</span></code> is an expression
-            of a type that models <code class="computeroutput"><span class="identifier">BinaryPredicate</span></code>
-</li>
-<li class="listitem">
-<code class="computeroutput"><span class="identifier">fun</span></code> is an expression
-            of a type that models <code class="computeroutput"><span class="identifier">UnaryFunction</span></code>
-</li>
-<li class="listitem">
-<code class="computeroutput"><span class="identifier">value</span></code>, <code class="computeroutput"><span class="identifier">new_value</span></code> and <code class="computeroutput"><span class="identifier">old_value</span></code>
-            are objects convertible to <code class="computeroutput"><span class="identifier">boost</span><span class="special">::</span><span class="identifier">range_value</span><span class="special">&lt;</span><span class="identifier">R</span><span class="special">&gt;::</span><span class="identifier">type</span></code>
-</li>
-<li class="listitem">
-<code class="computeroutput"><span class="identifier">n</span><span class="special">,</span><span class="identifier">m</span></code> are integer expressions convertible
-            to <code class="computeroutput"><span class="identifier">range_difference</span><span class="special">&lt;</span><span class="identifier">R</span><span class="special">&gt;::</span><span class="identifier">type</span></code>
-</li>
-</ul></div>
-<p>
-          Also note that <code class="computeroutput"><span class="identifier">boost</span><span class="special">::</span><span class="identifier">range_value</span><span class="special">&lt;</span><span class="identifier">R</span><span class="special">&gt;::</span><span class="identifier">type</span></code> must be implicitly convertible to
-          the type arguments to <code class="computeroutput"><span class="identifier">pred</span></code>,
-          <code class="computeroutput"><span class="identifier">bi_pred</span></code> and <code class="computeroutput"><span class="identifier">fun</span></code>.
-        </p>
-<p>
-          Range Category in the following adaptor descriptions refers to the minimum
-          range concept required by the range passed to the adaptor. The resultant
-          range is a model of the same range concept as the input range unless specified
-          otherwise.
-        </p>
-<p>
-          Returned Range Category is the concept of the returned range. In some cases
-          the returned range is of a lesser category than the range passed to the
-          adaptor. For example, the <code class="computeroutput"><span class="identifier">filtered</span></code>
-          adaptor returns only a <code class="computeroutput"><span class="identifier">ForwardRange</span></code>
-          regardless of the input.
-        </p>
-<p>
-          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>
-<p>
-        </p>
-<p>
-          1. Applying <code class="computeroutput"><span class="keyword">operator</span><span class="special">|()</span></code>
-          to a range <code class="computeroutput"><span class="identifier">R</span></code> (always left
-          argument) and a range adapter <code class="computeroutput"><span class="identifier">RA</span></code>
-          (always right argument) yields a new range type which may not conform to
-          the same range concept as <code class="computeroutput"><span class="identifier">R</span></code>.
-        </p>
-<p>
-          2. The return-type of <code class="computeroutput"><span class="keyword">operator</span><span class="special">|()</span></code> is otherwise unspecified.
-        </p>
-<p>
-          3. <code class="computeroutput"><span class="keyword">operator</span><span class="special">|()</span></code>
-          is found by Argument Dependent Lookup (ADL) because a range adaptor is
-          implemented in namespace <code class="computeroutput"><span class="identifier">boost</span><span class="special">::</span><span class="identifier">adaptors</span></code>.
-        </p>
-<p>
-          4. <code class="computeroutput"><span class="keyword">operator</span><span class="special">|()</span></code>
-          is used to add new behaviour <span class="emphasis"><em><span class="bold"><strong>lazily</strong></span></em></span>
-          and never modifies its left argument.
-        </p>
-<p>
-          5. All iterators extracted from the left argument are extracted using qualified
-          calls to <code class="computeroutput"><span class="identifier">boost</span><span class="special">::</span><span class="identifier">begin</span><span class="special">()</span></code>
-          and <code class="computeroutput"><span class="identifier">boost</span><span class="special">::</span><span class="identifier">end</span><span class="special">()</span></code>.
-        </p>
-<p>
-          6. In addition to the <code class="computeroutput"><span class="keyword">throw</span></code>-clauses
-          below, <code class="computeroutput"><span class="keyword">operator</span><span class="special">|()</span></code>
-          may throw exceptions as a result of copying iterators. If such copying
-          cannot throw an exception, then neither can the whole expression.
-        </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>
-        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="adaptors_synopsis.html"><img src="../../../../../../../doc/html/images/prev.png" alt="Prev"></a><a accesskey="u" href="../adaptors.html"><img src="../../../../../../../doc/html/images/up.png" alt="Up"></a><a accesskey="h" href="../../../index.html"><img src="../../../../../../../doc/html/images/home.png" alt="Home"></a><a accesskey="n" href="adaptors_reference.html"><img src="../../../../../../../doc/html/images/next.png" alt="Next"></a>
-</div>
-</body>
-</html>
diff --git a/doc/html/range/reference/adaptors/adaptors_introduction.html b/doc/html/range/reference/adaptors/adaptors_introduction.html
deleted file mode 100644
index 80d2e25..0000000
--- a/doc/html/range/reference/adaptors/adaptors_introduction.html
+++ /dev/null
@@ -1,274 +0,0 @@
-<html>
-<head>
-<meta http-equiv="Content-Type" content="text/html; charset=US-ASCII">
-<title>Introduction and motivation</title>
-<link rel="stylesheet" href="../../../../../../../doc/html/boostbook.css" type="text/css">
-<meta name="generator" content="DocBook XSL Stylesheets V1.75.1">
-<link rel="home" href="../../../index.html" title="Chapter&#160;1.&#160;Range 2.0">
-<link rel="up" href="../adaptors.html" title="Range Adaptors">
-<link rel="prev" href="../adaptors.html" title="Range Adaptors">
-<link rel="next" href="adaptors_synopsis.html" title="Synopsis">
-</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="../../../../../../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="../adaptors.html"><img src="../../../../../../../doc/html/images/prev.png" alt="Prev"></a><a accesskey="u" href="../adaptors.html"><img src="../../../../../../../doc/html/images/up.png" alt="Up"></a><a accesskey="h" href="../../../index.html"><img src="../../../../../../../doc/html/images/home.png" alt="Home"></a><a accesskey="n" href="adaptors_synopsis.html"><img src="../../../../../../../doc/html/images/next.png" alt="Next"></a>
-</div>
-<div class="section" title="Introduction and motivation">
-<div class="titlepage"><div><div><h4 class="title">
-<a name="range.reference.adaptors.adaptors_introduction"></a><a class="link" href="adaptors_introduction.html" title="Introduction and motivation"> Introduction
-        and motivation</a>
-</h4></div></div></div>
-<p>
-          A <span class="bold"><strong>Range Adaptor</strong></span> is a class that wraps
-          an existing Range to provide a new Range with different behaviour. Since
-          the behaviour of Ranges is determined by their associated iterators, a
-          Range Adaptor simply wraps the underlying iterators with new special iterators.
-          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>
-<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="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><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="special">);</span>
-</pre>
-<p>
-        </p>
-<p>
-          the iterators from <code class="computeroutput"><span class="identifier">vec</span></code>
-          are wrapped <code class="computeroutput"><span class="identifier">reverse_iterator</span></code>s.
-          The type of the underlying Range Adapter is not documented because you
-          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>
-<p>
-        </p>
-<p>
-          returns a Range Adaptor where the iterator type is now the iterator type
-          of the range <code class="computeroutput"><span class="identifier">vec</span></code> wrapped
-          in <code class="computeroutput"><span class="identifier">reverse_iterator</span></code>. The
-          expression <code class="computeroutput"><span class="identifier">boost</span><span class="special">::</span><span class="identifier">adaptors</span><span class="special">::</span><span class="identifier">reversed</span></code> is called an <span class="bold"><strong>Adaptor
-          Generator</strong></span>.
-        </p>
-<p>
-          There are two ways of constructing a range adaptor. The first is by using
-          <code class="computeroutput"><span class="keyword">operator</span><span class="special">|()</span></code>.
-          This is my preferred technique, however while discussing range adaptors
-          with others it became clear that some users of the library strongly prefer
-          a more familiar function syntax, so equivalent functions of the present
-          tense form have been added as an alternative syntax. The equivalent to
-          <code class="computeroutput"><span class="identifier">rng</span> <span class="special">|</span>
-          <span class="identifier">reversed</span></code> is <code class="computeroutput"><span class="identifier">adaptors</span><span class="special">::</span><span class="identifier">reverse</span><span class="special">(</span><span class="identifier">rng</span><span class="special">)</span></code> for example.
-        </p>
-<p>
-          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>
-             <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="special">);</span>
-</pre>
-<p>
-        </p>
-<p>
-          This might not look so bad, but when we apply several adaptors, it becomes
-          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>
-             <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="special">);</span>
-</pre>
-<p>
-        </p>
-<p>
-          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>
-                 <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">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="special">);</span>
-</pre>
-<p>
-        </p>
-<p>
-          Furthermore, some of the adaptor generators take arguments themselves and
-          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.adaptors_introduction.composition_of_adaptors"></a><h6>
-<a name="id3057363"></a>
-          <a class="link" href="adaptors_introduction.html#range.reference.adaptors.adaptors_introduction.composition_of_adaptors">Composition
-          of Adaptors</a>
-        </h6>
-<p>
-          Range Adaptors are a powerful complement to Range algorithms. The reason
-          is that adaptors are <span class="emphasis"><em><span class="bold"><strong>orthogonal</strong></span></em></span>
-          to algorithms. For example, consider these Range algorithms:
-        </p>
-<div class="itemizedlist"><ul class="itemizedlist" type="disc">
-<li class="listitem"><code class="computeroutput"><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">out</span> <span class="special">)</span></code></li>
-<li class="listitem"><code class="computeroutput"><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">pred</span> <span class="special">)</span></code></li>
-</ul></div>
-<p>
-          What should we do if we only want to copy an element <code class="computeroutput"><span class="identifier">a</span></code>
-          if it satisfies some predicate, say <code class="computeroutput"><span class="identifier">pred</span><span class="special">(</span><span class="identifier">a</span><span class="special">)</span></code>?
-          And what if we only want to count the elements that satisfy the same predicate?
-          The naive answer would be to use these algorithms:
-        </p>
-<div class="itemizedlist"><ul class="itemizedlist" type="disc">
-<li class="listitem"><code class="computeroutput"><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></code></li>
-<li class="listitem"><code class="computeroutput"><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></code></li>
-</ul></div>
-<p>
-          These algorithms are only defined to maintain a one to one relationship
-          with the standard library algorithms. This approach of adding algorithm
-          suffers a combinatorial explosion. Inevitably many algorithms are missing
-          <code class="computeroutput"><span class="identifier">_if</span></code> variants and there
-          is redundant development overhead for each new algorithm. The Adaptor Generator
-          is the design solution to this problem.
-        </p>
-<a name="range.reference.adaptors.adaptors_introduction.range_adaptor_alternative_to_copy_if_algorithm"></a><h6>
-<a name="id3057673"></a>
-          <a class="link" href="adaptors_introduction.html#range.reference.adaptors.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 
-</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.adaptors_introduction.range_adaptor_alternative_to_count_if_algorithm"></a><h6>
-<a name="id3057842"></a>
-          <a class="link" href="adaptors_introduction.html#range.reference.adaptors.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 
-</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>
-<p>
-        </p>
-<p>
-          What this means is that <span class="emphasis"><em><span class="bold"><strong>no</strong></span></em></span>
-          algorithm with the <code class="computeroutput"><span class="identifier">_if</span></code>
-          suffix is needed. Furthermore, it turns out that algorithms with the <code class="computeroutput"><span class="identifier">_copy</span></code> suffix are not needed either. Consider
-          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>
-</pre>
-<p>
-        </p>
-<p>
-          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>
-</pre>
-<p>
-        </p>
-<p>
-          The latter code has several benefits:
-        </p>
-<p>
-          1. it is more <span class="emphasis"><em><span class="bold"><strong>efficient</strong></span></em></span>
-          because we avoid extra allocations as might happen with <code class="computeroutput"><span class="identifier">std</span><span class="special">::</span><span class="identifier">back_inserter</span></code>
-        </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: 
-</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>
-</pre>
-<p>
-        </p>
-<p>
-          3. it is <span class="emphasis"><em><span class="bold"><strong>safer</strong></span></em></span> because
-          there is no use of an unbounded output iterator.
-        </p>
-<p>
-          In this manner, the <span class="emphasis"><em><span class="bold"><strong>composition</strong></span></em></span>
-          of Range Adaptors has the following consequences:
-        </p>
-<p>
-          1. we no longer need <code class="computeroutput"><span class="identifier">_if</span></code>,
-          <code class="computeroutput"><span class="identifier">_copy</span></code>, <code class="computeroutput"><span class="identifier">_copy_if</span></code>
-          and <code class="computeroutput"><span class="identifier">_n</span></code> variants of algorithms.
-        </p>
-<p>
-          2. we can generate a multitude of new algorithms on the fly, for example,
-          above we generated <code class="computeroutput"><span class="identifier">reverse_replace_copy_if</span><span class="special">()</span></code>
-        </p>
-<p>
-          In other words:
-        </p>
-<p>
-          <span class="bold"><strong>Range Adaptors are to algorithms what algorithms
-          are to containers</strong></span>
-        </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>
-        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="../adaptors.html"><img src="../../../../../../../doc/html/images/prev.png" alt="Prev"></a><a accesskey="u" href="../adaptors.html"><img src="../../../../../../../doc/html/images/up.png" alt="Up"></a><a accesskey="h" href="../../../index.html"><img src="../../../../../../../doc/html/images/home.png" alt="Home"></a><a accesskey="n" href="adaptors_synopsis.html"><img src="../../../../../../../doc/html/images/next.png" alt="Next"></a>
-</div>
-</body>
-</html>
diff --git a/doc/html/range/reference/adaptors/adaptors_synopsis.html b/doc/html/range/reference/adaptors/adaptors_synopsis.html
deleted file mode 100644
index c18bb4f..0000000
--- a/doc/html/range/reference/adaptors/adaptors_synopsis.html
+++ /dev/null
@@ -1,67 +0,0 @@
-<html>
-<head>
-<meta http-equiv="Content-Type" content="text/html; charset=US-ASCII">
-<title>Synopsis</title>
-<link rel="stylesheet" href="../../../../../../../doc/html/boostbook.css" type="text/css">
-<meta name="generator" content="DocBook XSL Stylesheets V1.75.1">
-<link rel="home" href="../../../index.html" title="Chapter&#160;1.&#160;Range 2.0">
-<link rel="up" href="../adaptors.html" title="Range Adaptors">
-<link rel="prev" href="introduction.html" title="Introduction and motivation">
-<link rel="next" href="general_requirements.html" title="General Requirements">
-</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="../../../../../../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="introduction.html"><img src="../../../../../../../doc/html/images/prev.png" alt="Prev"></a><a accesskey="u" href="../adaptors.html"><img src="../../../../../../../doc/html/images/up.png" alt="Up"></a><a accesskey="h" href="../../../index.html"><img src="../../../../../../../doc/html/images/home.png" alt="Home"></a><a accesskey="n" href="general_requirements.html"><img src="../../../../../../../doc/html/images/next.png" alt="Next"></a>
-</div>
-<div class="section" title="Synopsis">
-<div class="titlepage"><div><div><h4 class="title">
-<a name="range.reference.adaptors.adaptors_synopsis"></a><a class="link" href="adaptors_synopsis.html" title="Synopsis"> Synopsis</a>
-</h4></div></div></div>
-<p>
-          The library provides the following Adapter Generator expressions:
-        </p>
-<p>
-          
-</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">adjacent_filtered</span><span class="special">(</span><span class="identifier">bi_pred</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">copied</span><span class="special">(</span><span class="identifier">n</span><span class="special">,</span><span class="identifier">m</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">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>
-<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">indirected</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">map_keys</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">map_values</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</span><span class="special">(</span><span class="identifier">new_value</span><span class="special">,</span> <span class="identifier">old_value</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="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">reversed</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">sliced</span><span class="special">(</span><span class="identifier">n</span><span class="special">,</span> <span class="identifier">m</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">strided</span><span class="special">(</span><span class="identifier">n</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="special">&lt;</span><span class="identifier">see</span> <span class="identifier">arguments</span> <span class="identifier">below</span><span class="special">&gt;</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">transformed</span><span class="special">(</span><span class="identifier">fun</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">uniqued</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>
-        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="introduction.html"><img src="../../../../../../../doc/html/images/prev.png" alt="Prev"></a><a accesskey="u" href="../adaptors.html"><img src="../../../../../../../doc/html/images/up.png" alt="Up"></a><a accesskey="h" href="../../../index.html"><img src="../../../../../../../doc/html/images/home.png" alt="Home"></a><a accesskey="n" href="general_requirements.html"><img src="../../../../../../../doc/html/images/next.png" alt="Next"></a>
-</div>
-</body>
-</html>
diff --git a/doc/html/range/reference/algorithms/non.html b/doc/html/range/reference/algorithms/non.html
deleted file mode 100644
index f1f9123..0000000
--- a/doc/html/range/reference/algorithms/non.html
+++ /dev/null
@@ -1,64 +0,0 @@
-<html>
-<head>
-<meta http-equiv="Content-Type" content="text/html; charset=US-ASCII">
-<title>-mutating Non-mutating algorithms</title>
-<link rel="stylesheet" href="../../../../../../../doc/html/boostbook.css" type="text/css">
-<meta name="generator" content="DocBook XSL Stylesheets V1.75.1">
-<link rel="home" href="../../../index.html" title="Chapter&#160;1.&#160;Range 2.0">
-<link rel="up" href="../algorithms.html" title="Range Algorithm">
-<link rel="prev" href="mutating/unique.html" title="unique">
-<link rel="next" href="non/adjacent_find.html" title="adjacent_find">
-</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="../../../../../../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="mutating/unique.html"><img src="../../../../../../../doc/html/images/prev.png" alt="Prev"></a><a accesskey="u" href="../algorithms.html"><img src="../../../../../../../doc/html/images/up.png" alt="Up"></a><a accesskey="h" href="../../../index.html"><img src="../../../../../../../doc/html/images/home.png" alt="Home"></a><a accesskey="n" href="non/adjacent_find.html"><img src="../../../../../../../doc/html/images/next.png" alt="Next"></a>
-</div>
-<div class="section" title="-mutating Non-mutating algorithms">
-<div class="titlepage"><div><div><h4 class="title">
-<a name="range.reference.algorithms.non"></a><a class="link" href="non.html" title="-mutating Non-mutating algorithms">-mutating Non-mutating
-        algorithms</a>
-</h4></div></div></div>
-<div class="toc"><dl>
-<dt><span class="section"><a href="non/adjacent_find.html"> adjacent_find</a></span></dt>
-<dt><span class="section"><a href="non/binary_search.html"> binary_search</a></span></dt>
-<dt><span class="section"><a href="non/count.html"> count</a></span></dt>
-<dt><span class="section"><a href="non/equal.html"> equal</a></span></dt>
-<dt><span class="section"><a href="non/equal_range.html"> equal_range</a></span></dt>
-<dt><span class="section"><a href="non/for_each.html"> for_each</a></span></dt>
-<dt><span class="section"><a href="non/find.html"> find</a></span></dt>
-<dt><span class="section"><a href="non/find_end.html"> find_end</a></span></dt>
-<dt><span class="section"><a href="non/find_first_of.html"> find_first_of</a></span></dt>
-<dt><span class="section"><a href="non/find_if.html"> find_if</a></span></dt>
-<dt><span class="section"><a href="non/lexicographical_compare.html">
-          lexicographical_compare</a></span></dt>
-<dt><span class="section"><a href="non/lower_bound.html"> lower_bound</a></span></dt>
-<dt><span class="section"><a href="non/max_element.html"> max_element</a></span></dt>
-<dt><span class="section"><a href="non/min_element.html"> min_element</a></span></dt>
-<dt><span class="section"><a href="non/mismatch.html"> mismatch</a></span></dt>
-<dt><span class="section"><a href="non/search.html"> search</a></span></dt>
-<dt><span class="section"><a href="non/upper_bound.html"> upper_bound</a></span></dt>
-</dl></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="mutating/unique.html"><img src="../../../../../../../doc/html/images/prev.png" alt="Prev"></a><a accesskey="u" href="../algorithms.html"><img src="../../../../../../../doc/html/images/up.png" alt="Up"></a><a accesskey="h" href="../../../index.html"><img src="../../../../../../../doc/html/images/home.png" alt="Home"></a><a accesskey="n" href="non/adjacent_find.html"><img src="../../../../../../../doc/html/images/next.png" alt="Next"></a>
-</div>
-</body>
-</html>
diff --git a/doc/html/range/reference/concept_implementation/overview.html b/doc/html/range/reference/concept_implementation/overview.html
deleted file mode 100644
index d0c35e1..0000000
--- a/doc/html/range/reference/concept_implementation/overview.html
+++ /dev/null
@@ -1,68 +0,0 @@
-<html>
-<head>
-<meta http-equiv="Content-Type" content="text/html; charset=US-ASCII">
-<title>Overview</title>
-<link rel="stylesheet" href="../../../../../../../doc/html/boostbook.css" type="text/css">
-<meta name="generator" content="DocBook XSL Stylesheets V1.75.1">
-<link rel="home" href="../../../index.html" title="Chapter&#160;1.&#160;Range 2.0">
-<link rel="up" href="../concept_implementation.html" title="Range concept implementation">
-<link rel="prev" href="../concept_implementation.html" title="Range concept implementation">
-<link rel="next" href="synopsis.html" title="Synopsis">
-</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="../../../../../../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="../concept_implementation.html"><img src="../../../../../../../doc/html/images/prev.png" alt="Prev"></a><a accesskey="u" href="../concept_implementation.html"><img src="../../../../../../../doc/html/images/up.png" alt="Up"></a><a accesskey="h" href="../../../index.html"><img src="../../../../../../../doc/html/images/home.png" alt="Home"></a><a accesskey="n" href="synopsis.html"><img src="../../../../../../../doc/html/images/next.png" alt="Next"></a>
-</div>
-<div class="section" title="Overview">
-<div class="titlepage"><div><div><h4 class="title">
-<a name="range.reference.concept_implementation.overview"></a><a class="link" href="overview.html" title="Overview">Overview</a>
-</h4></div></div></div>
-<p>
-          Three types of objects are currently supported by the library:
-        </p>
-<div class="itemizedlist"><ul class="itemizedlist" type="disc">
-<li class="listitem">
-            standard-like containers
-          </li>
-<li class="listitem"><code class="computeroutput"><span class="identifier">std</span><span class="special">::</span><span class="identifier">pair</span><span class="special">&lt;</span><span class="identifier">iterator</span><span class="special">,</span><span class="identifier">iterator</span><span class="special">&gt;</span></code></li>
-<li class="listitem">
-            built-in arrays
-          </li>
-</ul></div>
-<p>
-          Even though the behavior of the primary templates are exactly such that
-          standard containers will be supported by default, the requirements are
-          much lower than the standard container requirements. For example, the utility
-          class <a class="link" href="../utilities/iterator_range.html" title="Class iterator_range"><code class="computeroutput"><span class="identifier">iterator_range</span></code></a> implements the
-          <a class="link" href="../extending.html" title="Extending the library">minimal interface</a> required
-          to make the class a <a class="link" href="../../concepts/forward_range.html" title="Forward Range">Forward
-          Range</a>.
-        </p>
-<p>
-          Please also see <a class="link" href="../../concepts.html" title="Range Concepts">Range concepts</a> for
-          more details.
-        </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>
-        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="../concept_implementation.html"><img src="../../../../../../../doc/html/images/prev.png" alt="Prev"></a><a accesskey="u" href="../concept_implementation.html"><img src="../../../../../../../doc/html/images/up.png" alt="Up"></a><a accesskey="h" href="../../../index.html"><img src="../../../../../../../doc/html/images/home.png" alt="Home"></a><a accesskey="n" href="synopsis.html"><img src="../../../../../../../doc/html/images/next.png" alt="Next"></a>
-</div>
-</body>
-</html>
diff --git a/doc/html/range/reference/range_algorithm.html b/doc/html/range/reference/range_algorithm.html
deleted file mode 100644
index 1e197c9..0000000
--- a/doc/html/range/reference/range_algorithm.html
+++ /dev/null
@@ -1,52 +0,0 @@
-<html>
-<head>
-<meta http-equiv="Content-Type" content="text/html; charset=US-ASCII">
-<title>Range Algorithm</title>
-<link rel="stylesheet" href="../../../../../../doc/html/boostbook.css" type="text/css">
-<meta name="generator" content="DocBook XSL Stylesheets V1.75.1">
-<link rel="home" href="../../index.html" title="Chapter&#160;1.&#160;Range 2.0">
-<link rel="up" href="../reference.html" title="Reference">
-<link rel="prev" href="adaptors/adaptors_reference/uniqued.html" title="uniqued">
-<link rel="next" href="range_algorithm/range_algorithm_introduction.html" title="Introduction and motivation">
-</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="../../../../../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="adaptors/adaptors_reference/uniqued.html"><img src="../../../../../../doc/html/images/prev.png" alt="Prev"></a><a accesskey="u" href="../reference.html"><img src="../../../../../../doc/html/images/up.png" alt="Up"></a><a accesskey="h" href="../../index.html"><img src="../../../../../../doc/html/images/home.png" alt="Home"></a><a accesskey="n" href="range_algorithm/range_algorithm_introduction.html"><img src="../../../../../../doc/html/images/next.png" alt="Next"></a>
-</div>
-<div class="section" title="Range Algorithm">
-<div class="titlepage"><div><div><h3 class="title">
-<a name="range.reference.range_algorithm"></a><a class="link" href="range_algorithm.html" title="Range Algorithm"> Range Algorithm</a>
-</h3></div></div></div>
-<div class="toc"><dl>
-<dt><span class="section"><a href="range_algorithm/range_algorithm_introduction.html">
-        Introduction and motivation</a></span></dt>
-<dt><span class="section"><a href="range_algorithm/range_algorithm_mutating_algorithms.html">
-        Mutating algorithms</a></span></dt>
-<dt><span class="section"><a href="range_algorithm/range_algorithm_non_mutating_algorithms.html">
-        Non-mutating algorithms</a></span></dt>
-<dt><span class="section"><a href="range_algorithm/range_algorithm_new_algorithms.html"></a></span></dt>
-</dl></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="adaptors/adaptors_reference/uniqued.html"><img src="../../../../../../doc/html/images/prev.png" alt="Prev"></a><a accesskey="u" href="../reference.html"><img src="../../../../../../doc/html/images/up.png" alt="Up"></a><a accesskey="h" href="../../index.html"><img src="../../../../../../doc/html/images/home.png" alt="Home"></a><a accesskey="n" href="range_algorithm/range_algorithm_introduction.html"><img src="../../../../../../doc/html/images/next.png" alt="Next"></a>
-</div>
-</body>
-</html>
diff --git a/doc/html/range/reference/ranges/introduction.html b/doc/html/range/reference/ranges/introduction.html
deleted file mode 100644
index f0080c6..0000000
--- a/doc/html/range/reference/ranges/introduction.html
+++ /dev/null
@@ -1,46 +0,0 @@
-<html>
-<head>
-<meta http-equiv="Content-Type" content="text/html; charset=US-ASCII">
-<title>Introduction</title>
-<link rel="stylesheet" href="../../../../../../../doc/html/boostbook.css" type="text/css">
-<meta name="generator" content="DocBook XSL Stylesheets V1.75.1">
-<link rel="home" href="../../../index.html" title="Chapter&#160;1.&#160;Range 2.0">
-<link rel="up" href="../ranges.html" title="Provided Ranges">
-<link rel="prev" href="../ranges.html" title="Provided Ranges">
-<link rel="next" href="reference.html" title="Reference">
-</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="../../../../../../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="../ranges.html"><img src="../../../../../../../doc/html/images/prev.png" alt="Prev"></a><a accesskey="u" href="../ranges.html"><img src="../../../../../../../doc/html/images/up.png" alt="Up"></a><a accesskey="h" href="../../../index.html"><img src="../../../../../../../doc/html/images/home.png" alt="Home"></a><a accesskey="n" href="reference.html"><img src="../../../../../../../doc/html/images/next.png" alt="Next"></a>
-</div>
-<div class="section" title="Introduction">
-<div class="titlepage"><div><div><h4 class="title">
-<a name="range.reference.ranges.introduction"></a><a class="link" href="introduction.html" title="Introduction"> Introduction</a>
-</h4></div></div></div>
-<p>
-          The Boost.Range library provides some of the more commonly required ranges.
-        </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>
-        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="../ranges.html"><img src="../../../../../../../doc/html/images/prev.png" alt="Prev"></a><a accesskey="u" href="../ranges.html"><img src="../../../../../../../doc/html/images/up.png" alt="Up"></a><a accesskey="h" href="../../../index.html"><img src="../../../../../../../doc/html/images/home.png" alt="Home"></a><a accesskey="n" href="reference.html"><img src="../../../../../../../doc/html/images/next.png" alt="Next"></a>
-</div>
-</body>
-</html>
diff --git a/doc/html/range/reference/ranges/reference.html b/doc/html/range/reference/ranges/reference.html
deleted file mode 100644
index edaf8fa..0000000
--- a/doc/html/range/reference/ranges/reference.html
+++ /dev/null
@@ -1,50 +0,0 @@
-<html>
-<head>
-<meta http-equiv="Content-Type" content="text/html; charset=US-ASCII">
-<title>Reference</title>
-<link rel="stylesheet" href="../../../../../../../doc/html/boostbook.css" type="text/css">
-<meta name="generator" content="DocBook XSL Stylesheets V1.75.1">
-<link rel="home" href="../../../index.html" title="Chapter&#160;1.&#160;Range 2.0">
-<link rel="up" href="../ranges.html" title="Provided Ranges">
-<link rel="prev" href="introduction.html" title="Introduction">
-<link rel="next" href="reference/counting_range.html" title="counting_range">
-</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="../../../../../../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="introduction.html"><img src="../../../../../../../doc/html/images/prev.png" alt="Prev"></a><a accesskey="u" href="../ranges.html"><img src="../../../../../../../doc/html/images/up.png" alt="Up"></a><a accesskey="h" href="../../../index.html"><img src="../../../../../../../doc/html/images/home.png" alt="Home"></a><a accesskey="n" href="reference/counting_range.html"><img src="../../../../../../../doc/html/images/next.png" alt="Next"></a>
-</div>
-<div class="section" title="Reference">
-<div class="titlepage"><div><div><h4 class="title">
-<a name="range.reference.ranges.reference"></a><a class="link" href="reference.html" title="Reference"> Reference</a>
-</h4></div></div></div>
-<div class="toc"><dl>
-<dt><span class="section"><a href="reference/counting_range.html">
-          counting_range</a></span></dt>
-<dt><span class="section"><a href="reference/istream_range.html">
-          istream_range</a></span></dt>
-<dt><span class="section"><a href="reference/irange.html"> irange</a></span></dt>
-</dl></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="introduction.html"><img src="../../../../../../../doc/html/images/prev.png" alt="Prev"></a><a accesskey="u" href="../ranges.html"><img src="../../../../../../../doc/html/images/up.png" alt="Up"></a><a accesskey="h" href="../../../index.html"><img src="../../../../../../../doc/html/images/home.png" alt="Home"></a><a accesskey="n" href="reference/counting_range.html"><img src="../../../../../../../doc/html/images/next.png" alt="Next"></a>
-</div>
-</body>
-</html>
diff --git a/doc/html/range/reference/ranges/reference/counting_range.html b/doc/html/range/reference/ranges/reference/counting_range.html
deleted file mode 100644
index 68fa72c..0000000
--- a/doc/html/range/reference/ranges/reference/counting_range.html
+++ /dev/null
@@ -1,91 +0,0 @@
-<html>
-<head>
-<meta http-equiv="Content-Type" content="text/html; charset=US-ASCII">
-<title>counting_range</title>
-<link rel="stylesheet" href="../../../../../../../../doc/html/boostbook.css" type="text/css">
-<meta name="generator" content="DocBook XSL Stylesheets V1.75.1">
-<link rel="home" href="../../../../index.html" title="Chapter&#160;1.&#160;Range 2.0">
-<link rel="up" href="../reference.html" title="Reference">
-<link rel="prev" href="../reference.html" title="Reference">
-<link rel="next" href="istream_range.html" title="istream_range">
-</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="../../../../../../../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="../reference.html"><img src="../../../../../../../../doc/html/images/prev.png" alt="Prev"></a><a accesskey="u" href="../reference.html"><img src="../../../../../../../../doc/html/images/up.png" alt="Up"></a><a accesskey="h" href="../../../../index.html"><img src="../../../../../../../../doc/html/images/home.png" alt="Home"></a><a accesskey="n" href="istream_range.html"><img src="../../../../../../../../doc/html/images/next.png" alt="Next"></a>
-</div>
-<div class="section" title="counting_range">
-<div class="titlepage"><div><div><h5 class="title">
-<a name="range.reference.ranges.reference.counting_range"></a><a class="link" href="counting_range.html" title="counting_range">
-          counting_range</a>
-</h5></div></div></div>
-<a name="range.reference.ranges.reference.counting_range.prototype"></a><h6>
-<a name="id3262203"></a>
-            <a class="link" href="counting_range.html#range.reference.ranges.reference.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>
-<span class="identifier">counting_range</span><span class="special">(</span><span class="identifier">Incrementable</span> <span class="identifier">first</span><span class="special">,</span> <span class="identifier">Incrementable</span> <span class="identifier">last</span><span class="special">);</span>
-
-<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">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="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> <span class="special">&gt;</span>
-<span class="identifier">counting_range</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="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">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="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> <span class="special">&gt;</span>
-<span class="identifier">counting_range</span><span class="special">(</span><span class="identifier">SinglePassRange</span><span class="special">&amp;</span> <span class="identifier">rng</span><span class="special">);</span>
-</pre>
-<p>
-          </p>
-<a name="range.reference.ranges.reference.counting_range.description"></a><h6>
-<a name="id3262589"></a>
-            <a class="link" href="counting_range.html#range.reference.ranges.reference.counting_range.description">Description</a>
-          </h6>
-<p>
-            <code class="computeroutput"><span class="identifier">counting_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">counting_iterator</span></code>
-            (from Boost.Iterator).
-          </p>
-<a name="range.reference.ranges.reference.counting_range.definition"></a><h6>
-<a name="id3262649"></a>
-            <a class="link" href="counting_range.html#range.reference.ranges.reference.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.reference.counting_range.requirements"></a><h6>
-<a name="id3262714"></a>
-            <a class="link" href="counting_range.html#range.reference.ranges.reference.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
-              model of the <code class="computeroutput"><span class="identifier">Incrementable</span></code>
-              Concept.
-            </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="../reference.html"><img src="../../../../../../../../doc/html/images/prev.png" alt="Prev"></a><a accesskey="u" href="../reference.html"><img src="../../../../../../../../doc/html/images/up.png" alt="Up"></a><a accesskey="h" href="../../../../index.html"><img src="../../../../../../../../doc/html/images/home.png" alt="Home"></a><a accesskey="n" href="istream_range.html"><img src="../../../../../../../../doc/html/images/next.png" alt="Next"></a>
-</div>
-</body>
-</html>
diff --git a/doc/html/range/reference/ranges/reference/irange.html b/doc/html/range/reference/ranges/reference/irange.html
deleted file mode 100644
index d827097..0000000
--- a/doc/html/range/reference/ranges/reference/irange.html
+++ /dev/null
@@ -1,104 +0,0 @@
-<html>
-<head>
-<meta http-equiv="Content-Type" content="text/html; charset=US-ASCII">
-<title>irange</title>
-<link rel="stylesheet" href="../../../../../../../../doc/html/boostbook.css" type="text/css">
-<meta name="generator" content="DocBook XSL Stylesheets V1.75.1">
-<link rel="home" href="../../../../index.html" title="Chapter&#160;1.&#160;Range 2.0">
-<link rel="up" href="../reference.html" title="Reference">
-<link rel="prev" href="istream_range.html" title="istream_range">
-<link rel="next" href="../../extending.html" title="Extending the library">
-</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="../../../../../../../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="istream_range.html"><img src="../../../../../../../../doc/html/images/prev.png" alt="Prev"></a><a accesskey="u" href="../reference.html"><img src="../../../../../../../../doc/html/images/up.png" alt="Up"></a><a accesskey="h" href="../../../../index.html"><img src="../../../../../../../../doc/html/images/home.png" alt="Home"></a><a accesskey="n" href="../../extending.html"><img src="../../../../../../../../doc/html/images/next.png" alt="Next"></a>
-</div>
-<div class="section" title="irange">
-<div class="titlepage"><div><div><h5 class="title">
-<a name="range.reference.ranges.reference.irange"></a><a class="link" href="irange.html" title="irange"> irange</a>
-</h5></div></div></div>
-<a name="range.reference.ranges.reference.irange.prototype"></a><h6>
-<a name="id3263158"></a>
-            <a class="link" href="irange.html#range.reference.ranges.reference.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">integer_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>
-<span class="identifier">irange</span><span class="special">(</span><span class="identifier">Integer</span> <span class="identifier">first</span><span class="special">,</span> <span class="identifier">Integer</span>  <span class="identifier">last</span><span class="special">);</span>
-
-<span class="keyword">template</span><span class="special">&lt;</span><span class="keyword">class</span> <span class="identifier">Integer</span><span class="special">,</span> <span class="keyword">class</span> <span class="identifier">StepSize</span><span class="special">&gt;</span>
-<span class="identifier">integer_range</span><span class="special">&lt;</span> <span class="identifier">range_detail</span><span class="special">::</span><span class="identifier">integer_iterator_with_step</span><span class="special">&lt;</span><span class="identifier">Integer</span><span class="special">,</span> <span class="identifier">StepSize</span><span class="special">&gt;</span> <span class="special">&gt;</span>
-<span class="identifier">irange</span><span class="special">(</span><span class="identifier">Integer</span> <span class="identifier">first</span><span class="special">,</span> <span class="identifier">Integer</span> <span class="identifier">last</span><span class="special">,</span> <span class="identifier">StepSize</span> <span class="identifier">step_size</span><span class="special">);</span>
-</pre>
-<p>
-          </p>
-<a name="range.reference.ranges.reference.irange.description"></a><h6>
-<a name="id3263454"></a>
-            <a class="link" href="irange.html#range.reference.ranges.reference.irange.description">Description</a>
-          </h6>
-<p>
-            <code class="computeroutput"><span class="identifier">irange</span></code> is a function
-            to generate an Integer Range.
-          </p>
-<p>
-            <code class="computeroutput"><span class="identifier">irange</span></code> allows treating
-            integers as a model of the <a class="link" href="../../../concepts/random_access_range.html" title="Random Access Range">Random
-            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.reference.irange.definition"></a><h6>
-<a name="id3263535"></a>
-            <a class="link" href="irange.html#range.reference.ranges.reference.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.reference.irange.requirements"></a><h6>
-<a name="id3263598"></a>
-            <a class="link" href="irange.html#range.reference.ranges.reference.irange.requirements">Requirements</a>
-          </h6>
-<div class="orderedlist"><ol class="orderedlist" type="1">
-<li class="listitem">
-<code class="computeroutput"><span class="identifier">Integer</span></code> is a model
-              of the <code class="computeroutput"><span class="identifier">Integer</span></code> Concept.
-            </li>
-<li class="listitem">
-<code class="computeroutput"><span class="identifier">StepSize</span></code> is a model
-              of the <code class="computeroutput"><span class="identifier">SignedInteger</span></code>
-              Concept.
-            </li>
-</ol></div>
-<a name="range.reference.ranges.reference.irange.complexity"></a><h6>
-<a name="id3263679"></a>
-            <a class="link" href="irange.html#range.reference.ranges.reference.irange.complexity">Complexity</a>
-          </h6>
-<p>
-            Constant. Since this function generates a new range the most significant
-            performance cost is incurred through the iteration of the generated range.
-          </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>
-        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="istream_range.html"><img src="../../../../../../../../doc/html/images/prev.png" alt="Prev"></a><a accesskey="u" href="../reference.html"><img src="../../../../../../../../doc/html/images/up.png" alt="Up"></a><a accesskey="h" href="../../../../index.html"><img src="../../../../../../../../doc/html/images/home.png" alt="Home"></a><a accesskey="n" href="../../extending.html"><img src="../../../../../../../../doc/html/images/next.png" alt="Next"></a>
-</div>
-</body>
-</html>
diff --git a/doc/html/range/reference/ranges/reference/istream_range.html b/doc/html/range/reference/ranges/reference/istream_range.html
deleted file mode 100644
index 7552ec7..0000000
--- a/doc/html/range/reference/ranges/reference/istream_range.html
+++ /dev/null
@@ -1,73 +0,0 @@
-<html>
-<head>
-<meta http-equiv="Content-Type" content="text/html; charset=US-ASCII">
-<title>istream_range</title>
-<link rel="stylesheet" href="../../../../../../../../doc/html/boostbook.css" type="text/css">
-<meta name="generator" content="DocBook XSL Stylesheets V1.75.1">
-<link rel="home" href="../../../../index.html" title="Chapter&#160;1.&#160;Range 2.0">
-<link rel="up" href="../reference.html" title="Reference">
-<link rel="prev" href="counting_range.html" title="counting_range">
-<link rel="next" href="irange.html" title="irange">
-</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="../../../../../../../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="counting_range.html"><img src="../../../../../../../../doc/html/images/prev.png" alt="Prev"></a><a accesskey="u" href="../reference.html"><img src="../../../../../../../../doc/html/images/up.png" alt="Up"></a><a accesskey="h" href="../../../../index.html"><img src="../../../../../../../../doc/html/images/home.png" alt="Home"></a><a accesskey="n" href="irange.html"><img src="../../../../../../../../doc/html/images/next.png" alt="Next"></a>
-</div>
-<div class="section" title="istream_range">
-<div class="titlepage"><div><div><h5 class="title">
-<a name="range.reference.ranges.reference.istream_range"></a><a class="link" href="istream_range.html" title="istream_range">
-          istream_range</a>
-</h5></div></div></div>
-<a name="range.reference.ranges.reference.istream_range.prototype"></a><h6>
-<a name="id3262788"></a>
-            <a class="link" href="istream_range.html#range.reference.ranges.reference.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>
-<span class="identifier">istream_range</span><span class="special">(</span><span class="identifier">std</span><span class="special">::</span><span class="identifier">basic_istream</span><span class="special">&lt;</span><span class="identifier">Elem</span><span class="special">,</span> <span class="identifier">Traits</span><span class="special">&gt;&amp;</span> <span class="identifier">in</span><span class="special">);</span>
-</pre>
-<p>
-          </p>
-<a name="range.reference.ranges.reference.istream_range.description"></a><h6>
-<a name="id3263008"></a>
-            <a class="link" href="istream_range.html#range.reference.ranges.reference.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.reference.istream_range.definition"></a><h6>
-<a name="id3263077"></a>
-            <a class="link" href="istream_range.html#range.reference.ranges.reference.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>
-          </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>
-        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="counting_range.html"><img src="../../../../../../../../doc/html/images/prev.png" alt="Prev"></a><a accesskey="u" href="../reference.html"><img src="../../../../../../../../doc/html/images/up.png" alt="Up"></a><a accesskey="h" href="../../../../index.html"><img src="../../../../../../../../doc/html/images/home.png" alt="Home"></a><a accesskey="n" href="irange.html"><img src="../../../../../../../../doc/html/images/next.png" alt="Next"></a>
-</div>
-</body>
-</html>
diff --git a/doc/html/range/reference/semantics/functions.html b/doc/html/range/reference/semantics/functions.html
deleted file mode 100644
index 232b680..0000000
--- a/doc/html/range/reference/semantics/functions.html
+++ /dev/null
@@ -1,408 +0,0 @@
-<html>
-<head>
-<meta http-equiv="Content-Type" content="text/html; charset=US-ASCII">
-<title>Functions</title>
-<link rel="stylesheet" href="../../../../../../../doc/html/boostbook.css" type="text/css">
-<meta name="generator" content="DocBook XSL Stylesheets V1.75.1">
-<link rel="home" href="../../../index.html" title="Chapter&#160;1.&#160;Range 2.0">
-<link rel="up" href="../semantics.html" title="Semantics">
-<link rel="prev" href="metafunctions.html" title="Metafunctions">
-<link rel="next" href="../adaptors.html" title="Range Adaptors">
-</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="../../../../../../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="metafunctions.html"><img src="../../../../../../../doc/html/images/prev.png" alt="Prev"></a><a accesskey="u" href="../semantics.html"><img src="../../../../../../../doc/html/images/up.png" alt="Up"></a><a accesskey="h" href="../../../index.html"><img src="../../../../../../../doc/html/images/home.png" alt="Home"></a><a accesskey="n" href="../adaptors.html"><img src="../../../../../../../doc/html/images/next.png" alt="Next"></a>
-</div>
-<div class="section" title="Functions">
-<div class="titlepage"><div><div><h4 class="title">
-<a name="range.reference.semantics.functions"></a><a class="link" href="functions.html" title="Functions">Functions</a>
-</h4></div></div></div>
-<div class="informaltable"><table class="table">
-<colgroup>
-<col>
-<col>
-<col>
-</colgroup>
-<thead><tr>
-<th>
-                  <p>
-                    Expression
-                  </p>
-                </th>
-<th>
-                  <p>
-                    Return type
-                  </p>
-                </th>
-<th>
-                  <p>
-                    Returns
-                  </p>
-                </th>
-<th>
-                  <p>
-                    Complexity
-                  </p>
-                </th>
-</tr></thead>
-<tbody>
-<tr>
-<td>
-                  <p>
-                    <code class="computeroutput"><span class="identifier">begin</span><span class="special">(</span><span class="identifier">x</span><span class="special">)</span></code>
-                  </p>
-                </td>
-<td>
-                  <p>
-                    <code class="computeroutput"><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>
-                  </p>
-                </td>
-<td>
-                  <p>
-                    <code class="computeroutput"><span class="identifier">p</span><span class="special">.</span><span class="identifier">first</span></code> if <code class="computeroutput"><span class="identifier">p</span></code>
-                    is of type <code class="computeroutput"><span class="identifier">std</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></code> <code class="computeroutput"><span class="identifier">a</span></code>
-                    if <code class="computeroutput"><span class="identifier">a</span></code> is an array
-                    <code class="computeroutput"><span class="identifier">range_begin</span><span class="special">(</span><span class="identifier">x</span><span class="special">)</span></code>
-                    if that expression would invoke a function found by ADL <code class="computeroutput"><span class="identifier">t</span><span class="special">.</span><span class="identifier">begin</span><span class="special">()</span></code>
-                    otherwise
-                  </p>
-                </td>
-<td>
-                  <p>
-                    constant time
-                  </p>
-                </td>
-</tr>
-<tr>
-<td>
-                  <p>
-                    <code class="computeroutput"><span class="identifier">end</span><span class="special">(</span><span class="identifier">x</span><span class="special">)</span></code>
-                  </p>
-                </td>
-<td>
-                  <p>
-                    <code class="computeroutput"><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>
-                  </p>
-                </td>
-<td>
-                  <p>
-                    <code class="computeroutput"><span class="identifier">p</span><span class="special">.</span><span class="identifier">second</span></code> if <code class="computeroutput"><span class="identifier">p</span></code>
-                    is of type <code class="computeroutput"><span class="identifier">std</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></code> <code class="computeroutput"><span class="identifier">a</span>
-                    <span class="special">+</span> <span class="identifier">sz</span></code>
-                    if <code class="computeroutput"><span class="identifier">a</span></code> is an array
-                    of size <code class="computeroutput"><span class="identifier">sz</span></code> <code class="computeroutput"><span class="identifier">range_end</span><span class="special">(</span><span class="identifier">x</span><span class="special">)</span></code>
-                    if that expression would invoke a function found by ADL <code class="computeroutput"><span class="identifier">t</span><span class="special">.</span><span class="identifier">end</span><span class="special">()</span></code>
-                    otherwise
-                  </p>
-                </td>
-<td>
-                  <p>
-                    constant time
-                  </p>
-                </td>
-</tr>
-<tr>
-<td>
-                  <p>
-                    <code class="computeroutput"><span class="identifier">empty</span><span class="special">(</span><span class="identifier">x</span><span class="special">)</span></code>
-                  </p>
-                </td>
-<td>
-                  <p>
-                    <code class="computeroutput"><span class="keyword">bool</span></code>
-                  </p>
-                </td>
-<td>
-                  <p>
-                    <code class="computeroutput"><span class="identifier">boost</span><span class="special">::</span><span class="identifier">begin</span><span class="special">(</span><span class="identifier">x</span><span class="special">)</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">x</span><span class="special">)</span></code>
-                  </p>
-                </td>
-<td>
-                  <p>
-                    constant time
-                  </p>
-                </td>
-</tr>
-<tr>
-<td>
-                  <p>
-                    <code class="computeroutput"><span class="identifier">distance</span><span class="special">(</span><span class="identifier">x</span><span class="special">)</span></code>
-                  </p>
-                </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>
-                  </p>
-                </td>
-<td>
-                  <p>
-                    <code class="computeroutput"><span class="identifier">std</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">x</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">x</span><span class="special">))</span></code>
-                  </p>
-                </td>
-<td>
-                  <p>
-                    -
-                  </p>
-                </td>
-</tr>
-<tr>
-<td>
-                  <p>
-                    <code class="computeroutput"><span class="identifier">size</span><span class="special">(</span><span class="identifier">x</span><span class="special">)</span></code>
-                  </p>
-                </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>
-                  </p>
-                </td>
-<td>
-                  <p>
-                    <code class="computeroutput"><span class="identifier">boost</span><span class="special">::</span><span class="identifier">end</span><span class="special">(</span><span class="identifier">x</span><span class="special">)</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">x</span><span class="special">)</span></code>
-                  </p>
-                </td>
-<td>
-                  <p>
-                    constant time
-                  </p>
-                </td>
-</tr>
-<tr>
-<td>
-                  <p>
-                    <code class="computeroutput"><span class="identifier">rbegin</span><span class="special">(</span><span class="identifier">x</span><span class="special">)</span></code>
-                  </p>
-                </td>
-<td>
-                  <p>
-                    <code class="computeroutput"><span class="identifier">range_reverse_iterator</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>
-                  <p>
-                    <code class="computeroutput"><span class="identifier">range_reverse_iterator</span><span class="special">&lt;</span><span class="identifier">X</span><span class="special">&gt;::</span><span class="identifier">type</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">x</span><span class="special">))</span></code>
-                  </p>
-                </td>
-<td>
-                  <p>
-                    constant time
-                  </p>
-                </td>
-</tr>
-<tr>
-<td>
-                  <p>
-                    <code class="computeroutput"><span class="identifier">rend</span><span class="special">(</span><span class="identifier">x</span><span class="special">)</span></code>
-                  </p>
-                </td>
-<td>
-                  <p>
-                    <code class="computeroutput"><span class="identifier">range_reverse_iterator</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>
-                  <p>
-                    <code class="computeroutput"><span class="identifier">range_reverse_iterator</span><span class="special">&lt;</span><span class="identifier">X</span><span class="special">&gt;::</span><span class="identifier">type</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">x</span><span class="special">))</span></code>
-                  </p>
-                </td>
-<td>
-                  <p>
-                    constant time
-                  </p>
-                </td>
-</tr>
-<tr>
-<td>
-                  <p>
-                    <code class="computeroutput"><span class="identifier">const_begin</span><span class="special">(</span><span class="identifier">x</span><span class="special">)</span></code>
-                  </p>
-                </td>
-<td>
-                  <p>
-                    <code class="computeroutput"><span class="identifier">range_iterator</span><span class="special">&lt;</span><span class="keyword">const</span>
-                    <span class="identifier">X</span><span class="special">&gt;::</span><span class="identifier">type</span></code>
-                  </p>
-                </td>
-<td>
-                  <p>
-                    <code class="computeroutput"><span class="identifier">range_iterator</span><span class="special">&lt;</span><span class="keyword">const</span>
-                    <span class="identifier">X</span><span class="special">&gt;::</span><span class="identifier">type</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">x</span><span class="special">))</span></code>
-                  </p>
-                </td>
-<td>
-                  <p>
-                    constant time
-                  </p>
-                </td>
-</tr>
-<tr>
-<td>
-                  <p>
-                    <code class="computeroutput"><span class="identifier">const_end</span><span class="special">(</span><span class="identifier">x</span><span class="special">)</span></code>
-                  </p>
-                </td>
-<td>
-                  <p>
-                    <code class="computeroutput"><span class="identifier">range_iterator</span><span class="special">&lt;</span><span class="keyword">const</span>
-                    <span class="identifier">X</span><span class="special">&gt;::</span><span class="identifier">type</span></code>
-                  </p>
-                </td>
-<td>
-                  <p>
-                    <code class="computeroutput"><span class="identifier">range_iterator</span><span class="special">&lt;</span><span class="keyword">const</span>
-                    <span class="identifier">X</span><span class="special">&gt;::</span><span class="identifier">type</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">x</span><span class="special">))</span></code>
-                  </p>
-                </td>
-<td>
-                  <p>
-                    constant time
-                  </p>
-                </td>
-</tr>
-<tr>
-<td>
-                  <p>
-                    <code class="computeroutput"><span class="identifier">const_rbegin</span><span class="special">(</span><span class="identifier">x</span><span class="special">)</span></code>
-                  </p>
-                </td>
-<td>
-                  <p>
-                    <code class="computeroutput"><span class="identifier">range_reverse_iterator</span><span class="special">&lt;</span><span class="keyword">const</span>
-                    <span class="identifier">X</span><span class="special">&gt;::</span><span class="identifier">type</span></code>
-                  </p>
-                </td>
-<td>
-                  <p>
-                    <code class="computeroutput"><span class="identifier">range_reverse_iterator</span><span class="special">&lt;</span><span class="keyword">const</span>
-                    <span class="identifier">X</span><span class="special">&gt;::</span><span class="identifier">type</span><span class="special">(</span><span class="identifier">boost</span><span class="special">::</span><span class="identifier">rbegin</span><span class="special">(</span><span class="identifier">x</span><span class="special">))</span></code>
-                  </p>
-                </td>
-<td>
-                  <p>
-                    constant time
-                  </p>
-                </td>
-</tr>
-<tr>
-<td>
-                  <p>
-                    <code class="computeroutput"><span class="identifier">const_rend</span><span class="special">(</span><span class="identifier">x</span><span class="special">)</span></code>
-                  </p>
-                </td>
-<td>
-                  <p>
-                    <code class="computeroutput"><span class="identifier">range_reverse_iterator</span><span class="special">&lt;</span><span class="keyword">const</span>
-                    <span class="identifier">X</span><span class="special">&gt;::</span><span class="identifier">type</span></code>
-                  </p>
-                </td>
-<td>
-                  <p>
-                    <code class="computeroutput"><span class="identifier">range_reverse_iterator</span><span class="special">&lt;</span><span class="keyword">const</span>
-                    <span class="identifier">X</span><span class="special">&gt;::</span><span class="identifier">type</span><span class="special">(</span><span class="identifier">boost</span><span class="special">::</span><span class="identifier">rend</span><span class="special">(</span><span class="identifier">x</span><span class="special">))</span></code>
-                  </p>
-                </td>
-<td>
-                  <p>
-                    constant time
-                  </p>
-                </td>
-</tr>
-<tr>
-<td>
-                  <p>
-                    <code class="computeroutput"><span class="identifier">as_literal</span><span class="special">(</span><span class="identifier">x</span><span class="special">)</span></code>
-                  </p>
-                </td>
-<td>
-                  <p>
-                    <code class="computeroutput"><span class="identifier">iterator_range</span><span class="special">&lt;</span><span class="identifier">U</span><span class="special">&gt;</span></code> where <code class="computeroutput"><span class="identifier">U</span></code>
-                    is <code class="computeroutput"><span class="identifier">Char</span><span class="special">*</span></code>
-                    if <code class="computeroutput"><span class="identifier">x</span></code> is a pointer
-                    to a string and <code class="computeroutput"><span class="identifier">U</span></code>
-                    is <code class="computeroutput"><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>
-                    otherwise
-                  </p>
-                </td>
-<td>
-                  <p>
-                    <code class="computeroutput"><span class="special">[</span><span class="identifier">s</span><span class="special">,</span><span class="identifier">s</span>
-                    <span class="special">+</span> <span class="identifier">std</span><span class="special">::</span><span class="identifier">char_traits</span><span class="special">&lt;</span><span class="identifier">X</span><span class="special">&gt;::</span><span class="identifier">length</span><span class="special">(</span><span class="identifier">s</span><span class="special">))</span></code> if <code class="computeroutput"><span class="identifier">s</span></code>
-                    is a <code class="computeroutput"><span class="identifier">Char</span><span class="special">*</span></code>
-                    or an array of <code class="computeroutput"><span class="identifier">Char</span></code>
-                    <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">x</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">x</span><span class="special">))</span></code> otherwise
-                  </p>
-                </td>
-<td>
-                  <p>
-                    linear time for pointers to a string or arrays of <code class="computeroutput"><span class="identifier">Char</span></code>, constant time otherwise
-                  </p>
-                </td>
-</tr>
-<tr>
-<td>
-                  <p>
-                    <code class="computeroutput"><span class="identifier">as_array</span><span class="special">(</span><span class="identifier">x</span><span class="special">)</span></code>
-                  </p>
-                </td>
-<td>
-                  <p>
-                    <code class="computeroutput"><span class="identifier">iterator_range</span><span class="special">&lt;</span><span class="identifier">X</span><span class="special">&gt;</span></code>
-                  </p>
-                </td>
-<td>
-                  <p>
-                    <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">x</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">x</span><span class="special">))</span></code>
-                  </p>
-                </td>
-<td class="auto-generated">&#160;</td>
-</tr>
-</tbody>
-</table></div>
-<p>
-          The special <code class="computeroutput"><span class="identifier">const_</span></code>-named
-          functions are useful when you want to document clearly that your code is
-          read-only.
-        </p>
-<p>
-          <code class="computeroutput"><span class="identifier">as_literal</span><span class="special">()</span></code>
-          can be used <span class="emphasis"><em><span class="bold"><strong>internally</strong></span></em></span>
-          in string algorithm libraries such that arrays of characters are handled
-          correctly.
-        </p>
-<p>
-          <code class="computeroutput"><span class="identifier">as_array</span><span class="special">()</span></code>
-          can be used with string algorithm libraries to make it clear that arrays
-          of characters are handled like an array and not like a string.
-        </p>
-<p>
-          Notice that the above functions should always be called with qualification
-          (<code class="computeroutput"><span class="identifier">boost</span><span class="special">::</span></code>)
-          to prevent <span class="emphasis"><em><span class="bold"><strong>unintended</strong></span></em></span>
-          Argument Dependent Lookup (ADL).
-        </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>
-        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="metafunctions.html"><img src="../../../../../../../doc/html/images/prev.png" alt="Prev"></a><a accesskey="u" href="../semantics.html"><img src="../../../../../../../doc/html/images/up.png" alt="Up"></a><a accesskey="h" href="../../../index.html"><img src="../../../../../../../doc/html/images/home.png" alt="Home"></a><a accesskey="n" href="../adaptors.html"><img src="../../../../../../../doc/html/images/next.png" alt="Next"></a>
-</div>
-</body>
-</html>
diff --git a/doc/html/range/reference/semantics/metafunctions.html b/doc/html/range/reference/semantics/metafunctions.html
deleted file mode 100644
index 6df4902..0000000
--- a/doc/html/range/reference/semantics/metafunctions.html
+++ /dev/null
@@ -1,236 +0,0 @@
-<html>
-<head>
-<meta http-equiv="Content-Type" content="text/html; charset=US-ASCII">
-<title>Metafunctions</title>
-<link rel="stylesheet" href="../../../../../../../doc/html/boostbook.css" type="text/css">
-<meta name="generator" content="DocBook XSL Stylesheets V1.75.1">
-<link rel="home" href="../../../index.html" title="Chapter&#160;1.&#160;Range 2.0">
-<link rel="up" href="../semantics.html" title="Semantics">
-<link rel="prev" href="../semantics.html" title="Semantics">
-<link rel="next" href="functions.html" title="Functions">
-</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="../../../../../../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="../semantics.html"><img src="../../../../../../../doc/html/images/prev.png" alt="Prev"></a><a accesskey="u" href="../semantics.html"><img src="../../../../../../../doc/html/images/up.png" alt="Up"></a><a accesskey="h" href="../../../index.html"><img src="../../../../../../../doc/html/images/home.png" alt="Home"></a><a accesskey="n" href="functions.html"><img src="../../../../../../../doc/html/images/next.png" alt="Next"></a>
-</div>
-<div class="section" title="Metafunctions">
-<div class="titlepage"><div><div><h4 class="title">
-<a name="range.reference.semantics.metafunctions"></a><a class="link" href="metafunctions.html" title="Metafunctions">Metafunctions</a>
-</h4></div></div></div>
-<div class="informaltable"><table class="table">
-<colgroup>
-<col>
-<col>
-<col>
-</colgroup>
-<thead><tr>
-<th>
-                  <p>
-                    Expression
-                  </p>
-                </th>
-<th>
-                  <p>
-                    Return type
-                  </p>
-                </th>
-<th>
-                  <p>
-                    Complexity
-                  </p>
-                </th>
-</tr></thead>
-<tbody>
-<tr>
-<td>
-                  <p>
-                    <code class="computeroutput"><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>
-                  </p>
-                </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>
-<span class="identifier">A</span><span class="special">*</span>
-</pre>
-<p>
-                  </p>
-                </td>
-<td>
-                  <p>
-                    compile time
-                  </p>
-                </td>
-</tr>
-<tr>
-<td>
-                  <p>
-                    <code class="computeroutput"><span class="identifier">range_iterator</span><span class="special">&lt;</span><span class="keyword">const</span>
-                    <span class="identifier">X</span><span class="special">&gt;::</span><span class="identifier">type</span></code>
-                  </p>
-                </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>
-<span class="keyword">const</span> <span class="identifier">A</span><span class="special">*</span>
-</pre>
-<p>
-                  </p>
-                </td>
-<td>
-                  <p>
-                    compile time
-                  </p>
-                </td>
-</tr>
-<tr>
-<td>
-                  <p>
-                    <code class="computeroutput"><span class="identifier">range_value</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>
-                  <p>
-                    <code class="computeroutput"><span class="identifier">boost</span><span class="special">::</span><span class="identifier">iterator_value</span><span class="special">&lt;</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><span class="special">&gt;::</span><span class="identifier">type</span></code>
-                  </p>
-                </td>
-<td>
-                  <p>
-                    compile time
-                  </p>
-                </td>
-</tr>
-<tr>
-<td>
-                  <p>
-                    <code class="computeroutput"><span class="identifier">range_reference</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>
-                  <p>
-                    <code class="computeroutput"><span class="identifier">boost</span><span class="special">::</span><span class="identifier">iterator_reference</span><span class="special">&lt;</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><span class="special">&gt;::</span><span class="identifier">type</span></code>
-                  </p>
-                </td>
-<td>
-                  <p>
-                    compile time
-                  </p>
-                </td>
-</tr>
-<tr>
-<td>
-                  <p>
-                    <code class="computeroutput"><span class="identifier">range_pointer</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>
-                  <p>
-                    <code class="computeroutput"><span class="identifier">boost</span><span class="special">::</span><span class="identifier">iterator_pointer</span><span class="special">&lt;</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><span class="special">&gt;::</span><span class="identifier">type</span></code>
-                  </p>
-                </td>
-<td>
-                  <p>
-                    compile time
-                  </p>
-                </td>
-</tr>
-<tr>
-<td>
-                  <p>
-                    <code class="computeroutput"><span class="identifier">range_category</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>
-                  <p>
-                    <code class="computeroutput"><span class="identifier">boost</span><span class="special">::</span><span class="identifier">iterator_category</span><span class="special">&lt;</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><span class="special">&gt;::</span><span class="identifier">type</span></code>
-                  </p>
-                </td>
-<td>
-                  <p>
-                    compile time
-                  </p>
-                </td>
-</tr>
-<tr>
-<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>
-                  </p>
-                </td>
-<td>
-                  <p>
-                    <code class="computeroutput"><span class="identifier">boost</span><span class="special">::</span><span class="identifier">iterator_category</span><span class="special">&lt;</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><span class="special">&gt;::</span><span class="identifier">type</span></code>
-                  </p>
-                </td>
-<td>
-                  <p>
-                    compile time
-                  </p>
-                </td>
-</tr>
-<tr>
-<td>
-                  <p>
-                    <code class="computeroutput"><span class="identifier">range_reverse_iterator</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>
-                  <p>
-                    <code class="computeroutput"><span class="identifier">boost</span><span class="special">::</span><span class="identifier">reverse_iterator</span><span class="special">&lt;</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><span class="special">&gt;</span></code>
-                  </p>
-                </td>
-<td>
-                  <p>
-                    compile time
-                  </p>
-                </td>
-</tr>
-<tr>
-<td>
-                  <p>
-                    <code class="computeroutput"><span class="identifier">range_reverse_iterator</span><span class="special">&lt;</span><span class="keyword">const</span>
-                    <span class="identifier">X</span><span class="special">&gt;::</span><span class="identifier">type</span></code>
-                  </p>
-                </td>
-<td>
-                  <p>
-                    <code class="computeroutput"><span class="identifier">boost</span><span class="special">::</span><span class="identifier">reverse_iterator</span><span class="special">&lt;</span><span class="identifier">range_iterator</span><span class="special">&lt;</span><span class="keyword">const</span> <span class="identifier">X</span><span class="special">&gt;::</span><span class="identifier">type</span></code>
-                  </p>
-                </td>
-<td>
-                  <p>
-                    compile time
-                  </p>
-                </td>
-</tr>
-</tbody>
-</table></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="../semantics.html"><img src="../../../../../../../doc/html/images/prev.png" alt="Prev"></a><a accesskey="u" href="../semantics.html"><img src="../../../../../../../doc/html/images/up.png" alt="Up"></a><a accesskey="h" href="../../../index.html"><img src="../../../../../../../doc/html/images/home.png" alt="Home"></a><a accesskey="n" href="functions.html"><img src="../../../../../../../doc/html/images/next.png" alt="Next"></a>
-</div>
-</body>
-</html>
diff --git a/doc/html/range/reference/synopsis.html b/doc/html/range/reference/synopsis.html
deleted file mode 100644
index 248e8c1..0000000
--- a/doc/html/range/reference/synopsis.html
+++ /dev/null
@@ -1,185 +0,0 @@
-<html>
-<head>
-<meta http-equiv="Content-Type" content="text/html; charset=US-ASCII">
-<title>Synopsis</title>
-<link rel="stylesheet" href="../../../../../../doc/html/boostbook.css" type="text/css">
-<meta name="generator" content="DocBook XSL Stylesheets V1.75.1">
-<link rel="home" href="../../index.html" title="Chapter&#160;1.&#160;Range 2.0">
-<link rel="up" href="../reference.html" title="Reference">
-<link rel="prev" href="overview.html" title="Overview">
-<link rel="next" href="semantics.html" title="Semantics">
-</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="../../../../../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="overview.html"><img src="../../../../../../doc/html/images/prev.png" alt="Prev"></a><a accesskey="u" href="../reference.html"><img src="../../../../../../doc/html/images/up.png" alt="Up"></a><a accesskey="h" href="../../index.html"><img src="../../../../../../doc/html/images/home.png" alt="Home"></a><a accesskey="n" href="semantics.html"><img src="../../../../../../doc/html/images/next.png" alt="Next"></a>
-</div>
-<div class="section" title="Synopsis">
-<div class="titlepage"><div><div><h3 class="title">
-<a name="range.reference.synopsis"></a><a class="link" href="synopsis.html" title="Synopsis">Synopsis</a>
-</h3></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="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>
-
-    <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_value</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_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="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="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="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>
-
-    <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="identifier">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="identifier">T</span><span class="special">&gt;::</span><span class="identifier">type</span>
-    <span class="identifier">end</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="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">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">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="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="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>
-
-    <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">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="identifier">T</span><span class="special">&gt;::</span><span class="identifier">type</span>
-    <span class="identifier">rend</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="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="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="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="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="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="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="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="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>
-<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>
-        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="overview.html"><img src="../../../../../../doc/html/images/prev.png" alt="Prev"></a><a accesskey="u" href="../reference.html"><img src="../../../../../../doc/html/images/up.png" alt="Up"></a><a accesskey="h" href="../../index.html"><img src="../../../../../../doc/html/images/home.png" alt="Home"></a><a accesskey="n" href="semantics.html"><img src="../../../../../../doc/html/images/next.png" alt="Next"></a>
-</div>
-</body>
-</html>
diff --git a/doc/html/range/upgrade/upgrade_1_34_to_1_35.html b/doc/html/range/upgrade/upgrade_1_34_to_1_35.html
deleted file mode 100644
index 252ec93..0000000
--- a/doc/html/range/upgrade/upgrade_1_34_to_1_35.html
+++ /dev/null
@@ -1,77 +0,0 @@
-<html>
-<head>
-<meta http-equiv="Content-Type" content="text/html; charset=US-ASCII">
-<title>Upgrade from version 1.34</title>
-<link rel="stylesheet" href="../../../../../../doc/html/boostbook.css" type="text/css">
-<meta name="generator" content="DocBook XSL Stylesheets V1.75.1">
-<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="../portability.html" title="Portability">
-</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="../../../../../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/html/images/prev.png" alt="Prev"></a><a accesskey="u" href="../upgrade.html"><img src="../../../../../../doc/html/images/up.png" alt="Up"></a><a accesskey="h" href="../../index.html"><img src="../../../../../../doc/html/images/home.png" alt="Home"></a><a accesskey="n" href="../portability.html"><img src="../../../../../../doc/html/images/next.png" alt="Next"></a>
-</div>
-<div class="section" title="Upgrade from version 1.34">
-<div class="titlepage"><div><div><h3 class="title">
-<a name="range.upgrade.upgrade_1_34_to_1_35"></a><a class="link" href="upgrade_1_34_to_1_35.html" title="Upgrade from version 1.34"> Upgrade from version
-      1.34</a>
-</h3></div></div></div>
-<p>
-        Boost version 1.35 introduced some larger refactorings of the library:
-      </p>
-<div class="orderedlist"><ol class="orderedlist" type="1">
-<li class="listitem">
-          Direct support for character arrays was abandoned in favor of uniform treatment
-          of all arrays. Instead string algorithms can use the new function <a class="link" href="../reference/semantics/functions.html" title="Functions"><code class="computeroutput"><span class="identifier">as_literal</span></code></a><code class="computeroutput"><span class="special">()</span></code>.
-        </li>
-<li class="listitem">
-<a class="link" href="../reference/semantics/functions.html" title="Functions"><code class="computeroutput"><span class="identifier">size</span></code></a>
-          now requires a <a class="link" href="../concepts/random_access_range.html" title="Random Access Range">Random
-          Access Range</a>. The old behavior is provided as <a class="link" href="../reference/semantics/functions.html" title="Functions"><code class="computeroutput"><span class="identifier">distance</span></code></a><code class="computeroutput"><span class="special">()</span></code>.
-        </li>
-<li class="listitem">
-<code class="computeroutput"><span class="identifier">range_size</span><span class="special">&lt;</span><span class="identifier">T</span><span class="special">&gt;::</span><span class="identifier">type</span></code> has been completely removed in favor
-          of <code class="computeroutput"><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></code>
-</li>
-<li class="listitem">
-<code class="computeroutput"><span class="identifier">boost_range_begin</span><span class="special">()</span></code>
-          and <code class="computeroutput"><span class="identifier">boost_range_end</span><span class="special">()</span></code>
-          have been renamed <code class="computeroutput"><span class="identifier">range_begin</span><span class="special">()</span></code> and <code class="computeroutput"><span class="identifier">range_end</span><span class="special">()</span></code> respectively.
-        </li>
-<li class="listitem">
-<code class="computeroutput"><span class="identifier">range_result_iterator</span><span class="special">&lt;</span><span class="identifier">T</span><span class="special">&gt;::</span><span class="identifier">type</span></code> and <code class="computeroutput"><span class="identifier">range_reverse_result_iterator</span><span class="special">&lt;</span><span class="identifier">T</span><span class="special">&gt;::</span><span class="identifier">type</span></code>
-          have been renamed <code class="computeroutput"><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></code>
-          and <code class="computeroutput"><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></code>.
-        </li>
-<li class="listitem">
-          The procedure that makes a custom type work with the library has been greatly
-          simplified. See <a class="link" href="../reference/extending.html" title="Extending the library">Extending the
-          library for UDTs</a> for details.
-        </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/html/images/prev.png" alt="Prev"></a><a accesskey="u" href="../upgrade.html"><img src="../../../../../../doc/html/images/up.png" alt="Up"></a><a accesskey="h" href="../../index.html"><img src="../../../../../../doc/html/images/home.png" alt="Home"></a><a accesskey="n" href="../portability.html"><img src="../../../../../../doc/html/images/next.png" alt="Next"></a>
-</div>
-</body>
-</html>
diff --git a/doc/html/range/utilities/iterator_range.html b/doc/html/range/utilities/iterator_range.html
deleted file mode 100644
index 6f536e7..0000000
--- a/doc/html/range/utilities/iterator_range.html
+++ /dev/null
@@ -1,322 +0,0 @@
-<html>
-<head>
-<meta http-equiv="Content-Type" content="text/html; charset=US-ASCII">
-<title>Class iterator_range</title>
-<link rel="stylesheet" href="../../../../../../doc/html/boostbook.css" type="text/css">
-<meta name="generator" content="DocBook XSL Stylesheets V1.75.1">
-<link rel="home" href="../../index.html" title="Chapter&#160;1.&#160;Range 2.0">
-<link rel="up" href="../utilities.html" title="Utilities">
-<link rel="prev" href="../utilities.html" title="Utilities">
-<link rel="next" href="sub_range.html" title="Class sub_range">
-</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="../../../../../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="../utilities.html"><img src="../../../../../../doc/html/images/prev.png" alt="Prev"></a><a accesskey="u" href="../utilities.html"><img src="../../../../../../doc/html/images/up.png" alt="Up"></a><a accesskey="h" href="../../index.html"><img src="../../../../../../doc/html/images/home.png" alt="Home"></a><a accesskey="n" href="sub_range.html"><img src="../../../../../../doc/html/images/next.png" alt="Next"></a>
-</div>
-<div class="section" title="Class iterator_range">
-<div class="titlepage"><div><div><h3 class="title">
-<a name="range.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>
-</h3></div></div></div>
-<p>
-        The intention of the <code class="computeroutput"><span class="identifier">iterator_range</span></code>
-        class is to encapsulate two iterators so they fulfill the <a class="link" href="../concepts/forward_range.html" title="Forward Range">Forward
-        Range</a> concept. A few other functions are also provided for convenience.
-      </p>
-<p>
-        If the template argument is not 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>, one can still use a subset of the interface.
-        In particular, <code class="computeroutput"><span class="identifier">size</span><span class="special">()</span></code>
-        requires Random Access Traversal Iterators whereas <code class="computeroutput"><span class="identifier">empty</span><span class="special">()</span></code> only requires Single Pass Iterators.
-      </p>
-<p>
-        Recall that many default constructed iterators are <span class="bold"><strong><span class="emphasis"><em>singular</em></span></strong></span>
-        and hence can only be assigned, but not compared or incremented or anything.
-        However, if one creates a default constructed <code class="computeroutput"><span class="identifier">iterator_range</span></code>,
-        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 type.
-      </p>
-<a name="range.utilities.iterator_range.synopsis"></a><h5>
-<a name="id2763343"></a>
-        <a class="link" href="iterator_range.html#range.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">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="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="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">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="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="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="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">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">==(</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="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">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">!=(</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="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">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">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="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">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>
-
-    <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="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="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>
-<p>
-      </p>
-<p>
-        If an instance of <code class="computeroutput"><span class="identifier">iterator_range</span></code>
-        is constructed by a client with two iterators, the client must ensure that
-        the two iterators delimit a valid closed-open range [begin,end).
-      </p>
-<p>
-        It is worth noticing that the templated constructors and assignment operators
-        allow conversion from <code class="computeroutput"><span class="identifier">iterator_range</span><span class="special">&lt;</span><span class="identifier">iterator</span><span class="special">&gt;</span></code> to <code class="computeroutput"><span class="identifier">iterator_range</span><span class="special">&lt;</span><span class="identifier">const_iterator</span><span class="special">&gt;</span></code>. Similarly, since the comparison operators
-        have two template arguments, we can compare ranges whenever the iterators
-        are comparable; for example when we are dealing with const and non-const
-        iterators from the same container.
-      </p>
-<a name="range.utilities.iterator_range.details_member_functions"></a><h5>
-<a name="id2766569"></a>
-        <a class="link" href="iterator_range.html#range.utilities.iterator_range.details_member_functions">Details
-        member functions</a>
-      </h5>
-<p>
-        <code class="computeroutput"><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></code>
-      </p>
-<div class="blockquote"><blockquote class="blockquote">
-<p>
-          </p>
-<p>
-            <span class="emphasis"><em><span class="bold"><strong>Returns</strong></span></em></span> <code class="computeroutput"><span class="special">!</span><span class="identifier">empty</span><span class="special">();</span></code>
-          </p>
-<p>
-        </p>
-</blockquote></div>
-<p>
-        <code class="computeroutput"><span class="keyword">bool</span> <span class="identifier">equal</span><span class="special">(</span> <span class="identifier">iterator_range</span><span class="special">&amp;</span> <span class="identifier">r</span> <span class="special">)</span> <span class="keyword">const</span><span class="special">;</span></code>
-      </p>
-<div class="blockquote"><blockquote class="blockquote">
-<p>
-          </p>
-<p>
-            <span class="emphasis"><em><span class="bold"><strong>Returns</strong></span></em></span> <code class="computeroutput"><span class="identifier">begin</span><span class="special">()</span> <span class="special">==</span> <span class="identifier">r</span><span class="special">.</span><span class="identifier">begin</span><span class="special">()</span> <span class="special">&amp;&amp;</span>
-            <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>
-<p>
-        </p>
-</blockquote></div>
-<a name="range.utilities.iterator_range.details_functions"></a><h5>
-<a name="id2766813"></a>
-        <a class="link" href="iterator_range.html#range.utilities.iterator_range.details_functions">Details
-        functions</a>
-      </h5>
-<p>
-        <code class="computeroutput"><span class="keyword">bool</span> <span class="keyword">operator</span><span class="special">==(</span> <span class="keyword">const</span> <span class="identifier">ForwardRange1</span><span class="special">&amp;</span>
-        <span class="identifier">l</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></code>
-      </p>
-<div class="blockquote"><blockquote class="blockquote">
-<p>
-          </p>
-<p>
-            <span class="emphasis"><em><span class="bold"><strong>Returns</strong></span></em></span> <code class="computeroutput"><span class="identifier">size</span><span class="special">(</span><span class="identifier">l</span><span class="special">)</span> <span class="special">!=</span> <span class="identifier">size</span><span class="special">(</span><span class="identifier">r</span><span class="special">)</span> <span class="special">?</span> <span class="keyword">false</span>
-            <span class="special">:</span> <span class="identifier">std</span><span class="special">::</span><span class="identifier">equal</span><span class="special">(</span> <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="special">);</span></code>
-          </p>
-<p>
-        </p>
-</blockquote></div>
-<p>
-        <code class="computeroutput"><span class="keyword">bool</span> <span class="keyword">operator</span><span class="special">!=(</span> <span class="keyword">const</span> <span class="identifier">ForwardRange1</span><span class="special">&amp;</span>
-        <span class="identifier">l</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></code>
-      </p>
-<div class="blockquote"><blockquote class="blockquote">
-<p>
-          </p>
-<p>
-            <span class="emphasis"><em><span class="bold"><strong>Returns</strong></span></em></span> <code class="computeroutput"><span class="special">!(</span> <span class="identifier">l</span> <span class="special">==</span> <span class="identifier">r</span> <span class="special">);</span></code>
-          </p>
-<p>
-        </p>
-</blockquote></div>
-<p>
-        <code class="computeroutput"><span class="keyword">bool</span> <span class="keyword">operator</span><span class="special">&lt;(</span> <span class="keyword">const</span> <span class="identifier">ForwardRange1</span><span class="special">&amp;</span>
-        <span class="identifier">l</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></code>
-      </p>
-<div class="blockquote"><blockquote class="blockquote">
-<p>
-          </p>
-<p>
-            <span class="emphasis"><em><span class="bold"><strong>Returns</strong></span></em></span> <code class="computeroutput"><span class="identifier">std</span><span class="special">::</span><span class="identifier">lexicographical_compare</span><span class="special">(</span>
-            <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>
-<p>
-        </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_end</span> <span class="special">);</span>
-</pre>
-<p>
-      </p>
-<div class="blockquote"><blockquote class="blockquote">
-<p>
-          </p>
-<p>
-            <span class="emphasis"><em><span class="bold"><strong>Effects:</strong></span></em></span>
-          </p>
-<p>
-        </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>
-<span class="identifier">std</span><span class="special">::</span><span class="identifier">advance</span><span class="special">(</span> <span class="identifier">new_begin</span><span class="special">,</span> <span class="identifier">advance_begin</span> <span class="special">);</span>
-<span class="identifier">std</span><span class="special">::</span><span class="identifier">advance</span><span class="special">(</span> <span class="identifier">new_end</span><span class="special">,</span> <span class="identifier">advance_end</span> <span class="special">);</span>
-<span class="keyword">return</span> <span class="identifier">make_iterator_range</span><span class="special">(</span> <span class="identifier">new_begin</span><span class="special">,</span> <span class="identifier">new_end</span> <span class="special">);</span>
-</pre>
-<p>
-      </p>
-<p>
-        <code class="computeroutput"><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></code>
-      </p>
-<div class="blockquote"><blockquote class="blockquote">
-<p>
-          </p>
-<p>
-            <span class="emphasis"><em><span class="bold"><strong>Returns</strong></span></em></span> <code class="computeroutput"><span class="identifier">Sequence</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>
-<p>
-        </p>
-</blockquote></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="../utilities.html"><img src="../../../../../../doc/html/images/prev.png" alt="Prev"></a><a accesskey="u" href="../utilities.html"><img src="../../../../../../doc/html/images/up.png" alt="Up"></a><a accesskey="h" href="../../index.html"><img src="../../../../../../doc/html/images/home.png" alt="Home"></a><a accesskey="n" href="sub_range.html"><img src="../../../../../../doc/html/images/next.png" alt="Next"></a>
-</div>
-</body>
-</html>
diff --git a/doc/html/range/utilities/join.html b/doc/html/range/utilities/join.html
deleted file mode 100644
index fa140e5..0000000
--- a/doc/html/range/utilities/join.html
+++ /dev/null
@@ -1,89 +0,0 @@
-<html>
-<head>
-<meta http-equiv="Content-Type" content="text/html; charset=US-ASCII">
-<title>Function join</title>
-<link rel="stylesheet" href="../../../../../../doc/html/boostbook.css" type="text/css">
-<meta name="generator" content="DocBook XSL Stylesheets V1.75.1">
-<link rel="home" href="../../index.html" title="Chapter&#160;1.&#160;Range 2.0">
-<link rel="up" href="../utilities.html" title="Utilities">
-<link rel="prev" href="sub_range.html" title="Class sub_range">
-<link rel="next" href="../style_guide.html" title="Terminology and style guidelines">
-</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="../../../../../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="sub_range.html"><img src="../../../../../../doc/html/images/prev.png" alt="Prev"></a><a accesskey="u" href="../utilities.html"><img src="../../../../../../doc/html/images/up.png" alt="Up"></a><a accesskey="h" href="../../index.html"><img src="../../../../../../doc/html/images/home.png" alt="Home"></a><a accesskey="n" href="../style_guide.html"><img src="../../../../../../doc/html/images/next.png" alt="Next"></a>
-</div>
-<div class="section" title="Function join">
-<div class="titlepage"><div><div><h3 class="title">
-<a name="range.utilities.join"></a><a class="link" href="join.html" title="Function join"> Function join</a>
-</h3></div></div></div>
-<p>
-        The intention of the <code class="computeroutput"><span class="identifier">join</span></code>
-        function is to join two ranges into one longer range.
-      </p>
-<p>
-        The resultant range will have the lowest common traversal of the two ranges
-        supplied as parameters.
-      </p>
-<p>
-        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.utilities.join.synposis"></a><h5>
-<a name="id2769247"></a>
-        <a class="link" href="join.html#range.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">iterator_range</span><span class="special">&lt;</span><span class="identifier">range_detail</span><span class="special">::</span><span class="identifier">join_iterator</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">SinglePassRange1</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">SinglePassRange2</span><span class="special">&gt;::</span><span class="identifier">type</span><span class="special">,</span>
-    <span class="keyword">typename</span> <span class="identifier">add_const</span><span class="special">&lt;</span>
-        <span class="keyword">typename</span> <span class="identifier">range_value</span><span class="special">&lt;</span><span class="keyword">const</span> <span class="identifier">SinglePassRange1</span><span class="special">&gt;::</span><span class="identifier">type</span><span class="special">&gt;::</span><span class="identifier">type</span><span class="special">&gt;</span>
-<span class="special">&gt;</span>
-<span class="identifier">join</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="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">iterator_range</span><span class="special">&lt;</span><span class="identifier">range_detail</span><span class="special">::</span><span class="identifier">join_iterator</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">SinglePassRange1</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="identifier">SinglePassRange2</span><span class="special">&gt;::</span><span class="identifier">type</span><span class="special">,</span>
-    <span class="keyword">typename</span> <span class="identifier">range_value</span><span class="special">&lt;</span><span class="identifier">SinglePassRange1</span><span class="special">&gt;::</span><span class="identifier">type</span><span class="special">&gt;</span>
-<span class="special">&gt;</span>
-<span class="identifier">join</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">SinglePassRange2</span><span class="special">&amp;</span> <span class="identifier">rng2</span><span class="special">);</span>
-</pre>
-<p>
-      </p>
-<a name="range.utilities.join.example"></a><h5>
-<a name="id2769794"></a>
-        <a class="link" href="join.html#range.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
-        evaluate to a range representing an integer range <code class="computeroutput"><span class="special">[</span><span class="number">0</span><span class="special">,</span><span class="number">10</span><span class="special">)</span></code>
-      </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>
-        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="sub_range.html"><img src="../../../../../../doc/html/images/prev.png" alt="Prev"></a><a accesskey="u" href="../utilities.html"><img src="../../../../../../doc/html/images/up.png" alt="Up"></a><a accesskey="h" href="../../index.html"><img src="../../../../../../doc/html/images/home.png" alt="Home"></a><a accesskey="n" href="../style_guide.html"><img src="../../../../../../doc/html/images/next.png" alt="Next"></a>
-</div>
-</body>
-</html>
diff --git a/doc/html/range/utilities/sub_range.html b/doc/html/range/utilities/sub_range.html
deleted file mode 100644
index a9f5d42..0000000
--- a/doc/html/range/utilities/sub_range.html
+++ /dev/null
@@ -1,122 +0,0 @@
-<html>
-<head>
-<meta http-equiv="Content-Type" content="text/html; charset=US-ASCII">
-<title>Class sub_range</title>
-<link rel="stylesheet" href="../../../../../../doc/html/boostbook.css" type="text/css">
-<meta name="generator" content="DocBook XSL Stylesheets V1.75.1">
-<link rel="home" href="../../index.html" title="Chapter&#160;1.&#160;Range 2.0">
-<link rel="up" href="../utilities.html" title="Utilities">
-<link rel="prev" href="iterator_range.html" title="Class iterator_range">
-<link rel="next" href="join.html" title="Function join">
-</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="../../../../../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="iterator_range.html"><img src="../../../../../../doc/html/images/prev.png" alt="Prev"></a><a accesskey="u" href="../utilities.html"><img src="../../../../../../doc/html/images/up.png" alt="Up"></a><a accesskey="h" href="../../index.html"><img src="../../../../../../doc/html/images/home.png" alt="Home"></a><a accesskey="n" href="join.html"><img src="../../../../../../doc/html/images/next.png" alt="Next"></a>
-</div>
-<div class="section" title="Class sub_range">
-<div class="titlepage"><div><div><h3 class="title">
-<a name="range.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>
-</h3></div></div></div>
-<p>
-        The <code class="computeroutput"><span class="identifier">sub_range</span></code> class inherits
-        all its functionality from the <a class="link" href="iterator_range.html" title="Class iterator_range"><code class="computeroutput"><span class="identifier">iterator_range</span></code></a> class. The <code class="computeroutput"><span class="identifier">sub_range</span></code> class is often easier to use
-        because one must specify the <a class="link" href="../concepts/forward_range.html" title="Forward Range">Forward
-        Range</a> template argument instead of an iterator. Moreover, the <code class="computeroutput"><span class="identifier">sub_range</span></code> class can propagate constness
-        since it knows what a corresponding <code class="computeroutput"><span class="identifier">const_iterator</span></code>
-        is.
-      </p>
-<a name="range.utilities.sub_range.synopsis"></a><h5>
-<a name="id2767970"></a>
-        <a class="link" href="sub_range.html#range.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">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="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">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="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="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>
-<p>
-      </p>
-<p>
-        The class should be trivial to use as seen below. Imagine that we have an
-        algorithm that searches for a sub-string in a string. The result is an iterator_range,
-        that delimits the match. We need to store the result from this algorithm.
-        Here is an example of how we can do it with and without <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>
-<span class="identifier">sub_range</span><span class="special">&lt;</span><span class="identifier">std</span><span class="special">::</span><span class="identifier">string</span><span class="special">&gt;</span>               <span class="identifier">sub</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>
-</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>
-        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="iterator_range.html"><img src="../../../../../../doc/html/images/prev.png" alt="Prev"></a><a accesskey="u" href="../utilities.html"><img src="../../../../../../doc/html/images/up.png" alt="Up"></a><a accesskey="h" href="../../index.html"><img src="../../../../../../doc/html/images/home.png" alt="Home"></a><a accesskey="n" href="join.html"><img src="../../../../../../doc/html/images/next.png" alt="Next"></a>
-</div>
-</body>
-</html>

From 65b22bfa38ae51eda1266aa1397b5ef485910f82 Mon Sep 17 00:00:00 2001
From: Daniel James <daniel@calamity.org.uk>
Date: Sat, 24 Jul 2010 14:26:01 +0000
Subject: [PATCH 41/73] Merge filesystem, range, doc from trunk.

* Inline deprecated methods in filesystem.
* Fix some links in range.
* Clean up test document a bit.


[SVN r64315]
---
 doc/concepts.qbk                              |  6 +++---
 doc/html/index.html                           |  4 ++--
 .../range/concepts/bidirectional_range.html   | 16 ++++++++--------
 doc/html/range/concepts/concept_checking.html |  4 ++--
 doc/html/range/concepts/forward_range.html    | 10 +++++-----
 doc/html/range/concepts/overview.html         |  4 ++--
 .../range/concepts/random_access_range.html   | 12 ++++++------
 .../range/concepts/single_pass_range.html     | 16 ++++++++--------
 doc/html/range/history_ack.html               |  4 ++--
 doc/html/range/introduction.html              |  6 +++---
 doc/html/range/mfc_atl.html                   |  4 ++--
 .../reference/adaptors/introduction.html      |  6 +++---
 .../reference/algorithms/heap/make_heap.html  | 10 +++++-----
 .../reference/algorithms/heap/pop_heap.html   | 12 ++++++------
 .../reference/algorithms/heap/push_heap.html  | 12 ++++++------
 .../reference/algorithms/heap/sort_heap.html  | 12 ++++++------
 .../reference/algorithms/mutating/copy.html   | 12 ++++++------
 .../algorithms/mutating/copy_backward.html    | 12 ++++++------
 .../reference/algorithms/mutating/fill.html   | 10 +++++-----
 .../reference/algorithms/mutating/fill_n.html | 10 +++++-----
 .../algorithms/mutating/generate.html         | 12 ++++++------
 .../algorithms/mutating/inplace_merge.html    | 16 ++++++++--------
 .../reference/algorithms/mutating/merge.html  | 16 ++++++++--------
 .../algorithms/mutating/nth_element.html      | 10 +++++-----
 .../algorithms/mutating/partial_sort.html     | 10 +++++-----
 .../algorithms/mutating/partition.html        | 10 +++++-----
 .../algorithms/mutating/random_shuffle.html   | 12 ++++++------
 .../reference/algorithms/mutating/remove.html | 10 +++++-----
 .../algorithms/mutating/remove_copy.html      | 10 +++++-----
 .../algorithms/mutating/remove_copy_if.html   | 10 +++++-----
 .../algorithms/mutating/remove_if.html        | 10 +++++-----
 .../algorithms/mutating/replace.html          | 10 +++++-----
 .../algorithms/mutating/replace_copy.html     | 10 +++++-----
 .../algorithms/mutating/replace_copy_if.html  | 10 +++++-----
 .../algorithms/mutating/replace_if.html       | 10 +++++-----
 .../algorithms/mutating/reverse.html          | 10 +++++-----
 .../algorithms/mutating/reverse_copy.html     | 10 +++++-----
 .../reference/algorithms/mutating/rotate.html | 12 ++++++------
 .../algorithms/mutating/rotate_copy.html      | 12 ++++++------
 .../reference/algorithms/mutating/sort.html   | 10 +++++-----
 .../algorithms/mutating/stable_partition.html | 10 +++++-----
 .../algorithms/mutating/stable_sort.html      | 10 +++++-----
 .../algorithms/mutating/swap_ranges.html      | 10 +++++-----
 .../algorithms/mutating/transform.html        | 12 ++++++------
 .../reference/algorithms/mutating/unique.html | 10 +++++-----
 .../algorithms/mutating/unique_copy.html      | 10 +++++-----
 .../reference/algorithms/new/copy_n.html      | 10 +++++-----
 .../range/reference/algorithms/new/erase.html | 10 +++++-----
 .../reference/algorithms/new/for_each.html    | 10 +++++-----
 .../reference/algorithms/new/insert.html      | 10 +++++-----
 .../range/reference/algorithms/new/iota.html  | 10 +++++-----
 .../reference/algorithms/new/is_sorted.html   | 10 +++++-----
 .../reference/algorithms/new/overwrite.html   | 10 +++++-----
 .../reference/algorithms/new/push_back.html   | 10 +++++-----
 .../reference/algorithms/new/push_front.html  | 10 +++++-----
 .../algorithms/new/remove_erase.html          | 10 +++++-----
 .../algorithms/new/remove_erase_if.html       | 10 +++++-----
 .../non_mutating/adjacent_find.html           | 10 +++++-----
 .../non_mutating/binary_search.html           | 12 ++++++------
 .../algorithms/non_mutating/count.html        | 10 +++++-----
 .../algorithms/non_mutating/count_if.html     | 10 +++++-----
 .../algorithms/non_mutating/equal.html        | 10 +++++-----
 .../algorithms/non_mutating/equal_range.html  | 12 ++++++------
 .../algorithms/non_mutating/find.html         | 10 +++++-----
 .../algorithms/non_mutating/find_end.html     | 10 +++++-----
 .../non_mutating/find_first_of.html           | 10 +++++-----
 .../algorithms/non_mutating/find_if.html      | 12 ++++++------
 .../algorithms/non_mutating/for_each.html     | 10 +++++-----
 .../non_mutating/lexicographical_compare.html | 10 +++++-----
 .../algorithms/non_mutating/lower_bound.html  | 12 ++++++------
 .../algorithms/non_mutating/max_element.html  | 10 +++++-----
 .../algorithms/non_mutating/min_element.html  | 10 +++++-----
 .../algorithms/non_mutating/mismatch.html     | 12 ++++++------
 .../algorithms/non_mutating/search.html       | 10 +++++-----
 .../algorithms/non_mutating/search_n.html     | 10 +++++-----
 .../algorithms/non_mutating/upper_bound.html  | 12 ++++++------
 .../algorithms/numeric/accumulate.html        | 14 +++++++-------
 .../numeric/adjacent_difference.html          | 16 ++++++++--------
 .../algorithms/numeric/inner_product.html     | 16 ++++++++--------
 .../algorithms/numeric/partial_sum.html       | 16 ++++++++--------
 .../permutation/next_permutation.html         | 10 +++++-----
 .../permutation/prev_permutation.html         | 10 +++++-----
 .../reference/algorithms/set/includes.html    | 12 ++++++------
 .../algorithms/set/set_difference.html        | 12 ++++++------
 .../algorithms/set/set_intersection.html      | 12 ++++++------
 .../set/set_symmetric_difference.html         | 12 ++++++------
 .../reference/algorithms/set/set_union.html   | 12 ++++++------
 .../concept_implementation/semantics.html     |  2 +-
 .../reference/ranges/counting_range.html      |  8 ++++----
 doc/html/range/reference/ranges/irange.html   | 10 +++++-----
 .../range/reference/ranges/istream_range.html |  6 +++---
 .../reference/utilities/iterator_range.html   |  6 +++---
 doc/html/range/reference/utilities/join.html  |  4 ++--
 .../range/reference/utilities/sub_range.html  |  2 +-
 doc/html/standalone_HTML.manifest             | 19 -------------------
 95 files changed, 478 insertions(+), 497 deletions(-)
 delete mode 100644 doc/html/standalone_HTML.manifest

diff --git a/doc/concepts.qbk b/doc/concepts.qbk
index cc6fd23..773ef9d 100644
--- a/doc/concepts.qbk
+++ b/doc/concepts.qbk
@@ -11,9 +11,9 @@ The motivation for the Range concept is that there are many useful Container-lik
 
 Because of the second requirement, a Range object must be passed by (const or non-const) reference in generic code.
 
-The operations that can be performed on a Range is dependent on the [@../../iterator/doc/new-iter-concepts.html#iterator-traversal-concepts-lib-iterator-traversal traversal category] of the underlying iterator type. Therefore the range concepts are named to reflect which traversal category its iterators support. See also terminology and style guidelines. for more information about naming of ranges.
+The operations that can be performed on a Range is dependent on the [@boost:/libs/iterator/doc/new-iter-concepts.html#iterator-traversal-concepts-lib-iterator-traversal traversal category] of the underlying iterator type. Therefore the range concepts are named to reflect which traversal category its iterators support. See also terminology and style guidelines. for more information about naming of ranges.
 
-The concepts described below specifies associated types as [@../../libs/mpl/doc/refmanual/metafunction.html metafunctions] and all functions as free-standing functions to allow for a layer of indirection.
+The concepts described below specifies associated types as [@boost:/libs/mpl/doc/refmanual/metafunction.html metafunctions] and all functions as free-standing functions to allow for a layer of indirection.
 
 [endsect]
 
@@ -217,7 +217,7 @@ __bidirectional_range__
 
 [section Concept Checking]
 
-Each of the range concepts has a corresponding concept checking class in the file [@../../boost/range/concepts.hpp `<boost/range/concepts.hpp>`]. These classes may be used in conjunction with the __concept_check__ to ensure that the type of a template parameter is compatible with a range concept. If not, a meaningful compile time error is generated. Checks are provided for the range concepts related to iterator traversal categories. For example, the following line checks that the type `T` models the __forward_range__ concept.
+Each of the range concepts has a corresponding concept checking class in the file [@boost:/boost/range/concepts.hpp `<boost/range/concepts.hpp>`]. These classes may be used in conjunction with the __concept_check__ to ensure that the type of a template parameter is compatible with a range concept. If not, a meaningful compile time error is generated. Checks are provided for the range concepts related to iterator traversal categories. For example, the following line checks that the type `T` models the __forward_range__ concept.
 
 ``
 BOOST_CONCEPT_ASSERT(( ForwardRangeConcept<T> ));
diff --git a/doc/html/index.html b/doc/html/index.html
index 90355b6..cf6338e 100644
--- a/doc/html/index.html
+++ b/doc/html/index.html
@@ -30,7 +30,7 @@
 </h3></div></div>
 <div><p class="copyright">Copyright &#169; 2003 -2010 Thorsten Ottosen, Neil Groves</p></div>
 <div><div class="legalnotice">
-<a name="id3255322"></a><p>
+<a name="id759698"></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>
@@ -142,7 +142,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: July 17, 2010 at 19:34:42 GMT</small></p></td>
+<td align="left"><p><small>Last revised: July 22, 2010 at 23:20:42 GMT</small></p></td>
 <td align="right"><div class="copyright-footer"></div></td>
 </tr></table>
 <hr>
diff --git a/doc/html/range/concepts/bidirectional_range.html b/doc/html/range/concepts/bidirectional_range.html
index a8decd6..a75fbab 100644
--- a/doc/html/range/concepts/bidirectional_range.html
+++ b/doc/html/range/concepts/bidirectional_range.html
@@ -27,7 +27,7 @@
 <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="id3266571"></a>
+<a name="id762089"></a>
         <a class="link" href="bidirectional_range.html#range.concepts.bidirectional_range.notation">Notation</a>
       </h5>
 <div class="informaltable"><table class="table">
@@ -65,7 +65,7 @@
 </tbody>
 </table></div>
 <a name="range.concepts.bidirectional_range.description"></a><h5>
-<a name="id3266668"></a>
+<a name="id762184"></a>
         <a class="link" href="bidirectional_range.html#range.concepts.bidirectional_range.description">Description</a>
       </h5>
 <p>
@@ -75,7 +75,7 @@
         Traversal Iterator</a>.
       </p>
 <a name="range.concepts.bidirectional_range.refinement_of"></a><h5>
-<a name="id3266734"></a>
+<a name="id762247"></a>
         <a class="link" href="bidirectional_range.html#range.concepts.bidirectional_range.refinement_of">Refinement
         of</a>
       </h5>
@@ -83,7 +83,7 @@
         <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="id3266763"></a>
+<a name="id762274"></a>
         <a class="link" href="bidirectional_range.html#range.concepts.bidirectional_range.associated_types">Associated
         types</a>
       </h5>
@@ -136,7 +136,7 @@
 </tbody>
 </table></div>
 <a name="range.concepts.bidirectional_range.valid_expressions"></a><h5>
-<a name="id3266927"></a>
+<a name="id762436"></a>
         <a class="link" href="bidirectional_range.html#range.concepts.bidirectional_range.valid_expressions">Valid
         expressions</a>
       </h5>
@@ -221,7 +221,7 @@
 </tbody>
 </table></div>
 <a name="range.concepts.bidirectional_range.complexity_guarantees"></a><h5>
-<a name="id3267406"></a>
+<a name="id762894"></a>
         <a class="link" href="bidirectional_range.html#range.concepts.bidirectional_range.complexity_guarantees">Complexity
         guarantees</a>
       </h5>
@@ -232,7 +232,7 @@
         <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="id3267557"></a>
+<a name="id763034"></a>
         <a class="link" href="bidirectional_range.html#range.concepts.bidirectional_range.invariants">Invariants</a>
       </h5>
 <div class="informaltable"><table class="table">
@@ -272,7 +272,7 @@
 </tbody>
 </table></div>
 <a name="range.concepts.bidirectional_range.see_also"></a><h5>
-<a name="id3267818"></a>
+<a name="id763287"></a>
         <a class="link" href="bidirectional_range.html#range.concepts.bidirectional_range.see_also">See also</a>
       </h5>
 <p>
diff --git a/doc/html/range/concepts/concept_checking.html b/doc/html/range/concepts/concept_checking.html
index ca397ff..ec75e36 100644
--- a/doc/html/range/concepts/concept_checking.html
+++ b/doc/html/range/concepts/concept_checking.html
@@ -28,7 +28,7 @@
 </h3></div></div></div>
 <p>
         Each of the range concepts has a corresponding concept checking class in
-        the file <a href="../../../../boost/range/concepts.hpp" target="_top"><code class="computeroutput"><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">concepts</span><span class="special">.</span><span class="identifier">hpp</span><span class="special">&gt;</span></code></a>.
+        the file <a href="../../../../../../boost/range/concepts.hpp" target="_top"><code class="computeroutput"><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">concepts</span><span class="special">.</span><span class="identifier">hpp</span><span class="special">&gt;</span></code></a>.
         These classes may be used in conjunction with the <a href="../../../../../../libs/concept_check/index.html" target="_top">Boost
         Concept Check library</a> to ensure that the type of a template parameter
         is compatible with a range concept. If not, a meaningful compile time error
@@ -79,7 +79,7 @@
           </li>
 </ul></div>
 <a name="range.concepts.concept_checking.see_also"></a><h5>
-<a name="id3268844"></a>
+<a name="id764273"></a>
         <a class="link" href="concept_checking.html#range.concepts.concept_checking.see_also">See also</a>
       </h5>
 <p>
diff --git a/doc/html/range/concepts/forward_range.html b/doc/html/range/concepts/forward_range.html
index 1910a37..c74fdef 100644
--- a/doc/html/range/concepts/forward_range.html
+++ b/doc/html/range/concepts/forward_range.html
@@ -27,7 +27,7 @@
 <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="id3266161"></a>
+<a name="id761693"></a>
         <a class="link" href="forward_range.html#range.concepts.forward_range.notation">Notation</a>
       </h5>
 <div class="informaltable"><table class="table">
@@ -65,7 +65,7 @@
 </tbody>
 </table></div>
 <a name="range.concepts.forward_range.description"></a><h5>
-<a name="id3266257"></a>
+<a name="id761785"></a>
         <a class="link" href="forward_range.html#range.concepts.forward_range.description">Description</a>
       </h5>
 <p>
@@ -73,14 +73,14 @@
         Traversal Iterator</a>.
       </p>
 <a name="range.concepts.forward_range.refinement_of"></a><h5>
-<a name="id3266329"></a>
+<a name="id761854"></a>
         <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="id3266358"></a>
+<a name="id761881"></a>
         <a class="link" href="forward_range.html#range.concepts.forward_range.associated_types">Associated
         types</a>
       </h5>
@@ -132,7 +132,7 @@
 </tbody>
 </table></div>
 <a name="range.concepts.forward_range.see_also"></a><h5>
-<a name="id3266515"></a>
+<a name="id762035"></a>
         <a class="link" href="forward_range.html#range.concepts.forward_range.see_also">See also</a>
       </h5>
 <p>
diff --git a/doc/html/range/concepts/overview.html b/doc/html/range/concepts/overview.html
index 0fa9643..bded544 100644
--- a/doc/html/range/concepts/overview.html
+++ b/doc/html/range/concepts/overview.html
@@ -52,14 +52,14 @@
         or non-const) reference in generic code.
       </p>
 <p>
-        The operations that can be performed on a Range is dependent on the <a href="../../../../iterator/doc/new-iter-concepts.html#iterator-traversal-concepts-lib-iterator-traversal" target="_top">traversal
+        The operations that can be performed on a Range is dependent on the <a href="../../../../../../libs/iterator/doc/new-iter-concepts.html#iterator-traversal-concepts-lib-iterator-traversal" target="_top">traversal
         category</a> of the underlying iterator type. Therefore the range concepts
         are named to reflect which traversal category its iterators support. See
         also terminology and style guidelines. for more information about naming
         of ranges.
       </p>
 <p>
-        The concepts described below specifies associated types as <a href="../../../../libs/mpl/doc/refmanual/metafunction.html" target="_top">metafunctions</a>
+        The concepts described below specifies associated types as <a href="../../../../../../libs/mpl/doc/refmanual/metafunction.html" target="_top">metafunctions</a>
         and all functions as free-standing functions to allow for a layer of indirection.
       </p>
 </div>
diff --git a/doc/html/range/concepts/random_access_range.html b/doc/html/range/concepts/random_access_range.html
index 05cbdc0..0f0830b 100644
--- a/doc/html/range/concepts/random_access_range.html
+++ b/doc/html/range/concepts/random_access_range.html
@@ -27,7 +27,7 @@
 <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="id3267875"></a>
+<a name="id763341"></a>
         <a class="link" href="random_access_range.html#range.concepts.random_access_range.description">Description</a>
       </h5>
 <p>
@@ -35,7 +35,7 @@
         Access Traversal Iterator</a>.
       </p>
 <a name="range.concepts.random_access_range.refinement_of"></a><h5>
-<a name="id3267947"></a>
+<a name="id763409"></a>
         <a class="link" href="random_access_range.html#range.concepts.random_access_range.refinement_of">Refinement
         of</a>
       </h5>
@@ -43,7 +43,7 @@
         <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="id3267975"></a>
+<a name="id763438"></a>
         <a class="link" href="random_access_range.html#range.concepts.random_access_range.valid_expressions">Valid
         expressions</a>
       </h5>
@@ -89,7 +89,7 @@
 </tr></tbody>
 </table></div>
 <a name="range.concepts.random_access_range.expression_semantics"></a><h5>
-<a name="id3268122"></a>
+<a name="id763581"></a>
         <a class="link" href="random_access_range.html#range.concepts.random_access_range.expression_semantics">Expression
         semantics</a>
       </h5>
@@ -139,7 +139,7 @@
 </tr></tbody>
 </table></div>
 <a name="range.concepts.random_access_range.complexity_guarantees"></a><h5>
-<a name="id3268348"></a>
+<a name="id763798"></a>
         <a class="link" href="random_access_range.html#range.concepts.random_access_range.complexity_guarantees">Complexity
         guarantees</a>
       </h5>
@@ -147,7 +147,7 @@
         <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="id3268402"></a>
+<a name="id763849"></a>
         <a class="link" href="random_access_range.html#range.concepts.random_access_range.invariants">Invariants</a>
       </h5>
 <div class="informaltable"><table class="table">
diff --git a/doc/html/range/concepts/single_pass_range.html b/doc/html/range/concepts/single_pass_range.html
index a2372ac..e05c7eb 100644
--- a/doc/html/range/concepts/single_pass_range.html
+++ b/doc/html/range/concepts/single_pass_range.html
@@ -27,7 +27,7 @@
 <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="id3214203"></a>
+<a name="id760368"></a>
         <a class="link" href="single_pass_range.html#range.concepts.single_pass_range.notation">Notation</a>
       </h5>
 <div class="informaltable"><table class="table">
@@ -65,7 +65,7 @@
 </tbody>
 </table></div>
 <a name="range.concepts.single_pass_range.description"></a><h5>
-<a name="id3214311"></a>
+<a name="id760464"></a>
         <a class="link" href="single_pass_range.html#range.concepts.single_pass_range.description">Description</a>
       </h5>
 <p>
@@ -73,7 +73,7 @@
         Pass Iterator</a>.
       </p>
 <a name="range.concepts.single_pass_range.associated_types"></a><h5>
-<a name="id3264954"></a>
+<a name="id760531"></a>
         <a class="link" href="single_pass_range.html#range.concepts.single_pass_range.associated_types">Associated
         types</a>
       </h5>
@@ -126,7 +126,7 @@
 </tbody>
 </table></div>
 <a name="range.concepts.single_pass_range.valid_expressions"></a><h5>
-<a name="id3265128"></a>
+<a name="id760701"></a>
         <a class="link" href="single_pass_range.html#range.concepts.single_pass_range.valid_expressions">Valid
         expressions</a>
       </h5>
@@ -198,7 +198,7 @@
 </tbody>
 </table></div>
 <a name="range.concepts.single_pass_range.expression_semantics"></a><h5>
-<a name="id3265461"></a>
+<a name="id761022"></a>
         <a class="link" href="single_pass_range.html#range.concepts.single_pass_range.expression_semantics">Expression
         semantics</a>
       </h5>
@@ -266,7 +266,7 @@
 </tbody>
 </table></div>
 <a name="range.concepts.single_pass_range.complexity_guarantees"></a><h5>
-<a name="id3265731"></a>
+<a name="id761284"></a>
         <a class="link" href="single_pass_range.html#range.concepts.single_pass_range.complexity_guarantees">Complexity
         guarantees</a>
       </h5>
@@ -276,7 +276,7 @@
         constant time.
       </p>
 <a name="range.concepts.single_pass_range.invariants"></a><h5>
-<a name="id3265815"></a>
+<a name="id761365"></a>
         <a class="link" href="single_pass_range.html#range.concepts.single_pass_range.invariants">Invariants</a>
       </h5>
 <div class="informaltable"><table class="table">
@@ -316,7 +316,7 @@
 </tbody>
 </table></div>
 <a name="range.concepts.single_pass_range.see_also"></a><h5>
-<a name="id3266086"></a>
+<a name="id761625"></a>
         <a class="link" href="single_pass_range.html#range.concepts.single_pass_range.see_also">See also</a>
       </h5>
 <p>
diff --git a/doc/html/range/history_ack.html b/doc/html/range/history_ack.html
index 66191b9..d64b6e1 100644
--- a/doc/html/range/history_ack.html
+++ b/doc/html/range/history_ack.html
@@ -26,7 +26,7 @@
 <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="id3400213"></a>
+<a name="id894720"></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>
@@ -79,7 +79,7 @@
       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="id3213698"></a>
+<a name="id894829"></a>
       <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>
diff --git a/doc/html/range/introduction.html b/doc/html/range/introduction.html
index 5ea6f50..b0ce921 100644
--- a/doc/html/range/introduction.html
+++ b/doc/html/range/introduction.html
@@ -70,7 +70,7 @@
         </li>
 </ul></div>
 <a name="range.introduction.example___iterate_over_the_values_in_a_map"></a><h4>
-<a name="id3215930"></a>
+<a name="id759844"></a>
       <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>
@@ -84,7 +84,7 @@
 <p>
     </p>
 <a name="range.introduction.example___iterate_over_the_keys_in_a_map"></a><h4>
-<a name="id3216055"></a>
+<a name="id759955"></a>
       <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>
@@ -98,7 +98,7 @@
 <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="id3213872"></a>
+<a name="id760072"></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
       - Push the even values from a map in reverse order into the container <code class="computeroutput"><span class="identifier">target</span></code></a>
     </h4>
diff --git a/doc/html/range/mfc_atl.html b/doc/html/range/mfc_atl.html
index 72221f9..9c2d65e 100644
--- a/doc/html/range/mfc_atl.html
+++ b/doc/html/range/mfc_atl.html
@@ -34,7 +34,7 @@
 <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="id3393805"></a>
+<a name="id888180"></a>
       <a class="link" href="mfc_atl.html#range.mfc_atl.introduction">Introduction</a>
     </h5>
 <p>
@@ -100,7 +100,7 @@
 </tbody>
 </table></div>
 <a name="range.mfc_atl.overview"></a><h5>
-<a name="id3393943"></a>
+<a name="id888317"></a>
       <a class="link" href="mfc_atl.html#range.mfc_atl.overview">Overview</a>
     </h5>
 <p>
diff --git a/doc/html/range/reference/adaptors/introduction.html b/doc/html/range/reference/adaptors/introduction.html
index bdf55ce..a049b13 100644
--- a/doc/html/range/reference/adaptors/introduction.html
+++ b/doc/html/range/reference/adaptors/introduction.html
@@ -122,7 +122,7 @@
           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="id3275775"></a>
+<a name="id771349"></a>
           <a class="link" href="introduction.html#range.reference.adaptors.introduction.composition_of_adaptors">Composition
           of Adaptors</a>
         </h6>
@@ -169,7 +169,7 @@
           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="id3276074"></a>
+<a name="id771666"></a>
           <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>
@@ -186,7 +186,7 @@
 <p>
         </p>
 <a name="range.reference.adaptors.introduction.range_adaptor_alternative_to_count_if_algorithm"></a><h6>
-<a name="id3276244"></a>
+<a name="id771832"></a>
           <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>
diff --git a/doc/html/range/reference/algorithms/heap/make_heap.html b/doc/html/range/reference/algorithms/heap/make_heap.html
index ce7157e..d241d0f 100644
--- a/doc/html/range/reference/algorithms/heap/make_heap.html
+++ b/doc/html/range/reference/algorithms/heap/make_heap.html
@@ -27,7 +27,7 @@
 <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="id3355962"></a>
+<a name="id850653"></a>
             <a class="link" href="make_heap.html#range.reference.algorithms.heap.make_heap.prototype">Prototype</a>
           </h6>
 <p>
@@ -48,7 +48,7 @@
 <p>
           </p>
 <a name="range.reference.algorithms.heap.make_heap.description"></a><h6>
-<a name="id3356341"></a>
+<a name="id851025"></a>
             <a class="link" href="make_heap.html#range.reference.algorithms.heap.make_heap.description">Description</a>
           </h6>
 <p>
@@ -60,14 +60,14 @@
             the predicate versions.
           </p>
 <a name="range.reference.algorithms.heap.make_heap.definition"></a><h6>
-<a name="id3356421"></a>
+<a name="id851103"></a>
             <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="id3356494"></a>
+<a name="id851174"></a>
             <a class="link" href="make_heap.html#range.reference.algorithms.heap.make_heap.requirements">Requirements</a>
           </h6>
 <p>
@@ -118,7 +118,7 @@
               </li>
 </ul></div>
 <a name="range.reference.algorithms.heap.make_heap.complexity"></a><h6>
-<a name="id3356755"></a>
+<a name="id851432"></a>
             <a class="link" href="make_heap.html#range.reference.algorithms.heap.make_heap.complexity">Complexity</a>
           </h6>
 <p>
diff --git a/doc/html/range/reference/algorithms/heap/pop_heap.html b/doc/html/range/reference/algorithms/heap/pop_heap.html
index b00c3ac..0fc429c 100644
--- a/doc/html/range/reference/algorithms/heap/pop_heap.html
+++ b/doc/html/range/reference/algorithms/heap/pop_heap.html
@@ -27,7 +27,7 @@
 <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="id3354924"></a>
+<a name="id849634"></a>
             <a class="link" href="pop_heap.html#range.reference.algorithms.heap.pop_heap.prototype">Prototype</a>
           </h6>
 <p>
@@ -48,7 +48,7 @@
 <p>
           </p>
 <a name="range.reference.algorithms.heap.pop_heap.description"></a><h6>
-<a name="id3355304"></a>
+<a name="id850006"></a>
             <a class="link" href="pop_heap.html#range.reference.algorithms.heap.pop_heap.description">Description</a>
           </h6>
 <p>
@@ -62,14 +62,14 @@
             the predicate versions.
           </p>
 <a name="range.reference.algorithms.heap.pop_heap.definition"></a><h6>
-<a name="id3355464"></a>
+<a name="id850161"></a>
             <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="id3355535"></a>
+<a name="id850232"></a>
             <a class="link" href="pop_heap.html#range.reference.algorithms.heap.pop_heap.requirements">Requirements</a>
           </h6>
 <p>
@@ -120,7 +120,7 @@
               </li>
 </ul></div>
 <a name="range.reference.algorithms.heap.pop_heap.precondition_"></a><h6>
-<a name="id3355796"></a>
+<a name="id850490"></a>
             <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">
@@ -132,7 +132,7 @@
               </li>
 </ul></div>
 <a name="range.reference.algorithms.heap.pop_heap.complexity"></a><h6>
-<a name="id3355874"></a>
+<a name="id850566"></a>
             <a class="link" href="pop_heap.html#range.reference.algorithms.heap.pop_heap.complexity">Complexity</a>
           </h6>
 <p>
diff --git a/doc/html/range/reference/algorithms/heap/push_heap.html b/doc/html/range/reference/algorithms/heap/push_heap.html
index ece6dbf..7b304da 100644
--- a/doc/html/range/reference/algorithms/heap/push_heap.html
+++ b/doc/html/range/reference/algorithms/heap/push_heap.html
@@ -27,7 +27,7 @@
 <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="id3353848"></a>
+<a name="id848577"></a>
             <a class="link" href="push_heap.html#range.reference.algorithms.heap.push_heap.prototype">Prototype</a>
           </h6>
 <p>
@@ -48,7 +48,7 @@
 <p>
           </p>
 <a name="range.reference.algorithms.heap.push_heap.description"></a><h6>
-<a name="id3354226"></a>
+<a name="id848948"></a>
             <a class="link" href="push_heap.html#range.reference.algorithms.heap.push_heap.description">Description</a>
           </h6>
 <p>
@@ -62,14 +62,14 @@
             the predicate versions.
           </p>
 <a name="range.reference.algorithms.heap.push_heap.definition"></a><h6>
-<a name="id3354389"></a>
+<a name="id849108"></a>
             <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="id3354462"></a>
+<a name="id849179"></a>
             <a class="link" href="push_heap.html#range.reference.algorithms.heap.push_heap.requirements">Requirements</a>
           </h6>
 <p>
@@ -120,7 +120,7 @@
               </li>
 </ul></div>
 <a name="range.reference.algorithms.heap.push_heap.precondition_"></a><h6>
-<a name="id3354723"></a>
+<a name="id849437"></a>
             <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">
@@ -132,7 +132,7 @@
               </li>
 </ul></div>
 <a name="range.reference.algorithms.heap.push_heap.complexity"></a><h6>
-<a name="id3354847"></a>
+<a name="id849557"></a>
             <a class="link" href="push_heap.html#range.reference.algorithms.heap.push_heap.complexity">Complexity</a>
           </h6>
 <p>
diff --git a/doc/html/range/reference/algorithms/heap/sort_heap.html b/doc/html/range/reference/algorithms/heap/sort_heap.html
index 77a5dab..36ac8dc 100644
--- a/doc/html/range/reference/algorithms/heap/sort_heap.html
+++ b/doc/html/range/reference/algorithms/heap/sort_heap.html
@@ -27,7 +27,7 @@
 <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="id3356834"></a>
+<a name="id851509"></a>
             <a class="link" href="sort_heap.html#range.reference.algorithms.heap.sort_heap.prototype">Prototype</a>
           </h6>
 <p>
@@ -48,7 +48,7 @@
 <p>
           </p>
 <a name="range.reference.algorithms.heap.sort_heap.description"></a><h6>
-<a name="id3357213"></a>
+<a name="id851881"></a>
             <a class="link" href="sort_heap.html#range.reference.algorithms.heap.sort_heap.description">Description</a>
           </h6>
 <p>
@@ -61,14 +61,14 @@
             the predicate versions.
           </p>
 <a name="range.reference.algorithms.heap.sort_heap.definition"></a><h6>
-<a name="id3357282"></a>
+<a name="id851948"></a>
             <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="id3357353"></a>
+<a name="id852018"></a>
             <a class="link" href="sort_heap.html#range.reference.algorithms.heap.sort_heap.requirements">Requirements</a>
           </h6>
 <p>
@@ -119,14 +119,14 @@
               </li>
 </ul></div>
 <a name="range.reference.algorithms.heap.sort_heap.precondition_"></a><h6>
-<a name="id3357614"></a>
+<a name="id852276"></a>
             <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="id3357651"></a>
+<a name="id852312"></a>
             <a class="link" href="sort_heap.html#range.reference.algorithms.heap.sort_heap.complexity">Complexity</a>
           </h6>
 <p>
diff --git a/doc/html/range/reference/algorithms/mutating/copy.html b/doc/html/range/reference/algorithms/mutating/copy.html
index 671e761..8aabe6a 100644
--- a/doc/html/range/reference/algorithms/mutating/copy.html
+++ b/doc/html/range/reference/algorithms/mutating/copy.html
@@ -27,7 +27,7 @@
 <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="id3297033"></a>
+<a name="id792360"></a>
             <a class="link" href="copy.html#range.reference.algorithms.mutating.copy.prototype">Prototype</a>
           </h6>
 <p>
@@ -39,7 +39,7 @@
 <p>
           </p>
 <a name="range.reference.algorithms.mutating.copy.description"></a><h6>
-<a name="id3297162"></a>
+<a name="id792486"></a>
             <a class="link" href="copy.html#range.reference.algorithms.mutating.copy.description">Description</a>
           </h6>
 <p>
@@ -50,14 +50,14 @@
             <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="id3297296"></a>
+<a name="id792616"></a>
             <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="id3297367"></a>
+<a name="id792686"></a>
             <a class="link" href="copy.html#range.reference.algorithms.mutating.copy.requirements">Requirements</a>
           </h6>
 <div class="itemizedlist"><ul class="itemizedlist" type="disc">
@@ -78,7 +78,7 @@
               </li>
 </ul></div>
 <a name="range.reference.algorithms.mutating.copy.precondition_"></a><h6>
-<a name="id3297485"></a>
+<a name="id792803"></a>
             <a class="link" href="copy.html#range.reference.algorithms.mutating.copy.precondition_">Precondition:</a>
           </h6>
 <div class="itemizedlist"><ul class="itemizedlist" type="disc">
@@ -92,7 +92,7 @@
               </li>
 </ul></div>
 <a name="range.reference.algorithms.mutating.copy.complexity"></a><h6>
-<a name="id3297596"></a>
+<a name="id792911"></a>
             <a class="link" href="copy.html#range.reference.algorithms.mutating.copy.complexity">Complexity</a>
           </h6>
 <p>
diff --git a/doc/html/range/reference/algorithms/mutating/copy_backward.html b/doc/html/range/reference/algorithms/mutating/copy_backward.html
index 7c909c1..6450b6a 100644
--- a/doc/html/range/reference/algorithms/mutating/copy_backward.html
+++ b/doc/html/range/reference/algorithms/mutating/copy_backward.html
@@ -28,7 +28,7 @@
           copy_backward</a>
 </h5></div></div></div>
 <a name="range.reference.algorithms.mutating.copy_backward.prototype"></a><h6>
-<a name="id3297663"></a>
+<a name="id792980"></a>
             <a class="link" href="copy_backward.html#range.reference.algorithms.mutating.copy_backward.prototype">Prototype</a>
           </h6>
 <p>
@@ -42,7 +42,7 @@
 <p>
           </p>
 <a name="range.reference.algorithms.mutating.copy_backward.description"></a><h6>
-<a name="id3297796"></a>
+<a name="id793107"></a>
             <a class="link" href="copy_backward.html#range.reference.algorithms.mutating.copy_backward.description">Description</a>
           </h6>
 <p>
@@ -60,14 +60,14 @@
             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="id3297955"></a>
+<a name="id793262"></a>
             <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="id3298028"></a>
+<a name="id793332"></a>
             <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">
@@ -88,7 +88,7 @@
               </li>
 </ul></div>
 <a name="range.reference.algorithms.mutating.copy_backward.precondition_"></a><h6>
-<a name="id3298146"></a>
+<a name="id793449"></a>
             <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">
@@ -102,7 +102,7 @@
               </li>
 </ul></div>
 <a name="range.reference.algorithms.mutating.copy_backward.complexity"></a><h6>
-<a name="id3298257"></a>
+<a name="id793557"></a>
             <a class="link" href="copy_backward.html#range.reference.algorithms.mutating.copy_backward.complexity">Complexity</a>
           </h6>
 <p>
diff --git a/doc/html/range/reference/algorithms/mutating/fill.html b/doc/html/range/reference/algorithms/mutating/fill.html
index 013fa91..f3130ae 100644
--- a/doc/html/range/reference/algorithms/mutating/fill.html
+++ b/doc/html/range/reference/algorithms/mutating/fill.html
@@ -27,7 +27,7 @@
 <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="id3298327"></a>
+<a name="id793624"></a>
             <a class="link" href="fill.html#range.reference.algorithms.mutating.fill.prototype">Prototype</a>
           </h6>
 <p>
@@ -39,7 +39,7 @@
 <p>
           </p>
 <a name="range.reference.algorithms.mutating.fill.description"></a><h6>
-<a name="id3298466"></a>
+<a name="id793761"></a>
             <a class="link" href="fill.html#range.reference.algorithms.mutating.fill.description">Description</a>
           </h6>
 <p>
@@ -48,14 +48,14 @@
             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="id3298524"></a>
+<a name="id793817"></a>
             <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="id3298595"></a>
+<a name="id793887"></a>
             <a class="link" href="fill.html#range.reference.algorithms.mutating.fill.requirements">Requirements</a>
           </h6>
 <div class="itemizedlist"><ul class="itemizedlist" type="disc">
@@ -78,7 +78,7 @@
               </li>
 </ul></div>
 <a name="range.reference.algorithms.mutating.fill.complexity"></a><h6>
-<a name="id3298723"></a>
+<a name="id794011"></a>
             <a class="link" href="fill.html#range.reference.algorithms.mutating.fill.complexity">Complexity</a>
           </h6>
 <p>
diff --git a/doc/html/range/reference/algorithms/mutating/fill_n.html b/doc/html/range/reference/algorithms/mutating/fill_n.html
index a37bd29..50abf67 100644
--- a/doc/html/range/reference/algorithms/mutating/fill_n.html
+++ b/doc/html/range/reference/algorithms/mutating/fill_n.html
@@ -27,7 +27,7 @@
 <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="id3298789"></a>
+<a name="id794078"></a>
             <a class="link" href="fill_n.html#range.reference.algorithms.mutating.fill_n.prototype">Prototype</a>
           </h6>
 <p>
@@ -39,7 +39,7 @@
 <p>
           </p>
 <a name="range.reference.algorithms.mutating.fill_n.description"></a><h6>
-<a name="id3298962"></a>
+<a name="id794246"></a>
             <a class="link" href="fill_n.html#range.reference.algorithms.mutating.fill_n.description">Description</a>
           </h6>
 <p>
@@ -47,14 +47,14 @@
             <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="id3299063"></a>
+<a name="id794344"></a>
             <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="id3299135"></a>
+<a name="id794414"></a>
             <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">
@@ -77,7 +77,7 @@
               </li>
 </ul></div>
 <a name="range.reference.algorithms.mutating.fill_n.complexity"></a><h6>
-<a name="id3299262"></a>
+<a name="id794538"></a>
             <a class="link" href="fill_n.html#range.reference.algorithms.mutating.fill_n.complexity">Complexity</a>
           </h6>
 <p>
diff --git a/doc/html/range/reference/algorithms/mutating/generate.html b/doc/html/range/reference/algorithms/mutating/generate.html
index a81fca5..b53a312 100644
--- a/doc/html/range/reference/algorithms/mutating/generate.html
+++ b/doc/html/range/reference/algorithms/mutating/generate.html
@@ -27,7 +27,7 @@
 <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="id3299317"></a>
+<a name="id794592"></a>
             <a class="link" href="generate.html#range.reference.algorithms.mutating.generate.prototype">Prototype</a>
           </h6>
 <p>
@@ -42,7 +42,7 @@
 <p>
           </p>
 <a name="range.reference.algorithms.mutating.generate.description"></a><h6>
-<a name="id3299558"></a>
+<a name="id794827"></a>
             <a class="link" href="generate.html#range.reference.algorithms.mutating.generate.description">Description</a>
           </h6>
 <p>
@@ -52,14 +52,14 @@
             Returns the resultant range.
           </p>
 <a name="range.reference.algorithms.mutating.generate.definition"></a><h6>
-<a name="id3299621"></a>
+<a name="id794889"></a>
             <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="id3299693"></a>
+<a name="id794958"></a>
             <a class="link" href="generate.html#range.reference.algorithms.mutating.generate.requirements">Requirements</a>
           </h6>
 <div class="itemizedlist"><ul class="itemizedlist" type="disc">
@@ -83,7 +83,7 @@
               </li>
 </ul></div>
 <a name="range.reference.algorithms.mutating.generate.precondition_"></a><h6>
-<a name="id3299832"></a>
+<a name="id795093"></a>
             <a class="link" href="generate.html#range.reference.algorithms.mutating.generate.precondition_">Precondition:</a>
           </h6>
 <div class="itemizedlist"><ul class="itemizedlist" type="disc">
@@ -97,7 +97,7 @@
               </li>
 </ul></div>
 <a name="range.reference.algorithms.mutating.generate.complexity"></a><h6>
-<a name="id3299942"></a>
+<a name="id795201"></a>
             <a class="link" href="generate.html#range.reference.algorithms.mutating.generate.complexity">Complexity</a>
           </h6>
 <p>
diff --git a/doc/html/range/reference/algorithms/mutating/inplace_merge.html b/doc/html/range/reference/algorithms/mutating/inplace_merge.html
index b77680d..8980d1a 100644
--- a/doc/html/range/reference/algorithms/mutating/inplace_merge.html
+++ b/doc/html/range/reference/algorithms/mutating/inplace_merge.html
@@ -28,7 +28,7 @@
           inplace_merge</a>
 </h5></div></div></div>
 <a name="range.reference.algorithms.mutating.inplace_merge.prototype"></a><h6>
-<a name="id3300009"></a>
+<a name="id795269"></a>
             <a class="link" href="inplace_merge.html#range.reference.algorithms.mutating.inplace_merge.prototype">Prototype</a>
           </h6>
 <p>
@@ -59,7 +59,7 @@
 <p>
           </p>
 <a name="range.reference.algorithms.mutating.inplace_merge.description"></a><h6>
-<a name="id3300574"></a>
+<a name="id795819"></a>
             <a class="link" href="inplace_merge.html#range.reference.algorithms.mutating.inplace_merge.description">Description</a>
           </h6>
 <p>
@@ -72,14 +72,14 @@
             input range is preserved.
           </p>
 <a name="range.reference.algorithms.mutating.inplace_merge.definition"></a><h6>
-<a name="id3300799"></a>
+<a name="id796037"></a>
             <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="id3300872"></a>
+<a name="id796108"></a>
             <a class="link" href="inplace_merge.html#range.reference.algorithms.mutating.inplace_merge.requirements">Requirements</a>
           </h6>
 <p>
@@ -116,11 +116,11 @@
             argument types.
           </p>
 <a name="range.reference.algorithms.mutating.inplace_merge.precondition_"></a><h6>
-<a name="id3301140"></a>
+<a name="id796370"></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.for_the_non_predicate_version_"></a><h6>
-<a name="id3301163"></a>
+<a name="id796394"></a>
             <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>
@@ -143,7 +143,7 @@
               </li>
 </ul></div>
 <a name="range.reference.algorithms.mutating.inplace_merge.for_the_predicate_version_"></a><h6>
-<a name="id3301433"></a>
+<a name="id796657"></a>
             <a class="link" href="inplace_merge.html#range.reference.algorithms.mutating.inplace_merge.for_the_predicate_version_">For
             the predicate version:</a>
           </h6>
@@ -164,7 +164,7 @@
               </li>
 </ul></div>
 <a name="range.reference.algorithms.mutating.inplace_merge.complexity"></a><h6>
-<a name="id3301724"></a>
+<a name="id796940"></a>
             <a class="link" href="inplace_merge.html#range.reference.algorithms.mutating.inplace_merge.complexity">Complexity</a>
           </h6>
 <p>
diff --git a/doc/html/range/reference/algorithms/mutating/merge.html b/doc/html/range/reference/algorithms/mutating/merge.html
index 7fc40e8..83e88b7 100644
--- a/doc/html/range/reference/algorithms/mutating/merge.html
+++ b/doc/html/range/reference/algorithms/mutating/merge.html
@@ -27,7 +27,7 @@
 <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="id3301807"></a>
+<a name="id797020"></a>
             <a class="link" href="merge.html#range.reference.algorithms.mutating.merge.prototype">Prototype</a>
           </h6>
 <p>
@@ -56,7 +56,7 @@
 <p>
           </p>
 <a name="range.reference.algorithms.mutating.merge.description"></a><h6>
-<a name="id3302156"></a>
+<a name="id797362"></a>
             <a class="link" href="merge.html#range.reference.algorithms.mutating.merge.description">Description</a>
           </h6>
 <p>
@@ -75,14 +75,14 @@
             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="id3302337"></a>
+<a name="id797539"></a>
             <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="id3302410"></a>
+<a name="id797610"></a>
             <a class="link" href="merge.html#range.reference.algorithms.mutating.merge.requirements">Requirements</a>
           </h6>
 <p>
@@ -150,11 +150,11 @@
               </li>
 </ul></div>
 <a name="range.reference.algorithms.mutating.merge.precondition_"></a><h6>
-<a name="id3302953"></a>
+<a name="id798144"></a>
             <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="id3302976"></a>
+<a name="id798168"></a>
             <a class="link" href="merge.html#range.reference.algorithms.mutating.merge.for_the_non_predicate_version_">For
             the non-predicate version:</a>
           </h6>
@@ -194,7 +194,7 @@
               </li>
 </ul></div>
 <a name="range.reference.algorithms.mutating.merge.for_the_predicate_version_"></a><h6>
-<a name="id3303453"></a>
+<a name="id798633"></a>
             <a class="link" href="merge.html#range.reference.algorithms.mutating.merge.for_the_predicate_version_">For
             the predicate version:</a>
           </h6>
@@ -230,7 +230,7 @@
               </li>
 </ul></div>
 <a name="range.reference.algorithms.mutating.merge.complexity"></a><h6>
-<a name="id3303954"></a>
+<a name="id799119"></a>
             <a class="link" href="merge.html#range.reference.algorithms.mutating.merge.complexity">Complexity</a>
           </h6>
 <p>
diff --git a/doc/html/range/reference/algorithms/mutating/nth_element.html b/doc/html/range/reference/algorithms/mutating/nth_element.html
index 1f3b2ef..bd42f1f 100644
--- a/doc/html/range/reference/algorithms/mutating/nth_element.html
+++ b/doc/html/range/reference/algorithms/mutating/nth_element.html
@@ -28,7 +28,7 @@
           nth_element</a>
 </h5></div></div></div>
 <a name="range.reference.algorithms.mutating.nth_element.prototype"></a><h6>
-<a name="id3304080"></a>
+<a name="id799243"></a>
             <a class="link" href="nth_element.html#range.reference.algorithms.mutating.nth_element.prototype">Prototype</a>
           </h6>
 <p>
@@ -59,7 +59,7 @@
 <p>
           </p>
 <a name="range.reference.algorithms.mutating.nth_element.description"></a><h6>
-<a name="id3304606"></a>
+<a name="id799756"></a>
             <a class="link" href="nth_element.html#range.reference.algorithms.mutating.nth_element.description">Description</a>
           </h6>
 <p>
@@ -70,14 +70,14 @@
             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="id3304688"></a>
+<a name="id799836"></a>
             <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="id3304761"></a>
+<a name="id799906"></a>
             <a class="link" href="nth_element.html#range.reference.algorithms.mutating.nth_element.requirements">Requirements</a>
           </h6>
 <p>
@@ -128,7 +128,7 @@
               </li>
 </ul></div>
 <a name="range.reference.algorithms.mutating.nth_element.complexity"></a><h6>
-<a name="id3305021"></a>
+<a name="id800163"></a>
             <a class="link" href="nth_element.html#range.reference.algorithms.mutating.nth_element.complexity">Complexity</a>
           </h6>
 <p>
diff --git a/doc/html/range/reference/algorithms/mutating/partial_sort.html b/doc/html/range/reference/algorithms/mutating/partial_sort.html
index 57faa7d..c0445f4 100644
--- a/doc/html/range/reference/algorithms/mutating/partial_sort.html
+++ b/doc/html/range/reference/algorithms/mutating/partial_sort.html
@@ -28,7 +28,7 @@
           partial_sort</a>
 </h5></div></div></div>
 <a name="range.reference.algorithms.mutating.partial_sort.prototype"></a><h6>
-<a name="id3305088"></a>
+<a name="id800229"></a>
             <a class="link" href="partial_sort.html#range.reference.algorithms.mutating.partial_sort.prototype">Prototype</a>
           </h6>
 <p>
@@ -59,7 +59,7 @@
 <p>
           </p>
 <a name="range.reference.algorithms.mutating.partial_sort.description"></a><h6>
-<a name="id3305615"></a>
+<a name="id800744"></a>
             <a class="link" href="partial_sort.html#range.reference.algorithms.mutating.partial_sort.description">Description</a>
           </h6>
 <p>
@@ -75,14 +75,14 @@
             predicate instead.
           </p>
 <a name="range.reference.algorithms.mutating.partial_sort.definition"></a><h6>
-<a name="id3305798"></a>
+<a name="id800922"></a>
             <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="id3305872"></a>
+<a name="id800992"></a>
             <a class="link" href="partial_sort.html#range.reference.algorithms.mutating.partial_sort.requirements">Requirements</a>
           </h6>
 <p>
@@ -133,7 +133,7 @@
               </li>
 </ul></div>
 <a name="range.reference.algorithms.mutating.partial_sort.complexity"></a><h6>
-<a name="id3306131"></a>
+<a name="id801250"></a>
             <a class="link" href="partial_sort.html#range.reference.algorithms.mutating.partial_sort.complexity">Complexity</a>
           </h6>
 <p>
diff --git a/doc/html/range/reference/algorithms/mutating/partition.html b/doc/html/range/reference/algorithms/mutating/partition.html
index 597612c..0cdf0d9 100644
--- a/doc/html/range/reference/algorithms/mutating/partition.html
+++ b/doc/html/range/reference/algorithms/mutating/partition.html
@@ -27,7 +27,7 @@
 <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="id3306251"></a>
+<a name="id801366"></a>
             <a class="link" href="partition.html#range.reference.algorithms.mutating.partition.prototype">Prototype</a>
           </h6>
 <p>
@@ -66,7 +66,7 @@
 <p>
           </p>
 <a name="range.reference.algorithms.mutating.partition.description"></a><h6>
-<a name="id3306834"></a>
+<a name="id801932"></a>
             <a class="link" href="partition.html#range.reference.algorithms.mutating.partition.description">Description</a>
           </h6>
 <p>
@@ -80,14 +80,14 @@
             corresponds to the middle iterator.
           </p>
 <a name="range.reference.algorithms.mutating.partition.definition"></a><h6>
-<a name="id3306918"></a>
+<a name="id802013"></a>
             <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="id3306990"></a>
+<a name="id802084"></a>
             <a class="link" href="partition.html#range.reference.algorithms.mutating.partition.requirements">Requirements</a>
           </h6>
 <div class="itemizedlist"><ul class="itemizedlist" type="disc">
@@ -107,7 +107,7 @@
               </li>
 </ul></div>
 <a name="range.reference.algorithms.mutating.partition.complexity"></a><h6>
-<a name="id3307099"></a>
+<a name="id802190"></a>
             <a class="link" href="partition.html#range.reference.algorithms.mutating.partition.complexity">Complexity</a>
           </h6>
 <p>
diff --git a/doc/html/range/reference/algorithms/mutating/random_shuffle.html b/doc/html/range/reference/algorithms/mutating/random_shuffle.html
index ece4438..ce742b5 100644
--- a/doc/html/range/reference/algorithms/mutating/random_shuffle.html
+++ b/doc/html/range/reference/algorithms/mutating/random_shuffle.html
@@ -28,7 +28,7 @@
           random_shuffle</a>
 </h5></div></div></div>
 <a name="range.reference.algorithms.mutating.random_shuffle.prototype"></a><h6>
-<a name="id3307214"></a>
+<a name="id802302"></a>
             <a class="link" href="random_shuffle.html#range.reference.algorithms.mutating.random_shuffle.prototype">Prototype</a>
           </h6>
 <p>
@@ -49,7 +49,7 @@
 <p>
           </p>
 <a name="range.reference.algorithms.mutating.random_shuffle.description"></a><h6>
-<a name="id3307604"></a>
+<a name="id802683"></a>
             <a class="link" href="random_shuffle.html#range.reference.algorithms.mutating.random_shuffle.description">Description</a>
           </h6>
 <p>
@@ -61,14 +61,14 @@
             the shuffles range.
           </p>
 <a name="range.reference.algorithms.mutating.random_shuffle.definition"></a><h6>
-<a name="id3307699"></a>
+<a name="id802775"></a>
             <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="id3307772"></a>
+<a name="id802845"></a>
             <a class="link" href="random_shuffle.html#range.reference.algorithms.mutating.random_shuffle.requirements">Requirements</a>
           </h6>
 <p>
@@ -99,7 +99,7 @@
               </li>
 </ul></div>
 <a name="range.reference.algorithms.mutating.random_shuffle.precondition_"></a><h6>
-<a name="id3307930"></a>
+<a name="id803004"></a>
             <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">
@@ -108,7 +108,7 @@
                 maximum value.
               </li></ul></div>
 <a name="range.reference.algorithms.mutating.random_shuffle.complexity"></a><h6>
-<a name="id3307998"></a>
+<a name="id803069"></a>
             <a class="link" href="random_shuffle.html#range.reference.algorithms.mutating.random_shuffle.complexity">Complexity</a>
           </h6>
 <p>
diff --git a/doc/html/range/reference/algorithms/mutating/remove.html b/doc/html/range/reference/algorithms/mutating/remove.html
index 58f2b6b..1017fa8 100644
--- a/doc/html/range/reference/algorithms/mutating/remove.html
+++ b/doc/html/range/reference/algorithms/mutating/remove.html
@@ -27,7 +27,7 @@
 <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="id3308106"></a>
+<a name="id803174"></a>
             <a class="link" href="remove.html#range.reference.algorithms.mutating.remove.prototype">Prototype</a>
           </h6>
 <p>
@@ -66,7 +66,7 @@
 <p>
           </p>
 <a name="range.reference.algorithms.mutating.remove.description"></a><h6>
-<a name="id3308725"></a>
+<a name="id804049"></a>
             <a class="link" href="remove.html#range.reference.algorithms.mutating.remove.description">Description</a>
           </h6>
 <p>
@@ -83,14 +83,14 @@
             are dereferenceable, but the elements are unspecified.
           </p>
 <a name="range.reference.algorithms.mutating.remove.definition"></a><h6>
-<a name="id3308962"></a>
+<a name="id804277"></a>
             <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="id3309035"></a>
+<a name="id804348"></a>
             <a class="link" href="remove.html#range.reference.algorithms.mutating.remove.requirements">Requirements</a>
           </h6>
 <div class="itemizedlist"><ul class="itemizedlist" type="disc">
@@ -113,7 +113,7 @@
               </li>
 </ul></div>
 <a name="range.reference.algorithms.mutating.remove.complexity"></a><h6>
-<a name="id3309163"></a>
+<a name="id804473"></a>
             <a class="link" href="remove.html#range.reference.algorithms.mutating.remove.complexity">Complexity</a>
           </h6>
 <p>
diff --git a/doc/html/range/reference/algorithms/mutating/remove_copy.html b/doc/html/range/reference/algorithms/mutating/remove_copy.html
index c948593..9b69dec 100644
--- a/doc/html/range/reference/algorithms/mutating/remove_copy.html
+++ b/doc/html/range/reference/algorithms/mutating/remove_copy.html
@@ -28,7 +28,7 @@
           remove_copy</a>
 </h5></div></div></div>
 <a name="range.reference.algorithms.mutating.remove_copy.prototype"></a><h6>
-<a name="id3309242"></a>
+<a name="id804549"></a>
             <a class="link" href="remove_copy.html#range.reference.algorithms.mutating.remove_copy.prototype">Prototype</a>
           </h6>
 <p>
@@ -45,7 +45,7 @@
 <p>
           </p>
 <a name="range.reference.algorithms.mutating.remove_copy.description"></a><h6>
-<a name="id3309548"></a>
+<a name="id804847"></a>
             <a class="link" href="remove_copy.html#range.reference.algorithms.mutating.remove_copy.description">Description</a>
           </h6>
 <p>
@@ -54,14 +54,14 @@
             <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="id3309638"></a>
+<a name="id804934"></a>
             <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="id3309712"></a>
+<a name="id805004"></a>
             <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">
@@ -84,7 +84,7 @@
               </li>
 </ul></div>
 <a name="range.reference.algorithms.mutating.remove_copy.complexity"></a><h6>
-<a name="id3309838"></a>
+<a name="id805129"></a>
             <a class="link" href="remove_copy.html#range.reference.algorithms.mutating.remove_copy.complexity">Complexity</a>
           </h6>
 <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 d631aab..b21f8c9 100644
--- a/doc/html/range/reference/algorithms/mutating/remove_copy_if.html
+++ b/doc/html/range/reference/algorithms/mutating/remove_copy_if.html
@@ -28,7 +28,7 @@
           remove_copy_if</a>
 </h5></div></div></div>
 <a name="range.reference.algorithms.mutating.remove_copy_if.prototype"></a><h6>
-<a name="id3309919"></a>
+<a name="id805207"></a>
             <a class="link" href="remove_copy_if.html#range.reference.algorithms.mutating.remove_copy_if.prototype">Prototype</a>
           </h6>
 <p>
@@ -45,7 +45,7 @@
 <p>
           </p>
 <a name="range.reference.algorithms.mutating.remove_copy_if.description"></a><h6>
-<a name="id3310205"></a>
+<a name="id805484"></a>
             <a class="link" href="remove_copy_if.html#range.reference.algorithms.mutating.remove_copy_if.description">Description</a>
           </h6>
 <p>
@@ -55,14 +55,14 @@
             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="id3310298"></a>
+<a name="id805573"></a>
             <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="id3310371"></a>
+<a name="id805644"></a>
             <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">
@@ -80,7 +80,7 @@
               </li>
 </ul></div>
 <a name="range.reference.algorithms.mutating.remove_copy_if.complexity"></a><h6>
-<a name="id3310469"></a>
+<a name="id805740"></a>
             <a class="link" href="remove_copy_if.html#range.reference.algorithms.mutating.remove_copy_if.complexity">Complexity</a>
           </h6>
 <p>
diff --git a/doc/html/range/reference/algorithms/mutating/remove_if.html b/doc/html/range/reference/algorithms/mutating/remove_if.html
index 460b087..492ee63 100644
--- a/doc/html/range/reference/algorithms/mutating/remove_if.html
+++ b/doc/html/range/reference/algorithms/mutating/remove_if.html
@@ -27,7 +27,7 @@
 <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="id3310547"></a>
+<a name="id805817"></a>
             <a class="link" href="remove_if.html#range.reference.algorithms.mutating.remove_if.prototype">Prototype</a>
           </h6>
 <p>
@@ -66,7 +66,7 @@
 <p>
           </p>
 <a name="range.reference.algorithms.mutating.remove_if.description"></a><h6>
-<a name="id3311130"></a>
+<a name="id806381"></a>
             <a class="link" href="remove_if.html#range.reference.algorithms.mutating.remove_if.description">Description</a>
           </h6>
 <p>
@@ -82,14 +82,14 @@
             are unspecified.
           </p>
 <a name="range.reference.algorithms.mutating.remove_if.definition"></a><h6>
-<a name="id3311360"></a>
+<a name="id806604"></a>
             <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="id3311432"></a>
+<a name="id806676"></a>
             <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">
@@ -112,7 +112,7 @@
               </li>
 </ul></div>
 <a name="range.reference.algorithms.mutating.remove_if.complexity"></a><h6>
-<a name="id3311560"></a>
+<a name="id806800"></a>
             <a class="link" href="remove_if.html#range.reference.algorithms.mutating.remove_if.complexity">Complexity</a>
           </h6>
 <p>
diff --git a/doc/html/range/reference/algorithms/mutating/replace.html b/doc/html/range/reference/algorithms/mutating/replace.html
index efd4c78..c68005f 100644
--- a/doc/html/range/reference/algorithms/mutating/replace.html
+++ b/doc/html/range/reference/algorithms/mutating/replace.html
@@ -27,7 +27,7 @@
 <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="id3311650"></a>
+<a name="id806888"></a>
             <a class="link" href="replace.html#range.reference.algorithms.mutating.replace.prototype">Prototype</a>
           </h6>
 <p>
@@ -48,7 +48,7 @@
 <p>
           </p>
 <a name="range.reference.algorithms.mutating.replace.description"></a><h6>
-<a name="id3311965"></a>
+<a name="id807195"></a>
             <a class="link" href="replace.html#range.reference.algorithms.mutating.replace.description">Description</a>
           </h6>
 <p>
@@ -57,14 +57,14 @@
             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="id3312045"></a>
+<a name="id807272"></a>
             <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="id3312117"></a>
+<a name="id807342"></a>
             <a class="link" href="replace.html#range.reference.algorithms.mutating.replace.requirements">Requirements</a>
           </h6>
 <div class="itemizedlist"><ul class="itemizedlist" type="disc">
@@ -93,7 +93,7 @@
               </li>
 </ul></div>
 <a name="range.reference.algorithms.mutating.replace.complexity"></a><h6>
-<a name="id3312284"></a>
+<a name="id807505"></a>
             <a class="link" href="replace.html#range.reference.algorithms.mutating.replace.complexity">Complexity</a>
           </h6>
 <p>
diff --git a/doc/html/range/reference/algorithms/mutating/replace_copy.html b/doc/html/range/reference/algorithms/mutating/replace_copy.html
index ccc4e22..41b3d07 100644
--- a/doc/html/range/reference/algorithms/mutating/replace_copy.html
+++ b/doc/html/range/reference/algorithms/mutating/replace_copy.html
@@ -28,7 +28,7 @@
           replace_copy</a>
 </h5></div></div></div>
 <a name="range.reference.algorithms.mutating.replace_copy.prototype"></a><h6>
-<a name="id3312389"></a>
+<a name="id807608"></a>
             <a class="link" href="replace_copy.html#range.reference.algorithms.mutating.replace_copy.prototype">Prototype</a>
           </h6>
 <p>
@@ -41,7 +41,7 @@
 <p>
           </p>
 <a name="range.reference.algorithms.mutating.replace_copy.description"></a><h6>
-<a name="id3312588"></a>
+<a name="id807800"></a>
             <a class="link" href="replace_copy.html#range.reference.algorithms.mutating.replace_copy.description">Description</a>
           </h6>
 <p>
@@ -54,14 +54,14 @@
             <span class="identifier">x</span></code>.
           </p>
 <a name="range.reference.algorithms.mutating.replace_copy.definition"></a><h6>
-<a name="id3312702"></a>
+<a name="id807911"></a>
             <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="id3312771"></a>
+<a name="id807981"></a>
             <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">
@@ -88,7 +88,7 @@
               </li>
 </ul></div>
 <a name="range.reference.algorithms.mutating.replace_copy.complexity"></a><h6>
-<a name="id3312931"></a>
+<a name="id808134"></a>
             <a class="link" href="replace_copy.html#range.reference.algorithms.mutating.replace_copy.complexity">Complexity</a>
           </h6>
 <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 60f4f9c..1d9be73 100644
--- a/doc/html/range/reference/algorithms/mutating/replace_copy_if.html
+++ b/doc/html/range/reference/algorithms/mutating/replace_copy_if.html
@@ -28,7 +28,7 @@
           replace_copy_if</a>
 </h5></div></div></div>
 <a name="range.reference.algorithms.mutating.replace_copy_if.prototype"></a><h6>
-<a name="id3313012"></a>
+<a name="id808213"></a>
             <a class="link" href="replace_copy_if.html#range.reference.algorithms.mutating.replace_copy_if.prototype">Prototype</a>
           </h6>
 <p>
@@ -41,7 +41,7 @@
 <p>
           </p>
 <a name="range.reference.algorithms.mutating.replace_copy_if.description"></a><h6>
-<a name="id3313216"></a>
+<a name="id808410"></a>
             <a class="link" href="replace_copy_if.html#range.reference.algorithms.mutating.replace_copy_if.description">Description</a>
           </h6>
 <p>
@@ -52,14 +52,14 @@
             <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="id3313332"></a>
+<a name="id808523"></a>
             <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="id3313406"></a>
+<a name="id808596"></a>
             <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">
@@ -90,7 +90,7 @@
               </li>
 </ul></div>
 <a name="range.reference.algorithms.mutating.replace_copy_if.complexity"></a><h6>
-<a name="id3313592"></a>
+<a name="id808776"></a>
             <a class="link" href="replace_copy_if.html#range.reference.algorithms.mutating.replace_copy_if.complexity">Complexity</a>
           </h6>
 <p>
diff --git a/doc/html/range/reference/algorithms/mutating/replace_if.html b/doc/html/range/reference/algorithms/mutating/replace_if.html
index 293ae92..9730e67 100644
--- a/doc/html/range/reference/algorithms/mutating/replace_if.html
+++ b/doc/html/range/reference/algorithms/mutating/replace_if.html
@@ -28,7 +28,7 @@
           replace_if</a>
 </h5></div></div></div>
 <a name="range.reference.algorithms.mutating.replace_if.prototype"></a><h6>
-<a name="id3313682"></a>
+<a name="id808864"></a>
             <a class="link" href="replace_if.html#range.reference.algorithms.mutating.replace_if.prototype">Prototype</a>
           </h6>
 <p>
@@ -43,7 +43,7 @@
 <p>
           </p>
 <a name="range.reference.algorithms.mutating.replace_if.description"></a><h6>
-<a name="id3314004"></a>
+<a name="id809176"></a>
             <a class="link" href="replace_if.html#range.reference.algorithms.mutating.replace_if.description">Description</a>
           </h6>
 <p>
@@ -52,14 +52,14 @@
             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="id3314119"></a>
+<a name="id809288"></a>
             <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="id3314191"></a>
+<a name="id809358"></a>
             <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">
@@ -91,7 +91,7 @@
               </li>
 </ul></div>
 <a name="range.reference.algorithms.mutating.replace_if.complexity"></a><h6>
-<a name="id3314376"></a>
+<a name="id809539"></a>
             <a class="link" href="replace_if.html#range.reference.algorithms.mutating.replace_if.complexity">Complexity</a>
           </h6>
 <p>
diff --git a/doc/html/range/reference/algorithms/mutating/reverse.html b/doc/html/range/reference/algorithms/mutating/reverse.html
index 253d901..c32a5ea 100644
--- a/doc/html/range/reference/algorithms/mutating/reverse.html
+++ b/doc/html/range/reference/algorithms/mutating/reverse.html
@@ -27,7 +27,7 @@
 <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="id3314490"></a>
+<a name="id809650"></a>
             <a class="link" href="reverse.html#range.reference.algorithms.mutating.reverse.prototype">Prototype</a>
           </h6>
 <p>
@@ -42,7 +42,7 @@
 <p>
           </p>
 <a name="range.reference.algorithms.mutating.reverse.description"></a><h6>
-<a name="id3314664"></a>
+<a name="id809821"></a>
             <a class="link" href="reverse.html#range.reference.algorithms.mutating.reverse.description">Description</a>
           </h6>
 <p>
@@ -50,14 +50,14 @@
             Returns a reference to the reversed range.
           </p>
 <a name="range.reference.algorithms.mutating.reverse.definition"></a><h6>
-<a name="id3314702"></a>
+<a name="id809858"></a>
             <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="id3314774"></a>
+<a name="id809929"></a>
             <a class="link" href="reverse.html#range.reference.algorithms.mutating.reverse.requirements">Requirements</a>
           </h6>
 <div class="itemizedlist"><ul class="itemizedlist" type="disc">
@@ -72,7 +72,7 @@
               </li>
 </ul></div>
 <a name="range.reference.algorithms.mutating.reverse.complexity"></a><h6>
-<a name="id3314843"></a>
+<a name="id809998"></a>
             <a class="link" href="reverse.html#range.reference.algorithms.mutating.reverse.complexity">Complexity</a>
           </h6>
 <p>
diff --git a/doc/html/range/reference/algorithms/mutating/reverse_copy.html b/doc/html/range/reference/algorithms/mutating/reverse_copy.html
index 4795437..3a94e8a 100644
--- a/doc/html/range/reference/algorithms/mutating/reverse_copy.html
+++ b/doc/html/range/reference/algorithms/mutating/reverse_copy.html
@@ -28,7 +28,7 @@
           reverse_copy</a>
 </h5></div></div></div>
 <a name="range.reference.algorithms.mutating.reverse_copy.prototype"></a><h6>
-<a name="id3314939"></a>
+<a name="id810092"></a>
             <a class="link" href="reverse_copy.html#range.reference.algorithms.mutating.reverse_copy.prototype">Prototype</a>
           </h6>
 <p>
@@ -40,7 +40,7 @@
 <p>
           </p>
 <a name="range.reference.algorithms.mutating.reverse_copy.description"></a><h6>
-<a name="id3315069"></a>
+<a name="id810218"></a>
             <a class="link" href="reverse_copy.html#range.reference.algorithms.mutating.reverse_copy.description">Description</a>
           </h6>
 <p>
@@ -50,14 +50,14 @@
             Returns the output iterator one passed the last copied element.
           </p>
 <a name="range.reference.algorithms.mutating.reverse_copy.definition"></a><h6>
-<a name="id3315129"></a>
+<a name="id810276"></a>
             <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="id3315202"></a>
+<a name="id810347"></a>
             <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">
@@ -76,7 +76,7 @@
               </li>
 </ul></div>
 <a name="range.reference.algorithms.mutating.reverse_copy.complexity"></a><h6>
-<a name="id3315300"></a>
+<a name="id810444"></a>
             <a class="link" href="reverse_copy.html#range.reference.algorithms.mutating.reverse_copy.complexity">Complexity</a>
           </h6>
 <p>
diff --git a/doc/html/range/reference/algorithms/mutating/rotate.html b/doc/html/range/reference/algorithms/mutating/rotate.html
index 9e7cbb4..1d4646c 100644
--- a/doc/html/range/reference/algorithms/mutating/rotate.html
+++ b/doc/html/range/reference/algorithms/mutating/rotate.html
@@ -27,7 +27,7 @@
 <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="id3315378"></a>
+<a name="id810521"></a>
             <a class="link" href="rotate.html#range.reference.algorithms.mutating.rotate.prototype">Prototype</a>
           </h6>
 <p>
@@ -44,7 +44,7 @@
 <p>
           </p>
 <a name="range.reference.algorithms.mutating.rotate.description"></a><h6>
-<a name="id3315639"></a>
+<a name="id810773"></a>
             <a class="link" href="rotate.html#range.reference.algorithms.mutating.rotate.description">Description</a>
           </h6>
 <p>
@@ -53,14 +53,14 @@
             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="id3315764"></a>
+<a name="id810896"></a>
             <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="id3315837"></a>
+<a name="id810967"></a>
             <a class="link" href="rotate.html#range.reference.algorithms.mutating.rotate.requirements">Requirements</a>
           </h6>
 <div class="itemizedlist"><ul class="itemizedlist" type="disc">
@@ -74,7 +74,7 @@
               </li>
 </ul></div>
 <a name="range.reference.algorithms.mutating.rotate.precondition_"></a><h6>
-<a name="id3315906"></a>
+<a name="id811034"></a>
             <a class="link" href="rotate.html#range.reference.algorithms.mutating.rotate.precondition_">Precondition:</a>
           </h6>
 <div class="itemizedlist"><ul class="itemizedlist" type="disc">
@@ -86,7 +86,7 @@
               </li>
 </ul></div>
 <a name="range.reference.algorithms.mutating.rotate.complexity"></a><h6>
-<a name="id3316023"></a>
+<a name="id811148"></a>
             <a class="link" href="rotate.html#range.reference.algorithms.mutating.rotate.complexity">Complexity</a>
           </h6>
 <p>
diff --git a/doc/html/range/reference/algorithms/mutating/rotate_copy.html b/doc/html/range/reference/algorithms/mutating/rotate_copy.html
index 53643bd..c1d3434 100644
--- a/doc/html/range/reference/algorithms/mutating/rotate_copy.html
+++ b/doc/html/range/reference/algorithms/mutating/rotate_copy.html
@@ -28,7 +28,7 @@
           rotate_copy</a>
 </h5></div></div></div>
 <a name="range.reference.algorithms.mutating.rotate_copy.prototype"></a><h6>
-<a name="id3316091"></a>
+<a name="id811215"></a>
             <a class="link" href="rotate_copy.html#range.reference.algorithms.mutating.rotate_copy.prototype">Prototype</a>
           </h6>
 <p>
@@ -43,7 +43,7 @@
 <p>
           </p>
 <a name="range.reference.algorithms.mutating.rotate_copy.description"></a><h6>
-<a name="id3316262"></a>
+<a name="id811381"></a>
             <a class="link" href="rotate_copy.html#range.reference.algorithms.mutating.rotate_copy.description">Description</a>
           </h6>
 <p>
@@ -52,14 +52,14 @@
             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="id3316386"></a>
+<a name="id811502"></a>
             <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="id3316460"></a>
+<a name="id811573"></a>
             <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">
@@ -77,7 +77,7 @@
               </li>
 </ul></div>
 <a name="range.reference.algorithms.mutating.rotate_copy.precondition_"></a><h6>
-<a name="id3316558"></a>
+<a name="id811669"></a>
             <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">
@@ -89,7 +89,7 @@
               </li>
 </ul></div>
 <a name="range.reference.algorithms.mutating.rotate_copy.complexity"></a><h6>
-<a name="id3316674"></a>
+<a name="id811781"></a>
             <a class="link" href="rotate_copy.html#range.reference.algorithms.mutating.rotate_copy.complexity">Complexity</a>
           </h6>
 <p>
diff --git a/doc/html/range/reference/algorithms/mutating/sort.html b/doc/html/range/reference/algorithms/mutating/sort.html
index fa727b8..aac3921 100644
--- a/doc/html/range/reference/algorithms/mutating/sort.html
+++ b/doc/html/range/reference/algorithms/mutating/sort.html
@@ -27,7 +27,7 @@
 <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="id3316742"></a>
+<a name="id811848"></a>
             <a class="link" href="sort.html#range.reference.algorithms.mutating.sort.prototype">Prototype</a>
           </h6>
 <p>
@@ -48,7 +48,7 @@
 <p>
           </p>
 <a name="range.reference.algorithms.mutating.sort.description"></a><h6>
-<a name="id3317122"></a>
+<a name="id812220"></a>
             <a class="link" href="sort.html#range.reference.algorithms.mutating.sort.description">Description</a>
           </h6>
 <p>
@@ -71,14 +71,14 @@
             <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="id3317374"></a>
+<a name="id812466"></a>
             <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="id3317446"></a>
+<a name="id812538"></a>
             <a class="link" href="sort.html#range.reference.algorithms.mutating.sort.requirements">Requirements</a>
           </h6>
 <p>
@@ -129,7 +129,7 @@
               </li>
 </ul></div>
 <a name="range.reference.algorithms.mutating.sort.complexity"></a><h6>
-<a name="id3317707"></a>
+<a name="id812795"></a>
             <a class="link" href="sort.html#range.reference.algorithms.mutating.sort.complexity">Complexity</a>
           </h6>
 <p>
diff --git a/doc/html/range/reference/algorithms/mutating/stable_partition.html b/doc/html/range/reference/algorithms/mutating/stable_partition.html
index 59a763d..8450d4c 100644
--- a/doc/html/range/reference/algorithms/mutating/stable_partition.html
+++ b/doc/html/range/reference/algorithms/mutating/stable_partition.html
@@ -28,7 +28,7 @@
           stable_partition</a>
 </h5></div></div></div>
 <a name="range.reference.algorithms.mutating.stable_partition.prototype"></a><h6>
-<a name="id3317825"></a>
+<a name="id812910"></a>
             <a class="link" href="stable_partition.html#range.reference.algorithms.mutating.stable_partition.prototype">Prototype</a>
           </h6>
 <p>
@@ -61,7 +61,7 @@
 <p>
           </p>
 <a name="range.reference.algorithms.mutating.stable_partition.description"></a><h6>
-<a name="id3318405"></a>
+<a name="id813474"></a>
             <a class="link" href="stable_partition.html#range.reference.algorithms.mutating.stable_partition.description">Description</a>
           </h6>
 <p>
@@ -83,14 +83,14 @@
             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="id3318556"></a>
+<a name="id813620"></a>
             <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="id3318629"></a>
+<a name="id813693"></a>
             <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">
@@ -108,7 +108,7 @@
               </li>
 </ul></div>
 <a name="range.reference.algorithms.mutating.stable_partition.complexity"></a><h6>
-<a name="id3318728"></a>
+<a name="id813788"></a>
             <a class="link" href="stable_partition.html#range.reference.algorithms.mutating.stable_partition.complexity">Complexity</a>
           </h6>
 <p>
diff --git a/doc/html/range/reference/algorithms/mutating/stable_sort.html b/doc/html/range/reference/algorithms/mutating/stable_sort.html
index 8d9a6c0..5bb61fb 100644
--- a/doc/html/range/reference/algorithms/mutating/stable_sort.html
+++ b/doc/html/range/reference/algorithms/mutating/stable_sort.html
@@ -28,7 +28,7 @@
           stable_sort</a>
 </h5></div></div></div>
 <a name="range.reference.algorithms.mutating.stable_sort.prototype"></a><h6>
-<a name="id3318901"></a>
+<a name="id813956"></a>
             <a class="link" href="stable_sort.html#range.reference.algorithms.mutating.stable_sort.prototype">Prototype</a>
           </h6>
 <p>
@@ -49,7 +49,7 @@
 <p>
           </p>
 <a name="range.reference.algorithms.mutating.stable_sort.description"></a><h6>
-<a name="id3319281"></a>
+<a name="id814328"></a>
             <a class="link" href="stable_sort.html#range.reference.algorithms.mutating.stable_sort.description">Description</a>
           </h6>
 <p>
@@ -72,14 +72,14 @@
             <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="id3319533"></a>
+<a name="id814573"></a>
             <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="id3319606"></a>
+<a name="id814643"></a>
             <a class="link" href="stable_sort.html#range.reference.algorithms.mutating.stable_sort.requirements">Requirements</a>
           </h6>
 <p>
@@ -130,7 +130,7 @@
               </li>
 </ul></div>
 <a name="range.reference.algorithms.mutating.stable_sort.complexity"></a><h6>
-<a name="id3319866"></a>
+<a name="id814900"></a>
             <a class="link" href="stable_sort.html#range.reference.algorithms.mutating.stable_sort.complexity">Complexity</a>
           </h6>
 <p>
diff --git a/doc/html/range/reference/algorithms/mutating/swap_ranges.html b/doc/html/range/reference/algorithms/mutating/swap_ranges.html
index 42e33ce..956694f 100644
--- a/doc/html/range/reference/algorithms/mutating/swap_ranges.html
+++ b/doc/html/range/reference/algorithms/mutating/swap_ranges.html
@@ -28,7 +28,7 @@
           swap_ranges</a>
 </h5></div></div></div>
 <a name="range.reference.algorithms.mutating.swap_ranges.prototype"></a><h6>
-<a name="id3320052"></a>
+<a name="id815081"></a>
             <a class="link" href="swap_ranges.html#range.reference.algorithms.mutating.swap_ranges.prototype">Prototype</a>
           </h6>
 <p>
@@ -40,7 +40,7 @@
 <p>
           </p>
 <a name="range.reference.algorithms.mutating.swap_ranges.description"></a><h6>
-<a name="id3320186"></a>
+<a name="id815212"></a>
             <a class="link" href="swap_ranges.html#range.reference.algorithms.mutating.swap_ranges.description">Description</a>
           </h6>
 <p>
@@ -50,14 +50,14 @@
             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="id3320277"></a>
+<a name="id815301"></a>
             <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="id3320350"></a>
+<a name="id815372"></a>
             <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">
@@ -81,7 +81,7 @@
               </li>
 </ul></div>
 <a name="range.reference.algorithms.mutating.swap_ranges.complexity"></a><h6>
-<a name="id3320463"></a>
+<a name="id815485"></a>
             <a class="link" href="swap_ranges.html#range.reference.algorithms.mutating.swap_ranges.complexity">Complexity</a>
           </h6>
 <p>
diff --git a/doc/html/range/reference/algorithms/mutating/transform.html b/doc/html/range/reference/algorithms/mutating/transform.html
index ca1a530..056255e 100644
--- a/doc/html/range/reference/algorithms/mutating/transform.html
+++ b/doc/html/range/reference/algorithms/mutating/transform.html
@@ -27,7 +27,7 @@
 <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="id3320533"></a>
+<a name="id815553"></a>
             <a class="link" href="transform.html#range.reference.algorithms.mutating.transform.prototype">Prototype</a>
           </h6>
 <p>
@@ -56,7 +56,7 @@
 <p>
           </p>
 <a name="range.reference.algorithms.mutating.transform.description"></a><h6>
-<a name="id3320872"></a>
+<a name="id815883"></a>
             <a class="link" href="transform.html#range.reference.algorithms.mutating.transform.description">Description</a>
           </h6>
 <p>
@@ -92,14 +92,14 @@
             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="id3321422"></a>
+<a name="id816417"></a>
             <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="id3321494"></a>
+<a name="id816488"></a>
             <a class="link" href="transform.html#range.reference.algorithms.mutating.transform.requirements">Requirements</a>
           </h6>
 <p>
@@ -169,7 +169,7 @@
               </li>
 </ul></div>
 <a name="range.reference.algorithms.mutating.transform.precondition_"></a><h6>
-<a name="id3321884"></a>
+<a name="id816872"></a>
             <a class="link" href="transform.html#range.reference.algorithms.mutating.transform.precondition_">Precondition:</a>
           </h6>
 <p>
@@ -203,7 +203,7 @@
               </li>
 </ul></div>
 <a name="range.reference.algorithms.mutating.transform.complexity"></a><h6>
-<a name="id3322316"></a>
+<a name="id817293"></a>
             <a class="link" href="transform.html#range.reference.algorithms.mutating.transform.complexity">Complexity</a>
           </h6>
 <p>
diff --git a/doc/html/range/reference/algorithms/mutating/unique.html b/doc/html/range/reference/algorithms/mutating/unique.html
index 7c0c1b8..2a7bae6 100644
--- a/doc/html/range/reference/algorithms/mutating/unique.html
+++ b/doc/html/range/reference/algorithms/mutating/unique.html
@@ -27,7 +27,7 @@
 <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="id3322436"></a>
+<a name="id817411"></a>
             <a class="link" href="unique.html#range.reference.algorithms.mutating.unique.prototype">Prototype</a>
           </h6>
 <p>
@@ -68,7 +68,7 @@
 <p>
           </p>
 <a name="range.reference.algorithms.mutating.unique.description"></a><h6>
-<a name="id3323468"></a>
+<a name="id818412"></a>
             <a class="link" href="unique.html#range.reference.algorithms.mutating.unique.description">Description</a>
           </h6>
 <p>
@@ -86,14 +86,14 @@
             type.
           </p>
 <a name="range.reference.algorithms.mutating.unique.definition"></a><h6>
-<a name="id3323591"></a>
+<a name="id818532"></a>
             <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="id3323664"></a>
+<a name="id818603"></a>
             <a class="link" href="unique.html#range.reference.algorithms.mutating.unique.requirements">Requirements</a>
           </h6>
 <p>
@@ -137,7 +137,7 @@
               </li>
 </ul></div>
 <a name="range.reference.algorithms.mutating.unique.complexity"></a><h6>
-<a name="id3323898"></a>
+<a name="id818831"></a>
             <a class="link" href="unique.html#range.reference.algorithms.mutating.unique.complexity">Complexity</a>
           </h6>
 <p>
diff --git a/doc/html/range/reference/algorithms/mutating/unique_copy.html b/doc/html/range/reference/algorithms/mutating/unique_copy.html
index b202b52..1b0c570 100644
--- a/doc/html/range/reference/algorithms/mutating/unique_copy.html
+++ b/doc/html/range/reference/algorithms/mutating/unique_copy.html
@@ -28,7 +28,7 @@
           unique_copy</a>
 </h5></div></div></div>
 <a name="range.reference.algorithms.mutating.unique_copy.prototype"></a><h6>
-<a name="id3324025"></a>
+<a name="id818955"></a>
             <a class="link" href="unique_copy.html#range.reference.algorithms.mutating.unique_copy.prototype">Prototype</a>
           </h6>
 <p>
@@ -43,7 +43,7 @@
 <p>
           </p>
 <a name="range.reference.algorithms.mutating.unique_copy.description"></a><h6>
-<a name="id3324286"></a>
+<a name="id819207"></a>
             <a class="link" href="unique_copy.html#range.reference.algorithms.mutating.unique_copy.description">Description</a>
           </h6>
 <p>
@@ -56,14 +56,14 @@
             value type.
           </p>
 <a name="range.reference.algorithms.mutating.unique_copy.definition"></a><h6>
-<a name="id3324376"></a>
+<a name="id819296"></a>
             <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="id3324451"></a>
+<a name="id819366"></a>
             <a class="link" href="unique_copy.html#range.reference.algorithms.mutating.unique_copy.requirements">Requirements</a>
           </h6>
 <p>
@@ -117,7 +117,7 @@
               </li>
 </ul></div>
 <a name="range.reference.algorithms.mutating.unique_copy.complexity"></a><h6>
-<a name="id3324744"></a>
+<a name="id819654"></a>
             <a class="link" href="unique_copy.html#range.reference.algorithms.mutating.unique_copy.complexity">Complexity</a>
           </h6>
 <p>
diff --git a/doc/html/range/reference/algorithms/new/copy_n.html b/doc/html/range/reference/algorithms/new/copy_n.html
index 0a6c5cc..593724d 100644
--- a/doc/html/range/reference/algorithms/new/copy_n.html
+++ b/doc/html/range/reference/algorithms/new/copy_n.html
@@ -27,7 +27,7 @@
 <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="id3359554"></a>
+<a name="id854182"></a>
             <a class="link" href="copy_n.html#range.reference.algorithms.new.copy_n.prototype">Prototype</a>
           </h6>
 <p>
@@ -39,7 +39,7 @@
 <p>
           </p>
 <a name="range.reference.algorithms.new.copy_n.description"></a><h6>
-<a name="id3359714"></a>
+<a name="id854337"></a>
             <a class="link" href="copy_n.html#range.reference.algorithms.new.copy_n.description">Description</a>
           </h6>
 <p>
@@ -53,14 +53,14 @@
             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="id3359889"></a>
+<a name="id854508"></a>
             <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="id3359961"></a>
+<a name="id854579"></a>
             <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">
@@ -79,7 +79,7 @@
               </li>
 </ol></div>
 <a name="range.reference.algorithms.new.copy_n.complexity"></a><h6>
-<a name="id3360074"></a>
+<a name="id854691"></a>
             <a class="link" href="copy_n.html#range.reference.algorithms.new.copy_n.complexity">Complexity</a>
           </h6>
 <p>
diff --git a/doc/html/range/reference/algorithms/new/erase.html b/doc/html/range/reference/algorithms/new/erase.html
index 346a24e..c802ee7 100644
--- a/doc/html/range/reference/algorithms/new/erase.html
+++ b/doc/html/range/reference/algorithms/new/erase.html
@@ -27,7 +27,7 @@
 <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="id3360129"></a>
+<a name="id854746"></a>
             <a class="link" href="erase.html#range.reference.algorithms.new.erase.prototype">Prototype</a>
           </h6>
 <p>
@@ -41,7 +41,7 @@
 <p>
           </p>
 <a name="range.reference.algorithms.new.erase.description"></a><h6>
-<a name="id3360271"></a>
+<a name="id854884"></a>
             <a class="link" href="erase.html#range.reference.algorithms.new.erase.description">Description</a>
           </h6>
 <p>
@@ -58,14 +58,14 @@
             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="id3360577"></a>
+<a name="id855182"></a>
             <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="id3360649"></a>
+<a name="id855252"></a>
             <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">
@@ -73,7 +73,7 @@
                 erase of an iterator range.
               </li></ol></div>
 <a name="range.reference.algorithms.new.erase.complexity"></a><h6>
-<a name="id3360697"></a>
+<a name="id855300"></a>
             <a class="link" href="erase.html#range.reference.algorithms.new.erase.complexity">Complexity</a>
           </h6>
 <p>
diff --git a/doc/html/range/reference/algorithms/new/for_each.html b/doc/html/range/reference/algorithms/new/for_each.html
index 8983318..3f685d5 100644
--- a/doc/html/range/reference/algorithms/new/for_each.html
+++ b/doc/html/range/reference/algorithms/new/for_each.html
@@ -27,7 +27,7 @@
 <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="id3360764"></a>
+<a name="id855365"></a>
             <a class="link" href="for_each.html#range.reference.algorithms.new.for_each.prototype">Prototype</a>
           </h6>
 <p>
@@ -72,7 +72,7 @@
 <p>
           </p>
 <a name="range.reference.algorithms.new.for_each.description"></a><h6>
-<a name="id3361346"></a>
+<a name="id855933"></a>
             <a class="link" href="for_each.html#range.reference.algorithms.new.for_each.description">Description</a>
           </h6>
 <p>
@@ -88,14 +88,14 @@
             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="id3361508"></a>
+<a name="id856362"></a>
             <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="id3361580"></a>
+<a name="id856434"></a>
             <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">
@@ -125,7 +125,7 @@
               </li>
 </ol></div>
 <a name="range.reference.algorithms.new.for_each.complexity"></a><h6>
-<a name="id3361752"></a>
+<a name="id856602"></a>
             <a class="link" href="for_each.html#range.reference.algorithms.new.for_each.complexity">Complexity</a>
           </h6>
 <p>
diff --git a/doc/html/range/reference/algorithms/new/insert.html b/doc/html/range/reference/algorithms/new/insert.html
index 7da8357..c9624e6 100644
--- a/doc/html/range/reference/algorithms/new/insert.html
+++ b/doc/html/range/reference/algorithms/new/insert.html
@@ -27,7 +27,7 @@
 <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="id3361860"></a>
+<a name="id856708"></a>
             <a class="link" href="insert.html#range.reference.algorithms.new.insert.prototype">Prototype</a>
           </h6>
 <p>
@@ -44,7 +44,7 @@
 <p>
           </p>
 <a name="range.reference.algorithms.new.insert.description"></a><h6>
-<a name="id3362031"></a>
+<a name="id856875"></a>
             <a class="link" href="insert.html#range.reference.algorithms.new.insert.description">Description</a>
           </h6>
 <p>
@@ -54,14 +54,14 @@
             <code class="computeroutput"><span class="identifier">target</span></code>.
           </p>
 <a name="range.reference.algorithms.new.insert.definition"></a><h6>
-<a name="id3362101"></a>
+<a name="id856943"></a>
             <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="id3362173"></a>
+<a name="id857014"></a>
             <a class="link" href="insert.html#range.reference.algorithms.new.insert.requirements">Requirements</a>
           </h6>
 <div class="orderedlist"><ol class="orderedlist" type="1">
@@ -81,7 +81,7 @@
               </li>
 </ol></div>
 <a name="range.reference.algorithms.new.insert.complexity"></a><h6>
-<a name="id3362277"></a>
+<a name="id857116"></a>
             <a class="link" href="insert.html#range.reference.algorithms.new.insert.complexity">Complexity</a>
           </h6>
 <p>
diff --git a/doc/html/range/reference/algorithms/new/iota.html b/doc/html/range/reference/algorithms/new/iota.html
index 8693b0b..5d932ee 100644
--- a/doc/html/range/reference/algorithms/new/iota.html
+++ b/doc/html/range/reference/algorithms/new/iota.html
@@ -27,7 +27,7 @@
 <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="id3362344"></a>
+<a name="id857184"></a>
             <a class="link" href="iota.html#range.reference.algorithms.new.iota.prototype">Prototype</a>
           </h6>
 <p>
@@ -39,7 +39,7 @@
 <p>
           </p>
 <a name="range.reference.algorithms.new.iota.description"></a><h6>
-<a name="id3362473"></a>
+<a name="id857308"></a>
             <a class="link" href="iota.html#range.reference.algorithms.new.iota.description">Description</a>
           </h6>
 <p>
@@ -50,14 +50,14 @@
             <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="id3362614"></a>
+<a name="id857444"></a>
             <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="id3362686"></a>
+<a name="id857514"></a>
             <a class="link" href="iota.html#range.reference.algorithms.new.iota.requirements">Requirements</a>
           </h6>
 <div class="orderedlist"><ol class="orderedlist" type="1">
@@ -73,7 +73,7 @@
               </li>
 </ol></div>
 <a name="range.reference.algorithms.new.iota.complexity"></a><h6>
-<a name="id3362769"></a>
+<a name="id857596"></a>
             <a class="link" href="iota.html#range.reference.algorithms.new.iota.complexity">Complexity</a>
           </h6>
 <p>
diff --git a/doc/html/range/reference/algorithms/new/is_sorted.html b/doc/html/range/reference/algorithms/new/is_sorted.html
index f5a2462..53b79f1 100644
--- a/doc/html/range/reference/algorithms/new/is_sorted.html
+++ b/doc/html/range/reference/algorithms/new/is_sorted.html
@@ -27,7 +27,7 @@
 <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="id3362848"></a>
+<a name="id857672"></a>
             <a class="link" href="is_sorted.html#range.reference.algorithms.new.is_sorted.prototype">Prototype</a>
           </h6>
 <p>
@@ -42,7 +42,7 @@
 <p>
           </p>
 <a name="range.reference.algorithms.new.is_sorted.description"></a><h6>
-<a name="id3363044"></a>
+<a name="id857864"></a>
             <a class="link" href="is_sorted.html#range.reference.algorithms.new.is_sorted.description">Description</a>
           </h6>
 <p>
@@ -58,14 +58,14 @@
             is <code class="computeroutput"><span class="keyword">true</span></code>.
           </p>
 <a name="range.reference.algorithms.new.is_sorted.definition"></a><h6>
-<a name="id3363240"></a>
+<a name="id858053"></a>
             <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="id3363312"></a>
+<a name="id858125"></a>
             <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">
@@ -85,7 +85,7 @@
               </li>
 </ol></div>
 <a name="range.reference.algorithms.new.is_sorted.complexity"></a><h6>
-<a name="id3363428"></a>
+<a name="id858238"></a>
             <a class="link" href="is_sorted.html#range.reference.algorithms.new.is_sorted.complexity">Complexity</a>
           </h6>
 <p>
diff --git a/doc/html/range/reference/algorithms/new/overwrite.html b/doc/html/range/reference/algorithms/new/overwrite.html
index 6072237..c7de271 100644
--- a/doc/html/range/reference/algorithms/new/overwrite.html
+++ b/doc/html/range/reference/algorithms/new/overwrite.html
@@ -27,7 +27,7 @@
 <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="id3363496"></a>
+<a name="id858305"></a>
             <a class="link" href="overwrite.html#range.reference.algorithms.new.overwrite.prototype">Prototype</a>
           </h6>
 <p>
@@ -43,7 +43,7 @@
 <p>
           </p>
 <a name="range.reference.algorithms.new.overwrite.description"></a><h6>
-<a name="id3363632"></a>
+<a name="id858440"></a>
             <a class="link" href="overwrite.html#range.reference.algorithms.new.overwrite.description">Description</a>
           </h6>
 <p>
@@ -52,14 +52,14 @@
             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="id3363691"></a>
+<a name="id858497"></a>
             <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="id3363763"></a>
+<a name="id858568"></a>
             <a class="link" href="overwrite.html#range.reference.algorithms.new.overwrite.requirements">Requirements</a>
           </h6>
 <div class="orderedlist"><ol class="orderedlist" type="1">
@@ -88,7 +88,7 @@
               </li>
 </ol></div>
 <a name="range.reference.algorithms.new.overwrite.complexity"></a><h6>
-<a name="id3363949"></a>
+<a name="id858752"></a>
             <a class="link" href="overwrite.html#range.reference.algorithms.new.overwrite.complexity">Complexity</a>
           </h6>
 <p>
diff --git a/doc/html/range/reference/algorithms/new/push_back.html b/doc/html/range/reference/algorithms/new/push_back.html
index ecd5949..b74c4d5 100644
--- a/doc/html/range/reference/algorithms/new/push_back.html
+++ b/doc/html/range/reference/algorithms/new/push_back.html
@@ -27,7 +27,7 @@
 <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="id3364018"></a>
+<a name="id858820"></a>
             <a class="link" href="push_back.html#range.reference.algorithms.new.push_back.prototype">Prototype</a>
           </h6>
 <p>
@@ -43,7 +43,7 @@
 <p>
           </p>
 <a name="range.reference.algorithms.new.push_back.description"></a><h6>
-<a name="id3364158"></a>
+<a name="id858958"></a>
             <a class="link" href="push_back.html#range.reference.algorithms.new.push_back.description">Description</a>
           </h6>
 <p>
@@ -52,14 +52,14 @@
             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="id3364218"></a>
+<a name="id859016"></a>
             <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="id3364290"></a>
+<a name="id859086"></a>
             <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">
@@ -79,7 +79,7 @@
               </li>
 </ol></div>
 <a name="range.reference.algorithms.new.push_back.complexity"></a><h6>
-<a name="id3364410"></a>
+<a name="id859203"></a>
             <a class="link" href="push_back.html#range.reference.algorithms.new.push_back.complexity">Complexity</a>
           </h6>
 <p>
diff --git a/doc/html/range/reference/algorithms/new/push_front.html b/doc/html/range/reference/algorithms/new/push_front.html
index 13e2fe4..1104cc2 100644
--- a/doc/html/range/reference/algorithms/new/push_front.html
+++ b/doc/html/range/reference/algorithms/new/push_front.html
@@ -27,7 +27,7 @@
 <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="id3364478"></a>
+<a name="id859272"></a>
             <a class="link" href="push_front.html#range.reference.algorithms.new.push_front.prototype">Prototype</a>
           </h6>
 <p>
@@ -43,7 +43,7 @@
 <p>
           </p>
 <a name="range.reference.algorithms.new.push_front.description"></a><h6>
-<a name="id3364617"></a>
+<a name="id859409"></a>
             <a class="link" href="push_front.html#range.reference.algorithms.new.push_front.description">Description</a>
           </h6>
 <p>
@@ -52,14 +52,14 @@
             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="id3364677"></a>
+<a name="id859465"></a>
             <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="id3364750"></a>
+<a name="id859537"></a>
             <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">
@@ -79,7 +79,7 @@
               </li>
 </ol></div>
 <a name="range.reference.algorithms.new.push_front.complexity"></a><h6>
-<a name="id3364869"></a>
+<a name="id859654"></a>
             <a class="link" href="push_front.html#range.reference.algorithms.new.push_front.complexity">Complexity</a>
           </h6>
 <p>
diff --git a/doc/html/range/reference/algorithms/new/remove_erase.html b/doc/html/range/reference/algorithms/new/remove_erase.html
index 0982bc7..3136430 100644
--- a/doc/html/range/reference/algorithms/new/remove_erase.html
+++ b/doc/html/range/reference/algorithms/new/remove_erase.html
@@ -27,7 +27,7 @@
 <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="id3364938"></a>
+<a name="id859722"></a>
             <a class="link" href="remove_erase.html#range.reference.algorithms.new.remove_erase.prototype">Prototype</a>
           </h6>
 <p>
@@ -40,7 +40,7 @@
 <p>
           </p>
 <a name="range.reference.algorithms.new.remove_erase.description"></a><h6>
-<a name="id3365078"></a>
+<a name="id859858"></a>
             <a class="link" href="remove_erase.html#range.reference.algorithms.new.remove_erase.description">Description</a>
           </h6>
 <p>
@@ -50,14 +50,14 @@
             algorithm which merely rearranges elements.
           </p>
 <a name="range.reference.algorithms.new.remove_erase.definition"></a><h6>
-<a name="id3365139"></a>
+<a name="id859918"></a>
             <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="id3365211"></a>
+<a name="id859989"></a>
             <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">
@@ -65,7 +65,7 @@
                 erase of an iterator range.
               </li></ol></div>
 <a name="range.reference.algorithms.new.remove_erase.complexity"></a><h6>
-<a name="id3365260"></a>
+<a name="id860035"></a>
             <a class="link" href="remove_erase.html#range.reference.algorithms.new.remove_erase.complexity">Complexity</a>
           </h6>
 <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 b9f2d9a..994dd02 100644
--- a/doc/html/range/reference/algorithms/new/remove_erase_if.html
+++ b/doc/html/range/reference/algorithms/new/remove_erase_if.html
@@ -28,7 +28,7 @@
           remove_erase_if</a>
 </h5></div></div></div>
 <a name="range.reference.algorithms.new.remove_erase_if.prototype"></a><h6>
-<a name="id3365329"></a>
+<a name="id860104"></a>
             <a class="link" href="remove_erase_if.html#range.reference.algorithms.new.remove_erase_if.prototype">Prototype</a>
           </h6>
 <p>
@@ -41,7 +41,7 @@
 <p>
           </p>
 <a name="range.reference.algorithms.new.remove_erase_if.description"></a><h6>
-<a name="id3365458"></a>
+<a name="id860229"></a>
             <a class="link" href="remove_erase_if.html#range.reference.algorithms.new.remove_erase_if.description">Description</a>
           </h6>
 <p>
@@ -52,14 +52,14 @@
             algorithm which merely rearranges elements.
           </p>
 <a name="range.reference.algorithms.new.remove_erase_if.definition"></a><h6>
-<a name="id3365543"></a>
+<a name="id860311"></a>
             <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="id3365615"></a>
+<a name="id860382"></a>
             <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">
@@ -73,7 +73,7 @@
               </li>
 </ol></div>
 <a name="range.reference.algorithms.new.remove_erase_if.complexity"></a><h6>
-<a name="id3365693"></a>
+<a name="id860458"></a>
             <a class="link" href="remove_erase_if.html#range.reference.algorithms.new.remove_erase_if.complexity">Complexity</a>
           </h6>
 <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 c909827..28aacf3 100644
--- a/doc/html/range/reference/algorithms/non_mutating/adjacent_find.html
+++ b/doc/html/range/reference/algorithms/non_mutating/adjacent_find.html
@@ -28,7 +28,7 @@
           adjacent_find</a>
 </h5></div></div></div>
 <a name="range.reference.algorithms.non_mutating.adjacent_find.prototype"></a><h6>
-<a name="id3324890"></a>
+<a name="id819797"></a>
             <a class="link" href="adjacent_find.html#range.reference.algorithms.non_mutating.adjacent_find.prototype">Prototype</a>
           </h6>
 <p>
@@ -77,7 +77,7 @@
 <p>
           </p>
 <a name="range.reference.algorithms.non_mutating.adjacent_find.description"></a><h6>
-<a name="id3325877"></a>
+<a name="id820754"></a>
             <a class="link" href="adjacent_find.html#range.reference.algorithms.non_mutating.adjacent_find.description">Description</a>
           </h6>
 <p>
@@ -98,14 +98,14 @@
             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="id3326090"></a>
+<a name="id820961"></a>
             <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="id3326163"></a>
+<a name="id821033"></a>
             <a class="link" href="adjacent_find.html#range.reference.algorithms.non_mutating.adjacent_find.requirements">Requirements</a>
           </h6>
 <p>
@@ -143,7 +143,7 @@
               </li>
 </ul></div>
 <a name="range.reference.algorithms.non_mutating.adjacent_find.complexity"></a><h6>
-<a name="id3326363"></a>
+<a name="id821500"></a>
             <a class="link" href="adjacent_find.html#range.reference.algorithms.non_mutating.adjacent_find.complexity">Complexity</a>
           </h6>
 <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 96c6476..4c75b33 100644
--- a/doc/html/range/reference/algorithms/non_mutating/binary_search.html
+++ b/doc/html/range/reference/algorithms/non_mutating/binary_search.html
@@ -28,7 +28,7 @@
           binary_search</a>
 </h5></div></div></div>
 <a name="range.reference.algorithms.non_mutating.binary_search.prototype"></a><h6>
-<a name="id3326468"></a>
+<a name="id821602"></a>
             <a class="link" href="binary_search.html#range.reference.algorithms.non_mutating.binary_search.prototype">Prototype</a>
           </h6>
 <p>
@@ -43,7 +43,7 @@
 <p>
           </p>
 <a name="range.reference.algorithms.non_mutating.binary_search.description"></a><h6>
-<a name="id3326749"></a>
+<a name="id821876"></a>
             <a class="link" href="binary_search.html#range.reference.algorithms.non_mutating.binary_search.description">Description</a>
           </h6>
 <p>
@@ -53,14 +53,14 @@
             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="id3326820"></a>
+<a name="id821945"></a>
             <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="id3326894"></a>
+<a name="id822017"></a>
             <a class="link" href="binary_search.html#range.reference.algorithms.non_mutating.binary_search.requirements">Requirements</a>
           </h6>
 <p>
@@ -111,7 +111,7 @@
               </li>
 </ul></div>
 <a name="range.reference.algorithms.non_mutating.binary_search.precondition_"></a><h6>
-<a name="id3327177"></a>
+<a name="id822294"></a>
             <a class="link" href="binary_search.html#range.reference.algorithms.non_mutating.binary_search.precondition_">Precondition:</a>
           </h6>
 <p>
@@ -129,7 +129,7 @@
             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="id3327273"></a>
+<a name="id822388"></a>
             <a class="link" href="binary_search.html#range.reference.algorithms.non_mutating.binary_search.complexity">Complexity</a>
           </h6>
 <p>
diff --git a/doc/html/range/reference/algorithms/non_mutating/count.html b/doc/html/range/reference/algorithms/non_mutating/count.html
index 1360a5c..a7ec656 100644
--- a/doc/html/range/reference/algorithms/non_mutating/count.html
+++ b/doc/html/range/reference/algorithms/non_mutating/count.html
@@ -27,7 +27,7 @@
 <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="id3327443"></a>
+<a name="id822553"></a>
             <a class="link" href="count.html#range.reference.algorithms.non_mutating.count.prototype">Prototype</a>
           </h6>
 <p>
@@ -44,7 +44,7 @@
 <p>
           </p>
 <a name="range.reference.algorithms.non_mutating.count.description"></a><h6>
-<a name="id3327740"></a>
+<a name="id822843"></a>
             <a class="link" href="count.html#range.reference.algorithms.non_mutating.count.description">Description</a>
           </h6>
 <p>
@@ -54,14 +54,14 @@
             is <code class="computeroutput"><span class="keyword">true</span></code>.
           </p>
 <a name="range.reference.algorithms.non_mutating.count.definition"></a><h6>
-<a name="id3327831"></a>
+<a name="id822930"></a>
             <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="id3327903"></a>
+<a name="id823001"></a>
             <a class="link" href="count.html#range.reference.algorithms.non_mutating.count.requirements">Requirements</a>
           </h6>
 <div class="itemizedlist"><ul class="itemizedlist" type="disc">
@@ -84,7 +84,7 @@
               </li>
 </ul></div>
 <a name="range.reference.algorithms.non_mutating.count.complexity"></a><h6>
-<a name="id3328043"></a>
+<a name="id823139"></a>
             <a class="link" href="count.html#range.reference.algorithms.non_mutating.count.complexity">Complexity</a>
           </h6>
 <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 5e6e850..e56fb51 100644
--- a/doc/html/range/reference/algorithms/non_mutating/count_if.html
+++ b/doc/html/range/reference/algorithms/non_mutating/count_if.html
@@ -28,7 +28,7 @@
           count_if</a>
 </h5></div></div></div>
 <a name="range.reference.algorithms.non_mutating.count_if.prototype"></a><h6>
-<a name="id3328112"></a>
+<a name="id823207"></a>
             <a class="link" href="count_if.html#range.reference.algorithms.non_mutating.count_if.prototype">Prototype</a>
           </h6>
 <p>
@@ -41,7 +41,7 @@
 <p>
           </p>
 <a name="range.reference.algorithms.non_mutating.count_if.description"></a><h6>
-<a name="id3328274"></a>
+<a name="id823363"></a>
             <a class="link" href="count_if.html#range.reference.algorithms.non_mutating.count_if.description">Description</a>
           </h6>
 <p>
@@ -51,14 +51,14 @@
             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="id3328368"></a>
+<a name="id823454"></a>
             <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="id3328440"></a>
+<a name="id823524"></a>
             <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">
@@ -81,7 +81,7 @@
               </li>
 </ul></div>
 <a name="range.reference.algorithms.non_mutating.count_if.complexity"></a><h6>
-<a name="id3328579"></a>
+<a name="id823661"></a>
             <a class="link" href="count_if.html#range.reference.algorithms.non_mutating.count_if.complexity">Complexity</a>
           </h6>
 <p>
diff --git a/doc/html/range/reference/algorithms/non_mutating/equal.html b/doc/html/range/reference/algorithms/non_mutating/equal.html
index 0556a2a..1576f3e 100644
--- a/doc/html/range/reference/algorithms/non_mutating/equal.html
+++ b/doc/html/range/reference/algorithms/non_mutating/equal.html
@@ -27,7 +27,7 @@
 <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="id3328658"></a>
+<a name="id823739"></a>
             <a class="link" href="equal.html#range.reference.algorithms.non_mutating.equal.prototype">Prototype</a>
           </h6>
 <p>
@@ -52,7 +52,7 @@
 <p>
           </p>
 <a name="range.reference.algorithms.non_mutating.equal.description"></a><h6>
-<a name="id3328944"></a>
+<a name="id824018"></a>
             <a class="link" href="equal.html#range.reference.algorithms.non_mutating.equal.description">Description</a>
           </h6>
 <p>
@@ -70,14 +70,14 @@
             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="id3329186"></a>
+<a name="id824254"></a>
             <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="id3329260"></a>
+<a name="id824325"></a>
             <a class="link" href="equal.html#range.reference.algorithms.non_mutating.equal.requirements">Requirements</a>
           </h6>
 <p>
@@ -138,7 +138,7 @@
               </li>
 </ul></div>
 <a name="range.reference.algorithms.non_mutating.equal.complexity"></a><h6>
-<a name="id3329588"></a>
+<a name="id824650"></a>
             <a class="link" href="equal.html#range.reference.algorithms.non_mutating.equal.complexity">Complexity</a>
           </h6>
 <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 766ee8a..51536ec 100644
--- a/doc/html/range/reference/algorithms/non_mutating/equal_range.html
+++ b/doc/html/range/reference/algorithms/non_mutating/equal_range.html
@@ -28,7 +28,7 @@
           equal_range</a>
 </h5></div></div></div>
 <a name="range.reference.algorithms.non_mutating.equal_range.prototype"></a><h6>
-<a name="id3329684"></a>
+<a name="id824745"></a>
             <a class="link" href="equal_range.html#range.reference.algorithms.non_mutating.equal_range.prototype">Prototype</a>
           </h6>
 <p>
@@ -71,7 +71,7 @@
 <p>
           </p>
 <a name="range.reference.algorithms.non_mutating.equal_range.description"></a><h6>
-<a name="id3330564"></a>
+<a name="id825597"></a>
             <a class="link" href="equal_range.html#range.reference.algorithms.non_mutating.equal_range.description">Description</a>
           </h6>
 <p>
@@ -85,14 +85,14 @@
             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="id3330716"></a>
+<a name="id825744"></a>
             <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="id3330789"></a>
+<a name="id825817"></a>
             <a class="link" href="equal_range.html#range.reference.algorithms.non_mutating.equal_range.requirements">Requirements</a>
           </h6>
 <p>
@@ -143,7 +143,7 @@
               </li>
 </ul></div>
 <a name="range.reference.algorithms.non_mutating.equal_range.precondition_"></a><h6>
-<a name="id3331071"></a>
+<a name="id826092"></a>
             <a class="link" href="equal_range.html#range.reference.algorithms.non_mutating.equal_range.precondition_">Precondition:</a>
           </h6>
 <p>
@@ -155,7 +155,7 @@
             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="id3331151"></a>
+<a name="id826169"></a>
             <a class="link" href="equal_range.html#range.reference.algorithms.non_mutating.equal_range.complexity">Complexity</a>
           </h6>
 <p>
diff --git a/doc/html/range/reference/algorithms/non_mutating/find.html b/doc/html/range/reference/algorithms/non_mutating/find.html
index 80ac8a1..583c1cb 100644
--- a/doc/html/range/reference/algorithms/non_mutating/find.html
+++ b/doc/html/range/reference/algorithms/non_mutating/find.html
@@ -27,7 +27,7 @@
 <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="id3331842"></a>
+<a name="id826841"></a>
             <a class="link" href="find.html#range.reference.algorithms.non_mutating.find.prototype">Prototype</a>
           </h6>
 <p>
@@ -48,7 +48,7 @@
 <p>
           </p>
 <a name="range.reference.algorithms.non_mutating.find.description"></a><h6>
-<a name="id3332134"></a>
+<a name="id827126"></a>
             <a class="link" href="find.html#range.reference.algorithms.non_mutating.find.description">Description</a>
           </h6>
 <p>
@@ -59,14 +59,14 @@
             same manner as the returned iterator described above.
           </p>
 <a name="range.reference.algorithms.non_mutating.find.definition"></a><h6>
-<a name="id3332258"></a>
+<a name="id827245"></a>
             <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="id3332330"></a>
+<a name="id827316"></a>
             <a class="link" href="find.html#range.reference.algorithms.non_mutating.find.requirements">Requirements</a>
           </h6>
 <div class="itemizedlist"><ul class="itemizedlist" type="disc">
@@ -87,7 +87,7 @@
               </li>
 </ul></div>
 <a name="range.reference.algorithms.non_mutating.find.complexity"></a><h6>
-<a name="id3332456"></a>
+<a name="id827439"></a>
             <a class="link" href="find.html#range.reference.algorithms.non_mutating.find.complexity">Complexity</a>
           </h6>
 <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 40847b3..d4e9525 100644
--- a/doc/html/range/reference/algorithms/non_mutating/find_end.html
+++ b/doc/html/range/reference/algorithms/non_mutating/find_end.html
@@ -28,7 +28,7 @@
           find_end</a>
 </h5></div></div></div>
 <a name="range.reference.algorithms.non_mutating.find_end.prototype"></a><h6>
-<a name="id3332524"></a>
+<a name="id827507"></a>
             <a class="link" href="find_end.html#range.reference.algorithms.non_mutating.find_end.prototype">Prototype</a>
           </h6>
 <p>
@@ -66,7 +66,7 @@
 <p>
           </p>
 <a name="range.reference.algorithms.non_mutating.find_end.description"></a><h6>
-<a name="id3333189"></a>
+<a name="id828152"></a>
             <a class="link" href="find_end.html#range.reference.algorithms.non_mutating.find_end.description">Description</a>
           </h6>
 <p>
@@ -81,14 +81,14 @@
             same manner as the returned iterator described above.
           </p>
 <a name="range.reference.algorithms.non_mutating.find_end.definition"></a><h6>
-<a name="id3333324"></a>
+<a name="id828282"></a>
             <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="id3333397"></a>
+<a name="id828353"></a>
             <a class="link" href="find_end.html#range.reference.algorithms.non_mutating.find_end.requirements">Requirements</a>
           </h6>
 <p>
@@ -148,7 +148,7 @@
               </li>
 </ul></div>
 <a name="range.reference.algorithms.non_mutating.find_end.complexity"></a><h6>
-<a name="id3333727"></a>
+<a name="id828673"></a>
             <a class="link" href="find_end.html#range.reference.algorithms.non_mutating.find_end.complexity">Complexity</a>
           </h6>
 <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 ab764df..0585184 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
@@ -28,7 +28,7 @@
           find_first_of</a>
 </h5></div></div></div>
 <a name="range.reference.algorithms.non_mutating.find_first_of.prototype"></a><h6>
-<a name="id3333904"></a>
+<a name="id828846"></a>
             <a class="link" href="find_first_of.html#range.reference.algorithms.non_mutating.find_first_of.prototype">Prototype</a>
           </h6>
 <p>
@@ -66,7 +66,7 @@
 <p>
           </p>
 <a name="range.reference.algorithms.non_mutating.find_first_of.description"></a><h6>
-<a name="id3334571"></a>
+<a name="id829496"></a>
             <a class="link" href="find_first_of.html#range.reference.algorithms.non_mutating.find_first_of.description">Description</a>
           </h6>
 <p>
@@ -86,14 +86,14 @@
             same manner as the returned iterator described above.
           </p>
 <a name="range.reference.algorithms.non_mutating.find_first_of.definition"></a><h6>
-<a name="id3334710"></a>
+<a name="id829631"></a>
             <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="id3334784"></a>
+<a name="id829704"></a>
             <a class="link" href="find_first_of.html#range.reference.algorithms.non_mutating.find_first_of.requirements">Requirements</a>
           </h6>
 <p>
@@ -147,7 +147,7 @@
               </li>
 </ul></div>
 <a name="range.reference.algorithms.non_mutating.find_first_of.complexity"></a><h6>
-<a name="id3335066"></a>
+<a name="id829982"></a>
             <a class="link" href="find_first_of.html#range.reference.algorithms.non_mutating.find_first_of.complexity">Complexity</a>
           </h6>
 <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 caa16d2..df62ea8 100644
--- a/doc/html/range/reference/algorithms/non_mutating/find_if.html
+++ b/doc/html/range/reference/algorithms/non_mutating/find_if.html
@@ -28,7 +28,7 @@
           find_if</a>
 </h5></div></div></div>
 <a name="range.reference.algorithms.non_mutating.find_if.prototype"></a><h6>
-<a name="id3335161"></a>
+<a name="id830073"></a>
             <a class="link" href="find_if.html#range.reference.algorithms.non_mutating.find_if.prototype">Prototype</a>
           </h6>
 <p>
@@ -49,7 +49,7 @@
 <p>
           </p>
 <a name="range.reference.algorithms.non_mutating.find_if.description"></a><h6>
-<a name="id3335453"></a>
+<a name="id830359"></a>
             <a class="link" href="find_if.html#range.reference.algorithms.non_mutating.find_if.description">Description</a>
           </h6>
 <p>
@@ -64,14 +64,14 @@
             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="id3335590"></a>
+<a name="id830490"></a>
             <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="id3335664"></a>
+<a name="id830562"></a>
             <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">
@@ -90,7 +90,7 @@
               </li>
 </ul></div>
 <a name="range.reference.algorithms.non_mutating.find_if.precondition_"></a><h6>
-<a name="id3335775"></a>
+<a name="id830671"></a>
             <a class="link" href="find_if.html#range.reference.algorithms.non_mutating.find_if.precondition_">Precondition:</a>
           </h6>
 <p>
@@ -98,7 +98,7 @@
             <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="id3335849"></a>
+<a name="id830742"></a>
             <a class="link" href="find_if.html#range.reference.algorithms.non_mutating.find_if.complexity">Complexity</a>
           </h6>
 <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 c8584f7..413fc82 100644
--- a/doc/html/range/reference/algorithms/non_mutating/for_each.html
+++ b/doc/html/range/reference/algorithms/non_mutating/for_each.html
@@ -28,7 +28,7 @@
           for_each</a>
 </h5></div></div></div>
 <a name="range.reference.algorithms.non_mutating.for_each.prototype"></a><h6>
-<a name="id3331251"></a>
+<a name="id826266"></a>
             <a class="link" href="for_each.html#range.reference.algorithms.non_mutating.for_each.prototype">Prototype</a>
           </h6>
 <p>
@@ -49,7 +49,7 @@
 <p>
           </p>
 <a name="range.reference.algorithms.non_mutating.for_each.description"></a><h6>
-<a name="id3331478"></a>
+<a name="id826487"></a>
             <a class="link" href="for_each.html#range.reference.algorithms.non_mutating.for_each.description">Description</a>
           </h6>
 <p>
@@ -59,14 +59,14 @@
             <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="id3331560"></a>
+<a name="id826567"></a>
             <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="id3331633"></a>
+<a name="id826638"></a>
             <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">
@@ -90,7 +90,7 @@
               </li>
 </ul></div>
 <a name="range.reference.algorithms.non_mutating.for_each.complexity"></a><h6>
-<a name="id3331762"></a>
+<a name="id826764"></a>
             <a class="link" href="for_each.html#range.reference.algorithms.non_mutating.for_each.complexity">Complexity</a>
           </h6>
 <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 257ab7b..f3ea649 100644
--- a/doc/html/range/reference/algorithms/non_mutating/lexicographical_compare.html
+++ b/doc/html/range/reference/algorithms/non_mutating/lexicographical_compare.html
@@ -28,7 +28,7 @@
           lexicographical_compare</a>
 </h5></div></div></div>
 <a name="range.reference.algorithms.non_mutating.lexicographical_compare.prototype"></a><h6>
-<a name="id3335930"></a>
+<a name="id830822"></a>
             <a class="link" href="lexicographical_compare.html#range.reference.algorithms.non_mutating.lexicographical_compare.prototype">Prototype</a>
           </h6>
 <p>
@@ -53,7 +53,7 @@
 <p>
           </p>
 <a name="range.reference.algorithms.non_mutating.lexicographical_compare.description"></a><h6>
-<a name="id3336217"></a>
+<a name="id831104"></a>
             <a class="link" href="lexicographical_compare.html#range.reference.algorithms.non_mutating.lexicographical_compare.description">Description</a>
           </h6>
 <p>
@@ -73,14 +73,14 @@
             predicate versions.
           </p>
 <a name="range.reference.algorithms.non_mutating.lexicographical_compare.definition"></a><h6>
-<a name="id3336395"></a>
+<a name="id831277"></a>
             <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="id3336470"></a>
+<a name="id831348"></a>
             <a class="link" href="lexicographical_compare.html#range.reference.algorithms.non_mutating.lexicographical_compare.requirements">Requirements</a>
           </h6>
 <p>
@@ -145,7 +145,7 @@
               </li>
 </ul></div>
 <a name="range.reference.algorithms.non_mutating.lexicographical_compare.complexity"></a><h6>
-<a name="id3336866"></a>
+<a name="id831740"></a>
             <a class="link" href="lexicographical_compare.html#range.reference.algorithms.non_mutating.lexicographical_compare.complexity">Complexity</a>
           </h6>
 <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 0f92df5..e220c33 100644
--- a/doc/html/range/reference/algorithms/non_mutating/lower_bound.html
+++ b/doc/html/range/reference/algorithms/non_mutating/lower_bound.html
@@ -28,7 +28,7 @@
           lower_bound</a>
 </h5></div></div></div>
 <a name="range.reference.algorithms.non_mutating.lower_bound.prototype"></a><h6>
-<a name="id3336973"></a>
+<a name="id831845"></a>
             <a class="link" href="lower_bound.html#range.reference.algorithms.non_mutating.lower_bound.prototype">Prototype</a>
           </h6>
 <p>
@@ -49,7 +49,7 @@
 <p>
           </p>
 <a name="range.reference.algorithms.non_mutating.lower_bound.description"></a><h6>
-<a name="id3337268"></a>
+<a name="id832130"></a>
             <a class="link" href="lower_bound.html#range.reference.algorithms.non_mutating.lower_bound.description">Description</a>
           </h6>
 <p>
@@ -72,14 +72,14 @@
             same manner as the returned iterator described above.
           </p>
 <a name="range.reference.algorithms.non_mutating.lower_bound.definition"></a><h6>
-<a name="id3337467"></a>
+<a name="id832321"></a>
             <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="id3337539"></a>
+<a name="id832394"></a>
             <a class="link" href="lower_bound.html#range.reference.algorithms.non_mutating.lower_bound.requirements">Requirements</a>
           </h6>
 <p>
@@ -130,7 +130,7 @@
               </li>
 </ul></div>
 <a name="range.reference.algorithms.non_mutating.lower_bound.precondition_"></a><h6>
-<a name="id3337822"></a>
+<a name="id832671"></a>
             <a class="link" href="lower_bound.html#range.reference.algorithms.non_mutating.lower_bound.precondition_">Precondition:</a>
           </h6>
 <p>
@@ -148,7 +148,7 @@
             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="id3337919"></a>
+<a name="id832764"></a>
             <a class="link" href="lower_bound.html#range.reference.algorithms.non_mutating.lower_bound.complexity">Complexity</a>
           </h6>
 <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 173b281..2b61404 100644
--- a/doc/html/range/reference/algorithms/non_mutating/max_element.html
+++ b/doc/html/range/reference/algorithms/non_mutating/max_element.html
@@ -28,7 +28,7 @@
           max_element</a>
 </h5></div></div></div>
 <a name="range.reference.algorithms.non_mutating.max_element.prototype"></a><h6>
-<a name="id3338066"></a>
+<a name="id832907"></a>
             <a class="link" href="max_element.html#range.reference.algorithms.non_mutating.max_element.prototype">Prototype</a>
           </h6>
 <p>
@@ -84,7 +84,7 @@
 <p>
           </p>
 <a name="range.reference.algorithms.non_mutating.max_element.description"></a><h6>
-<a name="id3339061"></a>
+<a name="id833871"></a>
             <a class="link" href="max_element.html#range.reference.algorithms.non_mutating.max_element.description">Description</a>
           </h6>
 <p>
@@ -98,14 +98,14 @@
             same manner as the returned iterator described above.
           </p>
 <a name="range.reference.algorithms.non_mutating.max_element.definition"></a><h6>
-<a name="id3339163"></a>
+<a name="id833970"></a>
             <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="id3339237"></a>
+<a name="id834043"></a>
             <a class="link" href="max_element.html#range.reference.algorithms.non_mutating.max_element.requirements">Requirements</a>
           </h6>
 <p>
@@ -142,7 +142,7 @@
               </li>
 </ul></div>
 <a name="range.reference.algorithms.non_mutating.max_element.complexity"></a><h6>
-<a name="id3339424"></a>
+<a name="id834225"></a>
             <a class="link" href="max_element.html#range.reference.algorithms.non_mutating.max_element.complexity">Complexity</a>
           </h6>
 <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 14f7973..1d91462 100644
--- a/doc/html/range/reference/algorithms/non_mutating/min_element.html
+++ b/doc/html/range/reference/algorithms/non_mutating/min_element.html
@@ -28,7 +28,7 @@
           min_element</a>
 </h5></div></div></div>
 <a name="range.reference.algorithms.non_mutating.min_element.prototype"></a><h6>
-<a name="id3339527"></a>
+<a name="id834326"></a>
             <a class="link" href="min_element.html#range.reference.algorithms.non_mutating.min_element.prototype">Prototype</a>
           </h6>
 <p>
@@ -84,7 +84,7 @@
 <p>
           </p>
 <a name="range.reference.algorithms.non_mutating.min_element.description"></a><h6>
-<a name="id3340522"></a>
+<a name="id835290"></a>
             <a class="link" href="min_element.html#range.reference.algorithms.non_mutating.min_element.description">Description</a>
           </h6>
 <p>
@@ -98,14 +98,14 @@
             same manner as the returned iterator described above.
           </p>
 <a name="range.reference.algorithms.non_mutating.min_element.definition"></a><h6>
-<a name="id3340625"></a>
+<a name="id835389"></a>
             <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="id3340699"></a>
+<a name="id835462"></a>
             <a class="link" href="min_element.html#range.reference.algorithms.non_mutating.min_element.requirements">Requirements</a>
           </h6>
 <p>
@@ -142,7 +142,7 @@
               </li>
 </ul></div>
 <a name="range.reference.algorithms.non_mutating.min_element.complexity"></a><h6>
-<a name="id3340886"></a>
+<a name="id835644"></a>
             <a class="link" href="min_element.html#range.reference.algorithms.non_mutating.min_element.complexity">Complexity</a>
           </h6>
 <p>
diff --git a/doc/html/range/reference/algorithms/non_mutating/mismatch.html b/doc/html/range/reference/algorithms/non_mutating/mismatch.html
index 0ae3639..484a7a0 100644
--- a/doc/html/range/reference/algorithms/non_mutating/mismatch.html
+++ b/doc/html/range/reference/algorithms/non_mutating/mismatch.html
@@ -28,7 +28,7 @@
           mismatch</a>
 </h5></div></div></div>
 <a name="range.reference.algorithms.non_mutating.mismatch.prototype"></a><h6>
-<a name="id3340990"></a>
+<a name="id835747"></a>
             <a class="link" href="mismatch.html#range.reference.algorithms.non_mutating.mismatch.prototype">Prototype</a>
           </h6>
 <p>
@@ -106,7 +106,7 @@
 <p>
           </p>
 <a name="range.reference.algorithms.non_mutating.mismatch.description"></a><h6>
-<a name="id3342708"></a>
+<a name="id837424"></a>
             <a class="link" href="mismatch.html#range.reference.algorithms.non_mutating.mismatch.description">Description</a>
           </h6>
 <p>
@@ -118,14 +118,14 @@
             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="id3342810"></a>
+<a name="id837522"></a>
             <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="id3342883"></a>
+<a name="id837593"></a>
             <a class="link" href="mismatch.html#range.reference.algorithms.non_mutating.mismatch.requirements">Requirements</a>
           </h6>
 <p>
@@ -186,14 +186,14 @@
               </li>
 </ul></div>
 <a name="range.reference.algorithms.non_mutating.mismatch.precondition_"></a><h6>
-<a name="id3343213"></a>
+<a name="id837918"></a>
             <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="id3343288"></a>
+<a name="id837991"></a>
             <a class="link" href="mismatch.html#range.reference.algorithms.non_mutating.mismatch.complexity">Complexity</a>
           </h6>
 <p>
diff --git a/doc/html/range/reference/algorithms/non_mutating/search.html b/doc/html/range/reference/algorithms/non_mutating/search.html
index 9c4f86a..16d35f0 100644
--- a/doc/html/range/reference/algorithms/non_mutating/search.html
+++ b/doc/html/range/reference/algorithms/non_mutating/search.html
@@ -28,7 +28,7 @@
           search</a>
 </h5></div></div></div>
 <a name="range.reference.algorithms.non_mutating.search.prototype"></a><h6>
-<a name="id3343358"></a>
+<a name="id838060"></a>
             <a class="link" href="search.html#range.reference.algorithms.non_mutating.search.prototype">Prototype</a>
           </h6>
 <p>
@@ -96,7 +96,7 @@
 <p>
           </p>
 <a name="range.reference.algorithms.non_mutating.search.description"></a><h6>
-<a name="id3344704"></a>
+<a name="id839638"></a>
             <a class="link" href="search.html#range.reference.algorithms.non_mutating.search.description">Description</a>
           </h6>
 <p>
@@ -115,14 +115,14 @@
             same manner as the returned iterator described above.
           </p>
 <a name="range.reference.algorithms.non_mutating.search.definition"></a><h6>
-<a name="id3344878"></a>
+<a name="id839805"></a>
             <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="id3344951"></a>
+<a name="id839876"></a>
             <a class="link" href="search.html#range.reference.algorithms.non_mutating.search.requirements">Requirements</a>
           </h6>
 <p>
@@ -183,7 +183,7 @@
               </li>
 </ul></div>
 <a name="range.reference.algorithms.non_mutating.search.complexity"></a><h6>
-<a name="id3345279"></a>
+<a name="id840195"></a>
             <a class="link" href="search.html#range.reference.algorithms.non_mutating.search.complexity">Complexity</a>
           </h6>
 <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 1961ecf..394072c 100644
--- a/doc/html/range/reference/algorithms/non_mutating/search_n.html
+++ b/doc/html/range/reference/algorithms/non_mutating/search_n.html
@@ -28,7 +28,7 @@
           search_n</a>
 </h5></div></div></div>
 <a name="range.reference.algorithms.non_mutating.search_n.prototype"></a><h6>
-<a name="id3345322"></a>
+<a name="id840239"></a>
             <a class="link" href="search_n.html#range.reference.algorithms.non_mutating.search_n.prototype">Prototype</a>
           </h6>
 <p>
@@ -55,7 +55,7 @@
 <p>
           </p>
 <a name="range.reference.algorithms.non_mutating.search_n.description"></a><h6>
-<a name="id3346078"></a>
+<a name="id840972"></a>
             <a class="link" href="search_n.html#range.reference.algorithms.non_mutating.search_n.description">Description</a>
           </h6>
 <p>
@@ -64,14 +64,14 @@
             and by a predicate when one is supplied.
           </p>
 <a name="range.reference.algorithms.non_mutating.search_n.definition"></a><h6>
-<a name="id3346150"></a>
+<a name="id841041"></a>
             <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="id3346222"></a>
+<a name="id841112"></a>
             <a class="link" href="search_n.html#range.reference.algorithms.non_mutating.search_n.requirements">Requirements</a>
           </h6>
 <p>
@@ -125,7 +125,7 @@
               </li>
 </ul></div>
 <a name="range.reference.algorithms.non_mutating.search_n.complexity"></a><h6>
-<a name="id3346525"></a>
+<a name="id841408"></a>
             <a class="link" href="search_n.html#range.reference.algorithms.non_mutating.search_n.complexity">Complexity</a>
           </h6>
 <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 0ef9e03..be7c7e7 100644
--- a/doc/html/range/reference/algorithms/non_mutating/upper_bound.html
+++ b/doc/html/range/reference/algorithms/non_mutating/upper_bound.html
@@ -28,7 +28,7 @@
           upper_bound</a>
 </h5></div></div></div>
 <a name="range.reference.algorithms.non_mutating.upper_bound.prototype"></a><h6>
-<a name="id3346572"></a>
+<a name="id841454"></a>
             <a class="link" href="upper_bound.html#range.reference.algorithms.non_mutating.upper_bound.prototype">Prototype</a>
           </h6>
 <p>
@@ -49,7 +49,7 @@
 <p>
           </p>
 <a name="range.reference.algorithms.non_mutating.upper_bound.description"></a><h6>
-<a name="id3346866"></a>
+<a name="id841738"></a>
             <a class="link" href="upper_bound.html#range.reference.algorithms.non_mutating.upper_bound.description">Description</a>
           </h6>
 <p>
@@ -71,14 +71,14 @@
             same manner as the returned iterator described above.
           </p>
 <a name="range.reference.algorithms.non_mutating.upper_bound.definition"></a><h6>
-<a name="id3347068"></a>
+<a name="id841934"></a>
             <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="id3347142"></a>
+<a name="id842007"></a>
             <a class="link" href="upper_bound.html#range.reference.algorithms.non_mutating.upper_bound.requirements">Requirements</a>
           </h6>
 <p>
@@ -129,7 +129,7 @@
               </li>
 </ul></div>
 <a name="range.reference.algorithms.non_mutating.upper_bound.precondition_"></a><h6>
-<a name="id3347425"></a>
+<a name="id842284"></a>
             <a class="link" href="upper_bound.html#range.reference.algorithms.non_mutating.upper_bound.precondition_">Precondition:</a>
           </h6>
 <p>
@@ -147,7 +147,7 @@
             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="id3347522"></a>
+<a name="id842377"></a>
             <a class="link" href="upper_bound.html#range.reference.algorithms.non_mutating.upper_bound.complexity">Complexity</a>
           </h6>
 <p>
diff --git a/doc/html/range/reference/algorithms/numeric/accumulate.html b/doc/html/range/reference/algorithms/numeric/accumulate.html
index 6ea2097..2243e8c 100644
--- a/doc/html/range/reference/algorithms/numeric/accumulate.html
+++ b/doc/html/range/reference/algorithms/numeric/accumulate.html
@@ -27,7 +27,7 @@
 <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="id3365780"></a>
+<a name="id860544"></a>
             <a class="link" href="accumulate.html#range.reference.algorithms.numeric.accumulate.prototype">Prototype</a>
           </h6>
 <p>
@@ -52,7 +52,7 @@
 <p>
           </p>
 <a name="range.reference.algorithms.numeric.accumulate.description"></a><h6>
-<a name="id3366045"></a>
+<a name="id860802"></a>
             <a class="link" href="accumulate.html#range.reference.algorithms.numeric.accumulate.description">Description</a>
           </h6>
 <p>
@@ -63,18 +63,18 @@
             The return value is the resultant value of the above algorithm.
           </p>
 <a name="range.reference.algorithms.numeric.accumulate.definition"></a><h6>
-<a name="id3366125"></a>
+<a name="id860880"></a>
             <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="id3366189"></a>
+<a name="id860942"></a>
             <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="id3366213"></a>
+<a name="id860966"></a>
             <a class="link" href="accumulate.html#range.reference.algorithms.numeric.accumulate.for_the_first_version">For
             the first version</a>
           </h6>
@@ -99,7 +99,7 @@
               </li>
 </ol></div>
 <a name="range.reference.algorithms.numeric.accumulate.for_the_second_version"></a><h6>
-<a name="id3366363"></a>
+<a name="id861115"></a>
             <a class="link" href="accumulate.html#range.reference.algorithms.numeric.accumulate.for_the_second_version">For
             the second version</a>
           </h6>
@@ -133,7 +133,7 @@
               </li>
 </ol></div>
 <a name="range.reference.algorithms.numeric.accumulate.complexity"></a><h6>
-<a name="id3366566"></a>
+<a name="id861313"></a>
             <a class="link" href="accumulate.html#range.reference.algorithms.numeric.accumulate.complexity">Complexity</a>
           </h6>
 <p>
diff --git a/doc/html/range/reference/algorithms/numeric/adjacent_difference.html b/doc/html/range/reference/algorithms/numeric/adjacent_difference.html
index 57d2bf8..0bfe131 100644
--- a/doc/html/range/reference/algorithms/numeric/adjacent_difference.html
+++ b/doc/html/range/reference/algorithms/numeric/adjacent_difference.html
@@ -28,7 +28,7 @@
           adjacent_difference</a>
 </h5></div></div></div>
 <a name="range.reference.algorithms.numeric.adjacent_difference.prototype"></a><h6>
-<a name="id3366638"></a>
+<a name="id861384"></a>
             <a class="link" href="adjacent_difference.html#range.reference.algorithms.numeric.adjacent_difference.prototype">Prototype</a>
           </h6>
 <p>
@@ -55,7 +55,7 @@
 <p>
           </p>
 <a name="range.reference.algorithms.numeric.adjacent_difference.description"></a><h6>
-<a name="id3366906"></a>
+<a name="id861646"></a>
             <a class="link" href="adjacent_difference.html#range.reference.algorithms.numeric.adjacent_difference.description">Description</a>
           </h6>
 <p>
@@ -69,18 +69,18 @@
             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="id3367013"></a>
+<a name="id861750"></a>
             <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="id3367077"></a>
+<a name="id861814"></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.for_the_first_version"></a><h6>
-<a name="id3367102"></a>
+<a name="id861837"></a>
             <a class="link" href="adjacent_difference.html#range.reference.algorithms.numeric.adjacent_difference.for_the_first_version">For
             the first version</a>
           </h6>
@@ -111,7 +111,7 @@
               </li>
 </ol></div>
 <a name="range.reference.algorithms.numeric.adjacent_difference.for_the_second_version"></a><h6>
-<a name="id3367322"></a>
+<a name="id862051"></a>
             <a class="link" href="adjacent_difference.html#range.reference.algorithms.numeric.adjacent_difference.for_the_second_version">For
             the second version</a>
           </h6>
@@ -146,7 +146,7 @@
               </li>
 </ol></div>
 <a name="range.reference.algorithms.numeric.adjacent_difference.precondition_"></a><h6>
-<a name="id3367527"></a>
+<a name="id862253"></a>
             <a class="link" href="adjacent_difference.html#range.reference.algorithms.numeric.adjacent_difference.precondition_">Precondition:</a>
           </h6>
 <p>
@@ -154,7 +154,7 @@
             <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="id3367604"></a>
+<a name="id862327"></a>
             <a class="link" href="adjacent_difference.html#range.reference.algorithms.numeric.adjacent_difference.complexity">Complexity</a>
           </h6>
 <p>
diff --git a/doc/html/range/reference/algorithms/numeric/inner_product.html b/doc/html/range/reference/algorithms/numeric/inner_product.html
index 76a07fc..021ae08 100644
--- a/doc/html/range/reference/algorithms/numeric/inner_product.html
+++ b/doc/html/range/reference/algorithms/numeric/inner_product.html
@@ -28,7 +28,7 @@
           inner_product</a>
 </h5></div></div></div>
 <a name="range.reference.algorithms.numeric.inner_product.prototype"></a><h6>
-<a name="id3367710"></a>
+<a name="id862430"></a>
             <a class="link" href="inner_product.html#range.reference.algorithms.numeric.inner_product.prototype">Prototype</a>
           </h6>
 <p>
@@ -54,7 +54,7 @@
 <p>
           </p>
 <a name="range.reference.algorithms.numeric.inner_product.description"></a><h6>
-<a name="id3368077"></a>
+<a name="id862790"></a>
             <a class="link" href="inner_product.html#range.reference.algorithms.numeric.inner_product.description">Description</a>
           </h6>
 <p>
@@ -67,18 +67,18 @@
             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="id3368158"></a>
+<a name="id862869"></a>
             <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="id3368223"></a>
+<a name="id862931"></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.for_the_first_version"></a><h6>
-<a name="id3368246"></a>
+<a name="id862955"></a>
             <a class="link" href="inner_product.html#range.reference.algorithms.numeric.inner_product.for_the_first_version">For
             the first version</a>
           </h6>
@@ -113,7 +113,7 @@
               </li>
 </ol></div>
 <a name="range.reference.algorithms.numeric.inner_product.for_the_second_version"></a><h6>
-<a name="id3368514"></a>
+<a name="id863220"></a>
             <a class="link" href="inner_product.html#range.reference.algorithms.numeric.inner_product.for_the_second_version">For
             the second version</a>
           </h6>
@@ -162,14 +162,14 @@
               </li>
 </ol></div>
 <a name="range.reference.algorithms.numeric.inner_product.precondition_"></a><h6>
-<a name="id3368832"></a>
+<a name="id863533"></a>
             <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="id3368908"></a>
+<a name="id863606"></a>
             <a class="link" href="inner_product.html#range.reference.algorithms.numeric.inner_product.complexity">Complexity</a>
           </h6>
 <p>
diff --git a/doc/html/range/reference/algorithms/numeric/partial_sum.html b/doc/html/range/reference/algorithms/numeric/partial_sum.html
index 0967f12..e1d88c8 100644
--- a/doc/html/range/reference/algorithms/numeric/partial_sum.html
+++ b/doc/html/range/reference/algorithms/numeric/partial_sum.html
@@ -28,7 +28,7 @@
           partial_sum</a>
 </h5></div></div></div>
 <a name="range.reference.algorithms.numeric.partial_sum.prototype"></a><h6>
-<a name="id3368977"></a>
+<a name="id863674"></a>
             <a class="link" href="partial_sum.html#range.reference.algorithms.numeric.partial_sum.prototype">Prototype</a>
           </h6>
 <p>
@@ -49,7 +49,7 @@
 <p>
           </p>
 <a name="range.reference.algorithms.numeric.partial_sum.description"></a><h6>
-<a name="id3369235"></a>
+<a name="id863926"></a>
             <a class="link" href="partial_sum.html#range.reference.algorithms.numeric.partial_sum.description">Description</a>
           </h6>
 <p>
@@ -58,18 +58,18 @@
             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="id3369379"></a>
+<a name="id864065"></a>
             <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="id3369443"></a>
+<a name="id864128"></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.for_the_first_version"></a><h6>
-<a name="id3369466"></a>
+<a name="id864151"></a>
             <a class="link" href="partial_sum.html#range.reference.algorithms.numeric.partial_sum.for_the_first_version">For
             the first version</a>
           </h6>
@@ -99,7 +99,7 @@
               </li>
 </ol></div>
 <a name="range.reference.algorithms.numeric.partial_sum.for_the_second_version"></a><h6>
-<a name="id3369685"></a>
+<a name="id864365"></a>
             <a class="link" href="partial_sum.html#range.reference.algorithms.numeric.partial_sum.for_the_second_version">For
             the second version</a>
           </h6>
@@ -128,7 +128,7 @@
               </li>
 </ol></div>
 <a name="range.reference.algorithms.numeric.partial_sum.precondition_"></a><h6>
-<a name="id3369862"></a>
+<a name="id864536"></a>
             <a class="link" href="partial_sum.html#range.reference.algorithms.numeric.partial_sum.precondition_">Precondition:</a>
           </h6>
 <p>
@@ -136,7 +136,7 @@
             <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="id3369938"></a>
+<a name="id864610"></a>
             <a class="link" href="partial_sum.html#range.reference.algorithms.numeric.partial_sum.complexity">Complexity</a>
           </h6>
 <p>
diff --git a/doc/html/range/reference/algorithms/permutation/next_permutation.html b/doc/html/range/reference/algorithms/permutation/next_permutation.html
index c7533d7..73502be 100644
--- a/doc/html/range/reference/algorithms/permutation/next_permutation.html
+++ b/doc/html/range/reference/algorithms/permutation/next_permutation.html
@@ -28,7 +28,7 @@
           next_permutation</a>
 </h5></div></div></div>
 <a name="range.reference.algorithms.permutation.next_permutation.prototype"></a><h6>
-<a name="id3357786"></a>
+<a name="id852445"></a>
             <a class="link" href="next_permutation.html#range.reference.algorithms.permutation.next_permutation.prototype">Prototype</a>
           </h6>
 <p>
@@ -49,7 +49,7 @@
 <p>
           </p>
 <a name="range.reference.algorithms.permutation.next_permutation.description"></a><h6>
-<a name="id3358135"></a>
+<a name="id852789"></a>
             <a class="link" href="next_permutation.html#range.reference.algorithms.permutation.next_permutation.description">Description</a>
           </h6>
 <p>
@@ -67,14 +67,14 @@
             the predicate versions.
           </p>
 <a name="range.reference.algorithms.permutation.next_permutation.definition"></a><h6>
-<a name="id3358243"></a>
+<a name="id852893"></a>
             <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="id3358317"></a>
+<a name="id852965"></a>
             <a class="link" href="next_permutation.html#range.reference.algorithms.permutation.next_permutation.requirements">Requirements</a>
           </h6>
 <p>
@@ -125,7 +125,7 @@
               </li>
 </ul></div>
 <a name="range.reference.algorithms.permutation.next_permutation.complexity"></a><h6>
-<a name="id3358579"></a>
+<a name="id853224"></a>
             <a class="link" href="next_permutation.html#range.reference.algorithms.permutation.next_permutation.complexity">Complexity</a>
           </h6>
 <p>
diff --git a/doc/html/range/reference/algorithms/permutation/prev_permutation.html b/doc/html/range/reference/algorithms/permutation/prev_permutation.html
index 090c6c0..b1eb2bb 100644
--- a/doc/html/range/reference/algorithms/permutation/prev_permutation.html
+++ b/doc/html/range/reference/algorithms/permutation/prev_permutation.html
@@ -28,7 +28,7 @@
           prev_permutation</a>
 </h5></div></div></div>
 <a name="range.reference.algorithms.permutation.prev_permutation.prototype"></a><h6>
-<a name="id3358659"></a>
+<a name="id853305"></a>
             <a class="link" href="prev_permutation.html#range.reference.algorithms.permutation.prev_permutation.prototype">Prototype</a>
           </h6>
 <p>
@@ -49,7 +49,7 @@
 <p>
           </p>
 <a name="range.reference.algorithms.permutation.prev_permutation.description"></a><h6>
-<a name="id3359011"></a>
+<a name="id853649"></a>
             <a class="link" href="prev_permutation.html#range.reference.algorithms.permutation.prev_permutation.description">Description</a>
           </h6>
 <p>
@@ -67,14 +67,14 @@
             the predicate versions.
           </p>
 <a name="range.reference.algorithms.permutation.prev_permutation.definition"></a><h6>
-<a name="id3359119"></a>
+<a name="id853755"></a>
             <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="id3359193"></a>
+<a name="id853828"></a>
             <a class="link" href="prev_permutation.html#range.reference.algorithms.permutation.prev_permutation.requirements">Requirements</a>
           </h6>
 <p>
@@ -125,7 +125,7 @@
               </li>
 </ul></div>
 <a name="range.reference.algorithms.permutation.prev_permutation.complexity"></a><h6>
-<a name="id3359455"></a>
+<a name="id854087"></a>
             <a class="link" href="prev_permutation.html#range.reference.algorithms.permutation.prev_permutation.complexity">Complexity</a>
           </h6>
 <p>
diff --git a/doc/html/range/reference/algorithms/set/includes.html b/doc/html/range/reference/algorithms/set/includes.html
index 0e7e4b6..dc960b9 100644
--- a/doc/html/range/reference/algorithms/set/includes.html
+++ b/doc/html/range/reference/algorithms/set/includes.html
@@ -27,7 +27,7 @@
 <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="id3347682"></a>
+<a name="id842532"></a>
             <a class="link" href="includes.html#range.reference.algorithms.set.includes.prototype">Prototype</a>
           </h6>
 <p>
@@ -47,7 +47,7 @@
 <p>
           </p>
 <a name="range.reference.algorithms.set.includes.description"></a><h6>
-<a name="id3347965"></a>
+<a name="id842809"></a>
             <a class="link" href="includes.html#range.reference.algorithms.set.includes.description">Description</a>
           </h6>
 <p>
@@ -59,14 +59,14 @@
             the predicate versions.
           </p>
 <a name="range.reference.algorithms.set.includes.definition"></a><h6>
-<a name="id3348062"></a>
+<a name="id842906"></a>
             <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="id3348134"></a>
+<a name="id842976"></a>
             <a class="link" href="includes.html#range.reference.algorithms.set.includes.requirements">Requirements</a>
           </h6>
 <p>
@@ -144,7 +144,7 @@
               </li>
 </ul></div>
 <a name="range.reference.algorithms.set.includes.precondition_"></a><h6>
-<a name="id3348567"></a>
+<a name="id843405"></a>
             <a class="link" href="includes.html#range.reference.algorithms.set.includes.precondition_">Precondition:</a>
           </h6>
 <p>
@@ -162,7 +162,7 @@
             according to <code class="computeroutput"><span class="identifier">pred</span></code>.
           </p>
 <a name="range.reference.algorithms.set.includes.complexity"></a><h6>
-<a name="id3348686"></a>
+<a name="id843520"></a>
             <a class="link" href="includes.html#range.reference.algorithms.set.includes.complexity">Complexity</a>
           </h6>
 <p>
diff --git a/doc/html/range/reference/algorithms/set/set_difference.html b/doc/html/range/reference/algorithms/set/set_difference.html
index c53281e..80c4cff 100644
--- a/doc/html/range/reference/algorithms/set/set_difference.html
+++ b/doc/html/range/reference/algorithms/set/set_difference.html
@@ -27,7 +27,7 @@
 <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="id3351318"></a>
+<a name="id846098"></a>
             <a class="link" href="set_difference.html#range.reference.algorithms.set.set_difference.prototype">Prototype</a>
           </h6>
 <p>
@@ -56,7 +56,7 @@
 <p>
           </p>
 <a name="range.reference.algorithms.set.set_difference.description"></a><h6>
-<a name="id3351669"></a>
+<a name="id846439"></a>
             <a class="link" href="set_difference.html#range.reference.algorithms.set.set_difference.description">Description</a>
           </h6>
 <p>
@@ -70,14 +70,14 @@
             the predicate versions.
           </p>
 <a name="range.reference.algorithms.set.set_difference.definition"></a><h6>
-<a name="id3351760"></a>
+<a name="id846529"></a>
             <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="id3351833"></a>
+<a name="id846601"></a>
             <a class="link" href="set_difference.html#range.reference.algorithms.set.set_difference.requirements">Requirements</a>
           </h6>
 <p>
@@ -163,7 +163,7 @@
               </li>
 </ul></div>
 <a name="range.reference.algorithms.set.set_difference.precondition_"></a><h6>
-<a name="id3352325"></a>
+<a name="id847086"></a>
             <a class="link" href="set_difference.html#range.reference.algorithms.set.set_difference.precondition_">Precondition:</a>
           </h6>
 <p>
@@ -181,7 +181,7 @@
             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="id3352443"></a>
+<a name="id847201"></a>
             <a class="link" href="set_difference.html#range.reference.algorithms.set.set_difference.complexity">Complexity</a>
           </h6>
 <p>
diff --git a/doc/html/range/reference/algorithms/set/set_intersection.html b/doc/html/range/reference/algorithms/set/set_intersection.html
index b77838f..cde3eb5 100644
--- a/doc/html/range/reference/algorithms/set/set_intersection.html
+++ b/doc/html/range/reference/algorithms/set/set_intersection.html
@@ -28,7 +28,7 @@
           set_intersection</a>
 </h5></div></div></div>
 <a name="range.reference.algorithms.set.set_intersection.prototype"></a><h6>
-<a name="id3350062"></a>
+<a name="id844869"></a>
             <a class="link" href="set_intersection.html#range.reference.algorithms.set.set_intersection.prototype">Prototype</a>
           </h6>
 <p>
@@ -57,7 +57,7 @@
 <p>
           </p>
 <a name="range.reference.algorithms.set.set_intersection.description"></a><h6>
-<a name="id3350412"></a>
+<a name="id845211"></a>
             <a class="link" href="set_intersection.html#range.reference.algorithms.set.set_intersection.description">Description</a>
           </h6>
 <p>
@@ -71,14 +71,14 @@
             the predicate versions.
           </p>
 <a name="range.reference.algorithms.set.set_intersection.definition"></a><h6>
-<a name="id3350504"></a>
+<a name="id845301"></a>
             <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="id3350578"></a>
+<a name="id845372"></a>
             <a class="link" href="set_intersection.html#range.reference.algorithms.set.set_intersection.requirements">Requirements</a>
           </h6>
 <p>
@@ -164,7 +164,7 @@
               </li>
 </ul></div>
 <a name="range.reference.algorithms.set.set_intersection.precondition_"></a><h6>
-<a name="id3351071"></a>
+<a name="id845858"></a>
             <a class="link" href="set_intersection.html#range.reference.algorithms.set.set_intersection.precondition_">Precondition:</a>
           </h6>
 <p>
@@ -182,7 +182,7 @@
             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="id3351190"></a>
+<a name="id845974"></a>
             <a class="link" href="set_intersection.html#range.reference.algorithms.set.set_intersection.complexity">Complexity</a>
           </h6>
 <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 bef721c..4be44e6 100644
--- a/doc/html/range/reference/algorithms/set/set_symmetric_difference.html
+++ b/doc/html/range/reference/algorithms/set/set_symmetric_difference.html
@@ -28,7 +28,7 @@
           set_symmetric_difference</a>
 </h5></div></div></div>
 <a name="range.reference.algorithms.set.set_symmetric_difference.prototype"></a><h6>
-<a name="id3352573"></a>
+<a name="id847328"></a>
             <a class="link" href="set_symmetric_difference.html#range.reference.algorithms.set.set_symmetric_difference.prototype">Prototype</a>
           </h6>
 <p>
@@ -59,7 +59,7 @@
 <p>
           </p>
 <a name="range.reference.algorithms.set.set_symmetric_difference.description"></a><h6>
-<a name="id3352924"></a>
+<a name="id847671"></a>
             <a class="link" href="set_symmetric_difference.html#range.reference.algorithms.set.set_symmetric_difference.description">Description</a>
           </h6>
 <p>
@@ -75,14 +75,14 @@
             the predicate versions.
           </p>
 <a name="range.reference.algorithms.set.set_symmetric_difference.definition"></a><h6>
-<a name="id3353017"></a>
+<a name="id847762"></a>
             <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="id3353091"></a>
+<a name="id847834"></a>
             <a class="link" href="set_symmetric_difference.html#range.reference.algorithms.set.set_symmetric_difference.requirements">Requirements</a>
           </h6>
 <p>
@@ -168,7 +168,7 @@
               </li>
 </ul></div>
 <a name="range.reference.algorithms.set.set_symmetric_difference.precondition_"></a><h6>
-<a name="id3353582"></a>
+<a name="id848321"></a>
             <a class="link" href="set_symmetric_difference.html#range.reference.algorithms.set.set_symmetric_difference.precondition_">Precondition:</a>
           </h6>
 <p>
@@ -186,7 +186,7 @@
             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="id3353703"></a>
+<a name="id848437"></a>
             <a class="link" href="set_symmetric_difference.html#range.reference.algorithms.set.set_symmetric_difference.complexity">Complexity</a>
           </h6>
 <p>
diff --git a/doc/html/range/reference/algorithms/set/set_union.html b/doc/html/range/reference/algorithms/set/set_union.html
index 026159c..b963850 100644
--- a/doc/html/range/reference/algorithms/set/set_union.html
+++ b/doc/html/range/reference/algorithms/set/set_union.html
@@ -27,7 +27,7 @@
 <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="id3348812"></a>
+<a name="id843644"></a>
             <a class="link" href="set_union.html#range.reference.algorithms.set.set_union.prototype">Prototype</a>
           </h6>
 <p>
@@ -56,7 +56,7 @@
 <p>
           </p>
 <a name="range.reference.algorithms.set.set_union.description"></a><h6>
-<a name="id3349162"></a>
+<a name="id843986"></a>
             <a class="link" href="set_union.html#range.reference.algorithms.set.set_union.description">Description</a>
           </h6>
 <p>
@@ -69,14 +69,14 @@
             in the predicate versions.
           </p>
 <a name="range.reference.algorithms.set.set_union.definition"></a><h6>
-<a name="id3349252"></a>
+<a name="id844073"></a>
             <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="id3349324"></a>
+<a name="id844144"></a>
             <a class="link" href="set_union.html#range.reference.algorithms.set.set_union.requirements">Requirements</a>
           </h6>
 <p>
@@ -162,7 +162,7 @@
               </li>
 </ul></div>
 <a name="range.reference.algorithms.set.set_union.precondition_"></a><h6>
-<a name="id3349816"></a>
+<a name="id844630"></a>
             <a class="link" href="set_union.html#range.reference.algorithms.set.set_union.precondition_">Precondition:</a>
           </h6>
 <p>
@@ -180,7 +180,7 @@
             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="id3349934"></a>
+<a name="id844744"></a>
             <a class="link" href="set_union.html#range.reference.algorithms.set.set_union.complexity">Complexity</a>
           </h6>
 <p>
diff --git a/doc/html/range/reference/concept_implementation/semantics.html b/doc/html/range/reference/concept_implementation/semantics.html
index 59fc394..55a2106 100644
--- a/doc/html/range/reference/concept_implementation/semantics.html
+++ b/doc/html/range/reference/concept_implementation/semantics.html
@@ -31,7 +31,7 @@
 <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="id3271198"></a>
+<a name="id766560"></a>
           <a class="link" href="semantics.html#range.reference.concept_implementation.semantics.notation">notation</a>
         </h6>
 <div class="informaltable"><table class="table">
diff --git a/doc/html/range/reference/ranges/counting_range.html b/doc/html/range/reference/ranges/counting_range.html
index b1d7294..01d404d 100644
--- a/doc/html/range/reference/ranges/counting_range.html
+++ b/doc/html/range/reference/ranges/counting_range.html
@@ -27,7 +27,7 @@
 <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="id3370060"></a>
+<a name="id864730"></a>
           <a class="link" href="counting_range.html#range.reference.ranges.counting_range.prototype">Prototype</a>
         </h6>
 <p>
@@ -48,7 +48,7 @@
 <p>
         </p>
 <a name="range.reference.ranges.counting_range.description"></a><h6>
-<a name="id3370446"></a>
+<a name="id865103"></a>
           <a class="link" href="counting_range.html#range.reference.ranges.counting_range.description">Description</a>
         </h6>
 <p>
@@ -58,14 +58,14 @@
           (from Boost.Iterator).
         </p>
 <a name="range.reference.ranges.counting_range.definition"></a><h6>
-<a name="id3370504"></a>
+<a name="id865161"></a>
           <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="id3370568"></a>
+<a name="id865223"></a>
           <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">
diff --git a/doc/html/range/reference/ranges/irange.html b/doc/html/range/reference/ranges/irange.html
index da9b33a..3beff0b 100644
--- a/doc/html/range/reference/ranges/irange.html
+++ b/doc/html/range/reference/ranges/irange.html
@@ -27,7 +27,7 @@
 <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="id3371012"></a>
+<a name="id865658"></a>
           <a class="link" href="irange.html#range.reference.ranges.irange.prototype">Prototype</a>
         </h6>
 <p>
@@ -44,7 +44,7 @@
 <p>
         </p>
 <a name="range.reference.ranges.irange.description"></a><h6>
-<a name="id3371308"></a>
+<a name="id865946"></a>
           <a class="link" href="irange.html#range.reference.ranges.irange.description">Description</a>
         </h6>
 <p>
@@ -58,14 +58,14 @@
           parameters denoted a half-open range.
         </p>
 <a name="range.reference.ranges.irange.definition"></a><h6>
-<a name="id3371389"></a>
+<a name="id866026"></a>
           <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="id3371452"></a>
+<a name="id866088"></a>
           <a class="link" href="irange.html#range.reference.ranges.irange.requirements">Requirements</a>
         </h6>
 <div class="orderedlist"><ol class="orderedlist" type="1">
@@ -80,7 +80,7 @@
             </li>
 </ol></div>
 <a name="range.reference.ranges.irange.complexity"></a><h6>
-<a name="id3371539"></a>
+<a name="id866173"></a>
           <a class="link" href="irange.html#range.reference.ranges.irange.complexity">Complexity</a>
         </h6>
 <p>
diff --git a/doc/html/range/reference/ranges/istream_range.html b/doc/html/range/reference/ranges/istream_range.html
index 52bb89c..df2709c 100644
--- a/doc/html/range/reference/ranges/istream_range.html
+++ b/doc/html/range/reference/ranges/istream_range.html
@@ -27,7 +27,7 @@
 <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="id3370645"></a>
+<a name="id865300"></a>
           <a class="link" href="istream_range.html#range.reference.ranges.istream_range.prototype">Prototype</a>
         </h6>
 <p>
@@ -40,7 +40,7 @@
 <p>
         </p>
 <a name="range.reference.ranges.istream_range.description"></a><h6>
-<a name="id3370864"></a>
+<a name="id865512"></a>
           <a class="link" href="istream_range.html#range.reference.ranges.istream_range.description">Description</a>
         </h6>
 <p>
@@ -49,7 +49,7 @@
           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="id3370932"></a>
+<a name="id865579"></a>
           <a class="link" href="istream_range.html#range.reference.ranges.istream_range.definition">Definition</a>
         </h6>
 <p>
diff --git a/doc/html/range/reference/utilities/iterator_range.html b/doc/html/range/reference/utilities/iterator_range.html
index 27df4a0..fb41371 100644
--- a/doc/html/range/reference/utilities/iterator_range.html
+++ b/doc/html/range/reference/utilities/iterator_range.html
@@ -48,7 +48,7 @@
           type.
         </p>
 <a name="range.reference.utilities.iterator_range.synopsis"></a><h5>
-<a name="id3371932"></a>
+<a name="id866556"></a>
           <a class="link" href="iterator_range.html#range.reference.utilities.iterator_range.synopsis">Synopsis</a>
         </h5>
 <p>
@@ -188,7 +188,7 @@
           iterators from the same container.
         </p>
 <a name="range.reference.utilities.iterator_range.details_member_functions"></a><h5>
-<a name="id3375164"></a>
+<a name="id869702"></a>
           <a class="link" href="iterator_range.html#range.reference.utilities.iterator_range.details_member_functions">Details
           member functions</a>
         </h5>
@@ -207,7 +207,7 @@
             <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="id3375402"></a>
+<a name="id869933"></a>
           <a class="link" href="iterator_range.html#range.reference.utilities.iterator_range.details_functions">Details
           functions</a>
         </h5>
diff --git a/doc/html/range/reference/utilities/join.html b/doc/html/range/reference/utilities/join.html
index 458ed2e..a06440d 100644
--- a/doc/html/range/reference/utilities/join.html
+++ b/doc/html/range/reference/utilities/join.html
@@ -39,7 +39,7 @@
           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="id3377826"></a>
+<a name="id872294"></a>
           <a class="link" href="join.html#range.reference.utilities.join.synposis">Synposis</a>
         </h5>
 <p>
@@ -65,7 +65,7 @@
 <p>
         </p>
 <a name="range.reference.utilities.join.example"></a><h5>
-<a name="id3378374"></a>
+<a name="id872828"></a>
           <a class="link" href="join.html#range.reference.utilities.join.example">Example</a>
         </h5>
 <p>
diff --git a/doc/html/range/reference/utilities/sub_range.html b/doc/html/range/reference/utilities/sub_range.html
index 684c838..ebbf648 100644
--- a/doc/html/range/reference/utilities/sub_range.html
+++ b/doc/html/range/reference/utilities/sub_range.html
@@ -35,7 +35,7 @@
           is.
         </p>
 <a name="range.reference.utilities.sub_range.synopsis"></a><h5>
-<a name="id3376547"></a>
+<a name="id871048"></a>
           <a class="link" href="sub_range.html#range.reference.utilities.sub_range.synopsis">Synopsis</a>
         </h5>
 <p>
diff --git a/doc/html/standalone_HTML.manifest b/doc/html/standalone_HTML.manifest
deleted file mode 100644
index e9d38e8..0000000
--- a/doc/html/standalone_HTML.manifest
+++ /dev/null
@@ -1,19 +0,0 @@
-index.html
-range/concepts.html
-range/concepts/single_pass_range.html
-range/concepts/forward_range.html
-range/concepts/bidirectional_range.html
-range/concepts/random_access_range.html
-range/concepts/concept_checking.html
-range/reference.html
-range/reference/synopsis.html
-range/reference/semantics.html
-range/reference/extending.html
-range/utilities.html
-range/utilities/sub_range.html
-range/style_guide.html
-range/library_headers.html
-range/examples.html
-range/portability.html
-range/faq.html
-range/history_ack.html

From 6d46ce412f21cd8cbaa9e44c9567855a6029332c Mon Sep 17 00:00:00 2001
From: Neil Groves <neil@grovescomputing.com>
Date: Mon, 10 Jan 2011 06:35:02 +0000
Subject: [PATCH 42/73] [range] - merge the tested changes from the trunk in
 preparation for the 1.46 release.

[SVN r67905]
---
 doc/boost_range.qbk                           |   2 +
 doc/html/index.html                           |   5 +-
 doc/html/quickbook_HTML.manifest              |   2 +
 .../range/concepts/bidirectional_range.html   |  16 +-
 doc/html/range/concepts/concept_checking.html |   2 +-
 doc/html/range/concepts/forward_range.html    |  10 +-
 .../range/concepts/random_access_range.html   |  12 +-
 .../range/concepts/single_pass_range.html     |  16 +-
 doc/html/range/history_ack.html               |   4 +-
 doc/html/range/introduction.html              |   6 +-
 doc/html/range/mfc_atl.html                   |   4 +-
 doc/html/range/reference.html                 |   1 +
 .../reference/adaptors/introduction.html      |   6 +-
 .../range/reference/adaptors/reference.html   |   1 +
 .../reference/adaptors/reference/strided.html |  10 +-
 .../adaptors/reference/tokenized.html         |   6 +-
 .../adaptors/reference/type_erased.html       | 305 +++++++++
 .../reference/algorithms/heap/make_heap.html  |  10 +-
 .../reference/algorithms/heap/pop_heap.html   |  12 +-
 .../reference/algorithms/heap/push_heap.html  |  12 +-
 .../reference/algorithms/heap/sort_heap.html  |  12 +-
 .../reference/algorithms/mutating/copy.html   |  12 +-
 .../algorithms/mutating/copy_backward.html    |  12 +-
 .../reference/algorithms/mutating/fill.html   |  10 +-
 .../reference/algorithms/mutating/fill_n.html |  10 +-
 .../algorithms/mutating/generate.html         |  12 +-
 .../algorithms/mutating/inplace_merge.html    |  16 +-
 .../reference/algorithms/mutating/merge.html  |  16 +-
 .../algorithms/mutating/nth_element.html      |  10 +-
 .../algorithms/mutating/partial_sort.html     |  10 +-
 .../algorithms/mutating/partition.html        |  10 +-
 .../algorithms/mutating/random_shuffle.html   |  12 +-
 .../reference/algorithms/mutating/remove.html |  10 +-
 .../algorithms/mutating/remove_copy.html      |  10 +-
 .../algorithms/mutating/remove_copy_if.html   |  10 +-
 .../algorithms/mutating/remove_if.html        |  10 +-
 .../algorithms/mutating/replace.html          |  10 +-
 .../algorithms/mutating/replace_copy.html     |  10 +-
 .../algorithms/mutating/replace_copy_if.html  |  10 +-
 .../algorithms/mutating/replace_if.html       |  10 +-
 .../algorithms/mutating/reverse.html          |  10 +-
 .../algorithms/mutating/reverse_copy.html     |  10 +-
 .../reference/algorithms/mutating/rotate.html |  12 +-
 .../algorithms/mutating/rotate_copy.html      |  12 +-
 .../reference/algorithms/mutating/sort.html   |  10 +-
 .../algorithms/mutating/stable_partition.html |  10 +-
 .../algorithms/mutating/stable_sort.html      |  10 +-
 .../algorithms/mutating/swap_ranges.html      |  10 +-
 .../algorithms/mutating/transform.html        |  12 +-
 .../reference/algorithms/mutating/unique.html |  10 +-
 .../algorithms/mutating/unique_copy.html      |  10 +-
 .../reference/algorithms/new/copy_n.html      |  10 +-
 .../range/reference/algorithms/new/erase.html |  10 +-
 .../reference/algorithms/new/for_each.html    |  10 +-
 .../reference/algorithms/new/insert.html      |  10 +-
 .../range/reference/algorithms/new/iota.html  |  10 +-
 .../reference/algorithms/new/is_sorted.html   |  10 +-
 .../reference/algorithms/new/overwrite.html   |  10 +-
 .../reference/algorithms/new/push_back.html   |  10 +-
 .../reference/algorithms/new/push_front.html  |  10 +-
 .../algorithms/new/remove_erase.html          |  10 +-
 .../algorithms/new/remove_erase_if.html       |  10 +-
 .../non_mutating/adjacent_find.html           |  10 +-
 .../non_mutating/binary_search.html           |  12 +-
 .../algorithms/non_mutating/count.html        |  10 +-
 .../algorithms/non_mutating/count_if.html     |  10 +-
 .../algorithms/non_mutating/equal.html        |  10 +-
 .../algorithms/non_mutating/equal_range.html  |  12 +-
 .../algorithms/non_mutating/find.html         |  10 +-
 .../algorithms/non_mutating/find_end.html     |  10 +-
 .../non_mutating/find_first_of.html           |  10 +-
 .../algorithms/non_mutating/find_if.html      |  12 +-
 .../algorithms/non_mutating/for_each.html     |  10 +-
 .../non_mutating/lexicographical_compare.html |  10 +-
 .../algorithms/non_mutating/lower_bound.html  |  12 +-
 .../algorithms/non_mutating/max_element.html  |  10 +-
 .../algorithms/non_mutating/min_element.html  |  10 +-
 .../algorithms/non_mutating/mismatch.html     |  12 +-
 .../algorithms/non_mutating/search.html       |  10 +-
 .../algorithms/non_mutating/search_n.html     |  10 +-
 .../algorithms/non_mutating/upper_bound.html  |  12 +-
 .../algorithms/numeric/accumulate.html        |  14 +-
 .../numeric/adjacent_difference.html          |  16 +-
 .../algorithms/numeric/inner_product.html     |  16 +-
 .../algorithms/numeric/partial_sum.html       |  16 +-
 .../permutation/next_permutation.html         |  10 +-
 .../permutation/prev_permutation.html         |  10 +-
 .../reference/algorithms/set/includes.html    |  12 +-
 .../algorithms/set/set_difference.html        |  12 +-
 .../algorithms/set/set_intersection.html      |  12 +-
 .../set/set_symmetric_difference.html         |  12 +-
 .../reference/algorithms/set/set_union.html   |  12 +-
 .../concept_implementation/semantics.html     |   2 +-
 .../semantics/functions.html                  |  25 +-
 doc/html/range/reference/ranges.html          |   7 +-
 .../range/reference/ranges/any_range.html     | 177 ++++++
 .../reference/ranges/counting_range.html      |  14 +-
 doc/html/range/reference/ranges/irange.html   |  10 +-
 .../range/reference/ranges/istream_range.html |   6 +-
 .../reference/utilities/iterator_range.html   |   6 +-
 doc/html/range/reference/utilities/join.html  |   4 +-
 .../range/reference/utilities/sub_range.html  |   2 +-
 doc/reference/adaptors.qbk                    |   1 +
 doc/reference/adaptors/strided.qbk            |   2 +-
 doc/reference/adaptors/type_erased.qbk        | 151 +++++
 doc/reference/ranges.qbk                      |   1 +
 doc/reference/ranges/any_range.qbk            | 115 ++++
 doc/reference/semantics.qbk                   |   4 +-
 include/boost/range/adaptor/sliced.hpp        |   1 +
 include/boost/range/adaptor/strided.hpp       | 303 ++++++---
 include/boost/range/adaptor/type_erased.hpp   | 218 +++++--
 include/boost/range/any_range.hpp             | 204 ++++++
 include/boost/range/begin.hpp                 |  23 +-
 include/boost/range/concepts.hpp              |  23 +-
 include/boost/range/detail/any_iterator.hpp   | 587 +++++++++++++++++
 .../range/detail/any_iterator_buffer.hpp      | 117 ++++
 .../range/detail/any_iterator_interface.hpp   | 258 ++++++++
 .../range/detail/any_iterator_wrapper.hpp     | 590 ++++++++++++++++++
 include/boost/range/detail/begin.hpp          |  28 +-
 include/boost/range/detail/end.hpp            |  37 +-
 include/boost/range/detail/safe_bool.hpp      |  72 +++
 include/boost/range/end.hpp                   |  23 +-
 include/boost/range/iterator_range_core.hpp   |  20 +-
 include/boost/range/size.hpp                  |  35 +-
 test/Jamfile.v2                               |   4 +
 test/adaptor_test/strided.cpp                 |  16 +-
 test/adaptor_test/type_erased.cpp             | 481 ++++++++++++++
 test/adaptor_test/type_erased_example.cpp     | 115 ++++
 test/algorithm_test/count_if.cpp              |   7 +-
 test/algorithm_test/find.cpp                  | 127 ++--
 test/algorithm_test/find_end.cpp              | 281 +++++----
 test/algorithm_test/find_first_of.cpp         | 271 ++++----
 test/algorithm_test/find_if.cpp               | 161 +++--
 test/algorithm_test/lower_bound.cpp           | 274 ++++----
 test/algorithm_test/max_element.cpp           | 213 ++++---
 test/algorithm_test/min_element.cpp           | 211 +++----
 test/algorithm_test/partition.cpp             | 165 +++--
 test/algorithm_test/stable_partition.cpp      | 172 +++--
 test/algorithm_test/unique.cpp                | 255 ++++----
 test/algorithm_test/upper_bound.cpp           | 259 ++++----
 test/begin.cpp                                | 119 ++++
 test/end.cpp                                  | 119 ++++
 test/extension_size.cpp                       |  52 +-
 143 files changed, 5587 insertions(+), 2015 deletions(-)
 create mode 100644 doc/html/range/reference/adaptors/reference/type_erased.html
 create mode 100644 doc/html/range/reference/ranges/any_range.html
 create mode 100644 doc/reference/adaptors/type_erased.qbk
 create mode 100644 doc/reference/ranges/any_range.qbk
 create mode 100644 include/boost/range/any_range.hpp
 create mode 100644 include/boost/range/detail/any_iterator.hpp
 create mode 100644 include/boost/range/detail/any_iterator_buffer.hpp
 create mode 100644 include/boost/range/detail/any_iterator_interface.hpp
 create mode 100644 include/boost/range/detail/any_iterator_wrapper.hpp
 mode change 100755 => 100644 include/boost/range/detail/begin.hpp
 mode change 100755 => 100644 include/boost/range/detail/end.hpp
 create mode 100644 include/boost/range/detail/safe_bool.hpp
 create mode 100644 test/adaptor_test/type_erased.cpp
 create mode 100644 test/adaptor_test/type_erased_example.cpp
 create mode 100644 test/begin.cpp
 create mode 100644 test/end.cpp

diff --git a/doc/boost_range.qbk b/doc/boost_range.qbk
index 80bbf06..be09bc6 100644
--- a/doc/boost_range.qbk
+++ b/doc/boost_range.qbk
@@ -78,6 +78,7 @@
 [def __range_adaptors_reversed__          [link range.reference.adaptors.reference.reversed reversed]]
 [def __range_adaptors_sliced__            [link range.reference.adaptors.reference.sliced sliced]]
 [def __range_adaptors_strided__           [link range.reference.adaptors.reference.strided strided]]
+[def __range_adaptors_type_erased__       [link range.reference.adaptors.reference.type_erased type_erased]]
 [def __range_adaptors_tokenized__         [link range.reference.adaptors.reference.tokenized tokenized]]
 [def __range_adaptors_transformed__       [link range.reference.adaptors.reference.transformed transformed]]
 [def __range_adaptors_uniqued__           [link range.reference.adaptors.reference.uniqued uniqued]]
@@ -174,6 +175,7 @@
 
 [def __sgi_inner_product__      [@http://www.sgi.com/tech/stl/inner_product.html inner_product]]
 [def __sgi_partial_sum__        [@http://www.sgi.com/tech/stl/partial_sum.html partial_sum]]
+[def __type_erasure_article__   [@http://www.artima.com/cppsource/type_erasure.html type erasure article]]
 
 Boost.Range is a collection of concepts and utilities, range-based algorithms,
 as well as range adaptors that allow for efficient and expressive code.
diff --git a/doc/html/index.html b/doc/html/index.html
index 8b74c06..1be23d5 100644
--- a/doc/html/index.html
+++ b/doc/html/index.html
@@ -30,7 +30,7 @@
 </h3></div></div>
 <div><p class="copyright">Copyright &#169; 2003 -2010 Thorsten Ottosen, Neil Groves</p></div>
 <div><div class="legalnotice">
-<a name="id618509"></a><p>
+<a name="id607962"></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>
@@ -82,6 +82,7 @@
 </dl></dd>
 <dt><span class="section"><a href="range/reference/ranges.html">Provided Ranges</a></span></dt>
 <dd><dl>
+<dt><span class="section"><a href="range/reference/ranges/any_range.html">any_range</a></span></dt>
 <dt><span class="section"><a href="range/reference/ranges/counting_range.html">counting_range</a></span></dt>
 <dt><span class="section"><a href="range/reference/ranges/istream_range.html">istream_range</a></span></dt>
 <dt><span class="section"><a href="range/reference/ranges/irange.html">irange</a></span></dt>
@@ -143,7 +144,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 23, 2010 at 17:58:25 GMT</small></p></td>
+<td align="left"><p><small>Last revised: January 01, 2011 at 16:31:27 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 b12e40e..1b32f72 100644
--- a/doc/html/quickbook_HTML.manifest
+++ b/doc/html/quickbook_HTML.manifest
@@ -30,6 +30,7 @@ range/reference/adaptors/reference/replaced_if.html
 range/reference/adaptors/reference/reversed.html
 range/reference/adaptors/reference/sliced.html
 range/reference/adaptors/reference/strided.html
+range/reference/adaptors/reference/type_erased.html
 range/reference/adaptors/reference/tokenized.html
 range/reference/adaptors/reference/transformed.html
 range/reference/adaptors/reference/uniqued.html
@@ -118,6 +119,7 @@ range/reference/algorithms/numeric/adjacent_difference.html
 range/reference/algorithms/numeric/inner_product.html
 range/reference/algorithms/numeric/partial_sum.html
 range/reference/ranges.html
+range/reference/ranges/any_range.html
 range/reference/ranges/counting_range.html
 range/reference/ranges/istream_range.html
 range/reference/ranges/irange.html
diff --git a/doc/html/range/concepts/bidirectional_range.html b/doc/html/range/concepts/bidirectional_range.html
index ba06db0..6e3dc8c 100644
--- a/doc/html/range/concepts/bidirectional_range.html
+++ b/doc/html/range/concepts/bidirectional_range.html
@@ -27,7 +27,7 @@
 <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="id660804"></a>
+<a name="id650256"></a>
         <a class="link" href="bidirectional_range.html#range.concepts.bidirectional_range.notation">Notation</a>
       </h5>
 <div class="informaltable"><table class="table">
@@ -65,7 +65,7 @@
 </tbody>
 </table></div>
 <a name="range.concepts.bidirectional_range.description"></a><h5>
-<a name="id660892"></a>
+<a name="id650345"></a>
         <a class="link" href="bidirectional_range.html#range.concepts.bidirectional_range.description">Description</a>
       </h5>
 <p>
@@ -75,7 +75,7 @@
         Traversal Iterator</a>.
       </p>
 <a name="range.concepts.bidirectional_range.refinement_of"></a><h5>
-<a name="id660950"></a>
+<a name="id650403"></a>
         <a class="link" href="bidirectional_range.html#range.concepts.bidirectional_range.refinement_of">Refinement
         of</a>
       </h5>
@@ -83,7 +83,7 @@
         <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="id660973"></a>
+<a name="id650426"></a>
         <a class="link" href="bidirectional_range.html#range.concepts.bidirectional_range.associated_types">Associated
         types</a>
       </h5>
@@ -136,7 +136,7 @@
 </tbody>
 </table></div>
 <a name="range.concepts.bidirectional_range.valid_expressions"></a><h5>
-<a name="id661129"></a>
+<a name="id650581"></a>
         <a class="link" href="bidirectional_range.html#range.concepts.bidirectional_range.valid_expressions">Valid
         expressions</a>
       </h5>
@@ -221,7 +221,7 @@
 </tbody>
 </table></div>
 <a name="range.concepts.bidirectional_range.complexity_guarantees"></a><h5>
-<a name="id661589"></a>
+<a name="id651042"></a>
         <a class="link" href="bidirectional_range.html#range.concepts.bidirectional_range.complexity_guarantees">Complexity
         guarantees</a>
       </h5>
@@ -232,7 +232,7 @@
         <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="id661729"></a>
+<a name="id651182"></a>
         <a class="link" href="bidirectional_range.html#range.concepts.bidirectional_range.invariants">Invariants</a>
       </h5>
 <div class="informaltable"><table class="table">
@@ -272,7 +272,7 @@
 </tbody>
 </table></div>
 <a name="range.concepts.bidirectional_range.see_also"></a><h5>
-<a name="id661978"></a>
+<a name="id651431"></a>
         <a class="link" href="bidirectional_range.html#range.concepts.bidirectional_range.see_also">See also</a>
       </h5>
 <p>
diff --git a/doc/html/range/concepts/concept_checking.html b/doc/html/range/concepts/concept_checking.html
index db21dbb..20a2fbb 100644
--- a/doc/html/range/concepts/concept_checking.html
+++ b/doc/html/range/concepts/concept_checking.html
@@ -79,7 +79,7 @@
           </li>
 </ul></div>
 <a name="range.concepts.concept_checking.see_also"></a><h5>
-<a name="id662924"></a>
+<a name="id652377"></a>
         <a class="link" href="concept_checking.html#range.concepts.concept_checking.see_also">See also</a>
       </h5>
 <p>
diff --git a/doc/html/range/concepts/forward_range.html b/doc/html/range/concepts/forward_range.html
index 95b7dac..7937f8c 100644
--- a/doc/html/range/concepts/forward_range.html
+++ b/doc/html/range/concepts/forward_range.html
@@ -27,7 +27,7 @@
 <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="id660433"></a>
+<a name="id649886"></a>
         <a class="link" href="forward_range.html#range.concepts.forward_range.notation">Notation</a>
       </h5>
 <div class="informaltable"><table class="table">
@@ -65,7 +65,7 @@
 </tbody>
 </table></div>
 <a name="range.concepts.forward_range.description"></a><h5>
-<a name="id660521"></a>
+<a name="id649974"></a>
         <a class="link" href="forward_range.html#range.concepts.forward_range.description">Description</a>
       </h5>
 <p>
@@ -73,14 +73,14 @@
         Traversal Iterator</a>.
       </p>
 <a name="range.concepts.forward_range.refinement_of"></a><h5>
-<a name="id660586"></a>
+<a name="id650039"></a>
         <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="id660609"></a>
+<a name="id650062"></a>
         <a class="link" href="forward_range.html#range.concepts.forward_range.associated_types">Associated
         types</a>
       </h5>
@@ -132,7 +132,7 @@
 </tbody>
 </table></div>
 <a name="range.concepts.forward_range.see_also"></a><h5>
-<a name="id660758"></a>
+<a name="id650211"></a>
         <a class="link" href="forward_range.html#range.concepts.forward_range.see_also">See also</a>
       </h5>
 <p>
diff --git a/doc/html/range/concepts/random_access_range.html b/doc/html/range/concepts/random_access_range.html
index fa49539..3124ddc 100644
--- a/doc/html/range/concepts/random_access_range.html
+++ b/doc/html/range/concepts/random_access_range.html
@@ -27,7 +27,7 @@
 <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="id662025"></a>
+<a name="id651477"></a>
         <a class="link" href="random_access_range.html#range.concepts.random_access_range.description">Description</a>
       </h5>
 <p>
@@ -35,7 +35,7 @@
         Access Traversal Iterator</a>.
       </p>
 <a name="range.concepts.random_access_range.refinement_of"></a><h5>
-<a name="id662090"></a>
+<a name="id651543"></a>
         <a class="link" href="random_access_range.html#range.concepts.random_access_range.refinement_of">Refinement
         of</a>
       </h5>
@@ -43,7 +43,7 @@
         <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="id662113"></a>
+<a name="id651566"></a>
         <a class="link" href="random_access_range.html#range.concepts.random_access_range.valid_expressions">Valid
         expressions</a>
       </h5>
@@ -89,7 +89,7 @@
 </tr></tbody>
 </table></div>
 <a name="range.concepts.random_access_range.expression_semantics"></a><h5>
-<a name="id662251"></a>
+<a name="id651704"></a>
         <a class="link" href="random_access_range.html#range.concepts.random_access_range.expression_semantics">Expression
         semantics</a>
       </h5>
@@ -139,7 +139,7 @@
 </tr></tbody>
 </table></div>
 <a name="range.concepts.random_access_range.complexity_guarantees"></a><h5>
-<a name="id662466"></a>
+<a name="id651919"></a>
         <a class="link" href="random_access_range.html#range.concepts.random_access_range.complexity_guarantees">Complexity
         guarantees</a>
       </h5>
@@ -147,7 +147,7 @@
         <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="id662514"></a>
+<a name="id651967"></a>
         <a class="link" href="random_access_range.html#range.concepts.random_access_range.invariants">Invariants</a>
       </h5>
 <div class="informaltable"><table class="table">
diff --git a/doc/html/range/concepts/single_pass_range.html b/doc/html/range/concepts/single_pass_range.html
index a9acb72..273692a 100644
--- a/doc/html/range/concepts/single_pass_range.html
+++ b/doc/html/range/concepts/single_pass_range.html
@@ -27,7 +27,7 @@
 <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="id659140"></a>
+<a name="id648593"></a>
         <a class="link" href="single_pass_range.html#range.concepts.single_pass_range.notation">Notation</a>
       </h5>
 <div class="informaltable"><table class="table">
@@ -65,7 +65,7 @@
 </tbody>
 </table></div>
 <a name="range.concepts.single_pass_range.description"></a><h5>
-<a name="id659233"></a>
+<a name="id648686"></a>
         <a class="link" href="single_pass_range.html#range.concepts.single_pass_range.description">Description</a>
       </h5>
 <p>
@@ -73,7 +73,7 @@
         Pass Iterator</a>.
       </p>
 <a name="range.concepts.single_pass_range.associated_types"></a><h5>
-<a name="id659298"></a>
+<a name="id648751"></a>
         <a class="link" href="single_pass_range.html#range.concepts.single_pass_range.associated_types">Associated
         types</a>
       </h5>
@@ -126,7 +126,7 @@
 </tbody>
 </table></div>
 <a name="range.concepts.single_pass_range.valid_expressions"></a><h5>
-<a name="id659461"></a>
+<a name="id648914"></a>
         <a class="link" href="single_pass_range.html#range.concepts.single_pass_range.valid_expressions">Valid
         expressions</a>
       </h5>
@@ -198,7 +198,7 @@
 </tbody>
 </table></div>
 <a name="range.concepts.single_pass_range.expression_semantics"></a><h5>
-<a name="id659780"></a>
+<a name="id649233"></a>
         <a class="link" href="single_pass_range.html#range.concepts.single_pass_range.expression_semantics">Expression
         semantics</a>
       </h5>
@@ -266,7 +266,7 @@
 </tbody>
 </table></div>
 <a name="range.concepts.single_pass_range.complexity_guarantees"></a><h5>
-<a name="id660037"></a>
+<a name="id649490"></a>
         <a class="link" href="single_pass_range.html#range.concepts.single_pass_range.complexity_guarantees">Complexity
         guarantees</a>
       </h5>
@@ -276,7 +276,7 @@
         constant time.
       </p>
 <a name="range.concepts.single_pass_range.invariants"></a><h5>
-<a name="id660114"></a>
+<a name="id649567"></a>
         <a class="link" href="single_pass_range.html#range.concepts.single_pass_range.invariants">Invariants</a>
       </h5>
 <div class="informaltable"><table class="table">
@@ -316,7 +316,7 @@
 </tbody>
 </table></div>
 <a name="range.concepts.single_pass_range.see_also"></a><h5>
-<a name="id660370"></a>
+<a name="id649823"></a>
         <a class="link" href="single_pass_range.html#range.concepts.single_pass_range.see_also">See also</a>
       </h5>
 <p>
diff --git a/doc/html/range/history_ack.html b/doc/html/range/history_ack.html
index 8c99a63..49355b5 100644
--- a/doc/html/range/history_ack.html
+++ b/doc/html/range/history_ack.html
@@ -26,7 +26,7 @@
 <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="id793098"></a>
+<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>
@@ -79,7 +79,7 @@
       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="id793199"></a>
+<a name="id786859"></a>
       <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>
diff --git a/doc/html/range/introduction.html b/doc/html/range/introduction.html
index 07af796..a68d315 100644
--- a/doc/html/range/introduction.html
+++ b/doc/html/range/introduction.html
@@ -70,7 +70,7 @@
         </li>
 </ul></div>
 <a name="range.introduction.example___iterate_over_the_values_in_a_map"></a><h4>
-<a name="id617787"></a>
+<a name="id607240"></a>
       <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>
@@ -84,7 +84,7 @@
 <p>
     </p>
 <a name="range.introduction.example___iterate_over_the_keys_in_a_map"></a><h4>
-<a name="id617908"></a>
+<a name="id607360"></a>
       <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>
@@ -98,7 +98,7 @@
 <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="id658861"></a>
+<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
       - Push the even values from a map in reverse order into the container <code class="computeroutput"><span class="identifier">target</span></code></a>
     </h4>
diff --git a/doc/html/range/mfc_atl.html b/doc/html/range/mfc_atl.html
index 91938cc..2ca51fd 100644
--- a/doc/html/range/mfc_atl.html
+++ b/doc/html/range/mfc_atl.html
@@ -34,7 +34,7 @@
 <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="id786627"></a>
+<a name="id780286"></a>
       <a class="link" href="mfc_atl.html#range.mfc_atl.introduction">Introduction</a>
     </h5>
 <p>
@@ -100,7 +100,7 @@
 </tbody>
 </table></div>
 <a name="range.mfc_atl.overview"></a><h5>
-<a name="id786761"></a>
+<a name="id780420"></a>
       <a class="link" href="mfc_atl.html#range.mfc_atl.overview">Overview</a>
     </h5>
 <p>
diff --git a/doc/html/range/reference.html b/doc/html/range/reference.html
index f8246fb..50f6ed0 100644
--- a/doc/html/range/reference.html
+++ b/doc/html/range/reference.html
@@ -58,6 +58,7 @@
 </dl></dd>
 <dt><span class="section"><a href="reference/ranges.html">Provided Ranges</a></span></dt>
 <dd><dl>
+<dt><span class="section"><a href="reference/ranges/any_range.html">any_range</a></span></dt>
 <dt><span class="section"><a href="reference/ranges/counting_range.html">counting_range</a></span></dt>
 <dt><span class="section"><a href="reference/ranges/istream_range.html">istream_range</a></span></dt>
 <dt><span class="section"><a href="reference/ranges/irange.html">irange</a></span></dt>
diff --git a/doc/html/range/reference/adaptors/introduction.html b/doc/html/range/reference/adaptors/introduction.html
index d3e606b..4991499 100644
--- a/doc/html/range/reference/adaptors/introduction.html
+++ b/doc/html/range/reference/adaptors/introduction.html
@@ -122,7 +122,7 @@
           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="id670426"></a>
+<a name="id659630"></a>
           <a class="link" href="introduction.html#range.reference.adaptors.introduction.composition_of_adaptors">Composition
           of Adaptors</a>
         </h6>
@@ -169,7 +169,7 @@
           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="id670736"></a>
+<a name="id659939"></a>
           <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>
@@ -186,7 +186,7 @@
 <p>
         </p>
 <a name="range.reference.adaptors.introduction.range_adaptor_alternative_to_count_if_algorithm"></a><h6>
-<a name="id670900"></a>
+<a name="id660104"></a>
           <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>
diff --git a/doc/html/range/reference/adaptors/reference.html b/doc/html/range/reference/adaptors/reference.html
index dffb6fe..4e5b99a 100644
--- a/doc/html/range/reference/adaptors/reference.html
+++ b/doc/html/range/reference/adaptors/reference.html
@@ -39,6 +39,7 @@
 <dt><span class="section"><a href="reference/reversed.html">reversed</a></span></dt>
 <dt><span class="section"><a href="reference/sliced.html">sliced</a></span></dt>
 <dt><span class="section"><a href="reference/strided.html">strided</a></span></dt>
+<dt><span class="section"><a href="reference/type_erased.html">type_erased</a></span></dt>
 <dt><span class="section"><a href="reference/tokenized.html">tokenized</a></span></dt>
 <dt><span class="section"><a href="reference/transformed.html">transformed</a></span></dt>
 <dt><span class="section"><a href="reference/uniqued.html">uniqued</a></span></dt>
diff --git a/doc/html/range/reference/adaptors/reference/strided.html b/doc/html/range/reference/adaptors/reference/strided.html
index e79f8cf..592b83e 100644
--- a/doc/html/range/reference/adaptors/reference/strided.html
+++ b/doc/html/range/reference/adaptors/reference/strided.html
@@ -7,7 +7,7 @@
 <link rel="home" href="../../../../index.html" title="Chapter&#160;1.&#160;Range 2.0">
 <link rel="up" href="../reference.html" title="Reference">
 <link rel="prev" href="sliced.html" title="sliced">
-<link rel="next" href="tokenized.html" title="tokenized">
+<link rel="next" href="type_erased.html" title="type_erased">
 </head>
 <body bgcolor="white" text="black" link="#0000FF" vlink="#840084" alink="#0000FF">
 <table cellpadding="2" width="100%"><tr>
@@ -20,7 +20,7 @@
 </tr></table>
 <hr>
 <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="tokenized.html"><img src="../../../../../../../../doc/src/images/next.png" alt="Next"></a>
+<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="titlepage"><div><div><h5 class="title">
@@ -77,9 +77,7 @@
 <div class="itemizedlist"><ul class="itemizedlist" type="disc">
 <li class="listitem">
                 <span class="bold"><strong>Precondition:</strong></span> <code class="computeroutput"><span class="number">0</span>
-                <span class="special">&lt;=</span> <span class="identifier">n</span></code>
-                and <code class="computeroutput"><span class="identifier">boost</span><span class="special">::</span><span class="identifier">size</span><span class="special">(</span><span class="identifier">rng</span><span class="special">)</span></code>
-                is a valid expression.
+                <span class="special">&lt;=</span> <span class="identifier">n</span></code>.
               </li>
 <li class="listitem">
                 <span class="bold"><strong>Returns:</strong></span> A new range based on <code class="computeroutput"><span class="identifier">rng</span></code> where traversal is performed
@@ -145,7 +143,7 @@
 </tr></table>
 <hr>
 <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="tokenized.html"><img src="../../../../../../../../doc/src/images/next.png" alt="Next"></a>
+<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>
 </body>
 </html>
diff --git a/doc/html/range/reference/adaptors/reference/tokenized.html b/doc/html/range/reference/adaptors/reference/tokenized.html
index 242fbc2..2dfa506 100644
--- a/doc/html/range/reference/adaptors/reference/tokenized.html
+++ b/doc/html/range/reference/adaptors/reference/tokenized.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="../reference.html" title="Reference">
-<link rel="prev" href="strided.html" title="strided">
+<link rel="prev" href="type_erased.html" title="type_erased">
 <link rel="next" href="transformed.html" title="transformed">
 </head>
 <body bgcolor="white" text="black" link="#0000FF" vlink="#840084" alink="#0000FF">
@@ -20,7 +20,7 @@
 </tr></table>
 <hr>
 <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="transformed.html"><img src="../../../../../../../../doc/src/images/next.png" alt="Next"></a>
+<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="titlepage"><div><div><h5 class="title">
@@ -149,7 +149,7 @@
 </tr></table>
 <hr>
 <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="transformed.html"><img src="../../../../../../../../doc/src/images/next.png" alt="Next"></a>
+<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>
 </body>
 </html>
diff --git a/doc/html/range/reference/adaptors/reference/type_erased.html b/doc/html/range/reference/adaptors/reference/type_erased.html
new file mode 100644
index 0000000..87649ee
--- /dev/null
+++ b/doc/html/range/reference/adaptors/reference/type_erased.html
@@ -0,0 +1,305 @@
+<html>
+<head>
+<meta http-equiv="Content-Type" content="text/html; charset=US-ASCII">
+<title>type_erased</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="../reference.html" title="Reference">
+<link rel="prev" href="strided.html" title="strided">
+<link rel="next" href="tokenized.html" title="tokenized">
+</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="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="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>
+<div class="toc"><dl><dt><span class="section"><a href="type_erased.html#range.reference.adaptors.reference.type_erased.type_erased_example">type-erased
+            example</a></span></dt></dl></div>
+<div class="informaltable"><table class="table">
+<colgroup>
+<col>
+<col>
+</colgroup>
+<thead><tr>
+<th>
+                    <p>
+                      Syntax
+                    </p>
+                  </th>
+<th>
+                    <p>
+                      Code
+                    </p>
+                  </th>
+</tr></thead>
+<tbody>
+<tr>
+<td>
+                    <p>
+                      Pipe
+                    </p>
+                  </td>
+<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">type_erased</span><span class="special">&lt;</span><span class="identifier">Value</span><span class="special">,</span>
+                      <span class="identifier">Traversal</span><span class="special">,</span>
+                      <span class="identifier">Reference</span><span class="special">,</span>
+                      <span class="identifier">Difference</span><span class="special">,</span>
+                      <span class="identifier">Buffer</span><span class="special">&gt;()</span></code>
+                    </p>
+                  </td>
+</tr>
+<tr>
+<td>
+                    <p>
+                      Function
+                    </p>
+                  </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">type_erase</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">type_erased</span><span class="special">&lt;</span><span class="identifier">Value</span><span class="special">,</span>
+                      <span class="identifier">Traversal</span><span class="special">,</span>
+                      <span class="identifier">Reference</span><span class="special">,</span>
+                      <span class="identifier">Difference</span><span class="special">,</span>
+                      <span class="identifier">Buffer</span><span class="special">&gt;)</span></code>
+                    </p>
+                  </td>
+</tr>
+</tbody>
+</table></div>
+<p>
+            Please note that it is frequently unnecessary to use the <code class="computeroutput"><span class="identifier">type_erased</span></code> adaptor. It is often better
+            to use the implicit conversion to <code class="computeroutput"><span class="identifier">any_range</span></code>.
+          </p>
+<p>
+            Let <code class="computeroutput"><span class="identifier">Rng</span></code> be the type of
+            <code class="computeroutput"><span class="identifier">rng</span></code>.
+          </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">
+<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>
+<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>
+<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>
+<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>
+<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>
+</ul></div>
+</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>
+                <span class="special">}</span></code>
+              </li>
+<li class="listitem">
+                <span class="bold"><strong>Returns:</strong></span> The returned value is the
+                same as <code class="computeroutput"><span class="keyword">typename</span> <span class="identifier">any_range_type_generator</span><span class="special">&lt;</span> <span class="identifier">Rng</span><span class="special">,</span> <span class="identifier">Value</span><span class="special">,</span> <span class="identifier">Traversal</span><span class="special">,</span> <span class="identifier">Reference</span><span class="special">,</span> <span class="identifier">Difference</span><span class="special">,</span> <span class="identifier">Buffer</span>
+                <span class="special">&gt;</span></code> that represents <code class="computeroutput"><span class="identifier">rng</span></code> in a type-erased manner.
+              </li>
+<li class="listitem">
+                <span class="bold"><strong>Range Category:</strong></span> <a class="link" href="../../../concepts/single_pass_range.html" title="Single Pass Range">Single
+                Pass Range</a>
+              </li>
+<li class="listitem">
+                <span class="bold"><strong>Returned Range Category:</strong></span> if <code class="computeroutput"><span class="identifier">Traversal</span></code> was specified as <code class="computeroutput"><span class="identifier">boost</span><span class="special">::</span><span class="identifier">use_default</span></code> then <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>,
+                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>
+<p>
+            
+</p>
+<pre class="programlisting"><span class="keyword">class</span> <span class="identifier">AnyIteratorBufferConcept</span>
+<span class="special">{</span>
+<span class="keyword">public</span><span class="special">:</span>
+    <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">// 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="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>
+<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">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>
+
+<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>
+  <span class="special">,</span> <span class="identifier">std</span><span class="special">::</span><span class="identifier">ptrdiff_t</span>
+<span class="special">&gt;</span> <span class="identifier">integer_range</span><span class="special">;</span>
+
+<span class="keyword">namespace</span> <span class="identifier">server</span>
+<span class="special">{</span>
+    <span class="keyword">void</span> <span class="identifier">display_integers</span><span class="special">(</span><span class="keyword">const</span> <span class="identifier">integer_range</span><span class="special">&amp;</span> <span class="identifier">rng</span><span class="special">)</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">rng</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="identifier">std</span><span class="special">::</span><span class="identifier">cout</span> <span class="special">&lt;&lt;</span> <span class="identifier">std</span><span class="special">::</span><span class="identifier">endl</span><span class="special">;</span>
+    <span class="special">}</span>
+<span class="special">}</span>
+
+<span class="keyword">namespace</span> <span class="identifier">client</span>
+<span class="special">{</span>
+    <span class="keyword">void</span> <span class="identifier">run</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>
+
+        <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="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="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">// 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="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>
+
+<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="identifier">client</span><span class="special">::</span><span class="identifier">run</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="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>
+<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>
+        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="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>
+</body>
+</html>
diff --git a/doc/html/range/reference/algorithms/heap/make_heap.html b/doc/html/range/reference/algorithms/heap/make_heap.html
index a7a201c..3d4b6ec 100644
--- a/doc/html/range/reference/algorithms/heap/make_heap.html
+++ b/doc/html/range/reference/algorithms/heap/make_heap.html
@@ -27,7 +27,7 @@
 <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="id749200"></a>
+<a name="id741272"></a>
             <a class="link" href="make_heap.html#range.reference.algorithms.heap.make_heap.prototype">Prototype</a>
           </h6>
 <p>
@@ -48,7 +48,7 @@
 <p>
           </p>
 <a name="range.reference.algorithms.heap.make_heap.description"></a><h6>
-<a name="id749575"></a>
+<a name="id741648"></a>
             <a class="link" href="make_heap.html#range.reference.algorithms.heap.make_heap.description">Description</a>
           </h6>
 <p>
@@ -60,14 +60,14 @@
             the predicate versions.
           </p>
 <a name="range.reference.algorithms.heap.make_heap.definition"></a><h6>
-<a name="id749649"></a>
+<a name="id741722"></a>
             <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="id749718"></a>
+<a name="id741791"></a>
             <a class="link" href="make_heap.html#range.reference.algorithms.heap.make_heap.requirements">Requirements</a>
           </h6>
 <p>
@@ -118,7 +118,7 @@
               </li>
 </ul></div>
 <a name="range.reference.algorithms.heap.make_heap.complexity"></a><h6>
-<a name="id749966"></a>
+<a name="id742039"></a>
             <a class="link" href="make_heap.html#range.reference.algorithms.heap.make_heap.complexity">Complexity</a>
           </h6>
 <p>
diff --git a/doc/html/range/reference/algorithms/heap/pop_heap.html b/doc/html/range/reference/algorithms/heap/pop_heap.html
index 4926fa5..d8f0283 100644
--- a/doc/html/range/reference/algorithms/heap/pop_heap.html
+++ b/doc/html/range/reference/algorithms/heap/pop_heap.html
@@ -27,7 +27,7 @@
 <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="id748194"></a>
+<a name="id740266"></a>
             <a class="link" href="pop_heap.html#range.reference.algorithms.heap.pop_heap.prototype">Prototype</a>
           </h6>
 <p>
@@ -48,7 +48,7 @@
 <p>
           </p>
 <a name="range.reference.algorithms.heap.pop_heap.description"></a><h6>
-<a name="id748570"></a>
+<a name="id740642"></a>
             <a class="link" href="pop_heap.html#range.reference.algorithms.heap.pop_heap.description">Description</a>
           </h6>
 <p>
@@ -62,14 +62,14 @@
             the predicate versions.
           </p>
 <a name="range.reference.algorithms.heap.pop_heap.definition"></a><h6>
-<a name="id748724"></a>
+<a name="id740796"></a>
             <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="id748794"></a>
+<a name="id740866"></a>
             <a class="link" href="pop_heap.html#range.reference.algorithms.heap.pop_heap.requirements">Requirements</a>
           </h6>
 <p>
@@ -120,7 +120,7 @@
               </li>
 </ul></div>
 <a name="range.reference.algorithms.heap.pop_heap.precondition_"></a><h6>
-<a name="id749041"></a>
+<a name="id741114"></a>
             <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">
@@ -132,7 +132,7 @@
               </li>
 </ul></div>
 <a name="range.reference.algorithms.heap.pop_heap.complexity"></a><h6>
-<a name="id749116"></a>
+<a name="id741189"></a>
             <a class="link" href="pop_heap.html#range.reference.algorithms.heap.pop_heap.complexity">Complexity</a>
           </h6>
 <p>
diff --git a/doc/html/range/reference/algorithms/heap/push_heap.html b/doc/html/range/reference/algorithms/heap/push_heap.html
index 976aece..4223024 100644
--- a/doc/html/range/reference/algorithms/heap/push_heap.html
+++ b/doc/html/range/reference/algorithms/heap/push_heap.html
@@ -27,7 +27,7 @@
 <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="id747150"></a>
+<a name="id739222"></a>
             <a class="link" href="push_heap.html#range.reference.algorithms.heap.push_heap.prototype">Prototype</a>
           </h6>
 <p>
@@ -48,7 +48,7 @@
 <p>
           </p>
 <a name="range.reference.algorithms.heap.push_heap.description"></a><h6>
-<a name="id747526"></a>
+<a name="id739596"></a>
             <a class="link" href="push_heap.html#range.reference.algorithms.heap.push_heap.description">Description</a>
           </h6>
 <p>
@@ -62,14 +62,14 @@
             the predicate versions.
           </p>
 <a name="range.reference.algorithms.heap.push_heap.definition"></a><h6>
-<a name="id747683"></a>
+<a name="id739755"></a>
             <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="id747753"></a>
+<a name="id739825"></a>
             <a class="link" href="push_heap.html#range.reference.algorithms.heap.push_heap.requirements">Requirements</a>
           </h6>
 <p>
@@ -120,7 +120,7 @@
               </li>
 </ul></div>
 <a name="range.reference.algorithms.heap.push_heap.precondition_"></a><h6>
-<a name="id748001"></a>
+<a name="id740073"></a>
             <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">
@@ -132,7 +132,7 @@
               </li>
 </ul></div>
 <a name="range.reference.algorithms.heap.push_heap.complexity"></a><h6>
-<a name="id748121"></a>
+<a name="id740193"></a>
             <a class="link" href="push_heap.html#range.reference.algorithms.heap.push_heap.complexity">Complexity</a>
           </h6>
 <p>
diff --git a/doc/html/range/reference/algorithms/heap/sort_heap.html b/doc/html/range/reference/algorithms/heap/sort_heap.html
index 4366d76..7667438 100644
--- a/doc/html/range/reference/algorithms/heap/sort_heap.html
+++ b/doc/html/range/reference/algorithms/heap/sort_heap.html
@@ -27,7 +27,7 @@
 <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="id750042"></a>
+<a name="id742115"></a>
             <a class="link" href="sort_heap.html#range.reference.algorithms.heap.sort_heap.prototype">Prototype</a>
           </h6>
 <p>
@@ -48,7 +48,7 @@
 <p>
           </p>
 <a name="range.reference.algorithms.heap.sort_heap.description"></a><h6>
-<a name="id750417"></a>
+<a name="id742491"></a>
             <a class="link" href="sort_heap.html#range.reference.algorithms.heap.sort_heap.description">Description</a>
           </h6>
 <p>
@@ -61,14 +61,14 @@
             the predicate versions.
           </p>
 <a name="range.reference.algorithms.heap.sort_heap.definition"></a><h6>
-<a name="id750482"></a>
+<a name="id742555"></a>
             <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="id750553"></a>
+<a name="id742626"></a>
             <a class="link" href="sort_heap.html#range.reference.algorithms.heap.sort_heap.requirements">Requirements</a>
           </h6>
 <p>
@@ -119,14 +119,14 @@
               </li>
 </ul></div>
 <a name="range.reference.algorithms.heap.sort_heap.precondition_"></a><h6>
-<a name="id750800"></a>
+<a name="id742873"></a>
             <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="id750833"></a>
+<a name="id742906"></a>
             <a class="link" href="sort_heap.html#range.reference.algorithms.heap.sort_heap.complexity">Complexity</a>
           </h6>
 <p>
diff --git a/doc/html/range/reference/algorithms/mutating/copy.html b/doc/html/range/reference/algorithms/mutating/copy.html
index bfa49dc..fd096ff 100644
--- a/doc/html/range/reference/algorithms/mutating/copy.html
+++ b/doc/html/range/reference/algorithms/mutating/copy.html
@@ -27,7 +27,7 @@
 <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="id692133"></a>
+<a name="id684203"></a>
             <a class="link" href="copy.html#range.reference.algorithms.mutating.copy.prototype">Prototype</a>
           </h6>
 <p>
@@ -39,7 +39,7 @@
 <p>
           </p>
 <a name="range.reference.algorithms.mutating.copy.description"></a><h6>
-<a name="id692261"></a>
+<a name="id684330"></a>
             <a class="link" href="copy.html#range.reference.algorithms.mutating.copy.description">Description</a>
           </h6>
 <p>
@@ -50,14 +50,14 @@
             <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="id692389"></a>
+<a name="id684459"></a>
             <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="id692458"></a>
+<a name="id684528"></a>
             <a class="link" href="copy.html#range.reference.algorithms.mutating.copy.requirements">Requirements</a>
           </h6>
 <div class="itemizedlist"><ul class="itemizedlist" type="disc">
@@ -78,7 +78,7 @@
               </li>
 </ul></div>
 <a name="range.reference.algorithms.mutating.copy.precondition_"></a><h6>
-<a name="id692568"></a>
+<a name="id684638"></a>
             <a class="link" href="copy.html#range.reference.algorithms.mutating.copy.precondition_">Precondition:</a>
           </h6>
 <div class="itemizedlist"><ul class="itemizedlist" type="disc">
@@ -92,7 +92,7 @@
               </li>
 </ul></div>
 <a name="range.reference.algorithms.mutating.copy.complexity"></a><h6>
-<a name="id692674"></a>
+<a name="id684744"></a>
             <a class="link" href="copy.html#range.reference.algorithms.mutating.copy.complexity">Complexity</a>
           </h6>
 <p>
diff --git a/doc/html/range/reference/algorithms/mutating/copy_backward.html b/doc/html/range/reference/algorithms/mutating/copy_backward.html
index 2c79bf9..29139c1 100644
--- a/doc/html/range/reference/algorithms/mutating/copy_backward.html
+++ b/doc/html/range/reference/algorithms/mutating/copy_backward.html
@@ -27,7 +27,7 @@
 <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="id692738"></a>
+<a name="id684808"></a>
             <a class="link" href="copy_backward.html#range.reference.algorithms.mutating.copy_backward.prototype">Prototype</a>
           </h6>
 <p>
@@ -41,7 +41,7 @@
 <p>
           </p>
 <a name="range.reference.algorithms.mutating.copy_backward.description"></a><h6>
-<a name="id692866"></a>
+<a name="id684936"></a>
             <a class="link" href="copy_backward.html#range.reference.algorithms.mutating.copy_backward.description">Description</a>
           </h6>
 <p>
@@ -59,14 +59,14 @@
             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="id693020"></a>
+<a name="id685090"></a>
             <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="id693090"></a>
+<a name="id685160"></a>
             <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">
@@ -87,7 +87,7 @@
               </li>
 </ul></div>
 <a name="range.reference.algorithms.mutating.copy_backward.precondition_"></a><h6>
-<a name="id693200"></a>
+<a name="id685270"></a>
             <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">
@@ -101,7 +101,7 @@
               </li>
 </ul></div>
 <a name="range.reference.algorithms.mutating.copy_backward.complexity"></a><h6>
-<a name="id693308"></a>
+<a name="id685378"></a>
             <a class="link" href="copy_backward.html#range.reference.algorithms.mutating.copy_backward.complexity">Complexity</a>
           </h6>
 <p>
diff --git a/doc/html/range/reference/algorithms/mutating/fill.html b/doc/html/range/reference/algorithms/mutating/fill.html
index 77c78c6..ea3fec4 100644
--- a/doc/html/range/reference/algorithms/mutating/fill.html
+++ b/doc/html/range/reference/algorithms/mutating/fill.html
@@ -27,7 +27,7 @@
 <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="id693373"></a>
+<a name="id685443"></a>
             <a class="link" href="fill.html#range.reference.algorithms.mutating.fill.prototype">Prototype</a>
           </h6>
 <p>
@@ -39,7 +39,7 @@
 <p>
           </p>
 <a name="range.reference.algorithms.mutating.fill.description"></a><h6>
-<a name="id693511"></a>
+<a name="id685579"></a>
             <a class="link" href="fill.html#range.reference.algorithms.mutating.fill.description">Description</a>
           </h6>
 <p>
@@ -48,14 +48,14 @@
             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="id693564"></a>
+<a name="id685634"></a>
             <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="id693634"></a>
+<a name="id685703"></a>
             <a class="link" href="fill.html#range.reference.algorithms.mutating.fill.requirements">Requirements</a>
           </h6>
 <div class="itemizedlist"><ul class="itemizedlist" type="disc">
@@ -78,7 +78,7 @@
               </li>
 </ul></div>
 <a name="range.reference.algorithms.mutating.fill.complexity"></a><h6>
-<a name="id693754"></a>
+<a name="id685823"></a>
             <a class="link" href="fill.html#range.reference.algorithms.mutating.fill.complexity">Complexity</a>
           </h6>
 <p>
diff --git a/doc/html/range/reference/algorithms/mutating/fill_n.html b/doc/html/range/reference/algorithms/mutating/fill_n.html
index 5a7fb40..56594c9 100644
--- a/doc/html/range/reference/algorithms/mutating/fill_n.html
+++ b/doc/html/range/reference/algorithms/mutating/fill_n.html
@@ -27,7 +27,7 @@
 <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="id693816"></a>
+<a name="id685887"></a>
             <a class="link" href="fill_n.html#range.reference.algorithms.mutating.fill_n.prototype">Prototype</a>
           </h6>
 <p>
@@ -39,7 +39,7 @@
 <p>
           </p>
 <a name="range.reference.algorithms.mutating.fill_n.description"></a><h6>
-<a name="id693986"></a>
+<a name="id686056"></a>
             <a class="link" href="fill_n.html#range.reference.algorithms.mutating.fill_n.description">Description</a>
           </h6>
 <p>
@@ -47,14 +47,14 @@
             <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="id694082"></a>
+<a name="id686152"></a>
             <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="id694152"></a>
+<a name="id686222"></a>
             <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">
@@ -77,7 +77,7 @@
               </li>
 </ul></div>
 <a name="range.reference.algorithms.mutating.fill_n.complexity"></a><h6>
-<a name="id694271"></a>
+<a name="id686341"></a>
             <a class="link" href="fill_n.html#range.reference.algorithms.mutating.fill_n.complexity">Complexity</a>
           </h6>
 <p>
diff --git a/doc/html/range/reference/algorithms/mutating/generate.html b/doc/html/range/reference/algorithms/mutating/generate.html
index d28c8ca..c4f568d 100644
--- a/doc/html/range/reference/algorithms/mutating/generate.html
+++ b/doc/html/range/reference/algorithms/mutating/generate.html
@@ -27,7 +27,7 @@
 <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="id694321"></a>
+<a name="id686391"></a>
             <a class="link" href="generate.html#range.reference.algorithms.mutating.generate.prototype">Prototype</a>
           </h6>
 <p>
@@ -42,7 +42,7 @@
 <p>
           </p>
 <a name="range.reference.algorithms.mutating.generate.description"></a><h6>
-<a name="id694559"></a>
+<a name="id686629"></a>
             <a class="link" href="generate.html#range.reference.algorithms.mutating.generate.description">Description</a>
           </h6>
 <p>
@@ -52,14 +52,14 @@
             Returns the resultant range.
           </p>
 <a name="range.reference.algorithms.mutating.generate.definition"></a><h6>
-<a name="id694619"></a>
+<a name="id686689"></a>
             <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="id694688"></a>
+<a name="id686758"></a>
             <a class="link" href="generate.html#range.reference.algorithms.mutating.generate.requirements">Requirements</a>
           </h6>
 <div class="itemizedlist"><ul class="itemizedlist" type="disc">
@@ -83,7 +83,7 @@
               </li>
 </ul></div>
 <a name="range.reference.algorithms.mutating.generate.precondition_"></a><h6>
-<a name="id694819"></a>
+<a name="id686889"></a>
             <a class="link" href="generate.html#range.reference.algorithms.mutating.generate.precondition_">Precondition:</a>
           </h6>
 <div class="itemizedlist"><ul class="itemizedlist" type="disc">
@@ -97,7 +97,7 @@
               </li>
 </ul></div>
 <a name="range.reference.algorithms.mutating.generate.complexity"></a><h6>
-<a name="id694924"></a>
+<a name="id686995"></a>
             <a class="link" href="generate.html#range.reference.algorithms.mutating.generate.complexity">Complexity</a>
           </h6>
 <p>
diff --git a/doc/html/range/reference/algorithms/mutating/inplace_merge.html b/doc/html/range/reference/algorithms/mutating/inplace_merge.html
index a14c627..ced6655 100644
--- a/doc/html/range/reference/algorithms/mutating/inplace_merge.html
+++ b/doc/html/range/reference/algorithms/mutating/inplace_merge.html
@@ -27,7 +27,7 @@
 <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="id694988"></a>
+<a name="id687058"></a>
             <a class="link" href="inplace_merge.html#range.reference.algorithms.mutating.inplace_merge.prototype">Prototype</a>
           </h6>
 <p>
@@ -58,7 +58,7 @@
 <p>
           </p>
 <a name="range.reference.algorithms.mutating.inplace_merge.description"></a><h6>
-<a name="id695546"></a>
+<a name="id687615"></a>
             <a class="link" href="inplace_merge.html#range.reference.algorithms.mutating.inplace_merge.description">Description</a>
           </h6>
 <p>
@@ -71,14 +71,14 @@
             input range is preserved.
           </p>
 <a name="range.reference.algorithms.mutating.inplace_merge.definition"></a><h6>
-<a name="id695763"></a>
+<a name="id687833"></a>
             <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="id695833"></a>
+<a name="id687903"></a>
             <a class="link" href="inplace_merge.html#range.reference.algorithms.mutating.inplace_merge.requirements">Requirements</a>
           </h6>
 <p>
@@ -115,11 +115,11 @@
             argument types.
           </p>
 <a name="range.reference.algorithms.mutating.inplace_merge.precondition_"></a><h6>
-<a name="id696088"></a>
+<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.for_the_non_predicate_version_"></a><h6>
-<a name="id696108"></a>
+<a name="id688178"></a>
             <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>
@@ -142,7 +142,7 @@
               </li>
 </ul></div>
 <a name="range.reference.algorithms.mutating.inplace_merge.for_the_predicate_version_"></a><h6>
-<a name="id696369"></a>
+<a name="id688439"></a>
             <a class="link" href="inplace_merge.html#range.reference.algorithms.mutating.inplace_merge.for_the_predicate_version_">For
             the predicate version:</a>
           </h6>
@@ -163,7 +163,7 @@
               </li>
 </ul></div>
 <a name="range.reference.algorithms.mutating.inplace_merge.complexity"></a><h6>
-<a name="id696654"></a>
+<a name="id688724"></a>
             <a class="link" href="inplace_merge.html#range.reference.algorithms.mutating.inplace_merge.complexity">Complexity</a>
           </h6>
 <p>
diff --git a/doc/html/range/reference/algorithms/mutating/merge.html b/doc/html/range/reference/algorithms/mutating/merge.html
index f847d5d..9d0ce89 100644
--- a/doc/html/range/reference/algorithms/mutating/merge.html
+++ b/doc/html/range/reference/algorithms/mutating/merge.html
@@ -27,7 +27,7 @@
 <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="id696733"></a>
+<a name="id688803"></a>
             <a class="link" href="merge.html#range.reference.algorithms.mutating.merge.prototype">Prototype</a>
           </h6>
 <p>
@@ -56,7 +56,7 @@
 <p>
           </p>
 <a name="range.reference.algorithms.mutating.merge.description"></a><h6>
-<a name="id697080"></a>
+<a name="id689149"></a>
             <a class="link" href="merge.html#range.reference.algorithms.mutating.merge.description">Description</a>
           </h6>
 <p>
@@ -75,14 +75,14 @@
             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="id697254"></a>
+<a name="id689324"></a>
             <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="id697323"></a>
+<a name="id689393"></a>
             <a class="link" href="merge.html#range.reference.algorithms.mutating.merge.requirements">Requirements</a>
           </h6>
 <p>
@@ -150,11 +150,11 @@
               </li>
 </ul></div>
 <a name="range.reference.algorithms.mutating.merge.precondition_"></a><h6>
-<a name="id697845"></a>
+<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.for_the_non_predicate_version_"></a><h6>
-<a name="id697864"></a>
+<a name="id689935"></a>
             <a class="link" href="merge.html#range.reference.algorithms.mutating.merge.for_the_non_predicate_version_">For
             the non-predicate version:</a>
           </h6>
@@ -194,7 +194,7 @@
               </li>
 </ul></div>
 <a name="range.reference.algorithms.mutating.merge.for_the_predicate_version_"></a><h6>
-<a name="id698329"></a>
+<a name="id690400"></a>
             <a class="link" href="merge.html#range.reference.algorithms.mutating.merge.for_the_predicate_version_">For
             the predicate version:</a>
           </h6>
@@ -230,7 +230,7 @@
               </li>
 </ul></div>
 <a name="range.reference.algorithms.mutating.merge.complexity"></a><h6>
-<a name="id698819"></a>
+<a name="id690889"></a>
             <a class="link" href="merge.html#range.reference.algorithms.mutating.merge.complexity">Complexity</a>
           </h6>
 <p>
diff --git a/doc/html/range/reference/algorithms/mutating/nth_element.html b/doc/html/range/reference/algorithms/mutating/nth_element.html
index 624dfb2..16846cd 100644
--- a/doc/html/range/reference/algorithms/mutating/nth_element.html
+++ b/doc/html/range/reference/algorithms/mutating/nth_element.html
@@ -27,7 +27,7 @@
 <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="id698940"></a>
+<a name="id691010"></a>
             <a class="link" href="nth_element.html#range.reference.algorithms.mutating.nth_element.prototype">Prototype</a>
           </h6>
 <p>
@@ -58,7 +58,7 @@
 <p>
           </p>
 <a name="range.reference.algorithms.mutating.nth_element.description"></a><h6>
-<a name="id699459"></a>
+<a name="id691529"></a>
             <a class="link" href="nth_element.html#range.reference.algorithms.mutating.nth_element.description">Description</a>
           </h6>
 <p>
@@ -69,14 +69,14 @@
             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="id699536"></a>
+<a name="id691606"></a>
             <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="id699606"></a>
+<a name="id691676"></a>
             <a class="link" href="nth_element.html#range.reference.algorithms.mutating.nth_element.requirements">Requirements</a>
           </h6>
 <p>
@@ -127,7 +127,7 @@
               </li>
 </ul></div>
 <a name="range.reference.algorithms.mutating.nth_element.complexity"></a><h6>
-<a name="id699853"></a>
+<a name="id691923"></a>
             <a class="link" href="nth_element.html#range.reference.algorithms.mutating.nth_element.complexity">Complexity</a>
           </h6>
 <p>
diff --git a/doc/html/range/reference/algorithms/mutating/partial_sort.html b/doc/html/range/reference/algorithms/mutating/partial_sort.html
index 12a4024..33fb1df 100644
--- a/doc/html/range/reference/algorithms/mutating/partial_sort.html
+++ b/doc/html/range/reference/algorithms/mutating/partial_sort.html
@@ -27,7 +27,7 @@
 <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="id699918"></a>
+<a name="id691988"></a>
             <a class="link" href="partial_sort.html#range.reference.algorithms.mutating.partial_sort.prototype">Prototype</a>
           </h6>
 <p>
@@ -58,7 +58,7 @@
 <p>
           </p>
 <a name="range.reference.algorithms.mutating.partial_sort.description"></a><h6>
-<a name="id700439"></a>
+<a name="id692508"></a>
             <a class="link" href="partial_sort.html#range.reference.algorithms.mutating.partial_sort.description">Description</a>
           </h6>
 <p>
@@ -74,14 +74,14 @@
             predicate instead.
           </p>
 <a name="range.reference.algorithms.mutating.partial_sort.definition"></a><h6>
-<a name="id700615"></a>
+<a name="id692685"></a>
             <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="id700686"></a>
+<a name="id692756"></a>
             <a class="link" href="partial_sort.html#range.reference.algorithms.mutating.partial_sort.requirements">Requirements</a>
           </h6>
 <p>
@@ -132,7 +132,7 @@
               </li>
 </ul></div>
 <a name="range.reference.algorithms.mutating.partial_sort.complexity"></a><h6>
-<a name="id700933"></a>
+<a name="id693003"></a>
             <a class="link" href="partial_sort.html#range.reference.algorithms.mutating.partial_sort.complexity">Complexity</a>
           </h6>
 <p>
diff --git a/doc/html/range/reference/algorithms/mutating/partition.html b/doc/html/range/reference/algorithms/mutating/partition.html
index 0cd0c73..d659dd4 100644
--- a/doc/html/range/reference/algorithms/mutating/partition.html
+++ b/doc/html/range/reference/algorithms/mutating/partition.html
@@ -27,7 +27,7 @@
 <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="id701049"></a>
+<a name="id693119"></a>
             <a class="link" href="partition.html#range.reference.algorithms.mutating.partition.prototype">Prototype</a>
           </h6>
 <p>
@@ -66,7 +66,7 @@
 <p>
           </p>
 <a name="range.reference.algorithms.mutating.partition.description"></a><h6>
-<a name="id701626"></a>
+<a name="id693695"></a>
             <a class="link" href="partition.html#range.reference.algorithms.mutating.partition.description">Description</a>
           </h6>
 <p>
@@ -80,14 +80,14 @@
             corresponds to the middle iterator.
           </p>
 <a name="range.reference.algorithms.mutating.partition.definition"></a><h6>
-<a name="id701704"></a>
+<a name="id693774"></a>
             <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="id701774"></a>
+<a name="id693845"></a>
             <a class="link" href="partition.html#range.reference.algorithms.mutating.partition.requirements">Requirements</a>
           </h6>
 <div class="itemizedlist"><ul class="itemizedlist" type="disc">
@@ -107,7 +107,7 @@
               </li>
 </ul></div>
 <a name="range.reference.algorithms.mutating.partition.complexity"></a><h6>
-<a name="id701877"></a>
+<a name="id693947"></a>
             <a class="link" href="partition.html#range.reference.algorithms.mutating.partition.complexity">Complexity</a>
           </h6>
 <p>
diff --git a/doc/html/range/reference/algorithms/mutating/random_shuffle.html b/doc/html/range/reference/algorithms/mutating/random_shuffle.html
index f1a3c6c..8b8629d 100644
--- a/doc/html/range/reference/algorithms/mutating/random_shuffle.html
+++ b/doc/html/range/reference/algorithms/mutating/random_shuffle.html
@@ -27,7 +27,7 @@
 <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="id701987"></a>
+<a name="id694058"></a>
             <a class="link" href="random_shuffle.html#range.reference.algorithms.mutating.random_shuffle.prototype">Prototype</a>
           </h6>
 <p>
@@ -48,7 +48,7 @@
 <p>
           </p>
 <a name="range.reference.algorithms.mutating.random_shuffle.description"></a><h6>
-<a name="id702372"></a>
+<a name="id694442"></a>
             <a class="link" href="random_shuffle.html#range.reference.algorithms.mutating.random_shuffle.description">Description</a>
           </h6>
 <p>
@@ -60,14 +60,14 @@
             the shuffles range.
           </p>
 <a name="range.reference.algorithms.mutating.random_shuffle.definition"></a><h6>
-<a name="id702460"></a>
+<a name="id694530"></a>
             <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="id702531"></a>
+<a name="id694601"></a>
             <a class="link" href="random_shuffle.html#range.reference.algorithms.mutating.random_shuffle.requirements">Requirements</a>
           </h6>
 <p>
@@ -98,7 +98,7 @@
               </li>
 </ul></div>
 <a name="range.reference.algorithms.mutating.random_shuffle.precondition_"></a><h6>
-<a name="id702680"></a>
+<a name="id694751"></a>
             <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">
@@ -107,7 +107,7 @@
                 maximum value.
               </li></ul></div>
 <a name="range.reference.algorithms.mutating.random_shuffle.complexity"></a><h6>
-<a name="id702745"></a>
+<a name="id694815"></a>
             <a class="link" href="random_shuffle.html#range.reference.algorithms.mutating.random_shuffle.complexity">Complexity</a>
           </h6>
 <p>
diff --git a/doc/html/range/reference/algorithms/mutating/remove.html b/doc/html/range/reference/algorithms/mutating/remove.html
index 618d087..172fd87 100644
--- a/doc/html/range/reference/algorithms/mutating/remove.html
+++ b/doc/html/range/reference/algorithms/mutating/remove.html
@@ -27,7 +27,7 @@
 <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="id702847"></a>
+<a name="id694919"></a>
             <a class="link" href="remove.html#range.reference.algorithms.mutating.remove.prototype">Prototype</a>
           </h6>
 <p>
@@ -66,7 +66,7 @@
 <p>
           </p>
 <a name="range.reference.algorithms.mutating.remove.description"></a><h6>
-<a name="id703465"></a>
+<a name="id695536"></a>
             <a class="link" href="remove.html#range.reference.algorithms.mutating.remove.description">Description</a>
           </h6>
 <p>
@@ -83,14 +83,14 @@
             are dereferenceable, but the elements are unspecified.
           </p>
 <a name="range.reference.algorithms.mutating.remove.definition"></a><h6>
-<a name="id703692"></a>
+<a name="id695762"></a>
             <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="id703763"></a>
+<a name="id695833"></a>
             <a class="link" href="remove.html#range.reference.algorithms.mutating.remove.requirements">Requirements</a>
           </h6>
 <div class="itemizedlist"><ul class="itemizedlist" type="disc">
@@ -113,7 +113,7 @@
               </li>
 </ul></div>
 <a name="range.reference.algorithms.mutating.remove.complexity"></a><h6>
-<a name="id703884"></a>
+<a name="id695954"></a>
             <a class="link" href="remove.html#range.reference.algorithms.mutating.remove.complexity">Complexity</a>
           </h6>
 <p>
diff --git a/doc/html/range/reference/algorithms/mutating/remove_copy.html b/doc/html/range/reference/algorithms/mutating/remove_copy.html
index 410848d..a5aff6b 100644
--- a/doc/html/range/reference/algorithms/mutating/remove_copy.html
+++ b/doc/html/range/reference/algorithms/mutating/remove_copy.html
@@ -27,7 +27,7 @@
 <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="id703958"></a>
+<a name="id696029"></a>
             <a class="link" href="remove_copy.html#range.reference.algorithms.mutating.remove_copy.prototype">Prototype</a>
           </h6>
 <p>
@@ -44,7 +44,7 @@
 <p>
           </p>
 <a name="range.reference.algorithms.mutating.remove_copy.description"></a><h6>
-<a name="id704262"></a>
+<a name="id696332"></a>
             <a class="link" href="remove_copy.html#range.reference.algorithms.mutating.remove_copy.description">Description</a>
           </h6>
 <p>
@@ -53,14 +53,14 @@
             <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="id704348"></a>
+<a name="id696418"></a>
             <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="id704417"></a>
+<a name="id696488"></a>
             <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">
@@ -83,7 +83,7 @@
               </li>
 </ul></div>
 <a name="range.reference.algorithms.mutating.remove_copy.complexity"></a><h6>
-<a name="id704539"></a>
+<a name="id696609"></a>
             <a class="link" href="remove_copy.html#range.reference.algorithms.mutating.remove_copy.complexity">Complexity</a>
           </h6>
 <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 ed95b13..4763181 100644
--- a/doc/html/range/reference/algorithms/mutating/remove_copy_if.html
+++ b/doc/html/range/reference/algorithms/mutating/remove_copy_if.html
@@ -27,7 +27,7 @@
 <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="id704613"></a>
+<a name="id696683"></a>
             <a class="link" href="remove_copy_if.html#range.reference.algorithms.mutating.remove_copy_if.prototype">Prototype</a>
           </h6>
 <p>
@@ -44,7 +44,7 @@
 <p>
           </p>
 <a name="range.reference.algorithms.mutating.remove_copy_if.description"></a><h6>
-<a name="id704895"></a>
+<a name="id696964"></a>
             <a class="link" href="remove_copy_if.html#range.reference.algorithms.mutating.remove_copy_if.description">Description</a>
           </h6>
 <p>
@@ -54,14 +54,14 @@
             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="id704984"></a>
+<a name="id697054"></a>
             <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="id705054"></a>
+<a name="id697124"></a>
             <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">
@@ -79,7 +79,7 @@
               </li>
 </ul></div>
 <a name="range.reference.algorithms.mutating.remove_copy_if.complexity"></a><h6>
-<a name="id705147"></a>
+<a name="id697217"></a>
             <a class="link" href="remove_copy_if.html#range.reference.algorithms.mutating.remove_copy_if.complexity">Complexity</a>
           </h6>
 <p>
diff --git a/doc/html/range/reference/algorithms/mutating/remove_if.html b/doc/html/range/reference/algorithms/mutating/remove_if.html
index 113d9dd..59aebc2 100644
--- a/doc/html/range/reference/algorithms/mutating/remove_if.html
+++ b/doc/html/range/reference/algorithms/mutating/remove_if.html
@@ -27,7 +27,7 @@
 <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="id705221"></a>
+<a name="id697291"></a>
             <a class="link" href="remove_if.html#range.reference.algorithms.mutating.remove_if.prototype">Prototype</a>
           </h6>
 <p>
@@ -66,7 +66,7 @@
 <p>
           </p>
 <a name="range.reference.algorithms.mutating.remove_if.description"></a><h6>
-<a name="id705797"></a>
+<a name="id697867"></a>
             <a class="link" href="remove_if.html#range.reference.algorithms.mutating.remove_if.description">Description</a>
           </h6>
 <p>
@@ -82,14 +82,14 @@
             are unspecified.
           </p>
 <a name="range.reference.algorithms.mutating.remove_if.definition"></a><h6>
-<a name="id706018"></a>
+<a name="id698089"></a>
             <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="id706090"></a>
+<a name="id698160"></a>
             <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">
@@ -112,7 +112,7 @@
               </li>
 </ul></div>
 <a name="range.reference.algorithms.mutating.remove_if.complexity"></a><h6>
-<a name="id706212"></a>
+<a name="id698282"></a>
             <a class="link" href="remove_if.html#range.reference.algorithms.mutating.remove_if.complexity">Complexity</a>
           </h6>
 <p>
diff --git a/doc/html/range/reference/algorithms/mutating/replace.html b/doc/html/range/reference/algorithms/mutating/replace.html
index 9055f9a..b392c50 100644
--- a/doc/html/range/reference/algorithms/mutating/replace.html
+++ b/doc/html/range/reference/algorithms/mutating/replace.html
@@ -27,7 +27,7 @@
 <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="id706298"></a>
+<a name="id698368"></a>
             <a class="link" href="replace.html#range.reference.algorithms.mutating.replace.prototype">Prototype</a>
           </h6>
 <p>
@@ -48,7 +48,7 @@
 <p>
           </p>
 <a name="range.reference.algorithms.mutating.replace.description"></a><h6>
-<a name="id706609"></a>
+<a name="id698680"></a>
             <a class="link" href="replace.html#range.reference.algorithms.mutating.replace.description">Description</a>
           </h6>
 <p>
@@ -57,14 +57,14 @@
             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="id706685"></a>
+<a name="id698755"></a>
             <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="id706755"></a>
+<a name="id698825"></a>
             <a class="link" href="replace.html#range.reference.algorithms.mutating.replace.requirements">Requirements</a>
           </h6>
 <div class="itemizedlist"><ul class="itemizedlist" type="disc">
@@ -93,7 +93,7 @@
               </li>
 </ul></div>
 <a name="range.reference.algorithms.mutating.replace.complexity"></a><h6>
-<a name="id706914"></a>
+<a name="id698985"></a>
             <a class="link" href="replace.html#range.reference.algorithms.mutating.replace.complexity">Complexity</a>
           </h6>
 <p>
diff --git a/doc/html/range/reference/algorithms/mutating/replace_copy.html b/doc/html/range/reference/algorithms/mutating/replace_copy.html
index 267f594..1784235 100644
--- a/doc/html/range/reference/algorithms/mutating/replace_copy.html
+++ b/doc/html/range/reference/algorithms/mutating/replace_copy.html
@@ -27,7 +27,7 @@
 <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="id707013"></a>
+<a name="id699084"></a>
             <a class="link" href="replace_copy.html#range.reference.algorithms.mutating.replace_copy.prototype">Prototype</a>
           </h6>
 <p>
@@ -40,7 +40,7 @@
 <p>
           </p>
 <a name="range.reference.algorithms.mutating.replace_copy.description"></a><h6>
-<a name="id707209"></a>
+<a name="id699279"></a>
             <a class="link" href="replace_copy.html#range.reference.algorithms.mutating.replace_copy.description">Description</a>
           </h6>
 <p>
@@ -53,14 +53,14 @@
             <span class="identifier">x</span></code>.
           </p>
 <a name="range.reference.algorithms.mutating.replace_copy.definition"></a><h6>
-<a name="id707318"></a>
+<a name="id699388"></a>
             <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="id707388"></a>
+<a name="id699458"></a>
             <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">
@@ -87,7 +87,7 @@
               </li>
 </ul></div>
 <a name="range.reference.algorithms.mutating.replace_copy.complexity"></a><h6>
-<a name="id707536"></a>
+<a name="id699606"></a>
             <a class="link" href="replace_copy.html#range.reference.algorithms.mutating.replace_copy.complexity">Complexity</a>
           </h6>
 <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 b053c1e..d4d3be2 100644
--- a/doc/html/range/reference/algorithms/mutating/replace_copy_if.html
+++ b/doc/html/range/reference/algorithms/mutating/replace_copy_if.html
@@ -27,7 +27,7 @@
 <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="id707610"></a>
+<a name="id699680"></a>
             <a class="link" href="replace_copy_if.html#range.reference.algorithms.mutating.replace_copy_if.prototype">Prototype</a>
           </h6>
 <p>
@@ -40,7 +40,7 @@
 <p>
           </p>
 <a name="range.reference.algorithms.mutating.replace_copy_if.description"></a><h6>
-<a name="id707811"></a>
+<a name="id699881"></a>
             <a class="link" href="replace_copy_if.html#range.reference.algorithms.mutating.replace_copy_if.description">Description</a>
           </h6>
 <p>
@@ -51,14 +51,14 @@
             <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="id707922"></a>
+<a name="id699992"></a>
             <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="id707992"></a>
+<a name="id700063"></a>
             <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">
@@ -89,7 +89,7 @@
               </li>
 </ul></div>
 <a name="range.reference.algorithms.mutating.replace_copy_if.complexity"></a><h6>
-<a name="id708169"></a>
+<a name="id700239"></a>
             <a class="link" href="replace_copy_if.html#range.reference.algorithms.mutating.replace_copy_if.complexity">Complexity</a>
           </h6>
 <p>
diff --git a/doc/html/range/reference/algorithms/mutating/replace_if.html b/doc/html/range/reference/algorithms/mutating/replace_if.html
index f63c30e..1e6609b 100644
--- a/doc/html/range/reference/algorithms/mutating/replace_if.html
+++ b/doc/html/range/reference/algorithms/mutating/replace_if.html
@@ -27,7 +27,7 @@
 <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="id708254"></a>
+<a name="id700324"></a>
             <a class="link" href="replace_if.html#range.reference.algorithms.mutating.replace_if.prototype">Prototype</a>
           </h6>
 <p>
@@ -42,7 +42,7 @@
 <p>
           </p>
 <a name="range.reference.algorithms.mutating.replace_if.description"></a><h6>
-<a name="id708572"></a>
+<a name="id700643"></a>
             <a class="link" href="replace_if.html#range.reference.algorithms.mutating.replace_if.description">Description</a>
           </h6>
 <p>
@@ -51,14 +51,14 @@
             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="id708684"></a>
+<a name="id700754"></a>
             <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="id708754"></a>
+<a name="id700825"></a>
             <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">
@@ -90,7 +90,7 @@
               </li>
 </ul></div>
 <a name="range.reference.algorithms.mutating.replace_if.complexity"></a><h6>
-<a name="id708930"></a>
+<a name="id701001"></a>
             <a class="link" href="replace_if.html#range.reference.algorithms.mutating.replace_if.complexity">Complexity</a>
           </h6>
 <p>
diff --git a/doc/html/range/reference/algorithms/mutating/reverse.html b/doc/html/range/reference/algorithms/mutating/reverse.html
index 2e8262b..6907fe5 100644
--- a/doc/html/range/reference/algorithms/mutating/reverse.html
+++ b/doc/html/range/reference/algorithms/mutating/reverse.html
@@ -27,7 +27,7 @@
 <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="id709040"></a>
+<a name="id701111"></a>
             <a class="link" href="reverse.html#range.reference.algorithms.mutating.reverse.prototype">Prototype</a>
           </h6>
 <p>
@@ -42,7 +42,7 @@
 <p>
           </p>
 <a name="range.reference.algorithms.mutating.reverse.description"></a><h6>
-<a name="id709211"></a>
+<a name="id701281"></a>
             <a class="link" href="reverse.html#range.reference.algorithms.mutating.reverse.description">Description</a>
           </h6>
 <p>
@@ -50,14 +50,14 @@
             Returns a reference to the reversed range.
           </p>
 <a name="range.reference.algorithms.mutating.reverse.definition"></a><h6>
-<a name="id709244"></a>
+<a name="id701314"></a>
             <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="id709314"></a>
+<a name="id701385"></a>
             <a class="link" href="reverse.html#range.reference.algorithms.mutating.reverse.requirements">Requirements</a>
           </h6>
 <div class="itemizedlist"><ul class="itemizedlist" type="disc">
@@ -72,7 +72,7 @@
               </li>
 </ul></div>
 <a name="range.reference.algorithms.mutating.reverse.complexity"></a><h6>
-<a name="id709380"></a>
+<a name="id701451"></a>
             <a class="link" href="reverse.html#range.reference.algorithms.mutating.reverse.complexity">Complexity</a>
           </h6>
 <p>
diff --git a/doc/html/range/reference/algorithms/mutating/reverse_copy.html b/doc/html/range/reference/algorithms/mutating/reverse_copy.html
index ea0d3e9..b0c9624 100644
--- a/doc/html/range/reference/algorithms/mutating/reverse_copy.html
+++ b/doc/html/range/reference/algorithms/mutating/reverse_copy.html
@@ -27,7 +27,7 @@
 <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="id709469"></a>
+<a name="id701540"></a>
             <a class="link" href="reverse_copy.html#range.reference.algorithms.mutating.reverse_copy.prototype">Prototype</a>
           </h6>
 <p>
@@ -39,7 +39,7 @@
 <p>
           </p>
 <a name="range.reference.algorithms.mutating.reverse_copy.description"></a><h6>
-<a name="id709596"></a>
+<a name="id701667"></a>
             <a class="link" href="reverse_copy.html#range.reference.algorithms.mutating.reverse_copy.description">Description</a>
           </h6>
 <p>
@@ -49,14 +49,14 @@
             Returns the output iterator one passed the last copied element.
           </p>
 <a name="range.reference.algorithms.mutating.reverse_copy.definition"></a><h6>
-<a name="id709652"></a>
+<a name="id701723"></a>
             <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="id709722"></a>
+<a name="id701792"></a>
             <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">
@@ -75,7 +75,7 @@
               </li>
 </ul></div>
 <a name="range.reference.algorithms.mutating.reverse_copy.complexity"></a><h6>
-<a name="id709814"></a>
+<a name="id701885"></a>
             <a class="link" href="reverse_copy.html#range.reference.algorithms.mutating.reverse_copy.complexity">Complexity</a>
           </h6>
 <p>
diff --git a/doc/html/range/reference/algorithms/mutating/rotate.html b/doc/html/range/reference/algorithms/mutating/rotate.html
index 4b55abb..de9388a 100644
--- a/doc/html/range/reference/algorithms/mutating/rotate.html
+++ b/doc/html/range/reference/algorithms/mutating/rotate.html
@@ -27,7 +27,7 @@
 <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="id709890"></a>
+<a name="id701961"></a>
             <a class="link" href="rotate.html#range.reference.algorithms.mutating.rotate.prototype">Prototype</a>
           </h6>
 <p>
@@ -44,7 +44,7 @@
 <p>
           </p>
 <a name="range.reference.algorithms.mutating.rotate.description"></a><h6>
-<a name="id710146"></a>
+<a name="id702217"></a>
             <a class="link" href="rotate.html#range.reference.algorithms.mutating.rotate.description">Description</a>
           </h6>
 <p>
@@ -53,14 +53,14 @@
             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="id710267"></a>
+<a name="id702338"></a>
             <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="id710337"></a>
+<a name="id702407"></a>
             <a class="link" href="rotate.html#range.reference.algorithms.mutating.rotate.requirements">Requirements</a>
           </h6>
 <div class="itemizedlist"><ul class="itemizedlist" type="disc">
@@ -74,7 +74,7 @@
               </li>
 </ul></div>
 <a name="range.reference.algorithms.mutating.rotate.precondition_"></a><h6>
-<a name="id710402"></a>
+<a name="id702473"></a>
             <a class="link" href="rotate.html#range.reference.algorithms.mutating.rotate.precondition_">Precondition:</a>
           </h6>
 <div class="itemizedlist"><ul class="itemizedlist" type="disc">
@@ -86,7 +86,7 @@
               </li>
 </ul></div>
 <a name="range.reference.algorithms.mutating.rotate.complexity"></a><h6>
-<a name="id710515"></a>
+<a name="id702586"></a>
             <a class="link" href="rotate.html#range.reference.algorithms.mutating.rotate.complexity">Complexity</a>
           </h6>
 <p>
diff --git a/doc/html/range/reference/algorithms/mutating/rotate_copy.html b/doc/html/range/reference/algorithms/mutating/rotate_copy.html
index 497fa1d..fbecb94 100644
--- a/doc/html/range/reference/algorithms/mutating/rotate_copy.html
+++ b/doc/html/range/reference/algorithms/mutating/rotate_copy.html
@@ -27,7 +27,7 @@
 <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="id710578"></a>
+<a name="id702649"></a>
             <a class="link" href="rotate_copy.html#range.reference.algorithms.mutating.rotate_copy.prototype">Prototype</a>
           </h6>
 <p>
@@ -42,7 +42,7 @@
 <p>
           </p>
 <a name="range.reference.algorithms.mutating.rotate_copy.description"></a><h6>
-<a name="id710746"></a>
+<a name="id702817"></a>
             <a class="link" href="rotate_copy.html#range.reference.algorithms.mutating.rotate_copy.description">Description</a>
           </h6>
 <p>
@@ -51,14 +51,14 @@
             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="id710867"></a>
+<a name="id702938"></a>
             <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="id710937"></a>
+<a name="id703007"></a>
             <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">
@@ -76,7 +76,7 @@
               </li>
 </ul></div>
 <a name="range.reference.algorithms.mutating.rotate_copy.precondition_"></a><h6>
-<a name="id711029"></a>
+<a name="id703100"></a>
             <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">
@@ -88,7 +88,7 @@
               </li>
 </ul></div>
 <a name="range.reference.algorithms.mutating.rotate_copy.complexity"></a><h6>
-<a name="id711141"></a>
+<a name="id703212"></a>
             <a class="link" href="rotate_copy.html#range.reference.algorithms.mutating.rotate_copy.complexity">Complexity</a>
           </h6>
 <p>
diff --git a/doc/html/range/reference/algorithms/mutating/sort.html b/doc/html/range/reference/algorithms/mutating/sort.html
index db9444b..aa9512c 100644
--- a/doc/html/range/reference/algorithms/mutating/sort.html
+++ b/doc/html/range/reference/algorithms/mutating/sort.html
@@ -27,7 +27,7 @@
 <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="id711206"></a>
+<a name="id703276"></a>
             <a class="link" href="sort.html#range.reference.algorithms.mutating.sort.prototype">Prototype</a>
           </h6>
 <p>
@@ -48,7 +48,7 @@
 <p>
           </p>
 <a name="range.reference.algorithms.mutating.sort.description"></a><h6>
-<a name="id711582"></a>
+<a name="id703652"></a>
             <a class="link" href="sort.html#range.reference.algorithms.mutating.sort.description">Description</a>
           </h6>
 <p>
@@ -71,14 +71,14 @@
             <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="id711824"></a>
+<a name="id703896"></a>
             <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="id711894"></a>
+<a name="id703965"></a>
             <a class="link" href="sort.html#range.reference.algorithms.mutating.sort.requirements">Requirements</a>
           </h6>
 <p>
@@ -129,7 +129,7 @@
               </li>
 </ul></div>
 <a name="range.reference.algorithms.mutating.sort.complexity"></a><h6>
-<a name="id712141"></a>
+<a name="id704212"></a>
             <a class="link" href="sort.html#range.reference.algorithms.mutating.sort.complexity">Complexity</a>
           </h6>
 <p>
diff --git a/doc/html/range/reference/algorithms/mutating/stable_partition.html b/doc/html/range/reference/algorithms/mutating/stable_partition.html
index bd77f3c..c8dcd45 100644
--- a/doc/html/range/reference/algorithms/mutating/stable_partition.html
+++ b/doc/html/range/reference/algorithms/mutating/stable_partition.html
@@ -27,7 +27,7 @@
 <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="id712254"></a>
+<a name="id704324"></a>
             <a class="link" href="stable_partition.html#range.reference.algorithms.mutating.stable_partition.prototype">Prototype</a>
           </h6>
 <p>
@@ -60,7 +60,7 @@
 <p>
           </p>
 <a name="range.reference.algorithms.mutating.stable_partition.description"></a><h6>
-<a name="id712828"></a>
+<a name="id704898"></a>
             <a class="link" href="stable_partition.html#range.reference.algorithms.mutating.stable_partition.description">Description</a>
           </h6>
 <p>
@@ -82,14 +82,14 @@
             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="id712968"></a>
+<a name="id705039"></a>
             <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="id713039"></a>
+<a name="id705110"></a>
             <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">
@@ -107,7 +107,7 @@
               </li>
 </ul></div>
 <a name="range.reference.algorithms.mutating.stable_partition.complexity"></a><h6>
-<a name="id713132"></a>
+<a name="id705203"></a>
             <a class="link" href="stable_partition.html#range.reference.algorithms.mutating.stable_partition.complexity">Complexity</a>
           </h6>
 <p>
diff --git a/doc/html/range/reference/algorithms/mutating/stable_sort.html b/doc/html/range/reference/algorithms/mutating/stable_sort.html
index 6196114..e22f262 100644
--- a/doc/html/range/reference/algorithms/mutating/stable_sort.html
+++ b/doc/html/range/reference/algorithms/mutating/stable_sort.html
@@ -27,7 +27,7 @@
 <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="id713298"></a>
+<a name="id705369"></a>
             <a class="link" href="stable_sort.html#range.reference.algorithms.mutating.stable_sort.prototype">Prototype</a>
           </h6>
 <p>
@@ -48,7 +48,7 @@
 <p>
           </p>
 <a name="range.reference.algorithms.mutating.stable_sort.description"></a><h6>
-<a name="id713674"></a>
+<a name="id705745"></a>
             <a class="link" href="stable_sort.html#range.reference.algorithms.mutating.stable_sort.description">Description</a>
           </h6>
 <p>
@@ -71,14 +71,14 @@
             <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="id713918"></a>
+<a name="id705989"></a>
             <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="id713988"></a>
+<a name="id706060"></a>
             <a class="link" href="stable_sort.html#range.reference.algorithms.mutating.stable_sort.requirements">Requirements</a>
           </h6>
 <p>
@@ -129,7 +129,7 @@
               </li>
 </ul></div>
 <a name="range.reference.algorithms.mutating.stable_sort.complexity"></a><h6>
-<a name="id714235"></a>
+<a name="id706307"></a>
             <a class="link" href="stable_sort.html#range.reference.algorithms.mutating.stable_sort.complexity">Complexity</a>
           </h6>
 <p>
diff --git a/doc/html/range/reference/algorithms/mutating/swap_ranges.html b/doc/html/range/reference/algorithms/mutating/swap_ranges.html
index 2e818ce..0e329dd 100644
--- a/doc/html/range/reference/algorithms/mutating/swap_ranges.html
+++ b/doc/html/range/reference/algorithms/mutating/swap_ranges.html
@@ -27,7 +27,7 @@
 <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="id714414"></a>
+<a name="id706485"></a>
             <a class="link" href="swap_ranges.html#range.reference.algorithms.mutating.swap_ranges.prototype">Prototype</a>
           </h6>
 <p>
@@ -39,7 +39,7 @@
 <p>
           </p>
 <a name="range.reference.algorithms.mutating.swap_ranges.description"></a><h6>
-<a name="id714545"></a>
+<a name="id706616"></a>
             <a class="link" href="swap_ranges.html#range.reference.algorithms.mutating.swap_ranges.description">Description</a>
           </h6>
 <p>
@@ -49,14 +49,14 @@
             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="id714632"></a>
+<a name="id706703"></a>
             <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="id714702"></a>
+<a name="id706773"></a>
             <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">
@@ -80,7 +80,7 @@
               </li>
 </ul></div>
 <a name="range.reference.algorithms.mutating.swap_ranges.complexity"></a><h6>
-<a name="id714809"></a>
+<a name="id706880"></a>
             <a class="link" href="swap_ranges.html#range.reference.algorithms.mutating.swap_ranges.complexity">Complexity</a>
           </h6>
 <p>
diff --git a/doc/html/range/reference/algorithms/mutating/transform.html b/doc/html/range/reference/algorithms/mutating/transform.html
index 068db05..77a319c 100644
--- a/doc/html/range/reference/algorithms/mutating/transform.html
+++ b/doc/html/range/reference/algorithms/mutating/transform.html
@@ -27,7 +27,7 @@
 <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="id714874"></a>
+<a name="id706944"></a>
             <a class="link" href="transform.html#range.reference.algorithms.mutating.transform.prototype">Prototype</a>
           </h6>
 <p>
@@ -56,7 +56,7 @@
 <p>
           </p>
 <a name="range.reference.algorithms.mutating.transform.description"></a><h6>
-<a name="id715207"></a>
+<a name="id707279"></a>
             <a class="link" href="transform.html#range.reference.algorithms.mutating.transform.description">Description</a>
           </h6>
 <p>
@@ -92,14 +92,14 @@
             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="id715747"></a>
+<a name="id707818"></a>
             <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="id715818"></a>
+<a name="id707889"></a>
             <a class="link" href="transform.html#range.reference.algorithms.mutating.transform.requirements">Requirements</a>
           </h6>
 <p>
@@ -169,7 +169,7 @@
               </li>
 </ul></div>
 <a name="range.reference.algorithms.mutating.transform.precondition_"></a><h6>
-<a name="id716187"></a>
+<a name="id708258"></a>
             <a class="link" href="transform.html#range.reference.algorithms.mutating.transform.precondition_">Precondition:</a>
           </h6>
 <p>
@@ -203,7 +203,7 @@
               </li>
 </ul></div>
 <a name="range.reference.algorithms.mutating.transform.complexity"></a><h6>
-<a name="id716610"></a>
+<a name="id708682"></a>
             <a class="link" href="transform.html#range.reference.algorithms.mutating.transform.complexity">Complexity</a>
           </h6>
 <p>
diff --git a/doc/html/range/reference/algorithms/mutating/unique.html b/doc/html/range/reference/algorithms/mutating/unique.html
index e36cbfe..7aa3f2f 100644
--- a/doc/html/range/reference/algorithms/mutating/unique.html
+++ b/doc/html/range/reference/algorithms/mutating/unique.html
@@ -27,7 +27,7 @@
 <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="id716728"></a>
+<a name="id708800"></a>
             <a class="link" href="unique.html#range.reference.algorithms.mutating.unique.prototype">Prototype</a>
           </h6>
 <p>
@@ -68,7 +68,7 @@
 <p>
           </p>
 <a name="range.reference.algorithms.mutating.unique.description"></a><h6>
-<a name="id717751"></a>
+<a name="id709822"></a>
             <a class="link" href="unique.html#range.reference.algorithms.mutating.unique.description">Description</a>
           </h6>
 <p>
@@ -86,14 +86,14 @@
             type.
           </p>
 <a name="range.reference.algorithms.mutating.unique.definition"></a><h6>
-<a name="id717869"></a>
+<a name="id709940"></a>
             <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="id717938"></a>
+<a name="id710010"></a>
             <a class="link" href="unique.html#range.reference.algorithms.mutating.unique.requirements">Requirements</a>
           </h6>
 <p>
@@ -137,7 +137,7 @@
               </li>
 </ul></div>
 <a name="range.reference.algorithms.mutating.unique.complexity"></a><h6>
-<a name="id718160"></a>
+<a name="id710232"></a>
             <a class="link" href="unique.html#range.reference.algorithms.mutating.unique.complexity">Complexity</a>
           </h6>
 <p>
diff --git a/doc/html/range/reference/algorithms/mutating/unique_copy.html b/doc/html/range/reference/algorithms/mutating/unique_copy.html
index 432191e..cd4a014 100644
--- a/doc/html/range/reference/algorithms/mutating/unique_copy.html
+++ b/doc/html/range/reference/algorithms/mutating/unique_copy.html
@@ -27,7 +27,7 @@
 <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="id718283"></a>
+<a name="id710354"></a>
             <a class="link" href="unique_copy.html#range.reference.algorithms.mutating.unique_copy.prototype">Prototype</a>
           </h6>
 <p>
@@ -42,7 +42,7 @@
 <p>
           </p>
 <a name="range.reference.algorithms.mutating.unique_copy.description"></a><h6>
-<a name="id718540"></a>
+<a name="id710611"></a>
             <a class="link" href="unique_copy.html#range.reference.algorithms.mutating.unique_copy.description">Description</a>
           </h6>
 <p>
@@ -55,14 +55,14 @@
             value type.
           </p>
 <a name="range.reference.algorithms.mutating.unique_copy.definition"></a><h6>
-<a name="id718625"></a>
+<a name="id710696"></a>
             <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="id718696"></a>
+<a name="id710767"></a>
             <a class="link" href="unique_copy.html#range.reference.algorithms.mutating.unique_copy.requirements">Requirements</a>
           </h6>
 <p>
@@ -116,7 +116,7 @@
               </li>
 </ul></div>
 <a name="range.reference.algorithms.mutating.unique_copy.complexity"></a><h6>
-<a name="id718974"></a>
+<a name="id711046"></a>
             <a class="link" href="unique_copy.html#range.reference.algorithms.mutating.unique_copy.complexity">Complexity</a>
           </h6>
 <p>
diff --git a/doc/html/range/reference/algorithms/new/copy_n.html b/doc/html/range/reference/algorithms/new/copy_n.html
index dedfad3..d7ce746 100644
--- a/doc/html/range/reference/algorithms/new/copy_n.html
+++ b/doc/html/range/reference/algorithms/new/copy_n.html
@@ -27,7 +27,7 @@
 <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="id752657"></a>
+<a name="id744730"></a>
             <a class="link" href="copy_n.html#range.reference.algorithms.new.copy_n.prototype">Prototype</a>
           </h6>
 <p>
@@ -39,7 +39,7 @@
 <p>
           </p>
 <a name="range.reference.algorithms.new.copy_n.description"></a><h6>
-<a name="id752815"></a>
+<a name="id744888"></a>
             <a class="link" href="copy_n.html#range.reference.algorithms.new.copy_n.description">Description</a>
           </h6>
 <p>
@@ -53,14 +53,14 @@
             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="id752985"></a>
+<a name="id745058"></a>
             <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="id753056"></a>
+<a name="id745129"></a>
             <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">
@@ -79,7 +79,7 @@
               </li>
 </ol></div>
 <a name="range.reference.algorithms.new.copy_n.complexity"></a><h6>
-<a name="id753164"></a>
+<a name="id745236"></a>
             <a class="link" href="copy_n.html#range.reference.algorithms.new.copy_n.complexity">Complexity</a>
           </h6>
 <p>
diff --git a/doc/html/range/reference/algorithms/new/erase.html b/doc/html/range/reference/algorithms/new/erase.html
index ef49c5f..dffd697 100644
--- a/doc/html/range/reference/algorithms/new/erase.html
+++ b/doc/html/range/reference/algorithms/new/erase.html
@@ -27,7 +27,7 @@
 <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="id753215"></a>
+<a name="id745287"></a>
             <a class="link" href="erase.html#range.reference.algorithms.new.erase.prototype">Prototype</a>
           </h6>
 <p>
@@ -41,7 +41,7 @@
 <p>
           </p>
 <a name="range.reference.algorithms.new.erase.description"></a><h6>
-<a name="id753355"></a>
+<a name="id745427"></a>
             <a class="link" href="erase.html#range.reference.algorithms.new.erase.description">Description</a>
           </h6>
 <p>
@@ -58,14 +58,14 @@
             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="id753654"></a>
+<a name="id745727"></a>
             <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="id753723"></a>
+<a name="id745796"></a>
             <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">
@@ -73,7 +73,7 @@
                 erase of an iterator range.
               </li></ol></div>
 <a name="range.reference.algorithms.new.erase.complexity"></a><h6>
-<a name="id753767"></a>
+<a name="id745840"></a>
             <a class="link" href="erase.html#range.reference.algorithms.new.erase.complexity">Complexity</a>
           </h6>
 <p>
diff --git a/doc/html/range/reference/algorithms/new/for_each.html b/doc/html/range/reference/algorithms/new/for_each.html
index 15ec17b..58885de 100644
--- a/doc/html/range/reference/algorithms/new/for_each.html
+++ b/doc/html/range/reference/algorithms/new/for_each.html
@@ -27,7 +27,7 @@
 <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="id753831"></a>
+<a name="id745904"></a>
             <a class="link" href="for_each.html#range.reference.algorithms.new.for_each.prototype">Prototype</a>
           </h6>
 <p>
@@ -72,7 +72,7 @@
 <p>
           </p>
 <a name="range.reference.algorithms.new.for_each.description"></a><h6>
-<a name="id754406"></a>
+<a name="id746478"></a>
             <a class="link" href="for_each.html#range.reference.algorithms.new.for_each.description">Description</a>
           </h6>
 <p>
@@ -88,14 +88,14 @@
             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="id754561"></a>
+<a name="id746634"></a>
             <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="id754632"></a>
+<a name="id746705"></a>
             <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">
@@ -125,7 +125,7 @@
               </li>
 </ol></div>
 <a name="range.reference.algorithms.new.for_each.complexity"></a><h6>
-<a name="id754793"></a>
+<a name="id746866"></a>
             <a class="link" href="for_each.html#range.reference.algorithms.new.for_each.complexity">Complexity</a>
           </h6>
 <p>
diff --git a/doc/html/range/reference/algorithms/new/insert.html b/doc/html/range/reference/algorithms/new/insert.html
index dec9b6a..e702ab7 100644
--- a/doc/html/range/reference/algorithms/new/insert.html
+++ b/doc/html/range/reference/algorithms/new/insert.html
@@ -27,7 +27,7 @@
 <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="id754896"></a>
+<a name="id746969"></a>
             <a class="link" href="insert.html#range.reference.algorithms.new.insert.prototype">Prototype</a>
           </h6>
 <p>
@@ -44,7 +44,7 @@
 <p>
           </p>
 <a name="range.reference.algorithms.new.insert.description"></a><h6>
-<a name="id755066"></a>
+<a name="id747139"></a>
             <a class="link" href="insert.html#range.reference.algorithms.new.insert.description">Description</a>
           </h6>
 <p>
@@ -54,14 +54,14 @@
             <code class="computeroutput"><span class="identifier">target</span></code>.
           </p>
 <a name="range.reference.algorithms.new.insert.definition"></a><h6>
-<a name="id755132"></a>
+<a name="id747205"></a>
             <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="id755202"></a>
+<a name="id747275"></a>
             <a class="link" href="insert.html#range.reference.algorithms.new.insert.requirements">Requirements</a>
           </h6>
 <div class="orderedlist"><ol class="orderedlist" type="1">
@@ -81,7 +81,7 @@
               </li>
 </ol></div>
 <a name="range.reference.algorithms.new.insert.complexity"></a><h6>
-<a name="id755300"></a>
+<a name="id747373"></a>
             <a class="link" href="insert.html#range.reference.algorithms.new.insert.complexity">Complexity</a>
           </h6>
 <p>
diff --git a/doc/html/range/reference/algorithms/new/iota.html b/doc/html/range/reference/algorithms/new/iota.html
index b3c8c06..47054f4 100644
--- a/doc/html/range/reference/algorithms/new/iota.html
+++ b/doc/html/range/reference/algorithms/new/iota.html
@@ -27,7 +27,7 @@
 <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="id755365"></a>
+<a name="id747438"></a>
             <a class="link" href="iota.html#range.reference.algorithms.new.iota.prototype">Prototype</a>
           </h6>
 <p>
@@ -39,7 +39,7 @@
 <p>
           </p>
 <a name="range.reference.algorithms.new.iota.description"></a><h6>
-<a name="id755491"></a>
+<a name="id747564"></a>
             <a class="link" href="iota.html#range.reference.algorithms.new.iota.description">Description</a>
           </h6>
 <p>
@@ -50,14 +50,14 @@
             <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="id755627"></a>
+<a name="id747700"></a>
             <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="id755697"></a>
+<a name="id747770"></a>
             <a class="link" href="iota.html#range.reference.algorithms.new.iota.requirements">Requirements</a>
           </h6>
 <div class="orderedlist"><ol class="orderedlist" type="1">
@@ -73,7 +73,7 @@
               </li>
 </ol></div>
 <a name="range.reference.algorithms.new.iota.complexity"></a><h6>
-<a name="id755777"></a>
+<a name="id747850"></a>
             <a class="link" href="iota.html#range.reference.algorithms.new.iota.complexity">Complexity</a>
           </h6>
 <p>
diff --git a/doc/html/range/reference/algorithms/new/is_sorted.html b/doc/html/range/reference/algorithms/new/is_sorted.html
index 93e9ee9..41d6bdc 100644
--- a/doc/html/range/reference/algorithms/new/is_sorted.html
+++ b/doc/html/range/reference/algorithms/new/is_sorted.html
@@ -27,7 +27,7 @@
 <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="id755851"></a>
+<a name="id747924"></a>
             <a class="link" href="is_sorted.html#range.reference.algorithms.new.is_sorted.prototype">Prototype</a>
           </h6>
 <p>
@@ -42,7 +42,7 @@
 <p>
           </p>
 <a name="range.reference.algorithms.new.is_sorted.description"></a><h6>
-<a name="id756045"></a>
+<a name="id748118"></a>
             <a class="link" href="is_sorted.html#range.reference.algorithms.new.is_sorted.description">Description</a>
           </h6>
 <p>
@@ -58,14 +58,14 @@
             is <code class="computeroutput"><span class="keyword">true</span></code>.
           </p>
 <a name="range.reference.algorithms.new.is_sorted.definition"></a><h6>
-<a name="id756233"></a>
+<a name="id748306"></a>
             <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="id756303"></a>
+<a name="id748376"></a>
             <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">
@@ -85,7 +85,7 @@
               </li>
 </ol></div>
 <a name="range.reference.algorithms.new.is_sorted.complexity"></a><h6>
-<a name="id756412"></a>
+<a name="id748485"></a>
             <a class="link" href="is_sorted.html#range.reference.algorithms.new.is_sorted.complexity">Complexity</a>
           </h6>
 <p>
diff --git a/doc/html/range/reference/algorithms/new/overwrite.html b/doc/html/range/reference/algorithms/new/overwrite.html
index 914a4e8..7fa22b4 100644
--- a/doc/html/range/reference/algorithms/new/overwrite.html
+++ b/doc/html/range/reference/algorithms/new/overwrite.html
@@ -27,7 +27,7 @@
 <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="id756477"></a>
+<a name="id748550"></a>
             <a class="link" href="overwrite.html#range.reference.algorithms.new.overwrite.prototype">Prototype</a>
           </h6>
 <p>
@@ -43,7 +43,7 @@
 <p>
           </p>
 <a name="range.reference.algorithms.new.overwrite.description"></a><h6>
-<a name="id756611"></a>
+<a name="id748683"></a>
             <a class="link" href="overwrite.html#range.reference.algorithms.new.overwrite.description">Description</a>
           </h6>
 <p>
@@ -52,14 +52,14 @@
             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="id756666"></a>
+<a name="id748739"></a>
             <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="id756737"></a>
+<a name="id748810"></a>
             <a class="link" href="overwrite.html#range.reference.algorithms.new.overwrite.requirements">Requirements</a>
           </h6>
 <div class="orderedlist"><ol class="orderedlist" type="1">
@@ -88,7 +88,7 @@
               </li>
 </ol></div>
 <a name="range.reference.algorithms.new.overwrite.complexity"></a><h6>
-<a name="id756914"></a>
+<a name="id748987"></a>
             <a class="link" href="overwrite.html#range.reference.algorithms.new.overwrite.complexity">Complexity</a>
           </h6>
 <p>
diff --git a/doc/html/range/reference/algorithms/new/push_back.html b/doc/html/range/reference/algorithms/new/push_back.html
index 58dd060..a348b93 100644
--- a/doc/html/range/reference/algorithms/new/push_back.html
+++ b/doc/html/range/reference/algorithms/new/push_back.html
@@ -27,7 +27,7 @@
 <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="id756978"></a>
+<a name="id749051"></a>
             <a class="link" href="push_back.html#range.reference.algorithms.new.push_back.prototype">Prototype</a>
           </h6>
 <p>
@@ -43,7 +43,7 @@
 <p>
           </p>
 <a name="range.reference.algorithms.new.push_back.description"></a><h6>
-<a name="id757117"></a>
+<a name="id749190"></a>
             <a class="link" href="push_back.html#range.reference.algorithms.new.push_back.description">Description</a>
           </h6>
 <p>
@@ -52,14 +52,14 @@
             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="id757173"></a>
+<a name="id749246"></a>
             <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="id757243"></a>
+<a name="id749316"></a>
             <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">
@@ -79,7 +79,7 @@
               </li>
 </ol></div>
 <a name="range.reference.algorithms.new.push_back.complexity"></a><h6>
-<a name="id757354"></a>
+<a name="id749427"></a>
             <a class="link" href="push_back.html#range.reference.algorithms.new.push_back.complexity">Complexity</a>
           </h6>
 <p>
diff --git a/doc/html/range/reference/algorithms/new/push_front.html b/doc/html/range/reference/algorithms/new/push_front.html
index 8650468..ab4b48b 100644
--- a/doc/html/range/reference/algorithms/new/push_front.html
+++ b/doc/html/range/reference/algorithms/new/push_front.html
@@ -27,7 +27,7 @@
 <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="id757420"></a>
+<a name="id749493"></a>
             <a class="link" href="push_front.html#range.reference.algorithms.new.push_front.prototype">Prototype</a>
           </h6>
 <p>
@@ -43,7 +43,7 @@
 <p>
           </p>
 <a name="range.reference.algorithms.new.push_front.description"></a><h6>
-<a name="id757558"></a>
+<a name="id749631"></a>
             <a class="link" href="push_front.html#range.reference.algorithms.new.push_front.description">Description</a>
           </h6>
 <p>
@@ -52,14 +52,14 @@
             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="id757613"></a>
+<a name="id749686"></a>
             <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="id757682"></a>
+<a name="id749755"></a>
             <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">
@@ -79,7 +79,7 @@
               </li>
 </ol></div>
 <a name="range.reference.algorithms.new.push_front.complexity"></a><h6>
-<a name="id757794"></a>
+<a name="id749868"></a>
             <a class="link" href="push_front.html#range.reference.algorithms.new.push_front.complexity">Complexity</a>
           </h6>
 <p>
diff --git a/doc/html/range/reference/algorithms/new/remove_erase.html b/doc/html/range/reference/algorithms/new/remove_erase.html
index b28ecfe..e09216b 100644
--- a/doc/html/range/reference/algorithms/new/remove_erase.html
+++ b/doc/html/range/reference/algorithms/new/remove_erase.html
@@ -27,7 +27,7 @@
 <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="id757860"></a>
+<a name="id749933"></a>
             <a class="link" href="remove_erase.html#range.reference.algorithms.new.remove_erase.prototype">Prototype</a>
           </h6>
 <p>
@@ -40,7 +40,7 @@
 <p>
           </p>
 <a name="range.reference.algorithms.new.remove_erase.description"></a><h6>
-<a name="id757996"></a>
+<a name="id750070"></a>
             <a class="link" href="remove_erase.html#range.reference.algorithms.new.remove_erase.description">Description</a>
           </h6>
 <p>
@@ -50,14 +50,14 @@
             algorithm which merely rearranges elements.
           </p>
 <a name="range.reference.algorithms.new.remove_erase.definition"></a><h6>
-<a name="id758053"></a>
+<a name="id750126"></a>
             <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="id758124"></a>
+<a name="id750197"></a>
             <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">
@@ -65,7 +65,7 @@
                 erase of an iterator range.
               </li></ol></div>
 <a name="range.reference.algorithms.new.remove_erase.complexity"></a><h6>
-<a name="id758169"></a>
+<a name="id750242"></a>
             <a class="link" href="remove_erase.html#range.reference.algorithms.new.remove_erase.complexity">Complexity</a>
           </h6>
 <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 f66b732..bf13441 100644
--- a/doc/html/range/reference/algorithms/new/remove_erase_if.html
+++ b/doc/html/range/reference/algorithms/new/remove_erase_if.html
@@ -27,7 +27,7 @@
 <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="id758234"></a>
+<a name="id750307"></a>
             <a class="link" href="remove_erase_if.html#range.reference.algorithms.new.remove_erase_if.prototype">Prototype</a>
           </h6>
 <p>
@@ -40,7 +40,7 @@
 <p>
           </p>
 <a name="range.reference.algorithms.new.remove_erase_if.description"></a><h6>
-<a name="id758361"></a>
+<a name="id750434"></a>
             <a class="link" href="remove_erase_if.html#range.reference.algorithms.new.remove_erase_if.description">Description</a>
           </h6>
 <p>
@@ -51,14 +51,14 @@
             algorithm which merely rearranges elements.
           </p>
 <a name="range.reference.algorithms.new.remove_erase_if.definition"></a><h6>
-<a name="id758441"></a>
+<a name="id750514"></a>
             <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="id758512"></a>
+<a name="id750585"></a>
             <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">
@@ -72,7 +72,7 @@
               </li>
 </ol></div>
 <a name="range.reference.algorithms.new.remove_erase_if.complexity"></a><h6>
-<a name="id758586"></a>
+<a name="id750659"></a>
             <a class="link" href="remove_erase_if.html#range.reference.algorithms.new.remove_erase_if.complexity">Complexity</a>
           </h6>
 <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 b4e1ec3..d8489ad 100644
--- a/doc/html/range/reference/algorithms/non_mutating/adjacent_find.html
+++ b/doc/html/range/reference/algorithms/non_mutating/adjacent_find.html
@@ -27,7 +27,7 @@
 <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="id719114"></a>
+<a name="id711185"></a>
             <a class="link" href="adjacent_find.html#range.reference.algorithms.non_mutating.adjacent_find.prototype">Prototype</a>
           </h6>
 <p>
@@ -76,7 +76,7 @@
 <p>
           </p>
 <a name="range.reference.algorithms.non_mutating.adjacent_find.description"></a><h6>
-<a name="id720090"></a>
+<a name="id712162"></a>
             <a class="link" href="adjacent_find.html#range.reference.algorithms.non_mutating.adjacent_find.description">Description</a>
           </h6>
 <p>
@@ -97,14 +97,14 @@
             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="id720298"></a>
+<a name="id712369"></a>
             <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="id720368"></a>
+<a name="id712440"></a>
             <a class="link" href="adjacent_find.html#range.reference.algorithms.non_mutating.adjacent_find.requirements">Requirements</a>
           </h6>
 <p>
@@ -142,7 +142,7 @@
               </li>
 </ul></div>
 <a name="range.reference.algorithms.non_mutating.adjacent_find.complexity"></a><h6>
-<a name="id720558"></a>
+<a name="id712629"></a>
             <a class="link" href="adjacent_find.html#range.reference.algorithms.non_mutating.adjacent_find.complexity">Complexity</a>
           </h6>
 <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 b48a47e..2429e96 100644
--- a/doc/html/range/reference/algorithms/non_mutating/binary_search.html
+++ b/doc/html/range/reference/algorithms/non_mutating/binary_search.html
@@ -27,7 +27,7 @@
 <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="id720658"></a>
+<a name="id712729"></a>
             <a class="link" href="binary_search.html#range.reference.algorithms.non_mutating.binary_search.prototype">Prototype</a>
           </h6>
 <p>
@@ -42,7 +42,7 @@
 <p>
           </p>
 <a name="range.reference.algorithms.non_mutating.binary_search.description"></a><h6>
-<a name="id720934"></a>
+<a name="id713006"></a>
             <a class="link" href="binary_search.html#range.reference.algorithms.non_mutating.binary_search.description">Description</a>
           </h6>
 <p>
@@ -52,14 +52,14 @@
             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="id721000"></a>
+<a name="id713072"></a>
             <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="id721071"></a>
+<a name="id713142"></a>
             <a class="link" href="binary_search.html#range.reference.algorithms.non_mutating.binary_search.requirements">Requirements</a>
           </h6>
 <p>
@@ -110,7 +110,7 @@
               </li>
 </ul></div>
 <a name="range.reference.algorithms.non_mutating.binary_search.precondition_"></a><h6>
-<a name="id721340"></a>
+<a name="id713411"></a>
             <a class="link" href="binary_search.html#range.reference.algorithms.non_mutating.binary_search.precondition_">Precondition:</a>
           </h6>
 <p>
@@ -128,7 +128,7 @@
             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="id721432"></a>
+<a name="id713503"></a>
             <a class="link" href="binary_search.html#range.reference.algorithms.non_mutating.binary_search.complexity">Complexity</a>
           </h6>
 <p>
diff --git a/doc/html/range/reference/algorithms/non_mutating/count.html b/doc/html/range/reference/algorithms/non_mutating/count.html
index 75b364e..9ce79d3 100644
--- a/doc/html/range/reference/algorithms/non_mutating/count.html
+++ b/doc/html/range/reference/algorithms/non_mutating/count.html
@@ -27,7 +27,7 @@
 <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="id721595"></a>
+<a name="id713666"></a>
             <a class="link" href="count.html#range.reference.algorithms.non_mutating.count.prototype">Prototype</a>
           </h6>
 <p>
@@ -44,7 +44,7 @@
 <p>
           </p>
 <a name="range.reference.algorithms.non_mutating.count.description"></a><h6>
-<a name="id721889"></a>
+<a name="id713960"></a>
             <a class="link" href="count.html#range.reference.algorithms.non_mutating.count.description">Description</a>
           </h6>
 <p>
@@ -54,14 +54,14 @@
             is <code class="computeroutput"><span class="keyword">true</span></code>.
           </p>
 <a name="range.reference.algorithms.non_mutating.count.definition"></a><h6>
-<a name="id721977"></a>
+<a name="id714048"></a>
             <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="id722047"></a>
+<a name="id714118"></a>
             <a class="link" href="count.html#range.reference.algorithms.non_mutating.count.requirements">Requirements</a>
           </h6>
 <div class="itemizedlist"><ul class="itemizedlist" type="disc">
@@ -84,7 +84,7 @@
               </li>
 </ul></div>
 <a name="range.reference.algorithms.non_mutating.count.complexity"></a><h6>
-<a name="id722179"></a>
+<a name="id714250"></a>
             <a class="link" href="count.html#range.reference.algorithms.non_mutating.count.complexity">Complexity</a>
           </h6>
 <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 b50203b..09b3f05 100644
--- a/doc/html/range/reference/algorithms/non_mutating/count_if.html
+++ b/doc/html/range/reference/algorithms/non_mutating/count_if.html
@@ -27,7 +27,7 @@
 <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="id722244"></a>
+<a name="id714315"></a>
             <a class="link" href="count_if.html#range.reference.algorithms.non_mutating.count_if.prototype">Prototype</a>
           </h6>
 <p>
@@ -40,7 +40,7 @@
 <p>
           </p>
 <a name="range.reference.algorithms.non_mutating.count_if.description"></a><h6>
-<a name="id722401"></a>
+<a name="id714472"></a>
             <a class="link" href="count_if.html#range.reference.algorithms.non_mutating.count_if.description">Description</a>
           </h6>
 <p>
@@ -50,14 +50,14 @@
             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="id722491"></a>
+<a name="id714562"></a>
             <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="id722560"></a>
+<a name="id714631"></a>
             <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">
@@ -80,7 +80,7 @@
               </li>
 </ul></div>
 <a name="range.reference.algorithms.non_mutating.count_if.complexity"></a><h6>
-<a name="id722692"></a>
+<a name="id714763"></a>
             <a class="link" href="count_if.html#range.reference.algorithms.non_mutating.count_if.complexity">Complexity</a>
           </h6>
 <p>
diff --git a/doc/html/range/reference/algorithms/non_mutating/equal.html b/doc/html/range/reference/algorithms/non_mutating/equal.html
index d70859b..5b555bb 100644
--- a/doc/html/range/reference/algorithms/non_mutating/equal.html
+++ b/doc/html/range/reference/algorithms/non_mutating/equal.html
@@ -27,7 +27,7 @@
 <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="id722767"></a>
+<a name="id714837"></a>
             <a class="link" href="equal.html#range.reference.algorithms.non_mutating.equal.prototype">Prototype</a>
           </h6>
 <p>
@@ -52,7 +52,7 @@
 <p>
           </p>
 <a name="range.reference.algorithms.non_mutating.equal.description"></a><h6>
-<a name="id723049"></a>
+<a name="id715120"></a>
             <a class="link" href="equal.html#range.reference.algorithms.non_mutating.equal.description">Description</a>
           </h6>
 <p>
@@ -70,14 +70,14 @@
             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="id723283"></a>
+<a name="id715354"></a>
             <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="id723353"></a>
+<a name="id715424"></a>
             <a class="link" href="equal.html#range.reference.algorithms.non_mutating.equal.requirements">Requirements</a>
           </h6>
 <p>
@@ -138,7 +138,7 @@
               </li>
 </ul></div>
 <a name="range.reference.algorithms.non_mutating.equal.complexity"></a><h6>
-<a name="id723663"></a>
+<a name="id715734"></a>
             <a class="link" href="equal.html#range.reference.algorithms.non_mutating.equal.complexity">Complexity</a>
           </h6>
 <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 0594865..bc8ceb3 100644
--- a/doc/html/range/reference/algorithms/non_mutating/equal_range.html
+++ b/doc/html/range/reference/algorithms/non_mutating/equal_range.html
@@ -27,7 +27,7 @@
 <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="id723754"></a>
+<a name="id715826"></a>
             <a class="link" href="equal_range.html#range.reference.algorithms.non_mutating.equal_range.prototype">Prototype</a>
           </h6>
 <p>
@@ -70,7 +70,7 @@
 <p>
           </p>
 <a name="range.reference.algorithms.non_mutating.equal_range.description"></a><h6>
-<a name="id724626"></a>
+<a name="id716698"></a>
             <a class="link" href="equal_range.html#range.reference.algorithms.non_mutating.equal_range.description">Description</a>
           </h6>
 <p>
@@ -84,14 +84,14 @@
             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="id724769"></a>
+<a name="id716841"></a>
             <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="id724839"></a>
+<a name="id716911"></a>
             <a class="link" href="equal_range.html#range.reference.algorithms.non_mutating.equal_range.requirements">Requirements</a>
           </h6>
 <p>
@@ -142,7 +142,7 @@
               </li>
 </ul></div>
 <a name="range.reference.algorithms.non_mutating.equal_range.precondition_"></a><h6>
-<a name="id725107"></a>
+<a name="id717180"></a>
             <a class="link" href="equal_range.html#range.reference.algorithms.non_mutating.equal_range.precondition_">Precondition:</a>
           </h6>
 <p>
@@ -154,7 +154,7 @@
             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="id725182"></a>
+<a name="id717254"></a>
             <a class="link" href="equal_range.html#range.reference.algorithms.non_mutating.equal_range.complexity">Complexity</a>
           </h6>
 <p>
diff --git a/doc/html/range/reference/algorithms/non_mutating/find.html b/doc/html/range/reference/algorithms/non_mutating/find.html
index 76086a8..0cdb415 100644
--- a/doc/html/range/reference/algorithms/non_mutating/find.html
+++ b/doc/html/range/reference/algorithms/non_mutating/find.html
@@ -27,7 +27,7 @@
 <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="id725845"></a>
+<a name="id717917"></a>
             <a class="link" href="find.html#range.reference.algorithms.non_mutating.find.prototype">Prototype</a>
           </h6>
 <p>
@@ -48,7 +48,7 @@
 <p>
           </p>
 <a name="range.reference.algorithms.non_mutating.find.description"></a><h6>
-<a name="id726134"></a>
+<a name="id718205"></a>
             <a class="link" href="find.html#range.reference.algorithms.non_mutating.find.description">Description</a>
           </h6>
 <p>
@@ -59,14 +59,14 @@
             same manner as the returned iterator described above.
           </p>
 <a name="range.reference.algorithms.non_mutating.find.definition"></a><h6>
-<a name="id726250"></a>
+<a name="id718322"></a>
             <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="id726320"></a>
+<a name="id718392"></a>
             <a class="link" href="find.html#range.reference.algorithms.non_mutating.find.requirements">Requirements</a>
           </h6>
 <div class="itemizedlist"><ul class="itemizedlist" type="disc">
@@ -87,7 +87,7 @@
               </li>
 </ul></div>
 <a name="range.reference.algorithms.non_mutating.find.complexity"></a><h6>
-<a name="id726439"></a>
+<a name="id718511"></a>
             <a class="link" href="find.html#range.reference.algorithms.non_mutating.find.complexity">Complexity</a>
           </h6>
 <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 95cb212..2381696 100644
--- a/doc/html/range/reference/algorithms/non_mutating/find_end.html
+++ b/doc/html/range/reference/algorithms/non_mutating/find_end.html
@@ -27,7 +27,7 @@
 <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="id726503"></a>
+<a name="id718575"></a>
             <a class="link" href="find_end.html#range.reference.algorithms.non_mutating.find_end.prototype">Prototype</a>
           </h6>
 <p>
@@ -65,7 +65,7 @@
 <p>
           </p>
 <a name="range.reference.algorithms.non_mutating.find_end.description"></a><h6>
-<a name="id727163"></a>
+<a name="id719235"></a>
             <a class="link" href="find_end.html#range.reference.algorithms.non_mutating.find_end.description">Description</a>
           </h6>
 <p>
@@ -80,14 +80,14 @@
             same manner as the returned iterator described above.
           </p>
 <a name="range.reference.algorithms.non_mutating.find_end.definition"></a><h6>
-<a name="id727287"></a>
+<a name="id719359"></a>
             <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="id727358"></a>
+<a name="id719430"></a>
             <a class="link" href="find_end.html#range.reference.algorithms.non_mutating.find_end.requirements">Requirements</a>
           </h6>
 <p>
@@ -147,7 +147,7 @@
               </li>
 </ul></div>
 <a name="range.reference.algorithms.non_mutating.find_end.complexity"></a><h6>
-<a name="id727670"></a>
+<a name="id719742"></a>
             <a class="link" href="find_end.html#range.reference.algorithms.non_mutating.find_end.complexity">Complexity</a>
           </h6>
 <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 2751651..6421a4d 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
@@ -27,7 +27,7 @@
 <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="id727840"></a>
+<a name="id719912"></a>
             <a class="link" href="find_first_of.html#range.reference.algorithms.non_mutating.find_first_of.prototype">Prototype</a>
           </h6>
 <p>
@@ -65,7 +65,7 @@
 <p>
           </p>
 <a name="range.reference.algorithms.non_mutating.find_first_of.description"></a><h6>
-<a name="id728499"></a>
+<a name="id720570"></a>
             <a class="link" href="find_first_of.html#range.reference.algorithms.non_mutating.find_first_of.description">Description</a>
           </h6>
 <p>
@@ -85,14 +85,14 @@
             same manner as the returned iterator described above.
           </p>
 <a name="range.reference.algorithms.non_mutating.find_first_of.definition"></a><h6>
-<a name="id728627"></a>
+<a name="id720699"></a>
             <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="id728699"></a>
+<a name="id720771"></a>
             <a class="link" href="find_first_of.html#range.reference.algorithms.non_mutating.find_first_of.requirements">Requirements</a>
           </h6>
 <p>
@@ -146,7 +146,7 @@
               </li>
 </ul></div>
 <a name="range.reference.algorithms.non_mutating.find_first_of.complexity"></a><h6>
-<a name="id728965"></a>
+<a name="id721037"></a>
             <a class="link" href="find_first_of.html#range.reference.algorithms.non_mutating.find_first_of.complexity">Complexity</a>
           </h6>
 <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 18d83c4..836b675 100644
--- a/doc/html/range/reference/algorithms/non_mutating/find_if.html
+++ b/doc/html/range/reference/algorithms/non_mutating/find_if.html
@@ -27,7 +27,7 @@
 <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="id729054"></a>
+<a name="id721127"></a>
             <a class="link" href="find_if.html#range.reference.algorithms.non_mutating.find_if.prototype">Prototype</a>
           </h6>
 <p>
@@ -48,7 +48,7 @@
 <p>
           </p>
 <a name="range.reference.algorithms.non_mutating.find_if.description"></a><h6>
-<a name="id729344"></a>
+<a name="id721417"></a>
             <a class="link" href="find_if.html#range.reference.algorithms.non_mutating.find_if.description">Description</a>
           </h6>
 <p>
@@ -63,14 +63,14 @@
             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="id729473"></a>
+<a name="id721545"></a>
             <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="id729544"></a>
+<a name="id721616"></a>
             <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">
@@ -89,7 +89,7 @@
               </li>
 </ul></div>
 <a name="range.reference.algorithms.non_mutating.find_if.precondition_"></a><h6>
-<a name="id729648"></a>
+<a name="id721721"></a>
             <a class="link" href="find_if.html#range.reference.algorithms.non_mutating.find_if.precondition_">Precondition:</a>
           </h6>
 <p>
@@ -97,7 +97,7 @@
             <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="id729718"></a>
+<a name="id721791"></a>
             <a class="link" href="find_if.html#range.reference.algorithms.non_mutating.find_if.complexity">Complexity</a>
           </h6>
 <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 b7f8384..daa7ec1 100644
--- a/doc/html/range/reference/algorithms/non_mutating/for_each.html
+++ b/doc/html/range/reference/algorithms/non_mutating/for_each.html
@@ -27,7 +27,7 @@
 <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="id725276"></a>
+<a name="id717348"></a>
             <a class="link" href="for_each.html#range.reference.algorithms.non_mutating.for_each.prototype">Prototype</a>
           </h6>
 <p>
@@ -48,7 +48,7 @@
 <p>
           </p>
 <a name="range.reference.algorithms.non_mutating.for_each.description"></a><h6>
-<a name="id725500"></a>
+<a name="id717573"></a>
             <a class="link" href="for_each.html#range.reference.algorithms.non_mutating.for_each.description">Description</a>
           </h6>
 <p>
@@ -58,14 +58,14 @@
             <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="id725579"></a>
+<a name="id717651"></a>
             <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="id725650"></a>
+<a name="id717722"></a>
             <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">
@@ -89,7 +89,7 @@
               </li>
 </ul></div>
 <a name="range.reference.algorithms.non_mutating.for_each.complexity"></a><h6>
-<a name="id725772"></a>
+<a name="id717844"></a>
             <a class="link" href="for_each.html#range.reference.algorithms.non_mutating.for_each.complexity">Complexity</a>
           </h6>
 <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 25ace1b..704296a 100644
--- a/doc/html/range/reference/algorithms/non_mutating/lexicographical_compare.html
+++ b/doc/html/range/reference/algorithms/non_mutating/lexicographical_compare.html
@@ -27,7 +27,7 @@
 <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="id729795"></a>
+<a name="id721867"></a>
             <a class="link" href="lexicographical_compare.html#range.reference.algorithms.non_mutating.lexicographical_compare.prototype">Prototype</a>
           </h6>
 <p>
@@ -52,7 +52,7 @@
 <p>
           </p>
 <a name="range.reference.algorithms.non_mutating.lexicographical_compare.description"></a><h6>
-<a name="id730077"></a>
+<a name="id722150"></a>
             <a class="link" href="lexicographical_compare.html#range.reference.algorithms.non_mutating.lexicographical_compare.description">Description</a>
           </h6>
 <p>
@@ -72,14 +72,14 @@
             predicate versions.
           </p>
 <a name="range.reference.algorithms.non_mutating.lexicographical_compare.definition"></a><h6>
-<a name="id730245"></a>
+<a name="id722318"></a>
             <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="id730316"></a>
+<a name="id722389"></a>
             <a class="link" href="lexicographical_compare.html#range.reference.algorithms.non_mutating.lexicographical_compare.requirements">Requirements</a>
           </h6>
 <p>
@@ -144,7 +144,7 @@
               </li>
 </ul></div>
 <a name="range.reference.algorithms.non_mutating.lexicographical_compare.complexity"></a><h6>
-<a name="id730692"></a>
+<a name="id722764"></a>
             <a class="link" href="lexicographical_compare.html#range.reference.algorithms.non_mutating.lexicographical_compare.complexity">Complexity</a>
           </h6>
 <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 b4419b1..b74ddd7 100644
--- a/doc/html/range/reference/algorithms/non_mutating/lower_bound.html
+++ b/doc/html/range/reference/algorithms/non_mutating/lower_bound.html
@@ -27,7 +27,7 @@
 <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="id730796"></a>
+<a name="id722868"></a>
             <a class="link" href="lower_bound.html#range.reference.algorithms.non_mutating.lower_bound.prototype">Prototype</a>
           </h6>
 <p>
@@ -48,7 +48,7 @@
 <p>
           </p>
 <a name="range.reference.algorithms.non_mutating.lower_bound.description"></a><h6>
-<a name="id731085"></a>
+<a name="id723158"></a>
             <a class="link" href="lower_bound.html#range.reference.algorithms.non_mutating.lower_bound.description">Description</a>
           </h6>
 <p>
@@ -71,14 +71,14 @@
             same manner as the returned iterator described above.
           </p>
 <a name="range.reference.algorithms.non_mutating.lower_bound.definition"></a><h6>
-<a name="id731275"></a>
+<a name="id723347"></a>
             <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="id731346"></a>
+<a name="id723418"></a>
             <a class="link" href="lower_bound.html#range.reference.algorithms.non_mutating.lower_bound.requirements">Requirements</a>
           </h6>
 <p>
@@ -129,7 +129,7 @@
               </li>
 </ul></div>
 <a name="range.reference.algorithms.non_mutating.lower_bound.precondition_"></a><h6>
-<a name="id731615"></a>
+<a name="id723687"></a>
             <a class="link" href="lower_bound.html#range.reference.algorithms.non_mutating.lower_bound.precondition_">Precondition:</a>
           </h6>
 <p>
@@ -147,7 +147,7 @@
             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="id731707"></a>
+<a name="id723780"></a>
             <a class="link" href="lower_bound.html#range.reference.algorithms.non_mutating.lower_bound.complexity">Complexity</a>
           </h6>
 <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 7202da9..52f7c53 100644
--- a/doc/html/range/reference/algorithms/non_mutating/max_element.html
+++ b/doc/html/range/reference/algorithms/non_mutating/max_element.html
@@ -27,7 +27,7 @@
 <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="id731847"></a>
+<a name="id723919"></a>
             <a class="link" href="max_element.html#range.reference.algorithms.non_mutating.max_element.prototype">Prototype</a>
           </h6>
 <p>
@@ -83,7 +83,7 @@
 <p>
           </p>
 <a name="range.reference.algorithms.non_mutating.max_element.description"></a><h6>
-<a name="id732833"></a>
+<a name="id724905"></a>
             <a class="link" href="max_element.html#range.reference.algorithms.non_mutating.max_element.description">Description</a>
           </h6>
 <p>
@@ -97,14 +97,14 @@
             same manner as the returned iterator described above.
           </p>
 <a name="range.reference.algorithms.non_mutating.max_element.definition"></a><h6>
-<a name="id732927"></a>
+<a name="id725000"></a>
             <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="id732999"></a>
+<a name="id725071"></a>
             <a class="link" href="max_element.html#range.reference.algorithms.non_mutating.max_element.requirements">Requirements</a>
           </h6>
 <p>
@@ -141,7 +141,7 @@
               </li>
 </ul></div>
 <a name="range.reference.algorithms.non_mutating.max_element.complexity"></a><h6>
-<a name="id733176"></a>
+<a name="id725249"></a>
             <a class="link" href="max_element.html#range.reference.algorithms.non_mutating.max_element.complexity">Complexity</a>
           </h6>
 <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 50260c5..26cd301 100644
--- a/doc/html/range/reference/algorithms/non_mutating/min_element.html
+++ b/doc/html/range/reference/algorithms/non_mutating/min_element.html
@@ -27,7 +27,7 @@
 <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="id733276"></a>
+<a name="id725348"></a>
             <a class="link" href="min_element.html#range.reference.algorithms.non_mutating.min_element.prototype">Prototype</a>
           </h6>
 <p>
@@ -83,7 +83,7 @@
 <p>
           </p>
 <a name="range.reference.algorithms.non_mutating.min_element.description"></a><h6>
-<a name="id734263"></a>
+<a name="id726335"></a>
             <a class="link" href="min_element.html#range.reference.algorithms.non_mutating.min_element.description">Description</a>
           </h6>
 <p>
@@ -97,14 +97,14 @@
             same manner as the returned iterator described above.
           </p>
 <a name="range.reference.algorithms.non_mutating.min_element.definition"></a><h6>
-<a name="id734357"></a>
+<a name="id726429"></a>
             <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="id734428"></a>
+<a name="id726500"></a>
             <a class="link" href="min_element.html#range.reference.algorithms.non_mutating.min_element.requirements">Requirements</a>
           </h6>
 <p>
@@ -141,7 +141,7 @@
               </li>
 </ul></div>
 <a name="range.reference.algorithms.non_mutating.min_element.complexity"></a><h6>
-<a name="id734606"></a>
+<a name="id726678"></a>
             <a class="link" href="min_element.html#range.reference.algorithms.non_mutating.min_element.complexity">Complexity</a>
           </h6>
 <p>
diff --git a/doc/html/range/reference/algorithms/non_mutating/mismatch.html b/doc/html/range/reference/algorithms/non_mutating/mismatch.html
index 30f2acd..cbfad8a 100644
--- a/doc/html/range/reference/algorithms/non_mutating/mismatch.html
+++ b/doc/html/range/reference/algorithms/non_mutating/mismatch.html
@@ -27,7 +27,7 @@
 <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="id734705"></a>
+<a name="id726777"></a>
             <a class="link" href="mismatch.html#range.reference.algorithms.non_mutating.mismatch.prototype">Prototype</a>
           </h6>
 <p>
@@ -105,7 +105,7 @@
 <p>
           </p>
 <a name="range.reference.algorithms.non_mutating.mismatch.description"></a><h6>
-<a name="id736409"></a>
+<a name="id728481"></a>
             <a class="link" href="mismatch.html#range.reference.algorithms.non_mutating.mismatch.description">Description</a>
           </h6>
 <p>
@@ -117,14 +117,14 @@
             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="id736505"></a>
+<a name="id728578"></a>
             <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="id736576"></a>
+<a name="id728648"></a>
             <a class="link" href="mismatch.html#range.reference.algorithms.non_mutating.mismatch.requirements">Requirements</a>
           </h6>
 <p>
@@ -185,14 +185,14 @@
               </li>
 </ul></div>
 <a name="range.reference.algorithms.non_mutating.mismatch.precondition_"></a><h6>
-<a name="id736887"></a>
+<a name="id728960"></a>
             <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="id736960"></a>
+<a name="id729032"></a>
             <a class="link" href="mismatch.html#range.reference.algorithms.non_mutating.mismatch.complexity">Complexity</a>
           </h6>
 <p>
diff --git a/doc/html/range/reference/algorithms/non_mutating/search.html b/doc/html/range/reference/algorithms/non_mutating/search.html
index 6e68396..427642b 100644
--- a/doc/html/range/reference/algorithms/non_mutating/search.html
+++ b/doc/html/range/reference/algorithms/non_mutating/search.html
@@ -27,7 +27,7 @@
 <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="id737024"></a>
+<a name="id729096"></a>
             <a class="link" href="search.html#range.reference.algorithms.non_mutating.search.prototype">Prototype</a>
           </h6>
 <p>
@@ -95,7 +95,7 @@
 <p>
           </p>
 <a name="range.reference.algorithms.non_mutating.search.description"></a><h6>
-<a name="id738362"></a>
+<a name="id730434"></a>
             <a class="link" href="search.html#range.reference.algorithms.non_mutating.search.description">Description</a>
           </h6>
 <p>
@@ -114,14 +114,14 @@
             same manner as the returned iterator described above.
           </p>
 <a name="range.reference.algorithms.non_mutating.search.definition"></a><h6>
-<a name="id738525"></a>
+<a name="id730597"></a>
             <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="id738596"></a>
+<a name="id730668"></a>
             <a class="link" href="search.html#range.reference.algorithms.non_mutating.search.requirements">Requirements</a>
           </h6>
 <p>
@@ -182,7 +182,7 @@
               </li>
 </ul></div>
 <a name="range.reference.algorithms.non_mutating.search.complexity"></a><h6>
-<a name="id738907"></a>
+<a name="id730979"></a>
             <a class="link" href="search.html#range.reference.algorithms.non_mutating.search.complexity">Complexity</a>
           </h6>
 <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 aa1e621..6bc149d 100644
--- a/doc/html/range/reference/algorithms/non_mutating/search_n.html
+++ b/doc/html/range/reference/algorithms/non_mutating/search_n.html
@@ -27,7 +27,7 @@
 <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="id738948"></a>
+<a name="id731020"></a>
             <a class="link" href="search_n.html#range.reference.algorithms.non_mutating.search_n.prototype">Prototype</a>
           </h6>
 <p>
@@ -54,7 +54,7 @@
 <p>
           </p>
 <a name="range.reference.algorithms.non_mutating.search_n.description"></a><h6>
-<a name="id739697"></a>
+<a name="id731769"></a>
             <a class="link" href="search_n.html#range.reference.algorithms.non_mutating.search_n.description">Description</a>
           </h6>
 <p>
@@ -63,14 +63,14 @@
             and by a predicate when one is supplied.
           </p>
 <a name="range.reference.algorithms.non_mutating.search_n.definition"></a><h6>
-<a name="id739763"></a>
+<a name="id731836"></a>
             <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="id739834"></a>
+<a name="id731906"></a>
             <a class="link" href="search_n.html#range.reference.algorithms.non_mutating.search_n.requirements">Requirements</a>
           </h6>
 <p>
@@ -124,7 +124,7 @@
               </li>
 </ul></div>
 <a name="range.reference.algorithms.non_mutating.search_n.complexity"></a><h6>
-<a name="id740123"></a>
+<a name="id732195"></a>
             <a class="link" href="search_n.html#range.reference.algorithms.non_mutating.search_n.complexity">Complexity</a>
           </h6>
 <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 6e75ef7..7c5b03e 100644
--- a/doc/html/range/reference/algorithms/non_mutating/upper_bound.html
+++ b/doc/html/range/reference/algorithms/non_mutating/upper_bound.html
@@ -27,7 +27,7 @@
 <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="id740164"></a>
+<a name="id732236"></a>
             <a class="link" href="upper_bound.html#range.reference.algorithms.non_mutating.upper_bound.prototype">Prototype</a>
           </h6>
 <p>
@@ -48,7 +48,7 @@
 <p>
           </p>
 <a name="range.reference.algorithms.non_mutating.upper_bound.description"></a><h6>
-<a name="id740453"></a>
+<a name="id732525"></a>
             <a class="link" href="upper_bound.html#range.reference.algorithms.non_mutating.upper_bound.description">Description</a>
           </h6>
 <p>
@@ -70,14 +70,14 @@
             same manner as the returned iterator described above.
           </p>
 <a name="range.reference.algorithms.non_mutating.upper_bound.definition"></a><h6>
-<a name="id740647"></a>
+<a name="id732719"></a>
             <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="id740718"></a>
+<a name="id732790"></a>
             <a class="link" href="upper_bound.html#range.reference.algorithms.non_mutating.upper_bound.requirements">Requirements</a>
           </h6>
 <p>
@@ -128,7 +128,7 @@
               </li>
 </ul></div>
 <a name="range.reference.algorithms.non_mutating.upper_bound.precondition_"></a><h6>
-<a name="id740986"></a>
+<a name="id733059"></a>
             <a class="link" href="upper_bound.html#range.reference.algorithms.non_mutating.upper_bound.precondition_">Precondition:</a>
           </h6>
 <p>
@@ -146,7 +146,7 @@
             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="id741078"></a>
+<a name="id733150"></a>
             <a class="link" href="upper_bound.html#range.reference.algorithms.non_mutating.upper_bound.complexity">Complexity</a>
           </h6>
 <p>
diff --git a/doc/html/range/reference/algorithms/numeric/accumulate.html b/doc/html/range/reference/algorithms/numeric/accumulate.html
index e3accc8..a98dc0f 100644
--- a/doc/html/range/reference/algorithms/numeric/accumulate.html
+++ b/doc/html/range/reference/algorithms/numeric/accumulate.html
@@ -27,7 +27,7 @@
 <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="id758668"></a>
+<a name="id750741"></a>
             <a class="link" href="accumulate.html#range.reference.algorithms.numeric.accumulate.prototype">Prototype</a>
           </h6>
 <p>
@@ -52,7 +52,7 @@
 <p>
           </p>
 <a name="range.reference.algorithms.numeric.accumulate.description"></a><h6>
-<a name="id758929"></a>
+<a name="id751002"></a>
             <a class="link" href="accumulate.html#range.reference.algorithms.numeric.accumulate.description">Description</a>
           </h6>
 <p>
@@ -63,18 +63,18 @@
             The return value is the resultant value of the above algorithm.
           </p>
 <a name="range.reference.algorithms.numeric.accumulate.definition"></a><h6>
-<a name="id759004"></a>
+<a name="id751077"></a>
             <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="id759066"></a>
+<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.for_the_first_version"></a><h6>
-<a name="id759087"></a>
+<a name="id751160"></a>
             <a class="link" href="accumulate.html#range.reference.algorithms.numeric.accumulate.for_the_first_version">For
             the first version</a>
           </h6>
@@ -99,7 +99,7 @@
               </li>
 </ol></div>
 <a name="range.reference.algorithms.numeric.accumulate.for_the_second_version"></a><h6>
-<a name="id759229"></a>
+<a name="id751302"></a>
             <a class="link" href="accumulate.html#range.reference.algorithms.numeric.accumulate.for_the_second_version">For
             the second version</a>
           </h6>
@@ -133,7 +133,7 @@
               </li>
 </ol></div>
 <a name="range.reference.algorithms.numeric.accumulate.complexity"></a><h6>
-<a name="id759422"></a>
+<a name="id751495"></a>
             <a class="link" href="accumulate.html#range.reference.algorithms.numeric.accumulate.complexity">Complexity</a>
           </h6>
 <p>
diff --git a/doc/html/range/reference/algorithms/numeric/adjacent_difference.html b/doc/html/range/reference/algorithms/numeric/adjacent_difference.html
index b5b3f49..c704d2a 100644
--- a/doc/html/range/reference/algorithms/numeric/adjacent_difference.html
+++ b/doc/html/range/reference/algorithms/numeric/adjacent_difference.html
@@ -27,7 +27,7 @@
 <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="id759487"></a>
+<a name="id751560"></a>
             <a class="link" href="adjacent_difference.html#range.reference.algorithms.numeric.adjacent_difference.prototype">Prototype</a>
           </h6>
 <p>
@@ -54,7 +54,7 @@
 <p>
           </p>
 <a name="range.reference.algorithms.numeric.adjacent_difference.description"></a><h6>
-<a name="id759751"></a>
+<a name="id751824"></a>
             <a class="link" href="adjacent_difference.html#range.reference.algorithms.numeric.adjacent_difference.description">Description</a>
           </h6>
 <p>
@@ -68,18 +68,18 @@
             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="id759852"></a>
+<a name="id751925"></a>
             <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="id759914"></a>
+<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.for_the_first_version"></a><h6>
-<a name="id759935"></a>
+<a name="id752008"></a>
             <a class="link" href="adjacent_difference.html#range.reference.algorithms.numeric.adjacent_difference.for_the_first_version">For
             the first version</a>
           </h6>
@@ -110,7 +110,7 @@
               </li>
 </ol></div>
 <a name="range.reference.algorithms.numeric.adjacent_difference.for_the_second_version"></a><h6>
-<a name="id760142"></a>
+<a name="id752216"></a>
             <a class="link" href="adjacent_difference.html#range.reference.algorithms.numeric.adjacent_difference.for_the_second_version">For
             the second version</a>
           </h6>
@@ -145,7 +145,7 @@
               </li>
 </ol></div>
 <a name="range.reference.algorithms.numeric.adjacent_difference.precondition_"></a><h6>
-<a name="id760336"></a>
+<a name="id752409"></a>
             <a class="link" href="adjacent_difference.html#range.reference.algorithms.numeric.adjacent_difference.precondition_">Precondition:</a>
           </h6>
 <p>
@@ -153,7 +153,7 @@
             <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="id760410"></a>
+<a name="id752483"></a>
             <a class="link" href="adjacent_difference.html#range.reference.algorithms.numeric.adjacent_difference.complexity">Complexity</a>
           </h6>
 <p>
diff --git a/doc/html/range/reference/algorithms/numeric/inner_product.html b/doc/html/range/reference/algorithms/numeric/inner_product.html
index 9567a89..bebd578 100644
--- a/doc/html/range/reference/algorithms/numeric/inner_product.html
+++ b/doc/html/range/reference/algorithms/numeric/inner_product.html
@@ -27,7 +27,7 @@
 <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="id760510"></a>
+<a name="id752584"></a>
             <a class="link" href="inner_product.html#range.reference.algorithms.numeric.inner_product.prototype">Prototype</a>
           </h6>
 <p>
@@ -53,7 +53,7 @@
 <p>
           </p>
 <a name="range.reference.algorithms.numeric.inner_product.description"></a><h6>
-<a name="id760873"></a>
+<a name="id752946"></a>
             <a class="link" href="inner_product.html#range.reference.algorithms.numeric.inner_product.description">Description</a>
           </h6>
 <p>
@@ -66,18 +66,18 @@
             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="id760949"></a>
+<a name="id753022"></a>
             <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="id761010"></a>
+<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.for_the_first_version"></a><h6>
-<a name="id761031"></a>
+<a name="id753104"></a>
             <a class="link" href="inner_product.html#range.reference.algorithms.numeric.inner_product.for_the_first_version">For
             the first version</a>
           </h6>
@@ -112,7 +112,7 @@
               </li>
 </ol></div>
 <a name="range.reference.algorithms.numeric.inner_product.for_the_second_version"></a><h6>
-<a name="id761288"></a>
+<a name="id753362"></a>
             <a class="link" href="inner_product.html#range.reference.algorithms.numeric.inner_product.for_the_second_version">For
             the second version</a>
           </h6>
@@ -161,14 +161,14 @@
               </li>
 </ol></div>
 <a name="range.reference.algorithms.numeric.inner_product.precondition_"></a><h6>
-<a name="id761589"></a>
+<a name="id753663"></a>
             <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="id761662"></a>
+<a name="id753736"></a>
             <a class="link" href="inner_product.html#range.reference.algorithms.numeric.inner_product.complexity">Complexity</a>
           </h6>
 <p>
diff --git a/doc/html/range/reference/algorithms/numeric/partial_sum.html b/doc/html/range/reference/algorithms/numeric/partial_sum.html
index 50fa44b..68accc1 100644
--- a/doc/html/range/reference/algorithms/numeric/partial_sum.html
+++ b/doc/html/range/reference/algorithms/numeric/partial_sum.html
@@ -27,7 +27,7 @@
 <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="id761728"></a>
+<a name="id753801"></a>
             <a class="link" href="partial_sum.html#range.reference.algorithms.numeric.partial_sum.prototype">Prototype</a>
           </h6>
 <p>
@@ -48,7 +48,7 @@
 <p>
           </p>
 <a name="range.reference.algorithms.numeric.partial_sum.description"></a><h6>
-<a name="id761985"></a>
+<a name="id754058"></a>
             <a class="link" href="partial_sum.html#range.reference.algorithms.numeric.partial_sum.description">Description</a>
           </h6>
 <p>
@@ -57,18 +57,18 @@
             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="id762125"></a>
+<a name="id754198"></a>
             <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="id762186"></a>
+<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.for_the_first_version"></a><h6>
-<a name="id762206"></a>
+<a name="id754280"></a>
             <a class="link" href="partial_sum.html#range.reference.algorithms.numeric.partial_sum.for_the_first_version">For
             the first version</a>
           </h6>
@@ -98,7 +98,7 @@
               </li>
 </ol></div>
 <a name="range.reference.algorithms.numeric.partial_sum.for_the_second_version"></a><h6>
-<a name="id762414"></a>
+<a name="id754487"></a>
             <a class="link" href="partial_sum.html#range.reference.algorithms.numeric.partial_sum.for_the_second_version">For
             the second version</a>
           </h6>
@@ -127,7 +127,7 @@
               </li>
 </ol></div>
 <a name="range.reference.algorithms.numeric.partial_sum.precondition_"></a><h6>
-<a name="id762579"></a>
+<a name="id754652"></a>
             <a class="link" href="partial_sum.html#range.reference.algorithms.numeric.partial_sum.precondition_">Precondition:</a>
           </h6>
 <p>
@@ -135,7 +135,7 @@
             <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="id762652"></a>
+<a name="id754726"></a>
             <a class="link" href="partial_sum.html#range.reference.algorithms.numeric.partial_sum.complexity">Complexity</a>
           </h6>
 <p>
diff --git a/doc/html/range/reference/algorithms/permutation/next_permutation.html b/doc/html/range/reference/algorithms/permutation/next_permutation.html
index 78626e7..1f30391 100644
--- a/doc/html/range/reference/algorithms/permutation/next_permutation.html
+++ b/doc/html/range/reference/algorithms/permutation/next_permutation.html
@@ -27,7 +27,7 @@
 <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="id750959"></a>
+<a name="id743032"></a>
             <a class="link" href="next_permutation.html#range.reference.algorithms.permutation.next_permutation.prototype">Prototype</a>
           </h6>
 <p>
@@ -48,7 +48,7 @@
 <p>
           </p>
 <a name="range.reference.algorithms.permutation.next_permutation.description"></a><h6>
-<a name="id751305"></a>
+<a name="id743378"></a>
             <a class="link" href="next_permutation.html#range.reference.algorithms.permutation.next_permutation.description">Description</a>
           </h6>
 <p>
@@ -66,14 +66,14 @@
             the predicate versions.
           </p>
 <a name="range.reference.algorithms.permutation.next_permutation.definition"></a><h6>
-<a name="id751404"></a>
+<a name="id743477"></a>
             <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="id751475"></a>
+<a name="id743548"></a>
             <a class="link" href="next_permutation.html#range.reference.algorithms.permutation.next_permutation.requirements">Requirements</a>
           </h6>
 <p>
@@ -124,7 +124,7 @@
               </li>
 </ul></div>
 <a name="range.reference.algorithms.permutation.next_permutation.complexity"></a><h6>
-<a name="id751723"></a>
+<a name="id743796"></a>
             <a class="link" href="next_permutation.html#range.reference.algorithms.permutation.next_permutation.complexity">Complexity</a>
           </h6>
 <p>
diff --git a/doc/html/range/reference/algorithms/permutation/prev_permutation.html b/doc/html/range/reference/algorithms/permutation/prev_permutation.html
index c87dadb..c43900a 100644
--- a/doc/html/range/reference/algorithms/permutation/prev_permutation.html
+++ b/doc/html/range/reference/algorithms/permutation/prev_permutation.html
@@ -27,7 +27,7 @@
 <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="id751799"></a>
+<a name="id743872"></a>
             <a class="link" href="prev_permutation.html#range.reference.algorithms.permutation.prev_permutation.prototype">Prototype</a>
           </h6>
 <p>
@@ -48,7 +48,7 @@
 <p>
           </p>
 <a name="range.reference.algorithms.permutation.prev_permutation.description"></a><h6>
-<a name="id752146"></a>
+<a name="id744218"></a>
             <a class="link" href="prev_permutation.html#range.reference.algorithms.permutation.prev_permutation.description">Description</a>
           </h6>
 <p>
@@ -66,14 +66,14 @@
             the predicate versions.
           </p>
 <a name="range.reference.algorithms.permutation.prev_permutation.definition"></a><h6>
-<a name="id752245"></a>
+<a name="id744318"></a>
             <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="id752316"></a>
+<a name="id744389"></a>
             <a class="link" href="prev_permutation.html#range.reference.algorithms.permutation.prev_permutation.requirements">Requirements</a>
           </h6>
 <p>
@@ -124,7 +124,7 @@
               </li>
 </ul></div>
 <a name="range.reference.algorithms.permutation.prev_permutation.complexity"></a><h6>
-<a name="id752565"></a>
+<a name="id744638"></a>
             <a class="link" href="prev_permutation.html#range.reference.algorithms.permutation.prev_permutation.complexity">Complexity</a>
           </h6>
 <p>
diff --git a/doc/html/range/reference/algorithms/set/includes.html b/doc/html/range/reference/algorithms/set/includes.html
index 9090779..9baedb3 100644
--- a/doc/html/range/reference/algorithms/set/includes.html
+++ b/doc/html/range/reference/algorithms/set/includes.html
@@ -27,7 +27,7 @@
 <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="id741228"></a>
+<a name="id733300"></a>
             <a class="link" href="includes.html#range.reference.algorithms.set.includes.prototype">Prototype</a>
           </h6>
 <p>
@@ -47,7 +47,7 @@
 <p>
           </p>
 <a name="range.reference.algorithms.set.includes.description"></a><h6>
-<a name="id741508"></a>
+<a name="id733580"></a>
             <a class="link" href="includes.html#range.reference.algorithms.set.includes.description">Description</a>
           </h6>
 <p>
@@ -59,14 +59,14 @@
             the predicate versions.
           </p>
 <a name="range.reference.algorithms.set.includes.definition"></a><h6>
-<a name="id741601"></a>
+<a name="id733674"></a>
             <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="id741671"></a>
+<a name="id733743"></a>
             <a class="link" href="includes.html#range.reference.algorithms.set.includes.requirements">Requirements</a>
           </h6>
 <p>
@@ -144,7 +144,7 @@
               </li>
 </ul></div>
 <a name="range.reference.algorithms.set.includes.precondition_"></a><h6>
-<a name="id742080"></a>
+<a name="id734152"></a>
             <a class="link" href="includes.html#range.reference.algorithms.set.includes.precondition_">Precondition:</a>
           </h6>
 <p>
@@ -162,7 +162,7 @@
             according to <code class="computeroutput"><span class="identifier">pred</span></code>.
           </p>
 <a name="range.reference.algorithms.set.includes.complexity"></a><h6>
-<a name="id742194"></a>
+<a name="id734266"></a>
             <a class="link" href="includes.html#range.reference.algorithms.set.includes.complexity">Complexity</a>
           </h6>
 <p>
diff --git a/doc/html/range/reference/algorithms/set/set_difference.html b/doc/html/range/reference/algorithms/set/set_difference.html
index 6aa68d8..7712445 100644
--- a/doc/html/range/reference/algorithms/set/set_difference.html
+++ b/doc/html/range/reference/algorithms/set/set_difference.html
@@ -27,7 +27,7 @@
 <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="id744721"></a>
+<a name="id736793"></a>
             <a class="link" href="set_difference.html#range.reference.algorithms.set.set_difference.prototype">Prototype</a>
           </h6>
 <p>
@@ -56,7 +56,7 @@
 <p>
           </p>
 <a name="range.reference.algorithms.set.set_difference.description"></a><h6>
-<a name="id745067"></a>
+<a name="id737139"></a>
             <a class="link" href="set_difference.html#range.reference.algorithms.set.set_difference.description">Description</a>
           </h6>
 <p>
@@ -70,14 +70,14 @@
             the predicate versions.
           </p>
 <a name="range.reference.algorithms.set.set_difference.definition"></a><h6>
-<a name="id745154"></a>
+<a name="id737226"></a>
             <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="id745225"></a>
+<a name="id737297"></a>
             <a class="link" href="set_difference.html#range.reference.algorithms.set.set_difference.requirements">Requirements</a>
           </h6>
 <p>
@@ -163,7 +163,7 @@
               </li>
 </ul></div>
 <a name="range.reference.algorithms.set.set_difference.precondition_"></a><h6>
-<a name="id745690"></a>
+<a name="id737763"></a>
             <a class="link" href="set_difference.html#range.reference.algorithms.set.set_difference.precondition_">Precondition:</a>
           </h6>
 <p>
@@ -181,7 +181,7 @@
             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="id745805"></a>
+<a name="id737877"></a>
             <a class="link" href="set_difference.html#range.reference.algorithms.set.set_difference.complexity">Complexity</a>
           </h6>
 <p>
diff --git a/doc/html/range/reference/algorithms/set/set_intersection.html b/doc/html/range/reference/algorithms/set/set_intersection.html
index 0c4705e..1a2040d 100644
--- a/doc/html/range/reference/algorithms/set/set_intersection.html
+++ b/doc/html/range/reference/algorithms/set/set_intersection.html
@@ -27,7 +27,7 @@
 <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="id743516"></a>
+<a name="id735588"></a>
             <a class="link" href="set_intersection.html#range.reference.algorithms.set.set_intersection.prototype">Prototype</a>
           </h6>
 <p>
@@ -56,7 +56,7 @@
 <p>
           </p>
 <a name="range.reference.algorithms.set.set_intersection.description"></a><h6>
-<a name="id743862"></a>
+<a name="id735934"></a>
             <a class="link" href="set_intersection.html#range.reference.algorithms.set.set_intersection.description">Description</a>
           </h6>
 <p>
@@ -70,14 +70,14 @@
             the predicate versions.
           </p>
 <a name="range.reference.algorithms.set.set_intersection.definition"></a><h6>
-<a name="id743949"></a>
+<a name="id736021"></a>
             <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="id744019"></a>
+<a name="id736091"></a>
             <a class="link" href="set_intersection.html#range.reference.algorithms.set.set_intersection.requirements">Requirements</a>
           </h6>
 <p>
@@ -163,7 +163,7 @@
               </li>
 </ul></div>
 <a name="range.reference.algorithms.set.set_intersection.precondition_"></a><h6>
-<a name="id744484"></a>
+<a name="id736557"></a>
             <a class="link" href="set_intersection.html#range.reference.algorithms.set.set_intersection.precondition_">Precondition:</a>
           </h6>
 <p>
@@ -181,7 +181,7 @@
             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="id744599"></a>
+<a name="id736671"></a>
             <a class="link" href="set_intersection.html#range.reference.algorithms.set.set_intersection.complexity">Complexity</a>
           </h6>
 <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 aab6c38..215facc 100644
--- a/doc/html/range/reference/algorithms/set/set_symmetric_difference.html
+++ b/doc/html/range/reference/algorithms/set/set_symmetric_difference.html
@@ -27,7 +27,7 @@
 <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="id745928"></a>
+<a name="id738000"></a>
             <a class="link" href="set_symmetric_difference.html#range.reference.algorithms.set.set_symmetric_difference.prototype">Prototype</a>
           </h6>
 <p>
@@ -58,7 +58,7 @@
 <p>
           </p>
 <a name="range.reference.algorithms.set.set_symmetric_difference.description"></a><h6>
-<a name="id746274"></a>
+<a name="id738347"></a>
             <a class="link" href="set_symmetric_difference.html#range.reference.algorithms.set.set_symmetric_difference.description">Description</a>
           </h6>
 <p>
@@ -74,14 +74,14 @@
             the predicate versions.
           </p>
 <a name="range.reference.algorithms.set.set_symmetric_difference.definition"></a><h6>
-<a name="id746362"></a>
+<a name="id738434"></a>
             <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="id746432"></a>
+<a name="id738504"></a>
             <a class="link" href="set_symmetric_difference.html#range.reference.algorithms.set.set_symmetric_difference.requirements">Requirements</a>
           </h6>
 <p>
@@ -167,7 +167,7 @@
               </li>
 </ul></div>
 <a name="range.reference.algorithms.set.set_symmetric_difference.precondition_"></a><h6>
-<a name="id746896"></a>
+<a name="id738968"></a>
             <a class="link" href="set_symmetric_difference.html#range.reference.algorithms.set.set_symmetric_difference.precondition_">Precondition:</a>
           </h6>
 <p>
@@ -185,7 +185,7 @@
             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="id747010"></a>
+<a name="id739082"></a>
             <a class="link" href="set_symmetric_difference.html#range.reference.algorithms.set.set_symmetric_difference.complexity">Complexity</a>
           </h6>
 <p>
diff --git a/doc/html/range/reference/algorithms/set/set_union.html b/doc/html/range/reference/algorithms/set/set_union.html
index f89ab11..5dc5176 100644
--- a/doc/html/range/reference/algorithms/set/set_union.html
+++ b/doc/html/range/reference/algorithms/set/set_union.html
@@ -27,7 +27,7 @@
 <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="id742315"></a>
+<a name="id734387"></a>
             <a class="link" href="set_union.html#range.reference.algorithms.set.set_union.prototype">Prototype</a>
           </h6>
 <p>
@@ -56,7 +56,7 @@
 <p>
           </p>
 <a name="range.reference.algorithms.set.set_union.description"></a><h6>
-<a name="id742661"></a>
+<a name="id734733"></a>
             <a class="link" href="set_union.html#range.reference.algorithms.set.set_union.description">Description</a>
           </h6>
 <p>
@@ -69,14 +69,14 @@
             in the predicate versions.
           </p>
 <a name="range.reference.algorithms.set.set_union.definition"></a><h6>
-<a name="id742744"></a>
+<a name="id734816"></a>
             <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="id742815"></a>
+<a name="id734887"></a>
             <a class="link" href="set_union.html#range.reference.algorithms.set.set_union.requirements">Requirements</a>
           </h6>
 <p>
@@ -162,7 +162,7 @@
               </li>
 </ul></div>
 <a name="range.reference.algorithms.set.set_union.precondition_"></a><h6>
-<a name="id743280"></a>
+<a name="id735352"></a>
             <a class="link" href="set_union.html#range.reference.algorithms.set.set_union.precondition_">Precondition:</a>
           </h6>
 <p>
@@ -180,7 +180,7 @@
             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="id743392"></a>
+<a name="id735465"></a>
             <a class="link" href="set_union.html#range.reference.algorithms.set.set_union.complexity">Complexity</a>
           </h6>
 <p>
diff --git a/doc/html/range/reference/concept_implementation/semantics.html b/doc/html/range/reference/concept_implementation/semantics.html
index 10f57ad..0aed2fa 100644
--- a/doc/html/range/reference/concept_implementation/semantics.html
+++ b/doc/html/range/reference/concept_implementation/semantics.html
@@ -31,7 +31,7 @@
 <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="id665247"></a>
+<a name="id654700"></a>
           <a class="link" href="semantics.html#range.reference.concept_implementation.semantics.notation">notation</a>
         </h6>
 <div class="informaltable"><table class="table">
diff --git a/doc/html/range/reference/concept_implementation/semantics/functions.html b/doc/html/range/reference/concept_implementation/semantics/functions.html
index 318dec3..55f8a17 100644
--- a/doc/html/range/reference/concept_implementation/semantics/functions.html
+++ b/doc/html/range/reference/concept_implementation/semantics/functions.html
@@ -168,27 +168,10 @@
                   </td>
 <td>
                     <p>
-                      <code class="computeroutput"><span class="identifier">The</span> <span class="identifier">size</span>
-                      <span class="identifier">of</span> <span class="identifier">the</span>
-                      <span class="identifier">range</span> <span class="identifier">with</span>
-                      <span class="identifier">complexity</span> <span class="identifier">O</span><span class="special">(</span><span class="number">1</span><span class="special">).</span> <span class="identifier">For</span>
-                      <span class="identifier">RandomAccessRanges</span> <span class="keyword">this</span> <span class="identifier">is</span>
-                      <span class="identifier">achieved</span> <span class="identifier">via</span>
-                      <span class="identifier">boost</span><span class="special">::</span><span class="identifier">end</span><span class="special">(</span><span class="identifier">x</span><span class="special">)</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">x</span><span class="special">).</span> <span class="identifier">For</span>
-                      <span class="identifier">other</span> <span class="identifier">traversal</span>
-                      <span class="identifier">categories</span> <span class="identifier">range_calculate_size</span><span class="special">(</span><span class="identifier">x</span><span class="special">)</span> <span class="identifier">is</span>
-                      <span class="identifier">returned</span><span class="special">.</span>
-                      <span class="identifier">Note</span> <span class="identifier">that</span>
-                      <span class="identifier">unless</span> <span class="identifier">range_calculate_size</span><span class="special">(</span><span class="identifier">x</span><span class="special">)</span> <span class="identifier">has</span>
-                      <span class="identifier">been</span> <span class="identifier">implemented</span>
-                      <span class="identifier">by</span> <span class="identifier">the</span>
-                      <span class="identifier">user</span> <span class="identifier">as</span>
-                      <span class="identifier">an</span> <span class="identifier">extension</span>
-                      <span class="identifier">then</span> <span class="identifier">the</span>
-                      <span class="identifier">Argument</span> <span class="identifier">Dependent</span>
-                      <span class="identifier">Lookup</span> <span class="identifier">will</span>
-                      <span class="keyword">return</span> <span class="identifier">x</span><span class="special">.</span><span class="identifier">size</span><span class="special">()</span></code>
+                      <code class="computeroutput"><span class="identifier">range_calculate_size</span><span class="special">(</span><span class="identifier">x</span><span class="special">)</span></code> which by default is <code class="computeroutput"><span class="identifier">boost</span><span class="special">::</span><span class="identifier">end</span><span class="special">(</span><span class="identifier">x</span><span class="special">)</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">x</span><span class="special">)</span></code>. Users may supply alternative
+                      implementations by implementing <code class="computeroutput"><span class="identifier">range_calculate_size</span><span class="special">(</span><span class="identifier">x</span><span class="special">)</span></code> so that it will be found via
+                      ADL
                     </p>
                   </td>
 <td>
diff --git a/doc/html/range/reference/ranges.html b/doc/html/range/reference/ranges.html
index 7ebd43e..37919c5 100644
--- a/doc/html/range/reference/ranges.html
+++ b/doc/html/range/reference/ranges.html
@@ -7,7 +7,7 @@
 <link rel="home" href="../../index.html" title="Chapter&#160;1.&#160;Range 2.0">
 <link rel="up" href="../reference.html" title="Reference">
 <link rel="prev" href="algorithms/numeric/partial_sum.html" title="partial_sum">
-<link rel="next" href="ranges/counting_range.html" title="counting_range">
+<link rel="next" href="ranges/any_range.html" title="any_range">
 </head>
 <body bgcolor="white" text="black" link="#0000FF" vlink="#840084" alink="#0000FF">
 <table cellpadding="2" width="100%"><tr>
@@ -20,13 +20,14 @@
 </tr></table>
 <hr>
 <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/counting_range.html"><img src="../../../../../../doc/src/images/next.png" alt="Next"></a>
+<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="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>
 <div class="toc"><dl>
+<dt><span class="section"><a href="ranges/any_range.html">any_range</a></span></dt>
 <dt><span class="section"><a href="ranges/counting_range.html">counting_range</a></span></dt>
 <dt><span class="section"><a href="ranges/istream_range.html">istream_range</a></span></dt>
 <dt><span class="section"><a href="ranges/irange.html">irange</a></span></dt>
@@ -42,7 +43,7 @@
 </tr></table>
 <hr>
 <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/counting_range.html"><img src="../../../../../../doc/src/images/next.png" alt="Next"></a>
+<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>
 </body>
 </html>
diff --git a/doc/html/range/reference/ranges/any_range.html b/doc/html/range/reference/ranges/any_range.html
new file mode 100644
index 0000000..3659c9e
--- /dev/null
+++ b/doc/html/range/reference/ranges/any_range.html
@@ -0,0 +1,177 @@
+<html>
+<head>
+<meta http-equiv="Content-Type" content="text/html; charset=US-ASCII">
+<title>any_range</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="../ranges.html" title="Provided Ranges">
+<link rel="prev" href="../ranges.html" title="Provided Ranges">
+<link rel="next" href="counting_range.html" title="counting_range">
+</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="../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="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>
+<p>
+          <code class="computeroutput"><span class="identifier">any_range</span></code> is a range that
+          has the type information erased hence a <code class="computeroutput"><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_pass_traversal_tag</span><span class="special">,</span> <span class="keyword">int</span><span class="special">,</span>
+          <span class="identifier">std</span><span class="special">::</span><span class="identifier">ptrdiff_t</span><span class="special">&gt;</span></code>
+          can be used to represent a <code class="computeroutput"><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></code>, a <code class="computeroutput"><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></code> or many other types.
+        </p>
+<p>
+          The <a href="http://www.artima.com/cppsource/type_erasure.html" target="_top">type
+          erasure article</a> covers the motivation and goals of type erasure
+          in this context. Clearly my implementation is building upon a lot of prior
+          art created by others. Thomas Becker's <code class="computeroutput"><span class="identifier">any_iterator</span></code>
+          was a strong influence. Adobe also have an <code class="computeroutput"><span class="identifier">any_iterator</span></code>
+          implementation, but this has very tight coupling to other parts of the
+          library that precluded it from use in Boost.Range. Early development versions
+          of this Range Adaptor directly used Thomas Becker's any_iterator implementation.
+          Subsequently I discovered that the heap allocations of this and many other
+          implementations cause poor speed performance particularly at the tails
+          of the distribution. To solve this required a new design that incorporated
+          the embedded buffer optimization.
+        </p>
+<p>
+          Despite the underlying <code class="computeroutput"><span class="identifier">any_iterator</span></code>
+          being the fastest available implementation, the performance overhead of
+          <code class="computeroutput"><span class="identifier">any_range</span></code> is still appreciable
+          due to the cost of virtual function calls required to implement <code class="computeroutput"><span class="identifier">increment</span></code>, <code class="computeroutput"><span class="identifier">decrement</span></code>,
+          <code class="computeroutput"><span class="identifier">advance</span></code>, <code class="computeroutput"><span class="identifier">equal</span></code> etc. Frequently a better design
+          choice is to convert to a canonical form.
+        </p>
+<p>
+          Please see the <a class="link" href="../adaptors/reference/type_erased.html" title="type_erased">type_erased</a>
+          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>
+<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>
+  <span class="special">,</span> <span class="keyword">class</span> <span class="identifier">Traversal</span>
+  <span class="special">,</span> <span class="keyword">class</span> <span class="identifier">Reference</span>
+  <span class="special">,</span> <span class="keyword">class</span> <span class="identifier">Difference</span>
+  <span class="special">,</span> <span class="keyword">class</span> <span class="identifier">Buffer</span> <span class="special">=</span> <span class="identifier">any_iterator_default_buffer</span>
+<span class="special">&gt;</span>
+<span class="keyword">class</span> <span class="identifier">any_range</span>
+    <span class="special">:</span> <span class="keyword">public</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">any_iterator</span><span class="special">&lt;</span>
+            <span class="identifier">Value</span>
+          <span class="special">,</span> <span class="identifier">Traversal</span>
+          <span class="special">,</span> <span class="identifier">Reference</span>
+          <span class="special">,</span> <span class="identifier">Difference</span>
+          <span class="special">,</span> <span class="identifier">Buffer</span>
+        <span class="special">&gt;</span>
+    <span class="special">&gt;</span>
+<span class="special">{</span>
+    <span class="keyword">typedef</span> <span class="identifier">range_detail</span><span class="special">::</span><span class="identifier">any_iterator</span><span class="special">&lt;</span>
+        <span class="identifier">Value</span>
+      <span class="special">,</span> <span class="identifier">Traversal</span>
+      <span class="special">,</span> <span class="identifier">Reference</span>
+      <span class="special">,</span> <span class="identifier">Difference</span>
+      <span class="special">,</span> <span class="identifier">Buffer</span>
+    <span class="special">&gt;</span> <span class="identifier">any_iterator_type</span><span class="special">;</span>
+
+    <span class="keyword">typedef</span> <span class="identifier">iterator_range</span><span class="special">&lt;</span><span class="identifier">any_iterator_type</span><span class="special">&gt;</span> <span class="identifier">base_type</span><span class="special">;</span>
+
+    <span class="keyword">struct</span> <span class="identifier">enabler</span> <span class="special">{};</span>
+    <span class="keyword">struct</span> <span class="identifier">disabler</span> <span class="special">{};</span>
+<span class="keyword">public</span><span class="special">:</span>
+    <span class="keyword">typedef</span> <span class="identifier">any_iterator_type</span> <span class="identifier">iterator</span><span class="special">;</span>
+    <span class="keyword">typedef</span> <span class="identifier">any_iterator_type</span> <span class="identifier">const_iterator</span><span class="special">;</span>
+
+    <span class="identifier">any_range</span><span class="special">()</span>
+    <span class="special">{</span>
+    <span class="special">}</span>
+
+    <span class="identifier">any_range</span><span class="special">(</span><span class="keyword">const</span> <span class="identifier">any_range</span><span class="special">&amp;</span> <span class="identifier">other</span><span class="special">)</span>
+        <span class="special">:</span> <span class="identifier">base_type</span><span class="special">(</span><span class="identifier">other</span><span class="special">)</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">WrappedRange</span><span class="special">&gt;</span>
+    <span class="identifier">any_range</span><span class="special">(</span><span class="identifier">WrappedRange</span><span class="special">&amp;</span> <span class="identifier">wrapped_range</span><span class="special">)</span>
+    <span class="special">:</span> <span class="identifier">base_type</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">wrapped_range</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">wrapped_range</span><span class="special">))</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">WrappedRange</span><span class="special">&gt;</span>
+    <span class="identifier">any_range</span><span class="special">(</span><span class="keyword">const</span> <span class="identifier">WrappedRange</span><span class="special">&amp;</span> <span class="identifier">wrapped_range</span><span class="special">)</span>
+    <span class="special">:</span> <span class="identifier">base_type</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">wrapped_range</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">wrapped_range</span><span class="special">))</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">OtherValue</span>
+      <span class="special">,</span> <span class="keyword">class</span> <span class="identifier">OtherTraversal</span>
+      <span class="special">,</span> <span class="keyword">class</span> <span class="identifier">OtherReference</span>
+      <span class="special">,</span> <span class="keyword">class</span> <span class="identifier">OtherDifference</span>
+    <span class="special">&gt;</span>
+    <span class="identifier">any_range</span><span class="special">(</span><span class="keyword">const</span> <span class="identifier">any_range</span><span class="special">&lt;</span>
+                        <span class="identifier">OtherValue</span>
+                      <span class="special">,</span> <span class="identifier">OtherTraversal</span>
+                      <span class="special">,</span> <span class="identifier">OtherReference</span>
+                      <span class="special">,</span> <span class="identifier">OtherDifference</span>
+                      <span class="special">,</span> <span class="identifier">Buffer</span>
+                    <span class="special">&gt;&amp;</span> <span class="identifier">other</span><span class="special">)</span>
+    <span class="special">:</span> <span class="identifier">base_type</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">other</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">other</span><span class="special">))</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">Iterator</span><span class="special">&gt;</span>
+    <span class="identifier">any_range</span><span class="special">(</span><span class="identifier">Iterator</span> <span class="identifier">first</span><span class="special">,</span> <span class="identifier">Iterator</span> <span class="identifier">last</span><span class="special">)</span>
+        <span class="special">:</span> <span class="identifier">base_type</span><span class="special">(</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="special">};</span>
+</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>
+<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>
+        </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>
+        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="../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>
+</body>
+</html>
diff --git a/doc/html/range/reference/ranges/counting_range.html b/doc/html/range/reference/ranges/counting_range.html
index 01355b0..21a8a16 100644
--- a/doc/html/range/reference/ranges/counting_range.html
+++ b/doc/html/range/reference/ranges/counting_range.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="../ranges.html" title="Provided Ranges">
-<link rel="prev" href="../ranges.html" title="Provided Ranges">
+<link rel="prev" href="any_range.html" title="any_range">
 <link rel="next" href="istream_range.html" title="istream_range">
 </head>
 <body bgcolor="white" text="black" link="#0000FF" vlink="#840084" alink="#0000FF">
@@ -20,14 +20,14 @@
 </tr></table>
 <hr>
 <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="istream_range.html"><img src="../../../../../../../doc/src/images/next.png" alt="Next"></a>
+<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="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="id762769"></a>
+<a name="id756497"></a>
           <a class="link" href="counting_range.html#range.reference.ranges.counting_range.prototype">Prototype</a>
         </h6>
 <p>
@@ -48,7 +48,7 @@
 <p>
         </p>
 <a name="range.reference.ranges.counting_range.description"></a><h6>
-<a name="id763151"></a>
+<a name="id756879"></a>
           <a class="link" href="counting_range.html#range.reference.ranges.counting_range.description">Description</a>
         </h6>
 <p>
@@ -58,14 +58,14 @@
           (from Boost.Iterator).
         </p>
 <a name="range.reference.ranges.counting_range.definition"></a><h6>
-<a name="id763206"></a>
+<a name="id756935"></a>
           <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="id763267"></a>
+<a name="id756996"></a>
           <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">
@@ -84,7 +84,7 @@
 </tr></table>
 <hr>
 <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="istream_range.html"><img src="../../../../../../../doc/src/images/next.png" alt="Next"></a>
+<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>
 </body>
 </html>
diff --git a/doc/html/range/reference/ranges/irange.html b/doc/html/range/reference/ranges/irange.html
index 291a416..6cc143c 100644
--- a/doc/html/range/reference/ranges/irange.html
+++ b/doc/html/range/reference/ranges/irange.html
@@ -27,7 +27,7 @@
 <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="id763696"></a>
+<a name="id757425"></a>
           <a class="link" href="irange.html#range.reference.ranges.irange.prototype">Prototype</a>
         </h6>
 <p>
@@ -44,7 +44,7 @@
 <p>
         </p>
 <a name="range.reference.ranges.irange.description"></a><h6>
-<a name="id763990"></a>
+<a name="id757718"></a>
           <a class="link" href="irange.html#range.reference.ranges.irange.description">Description</a>
         </h6>
 <p>
@@ -58,14 +58,14 @@
           parameters denoted a half-open range.
         </p>
 <a name="range.reference.ranges.irange.definition"></a><h6>
-<a name="id764067"></a>
+<a name="id757796"></a>
           <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="id764128"></a>
+<a name="id757857"></a>
           <a class="link" href="irange.html#range.reference.ranges.irange.requirements">Requirements</a>
         </h6>
 <div class="orderedlist"><ol class="orderedlist" type="1">
@@ -80,7 +80,7 @@
             </li>
 </ol></div>
 <a name="range.reference.ranges.irange.complexity"></a><h6>
-<a name="id764211"></a>
+<a name="id757940"></a>
           <a class="link" href="irange.html#range.reference.ranges.irange.complexity">Complexity</a>
         </h6>
 <p>
diff --git a/doc/html/range/reference/ranges/istream_range.html b/doc/html/range/reference/ranges/istream_range.html
index 3e704f2..8b11dde 100644
--- a/doc/html/range/reference/ranges/istream_range.html
+++ b/doc/html/range/reference/ranges/istream_range.html
@@ -27,7 +27,7 @@
 <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="id763339"></a>
+<a name="id757067"></a>
           <a class="link" href="istream_range.html#range.reference.ranges.istream_range.prototype">Prototype</a>
         </h6>
 <p>
@@ -40,7 +40,7 @@
 <p>
         </p>
 <a name="range.reference.ranges.istream_range.description"></a><h6>
-<a name="id763555"></a>
+<a name="id757284"></a>
           <a class="link" href="istream_range.html#range.reference.ranges.istream_range.description">Description</a>
         </h6>
 <p>
@@ -49,7 +49,7 @@
           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="id763619"></a>
+<a name="id757348"></a>
           <a class="link" href="istream_range.html#range.reference.ranges.istream_range.definition">Definition</a>
         </h6>
 <p>
diff --git a/doc/html/range/reference/utilities/iterator_range.html b/doc/html/range/reference/utilities/iterator_range.html
index b2b1923..bbe4521 100644
--- a/doc/html/range/reference/utilities/iterator_range.html
+++ b/doc/html/range/reference/utilities/iterator_range.html
@@ -48,7 +48,7 @@
           type.
         </p>
 <a name="range.reference.utilities.iterator_range.synopsis"></a><h5>
-<a name="id764572"></a>
+<a name="id758301"></a>
           <a class="link" href="iterator_range.html#range.reference.utilities.iterator_range.synopsis">Synopsis</a>
         </h5>
 <p>
@@ -188,7 +188,7 @@
           iterators from the same container.
         </p>
 <a name="range.reference.utilities.iterator_range.details_member_functions"></a><h5>
-<a name="id767779"></a>
+<a name="id761507"></a>
           <a class="link" href="iterator_range.html#range.reference.utilities.iterator_range.details_member_functions">Details
           member functions</a>
         </h5>
@@ -207,7 +207,7 @@
             <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="id768014"></a>
+<a name="id761741"></a>
           <a class="link" href="iterator_range.html#range.reference.utilities.iterator_range.details_functions">Details
           functions</a>
         </h5>
diff --git a/doc/html/range/reference/utilities/join.html b/doc/html/range/reference/utilities/join.html
index 8fc0d82..6b7d849 100644
--- a/doc/html/range/reference/utilities/join.html
+++ b/doc/html/range/reference/utilities/join.html
@@ -39,7 +39,7 @@
           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="id770410"></a>
+<a name="id764138"></a>
           <a class="link" href="join.html#range.reference.utilities.join.synposis">Synposis</a>
         </h5>
 <p>
@@ -108,7 +108,7 @@
             </li>
 </ul></div>
 <a name="range.reference.utilities.join.example"></a><h5>
-<a name="id771245"></a>
+<a name="id764973"></a>
           <a class="link" href="join.html#range.reference.utilities.join.example">Example</a>
         </h5>
 <p>
diff --git a/doc/html/range/reference/utilities/sub_range.html b/doc/html/range/reference/utilities/sub_range.html
index e82e7f5..c35e707 100644
--- a/doc/html/range/reference/utilities/sub_range.html
+++ b/doc/html/range/reference/utilities/sub_range.html
@@ -35,7 +35,7 @@
           is.
         </p>
 <a name="range.reference.utilities.sub_range.synopsis"></a><h5>
-<a name="id769145"></a>
+<a name="id762873"></a>
           <a class="link" href="sub_range.html#range.reference.utilities.sub_range.synopsis">Synopsis</a>
         </h5>
 <p>
diff --git a/doc/reference/adaptors.qbk b/doc/reference/adaptors.qbk
index 260fc39..91401c0 100644
--- a/doc/reference/adaptors.qbk
+++ b/doc/reference/adaptors.qbk
@@ -177,6 +177,7 @@ rng | boost::adaptors::adaptor_generator
 [include adaptors/reversed.qbk]
 [include adaptors/sliced.qbk]
 [include adaptors/strided.qbk]
+[include adaptors/type_erased.qbk]
 [include adaptors/tokenized.qbk]
 [include adaptors/transformed.qbk]
 [include adaptors/uniqued.qbk]
diff --git a/doc/reference/adaptors/strided.qbk b/doc/reference/adaptors/strided.qbk
index 0f57222..e219a83 100644
--- a/doc/reference/adaptors/strided.qbk
+++ b/doc/reference/adaptors/strided.qbk
@@ -11,7 +11,7 @@
     [[Function] [`boost::adaptors::stride(rng, n)`]]
 ]
 
-* [*Precondition:] `0 <= n` and `boost::size(rng)` is a valid expression.
+* [*Precondition:] `0 <= n`.
 * [*Returns:] A new range based on `rng` where traversal is performed in steps of `n`.
 * [*Range Category:] __single_pass_range__
 * [*Returned Range Category:] The range category of `rng`.
diff --git a/doc/reference/adaptors/type_erased.qbk b/doc/reference/adaptors/type_erased.qbk
new file mode 100644
index 0000000..a24bee7
--- /dev/null
+++ b/doc/reference/adaptors/type_erased.qbk
@@ -0,0 +1,151 @@
+[/
+    Copyright 2010 Neil Groves
+    Distributed under the Boost Software License, Version 1.0.
+    (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)
+/]
+[section:type_erased type_erased]
+
+[table
+    [[Syntax] [Code]]
+    [[Pipe] [`rng | boost::adaptors::type_erased<Value, Traversal, Reference, Difference, Buffer>()`]]
+    [[Function] [`boost::adaptors::type_erase(rng, boost::adaptors::type_erased<Value, Traversal, Reference, Difference, Buffer>)`]]
+]
+
+Please note that it is frequently unnecessary to use the `type_erased` adaptor. It is often better to use the implicit conversion to `any_range`.
+
+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`
+    * `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`.
+* [*Precondition:]  `Traversal` is one of `{ boost::use_default, boost::single_pass_traversal_tag, boost::forward_traversal_tag, boost::bidirectional_traversal_tag, boost::random_access_traversal_tag }`
+* [*Returns:] The returned value is the same as `typename any_range_type_generator< Rng, Value, Traversal, Reference, Difference, Buffer >` that represents `rng` in a type-erased manner.
+* [*Range Category:] __single_pass_range__
+* [*Returned Range Category:] if `Traversal` was specified as `boost::use_default` then `typename boost::iterator_traversal<boost::range_iterator<Rng>::type>::type`, otherwise `Traversal`.
+
+[heading AnyIteratorBufferConcept]
+``
+class AnyIteratorBufferConcept
+{
+public:
+    AnyIteratorBufferConcept();
+    ~AnyIteratorBufferConcept();
+
+    // bytes is the requested size to allocate. This function
+    // must return a pointer to an adequate area of memory.
+    // throws: bad_alloc
+    //
+    // The buffer will only ever have zero or one
+    // outstanding memory allocations.
+    void* allocate(std::size_t bytes);
+
+    // deallocate this buffer
+    void deallocate();
+};
+``
+
+[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;
+}
+``
+[endsect]
+
+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
+``
+[endsect]
+
+
diff --git a/doc/reference/ranges.qbk b/doc/reference/ranges.qbk
index 14299c4..5b853d5 100644
--- a/doc/reference/ranges.qbk
+++ b/doc/reference/ranges.qbk
@@ -5,6 +5,7 @@
 /]
 [section:ranges Provided Ranges]
 
+[include ranges/any_range.qbk]
 [include ranges/counting_range.qbk]
 [include ranges/istream_range.qbk]
 [include ranges/irange.qbk]
diff --git a/doc/reference/ranges/any_range.qbk b/doc/reference/ranges/any_range.qbk
new file mode 100644
index 0000000..6ff224e
--- /dev/null
+++ b/doc/reference/ranges/any_range.qbk
@@ -0,0 +1,115 @@
+[/
+    Copyright 2010 Neil Groves
+    Distributed under the Boost Software License, Version 1.0.
+    (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)
+/]
+[section:any_range any_range]
+
+[heading Description]
+
+`any_range` is a range that has the type information erased hence a `any_range<int, boost::forward_pass_traversal_tag, int, std::ptrdiff_t>`
+can be used to represent a `std::vector<int>`, a `std::list<int>` or many other types.
+
+The __type_erasure_article__ covers the motivation and goals of type erasure in this context. Clearly
+my implementation is building upon a lot of prior art created by others. Thomas Becker's `any_iterator` was a strong
+influence. Adobe also have an `any_iterator` implementation, but this has very tight coupling to other parts of the
+library that precluded it from use in Boost.Range.
+Early development versions of this Range Adaptor directly used Thomas Becker's any_iterator implementation.
+Subsequently I discovered that the heap allocations of this and many other implementations cause poor
+speed performance particularly at the tails of the distribution. To solve this required a new design that
+incorporated the embedded buffer optimization.
+
+Despite the underlying `any_iterator` being the fastest available implementation, the performance overhead of `any_range` is still appreciable due to the cost of virtual function calls required to implement `increment`, `decrement`, `advance`, `equal` etc. Frequently a better design choice is to convert to a canonical form.
+
+Please see the __range_adaptors_type_erased__ for a Range Adaptor that returns `any_range` instances.
+
+[heading Synopsis]
+
+``
+template<
+    class Value
+  , class Traversal
+  , class Reference
+  , class Difference
+  , class Buffer = any_iterator_default_buffer
+>
+class any_range
+    : public iterator_range<
+        range_detail::any_iterator<
+            Value
+          , Traversal
+          , Reference
+          , Difference
+          , Buffer
+        >
+    >
+{
+    typedef range_detail::any_iterator<
+        Value
+      , Traversal
+      , Reference
+      , Difference
+      , Buffer
+    > any_iterator_type;
+
+    typedef iterator_range<any_iterator_type> base_type;
+
+    struct enabler {};
+    struct disabler {};
+public:
+    typedef any_iterator_type iterator;
+    typedef any_iterator_type const_iterator;
+
+    any_range()
+    {
+    }
+
+    any_range(const any_range& other)
+        : base_type(other)
+    {
+    }
+
+    template<class WrappedRange>
+    any_range(WrappedRange& wrapped_range)
+    : base_type(boost::begin(wrapped_range),
+                boost::end(wrapped_range))
+    {
+    }
+
+    template<class WrappedRange>
+    any_range(const WrappedRange& wrapped_range)
+    : base_type(boost::begin(wrapped_range),
+                boost::end(wrapped_range))
+    {
+    }
+
+    template<
+        class OtherValue
+      , class OtherTraversal
+      , class OtherReference
+      , class OtherDifference
+    >
+    any_range(const any_range<
+                        OtherValue
+                      , OtherTraversal
+                      , OtherReference
+                      , OtherDifference
+                      , Buffer
+                    >& other)
+    : base_type(boost::begin(other), boost::end(other))
+    {
+    }
+
+    template<class Iterator>
+    any_range(Iterator first, Iterator last)
+        : base_type(first, last)
+    {
+    }
+};
+``
+
+[heading Definition]
+
+Defined in header file `boost/range/any_range.hpp`
+
+[endsect]
diff --git a/doc/reference/semantics.qbk b/doc/reference/semantics.qbk
index 6276e9d..335ab90 100644
--- a/doc/reference/semantics.qbk
+++ b/doc/reference/semantics.qbk
@@ -21,7 +21,7 @@
 [table
     [[Expression] [Return type] [Complexity]]
     [
-        [`range_iterator<X>::type`] 
+        [`range_iterator<X>::type`]
         [``
             T::iterator
             P::first_type
@@ -129,7 +129,7 @@
     [
         [`size(x)`]
         [`range_difference<X>::type`]
-        [`The size of the range with complexity O(1). For RandomAccessRanges this is achieved via boost::end(x) - boost::begin(x). For other traversal categories range_calculate_size(x) is returned. Note that unless range_calculate_size(x) has been implemented by the user as an extension then the Argument Dependent Lookup will return x.size()`]
+        [`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/include/boost/range/adaptor/sliced.hpp b/include/boost/range/adaptor/sliced.hpp
index 7772bb5..14ad986 100755
--- a/include/boost/range/adaptor/sliced.hpp
+++ b/include/boost/range/adaptor/sliced.hpp
@@ -76,6 +76,7 @@ namespace boost
         }
 
     } // namespace adaptors
+    using adaptors::sliced_range;
 } // namespace boost
 
 #endif
diff --git a/include/boost/range/adaptor/strided.hpp b/include/boost/range/adaptor/strided.hpp
index 9bbd8ca..abfad5e 100755
--- a/include/boost/range/adaptor/strided.hpp
+++ b/include/boost/range/adaptor/strided.hpp
@@ -16,156 +16,287 @@
 #include <boost/iterator/iterator_adaptor.hpp>
 #include <iterator>
 
-#include <iostream>
-
 namespace boost
 {
     namespace range_detail
     {
-
-        template<class BaseIterator>
+        // strided_iterator for wrapping a forward traversal iterator
+        template<class BaseIterator, class Category>
         class strided_iterator
             : public iterator_adaptor<
-                strided_iterator<BaseIterator>
+                strided_iterator<BaseIterator, Category>
               , BaseIterator
+              , use_default
+              , boost::forward_traversal_tag
             >
         {
-            friend class iterator_core_access;
+            friend class ::boost::iterator_core_access;
 
-            typedef iterator_adaptor<strided_iterator<BaseIterator>, BaseIterator> super_t;
+            typedef iterator_adaptor<
+                        strided_iterator<BaseIterator, Category>
+                      , BaseIterator
+                      , use_default
+                      , boost::forward_traversal_tag
+                    > super_t;
 
         public:
             typedef BOOST_DEDUCED_TYPENAME std::iterator_traits<BaseIterator>::difference_type difference_type;
+            typedef BaseIterator base_iterator;
 
             strided_iterator()
-                : m_stride(), m_offset(), m_max_offset()
+                : m_last()
+                , m_stride()
             {
             }
 
-            explicit strided_iterator(BaseIterator base_it,
-                                      difference_type stride,
-                                      difference_type offset,
-                                      difference_type max_offset)
-                : super_t(base_it)
+            strided_iterator(base_iterator first, base_iterator it, base_iterator last, difference_type stride)
+                : super_t(it)
+                , m_last(last)
                 , m_stride(stride)
-                , m_offset(offset)
-                , m_max_offset(max_offset)
             {
             }
 
             template<class OtherIterator>
-            strided_iterator(const strided_iterator<OtherIterator>& other,
-                             BOOST_DEDUCED_TYPENAME enable_if_convertible<OtherIterator, BaseIterator>::type* = 0)
+            strided_iterator(const strided_iterator<OtherIterator, Category>& other,
+                             BOOST_DEDUCED_TYPENAME enable_if_convertible<OtherIterator, base_iterator>::type* = 0)
                 : super_t(other)
-                , m_stride(other.m_stride)
-                , m_offset(other.m_offset)
-                , m_max_offset(other.m_max_offset)
+                , m_last(other.base_end())
+                , m_stride(other.get_stride())
             {
             }
 
-            strided_iterator&
-            operator=(const strided_iterator& other)
-            {
-                super_t::operator=(other);
-                m_stride = other.m_stride;
-                m_offset = other.m_offset;
-                m_max_offset = other.m_max_offset;
-                return *this;
-            }
+            base_iterator base_end() const { return m_last; }
+            difference_type get_stride() const { return m_stride; }
 
+        private:
             void increment()
             {
-                m_offset += m_stride;
-                if (m_offset <= m_max_offset)
-                    std::advance(this->base_reference(), m_stride);
+                base_iterator& it = this->base_reference();
+                for (difference_type i = 0; (it != m_last) && (i < m_stride); ++i)
+                    ++it;
+            }
+
+            base_iterator m_last;
+            difference_type m_stride;
+        };
+
+        // strided_iterator for wrapping a bidirectional iterator
+        template<class BaseIterator>
+        class strided_iterator<BaseIterator, bidirectional_traversal_tag>
+            : public iterator_adaptor<
+                strided_iterator<BaseIterator, bidirectional_traversal_tag>
+              , BaseIterator
+              , use_default
+              , bidirectional_traversal_tag
+            >
+        {
+            friend class ::boost::iterator_core_access;
+
+            typedef iterator_adaptor<
+                        strided_iterator<BaseIterator, bidirectional_traversal_tag>
+                      , BaseIterator
+                      , use_default
+                      , bidirectional_traversal_tag
+                    > super_t;
+        public:
+            typedef BOOST_DEDUCED_TYPENAME std::iterator_traits<BaseIterator>::difference_type difference_type;
+            typedef BaseIterator base_iterator;
+
+            strided_iterator()
+                : m_first()
+                , m_last()
+                , m_stride()
+            {
+            }
+
+            strided_iterator(base_iterator first, base_iterator it, base_iterator last, difference_type stride)
+                : super_t(it)
+                , m_first(first)
+                , m_last(last)
+                , m_stride(stride)
+            {
+            }
+
+            template<class OtherIterator>
+            strided_iterator(const strided_iterator<OtherIterator, bidirectional_traversal_tag>& other,
+                             BOOST_DEDUCED_TYPENAME enable_if_convertible<OtherIterator, base_iterator>::type* = 0)
+                : super_t(other.base())
+                , m_first(other.base_begin())
+                , m_last(other.base_end())
+                , m_stride(other.get_stride())
+            {
+            }
+
+            base_iterator base_begin() const { return m_first; }
+            base_iterator base_end() const { return m_last; }
+            difference_type get_stride() const { return m_stride; }
+
+        private:
+            void increment()
+            {
+                base_iterator& it = this->base_reference();
+                for (difference_type i = 0; (it != m_last) && (i < m_stride); ++i)
+                    ++it;
             }
 
             void decrement()
             {
-                m_offset -= m_stride;
-                if (m_offset >= 0)
-                    std::advance(this->base_reference(), -m_stride);
+                base_iterator& it = this->base_reference();
+                for (difference_type i = 0; (it != m_first) && (i < m_stride); ++i)
+                    --it;
             }
 
-            void advance(difference_type n)
-            {
-                n *= m_stride;
-                m_offset += n;
+            base_iterator m_first;
+            base_iterator m_last;
+            difference_type m_stride;
+        };
 
-                if (m_offset >= 0 && m_offset <= m_max_offset)
-                    std::advance(this->base_reference(), n);
+        // strided_iterator implementation for wrapping a random access iterator
+        template<class BaseIterator>
+        class strided_iterator<BaseIterator, random_access_traversal_tag>
+            : public iterator_adaptor<
+                        strided_iterator<BaseIterator, random_access_traversal_tag>
+                      , BaseIterator
+                      , use_default
+                      , random_access_traversal_tag
+                    >
+        {
+            friend class ::boost::iterator_core_access;
+
+            typedef iterator_adaptor<
+                        strided_iterator<BaseIterator, random_access_traversal_tag>
+                      , BaseIterator
+                      , use_default
+                      , random_access_traversal_tag
+                    > super_t;
+        public:
+            typedef BOOST_DEDUCED_TYPENAME super_t::difference_type difference_type;
+            typedef BaseIterator base_iterator;
+
+            strided_iterator()
+                : m_first()
+                , m_last()
+                , m_stride()
+            {
+            }
+
+            strided_iterator(BaseIterator first, BaseIterator it, BaseIterator last, difference_type stride)
+                : super_t(it)
+                , m_first(first)
+                , m_last(last)
+                , m_stride(stride)
+            {
             }
 
             template<class OtherIterator>
-            bool equal(const strided_iterator<OtherIterator>& other,
-                       BOOST_DEDUCED_TYPENAME enable_if_convertible<OtherIterator, BaseIterator>::type* = 0) const
+            strided_iterator(const strided_iterator<OtherIterator, random_access_traversal_tag>& other,
+                             BOOST_DEDUCED_TYPENAME enable_if_convertible<OtherIterator, BaseIterator>::type* = 0)
+                : super_t(other.base())
+                , m_first(other.base_begin())
+                , m_last(other.base_end())
+                , m_stride(other.get_stride())
             {
-                return m_offset == other.m_offset;
             }
 
-            difference_type
-            distance_to(const strided_iterator& other) const
+            base_iterator base_begin() const { return m_first; }
+            base_iterator base_end() const { return m_last; }
+            difference_type get_stride() const { return m_stride; }
+
+        private:
+            void increment()
             {
-                return (other.m_offset - m_offset) / m_stride;
+                base_iterator& it = this->base_reference();
+                if ((m_last - it) > m_stride)
+                    it += m_stride;
+                else
+                    it = m_last;
+            }
+
+            void decrement()
+            {
+                base_iterator& it = this->base_reference();
+                if ((it - m_first) > m_stride)
+                    it -= m_stride;
+                else
+                    it = 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;
+                }
+                else
+                {
+                    if ((m_first - it) > offset)
+                        it += offset;
+                    else
+                        it = m_first;
+                }
+            }
+
+            template<class OtherIterator>
+            difference_type distance_to(const strided_iterator<OtherIterator, random_access_traversal_tag>& other,
+                                        BOOST_DEDUCED_TYPENAME enable_if_convertible<OtherIterator, BaseIterator>::type* = 0) const
+            {
+                if (other.base() >= this->base())
+                    return (other.base() - this->base() + (m_stride - 1)) / m_stride;
+                return (other.base() - this->base() - (m_stride - 1)) / m_stride;
+            }
+
+            bool equal(const strided_iterator& other) const
+            {
+                return other.base() == this->base();
             }
 
         private:
+            base_iterator m_first;
+            base_iterator m_last;
             difference_type m_stride;
-            difference_type m_offset;
-            difference_type m_max_offset;
         };
 
         template<class BaseIterator, class Difference> inline
-        strided_iterator<BaseIterator>
-        make_strided_iterator(
-            const BaseIterator& first,
-            Difference          stride,
-            typename std::iterator_traits<BaseIterator>::difference_type offset,
-            typename std::iterator_traits<BaseIterator>::difference_type max_offset
-            )
+        strided_iterator<BaseIterator, BOOST_DEDUCED_TYPENAME iterator_traversal<BaseIterator>::type>
+        make_strided_iterator(BaseIterator first, BaseIterator it,
+                              BaseIterator last, Difference stride)
         {
             BOOST_ASSERT( stride >= 0 );
-            BOOST_ASSERT( (stride == 0) || (offset % stride == 0) );
-            BOOST_ASSERT( (stride == 0) || (max_offset % stride == 0) );
-            BOOST_ASSERT( offset <= max_offset );
-            return strided_iterator<BaseIterator>(first, stride, offset, max_offset);
+            typedef BOOST_DEDUCED_TYPENAME iterator_traversal<BaseIterator>::type traversal_tag;
+            return strided_iterator<BaseIterator, traversal_tag>(first, it, last, stride);
         }
 
-        template< class Rng >
+        template< class Rng
+                , class Category = BOOST_DEDUCED_TYPENAME iterator_traversal<
+                                    BOOST_DEDUCED_TYPENAME range_iterator<Rng>::type
+                                   >::type
+         >
         class strided_range
-            : public iterator_range<range_detail::strided_iterator<BOOST_DEDUCED_TYPENAME range_iterator<Rng>::type> >
+            : public iterator_range<
+                        range_detail::strided_iterator<
+                            BOOST_DEDUCED_TYPENAME range_iterator<Rng>::type,
+                            Category
+                        >
+                     >
         {
-            typedef range_detail::strided_iterator<BOOST_DEDUCED_TYPENAME range_iterator<Rng>::type> iter_type;
+            typedef range_detail::strided_iterator<
+                        BOOST_DEDUCED_TYPENAME range_iterator<Rng>::type,
+                        Category
+                    > iter_type;
             typedef iterator_range<iter_type> super_t;
         public:
             template<class Difference>
             strided_range(Difference stride, Rng& rng)
-                : super_t(make_super(stride, rng))
+                : super_t(make_strided_iterator(boost::begin(rng), boost::begin(rng), boost::end(rng), stride),
+                          make_strided_iterator(boost::begin(rng), boost::end(rng), boost::end(rng), stride))
             {
                 BOOST_ASSERT( stride >= 0 );
             }
-
-        private:
-            template<class Difference>
-            static super_t make_super(const Difference stride, Rng& rng)
-            {
-                const Difference count = boost::size(rng);
-                const Difference max_count = max_offset(count, stride);
-                return super_t(make_strided_iterator(boost::begin(rng), stride, 0, max_count),
-                               make_strided_iterator(boost::end(rng), stride, max_count, max_count));
-            }
-
-            template<class Difference, class Stride>
-            static Difference max_offset(Difference sz, const Stride stride)
-            {
-                if (stride > 0)
-                {
-                    sz += stride - 1;
-                    sz /= stride;
-                    sz *= stride;
-                }
-                return sz;
-            }
         };
 
         template<class Difference>
diff --git a/include/boost/range/adaptor/type_erased.hpp b/include/boost/range/adaptor/type_erased.hpp
index 85bff73..80bc712 100644
--- a/include/boost/range/adaptor/type_erased.hpp
+++ b/include/boost/range/adaptor/type_erased.hpp
@@ -1,6 +1,6 @@
 // Boost.Range library
 //
-//  Copyright Thorsten Ottosen, Neil Groves 2006 - 2008. Use, modification and
+//  Copyright Neil Groves 2010. 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)
@@ -10,79 +10,173 @@
 #ifndef BOOST_RANGE_ADAPTOR_TYPE_ERASED_HPP_INCLUDED
 #define BOOST_RANGE_ADAPTOR_TYPE_ERASED_HPP_INCLUDED
 
-#include <boost/iterator/iterator_facade.hpp>
-#include <boost/range/range_reference.hpp>
-#include <boost/range/range_value.hpp>
+#include <boost/range/reference.hpp>
+#include <boost/range/value_type.hpp>
+#include <boost/range/iterator_range_core.hpp>
+#include <boost/range/any_range.hpp>
+#include <boost/cast.hpp>
 
 namespace boost
 {
-    namespace range_detail
-    {
-        template<
-            class Value,
-            class CategoryOrTraversal,
-            class Reference,
-            class Difference
-            >
-        class any_range
-            : public iterator_range<
-                        IteratorTypeErasure::any_iterator<
-                            Value, CategoryOrTraversal, Reference, Difference> >
-        {
-            typedef typename IteratorTypeErasure::any_iterator<
-                Value, CategoryOrTraversal, Reference, Difference> iterator_t;
-
-            typedef iterator_range<iterator_t> base_t;
-        public:
-            template<class Range>
-            explicit any_range(Range& r) : base_t(r) {}
-
-            template<class Range>
-            explicit any_range(const Range& r) : base_t(r) {}
-        };
-
-            template<class Range>
-            class any_range_generator
-            {
-            public:
-                typedef any_range<
-                            BOOST_DEDUCED_TYPENAME range_value<Range>::type,
-                            BOOST_DEDUCED_TYPENAME iterator_traversal<
-                                BOOST_DEDUCED_TYPENAME range_iterator<Range>::type
-                            >::type,
-                            BOOST_DEDUCED_TYPENAME range_reference<Range>::type,
-                            BOOST_DEDUCED_TYPENAME range_difference<Range>::type
-                        > type;
-            };
-
-            class type_erased_tag {};
-
-
-    } // namespace range_detail
-
-    using range_detail::any_range;
-
     namespace adaptors
     {
-        namespace
+        template<
+            class Value = use_default
+          , class Traversal = use_default
+          , class Reference = use_default
+          , class Difference = use_default
+          , class Buffer = use_default
+        >
+        struct type_erased
         {
-            const range_detail::type_erased_tag type_erased = range_detail::type_erased_tag();
+        };
+
+        template<
+            class SinglePassRange
+          , class Value
+          , class Traversal
+          , class Reference
+          , class Difference
+          , class Buffer
+        >
+        typename any_range_type_generator<
+            SinglePassRange
+          , Value
+          , Traversal
+          , Reference
+          , Difference
+          , Buffer
+        >::type
+        operator|(SinglePassRange& rng,
+                  type_erased<
+                        Value
+                      , Traversal
+                      , Reference
+                      , Difference
+                      , Buffer
+                    >)
+        {
+            typedef typename any_range_type_generator<
+                SinglePassRange
+              , Value
+              , Traversal
+              , Reference
+              , Difference
+              , Buffer
+            >::type range_type;
+            return range_type(boost::begin(rng), boost::end(rng));
         }
 
-        template<class SinglePassRange>
-        typename range_detail::any_range_generator<SinglePassRange>::type
-        operator|(SinglePassRange& rng, range_detail::type_erased_tag)
+        template<
+            class SinglePassRange
+          , class Value
+          , class Traversal
+          , class Reference
+          , class Difference
+          , class Buffer
+        >
+        typename any_range_type_generator<
+            const SinglePassRange
+          , Value
+          , Traversal
+          , Reference
+          , Difference
+          , Buffer
+        >::type
+        operator|(const SinglePassRange& rng,
+                  type_erased<
+                            Value
+                          , Traversal
+                          , Reference
+                          , Difference
+                          , Buffer
+                    >)
         {
-            typedef typename range_detail::any_range_generator<SinglePassRange>::type range_t;
-            return range_t(rng);
+            typedef typename any_range_type_generator<
+                const SinglePassRange
+              , Value
+              , Traversal
+              , Reference
+              , Difference
+              , Buffer
+            >::type range_type;
+            return range_type(boost::begin(rng), boost::end(rng));
         }
 
-        template<class SinglePassRange>
-        typename range_detail::any_range_generator<const SinglePassRange>::type
-        operator|(const SinglePassRange& rng, range_detail::type_erased_tag)
+        template<
+            class SinglePassRange
+          , class Value
+          , class Traversal
+          , class Reference
+          , class Difference
+          , class Buffer
+        >
+        typename any_range_type_generator<
+            SinglePassRange
+          , Value
+          , Traversal
+          , Reference
+          , Difference
+          , Buffer
+        >::type
+        type_erase(SinglePassRange& rng
+                 , type_erased<
+                            Value
+                          , Traversal
+                          , Reference
+                          , Difference
+                          , Buffer
+                    > = type_erased<>()
+                )
         {
-            typedef typename range_detail::any_range_generator<const SinglePassRange>::type range_t;
-            return range_t(rng);
+            typedef typename any_range_type_generator<
+                SinglePassRange
+              , Value
+              , Traversal
+              , Reference
+              , Difference
+              , Buffer
+            >::type range_type;
+
+            return range_type(boost::begin(rng), boost::end(rng));
+        }
+
+        template<
+            class SinglePassRange
+          , class Value
+          , class Traversal
+          , class Reference
+          , class Difference
+          , class Buffer
+        >
+        typename any_range_type_generator<
+            const SinglePassRange
+          , Value
+          , Traversal
+          , Reference
+          , Difference
+          , Buffer
+        >::type
+        type_erase(const SinglePassRange& rng
+                 , type_erased<
+                            Value
+                          , Traversal
+                          , Reference
+                          , Difference
+                          , Buffer
+                    > = type_erased<>()
+                )
+        {
+            typedef typename any_range_type_generator<
+                const SinglePassRange
+              , Value
+              , Traversal
+              , Reference
+              , Difference
+              , Buffer
+            >::type range_type;
+
+            return range_type(boost::begin(rng), boost::end(rng));
         }
     }
 } // namespace boost
diff --git a/include/boost/range/any_range.hpp b/include/boost/range/any_range.hpp
new file mode 100644
index 0000000..2155b2c
--- /dev/null
+++ b/include/boost/range/any_range.hpp
@@ -0,0 +1,204 @@
+//  Copyright Neil Groves 2010. 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/
+//
+#ifndef BOOST_RANGE_ANY_RANGE_HPP_INCLUDED
+#define BOOST_RANGE_ANY_RANGE_HPP_INCLUDED
+
+#include <boost/config.hpp>
+#include <boost/iterator/iterator_categories.hpp>
+#include <boost/iterator/iterator_traits.hpp>
+#include <boost/iterator/iterator_facade.hpp>
+#include <boost/iterator/iterator_adaptor.hpp>
+#include <boost/range/detail/any_iterator.hpp>
+#include <boost/range/reference.hpp>
+#include <boost/range/value_type.hpp>
+#include <boost/range/iterator_range_core.hpp>
+#include <boost/cast.hpp>
+
+namespace boost
+{
+    namespace range_detail
+    {
+        // If T is use_default, return the result of Default, otherwise
+        // return T.
+        //
+        // This is an implementation artifact used to pick intelligent default
+        // values when the user specified boost::use_default as a template
+        // parameter.
+        template<
+            class T,
+            class Default
+        >
+        struct any_range_default_help
+            : mpl::eval_if<
+                is_same<T, use_default>
+              , Default
+              , mpl::identity<T>
+            >
+        {
+        };
+
+        template<
+            class WrappedRange
+          , class Value
+          , class Reference
+        >
+        struct any_range_value_type
+        {
+# ifdef BOOST_ITERATOR_REF_CONSTNESS_KILLS_WRITABILITY
+            typedef typename any_range_default_help<
+                    Value
+                  , mpl::eval_if<
+                        is_same<Reference, use_default>
+                      , range_value<
+                            typename remove_const<WrappedRange>
+                        ::type>
+                      , remove_reference<Reference>
+                    >
+                >::type type;
+# else
+            typedef typename any_range_default_help<
+                Value
+              , range_value<
+                    typename remove_const<WrappedRange>
+                ::type>
+            >::type type;
+# endif
+        };
+
+        template<
+            class Value
+          , class Traversal
+          , class Reference
+          , class Difference
+          , class Buffer = use_default
+        >
+        class any_range
+            : public iterator_range<
+                        any_iterator<
+                            Value
+                          , Traversal
+                          , Reference
+                          , Difference
+                          , typename any_range_default_help<
+                                Buffer
+                              , mpl::identity<any_iterator_default_buffer>
+                            >::type
+                        >
+                    >
+        {
+            typedef iterator_range<
+                        any_iterator<
+                            Value
+                          , Traversal
+                          , Reference
+                          , Difference
+                          , typename any_range_default_help<
+                                Buffer
+                              , mpl::identity<any_iterator_default_buffer>
+                            >::type
+                        >
+                    > base_type;
+
+            struct enabler {};
+            struct disabler {};
+        public:
+            any_range()
+            {
+            }
+
+            any_range(const any_range& other)
+                : base_type(other)
+            {
+            }
+
+            template<class WrappedRange>
+            any_range(WrappedRange& wrapped_range)
+            : base_type(boost::begin(wrapped_range),
+                        boost::end(wrapped_range))
+            {
+            }
+
+            template<class WrappedRange>
+            any_range(const WrappedRange& wrapped_range)
+            : base_type(boost::begin(wrapped_range),
+                        boost::end(wrapped_range))
+            {
+            }
+
+            template<
+                class OtherValue
+              , class OtherTraversal
+              , class OtherReference
+              , class OtherDifference
+            >
+            any_range(const any_range<
+                                OtherValue
+                              , OtherTraversal
+                              , OtherReference
+                              , OtherDifference
+                              , Buffer
+                            >& other)
+            : base_type(boost::begin(other), boost::end(other))
+            {
+            }
+
+            template<class Iterator>
+            any_range(Iterator first, Iterator last)
+                : base_type(first, last)
+            {
+            }
+        };
+
+        template<
+            class WrappedRange
+          , class Value = use_default
+          , class Traversal = use_default
+          , class Reference = use_default
+          , class Difference = use_default
+          , class Buffer = use_default
+        >
+        struct any_range_type_generator
+        {
+            BOOST_RANGE_CONCEPT_ASSERT(( SinglePassRangeConcept<WrappedRange> ));
+            typedef any_range<
+                typename any_range_value_type<
+                    WrappedRange
+                  , Value
+                  , typename any_range_default_help<
+                        Reference
+                      , range_reference<WrappedRange>
+                    >::type
+                >::type
+              , typename any_range_default_help<
+                            Traversal
+                          , iterator_traversal<
+                                typename range_iterator<WrappedRange>::type
+                            >
+                        >::type
+              , typename any_range_default_help<
+                    Reference
+                  , range_reference<WrappedRange>
+                >::type
+              , typename any_range_default_help<
+                    Difference
+                  , range_difference<WrappedRange>
+                >::type
+              , typename any_range_default_help<
+                    Buffer
+                  , mpl::identity<any_iterator_default_buffer>
+                >::type
+            > type;
+        };
+    } // namespace range_detail
+
+    using range_detail::any_range;
+    using range_detail::any_range_type_generator;
+} // namespace boost
+
+#endif // include guard
diff --git a/include/boost/range/begin.hpp b/include/boost/range/begin.hpp
index a4a5e10..c668488 100644
--- a/include/boost/range/begin.hpp
+++ b/include/boost/range/begin.hpp
@@ -91,6 +91,11 @@ namespace range_detail
 } // namespace 'range_detail'
 #endif
 
+// Use a ADL namespace barrier to avoid ambiguity with other unqualified
+// calls. This is particularly important with C++0x encouraging
+// unqualified calls to begin/end.
+namespace range_adl_barrier
+{
 
 template< class T >
 inline BOOST_DEDUCED_TYPENAME range_iterator<T>::type begin( T& r )
@@ -114,19 +119,25 @@ inline BOOST_DEDUCED_TYPENAME range_iterator<const T>::type begin( const T& r )
     return range_begin( r );
 }
 
+    } // namespace range_adl_barrier
 } // namespace boost
 
 #endif // BOOST_NO_FUNCTION_TEMPLATE_ORDERING
 
 namespace boost
 {
-    template< class T >
-    inline BOOST_DEDUCED_TYPENAME range_iterator<const T>::type
-    const_begin( const T& r )
+    namespace range_adl_barrier
     {
-        return boost::begin( r );
-    }
-}
+        template< class T >
+        inline BOOST_DEDUCED_TYPENAME range_iterator<const T>::type
+        const_begin( const T& r )
+        {
+            return boost::range_adl_barrier::begin( r );
+        }
+    } // namespace range_adl_barrier
+
+    using namespace range_adl_barrier;
+} // namespace boost
 
 #endif
 
diff --git a/include/boost/range/concepts.hpp b/include/boost/range/concepts.hpp
index d9f9bfc..5965293 100644
--- a/include/boost/range/concepts.hpp
+++ b/include/boost/range/concepts.hpp
@@ -148,13 +148,16 @@ namespace boost {
                 Iterator i2(++i);
                 boost::ignore_unused_variable_warning(i2);
 
-                Iterator i3(i++);
-                boost::ignore_unused_variable_warning(i3);
+                // deliberately we are loose with the postfix version for the single pass
+                // iterator due to the commonly poor adherence to the specification means that
+                // many algorithms would be unusable, whereas actually without the check they
+                // work
+                (void)(i++);
 
                 BOOST_DEDUCED_TYPENAME boost::detail::iterator_traits<Iterator>::reference r1(*i);
                 boost::ignore_unused_variable_warning(r1);
 
-                BOOST_DEDUCED_TYPENAME boost::detail::iterator_traits<Iterator>::reference r2(*i++);
+                BOOST_DEDUCED_TYPENAME boost::detail::iterator_traits<Iterator>::reference r2(*(++i));
                 boost::ignore_unused_variable_warning(r2);
             }
         private:
@@ -178,6 +181,20 @@ namespace boost {
                     BOOST_DEDUCED_TYPENAME ForwardIteratorConcept::traversal_category,
                     forward_traversal_tag
                 >));
+
+            BOOST_CONCEPT_USAGE(ForwardIteratorConcept)
+            {
+                // See the above note in the SinglePassIteratorConcept about the handling of the
+                // postfix increment. Since with forward and better iterators there is no need
+                // for a proxy, we can sensibly require that the dereference result
+                // is convertible to reference.
+                Iterator i2(i++);
+                boost::ignore_unused_variable_warning(i2);
+                BOOST_DEDUCED_TYPENAME boost::detail::iterator_traits<Iterator>::reference r(*(i++));
+                boost::ignore_unused_variable_warning(r);
+            }
+        private:
+            Iterator i;
 #endif
          };
 
diff --git a/include/boost/range/detail/any_iterator.hpp b/include/boost/range/detail/any_iterator.hpp
new file mode 100644
index 0000000..107dfd6
--- /dev/null
+++ b/include/boost/range/detail/any_iterator.hpp
@@ -0,0 +1,587 @@
+// Boost.Range library
+//
+//  Copyright Neil Groves 2010. 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/
+//
+#ifndef BOOST_RANGE_DETAIL_ANY_ITERATOR_HPP_INCLUDED
+#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>
+#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>
+
+namespace boost
+{
+    namespace range_detail
+    {
+        // metafunction to determine if T is a const reference
+        template<class T>
+        struct is_const_reference
+        {
+            typedef typename mpl::and_<
+                typename is_reference<T>::type,
+                typename is_const<
+                    typename remove_reference<T>::type
+                >::type
+            >::type type;
+        };
+
+        // metafunction to determine if T is a mutable reference
+        template<class T>
+        struct is_mutable_reference
+        {
+            typedef typename mpl::and_<
+                typename is_reference<T>::type,
+                typename mpl::not_<
+                    typename is_const<
+                        typename remove_reference<T>::type
+                    >::type
+                >::type
+            >::type type;
+        };
+
+        // metafunction to evaluate if a source 'reference' can be
+        // converted to a target 'reference' as a value.
+        //
+        // This is true, when the target reference type is actually
+        // not a reference, and the source reference is convertible
+        // to the target type.
+        template<class SourceReference, class TargetReference>
+        struct is_convertible_to_value_as_reference
+        {
+            typedef typename mpl::and_<
+                typename mpl::not_<
+                    typename is_reference<TargetReference>::type
+                >::type
+              , typename is_convertible<
+                    SourceReference
+                  , TargetReference
+                >::type
+            >::type type;
+        };
+
+        template<
+            class Value
+          , class Traversal
+          , class Reference
+          , class Difference
+          , class Buffer = any_iterator_default_buffer
+        >
+        class any_iterator;
+
+        // metafunction to determine if SomeIterator is an
+        // any_iterator.
+        //
+        // This is the general implementation which evaluates to false.
+        template<class SomeIterator>
+        struct is_any_iterator
+            : mpl::bool_<false>
+        {
+        };
+
+        // specialization of is_any_iterator to return true for
+        // any_iterator classes regardless of template parameters.
+        template<
+            class Value
+          , class Traversal
+          , class Reference
+          , class Difference
+          , class Buffer
+        >
+        struct is_any_iterator<
+            any_iterator<
+                Value
+              , Traversal
+              , Reference
+              , Difference
+              , Buffer
+            >
+        >
+            : mpl::bool_<true>
+        {
+        };
+    } // namespace range_detail
+
+    namespace detail
+    {
+        // Rationale:
+        // These are specialized since the iterator_facade versions lack
+        // the requisite typedefs to allow wrapping to determine the types
+        // if a user copy constructs from a postfix increment.
+
+        template<
+            class Value
+          , class Traversal
+          , class Reference
+          , class Difference
+          , class Buffer
+        >
+        class postfix_increment_proxy<
+                    range_detail::any_iterator<
+                        Value
+                      , Traversal
+                      , Reference
+                      , Difference
+                      , Buffer
+                    >
+                >
+        {
+            typedef range_detail::any_iterator<
+                Value
+              , Traversal
+              , Reference
+              , Difference
+              , Buffer
+            > any_iterator_type;
+
+        public:
+            typedef Value value_type;
+            typedef typename std::iterator_traits<any_iterator_type>::iterator_category iterator_category;
+            typedef Difference difference_type;
+            typedef typename iterator_pointer<any_iterator_type>::type pointer;
+            typedef Reference reference;
+
+            explicit postfix_increment_proxy(any_iterator_type const& x)
+                : stored_value(*x)
+            {}
+
+            value_type&
+            operator*() const
+            {
+                return this->stored_value;
+            }
+        private:
+            mutable value_type stored_value;
+        };
+
+        template<
+            class Value
+          , class Traversal
+          , class Reference
+          , class Difference
+          , class Buffer
+        >
+        class writable_postfix_increment_proxy<
+                    range_detail::any_iterator<
+                        Value
+                      , Traversal
+                      , Reference
+                      , Difference
+                      , Buffer
+                    >
+                >
+        {
+            typedef range_detail::any_iterator<
+                        Value
+                      , Traversal
+                      , Reference
+                      , Difference
+                      , Buffer
+                    > any_iterator_type;
+         public:
+            typedef Value value_type;
+            typedef typename std::iterator_traits<any_iterator_type>::iterator_category iterator_category;
+            typedef Difference difference_type;
+            typedef typename iterator_pointer<any_iterator_type>::type pointer;
+            typedef Reference reference;
+
+            explicit writable_postfix_increment_proxy(any_iterator_type const& x)
+              : stored_value(*x)
+              , stored_iterator(x)
+            {}
+
+            // Dereferencing must return a proxy so that both *r++ = o and
+            // value_type(*r++) can work.  In this case, *r is the same as
+            // *r++, and the conversion operator below is used to ensure
+            // readability.
+            writable_postfix_increment_proxy const&
+            operator*() const
+            {
+                return *this;
+            }
+
+            // Provides readability of *r++
+            operator value_type&() const
+            {
+                return stored_value;
+            }
+
+            // Provides writability of *r++
+            template <class T>
+            T const& operator=(T const& x) const
+            {
+                *this->stored_iterator = x;
+                return x;
+            }
+
+            // This overload just in case only non-const objects are writable
+            template <class T>
+            T& operator=(T& x) const
+            {
+                *this->stored_iterator = x;
+                return x;
+            }
+
+            // Provides X(r++)
+            operator any_iterator_type const&() const
+            {
+                return stored_iterator;
+            }
+
+         private:
+            mutable value_type stored_value;
+            any_iterator_type stored_iterator;
+        };
+
+
+    }
+
+    namespace range_detail
+    {
+        template<
+            class Value
+          , class Traversal
+          , class Reference
+          , class Difference
+          , class Buffer
+        >
+        class any_iterator
+            : public iterator_facade<
+                        any_iterator<
+                            Value
+                          , Traversal
+                          , Reference
+                          , Difference
+                          , Buffer
+                        >
+                    , Value
+                    , Traversal
+                    , Reference
+                    , Difference
+                >
+        {
+            template<
+                class OtherValue
+              , class OtherTraversal
+              , class OtherReference
+              , class OtherDifference
+              , class OtherBuffer
+            >
+            friend class any_iterator;
+
+            struct enabler {};
+            struct disabler {};
+
+            typedef typename any_iterator_interface_type_generator<
+                Traversal
+              , Reference
+              , Difference
+              , Buffer
+            >::type abstract_base_type;
+
+            typedef iterator_facade<
+                        any_iterator<
+                            Value
+                          , Traversal
+                          , Reference
+                          , Difference
+                          , Buffer
+                        >
+                      , Value
+                      , Traversal
+                      , Reference
+                      , Difference
+                  > base_type;
+
+            typedef Buffer buffer_type;
+
+        public:
+            typedef typename base_type::value_type value_type;
+            typedef typename base_type::reference reference;
+            typedef typename base_type::difference_type difference_type;
+
+            // Default constructor
+            any_iterator()
+                : m_impl(0) {}
+
+            // Simple copy construction without conversion
+            any_iterator(const any_iterator& other)
+                : base_type(other)
+                , m_impl(other.m_impl
+                            ? other.m_impl->clone(m_buffer)
+                            : 0)
+            {
+            }
+
+            // Simple assignment operator without conversion
+            any_iterator& operator=(const any_iterator& other)
+            {
+                if (this != &other)
+                {
+                    if (m_impl)
+                        m_impl->~abstract_base_type();
+                    m_buffer.deallocate();
+                    m_impl = 0;
+                    if (other.m_impl)
+                        m_impl = other.m_impl->clone(m_buffer);
+                }
+                return *this;
+            }
+
+            // Implicit conversion from another any_iterator where the
+            // conversion is from a non-const reference to a const reference
+            template<
+                class OtherValue
+              , class OtherTraversal
+              , class OtherReference
+              , class OtherDifference
+            >
+            any_iterator(const any_iterator<
+                                OtherValue,
+                                OtherTraversal,
+                                OtherReference,
+                                OtherDifference,
+                                Buffer
+                            >& other,
+                         typename enable_if<
+                            typename mpl::and_<
+                                typename is_mutable_reference<OtherReference>::type,
+                                typename is_const_reference<Reference>::type
+                            >::type,
+                            enabler
+                        >::type* = 0
+                    )
+                : m_impl(other.m_impl
+                            ? other.m_impl->clone_const_ref(m_buffer)
+                         : 0
+                        )
+            {
+            }
+
+            // Implicit conversion from another any_iterator where the
+            // reference types of the source and the target are references
+            // that are either both const, or both non-const.
+            template<
+                class OtherValue
+              , class OtherTraversal
+              , class OtherReference
+              , class OtherDifference
+            >
+            any_iterator(const any_iterator<
+                                OtherValue
+                              , OtherTraversal
+                              , OtherReference
+                              , OtherDifference
+                              , Buffer
+                            >& other,
+                         typename enable_if<
+                            typename mpl::or_<
+                                typename mpl::and_<
+                                    typename is_mutable_reference<OtherReference>::type,
+                                    typename is_mutable_reference<Reference>::type
+                                >::type,
+                                typename mpl::and_<
+                                    typename is_const_reference<OtherReference>::type,
+                                    typename is_const_reference<Reference>::type
+                                >::type
+                            >::type,
+                            enabler
+                        >::type* = 0
+                        )
+                : m_impl(other.m_impl
+                            ? other.m_impl->clone(m_buffer)
+                         : 0
+                        )
+            {
+            }
+
+            // Implicit conversion to an any_iterator that uses a value for
+            // the reference type.
+            template<
+                class OtherValue
+              , class OtherTraversal
+              , class OtherReference
+              , class OtherDifference
+            >
+            any_iterator(const any_iterator<
+                                OtherValue
+                              , OtherTraversal
+                              , OtherReference
+                              , OtherDifference
+                              , Buffer
+                            >& other,
+                        typename enable_if<
+                            typename is_convertible_to_value_as_reference<
+                                        OtherReference
+                                      , Reference
+                                    >::type,
+                            enabler
+                        >::type* = 0
+                        )
+                : m_impl(other.m_impl
+                            ? other.m_impl->clone_reference_as_value(m_buffer)
+                            : 0
+                            )
+            {
+            }
+
+            any_iterator clone() const
+            {
+                any_iterator result;
+                if (m_impl)
+                    result.m_impl = m_impl->clone(result.m_buffer);
+                return result;
+            }
+
+            any_iterator<
+                Value
+              , Traversal
+              , typename abstract_base_type::const_reference
+              , Difference
+              , Buffer
+            >
+            clone_const_ref() const
+            {
+                typedef any_iterator<
+                    Value
+                  , Traversal
+                  , typename abstract_base_type::const_reference
+                  , Difference
+                  , Buffer
+                > result_type;
+
+                result_type result;
+
+                if (m_impl)
+                    result.m_impl = m_impl->clone_const_ref(result.m_buffer);
+
+                return result;
+            }
+
+            // implicit conversion and construction from type-erasure-compatible
+            // iterators
+            template<class WrappedIterator>
+            explicit any_iterator(
+                const WrappedIterator& wrapped_iterator,
+                typename disable_if<
+                    typename is_any_iterator<WrappedIterator>::type
+                  , disabler
+                >::type* = 0
+                )
+            {
+                typedef typename any_iterator_wrapper_type_generator<
+                            WrappedIterator
+                          , Traversal
+                          , Reference
+                          , Difference
+                          , Buffer
+                        >::type wrapper_type;
+
+                void* ptr = m_buffer.allocate(sizeof(wrapper_type));
+                m_impl = new(ptr) wrapper_type(wrapped_iterator);
+            }
+
+            ~any_iterator()
+            {
+                // manually run the destructor, the deallocation is automatically
+                // handled by the any_iterator_small_buffer base class.
+                if (m_impl)
+                    m_impl->~abstract_base_type();
+            }
+
+        private:
+            friend class ::boost::iterator_core_access;
+
+            Reference dereference() const
+            {
+                BOOST_ASSERT( m_impl );
+                return m_impl->dereference();
+            }
+
+            bool equal(const any_iterator& other) const
+            {
+                return (m_impl == other.m_impl)
+                    || (m_impl && other.m_impl && m_impl->equal(*other.m_impl));
+            }
+
+            void increment()
+            {
+                BOOST_ASSERT( m_impl );
+                m_impl->increment();
+            }
+
+            void decrement()
+            {
+                BOOST_ASSERT( m_impl );
+                m_impl->decrement();
+            }
+
+            Difference distance_to(const any_iterator& other) const
+            {
+                return m_impl && other.m_impl
+                    ? m_impl->distance_to(*other.m_impl)
+                    : 0;
+            }
+
+            void advance(Difference offset)
+            {
+                BOOST_ASSERT( m_impl );
+                m_impl->advance(offset);
+            }
+
+            any_iterator& swap(any_iterator& other)
+            {
+                BOOST_ASSERT( this != &other );
+                // grab a temporary copy of the other iterator
+                any_iterator tmp(other);
+
+                // deallocate the other iterator, taking care to obey the
+                // class-invariants in-case of exceptions later
+                if (other.m_impl)
+                {
+                    other.m_impl->~abstract_base_type();
+                    other.m_buffer.deallocate();
+                    other.m_impl = 0;
+                }
+
+                // If this is a non-null iterator then we need to put
+                // a clone of this iterators impementation into the other
+                // iterator.
+                // We can't just swap because of the small buffer optimization.
+                if (m_impl)
+                {
+                    other.m_impl = m_impl->clone(other.m_buffer);
+                    m_impl->~abstract_base_type();
+                    m_buffer.deallocate();
+                    m_impl = 0;
+                }
+
+                // assign to this instance a clone of the temporarily held
+                // tmp which represents the input other parameter at the
+                // start of execution of this function.
+                if (tmp.m_impl)
+                    m_impl = tmp.m_impl->clone(m_buffer);
+
+                return *this;
+            }
+
+            buffer_type m_buffer;
+            abstract_base_type* m_impl;
+        };
+
+    } // namespace range_detail
+} // namespace boost
+
+#endif // include guard
diff --git a/include/boost/range/detail/any_iterator_buffer.hpp b/include/boost/range/detail/any_iterator_buffer.hpp
new file mode 100644
index 0000000..26c1420
--- /dev/null
+++ b/include/boost/range/detail/any_iterator_buffer.hpp
@@ -0,0 +1,117 @@
+// Boost.Range library
+//
+//  Copyright Neil Groves 2010. 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/
+//
+#ifndef BOOST_RANGE_DETAIL_ANY_ITERATOR_BUFFER_HPP_INCLUDED
+#define BOOST_RANGE_DETAIL_ANY_ITERATOR_BUFFER_HPP_INCLUDED
+
+#include <boost/array.hpp>
+#include <boost/assert.hpp>
+#include <boost/static_assert.hpp>
+#include <boost/utility.hpp>
+
+namespace boost
+{
+    template<std::size_t StackBufferSize>
+    class any_iterator_buffer
+        : noncopyable
+    {
+        BOOST_STATIC_ASSERT(( StackBufferSize > 0 ));
+    public:
+        any_iterator_buffer()
+            : m_ptr()
+        {
+        }
+
+        ~any_iterator_buffer()
+        {
+            delete [] m_ptr;
+        }
+
+        void* allocate(std::size_t bytes)
+        {
+            BOOST_ASSERT( !m_ptr );
+            if (bytes <= StackBufferSize)
+                return m_buffer.data();
+
+            m_ptr = new char[bytes];
+            return m_ptr;
+        }
+
+        void deallocate()
+        {
+            delete [] m_ptr;
+            m_ptr = 0;
+        }
+
+    private:
+        // Rationale:
+        // Do not use inheritance from noncopyable because this causes
+        // the concepts to erroneous detect the derived any_iterator
+        // as noncopyable.
+        any_iterator_buffer(const any_iterator_buffer&);
+        void operator=(const any_iterator_buffer&);
+
+        char* m_ptr;
+        boost::array<char, StackBufferSize> m_buffer;
+    };
+
+    class any_iterator_heap_only_buffer
+        : noncopyable
+    {
+    public:
+        any_iterator_heap_only_buffer()
+            : m_ptr()
+        {
+        }
+
+        ~any_iterator_heap_only_buffer()
+        {
+            delete [] m_ptr;
+        }
+
+        void* allocate(std::size_t bytes)
+        {
+            BOOST_ASSERT( !m_ptr );
+            m_ptr = new char[bytes];
+            return m_ptr;
+        }
+
+        void deallocate()
+        {
+            delete [] m_ptr;
+            m_ptr = 0;
+        }
+
+    private:
+        char* m_ptr;
+    };
+
+    template<std::size_t StackBufferSize>
+    class any_iterator_stack_only_buffer
+    {
+        BOOST_STATIC_ASSERT(( StackBufferSize > 0 ));
+    public:
+        void* allocate(std::size_t bytes)
+        {
+            BOOST_ASSERT( bytes <= m_buffer.size() );
+            return m_buffer.data();
+        }
+
+        void deallocate()
+        {
+        }
+
+    private:
+        boost::array<char, StackBufferSize> m_buffer;
+    };
+
+    typedef any_iterator_buffer<64> any_iterator_default_buffer;
+} // namespace boost
+
+#endif // include guard
diff --git a/include/boost/range/detail/any_iterator_interface.hpp b/include/boost/range/detail/any_iterator_interface.hpp
new file mode 100644
index 0000000..d8f4de7
--- /dev/null
+++ b/include/boost/range/detail/any_iterator_interface.hpp
@@ -0,0 +1,258 @@
+// Boost.Range library
+//
+//  Copyright Neil Groves 2010. 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/
+//
+#ifndef BOOST_RANGE_DETAIL_ANY_ITERATOR_INTERFACE_HPP_INCLUDED
+#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/type_traits/add_const.hpp>
+
+namespace boost
+{
+    namespace range_detail
+    {
+        template<class T>
+        struct const_reference_type_generator
+        {
+            typedef typename mpl::if_<
+                typename is_reference<T>::type,
+                typename add_reference<
+                    typename add_const<
+                        typename remove_reference<T>::type
+                    >::type
+                >::type,
+                T
+            >::type type;
+        };
+
+        template<
+            class Reference
+          , class Buffer
+        >
+        struct any_incrementable_iterator_interface
+        {
+            typedef Reference reference;
+            typedef typename const_reference_type_generator<
+                Reference
+            >::type const_reference;
+            typedef typename remove_const<
+                typename remove_reference<Reference>::type
+            >::type reference_as_value_type;
+
+            typedef Buffer buffer_type;
+
+            virtual ~any_incrementable_iterator_interface() {}
+
+            virtual any_incrementable_iterator_interface*
+                        clone(buffer_type& buffer) const = 0;
+
+            virtual any_incrementable_iterator_interface<const_reference, Buffer>*
+                        clone_const_ref(buffer_type& buffer) const = 0;
+
+            virtual any_incrementable_iterator_interface<reference_as_value_type, Buffer>*
+                        clone_reference_as_value(buffer_type& buffer) const = 0;
+
+            virtual void increment() = 0;
+        };
+
+        template<
+            class Reference
+          , class Buffer
+        >
+        struct any_single_pass_iterator_interface
+            : any_incrementable_iterator_interface<Reference, Buffer>
+        {
+            typedef typename any_incrementable_iterator_interface<Reference, Buffer>::reference reference;
+            typedef typename any_incrementable_iterator_interface<Reference, Buffer>::const_reference const_reference;
+            typedef typename any_incrementable_iterator_interface<Reference, Buffer>::buffer_type buffer_type;
+            typedef typename any_incrementable_iterator_interface<Reference, Buffer>::reference_as_value_type reference_as_value_type;
+
+            virtual any_single_pass_iterator_interface*
+                        clone(buffer_type& buffer) const = 0;
+
+            virtual any_single_pass_iterator_interface<const_reference, Buffer>*
+                        clone_const_ref(buffer_type& buffer) const = 0;
+
+            virtual any_single_pass_iterator_interface<reference_as_value_type, Buffer>*
+                        clone_reference_as_value(buffer_type& buffer) const = 0;
+
+            virtual Reference dereference() const = 0;
+
+            virtual bool equal(const any_single_pass_iterator_interface& other) const = 0;
+        };
+
+        template<
+            class Reference
+          , class Buffer
+        >
+        struct any_forward_iterator_interface
+            : any_single_pass_iterator_interface<Reference, Buffer>
+        {
+            typedef typename any_single_pass_iterator_interface<Reference, Buffer>::reference reference;
+            typedef typename any_single_pass_iterator_interface<Reference, Buffer>::const_reference const_reference;
+            typedef typename any_single_pass_iterator_interface<Reference, Buffer>::buffer_type buffer_type;
+            typedef typename any_single_pass_iterator_interface<Reference, Buffer>::reference_as_value_type reference_as_value_type;
+
+            virtual any_forward_iterator_interface*
+                        clone(buffer_type& buffer) const = 0;
+
+            virtual any_forward_iterator_interface<const_reference, Buffer>*
+                        clone_const_ref(buffer_type& buffer) const = 0;
+
+            virtual any_forward_iterator_interface<reference_as_value_type, Buffer>*
+                        clone_reference_as_value(buffer_type& buffer) const = 0;
+        };
+
+        template<
+            class Reference
+          , class Buffer
+        >
+        struct any_bidirectional_iterator_interface
+            : any_forward_iterator_interface<Reference, Buffer>
+        {
+            typedef typename any_forward_iterator_interface<Reference, Buffer>::reference reference;
+            typedef typename any_forward_iterator_interface<Reference, Buffer>::const_reference const_reference;
+            typedef typename any_forward_iterator_interface<Reference, Buffer>::buffer_type buffer_type;
+            typedef typename any_forward_iterator_interface<Reference, Buffer>::reference_as_value_type reference_as_value_type;
+
+            virtual any_bidirectional_iterator_interface*
+                        clone(buffer_type& buffer) const = 0;
+
+            virtual any_bidirectional_iterator_interface<const_reference, Buffer>*
+                        clone_const_ref(buffer_type& buffer) const = 0;
+
+            virtual any_bidirectional_iterator_interface<reference_as_value_type, Buffer>*
+                        clone_reference_as_value(buffer_type& buffer) const = 0;
+
+            virtual void decrement() = 0;
+        };
+
+        template<
+            class Reference
+          , class Difference
+          , class Buffer
+        >
+        struct any_random_access_iterator_interface
+            : any_bidirectional_iterator_interface<
+                    Reference
+                  , Buffer
+                >
+        {
+            typedef typename any_bidirectional_iterator_interface<Reference, Buffer>::reference reference;
+            typedef typename any_bidirectional_iterator_interface<Reference, Buffer>::const_reference const_reference;
+            typedef typename any_bidirectional_iterator_interface<Reference, Buffer>::buffer_type buffer_type;
+            typedef typename any_bidirectional_iterator_interface<Reference, Buffer>::reference_as_value_type reference_as_value_type;
+            typedef Difference difference_type;
+
+            virtual any_random_access_iterator_interface*
+                        clone(buffer_type& buffer) const = 0;
+
+            virtual any_random_access_iterator_interface<const_reference, Difference, Buffer>*
+                        clone_const_ref(buffer_type& buffer) const = 0;
+
+            virtual any_random_access_iterator_interface<reference_as_value_type, Difference, Buffer>*
+                        clone_reference_as_value(buffer_type& buffer) const = 0;
+
+            virtual void advance(Difference offset) = 0;
+
+            virtual Difference distance_to(const any_random_access_iterator_interface& other) const = 0;
+        };
+
+        template<
+            class Traversal
+          , class Reference
+          , class Difference
+          , class Buffer
+        >
+        struct any_iterator_interface_type_generator;
+
+        template<
+            class Reference
+          , class Difference
+          , class Buffer
+        >
+        struct any_iterator_interface_type_generator<
+                    incrementable_traversal_tag
+                  , Reference
+                  , Difference
+                  , Buffer
+                >
+        {
+            typedef any_incrementable_iterator_interface<Reference, Buffer> type;
+        };
+
+        template<
+            class Reference
+          , class Difference
+          , class Buffer
+        >
+        struct any_iterator_interface_type_generator<
+                    single_pass_traversal_tag
+                  , Reference
+                  , Difference
+                  , Buffer
+                >
+        {
+            typedef any_single_pass_iterator_interface<Reference, Buffer> type;
+        };
+
+        template<
+            class Reference
+          , class Difference
+          , class Buffer
+        >
+        struct any_iterator_interface_type_generator<
+                    forward_traversal_tag
+                  , Reference
+                  , Difference
+                  , Buffer
+                >
+        {
+            typedef any_forward_iterator_interface<Reference, Buffer> type;
+        };
+
+        template<
+            class Reference
+          , class Difference
+          , class Buffer
+        >
+        struct any_iterator_interface_type_generator<
+                    bidirectional_traversal_tag
+                  , Reference
+                  , Difference
+                  , Buffer
+                >
+        {
+            typedef any_bidirectional_iterator_interface<Reference, Buffer> type;
+        };
+
+        template<
+            class Reference
+          , class Difference
+          , class Buffer
+        >
+        struct any_iterator_interface_type_generator<
+                    random_access_traversal_tag
+                  , Reference
+                  , Difference
+                  , Buffer
+                >
+        {
+            typedef any_random_access_iterator_interface<
+                        Reference
+                      , Difference
+                      , Buffer
+                    > type;
+        };
+
+    } // namespace range_detail
+} // namespace boost
+
+#endif // include guard
diff --git a/include/boost/range/detail/any_iterator_wrapper.hpp b/include/boost/range/detail/any_iterator_wrapper.hpp
new file mode 100644
index 0000000..b5313a7
--- /dev/null
+++ b/include/boost/range/detail/any_iterator_wrapper.hpp
@@ -0,0 +1,590 @@
+// Boost.Range library
+//
+//  Copyright Neil Groves 2010. 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/
+//
+#ifndef BOOST_RANGE_DETAIL_ANY_ITERATOR_WRAPPER_HPP_INCLUDED
+#define BOOST_RANGE_DETAIL_ANY_ITERATOR_WRAPPER_HPP_INCLUDED
+
+#include <boost/range/config.hpp>
+#include <boost/range/detail/any_iterator_interface.hpp>
+
+namespace boost
+{
+    namespace range_detail
+    {
+        template<
+            class WrappedIterator
+          , class Reference
+          , class Buffer
+        >
+        class any_incrementable_iterator_wrapper
+            : public any_incrementable_iterator_interface<
+                        Reference
+                      , Buffer
+                    >
+        {
+            BOOST_RANGE_CONCEPT_ASSERT(( IncrementableIteratorConcept<WrappedIterator> ));
+        public:
+            typedef WrappedIterator wrapped_type;
+
+            BOOST_STATIC_ASSERT(( is_convertible<
+                                    typename iterator_reference<WrappedIterator>::type
+                                  , Reference
+                                  >::value ));
+
+            any_incrementable_iterator_wrapper()
+                : m_it()
+            {}
+
+            explicit any_incrementable_iterator_wrapper(wrapped_type it)
+                : m_it(it)
+            {}
+
+        // any_incrementable_iterator implementation
+            virtual any_incrementable_iterator_wrapper* clone(
+                typename any_incrementable_iterator_wrapper::buffer_type& buffer
+                ) const
+            {
+                return new (buffer.allocate(sizeof(*this)))
+                                any_incrementable_iterator_wrapper(m_it);
+            }
+
+            virtual any_incrementable_iterator_wrapper<
+                        WrappedIterator
+                      , typename any_incrementable_iterator_wrapper::const_reference
+                      , Buffer
+                    >* clone_const_ref(
+                        typename any_incrementable_iterator_wrapper::buffer_type& buffer
+                ) const
+            {
+                typedef any_incrementable_iterator_wrapper<
+                            WrappedIterator
+                          , typename any_incrementable_iterator_wrapper::const_reference
+                          , Buffer
+                        > result_type;
+
+                return new (buffer.allocate(sizeof(result_type)))
+                            result_type(m_it);
+            }
+
+            virtual any_incrementable_iterator_wrapper<
+                        WrappedIterator
+                      , typename any_incrementable_iterator_wrapper::reference_as_value_type
+                      , Buffer
+                    >* clone_reference_as_value(
+                        typename any_incrementable_iterator_wrapper::buffer_type& buffer
+                ) const
+            {
+                typedef any_incrementable_iterator_wrapper<
+                            WrappedIterator
+                          , typename any_incrementable_iterator_wrapper::reference_as_value_type
+                          , Buffer
+                        > result_type;
+
+                return new (buffer.allocate(sizeof(result_type)))
+                            result_type(m_it);
+            }
+
+            virtual void increment()
+            {
+                ++m_it;
+            }
+
+         private:
+            wrapped_type m_it;
+        };
+
+        template<
+            class WrappedIterator
+          , class Reference
+          , class Buffer
+        >
+        class any_single_pass_iterator_wrapper
+            : public any_single_pass_iterator_interface<
+                        Reference
+                      , Buffer
+                    >
+        {
+            struct disabler {};
+            BOOST_RANGE_CONCEPT_ASSERT(( SinglePassIteratorConcept<WrappedIterator> ));
+        public:
+
+            any_single_pass_iterator_wrapper()
+                : m_it()
+            {}
+
+            explicit any_single_pass_iterator_wrapper(const WrappedIterator& it)
+                : m_it(it)
+            {}
+        // any_single_pass_iterator_interface<Reference> implementation
+            virtual any_single_pass_iterator_wrapper* clone(
+                typename any_single_pass_iterator_wrapper::buffer_type& buffer
+                ) const
+            {
+                return new (buffer.allocate(sizeof(*this)))
+                            any_single_pass_iterator_wrapper(m_it);
+            }
+
+            virtual any_single_pass_iterator_wrapper<
+                WrappedIterator
+              , typename any_single_pass_iterator_wrapper::const_reference
+              , Buffer
+            >* clone_const_ref(
+                   typename any_single_pass_iterator_wrapper::buffer_type& buffer
+                   ) const
+            {
+                typedef any_single_pass_iterator_wrapper<
+                            WrappedIterator
+                          , typename any_single_pass_iterator_wrapper::const_reference
+                          , Buffer
+                        > result_type;
+
+                return new (buffer.allocate(sizeof(result_type)))
+                            result_type(m_it);
+            }
+
+            virtual any_single_pass_iterator_wrapper<
+                WrappedIterator
+              , typename any_single_pass_iterator_wrapper::reference_as_value_type
+              , Buffer
+            >* clone_reference_as_value(
+                typename any_single_pass_iterator_wrapper::buffer_type& buffer
+                ) const
+            {
+                typedef any_single_pass_iterator_wrapper<
+                            WrappedIterator
+                          , typename any_single_pass_iterator_wrapper::reference_as_value_type
+                          , Buffer
+                        > result_type;
+
+                return new (buffer.allocate(sizeof(result_type)))
+                            result_type(m_it);
+            }
+
+            virtual void increment()
+            {
+                ++m_it;
+            }
+
+            virtual bool equal(const any_single_pass_iterator_interface<Reference, Buffer>& other) const
+            {
+                return m_it == boost::polymorphic_downcast<const any_single_pass_iterator_wrapper*>(&other)->m_it;
+            }
+
+            virtual Reference dereference() const
+            {
+                return *m_it;
+            }
+
+        private:
+            WrappedIterator m_it;
+        };
+
+        template<
+            class WrappedIterator
+          , class Reference
+          , class Buffer
+        >
+        class any_forward_iterator_wrapper
+            : public any_forward_iterator_interface<
+                        Reference
+                      , Buffer
+                    >
+        {
+            BOOST_RANGE_CONCEPT_ASSERT(( ForwardIteratorConcept<WrappedIterator> ));
+        public:
+            any_forward_iterator_wrapper()
+                : m_it()
+            {}
+
+            explicit any_forward_iterator_wrapper(const WrappedIterator& it)
+                : m_it(it)
+            {}
+
+            // any_forward_iterator_interface<Reference> implementation
+            virtual any_forward_iterator_wrapper* clone(
+                typename any_forward_iterator_wrapper::buffer_type& buffer
+                ) const
+            {
+                return new (buffer.allocate(sizeof(*this)))
+                                any_forward_iterator_wrapper(m_it);
+            }
+
+            virtual any_forward_iterator_wrapper<
+                        WrappedIterator
+                      , typename any_forward_iterator_wrapper::const_reference
+                      , Buffer
+                    >* clone_const_ref(
+                            typename any_forward_iterator_wrapper::buffer_type& buffer
+                        ) const
+            {
+                typedef any_forward_iterator_wrapper<
+                            WrappedIterator
+                          , typename any_forward_iterator_wrapper::const_reference
+                          , Buffer
+                        > result_type;
+
+                return new (buffer.allocate(sizeof(result_type)))
+                            result_type(m_it);
+            }
+
+            virtual any_forward_iterator_wrapper<
+                        WrappedIterator
+                      , typename any_forward_iterator_wrapper::reference_as_value_type
+                      , Buffer
+                    >* clone_reference_as_value(
+                            typename any_forward_iterator_wrapper::buffer_type& buffer
+                    ) const
+            {
+                typedef any_forward_iterator_wrapper<
+                            WrappedIterator
+                          , typename any_forward_iterator_wrapper::reference_as_value_type
+                          , Buffer
+                        > result_type;
+
+                return new (buffer.allocate(sizeof(result_type)))
+                            result_type(m_it);
+            }
+
+            virtual void increment()
+            {
+                ++m_it;
+            }
+
+            virtual bool equal(const any_single_pass_iterator_interface<Reference, Buffer>& other) const
+            {
+                return m_it == boost::polymorphic_downcast<const any_forward_iterator_wrapper*>(&other)->m_it;
+            }
+
+            virtual Reference dereference() const
+            {
+                return *m_it;
+            }
+        private:
+            WrappedIterator m_it;
+        };
+
+        template<
+            class WrappedIterator
+          , class Reference
+          , class Buffer
+        >
+        class any_bidirectional_iterator_wrapper
+            : public any_bidirectional_iterator_interface<
+                        Reference
+                      , Buffer
+                    >
+        {
+            BOOST_RANGE_CONCEPT_ASSERT(( BidirectionalIteratorConcept<WrappedIterator> ));
+        public:
+            any_bidirectional_iterator_wrapper()
+                : m_it()
+            {
+            }
+
+            explicit any_bidirectional_iterator_wrapper(const WrappedIterator& it)
+                : m_it(it)
+            {
+            }
+
+            virtual any_bidirectional_iterator_wrapper* clone(
+                typename any_bidirectional_iterator_wrapper::buffer_type& buffer
+                ) const
+            {
+                return new (buffer.allocate(sizeof(*this)))
+                            any_bidirectional_iterator_wrapper(*this);
+            }
+
+            virtual any_bidirectional_iterator_wrapper<
+                        WrappedIterator
+                      , typename any_bidirectional_iterator_wrapper::const_reference
+                      , Buffer
+                    >* clone_const_ref(
+                           typename any_bidirectional_iterator_wrapper::buffer_type& buffer
+                       ) const
+            {
+                typedef any_bidirectional_iterator_wrapper<
+                            WrappedIterator
+                          , typename any_bidirectional_iterator_wrapper::const_reference
+                          , Buffer
+                        > result_type;
+
+                return new (buffer.allocate(sizeof(result_type)))
+                            result_type(m_it);
+            }
+
+            virtual any_bidirectional_iterator_wrapper<
+                        WrappedIterator
+                      , typename any_bidirectional_iterator_wrapper::reference_as_value_type
+                      , Buffer
+                    >* clone_reference_as_value(
+                           typename any_bidirectional_iterator_wrapper::buffer_type& buffer
+                       ) const
+            {
+                typedef any_bidirectional_iterator_wrapper<
+                            WrappedIterator
+                          , typename any_bidirectional_iterator_wrapper::reference_as_value_type
+                          , Buffer
+                        > result_type;
+
+                return new (buffer.allocate(sizeof(result_type)))
+                            result_type(m_it);
+            }
+
+            virtual void increment()
+            {
+                ++m_it;
+            }
+
+            virtual void decrement()
+            {
+                --m_it;
+            }
+
+            virtual bool equal(const any_single_pass_iterator_interface<Reference, Buffer>& other) const
+            {
+                return m_it == boost::polymorphic_downcast<const any_bidirectional_iterator_wrapper*>(&other)->m_it;
+            }
+
+            virtual Reference dereference() const
+            {
+                return *m_it;
+            }
+
+        private:
+            WrappedIterator m_it;
+        };
+
+        template<
+            class WrappedIterator
+          , class Reference
+          , class Difference
+          , class Buffer
+        >
+        class any_random_access_iterator_wrapper
+            : public any_random_access_iterator_interface<
+                            Reference
+                          , Difference
+                          , Buffer
+                        >
+        {
+            BOOST_RANGE_CONCEPT_ASSERT(( RandomAccessIteratorConcept<WrappedIterator> ));
+        public:
+            typedef Difference difference_type;
+
+            any_random_access_iterator_wrapper()
+                : m_it()
+            {
+            }
+
+            explicit any_random_access_iterator_wrapper(const WrappedIterator& other)
+                : m_it(other)
+            {
+            }
+
+            virtual any_random_access_iterator_wrapper* clone(
+                    typename any_random_access_iterator_wrapper::buffer_type& buffer
+                ) const
+            {
+                return new (buffer.allocate(sizeof(*this)))
+                                any_random_access_iterator_wrapper(*this);
+            }
+
+            virtual any_random_access_iterator_wrapper<
+                        WrappedIterator
+                      , typename any_random_access_iterator_wrapper::const_reference
+                      , Difference
+                      , Buffer
+                    >* clone_const_ref(
+                           typename any_random_access_iterator_wrapper::buffer_type& buffer
+                           ) const
+            {
+                typedef any_random_access_iterator_wrapper<
+                            WrappedIterator
+                          , typename any_random_access_iterator_wrapper::const_reference
+                          , Difference
+                          , Buffer
+                        > result_type;
+
+                return new (buffer.allocate(sizeof(result_type)))
+                            result_type(m_it);
+            }
+
+            virtual any_random_access_iterator_wrapper<
+                        WrappedIterator
+                      , typename any_random_access_iterator_wrapper::reference_as_value_type
+                      , Difference
+                      , Buffer
+                    >* clone_reference_as_value(
+                           typename any_random_access_iterator_wrapper::buffer_type& buffer
+                           ) const
+            {
+                typedef any_random_access_iterator_wrapper<
+                            WrappedIterator
+                          , typename any_random_access_iterator_wrapper::reference_as_value_type
+                          , Difference
+                          , Buffer
+                        > result_type;
+
+                return new (buffer.allocate(sizeof(result_type)))
+                            result_type(m_it);
+            }
+
+            virtual void increment()
+            {
+                ++m_it;
+            }
+
+            virtual bool equal(const any_single_pass_iterator_interface<Reference, Buffer>& other) const
+            {
+                return m_it == boost::polymorphic_downcast<const any_random_access_iterator_wrapper*>(&other)->m_it;
+            }
+
+            virtual void decrement()
+            {
+                --m_it;
+            }
+
+            virtual void advance(Difference offset)
+            {
+                m_it += offset;
+            }
+
+            virtual Reference dereference() const
+            {
+                return *m_it;
+            }
+
+            virtual Difference distance_to(const any_random_access_iterator_interface<Reference, Difference, Buffer>& other) const
+            {
+                return boost::polymorphic_downcast<const any_random_access_iterator_wrapper*>(&other)->m_it - m_it;
+            }
+
+        private:
+            WrappedIterator m_it;
+        };
+
+        template<
+            class WrappedIterator
+          , class Traversal
+          , class Reference
+          , class Difference
+          , class Buffer
+        >
+        struct any_iterator_wrapper_type_generator;
+
+        template<
+            class WrappedIterator
+          , class Reference
+          , class Difference
+          , class Buffer
+        >
+        struct any_iterator_wrapper_type_generator<
+            WrappedIterator
+          , incrementable_traversal_tag
+          , Reference
+          , Difference
+          , Buffer
+        >
+        {
+            typedef any_incrementable_iterator_wrapper<
+                        WrappedIterator
+                      , Reference
+                      , Buffer
+                    > type;
+        };
+
+        template<
+            class WrappedIterator
+          , class Reference
+          , class Difference
+          , class Buffer
+        >
+        struct any_iterator_wrapper_type_generator<
+            WrappedIterator
+          , single_pass_traversal_tag
+          , Reference
+          , Difference
+          , Buffer
+        >
+        {
+            typedef any_single_pass_iterator_wrapper<
+                        WrappedIterator
+                      , Reference
+                      , Buffer
+                > type;
+        };
+
+        template<
+            class WrappedIterator
+          , class Reference
+          , class Difference
+          , class Buffer
+        >
+        struct any_iterator_wrapper_type_generator<
+            WrappedIterator
+          , forward_traversal_tag
+          , Reference
+          , Difference
+          , Buffer
+        >
+        {
+            typedef any_forward_iterator_wrapper<
+                WrappedIterator
+              , Reference
+              , Buffer
+            > type;
+        };
+
+        template<
+            class WrappedIterator
+          , class Reference
+          , class Difference
+          , class Buffer
+        >
+        struct any_iterator_wrapper_type_generator<
+            WrappedIterator
+          , bidirectional_traversal_tag
+          , Reference
+          , Difference
+          , Buffer
+        >
+        {
+            typedef any_bidirectional_iterator_wrapper<
+                WrappedIterator
+              , Reference
+              , Buffer
+            > type;
+        };
+
+        template<
+            class WrappedIterator
+          , class Reference
+          , class Difference
+          , class Buffer
+        >
+        struct any_iterator_wrapper_type_generator<
+            WrappedIterator
+          , random_access_traversal_tag
+          , Reference
+          , Difference
+          , Buffer
+        >
+        {
+            typedef any_random_access_iterator_wrapper<
+                WrappedIterator
+              , Reference
+              , Difference
+              , Buffer
+            > type;
+        };
+
+    } // namespace range_detail
+} // namespace boost
+
+#endif // include guard
diff --git a/include/boost/range/detail/begin.hpp b/include/boost/range/detail/begin.hpp
old mode 100755
new mode 100644
index 06c2561..f3da732
--- a/include/boost/range/detail/begin.hpp
+++ b/include/boost/range/detail/begin.hpp
@@ -19,9 +19,9 @@
 # include <boost/range/value_type.hpp>
 #endif
 
-namespace boost 
+namespace boost
 {
-    
+
     namespace range_detail
     {
         template< typename T >
@@ -30,7 +30,7 @@ namespace boost
         //////////////////////////////////////////////////////////////////////
         // default
         //////////////////////////////////////////////////////////////////////
-        
+
         template<>
         struct range_begin<std_container_>
         {
@@ -40,11 +40,11 @@ namespace boost
                 return c.begin();
             };
         };
-                    
+
         //////////////////////////////////////////////////////////////////////
         // pair
         //////////////////////////////////////////////////////////////////////
-        
+
         template<>
         struct range_begin<std_pair_>
         {
@@ -54,11 +54,11 @@ namespace boost
                 return p.first;
             }
         };
- 
+
         //////////////////////////////////////////////////////////////////////
         // array
         //////////////////////////////////////////////////////////////////////
-        
+
         template<>
         struct range_begin<array_>
         {
@@ -78,14 +78,16 @@ namespace boost
         };
 
     } // namespace 'range_detail'
-    
-    template< typename C >
-    inline BOOST_RANGE_DEDUCED_TYPENAME range_iterator<C>::type 
-    begin( C& c )
+
+    namespace range_adl_barrier
     {
-        return range_detail::range_begin< BOOST_RANGE_DEDUCED_TYPENAME range_detail::range<C>::type >::fun( c );
+        template< typename C >
+        inline BOOST_RANGE_DEDUCED_TYPENAME range_iterator<C>::type
+        begin( C& c )
+        {
+            return range_detail::range_begin< BOOST_RANGE_DEDUCED_TYPENAME range_detail::range<C>::type >::fun( c );
+        }
     }
-    
 } // namespace 'boost'
 
 
diff --git a/include/boost/range/detail/end.hpp b/include/boost/range/detail/end.hpp
old mode 100755
new mode 100644
index d6a7368..8b5f35d
--- a/include/boost/range/detail/end.hpp
+++ b/include/boost/range/detail/end.hpp
@@ -24,7 +24,7 @@
 #  include <boost/range/detail/remove_extent.hpp>
 # endif
 
-namespace boost 
+namespace boost
 {
     namespace range_detail
     {
@@ -34,39 +34,39 @@ namespace boost
         //////////////////////////////////////////////////////////////////////
         // default
         //////////////////////////////////////////////////////////////////////
-        
+
         template<>
         struct range_end<std_container_>
         {
             template< typename C >
-            static BOOST_RANGE_DEDUCED_TYPENAME range_iterator<C>::type 
+            static BOOST_RANGE_DEDUCED_TYPENAME range_iterator<C>::type
             fun( C& c )
             {
                 return c.end();
             };
         };
-                    
+
         //////////////////////////////////////////////////////////////////////
         // pair
         //////////////////////////////////////////////////////////////////////
-        
+
         template<>
         struct range_end<std_pair_>
         {
             template< typename P >
-            static BOOST_RANGE_DEDUCED_TYPENAME range_iterator<P>::type 
+            static BOOST_RANGE_DEDUCED_TYPENAME range_iterator<P>::type
             fun( const P& p )
             {
                 return p.second;
             }
         };
- 
+
         //////////////////////////////////////////////////////////////////////
         // array
         //////////////////////////////////////////////////////////////////////
-        
+
         template<>
-        struct range_end<array_>  
+        struct range_end<array_>
         {
         #if !BOOST_WORKAROUND(BOOST_MSVC, < 1310)
             template< typename T, std::size_t sz >
@@ -82,16 +82,19 @@ namespace boost
             }
         #endif
         };
-        
+
     } // namespace 'range_detail'
-    
-    template< typename C >
-    inline BOOST_RANGE_DEDUCED_TYPENAME range_iterator<C>::type 
-    end( C& c )
+
+    namespace range_adl_barrier
     {
-        return range_detail::range_end< BOOST_RANGE_DEDUCED_TYPENAME range_detail::range<C>::type >::fun( c );
-    }
-    
+        template< typename C >
+        inline BOOST_RANGE_DEDUCED_TYPENAME range_iterator<C>::type
+        end( C& c )
+        {
+            return range_detail::range_end< BOOST_RANGE_DEDUCED_TYPENAME range_detail::range<C>::type >::fun( c );
+        }
+    } // namespace range_adl_barrier
+
 } // namespace 'boost'
 
 # endif // VC6
diff --git a/include/boost/range/detail/safe_bool.hpp b/include/boost/range/detail/safe_bool.hpp
new file mode 100644
index 0000000..182e510
--- /dev/null
+++ b/include/boost/range/detail/safe_bool.hpp
@@ -0,0 +1,72 @@
+//  This header intentionally has no include guards.
+//
+//  Copyright (c) 2010 Neil Groves
+//  Distributed under the Boost Software License, Version 1.0.
+//  See accompanying file LICENSE_1_0.txt or copy at
+//  http://www.boost.org/LICENSE_1_0.txt
+//
+// This code utilises the experience gained during the evolution of
+// <boost/smart_ptr/operator_bool.hpp>
+#ifndef BOOST_RANGE_SAFE_BOOL_INCLUDED_HPP
+#define BOOST_RANGE_SAFE_BOOL_INCLUDED_HPP
+
+#include <boost/config.hpp>
+#include <boost/range/config.hpp>
+
+namespace boost
+{
+    namespace range_detail
+    {
+
+template<class DataMemberPtr>
+class safe_bool
+{
+public:
+    typedef safe_bool this_type;
+
+#if (defined(__SUNPRO_CC) && BOOST_WORKAROUND(__SUNPRO_CC, < 0x570)) || defined(__CINT_)
+    typedef bool unspecified_bool_type;
+    static unspecified_bool_type to_unspecified_bool(const bool x, DataMemberPtr)
+    {
+        return x;
+    }
+#elif defined(_MANAGED)
+    static void unspecified_bool(this_type***)
+    {
+    }
+    typedef void(*unspecified_bool_type)(this_type***);
+    static unspecified_bool_type to_unspecified_bool(const bool x, DataMemberPtr)
+    {
+        return x ? unspecified_bool : 0;
+    }
+#elif \
+    ( defined(__MWERKS__) && BOOST_WORKAROUND(__MWERKS__, < 0x3200) ) || \
+    ( defined(__GNUC__) && (__GNUC__ * 100 + __GNUC_MINOR__ < 304) ) || \
+    ( defined(__SUNPRO_CC) && BOOST_WORKAROUND(__SUNPRO_CC, <= 0x590) )
+
+    typedef bool (this_type::*unspecified_bool_type)() const;
+
+    static unspecified_bool_type to_unspecified_bool(const bool x, DataMemberPtr)
+    {
+        return x ? &this_type::detail_safe_bool_member_fn : 0;
+    }
+private:
+    bool detail_safe_bool_member_fn() const { return false; }
+#else
+    typedef DataMemberPtr unspecified_bool_type;
+    static unspecified_bool_type to_unspecified_bool(const bool x, DataMemberPtr p)
+    {
+        return x ? p : 0;
+    }
+#endif
+private:
+    safe_bool();
+    safe_bool(const safe_bool&);
+    void operator=(const safe_bool&);
+    ~safe_bool();
+};
+
+    } // namespace range_detail
+} // namespace boost
+
+#endif // include guard
diff --git a/include/boost/range/end.hpp b/include/boost/range/end.hpp
index 3063c02..d5e6526 100644
--- a/include/boost/range/end.hpp
+++ b/include/boost/range/end.hpp
@@ -88,6 +88,9 @@ namespace range_detail
 } // namespace 'range_detail'
 #endif
 
+namespace range_adl_barrier
+{
+
 template< class T >
 inline BOOST_DEDUCED_TYPENAME range_iterator<T>::type end( T& r )
 {
@@ -110,22 +113,24 @@ inline BOOST_DEDUCED_TYPENAME range_iterator<const T>::type end( const T& r )
     return range_end( r );
 }
 
+    } // namespace range_adl_barrier
 } // namespace 'boost'
 
-
-
 #endif // BOOST_NO_FUNCTION_TEMPLATE_ORDERING
 
-
 namespace boost
 {
-    template< class T >
-    inline BOOST_DEDUCED_TYPENAME range_iterator<const T>::type
-    const_end( const T& r )
+    namespace range_adl_barrier
     {
-        return boost::end( r );
-    }
-}
+        template< class T >
+        inline BOOST_DEDUCED_TYPENAME range_iterator<const T>::type
+        const_end( const T& r )
+        {
+            return boost::range_adl_barrier::end( r );
+        }
+    } // namespace range_adl_barrier
+    using namespace range_adl_barrier;
+} // namespace boost
 
 #endif
 
diff --git a/include/boost/range/iterator_range_core.hpp b/include/boost/range/iterator_range_core.hpp
index ab1e80e..7664c2e 100755
--- a/include/boost/range/iterator_range_core.hpp
+++ b/include/boost/range/iterator_range_core.hpp
@@ -27,6 +27,7 @@
 #include <boost/range/iterator.hpp>
 #include <boost/range/difference_type.hpp>
 #include <boost/range/algorithm/equal.hpp>
+#include <boost/range/detail/safe_bool.hpp>
 #include <boost/utility/enable_if.hpp>
 #include <iterator>
 #include <algorithm>
@@ -81,7 +82,6 @@ namespace boost
 
         struct range_tag { };
         struct const_range_tag { };
-
     }
 
 //  iterator range template class -----------------------------------------//
@@ -106,13 +106,14 @@ namespace boost
         template<class IteratorT>
         class iterator_range
         {
+            typedef range_detail::safe_bool< IteratorT iterator_range<IteratorT>::* > safe_bool_t;
         protected: // Used by sub_range
             //! implementation class
             typedef iterator_range_detail::iterator_range_impl<IteratorT> impl;
         public:
-
             //! this type
             typedef iterator_range<IteratorT> type;
+            typedef BOOST_DEDUCED_TYPENAME safe_bool_t::unspecified_bool_type unspecified_bool_type;
             //BOOST_BROKEN_COMPILER_TYPE_TRAITS_SPECIALIZATION(value_type);
 
             //! Encapsulated value type
@@ -238,18 +239,15 @@ namespace boost
                 return m_Begin == m_End;
             }
 
-#if BOOST_WORKAROUND(__BORLANDC__, BOOST_TESTED_AT(0x564))
-            operator bool() const
-            {
-                return !empty();
-            }
-#else
-            typedef iterator (iterator_range::*unspecified_bool_type) () const;
             operator unspecified_bool_type() const
             {
-                return empty() ? 0: &iterator_range::end;
+                return safe_bool_t::to_unspecified_bool(m_Begin != m_End, &iterator_range::m_Begin);
+            }
+
+            bool operator!() const
+            {
+                return empty();
             }
-#endif
 
             bool equal( const iterator_range& r ) const
             {
diff --git a/include/boost/range/size.hpp b/include/boost/range/size.hpp
index 2636905..4b4eebe 100644
--- a/include/boost/range/size.hpp
+++ b/include/boost/range/size.hpp
@@ -15,7 +15,7 @@
 # pragma once
 #endif
 
-#include <boost/iterator/iterator_categories.hpp>
+#include <boost/range/config.hpp>
 #include <boost/range/begin.hpp>
 #include <boost/range/end.hpp>
 #include <boost/range/difference_type.hpp>
@@ -25,44 +25,25 @@ namespace boost
 {
     namespace range_detail
     {
-        template< class SinglePassRange >
+        template<class SinglePassRange>
         inline BOOST_DEDUCED_TYPENAME range_difference<SinglePassRange>::type
-        size_impl(const SinglePassRange& rng, boost::single_pass_traversal_tag)
-        {
-            typedef BOOST_DEDUCED_TYPENAME range_difference<SinglePassRange>::type diff_t;
-
-            // A compilation error here will often indicate that an algorithm
-            // is attempting to use boost::size(rng) for a range that is not a
-            // model of the RandomAccessRange Concept and does not have a
-            // member size() function.
-            // The solution to this issue is to add a range_calculate_size()
-            // function for the range type that will be found via ADL.
-            return static_cast<diff_t>(rng.size());
-        }
-
-        template< class SinglePassRange >
-        inline BOOST_DEDUCED_TYPENAME range_difference<SinglePassRange>::type
-        size_impl(const SinglePassRange& rng, boost::random_access_traversal_tag)
+        range_calculate_size(const SinglePassRange& rng)
         {
             BOOST_ASSERT( (boost::end(rng) - boost::begin(rng)) >= 0 &&
                           "reachability invariant broken!" );
             return boost::end(rng) - boost::begin(rng);
         }
-    } // namespace range_detail
-
-    template<class SinglePassRange>
-    inline BOOST_DEDUCED_TYPENAME range_difference<SinglePassRange>::type
-    range_calculate_size(const SinglePassRange& rng)
-    {
-        typedef BOOST_DEDUCED_TYPENAME range_iterator<const SinglePassRange>::type iter_t;
-        typedef BOOST_DEDUCED_TYPENAME iterator_traversal<iter_t>::type traversal_tag;
-        return range_detail::size_impl(rng, traversal_tag());
     }
 
     template<class SinglePassRange>
     inline BOOST_DEDUCED_TYPENAME range_difference<SinglePassRange>::type
     size(const SinglePassRange& rng)
     {
+#if !BOOST_WORKAROUND(__BORLANDC__, BOOST_TESTED_AT(0x564)) && \
+    !BOOST_WORKAROUND(__GNUC__, < 3) \
+    /**/
+        using namespace range_detail;
+#endif
         return range_calculate_size(rng);
     }
 
diff --git a/test/Jamfile.v2 b/test/Jamfile.v2
index b52d869..e0087fb 100644
--- a/test/Jamfile.v2
+++ b/test/Jamfile.v2
@@ -59,6 +59,8 @@ 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/type_erased_example ]
 	[ range-test adaptor_test/uniqued_example ]
 	[ range-test algorithm_test/adjacent_find ]
 	[ range-test algorithm_test/binary_search ]
@@ -131,11 +133,13 @@ test-suite range :
 	[ range-test algorithm_example ]
 	[ range-test array ]
 #	[ range-test atl : <include>$(VC71_ROOT)/atlmfc/include ]
+    [ range-test begin ]
 	[ range-test combine ]
 	[ range-test compat2 ]
 	[ range-test compat3 ]
 	[ range-test const_ranges ]
 	[ range-test counting_range ]
+	[ range-test end ]
 	[ range-test extension_mechanism ]
 	[ range-test extension_size ]
 	[ range-test has_range_iterator ]
diff --git a/test/adaptor_test/strided.cpp b/test/adaptor_test/strided.cpp
index 04f1f21..91beb81 100644
--- a/test/adaptor_test/strided.cpp
+++ b/test/adaptor_test/strided.cpp
@@ -128,10 +128,10 @@ namespace boost
 
             typedef boost::strided_range<Container> strided_range_t;
             strided_range_t rng( boost::adaptors::stride(c, 0) );
-            typedef typename boost::range_iterator<strided_range_t>::type iter_t;
+            typedef BOOST_DEDUCED_TYPENAME boost::range_iterator<strided_range_t>::type iter_t;
 
-            iter_t first(boost::begin(c), 0, 0, boost::size(c));
-            iter_t last(boost::end(c), 0, boost::size(c), boost::size(c));
+            iter_t first(boost::begin(c), boost::begin(c), boost::end(c), 0);
+            iter_t last(boost::begin(c), boost::end(c), boost::end(c), 0);
 
             iter_t it = first;
             for (int i = 0; i < 10; ++i, ++it)
@@ -206,16 +206,6 @@ namespace boost
                 ++(this->base_reference());
             }
 
-            bool equal(const strided_mock_iterator& other) const
-            {
-                return this->base() == other.base();
-            }
-
-            BOOST_DEDUCED_TYPENAME super_t::reference dereference() const
-            {
-                return *(this->base());
-            }
-
             friend class boost::iterator_core_access;
         };
 
diff --git a/test/adaptor_test/type_erased.cpp b/test/adaptor_test/type_erased.cpp
new file mode 100644
index 0000000..fd3ee5f
--- /dev/null
+++ b/test/adaptor_test/type_erased.cpp
@@ -0,0 +1,481 @@
+// Boost.Range library
+//
+//  Copyright Neil Groves 2010. Use, modification and
+//  distribution is subject to the Boost Software License, Version
+//  1.0. (See accompanying file LICENSE_1_0.txt or copy at
+//  http://www.boost.org/LICENSE_1_0.txt)
+//
+#include <boost/range/adaptor/type_erased.hpp>
+
+#include <boost/test/test_tools.hpp>
+#include <boost/test/unit_test.hpp>
+
+#include <boost/range/algorithm_ext.hpp>
+#include <boost/range/algorithm/fill.hpp>
+#include <boost/assign.hpp>
+#include <boost/array.hpp>
+
+#include <algorithm>
+#include <list>
+#include <set>
+#include <vector>
+
+namespace boost_range_adaptor_type_erased_test
+{
+    class MockType
+    {
+    public:
+        MockType()
+            : m_x(0)
+        {
+        }
+
+        MockType(int x)
+            : m_x(x)
+        {
+        }
+
+        int get() const { return m_x; }
+
+        inline bool operator==(const MockType& other) const
+        {
+            return m_x == other.m_x;
+        }
+
+        inline bool operator!=(const MockType& other) const
+        {
+            return m_x != other.m_x;
+        }
+
+    private:
+        int m_x;
+    };
+
+    inline std::ostream& operator<<(std::ostream& out, const MockType& obj)
+    {
+        out << obj.get();
+        return out;
+    }
+
+    template<class Container>
+    void test_type_erased_impl(Container& c)
+    {
+        using namespace boost::adaptors;
+        typedef typename boost::range_value<Container>::type value_type;
+        typedef typename boost::adaptors::type_erased<> type_erased_t;
+
+
+        std::vector<value_type> output;
+
+        boost::push_back(output, boost::adaptors::type_erase(c, type_erased_t()));
+
+        BOOST_CHECK_EQUAL_COLLECTIONS( output.begin(), output.end(),
+                                       c.begin(), c.end() );
+
+        output.clear();
+        boost::push_back(output, c | type_erased_t());
+
+        BOOST_CHECK_EQUAL_COLLECTIONS( output.begin(), output.end(),
+                                       c.begin(), c.end() );
+    }
+
+    template<class Container>
+    void test_const_and_mutable(Container& c)
+    {
+        test_type_erased_impl(c);
+
+        const Container& const_c = c;
+        test_type_erased_impl(const_c);
+    }
+
+    template<class Container>
+    void test_driver()
+    {
+        using namespace boost::assign;
+
+        typedef typename boost::range_value<Container>::type value_type;
+
+        Container c;
+        test_const_and_mutable(c);
+
+        c += value_type(1);
+        test_const_and_mutable(c);
+
+        c += value_type(2);
+        test_const_and_mutable(c);
+    }
+
+    void test_type_erased()
+    {
+        test_driver< std::list<int> >();
+        test_driver< std::vector<int> >();
+
+        test_driver< std::list<MockType> >();
+        test_driver< std::vector<MockType> >();
+    }
+
+    template<
+        class Traversal
+      , class Container
+    >
+    void test_writeable(Container&, boost::single_pass_traversal_tag)
+    {}
+
+    template<
+        class Traversal
+      , class Container
+    >
+    void test_writeable(Container& source, boost::forward_traversal_tag)
+    {
+        using namespace boost::adaptors;
+
+        typedef typename boost::range_value<Container>::type value_type;
+        typedef typename boost::range_difference<Container>::type difference_type;
+        typedef typename boost::range_reference<Container>::type mutable_reference_type;
+        typedef boost::any_range<
+                    value_type
+                  , Traversal
+                  , mutable_reference_type
+                  , difference_type
+                > mutable_any_range;
+
+        mutable_any_range r = source | boost::adaptors::type_erased<>();
+        std::vector<value_type> output_test;
+        boost::fill(r, value_type(1));
+        BOOST_CHECK_EQUAL( boost::distance(r), boost::distance(source) );
+        std::vector<value_type> reference_output(source.size(), value_type(1));
+        BOOST_CHECK_EQUAL_COLLECTIONS( reference_output.begin(), reference_output.end(),
+                                       r.begin(), r.end() );
+
+    }
+
+    template<
+        class Container
+      , class Traversal
+      , class Buffer
+    >
+    void test_type_erased_impl()
+    {
+        using namespace boost::adaptors;
+
+        typedef Buffer buffer_type;
+
+        typedef typename boost::range_value<Container>::type value_type;
+
+        typedef typename boost::any_range_type_generator<
+            Container
+          , boost::use_default
+          , Traversal
+          , boost::use_default
+          , boost::use_default
+          , Buffer
+        >::type mutable_any_range;
+
+        typedef typename boost::any_range_type_generator<
+            const Container
+          , boost::use_default
+          , Traversal
+          , boost::use_default
+          , boost::use_default
+          , Buffer
+        >::type const_any_range;
+
+        typedef boost::adaptors::type_erased<
+                    boost::use_default
+                  , Traversal
+                  , boost::use_default
+                  , boost::use_default
+                  , Buffer
+                > type_erased_t;
+
+        Container source;
+        for (int i = 0; i < 10; ++i)
+            source.push_back(value_type(i));
+
+        mutable_any_range r(source);
+        BOOST_CHECK_EQUAL_COLLECTIONS( source.begin(), source.end(),
+                                       r.begin(), r.end() );
+
+        r = mutable_any_range();
+        BOOST_CHECK_EQUAL( r.empty(), true );
+
+        r = source | type_erased_t();
+        BOOST_CHECK_EQUAL_COLLECTIONS( source.begin(), source.end(),
+                                       r.begin(), r.end() );
+        r = mutable_any_range();
+
+        r = boost::adaptors::type_erase(source, type_erased_t());
+        BOOST_CHECK_EQUAL_COLLECTIONS( source.begin(), source.end(),
+                                       r.begin(), r.end() );
+        r = mutable_any_range();
+
+        test_writeable<Traversal>(source, Traversal());
+
+        // convert and construct a const any_range from a mutable source
+        // range
+        const_any_range cr(source);
+        BOOST_CHECK_EQUAL_COLLECTIONS( source.begin(), source.end(),
+                                       cr.begin(), cr.end() );
+        // assign an empty range and ensure that this correctly results
+        // in an empty range. This is important for the validity of
+        // the rest of the tests.
+        cr = const_any_range();
+        BOOST_CHECK_EQUAL( cr.empty(), true );
+
+        // Test the pipe type_erased adaptor from a constant source
+        // range to a constant any_range
+        const Container& const_source = source;
+        cr = const_any_range();
+        cr = const_source | type_erased_t();
+        BOOST_CHECK_EQUAL_COLLECTIONS( const_source.begin(), const_source.end(),
+                                       cr.begin(), cr.end() );
+
+        // Test the pipe type erased adaptor from a mutable source
+        // range to a constant any_range
+        cr = const_any_range();
+        cr = source | type_erased_t();
+        BOOST_CHECK_EQUAL_COLLECTIONS( source.begin(), source.end(),
+                                       cr.begin(), cr.end() );
+
+        // Use the function form of the type_erase adaptor from a constant
+        // source range
+        cr = const_any_range();
+        cr = boost::adaptors::type_erase(const_source, type_erased_t());
+        BOOST_CHECK_EQUAL_COLLECTIONS( const_source.begin(), const_source.end(),
+                                       cr.begin(), cr.end() );
+
+        // Assignment from mutable to const...
+        cr = const_any_range();
+        cr = r;
+        BOOST_CHECK_EQUAL_COLLECTIONS( cr.begin(), cr.end(),
+                                       r.begin(), r.end() );
+
+        // Converting copy from mutable to const...
+        cr = const_any_range();
+        cr = const_any_range(r);
+        BOOST_CHECK_EQUAL_COLLECTIONS( cr.begin(), cr.end(),
+                                       r.begin(), r.end() );
+    }
+
+    template<
+        class Container
+      , class Traversal
+      , class Buffer
+    >
+    class test_type_erased_impl_fn
+    {
+    public:
+        typedef void result_type;
+        void operator()()
+        {
+            test_type_erased_impl< Container, Traversal, Buffer >();
+        }
+    };
+
+    template<
+        class Container
+      , class Traversal
+    >
+    void test_type_erased_exercise_buffer_types()
+    {
+        using boost::any_iterator_default_buffer;
+        using boost::any_iterator_buffer;
+        using boost::any_iterator_heap_only_buffer;
+        using boost::any_iterator_stack_only_buffer;
+
+        test_type_erased_impl_fn< Container, Traversal, any_iterator_default_buffer >()();
+        test_type_erased_impl_fn< Container, Traversal, any_iterator_heap_only_buffer >()();
+        test_type_erased_impl_fn< Container, Traversal, any_iterator_buffer<1> >()();
+        test_type_erased_impl_fn< Container, Traversal, any_iterator_buffer<2> >()();
+        test_type_erased_impl_fn< Container, Traversal, any_iterator_buffer<32> >()();
+        test_type_erased_impl_fn< Container, Traversal, any_iterator_buffer<64> >()();
+        test_type_erased_impl_fn< Container, Traversal, any_iterator_buffer<128> >()();
+        test_type_erased_impl_fn< Container, Traversal, any_iterator_stack_only_buffer<128> >()();
+    }
+
+    void test_type_erased_single_pass()
+    {
+        test_type_erased_exercise_buffer_types< std::list<int>, boost::single_pass_traversal_tag >();
+        test_type_erased_exercise_buffer_types< std::deque<int>, boost::single_pass_traversal_tag >();
+        test_type_erased_exercise_buffer_types< std::vector<int>, boost::single_pass_traversal_tag >();
+
+        test_type_erased_exercise_buffer_types< std::list<MockType>, boost::single_pass_traversal_tag >();
+        test_type_erased_exercise_buffer_types< std::deque<MockType>, boost::single_pass_traversal_tag >();
+        test_type_erased_exercise_buffer_types< std::vector<MockType>, boost::single_pass_traversal_tag >();
+    }
+
+    void test_type_erased_forward()
+    {
+        test_type_erased_exercise_buffer_types< std::list<int>, boost::forward_traversal_tag >();
+        test_type_erased_exercise_buffer_types< std::deque<int>, boost::forward_traversal_tag >();
+        test_type_erased_exercise_buffer_types< std::vector<int>, boost::forward_traversal_tag >();
+
+        test_type_erased_exercise_buffer_types< std::list<MockType>, boost::forward_traversal_tag >();
+        test_type_erased_exercise_buffer_types< std::deque<MockType>, boost::forward_traversal_tag >();
+        test_type_erased_exercise_buffer_types< std::vector<MockType>, boost::forward_traversal_tag >();
+    }
+
+    void test_type_erased_bidirectional()
+    {
+        test_type_erased_exercise_buffer_types< std::list<int>, boost::bidirectional_traversal_tag >();
+        test_type_erased_exercise_buffer_types< std::deque<int>, boost::bidirectional_traversal_tag >();
+        test_type_erased_exercise_buffer_types< std::vector<int>, boost::bidirectional_traversal_tag >();
+
+        test_type_erased_exercise_buffer_types< std::list<MockType>, boost::bidirectional_traversal_tag >();
+        test_type_erased_exercise_buffer_types< std::deque<MockType>, boost::bidirectional_traversal_tag >();
+        test_type_erased_exercise_buffer_types< std::vector<MockType>, boost::bidirectional_traversal_tag >();
+    }
+
+    void test_type_erased_random_access()
+    {
+        test_type_erased_exercise_buffer_types< std::deque<int>, boost::random_access_traversal_tag >();
+        test_type_erased_exercise_buffer_types< std::vector<int>, boost::random_access_traversal_tag >();
+
+        test_type_erased_exercise_buffer_types< std::deque<MockType>, boost::random_access_traversal_tag >();
+        test_type_erased_exercise_buffer_types< std::vector<MockType>, boost::random_access_traversal_tag >();
+    }
+
+    void test_type_erased_multiple_different_template_parameter_conversion()
+    {
+        typedef boost::any_range<
+                    int
+                  , boost::random_access_traversal_tag
+                  , int&
+                  , std::ptrdiff_t
+        > source_range_type;
+
+        typedef boost::any_range<
+                    int
+                  , boost::single_pass_traversal_tag
+                  , const int&
+                  , std::ptrdiff_t
+        > target_range_type;
+
+        source_range_type source;
+
+        // Converting via construction
+        target_range_type t1(source);
+
+        // Converting via assignment
+        target_range_type t2;
+        t2 = source;
+
+        // Converting via construction to a type with a reference type
+        // that is a value
+        typedef boost::any_range<
+                    int
+                  , boost::single_pass_traversal_tag
+                  , int
+                  , std::ptrdiff_t
+                > target_range2_type;
+
+        target_range2_type t3(source);
+        target_range2_type t4;
+        t4 = source;
+    }
+
+    template<
+        class Traversal
+      , class ValueType
+      , class SourceValueType
+      , class SourceReference
+      , class TargetValueType
+      , class TargetReference
+    >
+    void test_type_erased_mix_values_impl()
+    {
+        typedef std::vector< ValueType > Container;
+
+        typedef typename boost::any_range_type_generator<
+            Container
+          , SourceValueType
+          , Traversal
+          , SourceReference
+        >::type source_type;
+
+        typedef typename boost::any_range_type_generator<
+            Container
+          , TargetValueType
+          , Traversal
+          , TargetReference
+        >::type target_type;
+
+        Container test_data;
+        for (int i = 0; i < 10; ++i)
+            test_data.push_back(i);
+
+        const source_type source_data(test_data);
+        target_type t1(source_data);
+        BOOST_CHECK_EQUAL_COLLECTIONS( source_data.begin(), source_data.end(),
+                                       t1.begin(), t1.end() );
+
+        target_type t2;
+        t2 = source_data;
+        BOOST_CHECK_EQUAL_COLLECTIONS( source_data.begin(), source_data.end(),
+                                       t2.begin(), t2.end() );
+    }
+
+    template<class Traversal>
+    void test_type_erased_mix_values_driver()
+    {
+        test_type_erased_mix_values_impl< Traversal, int, char, const int&, short, const int& >();
+        test_type_erased_mix_values_impl< Traversal, int, int*, const int&, char, const int& >();
+        test_type_erased_mix_values_impl< Traversal, MockType, char, const MockType&, short, const MockType& >();
+
+        // In fact value type should have no effect in the eligibility
+        // for conversion, hence we should be able to convert it
+        // completely backwards!
+        test_type_erased_mix_values_impl< Traversal, int, short, const int&, char, const int& >();
+        test_type_erased_mix_values_impl< Traversal, int, char, const int&, int*, const int& >();
+    }
+
+    void test_type_erased_mix_values()
+    {
+        test_type_erased_mix_values_driver< boost::single_pass_traversal_tag >();
+        test_type_erased_mix_values_driver< boost::forward_traversal_tag >();
+        test_type_erased_mix_values_driver< boost::bidirectional_traversal_tag >();
+        test_type_erased_mix_values_driver< boost::random_access_traversal_tag >();
+    }
+
+    void test_type_erased_operator_brackets()
+    {
+        typedef boost::adaptors::type_erased<> type_erased_t;
+
+        std::vector<int> c;
+        for (int i = 0; i < 10; ++i)
+            c.push_back(i);
+
+        typedef boost::any_range<
+            int
+          , boost::random_access_traversal_tag
+          , int
+          , boost::range_difference< std::vector<int> >::type
+          , boost::use_default
+        > any_range_type;
+
+        any_range_type rng = c | type_erased_t();
+
+        for (int i = 0; i < 10; ++i)
+        {
+            BOOST_CHECK_EQUAL( rng[i], i );
+        }
+    }
+}
+
+boost::unit_test::test_suite*
+init_unit_test_suite(int argc, char* argv[])
+{
+    boost::unit_test::test_suite* test
+        = BOOST_TEST_SUITE( "RangeTestSuite.adaptor.type_erased" );
+
+    test->add( BOOST_TEST_CASE( &boost_range_adaptor_type_erased_test::test_type_erased ) );
+    test->add( BOOST_TEST_CASE( &boost_range_adaptor_type_erased_test::test_type_erased_single_pass ) );
+    test->add( BOOST_TEST_CASE( &boost_range_adaptor_type_erased_test::test_type_erased_forward ) );
+    test->add( BOOST_TEST_CASE( &boost_range_adaptor_type_erased_test::test_type_erased_bidirectional ) );
+    test->add( BOOST_TEST_CASE( &boost_range_adaptor_type_erased_test::test_type_erased_random_access ) );
+    test->add( BOOST_TEST_CASE( &boost_range_adaptor_type_erased_test::test_type_erased_multiple_different_template_parameter_conversion ) );
+    test->add( BOOST_TEST_CASE( &boost_range_adaptor_type_erased_test::test_type_erased_mix_values ) );
+    test->add( BOOST_TEST_CASE( &boost_range_adaptor_type_erased_test::test_type_erased_operator_brackets ) );
+
+    return test;
+}
diff --git a/test/adaptor_test/type_erased_example.cpp b/test/adaptor_test/type_erased_example.cpp
new file mode 100644
index 0000000..754fba6
--- /dev/null
+++ b/test/adaptor_test/type_erased_example.cpp
@@ -0,0 +1,115 @@
+// Boost.Range library
+//
+//  Copyright Neil Groves 2010. 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/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>
+
+#include <boost/test/test_tools.hpp>
+#include <boost/test/unit_test.hpp>
+
+namespace
+{
+    namespace boost_range_test
+    {
+        namespace type_erased_example
+        {
+
+// 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());
+    }
+}
+
+        } // namespace type_erased_example
+    } // namespace boost_range_test
+} // anonymous namespace
+
+boost::unit_test::test_suite*
+init_unit_test_suite(int argc, char* argv[])
+{
+    boost::unit_test::test_suite* test
+        = BOOST_TEST_SUITE( "RangeTestSuite.adaptor.type_erased_example" );
+
+    test->add( BOOST_TEST_CASE( &boost_range_test::type_erased_example::client::run) );
+
+    return test;
+}
diff --git a/test/algorithm_test/count_if.cpp b/test/algorithm_test/count_if.cpp
index a2e8983..e028741 100644
--- a/test/algorithm_test/count_if.cpp
+++ b/test/algorithm_test/count_if.cpp
@@ -33,6 +33,7 @@ namespace boost
             using namespace boost::assign;
 
             typedef equal_to_x<int> pred_t;
+            typedef BOOST_DEDUCED_TYPENAME std::iterator_traits<BOOST_DEDUCED_TYPENAME Container::iterator>::difference_type diff_t;
 
             Container cont;
             const Container& cref_cont = cont;
@@ -72,9 +73,9 @@ namespace boost
             BOOST_CHECK_EQUAL( 0u, boost::count_if(cref_cont, false_predicate()) );
             BOOST_CHECK_EQUAL( 0u, boost::count_if(boost::make_iterator_range(cont), false_predicate()) );
 
-            BOOST_CHECK_EQUAL( boost::size(cont), boost::count_if(cont, true_predicate()) );
-            BOOST_CHECK_EQUAL( boost::size(cont), boost::count_if(cref_cont, true_predicate()) );
-            BOOST_CHECK_EQUAL( boost::size(cont), boost::count_if(boost::make_iterator_range(cont), true_predicate()) );
+            BOOST_CHECK_EQUAL( static_cast<diff_t>(cont.size()), boost::count_if(cont, true_predicate()) );
+            BOOST_CHECK_EQUAL( static_cast<diff_t>(cont.size()), boost::count_if(cref_cont, true_predicate()) );
+            BOOST_CHECK_EQUAL( static_cast<diff_t>(cont.size()), boost::count_if(boost::make_iterator_range(cont), true_predicate()) );
         }
 
         void test_count_if()
diff --git a/test/algorithm_test/find.cpp b/test/algorithm_test/find.cpp
index 6eb1528..d785ac8 100644
--- a/test/algorithm_test/find.cpp
+++ b/test/algorithm_test/find.cpp
@@ -22,85 +22,82 @@
 #include <deque>
 #include <vector>
 
-namespace boost
+namespace boost_range_test_algorithm_find
 {
-    namespace
+    class find_test_policy
     {
-        class find_test_policy
+    public:
+        template<class Container>
+        BOOST_DEDUCED_TYPENAME boost::range_iterator<Container>::type
+        test_iter(Container& cont)
         {
-        public:
-            template<class Container>
-            BOOST_DEDUCED_TYPENAME range_iterator<Container>::type
-            test_iter(Container& cont)
+            typedef BOOST_DEDUCED_TYPENAME boost::range_iterator<Container>::type iter_t;
+            iter_t result = boost::find(cont, 3);
+            iter_t result2 = boost::find(boost::make_iterator_range(cont), 3);
+            BOOST_CHECK( result == result2 );
+            return result;
+        }
+
+        template<boost::range_return_value return_type>
+        struct test_range
+        {
+            template<class Container, class Policy>
+            BOOST_DEDUCED_TYPENAME boost::range_return<Container,return_type>::type
+            operator()(Policy&, Container& cont)
             {
-                typedef BOOST_DEDUCED_TYPENAME range_iterator<Container>::type iter_t;
-                iter_t result = boost::find(cont, 3);
-                iter_t result2 = boost::find(boost::make_iterator_range(cont), 3);
+                typedef BOOST_DEDUCED_TYPENAME boost::range_return<Container,return_type>::type result_t;
+                result_t result = boost::find<return_type>(cont, 3);
+                result_t result2 = boost::find<return_type>(boost::make_iterator_range(cont), 3);
                 BOOST_CHECK( result == result2 );
                 return result;
             }
-
-            template<range_return_value return_type>
-            struct test_range
-            {
-                template<class Container, class Policy>
-                BOOST_DEDUCED_TYPENAME range_return<Container,return_type>::type
-                operator()(Policy&, Container& cont)
-                {
-                    typedef BOOST_DEDUCED_TYPENAME range_return<Container,return_type>::type result_t;
-                    result_t result = boost::find<return_type>(cont, 3);
-                    result_t result2 = boost::find<return_type>(boost::make_iterator_range(cont), 3);
-                    BOOST_CHECK( result == result2 );
-                    return result;
-                }
-            };
-
-            template<class Container>
-            BOOST_DEDUCED_TYPENAME range_iterator<Container>::type
-            reference(Container& cont)
-            {
-                return std::find(cont.begin(), cont.end(), 3);
-            }
         };
 
         template<class Container>
-        void test_find_container()
+        BOOST_DEDUCED_TYPENAME boost::range_iterator<Container>::type
+        reference(Container& cont)
         {
-            using namespace boost::assign;
-
-            typedef BOOST_DEDUCED_TYPENAME remove_const<Container>::type container_t;
-
-            range_test::range_return_test_driver test_driver;
-
-            container_t mcont;
-            Container& cont = mcont;
-            test_driver(cont, find_test_policy());
-
-            mcont.clear();
-            mcont += 1;
-            test_driver(cont, find_test_policy());
-
-            mcont.clear();
-            mcont += 1,2,3,4,5,6,7,8,9;
-            test_driver(cont, find_test_policy());
+            return std::find(cont.begin(), cont.end(), 3);
         }
+    };
 
-        void test_find()
-        {
-            test_find_container< std::vector<int> >();
-            test_find_container< std::list<int> >();
-            test_find_container< std::deque<int> >();
+    template<class Container>
+    void test_find_container()
+    {
+        using namespace boost::assign;
 
-            test_find_container< const std::vector<int> >();
-            test_find_container< const std::list<int> >();
-            test_find_container< const std::deque<int> >();
+        typedef BOOST_DEDUCED_TYPENAME boost::remove_const<Container>::type container_t;
 
-            std::vector<int> vi;
-            const std::vector<int>& cvi = vi;
-            std::vector<int>::const_iterator it = boost::find(vi, 0);
-            std::vector<int>::const_iterator it2 = boost::find(cvi, 0);
-            BOOST_CHECK( it == it2 );
-        }
+        boost::range_test::range_return_test_driver test_driver;
+
+        container_t mcont;
+        Container& cont = mcont;
+        test_driver(cont, find_test_policy());
+
+        mcont.clear();
+        mcont += 1;
+        test_driver(cont, find_test_policy());
+
+        mcont.clear();
+        mcont += 1,2,3,4,5,6,7,8,9;
+        test_driver(cont, find_test_policy());
+    }
+
+    void test_find()
+    {
+        test_find_container< std::vector<int> >();
+        test_find_container< std::list<int> >();
+        test_find_container< std::deque<int> >();
+
+        test_find_container< const std::vector<int> >();
+        test_find_container< const std::list<int> >();
+        test_find_container< const std::deque<int> >();
+
+        std::vector<int> vi;
+        const std::vector<int>& cvi = vi;
+        std::vector<int>::const_iterator it = boost::find(vi, 0);
+        std::vector<int>::const_iterator it2 = boost::find(cvi, 0);
+        BOOST_CHECK( it == it2 );
     }
 }
 
@@ -110,7 +107,7 @@ init_unit_test_suite(int argc, char* argv[])
     boost::unit_test::test_suite* test
         = BOOST_TEST_SUITE( "RangeTestSuite.algorithm.find" );
 
-    test->add( BOOST_TEST_CASE( &boost::test_find ) );
+    test->add( BOOST_TEST_CASE( &boost_range_test_algorithm_find::test_find ) );
 
     return test;
 }
diff --git a/test/algorithm_test/find_end.cpp b/test/algorithm_test/find_end.cpp
index 0592d5f..b4d77a0 100644
--- a/test/algorithm_test/find_end.cpp
+++ b/test/algorithm_test/find_end.cpp
@@ -21,173 +21,170 @@
 #include <set>
 #include <list>
 
-namespace boost
+namespace boost_range_test_algorithm_find_end
 {
-    namespace
+    template<class Container2>
+    class find_end_test_policy
     {
-        template<class Container2>
-        class find_end_test_policy
+        typedef Container2 container2_t;
+    public:
+        explicit find_end_test_policy(const Container2& cont)
+            :   m_cont(cont)
         {
-            typedef Container2 container2_t;
-        public:
-            explicit find_end_test_policy(const Container2& cont)
-                :   m_cont(cont)
-            {
-            }
+        }
 
-            container2_t cont() { return m_cont; }
+        container2_t cont() { return m_cont; }
 
-            template<class Container>
-            BOOST_DEDUCED_TYPENAME range_iterator<Container>::type
-            test_iter(Container& cont)
+        template<class Container>
+        BOOST_DEDUCED_TYPENAME boost::range_iterator<Container>::type
+        test_iter(Container& cont)
+        {
+            typedef BOOST_DEDUCED_TYPENAME boost::range_iterator<Container>::type iter_t;
+            iter_t result = boost::find_end(cont, m_cont);
+            BOOST_CHECK( result == boost::find_end(boost::make_iterator_range(cont), m_cont) );
+            BOOST_CHECK( result == boost::find_end(cont, boost::make_iterator_range(m_cont)) );
+            BOOST_CHECK( result == boost::find_end(boost::make_iterator_range(cont), boost::make_iterator_range(m_cont)) );
+            return result;
+        }
+
+        template<boost::range_return_value return_type>
+        struct test_range
+        {
+            template<class Container, class Policy>
+            BOOST_DEDUCED_TYPENAME boost::range_return<Container,return_type>::type
+            operator()(Policy& policy, Container& cont)
             {
-                typedef BOOST_DEDUCED_TYPENAME range_iterator<Container>::type iter_t;
-                iter_t result = boost::find_end(cont, m_cont);
-                BOOST_CHECK( result == boost::find_end(boost::make_iterator_range(cont), m_cont) );
-                BOOST_CHECK( result == boost::find_end(cont, boost::make_iterator_range(m_cont)) );
-                BOOST_CHECK( result == boost::find_end(boost::make_iterator_range(cont), boost::make_iterator_range(m_cont)) );
+                typedef BOOST_DEDUCED_TYPENAME boost::range_return<Container,return_type>::type result_t;
+                result_t result = boost::find_end<return_type>(cont, policy.cont());
+                BOOST_CHECK( result == boost::find_end<return_type>(boost::make_iterator_range(cont), policy.cont()) );
+                BOOST_CHECK( result == boost::find_end<return_type>(cont, boost::make_iterator_range(policy.cont())) );
+                BOOST_CHECK( result == boost::find_end<return_type>(boost::make_iterator_range(cont),
+                                                                    boost::make_iterator_range(policy.cont())) );
                 return result;
             }
-
-            template<range_return_value return_type>
-            struct test_range
-            {
-                template<class Container, class Policy>
-                BOOST_DEDUCED_TYPENAME range_return<Container,return_type>::type
-                operator()(Policy& policy, Container& cont)
-                {
-                    typedef BOOST_DEDUCED_TYPENAME range_return<Container,return_type>::type result_t;
-                    result_t result = boost::find_end<return_type>(cont, policy.cont());
-                    BOOST_CHECK( result == boost::find_end<return_type>(boost::make_iterator_range(cont), policy.cont()) );
-                    BOOST_CHECK( result == boost::find_end<return_type>(cont, boost::make_iterator_range(policy.cont())) );
-                    BOOST_CHECK( result == boost::find_end<return_type>(boost::make_iterator_range(cont),
-                                                                        boost::make_iterator_range(policy.cont())) );
-                    return result;
-                }
-            };
-
-            template<class Container>
-            BOOST_DEDUCED_TYPENAME range_iterator<Container>::type
-            reference(Container& cont)
-            {
-                return std::find_end(cont.begin(), cont.end(),
-                                     m_cont.begin(), m_cont.end());
-            }
-
-        private:
-            Container2 m_cont;
         };
 
-        template<class Container2, class BinaryPredicate>
-        class find_end_pred_test_policy
+        template<class Container>
+        BOOST_DEDUCED_TYPENAME boost::range_iterator<Container>::type
+        reference(Container& cont)
         {
-            typedef Container2 container2_t;
-        public:
-            explicit find_end_pred_test_policy(const Container2& cont)
-                :   m_cont(cont)
+            return std::find_end(cont.begin(), cont.end(),
+                                 m_cont.begin(), m_cont.end());
+        }
+
+    private:
+        Container2 m_cont;
+    };
+
+    template<class Container2, class BinaryPredicate>
+    class find_end_pred_test_policy
+    {
+        typedef Container2 container2_t;
+    public:
+        explicit find_end_pred_test_policy(const Container2& cont)
+            :   m_cont(cont)
+        {
+        }
+
+        container2_t& cont() { return m_cont; }
+        BinaryPredicate& pred() { return m_pred; }
+
+        template<class Container>
+        BOOST_DEDUCED_TYPENAME boost::range_iterator<Container>::type
+        test_iter(Container& cont)
+        {
+            typedef BOOST_DEDUCED_TYPENAME boost::range_iterator<Container>::type iter_t;
+            iter_t it = boost::find_end(cont, m_cont, m_pred);
+            BOOST_CHECK( it == boost::find_end(boost::make_iterator_range(cont), m_cont, m_pred) );
+            BOOST_CHECK( it == boost::find_end(cont, boost::make_iterator_range(m_cont), m_pred) );
+            BOOST_CHECK( it == boost::find_end(boost::make_iterator_range(cont), boost::make_iterator_range(m_cont), m_pred) );
+            return it;
+        }
+
+        template<boost::range_return_value return_type>
+        struct test_range
+        {
+            template<class Container, class Policy>
+            BOOST_DEDUCED_TYPENAME boost::range_return<Container,return_type>::type
+            operator()(Policy& policy, Container& cont)
             {
+                typedef BOOST_DEDUCED_TYPENAME boost::range_return<Container,return_type>::type result_t;
+                result_t result = boost::find_end<return_type>(cont, policy.cont(), policy.pred());
+                BOOST_CHECK( result == boost::find_end<return_type>(boost::make_iterator_range(cont), policy.cont(), policy.pred()) );
+                BOOST_CHECK( result == boost::find_end<return_type>(cont, boost::make_iterator_range(policy.cont()), policy.pred()) );
+                BOOST_CHECK( result == boost::find_end<return_type>(boost::make_iterator_range(cont),
+                                                                    boost::make_iterator_range(policy.cont()), policy.pred()) );
+                return boost::find_end<return_type>(cont, policy.cont(), policy.pred());
             }
-
-            container2_t& cont() { return m_cont; }
-            BinaryPredicate& pred() { return m_pred; }
-
-            template<class Container>
-            BOOST_DEDUCED_TYPENAME range_iterator<Container>::type
-            test_iter(Container& cont)
-            {
-                typedef BOOST_DEDUCED_TYPENAME range_iterator<Container>::type iter_t;
-                iter_t it = boost::find_end(cont, m_cont, m_pred);
-                BOOST_CHECK( it == boost::find_end(boost::make_iterator_range(cont), m_cont, m_pred) );
-                BOOST_CHECK( it == boost::find_end(cont, boost::make_iterator_range(m_cont), m_pred) );
-                BOOST_CHECK( it == boost::find_end(boost::make_iterator_range(cont), boost::make_iterator_range(m_cont), m_pred) );
-                return it;
-            }
-
-            template<range_return_value return_type>
-            struct test_range
-            {
-                template<class Container, class Policy>
-                BOOST_DEDUCED_TYPENAME range_return<Container,return_type>::type
-                operator()(Policy& policy, Container& cont)
-                {
-                    typedef BOOST_DEDUCED_TYPENAME range_return<Container,return_type>::type result_t;
-                    result_t result = boost::find_end<return_type>(cont, policy.cont(), policy.pred());
-                    BOOST_CHECK( result == boost::find_end<return_type>(boost::make_iterator_range(cont), policy.cont(), policy.pred()) );
-                    BOOST_CHECK( result == boost::find_end<return_type>(cont, boost::make_iterator_range(policy.cont()), policy.pred()) );
-                    BOOST_CHECK( result == boost::find_end<return_type>(boost::make_iterator_range(cont),
-                                                                        boost::make_iterator_range(policy.cont()), policy.pred()) );
-                    return boost::find_end<return_type>(cont, policy.cont(), policy.pred());
-                }
-            };
-
-            template<class Container>
-            BOOST_DEDUCED_TYPENAME range_iterator<Container>::type
-            reference(Container& cont)
-            {
-                return std::find_end(cont.begin(), cont.end(),
-                                     m_cont.begin(), m_cont.end(),
-                                     m_pred);
-            }
-
-        private:
-            Container2      m_cont;
-            BinaryPredicate m_pred;
         };
 
-        template<class Container1, class Container2>
-        void run_tests(Container1& cont1, Container2& cont2)
+        template<class Container>
+        BOOST_DEDUCED_TYPENAME boost::range_iterator<Container>::type
+        reference(Container& cont)
         {
-            range_test::range_return_test_driver test_driver;
-            test_driver(cont1, find_end_test_policy<Container2>(cont2));
-            test_driver(cont1, find_end_pred_test_policy<Container2, std::less<int> >(cont2));
-            test_driver(cont2, find_end_pred_test_policy<Container2, std::greater<int> >(cont2));
+            return std::find_end(cont.begin(), cont.end(),
+                                 m_cont.begin(), m_cont.end(),
+                                 m_pred);
         }
 
-        template<class Container1, class Container2>
-        void test_find_end_impl()
-        {
-            using namespace boost::assign;
+    private:
+        Container2      m_cont;
+        BinaryPredicate m_pred;
+    };
 
-            typedef BOOST_DEDUCED_TYPENAME remove_const<Container1>::type container1_t;
-            typedef BOOST_DEDUCED_TYPENAME remove_const<Container2>::type container2_t;
+    template<class Container1, class Container2>
+    void run_tests(Container1& cont1, Container2& cont2)
+    {
+        boost::range_test::range_return_test_driver test_driver;
+        test_driver(cont1, find_end_test_policy<Container2>(cont2));
+        test_driver(cont1, find_end_pred_test_policy<Container2, std::less<int> >(cont2));
+        test_driver(cont2, find_end_pred_test_policy<Container2, std::greater<int> >(cont2));
+    }
 
-            container1_t mcont1;
-            Container1& cont1 = mcont1;
-            container2_t mcont2;
-            Container2& cont2 = mcont2;
+    template<class Container1, class Container2>
+    void test_find_end_impl()
+    {
+        using namespace boost::assign;
 
-            run_tests(cont1, cont2);
+        typedef BOOST_DEDUCED_TYPENAME boost::remove_const<Container1>::type container1_t;
+        typedef BOOST_DEDUCED_TYPENAME boost::remove_const<Container2>::type container2_t;
 
-            mcont1 += 1;
-            run_tests(cont1, cont2);
+        container1_t mcont1;
+        Container1& cont1 = mcont1;
+        container2_t mcont2;
+        Container2& cont2 = mcont2;
 
-            mcont2 += 1;
-            run_tests(cont1, cont2);
+        run_tests(cont1, cont2);
 
-            mcont1 += 2,3,4,5,6,7,8,9;
-            mcont2 += 2,3,4;
-            run_tests(cont1, cont2);
+        mcont1 += 1;
+        run_tests(cont1, cont2);
 
-            mcont2.clear();
-            mcont2 += 7,8,9;
-            run_tests(cont1, cont2);
-        }
+        mcont2 += 1;
+        run_tests(cont1, cont2);
 
-        void test_find_end()
-        {
-            test_find_end_impl< std::vector<int>, std::vector<int> >();
-            test_find_end_impl< std::list<int>, std::list<int> >();
-            test_find_end_impl< std::deque<int>, std::deque<int> >();
-            test_find_end_impl< const std::vector<int>, const std::vector<int> >();
-            test_find_end_impl< const std::list<int>, const std::list<int> >();
-            test_find_end_impl< const std::deque<int>, const std::deque<int> >();
-            test_find_end_impl< const std::vector<int>, const std::list<int> >();
-            test_find_end_impl< const std::list<int>, const std::vector<int> >();
-            test_find_end_impl< const std::vector<int>, std::list<int> >();
-            test_find_end_impl< const std::list<int>, std::vector<int> >();
-            test_find_end_impl< std::vector<int>, std::list<int> >();
-            test_find_end_impl< std::list<int>, std::vector<int> >();
-        }
+        mcont1 += 2,3,4,5,6,7,8,9;
+        mcont2 += 2,3,4;
+        run_tests(cont1, cont2);
+
+        mcont2.clear();
+        mcont2 += 7,8,9;
+        run_tests(cont1, cont2);
+    }
+
+    void test_find_end()
+    {
+        test_find_end_impl< std::vector<int>, std::vector<int> >();
+        test_find_end_impl< std::list<int>, std::list<int> >();
+        test_find_end_impl< std::deque<int>, std::deque<int> >();
+        test_find_end_impl< const std::vector<int>, const std::vector<int> >();
+        test_find_end_impl< const std::list<int>, const std::list<int> >();
+        test_find_end_impl< const std::deque<int>, const std::deque<int> >();
+        test_find_end_impl< const std::vector<int>, const std::list<int> >();
+        test_find_end_impl< const std::list<int>, const std::vector<int> >();
+        test_find_end_impl< const std::vector<int>, std::list<int> >();
+        test_find_end_impl< const std::list<int>, std::vector<int> >();
+        test_find_end_impl< std::vector<int>, std::list<int> >();
+        test_find_end_impl< std::list<int>, std::vector<int> >();
     }
 }
 
@@ -197,7 +194,7 @@ init_unit_test_suite(int argc, char* argv[])
     boost::unit_test::test_suite* test
         = BOOST_TEST_SUITE( "RangeTestSuite.algorithm.find_end" );
 
-    test->add( BOOST_TEST_CASE( &boost::test_find_end ) );
+    test->add( BOOST_TEST_CASE( &boost_range_test_algorithm_find_end::test_find_end ) );
 
     return test;
 }
diff --git a/test/algorithm_test/find_first_of.cpp b/test/algorithm_test/find_first_of.cpp
index c96d36a..296b8fc 100644
--- a/test/algorithm_test/find_first_of.cpp
+++ b/test/algorithm_test/find_first_of.cpp
@@ -21,171 +21,168 @@
 #include <set>
 #include <list>
 
-namespace boost
+namespace boost_range_test_algorithm_find_first_of
 {
-    namespace
+    template<class Container2>
+    class find_first_of_test_policy
     {
-        template<class Container2>
-        class find_first_of_test_policy
+        typedef Container2 container2_t;
+    public:
+        explicit find_first_of_test_policy(const Container2& cont)
+            :   m_cont(cont)
         {
-            typedef Container2 container2_t;
-        public:
-            explicit find_first_of_test_policy(const Container2& cont)
-                :   m_cont(cont)
-            {
-            }
+        }
 
-            container2_t& cont() { return m_cont; }
+        container2_t& cont() { return m_cont; }
 
-            template<class Container>
-            BOOST_DEDUCED_TYPENAME range_iterator<Container>::type
-            test_iter(Container& cont)
+        template<class Container>
+        BOOST_DEDUCED_TYPENAME boost::range_iterator<Container>::type
+        test_iter(Container& cont)
+        {
+            typedef BOOST_DEDUCED_TYPENAME boost::range_iterator<Container>::type iter_t;
+            iter_t result = boost::find_first_of(cont, m_cont);
+            BOOST_CHECK( result == boost::find_first_of(boost::make_iterator_range(cont), m_cont) );
+            BOOST_CHECK( result == boost::find_first_of(cont, boost::make_iterator_range(m_cont)) );
+            BOOST_CHECK( result == boost::find_first_of(boost::make_iterator_range(cont), boost::make_iterator_range(m_cont)) );
+            return result;
+        }
+
+        template<boost::range_return_value return_type>
+        struct test_range
+        {
+            template<class Container, class Policy>
+            BOOST_DEDUCED_TYPENAME boost::range_return<Container,return_type>::type
+            operator()(Policy& policy, Container& cont)
             {
-                typedef BOOST_DEDUCED_TYPENAME range_iterator<Container>::type iter_t;
-                iter_t result = boost::find_first_of(cont, m_cont);
-                BOOST_CHECK( result == boost::find_first_of(boost::make_iterator_range(cont), m_cont) );
-                BOOST_CHECK( result == boost::find_first_of(cont, boost::make_iterator_range(m_cont)) );
-                BOOST_CHECK( result == boost::find_first_of(boost::make_iterator_range(cont), boost::make_iterator_range(m_cont)) );
+                typedef BOOST_DEDUCED_TYPENAME boost::range_return<Container,return_type>::type result_t;
+                result_t result = boost::find_first_of<return_type>(cont, policy.cont());
+                BOOST_CHECK( result == boost::find_first_of<return_type>(boost::make_iterator_range(cont), policy.cont()) );
+                BOOST_CHECK( result == boost::find_first_of<return_type>(cont, boost::make_iterator_range(policy.cont())) );
+                BOOST_CHECK( result == boost::find_first_of<return_type>(boost::make_iterator_range(cont), boost::make_iterator_range(policy.cont())) );
                 return result;
             }
-
-            template<range_return_value return_type>
-            struct test_range
-            {
-                template<class Container, class Policy>
-                BOOST_DEDUCED_TYPENAME range_return<Container,return_type>::type
-                operator()(Policy& policy, Container& cont)
-                {
-                    typedef BOOST_DEDUCED_TYPENAME range_return<Container,return_type>::type result_t;
-                    result_t result = boost::find_first_of<return_type>(cont, policy.cont());
-                    BOOST_CHECK( result == boost::find_first_of<return_type>(boost::make_iterator_range(cont), policy.cont()) );
-                    BOOST_CHECK( result == boost::find_first_of<return_type>(cont, boost::make_iterator_range(policy.cont())) );
-                    BOOST_CHECK( result == boost::find_first_of<return_type>(boost::make_iterator_range(cont), boost::make_iterator_range(policy.cont())) );
-                    return result;
-                }
-            };
-
-            template<class Container>
-            BOOST_DEDUCED_TYPENAME range_iterator<Container>::type
-            reference(Container& cont)
-            {
-                return std::find_first_of(cont.begin(), cont.end(),
-                                     m_cont.begin(), m_cont.end());
-            }
-
-        private:
-            Container2 m_cont;
         };
 
-        template<class Container2, class BinaryPredicate>
-        class find_first_of_pred_test_policy
+        template<class Container>
+        BOOST_DEDUCED_TYPENAME boost::range_iterator<Container>::type
+        reference(Container& cont)
         {
-            typedef Container2 container2_t;
-        public:
-            explicit find_first_of_pred_test_policy(const Container2& cont)
-                :   m_cont(cont)
-            {
-            }
+            return std::find_first_of(cont.begin(), cont.end(),
+                                 m_cont.begin(), m_cont.end());
+        }
 
-            container2_t& cont() { return m_cont; }
-            BinaryPredicate& pred() { return m_pred; }
+    private:
+        Container2 m_cont;
+    };
 
-            template<class Container>
-            BOOST_DEDUCED_TYPENAME range_iterator<Container>::type
-            test_iter(Container& cont)
+    template<class Container2, class BinaryPredicate>
+    class find_first_of_pred_test_policy
+    {
+        typedef Container2 container2_t;
+    public:
+        explicit find_first_of_pred_test_policy(const Container2& cont)
+            :   m_cont(cont)
+        {
+        }
+
+        container2_t& cont() { return m_cont; }
+        BinaryPredicate& pred() { return m_pred; }
+
+        template<class Container>
+        BOOST_DEDUCED_TYPENAME boost::range_iterator<Container>::type
+        test_iter(Container& cont)
+        {
+            typedef BOOST_DEDUCED_TYPENAME boost::range_iterator<Container>::type iter_t;
+            iter_t result = boost::find_first_of(cont, m_cont, m_pred);
+            BOOST_CHECK( result == boost::find_first_of(boost::make_iterator_range(cont), m_cont, m_pred) );
+            BOOST_CHECK( result == boost::find_first_of(cont, boost::make_iterator_range(m_cont), m_pred) );
+            BOOST_CHECK( result == boost::find_first_of(boost::make_iterator_range(cont), boost::make_iterator_range(m_cont), m_pred) );
+            return result;
+        }
+
+        template<boost::range_return_value return_type>
+        struct test_range
+        {
+            template<class Container, class Policy>
+            BOOST_DEDUCED_TYPENAME boost::range_return<Container,return_type>::type
+            operator()(Policy& policy, Container& cont)
             {
-                typedef BOOST_DEDUCED_TYPENAME range_iterator<Container>::type iter_t;
-                iter_t result = boost::find_first_of(cont, m_cont, m_pred);
-                BOOST_CHECK( result == boost::find_first_of(boost::make_iterator_range(cont), m_cont, m_pred) );
-                BOOST_CHECK( result == boost::find_first_of(cont, boost::make_iterator_range(m_cont), m_pred) );
-                BOOST_CHECK( result == boost::find_first_of(boost::make_iterator_range(cont), boost::make_iterator_range(m_cont), m_pred) );
+                typedef BOOST_DEDUCED_TYPENAME boost::range_return<Container,return_type>::type result_t;
+                result_t result = boost::find_first_of<return_type>(cont, policy.cont(), policy.pred());
+                BOOST_CHECK( result == boost::find_first_of<return_type>(boost::make_iterator_range(cont), policy.cont(), policy.pred()) );
+                BOOST_CHECK( result == boost::find_first_of<return_type>(cont, boost::make_iterator_range(policy.cont()), policy.pred()) );
+                BOOST_CHECK( result == boost::find_first_of<return_type>(boost::make_iterator_range(cont), boost::make_iterator_range(policy.cont()), policy.pred()) );
                 return result;
             }
-
-            template<range_return_value return_type>
-            struct test_range
-            {
-                template<class Container, class Policy>
-                BOOST_DEDUCED_TYPENAME range_return<Container,return_type>::type
-                operator()(Policy& policy, Container& cont)
-                {
-                    typedef BOOST_DEDUCED_TYPENAME range_return<Container,return_type>::type result_t;
-                    result_t result = boost::find_first_of<return_type>(cont, policy.cont(), policy.pred());
-                    BOOST_CHECK( result == boost::find_first_of<return_type>(boost::make_iterator_range(cont), policy.cont(), policy.pred()) );
-                    BOOST_CHECK( result == boost::find_first_of<return_type>(cont, boost::make_iterator_range(policy.cont()), policy.pred()) );
-                    BOOST_CHECK( result == boost::find_first_of<return_type>(boost::make_iterator_range(cont), boost::make_iterator_range(policy.cont()), policy.pred()) );
-                    return result;
-                }
-            };
-
-            template<class Container>
-            BOOST_DEDUCED_TYPENAME range_iterator<Container>::type
-            reference(Container& cont)
-            {
-                return std::find_first_of(cont.begin(), cont.end(),
-                                          m_cont.begin(), m_cont.end(),
-                                          m_pred);
-            }
-
-        private:
-            Container2      m_cont;
-            BinaryPredicate m_pred;
         };
 
-        template<class Container1, class Container2>
-        void run_tests(Container1& cont1, Container2& cont2)
+        template<class Container>
+        BOOST_DEDUCED_TYPENAME boost::range_iterator<Container>::type
+        reference(Container& cont)
         {
-            range_test::range_return_test_driver test_driver;
-            test_driver(cont1, find_first_of_test_policy<Container2>(cont2));
-            test_driver(cont1, find_first_of_pred_test_policy<Container2, std::less<int> >(cont2));
-            test_driver(cont2, find_first_of_pred_test_policy<Container2, std::greater<int> >(cont2));
+            return std::find_first_of(cont.begin(), cont.end(),
+                                      m_cont.begin(), m_cont.end(),
+                                      m_pred);
         }
 
-        template<class Container1, class Container2>
-        void test_find_first_of_impl()
-        {
-            using namespace boost::assign;
+    private:
+        Container2      m_cont;
+        BinaryPredicate m_pred;
+    };
 
-            typedef BOOST_DEDUCED_TYPENAME remove_const<Container1>::type container1_t;
-            typedef BOOST_DEDUCED_TYPENAME remove_const<Container2>::type container2_t;
+    template<class Container1, class Container2>
+    void run_tests(Container1& cont1, Container2& cont2)
+    {
+        boost::range_test::range_return_test_driver test_driver;
+        test_driver(cont1, find_first_of_test_policy<Container2>(cont2));
+        test_driver(cont1, find_first_of_pred_test_policy<Container2, std::less<int> >(cont2));
+        test_driver(cont2, find_first_of_pred_test_policy<Container2, std::greater<int> >(cont2));
+    }
 
-            container1_t mcont1;
-            Container1& cont1 = mcont1;
-            container2_t mcont2;
-            Container2& cont2 = mcont2;
+    template<class Container1, class Container2>
+    void test_find_first_of_impl()
+    {
+        using namespace boost::assign;
 
-            run_tests(cont1, cont2);
+        typedef BOOST_DEDUCED_TYPENAME boost::remove_const<Container1>::type container1_t;
+        typedef BOOST_DEDUCED_TYPENAME boost::remove_const<Container2>::type container2_t;
 
-            mcont1 += 1;
-            run_tests(cont1, cont2);
+        container1_t mcont1;
+        Container1& cont1 = mcont1;
+        container2_t mcont2;
+        Container2& cont2 = mcont2;
 
-            mcont2 += 1;
-            run_tests(cont1, cont2);
+        run_tests(cont1, cont2);
 
-            mcont1 += 2,3,4,5,6,7,8,9;
-            mcont2 += 2,3,4;
-            run_tests(cont1, cont2);
+        mcont1 += 1;
+        run_tests(cont1, cont2);
 
-            mcont2.clear();
-            mcont2 += 7,8,9;
-            run_tests(cont1, cont2);
-        }
+        mcont2 += 1;
+        run_tests(cont1, cont2);
 
-        void test_find_first_of()
-        {
-            test_find_first_of_impl< std::vector<int>, std::vector<int> >();
-            test_find_first_of_impl< std::list<int>, std::list<int> >();
-            test_find_first_of_impl< std::deque<int>, std::deque<int> >();
-            test_find_first_of_impl< const std::vector<int>, const std::vector<int> >();
-            test_find_first_of_impl< const std::list<int>, const std::list<int> >();
-            test_find_first_of_impl< const std::deque<int>, const std::deque<int> >();
-            test_find_first_of_impl< const std::vector<int>, const std::list<int> >();
-            test_find_first_of_impl< const std::list<int>, const std::vector<int> >();
-            test_find_first_of_impl< const std::vector<int>, std::list<int> >();
-            test_find_first_of_impl< const std::list<int>, std::vector<int> >();
-            test_find_first_of_impl< std::vector<int>, std::list<int> >();
-            test_find_first_of_impl< std::list<int>, std::vector<int> >();
-        }
+        mcont1 += 2,3,4,5,6,7,8,9;
+        mcont2 += 2,3,4;
+        run_tests(cont1, cont2);
+
+        mcont2.clear();
+        mcont2 += 7,8,9;
+        run_tests(cont1, cont2);
+    }
+
+    void test_find_first_of()
+    {
+        test_find_first_of_impl< std::vector<int>, std::vector<int> >();
+        test_find_first_of_impl< std::list<int>, std::list<int> >();
+        test_find_first_of_impl< std::deque<int>, std::deque<int> >();
+        test_find_first_of_impl< const std::vector<int>, const std::vector<int> >();
+        test_find_first_of_impl< const std::list<int>, const std::list<int> >();
+        test_find_first_of_impl< const std::deque<int>, const std::deque<int> >();
+        test_find_first_of_impl< const std::vector<int>, const std::list<int> >();
+        test_find_first_of_impl< const std::list<int>, const std::vector<int> >();
+        test_find_first_of_impl< const std::vector<int>, std::list<int> >();
+        test_find_first_of_impl< const std::list<int>, std::vector<int> >();
+        test_find_first_of_impl< std::vector<int>, std::list<int> >();
+        test_find_first_of_impl< std::list<int>, std::vector<int> >();
     }
 }
 
@@ -195,7 +192,7 @@ init_unit_test_suite(int argc, char* argv[])
     boost::unit_test::test_suite* test
         = BOOST_TEST_SUITE( "RangeTestSuite.algorithm.find_first_of" );
 
-    test->add( BOOST_TEST_CASE( &boost::test_find_first_of ) );
+    test->add( BOOST_TEST_CASE( &boost_range_test_algorithm_find_first_of::test_find_first_of ) );
 
     return test;
 }
diff --git a/test/algorithm_test/find_if.cpp b/test/algorithm_test/find_if.cpp
index 04fe6f2..3ab22c9 100644
--- a/test/algorithm_test/find_if.cpp
+++ b/test/algorithm_test/find_if.cpp
@@ -23,97 +23,94 @@
 #include <list>
 #include <vector>
 
-namespace boost
+namespace boost_range_test_algorithm_find_if
 {
-    namespace
+    template<class UnaryPredicate>
+    class find_if_test_policy
     {
-        template<class UnaryPredicate>
-        class find_if_test_policy
-        {
-        public:
-            explicit find_if_test_policy(UnaryPredicate pred)
-                : m_pred(pred) {}
-
-            template<class Container>
-            BOOST_DEDUCED_TYPENAME range_iterator<Container>::type
-            test_iter(Container& cont)
-            {
-                typedef BOOST_DEDUCED_TYPENAME range_iterator<Container>::type iter_t;
-                iter_t result = boost::find_if(cont, m_pred);
-                BOOST_CHECK( result == boost::find_if(boost::make_iterator_range(cont), m_pred) );
-                return result;
-            }
-
-            template<range_return_value return_type>
-            struct test_range
-            {
-                template<class Container>
-                BOOST_DEDUCED_TYPENAME range_return<Container,return_type>::type
-                operator()(find_if_test_policy& policy, Container& cont)
-                {
-                    typedef BOOST_DEDUCED_TYPENAME range_return<Container,return_type>::type result_t;
-                    result_t result = boost::find_if<return_type>(cont, policy.pred());
-                    BOOST_CHECK( result == boost::find_if<return_type>(boost::make_iterator_range(cont), policy.pred()) );
-                    return result;
-                }
-            };
-
-            template<class Container>
-            BOOST_DEDUCED_TYPENAME range_iterator<Container>::type
-            reference(Container& cont)
-            {
-                return std::find_if(cont.begin(), cont.end(), m_pred);
-            }
-
-            UnaryPredicate& pred() { return m_pred; }
-
-        private:
-            UnaryPredicate m_pred;
-        };
-
-        template<class UnaryPredicate>
-        find_if_test_policy<UnaryPredicate>
-        make_policy(UnaryPredicate pred)
-        {
-            return find_if_test_policy<UnaryPredicate>(pred);
-        }
+    public:
+        explicit find_if_test_policy(UnaryPredicate pred)
+            : m_pred(pred) {}
 
         template<class Container>
-        void test_find_if_container()
+        BOOST_DEDUCED_TYPENAME boost::range_iterator<Container>::type
+        test_iter(Container& cont)
         {
-            using namespace boost::assign;
-            using namespace boost::range_test_function;
-
-            typedef BOOST_DEDUCED_TYPENAME remove_const<Container>::type container_t;
-
-            range_test::range_return_test_driver test_driver;
-
-            container_t mcont;
-            Container& cont = mcont;
-            test_driver(cont, make_policy(greater_than_x<int>(5)));
-            test_driver(cont, make_policy(false_predicate()));
-
-            mcont.clear();
-            mcont += 1;
-            test_driver(cont, make_policy(greater_than_x<int>(5)));
-            test_driver(cont, make_policy(false_predicate()));
-
-            mcont.clear();
-            mcont += 1,2,3,4,5,6,7,8,9;
-            test_driver(cont, make_policy(greater_than_x<int>(5)));
-            test_driver(cont, make_policy(false_predicate()));
+            typedef BOOST_DEDUCED_TYPENAME boost::range_iterator<Container>::type iter_t;
+            iter_t result = boost::find_if(cont, m_pred);
+            BOOST_CHECK( result == boost::find_if(boost::make_iterator_range(cont), m_pred) );
+            return result;
         }
 
-        void test_find_if()
+        template<boost::range_return_value return_type>
+        struct test_range
         {
-            test_find_if_container< std::vector<int> >();
-            test_find_if_container< std::list<int> >();
-            test_find_if_container< std::deque<int> >();
+            template<class Container>
+            BOOST_DEDUCED_TYPENAME boost::range_return<Container,return_type>::type
+            operator()(find_if_test_policy& policy, Container& cont)
+            {
+                typedef BOOST_DEDUCED_TYPENAME boost::range_return<Container,return_type>::type result_t;
+                result_t result = boost::find_if<return_type>(cont, policy.pred());
+                BOOST_CHECK( result == boost::find_if<return_type>(boost::make_iterator_range(cont), policy.pred()) );
+                return result;
+            }
+        };
 
-            test_find_if_container< const std::vector<int> >();
-            test_find_if_container< const std::list<int> >();
-            test_find_if_container< const std::deque<int> >();
+        template<class Container>
+        BOOST_DEDUCED_TYPENAME boost::range_iterator<Container>::type
+        reference(Container& cont)
+        {
+            return std::find_if(cont.begin(), cont.end(), m_pred);
         }
+
+        UnaryPredicate& pred() { return m_pred; }
+
+    private:
+        UnaryPredicate m_pred;
+    };
+
+    template<class UnaryPredicate>
+    find_if_test_policy<UnaryPredicate>
+    make_policy(UnaryPredicate pred)
+    {
+        return find_if_test_policy<UnaryPredicate>(pred);
+    }
+
+    template<class Container>
+    void test_find_if_container()
+    {
+        using namespace boost::assign;
+        using namespace boost::range_test_function;
+
+        typedef BOOST_DEDUCED_TYPENAME boost::remove_const<Container>::type container_t;
+
+        boost::range_test::range_return_test_driver test_driver;
+
+        container_t mcont;
+        Container& cont = mcont;
+        test_driver(cont, make_policy(greater_than_x<int>(5)));
+        test_driver(cont, make_policy(false_predicate()));
+
+        mcont.clear();
+        mcont += 1;
+        test_driver(cont, make_policy(greater_than_x<int>(5)));
+        test_driver(cont, make_policy(false_predicate()));
+
+        mcont.clear();
+        mcont += 1,2,3,4,5,6,7,8,9;
+        test_driver(cont, make_policy(greater_than_x<int>(5)));
+        test_driver(cont, make_policy(false_predicate()));
+    }
+
+    void test_find_if()
+    {
+        test_find_if_container< std::vector<int> >();
+        test_find_if_container< std::list<int> >();
+        test_find_if_container< std::deque<int> >();
+
+        test_find_if_container< const std::vector<int> >();
+        test_find_if_container< const std::list<int> >();
+        test_find_if_container< const std::deque<int> >();
     }
 }
 
@@ -123,7 +120,7 @@ init_unit_test_suite(int argc, char* argv[])
     boost::unit_test::test_suite* test
         = BOOST_TEST_SUITE( "RangeTestSuite.algorithm.find_if" );
 
-    test->add( BOOST_TEST_CASE( &boost::test_find_if ) );
+    test->add( BOOST_TEST_CASE( &boost_range_test_algorithm_find_if::test_find_if ) );
 
     return test;
 }
diff --git a/test/algorithm_test/lower_bound.cpp b/test/algorithm_test/lower_bound.cpp
index e627708..2a120a4 100644
--- a/test/algorithm_test/lower_bound.cpp
+++ b/test/algorithm_test/lower_bound.cpp
@@ -22,164 +22,160 @@
 #include <deque>
 #include <vector>
 
-namespace boost
+namespace boost_range_test_algorithm_lower_bound
 {
-    namespace
+    class lower_bound_policy
     {
-        class lower_bound_policy 
+    public:
+        template< class Container >
+        BOOST_DEDUCED_TYPENAME boost::range_iterator<Container>::type
+        test_iter(Container& cont)
         {
-        public:
-            template< class Container >
-            BOOST_DEDUCED_TYPENAME range_iterator<Container>::type
-            test_iter(Container& cont)
-            {
-                typedef BOOST_DEDUCED_TYPENAME range_iterator<Container>::type iter_t;
-                iter_t result = boost::lower_bound(cont, 5);
-                BOOST_CHECK( result == boost::lower_bound(boost::make_iterator_range(cont), 5) );
-                return result;
-            }
-
-            template<range_return_value return_type>
-            struct test_range
-            {
-                template<class Container, class Policy>
-                BOOST_DEDUCED_TYPENAME range_return<Container,return_type>::type
-                operator()(Policy&, Container& cont)
-                {
-                    typedef BOOST_DEDUCED_TYPENAME range_return<Container,return_type>::type result_t;
-                    result_t result = boost::lower_bound<return_type>(cont, 5);
-                    BOOST_CHECK( result == boost::lower_bound<return_type>(boost::make_iterator_range(cont), 5) );
-                    return result;
-                }
-            };
-
-            template< class Container >
-            BOOST_DEDUCED_TYPENAME range_iterator<Container>::type
-            reference(Container& cont)
-            {
-                return std::lower_bound(cont.begin(), cont.end(), 5);
-            }
-        };
-
-        template< class BinaryPredicate >
-        struct lower_bound_pred_policy
-        {
-            template< class Container >
-            BOOST_DEDUCED_TYPENAME range_iterator<Container>::type
-            test_iter(Container& cont)
-            {
-                typedef BOOST_DEDUCED_TYPENAME range_iterator<Container>::type iter_t;
-                iter_t result = boost::lower_bound(cont, 5, m_pred);
-                BOOST_CHECK( result == boost::lower_bound(
-                                        boost::make_iterator_range(cont), 5, m_pred) );
-                return result;
-            }
-
-            template< range_return_value return_type >
-            struct test_range
-            {
-                template<class Container, class Policy>
-                BOOST_DEDUCED_TYPENAME range_return<Container,return_type>::type
-                operator()(Policy& policy, Container& cont)
-                {
-                    typedef BOOST_DEDUCED_TYPENAME range_return<Container,return_type>::type result_t;
-                    result_t result = boost::lower_bound<return_type>(cont, 5, policy.pred());
-                    BOOST_CHECK( result == boost::lower_bound<return_type>(
-                                            boost::make_iterator_range(cont), 5, policy.pred()) );
-                    return result;
-                }
-            };
-
-            template<class Container>
-            BOOST_DEDUCED_TYPENAME range_iterator<Container>::type
-            reference(Container& cont)
-            {
-                return std::lower_bound(
-                        cont.begin(), cont.end(), 5, m_pred);
-            }
-
-            BinaryPredicate& pred() { return m_pred; }
-
-        private:
-            BinaryPredicate m_pred;
-        };
-
-        template<class Container,
-                 class TestPolicy,
-                 class BinaryPredicate>
-        void test_lower_bound_impl(TestPolicy policy, BinaryPredicate pred)
-        {
-            using namespace boost::assign;
-
-            typedef BOOST_DEDUCED_TYPENAME remove_const<Container>::type container_t;
-            typedef BOOST_DEDUCED_TYPENAME Container::value_type value_t;
-
-            range_test::range_return_test_driver test_driver;
-
-            container_t mcont;
-            Container& cont = mcont;
-
-            test_driver(cont, policy);
-
-            mcont.clear();
-            mcont += 1;
-
-            std::vector<value_t> temp(mcont.begin(), mcont.end());
-            std::sort(temp.begin(), temp.end(), pred);
-            mcont.assign(temp.begin(), temp.end());
-
-            test_driver(cont, policy);
-
-            mcont.clear();
-            mcont += 1,2,3,4,5,6,7,8,9;
-
-            temp.assign(mcont.begin(), mcont.end());
-            std::sort(temp.begin(), temp.end(), pred);
-            mcont.assign(temp.begin(), temp.end());
-
-            test_driver(cont, policy);
+            typedef BOOST_DEDUCED_TYPENAME boost::range_iterator<Container>::type iter_t;
+            iter_t result = boost::lower_bound(cont, 5);
+            BOOST_CHECK( result == boost::lower_bound(boost::make_iterator_range(cont), 5) );
+            return result;
         }
 
+        template<boost::range_return_value return_type>
+        struct test_range
+        {
+            template<class Container, class Policy>
+            BOOST_DEDUCED_TYPENAME boost::range_return<Container,return_type>::type
+            operator()(Policy&, Container& cont)
+            {
+                typedef BOOST_DEDUCED_TYPENAME boost::range_return<Container,return_type>::type result_t;
+                result_t result = boost::lower_bound<return_type>(cont, 5);
+                BOOST_CHECK( result == boost::lower_bound<return_type>(boost::make_iterator_range(cont), 5) );
+                return result;
+            }
+        };
+
+        template< class Container >
+        BOOST_DEDUCED_TYPENAME boost::range_iterator<Container>::type
+        reference(Container& cont)
+        {
+            return std::lower_bound(cont.begin(), cont.end(), 5);
+        }
+    };
+
+    template< class BinaryPredicate >
+    struct lower_bound_pred_policy
+    {
+        template< class Container >
+        BOOST_DEDUCED_TYPENAME boost::range_iterator<Container>::type
+        test_iter(Container& cont)
+        {
+            typedef BOOST_DEDUCED_TYPENAME boost::range_iterator<Container>::type iter_t;
+            iter_t result = boost::lower_bound(cont, 5, m_pred);
+            BOOST_CHECK( result == boost::lower_bound(
+                                    boost::make_iterator_range(cont), 5, m_pred) );
+            return result;
+        }
+
+        template< boost::range_return_value return_type >
+        struct test_range
+        {
+            template<class Container, class Policy>
+            BOOST_DEDUCED_TYPENAME boost::range_return<Container,return_type>::type
+            operator()(Policy& policy, Container& cont)
+            {
+                typedef BOOST_DEDUCED_TYPENAME boost::range_return<Container,return_type>::type result_t;
+                result_t result = boost::lower_bound<return_type>(cont, 5, policy.pred());
+                BOOST_CHECK( result == boost::lower_bound<return_type>(
+                                        boost::make_iterator_range(cont), 5, policy.pred()) );
+                return result;
+            }
+        };
+
         template<class Container>
-        void test_lower_bound_impl()
+        BOOST_DEDUCED_TYPENAME boost::range_iterator<Container>::type
+        reference(Container& cont)
         {
-            test_lower_bound_impl<Container>(
-                lower_bound_policy(),
-                std::less<int>()
-                );
-
-            test_lower_bound_impl<Container>(
-                lower_bound_pred_policy<std::less<int> >(),
-                std::less<int>()
-                );
-
-            test_lower_bound_impl<Container>(
-                lower_bound_pred_policy<std::greater<int> >(),
-                std::greater<int>()
-                );
+            return std::lower_bound(
+                    cont.begin(), cont.end(), 5, m_pred);
         }
 
-        void test_lower_bound()
-        {
-            test_lower_bound_impl< std::vector<int> >();
-            test_lower_bound_impl< std::list<int> >();
-            test_lower_bound_impl< std::deque<int> >();
+        BinaryPredicate& pred() { return m_pred; }
 
-            test_lower_bound_impl< const std::vector<int> >();
-            test_lower_bound_impl< const std::list<int> >();
-            test_lower_bound_impl< const std::deque<int> >();
-        }
+    private:
+        BinaryPredicate m_pred;
+    };
+
+    template<class Container,
+             class TestPolicy,
+             class BinaryPredicate>
+    void test_lower_bound_impl(TestPolicy policy, BinaryPredicate pred)
+    {
+        using namespace boost::assign;
+
+        typedef BOOST_DEDUCED_TYPENAME boost::remove_const<Container>::type container_t;
+        typedef BOOST_DEDUCED_TYPENAME Container::value_type value_t;
+
+        boost::range_test::range_return_test_driver test_driver;
+
+        container_t mcont;
+        Container& cont = mcont;
+
+        test_driver(cont, policy);
+
+        mcont.clear();
+        mcont += 1;
+
+        std::vector<value_t> temp(mcont.begin(), mcont.end());
+        std::sort(temp.begin(), temp.end(), pred);
+        mcont.assign(temp.begin(), temp.end());
+
+        test_driver(cont, policy);
+
+        mcont.clear();
+        mcont += 1,2,3,4,5,6,7,8,9;
+
+        temp.assign(mcont.begin(), mcont.end());
+        std::sort(temp.begin(), temp.end(), pred);
+        mcont.assign(temp.begin(), temp.end());
+
+        test_driver(cont, policy);
+    }
+
+    template<class Container>
+    void test_lower_bound_impl()
+    {
+        test_lower_bound_impl<Container>(
+            lower_bound_policy(),
+            std::less<int>()
+            );
+
+        test_lower_bound_impl<Container>(
+            lower_bound_pred_policy<std::less<int> >(),
+            std::less<int>()
+            );
+
+        test_lower_bound_impl<Container>(
+            lower_bound_pred_policy<std::greater<int> >(),
+            std::greater<int>()
+            );
+    }
+
+    void test_lower_bound()
+    {
+        test_lower_bound_impl< std::vector<int> >();
+        test_lower_bound_impl< std::list<int> >();
+        test_lower_bound_impl< std::deque<int> >();
+
+        test_lower_bound_impl< const std::vector<int> >();
+        test_lower_bound_impl< const std::list<int> >();
+        test_lower_bound_impl< const std::deque<int> >();
     }
 }
 
-
 boost::unit_test::test_suite*
 init_unit_test_suite(int argc, char* argv[])
 {
     boost::unit_test::test_suite* test
         = BOOST_TEST_SUITE( "RangeTestSuite.algorithm.lower_bound" );
 
-    test->add( BOOST_TEST_CASE( &boost::test_lower_bound ) );
+    test->add( BOOST_TEST_CASE( &boost_range_test_algorithm_lower_bound::test_lower_bound ) );
 
     return test;
 }
diff --git a/test/algorithm_test/max_element.cpp b/test/algorithm_test/max_element.cpp
index c4c6cb9..9a26099 100644
--- a/test/algorithm_test/max_element.cpp
+++ b/test/algorithm_test/max_element.cpp
@@ -22,134 +22,131 @@
 #include <deque>
 #include <vector>
 
-namespace boost
+namespace boost_range_test_algorithm_max_element
 {
-    namespace
+    class max_element_test_policy
     {
-        class max_element_test_policy
+    public:
+        template< class Container >
+        BOOST_DEDUCED_TYPENAME boost::range_iterator<Container>::type
+        test_iter(Container& cont)
         {
-        public:
-            template< class Container >
-            BOOST_DEDUCED_TYPENAME range_iterator<Container>::type
-            test_iter(Container& cont)
+            typedef BOOST_DEDUCED_TYPENAME boost::range_iterator<Container>::type iter_t;
+            iter_t result = boost::max_element(cont);
+            BOOST_CHECK( result == boost::max_element(
+                                        boost::make_iterator_range(cont)) );
+            return result;
+        }
+
+        template<boost::range_return_value return_type>
+        struct test_range
+        {
+            template<class Container, class Policy>
+            BOOST_DEDUCED_TYPENAME boost::range_return<Container,return_type>::type
+            operator()(Policy&, Container& cont)
             {
-                typedef BOOST_DEDUCED_TYPENAME range_iterator<Container>::type iter_t;
-                iter_t result = boost::max_element(cont);
-                BOOST_CHECK( result == boost::max_element(
+                typedef BOOST_DEDUCED_TYPENAME boost::range_return<Container,return_type>::type result_t;
+                result_t result = boost::max_element<return_type>(cont);
+                BOOST_CHECK( result == boost::max_element<return_type>(
                                             boost::make_iterator_range(cont)) );
                 return result;
             }
-
-            template<range_return_value return_type>
-            struct test_range
-            {
-                template<class Container, class Policy>
-                BOOST_DEDUCED_TYPENAME range_return<Container,return_type>::type
-                operator()(Policy&, Container& cont)
-                {
-                    typedef BOOST_DEDUCED_TYPENAME range_return<Container,return_type>::type result_t;
-                    result_t result = boost::max_element<return_type>(cont);
-                    BOOST_CHECK( result == boost::max_element<return_type>(
-                                                boost::make_iterator_range(cont)) );
-                    return result;
-                }
-            };
-
-            template< class Container >
-            BOOST_DEDUCED_TYPENAME range_iterator<Container>::type
-            reference(Container& cont)
-            {
-                return std::max_element(cont.begin(), cont.end());
-            }
         };
 
-        template<class Pred>
-        class max_element_pred_test_policy
+        template< class Container >
+        BOOST_DEDUCED_TYPENAME boost::range_iterator<Container>::type
+        reference(Container& cont)
         {
-        public:
-            template< class Container >
-            BOOST_DEDUCED_TYPENAME range_iterator<Container>::type
-            test_iter(Container& cont)
+            return std::max_element(cont.begin(), cont.end());
+        }
+    };
+
+    template<class Pred>
+    class max_element_pred_test_policy
+    {
+    public:
+        template< class Container >
+        BOOST_DEDUCED_TYPENAME boost::range_iterator<Container>::type
+        test_iter(Container& cont)
+        {
+            typedef BOOST_DEDUCED_TYPENAME boost::range_iterator<Container>::type iter_t;
+            iter_t result = boost::max_element(cont, Pred());
+            BOOST_CHECK( result == boost::max_element(
+                                        boost::make_iterator_range(cont), Pred()) );
+            return result;
+        }
+
+        Pred pred() const { return Pred(); }
+
+        template< boost::range_return_value return_type >
+        struct test_range
+        {
+            template< class Container, class Policy >
+            BOOST_DEDUCED_TYPENAME boost::range_return<Container,return_type>::type
+            operator()(Policy& policy, Container& cont)
             {
-                typedef BOOST_DEDUCED_TYPENAME range_iterator<Container>::type iter_t;
-                iter_t result = boost::max_element(cont, Pred());
-                BOOST_CHECK( result == boost::max_element(
-                                            boost::make_iterator_range(cont), Pred()) );
+                typedef BOOST_DEDUCED_TYPENAME boost::range_return<Container,return_type>::type result_t;
+                result_t result = boost::max_element<return_type>(cont, policy.pred());
+                BOOST_CHECK( result == boost::max_element<return_type>(
+                                            boost::make_iterator_range(cont), policy.pred()) );
                 return result;
             }
-
-            Pred pred() const { return Pred(); }
-
-            template< range_return_value return_type >
-            struct test_range
-            {
-                template< class Container, class Policy >
-                BOOST_DEDUCED_TYPENAME range_return<Container,return_type>::type
-                operator()(Policy& policy, Container& cont)
-                {
-                    typedef BOOST_DEDUCED_TYPENAME range_return<Container,return_type>::type result_t;
-                    result_t result = boost::max_element<return_type>(cont, policy.pred());
-                    BOOST_CHECK( result == boost::max_element<return_type>(
-                                                boost::make_iterator_range(cont), policy.pred()) );
-                    return result;
-                }
-            };
-
-            template< class Container >
-            BOOST_DEDUCED_TYPENAME range_iterator<Container>::type
-            reference(Container& cont)
-            {
-                return std::max_element(cont.begin(), cont.end(), Pred());
-            }
         };
 
-        template<class Container, class TestPolicy>
-        void test_max_element_impl(TestPolicy policy)
+        template< class Container >
+        BOOST_DEDUCED_TYPENAME boost::range_iterator<Container>::type
+        reference(Container& cont)
         {
-            using namespace boost::assign;
-
-            typedef BOOST_DEDUCED_TYPENAME Container::value_type value_t;
-            typedef BOOST_DEDUCED_TYPENAME remove_const<Container>::type container_t;
-
-            range_test::range_return_test_driver test_driver;
-
-            container_t cont;
-
-            test_driver(cont, policy);
-
-            cont.clear();
-            cont += 1;
-
-            test_driver(cont, policy);
-
-            cont.clear();
-            cont += 1,2,2,2,3,4,5,6,7,8,9;
-
-            test_driver(cont, policy);
+            return std::max_element(cont.begin(), cont.end(), Pred());
         }
+    };
 
-        template<class Container>
-        void test_max_element_impl()
-        {
-            test_max_element_impl<Container>(max_element_test_policy());
-            
-            test_max_element_impl<Container>(
-                max_element_pred_test_policy<std::less<int> >());
+    template<class Container, class TestPolicy>
+    void test_max_element_impl(TestPolicy policy)
+    {
+        using namespace boost::assign;
 
-            test_max_element_impl<Container>(
-                max_element_pred_test_policy<std::greater<int> >());
-        }
+        typedef BOOST_DEDUCED_TYPENAME Container::value_type value_t;
+        typedef BOOST_DEDUCED_TYPENAME boost::remove_const<Container>::type container_t;
 
-        void test_max_element()
-        {
-            test_max_element_impl< const std::vector<int> >();
-            test_max_element_impl< const std::deque<int> >();
-            test_max_element_impl< const std::list<int> >();
+        boost::range_test::range_return_test_driver test_driver;
 
-            test_max_element_impl< std::vector<int> >();
-            test_max_element_impl< std::deque<int> >();
-            test_max_element_impl< std::list<int> >();
-        }
+        container_t cont;
+
+        test_driver(cont, policy);
+
+        cont.clear();
+        cont += 1;
+
+        test_driver(cont, policy);
+
+        cont.clear();
+        cont += 1,2,2,2,3,4,5,6,7,8,9;
+
+        test_driver(cont, policy);
+    }
+
+    template<class Container>
+    void test_max_element_impl()
+    {
+        test_max_element_impl<Container>(max_element_test_policy());
+
+        test_max_element_impl<Container>(
+            max_element_pred_test_policy<std::less<int> >());
+
+        test_max_element_impl<Container>(
+            max_element_pred_test_policy<std::greater<int> >());
+    }
+
+    void test_max_element()
+    {
+        test_max_element_impl< const std::vector<int> >();
+        test_max_element_impl< const std::deque<int> >();
+        test_max_element_impl< const std::list<int> >();
+
+        test_max_element_impl< std::vector<int> >();
+        test_max_element_impl< std::deque<int> >();
+        test_max_element_impl< std::list<int> >();
     }
 }
 
@@ -159,7 +156,7 @@ init_unit_test_suite(int argc, char* argv[])
     boost::unit_test::test_suite* test
         = BOOST_TEST_SUITE( "RangeTestSuite.algorithm.max_element" );
 
-    test->add( BOOST_TEST_CASE( &boost::test_max_element ) );
+    test->add( BOOST_TEST_CASE( &boost_range_test_algorithm_max_element::test_max_element ) );
 
     return test;
 }
diff --git a/test/algorithm_test/min_element.cpp b/test/algorithm_test/min_element.cpp
index c8fceda..0f9fa68 100644
--- a/test/algorithm_test/min_element.cpp
+++ b/test/algorithm_test/min_element.cpp
@@ -22,132 +22,129 @@
 #include <deque>
 #include <vector>
 
-namespace boost
+namespace boost_range_test_algorithm_min_element
 {
-    namespace
+    class min_element_test_policy
     {
-        class min_element_test_policy
+    public:
+        template< class Container >
+        BOOST_DEDUCED_TYPENAME boost::range_iterator<Container>::type
+        test_iter(Container& cont)
         {
-        public:
-            template< class Container >
-            BOOST_DEDUCED_TYPENAME range_iterator<Container>::type
-            test_iter(Container& cont)
+            typedef BOOST_DEDUCED_TYPENAME boost::range_iterator<Container>::type iter_t;
+            iter_t result = boost::min_element(cont);
+            BOOST_CHECK( result == boost::min_element(boost::make_iterator_range(cont)) );
+            return result;
+        }
+
+        template< boost::range_return_value return_type >
+        struct test_range
+        {
+            template< class Container, class Policy >
+            BOOST_DEDUCED_TYPENAME boost::range_return<Container,return_type>::type
+            operator()(Policy&, Container& cont)
             {
-                typedef BOOST_DEDUCED_TYPENAME range_iterator<Container>::type iter_t;
-                iter_t result = boost::min_element(cont);
-                BOOST_CHECK( result == boost::min_element(boost::make_iterator_range(cont)) );
+                typedef BOOST_DEDUCED_TYPENAME boost::range_return<Container,return_type>::type result_t;
+                result_t result = boost::min_element<return_type>(cont);
+                BOOST_CHECK( result == boost::min_element<return_type>(boost::make_iterator_range(cont)) );
                 return result;
             }
-
-            template< range_return_value return_type >
-            struct test_range
-            {
-                template< class Container, class Policy >
-                BOOST_DEDUCED_TYPENAME range_return<Container,return_type>::type
-                operator()(Policy&, Container& cont)
-                {
-                    typedef BOOST_DEDUCED_TYPENAME range_return<Container,return_type>::type result_t;
-                    result_t result = boost::min_element<return_type>(cont);
-                    BOOST_CHECK( result == boost::min_element<return_type>(boost::make_iterator_range(cont)) );
-                    return result;
-                }
-            };
-
-            template< class Container >
-            BOOST_DEDUCED_TYPENAME range_iterator<Container>::type
-            reference(Container& cont)
-            {
-                return std::min_element(cont.begin(), cont.end());
-            }
         };
 
-        template<class Pred>
-        class min_element_pred_test_policy
+        template< class Container >
+        BOOST_DEDUCED_TYPENAME boost::range_iterator<Container>::type
+        reference(Container& cont)
         {
-        public:
-            template< class Container >
-            BOOST_DEDUCED_TYPENAME range_iterator<Container>::type
-            test_iter(Container& cont)
+            return std::min_element(cont.begin(), cont.end());
+        }
+    };
+
+    template<class Pred>
+    class min_element_pred_test_policy
+    {
+    public:
+        template< class Container >
+        BOOST_DEDUCED_TYPENAME boost::range_iterator<Container>::type
+        test_iter(Container& cont)
+        {
+            typedef BOOST_DEDUCED_TYPENAME boost::range_iterator<Container>::type iter_t;
+            iter_t result = boost::min_element(cont, Pred());
+            BOOST_CHECK( result == boost::min_element(
+                                    boost::make_iterator_range(cont), Pred()) );
+            return result;
+        }
+
+        Pred pred() const { return Pred(); }
+
+        template< boost::range_return_value return_type >
+        struct test_range
+        {
+            template< class Container, class Policy >
+            BOOST_DEDUCED_TYPENAME boost::range_return<Container,return_type>::type
+            operator()(Policy& policy, Container& cont)
             {
-                typedef BOOST_DEDUCED_TYPENAME range_iterator<Container>::type iter_t;
-                iter_t result = boost::min_element(cont, Pred());
-                BOOST_CHECK( result == boost::min_element(
-                                        boost::make_iterator_range(cont), Pred()) );
+                typedef BOOST_DEDUCED_TYPENAME boost::range_return<Container,return_type>::type result_t;
+                result_t result = boost::min_element<return_type>(cont, policy.pred());
+                BOOST_CHECK( result == boost::min_element<return_type>(
+                                boost::make_iterator_range(cont), policy.pred()) );
                 return result;
             }
-
-            Pred pred() const { return Pred(); }
-
-            template< range_return_value return_type >
-            struct test_range
-            {
-                template< class Container, class Policy >
-                BOOST_DEDUCED_TYPENAME range_return<Container,return_type>::type
-                operator()(Policy& policy, Container& cont)
-                {
-                    typedef BOOST_DEDUCED_TYPENAME range_return<Container,return_type>::type result_t;
-                    result_t result = boost::min_element<return_type>(cont, policy.pred());
-                    BOOST_CHECK( result == boost::min_element<return_type>(
-                                    boost::make_iterator_range(cont), policy.pred()) );
-                    return result;
-                }
-            };
-
-            template< class Container >
-            BOOST_DEDUCED_TYPENAME range_iterator<Container>::type
-            reference(Container& cont)
-            {
-                return std::min_element(cont.begin(), cont.end(), Pred());
-            }
         };
 
-        template<class Container, class TestPolicy>
-        void test_min_element_impl(TestPolicy policy)
+        template< class Container >
+        BOOST_DEDUCED_TYPENAME boost::range_iterator<Container>::type
+        reference(Container& cont)
         {
-            using namespace boost::assign;
-
-            typedef BOOST_DEDUCED_TYPENAME Container::value_type value_t;
-            typedef BOOST_DEDUCED_TYPENAME remove_const<Container>::type container_t;
-
-            range_test::range_return_test_driver test_driver;
-
-            container_t cont;
-
-            test_driver(cont, policy);
-
-            cont.clear();
-            cont += 1;
-
-            test_driver(cont, policy);
-
-            cont.clear();
-            cont += 1,2,2,2,3,4,5,6,7,8,9;
-
-            test_driver(cont, policy);
+            return std::min_element(cont.begin(), cont.end(), Pred());
         }
+    };
 
-        template<class Container>
-        void test_min_element_impl()
-        {
-            test_min_element_impl<Container>(min_element_test_policy());
-            
-            test_min_element_impl<Container>(
-                min_element_pred_test_policy<std::less<int> >());
+    template<class Container, class TestPolicy>
+    void test_min_element_impl(TestPolicy policy)
+    {
+        using namespace boost::assign;
 
-            test_min_element_impl<Container>(
-                min_element_pred_test_policy<std::greater<int> >());
-        }
+        typedef BOOST_DEDUCED_TYPENAME Container::value_type value_t;
+        typedef BOOST_DEDUCED_TYPENAME boost::remove_const<Container>::type container_t;
 
-        void test_min_element()
-        {
-            test_min_element_impl< const std::vector<int> >();
-            test_min_element_impl< const std::deque<int> >();
-            test_min_element_impl< const std::list<int> >();
+        boost::range_test::range_return_test_driver test_driver;
 
-            test_min_element_impl< std::vector<int> >();
-            test_min_element_impl< std::deque<int> >();
-            test_min_element_impl< std::list<int> >();
-        }
+        container_t cont;
+
+        test_driver(cont, policy);
+
+        cont.clear();
+        cont += 1;
+
+        test_driver(cont, policy);
+
+        cont.clear();
+        cont += 1,2,2,2,3,4,5,6,7,8,9;
+
+        test_driver(cont, policy);
+    }
+
+    template<class Container>
+    void test_min_element_impl()
+    {
+        test_min_element_impl<Container>(min_element_test_policy());
+
+        test_min_element_impl<Container>(
+            min_element_pred_test_policy<std::less<int> >());
+
+        test_min_element_impl<Container>(
+            min_element_pred_test_policy<std::greater<int> >());
+    }
+
+    void test_min_element()
+    {
+        test_min_element_impl< const std::vector<int> >();
+        test_min_element_impl< const std::deque<int> >();
+        test_min_element_impl< const std::list<int> >();
+
+        test_min_element_impl< std::vector<int> >();
+        test_min_element_impl< std::deque<int> >();
+        test_min_element_impl< std::list<int> >();
     }
 }
 
@@ -157,7 +154,7 @@ init_unit_test_suite(int argc, char* argv[])
     boost::unit_test::test_suite* test
         = BOOST_TEST_SUITE( "RangeTestSuite.algorithm.min_element" );
 
-    test->add( BOOST_TEST_CASE( &boost::test_min_element ) );
+    test->add( BOOST_TEST_CASE( &boost_range_test_algorithm_min_element::test_min_element ) );
 
     return test;
 }
diff --git a/test/algorithm_test/partition.cpp b/test/algorithm_test/partition.cpp
index 0160dae..22aefd6 100644
--- a/test/algorithm_test/partition.cpp
+++ b/test/algorithm_test/partition.cpp
@@ -21,109 +21,106 @@
 #include <deque>
 #include <vector>
 
-namespace boost
+namespace boost_range_test_algorithm_partition
 {
-    namespace
+    struct equal_to_5
     {
-        struct equal_to_5
-        {
-            typedef bool result_type;
-            typedef int argument_type;
-            bool operator()(int x) const { return x == 5; }
-        };
+        typedef bool result_type;
+        typedef int argument_type;
+        bool operator()(int x) const { return x == 5; }
+    };
 
-        // test the 'partition' algorithm
-        template<class UnaryPredicate>
-        class partition_test_policy
+    // test the 'partition' algorithm
+    template<class UnaryPredicate>
+    class partition_test_policy
+    {
+    public:
+        template< class Container >
+        BOOST_DEDUCED_TYPENAME boost::range_iterator<Container>::type
+        test_iter(Container& cont)
         {
-        public:
-            template< class Container >
-            BOOST_DEDUCED_TYPENAME range_iterator<Container>::type
-            test_iter(Container& cont)
+            typedef BOOST_DEDUCED_TYPENAME boost::range_iterator<Container>::type iter_t;
+
+            const Container old_cont(cont);
+            Container cont2(old_cont);
+            iter_t result = boost::partition(cont, UnaryPredicate());
+
+            boost::partition(cont2, UnaryPredicate());
+            cont2 = old_cont;
+            boost::partition(
+                boost::make_iterator_range(cont2), UnaryPredicate());
+
+            BOOST_CHECK_EQUAL_COLLECTIONS( cont.begin(), cont.end(),
+                                           cont2.begin(), cont2.end() );
+
+            return result;
+        }
+
+        UnaryPredicate pred() const { return UnaryPredicate(); }
+
+        template< boost::range_return_value return_type >
+        struct test_range
+        {
+            template< class Container, class Policy >
+            BOOST_DEDUCED_TYPENAME boost::range_return<Container,return_type>::type
+            operator()(Policy& policy, Container& cont)
             {
-                typedef BOOST_DEDUCED_TYPENAME range_iterator<Container>::type iter_t;
+                typedef BOOST_DEDUCED_TYPENAME boost::range_return<Container,return_type>::type result_t;
 
                 const Container old_cont(cont);
                 Container cont2(old_cont);
-                iter_t result = boost::partition(cont, UnaryPredicate());
+                result_t result = boost::partition<return_type>(cont, policy.pred());
 
-                boost::partition(cont2, UnaryPredicate());
-                cont2 = old_cont;
-                boost::partition(
-                    boost::make_iterator_range(cont2), UnaryPredicate());
+                // Test that operation a temporary created by using
+                // make_iterator_range.
+                boost::partition<return_type>(
+                    boost::make_iterator_range(cont2), policy.pred());
 
                 BOOST_CHECK_EQUAL_COLLECTIONS( cont.begin(), cont.end(),
                                                cont2.begin(), cont2.end() );
 
                 return result;
             }
-
-            UnaryPredicate pred() const { return UnaryPredicate(); }
-
-            template< range_return_value return_type >
-            struct test_range
-            {
-                template< class Container, class Policy >
-                BOOST_DEDUCED_TYPENAME range_return<Container,return_type>::type
-                operator()(Policy& policy, Container& cont)
-                {
-                    typedef BOOST_DEDUCED_TYPENAME range_return<Container,return_type>::type result_t;
-
-                    const Container old_cont(cont);
-                    Container cont2(old_cont);
-                    result_t result = boost::partition<return_type>(cont, policy.pred());
-
-                    // Test that operation a temporary created by using
-                    // make_iterator_range.
-                    boost::partition<return_type>(
-                        boost::make_iterator_range(cont2), policy.pred());
-
-                    BOOST_CHECK_EQUAL_COLLECTIONS( cont.begin(), cont.end(),
-                                                   cont2.begin(), cont2.end() );
-
-                    return result;
-                }
-            };
-
-            template< class Container >
-            BOOST_DEDUCED_TYPENAME range_iterator<Container>::type
-            reference(Container& cont)
-            {
-                return std::partition(cont.begin(), cont.end(), UnaryPredicate());
-            }
         };
 
-        template<class Container>
-        void test_partition_impl()
+        template< class Container >
+        BOOST_DEDUCED_TYPENAME boost::range_iterator<Container>::type
+        reference(Container& cont)
         {
-            using namespace boost::assign;
-
-            range_test::range_return_test_driver test_driver;
-
-            partition_test_policy< equal_to_5 > policy;
-
-            Container cont;
-            test_driver(cont, policy);
-
-            cont.clear();
-            cont += 1;
-            test_driver(cont, policy);
-
-            cont.clear();
-            cont += 1,2,2,2,2,2,3,4,5,6,7,8,9;
-            test_driver(cont, policy);
-
-            cont.clear();
-            cont += 1,2,2,2,2,2,3,3,3,3,4,4,4,4,4,4,4,5,6,7,8,9;
-            test_driver(cont, policy);
+            return std::partition(cont.begin(), cont.end(), UnaryPredicate());
         }
+    };
 
-        void test_partition()
-        {
-            test_partition_impl< std::vector<int> >();
-            test_partition_impl< std::list<int> >();
-            test_partition_impl< std::deque<int> >();
-        }
+    template<class Container>
+    void test_partition_impl()
+    {
+        using namespace boost::assign;
+
+        boost::range_test::range_return_test_driver test_driver;
+
+        partition_test_policy< equal_to_5 > policy;
+
+        Container cont;
+        test_driver(cont, policy);
+
+        cont.clear();
+        cont += 1;
+        test_driver(cont, policy);
+
+        cont.clear();
+        cont += 1,2,2,2,2,2,3,4,5,6,7,8,9;
+        test_driver(cont, policy);
+
+        cont.clear();
+        cont += 1,2,2,2,2,2,3,3,3,3,4,4,4,4,4,4,4,5,6,7,8,9;
+        test_driver(cont, policy);
+    }
+
+    void test_partition()
+    {
+        test_partition_impl< std::vector<int> >();
+        test_partition_impl< std::list<int> >();
+        test_partition_impl< std::deque<int> >();
     }
 }
 
@@ -133,7 +130,7 @@ init_unit_test_suite(int argc, char* argv[])
     boost::unit_test::test_suite* test
         = BOOST_TEST_SUITE( "RangeTestSuite.algorithm.partition" );
 
-    test->add( BOOST_TEST_CASE( &boost::test_partition ) );
+    test->add( BOOST_TEST_CASE( &boost_range_test_algorithm_partition::test_partition ) );
 
     return test;
 }
diff --git a/test/algorithm_test/stable_partition.cpp b/test/algorithm_test/stable_partition.cpp
index 5f55b7d..3bf20e2 100644
--- a/test/algorithm_test/stable_partition.cpp
+++ b/test/algorithm_test/stable_partition.cpp
@@ -21,116 +21,112 @@
 #include <deque>
 #include <vector>
 
-namespace boost
+namespace boost_range_test_algorithm_stable_partition
 {
-    namespace
+    struct equal_to_5
     {
-        struct equal_to_5
-        {
-            typedef bool result_type;
-            typedef int argument_type;
-            bool operator()(int x) const { return x == 5; }
-        };
+        typedef bool result_type;
+        typedef int argument_type;
+        bool operator()(int x) const { return x == 5; }
+    };
 
-        // test the 'partition' algorithm
-        template<class UnaryPredicate>
-        class stable_partition_test_policy
+    // test the 'partition' algorithm
+    template<class UnaryPredicate>
+    class stable_partition_test_policy
+    {
+    public:
+        template< class Container >
+        BOOST_DEDUCED_TYPENAME boost::range_iterator<Container>::type
+        test_iter(Container& cont)
         {
-        public:
-            template< class Container >
-            BOOST_DEDUCED_TYPENAME range_iterator<Container>::type
-            test_iter(Container& cont)
+            Container cont2(cont);
+
+            typedef BOOST_DEDUCED_TYPENAME boost::range_iterator<Container>::type iter_t;
+            iter_t result = boost::stable_partition(cont, UnaryPredicate());
+
+            iter_t temp_result = boost::stable_partition(
+                boost::make_iterator_range(cont2), UnaryPredicate());
+
+            BOOST_CHECK_EQUAL( std::distance(cont.begin(), result),
+                               std::distance(cont2.begin(), temp_result) );
+
+            BOOST_CHECK_EQUAL_COLLECTIONS( cont.begin(), cont.end(),
+                                           cont2.begin(), cont2.end() );
+
+            return result;
+        }
+
+        UnaryPredicate pred() const { return UnaryPredicate(); }
+
+        template< boost::range_return_value return_type >
+        struct test_range
+        {
+            template< class Container, class Policy >
+            BOOST_DEDUCED_TYPENAME boost::range_return<Container,return_type>::type
+            operator()(Policy& policy, Container& cont)
             {
+                typedef BOOST_DEDUCED_TYPENAME boost::range_return<Container,return_type>::type result_t;
                 Container cont2(cont);
-                
-                typedef BOOST_DEDUCED_TYPENAME range_iterator<Container>::type iter_t;
-                iter_t result = boost::stable_partition(cont, UnaryPredicate());
-                
-                iter_t temp_result = boost::stable_partition(
-                    boost::make_iterator_range(cont2), UnaryPredicate());
-                    
-                BOOST_CHECK_EQUAL( std::distance(cont.begin(), result),
-                                   std::distance(cont2.begin(), temp_result) );
-                                   
-                BOOST_CHECK_EQUAL_COLLECTIONS( cont.begin(), cont.end(),
-                                               cont2.begin(), cont2.end() );
-                
+                result_t result = boost::stable_partition<return_type>(cont, policy.pred());
+
+                result_t result2 = boost::stable_partition<return_type>(
+                                    boost::make_iterator_range(cont2), policy.pred());
+
+                BOOST_CHECK_EQUAL_COLLECTIONS( cont2.begin(), cont2.end(),
+                                               cont.begin(), cont.end() );
+
                 return result;
             }
-
-            UnaryPredicate pred() const { return UnaryPredicate(); }
-
-            template< range_return_value return_type >
-            struct test_range
-            {
-                template< class Container, class Policy >
-                BOOST_DEDUCED_TYPENAME range_return<Container,return_type>::type
-                operator()(Policy& policy, Container& cont)
-                {
-                    typedef BOOST_DEDUCED_TYPENAME range_return<Container,return_type>::type result_t;
-                    Container cont2(cont);
-                    result_t result = boost::stable_partition<return_type>(cont, policy.pred());
-                    
-                    result_t result2 = boost::stable_partition<return_type>(
-                                        boost::make_iterator_range(cont2), policy.pred());
-                                        
-                    BOOST_CHECK_EQUAL_COLLECTIONS( cont2.begin(), cont2.end(),
-                                                   cont.begin(), cont.end() );
-                                        
-                    return result;
-                }
-            };
-
-            template< class Container >
-            BOOST_DEDUCED_TYPENAME range_iterator<Container>::type
-            reference(Container& cont)
-            {
-                return std::stable_partition(cont.begin(), cont.end(), UnaryPredicate());
-            }
         };
 
-        template<class Container>
-        void test_stable_partition_impl()
+        template< class Container >
+        BOOST_DEDUCED_TYPENAME boost::range_iterator<Container>::type
+        reference(Container& cont)
         {
-            using namespace boost::assign;
-
-            range_test::range_return_test_driver test_driver;
-
-            stable_partition_test_policy< equal_to_5 > policy;
-
-            Container cont;
-            test_driver(cont, policy);
-
-            cont.clear();
-            cont += 1;
-            test_driver(cont, policy);
-
-            cont.clear();
-            cont += 1,2,2,2,2,2,3,4,5,6,7,8,9;
-            test_driver(cont, policy);
-
-            cont.clear();
-            cont += 1,2,2,2,2,2,3,3,3,3,4,4,4,4,4,4,4,5,6,7,8,9;
-            test_driver(cont, policy);
+            return std::stable_partition(cont.begin(), cont.end(), UnaryPredicate());
         }
+    };
 
-        void test_stable_partition()
-        {
-            test_stable_partition_impl< std::vector<int> >();
-            test_stable_partition_impl< std::list<int> >();
-            test_stable_partition_impl< std::deque<int> >();
-        }
+    template<class Container>
+    void test_stable_partition_impl()
+    {
+        using namespace boost::assign;
+
+        boost::range_test::range_return_test_driver test_driver;
+
+        stable_partition_test_policy< equal_to_5 > policy;
+
+        Container cont;
+        test_driver(cont, policy);
+
+        cont.clear();
+        cont += 1;
+        test_driver(cont, policy);
+
+        cont.clear();
+        cont += 1,2,2,2,2,2,3,4,5,6,7,8,9;
+        test_driver(cont, policy);
+
+        cont.clear();
+        cont += 1,2,2,2,2,2,3,3,3,3,4,4,4,4,4,4,4,5,6,7,8,9;
+        test_driver(cont, policy);
+    }
+
+    void test_stable_partition()
+    {
+        test_stable_partition_impl< std::vector<int> >();
+        test_stable_partition_impl< std::list<int> >();
+        test_stable_partition_impl< std::deque<int> >();
     }
 }
 
-
 boost::unit_test::test_suite*
 init_unit_test_suite(int argc, char* argv[])
 {
     boost::unit_test::test_suite* test
         = BOOST_TEST_SUITE( "RangeTestSuite.algorithm.stable_partition" );
 
-    test->add( BOOST_TEST_CASE( &boost::test_stable_partition ) );
+    test->add( BOOST_TEST_CASE( &boost_range_test_algorithm_stable_partition::test_stable_partition ) );
 
     return test;
 }
diff --git a/test/algorithm_test/unique.cpp b/test/algorithm_test/unique.cpp
index 49af0e3..880c131 100644
--- a/test/algorithm_test/unique.cpp
+++ b/test/algorithm_test/unique.cpp
@@ -23,156 +23,153 @@
 #include <deque>
 #include <vector>
 
-namespace boost
+namespace boost_range_test_algorithm_unique
 {
-    namespace
+    // test the 'unique' algorithm without a predicate
+    class unique_test_policy
     {
-        // test the 'unique' algorithm without a predicate
-        class unique_test_policy 
+    public:
+        template< class Container >
+        BOOST_DEDUCED_TYPENAME boost::range_iterator<Container>::type
+        test_iter(Container& cont)
         {
-        public:
-            template< class Container >
-            BOOST_DEDUCED_TYPENAME range_iterator<Container>::type
-            test_iter(Container& cont)
-            {
-                // There isn't an iterator return version of boost::unique, so just
-                // perform the standard algorithm
-                return std::unique(cont.begin(), cont.end());
-            }
+            // There isn't an iterator return version of boost::unique, so just
+            // perform the standard algorithm
+            return std::unique(cont.begin(), cont.end());
+        }
 
-            template< range_return_value return_type >
-            struct test_range
+        template< boost::range_return_value return_type >
+        struct test_range
+        {
+            template< class Container, class Policy >
+            BOOST_DEDUCED_TYPENAME boost::range_return<Container,return_type>::type
+            operator()(Policy&, Container& cont)
             {
-                template< class Container, class Policy >
-                BOOST_DEDUCED_TYPENAME range_return<Container,return_type>::type
-                operator()(Policy&, Container& cont)
-                {
-                    typedef BOOST_DEDUCED_TYPENAME range_return<Container,return_type>::type result_t;
-                    
-                    Container cont2(cont);
-                    
-                    result_t result = boost::unique<return_type>(cont);
-                    
-                    boost::unique<return_type>(boost::make_iterator_range(cont2));
-                    
-                    BOOST_CHECK_EQUAL_COLLECTIONS( cont.begin(), cont.end(),
-                                                   cont2.begin(), cont2.end() );
-                    
-                    return result;
-                }
-            };
+                typedef BOOST_DEDUCED_TYPENAME boost::range_return<Container,return_type>::type result_t;
 
-            template< class Container >
-            BOOST_DEDUCED_TYPENAME range_iterator<Container>::type
-            reference(Container& cont)
-            {
-                return std::unique(cont.begin(), cont.end());
+                Container cont2(cont);
+
+                result_t result = boost::unique<return_type>(cont);
+
+                boost::unique<return_type>(boost::make_iterator_range(cont2));
+
+                BOOST_CHECK_EQUAL_COLLECTIONS( cont.begin(), cont.end(),
+                                               cont2.begin(), cont2.end() );
+
+                return result;
             }
         };
 
-        // test the 'unique' algorithm with a predicate
-        template<class Pred>
-        class unique_pred_test_policy
+        template< class Container >
+        BOOST_DEDUCED_TYPENAME boost::range_iterator<Container>::type
+        reference(Container& cont)
         {
-        public:
-            template< class Container >
-            BOOST_DEDUCED_TYPENAME range_iterator<Container>::type
-            test_iter(Container& cont)
-            {
-                // There isn't an iterator return version of boost::unique, so just
-                // perform the standard algorithm
-                return std::unique(cont.begin(), cont.end(), Pred());
-            }
+            return std::unique(cont.begin(), cont.end());
+        }
+    };
 
-            Pred pred() const { return Pred(); }
+    // test the 'unique' algorithm with a predicate
+    template<class Pred>
+    class unique_pred_test_policy
+    {
+    public:
+        template< class Container >
+        BOOST_DEDUCED_TYPENAME boost::range_iterator<Container>::type
+        test_iter(Container& cont)
+        {
+            // There isn't an iterator return version of boost::unique, so just
+            // perform the standard algorithm
+            return std::unique(cont.begin(), cont.end(), Pred());
+        }
 
-            template< range_return_value return_type >
-            struct test_range
-            {
-                template< class Container, class Policy >
-                BOOST_DEDUCED_TYPENAME range_return<Container,return_type>::type
-                operator()(Policy& policy, Container& cont)
-                {
-                    typedef BOOST_DEDUCED_TYPENAME range_return<Container,return_type>::type result_t;
-                    
-                    Container cont2(cont);
-                    
-                    result_t result = boost::unique<return_type>(cont, policy.pred());
-                    
-                    boost::unique<return_type>(boost::make_iterator_range(cont2), policy.pred());
-                    
-                    BOOST_CHECK_EQUAL_COLLECTIONS( cont.begin(), cont.end(),
-                                                   cont2.begin(), cont2.end() );
-                    
-                    return result;
-                }
-            };
+        Pred pred() const { return Pred(); }
 
-            template< class Container >
-            BOOST_DEDUCED_TYPENAME range_iterator<Container>::type
-            reference(Container& cont)
+        template< boost::range_return_value return_type >
+        struct test_range
+        {
+            template< class Container, class Policy >
+            BOOST_DEDUCED_TYPENAME boost::range_return<Container,return_type>::type
+            operator()(Policy& policy, Container& cont)
             {
-                return std::unique(cont.begin(), cont.end(), Pred());
+                typedef BOOST_DEDUCED_TYPENAME boost::range_return<Container,return_type>::type result_t;
+
+                Container cont2(cont);
+
+                result_t result = boost::unique<return_type>(cont, policy.pred());
+
+                boost::unique<return_type>(boost::make_iterator_range(cont2), policy.pred());
+
+                BOOST_CHECK_EQUAL_COLLECTIONS( cont.begin(), cont.end(),
+                                               cont2.begin(), cont2.end() );
+
+                return result;
             }
         };
 
-        template<class Container, class TestPolicy, class Pred>
-        void test_unique_impl(TestPolicy policy, Pred pred)
+        template< class Container >
+        BOOST_DEDUCED_TYPENAME boost::range_iterator<Container>::type
+        reference(Container& cont)
         {
-            using namespace boost::assign;
-
-            typedef BOOST_DEDUCED_TYPENAME Container::value_type value_t;
-
-            range_test::range_return_test_driver test_driver;
-
-            Container cont;
-
-            test_driver(cont, policy);
-
-            cont.clear();
-            cont += 1;
-
-            std::vector<value_t> temp(cont.begin(), cont.end());
-            std::sort(temp.begin(), temp.end(), pred);
-            cont.assign(temp.begin(), temp.end());
-
-            test_driver(cont, policy);
-
-            cont.clear();
-            cont += 1,2,2,2,2,3,4,5,6,7,8,9;
-            
-            temp.assign(cont.begin(), cont.end());
-            std::sort(temp.begin(), temp.end(), pred);
-            cont.assign(temp.begin(), temp.end());
-
-            test_driver(cont, policy);
+            return std::unique(cont.begin(), cont.end(), Pred());
         }
+    };
 
-        template<class Container>
-        void test_unique_impl()
-        {
-            test_unique_impl<Container>(
-                unique_test_policy(),
-                std::less<int>()
-                );
+    template<class Container, class TestPolicy, class Pred>
+    void test_unique_impl(TestPolicy policy, Pred pred)
+    {
+        using namespace boost::assign;
 
-            test_unique_impl<Container>(
-                unique_pred_test_policy<std::less<int> >(),
-                std::less<int>()
-                );
-            
-            test_unique_impl<Container>(
-                unique_pred_test_policy<std::greater<int> >(),
-                std::greater<int>()
-                );
-        }
+        typedef BOOST_DEDUCED_TYPENAME Container::value_type value_t;
 
-        void test_unique()
-        {
-            test_unique_impl< std::vector<int> >();
-            test_unique_impl< std::list<int> >();
-            test_unique_impl< std::deque<int> >();
-        }
+        boost::range_test::range_return_test_driver test_driver;
+
+        Container cont;
+
+        test_driver(cont, policy);
+
+        cont.clear();
+        cont += 1;
+
+        std::vector<value_t> temp(cont.begin(), cont.end());
+        std::sort(temp.begin(), temp.end(), pred);
+        cont.assign(temp.begin(), temp.end());
+
+        test_driver(cont, policy);
+
+        cont.clear();
+        cont += 1,2,2,2,2,3,4,5,6,7,8,9;
+
+        temp.assign(cont.begin(), cont.end());
+        std::sort(temp.begin(), temp.end(), pred);
+        cont.assign(temp.begin(), temp.end());
+
+        test_driver(cont, policy);
+    }
+
+    template<class Container>
+    void test_unique_impl()
+    {
+        test_unique_impl<Container>(
+            unique_test_policy(),
+            std::less<int>()
+            );
+
+        test_unique_impl<Container>(
+            unique_pred_test_policy<std::less<int> >(),
+            std::less<int>()
+            );
+
+        test_unique_impl<Container>(
+            unique_pred_test_policy<std::greater<int> >(),
+            std::greater<int>()
+            );
+    }
+
+    void test_unique()
+    {
+        test_unique_impl< std::vector<int> >();
+        test_unique_impl< std::list<int> >();
+        test_unique_impl< std::deque<int> >();
     }
 }
 
@@ -182,7 +179,7 @@ init_unit_test_suite(int argc, char* argv[])
     boost::unit_test::test_suite* test
         = BOOST_TEST_SUITE( "RangeTestSuite.algorithm.unique" );
 
-    test->add( BOOST_TEST_CASE( &boost::test_unique ) );
+    test->add( BOOST_TEST_CASE( &boost_range_test_algorithm_unique::test_unique ) );
 
     return test;
 }
diff --git a/test/algorithm_test/upper_bound.cpp b/test/algorithm_test/upper_bound.cpp
index 95e3965..daae764 100644
--- a/test/algorithm_test/upper_bound.cpp
+++ b/test/algorithm_test/upper_bound.cpp
@@ -21,144 +21,141 @@
 #include <deque>
 #include <vector>
 
-namespace boost
+namespace boost_range_test_algorithm_upper_bound
 {
-    namespace
+    class upper_bound_policy
     {
-        class upper_bound_policy 
+    public:
+        template< class Container >
+        BOOST_DEDUCED_TYPENAME boost::range_iterator<Container>::type
+        test_iter(Container& cont)
         {
-        public:
-            template< class Container >
-            BOOST_DEDUCED_TYPENAME range_iterator<Container>::type
-            test_iter(Container& cont)
-            {
-                typedef BOOST_DEDUCED_TYPENAME range_iterator<Container>::type iter_t;
-                iter_t result = boost::upper_bound(cont, 5);
-                BOOST_CHECK( result == boost::upper_bound(boost::make_iterator_range(cont), 5) );
-                return result;
-            }
-
-            template<range_return_value result_type>
-            struct test_range
-            {
-                template<class Container, class Policy>
-                BOOST_DEDUCED_TYPENAME range_return<Container,result_type>::type
-                operator()(Policy&, Container& cont)
-                {
-                    typedef BOOST_DEDUCED_TYPENAME range_return<Container,result_type>::type result_t;
-                    result_t result = boost::upper_bound<result_type>(cont, 5);
-                    BOOST_CHECK( result == boost::upper_bound<result_type>(boost::make_iterator_range(cont), 5) );
-                    return result;
-                }
-            };
-
-            template< class Container >
-            BOOST_DEDUCED_TYPENAME range_iterator<Container>::type
-            reference(Container& cont)
-            {
-                return std::upper_bound(cont.begin(), cont.end(), 5);
-            }
-        };
-
-        template< class BinaryPredicate >
-        struct upper_bound_pred_policy
-        {
-            template< class Container >
-            BOOST_DEDUCED_TYPENAME range_iterator<Container>::type
-            test_iter(Container& cont)
-            {
-                typedef BOOST_DEDUCED_TYPENAME range_iterator<Container>::type iter_t;
-                iter_t result = boost::upper_bound(cont, 5, BinaryPredicate());
-                BOOST_CHECK( result == boost::upper_bound(boost::make_iterator_range(cont), 5, BinaryPredicate()) );
-                return result;
-            }
-
-            template< range_return_value result_type>
-            struct test_range
-            {
-                template< class Container, class Policy >
-                BOOST_DEDUCED_TYPENAME range_return<Container,result_type>::type
-                operator()(Policy& policy, Container& cont)
-                {
-                    typedef BOOST_DEDUCED_TYPENAME range_return<Container,result_type>::type result_t;
-                    
-                    result_t result = boost::upper_bound<result_type>(cont, 5, policy.pred());
-                    
-                    BOOST_CHECK( result == boost::upper_bound<result_type>(
-                        boost::make_iterator_range(cont), 5, policy.pred()) );
-                        
-                    return result;
-                }
-            };
-
-            template<class Container>
-            BOOST_DEDUCED_TYPENAME range_iterator<Container>::type
-            reference(Container& cont)
-            {
-                return std::upper_bound(
-                        cont.begin(), cont.end(), 5, BinaryPredicate());
-            }
-        
-            BinaryPredicate& pred() { return m_pred; }
-        
-        private:
-            BinaryPredicate m_pred;
-        };
-
-        template<class Container,
-                 class TestPolicy,
-                 class BinaryPredicate>
-        void test_upper_bound_impl(TestPolicy policy, BinaryPredicate pred)
-        {
-            using namespace boost::assign;
-
-            typedef BOOST_DEDUCED_TYPENAME remove_const<Container>::type container_t;
-            typedef BOOST_DEDUCED_TYPENAME Container::value_type value_t;
-
-            range_test::range_return_test_driver test_driver;
-
-            container_t mcont;
-            Container& cont = mcont;
-
-            test_driver(cont, policy);
-
-            mcont.clear();
-            mcont += 1;
-
-            std::vector<value_t> temp(mcont.begin(), mcont.end());
-            std::sort(temp.begin(), temp.end(), pred);
-            mcont.assign(temp.begin(), temp.end());
-
-            test_driver(cont, policy);
-
-            mcont.clear();
-            mcont += 1,2,3,4,5,6,7,8,9;
-
-            temp.assign(mcont.begin(), mcont.end());
-            std::sort(temp.begin(), temp.end(), pred);
-            mcont.assign(temp.begin(), temp.end());
-
-            test_driver(cont, policy);
+            typedef BOOST_DEDUCED_TYPENAME boost::range_iterator<Container>::type iter_t;
+            iter_t result = boost::upper_bound(cont, 5);
+            BOOST_CHECK( result == boost::upper_bound(boost::make_iterator_range(cont), 5) );
+            return result;
         }
 
+        template<boost::range_return_value result_type>
+        struct test_range
+        {
+            template<class Container, class Policy>
+            BOOST_DEDUCED_TYPENAME boost::range_return<Container,result_type>::type
+            operator()(Policy&, Container& cont)
+            {
+                typedef BOOST_DEDUCED_TYPENAME boost::range_return<Container,result_type>::type result_t;
+                result_t result = boost::upper_bound<result_type>(cont, 5);
+                BOOST_CHECK( result == boost::upper_bound<result_type>(boost::make_iterator_range(cont), 5) );
+                return result;
+            }
+        };
+
+        template< class Container >
+        BOOST_DEDUCED_TYPENAME boost::range_iterator<Container>::type
+        reference(Container& cont)
+        {
+            return std::upper_bound(cont.begin(), cont.end(), 5);
+        }
+    };
+
+    template< class BinaryPredicate >
+    struct upper_bound_pred_policy
+    {
+        template< class Container >
+        BOOST_DEDUCED_TYPENAME boost::range_iterator<Container>::type
+        test_iter(Container& cont)
+        {
+            typedef BOOST_DEDUCED_TYPENAME boost::range_iterator<Container>::type iter_t;
+            iter_t result = boost::upper_bound(cont, 5, BinaryPredicate());
+            BOOST_CHECK( result == boost::upper_bound(boost::make_iterator_range(cont), 5, BinaryPredicate()) );
+            return result;
+        }
+
+        template< boost::range_return_value result_type>
+        struct test_range
+        {
+            template< class Container, class Policy >
+            BOOST_DEDUCED_TYPENAME boost::range_return<Container,result_type>::type
+            operator()(Policy& policy, Container& cont)
+            {
+                typedef BOOST_DEDUCED_TYPENAME boost::range_return<Container,result_type>::type result_t;
+
+                result_t result = boost::upper_bound<result_type>(cont, 5, policy.pred());
+
+                BOOST_CHECK( result == boost::upper_bound<result_type>(
+                    boost::make_iterator_range(cont), 5, policy.pred()) );
+
+                return result;
+            }
+        };
+
         template<class Container>
-        void test_upper_bound_impl()
+        BOOST_DEDUCED_TYPENAME boost::range_iterator<Container>::type
+        reference(Container& cont)
         {
-            test_upper_bound_impl<Container>(
-                upper_bound_policy(),
-                std::less<int>()
-                );
-
-            test_upper_bound_impl<Container>(
-                upper_bound_pred_policy<std::less<int> >(),
-                std::less<int>()
-                );
-
-            test_upper_bound_impl<Container>(
-                upper_bound_pred_policy<std::greater<int> >(),
-                std::greater<int>()
-                );
+            return std::upper_bound(
+                    cont.begin(), cont.end(), 5, BinaryPredicate());
         }
+
+        BinaryPredicate& pred() { return m_pred; }
+
+    private:
+        BinaryPredicate m_pred;
+    };
+
+    template<class Container,
+             class TestPolicy,
+             class BinaryPredicate>
+    void test_upper_bound_impl(TestPolicy policy, BinaryPredicate pred)
+    {
+        using namespace boost::assign;
+
+        typedef BOOST_DEDUCED_TYPENAME boost::remove_const<Container>::type container_t;
+        typedef BOOST_DEDUCED_TYPENAME Container::value_type value_t;
+
+        boost::range_test::range_return_test_driver test_driver;
+
+        container_t mcont;
+        Container& cont = mcont;
+
+        test_driver(cont, policy);
+
+        mcont.clear();
+        mcont += 1;
+
+        std::vector<value_t> temp(mcont.begin(), mcont.end());
+        std::sort(temp.begin(), temp.end(), pred);
+        mcont.assign(temp.begin(), temp.end());
+
+        test_driver(cont, policy);
+
+        mcont.clear();
+        mcont += 1,2,3,4,5,6,7,8,9;
+
+        temp.assign(mcont.begin(), mcont.end());
+        std::sort(temp.begin(), temp.end(), pred);
+        mcont.assign(temp.begin(), temp.end());
+
+        test_driver(cont, policy);
+    }
+
+    template<class Container>
+    void test_upper_bound_impl()
+    {
+        test_upper_bound_impl<Container>(
+            upper_bound_policy(),
+            std::less<int>()
+            );
+
+        test_upper_bound_impl<Container>(
+            upper_bound_pred_policy<std::less<int> >(),
+            std::less<int>()
+            );
+
+        test_upper_bound_impl<Container>(
+            upper_bound_pred_policy<std::greater<int> >(),
+            std::greater<int>()
+            );
     }
 
     void test_upper_bound()
@@ -179,7 +176,7 @@ init_unit_test_suite(int argc, char* argv[])
     boost::unit_test::test_suite* test
         = BOOST_TEST_SUITE( "RangeTestSuite.algorithm.upper_bound" );
 
-    test->add( BOOST_TEST_CASE( &boost::test_upper_bound ) );
+    test->add( BOOST_TEST_CASE( &boost_range_test_algorithm_upper_bound::test_upper_bound ) );
 
     return test;
 }
diff --git a/test/begin.cpp b/test/begin.cpp
new file mode 100644
index 0000000..eb745c2
--- /dev/null
+++ b/test/begin.cpp
@@ -0,0 +1,119 @@
+// Boost.Range library
+//
+//  Copyright Neil Groves 2010. 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/detail/workaround.hpp>
+
+#if BOOST_WORKAROUND(__BORLANDC__, BOOST_TESTED_AT(0x564))
+#  pragma warn -8091 // supress warning in Boost.Test
+#  pragma warn -8057 // unused argument argc/argv in Boost.Test
+#endif
+
+#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>
+
+namespace mock_std
+{
+    template<class SinglePassRange>
+    inline BOOST_DEDUCED_TYPENAME boost::range_iterator<SinglePassRange>::type
+    begin(SinglePassRange& rng)
+    {
+        return rng.begin();
+    }
+
+    template<class SinglePassRange>
+    inline BOOST_DEDUCED_TYPENAME boost::range_iterator<const SinglePassRange>::type
+    begin(const SinglePassRange& rng)
+    {
+        return rng.begin();
+    }
+
+    template<class SinglePassRange>
+    void mock_algorithm_using_begin(const SinglePassRange& rng)
+    {
+        BOOST_CHECK( begin(rng) == rng.begin() );
+    }
+
+    template<class SinglePassRange>
+    void mock_algorithm_using_begin(SinglePassRange& rng)
+    {
+        BOOST_CHECK( begin(rng) == rng.begin() );
+    }
+}
+
+namespace boost
+{
+#ifdef BOOST_RANGE_SIMULATE_BEGIN_WITHOUT_ADL_NAMESPACE_BARRIER
+    template<class SinglePassRange>
+    inline BOOST_DEDUCED_TYPENAME range_iterator<SinglePassRange>::type
+    begin(SinglePassRange& rng)
+    {
+        return rng.begin();
+    }
+
+    template<class SinglePassRange>
+    inline BOOST_DEDUCED_TYPENAME range_iterator<const SinglePassRange>::type
+    begin(const SinglePassRange& rng)
+    {
+        return rng.begin();
+    }
+#endif
+
+    class MockTestBeginCollection
+    {
+    public:
+        typedef char value_type;
+        typedef const char* const_pointer;
+        typedef char* pointer;
+        typedef const_pointer const_iterator;
+        typedef pointer iterator;
+
+        MockTestBeginCollection()
+            : m_first()
+            , m_last()
+        {
+        }
+
+        const_iterator begin() const { return m_first; }
+        iterator begin() { return m_first; }
+        const_iterator end() const { return m_last; }
+        iterator end() { return m_last; }
+
+    private:
+        iterator m_first;
+        iterator m_last;
+    };
+}
+
+namespace
+{
+    void test_range_begin()
+    {
+        boost::MockTestBeginCollection c;
+        const boost::MockTestBeginCollection& const_c = c;
+        mock_std::mock_algorithm_using_begin(const_c);
+        mock_std::mock_algorithm_using_begin(c);
+    }
+}
+
+using boost::unit_test_framework::test_suite;
+
+boost::unit_test_framework::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" );
+
+    test->add( BOOST_TEST_CASE( &test_range_begin ) );
+
+    return test;
+}
+
+
diff --git a/test/end.cpp b/test/end.cpp
new file mode 100644
index 0000000..e3383c3
--- /dev/null
+++ b/test/end.cpp
@@ -0,0 +1,119 @@
+// Boost.Range library
+//
+//  Copyright Neil Groves 2010. 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/detail/workaround.hpp>
+
+#if BOOST_WORKAROUND(__BORLANDC__, BOOST_TESTED_AT(0x564))
+#  pragma warn -8091 // supress warning in Boost.Test
+#  pragma warn -8057 // unused argument argc/argv in Boost.Test
+#endif
+
+#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>
+
+namespace mock_std
+{
+    template<class SinglePassRange>
+    inline BOOST_DEDUCED_TYPENAME boost::range_iterator<SinglePassRange>::type
+    end(SinglePassRange& rng)
+    {
+        return rng.end();
+    }
+
+    template<class SinglePassRange>
+    inline BOOST_DEDUCED_TYPENAME boost::range_iterator<const SinglePassRange>::type
+    end(const SinglePassRange& rng)
+    {
+        return rng.end();
+    }
+
+    template<class SinglePassRange>
+    void mock_algorithm_using_end(const SinglePassRange& rng)
+    {
+        BOOST_CHECK( end(rng) == rng.end() );
+    }
+
+    template<class SinglePassRange>
+    void mock_algorithm_using_end(SinglePassRange& rng)
+    {
+        BOOST_CHECK( end(rng) == rng.end() );
+    }
+}
+
+namespace boost
+{
+#ifdef BOOST_RANGE_SIMULATE_END_WITHOUT_ADL_NAMESPACE_BARRIER
+    template<class SinglePassRange>
+    inline BOOST_DEDUCED_TYPENAME range_iterator<SinglePassRange>::type
+    end(SinglePassRange& rng)
+    {
+        return rng.end();
+    }
+
+    template<class SinglePassRange>
+    inline BOOST_DEDUCED_TYPENAME range_iterator<const SinglePassRange>::type
+    end(const SinglePassRange& rng)
+    {
+        return rng.end();
+    }
+#endif
+
+    class MockTestEndCollection
+    {
+    public:
+        typedef char value_type;
+        typedef const char* const_pointer;
+        typedef char* pointer;
+        typedef const_pointer const_iterator;
+        typedef pointer iterator;
+
+        MockTestEndCollection()
+            : m_first()
+            , m_last()
+        {
+        }
+
+        const_iterator begin() const { return m_first; }
+        iterator begin() { return m_first; }
+        const_iterator end() const { return m_last; }
+        iterator end() { return m_last; }
+
+    private:
+        iterator m_first;
+        iterator m_last;
+    };
+}
+
+namespace
+{
+    void test_range_end_adl_avoidance()
+    {
+        boost::MockTestEndCollection c;
+        const boost::MockTestEndCollection& const_c = c;
+        mock_std::mock_algorithm_using_end(const_c);
+        mock_std::mock_algorithm_using_end(c);
+    }
+}
+
+using boost::unit_test_framework::test_suite;
+
+boost::unit_test_framework::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" );
+
+    test->add( BOOST_TEST_CASE( &test_range_end_adl_avoidance ) );
+
+    return test;
+}
+
+
diff --git a/test/extension_size.cpp b/test/extension_size.cpp
index 988e557..856f87d 100644
--- a/test/extension_size.cpp
+++ b/test/extension_size.cpp
@@ -24,24 +24,24 @@
 
 namespace boost_range_extension_size_test
 {
-    class FooWithoutMemberSize
+    class FooWithoutSize
     {
         typedef std::list<int> impl_t;
         typedef impl_t::const_iterator const_iterator;
         typedef impl_t::iterator iterator;
 
     public:
-        friend inline const_iterator range_begin(const FooWithoutMemberSize& obj) { return obj.m_impl.begin(); }
-        friend inline iterator range_begin(FooWithoutMemberSize& obj) { return obj.m_impl.begin(); }
-        friend inline const_iterator range_end(const FooWithoutMemberSize& obj) { return obj.m_impl.end(); }
-        friend inline iterator range_end(FooWithoutMemberSize& obj){ return obj.m_impl.end(); }
+        friend inline const_iterator range_begin(const FooWithoutSize& obj) { return obj.m_impl.begin(); }
+        friend inline iterator range_begin(FooWithoutSize& obj) { return obj.m_impl.begin(); }
+        friend inline const_iterator range_end(const FooWithoutSize& obj) { return obj.m_impl.end(); }
+        friend inline iterator range_end(FooWithoutSize& obj){ return obj.m_impl.end(); }
 
     private:
         impl_t m_impl;
     };
 
-    boost::range_difference<std::list<int> >::type
-    inline range_calculate_size(const FooWithoutMemberSize& rng)
+    inline boost::range_difference<std::list<int> >::type
+    range_calculate_size(const FooWithoutSize& rng)
     {
         return 2u;
     }
@@ -49,12 +49,12 @@ namespace boost_range_extension_size_test
 
 namespace boost
 {
-    template<> struct range_iterator<const ::boost_range_extension_size_test::FooWithoutMemberSize>
+    template<> struct range_iterator<const ::boost_range_extension_size_test::FooWithoutSize>
     {
         typedef std::list<int>::const_iterator type;
     };
 
-    template<> struct range_iterator< ::boost_range_extension_size_test::FooWithoutMemberSize >
+    template<> struct range_iterator< ::boost_range_extension_size_test::FooWithoutSize>
     {
         typedef std::list<int>::iterator type;
     };
@@ -63,13 +63,6 @@ namespace boost
 namespace
 {
 
-void check_size_works_with_less_than_random_access()
-{
-    std::list<int> container;
-    container.push_back(1);
-    BOOST_CHECK_EQUAL( boost::size(container), 1u );
-}
-
 void check_size_works_with_random_access()
 {
     std::vector<int> container;
@@ -77,28 +70,9 @@ void check_size_works_with_random_access()
     BOOST_CHECK_EQUAL( boost::size(container), 1u );
 }
 
-class FooWithMemberSize
-{
-public:
-    typedef std::list<int> impl_t;
-    typedef impl_t::const_iterator const_iterator;
-    typedef impl_t::iterator iterator;
-    typedef impl_t::value_type value_type;
-
-    std::size_t size() const { return 1u; }
-    const_iterator begin() const { return m_impl.begin(); }
-    iterator begin() { return m_impl.begin(); }
-    const_iterator end() const { return m_impl.end(); }
-    iterator end() { return m_impl.end(); }
-
-private:
-    std::list<int> m_impl;
-};
-
 void check_extension_size()
 {
-    BOOST_CHECK_EQUAL( boost::size(FooWithMemberSize()), 1u );
-    BOOST_CHECK_EQUAL( boost::size(boost_range_extension_size_test::FooWithoutMemberSize()), 2u );
+    BOOST_CHECK_EQUAL( boost::size(boost_range_extension_size_test::FooWithoutSize()), 2u );
 }
 
 } // anonymous namespace
@@ -109,14 +83,8 @@ test_suite* init_unit_test_suite( int argc, char* argv[] )
 {
     test_suite* test = BOOST_TEST_SUITE( "Range Test Suite" );
 
-    test->add( BOOST_TEST_CASE( &check_size_works_with_less_than_random_access ));
     test->add( BOOST_TEST_CASE( &check_size_works_with_random_access ));
     test->add( BOOST_TEST_CASE( &check_extension_size ) );
 
     return test;
 }
-
-
-
-
-

From cafea6aea537eb7fa9fa9994ddcf987285c6e7dc Mon Sep 17 00:00:00 2001
From: Neil Groves <neil@grovescomputing.com>
Date: Sun, 16 Jan 2011 17:07:27 +0000
Subject: [PATCH 43/73] [boost][range] - Merge a fix to undo an erroneous
 change to iterator_range.size() that allowed it to compile for ranges that
 did not model the Random Access Range Concept and thereby broken the
 complexity guarantees.

[SVN r68190]
---
 include/boost/range/iterator_range_core.hpp | 2 +-
 1 file changed, 1 insertion(+), 1 deletion(-)

diff --git a/include/boost/range/iterator_range_core.hpp b/include/boost/range/iterator_range_core.hpp
index 7664c2e..7ef7523 100755
--- a/include/boost/range/iterator_range_core.hpp
+++ b/include/boost/range/iterator_range_core.hpp
@@ -231,7 +231,7 @@ namespace boost
 
             difference_type size() const
             {
-                return std::distance(m_Begin, m_End);
+				return m_End - m_Begin;
             }
 
             bool empty() const

From 47e478d099f2fc67abdb4861890571bdfa85114e Mon Sep 17 00:00:00 2001
From: Bryce Adelstein-Lelbach <blelbach@cct.lsu.edu>
Date: Fri, 27 May 2011 19:51:13 +0000
Subject: [PATCH 44/73] Merge to release.

[SVN r72228]
---
 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 7ef7523..faa0d6b
--- a/include/boost/range/iterator_range_core.hpp
+++ b/include/boost/range/iterator_range_core.hpp
@@ -231,7 +231,7 @@ namespace boost
 
             difference_type size() const
             {
-				return m_End - m_Begin;
+                return m_End - m_Begin;
             }
 
             bool empty() const

From dc46fc13abfecbc2f98623206b9756106f8c7e15 Mon Sep 17 00:00:00 2001
From: Neil Groves <neil@grovescomputing.com>
Date: Fri, 8 Jun 2012 22:59:54 +0000
Subject: [PATCH 45/73] [boost][range] - Merge trac resolutions from the trunk.
 The most notable change is the alteration of the size type to be unsigned.
 This is a potentially breaking change.

[SVN r78860]
---
 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/for_each.hpp    |  1 -
 include/boost/range/algorithm_ext/copy_n.hpp  |  8 +-
 include/boost/range/as_literal.hpp            |  2 +-
 include/boost/range/counting_range.hpp        |  1 -
 include/boost/range/detail/any_iterator.hpp   |  1 -
 .../range/detail/any_iterator_buffer.hpp      |  2 +-
 include/boost/range/detail/join_iterator.hpp  |  2 +-
 include/boost/range/detail/size_type.hpp      | 41 ++++------
 include/boost/range/has_range_iterator.hpp    |  2 +-
 include/boost/range/numeric.hpp               |  2 +-
 include/boost/range/size.hpp                  |  6 +-
 include/boost/range/size_type.hpp             | 60 ++++++++-------
 test/adl_conformance.cpp                      |  4 +-
 test/algorithm_test/for_each.cpp              |  2 +-
 test/begin.cpp                                |  8 +-
 test/compat2.cpp                              |  4 +-
 test/compat3.cpp                              |  4 +-
 test/end.cpp                                  |  8 +-
 test/extension_size.cpp                       |  2 +-
 27 files changed, 155 insertions(+), 147 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/counting_range.hpp
 mode change 100755 => 100644 include/boost/range/detail/size_type.hpp
 mode change 100755 => 100644 include/boost/range/numeric.hpp
 mode change 100755 => 100644 test/compat3.cpp

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/for_each.hpp b/include/boost/range/algorithm/for_each.hpp
index 12c9d4d..4f5108d 100644
--- 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/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/as_literal.hpp b/include/boost/range/as_literal.hpp
index f67ead7..9ea144d 100644
--- a/include/boost/range/as_literal.hpp
+++ b/include/boost/range/as_literal.hpp
@@ -74,7 +74,7 @@ namespace boost
 #endif
 
         template< class T >
-        inline long is_char_ptr( T /* r */ )
+        inline long is_char_ptr( const T& /* r */ )
         {
             return 0L;
         }
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/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/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/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 );
     }
 
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..c6fb54b 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/enable_if.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/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/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/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 ) );
 
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 bda0d613c17907185d3c75fa8586da8af967e5d6 Mon Sep 17 00:00:00 2001
From: Neil Groves <neil@grovescomputing.com>
Date: Sun, 23 Sep 2012 18:59:28 +0000
Subject: [PATCH 46/73] [boost][range] merge from trunk to release

[SVN r80677]
---
 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 a417560f096813796f348fb8fcbcfcd71b43770e Mon Sep 17 00:00:00 2001
From: Nathan Ridge <zeratul976@hotmail.com>
Date: Fri, 21 Dec 2012 08:44:32 +0000
Subject: [PATCH 47/73] [range] merge doc fixes (r81888, r81889) from trunk

[SVN r82138]
---
 doc/history_ack.qbk                           |   2 +-
 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               |  21 +--
 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 |  38 ++---
 .../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 |  40 ++---
 .../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     |  44 ++---
 .../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        |  50 +++---
 .../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   | 112 ++++++------
 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/reference/adaptors/type_erased.qbk        |   2 +-
 doc/reference/algorithm/fill_n.qbk            |   2 +-
 .../algorithm/lexicographical_compare.qbk     |   2 +-
 doc/reference/algorithm/mismatch.qbk          |   2 +-
 doc/reference/numeric/accumulate.qbk          |   2 +-
 doc/reference/utilities.qbk                   |   2 +-
 doc/upgrade.qbk                               |   2 +
 165 files changed, 2312 insertions(+), 2240 deletions(-)
 create mode 100644 doc/html/range/upgrade/upgrade_from_1_49.html

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 1be23d5..e67d025 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:53:49 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..0297e85 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
@@ -72,15 +72,15 @@
           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>
       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..20430be 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 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>
+                      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..0355369 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>.
+            <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>
-<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..7f28b05 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>
@@ -108,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.
@@ -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..b89faa4 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,28 +103,28 @@
 </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
-            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>
             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..8303f4b 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">
@@ -91,16 +90,16 @@
 <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">
                 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..3470733 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>
@@ -44,73 +44,72 @@
           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>
-<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/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]
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 2726efa8c1453546cd789bcc398b464c2d355bfb Mon Sep 17 00:00:00 2001
From: Nathan Ridge <zeratul976@hotmail.com>
Date: Fri, 21 Dec 2012 08:47:14 +0000
Subject: [PATCH 48/73] [range] merged bug fixes (r81890, refs #5603; r82071,
 refs #6103) from trunk

[SVN r82139]
---
 include/boost/range/algorithm/search_n.hpp            | 4 ++--
 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 ++
 4 files changed, 11 insertions(+), 3 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
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 537f2474c9af89525590b5880a1d281826b4774f Mon Sep 17 00:00:00 2001
From: Nathan Ridge <zeratul976@hotmail.com>
Date: Mon, 14 Jan 2013 09:19:32 +0000
Subject: [PATCH 49/73] [range] Merge documentation fixes and minor refactoring
 of docs (refs #5160; refs #5314; refs #5440; refs #5775; refs #6212; refs
 #7585; refs #7843; refs #7866).

[SVN r82487]
---
 doc/headers.qbk                               |   2 +-
 doc/html/index.html                           |   2 +-
 doc/html/range/headers/general.html           |   2 +-
 .../reference/adaptors/introduction.html      |   2 +-
 .../adaptors/reference/adjacent_filtered.html |   4 +-
 .../reference/adaptors/reference/copied.html  |   4 +-
 .../adaptors/reference/filtered.html          |   6 +-
 .../reference/adaptors/reference/indexed.html |  28 +----
 .../adaptors/reference/indirected.html        |   4 +-
 .../adaptors/reference/map_keys.html          |   4 +-
 .../adaptors/reference/map_values.html        |   4 +-
 .../adaptors/reference/replaced.html          |   4 +-
 .../adaptors/reference/replaced_if.html       |   4 +-
 .../adaptors/reference/reversed.html          |   6 +-
 .../reference/adaptors/reference/sliced.html  |   4 +-
 .../reference/adaptors/reference/strided.html |   4 +-
 .../adaptors/reference/tokenized.html         |  45 ++++++++
 .../adaptors/reference/transformed.html       |   4 +-
 .../adaptors/reference/type_erased.html       |  10 +-
 .../reference/adaptors/reference/uniqued.html |   8 +-
 .../reference/algorithms/heap/pop_heap.html   |   4 +-
 .../algorithms/numeric/inner_product.html     |   3 +-
 .../extending/method_3/method_3_1.html        |   8 ++
 .../extending/method_3/method_3_2.html        |  31 ++---
 doc/reference/adaptors.qbk                    |   2 +-
 doc/reference/adaptors/adjacent_filtered.qbk  |  28 +----
 doc/reference/adaptors/copied.qbk             |  27 +----
 .../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 -----
 doc/reference/adaptors/examples/tokenized.cpp |  28 -----
 .../adaptors/examples/transformed.cpp         |  37 ------
 doc/reference/adaptors/examples/uniqued.cpp   |  31 -----
 doc/reference/adaptors/filtered.qbk           |  30 +----
 doc/reference/adaptors/indexed.qbk            |  63 +---------
 doc/reference/adaptors/indirected.qbk         |  28 +----
 doc/reference/adaptors/map_keys.qbk           |  29 +----
 doc/reference/adaptors/map_values.qbk         |  29 +----
 doc/reference/adaptors/replaced.qbk           |  27 +----
 doc/reference/adaptors/replaced_if.qbk        |  32 +----
 doc/reference/adaptors/reversed.qbk           |  27 +----
 doc/reference/adaptors/sliced.qbk             |  27 +----
 doc/reference/adaptors/strided.qbk            |  27 +----
 doc/reference/adaptors/tokenized.qbk          |  18 +++
 doc/reference/adaptors/transformed.qbk        |  33 +-----
 doc/reference/adaptors/type_erased.qbk        |  98 +---------------
 doc/reference/adaptors/uniqued.qbk            |  25 +---
 doc/reference/algorithm/pop_heap.qbk          |   2 +-
 doc/reference/extending.qbk                   |  12 +-
 doc/reference/numeric/inner_product.qbk       |   3 +-
 test/Jamfile.v2                               |  18 +--
 .../adjacent_filtered_example.cpp             |  43 ++++---
 test/adaptor_test/copied_example.cpp          |  42 ++++---
 test/adaptor_test/filtered_example.cpp        |  51 ++++----
 test/adaptor_test/indexed_example.cpp         | 109 ++++++++++--------
 test/adaptor_test/indirected_example.cpp      |  46 ++++----
 test/adaptor_test/map_keys_example.cpp        |  44 ++++---
 test/adaptor_test/map_values_example.cpp      |  44 ++++---
 test/adaptor_test/replaced_example.cpp        |  44 ++++---
 test/adaptor_test/replaced_if_example.cpp     |  53 +++++----
 test/adaptor_test/reversed_example.cpp        |  40 ++++---
 test/adaptor_test/sliced_example.cpp          |  44 ++++---
 test/adaptor_test/strided_example.cpp         |  44 ++++---
 test/adaptor_test/tokenized_example.cpp       |  65 +++++++++++
 test/adaptor_test/transformed_example.cpp     |  56 +++++----
 test/adaptor_test/type_erased_example.cpp     |  13 ++-
 test/adaptor_test/uniqued_example.cpp         |  41 ++++---
 75 files changed, 666 insertions(+), 1360 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/tokenized.cpp
 delete mode 100644 doc/reference/adaptors/examples/transformed.cpp
 delete mode 100644 doc/reference/adaptors/examples/uniqued.cpp
 create mode 100644 test/adaptor_test/tokenized_example.cpp

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 e67d025..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: December 13, 2012 at 06:53:49 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>
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/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 5d45709..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>
 
@@ -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>
@@ -140,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 ab6a776..4a2d29f 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>
@@ -104,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>
 
@@ -123,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/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 1db2af4..ab61716 100644
--- a/doc/html/range/reference/adaptors/reference/reversed.html
+++ b/doc/html/range/reference/adaptors/reference/reversed.html
@@ -100,11 +100,11 @@
 <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>
 
-<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>
@@ -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 1b9a97d..ec50b79 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">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>
+
+<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/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 2ef82e0..cf3b672 100644
--- a/doc/html/range/reference/adaptors/reference/uniqued.html
+++ b/doc/html/range/reference/adaptors/reference/uniqued.html
@@ -105,11 +105,11 @@
 <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>
 
-<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>
@@ -128,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/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/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/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/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/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
diff --git a/doc/reference/adaptors/adjacent_filtered.qbk b/doc/reference/adaptors/adjacent_filtered.qbk
index a15f992..f8b4289 100644
--- a/doc/reference/adaptors/adjacent_filtered.qbk
+++ b/doc/reference/adaptors/adjacent_filtered.qbk
@@ -19,35 +19,13 @@
 * [*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:
 ``
-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 69ee46d..2a8abcc 100644
--- a/doc/reference/adaptors/copied.qbk
+++ b/doc/reference/adaptors/copied.qbk
@@ -17,34 +17,13 @@
 * [*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:
 ``
-2,3,4,5
+2,3,4,5,
 ``
 [endsect]
 
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/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/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..3f84c94 100644
--- a/doc/reference/adaptors/filtered.qbk
+++ b/doc/reference/adaptors/filtered.qbk
@@ -19,37 +19,13 @@
 * [*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:
 ``
-2,4,6,8
+2,4,6,8,
 ``
 [endsect]
 
diff --git a/doc/reference/adaptors/indexed.qbk b/doc/reference/adaptors/indexed.qbk
index 9778f20..117e1e3 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.
@@ -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..437a547 100644
--- a/doc/reference/adaptors/indirected.qbk
+++ b/doc/reference/adaptors/indirected.qbk
@@ -18,35 +18,13 @@
 * [*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:
 ``
-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 01b9d34..f9fbb9a 100644
--- a/doc/reference/adaptors/map_keys.qbk
+++ b/doc/reference/adaptors/map_keys.qbk
@@ -18,36 +18,13 @@
 * [*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:
 ``
-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 17ad9c4..7941f47 100644
--- a/doc/reference/adaptors/map_values.qbk
+++ b/doc/reference/adaptors/map_values.qbk
@@ -18,36 +18,13 @@
 * [*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:
 ``
-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 3df708c..aae4ece 100644
--- a/doc/reference/adaptors/replaced.qbk
+++ b/doc/reference/adaptors/replaced.qbk
@@ -20,34 +20,13 @@
 * [*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:
 ``
-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 b160b34..f00c46a 100644
--- a/doc/reference/adaptors/replaced_if.qbk
+++ b/doc/reference/adaptors/replaced_if.qbk
@@ -20,39 +20,13 @@
 * [*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:
 ``
-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 7116475..42f8e73 100644
--- a/doc/reference/adaptors/reversed.qbk
+++ b/doc/reference/adaptors/reversed.qbk
@@ -17,34 +17,13 @@
 * [*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:
 ``
-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 33b57ca..e67ae30 100644
--- a/doc/reference/adaptors/sliced.qbk
+++ b/doc/reference/adaptors/sliced.qbk
@@ -18,34 +18,13 @@
 * [*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:
 ``
-3,4,5
+3,4,5,
 ``
 [endsect]
 
diff --git a/doc/reference/adaptors/strided.qbk b/doc/reference/adaptors/strided.qbk
index e219a83..a672e3d 100644
--- a/doc/reference/adaptors/strided.qbk
+++ b/doc/reference/adaptors/strided.qbk
@@ -17,34 +17,13 @@
 * [*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:
 ``
-1,3,5,7,9
+1,3,5,7,9,
 ``
 [endsect]
 
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/doc/reference/adaptors/transformed.qbk b/doc/reference/adaptors/transformed.qbk
index ec19583..c53cfd7 100644
--- a/doc/reference/adaptors/transformed.qbk
+++ b/doc/reference/adaptors/transformed.qbk
@@ -19,40 +19,13 @@
 * [*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:
 ``
-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 9fb72a5..e55ff66 100644
--- a/doc/reference/adaptors/type_erased.qbk
+++ b/doc/reference/adaptors/type_erased.qbk
@@ -49,102 +49,16 @@ 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:
 ``
-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 a74d1a8..5b8e7f2 100644
--- a/doc/reference/adaptors/uniqued.qbk
+++ b/doc/reference/adaptors/uniqued.qbk
@@ -18,32 +18,13 @@
 * [*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:
 ``
-1,2,3,4,5,6
+1,2,3,4,5,6,
 ``
 [endsect]
 
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.
 
diff --git a/doc/reference/extending.qbk b/doc/reference/extending.qbk
index 6414e67..46652d6 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]
@@ -273,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>
@@ -290,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>
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]
diff --git a/test/Jamfile.v2 b/test/Jamfile.v2
index afab584..d76c141 100644
--- a/test/Jamfile.v2
+++ b/test/Jamfile.v2
@@ -31,21 +31,6 @@ 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 ]
@@ -61,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 ]
@@ -75,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/adjacent_filtered_example.cpp b/test/adaptor_test/adjacent_filtered_example.cpp
index ce132d6..83f7a8a 100644
--- a/test/adaptor_test/adjacent_filtered_example.cpp
+++ b/test/adaptor_test/adjacent_filtered_example.cpp
@@ -8,14 +8,16 @@
 //
 // 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>
-#include <algorithm>
+#include <iterator>
 #include <functional>
 #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..c1d0e31 100644
--- a/test/adaptor_test/copied_example.cpp
+++ b/test/adaptor_test/copied_example.cpp
@@ -8,13 +8,15 @@
 //
 // 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>
-#include <algorithm>
+#include <iterator>
 #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..e16d0af 100644
--- a/test/adaptor_test/filtered_example.cpp
+++ b/test/adaptor_test/filtered_example.cpp
@@ -8,13 +8,15 @@
 //
 // 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>
-#include <algorithm>
+#include <iterator>
 #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..1bcbf9c 100644
--- a/test/adaptor_test/indexed_example.cpp
+++ b/test/adaptor_test/indexed_example.cpp
@@ -8,13 +8,15 @@
 //
 // 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>
-#include <algorithm>
+#include <iterator>
 #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..8b538b5 100644
--- a/test/adaptor_test/indirected_example.cpp
+++ b/test/adaptor_test/indirected_example.cpp
@@ -8,13 +8,15 @@
 //
 // 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>
-#include <algorithm>
+#include <iterator>
 #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..99f8505 100644
--- a/test/adaptor_test/map_keys_example.cpp
+++ b/test/adaptor_test/map_keys_example.cpp
@@ -8,14 +8,16 @@
 //
 // 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>
-#include <algorithm>
+#include <iterator>
 #include <iostream>
 #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..bfa533f 100644
--- a/test/adaptor_test/map_values_example.cpp
+++ b/test/adaptor_test/map_values_example.cpp
@@ -8,14 +8,16 @@
 //
 // 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>
-#include <algorithm>
+#include <iterator>
 #include <iostream>
 #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..8e1f114 100644
--- a/test/adaptor_test/replaced_example.cpp
+++ b/test/adaptor_test/replaced_example.cpp
@@ -8,13 +8,15 @@
 //
 // 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>
-#include <algorithm>
+#include <iterator>
 #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..05b5e78 100644
--- a/test/adaptor_test/replaced_if_example.cpp
+++ b/test/adaptor_test/replaced_if_example.cpp
@@ -8,13 +8,15 @@
 //
 // 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>
-#include <algorithm>
+#include <iterator>
 #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..585108f 100644
--- a/test/adaptor_test/reversed_example.cpp
+++ b/test/adaptor_test/reversed_example.cpp
@@ -8,13 +8,15 @@
 //
 // 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>
-#include <algorithm>
+#include <iterator>
 #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..2b15691 100644
--- a/test/adaptor_test/sliced_example.cpp
+++ b/test/adaptor_test/sliced_example.cpp
@@ -8,13 +8,15 @@
 //
 // 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>
-#include <algorithm>
+#include <iterator>
 #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..b1f8b42 100644
--- a/test/adaptor_test/strided_example.cpp
+++ b/test/adaptor_test/strided_example.cpp
@@ -8,13 +8,15 @@
 //
 // 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>
-#include <algorithm>
+#include <iterator>
 #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/tokenized_example.cpp b/test/adaptor_test/tokenized_example.cpp
new file mode 100644
index 0000000..5f59bb1
--- /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 <iterator>
+#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;
+}
diff --git a/test/adaptor_test/transformed_example.cpp b/test/adaptor_test/transformed_example.cpp
index 3d05c95..ff4a689 100644
--- a/test/adaptor_test/transformed_example.cpp
+++ b/test/adaptor_test/transformed_example.cpp
@@ -8,13 +8,15 @@
 //
 // 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>
-#include <algorithm>
+#include <iterator>
 #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..f8416ae 100644
--- a/test/adaptor_test/type_erased_example.cpp
+++ b/test/adaptor_test/type_erased_example.cpp
@@ -8,15 +8,16 @@
 //
 // 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>
 #include <boost/foreach.hpp>
-#include <algorithm>
+#include <iterator>
 #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..cf1407a 100644
--- a/test/adaptor_test/uniqued_example.cpp
+++ b/test/adaptor_test/uniqued_example.cpp
@@ -8,13 +8,15 @@
 //
 // 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>
-#include <algorithm>
+#include <iterator>
 #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 4df157ac112a6c9bf8956eb45eb17ba99000fdaf Mon Sep 17 00:00:00 2001
From: Nathan Ridge <zeratul976@hotmail.com>
Date: Sat, 26 Jan 2013 03:13:39 +0000
Subject: [PATCH 50/73] [range] merge fix for typos in comments to release
 branch (refs #7916)

[SVN r82620]
---
 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

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
index 76d902f..edaae71 100644
--- 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 58d57f9b7b1e2c04f8faa607806570dbc1966d95 Mon Sep 17 00:00:00 2001
From: Nathan Ridge <zeratul976@hotmail.com>
Date: Sat, 26 Jan 2013 04:03:46 +0000
Subject: [PATCH 51/73] [range] merge documentation fix from trunk (refs #7926)

[SVN r82622]
---
 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 43d2ca8549d890807dfd7fd4f8c412de12e63bf0 Mon Sep 17 00:00:00 2001
From: Nathan Ridge <zeratul976@hotmail.com>
Date: Tue, 18 Jun 2013 02:22:07 +0000
Subject: [PATCH 52/73] [range] Merge Boost.Range bug fixes to release branch
 (fixes #6944; fixes #7407; fixes #7408; fixes #7731; fixes #7827; fixes
 #8338; fixes #8453).

[SVN r84823]
---
 include/boost/range/adaptor/indexed.hpp       |  3 ++
 include/boost/range/concepts.hpp              |  8 ++--
 .../range/detail/extract_optional_type.hpp    |  2 +-
 include/boost/range/irange.hpp                |  2 +-
 include/boost/range/istream_range.hpp         |  6 +--
 include/boost/range/iterator_range_core.hpp   |  5 +-
 test/Jamfile.v2                               |  1 +
 test/adaptor_test/indexed.cpp                 |  6 +++
 test/irange.cpp                               | 18 +++-----
 test/istream_range.cpp                        | 15 ++++--
 test/iterator_range.cpp                       |  5 ++
 test/test_utils.hpp                           | 24 ++++++++++
 test/ticket_6944.cpp                          | 46 +++++++++++++++++++
 13 files changed, 115 insertions(+), 26 deletions(-)
 mode change 100755 => 100644 include/boost/range/adaptor/indexed.hpp
 mode change 100755 => 100644 include/boost/range/detail/extract_optional_type.hpp
 mode change 100755 => 100644 include/boost/range/istream_range.hpp
 create mode 100644 test/test_utils.hpp
 create mode 100644 test/ticket_6944.cpp

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/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/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 >                                                     \
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/include/boost/range/istream_range.hpp b/include/boost/range/istream_range.hpp
old mode 100755
new mode 100644
index c3f2248..a486317
--- 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>
 
@@ -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/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/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/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/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;
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
 
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
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> ));
+}
diff --git a/test/ticket_6944.cpp b/test/ticket_6944.cpp
new file mode 100644
index 0000000..43796a8
--- /dev/null
+++ b/test/ticket_6944.cpp
@@ -0,0 +1,46 @@
+// 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
+{
+    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
+        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 58d1ee144407063b0420af3af18bca563ade695e Mon Sep 17 00:00:00 2001
From: Michel Morin <mimomorin@gmail.com>
Date: Wed, 13 Nov 2013 03:22:55 +0000
Subject: [PATCH 53/73] Merge r86524 (Correct broken links to C++ standard
 papers); fixes #9212

[SVN r86673]
---
 doc/boost_range.qbk | 2 +-
 1 file changed, 1 insertion(+), 1 deletion(-)

diff --git a/doc/boost_range.qbk b/doc/boost_range.qbk
index be09bc6..126ec62 100644
--- a/doc/boost_range.qbk
+++ b/doc/boost_range.qbk
@@ -171,7 +171,7 @@
 [def __metafunctions__          [@boost:/libs/mpl/doc/refmanual/metafunction.html metafunctions]]
 [def __concept_check__          [@boost:/libs/concept_check/index.html Boost Concept Check library]]
 [def __boost_array__            [@boost:/libs/array/index.html boost::array]]
-[def __the_forwarding_problem__ [@http://std.dkuug.dk/jtc1/sc22/wg21/docs/papers/2002/n1385.htm The Forwarding Problem]]
+[def __the_forwarding_problem__ [@http://www.open-std.org/jtc1/sc22/wg21/docs/papers/2002/n1385.htm The Forwarding Problem]]
 
 [def __sgi_inner_product__      [@http://www.sgi.com/tech/stl/inner_product.html inner_product]]
 [def __sgi_partial_sum__        [@http://www.sgi.com/tech/stl/partial_sum.html partial_sum]]

From 4c2898345972bd6c44c6b55abb386af931cc8fb5 Mon Sep 17 00:00:00 2001
From: Nathan Ridge <zeratul976@hotmail.com>
Date: Tue, 20 Aug 2013 06:06:12 +0000
Subject: [PATCH 54/73] [range] Fixed a bug in join_iterator where joining a
 const range and a non-const range led to a compiler error (refs #8483).

[SVN r85400]
---
 include/boost/range/detail/join_iterator.hpp |  8 ++++++--
 test/join.cpp                                | 13 +++++++++++++
 2 files changed, 19 insertions(+), 2 deletions(-)

diff --git a/include/boost/range/detail/join_iterator.hpp b/include/boost/range/detail/join_iterator.hpp
index bbdeec7..70ecf65 100644
--- a/include/boost/range/detail/join_iterator.hpp
+++ b/include/boost/range/detail/join_iterator.hpp
@@ -143,8 +143,12 @@ template<typename Iterator1
                                     typename iterator_reference<Iterator2>::type
                                 >::type
                             >::value,
-                            typename add_const<
-                                typename iterator_reference<Iterator2>::type
+                            typename add_reference<
+                                typename add_const<
+                                    typename remove_reference<
+                                        typename iterator_reference<Iterator2>::type
+                                    >::type
+                                >::type
                             >::type,
                             typename iterator_reference<Iterator1>::type
                         >::type
diff --git a/test/join.cpp b/test/join.cpp
index 290e651..b30d060 100644
--- a/test/join.cpp
+++ b/test/join.cpp
@@ -257,6 +257,18 @@ namespace boost
             test_join_impl< std::vector<int>, std::deque<int>  >();
             test_join_impl< std::deque<int>,  std::vector<int> >();
         }
+        
+        void test_join_iterator_reference_type_constness_ticket8483()
+        {
+            // Just test that this compiles.
+            // Before the fix for bug 8483, the reference type of the joined
+            // range's iterator was incorrect ('int&' instead of 'const int&'),
+            // causing compiler errors.
+            const std::vector<int> v1;
+            std::vector<int> v2;
+            std::vector<int> joined;
+            boost::push_back(joined, join(v1, v2));
+        }
 
     }
 }
@@ -268,6 +280,7 @@ init_unit_test_suite(int argc, char* argv[])
         = BOOST_TEST_SUITE( "RangeTestSuite.adaptor.joined" );
 
     test->add( BOOST_TEST_CASE( &boost::join_test ) );
+    test->add( BOOST_TEST_CASE( &boost::test_join_iterator_reference_type_constness_ticket8483 ) );
 
     return test;
 }

From 6f0ab4a8bec2d2fd45df9f3e4f0f72cb8880b16b Mon Sep 17 00:00:00 2001
From: Tim Blechmann <tim@klingt.org>
Date: Fri, 6 Sep 2013 08:51:00 +0000
Subject: [PATCH 55/73] range: silence some warnings

[SVN r85584]
---
 include/boost/range/algorithm/unique.hpp    | 2 +-
 include/boost/range/detail/range_return.hpp | 2 +-
 2 files changed, 2 insertions(+), 2 deletions(-)
 mode change 100755 => 100644 include/boost/range/algorithm/unique.hpp
 mode change 100755 => 100644 include/boost/range/detail/range_return.hpp

diff --git a/include/boost/range/algorithm/unique.hpp b/include/boost/range/algorithm/unique.hpp
old mode 100755
new mode 100644
index be6eaf9..9901c24
--- a/include/boost/range/algorithm/unique.hpp
+++ b/include/boost/range/algorithm/unique.hpp
@@ -86,7 +86,7 @@ unique( const ForwardRange& rng )
 /// \overload
 template< class ForwardRange, class BinaryPredicate >
 inline BOOST_DEDUCED_TYPENAME range_return<ForwardRange, return_begin_found>::type
-unique( ForwardRange& rng, BinaryPredicate pred )
+unique( ForwardRange& rng, BinaryPredicate )
 {
     BOOST_RANGE_CONCEPT_ASSERT(( ForwardRangeConcept<ForwardRange> ));
     return ::boost::range::unique<return_begin_found>(rng);
diff --git a/include/boost/range/detail/range_return.hpp b/include/boost/range/detail/range_return.hpp
old mode 100755
new mode 100644
index 52a6073..773a72a
--- a/include/boost/range/detail/range_return.hpp
+++ b/include/boost/range/detail/range_return.hpp
@@ -168,7 +168,7 @@ namespace boost
         typedef boost::iterator_range<
             BOOST_DEDUCED_TYPENAME range_iterator<SinglePassRange>::type > type;
 
-        static type pack(BOOST_DEDUCED_TYPENAME range_iterator<SinglePassRange>::type found,
+        static type pack(BOOST_DEDUCED_TYPENAME range_iterator<SinglePassRange>::type,
                          SinglePassRange& rng)
         {
             return type(boost::begin(rng), boost::end(rng));

From fbc00574321afb2a16b40ab7a710f8b873c8a7b5 Mon Sep 17 00:00:00 2001
From: Neil Groves <neil@grovescomputing.com>
Date: Sun, 15 Sep 2013 18:05:49 +0000
Subject: [PATCH 56/73] [boost][range] - fix for ticket 8341 -
 has_range_iterator

[SVN r85682]
---
 include/boost/range/has_range_iterator.hpp | 22 ++++++++++++++++++++--
 1 file changed, 20 insertions(+), 2 deletions(-)

diff --git a/include/boost/range/has_range_iterator.hpp b/include/boost/range/has_range_iterator.hpp
index 8046eb4..3c7b083 100644
--- a/include/boost/range/has_range_iterator.hpp
+++ b/include/boost/range/has_range_iterator.hpp
@@ -7,10 +7,14 @@
 //
 // For more information, see http://www.boost.org/libs/range/
 //
+// Acknowledgments:
+// Ticket #8341: Arno Schoedl - improved handling of has_range_iterator upon
+// use-cases where T was const.
 #ifndef BOOST_RANGE_HAS_ITERATOR_HPP_INCLUDED
 #define BOOST_RANGE_HAS_ITERATOR_HPP_INCLUDED
 
 #include <boost/mpl/bool.hpp>
+#include <boost/mpl/eval_if.hpp>
 #include <boost/mpl/has_xxx.hpp>
 #include <boost/range/iterator.hpp>
 #include <boost/utility/enable_if.hpp>
@@ -28,7 +32,16 @@ namespace boost
         };
 
         template<class T>
-        struct has_range_iterator_impl<T, BOOST_DEDUCED_TYPENAME enable_if< has_type< range_mutable_iterator<T> > >::type>
+        struct has_range_iterator_impl<
+            T,
+            BOOST_DEDUCED_TYPENAME enable_if<
+                BOOST_DEDUCED_TYPENAME mpl::eval_if<is_const<T>,
+                    has_type<range_const_iterator<
+                                BOOST_DEDUCED_TYPENAME remove_const<T>::type> >,
+                    has_type<range_mutable_iterator<T> >
+                >::type
+            >::type
+        >
             : boost::mpl::true_
         {
         };
@@ -40,7 +53,12 @@ namespace boost
         };
 
         template<class T>
-        struct has_range_const_iterator_impl<T, BOOST_DEDUCED_TYPENAME enable_if< has_type< range_const_iterator<T> > >::type>
+        struct has_range_const_iterator_impl<
+            T,
+            BOOST_DEDUCED_TYPENAME enable_if<
+                has_type<range_const_iterator<T> >
+            >::type
+        >
             : boost::mpl::true_
         {
         };

From 3d3dea1411df3d79c38c9cb5c36e8991e2567fc9 Mon Sep 17 00:00:00 2001
From: Neil Groves <neil@grovescomputing.com>
Date: Sun, 15 Sep 2013 19:44:36 +0000
Subject: [PATCH 57/73] [boost][range] - fix for ticket 6888 - unique predicate
 overloads

[SVN r85686]
---
 include/boost/range/algorithm/unique.hpp      |  6 +-
 include/boost/range/config.hpp                |  6 ++
 test/adaptor_test/strided.cpp                 | 10 +-
 test/algorithm.cpp                            |  7 +-
 test/algorithm_test/unique.cpp                | 94 +++++++++++++++++--
 test/compile_fail/iterator_range1.cpp         |  1 +
 .../range_overload_test_driver.hpp            | 74 +++++++++++++++
 7 files changed, 183 insertions(+), 15 deletions(-)
 mode change 100755 => 100644 include/boost/range/config.hpp
 create mode 100644 test/test_driver/range_overload_test_driver.hpp

diff --git a/include/boost/range/algorithm/unique.hpp b/include/boost/range/algorithm/unique.hpp
index 9901c24..8017a83 100644
--- a/include/boost/range/algorithm/unique.hpp
+++ b/include/boost/range/algorithm/unique.hpp
@@ -86,14 +86,14 @@ unique( const ForwardRange& rng )
 /// \overload
 template< class ForwardRange, class BinaryPredicate >
 inline BOOST_DEDUCED_TYPENAME range_return<ForwardRange, return_begin_found>::type
-unique( ForwardRange& rng, BinaryPredicate )
+unique( ForwardRange& rng, BinaryPredicate pred )
 {
     BOOST_RANGE_CONCEPT_ASSERT(( ForwardRangeConcept<ForwardRange> ));
-    return ::boost::range::unique<return_begin_found>(rng);
+    return ::boost::range::unique<return_begin_found>(rng, pred);
 }
 /// \overload
 template< class ForwardRange, class BinaryPredicate >
-inline BOOST_DEDUCED_TYPENAME range_iterator<const ForwardRange>::type
+inline BOOST_DEDUCED_TYPENAME range_return<const ForwardRange, return_begin_found>::type
 unique( const ForwardRange& rng, BinaryPredicate pred )
 {
     BOOST_RANGE_CONCEPT_ASSERT(( ForwardRangeConcept<const ForwardRange> ));
diff --git a/include/boost/range/config.hpp b/include/boost/range/config.hpp
old mode 100755
new mode 100644
index 4e7fb24..cf9e204
--- a/include/boost/range/config.hpp
+++ b/include/boost/range/config.hpp
@@ -48,6 +48,12 @@
 #define BOOST_RANGE_ARRAY_REF() (&boost_range_array)
 #endif
 
+#if defined(__GNUC__) && ((__GNUC__ > 4) || ((__GNUC__ == 4) && (__GNUC_MINOR__ >= 7)))
+#  define BOOST_RANGE_UNUSED __attribute__((unused))
+#else
+#  define BOOST_RANGE_UNUSED
+#endif
+
 
 
 #endif
diff --git a/test/adaptor_test/strided.cpp b/test/adaptor_test/strided.cpp
index aa80068..b49cfc6 100644
--- a/test/adaptor_test/strided.cpp
+++ b/test/adaptor_test/strided.cpp
@@ -13,6 +13,7 @@
 //
 #include <boost/range/adaptor/strided.hpp>
 
+#include <boost/config.hpp>
 #include <boost/test/test_tools.hpp>
 #include <boost/test/unit_test.hpp>
 
@@ -42,9 +43,12 @@ namespace boost
             Container reference;
 
             {
-                typedef BOOST_DEDUCED_TYPENAME Container::const_iterator iterator_t;
-                typedef BOOST_DEDUCED_TYPENAME Container::difference_type diff_t;
-                typedef BOOST_DEDUCED_TYPENAME Container::size_type size_type;
+                typedef BOOST_DEDUCED_TYPENAME Container::const_iterator
+                            iterator_t BOOST_RANGE_UNUSED;
+                typedef BOOST_DEDUCED_TYPENAME Container::difference_type
+                            diff_t BOOST_RANGE_UNUSED;
+                typedef BOOST_DEDUCED_TYPENAME Container::size_type
+                            size_type BOOST_RANGE_UNUSED;
                 iterator_t it = c.begin();
 
                 iterator_t last = c.end();
diff --git a/test/algorithm.cpp b/test/algorithm.cpp
index 1c0dbc3..2160eaf 100644
--- a/test/algorithm.cpp
+++ b/test/algorithm.cpp
@@ -35,6 +35,7 @@
 #endif
 
 #include <boost/assign.hpp>
+#include <boost/config.hpp>    
 #include <boost/array.hpp>
 #include <boost/bind.hpp>
 #include <boost/range/numeric.hpp>
@@ -107,9 +108,11 @@ void test_random_algorithms(Rng & rng, std::random_access_iterator_tag)
 {
     typedef BOOST_DEDUCED_TYPENAME boost::range_iterator<Rng>::type iterator;
     typedef BOOST_DEDUCED_TYPENAME boost::range_value<Rng>::type value_type;
-    typedef BOOST_DEDUCED_TYPENAME boost::range_size<Rng>::type size_type;
+    typedef BOOST_DEDUCED_TYPENAME boost::range_size<Rng>::type size_type BOOST_RANGE_UNUSED;
     typedef BOOST_DEDUCED_TYPENAME boost::iterator_category<iterator>::type iterator_category;
 
+    
+    
     // just make sure these compile (for now)
     if(0)
     {
@@ -328,6 +331,8 @@ void test_algorithms(Rng & rng)
         o   = boost::adjacent_difference( rng, boost::begin(out) );
         o   = boost::adjacent_difference( rng, boost::begin(out), 
                                           null_op2() );
+        
+        boost::ignore_unused_variable_warning(b);
          
     }
 
diff --git a/test/algorithm_test/unique.cpp b/test/algorithm_test/unique.cpp
index 880c131..d8eb784 100644
--- a/test/algorithm_test/unique.cpp
+++ b/test/algorithm_test/unique.cpp
@@ -9,13 +9,15 @@
 // For more information, see http://www.boost.org/libs/range/
 //
 #include <boost/range/algorithm/unique.hpp>
+#include <boost/range/detail/range_return.hpp>
 
 #include <boost/test/test_tools.hpp>
 #include <boost/test/unit_test.hpp>
 
 #include <boost/assign.hpp>
 #include <boost/bind.hpp>
-#include "../test_driver/range_return_test_driver.hpp"
+#include <boost/config.hpp>
+#include "../test_driver/range_overload_test_driver.hpp"
 #include <algorithm>
 #include <functional>
 #include <list>
@@ -60,6 +62,36 @@ namespace boost_range_test_algorithm_unique
             }
         };
 
+        template<typename Container>
+        struct test_range_overload
+        {
+            BOOST_STATIC_CONSTANT(
+                ::boost::range_return_value,
+                result_type = ::boost::return_begin_found);
+                
+            template<typename Policy>
+            BOOST_DEDUCED_TYPENAME boost::range_return<
+                Container, result_type
+            >::type
+            operator()(Policy& policy, Container& cont)
+            {
+                typedef BOOST_DEDUCED_TYPENAME boost::range_return<
+                                Container,result_type>::type result_t;
+                
+                Container cont2(cont);
+                
+                result_t result = boost::unique(cont);
+                
+                boost::unique(boost::make_iterator_range(cont2));
+                
+                BOOST_CHECK_EQUAL_COLLECTIONS(
+                    cont.begin(), cont.end(),
+                    cont2.begin(), cont2.end());
+                
+                return result;
+            }
+        };
+
         template< class Container >
         BOOST_DEDUCED_TYPENAME boost::range_iterator<Container>::type
         reference(Container& cont)
@@ -67,7 +99,7 @@ namespace boost_range_test_algorithm_unique
             return std::unique(cont.begin(), cont.end());
         }
     };
-
+   
     // test the 'unique' algorithm with a predicate
     template<class Pred>
     class unique_pred_test_policy
@@ -105,6 +137,34 @@ namespace boost_range_test_algorithm_unique
                 return result;
             }
         };
+        
+        template<typename Container>
+        struct test_range_overload
+        {
+            BOOST_STATIC_CONSTANT(
+                ::boost::range_return_value,
+                result_type = ::boost::return_begin_found);
+                
+            template<typename Policy>
+            BOOST_DEDUCED_TYPENAME boost::range_return<Container,result_type>::type
+            operator()(Policy& policy, Container& cont)
+            {
+                typedef BOOST_DEDUCED_TYPENAME boost::range_return<
+                            Container,result_type>::type result_t;
+                
+                Container cont2(cont);
+                
+                result_t result = boost::unique(cont, policy.pred());
+                
+                boost::unique(boost::make_iterator_range(cont2), policy.pred());
+                
+                BOOST_CHECK_EQUAL_COLLECTIONS(
+                    cont.begin(), cont.end(),
+                    cont2.begin(), cont2.end());
+                    
+                return result;
+            }
+        };
 
         template< class Container >
         BOOST_DEDUCED_TYPENAME boost::range_iterator<Container>::type
@@ -121,7 +181,7 @@ namespace boost_range_test_algorithm_unique
 
         typedef BOOST_DEDUCED_TYPENAME Container::value_type value_t;
 
-        boost::range_test::range_return_test_driver test_driver;
+        boost::range_test::range_overload_test_driver test_driver;
 
         Container cont;
 
@@ -145,6 +205,19 @@ namespace boost_range_test_algorithm_unique
 
         test_driver(cont, policy);
     }
+    
+    template<typename T>
+    struct equal_div_2
+    {
+        typedef bool result_type;
+        typedef const T& first_argument_type;
+        typedef const T& second_argument_type;
+        
+        bool operator()(const T& left, const T& right) const
+        {
+            return left / 2 == right / 2;
+        }
+    };
 
     template<class Container>
     void test_unique_impl()
@@ -152,17 +225,22 @@ namespace boost_range_test_algorithm_unique
         test_unique_impl<Container>(
             unique_test_policy(),
             std::less<int>()
-            );
+        );
 
         test_unique_impl<Container>(
-            unique_pred_test_policy<std::less<int> >(),
+            unique_pred_test_policy<std::equal_to<int> >(),
             std::less<int>()
-            );
+        );
 
         test_unique_impl<Container>(
-            unique_pred_test_policy<std::greater<int> >(),
+            unique_pred_test_policy<std::equal_to<int> >(),
             std::greater<int>()
-            );
+        );
+        
+        test_unique_impl<Container>(
+            unique_pred_test_policy<equal_div_2<int> >(),
+            std::less<int>()
+        );
     }
 
     void test_unique()
diff --git a/test/compile_fail/iterator_range1.cpp b/test/compile_fail/iterator_range1.cpp
index eed4ea9..2e5eec3 100644
--- a/test/compile_fail/iterator_range1.cpp
+++ b/test/compile_fail/iterator_range1.cpp
@@ -16,6 +16,7 @@ namespace iterator_range_test_detail
     {
         double source[] = { 0.0, 1.0, 2.0, 3.0, 4.0, 5.0 };        
         boost::iterator_range<float*> rng = boost::make_iterator_range(source);
+        boost::ignore_unused_variable_warning(rng);
     }
 }
 
diff --git a/test/test_driver/range_overload_test_driver.hpp b/test/test_driver/range_overload_test_driver.hpp
new file mode 100644
index 0000000..e4b2ce7
--- /dev/null
+++ b/test/test_driver/range_overload_test_driver.hpp
@@ -0,0 +1,74 @@
+    //  Copyright Neil Groves 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/ 
+    // 
+    // Acknowledgments:
+    // Implemented by Andy in response to Ticket 6888 - unique fix
+    //
+    #ifndef BOOST_RANGE_TEST_TEST_DRIVER_RANGE_OVERLOAD_TEST_DRIVER_HPP_INCLUDED 
+    #define BOOST_RANGE_TEST_TEST_DRIVER_RANGE_OVERLOAD_TEST_DRIVER_HPP_INCLUDED 
+     
+    #include "range_return_test_driver.hpp" 
+    #include <boost/assert.hpp> 
+    #include <boost/test/test_tools.hpp> 
+    #include <boost/test/unit_test.hpp> 
+     
+    namespace boost 
+    { 
+        namespace range_test 
+        { 
+             
+            // A test driver to exercise a test through range_return_test_driver 
+            // plus the overload that determines the return_type by overload 
+            // 
+            // The test driver also contains the code required to check the 
+            // return value correctness. 
+            // 
+            // The TestPolicy needs to implement all those required by  
+            // range_return_test_driver, and additionally 
+            // 
+            // - perform the boost range version of the algorithm that determines 
+            //   the return_type by overload 
+            class range_overload_test_driver : range_return_test_driver 
+            { 
+            public: 
+                template< class Container, 
+                          class TestPolicy > 
+                void operator()(Container& cont, TestPolicy policy) 
+                { 
+                    range_return_test_driver::operator()(cont, policy); 
+                    test_range_overload<Container, TestPolicy>()(cont, policy); 
+                } 
+     
+            private: 
+                template< class Container, class TestPolicy > 
+                struct test_range_overload 
+                { 
+                    void operator()(Container& cont, TestPolicy policy) 
+                    { 
+                        typedef BOOST_DEDUCED_TYPENAME range_iterator<Container>::type iterator_t; 
+                        typedef BOOST_DEDUCED_TYPENAME TestPolicy::template test_range_overload<Container> test_range_overload_t; 
+                        const range_return_value result_type = test_range_overload_t::result_type;  
+                        typedef BOOST_DEDUCED_TYPENAME range_return<Container, result_type>::type range_return_t; 
+     
+                        Container reference(cont); 
+                        Container test_cont(cont); 
+     
+                        test_range_overload_t test_range_overload_fn; 
+                        range_return_t range_result = test_range_overload_fn(policy, test_cont); 
+     
+                        iterator_t reference_it = policy.reference(reference); 
+     
+                        check_results<result_type>::test(test_cont, reference, 
+                                                         range_result, reference_it); 
+                    } 
+                }; 
+            }; 
+        } 
+    } 
+     
+    #endif // include guard 
\ No newline at end of file

From 226dbab18301f83fd901ac42dc23ccae1d0d0c71 Mon Sep 17 00:00:00 2001
From: Neil Groves <neil@grovescomputing.com>
Date: Sun, 15 Sep 2013 21:54:32 +0000
Subject: [PATCH 58/73] [boost][range] Ticket 8702 - size_type detection

[SVN r85690]
---
 include/boost/range/size_type.hpp |  13 ++-
 test/extension_size.cpp           | 143 ++++++++++++++++++++++++++++--
 2 files changed, 147 insertions(+), 9 deletions(-)

diff --git a/include/boost/range/size_type.hpp b/include/boost/range/size_type.hpp
index c6fb54b..dab2f0d 100644
--- a/include/boost/range/size_type.hpp
+++ b/include/boost/range/size_type.hpp
@@ -17,6 +17,7 @@
 
 #include <boost/range/config.hpp>
 #include <boost/range/difference_type.hpp>
+#include <boost/range/concepts.hpp>
 #ifdef BOOST_NO_TEMPLATE_PARTIAL_SPECIALIZATION
 #include <boost/range/detail/size_type.hpp>
 #else
@@ -45,8 +46,8 @@ namespace boost
             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);
+            template<typename C>
+            static no_type test(...);
 
         public:
             static const bool value = sizeof(test<T>(0)) == sizeof(yes_type);
@@ -74,12 +75,16 @@ namespace boost
     template< class T >
     struct range_size :
         detail::range_size<T>
-    { };
+    {
+        BOOST_RANGE_CONCEPT_ASSERT((boost::SinglePassRangeConcept<T>));
+    };
 
     template< class T >
     struct range_size<const T >
         : detail::range_size<T>
-    { };
+    {
+        BOOST_RANGE_CONCEPT_ASSERT((boost::SinglePassRangeConcept<T>));
+    };
 
 } // namespace boost
 
diff --git a/test/extension_size.cpp b/test/extension_size.cpp
index 6c7157f..0df8f22 100644
--- a/test/extension_size.cpp
+++ b/test/extension_size.cpp
@@ -19,6 +19,7 @@
 #include <boost/range.hpp>
 #include <boost/test/test_tools.hpp>
 #include <boost/test/unit_test.hpp>
+#include <boost/static_assert.hpp>
 #include <list>
 #include <vector>
 
@@ -27,6 +28,13 @@ namespace boost_range_extension_size_test
     class FooWithoutSize
     {
         typedef std::list<int> impl_t;
+        
+        BOOST_STATIC_ASSERT((
+            boost::is_same<
+                boost::range_size<std::list<int> >::type,
+                std::list<int>::size_type
+            >::value));
+        
         typedef impl_t::const_iterator const_iterator;
         typedef impl_t::iterator iterator;
 
@@ -39,12 +47,117 @@ namespace boost_range_extension_size_test
     private:
         impl_t m_impl;
     };
-
-    inline boost::range_size<std::list<int> >::type
-    range_calculate_size(const FooWithoutSize& rng)
+    
+    template<typename SizeType>
+    class FooWithSize
     {
-        return 2u;
-    }
+    public:
+        typedef SizeType size_type;
+        typedef boost::uint8_t* iterator;
+        typedef const boost::uint8_t* const_iterator;
+        
+        const_iterator begin() const;
+        iterator begin();
+        const_iterator end() const;
+        iterator end();
+    };
+    
+    BOOST_STATIC_ASSERT((
+        boost::is_same<
+            boost::uint8_t,
+            boost::range_size<FooWithSize<boost::uint8_t> >::type
+        >::value
+    ));
+    
+    BOOST_STATIC_ASSERT((
+        boost::is_same<
+            boost::uint16_t,
+            boost::range_size<FooWithSize<boost::uint16_t> >::type
+        >::value
+    ));
+    
+    BOOST_STATIC_ASSERT((
+        boost::is_same<
+            boost::uint32_t,
+            boost::range_size<FooWithSize<boost::uint32_t> >::type
+        >::value
+    ));
+    
+    BOOST_STATIC_ASSERT((
+        boost::is_same<
+            boost::uint64_t,
+            boost::range_size<FooWithSize<boost::uint64_t> >::type
+        >::value
+    ));
+    
+    class UdtSizeType
+    {
+    public:
+        typedef boost::uint16_t value_type;
+        
+        UdtSizeType() : value_(0) { }
+        UdtSizeType(value_type value) : value_(value) { }
+        
+        operator value_type() const { return value_; }
+        
+    private:
+        value_type value_;
+    };
+    
+    BOOST_STATIC_ASSERT((
+        boost::is_same<
+            UdtSizeType,
+            boost::range_size<FooWithSize<UdtSizeType> >::type
+        >::value
+    ));
+    
+    class Foo2WithoutSize
+    {
+    public:
+        struct const_iterator
+        {
+            typedef std::forward_iterator_tag iterator_category;
+            typedef boost::int8_t difference_type;
+            typedef boost::int16_t value_type;
+            typedef value_type* pointer;
+            typedef value_type& reference;
+            
+            reference operator*() const;
+            pointer operator->() const;
+            const_iterator& operator++();
+            const_iterator operator++(int);
+            bool operator==(const const_iterator&) const;
+            bool operator!=(const const_iterator&) const;
+        };
+        
+        struct iterator : const_iterator
+        {
+            typedef const value_type* pointer;
+            typedef const value_type& reference;
+            
+            reference operator*() const;
+            pointer operator->() const;
+            
+            iterator& operator++();
+            iterator operator++(int);
+            
+            bool operator==(const iterator&) const;
+            bool operator!=(const iterator&) const;
+        };
+        
+        const_iterator begin() const;
+        iterator begin();
+        const_iterator end() const;
+        iterator end();
+    };
+    
+    BOOST_STATIC_ASSERT((
+        boost::is_same<
+            boost::uint8_t,
+            boost::range_size<
+                ::boost_range_extension_size_test::Foo2WithoutSize>::type
+        >::value
+    ));
 }
 
 namespace boost
@@ -60,6 +173,26 @@ namespace boost
     };
 }
 
+namespace boost_range_extension_size_test
+{
+    inline boost::range_size<FooWithoutSize>::type
+    range_calculate_size(const FooWithoutSize& rng)
+    {
+        return 2u;
+    }
+}
+
+BOOST_STATIC_ASSERT((
+    boost::is_same<
+        typename boost::make_unsigned<std::ptrdiff_t>::type,
+        typename boost::range_size<
+                    boost_range_extension_size_test::FooWithoutSize>::type
+    >::value
+));
+
+typedef boost::make_unsigned<std::ptrdiff_t>::type t1;
+typedef boost::range_size<boost_range_extension_size_test::FooWithoutSize>::type t1;
+
 namespace
 {
 

From e7880d8963ed4b6d025c7a07d203cd23a6ca52d3 Mon Sep 17 00:00:00 2001
From: Neil Groves <neil@grovescomputing.com>
Date: Sun, 15 Sep 2013 22:15:12 +0000
Subject: [PATCH 59/73] [boost][range] - changed join_iterator reference type
 handling to address several user observations and failing clang builds.

[SVN r85691]
---
 include/boost/range/detail/join_iterator.hpp | 16 +++++++++-------
 1 file changed, 9 insertions(+), 7 deletions(-)

diff --git a/include/boost/range/detail/join_iterator.hpp b/include/boost/range/detail/join_iterator.hpp
index 70ecf65..d025c81 100644
--- a/include/boost/range/detail/join_iterator.hpp
+++ b/include/boost/range/detail/join_iterator.hpp
@@ -23,6 +23,10 @@
 #include <boost/range/empty.hpp>
 #include <boost/range/detail/demote_iterator_traversal_tag.hpp>
 #include <boost/range/value_type.hpp>
+#include <boost/type_traits/add_const.hpp>
+#include <boost/type_traits/add_reference.hpp>
+#include <boost/type_traits/remove_const.hpp>
+#include <boost/type_traits/remove_reference.hpp>
 #include <boost/next_prior.hpp>
 
 namespace boost
@@ -71,7 +75,9 @@ public:
 
     Reference dereference(unsigned int selected) const
     {
-        return selected ? *m_it2 : *m_it1;
+        if (selected)
+            return *m_it2;
+        return *m_it1;
     }
 
     bool equal(const join_iterator_union& other, unsigned int selected) const
@@ -143,12 +149,8 @@ template<typename Iterator1
                                     typename iterator_reference<Iterator2>::type
                                 >::type
                             >::value,
-                            typename add_reference<
-                                typename add_const<
-                                    typename remove_reference<
-                                        typename iterator_reference<Iterator2>::type
-                                    >::type
-                                >::type
+                            typename add_const<
+                                typename iterator_reference<Iterator1>::type
                             >::type,
                             typename iterator_reference<Iterator1>::type
                         >::type

From ec4783e6559a1e8bd182240438e857b8a23c3bda Mon Sep 17 00:00:00 2001
From: Neil Groves <neil@grovescomputing.com>
Date: Sun, 15 Sep 2013 22:15:46 +0000
Subject: [PATCH 60/73] [boost][range] - changed join_iterator reference type
 handling to address several user observations and failing clang builds.

[SVN r85692]
---
 test/join.cpp | 6 +++++-
 1 file changed, 5 insertions(+), 1 deletion(-)

diff --git a/test/join.cpp b/test/join.cpp
index b30d060..cff3f35 100644
--- a/test/join.cpp
+++ b/test/join.cpp
@@ -135,7 +135,11 @@ namespace boost
         {
             Collection1 c1(rng1);
             Collection2 c2(rng2);
-            typedef typename boost::range_value<Collection1>::type value_t;
+            
+            typedef BOOST_DEDUCED_TYPENAME boost::range_value<
+                Collection1
+            >::type value_t BOOST_RANGE_UNUSED;
+            
             fill_with_ints(boost::join(c1,c2));
 
             // Ensure that the size of the written range has not been

From a8084dcb1259fa274257b8ad946b571bb4a5f1c5 Mon Sep 17 00:00:00 2001
From: Neil Groves <neil@grovescomputing.com>
Date: Mon, 16 Sep 2013 10:10:12 +0000
Subject: [PATCH 61/73] [boost][range] correct lifetime defect in the tokenized
 range adapter

[SVN r85697]
---
 include/boost/range/adaptor/tokenized.hpp | 6 +++---
 1 file changed, 3 insertions(+), 3 deletions(-)
 mode change 100755 => 100644 include/boost/range/adaptor/tokenized.hpp

diff --git a/include/boost/range/adaptor/tokenized.hpp b/include/boost/range/adaptor/tokenized.hpp
old mode 100755
new mode 100644
index 8a7402a..f0aa12e
--- a/include/boost/range/adaptor/tokenized.hpp
+++ b/include/boost/range/adaptor/tokenized.hpp
@@ -52,9 +52,9 @@ namespace boost
         template< class T, class U, class V >
         struct regex_holder
         {
-            const T&  re;
-            const U&  sub;
-            V         f;
+            T  re;
+            U  sub;
+            V  f;
 
             regex_holder( const T& rex, const U& subm, V flag ) :
                 re(rex), sub(subm), f(flag)

From 01b4147e0924bf2a4b363656ee48d3230b1841e1 Mon Sep 17 00:00:00 2001
From: Neil Groves <neil@grovescomputing.com>
Date: Mon, 16 Sep 2013 11:21:36 +0000
Subject: [PATCH 62/73] [boost][range] - removed warnings found building with
 clang 3.2.

[SVN r85698]
---
 include/boost/range/size_type.hpp        | 4 ++--
 test/adaptor_test/strided.cpp            | 1 +
 test/algorithm_test/copy.cpp             | 2 +-
 test/algorithm_test/stable_partition.cpp | 2 ++
 test/algorithm_test/transform.cpp        | 4 ++++
 test/compat2.cpp                         | 2 ++
 test/extension_size.cpp                  | 4 ++--
 7 files changed, 14 insertions(+), 5 deletions(-)

diff --git a/include/boost/range/size_type.hpp b/include/boost/range/size_type.hpp
index dab2f0d..800ec15 100644
--- a/include/boost/range/size_type.hpp
+++ b/include/boost/range/size_type.hpp
@@ -76,14 +76,14 @@ namespace boost
     struct range_size :
         detail::range_size<T>
     {
-        BOOST_RANGE_CONCEPT_ASSERT((boost::SinglePassRangeConcept<T>));
+        BOOST_RANGE_CONCEPT_ASSERT((boost::SinglePassRangeConcept<T>))
     };
 
     template< class T >
     struct range_size<const T >
         : detail::range_size<T>
     {
-        BOOST_RANGE_CONCEPT_ASSERT((boost::SinglePassRangeConcept<T>));
+        BOOST_RANGE_CONCEPT_ASSERT((boost::SinglePassRangeConcept<T>))
     };
 
 } // namespace boost
diff --git a/test/adaptor_test/strided.cpp b/test/adaptor_test/strided.cpp
index b49cfc6..290cd4b 100644
--- a/test/adaptor_test/strided.cpp
+++ b/test/adaptor_test/strided.cpp
@@ -132,6 +132,7 @@ namespace boost
 
             typedef boost::strided_range<Container> strided_range_t;
             strided_range_t rng( boost::adaptors::stride(c, 0) );
+            boost::ignore_unused_variable_warning(rng);
             typedef BOOST_DEDUCED_TYPENAME boost::range_iterator<strided_range_t>::type iter_t;
 
             iter_t first(boost::begin(c), boost::begin(c), boost::end(c), 0);
diff --git a/test/algorithm_test/copy.cpp b/test/algorithm_test/copy.cpp
index 47f4172..4b9fcc2 100644
--- a/test/algorithm_test/copy.cpp
+++ b/test/algorithm_test/copy.cpp
@@ -43,7 +43,7 @@ namespace boost
                 source.begin(), source.end()
                 );
 
-            it == boost::copy(boost::make_iterator_range(source), target.begin());
+            it = boost::copy(boost::make_iterator_range(source), target.begin());
             
             BOOST_CHECK( it == target.end() );
 
diff --git a/test/algorithm_test/stable_partition.cpp b/test/algorithm_test/stable_partition.cpp
index 3bf20e2..b39161f 100644
--- a/test/algorithm_test/stable_partition.cpp
+++ b/test/algorithm_test/stable_partition.cpp
@@ -71,6 +71,8 @@ namespace boost_range_test_algorithm_stable_partition
 
                 result_t result2 = boost::stable_partition<return_type>(
                                     boost::make_iterator_range(cont2), policy.pred());
+                                    
+                boost::ignore_unused_variable_warning(result2);
 
                 BOOST_CHECK_EQUAL_COLLECTIONS( cont2.begin(), cont2.end(),
                                                cont.begin(), cont.end() );
diff --git a/test/algorithm_test/transform.cpp b/test/algorithm_test/transform.cpp
index 3e37180..11ac5f0 100644
--- a/test/algorithm_test/transform.cpp
+++ b/test/algorithm_test/transform.cpp
@@ -41,6 +41,8 @@ namespace boost
 
             iterator_t reference_it
                 = std::transform(cont.begin(), cont.end(), reference.begin(), fn);
+                
+            boost::ignore_unused_variable_warning(reference_it);
 
             iterator_t test_it
                 = boost::transform(cont, target.begin(), fn);
@@ -101,6 +103,8 @@ namespace boost
             iterator_t reference_it
                 = std::transform(cont1.begin(), cont1.end(),
                                  cont2.begin(), reference.begin(), fn);
+                                 
+            boost::ignore_unused_variable_warning(reference_it);
 
             iterator_t test_it
                 = boost::transform(cont1, cont2, target.begin(), fn);
diff --git a/test/compat2.cpp b/test/compat2.cpp
index 2874c04..feaa047 100644
--- a/test/compat2.cpp
+++ b/test/compat2.cpp
@@ -10,6 +10,7 @@
 
 #include <boost/static_assert.hpp>
 #include <boost/type_traits.hpp>
+#include <boost/concept_check.hpp>
 #include <boost/config.hpp>
 
 enum Container {};
@@ -51,6 +52,7 @@ void compat1()
 {
     std::vector<int> v;
     iterator_of< std::vector<int> >::type i = v.begin();
+    boost::ignore_unused_variable_warning(i);
 }
 
 #include <boost/test/included/unit_test.hpp> 
diff --git a/test/extension_size.cpp b/test/extension_size.cpp
index 0df8f22..202f465 100644
--- a/test/extension_size.cpp
+++ b/test/extension_size.cpp
@@ -184,8 +184,8 @@ namespace boost_range_extension_size_test
 
 BOOST_STATIC_ASSERT((
     boost::is_same<
-        typename boost::make_unsigned<std::ptrdiff_t>::type,
-        typename boost::range_size<
+        boost::make_unsigned<std::ptrdiff_t>::type,
+        boost::range_size<
                     boost_range_extension_size_test::FooWithoutSize>::type
     >::value
 ));

From d3b13dd49019d003cfc0ad41d6ea4d21704e1397 Mon Sep 17 00:00:00 2001
From: Andrey Semashev <andrey.semashev@gmail.com>
Date: Mon, 16 Sep 2013 17:13:20 +0000
Subject: [PATCH 63/73] Fixed compilation with gcc 4.7.

[SVN r85707]
---
 include/boost/range/size_type.hpp | 4 ++--
 1 file changed, 2 insertions(+), 2 deletions(-)

diff --git a/include/boost/range/size_type.hpp b/include/boost/range/size_type.hpp
index 800ec15..dab2f0d 100644
--- a/include/boost/range/size_type.hpp
+++ b/include/boost/range/size_type.hpp
@@ -76,14 +76,14 @@ namespace boost
     struct range_size :
         detail::range_size<T>
     {
-        BOOST_RANGE_CONCEPT_ASSERT((boost::SinglePassRangeConcept<T>))
+        BOOST_RANGE_CONCEPT_ASSERT((boost::SinglePassRangeConcept<T>));
     };
 
     template< class T >
     struct range_size<const T >
         : detail::range_size<T>
     {
-        BOOST_RANGE_CONCEPT_ASSERT((boost::SinglePassRangeConcept<T>))
+        BOOST_RANGE_CONCEPT_ASSERT((boost::SinglePassRangeConcept<T>));
     };
 
 } // namespace boost

From caeff560026fea1fe3bf09d36980e32a6a385679 Mon Sep 17 00:00:00 2001
From: Neil Groves <neil@grovescomputing.com>
Date: Mon, 16 Sep 2013 23:23:38 +0000
Subject: [PATCH 64/73] [boost][range] - fix a very odd compilation problem in
 range_size that only occurs on clang 4.2 on the Mac (clang 4.2 on linux is
 fine)

[SVN r85717]
---
 include/boost/range/size_type.hpp | 8 ++++++++
 1 file changed, 8 insertions(+)

diff --git a/include/boost/range/size_type.hpp b/include/boost/range/size_type.hpp
index dab2f0d..cc99ef3 100644
--- a/include/boost/range/size_type.hpp
+++ b/include/boost/range/size_type.hpp
@@ -76,14 +76,22 @@ namespace boost
     struct range_size :
         detail::range_size<T>
     {
+// Very strange things happen on some compilers that have the range concept
+// asserts disabled. This preprocessor condition is clearly redundant on a
+// working compiler but is vital for at least some compilers such as clang 4.2
+// but only on the Mac!
+#if BOOST_RANGE_ENABLE_CONCEPT_ASSERT == 1
         BOOST_RANGE_CONCEPT_ASSERT((boost::SinglePassRangeConcept<T>));
+#endif
     };
 
     template< class T >
     struct range_size<const T >
         : detail::range_size<T>
     {
+#if BOOST_RANGE_ENABLE_CONCEPT_ASSERT == 1        
         BOOST_RANGE_CONCEPT_ASSERT((boost::SinglePassRangeConcept<T>));
+#endif
     };
 
 } // namespace boost

From 738bd42696e24308be7ded3d2ac15c54151d96d8 Mon Sep 17 00:00:00 2001
From: Stephen Kelly <steveire@gmail.com>
Date: Wed, 25 Sep 2013 21:12:40 +0000
Subject: [PATCH 65/73] Range: Remove ATL specific define for old MSVC.

[SVN r85912]
---
 include/boost/range/atl.hpp | 9 ---------
 1 file changed, 9 deletions(-)

diff --git a/include/boost/range/atl.hpp b/include/boost/range/atl.hpp
index ab492d9..e6500e5 100644
--- a/include/boost/range/atl.hpp
+++ b/include/boost/range/atl.hpp
@@ -35,15 +35,6 @@
 #endif
 
 
-#if !defined(BOOST_RANGE_ATL_HAS_OLD_CSIMPLESTRING)
-    #if (_MSC_VER < 1310)   // from <boost/regex/mfc.hpp>, but dubious
-        #define BOOST_RANGE_ATL_HAS_OLD_CSIMPLESTRING
-    #endif
-#endif
-
-
-
-
 // forward declarations
 //
 

From ebbfe6559541eef5c63da1de1da463de0535bd85 Mon Sep 17 00:00:00 2001
From: Stephen Kelly <steveire@gmail.com>
Date: Wed, 25 Sep 2013 21:13:39 +0000
Subject: [PATCH 66/73] Range: Remove obsolete MSVC version checks.

[SVN r85915]
---
 include/boost/range.hpp                     |  10 --
 include/boost/range/config.hpp              |   8 +-
 include/boost/range/detail/begin.hpp        |  11 --
 include/boost/range/detail/end.hpp          |  21 +--
 include/boost/range/detail/size.hpp         |  23 +--
 include/boost/range/detail/vc6/end.hpp      | 170 --------------------
 include/boost/range/detail/vc6/size.hpp     | 166 -------------------
 include/boost/range/iterator_range_core.hpp |   2 -
 8 files changed, 9 insertions(+), 402 deletions(-)
 mode change 100755 => 100644 include/boost/range/detail/size.hpp
 delete mode 100755 include/boost/range/detail/vc6/end.hpp
 delete mode 100755 include/boost/range/detail/vc6/size.hpp

diff --git a/include/boost/range.hpp b/include/boost/range.hpp
index 948c3d7..2aeb393 100755
--- a/include/boost/range.hpp
+++ b/include/boost/range.hpp
@@ -15,19 +15,9 @@
 # pragma once
 #endif
 
-#if _MSC_VER == 1300 // experiment
-
-#include <boost/range/detail/collection_traits.hpp>
-#include <boost/range/iterator_range.hpp>
-#include <boost/range/sub_range.hpp>
-
-#else
-
 #include <boost/range/functions.hpp>
 #include <boost/range/metafunctions.hpp>
 #include <boost/range/iterator_range.hpp>
 #include <boost/range/sub_range.hpp>
 
-#endif // _MSC_VER == 1300 // experiment
-
 #endif
diff --git a/include/boost/range/config.hpp b/include/boost/range/config.hpp
index cf9e204..fc2693e 100644
--- a/include/boost/range/config.hpp
+++ b/include/boost/range/config.hpp
@@ -26,18 +26,14 @@
 #if BOOST_WORKAROUND(__BORLANDC__, BOOST_TESTED_AT(0x564))
 # define BOOST_RANGE_DEDUCED_TYPENAME typename
 #else
-# if BOOST_WORKAROUND(BOOST_MSVC, == 1300) && !defined(_MSC_EXTENSIONS)
-#  define BOOST_RANGE_DEDUCED_TYPENAME typename
-# else
-#  define BOOST_RANGE_DEDUCED_TYPENAME BOOST_DEDUCED_TYPENAME
-# endif
+#define BOOST_RANGE_DEDUCED_TYPENAME BOOST_DEDUCED_TYPENAME
 #endif
 
 #ifdef BOOST_RANGE_NO_ARRAY_SUPPORT
 #error "macro already defined!"
 #endif
 
-#if BOOST_WORKAROUND( BOOST_MSVC, < 1300 ) || BOOST_WORKAROUND( __MWERKS__, <= 0x3003 )
+#if BOOST_WORKAROUND( __MWERKS__, <= 0x3003 )
 #define BOOST_RANGE_NO_ARRAY_SUPPORT 1
 #endif
 
diff --git a/include/boost/range/detail/begin.hpp b/include/boost/range/detail/begin.hpp
index f3da732..1d9390f 100644
--- a/include/boost/range/detail/begin.hpp
+++ b/include/boost/range/detail/begin.hpp
@@ -15,9 +15,6 @@
 #include <boost/detail/workaround.hpp>
 #include <boost/range/iterator.hpp>
 #include <boost/range/detail/common.hpp>
-#if BOOST_WORKAROUND(BOOST_MSVC, < 1310)
-# include <boost/range/value_type.hpp>
-#endif
 
 namespace boost
 {
@@ -62,19 +59,11 @@ namespace boost
         template<>
         struct range_begin<array_>
         {
-        #if !BOOST_WORKAROUND(BOOST_MSVC, < 1310)
-            template< typename T, std::size_t sz >
-            static T* fun( T BOOST_RANGE_ARRAY_REF()[sz] )
-            {
-                return boost_range_array;
-            }
-        #else
             template<typename T>
             static BOOST_RANGE_DEDUCED_TYPENAME range_value<T>::type* fun(T& t)
             {
                 return t;
             }
-        #endif
         };
 
     } // namespace 'range_detail'
diff --git a/include/boost/range/detail/end.hpp b/include/boost/range/detail/end.hpp
index 8b5f35d..f2f7178 100644
--- a/include/boost/range/detail/end.hpp
+++ b/include/boost/range/detail/end.hpp
@@ -14,15 +14,9 @@
 #include <boost/config.hpp> // BOOST_MSVC
 #include <boost/detail/workaround.hpp>
 
-#if BOOST_WORKAROUND(BOOST_MSVC, < 1300)
-# include <boost/range/detail/vc6/end.hpp>
-#else
-# include <boost/range/detail/implementation_help.hpp>
-# include <boost/range/iterator.hpp>
-# include <boost/range/detail/common.hpp>
-# if BOOST_WORKAROUND(BOOST_MSVC, < 1310)
-#  include <boost/range/detail/remove_extent.hpp>
-# endif
+#include <boost/range/detail/implementation_help.hpp>
+#include <boost/range/iterator.hpp>
+#include <boost/range/detail/common.hpp>
 
 namespace boost
 {
@@ -68,19 +62,11 @@ namespace boost
         template<>
         struct range_end<array_>
         {
-        #if !BOOST_WORKAROUND(BOOST_MSVC, < 1310)
-            template< typename T, std::size_t sz >
-            static T* fun( T BOOST_RANGE_ARRAY_REF()[sz] )
-            {
-                return boost::range_detail::array_end( boost_range_array );
-            }
-        #else
             template<typename T>
             static BOOST_RANGE_DEDUCED_TYPENAME remove_extent<T>::type* fun(T& t)
             {
                 return t + remove_extent<T>::size;
             }
-        #endif
         };
 
     } // namespace 'range_detail'
@@ -97,5 +83,4 @@ namespace boost
 
 } // namespace 'boost'
 
-# endif // VC6
 #endif
diff --git a/include/boost/range/detail/size.hpp b/include/boost/range/detail/size.hpp
old mode 100755
new mode 100644
index fe52ba0..eec134c
--- a/include/boost/range/detail/size.hpp
+++ b/include/boost/range/detail/size.hpp
@@ -14,16 +14,10 @@
 
 #include <boost/config.hpp> // BOOST_MSVC
 #include <boost/detail/workaround.hpp>
-#if BOOST_WORKAROUND(BOOST_MSVC, < 1300)
-# include <boost/range/detail/vc6/size.hpp>
-#else
-# include <boost/range/detail/implementation_help.hpp>
-# include <boost/range/detail/size_type.hpp>
-# include <boost/range/detail/common.hpp>
-# if BOOST_WORKAROUND(BOOST_MSVC, == 1300)
-#  include <boost/range/detail/remove_extent.hpp>
-# endif
-# include <iterator>
+#include <boost/range/detail/implementation_help.hpp>
+#include <boost/range/detail/size_type.hpp>
+#include <boost/range/detail/common.hpp>
+#include <iterator>
 
 namespace boost 
 {
@@ -68,19 +62,11 @@ namespace boost
         template<>
         struct range_size_<array_>
         {
-        #if !BOOST_WORKAROUND(BOOST_MSVC, <= 1300)
-            template< typename T, std::size_t sz >
-            static std::size_t fun( T BOOST_RANGE_ARRAY_REF()[sz] )
-            {
-                return sz;
-            }
-        #else
             template<typename T>
             static std::size_t fun(T& t)
             {
                 return remove_extent<T>::size;
             }
-        #endif
         };
         
         template<>
@@ -155,5 +141,4 @@ namespace boost
     
 } // namespace 'boost'
 
-# endif
 #endif
diff --git a/include/boost/range/detail/vc6/end.hpp b/include/boost/range/detail/vc6/end.hpp
deleted file mode 100755
index 4f76af5..0000000
--- a/include/boost/range/detail/vc6/end.hpp
+++ /dev/null
@@ -1,170 +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/
-//
-
-#ifndef BOOST_RANGE_DETAIL_VC6_END_HPP
-#define BOOST_RANGE_DETAIL_VC6_END_HPP
-
-#include <boost/range/detail/implementation_help.hpp>
-#include <boost/range/detail/implementation_help.hpp>
-#include <boost/range/result_iterator.hpp>
-#include <boost/range/detail/common.hpp>
-#include <boost/range/detail/remove_extent.hpp>
-
-namespace boost 
-{
-    namespace range_detail
-    {
-        template< typename T >
-        struct range_end;
-
-        //////////////////////////////////////////////////////////////////////
-        // default
-        //////////////////////////////////////////////////////////////////////
-        
-        template<>
-        struct range_end<std_container_>
-        {
-            template< typename C >
-            struct inner {
-                static BOOST_RANGE_DEDUCED_TYPENAME range_result_iterator<C>::type 
-                fun( C& c )
-                {
-                    return c.end();
-                };
-            };
-        };
-                    
-        //////////////////////////////////////////////////////////////////////
-        // pair
-        //////////////////////////////////////////////////////////////////////
-        
-        template<>
-        struct range_end<std_pair_>
-        {
-            template< typename P >
-            struct inner {
-                static BOOST_RANGE_DEDUCED_TYPENAME range_result_iterator<P>::type 
-                fun( const P& p )
-                {
-                    return p.second;
-                }
-            };
-        };
- 
-        //////////////////////////////////////////////////////////////////////
-        // array
-        //////////////////////////////////////////////////////////////////////
-        
-        template<>
-        struct range_end<array_>  
-        {
-            template< typename T >
-            struct inner {
-                static BOOST_DEDUCED_TYPENAME remove_extent<T>::type*
-                fun(T& t)
-                {
-                    return t + remove_extent<T>::size;
-                }
-            };
-        };
-
-                
-        template<>
-        struct range_end<char_array_>
-        {
-            template< typename T >
-            struct inner {
-                static BOOST_DEDUCED_TYPENAME remove_extent<T>::type*
-                fun(T& t)
-                {
-                    return t + remove_extent<T>::size;
-                }
-            };
-        };
-        
-        template<>
-        struct range_end<wchar_t_array_>
-        {
-            template< typename T >
-            struct inner {
-                static BOOST_DEDUCED_TYPENAME remove_extent<T>::type*
-                fun(T& t)
-                {
-                    return t + remove_extent<T>::size;
-                }
-            };
-        };
-
-        //////////////////////////////////////////////////////////////////////
-        // string
-        //////////////////////////////////////////////////////////////////////
-        
-        template<>
-        struct range_end<char_ptr_>
-        {
-            template< typename T >
-            struct inner {
-                static char* fun( char* s )
-                {
-                    return boost::range_detail::str_end( s );
-                }
-            };
-        };
-
-        template<>
-        struct range_end<const_char_ptr_>
-        {
-            template< typename T >
-            struct inner {
-                static const char* fun( const char* s )
-                {
-                    return boost::range_detail::str_end( s );
-                }
-            };
-        };
-
-        template<>
-        struct range_end<wchar_t_ptr_>
-        {
-            template< typename T >
-            struct inner {
-                static wchar_t* fun( wchar_t* s )
-                {
-                    return boost::range_detail::str_end( s );
-                }
-            };
-        };
-
-
-        template<>
-        struct range_end<const_wchar_t_ptr_>
-        {
-            template< typename T >
-            struct inner {
-                static const wchar_t* fun( const wchar_t* s )
-                {
-                    return boost::range_detail::str_end( s );
-                }
-            };
-        };
-        
-    } // namespace 'range_detail'
-    
-    template< typename C >
-    inline BOOST_DEDUCED_TYPENAME range_result_iterator<C>::type 
-    end( C& c )
-    {
-        return range_detail::range_end<range_detail::range<C>::type>::inner<C>::fun( c );
-    }
-    
-} // namespace 'boost'
-
-
-#endif
diff --git a/include/boost/range/detail/vc6/size.hpp b/include/boost/range/detail/vc6/size.hpp
deleted file mode 100755
index 39f559f..0000000
--- a/include/boost/range/detail/vc6/size.hpp
+++ /dev/null
@@ -1,166 +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/
-//
-
-
-#ifndef BOOST_RANGE_DETAIL_VC6_SIZE_HPP
-#define BOOST_RANGE_DETAIL_VC6_SIZE_HPP
-
-#include <boost/range/detail/implementation_help.hpp>
-#include <boost/range/detail/size_type.hpp>
-#include <boost/range/detail/common.hpp>
-#include <boost/range/detail/remove_extent.hpp>
-#include <iterator>
-
-namespace boost 
-{
-    namespace range_detail
-    {
-        template< typename T >
-        struct range_size_;
-
-        //////////////////////////////////////////////////////////////////////
-        // default
-        //////////////////////////////////////////////////////////////////////
-        
-        template<>
-        struct range_size_<std_container_>
-        {
-            template< typename C >
-            struct inner {
-                static BOOST_RANGE_DEDUCED_TYPENAME C::size_type fun( const C& c )
-                {
-                    return c.size();
-                };
-            };
-        };
-                    
-        //////////////////////////////////////////////////////////////////////
-        // pair
-        //////////////////////////////////////////////////////////////////////
-        
-        template<>
-        struct range_size_<std_pair_>
-        {
-            template< typename P >
-            struct inner {
-                static BOOST_RANGE_DEDUCED_TYPENAME range_size<P>::type 
-                fun( const P& p )
-                {
-                    return std::distance( p.first, p.second );
-                }
-            };
-        };
- 
-        //////////////////////////////////////////////////////////////////////
-        // array
-        //////////////////////////////////////////////////////////////////////
-
-        template<>
-        struct range_size_<array_>
-        {
-            template<typename T>
-            struct inner {
-                static std::size_t fun(T& t)
-                {
-                    return remove_extent<T>::size;
-                }
-            };
-        };
-        
-        template<>
-        struct range_size_<char_array_>
-        {
-            template<typename T>
-            struct inner {
-                static std::size_t fun(T& t)
-                {
-                    return sizeof(T) / sizeof(T[0]);
-                }
-            };
-        };
-        
-        template<>
-        struct range_size_<wchar_t_array_>
-        {
-            template<typename T>
-            struct inner {
-                static std::size_t fun(T& t)
-                {
-                    return sizeof(T) / sizeof(T[0]);
-                }
-            };
-        };
-
-        //////////////////////////////////////////////////////////////////////
-        // string
-        //////////////////////////////////////////////////////////////////////
-
-        template<>
-        struct range_size_<char_ptr_>
-        {
-            template<typename T>
-            struct inner {
-                static std::size_t fun( const char* s )
-                {
-                    return boost::range_detail::str_size( s );
-                }
-            };
-        };
-
-        template<>
-        struct range_size_<const_char_ptr_>
-        {
-            template<typename T>
-            struct inner {
-                static std::size_t fun( const char* s )
-                {
-                    return boost::range_detail::str_size( s );
-                }
-            };
-        };
-        
-        template<>
-        struct range_size_<wchar_t_ptr_>
-        {
-            template<typename T>
-            struct inner {
-                static std::size_t fun( const wchar_t* s )
-                {
-                    return boost::range_detail::str_size( s );
-                }
-            };
-        };
-
-        template<>
-        struct range_size_<const_wchar_t_ptr_>
-        {
-            template<typename T>
-            struct inner {
-                static std::size_t fun( const wchar_t* s )
-                {
-                    return boost::range_detail::str_size( s );
-                }
-            };
-        };
-  
-    } // namespace 'range_detail'
-    
-
-    template< typename C >
-    BOOST_RANGE_DEDUCED_TYPENAME range_size<C>::type 
-    size( const C& c )
-    {
-        return range_detail::range_size_<range_detail::range<C>::type>::inner<C>::fun( c );
-    }
-    
-} // namespace 'boost'
-
-
-#endif
diff --git a/include/boost/range/iterator_range_core.hpp b/include/boost/range/iterator_range_core.hpp
index 6e68992..f985641 100644
--- a/include/boost/range/iterator_range_core.hpp
+++ b/include/boost/range/iterator_range_core.hpp
@@ -207,14 +207,12 @@ namespace boost
                 m_Begin( impl::adl_begin( r ) ), m_End( impl::adl_end( r ) )
             {}
 
-            #if !BOOST_WORKAROUND(BOOST_MSVC, < 1300)
             this_type& operator=( const this_type& r )
             {
                 m_Begin  = r.begin();
                 m_End    = r.end();
                 return *this;
             }
-            #endif
 
             template< class Iterator >
             iterator_range& operator=( const iterator_range<Iterator>& r )

From d1aea63c2f24483d62f36728e7bcc66122d87fae Mon Sep 17 00:00:00 2001
From: Stephen Kelly <steveire@gmail.com>
Date: Thu, 26 Sep 2013 13:02:51 +0000
Subject: [PATCH 67/73] Remove obsolete MSVC check from pragma guard

 git grep -h -B1 "^#\s*pragma once" | grep -v pragma | sort | uniq

is now clean.

[SVN r85952]
---
 include/boost/range.hpp                              | 2 +-
 include/boost/range/algorithm.hpp                    | 2 +-
 include/boost/range/as_array.hpp                     | 2 +-
 include/boost/range/as_literal.hpp                   | 2 +-
 include/boost/range/begin.hpp                        | 2 +-
 include/boost/range/category.hpp                     | 2 +-
 include/boost/range/config.hpp                       | 2 +-
 include/boost/range/const_iterator.hpp               | 2 +-
 include/boost/range/const_reverse_iterator.hpp       | 2 +-
 include/boost/range/detail/as_literal.hpp            | 2 +-
 include/boost/range/detail/common.hpp                | 2 +-
 include/boost/range/detail/extract_optional_type.hpp | 2 +-
 include/boost/range/detail/sizer.hpp                 | 2 +-
 include/boost/range/difference_type.hpp              | 2 +-
 include/boost/range/distance.hpp                     | 2 +-
 include/boost/range/empty.hpp                        | 2 +-
 include/boost/range/end.hpp                          | 2 +-
 include/boost/range/functions.hpp                    | 2 +-
 include/boost/range/iterator.hpp                     | 2 +-
 include/boost/range/metafunctions.hpp                | 2 +-
 include/boost/range/mutable_iterator.hpp             | 2 +-
 include/boost/range/numeric.hpp                      | 2 +-
 include/boost/range/pointer.hpp                      | 2 +-
 include/boost/range/rbegin.hpp                       | 2 +-
 include/boost/range/reference.hpp                    | 2 +-
 include/boost/range/rend.hpp                         | 2 +-
 include/boost/range/result_iterator.hpp              | 2 +-
 include/boost/range/reverse_iterator.hpp             | 2 +-
 include/boost/range/reverse_result_iterator.hpp      | 2 +-
 include/boost/range/size.hpp                         | 2 +-
 include/boost/range/size_type.hpp                    | 2 +-
 include/boost/range/value_type.hpp                   | 2 +-
 32 files changed, 32 insertions(+), 32 deletions(-)
 mode change 100755 => 100644 include/boost/range/algorithm.hpp
 mode change 100755 => 100644 include/boost/range/as_array.hpp
 mode change 100755 => 100644 include/boost/range/category.hpp
 mode change 100755 => 100644 include/boost/range/const_reverse_iterator.hpp
 mode change 100755 => 100644 include/boost/range/detail/common.hpp
 mode change 100755 => 100644 include/boost/range/detail/sizer.hpp
 mode change 100755 => 100644 include/boost/range/difference_type.hpp
 mode change 100755 => 100644 include/boost/range/distance.hpp
 mode change 100755 => 100644 include/boost/range/functions.hpp
 mode change 100755 => 100644 include/boost/range/pointer.hpp
 mode change 100755 => 100644 include/boost/range/rbegin.hpp
 mode change 100755 => 100644 include/boost/range/reference.hpp
 mode change 100755 => 100644 include/boost/range/rend.hpp
 mode change 100755 => 100644 include/boost/range/result_iterator.hpp
 mode change 100755 => 100644 include/boost/range/reverse_iterator.hpp
 mode change 100755 => 100644 include/boost/range/reverse_result_iterator.hpp
 mode change 100755 => 100644 include/boost/range/value_type.hpp

diff --git a/include/boost/range.hpp b/include/boost/range.hpp
index 2aeb393..179ae22 100755
--- a/include/boost/range.hpp
+++ b/include/boost/range.hpp
@@ -11,7 +11,7 @@
 #ifndef BOOST_RANGE_HPP_27_07_04
 #define BOOST_RANGE_HPP_27_07_04
 
-#if defined(_MSC_VER) && (_MSC_VER >= 1200)
+#if defined(_MSC_VER)
 # pragma once
 #endif
 
diff --git a/include/boost/range/algorithm.hpp b/include/boost/range/algorithm.hpp
old mode 100755
new mode 100644
index b7d8dd7..30dc583
--- a/include/boost/range/algorithm.hpp
+++ b/include/boost/range/algorithm.hpp
@@ -19,7 +19,7 @@
 // were originally written by Vladimir Prus'
 // <ghost@cs.msu.su> code from Boost Wiki
 
-#if defined(_MSC_VER) && _MSC_VER >= 1000
+#if defined(_MSC_VER)
 #pragma once
 #endif
 
diff --git a/include/boost/range/as_array.hpp b/include/boost/range/as_array.hpp
old mode 100755
new mode 100644
index 0723e60..69a1580
--- a/include/boost/range/as_array.hpp
+++ b/include/boost/range/as_array.hpp
@@ -11,7 +11,7 @@
 #ifndef BOOST_RANGE_AS_ARRAY_HPP
 #define BOOST_RANGE_AS_ARRAY_HPP
 
-#if defined(_MSC_VER) && (_MSC_VER >= 1200)
+#if defined(_MSC_VER)
 # pragma once
 #endif
 
diff --git a/include/boost/range/as_literal.hpp b/include/boost/range/as_literal.hpp
index 9ea144d..1c16e4a 100644
--- a/include/boost/range/as_literal.hpp
+++ b/include/boost/range/as_literal.hpp
@@ -11,7 +11,7 @@
 #ifndef BOOST_RANGE_AS_LITERAL_HPP
 #define BOOST_RANGE_AS_LITERAL_HPP
 
-#if defined(_MSC_VER) && (_MSC_VER >= 1200)
+#if defined(_MSC_VER)
 # pragma once
 #endif
 
diff --git a/include/boost/range/begin.hpp b/include/boost/range/begin.hpp
index c668488..980857f 100644
--- a/include/boost/range/begin.hpp
+++ b/include/boost/range/begin.hpp
@@ -11,7 +11,7 @@
 #ifndef BOOST_RANGE_BEGIN_HPP
 #define BOOST_RANGE_BEGIN_HPP
 
-#if defined(_MSC_VER) && (_MSC_VER >= 1200)
+#if defined(_MSC_VER)
 # pragma once
 #endif
 
diff --git a/include/boost/range/category.hpp b/include/boost/range/category.hpp
old mode 100755
new mode 100644
index 1574605..f5431ad
--- a/include/boost/range/category.hpp
+++ b/include/boost/range/category.hpp
@@ -11,7 +11,7 @@
 #ifndef BOOST_RANGE_CATEGORY_HPP
 #define BOOST_RANGE_CATEGORY_HPP
 
-#if defined(_MSC_VER) && (_MSC_VER >= 1200)
+#if defined(_MSC_VER)
 # pragma once
 #endif
 
diff --git a/include/boost/range/config.hpp b/include/boost/range/config.hpp
index fc2693e..7600a5f 100644
--- a/include/boost/range/config.hpp
+++ b/include/boost/range/config.hpp
@@ -13,7 +13,7 @@
 
 #include <boost/detail/workaround.hpp>
 
-#if defined(_MSC_VER) && (_MSC_VER >= 1200)
+#if defined(_MSC_VER)
 # pragma once
 #endif
 
diff --git a/include/boost/range/const_iterator.hpp b/include/boost/range/const_iterator.hpp
index 875320f..6b49ea0 100644
--- a/include/boost/range/const_iterator.hpp
+++ b/include/boost/range/const_iterator.hpp
@@ -11,7 +11,7 @@
 #ifndef BOOST_RANGE_CONST_ITERATOR_HPP
 #define BOOST_RANGE_CONST_ITERATOR_HPP
 
-#if defined(_MSC_VER) && (_MSC_VER >= 1200)
+#if defined(_MSC_VER)
 # pragma once
 #endif
 
diff --git a/include/boost/range/const_reverse_iterator.hpp b/include/boost/range/const_reverse_iterator.hpp
old mode 100755
new mode 100644
index 215bcc7..a1f49b7
--- a/include/boost/range/const_reverse_iterator.hpp
+++ b/include/boost/range/const_reverse_iterator.hpp
@@ -11,7 +11,7 @@
 #ifndef BOOST_RANGE_CONST_REVERSE_ITERATOR_HPP
 #define BOOST_RANGE_CONST_REVERSE_ITERATOR_HPP
 
-#if defined(_MSC_VER) && (_MSC_VER >= 1200)
+#if defined(_MSC_VER)
 # pragma once
 #endif
 
diff --git a/include/boost/range/detail/as_literal.hpp b/include/boost/range/detail/as_literal.hpp
index 0bd9a15..8b219ea 100644
--- a/include/boost/range/detail/as_literal.hpp
+++ b/include/boost/range/detail/as_literal.hpp
@@ -11,7 +11,7 @@
 #ifndef BOOST_RANGE_DETAIL_AS_LITERAL_HPP
 #define BOOST_RANGE_DETAIL_AS_LITERAL_HPP
 
-#if defined(_MSC_VER) && (_MSC_VER >= 1200)
+#if defined(_MSC_VER)
 # pragma once
 #endif
 
diff --git a/include/boost/range/detail/common.hpp b/include/boost/range/detail/common.hpp
old mode 100755
new mode 100644
index f7539f5..b0ad535
--- a/include/boost/range/detail/common.hpp
+++ b/include/boost/range/detail/common.hpp
@@ -11,7 +11,7 @@
 #ifndef BOOST_RANGE_DETAIL_COMMON_HPP
 #define BOOST_RANGE_DETAIL_COMMON_HPP
 
-#if defined(_MSC_VER) && (_MSC_VER >= 1200)
+#if defined(_MSC_VER)
 # pragma once
 #endif
 
diff --git a/include/boost/range/detail/extract_optional_type.hpp b/include/boost/range/detail/extract_optional_type.hpp
index 4a7f71a..aa4dd80 100644
--- a/include/boost/range/detail/extract_optional_type.hpp
+++ b/include/boost/range/detail/extract_optional_type.hpp
@@ -10,7 +10,7 @@
 #ifndef BOOST_RANGE_DETAIL_EXTRACT_OPTIONAL_TYPE_HPP_INCLUDED
 #define BOOST_RANGE_DETAIL_EXTRACT_OPTIONAL_TYPE_HPP_INCLUDED
 
-#if defined(_MSC_VER) && (_MSC_VER >= 1200)
+#if defined(_MSC_VER)
 # pragma once
 #endif
 
diff --git a/include/boost/range/detail/sizer.hpp b/include/boost/range/detail/sizer.hpp
old mode 100755
new mode 100644
index b4c1c91..cd6679c
--- a/include/boost/range/detail/sizer.hpp
+++ b/include/boost/range/detail/sizer.hpp
@@ -11,7 +11,7 @@
 #ifndef BOOST_RANGE_DETAIL_SIZER_HPP
 #define BOOST_RANGE_DETAIL_SIZER_HPP
 
-#if defined(_MSC_VER) && (_MSC_VER >= 1020)
+#if defined(_MSC_VER)
 # pragma once
 #endif
 
diff --git a/include/boost/range/difference_type.hpp b/include/boost/range/difference_type.hpp
old mode 100755
new mode 100644
index 164288f..4578002
--- a/include/boost/range/difference_type.hpp
+++ b/include/boost/range/difference_type.hpp
@@ -11,7 +11,7 @@
 #ifndef BOOST_RANGE_DIFFERENCE_TYPE_HPP
 #define BOOST_RANGE_DIFFERENCE_TYPE_HPP
 
-#if defined(_MSC_VER) && (_MSC_VER >= 1200)
+#if defined(_MSC_VER)
 # pragma once
 #endif
 
diff --git a/include/boost/range/distance.hpp b/include/boost/range/distance.hpp
old mode 100755
new mode 100644
index 42a106d..075f2d1
--- a/include/boost/range/distance.hpp
+++ b/include/boost/range/distance.hpp
@@ -11,7 +11,7 @@
 #ifndef BOOST_RANGE_DISTANCE_HPP
 #define BOOST_RANGE_DISTANCE_HPP
 
-#if defined(_MSC_VER) && (_MSC_VER >= 1200)
+#if defined(_MSC_VER)
 # pragma once
 #endif
 
diff --git a/include/boost/range/empty.hpp b/include/boost/range/empty.hpp
index 36e58d7..d57a30e 100644
--- a/include/boost/range/empty.hpp
+++ b/include/boost/range/empty.hpp
@@ -11,7 +11,7 @@
 #ifndef BOOST_RANGE_EMPTY_HPP
 #define BOOST_RANGE_EMPTY_HPP
 
-#if defined(_MSC_VER) && (_MSC_VER >= 1200)
+#if defined(_MSC_VER)
 # pragma once
 #endif
 
diff --git a/include/boost/range/end.hpp b/include/boost/range/end.hpp
index d5e6526..b3fc709 100644
--- a/include/boost/range/end.hpp
+++ b/include/boost/range/end.hpp
@@ -11,7 +11,7 @@
 #ifndef BOOST_RANGE_END_HPP
 #define BOOST_RANGE_END_HPP
 
-#if defined(_MSC_VER) && (_MSC_VER >= 1200)
+#if defined(_MSC_VER)
 # pragma once
 #endif
 
diff --git a/include/boost/range/functions.hpp b/include/boost/range/functions.hpp
old mode 100755
new mode 100644
index b8b8608..43c54b1
--- a/include/boost/range/functions.hpp
+++ b/include/boost/range/functions.hpp
@@ -11,7 +11,7 @@
 #ifndef BOOST_RANGE_FUNCTIONS_HPP
 #define BOOST_RANGE_FUNCTIONS_HPP
 
-#if defined(_MSC_VER) && (_MSC_VER >= 1200)
+#if defined(_MSC_VER)
 # pragma once
 #endif
 
diff --git a/include/boost/range/iterator.hpp b/include/boost/range/iterator.hpp
index ec73ddc..9d94d43 100644
--- a/include/boost/range/iterator.hpp
+++ b/include/boost/range/iterator.hpp
@@ -11,7 +11,7 @@
 #ifndef BOOST_RANGE_ITERATOR_HPP
 #define BOOST_RANGE_ITERATOR_HPP
 
-#if defined(_MSC_VER) && (_MSC_VER >= 1020)
+#if defined(_MSC_VER)
 # pragma once
 #endif
 
diff --git a/include/boost/range/metafunctions.hpp b/include/boost/range/metafunctions.hpp
index 469d9ae..9dc59d0 100644
--- a/include/boost/range/metafunctions.hpp
+++ b/include/boost/range/metafunctions.hpp
@@ -11,7 +11,7 @@
 #ifndef BOOST_RANGE_METAFUNCTIONS_HPP
 #define BOOST_RANGE_METAFUNCTIONS_HPP
 
-#if defined(_MSC_VER) && (_MSC_VER >= 1200)
+#if defined(_MSC_VER)
 # pragma once
 #endif
 
diff --git a/include/boost/range/mutable_iterator.hpp b/include/boost/range/mutable_iterator.hpp
index 7beca66..ffa2e66 100644
--- a/include/boost/range/mutable_iterator.hpp
+++ b/include/boost/range/mutable_iterator.hpp
@@ -11,7 +11,7 @@
 #ifndef BOOST_RANGE_MUTABLE_ITERATOR_HPP
 #define BOOST_RANGE_MUTABLE_ITERATOR_HPP
 
-#if defined(_MSC_VER) && (_MSC_VER >= 1200)
+#if defined(_MSC_VER)
 # pragma once
 #endif
 
diff --git a/include/boost/range/numeric.hpp b/include/boost/range/numeric.hpp
index bfd1049..c70069f 100644
--- a/include/boost/range/numeric.hpp
+++ b/include/boost/range/numeric.hpp
@@ -19,7 +19,7 @@
 // accompanying file LICENSE_1_0.txt or copy at
 // http://www.boost.org/LICENSE_1_0.txt)
 
-#if defined(_MSC_VER) && _MSC_VER >= 1000
+#if defined(_MSC_VER)
     #pragma once
 #endif
 
diff --git a/include/boost/range/pointer.hpp b/include/boost/range/pointer.hpp
old mode 100755
new mode 100644
index e7431ff..c3ed503
--- a/include/boost/range/pointer.hpp
+++ b/include/boost/range/pointer.hpp
@@ -11,7 +11,7 @@
 #ifndef BOOST_RANGE_POINTER_TYPE_HPP
 #define BOOST_RANGE_POINTER_TYPE_HPP
 
-#if defined(_MSC_VER) && (_MSC_VER >= 1200)
+#if defined(_MSC_VER)
 # pragma once
 #endif
 
diff --git a/include/boost/range/rbegin.hpp b/include/boost/range/rbegin.hpp
old mode 100755
new mode 100644
index 78e5f61..6d66de9
--- a/include/boost/range/rbegin.hpp
+++ b/include/boost/range/rbegin.hpp
@@ -11,7 +11,7 @@
 #ifndef BOOST_RANGE_RBEGIN_HPP
 #define BOOST_RANGE_RBEGIN_HPP
 
-#if defined(_MSC_VER) && (_MSC_VER >= 1200)
+#if defined(_MSC_VER)
 # pragma once
 #endif
 
diff --git a/include/boost/range/reference.hpp b/include/boost/range/reference.hpp
old mode 100755
new mode 100644
index d308e43..c664c38
--- a/include/boost/range/reference.hpp
+++ b/include/boost/range/reference.hpp
@@ -11,7 +11,7 @@
 #ifndef BOOST_RANGE_REFERENCE_TYPE_HPP
 #define BOOST_RANGE_REFERENCE_TYPE_HPP
 
-#if defined(_MSC_VER) && (_MSC_VER >= 1200)
+#if defined(_MSC_VER)
 # pragma once
 #endif
 
diff --git a/include/boost/range/rend.hpp b/include/boost/range/rend.hpp
old mode 100755
new mode 100644
index fd79aa2..ef70407
--- a/include/boost/range/rend.hpp
+++ b/include/boost/range/rend.hpp
@@ -11,7 +11,7 @@
 #ifndef BOOST_RANGE_REND_HPP
 #define BOOST_RANGE_REND_HPP
 
-#if defined(_MSC_VER) && (_MSC_VER >= 1200)
+#if defined(_MSC_VER)
 # pragma once
 #endif
 
diff --git a/include/boost/range/result_iterator.hpp b/include/boost/range/result_iterator.hpp
old mode 100755
new mode 100644
index ba09c5f..54e343d
--- a/include/boost/range/result_iterator.hpp
+++ b/include/boost/range/result_iterator.hpp
@@ -11,7 +11,7 @@
 #ifndef BOOST_RANGE_RESULT_ITERATOR_HPP
 #define BOOST_RANGE_RESULT_ITERATOR_HPP
 
-#if defined(_MSC_VER) && (_MSC_VER >= 1020)
+#if defined(_MSC_VER)
 # pragma once
 #endif
 
diff --git a/include/boost/range/reverse_iterator.hpp b/include/boost/range/reverse_iterator.hpp
old mode 100755
new mode 100644
index f8e9221..2569b17
--- a/include/boost/range/reverse_iterator.hpp
+++ b/include/boost/range/reverse_iterator.hpp
@@ -11,7 +11,7 @@
 #ifndef BOOST_RANGE_REVERSE_ITERATOR_HPP
 #define BOOST_RANGE_REVERSE_ITERATOR_HPP
 
-#if defined(_MSC_VER) && (_MSC_VER >= 1200)
+#if defined(_MSC_VER)
 # pragma once
 #endif
 
diff --git a/include/boost/range/reverse_result_iterator.hpp b/include/boost/range/reverse_result_iterator.hpp
old mode 100755
new mode 100644
index 62bf135..d375cfd
--- a/include/boost/range/reverse_result_iterator.hpp
+++ b/include/boost/range/reverse_result_iterator.hpp
@@ -11,7 +11,7 @@
 #ifndef BOOST_RANGE_REVERSE_RESULT_ITERATOR_HPP
 #define BOOST_RANGE_REVERSE_RESULT_ITERATOR_HPP
 
-#if defined(_MSC_VER) && (_MSC_VER >= 1020)
+#if defined(_MSC_VER)
 # pragma once
 #endif
 
diff --git a/include/boost/range/size.hpp b/include/boost/range/size.hpp
index 6ae74d1..9b63aff 100644
--- a/include/boost/range/size.hpp
+++ b/include/boost/range/size.hpp
@@ -11,7 +11,7 @@
 #ifndef BOOST_RANGE_SIZE_HPP
 #define BOOST_RANGE_SIZE_HPP
 
-#if defined(_MSC_VER) && (_MSC_VER >= 1200)
+#if defined(_MSC_VER)
 # pragma once
 #endif
 
diff --git a/include/boost/range/size_type.hpp b/include/boost/range/size_type.hpp
index cc99ef3..1be647d 100644
--- a/include/boost/range/size_type.hpp
+++ b/include/boost/range/size_type.hpp
@@ -11,7 +11,7 @@
 #ifndef BOOST_RANGE_SIZE_TYPE_HPP
 #define BOOST_RANGE_SIZE_TYPE_HPP
 
-#if defined(_MSC_VER) && (_MSC_VER >= 1020)
+#if defined(_MSC_VER)
 # pragma once
 #endif
 
diff --git a/include/boost/range/value_type.hpp b/include/boost/range/value_type.hpp
old mode 100755
new mode 100644
index 95c7580..4a67d05
--- a/include/boost/range/value_type.hpp
+++ b/include/boost/range/value_type.hpp
@@ -11,7 +11,7 @@
 #ifndef BOOST_RANGE_VALUE_TYPE_HPP
 #define BOOST_RANGE_VALUE_TYPE_HPP
 
-#if defined(_MSC_VER) && (_MSC_VER >= 1200)
+#if defined(_MSC_VER)
 # pragma once
 #endif
 

From b60d4c7172dc4637efa241f781e1feb7998370b6 Mon Sep 17 00:00:00 2001
From: Stephen Kelly <steveire@gmail.com>
Date: Tue, 1 Oct 2013 08:41:42 +0000
Subject: [PATCH 68/73] Range: Remove obsolete GCC version checks.

[SVN r86102]
---
 include/boost/range/begin.hpp | 16 ++++------------
 include/boost/range/end.hpp   | 16 ++++------------
 2 files changed, 8 insertions(+), 24 deletions(-)

diff --git a/include/boost/range/begin.hpp b/include/boost/range/begin.hpp
index 980857f..ba5a73b 100644
--- a/include/boost/range/begin.hpp
+++ b/include/boost/range/begin.hpp
@@ -26,9 +26,7 @@
 namespace boost
 {
 
-#if !BOOST_WORKAROUND(__BORLANDC__, BOOST_TESTED_AT(0x564)) && \
-    !BOOST_WORKAROUND(__GNUC__, < 3) \
-    /**/
+#if !BOOST_WORKAROUND(__BORLANDC__, BOOST_TESTED_AT(0x564))
 namespace range_detail
 {
 #endif
@@ -85,9 +83,7 @@ namespace range_detail
     }
 
 
-#if !BOOST_WORKAROUND(__BORLANDC__, BOOST_TESTED_AT(0x564)) && \
-    !BOOST_WORKAROUND(__GNUC__, < 3) \
-    /**/
+#if !BOOST_WORKAROUND(__BORLANDC__, BOOST_TESTED_AT(0x564))
 } // namespace 'range_detail'
 #endif
 
@@ -100,9 +96,7 @@ namespace range_adl_barrier
 template< class T >
 inline BOOST_DEDUCED_TYPENAME range_iterator<T>::type begin( T& r )
 {
-#if !BOOST_WORKAROUND(__BORLANDC__, BOOST_TESTED_AT(0x564)) && \
-    !BOOST_WORKAROUND(__GNUC__, < 3) \
-    /**/
+#if !BOOST_WORKAROUND(__BORLANDC__, BOOST_TESTED_AT(0x564))
     using namespace range_detail;
 #endif
     return range_begin( r );
@@ -111,9 +105,7 @@ inline BOOST_DEDUCED_TYPENAME range_iterator<T>::type begin( T& r )
 template< class T >
 inline BOOST_DEDUCED_TYPENAME range_iterator<const T>::type begin( const T& r )
 {
-#if !BOOST_WORKAROUND(__BORLANDC__, BOOST_TESTED_AT(0x564)) && \
-    !BOOST_WORKAROUND(__GNUC__, < 3) \
-    /**/
+#if !BOOST_WORKAROUND(__BORLANDC__, BOOST_TESTED_AT(0x564))
     using namespace range_detail;
 #endif
     return range_begin( r );
diff --git a/include/boost/range/end.hpp b/include/boost/range/end.hpp
index b3fc709..f2a3337 100644
--- a/include/boost/range/end.hpp
+++ b/include/boost/range/end.hpp
@@ -28,9 +28,7 @@
 namespace boost
 {
 
-#if !BOOST_WORKAROUND(__BORLANDC__, BOOST_TESTED_AT(0x564)) && \
-    !BOOST_WORKAROUND(__GNUC__, < 3) \
-    /**/
+#if !BOOST_WORKAROUND(__BORLANDC__, BOOST_TESTED_AT(0x564))
 namespace range_detail
 {
 #endif
@@ -82,9 +80,7 @@ namespace range_detail
             return range_detail::array_end<T,sz>( a );
         }
 
-#if !BOOST_WORKAROUND(__BORLANDC__, BOOST_TESTED_AT(0x564)) && \
-    !BOOST_WORKAROUND(__GNUC__, < 3) \
-    /**/
+#if !BOOST_WORKAROUND(__BORLANDC__, BOOST_TESTED_AT(0x564))
 } // namespace 'range_detail'
 #endif
 
@@ -94,9 +90,7 @@ namespace range_adl_barrier
 template< class T >
 inline BOOST_DEDUCED_TYPENAME range_iterator<T>::type end( T& r )
 {
-#if !BOOST_WORKAROUND(__BORLANDC__, BOOST_TESTED_AT(0x564)) && \
-    !BOOST_WORKAROUND(__GNUC__, < 3) \
-    /**/
+#if !BOOST_WORKAROUND(__BORLANDC__, BOOST_TESTED_AT(0x564))
     using namespace range_detail;
 #endif
     return range_end( r );
@@ -105,9 +99,7 @@ inline BOOST_DEDUCED_TYPENAME range_iterator<T>::type end( T& r )
 template< class T >
 inline BOOST_DEDUCED_TYPENAME range_iterator<const T>::type end( const T& r )
 {
-#if !BOOST_WORKAROUND(__BORLANDC__, BOOST_TESTED_AT(0x564)) && \
-    !BOOST_WORKAROUND(__GNUC__, < 3) \
-    /**/
+#if !BOOST_WORKAROUND(__BORLANDC__, BOOST_TESTED_AT(0x564))
     using namespace range_detail;
 #endif
     return range_end( r );

From 946d451d03375c288103ff77bd23781153dbaa77 Mon Sep 17 00:00:00 2001
From: Stephen Kelly <steveire@gmail.com>
Date: Fri, 11 Oct 2013 23:11:35 +0000
Subject: [PATCH 69/73] Remove obsolete files.

[SVN r86242]
---
 include/boost/range/const_iterator.hpp        |   4 -
 include/boost/range/detail/const_iterator.hpp |  71 ---------
 include/boost/range/detail/iterator.hpp       |  78 ----------
 include/boost/range/detail/size.hpp           | 144 ------------------
 include/boost/range/mutable_iterator.hpp      |   4 -
 5 files changed, 301 deletions(-)
 delete mode 100755 include/boost/range/detail/const_iterator.hpp
 delete mode 100755 include/boost/range/detail/iterator.hpp
 delete mode 100644 include/boost/range/detail/size.hpp

diff --git a/include/boost/range/const_iterator.hpp b/include/boost/range/const_iterator.hpp
index 6b49ea0..5512939 100644
--- a/include/boost/range/const_iterator.hpp
+++ b/include/boost/range/const_iterator.hpp
@@ -17,9 +17,6 @@
 
 #include <boost/range/config.hpp>
 
-#ifdef BOOST_NO_TEMPLATE_PARTIAL_SPECIALIZATION
-#include <boost/range/detail/const_iterator.hpp>
-#else
 
 #include <boost/range/detail/extract_optional_type.hpp>
 #include <boost/type_traits/remove_const.hpp>
@@ -62,6 +59,5 @@ namespace boost
 
 } // namespace boost
 
-#endif // BOOST_NO_TEMPLATE_PARTIAL_SPECIALIZATION
 
 #endif
diff --git a/include/boost/range/detail/const_iterator.hpp b/include/boost/range/detail/const_iterator.hpp
deleted file mode 100755
index e5cb34a..0000000
--- a/include/boost/range/detail/const_iterator.hpp
+++ /dev/null
@@ -1,71 +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/
-//
-
-#ifndef BOOST_RANGE_DETAIL_CONST_ITERATOR_HPP
-#define BOOST_RANGE_DETAIL_CONST_ITERATOR_HPP
-
-#include <boost/range/detail/common.hpp>
-#include <boost/range/detail/remove_extent.hpp>
-
-//////////////////////////////////////////////////////////////////////////////
-// missing partial specialization  workaround.
-//////////////////////////////////////////////////////////////////////////////
-
-namespace boost 
-{
-    namespace range_detail 
-    {      
-        template< typename T >
-        struct range_const_iterator_;
-
-        template<>
-        struct range_const_iterator_<std_container_>
-        {
-            template< typename C >
-            struct pts
-            {
-                typedef BOOST_RANGE_DEDUCED_TYPENAME C::const_iterator type;
-            };
-        };
-
-        template<>
-        struct range_const_iterator_<std_pair_>
-        {
-            template< typename P >
-            struct pts
-            {
-                typedef BOOST_RANGE_DEDUCED_TYPENAME P::first_type type;
-            };
-        };
-
-
-        template<>
-        struct range_const_iterator_<array_>
-        { 
-            template< typename T >
-            struct pts
-            {
-                typedef const BOOST_RANGE_DEDUCED_TYPENAME 
-                    remove_extent<T>::type* type;
-            };
-        };
-    } 
-    
-    template< typename C >
-    class range_const_iterator
-    {
-        typedef BOOST_DEDUCED_TYPENAME range_detail::range<C>::type c_type;
-    public:
-        typedef BOOST_DEDUCED_TYPENAME range_detail::range_const_iterator_<c_type>::BOOST_NESTED_TEMPLATE pts<C>::type type; 
-    };
-
-}
-
-#endif
diff --git a/include/boost/range/detail/iterator.hpp b/include/boost/range/detail/iterator.hpp
deleted file mode 100755
index 58346d4..0000000
--- a/include/boost/range/detail/iterator.hpp
+++ /dev/null
@@ -1,78 +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/
-//
-
-#ifndef BOOST_RANGE_DETAIL_ITERATOR_HPP
-#define BOOST_RANGE_DETAIL_ITERATOR_HPP
-
-#include <boost/range/detail/common.hpp>
-#include <boost/range/detail/remove_extent.hpp>
-
-#include <boost/static_assert.hpp>
-
-//////////////////////////////////////////////////////////////////////////////
-// missing partial specialization  workaround.
-//////////////////////////////////////////////////////////////////////////////
-
-namespace boost 
-{
-    namespace range_detail 
-    {        
-        template< typename T >
-        struct range_iterator_ {
-            template< typename C >
-            struct pts
-            {
-                typedef int type;
-            };
-        };
-
-        template<>
-        struct range_iterator_<std_container_>
-        {
-            template< typename C >
-            struct pts
-            {
-                typedef BOOST_RANGE_DEDUCED_TYPENAME C::iterator type;
-            };
-        };
-
-        template<>
-        struct range_iterator_<std_pair_>
-        {
-            template< typename P >
-            struct pts
-            {
-                typedef BOOST_RANGE_DEDUCED_TYPENAME P::first_type type;
-            };
-        };
-
-        template<>
-        struct range_iterator_<array_>
-        { 
-            template< typename T >
-            struct pts
-            {
-                typedef BOOST_RANGE_DEDUCED_TYPENAME 
-                    remove_extent<T>::type* type;
-            };
-        };
-        
-    } 
-
-    template< typename C >
-    class range_mutable_iterator
-    {
-        typedef BOOST_RANGE_DEDUCED_TYPENAME range_detail::range<C>::type c_type;
-    public:
-        typedef typename range_detail::range_iterator_<c_type>::BOOST_NESTED_TEMPLATE pts<C>::type type; 
-    };
-}
-
-#endif
diff --git a/include/boost/range/detail/size.hpp b/include/boost/range/detail/size.hpp
deleted file mode 100644
index eec134c..0000000
--- a/include/boost/range/detail/size.hpp
+++ /dev/null
@@ -1,144 +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/
-//
-
-
-#ifndef BOOST_RANGE_DETAIL_SIZE_HPP
-#define BOOST_RANGE_DETAIL_SIZE_HPP
-
-#include <boost/config.hpp> // BOOST_MSVC
-#include <boost/detail/workaround.hpp>
-#include <boost/range/detail/implementation_help.hpp>
-#include <boost/range/detail/size_type.hpp>
-#include <boost/range/detail/common.hpp>
-#include <iterator>
-
-namespace boost 
-{
-    namespace range_detail
-    {
-        template< typename T >
-        struct range_size_;
-
-        //////////////////////////////////////////////////////////////////////
-        // default
-        //////////////////////////////////////////////////////////////////////
-        
-        template<>
-        struct range_size_<std_container_>
-        {
-            template< typename C >
-            static BOOST_RANGE_DEDUCED_TYPENAME C::size_type fun( const C& c )
-            {
-                return c.size();
-            };
-        };
-                    
-        //////////////////////////////////////////////////////////////////////
-        // pair
-        //////////////////////////////////////////////////////////////////////
-        
-        template<>
-        struct range_size_<std_pair_>
-        {
-            template< typename P >
-            static BOOST_RANGE_DEDUCED_TYPENAME range_size<P>::type 
-            fun( const P& p )
-            {
-                return std::distance( p.first, p.second );
-            }
-        };
- 
-        //////////////////////////////////////////////////////////////////////
-        // array
-        //////////////////////////////////////////////////////////////////////
-        
-        template<>
-        struct range_size_<array_>
-        {
-            template<typename T>
-            static std::size_t fun(T& t)
-            {
-                return remove_extent<T>::size;
-            }
-        };
-        
-        template<>
-        struct range_size_<char_array_>
-        {
-            template< typename T, std::size_t sz >
-            static std::size_t fun( T BOOST_RANGE_ARRAY_REF()[sz] )
-            {
-                return boost::range_detail::array_size( boost_range_array );
-            }
-        };
-        
-        template<>
-        struct range_size_<wchar_t_array_>
-        {
-            template< typename T, std::size_t sz >
-            static std::size_t fun( T BOOST_RANGE_ARRAY_REF()[sz] )
-            {
-                return boost::range_detail::array_size( boost_range_array );
-            }
-        };
-
-        //////////////////////////////////////////////////////////////////////
-        // string
-        //////////////////////////////////////////////////////////////////////
-
-        template<>
-        struct range_size_<char_ptr_>
-        {
-            static std::size_t fun( const char* s )
-            {
-                return boost::range_detail::str_size( s );
-            }
-        };
-
-        template<>
-        struct range_size_<const_char_ptr_>
-        {
-            static std::size_t fun( const char* s )
-            {
-                return boost::range_detail::str_size( s );
-            }
-        };
-        
-        template<>
-        struct range_size_<wchar_t_ptr_>
-        {
-            static std::size_t fun( const wchar_t* s )
-            {
-                return boost::range_detail::str_size( s );
-            }
-        };
-
-        template<>
-        struct range_size_<const_wchar_t_ptr_>
-        {
-            static std::size_t fun( const wchar_t* s )
-            {
-                return boost::range_detail::str_size( s );
-            }
-        };
-  
-    } // namespace 'range_detail'
-    
-
-    template< typename C >
-    BOOST_RANGE_DEDUCED_TYPENAME range_size<C>::type 
-    size( const C& c )
-    {
-        return range_detail::range_size_<  BOOST_RANGE_DEDUCED_TYPENAME range_detail::range<C>::type >::fun( c );
-    }
-    
-} // namespace 'boost'
-
-#endif
diff --git a/include/boost/range/mutable_iterator.hpp b/include/boost/range/mutable_iterator.hpp
index ffa2e66..f1bd1a1 100644
--- a/include/boost/range/mutable_iterator.hpp
+++ b/include/boost/range/mutable_iterator.hpp
@@ -17,9 +17,6 @@
 
 #include <boost/range/config.hpp>
 
-#ifdef BOOST_NO_TEMPLATE_PARTIAL_SPECIALIZATION
-#include <boost/range/detail/iterator.hpp>
-#else
 
 #include <boost/range/detail/extract_optional_type.hpp>
 #include <boost/iterator/iterator_traits.hpp>
@@ -62,6 +59,5 @@ namespace boost
 
 } // namespace boost
 
-#endif // BOOST_NO_TEMPLATE_PARTIAL_SPECIALIZATION
 
 #endif

From 2d78bde327bdea1613fd4f33de74ae38b2f228e9 Mon Sep 17 00:00:00 2001
From: Stephen Kelly <steveire@gmail.com>
Date: Fri, 11 Oct 2013 23:17:48 +0000
Subject: [PATCH 70/73] Remove BOOST_NO_TEMPLATE_PARTIAL_SPECIALIZATION

Process #ifndef...#else...#endif blocks.

[SVN r86245]
---
 .../range/detail/collection_traits_detail.hpp | 120 ------------------
 1 file changed, 120 deletions(-)

diff --git a/include/boost/range/detail/collection_traits_detail.hpp b/include/boost/range/detail/collection_traits_detail.hpp
index 93652b5..1f2b77c 100644
--- a/include/boost/range/detail/collection_traits_detail.hpp
+++ b/include/boost/range/detail/collection_traits_detail.hpp
@@ -185,7 +185,6 @@ namespace boost {
 
 // Array container traits ---------------------------------------------------------------
 
-#ifndef BOOST_NO_TEMPLATE_PARTIAL_SPECIALIZATION
             // array traits ( partial specialization )
             template< typename T >
             struct array_traits;
@@ -204,125 +203,6 @@ namespace boost {
                 BOOST_STATIC_CONSTANT( size_type, array_size = sz );
             };
 
-#else // BOOST_NO_TEMPLATE_PARTIAL_SPECIALIZATION
-
-            // array traits ( no partial specialization )
-            /*
-                without partial specialization we are able to
-                provide support only for a limited number of
-                types. Currently the primitive numeric types 
-                are supported
-            */
-            template< typename T, typename BaseT >
-            struct array_traits_impl
-            {
-                typedef BaseT value_type;
-                typedef BaseT* iterator;
-                typedef const BaseT* const_iterator;
-                typedef std::size_t size_type;
-                typedef std::ptrdiff_t difference_type;
-
-                // size of the array
-                BOOST_STATIC_CONSTANT( size_type, array_size = sizeof(T)/sizeof(BaseT) );
-            };
-            
-            template< typename T, typename BaseT >
-            struct array_traits_impl_selector
-            {
-                typedef array_traits_impl<T,BaseT> type;
-            };
-
-            struct array_traits_void
-            {
-                typedef void type;
-            };
-
-            template< typename T, typename BaseT >
-            struct array_traits_cv_selector
-            {
-                typedef BOOST_STRING_TYPENAME 
-                    ::boost::mpl::eval_if< 
-                        ::boost::is_convertible<T,BaseT*>,
-                        array_traits_impl_selector<T,BaseT>,
-                        ::boost::mpl::eval_if< 
-                            ::boost::is_convertible<T,const BaseT*>,
-                                array_traits_impl_selector<T, const BaseT>,
-                                ::boost::mpl::eval_if< 
-                                    ::boost::is_convertible<T, volatile BaseT*>,
-                                    array_traits_impl_selector<T, volatile BaseT>,
-                                    array_traits_impl_selector<T, const volatile BaseT>
-                                >
-                            >
-                    >::type type;
-            };
-
-            template< typename T >
-            struct array_traits_select
-            {
-                template< typename T1, typename T2 >
-                struct apply
-                {
-                    typedef BOOST_STRING_TYPENAME
-                        ::boost::mpl::eval_if< 
-                            ::boost::is_convertible<T,const volatile T2*>,
-                            array_traits_cv_selector<T,T2>,
-                            ::boost::mpl::identity<T1> >::type type;
-                };
-            };
-
-            template< typename T >
-            struct array_traits_selector 
-            {
-            private:
-                // supported array base types
-#ifndef BOOST_NO_INTRINSIC_WCHAR_T
-                typedef BOOST_STRING_TYPENAME
-                    ::boost::mpl::vector10<
-                        wchar_t,
-#else // BOOST_NO_INTRINSIC_WCHAR_T
-                typedef BOOST_STRING_TYPENAME
-                    ::boost::mpl::vector9<
-#endif // BOOST_NO_INTRINSIC_WCHAR_T
-                        char,
-                        signed char,
-                        unsigned char,
-                        signed short,
-                        unsigned short,
-                        signed int,
-                        unsigned int,
-                        signed long,
-                        unsigned long
-                >::type array_base_types;
-
-            public:
-                typedef BOOST_STRING_TYPENAME
-                    ::boost::mpl::fold<
-                        array_base_types,
-                        ::boost::algorithm::detail::array_traits_void,
-                        ::boost::algorithm::detail::array_traits_select<T> >::type type;
-            };
-
-            template< typename T >
-            struct array_traits
-            {
-                typedef BOOST_STRING_TYPENAME
-                    array_traits_selector<T>::type traits_type;
-
-                typedef BOOST_STRING_TYPENAME
-                    traits_type::value_type value_type;
-                typedef BOOST_STRING_TYPENAME
-                    traits_type::iterator iterator;
-                typedef BOOST_STRING_TYPENAME
-                    traits_type::const_iterator const_iterator;
-                typedef BOOST_STRING_TYPENAME
-                    traits_type::size_type size_type;
-                typedef BOOST_STRING_TYPENAME
-                    traits_type::difference_type difference_type;
-
-                BOOST_STATIC_CONSTANT( size_type, array_size = traits_type::array_size );
-            };
-
-#endif // BOOST_NO_TEMPLATE_PARTIAL_SPECIALIZATION
             
             // array length resolving
             /*

From 87ecc0caee5e1983faa628f8e50921e21e8c4834 Mon Sep 17 00:00:00 2001
From: Stephen Kelly <steveire@gmail.com>
Date: Fri, 11 Oct 2013 23:19:17 +0000
Subject: [PATCH 71/73] Remove BOOST_NO_TEMPLATE_PARTIAL_SPECIALIZATION

Process #ifdef...#else...#endif blocks.

[SVN r86246]
---
 include/boost/range/size_type.hpp | 4 ----
 1 file changed, 4 deletions(-)

diff --git a/include/boost/range/size_type.hpp b/include/boost/range/size_type.hpp
index 1be647d..ffdc3ac 100644
--- a/include/boost/range/size_type.hpp
+++ b/include/boost/range/size_type.hpp
@@ -18,9 +18,6 @@
 #include <boost/range/config.hpp>
 #include <boost/range/difference_type.hpp>
 #include <boost/range/concepts.hpp>
-#ifdef BOOST_NO_TEMPLATE_PARTIAL_SPECIALIZATION
-#include <boost/range/detail/size_type.hpp>
-#else
 
 #include <boost/utility/enable_if.hpp>
 #include <boost/type_traits/make_unsigned.hpp>
@@ -96,7 +93,6 @@ namespace boost
 
 } // namespace boost
 
-#endif // BOOST_NO_TEMPLATE_PARTIAL_SPECIALIZATION
 
 
 #endif

From 9928939724d5c006cd24653c867cc6f71b7c3f4b Mon Sep 17 00:00:00 2001
From: Stephen Kelly <steveire@gmail.com>
Date: Fri, 11 Oct 2013 23:22:36 +0000
Subject: [PATCH 72/73] Remove remaining occurances of
 BOOST_NO_TEMPLATE_PARTIAL_SPECIALIZATION

These evaded scripting.

[SVN r86249]
---
 include/boost/range/iterator.hpp   | 2 --
 include/boost/range/value_type.hpp | 4 ----
 2 files changed, 6 deletions(-)

diff --git a/include/boost/range/iterator.hpp b/include/boost/range/iterator.hpp
index 9d94d43..4ba9122 100644
--- a/include/boost/range/iterator.hpp
+++ b/include/boost/range/iterator.hpp
@@ -67,6 +67,4 @@ namespace boost
 
 } // namespace boost
 
-//#endif // BOOST_NO_TEMPLATE_PARTIAL_SPECIALIZATION
-
 #endif
diff --git a/include/boost/range/value_type.hpp b/include/boost/range/value_type.hpp
index 4a67d05..5a3187e 100644
--- a/include/boost/range/value_type.hpp
+++ b/include/boost/range/value_type.hpp
@@ -18,10 +18,6 @@
 #include <boost/range/config.hpp>
 #include <boost/range/iterator.hpp>
 
-//#ifdef BOOST_NO_TEMPLATE_PARTIAL_SPECIALIZATION
-//#include <boost/range/detail/value_type.hpp>
-//#else
-
 #include <boost/iterator/iterator_traits.hpp>
 
 namespace boost

From fbf91ce2da176c991b0fa7555c2717c03ebd28f6 Mon Sep 17 00:00:00 2001
From: Eric Niebler <eniebler@boost.org>
Date: Tue, 22 Jul 2014 09:19:52 -0700
Subject: [PATCH 73/73] add missing inline keyword

---
 include/boost/range/adaptor/formatted.hpp | 2 +-
 1 file changed, 1 insertion(+), 1 deletion(-)

diff --git a/include/boost/range/adaptor/formatted.hpp b/include/boost/range/adaptor/formatted.hpp
index dabfee9..f31f1bc 100644
--- a/include/boost/range/adaptor/formatted.hpp
+++ b/include/boost/range/adaptor/formatted.hpp
@@ -151,7 +151,7 @@ formatted(const Sep& sep)
     return range_detail::formatted_holder<Sep, char, char>(sep, '{', '}');
 }
 
-range_detail::formatted_holder<char, char, char>
+inline range_detail::formatted_holder<char, char, char>
 formatted()
 {
     return range_detail::formatted_holder<char, char, char>(',', '{', '}');