js/src/tests/ecma/Array/15.4.1.2.js

Wed, 31 Dec 2014 06:09:35 +0100

author
Michael Schloh von Bennewitz <michael@schloh.com>
date
Wed, 31 Dec 2014 06:09:35 +0100
changeset 0
6474c204b198
permissions
-rw-r--r--

Cloned upstream origin tor-browser at tor-browser-31.3.0esr-4.5-1-build1
revision ID fc1c9ff7c1b2defdbc039f12214767608f46423f for hacking purpose.

michael@0 1 /* -*- Mode: C++; tab-width: 2; indent-tabs-mode: nil; c-basic-offset: 2 -*- */
michael@0 2 /* This Source Code Form is subject to the terms of the Mozilla Public
michael@0 3 * License, v. 2.0. If a copy of the MPL was not distributed with this
michael@0 4 * file, You can obtain one at http://mozilla.org/MPL/2.0/. */
michael@0 5
michael@0 6
michael@0 7 /**
michael@0 8 File Name: 15.4.1.2.js
michael@0 9 ECMA Section: 15.4.1.2 Array(len)
michael@0 10
michael@0 11 Description: When Array is called as a function rather than as a
michael@0 12 constructor, it creates and initializes a new array
michael@0 13 object. Thus, the function call Array(...) is
michael@0 14 equivalent to the object creationi new Array(...) with
michael@0 15 the same arguments.
michael@0 16
michael@0 17 An array is created and returned as if by the
michael@0 18 expression new Array(len).
michael@0 19
michael@0 20 Author: christine@netscape.com
michael@0 21 Date: 7 october 1997
michael@0 22 */
michael@0 23 var SECTION = "15.4.1.2";
michael@0 24 var VERSION = "ECMA_1";
michael@0 25 startTest();
michael@0 26 var TITLE = "Array Constructor Called as a Function: Array(len)";
michael@0 27
michael@0 28 writeHeaderToLog( SECTION + " "+ TITLE);
michael@0 29
michael@0 30 new TestCase( SECTION,
michael@0 31 "(Array()).length",
michael@0 32 0,
michael@0 33 (Array()).length );
michael@0 34
michael@0 35 new TestCase( SECTION,
michael@0 36 "(Array(0)).length",
michael@0 37 0,
michael@0 38 (Array(0)).length );
michael@0 39
michael@0 40 new TestCase( SECTION,
michael@0 41 "(Array(1)).length",
michael@0 42 1,
michael@0 43 (Array(1)).length );
michael@0 44
michael@0 45 new TestCase( SECTION,
michael@0 46 "(Array(10)).length",
michael@0 47 10,
michael@0 48 (Array(10)).length );
michael@0 49
michael@0 50 new TestCase( SECTION,
michael@0 51 "(Array('1')).length",
michael@0 52 1,
michael@0 53 (Array('1')).length );
michael@0 54
michael@0 55 new TestCase( SECTION,
michael@0 56 "(Array(1000)).length",
michael@0 57 1000,
michael@0 58 (Array(1000)).length );
michael@0 59
michael@0 60 new TestCase( SECTION,
michael@0 61 "(Array('1000')).length",
michael@0 62 1,
michael@0 63 (Array('1000')).length );
michael@0 64
michael@0 65 new TestCase( SECTION,
michael@0 66 "(Array(4294967295)).length",
michael@0 67 ToUint32(4294967295),
michael@0 68 (Array(4294967295)).length );
michael@0 69
michael@0 70 new TestCase( SECTION,
michael@0 71 "(Array(Math.pow(2,31)-1)).length",
michael@0 72 ToUint32(Math.pow(2,31)-1),
michael@0 73 (Array(Math.pow(2,31)-1)).length );
michael@0 74
michael@0 75 new TestCase( SECTION,
michael@0 76 "(Array(Math.pow(2,31))).length",
michael@0 77 ToUint32(Math.pow(2,31)),
michael@0 78 (Array(Math.pow(2,31))).length );
michael@0 79
michael@0 80 new TestCase( SECTION,
michael@0 81 "(Array(Math.pow(2,31)+1)).length",
michael@0 82 ToUint32(Math.pow(2,31)+1),
michael@0 83 (Array(Math.pow(2,31)+1)).length );
michael@0 84
michael@0 85 new TestCase( SECTION,
michael@0 86 "(Array('8589934592')).length",
michael@0 87 1,
michael@0 88 (Array("8589934592")).length );
michael@0 89
michael@0 90 new TestCase( SECTION,
michael@0 91 "(Array('4294967296')).length",
michael@0 92 1,
michael@0 93 (Array("4294967296")).length );
michael@0 94
michael@0 95 new TestCase( SECTION,
michael@0 96 "(Array(1073741823)).length",
michael@0 97 ToUint32(1073741823),
michael@0 98 (Array(1073741823)).length );
michael@0 99
michael@0 100 new TestCase( SECTION,
michael@0 101 "(Array(1073741824)).length",
michael@0 102 ToUint32(1073741824),
michael@0 103 (Array(1073741824)).length );
michael@0 104
michael@0 105 new TestCase( SECTION,
michael@0 106 "(Array('a string')).length",
michael@0 107 1,
michael@0 108 (Array("a string")).length );
michael@0 109
michael@0 110 test();
michael@0 111
michael@0 112 function ToUint32( n ) {
michael@0 113 n = Number( n );
michael@0 114 var sign = ( n < 0 ) ? -1 : 1;
michael@0 115
michael@0 116 if ( Math.abs( n ) == 0 || Math.abs( n ) == Number.POSITIVE_INFINITY) {
michael@0 117 return 0;
michael@0 118 }
michael@0 119 n = sign * Math.floor( Math.abs(n) )
michael@0 120
michael@0 121 n = n % Math.pow(2,32);
michael@0 122
michael@0 123 if ( n < 0 ){
michael@0 124 n += Math.pow(2,32);
michael@0 125 }
michael@0 126
michael@0 127 return ( n );
michael@0 128 }

mercurial