| 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 11 matching lines...) Expand all Loading... |
| 22 // LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, | 22 // LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, |
| 23 // DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY | 23 // DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY |
| 24 // THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT | 24 // THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT |
| 25 // (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE | 25 // (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE |
| 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 function toInt32(x) { | 28 function toInt32(x) { |
| 29 return x | 0; | 29 return x | 0; |
| 30 } | 30 } |
| 31 | 31 |
| 32 assertEquals(0, toInt32(Infinity)); | 32 assertEquals(0, toInt32(Infinity), "Inf"); |
| 33 assertEquals(0, toInt32(-Infinity)); | 33 assertEquals(0, toInt32(-Infinity), "-Inf"); |
| 34 assertEquals(0, toInt32(NaN)); | 34 assertEquals(0, toInt32(NaN), "NaN"); |
| 35 assertEquals(0, toInt32(0.0)); | 35 assertEquals(0, toInt32(0.0), "zero"); |
| 36 assertEquals(0, toInt32(-0.0)); | 36 assertEquals(0, toInt32(-0.0), "-zero"); |
| 37 | 37 |
| 38 assertEquals(0, toInt32(Number.MIN_VALUE)); | 38 assertEquals(0, toInt32(Number.MIN_VALUE)); |
| 39 assertEquals(0, toInt32(-Number.MIN_VALUE)); | 39 assertEquals(0, toInt32(-Number.MIN_VALUE)); |
| 40 assertEquals(0, toInt32(0.1)); | 40 assertEquals(0, toInt32(0.1)); |
| 41 assertEquals(0, toInt32(-0.1)); | 41 assertEquals(0, toInt32(-0.1)); |
| 42 assertEquals(1, toInt32(1)); | 42 assertEquals(1, toInt32(1), "one"); |
| 43 assertEquals(1, toInt32(1.1)); | 43 assertEquals(1, toInt32(1.1), "onepointone"); |
| 44 assertEquals(-1, toInt32(-1)); | 44 assertEquals(-1, toInt32(-1), "-one"); |
| 45 assertEquals(0, toInt32(0.6), "truncate positive (0.6)"); | 45 assertEquals(0, toInt32(0.6), "truncate positive (0.6)"); |
| 46 assertEquals(1, toInt32(1.6), "truncate positive (1.6)"); | 46 assertEquals(1, toInt32(1.6), "truncate positive (1.6)"); |
| 47 assertEquals(0, toInt32(-0.6), "truncate negative (-0.6)"); | 47 assertEquals(0, toInt32(-0.6), "truncate negative (-0.6)"); |
| 48 assertEquals(-1, toInt32(-1.6), "truncate negative (-1.6)"); | 48 assertEquals(-1, toInt32(-1.6), "truncate negative (-1.6)"); |
| 49 | 49 |
| 50 assertEquals(2147483647, toInt32(2147483647)); | 50 assertEquals(2147483647, toInt32(2147483647)); |
| 51 assertEquals(-2147483648, toInt32(2147483648)); | 51 assertEquals(-2147483648, toInt32(2147483648)); |
| 52 assertEquals(-2147483647, toInt32(2147483649)); | 52 assertEquals(-2147483647, toInt32(2147483649)); |
| 53 | 53 |
| 54 assertEquals(-1, toInt32(4294967295)); | 54 assertEquals(-1, toInt32(4294967295)); |
| (...skipping 65 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
| 120 assertEquals(-Math.pow(2,31), toInt32(-bignum)); | 120 assertEquals(-Math.pow(2,31), toInt32(-bignum)); |
| 121 assertEquals(0, toInt32(2 * bignum)); | 121 assertEquals(0, toInt32(2 * bignum)); |
| 122 assertEquals(0, toInt32(-(2 * bignum))); | 122 assertEquals(0, toInt32(-(2 * bignum))); |
| 123 assertEquals(0, toInt32(bignum - Math.pow(2,31))); | 123 assertEquals(0, toInt32(bignum - Math.pow(2,31))); |
| 124 assertEquals(0, toInt32(-(bignum - Math.pow(2,31)))); | 124 assertEquals(0, toInt32(-(bignum - Math.pow(2,31)))); |
| 125 | 125 |
| 126 // max_fraction is largest number below 1. | 126 // max_fraction is largest number below 1. |
| 127 var max_fraction = (1 - Math.pow(2,-53)); | 127 var max_fraction = (1 - Math.pow(2,-53)); |
| 128 assertEquals(0, toInt32(max_fraction)); | 128 assertEquals(0, toInt32(max_fraction)); |
| 129 assertEquals(0, toInt32(-max_fraction)); | 129 assertEquals(0, toInt32(-max_fraction)); |
| OLD | NEW |