while (it.hasNext()) {
ListInfoTreeNode node = insertTreeNode((ListInfo) it.next(),
rootNode);
node.setSelected(false);
}
while (it.hasNext()) {
ListInfoTreeNode node = insertTreeNode((ListInfo) it.next(),
rootNode);
node.setSelected(true);
}
Clone fragments detected by clone detection tool
File path: /columba-1.4-src/mail/src/main/java/org/columba/mail/gui/config/subscribe/SynchronizeFolderListCommand.java
|
|
File path: /columba-1.4-src/mail/src/main/java/org/columba/mail/gui/config/subscribe/SynchronizeFolderListCommand.java
|
Method name: TreeNode createTreeStructure()
|
|
Method name: TreeNode createTreeStructure()
|
Number of AST nodes: 3
|
|
Number of AST nodes: 3
|
|
1 | while (it.hasNext()) {↵ | | 1 | while (it.hasNext()) {↵
|
2 | ListInfoTreeNode node = insertTreeNode((ListInfo) it.next(),↵ | | 2 | ListInfoTreeNode node = insertTreeNode((ListInfo) it.next(),↵
|
3 | rootNode);↵ | | 3 | rootNode);↵
|
4 | node.setSelected(false);↵ | | 4 | node.setSelected(true);↵
|
5 | } | | 5 | }
|
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.1 |
Clones location | Clones are in the same method |
Number of node comparisons | 10 |
-
{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) | 47.3 |
Clone type | Type 2 |
Mapped Statements
ID |
Statement |
|
ID |
Statement |
8 | while (it.hasNext()) | | 12 | while (it.hasNext()) |
9 | ListInfoTreeNode node = insertTreeNode((ListInfo)it.next(), rootNode); | | 13 | ListInfoTreeNode node = insertTreeNode((ListInfo)it.next(), rootNode); |
10 | | | 14 | |
Precondition Violations (0)
Row |
Violation |