LadybirdBrowser/ladybird
1
1
Fork 0
mirror of https://github.com/LadybirdBrowser/ladybird.git synced 2024-09-21 02:08:12 +03:00
Code Issues Packages Projects Releases Wiki Activity

LibJS: Add %TypedArray%.prototype.reduceRight

Browse Source
This commit is contained in:
Idan Horowitz 2021-07-08 05:07:30 +03:00 committed by Linus Groh
parent 2356382938
commit 241f9f21d4
Notes: sideshowbarker 2024-07-18 10:03:41 +09:00 
Author: https://github.com/IdanHo
Commit: https://github.com/SerenityOS/serenity/commit/241f9f21d47
Pull-request: https://github.com/SerenityOS/serenity/pull/8551
Reviewed-by: https://github.com/linusg
Reviewed-by: https://github.com/trflynn89
3 changed files with 87 additions and 0 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

39
Userland/Libraries/LibJS/Runtime/TypedArrayPrototype.cpp
View File

@ -38,6 +38,7 @@ void TypedArrayPrototype::initialize(GlobalObject& object)
define_native_function(vm.names.indexOf, index_of, 1, attr);
define_native_function(vm.names.lastIndexOf, last_index_of, 1, attr);
define_native_function(vm.names.reduce, reduce, 1, attr);
define_native_function(vm.names.reduceRight, reduce_right, 1, attr);
define_native_function(vm.names.some, some, 1, attr);
define_native_function(vm.names.join, join, 1, attr);
define_native_function(vm.names.keys, keys, 0, attr);
@ -443,6 +444,44 @@ JS_DEFINE_NATIVE_FUNCTION(TypedArrayPrototype::reduce)
return accumulator;
}
// 23.2.3.21 %TypedArray%.prototype.reduceRight ( callbackfn [ , initialValue ] ), https://tc39.es/ecma262/#sec-%typedarray%.prototype.reduce
JS_DEFINE_NATIVE_FUNCTION(TypedArrayPrototype::reduce_right)
{
auto* typed_array = typed_array_from(vm, global_object);
if (!typed_array)
return {};
auto length = typed_array->array_length();
auto* callback_function = callback_from_args(global_object, vm.names.reduce.as_string());
if (!callback_function)
return {};
if (length == 0 && vm.argument_count() <= 1) {
vm.throw_exception<TypeError>(global_object, ErrorType::ReduceNoInitial);
return {};
}
i32 k = (i32)length - 1;
Value accumulator;
if (vm.argument_count() > 1) {
accumulator = vm.argument(1);
} else {
accumulator = typed_array->get(k);
--k;
}
for (; k >= 0; --k) {
auto k_value = typed_array->get(k);
accumulator = vm.call(*callback_function, js_undefined(), accumulator, k_value, Value(k), typed_array);
if (vm.exception())
return {};
}
return accumulator;
}
// 23.2.3.25 %TypedArray%.prototype.some ( callbackfn [ , thisArg ] ), https://tc39.es/ecma262/#sec-%typedarray%.prototype.some
JS_DEFINE_NATIVE_FUNCTION(TypedArrayPrototype::some)
{

1
Userland/Libraries/LibJS/Runtime/TypedArrayPrototype.h
View File

@ -35,6 +35,7 @@ private:
JS_DECLARE_NATIVE_FUNCTION(index_of);
JS_DECLARE_NATIVE_FUNCTION(last_index_of);
JS_DECLARE_NATIVE_FUNCTION(reduce);
JS_DECLARE_NATIVE_FUNCTION(reduce_right);
JS_DECLARE_NATIVE_FUNCTION(some);
JS_DECLARE_NATIVE_FUNCTION(join);
JS_DECLARE_NATIVE_FUNCTION(keys);

47
Userland/Libraries/LibJS/Tests/builtins/TypedArray/TypedArray.prototype.reduceRight.js Normal file
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]);
});
});