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) {} |
(...skipping 47 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
58 | 58 |
59 V putIfAbsent(K key, V ifAbsent()) { | 59 V putIfAbsent(K key, V ifAbsent()) { |
60 V value = this[key]; | 60 V value = this[key]; |
61 if ((this[key] === null) && !(containsKey(key))) { | 61 if ((this[key] === null) && !(containsKey(key))) { |
62 value = ifAbsent(); | 62 value = ifAbsent(); |
63 this[key] = value; | 63 this[key] = value; |
64 } | 64 } |
65 return value; | 65 return value; |
66 } | 66 } |
67 | 67 |
68 Collection<K> getKeys() { | 68 Collection<K> get keys { |
69 List<K> list = new List<K>(length); | 69 List<K> list = new List<K>(length); |
70 int index = 0; | 70 int index = 0; |
71 _list.forEach(void _(KeyValuePair<K, V> entry) { | 71 _list.forEach(void _(KeyValuePair<K, V> entry) { |
72 list[index++] = entry.key; | 72 list[index++] = entry.key; |
73 }); | 73 }); |
74 assert(index == length); | 74 assert(index == length); |
75 return list; | 75 return list; |
76 } | 76 } |
77 | 77 |
78 | 78 |
79 Collection<V> getValues() { | 79 Collection<V> get values { |
80 List<V> list = new List<V>(length); | 80 List<V> list = new List<V>(length); |
81 int index = 0; | 81 int index = 0; |
82 _list.forEach(void _(KeyValuePair<K, V> entry) { | 82 _list.forEach(void _(KeyValuePair<K, V> entry) { |
83 list[index++] = entry.value; | 83 list[index++] = entry.value; |
84 }); | 84 }); |
85 assert(index == length); | 85 assert(index == length); |
86 return list; | 86 return list; |
87 } | 87 } |
88 | 88 |
89 void forEach(void f(K key, V value)) { | 89 void forEach(void f(K key, V value)) { |
(...skipping 22 matching lines...) Expand all 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 |