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

tests/corelib/queue_test.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.
 
 library queue.test;
 
 import 'dart:collection';
 
 abstract class QueueTest {
 
@@ skipping 100 matching lines @@
     queue.add(0);
     for (int i = 0; i < 255; i++) {
       queue.add(i + 1);
       Expect.equals(i, queue.removeFirst());
     }
     Expect.equals(255, queue.removeFirst());
     Expect.isTrue(queue.isEmpty);
 
     testAddAll();
     testLarge();
+    testFromListToList();
   }
 
   void checkQueue(Queue queue, int expectedSize, int expectedSum) {
     Expect.equals(expectedSize, queue.length);
     int sum = 0;
     void sumElements(int value) {
       sum += value;
     }
     queue.forEach(sumElements);
     Expect.equals(expectedSum, sum);
@@ skipping 100 matching lines @@
     queue.forEach((element) { Expect.isTrue(set.contains(element)); });
 
     queue.addAll(set);
     Expect.equals(N * 2, queue.length);
     Expect.isFalse(queue.isEmpty);
 
     queue.clear();
     Expect.equals(0, queue.length);
     Expect.isTrue(queue.isEmpty);
   }
+
+  void testFromListToList() {
+    const int N = 256;
+    List list = [];
+    for (int i = 0; i < N; i++) {
+      Queue queue = newQueueFrom(list);
+
+      Expect.equals(list.length, queue.length);
+      List to = queue.toList();
+      Expect.listEquals(list, to);
+
+      queue.add(i);
+      list.add(i);
+      Expect.equals(list.length, queue.length);
+      to = queue.toList();
+      Expect.listEquals(list, to);
+    }
+  }
 }
 
 class ListQueueTest extends QueueTest {
   Queue newQueue() => new ListQueue();
   Queue newQueueFrom(Iterable elements) => new ListQueue.from(elements);
 }
 
 class DoubleLinkedQueueTest extends QueueTest {
   Queue newQueue() => new DoubleLinkedQueue();
   Queue newQueueFrom(Iterable elements) => new DoubleLinkedQueue.from(elements);
@@ skipping 68 matching lines @@
   q.addAll(i255.skip(35).take(96));
   q.addAll(i255.skip(35 + 96));
   Expect.listEquals(i255.toList(), q.toList());
 }
 
 main() {
   new DoubleLinkedQueueTest().testMain();
   new ListQueueTest().testMain();
   trickyTest();
 }