@carbonenginejs/runtime-resource 0.8.0 → 0.9.1

package/dist/formats/gr2/core/CjsFormatGr2.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"CjsFormatGr2.js","sources":["../../../../../src/formats/gr2/core/CjsFormatGr2.js"],"sourcesContent":["/**\n * Exposed CarbonEngineJS-facing GR2 format class.\n *\n * Keep this file small and reviewable: parsing, conversion, rebuild, and JSON\n * helper glue live in core/helpers.js.\n */\n\nimport { curves } from \"./curves.js\";\nimport { tangents } from \"./tangents.js\";\nimport { inspectGsfRaw, isGsfRaw, projectGsf } from \"./gsf.js\";\nimport {\n    CLASS_KEYS,\n    DEFAULT_VALUES,\n    OUTPUT_CMF,\n    OUTPUT_GR2,\n    OUTPUT_GR2_JSON,\n    OUTPUT_JSON,\n    OUTPUT_RAW,\n    inspectRawGr2Result,\n    normalizeValues,\n    readRawInput,\n    readWithValues,\n    toJsonValue,\n    validateClass,\n    validateClassKey\n} from \"./helpers.js\";\n\n/**\n * CarbonEngineJS-facing GR2 reader.\n *\n * The Cjs prefix marks this as a JavaScript format/construction boundary. It\n * can emit plain GR2 JSON data or hydrate caller-supplied CarbonEngineJS-style\n * classes without pretending those classes are the engine runtime itself.\n */\nexport class CjsFormatGr2\n{\n\n    #emit = DEFAULT_VALUES.emit;\n    #decompressCurves = DEFAULT_VALUES.decompressCurves;\n    #unpackTangents = DEFAULT_VALUES.unpackTangents;\n    #rebuildMissingNormals = DEFAULT_VALUES.rebuildMissingNormals;\n    #rebuildMissingTangents = DEFAULT_VALUES.rebuildMissingTangents;\n    #rebuildMissingBiNormals = DEFAULT_VALUES.rebuildMissingBiNormals;\n    #classes = {};\n\n    /**\n     * Create a reusable format profile.\n     *\n     * @param {object} [options] Default format/build values.\n     */\n    constructor(options = {})\n    {\n        this.SetValues(options);\n    }\n\n    /**\n     * Set format values for this reusable profile.\n     *\n     * @param {object} [options] Values to merge into the profile.\n     * @returns {CjsFormatGr2} This format profile.\n     */\n    SetValues(options = {})\n    {\n        const values = normalizeValues(this.GetValues(), options);\n\n        this.#emit = values.emit;\n        this.#decompressCurves = values.decompressCurves;\n        this.#unpackTangents = values.unpackTangents;\n        this.#rebuildMissingNormals = values.rebuildMissingNormals;\n        this.#rebuildMissingTangents = values.rebuildMissingTangents;\n        this.#rebuildMissingBiNormals = values.rebuildMissingBiNormals;\n        this.#classes = values.classes;\n\n        return this;\n    }\n\n    /**\n     * Get this profile's current values, optionally with per-call overrides.\n     *\n     * @param {object} [options] Optional values to merge into a copy.\n     * @returns {object} A copy of the effective values.\n     */\n    GetValues(options = {})\n    {\n        return normalizeValues({\n            emit: this.#emit,\n            decompressCurves: this.#decompressCurves,\n            unpackTangents: this.#unpackTangents,\n            rebuildMissingNormals: this.#rebuildMissingNormals,\n            rebuildMissingTangents: this.#rebuildMissingTangents,\n            rebuildMissingBiNormals: this.#rebuildMissingBiNormals,\n            classes: this.#classes\n        }, options);\n    }\n\n    /**\n     * Set multiple GR2 JSON node constructors for this profile.\n     *\n     * @param {object} [classes] Map of node class keys to constructors.\n     * @returns {CjsFormatGr2} This format profile.\n     */\n    SetClasses(classes = {})\n    {\n        return this.SetValues({ classes });\n    }\n\n    /**\n     * Set a GR2 JSON node constructor for this profile.\n     *\n     * @param {string} type Node class key.\n     * @param {Function|null|undefined} Class Constructor to use, or nullish to delete.\n     * @returns {CjsFormatGr2} This format profile.\n     */\n    SetClass(type, Class)\n    {\n        validateClassKey(type);\n        if (Class === null || Class === undefined)\n        {\n            delete this.#classes[type];\n            return this;\n        }\n\n        validateClass(type, Class);\n        this.#classes = { ...this.#classes, [type]: Class };\n        return this;\n    }\n\n    /**\n     * Get a configured GR2 JSON node constructor.\n     *\n     * @param {string} type Node class key.\n     * @returns {Function|undefined}\n     */\n    GetClass(type)\n    {\n        validateClassKey(type);\n        return this.#classes[type];\n    }\n\n    /**\n     * Whether this reader has a constructor for a GR2 JSON node key.\n     *\n     * @param {string} type Node class key.\n     * @returns {boolean}\n     */\n    HasClass(type)\n    {\n        return !!this.GetClass(type);\n    }\n\n    /**\n     * Parse a .gr2 buffer and return JSON by default, classes when configured,\n     * or raw reflection data when `emit` is \"raw\".\n     *\n     * @param {Uint8Array|Buffer|object} input Raw .gr2 bytes or an existing raw read result.\n     * @param {object} [options] Per-call values.\n     * @returns {object}\n     */\n    Read(input, options = {})\n    {\n        return readWithValues(this, input, this.GetValues(options));\n    }\n\n    /**\n     * Parse a .gr2 buffer into the reflected Granny object graph.\n     *\n     * @param {Uint8Array|Buffer|object} input Raw .gr2 bytes or an existing raw read result.\n     * @returns {object}\n     */\n    ReadRaw(input)\n    {\n        return readRawInput(input);\n    }\n\n    /**\n     * Return a stable, lightweight summary for a GR2 buffer or raw result.\n     *\n     * @param {Uint8Array|Buffer|object} input Raw .gr2 bytes or an existing raw read result.\n     * @returns {object}\n     */\n    Inspect(input)\n    {\n        return inspectRawGr2Result(this.ReadRaw(input));\n    }\n\n    /** Whether input is a Granny State document carried by the GR2 container. */\n    IsGSF(input)\n    {\n        return isGsfRaw(this.ReadRaw(input));\n    }\n\n    /** Read the GState semantic projection, or raw reflected data with `emit: \"raw\"`. */\n    ReadGSF(input, options = {})\n    {\n        const raw = this.ReadRaw(input);\n        return options.emit === \"raw\" ? raw : projectGsf(raw);\n    }\n\n    /** Inspect a GSF document and its referenced GR2 animations. */\n    InspectGSF(input)\n    {\n        return inspectGsfRaw(this.ReadRaw(input));\n    }\n\n    /**\n     * Convert format output to plain JSON-compatible data.\n     *\n     * @param {object} value Format output to convert.\n     * @returns {any} Plain JSON-compatible data.\n     */\n    ToJSON(value)\n    {\n        return toJsonValue(value);\n    }\n\n    /**\n     * Static one-shot read. Static methods use camelCase by convention.\n     *\n     * @param {Uint8Array|Buffer|object} input Raw .gr2 bytes or an existing raw read result.\n     * @param {object} [options] Reader and post-processing values.\n     * @returns {object}\n     */\n    static read(input, options = {})\n    {\n        return readWithValues(CjsFormatGr2, input, normalizeValues(DEFAULT_VALUES, options));\n    }\n\n    /**\n     * Static one-shot raw read.\n     *\n     * @param {Uint8Array|Buffer|object} input Raw .gr2 bytes or an existing raw read result.\n     * @returns {object}\n     */\n    static readRaw(input)\n    {\n        return readRawInput(input);\n    }\n\n    /**\n     * Static one-shot inspection.\n     *\n     * @param {Uint8Array|Buffer|object} input Raw .gr2 bytes or an existing raw read result.\n     * @returns {object}\n     */\n    static inspect(input)\n    {\n        return inspectRawGr2Result(readRawInput(input));\n    }\n\n    /** Whether input is a Granny State document carried by the GR2 container. */\n    static isGsf(input)\n    {\n        try\n        {\n            return isGsfRaw(readRawInput(input));\n        }\n        catch\n        {\n            return false;\n        }\n    }\n\n    /** Read the GState semantic projection, or raw reflected data with `emit: \"raw\"`. */\n    static readGsf(input, options = {})\n    {\n        const raw = readRawInput(input);\n        return options.emit === \"raw\" ? raw : projectGsf(raw);\n    }\n\n    /** Async one-shot GSF read for standard format API compatibility. */\n    static readGsfAsync(input, options = {})\n    {\n        return Promise.resolve(this.readGsf(input, options));\n    }\n\n    /** Inspect a GSF document and its referenced GR2 animations. */\n    static inspectGsf(input)\n    {\n        return inspectGsfRaw(readRawInput(input));\n    }\n\n    /**\n     * Static JSON-compatible conversion.\n     *\n     * @param {object} value Format output to convert.\n     * @returns {any} Plain JSON-compatible data.\n     */\n    static toJSON(value)\n    {\n        return toJsonValue(value);\n    }\n\n    static OUTPUT_JSON = OUTPUT_JSON;\n    static OUTPUT_GR2 = OUTPUT_GR2;\n    static OUTPUT_GR2_JSON = OUTPUT_GR2_JSON;\n    static OUTPUT_CMF = OUTPUT_CMF;\n    static OUTPUT_RAW = OUTPUT_RAW;\n    static CLASS_KEYS = CLASS_KEYS;\n    static type = Object.freeze([ \"geometry\" ]);\n    static mediaTypes = Object.freeze([ \"geometry\" ]);\n    static inputTypes = Object.freeze([ \"gr2\", \"gsf\" ]);\n    static outputTypes = Object.freeze([ OUTPUT_GR2, OUTPUT_CMF ]);\n    static debugOutputTypes = Object.freeze([ OUTPUT_JSON, OUTPUT_GR2_JSON, OUTPUT_RAW ]);\n    static curves = curves;\n    static tangents = tangents;\n    static gsf = Object.freeze({ isRaw: isGsfRaw, project: projectGsf, inspectRaw: inspectGsfRaw });\n\n}\n\nexport default CjsFormatGr2;\n"],"names":["CjsFormatGr2","DEFAULT_VALUES","emit","decompressCurves","unpackTangents","rebuildMissingNormals","rebuildMissingTangents","rebuildMissingBiNormals","constructor","options","SetValues","values","normalizeValues","GetValues","classes","SetClasses","SetClass","type","Class","validateClassKey","undefined","validateClass","GetClass","HasClass","Read","input","readWithValues","ReadRaw","readRawInput","Inspect","inspectRawGr2Result","IsGSF","isGsfRaw","ReadGSF","raw","projectGsf","InspectGSF","inspectGsfRaw","ToJSON","value","toJsonValue","read","readRaw","inspect","isGsf","readGsf","readGsfAsync","Promise","resolve","inspectGsf","toJSON","OUTPUT_JSON","OUTPUT_GR2","OUTPUT_GR2_JSON","OUTPUT_CMF","OUTPUT_RAW","CLASS_KEYS","Object","freeze","mediaTypes","inputTypes","outputTypes","debugOutputTypes","curves","tangents","gsf","isRaw","project","inspectRaw"],"mappings":";;;;;AAAA;AACA;AACA;AACA;AACA;AACA;;;AAsBA;AACA;AACA;AACA;AACA;AACA;AACA;AACO,MAAMA,YAAY,CACzB;AAEI,EAAA,KAAK,GAAGC,cAAc,CAACC,IAAI;AAC3B,EAAA,iBAAiB,GAAGD,cAAc,CAACE,gBAAgB;AACnD,EAAA,eAAe,GAAGF,cAAc,CAACG,cAAc;AAC/C,EAAA,sBAAsB,GAAGH,cAAc,CAACI,qBAAqB;AAC7D,EAAA,uBAAuB,GAAGJ,cAAc,CAACK,sBAAsB;AAC/D,EAAA,wBAAwB,GAAGL,cAAc,CAACM,uBAAuB;EACjE,QAAQ,GAAG,EAAE;;AAEb;AACJ;AACA;AACA;AACA;AACIC,EAAAA,WAAWA,CAACC,OAAO,GAAG,EAAE,EACxB;AACI,IAAA,IAAI,CAACC,SAAS,CAACD,OAAO,CAAC;AAC3B,EAAA;;AAEA;AACJ;AACA;AACA;AACA;AACA;AACIC,EAAAA,SAASA,CAACD,OAAO,GAAG,EAAE,EACtB;IACI,MAAME,MAAM,GAAGC,eAAe,CAAC,IAAI,CAACC,SAAS,EAAE,EAAEJ,OAAO,CAAC;AAEzD,IAAA,IAAI,CAAC,KAAK,GAAGE,MAAM,CAACT,IAAI;AACxB,IAAA,IAAI,CAAC,iBAAiB,GAAGS,MAAM,CAACR,gBAAgB;AAChD,IAAA,IAAI,CAAC,eAAe,GAAGQ,MAAM,CAACP,cAAc;AAC5C,IAAA,IAAI,CAAC,sBAAsB,GAAGO,MAAM,CAACN,qBAAqB;AAC1D,IAAA,IAAI,CAAC,uBAAuB,GAAGM,MAAM,CAACL,sBAAsB;AAC5D,IAAA,IAAI,CAAC,wBAAwB,GAAGK,MAAM,CAACJ,uBAAuB;AAC9D,IAAA,IAAI,CAAC,QAAQ,GAAGI,MAAM,CAACG,OAAO;AAE9B,IAAA,OAAO,IAAI;AACf,EAAA;;AAEA;AACJ;AACA;AACA;AACA;AACA;AACID,EAAAA,SAASA,CAACJ,OAAO,GAAG,EAAE,EACtB;AACI,IAAA,OAAOG,eAAe,CAAC;AACnBV,MAAAA,IAAI,EAAE,IAAI,CAAC,KAAK;AAChBC,MAAAA,gBAAgB,EAAE,IAAI,CAAC,iBAAiB;AACxCC,MAAAA,cAAc,EAAE,IAAI,CAAC,eAAe;AACpCC,MAAAA,qBAAqB,EAAE,IAAI,CAAC,sBAAsB;AAClDC,MAAAA,sBAAsB,EAAE,IAAI,CAAC,uBAAuB;AACpDC,MAAAA,uBAAuB,EAAE,IAAI,CAAC,wBAAwB;MACtDO,OAAO,EAAE,IAAI,CAAC;KACjB,EAAEL,OAAO,CAAC;AACf,EAAA;;AAEA;AACJ;AACA;AACA;AACA;AACA;AACIM,EAAAA,UAAUA,CAACD,OAAO,GAAG,EAAE,EACvB;IACI,OAAO,IAAI,CAACJ,SAAS,CAAC;AAAEI,MAAAA;AAAQ,KAAC,CAAC;AACtC,EAAA;;AAEA;AACJ;AACA;AACA;AACA;AACA;AACA;AACIE,EAAAA,QAAQA,CAACC,IAAI,EAAEC,KAAK,EACpB;IACIC,gBAAgB,CAACF,IAAI,CAAC;AACtB,IAAA,IAAIC,KAAK,KAAK,IAAI,IAAIA,KAAK,KAAKE,SAAS,EACzC;AACI,MAAA,OAAO,IAAI,CAAC,QAAQ,CAACH,IAAI,CAAC;AAC1B,MAAA,OAAO,IAAI;AACf,IAAA;AAEAI,IAAAA,aAAa,CAACJ,IAAI,EAAEC,KAAK,CAAC;IAC1B,IAAI,CAAC,QAAQ,GAAG;MAAE,GAAG,IAAI,CAAC,QAAQ;AAAE,MAAA,CAACD,IAAI,GAAGC;KAAO;AACnD,IAAA,OAAO,IAAI;AACf,EAAA;;AAEA;AACJ;AACA;AACA;AACA;AACA;EACII,QAAQA,CAACL,IAAI,EACb;IACIE,gBAAgB,CAACF,IAAI,CAAC;AACtB,IAAA,OAAO,IAAI,CAAC,QAAQ,CAACA,IAAI,CAAC;AAC9B,EAAA;;AAEA;AACJ;AACA;AACA;AACA;AACA;EACIM,QAAQA,CAACN,IAAI,EACb;AACI,IAAA,OAAO,CAAC,CAAC,IAAI,CAACK,QAAQ,CAACL,IAAI,CAAC;AAChC,EAAA;;AAEA;AACJ;AACA;AACA;AACA;AACA;AACA;AACA;AACIO,EAAAA,IAAIA,CAACC,KAAK,EAAEhB,OAAO,GAAG,EAAE,EACxB;AACI,IAAA,OAAOiB,cAAc,CAAC,IAAI,EAAED,KAAK,EAAE,IAAI,CAACZ,SAAS,CAACJ,OAAO,CAAC,CAAC;AAC/D,EAAA;;AAEA;AACJ;AACA;AACA;AACA;AACA;EACIkB,OAAOA,CAACF,KAAK,EACb;IACI,OAAOG,YAAY,CAACH,KAAK,CAAC;AAC9B,EAAA;;AAEA;AACJ;AACA;AACA;AACA;AACA;EACII,OAAOA,CAACJ,KAAK,EACb;IACI,OAAOK,mBAAmB,CAAC,IAAI,CAACH,OAAO,CAACF,KAAK,CAAC,CAAC;AACnD,EAAA;;AAEA;EACAM,KAAKA,CAACN,KAAK,EACX;IACI,OAAOO,QAAQ,CAAC,IAAI,CAACL,OAAO,CAACF,KAAK,CAAC,CAAC;AACxC,EAAA;;AAEA;AACAQ,EAAAA,OAAOA,CAACR,KAAK,EAAEhB,OAAO,GAAG,EAAE,EAC3B;AACI,IAAA,MAAMyB,GAAG,GAAG,IAAI,CAACP,OAAO,CAACF,KAAK,CAAC;IAC/B,OAAOhB,OAAO,CAACP,IAAI,KAAK,KAAK,GAAGgC,GAAG,GAAGC,UAAU,CAACD,GAAG,CAAC;AACzD,EAAA;;AAEA;EACAE,UAAUA,CAACX,KAAK,EAChB;IACI,OAAOY,aAAa,CAAC,IAAI,CAACV,OAAO,CAACF,KAAK,CAAC,CAAC;AAC7C,EAAA;;AAEA;AACJ;AACA;AACA;AACA;AACA;EACIa,MAAMA,CAACC,KAAK,EACZ;IACI,OAAOC,WAAW,CAACD,KAAK,CAAC;AAC7B,EAAA;;AAEA;AACJ;AACA;AACA;AACA;AACA;AACA;EACI,OAAOE,IAAIA,CAAChB,KAAK,EAAEhB,OAAO,GAAG,EAAE,EAC/B;AACI,IAAA,OAAOiB,cAAc,CAAC1B,YAAY,EAAEyB,KAAK,EAAEb,eAAe,CAACX,cAAc,EAAEQ,OAAO,CAAC,CAAC;AACxF,EAAA;;AAEA;AACJ;AACA;AACA;AACA;AACA;EACI,OAAOiC,OAAOA,CAACjB,KAAK,EACpB;IACI,OAAOG,YAAY,CAACH,KAAK,CAAC;AAC9B,EAAA;;AAEA;AACJ;AACA;AACA;AACA;AACA;EACI,OAAOkB,OAAOA,CAAClB,KAAK,EACpB;AACI,IAAA,OAAOK,mBAAmB,CAACF,YAAY,CAACH,KAAK,CAAC,CAAC;AACnD,EAAA;;AAEA;EACA,OAAOmB,KAAKA,CAACnB,KAAK,EAClB;IACI,IACA;AACI,MAAA,OAAOO,QAAQ,CAACJ,YAAY,CAACH,KAAK,CAAC,CAAC;AACxC,IAAA,CAAC,CACD,MACA;AACI,MAAA,OAAO,KAAK;AAChB,IAAA;AACJ,EAAA;;AAEA;EACA,OAAOoB,OAAOA,CAACpB,KAAK,EAAEhB,OAAO,GAAG,EAAE,EAClC;AACI,IAAA,MAAMyB,GAAG,GAAGN,YAAY,CAACH,KAAK,CAAC;IAC/B,OAAOhB,OAAO,CAACP,IAAI,KAAK,KAAK,GAAGgC,GAAG,GAAGC,UAAU,CAACD,GAAG,CAAC;AACzD,EAAA;;AAEA;EACA,OAAOY,YAAYA,CAACrB,KAAK,EAAEhB,OAAO,GAAG,EAAE,EACvC;AACI,IAAA,OAAOsC,OAAO,CAACC,OAAO,CAAC,IAAI,CAACH,OAAO,CAACpB,KAAK,EAAEhB,OAAO,CAAC,CAAC;AACxD,EAAA;;AAEA;EACA,OAAOwC,UAAUA,CAACxB,KAAK,EACvB;AACI,IAAA,OAAOY,aAAa,CAACT,YAAY,CAACH,KAAK,CAAC,CAAC;AAC7C,EAAA;;AAEA;AACJ;AACA;AACA;AACA;AACA;EACI,OAAOyB,MAAMA,CAACX,KAAK,EACnB;IACI,OAAOC,WAAW,CAACD,KAAK,CAAC;AAC7B,EAAA;EAEA,OAAOY,WAAW,GAAGA,WAAW;EAChC,OAAOC,UAAU,GAAGA,UAAU;EAC9B,OAAOC,eAAe,GAAGA,eAAe;EACxC,OAAOC,UAAU,GAAGA,UAAU;EAC9B,OAAOC,UAAU,GAAGA,UAAU;EAC9B,OAAOC,UAAU,GAAGA,UAAU;EAC9B,OAAOvC,IAAI,GAAGwC,MAAM,CAACC,MAAM,CAAC,CAAE,UAAU,CAAE,CAAC;EAC3C,OAAOC,UAAU,GAAGF,MAAM,CAACC,MAAM,CAAC,CAAE,UAAU,CAAE,CAAC;EACjD,OAAOE,UAAU,GAAGH,MAAM,CAACC,MAAM,CAAC,CAAE,KAAK,EAAE,KAAK,CAAE,CAAC;EACnD,OAAOG,WAAW,GAAGJ,MAAM,CAACC,MAAM,CAAC,CAAEN,UAAU,EAAEE,UAAU,CAAE,CAAC;AAC9D,EAAA,OAAOQ,gBAAgB,GAAGL,MAAM,CAACC,MAAM,CAAC,CAAEP,WAAW,EAAEE,eAAe,EAAEE,UAAU,CAAE,CAAC;EACrF,OAAOQ,MAAM,GAAGA,MAAM;EACtB,OAAOC,QAAQ,GAAGA,QAAQ;AAC1B,EAAA,OAAOC,GAAG,GAAGR,MAAM,CAACC,MAAM,CAAC;AAAEQ,IAAAA,KAAK,EAAElC,QAAQ;AAAEmC,IAAAA,OAAO,EAAEhC,UAAU;AAAEiC,IAAAA,UAAU,EAAE/B;AAAc,GAAC,CAAC;AAEnG;;;;"}

