Use iterator, moveNext(), current.

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 87 matching lines @@
 
   int indexOf(E element, [int start = 0]) {
     return Arrays.indexOf(this, element, start, this.length);
   }
 
   int lastIndexOf(E element, [int start = null]) {
     if (start == null) start = length - 1;
     return Arrays.lastIndexOf(this, element, start);
   }
 
-  Iterator<E> iterator() {
-    return new _FixedSizeArrayIterator<E>(this);
-  }
+  Iterator<E> get iterator => new _FixedSizeArrayIterator<E>(this);
 
   void add(E element) {
     throw new UnsupportedError(
         "Cannot add to a non-extendable array");
   }
 
   void addLast(E element) {
     add(element);
   }
 
@@ skipping 124 matching lines @@
 
   int indexOf(E element, [int start = 0]) {
     return Arrays.indexOf(this, element, start, this.length);
   }
 
   int lastIndexOf(E element, [int start = null]) {
     if (start == null) start = length - 1;
     return Arrays.lastIndexOf(this, element, start);
   }
 
-  Iterator<E> iterator() {
-    return new _FixedSizeArrayIterator<E>(this);
-  }
+  Iterator<E> get iterator => new _FixedSizeArrayIterator<E>(this);
 
   void add(E element) {
     throw new UnsupportedError(
         "Cannot add to an immutable array");
   }
 
   void addLast(E element) {
     add(element);
   }
 
@@ skipping 19 matching lines @@
 
   E get last {
     return this[length - 1];
   }
 }
 
 
 // Iterator for arrays with fixed size.
 class _FixedSizeArrayIterator<E> implements Iterator<E> {
   _FixedSizeArrayIterator(List array)
-      : _array = array, _length = array.length, _pos = 0 {
+      : _array = array, _length = array.length, _pos = -1 {
     assert(array is _ObjectArray || array is _ImmutableArray);
   }
 
+  bool moveNext() {
+    _pos++;
+    if (_pos < _length) return true;
+    _pos = _length;
+    return false;
+  }
   bool get hasNext {
     return _length > _pos;
   }
 
-  E next() {
-    if (!hasNext) {
-      throw new StateError("No more elements");
+  E get current {
+    if (0 <= _pos && _pos < _length) {
+      return _array[_pos];
     }
-    return _array[_pos++];
+    throw new StateError("No more elements");

[Lasse Reichstein Nielsen, 2012/11/15 10:24:37]

Wrong message if _pos < 0 and length > 0.

[floitsch, 2012/11/16 17:51:58]

added TODO. this will go away with the new approach.

   }
 
   final List<E> _array;
   final int _length;  // Cache array length for faster access.
   int _pos;
 }