Format all tests.

tests/language/generic_functions_test.dart

Index: tests/language/generic_functions_test.dart
diff --git a/tests/language/generic_functions_test.dart b/tests/language/generic_functions_test.dart
index f7ae6bb2c47be2e448ce84deed94a80452f2a60e..6d22283a88bdab04a0a06a13a540a34f56a4f907 100644
--- a/tests/language/generic_functions_test.dart
+++ b/tests/language/generic_functions_test.dart
@@ -19,8 +19,9 @@ class BinaryTreeNode<K extends Comparable<K>, V> {
   final BinaryTreeNode<K, V> _right;
 
   BinaryTreeNode(this._key, this._value,
-      {BinaryTreeNode<K, V> left: null, BinaryTreeNode<K, V> right: null}) :
-        _left = left, _right = right;
+      {BinaryTreeNode<K, V> left: null, BinaryTreeNode<K, V> right: null})
+      : _left = left,
+        _right = right;
 
   BinaryTreeNode<K, V> insert(K key, V value) {
     int c = key.compareTo(_key);
@@ -37,13 +38,10 @@ class BinaryTreeNode<K extends Comparable<K>, V> {
     return new BinaryTreeNode<K, V>(_key, _value, left: left, right: right);
   }
 
-  BinaryTreeNode<K, U> map<U>(U f(V x)){
+  BinaryTreeNode<K, U> map<U>(U f(V x)) {
     var _map = (BinaryTreeNode<K, V> t, U f(V x)) => mapOpt<K, V, U>(t, f);
-    return new BinaryTreeNode<K, U>(
-        _key,
-        f(_value),
-        left: _map(_left, f),
-        right: _map(_right, f));
+    return new BinaryTreeNode<K, U>(_key, f(_value),
+        left: _map(_left, f), right: _map(_right, f));
   }
 
   S foldPre<S>(S init, S f(V t, S s)) {