Lines Matching refs:T1
59 SyntaxTree::Impl &T1, &T2;
62 Impl(SyntaxTree::Impl &T1, SyntaxTree::Impl &T2,
73 if (&*Tree == &T1)
566 ZhangShashaMatcher(const ASTDiff::Impl &DiffImpl, const SyntaxTree::Impl &T1,
568 : DiffImpl(DiffImpl), S1(T1, Id1), S2(T2, Id2) {
758 const Node &N1 = T1.getNode(Id1);
762 T1.getNodeValue(Id1) != T2.getNodeValue(Id2))
771 return Options.isMatchingAllowed(T1.getNode(Id1), T2.getNode(Id2));
776 NodeId P1 = T1.getNode(Id1).Parent;
784 if (std::max(T1.getNumberOfDescendants(Id1), T2.getNumberOfDescendants(Id2)) >
787 ZhangShashaMatcher Matcher(*this, T1, T2, Id1, Id2);
800 const Node &N1 = T1.getNode(Id1);
807 double Denominator = T1.getNumberOfDescendants(Id1) - 1 +
834 std::vector<NodeId> Postorder = getSubtreePostorder(T1, T1.getRootId());
836 if (Id1 == T1.getRootId() && !M.hasSrc(T1.getRootId()) &&
838 if (isMatchingPossible(T1.getRootId(), T2.getRootId())) {
839 M.link(T1.getRootId(), T2.getRootId());
840 addOptimalMapping(M, T1.getRootId(), T2.getRootId());
845 const Node &N1 = T1.getNode(Id1);
859 PriorityList L1(T1);
862 Mapping M(T1.getSize() + T2.getSize());
864 L1.push(T1.getRootId());
886 for (int I = 0, E = T1.getNumberOfDescendants(Id1); I < E; ++I)
903 ASTDiff::Impl::Impl(SyntaxTree::Impl &T1, SyntaxTree::Impl &T2,
905 : T1(T1), T2(T2), Options(Options) {
918 for (NodeId Id1 : T1) {
920 T1.getMutableNode(Id1).Change = Delete;
921 T1.getMutableNode(Id1).Shift -= 1;
930 for (NodeId Id1 : T1.NodesBfs) {
935 T1.findPositionInParent(Id1, true) !=
937 T1.getMutableNode(Id1).Shift -= 1;
945 Node &N1 = T1.getMutableNode(Id1);
950 T1.findPositionInParent(Id1, true) !=
954 if (T1.getNodeValue(Id1) != T2.getNodeValue(Id2)) {
960 ASTDiff::ASTDiff(SyntaxTree &T1, SyntaxTree &T2,
962 : DiffImpl(std::make_unique<Impl>(*T1.TreeImpl, *T2.TreeImpl, Options)) {}