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