spliterator 1.5.0

package/out/lib/CompositeDataView.d.ts

@@ -0,0 +1,104 @@
+/**
+ * @copyright Sister Software
+ * @license AGPL-3.0
+ * @author Teffen Ellis, et al.
+ */
+import { TypedArray } from "./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>;
+/**
+ * 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;
+}
+//# sourceMappingURL=CompositeDataView.d.ts.map

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

@@ -0,0 +1 @@
+{"version":3,"file":"CompositeDataView.d.ts","sourceRoot":"","sources":["../../lib/CompositeDataView.ts"],"names":[],"mappings":"AAAA;;;;GAIG;AAEH,OAAO,EAAE,UAAU,EAAE,MAAM,aAAa,CAAA;AAExC;;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;;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;;gBAoE9C,MAAM,CAAC,EAAE,KAAK,EAAE;IAQ5B;;;;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;IAM/C;;OAEG;IACI,EAAE,CAAC,KAAK,EAAE,MAAM,GAAG,KAAK,CAAC,CAAC,CAAC;IAUlC;;OAEG;IACI,MAAM,CAAC,KAAK,EAAE,KAAK,GAAG,MAAM;IAUnC;;;;OAIG;IACI,OAAO,CAAC,KAAK,EAAE,KAAK,GAAG,MAAM;IAOpC;;OAEG;IACI,UAAU,IAAI,KAAK,GAAG,SAAS;IAWtC;;OAEG;IACI,WAAW,IAAI,KAAK,GAAG,SAAS;IAWvC;;OAEG;IACI,QAAQ;IACd;;OAEG;IACH,KAAK,GAAE,MAAU;IACjB;;;OAGG;IACH,GAAG,GAAE,MAAiC,GACpC,KAAK;IAiDR;;OAEG;IACI,IAAI,IAAI,KAAK;IAIpB;;;;OAIG;IACI,KAAK;IACX;;;;OAIG;IACH,KAAK,GAAE,MAAU;IACjB;;;;OAIG;IACH,GAAG,GAAE,MAAiC,GACpC,KAAK;CAWR"}

package/out/lib/CompositeDataView.js

@@ -0,0 +1,242 @@
+/**
+ * @copyright Sister Software
+ * @license AGPL-3.0
+ * @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/CompositeDataView.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"CompositeDataView.js","sourceRoot":"","sources":["../../lib/CompositeDataView.ts"],"names":[],"mappings":"AAAA;;;;GAIG;AA4BH;;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;QAC7B,IAAI,CAAC,KAAK,EAAE,CAAC;YACZ,MAAM,IAAI,SAAS,CAAC,yDAAyD,CAAC,CAAA;QAC/E,CAAC;QACD,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;QAC7C,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;QACnC,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;QAC1B,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;QACD,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,QAAgB,CAAC;IACjB;;;OAGG;IACH,MAAc,IAAI,CAAC,mBAAmB;QAEtC,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;YACrD,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;YAC1C,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,QAAgB,CAAC;IACjB;;;;OAIG;IACH,MAAc,IAAI,CAAC,mBAAmB;QAEtC,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/DelimitedChunkReader.d.ts

@@ -0,0 +1,67 @@
+/**
+ * @copyright Sister Software
+ * @license AGPL-3.0
+ * @author Teffen Ellis, et al.
+ */
+import { CharacterSequenceInput } from "./CharacterSequence.js";
+import { AsyncDataResource, ByteRange } from "./shared.js";
+/**
+ * Options for the delimited chunk reader.
+ */
+export interface DeliminatedChunkReaderInit {
+    /**
+     * The desired number of chunks. This is a target, not a guarantee.
+     *
+     * This will never be less than 1, nor greater than the number of delimiters in the file, nor
+     * greater than the byte length of the file.
+     */
+    chunks?: number;
+    /**
+     * The character to delimit by. Typically a newline or comma.
+     */
+    delimiter?: CharacterSequenceInput;
+    /**
+     * Whether to close the file handle after reading.
+     */
+    autoClose?: boolean;
+    /**
+     * The limit of bytes to read from the file.
+     */
+    limit?: number;
+}
+/**
+ * Given a file handle containing delimited data and a desired slice count, returns an array of
+ * slices of the buffer between delimiters.
+ *
+ * This is an advanced function so an analogy is provided:
+ *
+ * Suppose you had to manually search through a very large book page by page to find where each
+ * chapter begins and ends. For a book with 1,000,000 pages, a single person would take a long time
+ * to go through it all.
+ *
+ * You could add more people to the task by laying out all the pages, measuring the length and
+ * assigning each person a length of pages to traverse.
+ *
+ * There's a few ways to go about this:
+ *
+ * We could approach this in serial -- having the first worker start from page 1 and scanning until
+ * they find the beginning of the next chapter, handing off the range to the next worker. This is
+ * how `AsyncSlidingWindow` approaches the problem.
+ *
+ * However this is inefficient because no matter how many workers we have, they must wait for the
+ * previous worker to finish before they can start. Ideally, a desired number of workers would be
+ * able to scan their own _length_ of pages simultaneously, and settle up on the boundaries of the
+ * chapters they find.
+ *
+ * `DeliminatedChunkReader` is like the second approach. Given a desired number of chunks
+ *
+ * @returns A contiguous array of slices of the buffer separated by a delimiter.
+ */
+export declare class DelimitedChunkReader {
+    static fromAsync(
+    /**
+     * The buffer containing newline-delimited data.
+     */
+    source: AsyncDataResource, init?: DeliminatedChunkReaderInit): Promise<ByteRange[]>;
+}
+//# sourceMappingURL=DelimitedChunkReader.d.ts.map

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

