Update charted to 0.4.8 and roll

packages/quiver/test/collection/treeset_test.dart

Index: packages/quiver/test/collection/treeset_test.dart
diff --git a/packages/quiver/test/collection/treeset_test.dart b/packages/quiver/test/collection/treeset_test.dart
index 9e23cc7f6df53d0937bffb62e9725bbbee63838c..526f239c782a46da8fe7202546dc20eaf2545c9a 100644
--- a/packages/quiver/test/collection/treeset_test.dart
+++ b/packages/quiver/test/collection/treeset_test.dart
@@ -190,8 +190,8 @@ main() {
 
           it = tree.fromIterator(30, inclusive: false);
           expect(it.current, isNull, reason: "iteration starts with null");
-          expect(
-              it.movePrevious(), isTrue, reason: "moveNext() from spot works");
+          expect(it.movePrevious(), isTrue,
+              reason: "moveNext() from spot works");
           expect(it.current, equals(21));
         });
 
@@ -216,14 +216,14 @@ main() {
         test("inserted endpoint, non-inclusive, reversed, works backward", () {
           var it = tree.fromIterator(10, inclusive: false, reversed: true);
           expect(it.current, isNull, reason: "iteration starts with null");
-          expect(
-              it.movePrevious(), isTrue, reason: "moveNext() from spot works");
+          expect(it.movePrevious(), isTrue,
+              reason: "moveNext() from spot works");
           expect(it.current, equals(15));
 
           it = tree.fromIterator(30, inclusive: false, reversed: true);
           expect(it.current, isNull, reason: "iteration starts with null");
-          expect(
-              it.movePrevious(), isFalse, reason: "moveNext() from spot works");
+          expect(it.movePrevious(), isFalse,
+              reason: "moveNext() from spot works");
         });
       });
 
@@ -313,21 +313,30 @@ main() {
         sortedTestSet = new TreeSet()..addAll(nonSortedTestSet);
       });
 
-      test("union with non sorted set", () =>
-          expect(tree.union(nonSortedTestSet).toList(), equals(expectedUnion)));
-      test("union with sorted set", () =>
-          expect(tree.union(sortedTestSet).toList(), equals(expectedUnion)));
-      test("intersection with non sorted set", () => expect(
-          tree.intersection(nonSortedTestSet).toList(),
-          equals(expectedIntersection)));
-      test("intersection with sorted set", () => expect(
-          tree.intersection(sortedTestSet).toList(),
-          equals(expectedIntersection)));
-      test("difference with non sorted set", () => expect(
-          tree.difference(nonSortedTestSet).toList(),
-          equals(expectedDifference)));
-      test("difference with sorted set", () => expect(
-          tree.difference(sortedTestSet).toList(), equals(expectedDifference)));
+      test(
+          "union with non sorted set",
+          () => expect(
+              tree.union(nonSortedTestSet).toList(), equals(expectedUnion)));
+      test(
+          "union with sorted set",
+          () => expect(
+              tree.union(sortedTestSet).toList(), equals(expectedUnion)));
+      test(
+          "intersection with non sorted set",
+          () => expect(tree.intersection(nonSortedTestSet).toList(),
+              equals(expectedIntersection)));
+      test(
+          "intersection with sorted set",
+          () => expect(tree.intersection(sortedTestSet).toList(),
+              equals(expectedIntersection)));
+      test(
+          "difference with non sorted set",
+          () => expect(tree.difference(nonSortedTestSet).toList(),
+              equals(expectedDifference)));
+      test(
+          "difference with sorted set",
+          () => expect(tree.difference(sortedTestSet).toList(),
+              equals(expectedDifference)));
     });
 
     group("AVL implementaiton", () {