Use root links in quickbook.

[SVN r45364]

doc/.cvsignore

@@ -1 +0,0 @@
-GNUmakefile

doc/index.html

@@ -40,7 +40,7 @@ Lab</a>, <a class="reference external" href="http://www.styleadvisor.com">Zephyr
 <col class="field-body" />
 <tbody valign="top">
 <tr class="field"><th class="field-name">Abstract:</th><td class="field-body">The Boost Iterator Library contains two parts. The first
-is a system of <a class="reference external" href="../../../more/generic_programming.html#concept">concepts</a> which extend the C++ standard
+is a system of <a class="reference external" href="http://www.boost.org/community/generic_programming.html#concept">concepts</a> which extend the C++ standard
 iterator requirements. The second is a framework of
 components for building iterators based on these
 extended concepts and includes several useful iterator
@@ -179,7 +179,7 @@ implement iterators, you probably wrote a <tt class="docutils literal"><span cla
 captures the core operations of your iterator.  In the new library
 design, you'll move those same core operations into the body of the
 iterator class itself.  If you were writing a family of iterators,
-you probably wrote a <a class="reference external" href="../../../more/generic_programming.html#type_generator">type generator</a> to build the
+you probably wrote a <a class="reference external" href="http://www.boost.org/community/generic_programming.html#type_generator">type generator</a> to build the
 <tt class="docutils literal"><span class="pre">iterator_adaptor</span></tt> specialization you needed; in the new library
 design you don't need a type generator (though may want to keep it
 around as a compatibility aid for older code) because, due to the

doc/index.rst

@@ -43,7 +43,7 @@ __ ../../../index.htm
            The components of the Boost Iterator Library replace the
            older Boost Iterator Adaptor Library.
 
-.. _concepts: ../../../more/generic_programming.html#concept
+.. _concepts: http://www.boost.org/community/generic_programming.html#concept
 
 .. contents:: **Table of Contents**
 
@@ -271,7 +271,7 @@ over how your iterator works: you can add additional constructors,
 or even override the iterator functionality provided by the
 library.
 
-.. _`type generator`: ../../../more/generic_programming.html#type_generator
+.. _`type generator`: http://www.boost.org/community/generic_programming.html#type_generator
 
 If you're looking for the old ``projection_iterator`` component,
 its functionality has been merged into ``transform_iterator``: as

doc/iterator_facade.html

@@ -866,7 +866,7 @@ operator -(iterator_facade<Dr1,V1,TC1,R1,D1> const& lhs,
 <p>In this section we'll walk through the implementation of a few
 iterators using <tt class="docutils literal"><span class="pre">iterator_facade</span></tt>, based around the simple
 example of a linked list of polymorphic objects.  This example was
-inspired by a <a class="reference external" href="http://thread.gmane.org/gmane.comp.lib.boost.user/5100">posting</a> by Keith Macdonald on the <a class="reference external" href="../../../more/mailing_lists.htm#users">Boost-Users</a>
+inspired by a <a class="reference external" href="http://thread.gmane.org/gmane.comp.lib.boost.user/5100">posting</a> by Keith Macdonald on the <a class="reference external" href="http://www.boost.org/community/groups.html#users">Boost-Users</a>
 mailing list.</p>
 <div class="section" id="the-problem">
 <h2><a class="toc-backref" href="#id32">The Problem</a></h2>

doc/iterator_facade_tutorial.rst

@@ -8,7 +8,7 @@ example of a linked list of polymorphic objects.  This example was
 inspired by a `posting`__ by Keith Macdonald on the `Boost-Users`_
 mailing list.
 
-.. _`Boost-Users`: ../../../more/mailing_lists.htm#users
+.. _`Boost-Users`: http://www.boost.org/community/groups.html#users
 
 __ http://thread.gmane.org/gmane.comp.lib.boost.user/5100
 

doc/quickbook/adaptor.qbk

@@ -288,7 +288,7 @@ Metrowerks CodeWarrior versions prior to 9.0]
 
 You can see an example program that exercises this version of the
 node iterators 
