Rename GrowableObjectArray to ListImplementation.

runtime/lib/list_implementation.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 GrowableObjectArray<T> implements Array<T> {
+class ListImplementation<T> implements Array<T> {
   ObjectArray<T> backingArray;
 
   void copyFrom(List<Object> src, int srcStart, int dstStart, int count) {
     Arrays.copy(src, srcStart, this, dstStart, count);
   }
 
   void setRange(int start, int length, List<T> from, [int startFrom = 0]) {
     if (length < 0) {
       throw new IllegalArgumentException("negative length $length");
     }
@@ skipping 53 matching lines @@
     return new List<T>.fromList(this, start, start + length);
   }
 
   // The length of this growable array. It is always less than the
   // length of the backing array.
   int _length;
   // Constant used by indexOf and lastIndexOf when the element given
   // is not in the array.
   static final int ABSENT = -1;
 
-  GrowableObjectArray()
+  ListImplementation()
       : _length = 0, backingArray = new ObjectArray<T>(4) {}
 
-  GrowableObjectArray.withCapacity(int capacity) {
+  ListImplementation.withCapacity(int capacity) {
     _length = 0;
     if (capacity <= 0) {
       capacity = 4;
     }
     backingArray = new ObjectArray<T>(capacity);
   }
 
-  GrowableObjectArray._usingArray(Array<T> array) {
+  ListImplementation._usingArray(Array<T> array) {
     backingArray = array;
     _length = array.length;
     if (_length == 0) {
       grow(4);
     }
   }
 
-  factory GrowableObjectArray.from(Collection<T> other) {
-    Array result = new GrowableObjectArray();
+  factory ListImplementation.from(Collection<T> other) {
+    List result = new List();
     result.addAll(other);
     return result;
   }
 
   int get length() {
     return _length;
   }
 
   void set length(int new_length) {
     if (new_length >= backingArray.length) {
@@ skipping 73 matching lines @@
 
   void forEach(f(T element)) {
     // TODO(srdjan): Use Collections.forEach(this, f);
     // Using backingArray directly improves DeltaBlue performance by 25%.
     for (int i = 0; i < _length; i++) {
       f(backingArray[i]);
     }
   }
 
   Collection<T> filter(bool f(T element)) {
-    return Collections.filter(this, new GrowableObjectArray<T>(), f);
+    return Collections.filter(this, new List<T>(), f);
   }
 
   bool every(bool f(T element)) {
     return Collections.every(this, f);
   }
 
   bool some(bool f(T element)) {
     return Collections.some(this, f);
   }
 
   bool isEmpty() {
     return this.length === 0;
   }
 
   void clear() {
     this.length = 0;
   }
 
   void sort(int compare(T a, T b)) {
     DualPivotQuicksort.sort(this, compare);
   }
 
   Iterator<T> iterator() {
-    return new VariableSizeArrayIterator<T>(this);
+    return new ListIterator<T>(this);
   }
 }
 
 
-// Iterator for arrays with variable size.
-class VariableSizeArrayIterator<T> implements Iterator<T> {
-  VariableSizeArrayIterator(GrowableObjectArray<T> array)
-      : _array = array,  _pos = 0 {
-  }
+// Iterator for lists with variable size.
+class ListIterator<T> implements Iterator<T> {
+  ListIterator(List<T> this._list) : _pos = 0;
 
   bool hasNext() {
-    return _array._length > _pos;
+    return _list._length > _pos;
   }
 
   T next() {
     if (!hasNext()) {
       throw const NoMoreElementsException();
     }
-    return _array[_pos++];
+    return _list[_pos++];
   }
 
-  final GrowableObjectArray<T> _array;
+  final List<T> _list;
   int _pos;
 }