1 files changed, 128 insertions, 0 deletions
diff --git a/js/src/tests/ecma/Array/15.4.1.2.js b/js/src/tests/ecma/Array/15.4.1.2.js
new file mode 100644
index 000000000..08e3c0d77
--- /dev/null
+++ b/js/src/tests/ecma/Array/15.4.1.2.js
@@ -0,0 +1,128 @@
+/* -*- 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:          15.4.1.2.js
+   ECMA Section:       15.4.1.2 Array(len)
+
+   Description:        When Array is called as a function rather than as a
+   constructor, it creates and initializes a new array
+   object.  Thus, the function call Array(...) is
+   equivalent to the object creationi new Array(...) with
+   the same arguments.
+
+   An array is created and returned as if by the
+   expression new Array(len).
+
+   Author:             christine@netscape.com
+   Date:               7 october 1997
+*/
+var SECTION = "15.4.1.2";
+var VERSION = "ECMA_1";
+startTest();
+var TITLE   = "Array Constructor Called as a Function:  Array(len)";
+
+writeHeaderToLog( SECTION + " "+ TITLE);
+
+new TestCase( SECTION, 
+	      "(Array()).length",            
+	      0,                             
+	      (Array()).length );
+
+new TestCase( SECTION,
+	      "(Array(0)).length",           
+	      0,                             
+	      (Array(0)).length );
+
+new TestCase( SECTION,
+	      "(Array(1)).length",           
+	      1,                             
+	      (Array(1)).length );
+
+new TestCase( SECTION,
+	      "(Array(10)).length",          
+	      10,                            
+	      (Array(10)).length );
+
+new TestCase( SECTION,
+	      "(Array('1')).length",         
+	      1,                             
+	      (Array('1')).length );
+
+new TestCase( SECTION,
+	      "(Array(1000)).length",        
+	      1000,                          
+	      (Array(1000)).length );
+
+new TestCase( SECTION,
+	      "(Array('1000')).length",      
+	      1,                             
+	      (Array('1000')).length );
+
+new TestCase( SECTION,
+	      "(Array(4294967295)).length",  
+	      ToUint32(4294967295),          
+	      (Array(4294967295)).length );
+
+new TestCase( SECTION,
+	      "(Array(Math.pow(2,31)-1)).length",    
+	      ToUint32(Math.pow(2,31)-1),    
+	      (Array(Math.pow(2,31)-1)).length );
+
+new TestCase( SECTION,
+	      "(Array(Math.pow(2,31))).length",      
+	      ToUint32(Math.pow(2,31)),      
+	      (Array(Math.pow(2,31))).length );
+
+new TestCase( SECTION,
+	      "(Array(Math.pow(2,31)+1)).length",    
+	      ToUint32(Math.pow(2,31)+1),    
+	      (Array(Math.pow(2,31)+1)).length );
+
+new TestCase( SECTION,
+	      "(Array('8589934592')).length",
+	      1,                             
+	      (Array("8589934592")).length );
+
+new TestCase( SECTION,
+	      "(Array('4294967296')).length",
+	      1,                             
+	      (Array("4294967296")).length );
+
+new TestCase( SECTION,
+	      "(Array(1073741823)).length",  
+	      ToUint32(1073741823),          
+	      (Array(1073741823)).length );
+
+new TestCase( SECTION,
+	      "(Array(1073741824)).length",  
+	      ToUint32(1073741824),	       
+	      (Array(1073741824)).length );
+
+new TestCase( SECTION,
+	      "(Array('a string')).length",  
+	      1,                             
+	      (Array("a string")).length );
+
+test();
+
+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 );
+}