HashTree tree = getTree(currentKey);
data.remove(currentKey);
data.put(newKey, tree);
order.set(order.indexOf(currentKey), newKey);
HashTree tree = getTree(currentKey);
data.remove(currentKey);
data.put(newKey, tree);
Clone fragments detected by clone detection tool
File path: /jakarta-jmeter-2.3.2/src/org/apache/jorphan/collections/ListedHashTree.java
|
|
File path: /jakarta-jmeter-2.3.2/src/org/apache/jorphan/collections/HashTree.java
|
Method name: void replace(Object, Object)
|
|
Method name: void replace(Object, Object)
|
Number of AST nodes: 4
|
|
Number of AST nodes: 3
|
|
1 | HashTree tree = getTree(currentKey);↵ | | 1 | HashTree tree = getTree(currentKey);↵
|
2 | data.remove(currentKey);↵ | | 2 | data.remove(currentKey);↵
|
3 | data.put(newKey, tree);↵ | | 3 | data.put(newKey, tree);
|
4 | order.set(order.indexOf(currentKey), newKey); | | | |
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.0 |
Clones location | Clones are in different classes having the same super class |
Number of node comparisons | 12 |
-
{Refactorable}
Mapping Summary
Number of mapped statements | 3 |
Number of unmapped statements in the first code fragment | 1 |
Number of unmapped statements in the second code fragment | 0 |
Time elapsed for statement mapping (ms) | 0.0 |
Clone type | Type 3 |
Mapped Statements
ID |
Statement |
|
ID |
Statement |
1 | HashTree tree = getTree(currentKey); | | 1 | HashTree tree = getTree(currentKey); |
2 | data.remove(currentKey); | | 2 | data.remove(currentKey); |
3 | data.put(newKey, tree); | | 3 | data.put(newKey, tree); |
4 | order.set(order.indexOf(currentKey), newKey); | | | |
Precondition Violations (0)
Row |
Violation |