• Home
  • Raw
  • Download

Lines Matching refs:SelectionTree

27 SelectionTree makeSelectionTree(const StringRef MarkedCode, ParsedAST &AST) {  in makeSelectionTree()
32 return SelectionTree::createRight(AST.getASTContext(), AST.getTokens(), in makeSelectionTree()
36 return SelectionTree::createRight( in makeSelectionTree()
42 return SelectionTree::createRight(AST.getASTContext(), AST.getTokens(), 0u, in makeSelectionTree()
47 Range nodeRange(const SelectionTree::Node *N, ParsedAST &AST) { in nodeRange()
63 std::string nodeKind(const SelectionTree::Node *N) { in nodeKind()
67 std::vector<const SelectionTree::Node *> allNodes(const SelectionTree &T) { in allNodes()
68 std::vector<const SelectionTree::Node *> Result = {&T.root()}; in allNodes()
70 const SelectionTree::Node *N = Result[I]; in allNodes()
78 bool verifyCommonAncestor(const SelectionTree::Node &Root, in verifyCommonAncestor()
79 const SelectionTree::Node *Common, in verifyCommonAncestor()
86 for (const SelectionTree::Node *Child : Root.Children) in verifyCommonAncestor()
489 TEST(SelectionTree, Metrics) { in TEST() argument
544 for (const SelectionTree::Node *N : allNodes(T)) in TEST()
545 if (N->Selected == SelectionTree::Complete) in TEST()
547 else if (N->Selected == SelectionTree::Partial) in TEST()
626 const SelectionTree::Node *Str = T.commonAncestor(); in TEST()
640 SelectionTree::createEach( in TEST()
642 Test.point("ambiguous"), [&](SelectionTree T) { in TEST()
654 SelectionTree::createEach(AST.getASTContext(), AST.getTokens(), in TEST()
656 [&](SelectionTree T) { in TEST()
663 SelectionTree::createEach(AST.getASTContext(), AST.getTokens(), in TEST()
665 [&](SelectionTree T) { in TEST()
672 SelectionTree::createEach(AST.getASTContext(), AST.getTokens(), in TEST()
674 [&](SelectionTree T) { in TEST()
682 SelectionTree::createEach(AST.getASTContext(), AST.getTokens(), in TEST()
684 [&](SelectionTree T) { in TEST()