Format all tests.

tests/corelib_strong/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 "package:expect/expect.dart";
 import 'dart:collection';
 
 abstract class QueueTest {
-
   Queue newQueue();
   Queue newQueueFrom(Iterable iterable);
 
   void testMain() {
     Queue queue = newQueue();
     checkQueue(queue, 0, 0);
 
     queue.addFirst(1);
     checkQueue(queue, 1, 1);
 
@@ skipping 41 matching lines @@
       return (value is int);
     }
 
     Expect.equals(true, queue.every(isInstanceOfInt));
 
     Expect.equals(false, queue.every(is10));
 
     bool is1(int value) {
       return (value == 1);
     }
+
     Expect.equals(false, queue.any(is1));
 
     queue.clear();
     Expect.equals(0, queue.length);
 
     var exception = null;
     try {
       queue.removeFirst();
     } on StateError catch (e) {
       exception = e;
@@ skipping 39 matching lines @@
     testLarge();
     testFromListToList();
   }
 
   void checkQueue(Queue queue, int expectedSize, int expectedSum) {
     testLength(expectedSize, queue);
     int sum = 0;
     void sumElements(int value) {
       sum += value;
     }
+
     queue.forEach(sumElements);
     Expect.equals(expectedSum, sum);
   }
 
   testLength(int length, Queue queue) {
     Expect.equals(length, queue.length);
     ((length == 0) ? Expect.isTrue : Expect.isFalse)(queue.isEmpty);
     ((length != 0) ? Expect.isTrue : Expect.isFalse)(queue.isNotEmpty);
   }
 
   void testAddAll() {
     Set<int> set = new Set<int>.from([1, 2, 4]);
     Expect.equals(3, set.length);
 
     Queue queue1 = newQueueFrom(set);
     Queue queue2 = newQueue();
     Queue queue3 = newQueue();
     testLength(3, queue1);
     testLength(0, queue2);
     testLength(0, queue3);
 
     queue2.addAll(set);
     testLength(3, queue2);
 
     queue3.addAll(queue1);
     testLength(3, queue3);
 
     int sum = 0;
-    void f(e) { sum += e; };
+    void f(e) {
+      sum += e;
+    }
+
+    ;
 
     set.forEach(f);
     Expect.equals(7, sum);
     sum = 0;
 
     queue1.forEach(f);
     Expect.equals(7, sum);
     sum = 0;
 
     queue2.forEach(f);
@@ skipping 84 matching lines @@
 
     for (int i = 0; i < N; i++) {
       queue.add(i);
       set.add(i);
     }
     Expect.equals(N, queue.length);
     Expect.isFalse(queue.isEmpty);
 
     Expect.equals(0, queue.elementAt(0));
     Expect.equals(N - 1, queue.elementAt(N - 1));
-    Expect.throws(() { queue.elementAt(-1); });
-    Expect.throws(() { queue.elementAt(N); });
+    Expect.throws(() {
+      queue.elementAt(-1);
+    });
+    Expect.throws(() {
+      queue.elementAt(N);
+    });
 
     Iterable skip1 = queue.skip(1);
     Iterable take1 = queue.take(1);
     Iterable mapped = queue.map((e) => -e);
 
     for (int i = 0; i < 500; i++) {
       Expect.equals(i, take1.first);
       Expect.equals(i, queue.first);
       Expect.equals(-i, mapped.first);
       Expect.equals(i + 1, skip1.first);
@@ skipping 14 matching lines @@
 
     queue.addAll(set);
     Expect.equals(N, queue.length);
     Expect.isFalse(queue.isEmpty);
 
     // Iterate.
     for (var element in queue) {
       Expect.isTrue(set.contains(element));
     }
 
-    queue.forEach((element) { Expect.isTrue(set.contains(element)); });
+    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);
   }
 
@@ skipping 151 matching lines @@
   Expect.equals(87, prev.element);
 
   Expect.equals(37, next.remove());
   Expect.equals(87, prev.element);
   Expect.equals(null, prev.nextEntry());
   Expect.equals(null, prev.previousEntry());
 
   Expect.equals(87, prev.remove());
 }
 
-
 main() {
   new DoubleLinkedQueueTest().testMain();
   new ListQueueTest().testMain();
   linkEntryTest();
 }