Big merge from experimental to bleeding edge.

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 43 matching lines @@
     if (length == 0) return [];
     Arrays.rangeCheck(this, start, length);
     List list = new _GrowableObjectArray<E>.withCapacity(length);
     list.length = length;
     Arrays.copy(this, start, list, 0, length);
     return list;
   }
 
   // Collection interface.
 
-  bool contains(E element) => Collections.contains(this, element);
+  bool contains(E element) {
+    return Collections.contains(this, element);
+  }
 
   void forEach(f(E element)) {
     Collections.forEach(this, f);
   }
 
-  Collection map(f(E element)) {
-    return Collections.map(
-        this, new _GrowableObjectArray.withCapacity(length), f);
+  String join([String separator]) {
+    return Collections.join(this, separator);
+  }
+
+  List mappedBy(f(E element)) {
+    return new MappedList<E, dynamic>(this, 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);
+  Iterable<E> where(bool f(E element)) {
+    return new WhereIterable<E>(this, f);
+  }
+
+  List<E> take(int n) {
+    return new ListView<E>(this, 0, n);
+  }
+
+  Iterable<E> takeWhile(bool test(E value)) {
+    return new TakeWhileIterable<E>(this, test);
+  }
+
+  List<E> skip(int n) {
+    return new ListView<E>(this, n, null);
+  }
+
+  Iterable<E> skipWhile(bool test(E value)) {
+    return new SkipWhileIterable<E>(this, test);
   }
 
   bool every(bool f(E element)) {
     return Collections.every(this, f);
   }
 
-  bool some(bool f(E element)) {
-    return Collections.some(this, f);
+  bool any(bool f(E element)) {
+    return Collections.any(this, f);
+  }
+
+  E firstMatching(bool test(E value), {E orElse()}) {
+    return Collections.firstMatching(this, test, orElse);
+  }
+
+  E lastMatching(bool test(E value), {E orElse()}) {
+    return Collections.lastMatchingInList(this, test, orElse);
+  }
+
+  E singleMatching(bool test(E value)) {
+    return Collections.singleMatching(this, test);
+  }
+
+  E elementAt(int index) {
+    return this[index];
   }
 
   bool get isEmpty {
     return this.length == 0;
   }
 
   void sort([int compare(E a, E b)]) {
     if (compare == null) compare = Comparable.compare;
     _Sort.sort(this, compare);
   }
 
   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() {
+  Iterator<E> get iterator {
     return new _FixedSizeArrayIterator<E>(this);
   }
 
   void add(E element) {
     throw new UnsupportedError(
         "Cannot add to a non-extendable array");
   }
 
   void addLast(E element) {
     add(element);
   }
 
-  void addAll(Collection<E> elements) {
+  void addAll(Iterable<E> iterable) {
     throw new UnsupportedError(
         "Cannot add to a non-extendable array");
   }
 
   void clear() {
     throw new UnsupportedError(
         "Cannot clear a non-extendable array");
   }
 
   void set length(int length) {
     throw new UnsupportedError(
         "Cannot change the length of a non-extendable array");
   }
 
   E removeLast() {
     throw new UnsupportedError(
         "Cannot remove in a non-extendable array");
   }
 
   E get first {
-    return this[0];
+    if (length > 0) return this[0];
+    throw new StateError("No elements");
   }
 
   E get last {
-    return this[length - 1];
+    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)]) => Collections.min(this, compare);
+
+  E max([int compare(E a, E b)]) => Collections.max(this, compare);
+
+  List<E> toList() {
+    return new List<E>.from(this);
+  }
+
+  Set<E> toSet() {
+    return new Set<E>.from(this);
   }
 }
 
 
 // This is essentially the same class as _ObjectArray, but it does not
 // permit any modification of array elements from Dart code. We use
 // this class for arrays constructed from Dart array literals.
 // TODO(hausner): We should consider the trade-offs between two
 // classes (and inline cache misses) versus a field in the native
 // implementation (checks when modifying). We should keep watching
@@ skipping 43 matching lines @@
     if (length == 0) return [];
     Arrays.rangeCheck(this, start, length);
     List list = new List<E>();
     list.length = length;
     Arrays.copy(this, start, list, 0, length);
     return list;
   }
 
   // Collection interface.
 
-  bool contains(E element) => Collections.contains(this, element);
+  bool contains(E element) {
+    return Collections.contains(this, element);
+  }
 
   void forEach(f(E element)) {
     Collections.forEach(this, f);
   }
 
-  Collection map(f(E element)) {
-    return Collections.map(
-        this, new _GrowableObjectArray.withCapacity(length), f);
+  List mappedBy(f(E element)) {
+    return new MappedList<E, dynamic>(this, f);
+  }
+
+  String join([String separator]) {
+    return Collections.join(this, separator);
   }
 
   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);
+  Iterable<E> where(bool f(E element)) {
+    return new WhereIterable<E>(this, f);
+  }
+
+  List<E> take(int n) {
+    return new ListView<E>(this, 0, n);
+  }
+
+  Iterable<E> takeWhile(bool test(E value)) {
+    return new TakeWhileIterable<E>(this, test);
+  }
+
+  List<E> skip(int n) {
+    return new ListView<E>(this, n, null);
+  }
+
+  Iterable<E> skipWhile(bool test(E value)) {
+    return new SkipWhileIterable<E>(this, test);
   }
 
   bool every(bool f(E element)) {
     return Collections.every(this, f);
   }
 
-  bool some(bool f(E element)) {
-    return Collections.some(this, f);
+  bool any(bool f(E element)) {
+    return Collections.any(this, f);
+  }
+
+  E firstMatching(bool test(E value), {E orElse()}) {
+    return Collections.firstMatching(this, test, orElse);
+  }
+
+  E lastMatching(bool test(E value), {E orElse()}) {
+    return Collections.lastMatchingInList(this, test, orElse);
+  }
+
+  E singleMatching(bool test(E value)) {
+    return Collections.singleMatching(this, test);
+  }
+
+  E elementAt(int index) {
+    return this[index];
   }
 
   bool get isEmpty {
     return this.length == 0;
   }
 
   void sort([int compare(E a, E b)]) {
     throw new UnsupportedError(
         "Cannot modify an immutable array");
   }
 
   String toString() {
     return Collections.collectionToString(this);
   }
 
   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() {
+  Iterator<E> get iterator {
     return new _FixedSizeArrayIterator<E>(this);
   }
 
   void add(E element) {
     throw new UnsupportedError(
         "Cannot add to an immutable array");
   }
 
   void addLast(E element) {
     add(element);
   }
 
-  void addAll(Collection<E> elements) {
+  void addAll(Iterable<E> elements) {
     throw new UnsupportedError(
         "Cannot add to an immutable array");
   }
 
   void clear() {
     throw new UnsupportedError(
         "Cannot clear an immutable array");
   }
 
   void set length(int length) {
     throw new UnsupportedError(
         "Cannot change the length of an immutable array");
   }
 
   E removeLast() {
     throw new UnsupportedError(
         "Cannot remove in a non-extendable array");
   }
 
   E get first {
-    return this[0];
+    if (length > 0) return this[0];
+    throw new StateError("No elements");
   }
 
   E get last {
-    return this[length - 1];
+    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)]) => Collections.min(this, compare);
+
+  E max([int compare(E a, E b)]) => Collections.max(this, compare);
+
+  List<E> toList() {
+    return new List<E>.from(this);
+  }
+
+  Set<E> toSet() {
+    return new Set<E>.from(this);
   }
 }
 
 
 // Iterator for arrays with fixed size.
 class _FixedSizeArrayIterator<E> implements Iterator<E> {
+  final List<E> _array;
+  final int _length;  // Cache array length for faster access.
+  int _position;
+  E _current;
+
   _FixedSizeArrayIterator(List array)
-      : _array = array, _length = array.length, _pos = 0 {
+      : _array = array, _length = array.length, _position = -1 {
     assert(array is _ObjectArray || array is _ImmutableArray);
   }
 
-  bool get hasNext {
-    return _length > _pos;
+  bool moveNext() {
+    int nextPosition = _position + 1;
+    if (nextPosition < _length) {
+      _current = _array[nextPosition];
+      _position = nextPosition;
+      return true;
+    }
+    _position = _length;
+    _current = null;
+    return false;
   }
 
-  E next() {
-    if (!hasNext) {
-      throw new StateError("No more elements");
-    }
-    return _array[_pos++];
+  E get current {
+    return _current;
   }
-
-  final List<E> _array;
-  final int _length;  // Cache array length for faster access.
-  int _pos;
 }