spliterator 5.0.0 → 6.0.0

package/out/lib/AsyncSequence.js

@@ -0,0 +1,432 @@
+/**
+ * @copyright Sister Software
+ * @license MIT
+ * @author Teffen Ellis, et al.
+ */
+import { ReadableStream } from "stream/web";
+const OP_MAP = 0;
+const OP_FILTER = 1;
+const OP_TAKE = 2;
+const OP_DROP = 3;
+function isThenable(value) {
+    return value !== null && typeof value === "object" && typeof value.then === "function";
+}
+function toAsyncIterator(source) {
+    if (Symbol.asyncIterator in source)
+        return source[Symbol.asyncIterator]();
+    const iterator = source[Symbol.iterator]();
+    return {
+        next: async () => iterator.next(),
+        return: async (value) => iterator.return?.(value) ?? { value: undefined, done: true },
+    };
+}
+async function* flattenValues(source, fn) {
+    let counter = 0;
+    for await (const value of source) {
+        const mapped = fn(value, counter++);
+        const inner = isThenable(mapped) ? await mapped : mapped;
+        if (inner === null || typeof inner !== "object") {
+            throw new TypeError(`flatMap callback must return an iterable, received ${typeof inner}`);
+        }
+        yield* inner;
+    }
+}
+async function* batchValues(source, size) {
+    let batch = [];
+    for await (const value of source) {
+        batch.push(value);
+        if (batch.length === size) {
+            yield batch;
+            batch = [];
+        }
+    }
+    if (batch.length) {
+        yield batch;
+    }
+}
+async function* mapValuesConcurrently(source, fn, limit, signal) {
+    const upstream = source[Symbol.asyncIterator]();
+    // Slots key this map, not items: a source may repeat a value (a list of file paths routinely does), and two `===`
+    // equal keys would collapse into one entry, losing a result and deleting the wrong dispatch.
+    const inflight = new Map();
+    let slot = 0;
+    let exhausted = false;
+    try {
+        for (;;) {
+            if (signal?.aborted)
+                break;
+            while (!exhausted && inflight.size < limit) {
+                const result = await upstream.next();
+                if (result.done) {
+                    exhausted = true;
+                    break;
+                }
+                const current = slot++;
+                const produced = fn(result.value, current);
+                inflight.set(current, Promise.resolve(produced).then((value) => ({ slot: current, value })));
+            }
+            if (!inflight.size)
+                break;
+            const { slot: settled, value } = await Promise.race(inflight.values());
+            inflight.delete(settled);
+            yield value;
+        }
+    }
+    finally {
+        await upstream.return?.();
+        // Settle whatever is still running so an abandoned rejection is never unobserved.
+        await Promise.allSettled(inflight.values());
+    }
+}
+/**
+ * A lazy, chainable async iterator.
+ *
+ * The core methods (`map`, `filter`, `take`, `drop`, `flatMap`, `reduce`, `toArray`, `forEach`, `some`, `every`,
+ * `find`) match the [async iterator helpers proposal][proposal] in name, arity, and semantics — including the `counter`
+ * second argument handed to every callback. Callbacks may return promises. Code written against this keeps working
+ * verbatim if the proposal ever ships natively.
+ *
+ * [proposal]: https://github.com/tc39/proposal-async-iterator-helpers
+ *
+ * **Chain depth is nearly free.** A chain is an op list plus a source, not nested generators, so one async boundary is
+ * paid per item no matter how many operators you stack; only the op loop grows. Measured on Node 26 over 2M items:
+ * ~5.4M items/s at three operators and ~4.9M/s at six, against ~2.3M/s for the equivalent nested-generator
+ * implementation, where each operator adds a microtask hop. Doubling the operator count costs ~10% here and would cost
+ * ~2× there. Only {@linkcode flatMap}, {@linkcode chunks}, and {@linkcode parallelMap} break fusion, because they need
+ * inner-iterator state.
+ *
+ * Callback results are awaited **only when thenable**, so synchronous callbacks — the common case — cost no microtask
+ * hop at all.
+ *
+ * **When not to reach for this.** Wrapping costs ~1.9× a bare async generator (~10.3M/s), one extra async frame per
+ * item. On parsed rows (`JSON.parse` at ~1–3µs) that is 3–8%, invisible. On raw {@linkcode Uint8Array} ranges with no
+ * per-row parse it is most of the cost — iterate the {@linkcode AsyncSpliterator} directly there.
+ *
+ * Single-shot, like the iterators the proposal specifies: iterating consumes the source.
+ */
+export class AsyncSequence {
+    #source;
+    #ops;
+    /**
+     * Indices of `take` ops, precomputed so the exhaustion pre-check costs nothing when there are none.
+     */
+    #takeIndices;
+    #upstream = null;
+    #syncUpstream = null;
+    #counters = null;
+    #budgets = null;
+    #done = false;
+    constructor(source, ops = []) {
+        this.#source = source;
+        this.#ops = ops;
+        const takeIndices = [];
+        for (let i = 0; i < ops.length; i++) {
+            if (ops[i].kind === OP_TAKE) {
+                takeIndices.push(i);
+            }
+        }
+        this.#takeIndices = takeIndices;
+    }
+    /**
+     * Wrap any iterable or async iterable as a chainable sequence.
+     */
+    static from(source) {
+        return source instanceof AsyncSequence ? source : new AsyncSequence(source);
+    }
+    /**
+     * Resolve the source once, keeping a synchronous iterator as such.
+     *
+     * Adapting a sync iterator to the async protocol would allocate a promise per pulled value for an iterator that never
+     * needs one, which is most of the cost of parsing an in-memory source: 0.733ms against a 0.540ms floor over a 68KB
+     * file.
+     */
+    async #openUpstream() {
+        if (this.#upstream)
+            return this.#upstream;
+        if (this.#syncUpstream)
+            return this.#syncUpstream;
+        const source = this.#source;
+        const resolved = typeof source === "function" ? await source() : source;
+        if (!(Symbol.asyncIterator in resolved)) {
+            this.#syncUpstream = resolved[Symbol.iterator]();
+            return this.#syncUpstream;
+        }
+        this.#upstream = toAsyncIterator(resolved);
+        return this.#upstream;
+    }
+    #derive(op) {
+        return new AsyncSequence(this.#source, [...this.#ops, op]);
+    }
+    //#region Spec-compatible core — lazy
+    /**
+     * Transform each value. The callback receives `(value, counter)` and may return a promise.
+     */
+    map(fn) {
+        return this.#derive({ kind: OP_MAP, fn });
+    }
+    /**
+     * Keep values for which the callback is truthy. The callback receives `(value, counter)` and may return a promise.
+     */
+    filter(fn) {
+        return this.#derive({ kind: OP_FILTER, fn });
+    }
+    /**
+     * Yield at most `limit` values, then close the underlying iterator.
+     *
+     * The close is what makes this safe on a file-backed source — `take(5)` over a 40GB file releases the handle rather
+     * than leaving it open until GC.
+     */
+    take(limit) {
+        const normalized = Math.trunc(limit);
+        if (!Number.isFinite(normalized) || normalized < 0) {
+            throw new RangeError(`take(${limit}): limit must be a non-negative finite number`);
+        }
+        return this.#derive({ kind: OP_TAKE, limit: normalized });
+    }
+    /**
+     * Skip the first `limit` values.
+     */
+    drop(limit) {
+        const normalized = Math.trunc(limit);
+        if (!Number.isFinite(normalized) || normalized < 0) {
+            throw new RangeError(`drop(${limit}): limit must be a non-negative finite number`);
+        }
+        return this.#derive({ kind: OP_DROP, limit: normalized });
+    }
+    /**
+     * Map each value to an iterable and flatten one level.
+     *
+     * **Fusion barrier.** Unlike the other operators this needs inner-iterator state, so it starts a fresh fused segment
+     * rather than joining the current op list. Stacking `flatMap` costs one async boundary each; stacking
+     * `map`/`filter`/`take`/`drop` costs nothing.
+     */
+    flatMap(fn) {
+        return new AsyncSequence(flattenValues(this, fn));
+    }
+    //#endregion
+    //#region Spec-compatible core — terminal
+    /**
+     * Collect every remaining value into an array.
+     *
+     * **Reads the whole source into memory.** On a sequence backed by a file this defeats the point of streaming — filter
+     * and map first so only what you keep is materialized.
+     */
+    async toArray() {
+        const values = [];
+        for await (const value of this) {
+            values.push(value);
+        }
+        return values;
+    }
+    /**
+     * Invoke the callback for each value, for side effects.
+     */
+    async forEach(fn) {
+        let counter = 0;
+        for await (const value of this) {
+            const result = fn(value, counter++);
+            if (isThenable(result)) {
+                await result;
+            }
+        }
+    }
+    async reduce(fn, ...rest) {
+        let accumulator = rest[0];
+        let seeded = rest.length > 0;
+        let counter = 0;
+        for await (const value of this) {
+            if (!seeded) {
+                accumulator = value;
+                seeded = true;
+                counter++;
+                continue;
+            }
+            const next = fn(accumulator, value, counter++);
+            accumulator = isThenable(next) ? await next : next;
+        }
+        if (!seeded)
+            throw new TypeError("reduce of empty sequence with no initial value");
+        return accumulator;
+    }
+    /**
+     * Whether any value satisfies the callback. Short-circuits and closes the underlying iterator.
+     */
+    async some(fn) {
+        let counter = 0;
+        for await (const value of this) {
+            const result = fn(value, counter++);
+            if (isThenable(result) ? await result : result)
+                return true;
+        }
+        return false;
+    }
+    /**
+     * Whether every value satisfies the callback. Short-circuits and closes the underlying iterator.
+     */
+    async every(fn) {
+        let counter = 0;
+        for await (const value of this) {
+            const result = fn(value, counter++);
+            if (!(isThenable(result) ? await result : result))
+                return false;
+        }
+        return true;
+    }
+    /**
+     * The first value satisfying the callback, or `undefined`. Short-circuits and closes the underlying iterator.
+     */
+    async find(fn) {
+        let counter = 0;
+        for await (const value of this) {
+            const result = fn(value, counter++);
+            if (isThenable(result) ? await result : result)
+                return value;
+        }
+        return undefined;
+    }
+    //#endregion
+    //#region Extras — deliberately not spec surface
+    /**
+     * Group values into arrays of `size`, with a shorter final batch if the sequence does not divide evenly.
+     *
+     * Distinct from {@linkcode take}, which yields the first `size` _values_. Named for the [iterator chunking
+     * proposal](https://github.com/tc39/proposal-iterator-chunking).
+     *
+     * **Fusion barrier**, like {@linkcode flatMap}.
+     */
+    chunks(size) {
+        const normalized = Math.trunc(size);
+        if (!Number.isFinite(normalized) || normalized < 1) {
+            throw new RangeError(`chunks(${size}): size must be a positive finite number`);
+        }
+        return new AsyncSequence(batchValues(this, normalized));
+    }
+    /**
+     * Map values through a callback with up to `concurrency` calls in flight, yielding in **completion order** — not
+     * input order.
+     *
+     * The callback is a closure, so it runs on the caller's thread. This overlaps _latency_ (file reads, network) and
+     * does nothing for CPU-bound work; for that, cross a thread boundary with `parallelMapWorkers` or
+     * `AsyncSpliterator.asManyWorkers`, which take a module path precisely because a closure cannot.
+     *
+     * **Fusion barrier**, like {@linkcode flatMap}.
+     */
+    parallelMap(fn, { concurrency, signal }) {
+        return new AsyncSequence(mapValuesConcurrently(this, fn, Math.max(1, Math.trunc(concurrency)), signal));
+    }
+    /**
+     * Expose the sequence as a web stream, for interop with `pipeThrough`/`pipeTo` consumers.
+     */
+    toReadableStream() {
+        const iterator = this[Symbol.asyncIterator]();
+        return new ReadableStream({
+            pull: async (controller) => {
+                const { done, value } = await iterator.next();
+                if (done) {
+                    controller.close();
+                }
+                else {
+                    controller.enqueue(value);
+                }
+            },
+            cancel: async () => void (await iterator.return?.()),
+        });
+    }
+    /**
+     * Pipe the sequence through a transform stream.
+     */
+    pipeThrough(transform, options) {
+        return this.toReadableStream().pipeThrough(transform, options);
+    }
+    //#endregion
+    //#region Iteration
+    async next() {
+        if (this.#done)
+            return { value: undefined, done: true };
+        const ops = this.#ops;
+        const length = ops.length;
+        this.#counters ??= Array.from({ length }).fill(0);
+        this.#budgets ??= ops.map((op) => (op.kind === OP_TAKE || op.kind === OP_DROP ? op.limit : 0));
+        const counters = this.#counters;
+        const budgets = this.#budgets;
+        // A satisfied `take` must close the source WITHOUT pulling again — the whole point of `take(5)` on a huge file is
+        // that the sixth row is never read.
+        for (const index of this.#takeIndices) {
+            if (budgets[index] <= 0)
+                return this.#finish();
+        }
+        const upstream = await this.#openUpstream();
+        const isSync = upstream === this.#syncUpstream;
+        try {
+            outer: for (;;) {
+                const pulled = upstream.next();
+                const result = isSync ? pulled : await pulled;
+                if (result.done) {
+                    this.#done = true;
+                    return { value: undefined, done: true };
+                }
+                let value = result.value;
+                for (let i = 0; i < length; i++) {
+                    const op = ops[i];
+                    switch (op.kind) {
+                        case OP_MAP: {
+                            const mapped = op.fn(value, counters[i]++);
+                            value = isThenable(mapped) ? await mapped : mapped;
+                            break;
+                        }
+                        case OP_FILTER: {
+                            const keep = op.fn(value, counters[i]++);
+                            if (!(isThenable(keep) ? await keep : keep))
+                                continue outer;
+                            break;
+                        }
+                        case OP_DROP: {
+                            if (budgets[i] > 0) {
+                                budgets[i]--;
+                                continue outer;
+                            }
+                            break;
+                        }
+                        case OP_TAKE: {
+                            if (budgets[i] <= 0)
+                                return this.#finish();
+                            budgets[i]--;
+                            break;
+                        }
+                    }
+                }
+                return { value: value, done: false };
+            }
+        }
+        catch (error) {
+            // A rejected `next()` does not make `for await` call `return()` — the iterator is presumed broken — so a
+            // throwing callback would otherwise strand the source's resources.
+            await this.#finish();
+            throw error;
+        }
+    }
+    /**
+     * Close the sequence and release the underlying source.
+     */
+    async return() {
+        return this.#finish();
+    }
+    async #finish() {
+        if (this.#done)
+            return { value: undefined, done: true };
+        this.#done = true;
+        // An eager source may already hold a resource that no pull ever touched, so closing has to reach it even along
+        // paths like `take(0)`. A thunk source that was never invoked has nothing open to release, and invoking it here
+        // would open a file purely to close it.
+        const source = this.#source;
+        const upstream = this.#upstream ?? this.#syncUpstream ?? (typeof source === "function" ? null : toAsyncIterator(source));
+        this.#upstream = null;
+        this.#syncUpstream = null;
+        await upstream?.return?.();
+        return { value: undefined, done: true };
+    }
+    [Symbol.asyncIterator]() {
+        return this;
+    }
+}
+//# sourceMappingURL=AsyncSequence.js.map

package/out/lib/AsyncSequence.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"AsyncSequence.js","sourceRoot":"","sources":["../../lib/AsyncSequence.ts"],"names":[],"mappings":"AAAA;;;;GAIG;AAEH,OAAO,EAAE,cAAc,EAAqD,MAAM,YAAY,CAAA;AAc9F,MAAM,MAAM,GAAG,CAAC,CAAA;AAChB,MAAM,SAAS,GAAG,CAAC,CAAA;AACnB,MAAM,OAAO,GAAG,CAAC,CAAA;AACjB,MAAM,OAAO,GAAG,CAAC,CAAA;AAEjB,SAAS,UAAU,CAAC,KAAc;IACjC,OAAO,KAAK,KAAK,IAAI,IAAI,OAAO,KAAK,KAAK,QAAQ,IAAI,OAAQ,KAA8B,CAAC,IAAI,KAAK,UAAU,CAAA;AACjH,CAAC;AAcD,SAAS,eAAe,CAAI,MAAsC;IACjE,IAAI,MAAM,CAAC,aAAa,IAAI,MAAM;QAAE,OAAO,MAAM,CAAC,MAAM,CAAC,aAAa,CAAC,EAAE,CAAA;IAEzE,MAAM,QAAQ,GAAG,MAAM,CAAC,MAAM,CAAC,QAAQ,CAAC,EAAE,CAAA;IAE1C,OAAO;QACN,IAAI,EAAE,KAAK,IAAI,EAAE,CAAC,QAAQ,CAAC,IAAI,EAAE;QACjC,MAAM,EAAE,KAAK,EAAE,KAAe,EAAE,EAAE,CAAC,QAAQ,CAAC,MAAM,EAAE,CAAC,KAAK,CAAC,IAAI,EAAE,KAAK,EAAE,SAAS,EAAE,IAAI,EAAE,IAAI,EAAE;KAC3E,CAAA;AACtB,CAAC;AAED,KAAK,SAAS,CAAC,CAAC,aAAa,CAC5B,MAAwB,EACxB,EAA+G;IAE/G,IAAI,OAAO,GAAG,CAAC,CAAA;IAEf,IAAI,KAAK,EAAE,MAAM,KAAK,IAAI,MAAM,EAAE,CAAC;QAClC,MAAM,MAAM,GAAG,EAAE,CAAC,KAAK,EAAE,OAAO,EAAE,CAAC,CAAA;QACnC,MAAM,KAAK,GAAG,UAAU,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC,MAAM,MAAM,CAAC,CAAC,CAAC,MAAM,CAAA;QAExD,IAAI,KAAK,KAAK,IAAI,IAAI,OAAO,KAAK,KAAK,QAAQ,EAAE,CAAC;YACjD,MAAM,IAAI,SAAS,CAAC,sDAAsD,OAAO,KAAK,EAAE,CAAC,CAAA;QAC1F,CAAC;QAED,KAAK,CAAC,CAAC,KAAyB,CAAA;IACjC,CAAC;AACF,CAAC;AAED,KAAK,SAAS,CAAC,CAAC,WAAW,CAAI,MAAwB,EAAE,IAAY;IACpE,IAAI,KAAK,GAAQ,EAAE,CAAA;IAEnB,IAAI,KAAK,EAAE,MAAM,KAAK,IAAI,MAAM,EAAE,CAAC;QAClC,KAAK,CAAC,IAAI,CAAC,KAAK,CAAC,CAAA;QAEjB,IAAI,KAAK,CAAC,MAAM,KAAK,IAAI,EAAE,CAAC;YAC3B,MAAM,KAAK,CAAA;YAEX,KAAK,GAAG,EAAE,CAAA;QACX,CAAC;IACF,CAAC;IAED,IAAI,KAAK,CAAC,MAAM,EAAE,CAAC;QAClB,MAAM,KAAK,CAAA;IACZ,CAAC;AACF,CAAC;AAED,KAAK,SAAS,CAAC,CAAC,qBAAqB,CACpC,MAAwB,EACxB,EAAqD,EACrD,KAAa,EACb,MAAoB;IAEpB,MAAM,QAAQ,GAAG,MAAM,CAAC,MAAM,CAAC,aAAa,CAAC,EAAE,CAAA;IAC/C,kHAAkH;IAClH,6FAA6F;IAC7F,MAAM,QAAQ,GAAG,IAAI,GAAG,EAA+C,CAAA;IACvE,IAAI,IAAI,GAAG,CAAC,CAAA;IACZ,IAAI,SAAS,GAAG,KAAK,CAAA;IAErB,IAAI,CAAC;QACJ,SAAS,CAAC;YACT,IAAI,MAAM,EAAE,OAAO;gBAAE,MAAK;YAE1B,OAAO,CAAC,SAAS,IAAI,QAAQ,CAAC,IAAI,GAAG,KAAK,EAAE,CAAC;gBAC5C,MAAM,MAAM,GAAG,MAAM,QAAQ,CAAC,IAAI,EAAE,CAAA;gBAEpC,IAAI,MAAM,CAAC,IAAI,EAAE,CAAC;oBACjB,SAAS,GAAG,IAAI,CAAA;oBAEhB,MAAK;gBACN,CAAC;gBAED,MAAM,OAAO,GAAG,IAAI,EAAE,CAAA;gBACtB,MAAM,QAAQ,GAAG,EAAE,CAAC,MAAM,CAAC,KAAK,EAAE,OAAO,CAAC,CAAA;gBAE1C,QAAQ,CAAC,GAAG,CACX,OAAO,EACP,OAAO,CAAC,OAAO,CAAC,QAAQ,CAAC,CAAC,IAAI,CAAC,CAAC,KAAK,EAAE,EAAE,CAAC,CAAC,EAAE,IAAI,EAAE,OAAO,EAAE,KAAK,EAAE,CAAC,CAAC,CACrE,CAAA;YACF,CAAC;YAED,IAAI,CAAC,QAAQ,CAAC,IAAI;gBAAE,MAAK;YAEzB,MAAM,EAAE,IAAI,EAAE,OAAO,EAAE,KAAK,EAAE,GAAG,MAAM,OAAO,CAAC,IAAI,CAAC,QAAQ,CAAC,MAAM,EAAE,CAAC,CAAA;YAEtE,QAAQ,CAAC,MAAM,CAAC,OAAO,CAAC,CAAA;YAExB,MAAM,KAAK,CAAA;QACZ,CAAC;IACF,CAAC;YAAS,CAAC;QACV,MAAM,QAAQ,CAAC,MAAM,EAAE,EAAE,CAAA;QACzB,kFAAkF;QAClF,MAAM,OAAO,CAAC,UAAU,CAAC,QAAQ,CAAC,MAAM,EAAE,CAAC,CAAA;IAC5C,CAAC;AACF,CAAC;AAqBD;;;;;;;;;;;;;;;;;;;;;;;;;GAyBG;AACH,MAAM,OAAO,aAAa;IAChB,OAAO,CAAyB;IAChC,IAAI,CAAe;IAE5B;;OAEG;IACM,YAAY,CAAmB;IAExC,SAAS,GAAkC,IAAI,CAAA;IAC/C,aAAa,GAA6B,IAAI,CAAA;IAC9C,SAAS,GAAoB,IAAI,CAAA;IACjC,QAAQ,GAAoB,IAAI,CAAA;IAChC,KAAK,GAAG,KAAK,CAAA;IAEb,YAAY,MAA+B,EAAE,GAAG,GAAkB,EAAE;QACnE,IAAI,CAAC,OAAO,GAAG,MAAM,CAAA;QACrB,IAAI,CAAC,IAAI,GAAG,GAAG,CAAA;QAEf,MAAM,WAAW,GAAa,EAAE,CAAA;QAEhC,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,GAAG,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;YACrC,IAAI,GAAG,CAAC,CAAC,CAAE,CAAC,IAAI,KAAK,OAAO,EAAE,CAAC;gBAC9B,WAAW,CAAC,IAAI,CAAC,CAAC,CAAC,CAAA;YACpB,CAAC;QACF,CAAC;QAED,IAAI,CAAC,YAAY,GAAG,WAAW,CAAA;IAChC,CAAC;IAED;;OAEG;IACH,MAAM,CAAC,IAAI,CAAI,MAAyB;QACvC,OAAO,MAAM,YAAY,aAAa,CAAC,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,IAAI,aAAa,CAAI,MAAM,CAAC,CAAA;IAC/E,CAAC;IAED;;;;;;OAMG;IACH,KAAK,CAAC,aAAa;QAClB,IAAI,IAAI,CAAC,SAAS;YAAE,OAAO,IAAI,CAAC,SAAS,CAAA;QAEzC,IAAI,IAAI,CAAC,aAAa;YAAE,OAAO,IAAI,CAAC,aAAa,CAAA;QAEjD,MAAM,MAAM,GAAG,IAAI,CAAC,OAAO,CAAA;QAC3B,MAAM,QAAQ,GAAG,OAAO,MAAM,KAAK,UAAU,CAAC,CAAC,CAAC,MAAM,MAAM,EAAE,CAAC,CAAC,CAAC,MAAM,CAAA;QAEvE,IAAI,CAAC,CAAC,MAAM,CAAC,aAAa,IAAI,QAAQ,CAAC,EAAE,CAAC;YACzC,IAAI,CAAC,aAAa,GAAG,QAAQ,CAAC,MAAM,CAAC,QAAQ,CAAC,EAAE,CAAA;YAEhD,OAAO,IAAI,CAAC,aAAa,CAAA;QAC1B,CAAC;QAED,IAAI,CAAC,SAAS,GAAG,eAAe,CAAC,QAAQ,CAAC,CAAA;QAE1C,OAAO,IAAI,CAAC,SAAS,CAAA;IACtB,CAAC;IAED,OAAO,CAAI,EAAM;QAChB,OAAO,IAAI,aAAa,CAAI,IAAI,CAAC,OAAO,EAAE,CAAC,GAAG,IAAI,CAAC,IAAI,EAAE,EAAE,CAAC,CAAC,CAAA;IAC9D,CAAC;IAED,qCAAqC;IAErC;;OAEG;IACH,GAAG,CAAI,EAAqD;QAC3D,OAAO,IAAI,CAAC,OAAO,CAAI,EAAE,IAAI,EAAE,MAAM,EAAE,EAAE,EAAE,CAAC,CAAA;IAC7C,CAAC;IAED;;OAEG;IACH,MAAM,CAAC,EAA0C;QAChD,OAAO,IAAI,CAAC,OAAO,CAAI,EAAE,IAAI,EAAE,SAAS,EAAE,EAAE,EAAE,CAAC,CAAA;IAChD,CAAC;IAED;;;;;OAKG;IACH,IAAI,CAAC,KAAa;QACjB,MAAM,UAAU,GAAG,IAAI,CAAC,KAAK,CAAC,KAAK,CAAC,CAAA;QAEpC,IAAI,CAAC,MAAM,CAAC,QAAQ,CAAC,UAAU,CAAC,IAAI,UAAU,GAAG,CAAC,EAAE,CAAC;YACpD,MAAM,IAAI,UAAU,CAAC,QAAQ,KAAK,+CAA+C,CAAC,CAAA;QACnF,CAAC;QAED,OAAO,IAAI,CAAC,OAAO,CAAI,EAAE,IAAI,EAAE,OAAO,EAAE,KAAK,EAAE,UAAU,EAAE,CAAC,CAAA;IAC7D,CAAC;IAED;;OAEG;IACH,IAAI,CAAC,KAAa;QACjB,MAAM,UAAU,GAAG,IAAI,CAAC,KAAK,CAAC,KAAK,CAAC,CAAA;QAEpC,IAAI,CAAC,MAAM,CAAC,QAAQ,CAAC,UAAU,CAAC,IAAI,UAAU,GAAG,CAAC,EAAE,CAAC;YACpD,MAAM,IAAI,UAAU,CAAC,QAAQ,KAAK,+CAA+C,CAAC,CAAA;QACnF,CAAC;QAED,OAAO,IAAI,CAAC,OAAO,CAAI,EAAE,IAAI,EAAE,OAAO,EAAE,KAAK,EAAE,UAAU,EAAE,CAAC,CAAA;IAC7D,CAAC;IAED;;;;;;OAMG;IACH,OAAO,CACN,EAA+G;QAE/G,OAAO,IAAI,aAAa,CAAI,aAAa,CAAC,IAAI,EAAE,EAAE,CAAC,CAAC,CAAA;IACrD,CAAC;IAED,YAAY;IAEZ,yCAAyC;IAEzC;;;;;OAKG;IACH,KAAK,CAAC,OAAO;QACZ,MAAM,MAAM,GAAQ,EAAE,CAAA;QAEtB,IAAI,KAAK,EAAE,MAAM,KAAK,IAAI,IAAI,EAAE,CAAC;YAChC,MAAM,CAAC,IAAI,CAAC,KAAK,CAAC,CAAA;QACnB,CAAC;QAED,OAAO,MAAM,CAAA;IACd,CAAC;IAED;;OAEG;IACH,KAAK,CAAC,OAAO,CAAC,EAA0C;QACvD,IAAI,OAAO,GAAG,CAAC,CAAA;QAEf,IAAI,KAAK,EAAE,MAAM,KAAK,IAAI,IAAI,EAAE,CAAC;YAChC,MAAM,MAAM,GAAG,EAAE,CAAC,KAAK,EAAE,OAAO,EAAE,CAAC,CAAA;YAEnC,IAAI,UAAU,CAAC,MAAM,CAAC,EAAE,CAAC;gBACxB,MAAM,MAAM,CAAA;YACb,CAAC;QACF,CAAC;IACF,CAAC;IAQD,KAAK,CAAC,MAAM,CACX,EAAqE,EACrE,GAAG,IAAwB;QAE3B,IAAI,WAAW,GAAG,IAAI,CAAC,CAAC,CAAM,CAAA;QAC9B,IAAI,MAAM,GAAG,IAAI,CAAC,MAAM,GAAG,CAAC,CAAA;QAC5B,IAAI,OAAO,GAAG,CAAC,CAAA;QAEf,IAAI,KAAK,EAAE,MAAM,KAAK,IAAI,IAAI,EAAE,CAAC;YAChC,IAAI,CAAC,MAAM,EAAE,CAAC;gBACb,WAAW,GAAG,KAAqB,CAAA;gBACnC,MAAM,GAAG,IAAI,CAAA;gBAEb,OAAO,EAAE,CAAA;gBAET,SAAQ;YACT,CAAC;YAED,MAAM,IAAI,GAAG,EAAE,CAAC,WAAW,EAAE,KAAK,EAAE,OAAO,EAAE,CAAC,CAAA;YAE9C,WAAW,GAAG,UAAU,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,MAAM,IAAI,CAAC,CAAC,CAAC,IAAI,CAAA;QACnD,CAAC;QAED,IAAI,CAAC,MAAM;YAAE,MAAM,IAAI,SAAS,CAAC,gDAAgD,CAAC,CAAA;QAElF,OAAO,WAAW,CAAA;IACnB,CAAC;IAED;;OAEG;IACH,KAAK,CAAC,IAAI,CAAC,EAA0C;QACpD,IAAI,OAAO,GAAG,CAAC,CAAA;QAEf,IAAI,KAAK,EAAE,MAAM,KAAK,IAAI,IAAI,EAAE,CAAC;YAChC,MAAM,MAAM,GAAG,EAAE,CAAC,KAAK,EAAE,OAAO,EAAE,CAAC,CAAA;YAEnC,IAAI,UAAU,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC,MAAM,MAAM,CAAC,CAAC,CAAC,MAAM;gBAAE,OAAO,IAAI,CAAA;QAC5D,CAAC;QAED,OAAO,KAAK,CAAA;IACb,CAAC;IAED;;OAEG;IACH,KAAK,CAAC,KAAK,CAAC,EAA0C;QACrD,IAAI,OAAO,GAAG,CAAC,CAAA;QAEf,IAAI,KAAK,EAAE,MAAM,KAAK,IAAI,IAAI,EAAE,CAAC;YAChC,MAAM,MAAM,GAAG,EAAE,CAAC,KAAK,EAAE,OAAO,EAAE,CAAC,CAAA;YAEnC,IAAI,CAAC,CAAC,UAAU,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC,MAAM,MAAM,CAAC,CAAC,CAAC,MAAM,CAAC;gBAAE,OAAO,KAAK,CAAA;QAChE,CAAC;QAED,OAAO,IAAI,CAAA;IACZ,CAAC;IAED;;OAEG;IACH,KAAK,CAAC,IAAI,CAAC,EAA0C;QACpD,IAAI,OAAO,GAAG,CAAC,CAAA;QAEf,IAAI,KAAK,EAAE,MAAM,KAAK,IAAI,IAAI,EAAE,CAAC;YAChC,MAAM,MAAM,GAAG,EAAE,CAAC,KAAK,EAAE,OAAO,EAAE,CAAC,CAAA;YAEnC,IAAI,UAAU,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC,MAAM,MAAM,CAAC,CAAC,CAAC,MAAM;gBAAE,OAAO,KAAK,CAAA;QAC7D,CAAC;QAED,OAAO,SAAS,CAAA;IACjB,CAAC;IAED,YAAY;IAEZ,gDAAgD;IAEhD;;;;;;;OAOG;IACH,MAAM,CAAC,IAAY;QAClB,MAAM,UAAU,GAAG,IAAI,CAAC,KAAK,CAAC,IAAI,CAAC,CAAA;QAEnC,IAAI,CAAC,MAAM,CAAC,QAAQ,CAAC,UAAU,CAAC,IAAI,UAAU,GAAG,CAAC,EAAE,CAAC;YACpD,MAAM,IAAI,UAAU,CAAC,UAAU,IAAI,0CAA0C,CAAC,CAAA;QAC/E,CAAC;QAED,OAAO,IAAI,aAAa,CAAM,WAAW,CAAC,IAAI,EAAE,UAAU,CAAC,CAAC,CAAA;IAC7D,CAAC;IAED;;;;;;;;;OASG;IACH,WAAW,CACV,EAAqD,EACrD,EAAE,WAAW,EAAE,MAAM,EAA8B;QAEnD,OAAO,IAAI,aAAa,CAAI,qBAAqB,CAAC,IAAI,EAAE,EAAE,EAAE,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,IAAI,CAAC,KAAK,CAAC,WAAW,CAAC,CAAC,EAAE,MAAM,CAAC,CAAC,CAAA;IAC3G,CAAC;IAED;;OAEG;IACH,gBAAgB;QACf,MAAM,QAAQ,GAAG,IAAI,CAAC,MAAM,CAAC,aAAa,CAAC,EAAE,CAAA;QAE7C,OAAO,IAAI,cAAc,CAAI;YAC5B,IAAI,EAAE,KAAK,EAAE,UAAU,EAAE,EAAE;gBAC1B,MAAM,EAAE,IAAI,EAAE,KAAK,EAAE,GAAG,MAAM,QAAQ,CAAC,IAAI,EAAE,CAAA;gBAE7C,IAAI,IAAI,EAAE,CAAC;oBACV,UAAU,CAAC,KAAK,EAAE,CAAA;gBACnB,CAAC;qBAAM,CAAC;oBACP,UAAU,CAAC,OAAO,CAAC,KAAK,CAAC,CAAA;gBAC1B,CAAC;YACF,CAAC;YACD,MAAM,EAAE,KAAK,IAAI,EAAE,CAAC,KAAK,CAAC,MAAM,QAAQ,CAAC,MAAM,EAAE,EAAE,CAAC;SACpD,CAAC,CAAA;IACH,CAAC;IAED;;OAEG;IACH,WAAW,CAAI,SAAqC,EAAE,OAA2B;QAChF,OAAO,IAAI,CAAC,gBAAgB,EAAE,CAAC,WAAW,CAAC,SAAS,EAAE,OAAO,CAAC,CAAA;IAC/D,CAAC;IAED,YAAY;IAEZ,mBAAmB;IAEnB,KAAK,CAAC,IAAI;QACT,IAAI,IAAI,CAAC,KAAK;YAAE,OAAO,EAAE,KAAK,EAAE,SAAS,EAAE,IAAI,EAAE,IAAI,EAAE,CAAA;QAEvD,MAAM,GAAG,GAAG,IAAI,CAAC,IAAI,CAAA;QACrB,MAAM,MAAM,GAAG,GAAG,CAAC,MAAM,CAAA;QAEzB,IAAI,CAAC,SAAS,KAAK,KAAK,CAAC,IAAI,CAAS,EAAE,MAAM,EAAE,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAA;QAEzD,IAAI,CAAC,QAAQ,KAAK,GAAG,CAAC,GAAG,CAAC,CAAC,EAAE,EAAE,EAAE,CAAC,CAAC,EAAE,CAAC,IAAI,KAAK,OAAO,IAAI,EAAE,CAAC,IAAI,KAAK,OAAO,CAAC,CAAC,CAAC,EAAE,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAA;QAE9F,MAAM,QAAQ,GAAG,IAAI,CAAC,SAAS,CAAA;QAC/B,MAAM,OAAO,GAAG,IAAI,CAAC,QAAQ,CAAA;QAE7B,kHAAkH;QAClH,oCAAoC;QACpC,KAAK,MAAM,KAAK,IAAI,IAAI,CAAC,YAAY,EAAE,CAAC;YACvC,IAAI,OAAO,CAAC,KAAK,CAAE,IAAI,CAAC;gBAAE,OAAO,IAAI,CAAC,OAAO,EAAE,CAAA;QAChD,CAAC;QAED,MAAM,QAAQ,GAAG,MAAM,IAAI,CAAC,aAAa,EAAE,CAAA;QAC3C,MAAM,MAAM,GAAG,QAAQ,KAAK,IAAI,CAAC,aAAa,CAAA;QAE9C,IAAI,CAAC;YACJ,KAAK,EAAE,SAAS,CAAC;gBAChB,MAAM,MAAM,GAAG,QAAQ,CAAC,IAAI,EAAE,CAAA;gBAC9B,MAAM,MAAM,GAAG,MAAM,CAAC,CAAC,CAAE,MAAkC,CAAC,CAAC,CAAC,MAAM,MAAM,CAAA;gBAE1E,IAAI,MAAM,CAAC,IAAI,EAAE,CAAC;oBACjB,IAAI,CAAC,KAAK,GAAG,IAAI,CAAA;oBAEjB,OAAO,EAAE,KAAK,EAAE,SAAS,EAAE,IAAI,EAAE,IAAI,EAAE,CAAA;gBACxC,CAAC;gBAED,IAAI,KAAK,GAAY,MAAM,CAAC,KAAK,CAAA;gBAEjC,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;oBACjC,MAAM,EAAE,GAAG,GAAG,CAAC,CAAC,CAAE,CAAA;oBAElB,QAAQ,EAAE,CAAC,IAAI,EAAE,CAAC;wBACjB,KAAK,MAAM,EAAE,CAAC;4BACb,MAAM,MAAM,GAAG,EAAE,CAAC,EAAE,CAAC,KAAK,EAAE,QAAQ,CAAC,CAAC,CAAE,EAAE,CAAC,CAAA;4BAE3C,KAAK,GAAG,UAAU,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC,MAAM,MAAM,CAAC,CAAC,CAAC,MAAM,CAAA;4BAElD,MAAK;wBACN,CAAC;wBAED,KAAK,SAAS,EAAE,CAAC;4BAChB,MAAM,IAAI,GAAG,EAAE,CAAC,EAAE,CAAC,KAAK,EAAE,QAAQ,CAAC,CAAC,CAAE,EAAE,CAAC,CAAA;4BAEzC,IAAI,CAAC,CAAC,UAAU,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,MAAM,IAAI,CAAC,CAAC,CAAC,IAAI,CAAC;gCAAE,SAAS,KAAK,CAAA;4BAE3D,MAAK;wBACN,CAAC;wBAED,KAAK,OAAO,EAAE,CAAC;4BACd,IAAI,OAAO,CAAC,CAAC,CAAE,GAAG,CAAC,EAAE,CAAC;gCACrB,OAAO,CAAC,CAAC,CAAE,EAAE,CAAA;gCAEb,SAAS,KAAK,CAAA;4BACf,CAAC;4BAED,MAAK;wBACN,CAAC;wBAED,KAAK,OAAO,EAAE,CAAC;4BACd,IAAI,OAAO,CAAC,CAAC,CAAE,IAAI,CAAC;gCAAE,OAAO,IAAI,CAAC,OAAO,EAAE,CAAA;4BAE3C,OAAO,CAAC,CAAC,CAAE,EAAE,CAAA;4BAEb,MAAK;wBACN,CAAC;oBACF,CAAC;gBACF,CAAC;gBAED,OAAO,EAAE,KAAK,EAAE,KAAU,EAAE,IAAI,EAAE,KAAK,EAAE,CAAA;YAC1C,CAAC;QACF,CAAC;QAAC,OAAO,KAAK,EAAE,CAAC;YAChB,yGAAyG;YACzG,mEAAmE;YACnE,MAAM,IAAI,CAAC,OAAO,EAAE,CAAA;YAEpB,MAAM,KAAK,CAAA;QACZ,CAAC;IACF,CAAC;IAED;;OAEG;IACH,KAAK,CAAC,MAAM;QACX,OAAO,IAAI,CAAC,OAAO,EAAE,CAAA;IACtB,CAAC;IAED,KAAK,CAAC,OAAO;QACZ,IAAI,IAAI,CAAC,KAAK;YAAE,OAAO,EAAE,KAAK,EAAE,SAAS,EAAE,IAAI,EAAE,IAAI,EAAE,CAAA;QAEvD,IAAI,CAAC,KAAK,GAAG,IAAI,CAAA;QAEjB,+GAA+G;QAC/G,gHAAgH;QAChH,wCAAwC;QACxC,MAAM,MAAM,GAAG,IAAI,CAAC,OAAO,CAAA;QAE3B,MAAM,QAAQ,GACb,IAAI,CAAC,SAAS,IAAI,IAAI,CAAC,aAAa,IAAI,CAAC,OAAO,MAAM,KAAK,UAAU,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,eAAe,CAAC,MAAM,CAAC,CAAC,CAAA;QAExG,IAAI,CAAC,SAAS,GAAG,IAAI,CAAA;QACrB,IAAI,CAAC,aAAa,GAAG,IAAI,CAAA;QAEzB,MAAM,QAAQ,EAAE,MAAM,EAAE,EAAE,CAAA;QAE1B,OAAO,EAAE,KAAK,EAAE,SAAS,EAAE,IAAI,EAAE,IAAI,EAAE,CAAA;IACxC,CAAC;IAED,CAAC,MAAM,CAAC,aAAa,CAAC;QACrB,OAAO,IAAI,CAAA;IACZ,CAAC;CAGD"}

package/out/lib/CSVSpliterator.d.ts

@@ -3,8 +3,9 @@
  * @license MIT
  * @author Teffen Ellis, et al.
  */
+import { AsyncSequence } from "./AsyncSequence.js";
 import { type CharacterSequenceInput } from "./CharacterSequence.js";
-import { type AsyncChunkIterator, type AsyncDataResource } from "./shared.js";
+import type { AsyncChunkIterator, AsyncDataResource } from "./shared.js";
 import { type AsyncSpliteratorInit, type SpliteratorInit } from "./Spliterator.js";
 /**
  * An output mode for the CSV generator.
@@ -113,19 +114,19 @@ export declare abstract class CSVSpliterator {
      */
     static fromAsync<T extends CSVSpliteratorEmittedRecord = CSVSpliteratorEmittedRecord>(source: AsyncDataResource | AsyncChunkIterator, options?: CSVSpliteratorInit & AsyncSpliteratorInit & {
         mode: "object";
-    }): AsyncGenerator<T>;
+    }): AsyncSequence<T>;
     /**
      * @yields Each row as a 3-tuple [key, value, idx].
      */
     static fromAsync<T extends RowTuple[] = RowTuple[]>(source: AsyncDataResource | AsyncChunkIterator, options?: CSVSpliteratorInit & AsyncSpliteratorInit & {
         mode: "entries";
-    }): AsyncGenerator<T>;
+    }): AsyncSequence<T>;
     /**
      * @yields Each row as an array of columns.
      */
     static fromAsync<T extends string[] = string[]>(source: AsyncDataResource | AsyncChunkIterator, options?: CSVSpliteratorInit & AsyncSpliteratorInit & {
         mode?: "array";
-    }): AsyncGenerator<T>;
+    }): AsyncSequence<T>;
     /**
      * Given an asychronous data source, splits the data by rows(usually by newline) and then by columns (usually by
      * comma).
@@ -135,6 +136,6 @@ export declare abstract class CSVSpliterator {
      *
      * @yields Each row, shaped according to the `mode` option.
      */
