HashTree t = getTree(key);
if (t != null) {
return t.getArray();
}
return null;
HashTree tree = getTreePath(treePath);
if (tree != null) {
return tree.list();
}
return new LinkedList();
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/jorphan/collections/HashTree.java
|
Method name: Object[] getArray(Object)
|
|
Method name: Collection list(Collection)
|
Number of AST nodes: 4
|
|
Number of AST nodes: 4
|
|
1 | HashTree t = getTree(key);↵ | | 1 | HashTree tree = getTreePath(treePath);↵
|
2 | if (t != null) {↵ | | 2 | if (tree != null) {↵
|
3 | return t.getArray();↵ | | 3 | return tree.list();↵
|
4 | }↵ | | 4 | }↵
|
5 | return null; | | 5 | return new LinkedList();
|
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 declared in the same class |
Number of node comparisons | 8 |
-
{Non-refactorable}
Mapping Summary
Number of mapped statements | 2 |
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) | 0.5 |
Clone type | Type 2 |
Mapped Statements
ID |
Statement |
|
ID |
Statement |
| | | 1 | HashTree tree = getTreePath(treePath); |
1 | HashTree t = getTree(key); | | | |
2 | if (t != null) | | 2 | if (tree != null) |
| | | 3 | |
3 | | | | |
4 | return null; | | 4 | return new LinkedList(); |
Precondition Violations (2)
Row |
Violation |
1 | Unmatched return tree.list(); |
2 | Unmatched return t.getArray(); |