spliterator 6.0.1 → 6.2.0

package/out/lib/core/CompositeDataView.d.ts

@@ -0,0 +1,111 @@
+/**
+ * @copyright Sister Software
+ * @license MIT
+ * @author Teffen Ellis, et al.
+ */
+import type { TypedArray } from "../internal/shared.js";
+/**
+ * A generic mutable typed array.
+ */
+export interface MutableTypedArray<T extends number | bigint = number | bigint> {
+    readonly length: number;
+    readonly [n: number]: T;
+    set(array: ArrayLike<T>, offset?: number): void;
+}
+/**
+ * A constructor for a mutable typed array.
+ */
+export type MutableTypedArrayConstructor<T extends number | bigint = number | bigint> = new (length: number) => MutableTypedArray<T>;
+/**
+ * Locally-defined mirror of the TC39 `RelativeIndexable` interface, which is no longer surfaced by the `ESNext` lib
+ * used here.
+ */
+interface RelativeIndexable<T> {
+    at(index: number): T | undefined;
+}
+/**
+ * Given several contiguous byte arrays, wraps them as if they were flattened into a single buffer.
+ */
+export declare class CompositeDataView<Chunk extends TypedArray = TypedArray> implements Iterable<Chunk[0]>, RelativeIndexable<Chunk[0]> {
+    #private;
+    constructor(chunks?: Chunk[]);
+    /**
+     * The combined length of all chunks.
+     *
+     * @see {@linkcode size} for the number of chunks in the composite buffer.
+     */
+    get byteLength(): number;
+    /**
+     * The number of chunks in the composite buffer.
+     *
+     * @see {@linkcode byteLength} for the total length of the composite buffer.
+     */
+    get size(): number;
+    get chunks(): readonly Chunk[];
+    /**
+     * The underlying buffer of the composite buffer.
+     *
+     * Note that this is not memoized and will create a new buffer each time it is accessed.
+     */
+    get buffer(): Chunk;
+    get [Symbol.toStringTag](): string;
+    [Symbol.iterator](): Iterator<Chunk[0]>;
+    /**
+     * Returns the value at the given index, as if the chunks were flattened into a single buffer.
+     */
+    at(index: number): Chunk[0];
+    /**
+     * Push a chunk onto the composite buffer.
+     */
+    append(chunk: Chunk): number;
+    /**
+     * Prepend a chunk before the first chunk in the composite buffer.
+     *
+     * @returns The new length of the composite buffer.
+     */
+    prepend(chunk: Chunk): number;
+    /**
+     * Remove the most recent chunk from the composite buffer.
+     */
+    removeLast(): Chunk | undefined;
+    /**
+     * Remove the first chunk from the composite buffer.
+     */
+    removeFirst(): Chunk | undefined;
+    /**
+     * Returns a view into the underlying chunks without copying data.
+     */
+    subarray(
+    /**
+     * Element to begin at. The offset is inclusive.
+     */
+    begin?: number, 
+    /**
+     * Element to end at. The offset is exclusive. If not provided, the view extends to the end of the buffer.
+     */
+    end?: number): Chunk;
+    /**
+     * Flattens the composite buffer into a single buffer.
+     */
+    flat(): Chunk;
+    /**
+     * Returns a shallow copy of the composite buffer.
+     *
+     * @see {@linkcode subarray} for a view into the underlying chunks.
+     */
+    slice(
+    /**
+     * Zero-based index at which to begin extraction.
+     *
+     * If this value is negative, it is treated as `byteLength + begin`.
+     */
+    start?: number, 
+    /**
+     * Zero-based index before which to end extraction.
+     *
+     * If this value is negative, it is treated as `byteLength + end`.
+     */
+    end?: number): Chunk;
+}
+export {};
+//# sourceMappingURL=CompositeDataView.d.ts.map

package/out/lib/core/CompositeDataView.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"CompositeDataView.d.ts","sourceRoot":"","sources":["../../../lib/core/CompositeDataView.ts"],"names":[],"mappings":"AAAA;;;;GAIG;AAEH,OAAO,KAAK,EAAE,UAAU,EAAE,MAAM,uBAAuB,CAAA;AAEvD;;GAEG;AACH,MAAM,WAAW,iBAAiB,CAAC,CAAC,SAAS,MAAM,GAAG,MAAM,GAAG,MAAM,GAAG,MAAM;IAC7E,QAAQ,CAAC,MAAM,EAAE,MAAM,CAAA;IACvB,QAAQ,EAAE,CAAC,EAAE,MAAM,GAAG,CAAC,CAAA;IACvB,GAAG,CAAC,KAAK,EAAE,SAAS,CAAC,CAAC,CAAC,EAAE,MAAM,CAAC,EAAE,MAAM,GAAG,IAAI,CAAA;CAC/C;AAED;;GAEG;AACH,MAAM,MAAM,4BAA4B,CAAC,CAAC,SAAS,MAAM,GAAG,MAAM,GAAG,MAAM,GAAG,MAAM,IAAI,KACvF,MAAM,EAAE,MAAM,KACV,iBAAiB,CAAC,CAAC,CAAC,CAAA;AAUzB;;;GAGG;AACH,UAAU,iBAAiB,CAAC,CAAC;IAC5B,EAAE,CAAC,KAAK,EAAE,MAAM,GAAG,CAAC,GAAG,SAAS,CAAA;CAChC;AAED;;GAEG;AACH,qBAAa,iBAAiB,CAAC,KAAK,SAAS,UAAU,GAAG,UAAU,CACnE,YAAW,QAAQ,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,EAAE,iBAAiB,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC;;IAsE1D,YAAY,MAAM,CAAC,EAAE,KAAK,EAAE,EAM3B;IAED;;;;OAIG;IACH,IAAW,UAAU,IAAI,MAAM,CAE9B;IAED;;;;OAIG;IACH,IAAW,IAAI,IAAI,MAAM,CAExB;IAED,IAAW,MAAM,IAAI,SAAS,KAAK,EAAE,CAEpC;IAED;;;;OAIG;IACH,IAAW,MAAM,IAAI,KAAK,CAEzB;IAED,IAAW,CAAC,MAAM,CAAC,WAAW,CAAC,IAAI,MAAM,CAExC;IAEO,CAAC,MAAM,CAAC,QAAQ,CAAC,IAAI,QAAQ,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,CAI9C;IAED;;OAEG;IACI,EAAE,CAAC,KAAK,EAAE,MAAM,GAAG,KAAK,CAAC,CAAC,CAAC,CAUjC;IAED;;OAEG;IACI,MAAM,CAAC,KAAK,EAAE,KAAK,GAAG,MAAM,CAQlC;IAED;;;;OAIG;IACI,OAAO,CAAC,KAAK,EAAE,KAAK,GAAG,MAAM,CAMnC;IAED;;OAEG;IACI,UAAU,IAAI,KAAK,GAAG,SAAS,CAUrC;IAED;;OAEG;IACI,WAAW,IAAI,KAAK,GAAG,SAAS,CAStC;IAED;;OAEG;IACI,QAAQ;IACd;;OAEG;IACH,KAAK,SAAI;IACT;;OAEG;IACH,GAAG,SAA2B,GAC5B,KAAK,CAiDP;IAED;;OAEG;IACI,IAAI,IAAI,KAAK,CAEnB;IAED;;;;OAIG;IACI,KAAK;IACX;;;;OAIG;IACH,KAAK,SAAI;IACT;;;;OAIG;IACH,GAAG,SAA2B,GAC5B,KAAK,CAUP;CACD"}

