rename completion computer to contributor

pkg/analysis_server/test/services/completion/keyword_computer_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.
 
 library test.services.completion.dart.keyword;
 
 import 'package:analysis_server/src/protocol.dart';
 import 'package:analysis_server/src/services/completion/dart_completion_manager.dart';
 import 'package:analysis_server/src/services/completion/keyword_computer.dart';
 import 'package:analyzer/src/generated/scanner.dart';
 import 'package:unittest/unittest.dart';
 
 import '../../reflective_tests.dart';
 import 'completion_test_util.dart';
 
 main() {
   groupSep = ' | ';
-  runReflectiveTests(KeywordComputerTest);
+  runReflectiveTests(KeywordContributorTest);
 }
 
 @reflectiveTest
-class KeywordComputerTest extends AbstractCompletionTest {
+class KeywordContributorTest extends AbstractCompletionTest {
   static const List<Keyword> CLASS_BODY_KEYWORDS = const [
     Keyword.CONST,
     Keyword.DYNAMIC,
     Keyword.FACTORY,
     Keyword.FINAL,
     Keyword.GET,
     Keyword.OPERATOR,
     Keyword.SET,
     Keyword.STATIC,
     Keyword.VAR,
@@ skipping 119 matching lines @@
         expect(s.relevance, equals(relevance), reason: k.toString());
         expect(s.selectionOffset, equals(s.completion.length));
         expect(s.selectionLength, equals(0));
         expect(s.isDeprecated, equals(false));
         expect(s.isPotential, equals(false));
       }
     }
   }
 
   @override
-  void setUpComputer() {
-    computer = new KeywordComputer();
+  void setUpContributor() {
+    contributor = new KeywordContributor();
   }
 
   test_after_class() {
     addTestSource('class A {} ^');
     expect(computeFast(), isTrue);
     assertSuggestKeywords(DECLARATION_KEYWORDS, DART_RELEVANCE_HIGH);
   }
 
   test_after_class2() {
     addTestSource('class A {} c^');
@@ skipping 282 matching lines @@
     sorted.forEach((k) => msg.writeln('  Keyword.${k.name},'));
   }
 
   bool _equalSets(Iterable<Keyword> iter1, Iterable<Keyword> iter2) {
     if (iter1.length != iter2.length) return false;
     if (iter1.any((k) => !iter2.contains(k))) return false;
     if (iter2.any((k) => !iter1.contains(k))) return false;
     return true;
   }
 }