while ((len = in.read(buffer)) != -1) {
out.write(buffer, 0, len);
}
in.close();
out.close();
while ((len = in.read(buffer)) != -1) {
out.write(buffer, 0, len);
}
out.close();
in.close();
Clone fragments detected by clone detection tool
File path: /columba-1.4-src/core/src/main/java/org/columba/core/io/DiskIO.java
|
|
File path: /columba-1.4-src/core/src/main/java/org/columba/core/io/DiskIO.java
|
Method name: void copyFile(File, File)
|
|
Method name: boolean copyResource(String, File)
|
Number of AST nodes: 4
|
|
Number of AST nodes: 4
|
|
1 | while ((len = in.read(buffer)) != -1) {↵ | | 1 | while ((len = in.read(buffer)) != -1) {↵
|
2 | out.write(buffer, 0, len);↵ | | 2 | out.write(buffer, 0, len);↵
|
3 | }↵ | | 3 | }↵
|
|
4 | in.close();↵ | | 4 | out.close();↵
|
5 | out.close(); | | 5 | in.close();
|
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.5 |
Clones location | Clones are declared in the same class |
Number of node comparisons | 9 |
-
{Refactorable}
Mapping Summary
Number of mapped statements | 4 |
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.7 |
Clone type | Type 2 |
Mapped Statements
ID |
Statement |
|
ID |
Statement |
8 | while ((len = in.read(buffer)) != -1) | | 9 | while ((len = in.read(buffer)) != -1) |
9 | out.write(buffer, 0, len); | | 10 | out.write(buffer, 0, len); |
10 | in.close(); | | 12 | in.close(); |
11 | out.close(); | | 11 | out.close(); |
Precondition Violations (0)
Row |
Violation |