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
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
|
// 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.copywithin
description: >
Set values with negative out of bounds end argument.
info: |
22.2.3.5 %TypedArray%.prototype.copyWithin (target, start [ , end ] )
%TypedArray%.prototype.copyWithin is a distinct function that implements the
same algorithm as Array.prototype.copyWithin as defined in 22.1.3.3 except
that the this object's [[ArrayLength]] internal slot is accessed in place of
performing a [[Get]] of "length" and the actual copying of values in step 12
must be performed in a manner that preserves the bit-level encoding of the
source data.
...
22.1.3.3 Array.prototype.copyWithin (target, start [ , end ] )
...
7. If end is undefined, let relativeEnd be len; else let relativeEnd be ?
ToInteger(end).
8. If relativeEnd < 0, let final be max((len + relativeEnd), 0); else let
final be min(relativeEnd, len).
...
includes: [compareArray.js, testTypedArray.js]
features: [TypedArray]
---*/
testWithTypedArrayConstructors(function(TA, N) {
assert(
compareArray(
new TA(N([0, 1, 2, 3])).copyWithin(0, 1, -10),
N([0, 1, 2, 3])
),
'[0, 1, 2, 3].copyWithin(0, 1, -10) -> [0, 1, 2, 3]'
);
assert(
compareArray(
new TA(N([1, 2, 3, 4, 5])).copyWithin(0, 1, -Infinity),
N([1, 2, 3, 4, 5])
),
'[1, 2, 3, 4, 5].copyWithin(0, 1, -Infinity) -> [1, 2, 3, 4, 5]'
);
assert(
compareArray(
new TA(N([0, 1, 2, 3])).copyWithin(0, -2, -10),
N([0, 1, 2, 3])
),
'[0, 1, 2, 3].copyWithin(0, -2, -10) -> [0, 1, 2, 3]'
);
assert(
compareArray(
new TA(N([1, 2, 3, 4, 5])).copyWithin(0, -2, -Infinity),
N([1, 2, 3, 4, 5])
),
'[1, 2, 3, 4, 5].copyWithin(0, -2, -Infinity) -> [1, 2, 3, 4, 5]'
);
assert(
compareArray(
new TA(N([0, 1, 2, 3])).copyWithin(0, -9, -10),
N([0, 1, 2, 3])
),
'[0, 1, 2, 3].copyWithin(0, -9, -10) -> [0, 1, 2, 3]'
);
assert(
compareArray(
new TA(N([1, 2, 3, 4, 5])).copyWithin(0, -9, -Infinity),
N([1, 2, 3, 4, 5])
),
'[1, 2, 3, 4, 5].copyWithin(0, -9, -Infinity) -> [1, 2, 3, 4, 5]'
);
assert(
compareArray(
new TA(N([0, 1, 2, 3])).copyWithin(-3, -2, -10),
N([0, 1, 2, 3])
),
'[0, 1, 2, 3].copyWithin(-3, -2, -10) -> [0, 1, 2, 3]'
);
assert(
compareArray(
new TA(N([1, 2, 3, 4, 5])).copyWithin(-3, -2, -Infinity),
N([1, 2, 3, 4, 5])
),
'[1, 2, 3, 4, 5].copyWithin(-3, -2, -Infinity) -> [1, 2, 3, 4, 5]'
);
assert(
compareArray(
new TA(N([0, 1, 2, 3])).copyWithin(-7, -8, -9),
N([0, 1, 2, 3])
),
'[0, 1, 2, 3].copyWithin(-7, -8, -9) -> [0, 1, 2, 3]'
);
assert(
compareArray(
new TA(N([1, 2, 3, 4, 5])).copyWithin(-7, -8, -Infinity),
N([1, 2, 3, 4, 5])
),
'[1, 2, 3, 4, 5].copyWithin(-7, -8, -Infinity) -> [1, 2, 3, 4, 5]'
);
});
|
