UNPKG

remeda

Version:

A utility library for JavaScript and Typescript.

39 lines (37 loc) 1.44 kB
import { IterableContainer } from "./IterableContainer-BuT0t52g.js"; import { ReorderedArray } from "./ReorderedArray-uOh6sA9Q.js"; //#region src/sort.d.ts /** * Sorts an array. The comparator function should accept two values at a time * and return a negative number if the first value is smaller, a positive number * if it's larger, and zero if they are equal. Sorting is based on a native * `sort` function. * * @param items - The array to sort. * @param cmp - The comparator function. * @signature * R.sort(items, cmp) * @example * R.sort([4, 2, 7, 5], (a, b) => a - b); // => [2, 4, 5, 7] * @dataFirst * @category Array */ declare function sort<T extends IterableContainer>(items: T, cmp: (a: T[number], b: T[number]) => number): ReorderedArray<T>; /** * Sorts an array. The comparator function should accept two values at a time * and return a negative number if the first value is smaller, a positive number * if it's larger, and zero if they are equal. Sorting is based on a native * `sort` function. * * @param cmp - The comparator function. * @signature * R.sort(cmp)(items) * @example * R.pipe([4, 2, 7, 5], R.sort((a, b) => a - b)) // => [2, 4, 5, 7] * @dataLast * @category Array */ declare function sort<T extends IterableContainer>(cmp: (a: T[number], b: T[number]) => number): (items: T) => ReorderedArray<T>; //#endregion export { sort }; //# sourceMappingURL=sort-Cbre1OWJ.d.ts.map