Reformat code to minimize churn

pkg/analysis_server/lib/src/services/search/search_engine_internal.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.
 
 library services.src.search.search_engine;
 
 import 'dart:async';
 
 import 'package:analysis_server/analysis/index/index_core.dart';
 import 'package:analysis_server/src/services/correction/source_range.dart';
@@ skipping 189 matching lines @@
   _Requestor(this.index);
 
   void add(Element element, RelationshipImpl relationship, MatchKind kind) {
     Future relationsFuture =
         index.getRelationships(new IndexableElement(element), relationship);
     Future matchesFuture = relationsFuture.then((List<LocationImpl> locations) {
       List<SearchMatch> matches = <SearchMatch>[];
       for (LocationImpl location in locations) {
         IndexableObject indexable = location.indexable;
         if (indexable is IndexableElement) {
-          matches.add(new SearchMatch(kind, indexable.element,
+          matches.add(new SearchMatch(
+              kind,
+              indexable.element,
               new SourceRange(location.offset, location.length),
-              location.isResolved, location.isQualified));
+              location.isResolved,
+              location.isQualified));
         }
       }
       return matches;
     });
     futures.add(matchesFuture);
   }
 
   Future<List<SearchMatch>> merge() {
     return Future.wait(futures).then((List<List<SearchMatch>> matchesList) {
       return matchesList.expand((matches) => matches).toList();
     });
   }
 }