Added new version of reduce.

runtime/lib/array.dart

 // Copyright (c) 2012, the Dart project authors.  Please see the AUTHORS file
 // for details. All rights reserved. Use of this source code is governed by a
 // BSD-style license that can be found in the LICENSE file.
 
 
 // TODO(srdjan): Use shared array implementation.
 class _ObjectArray<E> implements List<E> {
 
   factory _ObjectArray(length) native "ObjectArray_allocate";
 
@@ skipping 96 matching lines @@
   }
 
   String join([String separator = ""]) {
     return IterableMixinWorkaround.joinList(this, separator);
   }
 
   Iterable map(f(E element)) {
     return IterableMixinWorkaround.mapList(this, f);
   }
 
-  reduce(initialValue, combine(previousValue, E element)) {
-    return IterableMixinWorkaround.reduce(this, initialValue, combine);
+  reduce(E combine(E value, E element)) {

[floitsch, 2013/04/10 15:14:07]

Return type is E.

[Lasse Reichstein Nielsen, 2013/04/11 07:54:04]

Done.

+    return IterableMixinWorkaround.reduce(this, combine);
   }
 
   fold(initialValue, combine(previousValue, E element)) {
     return IterableMixinWorkaround.fold(this, initialValue, combine);
   }
 
   Iterable<E> where(bool f(E element)) {
     return IterableMixinWorkaround.where(this, f);
   }
 
@@ skipping 98 matching lines @@
     if (length > 0) return this[length - 1];
     throw new StateError("No elements");
   }
 
   E get single {
     if (length == 1) return this[0];
     if (length == 0) throw new StateError("No elements");
     throw new StateError("More than one element");
   }
 
-  E min([int compare(E a, E b)]) => IterableMixinWorkaround.min(this, compare);
-
-  E max([int compare(E a, E b)]) => IterableMixinWorkaround.max(this, compare);
-
   List<E> toList({ bool growable: true}) {
     return new List<E>.from(this, growable: growable);
   }
 
   Set<E> toSet() {
     return new Set<E>.from(this);
   }
 
   Map<int, E> asMap() {
     return IterableMixinWorkaround.asMapList(this);
@@ skipping 103 matching lines @@
   }
 
   Iterable map(f(E element)) {
     return IterableMixinWorkaround.mapList(this, f);
   }
 
   String join([String separator = ""]) {
     return IterableMixinWorkaround.joinList(this, separator);
   }
 
-  reduce(initialValue, combine(previousValue, E element)) {
-    return IterableMixinWorkaround.reduce(this, initialValue, combine);
+  reduce(E combine(E value, E element)) {

[floitsch, 2013/04/10 15:14:07]

return type is E.

[Lasse Reichstein Nielsen, 2013/04/11 07:54:04]

Done.

+    return IterableMixinWorkaround.reduce(this, combine);
   }
 
   fold(initialValue, combine(previousValue, E element)) {
     return IterableMixinWorkaround.fold(this, initialValue, combine);
   }
 
   Iterable<E> where(bool f(E element)) {
     return IterableMixinWorkaround.where(this, f);
   }
 
@@ skipping 103 matching lines @@
     if (length > 0) return this[length - 1];
     throw new StateError("No elements");
   }
 
   E get single {
     if (length == 1) return this[0];
     if (length == 0) throw new StateError("No elements");
     throw new StateError("More than one element");
   }
 
-  E min([int compare(E a, E b)]) => IterableMixinWorkaround.min(this, compare);
-
-  E max([int compare(E a, E b)]) => IterableMixinWorkaround.max(this, compare);
-
   List<E> toList({ bool growable: true }) {
     return new List<E>.from(this, growable: growable);
   }
 
   Set<E> toSet() {
     return new Set<E>.from(this);
   }
 
   Map<int, E> asMap() {
     return IterableMixinWorkaround.asMapList(this);
@@ skipping 22 matching lines @@
     }
     _position = _length;
     _current = null;
     return false;
   }
 
   E get current {
     return _current;
   }
 }