@carbonenginejs/runtime 0.1.0-alpha.0 → 0.1.0-alpha.1

package/dist/global/math/pool.js.map

@@ -1 +1 @@
-{"version":3,"file":"pool.js","sources":["../../../../src/global/math/pool.js"],"sourcesContent":["import {\r\n    GL_BYTE,\r\n    GL_UNSIGNED_BYTE,\r\n    GL_SHORT,\r\n    GL_UNSIGNED_SHORT,\r\n    GL_INT,\r\n    GL_UNSIGNED_INT,\r\n    GL_FLOAT\r\n} from \"../consts/constants.js\";\r\n\r\n\r\nfunction loop(n, f)\r\n{\r\n    const result = Array(n);\r\n    for (let i = 0; i < n; ++i) result[i] = f(i);\r\n    return result;\r\n}\r\n\r\nfunction nextPow16(v)\r\n{\r\n    for (let i = 16; i <= (1 << 28); i *= 16)\r\n    {\r\n        if (v <= i) return i;\r\n    }\r\n    return 0;\r\n}\r\n\r\nfunction log2(v)\r\n{\r\n    let r, shift;\r\n    r = (v > 0xFFFF) << 4;\r\n    v >>>= r;\r\n    shift = (v > 0xFF) << 3;\r\n    v >>>= shift;\r\n    r |= shift;\r\n    shift = (v > 0xF) << 2;\r\n    v >>>= shift;\r\n    r |= shift;\r\n    shift = (v > 0x3) << 1;\r\n    v >>>= shift;\r\n    r |= shift;\r\n    return r | (v >> 1);\r\n}\r\n\r\n/** Creates a reusable typed-array pool for a supported graphics scalar type. */\r\nexport function createPool()\r\n{\r\n\r\n    const bufferPool = loop(8, function ()\r\n    {\r\n        return [];\r\n    });\r\n\r\n    function free(buf)\r\n    {\r\n        bufferPool[log2(buf.byteLength) >> 2].push(buf);\r\n    }\r\n\r\n    function alloc(n)\r\n    {\r\n        let sz = nextPow16(n),\r\n            bin = bufferPool[log2(sz) >> 2];\r\n\r\n        if (bin.length > 0) return bin.pop();\r\n\r\n        return new ArrayBuffer(sz);\r\n    }\r\n\r\n    /**\r\n     * Shortcut to allocating a float 32 array\r\n     * @param {Number} length\r\n     * @returns {Float32Array}\r\n     */\r\n    function allocF32(length)\r\n    {\r\n        const result = new Float32Array(alloc(4 * length), 0, length);\r\n        return result.length !== length ? result.subarray(0, length) : result;\r\n    }\r\n\r\n    /**\r\n     * Allocated a typed array of a given size\r\n     * @param {Number|Function}type\r\n     * @param {Number} n\r\n     * @returns {Int8Array|Uint8Array|Int16Array|Uint16Array|Int32Array|Uint32Array|Float32Array|null}\r\n     */\r\n    function allocType(type, n)\r\n    {\r\n        let result = null;\r\n        switch (type)\r\n        {\r\n            case GL_BYTE:\r\n            case Int8Array:\r\n                result = new Int8Array(alloc(n), 0, n);\r\n                break;\r\n\r\n            case GL_UNSIGNED_BYTE:\r\n            case Uint8Array:\r\n                result = new Uint8Array(alloc(n), 0, n);\r\n                break;\r\n\r\n            case GL_SHORT:\r\n            case Int16Array:\r\n                result = new Int16Array(alloc(2 * n), 0, n);\r\n                break;\r\n\r\n            case GL_UNSIGNED_SHORT:\r\n            case Uint16Array:\r\n                result = new Uint16Array(alloc(2 * n), 0, n);\r\n                break;\r\n\r\n            case GL_INT:\r\n            case Int32Array:\r\n                result = new Int32Array(alloc(4 * n), 0, n);\r\n                break;\r\n\r\n            case GL_UNSIGNED_INT:\r\n            case Uint32Array:\r\n                result = new Uint32Array(alloc(4 * n), 0, n);\r\n                break;\r\n\r\n            case GL_FLOAT:\r\n            case Float32Array:\r\n                result = new Float32Array(alloc(4 * n), 0, n);\r\n                break;\r\n\r\n            default:\r\n                return null;\r\n        }\r\n\r\n        if (result.length !== n)\r\n        {\r\n            return result.subarray(0, n);\r\n        }\r\n\r\n        return result;\r\n    }\r\n\r\n    function freeType(array)\r\n    {\r\n        free(array.buffer);\r\n    }\r\n\r\n    return {\r\n        allocF32,\r\n        allocType,\r\n        unalloc: freeType,\r\n        freeType,\r\n        free\r\n    };\r\n\r\n}\r\n\r\nexport const pool = createPool();\r\n\r\nexport const {\r\n    allocF32,\r\n    allocType,\r\n    unalloc,\r\n    freeType,\r\n    free\r\n} = pool;\r\n"],"names":["loop","n","f","result","Array","i","nextPow16","v","log2","r","shift","createPool","bufferPool","free","buf","byteLength","push","alloc","sz","bin","length","pop","ArrayBuffer","allocF32","Float32Array","subarray","allocType","type","GL_BYTE","Int8Array","GL_UNSIGNED_BYTE","Uint8Array","GL_SHORT","Int16Array","GL_UNSIGNED_SHORT","Uint16Array","GL_INT","Int32Array","GL_UNSIGNED_INT","Uint32Array","GL_FLOAT","freeType","array","buffer","unalloc","pool"],"mappings":";;AAWA,SAASA,IAAIA,CAACC,CAAC,EAAEC,CAAC,EAClB;AACI,EAAA,MAAMC,MAAM,GAAGC,KAAK,CAACH,CAAC,CAAC;EACvB,KAAK,IAAII,CAAC,GAAG,CAAC,EAAEA,CAAC,GAAGJ,CAAC,EAAE,EAAEI,CAAC,EAAEF,MAAM,CAACE,CAAC,CAAC,GAAGH,CAAC,CAACG,CAAC,CAAC;AAC5C,EAAA,OAAOF,MAAM;AACjB;AAEA,SAASG,SAASA,CAACC,CAAC,EACpB;AACI,EAAA,KAAK,IAAIF,CAAC,GAAG,EAAE,EAAEA,CAAC,IAAK,CAAC,IAAI,EAAG,EAAEA,CAAC,IAAI,EAAE,EACxC;AACI,IAAA,IAAIE,CAAC,IAAIF,CAAC,EAAE,OAAOA,CAAC;AACxB,EAAA;AACA,EAAA,OAAO,CAAC;AACZ;AAEA,SAASG,IAAIA,CAACD,CAAC,EACf;EACI,IAAIE,CAAC,EAAEC,KAAK;AACZD,EAAAA,CAAC,GAAG,CAACF,CAAC,GAAG,MAAM,KAAK,CAAC;AACrBA,EAAAA,CAAC,MAAME,CAAC;AACRC,EAAAA,KAAK,GAAG,CAACH,CAAC,GAAG,IAAI,KAAK,CAAC;AACvBA,EAAAA,CAAC,MAAMG,KAAK;AACZD,EAAAA,CAAC,IAAIC,KAAK;AACVA,EAAAA,KAAK,GAAG,CAACH,CAAC,GAAG,GAAG,KAAK,CAAC;AACtBA,EAAAA,CAAC,MAAMG,KAAK;AACZD,EAAAA,CAAC,IAAIC,KAAK;AACVA,EAAAA,KAAK,GAAG,CAACH,CAAC,GAAG,GAAG,KAAK,CAAC;AACtBA,EAAAA,CAAC,MAAMG,KAAK;AACZD,EAAAA,CAAC,IAAIC,KAAK;AACV,EAAA,OAAOD,CAAC,GAAIF,CAAC,IAAI,CAAE;AACvB;;AAEA;AACO,SAASI,UAAUA,GAC1B;AAEI,EAAA,MAAMC,UAAU,GAAGZ,IAAI,CAAC,CAAC,EAAE,YAC3B;AACI,IAAA,OAAO,EAAE;AACb,EAAA,CAAC,CAAC;EAEF,SAASa,IAAIA,CAACC,GAAG,EACjB;AACIF,IAAAA,UAAU,CAACJ,IAAI,CAACM,GAAG,CAACC,UAAU,CAAC,IAAI,CAAC,CAAC,CAACC,IAAI,CAACF,GAAG,CAAC;AACnD,EAAA;EAEA,SAASG,KAAKA,CAAChB,CAAC,EAChB;AACI,IAAA,IAAIiB,EAAE,GAAGZ,SAAS,CAACL,CAAC,CAAC;MACjBkB,GAAG,GAAGP,UAAU,CAACJ,IAAI,CAACU,EAAE,CAAC,IAAI,CAAC,CAAC;IAEnC,IAAIC,GAAG,CAACC,MAAM,GAAG,CAAC,EAAE,OAAOD,GAAG,CAACE,GAAG,EAAE;AAEpC,IAAA,OAAO,IAAIC,WAAW,CAACJ,EAAE,CAAC;AAC9B,EAAA;;AAEA;AACJ;AACA;AACA;AACA;EACI,SAASK,QAAQA,CAACH,MAAM,EACxB;AACI,IAAA,MAAMjB,MAAM,GAAG,IAAIqB,YAAY,CAACP,KAAK,CAAC,CAAC,GAAGG,MAAM,CAAC,EAAE,CAAC,EAAEA,MAAM,CAAC;AAC7D,IAAA,OAAOjB,MAAM,CAACiB,MAAM,KAAKA,MAAM,GAAGjB,MAAM,CAACsB,QAAQ,CAAC,CAAC,EAAEL,MAAM,CAAC,GAAGjB,MAAM;AACzE,EAAA;;AAEA;AACJ;AACA;AACA;AACA;AACA;AACI,EAAA,SAASuB,SAASA,CAACC,IAAI,EAAE1B,CAAC,EAC1B;IACI,IAAIE,MAAM,GAAG,IAAI;AACjB,IAAA,QAAQwB,IAAI;AAER,MAAA,KAAKC,OAAO;AACZ,MAAA,KAAKC,SAAS;AACV1B,QAAAA,MAAM,GAAG,IAAI0B,SAAS,CAACZ,KAAK,CAAChB,CAAC,CAAC,EAAE,CAAC,EAAEA,CAAC,CAAC;AACtC,QAAA;AAEJ,MAAA,KAAK6B,gBAAgB;AACrB,MAAA,KAAKC,UAAU;AACX5B,QAAAA,MAAM,GAAG,IAAI4B,UAAU,CAACd,KAAK,CAAChB,CAAC,CAAC,EAAE,CAAC,EAAEA,CAAC,CAAC;AACvC,QAAA;AAEJ,MAAA,KAAK+B,QAAQ;AACb,MAAA,KAAKC,UAAU;AACX9B,QAAAA,MAAM,GAAG,IAAI8B,UAAU,CAAChB,KAAK,CAAC,CAAC,GAAGhB,CAAC,CAAC,EAAE,CAAC,EAAEA,CAAC,CAAC;AAC3C,QAAA;AAEJ,MAAA,KAAKiC,iBAAiB;AACtB,MAAA,KAAKC,WAAW;AACZhC,QAAAA,MAAM,GAAG,IAAIgC,WAAW,CAAClB,KAAK,CAAC,CAAC,GAAGhB,CAAC,CAAC,EAAE,CAAC,EAAEA,CAAC,CAAC;AAC5C,QAAA;AAEJ,MAAA,KAAKmC,MAAM;AACX,MAAA,KAAKC,UAAU;AACXlC,QAAAA,MAAM,GAAG,IAAIkC,UAAU,CAACpB,KAAK,CAAC,CAAC,GAAGhB,CAAC,CAAC,EAAE,CAAC,EAAEA,CAAC,CAAC;AAC3C,QAAA;AAEJ,MAAA,KAAKqC,eAAe;AACpB,MAAA,KAAKC,WAAW;AACZpC,QAAAA,MAAM,GAAG,IAAIoC,WAAW,CAACtB,KAAK,CAAC,CAAC,GAAGhB,CAAC,CAAC,EAAE,CAAC,EAAEA,CAAC,CAAC;AAC5C,QAAA;AAEJ,MAAA,KAAKuC,QAAQ;AACb,MAAA,KAAKhB,YAAY;AACbrB,QAAAA,MAAM,GAAG,IAAIqB,YAAY,CAACP,KAAK,CAAC,CAAC,GAAGhB,CAAC,CAAC,EAAE,CAAC,EAAEA,CAAC,CAAC;AAC7C,QAAA;AAEJ,MAAA;AACI,QAAA,OAAO,IAAI;AACnB;AAEA,IAAA,IAAIE,MAAM,CAACiB,MAAM,KAAKnB,CAAC,EACvB;AACI,MAAA,OAAOE,MAAM,CAACsB,QAAQ,CAAC,CAAC,EAAExB,CAAC,CAAC;AAChC,IAAA;AAEA,IAAA,OAAOE,MAAM;AACjB,EAAA;EAEA,SAASsC,QAAQA,CAACC,KAAK,EACvB;AACI7B,IAAAA,IAAI,CAAC6B,KAAK,CAACC,MAAM,CAAC;AACtB,EAAA;EAEA,OAAO;IACHpB,QAAQ;IACRG,SAAS;AACTkB,IAAAA,OAAO,EAAEH,QAAQ;IACjBA,QAAQ;AACR5B,IAAAA;GACH;AAEL;AAEO,MAAMgC,IAAI,GAAGlC,UAAU;AAEvB,MAAM;EACTY,QAAQ;EACRG,SAAS;EACTkB,OAAO;EACPH,QAAQ;AACR5B,EAAAA;AACJ,CAAC,GAAGgC;;;;"}
+{"version":3,"file":"pool.js","sources":["../../../../src/global/math/pool.js"],"sourcesContent":["import {\r\n    GL_BYTE,\r\n    GL_UNSIGNED_BYTE,\r\n    GL_SHORT,\r\n    GL_UNSIGNED_SHORT,\r\n    GL_INT,\r\n    GL_UNSIGNED_INT,\r\n    GL_FLOAT\r\n} from \"../consts/constants.js\";\r\n\r\n// A LIVE ESM binding, deliberately. gl-matrix reassigns this when a consumer\r\n// calls `setMatrixArrayType`, and an ESM import reflects that reassignment,\r\n// so the pool keeps following it rather than capturing the type at load.\r\nimport { ARRAY_TYPE } from \"gl-matrix/esm/common.js\";\r\n\r\n\r\nfunction loop(n, f)\r\n{\r\n    const result = Array(n);\r\n    for (let i = 0; i < n; ++i) result[i] = f(i);\r\n    return result;\r\n}\r\n\r\nfunction nextPow16(v)\r\n{\r\n    for (let i = 16; i <= (1 << 28); i *= 16)\r\n    {\r\n        if (v <= i) return i;\r\n    }\r\n    return 0;\r\n}\r\n\r\nfunction log2(v)\r\n{\r\n    let r, shift;\r\n    r = (v > 0xFFFF) << 4;\r\n    v >>>= r;\r\n    shift = (v > 0xFF) << 3;\r\n    v >>>= shift;\r\n    r |= shift;\r\n    shift = (v > 0xF) << 2;\r\n    v >>>= shift;\r\n    r |= shift;\r\n    shift = (v > 0x3) << 1;\r\n    v >>>= shift;\r\n    r |= shift;\r\n    return r | (v >> 1);\r\n}\r\n\r\n/** Creates a reusable typed-array pool for a supported graphics scalar type. */\r\nexport function createPool()\r\n{\r\n\r\n    const bufferPool = loop(8, function ()\r\n    {\r\n        return [];\r\n    });\r\n\r\n    function free(buf)\r\n    {\r\n        bufferPool[log2(buf.byteLength) >> 2].push(buf);\r\n    }\r\n\r\n    function alloc(n)\r\n    {\r\n        let sz = nextPow16(n),\r\n            bin = bufferPool[log2(sz) >> 2];\r\n\r\n        if (bin.length > 0) return bin.pop();\r\n\r\n        return new ArrayBuffer(sz);\r\n    }\r\n\r\n    /**\r\n     * Shortcut to allocating an array of gl-matrix's own scalar type.\r\n     *\r\n     * The name says F32 and in every environment we ship it IS Float32Array,\r\n     * because that is what `glMatrix.ARRAY_TYPE` defaults to. But gl-matrix owns\r\n     * that choice and exposes `setMatrixArrayType` to change it, so hardcoding\r\n     * the type here is a real defect: `vec3.alloc()` would hand back a narrower\r\n     * array than `vec3.create()` the moment anything overrode it, and every\r\n     * pooled temporary in the math tree would silently round. Following\r\n     * `ARRAY_TYPE` is what makes a pooled vector interchangeable with a created\r\n     * one. Inherited from ccpwgl, where the same hardcoding is still present.\r\n     *\r\n     * @param {Number} length\r\n     * @returns {Float32Array|Float64Array} gl-matrix's scalar type.\r\n     */\r\n    function allocF32(length)\r\n    {\r\n        // gl-matrix falls back to plain `Array` only where Float32Array does not\r\n        // exist, which cannot happen anywhere this runs; the pool hands out views\r\n        // over a shared ArrayBuffer, so it needs a real typed array either way.\r\n        const\r\n            ScalarArray = ARRAY_TYPE.BYTES_PER_ELEMENT ? ARRAY_TYPE : Float32Array,\r\n            result = new ScalarArray(alloc(ScalarArray.BYTES_PER_ELEMENT * length), 0, length);\r\n\r\n        return result.length !== length ? result.subarray(0, length) : result;\r\n    }\r\n\r\n    /**\r\n     * Allocated a typed array of a given size\r\n     * @param {Number|Function}type\r\n     * @param {Number} n\r\n     * @returns {Int8Array|Uint8Array|Int16Array|Uint16Array|Int32Array|Uint32Array|Float32Array|null}\r\n     */\r\n    function allocType(type, n)\r\n    {\r\n        let result = null;\r\n        switch (type)\r\n        {\r\n            case GL_BYTE:\r\n            case Int8Array:\r\n                result = new Int8Array(alloc(n), 0, n);\r\n                break;\r\n\r\n            case GL_UNSIGNED_BYTE:\r\n            case Uint8Array:\r\n                result = new Uint8Array(alloc(n), 0, n);\r\n                break;\r\n\r\n            case GL_SHORT:\r\n            case Int16Array:\r\n                result = new Int16Array(alloc(2 * n), 0, n);\r\n                break;\r\n\r\n            case GL_UNSIGNED_SHORT:\r\n            case Uint16Array:\r\n                result = new Uint16Array(alloc(2 * n), 0, n);\r\n                break;\r\n\r\n            case GL_INT:\r\n            case Int32Array:\r\n                result = new Int32Array(alloc(4 * n), 0, n);\r\n                break;\r\n\r\n            case GL_UNSIGNED_INT:\r\n            case Uint32Array:\r\n                result = new Uint32Array(alloc(4 * n), 0, n);\r\n                break;\r\n\r\n            case GL_FLOAT:\r\n            case Float32Array:\r\n                result = new Float32Array(alloc(4 * n), 0, n);\r\n                break;\r\n\r\n            default:\r\n                return null;\r\n        }\r\n\r\n        if (result.length !== n)\r\n        {\r\n            return result.subarray(0, n);\r\n        }\r\n\r\n        return result;\r\n    }\r\n\r\n    function freeType(array)\r\n    {\r\n        free(array.buffer);\r\n    }\r\n\r\n    return {\r\n        allocF32,\r\n        allocType,\r\n        unalloc: freeType,\r\n        freeType,\r\n        free\r\n    };\r\n\r\n}\r\n\r\nexport const pool = createPool();\r\n\r\nexport const {\r\n    allocF32,\r\n    allocType,\r\n    unalloc,\r\n    freeType,\r\n    free\r\n} = pool;\r\n"],"names":["loop","n","f","result","Array","i","nextPow16","v","log2","r","shift","createPool","bufferPool","free","buf","byteLength","push","alloc","sz","bin","length","pop","ArrayBuffer","allocF32","ScalarArray","ARRAY_TYPE","BYTES_PER_ELEMENT","Float32Array","subarray","allocType","type","GL_BYTE","Int8Array","GL_UNSIGNED_BYTE","Uint8Array","GL_SHORT","Int16Array","GL_UNSIGNED_SHORT","Uint16Array","GL_INT","Int32Array","GL_UNSIGNED_INT","Uint32Array","GL_FLOAT","freeType","array","buffer","unalloc","pool"],"mappings":";;;AAgBA,SAASA,IAAIA,CAACC,CAAC,EAAEC,CAAC,EAClB;AACI,EAAA,MAAMC,MAAM,GAAGC,KAAK,CAACH,CAAC,CAAC;EACvB,KAAK,IAAII,CAAC,GAAG,CAAC,EAAEA,CAAC,GAAGJ,CAAC,EAAE,EAAEI,CAAC,EAAEF,MAAM,CAACE,CAAC,CAAC,GAAGH,CAAC,CAACG,CAAC,CAAC;AAC5C,EAAA,OAAOF,MAAM;AACjB;AAEA,SAASG,SAASA,CAACC,CAAC,EACpB;AACI,EAAA,KAAK,IAAIF,CAAC,GAAG,EAAE,EAAEA,CAAC,IAAK,CAAC,IAAI,EAAG,EAAEA,CAAC,IAAI,EAAE,EACxC;AACI,IAAA,IAAIE,CAAC,IAAIF,CAAC,EAAE,OAAOA,CAAC;AACxB,EAAA;AACA,EAAA,OAAO,CAAC;AACZ;AAEA,SAASG,IAAIA,CAACD,CAAC,EACf;EACI,IAAIE,CAAC,EAAEC,KAAK;AACZD,EAAAA,CAAC,GAAG,CAACF,CAAC,GAAG,MAAM,KAAK,CAAC;AACrBA,EAAAA,CAAC,MAAME,CAAC;AACRC,EAAAA,KAAK,GAAG,CAACH,CAAC,GAAG,IAAI,KAAK,CAAC;AACvBA,EAAAA,CAAC,MAAMG,KAAK;AACZD,EAAAA,CAAC,IAAIC,KAAK;AACVA,EAAAA,KAAK,GAAG,CAACH,CAAC,GAAG,GAAG,KAAK,CAAC;AACtBA,EAAAA,CAAC,MAAMG,KAAK;AACZD,EAAAA,CAAC,IAAIC,KAAK;AACVA,EAAAA,KAAK,GAAG,CAACH,CAAC,GAAG,GAAG,KAAK,CAAC;AACtBA,EAAAA,CAAC,MAAMG,KAAK;AACZD,EAAAA,CAAC,IAAIC,KAAK;AACV,EAAA,OAAOD,CAAC,GAAIF,CAAC,IAAI,CAAE;AACvB;;AAEA;AACO,SAASI,UAAUA,GAC1B;AAEI,EAAA,MAAMC,UAAU,GAAGZ,IAAI,CAAC,CAAC,EAAE,YAC3B;AACI,IAAA,OAAO,EAAE;AACb,EAAA,CAAC,CAAC;EAEF,SAASa,IAAIA,CAACC,GAAG,EACjB;AACIF,IAAAA,UAAU,CAACJ,IAAI,CAACM,GAAG,CAACC,UAAU,CAAC,IAAI,CAAC,CAAC,CAACC,IAAI,CAACF,GAAG,CAAC;AACnD,EAAA;EAEA,SAASG,KAAKA,CAAChB,CAAC,EAChB;AACI,IAAA,IAAIiB,EAAE,GAAGZ,SAAS,CAACL,CAAC,CAAC;MACjBkB,GAAG,GAAGP,UAAU,CAACJ,IAAI,CAACU,EAAE,CAAC,IAAI,CAAC,CAAC;IAEnC,IAAIC,GAAG,CAACC,MAAM,GAAG,CAAC,EAAE,OAAOD,GAAG,CAACE,GAAG,EAAE;AAEpC,IAAA,OAAO,IAAIC,WAAW,CAACJ,EAAE,CAAC;AAC9B,EAAA;;AAEA;AACJ;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;EACI,SAASK,QAAQA,CAACH,MAAM,EACxB;AACI;AACA;AACA;IACA,MACII,WAAW,GAAGC,UAAU,CAACC,iBAAiB,GAAGD,UAAU,GAAGE,YAAY;AACtExB,MAAAA,MAAM,GAAG,IAAIqB,WAAW,CAACP,KAAK,CAACO,WAAW,CAACE,iBAAiB,GAAGN,MAAM,CAAC,EAAE,CAAC,EAAEA,MAAM,CAAC;AAEtF,IAAA,OAAOjB,MAAM,CAACiB,MAAM,KAAKA,MAAM,GAAGjB,MAAM,CAACyB,QAAQ,CAAC,CAAC,EAAER,MAAM,CAAC,GAAGjB,MAAM;AACzE,EAAA;;AAEA;AACJ;AACA;AACA;AACA;AACA;AACI,EAAA,SAAS0B,SAASA,CAACC,IAAI,EAAE7B,CAAC,EAC1B;IACI,IAAIE,MAAM,GAAG,IAAI;AACjB,IAAA,QAAQ2B,IAAI;AAER,MAAA,KAAKC,OAAO;AACZ,MAAA,KAAKC,SAAS;AACV7B,QAAAA,MAAM,GAAG,IAAI6B,SAAS,CAACf,KAAK,CAAChB,CAAC,CAAC,EAAE,CAAC,EAAEA,CAAC,CAAC;AACtC,QAAA;AAEJ,MAAA,KAAKgC,gBAAgB;AACrB,MAAA,KAAKC,UAAU;AACX/B,QAAAA,MAAM,GAAG,IAAI+B,UAAU,CAACjB,KAAK,CAAChB,CAAC,CAAC,EAAE,CAAC,EAAEA,CAAC,CAAC;AACvC,QAAA;AAEJ,MAAA,KAAKkC,QAAQ;AACb,MAAA,KAAKC,UAAU;AACXjC,QAAAA,MAAM,GAAG,IAAIiC,UAAU,CAACnB,KAAK,CAAC,CAAC,GAAGhB,CAAC,CAAC,EAAE,CAAC,EAAEA,CAAC,CAAC;AAC3C,QAAA;AAEJ,MAAA,KAAKoC,iBAAiB;AACtB,MAAA,KAAKC,WAAW;AACZnC,QAAAA,MAAM,GAAG,IAAImC,WAAW,CAACrB,KAAK,CAAC,CAAC,GAAGhB,CAAC,CAAC,EAAE,CAAC,EAAEA,CAAC,CAAC;AAC5C,QAAA;AAEJ,MAAA,KAAKsC,MAAM;AACX,MAAA,KAAKC,UAAU;AACXrC,QAAAA,MAAM,GAAG,IAAIqC,UAAU,CAACvB,KAAK,CAAC,CAAC,GAAGhB,CAAC,CAAC,EAAE,CAAC,EAAEA,CAAC,CAAC;AAC3C,QAAA;AAEJ,MAAA,KAAKwC,eAAe;AACpB,MAAA,KAAKC,WAAW;AACZvC,QAAAA,MAAM,GAAG,IAAIuC,WAAW,CAACzB,KAAK,CAAC,CAAC,GAAGhB,CAAC,CAAC,EAAE,CAAC,EAAEA,CAAC,CAAC;AAC5C,QAAA;AAEJ,MAAA,KAAK0C,QAAQ;AACb,MAAA,KAAKhB,YAAY;AACbxB,QAAAA,MAAM,GAAG,IAAIwB,YAAY,CAACV,KAAK,CAAC,CAAC,GAAGhB,CAAC,CAAC,EAAE,CAAC,EAAEA,CAAC,CAAC;AAC7C,QAAA;AAEJ,MAAA;AACI,QAAA,OAAO,IAAI;AACnB;AAEA,IAAA,IAAIE,MAAM,CAACiB,MAAM,KAAKnB,CAAC,EACvB;AACI,MAAA,OAAOE,MAAM,CAACyB,QAAQ,CAAC,CAAC,EAAE3B,CAAC,CAAC;AAChC,IAAA;AAEA,IAAA,OAAOE,MAAM;AACjB,EAAA;EAEA,SAASyC,QAAQA,CAACC,KAAK,EACvB;AACIhC,IAAAA,IAAI,CAACgC,KAAK,CAACC,MAAM,CAAC;AACtB,EAAA;EAEA,OAAO;IACHvB,QAAQ;IACRM,SAAS;AACTkB,IAAAA,OAAO,EAAEH,QAAQ;IACjBA,QAAQ;AACR/B,IAAAA;GACH;AAEL;AAEO,MAAMmC,IAAI,GAAGrC,UAAU;AAEvB,MAAM;EACTY,QAAQ;EACRM,SAAS;EACTkB,OAAO;EACPH,QAAQ;AACR/B,EAAAA;AACJ,CAAC,GAAGmC;;;;"}

package/dist/global/math/random.js

