Make Iterable more powerful (and lazy).

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(int length) native "ObjectArray_allocate";
 
@@ skipping 54 matching lines @@
 
   void forEach(f(E element)) {
     Collections.forEach(this, f);
   }
 
   Collection map(f(E element)) {
     return Collections.map(
         this, new _GrowableObjectArray.withCapacity(length), f);
   }
 
+  Collection<E> filter(bool f(E element)) {
+    return Collections.filter(this, new _GrowableObjectArray<E>(), f);
+  }
+
   reduce(initialValue, combine(previousValue, E element)) {
     return Collections.reduce(this, initialValue, combine);
   }
 
-  Collection<E> filter(bool f(E element)) {
-    return Collections.filter(this, new _GrowableObjectArray<E>(), f);
-  }
-
   bool every(bool f(E element)) {
     return Collections.every(this, f);
   }
 
-  bool some(bool f(E element)) {
+  bool any(bool f(E element)) {
     return Collections.some(this, f);
   }
 
   bool get isEmpty {
     return this.length === 0;
   }
 
   void sort([Comparator<E> compare = Comparable.compare]) {
     coreSort(this, compare);
   }
@@ skipping 208 matching lines @@
     if (!hasNext) {
       throw new StateError("No more elements");
     }
     return _array[_pos++];
   }
 
   final List<E> _array;
   final int _length;  // Cache array length for faster access.
   int _pos;
 }