@johnhenry/iteration 0.0.0

package/dist/concurrency.js

@@ -0,0 +1,145 @@
+/**
+ * Bounded-concurrency helpers: mapConcurrentAsync (parallel map over an
+ * (a)sync iterable with a concurrency limit) and prefetchAsync (eager
+ * read-ahead into a bounded buffer). Both propagate cancellation/early
+ * consumer exit upstream via iterator.return().
+ */
+import { throwIfAborted } from "./abort.js";
+const abortErrorOf = (signal) => signal.reason ?? new DOMException("This operation was aborted", "AbortError");
+const getIterator = (iterable) => Symbol.asyncIterator in Object(iterable)
+    ? iterable[Symbol.asyncIterator]()
+    : iterable[Symbol.iterator]();
+/**
+ * Map `fn` over `iterable` with up to `concurrency` invocations in flight
+ * at once. With `ordered: true` (the default) results are yielded in input
+ * order; with `ordered: false` they are yielded in completion order.
+ *
+ * - Backpressure: at most `concurrency` results are held; the source is
+ *   only pulled while there is spare in-flight capacity.
+ * - Cancellation: an optional `signal` aborts promptly (rejecting with the
+ *   signal's reason, an "AbortError" DOMException by default) even while
+ *   awaiting a slow `fn` or source; the source iterator is closed via
+ *   `return()`.
+ * - Early exit / error: breaking out of the loop, or an `fn` rejection,
+ *   also closes the source via `return()`.
+ * @kind function
+ * @name mapConcurrentAsync
+ */
+export const mapConcurrentAsync = async function* (fn, iterable, { concurrency, ordered = true, signal }) {
+    if (!(typeof concurrency === "number" && concurrency >= 1)) {
+        throw new RangeError("mapConcurrentAsync: concurrency must be >= 1");
+    }
+    throwIfAborted(signal);
+    const it = getIterator(iterable);
+    let onAbort;
+    const aborted = signal
+        ? new Promise((_, reject) => {
+            onAbort = () => reject(abortErrorOf(signal));
+            signal.addEventListener("abort", onAbort, { once: true });
+        })
+        : undefined;
+    aborted?.catch(() => { });
+    const race = (promise) => (aborted ? Promise.race([promise, aborted]) : promise);
+    let sourceDone = false;
+    try {
+        if (ordered) {
+            const queue = [];
+            while (true) {
+                while (!sourceDone && queue.length < concurrency) {
+                    const r = await race(Promise.resolve(it.next()));
+                    if (r.done) {
+                        sourceDone = true;
+                        break;
+                    }
+                    const task = (async () => fn(r.value))();
+                    task.catch(() => { }); // handled when shifted; avoid unhandledRejection
+                    queue.push(task);
+                }
+                if (queue.length === 0) {
+                    return;
+                }
+                yield await race(queue.shift());
+            }
+        }
+        else {
+            const pending = new Set();
+            const add = (value) => {
+                let self;
+                self = (async () => {
+                    const out = await fn(value);
+                    return [self, out];
+                })();
+                self.catch(() => { }); // handled via the race below
+                pending.add(self);
+            };
+            while (true) {
+                while (!sourceDone && pending.size < concurrency) {
+                    const r = await race(Promise.resolve(it.next()));
+                    if (r.done) {
+                        sourceDone = true;
+                        break;
+                    }
+                    add(r.value);
+                }
+                if (pending.size === 0) {
+                    return;
+                }
+                const [task, out] = await race(Promise.race(pending));
+                pending.delete(task);
+                yield out;
+            }
+        }
+    }
+    finally {
+        if (signal && onAbort) {
+            signal.removeEventListener("abort", onAbort);
+        }
+        if (!sourceDone && it.return) {
+            // Close the source on abort, error, or early consumer exit --
+            // fire-and-forget so a hung source can't block the rejection.
+            Promise.resolve(it.return()).catch(() => { });
+        }
+    }
+};
+/**
+ * Eagerly pull up to `n` items ahead of the consumer into a bounded
+ * buffer, so a slow consumer overlaps with a slow producer. `n <= 0`
+ * degenerates to plain iteration. Early consumer exit (or an error)
+ * closes the source via `return()`.
+ * @kind function
+ * @name prefetchAsync
+ */
+export const prefetchAsync = async function* (n, iterable) {
+    if (n <= 0) {
+        yield* iterable;
+        return;
+    }
+    const it = getIterator(iterable);
+    const buffer = [];
+    let done = false;
+    const pull = () => {
+        const p = Promise.resolve(it.next());
+        p.catch(() => { }); // handled when shifted
+        buffer.push(p);
+    };
+    try {
+        for (let i = 0; i < n; i++) {
+            pull();
+        }
+        while (true) {
+            const r = await buffer.shift();
+            if (r.done) {
+                done = true;
+                return;
+            }
+            pull(); // keep n reads in flight while the consumer works
+            yield r.value;
+        }
+    }
+    finally {
+        if (!done && it.return) {
+            Promise.resolve(it.return()).catch(() => { });
+        }
+    }
+};
+//# sourceMappingURL=concurrency.js.map

