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

sdk/lib/collection/linked_hash_table.dart

 // Copyright (c) 2013, 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;
 
 /** Unique marker object for the head of a linked list of entries. */
 class _LinkedHashTableHeadMarker {
   const _LinkedHashTableHeadMarker();
 }
 
 const _LinkedHashTableHeadMarker _HEAD_MARKER =
     const _LinkedHashTableHeadMarker();
 
 class _LinkedHashTable<K> extends _HashTable<K> {
   static const _NEXT_INDEX = 1;
   static const _PREV_INDEX = 2;
   static const _HEAD_OFFSET = 0;
 
   _LinkedHashTable(int initialCapacity) : super(initialCapacity);
 
   int get _entrySize => 3;
 
   List _createTable(int capacity) {
-    List result = new List.fixedLength(capacity * _entrySize);
+    List result = new List(capacity * _entrySize);
     result[_HEAD_OFFSET] = _HEAD_MARKER;
     result[_HEAD_OFFSET + _NEXT_INDEX] = _HEAD_OFFSET;
     result[_HEAD_OFFSET + _PREV_INDEX] = _HEAD_OFFSET;
     return result;
   }
 
   int _next(int offset) => _table[offset + _NEXT_INDEX];
   void _setNext(int offset, int to) { _table[offset + _NEXT_INDEX] = to; }
 
   int _prev(int offset) => _table[offset + _PREV_INDEX];
@@ skipping 120 matching lines @@
     }
     _current = _getCurrent(_offset);
     _offset = _hashTable._next(_offset);
     return true;
   }
 
   T _getCurrent(int offset);
 
   T get current => _current;
 }