for (int i = 0; i < lastChars.length; ++i) { if (lastChars[i] != eolString.charAt(i)) { return true; } }
for (int i=0; i<l1.length; i++) { if (!l1[i].equals(l2[i])) { assertTrue(msg, !shouldBeEqual); } }
Clone fragments detected by clone detection tool
File path: /apache-ant-1.7.0/src/org/apache/tools/ant/taskdefs/Concat.java File path: /apache-ant-1.7.0/src/tests/junit/org/apache/tools/ant/taskdefs/AntTest.java
Method name: boolean isMissingEndOfLine() Method name: void targetStarted(BuildEvent)
Number of AST nodes: 3 Number of AST nodes: 3
1
for (int i = 0; i < lastChars.length; ++i) {
1
for (int i=0; i<l1.length; i++) {
2
                if (lastChars[i] != eolString.charAt(i)) {
2
                      
3
                    return true;
4
                }
3
              if (!l1[i].equals(l2[i])) {
4
                                        assertTrue(msg, !shouldBeEqual);
5
                                    }
5
            }
6
                                }
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.1
Clones locationClones are in different classes
Number of node comparisons1