| OLD | NEW |
| 1 // Copyright (c) 2011, the Dart project authors. Please see the AUTHORS file | 1 // Copyright (c) 2011, 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) {} |
| (...skipping 10 matching lines...) Expand all Loading... |
| 21 class LinkedHashMapImplementation<K extends Hashable, V> | 21 class LinkedHashMapImplementation<K extends Hashable, 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 // See bug 5257789. | 31 // See issue 417. Works in the vm, fails in dartc and frog. |
| 32 factory LinkedHashMapImplementation/* <K, V> */.from(Map/* <K, V> */other) { | 32 factory LinkedHashMapImplementation/*<K extends Hashable, V>*/ |
| 33 Map/* <K, V> */ result = new LinkedHashMapImplementation/* <K, V> */(); | 33 .from(Map/*<K, V>*/ other) { |
| 34 other.forEach((/* K */ key, /* V */ value) { result[key] = value; }); | 34 Map/*<K, V>*/ result = new LinkedHashMapImplementation/*<K, V>*/(); |
| 35 other.forEach((/*K*/ key, /*V*/ value) { result[key] = value; }); |
| 35 return result; | 36 return result; |
| 36 } | 37 } |
| 37 | 38 |
| 38 void operator []=(K key, V value) { | 39 void operator []=(K key, V value) { |
| 39 if (_map.containsKey(key)) { | 40 if (_map.containsKey(key)) { |
| 40 _map[key].element.value = value; | 41 _map[key].element.value = value; |
| 41 } else { | 42 } else { |
| 42 _list.addLast(new KeyValuePair<K, V>(key, value)); | 43 _list.addLast(new KeyValuePair<K, V>(key, value)); |
| 43 _map[key] = _list.lastEntry(); | 44 _map[key] = _list.lastEntry(); |
| 44 } | 45 } |
| (...skipping 64 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
| 109 | 110 |
| 110 bool isEmpty() { | 111 bool isEmpty() { |
| 111 return length == 0; | 112 return length == 0; |
| 112 } | 113 } |
| 113 | 114 |
| 114 void clear() { | 115 void clear() { |
| 115 _map.clear(); | 116 _map.clear(); |
| 116 _list.clear(); | 117 _list.clear(); |
| 117 } | 118 } |
| 118 } | 119 } |
| OLD | NEW |