for (int i = 0; i < splitClasses.length; i++) { if (simplename.equals(splitClasses[i]) || simplename.startsWith(splitClasses[i] + '$')) { return true; } }
for (int i = 0; i < excludePatterns.length; i++) { if (matchPath(excludePatterns[i], name, isCaseSensitive())) { return true; } }
Clone fragments detected by clone detection tool
File path: /apache-ant-1.7.0/src/org/apache/tools/ant/taskdefs/optional/junit/JUnitTask.java File path: /apache-ant-1.7.0/src/org/apache/tools/ant/DirectoryScanner.java
Method name: boolean isSplit(String) Method name: boolean isExcluded(String)
Number of AST nodes: 3 Number of AST nodes: 3
1
for (int i = 0; i < splitClasses.length; i++) {
1
for (int i = 0; i < excludePatterns.length; i++) {
2
                if (simplename.equals(splitClasses[i])
2
            
3
                        || simplename.startsWith(splitClasses[i] + '$')) {
3
if (matchPath(excludePatterns[i], name, isCaseSensitive())) {
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.1
Clones locationClones are in different classes
Number of node comparisons1