if(exponent > 0) {
if(num > Double.MAX_VALUE * Math.pow(10.0, (double) -exponent)) {
throw new ERange(ERange.Kind.Overflow);
}
}
if(num < Double.MIN_VALUE * Math.pow(10.0, (double) -exponent)) {
throw new ERange(ERange.Kind.Underflow);
}
Clone fragments detected by clone detection tool
File path: /jruby-1.4.0/src/org/jruby/util/Convert2.java
|
|
File path: /jruby-1.4.0/src/org/jruby/util/Convert2.java
|
Method name: double stringToDouble(int, int[])
|
|
Method name: double stringToDouble(int, int[])
|
Number of AST nodes: 3
|
|
Number of AST nodes: 2
|
|
1 | if(exponent > 0) {↵ | | |
|
2 | if(num > Double.MAX_VALUE * Math.pow(10.0, (double) -exponent)) {↵ | | 1 | if(num < Double.MIN_VALUE * Math.pow(10.0, (double) -exponent)) {↵
|
3 | throw new ERange(ERange.Kind.Overflow);↵ | | 2 | throw new ERange(ERange.Kind.Underflow);↵
|
4 | } ↵ | | 3 | }
|
5 | } | | | |
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.3 |
Clones location | Clones are in the same method |
Number of node comparisons | 1 |