Package ch.uzh.ifi.seal.changedistiller.treedifferencing

Examples of ch.uzh.ifi.seal.changedistiller.treedifferencing.Node

62
63
64
65
66
67
68
69
70
71
72
73
74
        assertNodesAreNotMatched(whileStatementLeft, whileStatementRight);
    }

    @Test
    public void unchangedNodesOnDifferentPositionsShouldMatch() throws Exception {
        Node whileStatementLeft = addToLeft(WHILE_STATEMENT, "i < length");
        Node forStatementRight = addToRight(FOR_STATEMENT, "j < length");
        Node whileStatementRight = addToNode(forStatementRight, WHILE_STATEMENT, "i < length");
        addToNode(whileStatementLeft, METHOD_INVOCATION, "foo.bar();");
        addToNode(whileStatementLeft, ASSIGNMENT, "aInt = 24;");
        addToNode(whileStatementRight, METHOD_INVOCATION, "foo.bar();");
        addToNode(whileStatementRight, ASSIGNMENT, "aInt = 24;");
        createMatchSet();
View Full Code Here
75
76
77
78
79
80
81
82
83
84
85
86
        assertNodesAreMatched(whileStatementLeft, whileStatementRight);
    }

    @Test
    public void unchangedNodesButDifferentLeavesShouldNotMatch() throws Exception {
        Node whileStatementLeft = addToLeft(WHILE_STATEMENT, "i < length");
        Node whileStatementRight = addToRight(WHILE_STATEMENT, "i < length");
        addToNode(whileStatementLeft, CONSTRUCTOR_INVOCATION, "foo.bar();");
        addToNode(whileStatementLeft, ASSIGNMENT, "aInt = 24;");
        addToNode(whileStatementRight, METHOD_INVOCATION, "foo.bar();");
        addToNode(whileStatementRight, VARIABLE_DECLARATION_STATEMENT, "int aInt = 24;");
        createMatchSet();
View Full Code Here
87
88
89
90
91
92
93
94
95
96
97
98
        assertNodesAreNotMatched(whileStatementLeft, whileStatementRight);
    }

    @Test
    public void changedNodesShouldMatch() throws Exception {
        Node whileStatementLeft = addToLeft(WHILE_STATEMENT, "i < length");
        Node whileStatementRight = addToRight(WHILE_STATEMENT, "i < size");
        addToNode(whileStatementLeft, METHOD_INVOCATION, "foo.bar();");
        addToNode(whileStatementLeft, ASSIGNMENT, "aInt = 24;");
        addToNode(whileStatementRight, METHOD_INVOCATION, "foo.bar();");
        addToNode(whileStatementRight, ASSIGNMENT, "aInt = 24;");
        createMatchSet();
View Full Code Here
99
100
101
102
103
104
105
106
107
108
109
110
111
112
        assertNodesAreMatched(whileStatementLeft, whileStatementRight);
    }

    @Test
    public void unchangedNodesAmongManyNodesShouldMatch() throws Exception {
        Node whileStatementLeft = addToLeft(WHILE_STATEMENT, "i < length");
        addToLeft(FOR_STATEMENT, "j < length");
        addToRight(FOREACH_STATEMENT, "j < size");
        Node whileStatementRight = addToRight(WHILE_STATEMENT, "i < length");
        addToNode(whileStatementLeft, METHOD_INVOCATION, "foo.bar();");
        addToNode(whileStatementLeft, ASSIGNMENT, "aInt = 24;");
        addToNode(whileStatementRight, METHOD_INVOCATION, "foo.bar();");
        addToNode(whileStatementRight, ASSIGNMENT, "aInt = 24;");
        createMatchSet();
View Full Code Here
37
38
39
40
41
42
43
44
45
46
public class WhenLeavesAreMatched extends WhenTreeNodesAreMatched {

    @Test
    public void unchangedLeavesShouldMatch() throws Exception {
        Node methodInvocationLeft = addToLeft(METHOD_INVOCATION, "foo.bar();");
        Node methodInvocationRight = addToRight(METHOD_INVOCATION, "foo.bar();");
        createMatchSet();
        assertLeavesAreMatched(methodInvocationLeft, methodInvocationRight);
    }
View Full Code Here
45
46
47
48
49
50
51
52
53
54
        assertLeavesAreMatched(methodInvocationLeft, methodInvocationRight);
    }

    @Test
    public void leavesWithDifferentLabelsShoudlNotMatch() throws Exception {
        Node methodInvocationLeft = addToLeft(CONSTRUCTOR_INVOCATION, "foo.bar();");
        Node methodInvocationRight = addToRight(METHOD_INVOCATION, "foo.bar();");
        createMatchSet();
        assertLeavesAreNotMatched(methodInvocationLeft, methodInvocationRight);
    }
View Full Code Here
53
54
55
56
57
58
59
60
61
62
63
        assertLeavesAreNotMatched(methodInvocationLeft, methodInvocationRight);
    }

    @Test
    public void unchangedLeavesOnDifferentPositionsShouldMatch() throws Exception {
        Node methodInvocationLeft = addToLeft(METHOD_INVOCATION, "foo.bar();");
        Node ifStatement = addToRight(IF_STATEMENT, "true");
        Node methodInvocationRight = addToNode(ifStatement, METHOD_INVOCATION, "foo.bar();");
        createMatchSet();
        assertLeavesAreMatched(methodInvocationLeft, methodInvocationRight);
    }
