LibJS: Add %TypedArray%.prototype.sort

2025-07-27 18:57:35 +00:00 · 2021-07-09 17:41:04 +03:00 · 2021-07-09 17:41:04 +03:00 · 52aa777d49
commit 52aa777d49
parent f98a98506f
3 changed files with 200 additions and 0 deletions
--- a/Userland/Libraries/LibJS/Tests/builtins/TypedArray/TypedArray.prototype.sort.js
+++ b/Userland/Libraries/LibJS/Tests/builtins/TypedArray/TypedArray.prototype.sort.js
@ -0,0 +1,53 @@
+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.sort).toHaveLength(1);
+
+        const typedArray = new T(3);
+        typedArray[0] = 3;
+        typedArray[1] = 1;
+        typedArray[2] = 2;
+
+        expect(typedArray.sort()).toBe(typedArray);
+        expect(typedArray[0]).toBe(1);
+        expect(typedArray[1]).toBe(2);
+        expect(typedArray[2]).toBe(3);
+
+        expect(typedArray.sort(() => 1)).toBe(typedArray);
+        expect(typedArray[0]).toBe(3);
+        expect(typedArray[1]).toBe(2);
+        expect(typedArray[2]).toBe(1);
+    });
+
+    BIGINT_TYPED_ARRAYS.forEach(T => {
+        expect(T.prototype.sort).toHaveLength(1);
+
+        const typedArray = new T(3);
+        typedArray[0] = 3n;
+        typedArray[1] = 1n;
+        typedArray[2] = 2n;
+
+        expect(typedArray.sort()).toBe(typedArray);
+        expect(typedArray[0]).toBe(1n);
+        expect(typedArray[1]).toBe(2n);
+        expect(typedArray[2]).toBe(3n);
+
+        expect(typedArray.sort(() => 1)).toBe(typedArray);
+        expect(typedArray[0]).toBe(3n);
+        expect(typedArray[1]).toBe(2n);
+        expect(typedArray[2]).toBe(1n);
+    });
+});