Chromium Code Reviews
chromiumcodereview-hr@appspot.gserviceaccount.com (chromiumcodereview-hr) | Please choose your nickname with Settings | Help | Chromium Project | Gerrit Changes | Sign out
(326)

Side by Side Diff: lib/core/map.dart

Issue 11238035: Make isEmpty a getter. (Closed) Base URL: https://dart.googlecode.com/svn/branches/bleeding_edge/dart
Patch Set: Update status file with co19 issue number. Created 8 years, 1 month ago
Use n/p to move between diff chunks; N/P to move between comments. Draft comments are only viewable by you.
Jump to:
View unified diff | Download patch | Annotate | Revision Log
« no previous file with comments | « lib/core/future.dart ('k') | lib/core/sequences.dart » ('j') | no next file with comments »
Toggle Intra-line Diffs ('i') | Expand Comments ('e') | Collapse Comments ('c') | Show Comments Hide Comments ('s')
OLDNEW
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 66 matching lines...) Expand 10 before | Expand all | Expand 10 after
77 Collection<V> getValues(); 77 Collection<V> getValues();
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 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 [getKeys]
93 * and [getValues]. 93 * and [getValues].
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 /**
(...skipping 16 matching lines...) Expand all
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 }
OLDNEW
« no previous file with comments | « lib/core/future.dart ('k') | lib/core/sequences.dart » ('j') | no next file with comments »

Powered by Google App Engine
This is Rietveld 408576698