From 322f7d6ec6144a6fbd54c50584d444ca5954900b Mon Sep 17 00:00:00 2001 From: Daniel James Date: Thu, 6 Dec 2007 11:41:32 +0000 Subject: [PATCH] Remove a couple of TODO notes. [SVN r41781] --- doc/comparison.qbk | 3 --- doc/hash_equality.qbk | 2 -- 2 files changed, 5 deletions(-) diff --git a/doc/comparison.qbk b/doc/comparison.qbk index 360f6ab3..6703bea6 100644 --- a/doc/comparison.qbk +++ b/doc/comparison.qbk @@ -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.] ] [ diff --git a/doc/hash_equality.qbk b/doc/hash_equality.qbk index 7569908c..4963e00e 100644 --- a/doc/hash_equality.qbk +++ b/doc/hash_equality.qbk @@ -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]