@thi.ng/transducers/partition-sort.d.ts

Collection of ~170 lightweight, composable transducers, reducers, generators, iterators for functional data transformations

import type { SortOpts, Transducer } from "./api.js";
/**
 * Transducer. Composition of {@link partition} and
 * {@link mapcat} which yields a **partially** sorted sequence of
 * input values. Sorting is performed on sliding / non-overlapping
 * chunks of `n` inputs.
 *
 * @remarks
 * The optional `key` and `cmp` function args can be used to select /
 * compute a sortable value and change sorting behavior.
 *
 * @example
 * ```ts tangle:../export/partition-sort.ts
 * import { partitionSort } from "@thi.ng/transducers";
 *
 * console.log(
 *   [...partitionSort(4, [5, 9, 2, 6, 4, 1, 3, 8, 7, 0])]
 * );
 * // [ 2, 5, 6, 9, 1, 3, 4, 8, 0, 7 ]
 *
 * // with key fn and custom comparator
 * const res = [...partitionSort(
 *   3,
 *   { key: (x) => x.val, compare: (a, b) => b - a },
 *   [
 *     { id: "a", val: 5 },
 *     { id: "b", val: 7 },
 *     { id: "c", val: 8 }
 *   ]
 * )];
 *
 * console.log(res);
 * // [ { id: 'c', val: 8 }, { id: 'b', val: 7 }, { id: 'a', val: 5 } ]
 * ```
 *
 * @param n - window size
 * @param opts -
 */
export declare function partitionSort<A, B>(n: number, opts?: Partial<SortOpts<A, B>>): Transducer<A, A>;
export declare function partitionSort<A, B>(n: number, src: Iterable<A>): IterableIterator<A>;
export declare function partitionSort<A, B>(n: number, opts: Partial<SortOpts<A, B>>, src: Iterable<A>): IterableIterator<A>;
//# sourceMappingURL=partition-sort.d.ts.map