1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
|
// 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 from a with a custom start 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 ] ] )
...
4. If relativeStart < 0, let k be max((len + relativeStart), 0); else let k be
min(relativeStart, len).
...
includes: [compareArray.js, testBigIntTypedArray.js]
features: [BigInt, TypedArray]
---*/
testWithBigIntTypedArrayConstructors(function(TA) {
assert(
compareArray(new TA([0n, 0n, 0n]).fill(8n, 1), [0n, 8n, 8n]),
"Fill elements from custom start position"
);
assert(
compareArray(new TA([0n, 0n, 0n]).fill(8n, 4), [0n, 0n, 0n]),
"start position is never higher than length"
);
assert(
compareArray(new TA([0n, 0n, 0n]).fill(8n, -1), [0n, 0n, 8n]),
"start < 0 sets initial position to max((len + relativeStart), 0)"
);
assert(
compareArray(new TA([0n, 0n, 0n]).fill(8n, -5), [8n, 8n, 8n]),
"start position is 0 when (len + relativeStart) < 0"
);
});
|
