for (int i = 0; i < lastChars.length; ++i) { if (lastChars[i] != eolString.charAt(i)) { return true; } }
for (int i = 0; i < delims.length; ++i) { if (delims[i] == ch) { return true; } }
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/org/apache/tools/ant/util/StringTokenizer.java
Method name: boolean isMissingEndOfLine() Method name: boolean isDelim(char)
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 < delims.length; ++i) {
2
                if (lastChars[i] != eolString.charAt(i)) {
2
            if (delims[i] == 
3
    
3
ch) {
4
                return true;
4
                return true;
5
                }
5
            
6
    
6
}
7
        }
7
        }
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.2
Clones locationClones are in different classes
Number of node comparisons1