spliterator 6.1.0 → 6.2.0

package/out/lib/core/BufferController.js

@@ -0,0 +1,118 @@
+/**
+ * @copyright Sister Software
+ * @license MIT
+ * @author Teffen Ellis, et al.
+ */
+/**
+ * A class to manage a buffer of bytes, growing and shrinking as needed.
+ */
+export class BufferController {
+    /**
+     * The initial size of the buffer.
+     */
+    #initialBufferSize;
+    /**
+     * The underlying buffer containing the data.
+     *
+     * This property is mutable for performance reasons. Consumers should treat it as immutable.
+     */
+    bytes;
+    /**
+     * The total number of bytes currently written to the buffer.
+     *
+     * This property is mutable for performance reasons. Consumers should treat it as immutable.
+     */
+    bytesWritten;
+    /**
+     * The minimum byte length of the buffer.
+     */
+    get byteLengthMinimum() {
+        return Math.max(this.bytesWritten, this.#initialBufferSize);
+    }
+    constructor(init) {
+        this.#initialBufferSize = init.initialBufferSize;
+        this.bytes = new Uint8Array(this.#initialBufferSize);
+        this.bytesWritten = 0;
+    }
+    /**
+     * Grow the buffer to the desired byte length, typically double the current byte length.
+     */
+    grow(desiredByteLength) {
+        desiredByteLength ??= this.bytes.length * 2;
+        if (desiredByteLength <= this.bytes.length)
+            return;
+        // console.debug(`Growing buffer from ${this.bytes.length} to ${desiredByteLength} bytes.`)
+        const newBytes = new Uint8Array(desiredByteLength);
+        newBytes.set(this.bytes);
+        this.bytes = newBytes;
+    }
+    /**
+     * Modify the buffer in place, keeping only the bytes between the start and end indices.
+     *
+     * This is performed after we're confident that any data preceeding `start` or following `end` is no longer needed.
+     *
+     * `bytesWritten` is rebased onto the new window so it always reflects the count of valid bytes present after
+     * compression. Bytes outside the kept window are dropped from the count even if the underlying allocation is larger.
+     *
+     * @param start - The starting byte index of which bytes to keep.
+     * @param end - The ending byte index of which bytes to keep. Defaults to the current buffer length. Values past the
+     *   buffer length are clamped.
+     */
+    compress(start = 0, end = this.bytes.length) {
+        const clampedEnd = Math.min(end, this.bytes.length);
+        const validEnd = Math.min(this.bytesWritten, clampedEnd);
+        this.bytes = this.bytes.subarray(start, clampedEnd);
+        this.bytesWritten = Math.max(0, validEnd - start);
+    }
+    /**
+     * Clear the buffer, zeroing out all bytes.
+     *
+     * @param begin The starting byte index from which to clear.
+     * @param end The ending byte index to clear.
+     */
+    clear(begin = 0, end = this.bytesWritten) {
+        this.bytes.fill(0, begin, end);
+        this.bytesWritten = 0;
+    }
+    /**
+     * Gets a new Uint8Array view of the ArrayBuffer store for this array, referencing the elements at begin, inclusive,
+     * up to end, exclusive.
+     *
+     * @param begin — The index of the beginning of the array.
+     * @param end — The index of the end of the array
+     * @throws If the start index is greater than the end index.
+     * @throws If the end index is greater than the current byte length.
+     */
+    subarray(begin = 0, end = this.bytesWritten) {
+        if (begin > end) {
+            throw new RangeError(`Start index ${begin} is greater than end index ${end}.`);
+        }
+        if (end > this.bytesWritten) {
+            throw new RangeError(`End index ${end} is greater than the current byte length ${this.bytesWritten}.`);
+        }
+        return this.bytes.subarray(begin, end);
+    }
+    /**
+     * Sets a value or an array of values.
+     *
+     * Unlike the `TypedArray.set` method, this method will grow the buffer if the offset is greater than the current byte
+     * length.
+     *
+     * @param array — A typed or untyped array of values to set.
+     * @param offset — The index in the current array at which the values are to be written.
+     *
+     * @returns The number of bytes written.
+     */
+    set(array, offset = 0) {
+        const nextLength = offset + array.length;
+        if (nextLength > this.bytes.length) {
+            this.grow(nextLength);
+        }
+        this.bytes.set(array, offset);
+        if (nextLength > this.bytesWritten) {
+            this.bytesWritten = nextLength;
+        }
+        return nextLength;
+    }
+}
+//# sourceMappingURL=BufferController.js.map

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

@@ -0,0 +1 @@
+{"version":3,"file":"BufferController.js","sourceRoot":"","sources":["../../../lib/core/BufferController.ts"],"names":[],"mappings":"AAAA;;;;GAIG;AAEH;;GAEG;AACH,MAAM,OAAO,gBAAgB;IAC5B;;OAEG;IACH,kBAAkB,CAAQ;IAE1B;;;;OAIG;IACH,KAAK,CAAY;IAEjB;;;;OAIG;IACH,YAAY,CAAQ;IAEpB;;OAEG;IACH,IAAW,iBAAiB;QAC3B,OAAO,IAAI,CAAC,GAAG,CAAC,IAAI,CAAC,YAAY,EAAE,IAAI,CAAC,kBAAkB,CAAC,CAAA;IAC5D,CAAC;IAED,YAAY,IAAmC;QAC9C,IAAI,CAAC,kBAAkB,GAAG,IAAI,CAAC,iBAAiB,CAAA;QAChD,IAAI,CAAC,KAAK,GAAG,IAAI,UAAU,CAAC,IAAI,CAAC,kBAAkB,CAAC,CAAA;QACpD,IAAI,CAAC,YAAY,GAAG,CAAC,CAAA;IACtB,CAAC;IAED;;OAEG;IACI,IAAI,CAAC,iBAA0B;QACrC,iBAAiB,KAAK,IAAI,CAAC,KAAK,CAAC,MAAM,GAAG,CAAC,CAAA;QAE3C,IAAI,iBAAiB,IAAI,IAAI,CAAC,KAAK,CAAC,MAAM;YAAE,OAAM;QAElD,2FAA2F;QAC3F,MAAM,QAAQ,GAAG,IAAI,UAAU,CAAC,iBAAiB,CAAC,CAAA;QAElD,QAAQ,CAAC,GAAG,CAAC,IAAI,CAAC,KAAK,CAAC,CAAA;QAExB,IAAI,CAAC,KAAK,GAAG,QAAQ,CAAA;IACtB,CAAC;IAED;;;;;;;;;;;OAWG;IACI,QAAQ,CAAC,KAAK,GAAG,CAAC,EAAE,GAAG,GAAW,IAAI,CAAC,KAAK,CAAC,MAAM;QACzD,MAAM,UAAU,GAAG,IAAI,CAAC,GAAG,CAAC,GAAG,EAAE,IAAI,CAAC,KAAK,CAAC,MAAM,CAAC,CAAA;QACnD,MAAM,QAAQ,GAAG,IAAI,CAAC,GAAG,CAAC,IAAI,CAAC,YAAY,EAAE,UAAU,CAAC,CAAA;QAExD,IAAI,CAAC,KAAK,GAAG,IAAI,CAAC,KAAK,CAAC,QAAQ,CAAC,KAAK,EAAE,UAAU,CAAC,CAAA;QAEnD,IAAI,CAAC,YAAY,GAAG,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,QAAQ,GAAG,KAAK,CAAC,CAAA;IAClD,CAAC;IAED;;;;;OAKG;IACI,KAAK,CAAC,KAAK,GAAG,CAAC,EAAE,GAAG,GAAW,IAAI,CAAC,YAAY;QACtD,IAAI,CAAC,KAAK,CAAC,IAAI,CAAC,CAAC,EAAE,KAAK,EAAE,GAAG,CAAC,CAAA;QAC9B,IAAI,CAAC,YAAY,GAAG,CAAC,CAAA;IACtB,CAAC;IAED;;;;;;;;OAQG;IACI,QAAQ,CAAC,KAAK,GAAG,CAAC,EAAE,GAAG,GAAW,IAAI,CAAC,YAAY;QACzD,IAAI,KAAK,GAAG,GAAG,EAAE,CAAC;YACjB,MAAM,IAAI,UAAU,CAAC,eAAe,KAAK,8BAA8B,GAAG,GAAG,CAAC,CAAA;QAC/E,CAAC;QAED,IAAI,GAAG,GAAG,IAAI,CAAC,YAAY,EAAE,CAAC;YAC7B,MAAM,IAAI,UAAU,CAAC,aAAa,GAAG,4CAA4C,IAAI,CAAC,YAAY,GAAG,CAAC,CAAA;QACvG,CAAC;QAED,OAAO,IAAI,CAAC,KAAK,CAAC,QAAQ,CAAC,KAAK,EAAE,GAAG,CAAC,CAAA;IACvC,CAAC;IAED;;;;;;;;;;OAUG;IACI,GAAG,CAAC,KAAwB,EAAE,MAAM,GAAG,CAAC;QAC9C,MAAM,UAAU,GAAG,MAAM,GAAG,KAAK,CAAC,MAAM,CAAA;QAExC,IAAI,UAAU,GAAG,IAAI,CAAC,KAAK,CAAC,MAAM,EAAE,CAAC;YACpC,IAAI,CAAC,IAAI,CAAC,UAAU,CAAC,CAAA;QACtB,CAAC;QAED,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,KAAK,EAAE,MAAM,CAAC,CAAA;QAE7B,IAAI,UAAU,GAAG,IAAI,CAAC,YAAY,EAAE,CAAC;YACpC,IAAI,CAAC,YAAY,GAAG,UAAU,CAAA;QAC/B,CAAC;QAED,OAAO,UAAU,CAAA;IAClB,CAAC;CACD"}

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

@@ -0,0 +1,72 @@
+/**
+ * @copyright Sister Software
+ * @license MIT
+ * @author Teffen Ellis, et al.
+ */
+import type { PathBuilderLike } from "path-ts";
+import type { ByteRange } from "../internal/shared.js";
+import { type MatchResult, type WasmRangeScanResult } from "./wasm_module.js";
+export declare function isArrayLike<T>(input: unknown): input is ArrayLike<T>;
+export type CharacterSequenceInput = number | string | DataView | ArrayBuffer | Buffer | Iterable<number> | PathBuilderLike;
+export declare const Delimiters: {
+    readonly Null: 0;
+    readonly LineFeed: 10;
+    readonly CarriageReturn: 13;
+    readonly Comma: 44;
+    readonly Tab: 9;
+    readonly Space: 32;
+    readonly One: 49;
+    readonly Zero: 48;
+    readonly DoubleQuote: 34;
+    readonly RecordSeparator: 30;
+    readonly Pipe: 124;
+};
+export declare const VisibleDelimiterMap: Map<number, string>;
+export declare function debugAsVisibleCharacters(delimiter: Uint8Array): string;
+export declare function normalizeCharacterInput(input: CharacterSequenceInput): Uint8Array;
+export declare class CharacterSequence extends Uint8Array {
+    #private;
+    /**
+     * Resolve once the WASM SIMD scanner has finished loading, yielding whether it is active.
+     *
+     * The module loads asynchronously, so synchronous callers (`Spliterator.fromSync`, `CSVSpliterator.from`) that run to
+     * completion in a single tick would otherwise always fall back to the JS scanner. Await this first to opt into SIMD
+     * acceleration.
+     */
+    static whenReady(): Promise<boolean>;
+    search(haystack: Uint8Array, start?: number, end?: number): number;
+    searchAll(haystack: Uint8Array, start?: number, end?: number): ByteRange[];
+    /**
+     * Scan completed ranges in one bounded, resumable WASM call.
+     *
+     * This is the low-allocation streaming primitive: unlike {@link searchMatches}, it carries quote state and range
+     * boundaries through the native scan and exposes the packed result view directly. The returned view aliases shared
+     * WASM memory and must be consumed before another scanner call.
+     *
+     * Returns `null` when the SIMD module is unavailable, the delimiter/quote is not one byte, or the buffer is below the
+     * WASM threshold. Callers must retain their existing JavaScript path as the fallback.
+     */
+    scanRanges(haystack: Uint8Array, state: {
+        scanCursor: number;
+        pendingSliceStart: number;
+        insideQuotes: boolean;
+    }, end?: number, quotePattern?: Uint8Array, maxRanges?: number): WasmRangeScanResult | null;
+    /**
+     * Scan for two patterns simultaneously (delimiter + quote) for CSV parsing.
+     *
+     * Returns sorted MatchResult[] with patternId 0=delimiter, 1=quote. Uses WASM SIMD double-scan when available; JS
+     * fallback otherwise.
+     */
+    searchMatches(haystack: Uint8Array, quotePattern: Uint8Array, start?: number, end?: number): MatchResult[];
+    /**
+     * Adopt a pattern as a sequence, reusing it when it already is one.
+     *
+     * Constructing a sequence builds a 256-entry skip table, so wrapping unconditionally puts that allocation on every
+     * call of a per-row scan. Every in-tree caller of {@linkcode searchMatches} already holds a long-lived sequence for
+     * its quote pattern.
+     */
+    static asSequence(pattern: Uint8Array): CharacterSequence;
+    decode(encoding?: string): string;
+    constructor(input?: CharacterSequenceInput);
+}
+//# sourceMappingURL=CharacterSequence.d.ts.map

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

@@ -0,0 +1 @@
+{"version":3,"file":"CharacterSequence.d.ts","sourceRoot":"","sources":["../../../lib/core/CharacterSequence.ts"],"names":[],"mappings":"AAAA;;;;GAIG;AAEH,OAAO,KAAK,EAAE,eAAe,EAAE,MAAM,SAAS,CAAA;AAE9C,OAAO,KAAK,EAAE,SAAS,EAAE,MAAM,uBAAuB,CAAA;AACtD,OAAO,EAIN,KAAK,WAAW,EAGhB,KAAK,mBAAmB,EACxB,MAAM,kBAAkB,CAAA;AAEzB,wBAAgB,WAAW,CAAC,CAAC,EAAE,KAAK,EAAE,OAAO,GAAG,KAAK,IAAI,SAAS,CAAC,CAAC,CAAC,CAEpE;AAED,MAAM,MAAM,sBAAsB,GAC/B,MAAM,GACN,MAAM,GACN,QAAQ,GACR,WAAW,GACX,MAAM,GACN,QAAQ,CAAC,MAAM,CAAC,GAChB,eAAe,CAAA;AAElB,eAAO,MAAM,UAAU;mBAChB,CAAC;uBACG,EAAE;6BACI,EAAE;oBACX,EAAE;kBACJ,CAAC;oBACC,EAAE;kBACJ,EAAE;mBACD,EAAE;0BACK,EAAE;8BACE,EAAE;mBACb,GAAG;CACiC,CAAA;AAE3C,eAAO,MAAM,mBAAmB,qBAS9B,CAAA;AAEF,wBAAgB,wBAAwB,CAAC,SAAS,EAAE,UAAU,GAAG,MAAM,CAItE;AAID,wBAAgB,uBAAuB,CAAC,KAAK,EAAE,sBAAsB,GAAG,UAAU,CAsBjF;AAeD,qBAAa,iBAAkB,SAAQ,UAAU;;IA8BhD;;;;;;OAMG;IACH,OAAc,SAAS,IAAI,OAAO,CAAC,OAAO,CAAC,CAE1C;IAEM,MAAM,CAAC,QAAQ,EAAE,UAAU,EAAE,KAAK,SAAI,EAAE,GAAG,GAAE,MAAwB,GAAG,MAAM,CAyDpF;IAEM,SAAS,CAAC,QAAQ,EAAE,UAAU,EAAE,KAAK,SAAI,EAAE,GAAG,SAAkB,GAAG,SAAS,EAAE,CAwEpF;IAED;;;;;;;;;OASG;IACI,UAAU,CAChB,QAAQ,EAAE,UAAU,EACpB,KAAK,EAAE;QAAE,UAAU,EAAE,MAAM,CAAC;QAAC,iBAAiB,EAAE,MAAM,CAAC;QAAC,YAAY,EAAE,OAAO,CAAA;KAAE,EAC/E,GAAG,GAAE,MAAwB,EAC7B,YAAY,CAAC,EAAE,UAAU,EACzB,SAAS,SAAmB,GAC1B,mBAAmB,GAAG,IAAI,CA4C5B;IAED;;;;;OAKG;IACI,aAAa,CACnB,QAAQ,EAAE,UAAU,EACpB,YAAY,EAAE,UAAU,EACxB,KAAK,SAAI,EACT,GAAG,GAAE,MAAwB,GAC3B,WAAW,EAAE,CAuFf;IAED;;;;;;OAMG;IACH,OAAc,UAAU,CAAC,OAAO,EAAE,UAAU,GAAG,iBAAiB,CAE/D;IAEM,MAAM,CAAC,QAAQ,SAAS,GAAG,MAAM,CAEvC;IAED,YAAY,KAAK,GAAE,sBAA4C,EAW9D;CACD"}

package/out/lib/core/CharacterSequence.js

@@ -0,0 +1,347 @@
+/**
+ * @copyright Sister Software
+ * @license MIT
+ * @author Teffen Ellis, et al.
+ */
+import { loadWasmModule, WASM_MAX_RESULTS, WASM_THRESHOLD, } from "./wasm_module.js";
+export function isArrayLike(input) {
+    return Boolean(input && typeof input === "object" && "length" in input);
+}
+export const Delimiters = {
+    Null: 0,
+    LineFeed: 10,
+    CarriageReturn: 13,
+    Comma: 44,
+    Tab: 9,
+    Space: 32,
+    One: 49,
+    Zero: 48,
+    DoubleQuote: 34,
+    RecordSeparator: 30,
+    Pipe: 124,
+};
+export const VisibleDelimiterMap = new Map([
+    [Delimiters.LineFeed, "\u2424"],
+    [Delimiters.CarriageReturn, "\u240D"],
+    [Delimiters.Comma, "-"],
+    [Delimiters.Tab, "\u2409"],
+    [Delimiters.Space, "\u2420"],
+    [Delimiters.DoubleQuote, '"'],
+    [Delimiters.RecordSeparator, "\u241E"],
+    [Delimiters.Null, "\u2400"],
+]);
+export function debugAsVisibleCharacters(delimiter) {
+    return Array.from(delimiter)
+        .map((c) => VisibleDelimiterMap.get(c) ?? String.fromCharCode(c))
+        .join("");
+}
+const encoder = new TextEncoder();
+export function normalizeCharacterInput(input) {
+    switch (typeof input) {
+        case "number":
+            if (!Number.isInteger(input))
+                throw new TypeError(`Numeric delimiters must be integers.`);
+            return Uint8Array.from([input]);
+        case "string":
+            return encoder.encode(input);
+        case "object":
+            // Typed arrays and buffers are adopted by reference where possible — a multi-megabyte
+            // haystack must not be copied on the way in. `ArrayBuffer` and `DataView` are declared
+            // inputs and previously threw: neither carries `length`, and neither is iterable.
+            if (input instanceof Uint8Array)
+                return input;
+            if (ArrayBuffer.isView(input))
+                return new Uint8Array(input.buffer, input.byteOffset, input.byteLength);
+            if (input instanceof ArrayBuffer)
+                return new Uint8Array(input);
+            // A plain array-like (`number[]`) is NOT a Uint8Array — copy it rather than hand back
+            // something whose `search` would index a boxed array.
+            if (isArrayLike(input))
+                return Uint8Array.from(input);
+            if (Symbol.iterator in input)
+                return Uint8Array.from(input);
+            throw new TypeError(`Invalid delimiter type.`);
+        default:
+            throw new TypeError(`Invalid delimiter type.`);
+    }
+}
+function ensureWasmCapacity(memory, required) {
+    if (required <= memory.buffer.byteLength)
+        return;
+    const pages = Math.ceil((required - memory.buffer.byteLength) / 65_536);
+    memory.grow(pages);
+}
+/**
+ * Round `offset` up to the next multiple of 4 — `Int32Array` views require a 4-byte-aligned base.
+ */
+function alignTo4(offset) {
+    return Math.ceil(offset / 4) * 4;
+}
+export class CharacterSequence extends Uint8Array {
+    #skipIndex;
+    static #wasmScanner;
+    static #wasmHaystack = null;
+    static #wasmPatternOffset = 0;
+    static #wasmReadyPromise;
+    static #loadWasm() {
+        if (CharacterSequence.#wasmReadyPromise === undefined) {
+            // Reflect "load in progress" synchronously so search()'s fast path stops
+            // re-triggering loads on every call while the module compiles.
+            if (CharacterSequence.#wasmScanner === undefined) {
+                CharacterSequence.#wasmScanner = null;
+            }
+            CharacterSequence.#wasmReadyPromise = loadWasmModule().then((mod) => {
+                CharacterSequence.#wasmScanner = mod;
+                return mod;
+            });
+        }
+        return CharacterSequence.#wasmReadyPromise;
+    }
+    static #ensureWasm() {
+        void CharacterSequence.#loadWasm();
+    }
+    /**
+     * Resolve once the WASM SIMD scanner has finished loading, yielding whether it is active.
+     *
+     * The module loads asynchronously, so synchronous callers (`Spliterator.fromSync`, `CSVSpliterator.from`) that run to
+     * completion in a single tick would otherwise always fall back to the JS scanner. Await this first to opt into SIMD
+     * acceleration.
+     */
+    static whenReady() {
+        return CharacterSequence.#loadWasm().then((mod) => mod !== null);
+    }
+    search(haystack, start = 0, end = haystack.length) {
+        const sequenceLength = this.length;
+        // Single-byte delimiters (newline, comma, tab — the common case) are far faster via
+        // the native indexOf than the per-match Boyer-Moore-Horspool loop below. indexOf has
+        // no end bound, so clamp the result to keep `end` exclusive.
+        if (sequenceLength === 1) {
+            const index = haystack.indexOf(this[0], start);
+            return index !== -1 && index < end ? index : -1;
+        }
+        if (sequenceLength > 1 && end - start >= WASM_THRESHOLD) {
+            const wasm = CharacterSequence.#wasmScanner;
+            if (wasm) {
+                // Cache the *entire* haystack at offset 0 (so WASM byte `i` === `haystack[i]`),
+                // keyed by identity. This keeps repeated searches over the same source (the
+                // Spliterator fill loop) copy-free while staying correct for any start/end — the
+                // previous "copy [start,end)" scheme mis-mapped offsets when start !== 0 and
+                // silently ignored a shrinking `end`.
+                if (haystack !== CharacterSequence.#wasmHaystack) {
+                    const fullLen = haystack.length;
+                    const totalNeeded = fullLen + sequenceLength;
+                    ensureWasmCapacity(wasm.memory, totalNeeded);
+                    const buffer = new Uint8Array(wasm.memory.buffer, 0, totalNeeded);
+                    buffer.set(haystack, 0);
+                    buffer.set(this, fullLen);
+                    CharacterSequence.#wasmHaystack = haystack;
+                    CharacterSequence.#wasmPatternOffset = fullLen;
+                }
+                const result = wasm.findDelimiter(start, end - start, CharacterSequence.#wasmPatternOffset, sequenceLength);
+                return result >= 0 ? start + result : -1;
+            }
+            if (CharacterSequence.#wasmScanner === undefined) {
+                CharacterSequence.#ensureWasm();
+            }
+        }
+        CharacterSequence.#wasmHaystack = null;
+        let startIndex = start;
+        while (startIndex <= end - sequenceLength) {
+            let lastIndex = sequenceLength - 1;
+            while (lastIndex >= 0 && this[lastIndex] === haystack[startIndex + lastIndex]) {
+                lastIndex--;
+            }
+            if (lastIndex < 0)
+                return startIndex;
+            startIndex += this.#skipIndex[haystack[startIndex + sequenceLength - 1]];
+        }
+        return -1;
+    }
+    searchAll(haystack, start = 0, end = haystack.length) {
+        const sequenceLength = this.length;
+        const haystackLen = end - start;
+        if (sequenceLength >= 1 && haystackLen >= WASM_THRESHOLD) {
+            const wasm = CharacterSequence.#wasmScanner;
+            if (wasm) {
+                const resultsOffset = alignTo4(haystackLen + sequenceLength);
+                const resultsSize = WASM_MAX_RESULTS * 2 * 4;
+                const totalNeeded = resultsOffset + resultsSize;
+                ensureWasmCapacity(wasm.memory, totalNeeded);
+                const buffer = new Uint8Array(wasm.memory.buffer, 0, totalNeeded);
+                buffer.set(haystack.subarray(start, end), 0);
+                buffer.set(this, haystackLen);
+                // We just overwrote offset 0; any haystack search() cached there is now stale.
+                CharacterSequence.#wasmHaystack = null;
+                const count = wasm.findAllDelimiters(0, haystackLen, haystackLen, sequenceLength, resultsOffset, WASM_MAX_RESULTS);
+                const rv = new Int32Array(wasm.memory.buffer, resultsOffset, count * 2);
+                const ranges = [];
+                for (let i = 0; i < count; i++) {
+                    ranges.push([start + rv[i * 2], start + rv[i * 2 + 1]]);
+                }
+                // A full results buffer means the scan may have hit the cap and dropped
+                // trailing delimiters; fall back to the uncapped JS scan rather than truncate.
+                if (count < WASM_MAX_RESULTS)
+                    return ranges;
+            }
+            if (CharacterSequence.#wasmScanner === undefined) {
+                CharacterSequence.#ensureWasm();
+            }
+        }
+        const ranges = [];
+        let searchStart = start, rangeStart = start;
+        while (searchStart <= end - sequenceLength) {
+            let lastIndex = sequenceLength - 1;
+            while (lastIndex >= 0 && this[lastIndex] === haystack[searchStart + lastIndex]) {
+                lastIndex--;
+            }
+            if (lastIndex < 0) {
+                ranges.push([rangeStart, searchStart]);
+                searchStart += sequenceLength;
+                rangeStart = searchStart;
+                continue;
+            }
+            searchStart += this.#skipIndex[haystack[searchStart + sequenceLength - 1]];
+        }
+        if (rangeStart <= end) {
+            ranges.push([rangeStart, end]);
+        }
+        return ranges;
+    }
+    /**
+     * Scan completed ranges in one bounded, resumable WASM call.
+     *
+     * This is the low-allocation streaming primitive: unlike {@link searchMatches}, it carries quote state and range
+     * boundaries through the native scan and exposes the packed result view directly. The returned view aliases shared
+     * WASM memory and must be consumed before another scanner call.
+     *
+     * Returns `null` when the SIMD module is unavailable, the delimiter/quote is not one byte, or the buffer is below the
+     * WASM threshold. Callers must retain their existing JavaScript path as the fallback.
+     */
+    scanRanges(haystack, state, end = haystack.length, quotePattern, maxRanges = WASM_MAX_RESULTS) {
+        if (this.length !== 1 || (quotePattern && quotePattern.length !== 1) || end < WASM_THRESHOLD || maxRanges < 1) {
+            return null;
+        }
+        const wasm = CharacterSequence.#wasmScanner;
+        if (!wasm) {
+            if (CharacterSequence.#wasmScanner === undefined) {
+                CharacterSequence.#ensureWasm();
+            }
+            return null;
+        }
+        const resultsOffset = alignTo4(end);
+        const resultValueCount = 3 + maxRanges * 2;
+        const totalNeeded = resultsOffset + resultValueCount * Int32Array.BYTES_PER_ELEMENT;
+        ensureWasmCapacity(wasm.memory, totalNeeded);
+        new Uint8Array(wasm.memory.buffer, 0, end).set(haystack.subarray(0, end));
+        CharacterSequence.#wasmHaystack = null;
+        const count = wasm.scanDelimitedRanges(0, end, state.scanCursor, state.pendingSliceStart, this[0], quotePattern?.[0] ?? -1, state.insideQuotes ? 1 : 0, resultsOffset, maxRanges);
+        const result = new Int32Array(wasm.memory.buffer, resultsOffset, 3 + count * 2);
+        return {
+            ranges: result.subarray(3),
+            count,
+            scanCursor: result[0],
+            pendingSliceStart: result[1],
+            insideQuotes: result[2] === 1,
+        };
+    }
+    /**
+     * Scan for two patterns simultaneously (delimiter + quote) for CSV parsing.
+     *
+     * Returns sorted MatchResult[] with patternId 0=delimiter, 1=quote. Uses WASM SIMD double-scan when available; JS
+     * fallback otherwise.
+     */
+    searchMatches(haystack, quotePattern, start = 0, end = haystack.length) {
+        const delimiterLen = this.length;
+        const quoteLen = quotePattern.length;
+        const haystackLen = end - start;
+        if (delimiterLen === 0 || haystackLen === 0)
+            return [];
+        const wasm = CharacterSequence.#wasmScanner;
+        if (wasm && haystackLen >= WASM_THRESHOLD) {
+            const patternsSize = delimiterLen + quoteLen;
+            const resultsOffset = alignTo4(haystackLen + patternsSize);
+            const resultsSize = WASM_MAX_RESULTS * 2 * 4;
+            const totalNeeded = resultsOffset + resultsSize;
+            ensureWasmCapacity(wasm.memory, totalNeeded);
+            const buffer = new Uint8Array(wasm.memory.buffer, 0, totalNeeded);
+            buffer.set(haystack.subarray(start, end), 0);
+            buffer.set(this, haystackLen);
+            buffer.set(quotePattern, haystackLen + delimiterLen);
+            // We just overwrote offset 0; any haystack search() cached there is now stale.
+            CharacterSequence.#wasmHaystack = null;
+            const count = wasm.findAllMatches(0, haystackLen, haystackLen, delimiterLen, quoteLen, resultsOffset, WASM_MAX_RESULTS);
+            const rv = new Int32Array(wasm.memory.buffer, resultsOffset, count * 2);
+            const matches = [];
+            for (let i = 0; i < count; i++) {
+                matches.push({ offset: start + rv[i * 2], patternId: rv[i * 2 + 1] });
+            }
+            // A full results buffer means the scan may have hit the cap and dropped
+            // trailing matches; fall back to the uncapped JS scan rather than truncate.
+            if (count < WASM_MAX_RESULTS)
+                return matches;
+        }
+        if (CharacterSequence.#wasmScanner === undefined) {
+            CharacterSequence.#ensureWasm();
+        }
+        // JS fallback: scan both patterns independently and merge in offset order. Both
+        // searches honour `end` exclusivity and handle multi-byte patterns (the quote is
+        // wrapped in a CharacterSequence so it isn't limited to a single byte).
+        //
+        // Each pattern's next hit is carried across iterations and re-searched only once the
+        // cursor has passed it. Re-searching both every iteration is quadratic: a `search` that
+        // finds nothing has scanned all the way to `end` to say so, and a source containing no
+        // quote at all pays that whole scan once per delimiter. A `-1` is final for the rest of
+        // the range and must never be re-searched.
+        const matches = [];
+        const quoteSeq = CharacterSequence.asSequence(quotePattern);
+        let searchStart = start;
+        let delimiterIndex = this.search(haystack, searchStart, end);
+        let quoteIndex = quoteSeq.search(haystack, searchStart, end);
+        while (delimiterIndex >= 0 || quoteIndex >= 0) {
+            if (delimiterIndex >= 0 && (quoteIndex < 0 || delimiterIndex <= quoteIndex)) {
+                matches.push({ offset: delimiterIndex, patternId: 0 });
+                searchStart = delimiterIndex + delimiterLen;
+                delimiterIndex = this.search(haystack, searchStart, end);
+                // Patterns longer than a byte can overlap, so a carried quote hit that the delimiter's
+                // span just swallowed is stale. Single-byte patterns never enter this branch.
+                if (quoteIndex >= 0 && quoteIndex < searchStart) {
+                    quoteIndex = quoteSeq.search(haystack, searchStart, end);
+                }
+            }
+            else {
+                matches.push({ offset: quoteIndex, patternId: 1 });
+                searchStart = quoteIndex + quoteLen;
+                quoteIndex = quoteSeq.search(haystack, searchStart, end);
+                if (delimiterIndex >= 0 && delimiterIndex < searchStart) {
+                    delimiterIndex = this.search(haystack, searchStart, end);
+                }
+            }
+        }
+        return matches;
+    }
+    /**
+     * Adopt a pattern as a sequence, reusing it when it already is one.
+     *
+     * Constructing a sequence builds a 256-entry skip table, so wrapping unconditionally puts that allocation on every
+     * call of a per-row scan. Every in-tree caller of {@linkcode searchMatches} already holds a long-lived sequence for
+     * its quote pattern.
+     */
+    static asSequence(pattern) {
+        return pattern instanceof CharacterSequence ? pattern : new CharacterSequence(pattern);
+    }
+    decode(encoding = "utf8") {
+        return new TextDecoder(encoding).decode(this);
+    }
+    constructor(input = Delimiters.LineFeed) {
+        const bytes = normalizeCharacterInput(input);
+        super(bytes);
+        // `new Array(256).fill(…)` rather than `Array.from({length: 256}, …)`: same result, no
+        // per-entry callback, and this runs for every sequence constructed.
+        // oxlint-disable-next-line unicorn/no-new-array
+        this.#skipIndex = new Array(256).fill(this.length);
+        for (let i = 0; i < this.length - 1; i++) {
+            this.#skipIndex[this[i]] = this.length - 1 - i;
+        }
+    }
+}
+//# sourceMappingURL=CharacterSequence.js.map

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