package/dist/formats/gr2/core/bitknit2.js

@@ -0,0 +1,280 @@
+// Clean-room BitKnit2 (Granny .gr2 section format 4) decompressor.
+//
+// Original CarbonEngineJS implementation written solely from the published
+// format specification (docs/formats/bitknit2.md) by an isolated agent with
+// no access to any other BitKnit implementation, then validated byte-exact
+// against 539 real EVE .gr2 BitKnit2 streams (sections and pointer-fixup
+// blocks) plus synthetic raw-quantum streams. Replaced the prior EUPL-derived
+// port on 2026-07-24; see THIRD-PARTY-NOTICES.md.
+
+const TOTAL = 0x8000;
+const QUANTUM_BYTES = 0x10000;
+const MAGIC = 0x75B1;
+
+// Powers of two as exact doubles, indexed 0..32. All entropy-state values are
+// unsigned 32-bit; floor division by these avoids signed-shift pitfalls.
+const POW2 = new Float64Array(33);
+for (let i = 0; i <= 32; i++) {
+  POW2[i] = Math.pow(2, i);
+}
+
+/**
+ * One adaptive frequency model with 15-bit precision (TOTAL = 0x8000).
+ * Holds a cumulative table cum[0..V] (cum[V] = TOTAL), per-symbol
+ * accumulators, and a 1024-entry lookup table for fast symbol search.
+ */
+class FrequencyModel {
+  /**
+   * @param {number} symbolCount Total symbols V.
+   * @param {number} minProbCount Trailing minimum-probability symbols M.
+   */
+  constructor(symbolCount, minProbCount) {
+    const V = symbolCount;
+    const E = V - minProbCount;
+    const cum = new Uint16Array(V + 1);
+    for (let i = 0; i < E; i++) {
+      cum[i] = Math.floor((TOTAL - minProbCount) * i / E);
+    }
+    for (let i = E; i <= V; i++) {
+      cum[i] = TOTAL - V + i;
+    }
+    this.symbolCount = V;
+    this.cum = cum;
+    this.acc = new Uint16Array(V).fill(1);
+    this.tick = 0;
+    this.inc = Math.floor((TOTAL - V) / 1024);
+    this.lastInc = 1 + TOTAL - V - this.inc * 1024;
+    this.lookup = new Uint16Array(1024);
+    this.rebuildLookup();
+  }
+  rebuildLookup() {
+    const cum = this.cum;
+    const lookup = this.lookup;
+    let s = 0;
+    for (let k = 0; k < 1024; k++) {
+      const threshold = k * 32;
+      while (threshold >= cum[s + 1]) {
+        s++;
+      }
+      lookup[k] = s;
+    }
+  }
+
+  /**
+   * Record one decoded symbol; every 1024th observation folds the
+   * accumulators halfway into the cumulative table and resets them.
+   * @param {number} sym
+   */
+  observe(sym) {
+    const acc = this.acc;
+    acc[sym] += this.inc;
+    this.tick = this.tick + 1 & 1023;
+    if (this.tick === 0) {
+      acc[sym] += this.lastInc;
+      const cum = this.cum;
+      const V = this.symbolCount;
+      let run = 0;
+      for (let i = 1; i <= V; i++) {
+        run += acc[i - 1];
+        cum[i] += run - cum[i] >> 1;
+        acc[i - 1] = 1;
+      }
+      this.rebuildLookup();
+    }
+  }
+}
+
+/**
+ * Decompress a BitKnit2 stream (Granny .gr2 section format 4).
+ *
+ * The stream is a sequence of little-endian uint16 words beginning with the
+ * magic 0x75B1, producing output in 65,536-byte quanta that are either raw
+ * (word-aligned byte copies) or entropy-coded with two interleaved 32-bit
+ * range states driving adaptive literal/match commands.
+ *
+ * @param {Uint8Array} bytes Compressed stream bytes.
+ * @param {number} expandedSize Exact decompressed byte length.
+ * @returns {Uint8Array} Decompressed output of exactly expandedSize bytes.
+ * @throws {Error} On bad magic, word-stream underflow, a match reaching
+ *   before output offset 0, or a coded quantum ending with neither entropy
+ *   state equal to 0x10000.
+ */
+function decompressBitKnit2(bytes, expandedSize) {
+  const out = new Uint8Array(expandedSize);
+  if (expandedSize === 0) {
+    return out;
+  }
+  const wordCount = bytes.length >>> 1;
+  let wordIndex = 0;
+  function nextWord() {
+    if (wordIndex >= wordCount) {
+      throw new Error("BitKnit2: source underflow");
+    }
+    const p = wordIndex * 2;
+    wordIndex++;
+    return bytes[p] | bytes[p + 1] << 8;
+  }
+  if (nextWord() !== MAGIC) {
+    throw new Error("BitKnit2: bad magic word");
+  }
+
+  // Nine adaptive models, all created at stream start; they persist and
+  // keep adapting across quantum boundaries.
+  const commandModels = [new FrequencyModel(300, 36), new FrequencyModel(300, 36), new FrequencyModel(300, 36), new FrequencyModel(300, 36)];
+  const cacheRefModels = [new FrequencyModel(40, 0), new FrequencyModel(40, 0), new FrequencyModel(40, 0), new FrequencyModel(40, 0)];
+  const exponentModel = new FrequencyModel(21, 0);
+
+  // Recent-offset cache: eight entries plus a packed 4-bit-per-rank order
+  // word (nibble at bit 4r = slot holding rank r; rank 0 = most recent).
+  const recentOffsets = new Float64Array(8).fill(1);
+  let recentOrder = 0x76543210;
+
+  // Distance used by literal deltas; replaced by every match distance.
+  let deltaOffset = 1;
+
+  // Two interleaved entropy states; swapped after every operation.
+  let stateA = 0;
+  let stateB = 0;
+  function initEntropyStates() {
+    let merged = nextWord() * 0x10000 + nextWord();
+    const split = merged & 15;
+    merged = Math.floor(merged / 16);
+    if (merged < 0x10000) {
+      merged = merged * 0x10000 + nextWord();
+    }
+    stateA = split === 0 ? merged : Math.floor(merged / POW2[split]);
+    if (stateA < 0x10000) {
+      stateA = stateA * 0x10000 + nextWord();
+    }
+    const modulus = POW2[16 + split];
+    stateB = (merged % 0x10000 * 0x10000 + nextWord()) % modulus + modulus;
+  }
+  function popBits(n) {
+    const value = stateA % POW2[n];
+    stateA = Math.floor(stateA / POW2[n]);
+    if (stateA < 0x10000) {
+      stateA = stateA * 0x10000 + nextWord();
+    }
+    const t = stateA;
+    stateA = stateB;
+    stateB = t;
+    return value;
+  }
+  function popSymbol(model) {
+    const cum = model.cum;
+    const code = stateA & TOTAL - 1;
+    let sym = model.lookup[code >>> 5];
+    while (code >= cum[sym + 1]) {
+      sym++;
+    }
+    stateA = Math.floor(stateA / TOTAL) * (cum[sym + 1] - cum[sym]) + (code - cum[sym]);
+    if (stateA < 0x10000) {
+      stateA = stateA * 0x10000 + nextWord();
+    }
+    model.observe(sym);
+    const t = stateA;
+    stateA = stateB;
+    stateB = t;
+    return sym;
+  }
+  let offset = 0;
+  while (offset < expandedSize) {
+    const quantumEnd = Math.min(expandedSize, offset - offset % QUANTUM_BYTES + QUANTUM_BYTES);
+    if (wordIndex >= wordCount) {
+      throw new Error("BitKnit2: source underflow");
+    }
+    const peekPos = wordIndex * 2;
+    const peek = bytes[peekPos] | bytes[peekPos + 1] << 8;
+    if (peek === 0) {
+      // Raw quantum: consume the zero word, then copy bytes straight
+      // from the word stream in stream order.
+      wordIndex++;
+      const remainingWords = wordCount - wordIndex;
+      const quantumRemaining = quantumEnd - offset;
+      const length = Math.min(remainingWords * 2, quantumRemaining);
+      const start = wordIndex * 2;
+      out.set(bytes.subarray(start, start + length), offset);
+      offset += length;
+      // When length is odd, the final word's high byte is NOT consumed
+      // and the next quantum begins at that same word.
+      wordIndex += length >> 1;
+      continue;
+    }
+
+    // Coded quantum.
+    initEntropyStates();
+    if (offset === 0) {
+      out[0] = popBits(8);
+      offset = 1;
+    }
+    while (offset < quantumEnd) {
+      const phase = offset & 3;
+      const command = popSymbol(commandModels[phase]);
+      if (command < 256) {
+        // Literal: byte delta against the byte one last-match-distance
+        // behind.
+        out[offset] = command + out[offset - deltaOffset] & 0xFF;
+        offset++;
+        continue;
+      }
+
+      // Match length.
+      let copyLength;
+      if (command < 288) {
+        copyLength = command - 254;
+      } else {
+        const n = command - 287;
+        copyLength = POW2[n] + popBits(n) + 32;
+      }
+
+      // Match distance.
+      const ref = popSymbol(cacheRefModels[phase]);
+      let copyOffset;
+      if (ref < 8) {
+        // Recent-offset cache hit at rank `ref`, then promote to
+        // rank 0 (ranks 0..ref-1 shift up one nibble).
+        const shift = 4 * ref;
+        const slot = recentOrder >>> shift & 15;
+        copyOffset = recentOffsets[slot];
+        if (ref === 7) {
+          recentOrder = (recentOrder << 4 | slot) >>> 0;
+        } else if (ref > 0) {
+          const mask = (16 << shift) - 1;
+          recentOrder = (recentOrder & ~mask | (recentOrder << 4 | slot) & mask) >>> 0;
+        }
+      } else {
+        // Explicit distance: exponent symbol, extra mantissa bits,
+        // optionally one raw word appended as the LOW 16 bits.
+        const n = popSymbol(exponentModel);
+        let extra = popBits(n & 15);
+        if (n >= 16) {
+          extra = extra * 0x10000 + nextWord();
+        }
+        copyOffset = 32 * POW2[n] + extra * 32 + ref - 39;
+        // Insert: rank-7 slot takes the rank-6 slot's value, then the
+        // rank-6 slot takes the new distance; order is unchanged.
+        const slot7 = recentOrder >>> 28 & 15;
+        const slot6 = recentOrder >>> 24 & 15;
+        recentOffsets[slot7] = recentOffsets[slot6];
+        recentOffsets[slot6] = copyOffset;
+      }
+      deltaOffset = copyOffset;
+      const src = offset - copyOffset;
+      if (src < 0) {
+        throw new Error("BitKnit2: match source before output start");
+      }
+      // Byte-by-byte ascending copy; self-overlap replicates.
+      for (let i = 0; i < copyLength; i++) {
+        out[offset + i] = out[src + i];
+      }
+      offset += copyLength;
+    }
+    if (stateA !== 0x10000 && stateB !== 0x10000) {
+      throw new Error("BitKnit2: corrupt quantum end state");
+    }
+  }
+  return out;
+}
+
+export { decompressBitKnit2 };
+//# sourceMappingURL=bitknit2.js.map

