if (!okToDelete(f)) {
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/taskdefs/Move.java
|
|
File path: /apache-ant-1.7.0/src/org/apache/tools/ant/DirectoryScanner.java
|
Method name: boolean okToDelete(File)
|
|
Method name: boolean isMorePowerfulThanExcludes(String, String)
|
Number of AST nodes: 2
|
|
Number of AST nodes: 3
|
|
1 | if (!okToDelete(f)) {↵ | | |
|
2 | ↵ | | 1 | for (int counter = 0; counter < excludes.length; counter++) {↵
|
| | | 2 | if (excludes[counter].equals(soughtexclude)) {↵
|
3 | return false;↵ | | 3 | return false;↵
|
4 | ↵ | | 4 | }↵
|
5 | } | | 5 | }
|
See real code fragment |
|
See real code fragment |
Summary
Number of common nesting structure subtrees | 1 |
Number of refactorable cases | 1 |
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 | 5 |
-
{Refactorable}
Mapping Summary
Number of mapped statements | 2 |
Number of unmapped statements in the first code fragment | 0 |
Number of unmapped statements in the second code fragment | 0 |
Time elapsed for statement mapping (ms) | 0.4 |
Clone type | Type 2 |
Mapped Statements
ID |
Statement |
|
ID |
Statement |
8 | if (!okToDelete(f)) | | 3 | if (excludes[counter].equals(soughtexclude)) |
9 | | | 4 | |
Precondition Violations (0)
Row |
Violation |