for (int i = 0; i < rows.length; i++) {
TreePath treePath = getTree().getPathForRow(rows[i]);
if (treePath == null) {
continue;
}
nodes[i] = (MessageNode) treePath.getLastPathComponent();
}
for (int i = 0; i < uids.length; i++) {
if (outboxFolder.exists(uids[i]) == true) {
SendableMessage message = outboxFolder
.getSendableMessage(uids[i]);
sendListManager.add(message);
}
}
Clone fragments detected by clone detection tool
File path: /columba-1.4-src/mail/src/main/java/org/columba/mail/gui/table/TableView.java
|
|
File path: /columba-1.4-src/mail/src/main/java/org/columba/mail/smtp/command/SendAllMessagesCommand.java
|
Method name: MessageNode[] getSelectedNodes()
|
|
Method name: void execute(IWorkerStatusController)
|
Number of AST nodes: 5
|
|
Number of AST nodes: 4
|
|
1 | for (int i = 0; i < rows.length; i++) {↵ | | 1 | for (int i = 0; i < uids.length; i++) {↵
|
2 | TreePath treePath = getTree().getPathForRow(rows[i]);↵ | | 2 | ↵
|
|
3 | if (treePath == null) {↵ | | |
|
4 | continue;↵ | | |
|
5 | }↵ | | |
|
|
6 | nodes[i] = (MessageNode) treePath.getLastPathComponent();↵ | | 3 | if (outboxFolder.exists(uids[i]) == true) {↵
|
| | | 4 | SendableMessage message = outboxFolder↵
|
| | | 5 | .getSendableMessage(uids[i]);↵
|
| | | 6 | sendListManager.add(message);↵
|
| | | 7 | }↵
|
7 | } | | 8 | }
|
See real code fragment |
|
See real code fragment |
Summary
Number of common nesting structure subtrees | 0 |
Number of refactorable cases | 0 |
Number of non-refactorable cases | 0 |
Time elapsed for finding largest common nesting structure subtrees (ms) | 0.1 |
Clones location | Clones are in different classes |
Number of node comparisons | 1 |