for (int i = 0; i < 16; i++) {
if (bsGetBit()) {
inUse16 |= 1 << i;
}
}
if (!initialized) {
initInternalFilters();
}
return in.read();
Clone fragments detected by clone detection tool
File path: /apache-ant-1.7.0/src/org/apache/tools/bzip2/CBZip2InputStream.java
|
|
File path: /apache-ant-1.7.0/src/org/apache/tools/ant/filters/FixCrLfFilter.java
|
Method name: void recvDecodingTables()
|
|
Method name: int read()
|
Number of AST nodes: 3
|
|
Number of AST nodes: 3
|
|
1 | for (int i = 0; i < 16; i++) {↵ | | 1 | if (!in↵
|
2 | if (bsGetBit()) {↵ | | |
|
3 | inUse16 |= 1 << i;↵ | | |
|
4 | ↵ | | 2 | itialized) {↵
|
| | | 3 | initInternalFilters();↵
|
5 | }↵ | | 4 | }↵
|
6 | } | | 5 | return in.read();
|
See real code fragment |
|
See real code fragment |
Summary
Number of common nesting structure subtrees | 1 |
Number of refactorable cases | 0 |
Number of non-refactorable cases | 1 |
Time elapsed for finding largest common nesting structure subtrees (ms) | 0.1 |
Clones location | Clones are in different classes |
Number of node comparisons | 4 |
-
{Non-refactorable}
Mapping Summary
Number of mapped statements | 1 |
Number of unmapped statements in the first code fragment | 1 |
Number of unmapped statements in the second code fragment | 2 |
Time elapsed for statement mapping (ms) | 0.9 |
Clone type | Type 3 |
Mapped Statements
ID |
Statement |
|
ID |
Statement |
8 | if (bsGetBit()) | | 1 | if (!initialized) |
| | | 2 | |
9 | | | | |
| | | 3 | return in.read(); |
Precondition Violations (1)
Row |
Violation |
1 | Unmatched return in.read(); |