Lines Matching defs:Matches
10 // Implements an algorithm to efficiently search for matches on AST nodes.
11 // Uses memoization to support recursive matches like HasDescendant.
14 // calling the Matches(...) method of each matcher we are running on each
83 // Creates an AST visitor that matches 'matcher' on all children or
100 Matches(false) {}
136 return Matches;
213 Matches = false;
239 // Sets 'Matched' to true if 'Matcher' matches 'Node' and:
251 if (Matcher->matches(ast_type_traits::DynTypedNode::create(Node), Finder,
253 Matches = true;
259 if (Matcher->matches(ast_type_traits::DynTypedNode::create(Node), Finder,
262 Matches = true;
288 bool Matches;
360 // find out whether the type name matches.
375 // Matches children or descendants of 'Node' with 'BaseMatcher'.
409 // Matches children or descendants of 'Node' with 'BaseMatcher'.
457 // Matches all registered matchers on the given node and calls the
458 // result callback for every node that matches.
528 if (MP.first.matches(Node, this, &Builder)) {
599 // Returns whether an ancestor of \p Node matches \p Matcher.
602 // case there are multiple matches) is breadth first search.
641 if (Matcher.matches(Parent, this, &Result.Nodes)) {
659 if (Matcher.matches(Queue.front(), this, &Result.Nodes)) {
702 // Returns true if 'TypeNode' has an alias that matches the given matcher.
710 if (Matcher.matches(*Alias, this, &Result)) {
812 if (Base.matches(*ClassDecl, this, &Result)) {
