71   NodeId getMapped(const std::unique_ptr<SyntaxTree::Impl> &Tree,  in getMapped()  argument
73     if (&*Tree == &T1)  in getMapped()
75     assert(&*Tree == &T2 && "Invalid tree.");  in getMapped()
193   SyntaxTree::Impl &Tree;  member
195   PreorderVisitor(SyntaxTree::Impl &Tree) : Tree(Tree) {}  in PreorderVisitor()
199     Tree.Nodes.emplace_back();  in PreTraverse()
200     Node &N = Tree.getMutableNode(MyId);  in PreTraverse()
207       Node &P = Tree.getMutableNode(Parent);  in PreTraverse()
213     return std::make_tuple(MyId, Tree.getNode(MyId).Parent);  in PreTraverse()
221     Node &N = Tree.getMutableNode(MyId);  in PostTraverse()
224            N.RightMostDescendant < Tree.getSize() &&  in PostTraverse()
227       Tree.Leaves.push_back(MyId);  in PostTraverse()
230       N.Height = std::max(N.Height, 1 + Tree.getNode(Child).Height);  in PostTraverse()
233     if (isNodeExcluded(Tree.AST.getSourceManager(), D))  in TraverseDecl()
243     if (isNodeExcluded(Tree.AST.getSourceManager(), S))  in TraverseStmt()
252     if (isNodeExcluded(Tree.AST.getSourceManager(), Init))  in TraverseConstructorInitializer()
281 static std::vector<NodeId> getSubtreePostorder(const SyntaxTree::Impl &Tree,  in getSubtreePostorder()  argument
285     const Node &N = Tree.getNode(Id);  in getSubtreePostorder()
294 static std::vector<NodeId> getSubtreeBfs(const SyntaxTree::Impl &Tree,  in getSubtreeBfs()  argument
300     for (NodeId Child : Tree.getNode(Ids[Expanded++]).Children)  in getSubtreeBfs()
489   const SyntaxTree::Impl &Tree;  member in clang::diff::Subtree
498   Subtree(const SyntaxTree::Impl &Tree, NodeId SubtreeRoot) : Tree(Tree) {  in Subtree()  argument
499     RootIds = getSubtreePostorder(Tree, SubtreeRoot);  in Subtree()
509     return Tree.getNode(getIdInRoot(Id));  in getNode()
517     return Tree.PostorderIds[getIdInRoot(SNodeId(1))];  in getPostorderOffset()
520     return Tree.getNodeValue(getIdInRoot(Id));  in getNodeValue()
532       assert(I == Tree.PostorderIds[getIdInRoot(SI)] - getPostorderOffset() &&  in setLeftMostDescendants()
535       LeftMostDescendants[I] = SNodeId(Tree.PostorderIds[N.LeftMostDescendant] -  in setLeftMostDescendants()
710   const SyntaxTree::Impl &Tree;  member
711   HeightLess(const SyntaxTree::Impl &Tree) : Tree(Tree) {}  in HeightLess()
713     return Tree.getNode(Id1).Height < Tree.getNode(Id2).Height;  in operator ()()
721   const SyntaxTree::Impl &Tree;  member in clang::diff::__anonb3398b060611::PriorityList
727   PriorityList(const SyntaxTree::Impl &Tree)  in PriorityList()  argument
728       : Tree(Tree), Cmp(Tree), List(Cmp, Container) {}  in PriorityList()
748     return Tree.getNode(List.top()).Height;  in peekMax()
751     for (NodeId Child : Tree.getNode(Id).Children)  in open()