package/out/lib/core/CompositeDataView.js

@@ -0,0 +1,241 @@
+/**
+ * @copyright Sister Software
+ * @license MIT
+ * @author Teffen Ellis, et al.
+ */
+/**
+ * Given several contiguous byte arrays, wraps them as if they were flattened into a single buffer.
+ */
+export class CompositeDataView {
+    /**
+     * The chunks that make up the composite buffer.
+     */
+    #chunks = [];
+    /**
+     * Cached length of the composite buffer.
+     */
+    #memoizedByteLength = 0;
+    /**
+     * Cached chunk offset information for binary search.
+     */
+    #chunkOffsets = [];
+    /**
+     * Helper method to infer the constructor of the chunks.
+     */
+    #inferChunkConstructor() {
+        const first = this.#chunks[0];
+        if (!first) {
+            throw new TypeError("No chunks in composite buffer, cannot infer constructor");
+        }
+        return first.constructor;
+    }
+    /**
+     * Binary search to find the chunk containing the given index.
+     */
+    #findChunkForIndex(index) {
+        let left = 0;
+        let right = this.#chunkOffsets.length - 1;
+        while (left <= right) {
+            const mid = Math.floor((left + right) / 2);
+            const chunkInfo = this.#chunkOffsets[mid];
+            if (index >= chunkInfo.offset && index < chunkInfo.offset + chunkInfo.length) {
+                return { chunk: this.#chunks[mid], chunkInfo };
+            }
+            if (index < chunkInfo.offset) {
+                right = mid - 1;
+            }
+            else {
+                left = mid + 1;
+            }
+        }
+        return null;
+    }
+    /**
+     * Update chunk offset information after modification.
+     */
+    #updateChunkOffsets() {
+        let currentOffset = 0;
+        this.#chunkOffsets = this.#chunks.map((chunk) => {
+            const info = { offset: currentOffset, length: chunk.length };
+            currentOffset += chunk.length;
+            return info;
+        });
+    }
+    constructor(chunks) {
+        if (chunks) {
+            this.#chunks = chunks;
+            this.#memoizedByteLength = chunks.reduce((sum, chunk) => sum + chunk.length, 0);
+            this.#updateChunkOffsets();
+        }
+    }
+    /**
+     * The combined length of all chunks.
+     *
+     * @see {@linkcode size} for the number of chunks in the composite buffer.
+     */
+    get byteLength() {
+        return this.#memoizedByteLength;
+    }
+    /**
+     * The number of chunks in the composite buffer.
+     *
+     * @see {@linkcode byteLength} for the total length of the composite buffer.
+     */
+    get size() {
+        return this.#chunks.length;
+    }
+    get chunks() {
+        return this.#chunks;
+    }
+    /**
+     * The underlying buffer of the composite buffer.
+     *
+     * Note that this is not memoized and will create a new buffer each time it is accessed.
+     */
+    get buffer() {
+        return this.flat();
+    }
+    get [Symbol.toStringTag]() {
+        return "CompositeDataView";
+    }
+    *[Symbol.iterator]() {
+        for (const chunk of this.#chunks) {
+            yield* chunk;
+        }
+    }
+    /**
+     * Returns the value at the given index, as if the chunks were flattened into a single buffer.
+     */
+    at(index) {
+        const result = this.#findChunkForIndex(index);
+        if (!result) {
+            throw new RangeError("Index out of range");
+        }
+        const { chunk, chunkInfo } = result;
+        return chunk[index - chunkInfo.offset];
+    }
+    /**
+     * Push a chunk onto the composite buffer.
+     */
+    append(chunk) {
+        this.#chunks.push(chunk);
+        this.#memoizedByteLength += chunk.length;
+        this.#updateChunkOffsets();
+        return this.#memoizedByteLength;
+    }
+    /**
+     * Prepend a chunk before the first chunk in the composite buffer.
+     *
+     * @returns The new length of the composite buffer.
+     */
+    prepend(chunk) {
+        this.#chunks.unshift(chunk);
+        this.#memoizedByteLength += chunk.length;
+        this.#updateChunkOffsets();
+        return this.#memoizedByteLength;
+    }
+    /**
+     * Remove the most recent chunk from the composite buffer.
+     */
+    removeLast() {
+        const chunk = this.#chunks.pop();
+        if (chunk) {
+            this.#memoizedByteLength -= chunk.length;
+            this.#updateChunkOffsets();
+        }
+        return chunk;
+    }
+    /**
+     * Remove the first chunk from the composite buffer.
+     */
+    removeFirst() {
+        const chunk = this.#chunks.shift();
+        if (chunk) {
+            this.#memoizedByteLength -= chunk.length;
+            this.#updateChunkOffsets();
+        }
+        return chunk;
+    }
+    /**
+     * Returns a view into the underlying chunks without copying data.
+     */
+    subarray(
+    /**
+     * Element to begin at. The offset is inclusive.
+     */
+    begin = 0, 
+    /**
+     * Element to end at. The offset is exclusive. If not provided, the view extends to the end of the buffer.
+     */
+    end = this.#memoizedByteLength) {
+        if (begin < 0) {
+            throw new RangeError("Invalid subarray range: begin is negative");
+        }
+        if (end < 0) {
+            throw new RangeError("Invalid subarray range: end is negative");
+        }
+        // const actualEnd = end === undefined ? this.#memoizedByteLength : end
+        const startChunk = this.#findChunkForIndex(begin);
+        const endChunk = this.#findChunkForIndex(end - 1);
+        if (!startChunk || !endChunk) {
+            throw new RangeError("Invalid subarray range: Start: " + begin + ", End: " + end);
+        }
+        // If the range is within a single chunk, return a view into that chunk
+        if (startChunk.chunk === endChunk.chunk) {
+            const relativeStart = begin - startChunk.chunkInfo.offset;
+            const relativeEnd = end - startChunk.chunkInfo.offset;
+            return startChunk.chunk.subarray(relativeStart, relativeEnd);
+        }
+        // Otherwise, we need to create a new buffer and copy the data
+        const Constructor = this.#inferChunkConstructor();
+        const length = end - begin;
+        const result = new Constructor(length);
+        let writeOffset = 0;
+        let currentChunkIndex = this.#chunks.indexOf(startChunk.chunk);
+        while (currentChunkIndex < this.#chunks.length) {
+            const currentChunk = this.#chunks[currentChunkIndex];
+            const chunkInfo = this.#chunkOffsets[currentChunkIndex];
+            const readStart = currentChunk === startChunk.chunk ? begin - chunkInfo.offset : 0;
+            const readEnd = currentChunk === endChunk.chunk ? end - chunkInfo.offset : currentChunk.length;
+            result.set(currentChunk.subarray(readStart, readEnd), writeOffset);
+            writeOffset += readEnd - readStart;
+            if (currentChunk === endChunk.chunk)
+                break;
+            currentChunkIndex++;
+        }
+        return result;
+    }
+    /**
+     * Flattens the composite buffer into a single buffer.
+     */
+    flat() {
+        return this.subarray();
+    }
+    /**
+     * Returns a shallow copy of the composite buffer.
+     *
+     * @see {@linkcode subarray} for a view into the underlying chunks.
+     */
+    slice(
+    /**
+     * Zero-based index at which to begin extraction.
+     *
+     * If this value is negative, it is treated as `byteLength + begin`.
+     */
+    start = 0, 
+    /**
+     * Zero-based index before which to end extraction.
+     *
+     * If this value is negative, it is treated as `byteLength + end`.
+     */
+    end = this.#memoizedByteLength) {
+        if (start < 0) {
+            start = Math.max(0, this.#memoizedByteLength + start);
+        }
+        if (end < 0) {
+            end = Math.max(0, this.#memoizedByteLength + end);
+        }
+        return this.subarray(start, end);
+    }
+}
+//# sourceMappingURL=CompositeDataView.js.map

package/out/lib/core/CompositeDataView.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"CompositeDataView.js","sourceRoot":"","sources":["../../../lib/core/CompositeDataView.ts"],"names":[],"mappings":"AAAA;;;;GAIG;AAoCH;;GAEG;AACH,MAAM,OAAO,iBAAiB;IAG7B;;OAEG;IACH,OAAO,GAAY,EAAE,CAAA;IAErB;;OAEG;IACH,mBAAmB,GAAG,CAAC,CAAA;IAEvB;;OAEG;IACH,aAAa,GAAgB,EAAE,CAAA;IAE/B;;OAEG;IACH,sBAAsB;QACrB,MAAM,KAAK,GAAG,IAAI,CAAC,OAAO,CAAC,CAAC,CAAC,CAAA;QAE7B,IAAI,CAAC,KAAK,EAAE,CAAC;YACZ,MAAM,IAAI,SAAS,CAAC,yDAAyD,CAAC,CAAA;QAC/E,CAAC;QAED,OAAO,KAAK,CAAC,WAAqD,CAAA;IACnE,CAAC;IAED;;OAEG;IACH,kBAAkB,CAAC,KAAa;QAC/B,IAAI,IAAI,GAAG,CAAC,CAAA;QACZ,IAAI,KAAK,GAAG,IAAI,CAAC,aAAa,CAAC,MAAM,GAAG,CAAC,CAAA;QAEzC,OAAO,IAAI,IAAI,KAAK,EAAE,CAAC;YACtB,MAAM,GAAG,GAAG,IAAI,CAAC,KAAK,CAAC,CAAC,IAAI,GAAG,KAAK,CAAC,GAAG,CAAC,CAAC,CAAA;YAC1C,MAAM,SAAS,GAAG,IAAI,CAAC,aAAa,CAAC,GAAG,CAAE,CAAA;YAE1C,IAAI,KAAK,IAAI,SAAS,CAAC,MAAM,IAAI,KAAK,GAAG,SAAS,CAAC,MAAM,GAAG,SAAS,CAAC,MAAM,EAAE,CAAC;gBAC9E,OAAO,EAAE,KAAK,EAAE,IAAI,CAAC,OAAO,CAAC,GAAG,CAAE,EAAE,SAAS,EAAE,CAAA;YAChD,CAAC;YAED,IAAI,KAAK,GAAG,SAAS,CAAC,MAAM,EAAE,CAAC;gBAC9B,KAAK,GAAG,GAAG,GAAG,CAAC,CAAA;YAChB,CAAC;iBAAM,CAAC;gBACP,IAAI,GAAG,GAAG,GAAG,CAAC,CAAA;YACf,CAAC;QACF,CAAC;QAED,OAAO,IAAI,CAAA;IACZ,CAAC;IAED;;OAEG;IACH,mBAAmB;QAClB,IAAI,aAAa,GAAG,CAAC,CAAA;QAErB,IAAI,CAAC,aAAa,GAAG,IAAI,CAAC,OAAO,CAAC,GAAG,CAAC,CAAC,KAAK,EAAE,EAAE;YAC/C,MAAM,IAAI,GAAG,EAAE,MAAM,EAAE,aAAa,EAAE,MAAM,EAAE,KAAK,CAAC,MAAM,EAAE,CAAA;YAE5D,aAAa,IAAI,KAAK,CAAC,MAAM,CAAA;YAE7B,OAAO,IAAI,CAAA;QACZ,CAAC,CAAC,CAAA;IACH,CAAC;IAED,YAAY,MAAgB;QAC3B,IAAI,MAAM,EAAE,CAAC;YACZ,IAAI,CAAC,OAAO,GAAG,MAAM,CAAA;YACrB,IAAI,CAAC,mBAAmB,GAAG,MAAM,CAAC,MAAM,CAAC,CAAC,GAAG,EAAE,KAAK,EAAE,EAAE,CAAC,GAAG,GAAG,KAAK,CAAC,MAAM,EAAE,CAAC,CAAC,CAAA;YAC/E,IAAI,CAAC,mBAAmB,EAAE,CAAA;QAC3B,CAAC;IACF,CAAC;IAED;;;;OAIG;IACH,IAAW,UAAU;QACpB,OAAO,IAAI,CAAC,mBAAmB,CAAA;IAChC,CAAC;IAED;;;;OAIG;IACH,IAAW,IAAI;QACd,OAAO,IAAI,CAAC,OAAO,CAAC,MAAM,CAAA;IAC3B,CAAC;IAED,IAAW,MAAM;QAChB,OAAO,IAAI,CAAC,OAAO,CAAA;IACpB,CAAC;IAED;;;;OAIG;IACH,IAAW,MAAM;QAChB,OAAO,IAAI,CAAC,IAAI,EAAE,CAAA;IACnB,CAAC;IAED,IAAW,CAAC,MAAM,CAAC,WAAW,CAAC;QAC9B,OAAO,mBAAmB,CAAA;IAC3B,CAAC;IAEM,CAAC,CAAC,MAAM,CAAC,QAAQ,CAAC;QACxB,KAAK,MAAM,KAAK,IAAI,IAAI,CAAC,OAAO,EAAE,CAAC;YAClC,KAAK,CAAC,CAAC,KAAK,CAAA;QACb,CAAC;IACF,CAAC;IAED;;OAEG;IACI,EAAE,CAAC,KAAa;QACtB,MAAM,MAAM,GAAG,IAAI,CAAC,kBAAkB,CAAC,KAAK,CAAC,CAAA;QAE7C,IAAI,CAAC,MAAM,EAAE,CAAC;YACb,MAAM,IAAI,UAAU,CAAC,oBAAoB,CAAC,CAAA;QAC3C,CAAC;QAED,MAAM,EAAE,KAAK,EAAE,SAAS,EAAE,GAAG,MAAM,CAAA;QAEnC,OAAO,KAAK,CAAC,KAAK,GAAG,SAAS,CAAC,MAAM,CAAE,CAAA;IACxC,CAAC;IAED;;OAEG;IACI,MAAM,CAAC,KAAY;QACzB,IAAI,CAAC,OAAO,CAAC,IAAI,CAAC,KAAK,CAAC,CAAA;QAExB,IAAI,CAAC,mBAAmB,IAAI,KAAK,CAAC,MAAM,CAAA;QAExC,IAAI,CAAC,mBAAmB,EAAE,CAAA;QAE1B,OAAO,IAAI,CAAC,mBAAmB,CAAA;IAChC,CAAC;IAED;;;;OAIG;IACI,OAAO,CAAC,KAAY;QAC1B,IAAI,CAAC,OAAO,CAAC,OAAO,CAAC,KAAK,CAAC,CAAA;QAC3B,IAAI,CAAC,mBAAmB,IAAI,KAAK,CAAC,MAAM,CAAA;QACxC,IAAI,CAAC,mBAAmB,EAAE,CAAA;QAE1B,OAAO,IAAI,CAAC,mBAAmB,CAAA;IAChC,CAAC;IAED;;OAEG;IACI,UAAU;QAChB,MAAM,KAAK,GAAG,IAAI,CAAC,OAAO,CAAC,GAAG,EAAE,CAAA;QAEhC,IAAI,KAAK,EAAE,CAAC;YACX,IAAI,CAAC,mBAAmB,IAAI,KAAK,CAAC,MAAM,CAAA;YAExC,IAAI,CAAC,mBAAmB,EAAE,CAAA;QAC3B,CAAC;QAED,OAAO,KAAK,CAAA;IACb,CAAC;IAED;;OAEG;IACI,WAAW;QACjB,MAAM,KAAK,GAAG,IAAI,CAAC,OAAO,CAAC,KAAK,EAAE,CAAA;QAElC,IAAI,KAAK,EAAE,CAAC;YACX,IAAI,CAAC,mBAAmB,IAAI,KAAK,CAAC,MAAM,CAAA;YACxC,IAAI,CAAC,mBAAmB,EAAE,CAAA;QAC3B,CAAC;QAED,OAAO,KAAK,CAAA;IACb,CAAC;IAED;;OAEG;IACI,QAAQ;IACd;;OAEG;IACH,KAAK,GAAG,CAAC;IACT;;OAEG;IACH,GAAG,GAAG,IAAI,CAAC,mBAAmB;QAE9B,IAAI,KAAK,GAAG,CAAC,EAAE,CAAC;YACf,MAAM,IAAI,UAAU,CAAC,2CAA2C,CAAC,CAAA;QAClE,CAAC;QAED,IAAI,GAAG,GAAG,CAAC,EAAE,CAAC;YACb,MAAM,IAAI,UAAU,CAAC,yCAAyC,CAAC,CAAA;QAChE,CAAC;QAED,uEAAuE;QACvE,MAAM,UAAU,GAAG,IAAI,CAAC,kBAAkB,CAAC,KAAK,CAAC,CAAA;QACjD,MAAM,QAAQ,GAAG,IAAI,CAAC,kBAAkB,CAAC,GAAG,GAAG,CAAC,CAAC,CAAA;QAEjD,IAAI,CAAC,UAAU,IAAI,CAAC,QAAQ,EAAE,CAAC;YAC9B,MAAM,IAAI,UAAU,CAAC,iCAAiC,GAAG,KAAK,GAAG,SAAS,GAAG,GAAG,CAAC,CAAA;QAClF,CAAC;QAED,uEAAuE;QACvE,IAAI,UAAU,CAAC,KAAK,KAAK,QAAQ,CAAC,KAAK,EAAE,CAAC;YACzC,MAAM,aAAa,GAAG,KAAK,GAAG,UAAU,CAAC,SAAS,CAAC,MAAM,CAAA;YACzD,MAAM,WAAW,GAAG,GAAG,GAAG,UAAU,CAAC,SAAS,CAAC,MAAM,CAAA;YAErD,OAAO,UAAU,CAAC,KAAK,CAAC,QAAQ,CAAC,aAAa,EAAE,WAAW,CAAU,CAAA;QACtE,CAAC;QAED,8DAA8D;QAC9D,MAAM,WAAW,GAAG,IAAI,CAAC,sBAAsB,EAAE,CAAA;QACjD,MAAM,MAAM,GAAG,GAAG,GAAG,KAAK,CAAA;QAC1B,MAAM,MAAM,GAAG,IAAI,WAAW,CAAC,MAAM,CAAC,CAAA;QAEtC,IAAI,WAAW,GAAG,CAAC,CAAA;QACnB,IAAI,iBAAiB,GAAG,IAAI,CAAC,OAAO,CAAC,OAAO,CAAC,UAAU,CAAC,KAAK,CAAC,CAAA;QAE9D,OAAO,iBAAiB,GAAG,IAAI,CAAC,OAAO,CAAC,MAAM,EAAE,CAAC;YAChD,MAAM,YAAY,GAAG,IAAI,CAAC,OAAO,CAAC,iBAAiB,CAAE,CAAA;YACrD,MAAM,SAAS,GAAG,IAAI,CAAC,aAAa,CAAC,iBAAiB,CAAE,CAAA;YAExD,MAAM,SAAS,GAAG,YAAY,KAAK,UAAU,CAAC,KAAK,CAAC,CAAC,CAAC,KAAK,GAAG,SAAS,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC,CAAA;YAClF,MAAM,OAAO,GAAG,YAAY,KAAK,QAAQ,CAAC,KAAK,CAAC,CAAC,CAAC,GAAG,GAAG,SAAS,CAAC,MAAM,CAAC,CAAC,CAAC,YAAY,CAAC,MAAM,CAAA;YAE9F,MAAM,CAAC,GAAG,CAAC,YAAY,CAAC,QAAQ,CAAC,SAAS,EAAE,OAAO,CAAC,EAAE,WAAW,CAAC,CAAA;YAClE,WAAW,IAAI,OAAO,GAAG,SAAS,CAAA;YAElC,IAAI,YAAY,KAAK,QAAQ,CAAC,KAAK;gBAAE,MAAK;YAE1C,iBAAiB,EAAE,CAAA;QACpB,CAAC;QAED,OAAO,MAAe,CAAA;IACvB,CAAC;IAED;;OAEG;IACI,IAAI;QACV,OAAO,IAAI,CAAC,QAAQ,EAAE,CAAA;IACvB,CAAC;IAED;;;;OAIG;IACI,KAAK;IACX;;;;OAIG;IACH,KAAK,GAAG,CAAC;IACT;;;;OAIG;IACH,GAAG,GAAG,IAAI,CAAC,mBAAmB;QAE9B,IAAI,KAAK,GAAG,CAAC,EAAE,CAAC;YACf,KAAK,GAAG,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,IAAI,CAAC,mBAAmB,GAAG,KAAK,CAAC,CAAA;QACtD,CAAC;QAED,IAAI,GAAG,GAAG,CAAC,EAAE,CAAC;YACb,GAAG,GAAG,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,IAAI,CAAC,mBAAmB,GAAG,GAAG,CAAC,CAAA;QAClD,CAAC;QAED,OAAO,IAAI,CAAC,QAAQ,CAAC,KAAK,EAAE,GAAG,CAAC,CAAA;IACjC,CAAC;CACD"}

