spliterator 2.2.2 → 3.0.0

package/out/lib/CharacterSequence.d.ts

@@ -1,97 +1,48 @@
 /**
  * @copyright Sister Software
- * @license AGPL-3.0
+ * @license MIT
  * @author Teffen Ellis, et al.
  */
-/**
- * Type-predicate to determine if a value is an array-like object.
- */
+import type { ByteRange } from "./shared.js";
+import { type MatchResult } from "./wasm_module.js";
 export declare function isArrayLike<T>(input: unknown): input is ArrayLike<T>;
-/**
- * A possible input for a delimiter:
- *
- * - A single character code.
- * - A string of characters.
- * - An array of character codes.
- * - A buffer.
- * - An iterable of character codes.
- */
 export type CharacterSequenceInput = number | string | DataView | ArrayBuffer | Buffer | Iterable<number>;
-/**
- * Common delimiter values.
- */
 export declare const Delimiters: {
-    /**
-     * Null (␀)
-     */
     readonly Null: 0;
-    /**
-     * Newline (␊)
-     */
     readonly LineFeed: 10;
-    /**
-     * Carriage return (␍)
-     */
     readonly CarriageReturn: 13;
-    /**
-     * Comma (–)
-     */
     readonly Comma: 44;
-    /**
-     * Tab (␉)
-     */
     readonly Tab: 9;
-    /**
-     * Space (␠)
-     */
     readonly Space: 32;
-    /**
-     * One (1)
-     */
     readonly One: 49;
-    /**
-     * Zero (0)
-     */
     readonly Zero: 48;
-    /**
-     * Double quote (")
-     */
     readonly DoubleQuote: 34;
-    /**
-     * Record separator (␞)
-     */
     readonly RecordSeparator: 30;
-    /**
-     * Pipe (|)
-     */
     readonly Pipe: 124;
 };
 export declare const VisibleDelimiterMap: Map<number, string>;
 export declare function debugAsVisibleCharacters(delimiter: Uint8Array): string;
 export declare function normalizeCharacterInput(input: CharacterSequenceInput): Uint8Array;
