@@ -194,7 +194,7 @@ interface Int8Array<TArrayBuffer extends ArrayBufferLike> {
194194 * value otherwise. If omitted, the elements are sorted in ascending order.
195195 * ```ts
196196 * const myNums = Int8Array.from([11, 2, 22, 1]);
197- * myNums.toSorted((a, b) => a - b) // Int8Array<Buffer> (4) [1, 2, 11, 22]
197+ * myNums.toSorted((a, b) => a - b) // Int8Array(4) [1, 2, 11, 22]
198198 * ```
199199 */
200200 toSorted ( compareFn ?: ( a : number , b : number ) => number ) : Int8Array < ArrayBuffer > ;
@@ -258,7 +258,7 @@ interface Uint8Array<TArrayBuffer extends ArrayBufferLike> {
258258 * value otherwise. If omitted, the elements are sorted in ascending order.
259259 * ```ts
260260 * const myNums = Uint8Array.from([11, 2, 22, 1]);
261- * myNums.toSorted((a, b) => a - b) // Uint8Array<Buffer> (4) [1, 2, 11, 22]
261+ * myNums.toSorted((a, b) => a - b) // Uint8Array(4) [1, 2, 11, 22]
262262 * ```
263263 */
264264 toSorted ( compareFn ?: ( a : number , b : number ) => number ) : Uint8Array < ArrayBuffer > ;
@@ -330,7 +330,7 @@ interface Uint8ClampedArray<TArrayBuffer extends ArrayBufferLike> {
330330 * value otherwise. If omitted, the elements are sorted in ascending order.
331331 * ```ts
332332 * const myNums = Uint8ClampedArray.from([11, 2, 22, 1]);
333- * myNums.toSorted((a, b) => a - b) // Uint8ClampedArray<Buffer> (4) [1, 2, 11, 22]
333+ * myNums.toSorted((a, b) => a - b) // Uint8ClampedArray(4) [1, 2, 11, 22]
334334 * ```
335335 */
336336 toSorted ( compareFn ?: ( a : number , b : number ) => number ) : Uint8ClampedArray < ArrayBuffer > ;
@@ -394,7 +394,7 @@ interface Int16Array<TArrayBuffer extends ArrayBufferLike> {
394394 * value otherwise. If omitted, the elements are sorted in ascending order.
395395 * ```ts
396396 * const myNums = Int16Array.from([11, 2, -22, 1]);
397- * myNums.toSorted((a, b) => a - b) // Int16Array<Buffer> (4) [-22, 1, 2, 11]
397+ * myNums.toSorted((a, b) => a - b) // Int16Array(4) [-22, 1, 2, 11]
398398 * ```
399399 */
400400 toSorted ( compareFn ?: ( a : number , b : number ) => number ) : Int16Array < ArrayBuffer > ;
@@ -466,7 +466,7 @@ interface Uint16Array<TArrayBuffer extends ArrayBufferLike> {
466466 * value otherwise. If omitted, the elements are sorted in ascending order.
467467 * ```ts
468468 * const myNums = Uint16Array.from([11, 2, 22, 1]);
469- * myNums.toSorted((a, b) => a - b) // Uint16Array<Buffer> (4) [1, 2, 11, 22]
469+ * myNums.toSorted((a, b) => a - b) // Uint16Array(4) [1, 2, 11, 22]
470470 * ```
471471 */
472472 toSorted ( compareFn ?: ( a : number , b : number ) => number ) : Uint16Array < ArrayBuffer > ;
@@ -530,7 +530,7 @@ interface Int32Array<TArrayBuffer extends ArrayBufferLike> {
530530 * value otherwise. If omitted, the elements are sorted in ascending order.
531531 * ```ts
532532 * const myNums = Int32Array.from([11, 2, -22, 1]);
533- * myNums.toSorted((a, b) => a - b) // Int32Array<Buffer> (4) [-22, 1, 2, 11]
533+ * myNums.toSorted((a, b) => a - b) // Int32Array(4) [-22, 1, 2, 11]
534534 * ```
535535 */
536536 toSorted ( compareFn ?: ( a : number , b : number ) => number ) : Int32Array < ArrayBuffer > ;
@@ -602,7 +602,7 @@ interface Uint32Array<TArrayBuffer extends ArrayBufferLike> {
602602 * value otherwise. If omitted, the elements are sorted in ascending order.
603603 * ```ts
604604 * const myNums = Uint32Array.from([11, 2, 22, 1]);
605- * myNums.toSorted((a, b) => a - b) // Uint32Array<Buffer> (4) [1, 2, 11, 22]
605+ * myNums.toSorted((a, b) => a - b) // Uint32Array(4) [1, 2, 11, 22]
606606 * ```
607607 */
608608 toSorted ( compareFn ?: ( a : number , b : number ) => number ) : Uint32Array < ArrayBuffer > ;
@@ -674,7 +674,7 @@ interface Float32Array<TArrayBuffer extends ArrayBufferLike> {
674674 * value otherwise. If omitted, the elements are sorted in ascending order.
675675 * ```ts
676676 * const myNums = Float32Array.from([11.25, 2, -22.5, 1]);
677- * myNums.toSorted((a, b) => a - b) // Float32Array<Buffer> (4) [-22.5, 1, 2, 11.5]
677+ * myNums.toSorted((a, b) => a - b) // Float32Array(4) [-22.5, 1, 2, 11.5]
678678 * ```
679679 */
680680 toSorted ( compareFn ?: ( a : number , b : number ) => number ) : Float32Array < ArrayBuffer > ;
@@ -746,7 +746,7 @@ interface Float64Array<TArrayBuffer extends ArrayBufferLike> {
746746 * value otherwise. If omitted, the elements are sorted in ascending order.
747747 * ```ts
748748 * const myNums = Float64Array.from([11.25, 2, -22.5, 1]);
749- * myNums.toSorted((a, b) => a - b) // Float64Array<Buffer> (4) [-22.5, 1, 2, 11.5]
749+ * myNums.toSorted((a, b) => a - b) // Float64Array(4) [-22.5, 1, 2, 11.5]
750750 * ```
751751 */
752752 toSorted ( compareFn ?: ( a : number , b : number ) => number ) : Float64Array < ArrayBuffer > ;
@@ -818,7 +818,7 @@ interface BigInt64Array<TArrayBuffer extends ArrayBufferLike> {
818818 * value otherwise. If omitted, the elements are sorted in ascending order.
819819 * ```ts
820820 * const myNums = BigInt64Array.from([11n, 2n, -22n, 1n]);
821- * myNums.toSorted((a, b) => Number(a - b)) // BigInt64Array<Buffer> (4) [-22n, 1n, 2n, 11n]
821+ * myNums.toSorted((a, b) => Number(a - b)) // BigInt64Array(4) [-22n, 1n, 2n, 11n]
822822 * ```
823823 */
824824 toSorted ( compareFn ?: ( a : bigint , b : bigint ) => number ) : BigInt64Array < ArrayBuffer > ;
@@ -890,7 +890,7 @@ interface BigUint64Array<TArrayBuffer extends ArrayBufferLike> {
890890 * value otherwise. If omitted, the elements are sorted in ascending order.
891891 * ```ts
892892 * const myNums = BigUint64Array.from([11n, 2n, 22n, 1n]);
893- * myNums.toSorted((a, b) => Number(a - b)) // BigUint64Array<Buffer> (4) [1n, 2n, 11n, 22n]
893+ * myNums.toSorted((a, b) => Number(a - b)) // BigUint64Array(4) [1n, 2n, 11n, 22n]
894894 * ```
895895 */
896896 toSorted ( compareFn ?: ( a : bigint , b : bigint ) => number ) : BigUint64Array < ArrayBuffer > ;
0 commit comments