for (int i = patIdxStart; i <= patIdxEnd; i++) { if (patArr[i] != '*') { return false; } }
for (int counter = 0; counter < excludes.length; counter++) { if (excludes[counter].equals(soughtexclude)) { return false; } }
Clone fragments detected by clone detection tool
File path: /apache-ant-1.7.0/src/org/apache/tools/ant/types/selectors/SelectorUtils.java File path: /apache-ant-1.7.0/src/org/apache/tools/ant/DirectoryScanner.java
Method name: boolean match(String, String, boolean) Method name: boolean isMorePowerfulThanExcludes(String, String)
Number of AST nodes: 3 Number of AST nodes: 3
1
for (int i = patIdxStart; i <= patIdxEnd; i++) {
1
for (int 
2
                if (patArr[i] != '*'
2
counter = 0; counter < excludes.length; counter++) {
3
) {
3
            if (excludes[counter].equals(soughtexclude))  {
4
                    return false;
4
                return false;
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