566                      const SyntaxTree::Impl &T2, NodeId Id1, NodeId Id2)  in ZhangShashaMatcher()
617             NodeId Id1 = S1.getIdInRoot(Row);  in getMatchingNodes()  local
644   double getUpdateCost(SNodeId Id1, SNodeId Id2) {  in getUpdateCost()
651     for (SNodeId Id1 : S1.KeyRoots)  in computeTreeDist()  local
656   void computeForestDist(SNodeId Id1, SNodeId Id2) {  in computeForestDist()
756 bool ASTDiff::Impl::identical(NodeId Id1, NodeId Id2) const {  in identical()
769 bool ASTDiff::Impl::isMatchingPossible(NodeId Id1, NodeId Id2) const {  in isMatchingPossible()
773 bool ASTDiff::Impl::haveSameParents(const Mapping &M, NodeId Id1,  in haveSameParents()
781 void ASTDiff::Impl::addOptimalMapping(Mapping &M, NodeId Id1,  in addOptimalMapping()
796 double ASTDiff::Impl::getJaccardSimilarity(const Mapping &M, NodeId Id1,  in getJaccardSimilarity()
834   for (NodeId Id1 : Postorder) {  in matchBottomUp()  local
882     for (NodeId Id1 : H1) {  in matchTopDown()  local
890     for (NodeId Id1 : H1) {  in matchTopDown()  local
917   for (NodeId Id1 : T1) {  in computeChangeKinds()  local
929   for (NodeId Id1 : T1.NodesBfs) {  in computeChangeKinds()  local
941     NodeId Id1 = M.getSrc(Id2);  in computeChangeKinds()  local