[Boost-commit] svn:boost r42523 - branches/unordered/trunk/libs/unordered/doc

From: daniel_james_at_[hidden]
Date: 2008-01-06 08:03:03

Author: danieljames
Date: 2008-01-06 08:03:03 EST (Sun, 06 Jan 2008)
New Revision: 42523
URL: http://svn.boost.org/trac/boost/changeset/42523

Log:
Link to the hash function and equality predicates section from the data section.
Text files modified: 
   branches/unordered/trunk/libs/unordered/doc/buckets.qbk |    10 +++++++---                              
   1 files changed, 7 insertions(+), 3 deletions(-)

Modified: branches/unordered/trunk/libs/unordered/doc/buckets.qbk
==============================================================================
--- branches/unordered/trunk/libs/unordered/doc/buckets.qbk	(original)
+++ branches/unordered/trunk/libs/unordered/doc/buckets.qbk	2008-01-06 08:03:03 EST (Sun, 06 Jan 2008)
@@ -22,9 +22,13 @@
 
 Retreiving the elements for a given key is simple. The same process is applied
 to the key to find the correct bucket. Then the key is compared with the
-elements in the bucket to find any elements that match.  If the hash
-function has worked well the elements will be evenly distributed amongst the
-buckets so only a small number of elements will need to be examined.
+elements in the bucket to find any elements that match (using the equality
+predicate `Pred`).  If the hash function has worked well the elements will be
+evenly distributed amongst the buckets so only a small number of elements will
+need to be examined.
+
+There is [link unordered.hash_equality more information on hash functions and
+equality predicates in the next section].
 
 You can see in the diagram that `A` & `D` have been placed in the same bucket.
 When looking for elements in this bucket up to 2 comparisons are made, making