OLD | NEW |
1 // Copyright (c) 2012, the Dart project authors. Please see the AUTHORS file | 1 // Copyright (c) 2012, 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 /** | 5 /** |
6 * This class represents a pair of two objects, used by LinkedHashMap | 6 * This class represents a pair of two objects, used by LinkedHashMap |
7 * to store a {key, value} in a list. | 7 * to store a {key, value} in a list. |
8 */ | 8 */ |
9 class KeyValuePair<K, V> { | 9 class KeyValuePair<K, V> { |
10 KeyValuePair(this.key, this.value) {} | 10 KeyValuePair(this.key, this.value) {} |
11 | 11 |
12 final K key; | 12 final K key; |
13 V value; | 13 V value; |
14 } | 14 } |
15 | 15 |
16 /** | 16 /** |
17 * A LinkedHashMap is a hash map that preserves the insertion order | 17 * A LinkedHashMap is a hash map that preserves the insertion order |
18 * when iterating over the keys or the values. Updating the value of a | 18 * when iterating over the keys or the values. Updating the value of a |
19 * key does not change the order. | 19 * key does not change the order. |
20 */ | 20 */ |
21 class LinkedHashMapImplementation<K extends Hashable, V> | 21 class LinkedHashMapImplementation<K, V> |
22 implements LinkedHashMap<K, V> { | 22 implements LinkedHashMap<K, V> { |
23 DoubleLinkedQueue<KeyValuePair<K, V>> _list; | 23 DoubleLinkedQueue<KeyValuePair<K, V>> _list; |
24 HashMap<K, DoubleLinkedQueueEntry<KeyValuePair<K, V>>> _map; | 24 HashMap<K, DoubleLinkedQueueEntry<KeyValuePair<K, V>>> _map; |
25 | 25 |
26 LinkedHashMapImplementation() { | 26 LinkedHashMapImplementation() { |
27 _map = new HashMap<K, DoubleLinkedQueueEntry<KeyValuePair<K, V>>>(); | 27 _map = new HashMap<K, DoubleLinkedQueueEntry<KeyValuePair<K, V>>>(); |
28 _list = new DoubleLinkedQueue<KeyValuePair<K, V>>(); | 28 _list = new DoubleLinkedQueue<KeyValuePair<K, V>>(); |
29 } | 29 } |
30 | 30 |
31 factory LinkedHashMapImplementation.from(Map<K, V> other) { | 31 factory LinkedHashMapImplementation.from(Map<K, V> other) { |
(...skipping 80 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
112 | 112 |
113 void clear() { | 113 void clear() { |
114 _map.clear(); | 114 _map.clear(); |
115 _list.clear(); | 115 _list.clear(); |
116 } | 116 } |
117 | 117 |
118 String toString() { | 118 String toString() { |
119 return Maps.mapToString(this); | 119 return Maps.mapToString(this); |
120 } | 120 } |
121 } | 121 } |
OLD | NEW |