OLD | NEW |
1 // Copyright (c) 2013, the Dart project authors. Please see the AUTHORS file | 1 // Copyright (c) 2013, the Dart project authors. Please see the AUTHORS file |
2 // for details. All rights reserved. Use of this source code is governed by a | 2 // for details. All rights reserved. Use of this source code is governed by a |
3 // BSD-style license that can be found in the LICENSE file. | 3 // BSD-style license that can be found in the LICENSE file. |
4 | 4 |
5 part of dart.collection; | 5 part of dart.collection; |
6 | 6 |
7 /** | 7 /** |
8 * A hash-table based implementation of [Map]. | 8 * A hash-table based implementation of [Map]. |
9 * | 9 * |
10 * Keys insertion order is remembered, and keys are iterated in insertion order. | 10 * Keys insertion order is remembered, and keys are iterated in insertion order. |
11 * Values are iterated in their corresponding key's order. | 11 * Values are iterated in their corresponding key's order. |
12 * | 12 * |
13 * The keys of a `HashMap` must have consistent [Object.operator==] | 13 * The keys of a `LinkedHashMap` must have consistent [Object.operator==] |
14 * and [Object.hashCode] implementations. This means that the `==` operator | 14 * and [Object.hashCode] implementations. This means that the `==` operator |
15 * must define a stable equivalence relation on the keys (reflexive, | 15 * must define a stable equivalence relation on the keys (reflexive, |
16 * anti-symmetric, transitive, and consistent over time), and that `hashCode` | 16 * anti-symmetric, transitive, and consistent over time), and that `hashCode` |
17 * must be the same for objects that are considered equal by `==`. | 17 * must be the same for objects that are considered equal by `==`. |
18 * | 18 * |
19 * The map allows `null` as a key. | 19 * The map allows `null` as a key. |
20 */ | 20 */ |
21 class LinkedHashMap<K, V> implements Map<K, V> { | 21 class LinkedHashMap<K, V> implements HashMap<K, V> { |
22 external LinkedHashMap(); | 22 external LinkedHashMap(); |
23 | 23 |
24 /** | 24 /** |
25 * Creates a [LinkedHashMap] that contains all key value pairs of [other]. | 25 * Creates a [LinkedHashMap] that contains all key value pairs of [other]. |
26 */ | 26 */ |
27 factory LinkedHashMap.from(Map<K, V> other) { | 27 factory LinkedHashMap.from(Map<K, V> other) { |
28 return new LinkedHashMap<K, V>()..addAll(other); | 28 return new LinkedHashMap<K, V>()..addAll(other); |
29 } | 29 } |
30 | 30 |
31 /** | 31 /** |
(...skipping 57 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
89 external Iterable<V> get values; | 89 external Iterable<V> get values; |
90 | 90 |
91 external int get length; | 91 external int get length; |
92 | 92 |
93 external bool get isEmpty; | 93 external bool get isEmpty; |
94 | 94 |
95 external bool get isNotEmpty; | 95 external bool get isNotEmpty; |
96 | 96 |
97 String toString() => Maps.mapToString(this); | 97 String toString() => Maps.mapToString(this); |
98 } | 98 } |
OLD | NEW |