multiplier = 1000;
} else if (i > 3 && i < 9) {
multiplier = 1024;
} else if (i > 8 && i < 13) {
multiplier = 1000000;
if (i > 21 && i < 27) {
multiplier = 1073741824L;
} else if (i > 26 && i < 31) {
multiplier = 1000000000000L;
} else if (i > 30 && i < 36) {
multiplier = 1099511627776L;
}
Clone fragments detected by clone detection tool
File path: /apache-ant-1.7.0/src/org/apache/tools/ant/types/selectors/SizeSelector.java
|
|
File path: /apache-ant-1.7.0/src/org/apache/tools/ant/types/selectors/SizeSelector.java
|
Method name: void setUnits(ByteUnits)
|
|
Method name: void setUnits(ByteUnits)
|
Number of AST nodes: 3
|
|
Number of AST nodes: 6
|
|
| | | 1 | if (i > 21 && i < 27) {↵
|
1 | multiplier = 1000;↵ | | 2 | multiplier = 1073741824L;↵
|
2 | } else if (i > 3 && i < 9) {↵ | | 3 | } else if (i > 26 && i < 31) {↵
|
3 | multiplier = 1024;↵ | | 4 | multiplier = 1000000000000L;↵
|
4 | } else if (i > 8 && i < 13) {↵ | | 5 | } else if (i > 30 && i < 36) {↵
|
5 | multiplier = 1000000; | | 6 | multiplier = 1099511627776L;↵
|
| | | 7 | }
|
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 the same method |
Number of node comparisons | 0 |