Better documentation on Sets and Maps, and more.

sdk/lib/collection/hash_map.dart

Index: sdk/lib/collection/hash_map.dart
diff --git a/sdk/lib/collection/hash_map.dart b/sdk/lib/collection/hash_map.dart
index 431c89f5dc21dcc2eecb501073fe495d326a0c1a..1f707dcfbd41f4bcaee7fdec728ce882bbb1205b 100644
--- a/sdk/lib/collection/hash_map.dart
+++ b/sdk/lib/collection/hash_map.dart
@@ -4,6 +4,17 @@
 
 part of dart.collection;
 
+/**
+ * A hash-table based implementation of [Map].
+ *
+ * The keys of a `HashMap` must have consistent [Object.operator==]
+ * and [Object.hashCode] implementations. This means that the `==` operator
+ * must define a stable equivalence relation on the keys (reflexive,
+ * anti-symmetric, trasnitive, and consistent over time), and that `hashCode`

[floitsch, 2013/06/06 14:00:53]

transitive

[Lasse Reichstein Nielsen, 2013/06/10 05:48:50]

But I changed that! Really!
Grumble!

+ * must be the same for objects that are considered equal by `==`.
+ *
+ * The map allows `null` as a key.

[floitsch, 2013/06/06 14:00:53]

Should we add that the equivalence relationship does not work for doubles if
"NaN" is used?

[Lasse Reichstein Nielsen, 2013/06/10 05:48:50]

That is a property of doubles, which should be noted on the double type:
"doesn't play well with hash maps".

+ */
 class HashMap<K, V> implements Map<K, V> {
   external HashMap();