Iterator it = keys.iterator();
while (it.hasNext()) {
add(it.next());
}
while (iter.hasNext()) {
((GraphAccumListener) iter.next()).updateGui();
}
bigChange = false;
Clone fragments detected by clone detection tool
File path: /jakarta-jmeter-2.3.2/src/org/apache/jorphan/collections/HashTree.java
|
|
File path: /jakarta-jmeter-2.3.2/src/org/apache/jmeter/visualizers/GraphAccumModel.java
|
Method name: void add(Collection)
|
|
Method name: void fireDataChanged()
|
Number of AST nodes: 3
|
|
Number of AST nodes: 3
|
|
1 | Iterator it = keys.iterator();↵ | | |
|
2 | while (it.hasNext()) {↵ | | 1 | while (iter.hasNext()) {↵
|
3 | add(it.next());↵ | | 2 | ↵
|
4 | } | | 3 | ((GraphAccumListener) iter.next()).updateGui();↵
|
| | | 4 | }↵
|
| | | 5 | bigChange = false;
|
See real code fragment |
|
See real code fragment |
Summary
Number of common nesting structure subtrees | 1 |
Number of refactorable cases | 0 |
Number of non-refactorable cases | 1 |
Time elapsed for finding largest common nesting structure subtrees (ms) | 0.1 |
Clones location | Clones are in different classes |
Number of node comparisons | 5 |
-
{Non-refactorable}
Mapping Summary
Number of mapped statements | 1 |
Number of unmapped statements in the first code fragment | 2 |
Number of unmapped statements in the second code fragment | 2 |
Time elapsed for statement mapping (ms) | 3.1 |
Clone type | Type 2 |
Mapped Statements
ID |
Statement |
|
ID |
Statement |
1 | Iterator it = keys.iterator(); | | | |
2 | while (it.hasNext()) | | 4 | while (iter.hasNext()) |
3 | | | | |
| | | 5 | ((GraphAccumListener)iter.next()).updateGui(); |
| | | 6 | bigChange = false; |
Precondition Violations (2)
Row |
Violation |
1 | Unmatched statement add(it.next()); cannot be moved before or after the extracted code, because it has dependencies to/from statements that will be extracted |
2 | Unmatched statement ((GraphAccumListener)iter.next()).updateGui(); cannot be moved before or after the extracted code, because it has dependencies to/from statements that will be extracted |