-/**
- * An encoded sequence of characters, typically bytes representing a delimiter.
- *
- * Unlike a string, this class is optimized for searching and slicing.
- *
- * This also allows for multi-byte delimiters, such as CRLF or unicode characters.
- */
 export declare class CharacterSequence extends Uint8Array {
     #private;
     /**
-     * Perform a Boyer-Moore-Horspool search for the pattern in the text.
+     * Resolve once the WASM SIMD scanner has finished loading, yielding whether it is active.
      *
-     * @param haystack The encoded text to search.
-     * @param start The byte index to start searching from.
-     * @param end The byte index to stop searching at.
-     *
-     * @returns The byte index of the pattern in the text, or -1 if not found.
+     * 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;
-    decode(encoding?: string): string;
+    searchAll(haystack: Uint8Array, start?: number, end?: number): ByteRange[];
     /**
-     * Create a new character sequence from a delimiter.
+     * 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[];
+    decode(encoding?: string): string;
     constructor(input?: CharacterSequenceInput);
 }
 //# sourceMappingURL=CharacterSequence.d.ts.map

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

@@ -1 +1 @@
-{"version":3,"file":"CharacterSequence.d.ts","sourceRoot":"","sources":["../../lib/CharacterSequence.ts"],"names":[],"mappings":"AAAA;;;;GAIG;AAEH;;GAEG;AACH,wBAAgB,WAAW,CAAC,CAAC,EAAE,KAAK,EAAE,OAAO,GAAG,KAAK,IAAI,SAAS,CAAC,CAAC,CAAC,CAEpE;AAED;;;;;;;;GAQG;AACH,MAAM,MAAM,sBAAsB,GAAG,MAAM,GAAG,MAAM,GAAG,QAAQ,GAAG,WAAW,GAAG,MAAM,GAAG,QAAQ,CAAC,MAAM,CAAC,CAAA;AAEzG;;GAEG;AACH,eAAO,MAAM,UAAU;IACtB;;OAEG;;IAGH;;OAEG;;IAGH;;OAEG;;IAGH;;OAEG;;IAGH;;OAEG;;IAGH;;OAEG;;IAGH;;OAEG;;IAGH;;OAEG;;IAGH;;OAEG;;IAGH;;OAEG;;IAGH;;OAEG;;CAEuC,CAAA;AAE3C,eAAO,MAAM,mBAAmB,qBAS9B,CAAA;AAEF,wBAAgB,wBAAwB,CAAC,SAAS,EAAE,UAAU,GAAG,MAAM,CAQtE;AAED,wBAAgB,uBAAuB,CAAC,KAAK,EAAE,sBAAsB,GAAG,UAAU,CAwBjF;AAED;;;;;;GAMG;AACH,qBAAa,iBAAkB,SAAQ,UAAU;;IAMhD;;;;;;;;OAQG;IACI,MAAM,CAAC,QAAQ,EAAE,UAAU,EAAE,KAAK,GAAE,MAAU,EAAE,GAAG,SAAkB,GAAG,MAAM;IAuB9E,MAAM,CAAC,QAAQ,GAAE,MAAgB,GAAG,MAAM;IAIjD;;OAEG;gBACS,KAAK,GAAE,sBAA4C;CAa/D"}
+{"version":3,"file":"CharacterSequence.d.ts","sourceRoot":"","sources":["../../lib/CharacterSequence.ts"],"names":[],"mappings":"AAAA;;;;GAIG;AAEH,OAAO,KAAK,EAAE,SAAS,EAAE,MAAM,aAAa,CAAA;AAC5C,OAAO,EAIN,KAAK,WAAW,EAGhB,MAAM,kBAAkB,CAAA;AAEzB,wBAAgB,WAAW,CAAC,CAAC,EAAE,KAAK,EAAE,OAAO,GAAG,KAAK,IAAI,SAAS,CAAC,CAAC,CAAC,CAEpE;AAED,MAAM,MAAM,sBAAsB,GAAG,MAAM,GAAG,MAAM,GAAG,QAAQ,GAAG,WAAW,GAAG,MAAM,GAAG,QAAQ,CAAC,MAAM,CAAC,CAAA;AAEzG,eAAO,MAAM,UAAU;;;;;;;;;;;;CAYoB,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,CAcjF;AAaD,qBAAa,iBAAkB,SAAQ,UAAU;;IA4BhD;;;;;;OAMG;WACW,SAAS,IAAI,OAAO,CAAC,OAAO,CAAC;IAIpC,MAAM,CAAC,QAAQ,EAAE,UAAU,EAAE,KAAK,GAAE,MAAU,EAAE,GAAG,GAAE,MAAwB,GAAG,MAAM;IAuDtF,SAAS,CAAC,QAAQ,EAAE,UAAU,EAAE,KAAK,GAAE,MAAU,EAAE,GAAG,GAAE,MAAwB,GAAG,SAAS,EAAE;IA8DrG;;;;;OAKG;IACI,aAAa,CACnB,QAAQ,EAAE,UAAU,EACpB,YAAY,EAAE,UAAU,EACxB,KAAK,GAAE,MAAU,EACjB,GAAG,GAAE,MAAwB,GAC3B,WAAW,EAAE;IAqET,MAAM,CAAC,QAAQ,GAAE,MAAgB,GAAG,MAAM;gBAIrC,KAAK,GAAE,sBAA4C;CAO/D"}

package/out/lib/CharacterSequence.js

@@ -1,155 +1,260 @@
 /**
  * @copyright Sister Software
- * @license AGPL-3.0
+ * @license MIT
  * @author Teffen Ellis, et al.
  */
-/**
- * Type-predicate to determine if a value is an array-like object.
- */
+import { loadWasmModule, WASM_MAX_RESULTS, WASM_THRESHOLD, } from "./wasm_module.js";
 export function isArrayLike(input) {
     return Boolean(input && typeof input === "object" && "length" in input);
 }
-/**
- * Common delimiter values.
- */
 export const Delimiters = {
-    /**
-     * Null (␀)
-     */
     Null: 0,
-    /**
-     * Newline (␊)
-     */
     LineFeed: 10,
-    /**
-     * Carriage return (␍)
-     */
     CarriageReturn: 13,
-    /**
-     * Comma (–)
-     */
     Comma: 44,
-    /**
-     * Tab (␉)
-     */
     Tab: 9,
-    /**
-     * Space (␠)
-     */
     Space: 32,
-    /**
-     * One (1)
-     */
     One: 49,
-    /**
-     * Zero (0)
-     */
     Zero: 48,
-    /**
-     * Double quote (")
-     */
     DoubleQuote: 34,
-    /**
-     * Record separator (␞)
-     */
     RecordSeparator: 30,
-    /**
-     * Pipe (|)
-     */
     Pipe: 124,
 };
 export const VisibleDelimiterMap = new Map([
-    [Delimiters.LineFeed, "␤"],
-    [Delimiters.CarriageReturn, "␍"],
+    [Delimiters.LineFeed, "\u2424"],
+    [Delimiters.CarriageReturn, "\u240D"],
     [Delimiters.Comma, "-"],
-    [Delimiters.Tab, "␉"],
-    [Delimiters.Space, "␠"],
+    [Delimiters.Tab, "\u2409"],
+    [Delimiters.Space, "\u2420"],
     [Delimiters.DoubleQuote, '"'],
-    [Delimiters.RecordSeparator, "␞"],
-    [Delimiters.Null, "␀"],
+    [Delimiters.RecordSeparator, "\u241E"],
+    [Delimiters.Null, "\u2400"],
 ]);
 export function debugAsVisibleCharacters(delimiter) {
     return Array.from(delimiter)
-        .map((charCode) => {
-        const visible = VisibleDelimiterMap.get(charCode);
-        return visible ?? String.fromCharCode(charCode);
-    })
+        .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. Received: ${input}`);
-            }
+            if (!Number.isInteger(input))
+                throw new TypeError(`Numeric delimiters must be integers.`);
             return Uint8Array.from([input]);
         case "string":
-            return new TextEncoder().encode(input);
+            return encoder.encode(input);
         case "object":
-            if (isArrayLike(input)) {
+            if (isArrayLike(input))
                 return input;
-            }
-            if (Symbol.iterator in input) {
+            if (Symbol.iterator in input)
                 return Uint8Array.from(input);
-            }
-            throw new TypeError(`Invalid delimiter type. Received an object, but it is not an array or buffer.`);
+            throw new TypeError(`Invalid delimiter type.`);
         default:
-            throw new TypeError(`Invalid delimiter type. Received: ${input}`);
+            throw new TypeError(`Invalid delimiter type.`);
     }
 }
-/**
- * An encoded sequence of characters, typically bytes representing a delimiter.
- *
- * Unlike a string, this class is optimized for searching and slicing.
- *
- * This also allows for multi-byte delimiters, such as CRLF or unicode characters.
- */
+function ensureWasmCapacity(memory, required) {
+    if (required <= memory.buffer.byteLength)
+        return;
+    const pages = Math.ceil((required - memory.buffer.byteLength) / 65536);
+    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 {
-    /**
-     * A jump table for the Boyer-Moore-Horspool search algorithm.
-     */
     #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();
+    }
     /**
-     * Perform a Boyer-Moore-Horspool search for the pattern in the text.
+     * Resolve once the WASM SIMD scanner has finished loading, yielding whether it is active.
      *
-     * @param haystack The encoded text to search.
-     * @param start The byte index to start searching from.
-     * @param end The byte index to stop searching at.
-     *
-     * @returns The byte index of the pattern in the text, or -1 if not found.
+     * 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;
-            // Match pattern from right to left
-            while (lastIndex >= 0 && this[lastIndex] === haystack[startIndex + lastIndex]) {
+            while (lastIndex >= 0 && this[lastIndex] === haystack[startIndex + lastIndex])
                 lastIndex--;
-            }
-            // Pattern found
             if (lastIndex < 0)
                 return startIndex;
-            // Jump based on the last character in the window
             startIndex += this.#skipIndex[haystack[startIndex + sequenceLength - 1]];
         }
         return -1;
     }
-    decode(encoding = "utf-8") {
-        return new TextDecoder(encoding).decode(this);
+    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;
     }
     /**
-     * Create a new character sequence from a delimiter.
+     * 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).
+        const matches = [];
+        const quoteSeq = new CharacterSequence(quotePattern);
+        let searchStart = start;
+        while (searchStart <= end) {
+            const delimIdx = this.search(haystack, searchStart, end);
+            const quoteIdx = quoteSeq.search(haystack, searchStart, end);
+            if (delimIdx < 0 && quoteIdx < 0)
+                break;
+            if (delimIdx >= 0 && (quoteIdx < 0 || delimIdx <= quoteIdx)) {
+                matches.push({ offset: delimIdx, patternId: 0 });
+                searchStart = delimIdx + delimiterLen;
+            }
+            else {
+                matches.push({ offset: quoteIdx, patternId: 1 });
+                searchStart = quoteIdx + quoteLen;
+            }
+        }
+        return matches;
+    }
+    decode(encoding = "utf-8") {
+        return new TextDecoder(encoding).decode(this);
+    }
     constructor(input = Delimiters.LineFeed) {
         const bytes = normalizeCharacterInput(input);
         super(bytes);
-        // oxlint-disable-next-line unicorn/no-new-array -- fixed length (256), immediately .fill()-ed
-        this.#skipIndex = new Array(256).fill(this.length);
-        // Build the jump table - simpler than full Boyer-Moore
-        for (let i = 0; i < this.length - 1; i++) {
+        this.#skipIndex = Array.from({ length: 256 }, () => 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/CharacterSequence.js.map

@@ -1 +1 @@
-{"version":3,"file":"CharacterSequence.js","sourceRoot":"","sources":["../../lib/CharacterSequence.ts"],"names":[],"mappings":"AAAA;;;;GAIG;AAEH;;GAEG;AACH,MAAM,UAAU,WAAW,CAAI,KAAc;IAC5C,OAAO,OAAO,CAAC,KAAK,IAAI,OAAO,KAAK,KAAK,QAAQ,IAAI,QAAQ,IAAI,KAAK,CAAC,CAAA;AACxE,CAAC;AAaD;;GAEG;AACH,MAAM,CAAC,MAAM,UAAU,GAAG;IACzB;;OAEG;IACH,IAAI,EAAE,CAAC;IAEP;;OAEG;IACH,QAAQ,EAAE,EAAE;IAEZ;;OAEG;IACH,cAAc,EAAE,EAAE;IAElB;;OAEG;IACH,KAAK,EAAE,EAAE;IAET;;OAEG;IACH,GAAG,EAAE,CAAC;IAEN;;OAEG;IACH,KAAK,EAAE,EAAE;IAET;;OAEG;IACH,GAAG,EAAE,EAAE;IAEP;;OAEG;IACH,IAAI,EAAE,EAAE;IAER;;OAEG;IACH,WAAW,EAAE,EAAE;IAEf;;OAEG;IACH,eAAe,EAAE,EAAE;IAEnB;;OAEG;IACH,IAAI,EAAE,GAAG;CACiC,CAAA;AAE3C,MAAM,CAAC,MAAM,mBAAmB,GAAG,IAAI,GAAG,CAAiB;IAC1D,CAAC,UAAU,CAAC,QAAQ,EAAE,GAAG,CAAC;IAC1B,CAAC,UAAU,CAAC,cAAc,EAAE,GAAG,CAAC;IAChC,CAAC,UAAU,CAAC,KAAK,EAAE,GAAG,CAAC;IACvB,CAAC,UAAU,CAAC,GAAG,EAAE,GAAG,CAAC;IACrB,CAAC,UAAU,CAAC,KAAK,EAAE,GAAG,CAAC;IACvB,CAAC,UAAU,CAAC,WAAW,EAAE,GAAG,CAAC;IAC7B,CAAC,UAAU,CAAC,eAAe,EAAE,GAAG,CAAC;IACjC,CAAC,UAAU,CAAC,IAAI,EAAE,GAAG,CAAC;CACtB,CAAC,CAAA;AAEF,MAAM,UAAU,wBAAwB,CAAC,SAAqB;IAC7D,OAAO,KAAK,CAAC,IAAI,CAAC,SAAS,CAAC;SAC1B,GAAG,CAAC,CAAC,QAAQ,EAAE,EAAE;QACjB,MAAM,OAAO,GAAG,mBAAmB,CAAC,GAAG,CAAC,QAAQ,CAAC,CAAA;QAEjD,OAAO,OAAO,IAAI,MAAM,CAAC,YAAY,CAAC,QAAQ,CAAC,CAAA;IAChD,CAAC,CAAC;SACD,IAAI,CAAC,EAAE,CAAC,CAAA;AACX,CAAC;AAED,MAAM,UAAU,uBAAuB,CAAC,KAA6B;IACpE,QAAQ,OAAO,KAAK,EAAE,CAAC;QACtB,KAAK,QAAQ;YACZ,IAAI,CAAC,MAAM,CAAC,SAAS,CAAC,KAAK,CAAC,EAAE,CAAC;gBAC9B,MAAM,IAAI,SAAS,CAAC,kDAAkD,KAAK,EAAE,CAAC,CAAA;YAC/E,CAAC;YAED,OAAO,UAAU,CAAC,IAAI,CAAC,CAAC,KAAK,CAAC,CAAC,CAAA;QAChC,KAAK,QAAQ;YACZ,OAAO,IAAI,WAAW,EAAE,CAAC,MAAM,CAAC,KAAK,CAAC,CAAA;QACvC,KAAK,QAAQ;YACZ,IAAI,WAAW,CAAC,KAAK,CAAC,EAAE,CAAC;gBACxB,OAAO,KAAK,CAAA;YACb,CAAC;YAED,IAAI,MAAM,CAAC,QAAQ,IAAI,KAAK,EAAE,CAAC;gBAC9B,OAAO,UAAU,CAAC,IAAI,CAAC,KAAK,CAAC,CAAA;YAC9B,CAAC;YAED,MAAM,IAAI,SAAS,CAAC,+EAA+E,CAAC,CAAA;QAErG;YACC,MAAM,IAAI,SAAS,CAAC,qCAAqC,KAAK,EAAE,CAAC,CAAA;IACnE,CAAC;AACF,CAAC;AAED;;;;;;GAMG;AACH,MAAM,OAAO,iBAAkB,SAAQ,UAAU;IAChD;;OAEG;IACH,UAAU,CAAU;IAEpB;;;;;;;;OAQG;IACI,MAAM,CAAC,QAAoB,EAAE,QAAgB,CAAC,EAAE,GAAG,GAAG,QAAQ,CAAC,MAAM;QAC3E,MAAM,cAAc,GAAG,IAAI,CAAC,MAAM,CAAA;QAElC,IAAI,UAAU,GAAG,KAAK,CAAA;QAEtB,OAAO,UAAU,IAAI,GAAG,GAAG,cAAc,EAAE,CAAC;YAC3C,IAAI,SAAS,GAAG,cAAc,GAAG,CAAC,CAAA;YAElC,mCAAmC;YACnC,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,gBAAgB;YAChB,IAAI,SAAS,GAAG,CAAC;gBAAE,OAAO,UAAU,CAAA;YAEpC,iDAAiD;YACjD,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,MAAM,CAAC,WAAmB,OAAO;QACvC,OAAO,IAAI,WAAW,CAAC,QAAQ,CAAC,CAAC,MAAM,CAAC,IAAI,CAAC,CAAA;IAC9C,CAAC;IAED;;OAEG;IACH,YAAY,QAAgC,UAAU,CAAC,QAAQ;QAC9D,MAAM,KAAK,GAAG,uBAAuB,CAAC,KAAK,CAAC,CAAA;QAE5C,KAAK,CAAC,KAAK,CAAC,CAAA;QAEZ,8FAA8F;QAC9F,IAAI,CAAC,UAAU,GAAG,IAAI,KAAK,CAAC,GAAG,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,MAAM,CAAC,CAAA;QAElD,uDAAuD;QACvD,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"}
+{"version":3,"file":"CharacterSequence.js","sourceRoot":"","sources":["../../lib/CharacterSequence.ts"],"names":[],"mappings":"AAAA;;;;GAIG;AAGH,OAAO,EACN,cAAc,EACd,gBAAgB,EAChB,cAAc,GAId,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;AAID,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,IAAI,WAAW,CAAC,KAAK,CAAC;gBAAE,OAAO,KAAK,CAAA;YACpC,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,KAAK,CAAC,CAAA;IACtE,MAAM,CAAC,IAAI,CAAC,KAAK,CAAC,CAAA;AACnB,CAAC;AAED,sGAAsG;AACtG,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;gBAAE,iBAAiB,CAAC,YAAY,GAAG,IAAI,CAAA;YAEvF,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,QAAgB,CAAC,EAAE,MAAc,QAAQ,CAAC,MAAM;QACnF,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;gBAAE,iBAAiB,CAAC,WAAW,EAAE,CAAA;QAClF,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;gBAAE,SAAS,EAAE,CAAA;YAE1F,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,QAAgB,CAAC,EAAE,MAAc,QAAQ,CAAC,MAAM;QACtF,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;gBACD,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;oBAAE,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;gBAEzF,wEAAwE;gBACxE,+EAA+E;gBAC/E,IAAI,KAAK,GAAG,gBAAgB;oBAAE,OAAO,MAAM,CAAA;YAC5C,CAAC;YAED,IAAI,iBAAiB,CAAC,YAAY,KAAK,SAAS;gBAAE,iBAAiB,CAAC,WAAW,EAAE,CAAA;QAClF,CAAC;QAED,MAAM,MAAM,GAAgB,EAAE,CAAA;QAC9B,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;gBAAE,SAAS,EAAE,CAAA;YAE3F,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;gBACxB,SAAQ;YACT,CAAC;YACD,WAAW,IAAI,IAAI,CAAC,UAAU,CAAC,QAAQ,CAAC,WAAW,GAAG,cAAc,GAAG,CAAC,CAAE,CAAE,CAAA;QAC7E,CAAC;QAED,IAAI,UAAU,IAAI,GAAG;YAAE,MAAM,CAAC,IAAI,CAAC,CAAC,UAAU,EAAE,GAAG,CAAC,CAAC,CAAA;QAErD,OAAO,MAAM,CAAA;IACd,CAAC;IAED;;;;;OAKG;IACI,aAAa,CACnB,QAAoB,EACpB,YAAwB,EACxB,QAAgB,CAAC,EACjB,MAAc,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;YACD,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;gBAAE,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;YAEvG,wEAAwE;YACxE,4EAA4E;YAC5E,IAAI,KAAK,GAAG,gBAAgB;gBAAE,OAAO,OAAO,CAAA;QAC7C,CAAC;QAED,IAAI,iBAAiB,CAAC,YAAY,KAAK,SAAS;YAAE,iBAAiB,CAAC,WAAW,EAAE,CAAA;QAEjF,gFAAgF;QAChF,iFAAiF;QACjF,wEAAwE;QACxE,MAAM,OAAO,GAAkB,EAAE,CAAA;QACjC,MAAM,QAAQ,GAAG,IAAI,iBAAiB,CAAC,YAAY,CAAC,CAAA;QACpD,IAAI,WAAW,GAAG,KAAK,CAAA;QAEvB,OAAO,WAAW,IAAI,GAAG,EAAE,CAAC;YAC3B,MAAM,QAAQ,GAAG,IAAI,CAAC,MAAM,CAAC,QAAQ,EAAE,WAAW,EAAE,GAAG,CAAC,CAAA;YACxD,MAAM,QAAQ,GAAG,QAAQ,CAAC,MAAM,CAAC,QAAQ,EAAE,WAAW,EAAE,GAAG,CAAC,CAAA;YAE5D,IAAI,QAAQ,GAAG,CAAC,IAAI,QAAQ,GAAG,CAAC;gBAAE,MAAK;YAEvC,IAAI,QAAQ,IAAI,CAAC,IAAI,CAAC,QAAQ,GAAG,CAAC,IAAI,QAAQ,IAAI,QAAQ,CAAC,EAAE,CAAC;gBAC7D,OAAO,CAAC,IAAI,CAAC,EAAE,MAAM,EAAE,QAAQ,EAAE,SAAS,EAAE,CAAC,EAAE,CAAC,CAAA;gBAChD,WAAW,GAAG,QAAQ,GAAG,YAAY,CAAA;YACtC,CAAC;iBAAM,CAAC;gBACP,OAAO,CAAC,IAAI,CAAC,EAAE,MAAM,EAAE,QAAQ,EAAE,SAAS,EAAE,CAAC,EAAE,CAAC,CAAA;gBAChD,WAAW,GAAG,QAAQ,GAAG,QAAQ,CAAA;YAClC,CAAC;QACF,CAAC;QAED,OAAO,OAAO,CAAA;IACf,CAAC;IAEM,MAAM,CAAC,WAAmB,OAAO;QACvC,OAAO,IAAI,WAAW,CAAC,QAAQ,CAAC,CAAC,MAAM,CAAC,IAAI,CAAC,CAAA;IAC9C,CAAC;IAED,YAAY,QAAgC,UAAU,CAAC,QAAQ;QAC9D,MAAM,KAAK,GAAG,uBAAuB,CAAC,KAAK,CAAC,CAAA;QAC5C,KAAK,CAAC,KAAK,CAAC,CAAA;QACZ,IAAI,CAAC,UAAU,GAAG,KAAK,CAAC,IAAI,CAAC,EAAE,MAAM,EAAE,GAAG,EAAE,EAAE,GAAG,EAAE,CAAC,IAAI,CAAC,MAAM,CAAC,CAAA;QAEhE,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,IAAI,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC,EAAE;YAAE,IAAI,CAAC,UAAU,CAAC,IAAI,CAAC,CAAC,CAAE,CAAC,GAAG,IAAI,CAAC,MAAM,GAAG,CAAC,GAAG,CAAC,CAAA;IAC1F,CAAC"}

package/out/lib/CompositeDataView.d.ts

@@ -1,6 +1,6 @@
 /**
  * @copyright Sister Software
- * @license AGPL-3.0
+ * @license MIT
  * @author Teffen Ellis, et al.
  */
 import type { TypedArray } from "./shared.js";

package/out/lib/CompositeDataView.js

@@ -1,6 +1,6 @@
 /**
  * @copyright Sister Software
- * @license AGPL-3.0
+ * @license MIT
  * @author Teffen Ellis, et al.
  */
 /**

package/out/lib/IndexQueue.d.ts

@@ -1,6 +1,6 @@
 /**
  * @copyright Sister Software
- * @license AGPL-3.0
+ * @license MIT
  * @author Teffen Ellis, et al.
  */
 import type { ByteRange } from "./shared.js";

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

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

package/out/lib/IndexQueue.js

@@ -1,18 +1,31 @@
 /**
  * @copyright Sister Software
- * @license AGPL-3.0
+ * @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 / 2;
+        return (this.#tuples.length - this.#head) / 2;
     }
     #byteLength = 0;
     /**
@@ -27,40 +40,56 @@ export class IndexQueue {
      * Append a new tuple to the queue.
      */
     enqueue(tuple) {
-        this.#tuples.push(...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.#tuples.length < 2)
+        if (this.#head >= this.#tuples.length)
             return;
-        const tuple = this.#tuples.splice(0, 2);
-        this.#byteLength -= tuple[1] - tuple[0];
-        return tuple;
+        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.#tuples.length < 2)
+        if (this.#head >= this.#tuples.length)
             return;
-        return this.#tuples.slice(0, 2);
+        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 < 2)
+        if (this.#tuples.length - this.#head < 2)
             return;
-        return this.#tuples.slice(-2);
+        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;
     }
     /**

package/out/lib/IndexQueue.js.map

@@ -1 +1 @@
-{"version":3,"file":"IndexQueue.js","sourceRoot":"","sources":["../../lib/IndexQueue.ts"],"names":[],"mappings":"AAAA;;;;GAIG;AAIH;;GAEG;AACH,MAAM,OAAO,UAAU;IACtB,OAAO,GAAa,EAAE,CAAA;IAEtB;;OAEG;IACH,IAAW,IAAI;QACd,OAAO,IAAI,CAAC,OAAO,CAAC,MAAM,GAAG,CAAC,CAAA;IAC/B,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,GAAG,KAAK,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,OAAO,CAAC,MAAM,GAAG,CAAC;YAAE,OAAM;QAEnC,MAAM,KAAK,GAAG,IAAI,CAAC,OAAO,CAAC,MAAM,CAAC,CAAC,EAAE,CAAC,CAAc,CAAA;QAEpD,IAAI,CAAC,WAAW,IAAI,KAAK,CAAC,CAAC,CAAC,GAAG,KAAK,CAAC,CAAC,CAAC,CAAA;QAEvC,OAAO,KAAkB,CAAA;IAC1B,CAAC;IAED;;OAEG;IACI,IAAI;QACV,IAAI,IAAI,CAAC,OAAO,CAAC,MAAM,GAAG,CAAC;YAAE,OAAM;QAEnC,OAAO,IAAI,CAAC,OAAO,CAAC,KAAK,CAAC,CAAC,EAAE,CAAC,CAAc,CAAA;IAC7C,CAAC;IAED;;OAEG;IACI,QAAQ;QACd,IAAI,IAAI,CAAC,OAAO,CAAC,MAAM,GAAG,CAAC;YAAE,OAAM;QAEnC,OAAO,IAAI,CAAC,OAAO,CAAC,KAAK,CAAC,CAAC,CAAC,CAAc,CAAA;IAC3C,CAAC;IAED;;OAEG;IACI,KAAK;QACX,IAAI,CAAC,OAAO,CAAC,MAAM,GAAG,CAAC,CAAA;QACvB,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"}
+{"version":3,"file":"IndexQueue.js","sourceRoot":"","sources":["../../lib/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,uFAAuF;IACvF,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"}