Update charted to 0.4.8 and roll

packages/quiver/test/collection/bimap_test.dart

 // Copyright 2013 Google Inc. All Rights Reserved.
 //
 // Licensed under the Apache License, Version 2.0 (the "License");
 // you may not use this file except in compliance with the License.
 // You may obtain a copy of the License at
 //
 //     http://www.apache.org/licenses/LICENSE-2.0
 //
 // Unless required by applicable law or agreed to in writing, software
 // distributed under the License is distributed on an "AS IS" BASIS,
 // WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
 // See the License for the specific language governing permissions and
 // limitations under the License.
 
 library quiver.collection.bimap_test;
 
 import 'package:quiver/collection.dart';
 import 'package:test/test.dart';
 
 main() {
   group('BiMap', () {
     test('should construct a HashBiMap', () {
       expect(new BiMap() is HashBiMap, true);
     });
   });
 
   group('HashBiMap', () {
     BiMap<String, int> map;
-    String k1 = 'k1',
-        k2 = 'k2',
-        k3 = 'k3';
-    int v1 = 1,
-        v2 = 2,
-        v3 = 3;
+    String k1 = 'k1', k2 = 'k2', k3 = 'k3';
+    int v1 = 1, v2 = 2, v3 = 3;
 
     setUp(() {
       map = new HashBiMap();
     });
 
     test('should initialize empty', () {
       expect(map.isEmpty, true);
       expect(map.isNotEmpty, false);
       expect(map.inverse.isEmpty, true);
       expect(map.inverse.isNotEmpty, false);
@@ skipping 281 matching lines @@
       var values = [];
       map.inverse.forEach((k, v) {
         keys.add(k);
         values.add(v);
       });
       expect(keys, unorderedEquals([v1, v2]));
       expect(values, unorderedEquals([k1, k2]));
     });
   });
 }