@typescript-deploys/pr-build 5.2.0-pr-54546-4 → 5.2.0-pr-54281-18

package/lib/lib.es2023.array.d.ts

@@ -39,50 +39,6 @@ interface Array<T> {
      * predicate. If it is not provided, undefined is used instead.
      */
     findLastIndex(predicate: (value: T, index: number, array: T[]) => unknown, thisArg?: any): number;
-
-    /**
-     * Returns a copy of an array with its elements reversed.
-     */
-    toReversed(): T[];
-
-    /**
-     * Returns a copy of an array with its elements sorted.
-     * @param compareFn Function used to determine the order of the elements. It is expected to return
-     * a negative value if the first argument is less than the second argument, zero if they're equal, and a positive
-     * value otherwise. If omitted, the elements are sorted in ascending, ASCII character order.
-     * ```ts
-     * [11, 2, 22, 1].toSorted((a, b) => a - b) // [1, 2, 11, 22]
-     * ```
-     */
-    toSorted(compareFn?: (a: T, b: T) => number): T[];
-
-    /**
-     * Copies an array and removes elements and, if necessary, inserts new elements in their place. Returns the copied array.
-     * @param start The zero-based location in the array from which to start removing elements.
-     * @param deleteCount The number of elements to remove.
-     * @param items Elements to insert into the copied array in place of the deleted elements.
-     * @returns The copied array.
-     */
-    toSpliced(start: number, deleteCount: number, ...items: T[]): T[];
-
-    /**
-     * Copies an array and removes elements while returning the remaining elements.
-     * @param start The zero-based location in the array from which to start removing elements.
-     * @param deleteCount The number of elements to remove.
-     * @returns A copy of the original array with the remaining elements.
-     */
-    toSpliced(start: number, deleteCount?: number): T[];
-
-    /**
-     * Copies an array, then overwrites the value at the provided index with the
-     * given value. If the index is negative, then it replaces from the end
-     * of the array.
-     * @param index The index of the value to overwrite. If the index is
-     * negative, then it replaces from the end of the array.
-     * @param value The value to write into the copied array.
-     * @returns The copied array with the updated value.
-     */
-    with(index: number, value: T): T[];
 }
 
 interface ReadonlyArray<T> {
@@ -95,14 +51,8 @@ interface ReadonlyArray<T> {
      * @param thisArg If provided, it will be used as the this value for each invocation of
      * predicate. If it is not provided, undefined is used instead.
      */
-    findLast<S extends T>(
-        predicate: (value: T, index: number, array: readonly T[]) => value is S,
-        thisArg?: any
-    ): S | undefined;
-    findLast(
-        predicate: (value: T, index: number, array: readonly T[]) => unknown,
-        thisArg?: any
-    ): T | undefined;
+    findLast<S extends T>(predicate: (value: T, index: number, array: readonly T[]) => value is S, thisArg?: any): S | undefined;
+    findLast(predicate: (value: T, index: number, array: readonly T[]) => unknown, thisArg?: any): T | undefined;
 
     /**
      * Returns the index of the last element in the array where predicate is true, and -1
@@ -113,54 +63,7 @@ interface ReadonlyArray<T> {
      * @param thisArg If provided, it will be used as the this value for each invocation of
      * predicate. If it is not provided, undefined is used instead.
      */
-    findLastIndex(
-        predicate: (value: T, index: number, array: readonly T[]) => unknown,
-        thisArg?: any
-    ): number;
-
-    /**
-     * Copies the array and returns the copied array with all of its elements reversed.
-     */
-    toReversed(): T[];
-
-    /**
-     * Copies and sorts the array.
-     * @param compareFn Function used to determine the order of the elements. It is expected to return
-     * a negative value if the first argument is less than the second argument, zero if they're equal, and a positive
-     * value otherwise. If omitted, the elements are sorted in ascending, ASCII character order.
-     * ```ts
-     * [11, 2, 22, 1].toSorted((a, b) => a - b) // [1, 2, 11, 22]
-     * ```
-     */
-    toSorted(compareFn?: (a: T, b: T) => number): T[];
-
-    /**
-     * Copies an array and removes elements while, if necessary, inserting new elements in their place, returning the remaining elements.
-     * @param start The zero-based location in the array from which to start removing elements.
-     * @param deleteCount The number of elements to remove.
-     * @param items Elements to insert into the copied array in place of the deleted elements.
-     * @returns A copy of the original array with the remaining elements.
-     */
-    toSpliced(start: number, deleteCount: number, ...items: T[]): T[];
-
-    /**
-     * Copies an array and removes elements while returning the remaining elements.
-     * @param start The zero-based location in the array from which to start removing elements.
-     * @param deleteCount The number of elements to remove.
-     * @returns A copy of the original array with the remaining elements.
-     */
-    toSpliced(start: number, deleteCount?: number): T[];
-
-    /**
-     * Copies an array, then overwrites the value at the provided index with the
-     * given value. If the index is negative, then it replaces from the end
-     * of the array
-     * @param index The index of the value to overwrite. If the index is
-     * negative, then it replaces from the end of the array.
-     * @param value The value to insert into the copied array.
-     * @returns A copy of the original array with the inserted value.
-     */
-    with(index: number, value: T): T[];
+    findLastIndex(predicate: (value: T, index: number, array: readonly T[]) => unknown, thisArg?: any): number;
 }
 
 interface Int8Array {
@@ -173,18 +76,8 @@ interface Int8Array {
      * @param thisArg If provided, it will be used as the this value for each invocation of
      * predicate. If it is not provided, undefined is used instead.
      */
-    findLast<S extends number>(
-        predicate: (
-            value: number,
-            index: number,
-            array: Int8Array
-        ) => value is S,
-        thisArg?: any
-    ): S | undefined;
-    findLast(
-        predicate: (value: number, index: number, array: Int8Array) => unknown,
-        thisArg?: any
-    ): number | undefined;
+    findLast<S extends number>(predicate: (value: number, index: number, array: Int8Array) => value is S, thisArg?: any): S | undefined;
+    findLast(predicate: (value: number, index: number, array: Int8Array) => unknown, thisArg?: any): number | undefined;
 
     /**
      * Returns the index of the last element in the array where predicate is true, and -1
@@ -195,36 +88,7 @@ interface Int8Array {
      * @param thisArg If provided, it will be used as the this value for each invocation of
      * predicate. If it is not provided, undefined is used instead.
      */
-    findLastIndex(
-        predicate: (value: number, index: number, array: Int8Array) => unknown,
-        thisArg?: any
-    ): number;
-
-    /**
-     * Copies the array and returns the copy with the elements in reverse order.
-     */
-    toReversed(): Uint8Array;
-
-    /**
-     * Copies and sorts the array.
-     * @param compareFn Function used to determine the order of the elements. It is expected to return
-     * a negative value if the first argument is less than the second argument, zero if they're equal, and a positive
-     * value otherwise. If omitted, the elements are sorted in ascending, ASCII character order.
-     * ```ts
-     * const myNums = Uint8Array.from([11, 2, 22, 1]);
-     * myNums.toSorted((a, b) => a - b) // Uint8Array(4) [1, 2, 11, 22]
-     * ```
-     */
-    toSorted(compareFn?: (a: number, b: number) => number): Uint8Array;
-
-    /**
-     * Copies the array and inserts the given number at the provided index.
-     * @param index The index of the value to overwrite. If the index is
-     * negative, then it replaces from the end of the array.
-     * @param value The value to insert into the copied array.
-     * @returns A copy of the original array with the inserted value.
-     */
-    with(index: number, value: number): Uint8Array;
+    findLastIndex(predicate: (value: number, index: number, array: Int8Array) => unknown, thisArg?: any): number;
 }
 
 interface Uint8Array {
@@ -237,18 +101,8 @@ interface Uint8Array {
      * @param thisArg If provided, it will be used as the this value for each invocation of
      * predicate. If it is not provided, undefined is used instead.
      */
-    findLast<S extends number>(
-        predicate: (
-            value: number,
-            index: number,
-            array: Uint8Array
-        ) => value is S,
-        thisArg?: any
-    ): S | undefined;
-    findLast(
-        predicate: (value: number, index: number, array: Uint8Array) => unknown,
-        thisArg?: any
-    ): number | undefined;
+    findLast<S extends number>(predicate: (value: number, index: number, array: Uint8Array) => value is S, thisArg?: any): S | undefined;
+    findLast(predicate: (value: number, index: number, array: Uint8Array) => unknown, thisArg?: any): number | undefined;
 
     /**
      * Returns the index of the last element in the array where predicate is true, and -1
@@ -259,36 +113,7 @@ interface Uint8Array {
      * @param thisArg If provided, it will be used as the this value for each invocation of
      * predicate. If it is not provided, undefined is used instead.
      */
-    findLastIndex(
-        predicate: (value: number, index: number, array: Uint8Array) => unknown,
-        thisArg?: any
-    ): number;
-
-    /**
-     * Copies the array and returns the copy with the elements in reverse order.
-     */
-    toReversed(): Uint8Array;
-
-    /**
-     * Copies and sorts the array.
-     * @param compareFn Function used to determine the order of the elements. It is expected to return
-     * a negative value if the first argument is less than the second argument, zero if they're equal, and a positive
-     * value otherwise. If omitted, the elements are sorted in ascending, ASCII character order.
-     * ```ts
-     * const myNums = Uint8Array.from([11, 2, 22, 1]);
-     * myNums.toSorted((a, b) => a - b) // Uint8Array(4) [1, 2, 11, 22]
-     * ```
-     */
-    toSorted(compareFn?: (a: number, b: number) => number): Uint8Array;
-
-    /**
-     * Copies the array and inserts the given number at the provided index.
-     * @param index The index of the value to overwrite. If the index is
-     * negative, then it replaces from the end of the array.
-     * @param value The value to insert into the copied array.
-     * @returns A copy of the original array with the inserted value.
-     */
-    with(index: number, value: number): Uint8Array;
+    findLastIndex(predicate: (value: number, index: number, array: Uint8Array) => unknown, thisArg?: any): number;
 }
 
 interface Uint8ClampedArray {
@@ -301,22 +126,8 @@ interface Uint8ClampedArray {
      * @param thisArg If provided, it will be used as the this value for each invocation of
      * predicate. If it is not provided, undefined is used instead.
      */
-    findLast<S extends number>(
-        predicate: (
-            value: number,
-            index: number,
-            array: Uint8ClampedArray
-        ) => value is S,
-        thisArg?: any
-    ): S | undefined;
-    findLast(
-        predicate: (
-            value: number,
-            index: number,
-            array: Uint8ClampedArray
-        ) => unknown,
-        thisArg?: any
-    ): number | undefined;
+    findLast<S extends number>(predicate: (value: number, index: number, array: Uint8ClampedArray) => value is S, thisArg?: any): S | undefined;
+    findLast(predicate: (value: number, index: number, array: Uint8ClampedArray) => unknown, thisArg?: any): number | undefined;
 
     /**
      * Returns the index of the last element in the array where predicate is true, and -1
@@ -327,40 +138,7 @@ interface Uint8ClampedArray {
      * @param thisArg If provided, it will be used as the this value for each invocation of
      * predicate. If it is not provided, undefined is used instead.
      */
-    findLastIndex(
-        predicate: (
-            value: number,
-            index: number,
-            array: Uint8ClampedArray
-        ) => unknown,
-        thisArg?: any
-    ): number;
-
-    /**
-     * Copies the array and returns the copy with the elements in reverse order.
-     */
-    toReversed(): Uint8ClampedArray;
-
-    /**
-     * Copies and sorts the array.
-     * @param compareFn Function used to determine the order of the elements. It is expected to return
-     * a negative value if the first argument is less than the second argument, zero if they're equal, and a positive
-     * value otherwise. If omitted, the elements are sorted in ascending, ASCII character order.
-     * ```ts
-     * const myNums = Uint8ClampedArray.from([11, 2, 22, 1]);
-     * myNums.toSorted((a, b) => a - b) // Uint8ClampedArray(4) [1, 2, 11, 22]
-     * ```
-     */
-    toSorted(compareFn?: (a: number, b: number) => number): Uint8ClampedArray;
-
-    /**
-     * Copies the array and inserts the given number at the provided index.
-     * @param index The index of the value to overwrite. If the index is
-     * negative, then it replaces from the end of the array.
-     * @param value The value to insert into the copied array.
-     * @returns A copy of the original array with the inserted value.
-     */
-    with(index: number, value: number): Uint8ClampedArray;
+    findLastIndex(predicate: (value: number, index: number, array: Uint8ClampedArray) => unknown, thisArg?: any): number;
 }
 
 interface Int16Array {
@@ -373,18 +151,8 @@ interface Int16Array {
      * @param thisArg If provided, it will be used as the this value for each invocation of
      * predicate. If it is not provided, undefined is used instead.
      */
-    findLast<S extends number>(
-        predicate: (
-            value: number,
-            index: number,
-            array: Int16Array
-        ) => value is S,
-        thisArg?: any
-    ): S | undefined;
-    findLast(
-        predicate: (value: number, index: number, array: Int16Array) => unknown,
-        thisArg?: any
-    ): number | undefined;
+    findLast<S extends number>(predicate: (value: number, index: number, array: Int16Array) => value is S, thisArg?: any): S | undefined;
+    findLast(predicate: (value: number, index: number, array: Int16Array) => unknown, thisArg?: any): number | undefined;
 
     /**
      * Returns the index of the last element in the array where predicate is true, and -1
@@ -395,36 +163,7 @@ interface Int16Array {
      * @param thisArg If provided, it will be used as the this value for each invocation of
      * predicate. If it is not provided, undefined is used instead.
      */
-    findLastIndex(
-        predicate: (value: number, index: number, array: Int16Array) => unknown,
-        thisArg?: any
-    ): number;
-
-    /**
-     * Copies the array and returns the copy with the elements in reverse order.
-     */
-    toReversed(): Int16Array;
-
-    /**
-     * Copies and sorts the array.
-     * @param compareFn Function used to determine the order of the elements. It is expected to return
-     * a negative value if the first argument is less than the second argument, zero if they're equal, and a positive
-     * value otherwise. If omitted, the elements are sorted in ascending, ASCII character order.
-     * ```ts
-     * const myNums = Int16Array.from([11, 2, -22, 1]);
-     * myNums.toSorted((a, b) => a - b) // Int16Array(4) [-22, 1, 2, 11]
-     * ```
-     */
-    toSorted(compareFn?: (a: number, b: number) => number): Int16Array;
-
-    /**
-     * Copies the array and inserts the given number at the provided index.
-     * @param index The index of the value to overwrite. If the index is
-     * negative, then it replaces from the end of the array.
-     * @param value The value to insert into the copied array.
-     * @returns A copy of the original array with the inserted value.
-     */
-    with(index: number, value: number): Int16Array;
+    findLastIndex(predicate: (value: number, index: number, array: Int16Array) => unknown, thisArg?: any): number;
 }
 
 interface Uint16Array {
@@ -437,22 +176,8 @@ interface Uint16Array {
      * @param thisArg If provided, it will be used as the this value for each invocation of
      * predicate. If it is not provided, undefined is used instead.
      */
-    findLast<S extends number>(
-        predicate: (
-            value: number,
-            index: number,
-            array: Uint16Array
-        ) => value is S,
-        thisArg?: any
-    ): S | undefined;
-    findLast(
-        predicate: (
-            value: number,
-            index: number,
-            array: Uint16Array
-        ) => unknown,
-        thisArg?: any
-    ): number | undefined;
+    findLast<S extends number>(predicate: (value: number, index: number, array: Uint16Array) => value is S, thisArg?: any): S | undefined;
+    findLast(predicate: (value: number, index: number, array: Uint16Array) => unknown, thisArg?: any): number | undefined;
 
     /**
      * Returns the index of the last element in the array where predicate is true, and -1
@@ -463,40 +188,7 @@ interface Uint16Array {
      * @param thisArg If provided, it will be used as the this value for each invocation of
      * predicate. If it is not provided, undefined is used instead.
      */
-    findLastIndex(
-        predicate: (
-            value: number,
-            index: number,
-            array: Uint16Array
-        ) => unknown,
-        thisArg?: any
-    ): number;
-
-    /**
-     * Copies the array and returns the copy with the elements in reverse order.
-     */
-    toReversed(): Uint16Array;
-
-    /**
-     * Copies and sorts the array.
-     * @param compareFn Function used to determine the order of the elements. It is expected to return
-     * a negative value if the first argument is less than the second argument, zero if they're equal, and a positive
-     * value otherwise. If omitted, the elements are sorted in ascending, ASCII character order.
-     * ```ts
-     * const myNums = Uint16Array.from([11, 2, 22, 1]);
-     * myNums.toSorted((a, b) => a - b) // Uint16Array(4) [1, 2, 11, 22]
-     * ```
-     */
-    toSorted(compareFn?: (a: number, b: number) => number): Uint16Array;
-
-    /**
-     * Copies the array and inserts the given number at the provided index.
-     * @param index The index of the value to overwrite. If the index is
-     * negative, then it replaces from the end of the array.
-     * @param value The value to insert into the copied array.
-     * @returns A copy of the original array with the inserted value.
-     */
-    with(index: number, value: number): Uint16Array;
+    findLastIndex(predicate: (value: number, index: number, array: Uint16Array) => unknown, thisArg?: any): number;
 }
 
 interface Int32Array {
@@ -509,18 +201,8 @@ interface Int32Array {
      * @param thisArg If provided, it will be used as the this value for each invocation of
      * predicate. If it is not provided, undefined is used instead.
      */
-    findLast<S extends number>(
-        predicate: (
-            value: number,
-            index: number,
-            array: Int32Array
-        ) => value is S,
-        thisArg?: any
-    ): S | undefined;
-    findLast(
-        predicate: (value: number, index: number, array: Int32Array) => unknown,
-        thisArg?: any
-    ): number | undefined;
+    findLast<S extends number>(predicate: (value: number, index: number, array: Int32Array) => value is S, thisArg?: any): S | undefined;
+    findLast(predicate: (value: number, index: number, array: Int32Array) => unknown, thisArg?: any): number | undefined;
 
     /**
      * Returns the index of the last element in the array where predicate is true, and -1
@@ -531,36 +213,7 @@ interface Int32Array {
      * @param thisArg If provided, it will be used as the this value for each invocation of
      * predicate. If it is not provided, undefined is used instead.
      */
-    findLastIndex(
-        predicate: (value: number, index: number, array: Int32Array) => unknown,
-        thisArg?: any
-    ): number;
-
-    /**
-     * Copies the array and returns the copy with the elements in reverse order.
-     */
-    toReversed(): Int32Array;
-
-    /**
-     * Copies and sorts the array.
-     * @param compareFn Function used to determine the order of the elements. It is expected to return
-     * a negative value if the first argument is less than the second argument, zero if they're equal, and a positive
-     * value otherwise. If omitted, the elements are sorted in ascending, ASCII character order.
-     * ```ts
-     * const myNums = Int32Array.from([11, 2, -22, 1]);
-     * myNums.toSorted((a, b) => a - b) // Int32Array(4) [-22, 1, 2, 11]
-     * ```
-     */
-    toSorted(compareFn?: (a: number, b: number) => number): Int32Array;
-
-    /**
-     * Copies the array and inserts the given number at the provided index.
-     * @param index The index of the value to overwrite. If the index is
-     * negative, then it replaces from the end of the array.
-     * @param value The value to insert into the copied array.
-     * @returns A copy of the original array with the inserted value.
-     */
-    with(index: number, value: number): Int32Array;
+    findLastIndex(predicate: (value: number, index: number, array: Int32Array) => unknown, thisArg?: any): number;
 }
 
 interface Uint32Array {
@@ -573,22 +226,8 @@ interface Uint32Array {
      * @param thisArg If provided, it will be used as the this value for each invocation of
      * predicate. If it is not provided, undefined is used instead.
      */
-    findLast<S extends number>(
-        predicate: (
-            value: number,
-            index: number,
-            array: Uint32Array
-        ) => value is S,
-        thisArg?: any
-    ): S | undefined;
-    findLast(
-        predicate: (
-            value: number,
-            index: number,
-            array: Uint32Array
-        ) => unknown,
-        thisArg?: any
-    ): number | undefined;
+    findLast<S extends number>(predicate: (value: number, index: number, array: Uint32Array) => value is S, thisArg?: any): S | undefined;
+    findLast(predicate: (value: number, index: number, array: Uint32Array) => unknown, thisArg?: any): number | undefined;
 
     /**
      * Returns the index of the last element in the array where predicate is true, and -1
@@ -599,40 +238,7 @@ interface Uint32Array {
      * @param thisArg If provided, it will be used as the this value for each invocation of
      * predicate. If it is not provided, undefined is used instead.
      */
-    findLastIndex(
-        predicate: (
-            value: number,
-            index: number,
-            array: Uint32Array
-        ) => unknown,
-        thisArg?: any
-    ): number;
-
-    /**
-     * Copies the array and returns the copy with the elements in reverse order.
-     */
-    toReversed(): Uint32Array;
-
-    /**
-     * Copies and sorts the array.
-     * @param compareFn Function used to determine the order of the elements. It is expected to return
-     * a negative value if the first argument is less than the second argument, zero if they're equal, and a positive
-     * value otherwise. If omitted, the elements are sorted in ascending, ASCII character order.
-     * ```ts
-     * const myNums = Uint32Array.from([11, 2, 22, 1]);
-     * myNums.toSorted((a, b) => a - b) // Uint32Array(4) [1, 2, 11, 22]
-     * ```
-     */
-    toSorted(compareFn?: (a: number, b: number) => number): Uint32Array;
-
-    /**
-     * Copies the array and inserts the given number at the provided index.
-     * @param index The index of the value to overwrite. If the index is
-     * negative, then it replaces from the end of the array.
-     * @param value The value to insert into the copied array.
-     * @returns A copy of the original array with the inserted value.
-     */
-    with(index: number, value: number): Uint32Array;
+    findLastIndex(predicate: (value: number, index: number, array: Uint32Array) => unknown, thisArg?: any): number;
 }
 
 interface Float32Array {
@@ -645,22 +251,8 @@ interface Float32Array {
      * @param thisArg If provided, it will be used as the this value for each invocation of
      * predicate. If it is not provided, undefined is used instead.
      */
-    findLast<S extends number>(
-        predicate: (
-            value: number,
-            index: number,
-            array: Float32Array
-        ) => value is S,
-        thisArg?: any
-    ): S | undefined;
-    findLast(
-        predicate: (
-            value: number,
-            index: number,
-            array: Float32Array
-        ) => unknown,
-        thisArg?: any
-    ): number | undefined;
+    findLast<S extends number>(predicate: (value: number, index: number, array: Float32Array) => value is S, thisArg?: any): S | undefined;
+    findLast(predicate: (value: number, index: number, array: Float32Array) => unknown, thisArg?: any): number | undefined;
 
     /**
      * Returns the index of the last element in the array where predicate is true, and -1
@@ -671,40 +263,7 @@ interface Float32Array {
      * @param thisArg If provided, it will be used as the this value for each invocation of
      * predicate. If it is not provided, undefined is used instead.
      */
-    findLastIndex(
-        predicate: (
-            value: number,
-            index: number,
-            array: Float32Array
-        ) => unknown,
-        thisArg?: any
-    ): number;
-
-    /**
-     * Copies the array and returns the copy with the elements in reverse order.
-     */
-    toReversed(): Float32Array;
-
-    /**
-     * Copies and sorts the array.
-     * @param compareFn Function used to determine the order of the elements. It is expected to return
-     * a negative value if the first argument is less than the second argument, zero if they're equal, and a positive
-     * value otherwise. If omitted, the elements are sorted in ascending, ASCII character order.
-     * ```ts
-     * const myNums = Float32Array.from([11.25, 2, -22.5, 1]);
-     * myNums.toSorted((a, b) => a - b) // Float32Array(4) [-22.5, 1, 2, 11.5]
-     * ```
-     */
-    toSorted(compareFn?: (a: number, b: number) => number): Float32Array;
-
-    /**
-     * Copies the array and inserts the given number at the provided index.
-     * @param index The index of the value to overwrite. If the index is
-     * negative, then it replaces from the end of the array.
-     * @param value The value to insert into the copied array.
-     * @returns A copy of the original array with the inserted value.
-     */
-    with(index: number, value: number): Float32Array;
+    findLastIndex(predicate: (value: number, index: number, array: Float32Array) => unknown, thisArg?: any): number;
 }
 
 interface Float64Array {
@@ -717,22 +276,8 @@ interface Float64Array {
      * @param thisArg If provided, it will be used as the this value for each invocation of
      * predicate. If it is not provided, undefined is used instead.
      */
-    findLast<S extends number>(
-        predicate: (
-            value: number,
-            index: number,
-            array: Float64Array
-        ) => value is S,
-        thisArg?: any
-    ): S | undefined;
-    findLast(
-        predicate: (
-            value: number,
-            index: number,
-            array: Float64Array
-        ) => unknown,
-        thisArg?: any
-    ): number | undefined;
+    findLast<S extends number>(predicate: (value: number, index: number, array: Float64Array) => value is S, thisArg?: any): S | undefined;
+    findLast(predicate: (value: number, index: number, array: Float64Array) => unknown, thisArg?: any): number | undefined;
 
     /**
      * Returns the index of the last element in the array where predicate is true, and -1
@@ -743,40 +288,7 @@ interface Float64Array {
      * @param thisArg If provided, it will be used as the this value for each invocation of
      * predicate. If it is not provided, undefined is used instead.
      */
-    findLastIndex(
-        predicate: (
-            value: number,
-            index: number,
-            array: Float64Array
-        ) => unknown,
-        thisArg?: any
-    ): number;
-
-    /**
-     * Copies the array and returns the copy with the elements in reverse order.
-     */
-    toReversed(): Float64Array;
-
-    /**
-     * Copies and sorts the array.
-     * @param compareFn Function used to determine the order of the elements. It is expected to return
-     * a negative value if the first argument is less than the second argument, zero if they're equal, and a positive
-     * value otherwise. If omitted, the elements are sorted in ascending, ASCII character order.
-     * ```ts
-     * const myNums = Float64Array.from([11.25, 2, -22.5, 1]);
-     * myNums.toSorted((a, b) => a - b) // Float64Array(4) [-22.5, 1, 2, 11.5]
-     * ```
-     */
-    toSorted(compareFn?: (a: number, b: number) => number): Float64Array;
-
-    /**
-     * Copies the array and inserts the given number at the provided index.
-     * @param index The index of the value to overwrite. If the index is
-     * negative, then it replaces from the end of the array.
-     * @param value The value to insert into the copied array.
-     * @returns A copy of the original array with the inserted value.
-     */
-    with(index: number, value: number): Float64Array;
+    findLastIndex(predicate: (value: number, index: number, array: Float64Array) => unknown, thisArg?: any): number;
 }
 
 interface BigInt64Array {
@@ -789,22 +301,8 @@ interface BigInt64Array {
      * @param thisArg If provided, it will be used as the this value for each invocation of
      * predicate. If it is not provided, undefined is used instead.
      */
-    findLast<S extends bigint>(
-        predicate: (
-            value: bigint,
-            index: number,
-            array: BigInt64Array
-        ) => value is S,
-        thisArg?: any
-    ): S | undefined;
-    findLast(
-        predicate: (
-            value: bigint,
-            index: number,
-            array: BigInt64Array
-        ) => unknown,
-        thisArg?: any
-    ): bigint | undefined;
+    findLast<S extends bigint>(predicate: (value: bigint, index: number, array: BigInt64Array) => value is S, thisArg?: any): S | undefined;
+    findLast(predicate: (value: bigint, index: number, array: BigInt64Array) => unknown, thisArg?: any): bigint | undefined;
 
     /**
      * Returns the index of the last element in the array where predicate is true, and -1
@@ -815,40 +313,7 @@ interface BigInt64Array {
      * @param thisArg If provided, it will be used as the this value for each invocation of
      * predicate. If it is not provided, undefined is used instead.
      */
-    findLastIndex(
-        predicate: (
-            value: bigint,
-            index: number,
-            array: BigInt64Array
-        ) => unknown,
-        thisArg?: any
-    ): number;
-
-    /**
-     * Copies the array and returns the copy with the elements in reverse order.
-     */
-    toReversed(): BigInt64Array;
-
-    /**
-     * Copies and sorts the array.
-     * @param compareFn Function used to determine the order of the elements. It is expected to return
-     * a negative value if the first argument is less than the second argument, zero if they're equal, and a positive
-     * value otherwise. If omitted, the elements are sorted in ascending, ASCII character order.
-     * ```ts
-     * const myNums = BigInt64Array.from([11n, 2n, -22n, 1n]);
-     * myNums.toSorted((a, b) => Number(a - b)) // BigInt64Array(4) [-22n, 1n, 2n, 11n]
-     * ```
-     */
-    toSorted(compareFn?: (a: bigint, b: bigint) => number): BigInt64Array;
-
-    /**
-     * Copies the array and inserts the given bigint at the provided index.
-     * @param index The index of the value to overwrite. If the index is
-     * negative, then it replaces from the end of the array.
-     * @param value The value to insert into the copied array.
-     * @returns A copy of the original array with the inserted value.
-     */
-    with(index: number, value: bigint): BigInt64Array;
+    findLastIndex(predicate: (value: bigint, index: number, array: BigInt64Array) => unknown, thisArg?: any): number;
 }
 
 interface BigUint64Array {
@@ -861,22 +326,8 @@ interface BigUint64Array {
      * @param thisArg If provided, it will be used as the this value for each invocation of
      * predicate. If it is not provided, undefined is used instead.
      */
-    findLast<S extends bigint>(
-        predicate: (
-            value: bigint,
-            index: number,
-            array: BigUint64Array
-        ) => value is S,
-        thisArg?: any
-    ): S | undefined;
-    findLast(
-        predicate: (
-            value: bigint,
-            index: number,
-            array: BigUint64Array
-        ) => unknown,
-        thisArg?: any
-    ): bigint | undefined;
+    findLast<S extends bigint>(predicate: (value: bigint, index: number, array: BigUint64Array) => value is S, thisArg?: any): S | undefined;
+    findLast(predicate: (value: bigint, index: number, array: BigUint64Array) => unknown, thisArg?: any): bigint | undefined;
 
     /**
      * Returns the index of the last element in the array where predicate is true, and -1
@@ -887,38 +338,5 @@ interface BigUint64Array {
      * @param thisArg If provided, it will be used as the this value for each invocation of
      * predicate. If it is not provided, undefined is used instead.
      */
-    findLastIndex(
-        predicate: (
-            value: bigint,
-            index: number,
-            array: BigUint64Array
-        ) => unknown,
-        thisArg?: any
-    ): number;
-
-    /**
-     * Copies the array and returns the copy with the elements in reverse order.
-     */
-    toReversed(): BigUint64Array;
-
-    /**
-     * Copies and sorts the array.
-     * @param compareFn Function used to determine the order of the elements. It is expected to return
-     * a negative value if the first argument is less than the second argument, zero if they're equal, and a positive
-     * value otherwise. If omitted, the elements are sorted in ascending, ASCII character order.
-     * ```ts
-     * const myNums = BigUint64Array.from([11n, 2n, 22n, 1n]);
-     * myNums.toSorted((a, b) => Number(a - b)) // BigUint64Array(4) [1n, 2n, 11n, 22n]
-     * ```
-     */
-    toSorted(compareFn?: (a: bigint, b: bigint) => number): BigUint64Array;
-
-    /**
-     * Copies the array and inserts the given bigint at the provided index.
-     * @param index The index of the value to overwrite. If the index is
-     * negative, then it replaces from the end of the array.
-     * @param value The value to insert into the copied array.
-     * @returns A copy of the original array with the inserted value.
-     */
-    with(index: number, value: bigint): BigUint64Array;
+    findLastIndex(predicate: (value: bigint, index: number, array: BigUint64Array) => unknown, thisArg?: any): number;
 }