@@ -0,0 +1 @@
+{"version":3,"file":"DelimitedChunkReader.d.ts","sourceRoot":"","sources":["../../lib/DelimitedChunkReader.ts"],"names":[],"mappings":"AAAA;;;;GAIG;AAEH,OAAO,EAAqB,sBAAsB,EAAE,MAAM,wBAAwB,CAAA;AAClF,OAAO,EAAE,iBAAiB,EAAE,SAAS,EAAwC,MAAM,aAAa,CAAA;AAGhG;;GAEG;AACH,MAAM,WAAW,0BAA0B;IAC1C;;;;;OAKG;IACH,MAAM,CAAC,EAAE,MAAM,CAAA;IAEf;;OAEG;IACH,SAAS,CAAC,EAAE,sBAAsB,CAAA;IAElC;;OAEG;IACH,SAAS,CAAC,EAAE,OAAO,CAAA;IAEnB;;OAEG;IACH,KAAK,CAAC,EAAE,MAAM,CAAA;CACd;AAED;;;;;;;;;;;;;;;;;;;;;;;;;;;GA2BG;AACH,qBAAa,oBAAoB;WACnB,SAAS;IACrB;;OAEG;IACH,MAAM,EAAE,iBAAiB,EACzB,IAAI,GAAE,0BAA+B,GACnC,OAAO,CAAC,SAAS,EAAE,CAAC;CAyFvB"}

package/out/lib/DelimitedChunkReader.js

