Implement search for other local elements.

pkg/analyzer/lib/src/dart/analysis/search.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.
 
 import 'dart:async';
 
 import 'package:analyzer/dart/ast/ast.dart';
 import 'package:analyzer/dart/ast/visitor.dart';
 import 'package:analyzer/dart/element/element.dart';
 import 'package:analyzer/dart/element/visitor.dart';
@@ skipping 11 matching lines @@
 
   /**
    * Returns references to the [element].
    */
   Future<List<SearchResult>> references(Element element) async {
     if (element == null) {
       return const <SearchResult>[];
     }
 
     ElementKind kind = element.kind;
-    if (kind == ElementKind.LABEL || kind == ElementKind.LOCAL_VARIABLE) {
+    if (kind == ElementKind.FUNCTION || kind == ElementKind.METHOD) {
+      if (element.enclosingElement is ExecutableElement) {
+        return _searchReferences_Local(element, (n) => n is Block);
+      }
+//      return _searchReferences_Function(element);
+    } else if (kind == ElementKind.LABEL || kind == ElementKind.LOCAL_VARIABLE) {
       return _searchReferences_Local(element, (n) => n is Block);
+    } else if (kind == ElementKind.TYPE_PARAMETER) {
+      return _searchReferences_Local(element, (n) => n is ClassDeclaration);
     }
     // TODO(scheglov) support other kinds
     return const <SearchResult>[];
   }
 
   Future<List<SearchResult>> _searchReferences_Local(
       Element element, bool isRootNode(AstNode n)) async {
     String path = element.source.fullName;
 
     // Prepare the unit.
@@ skipping 153 matching lines @@
   }
 
   void _addResult(AstNode node, SearchResultKind kind) {
     bool isQualified = node.parent is Label;
     var finder = new _ContainingElementFinder(node.offset);
     enclosingUnitElement.accept(finder);
     results.add(new SearchResult._(element, finder.containingElement, kind,
         node.offset, node.length, true, isQualified));
   }
 }