if (!data.containsKey(key)) {
HashTree newTree = createNewTree();
data.put(key, newTree);
order.add(key);
return newTree;
}
return getTree(key);
if (!data.containsKey(key)) {
HashTree newTree = createNewTree();
data.put(key, newTree);
return newTree;
}
return getTree(key);
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: HashTree add(Object)
|
|
Method name: HashTree add(Object)
|
Number of AST nodes: 6
|
|
Number of AST nodes: 5
|
|
1 | if (!data.containsKey(key)) {↵ | | 1 | if (!data.containsKey(key)) {↵
|
2 | HashTree newTree = createNewTree();↵ | | 2 | HashTree newTree = createNewTree();↵
|
3 | data.put(key, newTree);↵ | | 3 | data.put(key, newTree);↵
|
4 | order.add(key);↵ | | 4 | ↵
|
5 | return newTree;↵ | | 5 | return newTree;↵
|
6 | }↵ | | 6 | }↵
|
7 | return getTree(key); | | 7 | return getTree(key);
|
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 different classes having the same super class |
Number of node comparisons | 21 |
-
{Refactorable}
Mapping Summary
Number of mapped statements | 5 |
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) | 1.0 |
Clone type | Type 3 |
Mapped Statements
ID |
Statement |
|
ID |
Statement |
1 | if (!data.containsKey(key)) | | 1 | if (!data.containsKey(key)) |
2 | HashTree newTree = createNewTree(); | | 2 | HashTree newTree = createNewTree(); |
3 | | | 3 | |
4 | | | | |
5 | | | 4 | |
6 | return getTree(key); | | 5 | return getTree(key); |
Precondition Violations (0)
Row |
Violation |