72   NodeId getMapped(const std::unique_ptr<SyntaxTree::Impl> &Tree,  in getMapped()  argument
74     if (&*Tree == &T1)  in getMapped()
76     assert(&*Tree == &T2 && "Invalid tree.");  in getMapped()
192   SyntaxTree::Impl &Tree;  member
194   PreorderVisitor(SyntaxTree::Impl &Tree) : Tree(Tree) {}  in PreorderVisitor()
198     Tree.Nodes.emplace_back();  in PreTraverse()
199     Node &N = Tree.getMutableNode(MyId);  in PreTraverse()
206       Node &P = Tree.getMutableNode(Parent);  in PreTraverse()
212     return std::make_tuple(MyId, Tree.getNode(MyId).Parent);  in PreTraverse()
220     Node &N = Tree.getMutableNode(MyId);  in PostTraverse()
223            N.RightMostDescendant < Tree.getSize() &&  in PostTraverse()
226       Tree.Leaves.push_back(MyId);  in PostTraverse()
229       N.Height = std::max(N.Height, 1 + Tree.getNode(Child).Height);  in PostTraverse()
232     if (isNodeExcluded(Tree.AST.getSourceManager(), D))  in TraverseDecl()
242     if (isNodeExcluded(Tree.AST.getSourceManager(), S))  in TraverseStmt()
251     if (isNodeExcluded(Tree.AST.getSourceManager(), Init))  in TraverseConstructorInitializer()
280 static std::vector<NodeId> getSubtreePostorder(const SyntaxTree::Impl &Tree,  in getSubtreePostorder()  argument
284     const Node &N = Tree.getNode(Id);  in getSubtreePostorder()
293 static std::vector<NodeId> getSubtreeBfs(const SyntaxTree::Impl &Tree,  in getSubtreeBfs()  argument
299     for (NodeId Child : Tree.getNode(Ids[Expanded++]).Children)  in getSubtreeBfs()
488   const SyntaxTree::Impl &Tree;  member in clang::diff::Subtree
497   Subtree(const SyntaxTree::Impl &Tree, NodeId SubtreeRoot) : Tree(Tree) {  in Subtree()  argument
498     RootIds = getSubtreePostorder(Tree, SubtreeRoot);  in Subtree()
508     return Tree.getNode(getIdInRoot(Id));  in getNode()
516     return Tree.PostorderIds[getIdInRoot(SNodeId(1))];  in getPostorderOffset()
519     return Tree.getNodeValue(getIdInRoot(Id));  in getNodeValue()
531       assert(I == Tree.PostorderIds[getIdInRoot(SI)] - getPostorderOffset() &&  in setLeftMostDescendants()
534       LeftMostDescendants[I] = SNodeId(Tree.PostorderIds[N.LeftMostDescendant] -  in setLeftMostDescendants()
709   const SyntaxTree::Impl &Tree;  member
710   HeightLess(const SyntaxTree::Impl &Tree) : Tree(Tree) {}  in HeightLess()
712     return Tree.getNode(Id1).Height < Tree.getNode(Id2).Height;  in operator ()()
720   const SyntaxTree::Impl &Tree;  member in clang::diff::__anonef34e5090611::PriorityList
726   PriorityList(const SyntaxTree::Impl &Tree)  in PriorityList()  argument
727       : Tree(Tree), Cmp(Tree), List(Cmp, Container) {}  in PriorityList()
747     return Tree.getNode(List.top()).Height;  in peekMax()
750     for (NodeId Child : Tree.getNode(Id).Children)  in open()