for (int i = pos; i >= 0; i--) {
if (get(i) == o) {
return i;
}
}
return -1;
for (int i = pos; i < size(); i++) {
if (get(i) == o) {
return i;
}
}
return -1;
Clone fragments detected by clone detection tool
File path: /apache-ant-1.7.0/src/org/apache/tools/ant/util/IdentityStack.java
|
|
File path: /apache-ant-1.7.0/src/org/apache/tools/ant/util/IdentityStack.java
|
Method name: int lastIndexOf(Object, int)
|
|
Method name: int indexOf(Object, int)
|
Number of AST nodes: 4
|
|
Number of AST nodes: 4
|
|
1 | for (int i = pos; i >= 0; i--) {↵ | | 1 | for (int i = pos; i < size(); i++) {↵
|
2 | if (get(i) == o) {↵ | | 2 | if (get(i) == o) {↵
|
3 | return i;↵ | | 3 | return i;↵
|
4 | }↵ | | 4 | }↵
|
5 | }↵ | | 5 | }↵
|
6 | return -1; | | 6 | return -1;
|
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.3 |
Clones location | Clones are declared in the same class |
Number of node comparisons | 5 |
-
{Refactorable}
Mapping Summary
Number of mapped statements | 2 |
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.2 |
Clone type | Type 1 |
Mapped Statements
ID |
Statement |
|
ID |
Statement |
2 | if (get(i) == o) | | 2 | if (get(i) == o) |
3 | | | 3 | |
Precondition Violations (0)
Row |
Violation |