package/out/lib/core/IndexQueue.d.ts

@@ -0,0 +1,48 @@
+/**
+ * @copyright Sister Software
+ * @license MIT
+ * @author Teffen Ellis, et al.
+ */
+import type { ByteRange } from "../internal/shared.js";
+/**
+ * A first-in, first-out queue for marking and dequeuing index tuples.
+ */
+export declare class IndexQueue implements IterableIterator<ByteRange> {
+    #private;
+    /**
+     * The number of tuples in the queue.
+     */
+    get size(): number;
+    /**
+     * The total byte length spanned by the tuples in the queue.
+     *
+     * This is a cached value and may not be accurate if the queue is modified externally.
+     */
+    get byteLength(): number;
+    /**
+     * Append a new tuple to the queue.
+     */
+    enqueue(tuple: ByteRange): void;
+    /**
+     * Get the next tuple in the queue, removing it.
+     */
+    dequeue(): ByteRange | undefined;
+    /**
+     * Peek at the next tuple in the queue without removing it.
+     */
+    peek(): ByteRange | undefined;
+    /**
+     * Peek at the last tuple in the queue without removing it.
+     */
+    peekLast(): ByteRange | undefined;
+    /**
+     * Clear the queue.
+     */
+    clear(): void;
+    /**
+     * Alias for `dequeue`, conforming to the iterator protocol.
+     */
+    next(): IteratorResult<ByteRange>;
+    [Symbol.iterator](): IndexQueue;
+}
+//# sourceMappingURL=IndexQueue.d.ts.map

