while (iter.hasNext()) {
SampleResult result = (SampleResult) iter.next();
if (isSampleWanted(result.isSuccessful())) {
visualizer.add(result);
}
}
for (int i = 0; i < subNodes.length; i++) {
HashTree t = generateNode(subNodes[i]);
if (t != null) {
subTree.add(element, t);
}
}
Clone fragments detected by clone detection tool
File path: /jakarta-jmeter-2.3.2/src/org/apache/jmeter/reporters/ResultCollector.java
|
|
File path: /jakarta-jmeter-2.3.2/src/org/apache/jmeter/save/OldSaveService.java
|
Method name: void readSamples(TestResultWrapper, Visualizer)
|
|
Method name: HashTree generateNode(Configuration)
|
Number of AST nodes: 4
|
|
Number of AST nodes: 4
|
|
1 | while (iter.hasNext()) {↵ | | |
|
2 | SampleResult result = (SampleResult) iter.next(↵ | | 1 | for (int i = 0; i < subNodes.length; i++) {↵
|
3 | );↵ | | 2 | HashTree t = generateNode(subNodes[i]);↵
|
|
4 | if (isSampleWanted(result.isSuccessful())) {↵ | | 3 | if (↵
|
5 | visualizer.add(resul↵ | | 4 | t != null) {↵
|
6 | t);↵ | | 5 | subTree.add(element, t);↵
|
7 | }↵ | | 6 | }↵
|
8 | } | | 7 | }
|
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 |