Big merge from experimental to bleeding edge.

sdk/lib/_internal/compiler/implementation/lib/js_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.
 
 part of _interceptors;
 
 /**
  * The interceptor class for [List]. The compiler recognizes this
  * class as an interceptor, and changes references to [:this:] to
  * actually use the receiver of the method, which is generated as an extra
@@ skipping 15 matching lines @@
     checkGrowable(this, 'removeAt');
     return JS('var', r'#.splice(#, 1)[0]', this, index);
   }
 
   E removeLast() {
     checkGrowable(this, 'removeLast');
     if (length == 0) throw new RangeError.value(-1);
     return JS('var', r'#.pop()', this);
   }
 
-  List<E> filter(bool f(E element)) {
-    return Collections.filter(this, <E>[], f);
+  Iterable<E> where(bool f(E element)) {
+    return new WhereIterable<E>(this, f);
   }
 
   void addAll(Collection<E> collection) {
     for (E e in collection) {
       this.add(e);
     }
   }
 
   void addLast(E value) {
     checkGrowable(this, 'addLast');
     JS('void', r'#.push(#)', this, value);
   }
 
   void clear() {
     length = 0;
   }
 
   void forEach(void f(E element)) {
     return Collections.forEach(this, f);
   }
 
-  Collection map(f(E element)) {
-    return Collections.map(this, [], f);
+  List mappedBy(f(E element)) {
+    return new MappedList(this, f);
+  }
+
+  String join([String separator]) {
+    if (separator == null) separator = "";
+    var list = new List(this.length);
+    for (int i = 0; i < this.length; i++) {
+      list[i] = "${this[i]}";
+    }
+    return JS('String', "#.join(#)", list, separator);
+  }
+
+  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);
   }
 
   reduce(initialValue, combine(previousValue, E element)) {
     return Collections.reduce(this, initialValue, combine);
   }
 
+  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];
+  }
+
   List<E> getRange(int start, int length) {
     // TODO(ngeoffray): Parameterize the return value.
     if (0 == length) return [];
     checkNull(start); // TODO(ahe): This is not specified but co19 tests it.
     checkNull(length); // TODO(ahe): This is not specified but co19 tests it.
     if (start is !int) throw new ArgumentError(start);
     if (length is !int) throw new ArgumentError(length);
     if (length < 0) throw new ArgumentError(length);
     if (start < 0) throw new RangeError.value(start);
     int end = start + length;
     if (end > this.length) {
       throw new RangeError.value(length);
     }
     if (length < 0) throw new ArgumentError(length);
     return JS('=List', r'#.slice(#, #)', this, start, end);
   }
 
   void insertRange(int start, int length, [E initialValue]) {
     return listInsertRange(this, start, length, initialValue);
   }
 
-  E get last => this[length - 1];
+  E get first {
+    if (length > 0) return this[0];
+    throw new StateError("No elements");
+  }
 
-  E get first => this[0];
+  E get last {
+    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);
 
   void removeRange(int start, int length) {
     checkGrowable(this, 'removeRange');
     if (length == 0) {
       return;
     }
     checkNull(start); // TODO(ahe): This is not specified but co19 tests it.
     checkNull(length); // TODO(ahe): This is not specified but co19 tests it.
     if (start is !int) throw new ArgumentError(start);
     if (length is !int) throw new ArgumentError(length);
@@ skipping 25 matching lines @@
     if (startFrom is !int) throw new ArgumentError(startFrom);
     if (length < 0) throw new ArgumentError(length);
     if (start < 0) throw new RangeError.value(start);
     if (start + length > this.length) {
       throw new RangeError.value(start + length);
     }
 
     Arrays.copy(from, startFrom, this, start, length);
   }
 
-  bool some(bool f(E element)) => Collections.some(this, f);
+  bool any(bool f(E element)) => Collections.any(this, f);
 
   bool every(bool f(E element)) => Collections.every(this, f);
 
   void sort([int compare(E a, E b)]) {
     checkMutable(this, 'sort');
     if (compare == null) compare = Comparable.compare;
     coreSort(this, compare);
   }
 
   int indexOf(E element, [int start = 0]) {
@@ skipping 10 matching lines @@
     for (int i = 0; i < length; i++) {
       if (other == this[i]) return true;
     }
     return false;
   }
 
   bool get isEmpty => length == 0;
 
   String toString() => Collections.collectionToString(this);
 
-  ListIterator iterator() => new ListIterator(this);
+  List<E> toList() => new List<E>.from(this);
+
+  Set<E> toSet() => new Set<E>.from(this);
+
+  _ArrayIterator get iterator => new _ArrayIterator(this);
 
   int get hashCode => Primitives.objectHashCode(this);
 
   Type get runtimeType {
     // Call getRuntimeTypeString to get the name including type arguments.
     return new TypeImpl(getRuntimeTypeString(this));
   }
 
   int get length => JS('int', r'#.length', this);
 
   void set length(int newLength) {
     if (newLength is !int) throw new ArgumentError(newLength);
     if (newLength < 0) throw new RangeError.value(newLength);
     checkGrowable(this, 'set length');
     JS('void', r'#.length = #', this, newLength);
   }
 
   E operator [](int index) {
     if (index is !int) throw new ArgumentError(index);
     if (index >= length || index < 0) throw new RangeError.value(index);
     return JS('var', '#[#]', this, index);
   }
 }
+
+/** Iterator for JavaScript Arrays. */
+class _ArrayIterator<T> implements Iterator<T> {
+  final List<T> _list;
+  int _position;
+  T _current;
+
+  _ArrayIterator(List<T> this._list) : _position = -1;
+
+  T get current => _current;
+
+  bool moveNext() {
+    int nextPosition = _position + 1;
+    int length = _list.length;
+    if (nextPosition < length) {
+      _position = nextPosition;
+      _current = _list[nextPosition];
+      return true;
+    }
+    _position = length;
+    _current = null;
+    return false;
+  }
+}