1 /* The contents of this file are subject to the Netscape Public
2 * License Version 1.1 (the "License"); you may not use this file
3 * except in compliance with the License. You may obtain a copy of
4 * the License at http://www.mozilla.org/NPL/
6 * Software distributed under the License is distributed on an "AS
7 * IS" basis, WITHOUT WARRANTY OF ANY KIND, either express or
8 * implied. See the License for the specific language governing
9 * rights and limitations under the License.
11 * The Original Code is Mozilla Communicator client code, released March
14 * The Initial Developer of the Original Code is Netscape Communications
15 * Corporation. Portions created by Netscape are
16 * Copyright (C) 1998 Netscape Communications Corporation. All
24 ECMA Section: 9.6 Type Conversion: ToUint32
25 Description: rules for converting an argument to an unsigned
28 this test uses >>> 0 to convert the argument to
29 an unsigned 32bit integer.
31 1 call ToNumber on argument
32 2 if result is NaN, 0, -0, Infinity, -Infinity
34 3 compute (sign (result(1)) * floor(abs(result 1)))
35 4 compute result(3) modulo 2^32:
43 ToInt32(ToUint32(x)) == ToInt32(x) for all values of x
44 ** NEED TO DO THIS PART IN A SEPARATE TEST FILE **
47 Author: christine@netscape.com
52 var VERSION = "ECMA_1";
54 var testcases = getTestCases();
56 writeHeaderToLog( SECTION + " Type Conversion: ToUint32");
60 for ( tc=0; tc < testcases.length; tc++ ) {
61 testcases[tc].passed = writeTestCaseResult(
64 testcases[tc].description +" = "+
65 testcases[tc].actual );
67 testcases[tc].reason += ( testcases[tc].passed ) ? "" : "wrong value ";
73 function ToUint32( n ) {
75 var sign = ( n < 0 ) ? -1 : 1;
77 if ( Math.abs( n ) == 0 || Math.abs( n ) == Number.POSITIVE_INFINITY) {
80 n = sign * Math.floor( Math.abs(n) )
82 n = n % Math.pow(2,32);
90 function getTestCases() {
91 var array = new Array();
94 array[item++] = new TestCase( SECTION, "0 >>> 0", 0, 0 >>> 0 );
95 // array[item++] = new TestCase( SECTION, "+0 >>> 0", 0, +0 >>> 0);
96 array[item++] = new TestCase( SECTION, "-0 >>> 0", 0, -0 >>> 0 );
97 array[item++] = new TestCase( SECTION, "'Infinity' >>> 0", 0, "Infinity" >>> 0 );
98 array[item++] = new TestCase( SECTION, "'-Infinity' >>> 0", 0, "-Infinity" >>> 0);
99 array[item++] = new TestCase( SECTION, "'+Infinity' >>> 0", 0, "+Infinity" >>> 0 );
100 array[item++] = new TestCase( SECTION, "Number.POSITIVE_INFINITY >>> 0", 0, Number.POSITIVE_INFINITY >>> 0 );
101 array[item++] = new TestCase( SECTION, "Number.NEGATIVE_INFINITY >>> 0", 0, Number.NEGATIVE_INFINITY >>> 0 );
102 array[item++] = new TestCase( SECTION, "Number.NaN >>> 0", 0, Number.NaN >>> 0 );
104 array[item++] = new TestCase( SECTION, "Number.MIN_VALUE >>> 0", 0, Number.MIN_VALUE >>> 0 );
105 array[item++] = new TestCase( SECTION, "-Number.MIN_VALUE >>> 0", 0, Number.MIN_VALUE >>> 0 );
106 array[item++] = new TestCase( SECTION, "0.1 >>> 0", 0, 0.1 >>> 0 );
107 array[item++] = new TestCase( SECTION, "-0.1 >>> 0", 0, -0.1 >>> 0 );
108 array[item++] = new TestCase( SECTION, "1 >>> 0", 1, 1 >>> 0 );
109 array[item++] = new TestCase( SECTION, "1.1 >>> 0", 1, 1.1 >>> 0 );
111 array[item++] = new TestCase( SECTION, "-1.1 >>> 0", ToUint32(-1.1), -1.1 >>> 0 );
112 array[item++] = new TestCase( SECTION, "-1 >>> 0", ToUint32(-1), -1 >>> 0 );
114 array[item++] = new TestCase( SECTION, "2147483647 >>> 0", ToUint32(2147483647), 2147483647 >>> 0 );
115 array[item++] = new TestCase( SECTION, "2147483648 >>> 0", ToUint32(2147483648), 2147483648 >>> 0 );
116 array[item++] = new TestCase( SECTION, "2147483649 >>> 0", ToUint32(2147483649), 2147483649 >>> 0 );
118 array[item++] = new TestCase( SECTION, "4294967295 >>> 0", ToUint32(4294967295), 4294967295 >>> 0 );
119 array[item++] = new TestCase( SECTION, "4294967296 >>> 0", ToUint32(4294967296), 4294967296 >>> 0 );
120 array[item++] = new TestCase( SECTION, "4294967297 >>> 0", ToUint32(4294967297), 4294967297 >>> 0 );
122 array[item++] = new TestCase( SECTION, "-2147483647 >>> 0", ToUint32(-2147483647), -2147483647 >>> 0 );
123 array[item++] = new TestCase( SECTION, "-2147483648 >>> 0", ToUint32(-2147483648), -2147483648 >>> 0 );
124 array[item++] = new TestCase( SECTION, "-2147483649 >>> 0", ToUint32(-2147483649), -2147483649 >>> 0 );
126 array[item++] = new TestCase( SECTION, "-4294967295 >>> 0", ToUint32(-4294967295), -4294967295 >>> 0 );
127 array[item++] = new TestCase( SECTION, "-4294967296 >>> 0", ToUint32(-4294967296), -4294967296 >>> 0 );
128 array[item++] = new TestCase( SECTION, "-4294967297 >>> 0", ToUint32(-4294967297), -4294967297 >>> 0 );
130 array[item++] = new TestCase( SECTION, "'2147483647' >>> 0", ToUint32(2147483647), '2147483647' >>> 0 );
131 array[item++] = new TestCase( SECTION, "'2147483648' >>> 0", ToUint32(2147483648), '2147483648' >>> 0 );
132 array[item++] = new TestCase( SECTION, "'2147483649' >>> 0", ToUint32(2147483649), '2147483649' >>> 0 );
134 array[item++] = new TestCase( SECTION, "'4294967295' >>> 0", ToUint32(4294967295), '4294967295' >>> 0 );
135 array[item++] = new TestCase( SECTION, "'4294967296' >>> 0", ToUint32(4294967296), '4294967296' >>> 0 );
136 array[item++] = new TestCase( SECTION, "'4294967297' >>> 0", ToUint32(4294967297), '4294967297' >>> 0 );