| OLD | NEW | 
|---|
| 1 // Copyright 2008 the V8 project authors. All rights reserved. | 1 // Copyright 2008 the V8 project authors. All rights reserved. | 
| 2 // Redistribution and use in source and binary forms, with or without | 2 // Redistribution and use in source and binary forms, with or without | 
| 3 // modification, are permitted provided that the following conditions are | 3 // modification, are permitted provided that the following conditions are | 
| 4 // met: | 4 // met: | 
| 5 // | 5 // | 
| 6 //     * Redistributions of source code must retain the above copyright | 6 //     * Redistributions of source code must retain the above copyright | 
| 7 //       notice, this list of conditions and the following disclaimer. | 7 //       notice, this list of conditions and the following disclaimer. | 
| 8 //     * Redistributions in binary form must reproduce the above | 8 //     * Redistributions in binary form must reproduce the above | 
| 9 //       copyright notice, this list of conditions and the following | 9 //       copyright notice, this list of conditions and the following | 
| 10 //       disclaimer in the documentation and/or other materials provided | 10 //       disclaimer in the documentation and/or other materials provided | 
| (...skipping 15 matching lines...) Expand all  Loading... | 
| 26 // OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. | 26 // OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. | 
| 27 | 27 | 
| 28 // Ensure that Number.MAX_VALUE and Number.MIN_VALUE are extreme. | 28 // Ensure that Number.MAX_VALUE and Number.MIN_VALUE are extreme. | 
| 29 function testLimits() { | 29 function testLimits() { | 
| 30   var i; var eps; | 30   var i; var eps; | 
| 31   for (i = 0, eps = 1; i < 1100; i++, eps /= 2) { | 31   for (i = 0, eps = 1; i < 1100; i++, eps /= 2) { | 
| 32     var mulAboveMax = Number.MAX_VALUE * (1 + eps); | 32     var mulAboveMax = Number.MAX_VALUE * (1 + eps); | 
| 33     var addAboveMax = Number.MAX_VALUE + 1/eps; | 33     var addAboveMax = Number.MAX_VALUE + 1/eps; | 
| 34     var mulBelowMin = Number.MIN_VALUE * (1 - eps); | 34     var mulBelowMin = Number.MIN_VALUE * (1 - eps); | 
| 35     var addBelowMin = Number.MIN_VALUE - eps; | 35     var addBelowMin = Number.MIN_VALUE - eps; | 
| 36     assertTrue(mulAboveMax == Number.MAX_VALUE || mulAboveMax == Infinity); | 36     assertTrue(mulAboveMax == Number.MAX_VALUE || | 
| 37     assertTrue(addAboveMax == Number.MAX_VALUE || addAboveMax == Infinity); | 37                mulAboveMax == Infinity, "mul" + i); | 
| 38     assertTrue(mulBelowMin == Number.MIN_VALUE || mulBelowMin <= 0); | 38     assertTrue(addAboveMax == Number.MAX_VALUE || | 
| 39     assertTrue(addBelowMin == Number.MIN_VALUE || addBelowMin <= 0); | 39                addAboveMax == Infinity, "add" + i); | 
|  | 40     assertTrue(mulBelowMin == Number.MIN_VALUE || | 
|  | 41                mulBelowMin <= 0, "mul2" + i); | 
|  | 42     assertTrue(addBelowMin == Number.MIN_VALUE || | 
|  | 43                addBelowMin <= 0, "add2" + i); | 
| 40   } | 44   } | 
| 41 } | 45 } | 
| 42 | 46 | 
| 43 testLimits(); | 47 testLimits(); | 
| OLD | NEW | 
|---|