Reformat tests/language/f-l using the 3.8 style.

Change-Id: I7dafd578cf8da38616ae25e5ce8dbbc7e3213014
Reviewed-on: https://dart-review.googlesource.com/c/sdk/+/425185
Reviewed-by: Lasse Nielsen <[email protected]>
Commit-Queue: Lasse Nielsen <[email protected]>
Auto-Submit: Bob Nystrom <[email protected]>

Author: munificent

tests/language/function/literals_test.dart

@@ -49,8 +49,18 @@ class FunctionLiteralsTest {
   }
 
   void testArrowArrow() {
-    checkIntFuncFunction(84, (x) => (y) => (x as int) + (y as int), 42);
-    checkIntFuncFunction(84, (dynamic x) => (y) => x + y, 42);
+    checkIntFuncFunction(
+      84,
+      (x) =>
+          (y) => (x as int) + (y as int),
+      42,
+    );
+    checkIntFuncFunction(
+      84,
+      (dynamic x) =>
+          (y) => x + y,
+      42,
+    );
   }
 
   void testArrowBlock() {

tests/language/function_type/test_generator.dart

@@ -439,47 +439,41 @@ List<FunctionType> buildFunctionTypes() {
     // new NominalType("List", "", [new NominalType("Function")]),
   ];
 
-  List<TypeLike?> basicsPlusNull =
-      [
-        basicTypes,
-        <TypeLike?>[null],
-      ].expand((x) => x).toList();
-
-  List<TypeLike?> basicsPlusNullPlusVoid =
-      [
-        basicsPlusNull,
-        [NominalType("void")],
-      ].expand((x) => x).toList();
-
-  List<TypeLike?> basicsPlusNullPlusB =
-      [
-        basicsPlusNull,
-        [
-          NominalType("B"),
-          NominalType("List", "", [NominalType("B")]),
-        ],
-      ].expand((x) => x).toList();
-
-  List<TypeLike?> basicsPlusNullPlusBPlusVoid =
-      [
-        basicsPlusNullPlusB,
-        [NominalType("void")],
-      ].expand((x) => x).toList();
-
-  List<TypeLike?> basicsPlusNullPlusA =
-      [
-        basicsPlusNull,
-        [
-          NominalType("A"),
-          NominalType("List", "", [NominalType("A")]),
-        ],
-      ].expand((x) => x).toList();
-
-  List<TypeLike?> basicsPlusNullPlusAPlusVoid =
-      [
-        basicsPlusNullPlusA,
-        [NominalType("void")],
-      ].expand((x) => x).toList();
+  List<TypeLike?> basicsPlusNull = [
+    basicTypes,
+    <TypeLike?>[null],
+  ].expand((x) => x).toList();
+
+  List<TypeLike?> basicsPlusNullPlusVoid = [
+    basicsPlusNull,
+    [NominalType("void")],
+  ].expand((x) => x).toList();
+
+  List<TypeLike?> basicsPlusNullPlusB = [
+    basicsPlusNull,
+    [
+      NominalType("B"),
+      NominalType("List", "", [NominalType("B")]),
+    ],
+  ].expand((x) => x).toList();
+
+  List<TypeLike?> basicsPlusNullPlusBPlusVoid = [
+    basicsPlusNullPlusB,
+    [NominalType("void")],
+  ].expand((x) => x).toList();
+
+  List<TypeLike?> basicsPlusNullPlusA = [
+    basicsPlusNull,
+    [
+      NominalType("A"),
+      NominalType("List", "", [NominalType("A")]),
+    ],
+  ].expand((x) => x).toList();
+
+  List<TypeLike?> basicsPlusNullPlusAPlusVoid = [
+    basicsPlusNullPlusA,
+    [NominalType("void")],
+  ].expand((x) => x).toList();
 
   List<FunctionType> buildFunctionTypes(
     TypeLike? returnType,

tests/language/generic/functions_test.dart

@@ -27,9 +27,8 @@ class BinaryTreeNode<K extends Comparable<K>, V> {
   BinaryTreeNode<K, V> insert(K key, V value) {
     int c = key.compareTo(_key);
     if (c == 0) return this;
-    var _insert =
-        (BinaryTreeNode<K, V>? t, K key, V value) =>
-            insertOpt<K, V>(t, key, value);
+    var _insert = (BinaryTreeNode<K, V>? t, K key, V value) =>
+        insertOpt<K, V>(t, key, value);
     BinaryTreeNode<K, V>? left = _left;
     BinaryTreeNode<K, V>? right = _right;
     if (c < 0) {
@@ -51,9 +50,8 @@ class BinaryTreeNode<K extends Comparable<K>, V> {
   }
 
   S foldPre<S>(S init, S f(V t, S s)) {
-    var _fold =
-        (BinaryTreeNode<K, V>? t, S s, S f(V t, S s)) =>
-            foldPreOpt<K, V, S>(t, s, f);
+    var _fold = (BinaryTreeNode<K, V>? t, S s, S f(V t, S s)) =>
+        foldPreOpt<K, V, S>(t, s, f);
     S s = init;
     s = f(_value, s);
     s = _fold(_left, s, f);

tests/language/generic/type_argument_substitution_test.dart

@@ -16,9 +16,8 @@ class B extends A<K> {}
 class X<T> {}
 
 main() {
-  var v =
-      new DateTime.now().millisecondsSinceEpoch != 42
-          ? new X<B>()
-          : new X<A<String>>();
+  var v = new DateTime.now().millisecondsSinceEpoch != 42
+      ? new X<B>()
+      : new X<A<String>>();
   Expect.isFalse(v is X<A<String>>);
 }

tests/language/generic_methods/generic_methods_test.dart

@@ -36,9 +36,8 @@ class BinaryTreeNode<K extends Comparable<K>, V> {
   BinaryTreeNode<K, V> insert(K key, V value) {
     int c = key.compareTo(_key);
     if (c == 0) return this;
-    var _insert =
-        (BinaryTreeNode<K, V>? node, K key, V value) =>
-            insertOpt<K, V>(node, key, value);
+    var _insert = (BinaryTreeNode<K, V>? node, K key, V value) =>
+        insertOpt<K, V>(node, key, value);
     BinaryTreeNode<K, V>? left = _left;
     BinaryTreeNode<K, V>? right = _right;
     if (c < 0) {
@@ -77,9 +76,8 @@ class BinaryTreeNode<K extends Comparable<K>, V> {
   }
 
   S foldPre<S>(S init, S f(V t, S s)) {
-    var _fold =
-        (BinaryTreeNode<K, V>? t, S s, S f(V t, S s)) =>
-            foldPreOpt<K, V, S>(t, s, f);
+    var _fold = (BinaryTreeNode<K, V>? t, S s, S f(V t, S s)) =>
+        foldPreOpt<K, V, S>(t, s, f);
     S s = init;
     s = f(_value, s);
     s = _fold(_left, s, f);

tests/language/implicit_creation/implicit_const_context_list_test.dart

@@ -24,18 +24,15 @@ main() {
   const c1 = <int>[42];
 
   // Inside const expression.
-  var c2 =
-      (const [
-        <int>[42],
-      ])[0]; // List element.
-  var c3 =
-      (const {
-        <int>[42]: 0,
-      }).keys.first; // Map key.
-  var c4 =
-      (const {
-        0: <int>[42],
-      }).values.first; // Map value.
+  var c2 = (const [
+    <int>[42],
+  ])[0]; // List element.
+  var c3 = (const {
+    <int>[42]: 0,
+  }).keys.first; // Map key.
+  var c4 = (const {
+    0: <int>[42],
+  }).values.first; // Map value.
   var c5 = (const C(<int>[42])).x; // Constructor argument.
 
   Expect.identical(c0, c1);

tests/language/implicit_creation/implicit_const_context_map_test.dart

@@ -24,18 +24,15 @@ main() {
   const c1 = <int, int>{37: 87};
 
   // Inside const expression.
-  var c2 =
-      (const [
-        <int, int>{37: 87},
-      ])[0]; // List element.
-  var c3 =
-      (const {
-        <int, int>{37: 87}: 0,
-      }).keys.first; // Map key.
-  var c4 =
-      (const {
-        0: <int, int>{37: 87},
-      }).values.first; // Map value.
+  var c2 = (const [
+    <int, int>{37: 87},
+  ])[0]; // List element.
+  var c3 = (const {
+    <int, int>{37: 87}: 0,
+  }).keys.first; // Map key.
+  var c4 = (const {
+    0: <int, int>{37: 87},
+  }).values.first; // Map value.
   var c5 = (const C(<int, int>{37: 87})).x; // Constructor argument.
 
   Expect.identical(c0, c1);

tests/language/inference_update_1/horizontal_inference_invocation_types_test.dart

@@ -8,9 +8,8 @@ import 'package:expect/static_type_helper.dart';
 
 testFunctionExpressionInvocation() {
   (<T>(T t, void Function(T) f) => t)(0, (x) {
-        x.expectStaticType<Exactly<int>>();
-      })
-      .expectStaticType<Exactly<int>>();
+    x.expectStaticType<Exactly<int>>();
+  }).expectStaticType<Exactly<int>>();
 }
 
 testInstanceCreation() {

tests/language/inference_update_2/promotion_narrows_interface_test.dart

@@ -17,7 +17,8 @@ class A {
 }
 
 class B extends A {
-  int Function(num) get getter => (_) => 0;
+  int Function(num) get getter =>
+      (_) => 0;
   int method(num value) => 0;
   int call(num value) => 0;
   int operator [](num index) => 0;

tests/language/inference_update_2/top_level_type_inference_test.dart

@@ -29,17 +29,17 @@ class C {
 
   late final instancePromotableViaThis = _promotable != null ? _promotable : 0;
 
-  late final instanceNotPromotableViaThis =
-      _notPromotable != null ? _notPromotable : 0;
+  late final instanceNotPromotableViaThis = _notPromotable != null
+      ? _notPromotable
+      : 0;
 }
 
 class D {
   int? _notPromotable;
 }
 
-final topLevelPromotable = ((C c) => c._promotable != null ? c._promotable : 0)(
-  new C(0),
-);
+final topLevelPromotable = ((C c) =>
+    c._promotable != null ? c._promotable : 0)(new C(0));
 
 final topLevelNotPromotable = ((C c) =>
     c._notPromotable != null ? c._notPromotable : 0)(new C(0));