for (int i = 0; i < subNodes.length; i++) {
HashTree t = generateNode(subNodes[i]);
if (t != null) {
subTree.add(element, t);
}
}
if (getErrorsOnly()){
return;
}
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/jmeter/reporters/ResultSaver.java
|
Method name: HashTree generateNode(Configuration)
|
|
Method name: void saveSample(SampleResult)
|
Number of AST nodes: 4
|
|
Number of AST nodes: 2
|
|
1 | for (int i = 0; i < subNodes.length; i++) {↵ | | |
|
2 | HashTree t = generateNode(subNodes[i]);↵ | | |
|
|
3 | if (t != null) {↵ | | |
|
4 | subTree.add(element, t);↵ | | |
|
5 | }↵ | | |
|
6 | ↵ | | 1 | if (getErrorsOnly()){↵
|
| | | 2 | return;↵
|
7 | } | | 3 | }
|
See real code fragment |
|
See real code fragment |
Summary
Number of common nesting structure subtrees | 0 |
Number of refactorable cases | 0 |
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 |
Number of node comparisons | 1 |