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 84 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
95 bool containsKey(K key) { | 95 bool containsKey(K key) { |
96 return _map.containsKey(key); | 96 return _map.containsKey(key); |
97 } | 97 } |
98 | 98 |
99 bool containsValue(V value) { | 99 bool containsValue(V value) { |
100 return _list.some(bool _(KeyValuePair<K, V> entry) { | 100 return _list.some(bool _(KeyValuePair<K, V> entry) { |
101 return (entry.value == value); | 101 return (entry.value == value); |
102 }); | 102 }); |
103 } | 103 } |
104 | 104 |
105 int get length() { | 105 int get length { |
106 return _map.length; | 106 return _map.length; |
107 } | 107 } |
108 | 108 |
109 bool isEmpty() { | 109 bool isEmpty() { |
110 return length == 0; | 110 return length == 0; |
111 } | 111 } |
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 |