@@ -0,0 +1,52 @@
+// Source: trinity/trinity/TriMath.cpp
+//   trinity/trinity/Curves/Tr2CurveRandomAxisRotation.cpp
+//
+// Carbon reaches for the C++ standard library's Mersenne Twister directly -
+// `std::mt19937 randGen( seed )` in TriPerlinNoise's constructor (TriMath.cpp:
+// 1023), and `std::default_random_engine`, which is mt19937 under MSVC, in
+// Tr2CurveRandomAxisRotation (:5, :9). JavaScript ships no such generator and a
+// persisted seed must reproduce Carbon's sequence exactly, so the engine itself
+// is ported. That is the platform forcing the divergence, not a design choice.
+//
+// It is a CALLABLE, not a class, because that is how Carbon uses it - `randGen()`
+// - and because the math tree declares namespaces of functions, not classes.
+// Two independent copies of this generator existed before it was one: inline in
+// noise.js and as a private class beside Tr2CurveRandomAxisRotation.
+
+const random = {};
+const STATE_WORDS = 624;
+const TWIST_OFFSET = 397;
+
+/**
+ * Builds a seeded MT19937 engine.
+ *
+ * @param {number} seed Unsigned 32-bit seed.
+ * @returns {() => number} Returns the next 32-bit unsigned value on each call.
+ */
+random.mt19937 = function (seed) {
+  const state = new Uint32Array(STATE_WORDS);
+  state[0] = Number(seed) >>> 0;
+  for (let index = 1; index < STATE_WORDS; index++) {
+    const previous = state[index - 1] ^ state[index - 1] >>> 30;
+    state[index] = Math.imul(1812433253, previous) + index >>> 0;
+  }
+  let cursor = STATE_WORDS;
+  return function () {
+    if (cursor >= STATE_WORDS) {
+      for (let index = 0; index < STATE_WORDS; index++) {
+        const bits = state[index] & 0x80000000 | state[(index + 1) % STATE_WORDS] & 0x7fffffff;
+        state[index] = state[(index + TWIST_OFFSET) % STATE_WORDS] ^ bits >>> 1 ^ (bits & 1 ? 0x9908b0df : 0);
+      }
+      cursor = 0;
+    }
+    let value = state[cursor++];
+    value ^= value >>> 11;
+    value ^= value << 7 & 0x9d2c5680;
+    value ^= value << 15 & 0xefc60000;
+    value ^= value >>> 18;
+    return value >>> 0;
+  };
+};
+
+export { random };
+//# sourceMappingURL=random.js.map

package/dist/global/math/random.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"random.js","sources":["../../../../src/global/math/random.js"],"sourcesContent":["// Source: trinity/trinity/TriMath.cpp\n//   trinity/trinity/Curves/Tr2CurveRandomAxisRotation.cpp\n//\n// Carbon reaches for the C++ standard library's Mersenne Twister directly -\n// `std::mt19937 randGen( seed )` in TriPerlinNoise's constructor (TriMath.cpp:\n// 1023), and `std::default_random_engine`, which is mt19937 under MSVC, in\n// Tr2CurveRandomAxisRotation (:5, :9). JavaScript ships no such generator and a\n// persisted seed must reproduce Carbon's sequence exactly, so the engine itself\n// is ported. That is the platform forcing the divergence, not a design choice.\n//\n// It is a CALLABLE, not a class, because that is how Carbon uses it - `randGen()`\n// - and because the math tree declares namespaces of functions, not classes.\n// Two independent copies of this generator existed before it was one: inline in\n// noise.js and as a private class beside Tr2CurveRandomAxisRotation.\n\nexport const random = {};\n\nconst STATE_WORDS = 624;\nconst TWIST_OFFSET = 397;\n\n/**\n * Builds a seeded MT19937 engine.\n *\n * @param {number} seed Unsigned 32-bit seed.\n * @returns {() => number} Returns the next 32-bit unsigned value on each call.\n */\nrandom.mt19937 = function(seed)\n{\n    const state = new Uint32Array(STATE_WORDS);\n\n    state[0] = Number(seed) >>> 0;\n    for (let index = 1; index < STATE_WORDS; index++)\n    {\n        const previous = state[index - 1] ^ state[index - 1] >>> 30;\n        state[index] = Math.imul(1812433253, previous) + index >>> 0;\n    }\n\n    let cursor = STATE_WORDS;\n\n    return function()\n    {\n        if (cursor >= STATE_WORDS)\n        {\n            for (let index = 0; index < STATE_WORDS; index++)\n            {\n                const bits = state[index] & 0x80000000 | state[(index + 1) % STATE_WORDS] & 0x7fffffff;\n                state[index] = state[(index + TWIST_OFFSET) % STATE_WORDS] ^ bits >>> 1 ^ (bits & 1 ? 0x9908b0df : 0);\n            }\n            cursor = 0;\n        }\n\n        let value = state[cursor++];\n\n        value ^= value >>> 11;\n        value ^= value << 7 & 0x9d2c5680;\n        value ^= value << 15 & 0xefc60000;\n        value ^= value >>> 18;\n        return value >>> 0;\n    };\n};\n"],"names":["random","STATE_WORDS","TWIST_OFFSET","mt19937","seed","state","Uint32Array","Number","index","previous","Math","imul","cursor","bits","value"],"mappings":"AAAA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEO,MAAMA,MAAM,GAAG;AAEtB,MAAMC,WAAW,GAAG,GAAG;AACvB,MAAMC,YAAY,GAAG,GAAG;;AAExB;AACA;AACA;AACA;AACA;AACA;AACAF,MAAM,CAACG,OAAO,GAAG,UAASC,IAAI,EAC9B;AACI,EAAA,MAAMC,KAAK,GAAG,IAAIC,WAAW,CAACL,WAAW,CAAC;EAE1CI,KAAK,CAAC,CAAC,CAAC,GAAGE,MAAM,CAACH,IAAI,CAAC,KAAK,CAAC;EAC7B,KAAK,IAAII,KAAK,GAAG,CAAC,EAAEA,KAAK,GAAGP,WAAW,EAAEO,KAAK,EAAE,EAChD;AACI,IAAA,MAAMC,QAAQ,GAAGJ,KAAK,CAACG,KAAK,GAAG,CAAC,CAAC,GAAGH,KAAK,CAACG,KAAK,GAAG,CAAC,CAAC,KAAK,EAAE;AAC3DH,IAAAA,KAAK,CAACG,KAAK,CAAC,GAAGE,IAAI,CAACC,IAAI,CAAC,UAAU,EAAEF,QAAQ,CAAC,GAAGD,KAAK,KAAK,CAAC;AAChE,EAAA;EAEA,IAAII,MAAM,GAAGX,WAAW;AAExB,EAAA,OAAO,YACP;IACI,IAAIW,MAAM,IAAIX,WAAW,EACzB;MACI,KAAK,IAAIO,KAAK,GAAG,CAAC,EAAEA,KAAK,GAAGP,WAAW,EAAEO,KAAK,EAAE,EAChD;AACI,QAAA,MAAMK,IAAI,GAAGR,KAAK,CAACG,KAAK,CAAC,GAAG,UAAU,GAAGH,KAAK,CAAC,CAACG,KAAK,GAAG,CAAC,IAAIP,WAAW,CAAC,GAAG,UAAU;QACtFI,KAAK,CAACG,KAAK,CAAC,GAAGH,KAAK,CAAC,CAACG,KAAK,GAAGN,YAAY,IAAID,WAAW,CAAC,GAAGY,IAAI,KAAK,CAAC,IAAIA,IAAI,GAAG,CAAC,GAAG,UAAU,GAAG,CAAC,CAAC;AACzG,MAAA;AACAD,MAAAA,MAAM,GAAG,CAAC;AACd,IAAA;AAEA,IAAA,IAAIE,KAAK,GAAGT,KAAK,CAACO,MAAM,EAAE,CAAC;IAE3BE,KAAK,IAAIA,KAAK,KAAK,EAAE;AACrBA,IAAAA,KAAK,IAAIA,KAAK,IAAI,CAAC,GAAG,UAAU;AAChCA,IAAAA,KAAK,IAAIA,KAAK,IAAI,EAAE,GAAG,UAAU;IACjCA,KAAK,IAAIA,KAAK,KAAK,EAAE;IACrB,OAAOA,KAAK,KAAK,CAAC;EACtB,CAAC;AACL,CAAC;;;;"}

package/dist/global/math/tri3.js

