void testTrimString() { executeTarget("testTrimString"); } public void testTrimStringCondition() { executeTarget("testTrimStringCondition"); } public void testNoTrimString() { executeTarget("testNoTrimString"); } public void testNoTrimStringCondition() { executeTarget("testNoTrimStringCondition"); } public void testStringFile() { expectBuildExceptionContaining("testStringFile", "should fail", "incompatible"); }
void testNoop() { executeTarget("noop"); } public void testCurrent() { executeTarget("current"); } public void testFaster() { executeTarget("faster"); } public void testSlower() { executeTarget("slower"); } public void testTooSlow() { expectBuildExceptionContaining( "too_slow","out of range","out of the range 1-10"); }
Clone fragments detected by clone detection tool
File path: /apache-ant-1.7.0/src/tests/junit/org/apache/tools/ant/taskdefs/LengthTest.java File path: /apache-ant-1.7.0/src/tests/junit/org/apache/tools/ant/taskdefs/NiceTest.java
Method name: Method name:
Number of AST nodes: 0 Number of AST nodes: 0
1
void testTrimString() {
1
void testNoop() {
2
        executeTarget("testTrimString");
2
        executeTarget("noop");
3
    }
3
    }
4
    public void testTrimStringCondition() {
4
    public void testCurrent() {
5
        executeTarget("testTrimStringCondition");
5
        executeTarget("current");
6
    }
6
    }
7
    public void testNoTrimString() {
7
    public void testFaster() {
8
        executeTarget("testNoTrimString");
8
        executeTarget("faster");
9
    }
9
    }
10
    public void testNoTrimStringCondition() {
10
    public void testSlower() {
11
        executeTarget("testNoTrimStringCondition");
11
        executeTarget("slower");
12
    }
12
    }
13
    public void testStringFile() {
13
    public void testTooSlow() {
14
        expectBuildExceptionContaining("testStringFile",
14
        expectBuildExceptionContaining(
15
            "should fail", "incompatible
16
");
15
                "too_slow","out of range","out of the range 1-10");
17
    }
16
    }
Summary
Number of common nesting structure subtrees0
Number of refactorable cases0
Number of non-refactorable cases0
Time elapsed for finding largest common nesting structure subtrees (ms)0.0
Clones location
Number of node comparisons0