for (int i = 0; i < extensions.length; ++i) { if (name.toLowerCase().endsWith(extensions[i])) { return true; } }
for (int i = 0; i < includes.length; i++) { if (matchPatternStart(includes[i], name, isCaseSensitive()) && isMorePowerfulThanExcludes(name, includes[i]) && isDeeper(includes[i], name)) { return true; } }
Clone fragments detected by clone detection tool
File path: /apache-ant-1.7.0/src/org/apache/tools/ant/launch/Locator.java File path: /apache-ant-1.7.0/src/org/apache/tools/ant/DirectoryScanner.java
Method name: boolean accept(File, String) Method name: boolean couldHoldIncluded(String)
Number of AST nodes: 3 Number of AST nodes: 3
1
for (int i = 0; i < extensions.length; ++i) {
1
for (int i = 0; i < includes.length; i++) {
2
                        if (name.toLowerCase().endsWith(extensions[i])) {
2
            if (
3
                            return true;
4
     
3
matchPatternStart(includes[i], name, isCaseSensitive())
4
                && isMorePowerfulThanExcludes(name, includes[i])
5
                && isDeeper(includes[i], name)) {
5
                   }
6
                return true;
6
            
7
            }
7
        }
8
        }
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