diff options
Diffstat (limited to 'js/src/tests/test262/built-ins/Array/prototype/toSpliced/length-exceeding-array-length-limit.js')
-rw-r--r-- | js/src/tests/test262/built-ins/Array/prototype/toSpliced/length-exceeding-array-length-limit.js | 78 |
1 files changed, 78 insertions, 0 deletions
diff --git a/js/src/tests/test262/built-ins/Array/prototype/toSpliced/length-exceeding-array-length-limit.js b/js/src/tests/test262/built-ins/Array/prototype/toSpliced/length-exceeding-array-length-limit.js new file mode 100644 index 0000000000..a8ad3e4624 --- /dev/null +++ b/js/src/tests/test262/built-ins/Array/prototype/toSpliced/length-exceeding-array-length-limit.js @@ -0,0 +1,78 @@ +// Copyright (C) 2021 Igalia, S.L. All rights reserved. +// This code is governed by the BSD license found in the LICENSE file. + +/*--- +esid: sec-array.prototype.toSpliced +description: > + Array.prototype.toSpliced limits the length to 2 ** 32 - 1 +info: | + Array.prototype.toSpliced ( start, deleteCount, ...items ) + + ... + 3. Let len be ? LengthOfArrayLike(O). + ... + 11. Let newLen be len + insertCount - actualDeleteCount. + 12. If _newLen_ > 2 ** 53< - 1, throw a *TypeError* exception. + 13. Let A be ? ArrayCreate(𝔽(newLen)). + ... + + ArrayCreate ( length [, proto ] ) + + 1. If length > 2 ** 32 - 1, throw a RangeError exception. +features: [change-array-by-copy, exponentiation] +---*/ + +// Object with large "length" property +var arrayLike = { + get "0"() { + throw new Test262Error("Get 0"); + }, + get "4294967295" () { // 2 ** 32 - 1 + throw new Test262Error("Get 4294967295"); + }, + get "4294967296" () { // 2 ** 32 + throw new Test262Error("Get 4294967296"); + }, + length: 2 ** 32 +}; + +assert.throws(RangeError, function() { + Array.prototype.toSpliced.call(arrayLike, 0, 0); +}); + +arrayLike.length = 2 ** 32 - 1; +assert.throws(RangeError, function() { + Array.prototype.toSpliced.call(arrayLike, 0, 0, 1); +}); + +arrayLike.length = 2 ** 32; +assert.throws(RangeError, function() { + Array.prototype.toSpliced.call(arrayLike, 0, 0, 1); +}); + +arrayLike.length = 2 ** 32 + 1; +assert.throws(RangeError, function() { + Array.prototype.toSpliced.call(arrayLike, 0, 0, 1); +}); + +arrayLike.length = 2 ** 52 - 2; +assert.throws(RangeError, function() { + Array.prototype.toSpliced.call(arrayLike, 0, 0, 1); +}); + +arrayLike.length = 2 ** 53 - 1; +assert.throws(TypeError, function() { + Array.prototype.toSpliced.call(arrayLike, 0, 0, 1); +}); + +arrayLike.length = 2 ** 53; +assert.throws(TypeError, function() { + Array.prototype.toSpliced.call(arrayLike, 0, 0, 1); +}); + +arrayLike.length = 2 ** 53 + 1; +assert.throws(TypeError, function() { + Array.prototype.toSpliced.call(arrayLike, 0, 0, 1); +}); + +reportCompare(0, 0); |