gecko-dev/js/tests/ecma/Array/15.4.2.2-1.js
1999-11-02 22:23:59 +00:00

124 lines
5.3 KiB
JavaScript

/* The contents of this file are subject to the Netscape 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/NPL/
*
* 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 Netscape are
* Copyright (C) 1998 Netscape Communications Corporation. All
* Rights Reserved.
*
* Contributor(s):
*
*/
/**
File Name: 15.4.2.2-1.js
ECMA Section: 15.4.2.2 new Array(len)
Description: This description only applies of the constructor is
given two or more arguments.
The [[Prototype]] property of the newly constructed
object is set to the original Array prototype object,
the one that is the initial value of Array.prototype(0)
(15.4.3.1).
The [[Class]] property of the newly constructed object
is set to "Array".
If the argument len is a number, then the length
property of the newly constructed object is set to
ToUint32(len).
If the argument len is not a number, then the length
property of the newly constructed object is set to 1
and the 0 property of the newly constructed object is
set to len.
This file tests cases where len is a number.
The cases in this test need to be updated since the
ToUint32 description has changed.
Author: christine@netscape.com
Date: 7 october 1997
*/
var SECTION = "15.4.2.2-1";
var VERSION = "ECMA_1";
startTest();
var TITLE = "The Array Constructor: new Array( len )";
writeHeaderToLog( SECTION + " "+ TITLE);
var testcases = getTestCases();
test();
function getTestCases() {
var array = new Array();
var item = 0;
array[item++] = new TestCase( SECTION, "new Array(0)", "", (new Array(0)).toString() );
array[item++] = new TestCase( SECTION, "typeof new Array(0)", "object", (typeof new Array(0)) );
array[item++] = new TestCase( SECTION, "(new Array(0)).length", 0, (new Array(0)).length );
array[item++] = new TestCase( SECTION, "(new Array(0)).toString", Array.prototype.toString, (new Array(0)).toString );
array[item++] = new TestCase( SECTION, "new Array(1)", "", (new Array(1)).toString() );
array[item++] = new TestCase( SECTION, "new Array(1).length", 1, (new Array(1)).length );
array[item++] = new TestCase( SECTION, "(new Array(1)).toString", Array.prototype.toString, (new Array(1)).toString );
array[item++] = new TestCase( SECTION, "(new Array(-0)).length", 0, (new Array(-0)).length );
array[item++] = new TestCase( SECTION, "(new Array(0)).length", 0, (new Array(0)).length );
array[item++] = new TestCase( SECTION, "(new Array(10)).length", 10, (new Array(10)).length );
array[item++] = new TestCase( SECTION, "(new Array('1')).length", 1, (new Array('1')).length );
array[item++] = new TestCase( SECTION, "(new Array(1000)).length", 1000, (new Array(1000)).length );
array[item++] = new TestCase( SECTION, "(new Array('1000')).length", 1, (new Array('1000')).length );
array[item++] = new TestCase( SECTION, "(new Array(4294967295)).length", ToUint32(4294967295), (new Array(4294967295)).length );
array[item++] = new TestCase( SECTION, "(new Array('8589934592')).length", 1, (new Array("8589934592")).length );
array[item++] = new TestCase( SECTION, "(new Array('4294967296')).length", 1, (new Array("4294967296")).length );
array[item++] = new TestCase( SECTION, "(new Array(1073741824)).length", ToUint32(1073741824), (new Array(1073741824)).length );
return ( array );
}
function test() {
for ( tc=0; tc < testcases.length; tc++ ) {
testcases[tc].passed = writeTestCaseResult(
testcases[tc].expect,
testcases[tc].actual,
testcases[tc].description +" = "+
testcases[tc].actual );
testcases[tc].reason += ( testcases[tc].passed )
? ""
: "wrong value ";
}
stopTest();
return ( testcases );
}
function ToUint32( 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) )
n = n % Math.pow(2,32);
if ( n < 0 ){
n += Math.pow(2,32);
}
return ( n );
}