New 'use similar' fixes.

pkg/analysis_services/lib/src/correction/fix.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.
 
 // This code was auto-generated, is not intended to be edited, and is subject to
 // significant change. Please see the README file for more information.
 
 library services.src.correction.fix;
 
 import 'package:analysis_services/correction/change.dart';
 import 'package:analysis_services/correction/fix.dart';
+import 'package:analysis_services/search/hierarchy.dart';
 import 'package:analysis_services/search/search_engine.dart';
+import 'package:analysis_services/src/correction/levenshtein.dart';
 import 'package:analysis_services/src/correction/name_suggestion.dart';
 import 'package:analysis_services/src/correction/source_buffer.dart';
 import 'package:analysis_services/src/correction/source_range.dart' as rf;
 import 'package:analysis_services/src/correction/strings.dart';
 import 'package:analysis_services/src/correction/util.dart';
 import 'package:analyzer/src/generated/ast.dart';
 import 'package:analyzer/src/generated/element.dart';
 import 'package:analyzer/src/generated/error.dart';
 import 'package:analyzer/src/generated/java_core.dart';
 import 'package:analyzer/src/generated/parser.dart';
 import 'package:analyzer/src/generated/scanner.dart';
 import 'package:analyzer/src/generated/source.dart';
 import 'package:analyzer/src/generated/utilities_dart.dart';
 
 
 /**
+ * A predicate is a one-argument function that returns a boolean value.
+ */
+typedef bool Predicate<E>(E argument);
+
+
+/**
  * The computer for Dart fixes.
  */
 class FixProcessor {
   final SearchEngine searchEngine;
   final Source source;
   final String file;
   final CompilationUnit unit;
   final AnalysisError error;
   CompilationUnitElement unitElement;
   LibraryElement unitLibraryElement;
@@ skipping 972 matching lines @@
 
   void _addFix_replaceWithConstInstanceCreation() {
     if (coveredNode is InstanceCreationExpression) {
       var instanceCreation = coveredNode as InstanceCreationExpression;
       _addReplaceEdit(rf.rangeToken(instanceCreation.keyword), "const");
       _addFix(FixKind.USE_CONST, []);
     }
   }
 
   void _addFix_undefinedClass_useSimilar() {
-    // TODO(scheglov) implement
-//    if (_mayBeTypeIdentifier(node)) {
-//      String name = (node as SimpleIdentifier).name;
-//      QuickFixProcessorImpl_ClosestElementFinder finder =
-//          new QuickFixProcessorImpl_ClosestElementFinder(
-//              name,
-//              new Predicate_QuickFixProcessorImpl_addFix_undefinedClass_useSimilar());
-//      // find closest element
-//      {
-//        // elements of this library
-//        _unitLibraryElement.accept(
-//            new RecursiveElementVisitor_QuickFixProcessorImpl_addFix_undefinedClass_useSimilar(
-//                finder));
-//        // elements from imports
-//        for (ImportElement importElement in _unitLibraryElement.imports) {
-//          if (importElement.prefix == null) {
-//            Map<String, Element> namespace =
-//                CorrectionUtils.getImportNamespace(importElement);
-//            finder._update2(namespace.values);
-//          }
-//        }
-//      }
-//      // if we have close enough element, suggest to use it
-//      if (finder != null && finder._distance < 5) {
-//        String closestName = finder._element.name;
-//        _addReplaceEdit(SourceRangeFactory.rangeNode(node), closestName);
-//        // add proposal
-//        if (closestName != null) {
-//          _addFix(
-//              FixKind.CHANGE_TO,
-//              [closestName]);
-//        }
-//      }
-//    }
+    if (_mayBeTypeIdentifier(node)) {
+      String name = (node as SimpleIdentifier).name;
+      _ClosestElementFinder finder =
+          new _ClosestElementFinder(name, (Element element) => element is ClassElement);
+      // find closest element
+      {
+        // elements of this library
+        for (CompilationUnitElement unit in unitLibraryElement.units) {
+          finder._updateList(unit.types);
+        }
+        // elements from imports
+        for (ImportElement importElement in unitLibraryElement.imports) {
+          if (importElement.prefix == null) {
+            Map<String, Element> namespace = getImportNamespace(importElement);
+            finder._updateList(namespace.values);
+          }
+        }
+      }
+      // if we have close enough element, suggest to use it
+      if (finder != null && finder._distance < 5) {
+        String closestName = finder._element.name;
+        _addReplaceEdit(rf.rangeNode(node), closestName);
+        // add proposal
+        if (closestName != null) {
+          _addFix(FixKind.CHANGE_TO, [closestName]);
+        }
+      }
+    }
   }
 
   void _addFix_undefinedFunction_create() {
     // should be the name of the invocation
     if (node is SimpleIdentifier && node.parent is MethodInvocation) {
     } else {
       return;
     }
     String name = (node as SimpleIdentifier).name;
     MethodInvocation invocation = node.parent as MethodInvocation;
@@ skipping 27 matching lines @@
       _addFix_undefinedMethod_create_parameters(sb, invocation.argumentList);
       sb.append(") {${eol}}");
     }
     // insert source
     _insertBuilder(sb);
     _addLinkedPosition3('NAME', sb, rf.rangeNode(node));
     // add proposal
     _addFix(FixKind.CREATE_FUNCTION, [name]);
   }
 
   void _addFix_undefinedFunction_useSimilar() {

[Paul Berry, 2014/07/25 18:10:36]

Any way we could share code between this function and
_addFix_undefinedClass_useSimilar()?  They look almost the same.

-    // TODO(scheglov) implement
-//    if (node is SimpleIdentifier) {
-//      String name = (node as SimpleIdentifier).name;
-//      QuickFixProcessorImpl_ClosestElementFinder finder =
-//          new QuickFixProcessorImpl_ClosestElementFinder(
-//              name,
-//              new Predicate_QuickFixProcessorImpl_addFix_undefinedFunction_useSimilar());
-//      // this library
-//      _unitLibraryElement.accept(
-//          new RecursiveElementVisitor_QuickFixProcessorImpl_addFix_undefinedFunction_useSimilar(
-//              finder));
-//      // imports
-//      for (ImportElement importElement in _unitLibraryElement.imports) {
-//        if (importElement.prefix == null) {
-//          Map<String, Element> namespace =
-//              CorrectionUtils.getImportNamespace(importElement);
-//          finder._update2(namespace.values);
-//        }
-//      }
-//      // if we have close enough element, suggest to use it
-//      String closestName = null;
-//      if (finder != null && finder._distance < 5) {
-//        closestName = finder._element.name;
-//        _addReplaceEdit(SourceRangeFactory.rangeNode(node), closestName);
-//        _addFix(FixKind.CHANGE_TO, [closestName]);
-//      }
-//    }
+    if (node is SimpleIdentifier) {
+      String name = (node as SimpleIdentifier).name;
+      _ClosestElementFinder finder =
+          new _ClosestElementFinder(
+              name,
+              (Element element) => element is FunctionElement);
+      // this library
+      for (CompilationUnitElement unit in unitLibraryElement.units) {
+        finder._updateList(unit.functions);
+      }
+      // imports
+      for (ImportElement importElement in unitLibraryElement.imports) {
+        if (importElement.prefix == null) {
+          Map<String, Element> namespace = getImportNamespace(importElement);
+          finder._updateList(namespace.values);
+        }
+      }
+      // if we have close enough element, suggest to use it
+      String closestName = null;
+      if (finder != null && finder._distance < 5) {
+        closestName = finder._element.name;
+        _addReplaceEdit(rf.rangeNode(node), closestName);
+        _addFix(FixKind.CHANGE_TO, [closestName]);
+      }
+    }
   }
 
   void _addFix_undefinedMethod_create() {
     if (node is SimpleIdentifier && node.parent is MethodInvocation) {
       String name = (node as SimpleIdentifier).name;
       MethodInvocation invocation = node.parent as MethodInvocation;
       // prepare environment
       Source targetSource;
       String prefix;
       int insertOffset;
@@ skipping 96 matching lines @@
         excluded.add(favorite);
         sb.startPosition("ARG${i}");
         sb.append(favorite);
         sb.addProposals(suggestions);
         sb.endPosition();
       }
     }
   }
 
   void _addFix_undefinedMethod_useSimilar() {
-    // TODO(scheglov) implement
-//    if (node is SimpleIdentifier && node.parent is MethodInvocation) {
-//      MethodInvocation invocation = node.parent as MethodInvocation;
-//      String name = (node as SimpleIdentifier).name;
-//      QuickFixProcessorImpl_ClosestElementFinder finder =
-//          new QuickFixProcessorImpl_ClosestElementFinder(
-//              name,
-//              new Predicate_QuickFixProcessorImpl_addFix_undefinedMethod_useSimilar());
-//      // unqualified invocation
-//      Expression target = invocation.realTarget;
-//      if (target == null) {
-//        ClassDeclaration clazz =
-//            invocation.getAncestor((node) => node is ClassDeclaration);
-//        if (clazz != null) {
-//          ClassElement classElement = clazz.element;
-//          _updateFinderWithClassMembers(finder, classElement);
-//        }
-//      } else {
-//        DartType type = target.bestType;
-//        if (type is InterfaceType) {
-//          ClassElement classElement = type.element;
-//          _updateFinderWithClassMembers(finder, classElement);
-//        }
-//      }
-//      // if we have close enough element, suggest to use it
-//      String closestName = null;
-//      if (finder != null && finder._distance < 5) {
-//        closestName = finder._element.name;
-//        _addReplaceEdit(SourceRangeFactory.rangeNode(node), closestName);
-//        _addFix(FixKind.CHANGE_TO, [closestName]);
-//      }
-//    }
+    if (node is SimpleIdentifier && node.parent is MethodInvocation) {
+      MethodInvocation invocation = node.parent as MethodInvocation;
+      String name = (node as SimpleIdentifier).name;
+      _ClosestElementFinder finder =
+          new _ClosestElementFinder(name, (Element element) {
+        return element is MethodElement && !element.isOperator;
+      });
+      // unqualified invocation
+      Expression target = invocation.realTarget;
+      if (target == null) {
+        ClassDeclaration clazz =
+            invocation.getAncestor((node) => node is ClassDeclaration);
+        if (clazz != null) {
+          ClassElement classElement = clazz.element;
+          _updateFinderWithClassMembers(finder, classElement);
+        }
+      } else {
+        DartType type = target.bestType;
+        if (type is InterfaceType) {
+          ClassElement classElement = type.element;
+          _updateFinderWithClassMembers(finder, classElement);
+        }
+      }
+      // if we have close enough element, suggest to use it
+      String closestName = null;
+      if (finder != null && finder._distance < 5) {
+        closestName = finder._element.name;
+        _addReplaceEdit(rf.rangeNode(node), closestName);
+        _addFix(FixKind.CHANGE_TO, [closestName]);
+      }
+    }
   }
 
   void _addFix_useEffectiveIntegerDivision() {
     for (AstNode n = node; n != null; n = n.parent) {
       if (n is MethodInvocation &&
           n.offset == errorOffset &&
           n.length == errorLength) {
         MethodInvocation invocation = n as MethodInvocation;
         Expression target = invocation.target;
         while (target is ParenthesizedExpression) {
@@ skipping 565 matching lines @@
           expr.parent as ParenthesizedExpression;
       if (getExpressionParentPrecedence(parenthesized) > exprPrecedence) {
         break;
       }
       _addRemoveEdit(rf.rangeToken(parenthesized.leftParenthesis));
       _addRemoveEdit(rf.rangeToken(parenthesized.rightParenthesis));
       expr = parenthesized;
     }
   }
 
+  void _updateFinderWithClassMembers(_ClosestElementFinder finder,
+      ClassElement clazz) {
+    if (clazz != null) {
+      List<Element> members = getMembers(clazz);
+      finder._updateList(members);
+    }
+  }
+
   static void _addSuperTypeProposals(SourceBuilder sb,
       Set<DartType> alreadyAdded, DartType type) {
     if (type != null &&
         !alreadyAdded.contains(type) &&
         type.element is ClassElement) {
       alreadyAdded.add(type);
       ClassElement element = type.element as ClassElement;
       sb.addProposal(element.name);
       _addSuperTypeProposals(sb, alreadyAdded, element.supertype);
       for (InterfaceType interfaceType in element.interfaces) {
@@ skipping 28 matching lines @@
         return parent.realTarget == node;
       }
       if (parent is PrefixedIdentifier) {
         return parent.prefix == node;
       }
     }
     return false;
   }
 }
 
+/**
+ * Helper for finding [Element] with name closest to the given.
+ */
+class _ClosestElementFinder {
+  final String _targetName;
+  final Predicate<Element> _predicate;
+
+  Element _element = null;
+  int _distance = 1 << 10;
+
+  _ClosestElementFinder(this._targetName, this._predicate);
+
+  void _update(Element element) {
+    if (_predicate(element)) {
+      int memberDistance = getLevenshteinDistance(element.name, _targetName);

[Paul Berry, 2014/07/25 18:10:36]

Levenshtein distance is O(n*m) to compute in the worst case.  Would it be worth
making either of the following optimizations?

1. Pass _distance into getLevenshteinDistance().  If it determines that the edit
distance would be greater than _distance, it can bail out early.

2. Since the users of this class will reject any elements whose distance >= 5,
initialize _distance to 5 (or to a value supplied by the caller); that way we
don't waste time computing edit distances for strings that we would never
possibly use.  (Note: only useful if we also do 1).

[scheglov, 2014/07/25 18:53:29]

https://codereview.chromium.org/417263003

+      if (memberDistance < _distance) {
+        _element = element;
+        _distance = memberDistance;
+      }
+    }
+  }
+
+  void _updateList(Iterable<Element> elements) {
+    for (Element element in elements) {
+      _update(element);
+    }
+  }
+}
 
 /**
  * Describes the location for a newly created [ConstructorDeclaration].
  */
 class _ConstructorLocation {
   final String _prefix;
   final int _offset;
   final String _suffix;
 
   _ConstructorLocation(this._prefix, this._offset, this._suffix);
 }