Google Git
Sign in
cobalt / cobalt / 71840339e1109efe930df5c60712d91cdcc962a8 / . / src / third_party / mozjs-45 / js / src / tests / ecma / TypeConversion / 9.5-2.js
blob: 6f39ac544da691d6a16823051e62bf4cc17ff44b [file] [log] [blame]
/* -*- tab-width: 2; indent-tabs-mode: nil; js-indent-level: 2 -*- */
/* This Source Code Form is subject to the terms of the Mozilla Public
* License, v. 2.0. If a copy of the MPL was not distributed with this
* file, You can obtain one at http://mozilla.org/MPL/2.0/. */
/**
File Name: 9.5-2.js
ECMA Section: 9.5 Type Conversion: ToInt32
Description: rules for converting an argument to a signed 32 bit integer
this test uses << 0 to convert the argument to a 32bit
integer.
The operator ToInt32 converts its argument to one of 2^32
integer values in the range -2^31 through 2^31 inclusive.
This operator functions as follows:
1 call ToNumber on argument
2 if result is NaN, 0, -0, return 0
3 compute (sign (result(1)) * floor(abs(result 1)))
4 compute result(3) modulo 2^32:
5 if result(4) is greater than or equal to 2^31, return
result(5)-2^32. otherwise, return result(5)
special cases:
-0 returns 0
Infinity returns 0
-Infinity returns 0
ToInt32(ToUint32(x)) == ToInt32(x) for all values of x
Numbers greater than 2^31 (see step 5 above)
(note http://bugzilla.mozilla.org/show_bug.cgi?id=120083)
Author: christine@netscape.com
Date: 17 july 1997
*/
var SECTION = "9.5-2";
var VERSION = "ECMA_1";
startTest();
writeHeaderToLog( SECTION + " ToInt32");
new TestCase( SECTION, "0 << 0", 0, 0 << 0 );
new TestCase( SECTION, "-0 << 0", 0, -0 << 0 );
new TestCase( SECTION, "Infinity << 0", 0, "Infinity" << 0 );
new TestCase( SECTION, "-Infinity << 0", 0, "-Infinity" << 0 );
new TestCase( SECTION, "Number.POSITIVE_INFINITY << 0", 0, Number.POSITIVE_INFINITY << 0 );
new TestCase( SECTION, "Number.NEGATIVE_INFINITY << 0", 0, Number.NEGATIVE_INFINITY << 0 );
new TestCase( SECTION, "Number.NaN << 0", 0, Number.NaN << 0 );
new TestCase( SECTION, "Number.MIN_VALUE << 0", 0, Number.MIN_VALUE << 0 );
new TestCase( SECTION, "-Number.MIN_VALUE << 0", 0, -Number.MIN_VALUE << 0 );
new TestCase( SECTION, "0.1 << 0", 0, 0.1 << 0 );
new TestCase( SECTION, "-0.1 << 0", 0, -0.1 << 0 );
new TestCase( SECTION, "1 << 0", 1, 1 << 0 );
new TestCase( SECTION, "1.1 << 0", 1, 1.1 << 0 );
new TestCase( SECTION, "-1 << 0", ToInt32(-1), -1 << 0 );
new TestCase( SECTION, "2147483647 << 0", ToInt32(2147483647), 2147483647 << 0 );
new TestCase( SECTION, "2147483648 << 0", ToInt32(2147483648), 2147483648 << 0 );
new TestCase( SECTION, "2147483649 << 0", ToInt32(2147483649), 2147483649 << 0 );
new TestCase( SECTION, "(Math.pow(2,31)-1) << 0", ToInt32(2147483647), (Math.pow(2,31)-1) << 0 );
new TestCase( SECTION, "Math.pow(2,31) << 0", ToInt32(2147483648), Math.pow(2,31) << 0 );
new TestCase( SECTION, "(Math.pow(2,31)+1) << 0", ToInt32(2147483649), (Math.pow(2,31)+1) << 0 );
new TestCase( SECTION, "(Math.pow(2,32)-1) << 0", ToInt32(4294967295), (Math.pow(2,32)-1) << 0 );
new TestCase( SECTION, "(Math.pow(2,32)) << 0", ToInt32(4294967296), (Math.pow(2,32)) << 0 );
new TestCase( SECTION, "(Math.pow(2,32)+1) << 0", ToInt32(4294967297), (Math.pow(2,32)+1) << 0 );
new TestCase( SECTION, "4294967295 << 0", ToInt32(4294967295), 4294967295 << 0 );
new TestCase( SECTION, "4294967296 << 0", ToInt32(4294967296), 4294967296 << 0 );
new TestCase( SECTION, "4294967297 << 0", ToInt32(4294967297), 4294967297 << 0 );
new TestCase( SECTION, "'2147483647' << 0", ToInt32(2147483647), '2147483647' << 0 );
new TestCase( SECTION, "'2147483648' << 0", ToInt32(2147483648), '2147483648' << 0 );
new TestCase( SECTION, "'2147483649' << 0", ToInt32(2147483649), '2147483649' << 0 );
new TestCase( SECTION, "'4294967295' << 0", ToInt32(4294967295), '4294967295' << 0 );
new TestCase( SECTION, "'4294967296' << 0", ToInt32(4294967296), '4294967296' << 0 );
new TestCase( SECTION, "'4294967297' << 0", ToInt32(4294967297), '4294967297' << 0 );
new TestCase( SECTION, "-2147483647 << 0", ToInt32(-2147483647), -2147483647 << 0 );
new TestCase( SECTION, "-2147483648 << 0", ToInt32(-2147483648), -2147483648 << 0 );
new TestCase( SECTION, "-2147483649 << 0", ToInt32(-2147483649), -2147483649 << 0 );
new TestCase( SECTION, "-4294967295 << 0", ToInt32(-4294967295), -4294967295 << 0 );
new TestCase( SECTION, "-4294967296 << 0", ToInt32(-4294967296), -4294967296 << 0 );
new TestCase( SECTION, "-4294967297 << 0", ToInt32(-4294967297), -4294967297 << 0 );
/*
* Numbers between 2^31 and 2^32 will have a negative ToInt32 per ECMA (see step 5 of introduction)
* (These are by stevechapel@earthlink.net; cf. http://bugzilla.mozilla.org/show_bug.cgi?id=120083)
*/
new TestCase( SECTION, "2147483648.25 << 0", ToInt32(2147483648.25), 2147483648.25 << 0 );
new TestCase( SECTION, "2147483648.5 << 0", ToInt32(2147483648.5), 2147483648.5 << 0 );
new TestCase( SECTION, "2147483648.75 << 0", ToInt32(2147483648.75), 2147483648.75 << 0 );
new TestCase( SECTION, "4294967295.25 << 0", ToInt32(4294967295.25), 4294967295.25 << 0 );
new TestCase( SECTION, "4294967295.5 << 0", ToInt32(4294967295.5), 4294967295.5 << 0 );
new TestCase( SECTION, "4294967295.75 << 0", ToInt32(4294967295.75), 4294967295.75 << 0 );
new TestCase( SECTION, "3000000000.25 << 0", ToInt32(3000000000.25), 3000000000.25 << 0 );
new TestCase( SECTION, "3000000000.5 << 0", ToInt32(3000000000.5), 3000000000.5 << 0 );
new TestCase( SECTION, "3000000000.75 << 0", ToInt32(3000000000.75), 3000000000.75 << 0 );
/*
* Numbers between - 2^31 and - 2^32
*/
new TestCase( SECTION, "-2147483648.25 << 0", ToInt32(-2147483648.25), -2147483648.25 << 0 );
new TestCase( SECTION, "-2147483648.5 << 0", ToInt32(-2147483648.5), -2147483648.5 << 0 );
new TestCase( SECTION, "-2147483648.75 << 0", ToInt32(-2147483648.75), -2147483648.75 << 0 );
new TestCase( SECTION, "-4294967295.25 << 0", ToInt32(-4294967295.25), -4294967295.25 << 0 );
new TestCase( SECTION, "-4294967295.5 << 0", ToInt32(-4294967295.5), -4294967295.5 << 0 );
new TestCase( SECTION, "-4294967295.75 << 0", ToInt32(-4294967295.75), -4294967295.75 << 0 );
new TestCase( SECTION, "-3000000000.25 << 0", ToInt32(-3000000000.25), -3000000000.25 << 0 );
new TestCase( SECTION, "-3000000000.5 << 0", ToInt32(-3000000000.5), -3000000000.5 << 0 );
new TestCase( SECTION, "-3000000000.75 << 0", ToInt32(-3000000000.75), -3000000000.75 << 0 );
test();
function ToInt32( n ) {
n = Number( n );
var sign = ( n < 0 ) ? -1 : 1;
if ( Math.abs( n ) == 0 || Math.abs( n ) == Number.POSITIVE_INFINITY) {
return 0;
}
n = (sign * Math.floor( Math.abs(n) )) % Math.pow(2,32);
if ( sign == -1 ) {
n = ( n < -Math.pow(2,31) ) ? n + Math.pow(2,32) : n;
} else{
n = ( n >= Math.pow(2,31) ) ? n - Math.pow(2,32) : n;
}
return ( n );
}