@@ -0,0 +1,113 @@
+/**
+ * @copyright Sister Software
+ * @license AGPL-3.0
+ * @author Teffen Ellis, et al.
+ */
+import { CharacterSequence } from "./CharacterSequence.js";
+import { isFileResourceLike } from "./shared.js";
+import { AsyncSlidingWindow } from "./SlidingWindow.js";
+/**
+ * Given a file handle containing delimited data and a desired slice count, returns an array of
+ * slices of the buffer between delimiters.
+ *
+ * This is an advanced function so an analogy is provided:
+ *
+ * Suppose you had to manually search through a very large book page by page to find where each
+ * chapter begins and ends. For a book with 1,000,000 pages, a single person would take a long time
+ * to go through it all.
+ *
+ * You could add more people to the task by laying out all the pages, measuring the length and
+ * assigning each person a length of pages to traverse.
+ *
+ * There's a few ways to go about this:
+ *
+ * We could approach this in serial -- having the first worker start from page 1 and scanning until
+ * they find the beginning of the next chapter, handing off the range to the next worker. This is
+ * how `AsyncSlidingWindow` approaches the problem.
+ *
+ * However this is inefficient because no matter how many workers we have, they must wait for the
+ * previous worker to finish before they can start. Ideally, a desired number of workers would be
+ * able to scan their own _length_ of pages simultaneously, and settle up on the boundaries of the
+ * chapters they find.
+ *
+ * `DeliminatedChunkReader` is like the second approach. Given a desired number of chunks
+ *
+ * @returns A contiguous array of slices of the buffer separated by a delimiter.
+ */
+export class DelimitedChunkReader {
+    static async fromAsync(
+    /**
+     * The buffer containing newline-delimited data.
+     */
+    source, init = {}) {
+        let file;
+        if (isFileResourceLike(source)) {
+            file = source;
+        }
+        else {
+            const { NodeFileResource } = await import("spliterator/node/fs");
+            file = await NodeFileResource.open(source);
+        }
+        const byteLimit = init.limit ?? file.size;
+        // const byteLimit = init.limit ?? (await fileHandle.stat()).size
+        const delimiter = new CharacterSequence(init.delimiter);
+        const delimiterLength = delimiter.length;
+        const desiredSlices = Math.min(Math.max(1, init.chunks ?? 2), byteLimit / delimiterLength, byteLimit);
+        const fallback = [[0, byteLimit]];
+        if (desiredSlices === 1) {
+            return fallback;
+        }
+        const ranges = [];
+        const chunkSize = Math.floor(byteLimit / desiredSlices);
+        for (let i = 0; i < desiredSlices; i++) {
+            const previousSlice = ranges[i - 1] ?? [0, 0];
+            const chunkEnd = Math.min(i * chunkSize, byteLimit);
+            const searchStart = Math.max(chunkEnd - delimiterLength * 2, previousSlice[1]);
+            const searchEnd = Math.min(chunkEnd + delimiterLength * 2, byteLimit);
+            const reverse = new AsyncSlidingWindow(file, {
+                delimiter,
+                position: searchStart,
+                byteLength: searchEnd,
+            });
+            const forward = new AsyncSlidingWindow(file, {
+                delimiter,
+                position: searchStart,
+                byteLength: searchEnd,
+            });
+            const [previousRange, nextRange] = await Promise.all([
+                // We look backward to find the previous delimiter at a midpoint in the chunk...
+                reverse.previous(),
+                // And forward to find the next delimiter.
+                forward.next(),
+            ]);
+            if (i === 0) {
+                // The first slice is always from the beginning of the file to the first delimiter.
+                ranges.push(nextRange.value);
+                continue;
+            }
+            if (previousRange.done || nextRange.done)
+                break;
+            if (i === desiredSlices - 1) {
+                const range = [previousRange.value[0] + delimiterLength, byteLimit];
+                // We need to fix the previous slice to end at the previous delimiter.
+                previousSlice[1] = previousRange.value[0] - delimiterLength;
+                // The last slice is always from the last delimiter to the end of the file.
+                ranges.push(range);
+                break;
+            }
+            // We need to fix the previous slice to end at the previous delimiter.
+            previousSlice[1] = previousRange.value[0] - delimiterLength;
+            // And we need to fix the current slice to start at the previous delimiter.
+            nextRange.value[0] = previousRange.value[0] + delimiterLength;
+            // We can now add the current slice to the list.
+            ranges.push(nextRange.value);
+        }
+        if (!ranges.length)
+            return fallback;
+        if (init.autoClose) {
+            await file[Symbol.asyncDispose]?.();
+        }
+        return ranges;
+    }
+}
+//# sourceMappingURL=DelimitedChunkReader.js.map

