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

sdk/lib/collection/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;
 
 class _DeadEntry {
   const _DeadEntry();
 }
 
@@ skipping 56 matching lines @@
     // Value cycles after 2^30 modifications. If you keep hold of an
     // iterator for that long, you might miss a modification detection,
     // and iteration can go sour. Don't do that.
     _modificationCount = (_modificationCount + 1) & (0x3FFFFFFF);
   }
 
   /**
    * Create an empty table.
    */
   List _createTable(int capacity) {
-    List table = new List.fixedLength(capacity * _entrySize);
+    List table = new List(capacity * _entrySize);
     return table;
   }
 
   /** First table probe. */
   int _firstProbe(int hashCode, int capacity) {
     return hashCode & (capacity - 1);
   }
 
   /** Following table probes. */
   int _nextProbe(int previousIndex, int probeCount, int capacity) {
@@ skipping 307 matching lines @@
 }
 
 class _HashTableValueIterator<V> extends _HashTableIterator<V> {
   final int _entryIndex;
 
   _HashTableValueIterator(_HashTable hashTable, this._entryIndex)
       : super(hashTable);
 
   V _valueAt(int offset, Object key) => _hashTable._table[offset + _entryIndex];
 }