for (int j = 0; j < 16; j++) {
if (bsGetBit()) {
inUse[i16 + j] = true;
}
}
if (this.currRecIdx >= this.recsPerBlock) {
if (!this.readBlock()) {
return; // UNDONE
}
}
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/tar/TarBuffer.java
|
Method name: void recvDecodingTables()
|
|
Method name: void skipRecord()
|
Number of AST nodes: 3
|
|
Number of AST nodes: 3
|
|
1 | for (int j = 0; j < 16; j++) {↵ | | 1 | if (this.currRecIdx >↵
|
2 | ↵ | | 2 | = this.recsPerBlock) {↵
|
3 | if (bsGetBit()) {↵ | | 3 | if (!this.readBlock()) {↵
|
4 | inUse[i16 + j] = true;↵ | | 4 | ↵
|
5 | ↵ | | 5 | return; // UNDONE↵
|
6 | }↵ | | 6 | }↵
|
7 | } | | 7 | }
|
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 | 5 |
-
{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 | 1 |
Time elapsed for statement mapping (ms) | 1.1 |
Clone type | Type 2 |
Mapped Statements
ID |
Statement |
|
ID |
Statement |
16 | if (bsGetBit()) | | 6 | if (!this.readBlock()) |
| | | 7 | |
17 | | | | |
Precondition Violations (1)
Row |
Violation |
1 | Unmatched return; |