boostorg/functional
1
0
Fork 1
mirror of https://github.com/boostorg/functional.git synced 2025-08-03 22:44:31 +02:00
Code Issues Packages Projects Releases Wiki Activity

Use the new 'boost:' links for the hash, unordered and quickbook documentation.

Browse Source 
[SVN r51262]
This commit is contained in:
Daniel James
2009-02-15 19:32:04 +00:00
parent 650b8b1220
commit 9df97a8597
3 changed files with 8 additions and 8 deletions
Download Patch File Download Diff File Expand all files Collapse all files

6
hash/doc/intro.qbk
View File

@@ -13,11 +13,11 @@
TR1]] TR1]]
[def __unordered__ [link unordered Boost.Unordered]] [def __unordered__ [link unordered Boost.Unordered]]
[def __intrusive__ [link intrusive.unordered_set_unordered_multiset Boost.Intrusive]] [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]] 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]] Boost.MultiIndex]]
[def __bimap__ [@../../libs/bimap/index.html Boost.Bimap]] [def __bimap__ [@boost:/libs/bimap/index.html Boost.Bimap]]
[def __issues__ [def __issues__
[@http://www.open-std.org/jtc1/sc22/wg21/docs/papers/2005/n1837.pdf [@http://www.open-std.org/jtc1/sc22/wg21/docs/papers/2005/n1837.pdf
Library Extension Technical Report Issues List]] Library Extension Technical Report Issues List]]

2
hash/doc/portability.qbk
View File

@@ -88,7 +88,7 @@ boost namespace:
} }
Full code for this example is at 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] [h2 Other Issues]

8
hash/doc/tutorial.qbk
View File

@@ -3,7 +3,7 @@
/ Distributed under the Boost Software License, Version 1.0. (See accompanying / 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) ] / 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]] Boost.MultiIndex]]
[section:tutorial Tutorial] [section:tutorial Tutorial]
@@ -110,9 +110,9 @@ And you can now use [classref boost::hash] with book:
assert(books.find(dandelion) == books.end()); assert(books.find(dandelion) == books.end());
The full example can be found in: 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 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 [tip
When writing a hash function, first look at how the equality function works. 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. [funcref boost::hash_value hash_value] on the supplied element, and combines it with the seed.
Full code for this example is at 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 [note
When using [funcref boost::hash_combine] the order of the When using [funcref boost::hash_combine] the order of the