Add a type kind to TypedSelector. A typed selector can either be

sdk/lib/_internal/compiler/implementation/universe/function_set.dart

 // Copyright (c) 2012, 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.
 
 part of universe;
 
 // TODO(kasperl): This actually holds getters and setters just fine
 // too and stricly they aren't functions. Maybe this needs a better
 // name -- something like ElementSet seems a bit too generic.
 class FunctionSet extends PartialTypeTree {
@@ skipping 19 matching lines @@
 
   // TODO(kasperl): Allow static members too?
   bool contains(Element element) {
     assert(element.isMember());
     FunctionSetNode node = findNode(element.getEnclosingClass(), false);
     return (node != null)
         ? node.membersByName.containsKey(element.name)
         : false;
   }
 
+  bool shouldDoVisitAll(Selector selector) {

[kasperl, 2013/02/11 08:18:12]

shouldVisitAll

[ngeoffray, 2013/02/11 10:20:55]

Done.

+    return containsInterfaceSubtypes
+        && (selector.typeKind == TypedSelectorKind.INTERFACE
+            || selector.typeKind == TypedSelectorKind.UNKNOWN);
+  }
+
   /**
    * Returns all elements that may be invoked with the given [selector].
    */
   Set<Element> filterBySelector(Selector selector) {
     // TODO(kasperl): For now, we use a different implementation for
     // filtering if the tree contains interface subtypes.
-    return containsInterfaceSubtypes
+    return shouldDoVisitAll(selector)
         ? filterAllBySelector(selector)
         : filterHierarchyBySelector(selector);
   }
 
   /**
    * Returns whether the set has any element matching the given
    * [selector].
    */
   bool hasAnyElementMatchingSelector(Selector selector) {
     // TODO(kasperl): For now, we use a different implementation for
     // filtering if the tree contains interface subtypes.
-    return containsInterfaceSubtypes
+    return shouldDoVisitAll(selector)
         ? hasAnyInAll(selector)
         : hasAnyInHierarchy(selector);
   }
 
   Set<Element> filterAllBySelector(Selector selector) {
     Set<Element> result = new Set<Element>();
     if (root == null) return result;
     root.visitRecursively((FunctionSetNode node) {
       Element member = node.membersByName[selector.name];
       // Since we're running through the entire tree we have to use
@@ skipping 62 matching lines @@
 }
 
 class FunctionSetNode extends PartialTypeTreeNode {
 
   final Map<SourceString, Element> membersByName;
 
   FunctionSetNode(ClassElement type) : super(type),
       membersByName = new Map<SourceString, Element>();
 
 }