package/dist/concurrency.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"concurrency.js","sourceRoot":"","sources":["../src/concurrency.ts"],"names":[],"mappings":"AAAA;;;;;GAKG;AAEH,OAAO,EAAsB,cAAc,EAAE,MAAM,YAAY,CAAC;AAYhE,MAAM,YAAY,GAAG,CAAC,MAAmB,EAAW,EAAE,CACpD,MAAM,CAAC,MAAM,IAAI,IAAI,YAAY,CAAC,4BAA4B,EAAE,YAAY,CAAC,CAAC;AAEhF,MAAM,WAAW,GAAG,CAAI,QAAwC,EAAkC,EAAE,CAClG,MAAM,CAAC,aAAa,IAAI,MAAM,CAAC,QAAQ,CAAC;IACtC,CAAC,CAAE,QAA6B,CAAC,MAAM,CAAC,aAAa,CAAC,EAAE;IACxD,CAAC,CAAE,QAAwB,CAAC,MAAM,CAAC,QAAQ,CAAC,EAAE,CAAC;AAEnD;;;;;;;;;;;;;;;GAeG;AACH,MAAM,CAAC,MAAM,kBAAkB,GAAG,KAAK,SAAS,CAAC,EAC/C,EAAoC,EACpC,QAA0C,EAC1C,EAAE,WAAW,EAAE,OAAO,GAAG,IAAI,EAAE,MAAM,EAAwB;IAE7D,IAAI,CAAC,CAAC,OAAO,WAAW,KAAK,QAAQ,IAAI,WAAW,IAAI,CAAC,CAAC,EAAE,CAAC;QAC3D,MAAM,IAAI,UAAU,CAAC,8CAA8C,CAAC,CAAC;IACvE,CAAC;IACD,cAAc,CAAC,MAAM,CAAC,CAAC;IACvB,MAAM,EAAE,GAAG,WAAW,CAAC,QAAQ,CAAC,CAAC;IAEjC,IAAI,OAAiC,CAAC;IACtC,MAAM,OAAO,GAAG,MAAM;QACpB,CAAC,CAAC,IAAI,OAAO,CAAQ,CAAC,CAAC,EAAE,MAAM,EAAE,EAAE;YAC/B,OAAO,GAAG,GAAG,EAAE,CAAC,MAAM,CAAC,YAAY,CAAC,MAAM,CAAC,CAAC,CAAC;YAC7C,MAAM,CAAC,gBAAgB,CAAC,OAAO,EAAE,OAAO,EAAE,EAAE,IAAI,EAAE,IAAI,EAAE,CAAC,CAAC;QAC5D,CAAC,CAAC;QACJ,CAAC,CAAC,SAAS,CAAC;IACd,OAAO,EAAE,KAAK,CAAC,GAAG,EAAE,GAAE,CAAC,CAAC,CAAC;IACzB,MAAM,IAAI,GAAG,CAAI,OAAmB,EAAc,EAAE,CAAC,CAAC,OAAO,CAAC,CAAC,CAAC,OAAO,CAAC,IAAI,CAAC,CAAC,OAAO,EAAE,OAAO,CAAC,CAAC,CAAC,CAAC,CAAC,OAAO,CAAC,CAAC;IAE5G,IAAI,UAAU,GAAG,KAAK,CAAC;IACvB,IAAI,CAAC;QACH,IAAI,OAAO,EAAE,CAAC;YACZ,MAAM,KAAK,GAAwB,EAAE,CAAC;YACtC,OAAO,IAAI,EAAE,CAAC;gBACZ,OAAO,CAAC,UAAU,IAAI,KAAK,CAAC,MAAM,GAAG,WAAW,EAAE,CAAC;oBACjD,MAAM,CAAC,GAAG,MAAM,IAAI,CAAC,OAAO,CAAC,OAAO,CAAC,EAAE,CAAC,IAAI,EAAE,CAAC,CAAC,CAAC;oBACjD,IAAI,CAAC,CAAC,IAAI,EAAE,CAAC;wBACX,UAAU,GAAG,IAAI,CAAC;wBAClB,MAAM;oBACR,CAAC;oBACD,MAAM,IAAI,GAAG,CAAC,KAAK,IAAI,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC,EAAE,CAAC;oBACzC,IAAI,CAAC,KAAK,CAAC,GAAG,EAAE,GAAE,CAAC,CAAC,CAAC,CAAC,iDAAiD;oBACvE,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;gBACnB,CAAC;gBACD,IAAI,KAAK,CAAC,MAAM,KAAK,CAAC,EAAE,CAAC;oBACvB,OAAO;gBACT,CAAC;gBACD,MAAM,MAAM,IAAI,CAAC,KAAK,CAAC,KAAK,EAAkB,CAAC,CAAC;YAClD,CAAC;QACH,CAAC;aAAM,CAAC;YAEN,MAAM,OAAO,GAAG,IAAI,GAAG,EAAmB,CAAC;YAC3C,MAAM,GAAG,GAAG,CAAC,KAAS,EAAE,EAAE;gBACxB,IAAI,IAAsB,CAAC;gBAC3B,IAAI,GAAG,CAAC,KAAK,IAAI,EAAE;oBACjB,MAAM,GAAG,GAAG,MAAM,EAAE,CAAC,KAAK,CAAC,CAAC;oBAC5B,OAAO,CAAC,IAAI,EAAE,GAAG,CAAW,CAAC;gBAC/B,CAAC,CAAC,EAAE,CAAC;gBACL,IAAI,CAAC,KAAK,CAAC,GAAG,EAAE,GAAE,CAAC,CAAC,CAAC,CAAC,6BAA6B;gBACnD,OAAO,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC;YACpB,CAAC,CAAC;YACF,OAAO,IAAI,EAAE,CAAC;gBACZ,OAAO,CAAC,UAAU,IAAI,OAAO,CAAC,IAAI,GAAG,WAAW,EAAE,CAAC;oBACjD,MAAM,CAAC,GAAG,MAAM,IAAI,CAAC,OAAO,CAAC,OAAO,CAAC,EAAE,CAAC,IAAI,EAAE,CAAC,CAAC,CAAC;oBACjD,IAAI,CAAC,CAAC,IAAI,EAAE,CAAC;wBACX,UAAU,GAAG,IAAI,CAAC;wBAClB,MAAM;oBACR,CAAC;oBACD,GAAG,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC;gBACf,CAAC;gBACD,IAAI,OAAO,CAAC,IAAI,KAAK,CAAC,EAAE,CAAC;oBACvB,OAAO;gBACT,CAAC;gBACD,MAAM,CAAC,IAAI,EAAE,GAAG,CAAC,GAAG,MAAM,IAAI,CAAC,OAAO,CAAC,IAAI,CAAC,OAAO,CAAC,CAAC,CAAC;gBACtD,OAAO,CAAC,MAAM,CAAC,IAAuB,CAAC,CAAC;gBACxC,MAAM,GAAG,CAAC;YACZ,CAAC;QACH,CAAC;IACH,CAAC;YAAS,CAAC;QACT,IAAI,MAAM,IAAI,OAAO,EAAE,CAAC;YACtB,MAAM,CAAC,mBAAmB,CAAC,OAAO,EAAE,OAAO,CAAC,CAAC;QAC/C,CAAC;QACD,IAAI,CAAC,UAAU,IAAI,EAAE,CAAC,MAAM,EAAE,CAAC;YAC7B,8DAA8D;YAC9D,8DAA8D;YAC9D,OAAO,CAAC,OAAO,CAAC,EAAE,CAAC,MAAM,EAAE,CAAC,CAAC,KAAK,CAAC,GAAG,EAAE,GAAE,CAAC,CAAC,CAAC;QAC/C,CAAC;IACH,CAAC;AACH,CAAC,CAAC;AAEF;;;;;;;GAOG;AACH,MAAM,CAAC,MAAM,aAAa,GAAG,KAAK,SAAS,CAAC,EAC1C,CAAS,EACT,QAAwC;IAExC,IAAI,CAAC,IAAI,CAAC,EAAE,CAAC;QACX,KAAK,CAAC,CAAC,QAAQ,CAAC;QAChB,OAAO;IACT,CAAC;IACD,MAAM,EAAE,GAAG,WAAW,CAAC,QAAQ,CAAC,CAAC;IACjC,MAAM,MAAM,GAA0D,EAAE,CAAC;IACzE,IAAI,IAAI,GAAG,KAAK,CAAC;IACjB,MAAM,IAAI,GAAG,GAAG,EAAE;QAChB,MAAM,CAAC,GAAG,OAAO,CAAC,OAAO,CAAC,EAAE,CAAC,IAAI,EAAE,CAAC,CAAC;QACrC,CAAC,CAAC,KAAK,CAAC,GAAG,EAAE,GAAE,CAAC,CAAC,CAAC,CAAC,uBAAuB;QAC1C,MAAM,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;IACjB,CAAC,CAAC;IACF,IAAI,CAAC;QACH,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC;YAC3B,IAAI,EAAE,CAAC;QACT,CAAC;QACD,OAAO,IAAI,EAAE,CAAC;YACZ,MAAM,CAAC,GAAG,MAAO,MAAM,CAAC,KAAK,EAAiC,CAAC;YAC/D,IAAI,CAAC,CAAC,IAAI,EAAE,CAAC;gBACX,IAAI,GAAG,IAAI,CAAC;gBACZ,OAAO;YACT,CAAC;YACD,IAAI,EAAE,CAAC,CAAC,kDAAkD;YAC1D,MAAM,CAAC,CAAC,KAAK,CAAC;QAChB,CAAC;IACH,CAAC;YAAS,CAAC;QACT,IAAI,CAAC,IAAI,IAAI,EAAE,CAAC,MAAM,EAAE,CAAC;YACvB,OAAO,CAAC,OAAO,CAAC,EAAE,CAAC,MAAM,EAAE,CAAC,CAAC,KAAK,CAAC,GAAG,EAAE,GAAE,CAAC,CAAC,CAAC;QAC/C,CAAC;IACH,CAAC;AACH,CAAC,CAAC"}

