Clean up (most) uses of Array. Still more to come in the VM corelib code base.

runtime/lib/immutable_map.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.
 // Immutable map class for compiler generated map literals.
 
 class ImmutableMap<K, V> implements Map<K, V> {
   final ImmutableArray kvPairs_;
 
   const ImmutableMap(ImmutableArray keyValuePairs)
       : kvPairs_ = keyValuePairs;
@@ skipping 19 matching lines @@
   }
 
   void forEach(void f(K key, V value)) {
     for (int i = 0; i < kvPairs_.length; i += 2) {
       f(kvPairs_[i], kvPairs_[i+1]);
     }
   }
 
   Collection<K> getKeys() {
     int numKeys = length;
-    Array<K> array = new Array<K>(numKeys);
+    List<K> list = new List<K>(numKeys);
     for (int i = 0; i < numKeys; i++) {
-      array[i] = kvPairs_[i*2];
+      list[i] = kvPairs_[i*2];
     }
-    return array;
+    return list;
   }
 
   Collection<V> getValues() {
     int numValues = length;
-    Array<K> array = new Array<K>(numValues);
+    List<K> list = new List<K>(numValues);
     for (int i = 0; i < numValues; i++) {
-      array[i] = kvPairs_[i*2 + 1];
+      list[i] = kvPairs_[i*2 + 1];
     }
-    return array;
+    return list;
   }
 
   bool containsKey(K key) {
     for (int i = 0; i < kvPairs_.length; i += 2) {
       if (key == kvPairs_[i]) {
         return true;
       }
     }
     return false;
   }
@@ skipping 35 matching lines @@
   // 2*n, the values at position 2*n+1.
   static fromLiteral(Array elements) {
     var map = new LinkedHashMap();
     var len = elements.length;
     for (int i = 1; i < len; i += 2) {
       map[elements[i-1]] = elements[i];
     }
     return map;
   }
 }