while ((str = in.readLine()) != null) {
strbuf.append(str + "\n");
}
in.close();
while ((str = in.readLine()) != null) {
strbuf.append(str + "\n");
}
in.close();
Clone fragments detected by clone detection tool
File path: /columba-1.4-src/mail/src/main/java/org/columba/mail/composer/MessageComposer.java
|
|
File path: /columba-1.4-src/mail/src/main/java/org/columba/mail/folder/mailboximport/MHImporter.java
|
Method name: String getSignature(File)
|
|
Method name: void importMessage(File, IWorkerStatusController)
|
Number of AST nodes: 3
|
|
Number of AST nodes: 3
|
|
1 | while ((str = in.readLine()) != null) {↵ | | 1 | while ((str = in.readLine()) != null) {↵
|
2 | strbuf.append(str + "\n");↵ | | 2 | strbuf.append(str + "\n");↵
|
3 | }↵ | | |
|
|
4 | ↵ | | 3 | }↵
|
|
5 | in.close(); | | 4 | 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.2 |
Clones location | Clones are in different classes |
Number of node comparisons | 5 |
-
{Refactorable}
Mapping Summary
Number of mapped statements | 3 |
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) | 1.3 |
Clone type | Type 1 |
Mapped Statements
ID |
Statement |
|
ID |
Statement |
5 | while ((str = in.readLine()) != null) | | 5 | while ((str = in.readLine()) != null) |
6 | strbuf.append(str + "\n"); | | 6 | strbuf.append(str + "\n"); |
7 | in.close(); | | 7 | in.close(); |
Precondition Violations (0)
Row |
Violation |