-    static fromAsync(source: AsyncDataResource | AsyncChunkIterator, init?: CSVSpliteratorInit & AsyncSpliteratorInit): AsyncGenerator<unknown>;
+    static fromAsync(source: AsyncDataResource | AsyncChunkIterator, init?: CSVSpliteratorInit & AsyncSpliteratorInit): AsyncSequence<unknown>;
 }
 //# sourceMappingURL=CSVSpliterator.d.ts.map

package/out/lib/CSVSpliterator.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"CSVSpliterator.d.ts","sourceRoot":"","sources":["../../lib/CSVSpliterator.ts"],"names":[],"mappings":"AAAA;;;;GAIG;AAGH,OAAO,EAAqB,KAAK,sBAAsB,EAAc,MAAM,wBAAwB,CAAA;AACnG,OAAO,EAAE,KAAK,kBAAkB,EAAE,KAAK,iBAAiB,EAAW,MAAM,aAAa,CAAA;AACtF,OAAO,EAAE,KAAK,oBAAoB,EAAe,KAAK,eAAe,EAAE,MAAM,kBAAkB,CAAA;AAE/F;;GAEG;AACH,MAAM,MAAM,aAAa,GAAG,OAAO,GAAG,QAAQ,GAAG,SAAS,CAAA;AAE1D,MAAM,MAAM,cAAc,CAAC,CAAC,GAAG,OAAO,IAAI,CAAC,KAAK,EAAE,MAAM,KAAK,CAAC,CAAA;AAE9D,MAAM,MAAM,mBAAmB,CAAC,CAAC,GAAG,OAAO,IAAI,CAAC,UAAU,EAAE,MAAM,EAAE,WAAW,EAAE,cAAc,CAAC,CAAC,CAAC,CAAC,CAAA;AAEnG,MAAM,MAAM,oBAAoB,GAAG,MAAM,CAAC,MAAM,EAAE,cAAc,GAAG,SAAS,CAAC,CAAA;AAE7E,MAAM,MAAM,UAAU,CAAC,CAAC,GAAG,OAAO,IAAI,CAAC,OAAO,EAAE,QAAQ,CAAC,MAAM,CAAC,EAAE,aAAa,CAAC,EAAE,QAAQ,CAAC,mBAAmB,CAAC,KAAK,CAAC,CAAA;AA2DrH,MAAM,MAAM,2BAA2B,CAAC,CAAC,GAAG,MAAM,GAAG,MAAM,GAAG,SAAS,IAAI,MAAM,CAAC,MAAM,EAAE,CAAC,CAAC,CAAA;AAE5F;;;;;;GAMG;AACH,MAAM,MAAM,QAAQ,CAAC,CAAC,GAAG,MAAM,GAAG,MAAM,IAAI,CAAC,GAAG,EAAE,MAAM,EAAE,KAAK,EAAE,CAAC,EAAE,GAAG,EAAE,MAAM,CAAC,CAAA;AAEhF,eAAO,MAAM,sBAAsB;;gCAGjB,QAAQ,CAAC,MAAM,CAAC,kBAAiB,QAAQ,CAAC,mBAAmB,CAAC,KAAQ,QAAQ,CAAC,OAAO,CAAC,EAAE;+BAShG,QAAQ,CAAC,MAAM,CAAC,kBACV,QAAQ,CAAC,mBAAmB,CAAC,KAC1C,2BAA2B,CAAC,OAAO,CAAC;CAYqB,CAAA;AAE7D,MAAM,WAAW,kBAAmB,SAAQ,eAAe;IAC1D;;;;;;;;;;;;;;;;OAgBG;IACH,IAAI,CAAC,EAAE,aAAa,CAAA;IAEpB;;;;OAIG;IACH,eAAe,CAAC,EAAE,sBAAsB,CAAA;IAExC;;;;;;;;;OASG;IACH,aAAa,CAAC,EAAE,OAAO,CAAA;IAEvB;;;;OAIG;IACH,MAAM,CAAC,EAAE,OAAO,CAAA;IAEhB,YAAY,CAAC,EAAE,QAAQ,CAAC,mBAAmB,CAAC,GAAG,oBAAoB,CAAA;CACnE;AAED;;;;;;;;;;GAUG;AACH,8BAAsB,cAAc;IACnC;;;;OAIG;IACH,OAAc,eAAe,EAAE,MAAM,CAAmB;IAExD,cAEC;IAED,MAAM,CAAC,IAAI,CAAC,CAAC,SAAS,2BAA2B,GAAG,2BAA2B,EAC9E,MAAM,EAAE,sBAAsB,EAC9B,OAAO,CAAC,EAAE,kBAAkB,GAAG;QAAE,IAAI,EAAE,QAAQ,CAAA;KAAE,GAC/C,SAAS,CAAC,CAAC,CAAC,CAAA;IACf;;OAEG;IAEH,MAAM,CAAC,IAAI,CAAC,CAAC,SAAS,QAAQ,EAAE,GAAG,QAAQ,EAAE,EAC5C,MAAM,EAAE,sBAAsB,EAC9B,OAAO,CAAC,EAAE,kBAAkB,GAAG;QAAE,IAAI,EAAE,SAAS,CAAA;KAAE,GAChD,SAAS,CAAC,CAAC,CAAC,CAAA;IACf;;;;OAIG;IACH,MAAM,CAAC,IAAI,CAAC,CAAC,SAAS,MAAM,EAAE,GAAG,MAAM,EAAE,EACxC,MAAM,EAAE,sBAAsB,EAC9B,OAAO,CAAC,EAAE,kBAAkB,GAAG;QAAE,IAAI,CAAC,EAAE,OAAO,CAAA;KAAE,GAC/C,SAAS,CAAC,CAAC,CAAC,CAAA;IA8Ef;;OAEG;IACH,MAAM,CAAC,SAAS,CAAC,CAAC,SAAS,2BAA2B,GAAG,2BAA2B,EACnF,MAAM,EAAE,iBAAiB,GAAG,kBAAkB,EAC9C,OAAO,CAAC,EAAE,kBAAkB,GAAG,oBAAoB,GAAG;QAAE,IAAI,EAAE,QAAQ,CAAA;KAAE,GACtE,cAAc,CAAC,CAAC,CAAC,CAAA;IAEpB;;OAEG;IACH,MAAM,CAAC,SAAS,CAAC,CAAC,SAAS,QAAQ,EAAE,GAAG,QAAQ,EAAE,EACjD,MAAM,EAAE,iBAAiB,GAAG,kBAAkB,EAC9C,OAAO,CAAC,EAAE,kBAAkB,GAAG,oBAAoB,GAAG;QAAE,IAAI,EAAE,SAAS,CAAA;KAAE,GACvE,cAAc,CAAC,CAAC,CAAC,CAAA;IACpB;;OAEG;IACH,MAAM,CAAC,SAAS,CAAC,CAAC,SAAS,MAAM,EAAE,GAAG,MAAM,EAAE,EAC7C,MAAM,EAAE,iBAAiB,GAAG,kBAAkB,EAC9C,OAAO,CAAC,EAAE,kBAAkB,GAAG,oBAAoB,GAAG;QAAE,IAAI,CAAC,EAAE,OAAO,CAAA;KAAE,GACtE,cAAc,CAAC,CAAC,CAAC,CAAA;IACpB;;;;;;;;OAQG;IACH,MAAM,CAAC,SAAS,CACf,MAAM,EAAE,iBAAiB,GAAG,kBAAkB,EAC9C,IAAI,CAAC,EAAE,kBAAkB,GAAG,oBAAoB,GAC9C,cAAc,CAAC,OAAO,CAAC,CAAA;CAkF1B"}
+{"version":3,"file":"CSVSpliterator.d.ts","sourceRoot":"","sources":["../../lib/CSVSpliterator.ts"],"names":[],"mappings":"AAAA;;;;GAIG;AAGH,OAAO,EAAE,aAAa,EAAE,MAAM,oBAAoB,CAAA;AAElD,OAAO,EAAqB,KAAK,sBAAsB,EAAc,MAAM,wBAAwB,CAAA;AACnG,OAAO,KAAK,EAAE,kBAAkB,EAAE,iBAAiB,EAAE,MAAM,aAAa,CAAA;AACxE,OAAO,EAAE,KAAK,oBAAoB,EAAe,KAAK,eAAe,EAAE,MAAM,kBAAkB,CAAA;AAG/F;;GAEG;AACH,MAAM,MAAM,aAAa,GAAG,OAAO,GAAG,QAAQ,GAAG,SAAS,CAAA;AAE1D,MAAM,MAAM,cAAc,CAAC,CAAC,GAAG,OAAO,IAAI,CAAC,KAAK,EAAE,MAAM,KAAK,CAAC,CAAA;AAE9D,MAAM,MAAM,mBAAmB,CAAC,CAAC,GAAG,OAAO,IAAI,CAAC,UAAU,EAAE,MAAM,EAAE,WAAW,EAAE,cAAc,CAAC,CAAC,CAAC,CAAC,CAAA;AAEnG,MAAM,MAAM,oBAAoB,GAAG,MAAM,CAAC,MAAM,EAAE,cAAc,GAAG,SAAS,CAAC,CAAA;AAE7E,MAAM,MAAM,UAAU,CAAC,CAAC,GAAG,OAAO,IAAI,CAAC,OAAO,EAAE,QAAQ,CAAC,MAAM,CAAC,EAAE,aAAa,CAAC,EAAE,QAAQ,CAAC,mBAAmB,CAAC,KAAK,CAAC,CAAA;AA2DrH,MAAM,MAAM,2BAA2B,CAAC,CAAC,GAAG,MAAM,GAAG,MAAM,GAAG,SAAS,IAAI,MAAM,CAAC,MAAM,EAAE,CAAC,CAAC,CAAA;AAE5F;;;;;;GAMG;AACH,MAAM,MAAM,QAAQ,CAAC,CAAC,GAAG,MAAM,GAAG,MAAM,IAAI,CAAC,GAAG,EAAE,MAAM,EAAE,KAAK,EAAE,CAAC,EAAE,GAAG,EAAE,MAAM,CAAC,CAAA;AAEhF,eAAO,MAAM,sBAAsB;;gCAGjB,QAAQ,CAAC,MAAM,CAAC,kBAAiB,QAAQ,CAAC,mBAAmB,CAAC,KAAQ,QAAQ,CAAC,OAAO,CAAC,EAAE;+BAShG,QAAQ,CAAC,MAAM,CAAC,kBACV,QAAQ,CAAC,mBAAmB,CAAC,KAC1C,2BAA2B,CAAC,OAAO,CAAC;CAYqB,CAAA;AAE7D,MAAM,WAAW,kBAAmB,SAAQ,eAAe;IAC1D;;;;;;;;;;;;;;;;OAgBG;IACH,IAAI,CAAC,EAAE,aAAa,CAAA;IAEpB;;;;OAIG;IACH,eAAe,CAAC,EAAE,sBAAsB,CAAA;IAExC;;;;;;;;;OASG;IACH,aAAa,CAAC,EAAE,OAAO,CAAA;IAEvB;;;;OAIG;IACH,MAAM,CAAC,EAAE,OAAO,CAAA;IAEhB,YAAY,CAAC,EAAE,QAAQ,CAAC,mBAAmB,CAAC,GAAG,oBAAoB,CAAA;CACnE;AAED;;;;;;;;;;GAUG;AACH,8BAAsB,cAAc;IACnC;;;;OAIG;IACH,OAAc,eAAe,EAAE,MAAM,CAAmB;IAExD,cAEC;IAED,MAAM,CAAC,IAAI,CAAC,CAAC,SAAS,2BAA2B,GAAG,2BAA2B,EAC9E,MAAM,EAAE,sBAAsB,EAC9B,OAAO,CAAC,EAAE,kBAAkB,GAAG;QAAE,IAAI,EAAE,QAAQ,CAAA;KAAE,GAC/C,SAAS,CAAC,CAAC,CAAC,CAAA;IACf;;OAEG;IAEH,MAAM,CAAC,IAAI,CAAC,CAAC,SAAS,QAAQ,EAAE,GAAG,QAAQ,EAAE,EAC5C,MAAM,EAAE,sBAAsB,EAC9B,OAAO,CAAC,EAAE,kBAAkB,GAAG;QAAE,IAAI,EAAE,SAAS,CAAA;KAAE,GAChD,SAAS,CAAC,CAAC,CAAC,CAAA;IACf;;;;OAIG;IACH,MAAM,CAAC,IAAI,CAAC,CAAC,SAAS,MAAM,EAAE,GAAG,MAAM,EAAE,EACxC,MAAM,EAAE,sBAAsB,EAC9B,OAAO,CAAC,EAAE,kBAAkB,GAAG;QAAE,IAAI,CAAC,EAAE,OAAO,CAAA;KAAE,GAC/C,SAAS,CAAC,CAAC,CAAC,CAAA;IA8Ef;;OAEG;IACH,MAAM,CAAC,SAAS,CAAC,CAAC,SAAS,2BAA2B,GAAG,2BAA2B,EACnF,MAAM,EAAE,iBAAiB,GAAG,kBAAkB,EAC9C,OAAO,CAAC,EAAE,kBAAkB,GAAG,oBAAoB,GAAG;QAAE,IAAI,EAAE,QAAQ,CAAA;KAAE,GACtE,aAAa,CAAC,CAAC,CAAC,CAAA;IAEnB;;OAEG;IACH,MAAM,CAAC,SAAS,CAAC,CAAC,SAAS,QAAQ,EAAE,GAAG,QAAQ,EAAE,EACjD,MAAM,EAAE,iBAAiB,GAAG,kBAAkB,EAC9C,OAAO,CAAC,EAAE,kBAAkB,GAAG,oBAAoB,GAAG;QAAE,IAAI,EAAE,SAAS,CAAA;KAAE,GACvE,aAAa,CAAC,CAAC,CAAC,CAAA;IACnB;;OAEG;IACH,MAAM,CAAC,SAAS,CAAC,CAAC,SAAS,MAAM,EAAE,GAAG,MAAM,EAAE,EAC7C,MAAM,EAAE,iBAAiB,GAAG,kBAAkB,EAC9C,OAAO,CAAC,EAAE,kBAAkB,GAAG,oBAAoB,GAAG;QAAE,IAAI,CAAC,EAAE,OAAO,CAAA;KAAE,GACtE,aAAa,CAAC,CAAC,CAAC,CAAA;IACnB;;;;;;;;OAQG;IACH,MAAM,CAAC,SAAS,CACf,MAAM,EAAE,iBAAiB,GAAG,kBAAkB,EAC9C,IAAI,CAAC,EAAE,kBAAkB,GAAG,oBAAoB,GAC9C,aAAa,CAAC,OAAO,CAAC,CAAA;CA0FzB"}

