567                      const SyntaxTree::Impl &T2, NodeId Id1, NodeId Id2)  in ZhangShashaMatcher()
618             NodeId Id1 = S1.getIdInRoot(Row);  in getMatchingNodes()  local
645   double getUpdateCost(SNodeId Id1, SNodeId Id2) {  in getUpdateCost()
652     for (SNodeId Id1 : S1.KeyRoots)  in computeTreeDist()  local
657   void computeForestDist(SNodeId Id1, SNodeId Id2) {  in computeForestDist()
757 bool ASTDiff::Impl::identical(NodeId Id1, NodeId Id2) const {  in identical()
770 bool ASTDiff::Impl::isMatchingPossible(NodeId Id1, NodeId Id2) const {  in isMatchingPossible()
774 bool ASTDiff::Impl::haveSameParents(const Mapping &M, NodeId Id1,  in haveSameParents()
782 void ASTDiff::Impl::addOptimalMapping(Mapping &M, NodeId Id1,  in addOptimalMapping()
797 double ASTDiff::Impl::getJaccardSimilarity(const Mapping &M, NodeId Id1,  in getJaccardSimilarity()
835   for (NodeId Id1 : Postorder) {  in matchBottomUp()  local
883     for (NodeId Id1 : H1) {  in matchTopDown()  local
891     for (NodeId Id1 : H1) {  in matchTopDown()  local
918   for (NodeId Id1 : T1) {  in computeChangeKinds()  local
930   for (NodeId Id1 : T1.NodesBfs) {  in computeChangeKinds()  local
942     NodeId Id1 = M.getSrc(Id2);  in computeChangeKinds()  local