for (int i = 0; i < nodes.length; i++) {
if (nodes[i] == null) {
node_ok = false;
break;
}
}
for (int i = 0; i < nodes.length; i++) {
if (nodes[i] == null) {
node_ok = false;
break;
}
}
Clone fragments detected by clone detection tool
File path: /columba-1.4-src/mail/src/main/java/org/columba/mail/gui/table/action/DownAction.java
|
|
File path: /columba-1.4-src/mail/src/main/java/org/columba/mail/gui/table/action/UpAction.java
|
Method name: void actionPerformed(ActionEvent)
|
|
Method name: void actionPerformed(ActionEvent)
|
Number of AST nodes: 4
|
|
Number of AST nodes: 4
|
|
1 | for (int i = 0; i < nodes.length; i++) {↵ | | 1 | for (int i = 0; i < nodes.length; i++) {↵
|
2 | if (nodes[i] == null) {↵ | | 2 | if (nodes[i] == null) {↵
|
3 | node_ok = false;↵ | | 3 | node_ok = false;↵
|
|
4 | break;↵ | | 4 | break;↵
|
5 | }↵ | | 5 | }↵
|
6 | } | | 6 | }
|
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 in different classes having the same super class |
Number of node comparisons | 13 |
-
{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) | 1.8 |
Clone type | Type 1 |
Mapped Statements
ID |
Statement |
|
ID |
Statement |
19 | for (int i = 0; i < nodes.length; i++) | | 21 | for (int i = 0; i < nodes.length; i++) |
20 | | | 22 | |
21 | | | 23 | |
22 | | | 24 | |
Precondition Violations (0)
Row |
Violation |