Fix issue with the partial type tree and implemented interfaces.

lib/compiler/implementation/js_backend/selector_map.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.
 
 class SelectorMap<T> extends PartialTypeTree {
 
   SelectorMap(Compiler compiler) : super(compiler);
 
-  SelectorMapNode<T> newNode(ClassElement type)
+  SelectorMapNode<T> newSpecializedNode(ClassElement type)
       => new SelectorMapNode<T>(type);
 
   T operator [](Selector selector) {
     SelectorMapNode<T> node = findNode(selectorType(selector), false);
     if (node === null) return null;
     Link<SelectorValue<T>> selectors = node.selectorsByName[selector.name];
     if (selectors === null) return null;
     for (Link link = selectors; !link.isEmpty(); link = link.tail) {
       SelectorValue<T> existing = link.head;
       if (existing.selector.equalsUntyped(selector)) return existing.value;
@@ skipping 42 matching lines @@
   }
 
   /**
    * Visits all mappings for selectors that may be used to invoke the
    * given [member] element. If the [visit] function ever returns false,
    * we abort the traversal early.
    */
   void visitMatching(Element member, bool visit(Selector selector, T value)) {
     assert(member.isMember());
     if (root === null) return;
+    // TODO(kasperl): For now, we use a different implementation for
+    // visiting if the tree contains interface subtypes.
+    if (containsInterfaceSubtypes) {
+      visitAllMatching(member, visit);
+    } else {
+      visitHierarchyMatching(member, visit);
+    }
+  }
+
+  void visitAllMatching(Element member, bool visit(selector, value)) {
+    root.visitRecursively((SelectorMapNode<T> node) {
+      Link<SelectorValue<T>> selectors = node.selectorsByName[member.name];
+      if (selectors === null) return true;
+      for (Link link = selectors; !link.isEmpty(); link = link.tail) {
+        SelectorValue<T> existing = link.head;
+        Selector selector = existing.selector;
+        // Since we're running through the entire tree we have to use
+        // the applies method that takes types into account.
+        if (selector.applies(member, compiler)) {
+          if (!visit(selector, existing.value)) return false;
+        }
+      }
+      return true;
+    });
+  }
+
+  void visitHierarchyMatching(Element member, bool visit(selector, value)) {
     visitHierarchy(member.getEnclosingClass(), (SelectorMapNode<T> node) {
       Link<SelectorValue<T>> selectors = node.selectorsByName[member.name];
       if (selectors === null) return true;
       for (Link link = selectors; !link.isEmpty(); link = link.tail) {
         SelectorValue<T> existing = link.head;
         Selector selector = existing.selector;
         if (selector.appliesUntyped(member, compiler)) {
           if (!visit(selector, existing.value)) return false;
         }
       }
@@ skipping 11 matching lines @@
       selectorsByName = new Map<SourceString, Link<SelectorValue<T>>>();
 
 }
 
 class SelectorValue<T> {
   final Selector selector;
   T value;
   SelectorValue(this.selector, this.value);
   toString() => "$selector -> $value";
 }