New implementation of {,Linked}Hash{Set,Map}.

sdk/lib/collection/queue.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;
 
 /**
  * A [Queue] is a collection that can be manipulated at both ends. One
  * can iterate over the elements of a queue through [forEach] or with
  * an [Iterator].
@@ skipping 341 matching lines @@
     assert(_isPowerOf2(initialCapacity));
     _table = new List<E>.fixedLength(initialCapacity);
   }
 
   /**
    * Create a queue initially containing the elements of [source].
    */
   factory ListQueue.from(Iterable<E> source) {
     if (source is List) {
       int length = source.length;
-      ListQueue<E> queue = new ListQueue(length);
+      ListQueue<E> queue = new ListQueue(length + 1);
+      assert(queue._table.length > length);
       List sourceList = source;
       queue._table.setRange(0, length, sourceList, 0);
       queue._tail = length;
       return queue;
     } else {
       return new ListQueue<E>()..addAll(source);
     }
   }
 
   // Iterable interface.
@@ skipping 313 matching lines @@
     _queue._checkModification(_modificationCount);
     if (_position == _end) {
       _current = null;
       return false;
     }
     _current = _queue._table[_position];
     _position = (_position + 1) & (_queue._table.length - 1);
     return true;
   }
 }