This repository was archived by the owner on Apr 26, 2024. It is now read-only.
-
Notifications
You must be signed in to change notification settings - Fork 20
/
Copy pathpolyfill.test.js
281 lines (222 loc) · 7.01 KB
/
polyfill.test.js
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
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
// @ts-check
require("./polyfill.js");
const tape = require("tape");
tape("Array.prototype.toReversed works with array-like values", (t) => {
const orig = {
0: 3,
1: 2,
2: 1,
length: 3
};
const expected = [1, 2, 3];
const copy = Array.prototype.toReversed.call(orig);
t.deepEqual(copy, expected);
t.notEqual(orig, copy);
t.notDeepEqual(orig, copy);
t.end();
});
tape("Array.prototype.toReversed", (t) => {
const orig = [3, 2, 1];
const expected = [1, 2, 3];
const copy = orig.toReversed();
t.deepEqual(copy, expected);
t.notEqual(orig, copy);
t.notDeepEqual(orig, copy);
t.end();
});
tape("Array.prototype.toSorted", (t) => {
const orig = [3, 1, 2];
const expected = [1, 2, 3];
const copy = orig.toSorted();
t.deepEqual(copy, expected);
t.notEqual(orig, copy);
t.notDeepEqual(orig, copy);
t.end();
});
tape("Array.prototype.toSorted(compareFn)", (t) => {
const orig = [3, 1, 2];
const expected = [3, 2, 1];
function compareFn(a, b) {
return a > b ? -1 : 1;
}
const copy = orig.toSorted(compareFn);
t.deepEqual(copy, expected);
t.notEqual(orig, copy);
t.notDeepEqual(orig, copy);
t.end();
});
tape("Array.prototype.toSpliced", (t) => {
const orig = [1, -1, 0, -1, 4];
const expected = [1, 2, 3, 4];
const idx = 1;
const delNum = 3;
const ins = [2, 3];
const copy = orig.toSpliced(idx, delNum, ...ins);
t.deepEqual(copy, expected);
t.notEqual(orig, copy);
t.notDeepEqual(orig, copy);
t.end();
});
tape("Array.prototype.with", (t) => {
const orig = [1, 1, 3];
const expected = [1, 2, 3];
const idx = 1;
const val = 2;
const copy = orig.with(idx, val);
t.deepEqual(copy, expected);
t.notEqual(orig, copy);
t.notDeepEqual(orig, copy);
t.end();
});
tape(`Array.prototype.with negativeIndex`, (t) => {
const orig = [1, 2, 2];
const expected = [1, 2, 3];
const idx = -1;
const val = 3;
const copy = orig.with(idx, val);
t.deepEqual(copy, expected);
t.notEqual(orig, copy);
t.notDeepEqual(orig, copy);
t.end();
});
tape(`Array.prototype.with out of bounds`, (t) => {
const orig = [1, 2, 2];
const idx = 3;
const val = 4;
t.throws(() => {
orig.with(idx, val);
}, RangeError);
t.end();
});
tape(`Array does not use Symbol.species for the new methods`, (t) => {
class SubClass extends Array { }
const orig = new SubClass([1, 2, 3]);
function assertType(arr) {
t.equal(arr instanceof SubClass, false);
t.equal(arr instanceof Array, true);
}
assertType(orig.with(0, 0));
assertType(orig.toReversed());
assertType(orig.toSorted());
assertType(orig.toSpliced(0, 0));
t.end();
});
tape("Array.prototype[Symbol.unscopables]", (t) => {
const methodNames = ['toReversed', 'toSorted', 'toSpliced']; // 'with' is omitted as it is a keyword
t.plan(6);
// ensure we are checking the correct methods names, otherwise test will always pass, regardless of Symbol.unscopables
for (const method of methodNames) {
t.equal(typeof Array.prototype[method], 'function');
}
const marker = Symbol();
const toReversed = marker;
const toSorted = marker;
const toSpliced = marker;
// @ts-expect-error: 'with' is unsupported
with ([]) {
for (const method of methodNames) {
t.equal(eval(method), marker);
}
}
t.end();
});
[
Int8Array,
Uint8Array,
Uint8ClampedArray,
Int16Array,
Uint16Array,
Int32Array,
Uint32Array,
Float32Array,
Float64Array
].forEach((TypedArray) => {
tape(`${TypedArray.name}.prototype.toReversed`, (t) => {
const orig = new TypedArray([3, 2, 1]);
const expected = new TypedArray([1, 2, 3]);
const copy = orig.toReversed();
t.deepEqual(copy, expected);
t.notEqual(orig, copy);
t.notDeepEqual(orig, copy);
t.end();
});
tape(`${TypedArray.name}.prototype.toSorted`, (t) => {
const orig = new TypedArray([3, 1, 2]);
const expected = new TypedArray([1, 2, 3]);
const copy = orig.toSorted();
t.deepEqual(copy, expected);
t.notEqual(orig, copy);
t.notDeepEqual(orig, copy);
t.end();
});
tape(`${TypedArray.name}.prototype.toSorted(compareFn)`, (t) => {
const orig = new TypedArray([3, 1, 2]);
const expected = new TypedArray([3, 2, 1]);
function compareFn(a, b) {
return a > b ? -1 : 1;
}
const copy = orig.toSorted(compareFn);
t.deepEqual(copy, expected);
t.notEqual(orig, copy);
t.notDeepEqual(orig, copy);
t.end();
});
tape(`${TypedArray.name}.prototype.toSpliced`, (t) => {
const orig = new TypedArray([1, -1, 0, -1, 4]);
const expected = new TypedArray([1, 2, 3, 4]);
const idx = 1;
const delNum = 3;
const ins = [2, 3];
const copy = orig.toSpliced(idx, delNum, ...ins);
t.deepEqual(copy, expected);
t.notEqual(orig, copy);
t.notDeepEqual(orig, copy);
t.end();
});
tape(`${TypedArray.name}.prototype.with`, (t) => {
const orig = new TypedArray([1, 1, 3]);
const expected = new TypedArray([1, 2, 3]);
const idx = 1;
const val = 2;
const copy = orig.with(idx, val);
t.deepEqual(copy, expected);
t.notEqual(orig, copy);
t.notDeepEqual(orig, copy);
t.end();
});
tape(`${TypedArray.name}.prototype.with negativeIndex`, (t) => {
const orig = new TypedArray([1, 2, 2]);
const expected = new TypedArray([1, 2, 3]);
const idx = -1;
const val = 3;
const copy = orig.with(idx, val);
t.deepEqual(copy, expected);
t.notEqual(orig, copy);
t.notDeepEqual(orig, copy);
t.end();
});
tape(`${TypedArray.name}.prototype.with out of bounds`, (t) => {
const orig = new TypedArray([1, 2, 2]);
const idx = 3;
const val = 4;
t.throws(() => {
orig.with(idx, val);
}, RangeError);
t.end();
});
tape(`${TypedArray.name} does not use Symbol.species for the new methods`, (t) => {
class SubClass extends TypedArray { }
function assertType(arr) {
t.equal(arr instanceof SubClass, false);
t.equal(arr instanceof TypedArray, true);
}
/** @type {Uint8Array} */
// @ts-ignore
const orig = new SubClass([1, 2, 3]);
assertType(orig.with(0, 0));
assertType(orig.toReversed());
assertType(orig.toSorted());
assertType(orig.toSpliced(0, 0));
t.end();
});
});