package/out/lib/CSVSpliterator.js

@@ -3,10 +3,12 @@
  * @license MIT
  * @author Teffen Ellis, et al.
  */
+import { openDelimitedRows } from "./adaptive-source.js";
+import { AsyncSequence } from "./AsyncSequence.js";
 import { normalizeColumnNames } from "./casing.js";
 import { CharacterSequence, Delimiters } from "./CharacterSequence.js";
-import { zipSync } from "./shared.js";
 import { Spliterator } from "./Spliterator.js";
+import { zipSync } from "./zip.js";
 const identity = (value) => value;
 const doubleQuoteSequence = new CharacterSequence('"');
 /**
@@ -154,7 +156,8 @@ export class CSVSpliterator {
      *
      * @yields Each row, shaped according to the `mode` option.
      */
-    static async *fromAsync(source, init = {}) {
+    static fromAsync(source, init = {}) {
+        const defaultColumnDelimiter = this.ColumnDelimiter;
         const { 
         // ---
         header = true, mode = "array", transformers: transformersInput = [], normalizeKeys = mode !== "array", columnDelimiter: columnDelimiterInput, enableQuoteHandling = false, 
@@ -162,45 +165,51 @@ export class CSVSpliterator {
         // never carries a stray `\r` on Windows-lineage sources.
         crlf = true, take = Infinity, drop = 0, ...rowInit } = init;
         const emitter = CSVSpliteratorEmitters[mode];
-        let transformers = [];
-        let yieldCount = 0;
-        const yieldLimit = take + drop;
-        const columnDelimiter = new CharacterSequence(columnDelimiterInput ?? this.ColumnDelimiter);
+        const columnDelimiter = new CharacterSequence(columnDelimiterInput ?? defaultColumnDelimiter);
         const decoder = new TextDecoder();
-        // Quote handling applies at both levels: rows must not split on newlines inside quotes,
-        // columns must not split on quoted column delimiters.
-        const rows = await Spliterator.from(source, { ...rowInit, crlf, enableQuoteHandling });
-        if (header) {
-            const result = await rows.next();
-            if (result.done)
-                return;
-            const columns = splitRowColumns(result.value, columnDelimiter, decoder, enableQuoteHandling);
-            const headers = normalizeKeys ? normalizeColumnNames(columns) : columns;
-            // oxlint-disable-next-line unicorn/prefer-ternary
-            if (Array.isArray(transformersInput)) {
-                transformers = Array.from(zipSync(headers, transformersInput), ([columnName, transformer]) => [
-                    columnName,
-                    transformer ?? identity,
-                ]);
-            }
-            else {
-                transformers = headers.map((columnName) => {
-                    const transform = transformersInput[columnName] || identity;
-                    return [columnName, transform];
-                });
-            }
-        }
-        for await (const row of rows) {
-            if (yieldCount < drop) {
-                yieldCount++;
-                continue;
+        // Populated by the header pass below before the first row op runs, since the source thunk resolves on the first
+        // pull and the ops only run against what it returns.
+        let transformers = [];
+        const openRows = async () => {
+            // Quote handling applies at both levels: rows must not split on newlines inside quotes,
+            // columns must not split on quoted column delimiters.
+            const rows = await openDelimitedRows(source, { ...rowInit, crlf, enableQuoteHandling });
+            if (header) {
+                // Both engines return `this` from their iterator method, so consuming the header row here advances the very
+                // cursor the row ops will go on to read — returning `rows` afterwards resumes at row two, not row one.
+                const iterator = Symbol.asyncIterator in rows ? rows[Symbol.asyncIterator]() : rows[Symbol.iterator]();
+                const result = await iterator.next();
+                if (result.done)
+                    return rows;
+                const columns = splitRowColumns(result.value, columnDelimiter, decoder, enableQuoteHandling);
+                const headers = normalizeKeys ? normalizeColumnNames(columns) : columns;
+                // oxlint-disable-next-line unicorn/prefer-ternary
+                if (Array.isArray(transformersInput)) {
+                    transformers = Array.from(zipSync(headers, transformersInput), ([columnName, transformer]) => [
+                        columnName,
+                        transformer ?? identity,
+                    ]);
+                }
+                else {
+                    transformers = headers.map((columnName) => {
+                        const transform = transformersInput[columnName] || identity;
+                        return [columnName, transform];
+                    });
+                }
             }
-            if (yieldCount >= yieldLimit)
-                break;
+            return rows;
+        };
+        let sequence = AsyncSequence.from(openRows).map((row) => {
             const columns = splitRowColumns(row, columnDelimiter, decoder, enableQuoteHandling);
-            yield emitter ? emitter(columns, transformers) : columns;
-            yieldCount++;
+            return emitter ? emitter(columns, transformers) : columns;
+        });
+        if (drop > 0) {
+            sequence = sequence.drop(drop);
+        }
+        if (Number.isFinite(take)) {
+            sequence = sequence.take(take);
         }
+        return sequence;
     }
 }
 //# sourceMappingURL=CSVSpliterator.js.map