reference, declaration → definition definition → references, declarations, derived classes, virtual overrides reference to multiple definitions → definitions unreferenced |
72 if (&*Tree == &T1) 759 const Node &N1 = T1.getNode(Id1); 763 T1.getNodeValue(Id1) != T2.getNodeValue(Id2)) 772 return Options.isMatchingAllowed(T1.getNode(Id1), T2.getNode(Id2)); 777 NodeId P1 = T1.getNode(Id1).Parent; 785 if (std::max(T1.getNumberOfDescendants(Id1), T2.getNumberOfDescendants(Id2)) > 788 ZhangShashaMatcher Matcher(*this, T1, T2, Id1, Id2); 801 const Node &N1 = T1.getNode(Id1); 808 double Denominator = T1.getNumberOfDescendants(Id1) - 1 + 835 std::vector<NodeId> Postorder = getSubtreePostorder(T1, T1.getRootId()); 835 std::vector<NodeId> Postorder = getSubtreePostorder(T1, T1.getRootId()); 837 if (Id1 == T1.getRootId() && !M.hasSrc(T1.getRootId()) && 837 if (Id1 == T1.getRootId() && !M.hasSrc(T1.getRootId()) && 839 if (isMatchingPossible(T1.getRootId(), T2.getRootId())) { 840 M.link(T1.getRootId(), T2.getRootId()); 841 addOptimalMapping(M, T1.getRootId(), T2.getRootId()); 846 const Node &N1 = T1.getNode(Id1); 860 PriorityList L1(T1); 863 Mapping M(T1.getSize() + T2.getSize()); 865 L1.push(T1.getRootId()); 887 for (int I = 0, E = T1.getNumberOfDescendants(Id1); I < E; ++I) 919 for (NodeId Id1 : T1) { 921 T1.getMutableNode(Id1).Change = Delete; 922 T1.getMutableNode(Id1).Shift -= 1; 931 for (NodeId Id1 : T1.NodesBfs) { 936 T1.findPositionInParent(Id1, true) != 938 T1.getMutableNode(Id1).Shift -= 1; 946 Node &N1 = T1.getMutableNode(Id1); 951 T1.findPositionInParent(Id1, true) != 955 if (T1.getNodeValue(Id1) != T2.getNodeValue(Id2)) {