View Full Code Here
62
63
64
65
66
67
68
69
70
71
72
73
        assertLeavesAreMatched(methodInvocationLeft, methodInvocationRight);
    }

    @Test
    public void unchangedLeavesAmongManyLeavesShouldMatch() throws Exception {
        Node methodInvocationLeft = addToLeft(METHOD_INVOCATION, "foo.bar();");
        addToLeft(ASSIGNMENT, "a = b;");
        addToRight(RETURN_STATEMENT, "return b;");
        Node methodInvocationRight = addToRight(METHOD_INVOCATION, "foo.bar();");
        createMatchSet();
        assertLeavesAreMatched(methodInvocationLeft, methodInvocationRight);
    }
View Full Code Here
72
73
74
75
76
77
78
79
80
81
        assertLeavesAreMatched(methodInvocationLeft, methodInvocationRight);
    }

    @Test
    public void changedButSimilarLeavesShouldMatch() throws Exception {
        Node methodInvocationLeft = addToLeft(METHOD_INVOCATION, "foo.bar();");
        Node methodInvocationRight = addToRight(METHOD_INVOCATION, "foo.bear();");
        createMatchSet();
        assertLeavesAreMatched(methodInvocationLeft, methodInvocationRight);
    }
View Full Code Here
80
81
82
83
84
85
86
87
88
89
90
91
        assertLeavesAreMatched(methodInvocationLeft, methodInvocationRight);
    }

    @Test
    public void changedButSimilarLeavesAmongManyLeavesShouldMatch() throws Exception {
        Node methodInvocationLeft = addToLeft(METHOD_INVOCATION, "foo.bar();");
        addToLeft(JavaEntityType.ASSIGNMENT, "a = b;");
        addToRight(JavaEntityType.RETURN_STATEMENT, "return b;");
        Node methodInvocationRight = addToRight(JavaEntityType.METHOD_INVOCATION, "foo.bear();");
        createMatchSet();
        assertLeavesAreMatched(methodInvocationLeft, methodInvocationRight);
    }
View Full Code Here
TOP

Related Classes of ch.uzh.ifi.seal.changedistiller.treedifferencing.Node

  • ch.uzh.ifi.seal.changedistiller.ast.java.JavaASTHelper
  • ch.uzh.ifi.seal.changedistiller.ast.java.JavaDeclarationConverter
  • ch.uzh.ifi.seal.changedistiller.ast.java.JavaMethodBodyConverter
  • ch.uzh.ifi.seal.changedistiller.ast.java.WhenASTsAreConverted
  • ch.uzh.ifi.seal.changedistiller.ast.java.WhenCommentsAreAssociatedToSourceCode
  • ch.uzh.ifi.seal.changedistiller.ast.java.WhenDeclarationsAreConverted
  • ch.uzh.ifi.seal.changedistiller.ast.java.WhenSourceCodeChangesAreClassified
  • ch.uzh.ifi.seal.changedistiller.distilling.refactoring.RefactoringCandidateProcessor
  • ch.uzh.ifi.seal.changedistiller.distilling.WhenChangesAreExtracted
  • ch.uzh.ifi.seal.changedistiller.distilling.WhenDeclarationChangesAreExtracted
    • Copyright © 2018 www.massapicom. All rights reserved.
    All source code are property of their respective owners. Java is a trademark of Sun Microsystems, Inc and owned by ORACLE Inc. Contact coftware#gmail.com.