| OLD | NEW |
| 1 // Copyright (c) 2013, the Dart project authors. Please see the AUTHORS file | 1 // Copyright (c) 2013, 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 part of dart.collection; | 5 part of dart.collection; |
| 6 | 6 |
| 7 /** | 7 /** |
| 8 * A hash-table based implementation of [Map]. | 8 * A hash-table based implementation of [Map]. |
| 9 * | 9 * |
| 10 * Keys insertion order is remembered, and keys are iterated in insertion order. | 10 * Keys insertion order is remembered, and keys are iterated in insertion order. |
| (...skipping 23 matching lines...) Expand all Loading... |
| 34 * | 34 * |
| 35 * For each element of the [iterable] this constructor computes a key/value | 35 * For each element of the [iterable] this constructor computes a key/value |
| 36 * pair, by applying [key] and [value] respectively. | 36 * pair, by applying [key] and [value] respectively. |
| 37 * | 37 * |
| 38 * The keys of the key/value pairs do not need to be unique. The last | 38 * The keys of the key/value pairs do not need to be unique. The last |
| 39 * occurrence of a key will simply overwrite any previous value. | 39 * occurrence of a key will simply overwrite any previous value. |
| 40 * | 40 * |
| 41 * If no values are specified for [key] and [value] the default is the | 41 * If no values are specified for [key] and [value] the default is the |
| 42 * identity function. | 42 * identity function. |
| 43 */ | 43 */ |
| 44 factory LinkedHashMap.fromIterable(Iterable<K> iterable, | 44 factory LinkedHashMap.fromIterable(Iterable iterable, |
| 45 {K key(element), V value(element)}) { | 45 {K key(element), V value(element)}) { |
| 46 LinkedHashMap<K, V> map = new LinkedHashMap<K, V>(); | 46 LinkedHashMap<K, V> map = new LinkedHashMap<K, V>(); |
| 47 Maps._fillMapWithMappedIterable(map, iterable, key, value); | 47 Maps._fillMapWithMappedIterable(map, iterable, key, value); |
| 48 return map; | 48 return map; |
| 49 } | 49 } |
| 50 | 50 |
| 51 /** | 51 /** |
| 52 * Creates a [LinkedHashMap] associating the given [keys] to [values]. | 52 * Creates a [LinkedHashMap] associating the given [keys] to [values]. |
| 53 * | 53 * |
| 54 * This constructor iterates over [keys] and [values] and maps each element of | 54 * This constructor iterates over [keys] and [values] and maps each element of |
| (...skipping 34 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
| 89 external Iterable<V> get values; | 89 external Iterable<V> get values; |
| 90 | 90 |
| 91 external int get length; | 91 external int get length; |
| 92 | 92 |
| 93 external bool get isEmpty; | 93 external bool get isEmpty; |
| 94 | 94 |
| 95 external bool get isNotEmpty; | 95 external bool get isNotEmpty; |
| 96 | 96 |
| 97 String toString() => Maps.mapToString(this); | 97 String toString() => Maps.mapToString(this); |
| 98 } | 98 } |
| OLD | NEW |