for (Iterator i = cacheCollection().iterator(); i.hasNext();) {
if (!(i.next() instanceof FileResource)) {
return false;
}
}
for (int i = 0; i < arr.length; i++) {
if (!couldHoldIncluded(arr[i])) {
scandir(new File(basedir, arr[i]),
arr[i] + File.separator, false);
}
}
Clone fragments detected by clone detection tool
File path: /apache-ant-1.7.0/src/org/apache/tools/ant/types/resources/BaseResourceCollectionWrapper.java
|
|
File path: /apache-ant-1.7.0/src/org/apache/tools/ant/DirectoryScanner.java
|
Method name: boolean isFilesystemOnly()
|
|
Method name: void processSlowScan(String[])
|
Number of AST nodes: 3
|
|
Number of AST nodes: 3
|
|
1 | for (Iterator i = cacheCollection().iterator(); i.hasNext();) {↵ | | 1 | for (↵
|
2 | if (!(i.next() instanceof FileResource)) {↵ | | |
|
3 | return↵ | | 2 | int i = 0; i < arr.length; i++) {↵
|
| | | 3 | if (!couldHoldIncluded(arr[i])) {↵
|
| | | 4 | scandir(new File(basedir, arr[i]),↵
|
4 | false;↵ | | 5 | arr[i] + File.separator, false);↵
|
5 | }↵ | | 6 | }↵
|
6 | } | | 7 | }
|
See real code fragment |
|
See real code fragment |
Summary
Number of common nesting structure subtrees | 1 |
Number of refactorable cases | 0 |
Number of non-refactorable cases | 1 |
Time elapsed for finding largest common nesting structure subtrees (ms) | 0.1 |
Clones location | Clones are in different classes |
Number of node comparisons | 5 |
-
{Non-refactorable}
Mapping Summary
Number of mapped statements | 1 |
Number of unmapped statements in the first code fragment | 1 |
Number of unmapped statements in the second code fragment | 1 |
Time elapsed for statement mapping (ms) | 2.6 |
Clone type | Type 2 |
Mapped Statements
ID |
Statement |
|
ID |
Statement |
7 | if (!(i.next() instanceof FileResource)) | | 2 | if (!couldHoldIncluded(arr[i])) |
| | | 3 | scandir(new File(basedir, arr[i]), arr[i] + File.separator, false); |
8 | | | | |
Precondition Violations (1)
Row |
Violation |
1 | Unmatched return false; |