update keyword suggestion priorities

pkg/analysis_server/lib/src/services/completion/keyword_computer.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.completion.computer.dart.keyword;
 
 import 'dart:async';
 
 import 'package:analysis_server/src/protocol.dart';
 import 'package:analysis_server/src/services/completion/dart_completion_manager.dart';
@@ skipping 69 matching lines @@
               Keyword.OPERATOR,
               Keyword.SET,
               Keyword.STATIC,
               Keyword.VAR,
               Keyword.VOID]);
       return;
     }
     // Very simplistic suggestion because analyzer will warn if
     // the extends / with / implements keywords are out of order
     if (node.extendsClause == null) {
-      _addSuggestion(Keyword.EXTENDS);
+      _addSuggestion(Keyword.EXTENDS, CompletionRelevance.HIGH);
     } else if (node.withClause == null) {
-      _addSuggestion(Keyword.WITH);
+      _addSuggestion(Keyword.WITH, CompletionRelevance.HIGH);
     }
     if (node.implementsClause == null) {
-      _addSuggestion(Keyword.IMPLEMENTS);
+      _addSuggestion(Keyword.IMPLEMENTS, CompletionRelevance.HIGH);
     }
   }
 
   @override
   visitCompilationUnit(CompilationUnit node) {
     Directive firstDirective;
     int endOfDirectives = 0;
     if (node.directives.length > 0) {
       firstDirective = node.directives[0];
       endOfDirectives = node.directives.last.end - 1;
     }
     int startOfDeclarations = node.end;
     if (node.declarations.length > 0) {
       startOfDeclarations = node.declarations[0].offset;
       // If the first token is a simple identifier
       // and cursor position in within that first token
       // then consider cursor to be before the first declaration
       Token token = node.declarations[0].firstTokenAfterCommentAndMetadata;
       if (token.offset <= request.offset && request.offset <= token.end) {
         startOfDeclarations = token.end;
       }
     }
 
     // Simplistic check for library as first directive
     if (firstDirective is! LibraryDirective) {
       if (firstDirective != null) {
         if (request.offset <= firstDirective.offset) {
-          _addSuggestions([Keyword.LIBRARY]);
+          _addSuggestions([Keyword.LIBRARY], CompletionRelevance.HIGH);
         }
       } else {
         if (request.offset <= startOfDeclarations) {
-          _addSuggestions([Keyword.LIBRARY]);
+          _addSuggestions([Keyword.LIBRARY], CompletionRelevance.HIGH);
         }
       }
     }
     if (request.offset <= startOfDeclarations) {
-      _addSuggestions([Keyword.EXPORT, Keyword.IMPORT, Keyword.PART]);
+      _addSuggestions(
+          [Keyword.EXPORT, Keyword.IMPORT, Keyword.PART],
+          CompletionRelevance.HIGH);
     }
     if (request.offset >= endOfDirectives) {
       _addSuggestions(
           [
               Keyword.ABSTRACT,
               Keyword.CLASS,
               Keyword.CONST,
               Keyword.FINAL,
               Keyword.TYPEDEF,
-              Keyword.VAR]);
+              Keyword.VAR],
+          CompletionRelevance.HIGH);
     }
   }
 
   @override
   visitNode(AstNode node) {
     if (_isOffsetAfterNode(node)) {
       node.parent.accept(this);
     }
   }
 
   visitSimpleIdentifier(SimpleIdentifier node) {
     AstNode parent = node.getAncestor((n) => n is TopLevelVariableDeclaration);
     if (parent is TopLevelVariableDeclaration) {
       if (parent.variables != null &&
           parent.variables.type != null &&
           parent.variables.type.name == node) {
         AstNode unit = node.getAncestor((n) => n is CompilationUnit);
         if (unit is CompilationUnit) {
           visitCompilationUnit(unit);
         }
       }
     }
   }
 
-  void _addSuggestion(Keyword keyword) {
+  void _addSuggestion(Keyword keyword, [CompletionRelevance relevance =
+      CompletionRelevance.DEFAULT]) {
     String completion = keyword.syntax;
     request.suggestions.add(
         new CompletionSuggestion(
             CompletionSuggestionKind.KEYWORD,
-            CompletionRelevance.DEFAULT,
+            relevance,
             completion,
             completion.length,
             0,
             false,
             false));
   }
 
-  void _addSuggestions(List<Keyword> keywords) {
+  void _addSuggestions(List<Keyword> keywords, [CompletionRelevance relevance =
+      CompletionRelevance.DEFAULT]) {
     keywords.forEach((Keyword keyword) {
-      _addSuggestion(keyword);
+      _addSuggestion(keyword, relevance);
     });
   }
 
   bool _isOffsetAfterNode(AstNode node) {
     if (request.offset == node.end) {
       Token token = node.endToken;
       if (token != null && !token.isSynthetic) {
         if (token.lexeme == ';' || token.lexeme == '}') {
           return true;
         }
       }
     }
     return false;
   }
 }