Chromium Code Reviews
chromiumcodereview-hr@appspot.gserviceaccount.com (chromiumcodereview-hr) | Please choose your nickname with Settings | Help | Chromium Project | Gerrit Changes | Sign out
(315)

Unified Diff: tests/corelib_strong/queue_test.dart

Issue 2771453003: Format all tests. (Closed)
Patch Set: Format files Created 3 years, 8 months ago
Use n/p to move between diff chunks; N/P to move between comments. Draft comments are only viewable by you.
Jump to:
View side-by-side diff with in-line comments
Download patch
Index: tests/corelib_strong/queue_test.dart
diff --git a/tests/corelib_strong/queue_test.dart b/tests/corelib_strong/queue_test.dart
index e9a96b8dc66c586ee0d4d7b5ffa7ca9bfe288521..b169bcf36a4d7dd0a7d0a7cecc50803be0156208 100644
--- a/tests/corelib_strong/queue_test.dart
+++ b/tests/corelib_strong/queue_test.dart
@@ -8,7 +8,6 @@ import "package:expect/expect.dart";
import 'dart:collection';
abstract class QueueTest {
-
Queue newQueue();
Queue newQueueFrom(Iterable iterable);
@@ -70,6 +69,7 @@ abstract class QueueTest {
bool is1(int value) {
return (value == 1);
}
+
Expect.equals(false, queue.any(is1));
queue.clear();
@@ -129,6 +129,7 @@ abstract class QueueTest {
void sumElements(int value) {
sum += value;
}
+
queue.forEach(sumElements);
Expect.equals(expectedSum, sum);
}
@@ -157,7 +158,11 @@ abstract class QueueTest {
testLength(3, queue3);
int sum = 0;
- void f(e) { sum += e; };
+ void f(e) {
+ sum += e;
+ }
+
+ ;
set.forEach(f);
Expect.equals(7, sum);
@@ -262,8 +267,12 @@ abstract class QueueTest {
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);
@@ -298,7 +307,9 @@ abstract class QueueTest {
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);
@@ -470,7 +481,6 @@ void linkEntryTest() {
Expect.equals(87, prev.remove());
}
-
main() {
new DoubleLinkedQueueTest().testMain();
new ListQueueTest().testMain();

Powered by Google App Engine
This is Rietveld 408576698