Run formatter on a few frontend and kernel files that hadn't been formatted.

pkg/kernel/lib/class_hierarchy.dart

 // Copyright (c) 2016, 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.
 library kernel.class_hierarchy;
 
 import 'ast.dart';
 import 'dart:math';
 import 'dart:typed_data';
 import 'type_algebra.dart';
 
@@ skipping 383 matching lines @@
     return members;
   }
 
   /// Computes the list of implemented members, based on the declared instance
   /// members and inherited instance members.
   ///
   /// Both lists must be sorted by name beforehand.
   static List<Member> _inheritMembers(
       List<Member> declared, List<Member> inherited,
       {bool skipAbstractMembers: false}) {
-    List<Member> result = <Member>[]
-      ..length = declared.length + inherited.length;
+    List<Member> result = <Member>[]..length =
+        declared.length + inherited.length;
     // Since both lists are sorted, we can fuse them like in merge sort.
     int storeIndex = 0;
     int i = 0, j = 0;
     while (i < declared.length && j < inherited.length) {
       Member declaredMember = declared[i];
       Member inheritedMember = inherited[j];
       if (skipAbstractMembers && declaredMember.isAbstract) {
         ++i;
         continue;
       }
@@ skipping 477 matching lines @@
 
   ClassSet union(ClassSet other) {
     assert(_hierarchy == other._hierarchy);
     if (identical(_intervalList, other._intervalList)) return this;
     _IntervalListBuilder builder = new _IntervalListBuilder();
     builder.addIntervalList(_intervalList);
     builder.addIntervalList(other._intervalList);
     return new ClassSet(_hierarchy, builder.buildIntervalList());
   }
 }