package/out/lib/DelimitedChunkReader.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"DelimitedChunkReader.js","sourceRoot":"","sources":["../../lib/DelimitedChunkReader.ts"],"names":[],"mappings":"AAAA;;;;GAIG;AAEH,OAAO,EAAE,iBAAiB,EAA0B,MAAM,wBAAwB,CAAA;AAClF,OAAO,EAAkD,kBAAkB,EAAE,MAAM,aAAa,CAAA;AAChG,OAAO,EAAE,kBAAkB,EAAE,MAAM,oBAAoB,CAAA;AA8BvD;;;;;;;;;;;;;;;;;;;;;;;;;;;GA2BG;AACH,MAAM,OAAO,oBAAoB;IAChC,MAAM,CAAC,KAAK,CAAC,SAAS;IACrB;;OAEG;IACH,MAAyB,EACzB,OAAmC,EAAE;QAErC,IAAI,IAAsB,CAAA;QAE1B,IAAI,kBAAkB,CAAC,MAAM,CAAC,EAAE,CAAC;YAChC,IAAI,GAAG,MAAM,CAAA;QACd,CAAC;aAAM,CAAC;YACP,MAAM,EAAE,gBAAgB,EAAE,GAAG,MAAM,MAAM,CAAC,qBAAqB,CAAC,CAAA;YAChE,IAAI,GAAG,MAAM,gBAAgB,CAAC,IAAI,CAAC,MAAM,CAAC,CAAA;QAC3C,CAAC;QAED,MAAM,SAAS,GAAG,IAAI,CAAC,KAAK,IAAI,IAAI,CAAC,IAAI,CAAA;QACzC,iEAAiE;QAEjE,MAAM,SAAS,GAAG,IAAI,iBAAiB,CAAC,IAAI,CAAC,SAAS,CAAC,CAAA;QACvD,MAAM,eAAe,GAAG,SAAS,CAAC,MAAM,CAAA;QAExC,MAAM,aAAa,GAAG,IAAI,CAAC,GAAG,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,IAAI,CAAC,MAAM,IAAI,CAAC,CAAC,EAAE,SAAS,GAAG,eAAe,EAAE,SAAS,CAAC,CAAA;QACrG,MAAM,QAAQ,GAAgB,CAAC,CAAC,CAAC,EAAE,SAAS,CAAC,CAAC,CAAA;QAE9C,IAAI,aAAa,KAAK,CAAC,EAAE,CAAC;YACzB,OAAO,QAAQ,CAAA;QAChB,CAAC;QAED,MAAM,MAAM,GAAgB,EAAE,CAAA;QAC9B,MAAM,SAAS,GAAG,IAAI,CAAC,KAAK,CAAC,SAAS,GAAG,aAAa,CAAC,CAAA;QAEvD,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,aAAa,EAAE,CAAC,EAAE,EAAE,CAAC;YACxC,MAAM,aAAa,GAAG,MAAM,CAAC,CAAC,GAAG,CAAC,CAAC,IAAI,CAAC,CAAC,EAAE,CAAC,CAAC,CAAA;YAE7C,MAAM,QAAQ,GAAG,IAAI,CAAC,GAAG,CAAC,CAAC,GAAG,SAAS,EAAE,SAAS,CAAC,CAAA;YACnD,MAAM,WAAW,GAAG,IAAI,CAAC,GAAG,CAAC,QAAQ,GAAG,eAAe,GAAG,CAAC,EAAE,aAAa,CAAC,CAAC,CAAC,CAAC,CAAA;YAC9E,MAAM,SAAS,GAAG,IAAI,CAAC,GAAG,CAAC,QAAQ,GAAG,eAAe,GAAG,CAAC,EAAE,SAAS,CAAC,CAAA;YAErE,MAAM,OAAO,GAAG,IAAI,kBAAkB,CAAC,IAAI,EAAE;gBAC5C,SAAS;gBACT,QAAQ,EAAE,WAAW;gBACrB,UAAU,EAAE,SAAS;aACrB,CAAC,CAAA;YACF,MAAM,OAAO,GAAG,IAAI,kBAAkB,CAAC,IAAI,EAAE;gBAC5C,SAAS;gBACT,QAAQ,EAAE,WAAW;gBACrB,UAAU,EAAE,SAAS;aACrB,CAAC,CAAA;YAEF,MAAM,CAAC,aAAa,EAAE,SAAS,CAAC,GAAG,MAAM,OAAO,CAAC,GAAG,CAAC;gBACpD,gFAAgF;gBAChF,OAAO,CAAC,QAAQ,EAAE;gBAClB,0CAA0C;gBAC1C,OAAO,CAAC,IAAI,EAAE;aACd,CAAC,CAAA;YAEF,IAAI,CAAC,KAAK,CAAC,EAAE,CAAC;gBACb,mFAAmF;gBACnF,MAAM,CAAC,IAAI,CAAC,SAAS,CAAC,KAAK,CAAC,CAAA;gBAE5B,SAAQ;YACT,CAAC;YAED,IAAI,aAAa,CAAC,IAAI,IAAI,SAAS,CAAC,IAAI;gBAAE,MAAK;YAE/C,IAAI,CAAC,KAAK,aAAa,GAAG,CAAC,EAAE,CAAC;gBAC7B,MAAM,KAAK,GAAc,CAAC,aAAa,CAAC,KAAK,CAAC,CAAC,CAAC,GAAG,eAAe,EAAE,SAAS,CAAC,CAAA;gBAC9E,sEAAsE;gBACtE,aAAa,CAAC,CAAC,CAAC,GAAG,aAAa,CAAC,KAAK,CAAC,CAAC,CAAC,GAAG,eAAe,CAAA;gBAE3D,2EAA2E;gBAC3E,MAAM,CAAC,IAAI,CAAC,KAAK,CAAC,CAAA;gBAElB,MAAK;YACN,CAAC;YAED,sEAAsE;YACtE,aAAa,CAAC,CAAC,CAAC,GAAG,aAAa,CAAC,KAAK,CAAC,CAAC,CAAC,GAAG,eAAe,CAAA;YAE3D,2EAA2E;YAC3E,SAAS,CAAC,KAAK,CAAC,CAAC,CAAC,GAAG,aAAa,CAAC,KAAK,CAAC,CAAC,CAAC,GAAG,eAAe,CAAA;YAE7D,gDAAgD;YAChD,MAAM,CAAC,IAAI,CAAC,SAAS,CAAC,KAAK,CAAC,CAAA;QAC7B,CAAC;QAED,IAAI,CAAC,MAAM,CAAC,MAAM;YAAE,OAAO,QAAQ,CAAA;QAEnC,IAAI,IAAI,CAAC,SAAS,EAAE,CAAC;YACpB,MAAM,IAAI,CAAC,MAAM,CAAC,YAAY,CAAC,EAAE,EAAE,CAAA;QACpC,CAAC;QAED,OAAO,MAAM,CAAA;IACd,CAAC;CACD"}

