for (int i = 0; i < 16; i++) {
if (bsGetBit()) {
inUse16 |= 1 << i;
}
}
if (dateTime != null) {
validate();
}
return millis;
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/types/selectors/DateSelector.java
|
Method name: void recvDecodingTables()
|
|
Method name: long getMillis()
|
Number of AST nodes: 3
|
|
Number of AST nodes: 3
|
|
1 | for (int i = 0; i < 16; i++) {↵ | | |
|
2 | if (bsGetBit()) {↵ | | 1 | if (dateTime != null) {↵
|
| | | 2 | validate();↵
|
3 | ↵ | | 3 | }↵
|
4 | inUse16 |= 1 << i;↵ | | 4 | ↵
|
5 | }↵ | | |
|
6 | } | | 5 | return millis;
|
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 |
Number of node comparisons | 1 |