-[@../example/node_iterator3.cpp `here`].
+[@/libs/iterator/example/node_iterator3.cpp `here`].
 
 
 In the case of `node_iter`, it's not very compelling to pass

doc/quickbook/counting_iterator.qbk

@@ -39,7 +39,7 @@ The output is:
     indirectly printing out the numbers from 0 to 7
     0 1 2 3 4 5 6 
 
-The source code for this example can be found [@../example/counting_iterator_example.cpp here].
+The source code for this example can be found [@/libs/iterator/example/counting_iterator_example.cpp here].
 
 [h2 Reference]
 

doc/quickbook/facade_tutorial.qbk

@@ -7,7 +7,7 @@ example of a linked list of polymorphic objects.  This example was
 inspired by a 
 [@http://thread.gmane.org/gmane.comp.lib.boost.user/5100 `posting`]
 by Keith Macdonald on the 
-[@../../../more/mailing_lists.htm#users `Boost-Users`]
+[@http://www.boost.org/community/groups.html#users `Boost-Users`]
 mailing list.
 
 
@@ -255,7 +255,7 @@ make them private and grant friendship to
 
 Voila; a complete and conforming readable, forward-traversal
 iterator!  For a working example of its use, see 
-[@../example/node_iterator1.cpp `this program`].
+[@/libs/iterator/example/node_iterator1.cpp `this program`].
 
 __ ../example/node_iterator1.cpp
 
@@ -432,7 +432,7 @@ __ ../example/node_iterator2.hpp
 
 You can see an example program which exercises our interoperable
 iterators 
-[@../example/node_iterator2.cpp `here`].
+[@/libs/iterator/example/node_iterator2.cpp `here`].
 
 
 [h2 Telling the Truth]

doc/quickbook/filter_iterator.qbk

@@ -75,7 +75,7 @@ The output is:
     0 -1 4 5 8 
 
 
-The source code for this example can be found [@../example/filter_iterator_example.cpp here].
+The source code for this example can be found [@/libs/iterator/example/filter_iterator_example.cpp here].
 
 [h2 Reference]
 

doc/quickbook/indirect_iterator.qbk

@@ -73,7 +73,7 @@ The output is:
 
 
 The source code for this example can be found 
-[@../example/indirect_iterator_example.cpp here].
+[@/libs/iterator/example/indirect_iterator_example.cpp here].
 
 
 [h2 Reference]

doc/quickbook/iterator.qbk

@@ -28,11 +28,11 @@
 
 [/  Links   ]
 
-[def _iterator_           [@../../libs/iterator/doc/index.html Boost.Iterator]]
+[def _iterator_           [@/libs/iterator/doc/index.html Boost.Iterator]]
 
 [section:intro Introduction]
 
-[def _concepts_ [@../../more/generic_programming.html#concept concepts]]
+[def _concepts_ [@http://www.boost.org/community/generic_programming.html#concept concepts]]
 
 The Boost Iterator Library contains two parts. The first
 is a system of _concepts_ which extend the C++ standard
@@ -112,7 +112,7 @@ templates.
 [def _transform_   [@./transform_iterator.html        `transform_iterator`]]
 [def _zip_         [@./zip_iterator.html              `zip_iterator`]]
 
-[def _shared_ptr_  [@../../smart_ptr/shared_ptr.htm `shared_ptr`]]
+[def _shared_ptr_  [@/libs/smart_ptr/shared_ptr.htm `shared_ptr`]]
 
 * _counting_: an iterator over a sequence of consecutive values.
   Implements a "lazy sequence"
@@ -152,7 +152,7 @@ templates.
 [def _pointee_          [@./pointee.html         `pointee.hpp`]]
 [def _iterator_traits_  [@./iterator_traits.html `iterator_traits.hpp`]]
 [def _interoperable_    [@./interoperable.html   `interoperable.hpp`]]
-[def _MPL_              [@../../mpl/doc/index.html   [*MPL]]]
+[def _MPL_              [@/libs/mpl/doc/index.html   [*MPL]]]
 
 * _pointee_: Provides the capability to deduce the referent types
   of pointers, smart pointers and iterators in generic code.  Used
@@ -203,7 +203,7 @@ templates.
 
 [section:upgrading Upgrading from the old Boost Iterator Adaptor Library]
 
-[def _type_generator_ [@../../more/generic_programming.html#type_generator type generator]]
+[def _type_generator_ [@http://www.boost.org/community/generic_programming.html#type_generator type generator]]
 
 If you have been using the old Boost Iterator Adaptor library to
 implement iterators, you probably wrote a `Policies` class which

doc/quickbook/permutation_iterator.qbk

@@ -84,7 +84,7 @@ The output is:
 
 
 The source code for this example can be found
-[@../example/permutation_iter_example.cpp here].
+[@/libs/iterator/example/permutation_iter_example.cpp here].
 
 [h2 Reference]
 

doc/quickbook/reverse_iterator.qbk

@@ -41,7 +41,7 @@ The output is:
 
 
 The source code for this example can be found
-[@../example/reverse_iterator_example.cpp here].
+[@/libs/iterator/example/reverse_iterator_example.cpp here].
 
 [h2 Reference]
 

doc/quickbook/shared_container_iterator.qbk

@@ -1,7 +1,7 @@
 
 [section:shared_container Shared Container Iterator]
 
-Defined in header [@../../../boost/shared_container_iterator.hpp `boost/shared_container_iterator.hpp`].
+Defined in header [@/boost/shared_container_iterator.hpp `boost/shared_container_iterator.hpp`].
 
 The purpose of the shared container iterator is to attach the lifetime
 of a container to the lifetime of its iterators. In other words, the
@@ -56,7 +56,7 @@ original shared pointer `ints` ceases to exist after `set_range()`
 returns, the `shared_counter_iterator` objects maintain references to
 the underlying vector and thereby extend the container's lifetime.
 
-[@../../../libs/utility/shared_iterator_example1.cpp `shared_iterator_example1.cpp`]:
+[@/libs/utility/shared_iterator_example1.cpp `shared_iterator_example1.cpp`]:
 
   #include "shared_container_iterator.hpp"
   #include "boost/shared_ptr.hpp"
@@ -139,7 +139,7 @@ explicitly specifying its type.
 This example, similar to the previous, 
 uses `make_shared_container_iterator()` to create the iterators.
 
-[@../../../libs/utility/shared_iterator_example2.cpp `shared_iterator_example2.cpp`]:
+[@/libs/utility/shared_iterator_example2.cpp `shared_iterator_example2.cpp`]:
 
   #include "shared_container_iterator.hpp"
   #include "boost/shared_ptr.hpp"
@@ -200,7 +200,7 @@ named. The output from this example is the same as the previous.
 
 In the following example, a range of values is returned as a pair of shared_container_iterator objects.
 
-[@../../../libs/utility/shared_iterator_example3.cpp `shared_iterator_example3.cpp`]:
+[@/libs/utility/shared_iterator_example3.cpp `shared_iterator_example3.cpp`]:
 
   #include "shared_container_iterator.hpp"
   #include "boost/shared_ptr.hpp"

doc/quickbook/traits.qbk

@@ -55,12 +55,12 @@ Header `<boost/iterator/iterator_traits.hpp>`:
 [h2 Broken Compiler Notes]
 
 Because of workarounds in Boost, you may find that these
-[@../../mpl/doc/index.html#metafunctions metafunctions] actually work better than the facilities provided by
+[@/libs/mpl/doc/index.html#metafunctions metafunctions] actually work better than the facilities provided by
 your compiler's standard library.
 
 On compilers that don't support partial specialization, such as
 Microsoft Visual C++ 6.0 or 7.0, you may need to manually invoke
-[@../../type_traits/index.html#transformations BOOST_BROKEN_COMPILER_TYPE_TRAITS_SPECIALIZATION] on the
+[@/libs/type_traits/index.html#transformations BOOST_BROKEN_COMPILER_TYPE_TRAITS_SPECIALIZATION] on the
 `value_type` of pointers that are passed to these metafunctions.
 
 Because of bugs in the implementation of GCC-2.9x, the name of

doc/quickbook/transform_iterator.qbk

@@ -44,7 +44,7 @@ The output is:
 
 
 The source code for this example can be found 
-[@../example/transform_iterator_example.cpp here].
+[@/libs/iterator/example/transform_iterator_example.cpp here].
 
 [h2 Reference]
 

doc/quickbook/utilities.qbk

@@ -122,7 +122,7 @@ template.
 
 For an introduction to using concept checking classes, see
 the documentation for the 
-[@../../concept_check/index.html `boost::concept_check`] library.
+[@/libs/concept_check/index.html `boost::concept_check`] library.
 
 
 [h2 Reference]

include/boost/iterator/detail/config_def.hpp

@@ -49,7 +49,9 @@
 #if BOOST_WORKAROUND(BOOST_MSVC, <= 1300)                                       \
     || BOOST_WORKAROUND(__BORLANDC__, BOOST_TESTED_AT(0x531))                   \
     || (BOOST_WORKAROUND(BOOST_INTEL_CXX_VERSION, <= 700) && defined(_MSC_VER)) \
-    || BOOST_WORKAROUND(__DECCXX_VER, BOOST_TESTED_AT(60590042))
+    || BOOST_WORKAROUND(__DECCXX_VER, BOOST_TESTED_AT(60590042))                \
+    || BOOST_WORKAROUND(__SUNPRO_CC, BOOST_TESTED_AT(0x590))
+    
 # define BOOST_NO_LVALUE_RETURN_DETECTION
 
 # if 0 // test code

include/boost/iterator/iterator_facade.hpp

@@ -433,26 +433,26 @@ namespace boost
 # ifdef BOOST_NO_STRICT_ITERATOR_INTEROPERABILITY
 #  define BOOST_ITERATOR_FACADE_INTEROP_HEAD(prefix, op, result_type)       \
     template <                                                              \
-        class Derived1, class V1, class TC1, class R1, class D1             \
-      , class Derived2, class V2, class TC2, class R2, class D2             \
+        class Derived1, class V1, class TC1, class Reference1, class Difference1 \
+      , class Derived2, class V2, class TC2, class Reference2, class Difference2 \
     >                                                                       \
     prefix typename mpl::apply2<result_type,Derived1,Derived2>::type \
     operator op(                                                            \
-        iterator_facade<Derived1, V1, TC1, R1, D1> const& lhs               \
-      , iterator_facade<Derived2, V2, TC2, R2, D2> const& rhs)
+        iterator_facade<Derived1, V1, TC1, Reference1, Difference1> const& lhs   \
+      , iterator_facade<Derived2, V2, TC2, Reference2, Difference2> const& rhs)
 # else 
 #  define BOOST_ITERATOR_FACADE_INTEROP_HEAD(prefix, op, result_type)   \
     template <                                                          \
-        class Derived1, class V1, class TC1, class R1, class D1         \
-      , class Derived2, class V2, class TC2, class R2, class D2         \
+        class Derived1, class V1, class TC1, class Reference1, class Difference1 \
+      , class Derived2, class V2, class TC2, class Reference2, class Difference2 \
     >                                                                   \
     prefix typename boost::detail::enable_if_interoperable<             \
         Derived1, Derived2                                              \
       , typename mpl::apply2<result_type,Derived1,Derived2>::type       \
     >::type                                                             \
     operator op(                                                        \
-        iterator_facade<Derived1, V1, TC1, R1, D1> const& lhs           \
-      , iterator_facade<Derived2, V2, TC2, R2, D2> const& rhs)
+        iterator_facade<Derived1, V1, TC1, Reference1, Difference1> const& lhs   \
+      , iterator_facade<Derived2, V2, TC2, Reference2, Difference2> const& rhs)
 # endif 
 
 #  define BOOST_ITERATOR_FACADE_PLUS_HEAD(prefix,args)              \

include/boost/iterator_adaptors.hpp

@@ -1,6 +1,9 @@
 // Copyright David Abrahams 2004. 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)
+
+//  See www.boost.org/libs/iterator for documentation.
+
 #ifndef ITERATOR_ADAPTORS_DWA2004725_HPP
 # define ITERATOR_ADAPTORS_DWA2004725_HPP