package/out/lib/DelimiterTransformer.d.ts

@@ -0,0 +1,27 @@
+/**
+ * @copyright Sister Software
+ * @license AGPL-3.0
+ * @author Teffen Ellis, et al.
+ */
+import { CharacterSequenceInput } from "./CharacterSequence.js";
+import { TypedArray } from "./shared.js";
+/**
+ * Options for the `DelimiterTransformer` class.
+ */
+export interface DelimiterTransformerOptions {
+    /**
+     * The delimiter to use when splitting fields.
+     *
+     * @default `Delimiter.Comma`
+     */
+    delimiter?: CharacterSequenceInput;
+}
+/**
+ * A transform stream that splits incoming text into fields using a delimiter.
+ *
+ * This is useful for parsing CSV files, for example.
+ */
+export declare class DelimiterTransformer<T extends TypedArray = TypedArray> extends TransformStream<T, T[]> {
+    constructor(options?: DelimiterTransformerOptions);
+}
+//# sourceMappingURL=DelimiterTransformer.d.ts.map

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

@@ -0,0 +1 @@
+{"version":3,"file":"DelimiterTransformer.d.ts","sourceRoot":"","sources":["../../lib/DelimiterTransformer.ts"],"names":[],"mappings":"AAAA;;;;GAIG;AAEH,OAAO,EAAqB,sBAAsB,EAA6B,MAAM,wBAAwB,CAAA;AAC7G,OAAO,EAAE,UAAU,EAAE,MAAM,aAAa,CAAA;AAExC;;GAEG;AACH,MAAM,WAAW,2BAA2B;IAC3C;;;;OAIG;IACH,SAAS,CAAC,EAAE,sBAAsB,CAAA;CAClC;AAED;;;;GAIG;AACH,qBAAa,oBAAoB,CAAC,CAAC,SAAS,UAAU,GAAG,UAAU,CAAE,SAAQ,eAAe,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC;gBACvF,OAAO,GAAE,2BAAgC;CAerD"}

