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 * A [Map] is an associative container, mapping a key to a value. | 6 * A [Map] is an associative container, mapping a key to a value. |
7 * Null values are supported, but null keys are not. | 7 * Null values are supported, but null keys are not. |
8 */ | 8 */ |
9 interface Map<K, V> default HashMapImplementation<K, V> { | 9 interface Map<K, V> default HashMapImplementation<K, V> { |
10 /** | 10 /** |
(...skipping 51 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
62 void clear(); | 62 void clear(); |
63 | 63 |
64 /** | 64 /** |
65 * Applies [f] to each {key, value} pair of the map. | 65 * Applies [f] to each {key, value} pair of the map. |
66 */ | 66 */ |
67 void forEach(void f(K key, V value)); | 67 void forEach(void f(K key, V value)); |
68 | 68 |
69 /** | 69 /** |
70 * Returns a collection containing all the keys in the map. | 70 * Returns a collection containing all the keys in the map. |
71 */ | 71 */ |
72 Collection<K> getKeys(); | 72 Collection<K> get keys; |
73 | 73 |
74 /** | 74 /** |
75 * Returns a collection containing all the values in the map. | 75 * Returns a collection containing all the values in the map. |
76 */ | 76 */ |
77 Collection<V> getValues(); | 77 Collection<V> get values; |
78 | 78 |
79 /** | 79 /** |
80 * The number of {key, value} pairs in the map. | 80 * The number of {key, value} pairs in the map. |
81 */ | 81 */ |
82 int get length; | 82 int get length; |
83 | 83 |
84 /** | 84 /** |
85 * Returns true if there is no {key, value} pair in the map. | 85 * Returns true if there is no {key, value} pair in the map. |
86 */ | 86 */ |
87 bool get isEmpty; | 87 bool get isEmpty; |
88 } | 88 } |
89 | 89 |
90 /** | 90 /** |
91 * Hash map version of the [Map] interface. A [HashMap] does not | 91 * Hash map version of the [Map] interface. A [HashMap] does not |
92 * provide any guarantees on the order of keys and values in [getKeys] | 92 * provide any guarantees on the order of keys and values in [keys] |
93 * and [getValues]. | 93 * and [values]. |
94 */ | 94 */ |
95 interface HashMap<K, V> extends Map<K, V> | 95 interface HashMap<K, V> extends Map<K, V> |
96 default HashMapImplementation<K, V> { | 96 default HashMapImplementation<K, V> { |
97 /** | 97 /** |
98 * Creates a map with the default implementation. | 98 * Creates a map with the default implementation. |
99 */ | 99 */ |
100 HashMap(); | 100 HashMap(); |
101 | 101 |
102 /** | 102 /** |
103 * Creates a [HashMap] that contains all key value pairs of [other]. | 103 * Creates a [HashMap] that contains all key value pairs of [other]. |
(...skipping 10 matching lines...) Expand all Loading... |
114 /** | 114 /** |
115 * Creates a map with the default implementation. | 115 * Creates a map with the default implementation. |
116 */ | 116 */ |
117 LinkedHashMap(); | 117 LinkedHashMap(); |
118 | 118 |
119 /** | 119 /** |
120 * Creates a [LinkedHashMap] that contains all key value pairs of [other]. | 120 * Creates a [LinkedHashMap] that contains all key value pairs of [other]. |
121 */ | 121 */ |
122 LinkedHashMap.from(Map<K, V> other); | 122 LinkedHashMap.from(Map<K, V> other); |
123 } | 123 } |
OLD | NEW |