зеркало из https://github.com/mozilla/pjs.git
124 строки
3.9 KiB
JavaScript
124 строки
3.9 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.5.2-2.js
|
|
ECMA Section: Array.length
|
|
Description:
|
|
15.4.5.2 length
|
|
The length property of this Array object is always numerically greater
|
|
than the name of every property whose name is an array index.
|
|
|
|
The length property has the attributes { DontEnum, DontDelete }.
|
|
|
|
This test verifies that the Array.length property is not Read Only.
|
|
|
|
Author: christine@netscape.com
|
|
Date: 12 november 1997
|
|
*/
|
|
|
|
var SECTION = "15.4.5.2-2";
|
|
var VERSION = "ECMA_1";
|
|
startTest();
|
|
var TITLE = "Array.length";
|
|
|
|
writeHeaderToLog( SECTION + " "+ TITLE);
|
|
|
|
var testcases = new Array();
|
|
|
|
addCase( new Array(), 0, Math.pow(2,14), Math.pow(2,14) );
|
|
|
|
addCase( new Array(), 0, 1, 1 );
|
|
|
|
addCase( new Array(Math.pow(2,12)), Math.pow(2,12), 0, 0 );
|
|
addCase( new Array(Math.pow(2,13)), Math.pow(2,13), Math.pow(2,12), Math.pow(2,12) );
|
|
addCase( new Array(Math.pow(2,12)), Math.pow(2,12), Math.pow(2,12), Math.pow(2,12) );
|
|
addCase( new Array(Math.pow(2,14)), Math.pow(2,14), Math.pow(2,12), Math.pow(2,12) )
|
|
|
|
// some tests where array is not empty
|
|
// array is populated with strings
|
|
for ( var arg = "", i = 0; i < Math.pow(2,12); i++ ) {
|
|
arg += String(i) + ( i != Math.pow(2,12)-1 ? "," : "" );
|
|
|
|
}
|
|
// print(i +":"+arg);
|
|
|
|
var a = eval( "new Array("+arg+")" );
|
|
|
|
addCase( a, i, i, i );
|
|
addCase( a, i, Math.pow(2,12)+i+1, Math.pow(2,12)+i+1, true );
|
|
addCase( a, Math.pow(2,12)+5, 0, 0, true );
|
|
|
|
test();
|
|
|
|
function addCase( object, old_len, set_len, new_len, checkitems ) {
|
|
object.length = set_len;
|
|
|
|
testcases[testcases.length] = new TestCase( SECTION,
|
|
"array = new Array("+ old_len+"); array.length = " + set_len +
|
|
"; array.length",
|
|
new_len,
|
|
object.length );
|
|
|
|
if ( checkitems ) {
|
|
// verify that items between old and newlen are all undefined
|
|
if ( new_len < old_len ) {
|
|
var passed = true;
|
|
for ( var i = new_len; i < old_len; i++ ) {
|
|
if ( object[i] != void 0 ) {
|
|
passed = false;
|
|
}
|
|
}
|
|
testcases[testcases.length] = new TestCase( SECTION,
|
|
"verify that array items have been deleted",
|
|
true,
|
|
passed );
|
|
}
|
|
if ( new_len > old_len ) {
|
|
var passed = true;
|
|
for ( var i = old_len; i < new_len; i++ ) {
|
|
if ( object[i] != void 0 ) {
|
|
passed = false;
|
|
}
|
|
}
|
|
testcases[testcases.length] = new TestCase( SECTION,
|
|
"verify that new items are undefined",
|
|
true,
|
|
passed );
|
|
}
|
|
}
|
|
|
|
}
|
|
|
|
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 );
|
|
}
|