String soughtexclude = name + File.separator + "**";
for (int counter = 0; counter < excludes.length; counter++) {
if (excludes[counter].equals(soughtexclude)) {
return false;
}
}
return true;
for (int i = 0; i < r.length; i++) {
if (r[i].length > 0) {
return false;
}
}
return true;
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/ant/taskdefs/Zip.java
|
Method name: boolean isMorePowerfulThanExcludes(String, String)
|
|
Method name: boolean isEmpty(Resource[][])
|
Number of AST nodes: 5
|
|
Number of AST nodes: 4
|
|
1 | String soughtexclude = name + File.separator + "**";↵ | | |
|
2 | for (int counter = 0; counter < excludes.length; counter++) {↵ | | 1 | for (int i = 0; i < r.length; i++) {↵
|
3 | if (excludes[counter].equals(soughtexclude)) {↵ | | 2 | if (r[i].length > 0) {↵
|
4 | return false;↵ | | 3 | return false;↵
|
5 | }↵ | | 4 | }↵
|
6 | }↵ | | 5 | }↵
|
7 | return true; | | 6 | return true;
|
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 |