for (int j = 0; j < 16; j++) {
if (bsGetBit()) {
inUse[i16 + j] = true;
}
}
if (in != null) {
in.close();
slack = null;
in = null;
}
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/util/ReaderInputStream.java
|
Method name: void recvDecodingTables()
|
|
Method name: void close()
|
Number of AST nodes: 3
|
|
Number of AST nodes: 4
|
|
1 | for (int j = 0; j < 16; j++) {↵ | | 1 | if (in != null) {↵
|
2 | if (bsGetBit()) {↵ | | 2 | ↵
|
3 | inUse[i16 + j] = true;↵ | | |
|
4 | }↵ | | |
|
5 | ↵ | | 3 | in.close();↵
|
| | | 4 | slack = null;↵
|
| | | 5 | in = null;↵
|
6 | } | | 6 | }
|
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.0 |
Clones location | Clones are in different classes having the same super class |
Number of node comparisons | 1 |