package/dist/consumers.d.ts

@@ -0,0 +1,199 @@
+/**
+ * Terminal consumer operations: resolve an iterable to a single value (or a
+ * Promise of one), rather than returning another iterable. Two families:
+ *
+ * - Iterator-Helper parity (some/every/find/forEach/fold): native ES2025
+ *   Iterator Helpers give sync code `.some()`/`.every()`/`.find()`/
+ *   `.forEach()`/`.reduce()` for free via Iterator.from(iterable); there is
+ *   no shipped async equivalent (AsyncIterator helpers are TC39 Stage 2),
+ *   so the async half here is hand-rolled.
+ * - Summary/aggregate consumers (first/last/nth/quantify/min/max): not part
+ *   of core Python itertools, but a near-universal expectation for any
+ *   itertools-adjacent library (see itertools-ts's "summary" namespace);
+ *   `quantify` specifically is a named recipe from Python's own itertools
+ *   docs, not an invented name.
+ *
+ * House conventions:
+ * - Async variants `await` their callback's return value (predicate/fn/keyFn
+ *   may be async); sync variants do not, matching native Iterator Helpers'
+ *   own non-awaiting behavior and every other sync callback in this library
+ *   (groupBySync's keyFn, uniqueSync's keyFn, etc.).
+ * - Required-callback functions put the callback first (matching
+ *   itertools.ts: takeWhileSync(predicate, iterable)). Optional-callback
+ *   functions put `iterable` first (matching Python's own builtin order:
+ *   min(iterable, key=..., default=...)).
+ * - find/first/last/nth/min/max return `undefined` (or a caller-supplied
+ *   `defaultValue`) on an empty iterable/no match, rather than throwing --
+ *   consistent with Array.prototype.find, deliberately diverging from
+ *   Python's own min()/max() (which throw without a default).
+ *
+ * `fold` is named deliberately -- NOT `reduce` -- to avoid colliding with
+ * reduceSync/reduceAsync in iterator-tools.ts, which are an internal
+ * streaming primitive (yield each emitted item) rather than a terminal
+ * reduce-to-one-value.
+ */
+import { type SignalOptions } from "./abort.ts";
+type MaybePromise<T> = T | Promise<T>;
+export type AnyAsyncIterable<T> = AsyncIterable<T> | Iterable<T>;
+/**
+ * True if any item satisfies predicate. Short-circuits on the first match.
+ * @kind function
+ * @name someSync
+ */
+export declare const someSync: <T>(predicate: (item: T) => boolean, iterable: Iterable<T>) => boolean;
+/**
+ * Asynchronous dual of someSync. Short-circuits (a `return` inside
+ * `for await...of` closes the underlying async iterator).
+ * @kind function
+ * @name someAsync
+ */
+export declare const someAsync: <T>(predicate: (item: T) => MaybePromise<boolean>, iterable: AnyAsyncIterable<T>, { signal }?: SignalOptions) => Promise<boolean>;
+/**
+ * True only if every item satisfies predicate. Short-circuits on the first
+ * failure.
+ * @kind function
+ * @name everySync
+ */
+export declare const everySync: <T>(predicate: (item: T) => boolean, iterable: Iterable<T>) => boolean;
+/**
+ * Asynchronous dual of everySync.
+ * @kind function
+ * @name everyAsync
+ */
+export declare const everyAsync: <T>(predicate: (item: T) => MaybePromise<boolean>, iterable: AnyAsyncIterable<T>, { signal }?: SignalOptions) => Promise<boolean>;
+/**
+ * The first item satisfying predicate, or undefined. Short-circuits.
+ * @kind function
+ * @name findSync
+ */
+export declare const findSync: <T>(predicate: (item: T) => boolean, iterable: Iterable<T>) => T | undefined;
+/**
+ * Asynchronous dual of findSync.
+ * @kind function
+ * @name findAsync
+ */
+export declare const findAsync: <T>(predicate: (item: T) => MaybePromise<boolean>, iterable: AnyAsyncIterable<T>, { signal }?: SignalOptions) => Promise<T | undefined>;
+/**
+ * Call fn once per item, for side effects. Returns undefined.
+ * @kind function
+ * @name forEachSync
+ */
+export declare const forEachSync: <T>(fn: (item: T) => unknown, iterable: Iterable<T>) => void;
+/**
+ * Asynchronous dual of forEachSync. Distinct from `run` (iterator-tools.ts)
+ * -- `run` is framed around "rendering a program" (reversed argument order,
+ * `render` defaults to console.log); this is the itertools-parity-family
+ * addition with the family's usual (fn, iterable) argument order.
+ * @kind function
+ * @name forEachAsync
+ * @see run
+ */
+export declare const forEachAsync: <T>(fn: (item: T) => unknown, iterable: AnyAsyncIterable<T>, { signal }?: SignalOptions) => Promise<void>;
+/**
+ * Reduce iterable to a single value, given an explicit initial value
+ * (unlike Array.prototype.reduce, `init` is required -- avoids replicating
+ * reduce's "throws on empty array with no initial value" edge case).
+ * Named `fold`, not `reduce`, to avoid colliding with reduceSync/reduceAsync
+ * (iterator-tools.ts), which are an internal streaming primitive, not a
+ * terminal reduce-to-one-value.
+ * @kind function
+ * @name foldSync
+ */
+export declare const foldSync: <T, Acc>(fn: (acc: Acc, item: T) => Acc, init: Acc, iterable: Iterable<T>) => Acc;
+/**
+ * Asynchronous dual of foldSync.
+ * @kind function
+ * @name foldAsync
+ */
+export declare const foldAsync: <T, Acc>(fn: (acc: Acc, item: T) => MaybePromise<Acc>, init: Acc, iterable: AnyAsyncIterable<T>, { signal }?: SignalOptions) => Promise<Acc>;
+/**
+ * The first item, or defaultValue if the iterable is empty.
+ * @kind function
+ * @name firstSync
+ */
+export declare const firstSync: <T, D = undefined>(iterable: Iterable<T>, defaultValue?: D) => T | D;
+/**
+ * Asynchronous dual of firstSync.
+ * @kind function
+ * @name firstAsync
+ */
+export declare const firstAsync: <T, D = undefined>(iterable: AsyncIterable<T>, defaultValue?: D, { signal }?: SignalOptions) => Promise<T | D>;
+/**
+ * The last item, or defaultValue if the iterable is empty. Necessarily
+ * consumes the entire iterable -- no way around it for a generic source.
+ * @kind function
+ * @name lastSync
+ */
+export declare const lastSync: <T, D = undefined>(iterable: Iterable<T>, defaultValue?: D) => T | D;
+/**
+ * Asynchronous dual of lastSync.
+ * @kind function
+ * @name lastAsync
+ */
+export declare const lastAsync: <T, D = undefined>(iterable: AnyAsyncIterable<T>, defaultValue?: D, { signal }?: SignalOptions) => Promise<T | D>;
+/**
+ * The item at position n (0-indexed), or defaultValue if out of range.
+ * Reuses isliceSync rather than duplicating positional-skip logic.
+ * @kind function
+ * @name nthSync
+ */
+export declare const nthSync: <T, D = undefined>(iterable: Iterable<T>, n: number, defaultValue?: D) => T | D;
+/**
+ * Asynchronous dual of nthSync.
+ * @kind function
+ * @name nthAsync
+ */
+export declare const nthAsync: <T, D = undefined>(iterable: AsyncIterable<T>, n: number, defaultValue?: D, { signal }?: SignalOptions) => Promise<T | D>;
+/**
+ * Count items satisfying predicate (default: count all items). Named after
+ * the `quantify(iterable, pred=bool)` recipe documented in Python's own
+ * itertools docs -- not part of core itertools, but not an invented name
+ * either. Deliberately not named `count`/`countSync`, which already mirror
+ * Python's itertools.count (an integer *sequence generator*, unrelated).
+ * @kind function
+ * @name quantifySync
+ */
+export declare const quantifySync: <T>(iterable: Iterable<T>, predicate?: (item: T) => boolean) => number;
+/**
+ * Asynchronous dual of quantifySync.
+ * @kind function
+ * @name quantifyAsync
+ */
+export declare const quantifyAsync: <T>(iterable: AnyAsyncIterable<T>, predicate?: (item: T) => MaybePromise<boolean>, { signal }?: SignalOptions) => Promise<number>;
+/**
+ * The item with the minimum key (default: the item itself), or defaultValue
+ * if the iterable is empty. Necessarily consumes the entire iterable.
+ * Mirrors Python's builtin min(iterable, key=..., default=...), but
+ * returns undefined rather than throwing when empty and no default is given.
+ * A NaN key anywhere in the iterable poisons the result to NaN, matching
+ * `Math.min`'s own NaN-poisoning convention (rather than silently dropping
+ * out of every comparison and returning an unrelated wrong item).
+ * @kind function
+ * @name minSync
+ */
+export declare const minSync: <T, D = undefined>(iterable: Iterable<T>, keyFn?: (item: T) => unknown, defaultValue?: D) => T | D;
+/**
+ * Asynchronous dual of minSync; keyFn may be async. Same NaN-poisoning
+ * convention as minSync.
+ * @kind function
+ * @name minAsync
+ */
+export declare const minAsync: <T, D = undefined>(iterable: AnyAsyncIterable<T>, keyFn?: (item: T) => unknown, defaultValue?: D, { signal }?: SignalOptions) => Promise<T | D>;
+/**
+ * The item with the maximum key (default: the item itself), or defaultValue
+ * if the iterable is empty. Mirrors Python's builtin
+ * max(iterable, key=..., default=...); see minSync for the
+ * undefined-vs-throw divergence and the NaN-poisoning convention.
+ * @kind function
+ * @name maxSync
+ */
+export declare const maxSync: <T, D = undefined>(iterable: Iterable<T>, keyFn?: (item: T) => unknown, defaultValue?: D) => T | D;
+/**
+ * Asynchronous dual of maxSync; keyFn may be async. Same NaN-poisoning
+ * convention as minSync.
+ * @kind function
+ * @name maxAsync
+ */
+export declare const maxAsync: <T, D = undefined>(iterable: AnyAsyncIterable<T>, keyFn?: (item: T) => unknown, defaultValue?: D, { signal }?: SignalOptions) => Promise<T | D>;
+export {};
+//# sourceMappingURL=consumers.d.ts.map

