for (Iterator i = additionalPatterns.iterator(); i.hasNext();) { if (hasPatterns((PatternSet) i.next())) { return true; } }
for (int i = 0; i < lastChars.length; ++i) { if (lastChars[i] != eolString.charAt(i)) { return true; } }
Clone fragments detected by clone detection tool
File path: /apache-ant-1.7.0/src/org/apache/tools/ant/types/resources/Files.java File path: /apache-ant-1.7.0/src/org/apache/tools/ant/taskdefs/Concat.java
Method name: boolean hasPatterns() Method name: boolean isMissingEndOfLine()
Number of AST nodes: 3 Number of AST nodes: 3
1
for (Iterator i = additionalPatterns.iterator(); i.hasNext();) {
1
for (int i = 0; i < lastChars.length; ++i) {
2
            if (hasPatterns((PatternSet) i.next())) {
2
                if (lastChars[i] != eolString.charAt(i)) {
3
                return true;
3
                    return true;
4
            }
4
            
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