aboutsummaryrefslogtreecommitdiffstats
path: root/tests/auto/declarative/parserstress/tests/ecma/TypeConversion/9.5-2.js
diff options
context:
space:
mode:
Diffstat (limited to 'tests/auto/declarative/parserstress/tests/ecma/TypeConversion/9.5-2.js')
-rw-r--r--tests/auto/declarative/parserstress/tests/ecma/TypeConversion/9.5-2.js173
1 files changed, 0 insertions, 173 deletions
diff --git a/tests/auto/declarative/parserstress/tests/ecma/TypeConversion/9.5-2.js b/tests/auto/declarative/parserstress/tests/ecma/TypeConversion/9.5-2.js
deleted file mode 100644
index 2773052340..0000000000
--- a/tests/auto/declarative/parserstress/tests/ecma/TypeConversion/9.5-2.js
+++ /dev/null
@@ -1,173 +0,0 @@
-/* -*- Mode: C++; tab-width: 2; indent-tabs-mode: nil; c-basic-offset: 2 -*- */
-/* ***** BEGIN LICENSE BLOCK *****
- * Version: MPL 1.1/GPL 2.0/LGPL 2.1
- *
- * The contents of this file are subject to the Mozilla Public License Version
- * 1.1 (the "License"); you may not use this file except in compliance with
- * the License. You may obtain a copy of the License at
- * http://www.mozilla.org/MPL/
- *
- * Software distributed under the License is distributed on an "AS IS" basis,
- * WITHOUT WARRANTY OF ANY KIND, either express or implied. See the License
- * for the specific language governing rights and limitations under the
- * License.
- *
- * The Original Code is Mozilla Communicator client code, released
- * March 31, 1998.
- *
- * The Initial Developer of the Original Code is
- * Netscape Communications Corporation.
- * Portions created by the Initial Developer are Copyright (C) 1998
- * the Initial Developer. All Rights Reserved.
- *
- * Contributor(s):
- *
- * Alternatively, the contents of this file may be used under the terms of
- * either the GNU General Public License Version 2 or later (the "GPL"), or
- * the GNU Lesser General Public License Version 2.1 or later (the "LGPL"),
- * in which case the provisions of the GPL or the LGPL are applicable instead
- * of those above. If you wish to allow use of your version of this file only
- * under the terms of either the GPL or the LGPL, and not to allow others to
- * use your version of this file under the terms of the MPL, indicate your
- * decision by deleting the provisions above and replace them with the notice
- * and other provisions required by the GPL or the LGPL. If you do not delete
- * the provisions above, a recipient may use your version of this file under
- * the terms of any one of the MPL, the GPL or the LGPL.
- *
- * ***** END LICENSE BLOCK ***** */
-
-gTestfile = '9.5-2.js';
-
-/**
- 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 );
-}
-
generated by cgit v1.2.3 (git 2.25.1) at 2024-05-08 00:20:49 +0000