package/out/lib/core/IndexQueue.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"IndexQueue.d.ts","sourceRoot":"","sources":["../../../lib/core/IndexQueue.ts"],"names":[],"mappings":"AAAA;;;;GAIG;AAEH,OAAO,KAAK,EAAE,SAAS,EAAE,MAAM,uBAAuB,CAAA;AAStD;;GAEG;AACH,qBAAa,UAAW,YAAW,gBAAgB,CAAC,SAAS,CAAC;;IAa7D;;OAEG;IACH,IAAW,IAAI,IAAI,MAAM,CAExB;IAID;;;;OAIG;IACH,IAAW,UAAU,IAAI,MAAM,CAE9B;IAED;;OAEG;IACI,OAAO,CAAC,KAAK,EAAE,SAAS,GAAG,IAAI,CAKrC;IAED;;OAEG;IACI,OAAO,IAAI,SAAS,GAAG,SAAS,CAqBtC;IAED;;OAEG;IACI,IAAI,IAAI,SAAS,GAAG,SAAS,CAInC;IAED;;OAEG;IACI,QAAQ,IAAI,SAAS,GAAG,SAAS,CAMvC;IAED;;OAEG;IACI,KAAK,IAAI,IAAI,CAInB;IAED;;OAEG;IACI,IAAI,IAAI,cAAc,CAAC,SAAS,CAAC,CAQvC;IAEM,CAAC,MAAM,CAAC,QAAQ,CAAC,IAAI,UAAU,CAErC;CACD"}

