JMeterProperty prop = createProperty(children[i], newClass);
if (prop!=null) {
element.setProperty(prop);
}
result = subTree.getTree(target);
if (result != null) {
// short circuit traversal when found
throw new RuntimeException(FOUND);
}
Clone fragments detected by clone detection tool
File path: /jakarta-jmeter-2.3.2/src/org/apache/jmeter/save/OldSaveService.java
|
|
File path: /jakarta-jmeter-2.3.2/src/org/apache/jorphan/collections/HashTree.java
|
Method name: TestElement createTestElement(Configuration)
|
|
Method name: void addNode(Object, HashTree)
|
Number of AST nodes: 3
|
|
Number of AST nodes: 3
|
|
1 | JMeterProperty prop = createProperty(children[i], newClass);↵ | | 1 | result = subTree.getTree(target);↵
|
2 | if (prop!=null) {↵ | | 2 | if (result != null) {↵
|
3 | element.setProperty(prop↵ | | 3 | // short circuit traversal when found↵
|
4 | );↵ | | 4 | throw new RuntimeException(FOUND);↵
|
5 | } | | 5 | }
|
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) | 0.5 |
Clone type | Type 3 |
Mapped Statements
ID |
Statement |
|
ID |
Statement |
| | | 1 | result = subTree.getTree(target); |
15 | if (prop != null) | | 2 | if (result != null) |
| | | 3 | throw new RuntimeException(FOUND); |
16 | element.setProperty(prop); | | | |
Precondition Violations (2)
Row |
Violation |
1 | Type org.apache.jmeter.testelement.property.JMeterProperty of variable prop does not match with type org.apache.jorphan.collections.HashTree of variable result |
2 | Unmatched throw new RuntimeException(FOUND); |