for (int k = 0; k < mappedFiles.length; k++) {
mappedFiles[k] = new File(toDir, mappedFiles[k]).getAbsolutePath();
}
for (int k = 0; k < mappedFiles.length; k++) {
mappedFiles[k] = new File(toDir, mappedFiles[k]).getAbsolutePath();
}
Clone fragments detected by clone detection tool
File path: /apache-ant-1.7.0/src/org/apache/tools/ant/taskdefs/Copy.java
|
|
File path: /apache-ant-1.7.0/src/org/apache/tools/ant/taskdefs/Copy.java
|
Method name: void buildMap(File, File, String[], FileNameMapper, Hashtable)
|
|
Method name: Map buildMap(Resource[], File, FileNameMapper)
|
Number of AST nodes: 2
|
|
Number of AST nodes: 2
|
|
1 | for (int k = 0; k < mappedFiles.length; k++) {↵ | | 1 | for (int k = 0; k < mappedFiles.length; k++) {↵
|
2 | mappedFiles[k] = new File(toDir, mappedFiles[k]).getAbsolutePath();↵ | | 2 | mappedFiles[k] = new File(toDir, mappedFiles[k]).getAbsolutePath();↵
|
3 | } | | 3 | }
|
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.3 |
Clones location | Clones are declared in the same class |
Number of node comparisons | 8 |
-
{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) | 2.2 |
Clone type | Type 1 |
Mapped Statements
ID |
Statement |
|
ID |
Statement |
16 | for (int k = 0; k < mappedFiles.length; k++) | | 15 | for (int k = 0; k < mappedFiles.length; k++) |
17 | mappedFiles[k] = new File(toDir, mappedFiles[k]).getAbsolutePath(); | | 16 | mappedFiles[k] = new File(toDir, mappedFiles[k]).getAbsolutePath(); |
Precondition Violations (0)
Row |
Violation |