[Boost-commit] svn:boost r41781 - sandbox/unordered/libs/unordered/doc

From: daniel_james_at_[hidden]
Date: 2007-12-06 06:41:33

Author: danieljames
Date: 2007-12-06 06:41:32 EST (Thu, 06 Dec 2007)
New Revision: 41781
URL: http://svn.boost.org/trac/boost/changeset/41781

Log:
Remove a couple of TODO notes.
Text files modified: 
   sandbox/unordered/libs/unordered/doc/comparison.qbk    |     3 ---                                     
   sandbox/unordered/libs/unordered/doc/hash_equality.qbk |     2 --                                      
   2 files changed, 0 insertions(+), 5 deletions(-)

Modified: sandbox/unordered/libs/unordered/doc/comparison.qbk
==============================================================================
--- sandbox/unordered/libs/unordered/doc/comparison.qbk	(original)
+++ sandbox/unordered/libs/unordered/doc/comparison.qbk	2007-12-06 06:41:32 EST (Thu, 06 Dec 2007)
@@ -22,8 +22,6 @@
         [Member typedef `value_compare` supplies an ordering comparison for member elements, accessed by member function `value_comp()`.]
         [No equivalent. No idea why.]
     ]
-    [/TODO: Mention a range? This is meant to be differences but this doesn't
-        seem to be complete.]
     [
         [Constructors have optional extra parameters for the comparison object.]
         [Constructors have optional extra parameters for the initial minimum
@@ -92,7 +90,6 @@
     [
         [Construction of empty container]
         [constant]
-        [/TODO: Do I meet this?]
         [O(/n/) where /n/ is the minimum number of buckets.]
     ]
     [

Modified: sandbox/unordered/libs/unordered/doc/hash_equality.qbk
==============================================================================
--- sandbox/unordered/libs/unordered/doc/hash_equality.qbk	(original)
+++ sandbox/unordered/libs/unordered/doc/hash_equality.qbk	2007-12-06 06:41:32 EST (Thu, 06 Dec 2007)
@@ -4,8 +4,6 @@
 
 [section:hash_equality Equality Predicates and Hash Functions]
 
-[/TODO: A better introduction to hash functions?]
-
 While the associative containers use an ordering relation to specify how the
 elements are stored, the unordered associative containers use an equality
 predicate and a hash function. For example, [classref boost::unordered_set]