@@ -0,0 +1 @@
+{"version":3,"file":"CharacterSequence.js","sourceRoot":"","sources":["../../../lib/core/CharacterSequence.ts"],"names":[],"mappings":"AAAA;;;;GAIG;AAKH,OAAO,EACN,cAAc,EACd,gBAAgB,EAChB,cAAc,GAKd,MAAM,kBAAkB,CAAA;AAEzB,MAAM,UAAU,WAAW,CAAI,KAAc;IAC5C,OAAO,OAAO,CAAC,KAAK,IAAI,OAAO,KAAK,KAAK,QAAQ,IAAI,QAAQ,IAAI,KAAK,CAAC,CAAA;AACxE,CAAC;AAWD,MAAM,CAAC,MAAM,UAAU,GAAG;IACzB,IAAI,EAAE,CAAC;IACP,QAAQ,EAAE,EAAE;IACZ,cAAc,EAAE,EAAE;IAClB,KAAK,EAAE,EAAE;IACT,GAAG,EAAE,CAAC;IACN,KAAK,EAAE,EAAE;IACT,GAAG,EAAE,EAAE;IACP,IAAI,EAAE,EAAE;IACR,WAAW,EAAE,EAAE;IACf,eAAe,EAAE,EAAE;IACnB,IAAI,EAAE,GAAG;CACiC,CAAA;AAE3C,MAAM,CAAC,MAAM,mBAAmB,GAAG,IAAI,GAAG,CAAiB;IAC1D,CAAC,UAAU,CAAC,QAAQ,EAAE,QAAQ,CAAC;IAC/B,CAAC,UAAU,CAAC,cAAc,EAAE,QAAQ,CAAC;IACrC,CAAC,UAAU,CAAC,KAAK,EAAE,GAAG,CAAC;IACvB,CAAC,UAAU,CAAC,GAAG,EAAE,QAAQ,CAAC;IAC1B,CAAC,UAAU,CAAC,KAAK,EAAE,QAAQ,CAAC;IAC5B,CAAC,UAAU,CAAC,WAAW,EAAE,GAAG,CAAC;IAC7B,CAAC,UAAU,CAAC,eAAe,EAAE,QAAQ,CAAC;IACtC,CAAC,UAAU,CAAC,IAAI,EAAE,QAAQ,CAAC;CAC3B,CAAC,CAAA;AAEF,MAAM,UAAU,wBAAwB,CAAC,SAAqB;IAC7D,OAAO,KAAK,CAAC,IAAI,CAAC,SAAS,CAAC;SAC1B,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,mBAAmB,CAAC,GAAG,CAAC,CAAC,CAAC,IAAI,MAAM,CAAC,YAAY,CAAC,CAAC,CAAC,CAAC;SAChE,IAAI,CAAC,EAAE,CAAC,CAAA;AACX,CAAC;AAED,MAAM,OAAO,GAAG,IAAI,WAAW,EAAE,CAAA;AAEjC,MAAM,UAAU,uBAAuB,CAAC,KAA6B;IACpE,QAAQ,OAAO,KAAK,EAAE,CAAC;QACtB,KAAK,QAAQ;YACZ,IAAI,CAAC,MAAM,CAAC,SAAS,CAAC,KAAK,CAAC;gBAAE,MAAM,IAAI,SAAS,CAAC,sCAAsC,CAAC,CAAA;YACzF,OAAO,UAAU,CAAC,IAAI,CAAC,CAAC,KAAK,CAAC,CAAC,CAAA;QAChC,KAAK,QAAQ;YACZ,OAAO,OAAO,CAAC,MAAM,CAAC,KAAK,CAAC,CAAA;QAC7B,KAAK,QAAQ;YACZ,sFAAsF;YACtF,uFAAuF;YACvF,kFAAkF;YAClF,IAAI,KAAK,YAAY,UAAU;gBAAE,OAAO,KAAK,CAAA;YAC7C,IAAI,WAAW,CAAC,MAAM,CAAC,KAAK,CAAC;gBAAE,OAAO,IAAI,UAAU,CAAC,KAAK,CAAC,MAAM,EAAE,KAAK,CAAC,UAAU,EAAE,KAAK,CAAC,UAAU,CAAC,CAAA;YACtG,IAAI,KAAK,YAAY,WAAW;gBAAE,OAAO,IAAI,UAAU,CAAC,KAAK,CAAC,CAAA;YAC9D,sFAAsF;YACtF,sDAAsD;YACtD,IAAI,WAAW,CAAS,KAAK,CAAC;gBAAE,OAAO,UAAU,CAAC,IAAI,CAAC,KAAK,CAAC,CAAA;YAC7D,IAAI,MAAM,CAAC,QAAQ,IAAI,KAAK;gBAAE,OAAO,UAAU,CAAC,IAAI,CAAC,KAAK,CAAC,CAAA;YAC3D,MAAM,IAAI,SAAS,CAAC,yBAAyB,CAAC,CAAA;QAC/C;YACC,MAAM,IAAI,SAAS,CAAC,yBAAyB,CAAC,CAAA;IAChD,CAAC;AACF,CAAC;AAED,SAAS,kBAAkB,CAAC,MAAkB,EAAE,QAAgB;IAC/D,IAAI,QAAQ,IAAI,MAAM,CAAC,MAAM,CAAC,UAAU;QAAE,OAAM;IAChD,MAAM,KAAK,GAAG,IAAI,CAAC,IAAI,CAAC,CAAC,QAAQ,GAAG,MAAM,CAAC,MAAM,CAAC,UAAU,CAAC,GAAG,MAAM,CAAC,CAAA;IACvE,MAAM,CAAC,IAAI,CAAC,KAAK,CAAC,CAAA;AACnB,CAAC;AAED;;GAEG;AACH,SAAS,QAAQ,CAAC,MAAc;IAC/B,OAAO,IAAI,CAAC,IAAI,CAAC,MAAM,GAAG,CAAC,CAAC,GAAG,CAAC,CAAA;AACjC,CAAC;AAED,MAAM,OAAO,iBAAkB,SAAQ,UAAU;IAChD,UAAU,CAAU;IAEpB,MAAM,CAAC,YAAY,CAAyC;IAC5D,MAAM,CAAC,aAAa,GAAsB,IAAI,CAAA;IAC9C,MAAM,CAAC,kBAAkB,GAAG,CAAC,CAAA;IAC7B,MAAM,CAAC,iBAAiB,CAAkD;IAE1E,MAAM,CAAC,SAAS;QACf,IAAI,iBAAiB,CAAC,iBAAiB,KAAK,SAAS,EAAE,CAAC;YACvD,yEAAyE;YACzE,+DAA+D;YAC/D,IAAI,iBAAiB,CAAC,YAAY,KAAK,SAAS,EAAE,CAAC;gBAClD,iBAAiB,CAAC,YAAY,GAAG,IAAI,CAAA;YACtC,CAAC;YAED,iBAAiB,CAAC,iBAAiB,GAAG,cAAc,EAAE,CAAC,IAAI,CAAC,CAAC,GAAG,EAAE,EAAE;gBACnE,iBAAiB,CAAC,YAAY,GAAG,GAAG,CAAA;gBAEpC,OAAO,GAAG,CAAA;YACX,CAAC,CAAC,CAAA;QACH,CAAC;QAED,OAAO,iBAAiB,CAAC,iBAAiB,CAAA;IAC3C,CAAC;IAED,MAAM,CAAC,WAAW;QACjB,KAAK,iBAAiB,CAAC,SAAS,EAAE,CAAA;IACnC,CAAC;IAED;;;;;;OAMG;IACI,MAAM,CAAC,SAAS;QACtB,OAAO,iBAAiB,CAAC,SAAS,EAAE,CAAC,IAAI,CAAC,CAAC,GAAG,EAAE,EAAE,CAAC,GAAG,KAAK,IAAI,CAAC,CAAA;IACjE,CAAC;IAEM,MAAM,CAAC,QAAoB,EAAE,KAAK,GAAG,CAAC,EAAE,GAAG,GAAW,QAAQ,CAAC,MAAM;QAC3E,MAAM,cAAc,GAAG,IAAI,CAAC,MAAM,CAAA;QAElC,oFAAoF;QACpF,qFAAqF;QACrF,6DAA6D;QAC7D,IAAI,cAAc,KAAK,CAAC,EAAE,CAAC;YAC1B,MAAM,KAAK,GAAG,QAAQ,CAAC,OAAO,CAAC,IAAI,CAAC,CAAC,CAAE,EAAE,KAAK,CAAC,CAAA;YAE/C,OAAO,KAAK,KAAK,CAAC,CAAC,IAAI,KAAK,GAAG,GAAG,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC,CAAA;QAChD,CAAC;QAED,IAAI,cAAc,GAAG,CAAC,IAAI,GAAG,GAAG,KAAK,IAAI,cAAc,EAAE,CAAC;YACzD,MAAM,IAAI,GAAG,iBAAiB,CAAC,YAAY,CAAA;YAE3C,IAAI,IAAI,EAAE,CAAC;gBACV,gFAAgF;gBAChF,4EAA4E;gBAC5E,iFAAiF;gBACjF,6EAA6E;gBAC7E,sCAAsC;gBACtC,IAAI,QAAQ,KAAK,iBAAiB,CAAC,aAAa,EAAE,CAAC;oBAClD,MAAM,OAAO,GAAG,QAAQ,CAAC,MAAM,CAAA;oBAC/B,MAAM,WAAW,GAAG,OAAO,GAAG,cAAc,CAAA;oBAC5C,kBAAkB,CAAC,IAAI,CAAC,MAAM,EAAE,WAAW,CAAC,CAAA;oBAC5C,MAAM,MAAM,GAAG,IAAI,UAAU,CAAC,IAAI,CAAC,MAAM,CAAC,MAAM,EAAE,CAAC,EAAE,WAAW,CAAC,CAAA;oBACjE,MAAM,CAAC,GAAG,CAAC,QAAQ,EAAE,CAAC,CAAC,CAAA;oBACvB,MAAM,CAAC,GAAG,CAAC,IAAI,EAAE,OAAO,CAAC,CAAA;oBACzB,iBAAiB,CAAC,aAAa,GAAG,QAAQ,CAAA;oBAC1C,iBAAiB,CAAC,kBAAkB,GAAG,OAAO,CAAA;gBAC/C,CAAC;gBAED,MAAM,MAAM,GAAG,IAAI,CAAC,aAAa,CAAC,KAAK,EAAE,GAAG,GAAG,KAAK,EAAE,iBAAiB,CAAC,kBAAkB,EAAE,cAAc,CAAC,CAAA;gBAE3G,OAAO,MAAM,IAAI,CAAC,CAAC,CAAC,CAAC,KAAK,GAAG,MAAM,CAAC,CAAC,CAAC,CAAC,CAAC,CAAA;YACzC,CAAC;YAED,IAAI,iBAAiB,CAAC,YAAY,KAAK,SAAS,EAAE,CAAC;gBAClD,iBAAiB,CAAC,WAAW,EAAE,CAAA;YAChC,CAAC;QACF,CAAC;QAED,iBAAiB,CAAC,aAAa,GAAG,IAAI,CAAA;QACtC,IAAI,UAAU,GAAG,KAAK,CAAA;QAEtB,OAAO,UAAU,IAAI,GAAG,GAAG,cAAc,EAAE,CAAC;YAC3C,IAAI,SAAS,GAAG,cAAc,GAAG,CAAC,CAAA;YAElC,OAAO,SAAS,IAAI,CAAC,IAAI,IAAI,CAAC,SAAS,CAAC,KAAK,QAAQ,CAAC,UAAU,GAAG,SAAS,CAAC,EAAE,CAAC;gBAC/E,SAAS,EAAE,CAAA;YACZ,CAAC;YAED,IAAI,SAAS,GAAG,CAAC;gBAAE,OAAO,UAAU,CAAA;YACpC,UAAU,IAAI,IAAI,CAAC,UAAU,CAAC,QAAQ,CAAC,UAAU,GAAG,cAAc,GAAG,CAAC,CAAE,CAAE,CAAA;QAC3E,CAAC;QAED,OAAO,CAAC,CAAC,CAAA;IACV,CAAC;IAEM,SAAS,CAAC,QAAoB,EAAE,KAAK,GAAG,CAAC,EAAE,GAAG,GAAG,QAAQ,CAAC,MAAM;QACtE,MAAM,cAAc,GAAG,IAAI,CAAC,MAAM,CAAA;QAClC,MAAM,WAAW,GAAG,GAAG,GAAG,KAAK,CAAA;QAE/B,IAAI,cAAc,IAAI,CAAC,IAAI,WAAW,IAAI,cAAc,EAAE,CAAC;YAC1D,MAAM,IAAI,GAAG,iBAAiB,CAAC,YAAY,CAAA;YAE3C,IAAI,IAAI,EAAE,CAAC;gBACV,MAAM,aAAa,GAAG,QAAQ,CAAC,WAAW,GAAG,cAAc,CAAC,CAAA;gBAC5D,MAAM,WAAW,GAAG,gBAAgB,GAAG,CAAC,GAAG,CAAC,CAAA;gBAC5C,MAAM,WAAW,GAAG,aAAa,GAAG,WAAW,CAAA;gBAC/C,kBAAkB,CAAC,IAAI,CAAC,MAAM,EAAE,WAAW,CAAC,CAAA;gBAC5C,MAAM,MAAM,GAAG,IAAI,UAAU,CAAC,IAAI,CAAC,MAAM,CAAC,MAAM,EAAE,CAAC,EAAE,WAAW,CAAC,CAAA;gBACjE,MAAM,CAAC,GAAG,CAAC,QAAQ,CAAC,QAAQ,CAAC,KAAK,EAAE,GAAG,CAAC,EAAE,CAAC,CAAC,CAAA;gBAC5C,MAAM,CAAC,GAAG,CAAC,IAAI,EAAE,WAAW,CAAC,CAAA;gBAC7B,+EAA+E;gBAC/E,iBAAiB,CAAC,aAAa,GAAG,IAAI,CAAA;gBAEtC,MAAM,KAAK,GAAG,IAAI,CAAC,iBAAiB,CACnC,CAAC,EACD,WAAW,EACX,WAAW,EACX,cAAc,EACd,aAAa,EACb,gBAAgB,CAChB,CAAA;gBAED,MAAM,EAAE,GAAG,IAAI,UAAU,CAAC,IAAI,CAAC,MAAM,CAAC,MAAM,EAAE,aAAa,EAAE,KAAK,GAAG,CAAC,CAAC,CAAA;gBACvE,MAAM,MAAM,GAAgB,EAAE,CAAA;gBAE9B,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,KAAK,EAAE,CAAC,EAAE,EAAE,CAAC;oBAChC,MAAM,CAAC,IAAI,CAAC,CAAC,KAAK,GAAG,EAAE,CAAC,CAAC,GAAG,CAAC,CAAE,EAAE,KAAK,GAAG,EAAE,CAAC,CAAC,GAAG,CAAC,GAAG,CAAC,CAAE,CAAC,CAAC,CAAA;gBAC1D,CAAC;gBAED,wEAAwE;gBACxE,+EAA+E;gBAC/E,IAAI,KAAK,GAAG,gBAAgB;oBAAE,OAAO,MAAM,CAAA;YAC5C,CAAC;YAED,IAAI,iBAAiB,CAAC,YAAY,KAAK,SAAS,EAAE,CAAC;gBAClD,iBAAiB,CAAC,WAAW,EAAE,CAAA;YAChC,CAAC;QACF,CAAC;QAED,MAAM,MAAM,GAAgB,EAAE,CAAA;QAE9B,IAAI,WAAW,GAAG,KAAK,EACtB,UAAU,GAAG,KAAK,CAAA;QAEnB,OAAO,WAAW,IAAI,GAAG,GAAG,cAAc,EAAE,CAAC;YAC5C,IAAI,SAAS,GAAG,cAAc,GAAG,CAAC,CAAA;YAElC,OAAO,SAAS,IAAI,CAAC,IAAI,IAAI,CAAC,SAAS,CAAC,KAAK,QAAQ,CAAC,WAAW,GAAG,SAAS,CAAC,EAAE,CAAC;gBAChF,SAAS,EAAE,CAAA;YACZ,CAAC;YAED,IAAI,SAAS,GAAG,CAAC,EAAE,CAAC;gBACnB,MAAM,CAAC,IAAI,CAAC,CAAC,UAAU,EAAE,WAAW,CAAC,CAAC,CAAA;gBACtC,WAAW,IAAI,cAAc,CAAA;gBAC7B,UAAU,GAAG,WAAW,CAAA;gBAExB,SAAQ;YACT,CAAC;YAED,WAAW,IAAI,IAAI,CAAC,UAAU,CAAC,QAAQ,CAAC,WAAW,GAAG,cAAc,GAAG,CAAC,CAAE,CAAE,CAAA;QAC7E,CAAC;QAED,IAAI,UAAU,IAAI,GAAG,EAAE,CAAC;YACvB,MAAM,CAAC,IAAI,CAAC,CAAC,UAAU,EAAE,GAAG,CAAC,CAAC,CAAA;QAC/B,CAAC;QAED,OAAO,MAAM,CAAA;IACd,CAAC;IAED;;;;;;;;;OASG;IACI,UAAU,CAChB,QAAoB,EACpB,KAA+E,EAC/E,GAAG,GAAW,QAAQ,CAAC,MAAM,EAC7B,YAAyB,EACzB,SAAS,GAAG,gBAAgB;QAE5B,IAAI,IAAI,CAAC,MAAM,KAAK,CAAC,IAAI,CAAC,YAAY,IAAI,YAAY,CAAC,MAAM,KAAK,CAAC,CAAC,IAAI,GAAG,GAAG,cAAc,IAAI,SAAS,GAAG,CAAC,EAAE,CAAC;YAC/G,OAAO,IAAI,CAAA;QACZ,CAAC;QAED,MAAM,IAAI,GAAG,iBAAiB,CAAC,YAAY,CAAA;QAE3C,IAAI,CAAC,IAAI,EAAE,CAAC;YACX,IAAI,iBAAiB,CAAC,YAAY,KAAK,SAAS,EAAE,CAAC;gBAClD,iBAAiB,CAAC,WAAW,EAAE,CAAA;YAChC,CAAC;YAED,OAAO,IAAI,CAAA;QACZ,CAAC;QAED,MAAM,aAAa,GAAG,QAAQ,CAAC,GAAG,CAAC,CAAA;QACnC,MAAM,gBAAgB,GAAG,CAAC,GAAG,SAAS,GAAG,CAAC,CAAA;QAC1C,MAAM,WAAW,GAAG,aAAa,GAAG,gBAAgB,GAAG,UAAU,CAAC,iBAAiB,CAAA;QAEnF,kBAAkB,CAAC,IAAI,CAAC,MAAM,EAAE,WAAW,CAAC,CAAA;QAC5C,IAAI,UAAU,CAAC,IAAI,CAAC,MAAM,CAAC,MAAM,EAAE,CAAC,EAAE,GAAG,CAAC,CAAC,GAAG,CAAC,QAAQ,CAAC,QAAQ,CAAC,CAAC,EAAE,GAAG,CAAC,CAAC,CAAA;QACzE,iBAAiB,CAAC,aAAa,GAAG,IAAI,CAAA;QAEtC,MAAM,KAAK,GAAG,IAAI,CAAC,mBAAmB,CACrC,CAAC,EACD,GAAG,EACH,KAAK,CAAC,UAAU,EAChB,KAAK,CAAC,iBAAiB,EACvB,IAAI,CAAC,CAAC,CAAE,EACR,YAAY,EAAE,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,EACvB,KAAK,CAAC,YAAY,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,EAC1B,aAAa,EACb,SAAS,CACT,CAAA;QAED,MAAM,MAAM,GAAG,IAAI,UAAU,CAAC,IAAI,CAAC,MAAM,CAAC,MAAM,EAAE,aAAa,EAAE,CAAC,GAAG,KAAK,GAAG,CAAC,CAAC,CAAA;QAE/E,OAAO;YACN,MAAM,EAAE,MAAM,CAAC,QAAQ,CAAC,CAAC,CAAC;YAC1B,KAAK;YACL,UAAU,EAAE,MAAM,CAAC,CAAC,CAAE;YACtB,iBAAiB,EAAE,MAAM,CAAC,CAAC,CAAE;YAC7B,YAAY,EAAE,MAAM,CAAC,CAAC,CAAC,KAAK,CAAC;SAC7B,CAAA;IACF,CAAC;IAED;;;;;OAKG;IACI,aAAa,CACnB,QAAoB,EACpB,YAAwB,EACxB,KAAK,GAAG,CAAC,EACT,GAAG,GAAW,QAAQ,CAAC,MAAM;QAE7B,MAAM,YAAY,GAAG,IAAI,CAAC,MAAM,CAAA;QAChC,MAAM,QAAQ,GAAG,YAAY,CAAC,MAAM,CAAA;QACpC,MAAM,WAAW,GAAG,GAAG,GAAG,KAAK,CAAA;QAE/B,IAAI,YAAY,KAAK,CAAC,IAAI,WAAW,KAAK,CAAC;YAAE,OAAO,EAAE,CAAA;QAEtD,MAAM,IAAI,GAAG,iBAAiB,CAAC,YAAY,CAAA;QAE3C,IAAI,IAAI,IAAI,WAAW,IAAI,cAAc,EAAE,CAAC;YAC3C,MAAM,YAAY,GAAG,YAAY,GAAG,QAAQ,CAAA;YAC5C,MAAM,aAAa,GAAG,QAAQ,CAAC,WAAW,GAAG,YAAY,CAAC,CAAA;YAC1D,MAAM,WAAW,GAAG,gBAAgB,GAAG,CAAC,GAAG,CAAC,CAAA;YAC5C,MAAM,WAAW,GAAG,aAAa,GAAG,WAAW,CAAA;YAE/C,kBAAkB,CAAC,IAAI,CAAC,MAAM,EAAE,WAAW,CAAC,CAAA;YAC5C,MAAM,MAAM,GAAG,IAAI,UAAU,CAAC,IAAI,CAAC,MAAM,CAAC,MAAM,EAAE,CAAC,EAAE,WAAW,CAAC,CAAA;YACjE,MAAM,CAAC,GAAG,CAAC,QAAQ,CAAC,QAAQ,CAAC,KAAK,EAAE,GAAG,CAAC,EAAE,CAAC,CAAC,CAAA;YAC5C,MAAM,CAAC,GAAG,CAAC,IAAI,EAAE,WAAW,CAAC,CAAA;YAC7B,MAAM,CAAC,GAAG,CAAC,YAAY,EAAE,WAAW,GAAG,YAAY,CAAC,CAAA;YACpD,+EAA+E;YAC/E,iBAAiB,CAAC,aAAa,GAAG,IAAI,CAAA;YAEtC,MAAM,KAAK,GAAG,IAAI,CAAC,cAAc,CAChC,CAAC,EACD,WAAW,EACX,WAAW,EACX,YAAY,EACZ,QAAQ,EACR,aAAa,EACb,gBAAgB,CAChB,CAAA;YAED,MAAM,EAAE,GAAG,IAAI,UAAU,CAAC,IAAI,CAAC,MAAM,CAAC,MAAM,EAAE,aAAa,EAAE,KAAK,GAAG,CAAC,CAAC,CAAA;YACvE,MAAM,OAAO,GAAkB,EAAE,CAAA;YAEjC,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,KAAK,EAAE,CAAC,EAAE,EAAE,CAAC;gBAChC,OAAO,CAAC,IAAI,CAAC,EAAE,MAAM,EAAE,KAAK,GAAG,EAAE,CAAC,CAAC,GAAG,CAAC,CAAE,EAAE,SAAS,EAAE,EAAE,CAAC,CAAC,GAAG,CAAC,GAAG,CAAC,CAAE,EAAE,CAAC,CAAA;YACxE,CAAC;YAED,wEAAwE;YACxE,4EAA4E;YAC5E,IAAI,KAAK,GAAG,gBAAgB;gBAAE,OAAO,OAAO,CAAA;QAC7C,CAAC;QAED,IAAI,iBAAiB,CAAC,YAAY,KAAK,SAAS,EAAE,CAAC;YAClD,iBAAiB,CAAC,WAAW,EAAE,CAAA;QAChC,CAAC;QAED,gFAAgF;QAChF,iFAAiF;QACjF,wEAAwE;QACxE,EAAE;QACF,qFAAqF;QACrF,wFAAwF;QACxF,uFAAuF;QACvF,wFAAwF;QACxF,2CAA2C;QAC3C,MAAM,OAAO,GAAkB,EAAE,CAAA;QACjC,MAAM,QAAQ,GAAG,iBAAiB,CAAC,UAAU,CAAC,YAAY,CAAC,CAAA;QAC3D,IAAI,WAAW,GAAG,KAAK,CAAA;QACvB,IAAI,cAAc,GAAG,IAAI,CAAC,MAAM,CAAC,QAAQ,EAAE,WAAW,EAAE,GAAG,CAAC,CAAA;QAC5D,IAAI,UAAU,GAAG,QAAQ,CAAC,MAAM,CAAC,QAAQ,EAAE,WAAW,EAAE,GAAG,CAAC,CAAA;QAE5D,OAAO,cAAc,IAAI,CAAC,IAAI,UAAU,IAAI,CAAC,EAAE,CAAC;YAC/C,IAAI,cAAc,IAAI,CAAC,IAAI,CAAC,UAAU,GAAG,CAAC,IAAI,cAAc,IAAI,UAAU,CAAC,EAAE,CAAC;gBAC7E,OAAO,CAAC,IAAI,CAAC,EAAE,MAAM,EAAE,cAAc,EAAE,SAAS,EAAE,CAAC,EAAE,CAAC,CAAA;gBACtD,WAAW,GAAG,cAAc,GAAG,YAAY,CAAA;gBAC3C,cAAc,GAAG,IAAI,CAAC,MAAM,CAAC,QAAQ,EAAE,WAAW,EAAE,GAAG,CAAC,CAAA;gBAExD,uFAAuF;gBACvF,8EAA8E;gBAC9E,IAAI,UAAU,IAAI,CAAC,IAAI,UAAU,GAAG,WAAW,EAAE,CAAC;oBACjD,UAAU,GAAG,QAAQ,CAAC,MAAM,CAAC,QAAQ,EAAE,WAAW,EAAE,GAAG,CAAC,CAAA;gBACzD,CAAC;YACF,CAAC;iBAAM,CAAC;gBACP,OAAO,CAAC,IAAI,CAAC,EAAE,MAAM,EAAE,UAAU,EAAE,SAAS,EAAE,CAAC,EAAE,CAAC,CAAA;gBAClD,WAAW,GAAG,UAAU,GAAG,QAAQ,CAAA;gBACnC,UAAU,GAAG,QAAQ,CAAC,MAAM,CAAC,QAAQ,EAAE,WAAW,EAAE,GAAG,CAAC,CAAA;gBAExD,IAAI,cAAc,IAAI,CAAC,IAAI,cAAc,GAAG,WAAW,EAAE,CAAC;oBACzD,cAAc,GAAG,IAAI,CAAC,MAAM,CAAC,QAAQ,EAAE,WAAW,EAAE,GAAG,CAAC,CAAA;gBACzD,CAAC;YACF,CAAC;QACF,CAAC;QAED,OAAO,OAAO,CAAA;IACf,CAAC;IAED;;;;;;OAMG;IACI,MAAM,CAAC,UAAU,CAAC,OAAmB;QAC3C,OAAO,OAAO,YAAY,iBAAiB,CAAC,CAAC,CAAC,OAAO,CAAC,CAAC,CAAC,IAAI,iBAAiB,CAAC,OAAO,CAAC,CAAA;IACvF,CAAC;IAEM,MAAM,CAAC,QAAQ,GAAG,MAAM;QAC9B,OAAO,IAAI,WAAW,CAAC,QAAQ,CAAC,CAAC,MAAM,CAAC,IAAI,CAAC,CAAA;IAC9C,CAAC;IAED,YAAY,KAAK,GAA2B,UAAU,CAAC,QAAQ;QAC9D,MAAM,KAAK,GAAG,uBAAuB,CAAC,KAAK,CAAC,CAAA;QAC5C,KAAK,CAAC,KAAK,CAAC,CAAA;QACZ,uFAAuF;QACvF,oEAAoE;QACpE,gDAAgD;QAChD,IAAI,CAAC,UAAU,GAAG,IAAI,KAAK,CAAS,GAAG,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,MAAM,CAAC,CAAA;QAE1D,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,IAAI,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC;YAC1C,IAAI,CAAC,UAAU,CAAC,IAAI,CAAC,CAAC,CAAE,CAAC,GAAG,IAAI,CAAC,MAAM,GAAG,CAAC,GAAG,CAAC,CAAA;QAChD,CAAC;IACF,CAAC;CACD"}