Migrate test block 11 to Dart 2.0.

tests/corelib_2/iterable_reduce_test.dart

 // Copyright (c) 2014, 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.
 
 import "package:expect/expect.dart";
 import 'dart:collection';
 import 'dart:typed_data';
 
 class MyList extends ListBase {
   List list;
@@ skipping 18 matching lines @@
     new List(3)
       ..[0] = 1
       ..[1] = 2
       ..[2] = 3,
     {1: 1, 2: 2, 3: 3}.keys,
     {1: 1, 2: 2, 3: 3}.values,
     new Iterable.generate(3, (x) => x + 1),
     new List.generate(3, (x) => x + 1),
     [0, 1, 2, 3].where((x) => x > 0),
     [0, 1, 2].map((x) => x + 1),
-    [
-      [1, 2],
-      [3]
-    ].expand(id),
+    [ //# 01: ok
+      [1, 2], //# 01: ok
+      [3]  //# 01: ok
+    ].expand(id), //# 01: ok
     [3, 2, 1].reversed,
     [0, 1, 2, 3].skip(1),
     [1, 2, 3, 4].take(3),
     new Uint8List(3)
       ..[0] = 1
       ..[1] = 2
       ..[2] = 3,
     (new HashMap()
           ..[1] = 1
           ..[2] = 2
@@ skipping 15 matching lines @@
           ..[2] = 3)
         .values,
     new HashSet()..add(1)..add(2)..add(3),
     new LinkedHashSet()..add(1)..add(2)..add(3),
     new SplayTreeSet()..add(1)..add(2)..add(3),
     "\x01\x02\x03".codeUnits,
     "\x01\x02\x03".runes,
     new MyList([1, 2, 3]),
   ]) {
     int callCount = 0;
-    var result = iterable.reduce((x, y) {
-      callCount++;
-      return x + y;
-    });
-    Expect.equals(6, result, "${iterable.runtimeType}");
-    Expect.equals(2, callCount);
+    var result = iterable.reduce((x, y) { //# 01: ok
+      callCount++; //# 01: ok
+      return x + y; //# 01: ok
+    }); //# 01: ok
+    Expect.equals(6, result, "${iterable.runtimeType}"); //# 01: ok
+    Expect.equals(2, callCount); //# 01: ok
   }
 
   // Empty iterables not allowed.
   for (var iterable in [
     const [],
     [],
     new List(0),
     {}.keys,
     {}.values,
     new Iterable.generate(0, (x) => x + 1),
     new List.generate(0, (x) => x + 1),
     [0, 1, 2, 3].where((x) => false),
     [].map((x) => x + 1),
-    [[], []].expand(id),
+    [[], []].expand(id), //# 01: ok
     [].reversed,
     [0, 1, 2, 3].skip(4),
     [1, 2, 3, 4].take(0),
     new Uint8List(0),
     (new HashMap()).keys,
     (new HashMap()).values,
     (new SplayTreeMap()).keys,
     (new SplayTreeMap()).values,
     new HashSet(),
     new LinkedHashSet(),
@@ skipping 11 matching lines @@
   for (var iterable in [
     const [1],
     [1],
     new List(1)..[0] = 1,
     {1: 1}.keys,
     {1: 1}.values,
     new Iterable.generate(1, (x) => x + 1),
     new List.generate(1, (x) => x + 1),
     [0, 1, 2, 3].where((x) => x == 1),
     [0].map((x) => x + 1),
-    [
-      [],
-      [1]
-    ].expand(id),
+    [ //# 01: ok
+      [], //# 01: ok
+      [1] //# 01: ok
+    ].expand(id), //# 01: ok
     [1].reversed,
     [0, 1].skip(1),
     [1, 2, 3, 4].take(1),
     new Uint8List(1)..[0] = 1,
     (new HashMap()..[1] = 0).keys,
     (new HashMap()..[0] = 1).values,
     (new SplayTreeMap()..[1] = 0).keys,
     (new SplayTreeMap()..[0] = 1).values,
     new HashSet()..add(1),
     new LinkedHashSet()..add(1),
     new SplayTreeSet()..add(1),
     "\x01".codeUnits,
     "\x01".runes,
     new MyList([1]),
   ]) {
-    Expect.equals(1, iterable.reduce((x, y) => throw "Unreachable"));
+    Expect.equals(1, iterable.reduce((x, y) => throw "Unreachable")); //# 01: ok
   }
 
   // Concurrent modifications not allowed.
   testModification(base, modify, transform) {
     var iterable = transform(base);
     Expect.throws(() {
       iterable.reduce((x, y) {
         modify(base);
         return x + y;
       });
@@ skipping 37 matching lines @@
     ..[1] = 1
     ..[2] = 2
     ..[3] = 3;
   testModification(splayMap, put4, (x) => x.keys);
   splayMap = new SplayTreeMap()
     ..[1] = 1
     ..[2] = 2
     ..[3] = 3;
   testModification(splayMap, put4, (x) => x.values);
 }