| 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 * The [Collection] interface is the public interface of all | 6 * The [Collection] interface is the public interface of all |
| 7 * collections. | 7 * collections. |
| 8 */ | 8 */ |
| 9 interface Collection<E> extends Iterable<E> { | 9 interface Collection<E> extends Iterable<E> { |
| 10 /** | 10 /** |
| 11 * Applies the function [f] to each element of this collection. | 11 * Applies the function [f] to each element of this collection. |
| 12 */ | 12 */ |
| 13 void forEach(void f(E element)); | 13 void forEach(void f(E element)); |
| 14 | 14 |
| 15 /** | 15 /** |
| 16 * Returns a new collection with the elements [: f(e) :] | 16 * Returns a new collection with the elements [: f(e) :] |
| 17 * for each element [:e:] of this collection. | 17 * for each element [e] of this collection. |
| 18 * | 18 * |
| 19 * Note on typing: the return type of f() could be an arbitrary | 19 * Note on typing: the return type of f() could be an arbitrary |
| 20 * type and consequently the returned collection's | 20 * type and consequently the returned collection's |
| 21 * typeis Collection. | 21 * typeis Collection. |
| 22 */ | 22 */ |
| 23 Collection map(f(E element)); | 23 Collection map(f(E element)); |
| 24 | 24 |
| 25 /** | 25 /** |
| 26 * Reduce a collection to a single value by iteratively combining each element | |
| 27 * of the collection with an existing value using the provided function. | |
| 28 * Use [initialValue] as the initial value, and the function [combine] to | |
| 29 * create a new value from the previous one and an element. | |
| 30 * | |
| 31 * Example of calculating the sum of a collection: | |
| 32 * | |
| 33 * collection.reduce(0, (prev, element) => prev + element); | |
| 34 */ | |
| 35 Dynamic reduce(Dynamic initialValue, | |
| 36 Dynamic combine(Dynamic previousValue, E element)); | |
| 37 | |
| 38 /** | |
| 39 * Returns a new collection with the elements of this collection | 26 * Returns a new collection with the elements of this collection |
| 40 * that satisfy the predicate [f]. | 27 * that satisfy the predicate [f]. |
| 41 * | 28 * |
| 42 * An element satisfies the predicate [f] if [:f(element):] | 29 * An element satisfies the predicate [f] if [:f(element):] |
| 43 * returns true. | 30 * returns true. |
| 44 */ | 31 */ |
| 45 Collection<E> filter(bool f(E element)); | 32 Collection<E> filter(bool f(E element)); |
| 46 | 33 |
| 47 /** | 34 /** |
| 48 * Returns true if every elements of this collection satisify the | 35 * Returns true if every elements of this collection satisify the |
| (...skipping 10 matching lines...) Expand all Loading... |
| 59 /** | 46 /** |
| 60 * Returns true if there is no element in this collection. | 47 * Returns true if there is no element in this collection. |
| 61 */ | 48 */ |
| 62 bool isEmpty(); | 49 bool isEmpty(); |
| 63 | 50 |
| 64 /** | 51 /** |
| 65 * Returns the number of elements in this collection. | 52 * Returns the number of elements in this collection. |
| 66 */ | 53 */ |
| 67 int get length(); | 54 int get length(); |
| 68 } | 55 } |
| OLD | NEW |