diff options
author | Rick Waldron <waldron.rick@gmail.com> | 2018-02-15 18:03:39 -0500 |
---|---|---|
committer | GitHub <noreply@github.com> | 2018-02-15 18:03:39 -0500 |
commit | 7024f3fa11e7e5169c4d42fc8ee7de3e93f7de9d (patch) | |
tree | f2f7a2758bade35564399fad33fd8cb9fa98580f /test/built-ins/TypedArray/prototype/fill/BigInt/fill-values.js | |
parent | afa24856b4b9bc00315b3e47745187d33c471406 (diff) | |
parent | 857f1d429b939c6feef1951041b5c91c9f3a8b4a (diff) | |
download | qtdeclarative-testsuites-7024f3fa11e7e5169c4d42fc8ee7de3e93f7de9d.tar.gz |
Merge pull request #1413 from leobalter/cxielarko-bigint-ta-3
BigInt+TypedArray tests, splitted
Diffstat (limited to 'test/built-ins/TypedArray/prototype/fill/BigInt/fill-values.js')
-rw-r--r-- | test/built-ins/TypedArray/prototype/fill/BigInt/fill-values.js | 44 |
1 files changed, 44 insertions, 0 deletions
diff --git a/test/built-ins/TypedArray/prototype/fill/BigInt/fill-values.js b/test/built-ins/TypedArray/prototype/fill/BigInt/fill-values.js new file mode 100644 index 000000000..ec390d28b --- /dev/null +++ b/test/built-ins/TypedArray/prototype/fill/BigInt/fill-values.js @@ -0,0 +1,44 @@ +// Copyright (C) 2016 the V8 project authors. All rights reserved. +// This code is governed by the BSD license found in the LICENSE file. +/*--- +esid: sec-%typedarray%.prototype.fill +description: > + Fills all the elements with `value` from a default start and index. +info: | + 22.2.3.8 %TypedArray%.prototype.fill (value [ , start [ , end ] ] ) + + %TypedArray%.prototype.fill is a distinct function that implements the same + algorithm as Array.prototype.fill as defined in 22.1.3.6 except that the this + object's [[ArrayLength]] internal slot is accessed in place of performing a + [[Get]] of "length". The implementation of the algorithm may be optimized with + the knowledge that the this value is an object that has a fixed length and + whose integer indexed properties are not sparse. However, such optimization + must not introduce any observable changes in the specified behaviour of the + algorithm. + + ... + + 22.1.3.6 Array.prototype.fill (value [ , start [ , end ] ] ) + + ... + 7. Repeat, while k < final + a. Let Pk be ! ToString(k). + b. Perform ? Set(O, Pk, value, true). +includes: [compareArray.js, testBigIntTypedArray.js] +features: [BigInt, TypedArray] +---*/ + +testWithBigIntTypedArrayConstructors(function(TA) { + assert( + compareArray( + new TA().fill(8n), + [] + ), + "does not fill an empty instance" + ); + + assert( + compareArray(new TA([0n, 0n, 0n]).fill(8n), [8n, 8n, 8n]), + "Default start and end indexes are 0 and this.length" + ); +}); |