[Boost-commit] svn:boost r42335 - branches/unordered/dev/libs/unordered/doc

From: daniel_james_at_[hidden]
Date: 2007-12-29 08:14:46

Author: danieljames
Date: 2007-12-29 08:14:45 EST (Sat, 29 Dec 2007)
New Revision: 42335
URL: http://svn.boost.org/trac/boost/changeset/42335

Log:
Some of the changes to the introduction mention in the review. Hopefully this
will make it a little clearer.

Text files modified: 
   branches/unordered/dev/libs/unordered/doc/intro.qbk |    10 ++++++----                              
   1 files changed, 6 insertions(+), 4 deletions(-)

Modified: branches/unordered/dev/libs/unordered/doc/intro.qbk
==============================================================================
--- branches/unordered/dev/libs/unordered/doc/intro.qbk	(original)
+++ branches/unordered/dev/libs/unordered/doc/intro.qbk	2007-12-29 08:14:45 EST (Sat, 29 Dec 2007)
@@ -28,11 +28,12 @@
 
 Also, the existing containers require a 'less than' comparison object
 to order their elements. For some data types this is impossible to implement
-or isn't practical. For a hash table you need an equality function
+or isn't practical. In contrast, a hash table only needs an equality function
 and a hash function for the key.
 
-So the __tr1__ introduced the unordered associative containers, which are
-implemented using hash tables, and they have now been added to the __draft__.
+With this in mind, the __tr1__ introduced the unordered associative containers,
+which are implemented using hash tables, and they have now been added to the
+__draft__.
 
 This library supplies an almost complete implementation of the specification in
 the __draft__, (it doesn't support `emplace` yet, see the [link
@@ -110,6 +111,7 @@
     three,3
     missing,0
 
-There are other differences, which will be detailed later.
+There are other differences, which are listed in the
+[link unordered.comparison Comparison with Associative Containers] section.
 
 [endsect]