package/dist/consumers.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"consumers.d.ts","sourceRoot":"","sources":["../src/consumers.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;GAiCG;AAEH,OAAO,EAAa,KAAK,aAAa,EAAE,MAAM,YAAY,CAAC;AAG3D,KAAK,YAAY,CAAC,CAAC,IAAI,CAAC,GAAG,OAAO,CAAC,CAAC,CAAC,CAAC;AACtC,MAAM,MAAM,gBAAgB,CAAC,CAAC,IAAI,aAAa,CAAC,CAAC,CAAC,GAAG,QAAQ,CAAC,CAAC,CAAC,CAAC;AAajE;;;;GAIG;AACH,eAAO,MAAM,QAAQ,GAAI,CAAC,EAAE,WAAW,CAAC,IAAI,EAAE,CAAC,KAAK,OAAO,EAAE,UAAU,QAAQ,CAAC,CAAC,CAAC,KAAG,OAC5C,CAAC;AAE1C;;;;;GAKG;AACH,eAAO,MAAM,SAAS,GAAU,CAAC,EAC/B,WAAW,CAAC,IAAI,EAAE,CAAC,KAAK,YAAY,CAAC,OAAO,CAAC,EAC7C,UAAU,gBAAgB,CAAC,CAAC,CAAC,EAC7B,aAAY,aAAkB,KAC7B,OAAO,CAAC,OAAO,CAKjB,CAAC;AAEF;;;;;GAKG;AACH,eAAO,MAAM,SAAS,GAAI,CAAC,EAAE,WAAW,CAAC,IAAI,EAAE,CAAC,KAAK,OAAO,EAAE,UAAU,QAAQ,CAAC,CAAC,CAAC,KAAG,OAC5C,CAAC;AAE3C;;;;GAIG;AACH,eAAO,MAAM,UAAU,GAAU,CAAC,EAChC,WAAW,CAAC,IAAI,EAAE,CAAC,KAAK,YAAY,CAAC,OAAO,CAAC,EAC7C,UAAU,gBAAgB,CAAC,CAAC,CAAC,EAC7B,aAAY,aAAkB,KAC7B,OAAO,CAAC,OAAO,CAKjB,CAAC;AAEF;;;;GAIG;AACH,eAAO,MAAM,QAAQ,GAAI,CAAC,EAAE,WAAW,CAAC,IAAI,EAAE,CAAC,KAAK,OAAO,EAAE,UAAU,QAAQ,CAAC,CAAC,CAAC,KAAG,CAAC,GAAG,SAChD,CAAC;AAE1C;;;;GAIG;AACH,eAAO,MAAM,SAAS,GAAU,CAAC,EAC/B,WAAW,CAAC,IAAI,EAAE,CAAC,KAAK,YAAY,CAAC,OAAO,CAAC,EAC7C,UAAU,gBAAgB,CAAC,CAAC,CAAC,EAC7B,aAAY,aAAkB,KAC7B,OAAO,CAAC,CAAC,GAAG,SAAS,CAKvB,CAAC;AAEF;;;;GAIG;AACH,eAAO,MAAM,WAAW,GAAI,CAAC,EAAE,IAAI,CAAC,IAAI,EAAE,CAAC,KAAK,OAAO,EAAE,UAAU,QAAQ,CAAC,CAAC,CAAC,KAAG,IAC5C,CAAC;AAEtC;;;;;;;;GAQG;AACH,eAAO,MAAM,YAAY,GAAU,CAAC,EAClC,IAAI,CAAC,IAAI,EAAE,CAAC,KAAK,OAAO,EACxB,UAAU,gBAAgB,CAAC,CAAC,CAAC,EAC7B,aAAY,aAAkB,KAC7B,OAAO,CAAC,IAAI,CAId,CAAC;AAEF;;;;;;;;;GASG;AACH,eAAO,MAAM,QAAQ,GAAI,CAAC,EAAE,GAAG,EAAE,IAAI,CAAC,GAAG,EAAE,GAAG,EAAE,IAAI,EAAE,CAAC,KAAK,GAAG,EAAE,MAAM,GAAG,EAAE,UAAU,QAAQ,CAAC,CAAC,CAAC,KAAG,GAC1D,CAAC;AAE3C;;;;GAIG;AACH,eAAO,MAAM,SAAS,GAAU,CAAC,EAAE,GAAG,EACpC,IAAI,CAAC,GAAG,EAAE,GAAG,EAAE,IAAI,EAAE,CAAC,KAAK,YAAY,CAAC,GAAG,CAAC,EAC5C,MAAM,GAAG,EACT,UAAU,gBAAgB,CAAC,CAAC,CAAC,EAC7B,aAAY,aAAkB,KAC7B,OAAO,CAAC,GAAG,CAMb,CAAC;AAEF;;;;GAIG;AACH,eAAO,MAAM,SAAS,GAAI,CAAC,EAAE,CAAC,GAAG,SAAS,EAAE,UAAU,QAAQ,CAAC,CAAC,CAAC,EAAE,eAAe,CAAC,KAAG,CAAC,GAAG,CAGzF,CAAC;AAEF;;;;GAIG;AACH,eAAO,MAAM,UAAU,GAAU,CAAC,EAAE,CAAC,GAAG,SAAS,EAC/C,UAAU,aAAa,CAAC,CAAC,CAAC,EAC1B,eAAe,CAAC,EAChB,aAAY,aAAkB,KAC7B,OAAO,CAAC,CAAC,GAAG,CAAC,CASf,CAAC;AAEF;;;;;GAKG;AACH,eAAO,MAAM,QAAQ,GAAI,CAAC,EAAE,CAAC,GAAG,SAAS,EAAE,UAAU,QAAQ,CAAC,CAAC,CAAC,EAAE,eAAe,CAAC,KAAG,CAAC,GAAG,CAMxF,CAAC;AAEF;;;;GAIG;AACH,eAAO,MAAM,SAAS,GAAU,CAAC,EAAE,CAAC,GAAG,SAAS,EAC9C,UAAU,gBAAgB,CAAC,CAAC,CAAC,EAC7B,eAAe,CAAC,EAChB,aAAY,aAAkB,KAC7B,OAAO,CAAC,CAAC,GAAG,CAAC,CAMf,CAAC;AAEF;;;;;GAKG;AACH,eAAO,MAAM,OAAO,GAAI,CAAC,EAAE,CAAC,GAAG,SAAS,EAAE,UAAU,QAAQ,CAAC,CAAC,CAAC,EAAE,GAAG,MAAM,EAAE,eAAe,CAAC,KAAG,CAAC,GAAG,CAKlG,CAAC;AAEF;;;;GAIG;AACH,eAAO,MAAM,QAAQ,GAAU,CAAC,EAAE,CAAC,GAAG,SAAS,EAC7C,UAAU,aAAa,CAAC,CAAC,CAAC,EAC1B,GAAG,MAAM,EACT,eAAe,CAAC,EAChB,aAAY,aAAkB,KAC7B,OAAO,CAAC,CAAC,GAAG,CAAC,CAKf,CAAC;AAEF;;;;;;;;GAQG;AACH,eAAO,MAAM,YAAY,GAAI,CAAC,EAAE,UAAU,QAAQ,CAAC,CAAC,CAAC,EAAE,YAAW,CAAC,IAAI,EAAE,CAAC,KAAK,OAAoB,KAAG,MAMrG,CAAC;AAEF;;;;GAIG;AACH,eAAO,MAAM,aAAa,GAAU,CAAC,EACnC,UAAU,gBAAgB,CAAC,CAAC,CAAC,EAC7B,YAAW,CAAC,IAAI,EAAE,CAAC,KAAK,YAAY,CAAC,OAAO,CAAc,EAC1D,aAAY,aAAkB,KAC7B,OAAO,CAAC,MAAM,CAMhB,CAAC;AAEF;;;;;;;;;;GAUG;AACH,eAAO,MAAM,OAAO,GAAI,CAAC,EAAE,CAAC,GAAG,SAAS,EACtC,UAAU,QAAQ,CAAC,CAAC,CAAC,EACrB,QAAO,CAAC,IAAI,EAAE,CAAC,KAAK,OAAkB,EACtC,eAAe,CAAC,KACf,CAAC,GAAG,CAeN,CAAC;AAEF;;;;;GAKG;AACH,eAAO,MAAM,QAAQ,GAAU,CAAC,EAAE,CAAC,GAAG,SAAS,EAC7C,UAAU,gBAAgB,CAAC,CAAC,CAAC,EAC7B,QAAO,CAAC,IAAI,EAAE,CAAC,KAAK,OAAkB,EACtC,eAAe,CAAC,EAChB,aAAY,aAAkB,KAC7B,OAAO,CAAC,CAAC,GAAG,CAAC,CAef,CAAC;AAEF;;;;;;;GAOG;AACH,eAAO,MAAM,OAAO,GAAI,CAAC,EAAE,CAAC,GAAG,SAAS,EACtC,UAAU,QAAQ,CAAC,CAAC,CAAC,EACrB,QAAO,CAAC,IAAI,EAAE,CAAC,KAAK,OAAkB,EACtC,eAAe,CAAC,KACf,CAAC,GAAG,CAeN,CAAC;AAEF;;;;;GAKG;AACH,eAAO,MAAM,QAAQ,GAAU,CAAC,EAAE,CAAC,GAAG,SAAS,EAC7C,UAAU,gBAAgB,CAAC,CAAC,CAAC,EAC7B,QAAO,CAAC,IAAI,EAAE,CAAC,KAAK,OAAkB,EACtC,eAAe,CAAC,EAChB,aAAY,aAAkB,KAC7B,OAAO,CAAC,CAAC,GAAG,CAAC,CAef,CAAC"}