Collect getters in a FunctionSet while resolving.

lib/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.
 
 // 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 {
 
   FunctionSet(Compiler compiler) : super(compiler);
@@ skipping 28 matching lines @@
    * 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
         ? filterAllBySelector(selector)
         : filterHierarchyBySelector(selector);
   }
 
+  /**
+   * Returns whether the set has an element matching this selector.

[kasperl, 2012/09/11 07:39:11]

has any elements matching the given [selector].

[ngeoffray, 2012/09/11 08:51:08]

Done.

+   */
+  bool hasOneElementMatchingSelector(Selector selector) {

[kasperl, 2012/09/11 07:39:11]

hasAnyElementsMatchingSelector would be more correct.

[ngeoffray, 2012/09/11 08:51:08]

Done.

+    // TODO(kasperl): For now, we use a different implementation for
+    // filtering if the tree contains interface subtypes.
+    return containsInterfaceSubtypes
+        ? hasOneInAll(selector)
+        : hasOneInHierarchy(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
       // the applies method that takes types into account.
       if (member !== null && selector.applies(member, compiler)) {
         result.add(member);
       }
       return true;
     });
     return result;
   }
 
   Set<Element> filterHierarchyBySelector(Selector selector) {
     Set<Element> result = new Set<Element>();
     if (root === null) return result;
     visitHierarchy(selectorType(selector), (FunctionSetNode node) {
       Element member = node.membersByName[selector.name];
       if (member !== null && selector.appliesUntyped(member, compiler)) {
         result.add(member);
       }
       return true;
     });
     return result;
   }
 
+  bool hasOneInAll(Selector selector) {
+    bool result = false;
+    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
+      // the applies method that takes types into account.
+      if (member !== null && selector.applies(member, compiler)) {
+        result = true;
+        // End the traversal.
+        return false;
+      }
+      return true;
+    });
+    return result;
+  }
+
+  bool hasOneInHierarchy(Selector selector) {
+    bool result = false;
+    if (root === null) return result;
+    visitHierarchy(selectorType(selector), (FunctionSetNode node) {
+      Element member = node.membersByName[selector.name];
+      if (member !== null && selector.appliesUntyped(member, compiler)) {
+        result = true;
+        // End the traversal.
+        return false;
+      }
+      return true;
+    });
+    return result;
+  }
+
 }
 
 class FunctionSetNode extends PartialTypeTreeNode {
 
   final Map<SourceString, Element> membersByName;
 
   FunctionSetNode(ClassElement type) : super(type),
       membersByName = new Map<SourceString, Element>();
 
 }