@editor-x/wme-logstream 0.1.0-alpha.1

package/dist/index.iife.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"index.iife.js","sources":["../node_modules/jsondiffpatch/lib/clone.js","../node_modules/jsondiffpatch/lib/contexts/context.js","../node_modules/jsondiffpatch/lib/assertions/arrays.js","../node_modules/jsondiffpatch/lib/contexts/diff.js","../node_modules/jsondiffpatch/lib/contexts/patch.js","../node_modules/jsondiffpatch/lib/contexts/reverse.js","../node_modules/jsondiffpatch/lib/pipe.js","../node_modules/jsondiffpatch/lib/processor.js","../node_modules/jsondiffpatch/lib/filters/lcs.js","../node_modules/jsondiffpatch/lib/filters/arrays.js","../node_modules/jsondiffpatch/lib/filters/dates.js","../node_modules/jsondiffpatch/lib/filters/nested.js","../node_modules/jsondiffpatch/lib/filters/texts.js","../node_modules/jsondiffpatch/lib/filters/trivial.js","../node_modules/jsondiffpatch/lib/diffpatcher.js","../src/core/Dispatcher.ts","../src/pipes/BasePipe.ts","../src/pipes/ConsolePipe.ts","../src/pipes/IndexedDBPipe.ts","../src/utils/idb.ts","../src/storage/IndexedDBManager.ts","../src/utils/EventChannel.ts","../src/storage/SessionManager.ts","../src/utils/session.ts","../src/utils/window.ts","../node_modules/fflate/esm/browser.js","../src/storage/ZipStreamer.ts","../src/core/LogStream.ts","../node_modules/jsondiffpatch/lib/index.js"],"sourcesContent":["function cloneRegExp(re) {\n    var _a;\n    const regexMatch = /^\\/(.*)\\/([gimyu]*)$/.exec(re.toString());\n    if (!regexMatch) {\n        throw new Error(\"Invalid RegExp\");\n    }\n    return new RegExp((_a = regexMatch[1]) !== null && _a !== void 0 ? _a : \"\", regexMatch[2]);\n}\nexport default function clone(arg) {\n    if (typeof arg !== \"object\") {\n        return arg;\n    }\n    if (arg === null) {\n        return null;\n    }\n    if (Array.isArray(arg)) {\n        return arg.map(clone);\n    }\n    if (arg instanceof Date) {\n        return new Date(arg.getTime());\n    }\n    if (arg instanceof RegExp) {\n        return cloneRegExp(arg);\n    }\n    const cloned = {};\n    for (const name in arg) {\n        if (Object.prototype.hasOwnProperty.call(arg, name)) {\n            cloned[name] = clone(arg[name]);\n        }\n    }\n    return cloned;\n}\n","import { assertNonEmptyArray, lastNonEmpty } from \"../assertions/arrays.js\";\nexport default class Context {\n    setResult(result) {\n        this.result = result;\n        this.hasResult = true;\n        return this;\n    }\n    exit() {\n        this.exiting = true;\n        return this;\n    }\n    push(child, name) {\n        child.parent = this;\n        if (typeof name !== \"undefined\") {\n            child.childName = name;\n        }\n        child.root = this.root || this;\n        child.options = child.options || this.options;\n        if (!this.children) {\n            this.children = [child];\n            this.nextAfterChildren = this.next || null;\n            this.next = child;\n        }\n        else {\n            assertNonEmptyArray(this.children);\n            lastNonEmpty(this.children).next = child;\n            this.children.push(child);\n        }\n        child.next = this;\n        return this;\n    }\n}\n","export function assertNonEmptyArray(arr, message) {\n    if (arr.length === 0) {\n        throw new Error(message || \"Expected a non-empty array\");\n    }\n}\nexport function assertArrayHasExactly2(arr, message) {\n    if (arr.length !== 2) {\n        throw new Error(message || \"Expected an array with exactly 2 items\");\n    }\n}\nexport function assertArrayHasExactly1(arr, message) {\n    if (arr.length !== 1) {\n        throw new Error(message || \"Expected an array with exactly 1 item\");\n    }\n}\nexport function assertArrayHasAtLeast2(arr, message) {\n    if (arr.length < 2) {\n        throw new Error(message || \"Expected an array with at least 2 items\");\n    }\n}\nexport function isNonEmptyArray(arr) {\n    return arr.length > 0;\n}\nexport function isArrayWithAtLeast2(arr) {\n    return arr.length >= 2;\n}\nexport function isArrayWithAtLeast3(arr) {\n    return arr.length >= 3;\n}\nexport function isArrayWithExactly1(arr) {\n    return arr.length === 1;\n}\nexport function isArrayWithExactly2(arr) {\n    return arr.length === 2;\n}\nexport function isArrayWithExactly3(arr) {\n    return arr.length === 3;\n}\n/**\n * type-safe version of `arr[arr.length - 1]`\n * @param arr a non empty array\n * @returns the last element of the array\n */\nexport const lastNonEmpty = (arr) => arr[arr.length - 1];\n","import defaultClone from \"../clone.js\";\nimport Context from \"./context.js\";\nclass DiffContext extends Context {\n    constructor(left, right) {\n        super();\n        this.left = left;\n        this.right = right;\n        this.pipe = \"diff\";\n    }\n    prepareDeltaResult(result) {\n        var _a, _b, _c, _d;\n        if (typeof result === \"object\") {\n            if (((_a = this.options) === null || _a === void 0 ? void 0 : _a.omitRemovedValues) &&\n                Array.isArray(result) &&\n                result.length > 1 &&\n                (result.length === 2 || // modified\n                    result[2] === 0 || // deleted\n                    result[2] === 3) // moved\n            ) {\n                // omit the left/old value (this delta will be more compact but irreversible)\n                result[0] = 0;\n            }\n            if ((_b = this.options) === null || _b === void 0 ? void 0 : _b.cloneDiffValues) {\n                const clone = typeof ((_c = this.options) === null || _c === void 0 ? void 0 : _c.cloneDiffValues) === \"function\"\n                    ? (_d = this.options) === null || _d === void 0 ? void 0 : _d.cloneDiffValues\n                    : defaultClone;\n                if (typeof result[0] === \"object\") {\n                    result[0] = clone(result[0]);\n                }\n                if (typeof result[1] === \"object\") {\n                    result[1] = clone(result[1]);\n                }\n            }\n        }\n        return result;\n    }\n    setResult(result) {\n        this.prepareDeltaResult(result);\n        return super.setResult(result);\n    }\n}\nexport default DiffContext;\n","import Context from \"./context.js\";\nclass PatchContext extends Context {\n    constructor(left, delta) {\n        super();\n        this.left = left;\n        this.delta = delta;\n        this.pipe = \"patch\";\n    }\n}\nexport default PatchContext;\n","import Context from \"./context.js\";\nclass ReverseContext extends Context {\n    constructor(delta) {\n        super();\n        this.delta = delta;\n        this.pipe = \"reverse\";\n    }\n}\nexport default ReverseContext;\n","// eslint-disable-next-line @typescript-eslint/no-explicit-any\nclass Pipe {\n    constructor(name) {\n        this.name = name;\n        this.filters = [];\n    }\n    process(input) {\n        if (!this.processor) {\n            throw new Error(\"add this pipe to a processor before using it\");\n        }\n        const debug = this.debug;\n        const length = this.filters.length;\n        const context = input;\n        for (let index = 0; index < length; index++) {\n            const filter = this.filters[index];\n            if (!filter)\n                continue;\n            if (debug) {\n                this.log(`filter: ${filter.filterName}`);\n            }\n            filter(context);\n            if (typeof context === \"object\" && context.exiting) {\n                context.exiting = false;\n                break;\n            }\n        }\n        if (!context.next && this.resultCheck) {\n            this.resultCheck(context);\n        }\n    }\n    log(msg) {\n        console.log(`[jsondiffpatch] ${this.name} pipe, ${msg}`);\n    }\n    append(...args) {\n        this.filters.push(...args);\n        return this;\n    }\n    prepend(...args) {\n        this.filters.unshift(...args);\n        return this;\n    }\n    indexOf(filterName) {\n        if (!filterName) {\n            throw new Error(\"a filter name is required\");\n        }\n        for (let index = 0; index < this.filters.length; index++) {\n            const filter = this.filters[index];\n            if ((filter === null || filter === void 0 ? void 0 : filter.filterName) === filterName) {\n                return index;\n            }\n        }\n        throw new Error(`filter not found: ${filterName}`);\n    }\n    list() {\n        return this.filters.map((f) => f.filterName);\n    }\n    after(filterName, ...params) {\n        const index = this.indexOf(filterName);\n        this.filters.splice(index + 1, 0, ...params);\n        return this;\n    }\n    before(filterName, ...params) {\n        const index = this.indexOf(filterName);\n        this.filters.splice(index, 0, ...params);\n        return this;\n    }\n    replace(filterName, ...params) {\n        const index = this.indexOf(filterName);\n        this.filters.splice(index, 1, ...params);\n        return this;\n    }\n    remove(filterName) {\n        const index = this.indexOf(filterName);\n        this.filters.splice(index, 1);\n        return this;\n    }\n    clear() {\n        this.filters.length = 0;\n        return this;\n    }\n    shouldHaveResult(should) {\n        if (should === false) {\n            this.resultCheck = null;\n            return this;\n        }\n        if (this.resultCheck) {\n            return this;\n        }\n        this.resultCheck = (context) => {\n            if (!context.hasResult) {\n                console.log(context);\n                const error = new Error(`${this.name} failed`);\n                error.noResult = true;\n                throw error;\n            }\n        };\n        return this;\n    }\n}\nexport default Pipe;\n","class Processor {\n    constructor(options) {\n        this.selfOptions = options || {};\n        this.pipes = {};\n    }\n    options(options) {\n        if (options) {\n            this.selfOptions = options;\n        }\n        return this.selfOptions;\n    }\n    pipe(name, pipeArg) {\n        let pipe = pipeArg;\n        if (typeof name === \"string\") {\n            if (typeof pipe === \"undefined\") {\n                return this.pipes[name];\n            }\n            this.pipes[name] = pipe;\n        }\n        if (name && name.name) {\n            pipe = name;\n            if (pipe.processor === this) {\n                return pipe;\n            }\n            this.pipes[pipe.name] = pipe;\n        }\n        if (!pipe) {\n            throw new Error(`pipe is not defined: ${name}`);\n        }\n        pipe.processor = this;\n        return pipe;\n    }\n    // eslint-disable-next-line @typescript-eslint/no-explicit-any\n    process(input, pipe) {\n        let context = input;\n        context.options = this.options();\n        let nextPipe = pipe || input.pipe || \"default\";\n        let lastPipe = undefined;\n        while (nextPipe) {\n            if (typeof context.nextAfterChildren !== \"undefined\") {\n                // children processed and coming back to parent\n                context.next = context.nextAfterChildren;\n                context.nextAfterChildren = null;\n            }\n            if (typeof nextPipe === \"string\") {\n                nextPipe = this.pipe(nextPipe);\n            }\n            nextPipe.process(context);\n            lastPipe = nextPipe;\n            nextPipe = null;\n            if (context) {\n                if (context.next) {\n                    context = context.next;\n                    nextPipe = context.pipe || lastPipe;\n                }\n            }\n        }\n        // eslint-disable-next-line @typescript-eslint/no-unsafe-return\n        return context.hasResult ? context.result : undefined;\n    }\n}\nexport default Processor;\n","/*\n\nLCS implementation that supports arrays or strings\n\nreference: http://en.wikipedia.org/wiki/Longest_common_subsequence_problem\n\n*/\nconst defaultMatch = (array1, array2, index1, index2) => array1[index1] === array2[index2];\nconst lengthMatrix = (array1, array2, match, context) => {\n    var _a, _b, _c;\n    const len1 = array1.length;\n    const len2 = array2.length;\n    let x;\n    let y;\n    // initialize empty matrix of len1+1 x len2+1\n    const matrix = new Array(len1 + 1);\n    for (x = 0; x < len1 + 1; x++) {\n        const matrixNewRow = new Array(len2 + 1);\n        for (y = 0; y < len2 + 1; y++) {\n            matrixNewRow[y] = 0;\n        }\n        matrix[x] = matrixNewRow;\n    }\n    matrix.match = match;\n    // save sequence lengths for each coordinate\n    for (x = 1; x < len1 + 1; x++) {\n        const matrixRowX = matrix[x];\n        if (matrixRowX === undefined) {\n            throw new Error(\"LCS matrix row is undefined\");\n        }\n        const matrixRowBeforeX = matrix[x - 1];\n        if (matrixRowBeforeX === undefined) {\n            throw new Error(\"LCS matrix row is undefined\");\n        }\n        for (y = 1; y < len2 + 1; y++) {\n            if (match(array1, array2, x - 1, y - 1, context)) {\n                matrixRowX[y] = ((_a = matrixRowBeforeX[y - 1]) !== null && _a !== void 0 ? _a : 0) + 1;\n            }\n            else {\n                matrixRowX[y] = Math.max((_b = matrixRowBeforeX[y]) !== null && _b !== void 0 ? _b : 0, (_c = matrixRowX[y - 1]) !== null && _c !== void 0 ? _c : 0);\n            }\n        }\n    }\n    return matrix;\n};\nconst backtrack = (matrix, array1, array2, context) => {\n    let index1 = array1.length;\n    let index2 = array2.length;\n    const subsequence = {\n        sequence: [],\n        indices1: [],\n        indices2: [],\n    };\n    while (index1 !== 0 && index2 !== 0) {\n        if (matrix.match === undefined) {\n            throw new Error(\"LCS matrix match function is undefined\");\n        }\n        const sameLetter = matrix.match(array1, array2, index1 - 1, index2 - 1, context);\n        if (sameLetter) {\n            subsequence.sequence.unshift(array1[index1 - 1]);\n            subsequence.indices1.unshift(index1 - 1);\n            subsequence.indices2.unshift(index2 - 1);\n            --index1;\n            --index2;\n        }\n        else {\n            const matrixRowIndex1 = matrix[index1];\n            if (matrixRowIndex1 === undefined) {\n                throw new Error(\"LCS matrix row is undefined\");\n            }\n            const valueAtMatrixAbove = matrixRowIndex1[index2 - 1];\n            if (valueAtMatrixAbove === undefined) {\n                throw new Error(\"LCS matrix value is undefined\");\n            }\n            const matrixRowBeforeIndex1 = matrix[index1 - 1];\n            if (matrixRowBeforeIndex1 === undefined) {\n                throw new Error(\"LCS matrix row is undefined\");\n            }\n            const valueAtMatrixLeft = matrixRowBeforeIndex1[index2];\n            if (valueAtMatrixLeft === undefined) {\n                throw new Error(\"LCS matrix value is undefined\");\n            }\n            if (valueAtMatrixAbove > valueAtMatrixLeft) {\n                --index2;\n            }\n            else {\n                --index1;\n            }\n        }\n    }\n    return subsequence;\n};\nconst get = (array1, array2, match, context) => {\n    const innerContext = context || {};\n    const matrix = lengthMatrix(array1, array2, match || defaultMatch, innerContext);\n    return backtrack(matrix, array1, array2, innerContext);\n};\nexport default {\n    get,\n};\n","import DiffContext from \"../contexts/diff.js\";\nimport PatchContext from \"../contexts/patch.js\";\nimport ReverseContext from \"../contexts/reverse.js\";\nimport lcs from \"./lcs.js\";\nconst ARRAY_MOVE = 3;\nfunction arraysHaveMatchByRef(array1, array2, len1, len2) {\n    for (let index1 = 0; index1 < len1; index1++) {\n        const val1 = array1[index1];\n        for (let index2 = 0; index2 < len2; index2++) {\n            const val2 = array2[index2];\n            if (index1 !== index2 && val1 === val2) {\n                return true;\n            }\n        }\n    }\n    return false;\n}\nfunction matchItems(array1, array2, index1, index2, context) {\n    const value1 = array1[index1];\n    const value2 = array2[index2];\n    if (value1 === value2) {\n        return true;\n    }\n    if (typeof value1 !== \"object\" || typeof value2 !== \"object\") {\n        return false;\n    }\n    const objectHash = context.objectHash;\n    if (!objectHash) {\n        // no way to match objects was provided, try match by position\n        return context.matchByPosition && index1 === index2;\n    }\n    context.hashCache1 = context.hashCache1 || [];\n    let hash1 = context.hashCache1[index1];\n    if (typeof hash1 === \"undefined\") {\n        context.hashCache1[index1] = hash1 = objectHash(value1, index1);\n    }\n    if (typeof hash1 === \"undefined\") {\n        return false;\n    }\n    context.hashCache2 = context.hashCache2 || [];\n    let hash2 = context.hashCache2[index2];\n    if (typeof hash2 === \"undefined\") {\n        context.hashCache2[index2] = hash2 = objectHash(value2, index2);\n    }\n    if (typeof hash2 === \"undefined\") {\n        return false;\n    }\n    return hash1 === hash2;\n}\nexport const diffFilter = function arraysDiffFilter(context) {\n    var _a, _b, _c, _d, _e;\n    if (!context.leftIsArray) {\n        return;\n    }\n    const matchContext = {\n        objectHash: (_a = context.options) === null || _a === void 0 ? void 0 : _a.objectHash,\n        matchByPosition: (_b = context.options) === null || _b === void 0 ? void 0 : _b.matchByPosition,\n    };\n    let commonHead = 0;\n    let commonTail = 0;\n    let index;\n    let index1;\n    let index2;\n    const array1 = context.left;\n    const array2 = context.right;\n    const len1 = array1.length;\n    const len2 = array2.length;\n    let child;\n    if (len1 > 0 &&\n        len2 > 0 &&\n        !matchContext.objectHash &&\n        typeof matchContext.matchByPosition !== \"boolean\") {\n        matchContext.matchByPosition = !arraysHaveMatchByRef(array1, array2, len1, len2);\n    }\n    // separate common head\n    while (commonHead < len1 &&\n        commonHead < len2 &&\n        matchItems(array1, array2, commonHead, commonHead, matchContext)) {\n        index = commonHead;\n        child = new DiffContext(array1[index], array2[index]);\n        context.push(child, index);\n        commonHead++;\n    }\n    // separate common tail\n    while (commonTail + commonHead < len1 &&\n        commonTail + commonHead < len2 &&\n        matchItems(array1, array2, len1 - 1 - commonTail, len2 - 1 - commonTail, matchContext)) {\n        index1 = len1 - 1 - commonTail;\n        index2 = len2 - 1 - commonTail;\n        child = new DiffContext(array1[index1], array2[index2]);\n        context.push(child, index2);\n        commonTail++;\n    }\n    let result;\n    if (commonHead + commonTail === len1) {\n        if (len1 === len2) {\n            // arrays are identical\n            context.setResult(undefined).exit();\n            return;\n        }\n        // trivial case, a block (1 or more consecutive items) was added\n        result = result || {\n            _t: \"a\",\n        };\n        for (index = commonHead; index < len2 - commonTail; index++) {\n            result[index] = [array2[index]];\n            context.prepareDeltaResult(result[index]);\n        }\n        context.setResult(result).exit();\n        return;\n    }\n    if (commonHead + commonTail === len2) {\n        // trivial case, a block (1 or more consecutive items) was removed\n        result = result || {\n            _t: \"a\",\n        };\n        for (index = commonHead; index < len1 - commonTail; index++) {\n            const key = `_${index}`;\n            result[key] = [array1[index], 0, 0];\n            context.prepareDeltaResult(result[key]);\n        }\n        context.setResult(result).exit();\n        return;\n    }\n    // reset hash cache\n    matchContext.hashCache1 = undefined;\n    matchContext.hashCache2 = undefined;\n    // diff is not trivial, find the LCS (Longest Common Subsequence)\n    const trimmed1 = array1.slice(commonHead, len1 - commonTail);\n    const trimmed2 = array2.slice(commonHead, len2 - commonTail);\n    const seq = lcs.get(trimmed1, trimmed2, matchItems, matchContext);\n    const removedItems = [];\n    result = result || {\n        _t: \"a\",\n    };\n    for (index = commonHead; index < len1 - commonTail; index++) {\n        if (seq.indices1.indexOf(index - commonHead) < 0) {\n            // removed\n            const key = `_${index}`;\n            result[key] = [array1[index], 0, 0];\n            context.prepareDeltaResult(result[key]);\n            removedItems.push(index);\n        }\n    }\n    let detectMove = true;\n    if (((_c = context.options) === null || _c === void 0 ? void 0 : _c.arrays) && context.options.arrays.detectMove === false) {\n        detectMove = false;\n    }\n    let includeValueOnMove = false;\n    if ((_e = (_d = context.options) === null || _d === void 0 ? void 0 : _d.arrays) === null || _e === void 0 ? void 0 : _e.includeValueOnMove) {\n        includeValueOnMove = true;\n    }\n    const removedItemsLength = removedItems.length;\n    for (index = commonHead; index < len2 - commonTail; index++) {\n        const indexOnArray2 = seq.indices2.indexOf(index - commonHead);\n        if (indexOnArray2 < 0) {\n            // added, try to match with a removed item and register as position move\n            let isMove = false;\n            if (detectMove && removedItemsLength > 0) {\n                for (let removeItemIndex1 = 0; removeItemIndex1 < removedItemsLength; removeItemIndex1++) {\n                    index1 = removedItems[removeItemIndex1];\n                    const resultItem = index1 === undefined ? undefined : result[`_${index1}`];\n                    if (index1 !== undefined &&\n                        resultItem &&\n                        matchItems(trimmed1, trimmed2, index1 - commonHead, index - commonHead, matchContext)) {\n                        // store position move as: [originalValue, newPosition, ARRAY_MOVE]\n                        resultItem.splice(1, 2, index, ARRAY_MOVE);\n                        resultItem.splice(1, 2, index, ARRAY_MOVE);\n                        if (!includeValueOnMove) {\n                            // don't include moved value on diff, to save bytes\n                            resultItem[0] = \"\";\n                        }\n                        index2 = index;\n                        child = new DiffContext(array1[index1], array2[index2]);\n                        context.push(child, index2);\n                        removedItems.splice(removeItemIndex1, 1);\n                        isMove = true;\n                        break;\n                    }\n                }\n            }\n            if (!isMove) {\n                // added\n                result[index] = [array2[index]];\n                context.prepareDeltaResult(result[index]);\n            }\n        }\n        else {\n            // match, do inner diff\n            if (seq.indices1[indexOnArray2] === undefined) {\n                throw new Error(`Invalid indexOnArray2: ${indexOnArray2}, seq.indices1: ${seq.indices1}`);\n            }\n            index1 = seq.indices1[indexOnArray2] + commonHead;\n            if (seq.indices2[indexOnArray2] === undefined) {\n                throw new Error(`Invalid indexOnArray2: ${indexOnArray2}, seq.indices2: ${seq.indices2}`);\n            }\n            index2 = seq.indices2[indexOnArray2] + commonHead;\n            child = new DiffContext(array1[index1], array2[index2]);\n            context.push(child, index2);\n        }\n    }\n    context.setResult(result).exit();\n};\ndiffFilter.filterName = \"arrays\";\nconst compare = {\n    numerically(a, b) {\n        return a - b;\n    },\n    numericallyBy(name) {\n        return (a, b) => a[name] - b[name];\n    },\n};\nexport const patchFilter = function nestedPatchFilter(context) {\n    var _a;\n    if (!context.nested) {\n        return;\n    }\n    const nestedDelta = context.delta;\n    if (nestedDelta._t !== \"a\") {\n        return;\n    }\n    let index;\n    let index1;\n    const delta = nestedDelta;\n    const array = context.left;\n    // first, separate removals, insertions and modifications\n    let toRemove = [];\n    let toInsert = [];\n    const toModify = [];\n    for (index in delta) {\n        if (index !== \"_t\") {\n            if (index[0] === \"_\") {\n                const removedOrMovedIndex = index;\n                // removed item from original array\n                if (delta[removedOrMovedIndex] !== undefined &&\n                    (delta[removedOrMovedIndex][2] === 0 ||\n                        delta[removedOrMovedIndex][2] === ARRAY_MOVE)) {\n                    toRemove.push(Number.parseInt(index.slice(1), 10));\n                }\n                else {\n                    throw new Error(`only removal or move can be applied at original array indices, invalid diff type: ${(_a = delta[removedOrMovedIndex]) === null || _a === void 0 ? void 0 : _a[2]}`);\n                }\n            }\n            else {\n                const numberIndex = index;\n                if (delta[numberIndex].length === 1) {\n                    // added item at new array\n                    toInsert.push({\n                        index: Number.parseInt(numberIndex, 10),\n                        value: delta[numberIndex][0],\n                    });\n                }\n                else {\n                    // modified item at new array\n                    toModify.push({\n                        index: Number.parseInt(numberIndex, 10),\n                        delta: delta[numberIndex],\n                    });\n                }\n            }\n        }\n    }\n    // remove items, in reverse order to avoid sawing our own floor\n    toRemove = toRemove.sort(compare.numerically);\n    for (index = toRemove.length - 1; index >= 0; index--) {\n        index1 = toRemove[index];\n        if (index1 === undefined)\n            continue;\n        const indexDiff = delta[`_${index1}`];\n        const removedValue = array.splice(index1, 1)[0];\n        if ((indexDiff === null || indexDiff === void 0 ? void 0 : indexDiff[2]) === ARRAY_MOVE) {\n            // reinsert later\n            toInsert.push({\n                index: indexDiff[1],\n                value: removedValue,\n            });\n        }\n    }\n    // insert items, in reverse order to avoid moving our own floor\n    toInsert = toInsert.sort(compare.numericallyBy(\"index\"));\n    const toInsertLength = toInsert.length;\n    for (index = 0; index < toInsertLength; index++) {\n        const insertion = toInsert[index];\n        if (insertion === undefined)\n            continue;\n        array.splice(insertion.index, 0, insertion.value);\n    }\n    // apply modifications\n    const toModifyLength = toModify.length;\n    if (toModifyLength > 0) {\n        for (index = 0; index < toModifyLength; index++) {\n            const modification = toModify[index];\n            if (modification === undefined)\n                continue;\n            const child = new PatchContext(array[modification.index], modification.delta);\n            context.push(child, modification.index);\n        }\n    }\n    if (!context.children) {\n        context.setResult(array).exit();\n        return;\n    }\n    context.exit();\n};\npatchFilter.filterName = \"arrays\";\nexport const collectChildrenPatchFilter = function collectChildrenPatchFilter(context) {\n    if (!context || !context.children) {\n        return;\n    }\n    const deltaWithChildren = context.delta;\n    if (deltaWithChildren._t !== \"a\") {\n        return;\n    }\n    const array = context.left;\n    const length = context.children.length;\n    for (let index = 0; index < length; index++) {\n        const child = context.children[index];\n        if (child === undefined)\n            continue;\n        const arrayIndex = child.childName;\n        array[arrayIndex] = child.result;\n    }\n    context.setResult(array).exit();\n};\ncollectChildrenPatchFilter.filterName = \"arraysCollectChildren\";\nexport const reverseFilter = function arraysReverseFilter(context) {\n    if (!context.nested) {\n        const nonNestedDelta = context.delta;\n        if (nonNestedDelta[2] === ARRAY_MOVE) {\n            const arrayMoveDelta = nonNestedDelta;\n            context.newName = `_${arrayMoveDelta[1]}`;\n            context\n                .setResult([\n                arrayMoveDelta[0],\n                Number.parseInt(context.childName.substring(1), 10),\n                ARRAY_MOVE,\n            ])\n                .exit();\n        }\n        return;\n    }\n    const nestedDelta = context.delta;\n    if (nestedDelta._t !== \"a\") {\n        return;\n    }\n    const arrayDelta = nestedDelta;\n    for (const name in arrayDelta) {\n        if (name === \"_t\") {\n            continue;\n        }\n        const child = new ReverseContext(arrayDelta[name]);\n        context.push(child, name);\n    }\n    context.exit();\n};\nreverseFilter.filterName = \"arrays\";\nconst reverseArrayDeltaIndex = (delta, index, itemDelta) => {\n    if (typeof index === \"string\" && index[0] === \"_\") {\n        return Number.parseInt(index.substring(1), 10);\n    }\n    if (Array.isArray(itemDelta) && itemDelta[2] === 0) {\n        return `_${index}`;\n    }\n    let reverseIndex = +index;\n    for (const deltaIndex in delta) {\n        const deltaItem = delta[deltaIndex];\n        if (Array.isArray(deltaItem)) {\n            if (deltaItem[2] === ARRAY_MOVE) {\n                const moveFromIndex = Number.parseInt(deltaIndex.substring(1), 10);\n                const moveToIndex = deltaItem[1];\n                if (moveToIndex === +index) {\n                    return moveFromIndex;\n                }\n                if (moveFromIndex <= reverseIndex && moveToIndex > reverseIndex) {\n                    reverseIndex++;\n                }\n                else if (moveFromIndex >= reverseIndex &&\n                    moveToIndex < reverseIndex) {\n                    reverseIndex--;\n                }\n            }\n            else if (deltaItem[2] === 0) {\n                const deleteIndex = Number.parseInt(deltaIndex.substring(1), 10);\n                if (deleteIndex <= reverseIndex) {\n                    reverseIndex++;\n                }\n            }\n            else if (deltaItem.length === 1 &&\n                Number.parseInt(deltaIndex, 10) <= reverseIndex) {\n                reverseIndex--;\n            }\n        }\n    }\n    return reverseIndex;\n};\nexport const collectChildrenReverseFilter = (context) => {\n    if (!context || !context.children) {\n        return;\n    }\n    const deltaWithChildren = context.delta;\n    if (deltaWithChildren._t !== \"a\") {\n        return;\n    }\n    const arrayDelta = deltaWithChildren;\n    const length = context.children.length;\n    const delta = {\n        _t: \"a\",\n    };\n    for (let index = 0; index < length; index++) {\n        const child = context.children[index];\n        if (child === undefined)\n            continue;\n        let name = child.newName;\n        if (typeof name === \"undefined\") {\n            if (child.childName === undefined) {\n                throw new Error(\"child.childName is undefined\");\n            }\n            name = reverseArrayDeltaIndex(arrayDelta, child.childName, child.result);\n        }\n        if (delta[name] !== child.result) {\n            // There's no way to type this well.\n            delta[name] = child.result;\n        }\n    }\n    context.setResult(delta).exit();\n};\ncollectChildrenReverseFilter.filterName = \"arraysCollectChildren\";\n","export const diffFilter = function datesDiffFilter(context) {\n    if (context.left instanceof Date) {\n        if (context.right instanceof Date) {\n            if (context.left.getTime() !== context.right.getTime()) {\n                context.setResult([context.left, context.right]);\n            }\n            else {\n                context.setResult(undefined);\n            }\n        }\n        else {\n            context.setResult([context.left, context.right]);\n        }\n        context.exit();\n    }\n    else if (context.right instanceof Date) {\n        context.setResult([context.left, context.right]).exit();\n    }\n};\ndiffFilter.filterName = \"dates\";\n","import DiffContext from \"../contexts/diff.js\";\nimport PatchContext from \"../contexts/patch.js\";\nimport ReverseContext from \"../contexts/reverse.js\";\n// '__proto__' must never be used as a property key — it bypasses normal\n// property assignment and directly modifies the object's prototype chain.\n// 'constructor' and 'prototype' are handled by the hasOwnProperty guard below\n// (we only traverse own properties of left, so inherited 'constructor' is\n// never followed into Object.prototype).\nconst UNSAFE_KEYS = new Set([\"__proto__\"]);\nexport const collectChildrenDiffFilter = (context) => {\n    if (!context || !context.children) {\n        return;\n    }\n    const length = context.children.length;\n    let result = context.result;\n    for (let index = 0; index < length; index++) {\n        const child = context.children[index];\n        if (child === undefined)\n            continue;\n        if (typeof child.result === \"undefined\") {\n            continue;\n        }\n        result = result || {};\n        if (child.childName === undefined) {\n            throw new Error(\"diff child.childName is undefined\");\n        }\n        result[child.childName] = child.result;\n    }\n    if (result && context.leftIsArray) {\n        result._t = \"a\";\n    }\n    context.setResult(result).exit();\n};\ncollectChildrenDiffFilter.filterName = \"collectChildren\";\nexport const objectsDiffFilter = (context) => {\n    var _a;\n    if (context.leftIsArray || context.leftType !== \"object\") {\n        return;\n    }\n    const left = context.left;\n    const right = context.right;\n    const propertyFilter = (_a = context.options) === null || _a === void 0 ? void 0 : _a.propertyFilter;\n    for (const name in left) {\n        if (!Object.prototype.hasOwnProperty.call(left, name)) {\n            continue;\n        }\n        if (propertyFilter && !propertyFilter(name, context)) {\n            continue;\n        }\n        const child = new DiffContext(left[name], right[name]);\n        context.push(child, name);\n    }\n    for (const name in right) {\n        if (!Object.prototype.hasOwnProperty.call(right, name)) {\n            continue;\n        }\n        if (propertyFilter && !propertyFilter(name, context)) {\n            continue;\n        }\n        if (typeof left[name] === \"undefined\") {\n            const child = new DiffContext(undefined, right[name]);\n            context.push(child, name);\n        }\n    }\n    if (!context.children || context.children.length === 0) {\n        context.setResult(undefined).exit();\n        return;\n    }\n    context.exit();\n};\nobjectsDiffFilter.filterName = \"objects\";\nexport const patchFilter = function nestedPatchFilter(context) {\n    if (!context.nested) {\n        return;\n    }\n    const nestedDelta = context.delta;\n    if (nestedDelta._t) {\n        return;\n    }\n    const objectDelta = nestedDelta;\n    let childrenPushed = false;\n    for (const name in objectDelta) {\n        if (UNSAFE_KEYS.has(name))\n            continue;\n        if (!Object.prototype.hasOwnProperty.call(objectDelta, name))\n            continue;\n        const left = context.left;\n        // Only read own properties from left to avoid traversing inherited\n        // properties (e.g. constructor.prototype → Object.prototype)\n        const leftValue = left !== null &&\n            typeof left === \"object\" &&\n            Object.prototype.hasOwnProperty.call(left, name)\n            ? left[name]\n            : undefined;\n        const child = new PatchContext(leftValue, objectDelta[name]);\n        context.push(child, name);\n        childrenPushed = true;\n    }\n    if (!childrenPushed) {\n        // All delta keys were unsafe or filtered out — return left unchanged.\n        context.setResult(context.left).exit();\n        return;\n    }\n    context.exit();\n};\npatchFilter.filterName = \"objects\";\nexport const collectChildrenPatchFilter = function collectChildrenPatchFilter(context) {\n    if (!context || !context.children) {\n        return;\n    }\n    const deltaWithChildren = context.delta;\n    if (deltaWithChildren._t) {\n        return;\n    }\n    // If left is not a real object we cannot patch it — return left as-is.\n    if (context.left === null || typeof context.left !== \"object\") {\n        context.setResult(context.left).exit();\n        return;\n    }\n    const object = context.left;\n    const length = context.children.length;\n    for (let index = 0; index < length; index++) {\n        const child = context.children[index];\n        if (child === undefined)\n            continue;\n        const property = child.childName;\n        if (UNSAFE_KEYS.has(property))\n            continue;\n        if (Object.prototype.hasOwnProperty.call(context.left, property) &&\n            child.result === undefined) {\n            delete object[property];\n        }\n        else if (object[property] !== child.result) {\n            object[property] = child.result;\n        }\n    }\n    context.setResult(object).exit();\n};\ncollectChildrenPatchFilter.filterName = \"collectChildren\";\nexport const reverseFilter = function nestedReverseFilter(context) {\n    if (!context.nested) {\n        return;\n    }\n    const nestedDelta = context.delta;\n    if (nestedDelta._t) {\n        return;\n    }\n    const objectDelta = context.delta;\n    let childrenPushed = false;\n    for (const name in objectDelta) {\n        if (UNSAFE_KEYS.has(name))\n            continue;\n        if (!Object.prototype.hasOwnProperty.call(objectDelta, name))\n            continue;\n        const child = new ReverseContext(objectDelta[name]);\n        context.push(child, name);\n        childrenPushed = true;\n    }\n    if (!childrenPushed) {\n        // All delta keys were unsafe — return an empty reversed delta.\n        context.setResult({}).exit();\n        return;\n    }\n    context.exit();\n};\nreverseFilter.filterName = \"objects\";\nexport const collectChildrenReverseFilter = (context) => {\n    if (!context || !context.children) {\n        return;\n    }\n    const deltaWithChildren = context.delta;\n    if (deltaWithChildren._t) {\n        return;\n    }\n    const length = context.children.length;\n    const delta = {};\n    for (let index = 0; index < length; index++) {\n        const child = context.children[index];\n        if (child === undefined)\n            continue;\n        const property = child.childName;\n        if (UNSAFE_KEYS.has(property))\n            continue;\n        if (delta[property] !== child.result) {\n            delta[property] = child.result;\n        }\n    }\n    context.setResult(delta).exit();\n};\ncollectChildrenReverseFilter.filterName = \"collectChildren\";\n","const TEXT_DIFF = 2;\nconst DEFAULT_MIN_LENGTH = 60;\nlet cachedDiffPatch = null;\nfunction getDiffMatchPatch(options, required) {\n    var _a;\n    if (!cachedDiffPatch) {\n        let instance;\n        if ((_a = options === null || options === void 0 ? void 0 : options.textDiff) === null || _a === void 0 ? void 0 : _a.diffMatchPatch) {\n            instance = new options.textDiff.diffMatchPatch();\n        }\n        else {\n            if (!required) {\n                return null;\n            }\n            const error = new Error(\"The diff-match-patch library was not provided. Pass the library in through the options or use the `jsondiffpatch/with-text-diffs` entry-point.\");\n            // eslint-disable-next-line camelcase\n            error.diff_match_patch_not_found = true;\n            throw error;\n        }\n        cachedDiffPatch = {\n            diff: (txt1, txt2) => instance.patch_toText(instance.patch_make(txt1, txt2)),\n            patch: (txt1, patch) => {\n                const results = instance.patch_apply(instance.patch_fromText(patch), txt1);\n                for (const resultOk of results[1]) {\n                    if (!resultOk) {\n                        const error = new Error(\"text patch failed\");\n                        error.textPatchFailed = true;\n                        throw error;\n                    }\n                }\n                return results[0];\n            },\n        };\n    }\n    return cachedDiffPatch;\n}\nexport const diffFilter = function textsDiffFilter(context) {\n    var _a, _b;\n    if (context.leftType !== \"string\") {\n        return;\n    }\n    const left = context.left;\n    const right = context.right;\n    const minLength = ((_b = (_a = context.options) === null || _a === void 0 ? void 0 : _a.textDiff) === null || _b === void 0 ? void 0 : _b.minLength) || DEFAULT_MIN_LENGTH;\n    if (left.length < minLength || right.length < minLength) {\n        context.setResult([left, right]).exit();\n        return;\n    }\n    // large text, try to use a text-diff algorithm\n    const diffMatchPatch = getDiffMatchPatch(context.options);\n    if (!diffMatchPatch) {\n        // diff-match-patch library not available,\n        // fallback to regular string replace\n        context.setResult([left, right]).exit();\n        return;\n    }\n    const diff = diffMatchPatch.diff;\n    context.setResult([diff(left, right), 0, TEXT_DIFF]).exit();\n};\ndiffFilter.filterName = \"texts\";\nexport const patchFilter = function textsPatchFilter(context) {\n    if (context.nested) {\n        return;\n    }\n    const nonNestedDelta = context.delta;\n    if (nonNestedDelta[2] !== TEXT_DIFF) {\n        return;\n    }\n    const textDiffDelta = nonNestedDelta;\n    // text-diff, use a text-patch algorithm\n    const patch = getDiffMatchPatch(context.options, true).patch;\n    context.setResult(patch(context.left, textDiffDelta[0])).exit();\n};\npatchFilter.filterName = \"texts\";\nconst textDeltaReverse = (delta) => {\n    var _a, _b, _c;\n    const headerRegex = /^@@ +-(\\d+),(\\d+) +\\+(\\d+),(\\d+) +@@$/;\n    const lines = delta.split(\"\\n\");\n    for (let i = 0; i < lines.length; i++) {\n        const line = lines[i];\n        if (line === undefined)\n            continue;\n        const lineStart = line.slice(0, 1);\n        if (lineStart === \"@\") {\n            const header = headerRegex.exec(line);\n            if (header !== null) {\n                const lineHeader = i;\n                // fix header\n                lines[lineHeader] =\n                    `@@ -${header[3]},${header[4]} +${header[1]},${header[2]} @@`;\n            }\n        }\n        else if (lineStart === \"+\") {\n            lines[i] = `-${(_a = lines[i]) === null || _a === void 0 ? void 0 : _a.slice(1)}`;\n            if (((_b = lines[i - 1]) === null || _b === void 0 ? void 0 : _b.slice(0, 1)) === \"+\") {\n                // swap lines to keep default order (-+)\n                const lineTmp = lines[i];\n                lines[i] = lines[i - 1];\n                lines[i - 1] = lineTmp;\n            }\n        }\n        else if (lineStart === \"-\") {\n            lines[i] = `+${(_c = lines[i]) === null || _c === void 0 ? void 0 : _c.slice(1)}`;\n        }\n    }\n    return lines.join(\"\\n\");\n};\nexport const reverseFilter = function textsReverseFilter(context) {\n    if (context.nested) {\n        return;\n    }\n    const nonNestedDelta = context.delta;\n    if (nonNestedDelta[2] !== TEXT_DIFF) {\n        return;\n    }\n    const textDiffDelta = nonNestedDelta;\n    // text-diff, use a text-diff algorithm\n    context\n        .setResult([textDeltaReverse(textDiffDelta[0]), 0, TEXT_DIFF])\n        .exit();\n};\nreverseFilter.filterName = \"texts\";\n","export const diffFilter = function trivialMatchesDiffFilter(context) {\n    if (context.left === context.right) {\n        context.setResult(undefined).exit();\n        return;\n    }\n    if (typeof context.left === \"undefined\") {\n        if (typeof context.right === \"function\") {\n            throw new Error(\"functions are not supported\");\n        }\n        context.setResult([context.right]).exit();\n        return;\n    }\n    if (typeof context.right === \"undefined\") {\n        context.setResult([context.left, 0, 0]).exit();\n        return;\n    }\n    if (typeof context.left === \"function\" ||\n        typeof context.right === \"function\") {\n        throw new Error(\"functions are not supported\");\n    }\n    context.leftType = context.left === null ? \"null\" : typeof context.left;\n    context.rightType = context.right === null ? \"null\" : typeof context.right;\n    if (context.leftType !== context.rightType) {\n        context.setResult([context.left, context.right]).exit();\n        return;\n    }\n    if (context.leftType === \"boolean\" || context.leftType === \"number\") {\n        context.setResult([context.left, context.right]).exit();\n        return;\n    }\n    if (context.leftType === \"object\") {\n        context.leftIsArray = Array.isArray(context.left);\n    }\n    if (context.rightType === \"object\") {\n        context.rightIsArray = Array.isArray(context.right);\n    }\n    if (context.leftIsArray !== context.rightIsArray) {\n        context.setResult([context.left, context.right]).exit();\n        return;\n    }\n    if (context.left instanceof RegExp) {\n        if (context.right instanceof RegExp) {\n            context\n                .setResult([context.left.toString(), context.right.toString()])\n                .exit();\n        }\n        else {\n            context.setResult([context.left, context.right]).exit();\n        }\n    }\n};\ndiffFilter.filterName = \"trivial\";\nexport const patchFilter = function trivialMatchesPatchFilter(context) {\n    if (typeof context.delta === \"undefined\") {\n        context.setResult(context.left).exit();\n        return;\n    }\n    context.nested = !Array.isArray(context.delta);\n    if (context.nested) {\n        return;\n    }\n    const nonNestedDelta = context.delta;\n    if (nonNestedDelta.length === 1) {\n        context.setResult(nonNestedDelta[0]).exit();\n        return;\n    }\n    if (nonNestedDelta.length === 2) {\n        if (context.left instanceof RegExp) {\n            const regexArgs = /^\\/(.*)\\/([gimyu]+)$/.exec(nonNestedDelta[1]);\n            if (regexArgs === null || regexArgs === void 0 ? void 0 : regexArgs[1]) {\n                context.setResult(new RegExp(regexArgs[1], regexArgs[2])).exit();\n                return;\n            }\n        }\n        context.setResult(nonNestedDelta[1]).exit();\n        return;\n    }\n    if (nonNestedDelta.length === 3 && nonNestedDelta[2] === 0) {\n        context.setResult(undefined).exit();\n    }\n};\npatchFilter.filterName = \"trivial\";\nexport const reverseFilter = function trivialReferseFilter(context) {\n    if (typeof context.delta === \"undefined\") {\n        context.setResult(context.delta).exit();\n        return;\n    }\n    context.nested = !Array.isArray(context.delta);\n    if (context.nested) {\n        return;\n    }\n    const nonNestedDelta = context.delta;\n    if (nonNestedDelta.length === 1) {\n        context.setResult([nonNestedDelta[0], 0, 0]).exit();\n        return;\n    }\n    if (nonNestedDelta.length === 2) {\n        context.setResult([nonNestedDelta[1], nonNestedDelta[0]]).exit();\n        return;\n    }\n    if (nonNestedDelta.length === 3 && nonNestedDelta[2] === 0) {\n        context.setResult([nonNestedDelta[0]]).exit();\n    }\n};\nreverseFilter.filterName = \"trivial\";\n","import clone from \"./clone.js\";\nimport DiffContext from \"./contexts/diff.js\";\nimport PatchContext from \"./contexts/patch.js\";\nimport ReverseContext from \"./contexts/reverse.js\";\nimport Pipe from \"./pipe.js\";\nimport Processor from \"./processor.js\";\nimport * as arrays from \"./filters/arrays.js\";\nimport * as dates from \"./filters/dates.js\";\nimport * as nested from \"./filters/nested.js\";\nimport * as texts from \"./filters/texts.js\";\nimport * as trivial from \"./filters/trivial.js\";\nclass DiffPatcher {\n    constructor(options) {\n        this.processor = new Processor(options);\n        this.processor.pipe(new Pipe(\"diff\")\n            .append(nested.collectChildrenDiffFilter, trivial.diffFilter, dates.diffFilter, texts.diffFilter, nested.objectsDiffFilter, arrays.diffFilter)\n            .shouldHaveResult());\n        this.processor.pipe(new Pipe(\"patch\")\n            .append(nested.collectChildrenPatchFilter, arrays.collectChildrenPatchFilter, trivial.patchFilter, texts.patchFilter, nested.patchFilter, arrays.patchFilter)\n            .shouldHaveResult());\n        this.processor.pipe(new Pipe(\"reverse\")\n            .append(nested.collectChildrenReverseFilter, arrays.collectChildrenReverseFilter, trivial.reverseFilter, texts.reverseFilter, nested.reverseFilter, arrays.reverseFilter)\n            .shouldHaveResult());\n    }\n    options(options) {\n        return this.processor.options(options);\n    }\n    diff(left, right) {\n        return this.processor.process(new DiffContext(left, right));\n    }\n    patch(left, delta) {\n        return this.processor.process(new PatchContext(left, delta));\n    }\n    reverse(delta) {\n        return this.processor.process(new ReverseContext(delta));\n    }\n    unpatch(right, delta) {\n        return this.patch(right, this.reverse(delta));\n    }\n    clone(value) {\n        return clone(value);\n    }\n}\nexport default DiffPatcher;\n","import { BasePipe } from '../pipes/BasePipe.js';\nimport { LogPayload } from './LogPayload.js';\n\nexport class Dispatcher {\n  private pipes: BasePipe[] = [];\n\n  addPipe(pipe: BasePipe): void {\n    this.pipes.push(pipe);\n  }\n\n  dispatch(payload: LogPayload): void {\n    for (const pipe of this.pipes) {\n      try {\n        const result = pipe.write(payload);\n        if (result instanceof Promise) {\n          result.catch((err) => {\n            console.error('Error writing to pipe:', err);\n          });\n        }\n      } catch (err) {\n        console.error('Error writing to pipe:', err);\n      }\n    }\n  }\n\n  async flush(): Promise<void> {\n    const flushPromises = this.pipes.map(async (pipe) => {\n      try {\n        await pipe.flush();\n      } catch (err) {\n        console.error('Error flushing pipe:', err);\n      }\n    });\n    await Promise.all(flushPromises);\n  }\n}\n","import { LogPayload } from '../core/LogPayload.js';\n\nexport abstract class BasePipe {\n  abstract write(payload: LogPayload): void | Promise<void>;\n  abstract flush(): void | Promise<void>;\n}\n","import { BasePipe } from './BasePipe.js';\nimport { LogPayload, LogLevel } from '../core/LogPayload.js';\n\nexport interface ConsolePipeConfig {\n  scriptPrefix?: string;\n  brandColor?: string; // Hex color for the script prefix\n}\n\nexport class ConsolePipe extends BasePipe {\n  private scriptPrefix: string;\n  private brandColor: string;\n\n  private styles: Record<LogLevel, string> = {\n    TRACE: 'color: #888888; font-weight: normal;',\n    DEBUG: 'color: #03A9F4; font-weight: bold;',\n    INFO: 'color: #4CAF50; font-weight: bold;',\n    WARN: 'color: #FF9800; font-weight: bold;',\n    ERROR: 'color: #F44336; font-weight: bold;',\n    FATAL:\n      'color: #FFFFFF; background-color: #B71C1C; font-weight: bold; padding: 2px 4px; border-radius: 2px;',\n  };\n\n  constructor(config?: ConsolePipeConfig) {\n    super();\n    this.scriptPrefix = config?.scriptPrefix ?? 'EditorX';\n    this.brandColor = config?.brandColor ?? '#00E676';\n  }\n\n  write(payload: LogPayload): void {\n    const timestampStr = new Date(payload.timestamp).toISOString().split('T')[1].slice(0, -1);\n    const scopesStr = payload.scopes.map((s) => `[${s}]`).join('');\n    const levelStr = payload.level;\n\n    const prefixStyle = `color: ${this.brandColor}; font-weight: bold;`;\n    const timeStyle = 'color: #9E9E9E;';\n    const levelStyle = this.styles[levelStr];\n    const scopeStyle = 'color: #9C27B0; font-weight: bold;';\n\n    const format = `%c[${this.scriptPrefix}] %c${timestampStr} %c[${levelStr}]%c%c${scopesStr}%c ${payload.message}`;\n\n    const args = [\n      format,\n      prefixStyle,\n      timeStyle,\n      levelStyle,\n      '', // reset level style\n      scopeStyle,\n      '', // reset scope style\n    ];\n\n    if (payload.data !== undefined) {\n      console.log(...args, payload.data);\n    } else {\n      console.log(...args);\n    }\n  }\n\n  flush(): void {}\n}\n","import { BasePipe } from './BasePipe.js';\nimport { IndexedDBManager } from '../storage/IndexedDBManager.js';\nimport { LogPayload } from '../core/LogPayload.js';\n\nexport class IndexedDBPipe extends BasePipe {\n  private dbManager: IndexedDBManager | null = null;\n  private initPromise: Promise<IndexedDBManager> | null = null;\n  private buffer: LogPayload[] = [];\n\n  constructor(dbManagerOrPromise: IndexedDBManager | Promise<IndexedDBManager>) {\n    super();\n    if (dbManagerOrPromise instanceof Promise) {\n      this.initPromise = dbManagerOrPromise.then((manager) => {\n        this.dbManager = manager;\n        for (const payload of this.buffer) {\n          manager.writeLog(payload).catch(() => {});\n        }\n        this.buffer = [];\n        return manager;\n      });\n    } else {\n      this.dbManager = dbManagerOrPromise;\n    }\n  }\n\n  async write(payload: LogPayload): Promise<void> {\n    if (this.dbManager) {\n      await this.dbManager.writeLog(payload);\n    } else if (this.initPromise) {\n      this.buffer.push(payload);\n    }\n  }\n\n  async flush(): Promise<void> {\n    if (this.dbManager) {\n      await this.dbManager.flush();\n    } else if (this.initPromise) {\n      const manager = await this.initPromise;\n      await manager.flush();\n    }\n  }\n}\n","export interface IDBOpenOptions {\n  onUpgradeNeeded?: (db: IDBDatabase, event: IDBVersionChangeEvent) => void;\n  onBlocked?: (event: Event) => void;\n}\n\n/**\n * Opens an IndexedDB connection and wraps the request in a Promise.\n */\nexport function openDB(\n  name: string,\n  version: number,\n  options?: IDBOpenOptions,\n): Promise<IDBDatabase> {\n  return new Promise<IDBDatabase>((resolve, reject) => {\n    const request = indexedDB.open(name, version);\n\n    if (options?.onUpgradeNeeded) {\n      request.onupgradeneeded = (event) => {\n        options.onUpgradeNeeded!(request.result, event);\n      };\n    }\n\n    if (options?.onBlocked) {\n      request.onblocked = (event) => {\n        options.onBlocked!(event);\n      };\n    }\n\n    request.onsuccess = () => {\n      resolve(request.result);\n    };\n\n    request.onerror = () => {\n      reject(request.error);\n    };\n  });\n}\n\n/**\n * Wraps a standard IDBRequest in a Promise.\n */\nexport function wrapRequest<T>(request: IDBRequest<T>): Promise<T> {\n  return new Promise<T>((resolve, reject) => {\n    request.onsuccess = () => resolve(request.result);\n    request.onerror = () => reject(request.error);\n  });\n}\n\n/**\n * Runs a transaction on the database and resolves when the transaction completes.\n */\nexport function runTransaction(\n  db: IDBDatabase,\n  storeNames: string | string[],\n  mode: IDBTransactionMode,\n  callback: (tx: IDBTransaction) => void,\n): Promise<void> {\n  return new Promise<void>((resolve, reject) => {\n    const tx = db.transaction(storeNames, mode);\n    tx.oncomplete = () => resolve();\n    tx.onerror = () => reject(tx.error);\n    callback(tx);\n  });\n}\n","import { LogPayload, SessionMetadata } from '../core/LogPayload.js';\nimport { openDB, wrapRequest, runTransaction } from '../utils/idb.js';\n\nexport interface IndexedDBManagerConfig {\n  dbPrefix: string;\n  scriptVersion: string;\n  sessionId: string;\n  wmeVersion: string | null;\n  maxArchivedSessions?: number;\n  flushIntervalMs?: number;\n}\n\nconst DEFAULT_CONFIG = {\n  maxArchivedSessions: 15,\n  flushIntervalMs: 2000,\n};\n\nexport class IndexedDBManager {\n  private dbPrefix: string;\n  private maxArchivedSessions: number;\n  private scriptVersion: string;\n  private sessionId: string;\n  private wmeVersion: string | null;\n  private flushIntervalMs: number;\n  private db: IDBDatabase | null = null;\n  private queue: LogPayload[] = [];\n  private flushTimer: ReturnType<typeof setTimeout> | null = null;\n  private heartbeatTimer: ReturnType<typeof setInterval> | null = null;\n  private loggerVersion = '1.0.0';\n  private schemaVersion = '1.0.0';\n\n  constructor(config: IndexedDBManagerConfig) {\n    const merged = Object.assign({}, DEFAULT_CONFIG, config);\n    this.dbPrefix = merged.dbPrefix;\n    this.maxArchivedSessions = merged.maxArchivedSessions;\n    this.scriptVersion = merged.scriptVersion;\n    this.sessionId = merged.sessionId;\n    this.wmeVersion = merged.wmeVersion;\n    this.flushIntervalMs = merged.flushIntervalMs;\n  }\n\n  /**\n   * Returns the database name with prefix.\n   */\n  getDatabaseName(): string {\n    return `LogStreamDB_${this.dbPrefix}`;\n  }\n\n  /**\n   * Initializes the database connection and saves session metadata.\n   */\n  async init(): Promise<void> {\n    const dbName = this.getDatabaseName();\n\n    this.db = await openDB(dbName, 1, {\n      onUpgradeNeeded: (db) => {\n        if (!db.objectStoreNames.contains('sessions')) {\n          db.createObjectStore('sessions', { keyPath: 'id' });\n        }\n        if (!db.objectStoreNames.contains('logs')) {\n          const logStore = db.createObjectStore('logs', { keyPath: 'id', autoIncrement: true });\n          logStore.createIndex('sessionId', 'sessionId', { unique: false });\n        }\n      },\n    });\n\n    const now = Date.now();\n    const metadata: SessionMetadata = {\n      id: this.sessionId,\n      createdAt: now,\n      lastUpdated: now,\n      scriptVersion: this.scriptVersion,\n      wmeVersion: this.wmeVersion ?? 'unknown',\n      loggerVersion: this.loggerVersion,\n      schemaVersion: this.schemaVersion,\n    };\n\n    try {\n      await this.saveSessionMetadata(metadata);\n      this.startHeartbeat();\n    } catch (err) {\n      if (this.db) {\n        this.db.close();\n        this.db = null;\n      }\n      throw err;\n    }\n  }\n\n  /**\n   * Saves a session metadata record.\n   */\n  async saveSessionMetadata(metadata: SessionMetadata): Promise<void> {\n    if (!this.db) throw new Error('Database not initialized');\n    const transaction = this.db.transaction('sessions', 'readwrite');\n    const store = transaction.objectStore('sessions');\n    await wrapRequest(store.put(metadata));\n  }\n\n  /**\n   * Periodically updates the current session's lastUpdated timestamp.\n   */\n  async touchSession(): Promise<void> {\n    if (!this.db) return;\n    const transaction = this.db.transaction('sessions', 'readwrite');\n    const store = transaction.objectStore('sessions');\n    const metadata = (await wrapRequest(store.get(this.sessionId))) as SessionMetadata;\n    if (metadata) {\n      metadata.lastUpdated = Date.now();\n      await wrapRequest(store.put(metadata));\n    }\n  }\n\n  /**\n   * Starts the session heartbeat interval.\n   */\n  private startHeartbeat(): void {\n    this.stopHeartbeat();\n    this.heartbeatTimer = setInterval(() => {\n      this.touchSession().catch(() => {});\n    }, 10000); // 10-second heartbeat\n  }\n\n  /**\n   * Stops the session heartbeat interval.\n   */\n  private stopHeartbeat(): void {\n    if (this.heartbeatTimer) {\n      clearInterval(this.heartbeatTimer);\n      this.heartbeatTimer = null;\n    }\n  }\n\n  /**\n   * Writes a log entry, scheduling a flush or flushing immediately for high priority.\n   */\n  async writeLog(payload: LogPayload): Promise<void> {\n    const enrichedPayload = {\n      ...payload,\n      sessionId: this.sessionId,\n    };\n\n    const isHighPriority =\n      payload.level === 'WARN' || payload.level === 'ERROR' || payload.level === 'FATAL';\n\n    if (isHighPriority) {\n      this.queue.push(enrichedPayload);\n      await this.flush();\n    } else {\n      this.queue.push(enrichedPayload);\n      if (this.queue.length >= 50) {\n        await this.flush();\n      } else if (!this.flushTimer) {\n        this.scheduleFlush();\n      }\n    }\n  }\n\n  /**\n   * Schedules a background flush if not already scheduled.\n   */\n  private scheduleFlush(): void {\n    if (this.flushTimer) return;\n    this.flushTimer = setTimeout(() => {\n      this.flush().catch(() => {});\n    }, this.flushIntervalMs);\n  }\n\n  /**\n   * Instantly flushes the in-memory queue to IndexedDB.\n   */\n  async flush(): Promise<void> {\n    if (this.flushTimer) {\n      clearTimeout(this.flushTimer);\n      this.flushTimer = null;\n    }\n\n    if (this.queue.length === 0) {\n      return;\n    }\n\n    const batch = [...this.queue];\n    this.queue = [];\n\n    await this.writeLogsBatch(batch);\n  }\n\n  /**\n   * Writes a batch of logs in a single transaction.\n   */\n  async writeLogsBatch(logs: LogPayload[]): Promise<void> {\n    if (!this.db) throw new Error('Database not initialized');\n    await runTransaction(this.db, 'logs', 'readwrite', (tx) => {\n      const store = tx.objectStore('logs');\n      for (const log of logs) {\n        store.add(log);\n      }\n    });\n  }\n\n  /**\n   * Retrieves all logs for a specific session.\n   */\n  async getLogsForSession(sessionId: string): Promise<LogPayload[]> {\n    if (!this.db) throw new Error('Database not initialized');\n    const transaction = this.db.transaction('logs', 'readonly');\n    const store = transaction.objectStore('logs');\n    const index = store.index('sessionId');\n    return wrapRequest(index.getAll(IDBKeyRange.only(sessionId)));\n  }\n\n  /**\n   * Retrieves all archived session records.\n   */\n  async getAllSessions(): Promise<SessionMetadata[]> {\n    if (!this.db) throw new Error('Database not initialized');\n    const transaction = this.db.transaction('sessions', 'readonly');\n    const store = transaction.objectStore('sessions');\n    const result = await wrapRequest(store.getAll());\n    return result || [];\n  }\n\n  /**\n   * Prunes older sessions, keeping maxArchivedSessions.\n   * Protects active sessions in other tabs (updated in last 30s) and the current active session.\n   */\n  async pruneSessions(): Promise<void> {\n    if (!this.db) throw new Error('Database not initialized');\n\n    const sessions = await this.getAllSessions();\n    if (sessions.length <= this.maxArchivedSessions) {\n      return;\n    }\n\n    // Sort by createdAt ascending (oldest first)\n    sessions.sort((a, b) => a.createdAt - b.createdAt);\n\n    const now = Date.now();\n    // Exclude active sessions:\n    // 1. Current session\n    // 2. Active sessions in other tabs (heartbeat within 2m / 120s)\n    const candidates = sessions.filter((s) => {\n      const isActiveSelf = s.id === this.sessionId;\n      const isActiveOther = s.lastUpdated && now - s.lastUpdated < 120000;\n      return !isActiveSelf && !isActiveOther;\n    });\n\n    const totalToPrune = sessions.length - this.maxArchivedSessions;\n    if (totalToPrune <= 0) {\n      return;\n    }\n\n    const sessionsToPrune = candidates.slice(0, totalToPrune);\n\n    for (const session of sessionsToPrune) {\n      const transaction = this.db.transaction('sessions', 'readwrite');\n      const store = transaction.objectStore('sessions');\n      await wrapRequest(store.delete(session.id));\n\n      await new Promise<void>((resolve, reject) => {\n        const transaction = this.db!.transaction('logs', 'readwrite');\n        const store = transaction.objectStore('logs');\n        const index = store.index('sessionId');\n        const request = index.openCursor(IDBKeyRange.only(session.id));\n\n        request.onsuccess = () => {\n          const cursor = request.result;\n          if (cursor) {\n            cursor.delete();\n            cursor.continue();\n          } else {\n            resolve();\n          }\n        };\n        request.onerror = () => reject(request.error);\n      });\n    }\n  }\n\n  /**\n   * Streams logs for a session via cursor.\n   */\n  async streamLogsForSession(sessionId: string, onLog: (log: LogPayload) => void): Promise<void> {\n    if (!this.db) throw new Error('Database not initialized');\n\n    return new Promise<void>((resolve, reject) => {\n      const transaction = this.db!.transaction('logs', 'readonly');\n      const store = transaction.objectStore('logs');\n      const index = store.index('sessionId');\n      const request = index.openCursor(IDBKeyRange.only(sessionId));\n\n      request.onsuccess = () => {\n        const cursor = request.result;\n        if (cursor) {\n          onLog(cursor.value);\n          cursor.continue();\n        } else {\n          resolve();\n        }\n      };\n      request.onerror = () => reject(request.error);\n    });\n  }\n\n  /**\n   * Flushes outstanding logs, stops heartbeat, and closes connection.\n   */\n  async close(): Promise<void> {\n    this.stopHeartbeat();\n    await this.flush();\n    if (this.db) {\n      this.db.close();\n      this.db = null;\n    }\n  }\n}\n","export interface EventChannelMessage<T = any> {\n  type: string;\n  payload: T;\n}\n\nexport class EventChannel {\n  private channel: BroadcastChannel;\n  private listeners = new Map<string, Set<(payload: any) => void>>();\n\n  constructor(name: string) {\n    this.channel = new BroadcastChannel(name);\n    this.channel.onmessage = (event: MessageEvent) => {\n      const data = event.data as EventChannelMessage;\n      if (data && typeof data.type === 'string') {\n        const callbacks = this.listeners.get(data.type);\n        if (callbacks) {\n          for (const callback of callbacks) {\n            try {\n              callback(data.payload);\n            } catch (e) {\n              console.error('Error in EventChannel callback:', e);\n            }\n          }\n        }\n      }\n    };\n  }\n\n  /**\n   * Publishes an event to the BroadcastChannel.\n   */\n  publish<T>(type: string, payload: T): void {\n    this.channel.postMessage({ type, payload });\n  }\n\n  /**\n   * Subscribes to a specific event type. Returns an unsubscribe function.\n   */\n  subscribe<T>(type: string, callback: (payload: T) => void): () => void {\n    if (!this.listeners.has(type)) {\n      this.listeners.set(type, new Set());\n    }\n    this.listeners.get(type)!.add(callback);\n    return () => {\n      const callbacks = this.listeners.get(type);\n      if (callbacks) {\n        callbacks.delete(callback);\n        if (callbacks.size === 0) {\n          this.listeners.delete(type);\n        }\n      }\n    };\n  }\n\n  /**\n   * Closes the underlying BroadcastChannel.\n   */\n  close(): void {\n    this.channel.close();\n    this.listeners.clear();\n  }\n}\n","import type { WmeSDK } from 'wme-sdk-typings';\nimport { generateSessionId } from '../utils/session.js';\nimport { EventChannel } from '../utils/EventChannel.js';\nimport { getWazeWindow } from '../utils/window.js';\n\nexport interface SessionManagerConfig {\n  dbPrefix: string;\n  scriptVersion: string;\n  wmeSDK?: WmeSDK;\n}\n\nexport class SessionManager {\n  private dbPrefix: string;\n  private scriptVersion: string;\n  private wmeSDK?: WmeSDK;\n  private sessionId: string | null = null;\n  private tabId: string;\n  private channel: EventChannel | null = null;\n\n  constructor(config: SessionManagerConfig) {\n    this.dbPrefix = config.dbPrefix;\n    this.scriptVersion = config.scriptVersion;\n    this.wmeSDK = config.wmeSDK;\n    this.tabId = `tab_${Date.now()}_${Math.random().toString(36).substring(2, 11)}`;\n  }\n\n  /**\n   * Initializes the session, handling tab isolation and duplicates.\n   */\n  async initSession(): Promise<string> {\n    const channelName = `wme-logstream-tab-isolation-${this.dbPrefix}`;\n    this.channel = new EventChannel(channelName);\n\n    let candidateId = sessionStorage.getItem('wme_logstream_session_id');\n\n    if (!candidateId || (await this._probeConflict(candidateId))) {\n      candidateId = generateSessionId();\n      sessionStorage.setItem('wme_logstream_session_id', candidateId);\n    }\n\n    this.sessionId = candidateId;\n\n    // Listen to respond to other tabs' probes\n    this.channel.subscribe<{ sessionId: string; tabId: string }>('PROBE', (payload) => {\n      if (payload.sessionId === this.sessionId && payload.tabId !== this.tabId) {\n        // Send conflict response\n        this.channel?.publish('CONFLICT', {\n          sessionId: this.sessionId,\n        });\n      }\n    });\n\n    return this.sessionId;\n  }\n\n  private async _probeConflict(sessionId = this.sessionId): Promise<boolean> {\n    if (!sessionId || !this.channel) {\n      throw new Error('Session has not been initialized or channel is closed.');\n    }\n\n    return new Promise<boolean>((resolve) => {\n      const timeout = setTimeout(() => {\n        resolve(false);\n      }, 50);\n\n      const unsubscribeConflict = this.channel!.subscribe<{ sessionId: string }>(\n        'CONFLICT',\n        (payload) => {\n          if (payload.sessionId === sessionId) {\n            unsubscribeConflict?.();\n            clearTimeout(timeout);\n            resolve(true);\n          }\n        },\n      );\n\n      this.channel!.publish('PROBE', {\n        sessionId,\n        tabId: this.tabId,\n      });\n    });\n  }\n\n  /**\n   * Defensively extract the WME version from passed SDK or global window context.\n   */\n  getWmeVersion(): string | null {\n    try {\n      // 1. Try passed SDK\n      if (typeof this.wmeSDK?.getWMEVersion === 'function') {\n        return this.wmeSDK.getWMEVersion();\n      }\n\n      // 2. Try window.W.version or unsafeWindow.W.version via getWazeWindow\n      const wazeWin = getWazeWindow();\n      if (wazeWin?.W?.version) {\n        return wazeWin.W.version;\n      }\n    } catch {\n      // Safe fallback\n    }\n    return null;\n  }\n\n  /**\n   * Returns current session ID if initialized\n   */\n  getSessionId(): string {\n    if (!this.sessionId) {\n      throw new Error('Session has not been initialized. Call initSession() first.');\n    }\n    return this.sessionId;\n  }\n\n  /**\n   * Closes the session event channel\n   */\n  close() {\n    if (this.channel) {\n      this.channel.close();\n      this.channel = null;\n    }\n  }\n}\n","/**\n * Generates a unique, randomized Session ID string.\n */\nexport function generateSessionId(): string {\n  return `session_${Date.now()}_${Math.random().toString(36).substring(2, 11)}`;\n}\n","/**\n * Returns the actual active window object, prioritizing unsafeWindow in Tampermonkey.\n */\nexport function getWazeWindow(): any {\n  if (typeof (globalThis as any).unsafeWindow !== 'undefined') {\n    return (globalThis as any).unsafeWindow;\n  }\n  if (typeof window !== 'undefined') {\n    return window;\n  }\n  return globalThis;\n}\n","// DEFLATE is a complex format; to read this code, you should probably check the RFC first:\n// https://tools.ietf.org/html/rfc1951\n// You may also wish to take a look at the guide I made about this program:\n// https://gist.github.com/101arrowz/253f31eb5abc3d9275ab943003ffecad\n// Some of the following code is similar to that of UZIP.js:\n// https://github.com/photopea/UZIP.js\n// However, the vast majority of the codebase has diverged from UZIP.js to increase performance and reduce bundle size.\n// Sometimes 0 will appear where -1 would be more appropriate. This is because using a uint\n// is better for memory in most engines (I *think*).\nvar ch2 = {};\nvar wk = (function (c, id, msg, transfer, cb) {\n    var w = new Worker(ch2[id] || (ch2[id] = URL.createObjectURL(new Blob([\n        c + ';addEventListener(\"error\",function(e){e=e.error;postMessage({$e$:[e.message,e.code,e.stack]})})'\n    ], { type: 'text/javascript' }))));\n    w.onmessage = function (e) {\n        var d = e.data, ed = d.$e$;\n        if (ed) {\n            var err = new Error(ed[0]);\n            err['code'] = ed[1];\n            err.stack = ed[2];\n            cb(err, null);\n        }\n        else\n            cb(null, d);\n    };\n    w.postMessage(msg, transfer);\n    return w;\n});\n\n// aliases for shorter compressed code (most minifers don't do this)\nvar u8 = Uint8Array, u16 = Uint16Array, i32 = Int32Array;\n// fixed length extra bits\nvar fleb = new u8([0, 0, 0, 0, 0, 0, 0, 0, 1, 1, 1, 1, 2, 2, 2, 2, 3, 3, 3, 3, 4, 4, 4, 4, 5, 5, 5, 5, 0, /* unused */ 0, 0, /* impossible */ 0]);\n// fixed distance extra bits\nvar fdeb = new u8([0, 0, 0, 0, 1, 1, 2, 2, 3, 3, 4, 4, 5, 5, 6, 6, 7, 7, 8, 8, 9, 9, 10, 10, 11, 11, 12, 12, 13, 13, /* unused */ 0, 0]);\n// code length index map\nvar clim = new u8([16, 17, 18, 0, 8, 7, 9, 6, 10, 5, 11, 4, 12, 3, 13, 2, 14, 1, 15]);\n// get base, reverse index map from extra bits\nvar freb = function (eb, start) {\n    var b = new u16(31);\n    for (var i = 0; i < 31; ++i) {\n        b[i] = start += 1 << eb[i - 1];\n    }\n    // numbers here are at max 18 bits\n    var r = new i32(b[30]);\n    for (var i = 1; i < 30; ++i) {\n        for (var j = b[i]; j < b[i + 1]; ++j) {\n            r[j] = ((j - b[i]) << 5) | i;\n        }\n    }\n    return { b: b, r: r };\n};\nvar _a = freb(fleb, 2), fl = _a.b, revfl = _a.r;\n// we can ignore the fact that the other numbers are wrong; they never happen anyway\nfl[28] = 258, revfl[258] = 28;\nvar _b = freb(fdeb, 0), fd = _b.b, revfd = _b.r;\n// map of value to reverse (assuming 16 bits)\nvar rev = new u16(32768);\nfor (var i = 0; i < 32768; ++i) {\n    // reverse table algorithm from SO\n    var x = ((i & 0xAAAA) >> 1) | ((i & 0x5555) << 1);\n    x = ((x & 0xCCCC) >> 2) | ((x & 0x3333) << 2);\n    x = ((x & 0xF0F0) >> 4) | ((x & 0x0F0F) << 4);\n    rev[i] = (((x & 0xFF00) >> 8) | ((x & 0x00FF) << 8)) >> 1;\n}\n// create huffman tree from u8 \"map\": index -> code length for code index\n// mb (max bits) must be at most 15\n// TODO: optimize/split up?\nvar hMap = (function (cd, mb, r) {\n    var s = cd.length;\n    // index\n    var i = 0;\n    // u16 \"map\": index -> # of codes with bit length = index\n    var l = new u16(mb);\n    // length of cd must be 288 (total # of codes)\n    for (; i < s; ++i) {\n        if (cd[i])\n            ++l[cd[i] - 1];\n    }\n    // u16 \"map\": index -> minimum code for bit length = index\n    var le = new u16(mb);\n    for (i = 1; i < mb; ++i) {\n        le[i] = (le[i - 1] + l[i - 1]) << 1;\n    }\n    var co;\n    if (r) {\n        // u16 \"map\": index -> number of actual bits, symbol for code\n        co = new u16(1 << mb);\n        // bits to remove for reverser\n        var rvb = 15 - mb;\n        for (i = 0; i < s; ++i) {\n            // ignore 0 lengths\n            if (cd[i]) {\n                // num encoding both symbol and bits read\n                var sv = (i << 4) | cd[i];\n                // free bits\n                var r_1 = mb - cd[i];\n                // start value\n                var v = le[cd[i] - 1]++ << r_1;\n                // m is end value\n                for (var m = v | ((1 << r_1) - 1); v <= m; ++v) {\n                    // every 16 bit value starting with the code yields the same result\n                    co[rev[v] >> rvb] = sv;\n                }\n            }\n        }\n    }\n    else {\n        co = new u16(s);\n        for (i = 0; i < s; ++i) {\n            if (cd[i]) {\n                co[i] = rev[le[cd[i] - 1]++] >> (15 - cd[i]);\n            }\n        }\n    }\n    return co;\n});\n// fixed length tree\nvar flt = new u8(288);\nfor (var i = 0; i < 144; ++i)\n    flt[i] = 8;\nfor (var i = 144; i < 256; ++i)\n    flt[i] = 9;\nfor (var i = 256; i < 280; ++i)\n    flt[i] = 7;\nfor (var i = 280; i < 288; ++i)\n    flt[i] = 8;\n// fixed distance tree\nvar fdt = new u8(32);\nfor (var i = 0; i < 32; ++i)\n    fdt[i] = 5;\n// fixed length map\nvar flm = /*#__PURE__*/ hMap(flt, 9, 0), flrm = /*#__PURE__*/ hMap(flt, 9, 1);\n// fixed distance map\nvar fdm = /*#__PURE__*/ hMap(fdt, 5, 0), fdrm = /*#__PURE__*/ hMap(fdt, 5, 1);\n// find max of array\nvar max = function (a) {\n    var m = a[0];\n    for (var i = 1; i < a.length; ++i) {\n        if (a[i] > m)\n            m = a[i];\n    }\n    return m;\n};\n// read d, starting at bit p and mask with m\nvar bits = function (d, p, m) {\n    var o = (p / 8) | 0;\n    return ((d[o] | (d[o + 1] << 8)) >> (p & 7)) & m;\n};\n// read d, starting at bit p continuing for at least 16 bits\nvar bits16 = function (d, p) {\n    var o = (p / 8) | 0;\n    return ((d[o] | (d[o + 1] << 8) | (d[o + 2] << 16)) >> (p & 7));\n};\n// get end of byte\nvar shft = function (p) { return ((p + 7) / 8) | 0; };\n// typed array slice - allows garbage collector to free original reference,\n// while being more compatible than .slice\nvar slc = function (v, s, e) {\n    if (s == null || s < 0)\n        s = 0;\n    if (e == null || e > v.length)\n        e = v.length;\n    // can't use .constructor in case user-supplied\n    return new u8(v.subarray(s, e));\n};\n/**\n * Codes for errors generated within this library\n */\nexport var FlateErrorCode = {\n    UnexpectedEOF: 0,\n    InvalidBlockType: 1,\n    InvalidLengthLiteral: 2,\n    InvalidDistance: 3,\n    StreamFinished: 4,\n    NoStreamHandler: 5,\n    InvalidHeader: 6,\n    NoCallback: 7,\n    InvalidUTF8: 8,\n    ExtraFieldTooLong: 9,\n    InvalidDate: 10,\n    FilenameTooLong: 11,\n    StreamFinishing: 12,\n    InvalidZipData: 13,\n    UnknownCompressionMethod: 14\n};\n// error codes\nvar ec = [\n    'unexpected EOF',\n    'invalid block type',\n    'invalid length/literal',\n    'invalid distance',\n    'stream finished',\n    'no stream handler',\n    , // determined by compression function\n    'no callback',\n    'invalid UTF-8 data',\n    'extra field too long',\n    'date not in range 1980-2099',\n    'filename too long',\n    'stream finishing',\n    'invalid zip data'\n    // determined by unknown compression method\n];\n;\nvar err = function (ind, msg, nt) {\n    var e = new Error(msg || ec[ind]);\n    e.code = ind;\n    if (Error.captureStackTrace)\n        Error.captureStackTrace(e, err);\n    if (!nt)\n        throw e;\n    return e;\n};\n// expands raw DEFLATE data\nvar inflt = function (dat, st, buf, dict) {\n    // source length       dict length\n    var sl = dat.length, dl = dict ? dict.length : 0;\n    if (!sl || st.f && !st.l)\n        return buf || new u8(0);\n    var noBuf = !buf;\n    // have to estimate size\n    var resize = noBuf || st.i != 2;\n    // no state\n    var noSt = st.i;\n    // Assumes roughly 33% compression ratio average\n    if (noBuf)\n        buf = new u8(sl * 3);\n    // ensure buffer can fit at least l elements\n    var cbuf = function (l) {\n        var bl = buf.length;\n        // need to increase size to fit\n        if (l > bl) {\n            // Double or set to necessary, whichever is greater\n            var nbuf = new u8(Math.max(bl * 2, l));\n            nbuf.set(buf);\n            buf = nbuf;\n        }\n    };\n    //  last chunk         bitpos           bytes\n    var final = st.f || 0, pos = st.p || 0, bt = st.b || 0, lm = st.l, dm = st.d, lbt = st.m, dbt = st.n;\n    // total bits\n    var tbts = sl * 8;\n    do {\n        if (!lm) {\n            // BFINAL - this is only 1 when last chunk is next\n            final = bits(dat, pos, 1);\n            // type: 0 = no compression, 1 = fixed huffman, 2 = dynamic huffman\n            var type = bits(dat, pos + 1, 3);\n            pos += 3;\n            if (!type) {\n                // go to end of byte boundary\n                var s = shft(pos) + 4, l = dat[s - 4] | (dat[s - 3] << 8), t = s + l;\n                if (t > sl) {\n                    if (noSt)\n                        err(0);\n                    break;\n                }\n                // ensure size\n                if (resize)\n                    cbuf(bt + l);\n                // Copy over uncompressed data\n                buf.set(dat.subarray(s, t), bt);\n                // Get new bitpos, update byte count\n                st.b = bt += l, st.p = pos = t * 8, st.f = final;\n                continue;\n            }\n            else if (type == 1)\n                lm = flrm, dm = fdrm, lbt = 9, dbt = 5;\n            else if (type == 2) {\n                //  literal                            lengths\n                var hLit = bits(dat, pos, 31) + 257, hcLen = bits(dat, pos + 10, 15) + 4;\n                var tl = hLit + bits(dat, pos + 5, 31) + 1;\n                pos += 14;\n                // length+distance tree\n                var ldt = new u8(tl);\n                // code length tree\n                var clt = new u8(19);\n                for (var i = 0; i < hcLen; ++i) {\n                    // use index map to get real code\n                    clt[clim[i]] = bits(dat, pos + i * 3, 7);\n                }\n                pos += hcLen * 3;\n                // code lengths bits\n                var clb = max(clt), clbmsk = (1 << clb) - 1;\n                // code lengths map\n                var clm = hMap(clt, clb, 1);\n                for (var i = 0; i < tl;) {\n                    var r = clm[bits(dat, pos, clbmsk)];\n                    // bits read\n                    pos += r & 15;\n                    // symbol\n                    var s = r >> 4;\n                    // code length to copy\n                    if (s < 16) {\n                        ldt[i++] = s;\n                    }\n                    else {\n                        //  copy   count\n                        var c = 0, n = 0;\n                        if (s == 16)\n                            n = 3 + bits(dat, pos, 3), pos += 2, c = ldt[i - 1];\n                        else if (s == 17)\n                            n = 3 + bits(dat, pos, 7), pos += 3;\n                        else if (s == 18)\n                            n = 11 + bits(dat, pos, 127), pos += 7;\n                        while (n--)\n                            ldt[i++] = c;\n                    }\n                }\n                //    length tree                 distance tree\n                var lt = ldt.subarray(0, hLit), dt = ldt.subarray(hLit);\n                // max length bits\n                lbt = max(lt);\n                // max dist bits\n                dbt = max(dt);\n                lm = hMap(lt, lbt, 1);\n                dm = hMap(dt, dbt, 1);\n            }\n            else\n                err(1);\n            if (pos > tbts) {\n                if (noSt)\n                    err(0);\n                break;\n            }\n        }\n        // Make sure the buffer can hold this + the largest possible addition\n        // Maximum chunk size (practically, theoretically infinite) is 2^17\n        if (resize)\n            cbuf(bt + 131072);\n        var lms = (1 << lbt) - 1, dms = (1 << dbt) - 1;\n        var lpos = pos;\n        for (;; lpos = pos) {\n            // bits read, code\n            var c = lm[bits16(dat, pos) & lms], sym = c >> 4;\n            pos += c & 15;\n            if (pos > tbts) {\n                if (noSt)\n                    err(0);\n                break;\n            }\n            if (!c)\n                err(2);\n            if (sym < 256)\n                buf[bt++] = sym;\n            else if (sym == 256) {\n                lpos = pos, lm = null;\n                break;\n            }\n            else {\n                var add = sym - 254;\n                // no extra bits needed if less\n                if (sym > 264) {\n                    // index\n                    var i = sym - 257, b = fleb[i];\n                    add = bits(dat, pos, (1 << b) - 1) + fl[i];\n                    pos += b;\n                }\n                // dist\n                var d = dm[bits16(dat, pos) & dms], dsym = d >> 4;\n                if (!d)\n                    err(3);\n                pos += d & 15;\n                var dt = fd[dsym];\n                if (dsym > 3) {\n                    var b = fdeb[dsym];\n                    dt += bits16(dat, pos) & (1 << b) - 1, pos += b;\n                }\n                if (pos > tbts) {\n                    if (noSt)\n                        err(0);\n                    break;\n                }\n                if (resize)\n                    cbuf(bt + 131072);\n                var end = bt + add;\n                if (bt < dt) {\n                    var shift = dl - dt, dend = Math.min(dt, end);\n                    if (shift + bt < 0)\n                        err(3);\n                    for (; bt < dend; ++bt)\n                        buf[bt] = dict[shift + bt];\n                }\n                for (; bt < end; ++bt)\n                    buf[bt] = buf[bt - dt];\n            }\n        }\n        st.l = lm, st.p = lpos, st.b = bt, st.f = final;\n        if (lm)\n            final = 1, st.m = lbt, st.d = dm, st.n = dbt;\n    } while (!final);\n    // don't reallocate for streams or user buffers\n    return bt != buf.length && noBuf ? slc(buf, 0, bt) : buf.subarray(0, bt);\n};\n// starting at p, write the minimum number of bits that can hold v to d\nvar wbits = function (d, p, v) {\n    v <<= p & 7;\n    var o = (p / 8) | 0;\n    d[o] |= v;\n    d[o + 1] |= v >> 8;\n};\n// starting at p, write the minimum number of bits (>8) that can hold v to d\nvar wbits16 = function (d, p, v) {\n    v <<= p & 7;\n    var o = (p / 8) | 0;\n    d[o] |= v;\n    d[o + 1] |= v >> 8;\n    d[o + 2] |= v >> 16;\n};\n// creates code lengths from a frequency table\nvar hTree = function (d, mb) {\n    // Need extra info to make a tree\n    var t = [];\n    for (var i = 0; i < d.length; ++i) {\n        if (d[i])\n            t.push({ s: i, f: d[i] });\n    }\n    var s = t.length;\n    var t2 = t.slice();\n    if (!s)\n        return { t: et, l: 0 };\n    if (s == 1) {\n        var v = new u8(t[0].s + 1);\n        v[t[0].s] = 1;\n        return { t: v, l: 1 };\n    }\n    t.sort(function (a, b) { return a.f - b.f; });\n    // after i2 reaches last ind, will be stopped\n    // freq must be greater than largest possible number of symbols\n    t.push({ s: -1, f: 25001 });\n    var l = t[0], r = t[1], i0 = 0, i1 = 1, i2 = 2;\n    t[0] = { s: -1, f: l.f + r.f, l: l, r: r };\n    // efficient algorithm from UZIP.js\n    // i0 is lookbehind, i2 is lookahead - after processing two low-freq\n    // symbols that combined have high freq, will start processing i2 (high-freq,\n    // non-composite) symbols instead\n    // see https://reddit.com/r/photopea/comments/ikekht/uzipjs_questions/\n    while (i1 != s - 1) {\n        l = t[t[i0].f < t[i2].f ? i0++ : i2++];\n        r = t[i0 != i1 && t[i0].f < t[i2].f ? i0++ : i2++];\n        t[i1++] = { s: -1, f: l.f + r.f, l: l, r: r };\n    }\n    var maxSym = t2[0].s;\n    for (var i = 1; i < s; ++i) {\n        if (t2[i].s > maxSym)\n            maxSym = t2[i].s;\n    }\n    // code lengths\n    var tr = new u16(maxSym + 1);\n    // max bits in tree\n    var mbt = ln(t[i1 - 1], tr, 0);\n    if (mbt > mb) {\n        // more algorithms from UZIP.js\n        // TODO: find out how this code works (debt)\n        //  ind    debt\n        var i = 0, dt = 0;\n        //    left            cost\n        var lft = mbt - mb, cst = 1 << lft;\n        t2.sort(function (a, b) { return tr[b.s] - tr[a.s] || a.f - b.f; });\n        for (; i < s; ++i) {\n            var i2_1 = t2[i].s;\n            if (tr[i2_1] > mb) {\n                dt += cst - (1 << (mbt - tr[i2_1]));\n                tr[i2_1] = mb;\n            }\n            else\n                break;\n        }\n        dt >>= lft;\n        while (dt > 0) {\n            var i2_2 = t2[i].s;\n            if (tr[i2_2] < mb)\n                dt -= 1 << (mb - tr[i2_2]++ - 1);\n            else\n                ++i;\n        }\n        for (; i >= 0 && dt; --i) {\n            var i2_3 = t2[i].s;\n            if (tr[i2_3] == mb) {\n                --tr[i2_3];\n                ++dt;\n            }\n        }\n        mbt = mb;\n    }\n    return { t: new u8(tr), l: mbt };\n};\n// get the max length and assign length codes\nvar ln = function (n, l, d) {\n    return n.s == -1\n        ? Math.max(ln(n.l, l, d + 1), ln(n.r, l, d + 1))\n        : (l[n.s] = d);\n};\n// length codes generation\nvar lc = function (c) {\n    var s = c.length;\n    // Note that the semicolon was intentional\n    while (s && !c[--s])\n        ;\n    var cl = new u16(++s);\n    //  ind      num         streak\n    var cli = 0, cln = c[0], cls = 1;\n    var w = function (v) { cl[cli++] = v; };\n    for (var i = 1; i <= s; ++i) {\n        if (c[i] == cln && i != s)\n            ++cls;\n        else {\n            if (!cln && cls > 2) {\n                for (; cls > 138; cls -= 138)\n                    w(32754);\n                if (cls > 2) {\n                    w(cls > 10 ? ((cls - 11) << 5) | 28690 : ((cls - 3) << 5) | 12305);\n                    cls = 0;\n                }\n            }\n            else if (cls > 3) {\n                w(cln), --cls;\n                for (; cls > 6; cls -= 6)\n                    w(8304);\n                if (cls > 2)\n                    w(((cls - 3) << 5) | 8208), cls = 0;\n            }\n            while (cls--)\n                w(cln);\n            cls = 1;\n            cln = c[i];\n        }\n    }\n    return { c: cl.subarray(0, cli), n: s };\n};\n// calculate the length of output from tree, code lengths\nvar clen = function (cf, cl) {\n    var l = 0;\n    for (var i = 0; i < cl.length; ++i)\n        l += cf[i] * cl[i];\n    return l;\n};\n// writes a fixed block\n// returns the new bit pos\nvar wfblk = function (out, pos, dat) {\n    // no need to write 00 as type: TypedArray defaults to 0\n    var s = dat.length;\n    var o = shft(pos + 2);\n    out[o] = s & 255;\n    out[o + 1] = s >> 8;\n    out[o + 2] = out[o] ^ 255;\n    out[o + 3] = out[o + 1] ^ 255;\n    for (var i = 0; i < s; ++i)\n        out[o + i + 4] = dat[i];\n    return (o + 4 + s) * 8;\n};\n// writes a block\nvar wblk = function (dat, out, final, syms, lf, df, eb, li, bs, bl, p) {\n    wbits(out, p++, final);\n    ++lf[256];\n    var _a = hTree(lf, 15), dlt = _a.t, mlb = _a.l;\n    var _b = hTree(df, 15), ddt = _b.t, mdb = _b.l;\n    var _c = lc(dlt), lclt = _c.c, nlc = _c.n;\n    var _d = lc(ddt), lcdt = _d.c, ndc = _d.n;\n    var lcfreq = new u16(19);\n    for (var i = 0; i < lclt.length; ++i)\n        ++lcfreq[lclt[i] & 31];\n    for (var i = 0; i < lcdt.length; ++i)\n        ++lcfreq[lcdt[i] & 31];\n    var _e = hTree(lcfreq, 7), lct = _e.t, mlcb = _e.l;\n    var nlcc = 19;\n    for (; nlcc > 4 && !lct[clim[nlcc - 1]]; --nlcc)\n        ;\n    var flen = (bl + 5) << 3;\n    var ftlen = clen(lf, flt) + clen(df, fdt) + eb;\n    var dtlen = clen(lf, dlt) + clen(df, ddt) + eb + 14 + 3 * nlcc + clen(lcfreq, lct) + 2 * lcfreq[16] + 3 * lcfreq[17] + 7 * lcfreq[18];\n    if (bs >= 0 && flen <= ftlen && flen <= dtlen)\n        return wfblk(out, p, dat.subarray(bs, bs + bl));\n    var lm, ll, dm, dl;\n    wbits(out, p, 1 + (dtlen < ftlen)), p += 2;\n    if (dtlen < ftlen) {\n        lm = hMap(dlt, mlb, 0), ll = dlt, dm = hMap(ddt, mdb, 0), dl = ddt;\n        var llm = hMap(lct, mlcb, 0);\n        wbits(out, p, nlc - 257);\n        wbits(out, p + 5, ndc - 1);\n        wbits(out, p + 10, nlcc - 4);\n        p += 14;\n        for (var i = 0; i < nlcc; ++i)\n            wbits(out, p + 3 * i, lct[clim[i]]);\n        p += 3 * nlcc;\n        var lcts = [lclt, lcdt];\n        for (var it = 0; it < 2; ++it) {\n            var clct = lcts[it];\n            for (var i = 0; i < clct.length; ++i) {\n                var len = clct[i] & 31;\n                wbits(out, p, llm[len]), p += lct[len];\n                if (len > 15)\n                    wbits(out, p, (clct[i] >> 5) & 127), p += clct[i] >> 12;\n            }\n        }\n    }\n    else {\n        lm = flm, ll = flt, dm = fdm, dl = fdt;\n    }\n    for (var i = 0; i < li; ++i) {\n        var sym = syms[i];\n        if (sym > 255) {\n            var len = (sym >> 18) & 31;\n            wbits16(out, p, lm[len + 257]), p += ll[len + 257];\n            if (len > 7)\n                wbits(out, p, (sym >> 23) & 31), p += fleb[len];\n            var dst = sym & 31;\n            wbits16(out, p, dm[dst]), p += dl[dst];\n            if (dst > 3)\n                wbits16(out, p, (sym >> 5) & 8191), p += fdeb[dst];\n        }\n        else {\n            wbits16(out, p, lm[sym]), p += ll[sym];\n        }\n    }\n    wbits16(out, p, lm[256]);\n    return p + ll[256];\n};\n// deflate options (nice << 13) | chain\nvar deo = /*#__PURE__*/ new i32([65540, 131080, 131088, 131104, 262176, 1048704, 1048832, 2114560, 2117632]);\n// empty\nvar et = /*#__PURE__*/ new u8(0);\n// compresses data into a raw DEFLATE buffer\nvar dflt = function (dat, lvl, plvl, pre, post, st) {\n    var s = st.z || dat.length;\n    var o = new u8(pre + s + 5 * (1 + Math.ceil(s / 7000)) + post);\n    // writing to this writes to the output buffer\n    var w = o.subarray(pre, o.length - post);\n    var lst = st.l;\n    var pos = (st.r || 0) & 7;\n    if (lvl) {\n        if (pos)\n            w[0] = st.r >> 3;\n        var opt = deo[lvl - 1];\n        var n = opt >> 13, c = opt & 8191;\n        var msk_1 = (1 << plvl) - 1;\n        //    prev 2-byte val map    curr 2-byte val map\n        var prev = st.p || new u16(32768), head = st.h || new u16(msk_1 + 1);\n        var bs1_1 = Math.ceil(plvl / 3), bs2_1 = 2 * bs1_1;\n        var hsh = function (i) { return (dat[i] ^ (dat[i + 1] << bs1_1) ^ (dat[i + 2] << bs2_1)) & msk_1; };\n        // 24576 is an arbitrary number of maximum symbols per block\n        // 424 buffer for last block\n        var syms = new i32(25000);\n        // length/literal freq   distance freq\n        var lf = new u16(288), df = new u16(32);\n        //  l/lcnt  exbits  index          l/lind  waitdx          blkpos\n        var lc_1 = 0, eb = 0, i = st.i || 0, li = 0, wi = st.w || 0, bs = 0;\n        for (; i + 2 < s; ++i) {\n            // hash value\n            var hv = hsh(i);\n            // index mod 32768    previous index mod\n            var imod = i & 32767, pimod = head[hv];\n            prev[imod] = pimod;\n            head[hv] = imod;\n            // We always should modify head and prev, but only add symbols if\n            // this data is not yet processed (\"wait\" for wait index)\n            if (wi <= i) {\n                // bytes remaining\n                var rem = s - i;\n                if ((lc_1 > 7000 || li > 24576) && (rem > 423 || !lst)) {\n                    pos = wblk(dat, w, 0, syms, lf, df, eb, li, bs, i - bs, pos);\n                    li = lc_1 = eb = 0, bs = i;\n                    for (var j = 0; j < 286; ++j)\n                        lf[j] = 0;\n                    for (var j = 0; j < 30; ++j)\n                        df[j] = 0;\n                }\n                //  len    dist   chain\n                var l = 2, d = 0, ch_1 = c, dif = imod - pimod & 32767;\n                if (rem > 2 && hv == hsh(i - dif)) {\n                    var maxn = Math.min(n, rem) - 1;\n                    var maxd = Math.min(32767, i);\n                    // max possible length\n                    // not capped at dif because decompressors implement \"rolling\" index population\n                    var ml = Math.min(258, rem);\n                    while (dif <= maxd && --ch_1 && imod != pimod) {\n                        if (dat[i + l] == dat[i + l - dif]) {\n                            var nl = 0;\n                            for (; nl < ml && dat[i + nl] == dat[i + nl - dif]; ++nl)\n                                ;\n                            if (nl > l) {\n                                l = nl, d = dif;\n                                // break out early when we reach \"nice\" (we are satisfied enough)\n                                if (nl > maxn)\n                                    break;\n                                // now, find the rarest 2-byte sequence within this\n                                // length of literals and search for that instead.\n                                // Much faster than just using the start\n                                var mmd = Math.min(dif, nl - 2);\n                                var md = 0;\n                                for (var j = 0; j < mmd; ++j) {\n                                    var ti = i - dif + j & 32767;\n                                    var pti = prev[ti];\n                                    var cd = ti - pti & 32767;\n                                    if (cd > md)\n                                        md = cd, pimod = ti;\n                                }\n                            }\n                        }\n                        // check the previous match\n                        imod = pimod, pimod = prev[imod];\n                        dif += imod - pimod & 32767;\n                    }\n                }\n                // d will be nonzero only when a match was found\n                if (d) {\n                    // store both dist and len data in one int32\n                    // Make sure this is recognized as a len/dist with 28th bit (2^28)\n                    syms[li++] = 268435456 | (revfl[l] << 18) | revfd[d];\n                    var lin = revfl[l] & 31, din = revfd[d] & 31;\n                    eb += fleb[lin] + fdeb[din];\n                    ++lf[257 + lin];\n                    ++df[din];\n                    wi = i + l;\n                    ++lc_1;\n                }\n                else {\n                    syms[li++] = dat[i];\n                    ++lf[dat[i]];\n                }\n            }\n        }\n        for (i = Math.max(i, wi); i < s; ++i) {\n            syms[li++] = dat[i];\n            ++lf[dat[i]];\n        }\n        pos = wblk(dat, w, lst, syms, lf, df, eb, li, bs, i - bs, pos);\n        if (!lst) {\n            st.r = (pos & 7) | w[(pos / 8) | 0] << 3;\n            // shft(pos) now 1 less if pos & 7 != 0\n            pos -= 7;\n            st.h = head, st.p = prev, st.i = i, st.w = wi;\n        }\n    }\n    else {\n        for (var i = st.w || 0; i < s + lst; i += 65535) {\n            // end\n            var e = i + 65535;\n            if (e >= s) {\n                // write final block\n                w[(pos / 8) | 0] = lst;\n                e = s;\n            }\n            pos = wfblk(w, pos + 1, dat.subarray(i, e));\n        }\n        st.i = s;\n    }\n    return slc(o, 0, pre + shft(pos) + post);\n};\n// CRC32 table\nvar crct = /*#__PURE__*/ (function () {\n    var t = new Int32Array(256);\n    for (var i = 0; i < 256; ++i) {\n        var c = i, k = 9;\n        while (--k)\n            c = ((c & 1) && -306674912) ^ (c >>> 1);\n        t[i] = c;\n    }\n    return t;\n})();\n// CRC32\nvar crc = function () {\n    var c = -1;\n    return {\n        p: function (d) {\n            // closures have awful performance\n            var cr = c;\n            for (var i = 0; i < d.length; ++i)\n                cr = crct[(cr & 255) ^ d[i]] ^ (cr >>> 8);\n            c = cr;\n        },\n        d: function () { return ~c; }\n    };\n};\n// Adler32\nvar adler = function () {\n    var a = 1, b = 0;\n    return {\n        p: function (d) {\n            // closures have awful performance\n            var n = a, m = b;\n            var l = d.length | 0;\n            for (var i = 0; i != l;) {\n                var e = Math.min(i + 2655, l);\n                for (; i < e; ++i)\n                    m += n += d[i];\n                n = (n & 65535) + 15 * (n >> 16), m = (m & 65535) + 15 * (m >> 16);\n            }\n            a = n, b = m;\n        },\n        d: function () {\n            a %= 65521, b %= 65521;\n            return (a & 255) << 24 | (a & 0xFF00) << 8 | (b & 255) << 8 | (b >> 8);\n        }\n    };\n};\n;\n// deflate with opts\nvar dopt = function (dat, opt, pre, post, st) {\n    if (!st) {\n        st = { l: 1 };\n        if (opt.dictionary) {\n            var dict = opt.dictionary.subarray(-32768);\n            var newDat = new u8(dict.length + dat.length);\n            newDat.set(dict);\n            newDat.set(dat, dict.length);\n            dat = newDat;\n            st.w = dict.length;\n        }\n    }\n    return dflt(dat, opt.level == null ? 6 : opt.level, opt.mem == null ? (st.l ? Math.ceil(Math.max(8, Math.min(13, Math.log(dat.length))) * 1.5) : 20) : (12 + opt.mem), pre, post, st);\n};\n// Walmart object spread\nvar mrg = function (a, b) {\n    var o = {};\n    for (var k in a)\n        o[k] = a[k];\n    for (var k in b)\n        o[k] = b[k];\n    return o;\n};\n// worker clone\n// This is possibly the craziest part of the entire codebase, despite how simple it may seem.\n// The only parameter to this function is a closure that returns an array of variables outside of the function scope.\n// We're going to try to figure out the variable names used in the closure as strings because that is crucial for workerization.\n// We will return an object mapping of true variable name to value (basically, the current scope as a JS object).\n// The reason we can't just use the original variable names is minifiers mangling the toplevel scope.\n// This took me three weeks to figure out how to do.\nvar wcln = function (fn, fnStr, td) {\n    var dt = fn();\n    var st = fn.toString();\n    var ks = st.slice(st.indexOf('[') + 1, st.lastIndexOf(']')).replace(/\\s+/g, '').split(',');\n    for (var i = 0; i < dt.length; ++i) {\n        var v = dt[i], k = ks[i];\n        if (typeof v == 'function') {\n            fnStr += ';' + k + '=';\n            var st_1 = v.toString();\n            if (v.prototype) {\n                // for global objects\n                if (st_1.indexOf('[native code]') != -1) {\n                    var spInd = st_1.indexOf(' ', 8) + 1;\n                    fnStr += st_1.slice(spInd, st_1.indexOf('(', spInd));\n                }\n                else {\n                    fnStr += st_1;\n                    for (var t in v.prototype)\n                        fnStr += ';' + k + '.prototype.' + t + '=' + v.prototype[t].toString();\n                }\n            }\n            else\n                fnStr += st_1;\n        }\n        else\n            td[k] = v;\n    }\n    return fnStr;\n};\nvar ch = [];\n// clone bufs\nvar cbfs = function (v) {\n    var tl = [];\n    for (var k in v) {\n        if (v[k].buffer) {\n            tl.push((v[k] = new v[k].constructor(v[k])).buffer);\n        }\n    }\n    return tl;\n};\n// use a worker to execute code\nvar wrkr = function (fns, init, id, cb) {\n    if (!ch[id]) {\n        var fnStr = '', td_1 = {}, m = fns.length - 1;\n        for (var i = 0; i < m; ++i)\n            fnStr = wcln(fns[i], fnStr, td_1);\n        ch[id] = { c: wcln(fns[m], fnStr, td_1), e: td_1 };\n    }\n    var td = mrg({}, ch[id].e);\n    return wk(ch[id].c + ';onmessage=function(e){for(var k in e.data)self[k]=e.data[k];onmessage=' + init.toString() + '}', id, td, cbfs(td), cb);\n};\n// base async inflate fn\nvar bInflt = function () { return [u8, u16, i32, fleb, fdeb, clim, fl, fd, flrm, fdrm, rev, ec, hMap, max, bits, bits16, shft, slc, err, inflt, inflateSync, pbf, gopt]; };\nvar bDflt = function () { return [u8, u16, i32, fleb, fdeb, clim, revfl, revfd, flm, flt, fdm, fdt, rev, deo, et, hMap, wbits, wbits16, hTree, ln, lc, clen, wfblk, wblk, shft, slc, dflt, dopt, deflateSync, pbf]; };\n// gzip extra\nvar gze = function () { return [gzh, gzhl, wbytes, crc, crct]; };\n// gunzip extra\nvar guze = function () { return [gzs, gzl]; };\n// zlib extra\nvar zle = function () { return [zlh, wbytes, adler]; };\n// unzlib extra\nvar zule = function () { return [zls]; };\n// post buf\nvar pbf = function (msg) { return postMessage(msg, [msg.buffer]); };\n// get opts\nvar gopt = function (o) { return o && {\n    out: o.size && new u8(o.size),\n    dictionary: o.dictionary\n}; };\n// async helper\nvar cbify = function (dat, opts, fns, init, id, cb) {\n    var w = wrkr(fns, init, id, function (err, dat) {\n        w.terminate();\n        cb(err, dat);\n    });\n    w.postMessage([dat, opts], opts.consume ? [dat.buffer] : []);\n    return function () { w.terminate(); };\n};\n// auto stream\nvar astrm = function (strm) {\n    strm.ondata = function (dat, final) { return postMessage([dat, final], [dat.buffer]); };\n    return function (ev) {\n        if (ev.data[0]) {\n            strm.push(ev.data[0], ev.data[1]);\n            postMessage([ev.data[0].length]);\n        }\n        else\n            strm.flush(ev.data[1]);\n    };\n};\n// async stream attach\nvar astrmify = function (fns, strm, opts, init, id, flush, ext) {\n    var t;\n    var w = wrkr(fns, init, id, function (err, dat) {\n        if (err)\n            w.terminate(), strm.ondata.call(strm, err);\n        else if (!Array.isArray(dat))\n            ext(dat);\n        else if (dat.length == 1) {\n            strm.queuedSize -= dat[0];\n            if (strm.ondrain)\n                strm.ondrain(dat[0]);\n        }\n        else {\n            if (dat[1])\n                w.terminate();\n            strm.ondata.call(strm, err, dat[0], dat[1]);\n        }\n    });\n    w.postMessage(opts);\n    strm.queuedSize = 0;\n    strm.push = function (d, f) {\n        if (!strm.ondata)\n            err(5);\n        if (t)\n            strm.ondata(err(4, 0, 1), null, !!f);\n        strm.queuedSize += d.length;\n        // can fail for cross-realm Uint8Array, but ok - only a small performance penalty\n        w.postMessage([d, t = f], d.buffer instanceof ArrayBuffer ? [d.buffer] : []);\n    };\n    strm.terminate = function () { w.terminate(); };\n    if (flush) {\n        strm.flush = function (sync) { w.postMessage([0, sync]); };\n    }\n};\n// read 2 bytes\nvar b2 = function (d, b) { return d[b] | (d[b + 1] << 8); };\n// read 4 bytes\nvar b4 = function (d, b) { return (d[b] | (d[b + 1] << 8) | (d[b + 2] << 16) | (d[b + 3] << 24)) >>> 0; };\n// read 8 bytes\nvar b8 = function (d, b) { return b4(d, b) + (b4(d, b + 4) * 4294967296); };\n// write bytes\nvar wbytes = function (d, b, v) {\n    for (; v; ++b)\n        d[b] = v, v >>>= 8;\n};\n// gzip header\nvar gzh = function (c, o) {\n    var fn = o.filename;\n    c[0] = 31, c[1] = 139, c[2] = 8, c[8] = o.level < 2 ? 4 : o.level == 9 ? 2 : 0, c[9] = 3; // assume Unix\n    if (o.mtime != 0)\n        wbytes(c, 4, Math.floor(new Date(o.mtime || Date.now()) / 1000));\n    if (fn) {\n        c[3] = 8;\n        for (var i = 0; i <= fn.length; ++i)\n            c[i + 10] = fn.charCodeAt(i);\n    }\n};\n// gzip footer: -8 to -4 = CRC, -4 to -0 is length\n// gzip start\nvar gzs = function (d) {\n    if (d[0] != 31 || d[1] != 139 || d[2] != 8)\n        err(6, 'invalid gzip data');\n    var flg = d[3];\n    var st = 10;\n    if (flg & 4)\n        st += (d[10] | d[11] << 8) + 2;\n    for (var zs = (flg >> 3 & 1) + (flg >> 4 & 1); zs > 0; zs -= !d[st++])\n        ;\n    return st + (flg & 2);\n};\n// gzip length\nvar gzl = function (d) {\n    var l = d.length;\n    return (d[l - 4] | d[l - 3] << 8 | d[l - 2] << 16 | d[l - 1] << 24) >>> 0;\n};\n// gzip header length\nvar gzhl = function (o) { return 10 + (o.filename ? o.filename.length + 1 : 0); };\n// zlib header\nvar zlh = function (c, o) {\n    var lv = o.level, fl = lv == 0 ? 0 : lv < 6 ? 1 : lv == 9 ? 3 : 2;\n    c[0] = 120, c[1] = (fl << 6) | (o.dictionary && 32);\n    c[1] |= 31 - ((c[0] << 8) | c[1]) % 31;\n    if (o.dictionary) {\n        var h = adler();\n        h.p(o.dictionary);\n        wbytes(c, 2, h.d());\n    }\n};\n// zlib start\nvar zls = function (d, dict) {\n    if ((d[0] & 15) != 8 || (d[0] >> 4) > 7 || ((d[0] << 8 | d[1]) % 31))\n        err(6, 'invalid zlib data');\n    if ((d[1] >> 5 & 1) == +!dict)\n        err(6, 'invalid zlib data: ' + (d[1] & 32 ? 'need' : 'unexpected') + ' dictionary');\n    return (d[1] >> 3 & 4) + 2;\n};\nfunction StrmOpt(opts, cb) {\n    if (typeof opts == 'function')\n        cb = opts, opts = {};\n    this.ondata = cb;\n    return opts;\n}\n/**\n * Streaming DEFLATE compression\n */\nvar Deflate = /*#__PURE__*/ (function () {\n    function Deflate(opts, cb) {\n        if (typeof opts == 'function')\n            cb = opts, opts = {};\n        this.ondata = cb;\n        this.o = opts || {};\n        this.s = { l: 0, i: 32768, w: 32768, z: 32768 };\n        // Buffer length must always be 0 mod 32768 for index calculations to be correct when modifying head and prev\n        // 98304 = 32768 (lookback) + 65536 (common chunk size)\n        this.b = new u8(98304);\n        if (this.o.dictionary) {\n            var dict = this.o.dictionary.subarray(-32768);\n            this.b.set(dict, 32768 - dict.length);\n            this.s.i = 32768 - dict.length;\n        }\n    }\n    Deflate.prototype.p = function (c, f) {\n        this.ondata(dopt(c, this.o, 0, 0, this.s), f);\n    };\n    /**\n     * Pushes a chunk to be deflated\n     * @param chunk The chunk to push\n     * @param final Whether this is the last chunk\n     */\n    Deflate.prototype.push = function (chunk, final) {\n        if (!this.ondata)\n            err(5);\n        if (this.s.l)\n            err(4);\n        var endLen = chunk.length + this.s.z;\n        if (endLen > this.b.length) {\n            if (endLen > 2 * this.b.length - 32768) {\n                var newBuf = new u8(endLen & -32768);\n                newBuf.set(this.b.subarray(0, this.s.z));\n                this.b = newBuf;\n            }\n            var split = this.b.length - this.s.z;\n            this.b.set(chunk.subarray(0, split), this.s.z);\n            this.s.z = this.b.length;\n            this.p(this.b, false);\n            this.b.set(this.b.subarray(-32768));\n            this.b.set(chunk.subarray(split), 32768);\n            this.s.z = chunk.length - split + 32768;\n            this.s.i = 32766, this.s.w = 32768;\n        }\n        else {\n            this.b.set(chunk, this.s.z);\n            this.s.z += chunk.length;\n        }\n        this.s.l = final & 1;\n        if (this.s.z > this.s.w + 8191 || final) {\n            this.p(this.b, final || false);\n            this.s.w = this.s.i, this.s.i -= 2;\n        }\n        if (final) {\n            // cleanup unneeded buffers/state to reduce memory usage\n            this.s = this.o = {};\n            this.b = et;\n        }\n    };\n    /**\n     * Flushes buffered uncompressed data. Useful to immediately retrieve the\n     * deflated output for small inputs.\n     * @param sync Whether to flush to a byte boundary. A sync flush takes 4-5\n     *             extra bytes, but guarantees all pushed data is immediately\n     *             decompressible. A separate DEFLATE stream may be concatenated\n     *             with the current output after a sync flush.\n     */\n    Deflate.prototype.flush = function (sync) {\n        if (!this.ondata)\n            err(5);\n        if (this.s.l)\n            err(4);\n        this.p(this.b, false);\n        this.s.w = this.s.i, this.s.i -= 2;\n        // could technically skip writing the type-0 block for (this.s.r & 7) == 0,\n        // but the deterministic trailer (00 00 FF FF) is useful in some situations\n        if (sync) {\n            var c = new u8(6);\n            c[0] = this.s.r >> 3;\n            // write empty, non-final type-0 block\n            var ep = wfblk(c, this.s.r, et);\n            this.s.r = 0;\n            this.ondata(c.subarray(0, ep >> 3), false);\n        }\n    };\n    return Deflate;\n}());\nexport { Deflate };\n/**\n * Asynchronous streaming DEFLATE compression\n */\nvar AsyncDeflate = /*#__PURE__*/ (function () {\n    function AsyncDeflate(opts, cb) {\n        astrmify([\n            bDflt,\n            function () { return [astrm, Deflate]; }\n        ], this, StrmOpt.call(this, opts, cb), function (ev) {\n            var strm = new Deflate(ev.data);\n            onmessage = astrm(strm);\n        }, 6, 1);\n    }\n    return AsyncDeflate;\n}());\nexport { AsyncDeflate };\nexport function deflate(data, opts, cb) {\n    if (!cb)\n        cb = opts, opts = {};\n    if (typeof cb != 'function')\n        err(7);\n    return cbify(data, opts, [\n        bDflt,\n    ], function (ev) { return pbf(deflateSync(ev.data[0], ev.data[1])); }, 0, cb);\n}\n/**\n * Compresses data with DEFLATE without any wrapper\n * @param data The data to compress\n * @param opts The compression options\n * @returns The deflated version of the data\n */\nexport function deflateSync(data, opts) {\n    return dopt(data, opts || {}, 0, 0);\n}\n/**\n * Streaming DEFLATE decompression\n */\nvar Inflate = /*#__PURE__*/ (function () {\n    function Inflate(opts, cb) {\n        // no StrmOpt here to avoid adding to workerizer\n        if (typeof opts == 'function')\n            cb = opts, opts = {};\n        this.ondata = cb;\n        var dict = opts && opts.dictionary && opts.dictionary.subarray(-32768);\n        this.s = { i: 0, b: dict ? dict.length : 0 };\n        this.o = new u8(32768);\n        this.p = new u8(0);\n        if (dict)\n            this.o.set(dict);\n    }\n    Inflate.prototype.e = function (c) {\n        if (!this.ondata)\n            err(5);\n        if (this.d)\n            err(4);\n        if (!this.p.length)\n            this.p = c;\n        else if (c.length) {\n            var n = new u8(this.p.length + c.length);\n            n.set(this.p), n.set(c, this.p.length), this.p = n;\n        }\n    };\n    Inflate.prototype.c = function (final) {\n        this.s.i = +(this.d = final || false);\n        var bts = this.s.b;\n        var dt = inflt(this.p, this.s, this.o);\n        this.ondata(slc(dt, bts, this.s.b), this.d);\n        this.o = slc(dt, this.s.b - 32768), this.s.b = this.o.length;\n        this.p = slc(this.p, (this.s.p / 8) | 0), this.s.p &= 7;\n    };\n    /**\n     * Pushes a chunk to be inflated\n     * @param chunk The chunk to push\n     * @param final Whether this is the final chunk\n     */\n    Inflate.prototype.push = function (chunk, final) {\n        this.e(chunk), this.c(final);\n    };\n    return Inflate;\n}());\nexport { Inflate };\n/**\n * Asynchronous streaming DEFLATE decompression\n */\nvar AsyncInflate = /*#__PURE__*/ (function () {\n    function AsyncInflate(opts, cb) {\n        astrmify([\n            bInflt,\n            function () { return [astrm, Inflate]; }\n        ], this, StrmOpt.call(this, opts, cb), function (ev) {\n            var strm = new Inflate(ev.data);\n            onmessage = astrm(strm);\n        }, 7, 0);\n    }\n    return AsyncInflate;\n}());\nexport { AsyncInflate };\nexport function inflate(data, opts, cb) {\n    if (!cb)\n        cb = opts, opts = {};\n    if (typeof cb != 'function')\n        err(7);\n    return cbify(data, opts, [\n        bInflt\n    ], function (ev) { return pbf(inflateSync(ev.data[0], gopt(ev.data[1]))); }, 1, cb);\n}\nexport function inflateSync(data, opts) {\n    return inflt(data, { i: 2 }, opts && opts.out, opts && opts.dictionary);\n}\n// before you yell at me for not just using extends, my reason is that TS inheritance is hard to workerize.\n/**\n * Streaming GZIP compression\n */\nvar Gzip = /*#__PURE__*/ (function () {\n    function Gzip(opts, cb) {\n        this.c = crc();\n        this.l = 0;\n        this.v = 1;\n        Deflate.call(this, opts, cb);\n    }\n    /**\n     * Pushes a chunk to be GZIPped\n     * @param chunk The chunk to push\n     * @param final Whether this is the last chunk\n     */\n    Gzip.prototype.push = function (chunk, final) {\n        this.c.p(chunk);\n        this.l += chunk.length;\n        Deflate.prototype.push.call(this, chunk, final);\n    };\n    Gzip.prototype.p = function (c, f) {\n        var raw = dopt(c, this.o, this.v && gzhl(this.o), f && 8, this.s);\n        if (this.v)\n            gzh(raw, this.o), this.v = 0;\n        if (f)\n            wbytes(raw, raw.length - 8, this.c.d()), wbytes(raw, raw.length - 4, this.l);\n        this.ondata(raw, f);\n    };\n    /**\n     * Flushes buffered uncompressed data. Useful to immediately retrieve the\n     * GZIPped output for small inputs.\n     * @param sync Whether to flush to a byte boundary. A sync flush takes 4-5\n     *             extra bytes, but guarantees all pushed data is immediately\n     *             decompressible.\n     */\n    Gzip.prototype.flush = function (sync) {\n        Deflate.prototype.flush.call(this, sync);\n    };\n    return Gzip;\n}());\nexport { Gzip };\n/**\n * Asynchronous streaming GZIP compression\n */\nvar AsyncGzip = /*#__PURE__*/ (function () {\n    function AsyncGzip(opts, cb) {\n        astrmify([\n            bDflt,\n            gze,\n            function () { return [astrm, Deflate, Gzip]; }\n        ], this, StrmOpt.call(this, opts, cb), function (ev) {\n            var strm = new Gzip(ev.data);\n            onmessage = astrm(strm);\n        }, 8, 1);\n    }\n    return AsyncGzip;\n}());\nexport { AsyncGzip };\nexport function gzip(data, opts, cb) {\n    if (!cb)\n        cb = opts, opts = {};\n    if (typeof cb != 'function')\n        err(7);\n    return cbify(data, opts, [\n        bDflt,\n        gze,\n        function () { return [gzipSync]; }\n    ], function (ev) { return pbf(gzipSync(ev.data[0], ev.data[1])); }, 2, cb);\n}\n/**\n * Compresses data with GZIP\n * @param data The data to compress\n * @param opts The compression options\n * @returns The gzipped version of the data\n */\nexport function gzipSync(data, opts) {\n    if (!opts)\n        opts = {};\n    var c = crc(), l = data.length;\n    c.p(data);\n    var d = dopt(data, opts, gzhl(opts), 8), s = d.length;\n    return gzh(d, opts), wbytes(d, s - 8, c.d()), wbytes(d, s - 4, l), d;\n}\n/**\n * Streaming single or multi-member GZIP decompression\n */\nvar Gunzip = /*#__PURE__*/ (function () {\n    function Gunzip(opts, cb) {\n        this.v = 1;\n        this.r = 0;\n        Inflate.call(this, opts, cb);\n    }\n    /**\n     * Pushes a chunk to be GUNZIPped\n     * @param chunk The chunk to push\n     * @param final Whether this is the last chunk\n     */\n    Gunzip.prototype.push = function (chunk, final) {\n        Inflate.prototype.e.call(this, chunk);\n        this.r += chunk.length;\n        if (this.v) {\n            var p = this.p.subarray(this.v - 1);\n            var s = p.length > 3 ? gzs(p) : 4;\n            if (s > p.length) {\n                if (!final)\n                    return;\n            }\n            else if (this.v > 1 && this.onmember) {\n                this.onmember(this.r - p.length);\n            }\n            this.p = p.subarray(s), this.v = 0;\n        }\n        // necessary to prevent TS from using the closure value\n        // This allows for workerization to function correctly\n        Inflate.prototype.c.call(this, 0);\n        // process concatenated GZIP\n        if (this.s.f && !this.s.l) {\n            this.v = shft(this.s.p) + 9;\n            this.s = { i: 0 };\n            this.o = new u8(0);\n            this.push(new u8(0), final);\n        }\n        else if (final) {\n            Inflate.prototype.c.call(this, final);\n        }\n    };\n    return Gunzip;\n}());\nexport { Gunzip };\n/**\n * Asynchronous streaming single or multi-member GZIP decompression\n */\nvar AsyncGunzip = /*#__PURE__*/ (function () {\n    function AsyncGunzip(opts, cb) {\n        var _this = this;\n        astrmify([\n            bInflt,\n            guze,\n            function () { return [astrm, Inflate, Gunzip]; }\n        ], this, StrmOpt.call(this, opts, cb), function (ev) {\n            var strm = new Gunzip(ev.data);\n            strm.onmember = function (offset) { return postMessage(offset); };\n            onmessage = astrm(strm);\n        }, 9, 0, function (offset) { return _this.onmember && _this.onmember(offset); });\n    }\n    return AsyncGunzip;\n}());\nexport { AsyncGunzip };\nexport function gunzip(data, opts, cb) {\n    if (!cb)\n        cb = opts, opts = {};\n    if (typeof cb != 'function')\n        err(7);\n    return cbify(data, opts, [\n        bInflt,\n        guze,\n        function () { return [gunzipSync]; }\n    ], function (ev) { return pbf(gunzipSync(ev.data[0], ev.data[1])); }, 3, cb);\n}\nexport function gunzipSync(data, opts) {\n    var st = gzs(data);\n    if (st + 8 > data.length)\n        err(6, 'invalid gzip data');\n    return inflt(data.subarray(st, -8), { i: 2 }, opts && opts.out || new u8(gzl(data)), opts && opts.dictionary);\n}\n/**\n * Streaming Zlib compression\n */\nvar Zlib = /*#__PURE__*/ (function () {\n    function Zlib(opts, cb) {\n        this.c = adler();\n        this.v = 1;\n        Deflate.call(this, opts, cb);\n    }\n    /**\n     * Pushes a chunk to be zlibbed\n     * @param chunk The chunk to push\n     * @param final Whether this is the last chunk\n     */\n    Zlib.prototype.push = function (chunk, final) {\n        this.c.p(chunk);\n        Deflate.prototype.push.call(this, chunk, final);\n    };\n    Zlib.prototype.p = function (c, f) {\n        var raw = dopt(c, this.o, this.v && (this.o.dictionary ? 6 : 2), f && 4, this.s);\n        if (this.v)\n            zlh(raw, this.o), this.v = 0;\n        if (f)\n            wbytes(raw, raw.length - 4, this.c.d());\n        this.ondata(raw, f);\n    };\n    /**\n     * Flushes buffered uncompressed data. Useful to immediately retrieve the\n     * zlibbed output for small inputs.\n     * @param sync Whether to flush to a byte boundary. A sync flush takes 4-5\n     *             extra bytes, but guarantees all pushed data is immediately\n     *             decompressible.\n     */\n    Zlib.prototype.flush = function (sync) {\n        Deflate.prototype.flush.call(this, sync);\n    };\n    return Zlib;\n}());\nexport { Zlib };\n/**\n * Asynchronous streaming Zlib compression\n */\nvar AsyncZlib = /*#__PURE__*/ (function () {\n    function AsyncZlib(opts, cb) {\n        astrmify([\n            bDflt,\n            zle,\n            function () { return [astrm, Deflate, Zlib]; }\n        ], this, StrmOpt.call(this, opts, cb), function (ev) {\n            var strm = new Zlib(ev.data);\n            onmessage = astrm(strm);\n        }, 10, 1);\n    }\n    return AsyncZlib;\n}());\nexport { AsyncZlib };\nexport function zlib(data, opts, cb) {\n    if (!cb)\n        cb = opts, opts = {};\n    if (typeof cb != 'function')\n        err(7);\n    return cbify(data, opts, [\n        bDflt,\n        zle,\n        function () { return [zlibSync]; }\n    ], function (ev) { return pbf(zlibSync(ev.data[0], ev.data[1])); }, 4, cb);\n}\n/**\n * Compress data with Zlib\n * @param data The data to compress\n * @param opts The compression options\n * @returns The zlib-compressed version of the data\n */\nexport function zlibSync(data, opts) {\n    if (!opts)\n        opts = {};\n    var a = adler();\n    a.p(data);\n    var d = dopt(data, opts, opts.dictionary ? 6 : 2, 4);\n    return zlh(d, opts), wbytes(d, d.length - 4, a.d()), d;\n}\n/**\n * Streaming Zlib decompression\n */\nvar Unzlib = /*#__PURE__*/ (function () {\n    function Unzlib(opts, cb) {\n        Inflate.call(this, opts, cb);\n        this.v = opts && opts.dictionary ? 2 : 1;\n    }\n    /**\n     * Pushes a chunk to be unzlibbed\n     * @param chunk The chunk to push\n     * @param final Whether this is the last chunk\n     */\n    Unzlib.prototype.push = function (chunk, final) {\n        Inflate.prototype.e.call(this, chunk);\n        if (this.v) {\n            if (this.p.length < 6 && !final)\n                return;\n            this.p = this.p.subarray(zls(this.p, this.v - 1)), this.v = 0;\n        }\n        if (final) {\n            if (this.p.length < 4)\n                err(6, 'invalid zlib data');\n            this.p = this.p.subarray(0, -4);\n        }\n        // necessary to prevent TS from using the closure value\n        // This allows for workerization to function correctly\n        Inflate.prototype.c.call(this, final);\n    };\n    return Unzlib;\n}());\nexport { Unzlib };\n/**\n * Asynchronous streaming Zlib decompression\n */\nvar AsyncUnzlib = /*#__PURE__*/ (function () {\n    function AsyncUnzlib(opts, cb) {\n        astrmify([\n            bInflt,\n            zule,\n            function () { return [astrm, Inflate, Unzlib]; }\n        ], this, StrmOpt.call(this, opts, cb), function (ev) {\n            var strm = new Unzlib(ev.data);\n            onmessage = astrm(strm);\n        }, 11, 0);\n    }\n    return AsyncUnzlib;\n}());\nexport { AsyncUnzlib };\nexport function unzlib(data, opts, cb) {\n    if (!cb)\n        cb = opts, opts = {};\n    if (typeof cb != 'function')\n        err(7);\n    return cbify(data, opts, [\n        bInflt,\n        zule,\n        function () { return [unzlibSync]; }\n    ], function (ev) { return pbf(unzlibSync(ev.data[0], gopt(ev.data[1]))); }, 5, cb);\n}\nexport function unzlibSync(data, opts) {\n    return inflt(data.subarray(zls(data, opts && opts.dictionary), -4), { i: 2 }, opts && opts.out, opts && opts.dictionary);\n}\n// Default algorithm for compression (used because having a known output size allows faster decompression)\nexport { gzip as compress, AsyncGzip as AsyncCompress };\nexport { gzipSync as compressSync, Gzip as Compress };\n/**\n * Streaming GZIP, Zlib, or raw DEFLATE decompression\n */\nvar Decompress = /*#__PURE__*/ (function () {\n    function Decompress(opts, cb) {\n        this.o = StrmOpt.call(this, opts, cb) || {};\n        this.G = Gunzip;\n        this.I = Inflate;\n        this.Z = Unzlib;\n    }\n    // init substream\n    // overriden by AsyncDecompress\n    Decompress.prototype.i = function () {\n        var _this = this;\n        this.s.ondata = function (dat, final) {\n            _this.ondata(dat, final);\n        };\n    };\n    /**\n     * Pushes a chunk to be decompressed\n     * @param chunk The chunk to push\n     * @param final Whether this is the last chunk\n     */\n    Decompress.prototype.push = function (chunk, final) {\n        if (!this.ondata)\n            err(5);\n        if (!this.s) {\n            if (this.p && this.p.length) {\n                var n = new u8(this.p.length + chunk.length);\n                n.set(this.p), n.set(chunk, this.p.length);\n            }\n            else\n                this.p = chunk;\n            if (this.p.length > 2) {\n                this.s = (this.p[0] == 31 && this.p[1] == 139 && this.p[2] == 8)\n                    ? new this.G(this.o)\n                    : ((this.p[0] & 15) != 8 || (this.p[0] >> 4) > 7 || ((this.p[0] << 8 | this.p[1]) % 31))\n                        ? new this.I(this.o)\n                        : new this.Z(this.o);\n                this.i();\n                this.s.push(this.p, final);\n                this.p = null;\n            }\n        }\n        else\n            this.s.push(chunk, final);\n    };\n    return Decompress;\n}());\nexport { Decompress };\n/**\n * Asynchronous streaming GZIP, Zlib, or raw DEFLATE decompression\n */\nvar AsyncDecompress = /*#__PURE__*/ (function () {\n    function AsyncDecompress(opts, cb) {\n        Decompress.call(this, opts, cb);\n        this.queuedSize = 0;\n        this.G = AsyncGunzip;\n        this.I = AsyncInflate;\n        this.Z = AsyncUnzlib;\n    }\n    AsyncDecompress.prototype.i = function () {\n        var _this = this;\n        this.s.ondata = function (err, dat, final) {\n            _this.ondata(err, dat, final);\n        };\n        this.s.ondrain = function (size) {\n            _this.queuedSize -= size;\n            if (_this.ondrain)\n                _this.ondrain(size);\n        };\n    };\n    /**\n     * Pushes a chunk to be decompressed\n     * @param chunk The chunk to push\n     * @param final Whether this is the last chunk\n     */\n    AsyncDecompress.prototype.push = function (chunk, final) {\n        this.queuedSize += chunk.length;\n        Decompress.prototype.push.call(this, chunk, final);\n    };\n    return AsyncDecompress;\n}());\nexport { AsyncDecompress };\nexport function decompress(data, opts, cb) {\n    if (!cb)\n        cb = opts, opts = {};\n    if (typeof cb != 'function')\n        err(7);\n    return (data[0] == 31 && data[1] == 139 && data[2] == 8)\n        ? gunzip(data, opts, cb)\n        : ((data[0] & 15) != 8 || (data[0] >> 4) > 7 || ((data[0] << 8 | data[1]) % 31))\n            ? inflate(data, opts, cb)\n            : unzlib(data, opts, cb);\n}\n/**\n * Expands compressed GZIP, Zlib, or raw DEFLATE data, automatically detecting the format\n * @param data The data to decompress\n * @param opts The decompression options\n * @returns The decompressed version of the data\n */\nexport function decompressSync(data, opts) {\n    return (data[0] == 31 && data[1] == 139 && data[2] == 8)\n        ? gunzipSync(data, opts)\n        : ((data[0] & 15) != 8 || (data[0] >> 4) > 7 || ((data[0] << 8 | data[1]) % 31))\n            ? inflateSync(data, opts)\n            : unzlibSync(data, opts);\n}\n// flatten a directory structure\nvar fltn = function (d, p, t, o) {\n    for (var k in d) {\n        var val = d[k], n = p + k, op = o;\n        if (Array.isArray(val))\n            op = mrg(o, val[1]), val = val[0];\n        if (ArrayBuffer.isView(val))\n            t[n] = [val, op];\n        else {\n            t[n += '/'] = [new u8(0), op];\n            fltn(val, n, t, o);\n        }\n    }\n};\n// text encoder\nvar te = typeof TextEncoder != 'undefined' && /*#__PURE__*/ new TextEncoder();\n// text decoder\nvar td = typeof TextDecoder != 'undefined' && /*#__PURE__*/ new TextDecoder();\n// text decoder stream\nvar tds = 0;\ntry {\n    td.decode(et, { stream: true });\n    tds = 1;\n}\ncatch (e) { }\n// decode UTF8\nvar dutf8 = function (d) {\n    for (var r = '', i = 0;;) {\n        var c = d[i++];\n        var eb = (c > 127) + (c > 223) + (c > 239);\n        if (i + eb > d.length)\n            return { s: r, r: slc(d, i - 1) };\n        if (!eb)\n            r += String.fromCharCode(c);\n        else if (eb == 3) {\n            c = ((c & 15) << 18 | (d[i++] & 63) << 12 | (d[i++] & 63) << 6 | (d[i++] & 63)) - 65536,\n                r += String.fromCharCode(55296 | (c >> 10), 56320 | (c & 1023));\n        }\n        else if (eb & 1)\n            r += String.fromCharCode((c & 31) << 6 | (d[i++] & 63));\n        else\n            r += String.fromCharCode((c & 15) << 12 | (d[i++] & 63) << 6 | (d[i++] & 63));\n    }\n};\n/**\n * Streaming UTF-8 decoding\n */\nvar DecodeUTF8 = /*#__PURE__*/ (function () {\n    /**\n     * Creates a UTF-8 decoding stream\n     * @param cb The callback to call whenever data is decoded\n     */\n    function DecodeUTF8(cb) {\n        this.ondata = cb;\n        if (tds)\n            this.t = new TextDecoder();\n        else\n            this.p = et;\n    }\n    /**\n     * Pushes a chunk to be decoded from UTF-8 binary\n     * @param chunk The chunk to push\n     * @param final Whether this is the last chunk\n     */\n    DecodeUTF8.prototype.push = function (chunk, final) {\n        if (!this.ondata)\n            err(5);\n        final = !!final;\n        if (this.t) {\n            this.ondata(this.t.decode(chunk, { stream: true }), final);\n            if (final) {\n                if (this.t.decode().length)\n                    err(8);\n                this.t = null;\n            }\n            return;\n        }\n        if (!this.p)\n            err(4);\n        var dat = new u8(this.p.length + chunk.length);\n        dat.set(this.p);\n        dat.set(chunk, this.p.length);\n        var _a = dutf8(dat), s = _a.s, r = _a.r;\n        if (final) {\n            if (r.length)\n                err(8);\n            this.p = null;\n        }\n        else\n            this.p = r;\n        this.ondata(s, final);\n    };\n    return DecodeUTF8;\n}());\nexport { DecodeUTF8 };\n/**\n * Streaming UTF-8 encoding\n */\nvar EncodeUTF8 = /*#__PURE__*/ (function () {\n    /**\n     * Creates a UTF-8 decoding stream\n     * @param cb The callback to call whenever data is encoded\n     */\n    function EncodeUTF8(cb) {\n        this.ondata = cb;\n    }\n    /**\n     * Pushes a chunk to be encoded to UTF-8\n     * @param chunk The string data to push\n     * @param final Whether this is the last chunk\n     */\n    EncodeUTF8.prototype.push = function (chunk, final) {\n        if (!this.ondata)\n            err(5);\n        if (this.d)\n            err(4);\n        this.ondata(strToU8(chunk), this.d = final || false);\n    };\n    return EncodeUTF8;\n}());\nexport { EncodeUTF8 };\n/**\n * Converts a string into a Uint8Array for use with compression/decompression methods\n * @param str The string to encode\n * @param latin1 Whether or not to interpret the data as Latin-1. This should\n *               not need to be true unless decoding a binary string.\n * @returns The string encoded in UTF-8/Latin-1 binary\n */\nexport function strToU8(str, latin1) {\n    if (latin1) {\n        var ar_1 = new u8(str.length);\n        for (var i = 0; i < str.length; ++i)\n            ar_1[i] = str.charCodeAt(i);\n        return ar_1;\n    }\n    if (te)\n        return te.encode(str);\n    var l = str.length;\n    var ar = new u8(str.length + (str.length >> 1));\n    var ai = 0;\n    var w = function (v) { ar[ai++] = v; };\n    for (var i = 0; i < l; ++i) {\n        if (ai + 5 > ar.length) {\n            var n = new u8(ai + 8 + ((l - i) << 1));\n            n.set(ar);\n            ar = n;\n        }\n        var c = str.charCodeAt(i);\n        if (c < 128 || latin1)\n            w(c);\n        else if (c < 2048)\n            w(192 | (c >> 6)), w(128 | (c & 63));\n        else if (c > 55295 && c < 57344)\n            c = 65536 + (c & 1023 << 10) | (str.charCodeAt(++i) & 1023),\n                w(240 | (c >> 18)), w(128 | ((c >> 12) & 63)), w(128 | ((c >> 6) & 63)), w(128 | (c & 63));\n        else\n            w(224 | (c >> 12)), w(128 | ((c >> 6) & 63)), w(128 | (c & 63));\n    }\n    return slc(ar, 0, ai);\n}\n/**\n * Converts a Uint8Array to a string\n * @param dat The data to decode to string\n * @param latin1 Whether or not to interpret the data as Latin-1. This should\n *               not need to be true unless encoding to binary string.\n * @returns The original UTF-8/Latin-1 string\n */\nexport function strFromU8(dat, latin1) {\n    if (latin1) {\n        var r = '';\n        for (var i = 0; i < dat.length; i += 16384)\n            r += String.fromCharCode.apply(null, dat.subarray(i, i + 16384));\n        return r;\n    }\n    else if (td) {\n        return td.decode(dat);\n    }\n    else {\n        var _a = dutf8(dat), s = _a.s, r = _a.r;\n        if (r.length)\n            err(8);\n        return s;\n    }\n}\n;\n// deflate bit flag\nvar dbf = function (l) { return l == 1 ? 3 : l < 6 ? 2 : l == 9 ? 1 : 0; };\n// skip local zip header\nvar slzh = function (d, b) { return b + 30 + b2(d, b + 26) + b2(d, b + 28); };\n// read zip header\nvar zh = function (d, b, z) {\n    var fnl = b2(d, b + 28), efl = b2(d, b + 30), fn = strFromU8(d.subarray(b + 46, b + 46 + fnl), !(b2(d, b + 8) & 2048)), es = b + 46 + fnl;\n    var _a = z64hs(d, es, efl, z, b4(d, b + 20), b4(d, b + 24), b4(d, b + 42)), sc = _a[0], su = _a[1], off = _a[2];\n    return [b2(d, b + 10), sc, su, fn, es + efl + b2(d, b + 32), off];\n};\n// read zip64 header sizes\nvar z64hs = function (d, b, l, z, sc, su, off) {\n    var nsc = sc == 4294967295, nsu = su == 4294967295, noff = off == 4294967295, e = b + l;\n    var nf = nsc + nsu + noff;\n    if (z && nf) {\n        for (; b + 4 < e; b += 4 + b2(d, b + 2)) {\n            if (b2(d, b) == 1) {\n                return [\n                    nsc ? b8(d, b + 4 + 8 * nsu) : sc,\n                    nsu ? b8(d, b + 4) : su,\n                    noff ? b8(d, b + 4 + 8 * (nsu + nsc)) : off,\n                    1\n                ];\n            }\n        }\n        // z == 2 for unknown whether or not zip64\n        if (z < 2)\n            err(13);\n    }\n    return [sc, su, off, 0];\n};\n// extra field length\nvar exfl = function (ex) {\n    var le = 0;\n    if (ex) {\n        for (var k in ex) {\n            var l = ex[k].length;\n            if (l > 65535)\n                err(9);\n            le += l + 4;\n        }\n    }\n    return le;\n};\n// write zip header\nvar wzh = function (d, b, f, fn, u, c, ce, co) {\n    var fl = fn.length, ex = f.extra, col = co && co.length;\n    var exl = exfl(ex);\n    wbytes(d, b, ce != null ? 0x2014B50 : 0x4034B50), b += 4;\n    if (ce != null)\n        d[b++] = 20, d[b++] = f.os;\n    d[b] = 20, b += 2; // spec compliance? what's that?\n    d[b++] = (f.flag << 1) | (c < 0 && 8), d[b++] = u && 8;\n    d[b++] = f.compression & 255, d[b++] = f.compression >> 8;\n    var dt = new Date(f.mtime == null ? Date.now() : f.mtime), y = dt.getFullYear() - 1980;\n    if (y < 0 || y > 119)\n        err(10);\n    wbytes(d, b, (y << 25) | ((dt.getMonth() + 1) << 21) | (dt.getDate() << 16) | (dt.getHours() << 11) | (dt.getMinutes() << 5) | (dt.getSeconds() >> 1)), b += 4;\n    if (c != -1) {\n        wbytes(d, b, f.crc);\n        wbytes(d, b + 4, c < 0 ? -c - 2 : c);\n        wbytes(d, b + 8, f.size);\n    }\n    wbytes(d, b + 12, fl);\n    wbytes(d, b + 14, exl), b += 16;\n    if (ce != null) {\n        wbytes(d, b, col);\n        wbytes(d, b + 6, f.attrs);\n        wbytes(d, b + 10, ce), b += 14;\n    }\n    d.set(fn, b);\n    b += fl;\n    if (exl) {\n        for (var k in ex) {\n            var exf = ex[k], l = exf.length;\n            wbytes(d, b, +k);\n            wbytes(d, b + 2, l);\n            d.set(exf, b + 4), b += 4 + l;\n        }\n    }\n    if (col)\n        d.set(co, b), b += col;\n    return b;\n};\n// write zip footer (end of central directory)\nvar wzf = function (o, b, c, d, e) {\n    wbytes(o, b, 0x6054B50); // skip disk\n    wbytes(o, b + 8, c);\n    wbytes(o, b + 10, c);\n    wbytes(o, b + 12, d);\n    wbytes(o, b + 16, e);\n};\n/**\n * A pass-through stream to keep data uncompressed in a ZIP archive.\n */\nvar ZipPassThrough = /*#__PURE__*/ (function () {\n    /**\n     * Creates a pass-through stream that can be added to ZIP archives\n     * @param filename The filename to associate with this data stream\n     */\n    function ZipPassThrough(filename) {\n        this.filename = filename;\n        this.c = crc();\n        this.size = 0;\n        this.compression = 0;\n    }\n    /**\n     * Processes a chunk and pushes to the output stream. You can override this\n     * method in a subclass for custom behavior, but by default this passes\n     * the data through. You must call this.ondata(err, chunk, final) at some\n     * point in this method.\n     * @param chunk The chunk to process\n     * @param final Whether this is the last chunk\n     */\n    ZipPassThrough.prototype.process = function (chunk, final) {\n        this.ondata(null, chunk, final);\n    };\n    /**\n     * Pushes a chunk to be added. If you are subclassing this with a custom\n     * compression algorithm, note that you must push data from the source\n     * file only, pre-compression.\n     * @param chunk The chunk to push\n     * @param final Whether this is the last chunk\n     */\n    ZipPassThrough.prototype.push = function (chunk, final) {\n        if (!this.ondata)\n            err(5);\n        this.c.p(chunk);\n        this.size += chunk.length;\n        if (final)\n            this.crc = this.c.d();\n        // we shouldn't really do this cast, but properly handling ArrayBufferLike\n        // makes the API unergonomic with Buffer\n        this.process(chunk, final || false);\n    };\n    return ZipPassThrough;\n}());\nexport { ZipPassThrough };\n// I don't extend because TypeScript extension adds 1kB of runtime bloat\n/**\n * Streaming DEFLATE compression for ZIP archives. Prefer using AsyncZipDeflate\n * for better performance\n */\nvar ZipDeflate = /*#__PURE__*/ (function () {\n    /**\n     * Creates a DEFLATE stream that can be added to ZIP archives\n     * @param filename The filename to associate with this data stream\n     * @param opts The compression options\n     */\n    function ZipDeflate(filename, opts) {\n        var _this = this;\n        if (!opts)\n            opts = {};\n        ZipPassThrough.call(this, filename);\n        this.d = new Deflate(opts, function (dat, final) {\n            _this.ondata(null, dat, final);\n        });\n        this.compression = 8;\n        this.flag = dbf(opts.level);\n    }\n    ZipDeflate.prototype.process = function (chunk, final) {\n        try {\n            this.d.push(chunk, final);\n        }\n        catch (e) {\n            this.ondata(e, null, final);\n        }\n    };\n    /**\n     * Pushes a chunk to be deflated\n     * @param chunk The chunk to push\n     * @param final Whether this is the last chunk\n     */\n    ZipDeflate.prototype.push = function (chunk, final) {\n        ZipPassThrough.prototype.push.call(this, chunk, final);\n    };\n    return ZipDeflate;\n}());\nexport { ZipDeflate };\n/**\n * Asynchronous streaming DEFLATE compression for ZIP archives\n */\nvar AsyncZipDeflate = /*#__PURE__*/ (function () {\n    /**\n     * Creates an asynchronous DEFLATE stream that can be added to ZIP archives\n     * @param filename The filename to associate with this data stream\n     * @param opts The compression options\n     */\n    function AsyncZipDeflate(filename, opts) {\n        var _this = this;\n        if (!opts)\n            opts = {};\n        ZipPassThrough.call(this, filename);\n        this.d = new AsyncDeflate(opts, function (err, dat, final) {\n            _this.ondata(err, dat, final);\n        });\n        this.compression = 8;\n        this.flag = dbf(opts.level);\n        this.terminate = this.d.terminate;\n    }\n    AsyncZipDeflate.prototype.process = function (chunk, final) {\n        this.d.push(chunk, final);\n    };\n    /**\n     * Pushes a chunk to be deflated\n     * @param chunk The chunk to push\n     * @param final Whether this is the last chunk\n     */\n    AsyncZipDeflate.prototype.push = function (chunk, final) {\n        ZipPassThrough.prototype.push.call(this, chunk, final);\n    };\n    return AsyncZipDeflate;\n}());\nexport { AsyncZipDeflate };\n// TODO: Better tree shaking\n/**\n * A zippable archive to which files can incrementally be added\n */\nvar Zip = /*#__PURE__*/ (function () {\n    /**\n     * Creates an empty ZIP archive to which files can be added\n     * @param cb The callback to call whenever data for the generated ZIP archive\n     *           is available\n     */\n    function Zip(cb) {\n        this.ondata = cb;\n        this.u = [];\n        this.d = 1;\n    }\n    /**\n     * Adds a file to the ZIP archive\n     * @param file The file stream to add\n     */\n    Zip.prototype.add = function (file) {\n        var _this = this;\n        if (!this.ondata)\n            err(5);\n        // finishing or finished\n        if (this.d & 2)\n            this.ondata(err(4 + (this.d & 1) * 8, 0, 1), null, false);\n        else {\n            var f = strToU8(file.filename), fl_1 = f.length;\n            var com = file.comment, o = com && strToU8(com);\n            var u = fl_1 != file.filename.length || (o && (com.length != o.length));\n            var hl_1 = fl_1 + exfl(file.extra) + 30;\n            if (fl_1 > 65535)\n                this.ondata(err(11, 0, 1), null, false);\n            var header = new u8(hl_1);\n            wzh(header, 0, file, f, u, -1);\n            var chks_1 = [header];\n            var pAll_1 = function () {\n                for (var _i = 0, chks_2 = chks_1; _i < chks_2.length; _i++) {\n                    var chk = chks_2[_i];\n                    _this.ondata(null, chk, false);\n                }\n                chks_1 = [];\n            };\n            var tr_1 = this.d;\n            this.d = 0;\n            var ind_1 = this.u.length;\n            var uf_1 = mrg(file, {\n                f: f,\n                u: u,\n                o: o,\n                t: function () {\n                    if (file.terminate)\n                        file.terminate();\n                },\n                r: function () {\n                    pAll_1();\n                    if (tr_1) {\n                        var nxt = _this.u[ind_1 + 1];\n                        if (nxt)\n                            nxt.r();\n                        else\n                            _this.d = 1;\n                    }\n                    tr_1 = 1;\n                }\n            });\n            var cl_1 = 0;\n            file.ondata = function (err, dat, final) {\n                if (err) {\n                    _this.ondata(err, dat, final);\n                    _this.terminate();\n                }\n                else {\n                    cl_1 += dat.length;\n                    chks_1.push(dat);\n                    if (final) {\n                        var dd = new u8(16);\n                        wbytes(dd, 0, 0x8074B50);\n                        wbytes(dd, 4, file.crc);\n                        wbytes(dd, 8, cl_1);\n                        wbytes(dd, 12, file.size);\n                        chks_1.push(dd);\n                        uf_1.c = cl_1, uf_1.b = hl_1 + cl_1 + 16, uf_1.crc = file.crc, uf_1.size = file.size;\n                        if (tr_1)\n                            uf_1.r();\n                        tr_1 = 1;\n                    }\n                    else if (tr_1)\n                        pAll_1();\n                }\n            };\n            this.u.push(uf_1);\n        }\n    };\n    /**\n     * Ends the process of adding files and prepares to emit the final chunks.\n     * This *must* be called after adding all desired files for the resulting\n     * ZIP file to work properly.\n     */\n    Zip.prototype.end = function () {\n        var _this = this;\n        if (this.d & 2) {\n            this.ondata(err(4 + (this.d & 1) * 8, 0, 1), null, true);\n            return;\n        }\n        if (this.d)\n            this.e();\n        else\n            this.u.push({\n                r: function () {\n                    if (!(_this.d & 1))\n                        return;\n                    _this.u.splice(-1, 1);\n                    _this.e();\n                },\n                t: function () { }\n            });\n        this.d = 3;\n    };\n    Zip.prototype.e = function () {\n        var bt = 0, l = 0, tl = 0;\n        for (var _i = 0, _a = this.u; _i < _a.length; _i++) {\n            var f = _a[_i];\n            tl += 46 + f.f.length + exfl(f.extra) + (f.o ? f.o.length : 0);\n        }\n        var out = new u8(tl + 22);\n        for (var _b = 0, _c = this.u; _b < _c.length; _b++) {\n            var f = _c[_b];\n            wzh(out, bt, f, f.f, f.u, -f.c - 2, l, f.o);\n            bt += 46 + f.f.length + exfl(f.extra) + (f.o ? f.o.length : 0), l += f.b;\n        }\n        wzf(out, bt, this.u.length, tl, l);\n        this.ondata(null, out, true);\n        this.d = 2;\n    };\n    /**\n     * A method to terminate any internal workers used by the stream. Subsequent\n     * calls to add() will fail.\n     */\n    Zip.prototype.terminate = function () {\n        for (var _i = 0, _a = this.u; _i < _a.length; _i++) {\n            var f = _a[_i];\n            f.t();\n        }\n        this.d = 2;\n    };\n    return Zip;\n}());\nexport { Zip };\nexport function zip(data, opts, cb) {\n    if (!cb)\n        cb = opts, opts = {};\n    if (typeof cb != 'function')\n        err(7);\n    var r = {};\n    fltn(data, '', r, opts);\n    var k = Object.keys(r);\n    var lft = k.length, o = 0, tot = 0;\n    var slft = lft, files = new Array(lft);\n    var term = [];\n    var tAll = function () {\n        for (var i = 0; i < term.length; ++i)\n            term[i]();\n    };\n    var cbd = function (a, b) {\n        mt(function () { cb(a, b); });\n    };\n    mt(function () { cbd = cb; });\n    var cbf = function () {\n        var out = new u8(tot + 22), oe = o, cdl = tot - o;\n        tot = 0;\n        for (var i = 0; i < slft; ++i) {\n            var f = files[i];\n            try {\n                var l = f.c.length;\n                wzh(out, tot, f, f.f, f.u, l);\n                var badd = 30 + f.f.length + exfl(f.extra);\n                var loc = tot + badd;\n                out.set(f.c, loc);\n                wzh(out, o, f, f.f, f.u, l, tot, f.m), o += 16 + badd + (f.m ? f.m.length : 0), tot = loc + l;\n            }\n            catch (e) {\n                return cbd(e, null);\n            }\n        }\n        wzf(out, o, files.length, cdl, oe);\n        cbd(null, out);\n    };\n    if (!lft)\n        cbf();\n    var _loop_1 = function (i) {\n        var fn = k[i];\n        var _a = r[fn], file = _a[0], p = _a[1];\n        var c = crc(), size = file.length;\n        c.p(file);\n        var f = strToU8(fn), s = f.length;\n        var com = p.comment, m = com && strToU8(com), ms = m && m.length;\n        var exl = exfl(p.extra);\n        var compression = p.level == 0 ? 0 : 8;\n        var cbl = function (e, d) {\n            if (e) {\n                tAll();\n                cbd(e, null);\n            }\n            else {\n                var l = d.length;\n                files[i] = mrg(p, {\n                    size: size,\n                    crc: c.d(),\n                    c: d,\n                    f: f,\n                    m: m,\n                    u: s != fn.length || (m && (com.length != ms)),\n                    compression: compression\n                });\n                o += 30 + s + exl + l;\n                tot += 76 + 2 * (s + exl) + (ms || 0) + l;\n                if (!--lft)\n                    cbf();\n            }\n        };\n        if (s > 65535)\n            cbl(err(11, 0, 1), null);\n        if (!compression)\n            cbl(null, file);\n        else if (size < 160000) {\n            try {\n                cbl(null, deflateSync(file, p));\n            }\n            catch (e) {\n                cbl(e, null);\n            }\n        }\n        else\n            term.push(deflate(file, p, cbl));\n    };\n    // Cannot use lft because it can decrease\n    for (var i = 0; i < slft; ++i) {\n        _loop_1(i);\n    }\n    return tAll;\n}\n/**\n * Synchronously creates a ZIP file. Prefer using `zip` for better performance\n * with more than one file.\n * @param data The directory structure for the ZIP archive\n * @param opts The main options, merged with per-file options\n * @returns The generated ZIP archive\n */\nexport function zipSync(data, opts) {\n    if (!opts)\n        opts = {};\n    var r = {};\n    var files = [];\n    fltn(data, '', r, opts);\n    var o = 0;\n    var tot = 0;\n    for (var fn in r) {\n        var _a = r[fn], file = _a[0], p = _a[1];\n        var compression = p.level == 0 ? 0 : 8;\n        var f = strToU8(fn), s = f.length;\n        var com = p.comment, m = com && strToU8(com), ms = m && m.length;\n        var exl = exfl(p.extra);\n        if (s > 65535)\n            err(11);\n        var d = compression ? deflateSync(file, p) : file, l = d.length;\n        var c = crc();\n        c.p(file);\n        files.push(mrg(p, {\n            size: file.length,\n            crc: c.d(),\n            c: d,\n            f: f,\n            m: m,\n            u: s != fn.length || (m && (com.length != ms)),\n            o: o,\n            compression: compression\n        }));\n        o += 30 + s + exl + l;\n        tot += 76 + 2 * (s + exl) + (ms || 0) + l;\n    }\n    var out = new u8(tot + 22), oe = o, cdl = tot - o;\n    for (var i = 0; i < files.length; ++i) {\n        var f = files[i];\n        wzh(out, f.o, f, f.f, f.u, f.c.length);\n        var badd = 30 + f.f.length + exfl(f.extra);\n        out.set(f.c, f.o + badd);\n        wzh(out, o, f, f.f, f.u, f.c.length, f.o, f.m), o += 16 + badd + (f.m ? f.m.length : 0);\n    }\n    wzf(out, o, files.length, cdl, oe);\n    return out;\n}\n/**\n * Streaming pass-through decompression for ZIP archives\n */\nvar UnzipPassThrough = /*#__PURE__*/ (function () {\n    function UnzipPassThrough() {\n    }\n    UnzipPassThrough.prototype.push = function (chunk, final) {\n        // same as ZipPassThrough: cast to retain Buffer ergonomics\n        this.ondata(null, chunk, final);\n    };\n    UnzipPassThrough.compression = 0;\n    return UnzipPassThrough;\n}());\nexport { UnzipPassThrough };\n/**\n * Streaming DEFLATE decompression for ZIP archives. Prefer AsyncZipInflate for\n * better performance.\n */\nvar UnzipInflate = /*#__PURE__*/ (function () {\n    /**\n     * Creates a DEFLATE decompression that can be used in ZIP archives\n     */\n    function UnzipInflate() {\n        var _this = this;\n        this.i = new Inflate(function (dat, final) {\n            _this.ondata(null, dat, final);\n        });\n    }\n    UnzipInflate.prototype.push = function (chunk, final) {\n        try {\n            this.i.push(chunk, final);\n        }\n        catch (e) {\n            this.ondata(e, null, final);\n        }\n    };\n    UnzipInflate.compression = 8;\n    return UnzipInflate;\n}());\nexport { UnzipInflate };\n/**\n * Asynchronous streaming DEFLATE decompression for ZIP archives\n */\nvar AsyncUnzipInflate = /*#__PURE__*/ (function () {\n    /**\n     * Creates a DEFLATE decompression that can be used in ZIP archives\n     */\n    function AsyncUnzipInflate(_, sz) {\n        var _this = this;\n        if (sz < 320000) {\n            this.i = new Inflate(function (dat, final) {\n                _this.ondata(null, dat, final);\n            });\n        }\n        else {\n            this.i = new AsyncInflate(function (err, dat, final) {\n                _this.ondata(err, dat, final);\n            });\n            this.terminate = this.i.terminate;\n        }\n    }\n    AsyncUnzipInflate.prototype.push = function (chunk, final) {\n        if (this.i.terminate)\n            chunk = slc(chunk, 0);\n        this.i.push(chunk, final);\n    };\n    AsyncUnzipInflate.compression = 8;\n    return AsyncUnzipInflate;\n}());\nexport { AsyncUnzipInflate };\n/**\n * A ZIP archive decompression stream that emits files as they are discovered\n */\nvar Unzip = /*#__PURE__*/ (function () {\n    /**\n     * Creates a ZIP decompression stream\n     * @param cb The callback to call whenever a file in the ZIP archive is found\n     */\n    function Unzip(cb) {\n        this.onfile = cb;\n        this.k = [];\n        this.o = {\n            0: UnzipPassThrough\n        };\n        this.p = et;\n    }\n    /**\n     * Pushes a chunk to be unzipped\n     * @param chunk The chunk to push\n     * @param final Whether this is the last chunk\n     */\n    Unzip.prototype.push = function (chunk, final) {\n        var _this = this;\n        if (!this.onfile)\n            err(5);\n        if (!this.p)\n            err(4);\n        if (this.c > 0) {\n            var len = Math.min(this.c, chunk.length);\n            var toAdd = chunk.subarray(0, len);\n            this.c -= len;\n            if (this.d)\n                this.d.push(toAdd, !this.c);\n            else\n                this.k[0].push(toAdd);\n            chunk = chunk.subarray(len);\n            if (chunk.length)\n                return this.push(chunk, final);\n        }\n        else {\n            var f = 0, i = 0, is = void 0, buf = void 0;\n            if (!this.p.length)\n                buf = chunk;\n            else if (!chunk.length)\n                buf = this.p;\n            else {\n                buf = new u8(this.p.length + chunk.length);\n                buf.set(this.p), buf.set(chunk, this.p.length);\n            }\n            var l = buf.length, oc = this.c, add = oc && this.d;\n            var _loop_2 = function () {\n                var sig = b4(buf, i);\n                if (sig == 0x4034B50) {\n                    f = 1, is = i;\n                    this_1.d = null;\n                    this_1.c = 0;\n                    var bf = b2(buf, i + 6), cmp_1 = b2(buf, i + 8), u = bf & 2048, dd = bf & 8, fnl = b2(buf, i + 26), es = b2(buf, i + 28);\n                    if (l > i + 30 + fnl + es) {\n                        var chks_3 = [];\n                        this_1.k.unshift(chks_3);\n                        f = 2;\n                        var lsc = b4(buf, i + 18), lsu = b4(buf, i + 22);\n                        var fn_1 = strFromU8(buf.subarray(i + 30, i += 30 + fnl), !u);\n                        var _a = z64hs(buf, i, es, 2, lsc, lsu, 0), sc_1 = _a[0], su_1 = _a[1], z64 = _a[3];\n                        if (dd)\n                            sc_1 = -1 - z64;\n                        i += es;\n                        this_1.c = sc_1;\n                        var d_1;\n                        var file_1 = {\n                            name: fn_1,\n                            compression: cmp_1,\n                            start: function () {\n                                if (!file_1.ondata)\n                                    err(5);\n                                if (!sc_1)\n                                    file_1.ondata(null, et, true);\n                                else {\n                                    var ctr = _this.o[cmp_1];\n                                    if (!ctr)\n                                        file_1.ondata(err(14, 'unknown compression type ' + cmp_1, 1), null, false);\n                                    d_1 = sc_1 < 0 ? new ctr(fn_1) : new ctr(fn_1, sc_1, su_1);\n                                    d_1.ondata = function (err, dat, final) { file_1.ondata(err, dat, final); };\n                                    for (var _i = 0, chks_4 = chks_3; _i < chks_4.length; _i++) {\n                                        var dat = chks_4[_i];\n                                        d_1.push(dat, false);\n                                    }\n                                    if (_this.k[0] == chks_3 && _this.c)\n                                        _this.d = d_1;\n                                    else\n                                        d_1.push(et, true);\n                                }\n                            },\n                            terminate: function () {\n                                if (d_1 && d_1.terminate)\n                                    d_1.terminate();\n                            }\n                        };\n                        if (sc_1 >= 0)\n                            file_1.size = sc_1, file_1.originalSize = su_1;\n                        this_1.onfile(file_1);\n                    }\n                    return \"break\";\n                }\n                else if (oc) {\n                    if (sig == 0x8074B50) {\n                        is = i += 12 + (oc == -2 && 8), f = 3, this_1.c = 0;\n                        return \"break\";\n                    }\n                    else if (sig == 0x2014B50) {\n                        is = i -= 4, f = 3, this_1.c = 0;\n                        return \"break\";\n                    }\n                }\n            };\n            var this_1 = this;\n            for (; i < l - 4; ++i) {\n                var state_1 = _loop_2();\n                if (state_1 === \"break\")\n                    break;\n            }\n            this.p = et;\n            if (oc < 0) {\n                var dat = f ? buf.subarray(0, is - 12 - (oc == -2 && 8) - (b4(buf, is - 16) == 0x8074B50 && 4)) : buf.subarray(0, i);\n                if (add)\n                    add.push(dat, !!f);\n                else\n                    this.k[+(f == 2)].push(dat);\n            }\n            if (f & 2)\n                return this.push(buf.subarray(i), final);\n            this.p = buf.subarray(i);\n        }\n        if (final) {\n            if (this.c)\n                err(13);\n            this.p = null;\n        }\n    };\n    /**\n     * Registers a decoder with the stream, allowing for files compressed with\n     * the compression type provided to be expanded correctly\n     * @param decoder The decoder constructor\n     */\n    Unzip.prototype.register = function (decoder) {\n        this.o[decoder.compression] = decoder;\n    };\n    return Unzip;\n}());\nexport { Unzip };\nvar mt = typeof queueMicrotask == 'function' ? queueMicrotask : typeof setTimeout == 'function' ? setTimeout : function (fn) { fn(); };\nexport function unzip(data, opts, cb) {\n    if (!cb)\n        cb = opts, opts = {};\n    if (typeof cb != 'function')\n        err(7);\n    var term = [];\n    var tAll = function () {\n        for (var i = 0; i < term.length; ++i)\n            term[i]();\n    };\n    var files = {};\n    var cbd = function (a, b) {\n        mt(function () { cb(a, b); });\n    };\n    mt(function () { cbd = cb; });\n    var e = data.length - 22;\n    for (; b4(data, e) != 0x6054B50; --e) {\n        if (!e || data.length - e > 65558) {\n            cbd(err(13, 0, 1), null);\n            return tAll;\n        }\n    }\n    ;\n    var lft = b2(data, e + 8);\n    if (lft) {\n        var c = lft;\n        var o = b4(data, e + 16);\n        var z = b4(data, e - 20) == 0x7064B50;\n        if (z) {\n            var ze = b4(data, e - 12);\n            z = b4(data, ze) == 0x6064B50;\n            if (z) {\n                c = lft = b4(data, ze + 32);\n                o = b4(data, ze + 48);\n            }\n        }\n        var fltr = opts && opts.filter;\n        var _loop_3 = function (i) {\n            var _a = zh(data, o, z), c_1 = _a[0], sc = _a[1], su = _a[2], fn = _a[3], no = _a[4], off = _a[5], b = slzh(data, off);\n            o = no;\n            var cbl = function (e, d) {\n                if (e) {\n                    tAll();\n                    cbd(e, null);\n                }\n                else {\n                    if (d)\n                        files[fn] = d;\n                    if (!--lft)\n                        cbd(null, files);\n                }\n            };\n            if (!fltr || fltr({\n                name: fn,\n                size: sc,\n                originalSize: su,\n                compression: c_1\n            })) {\n                if (!c_1)\n                    cbl(null, slc(data, b, b + sc));\n                else if (c_1 == 8) {\n                    var infl = data.subarray(b, b + sc);\n                    // Synchronously decompress under 512KB, or barely-compressed data\n                    if (su < 524288 || sc > 0.8 * su) {\n                        try {\n                            cbl(null, inflateSync(infl, { out: new u8(su) }));\n                        }\n                        catch (e) {\n                            cbl(e, null);\n                        }\n                    }\n                    else\n                        term.push(inflate(infl, { size: su }, cbl));\n                }\n                else\n                    cbl(err(14, 'unknown compression type ' + c_1, 1), null);\n            }\n            else\n                cbl(null, null);\n        };\n        for (var i = 0; i < c; ++i) {\n            _loop_3(i);\n        }\n    }\n    else\n        cbd(null, {});\n    return tAll;\n}\n/**\n * Synchronously decompresses a ZIP archive. Prefer using `unzip` for better\n * performance with more than one file.\n * @param data The raw compressed ZIP file\n * @param opts The ZIP extraction options\n * @returns The decompressed files\n */\nexport function unzipSync(data, opts) {\n    var files = {};\n    var e = data.length - 22;\n    for (; b4(data, e) != 0x6054B50; --e) {\n        if (!e || data.length - e > 65558)\n            err(13);\n    }\n    ;\n    var c = b2(data, e + 8);\n    if (!c)\n        return {};\n    var o = b4(data, e + 16);\n    var z = b4(data, e - 20) == 0x7064B50;\n    if (z) {\n        var ze = b4(data, e - 12);\n        z = b4(data, ze) == 0x6064B50;\n        if (z) {\n            c = b4(data, ze + 32);\n            o = b4(data, ze + 48);\n        }\n    }\n    var fltr = opts && opts.filter;\n    for (var i = 0; i < c; ++i) {\n        var _a = zh(data, o, z), c_2 = _a[0], sc = _a[1], su = _a[2], fn = _a[3], no = _a[4], off = _a[5], b = slzh(data, off);\n        o = no;\n        if (!fltr || fltr({\n            name: fn,\n            size: sc,\n            originalSize: su,\n            compression: c_2\n        })) {\n            if (!c_2)\n                files[fn] = slc(data, b, b + sc);\n            else if (c_2 == 8)\n                files[fn] = inflateSync(data.subarray(b, b + sc), { out: new u8(su) });\n            else\n                err(14, 'unknown compression type ' + c_2);\n        }\n    }\n    return files;\n}\n","import * as fflate from 'fflate';\nimport { IndexedDBManager } from './IndexedDBManager.js';\n\nexport class ZipStreamer {\n  private dbManager: IndexedDBManager;\n\n  constructor(dbManager: IndexedDBManager) {\n    this.dbManager = dbManager;\n  }\n\n  /**\n   * Exports all sessions and their logs from IndexedDB into a Zip compressed Blob.\n   */\n  async exportAllSessions(): Promise<Blob> {\n    // Flush any pending logs to IndexedDB first\n    await this.dbManager.flush();\n\n    const sessions = await this.dbManager.getAllSessions();\n    const chunks: BlobPart[] = [];\n\n    return new Promise<Blob>((resolve, reject) => {\n      const zip = new fflate.Zip();\n\n      zip.ondata = (err, data, final) => {\n        if (err) {\n          reject(err);\n          return;\n        }\n        chunks.push(data);\n        if (final) {\n          resolve(new Blob(chunks, { type: 'application/zip' }));\n        }\n      };\n\n      const run = async () => {\n        const encoder = new TextEncoder();\n\n        for (const session of sessions) {\n          const folderName = session.id.startsWith('session_')\n            ? session.id\n            : `session_${session.id}`;\n\n          // 1. Add session details file\n          const detailsFile = new fflate.ZipDeflate(`${folderName}/details.json`);\n          zip.add(detailsFile);\n\n          const detailsJson = JSON.stringify(session);\n          detailsFile.push(encoder.encode(detailsJson), true);\n\n          // 2. Add session logs file (streamed)\n          const logsFile = new fflate.ZipDeflate(`${folderName}/logs.json`);\n          zip.add(logsFile);\n\n          // Write starting bracket\n          logsFile.push(encoder.encode('['));\n\n          let first = true;\n\n          // Stream logs directly from IndexedDB cursor\n          await this.dbManager.streamLogsForSession(session.id, (log) => {\n            const logContent = (first ? '' : ',') + JSON.stringify(log);\n            first = false;\n            logsFile.push(encoder.encode(logContent));\n          });\n\n          // Write closing bracket and finalize this file\n          logsFile.push(encoder.encode(']'), true);\n        }\n\n        // Finalize the zip archive\n        zip.end();\n      };\n\n      run().catch(reject);\n    });\n  }\n}\n","import { create } from 'jsondiffpatch';\nimport { Dispatcher } from './Dispatcher.js';\nimport { BasePipe } from '../pipes/BasePipe.js';\nimport { LogPayload, LogLevel } from './LogPayload.js';\nimport { ConsolePipe, ConsolePipeConfig } from '../pipes/ConsolePipe.js';\nimport { IndexedDBPipe } from '../pipes/IndexedDBPipe.js';\nimport { IndexedDBManager } from '../storage/IndexedDBManager.js';\nimport { SessionManager } from '../storage/SessionManager.js';\nimport { ZipStreamer } from '../storage/ZipStreamer.js';\n\n/**\n * Configuration options for the standard LogStream constructor.\n */\nexport interface LogStreamConfig {\n  /** The minimum log level required for a log to be processed. Defaults to 'INFO'. */\n  minLogLevel?: LogLevel;\n  /** Custom base pipes to dispatch logs to. */\n  pipes?: BasePipe[];\n  /** Optional pre-configured IndexedDBManager to enable export and download methods. */\n  dbManager?: IndexedDBManager;\n}\n\n/**\n * Configuration options for creating a WME LogStream using the simplified factory method.\n */\nexport interface UnifiedLogStreamConfig {\n  /** The minimum log level required for a log to be processed. Defaults to 'INFO'. */\n  minLogLevel?: LogLevel;\n  /** Whether to enable IndexedDB persistence and multi-tab isolation. Defaults to false. */\n  persist?: boolean;\n  /** Unique database prefix identifier. Required if `persist` is true. */\n  dbPrefix?: string;\n  /** Current userscript or extension version. Required if `persist` is true. */\n  scriptVersion?: string;\n  /** Native WME SDK instance to defensively query editor versions. */\n  wmeSDK?: any;\n  /** Maximum number of completed archived database sessions to preserve. Defaults to 5. */\n  maxArchivedSessions?: number;\n  /** Delay in milliseconds before flushing logs in queue to IndexedDB. Defaults to 2000. */\n  flushIntervalMs?: number;\n  /** Custom console styling prefix and color options. Set to `null` to disable console logging. */\n  brand?: ConsolePipeConfig | null;\n}\n\nconst SEVERITY: Record<LogLevel, number> = {\n  TRACE: 0,\n  DEBUG: 1,\n  INFO: 2,\n  WARN: 3,\n  ERROR: 4,\n  FATAL: 5,\n};\n\nfunction cloneDeep<T>(val: T): T {\n  if (val === undefined) return undefined as any;\n  if (typeof structuredClone !== 'undefined') {\n    try {\n      return structuredClone(val);\n    } catch {\n      // Fallback on serialization error\n    }\n  }\n  return JSON.parse(JSON.stringify(val));\n}\n\n/**\n * Prunes an object to a maximum depth, stringifying any nested objects/arrays at that depth limit.\n */\nfunction pruneToDepth(val: any, depth: number, maxDepth: number): any {\n  if (typeof val !== 'object' || val === null) {\n    return val;\n  }\n  if (depth >= maxDepth) {\n    try {\n      return JSON.stringify(val);\n    } catch {\n      return '[Object]';\n    }\n  }\n  if (Array.isArray(val)) {\n    return val.map((item) => pruneToDepth(item, depth + 1, maxDepth));\n  }\n  const result: any = {};\n  for (const key of Object.keys(val)) {\n    result[key] = pruneToDepth(val[key], depth + 1, maxDepth);\n  }\n  return result;\n}\n\n/**\n * The main logger class for WME LogStream.\n * Handles hierarchical scoping, console styling, state diff tracking, and persistent database exports.\n */\nexport class LogStream {\n  private minLogLevel: LogLevel;\n  private dispatcher: Dispatcher;\n  private scopes: string[];\n  private states: Map<string, any>;\n  private patcher = create();\n  private dbManagerPromise: Promise<IndexedDBManager> | null = null;\n\n  /**\n   * Initializes a LogStream instance.\n   * Prefer using `LogStream.create()` for a simplified, zero-boilerplate setup.\n   */\n  constructor(\n    config: LogStreamConfig,\n    internal?: {\n      dispatcher: Dispatcher;\n      scopes: string[];\n      states: Map<string, any>;\n      dbManagerPromise?: Promise<IndexedDBManager> | null;\n    },\n  ) {\n    this.minLogLevel = config.minLogLevel ?? 'INFO';\n    if (internal) {\n      this.dispatcher = internal.dispatcher;\n      this.scopes = internal.scopes;\n      this.states = internal.states;\n      this.dbManagerPromise = internal.dbManagerPromise ?? null;\n    } else {\n      this.dispatcher = new Dispatcher();\n      this.scopes = [];\n      this.states = new Map();\n      if (config.dbManager) {\n        this.dbManagerPromise = Promise.resolve(config.dbManager);\n      }\n      if (config.pipes) {\n        for (const pipe of config.pipes) {\n          this.dispatcher.addPipe(pipe);\n        }\n      }\n    }\n  }\n\n  /**\n   * Synchronously creates a configured LogStream instance, initializing console outputs\n   * and setting up background persistence/session managers if enabled.\n   *\n   * @param config The unified configuration options for console branding and persistence.\n   * @returns A pre-configured LogStream instance ready to log immediately.\n   */\n  static create(config: UnifiedLogStreamConfig): LogStream {\n    const pipes: BasePipe[] = [];\n    let dbManagerPromise: Promise<IndexedDBManager> | null = null;\n\n    if (config.brand !== null) {\n      pipes.push(new ConsolePipe(config.brand));\n    }\n\n    if (config.persist) {\n      if (!config.dbPrefix || !config.scriptVersion) {\n        throw new Error('dbPrefix and scriptVersion are required when persist is true');\n      }\n\n      dbManagerPromise = (async () => {\n        const sessionManager = new SessionManager({\n          dbPrefix: config.dbPrefix!,\n          scriptVersion: config.scriptVersion!,\n          wmeSDK: config.wmeSDK,\n        });\n\n        const sessionId = await sessionManager.initSession();\n        const wmeVersion = sessionManager.getWmeVersion();\n\n        const dbManager = new IndexedDBManager({\n          dbPrefix: config.dbPrefix!,\n          scriptVersion: config.scriptVersion!,\n          sessionId,\n          wmeVersion,\n          maxArchivedSessions: config.maxArchivedSessions,\n          flushIntervalMs: config.flushIntervalMs,\n        });\n\n        await dbManager.init();\n        await dbManager.pruneSessions();\n        return dbManager;\n      })();\n\n      pipes.push(new IndexedDBPipe(dbManagerPromise));\n    }\n\n    const dispatcher = new Dispatcher();\n    for (const pipe of pipes) {\n      dispatcher.addPipe(pipe);\n    }\n\n    return new LogStream(\n      {\n        minLogLevel: config.minLogLevel,\n      },\n      {\n        dispatcher,\n        scopes: [],\n        states: new Map(),\n        dbManagerPromise,\n      },\n    );\n  }\n\n  /**\n   * Spawns a child logger with a hierarchical scope prefix appended to the console/db entries.\n   *\n   * @param name The scope namespace (e.g. 'API', 'Auth').\n   * @returns A new LogStream child instance carrying the hierarchical scope.\n   */\n  scope(name: string): LogStream {\n    return new LogStream(\n      { minLogLevel: this.minLogLevel },\n      {\n        dispatcher: this.dispatcher,\n        scopes: [...this.scopes, name],\n        states: this.states,\n        dbManagerPromise: this.dbManagerPromise,\n      },\n    );\n  }\n\n  /** Logs a TRACE level message. */\n  trace(message: string, data?: any): void {\n    this.log('TRACE', message, data);\n  }\n\n  /** Logs a DEBUG level message. */\n  debug(message: string, data?: any): void {\n    this.log('DEBUG', message, data);\n  }\n\n  /** Logs an INFO level message. */\n  info(message: string, data?: any): void {\n    this.log('INFO', message, data);\n  }\n\n  /** Logs a WARN level message. */\n  warn(message: string, data?: any): void {\n    this.log('WARN', message, data);\n  }\n\n  /** Logs an ERROR level message. */\n  error(message: string, data?: any): void {\n    this.log('ERROR', message, data);\n  }\n\n  /** Logs a FATAL level message. */\n  fatal(message: string, data?: any): void {\n    this.log('FATAL', message, data);\n  }\n\n  /**\n   * Compares the given state object against its previous version, calculating the deep-diff\n   * and logging only modified properties as a DEBUG entry.\n   *\n   * @param name The state tracking key.\n   * @param state The state object to track.\n   * @param options Config options, e.g., max depth for nested objects.\n   */\n  stateDelta(name: string, state: any, options?: { maxDepth?: number }): void {\n    const maxDepth = options?.maxDepth ?? 3;\n\n    if (!this.states.has(name)) {\n      this.states.set(name, cloneDeep(state));\n      this.log('DEBUG', `State Delta: ${name} (initial)`, { delta: state });\n      return;\n    }\n\n    const prevState = this.states.get(name);\n\n    // Prune both objects up to maxDepth before diffing\n    const prunedPrev = pruneToDepth(prevState, 0, maxDepth);\n    const prunedState = pruneToDepth(state, 0, maxDepth);\n\n    const delta = this.patcher.diff(prunedPrev, prunedState);\n\n    if (delta !== undefined) {\n      this.states.set(name, cloneDeep(state));\n      this.log('DEBUG', `State Delta: ${name}`, { delta });\n    }\n  }\n\n  /**\n   * Returns a bound function that tracks changes to a specific state key over time.\n   *\n   * @param name The state tracking key.\n   * @param options Config options, e.g., max depth for nested objects.\n   * @returns A function accepting a state object to diff and log.\n   */\n  createStateTracker(name: string, options?: { maxDepth?: number }): (state: any) => void {\n    return (state: any) => {\n      this.stateDelta(name, state, options);\n    };\n  }\n\n  /**\n   * Asynchronously exports all stored database sessions and logs into a single compressed ZIP file.\n   *\n   * @returns A promise resolving to the compressed ZIP Blob.\n   */\n  async exportLogs(): Promise<Blob> {\n    if (!this.dbManagerPromise) {\n      throw new Error('Persistence (IndexedDB) is not enabled on this LogStream.');\n    }\n    const dbManager = await this.dbManagerPromise;\n    const streamer = new ZipStreamer(dbManager);\n    return streamer.exportAllSessions();\n  }\n\n  /**\n   * Triggers a browser-native file download of the compressed log sessions.\n   *\n   * @param filename Custom download filename. Defaults to `wme-logs-<timestamp>.xlog`.\n   */\n  async downloadLogs(filename?: string): Promise<void> {\n    const blob = await this.exportLogs();\n    if (typeof document === 'undefined') {\n      throw new Error('downloadLogs can only be called in a browser environment.');\n    }\n    const name = filename || `wme-logs-${Date.now()}.xlog`;\n    const url = URL.createObjectURL(blob);\n    const a = document.createElement('a');\n    a.href = url;\n    a.download = name;\n    a.click();\n    setTimeout(() => URL.revokeObjectURL(url), 100);\n  }\n\n  /**\n   * Triggers a flush of all buffered logs on registered pipes.\n   */\n  async flush(): Promise<void> {\n    await this.dispatcher.flush();\n  }\n\n  /**\n   * Closes underlying active database connections if persistence is enabled.\n   */\n  async close(): Promise<void> {\n    if (this.dbManagerPromise) {\n      const dbManager = await this.dbManagerPromise;\n      await dbManager.close();\n    }\n  }\n\n  private log(level: LogLevel, message: string, data?: any): void {\n    if (SEVERITY[level] < SEVERITY[this.minLogLevel]) {\n      return;\n    }\n\n    const payload: LogPayload = {\n      timestamp: Date.now(),\n      level,\n      scopes: [...this.scopes],\n      message,\n    };\n\n    if (data !== undefined) {\n      payload.data = data;\n    }\n\n    this.dispatcher.dispatch(payload);\n  }\n}\n","import dateReviver from \"./date-reviver.js\";\nimport DiffPatcher from \"./diffpatcher.js\";\nexport { DiffPatcher, dateReviver };\nexport function create(options) {\n    return new DiffPatcher(options);\n}\nlet defaultInstance;\nexport function diff(left, right) {\n    if (!defaultInstance) {\n        defaultInstance = new DiffPatcher();\n    }\n    return defaultInstance.diff(left, right);\n}\nexport function patch(left, delta) {\n    if (!defaultInstance) {\n        defaultInstance = new DiffPatcher();\n    }\n    return defaultInstance.patch(left, delta);\n}\nexport function unpatch(right, delta) {\n    if (!defaultInstance) {\n        defaultInstance = new DiffPatcher();\n    }\n    return defaultInstance.unpatch(right, delta);\n}\nexport function reverse(delta) {\n    if (!defaultInstance) {\n        defaultInstance = new DiffPatcher();\n    }\n    return defaultInstance.reverse(delta);\n}\nexport function clone(value) {\n    if (!defaultInstance) {\n        defaultInstance = new DiffPatcher();\n    }\n    return defaultInstance.clone(value);\n}\n"],"names":["clone","arg","Array","isArray","map","Date","getTime","RegExp","re","_a","regexMatch","exec","toString","Error","cloneRegExp","cloned","name","Object","prototype","hasOwnProperty","call","Context","setResult","result","this","hasResult","exit","exiting","push","child","arr","parent","childName","root","options","children","length","assertNonEmptyArray","next","nextAfterChildren","DiffContext","constructor","left","right","super","pipe","prepareDeltaResult","_b","_c","_d","omitRemovedValues","cloneDiffValues","defaultClone","PatchContext","delta","ReverseContext","Pipe","filters","process","input","processor","debug","context","index","filter","log","filterName","resultCheck","msg","console","append","args","prepend","unshift","indexOf","list","f","after","params","splice","before","replace","remove","clear","shouldHaveResult","should","error","noResult","Processor","selfOptions","pipes","pipeArg","lastPipe","nextPipe","undefined","defaultMatch","array1","array2","index1","index2","lcs","match","innerContext","matrix","len1","len2","x","y","matrixNewRow","matrixRowX","matrixRowBeforeX","Math","max","lengthMatrix","subsequence","sequence","indices1","indices2","matrixRowIndex1","valueAtMatrixAbove","matrixRowBeforeIndex1","valueAtMatrixLeft","backtrack","matchItems","value1","value2","objectHash","matchByPosition","hashCache1","hash1","hashCache2","hash2","diffFilter","_e","leftIsArray","matchContext","commonHead","commonTail","val1","val2","arraysHaveMatchByRef","_t","key","trimmed1","slice","trimmed2","seq","removedItems","detectMove","arrays","includeValueOnMove","removedItemsLength","indexOnArray2","isMove","removeItemIndex1","resultItem","compare","numerically","a","b","numericallyBy","patchFilter","nested","nestedDelta","array","toRemove","toInsert","toModify","removedOrMovedIndex","Number","parseInt","numberIndex","value","sort","indexDiff","removedValue","toInsertLength","insertion","toModifyLength","modification","collectChildrenPatchFilter","reverseFilter","nonNestedDelta","arrayMoveDelta","newName","substring","arrayDelta","reverseArrayDeltaIndex","itemDelta","reverseIndex","deltaIndex","deltaItem","moveFromIndex","moveToIndex","collectChildrenReverseFilter","deltaWithChildren","UNSAFE_KEYS","Set","collectChildrenDiffFilter","objectsDiffFilter","leftType","propertyFilter","objectDelta","childrenPushed","has","leftValue","object","property","cachedDiffPatch","getDiffMatchPatch","required","instance","textDiff","diffMatchPatch","diff_match_patch_not_found","diff","txt1","txt2","patch_toText","patch_make","patch","results","patch_apply","patch_fromText","resultOk","textPatchFailed","minLength","textDiffDelta","textDeltaReverse","headerRegex","lines","split","i","line","lineStart","header","lineTmp","join","rightType","rightIsArray","regexArgs","DiffPatcher","nested.collectChildrenDiffFilter","trivial.diffFilter","dates.diffFilter","texts.diffFilter","nested.objectsDiffFilter","arrays.diffFilter","nested.collectChildrenPatchFilter","arrays.collectChildrenPatchFilter","trivial.patchFilter","texts.patchFilter","nested.patchFilter","arrays.patchFilter","nested.collectChildrenReverseFilter","arrays.collectChildrenReverseFilter","trivial.reverseFilter","texts.reverseFilter","nested.reverseFilter","arrays.reverseFilter","reverse","unpatch","Dispatcher","addPipe","dispatch","payload","write","Promise","catch","err","flush","flushPromises","async","all","BasePipe","ConsolePipe","scriptPrefix","brandColor","styles","TRACE","DEBUG","INFO","WARN","ERROR","FATAL","config","timestampStr","timestamp","toISOString","scopesStr","scopes","s","levelStr","level","prefixStyle","levelStyle","message","data","IndexedDBPipe","dbManager","initPromise","buffer","dbManagerOrPromise","then","manager","writeLog","wrapRequest","request","resolve","reject","onsuccess","onerror","DEFAULT_CONFIG","maxArchivedSessions","flushIntervalMs","IndexedDBManager","dbPrefix","scriptVersion","sessionId","wmeVersion","db","queue","flushTimer","heartbeatTimer","loggerVersion","schemaVersion","merged","assign","getDatabaseName","init","dbName","version","onUpgradeNeeded","objectStoreNames","contains","createObjectStore","keyPath","autoIncrement","createIndex","unique","indexedDB","open","onupgradeneeded","event","onBlocked","onblocked","now","metadata","id","createdAt","lastUpdated","saveSessionMetadata","startHeartbeat","close","store","transaction","objectStore","put","touchSession","get","stopHeartbeat","setInterval","clearInterval","enrichedPayload","scheduleFlush","setTimeout","clearTimeout","batch","writeLogsBatch","logs","storeNames","mode","callback","tx","add","oncomplete","getLogsForSession","getAll","IDBKeyRange","only","getAllSessions","pruneSessions","sessions","candidates","isActiveSelf","isActiveOther","totalToPrune","sessionsToPrune","session","delete","openCursor","cursor","continue","streamLogsForSession","onLog","EventChannel","channel","listeners","Map","BroadcastChannel","onmessage","type","callbacks","e","publish","postMessage","subscribe","set","size","SessionManager","wmeSDK","tabId","random","initSession","channelName","candidateId","sessionStorage","getItem","_probeConflict","setItem","timeout","unsubscribeConflict","getWmeVersion","getWMEVersion","wazeWin","globalThis","unsafeWindow","window","W","getSessionId","u8","Uint8Array","u16","Uint16Array","i32","Int32Array","fleb","fdeb","clim","freb","eb","start","r","j","fl","revfl","revfd","rev","hMap","cd","mb","l","co","le","rvb","sv","r_1","v","m","flt","fdt","flm","fdm","shft","p","slc","subarray","ec","ind","nt","code","captureStackTrace","wbits","d","o","wbits16","hTree","t","t2","et","i0","i1","i2","maxSym","tr","mbt","ln","dt","lft","cst","i2_1","i2_2","i2_3","n","lc","c","cl","cli","cln","cls","w","clen","cf","wfblk","out","pos","dat","wblk","final","syms","lf","df","li","bs","bl","dlt","mlb","ddt","mdb","lclt","nlc","lcdt","ndc","lcfreq","lct","mlcb","nlcc","lm","ll","dm","dl","flen","ftlen","dtlen","llm","lcts","it","clct","len","sym","dst","deo","crct","k","dopt","opt","pre","post","st","dictionary","dict","newDat","lvl","plvl","z","ceil","lst","msk_1","prev","head","h","bs1_1","bs2_1","hsh","lc_1","wi","hv","imod","pimod","rem","ch_1","dif","maxn","min","maxd","ml","nl","mmd","md","ti","lin","din","dflt","mem","wbytes","Deflate","opts","cb","ondata","chunk","endLen","newBuf","sync","ep","te","TextEncoder","td","TextDecoder","decode","stream","strToU8","str","latin1","encode","ar","ai","charCodeAt","exfl","ex","wzh","fn","u","ce","extra","col","exl","os","flag","compression","mtime","getFullYear","getMonth","getDate","getHours","getMinutes","getSeconds","crc","attrs","exf","ZipPassThrough","filename","cr","ZipDeflate","_this","Zip","file","fl_1","com","comment","hl_1","chks_1","pAll_1","_i","chks_2","chk","tr_1","ind_1","uf_1","mrg","terminate","nxt","cl_1","dd","end","bt","tl","ZipStreamer","exportAllSessions","chunks","zip","fflate.Zip","Blob","encoder","folderName","startsWith","detailsFile","fflate.ZipDeflate","detailsJson","JSON","stringify","logsFile","first","logContent","run","SEVERITY","cloneDeep","val","structuredClone","parse","pruneToDepth","depth","maxDepth","item","keys","LogStream","minLogLevel","dispatcher","states","patcher","create","dbManagerPromise","internal","brand","persist","sessionManager","scope","trace","info","warn","fatal","stateDelta","state","prunedPrev","prunedState","createStateTracker","exportLogs","downloadLogs","blob","document","url","URL","createObjectURL","createElement","href","download","click","revokeObjectURL"],"mappings":"8CAQe,SAASA,EAAMC,GAC1B,GAAmB,iBAARA,EACP,OAAOA,EAEX,GAAY,OAARA,EACA,OAAO,KAEX,GAAIC,MAAMC,QAAQF,GACd,OAAOA,EAAIG,IAAIJ,GAEnB,GAAIC,aAAeI,KACf,OAAO,IAAIA,KAAKJ,EAAIK,WAExB,GAAIL,aAAeM,OACf,OAtBR,SAAqBC,GACjB,IAAIC,EACJ,MAAMC,EAAa,uBAAuBC,KAAKH,EAAGI,YAClD,IAAKF,EACD,MAAM,IAAIG,MAAM,kBAEpB,OAAO,IAAIN,OAAgC,QAAxBE,EAAKC,EAAW,UAAuB,IAAPD,EAAgBA,EAAK,GAAIC,EAAW,GAC3F,CAeeI,CAAYb,GAEvB,MAAMc,EAAS,CAAA,EACf,IAAK,MAAMC,KAAQf,EACXgB,OAAOC,UAAUC,eAAeC,KAAKnB,EAAKe,KAC1CD,EAAOC,GAAQhB,EAAMC,EAAIe,KAGjC,OAAOD,CACX,CC9Be,MAAMM,EACjB,SAAAC,CAAUC,GAGN,OAFAC,KAAKD,OAASA,EACdC,KAAKC,WAAY,EACVD,IACX,CACA,IAAAE,GAEI,OADAF,KAAKG,SAAU,EACRH,IACX,CACA,IAAAI,CAAKC,EAAOb,GCgCY,IAACc,EDdrB,OAjBAD,EAAME,OAASP,UACK,IAATR,IACPa,EAAMG,UAAYhB,GAEtBa,EAAMI,KAAOT,KAAKS,MAAQT,KAC1BK,EAAMK,QAAUL,EAAMK,SAAWV,KAAKU,QACjCV,KAAKW,WClBX,SAA6BL,GAChC,GAAmB,IAAfA,EAAIM,OACJ,MAAM,IAAIvB,MAAiB,6BAEnC,CDoBYwB,CAAoBb,KAAKW,WCmBRL,EDlBJN,KAAKW,SCkBOL,EAAIA,EAAIM,OAAS,IDlBdE,KAAOT,EACnCL,KAAKW,SAASP,KAAKC,KAPnBL,KAAKW,SAAW,CAACN,GACjBL,KAAKe,kBAAoBf,KAAKc,MAAQ,KACtCd,KAAKc,KAAOT,GAOhBA,EAAMS,KAAOd,KACNA,IACX,EE5BJ,MAAMgB,UAAoBnB,EACtB,WAAAoB,CAAYC,EAAMC,GACdC,QACApB,KAAKkB,KAAOA,EACZlB,KAAKmB,MAAQA,EACbnB,KAAKqB,KAAO,MAChB,CACA,kBAAAC,CAAmBvB,GACf,IAAId,EAAIsC,EAAIC,EAAIC,EAChB,GAAsB,iBAAX1B,KACsB,QAAvBd,EAAKe,KAAKU,eAA4B,IAAPzB,SAAyBA,EAAGyC,oBAC7DhD,MAAMC,QAAQoB,IACdA,EAAOa,OAAS,IACG,IAAlBb,EAAOa,QACU,IAAdb,EAAO,IACO,IAAdA,EAAO,MAGXA,EAAO,GAAK,GAEY,QAAvBwB,EAAKvB,KAAKU,mBAAqBa,OAAgB,EAASA,EAAGI,iBAAiB,CAC7E,MAAMnD,EAAiG,mBAAzD,QAAvBgD,EAAKxB,KAAKU,eAA4B,IAAPc,OAAgB,EAASA,EAAGG,iBACpD,QAAvBF,EAAKzB,KAAKU,eAA4B,IAAPe,OAAgB,EAASA,EAAGE,gBAC5DC,EACmB,iBAAd7B,EAAO,KACdA,EAAO,GAAKvB,EAAMuB,EAAO,KAEJ,iBAAdA,EAAO,KACdA,EAAO,GAAKvB,EAAMuB,EAAO,IAEjC,CAEJ,OAAOA,CACX,CACA,SAAAD,CAAUC,GAEN,OADAC,KAAKsB,mBAAmBvB,GACjBqB,MAAMtB,UAAUC,EAC3B,ECtCJ,MAAM8B,UAAqBhC,EACvB,WAAAoB,CAAYC,EAAMY,GACdV,QACApB,KAAKkB,KAAOA,EACZlB,KAAK8B,MAAQA,EACb9B,KAAKqB,KAAO,OAChB,ECNJ,MAAMU,UAAuBlC,EACzB,WAAAoB,CAAYa,GACRV,QACApB,KAAK8B,MAAQA,EACb9B,KAAKqB,KAAO,SAChB,ECLJ,MAAMW,EACF,WAAAf,CAAYzB,GACRQ,KAAKR,KAAOA,EACZQ,KAAKiC,QAAU,EACnB,CACA,OAAAC,CAAQC,GACJ,IAAKnC,KAAKoC,UACN,MAAM,IAAI/C,MAAM,gDAEpB,MAAMgD,EAAQrC,KAAKqC,MACbzB,EAASZ,KAAKiC,QAAQrB,OACtB0B,EAAUH,EAChB,IAAK,IAAII,EAAQ,EAAGA,EAAQ3B,EAAQ2B,IAAS,CACzC,MAAMC,EAASxC,KAAKiC,QAAQM,GAC5B,GAAKC,IAEDH,GACArC,KAAKyC,IAAI,WAAWD,EAAOE,cAE/BF,EAAOF,GACgB,iBAAZA,GAAwBA,EAAQnC,SAAS,CAChDmC,EAAQnC,SAAU,EAClB,KACJ,CACJ,EACKmC,EAAQxB,MAAQd,KAAK2C,aACtB3C,KAAK2C,YAAYL,EAEzB,CACA,GAAAG,CAAIG,GACAC,QAAQJ,IAAI,mBAAmBzC,KAAKR,cAAcoD,IACtD,CACA,MAAAE,IAAUC,GAEN,OADA/C,KAAKiC,QAAQ7B,QAAQ2C,GACd/C,IACX,CACA,OAAAgD,IAAWD,GAEP,OADA/C,KAAKiC,QAAQgB,WAAWF,GACjB/C,IACX,CACA,OAAAkD,CAAQR,GACJ,IAAKA,EACD,MAAM,IAAIrD,MAAM,6BAEpB,IAAK,IAAIkD,EAAQ,EAAGA,EAAQvC,KAAKiC,QAAQrB,OAAQ2B,IAAS,CACtD,MAAMC,EAASxC,KAAKiC,QAAQM,GAC5B,IAAKC,eAAgDA,EAAOE,cAAgBA,EACxE,OAAOH,CAEf,CACA,MAAM,IAAIlD,MAAM,qBAAqBqD,IACzC,CACA,IAAAS,GACI,OAAOnD,KAAKiC,QAAQrD,IAAKwE,GAAMA,EAAEV,WACrC,CACA,KAAAW,CAAMX,KAAeY,GACjB,MAAMf,EAAQvC,KAAKkD,QAAQR,GAE3B,OADA1C,KAAKiC,QAAQsB,OAAOhB,EAAQ,EAAG,KAAMe,GAC9BtD,IACX,CACA,MAAAwD,CAAOd,KAAeY,GAClB,MAAMf,EAAQvC,KAAKkD,QAAQR,GAE3B,OADA1C,KAAKiC,QAAQsB,OAAOhB,EAAO,KAAMe,GAC1BtD,IACX,CACA,OAAAyD,CAAQf,KAAeY,GACnB,MAAMf,EAAQvC,KAAKkD,QAAQR,GAE3B,OADA1C,KAAKiC,QAAQsB,OAAOhB,EAAO,KAAMe,GAC1BtD,IACX,CACA,MAAA0D,CAAOhB,GACH,MAAMH,EAAQvC,KAAKkD,QAAQR,GAE3B,OADA1C,KAAKiC,QAAQsB,OAAOhB,EAAO,GACpBvC,IACX,CACA,KAAA2D,GAEI,OADA3D,KAAKiC,QAAQrB,OAAS,EACfZ,IACX,CACA,gBAAA4D,CAAiBC,GACb,OAAe,IAAXA,GACA7D,KAAK2C,YAAc,KACZ3C,OAEPA,KAAK2C,cAGT3C,KAAK2C,YAAeL,IAChB,IAAKA,EAAQrC,UAAW,CACpB4C,QAAQJ,IAAIH,GACZ,MAAMwB,EAAQ,IAAIzE,MAAM,GAAGW,KAAKR,eAEhC,MADAsE,EAAMC,UAAW,EACXD,CACV,IARO9D,KAWf,ECjGJ,MAAMgE,EACF,WAAA/C,CAAYP,GACRV,KAAKiE,YAAcvD,GAAW,CAAA,EAC9BV,KAAKkE,MAAQ,CAAA,CACjB,CACA,OAAAxD,CAAQA,GAIJ,OAHIA,IACAV,KAAKiE,YAAcvD,GAEhBV,KAAKiE,WAChB,CACA,IAAA5C,CAAK7B,EAAM2E,GACP,IAAI9C,EAAO8C,EACX,GAAoB,iBAAT3E,EAAmB,CAC1B,QAAoB,IAAT6B,EACP,OAAOrB,KAAKkE,MAAM1E,GAEtBQ,KAAKkE,MAAM1E,GAAQ6B,CACvB,CACA,GAAI7B,GAAQA,EAAKA,KAAM,CAEnB,GADA6B,EAAO7B,EACH6B,EAAKe,YAAcpC,KACnB,OAAOqB,EAEXrB,KAAKkE,MAAM7C,EAAK7B,MAAQ6B,CAC5B,CACA,IAAKA,EACD,MAAM,IAAIhC,MAAM,wBAAwBG,KAG5C,OADA6B,EAAKe,UAAYpC,KACVqB,CACX,CAEA,OAAAa,CAAQC,EAAOd,GACX,IAAIiB,EAAUH,EACdG,EAAQ5B,QAAUV,KAAKU,UACvB,IACI0D,EADAC,EAAWhD,GAAQc,EAAMd,MAAQ,UAErC,KAAOgD,QACsC,IAA9B/B,EAAQvB,oBAEfuB,EAAQxB,KAAOwB,EAAQvB,kBACvBuB,EAAQvB,kBAAoB,MAER,iBAAbsD,IACPA,EAAWrE,KAAKqB,KAAKgD,IAEzBA,EAASnC,QAAQI,GACjB8B,EAAWC,EACXA,EAAW,KACP/B,GACIA,EAAQxB,OACRwB,EAAUA,EAAQxB,KAClBuD,EAAW/B,EAAQjB,MAAQ+C,GAKvC,OAAO9B,EAAQrC,UAAYqC,EAAQvC,YAASuE,CAChD,ECpDJ,MAAMC,EAAe,CAACC,EAAQC,EAAQC,EAAQC,IAAWH,EAAOE,KAAYD,EAAOE,GA0FnF,IAAAC,EALY,CAACJ,EAAQC,EAAQI,EAAOvC,KAChC,MAAMwC,EAAexC,GAAW,CAAA,EAC1ByC,EAtFW,EAACP,EAAQC,EAAQI,EAAOvC,KACzC,IAAIrD,EAAIsC,EAAIC,EACZ,MAAMwD,EAAOR,EAAO5D,OACdqE,EAAOR,EAAO7D,OACpB,IAAIsE,EACAC,EAEJ,MAAMJ,EAAS,IAAIrG,MAAMsG,EAAO,GAChC,IAAKE,EAAI,EAAGA,EAAIF,EAAO,EAAGE,IAAK,CAC3B,MAAME,EAAe,IAAI1G,MAAMuG,EAAO,GACtC,IAAKE,EAAI,EAAGA,EAAIF,EAAO,EAAGE,IACtBC,EAAaD,GAAK,EAEtBJ,EAAOG,GAAKE,CAChB,CAGA,IAFAL,EAAOF,MAAQA,EAEVK,EAAI,EAAGA,EAAIF,EAAO,EAAGE,IAAK,CAC3B,MAAMG,EAAaN,EAAOG,GAC1B,QAAmBZ,IAAfe,EACA,MAAM,IAAIhG,MAAM,+BAEpB,MAAMiG,EAAmBP,EAAOG,EAAI,GACpC,QAAyBZ,IAArBgB,EACA,MAAM,IAAIjG,MAAM,+BAEpB,IAAK8F,EAAI,EAAGA,EAAIF,EAAO,EAAGE,IAClBN,EAAML,EAAQC,EAAQS,EAAI,EAAGC,EAAI,EAAG7C,GACpC+C,EAAWF,IAAyC,QAAlClG,EAAKqG,EAAiBH,EAAI,UAAuB,IAAPlG,EAAgBA,EAAK,GAAK,EAGtFoG,EAAWF,GAAKI,KAAKC,IAAmC,QAA9BjE,EAAK+D,EAAiBH,UAAuB,IAAP5D,EAAgBA,EAAK,EAAgC,QAA5BC,EAAK6D,EAAWF,EAAI,cAAgB3D,EAAgBA,EAAK,EAG9J,CACA,OAAOuD,GAmDQU,CAAajB,EAAQC,EAAQI,GAASN,EAAcO,GACnE,MAlDc,EAACC,EAAQP,EAAQC,EAAQnC,KACvC,IAAIoC,EAASF,EAAO5D,OAChB+D,EAASF,EAAO7D,OACpB,MAAM8E,EAAc,CAChBC,SAAU,GACVC,SAAU,GACVC,SAAU,IAEd,KAAkB,IAAXnB,GAA2B,IAAXC,GAAc,CACjC,QAAqBL,IAAjBS,EAAOF,MACP,MAAM,IAAIxF,MAAM,0CAGpB,GADmB0F,EAAOF,MAAML,EAAQC,EAAQC,EAAS,EAAGC,EAAS,EAAGrC,GAEpEoD,EAAYC,SAAS1C,QAAQuB,EAAOE,EAAS,IAC7CgB,EAAYE,SAAS3C,QAAQyB,EAAS,GACtCgB,EAAYG,SAAS5C,QAAQ0B,EAAS,KACpCD,IACAC,MAED,CACD,MAAMmB,EAAkBf,EAAOL,GAC/B,QAAwBJ,IAApBwB,EACA,MAAM,IAAIzG,MAAM,+BAEpB,MAAM0G,EAAqBD,EAAgBnB,EAAS,GACpD,QAA2BL,IAAvByB,EACA,MAAM,IAAI1G,MAAM,iCAEpB,MAAM2G,EAAwBjB,EAAOL,EAAS,GAC9C,QAA8BJ,IAA1B0B,EACA,MAAM,IAAI3G,MAAM,+BAEpB,MAAM4G,EAAoBD,EAAsBrB,GAChD,QAA0BL,IAAtB2B,EACA,MAAM,IAAI5G,MAAM,iCAEhB0G,EAAqBE,IACnBtB,IAGAD,CAEV,CACJ,CACA,OAAOgB,GAKAQ,CAAUnB,EAAQP,EAAQC,EAAQK,IC9E7C,SAASqB,EAAW3B,EAAQC,EAAQC,EAAQC,EAAQrC,GAChD,MAAM8D,EAAS5B,EAAOE,GAChB2B,EAAS5B,EAAOE,GACtB,GAAIyB,IAAWC,EACX,OAAO,EAEX,GAAsB,iBAAXD,GAAyC,iBAAXC,EACrC,OAAO,EAEX,MAAMC,EAAahE,EAAQgE,WAC3B,IAAKA,EAED,OAAOhE,EAAQiE,iBAAmB7B,IAAWC,EAEjDrC,EAAQkE,WAAalE,EAAQkE,YAAc,GAC3C,IAAIC,EAAQnE,EAAQkE,WAAW9B,GAI/B,QAHqB,IAAV+B,IACPnE,EAAQkE,WAAW9B,GAAU+B,EAAQH,EAAWF,EAAQ1B,SAEvC,IAAV+B,EACP,OAAO,EAEXnE,EAAQoE,WAAapE,EAAQoE,YAAc,GAC3C,IAAIC,EAAQrE,EAAQoE,WAAW/B,GAI/B,YAHqB,IAAVgC,IACPrE,EAAQoE,WAAW/B,GAAUgC,EAAQL,EAAWD,EAAQ1B,SAEvC,IAAVgC,GAGJF,IAAUE,CACrB,CACO,MAAMC,EAAa,SAA0BtE,GAChD,IAAIrD,EAAIsC,EAAIC,EAAIC,EAAIoF,EACpB,IAAKvE,EAAQwE,YACT,OAEJ,MAAMC,EAAe,CACjBT,WAAuC,QAA1BrH,EAAKqD,EAAQ5B,eAA4B,IAAPzB,SAAyBA,EAAGqH,WAC3EC,gBAA4C,QAA1BhF,EAAKe,EAAQ5B,eAA4B,IAAPa,SAAyBA,EAAGgF,iBAEpF,IAEIhE,EACAmC,EACAC,EAJAqC,EAAa,EACbC,EAAa,EAIjB,MAAMzC,EAASlC,EAAQpB,KACjBuD,EAASnC,EAAQnB,MACjB6D,EAAOR,EAAO5D,OACdqE,EAAOR,EAAO7D,OACpB,IAAIP,EA0BAN,EAlBJ,IAPIiF,EAAO,GACPC,EAAO,IACN8B,EAAaT,YAC0B,kBAAjCS,EAAaR,kBACpBQ,EAAaR,iBAnErB,SAA8B/B,EAAQC,EAAQO,EAAMC,GAChD,IAAK,IAAIP,EAAS,EAAGA,EAASM,EAAMN,IAAU,CAC1C,MAAMwC,EAAO1C,EAAOE,GACpB,IAAK,IAAIC,EAAS,EAAGA,EAASM,EAAMN,IAAU,CAC1C,MAAMwC,EAAO1C,EAAOE,GACpB,GAAID,IAAWC,GAAUuC,IAASC,EAC9B,OAAO,CAEf,CACJ,CACA,OAAO,CACX,CAwDwCC,CAAqB5C,EAAQC,EAAQO,EAAMC,IAGxE+B,EAAahC,GAChBgC,EAAa/B,GACbkB,EAAW3B,EAAQC,EAAQuC,EAAYA,EAAYD,IACnDxE,EAAQyE,EACR3G,EAAQ,IAAIW,EAAYwD,EAAOjC,GAAQkC,EAAOlC,IAC9CD,EAAQlC,KAAKC,EAAOkC,GACpByE,IAGJ,KAAOC,EAAaD,EAAahC,GAC7BiC,EAAaD,EAAa/B,GAC1BkB,EAAW3B,EAAQC,EAAQO,EAAO,EAAIiC,EAAYhC,EAAO,EAAIgC,EAAYF,IACzErC,EAASM,EAAO,EAAIiC,EACpBtC,EAASM,EAAO,EAAIgC,EACpB5G,EAAQ,IAAIW,EAAYwD,EAAOE,GAASD,EAAOE,IAC/CrC,EAAQlC,KAAKC,EAAOsE,GACpBsC,IAGJ,GAAID,EAAaC,IAAejC,EAAM,CAClC,GAAIA,IAASC,EAGT,YADA3C,EAAQxC,eAAUwE,GAAWpE,OAOjC,IAHAH,EAASA,GAAU,CACfsH,GAAI,KAEH9E,EAAQyE,EAAYzE,EAAQ0C,EAAOgC,EAAY1E,IAChDxC,EAAOwC,GAAS,CAACkC,EAAOlC,IACxBD,EAAQhB,mBAAmBvB,EAAOwC,IAGtC,YADAD,EAAQxC,UAAUC,GAAQG,MAE9B,CACA,GAAI8G,EAAaC,IAAehC,EAAM,CAKlC,IAHAlF,EAASA,GAAU,CACfsH,GAAI,KAEH9E,EAAQyE,EAAYzE,EAAQyC,EAAOiC,EAAY1E,IAAS,CACzD,MAAM+E,EAAM,IAAI/E,IAChBxC,EAAOuH,GAAO,CAAC9C,EAAOjC,GAAQ,EAAG,GACjCD,EAAQhB,mBAAmBvB,EAAOuH,GACtC,CAEA,YADAhF,EAAQxC,UAAUC,GAAQG,MAE9B,CAEA6G,EAAaP,gBAAalC,EAC1ByC,EAAaL,gBAAapC,EAE1B,MAAMiD,EAAW/C,EAAOgD,MAAMR,EAAYhC,EAAOiC,GAC3CQ,EAAWhD,EAAO+C,MAAMR,EAAY/B,EAAOgC,GAC3CS,EAAM9C,EAAQ2C,EAAUE,EAAUtB,EAAYY,GAC9CY,EAAe,GAIrB,IAHA5H,EAASA,GAAU,CACfsH,GAAI,KAEH9E,EAAQyE,EAAYzE,EAAQyC,EAAOiC,EAAY1E,IAChD,GAAImF,EAAI9B,SAAS1C,QAAQX,EAAQyE,GAAc,EAAG,CAE9C,MAAMM,EAAM,IAAI/E,IAChBxC,EAAOuH,GAAO,CAAC9C,EAAOjC,GAAQ,EAAG,GACjCD,EAAQhB,mBAAmBvB,EAAOuH,IAClCK,EAAavH,KAAKmC,EACtB,CAEJ,IAAIqF,GAAa,GACe,QAA1BpG,EAAKc,EAAQ5B,eAA4B,IAAPc,OAAgB,EAASA,EAAGqG,UAAiD,IAAtCvF,EAAQ5B,QAAQmH,OAAOD,aAClGA,GAAa,GAEjB,IAAIE,GAAqB,GAC4D,QAAhFjB,EAAgC,QAA1BpF,EAAKa,EAAQ5B,eAA4B,IAAPe,OAAgB,EAASA,EAAGoG,cAA2B,IAAPhB,OAAgB,EAASA,EAAGiB,sBACrHA,GAAqB,GAEzB,MAAMC,EAAqBJ,EAAa/G,OACxC,IAAK2B,EAAQyE,EAAYzE,EAAQ0C,EAAOgC,EAAY1E,IAAS,CACzD,MAAMyF,EAAgBN,EAAI7B,SAAS3C,QAAQX,EAAQyE,GACnD,GAAIgB,EAAgB,EAAG,CAEnB,IAAIC,GAAS,EACb,GAAIL,GAAcG,EAAqB,EACnC,IAAK,IAAIG,EAAmB,EAAGA,EAAmBH,EAAoBG,IAAoB,CACtFxD,EAASiD,EAAaO,GACtB,MAAMC,OAAwB7D,IAAXI,OAAuBJ,EAAYvE,EAAO,IAAI2E,KACjE,QAAeJ,IAAXI,GACAyD,GACAhC,EAAWoB,EAAUE,EAAU/C,EAASsC,EAAYzE,EAAQyE,EAAYD,GAAe,CAEvFoB,EAAW5E,OAAO,EAAG,EAAGhB,EAlK7B,GAmKK4F,EAAW5E,OAAO,EAAG,EAAGhB,EAnK7B,GAoKUuF,IAEDK,EAAW,GAAK,IAEpBxD,EAASpC,EACTlC,EAAQ,IAAIW,EAAYwD,EAAOE,GAASD,EAAOE,IAC/CrC,EAAQlC,KAAKC,EAAOsE,GACpBgD,EAAapE,OAAO2E,EAAkB,GACtCD,GAAS,EACT,KACJ,CACJ,CAECA,IAEDlI,EAAOwC,GAAS,CAACkC,EAAOlC,IACxBD,EAAQhB,mBAAmBvB,EAAOwC,IAE1C,KACK,CAED,QAAoC+B,IAAhCoD,EAAI9B,SAASoC,GACb,MAAM,IAAI3I,MAAM,0BAA0B2I,oBAAgCN,EAAI9B,YAGlF,GADAlB,EAASgD,EAAI9B,SAASoC,GAAiBhB,OACH1C,IAAhCoD,EAAI7B,SAASmC,GACb,MAAM,IAAI3I,MAAM,0BAA0B2I,oBAAgCN,EAAI7B,YAElFlB,EAAS+C,EAAI7B,SAASmC,GAAiBhB,EACvC3G,EAAQ,IAAIW,EAAYwD,EAAOE,GAASD,EAAOE,IAC/CrC,EAAQlC,KAAKC,EAAOsE,EACxB,CACJ,CACArC,EAAQxC,UAAUC,GAAQG,MAC9B,EACA0G,EAAWlE,WAAa,SACxB,MAAM0F,EAAU,CACZC,YAAW,CAACC,EAAGC,IACJD,EAAIC,EAEfC,cAAchJ,GACH,CAAC8I,EAAGC,IAAMD,EAAE9I,GAAQ+I,EAAE/I,IAGxBiJ,EAAc,SAA2BnG,GAClD,IAAIrD,EACJ,IAAKqD,EAAQoG,OACT,OAEJ,MAAMC,EAAcrG,EAAQR,MAC5B,GAAuB,MAAnB6G,EAAYtB,GACZ,OAEJ,IAAI9E,EACAmC,EACJ,MAAM5C,EAAQ6G,EACRC,EAAQtG,EAAQpB,KAEtB,IAAI2H,EAAW,GACXC,EAAW,GACf,MAAMC,EAAW,GACjB,IAAKxG,KAAST,EACV,GAAc,OAAVS,EACA,GAAiB,MAAbA,EAAM,GAAY,CAClB,MAAMyG,EAAsBzG,EAE5B,QAAmC+B,IAA/BxC,EAAMkH,IAC6B,IAAlClH,EAAMkH,GAAqB,IAvO7B,IAwOKlH,EAAMkH,GAAqB,GAI/B,MAAM,IAAI3J,MAAM,qFAA2H,QAArCJ,EAAK6C,EAAMkH,UAAyC,IAAP/J,OAAgB,EAASA,EAAG,MAH/K4J,EAASzI,KAAK6I,OAAOC,SAAS3G,EAAMiF,MAAM,GAAI,IAKtD,KACK,CACD,MAAM2B,EAAc5G,EACc,IAA9BT,EAAMqH,GAAavI,OAEnBkI,EAAS1I,KAAK,CACVmC,MAAO0G,OAAOC,SAASC,EAAa,IACpCC,MAAOtH,EAAMqH,GAAa,KAK9BJ,EAAS3I,KAAK,CACVmC,MAAO0G,OAAOC,SAASC,EAAa,IACpCrH,MAAOA,EAAMqH,IAGzB,CAKR,IADAN,EAAWA,EAASQ,KAAKjB,EAAQC,aAC5B9F,EAAQsG,EAASjI,OAAS,EAAG2B,GAAS,EAAGA,IAAS,CAEnD,GADAmC,EAASmE,EAAStG,QACH+B,IAAXI,EACA,SACJ,MAAM4E,EAAYxH,EAAM,IAAI4C,KACtB6E,EAAeX,EAAMrF,OAAOmB,EAAQ,GAAG,GAzQlC,KA0QN4E,aAA6C,EAASA,EAAU,KAEjER,EAAS1I,KAAK,CACVmC,MAAO+G,EAAU,GACjBF,MAAOG,GAGnB,CAEAT,EAAWA,EAASO,KAAKjB,EAAQI,cAAc,UAC/C,MAAMgB,EAAiBV,EAASlI,OAChC,IAAK2B,EAAQ,EAAGA,EAAQiH,EAAgBjH,IAAS,CAC7C,MAAMkH,EAAYX,EAASvG,QACT+B,IAAdmF,GAEJb,EAAMrF,OAAOkG,EAAUlH,MAAO,EAAGkH,EAAUL,MAC/C,CAEA,MAAMM,EAAiBX,EAASnI,OAChC,GAAI8I,EAAiB,EACjB,IAAKnH,EAAQ,EAAGA,EAAQmH,EAAgBnH,IAAS,CAC7C,MAAMoH,EAAeZ,EAASxG,GAC9B,QAAqB+B,IAAjBqF,EACA,SACJ,MAAMtJ,EAAQ,IAAIwB,EAAa+G,EAAMe,EAAapH,OAAQoH,EAAa7H,OACvEQ,EAAQlC,KAAKC,EAAOsJ,EAAapH,MACrC,CAECD,EAAQ3B,SAIb2B,EAAQpC,OAHJoC,EAAQxC,UAAU8I,GAAO1I,MAIjC,EACAuI,EAAY/F,WAAa,SAClB,MAAMkH,EAA6B,SAAoCtH,GAC1E,IAAKA,IAAYA,EAAQ3B,SACrB,OAGJ,GAA6B,MADH2B,EAAQR,MACZuF,GAClB,OAEJ,MAAMuB,EAAQtG,EAAQpB,KAChBN,EAAS0B,EAAQ3B,SAASC,OAChC,IAAK,IAAI2B,EAAQ,EAAGA,EAAQ3B,EAAQ2B,IAAS,CACzC,MAAMlC,EAAQiC,EAAQ3B,SAAS4B,GAC/B,QAAc+B,IAAVjE,EACA,SAEJuI,EADmBvI,EAAMG,WACLH,EAAMN,MAC9B,CACAuC,EAAQxC,UAAU8I,GAAO1I,MAC7B,EACA0J,EAA2BlH,WAAa,wBACjC,MAAMmH,EAAgB,SAA6BvH,GACtD,IAAKA,EAAQoG,OAAQ,CACjB,MAAMoB,EAAiBxH,EAAQR,MAC/B,GApUW,IAoUPgI,EAAe,GAAmB,CAClC,MAAMC,EAAiBD,EACvBxH,EAAQ0H,QAAU,IAAID,EAAe,KACrCzH,EACKxC,UAAU,CACXiK,EAAe,GACfd,OAAOC,SAAS5G,EAAQ9B,UAAUyJ,UAAU,GAAI,IA1U7C,IA6UF/J,MACT,CACA,MACJ,CACA,MAAMyI,EAAcrG,EAAQR,MAC5B,GAAuB,MAAnB6G,EAAYtB,GACZ,OAEJ,MAAM6C,EAAavB,EACnB,IAAK,MAAMnJ,KAAQ0K,EAAY,CAC3B,GAAa,OAAT1K,EACA,SAEJ,MAAMa,EAAQ,IAAI0B,EAAemI,EAAW1K,IAC5C8C,EAAQlC,KAAKC,EAAOb,EACxB,CACA8C,EAAQpC,MACZ,EACA2J,EAAcnH,WAAa,SAC3B,MAAMyH,EAAyB,CAACrI,EAAOS,EAAO6H,KAC1C,GAAqB,iBAAV7H,GAAmC,MAAbA,EAAM,GACnC,OAAO0G,OAAOC,SAAS3G,EAAM0H,UAAU,GAAI,IAE/C,GAAIvL,MAAMC,QAAQyL,IAA+B,IAAjBA,EAAU,GACtC,MAAO,IAAI7H,IAEf,IAAI8H,GAAgB9H,EACpB,IAAK,MAAM+H,KAAcxI,EAAO,CAC5B,MAAMyI,EAAYzI,EAAMwI,GACxB,GAAI5L,MAAMC,QAAQ4L,GACd,GA3WO,IA2WHA,EAAU,GAAmB,CAC7B,MAAMC,EAAgBvB,OAAOC,SAASoB,EAAWL,UAAU,GAAI,IACzDQ,EAAcF,EAAU,GAC9B,GAAIE,KAAiBlI,EACjB,OAAOiI,EAEPA,GAAiBH,GAAgBI,EAAcJ,EAC/CA,IAEKG,GAAiBH,GACtBI,EAAcJ,GACdA,GAER,MACK,GAAqB,IAAjBE,EAAU,GAAU,CACLtB,OAAOC,SAASoB,EAAWL,UAAU,GAAI,KAC1CI,GACfA,GAER,MAC8B,IAArBE,EAAU3J,QACfqI,OAAOC,SAASoB,EAAY,KAAOD,GACnCA,GAGZ,CACA,OAAOA,GAEEK,EAAgCpI,IACzC,IAAKA,IAAYA,EAAQ3B,SACrB,OAEJ,MAAMgK,EAAoBrI,EAAQR,MAClC,GAA6B,MAAzB6I,EAAkBtD,GAClB,OAEJ,MAAM6C,EAAaS,EACb/J,EAAS0B,EAAQ3B,SAASC,OAC1BkB,EAAQ,CACVuF,GAAI,KAER,IAAK,IAAI9E,EAAQ,EAAGA,EAAQ3B,EAAQ2B,IAAS,CACzC,MAAMlC,EAAQiC,EAAQ3B,SAAS4B,GAC/B,QAAc+B,IAAVjE,EACA,SACJ,IAAIb,EAAOa,EAAM2J,QACjB,QAAoB,IAATxK,EAAsB,CAC7B,QAAwB8E,IAApBjE,EAAMG,UACN,MAAM,IAAInB,MAAM,gCAEpBG,EAAO2K,EAAuBD,EAAY7J,EAAMG,UAAWH,EAAMN,OACrE,CACI+B,EAAMtC,KAAUa,EAAMN,SAEtB+B,EAAMtC,GAAQa,EAAMN,OAE5B,CACAuC,EAAQxC,UAAUgC,GAAO5B,QAE7BwK,EAA6BhI,WAAa,wBC1anC,MAAMkE,EAAa,SAAyBtE,GAC3CA,EAAQpB,gBAAgBrC,MACpByD,EAAQnB,iBAAiBtC,KACrByD,EAAQpB,KAAKpC,YAAcwD,EAAQnB,MAAMrC,UACzCwD,EAAQxC,UAAU,CAACwC,EAAQpB,KAAMoB,EAAQnB,QAGzCmB,EAAQxC,eAAUwE,GAItBhC,EAAQxC,UAAU,CAACwC,EAAQpB,KAAMoB,EAAQnB,QAE7CmB,EAAQpC,QAEHoC,EAAQnB,iBAAiBtC,MAC9ByD,EAAQxC,UAAU,CAACwC,EAAQpB,KAAMoB,EAAQnB,QAAQjB,MAEzD,EACA0G,EAAWlE,WAAa,QCXxB,MAAMkI,EAAc,IAAIC,IAAI,CAAC,cAChBC,EAA6BxI,IACtC,IAAKA,IAAYA,EAAQ3B,SACrB,OAEJ,MAAMC,EAAS0B,EAAQ3B,SAASC,OAChC,IAAIb,EAASuC,EAAQvC,OACrB,IAAK,IAAIwC,EAAQ,EAAGA,EAAQ3B,EAAQ2B,IAAS,CACzC,MAAMlC,EAAQiC,EAAQ3B,SAAS4B,GAC/B,QAAc+B,IAAVjE,QAEwB,IAAjBA,EAAMN,OAAjB,CAIA,GADAA,EAASA,GAAU,CAAA,OACKuE,IAApBjE,EAAMG,UACN,MAAM,IAAInB,MAAM,qCAEpBU,EAAOM,EAAMG,WAAaH,EAAMN,MALhC,CAMJ,CACIA,GAAUuC,EAAQwE,cAClB/G,EAAOsH,GAAK,KAEhB/E,EAAQxC,UAAUC,GAAQG,QAE9B4K,EAA0BpI,WAAa,kBAChC,MAAMqI,EAAqBzI,IAC9B,IAAIrD,EACJ,GAAIqD,EAAQwE,aAAoC,WAArBxE,EAAQ0I,SAC/B,OAEJ,MAAM9J,EAAOoB,EAAQpB,KACfC,EAAQmB,EAAQnB,MAChB8J,EAA4C,QAA1BhM,EAAKqD,EAAQ5B,eAA4B,IAAPzB,SAAyBA,EAAGgM,eACtF,IAAK,MAAMzL,KAAQ0B,EAAM,CACrB,IAAKzB,OAAOC,UAAUC,eAAeC,KAAKsB,EAAM1B,GAC5C,SAEJ,GAAIyL,IAAmBA,EAAezL,EAAM8C,GACxC,SAEJ,MAAMjC,EAAQ,IAAIW,EAAYE,EAAK1B,GAAO2B,EAAM3B,IAChD8C,EAAQlC,KAAKC,EAAOb,EACxB,CACA,IAAK,MAAMA,KAAQ2B,EACf,GAAK1B,OAAOC,UAAUC,eAAeC,KAAKuB,EAAO3B,MAG7CyL,GAAmBA,EAAezL,EAAM8C,UAGlB,IAAfpB,EAAK1B,GAAuB,CACnC,MAAMa,EAAQ,IAAIW,OAAYsD,EAAWnD,EAAM3B,IAC/C8C,EAAQlC,KAAKC,EAAOb,EACxB,CAEC8C,EAAQ3B,UAAwC,IAA5B2B,EAAQ3B,SAASC,OAI1C0B,EAAQpC,OAHJoC,EAAQxC,eAAUwE,GAAWpE,QAKrC6K,EAAkBrI,WAAa,UACxB,MAAM+F,EAAc,SAA2BnG,GAClD,IAAKA,EAAQoG,OACT,OAEJ,MAAMC,EAAcrG,EAAQR,MAC5B,GAAI6G,EAAYtB,GACZ,OAEJ,MAAM6D,EAAcvC,EACpB,IAAIwC,GAAiB,EACrB,IAAK,MAAM3L,KAAQ0L,EAAa,CAC5B,GAAIN,EAAYQ,IAAI5L,GAChB,SACJ,IAAKC,OAAOC,UAAUC,eAAeC,KAAKsL,EAAa1L,GACnD,SACJ,MAAM0B,EAAOoB,EAAQpB,KAGfmK,EAAqB,OAATnK,GACE,iBAATA,GACPzB,OAAOC,UAAUC,eAAeC,KAAKsB,EAAM1B,GACzC0B,EAAK1B,QACL8E,EACAjE,EAAQ,IAAIwB,EAAawJ,EAAWH,EAAY1L,IACtD8C,EAAQlC,KAAKC,EAAOb,GACpB2L,GAAiB,CACrB,CACKA,EAKL7I,EAAQpC,OAHJoC,EAAQxC,UAAUwC,EAAQpB,MAAMhB,MAIxC,EACAuI,EAAY/F,WAAa,UAClB,MAAMkH,EAA6B,SAAoCtH,GAC1E,IAAKA,IAAYA,EAAQ3B,SACrB,OAGJ,GAD0B2B,EAAQR,MACZuF,GAClB,OAGJ,GAAqB,OAAjB/E,EAAQpB,MAAyC,iBAAjBoB,EAAQpB,KAExC,YADAoB,EAAQxC,UAAUwC,EAAQpB,MAAMhB,OAGpC,MAAMoL,EAAShJ,EAAQpB,KACjBN,EAAS0B,EAAQ3B,SAASC,OAChC,IAAK,IAAI2B,EAAQ,EAAGA,EAAQ3B,EAAQ2B,IAAS,CACzC,MAAMlC,EAAQiC,EAAQ3B,SAAS4B,GAC/B,QAAc+B,IAAVjE,EACA,SACJ,MAAMkL,EAAWlL,EAAMG,UACnBoK,EAAYQ,IAAIG,KAEhB9L,OAAOC,UAAUC,eAAeC,KAAK0C,EAAQpB,KAAMqK,SAClCjH,IAAjBjE,EAAMN,cACCuL,EAAOC,GAETD,EAAOC,KAAclL,EAAMN,SAChCuL,EAAOC,GAAYlL,EAAMN,QAEjC,CACAuC,EAAQxC,UAAUwL,GAAQpL,MAC9B,EACA0J,EAA2BlH,WAAa,kBACjC,MAAMmH,EAAgB,SAA6BvH,GACtD,IAAKA,EAAQoG,OACT,OAGJ,GADoBpG,EAAQR,MACZuF,GACZ,OAEJ,MAAM6D,EAAc5I,EAAQR,MAC5B,IAAIqJ,GAAiB,EACrB,IAAK,MAAM3L,KAAQ0L,EAAa,CAC5B,GAAIN,EAAYQ,IAAI5L,GAChB,SACJ,IAAKC,OAAOC,UAAUC,eAAeC,KAAKsL,EAAa1L,GACnD,SACJ,MAAMa,EAAQ,IAAI0B,EAAemJ,EAAY1L,IAC7C8C,EAAQlC,KAAKC,EAAOb,GACpB2L,GAAiB,CACrB,CACKA,EAKL7I,EAAQpC,OAHJoC,EAAQxC,UAAU,IAAII,MAI9B,EACA2J,EAAcnH,WAAa,UACpB,MAAMgI,EAAgCpI,IACzC,IAAKA,IAAYA,EAAQ3B,SACrB,OAGJ,GAD0B2B,EAAQR,MACZuF,GAClB,OAEJ,MAAMzG,EAAS0B,EAAQ3B,SAASC,OAC1BkB,EAAQ,CAAA,EACd,IAAK,IAAIS,EAAQ,EAAGA,EAAQ3B,EAAQ2B,IAAS,CACzC,MAAMlC,EAAQiC,EAAQ3B,SAAS4B,GAC/B,QAAc+B,IAAVjE,EACA,SACJ,MAAMkL,EAAWlL,EAAMG,UACnBoK,EAAYQ,IAAIG,IAEhBzJ,EAAMyJ,KAAclL,EAAMN,SAC1B+B,EAAMyJ,GAAYlL,EAAMN,OAEhC,CACAuC,EAAQxC,UAAUgC,GAAO5B,QAE7BwK,EAA6BhI,WAAa,kBC3L1C,IAAI8I,EAAkB,KACtB,SAASC,EAAkB/K,EAASgL,GAChC,IAAIzM,EACJ,IAAKuM,EAAiB,CAClB,IAAIG,EACJ,KAAkF,QAA7E1M,EAAKyB,aAAyC,EAASA,EAAQkL,gBAA6B,IAAP3M,OAAgB,EAASA,EAAG4M,gBAGjH,CACD,IAAKH,EACD,OAAO,KAEX,MAAM5H,EAAQ,IAAIzE,MAAM,kJAGxB,MADAyE,EAAMgI,4BAA6B,EAC7BhI,CACV,CAVI6H,EAAW,IAAIjL,EAAQkL,SAASC,eAWpCL,EAAkB,CACdO,KAAM,CAACC,EAAMC,IAASN,EAASO,aAAaP,EAASQ,WAAWH,EAAMC,IACtEG,MAAO,CAACJ,EAAMI,KACV,MAAMC,EAAUV,EAASW,YAAYX,EAASY,eAAeH,GAAQJ,GACrE,IAAK,MAAMQ,KAAYH,EAAQ,GAC3B,IAAKG,EAAU,CACX,MAAM1I,EAAQ,IAAIzE,MAAM,qBAExB,MADAyE,EAAM2I,iBAAkB,EAClB3I,CACV,CAEJ,OAAOuI,EAAQ,IAG3B,CACA,OAAOb,CACX,CACO,MAAM5E,EAAa,SAAyBtE,GAC/C,IAAIrD,EAAIsC,EACR,GAAyB,WAArBe,EAAQ0I,SACR,OAEJ,MAAM9J,EAAOoB,EAAQpB,KACfC,EAAQmB,EAAQnB,MAChBuL,GAAgG,QAAlFnL,EAAgC,QAA1BtC,EAAKqD,EAAQ5B,eAA4B,IAAPzB,OAAgB,EAASA,EAAG2M,gBAA6B,IAAPrK,OAAgB,EAASA,EAAGmL,YA1CnH,GA2CvB,GAAIxL,EAAKN,OAAS8L,GAAavL,EAAMP,OAAS8L,EAE1C,YADApK,EAAQxC,UAAU,CAACoB,EAAMC,IAAQjB,OAIrC,MAAM2L,EAAiBJ,EAAkBnJ,EAAQ5B,SACjD,IAAKmL,EAID,YADAvJ,EAAQxC,UAAU,CAACoB,EAAMC,IAAQjB,OAGrC,MAAM6L,EAAOF,EAAeE,KAC5BzJ,EAAQxC,UAAU,CAACiM,EAAK7K,EAAMC,GAAQ,EAzDxB,IAyDuCjB,MACzD,EACA0G,EAAWlE,WAAa,QACjB,MAAM+F,EAAc,SAA0BnG,GACjD,GAAIA,EAAQoG,OACR,OAEJ,MAAMoB,EAAiBxH,EAAQR,MAC/B,GAjEc,IAiEVgI,EAAe,GACf,OAEJ,MAAM6C,EAAgB7C,EAEhBsC,EAAQX,EAAkBnJ,EAAQ5B,SAAS,GAAM0L,MACvD9J,EAAQxC,UAAUsM,EAAM9J,EAAQpB,KAAMyL,EAAc,KAAKzM,MAC7D,EACAuI,EAAY/F,WAAa,QACzB,MAAMkK,EAAoB9K,IACtB,IAAI7C,EAAIsC,EAAIC,EACZ,MAAMqL,EAAc,wCACdC,EAAQhL,EAAMiL,MAAM,MAC1B,IAAK,IAAIC,EAAI,EAAGA,EAAIF,EAAMlM,OAAQoM,IAAK,CACnC,MAAMC,EAAOH,EAAME,GACnB,QAAa1I,IAAT2I,EACA,SACJ,MAAMC,EAAYD,EAAKzF,MAAM,EAAG,GAChC,GAAkB,MAAd0F,EAAmB,CACnB,MAAMC,EAASN,EAAY1N,KAAK8N,GAChC,GAAe,OAAXE,EAAiB,CAGjBL,EAFmBE,GAGf,OAAOG,EAAO,MAAMA,EAAO,OAAOA,EAAO,MAAMA,EAAO,OAC9D,CACJ,MACK,GAAkB,MAAdD,GAEL,GADAJ,EAAME,GAAK,IAAwB,QAAnB/N,EAAK6N,EAAME,UAAuB,IAAP/N,OAAgB,EAASA,EAAGuI,MAAM,KACK,OAArD,QAAvBjG,EAAKuL,EAAME,EAAI,UAAuB,IAAPzL,OAAgB,EAASA,EAAGiG,MAAM,EAAG,IAAa,CAEnF,MAAM4F,EAAUN,EAAME,GACtBF,EAAME,GAAKF,EAAME,EAAI,GACrBF,EAAME,EAAI,GAAKI,CACnB,MAEmB,MAAdF,IACLJ,EAAME,GAAK,IAAwB,QAAnBxL,EAAKsL,EAAME,UAAuB,IAAPxL,OAAgB,EAASA,EAAGgG,MAAM,KAErF,CACA,OAAOsF,EAAMO,KAAK,OAETxD,EAAgB,SAA4BvH,GACrD,GAAIA,EAAQoG,OACR,OAEJ,MAAMoB,EAAiBxH,EAAQR,MAC/B,GAhHc,IAgHVgI,EAAe,GACf,OAEJ,MAAM6C,EAAgB7C,EAEtBxH,EACKxC,UAAU,CAAC8M,EAAiBD,EAAc,IAAK,EAtHtC,IAuHTzM,MACT,EACA2J,EAAcnH,WAAa,QCzHpB,MAAMkE,EAAa,SAAkCtE,GACxD,GAAIA,EAAQpB,OAASoB,EAAQnB,MAI7B,QAA4B,IAAjBmB,EAAQpB,KAOnB,QAA6B,IAAlBoB,EAAQnB,MAAnB,CAIA,GAA4B,mBAAjBmB,EAAQpB,MACU,mBAAlBoB,EAAQnB,MACf,MAAM,IAAI9B,MAAM,+BAEpBiD,EAAQ0I,SAA4B,OAAjB1I,EAAQpB,KAAgB,cAAgBoB,EAAQpB,KACnEoB,EAAQgL,UAA8B,OAAlBhL,EAAQnB,MAAiB,cAAgBmB,EAAQnB,MACjEmB,EAAQ0I,WAAa1I,EAAQgL,WAIR,YAArBhL,EAAQ0I,UAA+C,WAArB1I,EAAQ0I,UAIrB,WAArB1I,EAAQ0I,WACR1I,EAAQwE,YAAcpI,MAAMC,QAAQ2D,EAAQpB,OAEtB,WAAtBoB,EAAQgL,YACRhL,EAAQiL,aAAe7O,MAAMC,QAAQ2D,EAAQnB,QAE7CmB,EAAQwE,cAAgBxE,EAAQiL,aAIhCjL,EAAQpB,gBAAgBnC,SACpBuD,EAAQnB,iBAAiBpC,OACzBuD,EACKxC,UAAU,CAACwC,EAAQpB,KAAK9B,WAAYkD,EAAQnB,MAAM/B,aAClDc,OAGLoC,EAAQxC,UAAU,CAACwC,EAAQpB,KAAMoB,EAAQnB,QAAQjB,QAVrDoC,EAAQxC,UAAU,CAACwC,EAAQpB,KAAMoB,EAAQnB,QAAQjB,QAdjDoC,EAAQxC,UAAU,CAACwC,EAAQpB,KAAMoB,EAAQnB,QAAQjB,MARrD,MAFIoC,EAAQxC,UAAU,CAACwC,EAAQpB,KAAM,EAAG,IAAIhB,WAR5C,CACI,GAA6B,mBAAlBoC,EAAQnB,MACf,MAAM,IAAI9B,MAAM,+BAEpBiD,EAAQxC,UAAU,CAACwC,EAAQnB,QAAQjB,MAEvC,MATIoC,EAAQxC,eAAUwE,GAAWpE,MAgDrC,EACA0G,EAAWlE,WAAa,UACjB,MAAM+F,EAAc,SAAmCnG,GAC1D,QAA6B,IAAlBA,EAAQR,MAEf,YADAQ,EAAQxC,UAAUwC,EAAQpB,MAAMhB,OAIpC,GADAoC,EAAQoG,QAAUhK,MAAMC,QAAQ2D,EAAQR,OACpCQ,EAAQoG,OACR,OAEJ,MAAMoB,EAAiBxH,EAAQR,MAC/B,GAA8B,IAA1BgI,EAAelJ,OAInB,GAA8B,IAA1BkJ,EAAelJ,OAWW,IAA1BkJ,EAAelJ,QAAsC,IAAtBkJ,EAAe,IAC9CxH,EAAQxC,eAAUwE,GAAWpE,WAZjC,CACI,GAAIoC,EAAQpB,gBAAgBnC,OAAQ,CAChC,MAAMyO,EAAY,uBAAuBrO,KAAK2K,EAAe,IAC7D,GAAI0D,eAAsDA,EAAU,GAEhE,YADAlL,EAAQxC,UAAU,IAAIf,OAAOyO,EAAU,GAAIA,EAAU,KAAKtN,MAGlE,CACAoC,EAAQxC,UAAUgK,EAAe,IAAI5J,MAEzC,MAbIoC,EAAQxC,UAAUgK,EAAe,IAAI5J,MAiB7C,EACAuI,EAAY/F,WAAa,UAClB,MAAMmH,EAAgB,SAA8BvH,GACvD,QAA6B,IAAlBA,EAAQR,MAEf,YADAQ,EAAQxC,UAAUwC,EAAQR,OAAO5B,OAIrC,GADAoC,EAAQoG,QAAUhK,MAAMC,QAAQ2D,EAAQR,OACpCQ,EAAQoG,OACR,OAEJ,MAAMoB,EAAiBxH,EAAQR,MACD,IAA1BgI,EAAelJ,OAIW,IAA1BkJ,EAAelJ,OAIW,IAA1BkJ,EAAelJ,QAAsC,IAAtBkJ,EAAe,IAC9CxH,EAAQxC,UAAU,CAACgK,EAAe,KAAK5J,OAJvCoC,EAAQxC,UAAU,CAACgK,EAAe,GAAIA,EAAe,KAAK5J,OAJ1DoC,EAAQxC,UAAU,CAACgK,EAAe,GAAI,EAAG,IAAI5J,MAUrD,EACA2J,EAAcnH,WAAa,UC7F3B,MAAM+K,EACF,WAAAxM,CAAYP,GACRV,KAAKoC,UAAY,IAAI4B,EAAUtD,GAC/BV,KAAKoC,UAAUf,KAAK,IAAIW,EAAK,QACxBc,OAAO4K,EAAkCC,EAAoBC,EAAkBC,EAAkBC,EAA0BC,GAC3HnK,oBACL5D,KAAKoC,UAAUf,KAAK,IAAIW,EAAK,SACxBc,OAAOkL,EAAmCC,EAAmCC,EAAqBC,EAAmBC,EAAoBC,GACzIzK,oBACL5D,KAAKoC,UAAUf,KAAK,IAAIW,EAAK,WACxBc,OAAOwL,EAAqCC,EAAqCC,EAAuBC,EAAqBC,EAAsBC,GACnJ/K,mBACT,CACA,OAAAlD,CAAQA,GACJ,OAAOV,KAAKoC,UAAU1B,QAAQA,EAClC,CACA,IAAAqL,CAAK7K,EAAMC,GACP,OAAOnB,KAAKoC,UAAUF,QAAQ,IAAIlB,EAAYE,EAAMC,GACxD,CACA,KAAAiL,CAAMlL,EAAMY,GACR,OAAO9B,KAAKoC,UAAUF,QAAQ,IAAIL,EAAaX,EAAMY,GACzD,CACA,OAAA8M,CAAQ9M,GACJ,OAAO9B,KAAKoC,UAAUF,QAAQ,IAAIH,EAAeD,GACrD,CACA,OAAA+M,CAAQ1N,EAAOW,GACX,OAAO9B,KAAKoM,MAAMjL,EAAOnB,KAAK4O,QAAQ9M,GAC1C,CACA,KAAAtD,CAAM4K,GACF,OAAO5K,EAAM4K,EACjB,QCtCS0F,EACH5K,MAAoB,GAE5B,OAAA6K,CAAQ1N,GACNrB,KAAKkE,MAAM9D,KAAKiB,EAClB,CAEA,QAAA2N,CAASC,GACP,IAAK,MAAM5N,KAAQrB,KAAKkE,MACtB,IACE,MAAMnE,EAASsB,EAAK6N,MAAMD,GACtBlP,aAAkBoP,SACpBpP,EAAOqP,MAAOC,IACZxM,QAAQiB,MAAM,yBAA0BuL,IAG9C,CAAE,MAAOA,GACPxM,QAAQiB,MAAM,yBAA0BuL,EAC1C,CAEJ,CAEA,WAAMC,GACJ,MAAMC,EAAgBvP,KAAKkE,MAAMtF,IAAI4Q,MAAOnO,IAC1C,UACQA,EAAKiO,OACb,CAAE,MAAOD,GACPxM,QAAQiB,MAAM,uBAAwBuL,EACxC,UAEIF,QAAQM,IAAIF,EACpB,QChCoBG,GCMhB,MAAOC,UAAoBD,EACvBE,aACAC,WAEAC,OAAmC,CACzCC,MAAO,uCACPC,MAAO,qCACPC,KAAM,qCACNC,KAAM,qCACNC,MAAO,qCACPC,MACE,uGAGJ,WAAAnP,CAAYoP,GACVjP,QACApB,KAAK4P,aAAeS,GAAQT,cAAgB,UAC5C5P,KAAK6P,WAAaQ,GAAQR,YAAc,SAC1C,CAEA,KAAAX,CAAMD,GACJ,MAAMqB,EAAe,IAAIzR,KAAKoQ,EAAQsB,WAAWC,cAAczD,MAAM,KAAK,GAAGvF,MAAM,GAAG,GAChFiJ,EAAYxB,EAAQyB,OAAO9R,IAAK+R,GAAM,IAAIA,MAAMtD,KAAK,IACrDuD,EAAW3B,EAAQ4B,MAEnBC,EAAc,UAAU9Q,KAAK6P,iCAE7BkB,EAAa/Q,KAAK8P,OAAOc,GAKzB7N,EAAO,CAFE,MAAM/C,KAAK4P,mBAAmBU,QAAmBM,SAAgBH,OAAexB,EAAQ+B,UAIrGF,EARgB,kBAUhBC,EACA,GATiB,qCAWjB,SAGmBzM,IAAjB2K,EAAQgC,KACVpO,QAAQJ,OAAOM,EAAMkM,EAAQgC,MAE7BpO,QAAQJ,OAAOM,EAEnB,CAEA,KAAAuM,GAAe,ECrDX,MAAO4B,UAAsBxB,EACzByB,UAAqC,KACrCC,YAAgD,KAChDC,OAAuB,GAE/B,WAAApQ,CAAYqQ,GACVlQ,QACIkQ,aAA8BnC,QAChCnP,KAAKoR,YAAcE,EAAmBC,KAAMC,IAC1CxR,KAAKmR,UAAYK,EACjB,IAAK,MAAMvC,KAAWjP,KAAKqR,OACzBG,EAAQC,SAASxC,GAASG,MAAM,QAGlC,OADApP,KAAKqR,OAAS,GACPG,IAGTxR,KAAKmR,UAAYG,CAErB,CAEA,WAAMpC,CAAMD,GACNjP,KAAKmR,gBACDnR,KAAKmR,UAAUM,SAASxC,GACrBjP,KAAKoR,aACdpR,KAAKqR,OAAOjR,KAAK6O,EAErB,CAEA,WAAMK,GACJ,GAAItP,KAAKmR,gBACDnR,KAAKmR,UAAU7B,aAChB,GAAItP,KAAKoR,YAAa,CAC3B,MAAMI,QAAgBxR,KAAKoR,kBACrBI,EAAQlC,OAChB,CACF,ECCI,SAAUoC,EAAeC,GAC7B,OAAO,IAAIxC,QAAW,CAACyC,EAASC,KAC9BF,EAAQG,UAAY,IAAMF,EAAQD,EAAQ5R,QAC1C4R,EAAQI,QAAU,IAAMF,EAAOF,EAAQ7N,QAE3C,CClCA,MAAMkO,EAAiB,CACrBC,oBAAqB,GACrBC,gBAAiB,WAGNC,EACHC,SACAH,oBACAI,cACAC,UACAC,WACAL,gBACAM,GAAyB,KACzBC,MAAsB,GACtBC,WAAmD,KACnDC,eAAwD,KACxDC,cAAgB,QAChBC,cAAgB,QAExB,WAAA5R,CAAYoP,GACV,MAAMyC,EAASrT,OAAOsT,OAAO,CAAA,EAAIf,EAAgB3B,GACjDrQ,KAAKoS,SAAWU,EAAOV,SACvBpS,KAAKiS,oBAAsBa,EAAOb,oBAClCjS,KAAKqS,cAAgBS,EAAOT,cAC5BrS,KAAKsS,UAAYQ,EAAOR,UACxBtS,KAAKuS,WAAaO,EAAOP,WACzBvS,KAAKkS,gBAAkBY,EAAOZ,eAChC,CAKA,eAAAc,GACE,MAAO,eAAehT,KAAKoS,UAC7B,CAKA,UAAMa,GACJ,MAAMC,EAASlT,KAAKgT,sBD3CtBxT,EACA2T,EACAzS,EC2CEV,KAAKwS,SD7CPhT,EC6CyB0T,ED5CzBC,EC4CiC,ED3CjCzS,EC2CoC,CAChC0S,gBAAkBZ,IACXA,EAAGa,iBAAiBC,SAAS,aAChCd,EAAGe,kBAAkB,WAAY,CAAEC,QAAS,OAEzChB,EAAGa,iBAAiBC,SAAS,SACfd,EAAGe,kBAAkB,OAAQ,CAAEC,QAAS,KAAMC,eAAe,IACrEC,YAAY,YAAa,YAAa,CAAEC,QAAQ,MDhD1D,IAAIxE,QAAqB,CAACyC,EAASC,KACxC,MAAMF,EAAUiC,UAAUC,KAAKrU,EAAM2T,GAEjCzS,GAAS0S,kBACXzB,EAAQmC,gBAAmBC,IACzBrT,EAAQ0S,gBAAiBzB,EAAQ5R,OAAQgU,KAIzCrT,GAASsT,YACXrC,EAAQsC,UAAaF,IACnBrT,EAAQsT,UAAWD,KAIvBpC,EAAQG,UAAY,KAClBF,EAAQD,EAAQ5R,SAGlB4R,EAAQI,QAAU,KAChBF,EAAOF,EAAQ7N,WCiCjB,MAAMoQ,EAAMrV,KAAKqV,MACXC,EAA4B,CAChCC,GAAIpU,KAAKsS,UACT+B,UAAWH,EACXI,YAAaJ,EACb7B,cAAerS,KAAKqS,cACpBE,WAAYvS,KAAKuS,YAAc,UAC/BK,cAAe5S,KAAK4S,cACpBC,cAAe7S,KAAK6S,eAGtB,UACQ7S,KAAKuU,oBAAoBJ,GAC/BnU,KAAKwU,gBACP,CAAE,MAAOnF,GAKP,MAJIrP,KAAKwS,KACPxS,KAAKwS,GAAGiC,QACRzU,KAAKwS,GAAK,MAENnD,CACR,CACF,CAKA,yBAAMkF,CAAoBJ,GACxB,IAAKnU,KAAKwS,GAAI,MAAM,IAAInT,MAAM,4BAC9B,MACMqV,EADc1U,KAAKwS,GAAGmC,YAAY,WAAY,aAC1BC,YAAY,kBAChClD,EAAYgD,EAAMG,IAAIV,GAC9B,CAKA,kBAAMW,GACJ,IAAK9U,KAAKwS,GAAI,OACd,MACMkC,EADc1U,KAAKwS,GAAGmC,YAAY,WAAY,aAC1BC,YAAY,YAChCT,QAAkBzC,EAAYgD,EAAMK,IAAI/U,KAAKsS,YAC/C6B,IACFA,EAASG,YAAczV,KAAKqV,YACtBxC,EAAYgD,EAAMG,IAAIV,IAEhC,CAKQ,cAAAK,GACNxU,KAAKgV,gBACLhV,KAAK2S,eAAiBsC,YAAY,KAChCjV,KAAK8U,eAAe1F,MAAM,SACzB,IACL,CAKQ,aAAA4F,GACFhV,KAAK2S,iBACPuC,cAAclV,KAAK2S,gBACnB3S,KAAK2S,eAAiB,KAE1B,CAKA,cAAMlB,CAASxC,GACb,MAAMkG,EAAkB,IACnBlG,EACHqD,UAAWtS,KAAKsS,WAIE,SAAlBrD,EAAQ4B,OAAsC,UAAlB5B,EAAQ4B,OAAuC,UAAlB5B,EAAQ4B,OAGjE7Q,KAAKyS,MAAMrS,KAAK+U,SACVnV,KAAKsP,UAEXtP,KAAKyS,MAAMrS,KAAK+U,GACZnV,KAAKyS,MAAM7R,QAAU,SACjBZ,KAAKsP,QACDtP,KAAK0S,YACf1S,KAAKoV,gBAGX,CAKQ,aAAAA,GACFpV,KAAK0S,aACT1S,KAAK0S,WAAa2C,WAAW,KAC3BrV,KAAKsP,QAAQF,MAAM,SAClBpP,KAAKkS,iBACV,CAKA,WAAM5C,GAMJ,GALItP,KAAK0S,aACP4C,aAAatV,KAAK0S,YAClB1S,KAAK0S,WAAa,MAGM,IAAtB1S,KAAKyS,MAAM7R,OACb,OAGF,MAAM2U,EAAQ,IAAIvV,KAAKyS,OACvBzS,KAAKyS,MAAQ,SAEPzS,KAAKwV,eAAeD,EAC5B,CAKA,oBAAMC,CAAeC,GACnB,IAAKzV,KAAKwS,GAAI,MAAM,IAAInT,MAAM,4BD5I5B,IACJmT,EACAkD,EACAC,EACAC,QAHApD,EC4IuBxS,KAAKwS,GD3I5BkD,EC2IgC,OD1IhCC,EC0IwC,YDzIxCC,ECyIsDC,IAClD,MAAMnB,EAAQmB,EAAGjB,YAAY,QAC7B,IAAK,MAAMnS,KAAOgT,EAChBf,EAAMoB,IAAIrT,ID1IT,IAAI0M,QAAc,CAACyC,EAASC,KACjC,MAAMgE,EAAKrD,EAAGmC,YAAYe,EAAYC,GACtCE,EAAGE,WAAa,IAAMnE,IACtBiE,EAAG9D,QAAU,IAAMF,EAAOgE,EAAG/R,OAC7B8R,EAASC,KCyIX,CAKA,uBAAMG,CAAkB1D,GACtB,IAAKtS,KAAKwS,GAAI,MAAM,IAAInT,MAAM,4BAI9B,OAAOqS,EAHa1R,KAAKwS,GAAGmC,YAAY,OAAQ,YACtBC,YAAY,QAClBrS,MAAM,aACD0T,OAAOC,YAAYC,KAAK7D,IACnD,CAKA,oBAAM8D,GACJ,IAAKpW,KAAKwS,GAAI,MAAM,IAAInT,MAAM,4BAC9B,MACMqV,EADc1U,KAAKwS,GAAGmC,YAAY,WAAY,YAC1BC,YAAY,YAEtC,aADqBlD,EAAYgD,EAAMuB,WACtB,EACnB,CAMA,mBAAMI,GACJ,IAAKrW,KAAKwS,GAAI,MAAM,IAAInT,MAAM,4BAE9B,MAAMiX,QAAiBtW,KAAKoW,iBAC5B,GAAIE,EAAS1V,QAAUZ,KAAKiS,oBAC1B,OAIFqE,EAASjN,KAAK,CAACf,EAAGC,IAAMD,EAAE+L,UAAY9L,EAAE8L,WAExC,MAAMH,EAAMrV,KAAKqV,MAIXqC,EAAaD,EAAS9T,OAAQmO,IAClC,MAAM6F,EAAe7F,EAAEyD,KAAOpU,KAAKsS,UAC7BmE,EAAgB9F,EAAE2D,aAAeJ,EAAMvD,EAAE2D,YAAc,KAC7D,OAAQkC,IAAiBC,IAGrBC,EAAeJ,EAAS1V,OAASZ,KAAKiS,oBAC5C,GAAIyE,GAAgB,EAClB,OAGF,MAAMC,EAAkBJ,EAAW/O,MAAM,EAAGkP,GAE5C,IAAK,MAAME,KAAWD,EAAiB,CACrC,MACMjC,EADc1U,KAAKwS,GAAGmC,YAAY,WAAY,aAC1BC,YAAY,kBAChClD,EAAYgD,EAAMmC,OAAOD,EAAQxC,WAEjC,IAAIjF,QAAc,CAACyC,EAASC,KAChC,MAGMF,EAHc3R,KAAKwS,GAAImC,YAAY,OAAQ,aACvBC,YAAY,QAClBrS,MAAM,aACJuU,WAAWZ,YAAYC,KAAKS,EAAQxC,KAE1DzC,EAAQG,UAAY,KAClB,MAAMiF,EAASpF,EAAQ5R,OACnBgX,GACFA,EAAOF,SACPE,EAAOC,YAEPpF,KAGJD,EAAQI,QAAU,IAAMF,EAAOF,EAAQ7N,QAE3C,CACF,CAKA,0BAAMmT,CAAqB3E,EAAmB4E,GAC5C,IAAKlX,KAAKwS,GAAI,MAAM,IAAInT,MAAM,4BAE9B,OAAO,IAAI8P,QAAc,CAACyC,EAASC,KACjC,MAGMF,EAHc3R,KAAKwS,GAAImC,YAAY,OAAQ,YACvBC,YAAY,QAClBrS,MAAM,aACJuU,WAAWZ,YAAYC,KAAK7D,IAElDX,EAAQG,UAAY,KAClB,MAAMiF,EAASpF,EAAQ5R,OACnBgX,GACFG,EAAMH,EAAO3N,OACb2N,EAAOC,YAEPpF,KAGJD,EAAQI,QAAU,IAAMF,EAAOF,EAAQ7N,QAE3C,CAKA,WAAM2Q,GACJzU,KAAKgV,sBACChV,KAAKsP,QACPtP,KAAKwS,KACPxS,KAAKwS,GAAGiC,QACRzU,KAAKwS,GAAK,KAEd,QCrTW2E,EACHC,QACAC,UAAY,IAAIC,IAExB,WAAArW,CAAYzB,GACVQ,KAAKoX,QAAU,IAAIG,iBAAiB/X,GACpCQ,KAAKoX,QAAQI,UAAazD,IACxB,MAAM9C,EAAO8C,EAAM9C,KACnB,GAAIA,GAA6B,iBAAdA,EAAKwG,KAAmB,CACzC,MAAMC,EAAY1X,KAAKqX,UAAUtC,IAAI9D,EAAKwG,MAC1C,GAAIC,EACF,IAAK,MAAM9B,KAAY8B,EACrB,IACE9B,EAAS3E,EAAKhC,QAChB,CAAE,MAAO0I,GACP9U,QAAQiB,MAAM,kCAAmC6T,EACnD,CAGN,EAEJ,CAKA,OAAAC,CAAWH,EAAcxI,GACvBjP,KAAKoX,QAAQS,YAAY,CAAEJ,OAAMxI,WACnC,CAKA,SAAA6I,CAAaL,EAAc7B,GAKzB,OAJK5V,KAAKqX,UAAUjM,IAAIqM,IACtBzX,KAAKqX,UAAUU,IAAIN,EAAM,IAAI5M,KAE/B7K,KAAKqX,UAAUtC,IAAI0C,GAAO3B,IAAIF,GACvB,KACL,MAAM8B,EAAY1X,KAAKqX,UAAUtC,IAAI0C,GACjCC,IACFA,EAAUb,OAAOjB,GACM,IAAnB8B,EAAUM,MACZhY,KAAKqX,UAAUR,OAAOY,IAI9B,CAKA,KAAAhD,GACEzU,KAAKoX,QAAQ3C,QACbzU,KAAKqX,UAAU1T,OACjB,QCjDWsU,EACH7F,SACAC,cACA6F,OACA5F,UAA2B,KAC3B6F,MACAf,QAA+B,KAEvC,WAAAnW,CAAYoP,GACVrQ,KAAKoS,SAAW/B,EAAO+B,SACvBpS,KAAKqS,cAAgBhC,EAAOgC,cAC5BrS,KAAKkY,OAAS7H,EAAO6H,OACrBlY,KAAKmY,MAAQ,OAAOtZ,KAAKqV,SAAS3O,KAAK6S,SAAShZ,SAAS,IAAI6K,UAAU,EAAG,KAC5E,CAKA,iBAAMoO,GACJ,MAAMC,EAAc,+BAA+BtY,KAAKoS,WACxDpS,KAAKoX,QAAU,IAAID,EAAamB,GAEhC,IAAIC,EAAcC,eAAeC,QAAQ,4BAmBzC,OAjBKF,UAAsBvY,KAAK0Y,eAAeH,KAC7CA,EChCG,WAAW1Z,KAAKqV,SAAS3O,KAAK6S,SAAShZ,SAAS,IAAI6K,UAAU,EAAG,MDiCpEuO,eAAeG,QAAQ,2BAA4BJ,IAGrDvY,KAAKsS,UAAYiG,EAGjBvY,KAAKoX,QAAQU,UAAgD,QAAU7I,IACjEA,EAAQqD,YAActS,KAAKsS,WAAarD,EAAQkJ,QAAUnY,KAAKmY,OAEjEnY,KAAKoX,SAASQ,QAAQ,WAAY,CAChCtF,UAAWtS,KAAKsS,cAKftS,KAAKsS,SACd,CAEQ,oBAAMoG,CAAepG,EAAYtS,KAAKsS,WAC5C,IAAKA,IAActS,KAAKoX,QACtB,MAAM,IAAI/X,MAAM,0DAGlB,OAAO,IAAI8P,QAAkByC,IAC3B,MAAMgH,EAAUvD,WAAW,KACzBzD,GAAQ,IACP,IAEGiH,EAAsB7Y,KAAKoX,QAASU,UACxC,WACC7I,IACKA,EAAQqD,YAAcA,IACxBuG,MACAvD,aAAasD,GACbhH,GAAQ,MAKd5R,KAAKoX,QAASQ,QAAQ,QAAS,CAC7BtF,YACA6F,MAAOnY,KAAKmY,SAGlB,CAKA,aAAAW,GACE,IAEE,GAA0C,mBAA/B9Y,KAAKkY,QAAQa,cACtB,OAAO/Y,KAAKkY,OAAOa,gBAIrB,MAAMC,OE1FsC,IAApCC,WAAmBC,aACrBD,WAAmBC,aAEP,oBAAXC,OACFA,OAEFF,WFqFH,GAAID,GAASI,GAAGjG,QACd,OAAO6F,EAAQI,EAAEjG,OAErB,CAAE,MAEF,CACA,OAAO,IACT,CAKA,YAAAkG,GACE,IAAKrZ,KAAKsS,UACR,MAAM,IAAIjT,MAAM,+DAElB,OAAOW,KAAKsS,SACd,CAKA,KAAAmC,GACMzU,KAAKoX,UACPpX,KAAKoX,QAAQ3C,QACbzU,KAAKoX,QAAU,KAEnB,EG5FF,IAAIkC,EAAKC,WAAYC,EAAMC,YAAaC,EAAMC,WAE1CC,EAAO,IAAIN,EAAG,CAAC,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,EAAgB,EAAG,EAAoB,IAE1IO,EAAO,IAAIP,EAAG,CAAC,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,GAAI,GAAI,GAAI,GAAI,GAAI,GAAI,GAAI,GAAiB,EAAG,IAEjIQ,EAAO,IAAIR,EAAG,CAAC,GAAI,GAAI,GAAI,EAAG,EAAG,EAAG,EAAG,EAAG,GAAI,EAAG,GAAI,EAAG,GAAI,EAAG,GAAI,EAAG,GAAI,EAAG,KAE7ES,EAAO,SAAUC,EAAIC,GAErB,IADA,IAAI1R,EAAI,IAAIiR,EAAI,IACPxM,EAAI,EAAGA,EAAI,KAAMA,EACtBzE,EAAEyE,GAAKiN,GAAS,GAAKD,EAAGhN,EAAI,GAGhC,IAAIkN,EAAI,IAAIR,EAAInR,EAAE,KAClB,IAASyE,EAAI,EAAGA,EAAI,KAAMA,EACtB,IAAK,IAAImN,EAAI5R,EAAEyE,GAAImN,EAAI5R,EAAEyE,EAAI,KAAMmN,EAC/BD,EAAEC,GAAOA,EAAI5R,EAAEyE,IAAO,EAAKA,EAGnC,MAAO,CAAEzE,EAAGA,EAAG2R,EAAGA,EACtB,EACIjb,EAAK8a,EAAKH,EAAM,GAAIQ,EAAKnb,EAAGsJ,EAAG8R,GAAQpb,EAAGib,EAE9CE,EAAG,IAAM,IAAKC,GAAM,KAAO,GAI3B,IAHG,IAAgCC,GAA1BP,EAAKF,EAAM,GAA0BK,EAE1CK,GAAM,IAAIf,EAAI,OACTxM,GAAI,EAAGA,GAAI,QAASA,GAAG,CAE5B,IAAI9H,IAAU,MAAJ8H,KAAe,GAAW,MAAJA,KAAe,EAE/C9H,IAAU,OADVA,IAAU,MAAJA,KAAe,GAAW,MAAJA,KAAe,KACtB,GAAW,KAAJA,KAAe,EAC3CqV,GAAIvN,MAAY,MAAJ9H,KAAe,GAAW,IAAJA,KAAe,IAAO,CAC5D,CAIA,IAAIsV,YAAkBC,EAAIC,EAAIR,GAO1B,IANA,IAAIvJ,EAAI8J,EAAG7Z,OAEPoM,EAAI,EAEJ2N,EAAI,IAAInB,EAAIkB,GAET1N,EAAI2D,IAAK3D,EACRyN,EAAGzN,MACD2N,EAAEF,EAAGzN,GAAK,GAGpB,IAII4N,EAJAC,EAAK,IAAIrB,EAAIkB,GACjB,IAAK1N,EAAI,EAAGA,EAAI0N,IAAM1N,EAClB6N,EAAG7N,GAAM6N,EAAG7N,EAAI,GAAK2N,EAAE3N,EAAI,IAAO,EAGtC,GAAIkN,EAAG,CAEHU,EAAK,IAAIpB,EAAI,GAAKkB,GAElB,IAAII,EAAM,GAAKJ,EACf,IAAK1N,EAAI,EAAGA,EAAI2D,IAAK3D,EAEjB,GAAIyN,EAAGzN,GAQH,IANA,IAAI+N,EAAM/N,GAAK,EAAKyN,EAAGzN,GAEnBgO,EAAMN,EAAKD,EAAGzN,GAEdiO,EAAIJ,EAAGJ,EAAGzN,GAAK,MAAQgO,EAElBE,EAAID,GAAM,GAAKD,GAAO,EAAIC,GAAKC,IAAKD,EAEzCL,EAAGL,GAAIU,IAAMH,GAAOC,CAIpC,MAGI,IADAH,EAAK,IAAIpB,EAAI7I,GACR3D,EAAI,EAAGA,EAAI2D,IAAK3D,EACbyN,EAAGzN,KACH4N,EAAG5N,GAAKuN,GAAIM,EAAGJ,EAAGzN,GAAK,OAAU,GAAKyN,EAAGzN,IAIrD,OAAO4N,CACV,EAEGO,GAAM,IAAI7B,EAAG,KACjB,IAAStM,GAAI,EAAGA,GAAI,MAAOA,GACvBmO,GAAInO,IAAK,EACb,IAASA,GAAI,IAAKA,GAAI,MAAOA,GACzBmO,GAAInO,IAAK,EACb,IAASA,GAAI,IAAKA,GAAI,MAAOA,GACzBmO,GAAInO,IAAK,EACb,IAASA,GAAI,IAAKA,GAAI,MAAOA,GACzBmO,GAAInO,IAAK,EAEb,IAAIoO,GAAM,IAAI9B,EAAG,IACjB,IAAStM,GAAI,EAAGA,GAAI,KAAMA,GACtBoO,GAAIpO,IAAK,EAEV,IAACqO,GAAoBb,GAAKW,GAAK,EAAG,GAEjCG,GAAoBd,GAAKY,GAAK,EAAG,GAqBjCG,GAAO,SAAUC,GAAK,OAASA,EAAI,GAAK,EAAK,CAAG,EAGhDC,GAAM,SAAUR,EAAGtK,EAAGgH,GAMtB,OAHS,MAALA,GAAaA,EAAIsD,EAAEra,UACnB+W,EAAIsD,EAAEra,QAEH,IAAI0Y,EAAG2B,EAAES,SAAS/K,EAAGgH,GAChC,EAsBIgE,GAAK,CACL,iBACA,qBACA,yBACA,mBACA,kBACA,oBACJ,CACI,cACA,qBACA,uBACA,8BACA,oBACA,mBACA,oBAIAtM,GAAM,SAAUuM,EAAKhZ,EAAKiZ,GAC1B,IAAIlE,EAAI,IAAItY,MAAMuD,GAAO+Y,GAAGC,IAI5B,GAHAjE,EAAEmE,KAAOF,EACLvc,MAAM0c,mBACN1c,MAAM0c,kBAAkBpE,EAAGtI,KAC1BwM,EACD,MAAMlE,EACV,OAAOA,CACX,EAuLIqE,GAAQ,SAAUC,EAAGT,EAAGP,GACxBA,IAAU,EAAJO,EACN,IAAIU,EAAKV,EAAI,EAAK,EAClBS,EAAEC,IAAMjB,EACRgB,EAAEC,EAAI,IAAMjB,GAAK,CACrB,EAEIkB,GAAU,SAAUF,EAAGT,EAAGP,GAC1BA,IAAU,EAAJO,EACN,IAAIU,EAAKV,EAAI,EAAK,EAClBS,EAAEC,IAAMjB,EACRgB,EAAEC,EAAI,IAAMjB,GAAK,EACjBgB,EAAEC,EAAI,IAAMjB,GAAK,EACrB,EAEImB,GAAQ,SAAUH,EAAGvB,GAGrB,IADA,IAAI2B,EAAI,GACCrP,EAAI,EAAGA,EAAIiP,EAAErb,SAAUoM,EACxBiP,EAAEjP,IACFqP,EAAEjc,KAAK,CAAEuQ,EAAG3D,EAAG5J,EAAG6Y,EAAEjP,KAE5B,IAAI2D,EAAI0L,EAAEzb,OACN0b,EAAKD,EAAE7U,QACX,IAAKmJ,EACD,MAAO,CAAE0L,EAAGE,GAAI5B,EAAG,GACvB,GAAS,GAALhK,EAAQ,CACR,IAAIsK,EAAI,IAAI3B,EAAG+C,EAAE,GAAG1L,EAAI,GAExB,OADAsK,EAAEoB,EAAE,GAAG1L,GAAK,EACL,CAAE0L,EAAGpB,EAAGN,EAAG,EACtB,CACA0B,EAAEhT,KAAK,SAAUf,EAAGC,GAAK,OAAOD,EAAElF,EAAImF,EAAEnF,CAAG,GAG3CiZ,EAAEjc,KAAK,CAAEuQ,GAAG,EAAIvN,EAAG,QACnB,IAAIuX,EAAI0B,EAAE,GAAInC,EAAImC,EAAE,GAAIG,EAAK,EAAGC,EAAK,EAAGC,EAAK,EAO7C,IANAL,EAAE,GAAK,CAAE1L,GAAG,EAAIvN,EAAGuX,EAAEvX,EAAI8W,EAAE9W,EAAGuX,EAAGA,EAAGT,EAAGA,GAMhCuC,GAAM9L,EAAI,GACbgK,EAAI0B,EAAEA,EAAEG,GAAIpZ,EAAIiZ,EAAEK,GAAItZ,EAAIoZ,IAAOE,KACjCxC,EAAImC,EAAEG,GAAMC,GAAMJ,EAAEG,GAAIpZ,EAAIiZ,EAAEK,GAAItZ,EAAIoZ,IAAOE,KAC7CL,EAAEI,KAAQ,CAAE9L,GAAG,EAAIvN,EAAGuX,EAAEvX,EAAI8W,EAAE9W,EAAGuX,EAAGA,EAAGT,EAAGA,GAE9C,IAAIyC,EAASL,EAAG,GAAG3L,EACnB,IAAS3D,EAAI,EAAGA,EAAI2D,IAAK3D,EACjBsP,EAAGtP,GAAG2D,EAAIgM,IACVA,EAASL,EAAGtP,GAAG2D,GAGvB,IAAIiM,EAAK,IAAIpD,EAAImD,EAAS,GAEtBE,EAAMC,GAAGT,EAAEI,EAAK,GAAIG,EAAI,GAC5B,GAAIC,EAAMnC,EAAI,CAIN1N,EAAI,EAAR,IAAW+P,EAAK,EAEZC,EAAMH,EAAMnC,EAAIuC,EAAM,GAAKD,EAE/B,IADAV,EAAGjT,KAAK,SAAUf,EAAGC,GAAK,OAAOqU,EAAGrU,EAAEoI,GAAKiM,EAAGtU,EAAEqI,IAAMrI,EAAElF,EAAImF,EAAEnF,CAAG,GAC1D4J,EAAI2D,IAAK3D,EAAG,CACf,IAAIkQ,EAAOZ,EAAGtP,GAAG2D,EACjB,KAAIiM,EAAGM,GAAQxC,GAKX,MAJAqC,GAAME,GAAO,GAAMJ,EAAMD,EAAGM,IAC5BN,EAAGM,GAAQxC,CAInB,CAEA,IADAqC,IAAOC,EACAD,EAAK,GAAG,CACX,IAAII,EAAOb,EAAGtP,GAAG2D,EACbiM,EAAGO,GAAQzC,EACXqC,GAAM,GAAMrC,EAAKkC,EAAGO,KAAU,IAE5BnQ,CACV,CACA,KAAOA,GAAK,GAAK+P,IAAM/P,EAAG,CACtB,IAAIoQ,EAAOd,EAAGtP,GAAG2D,EACbiM,EAAGQ,IAAS1C,MACVkC,EAAGQ,KACHL,EAEV,CACAF,EAAMnC,CACV,CACA,MAAO,CAAE2B,EAAG,IAAI/C,EAAGsD,GAAKjC,EAAGkC,EAC/B,EAEIC,GAAK,SAAUO,EAAG1C,EAAGsB,GACrB,OAAc,GAAPoB,EAAE1M,EACHpL,KAAKC,IAAIsX,GAAGO,EAAE1C,EAAGA,EAAGsB,EAAI,GAAIa,GAAGO,EAAEnD,EAAGS,EAAGsB,EAAI,IAC1CtB,EAAE0C,EAAE1M,GAAKsL,CACpB,EAEIqB,GAAK,SAAUC,GAGf,IAFA,IAAI5M,EAAI4M,EAAE3c,OAEH+P,IAAM4M,IAAI5M,KAMjB,IAJA,IAAI6M,EAAK,IAAIhE,IAAM7I,GAEf8M,EAAM,EAAGC,EAAMH,EAAE,GAAII,EAAM,EAC3BC,EAAI,SAAU3C,GAAKuC,EAAGC,KAASxC,CAAG,EAC7BjO,EAAI,EAAGA,GAAK2D,IAAK3D,EACtB,GAAIuQ,EAAEvQ,IAAM0Q,GAAO1Q,GAAK2D,IAClBgN,MACD,CACD,IAAKD,GAAOC,EAAM,EAAG,CACjB,KAAOA,EAAM,IAAKA,GAAO,IACrBC,EAAE,OACFD,EAAM,IACNC,EAAED,EAAM,GAAOA,EAAM,IAAO,EAAK,MAAUA,EAAM,GAAM,EAAK,OAC5DA,EAAM,EAEd,MACK,GAAIA,EAAM,EAAG,CAEd,IADAC,EAAEF,KAAQC,EACHA,EAAM,EAAGA,GAAO,EACnBC,EAAE,MACFD,EAAM,IACNC,EAAID,EAAM,GAAM,EAAK,MAAOA,EAAM,EAC1C,CACA,KAAOA,KACHC,EAAEF,GACNC,EAAM,EACND,EAAMH,EAAEvQ,EACZ,CAEJ,MAAO,CAAEuQ,EAAGC,EAAG9B,SAAS,EAAG+B,GAAMJ,EAAG1M,EACxC,EAEIkN,GAAO,SAAUC,EAAIN,GAErB,IADA,IAAI7C,EAAI,EACC3N,EAAI,EAAGA,EAAIwQ,EAAG5c,SAAUoM,EAC7B2N,GAAKmD,EAAG9Q,GAAKwQ,EAAGxQ,GACpB,OAAO2N,CACX,EAGIoD,GAAQ,SAAUC,EAAKC,EAAKC,GAE5B,IAAIvN,EAAIuN,EAAItd,OACRsb,EAAIX,GAAK0C,EAAM,GACnBD,EAAI9B,GAAS,IAAJvL,EACTqN,EAAI9B,EAAI,GAAKvL,GAAK,EAClBqN,EAAI9B,EAAI,GAAc,IAAT8B,EAAI9B,GACjB8B,EAAI9B,EAAI,GAAkB,IAAb8B,EAAI9B,EAAI,GACrB,IAAK,IAAIlP,EAAI,EAAGA,EAAI2D,IAAK3D,EACrBgR,EAAI9B,EAAIlP,EAAI,GAAKkR,EAAIlR,GACzB,OAAqB,GAAbkP,EAAI,EAAIvL,EACpB,EAEIwN,GAAO,SAAUD,EAAKF,EAAKI,EAAOC,EAAMC,EAAIC,EAAIvE,EAAIwE,EAAIC,EAAIC,EAAIlD,GAChEQ,GAAMgC,EAAKxC,IAAK4C,KACdE,EAAG,KAML,IALA,IAAIrf,EAAKmd,GAAMkC,EAAI,IAAKK,EAAM1f,EAAGod,EAAGuC,EAAM3f,EAAG0b,EACzCpZ,EAAK6a,GAAMmC,EAAI,IAAKM,EAAMtd,EAAG8a,EAAGyC,EAAMvd,EAAGoZ,EACzCnZ,EAAK8b,GAAGqB,GAAMI,EAAOvd,EAAG+b,EAAGyB,EAAMxd,EAAG6b,EACpC5b,EAAK6b,GAAGuB,GAAMI,EAAOxd,EAAG8b,EAAG2B,EAAMzd,EAAG4b,EACpC8B,EAAS,IAAI3F,EAAI,IACZxM,EAAI,EAAGA,EAAI+R,EAAKne,SAAUoM,IAC7BmS,EAAiB,GAAVJ,EAAK/R,IAClB,IAASA,EAAI,EAAGA,EAAIiS,EAAKre,SAAUoM,IAC7BmS,EAAiB,GAAVF,EAAKjS,IAGlB,IAFA,IAAInG,EAAKuV,GAAM+C,EAAQ,GAAIC,EAAMvY,EAAGwV,EAAGgD,EAAOxY,EAAG8T,EAC7C2E,EAAO,GACJA,EAAO,IAAMF,EAAItF,EAAKwF,EAAO,MAAOA,GAE3C,IAKIC,EAAIC,EAAIC,EAAIC,EALZC,EAAQjB,EAAK,GAAM,EACnBkB,EAAQ/B,GAAKS,EAAInD,IAAO0C,GAAKU,EAAInD,IAAOpB,EACxC6F,EAAQhC,GAAKS,EAAIK,GAAOd,GAAKU,EAAIM,GAAO7E,EAAK,GAAK,EAAIsF,EAAOzB,GAAKsB,EAAQC,GAAO,EAAID,EAAO,IAAM,EAAIA,EAAO,IAAM,EAAIA,EAAO,IAClI,GAAIV,GAAM,GAAKkB,GAAQC,GAASD,GAAQE,EACpC,OAAO9B,GAAMC,EAAKxC,EAAG0C,EAAIxC,SAAS+C,EAAIA,EAAKC,IAG/C,GADA1C,GAAMgC,EAAKxC,EAAG,GAAKqE,EAAQD,IAASpE,GAAK,EACrCqE,EAAQD,EAAO,CACfL,EAAK/E,GAAKmE,EAAKC,EAAK,GAAIY,EAAKb,EAAKc,EAAKjF,GAAKqE,EAAKC,EAAK,GAAIY,EAAKb,EAC/D,IAAIiB,EAAMtF,GAAK4E,EAAKC,EAAM,GAC1BrD,GAAMgC,EAAKxC,EAAGwD,EAAM,KACpBhD,GAAMgC,EAAKxC,EAAI,EAAG0D,EAAM,GACxBlD,GAAMgC,EAAKxC,EAAI,GAAI8D,EAAO,GAC1B9D,GAAK,GACL,IAASxO,EAAI,EAAGA,EAAIsS,IAAQtS,EACxBgP,GAAMgC,EAAKxC,EAAI,EAAIxO,EAAGoS,EAAItF,EAAK9M,KACnCwO,GAAK,EAAI8D,EAET,IADA,IAAIS,EAAO,CAAChB,EAAME,GACTe,EAAK,EAAGA,EAAK,IAAKA,EACvB,KAAIC,EAAOF,EAAKC,GAChB,IAAShT,EAAI,EAAGA,EAAIiT,EAAKrf,SAAUoM,EAAG,CAClC,IAAIkT,EAAgB,GAAVD,EAAKjT,GACfgP,GAAMgC,EAAKxC,EAAGsE,EAAII,IAAO1E,GAAK4D,EAAIc,GAC9BA,EAAM,KACNlE,GAAMgC,EAAKxC,EAAIyE,EAAKjT,IAAM,EAAK,KAAMwO,GAAKyE,EAAKjT,IAAM,GAC7D,CANmB,CAQ3B,MAEIuS,EAAKlE,GAAKmE,EAAKrE,GAAKsE,EAAKnE,GAAKoE,EAAKtE,GAEvC,IAASpO,EAAI,EAAGA,EAAIwR,IAAMxR,EAAG,CACzB,IAAImT,EAAM9B,EAAKrR,GACf,GAAImT,EAAM,IAAK,CAEXhE,GAAQ6B,EAAKxC,EAAG+D,GADZW,EAAOC,GAAO,GAAM,IACC,MAAO3E,GAAKgE,EAAGU,EAAM,KAC1CA,EAAM,IACNlE,GAAMgC,EAAKxC,EAAI2E,GAAO,GAAM,IAAK3E,GAAK5B,EAAKsG,IAC/C,IAAIE,EAAY,GAAND,EACVhE,GAAQ6B,EAAKxC,EAAGiE,EAAGW,IAAO5E,GAAKkE,EAAGU,GAC9BA,EAAM,IACNjE,GAAQ6B,EAAKxC,EAAI2E,GAAO,EAAK,MAAO3E,GAAK3B,EAAKuG,GACtD,MAEIjE,GAAQ6B,EAAKxC,EAAG+D,EAAGY,IAAO3E,GAAKgE,EAAGW,EAE1C,CAEA,OADAhE,GAAQ6B,EAAKxC,EAAG+D,EAAG,MACZ/D,EAAIgE,EAAG,IAClB,EAEIa,GAAoB,IAAI3G,EAAI,CAAC,MAAO,OAAQ,OAAQ,OAAQ,OAAQ,QAAS,QAAS,QAAS,UAE/F6C,GAAmB,IAAIjD,EAAG,GAiI1BgH,GAAqB,WAErB,IADA,IAAIjE,EAAI,IAAI1C,WAAW,KACd3M,EAAI,EAAGA,EAAI,MAAOA,EAAG,CAE1B,IADA,IAAIuQ,EAAIvQ,EAAGuT,EAAI,IACNA,GACLhD,GAAU,EAAJA,IAAU,WAAeA,IAAM,EACzClB,EAAErP,GAAKuQ,CACX,CACA,OAAOlB,CACV,CATwB,GAgDrBmE,GAAO,SAAUtC,EAAKuC,EAAKC,EAAKC,EAAMC,GACtC,IAAKA,IACDA,EAAK,CAAEjG,EAAG,GACN8F,EAAII,YAAY,CAChB,IAAIC,EAAOL,EAAII,WAAWnF,UAAS,OAC/BqF,EAAS,IAAIzH,EAAGwH,EAAKlgB,OAASsd,EAAItd,QACtCmgB,EAAOhJ,IAAI+I,GACXC,EAAOhJ,IAAImG,EAAK4C,EAAKlgB,QACrBsd,EAAM6C,EACNH,EAAGhD,EAAIkD,EAAKlgB,MAChB,CAEJ,OA3LO,SAAUsd,EAAK8C,EAAKC,EAAMP,EAAKC,EAAMC,GAC5C,IAAIjQ,EAAIiQ,EAAGM,GAAKhD,EAAItd,OAChBsb,EAAI,IAAI5C,EAAGoH,EAAM/P,EAAI,GAAK,EAAIpL,KAAK4b,KAAKxQ,EAAI,MAASgQ,GAErD/C,EAAI1B,EAAER,SAASgF,EAAKxE,EAAEtb,OAAS+f,GAC/BS,EAAMR,EAAGjG,EACTsD,EAAoB,GAAb2C,EAAG1G,GAAK,GACnB,GAAI8G,EAAK,CACD/C,IACAL,EAAE,GAAKgD,EAAG1G,GAAK,GAenB,IAdA,IAAIuG,EAAMJ,GAAIW,EAAM,GAChB3D,EAAIoD,GAAO,GAAIlD,EAAU,KAANkD,EACnBY,GAAS,GAAKJ,GAAQ,EAEtBK,EAAOV,EAAGpF,GAAK,IAAIhC,EAAI,OAAQ+H,EAAOX,EAAGY,GAAK,IAAIhI,EAAI6H,EAAQ,GAC9DI,EAAQlc,KAAK4b,KAAKF,EAAO,GAAIS,EAAQ,EAAID,EACzCE,EAAM,SAAU3U,GAAK,OAAQkR,EAAIlR,GAAMkR,EAAIlR,EAAI,IAAMyU,EAAUvD,EAAIlR,EAAI,IAAM0U,GAAUL,CAAO,EAG9FhD,EAAO,IAAI3E,EAAI,MAEf4E,EAAK,IAAI9E,EAAI,KAAM+E,EAAK,IAAI/E,EAAI,IAEhCoI,EAAO,EAAG5H,EAAK,EAAGhN,EAAI4T,EAAG5T,GAAK,EAAGwR,EAAK,EAAGqD,EAAKjB,EAAGhD,GAAK,EAAGa,EAAK,EAC3DzR,EAAI,EAAI2D,IAAK3D,EAAG,CAEnB,IAAI8U,EAAKH,EAAI3U,GAET+U,EAAW,MAAJ/U,EAAWgV,EAAQT,EAAKO,GAKnC,GAJAR,EAAKS,GAAQC,EACbT,EAAKO,GAAMC,EAGPF,GAAM7U,EAAG,CAET,IAAIiV,EAAMtR,EAAI3D,EACd,IAAK4U,EAAO,KAAQpD,EAAK,SAAWyD,EAAM,MAAQb,GAAM,CACpDnD,EAAME,GAAKD,EAAKN,EAAG,EAAGS,EAAMC,EAAIC,EAAIvE,EAAIwE,EAAIC,EAAIzR,EAAIyR,EAAIR,GACxDO,EAAKoD,EAAO5H,EAAK,EAAGyE,EAAKzR,EACzB,IAAK,IAAImN,EAAI,EAAGA,EAAI,MAAOA,EACvBmE,EAAGnE,GAAK,EACZ,IAASA,EAAI,EAAGA,EAAI,KAAMA,EACtBoE,EAAGpE,GAAK,CAChB,CAEA,IAAIQ,EAAI,EAAGsB,EAAI,EAAGiG,EAAO3E,EAAG4E,EAAMJ,EAAOC,EAAQ,MACjD,GAAIC,EAAM,GAAKH,GAAMH,EAAI3U,EAAImV,GAMzB,IALA,IAAIC,EAAO7c,KAAK8c,IAAIhF,EAAG4E,GAAO,EAC1BK,EAAO/c,KAAK8c,IAAI,MAAOrV,GAGvBuV,EAAKhd,KAAK8c,IAAI,IAAKJ,GAChBE,GAAOG,KAAUJ,GAAQH,GAAQC,GAAO,CAC3C,GAAI9D,EAAIlR,EAAI2N,IAAMuD,EAAIlR,EAAI2N,EAAIwH,GAAM,CAEhC,IADA,IAAIK,EAAK,EACFA,EAAKD,GAAMrE,EAAIlR,EAAIwV,IAAOtE,EAAIlR,EAAIwV,EAAKL,KAAQK,GAEtD,GAAIA,EAAK7H,EAAG,CAGR,GAFAA,EAAI6H,EAAIvG,EAAIkG,EAERK,EAAKJ,EACL,MAIJ,IAAIK,EAAMld,KAAK8c,IAAIF,EAAKK,EAAK,GACzBE,EAAK,EACT,IAASvI,EAAI,EAAGA,EAAIsI,IAAOtI,EAAG,CAC1B,IAAIwI,EAAK3V,EAAImV,EAAMhI,EAAI,MAEnBM,EAAKkI,EADCrB,EAAKqB,GACK,MAChBlI,EAAKiI,IACLA,EAAKjI,EAAIuH,EAAQW,EACzB,CACJ,CACJ,CAGAR,IADAJ,EAAOC,IAAOA,EAAQV,EAAKS,IACL,KAC1B,CAGJ,GAAI9F,EAAG,CAGHoC,EAAKG,KAAQ,UAAanE,GAAMM,IAAM,GAAML,GAAM2B,GAClD,IAAI2G,EAAiB,GAAXvI,GAAMM,GAASkI,EAAiB,GAAXvI,GAAM2B,GACrCjC,GAAMJ,EAAKgJ,GAAO/I,EAAKgJ,KACrBvE,EAAG,IAAMsE,KACTrE,EAAGsE,GACLhB,EAAK7U,EAAI2N,IACPiH,CACN,MAEIvD,EAAKG,KAAQN,EAAIlR,KACfsR,EAAGJ,EAAIlR,GAEjB,CACJ,CACA,IAAKA,EAAIzH,KAAKC,IAAIwH,EAAG6U,GAAK7U,EAAI2D,IAAK3D,EAC/BqR,EAAKG,KAAQN,EAAIlR,KACfsR,EAAGJ,EAAIlR,IAEbiR,EAAME,GAAKD,EAAKN,EAAGwD,EAAK/C,EAAMC,EAAIC,EAAIvE,EAAIwE,EAAIC,EAAIzR,EAAIyR,EAAIR,GACrDmD,IACDR,EAAG1G,EAAW,EAAN+D,EAAWL,EAAGK,EAAM,EAAK,IAAM,EAEvCA,GAAO,EACP2C,EAAGY,EAAID,EAAMX,EAAGpF,EAAI8F,EAAMV,EAAG5T,EAAIA,EAAG4T,EAAGhD,EAAIiE,EAEnD,KACK,CACD,IAAS7U,EAAI4T,EAAGhD,GAAK,EAAG5Q,EAAI2D,EAAIyQ,EAAKpU,GAAK,MAAO,CAE7C,IAAI2K,EAAI3K,EAAI,MACR2K,GAAKhH,IAELiN,EAAGK,EAAM,EAAK,GAAKmD,EACnBzJ,EAAIhH,GAERsN,EAAMF,GAAMH,EAAGK,EAAM,EAAGC,EAAIxC,SAAS1O,EAAG2K,GAC5C,CACAiJ,EAAG5T,EAAI2D,CACX,CACA,OAAO8K,GAAIS,EAAG,EAAGwE,EAAMnF,GAAK0C,GAAO0C,EACvC,CA8DWmC,CAAK5E,EAAkB,MAAbuC,EAAI5P,MAAgB,EAAI4P,EAAI5P,MAAkB,MAAX4P,EAAIsC,IAAenC,EAAGjG,EAAIpV,KAAK4b,KAAuD,IAAlD5b,KAAKC,IAAI,EAAGD,KAAK8c,IAAI,GAAI9c,KAAK9C,IAAIyb,EAAItd,WAAmB,GAAO,GAAK6f,EAAIsC,IAAMrC,EAAKC,EAAMC,EACtL,EAqJIoC,GAAS,SAAU/G,EAAG1T,EAAG0S,GACzB,KAAOA,IAAK1S,EACR0T,EAAE1T,GAAK0S,EAAGA,KAAO,CACzB,EA6DIgI,GAAyB,WACzB,SAASA,EAAQC,EAAMC,GASnB,GARmB,mBAARD,IACPC,EAAKD,EAAMA,EAAO,CAAA,GACtBljB,KAAKojB,OAASD,EACdnjB,KAAKkc,EAAIgH,GAAQ,CAAA,EACjBljB,KAAK2Q,EAAI,CAAEgK,EAAG,EAAG3N,EAAG,MAAO4Q,EAAG,MAAOsD,EAAG,OAGxClhB,KAAKuI,EAAI,IAAI+Q,EAAG,OACZtZ,KAAKkc,EAAE2E,WAAY,CACnB,IAAIC,EAAO9gB,KAAKkc,EAAE2E,WAAWnF,UAAS,OACtC1b,KAAKuI,EAAEwP,IAAI+I,EAAM,MAAQA,EAAKlgB,QAC9BZ,KAAK2Q,EAAE3D,EAAI,MAAQ8T,EAAKlgB,MAC5B,CACJ,CAuEA,OAtEAqiB,EAAQvjB,UAAU8b,EAAI,SAAU+B,EAAGna,GAC/BpD,KAAKojB,OAAO5C,GAAKjD,EAAGvd,KAAKkc,EAAG,EAAG,EAAGlc,KAAK2Q,GAAIvN,EAC/C,EAMA6f,EAAQvjB,UAAUU,KAAO,SAAUijB,EAAOjF,GACjCpe,KAAKojB,QACN/T,GAAI,GACJrP,KAAK2Q,EAAEgK,GACPtL,GAAI,GACR,IAAIiU,EAASD,EAAMziB,OAASZ,KAAK2Q,EAAEuQ,EACnC,GAAIoC,EAAStjB,KAAKuI,EAAE3H,OAAQ,CACxB,GAAI0iB,EAAS,EAAItjB,KAAKuI,EAAE3H,OAAS,MAAO,CACpC,IAAI2iB,EAAS,IAAIjK,GAAY,MAATgK,GACpBC,EAAOxL,IAAI/X,KAAKuI,EAAEmT,SAAS,EAAG1b,KAAK2Q,EAAEuQ,IACrClhB,KAAKuI,EAAIgb,CACb,CACA,IAAIxW,EAAQ/M,KAAKuI,EAAE3H,OAASZ,KAAK2Q,EAAEuQ,EACnClhB,KAAKuI,EAAEwP,IAAIsL,EAAM3H,SAAS,EAAG3O,GAAQ/M,KAAK2Q,EAAEuQ,GAC5ClhB,KAAK2Q,EAAEuQ,EAAIlhB,KAAKuI,EAAE3H,OAClBZ,KAAKwb,EAAExb,KAAKuI,GAAG,GACfvI,KAAKuI,EAAEwP,IAAI/X,KAAKuI,EAAEmT,UAAS,QAC3B1b,KAAKuI,EAAEwP,IAAIsL,EAAM3H,SAAS3O,GAAQ,OAClC/M,KAAK2Q,EAAEuQ,EAAImC,EAAMziB,OAASmM,EAAQ,MAClC/M,KAAK2Q,EAAE3D,EAAI,MAAOhN,KAAK2Q,EAAEiN,EAAI,KACjC,MAEI5d,KAAKuI,EAAEwP,IAAIsL,EAAOrjB,KAAK2Q,EAAEuQ,GACzBlhB,KAAK2Q,EAAEuQ,GAAKmC,EAAMziB,OAEtBZ,KAAK2Q,EAAEgK,EAAY,EAARyD,GACPpe,KAAK2Q,EAAEuQ,EAAIlhB,KAAK2Q,EAAEiN,EAAI,MAAQQ,KAC9Bpe,KAAKwb,EAAExb,KAAKuI,EAAG6V,IAAS,GACxBpe,KAAK2Q,EAAEiN,EAAI5d,KAAK2Q,EAAE3D,EAAGhN,KAAK2Q,EAAE3D,GAAK,GAEjCoR,IAEApe,KAAK2Q,EAAI3Q,KAAKkc,EAAI,CAAA,EAClBlc,KAAKuI,EAAIgU,GAEjB,EASA0G,EAAQvjB,UAAU4P,MAAQ,SAAUkU,GAShC,GARKxjB,KAAKojB,QACN/T,GAAI,GACJrP,KAAK2Q,EAAEgK,GACPtL,GAAI,GACRrP,KAAKwb,EAAExb,KAAKuI,GAAG,GACfvI,KAAK2Q,EAAEiN,EAAI5d,KAAK2Q,EAAE3D,EAAGhN,KAAK2Q,EAAE3D,GAAK,EAG7BwW,EAAM,CACN,IAAIjG,EAAI,IAAIjE,EAAG,GACfiE,EAAE,GAAKvd,KAAK2Q,EAAEuJ,GAAK,EAEnB,IAAIuJ,EAAK1F,GAAMR,EAAGvd,KAAK2Q,EAAEuJ,EAAGqC,IAC5Bvc,KAAK2Q,EAAEuJ,EAAI,EACXla,KAAKojB,OAAO7F,EAAE7B,SAAS,EAAG+H,GAAM,IAAI,EACxC,CACJ,EACOR,CACX,IAmiBIS,GAA2B,oBAAfC,aAA4C,IAAIA,YAE5DC,GAA2B,oBAAfC,aAA4C,IAAIA,YAGhE,IACID,GAAGE,OAAOvH,GAAI,CAAEwH,QAAQ,GAE5B,CACA,MAAOpM,GAAK,CAwGL,SAASqM,GAAQC,EAAKC,GAOzB,GAAIR,GACA,OAAOA,GAAGS,OAAOF,GAKrB,IAJA,IAAItJ,EAAIsJ,EAAIrjB,OACRwjB,EAAK,IAAI9K,EAAG2K,EAAIrjB,QAAUqjB,EAAIrjB,QAAU,IACxCyjB,EAAK,EACLzG,EAAI,SAAU3C,GAAKmJ,EAAGC,KAAQpJ,CAAG,EAC5BjO,EAAI,EAAGA,EAAI2N,IAAK3N,EAAG,CACxB,GAAIqX,EAAK,EAAID,EAAGxjB,OAAQ,CACpB,IAAIyc,EAAI,IAAI/D,EAAG+K,EAAK,GAAM1J,EAAI3N,GAAM,IACpCqQ,EAAEtF,IAAIqM,GACNA,EAAK/G,CACT,CACA,IAAIE,EAAI0G,EAAIK,WAAWtX,GACnBuQ,EAAI,KAAO2G,EACXtG,EAAEL,GACGA,EAAI,MACTK,EAAE,IAAOL,GAAK,GAAKK,EAAE,IAAW,GAAJL,IACvBA,EAAI,OAASA,EAAI,OAElBK,EAAE,KADNL,EAAI,OAAa,QAAJA,GAAyC,KAAtB0G,EAAIK,aAAatX,KAC/B,IAAM4Q,EAAE,IAAQL,GAAK,GAAM,IAAMK,EAAE,IAAQL,GAAK,EAAK,IAAMK,EAAE,IAAW,GAAJL,KAEtFK,EAAE,IAAOL,GAAK,IAAMK,EAAE,IAAQL,GAAK,EAAK,IAAMK,EAAE,IAAW,GAAJL,GAC/D,CACA,OAAO9B,GAAI2I,EAAI,EAAGC,EACtB,CA2BA,IA+BIE,GAAO,SAAUC,GACjB,IAAI3J,EAAK,EACT,GAAI2J,EACA,IAAK,IAAIjE,KAAKiE,EAAI,CACd,IAAI7J,EAAI6J,EAAGjE,GAAG3f,OACV+Z,EAAI,OACJtL,GAAI,GACRwL,GAAMF,EAAI,CACd,CAEJ,OAAOE,CACX,EAEI4J,GAAM,SAAUxI,EAAG1T,EAAGnF,EAAGshB,EAAIC,EAAGpH,EAAGqH,EAAIhK,GACvC,IAAIR,EAAKsK,EAAG9jB,OAAQ4jB,EAAKphB,EAAEyhB,MAAOC,EAAMlK,GAAMA,EAAGha,OAC7CmkB,EAAMR,GAAKC,GACfxB,GAAO/G,EAAG1T,EAAS,MAANqc,EAAa,SAAY,UAAYrc,GAAK,EAC7C,MAANqc,IACA3I,EAAE1T,KAAO,GAAI0T,EAAE1T,KAAOnF,EAAE4hB,IAC5B/I,EAAE1T,GAAK,GAAIA,GAAK,EAChB0T,EAAE1T,KAAQnF,EAAE6hB,MAAQ,GAAM1H,EAAI,GAAK,GAAItB,EAAE1T,KAAOoc,GAAK,EACrD1I,EAAE1T,KAAuB,IAAhBnF,EAAE8hB,YAAmBjJ,EAAE1T,KAAOnF,EAAE8hB,aAAe,EACxD,IAAInI,EAAK,IAAIle,KAAgB,MAAXuE,EAAE+hB,MAAgBtmB,KAAKqV,MAAQ9Q,EAAE+hB,OAAQhgB,EAAI4X,EAAGqI,cAAgB,KAkBlF,IAjBIjgB,EAAI,GAAKA,EAAI,MACbkK,GAAI,IACR2T,GAAO/G,EAAG1T,EAAIpD,GAAK,GAAQ4X,EAAGsI,WAAa,GAAM,GAAOtI,EAAGuI,WAAa,GAAOvI,EAAGwI,YAAc,GAAOxI,EAAGyI,cAAgB,EAAMzI,EAAG0I,cAAgB,GAAKld,GAAK,GACpJ,GAALgV,IACAyF,GAAO/G,EAAG1T,EAAGnF,EAAEsiB,KACf1C,GAAO/G,EAAG1T,EAAI,EAAGgV,EAAI,GAAKA,EAAI,EAAIA,GAClCyF,GAAO/G,EAAG1T,EAAI,EAAGnF,EAAE4U,OAEvBgL,GAAO/G,EAAG1T,EAAI,GAAI6R,GAClB4I,GAAO/G,EAAG1T,EAAI,GAAIwc,GAAMxc,GAAK,GACnB,MAANqc,IACA5B,GAAO/G,EAAG1T,EAAGuc,GACb9B,GAAO/G,EAAG1T,EAAI,EAAGnF,EAAEuiB,OACnB3C,GAAO/G,EAAG1T,EAAI,GAAIqc,GAAKrc,GAAK,IAEhC0T,EAAElE,IAAI2M,EAAInc,GACVA,GAAK6R,EACD2K,EACA,IAAK,IAAIxE,KAAKiE,EAAI,CACd,IAAIoB,EAAMpB,EAAGjE,GAAI5F,EAAIiL,EAAIhlB,OACzBoiB,GAAO/G,EAAG1T,GAAIgY,GACdyC,GAAO/G,EAAG1T,EAAI,EAAGoS,GACjBsB,EAAElE,IAAI6N,EAAKrd,EAAI,GAAIA,GAAK,EAAIoS,CAChC,CAIJ,OAFImK,IACA7I,EAAElE,IAAI6C,EAAIrS,GAAIA,GAAKuc,GAChBvc,CACX,EAYIsd,GAAgC,WAKhC,SAASA,EAAeC,GA/oClB,IACFvI,EA+oCAvd,KAAK8lB,SAAWA,EAChB9lB,KAAKud,GAhpCLA,GAAI,EACD,CACH/B,EAAG,SAAUS,GAGT,IADA,IAAI8J,EAAKxI,EACAvQ,EAAI,EAAGA,EAAIiP,EAAErb,SAAUoM,EAC5B+Y,EAAKzF,GAAW,IAALyF,EAAY9J,EAAEjP,IAAO+Y,IAAO,EAC3CxI,EAAIwI,CACR,EACA9J,EAAG,WAAc,OAAQsB,CAAG,IAwoC5Bvd,KAAKgY,KAAO,EACZhY,KAAKklB,YAAc,CACvB,CA8BA,OArBAW,EAAenmB,UAAUwC,QAAU,SAAUmhB,EAAOjF,GAChDpe,KAAKojB,OAAO,KAAMC,EAAOjF,EAC7B,EAQAyH,EAAenmB,UAAUU,KAAO,SAAUijB,EAAOjF,GACxCpe,KAAKojB,QACN/T,GAAI,GACRrP,KAAKud,EAAE/B,EAAE6H,GACTrjB,KAAKgY,MAAQqL,EAAMziB,OACfwd,IACApe,KAAK0lB,IAAM1lB,KAAKud,EAAEtB,KAGtBjc,KAAKkC,QAAQmhB,EAAOjF,IAAS,EACjC,EACOyH,CACX,IAOIG,GAA4B,WAM5B,SAASA,EAAWF,EAAU5C,GAC1B,IArJYvI,EAqJRsL,EAAQjmB,KACPkjB,IACDA,EAAO,CAAA,GACX2C,GAAejmB,KAAKI,KAAM8lB,GAC1B9lB,KAAKic,EAAI,IAAIgH,GAAQC,EAAM,SAAUhF,EAAKE,GACtC6H,EAAM7C,OAAO,KAAMlF,EAAKE,EAC5B,GACApe,KAAKklB,YAAc,EACnBllB,KAAKilB,KA7JwB,IAAjBtK,EA6JIuI,EAAKrS,OA7JY,EAAI8J,EAAI,EAAI,EAAS,GAALA,EAAS,EAAI,CA8JlE,CAiBA,OAhBAqL,EAAWtmB,UAAUwC,QAAU,SAAUmhB,EAAOjF,GAC5C,IACIpe,KAAKic,EAAE7b,KAAKijB,EAAOjF,EACvB,CACA,MAAOzG,GACH3X,KAAKojB,OAAOzL,EAAG,KAAMyG,EACzB,CACJ,EAMA4H,EAAWtmB,UAAUU,KAAO,SAAUijB,EAAOjF,GACzCyH,GAAenmB,UAAUU,KAAKR,KAAKI,KAAMqjB,EAAOjF,EACpD,EACO4H,CACX,IAyCIE,GAAqB,WAMrB,SAASA,EAAI/C,GACTnjB,KAAKojB,OAASD,EACdnjB,KAAK2kB,EAAI,GACT3kB,KAAKic,EAAI,CACb,CAoIA,OA/HAiK,EAAIxmB,UAAUoW,IAAM,SAAUqQ,GAC1B,IAAIF,EAAQjmB,KAIZ,GAHKA,KAAKojB,QACN/T,GAAI,GAEK,EAATrP,KAAKic,EACLjc,KAAKojB,OAAO/T,GAAI,EAAmB,GAAL,EAATrP,KAAKic,GAAY,EAAG,GAAI,MAAM,OAClD,CACD,IAAI7Y,EAAI4gB,GAAQmC,EAAKL,UAAWM,EAAOhjB,EAAExC,OACrCylB,EAAMF,EAAKG,QAASpK,EAAImK,GAAOrC,GAAQqC,GACvC1B,EAAIyB,GAAQD,EAAKL,SAASllB,QAAWsb,GAAMmK,EAAIzlB,QAAUsb,EAAEtb,OAC3D2lB,EAAOH,EAAO7B,GAAK4B,EAAKtB,OAAS,GACjCuB,EAAO,OACPpmB,KAAKojB,OAAO/T,GAAI,GAAI,EAAG,GAAI,MAAM,GACrC,IAAIlC,EAAS,IAAImM,EAAGiN,GACpB9B,GAAItX,EAAQ,EAAGgZ,EAAM/iB,EAAGuhB,MACxB,IAAI6B,EAAS,CAACrZ,GACVsZ,EAAS,WACT,IAAK,IAAIC,EAAK,EAAGC,EAASH,EAAQE,EAAKC,EAAO/lB,OAAQ8lB,IAAM,CACxD,IAAIE,EAAMD,EAAOD,GACjBT,EAAM7C,OAAO,KAAMwD,GAAK,EAC5B,CACAJ,EAAS,EACb,EACIK,EAAO7mB,KAAKic,EAChBjc,KAAKic,EAAI,EACT,IAAI6K,EAAQ9mB,KAAK2kB,EAAE/jB,OACfmmB,EA3vCN,SAAUze,EAAGC,GACnB,IAAI2T,EAAI,CAAA,EACR,IAAK,IAAIqE,KAAKjY,EACV4T,EAAEqE,GAAKjY,EAAEiY,GACb,IAAK,IAAIA,KAAKhY,EACV2T,EAAEqE,GAAKhY,EAAEgY,GACb,OAAOrE,CACX,CAovCuB8K,CAAIb,EAAM,CACjB/iB,EAAGA,EACHuhB,EAAGA,EACHzI,EAAGA,EACHG,EAAG,WACK8J,EAAKc,WACLd,EAAKc,WACb,EACA/M,EAAG,WAEC,GADAuM,IACII,EAAM,CACN,IAAIK,EAAMjB,EAAMtB,EAAEmC,EAAQ,GACtBI,EACAA,EAAIhN,IAEJ+L,EAAMhK,EAAI,CAClB,CACA4K,EAAO,CACX,IAEAM,EAAO,EACXhB,EAAK/C,OAAS,SAAU/T,EAAK6O,EAAKE,GAC9B,GAAI/O,EACA4W,EAAM7C,OAAO/T,EAAK6O,EAAKE,GACvB6H,EAAMgB,iBAKN,GAFAE,GAAQjJ,EAAItd,OACZ4lB,EAAOpmB,KAAK8d,GACRE,EAAO,CACP,IAAIgJ,EAAK,IAAI9N,EAAG,IAChB0J,GAAOoE,EAAI,EAAG,WACdpE,GAAOoE,EAAI,EAAGjB,EAAKT,KACnB1C,GAAOoE,EAAI,EAAGD,GACdnE,GAAOoE,EAAI,GAAIjB,EAAKnO,MACpBwO,EAAOpmB,KAAKgnB,GACZL,EAAKxJ,EAAI4J,EAAMJ,EAAKxe,EAAIge,EAAOY,EAAO,GAAIJ,EAAKrB,IAAMS,EAAKT,IAAKqB,EAAK/O,KAAOmO,EAAKnO,KAC5E6O,GACAE,EAAK7M,IACT2M,EAAO,CACX,MACSA,GACLJ,GAEZ,EACAzmB,KAAK2kB,EAAEvkB,KAAK2mB,EAChB,CACJ,EAMAb,EAAIxmB,UAAU2nB,IAAM,WAChB,IAAIpB,EAAQjmB,KACC,EAATA,KAAKic,EACLjc,KAAKojB,OAAO/T,GAAI,EAAmB,GAAL,EAATrP,KAAKic,GAAY,EAAG,GAAI,MAAM,IAGnDjc,KAAKic,EACLjc,KAAK2X,IAEL3X,KAAK2kB,EAAEvkB,KAAK,CACR8Z,EAAG,WACiB,EAAV+L,EAAMhK,IAEZgK,EAAMtB,EAAEphB,QAAO,EAAI,GACnB0iB,EAAMtO,IACV,EACA0E,EAAG,WAAc,IAEzBrc,KAAKic,EAAI,EACb,EACAiK,EAAIxmB,UAAUiY,EAAI,WAEd,IADA,IAAI2P,EAAK,EAAG3M,EAAI,EAAG4M,EAAK,EACfb,EAAK,EAAGznB,EAAKe,KAAK2kB,EAAG+B,EAAKznB,EAAG2B,OAAQ8lB,IAAM,CAEhDa,GAAM,IADFnkB,EAAInE,EAAGynB,IACEtjB,EAAExC,OAAS2jB,GAAKnhB,EAAEyhB,QAAUzhB,EAAE8Y,EAAI9Y,EAAE8Y,EAAEtb,OAAS,EAChE,CAEA,IADA,IA9PYsb,EAAG3T,EAAGgV,EAAGtB,EAAGtE,EA8PpBqG,EAAM,IAAI1E,EAAGiO,EAAK,IACbhmB,EAAK,EAAGC,EAAKxB,KAAK2kB,EAAGpjB,EAAKC,EAAGZ,OAAQW,IAAM,CAChD,IAAI6B,EAAI5B,EAAGD,GACXkjB,GAAIzG,EAAKsJ,EAAIlkB,EAAGA,EAAEA,EAAGA,EAAEuhB,GAAIvhB,EAAEma,EAAI,EAAG5C,EAAGvX,EAAE8Y,GACzCoL,GAAM,GAAKlkB,EAAEA,EAAExC,OAAS2jB,GAAKnhB,EAAEyhB,QAAUzhB,EAAE8Y,EAAI9Y,EAAE8Y,EAAEtb,OAAS,GAAI+Z,GAAKvX,EAAEmF,CAC3E,CAnQY2T,EAoQR8B,EApQWzV,EAoQN+e,EApQS/J,EAoQLvd,KAAK2kB,EAAE/jB,OApQCqb,EAoQOsL,EApQJ5P,EAoQQgD,EAnQpCqI,GAAO9G,EAAG3T,EAAG,WACbya,GAAO9G,EAAG3T,EAAI,EAAGgV,GACjByF,GAAO9G,EAAG3T,EAAI,GAAIgV,GAClByF,GAAO9G,EAAG3T,EAAI,GAAI0T,GAClB+G,GAAO9G,EAAG3T,EAAI,GAAIoP,GAgQd3X,KAAKojB,OAAO,KAAMpF,GAAK,GACvBhe,KAAKic,EAAI,CACb,EAKAiK,EAAIxmB,UAAUunB,UAAY,WACtB,IAAK,IAAIP,EAAK,EAAGznB,EAAKe,KAAK2kB,EAAG+B,EAAKznB,EAAG2B,OAAQ8lB,IAAM,CACxCznB,EAAGynB,GACTrK,GACN,CACArc,KAAKic,EAAI,CACb,EACOiK,CACX,UC3oEasB,GACHrW,UAER,WAAAlQ,CAAYkQ,GACVnR,KAAKmR,UAAYA,CACnB,CAKA,uBAAMsW,SAEEznB,KAAKmR,UAAU7B,QAErB,MAAMgH,QAAiBtW,KAAKmR,UAAUiF,iBAChCsR,EAAqB,GAE3B,OAAO,IAAIvY,QAAc,CAACyC,EAASC,KACjC,MAAM8V,EAAM,IAAIC,GAEhBD,EAAIvE,OAAS,CAAC/T,EAAK4B,EAAMmN,KACnB/O,EACFwC,EAAOxC,IAGTqY,EAAOtnB,KAAK6Q,GACRmN,GACFxM,EAAQ,IAAIiW,KAAKH,EAAQ,CAAEjQ,KAAM,uBAIzBjI,WACV,MAAMsY,EAAU,IAAInE,YAEpB,IAAK,MAAM/M,KAAWN,EAAU,CAC9B,MAAMyR,EAAanR,EAAQxC,GAAG4T,WAAW,YACrCpR,EAAQxC,GACR,WAAWwC,EAAQxC,KAGjB6T,EAAc,IAAIC,GAAkB,GAAGH,kBAC7CJ,EAAI7R,IAAImS,GAER,MAAME,EAAcC,KAAKC,UAAUzR,GACnCqR,EAAY7nB,KAAK0nB,EAAQ3D,OAAOgE,IAAc,GAG9C,MAAMG,EAAW,IAAIJ,GAAkB,GAAGH,eAC1CJ,EAAI7R,IAAIwS,GAGRA,EAASloB,KAAK0nB,EAAQ3D,OAAO,MAE7B,IAAIoE,GAAQ,QAGNvoB,KAAKmR,UAAU8F,qBAAqBL,EAAQxC,GAAK3R,IACrD,MAAM+lB,GAAcD,EAAQ,GAAK,KAAOH,KAAKC,UAAU5lB,GACvD8lB,GAAQ,EACRD,EAASloB,KAAK0nB,EAAQ3D,OAAOqE,MAI/BF,EAASloB,KAAK0nB,EAAQ3D,OAAO,MAAM,EACrC,CAGAwD,EAAIN,OAGNoB,GAAMrZ,MAAMyC,IAEhB,EC/BF,MAAM6W,GAAqC,CACzC3Y,MAAO,EACPC,MAAO,EACPC,KAAM,EACNC,KAAM,EACNC,MAAO,EACPC,MAAO,GAGT,SAASuY,GAAaC,GACpB,QAAYtkB,IAARskB,EAAJ,CACA,GAA+B,oBAApBC,gBACT,IACE,OAAOA,gBAAgBD,EACzB,CAAE,MAEF,CAEF,OAAOR,KAAKU,MAAMV,KAAKC,UAAUO,GARa,CAShD,CAKA,SAASG,GAAaH,EAAUI,EAAeC,GAC7C,GAAmB,iBAARL,GAA4B,OAARA,EAC7B,OAAOA,EAET,GAAII,GAASC,EACX,IACE,OAAOb,KAAKC,UAAUO,EACxB,CAAE,MACA,MAAO,UACT,CAEF,GAAIlqB,MAAMC,QAAQiqB,GAChB,OAAOA,EAAIhqB,IAAKsqB,GAASH,GAAaG,EAAMF,EAAQ,EAAGC,IAEzD,MAAMlpB,EAAc,CAAA,EACpB,IAAK,MAAMuH,KAAO7H,OAAO0pB,KAAKP,GAC5B7oB,EAAOuH,GAAOyhB,GAAaH,EAAIthB,GAAM0hB,EAAQ,EAAGC,GAElD,OAAOlpB,CACT,OAMaqpB,GACHC,YACAC,WACA5Y,OACA6Y,OACAC,QC/FH,SAAgB9oB,GACnB,OAAO,IAAI+M,EAAY/M,EAC3B,CD6FoB+oB,GACVC,iBAAqD,KAM7D,WAAAzoB,CACEoP,EACAsZ,GAQA,GADA3pB,KAAKqpB,YAAchZ,EAAOgZ,aAAe,OACrCM,EACF3pB,KAAKspB,WAAaK,EAASL,WAC3BtpB,KAAK0Q,OAASiZ,EAASjZ,OACvB1Q,KAAKupB,OAASI,EAASJ,OACvBvpB,KAAK0pB,iBAAmBC,EAASD,kBAAoB,UAQrD,GANA1pB,KAAKspB,WAAa,IAAIxa,EACtB9O,KAAK0Q,OAAS,GACd1Q,KAAKupB,OAAS,IAAIjS,IACdjH,EAAOc,YACTnR,KAAK0pB,iBAAmBva,QAAQyC,QAAQvB,EAAOc,YAE7Cd,EAAOnM,MACT,IAAK,MAAM7C,KAAQgP,EAAOnM,MACxBlE,KAAKspB,WAAWva,QAAQ1N,EAIhC,CASA,aAAOooB,CAAOpZ,GACZ,MAAMnM,EAAoB,GAC1B,IAAIwlB,EAAqD,KAMzD,GAJqB,OAAjBrZ,EAAOuZ,OACT1lB,EAAM9D,KAAK,IAAIuP,EAAYU,EAAOuZ,QAGhCvZ,EAAOwZ,QAAS,CAClB,IAAKxZ,EAAO+B,WAAa/B,EAAOgC,cAC9B,MAAM,IAAIhT,MAAM,gEAGlBqqB,EAAmB,WACjB,MAAMI,EAAiB,IAAI7R,EAAe,CACxC7F,SAAU/B,EAAO+B,SACjBC,cAAehC,EAAOgC,cACtB6F,OAAQ7H,EAAO6H,SAGX5F,QAAkBwX,EAAezR,cACjC9F,EAAauX,EAAehR,gBAE5B3H,EAAY,IAAIgB,EAAiB,CACrCC,SAAU/B,EAAO+B,SACjBC,cAAehC,EAAOgC,cACtBC,YACAC,aACAN,oBAAqB5B,EAAO4B,oBAC5BC,gBAAiB7B,EAAO6B,kBAK1B,aAFMf,EAAU8B,aACV9B,EAAUkF,gBACTlF,CACR,EAtBkB,GAwBnBjN,EAAM9D,KAAK,IAAI8Q,EAAcwY,GAC/B,CAEA,MAAMJ,EAAa,IAAIxa,EACvB,IAAK,MAAMzN,KAAQ6C,EACjBolB,EAAWva,QAAQ1N,GAGrB,OAAO,IAAI+nB,GACT,CACEC,YAAahZ,EAAOgZ,aAEtB,CACEC,aACA5Y,OAAQ,GACR6Y,OAAQ,IAAIjS,IACZoS,oBAGN,CAQA,KAAAK,CAAMvqB,GACJ,OAAO,IAAI4pB,GACT,CAAEC,YAAarpB,KAAKqpB,aACpB,CACEC,WAAYtpB,KAAKspB,WACjB5Y,OAAQ,IAAI1Q,KAAK0Q,OAAQlR,GACzB+pB,OAAQvpB,KAAKupB,OACbG,iBAAkB1pB,KAAK0pB,kBAG7B,CAGA,KAAAM,CAAMhZ,EAAiBC,GACrBjR,KAAKyC,IAAI,QAASuO,EAASC,EAC7B,CAGA,KAAA5O,CAAM2O,EAAiBC,GACrBjR,KAAKyC,IAAI,QAASuO,EAASC,EAC7B,CAGA,IAAAgZ,CAAKjZ,EAAiBC,GACpBjR,KAAKyC,IAAI,OAAQuO,EAASC,EAC5B,CAGA,IAAAiZ,CAAKlZ,EAAiBC,GACpBjR,KAAKyC,IAAI,OAAQuO,EAASC,EAC5B,CAGA,KAAAnN,CAAMkN,EAAiBC,GACrBjR,KAAKyC,IAAI,QAASuO,EAASC,EAC7B,CAGA,KAAAkZ,CAAMnZ,EAAiBC,GACrBjR,KAAKyC,IAAI,QAASuO,EAASC,EAC7B,CAUA,UAAAmZ,CAAW5qB,EAAc6qB,EAAY3pB,GACnC,MAAMuoB,EAAWvoB,GAASuoB,UAAY,EAEtC,IAAKjpB,KAAKupB,OAAOne,IAAI5L,GAGnB,OAFAQ,KAAKupB,OAAOxR,IAAIvY,EAAMmpB,GAAU0B,SAChCrqB,KAAKyC,IAAI,QAAS,gBAAgBjD,cAAkB,CAAEsC,MAAOuoB,IAI/D,MAGMC,EAAavB,GAHD/oB,KAAKupB,OAAOxU,IAAIvV,GAGS,EAAGypB,GACxCsB,EAAcxB,GAAasB,EAAO,EAAGpB,GAErCnnB,EAAQ9B,KAAKwpB,QAAQzd,KAAKue,EAAYC,QAE9BjmB,IAAVxC,IACF9B,KAAKupB,OAAOxR,IAAIvY,EAAMmpB,GAAU0B,IAChCrqB,KAAKyC,IAAI,QAAS,gBAAgBjD,IAAQ,CAAEsC,UAEhD,CASA,kBAAA0oB,CAAmBhrB,EAAckB,GAC/B,OAAQ2pB,IACNrqB,KAAKoqB,WAAW5qB,EAAM6qB,EAAO3pB,GAEjC,CAOA,gBAAM+pB,GACJ,IAAKzqB,KAAK0pB,iBACR,MAAM,IAAIrqB,MAAM,6DAElB,MAAM8R,QAAkBnR,KAAK0pB,iBAE7B,OADiB,IAAIlC,GAAYrW,GACjBsW,mBAClB,CAOA,kBAAMiD,CAAa5E,GACjB,MAAM6E,QAAa3qB,KAAKyqB,aACxB,GAAwB,oBAAbG,SACT,MAAM,IAAIvrB,MAAM,6DAElB,MAAMG,EAAOsmB,GAAY,YAAYjnB,KAAKqV,aACpC2W,EAAMC,IAAIC,gBAAgBJ,GAC1BriB,EAAIsiB,SAASI,cAAc,KACjC1iB,EAAE2iB,KAAOJ,EACTviB,EAAE4iB,SAAW1rB,EACb8I,EAAE6iB,QACF9V,WAAW,IAAMyV,IAAIM,gBAAgBP,GAAM,IAC7C,CAKA,WAAMvb,SACEtP,KAAKspB,WAAWha,OACxB,CAKA,WAAMmF,GACJ,GAAIzU,KAAK0pB,iBAAkB,CACzB,MAAMvY,QAAkBnR,KAAK0pB,uBACvBvY,EAAUsD,OAClB,CACF,CAEQ,GAAAhS,CAAIoO,EAAiBG,EAAiBC,GAC5C,GAAIyX,GAAS7X,GAAS6X,GAAS1oB,KAAKqpB,aAClC,OAGF,MAAMpa,EAAsB,CAC1BsB,UAAW1R,KAAKqV,MAChBrD,QACAH,OAAQ,IAAI1Q,KAAK0Q,QACjBM,gBAGW1M,IAAT2M,IACFhC,EAAQgC,KAAOA,GAGjBjR,KAAKspB,WAAWta,SAASC,EAC3B","x_google_ignoreList":[0,1,2,3,4,5,6,7,8,9,10,11,12,13,14,25,28]}