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 `HashMap` 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 Map<K, V> { |
22 external LinkedHashMap(); | 22 external LinkedHashMap(); |
23 | 23 |
24 factory LinkedHashMap.from(Map<K, V> other) { | 24 factory LinkedHashMap.from(Map<K, V> other) { |
25 return new LinkedHashMap<K, V>()..addAll(other); | 25 return new LinkedHashMap<K, V>()..addAll(other); |
26 } | 26 } |
27 | 27 |
| 28 factory LinkedHashMap.fromIterable(Iterable iterable, |
| 29 {K key(element), V value(element)}) { |
| 30 LinkedHashMap<K, V> map = new LinkedHashMap<K, V>(); |
| 31 Maps._fillMapWithMappedIterable(map, iterable, key: key, value: value); |
| 32 return map; |
| 33 } |
| 34 |
| 35 factory LinkedHashMap.fromIterables(Iterable<K> keys, Iterable<V> values) { |
| 36 LinkedHashMap<K, V> map = new LinkedHashMap<K, V>(); |
| 37 Maps._fillMapWithIterables(map, keys, values); |
| 38 return map; |
| 39 } |
| 40 |
28 external bool containsKey(Object key); | 41 external bool containsKey(Object key); |
29 | 42 |
30 external bool containsValue(Object value); | 43 external bool containsValue(Object value); |
31 | 44 |
32 external void addAll(Map<K, V> other); | 45 external void addAll(Map<K, V> other); |
33 | 46 |
34 external V operator [](Object key); | 47 external V operator [](Object key); |
35 | 48 |
36 external void operator []=(K key, V value); | 49 external void operator []=(K key, V value); |
37 | 50 |
(...skipping 11 matching lines...) Expand all Loading... |
49 external Iterable<V> get values; | 62 external Iterable<V> get values; |
50 | 63 |
51 external int get length; | 64 external int get length; |
52 | 65 |
53 external bool get isEmpty; | 66 external bool get isEmpty; |
54 | 67 |
55 external bool get isNotEmpty; | 68 external bool get isNotEmpty; |
56 | 69 |
57 String toString() => Maps.mapToString(this); | 70 String toString() => Maps.mapToString(this); |
58 } | 71 } |
OLD | NEW |