Remove a couple of TODO notes.

[SVN r41781]
This commit is contained in:
Daniel James
2007-12-06 11:41:32 +00:00
parent a07c59a64e
commit 322f7d6ec6
2 changed files with 0 additions and 5 deletions

View File

@@ -22,8 +22,6 @@
[Member typedef `value_compare` supplies an ordering comparison for member elements, accessed by member function `value_comp()`.] [Member typedef `value_compare` supplies an ordering comparison for member elements, accessed by member function `value_comp()`.]
[No equivalent. No idea why.] [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 comparison object.]
[Constructors have optional extra parameters for the initial minimum [Constructors have optional extra parameters for the initial minimum
@@ -92,7 +90,6 @@
[ [
[Construction of empty container] [Construction of empty container]
[constant] [constant]
[/TODO: Do I meet this?]
[O(/n/) where /n/ is the minimum number of buckets.] [O(/n/) where /n/ is the minimum number of buckets.]
] ]
[ [

View File

@@ -4,8 +4,6 @@
[section:hash_equality Equality Predicates and Hash Functions] [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 While the associative containers use an ordering relation to specify how the
elements are stored, the unordered associative containers use an equality elements are stored, the unordered associative containers use an equality
predicate and a hash function. For example, [classref boost::unordered_set] predicate and a hash function. For example, [classref boost::unordered_set]