Fix bug in queue_test.

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 99 matching lines @@
     queue = newQueue();
     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();
+    testLengthChanges();
     testLarge();
     testFromListToList();
   }
 
   void checkQueue(Queue queue, int expectedSize, int expectedSum) {
     Expect.equals(expectedSize, queue.length);
     int sum = 0;
     void sumElements(int value) {
       sum += value;
     }
@@ skipping 61 matching lines @@
     // modifications;
     Queue queue = newQueue();
     testLength(0, queue);
 
     for (int i = 1; i <= 10; i++) {
       queue.add(i);
       testLength(i, queue);
     }
 
     for (int i = 1; i <= 10; i++) {
-      queue.addFirst(i);
+      queue.addFirst(11 - i);
       testLength(10 + i, queue);
     }
 
     for (int i = 1; i <= 10; i++) {
       queue.addLast(i);
       testLength(20 + i, queue);
     }
 
     queue.addAll([1, 2, 3, 4, 5, 6, 7, 8, 9, 10]);
     testLength(40, queue);
@@ skipping 10 matching lines @@
 
     queue.remove(10);
     testLength(29, queue);
 
     queue.removeAll([4, 6]);
     testLength(23, queue);
 
     queue.retainAll([1, 3, 5, 7, 9, 10]);  // Remove 2 and 8.
     testLength(17, queue);
 
-    queue.removeMatching((x) = x == 7);
+    queue.removeMatching((x) => x == 7);
     testLength(14, queue);
 
-    queue.retainMatching((x) = x != 3);
+    queue.retainMatching((x) => x != 3);
     testLength(11, queue);
 
     Expect.listEquals([9, 1, 5, 9, 10, 1, 5, 9, 10, 1, 5], queue.toList());
   }
 
   void testLarge() {
     int N = 10000;
     Set set = new Set();
 
     Queue queue = newQueue();
@@ skipping 157 matching lines @@
     }
     Expect.equals(null, entry2);
   }
 }
 
 
 main() {
   new DoubleLinkedQueueTest().testMain();
   new ListQueueTest().testMain();
 }