| Index: sdk/lib/collection/linked_hash_map.dart | 
| diff --git a/sdk/lib/collection/linked_hash_map.dart b/sdk/lib/collection/linked_hash_map.dart | 
| index 4ace5890c4429bdac5c96bb092ced35f32709e9e..ee38ae7507d844244a1c9097e5a8856ea79ce0d2 100644 | 
| --- a/sdk/lib/collection/linked_hash_map.dart | 
| +++ b/sdk/lib/collection/linked_hash_map.dart | 
| @@ -10,7 +10,7 @@ part of dart.collection; | 
| * Keys insertion order is remembered, and keys are iterated in insertion order. | 
| * Values are iterated in their corresponding key's order. | 
| * | 
| - * The keys of a `HashMap` must have consistent [Object.operator==] | 
| + * The keys of a `LinkedHashMap` 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, transitive, and consistent over time), and that `hashCode` | 
| @@ -18,7 +18,7 @@ part of dart.collection; | 
| * | 
| * The map allows `null` as a key. | 
| */ | 
| -class LinkedHashMap<K, V> implements Map<K, V> { | 
| +class LinkedHashMap<K, V> implements HashMap<K, V> { | 
| external LinkedHashMap(); | 
|  | 
| /** | 
|  |