Rename type parameter to comply with upcoming corelib changes.

runtime/lib/array.dart

 // Copyright (c) 2011, 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.
 
-class ListFactory<T> {
+class ListFactory<E> {
 
-  factory List.from(Iterable<T> other) {
-    GrowableObjectArray<T> list = new GrowableObjectArray<T>();
+  factory List.from(Iterable<E> other) {
+    GrowableObjectArray<E> list = new GrowableObjectArray<E>();
     for (final e in other) {
       list.add(e);
     }
     return list;
   }
 
   factory List([int length = null]) {
     if (length === null) {
-      return new GrowableObjectArray<T>();
+      return new GrowableObjectArray<E>();
     } else {
-      return new ObjectArray<T>(length);
+      return new ObjectArray<E>(length);
     }
   }
 }
 
 // TODO(srdjan): Use shared array implementation.
-class ObjectArray<T> implements List<T> {
+class ObjectArray<E> implements List<E> {
 
   factory ObjectArray(int length) native "ObjectArray_allocate";
 
-  T operator [](int index) native "ObjectArray_getIndexed";
+  E operator [](int index) native "ObjectArray_getIndexed";
 
-  void operator []=(int index, T value) native "ObjectArray_setIndexed";
+  void operator []=(int index, E value) native "ObjectArray_setIndexed";
 
   String toString() {
     return Arrays.asString(this);
   }
 
   int get length() native "ObjectArray_getLength";
 
   void copyFrom(List src, int srcStart, int dstStart, int count) {
     if (src is ObjectArray) {
       _copyFromObjectArray(src, srcStart, dstStart, count);
     } else {
       Arrays.copy(src, srcStart, this, dstStart, count);
     }
   }
 
   void _copyFromObjectArray(ObjectArray src,
                             int srcStart,
                             int dstStart,
                             int count)
       native "ObjectArray_copyFromObjectArray";
 
-  void setRange(int start, int length, List<T> from, [int startFrom = 0]) {
+  void setRange(int start, int length, List<E> from, [int startFrom = 0]) {
     if (length < 0) {
       throw new IllegalArgumentException("negative length $length");
     }
     copyFrom(from, startFrom, start, length);
   }
 
   void removeRange(int start, int length) {
     throw const UnsupportedOperationException(
         "Cannot remove range of a non-extendable array");
   }
 
-  void insertRange(int start, int length, [T initialValue = null]) {
+  void insertRange(int start, int length, [E initialValue = null]) {
     throw const UnsupportedOperationException(
         "Cannot insert range in a non-extendable array");
   }
 
-  List<T> getRange(int start, int length) {
+  List<E> getRange(int start, int length) {
     if (length == 0) return [];
     Arrays.rangeCheck(this, start, length);
-    List list = new List<T>();
+    List list = new List<E>();
     list.length = length;
     Arrays.copy(this, start, list, 0, length);
     return list;
   }
 
   /**
    * Collection interface.
    */
 
-  void forEach(f(T element)) {
+  void forEach(f(E element)) {
     Collections.forEach(this, f);
   }
 
-  Collection<T> filter(bool f(T element)) {
-    return Collections.filter(this, new GrowableObjectArray<T>(), f);
+  Collection<E> filter(bool f(E element)) {
+    return Collections.filter(this, new GrowableObjectArray<E>(), f);
   }
 
-  bool every(bool f(T element)) {
+  bool every(bool f(E element)) {
     return Collections.every(this, f);
   }
 
-  bool some(bool f(T element)) {
+  bool some(bool f(E element)) {
     return Collections.some(this, f);
   }
 
   bool isEmpty() {
     return this.length === 0;
   }
 
-  void sort(int compare(T a, T b)) {
+  void sort(int compare(E a, E b)) {
     DualPivotQuicksort.sort(this, compare);
   }
 
-  int indexOf(T element, [int start = 0]) {
+  int indexOf(E element, [int start = 0]) {
     return Arrays.indexOf(this, element, start, this.length);
   }
 
-  int lastIndexOf(T element, [int start = null]) {
+  int lastIndexOf(E element, [int start = null]) {
     if (start === null) start = length - 1;
     return Arrays.lastIndexOf(this, element, start);
   }
 
-  Iterator<T> iterator() {
-    return new FixedSizeArrayIterator<T>(this);
+  Iterator<E> iterator() {
+    return new FixedSizeArrayIterator<E>(this);
   }
 
-  void add(T element) {
+  void add(E element) {
     throw const UnsupportedOperationException(
         "Cannot add to a non-extendable array");
   }
 
-  void addLast(T element) {
+  void addLast(E element) {
     add(element);
   }
 
-  void addAll(Collection<T> elements) {
+  void addAll(Collection<E> elements) {
     throw const UnsupportedOperationException(
         "Cannot add to a non-extendable array");
   }
 
   void clear() {
     throw const UnsupportedOperationException(
         "Cannot clear a non-extendable array");
   }
 
   void set length(int length) {
     throw const UnsupportedOperationException(
         "Cannot change the length of a non-extendable array");
   }
 
-  T removeLast() {
+  E removeLast() {
     throw const UnsupportedOperationException(
         "Cannot remove in a non-extendable array");
   }
 
-  T last() {
+  E last() {
     return this[length - 1];
   }
 }
 
 
 // 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
 // the inline cache misses.
-class ImmutableArray<T> implements List<T> {
+class ImmutableArray<E> implements List<E> {
 
   factory ImmutableArray._uninstantiable() {
     throw const UnsupportedOperationException(
         "ImmutableArray can only be allocated by the VM");
   }
 
-  T operator [](int index) native "ObjectArray_getIndexed";
+  E operator [](int index) native "ObjectArray_getIndexed";
 
-  void operator []=(int index, T value) {
+  void operator []=(int index, E value) {
     throw const UnsupportedOperationException(
         "Cannot modify an immutable array");
   }
 
   int get length() native "ObjectArray_getLength";
 
   void copyFrom(List src, int srcStart, int dstStart, int count) {
     throw const UnsupportedOperationException(
         "Cannot modify an immutable array");
   }
 
-  void setRange(int start, int length, List<T> from, [int startFrom = 0]) {
+  void setRange(int start, int length, List<E> from, [int startFrom = 0]) {
     throw const UnsupportedOperationException(
         "Cannot modify an immutable array");
   }
 
   void removeRange(int start, int length) {
     throw const UnsupportedOperationException(
         "Cannot remove range of an immutable array");
   }
 
-  void insertRange(int start, int length, [T initialValue = null]) {
+  void insertRange(int start, int length, [E initialValue = null]) {
     throw const UnsupportedOperationException(
         "Cannot insert range in an immutable array");
   }
 
-  List<T> getRange(int start, int length) {
+  List<E> getRange(int start, int length) {
     if (length == 0) return [];
     Arrays.rangeCheck(this, start, length);
-    List list = new List<T>();
+    List list = new List<E>();
     list.length = length;
     Arrays.copy(this, start, list, 0, length);
     return list;
   }
 
   /**
    * Collection interface.
    */
 
-  void forEach(f(T element)) {
+  void forEach(f(E element)) {
     Collections.forEach(this, f);
   }
 
-  Collection<T> filter(bool f(T element)) {
-    return Collections.filter(this, new GrowableObjectArray<T>(), f);
+  Collection<E> filter(bool f(E element)) {
+    return Collections.filter(this, new GrowableObjectArray<E>(), f);
   }
 
-  bool every(bool f(T element)) {
+  bool every(bool f(E element)) {
     return Collections.every(this, f);
   }
 
-  bool some(bool f(T element)) {
+  bool some(bool f(E element)) {
     return Collections.some(this, f);
   }
 
   bool isEmpty() {
     return this.length === 0;
   }
 
-  void sort(int compare(T a, T b)) {
+  void sort(int compare(E a, E b)) {
     throw const UnsupportedOperationException(
         "Cannot modify an immutable array");
   }
 
   String toString() {
     return "ImmutableArray";
   }
 
-  int indexOf(T element, [int start = 0]) {
+  int indexOf(E element, [int start = 0]) {
     return Arrays.indexOf(this, element, start, this.length);
   }
 
-  int lastIndexOf(T element, [int start = null]) {
+  int lastIndexOf(E element, [int start = null]) {
     if (start === null) start = length - 1;
     return Arrays.lastIndexOf(this, element, start);
   }
 
-  Iterator<T> iterator() {
-    return new FixedSizeArrayIterator<T>(this);
+  Iterator<E> iterator() {
+    return new FixedSizeArrayIterator<E>(this);
   }
 
-  void add(T element) {
+  void add(E element) {
     throw const UnsupportedOperationException(
         "Cannot add to an immutable array");
   }
 
-  void addLast(T element) {
+  void addLast(E element) {
     add(element);
   }
 
-  void addAll(Collection<T> elements) {
+  void addAll(Collection<E> elements) {
     throw const UnsupportedOperationException(
         "Cannot add to an immutable array");
   }
 
   void clear() {
     throw const UnsupportedOperationException(
         "Cannot clear an immutable array");
   }
 
   void set length(int length) {
     throw const UnsupportedOperationException(
         "Cannot change the length of an immutable array");
   }
 
-  T removeLast() {
+  E removeLast() {
     throw const UnsupportedOperationException(
         "Cannot remove in a non-extendable array");
   }
 
-  T last() {
+  E last() {
     return this[length - 1];
   }
 }
 
 
 // Iterator for arrays with fixed size.
-class FixedSizeArrayIterator<T> implements Iterator<T> {
+class FixedSizeArrayIterator<E> implements Iterator<E> {
   FixedSizeArrayIterator(List array)
       : _array = array, _length = array.length, _pos = 0 {
     assert(array is ObjectArray || array is ImmutableArray);
   }
 
   bool hasNext() {
    return _length > _pos;
   }
 
-  T next() {
+  E next() {
     if (!hasNext()) {
       throw const NoMoreElementsException();
     }
     return _array[_pos++];
   }
 
-  final List<T> _array;
+  final List<E> _array;
   final int _length;  // Cache array length for faster access.
   int _pos;
 }