for (int i = 0; i < 16; i++) {
if (bsGetBit()) {
inUse16 |= 1 << i;
}
}
if (manifest == null) {
if (manifestFile != null) {
// if we haven't got the manifest yet, attempt to
// get it now and have manifest be the final merge
manifest = getManifest(manifestFile);
}
}
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/taskdefs/Jar.java
|
Method name: void recvDecodingTables()
|
|
Method name: Manifest createManifest()
|
Number of AST nodes: 3
|
|
Number of AST nodes: 3
|
|
1 | for (int i = 0; i < 16; i++) {↵ | | |
|
2 | if (bsGetBit()) {↵ | | |
|
3 | inUse16 |= 1 << i↵ | | 1 | if (manifest == null) {↵
|
| | | 2 | if (manifestFile != null) {↵
|
| | | 3 | // if we haven't got the manifest yet, attempt to↵
|
| | | 4 | // get it now and have manifest be the final merge↵
|
4 | ;↵ | | 5 | manifest = getManifest(manifestFile);↵
|
5 | }↵ | | 6 | ↵
|
| | | 7 | }↵
|
6 | } | | 8 | }
|
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 |