@@ -208,6 +208,13 @@ tri3.intersectsOrientedBox = function () {
   // Nine edge-cross axes, with Carbon's own vertex pairs. Built once: the
   // vectors are stable across calls, and a decal tests every triangle of a
   // hull against this.
+  //
+  // Each row is read positionally in the loop below, which is what the old
+  // destructuring form used to name:
+  //
+  //     [ edge, ax, bx, ay, by, az, bz ]
+  //
+  // one vertex pair per box axis: x at [1],[2], y at [3],[4], z at [5],[6].
   const edgeAxes = [[e[0], v[0], v[2], v[0], v[2], v[1], v[2]], [e[1], v[0], v[2], v[0], v[2], v[0], v[1]], [e[2], v[0], v[1], v[0], v[1], v[1], v[2]]];
 
   // A separating plane at the cross product of a triangle edge and a unit-box
@@ -252,13 +259,20 @@ tri3.intersectsOrientedBox = function () {
     }
     if (vec3.dot(vmin, normal) > 0) return false;
     if (vec3.dot(vmax, normal) < 0) return false;
-    for (const [edge, ax, bx, ay, by, az, bz] of edgeAxes) {
+
+    // An indexed loop, NOT `for...of` with destructuring. A decal runs this
+    // over every triangle of a hull, so this is the hottest loop in the file,
+    // and that form costs an array iterator plus a seven-way destructure on
+    // every call. The rows are read positionally below for the same reason.
+    for (let axis = 0; axis < edgeAxes.length; axis++) {
+      const row = edgeAxes[axis];
+      const edge = row[0];
       const fex = Math.abs(edge[0]);
       const fey = Math.abs(edge[1]);
       const fez = Math.abs(edge[2]);
-      if (!axisTest(edge[2], -edge[1], fez, fey, ax, bx, 1, 2)) return false;
-      if (!axisTest(-edge[2], edge[0], fez, fex, ay, by, 0, 2)) return false;
-      if (!axisTest(edge[1], -edge[0], fey, fex, az, bz, 0, 1)) return false;
+      if (!axisTest(edge[2], -edge[1], fez, fey, row[1], row[2], 1, 2)) return false;
+      if (!axisTest(-edge[2], edge[0], fez, fex, row[3], row[4], 0, 2)) return false;
+      if (!axisTest(edge[1], -edge[0], fey, fex, row[5], row[6], 0, 1)) return false;
     }
     return true;
   };

package/dist/global/math/tri3.js.map

@@ -1 +1 @@
-{"version":3,"file":"tri3.js","sources":["../../../../src/global/math/tri3.js"],"sourcesContent":["import { vec3 } from \"./vec3.js\";\nimport { mat3 } from \"./mat3.js\";\nimport { pln } from \"./pln.js\";\nimport { lne3 } from \"./lne3.js\";\nimport { pool } from \"./pool.js\";\n\n/**\n * 3d Triangle\n *\n * @typedef {Float32Array} tri3\n */\n\nexport const tri3 = {};\n\n/**\n * Allocates a pooled tri3\n * @returns {Float32Array|tri3}\n */\ntri3.alloc = function()\n{\n    return pool.allocF32(9);\n};\n\n/**\n * Unallocates a pooled tri3\n * @param {tri3|Float32Array} a\n */\ntri3.unalloc = function(a)\n{\n    pool.freeType(a);\n};\n\n/**\n * Gets a subarray of a tri3's first vertex\n *\n * @param {tri3} a\n * @returns {vec3}\n */\ntri3.$v1 = lne3.$start;\n\n/**\n * Gets a subarray of a tri3's second vertex\n *\n * @param {tri3} a\n * @returns {vec3}\n */\ntri3.$v2 = lne3.$end;\n\n/**\n * Gets a subarray of a tri3's third vertex\n *\n * @param {tri3} a\n * @returns {vec3}\n */\ntri3.$v3 = function(a)\n{\n    return a.subarray(6, 9);\n};\n\n/**\n * Gets the area of a triangle\n *\n * @param {tri3} a\n * @returns {number}\n */\ntri3.area = function(a)\n{\n    let ax = a[6] - a[3],\n        ay = a[7] - a[4],\n        az = a[8] - a[5],\n        bx = a[0] - a[3],\n        by = a[1] - a[4],\n        bz = a[2] - a[5];\n    // Cross product\n    let x = ay * bz - az * by,\n        y = az * bx - ax * bz,\n        z = ax * by - ay * bx;\n    // Return half length\n    return Math.sqrt(x * x + y * y + z * z) * 0.5;\n};\n\n/**\n * Creates a tri3\n *\n * @returns {tri3}\n */\ntri3.create = function()\n{\n    let out = new Float32Array(9);\n    out[0] = 0;\n    out[1] = 0;\n    out[2] = 0;\n    out[3] = 0;\n    out[4] = 0;\n    out[5] = 0;\n    out[6] = 0;\n    out[7] = 0;\n    out[8] = 0;\n    return out;\n};\n\n/**\n * Clones a tri3\n *\n * @param {tri3} a\n * @returns {tri3}\n */\ntri3.clone = mat3.clone;\n\n/**\n * Checks if a tri3 contains a point\n *\n * @param {tri3} a\n * @param {vec3} point\n * @returns {boolean}\n */\ntri3.contains = (function()\n{\n    let vec3_0;\n    return function(a, point)\n    {\n        if (!vec3_0) vec3_0 = vec3.create();\n        tri3.getBaryCentricCoordinates(vec3_0, a, point);\n        return (vec3_0[0] >= 0) && (vec3_0[1] >= 0) && ((vec3_0[0] + vec3_0[1]) <= 1);\n    };\n})();\n\n/**\n * Copies a tri3\n *\n * @param {tri3} a\n * @param {tri3} b\n * @returns {tri3} a\n */\ntri3.copy = mat3.copy;\n\n/**\n * Sets a tri3 from vertices\n *\n * @param {tri3} out\n * @param {vec3} v1\n * @param {vec3} v2\n * @param {vec3} v3\n * @returns {tri3} out\n */\ntri3.fromVertices = function(out, v1, v2, v3)\n{\n    out[0] = v1[0];\n    out[1] = v1[1];\n    out[2] = v1[2];\n    out[3] = v2[0];\n    out[4] = v2[1];\n    out[5] = v2[2];\n    out[6] = v3[0];\n    out[7] = v3[1];\n    out[8] = v3[2];\n    return out;\n};\n\n/**\n * Sets a tri3 from an array at an option offset\n *\n * @param {tri3} out\n * @param {Array} arr\n * @param {number} [offset=0]\n * @returns {tri3} out\n */\n/**\n * Whether a triangle overlaps an axis-aligned box.\n *\n * A cheap reject only: it tests the box's three slabs and answers true whenever\n * no slab separates the triangle, so a triangle that straddles a corner without\n * touching the box still passes. Carbon uses it as the broad phase in front of\n * the oriented-box test (BoundingBox.cpp:569-588) and so should any caller.\n *\n * @param {tri3} a\n * @param {vec3} min\n * @param {vec3} max\n * @returns {boolean} false only when a slab separates the triangle\n */\ntri3.intersectsBounds = function(a, min, max)\n{\n    for (let axis = 0; axis < 3; axis++)\n    {\n        const lo = min[axis];\n        const hi = max[axis];\n\n        if (a[axis] < lo && a[axis + 3] < lo && a[axis + 6] < lo) return false;\n        if (a[axis] > hi && a[axis + 3] > hi && a[axis + 6] > hi) return false;\n    }\n\n    return true;\n};\n\n/**\n * Whether a triangle overlaps an oriented box, by separating-axis test.\n *\n * The box is given as the INVERSE of the transform that maps the unit box\n * (-1,-1,-1)..(1,1,1) onto it, so the triangle is moved into unit-box space and\n * tested there - which is why no box axes appear below.\n *\n * Ported from Carbon (BoundingBox.cpp:626-732) including the vertex pairs its\n * edge tests use. Those pairs are NOT the symmetric set a textbook\n * separating-axis test would pick, and two of them look like slips; they are\n * reproduced exactly because this decides which hull triangles a decal covers,\n * and a \"corrected\" test would silently disagree with the client about where a\n * decal reaches.\n *\n * @param {tri3} a\n * @param {mat4} invOrientedBox inverse of the box transform\n * @returns {boolean} true when no separating axis was found\n */\ntri3.intersectsOrientedBox = (function()\n{\n    const v = [ vec3.create(), vec3.create(), vec3.create() ];\n    const e = [ vec3.create(), vec3.create(), vec3.create() ];\n    const normal = vec3.create();\n    const vmin = vec3.create();\n    const vmax = vec3.create();\n\n    // Nine edge-cross axes, with Carbon's own vertex pairs. Built once: the\n    // vectors are stable across calls, and a decal tests every triangle of a\n    // hull against this.\n    const edgeAxes = [\n        [ e[0], v[0], v[2], v[0], v[2], v[1], v[2] ],\n        [ e[1], v[0], v[2], v[0], v[2], v[0], v[1] ],\n        [ e[2], v[0], v[1], v[0], v[1], v[1], v[2] ]\n    ];\n\n    // A separating plane at the cross product of a triangle edge and a unit-box\n    // axis. The box half-extent is 1 on every axis, so the radius is just\n    // |a| + |b| (Carbon's AxisTest, BoundingBox.cpp:601-611).\n    function axisTest(ca, cb, fa, fb, p, q, axis0, axis1)\n    {\n        let p0 = ca * p[axis0] + cb * p[axis1];\n        let p2 = ca * q[axis0] + cb * q[axis1];\n\n        if (p2 < p0)\n        {\n            const swap = p0;\n            p0 = p2;\n            p2 = swap;\n        }\n\n        const rad = fa + fb;\n\n        return !(p0 > rad || p2 < -rad);\n    }\n\n    return function(a, invOrientedBox)\n    {\n        for (let i = 0; i < 3; i++)\n        {\n            vec3.set(v[i], a[i * 3], a[i * 3 + 1], a[i * 3 + 2]);\n            vec3.transformMat4(v[i], v[i], invOrientedBox);\n        }\n\n        // The unit box's own six faces.\n        for (let axis = 0; axis < 3; axis++)\n        {\n            if (v[0][axis] < -1 && v[1][axis] < -1 && v[2][axis] < -1) return false;\n            if (v[0][axis] > 1 && v[1][axis] > 1 && v[2][axis] > 1) return false;\n        }\n\n        vec3.subtract(e[0], v[1], v[0]);\n        vec3.subtract(e[1], v[2], v[1]);\n        vec3.subtract(e[2], v[0], v[2]);\n\n        // The triangle's own plane.\n        vec3.cross(normal, e[0], e[1]);\n\n        for (let i = 0; i < 3; i++)\n        {\n            if (normal[i] > 0)\n            {\n                vmin[i] = -1 - v[0][i];\n                vmax[i] = 1 - v[0][i];\n            }\n            else\n            {\n                vmin[i] = 1 - v[0][i];\n                vmax[i] = -1 - v[0][i];\n            }\n        }\n\n        if (vec3.dot(vmin, normal) > 0) return false;\n        if (vec3.dot(vmax, normal) < 0) return false;\n\n        for (const [ edge, ax, bx, ay, by, az, bz ] of edgeAxes)\n        {\n            const fex = Math.abs(edge[0]);\n            const fey = Math.abs(edge[1]);\n            const fez = Math.abs(edge[2]);\n\n            if (!axisTest(edge[2], -edge[1], fez, fey, ax, bx, 1, 2)) return false;\n            if (!axisTest(-edge[2], edge[0], fez, fex, ay, by, 0, 2)) return false;\n            if (!axisTest(edge[1], -edge[0], fey, fex, az, bz, 0, 1)) return false;\n        }\n\n        return true;\n    };\n})();\n\ntri3.fromArray = mat3.fromArray;\n\n/**\n * Gets bary centric coordinates\n *\n * @author three.js (converted)\n * @param {vec3} out\n * @param {tri3} a\n * @param {vec3} point\n * @returns {tri3} out\n */\ntri3.getBaryCentricCoordinates = function(out, a, point)\n{\n    let ax = a[6] - a[0],\n        ay = a[7] - a[1],\n        az = a[8] - a[2],\n\n        bx = a[3] - a[0],\n        by = a[4] - a[1],\n        bz = a[5] - a[2],\n\n        cx = point[0] - a[0],\n        cy = point[1] - a[1],\n        cz = point[2] - a[2];\n\n    let dot00 = ax * ax + ay * ay + az * az,\n        dot01 = ax * bx + ay * by + az * bz,\n        dot02 = ax * cx + ay * cy + az * cz,\n        dot11 = bx * bx + by * by + bz * bz,\n        dot12 = bx * cx + by * cy + bz * cz;\n\n    let denom = (dot00 * dot11 - dot01 * dot01);\n\n    if (denom === 0)\n    {\n        out[0] = -2;\n        out[1] = -1;\n        out[2] = -1;\n        throw new Error(\"Denominator error\");\n    }\n    else\n    {\n        let invDenom = 1 / denom;\n        let u = (dot11 * dot02 - dot01 * dot12) * invDenom;\n        let v = (dot00 * dot12 - dot01 * dot02) * invDenom;\n        out[0] = 1 - u - v;\n        out[1] = v;\n        out[2] = u;\n    }\n    return out;\n};\n\n/**\n *\n * @author three.js (converted)\n * @param {lne3} out\n * @param {tri3} a\n * @param {vec3} point\n * @returns {*}\n */\ntri3.getClosestEdgeToPoint = (function()\n{\n    let v0, v1, edgeList;\n\n    return function getClosestEdgeToPoint(out, a, point, debug)\n    {\n        if (!v0)\n        {\n            v0 = vec3.create();\n            v1 = vec3.create();\n            edgeList = [ lne3.create(), lne3.create(), lne3.create() ];\n        }\n\n        // Get the closest point on the triangle to the supplied point\n        let closestPointOnTriangle = tri3.getClosestPointToPoint(v0, a, point);\n\n        // Convert the triangle's vertices to edges\n        lne3.set(edgeList[0], a[0], a[1], a[2], a[3], a[4], a[5]); // vert a - vert b\n        lne3.set(edgeList[1], a[3], a[4], a[5], a[6], a[7], a[8]); // vert b - vert c\n        lne3.set(edgeList[2], a[6], a[7], a[8], a[0], a[1], a[2]); // vert c - vert a\n\n        let minDistance = Infinity,\n            edgeIndex;\n\n        for (let i = 0; i < edgeList.length; i++)\n        {\n            // Get the closest point on the triangles edge to the closest point on the triangle to the supplied point\n            let closestPointOnLine = lne3.getClosestPointToPoint(v1, edgeList[i], closestPointOnTriangle, true);\n            let distance = vec3.squaredDistance(closestPointOnLine, closestPointOnTriangle);\n            if (distance < minDistance)\n            {\n                minDistance = distance;\n                out[0] = edgeList[i][0];\n                out[1] = edgeList[i][1];\n                out[2] = edgeList[i][2];\n                out[3] = edgeList[i][3];\n                out[4] = edgeList[i][4];\n                out[5] = edgeList[i][5];\n                edgeIndex = i;\n            }\n        }\n\n        // Temporary\n        if (debug)\n        {\n            switch(edgeIndex)\n            {\n                case 0:\n                    debug.edgeStart = 0;\n                    debug.edgeEnd = 1;\n                    break;\n\n                case 1:\n                    debug.edgeStart = 1;\n                    debug.edgeEnd = 2;\n                    break;\n\n                default:\n                    debug.edgeStart = 2;\n                    debug.edgeEnd = 0;\n                    break;\n            }\n        }\n\n        return out;\n    };\n})();\n\n/**\n * Gets the closest point on a triangle to another point\n *\n * @author three.js (converted)\n * @param {vec3} out      - receiving vec3\n * @param {vec3} a        - tri3 to operate on\n * @param {vec3} point    - the point\n * @returns {vec3} vecOut - receiving vec3\n */\ntri3.getClosestPointToPoint = (function()\n{\n    let plane, edgeList, projectedPoint, closestPoint, vec3_0, vec3_1, vec3_2;\n\n    return function getClosestPointToPoint(out, a, point)\n    {\n        if (!plane)\n        {\n            plane = pln.create();\n            edgeList = [ lne3.create(), lne3.create(), lne3.create() ];\n            projectedPoint = vec3.create();\n            closestPoint = vec3.create();\n            vec3_0 = vec3.create();\n            vec3_1 = vec3.create();\n            vec3_2 = vec3.create();\n        }\n\n        // Replace with subarray tri3.v1 .v2 .v3 ?\n        tri3.getV1(vec3_0, a);\n        tri3.getV2(vec3_1, a);\n        tri3.getV3(vec3_2, a);\n\n        // project the point onto the plane of the triangle\n        pln.fromCoplanarPoints(plane, vec3_0, vec3_1, vec3_2);\n        pln.getProjectedPoint(projectedPoint, plane, point);\n\n        // check if the projection lies within the triangle\n        if (tri3.contains(a, projectedPoint) === true)\n        {\n            out[0] = projectedPoint[0];\n            out[1] = projectedPoint[1];\n            out[2] = projectedPoint[2];\n        }\n        // if not, the point falls outside the triangle.\n        // the result is the closest point to the triangle's edges or vertices\n        else\n        {\n            lne3.set(edgeList[0], a[0], a[1], a[2], a[3], a[4], a[5]);\n            lne3.set(edgeList[1], a[3], a[4], a[5], a[6], a[7], a[8]);\n            lne3.set(edgeList[2], a[6], a[7], a[8], a[0], a[1], a[2]);\n\n            let minDistance = Infinity;\n            for (let i = 0; i < edgeList.length; i++)\n            {\n                lne3.getClosestPointToPoint(closestPoint, edgeList[i], projectedPoint, true);\n                let distance = vec3.squaredDistance(projectedPoint, closestPoint);\n                if (distance < minDistance)\n                {\n                    minDistance = distance;\n                    out[0] = closestPoint[0];\n                    out[1] = closestPoint[1];\n                    out[2] = closestPoint[2];\n                }\n            }\n        }\n        return out;\n    };\n})();\n\n/**\n * Gets the closest vertex to a given point\n *\n * @param {vec3} out\n * @param {tri3} a\n * @param {vec3} point\n * @returns {vec3} out\n */\ntri3.getClosestVertexToPoint = (function()\n{\n    let vec3_0, vec3_1, vec3_2;\n\n    return function(out, a, point, debug)\n    {\n        if (!vec3_0)\n        {\n            vec3_0 = vec3.create();\n            vec3_1 = vec3.create();\n            vec3_2 = vec3.create();\n        }\n\n        // Get the closest point on the triangle to the supplied point\n        tri3.getClosestPointToPoint(out, a, point);\n\n        let minDistance = Infinity,\n            distance,\n            x, y, z,\n            vertices = [\n                tri3.getV1(vec3_0, a),\n                tri3.getV2(vec3_1, a),\n                tri3.getV3(vec3_2, a)\n            ];\n\n        let foundIndex;\n        // Find the closest triangle vertex\n        for (let i = 0; i < vertices.length; i++)\n        {\n            distance = vec3.squaredDistance(vertices[i], out);\n            if (distance < minDistance)\n            {\n                minDistance = distance;\n                x = vertices[i][0];\n                y = vertices[i][1];\n                z = vertices[i][2];\n                foundIndex = i;\n            }\n        }\n\n        if (debug) debug.closest = foundIndex;\n\n        out[0] = x;\n        out[1] = y;\n        out[2] = z;\n        return out;\n    };\n})();\n\n/**\n * Sets a vec3 as the midpoint of a triangle\n *\n * @param {vec3} out    - receiving vec3\n * @param {tri3} a      - tri3 to get the midpoint of         -\n * @returns {vec3} out  - receiving vec3\n */\ntri3.getMidpoint = function(out, a)\n{\n    let s = 1 / 3;\n    out[0] = (a[0] + a[3] + a[6]) * s;\n    out[1] = (a[1] + a[4] + a[7]) * s;\n    out[2] = (a[2] + a[5] + a[8]) * s;\n    return out;\n};\n\nlet tri3_0 = null;\n\n/**\n * Gets normal vertices\n *\n * @param {vec3} out\n * @param {vec3} v1\n * @param {vec3} v2\n * @param {vec3} v3\n * @return {vec3} out\n */\ntri3.getNormalFromVertices =  function(out, v1, v2, v3)\n{\n    if (!tri3_0) tri3_0 = tri3.create();\n    tri3.fromVertices(tri3_0, v1, v2, v3);\n    return tri3.getNormal(out, tri3_0);\n};\n\n/**\n * Gets a triangle's normal\n *\n * @param {vec3} out\n * @param {tri3} a\n * @returns {vec3} out\n */\ntri3.getNormal = function(out, a)\n{\n    let ax = a[6] - a[3],\n        ay = a[7] - a[4],\n        az = a[8] - a[5],\n        bx = a[0] - a[3],\n        by = a[1] - a[4],\n        bz = a[2] - a[5];\n\n    // Get cross product\n    let x = ay * bz - az * by,\n        y = az * bx - ax * bz,\n        z = ax * by - ay * bx;\n\n    // Normalize\n    let len = x * x + y * y + z * z;\n    if (len > 0)\n    {\n        len = 1 / Math.sqrt(len);\n        out[0] = x * len;\n        out[1] = y * len;\n        out[2] = z * len;\n    }\n    else\n    {\n        out[0] = 0;\n        out[1] = 0;\n        out[2] = 0;\n        throw new Error(\"Normalization error\");\n    }\n    return out;\n};\n\n/**\n * Sets a vec3 with the tri3's first vert\n *\n * @param {vec3} out     - receiving vec3\n * @param {tri3} a       - source tri3\n * @returns {vec3} [out] - receiving vec3\n */\ntri3.getV1 = lne3.getStart;\n\n/**\n * Sets a vec3 with the tri3's second vert\n *\n * @param {vec3} out     - receiving vec3\n * @param {tri3} a       - source tri3\n * @returns {vec3} [out] - receiving vec3\n */\ntri3.getV2 = lne3.getEnd;\n\n/**\n * Sets a vec3 with the tri3's third vert\n *\n * @param {vec3} out     - receiving vec3\n * @param {tri3} v       - source tri3\n * @returns {vec3} [out] - receiving vec3\n */\ntri3.getV3 = function(out, v)\n{\n    out[0] = v[6];\n    out[1] = v[7];\n    out[2] = v[8];\n    return out;\n};\n\n/**\n * Sets the first position of a triangle\n * @param {tri3} out\n * @param {vec3} v\n * @returns {tri3} out\n */\ntri3.setV1 = lne3.setStart;\n\n/**\n * Sets the second position of a triangle\n * @param {tri3} out\n * @param {vec3} v\n * @returns {tri3} out\n */\ntri3.setV2 = lne3.setEnd;\n\n/**\n * Sets the second position of a triangle\n * @param {tri3} out\n * @param {vec3} v\n * @returns {tri3} out\n */\ntri3.setV3 = function(out, v)\n{\n    out[6] = v[0];\n    out[7] = v[1];\n    out[8] = v[2];\n    return out;\n};\n\n/**\n * Sets an array at an optional offset\n *\n * @param {mat3} a\n * @param {Array} arr\n * @param {number} [index=0]\n * @returns {mat3} a\n */\ntri3.toArray = mat3.toArray;\n\n/**\n * Extracts the vertices of a tri3\n *\n * @param {tri3} a\n * @param {vec3} v1\n * @param {vec3} v2\n * @param {vec3} v3\n */\ntri3.toVertices = function(a, v1, v2, v3)\n{\n    v1[0] = a[0];\n    v1[1] = a[1];\n    v1[2] = a[2];\n    v2[0] = a[3];\n    v2[1] = a[4];\n    v2[2] = a[5];\n    v3[0] = a[6];\n    v3[1] = a[7];\n    v3[2] = a[8];\n    return a;\n};\n\nlet vec3_0, vec3_1, vec3_2;\n\n/**\n * Transforms a tri3 by a mat4\n * TODO: Optimize\n * @param {tri3} out\n * @param {tri3} a\n * @param {mat4} m\n * @return {tri3}\n */\ntri3.transformMat4 = function(out, a, m)\n{\n    if (!vec3_0)\n    {\n        vec3_0 = vec3.create();\n        vec3_1 = vec3.create();\n        vec3_2 = vec3.create();\n    }\n\n    tri3.getV1(vec3_0, a);\n    tri3.getV2(vec3_1, a);\n    tri3.getV3(vec3_2, a);\n\n    vec3.transformMat4(vec3_0, vec3_0, m);\n    vec3.transformMat4(vec3_1, vec3_1, m);\n    vec3.transformMat4(vec3_2, vec3_2, m);\n\n    return tri3.fromVertices(out, vec3_0, vec3_1, vec3_2);\n};\n\nexport const {\n    alloc,\n    unalloc,\n    $v1,\n    $v2,\n    $v3,\n    area,\n    create,\n    clone,\n    contains,\n    copy,\n    fromVertices,\n    fromArray,\n    getBaryCentricCoordinates,\n    getClosestEdgeToPoint,\n    getClosestPointToPoint,\n    getClosestVertexToPoint,\n    getMidpoint,\n    getNormalFromVertices,\n    getNormal,\n    getV1,\n    intersectsBounds,\n    intersectsOrientedBox,\n    getV2,\n    getV3,\n    setV1,\n    setV2,\n    setV3,\n    toArray,\n    toVertices,\n    transformMat4\n} = tri3;\n\n"],"names":["tri3","alloc","pool","allocF32","unalloc","a","freeType","$v1","lne3","$start","$v2","$end","$v3","subarray","area","ax","ay","az","bx","by","bz","x","y","z","Math","sqrt","create","out","Float32Array","clone","mat3","contains","vec3_0","point","vec3","getBaryCentricCoordinates","copy","fromVertices","v1","v2","v3","intersectsBounds","min","max","axis","lo","hi","intersectsOrientedBox","v","e","normal","vmin","vmax","edgeAxes","axisTest","ca","cb","fa","fb","p","q","axis0","axis1","p0","p2","swap","rad","invOrientedBox","i","set","transformMat4","subtract","cross","dot","edge","fex","abs","fey","fez","fromArray","cx","cy","cz","dot00","dot01","dot02","dot11","dot12","denom","Error","invDenom","u","getClosestEdgeToPoint","v0","edgeList","debug","closestPointOnTriangle","getClosestPointToPoint","minDistance","Infinity","edgeIndex","length","closestPointOnLine","distance","squaredDistance","edgeStart","edgeEnd","plane","projectedPoint","closestPoint","vec3_1","vec3_2","pln","getV1","getV2","getV3","fromCoplanarPoints","getProjectedPoint","getClosestVertexToPoint","vertices","foundIndex","closest","getMidpoint","s","tri3_0","getNormalFromVertices","getNormal","len","getStart","getEnd","setV1","setStart","setV2","setEnd","setV3","toArray","toVertices","m"],"mappings":";;;;;;AAMA;AACA;AACA;AACA;AACA;;AAEO,MAAMA,IAAI,GAAG;;AAEpB;AACA;AACA;AACA;AACAA,IAAI,CAACC,KAAK,GAAG,YACb;AACI,EAAA,OAAOC,IAAI,CAACC,QAAQ,CAAC,CAAC,CAAC;AAC3B,CAAC;;AAED;AACA;AACA;AACA;AACAH,IAAI,CAACI,OAAO,GAAG,UAASC,CAAC,EACzB;AACIH,EAAAA,IAAI,CAACI,QAAQ,CAACD,CAAC,CAAC;AACpB,CAAC;;AAED;AACA;AACA;AACA;AACA;AACA;AACAL,IAAI,CAACO,GAAG,GAAGC,IAAI,CAACC,MAAM;;AAEtB;AACA;AACA;AACA;AACA;AACA;AACAT,IAAI,CAACU,GAAG,GAAGF,IAAI,CAACG,IAAI;;AAEpB;AACA;AACA;AACA;AACA;AACA;AACAX,IAAI,CAACY,GAAG,GAAG,UAASP,CAAC,EACrB;AACI,EAAA,OAAOA,CAAC,CAACQ,QAAQ,CAAC,CAAC,EAAE,CAAC,CAAC;AAC3B,CAAC;;AAED;AACA;AACA;AACA;AACA;AACA;AACAb,IAAI,CAACc,IAAI,GAAG,UAAST,CAAC,EACtB;EACI,IAAIU,EAAE,GAAGV,CAAC,CAAC,CAAC,CAAC,GAAGA,CAAC,CAAC,CAAC,CAAC;IAChBW,EAAE,GAAGX,CAAC,CAAC,CAAC,CAAC,GAAGA,CAAC,CAAC,CAAC,CAAC;IAChBY,EAAE,GAAGZ,CAAC,CAAC,CAAC,CAAC,GAAGA,CAAC,CAAC,CAAC,CAAC;IAChBa,EAAE,GAAGb,CAAC,CAAC,CAAC,CAAC,GAAGA,CAAC,CAAC,CAAC,CAAC;IAChBc,EAAE,GAAGd,CAAC,CAAC,CAAC,CAAC,GAAGA,CAAC,CAAC,CAAC,CAAC;IAChBe,EAAE,GAAGf,CAAC,CAAC,CAAC,CAAC,GAAGA,CAAC,CAAC,CAAC,CAAC;AACpB;EACA,IAAIgB,CAAC,GAAGL,EAAE,GAAGI,EAAE,GAAGH,EAAE,GAAGE,EAAE;AACrBG,IAAAA,CAAC,GAAGL,EAAE,GAAGC,EAAE,GAAGH,EAAE,GAAGK,EAAE;AACrBG,IAAAA,CAAC,GAAGR,EAAE,GAAGI,EAAE,GAAGH,EAAE,GAAGE,EAAE;AACzB;AACA,EAAA,OAAOM,IAAI,CAACC,IAAI,CAACJ,CAAC,GAAGA,CAAC,GAAGC,CAAC,GAAGA,CAAC,GAAGC,CAAC,GAAGA,CAAC,CAAC,GAAG,GAAG;AACjD,CAAC;;AAED;AACA;AACA;AACA;AACA;AACAvB,IAAI,CAAC0B,MAAM,GAAG,YACd;AACI,EAAA,IAAIC,GAAG,GAAG,IAAIC,YAAY,CAAC,CAAC,CAAC;AAC7BD,EAAAA,GAAG,CAAC,CAAC,CAAC,GAAG,CAAC;AACVA,EAAAA,GAAG,CAAC,CAAC,CAAC,GAAG,CAAC;AACVA,EAAAA,GAAG,CAAC,CAAC,CAAC,GAAG,CAAC;AACVA,EAAAA,GAAG,CAAC,CAAC,CAAC,GAAG,CAAC;AACVA,EAAAA,GAAG,CAAC,CAAC,CAAC,GAAG,CAAC;AACVA,EAAAA,GAAG,CAAC,CAAC,CAAC,GAAG,CAAC;AACVA,EAAAA,GAAG,CAAC,CAAC,CAAC,GAAG,CAAC;AACVA,EAAAA,GAAG,CAAC,CAAC,CAAC,GAAG,CAAC;AACVA,EAAAA,GAAG,CAAC,CAAC,CAAC,GAAG,CAAC;AACV,EAAA,OAAOA,GAAG;AACd,CAAC;;AAED;AACA;AACA;AACA;AACA;AACA;AACA3B,IAAI,CAAC6B,KAAK,GAAGC,IAAI,CAACD,KAAK;;AAEvB;AACA;AACA;AACA;AACA;AACA;AACA;AACA7B,IAAI,CAAC+B,QAAQ,GAAI,YACjB;AACI,EAAA,IAAIC,MAAM;AACV,EAAA,OAAO,UAAS3B,CAAC,EAAE4B,KAAK,EACxB;IACI,IAAI,CAACD,MAAM,EAAEA,MAAM,GAAGE,IAAI,CAACR,MAAM,EAAE;IACnC1B,IAAI,CAACmC,yBAAyB,CAACH,MAAM,EAAE3B,CAAC,EAAE4B,KAAK,CAAC;IAChD,OAAQD,MAAM,CAAC,CAAC,CAAC,IAAI,CAAC,IAAMA,MAAM,CAAC,CAAC,CAAC,IAAI,CAAE,IAAMA,MAAM,CAAC,CAAC,CAAC,GAAGA,MAAM,CAAC,CAAC,CAAC,IAAK,CAAE;EACjF,CAAC;AACL,CAAC,EAAG;;AAEJ;AACA;AACA;AACA;AACA;AACA;AACA;AACAhC,IAAI,CAACoC,IAAI,GAAGN,IAAI,CAACM,IAAI;;AAErB;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACApC,IAAI,CAACqC,YAAY,GAAG,UAASV,GAAG,EAAEW,EAAE,EAAEC,EAAE,EAAEC,EAAE,EAC5C;AACIb,EAAAA,GAAG,CAAC,CAAC,CAAC,GAAGW,EAAE,CAAC,CAAC,CAAC;AACdX,EAAAA,GAAG,CAAC,CAAC,CAAC,GAAGW,EAAE,CAAC,CAAC,CAAC;AACdX,EAAAA,GAAG,CAAC,CAAC,CAAC,GAAGW,EAAE,CAAC,CAAC,CAAC;AACdX,EAAAA,GAAG,CAAC,CAAC,CAAC,GAAGY,EAAE,CAAC,CAAC,CAAC;AACdZ,EAAAA,GAAG,CAAC,CAAC,CAAC,GAAGY,EAAE,CAAC,CAAC,CAAC;AACdZ,EAAAA,GAAG,CAAC,CAAC,CAAC,GAAGY,EAAE,CAAC,CAAC,CAAC;AACdZ,EAAAA,GAAG,CAAC,CAAC,CAAC,GAAGa,EAAE,CAAC,CAAC,CAAC;AACdb,EAAAA,GAAG,CAAC,CAAC,CAAC,GAAGa,EAAE,CAAC,CAAC,CAAC;AACdb,EAAAA,GAAG,CAAC,CAAC,CAAC,GAAGa,EAAE,CAAC,CAAC,CAAC;AACd,EAAA,OAAOb,GAAG;AACd,CAAC;;AAED;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA3B,IAAI,CAACyC,gBAAgB,GAAG,UAASpC,CAAC,EAAEqC,GAAG,EAAEC,GAAG,EAC5C;EACI,KAAK,IAAIC,IAAI,GAAG,CAAC,EAAEA,IAAI,GAAG,CAAC,EAAEA,IAAI,EAAE,EACnC;AACI,IAAA,MAAMC,EAAE,GAAGH,GAAG,CAACE,IAAI,CAAC;AACpB,IAAA,MAAME,EAAE,GAAGH,GAAG,CAACC,IAAI,CAAC;IAEpB,IAAIvC,CAAC,CAACuC,IAAI,CAAC,GAAGC,EAAE,IAAIxC,CAAC,CAACuC,IAAI,GAAG,CAAC,CAAC,GAAGC,EAAE,IAAIxC,CAAC,CAACuC,IAAI,GAAG,CAAC,CAAC,GAAGC,EAAE,EAAE,OAAO,KAAK;IACtE,IAAIxC,CAAC,CAACuC,IAAI,CAAC,GAAGE,EAAE,IAAIzC,CAAC,CAACuC,IAAI,GAAG,CAAC,CAAC,GAAGE,EAAE,IAAIzC,CAAC,CAACuC,IAAI,GAAG,CAAC,CAAC,GAAGE,EAAE,EAAE,OAAO,KAAK;AAC1E,EAAA;AAEA,EAAA,OAAO,IAAI;AACf,CAAC;;AAED;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA9C,IAAI,CAAC+C,qBAAqB,GAAI,YAC9B;EACI,MAAMC,CAAC,GAAG,CAAEd,IAAI,CAACR,MAAM,EAAE,EAAEQ,IAAI,CAACR,MAAM,EAAE,EAAEQ,IAAI,CAACR,MAAM,EAAE,CAAE;EACzD,MAAMuB,CAAC,GAAG,CAAEf,IAAI,CAACR,MAAM,EAAE,EAAEQ,IAAI,CAACR,MAAM,EAAE,EAAEQ,IAAI,CAACR,MAAM,EAAE,CAAE;AACzD,EAAA,MAAMwB,MAAM,GAAGhB,IAAI,CAACR,MAAM,EAAE;AAC5B,EAAA,MAAMyB,IAAI,GAAGjB,IAAI,CAACR,MAAM,EAAE;AAC1B,EAAA,MAAM0B,IAAI,GAAGlB,IAAI,CAACR,MAAM,EAAE;;AAE1B;AACA;AACA;EACA,MAAM2B,QAAQ,GAAG,CACb,CAAEJ,CAAC,CAAC,CAAC,CAAC,EAAED,CAAC,CAAC,CAAC,CAAC,EAAEA,CAAC,CAAC,CAAC,CAAC,EAAEA,CAAC,CAAC,CAAC,CAAC,EAAEA,CAAC,CAAC,CAAC,CAAC,EAAEA,CAAC,CAAC,CAAC,CAAC,EAAEA,CAAC,CAAC,CAAC,CAAC,CAAE,EAC5C,CAAEC,CAAC,CAAC,CAAC,CAAC,EAAED,CAAC,CAAC,CAAC,CAAC,EAAEA,CAAC,CAAC,CAAC,CAAC,EAAEA,CAAC,CAAC,CAAC,CAAC,EAAEA,CAAC,CAAC,CAAC,CAAC,EAAEA,CAAC,CAAC,CAAC,CAAC,EAAEA,CAAC,CAAC,CAAC,CAAC,CAAE,EAC5C,CAAEC,CAAC,CAAC,CAAC,CAAC,EAAED,CAAC,CAAC,CAAC,CAAC,EAAEA,CAAC,CAAC,CAAC,CAAC,EAAEA,CAAC,CAAC,CAAC,CAAC,EAAEA,CAAC,CAAC,CAAC,CAAC,EAAEA,CAAC,CAAC,CAAC,CAAC,EAAEA,CAAC,CAAC,CAAC,CAAC,CAAE,CAC/C;;AAED;AACA;AACA;AACA,EAAA,SAASM,QAAQA,CAACC,EAAE,EAAEC,EAAE,EAAEC,EAAE,EAAEC,EAAE,EAAEC,CAAC,EAAEC,CAAC,EAAEC,KAAK,EAAEC,KAAK,EACpD;AACI,IAAA,IAAIC,EAAE,GAAGR,EAAE,GAAGI,CAAC,CAACE,KAAK,CAAC,GAAGL,EAAE,GAAGG,CAAC,CAACG,KAAK,CAAC;AACtC,IAAA,IAAIE,EAAE,GAAGT,EAAE,GAAGK,CAAC,CAACC,KAAK,CAAC,GAAGL,EAAE,GAAGI,CAAC,CAACE,KAAK,CAAC;IAEtC,IAAIE,EAAE,GAAGD,EAAE,EACX;MACI,MAAME,IAAI,GAAGF,EAAE;AACfA,MAAAA,EAAE,GAAGC,EAAE;AACPA,MAAAA,EAAE,GAAGC,IAAI;AACb,IAAA;AAEA,IAAA,MAAMC,GAAG,GAAGT,EAAE,GAAGC,EAAE;IAEnB,OAAO,EAAEK,EAAE,GAAGG,GAAG,IAAIF,EAAE,GAAG,CAACE,GAAG,CAAC;AACnC,EAAA;AAEA,EAAA,OAAO,UAAS7D,CAAC,EAAE8D,cAAc,EACjC;IACI,KAAK,IAAIC,CAAC,GAAG,CAAC,EAAEA,CAAC,GAAG,CAAC,EAAEA,CAAC,EAAE,EAC1B;AACIlC,MAAAA,IAAI,CAACmC,GAAG,CAACrB,CAAC,CAACoB,CAAC,CAAC,EAAE/D,CAAC,CAAC+D,CAAC,GAAG,CAAC,CAAC,EAAE/D,CAAC,CAAC+D,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC,EAAE/D,CAAC,CAAC+D,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC,CAAC;AACpDlC,MAAAA,IAAI,CAACoC,aAAa,CAACtB,CAAC,CAACoB,CAAC,CAAC,EAAEpB,CAAC,CAACoB,CAAC,CAAC,EAAED,cAAc,CAAC;AAClD,IAAA;;AAEA;IACA,KAAK,IAAIvB,IAAI,GAAG,CAAC,EAAEA,IAAI,GAAG,CAAC,EAAEA,IAAI,EAAE,EACnC;AACI,MAAA,IAAII,CAAC,CAAC,CAAC,CAAC,CAACJ,IAAI,CAAC,GAAG,EAAE,IAAII,CAAC,CAAC,CAAC,CAAC,CAACJ,IAAI,CAAC,GAAG,EAAE,IAAII,CAAC,CAAC,CAAC,CAAC,CAACJ,IAAI,CAAC,GAAG,EAAE,EAAE,OAAO,KAAK;AACvE,MAAA,IAAII,CAAC,CAAC,CAAC,CAAC,CAACJ,IAAI,CAAC,GAAG,CAAC,IAAII,CAAC,CAAC,CAAC,CAAC,CAACJ,IAAI,CAAC,GAAG,CAAC,IAAII,CAAC,CAAC,CAAC,CAAC,CAACJ,IAAI,CAAC,GAAG,CAAC,EAAE,OAAO,KAAK;AACxE,IAAA;AAEAV,IAAAA,IAAI,CAACqC,QAAQ,CAACtB,CAAC,CAAC,CAAC,CAAC,EAAED,CAAC,CAAC,CAAC,CAAC,EAAEA,CAAC,CAAC,CAAC,CAAC,CAAC;AAC/Bd,IAAAA,IAAI,CAACqC,QAAQ,CAACtB,CAAC,CAAC,CAAC,CAAC,EAAED,CAAC,CAAC,CAAC,CAAC,EAAEA,CAAC,CAAC,CAAC,CAAC,CAAC;AAC/Bd,IAAAA,IAAI,CAACqC,QAAQ,CAACtB,CAAC,CAAC,CAAC,CAAC,EAAED,CAAC,CAAC,CAAC,CAAC,EAAEA,CAAC,CAAC,CAAC,CAAC,CAAC;;AAE/B;AACAd,IAAAA,IAAI,CAACsC,KAAK,CAACtB,MAAM,EAAED,CAAC,CAAC,CAAC,CAAC,EAAEA,CAAC,CAAC,CAAC,CAAC,CAAC;IAE9B,KAAK,IAAImB,CAAC,GAAG,CAAC,EAAEA,CAAC,GAAG,CAAC,EAAEA,CAAC,EAAE,EAC1B;AACI,MAAA,IAAIlB,MAAM,CAACkB,CAAC,CAAC,GAAG,CAAC,EACjB;AACIjB,QAAAA,IAAI,CAACiB,CAAC,CAAC,GAAG,EAAE,GAAGpB,CAAC,CAAC,CAAC,CAAC,CAACoB,CAAC,CAAC;AACtBhB,QAAAA,IAAI,CAACgB,CAAC,CAAC,GAAG,CAAC,GAAGpB,CAAC,CAAC,CAAC,CAAC,CAACoB,CAAC,CAAC;AACzB,MAAA,CAAC,MAED;AACIjB,QAAAA,IAAI,CAACiB,CAAC,CAAC,GAAG,CAAC,GAAGpB,CAAC,CAAC,CAAC,CAAC,CAACoB,CAAC,CAAC;AACrBhB,QAAAA,IAAI,CAACgB,CAAC,CAAC,GAAG,EAAE,GAAGpB,CAAC,CAAC,CAAC,CAAC,CAACoB,CAAC,CAAC;AAC1B,MAAA;AACJ,IAAA;AAEA,IAAA,IAAIlC,IAAI,CAACuC,GAAG,CAACtB,IAAI,EAAED,MAAM,CAAC,GAAG,CAAC,EAAE,OAAO,KAAK;AAC5C,IAAA,IAAIhB,IAAI,CAACuC,GAAG,CAACrB,IAAI,EAAEF,MAAM,CAAC,GAAG,CAAC,EAAE,OAAO,KAAK;AAE5C,IAAA,KAAK,MAAM,CAAEwB,IAAI,EAAE3D,EAAE,EAAEG,EAAE,EAAEF,EAAE,EAAEG,EAAE,EAAEF,EAAE,EAAEG,EAAE,CAAE,IAAIiC,QAAQ,EACvD;MACI,MAAMsB,GAAG,GAAGnD,IAAI,CAACoD,GAAG,CAACF,IAAI,CAAC,CAAC,CAAC,CAAC;MAC7B,MAAMG,GAAG,GAAGrD,IAAI,CAACoD,GAAG,CAACF,IAAI,CAAC,CAAC,CAAC,CAAC;MAC7B,MAAMI,GAAG,GAAGtD,IAAI,CAACoD,GAAG,CAACF,IAAI,CAAC,CAAC,CAAC,CAAC;AAE7B,MAAA,IAAI,CAACpB,QAAQ,CAACoB,IAAI,CAAC,CAAC,CAAC,EAAE,CAACA,IAAI,CAAC,CAAC,CAAC,EAAEI,GAAG,EAAED,GAAG,EAAE9D,EAAE,EAAEG,EAAE,EAAE,CAAC,EAAE,CAAC,CAAC,EAAE,OAAO,KAAK;AACtE,MAAA,IAAI,CAACoC,QAAQ,CAAC,CAACoB,IAAI,CAAC,CAAC,CAAC,EAAEA,IAAI,CAAC,CAAC,CAAC,EAAEI,GAAG,EAAEH,GAAG,EAAE3D,EAAE,EAAEG,EAAE,EAAE,CAAC,EAAE,CAAC,CAAC,EAAE,OAAO,KAAK;AACtE,MAAA,IAAI,CAACmC,QAAQ,CAACoB,IAAI,CAAC,CAAC,CAAC,EAAE,CAACA,IAAI,CAAC,CAAC,CAAC,EAAEG,GAAG,EAAEF,GAAG,EAAE1D,EAAE,EAAEG,EAAE,EAAE,CAAC,EAAE,CAAC,CAAC,EAAE,OAAO,KAAK;AAC1E,IAAA;AAEA,IAAA,OAAO,IAAI;EACf,CAAC;AACL,CAAC,EAAG;AAEJpB,IAAI,CAAC+E,SAAS,GAAGjD,IAAI,CAACiD,SAAS;;AAE/B;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA/E,IAAI,CAACmC,yBAAyB,GAAG,UAASR,GAAG,EAAEtB,CAAC,EAAE4B,KAAK,EACvD;EACI,IAAIlB,EAAE,GAAGV,CAAC,CAAC,CAAC,CAAC,GAAGA,CAAC,CAAC,CAAC,CAAC;IAChBW,EAAE,GAAGX,CAAC,CAAC,CAAC,CAAC,GAAGA,CAAC,CAAC,CAAC,CAAC;IAChBY,EAAE,GAAGZ,CAAC,CAAC,CAAC,CAAC,GAAGA,CAAC,CAAC,CAAC,CAAC;IAEhBa,EAAE,GAAGb,CAAC,CAAC,CAAC,CAAC,GAAGA,CAAC,CAAC,CAAC,CAAC;IAChBc,EAAE,GAAGd,CAAC,CAAC,CAAC,CAAC,GAAGA,CAAC,CAAC,CAAC,CAAC;IAChBe,EAAE,GAAGf,CAAC,CAAC,CAAC,CAAC,GAAGA,CAAC,CAAC,CAAC,CAAC;IAEhB2E,EAAE,GAAG/C,KAAK,CAAC,CAAC,CAAC,GAAG5B,CAAC,CAAC,CAAC,CAAC;IACpB4E,EAAE,GAAGhD,KAAK,CAAC,CAAC,CAAC,GAAG5B,CAAC,CAAC,CAAC,CAAC;IACpB6E,EAAE,GAAGjD,KAAK,CAAC,CAAC,CAAC,GAAG5B,CAAC,CAAC,CAAC,CAAC;AAExB,EAAA,IAAI8E,KAAK,GAAGpE,EAAE,GAAGA,EAAE,GAAGC,EAAE,GAAGA,EAAE,GAAGC,EAAE,GAAGA,EAAE;IACnCmE,KAAK,GAAGrE,EAAE,GAAGG,EAAE,GAAGF,EAAE,GAAGG,EAAE,GAAGF,EAAE,GAAGG,EAAE;IACnCiE,KAAK,GAAGtE,EAAE,GAAGiE,EAAE,GAAGhE,EAAE,GAAGiE,EAAE,GAAGhE,EAAE,GAAGiE,EAAE;IACnCI,KAAK,GAAGpE,EAAE,GAAGA,EAAE,GAAGC,EAAE,GAAGA,EAAE,GAAGC,EAAE,GAAGA,EAAE;IACnCmE,KAAK,GAAGrE,EAAE,GAAG8D,EAAE,GAAG7D,EAAE,GAAG8D,EAAE,GAAG7D,EAAE,GAAG8D,EAAE;EAEvC,IAAIM,KAAK,GAAIL,KAAK,GAAGG,KAAK,GAAGF,KAAK,GAAGA,KAAM;EAE3C,IAAII,KAAK,KAAK,CAAC,EACf;AACI7D,IAAAA,GAAG,CAAC,CAAC,CAAC,GAAG,EAAE;AACXA,IAAAA,GAAG,CAAC,CAAC,CAAC,GAAG,EAAE;AACXA,IAAAA,GAAG,CAAC,CAAC,CAAC,GAAG,EAAE;AACX,IAAA,MAAM,IAAI8D,KAAK,CAAC,mBAAmB,CAAC;AACxC,EAAA,CAAC,MAED;AACI,IAAA,IAAIC,QAAQ,GAAG,CAAC,GAAGF,KAAK;IACxB,IAAIG,CAAC,GAAG,CAACL,KAAK,GAAGD,KAAK,GAAGD,KAAK,GAAGG,KAAK,IAAIG,QAAQ;IAClD,IAAI1C,CAAC,GAAG,CAACmC,KAAK,GAAGI,KAAK,GAAGH,KAAK,GAAGC,KAAK,IAAIK,QAAQ;IAClD/D,GAAG,CAAC,CAAC,CAAC,GAAG,CAAC,GAAGgE,CAAC,GAAG3C,CAAC;AAClBrB,IAAAA,GAAG,CAAC,CAAC,CAAC,GAAGqB,CAAC;AACVrB,IAAAA,GAAG,CAAC,CAAC,CAAC,GAAGgE,CAAC;AACd,EAAA;AACA,EAAA,OAAOhE,GAAG;AACd,CAAC;;AAED;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA3B,IAAI,CAAC4F,qBAAqB,GAAI,YAC9B;AACI,EAAA,IAAIC,EAAE,EAAEvD,EAAE,EAAEwD,QAAQ;EAEpB,OAAO,SAASF,qBAAqBA,CAACjE,GAAG,EAAEtB,CAAC,EAAE4B,KAAK,EAAE8D,KAAK,EAC1D;IACI,IAAI,CAACF,EAAE,EACP;AACIA,MAAAA,EAAE,GAAG3D,IAAI,CAACR,MAAM,EAAE;AAClBY,MAAAA,EAAE,GAAGJ,IAAI,CAACR,MAAM,EAAE;AAClBoE,MAAAA,QAAQ,GAAG,CAAEtF,IAAI,CAACkB,MAAM,EAAE,EAAElB,IAAI,CAACkB,MAAM,EAAE,EAAElB,IAAI,CAACkB,MAAM,EAAE,CAAE;AAC9D,IAAA;;AAEA;IACA,IAAIsE,sBAAsB,GAAGhG,IAAI,CAACiG,sBAAsB,CAACJ,EAAE,EAAExF,CAAC,EAAE4B,KAAK,CAAC;;AAEtE;AACAzB,IAAAA,IAAI,CAAC6D,GAAG,CAACyB,QAAQ,CAAC,CAAC,CAAC,EAAEzF,CAAC,CAAC,CAAC,CAAC,EAAEA,CAAC,CAAC,CAAC,CAAC,EAAEA,CAAC,CAAC,CAAC,CAAC,EAAEA,CAAC,CAAC,CAAC,CAAC,EAAEA,CAAC,CAAC,CAAC,CAAC,EAAEA,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;AAC1DG,IAAAA,IAAI,CAAC6D,GAAG,CAACyB,QAAQ,CAAC,CAAC,CAAC,EAAEzF,CAAC,CAAC,CAAC,CAAC,EAAEA,CAAC,CAAC,CAAC,CAAC,EAAEA,CAAC,CAAC,CAAC,CAAC,EAAEA,CAAC,CAAC,CAAC,CAAC,EAAEA,CAAC,CAAC,CAAC,CAAC,EAAEA,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;AAC1DG,IAAAA,IAAI,CAAC6D,GAAG,CAACyB,QAAQ,CAAC,CAAC,CAAC,EAAEzF,CAAC,CAAC,CAAC,CAAC,EAAEA,CAAC,CAAC,CAAC,CAAC,EAAEA,CAAC,CAAC,CAAC,CAAC,EAAEA,CAAC,CAAC,CAAC,CAAC,EAAEA,CAAC,CAAC,CAAC,CAAC,EAAEA,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;;IAE1D,IAAI6F,WAAW,GAAGC,QAAQ;MACtBC,SAAS;AAEb,IAAA,KAAK,IAAIhC,CAAC,GAAG,CAAC,EAAEA,CAAC,GAAG0B,QAAQ,CAACO,MAAM,EAAEjC,CAAC,EAAE,EACxC;AACI;AACA,MAAA,IAAIkC,kBAAkB,GAAG9F,IAAI,CAACyF,sBAAsB,CAAC3D,EAAE,EAAEwD,QAAQ,CAAC1B,CAAC,CAAC,EAAE4B,sBAAsB,EAAE,IAAI,CAAC;MACnG,IAAIO,QAAQ,GAAGrE,IAAI,CAACsE,eAAe,CAACF,kBAAkB,EAAEN,sBAAsB,CAAC;MAC/E,IAAIO,QAAQ,GAAGL,WAAW,EAC1B;AACIA,QAAAA,WAAW,GAAGK,QAAQ;QACtB5E,GAAG,CAAC,CAAC,CAAC,GAAGmE,QAAQ,CAAC1B,CAAC,CAAC,CAAC,CAAC,CAAC;QACvBzC,GAAG,CAAC,CAAC,CAAC,GAAGmE,QAAQ,CAAC1B,CAAC,CAAC,CAAC,CAAC,CAAC;QACvBzC,GAAG,CAAC,CAAC,CAAC,GAAGmE,QAAQ,CAAC1B,CAAC,CAAC,CAAC,CAAC,CAAC;QACvBzC,GAAG,CAAC,CAAC,CAAC,GAAGmE,QAAQ,CAAC1B,CAAC,CAAC,CAAC,CAAC,CAAC;QACvBzC,GAAG,CAAC,CAAC,CAAC,GAAGmE,QAAQ,CAAC1B,CAAC,CAAC,CAAC,CAAC,CAAC;QACvBzC,GAAG,CAAC,CAAC,CAAC,GAAGmE,QAAQ,CAAC1B,CAAC,CAAC,CAAC,CAAC,CAAC;AACvBgC,QAAAA,SAAS,GAAGhC,CAAC;AACjB,MAAA;AACJ,IAAA;;AAEA;AACA,IAAA,IAAI2B,KAAK,EACT;AACI,MAAA,QAAOK,SAAS;AAEZ,QAAA,KAAK,CAAC;UACFL,KAAK,CAACU,SAAS,GAAG,CAAC;UACnBV,KAAK,CAACW,OAAO,GAAG,CAAC;AACjB,UAAA;AAEJ,QAAA,KAAK,CAAC;UACFX,KAAK,CAACU,SAAS,GAAG,CAAC;UACnBV,KAAK,CAACW,OAAO,GAAG,CAAC;AACjB,UAAA;AAEJ,QAAA;UACIX,KAAK,CAACU,SAAS,GAAG,CAAC;UACnBV,KAAK,CAACW,OAAO,GAAG,CAAC;AACjB,UAAA;AACR;AACJ,IAAA;AAEA,IAAA,OAAO/E,GAAG;EACd,CAAC;AACL,CAAC,EAAG;;AAEJ;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA3B,IAAI,CAACiG,sBAAsB,GAAI,YAC/B;AACI,EAAA,IAAIU,KAAK,EAAEb,QAAQ,EAAEc,cAAc,EAAEC,YAAY,EAAE7E,MAAM,EAAE8E,MAAM,EAAEC,MAAM;EAEzE,OAAO,SAASd,sBAAsBA,CAACtE,GAAG,EAAEtB,CAAC,EAAE4B,KAAK,EACpD;IACI,IAAI,CAAC0E,KAAK,EACV;AACIA,MAAAA,KAAK,GAAGK,GAAG,CAACtF,MAAM,EAAE;AACpBoE,MAAAA,QAAQ,GAAG,CAAEtF,IAAI,CAACkB,MAAM,EAAE,EAAElB,IAAI,CAACkB,MAAM,EAAE,EAAElB,IAAI,CAACkB,MAAM,EAAE,CAAE;AAC1DkF,MAAAA,cAAc,GAAG1E,IAAI,CAACR,MAAM,EAAE;AAC9BmF,MAAAA,YAAY,GAAG3E,IAAI,CAACR,MAAM,EAAE;AAC5BM,MAAAA,MAAM,GAAGE,IAAI,CAACR,MAAM,EAAE;AACtBoF,MAAAA,MAAM,GAAG5E,IAAI,CAACR,MAAM,EAAE;AACtBqF,MAAAA,MAAM,GAAG7E,IAAI,CAACR,MAAM,EAAE;AAC1B,IAAA;;AAEA;AACA1B,IAAAA,IAAI,CAACiH,KAAK,CAACjF,MAAM,EAAE3B,CAAC,CAAC;AACrBL,IAAAA,IAAI,CAACkH,KAAK,CAACJ,MAAM,EAAEzG,CAAC,CAAC;AACrBL,IAAAA,IAAI,CAACmH,KAAK,CAACJ,MAAM,EAAE1G,CAAC,CAAC;;AAErB;IACA2G,GAAG,CAACI,kBAAkB,CAACT,KAAK,EAAE3E,MAAM,EAAE8E,MAAM,EAAEC,MAAM,CAAC;IACrDC,GAAG,CAACK,iBAAiB,CAACT,cAAc,EAAED,KAAK,EAAE1E,KAAK,CAAC;;AAEnD;IACA,IAAIjC,IAAI,CAAC+B,QAAQ,CAAC1B,CAAC,EAAEuG,cAAc,CAAC,KAAK,IAAI,EAC7C;AACIjF,MAAAA,GAAG,CAAC,CAAC,CAAC,GAAGiF,cAAc,CAAC,CAAC,CAAC;AAC1BjF,MAAAA,GAAG,CAAC,CAAC,CAAC,GAAGiF,cAAc,CAAC,CAAC,CAAC;AAC1BjF,MAAAA,GAAG,CAAC,CAAC,CAAC,GAAGiF,cAAc,CAAC,CAAC,CAAC;AAC9B,IAAA;AACA;AACA;SAEA;AACIpG,MAAAA,IAAI,CAAC6D,GAAG,CAACyB,QAAQ,CAAC,CAAC,CAAC,EAAEzF,CAAC,CAAC,CAAC,CAAC,EAAEA,CAAC,CAAC,CAAC,CAAC,EAAEA,CAAC,CAAC,CAAC,CAAC,EAAEA,CAAC,CAAC,CAAC,CAAC,EAAEA,CAAC,CAAC,CAAC,CAAC,EAAEA,CAAC,CAAC,CAAC,CAAC,CAAC;AACzDG,MAAAA,IAAI,CAAC6D,GAAG,CAACyB,QAAQ,CAAC,CAAC,CAAC,EAAEzF,CAAC,CAAC,CAAC,CAAC,EAAEA,CAAC,CAAC,CAAC,CAAC,EAAEA,CAAC,CAAC,CAAC,CAAC,EAAEA,CAAC,CAAC,CAAC,CAAC,EAAEA,CAAC,CAAC,CAAC,CAAC,EAAEA,CAAC,CAAC,CAAC,CAAC,CAAC;AACzDG,MAAAA,IAAI,CAAC6D,GAAG,CAACyB,QAAQ,CAAC,CAAC,CAAC,EAAEzF,CAAC,CAAC,CAAC,CAAC,EAAEA,CAAC,CAAC,CAAC,CAAC,EAAEA,CAAC,CAAC,CAAC,CAAC,EAAEA,CAAC,CAAC,CAAC,CAAC,EAAEA,CAAC,CAAC,CAAC,CAAC,EAAEA,CAAC,CAAC,CAAC,CAAC,CAAC;MAEzD,IAAI6F,WAAW,GAAGC,QAAQ;AAC1B,MAAA,KAAK,IAAI/B,CAAC,GAAG,CAAC,EAAEA,CAAC,GAAG0B,QAAQ,CAACO,MAAM,EAAEjC,CAAC,EAAE,EACxC;AACI5D,QAAAA,IAAI,CAACyF,sBAAsB,CAACY,YAAY,EAAEf,QAAQ,CAAC1B,CAAC,CAAC,EAAEwC,cAAc,EAAE,IAAI,CAAC;QAC5E,IAAIL,QAAQ,GAAGrE,IAAI,CAACsE,eAAe,CAACI,cAAc,EAAEC,YAAY,CAAC;QACjE,IAAIN,QAAQ,GAAGL,WAAW,EAC1B;AACIA,UAAAA,WAAW,GAAGK,QAAQ;AACtB5E,UAAAA,GAAG,CAAC,CAAC,CAAC,GAAGkF,YAAY,CAAC,CAAC,CAAC;AACxBlF,UAAAA,GAAG,CAAC,CAAC,CAAC,GAAGkF,YAAY,CAAC,CAAC,CAAC;AACxBlF,UAAAA,GAAG,CAAC,CAAC,CAAC,GAAGkF,YAAY,CAAC,CAAC,CAAC;AAC5B,QAAA;AACJ,MAAA;AACJ,IAAA;AACA,IAAA,OAAOlF,GAAG;EACd,CAAC;AACL,CAAC,EAAG;;AAEJ;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA3B,IAAI,CAACsH,uBAAuB,GAAI,YAChC;AACI,EAAA,IAAItF,MAAM,EAAE8E,MAAM,EAAEC,MAAM;EAE1B,OAAO,UAASpF,GAAG,EAAEtB,CAAC,EAAE4B,KAAK,EAAE8D,KAAK,EACpC;IACI,IAAI,CAAC/D,MAAM,EACX;AACIA,MAAAA,MAAM,GAAGE,IAAI,CAACR,MAAM,EAAE;AACtBoF,MAAAA,MAAM,GAAG5E,IAAI,CAACR,MAAM,EAAE;AACtBqF,MAAAA,MAAM,GAAG7E,IAAI,CAACR,MAAM,EAAE;AAC1B,IAAA;;AAEA;IACA1B,IAAI,CAACiG,sBAAsB,CAACtE,GAAG,EAAEtB,CAAC,EAAE4B,KAAK,CAAC;IAE1C,IAAIiE,WAAW,GAAGC,QAAQ;MACtBI,QAAQ;MACRlF,CAAC;MAAEC,CAAC;MAAEC,CAAC;AACPgG,MAAAA,QAAQ,GAAG,CACPvH,IAAI,CAACiH,KAAK,CAACjF,MAAM,EAAE3B,CAAC,CAAC,EACrBL,IAAI,CAACkH,KAAK,CAACJ,MAAM,EAAEzG,CAAC,CAAC,EACrBL,IAAI,CAACmH,KAAK,CAACJ,MAAM,EAAE1G,CAAC,CAAC,CACxB;AAEL,IAAA,IAAImH,UAAU;AACd;AACA,IAAA,KAAK,IAAIpD,CAAC,GAAG,CAAC,EAAEA,CAAC,GAAGmD,QAAQ,CAAClB,MAAM,EAAEjC,CAAC,EAAE,EACxC;MACImC,QAAQ,GAAGrE,IAAI,CAACsE,eAAe,CAACe,QAAQ,CAACnD,CAAC,CAAC,EAAEzC,GAAG,CAAC;MACjD,IAAI4E,QAAQ,GAAGL,WAAW,EAC1B;AACIA,QAAAA,WAAW,GAAGK,QAAQ;AACtBlF,QAAAA,CAAC,GAAGkG,QAAQ,CAACnD,CAAC,CAAC,CAAC,CAAC,CAAC;AAClB9C,QAAAA,CAAC,GAAGiG,QAAQ,CAACnD,CAAC,CAAC,CAAC,CAAC,CAAC;AAClB7C,QAAAA,CAAC,GAAGgG,QAAQ,CAACnD,CAAC,CAAC,CAAC,CAAC,CAAC;AAClBoD,QAAAA,UAAU,GAAGpD,CAAC;AAClB,MAAA;AACJ,IAAA;AAEA,IAAA,IAAI2B,KAAK,EAAEA,KAAK,CAAC0B,OAAO,GAAGD,UAAU;AAErC7F,IAAAA,GAAG,CAAC,CAAC,CAAC,GAAGN,CAAC;AACVM,IAAAA,GAAG,CAAC,CAAC,CAAC,GAAGL,CAAC;AACVK,IAAAA,GAAG,CAAC,CAAC,CAAC,GAAGJ,CAAC;AACV,IAAA,OAAOI,GAAG;EACd,CAAC;AACL,CAAC,EAAG;;AAEJ;AACA;AACA;AACA;AACA;AACA;AACA;AACA3B,IAAI,CAAC0H,WAAW,GAAG,UAAS/F,GAAG,EAAEtB,CAAC,EAClC;AACI,EAAA,IAAIsH,CAAC,GAAG,CAAC,GAAG,CAAC;EACbhG,GAAG,CAAC,CAAC,CAAC,GAAG,CAACtB,CAAC,CAAC,CAAC,CAAC,GAAGA,CAAC,CAAC,CAAC,CAAC,GAAGA,CAAC,CAAC,CAAC,CAAC,IAAIsH,CAAC;EACjChG,GAAG,CAAC,CAAC,CAAC,GAAG,CAACtB,CAAC,CAAC,CAAC,CAAC,GAAGA,CAAC,CAAC,CAAC,CAAC,GAAGA,CAAC,CAAC,CAAC,CAAC,IAAIsH,CAAC;EACjChG,GAAG,CAAC,CAAC,CAAC,GAAG,CAACtB,CAAC,CAAC,CAAC,CAAC,GAAGA,CAAC,CAAC,CAAC,CAAC,GAAGA,CAAC,CAAC,CAAC,CAAC,IAAIsH,CAAC;AACjC,EAAA,OAAOhG,GAAG;AACd,CAAC;AAED,IAAIiG,MAAM,GAAG,IAAI;;AAEjB;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA5H,IAAI,CAAC6H,qBAAqB,GAAI,UAASlG,GAAG,EAAEW,EAAE,EAAEC,EAAE,EAAEC,EAAE,EACtD;EACI,IAAI,CAACoF,MAAM,EAAEA,MAAM,GAAG5H,IAAI,CAAC0B,MAAM,EAAE;EACnC1B,IAAI,CAACqC,YAAY,CAACuF,MAAM,EAAEtF,EAAE,EAAEC,EAAE,EAAEC,EAAE,CAAC;AACrC,EAAA,OAAOxC,IAAI,CAAC8H,SAAS,CAACnG,GAAG,EAAEiG,MAAM,CAAC;AACtC,CAAC;;AAED;AACA;AACA;AACA;AACA;AACA;AACA;AACA5H,IAAI,CAAC8H,SAAS,GAAG,UAASnG,GAAG,EAAEtB,CAAC,EAChC;EACI,IAAIU,EAAE,GAAGV,CAAC,CAAC,CAAC,CAAC,GAAGA,CAAC,CAAC,CAAC,CAAC;IAChBW,EAAE,GAAGX,CAAC,CAAC,CAAC,CAAC,GAAGA,CAAC,CAAC,CAAC,CAAC;IAChBY,EAAE,GAAGZ,CAAC,CAAC,CAAC,CAAC,GAAGA,CAAC,CAAC,CAAC,CAAC;IAChBa,EAAE,GAAGb,CAAC,CAAC,CAAC,CAAC,GAAGA,CAAC,CAAC,CAAC,CAAC;IAChBc,EAAE,GAAGd,CAAC,CAAC,CAAC,CAAC,GAAGA,CAAC,CAAC,CAAC,CAAC;IAChBe,EAAE,GAAGf,CAAC,CAAC,CAAC,CAAC,GAAGA,CAAC,CAAC,CAAC,CAAC;;AAEpB;EACA,IAAIgB,CAAC,GAAGL,EAAE,GAAGI,EAAE,GAAGH,EAAE,GAAGE,EAAE;AACrBG,IAAAA,CAAC,GAAGL,EAAE,GAAGC,EAAE,GAAGH,EAAE,GAAGK,EAAE;AACrBG,IAAAA,CAAC,GAAGR,EAAE,GAAGI,EAAE,GAAGH,EAAE,GAAGE,EAAE;;AAEzB;AACA,EAAA,IAAI6G,GAAG,GAAG1G,CAAC,GAAGA,CAAC,GAAGC,CAAC,GAAGA,CAAC,GAAGC,CAAC,GAAGA,CAAC;EAC/B,IAAIwG,GAAG,GAAG,CAAC,EACX;IACIA,GAAG,GAAG,CAAC,GAAGvG,IAAI,CAACC,IAAI,CAACsG,GAAG,CAAC;AACxBpG,IAAAA,GAAG,CAAC,CAAC,CAAC,GAAGN,CAAC,GAAG0G,GAAG;AAChBpG,IAAAA,GAAG,CAAC,CAAC,CAAC,GAAGL,CAAC,GAAGyG,GAAG;AAChBpG,IAAAA,GAAG,CAAC,CAAC,CAAC,GAAGJ,CAAC,GAAGwG,GAAG;AACpB,EAAA,CAAC,MAED;AACIpG,IAAAA,GAAG,CAAC,CAAC,CAAC,GAAG,CAAC;AACVA,IAAAA,GAAG,CAAC,CAAC,CAAC,GAAG,CAAC;AACVA,IAAAA,GAAG,CAAC,CAAC,CAAC,GAAG,CAAC;AACV,IAAA,MAAM,IAAI8D,KAAK,CAAC,qBAAqB,CAAC;AAC1C,EAAA;AACA,EAAA,OAAO9D,GAAG;AACd,CAAC;;AAED;AACA;AACA;AACA;AACA;AACA;AACA;AACA3B,IAAI,CAACiH,KAAK,GAAGzG,IAAI,CAACwH,QAAQ;;AAE1B;AACA;AACA;AACA;AACA;AACA;AACA;AACAhI,IAAI,CAACkH,KAAK,GAAG1G,IAAI,CAACyH,MAAM;;AAExB;AACA;AACA;AACA;AACA;AACA;AACA;AACAjI,IAAI,CAACmH,KAAK,GAAG,UAASxF,GAAG,EAAEqB,CAAC,EAC5B;AACIrB,EAAAA,GAAG,CAAC,CAAC,CAAC,GAAGqB,CAAC,CAAC,CAAC,CAAC;AACbrB,EAAAA,GAAG,CAAC,CAAC,CAAC,GAAGqB,CAAC,CAAC,CAAC,CAAC;AACbrB,EAAAA,GAAG,CAAC,CAAC,CAAC,GAAGqB,CAAC,CAAC,CAAC,CAAC;AACb,EAAA,OAAOrB,GAAG;AACd,CAAC;;AAED;AACA;AACA;AACA;AACA;AACA;AACA3B,IAAI,CAACkI,KAAK,GAAG1H,IAAI,CAAC2H,QAAQ;;AAE1B;AACA;AACA;AACA;AACA;AACA;AACAnI,IAAI,CAACoI,KAAK,GAAG5H,IAAI,CAAC6H,MAAM;;AAExB;AACA;AACA;AACA;AACA;AACA;AACArI,IAAI,CAACsI,KAAK,GAAG,UAAS3G,GAAG,EAAEqB,CAAC,EAC5B;AACIrB,EAAAA,GAAG,CAAC,CAAC,CAAC,GAAGqB,CAAC,CAAC,CAAC,CAAC;AACbrB,EAAAA,GAAG,CAAC,CAAC,CAAC,GAAGqB,CAAC,CAAC,CAAC,CAAC;AACbrB,EAAAA,GAAG,CAAC,CAAC,CAAC,GAAGqB,CAAC,CAAC,CAAC,CAAC;AACb,EAAA,OAAOrB,GAAG;AACd,CAAC;;AAED;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA3B,IAAI,CAACuI,OAAO,GAAGzG,IAAI,CAACyG,OAAO;;AAE3B;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACAvI,IAAI,CAACwI,UAAU,GAAG,UAASnI,CAAC,EAAEiC,EAAE,EAAEC,EAAE,EAAEC,EAAE,EACxC;AACIF,EAAAA,EAAE,CAAC,CAAC,CAAC,GAAGjC,CAAC,CAAC,CAAC,CAAC;AACZiC,EAAAA,EAAE,CAAC,CAAC,CAAC,GAAGjC,CAAC,CAAC,CAAC,CAAC;AACZiC,EAAAA,EAAE,CAAC,CAAC,CAAC,GAAGjC,CAAC,CAAC,CAAC,CAAC;AACZkC,EAAAA,EAAE,CAAC,CAAC,CAAC,GAAGlC,CAAC,CAAC,CAAC,CAAC;AACZkC,EAAAA,EAAE,CAAC,CAAC,CAAC,GAAGlC,CAAC,CAAC,CAAC,CAAC;AACZkC,EAAAA,EAAE,CAAC,CAAC,CAAC,GAAGlC,CAAC,CAAC,CAAC,CAAC;AACZmC,EAAAA,EAAE,CAAC,CAAC,CAAC,GAAGnC,CAAC,CAAC,CAAC,CAAC;AACZmC,EAAAA,EAAE,CAAC,CAAC,CAAC,GAAGnC,CAAC,CAAC,CAAC,CAAC;AACZmC,EAAAA,EAAE,CAAC,CAAC,CAAC,GAAGnC,CAAC,CAAC,CAAC,CAAC;AACZ,EAAA,OAAOA,CAAC;AACZ,CAAC;AAED,IAAI2B,MAAM,EAAE8E,MAAM,EAAEC,MAAM;;AAE1B;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA/G,IAAI,CAACsE,aAAa,GAAG,UAAS3C,GAAG,EAAEtB,CAAC,EAAEoI,CAAC,EACvC;EACI,IAAI,CAACzG,MAAM,EACX;AACIA,IAAAA,MAAM,GAAGE,IAAI,CAACR,MAAM,EAAE;AACtBoF,IAAAA,MAAM,GAAG5E,IAAI,CAACR,MAAM,EAAE;AACtBqF,IAAAA,MAAM,GAAG7E,IAAI,CAACR,MAAM,EAAE;AAC1B,EAAA;AAEA1B,EAAAA,IAAI,CAACiH,KAAK,CAACjF,MAAM,EAAE3B,CAAC,CAAC;AACrBL,EAAAA,IAAI,CAACkH,KAAK,CAACJ,MAAM,EAAEzG,CAAC,CAAC;AACrBL,EAAAA,IAAI,CAACmH,KAAK,CAACJ,MAAM,EAAE1G,CAAC,CAAC;EAErB6B,IAAI,CAACoC,aAAa,CAACtC,MAAM,EAAEA,MAAM,EAAEyG,CAAC,CAAC;EACrCvG,IAAI,CAACoC,aAAa,CAACwC,MAAM,EAAEA,MAAM,EAAE2B,CAAC,CAAC;EACrCvG,IAAI,CAACoC,aAAa,CAACyC,MAAM,EAAEA,MAAM,EAAE0B,CAAC,CAAC;EAErC,OAAOzI,IAAI,CAACqC,YAAY,CAACV,GAAG,EAAEK,MAAM,EAAE8E,MAAM,EAAEC,MAAM,CAAC;AACzD,CAAC;AAEM,MAAM;EACT9G,KAAK;EACLG,OAAO;EACPG,GAAG;EACHG,GAAG;EACHE,GAAG;EACHE,IAAI;EACJY,MAAM;EACNG,KAAK;EACLE,QAAQ;EACRK,IAAI;EACJC,YAAY;EACZ0C,SAAS;EACT5C,yBAAyB;EACzByD,qBAAqB;EACrBK,sBAAsB;EACtBqB,uBAAuB;EACvBI,WAAW;EACXG,qBAAqB;EACrBC,SAAS;EACTb,KAAK;EACLxE,gBAAgB;EAChBM,qBAAqB;EACrBmE,KAAK;EACLC,KAAK;EACLe,KAAK;EACLE,KAAK;EACLE,KAAK;EACLC,OAAO;EACPC,UAAU;AACVlE,EAAAA;AACJ,CAAC,GAAGtE;;;;"}
+{"version":3,"file":"tri3.js","sources":["../../../../src/global/math/tri3.js"],"sourcesContent":["import { vec3 } from \"./vec3.js\";\nimport { mat3 } from \"./mat3.js\";\nimport { pln } from \"./pln.js\";\nimport { lne3 } from \"./lne3.js\";\nimport { pool } from \"./pool.js\";\n\n/**\n * 3d Triangle\n *\n * @typedef {Float32Array} tri3\n */\n\nexport const tri3 = {};\n\n/**\n * Allocates a pooled tri3\n * @returns {Float32Array|tri3}\n */\ntri3.alloc = function()\n{\n    return pool.allocF32(9);\n};\n\n/**\n * Unallocates a pooled tri3\n * @param {tri3|Float32Array} a\n */\ntri3.unalloc = function(a)\n{\n    pool.freeType(a);\n};\n\n/**\n * Gets a subarray of a tri3's first vertex\n *\n * @param {tri3} a\n * @returns {vec3}\n */\ntri3.$v1 = lne3.$start;\n\n/**\n * Gets a subarray of a tri3's second vertex\n *\n * @param {tri3} a\n * @returns {vec3}\n */\ntri3.$v2 = lne3.$end;\n\n/**\n * Gets a subarray of a tri3's third vertex\n *\n * @param {tri3} a\n * @returns {vec3}\n */\ntri3.$v3 = function(a)\n{\n    return a.subarray(6, 9);\n};\n\n/**\n * Gets the area of a triangle\n *\n * @param {tri3} a\n * @returns {number}\n */\ntri3.area = function(a)\n{\n    let ax = a[6] - a[3],\n        ay = a[7] - a[4],\n        az = a[8] - a[5],\n        bx = a[0] - a[3],\n        by = a[1] - a[4],\n        bz = a[2] - a[5];\n    // Cross product\n    let x = ay * bz - az * by,\n        y = az * bx - ax * bz,\n        z = ax * by - ay * bx;\n    // Return half length\n    return Math.sqrt(x * x + y * y + z * z) * 0.5;\n};\n\n/**\n * Creates a tri3\n *\n * @returns {tri3}\n */\ntri3.create = function()\n{\n    let out = new Float32Array(9);\n    out[0] = 0;\n    out[1] = 0;\n    out[2] = 0;\n    out[3] = 0;\n    out[4] = 0;\n    out[5] = 0;\n    out[6] = 0;\n    out[7] = 0;\n    out[8] = 0;\n    return out;\n};\n\n/**\n * Clones a tri3\n *\n * @param {tri3} a\n * @returns {tri3}\n */\ntri3.clone = mat3.clone;\n\n/**\n * Checks if a tri3 contains a point\n *\n * @param {tri3} a\n * @param {vec3} point\n * @returns {boolean}\n */\ntri3.contains = (function()\n{\n    let vec3_0;\n    return function(a, point)\n    {\n        if (!vec3_0) vec3_0 = vec3.create();\n        tri3.getBaryCentricCoordinates(vec3_0, a, point);\n        return (vec3_0[0] >= 0) && (vec3_0[1] >= 0) && ((vec3_0[0] + vec3_0[1]) <= 1);\n    };\n})();\n\n/**\n * Copies a tri3\n *\n * @param {tri3} a\n * @param {tri3} b\n * @returns {tri3} a\n */\ntri3.copy = mat3.copy;\n\n/**\n * Sets a tri3 from vertices\n *\n * @param {tri3} out\n * @param {vec3} v1\n * @param {vec3} v2\n * @param {vec3} v3\n * @returns {tri3} out\n */\ntri3.fromVertices = function(out, v1, v2, v3)\n{\n    out[0] = v1[0];\n    out[1] = v1[1];\n    out[2] = v1[2];\n    out[3] = v2[0];\n    out[4] = v2[1];\n    out[5] = v2[2];\n    out[6] = v3[0];\n    out[7] = v3[1];\n    out[8] = v3[2];\n    return out;\n};\n\n/**\n * Sets a tri3 from an array at an option offset\n *\n * @param {tri3} out\n * @param {Array} arr\n * @param {number} [offset=0]\n * @returns {tri3} out\n */\n/**\n * Whether a triangle overlaps an axis-aligned box.\n *\n * A cheap reject only: it tests the box's three slabs and answers true whenever\n * no slab separates the triangle, so a triangle that straddles a corner without\n * touching the box still passes. Carbon uses it as the broad phase in front of\n * the oriented-box test (BoundingBox.cpp:569-588) and so should any caller.\n *\n * @param {tri3} a\n * @param {vec3} min\n * @param {vec3} max\n * @returns {boolean} false only when a slab separates the triangle\n */\ntri3.intersectsBounds = function(a, min, max)\n{\n    for (let axis = 0; axis < 3; axis++)\n    {\n        const lo = min[axis];\n        const hi = max[axis];\n\n        if (a[axis] < lo && a[axis + 3] < lo && a[axis + 6] < lo) return false;\n        if (a[axis] > hi && a[axis + 3] > hi && a[axis + 6] > hi) return false;\n    }\n\n    return true;\n};\n\n/**\n * Whether a triangle overlaps an oriented box, by separating-axis test.\n *\n * The box is given as the INVERSE of the transform that maps the unit box\n * (-1,-1,-1)..(1,1,1) onto it, so the triangle is moved into unit-box space and\n * tested there - which is why no box axes appear below.\n *\n * Ported from Carbon (BoundingBox.cpp:626-732) including the vertex pairs its\n * edge tests use. Those pairs are NOT the symmetric set a textbook\n * separating-axis test would pick, and two of them look like slips; they are\n * reproduced exactly because this decides which hull triangles a decal covers,\n * and a \"corrected\" test would silently disagree with the client about where a\n * decal reaches.\n *\n * @param {tri3} a\n * @param {mat4} invOrientedBox inverse of the box transform\n * @returns {boolean} true when no separating axis was found\n */\ntri3.intersectsOrientedBox = (function()\n{\n    const v = [ vec3.create(), vec3.create(), vec3.create() ];\n    const e = [ vec3.create(), vec3.create(), vec3.create() ];\n    const normal = vec3.create();\n    const vmin = vec3.create();\n    const vmax = vec3.create();\n\n    // Nine edge-cross axes, with Carbon's own vertex pairs. Built once: the\n    // vectors are stable across calls, and a decal tests every triangle of a\n    // hull against this.\n    //\n    // Each row is read positionally in the loop below, which is what the old\n    // destructuring form used to name:\n    //\n    //     [ edge, ax, bx, ay, by, az, bz ]\n    //\n    // one vertex pair per box axis: x at [1],[2], y at [3],[4], z at [5],[6].\n    const edgeAxes = [\n        [ e[0], v[0], v[2], v[0], v[2], v[1], v[2] ],\n        [ e[1], v[0], v[2], v[0], v[2], v[0], v[1] ],\n        [ e[2], v[0], v[1], v[0], v[1], v[1], v[2] ]\n    ];\n\n    // A separating plane at the cross product of a triangle edge and a unit-box\n    // axis. The box half-extent is 1 on every axis, so the radius is just\n    // |a| + |b| (Carbon's AxisTest, BoundingBox.cpp:601-611).\n    function axisTest(ca, cb, fa, fb, p, q, axis0, axis1)\n    {\n        let p0 = ca * p[axis0] + cb * p[axis1];\n        let p2 = ca * q[axis0] + cb * q[axis1];\n\n        if (p2 < p0)\n        {\n            const swap = p0;\n            p0 = p2;\n            p2 = swap;\n        }\n\n        const rad = fa + fb;\n\n        return !(p0 > rad || p2 < -rad);\n    }\n\n    return function(a, invOrientedBox)\n    {\n        for (let i = 0; i < 3; i++)\n        {\n            vec3.set(v[i], a[i * 3], a[i * 3 + 1], a[i * 3 + 2]);\n            vec3.transformMat4(v[i], v[i], invOrientedBox);\n        }\n\n        // The unit box's own six faces.\n        for (let axis = 0; axis < 3; axis++)\n        {\n            if (v[0][axis] < -1 && v[1][axis] < -1 && v[2][axis] < -1) return false;\n            if (v[0][axis] > 1 && v[1][axis] > 1 && v[2][axis] > 1) return false;\n        }\n\n        vec3.subtract(e[0], v[1], v[0]);\n        vec3.subtract(e[1], v[2], v[1]);\n        vec3.subtract(e[2], v[0], v[2]);\n\n        // The triangle's own plane.\n        vec3.cross(normal, e[0], e[1]);\n\n        for (let i = 0; i < 3; i++)\n        {\n            if (normal[i] > 0)\n            {\n                vmin[i] = -1 - v[0][i];\n                vmax[i] = 1 - v[0][i];\n            }\n            else\n            {\n                vmin[i] = 1 - v[0][i];\n                vmax[i] = -1 - v[0][i];\n            }\n        }\n\n        if (vec3.dot(vmin, normal) > 0) return false;\n        if (vec3.dot(vmax, normal) < 0) return false;\n\n        // An indexed loop, NOT `for...of` with destructuring. A decal runs this\n        // over every triangle of a hull, so this is the hottest loop in the file,\n        // and that form costs an array iterator plus a seven-way destructure on\n        // every call. The rows are read positionally below for the same reason.\n        for (let axis = 0; axis < edgeAxes.length; axis++)\n        {\n            const row = edgeAxes[axis];\n            const edge = row[0];\n            const fex = Math.abs(edge[0]);\n            const fey = Math.abs(edge[1]);\n            const fez = Math.abs(edge[2]);\n\n            if (!axisTest(edge[2], -edge[1], fez, fey, row[1], row[2], 1, 2)) return false;\n            if (!axisTest(-edge[2], edge[0], fez, fex, row[3], row[4], 0, 2)) return false;\n            if (!axisTest(edge[1], -edge[0], fey, fex, row[5], row[6], 0, 1)) return false;\n        }\n\n        return true;\n    };\n})();\n\ntri3.fromArray = mat3.fromArray;\n\n/**\n * Gets bary centric coordinates\n *\n * @author three.js (converted)\n * @param {vec3} out\n * @param {tri3} a\n * @param {vec3} point\n * @returns {tri3} out\n */\ntri3.getBaryCentricCoordinates = function(out, a, point)\n{\n    let ax = a[6] - a[0],\n        ay = a[7] - a[1],\n        az = a[8] - a[2],\n\n        bx = a[3] - a[0],\n        by = a[4] - a[1],\n        bz = a[5] - a[2],\n\n        cx = point[0] - a[0],\n        cy = point[1] - a[1],\n        cz = point[2] - a[2];\n\n    let dot00 = ax * ax + ay * ay + az * az,\n        dot01 = ax * bx + ay * by + az * bz,\n        dot02 = ax * cx + ay * cy + az * cz,\n        dot11 = bx * bx + by * by + bz * bz,\n        dot12 = bx * cx + by * cy + bz * cz;\n\n    let denom = (dot00 * dot11 - dot01 * dot01);\n\n    if (denom === 0)\n    {\n        out[0] = -2;\n        out[1] = -1;\n        out[2] = -1;\n        throw new Error(\"Denominator error\");\n    }\n    else\n    {\n        let invDenom = 1 / denom;\n        let u = (dot11 * dot02 - dot01 * dot12) * invDenom;\n        let v = (dot00 * dot12 - dot01 * dot02) * invDenom;\n        out[0] = 1 - u - v;\n        out[1] = v;\n        out[2] = u;\n    }\n    return out;\n};\n\n/**\n *\n * @author three.js (converted)\n * @param {lne3} out\n * @param {tri3} a\n * @param {vec3} point\n * @returns {*}\n */\ntri3.getClosestEdgeToPoint = (function()\n{\n    let v0, v1, edgeList;\n\n    return function getClosestEdgeToPoint(out, a, point, debug)\n    {\n        if (!v0)\n        {\n            v0 = vec3.create();\n            v1 = vec3.create();\n            edgeList = [ lne3.create(), lne3.create(), lne3.create() ];\n        }\n\n        // Get the closest point on the triangle to the supplied point\n        let closestPointOnTriangle = tri3.getClosestPointToPoint(v0, a, point);\n\n        // Convert the triangle's vertices to edges\n        lne3.set(edgeList[0], a[0], a[1], a[2], a[3], a[4], a[5]); // vert a - vert b\n        lne3.set(edgeList[1], a[3], a[4], a[5], a[6], a[7], a[8]); // vert b - vert c\n        lne3.set(edgeList[2], a[6], a[7], a[8], a[0], a[1], a[2]); // vert c - vert a\n\n        let minDistance = Infinity,\n            edgeIndex;\n\n        for (let i = 0; i < edgeList.length; i++)\n        {\n            // Get the closest point on the triangles edge to the closest point on the triangle to the supplied point\n            let closestPointOnLine = lne3.getClosestPointToPoint(v1, edgeList[i], closestPointOnTriangle, true);\n            let distance = vec3.squaredDistance(closestPointOnLine, closestPointOnTriangle);\n            if (distance < minDistance)\n            {\n                minDistance = distance;\n                out[0] = edgeList[i][0];\n                out[1] = edgeList[i][1];\n                out[2] = edgeList[i][2];\n                out[3] = edgeList[i][3];\n                out[4] = edgeList[i][4];\n                out[5] = edgeList[i][5];\n                edgeIndex = i;\n            }\n        }\n\n        // Temporary\n        if (debug)\n        {\n            switch(edgeIndex)\n            {\n                case 0:\n                    debug.edgeStart = 0;\n                    debug.edgeEnd = 1;\n                    break;\n\n                case 1:\n                    debug.edgeStart = 1;\n                    debug.edgeEnd = 2;\n                    break;\n\n                default:\n                    debug.edgeStart = 2;\n                    debug.edgeEnd = 0;\n                    break;\n            }\n        }\n\n        return out;\n    };\n})();\n\n/**\n * Gets the closest point on a triangle to another point\n *\n * @author three.js (converted)\n * @param {vec3} out      - receiving vec3\n * @param {vec3} a        - tri3 to operate on\n * @param {vec3} point    - the point\n * @returns {vec3} vecOut - receiving vec3\n */\ntri3.getClosestPointToPoint = (function()\n{\n    let plane, edgeList, projectedPoint, closestPoint, vec3_0, vec3_1, vec3_2;\n\n    return function getClosestPointToPoint(out, a, point)\n    {\n        if (!plane)\n        {\n            plane = pln.create();\n            edgeList = [ lne3.create(), lne3.create(), lne3.create() ];\n            projectedPoint = vec3.create();\n            closestPoint = vec3.create();\n            vec3_0 = vec3.create();\n            vec3_1 = vec3.create();\n            vec3_2 = vec3.create();\n        }\n\n        // Replace with subarray tri3.v1 .v2 .v3 ?\n        tri3.getV1(vec3_0, a);\n        tri3.getV2(vec3_1, a);\n        tri3.getV3(vec3_2, a);\n\n        // project the point onto the plane of the triangle\n        pln.fromCoplanarPoints(plane, vec3_0, vec3_1, vec3_2);\n        pln.getProjectedPoint(projectedPoint, plane, point);\n\n        // check if the projection lies within the triangle\n        if (tri3.contains(a, projectedPoint) === true)\n        {\n            out[0] = projectedPoint[0];\n            out[1] = projectedPoint[1];\n            out[2] = projectedPoint[2];\n        }\n        // if not, the point falls outside the triangle.\n        // the result is the closest point to the triangle's edges or vertices\n        else\n        {\n            lne3.set(edgeList[0], a[0], a[1], a[2], a[3], a[4], a[5]);\n            lne3.set(edgeList[1], a[3], a[4], a[5], a[6], a[7], a[8]);\n            lne3.set(edgeList[2], a[6], a[7], a[8], a[0], a[1], a[2]);\n\n            let minDistance = Infinity;\n            for (let i = 0; i < edgeList.length; i++)\n            {\n                lne3.getClosestPointToPoint(closestPoint, edgeList[i], projectedPoint, true);\n                let distance = vec3.squaredDistance(projectedPoint, closestPoint);\n                if (distance < minDistance)\n                {\n                    minDistance = distance;\n                    out[0] = closestPoint[0];\n                    out[1] = closestPoint[1];\n                    out[2] = closestPoint[2];\n                }\n            }\n        }\n        return out;\n    };\n})();\n\n/**\n * Gets the closest vertex to a given point\n *\n * @param {vec3} out\n * @param {tri3} a\n * @param {vec3} point\n * @returns {vec3} out\n */\ntri3.getClosestVertexToPoint = (function()\n{\n    let vec3_0, vec3_1, vec3_2;\n\n    return function(out, a, point, debug)\n    {\n        if (!vec3_0)\n        {\n            vec3_0 = vec3.create();\n            vec3_1 = vec3.create();\n            vec3_2 = vec3.create();\n        }\n\n        // Get the closest point on the triangle to the supplied point\n        tri3.getClosestPointToPoint(out, a, point);\n\n        let minDistance = Infinity,\n            distance,\n            x, y, z,\n            vertices = [\n                tri3.getV1(vec3_0, a),\n                tri3.getV2(vec3_1, a),\n                tri3.getV3(vec3_2, a)\n            ];\n\n        let foundIndex;\n        // Find the closest triangle vertex\n        for (let i = 0; i < vertices.length; i++)\n        {\n            distance = vec3.squaredDistance(vertices[i], out);\n            if (distance < minDistance)\n            {\n                minDistance = distance;\n                x = vertices[i][0];\n                y = vertices[i][1];\n                z = vertices[i][2];\n                foundIndex = i;\n            }\n        }\n\n        if (debug) debug.closest = foundIndex;\n\n        out[0] = x;\n        out[1] = y;\n        out[2] = z;\n        return out;\n    };\n})();\n\n/**\n * Sets a vec3 as the midpoint of a triangle\n *\n * @param {vec3} out    - receiving vec3\n * @param {tri3} a      - tri3 to get the midpoint of         -\n * @returns {vec3} out  - receiving vec3\n */\ntri3.getMidpoint = function(out, a)\n{\n    let s = 1 / 3;\n    out[0] = (a[0] + a[3] + a[6]) * s;\n    out[1] = (a[1] + a[4] + a[7]) * s;\n    out[2] = (a[2] + a[5] + a[8]) * s;\n    return out;\n};\n\nlet tri3_0 = null;\n\n/**\n * Gets normal vertices\n *\n * @param {vec3} out\n * @param {vec3} v1\n * @param {vec3} v2\n * @param {vec3} v3\n * @return {vec3} out\n */\ntri3.getNormalFromVertices =  function(out, v1, v2, v3)\n{\n    if (!tri3_0) tri3_0 = tri3.create();\n    tri3.fromVertices(tri3_0, v1, v2, v3);\n    return tri3.getNormal(out, tri3_0);\n};\n\n/**\n * Gets a triangle's normal\n *\n * @param {vec3} out\n * @param {tri3} a\n * @returns {vec3} out\n */\ntri3.getNormal = function(out, a)\n{\n    let ax = a[6] - a[3],\n        ay = a[7] - a[4],\n        az = a[8] - a[5],\n        bx = a[0] - a[3],\n        by = a[1] - a[4],\n        bz = a[2] - a[5];\n\n    // Get cross product\n    let x = ay * bz - az * by,\n        y = az * bx - ax * bz,\n        z = ax * by - ay * bx;\n\n    // Normalize\n    let len = x * x + y * y + z * z;\n    if (len > 0)\n    {\n        len = 1 / Math.sqrt(len);\n        out[0] = x * len;\n        out[1] = y * len;\n        out[2] = z * len;\n    }\n    else\n    {\n        out[0] = 0;\n        out[1] = 0;\n        out[2] = 0;\n        throw new Error(\"Normalization error\");\n    }\n    return out;\n};\n\n/**\n * Sets a vec3 with the tri3's first vert\n *\n * @param {vec3} out     - receiving vec3\n * @param {tri3} a       - source tri3\n * @returns {vec3} [out] - receiving vec3\n */\ntri3.getV1 = lne3.getStart;\n\n/**\n * Sets a vec3 with the tri3's second vert\n *\n * @param {vec3} out     - receiving vec3\n * @param {tri3} a       - source tri3\n * @returns {vec3} [out] - receiving vec3\n */\ntri3.getV2 = lne3.getEnd;\n\n/**\n * Sets a vec3 with the tri3's third vert\n *\n * @param {vec3} out     - receiving vec3\n * @param {tri3} v       - source tri3\n * @returns {vec3} [out] - receiving vec3\n */\ntri3.getV3 = function(out, v)\n{\n    out[0] = v[6];\n    out[1] = v[7];\n    out[2] = v[8];\n    return out;\n};\n\n/**\n * Sets the first position of a triangle\n * @param {tri3} out\n * @param {vec3} v\n * @returns {tri3} out\n */\ntri3.setV1 = lne3.setStart;\n\n/**\n * Sets the second position of a triangle\n * @param {tri3} out\n * @param {vec3} v\n * @returns {tri3} out\n */\ntri3.setV2 = lne3.setEnd;\n\n/**\n * Sets the second position of a triangle\n * @param {tri3} out\n * @param {vec3} v\n * @returns {tri3} out\n */\ntri3.setV3 = function(out, v)\n{\n    out[6] = v[0];\n    out[7] = v[1];\n    out[8] = v[2];\n    return out;\n};\n\n/**\n * Sets an array at an optional offset\n *\n * @param {mat3} a\n * @param {Array} arr\n * @param {number} [index=0]\n * @returns {mat3} a\n */\ntri3.toArray = mat3.toArray;\n\n/**\n * Extracts the vertices of a tri3\n *\n * @param {tri3} a\n * @param {vec3} v1\n * @param {vec3} v2\n * @param {vec3} v3\n */\ntri3.toVertices = function(a, v1, v2, v3)\n{\n    v1[0] = a[0];\n    v1[1] = a[1];\n    v1[2] = a[2];\n    v2[0] = a[3];\n    v2[1] = a[4];\n    v2[2] = a[5];\n    v3[0] = a[6];\n    v3[1] = a[7];\n    v3[2] = a[8];\n    return a;\n};\n\nlet vec3_0, vec3_1, vec3_2;\n\n/**\n * Transforms a tri3 by a mat4\n * TODO: Optimize\n * @param {tri3} out\n * @param {tri3} a\n * @param {mat4} m\n * @return {tri3}\n */\ntri3.transformMat4 = function(out, a, m)\n{\n    if (!vec3_0)\n    {\n        vec3_0 = vec3.create();\n        vec3_1 = vec3.create();\n        vec3_2 = vec3.create();\n    }\n\n    tri3.getV1(vec3_0, a);\n    tri3.getV2(vec3_1, a);\n    tri3.getV3(vec3_2, a);\n\n    vec3.transformMat4(vec3_0, vec3_0, m);\n    vec3.transformMat4(vec3_1, vec3_1, m);\n    vec3.transformMat4(vec3_2, vec3_2, m);\n\n    return tri3.fromVertices(out, vec3_0, vec3_1, vec3_2);\n};\n\nexport const {\n    alloc,\n    unalloc,\n    $v1,\n    $v2,\n    $v3,\n    area,\n    create,\n    clone,\n    contains,\n    copy,\n    fromVertices,\n    fromArray,\n    getBaryCentricCoordinates,\n    getClosestEdgeToPoint,\n    getClosestPointToPoint,\n    getClosestVertexToPoint,\n    getMidpoint,\n    getNormalFromVertices,\n    getNormal,\n    getV1,\n    intersectsBounds,\n    intersectsOrientedBox,\n    getV2,\n    getV3,\n    setV1,\n    setV2,\n    setV3,\n    toArray,\n    toVertices,\n    transformMat4\n} = tri3;\n\n"],"names":["tri3","alloc","pool","allocF32","unalloc","a","freeType","$v1","lne3","$start","$v2","$end","$v3","subarray","area","ax","ay","az","bx","by","bz","x","y","z","Math","sqrt","create","out","Float32Array","clone","mat3","contains","vec3_0","point","vec3","getBaryCentricCoordinates","copy","fromVertices","v1","v2","v3","intersectsBounds","min","max","axis","lo","hi","intersectsOrientedBox","v","e","normal","vmin","vmax","edgeAxes","axisTest","ca","cb","fa","fb","p","q","axis0","axis1","p0","p2","swap","rad","invOrientedBox","i","set","transformMat4","subtract","cross","dot","length","row","edge","fex","abs","fey","fez","fromArray","cx","cy","cz","dot00","dot01","dot02","dot11","dot12","denom","Error","invDenom","u","getClosestEdgeToPoint","v0","edgeList","debug","closestPointOnTriangle","getClosestPointToPoint","minDistance","Infinity","edgeIndex","closestPointOnLine","distance","squaredDistance","edgeStart","edgeEnd","plane","projectedPoint","closestPoint","vec3_1","vec3_2","pln","getV1","getV2","getV3","fromCoplanarPoints","getProjectedPoint","getClosestVertexToPoint","vertices","foundIndex","closest","getMidpoint","s","tri3_0","getNormalFromVertices","getNormal","len","getStart","getEnd","setV1","setStart","setV2","setEnd","setV3","toArray","toVertices","m"],"mappings":";;;;;;AAMA;AACA;AACA;AACA;AACA;;AAEO,MAAMA,IAAI,GAAG;;AAEpB;AACA;AACA;AACA;AACAA,IAAI,CAACC,KAAK,GAAG,YACb;AACI,EAAA,OAAOC,IAAI,CAACC,QAAQ,CAAC,CAAC,CAAC;AAC3B,CAAC;;AAED;AACA;AACA;AACA;AACAH,IAAI,CAACI,OAAO,GAAG,UAASC,CAAC,EACzB;AACIH,EAAAA,IAAI,CAACI,QAAQ,CAACD,CAAC,CAAC;AACpB,CAAC;;AAED;AACA;AACA;AACA;AACA;AACA;AACAL,IAAI,CAACO,GAAG,GAAGC,IAAI,CAACC,MAAM;;AAEtB;AACA;AACA;AACA;AACA;AACA;AACAT,IAAI,CAACU,GAAG,GAAGF,IAAI,CAACG,IAAI;;AAEpB;AACA;AACA;AACA;AACA;AACA;AACAX,IAAI,CAACY,GAAG,GAAG,UAASP,CAAC,EACrB;AACI,EAAA,OAAOA,CAAC,CAACQ,QAAQ,CAAC,CAAC,EAAE,CAAC,CAAC;AAC3B,CAAC;;AAED;AACA;AACA;AACA;AACA;AACA;AACAb,IAAI,CAACc,IAAI,GAAG,UAAST,CAAC,EACtB;EACI,IAAIU,EAAE,GAAGV,CAAC,CAAC,CAAC,CAAC,GAAGA,CAAC,CAAC,CAAC,CAAC;IAChBW,EAAE,GAAGX,CAAC,CAAC,CAAC,CAAC,GAAGA,CAAC,CAAC,CAAC,CAAC;IAChBY,EAAE,GAAGZ,CAAC,CAAC,CAAC,CAAC,GAAGA,CAAC,CAAC,CAAC,CAAC;IAChBa,EAAE,GAAGb,CAAC,CAAC,CAAC,CAAC,GAAGA,CAAC,CAAC,CAAC,CAAC;IAChBc,EAAE,GAAGd,CAAC,CAAC,CAAC,CAAC,GAAGA,CAAC,CAAC,CAAC,CAAC;IAChBe,EAAE,GAAGf,CAAC,CAAC,CAAC,CAAC,GAAGA,CAAC,CAAC,CAAC,CAAC;AACpB;EACA,IAAIgB,CAAC,GAAGL,EAAE,GAAGI,EAAE,GAAGH,EAAE,GAAGE,EAAE;AACrBG,IAAAA,CAAC,GAAGL,EAAE,GAAGC,EAAE,GAAGH,EAAE,GAAGK,EAAE;AACrBG,IAAAA,CAAC,GAAGR,EAAE,GAAGI,EAAE,GAAGH,EAAE,GAAGE,EAAE;AACzB;AACA,EAAA,OAAOM,IAAI,CAACC,IAAI,CAACJ,CAAC,GAAGA,CAAC,GAAGC,CAAC,GAAGA,CAAC,GAAGC,CAAC,GAAGA,CAAC,CAAC,GAAG,GAAG;AACjD,CAAC;;AAED;AACA;AACA;AACA;AACA;AACAvB,IAAI,CAAC0B,MAAM,GAAG,YACd;AACI,EAAA,IAAIC,GAAG,GAAG,IAAIC,YAAY,CAAC,CAAC,CAAC;AAC7BD,EAAAA,GAAG,CAAC,CAAC,CAAC,GAAG,CAAC;AACVA,EAAAA,GAAG,CAAC,CAAC,CAAC,GAAG,CAAC;AACVA,EAAAA,GAAG,CAAC,CAAC,CAAC,GAAG,CAAC;AACVA,EAAAA,GAAG,CAAC,CAAC,CAAC,GAAG,CAAC;AACVA,EAAAA,GAAG,CAAC,CAAC,CAAC,GAAG,CAAC;AACVA,EAAAA,GAAG,CAAC,CAAC,CAAC,GAAG,CAAC;AACVA,EAAAA,GAAG,CAAC,CAAC,CAAC,GAAG,CAAC;AACVA,EAAAA,GAAG,CAAC,CAAC,CAAC,GAAG,CAAC;AACVA,EAAAA,GAAG,CAAC,CAAC,CAAC,GAAG,CAAC;AACV,EAAA,OAAOA,GAAG;AACd,CAAC;;AAED;AACA;AACA;AACA;AACA;AACA;AACA3B,IAAI,CAAC6B,KAAK,GAAGC,IAAI,CAACD,KAAK;;AAEvB;AACA;AACA;AACA;AACA;AACA;AACA;AACA7B,IAAI,CAAC+B,QAAQ,GAAI,YACjB;AACI,EAAA,IAAIC,MAAM;AACV,EAAA,OAAO,UAAS3B,CAAC,EAAE4B,KAAK,EACxB;IACI,IAAI,CAACD,MAAM,EAAEA,MAAM,GAAGE,IAAI,CAACR,MAAM,EAAE;IACnC1B,IAAI,CAACmC,yBAAyB,CAACH,MAAM,EAAE3B,CAAC,EAAE4B,KAAK,CAAC;IAChD,OAAQD,MAAM,CAAC,CAAC,CAAC,IAAI,CAAC,IAAMA,MAAM,CAAC,CAAC,CAAC,IAAI,CAAE,IAAMA,MAAM,CAAC,CAAC,CAAC,GAAGA,MAAM,CAAC,CAAC,CAAC,IAAK,CAAE;EACjF,CAAC;AACL,CAAC,EAAG;;AAEJ;AACA;AACA;AACA;AACA;AACA;AACA;AACAhC,IAAI,CAACoC,IAAI,GAAGN,IAAI,CAACM,IAAI;;AAErB;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACApC,IAAI,CAACqC,YAAY,GAAG,UAASV,GAAG,EAAEW,EAAE,EAAEC,EAAE,EAAEC,EAAE,EAC5C;AACIb,EAAAA,GAAG,CAAC,CAAC,CAAC,GAAGW,EAAE,CAAC,CAAC,CAAC;AACdX,EAAAA,GAAG,CAAC,CAAC,CAAC,GAAGW,EAAE,CAAC,CAAC,CAAC;AACdX,EAAAA,GAAG,CAAC,CAAC,CAAC,GAAGW,EAAE,CAAC,CAAC,CAAC;AACdX,EAAAA,GAAG,CAAC,CAAC,CAAC,GAAGY,EAAE,CAAC,CAAC,CAAC;AACdZ,EAAAA,GAAG,CAAC,CAAC,CAAC,GAAGY,EAAE,CAAC,CAAC,CAAC;AACdZ,EAAAA,GAAG,CAAC,CAAC,CAAC,GAAGY,EAAE,CAAC,CAAC,CAAC;AACdZ,EAAAA,GAAG,CAAC,CAAC,CAAC,GAAGa,EAAE,CAAC,CAAC,CAAC;AACdb,EAAAA,GAAG,CAAC,CAAC,CAAC,GAAGa,EAAE,CAAC,CAAC,CAAC;AACdb,EAAAA,GAAG,CAAC,CAAC,CAAC,GAAGa,EAAE,CAAC,CAAC,CAAC;AACd,EAAA,OAAOb,GAAG;AACd,CAAC;;AAED;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA3B,IAAI,CAACyC,gBAAgB,GAAG,UAASpC,CAAC,EAAEqC,GAAG,EAAEC,GAAG,EAC5C;EACI,KAAK,IAAIC,IAAI,GAAG,CAAC,EAAEA,IAAI,GAAG,CAAC,EAAEA,IAAI,EAAE,EACnC;AACI,IAAA,MAAMC,EAAE,GAAGH,GAAG,CAACE,IAAI,CAAC;AACpB,IAAA,MAAME,EAAE,GAAGH,GAAG,CAACC,IAAI,CAAC;IAEpB,IAAIvC,CAAC,CAACuC,IAAI,CAAC,GAAGC,EAAE,IAAIxC,CAAC,CAACuC,IAAI,GAAG,CAAC,CAAC,GAAGC,EAAE,IAAIxC,CAAC,CAACuC,IAAI,GAAG,CAAC,CAAC,GAAGC,EAAE,EAAE,OAAO,KAAK;IACtE,IAAIxC,CAAC,CAACuC,IAAI,CAAC,GAAGE,EAAE,IAAIzC,CAAC,CAACuC,IAAI,GAAG,CAAC,CAAC,GAAGE,EAAE,IAAIzC,CAAC,CAACuC,IAAI,GAAG,CAAC,CAAC,GAAGE,EAAE,EAAE,OAAO,KAAK;AAC1E,EAAA;AAEA,EAAA,OAAO,IAAI;AACf,CAAC;;AAED;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA9C,IAAI,CAAC+C,qBAAqB,GAAI,YAC9B;EACI,MAAMC,CAAC,GAAG,CAAEd,IAAI,CAACR,MAAM,EAAE,EAAEQ,IAAI,CAACR,MAAM,EAAE,EAAEQ,IAAI,CAACR,MAAM,EAAE,CAAE;EACzD,MAAMuB,CAAC,GAAG,CAAEf,IAAI,CAACR,MAAM,EAAE,EAAEQ,IAAI,CAACR,MAAM,EAAE,EAAEQ,IAAI,CAACR,MAAM,EAAE,CAAE;AACzD,EAAA,MAAMwB,MAAM,GAAGhB,IAAI,CAACR,MAAM,EAAE;AAC5B,EAAA,MAAMyB,IAAI,GAAGjB,IAAI,CAACR,MAAM,EAAE;AAC1B,EAAA,MAAM0B,IAAI,GAAGlB,IAAI,CAACR,MAAM,EAAE;;AAE1B;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;EACA,MAAM2B,QAAQ,GAAG,CACb,CAAEJ,CAAC,CAAC,CAAC,CAAC,EAAED,CAAC,CAAC,CAAC,CAAC,EAAEA,CAAC,CAAC,CAAC,CAAC,EAAEA,CAAC,CAAC,CAAC,CAAC,EAAEA,CAAC,CAAC,CAAC,CAAC,EAAEA,CAAC,CAAC,CAAC,CAAC,EAAEA,CAAC,CAAC,CAAC,CAAC,CAAE,EAC5C,CAAEC,CAAC,CAAC,CAAC,CAAC,EAAED,CAAC,CAAC,CAAC,CAAC,EAAEA,CAAC,CAAC,CAAC,CAAC,EAAEA,CAAC,CAAC,CAAC,CAAC,EAAEA,CAAC,CAAC,CAAC,CAAC,EAAEA,CAAC,CAAC,CAAC,CAAC,EAAEA,CAAC,CAAC,CAAC,CAAC,CAAE,EAC5C,CAAEC,CAAC,CAAC,CAAC,CAAC,EAAED,CAAC,CAAC,CAAC,CAAC,EAAEA,CAAC,CAAC,CAAC,CAAC,EAAEA,CAAC,CAAC,CAAC,CAAC,EAAEA,CAAC,CAAC,CAAC,CAAC,EAAEA,CAAC,CAAC,CAAC,CAAC,EAAEA,CAAC,CAAC,CAAC,CAAC,CAAE,CAC/C;;AAED;AACA;AACA;AACA,EAAA,SAASM,QAAQA,CAACC,EAAE,EAAEC,EAAE,EAAEC,EAAE,EAAEC,EAAE,EAAEC,CAAC,EAAEC,CAAC,EAAEC,KAAK,EAAEC,KAAK,EACpD;AACI,IAAA,IAAIC,EAAE,GAAGR,EAAE,GAAGI,CAAC,CAACE,KAAK,CAAC,GAAGL,EAAE,GAAGG,CAAC,CAACG,KAAK,CAAC;AACtC,IAAA,IAAIE,EAAE,GAAGT,EAAE,GAAGK,CAAC,CAACC,KAAK,CAAC,GAAGL,EAAE,GAAGI,CAAC,CAACE,KAAK,CAAC;IAEtC,IAAIE,EAAE,GAAGD,EAAE,EACX;MACI,MAAME,IAAI,GAAGF,EAAE;AACfA,MAAAA,EAAE,GAAGC,EAAE;AACPA,MAAAA,EAAE,GAAGC,IAAI;AACb,IAAA;AAEA,IAAA,MAAMC,GAAG,GAAGT,EAAE,GAAGC,EAAE;IAEnB,OAAO,EAAEK,EAAE,GAAGG,GAAG,IAAIF,EAAE,GAAG,CAACE,GAAG,CAAC;AACnC,EAAA;AAEA,EAAA,OAAO,UAAS7D,CAAC,EAAE8D,cAAc,EACjC;IACI,KAAK,IAAIC,CAAC,GAAG,CAAC,EAAEA,CAAC,GAAG,CAAC,EAAEA,CAAC,EAAE,EAC1B;AACIlC,MAAAA,IAAI,CAACmC,GAAG,CAACrB,CAAC,CAACoB,CAAC,CAAC,EAAE/D,CAAC,CAAC+D,CAAC,GAAG,CAAC,CAAC,EAAE/D,CAAC,CAAC+D,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC,EAAE/D,CAAC,CAAC+D,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC,CAAC;AACpDlC,MAAAA,IAAI,CAACoC,aAAa,CAACtB,CAAC,CAACoB,CAAC,CAAC,EAAEpB,CAAC,CAACoB,CAAC,CAAC,EAAED,cAAc,CAAC;AAClD,IAAA;;AAEA;IACA,KAAK,IAAIvB,IAAI,GAAG,CAAC,EAAEA,IAAI,GAAG,CAAC,EAAEA,IAAI,EAAE,EACnC;AACI,MAAA,IAAII,CAAC,CAAC,CAAC,CAAC,CAACJ,IAAI,CAAC,GAAG,EAAE,IAAII,CAAC,CAAC,CAAC,CAAC,CAACJ,IAAI,CAAC,GAAG,EAAE,IAAII,CAAC,CAAC,CAAC,CAAC,CAACJ,IAAI,CAAC,GAAG,EAAE,EAAE,OAAO,KAAK;AACvE,MAAA,IAAII,CAAC,CAAC,CAAC,CAAC,CAACJ,IAAI,CAAC,GAAG,CAAC,IAAII,CAAC,CAAC,CAAC,CAAC,CAACJ,IAAI,CAAC,GAAG,CAAC,IAAII,CAAC,CAAC,CAAC,CAAC,CAACJ,IAAI,CAAC,GAAG,CAAC,EAAE,OAAO,KAAK;AACxE,IAAA;AAEAV,IAAAA,IAAI,CAACqC,QAAQ,CAACtB,CAAC,CAAC,CAAC,CAAC,EAAED,CAAC,CAAC,CAAC,CAAC,EAAEA,CAAC,CAAC,CAAC,CAAC,CAAC;AAC/Bd,IAAAA,IAAI,CAACqC,QAAQ,CAACtB,CAAC,CAAC,CAAC,CAAC,EAAED,CAAC,CAAC,CAAC,CAAC,EAAEA,CAAC,CAAC,CAAC,CAAC,CAAC;AAC/Bd,IAAAA,IAAI,CAACqC,QAAQ,CAACtB,CAAC,CAAC,CAAC,CAAC,EAAED,CAAC,CAAC,CAAC,CAAC,EAAEA,CAAC,CAAC,CAAC,CAAC,CAAC;;AAE/B;AACAd,IAAAA,IAAI,CAACsC,KAAK,CAACtB,MAAM,EAAED,CAAC,CAAC,CAAC,CAAC,EAAEA,CAAC,CAAC,CAAC,CAAC,CAAC;IAE9B,KAAK,IAAImB,CAAC,GAAG,CAAC,EAAEA,CAAC,GAAG,CAAC,EAAEA,CAAC,EAAE,EAC1B;AACI,MAAA,IAAIlB,MAAM,CAACkB,CAAC,CAAC,GAAG,CAAC,EACjB;AACIjB,QAAAA,IAAI,CAACiB,CAAC,CAAC,GAAG,EAAE,GAAGpB,CAAC,CAAC,CAAC,CAAC,CAACoB,CAAC,CAAC;AACtBhB,QAAAA,IAAI,CAACgB,CAAC,CAAC,GAAG,CAAC,GAAGpB,CAAC,CAAC,CAAC,CAAC,CAACoB,CAAC,CAAC;AACzB,MAAA,CAAC,MAED;AACIjB,QAAAA,IAAI,CAACiB,CAAC,CAAC,GAAG,CAAC,GAAGpB,CAAC,CAAC,CAAC,CAAC,CAACoB,CAAC,CAAC;AACrBhB,QAAAA,IAAI,CAACgB,CAAC,CAAC,GAAG,EAAE,GAAGpB,CAAC,CAAC,CAAC,CAAC,CAACoB,CAAC,CAAC;AAC1B,MAAA;AACJ,IAAA;AAEA,IAAA,IAAIlC,IAAI,CAACuC,GAAG,CAACtB,IAAI,EAAED,MAAM,CAAC,GAAG,CAAC,EAAE,OAAO,KAAK;AAC5C,IAAA,IAAIhB,IAAI,CAACuC,GAAG,CAACrB,IAAI,EAAEF,MAAM,CAAC,GAAG,CAAC,EAAE,OAAO,KAAK;;AAE5C;AACA;AACA;AACA;AACA,IAAA,KAAK,IAAIN,IAAI,GAAG,CAAC,EAAEA,IAAI,GAAGS,QAAQ,CAACqB,MAAM,EAAE9B,IAAI,EAAE,EACjD;AACI,MAAA,MAAM+B,GAAG,GAAGtB,QAAQ,CAACT,IAAI,CAAC;AAC1B,MAAA,MAAMgC,IAAI,GAAGD,GAAG,CAAC,CAAC,CAAC;MACnB,MAAME,GAAG,GAAGrD,IAAI,CAACsD,GAAG,CAACF,IAAI,CAAC,CAAC,CAAC,CAAC;MAC7B,MAAMG,GAAG,GAAGvD,IAAI,CAACsD,GAAG,CAACF,IAAI,CAAC,CAAC,CAAC,CAAC;MAC7B,MAAMI,GAAG,GAAGxD,IAAI,CAACsD,GAAG,CAACF,IAAI,CAAC,CAAC,CAAC,CAAC;AAE7B,MAAA,IAAI,CAACtB,QAAQ,CAACsB,IAAI,CAAC,CAAC,CAAC,EAAE,CAACA,IAAI,CAAC,CAAC,CAAC,EAAEI,GAAG,EAAED,GAAG,EAAEJ,GAAG,CAAC,CAAC,CAAC,EAAEA,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,EAAE,OAAO,KAAK;AAC9E,MAAA,IAAI,CAACrB,QAAQ,CAAC,CAACsB,IAAI,CAAC,CAAC,CAAC,EAAEA,IAAI,CAAC,CAAC,CAAC,EAAEI,GAAG,EAAEH,GAAG,EAAEF,GAAG,CAAC,CAAC,CAAC,EAAEA,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,EAAE,OAAO,KAAK;AAC9E,MAAA,IAAI,CAACrB,QAAQ,CAACsB,IAAI,CAAC,CAAC,CAAC,EAAE,CAACA,IAAI,CAAC,CAAC,CAAC,EAAEG,GAAG,EAAEF,GAAG,EAAEF,GAAG,CAAC,CAAC,CAAC,EAAEA,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,EAAE,OAAO,KAAK;AAClF,IAAA;AAEA,IAAA,OAAO,IAAI;EACf,CAAC;AACL,CAAC,EAAG;AAEJ3E,IAAI,CAACiF,SAAS,GAAGnD,IAAI,CAACmD,SAAS;;AAE/B;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACAjF,IAAI,CAACmC,yBAAyB,GAAG,UAASR,GAAG,EAAEtB,CAAC,EAAE4B,KAAK,EACvD;EACI,IAAIlB,EAAE,GAAGV,CAAC,CAAC,CAAC,CAAC,GAAGA,CAAC,CAAC,CAAC,CAAC;IAChBW,EAAE,GAAGX,CAAC,CAAC,CAAC,CAAC,GAAGA,CAAC,CAAC,CAAC,CAAC;IAChBY,EAAE,GAAGZ,CAAC,CAAC,CAAC,CAAC,GAAGA,CAAC,CAAC,CAAC,CAAC;IAEhBa,EAAE,GAAGb,CAAC,CAAC,CAAC,CAAC,GAAGA,CAAC,CAAC,CAAC,CAAC;IAChBc,EAAE,GAAGd,CAAC,CAAC,CAAC,CAAC,GAAGA,CAAC,CAAC,CAAC,CAAC;IAChBe,EAAE,GAAGf,CAAC,CAAC,CAAC,CAAC,GAAGA,CAAC,CAAC,CAAC,CAAC;IAEhB6E,EAAE,GAAGjD,KAAK,CAAC,CAAC,CAAC,GAAG5B,CAAC,CAAC,CAAC,CAAC;IACpB8E,EAAE,GAAGlD,KAAK,CAAC,CAAC,CAAC,GAAG5B,CAAC,CAAC,CAAC,CAAC;IACpB+E,EAAE,GAAGnD,KAAK,CAAC,CAAC,CAAC,GAAG5B,CAAC,CAAC,CAAC,CAAC;AAExB,EAAA,IAAIgF,KAAK,GAAGtE,EAAE,GAAGA,EAAE,GAAGC,EAAE,GAAGA,EAAE,GAAGC,EAAE,GAAGA,EAAE;IACnCqE,KAAK,GAAGvE,EAAE,GAAGG,EAAE,GAAGF,EAAE,GAAGG,EAAE,GAAGF,EAAE,GAAGG,EAAE;IACnCmE,KAAK,GAAGxE,EAAE,GAAGmE,EAAE,GAAGlE,EAAE,GAAGmE,EAAE,GAAGlE,EAAE,GAAGmE,EAAE;IACnCI,KAAK,GAAGtE,EAAE,GAAGA,EAAE,GAAGC,EAAE,GAAGA,EAAE,GAAGC,EAAE,GAAGA,EAAE;IACnCqE,KAAK,GAAGvE,EAAE,GAAGgE,EAAE,GAAG/D,EAAE,GAAGgE,EAAE,GAAG/D,EAAE,GAAGgE,EAAE;EAEvC,IAAIM,KAAK,GAAIL,KAAK,GAAGG,KAAK,GAAGF,KAAK,GAAGA,KAAM;EAE3C,IAAII,KAAK,KAAK,CAAC,EACf;AACI/D,IAAAA,GAAG,CAAC,CAAC,CAAC,GAAG,EAAE;AACXA,IAAAA,GAAG,CAAC,CAAC,CAAC,GAAG,EAAE;AACXA,IAAAA,GAAG,CAAC,CAAC,CAAC,GAAG,EAAE;AACX,IAAA,MAAM,IAAIgE,KAAK,CAAC,mBAAmB,CAAC;AACxC,EAAA,CAAC,MAED;AACI,IAAA,IAAIC,QAAQ,GAAG,CAAC,GAAGF,KAAK;IACxB,IAAIG,CAAC,GAAG,CAACL,KAAK,GAAGD,KAAK,GAAGD,KAAK,GAAGG,KAAK,IAAIG,QAAQ;IAClD,IAAI5C,CAAC,GAAG,CAACqC,KAAK,GAAGI,KAAK,GAAGH,KAAK,GAAGC,KAAK,IAAIK,QAAQ;IAClDjE,GAAG,CAAC,CAAC,CAAC,GAAG,CAAC,GAAGkE,CAAC,GAAG7C,CAAC;AAClBrB,IAAAA,GAAG,CAAC,CAAC,CAAC,GAAGqB,CAAC;AACVrB,IAAAA,GAAG,CAAC,CAAC,CAAC,GAAGkE,CAAC;AACd,EAAA;AACA,EAAA,OAAOlE,GAAG;AACd,CAAC;;AAED;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA3B,IAAI,CAAC8F,qBAAqB,GAAI,YAC9B;AACI,EAAA,IAAIC,EAAE,EAAEzD,EAAE,EAAE0D,QAAQ;EAEpB,OAAO,SAASF,qBAAqBA,CAACnE,GAAG,EAAEtB,CAAC,EAAE4B,KAAK,EAAEgE,KAAK,EAC1D;IACI,IAAI,CAACF,EAAE,EACP;AACIA,MAAAA,EAAE,GAAG7D,IAAI,CAACR,MAAM,EAAE;AAClBY,MAAAA,EAAE,GAAGJ,IAAI,CAACR,MAAM,EAAE;AAClBsE,MAAAA,QAAQ,GAAG,CAAExF,IAAI,CAACkB,MAAM,EAAE,EAAElB,IAAI,CAACkB,MAAM,EAAE,EAAElB,IAAI,CAACkB,MAAM,EAAE,CAAE;AAC9D,IAAA;;AAEA;IACA,IAAIwE,sBAAsB,GAAGlG,IAAI,CAACmG,sBAAsB,CAACJ,EAAE,EAAE1F,CAAC,EAAE4B,KAAK,CAAC;;AAEtE;AACAzB,IAAAA,IAAI,CAAC6D,GAAG,CAAC2B,QAAQ,CAAC,CAAC,CAAC,EAAE3F,CAAC,CAAC,CAAC,CAAC,EAAEA,CAAC,CAAC,CAAC,CAAC,EAAEA,CAAC,CAAC,CAAC,CAAC,EAAEA,CAAC,CAAC,CAAC,CAAC,EAAEA,CAAC,CAAC,CAAC,CAAC,EAAEA,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;AAC1DG,IAAAA,IAAI,CAAC6D,GAAG,CAAC2B,QAAQ,CAAC,CAAC,CAAC,EAAE3F,CAAC,CAAC,CAAC,CAAC,EAAEA,CAAC,CAAC,CAAC,CAAC,EAAEA,CAAC,CAAC,CAAC,CAAC,EAAEA,CAAC,CAAC,CAAC,CAAC,EAAEA,CAAC,CAAC,CAAC,CAAC,EAAEA,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;AAC1DG,IAAAA,IAAI,CAAC6D,GAAG,CAAC2B,QAAQ,CAAC,CAAC,CAAC,EAAE3F,CAAC,CAAC,CAAC,CAAC,EAAEA,CAAC,CAAC,CAAC,CAAC,EAAEA,CAAC,CAAC,CAAC,CAAC,EAAEA,CAAC,CAAC,CAAC,CAAC,EAAEA,CAAC,CAAC,CAAC,CAAC,EAAEA,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;;IAE1D,IAAI+F,WAAW,GAAGC,QAAQ;MACtBC,SAAS;AAEb,IAAA,KAAK,IAAIlC,CAAC,GAAG,CAAC,EAAEA,CAAC,GAAG4B,QAAQ,CAACtB,MAAM,EAAEN,CAAC,EAAE,EACxC;AACI;AACA,MAAA,IAAImC,kBAAkB,GAAG/F,IAAI,CAAC2F,sBAAsB,CAAC7D,EAAE,EAAE0D,QAAQ,CAAC5B,CAAC,CAAC,EAAE8B,sBAAsB,EAAE,IAAI,CAAC;MACnG,IAAIM,QAAQ,GAAGtE,IAAI,CAACuE,eAAe,CAACF,kBAAkB,EAAEL,sBAAsB,CAAC;MAC/E,IAAIM,QAAQ,GAAGJ,WAAW,EAC1B;AACIA,QAAAA,WAAW,GAAGI,QAAQ;QACtB7E,GAAG,CAAC,CAAC,CAAC,GAAGqE,QAAQ,CAAC5B,CAAC,CAAC,CAAC,CAAC,CAAC;QACvBzC,GAAG,CAAC,CAAC,CAAC,GAAGqE,QAAQ,CAAC5B,CAAC,CAAC,CAAC,CAAC,CAAC;QACvBzC,GAAG,CAAC,CAAC,CAAC,GAAGqE,QAAQ,CAAC5B,CAAC,CAAC,CAAC,CAAC,CAAC;QACvBzC,GAAG,CAAC,CAAC,CAAC,GAAGqE,QAAQ,CAAC5B,CAAC,CAAC,CAAC,CAAC,CAAC;QACvBzC,GAAG,CAAC,CAAC,CAAC,GAAGqE,QAAQ,CAAC5B,CAAC,CAAC,CAAC,CAAC,CAAC;QACvBzC,GAAG,CAAC,CAAC,CAAC,GAAGqE,QAAQ,CAAC5B,CAAC,CAAC,CAAC,CAAC,CAAC;AACvBkC,QAAAA,SAAS,GAAGlC,CAAC;AACjB,MAAA;AACJ,IAAA;;AAEA;AACA,IAAA,IAAI6B,KAAK,EACT;AACI,MAAA,QAAOK,SAAS;AAEZ,QAAA,KAAK,CAAC;UACFL,KAAK,CAACS,SAAS,GAAG,CAAC;UACnBT,KAAK,CAACU,OAAO,GAAG,CAAC;AACjB,UAAA;AAEJ,QAAA,KAAK,CAAC;UACFV,KAAK,CAACS,SAAS,GAAG,CAAC;UACnBT,KAAK,CAACU,OAAO,GAAG,CAAC;AACjB,UAAA;AAEJ,QAAA;UACIV,KAAK,CAACS,SAAS,GAAG,CAAC;UACnBT,KAAK,CAACU,OAAO,GAAG,CAAC;AACjB,UAAA;AACR;AACJ,IAAA;AAEA,IAAA,OAAOhF,GAAG;EACd,CAAC;AACL,CAAC,EAAG;;AAEJ;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA3B,IAAI,CAACmG,sBAAsB,GAAI,YAC/B;AACI,EAAA,IAAIS,KAAK,EAAEZ,QAAQ,EAAEa,cAAc,EAAEC,YAAY,EAAE9E,MAAM,EAAE+E,MAAM,EAAEC,MAAM;EAEzE,OAAO,SAASb,sBAAsBA,CAACxE,GAAG,EAAEtB,CAAC,EAAE4B,KAAK,EACpD;IACI,IAAI,CAAC2E,KAAK,EACV;AACIA,MAAAA,KAAK,GAAGK,GAAG,CAACvF,MAAM,EAAE;AACpBsE,MAAAA,QAAQ,GAAG,CAAExF,IAAI,CAACkB,MAAM,EAAE,EAAElB,IAAI,CAACkB,MAAM,EAAE,EAAElB,IAAI,CAACkB,MAAM,EAAE,CAAE;AAC1DmF,MAAAA,cAAc,GAAG3E,IAAI,CAACR,MAAM,EAAE;AAC9BoF,MAAAA,YAAY,GAAG5E,IAAI,CAACR,MAAM,EAAE;AAC5BM,MAAAA,MAAM,GAAGE,IAAI,CAACR,MAAM,EAAE;AACtBqF,MAAAA,MAAM,GAAG7E,IAAI,CAACR,MAAM,EAAE;AACtBsF,MAAAA,MAAM,GAAG9E,IAAI,CAACR,MAAM,EAAE;AAC1B,IAAA;;AAEA;AACA1B,IAAAA,IAAI,CAACkH,KAAK,CAAClF,MAAM,EAAE3B,CAAC,CAAC;AACrBL,IAAAA,IAAI,CAACmH,KAAK,CAACJ,MAAM,EAAE1G,CAAC,CAAC;AACrBL,IAAAA,IAAI,CAACoH,KAAK,CAACJ,MAAM,EAAE3G,CAAC,CAAC;;AAErB;IACA4G,GAAG,CAACI,kBAAkB,CAACT,KAAK,EAAE5E,MAAM,EAAE+E,MAAM,EAAEC,MAAM,CAAC;IACrDC,GAAG,CAACK,iBAAiB,CAACT,cAAc,EAAED,KAAK,EAAE3E,KAAK,CAAC;;AAEnD;IACA,IAAIjC,IAAI,CAAC+B,QAAQ,CAAC1B,CAAC,EAAEwG,cAAc,CAAC,KAAK,IAAI,EAC7C;AACIlF,MAAAA,GAAG,CAAC,CAAC,CAAC,GAAGkF,cAAc,CAAC,CAAC,CAAC;AAC1BlF,MAAAA,GAAG,CAAC,CAAC,CAAC,GAAGkF,cAAc,CAAC,CAAC,CAAC;AAC1BlF,MAAAA,GAAG,CAAC,CAAC,CAAC,GAAGkF,cAAc,CAAC,CAAC,CAAC;AAC9B,IAAA;AACA;AACA;SAEA;AACIrG,MAAAA,IAAI,CAAC6D,GAAG,CAAC2B,QAAQ,CAAC,CAAC,CAAC,EAAE3F,CAAC,CAAC,CAAC,CAAC,EAAEA,CAAC,CAAC,CAAC,CAAC,EAAEA,CAAC,CAAC,CAAC,CAAC,EAAEA,CAAC,CAAC,CAAC,CAAC,EAAEA,CAAC,CAAC,CAAC,CAAC,EAAEA,CAAC,CAAC,CAAC,CAAC,CAAC;AACzDG,MAAAA,IAAI,CAAC6D,GAAG,CAAC2B,QAAQ,CAAC,CAAC,CAAC,EAAE3F,CAAC,CAAC,CAAC,CAAC,EAAEA,CAAC,CAAC,CAAC,CAAC,EAAEA,CAAC,CAAC,CAAC,CAAC,EAAEA,CAAC,CAAC,CAAC,CAAC,EAAEA,CAAC,CAAC,CAAC,CAAC,EAAEA,CAAC,CAAC,CAAC,CAAC,CAAC;AACzDG,MAAAA,IAAI,CAAC6D,GAAG,CAAC2B,QAAQ,CAAC,CAAC,CAAC,EAAE3F,CAAC,CAAC,CAAC,CAAC,EAAEA,CAAC,CAAC,CAAC,CAAC,EAAEA,CAAC,CAAC,CAAC,CAAC,EAAEA,CAAC,CAAC,CAAC,CAAC,EAAEA,CAAC,CAAC,CAAC,CAAC,EAAEA,CAAC,CAAC,CAAC,CAAC,CAAC;MAEzD,IAAI+F,WAAW,GAAGC,QAAQ;AAC1B,MAAA,KAAK,IAAIjC,CAAC,GAAG,CAAC,EAAEA,CAAC,GAAG4B,QAAQ,CAACtB,MAAM,EAAEN,CAAC,EAAE,EACxC;AACI5D,QAAAA,IAAI,CAAC2F,sBAAsB,CAACW,YAAY,EAAEd,QAAQ,CAAC5B,CAAC,CAAC,EAAEyC,cAAc,EAAE,IAAI,CAAC;QAC5E,IAAIL,QAAQ,GAAGtE,IAAI,CAACuE,eAAe,CAACI,cAAc,EAAEC,YAAY,CAAC;QACjE,IAAIN,QAAQ,GAAGJ,WAAW,EAC1B;AACIA,UAAAA,WAAW,GAAGI,QAAQ;AACtB7E,UAAAA,GAAG,CAAC,CAAC,CAAC,GAAGmF,YAAY,CAAC,CAAC,CAAC;AACxBnF,UAAAA,GAAG,CAAC,CAAC,CAAC,GAAGmF,YAAY,CAAC,CAAC,CAAC;AACxBnF,UAAAA,GAAG,CAAC,CAAC,CAAC,GAAGmF,YAAY,CAAC,CAAC,CAAC;AAC5B,QAAA;AACJ,MAAA;AACJ,IAAA;AACA,IAAA,OAAOnF,GAAG;EACd,CAAC;AACL,CAAC,EAAG;;AAEJ;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA3B,IAAI,CAACuH,uBAAuB,GAAI,YAChC;AACI,EAAA,IAAIvF,MAAM,EAAE+E,MAAM,EAAEC,MAAM;EAE1B,OAAO,UAASrF,GAAG,EAAEtB,CAAC,EAAE4B,KAAK,EAAEgE,KAAK,EACpC;IACI,IAAI,CAACjE,MAAM,EACX;AACIA,MAAAA,MAAM,GAAGE,IAAI,CAACR,MAAM,EAAE;AACtBqF,MAAAA,MAAM,GAAG7E,IAAI,CAACR,MAAM,EAAE;AACtBsF,MAAAA,MAAM,GAAG9E,IAAI,CAACR,MAAM,EAAE;AAC1B,IAAA;;AAEA;IACA1B,IAAI,CAACmG,sBAAsB,CAACxE,GAAG,EAAEtB,CAAC,EAAE4B,KAAK,CAAC;IAE1C,IAAImE,WAAW,GAAGC,QAAQ;MACtBG,QAAQ;MACRnF,CAAC;MAAEC,CAAC;MAAEC,CAAC;AACPiG,MAAAA,QAAQ,GAAG,CACPxH,IAAI,CAACkH,KAAK,CAAClF,MAAM,EAAE3B,CAAC,CAAC,EACrBL,IAAI,CAACmH,KAAK,CAACJ,MAAM,EAAE1G,CAAC,CAAC,EACrBL,IAAI,CAACoH,KAAK,CAACJ,MAAM,EAAE3G,CAAC,CAAC,CACxB;AAEL,IAAA,IAAIoH,UAAU;AACd;AACA,IAAA,KAAK,IAAIrD,CAAC,GAAG,CAAC,EAAEA,CAAC,GAAGoD,QAAQ,CAAC9C,MAAM,EAAEN,CAAC,EAAE,EACxC;MACIoC,QAAQ,GAAGtE,IAAI,CAACuE,eAAe,CAACe,QAAQ,CAACpD,CAAC,CAAC,EAAEzC,GAAG,CAAC;MACjD,IAAI6E,QAAQ,GAAGJ,WAAW,EAC1B;AACIA,QAAAA,WAAW,GAAGI,QAAQ;AACtBnF,QAAAA,CAAC,GAAGmG,QAAQ,CAACpD,CAAC,CAAC,CAAC,CAAC,CAAC;AAClB9C,QAAAA,CAAC,GAAGkG,QAAQ,CAACpD,CAAC,CAAC,CAAC,CAAC,CAAC;AAClB7C,QAAAA,CAAC,GAAGiG,QAAQ,CAACpD,CAAC,CAAC,CAAC,CAAC,CAAC;AAClBqD,QAAAA,UAAU,GAAGrD,CAAC;AAClB,MAAA;AACJ,IAAA;AAEA,IAAA,IAAI6B,KAAK,EAAEA,KAAK,CAACyB,OAAO,GAAGD,UAAU;AAErC9F,IAAAA,GAAG,CAAC,CAAC,CAAC,GAAGN,CAAC;AACVM,IAAAA,GAAG,CAAC,CAAC,CAAC,GAAGL,CAAC;AACVK,IAAAA,GAAG,CAAC,CAAC,CAAC,GAAGJ,CAAC;AACV,IAAA,OAAOI,GAAG;EACd,CAAC;AACL,CAAC,EAAG;;AAEJ;AACA;AACA;AACA;AACA;AACA;AACA;AACA3B,IAAI,CAAC2H,WAAW,GAAG,UAAShG,GAAG,EAAEtB,CAAC,EAClC;AACI,EAAA,IAAIuH,CAAC,GAAG,CAAC,GAAG,CAAC;EACbjG,GAAG,CAAC,CAAC,CAAC,GAAG,CAACtB,CAAC,CAAC,CAAC,CAAC,GAAGA,CAAC,CAAC,CAAC,CAAC,GAAGA,CAAC,CAAC,CAAC,CAAC,IAAIuH,CAAC;EACjCjG,GAAG,CAAC,CAAC,CAAC,GAAG,CAACtB,CAAC,CAAC,CAAC,CAAC,GAAGA,CAAC,CAAC,CAAC,CAAC,GAAGA,CAAC,CAAC,CAAC,CAAC,IAAIuH,CAAC;EACjCjG,GAAG,CAAC,CAAC,CAAC,GAAG,CAACtB,CAAC,CAAC,CAAC,CAAC,GAAGA,CAAC,CAAC,CAAC,CAAC,GAAGA,CAAC,CAAC,CAAC,CAAC,IAAIuH,CAAC;AACjC,EAAA,OAAOjG,GAAG;AACd,CAAC;AAED,IAAIkG,MAAM,GAAG,IAAI;;AAEjB;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA7H,IAAI,CAAC8H,qBAAqB,GAAI,UAASnG,GAAG,EAAEW,EAAE,EAAEC,EAAE,EAAEC,EAAE,EACtD;EACI,IAAI,CAACqF,MAAM,EAAEA,MAAM,GAAG7H,IAAI,CAAC0B,MAAM,EAAE;EACnC1B,IAAI,CAACqC,YAAY,CAACwF,MAAM,EAAEvF,EAAE,EAAEC,EAAE,EAAEC,EAAE,CAAC;AACrC,EAAA,OAAOxC,IAAI,CAAC+H,SAAS,CAACpG,GAAG,EAAEkG,MAAM,CAAC;AACtC,CAAC;;AAED;AACA;AACA;AACA;AACA;AACA;AACA;AACA7H,IAAI,CAAC+H,SAAS,GAAG,UAASpG,GAAG,EAAEtB,CAAC,EAChC;EACI,IAAIU,EAAE,GAAGV,CAAC,CAAC,CAAC,CAAC,GAAGA,CAAC,CAAC,CAAC,CAAC;IAChBW,EAAE,GAAGX,CAAC,CAAC,CAAC,CAAC,GAAGA,CAAC,CAAC,CAAC,CAAC;IAChBY,EAAE,GAAGZ,CAAC,CAAC,CAAC,CAAC,GAAGA,CAAC,CAAC,CAAC,CAAC;IAChBa,EAAE,GAAGb,CAAC,CAAC,CAAC,CAAC,GAAGA,CAAC,CAAC,CAAC,CAAC;IAChBc,EAAE,GAAGd,CAAC,CAAC,CAAC,CAAC,GAAGA,CAAC,CAAC,CAAC,CAAC;IAChBe,EAAE,GAAGf,CAAC,CAAC,CAAC,CAAC,GAAGA,CAAC,CAAC,CAAC,CAAC;;AAEpB;EACA,IAAIgB,CAAC,GAAGL,EAAE,GAAGI,EAAE,GAAGH,EAAE,GAAGE,EAAE;AACrBG,IAAAA,CAAC,GAAGL,EAAE,GAAGC,EAAE,GAAGH,EAAE,GAAGK,EAAE;AACrBG,IAAAA,CAAC,GAAGR,EAAE,GAAGI,EAAE,GAAGH,EAAE,GAAGE,EAAE;;AAEzB;AACA,EAAA,IAAI8G,GAAG,GAAG3G,CAAC,GAAGA,CAAC,GAAGC,CAAC,GAAGA,CAAC,GAAGC,CAAC,GAAGA,CAAC;EAC/B,IAAIyG,GAAG,GAAG,CAAC,EACX;IACIA,GAAG,GAAG,CAAC,GAAGxG,IAAI,CAACC,IAAI,CAACuG,GAAG,CAAC;AACxBrG,IAAAA,GAAG,CAAC,CAAC,CAAC,GAAGN,CAAC,GAAG2G,GAAG;AAChBrG,IAAAA,GAAG,CAAC,CAAC,CAAC,GAAGL,CAAC,GAAG0G,GAAG;AAChBrG,IAAAA,GAAG,CAAC,CAAC,CAAC,GAAGJ,CAAC,GAAGyG,GAAG;AACpB,EAAA,CAAC,MAED;AACIrG,IAAAA,GAAG,CAAC,CAAC,CAAC,GAAG,CAAC;AACVA,IAAAA,GAAG,CAAC,CAAC,CAAC,GAAG,CAAC;AACVA,IAAAA,GAAG,CAAC,CAAC,CAAC,GAAG,CAAC;AACV,IAAA,MAAM,IAAIgE,KAAK,CAAC,qBAAqB,CAAC;AAC1C,EAAA;AACA,EAAA,OAAOhE,GAAG;AACd,CAAC;;AAED;AACA;AACA;AACA;AACA;AACA;AACA;AACA3B,IAAI,CAACkH,KAAK,GAAG1G,IAAI,CAACyH,QAAQ;;AAE1B;AACA;AACA;AACA;AACA;AACA;AACA;AACAjI,IAAI,CAACmH,KAAK,GAAG3G,IAAI,CAAC0H,MAAM;;AAExB;AACA;AACA;AACA;AACA;AACA;AACA;AACAlI,IAAI,CAACoH,KAAK,GAAG,UAASzF,GAAG,EAAEqB,CAAC,EAC5B;AACIrB,EAAAA,GAAG,CAAC,CAAC,CAAC,GAAGqB,CAAC,CAAC,CAAC,CAAC;AACbrB,EAAAA,GAAG,CAAC,CAAC,CAAC,GAAGqB,CAAC,CAAC,CAAC,CAAC;AACbrB,EAAAA,GAAG,CAAC,CAAC,CAAC,GAAGqB,CAAC,CAAC,CAAC,CAAC;AACb,EAAA,OAAOrB,GAAG;AACd,CAAC;;AAED;AACA;AACA;AACA;AACA;AACA;AACA3B,IAAI,CAACmI,KAAK,GAAG3H,IAAI,CAAC4H,QAAQ;;AAE1B;AACA;AACA;AACA;AACA;AACA;AACApI,IAAI,CAACqI,KAAK,GAAG7H,IAAI,CAAC8H,MAAM;;AAExB;AACA;AACA;AACA;AACA;AACA;AACAtI,IAAI,CAACuI,KAAK,GAAG,UAAS5G,GAAG,EAAEqB,CAAC,EAC5B;AACIrB,EAAAA,GAAG,CAAC,CAAC,CAAC,GAAGqB,CAAC,CAAC,CAAC,CAAC;AACbrB,EAAAA,GAAG,CAAC,CAAC,CAAC,GAAGqB,CAAC,CAAC,CAAC,CAAC;AACbrB,EAAAA,GAAG,CAAC,CAAC,CAAC,GAAGqB,CAAC,CAAC,CAAC,CAAC;AACb,EAAA,OAAOrB,GAAG;AACd,CAAC;;AAED;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA3B,IAAI,CAACwI,OAAO,GAAG1G,IAAI,CAAC0G,OAAO;;AAE3B;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACAxI,IAAI,CAACyI,UAAU,GAAG,UAASpI,CAAC,EAAEiC,EAAE,EAAEC,EAAE,EAAEC,EAAE,EACxC;AACIF,EAAAA,EAAE,CAAC,CAAC,CAAC,GAAGjC,CAAC,CAAC,CAAC,CAAC;AACZiC,EAAAA,EAAE,CAAC,CAAC,CAAC,GAAGjC,CAAC,CAAC,CAAC,CAAC;AACZiC,EAAAA,EAAE,CAAC,CAAC,CAAC,GAAGjC,CAAC,CAAC,CAAC,CAAC;AACZkC,EAAAA,EAAE,CAAC,CAAC,CAAC,GAAGlC,CAAC,CAAC,CAAC,CAAC;AACZkC,EAAAA,EAAE,CAAC,CAAC,CAAC,GAAGlC,CAAC,CAAC,CAAC,CAAC;AACZkC,EAAAA,EAAE,CAAC,CAAC,CAAC,GAAGlC,CAAC,CAAC,CAAC,CAAC;AACZmC,EAAAA,EAAE,CAAC,CAAC,CAAC,GAAGnC,CAAC,CAAC,CAAC,CAAC;AACZmC,EAAAA,EAAE,CAAC,CAAC,CAAC,GAAGnC,CAAC,CAAC,CAAC,CAAC;AACZmC,EAAAA,EAAE,CAAC,CAAC,CAAC,GAAGnC,CAAC,CAAC,CAAC,CAAC;AACZ,EAAA,OAAOA,CAAC;AACZ,CAAC;AAED,IAAI2B,MAAM,EAAE+E,MAAM,EAAEC,MAAM;;AAE1B;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACAhH,IAAI,CAACsE,aAAa,GAAG,UAAS3C,GAAG,EAAEtB,CAAC,EAAEqI,CAAC,EACvC;EACI,IAAI,CAAC1G,MAAM,EACX;AACIA,IAAAA,MAAM,GAAGE,IAAI,CAACR,MAAM,EAAE;AACtBqF,IAAAA,MAAM,GAAG7E,IAAI,CAACR,MAAM,EAAE;AACtBsF,IAAAA,MAAM,GAAG9E,IAAI,CAACR,MAAM,EAAE;AAC1B,EAAA;AAEA1B,EAAAA,IAAI,CAACkH,KAAK,CAAClF,MAAM,EAAE3B,CAAC,CAAC;AACrBL,EAAAA,IAAI,CAACmH,KAAK,CAACJ,MAAM,EAAE1G,CAAC,CAAC;AACrBL,EAAAA,IAAI,CAACoH,KAAK,CAACJ,MAAM,EAAE3G,CAAC,CAAC;EAErB6B,IAAI,CAACoC,aAAa,CAACtC,MAAM,EAAEA,MAAM,EAAE0G,CAAC,CAAC;EACrCxG,IAAI,CAACoC,aAAa,CAACyC,MAAM,EAAEA,MAAM,EAAE2B,CAAC,CAAC;EACrCxG,IAAI,CAACoC,aAAa,CAAC0C,MAAM,EAAEA,MAAM,EAAE0B,CAAC,CAAC;EAErC,OAAO1I,IAAI,CAACqC,YAAY,CAACV,GAAG,EAAEK,MAAM,EAAE+E,MAAM,EAAEC,MAAM,CAAC;AACzD,CAAC;AAEM,MAAM;EACT/G,KAAK;EACLG,OAAO;EACPG,GAAG;EACHG,GAAG;EACHE,GAAG;EACHE,IAAI;EACJY,MAAM;EACNG,KAAK;EACLE,QAAQ;EACRK,IAAI;EACJC,YAAY;EACZ4C,SAAS;EACT9C,yBAAyB;EACzB2D,qBAAqB;EACrBK,sBAAsB;EACtBoB,uBAAuB;EACvBI,WAAW;EACXG,qBAAqB;EACrBC,SAAS;EACTb,KAAK;EACLzE,gBAAgB;EAChBM,qBAAqB;EACrBoE,KAAK;EACLC,KAAK;EACLe,KAAK;EACLE,KAAK;EACLE,KAAK;EACLC,OAAO;EACPC,UAAU;AACVnE,EAAAA;AACJ,CAAC,GAAGtE;;;;"}

package/dist/global/utils/bytes.js

@@ -1,4 +1,8 @@
 /** Returns a zero-copy Uint8Array view over supported byte input. */
+// One reused conversion view. `hash.js` keeps its own for the same reason:
+// these run per record, and allocating a 4-byte ArrayBuffer each time is
+// pure garbage for a value that is read immediately and never retained.
+const scratch = new DataView(new ArrayBuffer(4));
 function asUint8Array(value, label = "value") {
   if (value instanceof Uint8Array) {
     return value;
@@ -102,10 +106,24 @@ function readU32LE(bytes, offset) {
  * @returns {number} Float value represented by the same bits.
  */
 function float32FromBits(value) {
-  const view = new DataView(new ArrayBuffer(4));
-  view.setUint32(0, value >>> 0, true);
-  return view.getFloat32(0, true);
+  scratch.setUint32(0, value >>> 0, true);
+  return scratch.getFloat32(0, true);
 }
 
-export { asUint8Array, copyBytes, float32FromBits, hasBytePrefix, readFourCc, readU16BE, readU16LE, readU24BE, readU24LE, readU32BE, readU32LE, toArrayBuffer };
+/**
+ * The bit pattern of a 32-bit float.
+ *
+ * The inverse of `float32FromBits`, and the reason both live here: a caller that
+ * round-trips a float through its bits needs the two halves to agree about byte
+ * order, and two modules each owning one half is how they stop agreeing.
+ *
+ * @param {number} value Float value.
+ * @returns {number} Unsigned 32-bit pattern encoding that float.
+ */
+function float32ToBits(value) {
+  scratch.setFloat32(0, value, true);
+  return scratch.getUint32(0, true);
+}
+
+export { asUint8Array, copyBytes, float32FromBits, float32ToBits, hasBytePrefix, readFourCc, readU16BE, readU16LE, readU24BE, readU24LE, readU32BE, readU32LE, toArrayBuffer };
 //# sourceMappingURL=bytes.js.map

package/dist/global/utils/bytes.js.map

@@ -1 +1 @@
-{"version":3,"file":"bytes.js","sources":["../../../../src/global/utils/bytes.js"],"sourcesContent":["/** Returns a zero-copy Uint8Array view over supported byte input. */\r\nexport function asUint8Array(value, label = \"value\")\r\n{\r\n    if (value instanceof Uint8Array)\r\n    {\r\n        return value;\r\n    }\r\n\r\n    if (value instanceof ArrayBuffer)\r\n    {\r\n        return new Uint8Array(value);\r\n    }\r\n\r\n    if (ArrayBuffer.isView(value))\r\n    {\r\n        return new Uint8Array(value.buffer, value.byteOffset, value.byteLength);\r\n    }\r\n\r\n    throw new TypeError(`${label} must be a Uint8Array, ArrayBuffer, or ArrayBuffer view.`);\r\n}\r\n\r\n/** Returns an owned copy of supported byte input. */\r\nexport function copyBytes(value, label = \"value\")\r\n{\r\n    return asUint8Array(value, label).slice();\r\n}\r\n\r\n/** Copies exactly the visible byte range into a standalone ArrayBuffer. */\r\nexport function toArrayBuffer(value, label = \"value\")\r\n{\r\n    const bytes = asUint8Array(value, label);\r\n\r\n    return bytes.buffer.slice(bytes.byteOffset, bytes.byteOffset + bytes.byteLength);\r\n}\r\n\r\n/** Tests whether byte input starts with the complete supplied prefix. */\r\nexport function hasBytePrefix(value, prefix)\r\n{\r\n    const bytes = asUint8Array(value, \"value\");\r\n    const expected = asUint8Array(prefix, \"prefix\");\r\n\r\n    if (bytes.byteLength < expected.byteLength)\r\n    {\r\n        return false;\r\n    }\r\n\r\n    for (let index = 0; index < expected.byteLength; index++)\r\n    {\r\n        if (bytes[index] !== expected[index])\r\n        {\r\n            return false;\r\n        }\r\n    }\r\n\r\n    return true;\r\n}\r\n\n/**\n * Reads a fixed-length ASCII tag, as container formats use for chunk names.\n *\n * Missing bytes read as zero rather than throwing, because a truncated tag is\n * a failed match at the call site, not an error in the read.\n *\n * @param {Uint8Array} bytes Source bytes.\n * @param {number} offset Byte offset to read from.\n * @param {number} [length=4] Tag length in bytes.\n * @returns {string} The decoded tag.\n */\nexport function readFourCc(bytes, offset, length = 4)\n{\n    let value = \"\";\n    for (let i = 0; i < length; i++) value += String.fromCharCode(bytes[offset + i] || 0);\n    return value;\n}\n\n// Container formats read fixed-width big- and little-endian integers\n// constantly, and every reader had grown its own copy. Missing bytes read as\n// zero, matching what the shifting forms already did: `>>> 0` turns the NaN a\n// truncated multiply produces back into a number, so only the two flac copies\n// that omitted it ever returned NaN, and flac bounds-checks before every read.\n\n/** Reads an unsigned big-endian 16-bit integer. */\nexport function readU16BE(bytes, offset)\n{\n    return ((bytes[offset] || 0) << 8) | (bytes[offset + 1] || 0);\n}\n\n/** Reads an unsigned little-endian 16-bit integer. */\nexport function readU16LE(bytes, offset)\n{\n    return (bytes[offset] || 0) | ((bytes[offset + 1] || 0) << 8);\n}\n\n/** Reads an unsigned big-endian 24-bit integer. */\nexport function readU24BE(bytes, offset)\n{\n    return ((bytes[offset] || 0) * 0x10000) + ((bytes[offset + 1] || 0) << 8) + (bytes[offset + 2] || 0);\n}\n\n/** Reads an unsigned little-endian 24-bit integer. */\nexport function readU24LE(bytes, offset)\n{\n    return (bytes[offset] || 0) + ((bytes[offset + 1] || 0) << 8) + ((bytes[offset + 2] || 0) * 0x10000);\n}\n\n/** Reads an unsigned big-endian 32-bit integer. */\nexport function readU32BE(bytes, offset)\n{\n    return (((bytes[offset] || 0) * 0x1000000)\n        + ((bytes[offset + 1] || 0) << 16)\n        + ((bytes[offset + 2] || 0) << 8)\n        + (bytes[offset + 3] || 0)) >>> 0;\n}\n\n/** Reads an unsigned little-endian 32-bit integer. */\nexport function readU32LE(bytes, offset)\n{\n    return ((bytes[offset] || 0)\n        + ((bytes[offset + 1] || 0) << 8)\n        + ((bytes[offset + 2] || 0) << 16)\n        + ((bytes[offset + 3] || 0) * 0x1000000)) >>> 0;\n}\n\n/**\n * Reinterprets the bits of an unsigned 32-bit integer as a float32.\n *\n * Carbon stores float-valued render states and annotation payloads as raw\n * uint32 bit patterns, so a consumer that needs the number rather than the\n * pattern must reinterpret rather than convert.\n *\n * @param {number} value Unsigned 32-bit integer containing float bits.\n * @returns {number} Float value represented by the same bits.\n */\nexport function float32FromBits(value)\n{\n    const view = new DataView(new ArrayBuffer(4));\n    view.setUint32(0, value >>> 0, true);\n    return view.getFloat32(0, true);\n}\n"],"names":["asUint8Array","value","label","Uint8Array","ArrayBuffer","isView","buffer","byteOffset","byteLength","TypeError","copyBytes","slice","toArrayBuffer","bytes","hasBytePrefix","prefix","expected","index","readFourCc","offset","length","i","String","fromCharCode","readU16BE","readU16LE","readU24BE","readU24LE","readU32BE","readU32LE","float32FromBits","view","DataView","setUint32","getFloat32"],"mappings":"AAAA;AACO,SAASA,YAAYA,CAACC,KAAK,EAAEC,KAAK,GAAG,OAAO,EACnD;EACI,IAAID,KAAK,YAAYE,UAAU,EAC/B;AACI,IAAA,OAAOF,KAAK;AAChB,EAAA;EAEA,IAAIA,KAAK,YAAYG,WAAW,EAChC;AACI,IAAA,OAAO,IAAID,UAAU,CAACF,KAAK,CAAC;AAChC,EAAA;AAEA,EAAA,IAAIG,WAAW,CAACC,MAAM,CAACJ,KAAK,CAAC,EAC7B;AACI,IAAA,OAAO,IAAIE,UAAU,CAACF,KAAK,CAACK,MAAM,EAAEL,KAAK,CAACM,UAAU,EAAEN,KAAK,CAACO,UAAU,CAAC;AAC3E,EAAA;AAEA,EAAA,MAAM,IAAIC,SAAS,CAAC,CAAA,EAAGP,KAAK,0DAA0D,CAAC;AAC3F;;AAEA;AACO,SAASQ,SAASA,CAACT,KAAK,EAAEC,KAAK,GAAG,OAAO,EAChD;EACI,OAAOF,YAAY,CAACC,KAAK,EAAEC,KAAK,CAAC,CAACS,KAAK,EAAE;AAC7C;;AAEA;AACO,SAASC,aAAaA,CAACX,KAAK,EAAEC,KAAK,GAAG,OAAO,EACpD;AACI,EAAA,MAAMW,KAAK,GAAGb,YAAY,CAACC,KAAK,EAAEC,KAAK,CAAC;AAExC,EAAA,OAAOW,KAAK,CAACP,MAAM,CAACK,KAAK,CAACE,KAAK,CAACN,UAAU,EAAEM,KAAK,CAACN,UAAU,GAAGM,KAAK,CAACL,UAAU,CAAC;AACpF;;AAEA;AACO,SAASM,aAAaA,CAACb,KAAK,EAAEc,MAAM,EAC3C;AACI,EAAA,MAAMF,KAAK,GAAGb,YAAY,CAACC,KAAK,EAAE,OAAO,CAAC;AAC1C,EAAA,MAAMe,QAAQ,GAAGhB,YAAY,CAACe,MAAM,EAAE,QAAQ,CAAC;AAE/C,EAAA,IAAIF,KAAK,CAACL,UAAU,GAAGQ,QAAQ,CAACR,UAAU,EAC1C;AACI,IAAA,OAAO,KAAK;AAChB,EAAA;AAEA,EAAA,KAAK,IAAIS,KAAK,GAAG,CAAC,EAAEA,KAAK,GAAGD,QAAQ,CAACR,UAAU,EAAES,KAAK,EAAE,EACxD;IACI,IAAIJ,KAAK,CAACI,KAAK,CAAC,KAAKD,QAAQ,CAACC,KAAK,CAAC,EACpC;AACI,MAAA,OAAO,KAAK;AAChB,IAAA;AACJ,EAAA;AAEA,EAAA,OAAO,IAAI;AACf;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACO,SAASC,UAAUA,CAACL,KAAK,EAAEM,MAAM,EAAEC,MAAM,GAAG,CAAC,EACpD;EACI,IAAInB,KAAK,GAAG,EAAE;EACd,KAAK,IAAIoB,CAAC,GAAG,CAAC,EAAEA,CAAC,GAAGD,MAAM,EAAEC,CAAC,EAAE,EAAEpB,KAAK,IAAIqB,MAAM,CAACC,YAAY,CAACV,KAAK,CAACM,MAAM,GAAGE,CAAC,CAAC,IAAI,CAAC,CAAC;AACrF,EAAA,OAAOpB,KAAK;AAChB;;AAEA;AACA;AACA;AACA;AACA;;AAEA;AACO,SAASuB,SAASA,CAACX,KAAK,EAAEM,MAAM,EACvC;AACI,EAAA,OAAQ,CAACN,KAAK,CAACM,MAAM,CAAC,IAAI,CAAC,KAAK,CAAC,IAAKN,KAAK,CAACM,MAAM,GAAG,CAAC,CAAC,IAAI,CAAC,CAAC;AACjE;;AAEA;AACO,SAASM,SAASA,CAACZ,KAAK,EAAEM,MAAM,EACvC;AACI,EAAA,OAAO,CAACN,KAAK,CAACM,MAAM,CAAC,IAAI,CAAC,IAAK,CAACN,KAAK,CAACM,MAAM,GAAG,CAAC,CAAC,IAAI,CAAC,KAAK,CAAE;AACjE;;AAEA;AACO,SAASO,SAASA,CAACb,KAAK,EAAEM,MAAM,EACvC;AACI,EAAA,OAAQ,CAACN,KAAK,CAACM,MAAM,CAAC,IAAI,CAAC,IAAI,OAAO,IAAK,CAACN,KAAK,CAACM,MAAM,GAAG,CAAC,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC,IAAIN,KAAK,CAACM,MAAM,GAAG,CAAC,CAAC,IAAI,CAAC,CAAC;AACxG;;AAEA;AACO,SAASQ,SAASA,CAACd,KAAK,EAAEM,MAAM,EACvC;AACI,EAAA,OAAO,CAACN,KAAK,CAACM,MAAM,CAAC,IAAI,CAAC,KAAK,CAACN,KAAK,CAACM,MAAM,GAAG,CAAC,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC,GAAI,CAACN,KAAK,CAACM,MAAM,GAAG,CAAC,CAAC,IAAI,CAAC,IAAI,OAAQ;AACxG;;AAEA;AACO,SAASS,SAASA,CAACf,KAAK,EAAEM,MAAM,EACvC;EACI,OAAS,CAACN,KAAK,CAACM,MAAM,CAAC,IAAI,CAAC,IAAI,SAAS,IAClC,CAACN,KAAK,CAACM,MAAM,GAAG,CAAC,CAAC,IAAI,CAAC,KAAK,EAAE,CAAC,IAC/B,CAACN,KAAK,CAACM,MAAM,GAAG,CAAC,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC,IAC9BN,KAAK,CAACM,MAAM,GAAG,CAAC,CAAC,IAAI,CAAC,CAAC,KAAM,CAAC;AACzC;;AAEA;AACO,SAASU,SAASA,CAAChB,KAAK,EAAEM,MAAM,EACvC;EACI,OAAQ,CAACN,KAAK,CAACM,MAAM,CAAC,IAAI,CAAC,KACpB,CAACN,KAAK,CAACM,MAAM,GAAG,CAAC,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC,IAC9B,CAACN,KAAK,CAACM,MAAM,GAAG,CAAC,CAAC,IAAI,CAAC,KAAK,EAAE,CAAC,GAC/B,CAACN,KAAK,CAACM,MAAM,GAAG,CAAC,CAAC,IAAI,CAAC,IAAI,SAAU,KAAM,CAAC;AACvD;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACO,SAASW,eAAeA,CAAC7B,KAAK,EACrC;EACI,MAAM8B,IAAI,GAAG,IAAIC,QAAQ,CAAC,IAAI5B,WAAW,CAAC,CAAC,CAAC,CAAC;EAC7C2B,IAAI,CAACE,SAAS,CAAC,CAAC,EAAEhC,KAAK,KAAK,CAAC,EAAE,IAAI,CAAC;AACpC,EAAA,OAAO8B,IAAI,CAACG,UAAU,CAAC,CAAC,EAAE,IAAI,CAAC;AACnC;;;;"}
+{"version":3,"file":"bytes.js","sources":["../../../../src/global/utils/bytes.js"],"sourcesContent":["/** Returns a zero-copy Uint8Array view over supported byte input. */\n// One reused conversion view. `hash.js` keeps its own for the same reason:\n// these run per record, and allocating a 4-byte ArrayBuffer each time is\n// pure garbage for a value that is read immediately and never retained.\nconst scratch = new DataView(new ArrayBuffer(4));\n\nexport function asUint8Array(value, label = \"value\")\n{\n    if (value instanceof Uint8Array)\n    {\n        return value;\n    }\n\n    if (value instanceof ArrayBuffer)\n    {\n        return new Uint8Array(value);\n    }\n\n    if (ArrayBuffer.isView(value))\n    {\n        return new Uint8Array(value.buffer, value.byteOffset, value.byteLength);\n    }\n\n    throw new TypeError(`${label} must be a Uint8Array, ArrayBuffer, or ArrayBuffer view.`);\n}\n\n/** Returns an owned copy of supported byte input. */\nexport function copyBytes(value, label = \"value\")\n{\n    return asUint8Array(value, label).slice();\n}\n\n/** Copies exactly the visible byte range into a standalone ArrayBuffer. */\nexport function toArrayBuffer(value, label = \"value\")\n{\n    const bytes = asUint8Array(value, label);\n\n    return bytes.buffer.slice(bytes.byteOffset, bytes.byteOffset + bytes.byteLength);\n}\n\n/** Tests whether byte input starts with the complete supplied prefix. */\nexport function hasBytePrefix(value, prefix)\n{\n    const bytes = asUint8Array(value, \"value\");\n    const expected = asUint8Array(prefix, \"prefix\");\n\n    if (bytes.byteLength < expected.byteLength)\n    {\n        return false;\n    }\n\n    for (let index = 0; index < expected.byteLength; index++)\n    {\n        if (bytes[index] !== expected[index])\n        {\n            return false;\n        }\n    }\n\n    return true;\n}\n\n/**\n * Reads a fixed-length ASCII tag, as container formats use for chunk names.\n *\n * Missing bytes read as zero rather than throwing, because a truncated tag is\n * a failed match at the call site, not an error in the read.\n *\n * @param {Uint8Array} bytes Source bytes.\n * @param {number} offset Byte offset to read from.\n * @param {number} [length=4] Tag length in bytes.\n * @returns {string} The decoded tag.\n */\nexport function readFourCc(bytes, offset, length = 4)\n{\n    let value = \"\";\n    for (let i = 0; i < length; i++) value += String.fromCharCode(bytes[offset + i] || 0);\n    return value;\n}\n\n// Container formats read fixed-width big- and little-endian integers\n// constantly, and every reader had grown its own copy. Missing bytes read as\n// zero, matching what the shifting forms already did: `>>> 0` turns the NaN a\n// truncated multiply produces back into a number, so only the two flac copies\n// that omitted it ever returned NaN, and flac bounds-checks before every read.\n\n/** Reads an unsigned big-endian 16-bit integer. */\nexport function readU16BE(bytes, offset)\n{\n    return ((bytes[offset] || 0) << 8) | (bytes[offset + 1] || 0);\n}\n\n/** Reads an unsigned little-endian 16-bit integer. */\nexport function readU16LE(bytes, offset)\n{\n    return (bytes[offset] || 0) | ((bytes[offset + 1] || 0) << 8);\n}\n\n/** Reads an unsigned big-endian 24-bit integer. */\nexport function readU24BE(bytes, offset)\n{\n    return ((bytes[offset] || 0) * 0x10000) + ((bytes[offset + 1] || 0) << 8) + (bytes[offset + 2] || 0);\n}\n\n/** Reads an unsigned little-endian 24-bit integer. */\nexport function readU24LE(bytes, offset)\n{\n    return (bytes[offset] || 0) + ((bytes[offset + 1] || 0) << 8) + ((bytes[offset + 2] || 0) * 0x10000);\n}\n\n/** Reads an unsigned big-endian 32-bit integer. */\nexport function readU32BE(bytes, offset)\n{\n    return (((bytes[offset] || 0) * 0x1000000)\n        + ((bytes[offset + 1] || 0) << 16)\n        + ((bytes[offset + 2] || 0) << 8)\n        + (bytes[offset + 3] || 0)) >>> 0;\n}\n\n/** Reads an unsigned little-endian 32-bit integer. */\nexport function readU32LE(bytes, offset)\n{\n    return ((bytes[offset] || 0)\n        + ((bytes[offset + 1] || 0) << 8)\n        + ((bytes[offset + 2] || 0) << 16)\n        + ((bytes[offset + 3] || 0) * 0x1000000)) >>> 0;\n}\n\n/**\n * Reinterprets the bits of an unsigned 32-bit integer as a float32.\n *\n * Carbon stores float-valued render states and annotation payloads as raw\n * uint32 bit patterns, so a consumer that needs the number rather than the\n * pattern must reinterpret rather than convert.\n *\n * @param {number} value Unsigned 32-bit integer containing float bits.\n * @returns {number} Float value represented by the same bits.\n */\nexport function float32FromBits(value)\n{\n    scratch.setUint32(0, value >>> 0, true);\n    return scratch.getFloat32(0, true);\n}\n\n/**\n * The bit pattern of a 32-bit float.\n *\n * The inverse of `float32FromBits`, and the reason both live here: a caller that\n * round-trips a float through its bits needs the two halves to agree about byte\n * order, and two modules each owning one half is how they stop agreeing.\n *\n * @param {number} value Float value.\n * @returns {number} Unsigned 32-bit pattern encoding that float.\n */\nexport function float32ToBits(value)\n{\n    scratch.setFloat32(0, value, true);\n    return scratch.getUint32(0, true);\n}\n"],"names":["scratch","DataView","ArrayBuffer","asUint8Array","value","label","Uint8Array","isView","buffer","byteOffset","byteLength","TypeError","copyBytes","slice","toArrayBuffer","bytes","hasBytePrefix","prefix","expected","index","readFourCc","offset","length","i","String","fromCharCode","readU16BE","readU16LE","readU24BE","readU24LE","readU32BE","readU32LE","float32FromBits","setUint32","getFloat32","float32ToBits","setFloat32","getUint32"],"mappings":"AAAA;AACA;AACA;AACA;AACA,MAAMA,OAAO,GAAG,IAAIC,QAAQ,CAAC,IAAIC,WAAW,CAAC,CAAC,CAAC,CAAC;AAEzC,SAASC,YAAYA,CAACC,KAAK,EAAEC,KAAK,GAAG,OAAO,EACnD;EACI,IAAID,KAAK,YAAYE,UAAU,EAC/B;AACI,IAAA,OAAOF,KAAK;AAChB,EAAA;EAEA,IAAIA,KAAK,YAAYF,WAAW,EAChC;AACI,IAAA,OAAO,IAAII,UAAU,CAACF,KAAK,CAAC;AAChC,EAAA;AAEA,EAAA,IAAIF,WAAW,CAACK,MAAM,CAACH,KAAK,CAAC,EAC7B;AACI,IAAA,OAAO,IAAIE,UAAU,CAACF,KAAK,CAACI,MAAM,EAAEJ,KAAK,CAACK,UAAU,EAAEL,KAAK,CAACM,UAAU,CAAC;AAC3E,EAAA;AAEA,EAAA,MAAM,IAAIC,SAAS,CAAC,CAAA,EAAGN,KAAK,0DAA0D,CAAC;AAC3F;;AAEA;AACO,SAASO,SAASA,CAACR,KAAK,EAAEC,KAAK,GAAG,OAAO,EAChD;EACI,OAAOF,YAAY,CAACC,KAAK,EAAEC,KAAK,CAAC,CAACQ,KAAK,EAAE;AAC7C;;AAEA;AACO,SAASC,aAAaA,CAACV,KAAK,EAAEC,KAAK,GAAG,OAAO,EACpD;AACI,EAAA,MAAMU,KAAK,GAAGZ,YAAY,CAACC,KAAK,EAAEC,KAAK,CAAC;AAExC,EAAA,OAAOU,KAAK,CAACP,MAAM,CAACK,KAAK,CAACE,KAAK,CAACN,UAAU,EAAEM,KAAK,CAACN,UAAU,GAAGM,KAAK,CAACL,UAAU,CAAC;AACpF;;AAEA;AACO,SAASM,aAAaA,CAACZ,KAAK,EAAEa,MAAM,EAC3C;AACI,EAAA,MAAMF,KAAK,GAAGZ,YAAY,CAACC,KAAK,EAAE,OAAO,CAAC;AAC1C,EAAA,MAAMc,QAAQ,GAAGf,YAAY,CAACc,MAAM,EAAE,QAAQ,CAAC;AAE/C,EAAA,IAAIF,KAAK,CAACL,UAAU,GAAGQ,QAAQ,CAACR,UAAU,EAC1C;AACI,IAAA,OAAO,KAAK;AAChB,EAAA;AAEA,EAAA,KAAK,IAAIS,KAAK,GAAG,CAAC,EAAEA,KAAK,GAAGD,QAAQ,CAACR,UAAU,EAAES,KAAK,EAAE,EACxD;IACI,IAAIJ,KAAK,CAACI,KAAK,CAAC,KAAKD,QAAQ,CAACC,KAAK,CAAC,EACpC;AACI,MAAA,OAAO,KAAK;AAChB,IAAA;AACJ,EAAA;AAEA,EAAA,OAAO,IAAI;AACf;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACO,SAASC,UAAUA,CAACL,KAAK,EAAEM,MAAM,EAAEC,MAAM,GAAG,CAAC,EACpD;EACI,IAAIlB,KAAK,GAAG,EAAE;EACd,KAAK,IAAImB,CAAC,GAAG,CAAC,EAAEA,CAAC,GAAGD,MAAM,EAAEC,CAAC,EAAE,EAAEnB,KAAK,IAAIoB,MAAM,CAACC,YAAY,CAACV,KAAK,CAACM,MAAM,GAAGE,CAAC,CAAC,IAAI,CAAC,CAAC;AACrF,EAAA,OAAOnB,KAAK;AAChB;;AAEA;AACA;AACA;AACA;AACA;;AAEA;AACO,SAASsB,SAASA,CAACX,KAAK,EAAEM,MAAM,EACvC;AACI,EAAA,OAAQ,CAACN,KAAK,CAACM,MAAM,CAAC,IAAI,CAAC,KAAK,CAAC,IAAKN,KAAK,CAACM,MAAM,GAAG,CAAC,CAAC,IAAI,CAAC,CAAC;AACjE;;AAEA;AACO,SAASM,SAASA,CAACZ,KAAK,EAAEM,MAAM,EACvC;AACI,EAAA,OAAO,CAACN,KAAK,CAACM,MAAM,CAAC,IAAI,CAAC,IAAK,CAACN,KAAK,CAACM,MAAM,GAAG,CAAC,CAAC,IAAI,CAAC,KAAK,CAAE;AACjE;;AAEA;AACO,SAASO,SAASA,CAACb,KAAK,EAAEM,MAAM,EACvC;AACI,EAAA,OAAQ,CAACN,KAAK,CAACM,MAAM,CAAC,IAAI,CAAC,IAAI,OAAO,IAAK,CAACN,KAAK,CAACM,MAAM,GAAG,CAAC,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC,IAAIN,KAAK,CAACM,MAAM,GAAG,CAAC,CAAC,IAAI,CAAC,CAAC;AACxG;;AAEA;AACO,SAASQ,SAASA,CAACd,KAAK,EAAEM,MAAM,EACvC;AACI,EAAA,OAAO,CAACN,KAAK,CAACM,MAAM,CAAC,IAAI,CAAC,KAAK,CAACN,KAAK,CAACM,MAAM,GAAG,CAAC,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC,GAAI,CAACN,KAAK,CAACM,MAAM,GAAG,CAAC,CAAC,IAAI,CAAC,IAAI,OAAQ;AACxG;;AAEA;AACO,SAASS,SAASA,CAACf,KAAK,EAAEM,MAAM,EACvC;EACI,OAAS,CAACN,KAAK,CAACM,MAAM,CAAC,IAAI,CAAC,IAAI,SAAS,IAClC,CAACN,KAAK,CAACM,MAAM,GAAG,CAAC,CAAC,IAAI,CAAC,KAAK,EAAE,CAAC,IAC/B,CAACN,KAAK,CAACM,MAAM,GAAG,CAAC,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC,IAC9BN,KAAK,CAACM,MAAM,GAAG,CAAC,CAAC,IAAI,CAAC,CAAC,KAAM,CAAC;AACzC;;AAEA;AACO,SAASU,SAASA,CAAChB,KAAK,EAAEM,MAAM,EACvC;EACI,OAAQ,CAACN,KAAK,CAACM,MAAM,CAAC,IAAI,CAAC,KACpB,CAACN,KAAK,CAACM,MAAM,GAAG,CAAC,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC,IAC9B,CAACN,KAAK,CAACM,MAAM,GAAG,CAAC,CAAC,IAAI,CAAC,KAAK,EAAE,CAAC,GAC/B,CAACN,KAAK,CAACM,MAAM,GAAG,CAAC,CAAC,IAAI,CAAC,IAAI,SAAU,KAAM,CAAC;AACvD;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACO,SAASW,eAAeA,CAAC5B,KAAK,EACrC;EACIJ,OAAO,CAACiC,SAAS,CAAC,CAAC,EAAE7B,KAAK,KAAK,CAAC,EAAE,IAAI,CAAC;AACvC,EAAA,OAAOJ,OAAO,CAACkC,UAAU,CAAC,CAAC,EAAE,IAAI,CAAC;AACtC;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACO,SAASC,aAAaA,CAAC/B,KAAK,EACnC;EACIJ,OAAO,CAACoC,UAAU,CAAC,CAAC,EAAEhC,KAAK,EAAE,IAAI,CAAC;AAClC,EAAA,OAAOJ,OAAO,CAACqC,SAAS,CAAC,CAAC,EAAE,IAAI,CAAC;AACrC;;;;"}

package/dist/global/utils/checksum.js

@@ -0,0 +1,80 @@
+// The two integrity checksums this runtime computes, in one module named for
+// what they are. Sibling of `hash.js`, and the split between them is the job,
+// not the width: FNV hashes address and identify, these two verify that bytes
+// survived a round trip.
+//
+// ONE IMPLEMENTATION EACH, BECAUSE THERE WAS ONE ALGORITHM EACH. Standard
+// CRC-32 was written three times — `cmf/core/binary.js`, `gr2/core/container.js`
+// and `png/core/writer.js` — with the same reflected polynomial, the same
+// initial value and the same final xor, differing only in whether the table was
+// precomputed and how many range arguments the signature took. Adler-32 was
+// written twice, in `png/core/writer.js` and `fbx/core/helpers.js`.
+//
+// WHAT DOES NOT BELONG HERE, and the distinction `hash.js` already draws:
+// a checksum whose POLYNOMIAL or direction is part of a format's wire contract
+// stays with that format. `wem/core/bitStream.js` computes the Ogg page
+// checksum — forward CRC-32 over polynomial 0x04c11db7, zero initial value, no
+// final xor. It shares a name with the function below and nothing else, and its
+// own comment says so.
+//
+// Nor does the independent copy in `test/.../gr2/writer.test.mjs` belong here.
+// A test that verifies a checksum by importing the implementation it is testing
+// proves only that the function equals itself; that copy is a deliberate oracle
+// and is meant to stay separate.
+
+/** Reflected CRC-32 polynomial, as used by zlib, PNG, GZIP and Carbon's containers. */
+const CRC32_POLYNOMIAL = 0xedb88320;
+
+/** Largest prime below 65536 — Adler-32's modulus. */
+const ADLER32_MODULUS = 65521;
+const CRC32_TABLE = (() => {
+  const table = new Uint32Array(256);
+  for (let index = 0; index < 256; index++) {
+    let value = index;
+    for (let bit = 0; bit < 8; bit++) {
+      value = value & 1 ? CRC32_POLYNOMIAL ^ value >>> 1 : value >>> 1;
+    }
+    table[index] = value >>> 0;
+  }
+  return table;
+})();
+
+/**
+ * Standard CRC-32 over a byte range.
+ *
+ * Reflected polynomial, initial value all ones, final one's complement — the
+ * variant PNG chunks, zlib streams, CMF containers and GR2 sections all use.
+ *
+ * @param {Uint8Array} bytes Source bytes.
+ * @param {number} [start] First byte offset, inclusive.
+ * @param {number} [end] Last byte offset, exclusive.
+ * @returns {number} Unsigned 32-bit checksum.
+ */
+function crc32(bytes, start = 0, end = bytes.length) {
+  let crc = 0xffffffff;
+  for (let index = start; index < end; index++) {
+    crc = crc >>> 8 ^ CRC32_TABLE[(crc ^ bytes[index]) & 0xff];
+  }
+  return (crc ^ 0xffffffff) >>> 0;
+}
+
+/**
+ * Adler-32 over a byte range, as zlib streams carry it.
+ *
+ * @param {Uint8Array} bytes Source bytes.
+ * @param {number} [start] First byte offset, inclusive.
+ * @param {number} [end] Last byte offset, exclusive.
+ * @returns {number} Unsigned 32-bit checksum.
+ */
+function adler32(bytes, start = 0, end = bytes.length) {
+  let a = 1,
+    b = 0;
+  for (let index = start; index < end; index++) {
+    a = (a + bytes[index]) % ADLER32_MODULUS;
+    b = (b + a) % ADLER32_MODULUS;
+  }
+  return (b << 16 >>> 0 | a) >>> 0;
+}
+
+export { adler32, crc32 };
+//# sourceMappingURL=checksum.js.map

package/dist/global/utils/checksum.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"checksum.js","sources":["../../../../src/global/utils/checksum.js"],"sourcesContent":["// The two integrity checksums this runtime computes, in one module named for\n// what they are. Sibling of `hash.js`, and the split between them is the job,\n// not the width: FNV hashes address and identify, these two verify that bytes\n// survived a round trip.\n//\n// ONE IMPLEMENTATION EACH, BECAUSE THERE WAS ONE ALGORITHM EACH. Standard\n// CRC-32 was written three times — `cmf/core/binary.js`, `gr2/core/container.js`\n// and `png/core/writer.js` — with the same reflected polynomial, the same\n// initial value and the same final xor, differing only in whether the table was\n// precomputed and how many range arguments the signature took. Adler-32 was\n// written twice, in `png/core/writer.js` and `fbx/core/helpers.js`.\n//\n// WHAT DOES NOT BELONG HERE, and the distinction `hash.js` already draws:\n// a checksum whose POLYNOMIAL or direction is part of a format's wire contract\n// stays with that format. `wem/core/bitStream.js` computes the Ogg page\n// checksum — forward CRC-32 over polynomial 0x04c11db7, zero initial value, no\n// final xor. It shares a name with the function below and nothing else, and its\n// own comment says so.\n//\n// Nor does the independent copy in `test/.../gr2/writer.test.mjs` belong here.\n// A test that verifies a checksum by importing the implementation it is testing\n// proves only that the function equals itself; that copy is a deliberate oracle\n// and is meant to stay separate.\n\n/** Reflected CRC-32 polynomial, as used by zlib, PNG, GZIP and Carbon's containers. */\nconst CRC32_POLYNOMIAL = 0xedb88320;\n\n/** Largest prime below 65536 — Adler-32's modulus. */\nconst ADLER32_MODULUS = 65521;\n\nconst CRC32_TABLE = (() =>\n{\n    const table = new Uint32Array(256);\n    for (let index = 0; index < 256; index++)\n    {\n        let value = index;\n        for (let bit = 0; bit < 8; bit++)\n        {\n            value = (value & 1) ? (CRC32_POLYNOMIAL ^ (value >>> 1)) : (value >>> 1);\n        }\n        table[index] = value >>> 0;\n    }\n    return table;\n})();\n\n/**\n * Standard CRC-32 over a byte range.\n *\n * Reflected polynomial, initial value all ones, final one's complement — the\n * variant PNG chunks, zlib streams, CMF containers and GR2 sections all use.\n *\n * @param {Uint8Array} bytes Source bytes.\n * @param {number} [start] First byte offset, inclusive.\n * @param {number} [end] Last byte offset, exclusive.\n * @returns {number} Unsigned 32-bit checksum.\n */\nexport function crc32(bytes, start = 0, end = bytes.length)\n{\n    let crc = 0xffffffff;\n    for (let index = start; index < end; index++)\n    {\n        crc = (crc >>> 8) ^ CRC32_TABLE[(crc ^ bytes[index]) & 0xff];\n    }\n    return (crc ^ 0xffffffff) >>> 0;\n}\n\n/**\n * Adler-32 over a byte range, as zlib streams carry it.\n *\n * @param {Uint8Array} bytes Source bytes.\n * @param {number} [start] First byte offset, inclusive.\n * @param {number} [end] Last byte offset, exclusive.\n * @returns {number} Unsigned 32-bit checksum.\n */\nexport function adler32(bytes, start = 0, end = bytes.length)\n{\n    let\n        a = 1,\n        b = 0;\n\n    for (let index = start; index < end; index++)\n    {\n        a = (a + bytes[index]) % ADLER32_MODULUS;\n        b = (b + a) % ADLER32_MODULUS;\n    }\n\n    return (((b << 16) >>> 0) | a) >>> 0;\n}\n"],"names":["CRC32_POLYNOMIAL","ADLER32_MODULUS","CRC32_TABLE","table","Uint32Array","index","value","bit","crc32","bytes","start","end","length","crc","adler32","a","b"],"mappings":"AAAA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA,MAAMA,gBAAgB,GAAG,UAAU;;AAEnC;AACA,MAAMC,eAAe,GAAG,KAAK;AAE7B,MAAMC,WAAW,GAAG,CAAC,MACrB;AACI,EAAA,MAAMC,KAAK,GAAG,IAAIC,WAAW,CAAC,GAAG,CAAC;EAClC,KAAK,IAAIC,KAAK,GAAG,CAAC,EAAEA,KAAK,GAAG,GAAG,EAAEA,KAAK,EAAE,EACxC;IACI,IAAIC,KAAK,GAAGD,KAAK;IACjB,KAAK,IAAIE,GAAG,GAAG,CAAC,EAAEA,GAAG,GAAG,CAAC,EAAEA,GAAG,EAAE,EAChC;AACID,MAAAA,KAAK,GAAIA,KAAK,GAAG,CAAC,GAAKN,gBAAgB,GAAIM,KAAK,KAAK,CAAE,GAAKA,KAAK,KAAK,CAAE;AAC5E,IAAA;AACAH,IAAAA,KAAK,CAACE,KAAK,CAAC,GAAGC,KAAK,KAAK,CAAC;AAC9B,EAAA;AACA,EAAA,OAAOH,KAAK;AAChB,CAAC,GAAG;;AAEJ;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACO,SAASK,KAAKA,CAACC,KAAK,EAAEC,KAAK,GAAG,CAAC,EAAEC,GAAG,GAAGF,KAAK,CAACG,MAAM,EAC1D;EACI,IAAIC,GAAG,GAAG,UAAU;EACpB,KAAK,IAAIR,KAAK,GAAGK,KAAK,EAAEL,KAAK,GAAGM,GAAG,EAAEN,KAAK,EAAE,EAC5C;AACIQ,IAAAA,GAAG,GAAIA,GAAG,KAAK,CAAC,GAAIX,WAAW,CAAC,CAACW,GAAG,GAAGJ,KAAK,CAACJ,KAAK,CAAC,IAAI,IAAI,CAAC;AAChE,EAAA;AACA,EAAA,OAAO,CAACQ,GAAG,GAAG,UAAU,MAAM,CAAC;AACnC;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACO,SAASC,OAAOA,CAACL,KAAK,EAAEC,KAAK,GAAG,CAAC,EAAEC,GAAG,GAAGF,KAAK,CAACG,MAAM,EAC5D;EACI,IACIG,CAAC,GAAG,CAAC;AACLC,IAAAA,CAAC,GAAG,CAAC;EAET,KAAK,IAAIX,KAAK,GAAGK,KAAK,EAAEL,KAAK,GAAGM,GAAG,EAAEN,KAAK,EAAE,EAC5C;IACIU,CAAC,GAAG,CAACA,CAAC,GAAGN,KAAK,CAACJ,KAAK,CAAC,IAAIJ,eAAe;AACxCe,IAAAA,CAAC,GAAG,CAACA,CAAC,GAAGD,CAAC,IAAId,eAAe;AACjC,EAAA;EAEA,OAAO,CAAGe,CAAC,IAAI,EAAE,KAAM,CAAC,GAAID,CAAC,MAAM,CAAC;AACxC;;;;"}

package/dist/global/utils/errors/CjsCancellationError.js

@@ -0,0 +1,36 @@
+import { CjsError } from './CjsError.js';
+
+const DEFAULT_CANCELLATION_MESSAGE = "The operation was cancelled.";
+const CJS_OPERATION_CANCELLED = "CJS_OPERATION_CANCELLED";
+
+/** Represents one cancelled operation using Web-compatible abort identity. */
+class CjsCancellationError extends CjsError {
+  /**
+   * Creates a cancellation error with stable code `CJS_OPERATION_CANCELLED`.
+   *
+   * @param {string} [message]
+   * @param {{cause?: *, details?: object|null}} [options]
+   */
+  constructor(message = DEFAULT_CANCELLATION_MESSAGE, options = {}) {
+    super(CJS_OPERATION_CANCELLED, message, options);
+    this.name = "AbortError";
+  }
+
+  /**
+   * Checks for this cancellation type, its stable code, or a platform
+   * `AbortError` name.
+   */
+  static is(error) {
+    if (CjsError.hasCode(error, CJS_OPERATION_CANCELLED)) {
+      return true;
+    }
+    try {
+      return error?.name === "AbortError";
+    } catch {
+      return false;
+    }
+  }
+}
+
+export { CJS_OPERATION_CANCELLED, CjsCancellationError };
+//# sourceMappingURL=CjsCancellationError.js.map

package/dist/global/utils/errors/CjsCancellationError.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"CjsCancellationError.js","sources":["../../../../../src/global/utils/errors/CjsCancellationError.js"],"sourcesContent":["import { CjsError } from \"./CjsError.js\";\r\n\r\n\r\nconst DEFAULT_CANCELLATION_MESSAGE = \"The operation was cancelled.\";\r\n\r\nexport const CJS_OPERATION_CANCELLED = \"CJS_OPERATION_CANCELLED\";\r\n\r\n\r\n\r\n/** Represents one cancelled operation using Web-compatible abort identity. */\r\nexport class CjsCancellationError extends CjsError\r\n{\r\n\r\n    /**\r\n     * Creates a cancellation error with stable code `CJS_OPERATION_CANCELLED`.\r\n     *\r\n     * @param {string} [message]\r\n     * @param {{cause?: *, details?: object|null}} [options]\r\n     */\r\n    constructor(message = DEFAULT_CANCELLATION_MESSAGE, options = {})\r\n    {\r\n        super(CJS_OPERATION_CANCELLED, message, options);\r\n        this.name = \"AbortError\";\r\n    }\r\n\r\n    /**\r\n     * Checks for this cancellation type, its stable code, or a platform\r\n     * `AbortError` name.\r\n     */\r\n    static is(error)\r\n    {\r\n        if (CjsError.hasCode(error, CJS_OPERATION_CANCELLED))\r\n        {\r\n            return true;\r\n        }\r\n\r\n        try\r\n        {\r\n            return error?.name === \"AbortError\";\r\n        }\r\n        catch\r\n        {\r\n            return false;\r\n        }\r\n    }\r\n\r\n}\r\n"],"names":["DEFAULT_CANCELLATION_MESSAGE","CJS_OPERATION_CANCELLED","CjsCancellationError","CjsError","constructor","message","options","name","is","error","hasCode"],"mappings":";;AAGA,MAAMA,4BAA4B,GAAG,8BAA8B;AAE5D,MAAMC,uBAAuB,GAAG;;AAIvC;AACO,MAAMC,oBAAoB,SAASC,QAAQ,CAClD;AAEI;AACJ;AACA;AACA;AACA;AACA;EACIC,WAAWA,CAACC,OAAO,GAAGL,4BAA4B,EAAEM,OAAO,GAAG,EAAE,EAChE;AACI,IAAA,KAAK,CAACL,uBAAuB,EAAEI,OAAO,EAAEC,OAAO,CAAC;IAChD,IAAI,CAACC,IAAI,GAAG,YAAY;AAC5B,EAAA;;AAEA;AACJ;AACA;AACA;EACI,OAAOC,EAAEA,CAACC,KAAK,EACf;IACI,IAAIN,QAAQ,CAACO,OAAO,CAACD,KAAK,EAAER,uBAAuB,CAAC,EACpD;AACI,MAAA,OAAO,IAAI;AACf,IAAA;IAEA,IACA;AACI,MAAA,OAAOQ,KAAK,EAAEF,IAAI,KAAK,YAAY;AACvC,IAAA,CAAC,CACD,MACA;AACI,MAAA,OAAO,KAAK;AAChB,IAAA;AACJ,EAAA;AAEJ;;;;"}