Ticket #1166: boost-links-2.patch

libs/functional/hash/doc/intro.qbk

@@ -13 +13 @@
     TR1]]
 [def __unordered__ [link unordered Boost.Unordered]]
 [def __intrusive__ [link intrusive.unordered_set_unordered_multiset Boost.Intrusive]]
-[def __multi-index__ [@../../libs/multi_index/doc/index.html
+[def __multi-index__ [@boost:/libs/multi_index/doc/index.html
     Boost Multi-Index Containers Library]]
-[def __multi-index-short__ [@../../libs/multi_index/doc/index.html
+[def __multi-index-short__ [@boost:/libs/multi_index/doc/index.html
     Boost.MultiIndex]]
-[def __bimap__ [@../../libs/bimap/index.html Boost.Bimap]]
+[def __bimap__ [@boost:/libs/bimap/index.html Boost.Bimap]]
 [def __issues__
     [@http://www.open-std.org/jtc1/sc22/wg21/docs/papers/2005/n1837.pdf
     Library Extension Technical Report Issues List]]

libs/functional/hash/doc/portability.qbk

@@ -88 +88 @@
     }
 
 Full code for this example is at
-[@../../libs/functional/hash/examples/portable.cpp /libs/functional/hash/examples/portable.cpp].
+[@boost:/libs/functional/hash/examples/portable.cpp /libs/functional/hash/examples/portable.cpp].
 
 [h2 Other Issues]
 

libs/functional/hash/doc/tutorial.qbk

@@ -3 +3 @@
  / 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) ]
 
-[def __multi-index-short__ [@../../libs/multi_index/doc/index.html
+[def __multi-index-short__ [@boost:/libs/multi_index/doc/index.html
     Boost.MultiIndex]]
 
 [section:tutorial Tutorial]
@@ -110 +110 @@
     assert(books.find(dandelion) == books.end());
 
 The full example can be found in:
-[@../../libs/functional/hash/examples/books.cpp /libs/functional/hash/examples/books.hpp]
+[@boost:/libs/functional/hash/examples/books.cpp /libs/functional/hash/examples/books.hpp]
 and
-[@../../libs/functional/hash/examples/books.cpp /libs/functional/hash/examples/books.cpp].
+[@boost:/libs/functional/hash/examples/books.cpp /libs/functional/hash/examples/books.cpp].
 
 [tip
 When writing a hash function, first look at how the equality function works.
@@ -170 +170 @@
 [funcref boost::hash_value hash_value] on the supplied element, and combines it with the seed.
 
 Full code for this example is at
-[@../../libs/functional/hash/examples/point.cpp /libs/functional/hash/examples/point.cpp].
+[@boost:/libs/functional/hash/examples/point.cpp /libs/functional/hash/examples/point.cpp].
 
 [note
 When using [funcref boost::hash_combine] the order of the

libs/unordered/doc/changes.qbk

@@ -44 +44 @@
 
 [h2 Boost 1.38.0]
 
-* Use [@../../libs/utility/swap.html `boost::swap`].
+* Use [@boost:/libs/utility/swap.html `boost::swap`].
 * [@https://svn.boost.org/trac/boost/ticket/2237 Ticket 2237]:
   Document that the equality and inequality operators are undefined for two
   objects if their equality predicates aren't equivalent. Thanks to Daniel
@@ -53 +53 @@
   Use a larger prime number list. Thanks to Thorsten Ottosen and Hervé
   Brönnimann.
 * Use
-  [@../../libs/type_traits/doc/html/boost_typetraits/category/alignment.html
+  [@boost:/libs/type_traits/doc/html/boost_typetraits/category/alignment.html
   aligned storage] to store the types. This changes the way the allocator is
   used to construct nodes. It used to construct the node with two calls to
   the allocator's `construct` method - once for the pointers and once for the

libs/unordered/doc/hash_equality.qbk

@@ -23 +23 @@
 [import src_code/dictionary.cpp]
 [case_sensitive_dictionary_fnv]
 
-There is an [@../../libs/unordered/examples/fnv1.hpp implementation
+There is an [@boost:/libs/unordered/examples/fnv1.hpp implementation
 of FNV-1] in the examples directory.
 
 If you wish to use a different equality function,
@@ -38 +38 @@
 [case_insensitive_dictionary]
 
 This is a simplified version of the example at
-[@../../libs/unordered/examples/case_insensitive.hpp /libs/unordered/examples/case_insensitive.hpp]
+[@boost:/libs/unordered/examples/case_insensitive.hpp /libs/unordered/examples/case_insensitive.hpp]
 which supports other locales and string types.
 
 [caution

tools/quickbook/doc/quickbook.qbk

@@ -84 +84 @@
 documentation, is autogenerated by QuickBook. These files were generated from
 one master:
 
-[:[@../../tools/quickbook/doc/quickbook.qbk quickbook.qbk]]
+[:[@boost:/tools/quickbook/doc/quickbook.qbk quickbook.qbk]]
 
 Originally named QuickDoc, this funky tool that never dies, evolved into a
 funkier tool thanks to Eric Niebler who resurrected the project making it
@@ -1662 +1662 @@
 ''']
 
 collects specially marked-up code snippets from
-[@../../tools/quickbook/test/stub.cpp stub.cpp]
+[@boost:/tools/quickbook/test/stub.cpp stub.cpp]
 and places them in your QuickBook file as virtual templates. Each of the
 specially marked-up code snippets has a name (e.g. `foo` and `bar` in the
 example above). This shall be the template identifier for that particular code
@@ -1681 +1681 @@
 
 [heading Code Snippet Markup]
 
-Note how the code snippets in [@../../tools/quickbook/test/stub.cpp stub.cpp]
+Note how the code snippets in [@boost:/tools/quickbook/test/stub.cpp stub.cpp]
 get marked up. We use distinguishable comments following the form:
 
     //[id
@@ -1764 +1764 @@
 
 [class_]
 
-See the actual code here: [@../../tools/quickbook/test/stub.cpp]
+See the actual code here: [@boost:/tools/quickbook/test/stub.cpp]
 
 [endsect]