package/dist/formats/gr2/core/bitknit2.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"bitknit2.js","sources":["../../../../../src/formats/gr2/core/bitknit2.js"],"sourcesContent":["// Clean-room BitKnit2 (Granny .gr2 section format 4) decompressor.\n//\n// Original CarbonEngineJS implementation written solely from the published\n// format specification (docs/formats/bitknit2.md) by an isolated agent with\n// no access to any other BitKnit implementation, then validated byte-exact\n// against 539 real EVE .gr2 BitKnit2 streams (sections and pointer-fixup\n// blocks) plus synthetic raw-quantum streams. Replaced the prior EUPL-derived\n// port on 2026-07-24; see THIRD-PARTY-NOTICES.md.\n\nconst TOTAL = 0x8000;\nconst QUANTUM_BYTES = 0x10000;\nconst MAGIC = 0x75B1;\n\n// Powers of two as exact doubles, indexed 0..32. All entropy-state values are\n// unsigned 32-bit; floor division by these avoids signed-shift pitfalls.\nconst POW2 = new Float64Array(33);\nfor (let i = 0; i <= 32; i++)\n{\n    POW2[i] = Math.pow(2, i);\n}\n\n/**\n * One adaptive frequency model with 15-bit precision (TOTAL = 0x8000).\n * Holds a cumulative table cum[0..V] (cum[V] = TOTAL), per-symbol\n * accumulators, and a 1024-entry lookup table for fast symbol search.\n */\nclass FrequencyModel\n{\n    /**\n     * @param {number} symbolCount Total symbols V.\n     * @param {number} minProbCount Trailing minimum-probability symbols M.\n     */\n    constructor(symbolCount, minProbCount)\n    {\n        const V = symbolCount;\n        const E = V - minProbCount;\n        const cum = new Uint16Array(V + 1);\n        for (let i = 0; i < E; i++)\n        {\n            cum[i] = Math.floor((TOTAL - minProbCount) * i / E);\n        }\n        for (let i = E; i <= V; i++)\n        {\n            cum[i] = TOTAL - V + i;\n        }\n        this.symbolCount = V;\n        this.cum = cum;\n        this.acc = new Uint16Array(V).fill(1);\n        this.tick = 0;\n        this.inc = Math.floor((TOTAL - V) / 1024);\n        this.lastInc = 1 + TOTAL - V - this.inc * 1024;\n        this.lookup = new Uint16Array(1024);\n        this.rebuildLookup();\n    }\n\n    rebuildLookup()\n    {\n        const cum = this.cum;\n        const lookup = this.lookup;\n        let s = 0;\n        for (let k = 0; k < 1024; k++)\n        {\n            const threshold = k * 32;\n            while (threshold >= cum[s + 1])\n            {\n                s++;\n            }\n            lookup[k] = s;\n        }\n    }\n\n    /**\n     * Record one decoded symbol; every 1024th observation folds the\n     * accumulators halfway into the cumulative table and resets them.\n     * @param {number} sym\n     */\n    observe(sym)\n    {\n        const acc = this.acc;\n        acc[sym] += this.inc;\n        this.tick = (this.tick + 1) & 1023;\n        if (this.tick === 0)\n        {\n            acc[sym] += this.lastInc;\n            const cum = this.cum;\n            const V = this.symbolCount;\n            let run = 0;\n            for (let i = 1; i <= V; i++)\n            {\n                run += acc[i - 1];\n                cum[i] += (run - cum[i]) >> 1;\n                acc[i - 1] = 1;\n            }\n            this.rebuildLookup();\n        }\n    }\n}\n\n/**\n * Decompress a BitKnit2 stream (Granny .gr2 section format 4).\n *\n * The stream is a sequence of little-endian uint16 words beginning with the\n * magic 0x75B1, producing output in 65,536-byte quanta that are either raw\n * (word-aligned byte copies) or entropy-coded with two interleaved 32-bit\n * range states driving adaptive literal/match commands.\n *\n * @param {Uint8Array} bytes Compressed stream bytes.\n * @param {number} expandedSize Exact decompressed byte length.\n * @returns {Uint8Array} Decompressed output of exactly expandedSize bytes.\n * @throws {Error} On bad magic, word-stream underflow, a match reaching\n *   before output offset 0, or a coded quantum ending with neither entropy\n *   state equal to 0x10000.\n */\nexport function decompressBitKnit2(bytes, expandedSize)\n{\n    const out = new Uint8Array(expandedSize);\n    if (expandedSize === 0)\n    {\n        return out;\n    }\n\n    const wordCount = bytes.length >>> 1;\n    let wordIndex = 0;\n\n    function nextWord()\n    {\n        if (wordIndex >= wordCount)\n        {\n            throw new Error(\"BitKnit2: source underflow\");\n        }\n        const p = wordIndex * 2;\n        wordIndex++;\n        return bytes[p] | (bytes[p + 1] << 8);\n    }\n\n    if (nextWord() !== MAGIC)\n    {\n        throw new Error(\"BitKnit2: bad magic word\");\n    }\n\n    // Nine adaptive models, all created at stream start; they persist and\n    // keep adapting across quantum boundaries.\n    const commandModels = [\n        new FrequencyModel(300, 36),\n        new FrequencyModel(300, 36),\n        new FrequencyModel(300, 36),\n        new FrequencyModel(300, 36)\n    ];\n    const cacheRefModels = [\n        new FrequencyModel(40, 0),\n        new FrequencyModel(40, 0),\n        new FrequencyModel(40, 0),\n        new FrequencyModel(40, 0)\n    ];\n    const exponentModel = new FrequencyModel(21, 0);\n\n    // Recent-offset cache: eight entries plus a packed 4-bit-per-rank order\n    // word (nibble at bit 4r = slot holding rank r; rank 0 = most recent).\n    const recentOffsets = new Float64Array(8).fill(1);\n    let recentOrder = 0x76543210;\n\n    // Distance used by literal deltas; replaced by every match distance.\n    let deltaOffset = 1;\n\n    // Two interleaved entropy states; swapped after every operation.\n    let stateA = 0;\n    let stateB = 0;\n\n    function initEntropyStates()\n    {\n        let merged = nextWord() * 0x10000 + nextWord();\n        const split = merged & 15;\n        merged = Math.floor(merged / 16);\n        if (merged < 0x10000)\n        {\n            merged = merged * 0x10000 + nextWord();\n        }\n        stateA = split === 0 ? merged : Math.floor(merged / POW2[split]);\n        if (stateA < 0x10000)\n        {\n            stateA = stateA * 0x10000 + nextWord();\n        }\n        const modulus = POW2[16 + split];\n        stateB = ((merged % 0x10000) * 0x10000 + nextWord()) % modulus + modulus;\n    }\n\n    function popBits(n)\n    {\n        const value = stateA % POW2[n];\n        stateA = Math.floor(stateA / POW2[n]);\n        if (stateA < 0x10000)\n        {\n            stateA = stateA * 0x10000 + nextWord();\n        }\n        const t = stateA;\n        stateA = stateB;\n        stateB = t;\n        return value;\n    }\n\n    function popSymbol(model)\n    {\n        const cum = model.cum;\n        const code = stateA & (TOTAL - 1);\n        let sym = model.lookup[code >>> 5];\n        while (code >= cum[sym + 1])\n        {\n            sym++;\n        }\n        stateA = Math.floor(stateA / TOTAL) * (cum[sym + 1] - cum[sym]) + (code - cum[sym]);\n        if (stateA < 0x10000)\n        {\n            stateA = stateA * 0x10000 + nextWord();\n        }\n        model.observe(sym);\n        const t = stateA;\n        stateA = stateB;\n        stateB = t;\n        return sym;\n    }\n\n    let offset = 0;\n    while (offset < expandedSize)\n    {\n        const quantumEnd = Math.min(expandedSize, offset - (offset % QUANTUM_BYTES) + QUANTUM_BYTES);\n\n        if (wordIndex >= wordCount)\n        {\n            throw new Error(\"BitKnit2: source underflow\");\n        }\n        const peekPos = wordIndex * 2;\n        const peek = bytes[peekPos] | (bytes[peekPos + 1] << 8);\n\n        if (peek === 0)\n        {\n            // Raw quantum: consume the zero word, then copy bytes straight\n            // from the word stream in stream order.\n            wordIndex++;\n            const remainingWords = wordCount - wordIndex;\n            const quantumRemaining = quantumEnd - offset;\n            const length = Math.min(remainingWords * 2, quantumRemaining);\n            const start = wordIndex * 2;\n            out.set(bytes.subarray(start, start + length), offset);\n            offset += length;\n            // When length is odd, the final word's high byte is NOT consumed\n            // and the next quantum begins at that same word.\n            wordIndex += length >> 1;\n            continue;\n        }\n\n        // Coded quantum.\n        initEntropyStates();\n\n        if (offset === 0)\n        {\n            out[0] = popBits(8);\n            offset = 1;\n        }\n\n        while (offset < quantumEnd)\n        {\n            const phase = offset & 3;\n            const command = popSymbol(commandModels[phase]);\n\n            if (command < 256)\n            {\n                // Literal: byte delta against the byte one last-match-distance\n                // behind.\n                out[offset] = (command + out[offset - deltaOffset]) & 0xFF;\n                offset++;\n                continue;\n            }\n\n            // Match length.\n            let copyLength;\n            if (command < 288)\n            {\n                copyLength = command - 254;\n            }\n            else\n            {\n                const n = command - 287;\n                copyLength = POW2[n] + popBits(n) + 32;\n            }\n\n            // Match distance.\n            const ref = popSymbol(cacheRefModels[phase]);\n            let copyOffset;\n            if (ref < 8)\n            {\n                // Recent-offset cache hit at rank `ref`, then promote to\n                // rank 0 (ranks 0..ref-1 shift up one nibble).\n                const shift = 4 * ref;\n                const slot = (recentOrder >>> shift) & 15;\n                copyOffset = recentOffsets[slot];\n                if (ref === 7)\n                {\n                    recentOrder = ((recentOrder << 4) | slot) >>> 0;\n                }\n                else if (ref > 0)\n                {\n                    const mask = (16 << shift) - 1;\n                    recentOrder = ((recentOrder & ~mask) | (((recentOrder << 4) | slot) & mask)) >>> 0;\n                }\n            }\n            else\n            {\n                // Explicit distance: exponent symbol, extra mantissa bits,\n                // optionally one raw word appended as the LOW 16 bits.\n                const n = popSymbol(exponentModel);\n                let extra = popBits(n & 15);\n                if (n >= 16)\n                {\n                    extra = extra * 0x10000 + nextWord();\n                }\n                copyOffset = 32 * POW2[n] + extra * 32 + ref - 39;\n                // Insert: rank-7 slot takes the rank-6 slot's value, then the\n                // rank-6 slot takes the new distance; order is unchanged.\n                const slot7 = (recentOrder >>> 28) & 15;\n                const slot6 = (recentOrder >>> 24) & 15;\n                recentOffsets[slot7] = recentOffsets[slot6];\n                recentOffsets[slot6] = copyOffset;\n            }\n\n            deltaOffset = copyOffset;\n            const src = offset - copyOffset;\n            if (src < 0)\n            {\n                throw new Error(\"BitKnit2: match source before output start\");\n            }\n            // Byte-by-byte ascending copy; self-overlap replicates.\n            for (let i = 0; i < copyLength; i++)\n            {\n                out[offset + i] = out[src + i];\n            }\n            offset += copyLength;\n        }\n\n        if (stateA !== 0x10000 && stateB !== 0x10000)\n        {\n            throw new Error(\"BitKnit2: corrupt quantum end state\");\n        }\n    }\n\n    return out;\n}\n"],"names":["TOTAL","QUANTUM_BYTES","MAGIC","POW2","Float64Array","i","Math","pow","FrequencyModel","constructor","symbolCount","minProbCount","V","E","cum","Uint16Array","floor","acc","fill","tick","inc","lastInc","lookup","rebuildLookup","s","k","threshold","observe","sym","run","decompressBitKnit2","bytes","expandedSize","out","Uint8Array","wordCount","length","wordIndex","nextWord","Error","p","commandModels","cacheRefModels","exponentModel","recentOffsets","recentOrder","deltaOffset","stateA","stateB","initEntropyStates","merged","split","modulus","popBits","n","value","t","popSymbol","model","code","offset","quantumEnd","min","peekPos","peek","remainingWords","quantumRemaining","start","set","subarray","phase","command","copyLength","ref","copyOffset","shift","slot","mask","extra","slot7","slot6","src"],"mappings":"AAAA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA,MAAMA,KAAK,GAAG,MAAM;AACpB,MAAMC,aAAa,GAAG,OAAO;AAC7B,MAAMC,KAAK,GAAG,MAAM;;AAEpB;AACA;AACA,MAAMC,IAAI,GAAG,IAAIC,YAAY,CAAC,EAAE,CAAC;AACjC,KAAK,IAAIC,CAAC,GAAG,CAAC,EAAEA,CAAC,IAAI,EAAE,EAAEA,CAAC,EAAE,EAC5B;EACIF,IAAI,CAACE,CAAC,CAAC,GAAGC,IAAI,CAACC,GAAG,CAAC,CAAC,EAAEF,CAAC,CAAC;AAC5B;;AAEA;AACA;AACA;AACA;AACA;AACA,MAAMG,cAAc,CACpB;AACI;AACJ;AACA;AACA;AACIC,EAAAA,WAAWA,CAACC,WAAW,EAAEC,YAAY,EACrC;IACI,MAAMC,CAAC,GAAGF,WAAW;AACrB,IAAA,MAAMG,CAAC,GAAGD,CAAC,GAAGD,YAAY;IAC1B,MAAMG,GAAG,GAAG,IAAIC,WAAW,CAACH,CAAC,GAAG,CAAC,CAAC;IAClC,KAAK,IAAIP,CAAC,GAAG,CAAC,EAAEA,CAAC,GAAGQ,CAAC,EAAER,CAAC,EAAE,EAC1B;AACIS,MAAAA,GAAG,CAACT,CAAC,CAAC,GAAGC,IAAI,CAACU,KAAK,CAAC,CAAChB,KAAK,GAAGW,YAAY,IAAIN,CAAC,GAAGQ,CAAC,CAAC;AACvD,IAAA;IACA,KAAK,IAAIR,CAAC,GAAGQ,CAAC,EAAER,CAAC,IAAIO,CAAC,EAAEP,CAAC,EAAE,EAC3B;MACIS,GAAG,CAACT,CAAC,CAAC,GAAGL,KAAK,GAAGY,CAAC,GAAGP,CAAC;AAC1B,IAAA;IACA,IAAI,CAACK,WAAW,GAAGE,CAAC;IACpB,IAAI,CAACE,GAAG,GAAGA,GAAG;AACd,IAAA,IAAI,CAACG,GAAG,GAAG,IAAIF,WAAW,CAACH,CAAC,CAAC,CAACM,IAAI,CAAC,CAAC,CAAC;IACrC,IAAI,CAACC,IAAI,GAAG,CAAC;AACb,IAAA,IAAI,CAACC,GAAG,GAAGd,IAAI,CAACU,KAAK,CAAC,CAAChB,KAAK,GAAGY,CAAC,IAAI,IAAI,CAAC;AACzC,IAAA,IAAI,CAACS,OAAO,GAAG,CAAC,GAAGrB,KAAK,GAAGY,CAAC,GAAG,IAAI,CAACQ,GAAG,GAAG,IAAI;AAC9C,IAAA,IAAI,CAACE,MAAM,GAAG,IAAIP,WAAW,CAAC,IAAI,CAAC;IACnC,IAAI,CAACQ,aAAa,EAAE;AACxB,EAAA;AAEAA,EAAAA,aAAaA,GACb;AACI,IAAA,MAAMT,GAAG,GAAG,IAAI,CAACA,GAAG;AACpB,IAAA,MAAMQ,MAAM,GAAG,IAAI,CAACA,MAAM;IAC1B,IAAIE,CAAC,GAAG,CAAC;IACT,KAAK,IAAIC,CAAC,GAAG,CAAC,EAAEA,CAAC,GAAG,IAAI,EAAEA,CAAC,EAAE,EAC7B;AACI,MAAA,MAAMC,SAAS,GAAGD,CAAC,GAAG,EAAE;MACxB,OAAOC,SAAS,IAAIZ,GAAG,CAACU,CAAC,GAAG,CAAC,CAAC,EAC9B;AACIA,QAAAA,CAAC,EAAE;AACP,MAAA;AACAF,MAAAA,MAAM,CAACG,CAAC,CAAC,GAAGD,CAAC;AACjB,IAAA;AACJ,EAAA;;AAEA;AACJ;AACA;AACA;AACA;EACIG,OAAOA,CAACC,GAAG,EACX;AACI,IAAA,MAAMX,GAAG,GAAG,IAAI,CAACA,GAAG;AACpBA,IAAAA,GAAG,CAACW,GAAG,CAAC,IAAI,IAAI,CAACR,GAAG;IACpB,IAAI,CAACD,IAAI,GAAI,IAAI,CAACA,IAAI,GAAG,CAAC,GAAI,IAAI;AAClC,IAAA,IAAI,IAAI,CAACA,IAAI,KAAK,CAAC,EACnB;AACIF,MAAAA,GAAG,CAACW,GAAG,CAAC,IAAI,IAAI,CAACP,OAAO;AACxB,MAAA,MAAMP,GAAG,GAAG,IAAI,CAACA,GAAG;AACpB,MAAA,MAAMF,CAAC,GAAG,IAAI,CAACF,WAAW;MAC1B,IAAImB,GAAG,GAAG,CAAC;MACX,KAAK,IAAIxB,CAAC,GAAG,CAAC,EAAEA,CAAC,IAAIO,CAAC,EAAEP,CAAC,EAAE,EAC3B;AACIwB,QAAAA,GAAG,IAAIZ,GAAG,CAACZ,CAAC,GAAG,CAAC,CAAC;QACjBS,GAAG,CAACT,CAAC,CAAC,IAAKwB,GAAG,GAAGf,GAAG,CAACT,CAAC,CAAC,IAAK,CAAC;AAC7BY,QAAAA,GAAG,CAACZ,CAAC,GAAG,CAAC,CAAC,GAAG,CAAC;AAClB,MAAA;MACA,IAAI,CAACkB,aAAa,EAAE;AACxB,IAAA;AACJ,EAAA;AACJ;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACO,SAASO,kBAAkBA,CAACC,KAAK,EAAEC,YAAY,EACtD;AACI,EAAA,MAAMC,GAAG,GAAG,IAAIC,UAAU,CAACF,YAAY,CAAC;EACxC,IAAIA,YAAY,KAAK,CAAC,EACtB;AACI,IAAA,OAAOC,GAAG;AACd,EAAA;AAEA,EAAA,MAAME,SAAS,GAAGJ,KAAK,CAACK,MAAM,KAAK,CAAC;EACpC,IAAIC,SAAS,GAAG,CAAC;EAEjB,SAASC,QAAQA,GACjB;IACI,IAAID,SAAS,IAAIF,SAAS,EAC1B;AACI,MAAA,MAAM,IAAII,KAAK,CAAC,4BAA4B,CAAC;AACjD,IAAA;AACA,IAAA,MAAMC,CAAC,GAAGH,SAAS,GAAG,CAAC;AACvBA,IAAAA,SAAS,EAAE;AACX,IAAA,OAAON,KAAK,CAACS,CAAC,CAAC,GAAIT,KAAK,CAACS,CAAC,GAAG,CAAC,CAAC,IAAI,CAAE;AACzC,EAAA;AAEA,EAAA,IAAIF,QAAQ,EAAE,KAAKpC,KAAK,EACxB;AACI,IAAA,MAAM,IAAIqC,KAAK,CAAC,0BAA0B,CAAC;AAC/C,EAAA;;AAEA;AACA;AACA,EAAA,MAAME,aAAa,GAAG,CAClB,IAAIjC,cAAc,CAAC,GAAG,EAAE,EAAE,CAAC,EAC3B,IAAIA,cAAc,CAAC,GAAG,EAAE,EAAE,CAAC,EAC3B,IAAIA,cAAc,CAAC,GAAG,EAAE,EAAE,CAAC,EAC3B,IAAIA,cAAc,CAAC,GAAG,EAAE,EAAE,CAAC,CAC9B;AACD,EAAA,MAAMkC,cAAc,GAAG,CACnB,IAAIlC,cAAc,CAAC,EAAE,EAAE,CAAC,CAAC,EACzB,IAAIA,cAAc,CAAC,EAAE,EAAE,CAAC,CAAC,EACzB,IAAIA,cAAc,CAAC,EAAE,EAAE,CAAC,CAAC,EACzB,IAAIA,cAAc,CAAC,EAAE,EAAE,CAAC,CAAC,CAC5B;EACD,MAAMmC,aAAa,GAAG,IAAInC,cAAc,CAAC,EAAE,EAAE,CAAC,CAAC;;AAE/C;AACA;EACA,MAAMoC,aAAa,GAAG,IAAIxC,YAAY,CAAC,CAAC,CAAC,CAACc,IAAI,CAAC,CAAC,CAAC;EACjD,IAAI2B,WAAW,GAAG,UAAU;;AAE5B;EACA,IAAIC,WAAW,GAAG,CAAC;;AAEnB;EACA,IAAIC,MAAM,GAAG,CAAC;EACd,IAAIC,MAAM,GAAG,CAAC;EAEd,SAASC,iBAAiBA,GAC1B;IACI,IAAIC,MAAM,GAAGZ,QAAQ,EAAE,GAAG,OAAO,GAAGA,QAAQ,EAAE;AAC9C,IAAA,MAAMa,KAAK,GAAGD,MAAM,GAAG,EAAE;IACzBA,MAAM,GAAG5C,IAAI,CAACU,KAAK,CAACkC,MAAM,GAAG,EAAE,CAAC;IAChC,IAAIA,MAAM,GAAG,OAAO,EACpB;AACIA,MAAAA,MAAM,GAAGA,MAAM,GAAG,OAAO,GAAGZ,QAAQ,EAAE;AAC1C,IAAA;AACAS,IAAAA,MAAM,GAAGI,KAAK,KAAK,CAAC,GAAGD,MAAM,GAAG5C,IAAI,CAACU,KAAK,CAACkC,MAAM,GAAG/C,IAAI,CAACgD,KAAK,CAAC,CAAC;IAChE,IAAIJ,MAAM,GAAG,OAAO,EACpB;AACIA,MAAAA,MAAM,GAAGA,MAAM,GAAG,OAAO,GAAGT,QAAQ,EAAE;AAC1C,IAAA;AACA,IAAA,MAAMc,OAAO,GAAGjD,IAAI,CAAC,EAAE,GAAGgD,KAAK,CAAC;AAChCH,IAAAA,MAAM,GAAG,CAAEE,MAAM,GAAG,OAAO,GAAI,OAAO,GAAGZ,QAAQ,EAAE,IAAIc,OAAO,GAAGA,OAAO;AAC5E,EAAA;EAEA,SAASC,OAAOA,CAACC,CAAC,EAClB;AACI,IAAA,MAAMC,KAAK,GAAGR,MAAM,GAAG5C,IAAI,CAACmD,CAAC,CAAC;IAC9BP,MAAM,GAAGzC,IAAI,CAACU,KAAK,CAAC+B,MAAM,GAAG5C,IAAI,CAACmD,CAAC,CAAC,CAAC;IACrC,IAAIP,MAAM,GAAG,OAAO,EACpB;AACIA,MAAAA,MAAM,GAAGA,MAAM,GAAG,OAAO,GAAGT,QAAQ,EAAE;AAC1C,IAAA;IACA,MAAMkB,CAAC,GAAGT,MAAM;AAChBA,IAAAA,MAAM,GAAGC,MAAM;AACfA,IAAAA,MAAM,GAAGQ,CAAC;AACV,IAAA,OAAOD,KAAK;AAChB,EAAA;EAEA,SAASE,SAASA,CAACC,KAAK,EACxB;AACI,IAAA,MAAM5C,GAAG,GAAG4C,KAAK,CAAC5C,GAAG;AACrB,IAAA,MAAM6C,IAAI,GAAGZ,MAAM,GAAI/C,KAAK,GAAG,CAAE;IACjC,IAAI4B,GAAG,GAAG8B,KAAK,CAACpC,MAAM,CAACqC,IAAI,KAAK,CAAC,CAAC;IAClC,OAAOA,IAAI,IAAI7C,GAAG,CAACc,GAAG,GAAG,CAAC,CAAC,EAC3B;AACIA,MAAAA,GAAG,EAAE;AACT,IAAA;AACAmB,IAAAA,MAAM,GAAGzC,IAAI,CAACU,KAAK,CAAC+B,MAAM,GAAG/C,KAAK,CAAC,IAAIc,GAAG,CAACc,GAAG,GAAG,CAAC,CAAC,GAAGd,GAAG,CAACc,GAAG,CAAC,CAAC,IAAI+B,IAAI,GAAG7C,GAAG,CAACc,GAAG,CAAC,CAAC;IACnF,IAAImB,MAAM,GAAG,OAAO,EACpB;AACIA,MAAAA,MAAM,GAAGA,MAAM,GAAG,OAAO,GAAGT,QAAQ,EAAE;AAC1C,IAAA;AACAoB,IAAAA,KAAK,CAAC/B,OAAO,CAACC,GAAG,CAAC;IAClB,MAAM4B,CAAC,GAAGT,MAAM;AAChBA,IAAAA,MAAM,GAAGC,MAAM;AACfA,IAAAA,MAAM,GAAGQ,CAAC;AACV,IAAA,OAAO5B,GAAG;AACd,EAAA;EAEA,IAAIgC,MAAM,GAAG,CAAC;EACd,OAAOA,MAAM,GAAG5B,YAAY,EAC5B;AACI,IAAA,MAAM6B,UAAU,GAAGvD,IAAI,CAACwD,GAAG,CAAC9B,YAAY,EAAE4B,MAAM,GAAIA,MAAM,GAAG3D,aAAc,GAAGA,aAAa,CAAC;IAE5F,IAAIoC,SAAS,IAAIF,SAAS,EAC1B;AACI,MAAA,MAAM,IAAII,KAAK,CAAC,4BAA4B,CAAC;AACjD,IAAA;AACA,IAAA,MAAMwB,OAAO,GAAG1B,SAAS,GAAG,CAAC;AAC7B,IAAA,MAAM2B,IAAI,GAAGjC,KAAK,CAACgC,OAAO,CAAC,GAAIhC,KAAK,CAACgC,OAAO,GAAG,CAAC,CAAC,IAAI,CAAE;IAEvD,IAAIC,IAAI,KAAK,CAAC,EACd;AACI;AACA;AACA3B,MAAAA,SAAS,EAAE;AACX,MAAA,MAAM4B,cAAc,GAAG9B,SAAS,GAAGE,SAAS;AAC5C,MAAA,MAAM6B,gBAAgB,GAAGL,UAAU,GAAGD,MAAM;MAC5C,MAAMxB,MAAM,GAAG9B,IAAI,CAACwD,GAAG,CAACG,cAAc,GAAG,CAAC,EAAEC,gBAAgB,CAAC;AAC7D,MAAA,MAAMC,KAAK,GAAG9B,SAAS,GAAG,CAAC;AAC3BJ,MAAAA,GAAG,CAACmC,GAAG,CAACrC,KAAK,CAACsC,QAAQ,CAACF,KAAK,EAAEA,KAAK,GAAG/B,MAAM,CAAC,EAAEwB,MAAM,CAAC;AACtDA,MAAAA,MAAM,IAAIxB,MAAM;AAChB;AACA;MACAC,SAAS,IAAID,MAAM,IAAI,CAAC;AACxB,MAAA;AACJ,IAAA;;AAEA;AACAa,IAAAA,iBAAiB,EAAE;IAEnB,IAAIW,MAAM,KAAK,CAAC,EAChB;AACI3B,MAAAA,GAAG,CAAC,CAAC,CAAC,GAAGoB,OAAO,CAAC,CAAC,CAAC;AACnBO,MAAAA,MAAM,GAAG,CAAC;AACd,IAAA;IAEA,OAAOA,MAAM,GAAGC,UAAU,EAC1B;AACI,MAAA,MAAMS,KAAK,GAAGV,MAAM,GAAG,CAAC;MACxB,MAAMW,OAAO,GAAGd,SAAS,CAAChB,aAAa,CAAC6B,KAAK,CAAC,CAAC;MAE/C,IAAIC,OAAO,GAAG,GAAG,EACjB;AACI;AACA;AACAtC,QAAAA,GAAG,CAAC2B,MAAM,CAAC,GAAIW,OAAO,GAAGtC,GAAG,CAAC2B,MAAM,GAAGd,WAAW,CAAC,GAAI,IAAI;AAC1Dc,QAAAA,MAAM,EAAE;AACR,QAAA;AACJ,MAAA;;AAEA;AACA,MAAA,IAAIY,UAAU;MACd,IAAID,OAAO,GAAG,GAAG,EACjB;QACIC,UAAU,GAAGD,OAAO,GAAG,GAAG;AAC9B,MAAA,CAAC,MAED;AACI,QAAA,MAAMjB,CAAC,GAAGiB,OAAO,GAAG,GAAG;QACvBC,UAAU,GAAGrE,IAAI,CAACmD,CAAC,CAAC,GAAGD,OAAO,CAACC,CAAC,CAAC,GAAG,EAAE;AAC1C,MAAA;;AAEA;MACA,MAAMmB,GAAG,GAAGhB,SAAS,CAACf,cAAc,CAAC4B,KAAK,CAAC,CAAC;AAC5C,MAAA,IAAII,UAAU;MACd,IAAID,GAAG,GAAG,CAAC,EACX;AACI;AACA;AACA,QAAA,MAAME,KAAK,GAAG,CAAC,GAAGF,GAAG;AACrB,QAAA,MAAMG,IAAI,GAAI/B,WAAW,KAAK8B,KAAK,GAAI,EAAE;AACzCD,QAAAA,UAAU,GAAG9B,aAAa,CAACgC,IAAI,CAAC;QAChC,IAAIH,GAAG,KAAK,CAAC,EACb;UACI5B,WAAW,GAAG,CAAEA,WAAW,IAAI,CAAC,GAAI+B,IAAI,MAAM,CAAC;AACnD,QAAA,CAAC,MACI,IAAIH,GAAG,GAAG,CAAC,EAChB;AACI,UAAA,MAAMI,IAAI,GAAG,CAAC,EAAE,IAAIF,KAAK,IAAI,CAAC;AAC9B9B,UAAAA,WAAW,GAAG,CAAEA,WAAW,GAAG,CAACgC,IAAI,GAAK,CAAEhC,WAAW,IAAI,CAAC,GAAI+B,IAAI,IAAIC,IAAK,MAAM,CAAC;AACtF,QAAA;AACJ,MAAA,CAAC,MAED;AACI;AACA;AACA,QAAA,MAAMvB,CAAC,GAAGG,SAAS,CAACd,aAAa,CAAC;AAClC,QAAA,IAAImC,KAAK,GAAGzB,OAAO,CAACC,CAAC,GAAG,EAAE,CAAC;QAC3B,IAAIA,CAAC,IAAI,EAAE,EACX;AACIwB,UAAAA,KAAK,GAAGA,KAAK,GAAG,OAAO,GAAGxC,QAAQ,EAAE;AACxC,QAAA;AACAoC,QAAAA,UAAU,GAAG,EAAE,GAAGvE,IAAI,CAACmD,CAAC,CAAC,GAAGwB,KAAK,GAAG,EAAE,GAAGL,GAAG,GAAG,EAAE;AACjD;AACA;AACA,QAAA,MAAMM,KAAK,GAAIlC,WAAW,KAAK,EAAE,GAAI,EAAE;AACvC,QAAA,MAAMmC,KAAK,GAAInC,WAAW,KAAK,EAAE,GAAI,EAAE;AACvCD,QAAAA,aAAa,CAACmC,KAAK,CAAC,GAAGnC,aAAa,CAACoC,KAAK,CAAC;AAC3CpC,QAAAA,aAAa,CAACoC,KAAK,CAAC,GAAGN,UAAU;AACrC,MAAA;AAEA5B,MAAAA,WAAW,GAAG4B,UAAU;AACxB,MAAA,MAAMO,GAAG,GAAGrB,MAAM,GAAGc,UAAU;MAC/B,IAAIO,GAAG,GAAG,CAAC,EACX;AACI,QAAA,MAAM,IAAI1C,KAAK,CAAC,4CAA4C,CAAC;AACjE,MAAA;AACA;MACA,KAAK,IAAIlC,CAAC,GAAG,CAAC,EAAEA,CAAC,GAAGmE,UAAU,EAAEnE,CAAC,EAAE,EACnC;QACI4B,GAAG,CAAC2B,MAAM,GAAGvD,CAAC,CAAC,GAAG4B,GAAG,CAACgD,GAAG,GAAG5E,CAAC,CAAC;AAClC,MAAA;AACAuD,MAAAA,MAAM,IAAIY,UAAU;AACxB,IAAA;AAEA,IAAA,IAAIzB,MAAM,KAAK,OAAO,IAAIC,MAAM,KAAK,OAAO,EAC5C;AACI,MAAA,MAAM,IAAIT,KAAK,CAAC,qCAAqC,CAAC;AAC1D,IAAA;AACJ,EAAA;AAEA,EAAA,OAAON,GAAG;AACd;;;;"}