while (searchParents && parent != null && parent.exists()) {
if (checkFile(new File(parent, filename),
filename + " in " + parent)) {
return true;
}
parent = parent.getParentFile();
}
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/taskdefs/Available.java
|
|
File path: /apache-ant-1.7.0/src/org/apache/tools/bzip2/CBZip2InputStream.java
|
Method name: boolean checkFile()
|
|
Method name: void hbCreateDecodeTables(int[], int[], int[], char[], int, int, int)
|
Number of AST nodes: 4
|
|
Number of AST nodes: 3
|
|
1 | while (searchParents && parent != null && parent.exists()) {↵ | | |
|
2 | ↵ | | 1 | for (int j = 0; j < alphaSize; j++) {↵
|
3 | if (checkFile(new File(parent, filename),↵ | | 2 | if (↵
|
4 | filename + " in " + parent)) {↵ | | |
|
5 | return true;↵ | | |
|
6 | }↵ | | |
|
7 | parent = parent.getParentFile();↵ | | |
|
8 | ↵ | | 3 | length[j] == i) {↵
|
| | | 4 | perm[pp++] = j;↵
|
| | | 5 | }↵
|
9 | } | | 6 | }
|
See real code fragment |
|
See real code fragment |
Summary
Number of common nesting structure subtrees | 0 |
Number of refactorable cases | 0 |
Number of non-refactorable cases | 0 |
Time elapsed for finding largest common nesting structure subtrees (ms) | 0.1 |
Clones location | Clones are in different classes |
Number of node comparisons | 1 |