package/out/lib/DelimiterTransformer.js

@@ -0,0 +1,26 @@
+/**
+ * @copyright Sister Software
+ * @license AGPL-3.0
+ * @author Teffen Ellis, et al.
+ */
+import { CharacterSequence, Delimiters, takeDelimited } from "./CharacterSequence.js";
+/**
+ * A transform stream that splits incoming text into fields using a delimiter.
+ *
+ * This is useful for parsing CSV files, for example.
+ */
+export class DelimiterTransformer extends TransformStream {
+    constructor(options = {}) {
+        const delimiter = new CharacterSequence(options.delimiter ?? Delimiters.Comma);
+        super({
+            transform: (line, controller) => {
+                if (line.length === 0) {
+                    return;
+                }
+                const columns = Array.from(takeDelimited(line, delimiter));
+                controller.enqueue(columns);
+            },
+        });
+    }
+}
+//# sourceMappingURL=DelimiterTransformer.js.map

package/out/lib/DelimiterTransformer.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"DelimiterTransformer.js","sourceRoot":"","sources":["../../lib/DelimiterTransformer.ts"],"names":[],"mappings":"AAAA;;;;GAIG;AAEH,OAAO,EAAE,iBAAiB,EAA0B,UAAU,EAAE,aAAa,EAAE,MAAM,wBAAwB,CAAA;AAe7G;;;;GAIG;AACH,MAAM,OAAO,oBAAwD,SAAQ,eAAuB;IACnG,YAAY,UAAuC,EAAE;QACpD,MAAM,SAAS,GAAG,IAAI,iBAAiB,CAAC,OAAO,CAAC,SAAS,IAAI,UAAU,CAAC,KAAK,CAAC,CAAA;QAE9E,KAAK,CAAC;YACL,SAAS,EAAE,CAAC,IAAI,EAAE,UAAU,EAAE,EAAE;gBAC/B,IAAI,IAAI,CAAC,MAAM,KAAK,CAAC,EAAE,CAAC;oBACvB,OAAM;gBACP,CAAC;gBAED,MAAM,OAAO,GAAG,KAAK,CAAC,IAAI,CAAC,aAAa,CAAC,IAAI,EAAE,SAAS,CAAC,CAAC,CAAA;gBAE1D,UAAU,CAAC,OAAO,CAAC,OAAyB,CAAC,CAAA;YAC9C,CAAC;SACD,CAAC,CAAA;IACH,CAAC;CACD"}

package/out/lib/IndexQueue.d.ts

@@ -0,0 +1,48 @@
+/**
+ * @copyright Sister Software
+ * @license AGPL-3.0
+ * @author Teffen Ellis, et al.
+ */
+import type { ByteRange } from "./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/IndexQueue.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"IndexQueue.d.ts","sourceRoot":"","sources":["../../lib/IndexQueue.ts"],"names":[],"mappings":"AAAA;;;;GAIG;AAEH,OAAO,KAAK,EAAE,SAAS,EAAE,MAAM,aAAa,CAAA;AAE5C;;GAEG;AACH,qBAAa,UAAW,YAAW,gBAAgB,CAAC,SAAS,CAAC;;IAG7D;;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;IAMtC;;OAEG;IACI,OAAO,IAAI,SAAS,GAAG,SAAS;IAUvC;;OAEG;IACI,IAAI,IAAI,SAAS,GAAG,SAAS;IAMpC;;OAEG;IACI,QAAQ,IAAI,SAAS,GAAG,SAAS;IAMxC;;OAEG;IACI,KAAK,IAAI,IAAI;IAKpB;;OAEG;IACI,IAAI,IAAI,cAAc,CAAC,SAAS,CAAC;IAUjC,CAAC,MAAM,CAAC,QAAQ,CAAC,IAAI,UAAU;CAGtC"}