1
Fork 0
mirror of https://github.com/RGBCube/serenity synced 2025-07-27 16:27:35 +00:00

LibJS: Add %TypedArray%.prototype.reduceRight

This commit is contained in:
Idan Horowitz 2021-07-08 05:07:30 +03:00 committed by Linus Groh
parent 2356382938
commit 241f9f21d4
3 changed files with 87 additions and 0 deletions

View file

@ -0,0 +1,47 @@
const TYPED_ARRAYS = [
Uint8Array,
Uint8ClampedArray,
Uint16Array,
Uint32Array,
Int8Array,
Int16Array,
Int32Array,
Float32Array,
Float64Array,
];
const BIGINT_TYPED_ARRAYS = [BigUint64Array, BigInt64Array];
test("basic functionality", () => {
TYPED_ARRAYS.forEach(T => {
expect(T.prototype.reduceRight).toHaveLength(1);
const typedArray = new T(3);
typedArray[0] = 1;
typedArray[1] = 2;
typedArray[2] = 3;
expect(typedArray.reduceRight((accumulator, value) => accumulator + value)).toBe(6);
expect(typedArray.reduceRight((accumulator, value) => accumulator + value, -5)).toBe(1);
const order = [];
typedArray.reduceRight((accumulator, value) => order.push(value), 0);
expect(order).toEqual([3, 2, 1]);
});
BIGINT_TYPED_ARRAYS.forEach(T => {
expect(T.prototype.reduceRight).toHaveLength(1);
const typedArray = new T(3);
typedArray[0] = 1n;
typedArray[1] = 2n;
typedArray[2] = 3n;
expect(typedArray.reduceRight((accumulator, value) => accumulator + value)).toBe(6n);
expect(typedArray.reduceRight((accumulator, value) => accumulator + value, -5n)).toBe(1n);
const order = [];
typedArray.reduceRight((accumulator, value) => order.push(value), 0);
expect(order).toEqual([3n, 2n, 1n]);
});
});