for (int i = 0; i < container.length; i++) {
if (container[i] == item) {
return true;
}
}
return false;
for (int i = 0; i < container.length; i++) {
if (container[i] == item) {
return true;
}
}
return false;
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/report/gui/tree/ReportTreeListener.java
|
Method name: boolean contains(Object[], Object)
|
|
Method name: boolean contains(Object[], Object)
|
Number of AST nodes: 4
|
|
Number of AST nodes: 4
|
|
1 | for (int i = 0; i < container.length; i++) {↵ | | 1 | for (int i = 0; i < container.length; i++) {↵
|
2 | if (container[i] == item) {↵ | | 2 | if (container[i] == item) {↵
|
3 | return true;↵ | | 3 | return true;↵
|
4 | }↵ | | 4 | }↵
|
5 | }↵ | | 5 | }↵
|
6 | return false; | | 6 | return false;
|
See real code fragment |
|
See real code fragment |
Summary
Number of common nesting structure subtrees | 1 |
Number of refactorable cases | 1 |
Number of non-refactorable cases | 0 |
Time elapsed for finding largest common nesting structure subtrees (ms) | 0.2 |
Clones location | Clones are in different classes |
Number of node comparisons | 6 |
-
{Refactorable}
Mapping Summary
Number of mapped statements | 4 |
Number of unmapped statements in the first code fragment | 0 |
Number of unmapped statements in the second code fragment | 0 |
Time elapsed for statement mapping (ms) | 0.5 |
Clone type | Type 1 |
Mapped Statements
ID |
Statement |
|
ID |
Statement |
1 | for (int i = 0; i < container.length; i++) | | 1 | for (int i = 0; i < container.length; i++) |
2 | if (container[i] == item) | | 2 | if (container[i] == item) |
3 | | | 3 | |
4 | return false; | | 4 | return false; |
Precondition Violations (0)
Row |
Violation |