for (long i = 0; i < n; i++) {
if (read() == -1) {
return i;
}
}
for (int i = pos; i < size(); i++) {
if (get(i) == o) {
return i;
}
}
Clone fragments detected by clone detection tool
File path: /apache-ant-1.7.0/src/org/apache/tools/ant/filters/BaseFilterReader.java
|
|
File path: /apache-ant-1.7.0/src/org/apache/tools/ant/util/IdentityStack.java
|
Method name: long skip(long)
|
|
Method name: int indexOf(Object, int)
|
Number of AST nodes: 3
|
|
Number of AST nodes: 3
|
|
1 | for (long i = 0; i < n; i++) {↵ | | 1 | for (int i = pos; i < size(); i++) {↵
|
2 | if (read() == -1) {↵ | | 2 | if (get(i) == o) {↵
|
3 | return i;↵ | | 3 | return i;↵
|
4 | }↵ | | 4 | }↵
|
5 | } | | 5 | }
|
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 |