for (int i = 0; i < container.length; i++) {
if (container[i] == item) {
return true;
}
}
for (int i = 0; i < results.length; i++){
message = results[i].getFailureMessage();
if (message != null) {
break;
}
}
Clone fragments detected by clone detection tool
File path: /jakarta-jmeter-2.3.2/src/org/apache/jmeter/gui/tree/JMeterTreeListener.java
|
|
File path: /jakarta-jmeter-2.3.2/src/org/apache/jmeter/save/CSVSaveService.java
|
Method name: boolean contains(Object[], Object)
|
|
Method name: String resultToDelimitedString(SampleEvent, String)
|
Number of AST nodes: 3
|
|
Number of AST nodes: 4
|
|
1 | for (int i = 0; i < container.length; i++) {↵ | | 1 | for (int i = 0; i < results.length; i++){↵
|
2 | if (container[i] == item) {↵ | | |
|
3 | return true;↵ | | |
|
| | | 2 | message = results[i].getFailureMessage();↵
|
| | | 3 | if (message != null) {↵
|
| | | 4 | break;↵
|
4 | }↵ | | 5 | }↵
|
5 | } | | 6 | }
|
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 |