reference, declaration → definition definition → references, declarations, derived classes, virtual overrides reference to multiple definitions → definitions unreferenced |
74 assert(&*Tree == &T2 && "Invalid tree."); 760 const Node &N2 = T2.getNode(Id2); 763 T1.getNodeValue(Id1) != T2.getNodeValue(Id2)) 772 return Options.isMatchingAllowed(T1.getNode(Id1), T2.getNode(Id2)); 778 NodeId P2 = T2.getNode(Id2).Parent; 785 if (std::max(T1.getNumberOfDescendants(Id1), T2.getNumberOfDescendants(Id2)) > 788 ZhangShashaMatcher Matcher(*this, T1, T2, Id1, Id2); 805 CommonDescendants += int(Dst.isValid() && T2.isInSubtree(Dst, Id2)); 809 T2.getNumberOfDescendants(Id2) - 1 - CommonDescendants; 820 for (NodeId Id2 : T2) { 838 !M.hasDst(T2.getRootId())) { 839 if (isMatchingPossible(T1.getRootId(), T2.getRootId())) { 840 M.link(T1.getRootId(), T2.getRootId()); 841 addOptimalMapping(M, T1.getRootId(), T2.getRootId()); 861 PriorityList L2(T2); 863 Mapping M(T1.getSize() + T2.getSize()); 866 L2.push(T2.getRootId()); 925 for (NodeId Id2 : T2) { 927 T2.getMutableNode(Id2).Change = Insert; 928 T2.getMutableNode(Id2).Shift -= 1; 937 T2.findPositionInParent(Id2, true)) { 939 T2.getMutableNode(Id2).Shift -= 1; 942 for (NodeId Id2 : T2.NodesBfs) { 947 Node &N2 = T2.getMutableNode(Id2); 952 T2.findPositionInParent(Id2, true)) { 955 if (T1.getNodeValue(Id1) != T2.getNodeValue(Id2)) {