From 9df97a85973586234ff5fd287571cd408298f625 Mon Sep 17 00:00:00 2001
From: Daniel James <daniel@calamity.org.uk>
Date: Sun, 15 Feb 2009 19:32:04 +0000
Subject: [PATCH] Use the new 'boost:' links for the hash, unordered and
 quickbook documentation.

[SVN r51262]
---
 hash/doc/intro.qbk       | 6 +++---
 hash/doc/portability.qbk | 2 +-
 hash/doc/tutorial.qbk    | 8 ++++----
 3 files changed, 8 insertions(+), 8 deletions(-)

diff --git a/hash/doc/intro.qbk b/hash/doc/intro.qbk
index bba5de3..b027719 100644
--- a/hash/doc/intro.qbk
+++ b/hash/doc/intro.qbk
@@ -13,11 +13,11 @@
     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]]
diff --git a/hash/doc/portability.qbk b/hash/doc/portability.qbk
index e9100ce..fabb298 100644
--- a/hash/doc/portability.qbk
+++ b/hash/doc/portability.qbk
@@ -88,7 +88,7 @@ boost namespace:
     }
 
 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]
 
diff --git a/hash/doc/tutorial.qbk b/hash/doc/tutorial.qbk
index eaf9a95..b2f79f5 100644
--- a/hash/doc/tutorial.qbk
+++ b/hash/doc/tutorial.qbk
@@ -3,7 +3,7 @@
  / 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,9 +110,9 @@ And you can now use [classref boost::hash] with book:
     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,7 +170,7 @@ of point, it can be repeatedly called for any number of elements. It calls
 [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