package/out/lib/core/IndexQueue.js

@@ -0,0 +1,111 @@
+/**
+ * @copyright Sister Software
+ * @license MIT
+ * @author Teffen Ellis, et al.
+ */
+/**
+ * Number of consumed slots (`start`/`end` values, i.e. 2 per dequeued tuple) the head pointer may advance before the
+ * backing array is compacted. Bounds wasted space under partial draining while keeping compaction rare enough that
+ * `dequeue` stays amortized O(1).
+ */
+const COMPACT_THRESHOLD = 1024;
+/**
+ * A first-in, first-out queue for marking and dequeuing index tuples.
+ */
+export class IndexQueue {
+    /**
+     * Flat backing store of `[start, end]` pairs. Consumed entries before `#head` are kept until the queue drains or
+     * `#head` crosses {@link COMPACT_THRESHOLD}, so `dequeue` stays O(1) instead of shifting the whole array on every
+     * yield.
+     */
+    #tuples = [];
+    /**
+     * Index of the next tuple's `start` in {@link #tuples}; advances by 2 per dequeue.
+     */
+    #head = 0;
+    /**
+     * The number of tuples in the queue.
+     */
+    get size() {
+        return (this.#tuples.length - this.#head) / 2;
+    }
+    #byteLength = 0;
+    /**
+     * The total byte length spanned by the tuples in the queue.
+     *
+     * This is a cached value and may not be accurate if the queue is modified externally.
+     */
+    get byteLength() {
+        return this.#byteLength;
+    }
+    /**
+     * Append a new tuple to the queue.
+     */
+    enqueue(tuple) {
+        this.#tuples.push(tuple[0]);
+        this.#tuples.push(tuple[1]);
+        this.#byteLength += tuple[1] - tuple[0];
+    }
+    /**
+     * Get the next tuple in the queue, removing it.
+     */
+    dequeue() {
+        if (this.#head >= this.#tuples.length)
+            return;
+        const start = this.#tuples[this.#head];
+        const end = this.#tuples[this.#head + 1];
+        this.#head += 2;
+        this.#byteLength -= end - start;
+        // Reclaim consumed space: reset outright once fully drained (the common per-fill pattern
+        // in both engines), otherwise compact periodically so the backing array can't grow
+        // unbounded when the queue is only partially drained between enqueues.
+        if (this.#head >= this.#tuples.length) {
+            this.#tuples.length = 0;
+            this.#head = 0;
+        }
+        else if (this.#head >= COMPACT_THRESHOLD) {
+            this.#tuples.splice(0, this.#head);
+            this.#head = 0;
+        }
+        return [start, end];
+    }
+    /**
+     * Peek at the next tuple in the queue without removing it.
+     */
+    peek() {
+        if (this.#head >= this.#tuples.length)
+            return;
+        return [this.#tuples[this.#head], this.#tuples[this.#head + 1]];
+    }
+    /**
+     * Peek at the last tuple in the queue without removing it.
+     */
+    peekLast() {
+        if (this.#tuples.length - this.#head < 2)
+            return;
+        const end = this.#tuples.length;
+        return [this.#tuples[end - 2], this.#tuples[end - 1]];
+    }
+    /**
+     * Clear the queue.
+     */
+    clear() {
+        this.#tuples.length = 0;
+        this.#head = 0;
+        this.#byteLength = 0;
+    }
+    /**
+     * Alias for `dequeue`, conforming to the iterator protocol.
+     */
+    next() {
+        const tuple = this.dequeue();
+        if (tuple) {
+            return { done: false, value: tuple };
+        }
+        return { done: true, value: undefined };
+    }
+    [Symbol.iterator]() {
+        return this;
+    }
+}
+//# sourceMappingURL=IndexQueue.js.map

package/out/lib/core/IndexQueue.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"IndexQueue.js","sourceRoot":"","sources":["../../../lib/core/IndexQueue.ts"],"names":[],"mappings":"AAAA;;;;GAIG;AAIH;;;;GAIG;AACH,MAAM,iBAAiB,GAAG,IAAI,CAAA;AAE9B;;GAEG;AACH,MAAM,OAAO,UAAU;IACtB;;;;OAIG;IACH,OAAO,GAAa,EAAE,CAAA;IAEtB;;OAEG;IACH,KAAK,GAAG,CAAC,CAAA;IAET;;OAEG;IACH,IAAW,IAAI;QACd,OAAO,CAAC,IAAI,CAAC,OAAO,CAAC,MAAM,GAAG,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,CAAA;IAC9C,CAAC;IAED,WAAW,GAAG,CAAC,CAAA;IAEf;;;;OAIG;IACH,IAAW,UAAU;QACpB,OAAO,IAAI,CAAC,WAAW,CAAA;IACxB,CAAC;IAED;;OAEG;IACI,OAAO,CAAC,KAAgB;QAC9B,IAAI,CAAC,OAAO,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,CAAA;QAC3B,IAAI,CAAC,OAAO,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,CAAA;QAE3B,IAAI,CAAC,WAAW,IAAI,KAAK,CAAC,CAAC,CAAC,GAAG,KAAK,CAAC,CAAC,CAAC,CAAA;IACxC,CAAC;IAED;;OAEG;IACI,OAAO;QACb,IAAI,IAAI,CAAC,KAAK,IAAI,IAAI,CAAC,OAAO,CAAC,MAAM;YAAE,OAAM;QAE7C,MAAM,KAAK,GAAG,IAAI,CAAC,OAAO,CAAC,IAAI,CAAC,KAAK,CAAE,CAAA;QACvC,MAAM,GAAG,GAAG,IAAI,CAAC,OAAO,CAAC,IAAI,CAAC,KAAK,GAAG,CAAC,CAAE,CAAA;QAEzC,IAAI,CAAC,KAAK,IAAI,CAAC,CAAA;QACf,IAAI,CAAC,WAAW,IAAI,GAAG,GAAG,KAAK,CAAA;QAE/B,yFAAyF;QACzF,mFAAmF;QACnF,uEAAuE;QACvE,IAAI,IAAI,CAAC,KAAK,IAAI,IAAI,CAAC,OAAO,CAAC,MAAM,EAAE,CAAC;YACvC,IAAI,CAAC,OAAO,CAAC,MAAM,GAAG,CAAC,CAAA;YACvB,IAAI,CAAC,KAAK,GAAG,CAAC,CAAA;QACf,CAAC;aAAM,IAAI,IAAI,CAAC,KAAK,IAAI,iBAAiB,EAAE,CAAC;YAC5C,IAAI,CAAC,OAAO,CAAC,MAAM,CAAC,CAAC,EAAE,IAAI,CAAC,KAAK,CAAC,CAAA;YAClC,IAAI,CAAC,KAAK,GAAG,CAAC,CAAA;QACf,CAAC;QAED,OAAO,CAAC,KAAK,EAAE,GAAG,CAAC,CAAA;IACpB,CAAC;IAED;;OAEG;IACI,IAAI;QACV,IAAI,IAAI,CAAC,KAAK,IAAI,IAAI,CAAC,OAAO,CAAC,MAAM;YAAE,OAAM;QAE7C,OAAO,CAAC,IAAI,CAAC,OAAO,CAAC,IAAI,CAAC,KAAK,CAAE,EAAE,IAAI,CAAC,OAAO,CAAC,IAAI,CAAC,KAAK,GAAG,CAAC,CAAE,CAAC,CAAA;IAClE,CAAC;IAED;;OAEG;IACI,QAAQ;QACd,IAAI,IAAI,CAAC,OAAO,CAAC,MAAM,GAAG,IAAI,CAAC,KAAK,GAAG,CAAC;YAAE,OAAM;QAEhD,MAAM,GAAG,GAAG,IAAI,CAAC,OAAO,CAAC,MAAM,CAAA;QAE/B,OAAO,CAAC,IAAI,CAAC,OAAO,CAAC,GAAG,GAAG,CAAC,CAAE,EAAE,IAAI,CAAC,OAAO,CAAC,GAAG,GAAG,CAAC,CAAE,CAAC,CAAA;IACxD,CAAC;IAED;;OAEG;IACI,KAAK;QACX,IAAI,CAAC,OAAO,CAAC,MAAM,GAAG,CAAC,CAAA;QACvB,IAAI,CAAC,KAAK,GAAG,CAAC,CAAA;QACd,IAAI,CAAC,WAAW,GAAG,CAAC,CAAA;IACrB,CAAC;IAED;;OAEG;IACI,IAAI;QACV,MAAM,KAAK,GAAG,IAAI,CAAC,OAAO,EAAE,CAAA;QAE5B,IAAI,KAAK,EAAE,CAAC;YACX,OAAO,EAAE,IAAI,EAAE,KAAK,EAAE,KAAK,EAAE,KAAK,EAAE,CAAA;QACrC,CAAC;QAED,OAAO,EAAE,IAAI,EAAE,IAAI,EAAE,KAAK,EAAE,SAAS,EAAE,CAAA;IACxC,CAAC;IAEM,CAAC,MAAM,CAAC,QAAQ,CAAC;QACvB,OAAO,IAAI,CAAA;IACZ,CAAC;CACD"}

package/out/lib/core/SlidingWindow.d.ts

@@ -0,0 +1,47 @@
+/**
+ * @copyright Sister Software
+ * @license MIT
+ * @author Teffen Ellis, et al.
+ */
+import { type CharacterSequenceInput } from "./CharacterSequence.js";
+import type { ByteRange, TypedArray } from "../internal/shared.js";
+export interface SlidingWindowInit {
+    /**
+     * The delimiter to use. Defaults to a line feed.
+     */
+    delimiter?: CharacterSequenceInput;
+    /**
+     * The byte index to start searching from.
+     */
+    position?: number;
+    /**
+     * The byte index to stop searching at.
+     */
+    byteLength?: number;
+}
+/**
+ * A sliding window that iterates over an in-memory buffer, yielding byte ranges.
+ *
+ * @see {@link AsyncSlidingWindow} for an asynchronous version.
+ */
+export declare class SlidingWindow<T extends TypedArray> implements IterableIterator<ByteRange> {
+    #private;
+    buffer: T;
+    /**
+     * The current byte index of the sliding window.
+     */
+    cursor: number;
+    /**
+     * Given a byte array containing delimited data, yield a sliding window of indexes.
+     *
+     * This a low-level utility function that can be used to implement more complex parsing logic.
+     */
+    constructor(
+    /**
+     * The buffer containing delimited data.
+     */
+    buffer: T, init?: SlidingWindowInit);
+    next(): IteratorResult<ByteRange>;
+    [Symbol.iterator](): IterableIterator<ByteRange>;
+}
+//# sourceMappingURL=SlidingWindow.d.ts.map

package/out/lib/core/SlidingWindow.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"SlidingWindow.d.ts","sourceRoot":"","sources":["../../../lib/core/SlidingWindow.ts"],"names":[],"mappings":"AAAA;;;;GAIG;AAEH,OAAO,EAAqB,KAAK,sBAAsB,EAAE,MAAM,wBAAwB,CAAA;AACvF,OAAO,KAAK,EAAE,SAAS,EAAE,UAAU,EAAE,MAAM,uBAAuB,CAAA;AAElE,MAAM,WAAW,iBAAiB;IACjC;;OAEG;IACH,SAAS,CAAC,EAAE,sBAAsB,CAAA;IAElC;;OAEG;IACH,QAAQ,CAAC,EAAE,MAAM,CAAA;IAEjB;;OAEG;IACH,UAAU,CAAC,EAAE,MAAM,CAAA;CACnB;AAED;;;;GAIG;AACH,qBAAa,aAAa,CAAC,CAAC,SAAS,UAAU,CAAE,YAAW,gBAAgB,CAAC,SAAS,CAAC;;IACtF,MAAM,EAAE,CAAC,CAAA;IAKT;;OAEG;IACH,MAAM,EAAE,MAAM,CAAA;IAEd;;;;OAIG;IACH;IACC;;OAEG;IACH,MAAM,EAAE,CAAC,EACT,IAAI,GAAE,iBAAsB,EAM5B;IAEM,IAAI,IAAI,cAAc,CAAC,SAAS,CAAC,CA6BvC;IAEM,CAAC,MAAM,CAAC,QAAQ,CAAC,IAAI,gBAAgB,CAAC,SAAS,CAAC,CAEtD;CACD"}

package/out/lib/core/SlidingWindow.js

@@ -0,0 +1,63 @@
+/**
+ * @copyright Sister Software
+ * @license MIT
+ * @author Teffen Ellis, et al.
+ */
+import { CharacterSequence } from "./CharacterSequence.js";
+/**
+ * A sliding window that iterates over an in-memory buffer, yielding byte ranges.
+ *
+ * @see {@link AsyncSlidingWindow} for an asynchronous version.
+ */
+export class SlidingWindow {
+    buffer;
+    #delimiter;
+    #byteLength;
+    #done = false;
+    /**
+     * The current byte index of the sliding window.
+     */
+    cursor;
+    /**
+     * Given a byte array containing delimited data, yield a sliding window of indexes.
+     *
+     * This a low-level utility function that can be used to implement more complex parsing logic.
+     */
+    constructor(
+    /**
+     * The buffer containing delimited data.
+     */
+    buffer, init = {}) {
+        this.buffer = buffer;
+        this.#delimiter = new CharacterSequence(init.delimiter);
+        this.cursor = init.position ?? 0;
+        this.#byteLength = Math.min(init.byteLength ?? buffer.byteLength, buffer.byteLength);
+    }
+    next() {
+        if (this.cursor < this.#byteLength) {
+            // Delegate scanning to CharacterSequence.search, which uses native indexOf for
+            // single-byte delimiters and the SIMD/BMH paths otherwise — far faster than a
+            // per-byte `.every` callback across the buffer.
+            const delimiterIndex = this.#delimiter.search(this.buffer, this.cursor, this.#byteLength);
+            if (delimiterIndex !== -1) {
+                const range = [this.cursor, delimiterIndex];
+                this.cursor = delimiterIndex + this.#delimiter.length;
+                return { value: range, done: false };
+            }
+        }
+        if (this.cursor <= this.#byteLength && !this.#done) {
+            const range = [this.cursor, this.#byteLength];
+            this.cursor = this.#byteLength;
+            this.#done = true;
+            return { value: range, done: false };
+        }
+        return {
+            value: undefined,
+            done: true,
+        };
+    }
+    [Symbol.iterator]() {
+        return this;
+    }
+}
+//# sourceMappingURL=SlidingWindow.js.map

package/out/lib/core/SlidingWindow.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"SlidingWindow.js","sourceRoot":"","sources":["../../../lib/core/SlidingWindow.ts"],"names":[],"mappings":"AAAA;;;;GAIG;AAEH,OAAO,EAAE,iBAAiB,EAA+B,MAAM,wBAAwB,CAAA;AAoBvF;;;;GAIG;AACH,MAAM,OAAO,aAAa;IACzB,MAAM,CAAG;IACT,UAAU,CAAmB;IAC7B,WAAW,CAAQ;IACnB,KAAK,GAAG,KAAK,CAAA;IAEb;;OAEG;IACH,MAAM,CAAQ;IAEd;;;;OAIG;IACH;IACC;;OAEG;IACH,MAAS,EACT,IAAI,GAAsB,EAAE;QAE5B,IAAI,CAAC,MAAM,GAAG,MAAM,CAAA;QACpB,IAAI,CAAC,UAAU,GAAG,IAAI,iBAAiB,CAAC,IAAI,CAAC,SAAS,CAAC,CAAA;QACvD,IAAI,CAAC,MAAM,GAAG,IAAI,CAAC,QAAQ,IAAI,CAAC,CAAA;QAChC,IAAI,CAAC,WAAW,GAAG,IAAI,CAAC,GAAG,CAAC,IAAI,CAAC,UAAU,IAAI,MAAM,CAAC,UAAU,EAAE,MAAM,CAAC,UAAU,CAAC,CAAA;IACrF,CAAC;IAEM,IAAI;QACV,IAAI,IAAI,CAAC,MAAM,GAAG,IAAI,CAAC,WAAW,EAAE,CAAC;YACpC,+EAA+E;YAC/E,8EAA8E;YAC9E,gDAAgD;YAChD,MAAM,cAAc,GAAG,IAAI,CAAC,UAAU,CAAC,MAAM,CAAC,IAAI,CAAC,MAA+B,EAAE,IAAI,CAAC,MAAM,EAAE,IAAI,CAAC,WAAW,CAAC,CAAA;YAElH,IAAI,cAAc,KAAK,CAAC,CAAC,EAAE,CAAC;gBAC3B,MAAM,KAAK,GAAc,CAAC,IAAI,CAAC,MAAM,EAAE,cAAc,CAAC,CAAA;gBAEtD,IAAI,CAAC,MAAM,GAAG,cAAc,GAAG,IAAI,CAAC,UAAU,CAAC,MAAM,CAAA;gBAErD,OAAO,EAAE,KAAK,EAAE,KAAK,EAAE,IAAI,EAAE,KAAK,EAAE,CAAA;YACrC,CAAC;QACF,CAAC;QAED,IAAI,IAAI,CAAC,MAAM,IAAI,IAAI,CAAC,WAAW,IAAI,CAAC,IAAI,CAAC,KAAK,EAAE,CAAC;YACpD,MAAM,KAAK,GAAc,CAAC,IAAI,CAAC,MAAM,EAAE,IAAI,CAAC,WAAW,CAAC,CAAA;YAExD,IAAI,CAAC,MAAM,GAAG,IAAI,CAAC,WAAW,CAAA;YAC9B,IAAI,CAAC,KAAK,GAAG,IAAI,CAAA;YAEjB,OAAO,EAAE,KAAK,EAAE,KAAK,EAAE,IAAI,EAAE,KAAK,EAAE,CAAA;QACrC,CAAC;QAED,OAAO;YACN,KAAK,EAAE,SAAS;YAChB,IAAI,EAAE,IAAI;SACV,CAAA;IACF,CAAC;IAEM,CAAC,MAAM,CAAC,QAAQ,CAAC;QACvB,OAAO,IAAI,CAAA;IACZ,CAAC;CACD"}