getCcList().clear();
for (int i = 0; i < a.length; i++) {
getCcList().add(a[i].toString());
}
getBccList().clear();
for (int i = 0; i < a.length; i++) {
getBccList().add(a[i].toString());
}
Clone fragments detected by clone detection tool
File path: /columba-1.4-src/mail/src/main/java/org/columba/mail/gui/composer/ComposerModel.java
|
|
File path: /columba-1.4-src/mail/src/main/java/org/columba/mail/gui/composer/ComposerModel.java
|
Method name: void setCc(Address[])
|
|
Method name: void setBcc(Address[])
|
Number of AST nodes: 3
|
|
Number of AST nodes: 3
|
|
1 | getCcList().clear();↵ | | 1 | getBccList().clear();↵
|
2 | for (int i = 0; i < a.length; i++) {↵ | | 2 | for (int i = 0; i < a.length; i++) {↵
|
3 | getCcList().add(a[i].toString());↵ | | 3 | getBccList().add(a[i].toString());↵
|
4 | } | | 4 | }
|
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 declared in the same class |
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) | 0.7 |
Clone type | Type 2 |
Mapped Statements
ID |
Statement |
|
ID |
Statement |
1 | getCcList().clear(); | | 1 | getBccList().clear(); |
2 | for (int i = 0; i < a.length; i++) | | 2 | for (int i = 0; i < a.length; i++) |
3 | getCcList().add(a[i].toString()); | | 3 | getBccList().add(a[i].toString()); |
Precondition Violations (0)
Row |
Violation |