Change new List(n) to return fixed length list.

sdk/lib/_collection_dev/iterable.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.
 
 part of dart._collection.dev;
 
 /**
  * An [Iterable] for classes that have efficient [length] and [elementAt].
  *
  * All other methods are implemented in terms of [length] and [elementAt],
@@ skipping 201 matching lines @@
   }
 
   Iterable<E> skip(int count) => new SubListIterable(this, count, null);
 
   Iterable<E> skipWhile(bool test(E element)) => super.skipWhile(test);
 
   Iterable<E> take(int count) => new SubListIterable(this, 0, count);
 
   Iterable<E> takeWhile(bool test(E element)) => super.takeWhile(test);
 
-  List<E> toList() {
-    List<E> result = new List(length);
+  List<E> toList({ bool growable: false }) {
+    List<E> result;
+    if (growable) {
+      result = new List<E>()..length = length;
+    } else {
+      result = new List<E>(length);
+    }
     for (int i = 0; i < length; i++) {
       result[i] = elementAt(i);
     }
     return result;
   }
 
   Set<E> toSet() {
     Set<E> result = new Set<E>();
     for (int i = 0; i < length; i++) {
       result.add(elementAt(i));
@@ skipping 435 matching lines @@
   }
 
   Iterable<E> skip(int count) => this;
 
   Iterable<E> skipWhile(bool test(E element)) => this;
 
   Iterable<E> take(int count) => this;
 
   Iterable<E> takeWhile(bool test(E element)) => this;
 
-  List toList() => <E>[];
+  List toList({ bool growable: false }) => growable ? <E>[] : new List<E>(0);
 
   Set toSet() => new Set<E>();
 }
 
 /** The always empty iterator. */
 class EmptyIterator<E> implements Iterator<E> {
   const EmptyIterator();
   bool moveNext() => false;
   E get current => null;
 }
 
 /** An [Iterator] that can move in both directions. */
 abstract class BidirectionalIterator<T> implements Iterator<T> {
   bool movePrevious();
 }