nostr-components 0.2.0

package/dist/assets/nostr-service-pr_crY62.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"nostr-service-pr_crY62.js","sources":["../../node_modules/tseep/lib/types.js","../../node_modules/tseep/lib/task-collection/utils.js","../../node_modules/tseep/lib/task-collection/bake-collection.js","../../node_modules/tseep/lib/task-collection/task-collection.js","../../node_modules/tseep/lib/task-collection/index.js","../../node_modules/tseep/lib/utils.js","../../node_modules/tseep/lib/ee.js","../../node_modules/tseep/lib/index.js","../../node_modules/ms/index.js","../../node_modules/debug/src/common.js","../../node_modules/debug/src/browser.js","../../node_modules/nostr-tools/node_modules/@noble/curves/node_modules/@noble/hashes/esm/_assert.js","../../node_modules/nostr-tools/node_modules/@noble/curves/node_modules/@noble/hashes/esm/crypto.js","../../node_modules/nostr-tools/node_modules/@noble/curves/node_modules/@noble/hashes/esm/utils.js","../../node_modules/nostr-tools/node_modules/@noble/curves/node_modules/@noble/hashes/esm/_sha2.js","../../node_modules/nostr-tools/node_modules/@noble/curves/node_modules/@noble/hashes/esm/sha256.js","../../node_modules/nostr-tools/node_modules/@noble/curves/esm/abstract/utils.js","../../node_modules/nostr-tools/node_modules/@noble/curves/esm/abstract/modular.js","../../node_modules/nostr-tools/node_modules/@noble/curves/esm/abstract/curve.js","../../node_modules/nostr-tools/node_modules/@noble/curves/esm/abstract/weierstrass.js","../../node_modules/nostr-tools/node_modules/@noble/curves/node_modules/@noble/hashes/esm/hmac.js","../../node_modules/nostr-tools/node_modules/@noble/curves/esm/_shortw_utils.js","../../node_modules/nostr-tools/node_modules/@noble/curves/esm/secp256k1.js","../../node_modules/nostr-tools/node_modules/@noble/hashes/esm/crypto.js","../../node_modules/nostr-tools/node_modules/@noble/hashes/esm/utils.js","../../node_modules/nostr-tools/node_modules/@noble/hashes/esm/_assert.js","../../node_modules/nostr-tools/node_modules/@noble/hashes/esm/_sha2.js","../../node_modules/nostr-tools/node_modules/@noble/hashes/esm/sha256.js","../../node_modules/nostr-tools/node_modules/@scure/base/lib/esm/index.js","../../node_modules/@noble/ciphers/esm/_assert.js","../../node_modules/@noble/ciphers/esm/utils.js","../../node_modules/@noble/ciphers/esm/aes.js","../../node_modules/@noble/ciphers/esm/_arx.js","../../node_modules/@noble/ciphers/esm/chacha.js","../../node_modules/nostr-tools/node_modules/@noble/hashes/esm/hmac.js","../../node_modules/nostr-tools/node_modules/@noble/hashes/esm/hkdf.js","../../node_modules/nostr-tools/lib/esm/index.js","../../node_modules/@noble/hashes/esm/_assert.js","../../node_modules/@noble/hashes/esm/crypto.js","../../node_modules/@noble/hashes/esm/utils.js","../../node_modules/@noble/hashes/esm/_md.js","../../node_modules/@noble/hashes/esm/sha256.js","../../node_modules/@noble/hashes/esm/hmac.js","../../node_modules/@noble/curves/esm/abstract/utils.js","../../node_modules/@noble/curves/esm/abstract/modular.js","../../node_modules/@noble/curves/esm/abstract/curve.js","../../node_modules/@noble/curves/esm/abstract/weierstrass.js","../../node_modules/@noble/curves/esm/_shortw_utils.js","../../node_modules/@noble/curves/esm/secp256k1.js","../../node_modules/typescript-lru-cache/dist/LRUCacheNode.js","../../node_modules/typescript-lru-cache/dist/LRUCache.js","../../node_modules/typescript-lru-cache/dist/index.js","../../node_modules/light-bolt11-decoder/node_modules/@scure/base/lib/index.js","../../node_modules/light-bolt11-decoder/bolt11.js","../../node_modules/@nostr-dev-kit/ndk/dist/index.mjs","../../src/common/constants.ts","../../src/common/nostr-service.ts"],"sourcesContent":["\"use strict\";\nObject.defineProperty(exports, \"__esModule\", { value: true });\n//# sourceMappingURL=types.js.map","\"use strict\";\nObject.defineProperty(exports, \"__esModule\", { value: true });\nexports._fast_remove_single = void 0;\nfunction _fast_remove_single(arr, index) {\n    if (index === -1)\n        return;\n    if (index === 0)\n        arr.shift();\n    else if (index === arr.length - 1)\n        arr.length = arr.length - 1;\n    else\n        arr.splice(index, 1);\n}\nexports._fast_remove_single = _fast_remove_single;\n//# sourceMappingURL=utils.js.map","\"use strict\";\nObject.defineProperty(exports, \"__esModule\", { value: true });\nexports.bakeCollectionVariadic = exports.bakeCollectionAwait = exports.bakeCollection = exports.BAKED_EMPTY_FUNC = void 0;\nexports.BAKED_EMPTY_FUNC = (function () { });\nvar FORLOOP_FALLBACK = 1500;\nfunction generateArgsDefCode(numArgs) {\n    var argsDefCode = '';\n    if (numArgs === 0)\n        return argsDefCode;\n    for (var i = 0; i < numArgs - 1; ++i) {\n        argsDefCode += ('arg' + String(i) + ', ');\n    }\n    argsDefCode += ('arg' + String(numArgs - 1));\n    return argsDefCode;\n}\nfunction generateBodyPartsCode(argsDefCode, collectionLength) {\n    var funcDefCode = '', funcCallCode = '';\n    for (var i = 0; i < collectionLength; ++i) {\n        funcDefCode += \"var f\".concat(i, \" = collection[\").concat(i, \"];\\n\");\n        funcCallCode += \"f\".concat(i, \"(\").concat(argsDefCode, \")\\n\");\n    }\n    return { funcDefCode: funcDefCode, funcCallCode: funcCallCode };\n}\nfunction generateBodyPartsVariadicCode(collectionLength) {\n    var funcDefCode = '', funcCallCode = '';\n    for (var i = 0; i < collectionLength; ++i) {\n        funcDefCode += \"var f\".concat(i, \" = collection[\").concat(i, \"];\\n\");\n        funcCallCode += \"f\".concat(i, \".apply(undefined, arguments)\\n\");\n    }\n    return { funcDefCode: funcDefCode, funcCallCode: funcCallCode };\n}\nfunction bakeCollection(collection, fixedArgsNum) {\n    if (collection.length === 0)\n        return exports.BAKED_EMPTY_FUNC;\n    else if (collection.length === 1)\n        return collection[0];\n    var funcFactoryCode;\n    if (collection.length < FORLOOP_FALLBACK) {\n        var argsDefCode = generateArgsDefCode(fixedArgsNum);\n        var _a = generateBodyPartsCode(argsDefCode, collection.length), funcDefCode = _a.funcDefCode, funcCallCode = _a.funcCallCode;\n        funcFactoryCode = \"(function(collection) {\\n            \".concat(funcDefCode, \"\\n            collection = undefined;\\n            return (function(\").concat(argsDefCode, \") {\\n                \").concat(funcCallCode, \"\\n            });\\n        })\");\n    }\n    else {\n        var argsDefCode = generateArgsDefCode(fixedArgsNum);\n        // loop unroll\n        if (collection.length % 10 === 0) {\n            funcFactoryCode = \"(function(collection) {\\n                return (function(\".concat(argsDefCode, \") {\\n                    for (var i = 0; i < collection.length; i += 10) {\\n                        collection[i](\").concat(argsDefCode, \");\\n                        collection[i+1](\").concat(argsDefCode, \");\\n                        collection[i+2](\").concat(argsDefCode, \");\\n                        collection[i+3](\").concat(argsDefCode, \");\\n                        collection[i+4](\").concat(argsDefCode, \");\\n                        collection[i+5](\").concat(argsDefCode, \");\\n                        collection[i+6](\").concat(argsDefCode, \");\\n                        collection[i+7](\").concat(argsDefCode, \");\\n                        collection[i+8](\").concat(argsDefCode, \");\\n                        collection[i+9](\").concat(argsDefCode, \");\\n                    }\\n                });\\n            })\");\n        }\n        else if (collection.length % 4 === 0) {\n            funcFactoryCode = \"(function(collection) {\\n                return (function(\".concat(argsDefCode, \") {\\n                    for (var i = 0; i < collection.length; i += 4) {\\n                        collection[i](\").concat(argsDefCode, \");\\n                        collection[i+1](\").concat(argsDefCode, \");\\n                        collection[i+2](\").concat(argsDefCode, \");\\n                        collection[i+3](\").concat(argsDefCode, \");\\n                    }\\n                });\\n            })\");\n        }\n        else if (collection.length % 3 === 0) {\n            funcFactoryCode = \"(function(collection) {\\n                return (function(\".concat(argsDefCode, \") {\\n                    for (var i = 0; i < collection.length; i += 3) {\\n                        collection[i](\").concat(argsDefCode, \");\\n                        collection[i+1](\").concat(argsDefCode, \");\\n                        collection[i+2](\").concat(argsDefCode, \");\\n                    }\\n                });\\n            })\");\n        }\n        else {\n            funcFactoryCode = \"(function(collection) {\\n                return (function(\".concat(argsDefCode, \") {\\n                    for (var i = 0; i < collection.length; ++i) {\\n                        collection[i](\").concat(argsDefCode, \");\\n                    }\\n                });\\n            })\");\n        }\n    }\n    {\n        // isolate\n        var bakeCollection_1 = undefined;\n        var fixedArgsNum_1 = undefined;\n        var bakeCollectionVariadic_1 = undefined;\n        var bakeCollectionAwait_1 = undefined;\n        var funcFactory = eval(funcFactoryCode);\n        return funcFactory(collection);\n    }\n}\nexports.bakeCollection = bakeCollection;\nfunction bakeCollectionAwait(collection, fixedArgsNum) {\n    if (collection.length === 0)\n        return exports.BAKED_EMPTY_FUNC;\n    else if (collection.length === 1)\n        return collection[0];\n    var funcFactoryCode;\n    if (collection.length < FORLOOP_FALLBACK) {\n        var argsDefCode = generateArgsDefCode(fixedArgsNum);\n        var _a = generateBodyPartsCode(argsDefCode, collection.length), funcDefCode = _a.funcDefCode, funcCallCode = _a.funcCallCode;\n        funcFactoryCode = \"(function(collection) {\\n            \".concat(funcDefCode, \"\\n            collection = undefined;\\n            return (function(\").concat(argsDefCode, \") {\\n                return Promise.all([ \").concat(funcCallCode, \" ]);\\n            });\\n        })\");\n    }\n    else {\n        var argsDefCode = generateArgsDefCode(fixedArgsNum);\n        funcFactoryCode = \"(function(collection) {\\n            return (function(\".concat(argsDefCode, \") {\\n                var promises = Array(collection.length);\\n                for (var i = 0; i < collection.length; ++i) {\\n                    promises[i] = collection[i](\").concat(argsDefCode, \");\\n                }\\n                return Promise.all(promises);\\n            });\\n        })\");\n    }\n    {\n        // isolate\n        var bakeCollection_2 = undefined;\n        var fixedArgsNum_2 = undefined;\n        var bakeCollectionVariadic_2 = undefined;\n        var bakeCollectionAwait_2 = undefined;\n        var funcFactory = eval(funcFactoryCode);\n        return funcFactory(collection);\n    }\n}\nexports.bakeCollectionAwait = bakeCollectionAwait;\nfunction bakeCollectionVariadic(collection) {\n    if (collection.length === 0)\n        return exports.BAKED_EMPTY_FUNC;\n    else if (collection.length === 1)\n        return collection[0];\n    var funcFactoryCode;\n    if (collection.length < FORLOOP_FALLBACK) {\n        var _a = generateBodyPartsVariadicCode(collection.length), funcDefCode = _a.funcDefCode, funcCallCode = _a.funcCallCode;\n        funcFactoryCode = \"(function(collection) {\\n            \".concat(funcDefCode, \"\\n            collection = undefined;\\n            return (function() {\\n                \").concat(funcCallCode, \"\\n            });\\n        })\");\n    }\n    else {\n        funcFactoryCode = \"(function(collection) {\\n            return (function() {\\n                for (var i = 0; i < collection.length; ++i) {\\n                    collection[i].apply(undefined, arguments);\\n                }\\n            });\\n        })\";\n    }\n    {\n        // isolate\n        var bakeCollection_3 = undefined;\n        var fixedArgsNum = undefined;\n        var bakeCollectionVariadic_3 = undefined;\n        var bakeCollectionAwait_3 = undefined;\n        var funcFactory = eval(funcFactoryCode);\n        return funcFactory(collection);\n    }\n}\nexports.bakeCollectionVariadic = bakeCollectionVariadic;\n//# sourceMappingURL=bake-collection.js.map","\"use strict\";\nvar __spreadArray = (this && this.__spreadArray) || function (to, from, pack) {\n    if (pack || arguments.length === 2) for (var i = 0, l = from.length, ar; i < l; i++) {\n        if (ar || !(i in from)) {\n            if (!ar) ar = Array.prototype.slice.call(from, 0, i);\n            ar[i] = from[i];\n        }\n    }\n    return to.concat(ar || Array.prototype.slice.call(from));\n};\nObject.defineProperty(exports, \"__esModule\", { value: true });\nexports.TaskCollection = void 0;\nvar utils_1 = require(\"./utils\");\nvar bake_collection_1 = require(\"./bake-collection\");\nfunction push_norebuild(a, b /*, ...func: Func[] */) {\n    var len = this.length;\n    if (len > 1) { // tasks is array\n        if (b) { // if multiple args\n            var _a;\n            (_a = this._tasks).push.apply(_a, arguments);\n            this.length += arguments.length;\n        }\n        else { // if single arg (most often case)\n            this._tasks.push(a);\n            this.length++;\n        }\n    }\n    else { // tasks is (function or null)\n        if (b) { // if multiple args\n            if (len === 1) { // if this._tasks is function\n                var newAr = Array(1 + arguments.length);\n                newAr.push(newAr);\n                newAr.push.apply(newAr, arguments);\n                this._tasks = newAr;\n            }\n            else {\n                var newAr = Array(arguments.length);\n                newAr.push.apply(newAr, arguments);\n                this._tasks = newAr;\n            }\n            this.length += arguments.length;\n        }\n        else { // if single arg (most often case)\n            if (len === 1)\n                this._tasks = [this._tasks, a];\n            else\n                this._tasks = a;\n            this.length++;\n        }\n    }\n}\nfunction push_rebuild(a, b /*, ...func: Func[] */) {\n    var len = this.length;\n    if (len > 1) { // tasks is array\n        if (b) { // if multiple args\n            var _a;\n            (_a = this._tasks).push.apply(_a, arguments);\n            this.length += arguments.length;\n        }\n        else { // if single arg (most often case)\n            this._tasks.push(a);\n            this.length++;\n        }\n    }\n    else { // tasks is (function or null)\n        if (b) { // if multiple args\n            if (len === 1) { // if this._tasks is function\n                var newAr = Array(1 + arguments.length);\n                newAr.push(newAr);\n                newAr.push.apply(newAr, arguments);\n                this._tasks = newAr;\n            }\n            else {\n                var newAr = Array(arguments.length);\n                newAr.push.apply(newAr, arguments);\n                this._tasks = newAr;\n            }\n            this.length += arguments.length;\n        }\n        else { // if single arg (most often case)\n            if (len === 1)\n                this._tasks = [this._tasks, a];\n            else\n                this._tasks = a;\n            this.length++;\n        }\n    }\n    if (this.firstEmitBuildStrategy)\n        this.call = rebuild_on_first_call;\n    else\n        this.rebuild();\n}\nfunction removeLast_norebuild(a) {\n    if (this.length === 0)\n        return;\n    if (this.length === 1) {\n        if (this._tasks === a) {\n            this.length = 0;\n        }\n    }\n    else {\n        (0, utils_1._fast_remove_single)(this._tasks, this._tasks.lastIndexOf(a));\n        if (this._tasks.length === 1) {\n            this._tasks = this._tasks[0];\n            this.length = 1;\n        }\n        else\n            this.length = this._tasks.length;\n    }\n}\nfunction removeLast_rebuild(a) {\n    if (this.length === 0)\n        return;\n    if (this.length === 1) {\n        if (this._tasks === a) {\n            this.length = 0;\n        }\n        if (this.firstEmitBuildStrategy) {\n            this.call = bake_collection_1.BAKED_EMPTY_FUNC;\n            return;\n        }\n        else {\n            this.rebuild();\n            return;\n        }\n    }\n    else {\n        (0, utils_1._fast_remove_single)(this._tasks, this._tasks.lastIndexOf(a));\n        if (this._tasks.length === 1) {\n            this._tasks = this._tasks[0];\n            this.length = 1;\n        }\n        else\n            this.length = this._tasks.length;\n    }\n    if (this.firstEmitBuildStrategy)\n        this.call = rebuild_on_first_call;\n    else\n        this.rebuild();\n}\nfunction insert_norebuild(index) {\n    var _b;\n    var func = [];\n    for (var _i = 1; _i < arguments.length; _i++) {\n        func[_i - 1] = arguments[_i];\n    }\n    if (this.length === 0) {\n        this._tasks = func;\n        this.length = 1;\n    }\n    else if (this.length === 1) {\n        func.unshift(this._tasks);\n        this._tasks = func;\n        this.length = this._tasks.length;\n    }\n    else {\n        (_b = this._tasks).splice.apply(_b, __spreadArray([index, 0], func, false));\n        this.length = this._tasks.length;\n    }\n}\nfunction insert_rebuild(index) {\n    var _b;\n    var func = [];\n    for (var _i = 1; _i < arguments.length; _i++) {\n        func[_i - 1] = arguments[_i];\n    }\n    if (this.length === 0) {\n        this._tasks = func;\n        this.length = 1;\n    }\n    else if (this.length === 1) {\n        func.unshift(this._tasks);\n        this._tasks = func;\n        this.length = this._tasks.length;\n    }\n    else {\n        (_b = this._tasks).splice.apply(_b, __spreadArray([index, 0], func, false));\n        this.length = this._tasks.length;\n    }\n    if (this.firstEmitBuildStrategy)\n        this.call = rebuild_on_first_call;\n    else\n        this.rebuild();\n}\nfunction rebuild_noawait() {\n    if (this.length === 0)\n        this.call = bake_collection_1.BAKED_EMPTY_FUNC;\n    else if (this.length === 1)\n        this.call = this._tasks;\n    else\n        this.call = (0, bake_collection_1.bakeCollection)(this._tasks, this.argsNum);\n}\nfunction rebuild_await() {\n    if (this.length === 0)\n        this.call = bake_collection_1.BAKED_EMPTY_FUNC;\n    else if (this.length === 1)\n        this.call = this._tasks;\n    else\n        this.call = (0, bake_collection_1.bakeCollectionAwait)(this._tasks, this.argsNum);\n}\nfunction rebuild_on_first_call() {\n    this.rebuild();\n    this.call.apply(undefined, arguments);\n}\nvar TaskCollection = /** @class */ (function () {\n    function TaskCollection(argsNum, autoRebuild, initialTasks, awaitTasks) {\n        if (autoRebuild === void 0) { autoRebuild = true; }\n        if (initialTasks === void 0) { initialTasks = null; }\n        if (awaitTasks === void 0) { awaitTasks = false; }\n        this.awaitTasks = awaitTasks;\n        this.call = bake_collection_1.BAKED_EMPTY_FUNC;\n        this.argsNum = argsNum;\n        this.firstEmitBuildStrategy = true;\n        if (awaitTasks)\n            this.rebuild = rebuild_await.bind(this);\n        else\n            this.rebuild = rebuild_noawait.bind(this);\n        this.setAutoRebuild(autoRebuild);\n        if (initialTasks) {\n            if (typeof initialTasks === 'function') {\n                this._tasks = initialTasks;\n                this.length = 1;\n            }\n            else {\n                this._tasks = initialTasks;\n                this.length = initialTasks.length;\n            }\n        }\n        else {\n            this._tasks = null;\n            this.length = 0;\n        }\n        if (autoRebuild)\n            this.rebuild();\n    }\n    return TaskCollection;\n}());\nexports.TaskCollection = TaskCollection;\nfunction fastClear() {\n    this._tasks = null;\n    this.length = 0;\n    this.call = bake_collection_1.BAKED_EMPTY_FUNC;\n}\nfunction clear() {\n    this._tasks = null;\n    this.length = 0;\n    this.call = bake_collection_1.BAKED_EMPTY_FUNC;\n}\nfunction growArgsNum(argsNum) {\n    if (this.argsNum < argsNum) {\n        this.argsNum = argsNum;\n        if (this.firstEmitBuildStrategy)\n            this.call = rebuild_on_first_call;\n        else\n            this.rebuild();\n    }\n}\nfunction setAutoRebuild(newVal) {\n    if (newVal) {\n        this.push = push_rebuild.bind(this);\n        this.insert = insert_rebuild.bind(this);\n        this.removeLast = removeLast_rebuild.bind(this);\n    }\n    else {\n        this.push = push_norebuild.bind(this);\n        this.insert = insert_norebuild.bind(this);\n        this.removeLast = removeLast_norebuild.bind(this);\n    }\n}\n;\nfunction tasksAsArray() {\n    if (this.length === 0)\n        return [];\n    if (this.length === 1)\n        return [this._tasks];\n    return this._tasks;\n}\nfunction setTasks(tasks) {\n    if (tasks.length === 0) {\n        this.length = 0;\n        this.call = bake_collection_1.BAKED_EMPTY_FUNC;\n    }\n    else if (tasks.length === 1) {\n        this.length = 1;\n        this.call = tasks[0];\n        this._tasks = tasks[0];\n    }\n    else {\n        this.length = tasks.length;\n        this._tasks = tasks;\n        if (this.firstEmitBuildStrategy)\n            this.call = rebuild_on_first_call;\n        else\n            this.rebuild();\n    }\n}\nTaskCollection.prototype.fastClear = fastClear;\nTaskCollection.prototype.clear = clear;\nTaskCollection.prototype.growArgsNum = growArgsNum;\nTaskCollection.prototype.setAutoRebuild = setAutoRebuild;\nTaskCollection.prototype.tasksAsArray = tasksAsArray;\nTaskCollection.prototype.setTasks = setTasks;\n//# sourceMappingURL=task-collection.js.map","\"use strict\";\nvar __createBinding = (this && this.__createBinding) || (Object.create ? (function(o, m, k, k2) {\n    if (k2 === undefined) k2 = k;\n    var desc = Object.getOwnPropertyDescriptor(m, k);\n    if (!desc || (\"get\" in desc ? !m.__esModule : desc.writable || desc.configurable)) {\n      desc = { enumerable: true, get: function() { return m[k]; } };\n    }\n    Object.defineProperty(o, k2, desc);\n}) : (function(o, m, k, k2) {\n    if (k2 === undefined) k2 = k;\n    o[k2] = m[k];\n}));\nvar __exportStar = (this && this.__exportStar) || function(m, exports) {\n    for (var p in m) if (p !== \"default\" && !Object.prototype.hasOwnProperty.call(exports, p)) __createBinding(exports, m, p);\n};\nObject.defineProperty(exports, \"__esModule\", { value: true });\n__exportStar(require(\"./task-collection\"), exports);\n//# sourceMappingURL=index.js.map","\"use strict\";\nObject.defineProperty(exports, \"__esModule\", { value: true });\nexports.nullObj = void 0;\nfunction nullObj() {\n    var x = {};\n    x.__proto__ = null;\n    return x;\n}\nexports.nullObj = nullObj;\n//# sourceMappingURL=utils.js.map","\"use strict\";\nvar __spreadArray = (this && this.__spreadArray) || function (to, from, pack) {\n    if (pack || arguments.length === 2) for (var i = 0, l = from.length, ar; i < l; i++) {\n        if (ar || !(i in from)) {\n            if (!ar) ar = Array.prototype.slice.call(from, 0, i);\n            ar[i] = from[i];\n        }\n    }\n    return to.concat(ar || Array.prototype.slice.call(from));\n};\nObject.defineProperty(exports, \"__esModule\", { value: true });\nexports.EventEmitter = void 0;\nvar task_collection_1 = require(\"./task-collection\");\nvar utils_1 = require(\"./task-collection/utils\");\nvar utils_2 = require(\"./utils\");\nfunction emit(event, a, b, c, d, e) {\n    var ev = this.events[event];\n    if (ev) {\n        if (ev.length === 0)\n            return false;\n        if (ev.argsNum < 6) {\n            ev.call(a, b, c, d, e);\n        }\n        else {\n            var arr = new Array(ev.argsNum);\n            for (var i = 0, len = arr.length; i < len; ++i) {\n                arr[i] = arguments[i + 1];\n            }\n            ev.call.apply(undefined, arr);\n        }\n        return true;\n    }\n    return false;\n}\nfunction emitHasOnce(event, a, b, c, d, e) {\n    var ev = this.events[event];\n    var argsArr;\n    if (ev !== undefined) {\n        if (ev.length === 0)\n            return false;\n        if (ev.argsNum < 6) {\n            ev.call(a, b, c, d, e);\n        }\n        else {\n            argsArr = new Array(ev.argsNum);\n            for (var i = 0, len = argsArr.length; i < len; ++i) {\n                argsArr[i] = arguments[i + 1];\n            }\n            ev.call.apply(undefined, argsArr);\n        }\n    }\n    var oev = this.onceEvents[event];\n    if (oev) {\n        if (typeof oev === 'function') {\n            this.onceEvents[event] = undefined;\n            if (arguments.length < 6) {\n                oev(a, b, c, d, e);\n            }\n            else {\n                if (argsArr === undefined) {\n                    argsArr = new Array(arguments.length - 1);\n                    for (var i = 0, len = argsArr.length; i < len; ++i) {\n                        argsArr[i] = arguments[i + 1];\n                    }\n                }\n                oev.apply(undefined, argsArr);\n            }\n        }\n        else {\n            var fncs = oev;\n            this.onceEvents[event] = undefined;\n            if (arguments.length < 6) {\n                for (var i = 0; i < fncs.length; ++i) {\n                    fncs[i](a, b, c, d, e);\n                }\n            }\n            else {\n                if (argsArr === undefined) {\n                    argsArr = new Array(arguments.length - 1);\n                    for (var i = 0, len = argsArr.length; i < len; ++i) {\n                        argsArr[i] = arguments[i + 1];\n                    }\n                }\n                for (var i = 0; i < fncs.length; ++i) {\n                    fncs[i].apply(undefined, argsArr);\n                }\n            }\n        }\n        return true;\n    }\n    return ev !== undefined;\n}\n/** Implemented event emitter */\nvar EventEmitter = /** @class */ (function () {\n    function EventEmitter() {\n        this.events = (0, utils_2.nullObj)();\n        this.onceEvents = (0, utils_2.nullObj)();\n        this._symbolKeys = new Set;\n        this.maxListeners = Infinity;\n    }\n    Object.defineProperty(EventEmitter.prototype, \"_eventsCount\", {\n        get: function () {\n            return this.eventNames().length;\n        },\n        enumerable: false,\n        configurable: true\n    });\n    return EventEmitter;\n}());\nexports.EventEmitter = EventEmitter;\nfunction once(event, listener) {\n    if (this.emit === emit) {\n        this.emit = emitHasOnce;\n    }\n    switch (typeof this.onceEvents[event]) {\n        case 'undefined':\n            this.onceEvents[event] = listener;\n            if (typeof event === 'symbol')\n                this._symbolKeys.add(event);\n            break;\n        case 'function':\n            this.onceEvents[event] = [this.onceEvents[event], listener];\n            break;\n        case 'object':\n            this.onceEvents[event].push(listener);\n    }\n    return this;\n}\nfunction addListener(event, listener, argsNum) {\n    if (argsNum === void 0) { argsNum = listener.length; }\n    if (typeof listener !== 'function')\n        throw new TypeError('The listener must be a function');\n    var evtmap = this.events[event];\n    if (!evtmap) {\n        this.events[event] = new task_collection_1.TaskCollection(argsNum, true, listener, false);\n        if (typeof event === 'symbol')\n            this._symbolKeys.add(event);\n    }\n    else {\n        evtmap.push(listener);\n        evtmap.growArgsNum(argsNum);\n        if (this.maxListeners !== Infinity && this.maxListeners <= evtmap.length)\n            console.warn(\"Maximum event listeners for \\\"\".concat(String(event), \"\\\" event!\"));\n    }\n    return this;\n}\nfunction removeListener(event, listener) {\n    var evt = this.events[event];\n    if (evt) {\n        evt.removeLast(listener);\n    }\n    var evto = this.onceEvents[event];\n    if (evto) {\n        if (typeof evto === 'function') {\n            this.onceEvents[event] = undefined;\n        }\n        else if (typeof evto === 'object') {\n            if (evto.length === 1 && evto[0] === listener) {\n                this.onceEvents[event] = undefined;\n            }\n            else {\n                (0, utils_1._fast_remove_single)(evto, evto.lastIndexOf(listener));\n            }\n        }\n    }\n    return this;\n}\nfunction addListenerBound(event, listener, bindTo, argsNum) {\n    if (bindTo === void 0) { bindTo = this; }\n    if (argsNum === void 0) { argsNum = listener.length; }\n    if (!this.boundFuncs)\n        this.boundFuncs = new Map;\n    var bound = listener.bind(bindTo);\n    this.boundFuncs.set(listener, bound);\n    return this.addListener(event, bound, argsNum);\n}\nfunction removeListenerBound(event, listener) {\n    var _a, _b;\n    var bound = (_a = this.boundFuncs) === null || _a === void 0 ? void 0 : _a.get(listener);\n    (_b = this.boundFuncs) === null || _b === void 0 ? void 0 : _b.delete(listener);\n    return this.removeListener(event, bound);\n}\nfunction hasListeners(event) {\n    return this.events[event] && !!this.events[event].length;\n}\nfunction prependListener(event, listener, argsNum) {\n    if (argsNum === void 0) { argsNum = listener.length; }\n    if (typeof listener !== 'function')\n        throw new TypeError('The listener must be a function');\n    var evtmap = this.events[event];\n    if (!evtmap || !(evtmap instanceof task_collection_1.TaskCollection)) {\n        evtmap = this.events[event] = new task_collection_1.TaskCollection(argsNum, true, listener, false);\n        if (typeof event === 'symbol')\n            this._symbolKeys.add(event);\n    }\n    else {\n        evtmap.insert(0, listener);\n        evtmap.growArgsNum(argsNum);\n        if (this.maxListeners !== Infinity && this.maxListeners <= evtmap.length)\n            console.warn(\"Maximum event listeners for \\\"\".concat(String(event), \"\\\" event!\"));\n    }\n    return this;\n}\nfunction prependOnceListener(event, listener) {\n    if (this.emit === emit) {\n        this.emit = emitHasOnce;\n    }\n    var evtmap = this.onceEvents[event];\n    if (!evtmap) {\n        this.onceEvents[event] = [listener];\n        if (typeof event === 'symbol')\n            this._symbolKeys.add(event);\n    }\n    else if (typeof evtmap !== 'object') {\n        this.onceEvents[event] = [listener, evtmap];\n        if (typeof event === 'symbol')\n            this._symbolKeys.add(event);\n    }\n    else {\n        evtmap.unshift(listener);\n        if (this.maxListeners !== Infinity && this.maxListeners <= evtmap.length) {\n            console.warn(\"Maximum event listeners for \\\"\".concat(String(event), \"\\\" once event!\"));\n        }\n    }\n    return this;\n}\nfunction removeAllListeners(event) {\n    if (event === undefined) {\n        this.events = (0, utils_2.nullObj)();\n        this.onceEvents = (0, utils_2.nullObj)();\n        this._symbolKeys = new Set;\n    }\n    else {\n        this.events[event] = undefined;\n        this.onceEvents[event] = undefined;\n        if (typeof event === 'symbol')\n            this._symbolKeys.delete(event);\n    }\n    return this;\n}\nfunction setMaxListeners(n) {\n    this.maxListeners = n;\n    return this;\n}\nfunction getMaxListeners() {\n    return this.maxListeners;\n}\nfunction listeners(event) {\n    if (this.emit === emit)\n        return this.events[event] ? this.events[event].tasksAsArray().slice() : [];\n    else {\n        if (this.events[event] && this.onceEvents[event]) {\n            return __spreadArray(__spreadArray([], this.events[event].tasksAsArray(), true), (typeof this.onceEvents[event] === 'function' ? [this.onceEvents[event]] : this.onceEvents[event]), true);\n        }\n        else if (this.events[event])\n            return this.events[event].tasksAsArray();\n        else if (this.onceEvents[event])\n            return (typeof this.onceEvents[event] === 'function' ? [this.onceEvents[event]] : this.onceEvents[event]);\n        else\n            return [];\n    }\n}\nfunction eventNames() {\n    var _this = this;\n    if (this.emit === emit) {\n        var keys = Object.keys(this.events);\n        return __spreadArray(__spreadArray([], keys, true), Array.from(this._symbolKeys), true).filter(function (x) { return (x in _this.events) && _this.events[x] && _this.events[x].length; });\n    }\n    else {\n        var keys = Object.keys(this.events).filter(function (x) { return _this.events[x] && _this.events[x].length; });\n        var keysO = Object.keys(this.onceEvents).filter(function (x) { return _this.onceEvents[x] && _this.onceEvents[x].length; });\n        return __spreadArray(__spreadArray(__spreadArray([], keys, true), keysO, true), Array.from(this._symbolKeys).filter(function (x) { return (((x in _this.events) && _this.events[x] && _this.events[x].length) ||\n            ((x in _this.onceEvents) && _this.onceEvents[x] && _this.onceEvents[x].length)); }), true);\n    }\n}\nfunction listenerCount(type) {\n    if (this.emit === emit)\n        return this.events[type] && this.events[type].length || 0;\n    else\n        return (this.events[type] && this.events[type].length || 0) + (this.onceEvents[type] && this.onceEvents[type].length || 0);\n}\nEventEmitter.prototype.emit = emit;\nEventEmitter.prototype.on = addListener;\nEventEmitter.prototype.once = once;\nEventEmitter.prototype.addListener = addListener;\nEventEmitter.prototype.removeListener = removeListener;\nEventEmitter.prototype.addListenerBound = addListenerBound;\nEventEmitter.prototype.removeListenerBound = removeListenerBound;\nEventEmitter.prototype.hasListeners = hasListeners;\nEventEmitter.prototype.prependListener = prependListener;\nEventEmitter.prototype.prependOnceListener = prependOnceListener;\nEventEmitter.prototype.off = removeListener;\nEventEmitter.prototype.removeAllListeners = removeAllListeners;\nEventEmitter.prototype.setMaxListeners = setMaxListeners;\nEventEmitter.prototype.getMaxListeners = getMaxListeners;\nEventEmitter.prototype.listeners = listeners;\nEventEmitter.prototype.eventNames = eventNames;\nEventEmitter.prototype.listenerCount = listenerCount;\n//# sourceMappingURL=ee.js.map","\"use strict\";\nvar __createBinding = (this && this.__createBinding) || (Object.create ? (function(o, m, k, k2) {\n    if (k2 === undefined) k2 = k;\n    var desc = Object.getOwnPropertyDescriptor(m, k);\n    if (!desc || (\"get\" in desc ? !m.__esModule : desc.writable || desc.configurable)) {\n      desc = { enumerable: true, get: function() { return m[k]; } };\n    }\n    Object.defineProperty(o, k2, desc);\n}) : (function(o, m, k, k2) {\n    if (k2 === undefined) k2 = k;\n    o[k2] = m[k];\n}));\nvar __exportStar = (this && this.__exportStar) || function(m, exports) {\n    for (var p in m) if (p !== \"default\" && !Object.prototype.hasOwnProperty.call(exports, p)) __createBinding(exports, m, p);\n};\nObject.defineProperty(exports, \"__esModule\", { value: true });\n__exportStar(require(\"./types\"), exports);\n__exportStar(require(\"./ee\"), exports);\n//# sourceMappingURL=index.js.map","/**\n * Helpers.\n */\n\nvar s = 1000;\nvar m = s * 60;\nvar h = m * 60;\nvar d = h * 24;\nvar w = d * 7;\nvar y = d * 365.25;\n\n/**\n * Parse or format the given `val`.\n *\n * Options:\n *\n *  - `long` verbose formatting [false]\n *\n * @param {String|Number} val\n * @param {Object} [options]\n * @throws {Error} throw an error if val is not a non-empty string or a number\n * @return {String|Number}\n * @api public\n */\n\nmodule.exports = function (val, options) {\n  options = options || {};\n  var type = typeof val;\n  if (type === 'string' && val.length > 0) {\n    return parse(val);\n  } else if (type === 'number' && isFinite(val)) {\n    return options.long ? fmtLong(val) : fmtShort(val);\n  }\n  throw new Error(\n    'val is not a non-empty string or a valid number. val=' +\n      JSON.stringify(val)\n  );\n};\n\n/**\n * Parse the given `str` and return milliseconds.\n *\n * @param {String} str\n * @return {Number}\n * @api private\n */\n\nfunction parse(str) {\n  str = String(str);\n  if (str.length > 100) {\n    return;\n  }\n  var match = /^(-?(?:\\d+)?\\.?\\d+) *(milliseconds?|msecs?|ms|seconds?|secs?|s|minutes?|mins?|m|hours?|hrs?|h|days?|d|weeks?|w|years?|yrs?|y)?$/i.exec(\n    str\n  );\n  if (!match) {\n    return;\n  }\n  var n = parseFloat(match[1]);\n  var type = (match[2] || 'ms').toLowerCase();\n  switch (type) {\n    case 'years':\n    case 'year':\n    case 'yrs':\n    case 'yr':\n    case 'y':\n      return n * y;\n    case 'weeks':\n    case 'week':\n    case 'w':\n      return n * w;\n    case 'days':\n    case 'day':\n    case 'd':\n      return n * d;\n    case 'hours':\n    case 'hour':\n    case 'hrs':\n    case 'hr':\n    case 'h':\n      return n * h;\n    case 'minutes':\n    case 'minute':\n    case 'mins':\n    case 'min':\n    case 'm':\n      return n * m;\n    case 'seconds':\n    case 'second':\n    case 'secs':\n    case 'sec':\n    case 's':\n      return n * s;\n    case 'milliseconds':\n    case 'millisecond':\n    case 'msecs':\n    case 'msec':\n    case 'ms':\n      return n;\n    default:\n      return undefined;\n  }\n}\n\n/**\n * Short format for `ms`.\n *\n * @param {Number} ms\n * @return {String}\n * @api private\n */\n\nfunction fmtShort(ms) {\n  var msAbs = Math.abs(ms);\n  if (msAbs >= d) {\n    return Math.round(ms / d) + 'd';\n  }\n  if (msAbs >= h) {\n    return Math.round(ms / h) + 'h';\n  }\n  if (msAbs >= m) {\n    return Math.round(ms / m) + 'm';\n  }\n  if (msAbs >= s) {\n    return Math.round(ms / s) + 's';\n  }\n  return ms + 'ms';\n}\n\n/**\n * Long format for `ms`.\n *\n * @param {Number} ms\n * @return {String}\n * @api private\n */\n\nfunction fmtLong(ms) {\n  var msAbs = Math.abs(ms);\n  if (msAbs >= d) {\n    return plural(ms, msAbs, d, 'day');\n  }\n  if (msAbs >= h) {\n    return plural(ms, msAbs, h, 'hour');\n  }\n  if (msAbs >= m) {\n    return plural(ms, msAbs, m, 'minute');\n  }\n  if (msAbs >= s) {\n    return plural(ms, msAbs, s, 'second');\n  }\n  return ms + ' ms';\n}\n\n/**\n * Pluralization helper.\n */\n\nfunction plural(ms, msAbs, n, name) {\n  var isPlural = msAbs >= n * 1.5;\n  return Math.round(ms / n) + ' ' + name + (isPlural ? 's' : '');\n}\n","\n/**\n * This is the common logic for both the Node.js and web browser\n * implementations of `debug()`.\n */\n\nfunction setup(env) {\n\tcreateDebug.debug = createDebug;\n\tcreateDebug.default = createDebug;\n\tcreateDebug.coerce = coerce;\n\tcreateDebug.disable = disable;\n\tcreateDebug.enable = enable;\n\tcreateDebug.enabled = enabled;\n\tcreateDebug.humanize = require('ms');\n\tcreateDebug.destroy = destroy;\n\n\tObject.keys(env).forEach(key => {\n\t\tcreateDebug[key] = env[key];\n\t});\n\n\t/**\n\t* The currently active debug mode names, and names to skip.\n\t*/\n\n\tcreateDebug.names = [];\n\tcreateDebug.skips = [];\n\n\t/**\n\t* Map of special \"%n\" handling functions, for the debug \"format\" argument.\n\t*\n\t* Valid key names are a single, lower or upper-case letter, i.e. \"n\" and \"N\".\n\t*/\n\tcreateDebug.formatters = {};\n\n\t/**\n\t* Selects a color for a debug namespace\n\t* @param {String} namespace The namespace string for the debug instance to be colored\n\t* @return {Number|String} An ANSI color code for the given namespace\n\t* @api private\n\t*/\n\tfunction selectColor(namespace) {\n\t\tlet hash = 0;\n\n\t\tfor (let i = 0; i < namespace.length; i++) {\n\t\t\thash = ((hash << 5) - hash) + namespace.charCodeAt(i);\n\t\t\thash |= 0; // Convert to 32bit integer\n\t\t}\n\n\t\treturn createDebug.colors[Math.abs(hash) % createDebug.colors.length];\n\t}\n\tcreateDebug.selectColor = selectColor;\n\n\t/**\n\t* Create a debugger with the given `namespace`.\n\t*\n\t* @param {String} namespace\n\t* @return {Function}\n\t* @api public\n\t*/\n\tfunction createDebug(namespace) {\n\t\tlet prevTime;\n\t\tlet enableOverride = null;\n\t\tlet namespacesCache;\n\t\tlet enabledCache;\n\n\t\tfunction debug(...args) {\n\t\t\t// Disabled?\n\t\t\tif (!debug.enabled) {\n\t\t\t\treturn;\n\t\t\t}\n\n\t\t\tconst self = debug;\n\n\t\t\t// Set `diff` timestamp\n\t\t\tconst curr = Number(new Date());\n\t\t\tconst ms = curr - (prevTime || curr);\n\t\t\tself.diff = ms;\n\t\t\tself.prev = prevTime;\n\t\t\tself.curr = curr;\n\t\t\tprevTime = curr;\n\n\t\t\targs[0] = createDebug.coerce(args[0]);\n\n\t\t\tif (typeof args[0] !== 'string') {\n\t\t\t\t// Anything else let's inspect with %O\n\t\t\t\targs.unshift('%O');\n\t\t\t}\n\n\t\t\t// Apply any `formatters` transformations\n\t\t\tlet index = 0;\n\t\t\targs[0] = args[0].replace(/%([a-zA-Z%])/g, (match, format) => {\n\t\t\t\t// If we encounter an escaped % then don't increase the array index\n\t\t\t\tif (match === '%%') {\n\t\t\t\t\treturn '%';\n\t\t\t\t}\n\t\t\t\tindex++;\n\t\t\t\tconst formatter = createDebug.formatters[format];\n\t\t\t\tif (typeof formatter === 'function') {\n\t\t\t\t\tconst val = args[index];\n\t\t\t\t\tmatch = formatter.call(self, val);\n\n\t\t\t\t\t// Now we need to remove `args[index]` since it's inlined in the `format`\n\t\t\t\t\targs.splice(index, 1);\n\t\t\t\t\tindex--;\n\t\t\t\t}\n\t\t\t\treturn match;\n\t\t\t});\n\n\t\t\t// Apply env-specific formatting (colors, etc.)\n\t\t\tcreateDebug.formatArgs.call(self, args);\n\n\t\t\tconst logFn = self.log || createDebug.log;\n\t\t\tlogFn.apply(self, args);\n\t\t}\n\n\t\tdebug.namespace = namespace;\n\t\tdebug.useColors = createDebug.useColors();\n\t\tdebug.color = createDebug.selectColor(namespace);\n\t\tdebug.extend = extend;\n\t\tdebug.destroy = createDebug.destroy; // XXX Temporary. Will be removed in the next major release.\n\n\t\tObject.defineProperty(debug, 'enabled', {\n\t\t\tenumerable: true,\n\t\t\tconfigurable: false,\n\t\t\tget: () => {\n\t\t\t\tif (enableOverride !== null) {\n\t\t\t\t\treturn enableOverride;\n\t\t\t\t}\n\t\t\t\tif (namespacesCache !== createDebug.namespaces) {\n\t\t\t\t\tnamespacesCache = createDebug.namespaces;\n\t\t\t\t\tenabledCache = createDebug.enabled(namespace);\n\t\t\t\t}\n\n\t\t\t\treturn enabledCache;\n\t\t\t},\n\t\t\tset: v => {\n\t\t\t\tenableOverride = v;\n\t\t\t}\n\t\t});\n\n\t\t// Env-specific initialization logic for debug instances\n\t\tif (typeof createDebug.init === 'function') {\n\t\t\tcreateDebug.init(debug);\n\t\t}\n\n\t\treturn debug;\n\t}\n\n\tfunction extend(namespace, delimiter) {\n\t\tconst newDebug = createDebug(this.namespace + (typeof delimiter === 'undefined' ? ':' : delimiter) + namespace);\n\t\tnewDebug.log = this.log;\n\t\treturn newDebug;\n\t}\n\n\t/**\n\t* Enables a debug mode by namespaces. This can include modes\n\t* separated by a colon and wildcards.\n\t*\n\t* @param {String} namespaces\n\t* @api public\n\t*/\n\tfunction enable(namespaces) {\n\t\tcreateDebug.save(namespaces);\n\t\tcreateDebug.namespaces = namespaces;\n\n\t\tcreateDebug.names = [];\n\t\tcreateDebug.skips = [];\n\n\t\tconst split = (typeof namespaces === 'string' ? namespaces : '')\n\t\t\t.trim()\n\t\t\t.replace(' ', ',')\n\t\t\t.split(',')\n\t\t\t.filter(Boolean);\n\n\t\tfor (const ns of split) {\n\t\t\tif (ns[0] === '-') {\n\t\t\t\tcreateDebug.skips.push(ns.slice(1));\n\t\t\t} else {\n\t\t\t\tcreateDebug.names.push(ns);\n\t\t\t}\n\t\t}\n\t}\n\n\t/**\n\t * Checks if the given string matches a namespace template, honoring\n\t * asterisks as wildcards.\n\t *\n\t * @param {String} search\n\t * @param {String} template\n\t * @return {Boolean}\n\t */\n\tfunction matchesTemplate(search, template) {\n\t\tlet searchIndex = 0;\n\t\tlet templateIndex = 0;\n\t\tlet starIndex = -1;\n\t\tlet matchIndex = 0;\n\n\t\twhile (searchIndex < search.length) {\n\t\t\tif (templateIndex < template.length && (template[templateIndex] === search[searchIndex] || template[templateIndex] === '*')) {\n\t\t\t\t// Match character or proceed with wildcard\n\t\t\t\tif (template[templateIndex] === '*') {\n\t\t\t\t\tstarIndex = templateIndex;\n\t\t\t\t\tmatchIndex = searchIndex;\n\t\t\t\t\ttemplateIndex++; // Skip the '*'\n\t\t\t\t} else {\n\t\t\t\t\tsearchIndex++;\n\t\t\t\t\ttemplateIndex++;\n\t\t\t\t}\n\t\t\t} else if (starIndex !== -1) { // eslint-disable-line no-negated-condition\n\t\t\t\t// Backtrack to the last '*' and try to match more characters\n\t\t\t\ttemplateIndex = starIndex + 1;\n\t\t\t\tmatchIndex++;\n\t\t\t\tsearchIndex = matchIndex;\n\t\t\t} else {\n\t\t\t\treturn false; // No match\n\t\t\t}\n\t\t}\n\n\t\t// Handle trailing '*' in template\n\t\twhile (templateIndex < template.length && template[templateIndex] === '*') {\n\t\t\ttemplateIndex++;\n\t\t}\n\n\t\treturn templateIndex === template.length;\n\t}\n\n\t/**\n\t* Disable debug output.\n\t*\n\t* @return {String} namespaces\n\t* @api public\n\t*/\n\tfunction disable() {\n\t\tconst namespaces = [\n\t\t\t...createDebug.names,\n\t\t\t...createDebug.skips.map(namespace => '-' + namespace)\n\t\t].join(',');\n\t\tcreateDebug.enable('');\n\t\treturn namespaces;\n\t}\n\n\t/**\n\t* Returns true if the given mode name is enabled, false otherwise.\n\t*\n\t* @param {String} name\n\t* @return {Boolean}\n\t* @api public\n\t*/\n\tfunction enabled(name) {\n\t\tfor (const skip of createDebug.skips) {\n\t\t\tif (matchesTemplate(name, skip)) {\n\t\t\t\treturn false;\n\t\t\t}\n\t\t}\n\n\t\tfor (const ns of createDebug.names) {\n\t\t\tif (matchesTemplate(name, ns)) {\n\t\t\t\treturn true;\n\t\t\t}\n\t\t}\n\n\t\treturn false;\n\t}\n\n\t/**\n\t* Coerce `val`.\n\t*\n\t* @param {Mixed} val\n\t* @return {Mixed}\n\t* @api private\n\t*/\n\tfunction coerce(val) {\n\t\tif (val instanceof Error) {\n\t\t\treturn val.stack || val.message;\n\t\t}\n\t\treturn val;\n\t}\n\n\t/**\n\t* XXX DO NOT USE. This is a temporary stub function.\n\t* XXX It WILL be removed in the next major release.\n\t*/\n\tfunction destroy() {\n\t\tconsole.warn('Instance method `debug.destroy()` is deprecated and no longer does anything. It will be removed in the next major version of `debug`.');\n\t}\n\n\tcreateDebug.enable(createDebug.load());\n\n\treturn createDebug;\n}\n\nmodule.exports = setup;\n","/* eslint-env browser */\n\n/**\n * This is the web browser implementation of `debug()`.\n */\n\nexports.formatArgs = formatArgs;\nexports.save = save;\nexports.load = load;\nexports.useColors = useColors;\nexports.storage = localstorage();\nexports.destroy = (() => {\n\tlet warned = false;\n\n\treturn () => {\n\t\tif (!warned) {\n\t\t\twarned = true;\n\t\t\tconsole.warn('Instance method `debug.destroy()` is deprecated and no longer does anything. It will be removed in the next major version of `debug`.');\n\t\t}\n\t};\n})();\n\n/**\n * Colors.\n */\n\nexports.colors = [\n\t'#0000CC',\n\t'#0000FF',\n\t'#0033CC',\n\t'#0033FF',\n\t'#0066CC',\n\t'#0066FF',\n\t'#0099CC',\n\t'#0099FF',\n\t'#00CC00',\n\t'#00CC33',\n\t'#00CC66',\n\t'#00CC99',\n\t'#00CCCC',\n\t'#00CCFF',\n\t'#3300CC',\n\t'#3300FF',\n\t'#3333CC',\n\t'#3333FF',\n\t'#3366CC',\n\t'#3366FF',\n\t'#3399CC',\n\t'#3399FF',\n\t'#33CC00',\n\t'#33CC33',\n\t'#33CC66',\n\t'#33CC99',\n\t'#33CCCC',\n\t'#33CCFF',\n\t'#6600CC',\n\t'#6600FF',\n\t'#6633CC',\n\t'#6633FF',\n\t'#66CC00',\n\t'#66CC33',\n\t'#9900CC',\n\t'#9900FF',\n\t'#9933CC',\n\t'#9933FF',\n\t'#99CC00',\n\t'#99CC33',\n\t'#CC0000',\n\t'#CC0033',\n\t'#CC0066',\n\t'#CC0099',\n\t'#CC00CC',\n\t'#CC00FF',\n\t'#CC3300',\n\t'#CC3333',\n\t'#CC3366',\n\t'#CC3399',\n\t'#CC33CC',\n\t'#CC33FF',\n\t'#CC6600',\n\t'#CC6633',\n\t'#CC9900',\n\t'#CC9933',\n\t'#CCCC00',\n\t'#CCCC33',\n\t'#FF0000',\n\t'#FF0033',\n\t'#FF0066',\n\t'#FF0099',\n\t'#FF00CC',\n\t'#FF00FF',\n\t'#FF3300',\n\t'#FF3333',\n\t'#FF3366',\n\t'#FF3399',\n\t'#FF33CC',\n\t'#FF33FF',\n\t'#FF6600',\n\t'#FF6633',\n\t'#FF9900',\n\t'#FF9933',\n\t'#FFCC00',\n\t'#FFCC33'\n];\n\n/**\n * Currently only WebKit-based Web Inspectors, Firefox >= v31,\n * and the Firebug extension (any Firefox version) are known\n * to support \"%c\" CSS customizations.\n *\n * TODO: add a `localStorage` variable to explicitly enable/disable colors\n */\n\n// eslint-disable-next-line complexity\nfunction useColors() {\n\t// NB: In an Electron preload script, document will be defined but not fully\n\t// initialized. Since we know we're in Chrome, we'll just detect this case\n\t// explicitly\n\tif (typeof window !== 'undefined' && window.process && (window.process.type === 'renderer' || window.process.__nwjs)) {\n\t\treturn true;\n\t}\n\n\t// Internet Explorer and Edge do not support colors.\n\tif (typeof navigator !== 'undefined' && navigator.userAgent && navigator.userAgent.toLowerCase().match(/(edge|trident)\\/(\\d+)/)) {\n\t\treturn false;\n\t}\n\n\tlet m;\n\n\t// Is webkit? http://stackoverflow.com/a/16459606/376773\n\t// document is undefined in react-native: https://github.com/facebook/react-native/pull/1632\n\t// eslint-disable-next-line no-return-assign\n\treturn (typeof document !== 'undefined' && document.documentElement && document.documentElement.style && document.documentElement.style.WebkitAppearance) ||\n\t\t// Is firebug? http://stackoverflow.com/a/398120/376773\n\t\t(typeof window !== 'undefined' && window.console && (window.console.firebug || (window.console.exception && window.console.table))) ||\n\t\t// Is firefox >= v31?\n\t\t// https://developer.mozilla.org/en-US/docs/Tools/Web_Console#Styling_messages\n\t\t(typeof navigator !== 'undefined' && navigator.userAgent && (m = navigator.userAgent.toLowerCase().match(/firefox\\/(\\d+)/)) && parseInt(m[1], 10) >= 31) ||\n\t\t// Double check webkit in userAgent just in case we are in a worker\n\t\t(typeof navigator !== 'undefined' && navigator.userAgent && navigator.userAgent.toLowerCase().match(/applewebkit\\/(\\d+)/));\n}\n\n/**\n * Colorize log arguments if enabled.\n *\n * @api public\n */\n\nfunction formatArgs(args) {\n\targs[0] = (this.useColors ? '%c' : '') +\n\t\tthis.namespace +\n\t\t(this.useColors ? ' %c' : ' ') +\n\t\targs[0] +\n\t\t(this.useColors ? '%c ' : ' ') +\n\t\t'+' + module.exports.humanize(this.diff);\n\n\tif (!this.useColors) {\n\t\treturn;\n\t}\n\n\tconst c = 'color: ' + this.color;\n\targs.splice(1, 0, c, 'color: inherit');\n\n\t// The final \"%c\" is somewhat tricky, because there could be other\n\t// arguments passed either before or after the %c, so we need to\n\t// figure out the correct index to insert the CSS into\n\tlet index = 0;\n\tlet lastC = 0;\n\targs[0].replace(/%[a-zA-Z%]/g, match => {\n\t\tif (match === '%%') {\n\t\t\treturn;\n\t\t}\n\t\tindex++;\n\t\tif (match === '%c') {\n\t\t\t// We only are interested in the *last* %c\n\t\t\t// (the user may have provided their own)\n\t\t\tlastC = index;\n\t\t}\n\t});\n\n\targs.splice(lastC, 0, c);\n}\n\n/**\n * Invokes `console.debug()` when available.\n * No-op when `console.debug` is not a \"function\".\n * If `console.debug` is not available, falls back\n * to `console.log`.\n *\n * @api public\n */\nexports.log = console.debug || console.log || (() => {});\n\n/**\n * Save `namespaces`.\n *\n * @param {String} namespaces\n * @api private\n */\nfunction save(namespaces) {\n\ttry {\n\t\tif (namespaces) {\n\t\t\texports.storage.setItem('debug', namespaces);\n\t\t} else {\n\t\t\texports.storage.removeItem('debug');\n\t\t}\n\t} catch (error) {\n\t\t// Swallow\n\t\t// XXX (@Qix-) should we be logging these?\n\t}\n}\n\n/**\n * Load `namespaces`.\n *\n * @return {String} returns the previously persisted debug modes\n * @api private\n */\nfunction load() {\n\tlet r;\n\ttry {\n\t\tr = exports.storage.getItem('debug');\n\t} catch (error) {\n\t\t// Swallow\n\t\t// XXX (@Qix-) should we be logging these?\n\t}\n\n\t// If debug isn't set in LS, and we're in Electron, try to load $DEBUG\n\tif (!r && typeof process !== 'undefined' && 'env' in process) {\n\t\tr = process.env.DEBUG;\n\t}\n\n\treturn r;\n}\n\n/**\n * Localstorage attempts to return the localstorage.\n *\n * This is necessary because safari throws\n * when a user disables cookies/localstorage\n * and you attempt to access it.\n *\n * @return {LocalStorage}\n * @api private\n */\n\nfunction localstorage() {\n\ttry {\n\t\t// TVMLKit (Apple TV JS Runtime) does not have a window object, just localStorage in the global context\n\t\t// The Browser also has localStorage in the global context.\n\t\treturn localStorage;\n\t} catch (error) {\n\t\t// Swallow\n\t\t// XXX (@Qix-) should we be logging these?\n\t}\n}\n\nmodule.exports = require('./common')(exports);\n\nconst {formatters} = module.exports;\n\n/**\n * Map %j to `JSON.stringify()`, since no Web Inspectors do that by default.\n */\n\nformatters.j = function (v) {\n\ttry {\n\t\treturn JSON.stringify(v);\n\t} catch (error) {\n\t\treturn '[UnexpectedJSONParseError]: ' + error.message;\n\t}\n};\n","function number(n) {\n    if (!Number.isSafeInteger(n) || n < 0)\n        throw new Error(`Wrong positive integer: ${n}`);\n}\nfunction bool(b) {\n    if (typeof b !== 'boolean')\n        throw new Error(`Expected boolean, not ${b}`);\n}\nfunction bytes(b, ...lengths) {\n    if (!(b instanceof Uint8Array))\n        throw new Error('Expected Uint8Array');\n    if (lengths.length > 0 && !lengths.includes(b.length))\n        throw new Error(`Expected Uint8Array of length ${lengths}, not of length=${b.length}`);\n}\nfunction hash(hash) {\n    if (typeof hash !== 'function' || typeof hash.create !== 'function')\n        throw new Error('Hash should be wrapped by utils.wrapConstructor');\n    number(hash.outputLen);\n    number(hash.blockLen);\n}\nfunction exists(instance, checkFinished = true) {\n    if (instance.destroyed)\n        throw new Error('Hash instance has been destroyed');\n    if (checkFinished && instance.finished)\n        throw new Error('Hash#digest() has already been called');\n}\nfunction output(out, instance) {\n    bytes(out);\n    const min = instance.outputLen;\n    if (out.length < min) {\n        throw new Error(`digestInto() expects output buffer of length at least ${min}`);\n    }\n}\nexport { number, bool, bytes, hash, exists, output };\nconst assert = { number, bool, bytes, hash, exists, output };\nexport default assert;\n//# sourceMappingURL=_assert.js.map","export const crypto = typeof globalThis === 'object' && 'crypto' in globalThis ? globalThis.crypto : undefined;\n//# sourceMappingURL=crypto.js.map","/*! noble-hashes - MIT License (c) 2022 Paul Miller (paulmillr.com) */\n// We use WebCrypto aka globalThis.crypto, which exists in browsers and node.js 16+.\n// node.js versions earlier than v19 don't declare it in global scope.\n// For node.js, package.json#exports field mapping rewrites import\n// from `crypto` to `cryptoNode`, which imports native module.\n// Makes the utils un-importable in browsers without a bundler.\n// Once node.js 18 is deprecated, we can just drop the import.\nimport { crypto } from '@noble/hashes/crypto';\nconst u8a = (a) => a instanceof Uint8Array;\n// Cast array to different type\nexport const u8 = (arr) => new Uint8Array(arr.buffer, arr.byteOffset, arr.byteLength);\nexport const u32 = (arr) => new Uint32Array(arr.buffer, arr.byteOffset, Math.floor(arr.byteLength / 4));\n// Cast array to view\nexport const createView = (arr) => new DataView(arr.buffer, arr.byteOffset, arr.byteLength);\n// The rotate right (circular right shift) operation for uint32\nexport const rotr = (word, shift) => (word << (32 - shift)) | (word >>> shift);\n// big-endian hardware is rare. Just in case someone still decides to run hashes:\n// early-throw an error because we don't support BE yet.\nexport const isLE = new Uint8Array(new Uint32Array([0x11223344]).buffer)[0] === 0x44;\nif (!isLE)\n    throw new Error('Non little-endian hardware is not supported');\nconst hexes = /* @__PURE__ */ Array.from({ length: 256 }, (_, i) => i.toString(16).padStart(2, '0'));\n/**\n * @example bytesToHex(Uint8Array.from([0xca, 0xfe, 0x01, 0x23])) // 'cafe0123'\n */\nexport function bytesToHex(bytes) {\n    if (!u8a(bytes))\n        throw new Error('Uint8Array expected');\n    // pre-caching improves the speed 6x\n    let hex = '';\n    for (let i = 0; i < bytes.length; i++) {\n        hex += hexes[bytes[i]];\n    }\n    return hex;\n}\n/**\n * @example hexToBytes('cafe0123') // Uint8Array.from([0xca, 0xfe, 0x01, 0x23])\n */\nexport function hexToBytes(hex) {\n    if (typeof hex !== 'string')\n        throw new Error('hex string expected, got ' + typeof hex);\n    const len = hex.length;\n    if (len % 2)\n        throw new Error('padded hex string expected, got unpadded hex of length ' + len);\n    const array = new Uint8Array(len / 2);\n    for (let i = 0; i < array.length; i++) {\n        const j = i * 2;\n        const hexByte = hex.slice(j, j + 2);\n        const byte = Number.parseInt(hexByte, 16);\n        if (Number.isNaN(byte) || byte < 0)\n            throw new Error('Invalid byte sequence');\n        array[i] = byte;\n    }\n    return array;\n}\n// There is no setImmediate in browser and setTimeout is slow.\n// call of async fn will return Promise, which will be fullfiled only on\n// next scheduler queue processing step and this is exactly what we need.\nexport const nextTick = async () => { };\n// Returns control to thread each 'tick' ms to avoid blocking\nexport async function asyncLoop(iters, tick, cb) {\n    let ts = Date.now();\n    for (let i = 0; i < iters; i++) {\n        cb(i);\n        // Date.now() is not monotonic, so in case if clock goes backwards we return return control too\n        const diff = Date.now() - ts;\n        if (diff >= 0 && diff < tick)\n            continue;\n        await nextTick();\n        ts += diff;\n    }\n}\n/**\n * @example utf8ToBytes('abc') // new Uint8Array([97, 98, 99])\n */\nexport function utf8ToBytes(str) {\n    if (typeof str !== 'string')\n        throw new Error(`utf8ToBytes expected string, got ${typeof str}`);\n    return new Uint8Array(new TextEncoder().encode(str)); // https://bugzil.la/1681809\n}\n/**\n * Normalizes (non-hex) string or Uint8Array to Uint8Array.\n * Warning: when Uint8Array is passed, it would NOT get copied.\n * Keep in mind for future mutable operations.\n */\nexport function toBytes(data) {\n    if (typeof data === 'string')\n        data = utf8ToBytes(data);\n    if (!u8a(data))\n        throw new Error(`expected Uint8Array, got ${typeof data}`);\n    return data;\n}\n/**\n * Copies several Uint8Arrays into one.\n */\nexport function concatBytes(...arrays) {\n    const r = new Uint8Array(arrays.reduce((sum, a) => sum + a.length, 0));\n    let pad = 0; // walk through each item, ensure they have proper type\n    arrays.forEach((a) => {\n        if (!u8a(a))\n            throw new Error('Uint8Array expected');\n        r.set(a, pad);\n        pad += a.length;\n    });\n    return r;\n}\n// For runtime check if class implements interface\nexport class Hash {\n    // Safe version that clones internal state\n    clone() {\n        return this._cloneInto();\n    }\n}\nconst toStr = {}.toString;\nexport function checkOpts(defaults, opts) {\n    if (opts !== undefined && toStr.call(opts) !== '[object Object]')\n        throw new Error('Options should be object or undefined');\n    const merged = Object.assign(defaults, opts);\n    return merged;\n}\nexport function wrapConstructor(hashCons) {\n    const hashC = (msg) => hashCons().update(toBytes(msg)).digest();\n    const tmp = hashCons();\n    hashC.outputLen = tmp.outputLen;\n    hashC.blockLen = tmp.blockLen;\n    hashC.create = () => hashCons();\n    return hashC;\n}\nexport function wrapConstructorWithOpts(hashCons) {\n    const hashC = (msg, opts) => hashCons(opts).update(toBytes(msg)).digest();\n    const tmp = hashCons({});\n    hashC.outputLen = tmp.outputLen;\n    hashC.blockLen = tmp.blockLen;\n    hashC.create = (opts) => hashCons(opts);\n    return hashC;\n}\nexport function wrapXOFConstructorWithOpts(hashCons) {\n    const hashC = (msg, opts) => hashCons(opts).update(toBytes(msg)).digest();\n    const tmp = hashCons({});\n    hashC.outputLen = tmp.outputLen;\n    hashC.blockLen = tmp.blockLen;\n    hashC.create = (opts) => hashCons(opts);\n    return hashC;\n}\n/**\n * Secure PRNG. Uses `crypto.getRandomValues`, which defers to OS.\n */\nexport function randomBytes(bytesLength = 32) {\n    if (crypto && typeof crypto.getRandomValues === 'function') {\n        return crypto.getRandomValues(new Uint8Array(bytesLength));\n    }\n    throw new Error('crypto.getRandomValues must be defined');\n}\n//# sourceMappingURL=utils.js.map","import { exists, output } from './_assert.js';\nimport { Hash, createView, toBytes } from './utils.js';\n// Polyfill for Safari 14\nfunction setBigUint64(view, byteOffset, value, isLE) {\n    if (typeof view.setBigUint64 === 'function')\n        return view.setBigUint64(byteOffset, value, isLE);\n    const _32n = BigInt(32);\n    const _u32_max = BigInt(0xffffffff);\n    const wh = Number((value >> _32n) & _u32_max);\n    const wl = Number(value & _u32_max);\n    const h = isLE ? 4 : 0;\n    const l = isLE ? 0 : 4;\n    view.setUint32(byteOffset + h, wh, isLE);\n    view.setUint32(byteOffset + l, wl, isLE);\n}\n// Base SHA2 class (RFC 6234)\nexport class SHA2 extends Hash {\n    constructor(blockLen, outputLen, padOffset, isLE) {\n        super();\n        this.blockLen = blockLen;\n        this.outputLen = outputLen;\n        this.padOffset = padOffset;\n        this.isLE = isLE;\n        this.finished = false;\n        this.length = 0;\n        this.pos = 0;\n        this.destroyed = false;\n        this.buffer = new Uint8Array(blockLen);\n        this.view = createView(this.buffer);\n    }\n    update(data) {\n        exists(this);\n        const { view, buffer, blockLen } = this;\n        data = toBytes(data);\n        const len = data.length;\n        for (let pos = 0; pos < len;) {\n            const take = Math.min(blockLen - this.pos, len - pos);\n            // Fast path: we have at least one block in input, cast it to view and process\n            if (take === blockLen) {\n                const dataView = createView(data);\n                for (; blockLen <= len - pos; pos += blockLen)\n                    this.process(dataView, pos);\n                continue;\n            }\n            buffer.set(data.subarray(pos, pos + take), this.pos);\n            this.pos += take;\n            pos += take;\n            if (this.pos === blockLen) {\n                this.process(view, 0);\n                this.pos = 0;\n            }\n        }\n        this.length += data.length;\n        this.roundClean();\n        return this;\n    }\n    digestInto(out) {\n        exists(this);\n        output(out, this);\n        this.finished = true;\n        // Padding\n        // We can avoid allocation of buffer for padding completely if it\n        // was previously not allocated here. But it won't change performance.\n        const { buffer, view, blockLen, isLE } = this;\n        let { pos } = this;\n        // append the bit '1' to the message\n        buffer[pos++] = 0b10000000;\n        this.buffer.subarray(pos).fill(0);\n        // we have less than padOffset left in buffer, so we cannot put length in current block, need process it and pad again\n        if (this.padOffset > blockLen - pos) {\n            this.process(view, 0);\n            pos = 0;\n        }\n        // Pad until full block byte with zeros\n        for (let i = pos; i < blockLen; i++)\n            buffer[i] = 0;\n        // Note: sha512 requires length to be 128bit integer, but length in JS will overflow before that\n        // You need to write around 2 exabytes (u64_max / 8 / (1024**6)) for this to happen.\n        // So we just write lowest 64 bits of that value.\n        setBigUint64(view, blockLen - 8, BigInt(this.length * 8), isLE);\n        this.process(view, 0);\n        const oview = createView(out);\n        const len = this.outputLen;\n        // NOTE: we do division by 4 later, which should be fused in single op with modulo by JIT\n        if (len % 4)\n            throw new Error('_sha2: outputLen should be aligned to 32bit');\n        const outLen = len / 4;\n        const state = this.get();\n        if (outLen > state.length)\n            throw new Error('_sha2: outputLen bigger than state');\n        for (let i = 0; i < outLen; i++)\n            oview.setUint32(4 * i, state[i], isLE);\n    }\n    digest() {\n        const { buffer, outputLen } = this;\n        this.digestInto(buffer);\n        const res = buffer.slice(0, outputLen);\n        this.destroy();\n        return res;\n    }\n    _cloneInto(to) {\n        to || (to = new this.constructor());\n        to.set(...this.get());\n        const { blockLen, buffer, length, finished, destroyed, pos } = this;\n        to.length = length;\n        to.pos = pos;\n        to.finished = finished;\n        to.destroyed = destroyed;\n        if (length % blockLen)\n            to.buffer.set(buffer);\n        return to;\n    }\n}\n//# sourceMappingURL=_sha2.js.map","import { SHA2 } from './_sha2.js';\nimport { rotr, wrapConstructor } from './utils.js';\n// SHA2-256 need to try 2^128 hashes to execute birthday attack.\n// BTC network is doing 2^67 hashes/sec as per early 2023.\n// Choice: a ? b : c\nconst Chi = (a, b, c) => (a & b) ^ (~a & c);\n// Majority function, true if any two inpust is true\nconst Maj = (a, b, c) => (a & b) ^ (a & c) ^ (b & c);\n// Round constants:\n// first 32 bits of the fractional parts of the cube roots of the first 64 primes 2..311)\n// prettier-ignore\nconst SHA256_K = /* @__PURE__ */ new Uint32Array([\n    0x428a2f98, 0x71374491, 0xb5c0fbcf, 0xe9b5dba5, 0x3956c25b, 0x59f111f1, 0x923f82a4, 0xab1c5ed5,\n    0xd807aa98, 0x12835b01, 0x243185be, 0x550c7dc3, 0x72be5d74, 0x80deb1fe, 0x9bdc06a7, 0xc19bf174,\n    0xe49b69c1, 0xefbe4786, 0x0fc19dc6, 0x240ca1cc, 0x2de92c6f, 0x4a7484aa, 0x5cb0a9dc, 0x76f988da,\n    0x983e5152, 0xa831c66d, 0xb00327c8, 0xbf597fc7, 0xc6e00bf3, 0xd5a79147, 0x06ca6351, 0x14292967,\n    0x27b70a85, 0x2e1b2138, 0x4d2c6dfc, 0x53380d13, 0x650a7354, 0x766a0abb, 0x81c2c92e, 0x92722c85,\n    0xa2bfe8a1, 0xa81a664b, 0xc24b8b70, 0xc76c51a3, 0xd192e819, 0xd6990624, 0xf40e3585, 0x106aa070,\n    0x19a4c116, 0x1e376c08, 0x2748774c, 0x34b0bcb5, 0x391c0cb3, 0x4ed8aa4a, 0x5b9cca4f, 0x682e6ff3,\n    0x748f82ee, 0x78a5636f, 0x84c87814, 0x8cc70208, 0x90befffa, 0xa4506ceb, 0xbef9a3f7, 0xc67178f2\n]);\n// Initial state (first 32 bits of the fractional parts of the square roots of the first 8 primes 2..19):\n// prettier-ignore\nconst IV = /* @__PURE__ */ new Uint32Array([\n    0x6a09e667, 0xbb67ae85, 0x3c6ef372, 0xa54ff53a, 0x510e527f, 0x9b05688c, 0x1f83d9ab, 0x5be0cd19\n]);\n// Temporary buffer, not used to store anything between runs\n// Named this way because it matches specification.\nconst SHA256_W = /* @__PURE__ */ new Uint32Array(64);\nclass SHA256 extends SHA2 {\n    constructor() {\n        super(64, 32, 8, false);\n        // We cannot use array here since array allows indexing by variable\n        // which means optimizer/compiler cannot use registers.\n        this.A = IV[0] | 0;\n        this.B = IV[1] | 0;\n        this.C = IV[2] | 0;\n        this.D = IV[3] | 0;\n        this.E = IV[4] | 0;\n        this.F = IV[5] | 0;\n        this.G = IV[6] | 0;\n        this.H = IV[7] | 0;\n    }\n    get() {\n        const { A, B, C, D, E, F, G, H } = this;\n        return [A, B, C, D, E, F, G, H];\n    }\n    // prettier-ignore\n    set(A, B, C, D, E, F, G, H) {\n        this.A = A | 0;\n        this.B = B | 0;\n        this.C = C | 0;\n        this.D = D | 0;\n        this.E = E | 0;\n        this.F = F | 0;\n        this.G = G | 0;\n        this.H = H | 0;\n    }\n    process(view, offset) {\n        // Extend the first 16 words into the remaining 48 words w[16..63] of the message schedule array\n        for (let i = 0; i < 16; i++, offset += 4)\n            SHA256_W[i] = view.getUint32(offset, false);\n        for (let i = 16; i < 64; i++) {\n            const W15 = SHA256_W[i - 15];\n            const W2 = SHA256_W[i - 2];\n            const s0 = rotr(W15, 7) ^ rotr(W15, 18) ^ (W15 >>> 3);\n            const s1 = rotr(W2, 17) ^ rotr(W2, 19) ^ (W2 >>> 10);\n            SHA256_W[i] = (s1 + SHA256_W[i - 7] + s0 + SHA256_W[i - 16]) | 0;\n        }\n        // Compression function main loop, 64 rounds\n        let { A, B, C, D, E, F, G, H } = this;\n        for (let i = 0; i < 64; i++) {\n            const sigma1 = rotr(E, 6) ^ rotr(E, 11) ^ rotr(E, 25);\n            const T1 = (H + sigma1 + Chi(E, F, G) + SHA256_K[i] + SHA256_W[i]) | 0;\n            const sigma0 = rotr(A, 2) ^ rotr(A, 13) ^ rotr(A, 22);\n            const T2 = (sigma0 + Maj(A, B, C)) | 0;\n            H = G;\n            G = F;\n            F = E;\n            E = (D + T1) | 0;\n            D = C;\n            C = B;\n            B = A;\n            A = (T1 + T2) | 0;\n        }\n        // Add the compressed chunk to the current hash value\n        A = (A + this.A) | 0;\n        B = (B + this.B) | 0;\n        C = (C + this.C) | 0;\n        D = (D + this.D) | 0;\n        E = (E + this.E) | 0;\n        F = (F + this.F) | 0;\n        G = (G + this.G) | 0;\n        H = (H + this.H) | 0;\n        this.set(A, B, C, D, E, F, G, H);\n    }\n    roundClean() {\n        SHA256_W.fill(0);\n    }\n    destroy() {\n        this.set(0, 0, 0, 0, 0, 0, 0, 0);\n        this.buffer.fill(0);\n    }\n}\n// Constants from https://nvlpubs.nist.gov/nistpubs/FIPS/NIST.FIPS.180-4.pdf\nclass SHA224 extends SHA256 {\n    constructor() {\n        super();\n        this.A = 0xc1059ed8 | 0;\n        this.B = 0x367cd507 | 0;\n        this.C = 0x3070dd17 | 0;\n        this.D = 0xf70e5939 | 0;\n        this.E = 0xffc00b31 | 0;\n        this.F = 0x68581511 | 0;\n        this.G = 0x64f98fa7 | 0;\n        this.H = 0xbefa4fa4 | 0;\n        this.outputLen = 28;\n    }\n}\n/**\n * SHA2-256 hash function\n * @param message - data that would be hashed\n */\nexport const sha256 = /* @__PURE__ */ wrapConstructor(() => new SHA256());\nexport const sha224 = /* @__PURE__ */ wrapConstructor(() => new SHA224());\n//# sourceMappingURL=sha256.js.map","/*! noble-curves - MIT License (c) 2022 Paul Miller (paulmillr.com) */\n// 100 lines of code in the file are duplicated from noble-hashes (utils).\n// This is OK: `abstract` directory does not use noble-hashes.\n// User may opt-in into using different hashing library. This way, noble-hashes\n// won't be included into their bundle.\nconst _0n = BigInt(0);\nconst _1n = BigInt(1);\nconst _2n = BigInt(2);\nconst u8a = (a) => a instanceof Uint8Array;\nconst hexes = /* @__PURE__ */ Array.from({ length: 256 }, (_, i) => i.toString(16).padStart(2, '0'));\n/**\n * @example bytesToHex(Uint8Array.from([0xca, 0xfe, 0x01, 0x23])) // 'cafe0123'\n */\nexport function bytesToHex(bytes) {\n    if (!u8a(bytes))\n        throw new Error('Uint8Array expected');\n    // pre-caching improves the speed 6x\n    let hex = '';\n    for (let i = 0; i < bytes.length; i++) {\n        hex += hexes[bytes[i]];\n    }\n    return hex;\n}\nexport function numberToHexUnpadded(num) {\n    const hex = num.toString(16);\n    return hex.length & 1 ? `0${hex}` : hex;\n}\nexport function hexToNumber(hex) {\n    if (typeof hex !== 'string')\n        throw new Error('hex string expected, got ' + typeof hex);\n    // Big Endian\n    return BigInt(hex === '' ? '0' : `0x${hex}`);\n}\n/**\n * @example hexToBytes('cafe0123') // Uint8Array.from([0xca, 0xfe, 0x01, 0x23])\n */\nexport function hexToBytes(hex) {\n    if (typeof hex !== 'string')\n        throw new Error('hex string expected, got ' + typeof hex);\n    const len = hex.length;\n    if (len % 2)\n        throw new Error('padded hex string expected, got unpadded hex of length ' + len);\n    const array = new Uint8Array(len / 2);\n    for (let i = 0; i < array.length; i++) {\n        const j = i * 2;\n        const hexByte = hex.slice(j, j + 2);\n        const byte = Number.parseInt(hexByte, 16);\n        if (Number.isNaN(byte) || byte < 0)\n            throw new Error('Invalid byte sequence');\n        array[i] = byte;\n    }\n    return array;\n}\n// BE: Big Endian, LE: Little Endian\nexport function bytesToNumberBE(bytes) {\n    return hexToNumber(bytesToHex(bytes));\n}\nexport function bytesToNumberLE(bytes) {\n    if (!u8a(bytes))\n        throw new Error('Uint8Array expected');\n    return hexToNumber(bytesToHex(Uint8Array.from(bytes).reverse()));\n}\nexport function numberToBytesBE(n, len) {\n    return hexToBytes(n.toString(16).padStart(len * 2, '0'));\n}\nexport function numberToBytesLE(n, len) {\n    return numberToBytesBE(n, len).reverse();\n}\n// Unpadded, rarely used\nexport function numberToVarBytesBE(n) {\n    return hexToBytes(numberToHexUnpadded(n));\n}\n/**\n * Takes hex string or Uint8Array, converts to Uint8Array.\n * Validates output length.\n * Will throw error for other types.\n * @param title descriptive title for an error e.g. 'private key'\n * @param hex hex string or Uint8Array\n * @param expectedLength optional, will compare to result array's length\n * @returns\n */\nexport function ensureBytes(title, hex, expectedLength) {\n    let res;\n    if (typeof hex === 'string') {\n        try {\n            res = hexToBytes(hex);\n        }\n        catch (e) {\n            throw new Error(`${title} must be valid hex string, got \"${hex}\". Cause: ${e}`);\n        }\n    }\n    else if (u8a(hex)) {\n        // Uint8Array.from() instead of hash.slice() because node.js Buffer\n        // is instance of Uint8Array, and its slice() creates **mutable** copy\n        res = Uint8Array.from(hex);\n    }\n    else {\n        throw new Error(`${title} must be hex string or Uint8Array`);\n    }\n    const len = res.length;\n    if (typeof expectedLength === 'number' && len !== expectedLength)\n        throw new Error(`${title} expected ${expectedLength} bytes, got ${len}`);\n    return res;\n}\n/**\n * Copies several Uint8Arrays into one.\n */\nexport function concatBytes(...arrays) {\n    const r = new Uint8Array(arrays.reduce((sum, a) => sum + a.length, 0));\n    let pad = 0; // walk through each item, ensure they have proper type\n    arrays.forEach((a) => {\n        if (!u8a(a))\n            throw new Error('Uint8Array expected');\n        r.set(a, pad);\n        pad += a.length;\n    });\n    return r;\n}\nexport function equalBytes(b1, b2) {\n    // We don't care about timing attacks here\n    if (b1.length !== b2.length)\n        return false;\n    for (let i = 0; i < b1.length; i++)\n        if (b1[i] !== b2[i])\n            return false;\n    return true;\n}\n/**\n * @example utf8ToBytes('abc') // new Uint8Array([97, 98, 99])\n */\nexport function utf8ToBytes(str) {\n    if (typeof str !== 'string')\n        throw new Error(`utf8ToBytes expected string, got ${typeof str}`);\n    return new Uint8Array(new TextEncoder().encode(str)); // https://bugzil.la/1681809\n}\n// Bit operations\n/**\n * Calculates amount of bits in a bigint.\n * Same as `n.toString(2).length`\n */\nexport function bitLen(n) {\n    let len;\n    for (len = 0; n > _0n; n >>= _1n, len += 1)\n        ;\n    return len;\n}\n/**\n * Gets single bit at position.\n * NOTE: first bit position is 0 (same as arrays)\n * Same as `!!+Array.from(n.toString(2)).reverse()[pos]`\n */\nexport function bitGet(n, pos) {\n    return (n >> BigInt(pos)) & _1n;\n}\n/**\n * Sets single bit at position.\n */\nexport const bitSet = (n, pos, value) => {\n    return n | ((value ? _1n : _0n) << BigInt(pos));\n};\n/**\n * Calculate mask for N bits. Not using ** operator with bigints because of old engines.\n * Same as BigInt(`0b${Array(i).fill('1').join('')}`)\n */\nexport const bitMask = (n) => (_2n << BigInt(n - 1)) - _1n;\n// DRBG\nconst u8n = (data) => new Uint8Array(data); // creates Uint8Array\nconst u8fr = (arr) => Uint8Array.from(arr); // another shortcut\n/**\n * Minimal HMAC-DRBG from NIST 800-90 for RFC6979 sigs.\n * @returns function that will call DRBG until 2nd arg returns something meaningful\n * @example\n *   const drbg = createHmacDRBG<Key>(32, 32, hmac);\n *   drbg(seed, bytesToKey); // bytesToKey must return Key or undefined\n */\nexport function createHmacDrbg(hashLen, qByteLen, hmacFn) {\n    if (typeof hashLen !== 'number' || hashLen < 2)\n        throw new Error('hashLen must be a number');\n    if (typeof qByteLen !== 'number' || qByteLen < 2)\n        throw new Error('qByteLen must be a number');\n    if (typeof hmacFn !== 'function')\n        throw new Error('hmacFn must be a function');\n    // Step B, Step C: set hashLen to 8*ceil(hlen/8)\n    let v = u8n(hashLen); // Minimal non-full-spec HMAC-DRBG from NIST 800-90 for RFC6979 sigs.\n    let k = u8n(hashLen); // Steps B and C of RFC6979 3.2: set hashLen, in our case always same\n    let i = 0; // Iterations counter, will throw when over 1000\n    const reset = () => {\n        v.fill(1);\n        k.fill(0);\n        i = 0;\n    };\n    const h = (...b) => hmacFn(k, v, ...b); // hmac(k)(v, ...values)\n    const reseed = (seed = u8n()) => {\n        // HMAC-DRBG reseed() function. Steps D-G\n        k = h(u8fr([0x00]), seed); // k = hmac(k || v || 0x00 || seed)\n        v = h(); // v = hmac(k || v)\n        if (seed.length === 0)\n            return;\n        k = h(u8fr([0x01]), seed); // k = hmac(k || v || 0x01 || seed)\n        v = h(); // v = hmac(k || v)\n    };\n    const gen = () => {\n        // HMAC-DRBG generate() function\n        if (i++ >= 1000)\n            throw new Error('drbg: tried 1000 values');\n        let len = 0;\n        const out = [];\n        while (len < qByteLen) {\n            v = h();\n            const sl = v.slice();\n            out.push(sl);\n            len += v.length;\n        }\n        return concatBytes(...out);\n    };\n    const genUntil = (seed, pred) => {\n        reset();\n        reseed(seed); // Steps D-G\n        let res = undefined; // Step H: grind until k is in [1..n-1]\n        while (!(res = pred(gen())))\n            reseed();\n        reset();\n        return res;\n    };\n    return genUntil;\n}\n// Validating curves and fields\nconst validatorFns = {\n    bigint: (val) => typeof val === 'bigint',\n    function: (val) => typeof val === 'function',\n    boolean: (val) => typeof val === 'boolean',\n    string: (val) => typeof val === 'string',\n    stringOrUint8Array: (val) => typeof val === 'string' || val instanceof Uint8Array,\n    isSafeInteger: (val) => Number.isSafeInteger(val),\n    array: (val) => Array.isArray(val),\n    field: (val, object) => object.Fp.isValid(val),\n    hash: (val) => typeof val === 'function' && Number.isSafeInteger(val.outputLen),\n};\n// type Record<K extends string | number | symbol, T> = { [P in K]: T; }\nexport function validateObject(object, validators, optValidators = {}) {\n    const checkField = (fieldName, type, isOptional) => {\n        const checkVal = validatorFns[type];\n        if (typeof checkVal !== 'function')\n            throw new Error(`Invalid validator \"${type}\", expected function`);\n        const val = object[fieldName];\n        if (isOptional && val === undefined)\n            return;\n        if (!checkVal(val, object)) {\n            throw new Error(`Invalid param ${String(fieldName)}=${val} (${typeof val}), expected ${type}`);\n        }\n    };\n    for (const [fieldName, type] of Object.entries(validators))\n        checkField(fieldName, type, false);\n    for (const [fieldName, type] of Object.entries(optValidators))\n        checkField(fieldName, type, true);\n    return object;\n}\n// validate type tests\n// const o: { a: number; b: number; c: number } = { a: 1, b: 5, c: 6 };\n// const z0 = validateObject(o, { a: 'isSafeInteger' }, { c: 'bigint' }); // Ok!\n// // Should fail type-check\n// const z1 = validateObject(o, { a: 'tmp' }, { c: 'zz' });\n// const z2 = validateObject(o, { a: 'isSafeInteger' }, { c: 'zz' });\n// const z3 = validateObject(o, { test: 'boolean', z: 'bug' });\n// const z4 = validateObject(o, { a: 'boolean', z: 'bug' });\n//# sourceMappingURL=utils.js.map","/*! noble-curves - MIT License (c) 2022 Paul Miller (paulmillr.com) */\n// Utilities for modular arithmetics and finite fields\nimport { bitMask, numberToBytesBE, numberToBytesLE, bytesToNumberBE, bytesToNumberLE, ensureBytes, validateObject, } from './utils.js';\n// prettier-ignore\nconst _0n = BigInt(0), _1n = BigInt(1), _2n = BigInt(2), _3n = BigInt(3);\n// prettier-ignore\nconst _4n = BigInt(4), _5n = BigInt(5), _8n = BigInt(8);\n// prettier-ignore\nconst _9n = BigInt(9), _16n = BigInt(16);\n// Calculates a modulo b\nexport function mod(a, b) {\n    const result = a % b;\n    return result >= _0n ? result : b + result;\n}\n/**\n * Efficiently raise num to power and do modular division.\n * Unsafe in some contexts: uses ladder, so can expose bigint bits.\n * @example\n * pow(2n, 6n, 11n) // 64n % 11n == 9n\n */\n// TODO: use field version && remove\nexport function pow(num, power, modulo) {\n    if (modulo <= _0n || power < _0n)\n        throw new Error('Expected power/modulo > 0');\n    if (modulo === _1n)\n        return _0n;\n    let res = _1n;\n    while (power > _0n) {\n        if (power & _1n)\n            res = (res * num) % modulo;\n        num = (num * num) % modulo;\n        power >>= _1n;\n    }\n    return res;\n}\n// Does x ^ (2 ^ power) mod p. pow2(30, 4) == 30 ^ (2 ^ 4)\nexport function pow2(x, power, modulo) {\n    let res = x;\n    while (power-- > _0n) {\n        res *= res;\n        res %= modulo;\n    }\n    return res;\n}\n// Inverses number over modulo\nexport function invert(number, modulo) {\n    if (number === _0n || modulo <= _0n) {\n        throw new Error(`invert: expected positive integers, got n=${number} mod=${modulo}`);\n    }\n    // Euclidean GCD https://brilliant.org/wiki/extended-euclidean-algorithm/\n    // Fermat's little theorem \"CT-like\" version inv(n) = n^(m-2) mod m is 30x slower.\n    let a = mod(number, modulo);\n    let b = modulo;\n    // prettier-ignore\n    let x = _0n, y = _1n, u = _1n, v = _0n;\n    while (a !== _0n) {\n        // JIT applies optimization if those two lines follow each other\n        const q = b / a;\n        const r = b % a;\n        const m = x - u * q;\n        const n = y - v * q;\n        // prettier-ignore\n        b = a, a = r, x = u, y = v, u = m, v = n;\n    }\n    const gcd = b;\n    if (gcd !== _1n)\n        throw new Error('invert: does not exist');\n    return mod(x, modulo);\n}\n/**\n * Tonelli-Shanks square root search algorithm.\n * 1. https://eprint.iacr.org/2012/685.pdf (page 12)\n * 2. Square Roots from 1; 24, 51, 10 to Dan Shanks\n * Will start an infinite loop if field order P is not prime.\n * @param P field order\n * @returns function that takes field Fp (created from P) and number n\n */\nexport function tonelliShanks(P) {\n    // Legendre constant: used to calculate Legendre symbol (a | p),\n    // which denotes the value of a^((p-1)/2) (mod p).\n    // (a | p) ≡ 1    if a is a square (mod p)\n    // (a | p) ≡ -1   if a is not a square (mod p)\n    // (a | p) ≡ 0    if a ≡ 0 (mod p)\n    const legendreC = (P - _1n) / _2n;\n    let Q, S, Z;\n    // Step 1: By factoring out powers of 2 from p - 1,\n    // find q and s such that p - 1 = q*(2^s) with q odd\n    for (Q = P - _1n, S = 0; Q % _2n === _0n; Q /= _2n, S++)\n        ;\n    // Step 2: Select a non-square z such that (z | p) ≡ -1 and set c ≡ zq\n    for (Z = _2n; Z < P && pow(Z, legendreC, P) !== P - _1n; Z++)\n        ;\n    // Fast-path\n    if (S === 1) {\n        const p1div4 = (P + _1n) / _4n;\n        return function tonelliFast(Fp, n) {\n            const root = Fp.pow(n, p1div4);\n            if (!Fp.eql(Fp.sqr(root), n))\n                throw new Error('Cannot find square root');\n            return root;\n        };\n    }\n    // Slow-path\n    const Q1div2 = (Q + _1n) / _2n;\n    return function tonelliSlow(Fp, n) {\n        // Step 0: Check that n is indeed a square: (n | p) should not be ≡ -1\n        if (Fp.pow(n, legendreC) === Fp.neg(Fp.ONE))\n            throw new Error('Cannot find square root');\n        let r = S;\n        // TODO: will fail at Fp2/etc\n        let g = Fp.pow(Fp.mul(Fp.ONE, Z), Q); // will update both x and b\n        let x = Fp.pow(n, Q1div2); // first guess at the square root\n        let b = Fp.pow(n, Q); // first guess at the fudge factor\n        while (!Fp.eql(b, Fp.ONE)) {\n            if (Fp.eql(b, Fp.ZERO))\n                return Fp.ZERO; // https://en.wikipedia.org/wiki/Tonelli%E2%80%93Shanks_algorithm (4. If t = 0, return r = 0)\n            // Find m such b^(2^m)==1\n            let m = 1;\n            for (let t2 = Fp.sqr(b); m < r; m++) {\n                if (Fp.eql(t2, Fp.ONE))\n                    break;\n                t2 = Fp.sqr(t2); // t2 *= t2\n            }\n            // NOTE: r-m-1 can be bigger than 32, need to convert to bigint before shift, otherwise there will be overflow\n            const ge = Fp.pow(g, _1n << BigInt(r - m - 1)); // ge = 2^(r-m-1)\n            g = Fp.sqr(ge); // g = ge * ge\n            x = Fp.mul(x, ge); // x *= ge\n            b = Fp.mul(b, g); // b *= g\n            r = m;\n        }\n        return x;\n    };\n}\nexport function FpSqrt(P) {\n    // NOTE: different algorithms can give different roots, it is up to user to decide which one they want.\n    // For example there is FpSqrtOdd/FpSqrtEven to choice root based on oddness (used for hash-to-curve).\n    // P ≡ 3 (mod 4)\n    // √n = n^((P+1)/4)\n    if (P % _4n === _3n) {\n        // Not all roots possible!\n        // const ORDER =\n        //   0x1a0111ea397fe69a4b1ba7b6434bacd764774b84f38512bf6730d2a0f6b0f6241eabfffeb153ffffb9feffffffffaaabn;\n        // const NUM = 72057594037927816n;\n        const p1div4 = (P + _1n) / _4n;\n        return function sqrt3mod4(Fp, n) {\n            const root = Fp.pow(n, p1div4);\n            // Throw if root**2 != n\n            if (!Fp.eql(Fp.sqr(root), n))\n                throw new Error('Cannot find square root');\n            return root;\n        };\n    }\n    // Atkin algorithm for q ≡ 5 (mod 8), https://eprint.iacr.org/2012/685.pdf (page 10)\n    if (P % _8n === _5n) {\n        const c1 = (P - _5n) / _8n;\n        return function sqrt5mod8(Fp, n) {\n            const n2 = Fp.mul(n, _2n);\n            const v = Fp.pow(n2, c1);\n            const nv = Fp.mul(n, v);\n            const i = Fp.mul(Fp.mul(nv, _2n), v);\n            const root = Fp.mul(nv, Fp.sub(i, Fp.ONE));\n            if (!Fp.eql(Fp.sqr(root), n))\n                throw new Error('Cannot find square root');\n            return root;\n        };\n    }\n    // P ≡ 9 (mod 16)\n    if (P % _16n === _9n) {\n        // NOTE: tonelli is too slow for bls-Fp2 calculations even on start\n        // Means we cannot use sqrt for constants at all!\n        //\n        // const c1 = Fp.sqrt(Fp.negate(Fp.ONE)); //  1. c1 = sqrt(-1) in F, i.e., (c1^2) == -1 in F\n        // const c2 = Fp.sqrt(c1);                //  2. c2 = sqrt(c1) in F, i.e., (c2^2) == c1 in F\n        // const c3 = Fp.sqrt(Fp.negate(c1));     //  3. c3 = sqrt(-c1) in F, i.e., (c3^2) == -c1 in F\n        // const c4 = (P + _7n) / _16n;           //  4. c4 = (q + 7) / 16        # Integer arithmetic\n        // sqrt = (x) => {\n        //   let tv1 = Fp.pow(x, c4);             //  1. tv1 = x^c4\n        //   let tv2 = Fp.mul(c1, tv1);           //  2. tv2 = c1 * tv1\n        //   const tv3 = Fp.mul(c2, tv1);         //  3. tv3 = c2 * tv1\n        //   let tv4 = Fp.mul(c3, tv1);           //  4. tv4 = c3 * tv1\n        //   const e1 = Fp.equals(Fp.square(tv2), x); //  5.  e1 = (tv2^2) == x\n        //   const e2 = Fp.equals(Fp.square(tv3), x); //  6.  e2 = (tv3^2) == x\n        //   tv1 = Fp.cmov(tv1, tv2, e1); //  7. tv1 = CMOV(tv1, tv2, e1)  # Select tv2 if (tv2^2) == x\n        //   tv2 = Fp.cmov(tv4, tv3, e2); //  8. tv2 = CMOV(tv4, tv3, e2)  # Select tv3 if (tv3^2) == x\n        //   const e3 = Fp.equals(Fp.square(tv2), x); //  9.  e3 = (tv2^2) == x\n        //   return Fp.cmov(tv1, tv2, e3); //  10.  z = CMOV(tv1, tv2, e3)  # Select the sqrt from tv1 and tv2\n        // }\n    }\n    // Other cases: Tonelli-Shanks algorithm\n    return tonelliShanks(P);\n}\n// Little-endian check for first LE bit (last BE bit);\nexport const isNegativeLE = (num, modulo) => (mod(num, modulo) & _1n) === _1n;\n// prettier-ignore\nconst FIELD_FIELDS = [\n    'create', 'isValid', 'is0', 'neg', 'inv', 'sqrt', 'sqr',\n    'eql', 'add', 'sub', 'mul', 'pow', 'div',\n    'addN', 'subN', 'mulN', 'sqrN'\n];\nexport function validateField(field) {\n    const initial = {\n        ORDER: 'bigint',\n        MASK: 'bigint',\n        BYTES: 'isSafeInteger',\n        BITS: 'isSafeInteger',\n    };\n    const opts = FIELD_FIELDS.reduce((map, val) => {\n        map[val] = 'function';\n        return map;\n    }, initial);\n    return validateObject(field, opts);\n}\n// Generic field functions\n/**\n * Same as `pow` but for Fp: non-constant-time.\n * Unsafe in some contexts: uses ladder, so can expose bigint bits.\n */\nexport function FpPow(f, num, power) {\n    // Should have same speed as pow for bigints\n    // TODO: benchmark!\n    if (power < _0n)\n        throw new Error('Expected power > 0');\n    if (power === _0n)\n        return f.ONE;\n    if (power === _1n)\n        return num;\n    let p = f.ONE;\n    let d = num;\n    while (power > _0n) {\n        if (power & _1n)\n            p = f.mul(p, d);\n        d = f.sqr(d);\n        power >>= _1n;\n    }\n    return p;\n}\n/**\n * Efficiently invert an array of Field elements.\n * `inv(0)` will return `undefined` here: make sure to throw an error.\n */\nexport function FpInvertBatch(f, nums) {\n    const tmp = new Array(nums.length);\n    // Walk from first to last, multiply them by each other MOD p\n    const lastMultiplied = nums.reduce((acc, num, i) => {\n        if (f.is0(num))\n            return acc;\n        tmp[i] = acc;\n        return f.mul(acc, num);\n    }, f.ONE);\n    // Invert last element\n    const inverted = f.inv(lastMultiplied);\n    // Walk from last to first, multiply them by inverted each other MOD p\n    nums.reduceRight((acc, num, i) => {\n        if (f.is0(num))\n            return acc;\n        tmp[i] = f.mul(acc, tmp[i]);\n        return f.mul(acc, num);\n    }, inverted);\n    return tmp;\n}\nexport function FpDiv(f, lhs, rhs) {\n    return f.mul(lhs, typeof rhs === 'bigint' ? invert(rhs, f.ORDER) : f.inv(rhs));\n}\n// This function returns True whenever the value x is a square in the field F.\nexport function FpIsSquare(f) {\n    const legendreConst = (f.ORDER - _1n) / _2n; // Integer arithmetic\n    return (x) => {\n        const p = f.pow(x, legendreConst);\n        return f.eql(p, f.ZERO) || f.eql(p, f.ONE);\n    };\n}\n// CURVE.n lengths\nexport function nLength(n, nBitLength) {\n    // Bit size, byte size of CURVE.n\n    const _nBitLength = nBitLength !== undefined ? nBitLength : n.toString(2).length;\n    const nByteLength = Math.ceil(_nBitLength / 8);\n    return { nBitLength: _nBitLength, nByteLength };\n}\n/**\n * Initializes a finite field over prime. **Non-primes are not supported.**\n * Do not init in loop: slow. Very fragile: always run a benchmark on a change.\n * Major performance optimizations:\n * * a) denormalized operations like mulN instead of mul\n * * b) same object shape: never add or remove keys\n * * c) Object.freeze\n * @param ORDER prime positive bigint\n * @param bitLen how many bits the field consumes\n * @param isLE (def: false) if encoding / decoding should be in little-endian\n * @param redef optional faster redefinitions of sqrt and other methods\n */\nexport function Field(ORDER, bitLen, isLE = false, redef = {}) {\n    if (ORDER <= _0n)\n        throw new Error(`Expected Field ORDER > 0, got ${ORDER}`);\n    const { nBitLength: BITS, nByteLength: BYTES } = nLength(ORDER, bitLen);\n    if (BYTES > 2048)\n        throw new Error('Field lengths over 2048 bytes are not supported');\n    const sqrtP = FpSqrt(ORDER);\n    const f = Object.freeze({\n        ORDER,\n        BITS,\n        BYTES,\n        MASK: bitMask(BITS),\n        ZERO: _0n,\n        ONE: _1n,\n        create: (num) => mod(num, ORDER),\n        isValid: (num) => {\n            if (typeof num !== 'bigint')\n                throw new Error(`Invalid field element: expected bigint, got ${typeof num}`);\n            return _0n <= num && num < ORDER; // 0 is valid element, but it's not invertible\n        },\n        is0: (num) => num === _0n,\n        isOdd: (num) => (num & _1n) === _1n,\n        neg: (num) => mod(-num, ORDER),\n        eql: (lhs, rhs) => lhs === rhs,\n        sqr: (num) => mod(num * num, ORDER),\n        add: (lhs, rhs) => mod(lhs + rhs, ORDER),\n        sub: (lhs, rhs) => mod(lhs - rhs, ORDER),\n        mul: (lhs, rhs) => mod(lhs * rhs, ORDER),\n        pow: (num, power) => FpPow(f, num, power),\n        div: (lhs, rhs) => mod(lhs * invert(rhs, ORDER), ORDER),\n        // Same as above, but doesn't normalize\n        sqrN: (num) => num * num,\n        addN: (lhs, rhs) => lhs + rhs,\n        subN: (lhs, rhs) => lhs - rhs,\n        mulN: (lhs, rhs) => lhs * rhs,\n        inv: (num) => invert(num, ORDER),\n        sqrt: redef.sqrt || ((n) => sqrtP(f, n)),\n        invertBatch: (lst) => FpInvertBatch(f, lst),\n        // TODO: do we really need constant cmov?\n        // We don't have const-time bigints anyway, so probably will be not very useful\n        cmov: (a, b, c) => (c ? b : a),\n        toBytes: (num) => (isLE ? numberToBytesLE(num, BYTES) : numberToBytesBE(num, BYTES)),\n        fromBytes: (bytes) => {\n            if (bytes.length !== BYTES)\n                throw new Error(`Fp.fromBytes: expected ${BYTES}, got ${bytes.length}`);\n            return isLE ? bytesToNumberLE(bytes) : bytesToNumberBE(bytes);\n        },\n    });\n    return Object.freeze(f);\n}\nexport function FpSqrtOdd(Fp, elm) {\n    if (!Fp.isOdd)\n        throw new Error(`Field doesn't have isOdd`);\n    const root = Fp.sqrt(elm);\n    return Fp.isOdd(root) ? root : Fp.neg(root);\n}\nexport function FpSqrtEven(Fp, elm) {\n    if (!Fp.isOdd)\n        throw new Error(`Field doesn't have isOdd`);\n    const root = Fp.sqrt(elm);\n    return Fp.isOdd(root) ? Fp.neg(root) : root;\n}\n/**\n * \"Constant-time\" private key generation utility.\n * Same as mapKeyToField, but accepts less bytes (40 instead of 48 for 32-byte field).\n * Which makes it slightly more biased, less secure.\n * @deprecated use mapKeyToField instead\n */\nexport function hashToPrivateScalar(hash, groupOrder, isLE = false) {\n    hash = ensureBytes('privateHash', hash);\n    const hashLen = hash.length;\n    const minLen = nLength(groupOrder).nByteLength + 8;\n    if (minLen < 24 || hashLen < minLen || hashLen > 1024)\n        throw new Error(`hashToPrivateScalar: expected ${minLen}-1024 bytes of input, got ${hashLen}`);\n    const num = isLE ? bytesToNumberLE(hash) : bytesToNumberBE(hash);\n    return mod(num, groupOrder - _1n) + _1n;\n}\n/**\n * Returns total number of bytes consumed by the field element.\n * For example, 32 bytes for usual 256-bit weierstrass curve.\n * @param fieldOrder number of field elements, usually CURVE.n\n * @returns byte length of field\n */\nexport function getFieldBytesLength(fieldOrder) {\n    if (typeof fieldOrder !== 'bigint')\n        throw new Error('field order must be bigint');\n    const bitLength = fieldOrder.toString(2).length;\n    return Math.ceil(bitLength / 8);\n}\n/**\n * Returns minimal amount of bytes that can be safely reduced\n * by field order.\n * Should be 2^-128 for 128-bit curve such as P256.\n * @param fieldOrder number of field elements, usually CURVE.n\n * @returns byte length of target hash\n */\nexport function getMinHashLength(fieldOrder) {\n    const length = getFieldBytesLength(fieldOrder);\n    return length + Math.ceil(length / 2);\n}\n/**\n * \"Constant-time\" private key generation utility.\n * Can take (n + n/2) or more bytes of uniform input e.g. from CSPRNG or KDF\n * and convert them into private scalar, with the modulo bias being negligible.\n * Needs at least 48 bytes of input for 32-byte private key.\n * https://research.kudelskisecurity.com/2020/07/28/the-definitive-guide-to-modulo-bias-and-how-to-avoid-it/\n * FIPS 186-5, A.2 https://csrc.nist.gov/publications/detail/fips/186/5/final\n * RFC 9380, https://www.rfc-editor.org/rfc/rfc9380#section-5\n * @param hash hash output from SHA3 or a similar function\n * @param groupOrder size of subgroup - (e.g. secp256k1.CURVE.n)\n * @param isLE interpret hash bytes as LE num\n * @returns valid private scalar\n */\nexport function mapHashToField(key, fieldOrder, isLE = false) {\n    const len = key.length;\n    const fieldLen = getFieldBytesLength(fieldOrder);\n    const minLen = getMinHashLength(fieldOrder);\n    // No small numbers: need to understand bias story. No huge numbers: easier to detect JS timings.\n    if (len < 16 || len < minLen || len > 1024)\n        throw new Error(`expected ${minLen}-1024 bytes of input, got ${len}`);\n    const num = isLE ? bytesToNumberBE(key) : bytesToNumberLE(key);\n    // `mod(x, 11)` can sometimes produce 0. `mod(x, 10) + 1` is the same, but no 0\n    const reduced = mod(num, fieldOrder - _1n) + _1n;\n    return isLE ? numberToBytesLE(reduced, fieldLen) : numberToBytesBE(reduced, fieldLen);\n}\n//# sourceMappingURL=modular.js.map","/*! noble-curves - MIT License (c) 2022 Paul Miller (paulmillr.com) */\n// Abelian group utilities\nimport { validateField, nLength } from './modular.js';\nimport { validateObject } from './utils.js';\nconst _0n = BigInt(0);\nconst _1n = BigInt(1);\n// Elliptic curve multiplication of Point by scalar. Fragile.\n// Scalars should always be less than curve order: this should be checked inside of a curve itself.\n// Creates precomputation tables for fast multiplication:\n// - private scalar is split by fixed size windows of W bits\n// - every window point is collected from window's table & added to accumulator\n// - since windows are different, same point inside tables won't be accessed more than once per calc\n// - each multiplication is 'Math.ceil(CURVE_ORDER / 𝑊) + 1' point additions (fixed for any scalar)\n// - +1 window is neccessary for wNAF\n// - wNAF reduces table size: 2x less memory + 2x faster generation, but 10% slower multiplication\n// TODO: Research returning 2d JS array of windows, instead of a single window. This would allow\n// windows to be in different memory locations\nexport function wNAF(c, bits) {\n    const constTimeNegate = (condition, item) => {\n        const neg = item.negate();\n        return condition ? neg : item;\n    };\n    const opts = (W) => {\n        const windows = Math.ceil(bits / W) + 1; // +1, because\n        const windowSize = 2 ** (W - 1); // -1 because we skip zero\n        return { windows, windowSize };\n    };\n    return {\n        constTimeNegate,\n        // non-const time multiplication ladder\n        unsafeLadder(elm, n) {\n            let p = c.ZERO;\n            let d = elm;\n            while (n > _0n) {\n                if (n & _1n)\n                    p = p.add(d);\n                d = d.double();\n                n >>= _1n;\n            }\n            return p;\n        },\n        /**\n         * Creates a wNAF precomputation window. Used for caching.\n         * Default window size is set by `utils.precompute()` and is equal to 8.\n         * Number of precomputed points depends on the curve size:\n         * 2^(𝑊−1) * (Math.ceil(𝑛 / 𝑊) + 1), where:\n         * - 𝑊 is the window size\n         * - 𝑛 is the bitlength of the curve order.\n         * For a 256-bit curve and window size 8, the number of precomputed points is 128 * 33 = 4224.\n         * @returns precomputed point tables flattened to a single array\n         */\n        precomputeWindow(elm, W) {\n            const { windows, windowSize } = opts(W);\n            const points = [];\n            let p = elm;\n            let base = p;\n            for (let window = 0; window < windows; window++) {\n                base = p;\n                points.push(base);\n                // =1, because we skip zero\n                for (let i = 1; i < windowSize; i++) {\n                    base = base.add(p);\n                    points.push(base);\n                }\n                p = base.double();\n            }\n            return points;\n        },\n        /**\n         * Implements ec multiplication using precomputed tables and w-ary non-adjacent form.\n         * @param W window size\n         * @param precomputes precomputed tables\n         * @param n scalar (we don't check here, but should be less than curve order)\n         * @returns real and fake (for const-time) points\n         */\n        wNAF(W, precomputes, n) {\n            // TODO: maybe check that scalar is less than group order? wNAF behavious is undefined otherwise\n            // But need to carefully remove other checks before wNAF. ORDER == bits here\n            const { windows, windowSize } = opts(W);\n            let p = c.ZERO;\n            let f = c.BASE;\n            const mask = BigInt(2 ** W - 1); // Create mask with W ones: 0b1111 for W=4 etc.\n            const maxNumber = 2 ** W;\n            const shiftBy = BigInt(W);\n            for (let window = 0; window < windows; window++) {\n                const offset = window * windowSize;\n                // Extract W bits.\n                let wbits = Number(n & mask);\n                // Shift number by W bits.\n                n >>= shiftBy;\n                // If the bits are bigger than max size, we'll split those.\n                // +224 => 256 - 32\n                if (wbits > windowSize) {\n                    wbits -= maxNumber;\n                    n += _1n;\n                }\n                // This code was first written with assumption that 'f' and 'p' will never be infinity point:\n                // since each addition is multiplied by 2 ** W, it cannot cancel each other. However,\n                // there is negate now: it is possible that negated element from low value\n                // would be the same as high element, which will create carry into next window.\n                // It's not obvious how this can fail, but still worth investigating later.\n                // Check if we're onto Zero point.\n                // Add random point inside current window to f.\n                const offset1 = offset;\n                const offset2 = offset + Math.abs(wbits) - 1; // -1 because we skip zero\n                const cond1 = window % 2 !== 0;\n                const cond2 = wbits < 0;\n                if (wbits === 0) {\n                    // The most important part for const-time getPublicKey\n                    f = f.add(constTimeNegate(cond1, precomputes[offset1]));\n                }\n                else {\n                    p = p.add(constTimeNegate(cond2, precomputes[offset2]));\n                }\n            }\n            // JIT-compiler should not eliminate f here, since it will later be used in normalizeZ()\n            // Even if the variable is still unused, there are some checks which will\n            // throw an exception, so compiler needs to prove they won't happen, which is hard.\n            // At this point there is a way to F be infinity-point even if p is not,\n            // which makes it less const-time: around 1 bigint multiply.\n            return { p, f };\n        },\n        wNAFCached(P, precomputesMap, n, transform) {\n            // @ts-ignore\n            const W = P._WINDOW_SIZE || 1;\n            // Calculate precomputes on a first run, reuse them after\n            let comp = precomputesMap.get(P);\n            if (!comp) {\n                comp = this.precomputeWindow(P, W);\n                if (W !== 1) {\n                    precomputesMap.set(P, transform(comp));\n                }\n            }\n            return this.wNAF(W, comp, n);\n        },\n    };\n}\nexport function validateBasic(curve) {\n    validateField(curve.Fp);\n    validateObject(curve, {\n        n: 'bigint',\n        h: 'bigint',\n        Gx: 'field',\n        Gy: 'field',\n    }, {\n        nBitLength: 'isSafeInteger',\n        nByteLength: 'isSafeInteger',\n    });\n    // Set defaults\n    return Object.freeze({\n        ...nLength(curve.n, curve.nBitLength),\n        ...curve,\n        ...{ p: curve.Fp.ORDER },\n    });\n}\n//# sourceMappingURL=curve.js.map","/*! noble-curves - MIT License (c) 2022 Paul Miller (paulmillr.com) */\n// Short Weierstrass curve. The formula is: y² = x³ + ax + b\nimport * as mod from './modular.js';\nimport * as ut from './utils.js';\nimport { ensureBytes } from './utils.js';\nimport { wNAF, validateBasic } from './curve.js';\nfunction validatePointOpts(curve) {\n    const opts = validateBasic(curve);\n    ut.validateObject(opts, {\n        a: 'field',\n        b: 'field',\n    }, {\n        allowedPrivateKeyLengths: 'array',\n        wrapPrivateKey: 'boolean',\n        isTorsionFree: 'function',\n        clearCofactor: 'function',\n        allowInfinityPoint: 'boolean',\n        fromBytes: 'function',\n        toBytes: 'function',\n    });\n    const { endo, Fp, a } = opts;\n    if (endo) {\n        if (!Fp.eql(a, Fp.ZERO)) {\n            throw new Error('Endomorphism can only be defined for Koblitz curves that have a=0');\n        }\n        if (typeof endo !== 'object' ||\n            typeof endo.beta !== 'bigint' ||\n            typeof endo.splitScalar !== 'function') {\n            throw new Error('Expected endomorphism with beta: bigint and splitScalar: function');\n        }\n    }\n    return Object.freeze({ ...opts });\n}\n// ASN.1 DER encoding utilities\nconst { bytesToNumberBE: b2n, hexToBytes: h2b } = ut;\nexport const DER = {\n    // asn.1 DER encoding utils\n    Err: class DERErr extends Error {\n        constructor(m = '') {\n            super(m);\n        }\n    },\n    _parseInt(data) {\n        const { Err: E } = DER;\n        if (data.length < 2 || data[0] !== 0x02)\n            throw new E('Invalid signature integer tag');\n        const len = data[1];\n        const res = data.subarray(2, len + 2);\n        if (!len || res.length !== len)\n            throw new E('Invalid signature integer: wrong length');\n        // https://crypto.stackexchange.com/a/57734 Leftmost bit of first byte is 'negative' flag,\n        // since we always use positive integers here. It must always be empty:\n        // - add zero byte if exists\n        // - if next byte doesn't have a flag, leading zero is not allowed (minimal encoding)\n        if (res[0] & 0b10000000)\n            throw new E('Invalid signature integer: negative');\n        if (res[0] === 0x00 && !(res[1] & 0b10000000))\n            throw new E('Invalid signature integer: unnecessary leading zero');\n        return { d: b2n(res), l: data.subarray(len + 2) }; // d is data, l is left\n    },\n    toSig(hex) {\n        // parse DER signature\n        const { Err: E } = DER;\n        const data = typeof hex === 'string' ? h2b(hex) : hex;\n        if (!(data instanceof Uint8Array))\n            throw new Error('ui8a expected');\n        let l = data.length;\n        if (l < 2 || data[0] != 0x30)\n            throw new E('Invalid signature tag');\n        if (data[1] !== l - 2)\n            throw new E('Invalid signature: incorrect length');\n        const { d: r, l: sBytes } = DER._parseInt(data.subarray(2));\n        const { d: s, l: rBytesLeft } = DER._parseInt(sBytes);\n        if (rBytesLeft.length)\n            throw new E('Invalid signature: left bytes after parsing');\n        return { r, s };\n    },\n    hexFromSig(sig) {\n        // Add leading zero if first byte has negative bit enabled. More details in '_parseInt'\n        const slice = (s) => (Number.parseInt(s[0], 16) & 0b1000 ? '00' + s : s);\n        const h = (num) => {\n            const hex = num.toString(16);\n            return hex.length & 1 ? `0${hex}` : hex;\n        };\n        const s = slice(h(sig.s));\n        const r = slice(h(sig.r));\n        const shl = s.length / 2;\n        const rhl = r.length / 2;\n        const sl = h(shl);\n        const rl = h(rhl);\n        return `30${h(rhl + shl + 4)}02${rl}${r}02${sl}${s}`;\n    },\n};\n// Be friendly to bad ECMAScript parsers by not using bigint literals\n// prettier-ignore\nconst _0n = BigInt(0), _1n = BigInt(1), _2n = BigInt(2), _3n = BigInt(3), _4n = BigInt(4);\nexport function weierstrassPoints(opts) {\n    const CURVE = validatePointOpts(opts);\n    const { Fp } = CURVE; // All curves has same field / group length as for now, but they can differ\n    const toBytes = CURVE.toBytes ||\n        ((_c, point, _isCompressed) => {\n            const a = point.toAffine();\n            return ut.concatBytes(Uint8Array.from([0x04]), Fp.toBytes(a.x), Fp.toBytes(a.y));\n        });\n    const fromBytes = CURVE.fromBytes ||\n        ((bytes) => {\n            // const head = bytes[0];\n            const tail = bytes.subarray(1);\n            // if (head !== 0x04) throw new Error('Only non-compressed encoding is supported');\n            const x = Fp.fromBytes(tail.subarray(0, Fp.BYTES));\n            const y = Fp.fromBytes(tail.subarray(Fp.BYTES, 2 * Fp.BYTES));\n            return { x, y };\n        });\n    /**\n     * y² = x³ + ax + b: Short weierstrass curve formula\n     * @returns y²\n     */\n    function weierstrassEquation(x) {\n        const { a, b } = CURVE;\n        const x2 = Fp.sqr(x); // x * x\n        const x3 = Fp.mul(x2, x); // x2 * x\n        return Fp.add(Fp.add(x3, Fp.mul(x, a)), b); // x3 + a * x + b\n    }\n    // Validate whether the passed curve params are valid.\n    // We check if curve equation works for generator point.\n    // `assertValidity()` won't work: `isTorsionFree()` is not available at this point in bls12-381.\n    // ProjectivePoint class has not been initialized yet.\n    if (!Fp.eql(Fp.sqr(CURVE.Gy), weierstrassEquation(CURVE.Gx)))\n        throw new Error('bad generator point: equation left != right');\n    // Valid group elements reside in range 1..n-1\n    function isWithinCurveOrder(num) {\n        return typeof num === 'bigint' && _0n < num && num < CURVE.n;\n    }\n    function assertGE(num) {\n        if (!isWithinCurveOrder(num))\n            throw new Error('Expected valid bigint: 0 < bigint < curve.n');\n    }\n    // Validates if priv key is valid and converts it to bigint.\n    // Supports options allowedPrivateKeyLengths and wrapPrivateKey.\n    function normPrivateKeyToScalar(key) {\n        const { allowedPrivateKeyLengths: lengths, nByteLength, wrapPrivateKey, n } = CURVE;\n        if (lengths && typeof key !== 'bigint') {\n            if (key instanceof Uint8Array)\n                key = ut.bytesToHex(key);\n            // Normalize to hex string, pad. E.g. P521 would norm 130-132 char hex to 132-char bytes\n            if (typeof key !== 'string' || !lengths.includes(key.length))\n                throw new Error('Invalid key');\n            key = key.padStart(nByteLength * 2, '0');\n        }\n        let num;\n        try {\n            num =\n                typeof key === 'bigint'\n                    ? key\n                    : ut.bytesToNumberBE(ensureBytes('private key', key, nByteLength));\n        }\n        catch (error) {\n            throw new Error(`private key must be ${nByteLength} bytes, hex or bigint, not ${typeof key}`);\n        }\n        if (wrapPrivateKey)\n            num = mod.mod(num, n); // disabled by default, enabled for BLS\n        assertGE(num); // num in range [1..N-1]\n        return num;\n    }\n    const pointPrecomputes = new Map();\n    function assertPrjPoint(other) {\n        if (!(other instanceof Point))\n            throw new Error('ProjectivePoint expected');\n    }\n    /**\n     * Projective Point works in 3d / projective (homogeneous) coordinates: (x, y, z) ∋ (x=x/z, y=y/z)\n     * Default Point works in 2d / affine coordinates: (x, y)\n     * We're doing calculations in projective, because its operations don't require costly inversion.\n     */\n    class Point {\n        constructor(px, py, pz) {\n            this.px = px;\n            this.py = py;\n            this.pz = pz;\n            if (px == null || !Fp.isValid(px))\n                throw new Error('x required');\n            if (py == null || !Fp.isValid(py))\n                throw new Error('y required');\n            if (pz == null || !Fp.isValid(pz))\n                throw new Error('z required');\n        }\n        // Does not validate if the point is on-curve.\n        // Use fromHex instead, or call assertValidity() later.\n        static fromAffine(p) {\n            const { x, y } = p || {};\n            if (!p || !Fp.isValid(x) || !Fp.isValid(y))\n                throw new Error('invalid affine point');\n            if (p instanceof Point)\n                throw new Error('projective point not allowed');\n            const is0 = (i) => Fp.eql(i, Fp.ZERO);\n            // fromAffine(x:0, y:0) would produce (x:0, y:0, z:1), but we need (x:0, y:1, z:0)\n            if (is0(x) && is0(y))\n                return Point.ZERO;\n            return new Point(x, y, Fp.ONE);\n        }\n        get x() {\n            return this.toAffine().x;\n        }\n        get y() {\n            return this.toAffine().y;\n        }\n        /**\n         * Takes a bunch of Projective Points but executes only one\n         * inversion on all of them. Inversion is very slow operation,\n         * so this improves performance massively.\n         * Optimization: converts a list of projective points to a list of identical points with Z=1.\n         */\n        static normalizeZ(points) {\n            const toInv = Fp.invertBatch(points.map((p) => p.pz));\n            return points.map((p, i) => p.toAffine(toInv[i])).map(Point.fromAffine);\n        }\n        /**\n         * Converts hash string or Uint8Array to Point.\n         * @param hex short/long ECDSA hex\n         */\n        static fromHex(hex) {\n            const P = Point.fromAffine(fromBytes(ensureBytes('pointHex', hex)));\n            P.assertValidity();\n            return P;\n        }\n        // Multiplies generator point by privateKey.\n        static fromPrivateKey(privateKey) {\n            return Point.BASE.multiply(normPrivateKeyToScalar(privateKey));\n        }\n        // \"Private method\", don't use it directly\n        _setWindowSize(windowSize) {\n            this._WINDOW_SIZE = windowSize;\n            pointPrecomputes.delete(this);\n        }\n        // A point on curve is valid if it conforms to equation.\n        assertValidity() {\n            if (this.is0()) {\n                // (0, 1, 0) aka ZERO is invalid in most contexts.\n                // In BLS, ZERO can be serialized, so we allow it.\n                // (0, 0, 0) is wrong representation of ZERO and is always invalid.\n                if (CURVE.allowInfinityPoint && !Fp.is0(this.py))\n                    return;\n                throw new Error('bad point: ZERO');\n            }\n            // Some 3rd-party test vectors require different wording between here & `fromCompressedHex`\n            const { x, y } = this.toAffine();\n            // Check if x, y are valid field elements\n            if (!Fp.isValid(x) || !Fp.isValid(y))\n                throw new Error('bad point: x or y not FE');\n            const left = Fp.sqr(y); // y²\n            const right = weierstrassEquation(x); // x³ + ax + b\n            if (!Fp.eql(left, right))\n                throw new Error('bad point: equation left != right');\n            if (!this.isTorsionFree())\n                throw new Error('bad point: not in prime-order subgroup');\n        }\n        hasEvenY() {\n            const { y } = this.toAffine();\n            if (Fp.isOdd)\n                return !Fp.isOdd(y);\n            throw new Error(\"Field doesn't support isOdd\");\n        }\n        /**\n         * Compare one point to another.\n         */\n        equals(other) {\n            assertPrjPoint(other);\n            const { px: X1, py: Y1, pz: Z1 } = this;\n            const { px: X2, py: Y2, pz: Z2 } = other;\n            const U1 = Fp.eql(Fp.mul(X1, Z2), Fp.mul(X2, Z1));\n            const U2 = Fp.eql(Fp.mul(Y1, Z2), Fp.mul(Y2, Z1));\n            return U1 && U2;\n        }\n        /**\n         * Flips point to one corresponding to (x, -y) in Affine coordinates.\n         */\n        negate() {\n            return new Point(this.px, Fp.neg(this.py), this.pz);\n        }\n        // Renes-Costello-Batina exception-free doubling formula.\n        // There is 30% faster Jacobian formula, but it is not complete.\n        // https://eprint.iacr.org/2015/1060, algorithm 3\n        // Cost: 8M + 3S + 3*a + 2*b3 + 15add.\n        double() {\n            const { a, b } = CURVE;\n            const b3 = Fp.mul(b, _3n);\n            const { px: X1, py: Y1, pz: Z1 } = this;\n            let X3 = Fp.ZERO, Y3 = Fp.ZERO, Z3 = Fp.ZERO; // prettier-ignore\n            let t0 = Fp.mul(X1, X1); // step 1\n            let t1 = Fp.mul(Y1, Y1);\n            let t2 = Fp.mul(Z1, Z1);\n            let t3 = Fp.mul(X1, Y1);\n            t3 = Fp.add(t3, t3); // step 5\n            Z3 = Fp.mul(X1, Z1);\n            Z3 = Fp.add(Z3, Z3);\n            X3 = Fp.mul(a, Z3);\n            Y3 = Fp.mul(b3, t2);\n            Y3 = Fp.add(X3, Y3); // step 10\n            X3 = Fp.sub(t1, Y3);\n            Y3 = Fp.add(t1, Y3);\n            Y3 = Fp.mul(X3, Y3);\n            X3 = Fp.mul(t3, X3);\n            Z3 = Fp.mul(b3, Z3); // step 15\n            t2 = Fp.mul(a, t2);\n            t3 = Fp.sub(t0, t2);\n            t3 = Fp.mul(a, t3);\n            t3 = Fp.add(t3, Z3);\n            Z3 = Fp.add(t0, t0); // step 20\n            t0 = Fp.add(Z3, t0);\n            t0 = Fp.add(t0, t2);\n            t0 = Fp.mul(t0, t3);\n            Y3 = Fp.add(Y3, t0);\n            t2 = Fp.mul(Y1, Z1); // step 25\n            t2 = Fp.add(t2, t2);\n            t0 = Fp.mul(t2, t3);\n            X3 = Fp.sub(X3, t0);\n            Z3 = Fp.mul(t2, t1);\n            Z3 = Fp.add(Z3, Z3); // step 30\n            Z3 = Fp.add(Z3, Z3);\n            return new Point(X3, Y3, Z3);\n        }\n        // Renes-Costello-Batina exception-free addition formula.\n        // There is 30% faster Jacobian formula, but it is not complete.\n        // https://eprint.iacr.org/2015/1060, algorithm 1\n        // Cost: 12M + 0S + 3*a + 3*b3 + 23add.\n        add(other) {\n            assertPrjPoint(other);\n            const { px: X1, py: Y1, pz: Z1 } = this;\n            const { px: X2, py: Y2, pz: Z2 } = other;\n            let X3 = Fp.ZERO, Y3 = Fp.ZERO, Z3 = Fp.ZERO; // prettier-ignore\n            const a = CURVE.a;\n            const b3 = Fp.mul(CURVE.b, _3n);\n            let t0 = Fp.mul(X1, X2); // step 1\n            let t1 = Fp.mul(Y1, Y2);\n            let t2 = Fp.mul(Z1, Z2);\n            let t3 = Fp.add(X1, Y1);\n            let t4 = Fp.add(X2, Y2); // step 5\n            t3 = Fp.mul(t3, t4);\n            t4 = Fp.add(t0, t1);\n            t3 = Fp.sub(t3, t4);\n            t4 = Fp.add(X1, Z1);\n            let t5 = Fp.add(X2, Z2); // step 10\n            t4 = Fp.mul(t4, t5);\n            t5 = Fp.add(t0, t2);\n            t4 = Fp.sub(t4, t5);\n            t5 = Fp.add(Y1, Z1);\n            X3 = Fp.add(Y2, Z2); // step 15\n            t5 = Fp.mul(t5, X3);\n            X3 = Fp.add(t1, t2);\n            t5 = Fp.sub(t5, X3);\n            Z3 = Fp.mul(a, t4);\n            X3 = Fp.mul(b3, t2); // step 20\n            Z3 = Fp.add(X3, Z3);\n            X3 = Fp.sub(t1, Z3);\n            Z3 = Fp.add(t1, Z3);\n            Y3 = Fp.mul(X3, Z3);\n            t1 = Fp.add(t0, t0); // step 25\n            t1 = Fp.add(t1, t0);\n            t2 = Fp.mul(a, t2);\n            t4 = Fp.mul(b3, t4);\n            t1 = Fp.add(t1, t2);\n            t2 = Fp.sub(t0, t2); // step 30\n            t2 = Fp.mul(a, t2);\n            t4 = Fp.add(t4, t2);\n            t0 = Fp.mul(t1, t4);\n            Y3 = Fp.add(Y3, t0);\n            t0 = Fp.mul(t5, t4); // step 35\n            X3 = Fp.mul(t3, X3);\n            X3 = Fp.sub(X3, t0);\n            t0 = Fp.mul(t3, t1);\n            Z3 = Fp.mul(t5, Z3);\n            Z3 = Fp.add(Z3, t0); // step 40\n            return new Point(X3, Y3, Z3);\n        }\n        subtract(other) {\n            return this.add(other.negate());\n        }\n        is0() {\n            return this.equals(Point.ZERO);\n        }\n        wNAF(n) {\n            return wnaf.wNAFCached(this, pointPrecomputes, n, (comp) => {\n                const toInv = Fp.invertBatch(comp.map((p) => p.pz));\n                return comp.map((p, i) => p.toAffine(toInv[i])).map(Point.fromAffine);\n            });\n        }\n        /**\n         * Non-constant-time multiplication. Uses double-and-add algorithm.\n         * It's faster, but should only be used when you don't care about\n         * an exposed private key e.g. sig verification, which works over *public* keys.\n         */\n        multiplyUnsafe(n) {\n            const I = Point.ZERO;\n            if (n === _0n)\n                return I;\n            assertGE(n); // Will throw on 0\n            if (n === _1n)\n                return this;\n            const { endo } = CURVE;\n            if (!endo)\n                return wnaf.unsafeLadder(this, n);\n            // Apply endomorphism\n            let { k1neg, k1, k2neg, k2 } = endo.splitScalar(n);\n            let k1p = I;\n            let k2p = I;\n            let d = this;\n            while (k1 > _0n || k2 > _0n) {\n                if (k1 & _1n)\n                    k1p = k1p.add(d);\n                if (k2 & _1n)\n                    k2p = k2p.add(d);\n                d = d.double();\n                k1 >>= _1n;\n                k2 >>= _1n;\n            }\n            if (k1neg)\n                k1p = k1p.negate();\n            if (k2neg)\n                k2p = k2p.negate();\n            k2p = new Point(Fp.mul(k2p.px, endo.beta), k2p.py, k2p.pz);\n            return k1p.add(k2p);\n        }\n        /**\n         * Constant time multiplication.\n         * Uses wNAF method. Windowed method may be 10% faster,\n         * but takes 2x longer to generate and consumes 2x memory.\n         * Uses precomputes when available.\n         * Uses endomorphism for Koblitz curves.\n         * @param scalar by which the point would be multiplied\n         * @returns New point\n         */\n        multiply(scalar) {\n            assertGE(scalar);\n            let n = scalar;\n            let point, fake; // Fake point is used to const-time mult\n            const { endo } = CURVE;\n            if (endo) {\n                const { k1neg, k1, k2neg, k2 } = endo.splitScalar(n);\n                let { p: k1p, f: f1p } = this.wNAF(k1);\n                let { p: k2p, f: f2p } = this.wNAF(k2);\n                k1p = wnaf.constTimeNegate(k1neg, k1p);\n                k2p = wnaf.constTimeNegate(k2neg, k2p);\n                k2p = new Point(Fp.mul(k2p.px, endo.beta), k2p.py, k2p.pz);\n                point = k1p.add(k2p);\n                fake = f1p.add(f2p);\n            }\n            else {\n                const { p, f } = this.wNAF(n);\n                point = p;\n                fake = f;\n            }\n            // Normalize `z` for both points, but return only real one\n            return Point.normalizeZ([point, fake])[0];\n        }\n        /**\n         * Efficiently calculate `aP + bQ`. Unsafe, can expose private key, if used incorrectly.\n         * Not using Strauss-Shamir trick: precomputation tables are faster.\n         * The trick could be useful if both P and Q are not G (not in our case).\n         * @returns non-zero affine point\n         */\n        multiplyAndAddUnsafe(Q, a, b) {\n            const G = Point.BASE; // No Strauss-Shamir trick: we have 10% faster G precomputes\n            const mul = (P, a // Select faster multiply() method\n            ) => (a === _0n || a === _1n || !P.equals(G) ? P.multiplyUnsafe(a) : P.multiply(a));\n            const sum = mul(this, a).add(mul(Q, b));\n            return sum.is0() ? undefined : sum;\n        }\n        // Converts Projective point to affine (x, y) coordinates.\n        // Can accept precomputed Z^-1 - for example, from invertBatch.\n        // (x, y, z) ∋ (x=x/z, y=y/z)\n        toAffine(iz) {\n            const { px: x, py: y, pz: z } = this;\n            const is0 = this.is0();\n            // If invZ was 0, we return zero point. However we still want to execute\n            // all operations, so we replace invZ with a random number, 1.\n            if (iz == null)\n                iz = is0 ? Fp.ONE : Fp.inv(z);\n            const ax = Fp.mul(x, iz);\n            const ay = Fp.mul(y, iz);\n            const zz = Fp.mul(z, iz);\n            if (is0)\n                return { x: Fp.ZERO, y: Fp.ZERO };\n            if (!Fp.eql(zz, Fp.ONE))\n                throw new Error('invZ was invalid');\n            return { x: ax, y: ay };\n        }\n        isTorsionFree() {\n            const { h: cofactor, isTorsionFree } = CURVE;\n            if (cofactor === _1n)\n                return true; // No subgroups, always torsion-free\n            if (isTorsionFree)\n                return isTorsionFree(Point, this);\n            throw new Error('isTorsionFree() has not been declared for the elliptic curve');\n        }\n        clearCofactor() {\n            const { h: cofactor, clearCofactor } = CURVE;\n            if (cofactor === _1n)\n                return this; // Fast-path\n            if (clearCofactor)\n                return clearCofactor(Point, this);\n            return this.multiplyUnsafe(CURVE.h);\n        }\n        toRawBytes(isCompressed = true) {\n            this.assertValidity();\n            return toBytes(Point, this, isCompressed);\n        }\n        toHex(isCompressed = true) {\n            return ut.bytesToHex(this.toRawBytes(isCompressed));\n        }\n    }\n    Point.BASE = new Point(CURVE.Gx, CURVE.Gy, Fp.ONE);\n    Point.ZERO = new Point(Fp.ZERO, Fp.ONE, Fp.ZERO);\n    const _bits = CURVE.nBitLength;\n    const wnaf = wNAF(Point, CURVE.endo ? Math.ceil(_bits / 2) : _bits);\n    // Validate if generator point is on curve\n    return {\n        CURVE,\n        ProjectivePoint: Point,\n        normPrivateKeyToScalar,\n        weierstrassEquation,\n        isWithinCurveOrder,\n    };\n}\nfunction validateOpts(curve) {\n    const opts = validateBasic(curve);\n    ut.validateObject(opts, {\n        hash: 'hash',\n        hmac: 'function',\n        randomBytes: 'function',\n    }, {\n        bits2int: 'function',\n        bits2int_modN: 'function',\n        lowS: 'boolean',\n    });\n    return Object.freeze({ lowS: true, ...opts });\n}\nexport function weierstrass(curveDef) {\n    const CURVE = validateOpts(curveDef);\n    const { Fp, n: CURVE_ORDER } = CURVE;\n    const compressedLen = Fp.BYTES + 1; // e.g. 33 for 32\n    const uncompressedLen = 2 * Fp.BYTES + 1; // e.g. 65 for 32\n    function isValidFieldElement(num) {\n        return _0n < num && num < Fp.ORDER; // 0 is banned since it's not invertible FE\n    }\n    function modN(a) {\n        return mod.mod(a, CURVE_ORDER);\n    }\n    function invN(a) {\n        return mod.invert(a, CURVE_ORDER);\n    }\n    const { ProjectivePoint: Point, normPrivateKeyToScalar, weierstrassEquation, isWithinCurveOrder, } = weierstrassPoints({\n        ...CURVE,\n        toBytes(_c, point, isCompressed) {\n            const a = point.toAffine();\n            const x = Fp.toBytes(a.x);\n            const cat = ut.concatBytes;\n            if (isCompressed) {\n                return cat(Uint8Array.from([point.hasEvenY() ? 0x02 : 0x03]), x);\n            }\n            else {\n                return cat(Uint8Array.from([0x04]), x, Fp.toBytes(a.y));\n            }\n        },\n        fromBytes(bytes) {\n            const len = bytes.length;\n            const head = bytes[0];\n            const tail = bytes.subarray(1);\n            // this.assertValidity() is done inside of fromHex\n            if (len === compressedLen && (head === 0x02 || head === 0x03)) {\n                const x = ut.bytesToNumberBE(tail);\n                if (!isValidFieldElement(x))\n                    throw new Error('Point is not on curve');\n                const y2 = weierstrassEquation(x); // y² = x³ + ax + b\n                let y = Fp.sqrt(y2); // y = y² ^ (p+1)/4\n                const isYOdd = (y & _1n) === _1n;\n                // ECDSA\n                const isHeadOdd = (head & 1) === 1;\n                if (isHeadOdd !== isYOdd)\n                    y = Fp.neg(y);\n                return { x, y };\n            }\n            else if (len === uncompressedLen && head === 0x04) {\n                const x = Fp.fromBytes(tail.subarray(0, Fp.BYTES));\n                const y = Fp.fromBytes(tail.subarray(Fp.BYTES, 2 * Fp.BYTES));\n                return { x, y };\n            }\n            else {\n                throw new Error(`Point of length ${len} was invalid. Expected ${compressedLen} compressed bytes or ${uncompressedLen} uncompressed bytes`);\n            }\n        },\n    });\n    const numToNByteStr = (num) => ut.bytesToHex(ut.numberToBytesBE(num, CURVE.nByteLength));\n    function isBiggerThanHalfOrder(number) {\n        const HALF = CURVE_ORDER >> _1n;\n        return number > HALF;\n    }\n    function normalizeS(s) {\n        return isBiggerThanHalfOrder(s) ? modN(-s) : s;\n    }\n    // slice bytes num\n    const slcNum = (b, from, to) => ut.bytesToNumberBE(b.slice(from, to));\n    /**\n     * ECDSA signature with its (r, s) properties. Supports DER & compact representations.\n     */\n    class Signature {\n        constructor(r, s, recovery) {\n            this.r = r;\n            this.s = s;\n            this.recovery = recovery;\n            this.assertValidity();\n        }\n        // pair (bytes of r, bytes of s)\n        static fromCompact(hex) {\n            const l = CURVE.nByteLength;\n            hex = ensureBytes('compactSignature', hex, l * 2);\n            return new Signature(slcNum(hex, 0, l), slcNum(hex, l, 2 * l));\n        }\n        // DER encoded ECDSA signature\n        // https://bitcoin.stackexchange.com/questions/57644/what-are-the-parts-of-a-bitcoin-transaction-input-script\n        static fromDER(hex) {\n            const { r, s } = DER.toSig(ensureBytes('DER', hex));\n            return new Signature(r, s);\n        }\n        assertValidity() {\n            // can use assertGE here\n            if (!isWithinCurveOrder(this.r))\n                throw new Error('r must be 0 < r < CURVE.n');\n            if (!isWithinCurveOrder(this.s))\n                throw new Error('s must be 0 < s < CURVE.n');\n        }\n        addRecoveryBit(recovery) {\n            return new Signature(this.r, this.s, recovery);\n        }\n        recoverPublicKey(msgHash) {\n            const { r, s, recovery: rec } = this;\n            const h = bits2int_modN(ensureBytes('msgHash', msgHash)); // Truncate hash\n            if (rec == null || ![0, 1, 2, 3].includes(rec))\n                throw new Error('recovery id invalid');\n            const radj = rec === 2 || rec === 3 ? r + CURVE.n : r;\n            if (radj >= Fp.ORDER)\n                throw new Error('recovery id 2 or 3 invalid');\n            const prefix = (rec & 1) === 0 ? '02' : '03';\n            const R = Point.fromHex(prefix + numToNByteStr(radj));\n            const ir = invN(radj); // r^-1\n            const u1 = modN(-h * ir); // -hr^-1\n            const u2 = modN(s * ir); // sr^-1\n            const Q = Point.BASE.multiplyAndAddUnsafe(R, u1, u2); // (sr^-1)R-(hr^-1)G = -(hr^-1)G + (sr^-1)\n            if (!Q)\n                throw new Error('point at infinify'); // unsafe is fine: no priv data leaked\n            Q.assertValidity();\n            return Q;\n        }\n        // Signatures should be low-s, to prevent malleability.\n        hasHighS() {\n            return isBiggerThanHalfOrder(this.s);\n        }\n        normalizeS() {\n            return this.hasHighS() ? new Signature(this.r, modN(-this.s), this.recovery) : this;\n        }\n        // DER-encoded\n        toDERRawBytes() {\n            return ut.hexToBytes(this.toDERHex());\n        }\n        toDERHex() {\n            return DER.hexFromSig({ r: this.r, s: this.s });\n        }\n        // padded bytes of r, then padded bytes of s\n        toCompactRawBytes() {\n            return ut.hexToBytes(this.toCompactHex());\n        }\n        toCompactHex() {\n            return numToNByteStr(this.r) + numToNByteStr(this.s);\n        }\n    }\n    const utils = {\n        isValidPrivateKey(privateKey) {\n            try {\n                normPrivateKeyToScalar(privateKey);\n                return true;\n            }\n            catch (error) {\n                return false;\n            }\n        },\n        normPrivateKeyToScalar: normPrivateKeyToScalar,\n        /**\n         * Produces cryptographically secure private key from random of size\n         * (groupLen + ceil(groupLen / 2)) with modulo bias being negligible.\n         */\n        randomPrivateKey: () => {\n            const length = mod.getMinHashLength(CURVE.n);\n            return mod.mapHashToField(CURVE.randomBytes(length), CURVE.n);\n        },\n        /**\n         * Creates precompute table for an arbitrary EC point. Makes point \"cached\".\n         * Allows to massively speed-up `point.multiply(scalar)`.\n         * @returns cached point\n         * @example\n         * const fast = utils.precompute(8, ProjectivePoint.fromHex(someonesPubKey));\n         * fast.multiply(privKey); // much faster ECDH now\n         */\n        precompute(windowSize = 8, point = Point.BASE) {\n            point._setWindowSize(windowSize);\n            point.multiply(BigInt(3)); // 3 is arbitrary, just need any number here\n            return point;\n        },\n    };\n    /**\n     * Computes public key for a private key. Checks for validity of the private key.\n     * @param privateKey private key\n     * @param isCompressed whether to return compact (default), or full key\n     * @returns Public key, full when isCompressed=false; short when isCompressed=true\n     */\n    function getPublicKey(privateKey, isCompressed = true) {\n        return Point.fromPrivateKey(privateKey).toRawBytes(isCompressed);\n    }\n    /**\n     * Quick and dirty check for item being public key. Does not validate hex, or being on-curve.\n     */\n    function isProbPub(item) {\n        const arr = item instanceof Uint8Array;\n        const str = typeof item === 'string';\n        const len = (arr || str) && item.length;\n        if (arr)\n            return len === compressedLen || len === uncompressedLen;\n        if (str)\n            return len === 2 * compressedLen || len === 2 * uncompressedLen;\n        if (item instanceof Point)\n            return true;\n        return false;\n    }\n    /**\n     * ECDH (Elliptic Curve Diffie Hellman).\n     * Computes shared public key from private key and public key.\n     * Checks: 1) private key validity 2) shared key is on-curve.\n     * Does NOT hash the result.\n     * @param privateA private key\n     * @param publicB different public key\n     * @param isCompressed whether to return compact (default), or full key\n     * @returns shared public key\n     */\n    function getSharedSecret(privateA, publicB, isCompressed = true) {\n        if (isProbPub(privateA))\n            throw new Error('first arg must be private key');\n        if (!isProbPub(publicB))\n            throw new Error('second arg must be public key');\n        const b = Point.fromHex(publicB); // check for being on-curve\n        return b.multiply(normPrivateKeyToScalar(privateA)).toRawBytes(isCompressed);\n    }\n    // RFC6979: ensure ECDSA msg is X bytes and < N. RFC suggests optional truncating via bits2octets.\n    // FIPS 186-4 4.6 suggests the leftmost min(nBitLen, outLen) bits, which matches bits2int.\n    // bits2int can produce res>N, we can do mod(res, N) since the bitLen is the same.\n    // int2octets can't be used; pads small msgs with 0: unacceptatble for trunc as per RFC vectors\n    const bits2int = CURVE.bits2int ||\n        function (bytes) {\n            // For curves with nBitLength % 8 !== 0: bits2octets(bits2octets(m)) !== bits2octets(m)\n            // for some cases, since bytes.length * 8 is not actual bitLength.\n            const num = ut.bytesToNumberBE(bytes); // check for == u8 done here\n            const delta = bytes.length * 8 - CURVE.nBitLength; // truncate to nBitLength leftmost bits\n            return delta > 0 ? num >> BigInt(delta) : num;\n        };\n    const bits2int_modN = CURVE.bits2int_modN ||\n        function (bytes) {\n            return modN(bits2int(bytes)); // can't use bytesToNumberBE here\n        };\n    // NOTE: pads output with zero as per spec\n    const ORDER_MASK = ut.bitMask(CURVE.nBitLength);\n    /**\n     * Converts to bytes. Checks if num in `[0..ORDER_MASK-1]` e.g.: `[0..2^256-1]`.\n     */\n    function int2octets(num) {\n        if (typeof num !== 'bigint')\n            throw new Error('bigint expected');\n        if (!(_0n <= num && num < ORDER_MASK))\n            throw new Error(`bigint expected < 2^${CURVE.nBitLength}`);\n        // works with order, can have different size than numToField!\n        return ut.numberToBytesBE(num, CURVE.nByteLength);\n    }\n    // Steps A, D of RFC6979 3.2\n    // Creates RFC6979 seed; converts msg/privKey to numbers.\n    // Used only in sign, not in verify.\n    // NOTE: we cannot assume here that msgHash has same amount of bytes as curve order, this will be wrong at least for P521.\n    // Also it can be bigger for P224 + SHA256\n    function prepSig(msgHash, privateKey, opts = defaultSigOpts) {\n        if (['recovered', 'canonical'].some((k) => k in opts))\n            throw new Error('sign() legacy options not supported');\n        const { hash, randomBytes } = CURVE;\n        let { lowS, prehash, extraEntropy: ent } = opts; // generates low-s sigs by default\n        if (lowS == null)\n            lowS = true; // RFC6979 3.2: we skip step A, because we already provide hash\n        msgHash = ensureBytes('msgHash', msgHash);\n        if (prehash)\n            msgHash = ensureBytes('prehashed msgHash', hash(msgHash));\n        // We can't later call bits2octets, since nested bits2int is broken for curves\n        // with nBitLength % 8 !== 0. Because of that, we unwrap it here as int2octets call.\n        // const bits2octets = (bits) => int2octets(bits2int_modN(bits))\n        const h1int = bits2int_modN(msgHash);\n        const d = normPrivateKeyToScalar(privateKey); // validate private key, convert to bigint\n        const seedArgs = [int2octets(d), int2octets(h1int)];\n        // extraEntropy. RFC6979 3.6: additional k' (optional).\n        if (ent != null) {\n            // K = HMAC_K(V || 0x00 || int2octets(x) || bits2octets(h1) || k')\n            const e = ent === true ? randomBytes(Fp.BYTES) : ent; // generate random bytes OR pass as-is\n            seedArgs.push(ensureBytes('extraEntropy', e)); // check for being bytes\n        }\n        const seed = ut.concatBytes(...seedArgs); // Step D of RFC6979 3.2\n        const m = h1int; // NOTE: no need to call bits2int second time here, it is inside truncateHash!\n        // Converts signature params into point w r/s, checks result for validity.\n        function k2sig(kBytes) {\n            // RFC 6979 Section 3.2, step 3: k = bits2int(T)\n            const k = bits2int(kBytes); // Cannot use fields methods, since it is group element\n            if (!isWithinCurveOrder(k))\n                return; // Important: all mod() calls here must be done over N\n            const ik = invN(k); // k^-1 mod n\n            const q = Point.BASE.multiply(k).toAffine(); // q = Gk\n            const r = modN(q.x); // r = q.x mod n\n            if (r === _0n)\n                return;\n            // Can use scalar blinding b^-1(bm + bdr) where b ∈ [1,q−1] according to\n            // https://tches.iacr.org/index.php/TCHES/article/view/7337/6509. We've decided against it:\n            // a) dependency on CSPRNG b) 15% slowdown c) doesn't really help since bigints are not CT\n            const s = modN(ik * modN(m + r * d)); // Not using blinding here\n            if (s === _0n)\n                return;\n            let recovery = (q.x === r ? 0 : 2) | Number(q.y & _1n); // recovery bit (2 or 3, when q.x > n)\n            let normS = s;\n            if (lowS && isBiggerThanHalfOrder(s)) {\n                normS = normalizeS(s); // if lowS was passed, ensure s is always\n                recovery ^= 1; // // in the bottom half of N\n            }\n            return new Signature(r, normS, recovery); // use normS, not s\n        }\n        return { seed, k2sig };\n    }\n    const defaultSigOpts = { lowS: CURVE.lowS, prehash: false };\n    const defaultVerOpts = { lowS: CURVE.lowS, prehash: false };\n    /**\n     * Signs message hash with a private key.\n     * ```\n     * sign(m, d, k) where\n     *   (x, y) = G × k\n     *   r = x mod n\n     *   s = (m + dr)/k mod n\n     * ```\n     * @param msgHash NOT message. msg needs to be hashed to `msgHash`, or use `prehash`.\n     * @param privKey private key\n     * @param opts lowS for non-malleable sigs. extraEntropy for mixing randomness into k. prehash will hash first arg.\n     * @returns signature with recovery param\n     */\n    function sign(msgHash, privKey, opts = defaultSigOpts) {\n        const { seed, k2sig } = prepSig(msgHash, privKey, opts); // Steps A, D of RFC6979 3.2.\n        const C = CURVE;\n        const drbg = ut.createHmacDrbg(C.hash.outputLen, C.nByteLength, C.hmac);\n        return drbg(seed, k2sig); // Steps B, C, D, E, F, G\n    }\n    // Enable precomputes. Slows down first publicKey computation by 20ms.\n    Point.BASE._setWindowSize(8);\n    // utils.precompute(8, ProjectivePoint.BASE)\n    /**\n     * Verifies a signature against message hash and public key.\n     * Rejects lowS signatures by default: to override,\n     * specify option `{lowS: false}`. Implements section 4.1.4 from https://www.secg.org/sec1-v2.pdf:\n     *\n     * ```\n     * verify(r, s, h, P) where\n     *   U1 = hs^-1 mod n\n     *   U2 = rs^-1 mod n\n     *   R = U1⋅G - U2⋅P\n     *   mod(R.x, n) == r\n     * ```\n     */\n    function verify(signature, msgHash, publicKey, opts = defaultVerOpts) {\n        const sg = signature;\n        msgHash = ensureBytes('msgHash', msgHash);\n        publicKey = ensureBytes('publicKey', publicKey);\n        if ('strict' in opts)\n            throw new Error('options.strict was renamed to lowS');\n        const { lowS, prehash } = opts;\n        let _sig = undefined;\n        let P;\n        try {\n            if (typeof sg === 'string' || sg instanceof Uint8Array) {\n                // Signature can be represented in 2 ways: compact (2*nByteLength) & DER (variable-length).\n                // Since DER can also be 2*nByteLength bytes, we check for it first.\n                try {\n                    _sig = Signature.fromDER(sg);\n                }\n                catch (derError) {\n                    if (!(derError instanceof DER.Err))\n                        throw derError;\n                    _sig = Signature.fromCompact(sg);\n                }\n            }\n            else if (typeof sg === 'object' && typeof sg.r === 'bigint' && typeof sg.s === 'bigint') {\n                const { r, s } = sg;\n                _sig = new Signature(r, s);\n            }\n            else {\n                throw new Error('PARSE');\n            }\n            P = Point.fromHex(publicKey);\n        }\n        catch (error) {\n            if (error.message === 'PARSE')\n                throw new Error(`signature must be Signature instance, Uint8Array or hex string`);\n            return false;\n        }\n        if (lowS && _sig.hasHighS())\n            return false;\n        if (prehash)\n            msgHash = CURVE.hash(msgHash);\n        const { r, s } = _sig;\n        const h = bits2int_modN(msgHash); // Cannot use fields methods, since it is group element\n        const is = invN(s); // s^-1\n        const u1 = modN(h * is); // u1 = hs^-1 mod n\n        const u2 = modN(r * is); // u2 = rs^-1 mod n\n        const R = Point.BASE.multiplyAndAddUnsafe(P, u1, u2)?.toAffine(); // R = u1⋅G + u2⋅P\n        if (!R)\n            return false;\n        const v = modN(R.x);\n        return v === r;\n    }\n    return {\n        CURVE,\n        getPublicKey,\n        getSharedSecret,\n        sign,\n        verify,\n        ProjectivePoint: Point,\n        Signature,\n        utils,\n    };\n}\n/**\n * Implementation of the Shallue and van de Woestijne method for any weierstrass curve.\n * TODO: check if there is a way to merge this with uvRatio in Edwards; move to modular.\n * b = True and y = sqrt(u / v) if (u / v) is square in F, and\n * b = False and y = sqrt(Z * (u / v)) otherwise.\n * @param Fp\n * @param Z\n * @returns\n */\nexport function SWUFpSqrtRatio(Fp, Z) {\n    // Generic implementation\n    const q = Fp.ORDER;\n    let l = _0n;\n    for (let o = q - _1n; o % _2n === _0n; o /= _2n)\n        l += _1n;\n    const c1 = l; // 1. c1, the largest integer such that 2^c1 divides q - 1.\n    // We need 2n ** c1 and 2n ** (c1-1). We can't use **; but we can use <<.\n    // 2n ** c1 == 2n << (c1-1)\n    const _2n_pow_c1_1 = _2n << (c1 - _1n - _1n);\n    const _2n_pow_c1 = _2n_pow_c1_1 * _2n;\n    const c2 = (q - _1n) / _2n_pow_c1; // 2. c2 = (q - 1) / (2^c1)  # Integer arithmetic\n    const c3 = (c2 - _1n) / _2n; // 3. c3 = (c2 - 1) / 2            # Integer arithmetic\n    const c4 = _2n_pow_c1 - _1n; // 4. c4 = 2^c1 - 1                # Integer arithmetic\n    const c5 = _2n_pow_c1_1; // 5. c5 = 2^(c1 - 1)                  # Integer arithmetic\n    const c6 = Fp.pow(Z, c2); // 6. c6 = Z^c2\n    const c7 = Fp.pow(Z, (c2 + _1n) / _2n); // 7. c7 = Z^((c2 + 1) / 2)\n    let sqrtRatio = (u, v) => {\n        let tv1 = c6; // 1. tv1 = c6\n        let tv2 = Fp.pow(v, c4); // 2. tv2 = v^c4\n        let tv3 = Fp.sqr(tv2); // 3. tv3 = tv2^2\n        tv3 = Fp.mul(tv3, v); // 4. tv3 = tv3 * v\n        let tv5 = Fp.mul(u, tv3); // 5. tv5 = u * tv3\n        tv5 = Fp.pow(tv5, c3); // 6. tv5 = tv5^c3\n        tv5 = Fp.mul(tv5, tv2); // 7. tv5 = tv5 * tv2\n        tv2 = Fp.mul(tv5, v); // 8. tv2 = tv5 * v\n        tv3 = Fp.mul(tv5, u); // 9. tv3 = tv5 * u\n        let tv4 = Fp.mul(tv3, tv2); // 10. tv4 = tv3 * tv2\n        tv5 = Fp.pow(tv4, c5); // 11. tv5 = tv4^c5\n        let isQR = Fp.eql(tv5, Fp.ONE); // 12. isQR = tv5 == 1\n        tv2 = Fp.mul(tv3, c7); // 13. tv2 = tv3 * c7\n        tv5 = Fp.mul(tv4, tv1); // 14. tv5 = tv4 * tv1\n        tv3 = Fp.cmov(tv2, tv3, isQR); // 15. tv3 = CMOV(tv2, tv3, isQR)\n        tv4 = Fp.cmov(tv5, tv4, isQR); // 16. tv4 = CMOV(tv5, tv4, isQR)\n        // 17. for i in (c1, c1 - 1, ..., 2):\n        for (let i = c1; i > _1n; i--) {\n            let tv5 = i - _2n; // 18.    tv5 = i - 2\n            tv5 = _2n << (tv5 - _1n); // 19.    tv5 = 2^tv5\n            let tvv5 = Fp.pow(tv4, tv5); // 20.    tv5 = tv4^tv5\n            const e1 = Fp.eql(tvv5, Fp.ONE); // 21.    e1 = tv5 == 1\n            tv2 = Fp.mul(tv3, tv1); // 22.    tv2 = tv3 * tv1\n            tv1 = Fp.mul(tv1, tv1); // 23.    tv1 = tv1 * tv1\n            tvv5 = Fp.mul(tv4, tv1); // 24.    tv5 = tv4 * tv1\n            tv3 = Fp.cmov(tv2, tv3, e1); // 25.    tv3 = CMOV(tv2, tv3, e1)\n            tv4 = Fp.cmov(tvv5, tv4, e1); // 26.    tv4 = CMOV(tv5, tv4, e1)\n        }\n        return { isValid: isQR, value: tv3 };\n    };\n    if (Fp.ORDER % _4n === _3n) {\n        // sqrt_ratio_3mod4(u, v)\n        const c1 = (Fp.ORDER - _3n) / _4n; // 1. c1 = (q - 3) / 4     # Integer arithmetic\n        const c2 = Fp.sqrt(Fp.neg(Z)); // 2. c2 = sqrt(-Z)\n        sqrtRatio = (u, v) => {\n            let tv1 = Fp.sqr(v); // 1. tv1 = v^2\n            const tv2 = Fp.mul(u, v); // 2. tv2 = u * v\n            tv1 = Fp.mul(tv1, tv2); // 3. tv1 = tv1 * tv2\n            let y1 = Fp.pow(tv1, c1); // 4. y1 = tv1^c1\n            y1 = Fp.mul(y1, tv2); // 5. y1 = y1 * tv2\n            const y2 = Fp.mul(y1, c2); // 6. y2 = y1 * c2\n            const tv3 = Fp.mul(Fp.sqr(y1), v); // 7. tv3 = y1^2; 8. tv3 = tv3 * v\n            const isQR = Fp.eql(tv3, u); // 9. isQR = tv3 == u\n            let y = Fp.cmov(y2, y1, isQR); // 10. y = CMOV(y2, y1, isQR)\n            return { isValid: isQR, value: y }; // 11. return (isQR, y) isQR ? y : y*c2\n        };\n    }\n    // No curves uses that\n    // if (Fp.ORDER % _8n === _5n) // sqrt_ratio_5mod8\n    return sqrtRatio;\n}\n/**\n * Simplified Shallue-van de Woestijne-Ulas Method\n * https://www.rfc-editor.org/rfc/rfc9380#section-6.6.2\n */\nexport function mapToCurveSimpleSWU(Fp, opts) {\n    mod.validateField(Fp);\n    if (!Fp.isValid(opts.A) || !Fp.isValid(opts.B) || !Fp.isValid(opts.Z))\n        throw new Error('mapToCurveSimpleSWU: invalid opts');\n    const sqrtRatio = SWUFpSqrtRatio(Fp, opts.Z);\n    if (!Fp.isOdd)\n        throw new Error('Fp.isOdd is not implemented!');\n    // Input: u, an element of F.\n    // Output: (x, y), a point on E.\n    return (u) => {\n        // prettier-ignore\n        let tv1, tv2, tv3, tv4, tv5, tv6, x, y;\n        tv1 = Fp.sqr(u); // 1.  tv1 = u^2\n        tv1 = Fp.mul(tv1, opts.Z); // 2.  tv1 = Z * tv1\n        tv2 = Fp.sqr(tv1); // 3.  tv2 = tv1^2\n        tv2 = Fp.add(tv2, tv1); // 4.  tv2 = tv2 + tv1\n        tv3 = Fp.add(tv2, Fp.ONE); // 5.  tv3 = tv2 + 1\n        tv3 = Fp.mul(tv3, opts.B); // 6.  tv3 = B * tv3\n        tv4 = Fp.cmov(opts.Z, Fp.neg(tv2), !Fp.eql(tv2, Fp.ZERO)); // 7.  tv4 = CMOV(Z, -tv2, tv2 != 0)\n        tv4 = Fp.mul(tv4, opts.A); // 8.  tv4 = A * tv4\n        tv2 = Fp.sqr(tv3); // 9.  tv2 = tv3^2\n        tv6 = Fp.sqr(tv4); // 10. tv6 = tv4^2\n        tv5 = Fp.mul(tv6, opts.A); // 11. tv5 = A * tv6\n        tv2 = Fp.add(tv2, tv5); // 12. tv2 = tv2 + tv5\n        tv2 = Fp.mul(tv2, tv3); // 13. tv2 = tv2 * tv3\n        tv6 = Fp.mul(tv6, tv4); // 14. tv6 = tv6 * tv4\n        tv5 = Fp.mul(tv6, opts.B); // 15. tv5 = B * tv6\n        tv2 = Fp.add(tv2, tv5); // 16. tv2 = tv2 + tv5\n        x = Fp.mul(tv1, tv3); // 17.   x = tv1 * tv3\n        const { isValid, value } = sqrtRatio(tv2, tv6); // 18. (is_gx1_square, y1) = sqrt_ratio(tv2, tv6)\n        y = Fp.mul(tv1, u); // 19.   y = tv1 * u  -> Z * u^3 * y1\n        y = Fp.mul(y, value); // 20.   y = y * y1\n        x = Fp.cmov(x, tv3, isValid); // 21.   x = CMOV(x, tv3, is_gx1_square)\n        y = Fp.cmov(y, value, isValid); // 22.   y = CMOV(y, y1, is_gx1_square)\n        const e1 = Fp.isOdd(u) === Fp.isOdd(y); // 23.  e1 = sgn0(u) == sgn0(y)\n        y = Fp.cmov(Fp.neg(y), y, e1); // 24.   y = CMOV(-y, y, e1)\n        x = Fp.div(x, tv4); // 25.   x = x / tv4\n        return { x, y };\n    };\n}\n//# sourceMappingURL=weierstrass.js.map","import { hash as assertHash, bytes as assertBytes, exists as assertExists } from './_assert.js';\nimport { Hash, toBytes } from './utils.js';\n// HMAC (RFC 2104)\nexport class HMAC extends Hash {\n    constructor(hash, _key) {\n        super();\n        this.finished = false;\n        this.destroyed = false;\n        assertHash(hash);\n        const key = toBytes(_key);\n        this.iHash = hash.create();\n        if (typeof this.iHash.update !== 'function')\n            throw new Error('Expected instance of class which extends utils.Hash');\n        this.blockLen = this.iHash.blockLen;\n        this.outputLen = this.iHash.outputLen;\n        const blockLen = this.blockLen;\n        const pad = new Uint8Array(blockLen);\n        // blockLen can be bigger than outputLen\n        pad.set(key.length > blockLen ? hash.create().update(key).digest() : key);\n        for (let i = 0; i < pad.length; i++)\n            pad[i] ^= 0x36;\n        this.iHash.update(pad);\n        // By doing update (processing of first block) of outer hash here we can re-use it between multiple calls via clone\n        this.oHash = hash.create();\n        // Undo internal XOR && apply outer XOR\n        for (let i = 0; i < pad.length; i++)\n            pad[i] ^= 0x36 ^ 0x5c;\n        this.oHash.update(pad);\n        pad.fill(0);\n    }\n    update(buf) {\n        assertExists(this);\n        this.iHash.update(buf);\n        return this;\n    }\n    digestInto(out) {\n        assertExists(this);\n        assertBytes(out, this.outputLen);\n        this.finished = true;\n        this.iHash.digestInto(out);\n        this.oHash.update(out);\n        this.oHash.digestInto(out);\n        this.destroy();\n    }\n    digest() {\n        const out = new Uint8Array(this.oHash.outputLen);\n        this.digestInto(out);\n        return out;\n    }\n    _cloneInto(to) {\n        // Create new instance without calling constructor since key already in state and we don't know it.\n        to || (to = Object.create(Object.getPrototypeOf(this), {}));\n        const { oHash, iHash, finished, destroyed, blockLen, outputLen } = this;\n        to = to;\n        to.finished = finished;\n        to.destroyed = destroyed;\n        to.blockLen = blockLen;\n        to.outputLen = outputLen;\n        to.oHash = oHash._cloneInto(to.oHash);\n        to.iHash = iHash._cloneInto(to.iHash);\n        return to;\n    }\n    destroy() {\n        this.destroyed = true;\n        this.oHash.destroy();\n        this.iHash.destroy();\n    }\n}\n/**\n * HMAC: RFC2104 message authentication code.\n * @param hash - function that would be used e.g. sha256\n * @param key - message key\n * @param message - message data\n */\nexport const hmac = (hash, key, message) => new HMAC(hash, key).update(message).digest();\nhmac.create = (hash, key) => new HMAC(hash, key);\n//# sourceMappingURL=hmac.js.map","/*! noble-curves - MIT License (c) 2022 Paul Miller (paulmillr.com) */\nimport { hmac } from '@noble/hashes/hmac';\nimport { concatBytes, randomBytes } from '@noble/hashes/utils';\nimport { weierstrass } from './abstract/weierstrass.js';\n// connects noble-curves to noble-hashes\nexport function getHash(hash) {\n    return {\n        hash,\n        hmac: (key, ...msgs) => hmac(hash, key, concatBytes(...msgs)),\n        randomBytes,\n    };\n}\nexport function createCurve(curveDef, defHash) {\n    const create = (hash) => weierstrass({ ...curveDef, ...getHash(hash) });\n    return Object.freeze({ ...create(defHash), create });\n}\n//# sourceMappingURL=_shortw_utils.js.map","/*! noble-curves - MIT License (c) 2022 Paul Miller (paulmillr.com) */\nimport { sha256 } from '@noble/hashes/sha256';\nimport { randomBytes } from '@noble/hashes/utils';\nimport { Field, mod, pow2 } from './abstract/modular.js';\nimport { mapToCurveSimpleSWU } from './abstract/weierstrass.js';\nimport { bytesToNumberBE, concatBytes, ensureBytes, numberToBytesBE } from './abstract/utils.js';\nimport { createHasher, isogenyMap } from './abstract/hash-to-curve.js';\nimport { createCurve } from './_shortw_utils.js';\nconst secp256k1P = BigInt('0xfffffffffffffffffffffffffffffffffffffffffffffffffffffffefffffc2f');\nconst secp256k1N = BigInt('0xfffffffffffffffffffffffffffffffebaaedce6af48a03bbfd25e8cd0364141');\nconst _1n = BigInt(1);\nconst _2n = BigInt(2);\nconst divNearest = (a, b) => (a + b / _2n) / b;\n/**\n * √n = n^((p+1)/4) for fields p = 3 mod 4. We unwrap the loop and multiply bit-by-bit.\n * (P+1n/4n).toString(2) would produce bits [223x 1, 0, 22x 1, 4x 0, 11, 00]\n */\nfunction sqrtMod(y) {\n    const P = secp256k1P;\n    // prettier-ignore\n    const _3n = BigInt(3), _6n = BigInt(6), _11n = BigInt(11), _22n = BigInt(22);\n    // prettier-ignore\n    const _23n = BigInt(23), _44n = BigInt(44), _88n = BigInt(88);\n    const b2 = (y * y * y) % P; // x^3, 11\n    const b3 = (b2 * b2 * y) % P; // x^7\n    const b6 = (pow2(b3, _3n, P) * b3) % P;\n    const b9 = (pow2(b6, _3n, P) * b3) % P;\n    const b11 = (pow2(b9, _2n, P) * b2) % P;\n    const b22 = (pow2(b11, _11n, P) * b11) % P;\n    const b44 = (pow2(b22, _22n, P) * b22) % P;\n    const b88 = (pow2(b44, _44n, P) * b44) % P;\n    const b176 = (pow2(b88, _88n, P) * b88) % P;\n    const b220 = (pow2(b176, _44n, P) * b44) % P;\n    const b223 = (pow2(b220, _3n, P) * b3) % P;\n    const t1 = (pow2(b223, _23n, P) * b22) % P;\n    const t2 = (pow2(t1, _6n, P) * b2) % P;\n    const root = pow2(t2, _2n, P);\n    if (!Fp.eql(Fp.sqr(root), y))\n        throw new Error('Cannot find square root');\n    return root;\n}\nconst Fp = Field(secp256k1P, undefined, undefined, { sqrt: sqrtMod });\nexport const secp256k1 = createCurve({\n    a: BigInt(0),\n    b: BigInt(7),\n    Fp,\n    n: secp256k1N,\n    // Base point (x, y) aka generator point\n    Gx: BigInt('55066263022277343669578718895168534326250603453777594175500187360389116729240'),\n    Gy: BigInt('32670510020758816978083085130507043184471273380659243275938904335757337482424'),\n    h: BigInt(1),\n    lowS: true,\n    /**\n     * secp256k1 belongs to Koblitz curves: it has efficiently computable endomorphism.\n     * Endomorphism uses 2x less RAM, speeds up precomputation by 2x and ECDH / key recovery by 20%.\n     * For precomputed wNAF it trades off 1/2 init time & 1/3 ram for 20% perf hit.\n     * Explanation: https://gist.github.com/paulmillr/eb670806793e84df628a7c434a873066\n     */\n    endo: {\n        beta: BigInt('0x7ae96a2b657c07106e64479eac3434e99cf0497512f58995c1396c28719501ee'),\n        splitScalar: (k) => {\n            const n = secp256k1N;\n            const a1 = BigInt('0x3086d221a7d46bcde86c90e49284eb15');\n            const b1 = -_1n * BigInt('0xe4437ed6010e88286f547fa90abfe4c3');\n            const a2 = BigInt('0x114ca50f7a8e2f3f657c1108d9d44cfd8');\n            const b2 = a1;\n            const POW_2_128 = BigInt('0x100000000000000000000000000000000'); // (2n**128n).toString(16)\n            const c1 = divNearest(b2 * k, n);\n            const c2 = divNearest(-b1 * k, n);\n            let k1 = mod(k - c1 * a1 - c2 * a2, n);\n            let k2 = mod(-c1 * b1 - c2 * b2, n);\n            const k1neg = k1 > POW_2_128;\n            const k2neg = k2 > POW_2_128;\n            if (k1neg)\n                k1 = n - k1;\n            if (k2neg)\n                k2 = n - k2;\n            if (k1 > POW_2_128 || k2 > POW_2_128) {\n                throw new Error('splitScalar: Endomorphism failed, k=' + k);\n            }\n            return { k1neg, k1, k2neg, k2 };\n        },\n    },\n}, sha256);\n// Schnorr signatures are superior to ECDSA from above. Below is Schnorr-specific BIP0340 code.\n// https://github.com/bitcoin/bips/blob/master/bip-0340.mediawiki\nconst _0n = BigInt(0);\nconst fe = (x) => typeof x === 'bigint' && _0n < x && x < secp256k1P;\nconst ge = (x) => typeof x === 'bigint' && _0n < x && x < secp256k1N;\n/** An object mapping tags to their tagged hash prefix of [SHA256(tag) | SHA256(tag)] */\nconst TAGGED_HASH_PREFIXES = {};\nfunction taggedHash(tag, ...messages) {\n    let tagP = TAGGED_HASH_PREFIXES[tag];\n    if (tagP === undefined) {\n        const tagH = sha256(Uint8Array.from(tag, (c) => c.charCodeAt(0)));\n        tagP = concatBytes(tagH, tagH);\n        TAGGED_HASH_PREFIXES[tag] = tagP;\n    }\n    return sha256(concatBytes(tagP, ...messages));\n}\n// ECDSA compact points are 33-byte. Schnorr is 32: we strip first byte 0x02 or 0x03\nconst pointToBytes = (point) => point.toRawBytes(true).slice(1);\nconst numTo32b = (n) => numberToBytesBE(n, 32);\nconst modP = (x) => mod(x, secp256k1P);\nconst modN = (x) => mod(x, secp256k1N);\nconst Point = secp256k1.ProjectivePoint;\nconst GmulAdd = (Q, a, b) => Point.BASE.multiplyAndAddUnsafe(Q, a, b);\n// Calculate point, scalar and bytes\nfunction schnorrGetExtPubKey(priv) {\n    let d_ = secp256k1.utils.normPrivateKeyToScalar(priv); // same method executed in fromPrivateKey\n    let p = Point.fromPrivateKey(d_); // P = d'⋅G; 0 < d' < n check is done inside\n    const scalar = p.hasEvenY() ? d_ : modN(-d_);\n    return { scalar: scalar, bytes: pointToBytes(p) };\n}\n/**\n * lift_x from BIP340. Convert 32-byte x coordinate to elliptic curve point.\n * @returns valid point checked for being on-curve\n */\nfunction lift_x(x) {\n    if (!fe(x))\n        throw new Error('bad x: need 0 < x < p'); // Fail if x ≥ p.\n    const xx = modP(x * x);\n    const c = modP(xx * x + BigInt(7)); // Let c = x³ + 7 mod p.\n    let y = sqrtMod(c); // Let y = c^(p+1)/4 mod p.\n    if (y % _2n !== _0n)\n        y = modP(-y); // Return the unique point P such that x(P) = x and\n    const p = new Point(x, y, _1n); // y(P) = y if y mod 2 = 0 or y(P) = p-y otherwise.\n    p.assertValidity();\n    return p;\n}\n/**\n * Create tagged hash, convert it to bigint, reduce modulo-n.\n */\nfunction challenge(...args) {\n    return modN(bytesToNumberBE(taggedHash('BIP0340/challenge', ...args)));\n}\n/**\n * Schnorr public key is just `x` coordinate of Point as per BIP340.\n */\nfunction schnorrGetPublicKey(privateKey) {\n    return schnorrGetExtPubKey(privateKey).bytes; // d'=int(sk). Fail if d'=0 or d'≥n. Ret bytes(d'⋅G)\n}\n/**\n * Creates Schnorr signature as per BIP340. Verifies itself before returning anything.\n * auxRand is optional and is not the sole source of k generation: bad CSPRNG won't be dangerous.\n */\nfunction schnorrSign(message, privateKey, auxRand = randomBytes(32)) {\n    const m = ensureBytes('message', message);\n    const { bytes: px, scalar: d } = schnorrGetExtPubKey(privateKey); // checks for isWithinCurveOrder\n    const a = ensureBytes('auxRand', auxRand, 32); // Auxiliary random data a: a 32-byte array\n    const t = numTo32b(d ^ bytesToNumberBE(taggedHash('BIP0340/aux', a))); // Let t be the byte-wise xor of bytes(d) and hash/aux(a)\n    const rand = taggedHash('BIP0340/nonce', t, px, m); // Let rand = hash/nonce(t || bytes(P) || m)\n    const k_ = modN(bytesToNumberBE(rand)); // Let k' = int(rand) mod n\n    if (k_ === _0n)\n        throw new Error('sign failed: k is zero'); // Fail if k' = 0.\n    const { bytes: rx, scalar: k } = schnorrGetExtPubKey(k_); // Let R = k'⋅G.\n    const e = challenge(rx, px, m); // Let e = int(hash/challenge(bytes(R) || bytes(P) || m)) mod n.\n    const sig = new Uint8Array(64); // Let sig = bytes(R) || bytes((k + ed) mod n).\n    sig.set(rx, 0);\n    sig.set(numTo32b(modN(k + e * d)), 32);\n    // If Verify(bytes(P), m, sig) (see below) returns failure, abort\n    if (!schnorrVerify(sig, m, px))\n        throw new Error('sign: Invalid signature produced');\n    return sig;\n}\n/**\n * Verifies Schnorr signature.\n * Will swallow errors & return false except for initial type validation of arguments.\n */\nfunction schnorrVerify(signature, message, publicKey) {\n    const sig = ensureBytes('signature', signature, 64);\n    const m = ensureBytes('message', message);\n    const pub = ensureBytes('publicKey', publicKey, 32);\n    try {\n        const P = lift_x(bytesToNumberBE(pub)); // P = lift_x(int(pk)); fail if that fails\n        const r = bytesToNumberBE(sig.subarray(0, 32)); // Let r = int(sig[0:32]); fail if r ≥ p.\n        if (!fe(r))\n            return false;\n        const s = bytesToNumberBE(sig.subarray(32, 64)); // Let s = int(sig[32:64]); fail if s ≥ n.\n        if (!ge(s))\n            return false;\n        const e = challenge(numTo32b(r), pointToBytes(P), m); // int(challenge(bytes(r)||bytes(P)||m))%n\n        const R = GmulAdd(P, s, modN(-e)); // R = s⋅G - e⋅P\n        if (!R || !R.hasEvenY() || R.toAffine().x !== r)\n            return false; // -eP == (n-e)P\n        return true; // Fail if is_infinite(R) / not has_even_y(R) / x(R) ≠ r.\n    }\n    catch (error) {\n        return false;\n    }\n}\nexport const schnorr = /* @__PURE__ */ (() => ({\n    getPublicKey: schnorrGetPublicKey,\n    sign: schnorrSign,\n    verify: schnorrVerify,\n    utils: {\n        randomPrivateKey: secp256k1.utils.randomPrivateKey,\n        lift_x,\n        pointToBytes,\n        numberToBytesBE,\n        bytesToNumberBE,\n        taggedHash,\n        mod,\n    },\n}))();\nconst isoMap = /* @__PURE__ */ (() => isogenyMap(Fp, [\n    // xNum\n    [\n        '0x8e38e38e38e38e38e38e38e38e38e38e38e38e38e38e38e38e38e38daaaaa8c7',\n        '0x7d3d4c80bc321d5b9f315cea7fd44c5d595d2fc0bf63b92dfff1044f17c6581',\n        '0x534c328d23f234e6e2a413deca25caece4506144037c40314ecbd0b53d9dd262',\n        '0x8e38e38e38e38e38e38e38e38e38e38e38e38e38e38e38e38e38e38daaaaa88c',\n    ],\n    // xDen\n    [\n        '0xd35771193d94918a9ca34ccbb7b640dd86cd409542f8487d9fe6b745781eb49b',\n        '0xedadc6f64383dc1df7c4b2d51b54225406d36b641f5e41bbc52a56612a8c6d14',\n        '0x0000000000000000000000000000000000000000000000000000000000000001', // LAST 1\n    ],\n    // yNum\n    [\n        '0x4bda12f684bda12f684bda12f684bda12f684bda12f684bda12f684b8e38e23c',\n        '0xc75e0c32d5cb7c0fa9d0a54b12a0a6d5647ab046d686da6fdffc90fc201d71a3',\n        '0x29a6194691f91a73715209ef6512e576722830a201be2018a765e85a9ecee931',\n        '0x2f684bda12f684bda12f684bda12f684bda12f684bda12f684bda12f38e38d84',\n    ],\n    // yDen\n    [\n        '0xfffffffffffffffffffffffffffffffffffffffffffffffffffffffefffff93b',\n        '0x7a06534bb8bdb49fd5e9e6632722c2989467c1bfc8e8d978dfb425d2685c2573',\n        '0x6484aa716545ca2cf3a70c3fa8fe337e0a3d21162f0d6299a7bf8192bfd2a76f',\n        '0x0000000000000000000000000000000000000000000000000000000000000001', // LAST 1\n    ],\n].map((i) => i.map((j) => BigInt(j)))))();\nconst mapSWU = /* @__PURE__ */ (() => mapToCurveSimpleSWU(Fp, {\n    A: BigInt('0x3f8731abdd661adca08a5558f0f5d272e953d363cb6f0e5d405447c01a444533'),\n    B: BigInt('1771'),\n    Z: Fp.create(BigInt('-11')),\n}))();\nconst htf = /* @__PURE__ */ (() => createHasher(secp256k1.ProjectivePoint, (scalars) => {\n    const { x, y } = mapSWU(Fp.create(scalars[0]));\n    return isoMap(x, y);\n}, {\n    DST: 'secp256k1_XMD:SHA-256_SSWU_RO_',\n    encodeDST: 'secp256k1_XMD:SHA-256_SSWU_NU_',\n    p: Fp.ORDER,\n    m: 1,\n    k: 128,\n    expand: 'xmd',\n    hash: sha256,\n}))();\nexport const hashToCurve = /* @__PURE__ */ (() => htf.hashToCurve)();\nexport const encodeToCurve = /* @__PURE__ */ (() => htf.encodeToCurve)();\n//# sourceMappingURL=secp256k1.js.map","export const crypto = typeof globalThis === 'object' && 'crypto' in globalThis ? globalThis.crypto : undefined;\n//# sourceMappingURL=crypto.js.map","/*! noble-hashes - MIT License (c) 2022 Paul Miller (paulmillr.com) */\n// We use WebCrypto aka globalThis.crypto, which exists in browsers and node.js 16+.\n// node.js versions earlier than v19 don't declare it in global scope.\n// For node.js, package.json#exports field mapping rewrites import\n// from `crypto` to `cryptoNode`, which imports native module.\n// Makes the utils un-importable in browsers without a bundler.\n// Once node.js 18 is deprecated, we can just drop the import.\nimport { crypto } from '@noble/hashes/crypto';\nconst u8a = (a) => a instanceof Uint8Array;\n// Cast array to different type\nexport const u8 = (arr) => new Uint8Array(arr.buffer, arr.byteOffset, arr.byteLength);\nexport const u32 = (arr) => new Uint32Array(arr.buffer, arr.byteOffset, Math.floor(arr.byteLength / 4));\n// Cast array to view\nexport const createView = (arr) => new DataView(arr.buffer, arr.byteOffset, arr.byteLength);\n// The rotate right (circular right shift) operation for uint32\nexport const rotr = (word, shift) => (word << (32 - shift)) | (word >>> shift);\n// big-endian hardware is rare. Just in case someone still decides to run hashes:\n// early-throw an error because we don't support BE yet.\nexport const isLE = new Uint8Array(new Uint32Array([0x11223344]).buffer)[0] === 0x44;\nif (!isLE)\n    throw new Error('Non little-endian hardware is not supported');\nconst hexes = Array.from({ length: 256 }, (v, i) => i.toString(16).padStart(2, '0'));\n/**\n * @example bytesToHex(Uint8Array.from([0xca, 0xfe, 0x01, 0x23])) // 'cafe0123'\n */\nexport function bytesToHex(bytes) {\n    if (!u8a(bytes))\n        throw new Error('Uint8Array expected');\n    // pre-caching improves the speed 6x\n    let hex = '';\n    for (let i = 0; i < bytes.length; i++) {\n        hex += hexes[bytes[i]];\n    }\n    return hex;\n}\n/**\n * @example hexToBytes('cafe0123') // Uint8Array.from([0xca, 0xfe, 0x01, 0x23])\n */\nexport function hexToBytes(hex) {\n    if (typeof hex !== 'string')\n        throw new Error('hex string expected, got ' + typeof hex);\n    const len = hex.length;\n    if (len % 2)\n        throw new Error('padded hex string expected, got unpadded hex of length ' + len);\n    const array = new Uint8Array(len / 2);\n    for (let i = 0; i < array.length; i++) {\n        const j = i * 2;\n        const hexByte = hex.slice(j, j + 2);\n        const byte = Number.parseInt(hexByte, 16);\n        if (Number.isNaN(byte) || byte < 0)\n            throw new Error('Invalid byte sequence');\n        array[i] = byte;\n    }\n    return array;\n}\n// There is no setImmediate in browser and setTimeout is slow.\n// call of async fn will return Promise, which will be fullfiled only on\n// next scheduler queue processing step and this is exactly what we need.\nexport const nextTick = async () => { };\n// Returns control to thread each 'tick' ms to avoid blocking\nexport async function asyncLoop(iters, tick, cb) {\n    let ts = Date.now();\n    for (let i = 0; i < iters; i++) {\n        cb(i);\n        // Date.now() is not monotonic, so in case if clock goes backwards we return return control too\n        const diff = Date.now() - ts;\n        if (diff >= 0 && diff < tick)\n            continue;\n        await nextTick();\n        ts += diff;\n    }\n}\n/**\n * @example utf8ToBytes('abc') // new Uint8Array([97, 98, 99])\n */\nexport function utf8ToBytes(str) {\n    if (typeof str !== 'string')\n        throw new Error(`utf8ToBytes expected string, got ${typeof str}`);\n    return new Uint8Array(new TextEncoder().encode(str)); // https://bugzil.la/1681809\n}\n/**\n * Normalizes (non-hex) string or Uint8Array to Uint8Array.\n * Warning: when Uint8Array is passed, it would NOT get copied.\n * Keep in mind for future mutable operations.\n */\nexport function toBytes(data) {\n    if (typeof data === 'string')\n        data = utf8ToBytes(data);\n    if (!u8a(data))\n        throw new Error(`expected Uint8Array, got ${typeof data}`);\n    return data;\n}\n/**\n * Copies several Uint8Arrays into one.\n */\nexport function concatBytes(...arrays) {\n    const r = new Uint8Array(arrays.reduce((sum, a) => sum + a.length, 0));\n    let pad = 0; // walk through each item, ensure they have proper type\n    arrays.forEach((a) => {\n        if (!u8a(a))\n            throw new Error('Uint8Array expected');\n        r.set(a, pad);\n        pad += a.length;\n    });\n    return r;\n}\n// For runtime check if class implements interface\nexport class Hash {\n    // Safe version that clones internal state\n    clone() {\n        return this._cloneInto();\n    }\n}\n// Check if object doens't have custom constructor (like Uint8Array/Array)\nconst isPlainObject = (obj) => Object.prototype.toString.call(obj) === '[object Object]' && obj.constructor === Object;\nexport function checkOpts(defaults, opts) {\n    if (opts !== undefined && (typeof opts !== 'object' || !isPlainObject(opts)))\n        throw new Error('Options should be object or undefined');\n    const merged = Object.assign(defaults, opts);\n    return merged;\n}\nexport function wrapConstructor(hashCons) {\n    const hashC = (msg) => hashCons().update(toBytes(msg)).digest();\n    const tmp = hashCons();\n    hashC.outputLen = tmp.outputLen;\n    hashC.blockLen = tmp.blockLen;\n    hashC.create = () => hashCons();\n    return hashC;\n}\nexport function wrapConstructorWithOpts(hashCons) {\n    const hashC = (msg, opts) => hashCons(opts).update(toBytes(msg)).digest();\n    const tmp = hashCons({});\n    hashC.outputLen = tmp.outputLen;\n    hashC.blockLen = tmp.blockLen;\n    hashC.create = (opts) => hashCons(opts);\n    return hashC;\n}\nexport function wrapXOFConstructorWithOpts(hashCons) {\n    const hashC = (msg, opts) => hashCons(opts).update(toBytes(msg)).digest();\n    const tmp = hashCons({});\n    hashC.outputLen = tmp.outputLen;\n    hashC.blockLen = tmp.blockLen;\n    hashC.create = (opts) => hashCons(opts);\n    return hashC;\n}\n/**\n * Secure PRNG. Uses `crypto.getRandomValues`, which defers to OS.\n */\nexport function randomBytes(bytesLength = 32) {\n    if (crypto && typeof crypto.getRandomValues === 'function') {\n        return crypto.getRandomValues(new Uint8Array(bytesLength));\n    }\n    throw new Error('crypto.getRandomValues must be defined');\n}\n//# sourceMappingURL=utils.js.map","export function number(n) {\n    if (!Number.isSafeInteger(n) || n < 0)\n        throw new Error(`Wrong positive integer: ${n}`);\n}\nexport function bool(b) {\n    if (typeof b !== 'boolean')\n        throw new Error(`Expected boolean, not ${b}`);\n}\nexport function bytes(b, ...lengths) {\n    if (!(b instanceof Uint8Array))\n        throw new Error('Expected Uint8Array');\n    if (lengths.length > 0 && !lengths.includes(b.length))\n        throw new Error(`Expected Uint8Array of length ${lengths}, not of length=${b.length}`);\n}\nexport function hash(hash) {\n    if (typeof hash !== 'function' || typeof hash.create !== 'function')\n        throw new Error('Hash should be wrapped by utils.wrapConstructor');\n    number(hash.outputLen);\n    number(hash.blockLen);\n}\nexport function exists(instance, checkFinished = true) {\n    if (instance.destroyed)\n        throw new Error('Hash instance has been destroyed');\n    if (checkFinished && instance.finished)\n        throw new Error('Hash#digest() has already been called');\n}\nexport function output(out, instance) {\n    bytes(out);\n    const min = instance.outputLen;\n    if (out.length < min) {\n        throw new Error(`digestInto() expects output buffer of length at least ${min}`);\n    }\n}\nconst assert = {\n    number,\n    bool,\n    bytes,\n    hash,\n    exists,\n    output,\n};\nexport default assert;\n//# sourceMappingURL=_assert.js.map","import assert from './_assert.js';\nimport { Hash, createView, toBytes } from './utils.js';\n// Polyfill for Safari 14\nfunction setBigUint64(view, byteOffset, value, isLE) {\n    if (typeof view.setBigUint64 === 'function')\n        return view.setBigUint64(byteOffset, value, isLE);\n    const _32n = BigInt(32);\n    const _u32_max = BigInt(0xffffffff);\n    const wh = Number((value >> _32n) & _u32_max);\n    const wl = Number(value & _u32_max);\n    const h = isLE ? 4 : 0;\n    const l = isLE ? 0 : 4;\n    view.setUint32(byteOffset + h, wh, isLE);\n    view.setUint32(byteOffset + l, wl, isLE);\n}\n// Base SHA2 class (RFC 6234)\nexport class SHA2 extends Hash {\n    constructor(blockLen, outputLen, padOffset, isLE) {\n        super();\n        this.blockLen = blockLen;\n        this.outputLen = outputLen;\n        this.padOffset = padOffset;\n        this.isLE = isLE;\n        this.finished = false;\n        this.length = 0;\n        this.pos = 0;\n        this.destroyed = false;\n        this.buffer = new Uint8Array(blockLen);\n        this.view = createView(this.buffer);\n    }\n    update(data) {\n        assert.exists(this);\n        const { view, buffer, blockLen } = this;\n        data = toBytes(data);\n        const len = data.length;\n        for (let pos = 0; pos < len;) {\n            const take = Math.min(blockLen - this.pos, len - pos);\n            // Fast path: we have at least one block in input, cast it to view and process\n            if (take === blockLen) {\n                const dataView = createView(data);\n                for (; blockLen <= len - pos; pos += blockLen)\n                    this.process(dataView, pos);\n                continue;\n            }\n            buffer.set(data.subarray(pos, pos + take), this.pos);\n            this.pos += take;\n            pos += take;\n            if (this.pos === blockLen) {\n                this.process(view, 0);\n                this.pos = 0;\n            }\n        }\n        this.length += data.length;\n        this.roundClean();\n        return this;\n    }\n    digestInto(out) {\n        assert.exists(this);\n        assert.output(out, this);\n        this.finished = true;\n        // Padding\n        // We can avoid allocation of buffer for padding completely if it\n        // was previously not allocated here. But it won't change performance.\n        const { buffer, view, blockLen, isLE } = this;\n        let { pos } = this;\n        // append the bit '1' to the message\n        buffer[pos++] = 0b10000000;\n        this.buffer.subarray(pos).fill(0);\n        // we have less than padOffset left in buffer, so we cannot put length in current block, need process it and pad again\n        if (this.padOffset > blockLen - pos) {\n            this.process(view, 0);\n            pos = 0;\n        }\n        // Pad until full block byte with zeros\n        for (let i = pos; i < blockLen; i++)\n            buffer[i] = 0;\n        // Note: sha512 requires length to be 128bit integer, but length in JS will overflow before that\n        // You need to write around 2 exabytes (u64_max / 8 / (1024**6)) for this to happen.\n        // So we just write lowest 64 bits of that value.\n        setBigUint64(view, blockLen - 8, BigInt(this.length * 8), isLE);\n        this.process(view, 0);\n        const oview = createView(out);\n        const len = this.outputLen;\n        // NOTE: we do division by 4 later, which should be fused in single op with modulo by JIT\n        if (len % 4)\n            throw new Error('_sha2: outputLen should be aligned to 32bit');\n        const outLen = len / 4;\n        const state = this.get();\n        if (outLen > state.length)\n            throw new Error('_sha2: outputLen bigger than state');\n        for (let i = 0; i < outLen; i++)\n            oview.setUint32(4 * i, state[i], isLE);\n    }\n    digest() {\n        const { buffer, outputLen } = this;\n        this.digestInto(buffer);\n        const res = buffer.slice(0, outputLen);\n        this.destroy();\n        return res;\n    }\n    _cloneInto(to) {\n        to || (to = new this.constructor());\n        to.set(...this.get());\n        const { blockLen, buffer, length, finished, destroyed, pos } = this;\n        to.length = length;\n        to.pos = pos;\n        to.finished = finished;\n        to.destroyed = destroyed;\n        if (length % blockLen)\n            to.buffer.set(buffer);\n        return to;\n    }\n}\n//# sourceMappingURL=_sha2.js.map","import { SHA2 } from './_sha2.js';\nimport { rotr, wrapConstructor } from './utils.js';\n// Choice: a ? b : c\nconst Chi = (a, b, c) => (a & b) ^ (~a & c);\n// Majority function, true if any two inpust is true\nconst Maj = (a, b, c) => (a & b) ^ (a & c) ^ (b & c);\n// Round constants:\n// first 32 bits of the fractional parts of the cube roots of the first 64 primes 2..311)\n// prettier-ignore\nconst SHA256_K = new Uint32Array([\n    0x428a2f98, 0x71374491, 0xb5c0fbcf, 0xe9b5dba5, 0x3956c25b, 0x59f111f1, 0x923f82a4, 0xab1c5ed5,\n    0xd807aa98, 0x12835b01, 0x243185be, 0x550c7dc3, 0x72be5d74, 0x80deb1fe, 0x9bdc06a7, 0xc19bf174,\n    0xe49b69c1, 0xefbe4786, 0x0fc19dc6, 0x240ca1cc, 0x2de92c6f, 0x4a7484aa, 0x5cb0a9dc, 0x76f988da,\n    0x983e5152, 0xa831c66d, 0xb00327c8, 0xbf597fc7, 0xc6e00bf3, 0xd5a79147, 0x06ca6351, 0x14292967,\n    0x27b70a85, 0x2e1b2138, 0x4d2c6dfc, 0x53380d13, 0x650a7354, 0x766a0abb, 0x81c2c92e, 0x92722c85,\n    0xa2bfe8a1, 0xa81a664b, 0xc24b8b70, 0xc76c51a3, 0xd192e819, 0xd6990624, 0xf40e3585, 0x106aa070,\n    0x19a4c116, 0x1e376c08, 0x2748774c, 0x34b0bcb5, 0x391c0cb3, 0x4ed8aa4a, 0x5b9cca4f, 0x682e6ff3,\n    0x748f82ee, 0x78a5636f, 0x84c87814, 0x8cc70208, 0x90befffa, 0xa4506ceb, 0xbef9a3f7, 0xc67178f2\n]);\n// Initial state (first 32 bits of the fractional parts of the square roots of the first 8 primes 2..19):\n// prettier-ignore\nconst IV = new Uint32Array([\n    0x6a09e667, 0xbb67ae85, 0x3c6ef372, 0xa54ff53a, 0x510e527f, 0x9b05688c, 0x1f83d9ab, 0x5be0cd19\n]);\n// Temporary buffer, not used to store anything between runs\n// Named this way because it matches specification.\nconst SHA256_W = new Uint32Array(64);\nclass SHA256 extends SHA2 {\n    constructor() {\n        super(64, 32, 8, false);\n        // We cannot use array here since array allows indexing by variable\n        // which means optimizer/compiler cannot use registers.\n        this.A = IV[0] | 0;\n        this.B = IV[1] | 0;\n        this.C = IV[2] | 0;\n        this.D = IV[3] | 0;\n        this.E = IV[4] | 0;\n        this.F = IV[5] | 0;\n        this.G = IV[6] | 0;\n        this.H = IV[7] | 0;\n    }\n    get() {\n        const { A, B, C, D, E, F, G, H } = this;\n        return [A, B, C, D, E, F, G, H];\n    }\n    // prettier-ignore\n    set(A, B, C, D, E, F, G, H) {\n        this.A = A | 0;\n        this.B = B | 0;\n        this.C = C | 0;\n        this.D = D | 0;\n        this.E = E | 0;\n        this.F = F | 0;\n        this.G = G | 0;\n        this.H = H | 0;\n    }\n    process(view, offset) {\n        // Extend the first 16 words into the remaining 48 words w[16..63] of the message schedule array\n        for (let i = 0; i < 16; i++, offset += 4)\n            SHA256_W[i] = view.getUint32(offset, false);\n        for (let i = 16; i < 64; i++) {\n            const W15 = SHA256_W[i - 15];\n            const W2 = SHA256_W[i - 2];\n            const s0 = rotr(W15, 7) ^ rotr(W15, 18) ^ (W15 >>> 3);\n            const s1 = rotr(W2, 17) ^ rotr(W2, 19) ^ (W2 >>> 10);\n            SHA256_W[i] = (s1 + SHA256_W[i - 7] + s0 + SHA256_W[i - 16]) | 0;\n        }\n        // Compression function main loop, 64 rounds\n        let { A, B, C, D, E, F, G, H } = this;\n        for (let i = 0; i < 64; i++) {\n            const sigma1 = rotr(E, 6) ^ rotr(E, 11) ^ rotr(E, 25);\n            const T1 = (H + sigma1 + Chi(E, F, G) + SHA256_K[i] + SHA256_W[i]) | 0;\n            const sigma0 = rotr(A, 2) ^ rotr(A, 13) ^ rotr(A, 22);\n            const T2 = (sigma0 + Maj(A, B, C)) | 0;\n            H = G;\n            G = F;\n            F = E;\n            E = (D + T1) | 0;\n            D = C;\n            C = B;\n            B = A;\n            A = (T1 + T2) | 0;\n        }\n        // Add the compressed chunk to the current hash value\n        A = (A + this.A) | 0;\n        B = (B + this.B) | 0;\n        C = (C + this.C) | 0;\n        D = (D + this.D) | 0;\n        E = (E + this.E) | 0;\n        F = (F + this.F) | 0;\n        G = (G + this.G) | 0;\n        H = (H + this.H) | 0;\n        this.set(A, B, C, D, E, F, G, H);\n    }\n    roundClean() {\n        SHA256_W.fill(0);\n    }\n    destroy() {\n        this.set(0, 0, 0, 0, 0, 0, 0, 0);\n        this.buffer.fill(0);\n    }\n}\n// Constants from https://nvlpubs.nist.gov/nistpubs/FIPS/NIST.FIPS.180-4.pdf\nclass SHA224 extends SHA256 {\n    constructor() {\n        super();\n        this.A = 0xc1059ed8 | 0;\n        this.B = 0x367cd507 | 0;\n        this.C = 0x3070dd17 | 0;\n        this.D = 0xf70e5939 | 0;\n        this.E = 0xffc00b31 | 0;\n        this.F = 0x68581511 | 0;\n        this.G = 0x64f98fa7 | 0;\n        this.H = 0xbefa4fa4 | 0;\n        this.outputLen = 28;\n    }\n}\n/**\n * SHA2-256 hash function\n * @param message - data that would be hashed\n */\nexport const sha256 = wrapConstructor(() => new SHA256());\nexport const sha224 = wrapConstructor(() => new SHA224());\n//# sourceMappingURL=sha256.js.map","/*! scure-base - MIT License (c) 2022 Paul Miller (paulmillr.com) */\nexport function assertNumber(n) {\n    if (!Number.isSafeInteger(n))\n        throw new Error(`Wrong integer: ${n}`);\n}\nfunction chain(...args) {\n    const wrap = (a, b) => (c) => a(b(c));\n    const encode = Array.from(args)\n        .reverse()\n        .reduce((acc, i) => (acc ? wrap(acc, i.encode) : i.encode), undefined);\n    const decode = args.reduce((acc, i) => (acc ? wrap(acc, i.decode) : i.decode), undefined);\n    return { encode, decode };\n}\nfunction alphabet(alphabet) {\n    return {\n        encode: (digits) => {\n            if (!Array.isArray(digits) || (digits.length && typeof digits[0] !== 'number'))\n                throw new Error('alphabet.encode input should be an array of numbers');\n            return digits.map((i) => {\n                assertNumber(i);\n                if (i < 0 || i >= alphabet.length)\n                    throw new Error(`Digit index outside alphabet: ${i} (alphabet: ${alphabet.length})`);\n                return alphabet[i];\n            });\n        },\n        decode: (input) => {\n            if (!Array.isArray(input) || (input.length && typeof input[0] !== 'string'))\n                throw new Error('alphabet.decode input should be array of strings');\n            return input.map((letter) => {\n                if (typeof letter !== 'string')\n                    throw new Error(`alphabet.decode: not string element=${letter}`);\n                const index = alphabet.indexOf(letter);\n                if (index === -1)\n                    throw new Error(`Unknown letter: \"${letter}\". Allowed: ${alphabet}`);\n                return index;\n            });\n        },\n    };\n}\nfunction join(separator = '') {\n    if (typeof separator !== 'string')\n        throw new Error('join separator should be string');\n    return {\n        encode: (from) => {\n            if (!Array.isArray(from) || (from.length && typeof from[0] !== 'string'))\n                throw new Error('join.encode input should be array of strings');\n            for (let i of from)\n                if (typeof i !== 'string')\n                    throw new Error(`join.encode: non-string input=${i}`);\n            return from.join(separator);\n        },\n        decode: (to) => {\n            if (typeof to !== 'string')\n                throw new Error('join.decode input should be string');\n            return to.split(separator);\n        },\n    };\n}\nfunction padding(bits, chr = '=') {\n    assertNumber(bits);\n    if (typeof chr !== 'string')\n        throw new Error('padding chr should be string');\n    return {\n        encode(data) {\n            if (!Array.isArray(data) || (data.length && typeof data[0] !== 'string'))\n                throw new Error('padding.encode input should be array of strings');\n            for (let i of data)\n                if (typeof i !== 'string')\n                    throw new Error(`padding.encode: non-string input=${i}`);\n            while ((data.length * bits) % 8)\n                data.push(chr);\n            return data;\n        },\n        decode(input) {\n            if (!Array.isArray(input) || (input.length && typeof input[0] !== 'string'))\n                throw new Error('padding.encode input should be array of strings');\n            for (let i of input)\n                if (typeof i !== 'string')\n                    throw new Error(`padding.decode: non-string input=${i}`);\n            let end = input.length;\n            if ((end * bits) % 8)\n                throw new Error('Invalid padding: string should have whole number of bytes');\n            for (; end > 0 && input[end - 1] === chr; end--) {\n                if (!(((end - 1) * bits) % 8))\n                    throw new Error('Invalid padding: string has too much padding');\n            }\n            return input.slice(0, end);\n        },\n    };\n}\nfunction normalize(fn) {\n    if (typeof fn !== 'function')\n        throw new Error('normalize fn should be function');\n    return { encode: (from) => from, decode: (to) => fn(to) };\n}\nfunction convertRadix(data, from, to) {\n    if (from < 2)\n        throw new Error(`convertRadix: wrong from=${from}, base cannot be less than 2`);\n    if (to < 2)\n        throw new Error(`convertRadix: wrong to=${to}, base cannot be less than 2`);\n    if (!Array.isArray(data))\n        throw new Error('convertRadix: data should be array');\n    if (!data.length)\n        return [];\n    let pos = 0;\n    const res = [];\n    const digits = Array.from(data);\n    digits.forEach((d) => {\n        assertNumber(d);\n        if (d < 0 || d >= from)\n            throw new Error(`Wrong integer: ${d}`);\n    });\n    while (true) {\n        let carry = 0;\n        let done = true;\n        for (let i = pos; i < digits.length; i++) {\n            const digit = digits[i];\n            const digitBase = from * carry + digit;\n            if (!Number.isSafeInteger(digitBase) ||\n                (from * carry) / from !== carry ||\n                digitBase - digit !== from * carry) {\n                throw new Error('convertRadix: carry overflow');\n            }\n            carry = digitBase % to;\n            digits[i] = Math.floor(digitBase / to);\n            if (!Number.isSafeInteger(digits[i]) || digits[i] * to + carry !== digitBase)\n                throw new Error('convertRadix: carry overflow');\n            if (!done)\n                continue;\n            else if (!digits[i])\n                pos = i;\n            else\n                done = false;\n        }\n        res.push(carry);\n        if (done)\n            break;\n    }\n    for (let i = 0; i < data.length - 1 && data[i] === 0; i++)\n        res.push(0);\n    return res.reverse();\n}\nconst gcd = (a, b) => (!b ? a : gcd(b, a % b));\nconst radix2carry = (from, to) => from + (to - gcd(from, to));\nfunction convertRadix2(data, from, to, padding) {\n    if (!Array.isArray(data))\n        throw new Error('convertRadix2: data should be array');\n    if (from <= 0 || from > 32)\n        throw new Error(`convertRadix2: wrong from=${from}`);\n    if (to <= 0 || to > 32)\n        throw new Error(`convertRadix2: wrong to=${to}`);\n    if (radix2carry(from, to) > 32) {\n        throw new Error(`convertRadix2: carry overflow from=${from} to=${to} carryBits=${radix2carry(from, to)}`);\n    }\n    let carry = 0;\n    let pos = 0;\n    const mask = 2 ** to - 1;\n    const res = [];\n    for (const n of data) {\n        assertNumber(n);\n        if (n >= 2 ** from)\n            throw new Error(`convertRadix2: invalid data word=${n} from=${from}`);\n        carry = (carry << from) | n;\n        if (pos + from > 32)\n            throw new Error(`convertRadix2: carry overflow pos=${pos} from=${from}`);\n        pos += from;\n        for (; pos >= to; pos -= to)\n            res.push(((carry >> (pos - to)) & mask) >>> 0);\n        carry &= 2 ** pos - 1;\n    }\n    carry = (carry << (to - pos)) & mask;\n    if (!padding && pos >= from)\n        throw new Error('Excess padding');\n    if (!padding && carry)\n        throw new Error(`Non-zero padding: ${carry}`);\n    if (padding && pos > 0)\n        res.push(carry >>> 0);\n    return res;\n}\nfunction radix(num) {\n    assertNumber(num);\n    return {\n        encode: (bytes) => {\n            if (!(bytes instanceof Uint8Array))\n                throw new Error('radix.encode input should be Uint8Array');\n            return convertRadix(Array.from(bytes), 2 ** 8, num);\n        },\n        decode: (digits) => {\n            if (!Array.isArray(digits) || (digits.length && typeof digits[0] !== 'number'))\n                throw new Error('radix.decode input should be array of strings');\n            return Uint8Array.from(convertRadix(digits, num, 2 ** 8));\n        },\n    };\n}\nfunction radix2(bits, revPadding = false) {\n    assertNumber(bits);\n    if (bits <= 0 || bits > 32)\n        throw new Error('radix2: bits should be in (0..32]');\n    if (radix2carry(8, bits) > 32 || radix2carry(bits, 8) > 32)\n        throw new Error('radix2: carry overflow');\n    return {\n        encode: (bytes) => {\n            if (!(bytes instanceof Uint8Array))\n                throw new Error('radix2.encode input should be Uint8Array');\n            return convertRadix2(Array.from(bytes), 8, bits, !revPadding);\n        },\n        decode: (digits) => {\n            if (!Array.isArray(digits) || (digits.length && typeof digits[0] !== 'number'))\n                throw new Error('radix2.decode input should be array of strings');\n            return Uint8Array.from(convertRadix2(digits, bits, 8, revPadding));\n        },\n    };\n}\nfunction unsafeWrapper(fn) {\n    if (typeof fn !== 'function')\n        throw new Error('unsafeWrapper fn should be function');\n    return function (...args) {\n        try {\n            return fn.apply(null, args);\n        }\n        catch (e) { }\n    };\n}\nfunction checksum(len, fn) {\n    assertNumber(len);\n    if (typeof fn !== 'function')\n        throw new Error('checksum fn should be function');\n    return {\n        encode(data) {\n            if (!(data instanceof Uint8Array))\n                throw new Error('checksum.encode: input should be Uint8Array');\n            const checksum = fn(data).slice(0, len);\n            const res = new Uint8Array(data.length + len);\n            res.set(data);\n            res.set(checksum, data.length);\n            return res;\n        },\n        decode(data) {\n            if (!(data instanceof Uint8Array))\n                throw new Error('checksum.decode: input should be Uint8Array');\n            const payload = data.slice(0, -len);\n            const newChecksum = fn(payload).slice(0, len);\n            const oldChecksum = data.slice(-len);\n            for (let i = 0; i < len; i++)\n                if (newChecksum[i] !== oldChecksum[i])\n                    throw new Error('Invalid checksum');\n            return payload;\n        },\n    };\n}\nexport const utils = { alphabet, chain, checksum, radix, radix2, join, padding };\nexport const base16 = chain(radix2(4), alphabet('0123456789ABCDEF'), join(''));\nexport const base32 = chain(radix2(5), alphabet('ABCDEFGHIJKLMNOPQRSTUVWXYZ234567'), padding(5), join(''));\nexport const base32hex = chain(radix2(5), alphabet('0123456789ABCDEFGHIJKLMNOPQRSTUV'), padding(5), join(''));\nexport const base32crockford = chain(radix2(5), alphabet('0123456789ABCDEFGHJKMNPQRSTVWXYZ'), join(''), normalize((s) => s.toUpperCase().replace(/O/g, '0').replace(/[IL]/g, '1')));\nexport const base64 = chain(radix2(6), alphabet('ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz0123456789+/'), padding(6), join(''));\nexport const base64url = chain(radix2(6), alphabet('ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz0123456789-_'), padding(6), join(''));\nconst genBase58 = (abc) => chain(radix(58), alphabet(abc), join(''));\nexport const base58 = genBase58('123456789ABCDEFGHJKLMNPQRSTUVWXYZabcdefghijkmnopqrstuvwxyz');\nexport const base58flickr = genBase58('123456789abcdefghijkmnopqrstuvwxyzABCDEFGHJKLMNPQRSTUVWXYZ');\nexport const base58xrp = genBase58('rpshnaf39wBUDNEGHJKLM4PQRST7VWXYZ2bcdeCg65jkm8oFqi1tuvAxyz');\nconst XMR_BLOCK_LEN = [0, 2, 3, 5, 6, 7, 9, 10, 11];\nexport const base58xmr = {\n    encode(data) {\n        let res = '';\n        for (let i = 0; i < data.length; i += 8) {\n            const block = data.subarray(i, i + 8);\n            res += base58.encode(block).padStart(XMR_BLOCK_LEN[block.length], '1');\n        }\n        return res;\n    },\n    decode(str) {\n        let res = [];\n        for (let i = 0; i < str.length; i += 11) {\n            const slice = str.slice(i, i + 11);\n            const blockLen = XMR_BLOCK_LEN.indexOf(slice.length);\n            const block = base58.decode(slice);\n            for (let j = 0; j < block.length - blockLen; j++) {\n                if (block[j] !== 0)\n                    throw new Error('base58xmr: wrong padding');\n            }\n            res = res.concat(Array.from(block.slice(block.length - blockLen)));\n        }\n        return Uint8Array.from(res);\n    },\n};\nexport const base58check = (sha256) => chain(checksum(4, (data) => sha256(sha256(data))), base58);\nconst BECH_ALPHABET = chain(alphabet('qpzry9x8gf2tvdw0s3jn54khce6mua7l'), join(''));\nconst POLYMOD_GENERATORS = [0x3b6a57b2, 0x26508e6d, 0x1ea119fa, 0x3d4233dd, 0x2a1462b3];\nfunction bech32Polymod(pre) {\n    const b = pre >> 25;\n    let chk = (pre & 0x1ffffff) << 5;\n    for (let i = 0; i < POLYMOD_GENERATORS.length; i++) {\n        if (((b >> i) & 1) === 1)\n            chk ^= POLYMOD_GENERATORS[i];\n    }\n    return chk;\n}\nfunction bechChecksum(prefix, words, encodingConst = 1) {\n    const len = prefix.length;\n    let chk = 1;\n    for (let i = 0; i < len; i++) {\n        const c = prefix.charCodeAt(i);\n        if (c < 33 || c > 126)\n            throw new Error(`Invalid prefix (${prefix})`);\n        chk = bech32Polymod(chk) ^ (c >> 5);\n    }\n    chk = bech32Polymod(chk);\n    for (let i = 0; i < len; i++)\n        chk = bech32Polymod(chk) ^ (prefix.charCodeAt(i) & 0x1f);\n    for (let v of words)\n        chk = bech32Polymod(chk) ^ v;\n    for (let i = 0; i < 6; i++)\n        chk = bech32Polymod(chk);\n    chk ^= encodingConst;\n    return BECH_ALPHABET.encode(convertRadix2([chk % 2 ** 30], 30, 5, false));\n}\nfunction genBech32(encoding) {\n    const ENCODING_CONST = encoding === 'bech32' ? 1 : 0x2bc830a3;\n    const _words = radix2(5);\n    const fromWords = _words.decode;\n    const toWords = _words.encode;\n    const fromWordsUnsafe = unsafeWrapper(fromWords);\n    function encode(prefix, words, limit = 90) {\n        if (typeof prefix !== 'string')\n            throw new Error(`bech32.encode prefix should be string, not ${typeof prefix}`);\n        if (!Array.isArray(words) || (words.length && typeof words[0] !== 'number'))\n            throw new Error(`bech32.encode words should be array of numbers, not ${typeof words}`);\n        const actualLength = prefix.length + 7 + words.length;\n        if (limit !== false && actualLength > limit)\n            throw new TypeError(`Length ${actualLength} exceeds limit ${limit}`);\n        prefix = prefix.toLowerCase();\n        return `${prefix}1${BECH_ALPHABET.encode(words)}${bechChecksum(prefix, words, ENCODING_CONST)}`;\n    }\n    function decode(str, limit = 90) {\n        if (typeof str !== 'string')\n            throw new Error(`bech32.decode input should be string, not ${typeof str}`);\n        if (str.length < 8 || (limit !== false && str.length > limit))\n            throw new TypeError(`Wrong string length: ${str.length} (${str}). Expected (8..${limit})`);\n        const lowered = str.toLowerCase();\n        if (str !== lowered && str !== str.toUpperCase())\n            throw new Error(`String must be lowercase or uppercase`);\n        str = lowered;\n        const sepIndex = str.lastIndexOf('1');\n        if (sepIndex === 0 || sepIndex === -1)\n            throw new Error(`Letter \"1\" must be present between prefix and data only`);\n        const prefix = str.slice(0, sepIndex);\n        const _words = str.slice(sepIndex + 1);\n        if (_words.length < 6)\n            throw new Error('Data must be at least 6 characters long');\n        const words = BECH_ALPHABET.decode(_words).slice(0, -6);\n        const sum = bechChecksum(prefix, words, ENCODING_CONST);\n        if (!_words.endsWith(sum))\n            throw new Error(`Invalid checksum in ${str}: expected \"${sum}\"`);\n        return { prefix, words };\n    }\n    const decodeUnsafe = unsafeWrapper(decode);\n    function decodeToBytes(str) {\n        const { prefix, words } = decode(str, false);\n        return { prefix, words, bytes: fromWords(words) };\n    }\n    return { encode, decode, decodeToBytes, decodeUnsafe, fromWords, fromWordsUnsafe, toWords };\n}\nexport const bech32 = genBech32('bech32');\nexport const bech32m = genBech32('bech32m');\nexport const utf8 = {\n    encode: (data) => new TextDecoder().decode(data),\n    decode: (str) => new TextEncoder().encode(str),\n};\nexport const hex = chain(radix2(4), alphabet('0123456789abcdef'), join(''), normalize((s) => {\n    if (typeof s !== 'string' || s.length % 2)\n        throw new TypeError(`hex.decode: expected string, got ${typeof s} with length ${s.length}`);\n    return s.toLowerCase();\n}));\nconst CODERS = {\n    utf8, hex, base16, base32, base64, base64url, base58, base58xmr\n};\nconst coderTypeError = `Invalid encoding type. Available types: ${Object.keys(CODERS).join(', ')}`;\nexport const bytesToString = (type, bytes) => {\n    if (typeof type !== 'string' || !CODERS.hasOwnProperty(type))\n        throw new TypeError(coderTypeError);\n    if (!(bytes instanceof Uint8Array))\n        throw new TypeError('bytesToString() expects Uint8Array');\n    return CODERS[type].encode(bytes);\n};\nexport const str = bytesToString;\nexport const stringToBytes = (type, str) => {\n    if (!CODERS.hasOwnProperty(type))\n        throw new TypeError(coderTypeError);\n    if (typeof str !== 'string')\n        throw new TypeError('stringToBytes() expects string');\n    return CODERS[type].decode(str);\n};\nexport const bytes = stringToBytes;\n","function number(n) {\n    if (!Number.isSafeInteger(n) || n < 0)\n        throw new Error(`positive integer expected, not ${n}`);\n}\nfunction bool(b) {\n    if (typeof b !== 'boolean')\n        throw new Error(`boolean expected, not ${b}`);\n}\nexport function isBytes(a) {\n    return (a instanceof Uint8Array ||\n        (a != null && typeof a === 'object' && a.constructor.name === 'Uint8Array'));\n}\nfunction bytes(b, ...lengths) {\n    if (!isBytes(b))\n        throw new Error('Uint8Array expected');\n    if (lengths.length > 0 && !lengths.includes(b.length))\n        throw new Error(`Uint8Array expected of length ${lengths}, not of length=${b.length}`);\n}\nfunction hash(hash) {\n    if (typeof hash !== 'function' || typeof hash.create !== 'function')\n        throw new Error('hash must be wrapped by utils.wrapConstructor');\n    number(hash.outputLen);\n    number(hash.blockLen);\n}\nfunction exists(instance, checkFinished = true) {\n    if (instance.destroyed)\n        throw new Error('Hash instance has been destroyed');\n    if (checkFinished && instance.finished)\n        throw new Error('Hash#digest() has already been called');\n}\nfunction output(out, instance) {\n    bytes(out);\n    const min = instance.outputLen;\n    if (out.length < min) {\n        throw new Error(`digestInto() expects output buffer of length at least ${min}`);\n    }\n}\nexport { number, bool, bytes, hash, exists, output };\nconst assert = { number, bool, bytes, hash, exists, output };\nexport default assert;\n//# sourceMappingURL=_assert.js.map","/*! noble-ciphers - MIT License (c) 2023 Paul Miller (paulmillr.com) */\nimport { bytes as abytes, isBytes } from './_assert.js';\n// Cast array to different type\nexport const u8 = (arr) => new Uint8Array(arr.buffer, arr.byteOffset, arr.byteLength);\nexport const u16 = (arr) => new Uint16Array(arr.buffer, arr.byteOffset, Math.floor(arr.byteLength / 2));\nexport const u32 = (arr) => new Uint32Array(arr.buffer, arr.byteOffset, Math.floor(arr.byteLength / 4));\n// Cast array to view\nexport const createView = (arr) => new DataView(arr.buffer, arr.byteOffset, arr.byteLength);\n// big-endian hardware is rare. Just in case someone still decides to run ciphers:\n// early-throw an error because we don't support BE yet.\nexport const isLE = new Uint8Array(new Uint32Array([0x11223344]).buffer)[0] === 0x44;\nif (!isLE)\n    throw new Error('Non little-endian hardware is not supported');\n// Array where index 0xf0 (240) is mapped to string 'f0'\nconst hexes = /* @__PURE__ */ Array.from({ length: 256 }, (_, i) => i.toString(16).padStart(2, '0'));\n/**\n * @example bytesToHex(Uint8Array.from([0xca, 0xfe, 0x01, 0x23])) // 'cafe0123'\n */\nexport function bytesToHex(bytes) {\n    abytes(bytes);\n    // pre-caching improves the speed 6x\n    let hex = '';\n    for (let i = 0; i < bytes.length; i++) {\n        hex += hexes[bytes[i]];\n    }\n    return hex;\n}\n// We use optimized technique to convert hex string to byte array\nconst asciis = { _0: 48, _9: 57, _A: 65, _F: 70, _a: 97, _f: 102 };\nfunction asciiToBase16(char) {\n    if (char >= asciis._0 && char <= asciis._9)\n        return char - asciis._0;\n    if (char >= asciis._A && char <= asciis._F)\n        return char - (asciis._A - 10);\n    if (char >= asciis._a && char <= asciis._f)\n        return char - (asciis._a - 10);\n    return;\n}\n/**\n * @example hexToBytes('cafe0123') // Uint8Array.from([0xca, 0xfe, 0x01, 0x23])\n */\nexport function hexToBytes(hex) {\n    if (typeof hex !== 'string')\n        throw new Error('hex string expected, got ' + typeof hex);\n    const hl = hex.length;\n    const al = hl / 2;\n    if (hl % 2)\n        throw new Error('padded hex string expected, got unpadded hex of length ' + hl);\n    const array = new Uint8Array(al);\n    for (let ai = 0, hi = 0; ai < al; ai++, hi += 2) {\n        const n1 = asciiToBase16(hex.charCodeAt(hi));\n        const n2 = asciiToBase16(hex.charCodeAt(hi + 1));\n        if (n1 === undefined || n2 === undefined) {\n            const char = hex[hi] + hex[hi + 1];\n            throw new Error('hex string expected, got non-hex character \"' + char + '\" at index ' + hi);\n        }\n        array[ai] = n1 * 16 + n2;\n    }\n    return array;\n}\nexport function hexToNumber(hex) {\n    if (typeof hex !== 'string')\n        throw new Error('hex string expected, got ' + typeof hex);\n    // Big Endian\n    return BigInt(hex === '' ? '0' : `0x${hex}`);\n}\n// BE: Big Endian, LE: Little Endian\nexport function bytesToNumberBE(bytes) {\n    return hexToNumber(bytesToHex(bytes));\n}\nexport function numberToBytesBE(n, len) {\n    return hexToBytes(n.toString(16).padStart(len * 2, '0'));\n}\n// There is no setImmediate in browser and setTimeout is slow.\n// call of async fn will return Promise, which will be fullfiled only on\n// next scheduler queue processing step and this is exactly what we need.\nexport const nextTick = async () => { };\n// Returns control to thread each 'tick' ms to avoid blocking\nexport async function asyncLoop(iters, tick, cb) {\n    let ts = Date.now();\n    for (let i = 0; i < iters; i++) {\n        cb(i);\n        // Date.now() is not monotonic, so in case if clock goes backwards we return return control too\n        const diff = Date.now() - ts;\n        if (diff >= 0 && diff < tick)\n            continue;\n        await nextTick();\n        ts += diff;\n    }\n}\n/**\n * @example utf8ToBytes('abc') // new Uint8Array([97, 98, 99])\n */\nexport function utf8ToBytes(str) {\n    if (typeof str !== 'string')\n        throw new Error(`string expected, got ${typeof str}`);\n    return new Uint8Array(new TextEncoder().encode(str)); // https://bugzil.la/1681809\n}\n/**\n * @example bytesToUtf8(new Uint8Array([97, 98, 99])) // 'abc'\n */\nexport function bytesToUtf8(bytes) {\n    return new TextDecoder().decode(bytes);\n}\n/**\n * Normalizes (non-hex) string or Uint8Array to Uint8Array.\n * Warning: when Uint8Array is passed, it would NOT get copied.\n * Keep in mind for future mutable operations.\n */\nexport function toBytes(data) {\n    if (typeof data === 'string')\n        data = utf8ToBytes(data);\n    else if (isBytes(data))\n        data = data.slice();\n    else\n        throw new Error(`Uint8Array expected, got ${typeof data}`);\n    return data;\n}\n/**\n * Copies several Uint8Arrays into one.\n */\nexport function concatBytes(...arrays) {\n    let sum = 0;\n    for (let i = 0; i < arrays.length; i++) {\n        const a = arrays[i];\n        abytes(a);\n        sum += a.length;\n    }\n    const res = new Uint8Array(sum);\n    for (let i = 0, pad = 0; i < arrays.length; i++) {\n        const a = arrays[i];\n        res.set(a, pad);\n        pad += a.length;\n    }\n    return res;\n}\nexport function checkOpts(defaults, opts) {\n    if (opts == null || typeof opts !== 'object')\n        throw new Error('options must be defined');\n    const merged = Object.assign(defaults, opts);\n    return merged;\n}\n// Compares 2 u8a-s in kinda constant time\nexport function equalBytes(a, b) {\n    if (a.length !== b.length)\n        return false;\n    let diff = 0;\n    for (let i = 0; i < a.length; i++)\n        diff |= a[i] ^ b[i];\n    return diff === 0;\n}\n// For runtime check if class implements interface\nexport class Hash {\n}\n/**\n * @__NO_SIDE_EFFECTS__\n */\nexport const wrapCipher = (params, c) => {\n    Object.assign(c, params);\n    return c;\n};\n// Polyfill for Safari 14\nexport function setBigUint64(view, byteOffset, value, isLE) {\n    if (typeof view.setBigUint64 === 'function')\n        return view.setBigUint64(byteOffset, value, isLE);\n    const _32n = BigInt(32);\n    const _u32_max = BigInt(0xffffffff);\n    const wh = Number((value >> _32n) & _u32_max);\n    const wl = Number(value & _u32_max);\n    const h = isLE ? 4 : 0;\n    const l = isLE ? 0 : 4;\n    view.setUint32(byteOffset + h, wh, isLE);\n    view.setUint32(byteOffset + l, wl, isLE);\n}\nexport function u64Lengths(ciphertext, AAD) {\n    const num = new Uint8Array(16);\n    const view = createView(num);\n    setBigUint64(view, 0, BigInt(AAD ? AAD.length : 0), true);\n    setBigUint64(view, 8, BigInt(ciphertext.length), true);\n    return num;\n}\n//# sourceMappingURL=utils.js.map","// prettier-ignore\nimport { wrapCipher, createView, setBigUint64, equalBytes, u32, u8, } from './utils.js';\nimport { ghash, polyval } from './_polyval.js';\nimport { bytes as abytes } from './_assert.js';\n/*\nAES (Advanced Encryption Standard) aka Rijndael block cipher.\n\nData is split into 128-bit blocks. Encrypted in 10/12/14 rounds (128/192/256 bits). In every round:\n1. **S-box**, table substitution\n2. **Shift rows**, cyclic shift left of all rows of data array\n3. **Mix columns**, multiplying every column by fixed polynomial\n4. **Add round key**, round_key xor i-th column of array\n\nResources:\n- FIPS-197 https://csrc.nist.gov/files/pubs/fips/197/final/docs/fips-197.pdf\n- Original proposal: https://csrc.nist.gov/csrc/media/projects/cryptographic-standards-and-guidelines/documents/aes-development/rijndael-ammended.pdf\n*/\nconst BLOCK_SIZE = 16;\nconst BLOCK_SIZE32 = 4;\nconst EMPTY_BLOCK = new Uint8Array(BLOCK_SIZE);\nconst POLY = 0x11b; // 1 + x + x**3 + x**4 + x**8\n// TODO: remove multiplication, binary ops only\nfunction mul2(n) {\n    return (n << 1) ^ (POLY & -(n >> 7));\n}\nfunction mul(a, b) {\n    let res = 0;\n    for (; b > 0; b >>= 1) {\n        // Montgomery ladder\n        res ^= a & -(b & 1); // if (b&1) res ^=a (but const-time).\n        a = mul2(a); // a = 2*a\n    }\n    return res;\n}\n// AES S-box is generated using finite field inversion,\n// an affine transform, and xor of a constant 0x63.\nconst sbox = /* @__PURE__ */ (() => {\n    let t = new Uint8Array(256);\n    for (let i = 0, x = 1; i < 256; i++, x ^= mul2(x))\n        t[i] = x;\n    const box = new Uint8Array(256);\n    box[0] = 0x63; // first elm\n    for (let i = 0; i < 255; i++) {\n        let x = t[255 - i];\n        x |= x << 8;\n        box[t[i]] = (x ^ (x >> 4) ^ (x >> 5) ^ (x >> 6) ^ (x >> 7) ^ 0x63) & 0xff;\n    }\n    return box;\n})();\n// Inverted S-box\nconst invSbox = /* @__PURE__ */ sbox.map((_, j) => sbox.indexOf(j));\n// Rotate u32 by 8\nconst rotr32_8 = (n) => (n << 24) | (n >>> 8);\nconst rotl32_8 = (n) => (n << 8) | (n >>> 24);\n// T-table is optimization suggested in 5.2 of original proposal (missed from FIPS-197). Changes:\n// - LE instead of BE\n// - bigger tables: T0 and T1 are merged into T01 table and T2 & T3 into T23;\n//   so index is u16, instead of u8. This speeds up things, unexpectedly\nfunction genTtable(sbox, fn) {\n    if (sbox.length !== 256)\n        throw new Error('Wrong sbox length');\n    const T0 = new Uint32Array(256).map((_, j) => fn(sbox[j]));\n    const T1 = T0.map(rotl32_8);\n    const T2 = T1.map(rotl32_8);\n    const T3 = T2.map(rotl32_8);\n    const T01 = new Uint32Array(256 * 256);\n    const T23 = new Uint32Array(256 * 256);\n    const sbox2 = new Uint16Array(256 * 256);\n    for (let i = 0; i < 256; i++) {\n        for (let j = 0; j < 256; j++) {\n            const idx = i * 256 + j;\n            T01[idx] = T0[i] ^ T1[j];\n            T23[idx] = T2[i] ^ T3[j];\n            sbox2[idx] = (sbox[i] << 8) | sbox[j];\n        }\n    }\n    return { sbox, sbox2, T0, T1, T2, T3, T01, T23 };\n}\nconst tableEncoding = /* @__PURE__ */ genTtable(sbox, (s) => (mul(s, 3) << 24) | (s << 16) | (s << 8) | mul(s, 2));\nconst tableDecoding = /* @__PURE__ */ genTtable(invSbox, (s) => (mul(s, 11) << 24) | (mul(s, 13) << 16) | (mul(s, 9) << 8) | mul(s, 14));\nconst xPowers = /* @__PURE__ */ (() => {\n    const p = new Uint8Array(16);\n    for (let i = 0, x = 1; i < 16; i++, x = mul2(x))\n        p[i] = x;\n    return p;\n})();\nexport function expandKeyLE(key) {\n    abytes(key);\n    const len = key.length;\n    if (![16, 24, 32].includes(len))\n        throw new Error(`aes: wrong key size: should be 16, 24 or 32, got: ${len}`);\n    const { sbox2 } = tableEncoding;\n    const k32 = u32(key);\n    const Nk = k32.length;\n    const subByte = (n) => applySbox(sbox2, n, n, n, n);\n    const xk = new Uint32Array(len + 28); // expanded key\n    xk.set(k32);\n    // 4.3.1 Key expansion\n    for (let i = Nk; i < xk.length; i++) {\n        let t = xk[i - 1];\n        if (i % Nk === 0)\n            t = subByte(rotr32_8(t)) ^ xPowers[i / Nk - 1];\n        else if (Nk > 6 && i % Nk === 4)\n            t = subByte(t);\n        xk[i] = xk[i - Nk] ^ t;\n    }\n    return xk;\n}\nexport function expandKeyDecLE(key) {\n    const encKey = expandKeyLE(key);\n    const xk = encKey.slice();\n    const Nk = encKey.length;\n    const { sbox2 } = tableEncoding;\n    const { T0, T1, T2, T3 } = tableDecoding;\n    // Inverse key by chunks of 4 (rounds)\n    for (let i = 0; i < Nk; i += 4) {\n        for (let j = 0; j < 4; j++)\n            xk[i + j] = encKey[Nk - i - 4 + j];\n    }\n    encKey.fill(0);\n    // apply InvMixColumn except first & last round\n    for (let i = 4; i < Nk - 4; i++) {\n        const x = xk[i];\n        const w = applySbox(sbox2, x, x, x, x);\n        xk[i] = T0[w & 0xff] ^ T1[(w >>> 8) & 0xff] ^ T2[(w >>> 16) & 0xff] ^ T3[w >>> 24];\n    }\n    return xk;\n}\n// Apply tables\nfunction apply0123(T01, T23, s0, s1, s2, s3) {\n    return (T01[((s0 << 8) & 0xff00) | ((s1 >>> 8) & 0xff)] ^\n        T23[((s2 >>> 8) & 0xff00) | ((s3 >>> 24) & 0xff)]);\n}\nfunction applySbox(sbox2, s0, s1, s2, s3) {\n    return (sbox2[(s0 & 0xff) | (s1 & 0xff00)] |\n        (sbox2[((s2 >>> 16) & 0xff) | ((s3 >>> 16) & 0xff00)] << 16));\n}\nfunction encrypt(xk, s0, s1, s2, s3) {\n    const { sbox2, T01, T23 } = tableEncoding;\n    let k = 0;\n    (s0 ^= xk[k++]), (s1 ^= xk[k++]), (s2 ^= xk[k++]), (s3 ^= xk[k++]);\n    const rounds = xk.length / 4 - 2;\n    for (let i = 0; i < rounds; i++) {\n        const t0 = xk[k++] ^ apply0123(T01, T23, s0, s1, s2, s3);\n        const t1 = xk[k++] ^ apply0123(T01, T23, s1, s2, s3, s0);\n        const t2 = xk[k++] ^ apply0123(T01, T23, s2, s3, s0, s1);\n        const t3 = xk[k++] ^ apply0123(T01, T23, s3, s0, s1, s2);\n        (s0 = t0), (s1 = t1), (s2 = t2), (s3 = t3);\n    }\n    // last round (without mixcolumns, so using SBOX2 table)\n    const t0 = xk[k++] ^ applySbox(sbox2, s0, s1, s2, s3);\n    const t1 = xk[k++] ^ applySbox(sbox2, s1, s2, s3, s0);\n    const t2 = xk[k++] ^ applySbox(sbox2, s2, s3, s0, s1);\n    const t3 = xk[k++] ^ applySbox(sbox2, s3, s0, s1, s2);\n    return { s0: t0, s1: t1, s2: t2, s3: t3 };\n}\nfunction decrypt(xk, s0, s1, s2, s3) {\n    const { sbox2, T01, T23 } = tableDecoding;\n    let k = 0;\n    (s0 ^= xk[k++]), (s1 ^= xk[k++]), (s2 ^= xk[k++]), (s3 ^= xk[k++]);\n    const rounds = xk.length / 4 - 2;\n    for (let i = 0; i < rounds; i++) {\n        const t0 = xk[k++] ^ apply0123(T01, T23, s0, s3, s2, s1);\n        const t1 = xk[k++] ^ apply0123(T01, T23, s1, s0, s3, s2);\n        const t2 = xk[k++] ^ apply0123(T01, T23, s2, s1, s0, s3);\n        const t3 = xk[k++] ^ apply0123(T01, T23, s3, s2, s1, s0);\n        (s0 = t0), (s1 = t1), (s2 = t2), (s3 = t3);\n    }\n    // Last round\n    const t0 = xk[k++] ^ applySbox(sbox2, s0, s3, s2, s1);\n    const t1 = xk[k++] ^ applySbox(sbox2, s1, s0, s3, s2);\n    const t2 = xk[k++] ^ applySbox(sbox2, s2, s1, s0, s3);\n    const t3 = xk[k++] ^ applySbox(sbox2, s3, s2, s1, s0);\n    return { s0: t0, s1: t1, s2: t2, s3: t3 };\n}\nfunction getDst(len, dst) {\n    if (!dst)\n        return new Uint8Array(len);\n    abytes(dst);\n    if (dst.length < len)\n        throw new Error(`aes: wrong destination length, expected at least ${len}, got: ${dst.length}`);\n    return dst;\n}\n// TODO: investigate merging with ctr32\nfunction ctrCounter(xk, nonce, src, dst) {\n    abytes(nonce, BLOCK_SIZE);\n    abytes(src);\n    const srcLen = src.length;\n    dst = getDst(srcLen, dst);\n    const ctr = nonce;\n    const c32 = u32(ctr);\n    // Fill block (empty, ctr=0)\n    let { s0, s1, s2, s3 } = encrypt(xk, c32[0], c32[1], c32[2], c32[3]);\n    const src32 = u32(src);\n    const dst32 = u32(dst);\n    // process blocks\n    for (let i = 0; i + 4 <= src32.length; i += 4) {\n        dst32[i + 0] = src32[i + 0] ^ s0;\n        dst32[i + 1] = src32[i + 1] ^ s1;\n        dst32[i + 2] = src32[i + 2] ^ s2;\n        dst32[i + 3] = src32[i + 3] ^ s3;\n        // Full 128 bit counter with wrap around\n        let carry = 1;\n        for (let i = ctr.length - 1; i >= 0; i--) {\n            carry = (carry + (ctr[i] & 0xff)) | 0;\n            ctr[i] = carry & 0xff;\n            carry >>>= 8;\n        }\n        ({ s0, s1, s2, s3 } = encrypt(xk, c32[0], c32[1], c32[2], c32[3]));\n    }\n    // leftovers (less than block)\n    // It's possible to handle > u32 fast, but is it worth it?\n    const start = BLOCK_SIZE * Math.floor(src32.length / BLOCK_SIZE32);\n    if (start < srcLen) {\n        const b32 = new Uint32Array([s0, s1, s2, s3]);\n        const buf = u8(b32);\n        for (let i = start, pos = 0; i < srcLen; i++, pos++)\n            dst[i] = src[i] ^ buf[pos];\n    }\n    return dst;\n}\n// AES CTR with overflowing 32 bit counter\n// It's possible to do 32le significantly simpler (and probably faster) by using u32.\n// But, we need both, and perf bottleneck is in ghash anyway.\nfunction ctr32(xk, isLE, nonce, src, dst) {\n    abytes(nonce, BLOCK_SIZE);\n    abytes(src);\n    dst = getDst(src.length, dst);\n    const ctr = nonce; // write new value to nonce, so it can be re-used\n    const c32 = u32(ctr);\n    const view = createView(ctr);\n    const src32 = u32(src);\n    const dst32 = u32(dst);\n    const ctrPos = isLE ? 0 : 12;\n    const srcLen = src.length;\n    // Fill block (empty, ctr=0)\n    let ctrNum = view.getUint32(ctrPos, isLE); // read current counter value\n    let { s0, s1, s2, s3 } = encrypt(xk, c32[0], c32[1], c32[2], c32[3]);\n    // process blocks\n    for (let i = 0; i + 4 <= src32.length; i += 4) {\n        dst32[i + 0] = src32[i + 0] ^ s0;\n        dst32[i + 1] = src32[i + 1] ^ s1;\n        dst32[i + 2] = src32[i + 2] ^ s2;\n        dst32[i + 3] = src32[i + 3] ^ s3;\n        ctrNum = (ctrNum + 1) >>> 0; // u32 wrap\n        view.setUint32(ctrPos, ctrNum, isLE);\n        ({ s0, s1, s2, s3 } = encrypt(xk, c32[0], c32[1], c32[2], c32[3]));\n    }\n    // leftovers (less than a block)\n    const start = BLOCK_SIZE * Math.floor(src32.length / BLOCK_SIZE32);\n    if (start < srcLen) {\n        const b32 = new Uint32Array([s0, s1, s2, s3]);\n        const buf = u8(b32);\n        for (let i = start, pos = 0; i < srcLen; i++, pos++)\n            dst[i] = src[i] ^ buf[pos];\n    }\n    return dst;\n}\n/**\n * CTR: counter mode. Creates stream cipher.\n * Requires good IV. Parallelizable. OK, but no MAC.\n */\nexport const ctr = wrapCipher({ blockSize: 16, nonceLength: 16 }, function ctr(key, nonce) {\n    abytes(key);\n    abytes(nonce, BLOCK_SIZE);\n    function processCtr(buf, dst) {\n        const xk = expandKeyLE(key);\n        const n = nonce.slice();\n        const out = ctrCounter(xk, n, buf, dst);\n        xk.fill(0);\n        n.fill(0);\n        return out;\n    }\n    return {\n        encrypt: (plaintext, dst) => processCtr(plaintext, dst),\n        decrypt: (ciphertext, dst) => processCtr(ciphertext, dst),\n    };\n});\nfunction validateBlockDecrypt(data) {\n    abytes(data);\n    if (data.length % BLOCK_SIZE !== 0) {\n        throw new Error(`aes/(cbc-ecb).decrypt ciphertext should consist of blocks with size ${BLOCK_SIZE}`);\n    }\n}\nfunction validateBlockEncrypt(plaintext, pcks5, dst) {\n    let outLen = plaintext.length;\n    const remaining = outLen % BLOCK_SIZE;\n    if (!pcks5 && remaining !== 0)\n        throw new Error('aec/(cbc-ecb): unpadded plaintext with disabled padding');\n    const b = u32(plaintext);\n    if (pcks5) {\n        let left = BLOCK_SIZE - remaining;\n        if (!left)\n            left = BLOCK_SIZE; // if no bytes left, create empty padding block\n        outLen = outLen + left;\n    }\n    const out = getDst(outLen, dst);\n    const o = u32(out);\n    return { b, o, out };\n}\nfunction validatePCKS(data, pcks5) {\n    if (!pcks5)\n        return data;\n    const len = data.length;\n    if (!len)\n        throw new Error(`aes/pcks5: empty ciphertext not allowed`);\n    const lastByte = data[len - 1];\n    if (lastByte <= 0 || lastByte > 16)\n        throw new Error(`aes/pcks5: wrong padding byte: ${lastByte}`);\n    const out = data.subarray(0, -lastByte);\n    for (let i = 0; i < lastByte; i++)\n        if (data[len - i - 1] !== lastByte)\n            throw new Error(`aes/pcks5: wrong padding`);\n    return out;\n}\nfunction padPCKS(left) {\n    const tmp = new Uint8Array(16);\n    const tmp32 = u32(tmp);\n    tmp.set(left);\n    const paddingByte = BLOCK_SIZE - left.length;\n    for (let i = BLOCK_SIZE - paddingByte; i < BLOCK_SIZE; i++)\n        tmp[i] = paddingByte;\n    return tmp32;\n}\n/**\n * ECB: Electronic CodeBook. Simple deterministic replacement.\n * Dangerous: always map x to y. See [AES Penguin](https://words.filippo.io/the-ecb-penguin/).\n */\nexport const ecb = wrapCipher({ blockSize: 16 }, function ecb(key, opts = {}) {\n    abytes(key);\n    const pcks5 = !opts.disablePadding;\n    return {\n        encrypt: (plaintext, dst) => {\n            abytes(plaintext);\n            const { b, o, out: _out } = validateBlockEncrypt(plaintext, pcks5, dst);\n            const xk = expandKeyLE(key);\n            let i = 0;\n            for (; i + 4 <= b.length;) {\n                const { s0, s1, s2, s3 } = encrypt(xk, b[i + 0], b[i + 1], b[i + 2], b[i + 3]);\n                (o[i++] = s0), (o[i++] = s1), (o[i++] = s2), (o[i++] = s3);\n            }\n            if (pcks5) {\n                const tmp32 = padPCKS(plaintext.subarray(i * 4));\n                const { s0, s1, s2, s3 } = encrypt(xk, tmp32[0], tmp32[1], tmp32[2], tmp32[3]);\n                (o[i++] = s0), (o[i++] = s1), (o[i++] = s2), (o[i++] = s3);\n            }\n            xk.fill(0);\n            return _out;\n        },\n        decrypt: (ciphertext, dst) => {\n            validateBlockDecrypt(ciphertext);\n            const xk = expandKeyDecLE(key);\n            const out = getDst(ciphertext.length, dst);\n            const b = u32(ciphertext);\n            const o = u32(out);\n            for (let i = 0; i + 4 <= b.length;) {\n                const { s0, s1, s2, s3 } = decrypt(xk, b[i + 0], b[i + 1], b[i + 2], b[i + 3]);\n                (o[i++] = s0), (o[i++] = s1), (o[i++] = s2), (o[i++] = s3);\n            }\n            xk.fill(0);\n            return validatePCKS(out, pcks5);\n        },\n    };\n});\n/**\n * CBC: Cipher-Block-Chaining. Key is previous round’s block.\n * Fragile: needs proper padding. Unauthenticated: needs MAC.\n */\nexport const cbc = wrapCipher({ blockSize: 16, nonceLength: 16 }, function cbc(key, iv, opts = {}) {\n    abytes(key);\n    abytes(iv, 16);\n    const pcks5 = !opts.disablePadding;\n    return {\n        encrypt: (plaintext, dst) => {\n            const xk = expandKeyLE(key);\n            const { b, o, out: _out } = validateBlockEncrypt(plaintext, pcks5, dst);\n            const n32 = u32(iv);\n            // prettier-ignore\n            let s0 = n32[0], s1 = n32[1], s2 = n32[2], s3 = n32[3];\n            let i = 0;\n            for (; i + 4 <= b.length;) {\n                (s0 ^= b[i + 0]), (s1 ^= b[i + 1]), (s2 ^= b[i + 2]), (s3 ^= b[i + 3]);\n                ({ s0, s1, s2, s3 } = encrypt(xk, s0, s1, s2, s3));\n                (o[i++] = s0), (o[i++] = s1), (o[i++] = s2), (o[i++] = s3);\n            }\n            if (pcks5) {\n                const tmp32 = padPCKS(plaintext.subarray(i * 4));\n                (s0 ^= tmp32[0]), (s1 ^= tmp32[1]), (s2 ^= tmp32[2]), (s3 ^= tmp32[3]);\n                ({ s0, s1, s2, s3 } = encrypt(xk, s0, s1, s2, s3));\n                (o[i++] = s0), (o[i++] = s1), (o[i++] = s2), (o[i++] = s3);\n            }\n            xk.fill(0);\n            return _out;\n        },\n        decrypt: (ciphertext, dst) => {\n            validateBlockDecrypt(ciphertext);\n            const xk = expandKeyDecLE(key);\n            const n32 = u32(iv);\n            const out = getDst(ciphertext.length, dst);\n            const b = u32(ciphertext);\n            const o = u32(out);\n            // prettier-ignore\n            let s0 = n32[0], s1 = n32[1], s2 = n32[2], s3 = n32[3];\n            for (let i = 0; i + 4 <= b.length;) {\n                // prettier-ignore\n                const ps0 = s0, ps1 = s1, ps2 = s2, ps3 = s3;\n                (s0 = b[i + 0]), (s1 = b[i + 1]), (s2 = b[i + 2]), (s3 = b[i + 3]);\n                const { s0: o0, s1: o1, s2: o2, s3: o3 } = decrypt(xk, s0, s1, s2, s3);\n                (o[i++] = o0 ^ ps0), (o[i++] = o1 ^ ps1), (o[i++] = o2 ^ ps2), (o[i++] = o3 ^ ps3);\n            }\n            xk.fill(0);\n            return validatePCKS(out, pcks5);\n        },\n    };\n});\n/**\n * CFB: Cipher Feedback Mode. The input for the block cipher is the previous cipher output.\n * Unauthenticated: needs MAC.\n */\nexport const cfb = wrapCipher({ blockSize: 16, nonceLength: 16 }, function cfb(key, iv) {\n    abytes(key);\n    abytes(iv, 16);\n    function processCfb(src, isEncrypt, dst) {\n        const xk = expandKeyLE(key);\n        const srcLen = src.length;\n        dst = getDst(srcLen, dst);\n        const src32 = u32(src);\n        const dst32 = u32(dst);\n        const next32 = isEncrypt ? dst32 : src32;\n        const n32 = u32(iv);\n        // prettier-ignore\n        let s0 = n32[0], s1 = n32[1], s2 = n32[2], s3 = n32[3];\n        for (let i = 0; i + 4 <= src32.length;) {\n            const { s0: e0, s1: e1, s2: e2, s3: e3 } = encrypt(xk, s0, s1, s2, s3);\n            dst32[i + 0] = src32[i + 0] ^ e0;\n            dst32[i + 1] = src32[i + 1] ^ e1;\n            dst32[i + 2] = src32[i + 2] ^ e2;\n            dst32[i + 3] = src32[i + 3] ^ e3;\n            (s0 = next32[i++]), (s1 = next32[i++]), (s2 = next32[i++]), (s3 = next32[i++]);\n        }\n        // leftovers (less than block)\n        const start = BLOCK_SIZE * Math.floor(src32.length / BLOCK_SIZE32);\n        if (start < srcLen) {\n            ({ s0, s1, s2, s3 } = encrypt(xk, s0, s1, s2, s3));\n            const buf = u8(new Uint32Array([s0, s1, s2, s3]));\n            for (let i = start, pos = 0; i < srcLen; i++, pos++)\n                dst[i] = src[i] ^ buf[pos];\n            buf.fill(0);\n        }\n        xk.fill(0);\n        return dst;\n    }\n    return {\n        encrypt: (plaintext, dst) => processCfb(plaintext, true, dst),\n        decrypt: (ciphertext, dst) => processCfb(ciphertext, false, dst),\n    };\n});\n// TODO: merge with chacha, however gcm has bitLen while chacha has byteLen\nfunction computeTag(fn, isLE, key, data, AAD) {\n    const h = fn.create(key, data.length + (AAD?.length || 0));\n    if (AAD)\n        h.update(AAD);\n    h.update(data);\n    const num = new Uint8Array(16);\n    const view = createView(num);\n    if (AAD)\n        setBigUint64(view, 0, BigInt(AAD.length * 8), isLE);\n    setBigUint64(view, 8, BigInt(data.length * 8), isLE);\n    h.update(num);\n    return h.digest();\n}\n/**\n * GCM: Galois/Counter Mode.\n * Good, modern version of CTR, parallel, with MAC.\n * Be careful: MACs can be forged.\n */\nexport const gcm = wrapCipher({ blockSize: 16, nonceLength: 12, tagLength: 16 }, function gcm(key, nonce, AAD) {\n    abytes(nonce);\n    // Nonce can be pretty much anything (even 1 byte). But smaller nonces less secure.\n    if (nonce.length === 0)\n        throw new Error('aes/gcm: empty nonce');\n    const tagLength = 16;\n    function _computeTag(authKey, tagMask, data) {\n        const tag = computeTag(ghash, false, authKey, data, AAD);\n        for (let i = 0; i < tagMask.length; i++)\n            tag[i] ^= tagMask[i];\n        return tag;\n    }\n    function deriveKeys() {\n        const xk = expandKeyLE(key);\n        const authKey = EMPTY_BLOCK.slice();\n        const counter = EMPTY_BLOCK.slice();\n        ctr32(xk, false, counter, counter, authKey);\n        if (nonce.length === 12) {\n            counter.set(nonce);\n        }\n        else {\n            // Spec (NIST 800-38d) supports variable size nonce.\n            // Not supported for now, but can be useful.\n            const nonceLen = EMPTY_BLOCK.slice();\n            const view = createView(nonceLen);\n            setBigUint64(view, 8, BigInt(nonce.length * 8), false);\n            // ghash(nonce || u64be(0) || u64be(nonceLen*8))\n            ghash.create(authKey).update(nonce).update(nonceLen).digestInto(counter);\n        }\n        const tagMask = ctr32(xk, false, counter, EMPTY_BLOCK);\n        return { xk, authKey, counter, tagMask };\n    }\n    return {\n        encrypt: (plaintext) => {\n            abytes(plaintext);\n            const { xk, authKey, counter, tagMask } = deriveKeys();\n            const out = new Uint8Array(plaintext.length + tagLength);\n            ctr32(xk, false, counter, plaintext, out);\n            const tag = _computeTag(authKey, tagMask, out.subarray(0, out.length - tagLength));\n            out.set(tag, plaintext.length);\n            xk.fill(0);\n            return out;\n        },\n        decrypt: (ciphertext) => {\n            abytes(ciphertext);\n            if (ciphertext.length < tagLength)\n                throw new Error(`aes/gcm: ciphertext less than tagLen (${tagLength})`);\n            const { xk, authKey, counter, tagMask } = deriveKeys();\n            const data = ciphertext.subarray(0, -tagLength);\n            const passedTag = ciphertext.subarray(-tagLength);\n            const tag = _computeTag(authKey, tagMask, data);\n            if (!equalBytes(tag, passedTag))\n                throw new Error('aes/gcm: invalid ghash tag');\n            const out = ctr32(xk, false, counter, data);\n            authKey.fill(0);\n            tagMask.fill(0);\n            xk.fill(0);\n            return out;\n        },\n    };\n});\nconst limit = (name, min, max) => (value) => {\n    if (!Number.isSafeInteger(value) || min > value || value > max)\n        throw new Error(`${name}: invalid value=${value}, must be [${min}..${max}]`);\n};\n/**\n * AES-GCM-SIV: classic AES-GCM with nonce-misuse resistance.\n * Guarantees that, when a nonce is repeated, the only security loss is that identical\n * plaintexts will produce identical ciphertexts.\n * RFC 8452, https://datatracker.ietf.org/doc/html/rfc8452\n */\nexport const siv = wrapCipher({ blockSize: 16, nonceLength: 12, tagLength: 16 }, function siv(key, nonce, AAD) {\n    const tagLength = 16;\n    // From RFC 8452: Section 6\n    const AAD_LIMIT = limit('AAD', 0, 2 ** 36);\n    const PLAIN_LIMIT = limit('plaintext', 0, 2 ** 36);\n    const NONCE_LIMIT = limit('nonce', 12, 12);\n    const CIPHER_LIMIT = limit('ciphertext', 16, 2 ** 36 + 16);\n    abytes(nonce);\n    NONCE_LIMIT(nonce.length);\n    if (AAD) {\n        abytes(AAD);\n        AAD_LIMIT(AAD.length);\n    }\n    function deriveKeys() {\n        const len = key.length;\n        if (len !== 16 && len !== 24 && len !== 32)\n            throw new Error(`key length must be 16, 24 or 32 bytes, got: ${len} bytes`);\n        const xk = expandKeyLE(key);\n        const encKey = new Uint8Array(len);\n        const authKey = new Uint8Array(16);\n        const n32 = u32(nonce);\n        // prettier-ignore\n        let s0 = 0, s1 = n32[0], s2 = n32[1], s3 = n32[2];\n        let counter = 0;\n        for (const derivedKey of [authKey, encKey].map(u32)) {\n            const d32 = u32(derivedKey);\n            for (let i = 0; i < d32.length; i += 2) {\n                // aes(u32le(0) || nonce)[:8] || aes(u32le(1) || nonce)[:8] ...\n                const { s0: o0, s1: o1 } = encrypt(xk, s0, s1, s2, s3);\n                d32[i + 0] = o0;\n                d32[i + 1] = o1;\n                s0 = ++counter; // increment counter inside state\n            }\n        }\n        xk.fill(0);\n        return { authKey, encKey: expandKeyLE(encKey) };\n    }\n    function _computeTag(encKey, authKey, data) {\n        const tag = computeTag(polyval, true, authKey, data, AAD);\n        // Compute the expected tag by XORing S_s and the nonce, clearing the\n        // most significant bit of the last byte and encrypting with the\n        // message-encryption key.\n        for (let i = 0; i < 12; i++)\n            tag[i] ^= nonce[i];\n        tag[15] &= 0x7f; // Clear the highest bit\n        // encrypt tag as block\n        const t32 = u32(tag);\n        // prettier-ignore\n        let s0 = t32[0], s1 = t32[1], s2 = t32[2], s3 = t32[3];\n        ({ s0, s1, s2, s3 } = encrypt(encKey, s0, s1, s2, s3));\n        (t32[0] = s0), (t32[1] = s1), (t32[2] = s2), (t32[3] = s3);\n        return tag;\n    }\n    // actual decrypt/encrypt of message.\n    function processSiv(encKey, tag, input) {\n        let block = tag.slice();\n        block[15] |= 0x80; // Force highest bit\n        return ctr32(encKey, true, block, input);\n    }\n    return {\n        encrypt: (plaintext) => {\n            abytes(plaintext);\n            PLAIN_LIMIT(plaintext.length);\n            const { encKey, authKey } = deriveKeys();\n            const tag = _computeTag(encKey, authKey, plaintext);\n            const out = new Uint8Array(plaintext.length + tagLength);\n            out.set(tag, plaintext.length);\n            out.set(processSiv(encKey, tag, plaintext));\n            encKey.fill(0);\n            authKey.fill(0);\n            return out;\n        },\n        decrypt: (ciphertext) => {\n            abytes(ciphertext);\n            CIPHER_LIMIT(ciphertext.length);\n            const tag = ciphertext.subarray(-tagLength);\n            const { encKey, authKey } = deriveKeys();\n            const plaintext = processSiv(encKey, tag, ciphertext.subarray(0, -tagLength));\n            const expectedTag = _computeTag(encKey, authKey, plaintext);\n            encKey.fill(0);\n            authKey.fill(0);\n            if (!equalBytes(tag, expectedTag))\n                throw new Error('invalid polyval tag');\n            return plaintext;\n        },\n    };\n});\nfunction isBytes32(a) {\n    return (a != null &&\n        typeof a === 'object' &&\n        (a instanceof Uint32Array || a.constructor.name === 'Uint32Array'));\n}\nfunction encryptBlock(xk, block) {\n    abytes(block, 16);\n    if (!isBytes32(xk))\n        throw new Error('_encryptBlock accepts result of expandKeyLE');\n    const b32 = u32(block);\n    let { s0, s1, s2, s3 } = encrypt(xk, b32[0], b32[1], b32[2], b32[3]);\n    (b32[0] = s0), (b32[1] = s1), (b32[2] = s2), (b32[3] = s3);\n    return block;\n}\nfunction decryptBlock(xk, block) {\n    abytes(block, 16);\n    if (!isBytes32(xk))\n        throw new Error('_decryptBlock accepts result of expandKeyLE');\n    const b32 = u32(block);\n    let { s0, s1, s2, s3 } = decrypt(xk, b32[0], b32[1], b32[2], b32[3]);\n    (b32[0] = s0), (b32[1] = s1), (b32[2] = s2), (b32[3] = s3);\n    return block;\n}\n// Highly unsafe private functions for implementing new modes or ciphers based on AES\n// Can change at any time, no API guarantees\nexport const unsafe = {\n    expandKeyLE,\n    expandKeyDecLE,\n    encrypt,\n    decrypt,\n    encryptBlock,\n    decryptBlock,\n    ctrCounter,\n    ctr32,\n};\n//# sourceMappingURL=aes.js.map","// Basic utils for ARX (add-rotate-xor) salsa and chacha ciphers.\nimport { number as anumber, bytes as abytes, bool as abool } from './_assert.js';\nimport { checkOpts, u32 } from './utils.js';\n/*\nRFC8439 requires multi-step cipher stream, where\nauthKey starts with counter: 0, actual msg with counter: 1.\n\nFor this, we need a way to re-use nonce / counter:\n\n    const counter = new Uint8Array(4);\n    chacha(..., counter, ...); // counter is now 1\n    chacha(..., counter, ...); // counter is now 2\n\nThis is complicated:\n\n- 32-bit counters are enough, no need for 64-bit: max ArrayBuffer size in JS is 4GB\n- Original papers don't allow mutating counters\n- Counter overflow is undefined [^1]\n- Idea A: allow providing (nonce | counter) instead of just nonce, re-use it\n- Caveat: Cannot be re-used through all cases:\n- * chacha has (counter | nonce)\n- * xchacha has (nonce16 | counter | nonce16)\n- Idea B: separate nonce / counter and provide separate API for counter re-use\n- Caveat: there are different counter sizes depending on an algorithm.\n- salsa & chacha also differ in structures of key & sigma:\n  salsa20:      s[0] | k(4) | s[1] | nonce(2) | ctr(2) | s[2] | k(4) | s[3]\n  chacha:       s(4) | k(8) | ctr(1) | nonce(3)\n  chacha20orig: s(4) | k(8) | ctr(2) | nonce(2)\n- Idea C: helper method such as `setSalsaState(key, nonce, sigma, data)`\n- Caveat: we can't re-use counter array\n\nxchacha [^2] uses the subkey and remaining 8 byte nonce with ChaCha20 as normal\n(prefixed by 4 NUL bytes, since [RFC8439] specifies a 12-byte nonce).\n\n[^1]: https://mailarchive.ietf.org/arch/msg/cfrg/gsOnTJzcbgG6OqD8Sc0GO5aR_tU/\n[^2]: https://datatracker.ietf.org/doc/html/draft-irtf-cfrg-xchacha#appendix-A.2\n*/\n// We can't make top-level var depend on utils.utf8ToBytes\n// because it's not present in all envs. Creating a similar fn here\nconst _utf8ToBytes = (str) => Uint8Array.from(str.split('').map((c) => c.charCodeAt(0)));\nconst sigma16 = _utf8ToBytes('expand 16-byte k');\nconst sigma32 = _utf8ToBytes('expand 32-byte k');\nconst sigma16_32 = u32(sigma16);\nconst sigma32_32 = u32(sigma32);\nexport const sigma = sigma32_32.slice();\nexport function rotl(a, b) {\n    return (a << b) | (a >>> (32 - b));\n}\n// Is byte array aligned to 4 byte offset (u32)?\nfunction isAligned32(b) {\n    return b.byteOffset % 4 === 0;\n}\n// Salsa and Chacha block length is always 512-bit\nconst BLOCK_LEN = 64;\nconst BLOCK_LEN32 = 16;\n// new Uint32Array([2**32])   // => Uint32Array(1) [ 0 ]\n// new Uint32Array([2**32-1]) // => Uint32Array(1) [ 4294967295 ]\nconst MAX_COUNTER = 2 ** 32 - 1;\nconst U32_EMPTY = new Uint32Array();\nfunction runCipher(core, sigma, key, nonce, data, output, counter, rounds) {\n    const len = data.length;\n    const block = new Uint8Array(BLOCK_LEN);\n    const b32 = u32(block);\n    // Make sure that buffers aligned to 4 bytes\n    const isAligned = isAligned32(data) && isAligned32(output);\n    const d32 = isAligned ? u32(data) : U32_EMPTY;\n    const o32 = isAligned ? u32(output) : U32_EMPTY;\n    for (let pos = 0; pos < len; counter++) {\n        core(sigma, key, nonce, b32, counter, rounds);\n        if (counter >= MAX_COUNTER)\n            throw new Error('arx: counter overflow');\n        const take = Math.min(BLOCK_LEN, len - pos);\n        // aligned to 4 bytes\n        if (isAligned && take === BLOCK_LEN) {\n            const pos32 = pos / 4;\n            if (pos % 4 !== 0)\n                throw new Error('arx: invalid block position');\n            for (let j = 0, posj; j < BLOCK_LEN32; j++) {\n                posj = pos32 + j;\n                o32[posj] = d32[posj] ^ b32[j];\n            }\n            pos += BLOCK_LEN;\n            continue;\n        }\n        for (let j = 0, posj; j < take; j++) {\n            posj = pos + j;\n            output[posj] = data[posj] ^ block[j];\n        }\n        pos += take;\n    }\n}\nexport function createCipher(core, opts) {\n    const { allowShortKeys, extendNonceFn, counterLength, counterRight, rounds } = checkOpts({ allowShortKeys: false, counterLength: 8, counterRight: false, rounds: 20 }, opts);\n    if (typeof core !== 'function')\n        throw new Error('core must be a function');\n    anumber(counterLength);\n    anumber(rounds);\n    abool(counterRight);\n    abool(allowShortKeys);\n    return (key, nonce, data, output, counter = 0) => {\n        abytes(key);\n        abytes(nonce);\n        abytes(data);\n        const len = data.length;\n        if (!output)\n            output = new Uint8Array(len);\n        abytes(output);\n        anumber(counter);\n        if (counter < 0 || counter >= MAX_COUNTER)\n            throw new Error('arx: counter overflow');\n        if (output.length < len)\n            throw new Error(`arx: output (${output.length}) is shorter than data (${len})`);\n        const toClean = [];\n        // Key & sigma\n        // key=16 -> sigma16, k=key|key\n        // key=32 -> sigma32, k=key\n        let l = key.length, k, sigma;\n        if (l === 32) {\n            k = key.slice();\n            toClean.push(k);\n            sigma = sigma32_32;\n        }\n        else if (l === 16 && allowShortKeys) {\n            k = new Uint8Array(32);\n            k.set(key);\n            k.set(key, 16);\n            sigma = sigma16_32;\n            toClean.push(k);\n        }\n        else {\n            throw new Error(`arx: invalid 32-byte key, got length=${l}`);\n        }\n        // Nonce\n        // salsa20:      8   (8-byte counter)\n        // chacha20orig: 8   (8-byte counter)\n        // chacha20:     12  (4-byte counter)\n        // xsalsa20:     24  (16 -> hsalsa,  8 -> old nonce)\n        // xchacha20:    24  (16 -> hchacha, 8 -> old nonce)\n        // Align nonce to 4 bytes\n        if (!isAligned32(nonce)) {\n            nonce = nonce.slice();\n            toClean.push(nonce);\n        }\n        const k32 = u32(k);\n        // hsalsa & hchacha: handle extended nonce\n        if (extendNonceFn) {\n            if (nonce.length !== 24)\n                throw new Error(`arx: extended nonce must be 24 bytes`);\n            extendNonceFn(sigma, k32, u32(nonce.subarray(0, 16)), k32);\n            nonce = nonce.subarray(16);\n        }\n        // Handle nonce counter\n        const nonceNcLen = 16 - counterLength;\n        if (nonceNcLen !== nonce.length)\n            throw new Error(`arx: nonce must be ${nonceNcLen} or 16 bytes`);\n        // Pad counter when nonce is 64 bit\n        if (nonceNcLen !== 12) {\n            const nc = new Uint8Array(12);\n            nc.set(nonce, counterRight ? 0 : 12 - nonce.length);\n            nonce = nc;\n            toClean.push(nonce);\n        }\n        const n32 = u32(nonce);\n        runCipher(core, sigma, k32, n32, data, output, counter, rounds);\n        while (toClean.length > 0)\n            toClean.pop().fill(0);\n        return output;\n    };\n}\n//# sourceMappingURL=_arx.js.map","// prettier-ignore\nimport { wrapCipher, createView, equalBytes, setBigUint64, } from './utils.js';\nimport { poly1305 } from './_poly1305.js';\nimport { createCipher, rotl } from './_arx.js';\nimport { bytes as abytes } from './_assert.js';\n// ChaCha20 stream cipher was released in 2008. ChaCha aims to increase\n// the diffusion per round, but had slightly less cryptanalysis.\n// https://cr.yp.to/chacha.html, http://cr.yp.to/chacha/chacha-20080128.pdf\n/**\n * ChaCha core function.\n */\n// prettier-ignore\nfunction chachaCore(s, k, n, out, cnt, rounds = 20) {\n    let y00 = s[0], y01 = s[1], y02 = s[2], y03 = s[3], // \"expa\"   \"nd 3\"  \"2-by\"  \"te k\"\n    y04 = k[0], y05 = k[1], y06 = k[2], y07 = k[3], // Key      Key     Key     Key\n    y08 = k[4], y09 = k[5], y10 = k[6], y11 = k[7], // Key      Key     Key     Key\n    y12 = cnt, y13 = n[0], y14 = n[1], y15 = n[2]; // Counter  Counter\tNonce   Nonce\n    // Save state to temporary variables\n    let x00 = y00, x01 = y01, x02 = y02, x03 = y03, x04 = y04, x05 = y05, x06 = y06, x07 = y07, x08 = y08, x09 = y09, x10 = y10, x11 = y11, x12 = y12, x13 = y13, x14 = y14, x15 = y15;\n    for (let r = 0; r < rounds; r += 2) {\n        x00 = (x00 + x04) | 0;\n        x12 = rotl(x12 ^ x00, 16);\n        x08 = (x08 + x12) | 0;\n        x04 = rotl(x04 ^ x08, 12);\n        x00 = (x00 + x04) | 0;\n        x12 = rotl(x12 ^ x00, 8);\n        x08 = (x08 + x12) | 0;\n        x04 = rotl(x04 ^ x08, 7);\n        x01 = (x01 + x05) | 0;\n        x13 = rotl(x13 ^ x01, 16);\n        x09 = (x09 + x13) | 0;\n        x05 = rotl(x05 ^ x09, 12);\n        x01 = (x01 + x05) | 0;\n        x13 = rotl(x13 ^ x01, 8);\n        x09 = (x09 + x13) | 0;\n        x05 = rotl(x05 ^ x09, 7);\n        x02 = (x02 + x06) | 0;\n        x14 = rotl(x14 ^ x02, 16);\n        x10 = (x10 + x14) | 0;\n        x06 = rotl(x06 ^ x10, 12);\n        x02 = (x02 + x06) | 0;\n        x14 = rotl(x14 ^ x02, 8);\n        x10 = (x10 + x14) | 0;\n        x06 = rotl(x06 ^ x10, 7);\n        x03 = (x03 + x07) | 0;\n        x15 = rotl(x15 ^ x03, 16);\n        x11 = (x11 + x15) | 0;\n        x07 = rotl(x07 ^ x11, 12);\n        x03 = (x03 + x07) | 0;\n        x15 = rotl(x15 ^ x03, 8);\n        x11 = (x11 + x15) | 0;\n        x07 = rotl(x07 ^ x11, 7);\n        x00 = (x00 + x05) | 0;\n        x15 = rotl(x15 ^ x00, 16);\n        x10 = (x10 + x15) | 0;\n        x05 = rotl(x05 ^ x10, 12);\n        x00 = (x00 + x05) | 0;\n        x15 = rotl(x15 ^ x00, 8);\n        x10 = (x10 + x15) | 0;\n        x05 = rotl(x05 ^ x10, 7);\n        x01 = (x01 + x06) | 0;\n        x12 = rotl(x12 ^ x01, 16);\n        x11 = (x11 + x12) | 0;\n        x06 = rotl(x06 ^ x11, 12);\n        x01 = (x01 + x06) | 0;\n        x12 = rotl(x12 ^ x01, 8);\n        x11 = (x11 + x12) | 0;\n        x06 = rotl(x06 ^ x11, 7);\n        x02 = (x02 + x07) | 0;\n        x13 = rotl(x13 ^ x02, 16);\n        x08 = (x08 + x13) | 0;\n        x07 = rotl(x07 ^ x08, 12);\n        x02 = (x02 + x07) | 0;\n        x13 = rotl(x13 ^ x02, 8);\n        x08 = (x08 + x13) | 0;\n        x07 = rotl(x07 ^ x08, 7);\n        x03 = (x03 + x04) | 0;\n        x14 = rotl(x14 ^ x03, 16);\n        x09 = (x09 + x14) | 0;\n        x04 = rotl(x04 ^ x09, 12);\n        x03 = (x03 + x04) | 0;\n        x14 = rotl(x14 ^ x03, 8);\n        x09 = (x09 + x14) | 0;\n        x04 = rotl(x04 ^ x09, 7);\n    }\n    // Write output\n    let oi = 0;\n    out[oi++] = (y00 + x00) | 0;\n    out[oi++] = (y01 + x01) | 0;\n    out[oi++] = (y02 + x02) | 0;\n    out[oi++] = (y03 + x03) | 0;\n    out[oi++] = (y04 + x04) | 0;\n    out[oi++] = (y05 + x05) | 0;\n    out[oi++] = (y06 + x06) | 0;\n    out[oi++] = (y07 + x07) | 0;\n    out[oi++] = (y08 + x08) | 0;\n    out[oi++] = (y09 + x09) | 0;\n    out[oi++] = (y10 + x10) | 0;\n    out[oi++] = (y11 + x11) | 0;\n    out[oi++] = (y12 + x12) | 0;\n    out[oi++] = (y13 + x13) | 0;\n    out[oi++] = (y14 + x14) | 0;\n    out[oi++] = (y15 + x15) | 0;\n}\n/**\n * hchacha helper method, used primarily in xchacha, to hash\n * key and nonce into key' and nonce'.\n * Same as chachaCore, but there doesn't seem to be a way to move the block\n * out without 25% performance hit.\n */\n// prettier-ignore\nexport function hchacha(s, k, i, o32) {\n    let x00 = s[0], x01 = s[1], x02 = s[2], x03 = s[3], x04 = k[0], x05 = k[1], x06 = k[2], x07 = k[3], x08 = k[4], x09 = k[5], x10 = k[6], x11 = k[7], x12 = i[0], x13 = i[1], x14 = i[2], x15 = i[3];\n    for (let r = 0; r < 20; r += 2) {\n        x00 = (x00 + x04) | 0;\n        x12 = rotl(x12 ^ x00, 16);\n        x08 = (x08 + x12) | 0;\n        x04 = rotl(x04 ^ x08, 12);\n        x00 = (x00 + x04) | 0;\n        x12 = rotl(x12 ^ x00, 8);\n        x08 = (x08 + x12) | 0;\n        x04 = rotl(x04 ^ x08, 7);\n        x01 = (x01 + x05) | 0;\n        x13 = rotl(x13 ^ x01, 16);\n        x09 = (x09 + x13) | 0;\n        x05 = rotl(x05 ^ x09, 12);\n        x01 = (x01 + x05) | 0;\n        x13 = rotl(x13 ^ x01, 8);\n        x09 = (x09 + x13) | 0;\n        x05 = rotl(x05 ^ x09, 7);\n        x02 = (x02 + x06) | 0;\n        x14 = rotl(x14 ^ x02, 16);\n        x10 = (x10 + x14) | 0;\n        x06 = rotl(x06 ^ x10, 12);\n        x02 = (x02 + x06) | 0;\n        x14 = rotl(x14 ^ x02, 8);\n        x10 = (x10 + x14) | 0;\n        x06 = rotl(x06 ^ x10, 7);\n        x03 = (x03 + x07) | 0;\n        x15 = rotl(x15 ^ x03, 16);\n        x11 = (x11 + x15) | 0;\n        x07 = rotl(x07 ^ x11, 12);\n        x03 = (x03 + x07) | 0;\n        x15 = rotl(x15 ^ x03, 8);\n        x11 = (x11 + x15) | 0;\n        x07 = rotl(x07 ^ x11, 7);\n        x00 = (x00 + x05) | 0;\n        x15 = rotl(x15 ^ x00, 16);\n        x10 = (x10 + x15) | 0;\n        x05 = rotl(x05 ^ x10, 12);\n        x00 = (x00 + x05) | 0;\n        x15 = rotl(x15 ^ x00, 8);\n        x10 = (x10 + x15) | 0;\n        x05 = rotl(x05 ^ x10, 7);\n        x01 = (x01 + x06) | 0;\n        x12 = rotl(x12 ^ x01, 16);\n        x11 = (x11 + x12) | 0;\n        x06 = rotl(x06 ^ x11, 12);\n        x01 = (x01 + x06) | 0;\n        x12 = rotl(x12 ^ x01, 8);\n        x11 = (x11 + x12) | 0;\n        x06 = rotl(x06 ^ x11, 7);\n        x02 = (x02 + x07) | 0;\n        x13 = rotl(x13 ^ x02, 16);\n        x08 = (x08 + x13) | 0;\n        x07 = rotl(x07 ^ x08, 12);\n        x02 = (x02 + x07) | 0;\n        x13 = rotl(x13 ^ x02, 8);\n        x08 = (x08 + x13) | 0;\n        x07 = rotl(x07 ^ x08, 7);\n        x03 = (x03 + x04) | 0;\n        x14 = rotl(x14 ^ x03, 16);\n        x09 = (x09 + x14) | 0;\n        x04 = rotl(x04 ^ x09, 12);\n        x03 = (x03 + x04) | 0;\n        x14 = rotl(x14 ^ x03, 8);\n        x09 = (x09 + x14) | 0;\n        x04 = rotl(x04 ^ x09, 7);\n    }\n    let oi = 0;\n    o32[oi++] = x00;\n    o32[oi++] = x01;\n    o32[oi++] = x02;\n    o32[oi++] = x03;\n    o32[oi++] = x12;\n    o32[oi++] = x13;\n    o32[oi++] = x14;\n    o32[oi++] = x15;\n}\n/**\n * Original, non-RFC chacha20 from DJB. 8-byte nonce, 8-byte counter.\n */\nexport const chacha20orig = /* @__PURE__ */ createCipher(chachaCore, {\n    counterRight: false,\n    counterLength: 8,\n    allowShortKeys: true,\n});\n/**\n * ChaCha stream cipher. Conforms to RFC 8439 (IETF, TLS). 12-byte nonce, 4-byte counter.\n * With 12-byte nonce, it's not safe to use fill it with random (CSPRNG), due to collision chance.\n */\nexport const chacha20 = /* @__PURE__ */ createCipher(chachaCore, {\n    counterRight: false,\n    counterLength: 4,\n    allowShortKeys: false,\n});\n/**\n * XChaCha eXtended-nonce ChaCha. 24-byte nonce.\n * With 24-byte nonce, it's safe to use fill it with random (CSPRNG).\n * https://datatracker.ietf.org/doc/html/draft-irtf-cfrg-xchacha\n */\nexport const xchacha20 = /* @__PURE__ */ createCipher(chachaCore, {\n    counterRight: false,\n    counterLength: 8,\n    extendNonceFn: hchacha,\n    allowShortKeys: false,\n});\n/**\n * Reduced 8-round chacha, described in original paper.\n */\nexport const chacha8 = /* @__PURE__ */ createCipher(chachaCore, {\n    counterRight: false,\n    counterLength: 4,\n    rounds: 8,\n});\n/**\n * Reduced 12-round chacha, described in original paper.\n */\nexport const chacha12 = /* @__PURE__ */ createCipher(chachaCore, {\n    counterRight: false,\n    counterLength: 4,\n    rounds: 12,\n});\nconst ZEROS16 = /* @__PURE__ */ new Uint8Array(16);\n// Pad to digest size with zeros\nconst updatePadded = (h, msg) => {\n    h.update(msg);\n    const left = msg.length % 16;\n    if (left)\n        h.update(ZEROS16.subarray(left));\n};\nconst ZEROS32 = /* @__PURE__ */ new Uint8Array(32);\nfunction computeTag(fn, key, nonce, data, AAD) {\n    const authKey = fn(key, nonce, ZEROS32);\n    const h = poly1305.create(authKey);\n    if (AAD)\n        updatePadded(h, AAD);\n    updatePadded(h, data);\n    const num = new Uint8Array(16);\n    const view = createView(num);\n    setBigUint64(view, 0, BigInt(AAD ? AAD.length : 0), true);\n    setBigUint64(view, 8, BigInt(data.length), true);\n    h.update(num);\n    const res = h.digest();\n    authKey.fill(0);\n    return res;\n}\n/**\n * AEAD algorithm from RFC 8439.\n * Salsa20 and chacha (RFC 8439) use poly1305 differently.\n * We could have composed them similar to:\n * https://github.com/paulmillr/scure-base/blob/b266c73dde977b1dd7ef40ef7a23cc15aab526b3/index.ts#L250\n * But it's hard because of authKey:\n * In salsa20, authKey changes position in salsa stream.\n * In chacha, authKey can't be computed inside computeTag, it modifies the counter.\n */\nexport const _poly1305_aead = (xorStream) => (key, nonce, AAD) => {\n    const tagLength = 16;\n    abytes(key, 32);\n    abytes(nonce);\n    return {\n        encrypt: (plaintext, output) => {\n            const plength = plaintext.length;\n            const clength = plength + tagLength;\n            if (output) {\n                abytes(output, clength);\n            }\n            else {\n                output = new Uint8Array(clength);\n            }\n            xorStream(key, nonce, plaintext, output, 1);\n            const tag = computeTag(xorStream, key, nonce, output.subarray(0, -tagLength), AAD);\n            output.set(tag, plength); // append tag\n            return output;\n        },\n        decrypt: (ciphertext, output) => {\n            const clength = ciphertext.length;\n            const plength = clength - tagLength;\n            if (clength < tagLength)\n                throw new Error(`encrypted data must be at least ${tagLength} bytes`);\n            if (output) {\n                abytes(output, plength);\n            }\n            else {\n                output = new Uint8Array(plength);\n            }\n            const data = ciphertext.subarray(0, -tagLength);\n            const passedTag = ciphertext.subarray(-tagLength);\n            const tag = computeTag(xorStream, key, nonce, data, AAD);\n            if (!equalBytes(passedTag, tag))\n                throw new Error('invalid tag');\n            xorStream(key, nonce, data, output, 1);\n            return output;\n        },\n    };\n};\n/**\n * ChaCha20-Poly1305 from RFC 8439.\n * With 12-byte nonce, it's not safe to use fill it with random (CSPRNG), due to collision chance.\n */\nexport const chacha20poly1305 = /* @__PURE__ */ wrapCipher({ blockSize: 64, nonceLength: 12, tagLength: 16 }, _poly1305_aead(chacha20));\n/**\n * XChaCha20-Poly1305 extended-nonce chacha.\n * https://datatracker.ietf.org/doc/html/draft-irtf-cfrg-xchacha\n * With 24-byte nonce, it's safe to use fill it with random (CSPRNG).\n */\nexport const xchacha20poly1305 = /* @__PURE__ */ wrapCipher({ blockSize: 64, nonceLength: 24, tagLength: 16 }, _poly1305_aead(xchacha20));\n//# sourceMappingURL=chacha.js.map","import assert from './_assert.js';\nimport { Hash, toBytes } from './utils.js';\n// HMAC (RFC 2104)\nexport class HMAC extends Hash {\n    constructor(hash, _key) {\n        super();\n        this.finished = false;\n        this.destroyed = false;\n        assert.hash(hash);\n        const key = toBytes(_key);\n        this.iHash = hash.create();\n        if (typeof this.iHash.update !== 'function')\n            throw new Error('Expected instance of class which extends utils.Hash');\n        this.blockLen = this.iHash.blockLen;\n        this.outputLen = this.iHash.outputLen;\n        const blockLen = this.blockLen;\n        const pad = new Uint8Array(blockLen);\n        // blockLen can be bigger than outputLen\n        pad.set(key.length > blockLen ? hash.create().update(key).digest() : key);\n        for (let i = 0; i < pad.length; i++)\n            pad[i] ^= 0x36;\n        this.iHash.update(pad);\n        // By doing update (processing of first block) of outer hash here we can re-use it between multiple calls via clone\n        this.oHash = hash.create();\n        // Undo internal XOR && apply outer XOR\n        for (let i = 0; i < pad.length; i++)\n            pad[i] ^= 0x36 ^ 0x5c;\n        this.oHash.update(pad);\n        pad.fill(0);\n    }\n    update(buf) {\n        assert.exists(this);\n        this.iHash.update(buf);\n        return this;\n    }\n    digestInto(out) {\n        assert.exists(this);\n        assert.bytes(out, this.outputLen);\n        this.finished = true;\n        this.iHash.digestInto(out);\n        this.oHash.update(out);\n        this.oHash.digestInto(out);\n        this.destroy();\n    }\n    digest() {\n        const out = new Uint8Array(this.oHash.outputLen);\n        this.digestInto(out);\n        return out;\n    }\n    _cloneInto(to) {\n        // Create new instance without calling constructor since key already in state and we don't know it.\n        to || (to = Object.create(Object.getPrototypeOf(this), {}));\n        const { oHash, iHash, finished, destroyed, blockLen, outputLen } = this;\n        to = to;\n        to.finished = finished;\n        to.destroyed = destroyed;\n        to.blockLen = blockLen;\n        to.outputLen = outputLen;\n        to.oHash = oHash._cloneInto(to.oHash);\n        to.iHash = iHash._cloneInto(to.iHash);\n        return to;\n    }\n    destroy() {\n        this.destroyed = true;\n        this.oHash.destroy();\n        this.iHash.destroy();\n    }\n}\n/**\n * HMAC: RFC2104 message authentication code.\n * @param hash - function that would be used e.g. sha256\n * @param key - message key\n * @param message - message data\n */\nexport const hmac = (hash, key, message) => new HMAC(hash, key).update(message).digest();\nhmac.create = (hash, key) => new HMAC(hash, key);\n//# sourceMappingURL=hmac.js.map","import assert from './_assert.js';\nimport { toBytes } from './utils.js';\nimport { hmac } from './hmac.js';\n// HKDF (RFC 5869)\n// https://soatok.blog/2021/11/17/understanding-hkdf/\n/**\n * HKDF-Extract(IKM, salt) -> PRK\n * Arguments position differs from spec (IKM is first one, since it is not optional)\n * @param hash\n * @param ikm\n * @param salt\n * @returns\n */\nexport function extract(hash, ikm, salt) {\n    assert.hash(hash);\n    // NOTE: some libraries treat zero-length array as 'not provided';\n    // we don't, since we have undefined as 'not provided'\n    // https://github.com/RustCrypto/KDFs/issues/15\n    if (salt === undefined)\n        salt = new Uint8Array(hash.outputLen); // if not provided, it is set to a string of HashLen zeros\n    return hmac(hash, toBytes(salt), toBytes(ikm));\n}\n// HKDF-Expand(PRK, info, L) -> OKM\nconst HKDF_COUNTER = new Uint8Array([0]);\nconst EMPTY_BUFFER = new Uint8Array();\n/**\n * HKDF-expand from the spec.\n * @param prk - a pseudorandom key of at least HashLen octets (usually, the output from the extract step)\n * @param info - optional context and application specific information (can be a zero-length string)\n * @param length - length of output keying material in octets\n */\nexport function expand(hash, prk, info, length = 32) {\n    assert.hash(hash);\n    assert.number(length);\n    if (length > 255 * hash.outputLen)\n        throw new Error('Length should be <= 255*HashLen');\n    const blocks = Math.ceil(length / hash.outputLen);\n    if (info === undefined)\n        info = EMPTY_BUFFER;\n    // first L(ength) octets of T\n    const okm = new Uint8Array(blocks * hash.outputLen);\n    // Re-use HMAC instance between blocks\n    const HMAC = hmac.create(hash, prk);\n    const HMACTmp = HMAC._cloneInto();\n    const T = new Uint8Array(HMAC.outputLen);\n    for (let counter = 0; counter < blocks; counter++) {\n        HKDF_COUNTER[0] = counter + 1;\n        // T(0) = empty string (zero length)\n        // T(N) = HMAC-Hash(PRK, T(N-1) | info | N)\n        HMACTmp.update(counter === 0 ? EMPTY_BUFFER : T)\n            .update(info)\n            .update(HKDF_COUNTER)\n            .digestInto(T);\n        okm.set(T, hash.outputLen * counter);\n        HMAC._cloneInto(HMACTmp);\n    }\n    HMAC.destroy();\n    HMACTmp.destroy();\n    T.fill(0);\n    HKDF_COUNTER.fill(0);\n    return okm.slice(0, length);\n}\n/**\n * HKDF (RFC 5869): extract + expand in one step.\n * @param hash - hash function that would be used (e.g. sha256)\n * @param ikm - input keying material, the initial key\n * @param salt - optional salt value (a non-secret random value)\n * @param info - optional context and application specific information\n * @param length - length of output keying material in octets\n */\nexport const hkdf = (hash, ikm, salt, info, length) => expand(hash, extract(hash, ikm, salt), info, length);\n//# sourceMappingURL=hkdf.js.map","var __defProp = Object.defineProperty;\nvar __export = (target, all) => {\n  for (var name in all)\n    __defProp(target, name, { get: all[name], enumerable: true });\n};\n\n// pure.ts\nimport { schnorr } from \"@noble/curves/secp256k1\";\nimport { bytesToHex } from \"@noble/hashes/utils\";\n\n// core.ts\nvar verifiedSymbol = Symbol(\"verified\");\nvar isRecord = (obj) => obj instanceof Object;\nfunction validateEvent(event) {\n  if (!isRecord(event))\n    return false;\n  if (typeof event.kind !== \"number\")\n    return false;\n  if (typeof event.content !== \"string\")\n    return false;\n  if (typeof event.created_at !== \"number\")\n    return false;\n  if (typeof event.pubkey !== \"string\")\n    return false;\n  if (!event.pubkey.match(/^[a-f0-9]{64}$/))\n    return false;\n  if (!Array.isArray(event.tags))\n    return false;\n  for (let i2 = 0; i2 < event.tags.length; i2++) {\n    let tag = event.tags[i2];\n    if (!Array.isArray(tag))\n      return false;\n    for (let j = 0; j < tag.length; j++) {\n      if (typeof tag[j] === \"object\")\n        return false;\n    }\n  }\n  return true;\n}\nfunction sortEvents(events) {\n  return events.sort((a, b) => {\n    if (a.created_at !== b.created_at) {\n      return b.created_at - a.created_at;\n    }\n    return a.id.localeCompare(b.id);\n  });\n}\n\n// pure.ts\nimport { sha256 } from \"@noble/hashes/sha256\";\n\n// utils.ts\nvar utils_exports = {};\n__export(utils_exports, {\n  Queue: () => Queue,\n  QueueNode: () => QueueNode,\n  binarySearch: () => binarySearch,\n  insertEventIntoAscendingList: () => insertEventIntoAscendingList,\n  insertEventIntoDescendingList: () => insertEventIntoDescendingList,\n  normalizeURL: () => normalizeURL,\n  utf8Decoder: () => utf8Decoder,\n  utf8Encoder: () => utf8Encoder\n});\nvar utf8Decoder = new TextDecoder(\"utf-8\");\nvar utf8Encoder = new TextEncoder();\nfunction normalizeURL(url) {\n  if (url.indexOf(\"://\") === -1)\n    url = \"wss://\" + url;\n  let p = new URL(url);\n  p.pathname = p.pathname.replace(/\\/+/g, \"/\");\n  if (p.pathname.endsWith(\"/\"))\n    p.pathname = p.pathname.slice(0, -1);\n  if (p.port === \"80\" && p.protocol === \"ws:\" || p.port === \"443\" && p.protocol === \"wss:\")\n    p.port = \"\";\n  p.searchParams.sort();\n  p.hash = \"\";\n  return p.toString();\n}\nfunction insertEventIntoDescendingList(sortedArray, event) {\n  const [idx, found] = binarySearch(sortedArray, (b) => {\n    if (event.id === b.id)\n      return 0;\n    if (event.created_at === b.created_at)\n      return -1;\n    return b.created_at - event.created_at;\n  });\n  if (!found) {\n    sortedArray.splice(idx, 0, event);\n  }\n  return sortedArray;\n}\nfunction insertEventIntoAscendingList(sortedArray, event) {\n  const [idx, found] = binarySearch(sortedArray, (b) => {\n    if (event.id === b.id)\n      return 0;\n    if (event.created_at === b.created_at)\n      return -1;\n    return event.created_at - b.created_at;\n  });\n  if (!found) {\n    sortedArray.splice(idx, 0, event);\n  }\n  return sortedArray;\n}\nfunction binarySearch(arr, compare) {\n  let start = 0;\n  let end = arr.length - 1;\n  while (start <= end) {\n    const mid = Math.floor((start + end) / 2);\n    const cmp = compare(arr[mid]);\n    if (cmp === 0) {\n      return [mid, true];\n    }\n    if (cmp < 0) {\n      end = mid - 1;\n    } else {\n      start = mid + 1;\n    }\n  }\n  return [start, false];\n}\nvar QueueNode = class {\n  value;\n  next = null;\n  prev = null;\n  constructor(message) {\n    this.value = message;\n  }\n};\nvar Queue = class {\n  first;\n  last;\n  constructor() {\n    this.first = null;\n    this.last = null;\n  }\n  enqueue(value) {\n    const newNode = new QueueNode(value);\n    if (!this.last) {\n      this.first = newNode;\n      this.last = newNode;\n    } else if (this.last === this.first) {\n      this.last = newNode;\n      this.last.prev = this.first;\n      this.first.next = newNode;\n    } else {\n      newNode.prev = this.last;\n      this.last.next = newNode;\n      this.last = newNode;\n    }\n    return true;\n  }\n  dequeue() {\n    if (!this.first)\n      return null;\n    if (this.first === this.last) {\n      const target2 = this.first;\n      this.first = null;\n      this.last = null;\n      return target2.value;\n    }\n    const target = this.first;\n    this.first = target.next;\n    return target.value;\n  }\n};\n\n// pure.ts\nvar JS = class {\n  generateSecretKey() {\n    return schnorr.utils.randomPrivateKey();\n  }\n  getPublicKey(secretKey) {\n    return bytesToHex(schnorr.getPublicKey(secretKey));\n  }\n  finalizeEvent(t, secretKey) {\n    const event = t;\n    event.pubkey = bytesToHex(schnorr.getPublicKey(secretKey));\n    event.id = getEventHash(event);\n    event.sig = bytesToHex(schnorr.sign(getEventHash(event), secretKey));\n    event[verifiedSymbol] = true;\n    return event;\n  }\n  verifyEvent(event) {\n    if (typeof event[verifiedSymbol] === \"boolean\")\n      return event[verifiedSymbol];\n    const hash = getEventHash(event);\n    if (hash !== event.id) {\n      event[verifiedSymbol] = false;\n      return false;\n    }\n    try {\n      const valid = schnorr.verify(event.sig, hash, event.pubkey);\n      event[verifiedSymbol] = valid;\n      return valid;\n    } catch (err) {\n      event[verifiedSymbol] = false;\n      return false;\n    }\n  }\n};\nfunction serializeEvent(evt) {\n  if (!validateEvent(evt))\n    throw new Error(\"can't serialize event with wrong or missing properties\");\n  return JSON.stringify([0, evt.pubkey, evt.created_at, evt.kind, evt.tags, evt.content]);\n}\nfunction getEventHash(event) {\n  let eventHash = sha256(utf8Encoder.encode(serializeEvent(event)));\n  return bytesToHex(eventHash);\n}\nvar i = new JS();\nvar generateSecretKey = i.generateSecretKey;\nvar getPublicKey = i.getPublicKey;\nvar finalizeEvent = i.finalizeEvent;\nvar verifyEvent = i.verifyEvent;\n\n// kinds.ts\nvar kinds_exports = {};\n__export(kinds_exports, {\n  Application: () => Application,\n  BadgeAward: () => BadgeAward,\n  BadgeDefinition: () => BadgeDefinition,\n  BlockedRelaysList: () => BlockedRelaysList,\n  BookmarkList: () => BookmarkList,\n  Bookmarksets: () => Bookmarksets,\n  Calendar: () => Calendar,\n  CalendarEventRSVP: () => CalendarEventRSVP,\n  ChannelCreation: () => ChannelCreation,\n  ChannelHideMessage: () => ChannelHideMessage,\n  ChannelMessage: () => ChannelMessage,\n  ChannelMetadata: () => ChannelMetadata,\n  ChannelMuteUser: () => ChannelMuteUser,\n  ClassifiedListing: () => ClassifiedListing,\n  ClientAuth: () => ClientAuth,\n  CommunitiesList: () => CommunitiesList,\n  CommunityDefinition: () => CommunityDefinition,\n  CommunityPostApproval: () => CommunityPostApproval,\n  Contacts: () => Contacts,\n  CreateOrUpdateProduct: () => CreateOrUpdateProduct,\n  CreateOrUpdateStall: () => CreateOrUpdateStall,\n  Curationsets: () => Curationsets,\n  Date: () => Date2,\n  DirectMessageRelaysList: () => DirectMessageRelaysList,\n  DraftClassifiedListing: () => DraftClassifiedListing,\n  DraftLong: () => DraftLong,\n  Emojisets: () => Emojisets,\n  EncryptedDirectMessage: () => EncryptedDirectMessage,\n  EventDeletion: () => EventDeletion,\n  FileMetadata: () => FileMetadata,\n  FileServerPreference: () => FileServerPreference,\n  Followsets: () => Followsets,\n  GenericRepost: () => GenericRepost,\n  Genericlists: () => Genericlists,\n  GiftWrap: () => GiftWrap,\n  HTTPAuth: () => HTTPAuth,\n  Handlerinformation: () => Handlerinformation,\n  Handlerrecommendation: () => Handlerrecommendation,\n  Highlights: () => Highlights,\n  InterestsList: () => InterestsList,\n  Interestsets: () => Interestsets,\n  JobFeedback: () => JobFeedback,\n  JobRequest: () => JobRequest,\n  JobResult: () => JobResult,\n  Label: () => Label,\n  LightningPubRPC: () => LightningPubRPC,\n  LiveChatMessage: () => LiveChatMessage,\n  LiveEvent: () => LiveEvent,\n  LongFormArticle: () => LongFormArticle,\n  Metadata: () => Metadata,\n  Mutelist: () => Mutelist,\n  NWCWalletInfo: () => NWCWalletInfo,\n  NWCWalletRequest: () => NWCWalletRequest,\n  NWCWalletResponse: () => NWCWalletResponse,\n  NostrConnect: () => NostrConnect,\n  OpenTimestamps: () => OpenTimestamps,\n  Pinlist: () => Pinlist,\n  PrivateDirectMessage: () => PrivateDirectMessage,\n  ProblemTracker: () => ProblemTracker,\n  ProfileBadges: () => ProfileBadges,\n  PublicChatsList: () => PublicChatsList,\n  Reaction: () => Reaction,\n  RecommendRelay: () => RecommendRelay,\n  RelayList: () => RelayList,\n  Relaysets: () => Relaysets,\n  Report: () => Report,\n  Reporting: () => Reporting,\n  Repost: () => Repost,\n  Seal: () => Seal,\n  SearchRelaysList: () => SearchRelaysList,\n  ShortTextNote: () => ShortTextNote,\n  Time: () => Time,\n  UserEmojiList: () => UserEmojiList,\n  UserStatuses: () => UserStatuses,\n  Zap: () => Zap,\n  ZapGoal: () => ZapGoal,\n  ZapRequest: () => ZapRequest,\n  classifyKind: () => classifyKind,\n  isAddressableKind: () => isAddressableKind,\n  isEphemeralKind: () => isEphemeralKind,\n  isKind: () => isKind,\n  isParameterizedReplaceableKind: () => isParameterizedReplaceableKind,\n  isRegularKind: () => isRegularKind,\n  isReplaceableKind: () => isReplaceableKind\n});\nfunction isRegularKind(kind) {\n  return 1e3 <= kind && kind < 1e4 || [1, 2, 4, 5, 6, 7, 8, 16, 40, 41, 42, 43, 44].includes(kind);\n}\nfunction isReplaceableKind(kind) {\n  return [0, 3].includes(kind) || 1e4 <= kind && kind < 2e4;\n}\nfunction isEphemeralKind(kind) {\n  return 2e4 <= kind && kind < 3e4;\n}\nfunction isAddressableKind(kind) {\n  return 3e4 <= kind && kind < 4e4;\n}\nvar isParameterizedReplaceableKind = isAddressableKind;\nfunction classifyKind(kind) {\n  if (isRegularKind(kind))\n    return \"regular\";\n  if (isReplaceableKind(kind))\n    return \"replaceable\";\n  if (isEphemeralKind(kind))\n    return \"ephemeral\";\n  if (isAddressableKind(kind))\n    return \"parameterized\";\n  return \"unknown\";\n}\nfunction isKind(event, kind) {\n  const kindAsArray = kind instanceof Array ? kind : [kind];\n  return validateEvent(event) && kindAsArray.includes(event.kind) || false;\n}\nvar Metadata = 0;\nvar ShortTextNote = 1;\nvar RecommendRelay = 2;\nvar Contacts = 3;\nvar EncryptedDirectMessage = 4;\nvar EventDeletion = 5;\nvar Repost = 6;\nvar Reaction = 7;\nvar BadgeAward = 8;\nvar Seal = 13;\nvar PrivateDirectMessage = 14;\nvar GenericRepost = 16;\nvar ChannelCreation = 40;\nvar ChannelMetadata = 41;\nvar ChannelMessage = 42;\nvar ChannelHideMessage = 43;\nvar ChannelMuteUser = 44;\nvar OpenTimestamps = 1040;\nvar GiftWrap = 1059;\nvar FileMetadata = 1063;\nvar LiveChatMessage = 1311;\nvar ProblemTracker = 1971;\nvar Report = 1984;\nvar Reporting = 1984;\nvar Label = 1985;\nvar CommunityPostApproval = 4550;\nvar JobRequest = 5999;\nvar JobResult = 6999;\nvar JobFeedback = 7e3;\nvar ZapGoal = 9041;\nvar ZapRequest = 9734;\nvar Zap = 9735;\nvar Highlights = 9802;\nvar Mutelist = 1e4;\nvar Pinlist = 10001;\nvar RelayList = 10002;\nvar BookmarkList = 10003;\nvar CommunitiesList = 10004;\nvar PublicChatsList = 10005;\nvar BlockedRelaysList = 10006;\nvar SearchRelaysList = 10007;\nvar InterestsList = 10015;\nvar UserEmojiList = 10030;\nvar DirectMessageRelaysList = 10050;\nvar FileServerPreference = 10096;\nvar NWCWalletInfo = 13194;\nvar LightningPubRPC = 21e3;\nvar ClientAuth = 22242;\nvar NWCWalletRequest = 23194;\nvar NWCWalletResponse = 23195;\nvar NostrConnect = 24133;\nvar HTTPAuth = 27235;\nvar Followsets = 3e4;\nvar Genericlists = 30001;\nvar Relaysets = 30002;\nvar Bookmarksets = 30003;\nvar Curationsets = 30004;\nvar ProfileBadges = 30008;\nvar BadgeDefinition = 30009;\nvar Interestsets = 30015;\nvar CreateOrUpdateStall = 30017;\nvar CreateOrUpdateProduct = 30018;\nvar LongFormArticle = 30023;\nvar DraftLong = 30024;\nvar Emojisets = 30030;\nvar Application = 30078;\nvar LiveEvent = 30311;\nvar UserStatuses = 30315;\nvar ClassifiedListing = 30402;\nvar DraftClassifiedListing = 30403;\nvar Date2 = 31922;\nvar Time = 31923;\nvar Calendar = 31924;\nvar CalendarEventRSVP = 31925;\nvar Handlerrecommendation = 31989;\nvar Handlerinformation = 31990;\nvar CommunityDefinition = 34550;\n\n// filter.ts\nfunction matchFilter(filter, event) {\n  if (filter.ids && filter.ids.indexOf(event.id) === -1) {\n    return false;\n  }\n  if (filter.kinds && filter.kinds.indexOf(event.kind) === -1) {\n    return false;\n  }\n  if (filter.authors && filter.authors.indexOf(event.pubkey) === -1) {\n    return false;\n  }\n  for (let f in filter) {\n    if (f[0] === \"#\") {\n      let tagName = f.slice(1);\n      let values = filter[`#${tagName}`];\n      if (values && !event.tags.find(([t, v]) => t === f.slice(1) && values.indexOf(v) !== -1))\n        return false;\n    }\n  }\n  if (filter.since && event.created_at < filter.since)\n    return false;\n  if (filter.until && event.created_at > filter.until)\n    return false;\n  return true;\n}\nfunction matchFilters(filters, event) {\n  for (let i2 = 0; i2 < filters.length; i2++) {\n    if (matchFilter(filters[i2], event)) {\n      return true;\n    }\n  }\n  return false;\n}\nfunction mergeFilters(...filters) {\n  let result = {};\n  for (let i2 = 0; i2 < filters.length; i2++) {\n    let filter = filters[i2];\n    Object.entries(filter).forEach(([property, values]) => {\n      if (property === \"kinds\" || property === \"ids\" || property === \"authors\" || property[0] === \"#\") {\n        result[property] = result[property] || [];\n        for (let v = 0; v < values.length; v++) {\n          let value = values[v];\n          if (!result[property].includes(value))\n            result[property].push(value);\n        }\n      }\n    });\n    if (filter.limit && (!result.limit || filter.limit > result.limit))\n      result.limit = filter.limit;\n    if (filter.until && (!result.until || filter.until > result.until))\n      result.until = filter.until;\n    if (filter.since && (!result.since || filter.since < result.since))\n      result.since = filter.since;\n  }\n  return result;\n}\nfunction getFilterLimit(filter) {\n  if (filter.ids && !filter.ids.length)\n    return 0;\n  if (filter.kinds && !filter.kinds.length)\n    return 0;\n  if (filter.authors && !filter.authors.length)\n    return 0;\n  for (const [key, value] of Object.entries(filter)) {\n    if (key[0] === \"#\" && Array.isArray(value) && !value.length)\n      return 0;\n  }\n  return Math.min(\n    Math.max(0, filter.limit ?? Infinity),\n    filter.ids?.length ?? Infinity,\n    filter.authors?.length && filter.kinds?.every((kind) => isReplaceableKind(kind)) ? filter.authors.length * filter.kinds.length : Infinity,\n    filter.authors?.length && filter.kinds?.every((kind) => isAddressableKind(kind)) && filter[\"#d\"]?.length ? filter.authors.length * filter.kinds.length * filter[\"#d\"].length : Infinity\n  );\n}\n\n// fakejson.ts\nvar fakejson_exports = {};\n__export(fakejson_exports, {\n  getHex64: () => getHex64,\n  getInt: () => getInt,\n  getSubscriptionId: () => getSubscriptionId,\n  matchEventId: () => matchEventId,\n  matchEventKind: () => matchEventKind,\n  matchEventPubkey: () => matchEventPubkey\n});\nfunction getHex64(json, field) {\n  let len = field.length + 3;\n  let idx = json.indexOf(`\"${field}\":`) + len;\n  let s = json.slice(idx).indexOf(`\"`) + idx + 1;\n  return json.slice(s, s + 64);\n}\nfunction getInt(json, field) {\n  let len = field.length;\n  let idx = json.indexOf(`\"${field}\":`) + len + 3;\n  let sliced = json.slice(idx);\n  let end = Math.min(sliced.indexOf(\",\"), sliced.indexOf(\"}\"));\n  return parseInt(sliced.slice(0, end), 10);\n}\nfunction getSubscriptionId(json) {\n  let idx = json.slice(0, 22).indexOf(`\"EVENT\"`);\n  if (idx === -1)\n    return null;\n  let pstart = json.slice(idx + 7 + 1).indexOf(`\"`);\n  if (pstart === -1)\n    return null;\n  let start = idx + 7 + 1 + pstart;\n  let pend = json.slice(start + 1, 80).indexOf(`\"`);\n  if (pend === -1)\n    return null;\n  let end = start + 1 + pend;\n  return json.slice(start + 1, end);\n}\nfunction matchEventId(json, id) {\n  return id === getHex64(json, \"id\");\n}\nfunction matchEventPubkey(json, pubkey) {\n  return pubkey === getHex64(json, \"pubkey\");\n}\nfunction matchEventKind(json, kind) {\n  return kind === getInt(json, \"kind\");\n}\n\n// nip42.ts\nvar nip42_exports = {};\n__export(nip42_exports, {\n  makeAuthEvent: () => makeAuthEvent\n});\nfunction makeAuthEvent(relayURL, challenge) {\n  return {\n    kind: ClientAuth,\n    created_at: Math.floor(Date.now() / 1e3),\n    tags: [\n      [\"relay\", relayURL],\n      [\"challenge\", challenge]\n    ],\n    content: \"\"\n  };\n}\n\n// helpers.ts\nasync function yieldThread() {\n  return new Promise((resolve) => {\n    const ch = new MessageChannel();\n    const handler = () => {\n      ch.port1.removeEventListener(\"message\", handler);\n      resolve();\n    };\n    ch.port1.addEventListener(\"message\", handler);\n    ch.port2.postMessage(0);\n    ch.port1.start();\n  });\n}\nvar alwaysTrue = (t) => {\n  t[verifiedSymbol] = true;\n  return true;\n};\n\n// abstract-relay.ts\nvar AbstractRelay = class {\n  url;\n  _connected = false;\n  onclose = null;\n  onnotice = (msg) => console.debug(`NOTICE from ${this.url}: ${msg}`);\n  _onauth = null;\n  baseEoseTimeout = 4400;\n  connectionTimeout = 4400;\n  publishTimeout = 4400;\n  openSubs = /* @__PURE__ */ new Map();\n  connectionTimeoutHandle;\n  connectionPromise;\n  openCountRequests = /* @__PURE__ */ new Map();\n  openEventPublishes = /* @__PURE__ */ new Map();\n  ws;\n  incomingMessageQueue = new Queue();\n  queueRunning = false;\n  challenge;\n  authPromise;\n  serial = 0;\n  verifyEvent;\n  _WebSocket;\n  constructor(url, opts) {\n    this.url = normalizeURL(url);\n    this.verifyEvent = opts.verifyEvent;\n    this._WebSocket = opts.websocketImplementation || WebSocket;\n  }\n  static async connect(url, opts) {\n    const relay = new AbstractRelay(url, opts);\n    await relay.connect();\n    return relay;\n  }\n  closeAllSubscriptions(reason) {\n    for (let [_, sub] of this.openSubs) {\n      sub.close(reason);\n    }\n    this.openSubs.clear();\n    for (let [_, ep] of this.openEventPublishes) {\n      ep.reject(new Error(reason));\n    }\n    this.openEventPublishes.clear();\n    for (let [_, cr] of this.openCountRequests) {\n      cr.reject(new Error(reason));\n    }\n    this.openCountRequests.clear();\n  }\n  get connected() {\n    return this._connected;\n  }\n  async connect() {\n    if (this.connectionPromise)\n      return this.connectionPromise;\n    this.challenge = void 0;\n    this.authPromise = void 0;\n    this.connectionPromise = new Promise((resolve, reject) => {\n      this.connectionTimeoutHandle = setTimeout(() => {\n        reject(\"connection timed out\");\n        this.connectionPromise = void 0;\n        this.onclose?.();\n        this.closeAllSubscriptions(\"relay connection timed out\");\n      }, this.connectionTimeout);\n      try {\n        this.ws = new this._WebSocket(this.url);\n      } catch (err) {\n        reject(err);\n        return;\n      }\n      this.ws.onopen = () => {\n        clearTimeout(this.connectionTimeoutHandle);\n        this._connected = true;\n        resolve();\n      };\n      this.ws.onerror = (ev) => {\n        reject(ev.message || \"websocket error\");\n        if (this._connected) {\n          this._connected = false;\n          this.connectionPromise = void 0;\n          this.onclose?.();\n          this.closeAllSubscriptions(\"relay connection errored\");\n        }\n      };\n      this.ws.onclose = async () => {\n        if (this._connected) {\n          this._connected = false;\n          this.connectionPromise = void 0;\n          this.onclose?.();\n          this.closeAllSubscriptions(\"relay connection closed\");\n        }\n      };\n      this.ws.onmessage = this._onmessage.bind(this);\n    });\n    return this.connectionPromise;\n  }\n  async runQueue() {\n    this.queueRunning = true;\n    while (true) {\n      if (false === this.handleNext()) {\n        break;\n      }\n      await yieldThread();\n    }\n    this.queueRunning = false;\n  }\n  handleNext() {\n    const json = this.incomingMessageQueue.dequeue();\n    if (!json) {\n      return false;\n    }\n    const subid = getSubscriptionId(json);\n    if (subid) {\n      const so = this.openSubs.get(subid);\n      if (!so) {\n        return;\n      }\n      const id = getHex64(json, \"id\");\n      const alreadyHave = so.alreadyHaveEvent?.(id);\n      so.receivedEvent?.(this, id);\n      if (alreadyHave) {\n        return;\n      }\n    }\n    try {\n      let data = JSON.parse(json);\n      switch (data[0]) {\n        case \"EVENT\": {\n          const so = this.openSubs.get(data[1]);\n          const event = data[2];\n          if (this.verifyEvent(event) && matchFilters(so.filters, event)) {\n            so.onevent(event);\n          }\n          return;\n        }\n        case \"COUNT\": {\n          const id = data[1];\n          const payload = data[2];\n          const cr = this.openCountRequests.get(id);\n          if (cr) {\n            cr.resolve(payload.count);\n            this.openCountRequests.delete(id);\n          }\n          return;\n        }\n        case \"EOSE\": {\n          const so = this.openSubs.get(data[1]);\n          if (!so)\n            return;\n          so.receivedEose();\n          return;\n        }\n        case \"OK\": {\n          const id = data[1];\n          const ok = data[2];\n          const reason = data[3];\n          const ep = this.openEventPublishes.get(id);\n          if (ep) {\n            clearTimeout(ep.timeout);\n            if (ok)\n              ep.resolve(reason);\n            else\n              ep.reject(new Error(reason));\n            this.openEventPublishes.delete(id);\n          }\n          return;\n        }\n        case \"CLOSED\": {\n          const id = data[1];\n          const so = this.openSubs.get(id);\n          if (!so)\n            return;\n          so.closed = true;\n          so.close(data[2]);\n          return;\n        }\n        case \"NOTICE\":\n          this.onnotice(data[1]);\n          return;\n        case \"AUTH\": {\n          this.challenge = data[1];\n          this.authPromise = void 0;\n          this._onauth?.(data[1]);\n          return;\n        }\n      }\n    } catch (err) {\n      return;\n    }\n  }\n  async send(message) {\n    if (!this.connectionPromise)\n      throw new Error(\"sending on closed connection\");\n    this.connectionPromise.then(() => {\n      this.ws?.send(message);\n    });\n  }\n  async auth(signAuthEvent) {\n    if (!this.challenge)\n      throw new Error(\"can't perform auth, no challenge was received\");\n    if (this.authPromise)\n      return this.authPromise;\n    const evt = await signAuthEvent(makeAuthEvent(this.url, this.challenge));\n    this.authPromise = new Promise((resolve, reject) => {\n      const timeout = setTimeout(() => {\n        const ep = this.openEventPublishes.get(evt.id);\n        if (ep) {\n          ep.reject(new Error(\"auth timed out\"));\n          this.openEventPublishes.delete(evt.id);\n        }\n      }, this.publishTimeout);\n      this.openEventPublishes.set(evt.id, { resolve, reject, timeout });\n    });\n    this.send('[\"AUTH\",' + JSON.stringify(evt) + \"]\");\n    return this.authPromise;\n  }\n  async publish(event) {\n    const ret = new Promise((resolve, reject) => {\n      const timeout = setTimeout(() => {\n        const ep = this.openEventPublishes.get(event.id);\n        if (ep) {\n          ep.reject(new Error(\"publish timed out\"));\n          this.openEventPublishes.delete(event.id);\n        }\n      }, this.publishTimeout);\n      this.openEventPublishes.set(event.id, { resolve, reject, timeout });\n    });\n    this.send('[\"EVENT\",' + JSON.stringify(event) + \"]\");\n    return ret;\n  }\n  async count(filters, params) {\n    this.serial++;\n    const id = params?.id || \"count:\" + this.serial;\n    const ret = new Promise((resolve, reject) => {\n      this.openCountRequests.set(id, { resolve, reject });\n    });\n    this.send('[\"COUNT\",\"' + id + '\",' + JSON.stringify(filters).substring(1));\n    return ret;\n  }\n  subscribe(filters, params) {\n    const subscription = this.prepareSubscription(filters, params);\n    subscription.fire();\n    return subscription;\n  }\n  prepareSubscription(filters, params) {\n    this.serial++;\n    const id = params.id || (params.label ? params.label + \":\" : \"sub:\") + this.serial;\n    const subscription = new Subscription(this, id, filters, params);\n    this.openSubs.set(id, subscription);\n    return subscription;\n  }\n  close() {\n    this.closeAllSubscriptions(\"relay connection closed by us\");\n    this._connected = false;\n    this.ws?.close();\n  }\n  _onmessage(ev) {\n    this.incomingMessageQueue.enqueue(ev.data);\n    if (!this.queueRunning) {\n      this.runQueue();\n    }\n  }\n};\nvar Subscription = class {\n  relay;\n  id;\n  closed = false;\n  eosed = false;\n  filters;\n  alreadyHaveEvent;\n  receivedEvent;\n  onevent;\n  oneose;\n  onclose;\n  eoseTimeout;\n  eoseTimeoutHandle;\n  constructor(relay, id, filters, params) {\n    this.relay = relay;\n    this.filters = filters;\n    this.id = id;\n    this.alreadyHaveEvent = params.alreadyHaveEvent;\n    this.receivedEvent = params.receivedEvent;\n    this.eoseTimeout = params.eoseTimeout || relay.baseEoseTimeout;\n    this.oneose = params.oneose;\n    this.onclose = params.onclose;\n    this.onevent = params.onevent || ((event) => {\n      console.warn(\n        `onevent() callback not defined for subscription '${this.id}' in relay ${this.relay.url}. event received:`,\n        event\n      );\n    });\n  }\n  fire() {\n    this.relay.send('[\"REQ\",\"' + this.id + '\",' + JSON.stringify(this.filters).substring(1));\n    this.eoseTimeoutHandle = setTimeout(this.receivedEose.bind(this), this.eoseTimeout);\n  }\n  receivedEose() {\n    if (this.eosed)\n      return;\n    clearTimeout(this.eoseTimeoutHandle);\n    this.eosed = true;\n    this.oneose?.();\n  }\n  close(reason = \"closed by caller\") {\n    if (!this.closed && this.relay.connected) {\n      this.relay.send('[\"CLOSE\",' + JSON.stringify(this.id) + \"]\");\n      this.closed = true;\n    }\n    this.relay.openSubs.delete(this.id);\n    this.onclose?.(reason);\n  }\n};\n\n// relay.ts\nvar _WebSocket;\ntry {\n  _WebSocket = WebSocket;\n} catch {\n}\nvar Relay = class extends AbstractRelay {\n  constructor(url) {\n    super(url, { verifyEvent, websocketImplementation: _WebSocket });\n  }\n  static async connect(url) {\n    const relay = new Relay(url);\n    await relay.connect();\n    return relay;\n  }\n};\n\n// abstract-pool.ts\nvar AbstractSimplePool = class {\n  relays = /* @__PURE__ */ new Map();\n  seenOn = /* @__PURE__ */ new Map();\n  trackRelays = false;\n  verifyEvent;\n  trustedRelayURLs = /* @__PURE__ */ new Set();\n  _WebSocket;\n  constructor(opts) {\n    this.verifyEvent = opts.verifyEvent;\n    this._WebSocket = opts.websocketImplementation;\n  }\n  async ensureRelay(url, params) {\n    url = normalizeURL(url);\n    let relay = this.relays.get(url);\n    if (!relay) {\n      relay = new AbstractRelay(url, {\n        verifyEvent: this.trustedRelayURLs.has(url) ? alwaysTrue : this.verifyEvent,\n        websocketImplementation: this._WebSocket\n      });\n      if (params?.connectionTimeout)\n        relay.connectionTimeout = params.connectionTimeout;\n      this.relays.set(url, relay);\n    }\n    await relay.connect();\n    return relay;\n  }\n  close(relays) {\n    relays.map(normalizeURL).forEach((url) => {\n      this.relays.get(url)?.close();\n    });\n  }\n  subscribe(relays, filter, params) {\n    return this.subscribeMap(\n      relays.map((url) => ({ url, filter })),\n      params\n    );\n  }\n  subscribeMany(relays, filters, params) {\n    return this.subscribeMap(\n      relays.flatMap((url) => filters.map((filter) => ({ url, filter }))),\n      params\n    );\n  }\n  subscribeMap(requests, params) {\n    if (this.trackRelays) {\n      params.receivedEvent = (relay, id) => {\n        let set = this.seenOn.get(id);\n        if (!set) {\n          set = /* @__PURE__ */ new Set();\n          this.seenOn.set(id, set);\n        }\n        set.add(relay);\n      };\n    }\n    const _knownIds = /* @__PURE__ */ new Set();\n    const subs = [];\n    const eosesReceived = [];\n    let handleEose = (i2) => {\n      if (eosesReceived[i2])\n        return;\n      eosesReceived[i2] = true;\n      if (eosesReceived.filter((a) => a).length === requests.length) {\n        params.oneose?.();\n        handleEose = () => {\n        };\n      }\n    };\n    const closesReceived = [];\n    let handleClose = (i2, reason) => {\n      if (closesReceived[i2])\n        return;\n      handleEose(i2);\n      closesReceived[i2] = reason;\n      if (closesReceived.filter((a) => a).length === requests.length) {\n        params.onclose?.(closesReceived);\n        handleClose = () => {\n        };\n      }\n    };\n    const localAlreadyHaveEventHandler = (id) => {\n      if (params.alreadyHaveEvent?.(id)) {\n        return true;\n      }\n      const have = _knownIds.has(id);\n      _knownIds.add(id);\n      return have;\n    };\n    const allOpened = Promise.all(\n      requests.map(async ({ url, filter }, i2) => {\n        url = normalizeURL(url);\n        let relay;\n        try {\n          relay = await this.ensureRelay(url, {\n            connectionTimeout: params.maxWait ? Math.max(params.maxWait * 0.8, params.maxWait - 1e3) : void 0\n          });\n        } catch (err) {\n          handleClose(i2, err?.message || String(err));\n          return;\n        }\n        let subscription = relay.subscribe([filter], {\n          ...params,\n          oneose: () => handleEose(i2),\n          onclose: (reason) => {\n            if (reason.startsWith(\"auth-required:\") && params.doauth) {\n              relay.auth(params.doauth).then(() => {\n                relay.subscribe([filter], {\n                  ...params,\n                  oneose: () => handleEose(i2),\n                  onclose: (reason2) => {\n                    handleClose(i2, reason2);\n                  },\n                  alreadyHaveEvent: localAlreadyHaveEventHandler,\n                  eoseTimeout: params.maxWait\n                });\n              }).catch((err) => {\n                handleClose(i2, `auth was required and attempted, but failed with: ${err}`);\n              });\n            } else {\n              handleClose(i2, reason);\n            }\n          },\n          alreadyHaveEvent: localAlreadyHaveEventHandler,\n          eoseTimeout: params.maxWait\n        });\n        subs.push(subscription);\n      })\n    );\n    return {\n      async close() {\n        await allOpened;\n        subs.forEach((sub) => {\n          sub.close();\n        });\n      }\n    };\n  }\n  subscribeManyMap(requests, params) {\n    if (this.trackRelays) {\n      params.receivedEvent = (relay, id) => {\n        let set = this.seenOn.get(id);\n        if (!set) {\n          set = /* @__PURE__ */ new Set();\n          this.seenOn.set(id, set);\n        }\n        set.add(relay);\n      };\n    }\n    const _knownIds = /* @__PURE__ */ new Set();\n    const subs = [];\n    const relaysLength = Object.keys(requests).length;\n    const eosesReceived = [];\n    let handleEose = (i2) => {\n      if (eosesReceived[i2])\n        return;\n      eosesReceived[i2] = true;\n      if (eosesReceived.filter((a) => a).length === relaysLength) {\n        params.oneose?.();\n        handleEose = () => {\n        };\n      }\n    };\n    const closesReceived = [];\n    let handleClose = (i2, reason) => {\n      if (closesReceived[i2])\n        return;\n      handleEose(i2);\n      closesReceived[i2] = reason;\n      if (closesReceived.filter((a) => a).length === relaysLength) {\n        params.onclose?.(closesReceived);\n        handleClose = () => {\n        };\n      }\n    };\n    const localAlreadyHaveEventHandler = (id) => {\n      if (params.alreadyHaveEvent?.(id)) {\n        return true;\n      }\n      const have = _knownIds.has(id);\n      _knownIds.add(id);\n      return have;\n    };\n    const allOpened = Promise.all(\n      Object.entries(requests).map(async (req, i2, arr) => {\n        if (arr.indexOf(req) !== i2) {\n          handleClose(i2, \"duplicate url\");\n          return;\n        }\n        let [url, filters] = req;\n        url = normalizeURL(url);\n        let relay;\n        try {\n          relay = await this.ensureRelay(url, {\n            connectionTimeout: params.maxWait ? Math.max(params.maxWait * 0.8, params.maxWait - 1e3) : void 0\n          });\n        } catch (err) {\n          handleClose(i2, err?.message || String(err));\n          return;\n        }\n        let subscription = relay.subscribe(filters, {\n          ...params,\n          oneose: () => handleEose(i2),\n          onclose: (reason) => {\n            if (reason.startsWith(\"auth-required:\") && params.doauth) {\n              relay.auth(params.doauth).then(() => {\n                relay.subscribe(filters, {\n                  ...params,\n                  oneose: () => handleEose(i2),\n                  onclose: (reason2) => {\n                    handleClose(i2, reason2);\n                  },\n                  alreadyHaveEvent: localAlreadyHaveEventHandler,\n                  eoseTimeout: params.maxWait\n                });\n              }).catch((err) => {\n                handleClose(i2, `auth was required and attempted, but failed with: ${err}`);\n              });\n            } else {\n              handleClose(i2, reason);\n            }\n          },\n          alreadyHaveEvent: localAlreadyHaveEventHandler,\n          eoseTimeout: params.maxWait\n        });\n        subs.push(subscription);\n      })\n    );\n    return {\n      async close() {\n        await allOpened;\n        subs.forEach((sub) => {\n          sub.close();\n        });\n      }\n    };\n  }\n  subscribeEose(relays, filter, params) {\n    const subcloser = this.subscribe(relays, filter, {\n      ...params,\n      oneose() {\n        subcloser.close();\n      }\n    });\n    return subcloser;\n  }\n  subscribeManyEose(relays, filters, params) {\n    const subcloser = this.subscribeMany(relays, filters, {\n      ...params,\n      oneose() {\n        subcloser.close();\n      }\n    });\n    return subcloser;\n  }\n  async querySync(relays, filter, params) {\n    return new Promise(async (resolve) => {\n      const events = [];\n      this.subscribeEose(relays, filter, {\n        ...params,\n        onevent(event) {\n          events.push(event);\n        },\n        onclose(_) {\n          resolve(events);\n        }\n      });\n    });\n  }\n  async get(relays, filter, params) {\n    filter.limit = 1;\n    const events = await this.querySync(relays, filter, params);\n    events.sort((a, b) => b.created_at - a.created_at);\n    return events[0] || null;\n  }\n  publish(relays, event) {\n    return relays.map(normalizeURL).map(async (url, i2, arr) => {\n      if (arr.indexOf(url) !== i2) {\n        return Promise.reject(\"duplicate url\");\n      }\n      let r = await this.ensureRelay(url);\n      return r.publish(event).then((reason) => {\n        if (this.trackRelays) {\n          let set = this.seenOn.get(event.id);\n          if (!set) {\n            set = /* @__PURE__ */ new Set();\n            this.seenOn.set(event.id, set);\n          }\n          set.add(r);\n        }\n        return reason;\n      });\n    });\n  }\n  listConnectionStatus() {\n    const map = /* @__PURE__ */ new Map();\n    this.relays.forEach((relay, url) => map.set(url, relay.connected));\n    return map;\n  }\n  destroy() {\n    this.relays.forEach((conn) => conn.close());\n    this.relays = /* @__PURE__ */ new Map();\n  }\n};\n\n// pool.ts\nvar _WebSocket2;\ntry {\n  _WebSocket2 = WebSocket;\n} catch {\n}\nvar SimplePool = class extends AbstractSimplePool {\n  constructor() {\n    super({ verifyEvent, websocketImplementation: _WebSocket2 });\n  }\n};\n\n// nip19.ts\nvar nip19_exports = {};\n__export(nip19_exports, {\n  BECH32_REGEX: () => BECH32_REGEX,\n  Bech32MaxSize: () => Bech32MaxSize,\n  NostrTypeGuard: () => NostrTypeGuard,\n  decode: () => decode,\n  decodeNostrURI: () => decodeNostrURI,\n  encodeBytes: () => encodeBytes,\n  naddrEncode: () => naddrEncode,\n  neventEncode: () => neventEncode,\n  noteEncode: () => noteEncode,\n  nprofileEncode: () => nprofileEncode,\n  npubEncode: () => npubEncode,\n  nsecEncode: () => nsecEncode\n});\nimport { bytesToHex as bytesToHex2, concatBytes, hexToBytes } from \"@noble/hashes/utils\";\nimport { bech32 } from \"@scure/base\";\nvar NostrTypeGuard = {\n  isNProfile: (value) => /^nprofile1[a-z\\d]+$/.test(value || \"\"),\n  isNEvent: (value) => /^nevent1[a-z\\d]+$/.test(value || \"\"),\n  isNAddr: (value) => /^naddr1[a-z\\d]+$/.test(value || \"\"),\n  isNSec: (value) => /^nsec1[a-z\\d]{58}$/.test(value || \"\"),\n  isNPub: (value) => /^npub1[a-z\\d]{58}$/.test(value || \"\"),\n  isNote: (value) => /^note1[a-z\\d]+$/.test(value || \"\"),\n  isNcryptsec: (value) => /^ncryptsec1[a-z\\d]+$/.test(value || \"\")\n};\nvar Bech32MaxSize = 5e3;\nvar BECH32_REGEX = /[\\x21-\\x7E]{1,83}1[023456789acdefghjklmnpqrstuvwxyz]{6,}/;\nfunction integerToUint8Array(number) {\n  const uint8Array = new Uint8Array(4);\n  uint8Array[0] = number >> 24 & 255;\n  uint8Array[1] = number >> 16 & 255;\n  uint8Array[2] = number >> 8 & 255;\n  uint8Array[3] = number & 255;\n  return uint8Array;\n}\nfunction decodeNostrURI(nip19code) {\n  try {\n    if (nip19code.startsWith(\"nostr:\"))\n      nip19code = nip19code.substring(6);\n    return decode(nip19code);\n  } catch (_err) {\n    return { type: \"invalid\", data: null };\n  }\n}\nfunction decode(nip19) {\n  let { prefix, words } = bech32.decode(nip19, Bech32MaxSize);\n  let data = new Uint8Array(bech32.fromWords(words));\n  switch (prefix) {\n    case \"nprofile\": {\n      let tlv = parseTLV(data);\n      if (!tlv[0]?.[0])\n        throw new Error(\"missing TLV 0 for nprofile\");\n      if (tlv[0][0].length !== 32)\n        throw new Error(\"TLV 0 should be 32 bytes\");\n      return {\n        type: \"nprofile\",\n        data: {\n          pubkey: bytesToHex2(tlv[0][0]),\n          relays: tlv[1] ? tlv[1].map((d) => utf8Decoder.decode(d)) : []\n        }\n      };\n    }\n    case \"nevent\": {\n      let tlv = parseTLV(data);\n      if (!tlv[0]?.[0])\n        throw new Error(\"missing TLV 0 for nevent\");\n      if (tlv[0][0].length !== 32)\n        throw new Error(\"TLV 0 should be 32 bytes\");\n      if (tlv[2] && tlv[2][0].length !== 32)\n        throw new Error(\"TLV 2 should be 32 bytes\");\n      if (tlv[3] && tlv[3][0].length !== 4)\n        throw new Error(\"TLV 3 should be 4 bytes\");\n      return {\n        type: \"nevent\",\n        data: {\n          id: bytesToHex2(tlv[0][0]),\n          relays: tlv[1] ? tlv[1].map((d) => utf8Decoder.decode(d)) : [],\n          author: tlv[2]?.[0] ? bytesToHex2(tlv[2][0]) : void 0,\n          kind: tlv[3]?.[0] ? parseInt(bytesToHex2(tlv[3][0]), 16) : void 0\n        }\n      };\n    }\n    case \"naddr\": {\n      let tlv = parseTLV(data);\n      if (!tlv[0]?.[0])\n        throw new Error(\"missing TLV 0 for naddr\");\n      if (!tlv[2]?.[0])\n        throw new Error(\"missing TLV 2 for naddr\");\n      if (tlv[2][0].length !== 32)\n        throw new Error(\"TLV 2 should be 32 bytes\");\n      if (!tlv[3]?.[0])\n        throw new Error(\"missing TLV 3 for naddr\");\n      if (tlv[3][0].length !== 4)\n        throw new Error(\"TLV 3 should be 4 bytes\");\n      return {\n        type: \"naddr\",\n        data: {\n          identifier: utf8Decoder.decode(tlv[0][0]),\n          pubkey: bytesToHex2(tlv[2][0]),\n          kind: parseInt(bytesToHex2(tlv[3][0]), 16),\n          relays: tlv[1] ? tlv[1].map((d) => utf8Decoder.decode(d)) : []\n        }\n      };\n    }\n    case \"nsec\":\n      return { type: prefix, data };\n    case \"npub\":\n    case \"note\":\n      return { type: prefix, data: bytesToHex2(data) };\n    default:\n      throw new Error(`unknown prefix ${prefix}`);\n  }\n}\nfunction parseTLV(data) {\n  let result = {};\n  let rest = data;\n  while (rest.length > 0) {\n    let t = rest[0];\n    let l = rest[1];\n    let v = rest.slice(2, 2 + l);\n    rest = rest.slice(2 + l);\n    if (v.length < l)\n      throw new Error(`not enough data to read on TLV ${t}`);\n    result[t] = result[t] || [];\n    result[t].push(v);\n  }\n  return result;\n}\nfunction nsecEncode(key) {\n  return encodeBytes(\"nsec\", key);\n}\nfunction npubEncode(hex) {\n  return encodeBytes(\"npub\", hexToBytes(hex));\n}\nfunction noteEncode(hex) {\n  return encodeBytes(\"note\", hexToBytes(hex));\n}\nfunction encodeBech32(prefix, data) {\n  let words = bech32.toWords(data);\n  return bech32.encode(prefix, words, Bech32MaxSize);\n}\nfunction encodeBytes(prefix, bytes) {\n  return encodeBech32(prefix, bytes);\n}\nfunction nprofileEncode(profile) {\n  let data = encodeTLV({\n    0: [hexToBytes(profile.pubkey)],\n    1: (profile.relays || []).map((url) => utf8Encoder.encode(url))\n  });\n  return encodeBech32(\"nprofile\", data);\n}\nfunction neventEncode(event) {\n  let kindArray;\n  if (event.kind !== void 0) {\n    kindArray = integerToUint8Array(event.kind);\n  }\n  let data = encodeTLV({\n    0: [hexToBytes(event.id)],\n    1: (event.relays || []).map((url) => utf8Encoder.encode(url)),\n    2: event.author ? [hexToBytes(event.author)] : [],\n    3: kindArray ? [new Uint8Array(kindArray)] : []\n  });\n  return encodeBech32(\"nevent\", data);\n}\nfunction naddrEncode(addr) {\n  let kind = new ArrayBuffer(4);\n  new DataView(kind).setUint32(0, addr.kind, false);\n  let data = encodeTLV({\n    0: [utf8Encoder.encode(addr.identifier)],\n    1: (addr.relays || []).map((url) => utf8Encoder.encode(url)),\n    2: [hexToBytes(addr.pubkey)],\n    3: [new Uint8Array(kind)]\n  });\n  return encodeBech32(\"naddr\", data);\n}\nfunction encodeTLV(tlv) {\n  let entries = [];\n  Object.entries(tlv).reverse().forEach(([t, vs]) => {\n    vs.forEach((v) => {\n      let entry = new Uint8Array(v.length + 2);\n      entry.set([parseInt(t)], 0);\n      entry.set([v.length], 1);\n      entry.set(v, 2);\n      entries.push(entry);\n    });\n  });\n  return concatBytes(...entries);\n}\n\n// references.ts\nvar mentionRegex = /\\bnostr:((note|npub|naddr|nevent|nprofile)1\\w+)\\b|#\\[(\\d+)\\]/g;\nfunction parseReferences(evt) {\n  let references = [];\n  for (let ref of evt.content.matchAll(mentionRegex)) {\n    if (ref[2]) {\n      try {\n        let { type, data } = decode(ref[1]);\n        switch (type) {\n          case \"npub\": {\n            references.push({\n              text: ref[0],\n              profile: { pubkey: data, relays: [] }\n            });\n            break;\n          }\n          case \"nprofile\": {\n            references.push({\n              text: ref[0],\n              profile: data\n            });\n            break;\n          }\n          case \"note\": {\n            references.push({\n              text: ref[0],\n              event: { id: data, relays: [] }\n            });\n            break;\n          }\n          case \"nevent\": {\n            references.push({\n              text: ref[0],\n              event: data\n            });\n            break;\n          }\n          case \"naddr\": {\n            references.push({\n              text: ref[0],\n              address: data\n            });\n            break;\n          }\n        }\n      } catch (err) {\n      }\n    } else if (ref[3]) {\n      let idx = parseInt(ref[3], 10);\n      let tag = evt.tags[idx];\n      if (!tag)\n        continue;\n      switch (tag[0]) {\n        case \"p\": {\n          references.push({\n            text: ref[0],\n            profile: { pubkey: tag[1], relays: tag[2] ? [tag[2]] : [] }\n          });\n          break;\n        }\n        case \"e\": {\n          references.push({\n            text: ref[0],\n            event: { id: tag[1], relays: tag[2] ? [tag[2]] : [] }\n          });\n          break;\n        }\n        case \"a\": {\n          try {\n            let [kind, pubkey, identifier] = tag[1].split(\":\");\n            references.push({\n              text: ref[0],\n              address: {\n                identifier,\n                pubkey,\n                kind: parseInt(kind, 10),\n                relays: tag[2] ? [tag[2]] : []\n              }\n            });\n          } catch (err) {\n          }\n          break;\n        }\n      }\n    }\n  }\n  return references;\n}\n\n// nip04.ts\nvar nip04_exports = {};\n__export(nip04_exports, {\n  decrypt: () => decrypt,\n  encrypt: () => encrypt\n});\nimport { bytesToHex as bytesToHex3, randomBytes } from \"@noble/hashes/utils\";\nimport { secp256k1 } from \"@noble/curves/secp256k1\";\nimport { cbc } from \"@noble/ciphers/aes\";\nimport { base64 } from \"@scure/base\";\nfunction encrypt(secretKey, pubkey, text) {\n  const privkey = secretKey instanceof Uint8Array ? bytesToHex3(secretKey) : secretKey;\n  const key = secp256k1.getSharedSecret(privkey, \"02\" + pubkey);\n  const normalizedKey = getNormalizedX(key);\n  let iv = Uint8Array.from(randomBytes(16));\n  let plaintext = utf8Encoder.encode(text);\n  let ciphertext = cbc(normalizedKey, iv).encrypt(plaintext);\n  let ctb64 = base64.encode(new Uint8Array(ciphertext));\n  let ivb64 = base64.encode(new Uint8Array(iv.buffer));\n  return `${ctb64}?iv=${ivb64}`;\n}\nfunction decrypt(secretKey, pubkey, data) {\n  const privkey = secretKey instanceof Uint8Array ? bytesToHex3(secretKey) : secretKey;\n  let [ctb64, ivb64] = data.split(\"?iv=\");\n  let key = secp256k1.getSharedSecret(privkey, \"02\" + pubkey);\n  let normalizedKey = getNormalizedX(key);\n  let iv = base64.decode(ivb64);\n  let ciphertext = base64.decode(ctb64);\n  let plaintext = cbc(normalizedKey, iv).decrypt(ciphertext);\n  return utf8Decoder.decode(plaintext);\n}\nfunction getNormalizedX(key) {\n  return key.slice(1, 33);\n}\n\n// nip05.ts\nvar nip05_exports = {};\n__export(nip05_exports, {\n  NIP05_REGEX: () => NIP05_REGEX,\n  isNip05: () => isNip05,\n  isValid: () => isValid,\n  queryProfile: () => queryProfile,\n  searchDomain: () => searchDomain,\n  useFetchImplementation: () => useFetchImplementation\n});\nvar NIP05_REGEX = /^(?:([\\w.+-]+)@)?([\\w_-]+(\\.[\\w_-]+)+)$/;\nvar isNip05 = (value) => NIP05_REGEX.test(value || \"\");\nvar _fetch;\ntry {\n  _fetch = fetch;\n} catch (_) {\n  null;\n}\nfunction useFetchImplementation(fetchImplementation) {\n  _fetch = fetchImplementation;\n}\nasync function searchDomain(domain, query = \"\") {\n  try {\n    const url = `https://${domain}/.well-known/nostr.json?name=${query}`;\n    const res = await _fetch(url, { redirect: \"manual\" });\n    if (res.status !== 200) {\n      throw Error(\"Wrong response code\");\n    }\n    const json = await res.json();\n    return json.names;\n  } catch (_) {\n    return {};\n  }\n}\nasync function queryProfile(fullname) {\n  const match = fullname.match(NIP05_REGEX);\n  if (!match)\n    return null;\n  const [, name = \"_\", domain] = match;\n  try {\n    const url = `https://${domain}/.well-known/nostr.json?name=${name}`;\n    const res = await _fetch(url, { redirect: \"manual\" });\n    if (res.status !== 200) {\n      throw Error(\"Wrong response code\");\n    }\n    const json = await res.json();\n    const pubkey = json.names[name];\n    return pubkey ? { pubkey, relays: json.relays?.[pubkey] } : null;\n  } catch (_e) {\n    return null;\n  }\n}\nasync function isValid(pubkey, nip05) {\n  const res = await queryProfile(nip05);\n  return res ? res.pubkey === pubkey : false;\n}\n\n// nip10.ts\nvar nip10_exports = {};\n__export(nip10_exports, {\n  parse: () => parse\n});\nfunction parse(event) {\n  const result = {\n    reply: void 0,\n    root: void 0,\n    mentions: [],\n    profiles: [],\n    quotes: []\n  };\n  let maybeParent;\n  let maybeRoot;\n  for (let i2 = event.tags.length - 1; i2 >= 0; i2--) {\n    const tag = event.tags[i2];\n    if (tag[0] === \"e\" && tag[1]) {\n      const [_, eTagEventId, eTagRelayUrl, eTagMarker, eTagAuthor] = tag;\n      const eventPointer = {\n        id: eTagEventId,\n        relays: eTagRelayUrl ? [eTagRelayUrl] : [],\n        author: eTagAuthor\n      };\n      if (eTagMarker === \"root\") {\n        result.root = eventPointer;\n        continue;\n      }\n      if (eTagMarker === \"reply\") {\n        result.reply = eventPointer;\n        continue;\n      }\n      if (eTagMarker === \"mention\") {\n        result.mentions.push(eventPointer);\n        continue;\n      }\n      if (!maybeParent) {\n        maybeParent = eventPointer;\n      } else {\n        maybeRoot = eventPointer;\n      }\n      result.mentions.push(eventPointer);\n      continue;\n    }\n    if (tag[0] === \"q\" && tag[1]) {\n      const [_, eTagEventId, eTagRelayUrl] = tag;\n      result.quotes.push({\n        id: eTagEventId,\n        relays: eTagRelayUrl ? [eTagRelayUrl] : []\n      });\n    }\n    if (tag[0] === \"p\" && tag[1]) {\n      result.profiles.push({\n        pubkey: tag[1],\n        relays: tag[2] ? [tag[2]] : []\n      });\n      continue;\n    }\n  }\n  if (!result.root) {\n    result.root = maybeRoot || maybeParent || result.reply;\n  }\n  if (!result.reply) {\n    result.reply = maybeParent || result.root;\n  }\n  ;\n  [result.reply, result.root].forEach((ref) => {\n    if (!ref)\n      return;\n    let idx = result.mentions.indexOf(ref);\n    if (idx !== -1) {\n      result.mentions.splice(idx, 1);\n    }\n    if (ref.author) {\n      let author = result.profiles.find((p) => p.pubkey === ref.author);\n      if (author && author.relays) {\n        if (!ref.relays) {\n          ref.relays = [];\n        }\n        author.relays.forEach((url) => {\n          if (ref.relays?.indexOf(url) === -1)\n            ref.relays.push(url);\n        });\n        author.relays = ref.relays;\n      }\n    }\n  });\n  result.mentions.forEach((ref) => {\n    if (ref.author) {\n      let author = result.profiles.find((p) => p.pubkey === ref.author);\n      if (author && author.relays) {\n        if (!ref.relays) {\n          ref.relays = [];\n        }\n        author.relays.forEach((url) => {\n          if (ref.relays.indexOf(url) === -1)\n            ref.relays.push(url);\n        });\n        author.relays = ref.relays;\n      }\n    }\n  });\n  return result;\n}\n\n// nip11.ts\nvar nip11_exports = {};\n__export(nip11_exports, {\n  fetchRelayInformation: () => fetchRelayInformation,\n  useFetchImplementation: () => useFetchImplementation2\n});\nvar _fetch2;\ntry {\n  _fetch2 = fetch;\n} catch {\n}\nfunction useFetchImplementation2(fetchImplementation) {\n  _fetch2 = fetchImplementation;\n}\nasync function fetchRelayInformation(url) {\n  return await (await fetch(url.replace(\"ws://\", \"http://\").replace(\"wss://\", \"https://\"), {\n    headers: { Accept: \"application/nostr+json\" }\n  })).json();\n}\n\n// nip13.ts\nvar nip13_exports = {};\n__export(nip13_exports, {\n  fastEventHash: () => fastEventHash,\n  getPow: () => getPow,\n  minePow: () => minePow\n});\nimport { bytesToHex as bytesToHex4 } from \"@noble/hashes/utils\";\nimport { sha256 as sha2562 } from \"@noble/hashes/sha256\";\nfunction getPow(hex) {\n  let count = 0;\n  for (let i2 = 0; i2 < 64; i2 += 8) {\n    const nibble = parseInt(hex.substring(i2, i2 + 8), 16);\n    if (nibble === 0) {\n      count += 32;\n    } else {\n      count += Math.clz32(nibble);\n      break;\n    }\n  }\n  return count;\n}\nfunction minePow(unsigned, difficulty) {\n  let count = 0;\n  const event = unsigned;\n  const tag = [\"nonce\", count.toString(), difficulty.toString()];\n  event.tags.push(tag);\n  while (true) {\n    const now2 = Math.floor(new Date().getTime() / 1e3);\n    if (now2 !== event.created_at) {\n      count = 0;\n      event.created_at = now2;\n    }\n    tag[1] = (++count).toString();\n    event.id = fastEventHash(event);\n    if (getPow(event.id) >= difficulty) {\n      break;\n    }\n  }\n  return event;\n}\nfunction fastEventHash(evt) {\n  return bytesToHex4(\n    sha2562(utf8Encoder.encode(JSON.stringify([0, evt.pubkey, evt.created_at, evt.kind, evt.tags, evt.content])))\n  );\n}\n\n// nip17.ts\nvar nip17_exports = {};\n__export(nip17_exports, {\n  unwrapEvent: () => unwrapEvent2,\n  unwrapManyEvents: () => unwrapManyEvents2,\n  wrapEvent: () => wrapEvent2,\n  wrapManyEvents: () => wrapManyEvents2\n});\n\n// nip59.ts\nvar nip59_exports = {};\n__export(nip59_exports, {\n  createRumor: () => createRumor,\n  createSeal: () => createSeal,\n  createWrap: () => createWrap,\n  unwrapEvent: () => unwrapEvent,\n  unwrapManyEvents: () => unwrapManyEvents,\n  wrapEvent: () => wrapEvent,\n  wrapManyEvents: () => wrapManyEvents\n});\n\n// nip44.ts\nvar nip44_exports = {};\n__export(nip44_exports, {\n  decrypt: () => decrypt2,\n  encrypt: () => encrypt2,\n  getConversationKey: () => getConversationKey,\n  v2: () => v2\n});\nimport { chacha20 } from \"@noble/ciphers/chacha\";\nimport { equalBytes } from \"@noble/ciphers/utils\";\nimport { secp256k1 as secp256k12 } from \"@noble/curves/secp256k1\";\nimport { extract as hkdf_extract, expand as hkdf_expand } from \"@noble/hashes/hkdf\";\nimport { hmac } from \"@noble/hashes/hmac\";\nimport { sha256 as sha2563 } from \"@noble/hashes/sha256\";\nimport { concatBytes as concatBytes2, randomBytes as randomBytes2 } from \"@noble/hashes/utils\";\nimport { base64 as base642 } from \"@scure/base\";\nvar minPlaintextSize = 1;\nvar maxPlaintextSize = 65535;\nfunction getConversationKey(privkeyA, pubkeyB) {\n  const sharedX = secp256k12.getSharedSecret(privkeyA, \"02\" + pubkeyB).subarray(1, 33);\n  return hkdf_extract(sha2563, sharedX, \"nip44-v2\");\n}\nfunction getMessageKeys(conversationKey, nonce) {\n  const keys = hkdf_expand(sha2563, conversationKey, nonce, 76);\n  return {\n    chacha_key: keys.subarray(0, 32),\n    chacha_nonce: keys.subarray(32, 44),\n    hmac_key: keys.subarray(44, 76)\n  };\n}\nfunction calcPaddedLen(len) {\n  if (!Number.isSafeInteger(len) || len < 1)\n    throw new Error(\"expected positive integer\");\n  if (len <= 32)\n    return 32;\n  const nextPower = 1 << Math.floor(Math.log2(len - 1)) + 1;\n  const chunk = nextPower <= 256 ? 32 : nextPower / 8;\n  return chunk * (Math.floor((len - 1) / chunk) + 1);\n}\nfunction writeU16BE(num) {\n  if (!Number.isSafeInteger(num) || num < minPlaintextSize || num > maxPlaintextSize)\n    throw new Error(\"invalid plaintext size: must be between 1 and 65535 bytes\");\n  const arr = new Uint8Array(2);\n  new DataView(arr.buffer).setUint16(0, num, false);\n  return arr;\n}\nfunction pad(plaintext) {\n  const unpadded = utf8Encoder.encode(plaintext);\n  const unpaddedLen = unpadded.length;\n  const prefix = writeU16BE(unpaddedLen);\n  const suffix = new Uint8Array(calcPaddedLen(unpaddedLen) - unpaddedLen);\n  return concatBytes2(prefix, unpadded, suffix);\n}\nfunction unpad(padded) {\n  const unpaddedLen = new DataView(padded.buffer).getUint16(0);\n  const unpadded = padded.subarray(2, 2 + unpaddedLen);\n  if (unpaddedLen < minPlaintextSize || unpaddedLen > maxPlaintextSize || unpadded.length !== unpaddedLen || padded.length !== 2 + calcPaddedLen(unpaddedLen))\n    throw new Error(\"invalid padding\");\n  return utf8Decoder.decode(unpadded);\n}\nfunction hmacAad(key, message, aad) {\n  if (aad.length !== 32)\n    throw new Error(\"AAD associated data must be 32 bytes\");\n  const combined = concatBytes2(aad, message);\n  return hmac(sha2563, key, combined);\n}\nfunction decodePayload(payload) {\n  if (typeof payload !== \"string\")\n    throw new Error(\"payload must be a valid string\");\n  const plen = payload.length;\n  if (plen < 132 || plen > 87472)\n    throw new Error(\"invalid payload length: \" + plen);\n  if (payload[0] === \"#\")\n    throw new Error(\"unknown encryption version\");\n  let data;\n  try {\n    data = base642.decode(payload);\n  } catch (error) {\n    throw new Error(\"invalid base64: \" + error.message);\n  }\n  const dlen = data.length;\n  if (dlen < 99 || dlen > 65603)\n    throw new Error(\"invalid data length: \" + dlen);\n  const vers = data[0];\n  if (vers !== 2)\n    throw new Error(\"unknown encryption version \" + vers);\n  return {\n    nonce: data.subarray(1, 33),\n    ciphertext: data.subarray(33, -32),\n    mac: data.subarray(-32)\n  };\n}\nfunction encrypt2(plaintext, conversationKey, nonce = randomBytes2(32)) {\n  const { chacha_key, chacha_nonce, hmac_key } = getMessageKeys(conversationKey, nonce);\n  const padded = pad(plaintext);\n  const ciphertext = chacha20(chacha_key, chacha_nonce, padded);\n  const mac = hmacAad(hmac_key, ciphertext, nonce);\n  return base642.encode(concatBytes2(new Uint8Array([2]), nonce, ciphertext, mac));\n}\nfunction decrypt2(payload, conversationKey) {\n  const { nonce, ciphertext, mac } = decodePayload(payload);\n  const { chacha_key, chacha_nonce, hmac_key } = getMessageKeys(conversationKey, nonce);\n  const calculatedMac = hmacAad(hmac_key, ciphertext, nonce);\n  if (!equalBytes(calculatedMac, mac))\n    throw new Error(\"invalid MAC\");\n  const padded = chacha20(chacha_key, chacha_nonce, ciphertext);\n  return unpad(padded);\n}\nvar v2 = {\n  utils: {\n    getConversationKey,\n    calcPaddedLen\n  },\n  encrypt: encrypt2,\n  decrypt: decrypt2\n};\n\n// nip59.ts\nvar TWO_DAYS = 2 * 24 * 60 * 60;\nvar now = () => Math.round(Date.now() / 1e3);\nvar randomNow = () => Math.round(now() - Math.random() * TWO_DAYS);\nvar nip44ConversationKey = (privateKey, publicKey) => getConversationKey(privateKey, publicKey);\nvar nip44Encrypt = (data, privateKey, publicKey) => encrypt2(JSON.stringify(data), nip44ConversationKey(privateKey, publicKey));\nvar nip44Decrypt = (data, privateKey) => JSON.parse(decrypt2(data.content, nip44ConversationKey(privateKey, data.pubkey)));\nfunction createRumor(event, privateKey) {\n  const rumor = {\n    created_at: now(),\n    content: \"\",\n    tags: [],\n    ...event,\n    pubkey: getPublicKey(privateKey)\n  };\n  rumor.id = getEventHash(rumor);\n  return rumor;\n}\nfunction createSeal(rumor, privateKey, recipientPublicKey) {\n  return finalizeEvent(\n    {\n      kind: Seal,\n      content: nip44Encrypt(rumor, privateKey, recipientPublicKey),\n      created_at: randomNow(),\n      tags: []\n    },\n    privateKey\n  );\n}\nfunction createWrap(seal, recipientPublicKey) {\n  const randomKey = generateSecretKey();\n  return finalizeEvent(\n    {\n      kind: GiftWrap,\n      content: nip44Encrypt(seal, randomKey, recipientPublicKey),\n      created_at: randomNow(),\n      tags: [[\"p\", recipientPublicKey]]\n    },\n    randomKey\n  );\n}\nfunction wrapEvent(event, senderPrivateKey, recipientPublicKey) {\n  const rumor = createRumor(event, senderPrivateKey);\n  const seal = createSeal(rumor, senderPrivateKey, recipientPublicKey);\n  return createWrap(seal, recipientPublicKey);\n}\nfunction wrapManyEvents(event, senderPrivateKey, recipientsPublicKeys) {\n  if (!recipientsPublicKeys || recipientsPublicKeys.length === 0) {\n    throw new Error(\"At least one recipient is required.\");\n  }\n  const senderPublicKey = getPublicKey(senderPrivateKey);\n  const wrappeds = [wrapEvent(event, senderPrivateKey, senderPublicKey)];\n  recipientsPublicKeys.forEach((recipientPublicKey) => {\n    wrappeds.push(wrapEvent(event, senderPrivateKey, recipientPublicKey));\n  });\n  return wrappeds;\n}\nfunction unwrapEvent(wrap, recipientPrivateKey) {\n  const unwrappedSeal = nip44Decrypt(wrap, recipientPrivateKey);\n  return nip44Decrypt(unwrappedSeal, recipientPrivateKey);\n}\nfunction unwrapManyEvents(wrappedEvents, recipientPrivateKey) {\n  let unwrappedEvents = [];\n  wrappedEvents.forEach((e) => {\n    unwrappedEvents.push(unwrapEvent(e, recipientPrivateKey));\n  });\n  unwrappedEvents.sort((a, b) => a.created_at - b.created_at);\n  return unwrappedEvents;\n}\n\n// nip17.ts\nfunction createEvent(recipients, message, conversationTitle, replyTo) {\n  const baseEvent = {\n    created_at: Math.ceil(Date.now() / 1e3),\n    kind: PrivateDirectMessage,\n    tags: [],\n    content: message\n  };\n  const recipientsArray = Array.isArray(recipients) ? recipients : [recipients];\n  recipientsArray.forEach(({ publicKey, relayUrl }) => {\n    baseEvent.tags.push(relayUrl ? [\"p\", publicKey, relayUrl] : [\"p\", publicKey]);\n  });\n  if (replyTo) {\n    baseEvent.tags.push([\"e\", replyTo.eventId, replyTo.relayUrl || \"\", \"reply\"]);\n  }\n  if (conversationTitle) {\n    baseEvent.tags.push([\"subject\", conversationTitle]);\n  }\n  return baseEvent;\n}\nfunction wrapEvent2(senderPrivateKey, recipient, message, conversationTitle, replyTo) {\n  const event = createEvent(recipient, message, conversationTitle, replyTo);\n  return wrapEvent(event, senderPrivateKey, recipient.publicKey);\n}\nfunction wrapManyEvents2(senderPrivateKey, recipients, message, conversationTitle, replyTo) {\n  if (!recipients || recipients.length === 0) {\n    throw new Error(\"At least one recipient is required.\");\n  }\n  const senderPublicKey = getPublicKey(senderPrivateKey);\n  return [{ publicKey: senderPublicKey }, ...recipients].map(\n    (recipient) => wrapEvent2(senderPrivateKey, recipient, message, conversationTitle, replyTo)\n  );\n}\nvar unwrapEvent2 = unwrapEvent;\nvar unwrapManyEvents2 = unwrapManyEvents;\n\n// nip18.ts\nvar nip18_exports = {};\n__export(nip18_exports, {\n  finishRepostEvent: () => finishRepostEvent,\n  getRepostedEvent: () => getRepostedEvent,\n  getRepostedEventPointer: () => getRepostedEventPointer\n});\nfunction finishRepostEvent(t, reposted, relayUrl, privateKey) {\n  let kind;\n  const tags = [...t.tags ?? [], [\"e\", reposted.id, relayUrl], [\"p\", reposted.pubkey]];\n  if (reposted.kind === ShortTextNote) {\n    kind = Repost;\n  } else {\n    kind = GenericRepost;\n    tags.push([\"k\", String(reposted.kind)]);\n  }\n  return finalizeEvent(\n    {\n      kind,\n      tags,\n      content: t.content === \"\" || reposted.tags?.find((tag) => tag[0] === \"-\") ? \"\" : JSON.stringify(reposted),\n      created_at: t.created_at\n    },\n    privateKey\n  );\n}\nfunction getRepostedEventPointer(event) {\n  if (![Repost, GenericRepost].includes(event.kind)) {\n    return void 0;\n  }\n  let lastETag;\n  let lastPTag;\n  for (let i2 = event.tags.length - 1; i2 >= 0 && (lastETag === void 0 || lastPTag === void 0); i2--) {\n    const tag = event.tags[i2];\n    if (tag.length >= 2) {\n      if (tag[0] === \"e\" && lastETag === void 0) {\n        lastETag = tag;\n      } else if (tag[0] === \"p\" && lastPTag === void 0) {\n        lastPTag = tag;\n      }\n    }\n  }\n  if (lastETag === void 0) {\n    return void 0;\n  }\n  return {\n    id: lastETag[1],\n    relays: [lastETag[2], lastPTag?.[2]].filter((x) => typeof x === \"string\"),\n    author: lastPTag?.[1]\n  };\n}\nfunction getRepostedEvent(event, { skipVerification } = {}) {\n  const pointer = getRepostedEventPointer(event);\n  if (pointer === void 0 || event.content === \"\") {\n    return void 0;\n  }\n  let repostedEvent;\n  try {\n    repostedEvent = JSON.parse(event.content);\n  } catch (error) {\n    return void 0;\n  }\n  if (repostedEvent.id !== pointer.id) {\n    return void 0;\n  }\n  if (!skipVerification && !verifyEvent(repostedEvent)) {\n    return void 0;\n  }\n  return repostedEvent;\n}\n\n// nip21.ts\nvar nip21_exports = {};\n__export(nip21_exports, {\n  NOSTR_URI_REGEX: () => NOSTR_URI_REGEX,\n  parse: () => parse2,\n  test: () => test\n});\nvar NOSTR_URI_REGEX = new RegExp(`nostr:(${BECH32_REGEX.source})`);\nfunction test(value) {\n  return typeof value === \"string\" && new RegExp(`^${NOSTR_URI_REGEX.source}$`).test(value);\n}\nfunction parse2(uri) {\n  const match = uri.match(new RegExp(`^${NOSTR_URI_REGEX.source}$`));\n  if (!match)\n    throw new Error(`Invalid Nostr URI: ${uri}`);\n  return {\n    uri: match[0],\n    value: match[1],\n    decoded: decode(match[1])\n  };\n}\n\n// nip25.ts\nvar nip25_exports = {};\n__export(nip25_exports, {\n  finishReactionEvent: () => finishReactionEvent,\n  getReactedEventPointer: () => getReactedEventPointer\n});\nfunction finishReactionEvent(t, reacted, privateKey) {\n  const inheritedTags = reacted.tags.filter((tag) => tag.length >= 2 && (tag[0] === \"e\" || tag[0] === \"p\"));\n  return finalizeEvent(\n    {\n      ...t,\n      kind: Reaction,\n      tags: [...t.tags ?? [], ...inheritedTags, [\"e\", reacted.id], [\"p\", reacted.pubkey]],\n      content: t.content ?? \"+\"\n    },\n    privateKey\n  );\n}\nfunction getReactedEventPointer(event) {\n  if (event.kind !== Reaction) {\n    return void 0;\n  }\n  let lastETag;\n  let lastPTag;\n  for (let i2 = event.tags.length - 1; i2 >= 0 && (lastETag === void 0 || lastPTag === void 0); i2--) {\n    const tag = event.tags[i2];\n    if (tag.length >= 2) {\n      if (tag[0] === \"e\" && lastETag === void 0) {\n        lastETag = tag;\n      } else if (tag[0] === \"p\" && lastPTag === void 0) {\n        lastPTag = tag;\n      }\n    }\n  }\n  if (lastETag === void 0 || lastPTag === void 0) {\n    return void 0;\n  }\n  return {\n    id: lastETag[1],\n    relays: [lastETag[2], lastPTag[2]].filter((x) => x !== void 0),\n    author: lastPTag[1]\n  };\n}\n\n// nip27.ts\nvar nip27_exports = {};\n__export(nip27_exports, {\n  parse: () => parse3\n});\nvar noCharacter = /\\W/m;\nvar noURLCharacter = /\\W |\\W$|$|,| /m;\nfunction* parse3(content) {\n  const max = content.length;\n  let prevIndex = 0;\n  let index = 0;\n  while (index < max) {\n    let u = content.indexOf(\":\", index);\n    if (u === -1) {\n      break;\n    }\n    if (content.substring(u - 5, u) === \"nostr\") {\n      const m = content.substring(u + 60).match(noCharacter);\n      const end = m ? u + 60 + m.index : max;\n      try {\n        let pointer;\n        let { data, type } = decode(content.substring(u + 1, end));\n        switch (type) {\n          case \"npub\":\n            pointer = { pubkey: data };\n            break;\n          case \"nsec\":\n          case \"note\":\n            index = end + 1;\n            continue;\n          default:\n            pointer = data;\n        }\n        if (prevIndex !== u - 5) {\n          yield { type: \"text\", text: content.substring(prevIndex, u - 5) };\n        }\n        yield { type: \"reference\", pointer };\n        index = end;\n        prevIndex = index;\n        continue;\n      } catch (_err) {\n        index = u + 1;\n        continue;\n      }\n    } else if (content.substring(u - 5, u) === \"https\" || content.substring(u - 4, u) === \"http\") {\n      const m = content.substring(u + 4).match(noURLCharacter);\n      const end = m ? u + 4 + m.index : max;\n      const prefixLen = content[u - 1] === \"s\" ? 5 : 4;\n      try {\n        let url = new URL(content.substring(u - prefixLen, end));\n        if (url.hostname.indexOf(\".\") === -1) {\n          throw new Error(\"invalid url\");\n        }\n        if (prevIndex !== u - prefixLen) {\n          yield { type: \"text\", text: content.substring(prevIndex, u - prefixLen) };\n        }\n        if (url.pathname.endsWith(\".png\") || url.pathname.endsWith(\".jpg\") || url.pathname.endsWith(\".jpeg\") || url.pathname.endsWith(\".gif\") || url.pathname.endsWith(\".webp\")) {\n          yield { type: \"image\", url: url.toString() };\n          index = end;\n          prevIndex = index;\n          continue;\n        }\n        if (url.pathname.endsWith(\".mp4\") || url.pathname.endsWith(\".avi\") || url.pathname.endsWith(\".webm\") || url.pathname.endsWith(\".mkv\")) {\n          yield { type: \"video\", url: url.toString() };\n          index = end;\n          prevIndex = index;\n          continue;\n        }\n        if (url.pathname.endsWith(\".mp3\") || url.pathname.endsWith(\".aac\") || url.pathname.endsWith(\".ogg\") || url.pathname.endsWith(\".opus\")) {\n          yield { type: \"audio\", url: url.toString() };\n          index = end;\n          prevIndex = index;\n          continue;\n        }\n        yield { type: \"url\", url: url.toString() };\n        index = end;\n        prevIndex = index;\n        continue;\n      } catch (_err) {\n        index = end + 1;\n        continue;\n      }\n    } else if (content.substring(u - 3, u) === \"wss\" || content.substring(u - 2, u) === \"ws\") {\n      const m = content.substring(u + 4).match(noURLCharacter);\n      const end = m ? u + 4 + m.index : max;\n      const prefixLen = content[u - 1] === \"s\" ? 3 : 2;\n      try {\n        let url = new URL(content.substring(u - prefixLen, end));\n        if (url.hostname.indexOf(\".\") === -1) {\n          throw new Error(\"invalid ws url\");\n        }\n        if (prevIndex !== u - prefixLen) {\n          yield { type: \"text\", text: content.substring(prevIndex, u - prefixLen) };\n        }\n        yield { type: \"relay\", url: url.toString() };\n        index = end;\n        prevIndex = index;\n        continue;\n      } catch (_err) {\n        index = end + 1;\n        continue;\n      }\n    } else {\n      index = u + 1;\n      continue;\n    }\n  }\n  if (prevIndex !== max) {\n    yield { type: \"text\", text: content.substring(prevIndex) };\n  }\n}\n\n// nip28.ts\nvar nip28_exports = {};\n__export(nip28_exports, {\n  channelCreateEvent: () => channelCreateEvent,\n  channelHideMessageEvent: () => channelHideMessageEvent,\n  channelMessageEvent: () => channelMessageEvent,\n  channelMetadataEvent: () => channelMetadataEvent,\n  channelMuteUserEvent: () => channelMuteUserEvent\n});\nvar channelCreateEvent = (t, privateKey) => {\n  let content;\n  if (typeof t.content === \"object\") {\n    content = JSON.stringify(t.content);\n  } else if (typeof t.content === \"string\") {\n    content = t.content;\n  } else {\n    return void 0;\n  }\n  return finalizeEvent(\n    {\n      kind: ChannelCreation,\n      tags: [...t.tags ?? []],\n      content,\n      created_at: t.created_at\n    },\n    privateKey\n  );\n};\nvar channelMetadataEvent = (t, privateKey) => {\n  let content;\n  if (typeof t.content === \"object\") {\n    content = JSON.stringify(t.content);\n  } else if (typeof t.content === \"string\") {\n    content = t.content;\n  } else {\n    return void 0;\n  }\n  return finalizeEvent(\n    {\n      kind: ChannelMetadata,\n      tags: [[\"e\", t.channel_create_event_id], ...t.tags ?? []],\n      content,\n      created_at: t.created_at\n    },\n    privateKey\n  );\n};\nvar channelMessageEvent = (t, privateKey) => {\n  const tags = [[\"e\", t.channel_create_event_id, t.relay_url, \"root\"]];\n  if (t.reply_to_channel_message_event_id) {\n    tags.push([\"e\", t.reply_to_channel_message_event_id, t.relay_url, \"reply\"]);\n  }\n  return finalizeEvent(\n    {\n      kind: ChannelMessage,\n      tags: [...tags, ...t.tags ?? []],\n      content: t.content,\n      created_at: t.created_at\n    },\n    privateKey\n  );\n};\nvar channelHideMessageEvent = (t, privateKey) => {\n  let content;\n  if (typeof t.content === \"object\") {\n    content = JSON.stringify(t.content);\n  } else if (typeof t.content === \"string\") {\n    content = t.content;\n  } else {\n    return void 0;\n  }\n  return finalizeEvent(\n    {\n      kind: ChannelHideMessage,\n      tags: [[\"e\", t.channel_message_event_id], ...t.tags ?? []],\n      content,\n      created_at: t.created_at\n    },\n    privateKey\n  );\n};\nvar channelMuteUserEvent = (t, privateKey) => {\n  let content;\n  if (typeof t.content === \"object\") {\n    content = JSON.stringify(t.content);\n  } else if (typeof t.content === \"string\") {\n    content = t.content;\n  } else {\n    return void 0;\n  }\n  return finalizeEvent(\n    {\n      kind: ChannelMuteUser,\n      tags: [[\"p\", t.pubkey_to_mute], ...t.tags ?? []],\n      content,\n      created_at: t.created_at\n    },\n    privateKey\n  );\n};\n\n// nip30.ts\nvar nip30_exports = {};\n__export(nip30_exports, {\n  EMOJI_SHORTCODE_REGEX: () => EMOJI_SHORTCODE_REGEX,\n  matchAll: () => matchAll,\n  regex: () => regex,\n  replaceAll: () => replaceAll\n});\nvar EMOJI_SHORTCODE_REGEX = /:(\\w+):/;\nvar regex = () => new RegExp(`\\\\B${EMOJI_SHORTCODE_REGEX.source}\\\\B`, \"g\");\nfunction* matchAll(content) {\n  const matches = content.matchAll(regex());\n  for (const match of matches) {\n    try {\n      const [shortcode, name] = match;\n      yield {\n        shortcode,\n        name,\n        start: match.index,\n        end: match.index + shortcode.length\n      };\n    } catch (_e) {\n    }\n  }\n}\nfunction replaceAll(content, replacer) {\n  return content.replaceAll(regex(), (shortcode, name) => {\n    return replacer({\n      shortcode,\n      name\n    });\n  });\n}\n\n// nip39.ts\nvar nip39_exports = {};\n__export(nip39_exports, {\n  useFetchImplementation: () => useFetchImplementation3,\n  validateGithub: () => validateGithub\n});\nvar _fetch3;\ntry {\n  _fetch3 = fetch;\n} catch {\n}\nfunction useFetchImplementation3(fetchImplementation) {\n  _fetch3 = fetchImplementation;\n}\nasync function validateGithub(pubkey, username, proof) {\n  try {\n    let res = await (await _fetch3(`https://gist.github.com/${username}/${proof}/raw`)).text();\n    return res === `Verifying that I control the following Nostr public key: ${pubkey}`;\n  } catch (_) {\n    return false;\n  }\n}\n\n// nip47.ts\nvar nip47_exports = {};\n__export(nip47_exports, {\n  makeNwcRequestEvent: () => makeNwcRequestEvent,\n  parseConnectionString: () => parseConnectionString\n});\nfunction parseConnectionString(connectionString) {\n  const { pathname, searchParams } = new URL(connectionString);\n  const pubkey = pathname;\n  const relay = searchParams.get(\"relay\");\n  const secret = searchParams.get(\"secret\");\n  if (!pubkey || !relay || !secret) {\n    throw new Error(\"invalid connection string\");\n  }\n  return { pubkey, relay, secret };\n}\nasync function makeNwcRequestEvent(pubkey, secretKey, invoice) {\n  const content = {\n    method: \"pay_invoice\",\n    params: {\n      invoice\n    }\n  };\n  const encryptedContent = await encrypt(secretKey, pubkey, JSON.stringify(content));\n  const eventTemplate = {\n    kind: NWCWalletRequest,\n    created_at: Math.round(Date.now() / 1e3),\n    content: encryptedContent,\n    tags: [[\"p\", pubkey]]\n  };\n  return finalizeEvent(eventTemplate, secretKey);\n}\n\n// nip54.ts\nvar nip54_exports = {};\n__export(nip54_exports, {\n  normalizeIdentifier: () => normalizeIdentifier\n});\nfunction normalizeIdentifier(name) {\n  name = name.trim().toLowerCase();\n  name = name.normalize(\"NFKC\");\n  return Array.from(name).map((char) => {\n    if (/\\p{Letter}/u.test(char) || /\\p{Number}/u.test(char)) {\n      return char;\n    }\n    return \"-\";\n  }).join(\"\");\n}\n\n// nip57.ts\nvar nip57_exports = {};\n__export(nip57_exports, {\n  getZapEndpoint: () => getZapEndpoint,\n  makeZapReceipt: () => makeZapReceipt,\n  makeZapRequest: () => makeZapRequest,\n  useFetchImplementation: () => useFetchImplementation4,\n  validateZapRequest: () => validateZapRequest\n});\nimport { bech32 as bech322 } from \"@scure/base\";\nvar _fetch4;\ntry {\n  _fetch4 = fetch;\n} catch {\n}\nfunction useFetchImplementation4(fetchImplementation) {\n  _fetch4 = fetchImplementation;\n}\nasync function getZapEndpoint(metadata) {\n  try {\n    let lnurl = \"\";\n    let { lud06, lud16 } = JSON.parse(metadata.content);\n    if (lud06) {\n      let { words } = bech322.decode(lud06, 1e3);\n      let data = bech322.fromWords(words);\n      lnurl = utf8Decoder.decode(data);\n    } else if (lud16) {\n      let [name, domain] = lud16.split(\"@\");\n      lnurl = new URL(`/.well-known/lnurlp/${name}`, `https://${domain}`).toString();\n    } else {\n      return null;\n    }\n    let res = await _fetch4(lnurl);\n    let body = await res.json();\n    if (body.allowsNostr && body.nostrPubkey) {\n      return body.callback;\n    }\n  } catch (err) {\n  }\n  return null;\n}\nfunction makeZapRequest({\n  profile,\n  event,\n  amount,\n  relays,\n  comment = \"\"\n}) {\n  if (!amount)\n    throw new Error(\"amount not given\");\n  if (!profile)\n    throw new Error(\"profile not given\");\n  let zr = {\n    kind: 9734,\n    created_at: Math.round(Date.now() / 1e3),\n    content: comment,\n    tags: [\n      [\"p\", profile],\n      [\"amount\", amount.toString()],\n      [\"relays\", ...relays]\n    ]\n  };\n  if (event && typeof event === \"string\") {\n    zr.tags.push([\"e\", event]);\n  }\n  if (event && typeof event === \"object\") {\n    if (isReplaceableKind(event.kind)) {\n      const a = [\"a\", `${event.kind}:${event.pubkey}:`];\n      zr.tags.push(a);\n    } else if (isAddressableKind(event.kind)) {\n      let d = event.tags.find(([t, v]) => t === \"d\" && v);\n      if (!d)\n        throw new Error(\"d tag not found or is empty\");\n      const a = [\"a\", `${event.kind}:${event.pubkey}:${d[1]}`];\n      zr.tags.push(a);\n    }\n  }\n  return zr;\n}\nfunction validateZapRequest(zapRequestString) {\n  let zapRequest;\n  try {\n    zapRequest = JSON.parse(zapRequestString);\n  } catch (err) {\n    return \"Invalid zap request JSON.\";\n  }\n  if (!validateEvent(zapRequest))\n    return \"Zap request is not a valid Nostr event.\";\n  if (!verifyEvent(zapRequest))\n    return \"Invalid signature on zap request.\";\n  let p = zapRequest.tags.find(([t, v]) => t === \"p\" && v);\n  if (!p)\n    return \"Zap request doesn't have a 'p' tag.\";\n  if (!p[1].match(/^[a-f0-9]{64}$/))\n    return \"Zap request 'p' tag is not valid hex.\";\n  let e = zapRequest.tags.find(([t, v]) => t === \"e\" && v);\n  if (e && !e[1].match(/^[a-f0-9]{64}$/))\n    return \"Zap request 'e' tag is not valid hex.\";\n  let relays = zapRequest.tags.find(([t, v]) => t === \"relays\" && v);\n  if (!relays)\n    return \"Zap request doesn't have a 'relays' tag.\";\n  return null;\n}\nfunction makeZapReceipt({\n  zapRequest,\n  preimage,\n  bolt11,\n  paidAt\n}) {\n  let zr = JSON.parse(zapRequest);\n  let tagsFromZapRequest = zr.tags.filter(([t]) => t === \"e\" || t === \"p\" || t === \"a\");\n  let zap = {\n    kind: 9735,\n    created_at: Math.round(paidAt.getTime() / 1e3),\n    content: \"\",\n    tags: [...tagsFromZapRequest, [\"P\", zr.pubkey], [\"bolt11\", bolt11], [\"description\", zapRequest]]\n  };\n  if (preimage) {\n    zap.tags.push([\"preimage\", preimage]);\n  }\n  return zap;\n}\n\n// nip98.ts\nvar nip98_exports = {};\n__export(nip98_exports, {\n  getToken: () => getToken,\n  hashPayload: () => hashPayload,\n  unpackEventFromToken: () => unpackEventFromToken,\n  validateEvent: () => validateEvent2,\n  validateEventKind: () => validateEventKind,\n  validateEventMethodTag: () => validateEventMethodTag,\n  validateEventPayloadTag: () => validateEventPayloadTag,\n  validateEventTimestamp: () => validateEventTimestamp,\n  validateEventUrlTag: () => validateEventUrlTag,\n  validateToken: () => validateToken\n});\nimport { sha256 as sha2564 } from \"@noble/hashes/sha256\";\nimport { bytesToHex as bytesToHex5 } from \"@noble/hashes/utils\";\nimport { base64 as base643 } from \"@scure/base\";\nvar _authorizationScheme = \"Nostr \";\nasync function getToken(loginUrl, httpMethod, sign, includeAuthorizationScheme = false, payload) {\n  const event = {\n    kind: HTTPAuth,\n    tags: [\n      [\"u\", loginUrl],\n      [\"method\", httpMethod]\n    ],\n    created_at: Math.round(new Date().getTime() / 1e3),\n    content: \"\"\n  };\n  if (payload) {\n    event.tags.push([\"payload\", hashPayload(payload)]);\n  }\n  const signedEvent = await sign(event);\n  const authorizationScheme = includeAuthorizationScheme ? _authorizationScheme : \"\";\n  return authorizationScheme + base643.encode(utf8Encoder.encode(JSON.stringify(signedEvent)));\n}\nasync function validateToken(token, url, method) {\n  const event = await unpackEventFromToken(token).catch((error) => {\n    throw error;\n  });\n  const valid = await validateEvent2(event, url, method).catch((error) => {\n    throw error;\n  });\n  return valid;\n}\nasync function unpackEventFromToken(token) {\n  if (!token) {\n    throw new Error(\"Missing token\");\n  }\n  token = token.replace(_authorizationScheme, \"\");\n  const eventB64 = utf8Decoder.decode(base643.decode(token));\n  if (!eventB64 || eventB64.length === 0 || !eventB64.startsWith(\"{\")) {\n    throw new Error(\"Invalid token\");\n  }\n  const event = JSON.parse(eventB64);\n  return event;\n}\nfunction validateEventTimestamp(event) {\n  if (!event.created_at) {\n    return false;\n  }\n  return Math.round(new Date().getTime() / 1e3) - event.created_at < 60;\n}\nfunction validateEventKind(event) {\n  return event.kind === HTTPAuth;\n}\nfunction validateEventUrlTag(event, url) {\n  const urlTag = event.tags.find((t) => t[0] === \"u\");\n  if (!urlTag) {\n    return false;\n  }\n  return urlTag.length > 0 && urlTag[1] === url;\n}\nfunction validateEventMethodTag(event, method) {\n  const methodTag = event.tags.find((t) => t[0] === \"method\");\n  if (!methodTag) {\n    return false;\n  }\n  return methodTag.length > 0 && methodTag[1].toLowerCase() === method.toLowerCase();\n}\nfunction hashPayload(payload) {\n  const hash = sha2564(utf8Encoder.encode(JSON.stringify(payload)));\n  return bytesToHex5(hash);\n}\nfunction validateEventPayloadTag(event, payload) {\n  const payloadTag = event.tags.find((t) => t[0] === \"payload\");\n  if (!payloadTag) {\n    return false;\n  }\n  const payloadHash = hashPayload(payload);\n  return payloadTag.length > 0 && payloadTag[1] === payloadHash;\n}\nasync function validateEvent2(event, url, method, body) {\n  if (!verifyEvent(event)) {\n    throw new Error(\"Invalid nostr event, signature invalid\");\n  }\n  if (!validateEventKind(event)) {\n    throw new Error(\"Invalid nostr event, kind invalid\");\n  }\n  if (!validateEventTimestamp(event)) {\n    throw new Error(\"Invalid nostr event, created_at timestamp invalid\");\n  }\n  if (!validateEventUrlTag(event, url)) {\n    throw new Error(\"Invalid nostr event, url tag invalid\");\n  }\n  if (!validateEventMethodTag(event, method)) {\n    throw new Error(\"Invalid nostr event, method tag invalid\");\n  }\n  if (Boolean(body) && typeof body === \"object\" && Object.keys(body).length > 0) {\n    if (!validateEventPayloadTag(event, body)) {\n      throw new Error(\"Invalid nostr event, payload tag does not match request body hash\");\n    }\n  }\n  return true;\n}\nexport {\n  Relay,\n  SimplePool,\n  finalizeEvent,\n  fakejson_exports as fj,\n  generateSecretKey,\n  getEventHash,\n  getFilterLimit,\n  getPublicKey,\n  kinds_exports as kinds,\n  matchFilter,\n  matchFilters,\n  mergeFilters,\n  nip04_exports as nip04,\n  nip05_exports as nip05,\n  nip10_exports as nip10,\n  nip11_exports as nip11,\n  nip13_exports as nip13,\n  nip17_exports as nip17,\n  nip18_exports as nip18,\n  nip19_exports as nip19,\n  nip21_exports as nip21,\n  nip25_exports as nip25,\n  nip27_exports as nip27,\n  nip28_exports as nip28,\n  nip30_exports as nip30,\n  nip39_exports as nip39,\n  nip42_exports as nip42,\n  nip44_exports as nip44,\n  nip47_exports as nip47,\n  nip54_exports as nip54,\n  nip57_exports as nip57,\n  nip59_exports as nip59,\n  nip98_exports as nip98,\n  parseReferences,\n  serializeEvent,\n  sortEvents,\n  utils_exports as utils,\n  validateEvent,\n  verifiedSymbol,\n  verifyEvent\n};\n","/**\n * Internal assertion helpers.\n * @module\n */\n/** Asserts something is positive integer. */\nfunction anumber(n) {\n    if (!Number.isSafeInteger(n) || n < 0)\n        throw new Error('positive integer expected, got ' + n);\n}\n/** Is number an Uint8Array? Copied from utils for perf. */\nfunction isBytes(a) {\n    return a instanceof Uint8Array || (ArrayBuffer.isView(a) && a.constructor.name === 'Uint8Array');\n}\n/** Asserts something is Uint8Array. */\nfunction abytes(b, ...lengths) {\n    if (!isBytes(b))\n        throw new Error('Uint8Array expected');\n    if (lengths.length > 0 && !lengths.includes(b.length))\n        throw new Error('Uint8Array expected of length ' + lengths + ', got length=' + b.length);\n}\n/** Asserts something is hash */\nfunction ahash(h) {\n    if (typeof h !== 'function' || typeof h.create !== 'function')\n        throw new Error('Hash should be wrapped by utils.wrapConstructor');\n    anumber(h.outputLen);\n    anumber(h.blockLen);\n}\n/** Asserts a hash instance has not been destroyed / finished */\nfunction aexists(instance, checkFinished = true) {\n    if (instance.destroyed)\n        throw new Error('Hash instance has been destroyed');\n    if (checkFinished && instance.finished)\n        throw new Error('Hash#digest() has already been called');\n}\n/** Asserts output is properly-sized byte array */\nfunction aoutput(out, instance) {\n    abytes(out);\n    const min = instance.outputLen;\n    if (out.length < min) {\n        throw new Error('digestInto() expects output buffer of length at least ' + min);\n    }\n}\nexport { anumber, abytes, ahash, aexists, aoutput };\n//# sourceMappingURL=_assert.js.map","export const crypto = typeof globalThis === 'object' && 'crypto' in globalThis ? globalThis.crypto : undefined;\n//# sourceMappingURL=crypto.js.map","/**\n * Utilities for hex, bytes, CSPRNG.\n * @module\n */\n/*! noble-hashes - MIT License (c) 2022 Paul Miller (paulmillr.com) */\n// We use WebCrypto aka globalThis.crypto, which exists in browsers and node.js 16+.\n// node.js versions earlier than v19 don't declare it in global scope.\n// For node.js, package.json#exports field mapping rewrites import\n// from `crypto` to `cryptoNode`, which imports native module.\n// Makes the utils un-importable in browsers without a bundler.\n// Once node.js 18 is deprecated (2025-04-30), we can just drop the import.\nimport { crypto } from '@noble/hashes/crypto';\nimport { abytes } from './_assert.js';\n// export { isBytes } from './_assert.js';\n// We can't reuse isBytes from _assert, because somehow this causes huge perf issues\nexport function isBytes(a) {\n    return a instanceof Uint8Array || (ArrayBuffer.isView(a) && a.constructor.name === 'Uint8Array');\n}\n// Cast array to different type\nexport function u8(arr) {\n    return new Uint8Array(arr.buffer, arr.byteOffset, arr.byteLength);\n}\nexport function u32(arr) {\n    return new Uint32Array(arr.buffer, arr.byteOffset, Math.floor(arr.byteLength / 4));\n}\n// Cast array to view\nexport function createView(arr) {\n    return new DataView(arr.buffer, arr.byteOffset, arr.byteLength);\n}\n/** The rotate right (circular right shift) operation for uint32 */\nexport function rotr(word, shift) {\n    return (word << (32 - shift)) | (word >>> shift);\n}\n/** The rotate left (circular left shift) operation for uint32 */\nexport function rotl(word, shift) {\n    return (word << shift) | ((word >>> (32 - shift)) >>> 0);\n}\n/** Is current platform little-endian? Most are. Big-Endian platform: IBM */\nexport const isLE = /* @__PURE__ */ (() => new Uint8Array(new Uint32Array([0x11223344]).buffer)[0] === 0x44)();\n// The byte swap operation for uint32\nexport function byteSwap(word) {\n    return (((word << 24) & 0xff000000) |\n        ((word << 8) & 0xff0000) |\n        ((word >>> 8) & 0xff00) |\n        ((word >>> 24) & 0xff));\n}\n/** Conditionally byte swap if on a big-endian platform */\nexport const byteSwapIfBE = isLE\n    ? (n) => n\n    : (n) => byteSwap(n);\n/** In place byte swap for Uint32Array */\nexport function byteSwap32(arr) {\n    for (let i = 0; i < arr.length; i++) {\n        arr[i] = byteSwap(arr[i]);\n    }\n}\n// Array where index 0xf0 (240) is mapped to string 'f0'\nconst hexes = /* @__PURE__ */ Array.from({ length: 256 }, (_, i) => i.toString(16).padStart(2, '0'));\n/**\n * Convert byte array to hex string.\n * @example bytesToHex(Uint8Array.from([0xca, 0xfe, 0x01, 0x23])) // 'cafe0123'\n */\nexport function bytesToHex(bytes) {\n    abytes(bytes);\n    // pre-caching improves the speed 6x\n    let hex = '';\n    for (let i = 0; i < bytes.length; i++) {\n        hex += hexes[bytes[i]];\n    }\n    return hex;\n}\n// We use optimized technique to convert hex string to byte array\nconst asciis = { _0: 48, _9: 57, A: 65, F: 70, a: 97, f: 102 };\nfunction asciiToBase16(ch) {\n    if (ch >= asciis._0 && ch <= asciis._9)\n        return ch - asciis._0; // '2' => 50-48\n    if (ch >= asciis.A && ch <= asciis.F)\n        return ch - (asciis.A - 10); // 'B' => 66-(65-10)\n    if (ch >= asciis.a && ch <= asciis.f)\n        return ch - (asciis.a - 10); // 'b' => 98-(97-10)\n    return;\n}\n/**\n * Convert hex string to byte array.\n * @example hexToBytes('cafe0123') // Uint8Array.from([0xca, 0xfe, 0x01, 0x23])\n */\nexport function hexToBytes(hex) {\n    if (typeof hex !== 'string')\n        throw new Error('hex string expected, got ' + typeof hex);\n    const hl = hex.length;\n    const al = hl / 2;\n    if (hl % 2)\n        throw new Error('hex string expected, got unpadded hex of length ' + hl);\n    const array = new Uint8Array(al);\n    for (let ai = 0, hi = 0; ai < al; ai++, hi += 2) {\n        const n1 = asciiToBase16(hex.charCodeAt(hi));\n        const n2 = asciiToBase16(hex.charCodeAt(hi + 1));\n        if (n1 === undefined || n2 === undefined) {\n            const char = hex[hi] + hex[hi + 1];\n            throw new Error('hex string expected, got non-hex character \"' + char + '\" at index ' + hi);\n        }\n        array[ai] = n1 * 16 + n2; // multiply first octet, e.g. 'a3' => 10*16+3 => 160 + 3 => 163\n    }\n    return array;\n}\n/**\n * There is no setImmediate in browser and setTimeout is slow.\n * Call of async fn will return Promise, which will be fullfiled only on\n * next scheduler queue processing step and this is exactly what we need.\n */\nexport const nextTick = async () => { };\n/** Returns control to thread each 'tick' ms to avoid blocking. */\nexport async function asyncLoop(iters, tick, cb) {\n    let ts = Date.now();\n    for (let i = 0; i < iters; i++) {\n        cb(i);\n        // Date.now() is not monotonic, so in case if clock goes backwards we return return control too\n        const diff = Date.now() - ts;\n        if (diff >= 0 && diff < tick)\n            continue;\n        await nextTick();\n        ts += diff;\n    }\n}\n/**\n * Convert JS string to byte array.\n * @example utf8ToBytes('abc') // new Uint8Array([97, 98, 99])\n */\nexport function utf8ToBytes(str) {\n    if (typeof str !== 'string')\n        throw new Error('utf8ToBytes expected string, got ' + typeof str);\n    return new Uint8Array(new TextEncoder().encode(str)); // https://bugzil.la/1681809\n}\n/**\n * Normalizes (non-hex) string or Uint8Array to Uint8Array.\n * Warning: when Uint8Array is passed, it would NOT get copied.\n * Keep in mind for future mutable operations.\n */\nexport function toBytes(data) {\n    if (typeof data === 'string')\n        data = utf8ToBytes(data);\n    abytes(data);\n    return data;\n}\n/**\n * Copies several Uint8Arrays into one.\n */\nexport function concatBytes(...arrays) {\n    let sum = 0;\n    for (let i = 0; i < arrays.length; i++) {\n        const a = arrays[i];\n        abytes(a);\n        sum += a.length;\n    }\n    const res = new Uint8Array(sum);\n    for (let i = 0, pad = 0; i < arrays.length; i++) {\n        const a = arrays[i];\n        res.set(a, pad);\n        pad += a.length;\n    }\n    return res;\n}\n/** For runtime check if class implements interface */\nexport class Hash {\n    // Safe version that clones internal state\n    clone() {\n        return this._cloneInto();\n    }\n}\nexport function checkOpts(defaults, opts) {\n    if (opts !== undefined && {}.toString.call(opts) !== '[object Object]')\n        throw new Error('Options should be object or undefined');\n    const merged = Object.assign(defaults, opts);\n    return merged;\n}\n/** Wraps hash function, creating an interface on top of it */\nexport function wrapConstructor(hashCons) {\n    const hashC = (msg) => hashCons().update(toBytes(msg)).digest();\n    const tmp = hashCons();\n    hashC.outputLen = tmp.outputLen;\n    hashC.blockLen = tmp.blockLen;\n    hashC.create = () => hashCons();\n    return hashC;\n}\nexport function wrapConstructorWithOpts(hashCons) {\n    const hashC = (msg, opts) => hashCons(opts).update(toBytes(msg)).digest();\n    const tmp = hashCons({});\n    hashC.outputLen = tmp.outputLen;\n    hashC.blockLen = tmp.blockLen;\n    hashC.create = (opts) => hashCons(opts);\n    return hashC;\n}\nexport function wrapXOFConstructorWithOpts(hashCons) {\n    const hashC = (msg, opts) => hashCons(opts).update(toBytes(msg)).digest();\n    const tmp = hashCons({});\n    hashC.outputLen = tmp.outputLen;\n    hashC.blockLen = tmp.blockLen;\n    hashC.create = (opts) => hashCons(opts);\n    return hashC;\n}\n/** Cryptographically secure PRNG. Uses internal OS-level `crypto.getRandomValues`. */\nexport function randomBytes(bytesLength = 32) {\n    if (crypto && typeof crypto.getRandomValues === 'function') {\n        return crypto.getRandomValues(new Uint8Array(bytesLength));\n    }\n    // Legacy Node.js compatibility\n    if (crypto && typeof crypto.randomBytes === 'function') {\n        return crypto.randomBytes(bytesLength);\n    }\n    throw new Error('crypto.getRandomValues must be defined');\n}\n//# sourceMappingURL=utils.js.map","/**\n * Internal Merkle-Damgard hash utils.\n * @module\n */\nimport { aexists, aoutput } from './_assert.js';\nimport { Hash, createView, toBytes } from './utils.js';\n/** Polyfill for Safari 14. https://caniuse.com/mdn-javascript_builtins_dataview_setbiguint64 */\nexport function setBigUint64(view, byteOffset, value, isLE) {\n    if (typeof view.setBigUint64 === 'function')\n        return view.setBigUint64(byteOffset, value, isLE);\n    const _32n = BigInt(32);\n    const _u32_max = BigInt(0xffffffff);\n    const wh = Number((value >> _32n) & _u32_max);\n    const wl = Number(value & _u32_max);\n    const h = isLE ? 4 : 0;\n    const l = isLE ? 0 : 4;\n    view.setUint32(byteOffset + h, wh, isLE);\n    view.setUint32(byteOffset + l, wl, isLE);\n}\n/** Choice: a ? b : c */\nexport function Chi(a, b, c) {\n    return (a & b) ^ (~a & c);\n}\n/** Majority function, true if any two inputs is true. */\nexport function Maj(a, b, c) {\n    return (a & b) ^ (a & c) ^ (b & c);\n}\n/**\n * Merkle-Damgard hash construction base class.\n * Could be used to create MD5, RIPEMD, SHA1, SHA2.\n */\nexport class HashMD extends Hash {\n    constructor(blockLen, outputLen, padOffset, isLE) {\n        super();\n        this.blockLen = blockLen;\n        this.outputLen = outputLen;\n        this.padOffset = padOffset;\n        this.isLE = isLE;\n        this.finished = false;\n        this.length = 0;\n        this.pos = 0;\n        this.destroyed = false;\n        this.buffer = new Uint8Array(blockLen);\n        this.view = createView(this.buffer);\n    }\n    update(data) {\n        aexists(this);\n        const { view, buffer, blockLen } = this;\n        data = toBytes(data);\n        const len = data.length;\n        for (let pos = 0; pos < len;) {\n            const take = Math.min(blockLen - this.pos, len - pos);\n            // Fast path: we have at least one block in input, cast it to view and process\n            if (take === blockLen) {\n                const dataView = createView(data);\n                for (; blockLen <= len - pos; pos += blockLen)\n                    this.process(dataView, pos);\n                continue;\n            }\n            buffer.set(data.subarray(pos, pos + take), this.pos);\n            this.pos += take;\n            pos += take;\n            if (this.pos === blockLen) {\n                this.process(view, 0);\n                this.pos = 0;\n            }\n        }\n        this.length += data.length;\n        this.roundClean();\n        return this;\n    }\n    digestInto(out) {\n        aexists(this);\n        aoutput(out, this);\n        this.finished = true;\n        // Padding\n        // We can avoid allocation of buffer for padding completely if it\n        // was previously not allocated here. But it won't change performance.\n        const { buffer, view, blockLen, isLE } = this;\n        let { pos } = this;\n        // append the bit '1' to the message\n        buffer[pos++] = 0b10000000;\n        this.buffer.subarray(pos).fill(0);\n        // we have less than padOffset left in buffer, so we cannot put length in\n        // current block, need process it and pad again\n        if (this.padOffset > blockLen - pos) {\n            this.process(view, 0);\n            pos = 0;\n        }\n        // Pad until full block byte with zeros\n        for (let i = pos; i < blockLen; i++)\n            buffer[i] = 0;\n        // Note: sha512 requires length to be 128bit integer, but length in JS will overflow before that\n        // You need to write around 2 exabytes (u64_max / 8 / (1024**6)) for this to happen.\n        // So we just write lowest 64 bits of that value.\n        setBigUint64(view, blockLen - 8, BigInt(this.length * 8), isLE);\n        this.process(view, 0);\n        const oview = createView(out);\n        const len = this.outputLen;\n        // NOTE: we do division by 4 later, which should be fused in single op with modulo by JIT\n        if (len % 4)\n            throw new Error('_sha2: outputLen should be aligned to 32bit');\n        const outLen = len / 4;\n        const state = this.get();\n        if (outLen > state.length)\n            throw new Error('_sha2: outputLen bigger than state');\n        for (let i = 0; i < outLen; i++)\n            oview.setUint32(4 * i, state[i], isLE);\n    }\n    digest() {\n        const { buffer, outputLen } = this;\n        this.digestInto(buffer);\n        const res = buffer.slice(0, outputLen);\n        this.destroy();\n        return res;\n    }\n    _cloneInto(to) {\n        to || (to = new this.constructor());\n        to.set(...this.get());\n        const { blockLen, buffer, length, finished, destroyed, pos } = this;\n        to.length = length;\n        to.pos = pos;\n        to.finished = finished;\n        to.destroyed = destroyed;\n        if (length % blockLen)\n            to.buffer.set(buffer);\n        return to;\n    }\n}\n//# sourceMappingURL=_md.js.map","/**\n * SHA2-256 a.k.a. sha256. In JS, it is the fastest hash, even faster than Blake3.\n *\n * To break sha256 using birthday attack, attackers need to try 2^128 hashes.\n * BTC network is doing 2^70 hashes/sec (2^95 hashes/year) as per 2025.\n *\n * Check out [FIPS 180-4](https://nvlpubs.nist.gov/nistpubs/FIPS/NIST.FIPS.180-4.pdf).\n * @module\n */\nimport { Chi, HashMD, Maj } from './_md.js';\nimport { rotr, wrapConstructor } from './utils.js';\n/** Round constants: first 32 bits of fractional parts of the cube roots of the first 64 primes 2..311). */\n// prettier-ignore\nconst SHA256_K = /* @__PURE__ */ new Uint32Array([\n    0x428a2f98, 0x71374491, 0xb5c0fbcf, 0xe9b5dba5, 0x3956c25b, 0x59f111f1, 0x923f82a4, 0xab1c5ed5,\n    0xd807aa98, 0x12835b01, 0x243185be, 0x550c7dc3, 0x72be5d74, 0x80deb1fe, 0x9bdc06a7, 0xc19bf174,\n    0xe49b69c1, 0xefbe4786, 0x0fc19dc6, 0x240ca1cc, 0x2de92c6f, 0x4a7484aa, 0x5cb0a9dc, 0x76f988da,\n    0x983e5152, 0xa831c66d, 0xb00327c8, 0xbf597fc7, 0xc6e00bf3, 0xd5a79147, 0x06ca6351, 0x14292967,\n    0x27b70a85, 0x2e1b2138, 0x4d2c6dfc, 0x53380d13, 0x650a7354, 0x766a0abb, 0x81c2c92e, 0x92722c85,\n    0xa2bfe8a1, 0xa81a664b, 0xc24b8b70, 0xc76c51a3, 0xd192e819, 0xd6990624, 0xf40e3585, 0x106aa070,\n    0x19a4c116, 0x1e376c08, 0x2748774c, 0x34b0bcb5, 0x391c0cb3, 0x4ed8aa4a, 0x5b9cca4f, 0x682e6ff3,\n    0x748f82ee, 0x78a5636f, 0x84c87814, 0x8cc70208, 0x90befffa, 0xa4506ceb, 0xbef9a3f7, 0xc67178f2\n]);\n/** Initial state: first 32 bits of fractional parts of the square roots of the first 8 primes 2..19. */\n// prettier-ignore\nconst SHA256_IV = /* @__PURE__ */ new Uint32Array([\n    0x6a09e667, 0xbb67ae85, 0x3c6ef372, 0xa54ff53a, 0x510e527f, 0x9b05688c, 0x1f83d9ab, 0x5be0cd19\n]);\n/**\n * Temporary buffer, not used to store anything between runs.\n * Named this way because it matches specification.\n */\nconst SHA256_W = /* @__PURE__ */ new Uint32Array(64);\nexport class SHA256 extends HashMD {\n    constructor() {\n        super(64, 32, 8, false);\n        // We cannot use array here since array allows indexing by variable\n        // which means optimizer/compiler cannot use registers.\n        this.A = SHA256_IV[0] | 0;\n        this.B = SHA256_IV[1] | 0;\n        this.C = SHA256_IV[2] | 0;\n        this.D = SHA256_IV[3] | 0;\n        this.E = SHA256_IV[4] | 0;\n        this.F = SHA256_IV[5] | 0;\n        this.G = SHA256_IV[6] | 0;\n        this.H = SHA256_IV[7] | 0;\n    }\n    get() {\n        const { A, B, C, D, E, F, G, H } = this;\n        return [A, B, C, D, E, F, G, H];\n    }\n    // prettier-ignore\n    set(A, B, C, D, E, F, G, H) {\n        this.A = A | 0;\n        this.B = B | 0;\n        this.C = C | 0;\n        this.D = D | 0;\n        this.E = E | 0;\n        this.F = F | 0;\n        this.G = G | 0;\n        this.H = H | 0;\n    }\n    process(view, offset) {\n        // Extend the first 16 words into the remaining 48 words w[16..63] of the message schedule array\n        for (let i = 0; i < 16; i++, offset += 4)\n            SHA256_W[i] = view.getUint32(offset, false);\n        for (let i = 16; i < 64; i++) {\n            const W15 = SHA256_W[i - 15];\n            const W2 = SHA256_W[i - 2];\n            const s0 = rotr(W15, 7) ^ rotr(W15, 18) ^ (W15 >>> 3);\n            const s1 = rotr(W2, 17) ^ rotr(W2, 19) ^ (W2 >>> 10);\n            SHA256_W[i] = (s1 + SHA256_W[i - 7] + s0 + SHA256_W[i - 16]) | 0;\n        }\n        // Compression function main loop, 64 rounds\n        let { A, B, C, D, E, F, G, H } = this;\n        for (let i = 0; i < 64; i++) {\n            const sigma1 = rotr(E, 6) ^ rotr(E, 11) ^ rotr(E, 25);\n            const T1 = (H + sigma1 + Chi(E, F, G) + SHA256_K[i] + SHA256_W[i]) | 0;\n            const sigma0 = rotr(A, 2) ^ rotr(A, 13) ^ rotr(A, 22);\n            const T2 = (sigma0 + Maj(A, B, C)) | 0;\n            H = G;\n            G = F;\n            F = E;\n            E = (D + T1) | 0;\n            D = C;\n            C = B;\n            B = A;\n            A = (T1 + T2) | 0;\n        }\n        // Add the compressed chunk to the current hash value\n        A = (A + this.A) | 0;\n        B = (B + this.B) | 0;\n        C = (C + this.C) | 0;\n        D = (D + this.D) | 0;\n        E = (E + this.E) | 0;\n        F = (F + this.F) | 0;\n        G = (G + this.G) | 0;\n        H = (H + this.H) | 0;\n        this.set(A, B, C, D, E, F, G, H);\n    }\n    roundClean() {\n        SHA256_W.fill(0);\n    }\n    destroy() {\n        this.set(0, 0, 0, 0, 0, 0, 0, 0);\n        this.buffer.fill(0);\n    }\n}\n/**\n * Constants taken from https://nvlpubs.nist.gov/nistpubs/FIPS/NIST.FIPS.180-4.pdf.\n */\nclass SHA224 extends SHA256 {\n    constructor() {\n        super();\n        this.A = 0xc1059ed8 | 0;\n        this.B = 0x367cd507 | 0;\n        this.C = 0x3070dd17 | 0;\n        this.D = 0xf70e5939 | 0;\n        this.E = 0xffc00b31 | 0;\n        this.F = 0x68581511 | 0;\n        this.G = 0x64f98fa7 | 0;\n        this.H = 0xbefa4fa4 | 0;\n        this.outputLen = 28;\n    }\n}\n/** SHA2-256 hash function */\nexport const sha256 = /* @__PURE__ */ wrapConstructor(() => new SHA256());\n/** SHA2-224 hash function */\nexport const sha224 = /* @__PURE__ */ wrapConstructor(() => new SHA224());\n//# sourceMappingURL=sha256.js.map","/**\n * HMAC: RFC2104 message authentication code.\n * @module\n */\nimport { abytes, aexists, ahash } from './_assert.js';\nimport { Hash, toBytes } from './utils.js';\nexport class HMAC extends Hash {\n    constructor(hash, _key) {\n        super();\n        this.finished = false;\n        this.destroyed = false;\n        ahash(hash);\n        const key = toBytes(_key);\n        this.iHash = hash.create();\n        if (typeof this.iHash.update !== 'function')\n            throw new Error('Expected instance of class which extends utils.Hash');\n        this.blockLen = this.iHash.blockLen;\n        this.outputLen = this.iHash.outputLen;\n        const blockLen = this.blockLen;\n        const pad = new Uint8Array(blockLen);\n        // blockLen can be bigger than outputLen\n        pad.set(key.length > blockLen ? hash.create().update(key).digest() : key);\n        for (let i = 0; i < pad.length; i++)\n            pad[i] ^= 0x36;\n        this.iHash.update(pad);\n        // By doing update (processing of first block) of outer hash here we can re-use it between multiple calls via clone\n        this.oHash = hash.create();\n        // Undo internal XOR && apply outer XOR\n        for (let i = 0; i < pad.length; i++)\n            pad[i] ^= 0x36 ^ 0x5c;\n        this.oHash.update(pad);\n        pad.fill(0);\n    }\n    update(buf) {\n        aexists(this);\n        this.iHash.update(buf);\n        return this;\n    }\n    digestInto(out) {\n        aexists(this);\n        abytes(out, this.outputLen);\n        this.finished = true;\n        this.iHash.digestInto(out);\n        this.oHash.update(out);\n        this.oHash.digestInto(out);\n        this.destroy();\n    }\n    digest() {\n        const out = new Uint8Array(this.oHash.outputLen);\n        this.digestInto(out);\n        return out;\n    }\n    _cloneInto(to) {\n        // Create new instance without calling constructor since key already in state and we don't know it.\n        to || (to = Object.create(Object.getPrototypeOf(this), {}));\n        const { oHash, iHash, finished, destroyed, blockLen, outputLen } = this;\n        to = to;\n        to.finished = finished;\n        to.destroyed = destroyed;\n        to.blockLen = blockLen;\n        to.outputLen = outputLen;\n        to.oHash = oHash._cloneInto(to.oHash);\n        to.iHash = iHash._cloneInto(to.iHash);\n        return to;\n    }\n    destroy() {\n        this.destroyed = true;\n        this.oHash.destroy();\n        this.iHash.destroy();\n    }\n}\n/**\n * HMAC: RFC2104 message authentication code.\n * @param hash - function that would be used e.g. sha256\n * @param key - message key\n * @param message - message data\n * @example\n * import { hmac } from '@noble/hashes/hmac';\n * import { sha256 } from '@noble/hashes/sha2';\n * const mac1 = hmac(sha256, 'key', 'message');\n */\nexport const hmac = (hash, key, message) => new HMAC(hash, key).update(message).digest();\nhmac.create = (hash, key) => new HMAC(hash, key);\n//# sourceMappingURL=hmac.js.map","/**\n * Hex, bytes and number utilities.\n * @module\n */\n/*! noble-curves - MIT License (c) 2022 Paul Miller (paulmillr.com) */\n// 100 lines of code in the file are duplicated from noble-hashes (utils).\n// This is OK: `abstract` directory does not use noble-hashes.\n// User may opt-in into using different hashing library. This way, noble-hashes\n// won't be included into their bundle.\nconst _0n = /* @__PURE__ */ BigInt(0);\nconst _1n = /* @__PURE__ */ BigInt(1);\nconst _2n = /* @__PURE__ */ BigInt(2);\nexport function isBytes(a) {\n    return a instanceof Uint8Array || (ArrayBuffer.isView(a) && a.constructor.name === 'Uint8Array');\n}\nexport function abytes(item) {\n    if (!isBytes(item))\n        throw new Error('Uint8Array expected');\n}\nexport function abool(title, value) {\n    if (typeof value !== 'boolean')\n        throw new Error(title + ' boolean expected, got ' + value);\n}\n// Array where index 0xf0 (240) is mapped to string 'f0'\nconst hexes = /* @__PURE__ */ Array.from({ length: 256 }, (_, i) => i.toString(16).padStart(2, '0'));\n/**\n * @example bytesToHex(Uint8Array.from([0xca, 0xfe, 0x01, 0x23])) // 'cafe0123'\n */\nexport function bytesToHex(bytes) {\n    abytes(bytes);\n    // pre-caching improves the speed 6x\n    let hex = '';\n    for (let i = 0; i < bytes.length; i++) {\n        hex += hexes[bytes[i]];\n    }\n    return hex;\n}\nexport function numberToHexUnpadded(num) {\n    const hex = num.toString(16);\n    return hex.length & 1 ? '0' + hex : hex;\n}\nexport function hexToNumber(hex) {\n    if (typeof hex !== 'string')\n        throw new Error('hex string expected, got ' + typeof hex);\n    return hex === '' ? _0n : BigInt('0x' + hex); // Big Endian\n}\n// We use optimized technique to convert hex string to byte array\nconst asciis = { _0: 48, _9: 57, A: 65, F: 70, a: 97, f: 102 };\nfunction asciiToBase16(ch) {\n    if (ch >= asciis._0 && ch <= asciis._9)\n        return ch - asciis._0; // '2' => 50-48\n    if (ch >= asciis.A && ch <= asciis.F)\n        return ch - (asciis.A - 10); // 'B' => 66-(65-10)\n    if (ch >= asciis.a && ch <= asciis.f)\n        return ch - (asciis.a - 10); // 'b' => 98-(97-10)\n    return;\n}\n/**\n * @example hexToBytes('cafe0123') // Uint8Array.from([0xca, 0xfe, 0x01, 0x23])\n */\nexport function hexToBytes(hex) {\n    if (typeof hex !== 'string')\n        throw new Error('hex string expected, got ' + typeof hex);\n    const hl = hex.length;\n    const al = hl / 2;\n    if (hl % 2)\n        throw new Error('hex string expected, got unpadded hex of length ' + hl);\n    const array = new Uint8Array(al);\n    for (let ai = 0, hi = 0; ai < al; ai++, hi += 2) {\n        const n1 = asciiToBase16(hex.charCodeAt(hi));\n        const n2 = asciiToBase16(hex.charCodeAt(hi + 1));\n        if (n1 === undefined || n2 === undefined) {\n            const char = hex[hi] + hex[hi + 1];\n            throw new Error('hex string expected, got non-hex character \"' + char + '\" at index ' + hi);\n        }\n        array[ai] = n1 * 16 + n2; // multiply first octet, e.g. 'a3' => 10*16+3 => 160 + 3 => 163\n    }\n    return array;\n}\n// BE: Big Endian, LE: Little Endian\nexport function bytesToNumberBE(bytes) {\n    return hexToNumber(bytesToHex(bytes));\n}\nexport function bytesToNumberLE(bytes) {\n    abytes(bytes);\n    return hexToNumber(bytesToHex(Uint8Array.from(bytes).reverse()));\n}\nexport function numberToBytesBE(n, len) {\n    return hexToBytes(n.toString(16).padStart(len * 2, '0'));\n}\nexport function numberToBytesLE(n, len) {\n    return numberToBytesBE(n, len).reverse();\n}\n// Unpadded, rarely used\nexport function numberToVarBytesBE(n) {\n    return hexToBytes(numberToHexUnpadded(n));\n}\n/**\n * Takes hex string or Uint8Array, converts to Uint8Array.\n * Validates output length.\n * Will throw error for other types.\n * @param title descriptive title for an error e.g. 'private key'\n * @param hex hex string or Uint8Array\n * @param expectedLength optional, will compare to result array's length\n * @returns\n */\nexport function ensureBytes(title, hex, expectedLength) {\n    let res;\n    if (typeof hex === 'string') {\n        try {\n            res = hexToBytes(hex);\n        }\n        catch (e) {\n            throw new Error(title + ' must be hex string or Uint8Array, cause: ' + e);\n        }\n    }\n    else if (isBytes(hex)) {\n        // Uint8Array.from() instead of hash.slice() because node.js Buffer\n        // is instance of Uint8Array, and its slice() creates **mutable** copy\n        res = Uint8Array.from(hex);\n    }\n    else {\n        throw new Error(title + ' must be hex string or Uint8Array');\n    }\n    const len = res.length;\n    if (typeof expectedLength === 'number' && len !== expectedLength)\n        throw new Error(title + ' of length ' + expectedLength + ' expected, got ' + len);\n    return res;\n}\n/**\n * Copies several Uint8Arrays into one.\n */\nexport function concatBytes(...arrays) {\n    let sum = 0;\n    for (let i = 0; i < arrays.length; i++) {\n        const a = arrays[i];\n        abytes(a);\n        sum += a.length;\n    }\n    const res = new Uint8Array(sum);\n    for (let i = 0, pad = 0; i < arrays.length; i++) {\n        const a = arrays[i];\n        res.set(a, pad);\n        pad += a.length;\n    }\n    return res;\n}\n// Compares 2 u8a-s in kinda constant time\nexport function equalBytes(a, b) {\n    if (a.length !== b.length)\n        return false;\n    let diff = 0;\n    for (let i = 0; i < a.length; i++)\n        diff |= a[i] ^ b[i];\n    return diff === 0;\n}\n/**\n * @example utf8ToBytes('abc') // new Uint8Array([97, 98, 99])\n */\nexport function utf8ToBytes(str) {\n    if (typeof str !== 'string')\n        throw new Error('string expected');\n    return new Uint8Array(new TextEncoder().encode(str)); // https://bugzil.la/1681809\n}\n// Is positive bigint\nconst isPosBig = (n) => typeof n === 'bigint' && _0n <= n;\nexport function inRange(n, min, max) {\n    return isPosBig(n) && isPosBig(min) && isPosBig(max) && min <= n && n < max;\n}\n/**\n * Asserts min <= n < max. NOTE: It's < max and not <= max.\n * @example\n * aInRange('x', x, 1n, 256n); // would assume x is in (1n..255n)\n */\nexport function aInRange(title, n, min, max) {\n    // Why min <= n < max and not a (min < n < max) OR b (min <= n <= max)?\n    // consider P=256n, min=0n, max=P\n    // - a for min=0 would require -1:          `inRange('x', x, -1n, P)`\n    // - b would commonly require subtraction:  `inRange('x', x, 0n, P - 1n)`\n    // - our way is the cleanest:               `inRange('x', x, 0n, P)\n    if (!inRange(n, min, max))\n        throw new Error('expected valid ' + title + ': ' + min + ' <= n < ' + max + ', got ' + n);\n}\n// Bit operations\n/**\n * Calculates amount of bits in a bigint.\n * Same as `n.toString(2).length`\n */\nexport function bitLen(n) {\n    let len;\n    for (len = 0; n > _0n; n >>= _1n, len += 1)\n        ;\n    return len;\n}\n/**\n * Gets single bit at position.\n * NOTE: first bit position is 0 (same as arrays)\n * Same as `!!+Array.from(n.toString(2)).reverse()[pos]`\n */\nexport function bitGet(n, pos) {\n    return (n >> BigInt(pos)) & _1n;\n}\n/**\n * Sets single bit at position.\n */\nexport function bitSet(n, pos, value) {\n    return n | ((value ? _1n : _0n) << BigInt(pos));\n}\n/**\n * Calculate mask for N bits. Not using ** operator with bigints because of old engines.\n * Same as BigInt(`0b${Array(i).fill('1').join('')}`)\n */\nexport const bitMask = (n) => (_2n << BigInt(n - 1)) - _1n;\n// DRBG\nconst u8n = (data) => new Uint8Array(data); // creates Uint8Array\nconst u8fr = (arr) => Uint8Array.from(arr); // another shortcut\n/**\n * Minimal HMAC-DRBG from NIST 800-90 for RFC6979 sigs.\n * @returns function that will call DRBG until 2nd arg returns something meaningful\n * @example\n *   const drbg = createHmacDRBG<Key>(32, 32, hmac);\n *   drbg(seed, bytesToKey); // bytesToKey must return Key or undefined\n */\nexport function createHmacDrbg(hashLen, qByteLen, hmacFn) {\n    if (typeof hashLen !== 'number' || hashLen < 2)\n        throw new Error('hashLen must be a number');\n    if (typeof qByteLen !== 'number' || qByteLen < 2)\n        throw new Error('qByteLen must be a number');\n    if (typeof hmacFn !== 'function')\n        throw new Error('hmacFn must be a function');\n    // Step B, Step C: set hashLen to 8*ceil(hlen/8)\n    let v = u8n(hashLen); // Minimal non-full-spec HMAC-DRBG from NIST 800-90 for RFC6979 sigs.\n    let k = u8n(hashLen); // Steps B and C of RFC6979 3.2: set hashLen, in our case always same\n    let i = 0; // Iterations counter, will throw when over 1000\n    const reset = () => {\n        v.fill(1);\n        k.fill(0);\n        i = 0;\n    };\n    const h = (...b) => hmacFn(k, v, ...b); // hmac(k)(v, ...values)\n    const reseed = (seed = u8n()) => {\n        // HMAC-DRBG reseed() function. Steps D-G\n        k = h(u8fr([0x00]), seed); // k = hmac(k || v || 0x00 || seed)\n        v = h(); // v = hmac(k || v)\n        if (seed.length === 0)\n            return;\n        k = h(u8fr([0x01]), seed); // k = hmac(k || v || 0x01 || seed)\n        v = h(); // v = hmac(k || v)\n    };\n    const gen = () => {\n        // HMAC-DRBG generate() function\n        if (i++ >= 1000)\n            throw new Error('drbg: tried 1000 values');\n        let len = 0;\n        const out = [];\n        while (len < qByteLen) {\n            v = h();\n            const sl = v.slice();\n            out.push(sl);\n            len += v.length;\n        }\n        return concatBytes(...out);\n    };\n    const genUntil = (seed, pred) => {\n        reset();\n        reseed(seed); // Steps D-G\n        let res = undefined; // Step H: grind until k is in [1..n-1]\n        while (!(res = pred(gen())))\n            reseed();\n        reset();\n        return res;\n    };\n    return genUntil;\n}\n// Validating curves and fields\nconst validatorFns = {\n    bigint: (val) => typeof val === 'bigint',\n    function: (val) => typeof val === 'function',\n    boolean: (val) => typeof val === 'boolean',\n    string: (val) => typeof val === 'string',\n    stringOrUint8Array: (val) => typeof val === 'string' || isBytes(val),\n    isSafeInteger: (val) => Number.isSafeInteger(val),\n    array: (val) => Array.isArray(val),\n    field: (val, object) => object.Fp.isValid(val),\n    hash: (val) => typeof val === 'function' && Number.isSafeInteger(val.outputLen),\n};\n// type Record<K extends string | number | symbol, T> = { [P in K]: T; }\nexport function validateObject(object, validators, optValidators = {}) {\n    const checkField = (fieldName, type, isOptional) => {\n        const checkVal = validatorFns[type];\n        if (typeof checkVal !== 'function')\n            throw new Error('invalid validator function');\n        const val = object[fieldName];\n        if (isOptional && val === undefined)\n            return;\n        if (!checkVal(val, object)) {\n            throw new Error('param ' + String(fieldName) + ' is invalid. Expected ' + type + ', got ' + val);\n        }\n    };\n    for (const [fieldName, type] of Object.entries(validators))\n        checkField(fieldName, type, false);\n    for (const [fieldName, type] of Object.entries(optValidators))\n        checkField(fieldName, type, true);\n    return object;\n}\n// validate type tests\n// const o: { a: number; b: number; c: number } = { a: 1, b: 5, c: 6 };\n// const z0 = validateObject(o, { a: 'isSafeInteger' }, { c: 'bigint' }); // Ok!\n// // Should fail type-check\n// const z1 = validateObject(o, { a: 'tmp' }, { c: 'zz' });\n// const z2 = validateObject(o, { a: 'isSafeInteger' }, { c: 'zz' });\n// const z3 = validateObject(o, { test: 'boolean', z: 'bug' });\n// const z4 = validateObject(o, { a: 'boolean', z: 'bug' });\n/**\n * throws not implemented error\n */\nexport const notImplemented = () => {\n    throw new Error('not implemented');\n};\n/**\n * Memoizes (caches) computation result.\n * Uses WeakMap: the value is going auto-cleaned by GC after last reference is removed.\n */\nexport function memoized(fn) {\n    const map = new WeakMap();\n    return (arg, ...args) => {\n        const val = map.get(arg);\n        if (val !== undefined)\n            return val;\n        const computed = fn(arg, ...args);\n        map.set(arg, computed);\n        return computed;\n    };\n}\n//# sourceMappingURL=utils.js.map","/**\n * Utils for modular division and finite fields.\n * A finite field over 11 is integer number operations `mod 11`.\n * There is no division: it is replaced by modular multiplicative inverse.\n * @module\n */\n/*! noble-curves - MIT License (c) 2022 Paul Miller (paulmillr.com) */\nimport { bitMask, bytesToNumberBE, bytesToNumberLE, ensureBytes, numberToBytesBE, numberToBytesLE, validateObject, } from './utils.js';\n// prettier-ignore\nconst _0n = BigInt(0), _1n = BigInt(1), _2n = /* @__PURE__ */ BigInt(2), _3n = /* @__PURE__ */ BigInt(3);\n// prettier-ignore\nconst _4n = /* @__PURE__ */ BigInt(4), _5n = /* @__PURE__ */ BigInt(5), _8n = /* @__PURE__ */ BigInt(8);\n// prettier-ignore\nconst _9n = /* @__PURE__ */ BigInt(9), _16n = /* @__PURE__ */ BigInt(16);\n// Calculates a modulo b\nexport function mod(a, b) {\n    const result = a % b;\n    return result >= _0n ? result : b + result;\n}\n/**\n * Efficiently raise num to power and do modular division.\n * Unsafe in some contexts: uses ladder, so can expose bigint bits.\n * @todo use field version && remove\n * @example\n * pow(2n, 6n, 11n) // 64n % 11n == 9n\n */\nexport function pow(num, power, modulo) {\n    if (power < _0n)\n        throw new Error('invalid exponent, negatives unsupported');\n    if (modulo <= _0n)\n        throw new Error('invalid modulus');\n    if (modulo === _1n)\n        return _0n;\n    let res = _1n;\n    while (power > _0n) {\n        if (power & _1n)\n            res = (res * num) % modulo;\n        num = (num * num) % modulo;\n        power >>= _1n;\n    }\n    return res;\n}\n/** Does `x^(2^power)` mod p. `pow2(30, 4)` == `30^(2^4)` */\nexport function pow2(x, power, modulo) {\n    let res = x;\n    while (power-- > _0n) {\n        res *= res;\n        res %= modulo;\n    }\n    return res;\n}\n/**\n * Inverses number over modulo.\n * Implemented using [Euclidean GCD](https://brilliant.org/wiki/extended-euclidean-algorithm/).\n */\nexport function invert(number, modulo) {\n    if (number === _0n)\n        throw new Error('invert: expected non-zero number');\n    if (modulo <= _0n)\n        throw new Error('invert: expected positive modulus, got ' + modulo);\n    // Fermat's little theorem \"CT-like\" version inv(n) = n^(m-2) mod m is 30x slower.\n    let a = mod(number, modulo);\n    let b = modulo;\n    // prettier-ignore\n    let x = _0n, y = _1n, u = _1n, v = _0n;\n    while (a !== _0n) {\n        // JIT applies optimization if those two lines follow each other\n        const q = b / a;\n        const r = b % a;\n        const m = x - u * q;\n        const n = y - v * q;\n        // prettier-ignore\n        b = a, a = r, x = u, y = v, u = m, v = n;\n    }\n    const gcd = b;\n    if (gcd !== _1n)\n        throw new Error('invert: does not exist');\n    return mod(x, modulo);\n}\n/**\n * Tonelli-Shanks square root search algorithm.\n * 1. https://eprint.iacr.org/2012/685.pdf (page 12)\n * 2. Square Roots from 1; 24, 51, 10 to Dan Shanks\n * Will start an infinite loop if field order P is not prime.\n * @param P field order\n * @returns function that takes field Fp (created from P) and number n\n */\nexport function tonelliShanks(P) {\n    // Legendre constant: used to calculate Legendre symbol (a | p),\n    // which denotes the value of a^((p-1)/2) (mod p).\n    // (a | p) ≡ 1    if a is a square (mod p)\n    // (a | p) ≡ -1   if a is not a square (mod p)\n    // (a | p) ≡ 0    if a ≡ 0 (mod p)\n    const legendreC = (P - _1n) / _2n;\n    let Q, S, Z;\n    // Step 1: By factoring out powers of 2 from p - 1,\n    // find q and s such that p - 1 = q*(2^s) with q odd\n    for (Q = P - _1n, S = 0; Q % _2n === _0n; Q /= _2n, S++)\n        ;\n    // Step 2: Select a non-square z such that (z | p) ≡ -1 and set c ≡ zq\n    for (Z = _2n; Z < P && pow(Z, legendreC, P) !== P - _1n; Z++) {\n        // Crash instead of infinity loop, we cannot reasonable count until P.\n        if (Z > 1000)\n            throw new Error('Cannot find square root: likely non-prime P');\n    }\n    // Fast-path\n    if (S === 1) {\n        const p1div4 = (P + _1n) / _4n;\n        return function tonelliFast(Fp, n) {\n            const root = Fp.pow(n, p1div4);\n            if (!Fp.eql(Fp.sqr(root), n))\n                throw new Error('Cannot find square root');\n            return root;\n        };\n    }\n    // Slow-path\n    const Q1div2 = (Q + _1n) / _2n;\n    return function tonelliSlow(Fp, n) {\n        // Step 0: Check that n is indeed a square: (n | p) should not be ≡ -1\n        if (Fp.pow(n, legendreC) === Fp.neg(Fp.ONE))\n            throw new Error('Cannot find square root');\n        let r = S;\n        // TODO: will fail at Fp2/etc\n        let g = Fp.pow(Fp.mul(Fp.ONE, Z), Q); // will update both x and b\n        let x = Fp.pow(n, Q1div2); // first guess at the square root\n        let b = Fp.pow(n, Q); // first guess at the fudge factor\n        while (!Fp.eql(b, Fp.ONE)) {\n            if (Fp.eql(b, Fp.ZERO))\n                return Fp.ZERO; // https://en.wikipedia.org/wiki/Tonelli%E2%80%93Shanks_algorithm (4. If t = 0, return r = 0)\n            // Find m such b^(2^m)==1\n            let m = 1;\n            for (let t2 = Fp.sqr(b); m < r; m++) {\n                if (Fp.eql(t2, Fp.ONE))\n                    break;\n                t2 = Fp.sqr(t2); // t2 *= t2\n            }\n            // NOTE: r-m-1 can be bigger than 32, need to convert to bigint before shift, otherwise there will be overflow\n            const ge = Fp.pow(g, _1n << BigInt(r - m - 1)); // ge = 2^(r-m-1)\n            g = Fp.sqr(ge); // g = ge * ge\n            x = Fp.mul(x, ge); // x *= ge\n            b = Fp.mul(b, g); // b *= g\n            r = m;\n        }\n        return x;\n    };\n}\n/**\n * Square root for a finite field. It will try to check if optimizations are applicable and fall back to 4:\n *\n * 1. P ≡ 3 (mod 4)\n * 2. P ≡ 5 (mod 8)\n * 3. P ≡ 9 (mod 16)\n * 4. Tonelli-Shanks algorithm\n *\n * Different algorithms can give different roots, it is up to user to decide which one they want.\n * For example there is FpSqrtOdd/FpSqrtEven to choice root based on oddness (used for hash-to-curve).\n */\nexport function FpSqrt(P) {\n    // P ≡ 3 (mod 4)\n    // √n = n^((P+1)/4)\n    if (P % _4n === _3n) {\n        // Not all roots possible!\n        // const ORDER =\n        //   0x1a0111ea397fe69a4b1ba7b6434bacd764774b84f38512bf6730d2a0f6b0f6241eabfffeb153ffffb9feffffffffaaabn;\n        // const NUM = 72057594037927816n;\n        const p1div4 = (P + _1n) / _4n;\n        return function sqrt3mod4(Fp, n) {\n            const root = Fp.pow(n, p1div4);\n            // Throw if root**2 != n\n            if (!Fp.eql(Fp.sqr(root), n))\n                throw new Error('Cannot find square root');\n            return root;\n        };\n    }\n    // Atkin algorithm for q ≡ 5 (mod 8), https://eprint.iacr.org/2012/685.pdf (page 10)\n    if (P % _8n === _5n) {\n        const c1 = (P - _5n) / _8n;\n        return function sqrt5mod8(Fp, n) {\n            const n2 = Fp.mul(n, _2n);\n            const v = Fp.pow(n2, c1);\n            const nv = Fp.mul(n, v);\n            const i = Fp.mul(Fp.mul(nv, _2n), v);\n            const root = Fp.mul(nv, Fp.sub(i, Fp.ONE));\n            if (!Fp.eql(Fp.sqr(root), n))\n                throw new Error('Cannot find square root');\n            return root;\n        };\n    }\n    // P ≡ 9 (mod 16)\n    if (P % _16n === _9n) {\n        // NOTE: tonelli is too slow for bls-Fp2 calculations even on start\n        // Means we cannot use sqrt for constants at all!\n        //\n        // const c1 = Fp.sqrt(Fp.negate(Fp.ONE)); //  1. c1 = sqrt(-1) in F, i.e., (c1^2) == -1 in F\n        // const c2 = Fp.sqrt(c1);                //  2. c2 = sqrt(c1) in F, i.e., (c2^2) == c1 in F\n        // const c3 = Fp.sqrt(Fp.negate(c1));     //  3. c3 = sqrt(-c1) in F, i.e., (c3^2) == -c1 in F\n        // const c4 = (P + _7n) / _16n;           //  4. c4 = (q + 7) / 16        # Integer arithmetic\n        // sqrt = (x) => {\n        //   let tv1 = Fp.pow(x, c4);             //  1. tv1 = x^c4\n        //   let tv2 = Fp.mul(c1, tv1);           //  2. tv2 = c1 * tv1\n        //   const tv3 = Fp.mul(c2, tv1);         //  3. tv3 = c2 * tv1\n        //   let tv4 = Fp.mul(c3, tv1);           //  4. tv4 = c3 * tv1\n        //   const e1 = Fp.equals(Fp.square(tv2), x); //  5.  e1 = (tv2^2) == x\n        //   const e2 = Fp.equals(Fp.square(tv3), x); //  6.  e2 = (tv3^2) == x\n        //   tv1 = Fp.cmov(tv1, tv2, e1); //  7. tv1 = CMOV(tv1, tv2, e1)  # Select tv2 if (tv2^2) == x\n        //   tv2 = Fp.cmov(tv4, tv3, e2); //  8. tv2 = CMOV(tv4, tv3, e2)  # Select tv3 if (tv3^2) == x\n        //   const e3 = Fp.equals(Fp.square(tv2), x); //  9.  e3 = (tv2^2) == x\n        //   return Fp.cmov(tv1, tv2, e3); //  10.  z = CMOV(tv1, tv2, e3)  # Select the sqrt from tv1 and tv2\n        // }\n    }\n    // Other cases: Tonelli-Shanks algorithm\n    return tonelliShanks(P);\n}\n// Little-endian check for first LE bit (last BE bit);\nexport const isNegativeLE = (num, modulo) => (mod(num, modulo) & _1n) === _1n;\n// prettier-ignore\nconst FIELD_FIELDS = [\n    'create', 'isValid', 'is0', 'neg', 'inv', 'sqrt', 'sqr',\n    'eql', 'add', 'sub', 'mul', 'pow', 'div',\n    'addN', 'subN', 'mulN', 'sqrN'\n];\nexport function validateField(field) {\n    const initial = {\n        ORDER: 'bigint',\n        MASK: 'bigint',\n        BYTES: 'isSafeInteger',\n        BITS: 'isSafeInteger',\n    };\n    const opts = FIELD_FIELDS.reduce((map, val) => {\n        map[val] = 'function';\n        return map;\n    }, initial);\n    return validateObject(field, opts);\n}\n// Generic field functions\n/**\n * Same as `pow` but for Fp: non-constant-time.\n * Unsafe in some contexts: uses ladder, so can expose bigint bits.\n */\nexport function FpPow(f, num, power) {\n    // Should have same speed as pow for bigints\n    // TODO: benchmark!\n    if (power < _0n)\n        throw new Error('invalid exponent, negatives unsupported');\n    if (power === _0n)\n        return f.ONE;\n    if (power === _1n)\n        return num;\n    let p = f.ONE;\n    let d = num;\n    while (power > _0n) {\n        if (power & _1n)\n            p = f.mul(p, d);\n        d = f.sqr(d);\n        power >>= _1n;\n    }\n    return p;\n}\n/**\n * Efficiently invert an array of Field elements.\n * `inv(0)` will return `undefined` here: make sure to throw an error.\n */\nexport function FpInvertBatch(f, nums) {\n    const tmp = new Array(nums.length);\n    // Walk from first to last, multiply them by each other MOD p\n    const lastMultiplied = nums.reduce((acc, num, i) => {\n        if (f.is0(num))\n            return acc;\n        tmp[i] = acc;\n        return f.mul(acc, num);\n    }, f.ONE);\n    // Invert last element\n    const inverted = f.inv(lastMultiplied);\n    // Walk from last to first, multiply them by inverted each other MOD p\n    nums.reduceRight((acc, num, i) => {\n        if (f.is0(num))\n            return acc;\n        tmp[i] = f.mul(acc, tmp[i]);\n        return f.mul(acc, num);\n    }, inverted);\n    return tmp;\n}\nexport function FpDiv(f, lhs, rhs) {\n    return f.mul(lhs, typeof rhs === 'bigint' ? invert(rhs, f.ORDER) : f.inv(rhs));\n}\n/**\n * Legendre symbol.\n * * (a | p) ≡ 1    if a is a square (mod p), quadratic residue\n * * (a | p) ≡ -1   if a is not a square (mod p), quadratic non residue\n * * (a | p) ≡ 0    if a ≡ 0 (mod p)\n */\nexport function FpLegendre(order) {\n    const legendreConst = (order - _1n) / _2n; // Integer arithmetic\n    return (f, x) => f.pow(x, legendreConst);\n}\n// This function returns True whenever the value x is a square in the field F.\nexport function FpIsSquare(f) {\n    const legendre = FpLegendre(f.ORDER);\n    return (x) => {\n        const p = legendre(f, x);\n        return f.eql(p, f.ZERO) || f.eql(p, f.ONE);\n    };\n}\n// CURVE.n lengths\nexport function nLength(n, nBitLength) {\n    // Bit size, byte size of CURVE.n\n    const _nBitLength = nBitLength !== undefined ? nBitLength : n.toString(2).length;\n    const nByteLength = Math.ceil(_nBitLength / 8);\n    return { nBitLength: _nBitLength, nByteLength };\n}\n/**\n * Initializes a finite field over prime.\n * Major performance optimizations:\n * * a) denormalized operations like mulN instead of mul\n * * b) same object shape: never add or remove keys\n * * c) Object.freeze\n * Fragile: always run a benchmark on a change.\n * Security note: operations don't check 'isValid' for all elements for performance reasons,\n * it is caller responsibility to check this.\n * This is low-level code, please make sure you know what you're doing.\n * @param ORDER prime positive bigint\n * @param bitLen how many bits the field consumes\n * @param isLE (def: false) if encoding / decoding should be in little-endian\n * @param redef optional faster redefinitions of sqrt and other methods\n */\nexport function Field(ORDER, bitLen, isLE = false, redef = {}) {\n    if (ORDER <= _0n)\n        throw new Error('invalid field: expected ORDER > 0, got ' + ORDER);\n    const { nBitLength: BITS, nByteLength: BYTES } = nLength(ORDER, bitLen);\n    if (BYTES > 2048)\n        throw new Error('invalid field: expected ORDER of <= 2048 bytes');\n    let sqrtP; // cached sqrtP\n    const f = Object.freeze({\n        ORDER,\n        isLE,\n        BITS,\n        BYTES,\n        MASK: bitMask(BITS),\n        ZERO: _0n,\n        ONE: _1n,\n        create: (num) => mod(num, ORDER),\n        isValid: (num) => {\n            if (typeof num !== 'bigint')\n                throw new Error('invalid field element: expected bigint, got ' + typeof num);\n            return _0n <= num && num < ORDER; // 0 is valid element, but it's not invertible\n        },\n        is0: (num) => num === _0n,\n        isOdd: (num) => (num & _1n) === _1n,\n        neg: (num) => mod(-num, ORDER),\n        eql: (lhs, rhs) => lhs === rhs,\n        sqr: (num) => mod(num * num, ORDER),\n        add: (lhs, rhs) => mod(lhs + rhs, ORDER),\n        sub: (lhs, rhs) => mod(lhs - rhs, ORDER),\n        mul: (lhs, rhs) => mod(lhs * rhs, ORDER),\n        pow: (num, power) => FpPow(f, num, power),\n        div: (lhs, rhs) => mod(lhs * invert(rhs, ORDER), ORDER),\n        // Same as above, but doesn't normalize\n        sqrN: (num) => num * num,\n        addN: (lhs, rhs) => lhs + rhs,\n        subN: (lhs, rhs) => lhs - rhs,\n        mulN: (lhs, rhs) => lhs * rhs,\n        inv: (num) => invert(num, ORDER),\n        sqrt: redef.sqrt ||\n            ((n) => {\n                if (!sqrtP)\n                    sqrtP = FpSqrt(ORDER);\n                return sqrtP(f, n);\n            }),\n        invertBatch: (lst) => FpInvertBatch(f, lst),\n        // TODO: do we really need constant cmov?\n        // We don't have const-time bigints anyway, so probably will be not very useful\n        cmov: (a, b, c) => (c ? b : a),\n        toBytes: (num) => (isLE ? numberToBytesLE(num, BYTES) : numberToBytesBE(num, BYTES)),\n        fromBytes: (bytes) => {\n            if (bytes.length !== BYTES)\n                throw new Error('Field.fromBytes: expected ' + BYTES + ' bytes, got ' + bytes.length);\n            return isLE ? bytesToNumberLE(bytes) : bytesToNumberBE(bytes);\n        },\n    });\n    return Object.freeze(f);\n}\nexport function FpSqrtOdd(Fp, elm) {\n    if (!Fp.isOdd)\n        throw new Error(\"Field doesn't have isOdd\");\n    const root = Fp.sqrt(elm);\n    return Fp.isOdd(root) ? root : Fp.neg(root);\n}\nexport function FpSqrtEven(Fp, elm) {\n    if (!Fp.isOdd)\n        throw new Error(\"Field doesn't have isOdd\");\n    const root = Fp.sqrt(elm);\n    return Fp.isOdd(root) ? Fp.neg(root) : root;\n}\n/**\n * \"Constant-time\" private key generation utility.\n * Same as mapKeyToField, but accepts less bytes (40 instead of 48 for 32-byte field).\n * Which makes it slightly more biased, less secure.\n * @deprecated use `mapKeyToField` instead\n */\nexport function hashToPrivateScalar(hash, groupOrder, isLE = false) {\n    hash = ensureBytes('privateHash', hash);\n    const hashLen = hash.length;\n    const minLen = nLength(groupOrder).nByteLength + 8;\n    if (minLen < 24 || hashLen < minLen || hashLen > 1024)\n        throw new Error('hashToPrivateScalar: expected ' + minLen + '-1024 bytes of input, got ' + hashLen);\n    const num = isLE ? bytesToNumberLE(hash) : bytesToNumberBE(hash);\n    return mod(num, groupOrder - _1n) + _1n;\n}\n/**\n * Returns total number of bytes consumed by the field element.\n * For example, 32 bytes for usual 256-bit weierstrass curve.\n * @param fieldOrder number of field elements, usually CURVE.n\n * @returns byte length of field\n */\nexport function getFieldBytesLength(fieldOrder) {\n    if (typeof fieldOrder !== 'bigint')\n        throw new Error('field order must be bigint');\n    const bitLength = fieldOrder.toString(2).length;\n    return Math.ceil(bitLength / 8);\n}\n/**\n * Returns minimal amount of bytes that can be safely reduced\n * by field order.\n * Should be 2^-128 for 128-bit curve such as P256.\n * @param fieldOrder number of field elements, usually CURVE.n\n * @returns byte length of target hash\n */\nexport function getMinHashLength(fieldOrder) {\n    const length = getFieldBytesLength(fieldOrder);\n    return length + Math.ceil(length / 2);\n}\n/**\n * \"Constant-time\" private key generation utility.\n * Can take (n + n/2) or more bytes of uniform input e.g. from CSPRNG or KDF\n * and convert them into private scalar, with the modulo bias being negligible.\n * Needs at least 48 bytes of input for 32-byte private key.\n * https://research.kudelskisecurity.com/2020/07/28/the-definitive-guide-to-modulo-bias-and-how-to-avoid-it/\n * FIPS 186-5, A.2 https://csrc.nist.gov/publications/detail/fips/186/5/final\n * RFC 9380, https://www.rfc-editor.org/rfc/rfc9380#section-5\n * @param hash hash output from SHA3 or a similar function\n * @param groupOrder size of subgroup - (e.g. secp256k1.CURVE.n)\n * @param isLE interpret hash bytes as LE num\n * @returns valid private scalar\n */\nexport function mapHashToField(key, fieldOrder, isLE = false) {\n    const len = key.length;\n    const fieldLen = getFieldBytesLength(fieldOrder);\n    const minLen = getMinHashLength(fieldOrder);\n    // No small numbers: need to understand bias story. No huge numbers: easier to detect JS timings.\n    if (len < 16 || len < minLen || len > 1024)\n        throw new Error('expected ' + minLen + '-1024 bytes of input, got ' + len);\n    const num = isLE ? bytesToNumberLE(key) : bytesToNumberBE(key);\n    // `mod(x, 11)` can sometimes produce 0. `mod(x, 10) + 1` is the same, but no 0\n    const reduced = mod(num, fieldOrder - _1n) + _1n;\n    return isLE ? numberToBytesLE(reduced, fieldLen) : numberToBytesBE(reduced, fieldLen);\n}\n//# sourceMappingURL=modular.js.map","/**\n * Methods for elliptic curve multiplication by scalars.\n * Contains wNAF, pippenger\n * @module\n */\n/*! noble-curves - MIT License (c) 2022 Paul Miller (paulmillr.com) */\nimport { nLength, validateField } from './modular.js';\nimport { bitLen, validateObject } from './utils.js';\nconst _0n = BigInt(0);\nconst _1n = BigInt(1);\nfunction constTimeNegate(condition, item) {\n    const neg = item.negate();\n    return condition ? neg : item;\n}\nfunction validateW(W, bits) {\n    if (!Number.isSafeInteger(W) || W <= 0 || W > bits)\n        throw new Error('invalid window size, expected [1..' + bits + '], got W=' + W);\n}\nfunction calcWOpts(W, bits) {\n    validateW(W, bits);\n    const windows = Math.ceil(bits / W) + 1; // +1, because\n    const windowSize = 2 ** (W - 1); // -1 because we skip zero\n    return { windows, windowSize };\n}\nfunction validateMSMPoints(points, c) {\n    if (!Array.isArray(points))\n        throw new Error('array expected');\n    points.forEach((p, i) => {\n        if (!(p instanceof c))\n            throw new Error('invalid point at index ' + i);\n    });\n}\nfunction validateMSMScalars(scalars, field) {\n    if (!Array.isArray(scalars))\n        throw new Error('array of scalars expected');\n    scalars.forEach((s, i) => {\n        if (!field.isValid(s))\n            throw new Error('invalid scalar at index ' + i);\n    });\n}\n// Since points in different groups cannot be equal (different object constructor),\n// we can have single place to store precomputes\nconst pointPrecomputes = new WeakMap();\nconst pointWindowSizes = new WeakMap(); // This allows use make points immutable (nothing changes inside)\nfunction getW(P) {\n    return pointWindowSizes.get(P) || 1;\n}\n/**\n * Elliptic curve multiplication of Point by scalar. Fragile.\n * Scalars should always be less than curve order: this should be checked inside of a curve itself.\n * Creates precomputation tables for fast multiplication:\n * - private scalar is split by fixed size windows of W bits\n * - every window point is collected from window's table & added to accumulator\n * - since windows are different, same point inside tables won't be accessed more than once per calc\n * - each multiplication is 'Math.ceil(CURVE_ORDER / 𝑊) + 1' point additions (fixed for any scalar)\n * - +1 window is neccessary for wNAF\n * - wNAF reduces table size: 2x less memory + 2x faster generation, but 10% slower multiplication\n *\n * @todo Research returning 2d JS array of windows, instead of a single window.\n * This would allow windows to be in different memory locations\n */\nexport function wNAF(c, bits) {\n    return {\n        constTimeNegate,\n        hasPrecomputes(elm) {\n            return getW(elm) !== 1;\n        },\n        // non-const time multiplication ladder\n        unsafeLadder(elm, n, p = c.ZERO) {\n            let d = elm;\n            while (n > _0n) {\n                if (n & _1n)\n                    p = p.add(d);\n                d = d.double();\n                n >>= _1n;\n            }\n            return p;\n        },\n        /**\n         * Creates a wNAF precomputation window. Used for caching.\n         * Default window size is set by `utils.precompute()` and is equal to 8.\n         * Number of precomputed points depends on the curve size:\n         * 2^(𝑊−1) * (Math.ceil(𝑛 / 𝑊) + 1), where:\n         * - 𝑊 is the window size\n         * - 𝑛 is the bitlength of the curve order.\n         * For a 256-bit curve and window size 8, the number of precomputed points is 128 * 33 = 4224.\n         * @param elm Point instance\n         * @param W window size\n         * @returns precomputed point tables flattened to a single array\n         */\n        precomputeWindow(elm, W) {\n            const { windows, windowSize } = calcWOpts(W, bits);\n            const points = [];\n            let p = elm;\n            let base = p;\n            for (let window = 0; window < windows; window++) {\n                base = p;\n                points.push(base);\n                // =1, because we skip zero\n                for (let i = 1; i < windowSize; i++) {\n                    base = base.add(p);\n                    points.push(base);\n                }\n                p = base.double();\n            }\n            return points;\n        },\n        /**\n         * Implements ec multiplication using precomputed tables and w-ary non-adjacent form.\n         * @param W window size\n         * @param precomputes precomputed tables\n         * @param n scalar (we don't check here, but should be less than curve order)\n         * @returns real and fake (for const-time) points\n         */\n        wNAF(W, precomputes, n) {\n            // TODO: maybe check that scalar is less than group order? wNAF behavious is undefined otherwise\n            // But need to carefully remove other checks before wNAF. ORDER == bits here\n            const { windows, windowSize } = calcWOpts(W, bits);\n            let p = c.ZERO;\n            let f = c.BASE;\n            const mask = BigInt(2 ** W - 1); // Create mask with W ones: 0b1111 for W=4 etc.\n            const maxNumber = 2 ** W;\n            const shiftBy = BigInt(W);\n            for (let window = 0; window < windows; window++) {\n                const offset = window * windowSize;\n                // Extract W bits.\n                let wbits = Number(n & mask);\n                // Shift number by W bits.\n                n >>= shiftBy;\n                // If the bits are bigger than max size, we'll split those.\n                // +224 => 256 - 32\n                if (wbits > windowSize) {\n                    wbits -= maxNumber;\n                    n += _1n;\n                }\n                // This code was first written with assumption that 'f' and 'p' will never be infinity point:\n                // since each addition is multiplied by 2 ** W, it cannot cancel each other. However,\n                // there is negate now: it is possible that negated element from low value\n                // would be the same as high element, which will create carry into next window.\n                // It's not obvious how this can fail, but still worth investigating later.\n                // Check if we're onto Zero point.\n                // Add random point inside current window to f.\n                const offset1 = offset;\n                const offset2 = offset + Math.abs(wbits) - 1; // -1 because we skip zero\n                const cond1 = window % 2 !== 0;\n                const cond2 = wbits < 0;\n                if (wbits === 0) {\n                    // The most important part for const-time getPublicKey\n                    f = f.add(constTimeNegate(cond1, precomputes[offset1]));\n                }\n                else {\n                    p = p.add(constTimeNegate(cond2, precomputes[offset2]));\n                }\n            }\n            // JIT-compiler should not eliminate f here, since it will later be used in normalizeZ()\n            // Even if the variable is still unused, there are some checks which will\n            // throw an exception, so compiler needs to prove they won't happen, which is hard.\n            // At this point there is a way to F be infinity-point even if p is not,\n            // which makes it less const-time: around 1 bigint multiply.\n            return { p, f };\n        },\n        /**\n         * Implements ec unsafe (non const-time) multiplication using precomputed tables and w-ary non-adjacent form.\n         * @param W window size\n         * @param precomputes precomputed tables\n         * @param n scalar (we don't check here, but should be less than curve order)\n         * @param acc accumulator point to add result of multiplication\n         * @returns point\n         */\n        wNAFUnsafe(W, precomputes, n, acc = c.ZERO) {\n            const { windows, windowSize } = calcWOpts(W, bits);\n            const mask = BigInt(2 ** W - 1); // Create mask with W ones: 0b1111 for W=4 etc.\n            const maxNumber = 2 ** W;\n            const shiftBy = BigInt(W);\n            for (let window = 0; window < windows; window++) {\n                const offset = window * windowSize;\n                if (n === _0n)\n                    break; // No need to go over empty scalar\n                // Extract W bits.\n                let wbits = Number(n & mask);\n                // Shift number by W bits.\n                n >>= shiftBy;\n                // If the bits are bigger than max size, we'll split those.\n                // +224 => 256 - 32\n                if (wbits > windowSize) {\n                    wbits -= maxNumber;\n                    n += _1n;\n                }\n                if (wbits === 0)\n                    continue;\n                let curr = precomputes[offset + Math.abs(wbits) - 1]; // -1 because we skip zero\n                if (wbits < 0)\n                    curr = curr.negate();\n                // NOTE: by re-using acc, we can save a lot of additions in case of MSM\n                acc = acc.add(curr);\n            }\n            return acc;\n        },\n        getPrecomputes(W, P, transform) {\n            // Calculate precomputes on a first run, reuse them after\n            let comp = pointPrecomputes.get(P);\n            if (!comp) {\n                comp = this.precomputeWindow(P, W);\n                if (W !== 1)\n                    pointPrecomputes.set(P, transform(comp));\n            }\n            return comp;\n        },\n        wNAFCached(P, n, transform) {\n            const W = getW(P);\n            return this.wNAF(W, this.getPrecomputes(W, P, transform), n);\n        },\n        wNAFCachedUnsafe(P, n, transform, prev) {\n            const W = getW(P);\n            if (W === 1)\n                return this.unsafeLadder(P, n, prev); // For W=1 ladder is ~x2 faster\n            return this.wNAFUnsafe(W, this.getPrecomputes(W, P, transform), n, prev);\n        },\n        // We calculate precomputes for elliptic curve point multiplication\n        // using windowed method. This specifies window size and\n        // stores precomputed values. Usually only base point would be precomputed.\n        setWindowSize(P, W) {\n            validateW(W, bits);\n            pointWindowSizes.set(P, W);\n            pointPrecomputes.delete(P);\n        },\n    };\n}\n/**\n * Pippenger algorithm for multi-scalar multiplication (MSM, Pa + Qb + Rc + ...).\n * 30x faster vs naive addition on L=4096, 10x faster with precomputes.\n * For N=254bit, L=1, it does: 1024 ADD + 254 DBL. For L=5: 1536 ADD + 254 DBL.\n * Algorithmically constant-time (for same L), even when 1 point + scalar, or when scalar = 0.\n * @param c Curve Point constructor\n * @param fieldN field over CURVE.N - important that it's not over CURVE.P\n * @param points array of L curve points\n * @param scalars array of L scalars (aka private keys / bigints)\n */\nexport function pippenger(c, fieldN, points, scalars) {\n    // If we split scalars by some window (let's say 8 bits), every chunk will only\n    // take 256 buckets even if there are 4096 scalars, also re-uses double.\n    // TODO:\n    // - https://eprint.iacr.org/2024/750.pdf\n    // - https://tches.iacr.org/index.php/TCHES/article/view/10287\n    // 0 is accepted in scalars\n    validateMSMPoints(points, c);\n    validateMSMScalars(scalars, fieldN);\n    if (points.length !== scalars.length)\n        throw new Error('arrays of points and scalars must have equal length');\n    const zero = c.ZERO;\n    const wbits = bitLen(BigInt(points.length));\n    const windowSize = wbits > 12 ? wbits - 3 : wbits > 4 ? wbits - 2 : wbits ? 2 : 1; // in bits\n    const MASK = (1 << windowSize) - 1;\n    const buckets = new Array(MASK + 1).fill(zero); // +1 for zero array\n    const lastBits = Math.floor((fieldN.BITS - 1) / windowSize) * windowSize;\n    let sum = zero;\n    for (let i = lastBits; i >= 0; i -= windowSize) {\n        buckets.fill(zero);\n        for (let j = 0; j < scalars.length; j++) {\n            const scalar = scalars[j];\n            const wbits = Number((scalar >> BigInt(i)) & BigInt(MASK));\n            buckets[wbits] = buckets[wbits].add(points[j]);\n        }\n        let resI = zero; // not using this will do small speed-up, but will lose ct\n        // Skip first bucket, because it is zero\n        for (let j = buckets.length - 1, sumI = zero; j > 0; j--) {\n            sumI = sumI.add(buckets[j]);\n            resI = resI.add(sumI);\n        }\n        sum = sum.add(resI);\n        if (i !== 0)\n            for (let j = 0; j < windowSize; j++)\n                sum = sum.double();\n    }\n    return sum;\n}\n/**\n * Precomputed multi-scalar multiplication (MSM, Pa + Qb + Rc + ...).\n * @param c Curve Point constructor\n * @param fieldN field over CURVE.N - important that it's not over CURVE.P\n * @param points array of L curve points\n * @returns function which multiplies points with scaars\n */\nexport function precomputeMSMUnsafe(c, fieldN, points, windowSize) {\n    /**\n     * Performance Analysis of Window-based Precomputation\n     *\n     * Base Case (256-bit scalar, 8-bit window):\n     * - Standard precomputation requires:\n     *   - 31 additions per scalar × 256 scalars = 7,936 ops\n     *   - Plus 255 summary additions = 8,191 total ops\n     *   Note: Summary additions can be optimized via accumulator\n     *\n     * Chunked Precomputation Analysis:\n     * - Using 32 chunks requires:\n     *   - 255 additions per chunk\n     *   - 256 doublings\n     *   - Total: (255 × 32) + 256 = 8,416 ops\n     *\n     * Memory Usage Comparison:\n     * Window Size | Standard Points | Chunked Points\n     * ------------|-----------------|---------------\n     *     4-bit   |     520         |      15\n     *     8-bit   |    4,224        |     255\n     *    10-bit   |   13,824        |   1,023\n     *    16-bit   |  557,056        |  65,535\n     *\n     * Key Advantages:\n     * 1. Enables larger window sizes due to reduced memory overhead\n     * 2. More efficient for smaller scalar counts:\n     *    - 16 chunks: (16 × 255) + 256 = 4,336 ops\n     *    - ~2x faster than standard 8,191 ops\n     *\n     * Limitations:\n     * - Not suitable for plain precomputes (requires 256 constant doublings)\n     * - Performance degrades with larger scalar counts:\n     *   - Optimal for ~256 scalars\n     *   - Less efficient for 4096+ scalars (Pippenger preferred)\n     */\n    validateW(windowSize, fieldN.BITS);\n    validateMSMPoints(points, c);\n    const zero = c.ZERO;\n    const tableSize = 2 ** windowSize - 1; // table size (without zero)\n    const chunks = Math.ceil(fieldN.BITS / windowSize); // chunks of item\n    const MASK = BigInt((1 << windowSize) - 1);\n    const tables = points.map((p) => {\n        const res = [];\n        for (let i = 0, acc = p; i < tableSize; i++) {\n            res.push(acc);\n            acc = acc.add(p);\n        }\n        return res;\n    });\n    return (scalars) => {\n        validateMSMScalars(scalars, fieldN);\n        if (scalars.length > points.length)\n            throw new Error('array of scalars must be smaller than array of points');\n        let res = zero;\n        for (let i = 0; i < chunks; i++) {\n            // No need to double if accumulator is still zero.\n            if (res !== zero)\n                for (let j = 0; j < windowSize; j++)\n                    res = res.double();\n            const shiftBy = BigInt(chunks * windowSize - (i + 1) * windowSize);\n            for (let j = 0; j < scalars.length; j++) {\n                const n = scalars[j];\n                const curr = Number((n >> shiftBy) & MASK);\n                if (!curr)\n                    continue; // skip zero scalars chunks\n                res = res.add(tables[j][curr - 1]);\n            }\n        }\n        return res;\n    };\n}\nexport function validateBasic(curve) {\n    validateField(curve.Fp);\n    validateObject(curve, {\n        n: 'bigint',\n        h: 'bigint',\n        Gx: 'field',\n        Gy: 'field',\n    }, {\n        nBitLength: 'isSafeInteger',\n        nByteLength: 'isSafeInteger',\n    });\n    // Set defaults\n    return Object.freeze({\n        ...nLength(curve.n, curve.nBitLength),\n        ...curve,\n        ...{ p: curve.Fp.ORDER },\n    });\n}\n//# sourceMappingURL=curve.js.map","/**\n * Short Weierstrass curve methods. The formula is: y² = x³ + ax + b.\n *\n * ### Design rationale for types\n *\n * * Interaction between classes from different curves should fail:\n *   `k256.Point.BASE.add(p256.Point.BASE)`\n * * For this purpose we want to use `instanceof` operator, which is fast and works during runtime\n * * Different calls of `curve()` would return different classes -\n *   `curve(params) !== curve(params)`: if somebody decided to monkey-patch their curve,\n *   it won't affect others\n *\n * TypeScript can't infer types for classes created inside a function. Classes is one instance\n * of nominative types in TypeScript and interfaces only check for shape, so it's hard to create\n * unique type for every function call.\n *\n * We can use generic types via some param, like curve opts, but that would:\n *     1. Enable interaction between `curve(params)` and `curve(params)` (curves of same params)\n *     which is hard to debug.\n *     2. Params can be generic and we can't enforce them to be constant value:\n *     if somebody creates curve from non-constant params,\n *     it would be allowed to interact with other curves with non-constant params\n *\n * @todo https://www.typescriptlang.org/docs/handbook/release-notes/typescript-2-7.html#unique-symbol\n * @module\n */\n/*! noble-curves - MIT License (c) 2022 Paul Miller (paulmillr.com) */\nimport { pippenger, validateBasic, wNAF, } from './curve.js';\nimport { Field, getMinHashLength, invert, mapHashToField, mod, validateField, } from './modular.js';\nimport * as ut from './utils.js';\nimport { abool, ensureBytes, memoized } from './utils.js';\nfunction validateSigVerOpts(opts) {\n    if (opts.lowS !== undefined)\n        abool('lowS', opts.lowS);\n    if (opts.prehash !== undefined)\n        abool('prehash', opts.prehash);\n}\nfunction validatePointOpts(curve) {\n    const opts = validateBasic(curve);\n    ut.validateObject(opts, {\n        a: 'field',\n        b: 'field',\n    }, {\n        allowedPrivateKeyLengths: 'array',\n        wrapPrivateKey: 'boolean',\n        isTorsionFree: 'function',\n        clearCofactor: 'function',\n        allowInfinityPoint: 'boolean',\n        fromBytes: 'function',\n        toBytes: 'function',\n    });\n    const { endo, Fp, a } = opts;\n    if (endo) {\n        if (!Fp.eql(a, Fp.ZERO)) {\n            throw new Error('invalid endomorphism, can only be defined for Koblitz curves that have a=0');\n        }\n        if (typeof endo !== 'object' ||\n            typeof endo.beta !== 'bigint' ||\n            typeof endo.splitScalar !== 'function') {\n            throw new Error('invalid endomorphism, expected beta: bigint and splitScalar: function');\n        }\n    }\n    return Object.freeze({ ...opts });\n}\nconst { bytesToNumberBE: b2n, hexToBytes: h2b } = ut;\nexport class DERErr extends Error {\n    constructor(m = '') {\n        super(m);\n    }\n}\n/**\n * ASN.1 DER encoding utilities. ASN is very complex & fragile. Format:\n *\n *     [0x30 (SEQUENCE), bytelength, 0x02 (INTEGER), intLength, R, 0x02 (INTEGER), intLength, S]\n *\n * Docs: https://letsencrypt.org/docs/a-warm-welcome-to-asn1-and-der/, https://luca.ntop.org/Teaching/Appunti/asn1.html\n */\nexport const DER = {\n    // asn.1 DER encoding utils\n    Err: DERErr,\n    // Basic building block is TLV (Tag-Length-Value)\n    _tlv: {\n        encode: (tag, data) => {\n            const { Err: E } = DER;\n            if (tag < 0 || tag > 256)\n                throw new E('tlv.encode: wrong tag');\n            if (data.length & 1)\n                throw new E('tlv.encode: unpadded data');\n            const dataLen = data.length / 2;\n            const len = ut.numberToHexUnpadded(dataLen);\n            if ((len.length / 2) & 128)\n                throw new E('tlv.encode: long form length too big');\n            // length of length with long form flag\n            const lenLen = dataLen > 127 ? ut.numberToHexUnpadded((len.length / 2) | 128) : '';\n            const t = ut.numberToHexUnpadded(tag);\n            return t + lenLen + len + data;\n        },\n        // v - value, l - left bytes (unparsed)\n        decode(tag, data) {\n            const { Err: E } = DER;\n            let pos = 0;\n            if (tag < 0 || tag > 256)\n                throw new E('tlv.encode: wrong tag');\n            if (data.length < 2 || data[pos++] !== tag)\n                throw new E('tlv.decode: wrong tlv');\n            const first = data[pos++];\n            const isLong = !!(first & 128); // First bit of first length byte is flag for short/long form\n            let length = 0;\n            if (!isLong)\n                length = first;\n            else {\n                // Long form: [longFlag(1bit), lengthLength(7bit), length (BE)]\n                const lenLen = first & 127;\n                if (!lenLen)\n                    throw new E('tlv.decode(long): indefinite length not supported');\n                if (lenLen > 4)\n                    throw new E('tlv.decode(long): byte length is too big'); // this will overflow u32 in js\n                const lengthBytes = data.subarray(pos, pos + lenLen);\n                if (lengthBytes.length !== lenLen)\n                    throw new E('tlv.decode: length bytes not complete');\n                if (lengthBytes[0] === 0)\n                    throw new E('tlv.decode(long): zero leftmost byte');\n                for (const b of lengthBytes)\n                    length = (length << 8) | b;\n                pos += lenLen;\n                if (length < 128)\n                    throw new E('tlv.decode(long): not minimal encoding');\n            }\n            const v = data.subarray(pos, pos + length);\n            if (v.length !== length)\n                throw new E('tlv.decode: wrong value length');\n            return { v, l: data.subarray(pos + length) };\n        },\n    },\n    // https://crypto.stackexchange.com/a/57734 Leftmost bit of first byte is 'negative' flag,\n    // since we always use positive integers here. It must always be empty:\n    // - add zero byte if exists\n    // - if next byte doesn't have a flag, leading zero is not allowed (minimal encoding)\n    _int: {\n        encode(num) {\n            const { Err: E } = DER;\n            if (num < _0n)\n                throw new E('integer: negative integers are not allowed');\n            let hex = ut.numberToHexUnpadded(num);\n            // Pad with zero byte if negative flag is present\n            if (Number.parseInt(hex[0], 16) & 0b1000)\n                hex = '00' + hex;\n            if (hex.length & 1)\n                throw new E('unexpected DER parsing assertion: unpadded hex');\n            return hex;\n        },\n        decode(data) {\n            const { Err: E } = DER;\n            if (data[0] & 128)\n                throw new E('invalid signature integer: negative');\n            if (data[0] === 0x00 && !(data[1] & 128))\n                throw new E('invalid signature integer: unnecessary leading zero');\n            return b2n(data);\n        },\n    },\n    toSig(hex) {\n        // parse DER signature\n        const { Err: E, _int: int, _tlv: tlv } = DER;\n        const data = typeof hex === 'string' ? h2b(hex) : hex;\n        ut.abytes(data);\n        const { v: seqBytes, l: seqLeftBytes } = tlv.decode(0x30, data);\n        if (seqLeftBytes.length)\n            throw new E('invalid signature: left bytes after parsing');\n        const { v: rBytes, l: rLeftBytes } = tlv.decode(0x02, seqBytes);\n        const { v: sBytes, l: sLeftBytes } = tlv.decode(0x02, rLeftBytes);\n        if (sLeftBytes.length)\n            throw new E('invalid signature: left bytes after parsing');\n        return { r: int.decode(rBytes), s: int.decode(sBytes) };\n    },\n    hexFromSig(sig) {\n        const { _tlv: tlv, _int: int } = DER;\n        const rs = tlv.encode(0x02, int.encode(sig.r));\n        const ss = tlv.encode(0x02, int.encode(sig.s));\n        const seq = rs + ss;\n        return tlv.encode(0x30, seq);\n    },\n};\n// Be friendly to bad ECMAScript parsers by not using bigint literals\n// prettier-ignore\nconst _0n = BigInt(0), _1n = BigInt(1), _2n = BigInt(2), _3n = BigInt(3), _4n = BigInt(4);\nexport function weierstrassPoints(opts) {\n    const CURVE = validatePointOpts(opts);\n    const { Fp } = CURVE; // All curves has same field / group length as for now, but they can differ\n    const Fn = Field(CURVE.n, CURVE.nBitLength);\n    const toBytes = CURVE.toBytes ||\n        ((_c, point, _isCompressed) => {\n            const a = point.toAffine();\n            return ut.concatBytes(Uint8Array.from([0x04]), Fp.toBytes(a.x), Fp.toBytes(a.y));\n        });\n    const fromBytes = CURVE.fromBytes ||\n        ((bytes) => {\n            // const head = bytes[0];\n            const tail = bytes.subarray(1);\n            // if (head !== 0x04) throw new Error('Only non-compressed encoding is supported');\n            const x = Fp.fromBytes(tail.subarray(0, Fp.BYTES));\n            const y = Fp.fromBytes(tail.subarray(Fp.BYTES, 2 * Fp.BYTES));\n            return { x, y };\n        });\n    /**\n     * y² = x³ + ax + b: Short weierstrass curve formula\n     * @returns y²\n     */\n    function weierstrassEquation(x) {\n        const { a, b } = CURVE;\n        const x2 = Fp.sqr(x); // x * x\n        const x3 = Fp.mul(x2, x); // x2 * x\n        return Fp.add(Fp.add(x3, Fp.mul(x, a)), b); // x3 + a * x + b\n    }\n    // Validate whether the passed curve params are valid.\n    // We check if curve equation works for generator point.\n    // `assertValidity()` won't work: `isTorsionFree()` is not available at this point in bls12-381.\n    // ProjectivePoint class has not been initialized yet.\n    if (!Fp.eql(Fp.sqr(CURVE.Gy), weierstrassEquation(CURVE.Gx)))\n        throw new Error('bad generator point: equation left != right');\n    // Valid group elements reside in range 1..n-1\n    function isWithinCurveOrder(num) {\n        return ut.inRange(num, _1n, CURVE.n);\n    }\n    // Validates if priv key is valid and converts it to bigint.\n    // Supports options allowedPrivateKeyLengths and wrapPrivateKey.\n    function normPrivateKeyToScalar(key) {\n        const { allowedPrivateKeyLengths: lengths, nByteLength, wrapPrivateKey, n: N } = CURVE;\n        if (lengths && typeof key !== 'bigint') {\n            if (ut.isBytes(key))\n                key = ut.bytesToHex(key);\n            // Normalize to hex string, pad. E.g. P521 would norm 130-132 char hex to 132-char bytes\n            if (typeof key !== 'string' || !lengths.includes(key.length))\n                throw new Error('invalid private key');\n            key = key.padStart(nByteLength * 2, '0');\n        }\n        let num;\n        try {\n            num =\n                typeof key === 'bigint'\n                    ? key\n                    : ut.bytesToNumberBE(ensureBytes('private key', key, nByteLength));\n        }\n        catch (error) {\n            throw new Error('invalid private key, expected hex or ' + nByteLength + ' bytes, got ' + typeof key);\n        }\n        if (wrapPrivateKey)\n            num = mod(num, N); // disabled by default, enabled for BLS\n        ut.aInRange('private key', num, _1n, N); // num in range [1..N-1]\n        return num;\n    }\n    function assertPrjPoint(other) {\n        if (!(other instanceof Point))\n            throw new Error('ProjectivePoint expected');\n    }\n    // Memoized toAffine / validity check. They are heavy. Points are immutable.\n    // Converts Projective point to affine (x, y) coordinates.\n    // Can accept precomputed Z^-1 - for example, from invertBatch.\n    // (x, y, z) ∋ (x=x/z, y=y/z)\n    const toAffineMemo = memoized((p, iz) => {\n        const { px: x, py: y, pz: z } = p;\n        // Fast-path for normalized points\n        if (Fp.eql(z, Fp.ONE))\n            return { x, y };\n        const is0 = p.is0();\n        // If invZ was 0, we return zero point. However we still want to execute\n        // all operations, so we replace invZ with a random number, 1.\n        if (iz == null)\n            iz = is0 ? Fp.ONE : Fp.inv(z);\n        const ax = Fp.mul(x, iz);\n        const ay = Fp.mul(y, iz);\n        const zz = Fp.mul(z, iz);\n        if (is0)\n            return { x: Fp.ZERO, y: Fp.ZERO };\n        if (!Fp.eql(zz, Fp.ONE))\n            throw new Error('invZ was invalid');\n        return { x: ax, y: ay };\n    });\n    // NOTE: on exception this will crash 'cached' and no value will be set.\n    // Otherwise true will be return\n    const assertValidMemo = memoized((p) => {\n        if (p.is0()) {\n            // (0, 1, 0) aka ZERO is invalid in most contexts.\n            // In BLS, ZERO can be serialized, so we allow it.\n            // (0, 0, 0) is invalid representation of ZERO.\n            if (CURVE.allowInfinityPoint && !Fp.is0(p.py))\n                return;\n            throw new Error('bad point: ZERO');\n        }\n        // Some 3rd-party test vectors require different wording between here & `fromCompressedHex`\n        const { x, y } = p.toAffine();\n        // Check if x, y are valid field elements\n        if (!Fp.isValid(x) || !Fp.isValid(y))\n            throw new Error('bad point: x or y not FE');\n        const left = Fp.sqr(y); // y²\n        const right = weierstrassEquation(x); // x³ + ax + b\n        if (!Fp.eql(left, right))\n            throw new Error('bad point: equation left != right');\n        if (!p.isTorsionFree())\n            throw new Error('bad point: not in prime-order subgroup');\n        return true;\n    });\n    /**\n     * Projective Point works in 3d / projective (homogeneous) coordinates: (x, y, z) ∋ (x=x/z, y=y/z)\n     * Default Point works in 2d / affine coordinates: (x, y)\n     * We're doing calculations in projective, because its operations don't require costly inversion.\n     */\n    class Point {\n        constructor(px, py, pz) {\n            this.px = px;\n            this.py = py;\n            this.pz = pz;\n            if (px == null || !Fp.isValid(px))\n                throw new Error('x required');\n            if (py == null || !Fp.isValid(py))\n                throw new Error('y required');\n            if (pz == null || !Fp.isValid(pz))\n                throw new Error('z required');\n            Object.freeze(this);\n        }\n        // Does not validate if the point is on-curve.\n        // Use fromHex instead, or call assertValidity() later.\n        static fromAffine(p) {\n            const { x, y } = p || {};\n            if (!p || !Fp.isValid(x) || !Fp.isValid(y))\n                throw new Error('invalid affine point');\n            if (p instanceof Point)\n                throw new Error('projective point not allowed');\n            const is0 = (i) => Fp.eql(i, Fp.ZERO);\n            // fromAffine(x:0, y:0) would produce (x:0, y:0, z:1), but we need (x:0, y:1, z:0)\n            if (is0(x) && is0(y))\n                return Point.ZERO;\n            return new Point(x, y, Fp.ONE);\n        }\n        get x() {\n            return this.toAffine().x;\n        }\n        get y() {\n            return this.toAffine().y;\n        }\n        /**\n         * Takes a bunch of Projective Points but executes only one\n         * inversion on all of them. Inversion is very slow operation,\n         * so this improves performance massively.\n         * Optimization: converts a list of projective points to a list of identical points with Z=1.\n         */\n        static normalizeZ(points) {\n            const toInv = Fp.invertBatch(points.map((p) => p.pz));\n            return points.map((p, i) => p.toAffine(toInv[i])).map(Point.fromAffine);\n        }\n        /**\n         * Converts hash string or Uint8Array to Point.\n         * @param hex short/long ECDSA hex\n         */\n        static fromHex(hex) {\n            const P = Point.fromAffine(fromBytes(ensureBytes('pointHex', hex)));\n            P.assertValidity();\n            return P;\n        }\n        // Multiplies generator point by privateKey.\n        static fromPrivateKey(privateKey) {\n            return Point.BASE.multiply(normPrivateKeyToScalar(privateKey));\n        }\n        // Multiscalar Multiplication\n        static msm(points, scalars) {\n            return pippenger(Point, Fn, points, scalars);\n        }\n        // \"Private method\", don't use it directly\n        _setWindowSize(windowSize) {\n            wnaf.setWindowSize(this, windowSize);\n        }\n        // A point on curve is valid if it conforms to equation.\n        assertValidity() {\n            assertValidMemo(this);\n        }\n        hasEvenY() {\n            const { y } = this.toAffine();\n            if (Fp.isOdd)\n                return !Fp.isOdd(y);\n            throw new Error(\"Field doesn't support isOdd\");\n        }\n        /**\n         * Compare one point to another.\n         */\n        equals(other) {\n            assertPrjPoint(other);\n            const { px: X1, py: Y1, pz: Z1 } = this;\n            const { px: X2, py: Y2, pz: Z2 } = other;\n            const U1 = Fp.eql(Fp.mul(X1, Z2), Fp.mul(X2, Z1));\n            const U2 = Fp.eql(Fp.mul(Y1, Z2), Fp.mul(Y2, Z1));\n            return U1 && U2;\n        }\n        /**\n         * Flips point to one corresponding to (x, -y) in Affine coordinates.\n         */\n        negate() {\n            return new Point(this.px, Fp.neg(this.py), this.pz);\n        }\n        // Renes-Costello-Batina exception-free doubling formula.\n        // There is 30% faster Jacobian formula, but it is not complete.\n        // https://eprint.iacr.org/2015/1060, algorithm 3\n        // Cost: 8M + 3S + 3*a + 2*b3 + 15add.\n        double() {\n            const { a, b } = CURVE;\n            const b3 = Fp.mul(b, _3n);\n            const { px: X1, py: Y1, pz: Z1 } = this;\n            let X3 = Fp.ZERO, Y3 = Fp.ZERO, Z3 = Fp.ZERO; // prettier-ignore\n            let t0 = Fp.mul(X1, X1); // step 1\n            let t1 = Fp.mul(Y1, Y1);\n            let t2 = Fp.mul(Z1, Z1);\n            let t3 = Fp.mul(X1, Y1);\n            t3 = Fp.add(t3, t3); // step 5\n            Z3 = Fp.mul(X1, Z1);\n            Z3 = Fp.add(Z3, Z3);\n            X3 = Fp.mul(a, Z3);\n            Y3 = Fp.mul(b3, t2);\n            Y3 = Fp.add(X3, Y3); // step 10\n            X3 = Fp.sub(t1, Y3);\n            Y3 = Fp.add(t1, Y3);\n            Y3 = Fp.mul(X3, Y3);\n            X3 = Fp.mul(t3, X3);\n            Z3 = Fp.mul(b3, Z3); // step 15\n            t2 = Fp.mul(a, t2);\n            t3 = Fp.sub(t0, t2);\n            t3 = Fp.mul(a, t3);\n            t3 = Fp.add(t3, Z3);\n            Z3 = Fp.add(t0, t0); // step 20\n            t0 = Fp.add(Z3, t0);\n            t0 = Fp.add(t0, t2);\n            t0 = Fp.mul(t0, t3);\n            Y3 = Fp.add(Y3, t0);\n            t2 = Fp.mul(Y1, Z1); // step 25\n            t2 = Fp.add(t2, t2);\n            t0 = Fp.mul(t2, t3);\n            X3 = Fp.sub(X3, t0);\n            Z3 = Fp.mul(t2, t1);\n            Z3 = Fp.add(Z3, Z3); // step 30\n            Z3 = Fp.add(Z3, Z3);\n            return new Point(X3, Y3, Z3);\n        }\n        // Renes-Costello-Batina exception-free addition formula.\n        // There is 30% faster Jacobian formula, but it is not complete.\n        // https://eprint.iacr.org/2015/1060, algorithm 1\n        // Cost: 12M + 0S + 3*a + 3*b3 + 23add.\n        add(other) {\n            assertPrjPoint(other);\n            const { px: X1, py: Y1, pz: Z1 } = this;\n            const { px: X2, py: Y2, pz: Z2 } = other;\n            let X3 = Fp.ZERO, Y3 = Fp.ZERO, Z3 = Fp.ZERO; // prettier-ignore\n            const a = CURVE.a;\n            const b3 = Fp.mul(CURVE.b, _3n);\n            let t0 = Fp.mul(X1, X2); // step 1\n            let t1 = Fp.mul(Y1, Y2);\n            let t2 = Fp.mul(Z1, Z2);\n            let t3 = Fp.add(X1, Y1);\n            let t4 = Fp.add(X2, Y2); // step 5\n            t3 = Fp.mul(t3, t4);\n            t4 = Fp.add(t0, t1);\n            t3 = Fp.sub(t3, t4);\n            t4 = Fp.add(X1, Z1);\n            let t5 = Fp.add(X2, Z2); // step 10\n            t4 = Fp.mul(t4, t5);\n            t5 = Fp.add(t0, t2);\n            t4 = Fp.sub(t4, t5);\n            t5 = Fp.add(Y1, Z1);\n            X3 = Fp.add(Y2, Z2); // step 15\n            t5 = Fp.mul(t5, X3);\n            X3 = Fp.add(t1, t2);\n            t5 = Fp.sub(t5, X3);\n            Z3 = Fp.mul(a, t4);\n            X3 = Fp.mul(b3, t2); // step 20\n            Z3 = Fp.add(X3, Z3);\n            X3 = Fp.sub(t1, Z3);\n            Z3 = Fp.add(t1, Z3);\n            Y3 = Fp.mul(X3, Z3);\n            t1 = Fp.add(t0, t0); // step 25\n            t1 = Fp.add(t1, t0);\n            t2 = Fp.mul(a, t2);\n            t4 = Fp.mul(b3, t4);\n            t1 = Fp.add(t1, t2);\n            t2 = Fp.sub(t0, t2); // step 30\n            t2 = Fp.mul(a, t2);\n            t4 = Fp.add(t4, t2);\n            t0 = Fp.mul(t1, t4);\n            Y3 = Fp.add(Y3, t0);\n            t0 = Fp.mul(t5, t4); // step 35\n            X3 = Fp.mul(t3, X3);\n            X3 = Fp.sub(X3, t0);\n            t0 = Fp.mul(t3, t1);\n            Z3 = Fp.mul(t5, Z3);\n            Z3 = Fp.add(Z3, t0); // step 40\n            return new Point(X3, Y3, Z3);\n        }\n        subtract(other) {\n            return this.add(other.negate());\n        }\n        is0() {\n            return this.equals(Point.ZERO);\n        }\n        wNAF(n) {\n            return wnaf.wNAFCached(this, n, Point.normalizeZ);\n        }\n        /**\n         * Non-constant-time multiplication. Uses double-and-add algorithm.\n         * It's faster, but should only be used when you don't care about\n         * an exposed private key e.g. sig verification, which works over *public* keys.\n         */\n        multiplyUnsafe(sc) {\n            const { endo, n: N } = CURVE;\n            ut.aInRange('scalar', sc, _0n, N);\n            const I = Point.ZERO;\n            if (sc === _0n)\n                return I;\n            if (this.is0() || sc === _1n)\n                return this;\n            // Case a: no endomorphism. Case b: has precomputes.\n            if (!endo || wnaf.hasPrecomputes(this))\n                return wnaf.wNAFCachedUnsafe(this, sc, Point.normalizeZ);\n            // Case c: endomorphism\n            let { k1neg, k1, k2neg, k2 } = endo.splitScalar(sc);\n            let k1p = I;\n            let k2p = I;\n            let d = this;\n            while (k1 > _0n || k2 > _0n) {\n                if (k1 & _1n)\n                    k1p = k1p.add(d);\n                if (k2 & _1n)\n                    k2p = k2p.add(d);\n                d = d.double();\n                k1 >>= _1n;\n                k2 >>= _1n;\n            }\n            if (k1neg)\n                k1p = k1p.negate();\n            if (k2neg)\n                k2p = k2p.negate();\n            k2p = new Point(Fp.mul(k2p.px, endo.beta), k2p.py, k2p.pz);\n            return k1p.add(k2p);\n        }\n        /**\n         * Constant time multiplication.\n         * Uses wNAF method. Windowed method may be 10% faster,\n         * but takes 2x longer to generate and consumes 2x memory.\n         * Uses precomputes when available.\n         * Uses endomorphism for Koblitz curves.\n         * @param scalar by which the point would be multiplied\n         * @returns New point\n         */\n        multiply(scalar) {\n            const { endo, n: N } = CURVE;\n            ut.aInRange('scalar', scalar, _1n, N);\n            let point, fake; // Fake point is used to const-time mult\n            if (endo) {\n                const { k1neg, k1, k2neg, k2 } = endo.splitScalar(scalar);\n                let { p: k1p, f: f1p } = this.wNAF(k1);\n                let { p: k2p, f: f2p } = this.wNAF(k2);\n                k1p = wnaf.constTimeNegate(k1neg, k1p);\n                k2p = wnaf.constTimeNegate(k2neg, k2p);\n                k2p = new Point(Fp.mul(k2p.px, endo.beta), k2p.py, k2p.pz);\n                point = k1p.add(k2p);\n                fake = f1p.add(f2p);\n            }\n            else {\n                const { p, f } = this.wNAF(scalar);\n                point = p;\n                fake = f;\n            }\n            // Normalize `z` for both points, but return only real one\n            return Point.normalizeZ([point, fake])[0];\n        }\n        /**\n         * Efficiently calculate `aP + bQ`. Unsafe, can expose private key, if used incorrectly.\n         * Not using Strauss-Shamir trick: precomputation tables are faster.\n         * The trick could be useful if both P and Q are not G (not in our case).\n         * @returns non-zero affine point\n         */\n        multiplyAndAddUnsafe(Q, a, b) {\n            const G = Point.BASE; // No Strauss-Shamir trick: we have 10% faster G precomputes\n            const mul = (P, a // Select faster multiply() method\n            ) => (a === _0n || a === _1n || !P.equals(G) ? P.multiplyUnsafe(a) : P.multiply(a));\n            const sum = mul(this, a).add(mul(Q, b));\n            return sum.is0() ? undefined : sum;\n        }\n        // Converts Projective point to affine (x, y) coordinates.\n        // Can accept precomputed Z^-1 - for example, from invertBatch.\n        // (x, y, z) ∋ (x=x/z, y=y/z)\n        toAffine(iz) {\n            return toAffineMemo(this, iz);\n        }\n        isTorsionFree() {\n            const { h: cofactor, isTorsionFree } = CURVE;\n            if (cofactor === _1n)\n                return true; // No subgroups, always torsion-free\n            if (isTorsionFree)\n                return isTorsionFree(Point, this);\n            throw new Error('isTorsionFree() has not been declared for the elliptic curve');\n        }\n        clearCofactor() {\n            const { h: cofactor, clearCofactor } = CURVE;\n            if (cofactor === _1n)\n                return this; // Fast-path\n            if (clearCofactor)\n                return clearCofactor(Point, this);\n            return this.multiplyUnsafe(CURVE.h);\n        }\n        toRawBytes(isCompressed = true) {\n            abool('isCompressed', isCompressed);\n            this.assertValidity();\n            return toBytes(Point, this, isCompressed);\n        }\n        toHex(isCompressed = true) {\n            abool('isCompressed', isCompressed);\n            return ut.bytesToHex(this.toRawBytes(isCompressed));\n        }\n    }\n    Point.BASE = new Point(CURVE.Gx, CURVE.Gy, Fp.ONE);\n    Point.ZERO = new Point(Fp.ZERO, Fp.ONE, Fp.ZERO);\n    const _bits = CURVE.nBitLength;\n    const wnaf = wNAF(Point, CURVE.endo ? Math.ceil(_bits / 2) : _bits);\n    // Validate if generator point is on curve\n    return {\n        CURVE,\n        ProjectivePoint: Point,\n        normPrivateKeyToScalar,\n        weierstrassEquation,\n        isWithinCurveOrder,\n    };\n}\nfunction validateOpts(curve) {\n    const opts = validateBasic(curve);\n    ut.validateObject(opts, {\n        hash: 'hash',\n        hmac: 'function',\n        randomBytes: 'function',\n    }, {\n        bits2int: 'function',\n        bits2int_modN: 'function',\n        lowS: 'boolean',\n    });\n    return Object.freeze({ lowS: true, ...opts });\n}\n/**\n * Creates short weierstrass curve and ECDSA signature methods for it.\n * @example\n * import { Field } from '@noble/curves/abstract/modular';\n * // Before that, define BigInt-s: a, b, p, n, Gx, Gy\n * const curve = weierstrass({ a, b, Fp: Field(p), n, Gx, Gy, h: 1n })\n */\nexport function weierstrass(curveDef) {\n    const CURVE = validateOpts(curveDef);\n    const { Fp, n: CURVE_ORDER } = CURVE;\n    const compressedLen = Fp.BYTES + 1; // e.g. 33 for 32\n    const uncompressedLen = 2 * Fp.BYTES + 1; // e.g. 65 for 32\n    function modN(a) {\n        return mod(a, CURVE_ORDER);\n    }\n    function invN(a) {\n        return invert(a, CURVE_ORDER);\n    }\n    const { ProjectivePoint: Point, normPrivateKeyToScalar, weierstrassEquation, isWithinCurveOrder, } = weierstrassPoints({\n        ...CURVE,\n        toBytes(_c, point, isCompressed) {\n            const a = point.toAffine();\n            const x = Fp.toBytes(a.x);\n            const cat = ut.concatBytes;\n            abool('isCompressed', isCompressed);\n            if (isCompressed) {\n                return cat(Uint8Array.from([point.hasEvenY() ? 0x02 : 0x03]), x);\n            }\n            else {\n                return cat(Uint8Array.from([0x04]), x, Fp.toBytes(a.y));\n            }\n        },\n        fromBytes(bytes) {\n            const len = bytes.length;\n            const head = bytes[0];\n            const tail = bytes.subarray(1);\n            // this.assertValidity() is done inside of fromHex\n            if (len === compressedLen && (head === 0x02 || head === 0x03)) {\n                const x = ut.bytesToNumberBE(tail);\n                if (!ut.inRange(x, _1n, Fp.ORDER))\n                    throw new Error('Point is not on curve');\n                const y2 = weierstrassEquation(x); // y² = x³ + ax + b\n                let y;\n                try {\n                    y = Fp.sqrt(y2); // y = y² ^ (p+1)/4\n                }\n                catch (sqrtError) {\n                    const suffix = sqrtError instanceof Error ? ': ' + sqrtError.message : '';\n                    throw new Error('Point is not on curve' + suffix);\n                }\n                const isYOdd = (y & _1n) === _1n;\n                // ECDSA\n                const isHeadOdd = (head & 1) === 1;\n                if (isHeadOdd !== isYOdd)\n                    y = Fp.neg(y);\n                return { x, y };\n            }\n            else if (len === uncompressedLen && head === 0x04) {\n                const x = Fp.fromBytes(tail.subarray(0, Fp.BYTES));\n                const y = Fp.fromBytes(tail.subarray(Fp.BYTES, 2 * Fp.BYTES));\n                return { x, y };\n            }\n            else {\n                const cl = compressedLen;\n                const ul = uncompressedLen;\n                throw new Error('invalid Point, expected length of ' + cl + ', or uncompressed ' + ul + ', got ' + len);\n            }\n        },\n    });\n    const numToNByteStr = (num) => ut.bytesToHex(ut.numberToBytesBE(num, CURVE.nByteLength));\n    function isBiggerThanHalfOrder(number) {\n        const HALF = CURVE_ORDER >> _1n;\n        return number > HALF;\n    }\n    function normalizeS(s) {\n        return isBiggerThanHalfOrder(s) ? modN(-s) : s;\n    }\n    // slice bytes num\n    const slcNum = (b, from, to) => ut.bytesToNumberBE(b.slice(from, to));\n    /**\n     * ECDSA signature with its (r, s) properties. Supports DER & compact representations.\n     */\n    class Signature {\n        constructor(r, s, recovery) {\n            this.r = r;\n            this.s = s;\n            this.recovery = recovery;\n            this.assertValidity();\n        }\n        // pair (bytes of r, bytes of s)\n        static fromCompact(hex) {\n            const l = CURVE.nByteLength;\n            hex = ensureBytes('compactSignature', hex, l * 2);\n            return new Signature(slcNum(hex, 0, l), slcNum(hex, l, 2 * l));\n        }\n        // DER encoded ECDSA signature\n        // https://bitcoin.stackexchange.com/questions/57644/what-are-the-parts-of-a-bitcoin-transaction-input-script\n        static fromDER(hex) {\n            const { r, s } = DER.toSig(ensureBytes('DER', hex));\n            return new Signature(r, s);\n        }\n        assertValidity() {\n            ut.aInRange('r', this.r, _1n, CURVE_ORDER); // r in [1..N]\n            ut.aInRange('s', this.s, _1n, CURVE_ORDER); // s in [1..N]\n        }\n        addRecoveryBit(recovery) {\n            return new Signature(this.r, this.s, recovery);\n        }\n        recoverPublicKey(msgHash) {\n            const { r, s, recovery: rec } = this;\n            const h = bits2int_modN(ensureBytes('msgHash', msgHash)); // Truncate hash\n            if (rec == null || ![0, 1, 2, 3].includes(rec))\n                throw new Error('recovery id invalid');\n            const radj = rec === 2 || rec === 3 ? r + CURVE.n : r;\n            if (radj >= Fp.ORDER)\n                throw new Error('recovery id 2 or 3 invalid');\n            const prefix = (rec & 1) === 0 ? '02' : '03';\n            const R = Point.fromHex(prefix + numToNByteStr(radj));\n            const ir = invN(radj); // r^-1\n            const u1 = modN(-h * ir); // -hr^-1\n            const u2 = modN(s * ir); // sr^-1\n            const Q = Point.BASE.multiplyAndAddUnsafe(R, u1, u2); // (sr^-1)R-(hr^-1)G = -(hr^-1)G + (sr^-1)\n            if (!Q)\n                throw new Error('point at infinify'); // unsafe is fine: no priv data leaked\n            Q.assertValidity();\n            return Q;\n        }\n        // Signatures should be low-s, to prevent malleability.\n        hasHighS() {\n            return isBiggerThanHalfOrder(this.s);\n        }\n        normalizeS() {\n            return this.hasHighS() ? new Signature(this.r, modN(-this.s), this.recovery) : this;\n        }\n        // DER-encoded\n        toDERRawBytes() {\n            return ut.hexToBytes(this.toDERHex());\n        }\n        toDERHex() {\n            return DER.hexFromSig({ r: this.r, s: this.s });\n        }\n        // padded bytes of r, then padded bytes of s\n        toCompactRawBytes() {\n            return ut.hexToBytes(this.toCompactHex());\n        }\n        toCompactHex() {\n            return numToNByteStr(this.r) + numToNByteStr(this.s);\n        }\n    }\n    const utils = {\n        isValidPrivateKey(privateKey) {\n            try {\n                normPrivateKeyToScalar(privateKey);\n                return true;\n            }\n            catch (error) {\n                return false;\n            }\n        },\n        normPrivateKeyToScalar: normPrivateKeyToScalar,\n        /**\n         * Produces cryptographically secure private key from random of size\n         * (groupLen + ceil(groupLen / 2)) with modulo bias being negligible.\n         */\n        randomPrivateKey: () => {\n            const length = getMinHashLength(CURVE.n);\n            return mapHashToField(CURVE.randomBytes(length), CURVE.n);\n        },\n        /**\n         * Creates precompute table for an arbitrary EC point. Makes point \"cached\".\n         * Allows to massively speed-up `point.multiply(scalar)`.\n         * @returns cached point\n         * @example\n         * const fast = utils.precompute(8, ProjectivePoint.fromHex(someonesPubKey));\n         * fast.multiply(privKey); // much faster ECDH now\n         */\n        precompute(windowSize = 8, point = Point.BASE) {\n            point._setWindowSize(windowSize);\n            point.multiply(BigInt(3)); // 3 is arbitrary, just need any number here\n            return point;\n        },\n    };\n    /**\n     * Computes public key for a private key. Checks for validity of the private key.\n     * @param privateKey private key\n     * @param isCompressed whether to return compact (default), or full key\n     * @returns Public key, full when isCompressed=false; short when isCompressed=true\n     */\n    function getPublicKey(privateKey, isCompressed = true) {\n        return Point.fromPrivateKey(privateKey).toRawBytes(isCompressed);\n    }\n    /**\n     * Quick and dirty check for item being public key. Does not validate hex, or being on-curve.\n     */\n    function isProbPub(item) {\n        const arr = ut.isBytes(item);\n        const str = typeof item === 'string';\n        const len = (arr || str) && item.length;\n        if (arr)\n            return len === compressedLen || len === uncompressedLen;\n        if (str)\n            return len === 2 * compressedLen || len === 2 * uncompressedLen;\n        if (item instanceof Point)\n            return true;\n        return false;\n    }\n    /**\n     * ECDH (Elliptic Curve Diffie Hellman).\n     * Computes shared public key from private key and public key.\n     * Checks: 1) private key validity 2) shared key is on-curve.\n     * Does NOT hash the result.\n     * @param privateA private key\n     * @param publicB different public key\n     * @param isCompressed whether to return compact (default), or full key\n     * @returns shared public key\n     */\n    function getSharedSecret(privateA, publicB, isCompressed = true) {\n        if (isProbPub(privateA))\n            throw new Error('first arg must be private key');\n        if (!isProbPub(publicB))\n            throw new Error('second arg must be public key');\n        const b = Point.fromHex(publicB); // check for being on-curve\n        return b.multiply(normPrivateKeyToScalar(privateA)).toRawBytes(isCompressed);\n    }\n    // RFC6979: ensure ECDSA msg is X bytes and < N. RFC suggests optional truncating via bits2octets.\n    // FIPS 186-4 4.6 suggests the leftmost min(nBitLen, outLen) bits, which matches bits2int.\n    // bits2int can produce res>N, we can do mod(res, N) since the bitLen is the same.\n    // int2octets can't be used; pads small msgs with 0: unacceptatble for trunc as per RFC vectors\n    const bits2int = CURVE.bits2int ||\n        function (bytes) {\n            // Our custom check \"just in case\"\n            if (bytes.length > 8192)\n                throw new Error('input is too large');\n            // For curves with nBitLength % 8 !== 0: bits2octets(bits2octets(m)) !== bits2octets(m)\n            // for some cases, since bytes.length * 8 is not actual bitLength.\n            const num = ut.bytesToNumberBE(bytes); // check for == u8 done here\n            const delta = bytes.length * 8 - CURVE.nBitLength; // truncate to nBitLength leftmost bits\n            return delta > 0 ? num >> BigInt(delta) : num;\n        };\n    const bits2int_modN = CURVE.bits2int_modN ||\n        function (bytes) {\n            return modN(bits2int(bytes)); // can't use bytesToNumberBE here\n        };\n    // NOTE: pads output with zero as per spec\n    const ORDER_MASK = ut.bitMask(CURVE.nBitLength);\n    /**\n     * Converts to bytes. Checks if num in `[0..ORDER_MASK-1]` e.g.: `[0..2^256-1]`.\n     */\n    function int2octets(num) {\n        ut.aInRange('num < 2^' + CURVE.nBitLength, num, _0n, ORDER_MASK);\n        // works with order, can have different size than numToField!\n        return ut.numberToBytesBE(num, CURVE.nByteLength);\n    }\n    // Steps A, D of RFC6979 3.2\n    // Creates RFC6979 seed; converts msg/privKey to numbers.\n    // Used only in sign, not in verify.\n    // NOTE: we cannot assume here that msgHash has same amount of bytes as curve order,\n    // this will be invalid at least for P521. Also it can be bigger for P224 + SHA256\n    function prepSig(msgHash, privateKey, opts = defaultSigOpts) {\n        if (['recovered', 'canonical'].some((k) => k in opts))\n            throw new Error('sign() legacy options not supported');\n        const { hash, randomBytes } = CURVE;\n        let { lowS, prehash, extraEntropy: ent } = opts; // generates low-s sigs by default\n        if (lowS == null)\n            lowS = true; // RFC6979 3.2: we skip step A, because we already provide hash\n        msgHash = ensureBytes('msgHash', msgHash);\n        validateSigVerOpts(opts);\n        if (prehash)\n            msgHash = ensureBytes('prehashed msgHash', hash(msgHash));\n        // We can't later call bits2octets, since nested bits2int is broken for curves\n        // with nBitLength % 8 !== 0. Because of that, we unwrap it here as int2octets call.\n        // const bits2octets = (bits) => int2octets(bits2int_modN(bits))\n        const h1int = bits2int_modN(msgHash);\n        const d = normPrivateKeyToScalar(privateKey); // validate private key, convert to bigint\n        const seedArgs = [int2octets(d), int2octets(h1int)];\n        // extraEntropy. RFC6979 3.6: additional k' (optional).\n        if (ent != null && ent !== false) {\n            // K = HMAC_K(V || 0x00 || int2octets(x) || bits2octets(h1) || k')\n            const e = ent === true ? randomBytes(Fp.BYTES) : ent; // generate random bytes OR pass as-is\n            seedArgs.push(ensureBytes('extraEntropy', e)); // check for being bytes\n        }\n        const seed = ut.concatBytes(...seedArgs); // Step D of RFC6979 3.2\n        const m = h1int; // NOTE: no need to call bits2int second time here, it is inside truncateHash!\n        // Converts signature params into point w r/s, checks result for validity.\n        function k2sig(kBytes) {\n            // RFC 6979 Section 3.2, step 3: k = bits2int(T)\n            const k = bits2int(kBytes); // Cannot use fields methods, since it is group element\n            if (!isWithinCurveOrder(k))\n                return; // Important: all mod() calls here must be done over N\n            const ik = invN(k); // k^-1 mod n\n            const q = Point.BASE.multiply(k).toAffine(); // q = Gk\n            const r = modN(q.x); // r = q.x mod n\n            if (r === _0n)\n                return;\n            // Can use scalar blinding b^-1(bm + bdr) where b ∈ [1,q−1] according to\n            // https://tches.iacr.org/index.php/TCHES/article/view/7337/6509. We've decided against it:\n            // a) dependency on CSPRNG b) 15% slowdown c) doesn't really help since bigints are not CT\n            const s = modN(ik * modN(m + r * d)); // Not using blinding here\n            if (s === _0n)\n                return;\n            let recovery = (q.x === r ? 0 : 2) | Number(q.y & _1n); // recovery bit (2 or 3, when q.x > n)\n            let normS = s;\n            if (lowS && isBiggerThanHalfOrder(s)) {\n                normS = normalizeS(s); // if lowS was passed, ensure s is always\n                recovery ^= 1; // // in the bottom half of N\n            }\n            return new Signature(r, normS, recovery); // use normS, not s\n        }\n        return { seed, k2sig };\n    }\n    const defaultSigOpts = { lowS: CURVE.lowS, prehash: false };\n    const defaultVerOpts = { lowS: CURVE.lowS, prehash: false };\n    /**\n     * Signs message hash with a private key.\n     * ```\n     * sign(m, d, k) where\n     *   (x, y) = G × k\n     *   r = x mod n\n     *   s = (m + dr)/k mod n\n     * ```\n     * @param msgHash NOT message. msg needs to be hashed to `msgHash`, or use `prehash`.\n     * @param privKey private key\n     * @param opts lowS for non-malleable sigs. extraEntropy for mixing randomness into k. prehash will hash first arg.\n     * @returns signature with recovery param\n     */\n    function sign(msgHash, privKey, opts = defaultSigOpts) {\n        const { seed, k2sig } = prepSig(msgHash, privKey, opts); // Steps A, D of RFC6979 3.2.\n        const C = CURVE;\n        const drbg = ut.createHmacDrbg(C.hash.outputLen, C.nByteLength, C.hmac);\n        return drbg(seed, k2sig); // Steps B, C, D, E, F, G\n    }\n    // Enable precomputes. Slows down first publicKey computation by 20ms.\n    Point.BASE._setWindowSize(8);\n    // utils.precompute(8, ProjectivePoint.BASE)\n    /**\n     * Verifies a signature against message hash and public key.\n     * Rejects lowS signatures by default: to override,\n     * specify option `{lowS: false}`. Implements section 4.1.4 from https://www.secg.org/sec1-v2.pdf:\n     *\n     * ```\n     * verify(r, s, h, P) where\n     *   U1 = hs^-1 mod n\n     *   U2 = rs^-1 mod n\n     *   R = U1⋅G - U2⋅P\n     *   mod(R.x, n) == r\n     * ```\n     */\n    function verify(signature, msgHash, publicKey, opts = defaultVerOpts) {\n        const sg = signature;\n        msgHash = ensureBytes('msgHash', msgHash);\n        publicKey = ensureBytes('publicKey', publicKey);\n        const { lowS, prehash, format } = opts;\n        // Verify opts, deduce signature format\n        validateSigVerOpts(opts);\n        if ('strict' in opts)\n            throw new Error('options.strict was renamed to lowS');\n        if (format !== undefined && format !== 'compact' && format !== 'der')\n            throw new Error('format must be compact or der');\n        const isHex = typeof sg === 'string' || ut.isBytes(sg);\n        const isObj = !isHex &&\n            !format &&\n            typeof sg === 'object' &&\n            sg !== null &&\n            typeof sg.r === 'bigint' &&\n            typeof sg.s === 'bigint';\n        if (!isHex && !isObj)\n            throw new Error('invalid signature, expected Uint8Array, hex string or Signature instance');\n        let _sig = undefined;\n        let P;\n        try {\n            if (isObj)\n                _sig = new Signature(sg.r, sg.s);\n            if (isHex) {\n                // Signature can be represented in 2 ways: compact (2*nByteLength) & DER (variable-length).\n                // Since DER can also be 2*nByteLength bytes, we check for it first.\n                try {\n                    if (format !== 'compact')\n                        _sig = Signature.fromDER(sg);\n                }\n                catch (derError) {\n                    if (!(derError instanceof DER.Err))\n                        throw derError;\n                }\n                if (!_sig && format !== 'der')\n                    _sig = Signature.fromCompact(sg);\n            }\n            P = Point.fromHex(publicKey);\n        }\n        catch (error) {\n            return false;\n        }\n        if (!_sig)\n            return false;\n        if (lowS && _sig.hasHighS())\n            return false;\n        if (prehash)\n            msgHash = CURVE.hash(msgHash);\n        const { r, s } = _sig;\n        const h = bits2int_modN(msgHash); // Cannot use fields methods, since it is group element\n        const is = invN(s); // s^-1\n        const u1 = modN(h * is); // u1 = hs^-1 mod n\n        const u2 = modN(r * is); // u2 = rs^-1 mod n\n        const R = Point.BASE.multiplyAndAddUnsafe(P, u1, u2)?.toAffine(); // R = u1⋅G + u2⋅P\n        if (!R)\n            return false;\n        const v = modN(R.x);\n        return v === r;\n    }\n    return {\n        CURVE,\n        getPublicKey,\n        getSharedSecret,\n        sign,\n        verify,\n        ProjectivePoint: Point,\n        Signature,\n        utils,\n    };\n}\n/**\n * Implementation of the Shallue and van de Woestijne method for any weierstrass curve.\n * TODO: check if there is a way to merge this with uvRatio in Edwards; move to modular.\n * b = True and y = sqrt(u / v) if (u / v) is square in F, and\n * b = False and y = sqrt(Z * (u / v)) otherwise.\n * @param Fp\n * @param Z\n * @returns\n */\nexport function SWUFpSqrtRatio(Fp, Z) {\n    // Generic implementation\n    const q = Fp.ORDER;\n    let l = _0n;\n    for (let o = q - _1n; o % _2n === _0n; o /= _2n)\n        l += _1n;\n    const c1 = l; // 1. c1, the largest integer such that 2^c1 divides q - 1.\n    // We need 2n ** c1 and 2n ** (c1-1). We can't use **; but we can use <<.\n    // 2n ** c1 == 2n << (c1-1)\n    const _2n_pow_c1_1 = _2n << (c1 - _1n - _1n);\n    const _2n_pow_c1 = _2n_pow_c1_1 * _2n;\n    const c2 = (q - _1n) / _2n_pow_c1; // 2. c2 = (q - 1) / (2^c1)  # Integer arithmetic\n    const c3 = (c2 - _1n) / _2n; // 3. c3 = (c2 - 1) / 2            # Integer arithmetic\n    const c4 = _2n_pow_c1 - _1n; // 4. c4 = 2^c1 - 1                # Integer arithmetic\n    const c5 = _2n_pow_c1_1; // 5. c5 = 2^(c1 - 1)                  # Integer arithmetic\n    const c6 = Fp.pow(Z, c2); // 6. c6 = Z^c2\n    const c7 = Fp.pow(Z, (c2 + _1n) / _2n); // 7. c7 = Z^((c2 + 1) / 2)\n    let sqrtRatio = (u, v) => {\n        let tv1 = c6; // 1. tv1 = c6\n        let tv2 = Fp.pow(v, c4); // 2. tv2 = v^c4\n        let tv3 = Fp.sqr(tv2); // 3. tv3 = tv2^2\n        tv3 = Fp.mul(tv3, v); // 4. tv3 = tv3 * v\n        let tv5 = Fp.mul(u, tv3); // 5. tv5 = u * tv3\n        tv5 = Fp.pow(tv5, c3); // 6. tv5 = tv5^c3\n        tv5 = Fp.mul(tv5, tv2); // 7. tv5 = tv5 * tv2\n        tv2 = Fp.mul(tv5, v); // 8. tv2 = tv5 * v\n        tv3 = Fp.mul(tv5, u); // 9. tv3 = tv5 * u\n        let tv4 = Fp.mul(tv3, tv2); // 10. tv4 = tv3 * tv2\n        tv5 = Fp.pow(tv4, c5); // 11. tv5 = tv4^c5\n        let isQR = Fp.eql(tv5, Fp.ONE); // 12. isQR = tv5 == 1\n        tv2 = Fp.mul(tv3, c7); // 13. tv2 = tv3 * c7\n        tv5 = Fp.mul(tv4, tv1); // 14. tv5 = tv4 * tv1\n        tv3 = Fp.cmov(tv2, tv3, isQR); // 15. tv3 = CMOV(tv2, tv3, isQR)\n        tv4 = Fp.cmov(tv5, tv4, isQR); // 16. tv4 = CMOV(tv5, tv4, isQR)\n        // 17. for i in (c1, c1 - 1, ..., 2):\n        for (let i = c1; i > _1n; i--) {\n            let tv5 = i - _2n; // 18.    tv5 = i - 2\n            tv5 = _2n << (tv5 - _1n); // 19.    tv5 = 2^tv5\n            let tvv5 = Fp.pow(tv4, tv5); // 20.    tv5 = tv4^tv5\n            const e1 = Fp.eql(tvv5, Fp.ONE); // 21.    e1 = tv5 == 1\n            tv2 = Fp.mul(tv3, tv1); // 22.    tv2 = tv3 * tv1\n            tv1 = Fp.mul(tv1, tv1); // 23.    tv1 = tv1 * tv1\n            tvv5 = Fp.mul(tv4, tv1); // 24.    tv5 = tv4 * tv1\n            tv3 = Fp.cmov(tv2, tv3, e1); // 25.    tv3 = CMOV(tv2, tv3, e1)\n            tv4 = Fp.cmov(tvv5, tv4, e1); // 26.    tv4 = CMOV(tv5, tv4, e1)\n        }\n        return { isValid: isQR, value: tv3 };\n    };\n    if (Fp.ORDER % _4n === _3n) {\n        // sqrt_ratio_3mod4(u, v)\n        const c1 = (Fp.ORDER - _3n) / _4n; // 1. c1 = (q - 3) / 4     # Integer arithmetic\n        const c2 = Fp.sqrt(Fp.neg(Z)); // 2. c2 = sqrt(-Z)\n        sqrtRatio = (u, v) => {\n            let tv1 = Fp.sqr(v); // 1. tv1 = v^2\n            const tv2 = Fp.mul(u, v); // 2. tv2 = u * v\n            tv1 = Fp.mul(tv1, tv2); // 3. tv1 = tv1 * tv2\n            let y1 = Fp.pow(tv1, c1); // 4. y1 = tv1^c1\n            y1 = Fp.mul(y1, tv2); // 5. y1 = y1 * tv2\n            const y2 = Fp.mul(y1, c2); // 6. y2 = y1 * c2\n            const tv3 = Fp.mul(Fp.sqr(y1), v); // 7. tv3 = y1^2; 8. tv3 = tv3 * v\n            const isQR = Fp.eql(tv3, u); // 9. isQR = tv3 == u\n            let y = Fp.cmov(y2, y1, isQR); // 10. y = CMOV(y2, y1, isQR)\n            return { isValid: isQR, value: y }; // 11. return (isQR, y) isQR ? y : y*c2\n        };\n    }\n    // No curves uses that\n    // if (Fp.ORDER % _8n === _5n) // sqrt_ratio_5mod8\n    return sqrtRatio;\n}\n/**\n * Simplified Shallue-van de Woestijne-Ulas Method\n * https://www.rfc-editor.org/rfc/rfc9380#section-6.6.2\n */\nexport function mapToCurveSimpleSWU(Fp, opts) {\n    validateField(Fp);\n    if (!Fp.isValid(opts.A) || !Fp.isValid(opts.B) || !Fp.isValid(opts.Z))\n        throw new Error('mapToCurveSimpleSWU: invalid opts');\n    const sqrtRatio = SWUFpSqrtRatio(Fp, opts.Z);\n    if (!Fp.isOdd)\n        throw new Error('Fp.isOdd is not implemented!');\n    // Input: u, an element of F.\n    // Output: (x, y), a point on E.\n    return (u) => {\n        // prettier-ignore\n        let tv1, tv2, tv3, tv4, tv5, tv6, x, y;\n        tv1 = Fp.sqr(u); // 1.  tv1 = u^2\n        tv1 = Fp.mul(tv1, opts.Z); // 2.  tv1 = Z * tv1\n        tv2 = Fp.sqr(tv1); // 3.  tv2 = tv1^2\n        tv2 = Fp.add(tv2, tv1); // 4.  tv2 = tv2 + tv1\n        tv3 = Fp.add(tv2, Fp.ONE); // 5.  tv3 = tv2 + 1\n        tv3 = Fp.mul(tv3, opts.B); // 6.  tv3 = B * tv3\n        tv4 = Fp.cmov(opts.Z, Fp.neg(tv2), !Fp.eql(tv2, Fp.ZERO)); // 7.  tv4 = CMOV(Z, -tv2, tv2 != 0)\n        tv4 = Fp.mul(tv4, opts.A); // 8.  tv4 = A * tv4\n        tv2 = Fp.sqr(tv3); // 9.  tv2 = tv3^2\n        tv6 = Fp.sqr(tv4); // 10. tv6 = tv4^2\n        tv5 = Fp.mul(tv6, opts.A); // 11. tv5 = A * tv6\n        tv2 = Fp.add(tv2, tv5); // 12. tv2 = tv2 + tv5\n        tv2 = Fp.mul(tv2, tv3); // 13. tv2 = tv2 * tv3\n        tv6 = Fp.mul(tv6, tv4); // 14. tv6 = tv6 * tv4\n        tv5 = Fp.mul(tv6, opts.B); // 15. tv5 = B * tv6\n        tv2 = Fp.add(tv2, tv5); // 16. tv2 = tv2 + tv5\n        x = Fp.mul(tv1, tv3); // 17.   x = tv1 * tv3\n        const { isValid, value } = sqrtRatio(tv2, tv6); // 18. (is_gx1_square, y1) = sqrt_ratio(tv2, tv6)\n        y = Fp.mul(tv1, u); // 19.   y = tv1 * u  -> Z * u^3 * y1\n        y = Fp.mul(y, value); // 20.   y = y * y1\n        x = Fp.cmov(x, tv3, isValid); // 21.   x = CMOV(x, tv3, is_gx1_square)\n        y = Fp.cmov(y, value, isValid); // 22.   y = CMOV(y, y1, is_gx1_square)\n        const e1 = Fp.isOdd(u) === Fp.isOdd(y); // 23.  e1 = sgn0(u) == sgn0(y)\n        y = Fp.cmov(Fp.neg(y), y, e1); // 24.   y = CMOV(-y, y, e1)\n        x = Fp.div(x, tv4); // 25.   x = x / tv4\n        return { x, y };\n    };\n}\n//# sourceMappingURL=weierstrass.js.map","/**\n * Utilities for short weierstrass curves, combined with noble-hashes.\n * @module\n */\n/*! noble-curves - MIT License (c) 2022 Paul Miller (paulmillr.com) */\nimport { hmac } from '@noble/hashes/hmac';\nimport { concatBytes, randomBytes } from '@noble/hashes/utils';\nimport { weierstrass } from './abstract/weierstrass.js';\n/** connects noble-curves to noble-hashes */\nexport function getHash(hash) {\n    return {\n        hash,\n        hmac: (key, ...msgs) => hmac(hash, key, concatBytes(...msgs)),\n        randomBytes,\n    };\n}\nexport function createCurve(curveDef, defHash) {\n    const create = (hash) => weierstrass({ ...curveDef, ...getHash(hash) });\n    return { ...create(defHash), create };\n}\n//# sourceMappingURL=_shortw_utils.js.map","/**\n * NIST secp256k1. See [pdf](https://www.secg.org/sec2-v2.pdf).\n *\n * Seems to be rigid (not backdoored)\n * [as per discussion](https://bitcointalk.org/index.php?topic=289795.msg3183975#msg3183975).\n *\n * secp256k1 belongs to Koblitz curves: it has efficiently computable endomorphism.\n * Endomorphism uses 2x less RAM, speeds up precomputation by 2x and ECDH / key recovery by 20%.\n * For precomputed wNAF it trades off 1/2 init time & 1/3 ram for 20% perf hit.\n * [See explanation](https://gist.github.com/paulmillr/eb670806793e84df628a7c434a873066).\n * @module\n */\n/*! noble-curves - MIT License (c) 2022 Paul Miller (paulmillr.com) */\nimport { sha256 } from '@noble/hashes/sha256';\nimport { randomBytes } from '@noble/hashes/utils';\nimport { createCurve } from './_shortw_utils.js';\nimport { createHasher, isogenyMap } from './abstract/hash-to-curve.js';\nimport { Field, mod, pow2 } from './abstract/modular.js';\nimport { aInRange, bytesToNumberBE, concatBytes, ensureBytes, inRange, numberToBytesBE, } from './abstract/utils.js';\nimport { mapToCurveSimpleSWU } from './abstract/weierstrass.js';\nconst secp256k1P = BigInt('0xfffffffffffffffffffffffffffffffffffffffffffffffffffffffefffffc2f');\nconst secp256k1N = BigInt('0xfffffffffffffffffffffffffffffffebaaedce6af48a03bbfd25e8cd0364141');\nconst _1n = BigInt(1);\nconst _2n = BigInt(2);\nconst divNearest = (a, b) => (a + b / _2n) / b;\n/**\n * √n = n^((p+1)/4) for fields p = 3 mod 4. We unwrap the loop and multiply bit-by-bit.\n * (P+1n/4n).toString(2) would produce bits [223x 1, 0, 22x 1, 4x 0, 11, 00]\n */\nfunction sqrtMod(y) {\n    const P = secp256k1P;\n    // prettier-ignore\n    const _3n = BigInt(3), _6n = BigInt(6), _11n = BigInt(11), _22n = BigInt(22);\n    // prettier-ignore\n    const _23n = BigInt(23), _44n = BigInt(44), _88n = BigInt(88);\n    const b2 = (y * y * y) % P; // x^3, 11\n    const b3 = (b2 * b2 * y) % P; // x^7\n    const b6 = (pow2(b3, _3n, P) * b3) % P;\n    const b9 = (pow2(b6, _3n, P) * b3) % P;\n    const b11 = (pow2(b9, _2n, P) * b2) % P;\n    const b22 = (pow2(b11, _11n, P) * b11) % P;\n    const b44 = (pow2(b22, _22n, P) * b22) % P;\n    const b88 = (pow2(b44, _44n, P) * b44) % P;\n    const b176 = (pow2(b88, _88n, P) * b88) % P;\n    const b220 = (pow2(b176, _44n, P) * b44) % P;\n    const b223 = (pow2(b220, _3n, P) * b3) % P;\n    const t1 = (pow2(b223, _23n, P) * b22) % P;\n    const t2 = (pow2(t1, _6n, P) * b2) % P;\n    const root = pow2(t2, _2n, P);\n    if (!Fpk1.eql(Fpk1.sqr(root), y))\n        throw new Error('Cannot find square root');\n    return root;\n}\nconst Fpk1 = Field(secp256k1P, undefined, undefined, { sqrt: sqrtMod });\n/**\n * secp256k1 short weierstrass curve and ECDSA signatures over it.\n *\n * @example\n * import { secp256k1 } from '@noble/curves/secp256k1';\n *\n * const priv = secp256k1.utils.randomPrivateKey();\n * const pub = secp256k1.getPublicKey(priv);\n * const msg = new Uint8Array(32).fill(1); // message hash (not message) in ecdsa\n * const sig = secp256k1.sign(msg, priv); // `{prehash: true}` option is available\n * const isValid = secp256k1.verify(sig, msg, pub) === true;\n */\nexport const secp256k1 = createCurve({\n    a: BigInt(0), // equation params: a, b\n    b: BigInt(7),\n    Fp: Fpk1, // Field's prime: 2n**256n - 2n**32n - 2n**9n - 2n**8n - 2n**7n - 2n**6n - 2n**4n - 1n\n    n: secp256k1N, // Curve order, total count of valid points in the field\n    // Base point (x, y) aka generator point\n    Gx: BigInt('55066263022277343669578718895168534326250603453777594175500187360389116729240'),\n    Gy: BigInt('32670510020758816978083085130507043184471273380659243275938904335757337482424'),\n    h: BigInt(1), // Cofactor\n    lowS: true, // Allow only low-S signatures by default in sign() and verify()\n    endo: {\n        // Endomorphism, see above\n        beta: BigInt('0x7ae96a2b657c07106e64479eac3434e99cf0497512f58995c1396c28719501ee'),\n        splitScalar: (k) => {\n            const n = secp256k1N;\n            const a1 = BigInt('0x3086d221a7d46bcde86c90e49284eb15');\n            const b1 = -_1n * BigInt('0xe4437ed6010e88286f547fa90abfe4c3');\n            const a2 = BigInt('0x114ca50f7a8e2f3f657c1108d9d44cfd8');\n            const b2 = a1;\n            const POW_2_128 = BigInt('0x100000000000000000000000000000000'); // (2n**128n).toString(16)\n            const c1 = divNearest(b2 * k, n);\n            const c2 = divNearest(-b1 * k, n);\n            let k1 = mod(k - c1 * a1 - c2 * a2, n);\n            let k2 = mod(-c1 * b1 - c2 * b2, n);\n            const k1neg = k1 > POW_2_128;\n            const k2neg = k2 > POW_2_128;\n            if (k1neg)\n                k1 = n - k1;\n            if (k2neg)\n                k2 = n - k2;\n            if (k1 > POW_2_128 || k2 > POW_2_128) {\n                throw new Error('splitScalar: Endomorphism failed, k=' + k);\n            }\n            return { k1neg, k1, k2neg, k2 };\n        },\n    },\n}, sha256);\n// Schnorr signatures are superior to ECDSA from above. Below is Schnorr-specific BIP0340 code.\n// https://github.com/bitcoin/bips/blob/master/bip-0340.mediawiki\nconst _0n = BigInt(0);\n/** An object mapping tags to their tagged hash prefix of [SHA256(tag) | SHA256(tag)] */\nconst TAGGED_HASH_PREFIXES = {};\nfunction taggedHash(tag, ...messages) {\n    let tagP = TAGGED_HASH_PREFIXES[tag];\n    if (tagP === undefined) {\n        const tagH = sha256(Uint8Array.from(tag, (c) => c.charCodeAt(0)));\n        tagP = concatBytes(tagH, tagH);\n        TAGGED_HASH_PREFIXES[tag] = tagP;\n    }\n    return sha256(concatBytes(tagP, ...messages));\n}\n// ECDSA compact points are 33-byte. Schnorr is 32: we strip first byte 0x02 or 0x03\nconst pointToBytes = (point) => point.toRawBytes(true).slice(1);\nconst numTo32b = (n) => numberToBytesBE(n, 32);\nconst modP = (x) => mod(x, secp256k1P);\nconst modN = (x) => mod(x, secp256k1N);\nconst Point = secp256k1.ProjectivePoint;\nconst GmulAdd = (Q, a, b) => Point.BASE.multiplyAndAddUnsafe(Q, a, b);\n// Calculate point, scalar and bytes\nfunction schnorrGetExtPubKey(priv) {\n    let d_ = secp256k1.utils.normPrivateKeyToScalar(priv); // same method executed in fromPrivateKey\n    let p = Point.fromPrivateKey(d_); // P = d'⋅G; 0 < d' < n check is done inside\n    const scalar = p.hasEvenY() ? d_ : modN(-d_);\n    return { scalar: scalar, bytes: pointToBytes(p) };\n}\n/**\n * lift_x from BIP340. Convert 32-byte x coordinate to elliptic curve point.\n * @returns valid point checked for being on-curve\n */\nfunction lift_x(x) {\n    aInRange('x', x, _1n, secp256k1P); // Fail if x ≥ p.\n    const xx = modP(x * x);\n    const c = modP(xx * x + BigInt(7)); // Let c = x³ + 7 mod p.\n    let y = sqrtMod(c); // Let y = c^(p+1)/4 mod p.\n    if (y % _2n !== _0n)\n        y = modP(-y); // Return the unique point P such that x(P) = x and\n    const p = new Point(x, y, _1n); // y(P) = y if y mod 2 = 0 or y(P) = p-y otherwise.\n    p.assertValidity();\n    return p;\n}\nconst num = bytesToNumberBE;\n/**\n * Create tagged hash, convert it to bigint, reduce modulo-n.\n */\nfunction challenge(...args) {\n    return modN(num(taggedHash('BIP0340/challenge', ...args)));\n}\n/**\n * Schnorr public key is just `x` coordinate of Point as per BIP340.\n */\nfunction schnorrGetPublicKey(privateKey) {\n    return schnorrGetExtPubKey(privateKey).bytes; // d'=int(sk). Fail if d'=0 or d'≥n. Ret bytes(d'⋅G)\n}\n/**\n * Creates Schnorr signature as per BIP340. Verifies itself before returning anything.\n * auxRand is optional and is not the sole source of k generation: bad CSPRNG won't be dangerous.\n */\nfunction schnorrSign(message, privateKey, auxRand = randomBytes(32)) {\n    const m = ensureBytes('message', message);\n    const { bytes: px, scalar: d } = schnorrGetExtPubKey(privateKey); // checks for isWithinCurveOrder\n    const a = ensureBytes('auxRand', auxRand, 32); // Auxiliary random data a: a 32-byte array\n    const t = numTo32b(d ^ num(taggedHash('BIP0340/aux', a))); // Let t be the byte-wise xor of bytes(d) and hash/aux(a)\n    const rand = taggedHash('BIP0340/nonce', t, px, m); // Let rand = hash/nonce(t || bytes(P) || m)\n    const k_ = modN(num(rand)); // Let k' = int(rand) mod n\n    if (k_ === _0n)\n        throw new Error('sign failed: k is zero'); // Fail if k' = 0.\n    const { bytes: rx, scalar: k } = schnorrGetExtPubKey(k_); // Let R = k'⋅G.\n    const e = challenge(rx, px, m); // Let e = int(hash/challenge(bytes(R) || bytes(P) || m)) mod n.\n    const sig = new Uint8Array(64); // Let sig = bytes(R) || bytes((k + ed) mod n).\n    sig.set(rx, 0);\n    sig.set(numTo32b(modN(k + e * d)), 32);\n    // If Verify(bytes(P), m, sig) (see below) returns failure, abort\n    if (!schnorrVerify(sig, m, px))\n        throw new Error('sign: Invalid signature produced');\n    return sig;\n}\n/**\n * Verifies Schnorr signature.\n * Will swallow errors & return false except for initial type validation of arguments.\n */\nfunction schnorrVerify(signature, message, publicKey) {\n    const sig = ensureBytes('signature', signature, 64);\n    const m = ensureBytes('message', message);\n    const pub = ensureBytes('publicKey', publicKey, 32);\n    try {\n        const P = lift_x(num(pub)); // P = lift_x(int(pk)); fail if that fails\n        const r = num(sig.subarray(0, 32)); // Let r = int(sig[0:32]); fail if r ≥ p.\n        if (!inRange(r, _1n, secp256k1P))\n            return false;\n        const s = num(sig.subarray(32, 64)); // Let s = int(sig[32:64]); fail if s ≥ n.\n        if (!inRange(s, _1n, secp256k1N))\n            return false;\n        const e = challenge(numTo32b(r), pointToBytes(P), m); // int(challenge(bytes(r)||bytes(P)||m))%n\n        const R = GmulAdd(P, s, modN(-e)); // R = s⋅G - e⋅P\n        if (!R || !R.hasEvenY() || R.toAffine().x !== r)\n            return false; // -eP == (n-e)P\n        return true; // Fail if is_infinite(R) / not has_even_y(R) / x(R) ≠ r.\n    }\n    catch (error) {\n        return false;\n    }\n}\n/**\n * Schnorr signatures over secp256k1.\n * https://github.com/bitcoin/bips/blob/master/bip-0340.mediawiki\n * @example\n * import { schnorr } from '@noble/curves/secp256k1';\n * const priv = schnorr.utils.randomPrivateKey();\n * const pub = schnorr.getPublicKey(priv);\n * const msg = new TextEncoder().encode('hello');\n * const sig = schnorr.sign(msg, priv);\n * const isValid = schnorr.verify(sig, msg, pub);\n */\nexport const schnorr = /* @__PURE__ */ (() => ({\n    getPublicKey: schnorrGetPublicKey,\n    sign: schnorrSign,\n    verify: schnorrVerify,\n    utils: {\n        randomPrivateKey: secp256k1.utils.randomPrivateKey,\n        lift_x,\n        pointToBytes,\n        numberToBytesBE,\n        bytesToNumberBE,\n        taggedHash,\n        mod,\n    },\n}))();\nconst isoMap = /* @__PURE__ */ (() => isogenyMap(Fpk1, [\n    // xNum\n    [\n        '0x8e38e38e38e38e38e38e38e38e38e38e38e38e38e38e38e38e38e38daaaaa8c7',\n        '0x7d3d4c80bc321d5b9f315cea7fd44c5d595d2fc0bf63b92dfff1044f17c6581',\n        '0x534c328d23f234e6e2a413deca25caece4506144037c40314ecbd0b53d9dd262',\n        '0x8e38e38e38e38e38e38e38e38e38e38e38e38e38e38e38e38e38e38daaaaa88c',\n    ],\n    // xDen\n    [\n        '0xd35771193d94918a9ca34ccbb7b640dd86cd409542f8487d9fe6b745781eb49b',\n        '0xedadc6f64383dc1df7c4b2d51b54225406d36b641f5e41bbc52a56612a8c6d14',\n        '0x0000000000000000000000000000000000000000000000000000000000000001', // LAST 1\n    ],\n    // yNum\n    [\n        '0x4bda12f684bda12f684bda12f684bda12f684bda12f684bda12f684b8e38e23c',\n        '0xc75e0c32d5cb7c0fa9d0a54b12a0a6d5647ab046d686da6fdffc90fc201d71a3',\n        '0x29a6194691f91a73715209ef6512e576722830a201be2018a765e85a9ecee931',\n        '0x2f684bda12f684bda12f684bda12f684bda12f684bda12f684bda12f38e38d84',\n    ],\n    // yDen\n    [\n        '0xfffffffffffffffffffffffffffffffffffffffffffffffffffffffefffff93b',\n        '0x7a06534bb8bdb49fd5e9e6632722c2989467c1bfc8e8d978dfb425d2685c2573',\n        '0x6484aa716545ca2cf3a70c3fa8fe337e0a3d21162f0d6299a7bf8192bfd2a76f',\n        '0x0000000000000000000000000000000000000000000000000000000000000001', // LAST 1\n    ],\n].map((i) => i.map((j) => BigInt(j)))))();\nconst mapSWU = /* @__PURE__ */ (() => mapToCurveSimpleSWU(Fpk1, {\n    A: BigInt('0x3f8731abdd661adca08a5558f0f5d272e953d363cb6f0e5d405447c01a444533'),\n    B: BigInt('1771'),\n    Z: Fpk1.create(BigInt('-11')),\n}))();\nconst htf = /* @__PURE__ */ (() => createHasher(secp256k1.ProjectivePoint, (scalars) => {\n    const { x, y } = mapSWU(Fpk1.create(scalars[0]));\n    return isoMap(x, y);\n}, {\n    DST: 'secp256k1_XMD:SHA-256_SSWU_RO_',\n    encodeDST: 'secp256k1_XMD:SHA-256_SSWU_NU_',\n    p: Fpk1.ORDER,\n    m: 1,\n    k: 128,\n    expand: 'xmd',\n    hash: sha256,\n}))();\n/** secp256k1 hash-to-curve from [RFC 9380](https://www.rfc-editor.org/rfc/rfc9380). */\nexport const hashToCurve = /* @__PURE__ */ (() => htf.hashToCurve)();\n/** secp256k1 encode-to-curve from [RFC 9380](https://www.rfc-editor.org/rfc/rfc9380). */\nexport const encodeToCurve = /* @__PURE__ */ (() => htf.encodeToCurve)();\n//# sourceMappingURL=secp256k1.js.map","\"use strict\";\r\nObject.defineProperty(exports, \"__esModule\", { value: true });\r\nexports.LRUCacheNode = void 0;\r\nclass LRUCacheNode {\r\n    constructor(key, value, options) {\r\n        const { entryExpirationTimeInMS = null, next = null, prev = null, onEntryEvicted, onEntryMarkedAsMostRecentlyUsed, clone, cloneFn } = options !== null && options !== void 0 ? options : {};\r\n        if (typeof entryExpirationTimeInMS === 'number' &&\r\n            (entryExpirationTimeInMS <= 0 || Number.isNaN(entryExpirationTimeInMS))) {\r\n            throw new Error('entryExpirationTimeInMS must either be null (no expiry) or greater than 0');\r\n        }\r\n        this.clone = clone !== null && clone !== void 0 ? clone : false;\r\n        this.cloneFn = cloneFn !== null && cloneFn !== void 0 ? cloneFn : this.defaultClone;\r\n        this.key = key;\r\n        this.internalValue = this.clone ? this.cloneFn(value) : value;\r\n        this.created = Date.now();\r\n        this.entryExpirationTimeInMS = entryExpirationTimeInMS;\r\n        this.next = next;\r\n        this.prev = prev;\r\n        this.onEntryEvicted = onEntryEvicted;\r\n        this.onEntryMarkedAsMostRecentlyUsed = onEntryMarkedAsMostRecentlyUsed;\r\n    }\r\n    get value() {\r\n        return this.clone ? this.cloneFn(this.internalValue) : this.internalValue;\r\n    }\r\n    get isExpired() {\r\n        return typeof this.entryExpirationTimeInMS === 'number' && Date.now() - this.created > this.entryExpirationTimeInMS;\r\n    }\r\n    invokeOnEvicted() {\r\n        if (this.onEntryEvicted) {\r\n            const { key, value, isExpired } = this;\r\n            this.onEntryEvicted({ key, value, isExpired });\r\n        }\r\n    }\r\n    invokeOnEntryMarkedAsMostRecentlyUsed() {\r\n        if (this.onEntryMarkedAsMostRecentlyUsed) {\r\n            const { key, value } = this;\r\n            this.onEntryMarkedAsMostRecentlyUsed({ key, value });\r\n        }\r\n    }\r\n    defaultClone(value) {\r\n        if (typeof value === 'boolean' || typeof value === 'string' || typeof value === 'number') {\r\n            return value;\r\n        }\r\n        return JSON.parse(JSON.stringify(value));\r\n    }\r\n}\r\nexports.LRUCacheNode = LRUCacheNode;\r\n//# sourceMappingURL=LRUCacheNode.js.map","\"use strict\";\r\nObject.defineProperty(exports, \"__esModule\", { value: true });\r\nexports.LRUCache = void 0;\r\nconst LRUCacheNode_1 = require(\"./LRUCacheNode\");\r\n/**\r\n * A key value cache that implements the LRU policy.\r\n *\r\n * @typeparam TKey The type of the keys in the cache. Defaults to `string`.\r\n * @typeparam TValue The type of the values in the cache. Defaults to `any`.\r\n *\r\n * @see {@link https://en.wikipedia.org/wiki/Cache_replacement_policies#Least_recently_used_(LRU)}\r\n */\r\nclass LRUCache {\r\n    /**\r\n     * Creates a new instance of the LRUCache.\r\n     *\r\n     * @param options Additional configuration options for the LRUCache.\r\n     *\r\n     * @example\r\n     * ```typescript\r\n     * // No options.\r\n     * const cache = new LRUCache();\r\n     *\r\n     * // With options.\r\n     * const cache = new LRUCache({\r\n     *  entryExpirationTimeInMS: 10000\r\n     * });\r\n     * ```\r\n     */\r\n    constructor(options) {\r\n        this.lookupTable = new Map();\r\n        this.head = null;\r\n        this.tail = null;\r\n        const { maxSize = 25, entryExpirationTimeInMS = null, onEntryEvicted, onEntryMarkedAsMostRecentlyUsed, cloneFn, clone } = options !== null && options !== void 0 ? options : {};\r\n        if (Number.isNaN(maxSize) || maxSize <= 0) {\r\n            throw new Error('maxSize must be greater than 0.');\r\n        }\r\n        if (typeof entryExpirationTimeInMS === 'number' &&\r\n            (entryExpirationTimeInMS <= 0 || Number.isNaN(entryExpirationTimeInMS))) {\r\n            throw new Error('entryExpirationTimeInMS must either be null (no expiry) or greater than 0');\r\n        }\r\n        this.maxSizeInternal = maxSize;\r\n        this.entryExpirationTimeInMS = entryExpirationTimeInMS;\r\n        this.onEntryEvicted = onEntryEvicted;\r\n        this.onEntryMarkedAsMostRecentlyUsed = onEntryMarkedAsMostRecentlyUsed;\r\n        this.clone = clone;\r\n        this.cloneFn = cloneFn;\r\n    }\r\n    /**\r\n     * Returns the number of entries in the LRUCache object.\r\n     * If the cache has entryExpirationTimeInMS set, expired entries will be removed before the size is returned.\r\n     *\r\n     * @returns The number of entries in the cache.\r\n     *\r\n     * @example\r\n     * ```typescript\r\n     * const cache = new LRUCache();\r\n     *\r\n     * cache.set('testKey', 'testValue');\r\n     *\r\n     * const size = cache.size;\r\n     *\r\n     * // Will log 1\r\n     * console.log(size);\r\n     * ```\r\n     */\r\n    get size() {\r\n        this.cleanCache();\r\n        return this.lookupTable.size;\r\n    }\r\n    /**\r\n     * Returns the number of entries that can still be added to the LRUCache without evicting existing entries.\r\n     *\r\n     * @returns The number of entries that can still be added without evicting existing entries.\r\n     *\r\n     * @example\r\n     * ```typescript\r\n     * const cache = new LRUCache({ maxSize: 10 });\r\n     *\r\n     * cache.set('testKey', 'testValue');\r\n     *\r\n     * const remainingSize = cache.remainingSize;\r\n     *\r\n     * // Will log 9 due to 9 spots remaining before reaching maxSize of 10.\r\n     * console.log(remainingSize);\r\n     * ```\r\n     */\r\n    get remainingSize() {\r\n        return this.maxSizeInternal - this.size;\r\n    }\r\n    /**\r\n     * Returns the most recently used (newest) entry in the cache.\r\n     * This will not mark the entry as recently used.\r\n     * If the newest node is expired, it will be removed.\r\n     *\r\n     * @returns The most recently used (newest) entry in the cache.\r\n     *\r\n     * @example\r\n     * ```typescript\r\n     * const cache = new LRUCache({ maxSize: 10 });\r\n     *\r\n     * cache.set('testKey', 'testValue');\r\n     *\r\n     * const newest = cache.newest;\r\n     *\r\n     * // Will log testValue\r\n     * console.log(newest.value);\r\n     *\r\n     * // Will log testKey\r\n     * console.log(newest.key);\r\n     * ```\r\n     */\r\n    get newest() {\r\n        if (!this.head) {\r\n            return null;\r\n        }\r\n        if (this.head.isExpired) {\r\n            this.removeNodeFromListAndLookupTable(this.head);\r\n            return this.newest;\r\n        }\r\n        return this.mapNodeToEntry(this.head);\r\n    }\r\n    /**\r\n     * Returns the least recently used (oldest) entry in the cache.\r\n     * This will not mark the entry as recently used.\r\n     * If the oldest node is expired, it will be removed.\r\n     *\r\n     * @returns The least recently used (oldest) entry in the cache.\r\n     *\r\n     * @example\r\n     * ```typescript\r\n     * const cache = new LRUCache({ maxSize: 10 });\r\n     *\r\n     * cache.set('testKey', 'testValue');\r\n     *\r\n     * const oldest = cache.oldest;\r\n     *\r\n     * // Will log testValue\r\n     * console.log(oldest.value);\r\n     *\r\n     * // Will log testKey\r\n     * console.log(oldest.key);\r\n     * ```\r\n     */\r\n    get oldest() {\r\n        if (!this.tail) {\r\n            return null;\r\n        }\r\n        if (this.tail.isExpired) {\r\n            this.removeNodeFromListAndLookupTable(this.tail);\r\n            return this.oldest;\r\n        }\r\n        return this.mapNodeToEntry(this.tail);\r\n    }\r\n    /**\r\n     * Gets or sets the maxSize of the cache.\r\n     * This will evict the least recently used entries if needed to reach new maxSize.\r\n     *\r\n     * @param value The new value for maxSize. Must be greater than 0.\r\n     *\r\n     * @example\r\n     * ```typescript\r\n     * const cache = new LRUCache({ maxSize: 10 });\r\n     *\r\n     * cache.set('testKey', 'testValue');\r\n     *\r\n     * // Will be 10\r\n     * const maxSize = cache.maxSize;\r\n     *\r\n     * // Set new maxSize to 5. If there are more than 5 items in the cache, the least recently used entries will be removed until cache size is 5.\r\n     * cache.maxSize = 5;\r\n     * ```\r\n     */\r\n    get maxSize() {\r\n        return this.maxSizeInternal;\r\n    }\r\n    set maxSize(value) {\r\n        if (Number.isNaN(value) || value <= 0) {\r\n            throw new Error('maxSize must be greater than 0.');\r\n        }\r\n        this.maxSizeInternal = value;\r\n        this.enforceSizeLimit();\r\n    }\r\n    /**\r\n     * Sets the value for the key in the LRUCache object. Returns the LRUCache object.\r\n     * This marks the newly added entry as the most recently used entry.\r\n     * If adding the new entry makes the cache size go above maxSize,\r\n     * this will evict the least recently used entries until size is equal to maxSize.\r\n     *\r\n     * @param key The key of the entry.\r\n     * @param value The value to set for the key.\r\n     * @param entryOptions Additional configuration options for the cache entry.\r\n     *\r\n     * @returns The LRUCache instance.\r\n     *\r\n     * @example\r\n     * ```typescript\r\n     * const cache = new LRUCache();\r\n     *\r\n     * // Set the key testKey to value testValue\r\n     * cache.set('testKey', 'testValue');\r\n     *\r\n     * // Set the key key2 to value value2. Pass in optional options.\r\n     * cache.set('key2', 'value2', { entryExpirationTimeInMS: 10 });\r\n     * ```\r\n     */\r\n    set(key, value, entryOptions) {\r\n        const currentNodeForKey = this.lookupTable.get(key);\r\n        if (currentNodeForKey) {\r\n            this.removeNodeFromListAndLookupTable(currentNodeForKey);\r\n        }\r\n        const node = new LRUCacheNode_1.LRUCacheNode(key, value, {\r\n            entryExpirationTimeInMS: this.entryExpirationTimeInMS,\r\n            onEntryEvicted: this.onEntryEvicted,\r\n            onEntryMarkedAsMostRecentlyUsed: this.onEntryMarkedAsMostRecentlyUsed,\r\n            clone: this.clone,\r\n            cloneFn: this.cloneFn,\r\n            ...entryOptions\r\n        });\r\n        this.setNodeAsHead(node);\r\n        this.lookupTable.set(key, node);\r\n        this.enforceSizeLimit();\r\n        return this;\r\n    }\r\n    /**\r\n     * Returns the value associated to the key, or null if there is none or if the entry is expired.\r\n     * If an entry is returned, this marks the returned entry as the most recently used entry.\r\n     *\r\n     * @param key The key of the entry to get.\r\n     *\r\n     * @returns The cached value or null.\r\n     *\r\n     * @example\r\n     * ```typescript\r\n     * const cache = new LRUCache();\r\n     *\r\n     * // Set the key testKey to value testValue\r\n     * cache.set('testKey', 'testValue');\r\n     *\r\n     * // Will be 'testValue'. Entry will now be most recently used.\r\n     * const item1 = cache.get('testKey');\r\n     *\r\n     * // Will be null\r\n     * const item2 = cache.get('keyNotInCache');\r\n     * ```\r\n     */\r\n    get(key) {\r\n        const node = this.lookupTable.get(key);\r\n        if (!node) {\r\n            return null;\r\n        }\r\n        if (node.isExpired) {\r\n            this.removeNodeFromListAndLookupTable(node);\r\n            return null;\r\n        }\r\n        this.setNodeAsHead(node);\r\n        return node.value;\r\n    }\r\n    /**\r\n     * Returns the value associated to the key, or null if there is none or if the entry is expired.\r\n     * If an entry is returned, this will not mark the entry as most recently accessed.\r\n     * Useful if a value is needed but the order of the cache should not be changed.\r\n     *\r\n     * @param key The key of the entry to get.\r\n     *\r\n     * @returns The cached value or null.\r\n     *\r\n     * @example\r\n     * ```typescript\r\n     * const cache = new LRUCache();\r\n     *\r\n     * // Set the key testKey to value testValue\r\n     * cache.set('testKey', 'testValue');\r\n     *\r\n     * // Will be 'testValue'\r\n     * const item1 = cache.peek('testKey');\r\n     *\r\n     * // Will be null\r\n     * const item2 = cache.peek('keyNotInCache');\r\n     * ```\r\n     */\r\n    peek(key) {\r\n        const node = this.lookupTable.get(key);\r\n        if (!node) {\r\n            return null;\r\n        }\r\n        if (node.isExpired) {\r\n            this.removeNodeFromListAndLookupTable(node);\r\n            return null;\r\n        }\r\n        return node.value;\r\n    }\r\n    /**\r\n     * Deletes the entry for the passed in key.\r\n     *\r\n     * @param key The key of the entry to delete\r\n     *\r\n     * @returns True if an element in the LRUCache object existed and has been removed,\r\n     * or false if the element does not exist.\r\n     *\r\n     * @example\r\n     * ```typescript\r\n     * const cache = new LRUCache();\r\n     *\r\n     * // Set the key testKey to value testValue\r\n     * cache.set('testKey', 'testValue');\r\n     *\r\n     * // Will be true\r\n     * const wasDeleted = cache.delete('testKey');\r\n     *\r\n     * // Will be false\r\n     * const wasDeleted2 = cache.delete('keyNotInCache');\r\n     * ```\r\n     */\r\n    delete(key) {\r\n        const node = this.lookupTable.get(key);\r\n        if (!node) {\r\n            return false;\r\n        }\r\n        return this.removeNodeFromListAndLookupTable(node);\r\n    }\r\n    /**\r\n     * Returns a boolean asserting whether a value has been associated to the key in the LRUCache object or not.\r\n     * This does not mark the entry as recently used.\r\n     * If the cache has a key but the entry is expired, it will be removed and false will be returned.\r\n     *\r\n     * @param key The key of the entry to check if exists\r\n     *\r\n     * @returns true if the cache contains the supplied key. False if not.\r\n     *\r\n     * @example\r\n     * ```typescript\r\n     * const cache = new LRUCache();\r\n     *\r\n     * // Set the key testKey to value testValue\r\n     * cache.set('testKey', 'testValue');\r\n     *\r\n     * // Will be true\r\n     * const wasDeleted = cache.has('testKey');\r\n     *\r\n     * // Will be false\r\n     * const wasDeleted2 = cache.has('keyNotInCache');\r\n     * ```\r\n     */\r\n    has(key) {\r\n        const node = this.lookupTable.get(key);\r\n        if (!node) {\r\n            return false;\r\n        }\r\n        if (node.isExpired) {\r\n            this.removeNodeFromListAndLookupTable(node);\r\n            return false;\r\n        }\r\n        return true;\r\n    }\r\n    /**\r\n     * Removes all entries in the cache.\r\n     *\r\n     * @example\r\n     * ```typescript\r\n     * const cache = new LRUCache();\r\n     *\r\n     * // Set the key testKey to value testValue\r\n     * cache.set('testKey', 'testValue');\r\n     *\r\n     * // Clear cache.\r\n     * cache.clear();\r\n     * ```\r\n     */\r\n    clear() {\r\n        this.head = null;\r\n        this.tail = null;\r\n        this.lookupTable.clear();\r\n    }\r\n    /**\r\n     * Searches the cache for an entry matching the passed in condition.\r\n     * Expired entries will be skipped (and removed).\r\n     * If multiply entries in the cache match the condition, the most recently used entry will be returned.\r\n     * If an entry is returned, this marks the returned entry as the most recently used entry.\r\n     *\r\n     * @param condition The condition to apply to each entry in the\r\n     *\r\n     * @returns The first cache entry to match the condition. Null if none match.\r\n     *\r\n     * @example\r\n     * ```typescript\r\n     * const cache = new LRUCache();\r\n     *\r\n     * // Set the key testKey to value testValue\r\n     * cache.set('testKey', 'testValue');\r\n     *\r\n     * // item will be { key: 'testKey', value: 'testValue }\r\n     * const item = cache.find(entry => {\r\n     *   const { key, value } = entry;\r\n     *\r\n     *   if (key === 'testKey' || value === 'something') {\r\n     *     return true;\r\n     *   }\r\n     *\r\n     *   return false;\r\n     * });\r\n     *\r\n     * // item2 will be null\r\n     * const item2 = cache.find(entry => entry.key === 'notInCache');\r\n     * ```\r\n     */\r\n    find(condition) {\r\n        let node = this.head;\r\n        while (node) {\r\n            if (node.isExpired) {\r\n                const next = node.next;\r\n                this.removeNodeFromListAndLookupTable(node);\r\n                node = next;\r\n                continue;\r\n            }\r\n            const entry = this.mapNodeToEntry(node);\r\n            if (condition(entry)) {\r\n                this.setNodeAsHead(node);\r\n                return entry;\r\n            }\r\n            node = node.next;\r\n        }\r\n        return null;\r\n    }\r\n    /**\r\n     * Iterates over and applies the callback function to each entry in the cache.\r\n     * Iterates in order from most recently accessed entry to least recently.\r\n     * Expired entries will be skipped (and removed).\r\n     * No entry will be marked as recently used.\r\n     *\r\n     * @param callback the callback function to apply to the entry\r\n     *\r\n     * @example\r\n     * ```typescript\r\n     * const cache = new LRUCache();\r\n     *\r\n     * // Set the key testKey to value testValue\r\n     * cache.set('testKey', 'testValue');\r\n     *\r\n     * cache.forEach((key, value, index) => {\r\n     *   // do something with key, value, and/or index\r\n     * });\r\n     * ```\r\n     */\r\n    forEach(callback) {\r\n        let node = this.head;\r\n        let index = 0;\r\n        while (node) {\r\n            if (node.isExpired) {\r\n                const next = node.next;\r\n                this.removeNodeFromListAndLookupTable(node);\r\n                node = next;\r\n                continue;\r\n            }\r\n            callback(node.value, node.key, index);\r\n            node = node.next;\r\n            index++;\r\n        }\r\n    }\r\n    /**\r\n     * Creates a Generator which can be used with for ... of ... to iterate over the cache values.\r\n     * Iterates in order from most recently accessed entry to least recently.\r\n     * Expired entries will be skipped (and removed).\r\n     * No entry will be marked as accessed.\r\n     *\r\n     * @returns A Generator for the cache values.\r\n     *\r\n     * @example\r\n     * ```typescript\r\n     * const cache = new LRUCache();\r\n     *\r\n     * // Set the key testKey to value testValue\r\n     * cache.set('testKey', 'testValue');\r\n     *\r\n     * for (const value of cache.values()) {\r\n     *   // do something with the value\r\n     * }\r\n     * ```\r\n     */\r\n    *values() {\r\n        let node = this.head;\r\n        while (node) {\r\n            if (node.isExpired) {\r\n                const next = node.next;\r\n                this.removeNodeFromListAndLookupTable(node);\r\n                node = next;\r\n                continue;\r\n            }\r\n            yield node.value;\r\n            node = node.next;\r\n        }\r\n    }\r\n    /**\r\n     * Creates a Generator which can be used with for ... of ... to iterate over the cache keys.\r\n     * Iterates in order from most recently accessed entry to least recently.\r\n     * Expired entries will be skipped (and removed).\r\n     * No entry will be marked as accessed.\r\n     *\r\n     * @returns A Generator for the cache keys.\r\n     *\r\n     * @example\r\n     * ```typescript\r\n     * const cache = new LRUCache();\r\n     *\r\n     * // Set the key testKey to value testValue\r\n     * cache.set('testKey', 'testValue');\r\n     *\r\n     * for (const key of cache.keys()) {\r\n     *   // do something with the key\r\n     * }\r\n     * ```\r\n     */\r\n    *keys() {\r\n        let node = this.head;\r\n        while (node) {\r\n            if (node.isExpired) {\r\n                const next = node.next;\r\n                this.removeNodeFromListAndLookupTable(node);\r\n                node = next;\r\n                continue;\r\n            }\r\n            yield node.key;\r\n            node = node.next;\r\n        }\r\n    }\r\n    /**\r\n     * Creates a Generator which can be used with for ... of ... to iterate over the cache entries.\r\n     * Iterates in order from most recently accessed entry to least recently.\r\n     * Expired entries will be skipped (and removed).\r\n     * No entry will be marked as accessed.\r\n     *\r\n     * @returns A Generator for the cache entries.\r\n     *\r\n     * @example\r\n     * ```typescript\r\n     * const cache = new LRUCache();\r\n     *\r\n     * // Set the key testKey to value testValue\r\n     * cache.set('testKey', 'testValue');\r\n     *\r\n     * for (const entry of cache.entries()) {\r\n     *   const { key, value } = entry;\r\n     *   // do something with the entry\r\n     * }\r\n     * ```\r\n     */\r\n    *entries() {\r\n        let node = this.head;\r\n        while (node) {\r\n            if (node.isExpired) {\r\n                const next = node.next;\r\n                this.removeNodeFromListAndLookupTable(node);\r\n                node = next;\r\n                continue;\r\n            }\r\n            yield this.mapNodeToEntry(node);\r\n            node = node.next;\r\n        }\r\n    }\r\n    /**\r\n     * Creates a Generator which can be used with for ... of ... to iterate over the cache entries.\r\n     * Iterates in order from most recently accessed entry to least recently.\r\n     * Expired entries will be skipped (and removed).\r\n     * No entry will be marked as accessed.\r\n     *\r\n     * @returns A Generator for the cache entries.\r\n     *\r\n     * @example\r\n     * ```typescript\r\n     * const cache = new LRUCache();\r\n     *\r\n     * // Set the key testKey to value testValue\r\n     * cache.set('testKey', 'testValue');\r\n     *\r\n     * for (const entry of cache) {\r\n     *   const { key, value } = entry;\r\n     *   // do something with the entry\r\n     * }\r\n     * ```\r\n     */\r\n    *[Symbol.iterator]() {\r\n        let node = this.head;\r\n        while (node) {\r\n            if (node.isExpired) {\r\n                const next = node.next;\r\n                this.removeNodeFromListAndLookupTable(node);\r\n                node = next;\r\n                continue;\r\n            }\r\n            yield this.mapNodeToEntry(node);\r\n            node = node.next;\r\n        }\r\n    }\r\n    enforceSizeLimit() {\r\n        let node = this.tail;\r\n        while (node !== null && this.size > this.maxSizeInternal) {\r\n            const prev = node.prev;\r\n            this.removeNodeFromListAndLookupTable(node);\r\n            node = prev;\r\n        }\r\n    }\r\n    mapNodeToEntry({ key, value }) {\r\n        return {\r\n            key,\r\n            value\r\n        };\r\n    }\r\n    setNodeAsHead(node) {\r\n        this.removeNodeFromList(node);\r\n        if (!this.head) {\r\n            this.head = node;\r\n            this.tail = node;\r\n        }\r\n        else {\r\n            node.next = this.head;\r\n            this.head.prev = node;\r\n            this.head = node;\r\n        }\r\n        node.invokeOnEntryMarkedAsMostRecentlyUsed();\r\n    }\r\n    removeNodeFromList(node) {\r\n        if (node.prev !== null) {\r\n            node.prev.next = node.next;\r\n        }\r\n        if (node.next !== null) {\r\n            node.next.prev = node.prev;\r\n        }\r\n        if (this.head === node) {\r\n            this.head = node.next;\r\n        }\r\n        if (this.tail === node) {\r\n            this.tail = node.prev;\r\n        }\r\n        node.next = null;\r\n        node.prev = null;\r\n    }\r\n    removeNodeFromListAndLookupTable(node) {\r\n        node.invokeOnEvicted();\r\n        this.removeNodeFromList(node);\r\n        return this.lookupTable.delete(node.key);\r\n    }\r\n    cleanCache() {\r\n        // Don't spend time cleaning if entries don't expire.\r\n        if (!this.entryExpirationTimeInMS) {\r\n            return;\r\n        }\r\n        const expiredNodes = [];\r\n        for (const node of this.lookupTable.values()) {\r\n            if (node.isExpired) {\r\n                expiredNodes.push(node);\r\n            }\r\n        }\r\n        expiredNodes.forEach(node => this.removeNodeFromListAndLookupTable(node));\r\n    }\r\n}\r\nexports.LRUCache = LRUCache;\r\n//# sourceMappingURL=LRUCache.js.map","\"use strict\";\r\nvar __createBinding = (this && this.__createBinding) || (Object.create ? (function(o, m, k, k2) {\r\n    if (k2 === undefined) k2 = k;\r\n    var desc = Object.getOwnPropertyDescriptor(m, k);\r\n    if (!desc || (\"get\" in desc ? !m.__esModule : desc.writable || desc.configurable)) {\r\n      desc = { enumerable: true, get: function() { return m[k]; } };\r\n    }\r\n    Object.defineProperty(o, k2, desc);\r\n}) : (function(o, m, k, k2) {\r\n    if (k2 === undefined) k2 = k;\r\n    o[k2] = m[k];\r\n}));\r\nvar __exportStar = (this && this.__exportStar) || function(m, exports) {\r\n    for (var p in m) if (p !== \"default\" && !Object.prototype.hasOwnProperty.call(exports, p)) __createBinding(exports, m, p);\r\n};\r\nObject.defineProperty(exports, \"__esModule\", { value: true });\r\n__exportStar(require(\"./LRUCache\"), exports);\r\n//# sourceMappingURL=index.js.map","\"use strict\";\n/*! scure-base - MIT License (c) 2022 Paul Miller (paulmillr.com) */\nObject.defineProperty(exports, \"__esModule\", { value: true });\nexports.bytes = exports.stringToBytes = exports.str = exports.bytesToString = exports.hex = exports.utf8 = exports.bech32m = exports.bech32 = exports.base58check = exports.base58xmr = exports.base58xrp = exports.base58flickr = exports.base58 = exports.base64url = exports.base64 = exports.base32crockford = exports.base32hex = exports.base32 = exports.base16 = exports.utils = exports.assertNumber = void 0;\nfunction assertNumber(n) {\n    if (!Number.isSafeInteger(n))\n        throw new Error(`Wrong integer: ${n}`);\n}\nexports.assertNumber = assertNumber;\nfunction chain(...args) {\n    const wrap = (a, b) => (c) => a(b(c));\n    const encode = Array.from(args)\n        .reverse()\n        .reduce((acc, i) => (acc ? wrap(acc, i.encode) : i.encode), undefined);\n    const decode = args.reduce((acc, i) => (acc ? wrap(acc, i.decode) : i.decode), undefined);\n    return { encode, decode };\n}\nfunction alphabet(alphabet) {\n    return {\n        encode: (digits) => {\n            if (!Array.isArray(digits) || (digits.length && typeof digits[0] !== 'number'))\n                throw new Error('alphabet.encode input should be an array of numbers');\n            return digits.map((i) => {\n                assertNumber(i);\n                if (i < 0 || i >= alphabet.length)\n                    throw new Error(`Digit index outside alphabet: ${i} (alphabet: ${alphabet.length})`);\n                return alphabet[i];\n            });\n        },\n        decode: (input) => {\n            if (!Array.isArray(input) || (input.length && typeof input[0] !== 'string'))\n                throw new Error('alphabet.decode input should be array of strings');\n            return input.map((letter) => {\n                if (typeof letter !== 'string')\n                    throw new Error(`alphabet.decode: not string element=${letter}`);\n                const index = alphabet.indexOf(letter);\n                if (index === -1)\n                    throw new Error(`Unknown letter: \"${letter}\". Allowed: ${alphabet}`);\n                return index;\n            });\n        },\n    };\n}\nfunction join(separator = '') {\n    if (typeof separator !== 'string')\n        throw new Error('join separator should be string');\n    return {\n        encode: (from) => {\n            if (!Array.isArray(from) || (from.length && typeof from[0] !== 'string'))\n                throw new Error('join.encode input should be array of strings');\n            for (let i of from)\n                if (typeof i !== 'string')\n                    throw new Error(`join.encode: non-string input=${i}`);\n            return from.join(separator);\n        },\n        decode: (to) => {\n            if (typeof to !== 'string')\n                throw new Error('join.decode input should be string');\n            return to.split(separator);\n        },\n    };\n}\nfunction padding(bits, chr = '=') {\n    assertNumber(bits);\n    if (typeof chr !== 'string')\n        throw new Error('padding chr should be string');\n    return {\n        encode(data) {\n            if (!Array.isArray(data) || (data.length && typeof data[0] !== 'string'))\n                throw new Error('padding.encode input should be array of strings');\n            for (let i of data)\n                if (typeof i !== 'string')\n                    throw new Error(`padding.encode: non-string input=${i}`);\n            while ((data.length * bits) % 8)\n                data.push(chr);\n            return data;\n        },\n        decode(input) {\n            if (!Array.isArray(input) || (input.length && typeof input[0] !== 'string'))\n                throw new Error('padding.encode input should be array of strings');\n            for (let i of input)\n                if (typeof i !== 'string')\n                    throw new Error(`padding.decode: non-string input=${i}`);\n            let end = input.length;\n            if ((end * bits) % 8)\n                throw new Error('Invalid padding: string should have whole number of bytes');\n            for (; end > 0 && input[end - 1] === chr; end--) {\n                if (!(((end - 1) * bits) % 8))\n                    throw new Error('Invalid padding: string has too much padding');\n            }\n            return input.slice(0, end);\n        },\n    };\n}\nfunction normalize(fn) {\n    if (typeof fn !== 'function')\n        throw new Error('normalize fn should be function');\n    return { encode: (from) => from, decode: (to) => fn(to) };\n}\nfunction convertRadix(data, from, to) {\n    if (from < 2)\n        throw new Error(`convertRadix: wrong from=${from}, base cannot be less than 2`);\n    if (to < 2)\n        throw new Error(`convertRadix: wrong to=${to}, base cannot be less than 2`);\n    if (!Array.isArray(data))\n        throw new Error('convertRadix: data should be array');\n    if (!data.length)\n        return [];\n    let pos = 0;\n    const res = [];\n    const digits = Array.from(data);\n    digits.forEach((d) => {\n        assertNumber(d);\n        if (d < 0 || d >= from)\n            throw new Error(`Wrong integer: ${d}`);\n    });\n    while (true) {\n        let carry = 0;\n        let done = true;\n        for (let i = pos; i < digits.length; i++) {\n            const digit = digits[i];\n            const digitBase = from * carry + digit;\n            if (!Number.isSafeInteger(digitBase) ||\n                (from * carry) / from !== carry ||\n                digitBase - digit !== from * carry) {\n                throw new Error('convertRadix: carry overflow');\n            }\n            carry = digitBase % to;\n            digits[i] = Math.floor(digitBase / to);\n            if (!Number.isSafeInteger(digits[i]) || digits[i] * to + carry !== digitBase)\n                throw new Error('convertRadix: carry overflow');\n            if (!done)\n                continue;\n            else if (!digits[i])\n                pos = i;\n            else\n                done = false;\n        }\n        res.push(carry);\n        if (done)\n            break;\n    }\n    for (let i = 0; i < data.length - 1 && data[i] === 0; i++)\n        res.push(0);\n    return res.reverse();\n}\nconst gcd = (a, b) => (!b ? a : gcd(b, a % b));\nconst radix2carry = (from, to) => from + (to - gcd(from, to));\nfunction convertRadix2(data, from, to, padding) {\n    if (!Array.isArray(data))\n        throw new Error('convertRadix2: data should be array');\n    if (from <= 0 || from > 32)\n        throw new Error(`convertRadix2: wrong from=${from}`);\n    if (to <= 0 || to > 32)\n        throw new Error(`convertRadix2: wrong to=${to}`);\n    if (radix2carry(from, to) > 32) {\n        throw new Error(`convertRadix2: carry overflow from=${from} to=${to} carryBits=${radix2carry(from, to)}`);\n    }\n    let carry = 0;\n    let pos = 0;\n    const mask = 2 ** to - 1;\n    const res = [];\n    for (const n of data) {\n        assertNumber(n);\n        if (n >= 2 ** from)\n            throw new Error(`convertRadix2: invalid data word=${n} from=${from}`);\n        carry = (carry << from) | n;\n        if (pos + from > 32)\n            throw new Error(`convertRadix2: carry overflow pos=${pos} from=${from}`);\n        pos += from;\n        for (; pos >= to; pos -= to)\n            res.push(((carry >> (pos - to)) & mask) >>> 0);\n        carry &= 2 ** pos - 1;\n    }\n    carry = (carry << (to - pos)) & mask;\n    if (!padding && pos >= from)\n        throw new Error('Excess padding');\n    if (!padding && carry)\n        throw new Error(`Non-zero padding: ${carry}`);\n    if (padding && pos > 0)\n        res.push(carry >>> 0);\n    return res;\n}\nfunction radix(num) {\n    assertNumber(num);\n    return {\n        encode: (bytes) => {\n            if (!(bytes instanceof Uint8Array))\n                throw new Error('radix.encode input should be Uint8Array');\n            return convertRadix(Array.from(bytes), 2 ** 8, num);\n        },\n        decode: (digits) => {\n            if (!Array.isArray(digits) || (digits.length && typeof digits[0] !== 'number'))\n                throw new Error('radix.decode input should be array of strings');\n            return Uint8Array.from(convertRadix(digits, num, 2 ** 8));\n        },\n    };\n}\nfunction radix2(bits, revPadding = false) {\n    assertNumber(bits);\n    if (bits <= 0 || bits > 32)\n        throw new Error('radix2: bits should be in (0..32]');\n    if (radix2carry(8, bits) > 32 || radix2carry(bits, 8) > 32)\n        throw new Error('radix2: carry overflow');\n    return {\n        encode: (bytes) => {\n            if (!(bytes instanceof Uint8Array))\n                throw new Error('radix2.encode input should be Uint8Array');\n            return convertRadix2(Array.from(bytes), 8, bits, !revPadding);\n        },\n        decode: (digits) => {\n            if (!Array.isArray(digits) || (digits.length && typeof digits[0] !== 'number'))\n                throw new Error('radix2.decode input should be array of strings');\n            return Uint8Array.from(convertRadix2(digits, bits, 8, revPadding));\n        },\n    };\n}\nfunction unsafeWrapper(fn) {\n    if (typeof fn !== 'function')\n        throw new Error('unsafeWrapper fn should be function');\n    return function (...args) {\n        try {\n            return fn.apply(null, args);\n        }\n        catch (e) { }\n    };\n}\nfunction checksum(len, fn) {\n    assertNumber(len);\n    if (typeof fn !== 'function')\n        throw new Error('checksum fn should be function');\n    return {\n        encode(data) {\n            if (!(data instanceof Uint8Array))\n                throw new Error('checksum.encode: input should be Uint8Array');\n            const checksum = fn(data).slice(0, len);\n            const res = new Uint8Array(data.length + len);\n            res.set(data);\n            res.set(checksum, data.length);\n            return res;\n        },\n        decode(data) {\n            if (!(data instanceof Uint8Array))\n                throw new Error('checksum.decode: input should be Uint8Array');\n            const payload = data.slice(0, -len);\n            const newChecksum = fn(payload).slice(0, len);\n            const oldChecksum = data.slice(-len);\n            for (let i = 0; i < len; i++)\n                if (newChecksum[i] !== oldChecksum[i])\n                    throw new Error('Invalid checksum');\n            return payload;\n        },\n    };\n}\nexports.utils = { alphabet, chain, checksum, radix, radix2, join, padding };\nexports.base16 = chain(radix2(4), alphabet('0123456789ABCDEF'), join(''));\nexports.base32 = chain(radix2(5), alphabet('ABCDEFGHIJKLMNOPQRSTUVWXYZ234567'), padding(5), join(''));\nexports.base32hex = chain(radix2(5), alphabet('0123456789ABCDEFGHIJKLMNOPQRSTUV'), padding(5), join(''));\nexports.base32crockford = chain(radix2(5), alphabet('0123456789ABCDEFGHJKMNPQRSTVWXYZ'), join(''), normalize((s) => s.toUpperCase().replace(/O/g, '0').replace(/[IL]/g, '1')));\nexports.base64 = chain(radix2(6), alphabet('ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz0123456789+/'), padding(6), join(''));\nexports.base64url = chain(radix2(6), alphabet('ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz0123456789-_'), padding(6), join(''));\nconst genBase58 = (abc) => chain(radix(58), alphabet(abc), join(''));\nexports.base58 = genBase58('123456789ABCDEFGHJKLMNPQRSTUVWXYZabcdefghijkmnopqrstuvwxyz');\nexports.base58flickr = genBase58('123456789abcdefghijkmnopqrstuvwxyzABCDEFGHJKLMNPQRSTUVWXYZ');\nexports.base58xrp = genBase58('rpshnaf39wBUDNEGHJKLM4PQRST7VWXYZ2bcdeCg65jkm8oFqi1tuvAxyz');\nconst XMR_BLOCK_LEN = [0, 2, 3, 5, 6, 7, 9, 10, 11];\nexports.base58xmr = {\n    encode(data) {\n        let res = '';\n        for (let i = 0; i < data.length; i += 8) {\n            const block = data.subarray(i, i + 8);\n            res += exports.base58.encode(block).padStart(XMR_BLOCK_LEN[block.length], '1');\n        }\n        return res;\n    },\n    decode(str) {\n        let res = [];\n        for (let i = 0; i < str.length; i += 11) {\n            const slice = str.slice(i, i + 11);\n            const blockLen = XMR_BLOCK_LEN.indexOf(slice.length);\n            const block = exports.base58.decode(slice);\n            for (let j = 0; j < block.length - blockLen; j++) {\n                if (block[j] !== 0)\n                    throw new Error('base58xmr: wrong padding');\n            }\n            res = res.concat(Array.from(block.slice(block.length - blockLen)));\n        }\n        return Uint8Array.from(res);\n    },\n};\nconst base58check = (sha256) => chain(checksum(4, (data) => sha256(sha256(data))), exports.base58);\nexports.base58check = base58check;\nconst BECH_ALPHABET = chain(alphabet('qpzry9x8gf2tvdw0s3jn54khce6mua7l'), join(''));\nconst POLYMOD_GENERATORS = [0x3b6a57b2, 0x26508e6d, 0x1ea119fa, 0x3d4233dd, 0x2a1462b3];\nfunction bech32Polymod(pre) {\n    const b = pre >> 25;\n    let chk = (pre & 0x1ffffff) << 5;\n    for (let i = 0; i < POLYMOD_GENERATORS.length; i++) {\n        if (((b >> i) & 1) === 1)\n            chk ^= POLYMOD_GENERATORS[i];\n    }\n    return chk;\n}\nfunction bechChecksum(prefix, words, encodingConst = 1) {\n    const len = prefix.length;\n    let chk = 1;\n    for (let i = 0; i < len; i++) {\n        const c = prefix.charCodeAt(i);\n        if (c < 33 || c > 126)\n            throw new Error(`Invalid prefix (${prefix})`);\n        chk = bech32Polymod(chk) ^ (c >> 5);\n    }\n    chk = bech32Polymod(chk);\n    for (let i = 0; i < len; i++)\n        chk = bech32Polymod(chk) ^ (prefix.charCodeAt(i) & 0x1f);\n    for (let v of words)\n        chk = bech32Polymod(chk) ^ v;\n    for (let i = 0; i < 6; i++)\n        chk = bech32Polymod(chk);\n    chk ^= encodingConst;\n    return BECH_ALPHABET.encode(convertRadix2([chk % 2 ** 30], 30, 5, false));\n}\nfunction genBech32(encoding) {\n    const ENCODING_CONST = encoding === 'bech32' ? 1 : 0x2bc830a3;\n    const _words = radix2(5);\n    const fromWords = _words.decode;\n    const toWords = _words.encode;\n    const fromWordsUnsafe = unsafeWrapper(fromWords);\n    function encode(prefix, words, limit = 90) {\n        if (typeof prefix !== 'string')\n            throw new Error(`bech32.encode prefix should be string, not ${typeof prefix}`);\n        if (!Array.isArray(words) || (words.length && typeof words[0] !== 'number'))\n            throw new Error(`bech32.encode words should be array of numbers, not ${typeof words}`);\n        const actualLength = prefix.length + 7 + words.length;\n        if (limit !== false && actualLength > limit)\n            throw new TypeError(`Length ${actualLength} exceeds limit ${limit}`);\n        prefix = prefix.toLowerCase();\n        return `${prefix}1${BECH_ALPHABET.encode(words)}${bechChecksum(prefix, words, ENCODING_CONST)}`;\n    }\n    function decode(str, limit = 90) {\n        if (typeof str !== 'string')\n            throw new Error(`bech32.decode input should be string, not ${typeof str}`);\n        if (str.length < 8 || (limit !== false && str.length > limit))\n            throw new TypeError(`Wrong string length: ${str.length} (${str}). Expected (8..${limit})`);\n        const lowered = str.toLowerCase();\n        if (str !== lowered && str !== str.toUpperCase())\n            throw new Error(`String must be lowercase or uppercase`);\n        str = lowered;\n        const sepIndex = str.lastIndexOf('1');\n        if (sepIndex === 0 || sepIndex === -1)\n            throw new Error(`Letter \"1\" must be present between prefix and data only`);\n        const prefix = str.slice(0, sepIndex);\n        const _words = str.slice(sepIndex + 1);\n        if (_words.length < 6)\n            throw new Error('Data must be at least 6 characters long');\n        const words = BECH_ALPHABET.decode(_words).slice(0, -6);\n        const sum = bechChecksum(prefix, words, ENCODING_CONST);\n        if (!_words.endsWith(sum))\n            throw new Error(`Invalid checksum in ${str}: expected \"${sum}\"`);\n        return { prefix, words };\n    }\n    const decodeUnsafe = unsafeWrapper(decode);\n    function decodeToBytes(str) {\n        const { prefix, words } = decode(str, false);\n        return { prefix, words, bytes: fromWords(words) };\n    }\n    return { encode, decode, decodeToBytes, decodeUnsafe, fromWords, fromWordsUnsafe, toWords };\n}\nexports.bech32 = genBech32('bech32');\nexports.bech32m = genBech32('bech32m');\nexports.utf8 = {\n    encode: (data) => new TextDecoder().decode(data),\n    decode: (str) => new TextEncoder().encode(str),\n};\nexports.hex = chain(radix2(4), alphabet('0123456789abcdef'), join(''), normalize((s) => {\n    if (typeof s !== 'string' || s.length % 2)\n        throw new TypeError(`hex.decode: expected string, got ${typeof s} with length ${s.length}`);\n    return s.toLowerCase();\n}));\nconst CODERS = {\n    utf8: exports.utf8, hex: exports.hex, base16: exports.base16, base32: exports.base32, base64: exports.base64, base64url: exports.base64url, base58: exports.base58, base58xmr: exports.base58xmr\n};\nconst coderTypeError = `Invalid encoding type. Available types: ${Object.keys(CODERS).join(', ')}`;\nconst bytesToString = (type, bytes) => {\n    if (typeof type !== 'string' || !CODERS.hasOwnProperty(type))\n        throw new TypeError(coderTypeError);\n    if (!(bytes instanceof Uint8Array))\n        throw new TypeError('bytesToString() expects Uint8Array');\n    return CODERS[type].encode(bytes);\n};\nexports.bytesToString = bytesToString;\nexports.str = exports.bytesToString;\nconst stringToBytes = (type, str) => {\n    if (!CODERS.hasOwnProperty(type))\n        throw new TypeError(coderTypeError);\n    if (typeof str !== 'string')\n        throw new TypeError('stringToBytes() expects string');\n    return CODERS[type].decode(str);\n};\nexports.stringToBytes = stringToBytes;\nexports.bytes = exports.stringToBytes;\n","const {bech32, hex, utf8} = require('@scure/base')\n\n// defaults for encode; default timestamp is current time at call\nconst DEFAULTNETWORK = {\n  // default network is bitcoin\n  bech32: 'bc',\n  pubKeyHash: 0x00,\n  scriptHash: 0x05,\n  validWitnessVersions: [0]\n}\nconst TESTNETWORK = {\n  bech32: 'tb',\n  pubKeyHash: 0x6f,\n  scriptHash: 0xc4,\n  validWitnessVersions: [0]\n}\nconst SIGNETNETWORK = {\n  bech32: 'tbs',\n  pubKeyHash: 0x6f,\n  scriptHash: 0xc4,\n  validWitnessVersions: [0]\n}\nconst REGTESTNETWORK = {\n  bech32: 'bcrt',\n  pubKeyHash: 0x6f,\n  scriptHash: 0xc4,\n  validWitnessVersions: [0]\n}\nconst SIMNETWORK = {\n  bech32: 'sb',\n  pubKeyHash: 0x3f,\n  scriptHash: 0x7b,\n  validWitnessVersions: [0]\n}\n\nconst FEATUREBIT_ORDER = [\n  'option_data_loss_protect',\n  'initial_routing_sync',\n  'option_upfront_shutdown_script',\n  'gossip_queries',\n  'var_onion_optin',\n  'gossip_queries_ex',\n  'option_static_remotekey',\n  'payment_secret',\n  'basic_mpp',\n  'option_support_large_channel'\n]\n\nconst DIVISORS = {\n  m: BigInt(1e3),\n  u: BigInt(1e6),\n  n: BigInt(1e9),\n  p: BigInt(1e12)\n}\n\nconst MAX_MILLISATS = BigInt('2100000000000000000')\n\nconst MILLISATS_PER_BTC = BigInt(1e11)\n\nconst TAGCODES = {\n  payment_hash: 1,\n  payment_secret: 16,\n  description: 13,\n  payee: 19,\n  description_hash: 23, // commit to longer descriptions (used by lnurl-pay)\n  expiry: 6, // default: 3600 (1 hour)\n  min_final_cltv_expiry: 24, // default: 9\n  fallback_address: 9,\n  route_hint: 3, // for extra routing info (private etc.)\n  feature_bits: 5,\n  metadata: 27\n}\n\n// reverse the keys and values of TAGCODES and insert into TAGNAMES\nconst TAGNAMES = {}\nfor (let i = 0, keys = Object.keys(TAGCODES); i < keys.length; i++) {\n  const currentName = keys[i]\n  const currentCode = TAGCODES[keys[i]].toString()\n  TAGNAMES[currentCode] = currentName\n}\n\nconst TAGPARSERS = {\n  1: words => hex.encode(bech32.fromWordsUnsafe(words)), // 256 bits\n  16: words => hex.encode(bech32.fromWordsUnsafe(words)), // 256 bits\n  13: words => utf8.encode(bech32.fromWordsUnsafe(words)), // string variable length\n  19: words => hex.encode(bech32.fromWordsUnsafe(words)), // 264 bits\n  23: words => hex.encode(bech32.fromWordsUnsafe(words)), // 256 bits\n  27: words => hex.encode(bech32.fromWordsUnsafe(words)), // variable\n  6: wordsToIntBE, // default: 3600 (1 hour)\n  24: wordsToIntBE, // default: 9\n  3: routingInfoParser, // for extra routing info (private etc.)\n  5: featureBitsParser // keep feature bits as array of 5 bit words\n}\n\nfunction getUnknownParser(tagCode) {\n  return words => ({\n    tagCode: parseInt(tagCode),\n    words: bech32.encode('unknown', words, Number.MAX_SAFE_INTEGER)\n  })\n}\n\nfunction wordsToIntBE(words) {\n  return words.reverse().reduce((total, item, index) => {\n    return total + item * Math.pow(32, index)\n  }, 0)\n}\n\n// first convert from words to buffer, trimming padding where necessary\n// parse in 51 byte chunks. See encoder for details.\nfunction routingInfoParser(words) {\n  const routes = []\n  let pubkey,\n    shortChannelId,\n    feeBaseMSats,\n    feeProportionalMillionths,\n    cltvExpiryDelta\n  let routesBuffer = bech32.fromWordsUnsafe(words)\n  while (routesBuffer.length > 0) {\n    pubkey = hex.encode(routesBuffer.slice(0, 33)) // 33 bytes\n    shortChannelId = hex.encode(routesBuffer.slice(33, 41)) // 8 bytes\n    feeBaseMSats = parseInt(hex.encode(routesBuffer.slice(41, 45)), 16) // 4 bytes\n    feeProportionalMillionths = parseInt(\n      hex.encode(routesBuffer.slice(45, 49)),\n      16\n    ) // 4 bytes\n    cltvExpiryDelta = parseInt(hex.encode(routesBuffer.slice(49, 51)), 16) // 2 bytes\n\n    routesBuffer = routesBuffer.slice(51)\n\n    routes.push({\n      pubkey,\n      short_channel_id: shortChannelId,\n      fee_base_msat: feeBaseMSats,\n      fee_proportional_millionths: feeProportionalMillionths,\n      cltv_expiry_delta: cltvExpiryDelta\n    })\n  }\n  return routes\n}\n\nfunction featureBitsParser(words) {\n  const bools = words\n    .slice()\n    .reverse()\n    .map(word => [\n      !!(word & 0b1),\n      !!(word & 0b10),\n      !!(word & 0b100),\n      !!(word & 0b1000),\n      !!(word & 0b10000)\n    ])\n    .reduce((finalArr, itemArr) => finalArr.concat(itemArr), [])\n  while (bools.length < FEATUREBIT_ORDER.length * 2) {\n    bools.push(false)\n  }\n\n  const featureBits = {}\n\n  FEATUREBIT_ORDER.forEach((featureName, index) => {\n    let status\n    if (bools[index * 2]) {\n      status = 'required'\n    } else if (bools[index * 2 + 1]) {\n      status = 'supported'\n    } else {\n      status = 'unsupported'\n    }\n    featureBits[featureName] = status\n  })\n\n  const extraBits = bools.slice(FEATUREBIT_ORDER.length * 2)\n  featureBits.extra_bits = {\n    start_bit: FEATUREBIT_ORDER.length * 2,\n    bits: extraBits,\n    has_required: extraBits.reduce(\n      (result, bit, index) =>\n        index % 2 !== 0 ? result || false : result || bit,\n      false\n    )\n  }\n\n  return featureBits\n}\n\nfunction hrpToMillisat(hrpString, outputString) {\n  let divisor, value\n  if (hrpString.slice(-1).match(/^[munp]$/)) {\n    divisor = hrpString.slice(-1)\n    value = hrpString.slice(0, -1)\n  } else if (hrpString.slice(-1).match(/^[^munp0-9]$/)) {\n    throw new Error('Not a valid multiplier for the amount')\n  } else {\n    value = hrpString\n  }\n\n  if (!value.match(/^\\d+$/))\n    throw new Error('Not a valid human readable amount')\n\n  const valueBN = BigInt(value)\n\n  const millisatoshisBN = divisor\n    ? (valueBN * MILLISATS_PER_BTC) / DIVISORS[divisor]\n    : valueBN * MILLISATS_PER_BTC\n\n  if (\n    (divisor === 'p' && !(valueBN % BigInt(10) === BigInt(0))) ||\n    millisatoshisBN > MAX_MILLISATS\n  ) {\n    throw new Error('Amount is outside of valid range')\n  }\n\n  return outputString ? millisatoshisBN.toString() : millisatoshisBN\n}\n\n// decode will only have extra comments that aren't covered in encode comments.\n// also if anything is hard to read I'll comment.\nfunction decode(paymentRequest, network) {\n  if (typeof paymentRequest !== 'string')\n    throw new Error('Lightning Payment Request must be string')\n  if (paymentRequest.slice(0, 2).toLowerCase() !== 'ln')\n    throw new Error('Not a proper lightning payment request')\n\n  const sections = []\n  const decoded = bech32.decode(paymentRequest, Number.MAX_SAFE_INTEGER)\n  paymentRequest = paymentRequest.toLowerCase()\n  const prefix = decoded.prefix\n  let words = decoded.words\n  let letters = paymentRequest.slice(prefix.length + 1)\n  let sigWords = words.slice(-104)\n  words = words.slice(0, -104)\n\n  // Without reverse lookups, can't say that the multipier at the end must\n  // have a number before it, so instead we parse, and if the second group\n  // doesn't have anything, there's a good chance the last letter of the\n  // coin type got captured by the third group, so just re-regex without\n  // the number.\n  let prefixMatches = prefix.match(/^ln(\\S+?)(\\d*)([a-zA-Z]?)$/)\n  if (prefixMatches && !prefixMatches[2])\n    prefixMatches = prefix.match(/^ln(\\S+)$/)\n  if (!prefixMatches) {\n    throw new Error('Not a proper lightning payment request')\n  }\n\n  // \"ln\" section\n  sections.push({\n    name: 'lightning_network',\n    letters: 'ln'\n  })\n\n  // \"bc\" section\n  const bech32Prefix = prefixMatches[1]\n  let coinNetwork\n  if (!network) {\n    switch (bech32Prefix) {\n      case DEFAULTNETWORK.bech32:\n        coinNetwork = DEFAULTNETWORK\n        break\n      case TESTNETWORK.bech32:\n        coinNetwork = TESTNETWORK\n        break\n      case SIGNETNETWORK.bech32:\n        coinNetwork = SIGNETNETWORK\n        break\n      case REGTESTNETWORK.bech32:\n        coinNetwork = REGTESTNETWORK\n        break\n      case SIMNETWORK.bech32:\n        coinNetwork = SIMNETWORK\n        break\n    }\n  } else {\n    if (\n      network.bech32 === undefined ||\n      network.pubKeyHash === undefined ||\n      network.scriptHash === undefined ||\n      !Array.isArray(network.validWitnessVersions)\n    )\n      throw new Error('Invalid network')\n    coinNetwork = network\n  }\n  if (!coinNetwork || coinNetwork.bech32 !== bech32Prefix) {\n    throw new Error('Unknown coin bech32 prefix')\n  }\n  sections.push({\n    name: 'coin_network',\n    letters: bech32Prefix,\n    value: coinNetwork\n  })\n\n  // amount section\n  const value = prefixMatches[2]\n  let millisatoshis\n  if (value) {\n    const divisor = prefixMatches[3]\n    millisatoshis = hrpToMillisat(value + divisor, true)\n    sections.push({\n      name: 'amount',\n      letters: prefixMatches[2] + prefixMatches[3],\n      value: millisatoshis\n    })\n  } else {\n    millisatoshis = null\n  }\n\n  // \"1\" separator\n  sections.push({\n    name: 'separator',\n    letters: '1'\n  })\n\n  // timestamp\n  const timestamp = wordsToIntBE(words.slice(0, 7))\n  words = words.slice(7) // trim off the left 7 words\n  sections.push({\n    name: 'timestamp',\n    letters: letters.slice(0, 7),\n    value: timestamp\n  })\n  letters = letters.slice(7)\n\n  let tagName, parser, tagLength, tagWords\n  // we have no tag count to go on, so just keep hacking off words\n  // until we have none.\n  while (words.length > 0) {\n    const tagCode = words[0].toString()\n    tagName = TAGNAMES[tagCode] || 'unknown_tag'\n    parser = TAGPARSERS[tagCode] || getUnknownParser(tagCode)\n    words = words.slice(1)\n\n    tagLength = wordsToIntBE(words.slice(0, 2))\n    words = words.slice(2)\n\n    tagWords = words.slice(0, tagLength)\n    words = words.slice(tagLength)\n\n    sections.push({\n      name: tagName,\n      tag: letters[0],\n      letters: letters.slice(0, 1 + 2 + tagLength),\n      value: parser(tagWords) // see: parsers for more comments\n    })\n    letters = letters.slice(1 + 2 + tagLength)\n  }\n\n  // signature\n  sections.push({\n    name: 'signature',\n    letters: letters.slice(0, 104),\n    value: hex.encode(bech32.fromWordsUnsafe(sigWords))\n  })\n  letters = letters.slice(104)\n\n  // checksum\n  sections.push({\n    name: 'checksum',\n    letters: letters\n  })\n\n  let result = {\n    paymentRequest,\n    sections,\n\n    get expiry() {\n      let exp = sections.find(s => s.name === 'expiry')\n      if (exp) return getValue('timestamp') + exp.value\n    },\n\n    get route_hints() {\n      return sections.filter(s => s.name === 'route_hint').map(s => s.value)\n    }\n  }\n\n  for (let name in TAGCODES) {\n    if (name === 'route_hint') {\n      // route hints can be multiple, so this won't work for them\n      continue\n    }\n\n    Object.defineProperty(result, name, {\n      get() {\n        return getValue(name)\n      }\n    })\n  }\n\n  return result\n\n  function getValue(name) {\n    let section = sections.find(s => s.name === name)\n    return section ? section.value : undefined\n  }\n}\n\nmodule.exports = {\n  decode,\n  hrpToMillisat\n}\n","// src/types.ts\nvar NdkNutzapStatus = /* @__PURE__ */ ((NdkNutzapStatus2) => {\n  NdkNutzapStatus2[\"INITIAL\"] = \"initial\";\n  NdkNutzapStatus2[\"PROCESSING\"] = \"processing\";\n  NdkNutzapStatus2[\"REDEEMED\"] = \"redeemed\";\n  NdkNutzapStatus2[\"SPENT\"] = \"spent\";\n  NdkNutzapStatus2[\"MISSING_PRIVKEY\"] = \"missing_privkey\";\n  NdkNutzapStatus2[\"TEMPORARY_ERROR\"] = \"temporary_error\";\n  NdkNutzapStatus2[\"PERMANENT_ERROR\"] = \"permanent_error\";\n  NdkNutzapStatus2[\"INVALID_NUTZAP\"] = \"invalid_nutzap\";\n  return NdkNutzapStatus2;\n})(NdkNutzapStatus || {});\n\n// src/events/kinds/index.ts\nvar NDKKind = /* @__PURE__ */ ((NDKKind2) => {\n  NDKKind2[NDKKind2[\"Metadata\"] = 0] = \"Metadata\";\n  NDKKind2[NDKKind2[\"Text\"] = 1] = \"Text\";\n  NDKKind2[NDKKind2[\"RecommendRelay\"] = 2] = \"RecommendRelay\";\n  NDKKind2[NDKKind2[\"Contacts\"] = 3] = \"Contacts\";\n  NDKKind2[NDKKind2[\"EncryptedDirectMessage\"] = 4] = \"EncryptedDirectMessage\";\n  NDKKind2[NDKKind2[\"EventDeletion\"] = 5] = \"EventDeletion\";\n  NDKKind2[NDKKind2[\"Repost\"] = 6] = \"Repost\";\n  NDKKind2[NDKKind2[\"Reaction\"] = 7] = \"Reaction\";\n  NDKKind2[NDKKind2[\"BadgeAward\"] = 8] = \"BadgeAward\";\n  NDKKind2[NDKKind2[\"GroupChat\"] = 9] = \"GroupChat\";\n  NDKKind2[NDKKind2[\"GroupNote\"] = 11] = \"GroupNote\";\n  NDKKind2[NDKKind2[\"GroupReply\"] = 12] = \"GroupReply\";\n  NDKKind2[NDKKind2[\"GiftWrapSeal\"] = 13] = \"GiftWrapSeal\";\n  NDKKind2[NDKKind2[\"PrivateDirectMessage\"] = 14] = \"PrivateDirectMessage\";\n  NDKKind2[NDKKind2[\"Image\"] = 20] = \"Image\";\n  NDKKind2[NDKKind2[\"Video\"] = 21] = \"Video\";\n  NDKKind2[NDKKind2[\"ShortVideo\"] = 22] = \"ShortVideo\";\n  NDKKind2[NDKKind2[\"Story\"] = 23] = \"Story\";\n  NDKKind2[NDKKind2[\"Vanish\"] = 62] = \"Vanish\";\n  NDKKind2[NDKKind2[\"CashuWalletBackup\"] = 375] = \"CashuWalletBackup\";\n  NDKKind2[NDKKind2[\"GiftWrap\"] = 1059] = \"GiftWrap\";\n  NDKKind2[NDKKind2[\"GenericRepost\"] = 16] = \"GenericRepost\";\n  NDKKind2[NDKKind2[\"ChannelCreation\"] = 40] = \"ChannelCreation\";\n  NDKKind2[NDKKind2[\"ChannelMetadata\"] = 41] = \"ChannelMetadata\";\n  NDKKind2[NDKKind2[\"ChannelMessage\"] = 42] = \"ChannelMessage\";\n  NDKKind2[NDKKind2[\"ChannelHideMessage\"] = 43] = \"ChannelHideMessage\";\n  NDKKind2[NDKKind2[\"ChannelMuteUser\"] = 44] = \"ChannelMuteUser\";\n  NDKKind2[NDKKind2[\"GenericReply\"] = 1111] = \"GenericReply\";\n  NDKKind2[NDKKind2[\"Media\"] = 1063] = \"Media\";\n  NDKKind2[NDKKind2[\"Report\"] = 1984] = \"Report\";\n  NDKKind2[NDKKind2[\"Label\"] = 1985] = \"Label\";\n  NDKKind2[NDKKind2[\"DVMReqTextExtraction\"] = 5e3] = \"DVMReqTextExtraction\";\n  NDKKind2[NDKKind2[\"DVMReqTextSummarization\"] = 5001] = \"DVMReqTextSummarization\";\n  NDKKind2[NDKKind2[\"DVMReqTextTranslation\"] = 5002] = \"DVMReqTextTranslation\";\n  NDKKind2[NDKKind2[\"DVMReqTextGeneration\"] = 5050] = \"DVMReqTextGeneration\";\n  NDKKind2[NDKKind2[\"DVMReqImageGeneration\"] = 5100] = \"DVMReqImageGeneration\";\n  NDKKind2[NDKKind2[\"DVMReqTextToSpeech\"] = 5250] = \"DVMReqTextToSpeech\";\n  NDKKind2[NDKKind2[\"DVMReqDiscoveryNostrContent\"] = 5300] = \"DVMReqDiscoveryNostrContent\";\n  NDKKind2[NDKKind2[\"DVMReqDiscoveryNostrPeople\"] = 5301] = \"DVMReqDiscoveryNostrPeople\";\n  NDKKind2[NDKKind2[\"DVMReqTimestamping\"] = 5900] = \"DVMReqTimestamping\";\n  NDKKind2[NDKKind2[\"DVMEventSchedule\"] = 5905] = \"DVMEventSchedule\";\n  NDKKind2[NDKKind2[\"DVMJobFeedback\"] = 7e3] = \"DVMJobFeedback\";\n  NDKKind2[NDKKind2[\"Subscribe\"] = 7001] = \"Subscribe\";\n  NDKKind2[NDKKind2[\"Unsubscribe\"] = 7002] = \"Unsubscribe\";\n  NDKKind2[NDKKind2[\"SubscriptionReceipt\"] = 7003] = \"SubscriptionReceipt\";\n  NDKKind2[NDKKind2[\"CashuReserve\"] = 7373] = \"CashuReserve\";\n  NDKKind2[NDKKind2[\"CashuQuote\"] = 7374] = \"CashuQuote\";\n  NDKKind2[NDKKind2[\"CashuToken\"] = 7375] = \"CashuToken\";\n  NDKKind2[NDKKind2[\"CashuWalletTx\"] = 7376] = \"CashuWalletTx\";\n  NDKKind2[NDKKind2[\"GroupAdminAddUser\"] = 9e3] = \"GroupAdminAddUser\";\n  NDKKind2[NDKKind2[\"GroupAdminRemoveUser\"] = 9001] = \"GroupAdminRemoveUser\";\n  NDKKind2[NDKKind2[\"GroupAdminEditMetadata\"] = 9002] = \"GroupAdminEditMetadata\";\n  NDKKind2[NDKKind2[\"GroupAdminEditStatus\"] = 9006] = \"GroupAdminEditStatus\";\n  NDKKind2[NDKKind2[\"GroupAdminCreateGroup\"] = 9007] = \"GroupAdminCreateGroup\";\n  NDKKind2[NDKKind2[\"GroupAdminRequestJoin\"] = 9021] = \"GroupAdminRequestJoin\";\n  NDKKind2[NDKKind2[\"MuteList\"] = 1e4] = \"MuteList\";\n  NDKKind2[NDKKind2[\"PinList\"] = 10001] = \"PinList\";\n  NDKKind2[NDKKind2[\"RelayList\"] = 10002] = \"RelayList\";\n  NDKKind2[NDKKind2[\"BookmarkList\"] = 10003] = \"BookmarkList\";\n  NDKKind2[NDKKind2[\"CommunityList\"] = 10004] = \"CommunityList\";\n  NDKKind2[NDKKind2[\"PublicChatList\"] = 10005] = \"PublicChatList\";\n  NDKKind2[NDKKind2[\"BlockRelayList\"] = 10006] = \"BlockRelayList\";\n  NDKKind2[NDKKind2[\"SearchRelayList\"] = 10007] = \"SearchRelayList\";\n  NDKKind2[NDKKind2[\"SimpleGroupList\"] = 10009] = \"SimpleGroupList\";\n  NDKKind2[NDKKind2[\"InterestList\"] = 10015] = \"InterestList\";\n  NDKKind2[NDKKind2[\"CashuMintList\"] = 10019] = \"CashuMintList\";\n  NDKKind2[NDKKind2[\"EmojiList\"] = 10030] = \"EmojiList\";\n  NDKKind2[NDKKind2[\"DirectMessageReceiveRelayList\"] = 10050] = \"DirectMessageReceiveRelayList\";\n  NDKKind2[NDKKind2[\"BlossomList\"] = 10063] = \"BlossomList\";\n  NDKKind2[NDKKind2[\"NostrWaletConnectInfo\"] = 13194] = \"NostrWaletConnectInfo\";\n  NDKKind2[NDKKind2[\"TierList\"] = 17e3] = \"TierList\";\n  NDKKind2[NDKKind2[\"CashuWallet\"] = 17375] = \"CashuWallet\";\n  NDKKind2[NDKKind2[\"FollowSet\"] = 3e4] = \"FollowSet\";\n  NDKKind2[NDKKind2[\"CategorizedPeopleList\"] = 3e4 /* FollowSet */] = \"CategorizedPeopleList\";\n  NDKKind2[NDKKind2[\"CategorizedBookmarkList\"] = 30001] = \"CategorizedBookmarkList\";\n  NDKKind2[NDKKind2[\"RelaySet\"] = 30002] = \"RelaySet\";\n  NDKKind2[NDKKind2[\"CategorizedRelayList\"] = 30002 /* RelaySet */] = \"CategorizedRelayList\";\n  NDKKind2[NDKKind2[\"BookmarkSet\"] = 30003] = \"BookmarkSet\";\n  NDKKind2[NDKKind2[\"CurationSet\"] = 30004] = \"CurationSet\";\n  NDKKind2[NDKKind2[\"ArticleCurationSet\"] = 30004] = \"ArticleCurationSet\";\n  NDKKind2[NDKKind2[\"VideoCurationSet\"] = 30005] = \"VideoCurationSet\";\n  NDKKind2[NDKKind2[\"ImageCurationSet\"] = 30006] = \"ImageCurationSet\";\n  NDKKind2[NDKKind2[\"InterestSet\"] = 30015] = \"InterestSet\";\n  NDKKind2[NDKKind2[\"InterestsList\"] = 30015 /* InterestSet */] = \"InterestsList\";\n  NDKKind2[NDKKind2[\"EmojiSet\"] = 30030] = \"EmojiSet\";\n  NDKKind2[NDKKind2[\"ModularArticle\"] = 30040] = \"ModularArticle\";\n  NDKKind2[NDKKind2[\"ModularArticleItem\"] = 30041] = \"ModularArticleItem\";\n  NDKKind2[NDKKind2[\"Wiki\"] = 30818] = \"Wiki\";\n  NDKKind2[NDKKind2[\"Draft\"] = 31234] = \"Draft\";\n  NDKKind2[NDKKind2[\"SubscriptionTier\"] = 37001] = \"SubscriptionTier\";\n  NDKKind2[NDKKind2[\"EcashMintRecommendation\"] = 38e3] = \"EcashMintRecommendation\";\n  NDKKind2[NDKKind2[\"HighlightSet\"] = 39802] = \"HighlightSet\";\n  NDKKind2[NDKKind2[\"CategorizedHighlightList\"] = 39802 /* HighlightSet */] = \"CategorizedHighlightList\";\n  NDKKind2[NDKKind2[\"Nutzap\"] = 9321] = \"Nutzap\";\n  NDKKind2[NDKKind2[\"ZapRequest\"] = 9734] = \"ZapRequest\";\n  NDKKind2[NDKKind2[\"Zap\"] = 9735] = \"Zap\";\n  NDKKind2[NDKKind2[\"Highlight\"] = 9802] = \"Highlight\";\n  NDKKind2[NDKKind2[\"ClientAuth\"] = 22242] = \"ClientAuth\";\n  NDKKind2[NDKKind2[\"NostrWalletConnectReq\"] = 23194] = \"NostrWalletConnectReq\";\n  NDKKind2[NDKKind2[\"NostrWalletConnectRes\"] = 23195] = \"NostrWalletConnectRes\";\n  NDKKind2[NDKKind2[\"NostrConnect\"] = 24133] = \"NostrConnect\";\n  NDKKind2[NDKKind2[\"BlossomUpload\"] = 24242] = \"BlossomUpload\";\n  NDKKind2[NDKKind2[\"HttpAuth\"] = 27235] = \"HttpAuth\";\n  NDKKind2[NDKKind2[\"ProfileBadge\"] = 30008] = \"ProfileBadge\";\n  NDKKind2[NDKKind2[\"BadgeDefinition\"] = 30009] = \"BadgeDefinition\";\n  NDKKind2[NDKKind2[\"MarketStall\"] = 30017] = \"MarketStall\";\n  NDKKind2[NDKKind2[\"MarketProduct\"] = 30018] = \"MarketProduct\";\n  NDKKind2[NDKKind2[\"Article\"] = 30023] = \"Article\";\n  NDKKind2[NDKKind2[\"AppSpecificData\"] = 30078] = \"AppSpecificData\";\n  NDKKind2[NDKKind2[\"Classified\"] = 30402] = \"Classified\";\n  NDKKind2[NDKKind2[\"HorizontalVideo\"] = 34235] = \"HorizontalVideo\";\n  NDKKind2[NDKKind2[\"VerticalVideo\"] = 34236] = \"VerticalVideo\";\n  NDKKind2[NDKKind2[\"LegacyCashuWallet\"] = 37375] = \"LegacyCashuWallet\";\n  NDKKind2[NDKKind2[\"GroupMetadata\"] = 39e3] = \"GroupMetadata\";\n  NDKKind2[NDKKind2[\"GroupAdmins\"] = 39001] = \"GroupAdmins\";\n  NDKKind2[NDKKind2[\"GroupMembers\"] = 39002] = \"GroupMembers\";\n  NDKKind2[NDKKind2[\"AppRecommendation\"] = 31989] = \"AppRecommendation\";\n  NDKKind2[NDKKind2[\"AppHandler\"] = 31990] = \"AppHandler\";\n  return NDKKind2;\n})(NDKKind || {});\nvar NDKListKinds = [\n  1e4 /* MuteList */,\n  10001 /* PinList */,\n  10002 /* RelayList */,\n  10003 /* BookmarkList */,\n  10004 /* CommunityList */,\n  10005 /* PublicChatList */,\n  10006 /* BlockRelayList */,\n  10007 /* SearchRelayList */,\n  10015 /* InterestList */,\n  10030 /* EmojiList */,\n  10050 /* DirectMessageReceiveRelayList */,\n  3e4 /* FollowSet */,\n  30003 /* BookmarkSet */,\n  30001 /* CategorizedBookmarkList */,\n  // Backwards compatibility\n  30002 /* RelaySet */,\n  30004 /* ArticleCurationSet */,\n  30005 /* VideoCurationSet */,\n  30015 /* InterestSet */,\n  30030 /* EmojiSet */,\n  39802 /* HighlightSet */\n];\n\n// src/events/index.ts\nimport { EventEmitter as EventEmitter2 } from \"tseep\";\n\n// src/relay/sets/calculate.ts\nimport createDebug from \"debug\";\n\n// src/outbox/write.ts\nfunction getRelaysForSync(ndk, author, type = \"write\") {\n  if (!ndk.outboxTracker) return void 0;\n  const item = ndk.outboxTracker.data.get(author);\n  if (!item) return void 0;\n  if (type === \"write\") {\n    return item.writeRelays;\n  }\n  return item.readRelays;\n}\nasync function getWriteRelaysFor(ndk, author, type = \"write\") {\n  if (!ndk.outboxTracker) return void 0;\n  if (!ndk.outboxTracker.data.has(author)) {\n    await ndk.outboxTracker.trackUsers([author]);\n  }\n  return getRelaysForSync(ndk, author, type);\n}\n\n// src/outbox/relay-ranking.ts\nfunction getTopRelaysForAuthors(ndk, authors) {\n  const relaysWithCount = /* @__PURE__ */ new Map();\n  authors.forEach((author) => {\n    const writeRelays = getRelaysForSync(ndk, author);\n    if (writeRelays) {\n      writeRelays.forEach((relay) => {\n        const count = relaysWithCount.get(relay) || 0;\n        relaysWithCount.set(relay, count + 1);\n      });\n    }\n  });\n  const sortedRelays = Array.from(relaysWithCount.entries()).sort((a, b) => b[1] - a[1]);\n  return sortedRelays.map((entry) => entry[0]);\n}\n\n// src/outbox/index.ts\nfunction getAllRelaysForAllPubkeys(ndk, pubkeys, type = \"read\") {\n  const pubkeysToRelays = /* @__PURE__ */ new Map();\n  const authorsMissingRelays = /* @__PURE__ */ new Set();\n  pubkeys.forEach((pubkey) => {\n    const relays = getRelaysForSync(ndk, pubkey, type);\n    if (relays && relays.size > 0) {\n      relays.forEach((relay) => {\n        const pubkeysInRelay = pubkeysToRelays.get(relay) || /* @__PURE__ */ new Set();\n        pubkeysInRelay.add(pubkey);\n      });\n      pubkeysToRelays.set(pubkey, relays);\n    } else {\n      authorsMissingRelays.add(pubkey);\n    }\n  });\n  return { pubkeysToRelays, authorsMissingRelays };\n}\nfunction chooseRelayCombinationForPubkeys(ndk, pubkeys, type, { count, preferredRelays } = {}) {\n  count ??= 2;\n  preferredRelays ??= /* @__PURE__ */ new Set();\n  const pool = ndk.pool;\n  const connectedRelays = pool.connectedRelays();\n  connectedRelays.forEach((relay) => {\n    preferredRelays?.add(relay.url);\n  });\n  const relayToAuthorsMap = /* @__PURE__ */ new Map();\n  const { pubkeysToRelays, authorsMissingRelays } = getAllRelaysForAllPubkeys(ndk, pubkeys, type);\n  const sortedRelays = getTopRelaysForAuthors(ndk, pubkeys);\n  const addAuthorToRelay = (author, relay) => {\n    const authorsInRelay = relayToAuthorsMap.get(relay) || [];\n    authorsInRelay.push(author);\n    relayToAuthorsMap.set(relay, authorsInRelay);\n  };\n  for (const [author, authorRelays] of pubkeysToRelays.entries()) {\n    let missingRelayCount = count;\n    for (const relay of connectedRelays) {\n      if (authorRelays.has(relay.url)) {\n        addAuthorToRelay(author, relay.url);\n        missingRelayCount--;\n      }\n    }\n    for (const authorRelay of authorRelays) {\n      if (relayToAuthorsMap.has(authorRelay)) {\n        addAuthorToRelay(author, authorRelay);\n        missingRelayCount--;\n      }\n    }\n    if (missingRelayCount <= 0) continue;\n    for (const relay of sortedRelays) {\n      if (missingRelayCount <= 0) break;\n      if (authorRelays.has(relay)) {\n        addAuthorToRelay(author, relay);\n        missingRelayCount--;\n      }\n    }\n  }\n  for (const author of authorsMissingRelays) {\n    pool.permanentAndConnectedRelays().forEach((relay) => {\n      const authorsInRelay = relayToAuthorsMap.get(relay.url) || [];\n      authorsInRelay.push(author);\n      relayToAuthorsMap.set(relay.url, authorsInRelay);\n    });\n  }\n  return relayToAuthorsMap;\n}\n\n// src/outbox/read/with-authors.ts\nfunction getRelaysForFilterWithAuthors(ndk, authors, relayGoalPerAuthor = 2) {\n  return chooseRelayCombinationForPubkeys(ndk, authors, \"write\", { count: relayGoalPerAuthor });\n}\n\n// src/utils/normalize-url.ts\nfunction tryNormalizeRelayUrl(url) {\n  try {\n    return normalizeRelayUrl(url);\n  } catch {\n    return void 0;\n  }\n}\nfunction normalizeRelayUrl(url) {\n  let r = normalizeUrl(url, {\n    stripAuthentication: false,\n    stripWWW: false,\n    stripHash: true\n  });\n  if (!r.endsWith(\"/\")) {\n    r += \"/\";\n  }\n  return r;\n}\nfunction normalize(urls) {\n  const normalized = /* @__PURE__ */ new Set();\n  for (const url of urls) {\n    try {\n      normalized.add(normalizeRelayUrl(url));\n    } catch {\n    }\n  }\n  return Array.from(normalized);\n}\nvar DATA_URL_DEFAULT_MIME_TYPE = \"text/plain\";\nvar DATA_URL_DEFAULT_CHARSET = \"us-ascii\";\nvar testParameter = (name, filters) => filters.some((filter) => filter instanceof RegExp ? filter.test(name) : filter === name);\nvar supportedProtocols = /* @__PURE__ */ new Set([\"https:\", \"http:\", \"file:\"]);\nvar hasCustomProtocol = (urlString) => {\n  try {\n    const { protocol } = new URL(urlString);\n    return protocol.endsWith(\":\") && !protocol.includes(\".\") && !supportedProtocols.has(protocol);\n  } catch {\n    return false;\n  }\n};\nvar normalizeDataURL = (urlString, { stripHash }) => {\n  const match = /^data:(?<type>[^,]*?),(?<data>[^#]*?)(?:#(?<hash>.*))?$/.exec(urlString);\n  if (!match) {\n    throw new Error(`Invalid URL: ${urlString}`);\n  }\n  const type = match.groups?.type ?? \"\";\n  const data = match.groups?.data ?? \"\";\n  let hash = match.groups?.hash ?? \"\";\n  const mediaType = type.split(\";\");\n  hash = stripHash ? \"\" : hash;\n  let isBase64 = false;\n  if (mediaType[mediaType.length - 1] === \"base64\") {\n    mediaType.pop();\n    isBase64 = true;\n  }\n  const mimeType = mediaType.shift()?.toLowerCase() ?? \"\";\n  const attributes = mediaType.map((attribute) => {\n    let [key, value = \"\"] = attribute.split(\"=\").map((string) => string.trim());\n    if (key === \"charset\") {\n      value = value.toLowerCase();\n      if (value === DATA_URL_DEFAULT_CHARSET) {\n        return \"\";\n      }\n    }\n    return `${key}${value ? `=${value}` : \"\"}`;\n  }).filter(Boolean);\n  const normalizedMediaType = [...attributes];\n  if (isBase64) {\n    normalizedMediaType.push(\"base64\");\n  }\n  if (normalizedMediaType.length > 0 || mimeType && mimeType !== DATA_URL_DEFAULT_MIME_TYPE) {\n    normalizedMediaType.unshift(mimeType);\n  }\n  return `data:${normalizedMediaType.join(\";\")},${isBase64 ? data.trim() : data}${hash ? `#${hash}` : \"\"}`;\n};\nfunction normalizeUrl(urlString, options = {}) {\n  options = {\n    defaultProtocol: \"http\",\n    normalizeProtocol: true,\n    forceHttp: false,\n    forceHttps: false,\n    stripAuthentication: true,\n    stripHash: false,\n    stripTextFragment: true,\n    stripWWW: true,\n    removeQueryParameters: [/^utm_\\w+/i],\n    removeTrailingSlash: true,\n    removeSingleSlash: true,\n    removeDirectoryIndex: false,\n    removeExplicitPort: false,\n    sortQueryParameters: true,\n    ...options\n  };\n  if (typeof options.defaultProtocol === \"string\" && !options.defaultProtocol.endsWith(\":\")) {\n    options.defaultProtocol = `${options.defaultProtocol}:`;\n  }\n  urlString = urlString.trim();\n  if (/^data:/i.test(urlString)) {\n    return normalizeDataURL(urlString, options);\n  }\n  if (hasCustomProtocol(urlString)) {\n    return urlString;\n  }\n  const hasRelativeProtocol = urlString.startsWith(\"//\");\n  const isRelativeUrl = !hasRelativeProtocol && /^\\.*\\//.test(urlString);\n  if (!isRelativeUrl) {\n    urlString = urlString.replace(/^(?!(?:\\w+:)?\\/\\/)|^\\/\\//, options.defaultProtocol);\n  }\n  const urlObject = new URL(urlString);\n  urlObject.hostname = urlObject.hostname.toLowerCase();\n  if (options.forceHttp && options.forceHttps) {\n    throw new Error(\"The `forceHttp` and `forceHttps` options cannot be used together\");\n  }\n  if (options.forceHttp && urlObject.protocol === \"https:\") {\n    urlObject.protocol = \"http:\";\n  }\n  if (options.forceHttps && urlObject.protocol === \"http:\") {\n    urlObject.protocol = \"https:\";\n  }\n  if (options.stripAuthentication) {\n    urlObject.username = \"\";\n    urlObject.password = \"\";\n  }\n  if (options.stripHash) {\n    urlObject.hash = \"\";\n  } else if (options.stripTextFragment) {\n    urlObject.hash = urlObject.hash.replace(/#?:~:text.*?$/i, \"\");\n  }\n  if (urlObject.pathname) {\n    const protocolRegex = /\\b[a-z][a-z\\d+\\-.]{1,50}:\\/\\//g;\n    let lastIndex = 0;\n    let result = \"\";\n    for (; ; ) {\n      const match = protocolRegex.exec(urlObject.pathname);\n      if (!match) {\n        break;\n      }\n      const protocol = match[0];\n      const protocolAtIndex = match.index;\n      const intermediate = urlObject.pathname.slice(lastIndex, protocolAtIndex);\n      result += intermediate.replace(/\\/{2,}/g, \"/\");\n      result += protocol;\n      lastIndex = protocolAtIndex + protocol.length;\n    }\n    const remnant = urlObject.pathname.slice(lastIndex, urlObject.pathname.length);\n    result += remnant.replace(/\\/{2,}/g, \"/\");\n    urlObject.pathname = result;\n  }\n  if (urlObject.pathname) {\n    try {\n      urlObject.pathname = decodeURI(urlObject.pathname);\n    } catch {\n    }\n  }\n  if (options.removeDirectoryIndex === true) {\n    options.removeDirectoryIndex = [/^index\\.[a-z]+$/];\n  }\n  if (Array.isArray(options.removeDirectoryIndex) && options.removeDirectoryIndex.length > 0) {\n    let pathComponents = urlObject.pathname.split(\"/\");\n    const lastComponent = pathComponents[pathComponents.length - 1];\n    if (testParameter(lastComponent, options.removeDirectoryIndex)) {\n      pathComponents = pathComponents.slice(0, -1);\n      urlObject.pathname = `${pathComponents.slice(1).join(\"/\")}/`;\n    }\n  }\n  if (urlObject.hostname) {\n    urlObject.hostname = urlObject.hostname.replace(/\\.$/, \"\");\n    if (options.stripWWW && /^www\\.(?!www\\.)[a-z\\-\\d]{1,63}\\.[a-z.\\-\\d]{2,63}$/.test(urlObject.hostname)) {\n      urlObject.hostname = urlObject.hostname.replace(/^www\\./, \"\");\n    }\n  }\n  if (Array.isArray(options.removeQueryParameters)) {\n    for (const key of [...urlObject.searchParams.keys()]) {\n      if (testParameter(key, options.removeQueryParameters)) {\n        urlObject.searchParams.delete(key);\n      }\n    }\n  }\n  if (!Array.isArray(options.keepQueryParameters) && options.removeQueryParameters === true) {\n    urlObject.search = \"\";\n  }\n  if (Array.isArray(options.keepQueryParameters) && options.keepQueryParameters.length > 0) {\n    for (const key of [...urlObject.searchParams.keys()]) {\n      if (!testParameter(key, options.keepQueryParameters)) {\n        urlObject.searchParams.delete(key);\n      }\n    }\n  }\n  if (options.sortQueryParameters) {\n    urlObject.searchParams.sort();\n    try {\n      urlObject.search = decodeURIComponent(urlObject.search);\n    } catch {\n    }\n  }\n  if (options.removeTrailingSlash) {\n    urlObject.pathname = urlObject.pathname.replace(/\\/$/, \"\");\n  }\n  if (options.removeExplicitPort && urlObject.port) {\n    urlObject.port = \"\";\n  }\n  const oldUrlString = urlString;\n  urlString = urlObject.toString();\n  if (!options.removeSingleSlash && urlObject.pathname === \"/\" && !oldUrlString.endsWith(\"/\") && urlObject.hash === \"\") {\n    urlString = urlString.replace(/\\/$/, \"\");\n  }\n  if ((options.removeTrailingSlash || urlObject.pathname === \"/\") && urlObject.hash === \"\" && options.removeSingleSlash) {\n    urlString = urlString.replace(/\\/$/, \"\");\n  }\n  if (hasRelativeProtocol && !options.normalizeProtocol) {\n    urlString = urlString.replace(/^http:\\/\\//, \"//\");\n  }\n  if (options.stripProtocol) {\n    urlString = urlString.replace(/^(?:https?:)?\\/\\//, \"\");\n  }\n  return urlString;\n}\n\n// src/relay/index.ts\nimport debug from \"debug\";\nimport { EventEmitter } from \"tseep\";\n\n// src/relay/connectivity.ts\nvar MAX_RECONNECT_ATTEMPTS = 5;\nvar FLAPPING_THRESHOLD_MS = 1e3;\nvar NDKRelayConnectivity = class {\n  ndkRelay;\n  ws;\n  _status;\n  timeoutMs;\n  connectedAt;\n  _connectionStats = {\n    attempts: 0,\n    success: 0,\n    durations: []\n  };\n  debug;\n  netDebug;\n  connectTimeout;\n  reconnectTimeout;\n  ndk;\n  openSubs = /* @__PURE__ */ new Map();\n  openCountRequests = /* @__PURE__ */ new Map();\n  openEventPublishes = /* @__PURE__ */ new Map();\n  serial = 0;\n  baseEoseTimeout = 4400;\n  constructor(ndkRelay, ndk) {\n    this.ndkRelay = ndkRelay;\n    this._status = 1 /* DISCONNECTED */;\n    const rand = Math.floor(Math.random() * 1e3);\n    this.debug = this.ndkRelay.debug.extend(`connectivity${rand}`);\n    this.ndk = ndk;\n  }\n  /**\n   * Connects to the NDK relay and handles the connection lifecycle.\n   *\n   * This method attempts to establish a WebSocket connection to the NDK relay specified in the `ndkRelay` object.\n   * If the connection is successful, it updates the connection statistics, sets the connection status to `CONNECTED`,\n   * and emits `connect` and `ready` events on the `ndkRelay` object.\n   *\n   * If the connection attempt fails, it handles the error by either initiating a reconnection attempt or emitting a\n   * `delayed-connect` event on the `ndkRelay` object, depending on the `reconnect` parameter.\n   *\n   * @param timeoutMs - The timeout in milliseconds for the connection attempt. If not provided, the default timeout from the `ndkRelay` object is used.\n   * @param reconnect - Indicates whether a reconnection should be attempted if the connection fails. Defaults to `true`.\n   * @returns A Promise that resolves when the connection is established, or rejects if the connection fails.\n   */\n  async connect(timeoutMs, reconnect = true) {\n    if (this._status !== 2 /* RECONNECTING */ && this._status !== 1 /* DISCONNECTED */ || this.reconnectTimeout) {\n      this.debug(\n        \"Relay requested to be connected but was in state %s or it had a reconnect timeout\",\n        this._status\n      );\n      return;\n    }\n    if (this.reconnectTimeout) {\n      clearTimeout(this.reconnectTimeout);\n      this.reconnectTimeout = void 0;\n    }\n    if (this.connectTimeout) {\n      clearTimeout(this.connectTimeout);\n      this.connectTimeout = void 0;\n    }\n    timeoutMs ??= this.timeoutMs;\n    if (!this.timeoutMs && timeoutMs) this.timeoutMs = timeoutMs;\n    if (this.timeoutMs) this.connectTimeout = setTimeout(() => this.onConnectionError(reconnect), this.timeoutMs);\n    try {\n      this.updateConnectionStats.attempt();\n      if (this._status === 1 /* DISCONNECTED */) this._status = 4 /* CONNECTING */;\n      else this._status = 2 /* RECONNECTING */;\n      this.ws = new WebSocket(this.ndkRelay.url);\n      this.ws.onopen = this.onConnect.bind(this);\n      this.ws.onclose = this.onDisconnect.bind(this);\n      this.ws.onmessage = this.onMessage.bind(this);\n      this.ws.onerror = this.onError.bind(this);\n    } catch (e) {\n      this.debug(`Failed to connect to ${this.ndkRelay.url}`, e);\n      this._status = 1 /* DISCONNECTED */;\n      if (reconnect) this.handleReconnection();\n      else this.ndkRelay.emit(\"delayed-connect\", 2 * 24 * 60 * 60 * 1e3);\n      throw e;\n    }\n  }\n  /**\n   * Disconnects the WebSocket connection to the NDK relay.\n   * This method sets the connection status to `NDKRelayStatus.DISCONNECTING`,\n   * attempts to close the WebSocket connection, and sets the status to\n   * `NDKRelayStatus.DISCONNECTED` if the disconnect operation fails.\n   */\n  disconnect() {\n    this._status = 0 /* DISCONNECTING */;\n    try {\n      this.ws?.close();\n    } catch (e) {\n      this.debug(\"Failed to disconnect\", e);\n      this._status = 1 /* DISCONNECTED */;\n    }\n  }\n  /**\n   * Handles the error that occurred when attempting to connect to the NDK relay.\n   * If `reconnect` is `true`, this method will initiate a reconnection attempt.\n   * Otherwise, it will emit a `delayed-connect` event on the `ndkRelay` object,\n   * indicating that a reconnection should be attempted after a delay.\n   *\n   * @param reconnect - Indicates whether a reconnection should be attempted.\n   */\n  onConnectionError(reconnect) {\n    this.debug(`Error connecting to ${this.ndkRelay.url}`, this.timeoutMs);\n    if (reconnect && !this.reconnectTimeout) {\n      this.handleReconnection();\n    }\n  }\n  /**\n   * Handles the connection event when the WebSocket connection is established.\n   * This method is called when the WebSocket connection is successfully opened.\n   * It clears any existing connection and reconnection timeouts, updates the connection statistics,\n   * sets the connection status to `CONNECTED`, and emits `connect` and `ready` events on the `ndkRelay` object.\n   */\n  onConnect() {\n    this.netDebug?.(\"connected\", this.ndkRelay);\n    if (this.reconnectTimeout) {\n      clearTimeout(this.reconnectTimeout);\n      this.reconnectTimeout = void 0;\n    }\n    if (this.connectTimeout) {\n      clearTimeout(this.connectTimeout);\n      this.connectTimeout = void 0;\n    }\n    this.updateConnectionStats.connected();\n    this._status = 5 /* CONNECTED */;\n    this.ndkRelay.emit(\"connect\");\n    this.ndkRelay.emit(\"ready\");\n  }\n  /**\n   * Handles the disconnection event when the WebSocket connection is closed.\n   * This method is called when the WebSocket connection is successfully closed.\n   * It updates the connection statistics, sets the connection status to `DISCONNECTED`,\n   * initiates a reconnection attempt if we didn't disconnect ourselves,\n   * and emits a `disconnect` event on the `ndkRelay` object.\n   */\n  onDisconnect() {\n    this.netDebug?.(\"disconnected\", this.ndkRelay);\n    this.updateConnectionStats.disconnected();\n    if (this._status === 5 /* CONNECTED */) {\n      this.handleReconnection();\n    }\n    this._status = 1 /* DISCONNECTED */;\n    this.ndkRelay.emit(\"disconnect\");\n  }\n  /**\n   * Handles incoming messages from the NDK relay WebSocket connection.\n   * This method is called whenever a message is received from the relay.\n   * It parses the message data and dispatches the appropriate handling logic based on the message type.\n   *\n   * @param event - The MessageEvent containing the received message data.\n   */\n  onMessage(event) {\n    this.netDebug?.(event.data, this.ndkRelay, \"recv\");\n    try {\n      const data = JSON.parse(event.data);\n      const [cmd, id, ..._rest] = data;\n      switch (cmd) {\n        case \"EVENT\": {\n          const so = this.openSubs.get(id);\n          const event2 = data[2];\n          if (!so) {\n            this.debug(`Received event for unknown subscription ${id}`);\n            return;\n          }\n          so.onevent(event2);\n          return;\n        }\n        case \"COUNT\": {\n          const payload = data[2];\n          const cr = this.openCountRequests.get(id);\n          if (cr) {\n            cr.resolve(payload.count);\n            this.openCountRequests.delete(id);\n          }\n          return;\n        }\n        case \"EOSE\": {\n          const so = this.openSubs.get(id);\n          if (!so) return;\n          so.oneose(id);\n          return;\n        }\n        case \"OK\": {\n          const ok = data[2];\n          const reason = data[3];\n          const ep = this.openEventPublishes.get(id);\n          const firstEp = ep?.pop();\n          if (!ep || !firstEp) {\n            this.debug(\"Received OK for unknown event publish\", id);\n            return;\n          }\n          if (ok) firstEp.resolve(reason);\n          else firstEp.reject(new Error(reason));\n          if (ep.length === 0) {\n            this.openEventPublishes.delete(id);\n          } else {\n            this.openEventPublishes.set(id, ep);\n          }\n          return;\n        }\n        case \"CLOSED\": {\n          const so = this.openSubs.get(id);\n          if (!so) return;\n          so.onclosed(data[2]);\n          return;\n        }\n        case \"NOTICE\":\n          this.onNotice(data[1]);\n          return;\n        case \"AUTH\": {\n          this.onAuthRequested(data[1]);\n          return;\n        }\n      }\n    } catch (error) {\n      this.debug(`Error parsing message from ${this.ndkRelay.url}: ${error.message}`, error?.stack);\n      return;\n    }\n  }\n  /**\n   * Handles an authentication request from the NDK relay.\n   *\n   * If an authentication policy is configured, it will be used to authenticate the connection.\n   * Otherwise, the `auth` event will be emitted to allow the application to handle the authentication.\n   *\n   * @param challenge - The authentication challenge provided by the NDK relay.\n   */\n  async onAuthRequested(challenge) {\n    const authPolicy = this.ndkRelay.authPolicy ?? this.ndk?.relayAuthDefaultPolicy;\n    this.debug(\"Relay requested authentication\", {\n      havePolicy: !!authPolicy\n    });\n    if (this._status === 7 /* AUTHENTICATING */) {\n      this.debug(\"Already authenticating, ignoring\");\n      return;\n    }\n    this._status = 6 /* AUTH_REQUESTED */;\n    if (authPolicy) {\n      if (this._status >= 5 /* CONNECTED */) {\n        this._status = 7 /* AUTHENTICATING */;\n        let res;\n        try {\n          res = await authPolicy(this.ndkRelay, challenge);\n        } catch (e) {\n          this.debug(\"Authentication policy threw an error\", e);\n          res = false;\n        }\n        this.debug(\"Authentication policy returned\", !!res);\n        if (res instanceof NDKEvent || res === true) {\n          if (res instanceof NDKEvent) {\n            await this.auth(res);\n          }\n          const authenticate = async () => {\n            if (this._status >= 5 /* CONNECTED */ && this._status < 8 /* AUTHENTICATED */) {\n              const event = new NDKEvent(this.ndk);\n              event.kind = 22242 /* ClientAuth */;\n              event.tags = [\n                [\"relay\", this.ndkRelay.url],\n                [\"challenge\", challenge]\n              ];\n              await event.sign();\n              this.auth(event).then(() => {\n                this._status = 8 /* AUTHENTICATED */;\n                this.ndkRelay.emit(\"authed\");\n                this.debug(\"Authentication successful\");\n              }).catch((e) => {\n                this._status = 6 /* AUTH_REQUESTED */;\n                this.ndkRelay.emit(\"auth:failed\", e);\n                this.debug(\"Authentication failed\", e);\n              });\n            } else {\n              this.debug(\"Authentication failed, it changed status, status is %d\", this._status);\n            }\n          };\n          if (res === true) {\n            if (!this.ndk?.signer) {\n              this.debug(\"No signer available for authentication localhost\");\n              this.ndk?.once(\"signer:ready\", authenticate);\n            } else {\n              authenticate().catch((e) => {\n                console.error(\"Error authenticating\", e);\n              });\n            }\n          }\n          this._status = 5 /* CONNECTED */;\n          this.ndkRelay.emit(\"authed\");\n        }\n      }\n    } else {\n      this.ndkRelay.emit(\"auth\", challenge);\n    }\n  }\n  /**\n   * Handles errors that occur on the WebSocket connection to the relay.\n   * @param error - The error or event that occurred.\n   */\n  onError(error) {\n    this.debug(`WebSocket error on ${this.ndkRelay.url}:`, error);\n  }\n  /**\n   * Gets the current status of the NDK relay connection.\n   * @returns {NDKRelayStatus} The current status of the NDK relay connection.\n   */\n  get status() {\n    return this._status;\n  }\n  /**\n   * Checks if the NDK relay connection is currently available.\n   * @returns {boolean} `true` if the relay connection is in the `CONNECTED` status, `false` otherwise.\n   */\n  isAvailable() {\n    return this._status === 5 /* CONNECTED */;\n  }\n  /**\n   * Checks if the NDK relay connection is flapping, which means the connection is rapidly\n   * disconnecting and reconnecting. This is determined by analyzing the durations of the\n   * last three connection attempts. If the standard deviation of the durations is less\n   * than 1000 milliseconds, the connection is considered to be flapping.\n   *\n   * @returns {boolean} `true` if the connection is flapping, `false` otherwise.\n   */\n  isFlapping() {\n    const durations = this._connectionStats.durations;\n    if (durations.length % 3 !== 0) return false;\n    const sum = durations.reduce((a, b) => a + b, 0);\n    const avg = sum / durations.length;\n    const variance = durations.map((x) => (x - avg) ** 2).reduce((a, b) => a + b, 0) / durations.length;\n    const stdDev = Math.sqrt(variance);\n    const isFlapping = stdDev < FLAPPING_THRESHOLD_MS;\n    return isFlapping;\n  }\n  /**\n   * Handles a notice received from the NDK relay.\n   * If the notice indicates the relay is complaining (e.g. \"too many\" or \"maximum\"),\n   * the method disconnects from the relay and attempts to reconnect after a 2-second delay.\n   * A debug message is logged with the relay URL and the notice text.\n   * The \"notice\" event is emitted on the ndkRelay instance with the notice text.\n   *\n   * @param notice - The notice text received from the NDK relay.\n   */\n  async onNotice(notice) {\n    this.ndkRelay.emit(\"notice\", notice);\n  }\n  /**\n   * Attempts to reconnect to the NDK relay after a connection is lost.\n   * This function is called recursively to handle multiple reconnection attempts.\n   * It checks if the relay is flapping and emits a \"flapping\" event if so.\n   * It then calculates a delay before the next reconnection attempt based on the number of previous attempts.\n   * The function sets a timeout to execute the next reconnection attempt after the calculated delay.\n   * If the maximum number of reconnection attempts is reached, a debug message is logged.\n   *\n   * @param attempt - The current attempt number (default is 0).\n   */\n  handleReconnection(attempt = 0) {\n    if (this.reconnectTimeout) return;\n    if (this.isFlapping()) {\n      this.ndkRelay.emit(\"flapping\", this._connectionStats);\n      this._status = 3 /* FLAPPING */;\n      return;\n    }\n    const reconnectDelay = this.connectedAt ? Math.max(0, 6e4 - (Date.now() - this.connectedAt)) : 5e3 * (this._connectionStats.attempts + 1);\n    this.reconnectTimeout = setTimeout(() => {\n      this.reconnectTimeout = void 0;\n      this._status = 2 /* RECONNECTING */;\n      this.connect().catch((_err) => {\n        if (attempt < MAX_RECONNECT_ATTEMPTS) {\n          setTimeout(\n            () => {\n              this.handleReconnection(attempt + 1);\n            },\n            1e3 * (attempt + 1) ^ 4\n          );\n        } else {\n          this.debug(\"Reconnect failed\");\n        }\n      });\n    }, reconnectDelay);\n    this.ndkRelay.emit(\"delayed-connect\", reconnectDelay);\n    this.debug(\"Reconnecting in\", reconnectDelay);\n    this._connectionStats.nextReconnectAt = Date.now() + reconnectDelay;\n  }\n  /**\n   * Sends a message to the NDK relay if the connection is in the CONNECTED state and the WebSocket is open.\n   * If the connection is not in the CONNECTED state or the WebSocket is not open, logs a debug message and throws an error.\n   *\n   * @param message - The message to send to the NDK relay.\n   * @throws {Error} If attempting to send on a closed relay connection.\n   */\n  async send(message) {\n    if (this._status >= 5 /* CONNECTED */ && this.ws?.readyState === WebSocket.OPEN) {\n      this.ws?.send(message);\n      this.netDebug?.(message, this.ndkRelay, \"send\");\n    } else {\n      this.debug(`Not connected to ${this.ndkRelay.url} (%d), not sending message ${message}`, this._status);\n    }\n  }\n  /**\n   * Authenticates the NDK event by sending it to the NDK relay and returning a promise that resolves with the result.\n   *\n   * @param event - The NDK event to authenticate.\n   * @returns A promise that resolves with the authentication result.\n   */\n  async auth(event) {\n    const ret = new Promise((resolve, reject) => {\n      const val = this.openEventPublishes.get(event.id) ?? [];\n      val.push({ resolve, reject });\n      this.openEventPublishes.set(event.id, val);\n    });\n    this.send(`[\"AUTH\",${JSON.stringify(event.rawEvent())}]`);\n    return ret;\n  }\n  /**\n   * Publishes an NDK event to the relay and returns a promise that resolves with the result.\n   *\n   * @param event - The NDK event to publish.\n   * @returns A promise that resolves with the result of the event publication.\n   * @throws {Error} If attempting to publish on a closed relay connection.\n   */\n  async publish(event) {\n    const ret = new Promise((resolve, reject) => {\n      const val = this.openEventPublishes.get(event.id) ?? [];\n      if (val.length > 0) {\n        console.warn(`Duplicate event publishing detected, you are publishing event ${event.id} twice`);\n      }\n      val.push({ resolve, reject });\n      this.openEventPublishes.set(event.id, val);\n    });\n    this.send(`[\"EVENT\",${JSON.stringify(event)}]`);\n    return ret;\n  }\n  /**\n   * Counts the number of events that match the provided filters.\n   *\n   * @param filters - The filters to apply to the count request.\n   * @param params - An optional object containing a custom id for the count request.\n   * @returns A promise that resolves with the number of matching events.\n   * @throws {Error} If attempting to send the count request on a closed relay connection.\n   */\n  async count(filters, params) {\n    this.serial++;\n    const id = params?.id || `count:${this.serial}`;\n    const ret = new Promise((resolve, reject) => {\n      this.openCountRequests.set(id, { resolve, reject });\n    });\n    this.send(`[\"COUNT\",\"${id}\",${JSON.stringify(filters).substring(1)}`);\n    return ret;\n  }\n  close(subId, reason) {\n    this.send(`[\"CLOSE\",\"${subId}\"]`);\n    const sub = this.openSubs.get(subId);\n    this.openSubs.delete(subId);\n    if (sub) sub.onclose(reason);\n  }\n  /**\n   * Subscribes to the NDK relay with the provided filters and parameters.\n   *\n   * @param filters - The filters to apply to the subscription.\n   * @param params - The subscription parameters, including an optional custom id.\n   * @returns A new NDKRelaySubscription instance.\n   */\n  req(relaySub) {\n    `${this.send(`[\"REQ\",\"${relaySub.subId}\",${JSON.stringify(relaySub.executeFilters).substring(1)}`)}]`;\n    this.openSubs.set(relaySub.subId, relaySub);\n  }\n  /**\n   * Utility functions to update the connection stats.\n   */\n  updateConnectionStats = {\n    connected: () => {\n      this._connectionStats.success++;\n      this._connectionStats.connectedAt = Date.now();\n    },\n    disconnected: () => {\n      if (this._connectionStats.connectedAt) {\n        this._connectionStats.durations.push(Date.now() - this._connectionStats.connectedAt);\n        if (this._connectionStats.durations.length > 100) {\n          this._connectionStats.durations.shift();\n        }\n      }\n      this._connectionStats.connectedAt = void 0;\n    },\n    attempt: () => {\n      this._connectionStats.attempts++;\n      this._connectionStats.connectedAt = Date.now();\n    }\n  };\n  /** Returns the connection stats. */\n  get connectionStats() {\n    return this._connectionStats;\n  }\n  /** Returns the relay URL */\n  get url() {\n    return this.ndkRelay.url;\n  }\n  get connected() {\n    return this._status >= 5 /* CONNECTED */ && this.ws?.readyState === WebSocket.OPEN;\n  }\n};\n\n// src/relay/publisher.ts\nvar NDKRelayPublisher = class {\n  ndkRelay;\n  debug;\n  constructor(ndkRelay) {\n    this.ndkRelay = ndkRelay;\n    this.debug = ndkRelay.debug.extend(\"publisher\");\n  }\n  /**\n   * Published an event to the relay; if the relay is not connected, it will\n   * wait for the relay to connect before publishing the event.\n   *\n   * If the relay does not connect within the timeout, the publish operation\n   * will fail.\n   * @param event  The event to publish\n   * @param timeoutMs  The timeout for the publish operation in milliseconds\n   * @returns A promise that resolves when the event has been published or rejects if the operation times out\n   */\n  async publish(event, timeoutMs = 2500) {\n    let timeout;\n    const publishConnected = () => {\n      return new Promise((resolve, reject) => {\n        try {\n          this.publishEvent(event).then((_result) => {\n            this.ndkRelay.emit(\"published\", event);\n            event.emit(\"relay:published\", this.ndkRelay);\n            resolve(true);\n          }).catch(reject);\n        } catch (err) {\n          reject(err);\n        }\n      });\n    };\n    const timeoutPromise = new Promise((_, reject) => {\n      timeout = setTimeout(() => {\n        timeout = void 0;\n        reject(new Error(`Timeout: ${timeoutMs}ms`));\n      }, timeoutMs);\n    });\n    const onConnectHandler = () => {\n      publishConnected().then((result) => connectResolve(result)).catch((err) => connectReject(err));\n    };\n    let connectResolve;\n    let connectReject;\n    const onError = (err) => {\n      this.ndkRelay.debug(\"Publish failed\", err, event.id);\n      this.ndkRelay.emit(\"publish:failed\", event, err);\n      event.emit(\"relay:publish:failed\", this.ndkRelay, err);\n      throw err;\n    };\n    const onFinally = () => {\n      if (timeout) clearTimeout(timeout);\n      this.ndkRelay.removeListener(\"connect\", onConnectHandler);\n    };\n    if (this.ndkRelay.status >= 5 /* CONNECTED */) {\n      return Promise.race([publishConnected(), timeoutPromise]).catch(onError).finally(onFinally);\n    }\n    if (this.ndkRelay.status <= 1 /* DISCONNECTED */) {\n      console.warn(\"Relay is disconnected, trying to connect to publish an event\", this.ndkRelay.url);\n      this.ndkRelay.connect();\n    } else {\n      console.warn(\"Relay not connected, waiting for connection to publish an event\", this.ndkRelay.url);\n    }\n    return Promise.race([\n      new Promise((resolve, reject) => {\n        connectResolve = resolve;\n        connectReject = reject;\n        this.ndkRelay.once(\"connect\", onConnectHandler);\n      }),\n      timeoutPromise\n    ]).catch(onError).finally(onFinally);\n  }\n  async publishEvent(event) {\n    return this.ndkRelay.connectivity.publish(event.rawEvent());\n  }\n};\n\n// src/subscription/grouping.ts\nfunction filterFingerprint(filters, closeOnEose) {\n  const elements = [];\n  for (const filter of filters) {\n    const keys = Object.entries(filter || {}).map(([key, values]) => {\n      if ([\"since\", \"until\"].includes(key)) {\n        return `${key}:${values}`;\n      }\n      return key;\n    }).sort().join(\"-\");\n    elements.push(keys);\n  }\n  let id = closeOnEose ? \"+\" : \"\";\n  id += elements.join(\"|\");\n  return id;\n}\nfunction mergeFilters(filters) {\n  const result = [];\n  const lastResult = {};\n  filters.filter((f) => !!f.limit).forEach((filterWithLimit) => result.push(filterWithLimit));\n  filters = filters.filter((f) => !f.limit);\n  if (filters.length === 0) return result;\n  filters.forEach((filter) => {\n    Object.entries(filter).forEach(([key, value]) => {\n      if (Array.isArray(value)) {\n        if (lastResult[key] === void 0) {\n          lastResult[key] = [...value];\n        } else {\n          lastResult[key] = Array.from(/* @__PURE__ */ new Set([...lastResult[key], ...value]));\n        }\n      } else {\n        lastResult[key] = value;\n      }\n    });\n  });\n  return [...result, lastResult];\n}\n\n// src/relay/subscription.ts\nvar NDKRelaySubscription = class {\n  fingerprint;\n  items = /* @__PURE__ */ new Map();\n  topSubManager;\n  debug;\n  /**\n   * Tracks the status of this REQ.\n   */\n  status = 0 /* INITIAL */;\n  onClose;\n  relay;\n  /**\n   * Whether this subscription has reached EOSE.\n   */\n  eosed = false;\n  /**\n   * Timeout at which this subscription will\n   * start executing.\n   */\n  executionTimer;\n  /**\n   * Track the time at which this subscription will fire.\n   */\n  fireTime;\n  /**\n   * The delay type that the current fireTime was calculated with.\n   */\n  delayType;\n  /**\n   * The filters that have been executed.\n   */\n  executeFilters;\n  id = Math.random().toString(36).substring(7);\n  /**\n   *\n   * @param fingerprint The fingerprint of this subscription.\n   */\n  constructor(relay, fingerprint, topSubManager) {\n    this.relay = relay;\n    this.topSubManager = topSubManager;\n    this.debug = relay.debug.extend(`sub[${this.id}]`);\n    this.fingerprint = fingerprint || Math.random().toString(36).substring(7);\n  }\n  _subId;\n  get subId() {\n    if (this._subId) return this._subId;\n    this._subId = this.fingerprint.slice(0, 15);\n    return this._subId;\n  }\n  subIdParts = /* @__PURE__ */ new Set();\n  addSubIdPart(part) {\n    this.subIdParts.add(part);\n  }\n  addItem(subscription, filters) {\n    this.debug(\"Adding item\", {\n      filters,\n      internalId: subscription.internalId,\n      status: this.status,\n      fingerprint: this.fingerprint,\n      id: this.subId,\n      items: this.items,\n      itemsSize: this.items.size\n    });\n    if (this.items.has(subscription.internalId)) return;\n    subscription.on(\"close\", this.removeItem.bind(this, subscription));\n    this.items.set(subscription.internalId, { subscription, filters });\n    if (this.status !== 3 /* RUNNING */) {\n      if (subscription.subId && (!this._subId || this._subId.length < 48)) {\n        if (this.status === 0 /* INITIAL */ || this.status === 1 /* PENDING */) {\n          this.addSubIdPart(subscription.subId);\n        }\n      }\n    }\n    switch (this.status) {\n      case 0 /* INITIAL */:\n        this.evaluateExecutionPlan(subscription);\n        break;\n      case 3 /* RUNNING */:\n        break;\n      case 1 /* PENDING */:\n        this.evaluateExecutionPlan(subscription);\n        break;\n      case 4 /* CLOSED */:\n        this.debug(\"Subscription is closed, cannot add new items %o (%o)\", subscription, filters);\n        throw new Error(\"Cannot add new items to a closed subscription\");\n    }\n  }\n  /**\n   * A subscription has been closed, remove it from the list of items.\n   * @param subscription\n   */\n  removeItem(subscription) {\n    this.items.delete(subscription.internalId);\n    if (this.items.size === 0) {\n      if (!this.eosed) return;\n      this.close();\n      this.cleanup();\n    }\n  }\n  close() {\n    if (this.status === 4 /* CLOSED */) return;\n    const prevStatus = this.status;\n    this.status = 4 /* CLOSED */;\n    if (prevStatus === 3 /* RUNNING */) {\n      try {\n        this.relay.close(this.subId);\n      } catch (e) {\n        this.debug(\"Error closing subscription\", e, this);\n      }\n    } else {\n      this.debug(\"Subscription wanted to close but it wasn't running, this is probably ok\", {\n        subId: this.subId,\n        prevStatus,\n        sub: this\n      });\n    }\n    this.cleanup();\n  }\n  cleanup() {\n    if (this.executionTimer) clearTimeout(this.executionTimer);\n    this.relay.off(\"ready\", this.executeOnRelayReady);\n    this.relay.off(\"authed\", this.reExecuteAfterAuth);\n    if (this.onClose) this.onClose(this);\n  }\n  evaluateExecutionPlan(subscription) {\n    if (!subscription.isGroupable()) {\n      this.status = 1 /* PENDING */;\n      this.execute();\n      return;\n    }\n    if (subscription.filters.find((filter) => !!filter.limit)) {\n      this.executeFilters = this.compileFilters();\n      if (this.executeFilters.length >= 10) {\n        this.status = 1 /* PENDING */;\n        this.execute();\n        return;\n      }\n    }\n    const delay = subscription.groupableDelay;\n    const delayType = subscription.groupableDelayType;\n    if (!delay) throw new Error(\"Cannot group a subscription without a delay\");\n    if (this.status === 0 /* INITIAL */) {\n      this.schedule(delay, delayType);\n    } else {\n      const existingDelayType = this.delayType;\n      const timeUntilFire = this.fireTime - Date.now();\n      if (existingDelayType === \"at-least\" && delayType === \"at-least\") {\n        if (timeUntilFire < delay) {\n          if (this.executionTimer) clearTimeout(this.executionTimer);\n          this.schedule(delay, delayType);\n        }\n      } else if (existingDelayType === \"at-least\" && delayType === \"at-most\") {\n        if (timeUntilFire > delay) {\n          if (this.executionTimer) clearTimeout(this.executionTimer);\n          this.schedule(delay, delayType);\n        }\n      } else if (existingDelayType === \"at-most\" && delayType === \"at-most\") {\n        if (timeUntilFire > delay) {\n          if (this.executionTimer) clearTimeout(this.executionTimer);\n          this.schedule(delay, delayType);\n        }\n      } else if (existingDelayType === \"at-most\" && delayType === \"at-least\") {\n        if (timeUntilFire > delay) {\n          if (this.executionTimer) clearTimeout(this.executionTimer);\n          this.schedule(delay, delayType);\n        }\n      } else {\n        throw new Error(`Unknown delay type combination ${existingDelayType} ${delayType}`);\n      }\n    }\n  }\n  schedule(delay, delayType) {\n    this.status = 1 /* PENDING */;\n    const currentTime = Date.now();\n    this.fireTime = currentTime + delay;\n    this.delayType = delayType;\n    const timer = setTimeout(this.execute.bind(this), delay);\n    if (delayType === \"at-least\") {\n      this.executionTimer = timer;\n    }\n  }\n  executeOnRelayReady = () => {\n    if (this.status !== 2 /* WAITING */) return;\n    if (this.items.size === 0) {\n      this.debug(\"No items to execute; this relay was probably too slow to respond and the caller gave up\", {\n        status: this.status,\n        fingerprint: this.fingerprint,\n        items: this.items,\n        itemsSize: this.items.size,\n        id: this.id,\n        subId: this.subId\n      });\n      this.cleanup();\n      return;\n    }\n    this.debug(\"Executing on relay ready\", {\n      status: this.status,\n      fingerprint: this.fingerprint,\n      items: this.items,\n      itemsSize: this.items.size\n    });\n    this.status = 1 /* PENDING */;\n    this.execute();\n  };\n  finalizeSubId() {\n    if (this.subIdParts.size > 0) {\n      this._subId = Array.from(this.subIdParts).join(\"-\");\n    } else {\n      this._subId = this.fingerprint.slice(0, 15);\n    }\n    this._subId += `-${Math.random().toString(36).substring(2, 7)}`;\n  }\n  // we do it this way so that we can remove the listener\n  reExecuteAfterAuth = (() => {\n    const oldSubId = this.subId;\n    this.debug(\"Re-executing after auth\", this.items.size);\n    if (this.eosed) {\n      this.relay.close(this.subId);\n    } else {\n      this.debug(\"We are abandoning an opened subscription, once it EOSE's, the handler will close it\", {\n        oldSubId\n      });\n    }\n    this._subId = void 0;\n    this.status = 1 /* PENDING */;\n    this.execute();\n    this.debug(\"Re-executed after auth %s \\u{1F449} %s\", oldSubId, this.subId);\n  }).bind(this);\n  execute() {\n    if (this.status !== 1 /* PENDING */) {\n      return;\n    }\n    if (!this.relay.connected) {\n      this.status = 2 /* WAITING */;\n      this.debug(\"Waiting for relay to be ready\", {\n        status: this.status,\n        id: this.subId,\n        fingerprint: this.fingerprint,\n        items: this.items,\n        itemsSize: this.items.size\n      });\n      this.relay.once(\"ready\", this.executeOnRelayReady);\n      return;\n    }\n    if (this.relay.status < 8 /* AUTHENTICATED */) {\n      this.relay.once(\"authed\", this.reExecuteAfterAuth);\n    }\n    this.status = 3 /* RUNNING */;\n    this.finalizeSubId();\n    this.executeFilters = this.compileFilters();\n    this.relay.req(this);\n  }\n  onstart() {\n  }\n  onevent(event) {\n    this.topSubManager.dispatchEvent(event, this.relay);\n  }\n  oneose(subId) {\n    this.eosed = true;\n    if (subId !== this.subId) {\n      this.debug(\"Received EOSE for an abandoned subscription\", subId, this.subId);\n      this.relay.close(subId);\n      return;\n    }\n    if (this.items.size === 0) {\n      this.close();\n    }\n    for (const { subscription } of this.items.values()) {\n      subscription.eoseReceived(this.relay);\n      if (subscription.closeOnEose) {\n        this.debug(\"Removing item because of EOSE\", {\n          filters: subscription.filters,\n          internalId: subscription.internalId,\n          status: this.status,\n          fingerprint: this.fingerprint,\n          items: this.items,\n          itemsSize: this.items.size\n        });\n        this.removeItem(subscription);\n      }\n    }\n  }\n  onclose(_reason) {\n    this.status = 4 /* CLOSED */;\n  }\n  onclosed(reason) {\n    if (!reason) return;\n    for (const { subscription } of this.items.values()) {\n      subscription.closedReceived(this.relay, reason);\n    }\n  }\n  /**\n   * Grabs the filters from all the subscriptions\n   * and merges them into a single filter.\n   */\n  compileFilters() {\n    const mergedFilters = [];\n    const filters = Array.from(this.items.values()).map((item) => item.filters);\n    if (!filters[0]) {\n      this.debug(\"\\u{1F440} No filters to merge\", this.items);\n      console.error(\"BUG: No filters to merge!\", this.items);\n      return [];\n    }\n    const filterCount = filters[0].length;\n    for (let i = 0; i < filterCount; i++) {\n      const allFiltersAtIndex = filters.map((filter) => filter[i]);\n      mergedFilters.push(...mergeFilters(allFiltersAtIndex));\n    }\n    return mergedFilters;\n  }\n};\n\n// src/relay/sub-manager.ts\nvar NDKRelaySubscriptionManager = class {\n  relay;\n  subscriptions;\n  generalSubManager;\n  /**\n   * @param relay - The relay instance.\n   * @param generalSubManager - The subscription manager instance.\n   */\n  constructor(relay, generalSubManager) {\n    this.relay = relay;\n    this.subscriptions = /* @__PURE__ */ new Map();\n    this.generalSubManager = generalSubManager;\n  }\n  /**\n   * Adds a subscription to the manager.\n   */\n  addSubscription(sub, filters) {\n    let relaySub;\n    if (!sub.isGroupable()) {\n      relaySub = this.createSubscription(sub, filters);\n    } else {\n      const filterFp = filterFingerprint(filters, sub.closeOnEose);\n      if (filterFp) {\n        const existingSubs = this.subscriptions.get(filterFp);\n        relaySub = (existingSubs || []).find((sub2) => sub2.status < 3 /* RUNNING */);\n      }\n      relaySub ??= this.createSubscription(sub, filters, filterFp);\n    }\n    relaySub.addItem(sub, filters);\n  }\n  createSubscription(_sub, _filters, fingerprint) {\n    const relaySub = new NDKRelaySubscription(this.relay, fingerprint || null, this.generalSubManager);\n    relaySub.onClose = this.onRelaySubscriptionClose.bind(this);\n    const currentVal = this.subscriptions.get(relaySub.fingerprint) ?? [];\n    this.subscriptions.set(relaySub.fingerprint, [...currentVal, relaySub]);\n    return relaySub;\n  }\n  onRelaySubscriptionClose(sub) {\n    let currentVal = this.subscriptions.get(sub.fingerprint) ?? [];\n    if (!currentVal) {\n      console.warn(\"Unexpectedly did not find a subscription with fingerprint\", sub.fingerprint);\n    } else if (currentVal.length === 1) {\n      this.subscriptions.delete(sub.fingerprint);\n    } else {\n      currentVal = currentVal.filter((s) => s.id !== sub.id);\n      this.subscriptions.set(sub.fingerprint, currentVal);\n    }\n  }\n};\n\n// src/relay/index.ts\nvar NDKRelayStatus = /* @__PURE__ */ ((NDKRelayStatus2) => {\n  NDKRelayStatus2[NDKRelayStatus2[\"DISCONNECTING\"] = 0] = \"DISCONNECTING\";\n  NDKRelayStatus2[NDKRelayStatus2[\"DISCONNECTED\"] = 1] = \"DISCONNECTED\";\n  NDKRelayStatus2[NDKRelayStatus2[\"RECONNECTING\"] = 2] = \"RECONNECTING\";\n  NDKRelayStatus2[NDKRelayStatus2[\"FLAPPING\"] = 3] = \"FLAPPING\";\n  NDKRelayStatus2[NDKRelayStatus2[\"CONNECTING\"] = 4] = \"CONNECTING\";\n  NDKRelayStatus2[NDKRelayStatus2[\"CONNECTED\"] = 5] = \"CONNECTED\";\n  NDKRelayStatus2[NDKRelayStatus2[\"AUTH_REQUESTED\"] = 6] = \"AUTH_REQUESTED\";\n  NDKRelayStatus2[NDKRelayStatus2[\"AUTHENTICATING\"] = 7] = \"AUTHENTICATING\";\n  NDKRelayStatus2[NDKRelayStatus2[\"AUTHENTICATED\"] = 8] = \"AUTHENTICATED\";\n  return NDKRelayStatus2;\n})(NDKRelayStatus || {});\nvar NDKRelay = class _NDKRelay extends EventEmitter {\n  url;\n  scores;\n  connectivity;\n  subs;\n  publisher;\n  authPolicy;\n  /**\n   * The lowest validation ratio this relay can reach.\n   */\n  lowestValidationRatio;\n  /**\n   * Current validation ratio this relay is targeting.\n   */\n  targetValidationRatio;\n  validationRatioFn;\n  /**\n   * This tracks events that have been seen by this relay\n   * with a valid signature.\n   */\n  validatedEventCount = 0;\n  /**\n   * This tracks events that have been seen by this relay\n   * but have not been validated.\n   */\n  nonValidatedEventCount = 0;\n  /**\n   * Whether this relay is trusted.\n   *\n   * Trusted relay's events do not get their signature verified.\n   */\n  trusted = false;\n  complaining = false;\n  debug;\n  static defaultValidationRatioUpdateFn = (relay, validatedCount, _nonValidatedCount) => {\n    if (relay.lowestValidationRatio === void 0 || relay.targetValidationRatio === void 0) return 1;\n    let newRatio = relay.validationRatio;\n    if (relay.validationRatio > relay.targetValidationRatio) {\n      const factor = validatedCount / 100;\n      newRatio = Math.max(relay.lowestValidationRatio, relay.validationRatio - factor);\n    }\n    if (newRatio < relay.validationRatio) {\n      return newRatio;\n    }\n    return relay.validationRatio;\n  };\n  constructor(url, authPolicy, ndk) {\n    super();\n    this.url = normalizeRelayUrl(url);\n    this.scores = /* @__PURE__ */ new Map();\n    this.debug = debug(`ndk:relay:${url}`);\n    this.connectivity = new NDKRelayConnectivity(this, ndk);\n    this.connectivity.netDebug = ndk?.netDebug;\n    this.req = this.connectivity.req.bind(this.connectivity);\n    this.close = this.connectivity.close.bind(this.connectivity);\n    this.subs = new NDKRelaySubscriptionManager(this, ndk.subManager);\n    this.publisher = new NDKRelayPublisher(this);\n    this.authPolicy = authPolicy;\n    this.targetValidationRatio = ndk?.initialValidationRatio;\n    this.lowestValidationRatio = ndk?.lowestValidationRatio;\n    this.validationRatioFn = (ndk?.validationRatioFn ?? _NDKRelay.defaultValidationRatioUpdateFn).bind(this);\n    this.updateValidationRatio();\n    if (!ndk) {\n      console.trace(\"relay created without ndk\");\n    }\n  }\n  updateValidationRatio() {\n    setTimeout(() => {\n      this.updateValidationRatio();\n    }, 3e4);\n  }\n  get status() {\n    return this.connectivity.status;\n  }\n  get connectionStats() {\n    return this.connectivity.connectionStats;\n  }\n  /**\n   * Connects to the relay.\n   */\n  async connect(timeoutMs, reconnect = true) {\n    return this.connectivity.connect(timeoutMs, reconnect);\n  }\n  /**\n   * Disconnects from the relay.\n   */\n  disconnect() {\n    if (this.status === 1 /* DISCONNECTED */) {\n      return;\n    }\n    this.connectivity.disconnect();\n  }\n  /**\n   * Queues or executes the subscription of a specific set of filters\n   * within this relay.\n   *\n   * @param subscription NDKSubscription this filters belong to.\n   * @param filters Filters to execute\n   */\n  subscribe(subscription, filters) {\n    this.subs.addSubscription(subscription, filters);\n  }\n  /**\n   * Publishes an event to the relay with an optional timeout.\n   *\n   * If the relay is not connected, the event will be published when the relay connects,\n   * unless the timeout is reached before the relay connects.\n   *\n   * @param event The event to publish\n   * @param timeoutMs The timeout for the publish operation in milliseconds\n   * @returns A promise that resolves when the event has been published or rejects if the operation times out\n   */\n  async publish(event, timeoutMs = 2500) {\n    return this.publisher.publish(event, timeoutMs);\n  }\n  referenceTags() {\n    return [[\"r\", this.url]];\n  }\n  addValidatedEvent() {\n    this.validatedEventCount++;\n  }\n  addNonValidatedEvent() {\n    this.nonValidatedEventCount++;\n  }\n  /**\n   * The current validation ratio this relay has achieved.\n   */\n  get validationRatio() {\n    if (this.nonValidatedEventCount === 0) {\n      return 1;\n    }\n    return this.validatedEventCount / (this.validatedEventCount + this.nonValidatedEventCount);\n  }\n  shouldValidateEvent() {\n    if (this.trusted) {\n      return false;\n    }\n    if (this.targetValidationRatio === void 0) {\n      return true;\n    }\n    return this.validationRatio < this.targetValidationRatio;\n  }\n  get connected() {\n    return this.connectivity.connected;\n  }\n  req;\n  close;\n};\n\n// src/relay/sets/index.ts\nvar NDKPublishError = class extends Error {\n  errors;\n  publishedToRelays;\n  /**\n   * Intended relay set where the publishing was intended to happen.\n   */\n  intendedRelaySet;\n  constructor(message, errors, publishedToRelays, intendedRelaySet) {\n    super(message);\n    this.errors = errors;\n    this.publishedToRelays = publishedToRelays;\n    this.intendedRelaySet = intendedRelaySet;\n  }\n  get relayErrors() {\n    const errors = [];\n    for (const [relay, err] of this.errors) {\n      errors.push(`${relay.url}: ${err}`);\n    }\n    return errors.join(\"\\n\");\n  }\n};\nvar NDKRelaySet = class _NDKRelaySet {\n  relays;\n  debug;\n  ndk;\n  pool;\n  constructor(relays, ndk, pool) {\n    this.relays = relays;\n    this.ndk = ndk;\n    this.pool = pool ?? ndk.pool;\n    this.debug = ndk.debug.extend(\"relayset\");\n  }\n  /**\n   * Adds a relay to this set.\n   */\n  addRelay(relay) {\n    this.relays.add(relay);\n  }\n  get relayUrls() {\n    return Array.from(this.relays).map((r) => r.url);\n  }\n  /**\n   * Creates a relay set from a list of relay URLs.\n   *\n   * If no connection to the relay is found in the pool it will temporarily\n   * connect to it.\n   *\n   * @param relayUrls - list of relay URLs to include in this set\n   * @param ndk\n   * @param connect - whether to connect to the relay immediately if it was already in the pool but not connected\n   * @returns NDKRelaySet\n   */\n  static fromRelayUrls(relayUrls, ndk, connect = true, pool) {\n    pool = pool ?? ndk.pool;\n    if (!pool) throw new Error(\"No pool provided\");\n    const relays = /* @__PURE__ */ new Set();\n    for (const url of relayUrls) {\n      const relay = pool.relays.get(normalizeRelayUrl(url));\n      if (relay) {\n        if (relay.status < 5 /* CONNECTED */ && connect) {\n          relay.connect();\n        }\n        relays.add(relay);\n      } else {\n        const temporaryRelay = new NDKRelay(normalizeRelayUrl(url), ndk?.relayAuthDefaultPolicy, ndk);\n        pool.useTemporaryRelay(temporaryRelay, void 0, `requested from fromRelayUrls ${relayUrls}`);\n        relays.add(temporaryRelay);\n      }\n    }\n    return new _NDKRelaySet(new Set(relays), ndk, pool);\n  }\n  /**\n   * Publish an event to all relays in this relay set.\n   *\n   * This method implements a robust mechanism for publishing events to multiple relays with\n   * built-in handling for race conditions, timeouts, and partial failures. The implementation\n   * uses a dual-tracking mechanism to ensure accurate reporting of which relays successfully\n   * received an event.\n   *\n   * Key aspects of this implementation:\n   *\n   * 1. DUAL-TRACKING MECHANISM:\n   *    - Promise-based tracking: Records successes/failures from the promises returned by relay.publish()\n   *    - Event-based tracking: Listens for 'relay:published' events that indicate successful publishing\n   *    This approach ensures we don't miss successful publishes even if there are subsequent errors in\n   *    the promise chain.\n   *\n   * 2. RACE CONDITION HANDLING:\n   *    - If a relay emits a success event but later fails in the promise chain, we still count it as a success\n   *    - If a relay times out after successfully publishing, we still count it as a success\n   *    - All relay operations happen in parallel, with proper tracking regardless of completion order\n   *\n   * 3. TIMEOUT MANAGEMENT:\n   *    - Individual timeouts for each relay operation\n   *    - Proper cleanup of timeouts to prevent memory leaks\n   *    - Clear timeout error reporting\n   *\n   * 4. ERROR HANDLING:\n   *    - Detailed tracking of specific errors for each failed relay\n   *    - Special handling for ephemeral events (which don't expect acknowledgement)\n   *    - RequiredRelayCount parameter to control the minimum success threshold\n   *\n   * @param event Event to publish\n   * @param timeoutMs Timeout in milliseconds for each relay publish operation\n   * @param requiredRelayCount The minimum number of relays we expect the event to be published to\n   * @returns A set of relays the event was published to\n   * @throws {NDKPublishError} If the event could not be published to at least `requiredRelayCount` relays\n   * @example\n   * ```typescript\n   * const relaySet = new NDKRelaySet(new Set([relay1, relay2]), ndk);\n   * const publishedToRelays = await relaySet.publish(event);\n   * // publishedToRelays can contain relay1, relay2, both, or none\n   * // depending on which relays the event was successfully published to\n   * if (publishedToRelays.size > 0) {\n   *   console.log(\"Event published to at least one relay\");\n   * }\n   * ```\n   */\n  async publish(event, timeoutMs, requiredRelayCount = 1) {\n    const publishedToRelays = /* @__PURE__ */ new Set();\n    const errors = /* @__PURE__ */ new Map();\n    const isEphemeral2 = event.isEphemeral();\n    event.publishStatus = \"pending\";\n    const relayPublishedHandler = (relay) => {\n      publishedToRelays.add(relay);\n    };\n    event.on(\"relay:published\", relayPublishedHandler);\n    try {\n      const promises = Array.from(this.relays).map((relay) => {\n        return new Promise((resolve) => {\n          const timeoutId = timeoutMs ? setTimeout(() => {\n            if (!publishedToRelays.has(relay)) {\n              errors.set(relay, new Error(`Publish timeout after ${timeoutMs}ms`));\n              resolve(false);\n            }\n          }, timeoutMs) : null;\n          relay.publish(event, timeoutMs).then((success) => {\n            if (timeoutId) clearTimeout(timeoutId);\n            if (success) {\n              publishedToRelays.add(relay);\n              resolve(true);\n            } else {\n              resolve(false);\n            }\n          }).catch((err) => {\n            if (timeoutId) clearTimeout(timeoutId);\n            if (!isEphemeral2) {\n              errors.set(relay, err);\n            }\n            resolve(false);\n          });\n        });\n      });\n      await Promise.all(promises);\n      if (publishedToRelays.size < requiredRelayCount) {\n        if (!isEphemeral2) {\n          const error = new NDKPublishError(\n            \"Not enough relays received the event\",\n            errors,\n            publishedToRelays,\n            this\n          );\n          event.publishStatus = \"error\";\n          event.publishError = error;\n          this.ndk?.emit(\"event:publish-failed\", event, error, this.relayUrls);\n          throw error;\n        }\n      } else {\n        event.publishStatus = \"success\";\n        event.emit(\"published\", { relaySet: this, publishedToRelays });\n      }\n      return publishedToRelays;\n    } finally {\n      event.off(\"relay:published\", relayPublishedHandler);\n    }\n  }\n  get size() {\n    return this.relays.size;\n  }\n};\n\n// src/relay/sets/calculate.ts\nvar d = createDebug(\"ndk:outbox:calculate\");\nasync function calculateRelaySetFromEvent(ndk, event) {\n  const relays = /* @__PURE__ */ new Set();\n  const authorWriteRelays = await getWriteRelaysFor(ndk, event.pubkey);\n  if (authorWriteRelays) {\n    authorWriteRelays.forEach((relayUrl) => {\n      const relay = ndk.pool?.getRelay(relayUrl);\n      if (relay) relays.add(relay);\n    });\n  }\n  let relayHints = event.tags.filter((tag) => [\"a\", \"e\"].includes(tag[0])).map((tag) => tag[2]).filter((url) => url?.startsWith(\"wss://\")).filter((url) => {\n    try {\n      new URL(url);\n      return true;\n    } catch {\n      return false;\n    }\n  }).map((url) => normalizeRelayUrl(url));\n  relayHints = Array.from(new Set(relayHints)).slice(0, 5);\n  relayHints.forEach((relayUrl) => {\n    const relay = ndk.pool?.getRelay(relayUrl, true, true);\n    if (relay) {\n      d(\"Adding relay hint %s\", relayUrl);\n      relays.add(relay);\n    }\n  });\n  const pTags = event.getMatchingTags(\"p\").map((tag) => tag[1]);\n  if (pTags.length < 5) {\n    const pTaggedRelays = Array.from(\n      chooseRelayCombinationForPubkeys(ndk, pTags, \"read\", {\n        preferredRelays: new Set(authorWriteRelays)\n      }).keys()\n    );\n    pTaggedRelays.forEach((relayUrl) => {\n      const relay = ndk.pool?.getRelay(relayUrl, false, true);\n      if (relay) {\n        d(\"Adding p-tagged relay %s\", relayUrl);\n        relays.add(relay);\n      }\n    });\n  } else {\n    d(\"Too many p-tags to consider %d\", pTags.length);\n  }\n  ndk.pool?.permanentAndConnectedRelays().forEach((relay) => relays.add(relay));\n  return new NDKRelaySet(relays, ndk);\n}\nfunction calculateRelaySetsFromFilter(ndk, filters, pool) {\n  const result = /* @__PURE__ */ new Map();\n  const authors = /* @__PURE__ */ new Set();\n  filters.forEach((filter) => {\n    if (filter.authors) {\n      filter.authors.forEach((author) => authors.add(author));\n    }\n  });\n  if (authors.size > 0) {\n    const authorToRelaysMap = getRelaysForFilterWithAuthors(ndk, Array.from(authors));\n    for (const relayUrl of authorToRelaysMap.keys()) {\n      result.set(relayUrl, []);\n    }\n    for (const filter of filters) {\n      if (filter.authors) {\n        for (const [relayUrl, authors2] of authorToRelaysMap.entries()) {\n          const authorFilterAndRelayPubkeyIntersection = filter.authors.filter(\n            (author) => authors2.includes(author)\n          );\n          result.set(relayUrl, [\n            ...result.get(relayUrl),\n            {\n              ...filter,\n              // Overwrite authors sent to this relay with the authors that were\n              // present in the filter and are also present in the relay\n              authors: authorFilterAndRelayPubkeyIntersection\n            }\n          ]);\n        }\n      } else {\n        for (const relayUrl of authorToRelaysMap.keys()) {\n          result.set(relayUrl, [...result.get(relayUrl), filter]);\n        }\n      }\n    }\n  } else {\n    if (ndk.explicitRelayUrls) {\n      ndk.explicitRelayUrls.forEach((relayUrl) => {\n        result.set(relayUrl, filters);\n      });\n    }\n  }\n  if (result.size === 0) {\n    pool.permanentAndConnectedRelays().slice(0, 5).forEach((relay) => {\n      result.set(relay.url, filters);\n    });\n  }\n  return result;\n}\nfunction calculateRelaySetsFromFilters(ndk, filters, pool) {\n  const a = calculateRelaySetsFromFilter(ndk, filters, pool);\n  return a;\n}\n\n// src/events/content-tagger.ts\nimport { nip19 } from \"nostr-tools\";\nfunction mergeTags(tags1, tags2) {\n  const tagMap = /* @__PURE__ */ new Map();\n  const generateKey = (tag) => tag.join(\",\");\n  const isContained = (smaller, larger) => {\n    return smaller.every((value, index) => value === larger[index]);\n  };\n  const processTag = (tag) => {\n    for (const [key, existingTag] of tagMap) {\n      if (isContained(existingTag, tag) || isContained(tag, existingTag)) {\n        if (tag.length >= existingTag.length) {\n          tagMap.set(key, tag);\n        }\n        return;\n      }\n    }\n    tagMap.set(generateKey(tag), tag);\n  };\n  tags1.concat(tags2).forEach(processTag);\n  return Array.from(tagMap.values());\n}\nfunction uniqueTag(a, b) {\n  const aLength = a.length;\n  const bLength = b.length;\n  const sameLength = aLength === bLength;\n  if (sameLength) {\n    if (a.every((v, i) => v === b[i])) {\n      return [a];\n    }\n    return [a, b];\n  }\n  if (aLength > bLength && a.every((v, i) => v === b[i])) {\n    return [a];\n  }\n  if (bLength > aLength && b.every((v, i) => v === a[i])) {\n    return [b];\n  }\n  return [a, b];\n}\nvar hashtagRegex = /(?<=\\s|^)(#[^\\s!@#$%^&*()=+./,[{\\]};:'\"?><]+)/g;\nfunction generateHashtags(content) {\n  const hashtags = content.match(hashtagRegex);\n  const tagIds = /* @__PURE__ */ new Set();\n  const tag = /* @__PURE__ */ new Set();\n  if (hashtags) {\n    for (const hashtag of hashtags) {\n      if (tagIds.has(hashtag.slice(1))) continue;\n      tag.add(hashtag.slice(1));\n      tagIds.add(hashtag.slice(1));\n    }\n  }\n  return Array.from(tag);\n}\nasync function generateContentTags(content, tags = []) {\n  const tagRegex = /(@|nostr:)(npub|nprofile|note|nevent|naddr)[a-zA-Z0-9]+/g;\n  const promises = [];\n  const addTagIfNew = (t) => {\n    if (!tags.find((t2) => [\"q\", t[0]].includes(t2[0]) && t2[1] === t[1])) {\n      tags.push(t);\n    }\n  };\n  content = content.replace(tagRegex, (tag) => {\n    try {\n      const entity = tag.split(/(@|nostr:)/)[2];\n      const { type, data } = nip19.decode(entity);\n      let t;\n      switch (type) {\n        case \"npub\":\n          t = [\"p\", data];\n          break;\n        case \"nprofile\":\n          t = [\"p\", data.pubkey];\n          break;\n        case \"note\":\n          promises.push(\n            new Promise(async (resolve) => {\n              addTagIfNew([\"q\", data, await maybeGetEventRelayUrl(entity)]);\n              resolve();\n            })\n          );\n          break;\n        case \"nevent\":\n          promises.push(\n            new Promise(async (resolve) => {\n              const { id, author } = data;\n              let { relays } = data;\n              if (!relays || relays.length === 0) {\n                relays = [await maybeGetEventRelayUrl(entity)];\n              }\n              addTagIfNew([\"q\", id, relays[0]]);\n              if (author) addTagIfNew([\"p\", author]);\n              resolve();\n            })\n          );\n          break;\n        case \"naddr\":\n          promises.push(\n            new Promise(async (resolve) => {\n              const id = [data.kind, data.pubkey, data.identifier].join(\":\");\n              let relays = data.relays ?? [];\n              if (relays.length === 0) {\n                relays = [await maybeGetEventRelayUrl(entity)];\n              }\n              addTagIfNew([\"q\", id, relays[0]]);\n              addTagIfNew([\"p\", data.pubkey]);\n              resolve();\n            })\n          );\n          break;\n        default:\n          return tag;\n      }\n      if (t) addTagIfNew(t);\n      return `nostr:${entity}`;\n    } catch (_error) {\n      return tag;\n    }\n  });\n  await Promise.all(promises);\n  const newTags = generateHashtags(content).map((hashtag) => [\"t\", hashtag]);\n  tags = mergeTags(tags, newTags);\n  return { content, tags };\n}\nasync function maybeGetEventRelayUrl(_nip19Id) {\n  return \"\";\n}\n\n// src/events/encryption.ts\nasync function encrypt(recipient, signer, scheme = \"nip44\") {\n  let encrypted;\n  if (!this.ndk) throw new Error(\"No NDK instance found!\");\n  let currentSigner = signer;\n  if (!currentSigner) {\n    this.ndk.assertSigner();\n    currentSigner = this.ndk.signer;\n  }\n  if (!currentSigner) throw new Error(\"no NDK signer\");\n  const currentRecipient = recipient || (() => {\n    const pTags = this.getMatchingTags(\"p\");\n    if (pTags.length !== 1) {\n      throw new Error(\"No recipient could be determined and no explicit recipient was provided\");\n    }\n    return this.ndk.getUser({ pubkey: pTags[0][1] });\n  })();\n  if (scheme === \"nip44\" && await isEncryptionEnabled(currentSigner, \"nip44\")) {\n    encrypted = await currentSigner.encrypt(currentRecipient, this.content, \"nip44\");\n  }\n  if ((!encrypted || scheme === \"nip04\") && await isEncryptionEnabled(currentSigner, \"nip04\")) {\n    encrypted = await currentSigner.encrypt(currentRecipient, this.content, \"nip04\");\n  }\n  if (!encrypted) throw new Error(\"Failed to encrypt event.\");\n  this.content = encrypted;\n}\nasync function decrypt(sender, signer, scheme) {\n  if (this.ndk?.cacheAdapter?.getDecryptedEvent) {\n    let cachedEvent = null;\n    if (typeof this.ndk.cacheAdapter.getDecryptedEvent === \"function\") {\n      cachedEvent = this.ndk.cacheAdapter.getDecryptedEvent(this.id);\n    }\n    if (cachedEvent) {\n      this.content = cachedEvent.content;\n      return;\n    }\n  }\n  let decrypted;\n  if (!this.ndk) throw new Error(\"No NDK instance found!\");\n  let currentSigner = signer;\n  if (!currentSigner) {\n    this.ndk.assertSigner();\n    currentSigner = this.ndk.signer;\n  }\n  if (!currentSigner) throw new Error(\"no NDK signer\");\n  const currentSender = sender || this.author;\n  if (!currentSender) throw new Error(\"No sender provided and no author available\");\n  const currentScheme = scheme || (this.content.match(/\\\\?iv=/) ? \"nip04\" : \"nip44\");\n  if ((currentScheme === \"nip04\" || this.kind === 4) && await isEncryptionEnabled(currentSigner, \"nip04\") && this.content.search(\"\\\\?iv=\")) {\n    decrypted = await currentSigner.decrypt(currentSender, this.content, \"nip04\");\n  }\n  if (!decrypted && currentScheme === \"nip44\" && await isEncryptionEnabled(currentSigner, \"nip44\")) {\n    decrypted = await currentSigner.decrypt(currentSender, this.content, \"nip44\");\n  }\n  if (!decrypted) throw new Error(\"Failed to decrypt event.\");\n  this.content = decrypted;\n  if (this.ndk?.cacheAdapter?.addDecryptedEvent) {\n    this.ndk.cacheAdapter.addDecryptedEvent(this);\n  }\n}\nasync function isEncryptionEnabled(signer, scheme) {\n  if (!signer.encryptionEnabled) return false;\n  if (!scheme) return true;\n  return Boolean(await signer.encryptionEnabled(scheme));\n}\n\n// src/thread/index.ts\nfunction eventsBySameAuthor(op, events) {\n  const eventsByAuthor = /* @__PURE__ */ new Map();\n  eventsByAuthor.set(op.id, op);\n  events.forEach((event) => {\n    if (event.pubkey === op.pubkey) {\n      eventsByAuthor.set(event.id, event);\n    }\n  });\n  return eventsByAuthor;\n}\nvar hasMarkers = (event, tagType) => {\n  return event.getMatchingTags(tagType).some((tag) => tag[3] && tag[3] !== \"\");\n};\nfunction eventIsReply(op, event, threadIds = /* @__PURE__ */ new Set(), tagType) {\n  tagType ??= op.tagType();\n  const tags = event.getMatchingTags(tagType);\n  threadIds.add(op.tagId());\n  if (threadIds.has(event.tagId())) return false;\n  const heedExplicitReplyMarker = () => {\n    let eventIsTagged = false;\n    for (const tag of tags) {\n      if (tag[3] === \"reply\") return threadIds.has(tag[1]);\n      const markerIsEmpty = tag[3] === \"\" || tag[3] === void 0;\n      const markerIsRoot = tag[3] === \"root\";\n      if (tag[1] === op.tagId() && (markerIsEmpty || markerIsRoot)) {\n        eventIsTagged = markerIsRoot ? \"root\" : true;\n      }\n    }\n    if (!eventIsTagged) return false;\n    if (eventIsTagged === \"root\") return true;\n  };\n  const explicitReplyMarker = heedExplicitReplyMarker();\n  if (explicitReplyMarker !== void 0) return explicitReplyMarker;\n  if (hasMarkers(event, tagType)) return false;\n  const expectedTags = op.getMatchingTags(\"e\").map((tag) => tag[1]);\n  expectedTags.push(op.id);\n  return event.getMatchingTags(\"e\").every((tag) => expectedTags.includes(tag[1]));\n}\nfunction eventThreads(op, events) {\n  const eventsByAuthor = eventsBySameAuthor(op, events);\n  const threadEvents = events.filter((event) => eventIsPartOfThread(op, event, eventsByAuthor));\n  return threadEvents.sort((a, b) => a.created_at - b.created_at);\n}\nfunction getEventReplyId(event) {\n  const replyTag = getReplyTag(event);\n  if (replyTag) return replyTag[1];\n  const rootTag = getRootTag(event);\n  if (rootTag) return rootTag[1];\n}\nfunction isEventOriginalPost(event) {\n  return getEventReplyId(event) === void 0;\n}\nfunction eventThreadIds(op, events) {\n  const threadIds = /* @__PURE__ */ new Map();\n  const threadEvents = eventThreads(op, events);\n  threadEvents.forEach((event) => threadIds.set(event.id, event));\n  return threadIds;\n}\nfunction eventReplies(op, events, threadEventIds) {\n  threadEventIds ??= new Set(eventThreadIds(op, events).keys());\n  return events.filter((event) => eventIsReply(op, event, threadEventIds));\n}\nfunction eventIsPartOfThread(op, event, eventsByAuthor) {\n  if (op.pubkey !== event.pubkey) return false;\n  const taggedEventIds = event.getMatchingTags(\"e\").map((tag) => tag[1]);\n  const allTaggedEventsAreByOriginalAuthor = taggedEventIds.every((id) => eventsByAuthor.has(id));\n  return allTaggedEventsAreByOriginalAuthor;\n}\nfunction eventHasETagMarkers(event) {\n  for (const tag of event.tags) {\n    if (tag[0] === \"e\" && (tag[3] ?? \"\").length > 0) return true;\n  }\n  return false;\n}\nfunction getRootEventId(event, searchTag) {\n  searchTag ??= event.tagType();\n  const rootEventTag = getRootTag(event, searchTag);\n  if (rootEventTag) return rootEventTag[1];\n  const replyTag = getReplyTag(event, searchTag);\n  return replyTag?.[1];\n}\nfunction getRootTag(event, searchTag) {\n  searchTag ??= event.tagType();\n  const rootEventTag = event.tags.find(isTagRootTag);\n  if (!rootEventTag) {\n    if (eventHasETagMarkers(event)) return;\n    const matchingTags = event.getMatchingTags(searchTag);\n    if (matchingTags.length < 3) return matchingTags[0];\n  }\n  return rootEventTag;\n}\nvar nip22RootTags = /* @__PURE__ */ new Set([\"A\", \"E\", \"I\"]);\nvar nip22ReplyTags = /* @__PURE__ */ new Set([\"a\", \"e\", \"i\"]);\nfunction getReplyTag(event, searchTag) {\n  if (event.kind === 1111 /* GenericReply */) {\n    let replyTag2;\n    for (const tag of event.tags) {\n      if (nip22RootTags.has(tag[0])) replyTag2 = tag;\n      else if (nip22ReplyTags.has(tag[0])) {\n        replyTag2 = tag;\n        break;\n      }\n    }\n    return replyTag2;\n  }\n  searchTag ??= event.tagType();\n  let hasMarkers2 = false;\n  let replyTag;\n  for (const tag of event.tags) {\n    if (tag[0] !== searchTag) continue;\n    if ((tag[3] ?? \"\").length > 0) hasMarkers2 = true;\n    if (hasMarkers2 && tag[3] === \"reply\") return tag;\n    if (hasMarkers2 && tag[3] === \"root\") replyTag = tag;\n    if (!hasMarkers2) replyTag = tag;\n  }\n  return replyTag;\n}\nfunction isTagRootTag(tag) {\n  return tag[0] === \"E\" || tag[3] === \"root\";\n}\n\n// src/events/fetch-tagged-event.ts\nasync function fetchTaggedEvent(tag, marker) {\n  if (!this.ndk) throw new Error(\"NDK instance not found\");\n  const t = this.getMatchingTags(tag, marker);\n  if (t.length === 0) return void 0;\n  const [_, id, hint] = t[0];\n  let relay = hint !== \"\" ? this.ndk.pool.getRelay(hint) : void 0;\n  const event = await this.ndk.fetchEvent(id, {}, relay);\n  return event;\n}\nasync function fetchRootEvent(subOpts) {\n  if (!this.ndk) throw new Error(\"NDK instance not found\");\n  const rootTag = getRootTag(this);\n  if (!rootTag) return void 0;\n  return this.ndk.fetchEventFromTag(rootTag, this, subOpts);\n}\nasync function fetchReplyEvent(subOpts) {\n  if (!this.ndk) throw new Error(\"NDK instance not found\");\n  const replyTag = getReplyTag(this);\n  if (!replyTag) return void 0;\n  return this.ndk.fetchEventFromTag(replyTag, this, subOpts);\n}\n\n// src/events/kind.ts\nfunction isReplaceable() {\n  if (this.kind === void 0) throw new Error(\"Kind not set\");\n  return [0, 3].includes(this.kind) || this.kind >= 1e4 && this.kind < 2e4 || this.kind >= 3e4 && this.kind < 4e4;\n}\nfunction isEphemeral() {\n  if (this.kind === void 0) throw new Error(\"Kind not set\");\n  return this.kind >= 2e4 && this.kind < 3e4;\n}\nfunction isParamReplaceable() {\n  if (this.kind === void 0) throw new Error(\"Kind not set\");\n  return this.kind >= 3e4 && this.kind < 4e4;\n}\n\n// src/events/nip19.ts\nimport { nip19 as nip192 } from \"nostr-tools\";\nvar DEFAULT_RELAY_COUNT = 2;\nfunction encode(maxRelayCount = DEFAULT_RELAY_COUNT) {\n  let relays = [];\n  if (this.onRelays.length > 0) {\n    relays = this.onRelays.map((relay) => relay.url);\n  } else if (this.relay) {\n    relays = [this.relay.url];\n  }\n  if (relays.length > maxRelayCount) {\n    relays = relays.slice(0, maxRelayCount);\n  }\n  if (this.isParamReplaceable()) {\n    return nip192.naddrEncode({\n      kind: this.kind,\n      pubkey: this.pubkey,\n      identifier: this.replaceableDTag(),\n      relays\n    });\n  }\n  if (relays.length > 0) {\n    return nip192.neventEncode({\n      id: this.tagId(),\n      relays,\n      author: this.pubkey\n    });\n  }\n  return nip192.noteEncode(this.tagId());\n}\n\n// src/events/repost.ts\nasync function repost(publish = true, signer) {\n  if (!signer && publish) {\n    if (!this.ndk) throw new Error(\"No NDK instance found\");\n    this.ndk.assertSigner();\n    signer = this.ndk.signer;\n  }\n  const e = new NDKEvent(this.ndk, {\n    kind: getKind(this)\n  });\n  if (!this.isProtected) e.content = JSON.stringify(this.rawEvent());\n  e.tag(this);\n  if (this.kind !== 1 /* Text */) {\n    e.tags.push([\"k\", `${this.kind}`]);\n  }\n  if (signer) await e.sign(signer);\n  if (publish) await e.publish();\n  return e;\n}\nfunction getKind(event) {\n  if (event.kind === 1) {\n    return 6 /* Repost */;\n  }\n  return 16 /* GenericRepost */;\n}\n\n// src/events/serializer.ts\nfunction serialize(includeSig = false, includeId = false) {\n  const payload = [0, this.pubkey, this.created_at, this.kind, this.tags, this.content];\n  if (includeSig) payload.push(this.sig);\n  if (includeId) payload.push(this.id);\n  return JSON.stringify(payload);\n}\nfunction deserialize(serializedEvent) {\n  const eventArray = JSON.parse(serializedEvent);\n  const ret = {\n    pubkey: eventArray[1],\n    created_at: eventArray[2],\n    kind: eventArray[3],\n    tags: eventArray[4],\n    content: eventArray[5]\n  };\n  if (eventArray.length >= 7) ret.sig = eventArray[6];\n  if (eventArray.length >= 8) ret.id = eventArray[7];\n  return ret;\n}\n\n// src/events/validation.ts\nimport { schnorr } from \"@noble/curves/secp256k1\";\nimport { sha256 } from \"@noble/hashes/sha256\";\nimport { bytesToHex } from \"@noble/hashes/utils\";\nimport { LRUCache } from \"typescript-lru-cache\";\n\n// src/events/signature.ts\nvar worker;\nvar processingQueue = {};\nfunction signatureVerificationInit(w) {\n  worker = w;\n  worker.onmessage = (msg) => {\n    const [eventId, result] = msg.data;\n    const record = processingQueue[eventId];\n    if (!record) {\n      console.error(\"No record found for event\", eventId);\n      return;\n    }\n    delete processingQueue[eventId];\n    for (const resolve of record.resolves) {\n      resolve(result);\n    }\n  };\n}\nasync function verifySignatureAsync(event, _persist) {\n  const promise = new Promise((resolve) => {\n    const serialized = event.serialize();\n    let enqueue = false;\n    if (!processingQueue[event.id]) {\n      processingQueue[event.id] = { event, resolves: [] };\n      enqueue = true;\n    }\n    processingQueue[event.id].resolves.push(resolve);\n    if (!enqueue) return;\n    worker?.postMessage({\n      serialized,\n      id: event.id,\n      sig: event.sig,\n      pubkey: event.pubkey\n    });\n  });\n  return promise;\n}\n\n// src/events/validation.ts\nvar PUBKEY_REGEX = /^[a-f0-9]{64}$/;\nfunction validate() {\n  if (typeof this.kind !== \"number\") return false;\n  if (typeof this.content !== \"string\") return false;\n  if (typeof this.created_at !== \"number\") return false;\n  if (typeof this.pubkey !== \"string\") return false;\n  if (!this.pubkey.match(PUBKEY_REGEX)) return false;\n  if (!Array.isArray(this.tags)) return false;\n  for (let i = 0; i < this.tags.length; i++) {\n    const tag = this.tags[i];\n    if (!Array.isArray(tag)) return false;\n    for (let j = 0; j < tag.length; j++) {\n      if (typeof tag[j] === \"object\") return false;\n    }\n  }\n  return true;\n}\nvar verifiedSignatures = new LRUCache({\n  maxSize: 1e3,\n  entryExpirationTimeInMS: 6e4\n});\nfunction verifySignature(persist) {\n  if (typeof this.signatureVerified === \"boolean\") return this.signatureVerified;\n  const prevVerification = verifiedSignatures.get(this.id);\n  if (prevVerification !== null) {\n    this.signatureVerified = !!prevVerification;\n    return this.signatureVerified;\n  }\n  try {\n    if (this.ndk?.asyncSigVerification) {\n      verifySignatureAsync(this, persist).then((result) => {\n        if (persist) {\n          this.signatureVerified = result;\n          if (result) verifiedSignatures.set(this.id, this.sig);\n        }\n        if (!result) {\n          this.ndk?.emit(\"event:invalid-sig\", this);\n          verifiedSignatures.set(this.id, false);\n        }\n      });\n    } else {\n      const hash = sha256(new TextEncoder().encode(this.serialize()));\n      const res = schnorr.verify(this.sig, hash, this.pubkey);\n      if (res) verifiedSignatures.set(this.id, this.sig);\n      else verifiedSignatures.set(this.id, false);\n      this.signatureVerified = res;\n      return res;\n    }\n  } catch (_err) {\n    this.signatureVerified = false;\n    return false;\n  }\n}\nfunction getEventHash() {\n  return getEventHashFromSerializedEvent(this.serialize());\n}\nfunction getEventHashFromSerializedEvent(serializedEvent) {\n  const eventHash = sha256(new TextEncoder().encode(serializedEvent));\n  return bytesToHex(eventHash);\n}\n\n// src/events/index.ts\nvar skipClientTagOnKinds = /* @__PURE__ */ new Set([\n  0 /* Metadata */,\n  4 /* EncryptedDirectMessage */,\n  1059 /* GiftWrap */,\n  13 /* GiftWrapSeal */,\n  3 /* Contacts */,\n  9734 /* ZapRequest */,\n  5 /* EventDeletion */\n]);\nvar NDKEvent = class _NDKEvent extends EventEmitter2 {\n  ndk;\n  created_at;\n  content = \"\";\n  tags = [];\n  kind;\n  id = \"\";\n  sig;\n  pubkey = \"\";\n  signatureVerified;\n  _author = void 0;\n  /**\n   * The relay that this event was first received from.\n   */\n  relay;\n  /**\n   * The relays that this event was received from and/or successfully published to.\n   */\n  get onRelays() {\n    let res = [];\n    if (!this.ndk) {\n      if (this.relay) res.push(this.relay);\n    } else {\n      res = this.ndk.subManager.seenEvents.get(this.id) || [];\n    }\n    return res;\n  }\n  /**\n   * The status of the publish operation.\n   */\n  publishStatus = \"success\";\n  publishError;\n  constructor(ndk, event) {\n    super();\n    this.ndk = ndk;\n    this.created_at = event?.created_at;\n    this.content = event?.content || \"\";\n    this.tags = event?.tags || [];\n    this.id = event?.id || \"\";\n    this.sig = event?.sig;\n    this.pubkey = event?.pubkey || \"\";\n    this.kind = event?.kind;\n    if (event instanceof _NDKEvent) {\n      if (this.relay) {\n        this.relay = event.relay;\n        this.ndk?.subManager.seenEvent(event.id, this.relay);\n      }\n      this.publishStatus = event.publishStatus;\n      this.publishError = event.publishError;\n    }\n  }\n  /**\n   * Deserialize an NDKEvent from a serialized payload.\n   * @param ndk\n   * @param event\n   * @returns\n   */\n  static deserialize(ndk, event) {\n    return new _NDKEvent(ndk, deserialize(event));\n  }\n  /**\n   * Returns the event as is.\n   */\n  rawEvent() {\n    return {\n      created_at: this.created_at,\n      content: this.content,\n      tags: this.tags,\n      kind: this.kind,\n      pubkey: this.pubkey,\n      id: this.id,\n      sig: this.sig\n    };\n  }\n  set author(user) {\n    this.pubkey = user.pubkey;\n    this._author = user;\n    this._author.ndk ??= this.ndk;\n  }\n  /**\n   * Returns an NDKUser for the author of the event.\n   */\n  get author() {\n    if (this._author) return this._author;\n    if (!this.ndk) throw new Error(\"No NDK instance found\");\n    const user = this.ndk.getUser({ pubkey: this.pubkey });\n    this._author = user;\n    return user;\n  }\n  /**\n   * NIP-73 tagging of external entities\n   * @param entity to be tagged\n   * @param type of the entity\n   * @param markerUrl to be used as the marker URL\n   *\n   * @example\n   * ```typescript\n   * event.tagExternal(\"https://example.com/article/123#nostr\", \"url\");\n   * event.tags => [[\"i\", \"https://example.com/123\"], [\"k\", \"https://example.com\"]]\n   * ```\n   *\n   * @example tag a podcast:item:guid\n   * ```typescript\n   * event.tagExternal(\"e32b4890-b9ea-4aef-a0bf-54b787833dc5\", \"podcast:item:guid\");\n   * event.tags => [[\"i\", \"podcast:item:guid:e32b4890-b9ea-4aef-a0bf-54b787833dc5\"], [\"k\", \"podcast:item:guid\"]]\n   * ```\n   *\n   * @see https://github.com/nostr-protocol/nips/blob/master/73.md\n   */\n  tagExternal(entity, type, markerUrl) {\n    const iTag = [\"i\"];\n    const kTag = [\"k\"];\n    switch (type) {\n      case \"url\": {\n        const url = new URL(entity);\n        url.hash = \"\";\n        iTag.push(url.toString());\n        kTag.push(`${url.protocol}//${url.host}`);\n        break;\n      }\n      case \"hashtag\":\n        iTag.push(`#${entity.toLowerCase()}`);\n        kTag.push(\"#\");\n        break;\n      case \"geohash\":\n        iTag.push(`geo:${entity.toLowerCase()}`);\n        kTag.push(\"geo\");\n        break;\n      case \"isbn\":\n        iTag.push(`isbn:${entity.replace(/-/g, \"\")}`);\n        kTag.push(\"isbn\");\n        break;\n      case \"podcast:guid\":\n        iTag.push(`podcast:guid:${entity}`);\n        kTag.push(\"podcast:guid\");\n        break;\n      case \"podcast:item:guid\":\n        iTag.push(`podcast:item:guid:${entity}`);\n        kTag.push(\"podcast:item:guid\");\n        break;\n      case \"podcast:publisher:guid\":\n        iTag.push(`podcast:publisher:guid:${entity}`);\n        kTag.push(\"podcast:publisher:guid\");\n        break;\n      case \"isan\":\n        iTag.push(`isan:${entity.split(\"-\").slice(0, 4).join(\"-\")}`);\n        kTag.push(\"isan\");\n        break;\n      case \"doi\":\n        iTag.push(`doi:${entity.toLowerCase()}`);\n        kTag.push(\"doi\");\n        break;\n      default:\n        throw new Error(`Unsupported NIP-73 entity type: ${type}`);\n    }\n    if (markerUrl) {\n      iTag.push(markerUrl);\n    }\n    this.tags.push(iTag);\n    this.tags.push(kTag);\n  }\n  /**\n   * Tag a user with an optional marker.\n   * @param target What is to be tagged. Can be an NDKUser, NDKEvent, or an NDKTag.\n   * @param marker The marker to use in the tag.\n   * @param skipAuthorTag Whether to explicitly skip adding the author tag of the event.\n   * @param forceTag Force a specific tag to be used instead of the default \"e\" or \"a\" tag.\n   * @example\n   * ```typescript\n   * reply.tag(opEvent, \"reply\");\n   * // reply.tags => [[\"e\", <id>, <relay>, \"reply\"]]\n   * ```\n   */\n  tag(target, marker, skipAuthorTag, forceTag) {\n    let tags = [];\n    const isNDKUser = target.fetchProfile !== void 0;\n    if (isNDKUser) {\n      forceTag ??= \"p\";\n      const tag = [forceTag, target.pubkey];\n      if (marker) tag.push(...[\"\", marker]);\n      tags.push(tag);\n    } else if (target instanceof _NDKEvent) {\n      const event = target;\n      skipAuthorTag ??= event?.pubkey === this.pubkey;\n      tags = event.referenceTags(marker, skipAuthorTag, forceTag);\n      for (const pTag of event.getMatchingTags(\"p\")) {\n        if (pTag[1] === this.pubkey) continue;\n        if (this.tags.find((t) => t[0] === \"p\" && t[1] === pTag[1])) continue;\n        this.tags.push([\"p\", pTag[1]]);\n      }\n    } else if (Array.isArray(target)) {\n      tags = [target];\n    } else {\n      throw new Error(\"Invalid argument\", target);\n    }\n    this.tags = mergeTags(this.tags, tags);\n  }\n  /**\n   * Return a NostrEvent object, trying to fill in missing fields\n   * when possible, adding tags when necessary.\n   * @param pubkey {string} The pubkey of the user who the event belongs to.\n   * @returns {Promise<NostrEvent>} A promise that resolves to a NostrEvent.\n   */\n  async toNostrEvent(pubkey) {\n    if (!pubkey && this.pubkey === \"\") {\n      const user = await this.ndk?.signer?.user();\n      this.pubkey = user?.pubkey || \"\";\n    }\n    if (!this.created_at) {\n      this.created_at = Math.floor(Date.now() / 1e3);\n    }\n    const { content, tags } = await this.generateTags();\n    this.content = content || \"\";\n    this.tags = tags;\n    try {\n      this.id = this.getEventHash();\n    } catch (_e) {\n    }\n    return this.rawEvent();\n  }\n  serialize = serialize.bind(this);\n  getEventHash = getEventHash.bind(this);\n  validate = validate.bind(this);\n  verifySignature = verifySignature.bind(this);\n  /**\n   * Is this event replaceable (whether parameterized or not)?\n   *\n   * This will return true for kind 0, 3, 10k-20k and 30k-40k\n   */\n  isReplaceable = isReplaceable.bind(this);\n  isEphemeral = isEphemeral.bind(this);\n  isDvm = () => this.kind && this.kind >= 5e3 && this.kind <= 7e3;\n  /**\n   * Is this event parameterized replaceable?\n   *\n   * This will return true for kind 30k-40k\n   */\n  isParamReplaceable = isParamReplaceable.bind(this);\n  /**\n   * Encodes a bech32 id.\n   *\n   * @param relays {string[]} The relays to encode in the id\n   * @returns {string} - Encoded naddr, note or nevent.\n   */\n  encode = encode.bind(this);\n  encrypt = encrypt.bind(this);\n  decrypt = decrypt.bind(this);\n  /**\n   * Get all tags with the given name\n   * @param tagName {string} The name of the tag to search for\n   * @returns {NDKTag[]} An array of the matching tags\n   */\n  getMatchingTags(tagName, marker) {\n    const t = this.tags.filter((tag) => tag[0] === tagName);\n    if (marker === void 0) return t;\n    return t.filter((tag) => tag[3] === marker);\n  }\n  /**\n   * Check if the event has a tag with the given name\n   * @param tagName\n   * @param marker\n   * @returns\n   */\n  hasTag(tagName, marker) {\n    return this.tags.some((tag) => tag[0] === tagName && (!marker || tag[3] === marker));\n  }\n  /**\n   * Get the first tag with the given name\n   * @param tagName Tag name to search for\n   * @returns The value of the first tag with the given name, or undefined if no such tag exists\n   */\n  tagValue(tagName) {\n    const tags = this.getMatchingTags(tagName);\n    if (tags.length === 0) return void 0;\n    return tags[0][1];\n  }\n  /**\n   * Gets the NIP-31 \"alt\" tag of the event.\n   */\n  get alt() {\n    return this.tagValue(\"alt\");\n  }\n  /**\n   * Sets the NIP-31 \"alt\" tag of the event. Use this to set an alt tag so\n   * clients that don't handle a particular event kind can display something\n   * useful for users.\n   */\n  set alt(alt) {\n    this.removeTag(\"alt\");\n    if (alt) this.tags.push([\"alt\", alt]);\n  }\n  /**\n   * Gets the NIP-33 \"d\" tag of the event.\n   */\n  get dTag() {\n    return this.tagValue(\"d\");\n  }\n  /**\n   * Sets the NIP-33 \"d\" tag of the event.\n   */\n  set dTag(value) {\n    this.removeTag(\"d\");\n    if (value) this.tags.push([\"d\", value]);\n  }\n  /**\n   * Remove all tags with the given name (e.g. \"d\", \"a\", \"p\")\n   * @param tagName Tag name(s) to search for and remove\n   * @returns {void}\n   */\n  removeTag(tagName) {\n    const tagNames = Array.isArray(tagName) ? tagName : [tagName];\n    this.tags = this.tags.filter((tag) => !tagNames.includes(tag[0]));\n  }\n  /**\n   * Replace a tag with a new value. If not found, it will be added.\n   * @param tag The tag to replace.\n   * @param value The new value for the tag.\n   */\n  replaceTag(tag) {\n    this.removeTag(tag[0]);\n    this.tags.push(tag);\n  }\n  /**\n   * Sign the event if a signer is present.\n   *\n   * It will generate tags.\n   * Repleacable events will have their created_at field set to the current time.\n   * @param signer {NDKSigner} The NDKSigner to use to sign the event\n   * @returns {Promise<string>} A Promise that resolves to the signature of the signed event.\n   */\n  async sign(signer) {\n    if (!signer) {\n      this.ndk?.assertSigner();\n      signer = this.ndk?.signer;\n    } else {\n      this.author = await signer.user();\n    }\n    const nostrEvent = await this.toNostrEvent();\n    this.sig = await signer.sign(nostrEvent);\n    return this.sig;\n  }\n  /**\n   *\n   * @param relaySet\n   * @param timeoutMs\n   * @param requiredRelayCount\n   * @returns\n   */\n  async publishReplaceable(relaySet, timeoutMs, requiredRelayCount) {\n    this.id = \"\";\n    this.created_at = Math.floor(Date.now() / 1e3);\n    this.sig = \"\";\n    return this.publish(relaySet, timeoutMs, requiredRelayCount);\n  }\n  /**\n   * Attempt to sign and then publish an NDKEvent to a given relaySet.\n   * If no relaySet is provided, the relaySet will be calculated by NDK.\n   * @param relaySet {NDKRelaySet} The relaySet to publish the even to.\n   * @param timeoutM {number} The timeout for the publish operation in milliseconds.\n   * @param requiredRelayCount The number of relays that must receive the event for the publish to be considered successful.\n   * @returns A promise that resolves to the relays the event was published to.\n   */\n  async publish(relaySet, timeoutMs, requiredRelayCount) {\n    if (!this.sig) await this.sign();\n    if (!this.ndk) throw new Error(\"NDKEvent must be associated with an NDK instance to publish\");\n    if (!relaySet || relaySet.size === 0) {\n      relaySet = this.ndk.devWriteRelaySet || await calculateRelaySetFromEvent(this.ndk, this);\n    }\n    if (this.kind === 5 /* EventDeletion */ && this.ndk.cacheAdapter?.deleteEventIds) {\n      const eTags = this.getMatchingTags(\"e\").map((tag) => tag[1]);\n      this.ndk.cacheAdapter.deleteEventIds(eTags);\n    }\n    const rawEvent = this.rawEvent();\n    if (this.ndk.cacheAdapter?.addUnpublishedEvent && shouldTrackUnpublishedEvent(this)) {\n      try {\n        this.ndk.cacheAdapter.addUnpublishedEvent(this, relaySet.relayUrls);\n      } catch (e) {\n        console.error(\"Error adding unpublished event to cache\", e);\n      }\n    }\n    if (this.kind === 5 /* EventDeletion */ && this.ndk.cacheAdapter?.deleteEventIds) {\n      this.ndk.cacheAdapter.deleteEventIds(this.getMatchingTags(\"e\").map((tag) => tag[1]));\n    }\n    this.ndk.subManager.dispatchEvent(rawEvent, void 0, true);\n    const relays = await relaySet.publish(this, timeoutMs, requiredRelayCount);\n    relays.forEach((relay) => this.ndk?.subManager.seenEvent(this.id, relay));\n    return relays;\n  }\n  /**\n   * Generates tags for users, notes, and other events tagged in content.\n   * Will also generate random \"d\" tag for parameterized replaceable events where needed.\n   * @returns {ContentTag} The tags and content of the event.\n   */\n  async generateTags() {\n    let tags = [];\n    const g = await generateContentTags(this.content, this.tags);\n    const content = g.content;\n    tags = g.tags;\n    if (this.kind && this.isParamReplaceable()) {\n      const dTag = this.getMatchingTags(\"d\")[0];\n      if (!dTag) {\n        const title = this.tagValue(\"title\");\n        const randLength = title ? 6 : 16;\n        let str = [...Array(randLength)].map(() => Math.random().toString(36)[2]).join(\"\");\n        if (title && title.length > 0) {\n          str = `${title.replace(/[^a-z0-9]+/gi, \"-\").replace(/^-|-$/g, \"\")}-${str}`;\n        }\n        tags.push([\"d\", str]);\n      }\n    }\n    if (this.shouldAddClientTag) {\n      const clientTag = [\"client\", this.ndk?.clientName ?? \"\"];\n      if (this.ndk?.clientNip89) clientTag.push(this.ndk?.clientNip89);\n      tags.push(clientTag);\n    } else if (this.shouldStripClientTag) {\n      tags = tags.filter((tag) => tag[0] !== \"client\");\n    }\n    return { content: content || \"\", tags };\n  }\n  get shouldAddClientTag() {\n    if (!this.ndk?.clientName && !this.ndk?.clientNip89) return false;\n    if (skipClientTagOnKinds.has(this.kind)) return false;\n    if (this.isEphemeral()) return false;\n    if (this.isReplaceable() && !this.isParamReplaceable()) return false;\n    if (this.isDvm()) return false;\n    if (this.hasTag(\"client\")) return false;\n    return true;\n  }\n  get shouldStripClientTag() {\n    return skipClientTagOnKinds.has(this.kind);\n  }\n  muted() {\n    const authorMutedEntry = this.ndk?.mutedIds.get(this.pubkey);\n    if (authorMutedEntry && authorMutedEntry === \"p\") return \"author\";\n    const eventTagReference = this.tagReference();\n    const eventMutedEntry = this.ndk?.mutedIds.get(eventTagReference[1]);\n    if (eventMutedEntry && eventMutedEntry === eventTagReference[0]) return \"event\";\n    return null;\n  }\n  /**\n   * Returns the \"d\" tag of a parameterized replaceable event or throws an error if the event isn't\n   * a parameterized replaceable event.\n   * @returns {string} the \"d\" tag of the event.\n   *\n   * @deprecated Use `dTag` instead.\n   */\n  replaceableDTag() {\n    if (this.kind && this.kind >= 3e4 && this.kind <= 4e4) {\n      const dTag = this.getMatchingTags(\"d\")[0];\n      const dTagId = dTag ? dTag[1] : \"\";\n      return dTagId;\n    }\n    throw new Error(\"Event is not a parameterized replaceable event\");\n  }\n  /**\n   * Provides a deduplication key for the event.\n   *\n   * For kinds 0, 3, 10k-20k this will be the event <kind>:<pubkey>\n   * For kinds 30k-40k this will be the event <kind>:<pubkey>:<d-tag>\n   * For all other kinds this will be the event id\n   */\n  deduplicationKey() {\n    if (this.kind === 0 || this.kind === 3 || this.kind && this.kind >= 1e4 && this.kind < 2e4) {\n      return `${this.kind}:${this.pubkey}`;\n    }\n    return this.tagId();\n  }\n  /**\n   * Returns the id of the event or, if it's a parameterized event, the generated id of the event using \"d\" tag, pubkey, and kind.\n   * @returns {string} The id\n   */\n  tagId() {\n    if (this.isParamReplaceable()) {\n      return this.tagAddress();\n    }\n    return this.id;\n  }\n  /**\n   * Returns a stable reference value for a replaceable event.\n   *\n   * Param replaceable events are returned in the expected format of `<kind>:<pubkey>:<d-tag>`.\n   * Kind-replaceable events are returned in the format of `<kind>:<pubkey>:`.\n   *\n   * @returns {string} A stable reference value for replaceable events\n   */\n  tagAddress() {\n    if (this.isParamReplaceable()) {\n      const dTagId = this.dTag ?? \"\";\n      return `${this.kind}:${this.pubkey}:${dTagId}`;\n    }\n    if (this.isReplaceable()) {\n      return `${this.kind}:${this.pubkey}:`;\n    }\n    throw new Error(\"Event is not a replaceable event\");\n  }\n  /**\n   * Determines the type of tag that can be used to reference this event from another event.\n   * @returns {string} The tag type\n   * @example\n   * event = new NDKEvent(ndk, { kind: 30000, pubkey: 'pubkey', tags: [ [\"d\", \"d-code\"] ] });\n   * event.tagType(); // \"a\"\n   */\n  tagType() {\n    return this.isParamReplaceable() ? \"a\" : \"e\";\n  }\n  /**\n   * Get the tag that can be used to reference this event from another event.\n   *\n   * Consider using referenceTags() instead (unless you have a good reason to use this)\n   *\n   * @example\n   *     event = new NDKEvent(ndk, { kind: 30000, pubkey: 'pubkey', tags: [ [\"d\", \"d-code\"] ] });\n   *     event.tagReference(); // [\"a\", \"30000:pubkey:d-code\"]\n   *\n   *     event = new NDKEvent(ndk, { kind: 1, pubkey: 'pubkey', id: \"eventid\" });\n   *     event.tagReference(); // [\"e\", \"eventid\"]\n   * @returns {NDKTag} The NDKTag object referencing this event\n   */\n  tagReference(marker) {\n    let tag;\n    if (this.isParamReplaceable()) {\n      tag = [\"a\", this.tagAddress()];\n    } else {\n      tag = [\"e\", this.tagId()];\n    }\n    if (this.relay) {\n      tag.push(this.relay.url);\n    } else {\n      tag.push(\"\");\n    }\n    tag.push(marker ?? \"\");\n    if (!this.isParamReplaceable()) {\n      tag.push(this.pubkey);\n    }\n    return tag;\n  }\n  /**\n   * Get the tags that can be used to reference this event from another event\n   * @param marker The marker to use in the tag\n   * @param skipAuthorTag Whether to explicitly skip adding the author tag of the event\n   * @param forceTag Force a specific tag to be used instead of the default \"e\" or \"a\" tag\n   * @example\n   *     event = new NDKEvent(ndk, { kind: 30000, pubkey: 'pubkey', tags: [ [\"d\", \"d-code\"] ] });\n   *     event.referenceTags(); // [[\"a\", \"30000:pubkey:d-code\"], [\"e\", \"parent-id\"]]\n   *\n   *     event = new NDKEvent(ndk, { kind: 1, pubkey: 'pubkey', id: \"eventid\" });\n   *     event.referenceTags(); // [[\"e\", \"parent-id\"]]\n   * @returns {NDKTag} The NDKTag object referencing this event\n   */\n  referenceTags(marker, skipAuthorTag, forceTag) {\n    let tags = [];\n    if (this.isParamReplaceable()) {\n      tags = [\n        [forceTag ?? \"a\", this.tagAddress()],\n        [forceTag ?? \"e\", this.id]\n      ];\n    } else {\n      tags = [[forceTag ?? \"e\", this.id]];\n    }\n    tags = tags.map((tag) => {\n      if (tag[0] === \"e\" || marker) {\n        tag.push(this.relay?.url ?? \"\");\n      } else if (this.relay?.url) {\n        tag.push(this.relay?.url);\n      }\n      return tag;\n    });\n    tags.forEach((tag) => {\n      if (tag[0] === \"e\") {\n        tag.push(marker ?? \"\");\n        tag.push(this.pubkey);\n      } else if (marker) {\n        tag.push(marker);\n      }\n    });\n    tags = [...tags, ...this.getMatchingTags(\"h\")];\n    if (!skipAuthorTag) tags.push(...this.author.referenceTags());\n    return tags;\n  }\n  /**\n   * Provides the filter that will return matching events for this event.\n   *\n   * @example\n   *    event = new NDKEvent(ndk, { kind: 30000, pubkey: 'pubkey', tags: [ [\"d\", \"d-code\"] ] });\n   *    event.filter(); // { \"#a\": [\"30000:pubkey:d-code\"] }\n   * @example\n   *    event = new NDKEvent(ndk, { kind: 1, pubkey: 'pubkey', id: \"eventid\" });\n   *    event.filter(); // { \"#e\": [\"eventid\"] }\n   *\n   * @returns The filter that will return matching events for this event\n   */\n  filter() {\n    if (this.isParamReplaceable()) {\n      return { \"#a\": [this.tagId()] };\n    }\n    return { \"#e\": [this.tagId()] };\n  }\n  nip22Filter() {\n    if (this.isParamReplaceable()) {\n      return { \"#A\": [this.tagId()] };\n    }\n    return { \"#E\": [this.tagId()] };\n  }\n  /**\n   * Generates a deletion event of the current event\n   *\n   * @param reason The reason for the deletion\n   * @param publish Whether to publish the deletion event automatically\n   * @returns The deletion event\n   */\n  async delete(reason, publish = true) {\n    if (!this.ndk) throw new Error(\"No NDK instance found\");\n    this.ndk.assertSigner();\n    const e = new _NDKEvent(this.ndk, {\n      kind: 5 /* EventDeletion */,\n      content: reason || \"\"\n    });\n    e.tag(this, void 0, true);\n    e.tags.push([\"k\", this.kind?.toString()]);\n    if (publish) {\n      this.emit(\"deleted\");\n      await e.publish();\n    }\n    return e;\n  }\n  /**\n   * Establishes whether this is a NIP-70-protectede event.\n   * @@satisfies NIP-70\n   */\n  set isProtected(val) {\n    this.removeTag(\"-\");\n    if (val) this.tags.push([\"-\"]);\n  }\n  /**\n   * Whether this is a NIP-70-protected event.\n   * @@satisfies NIP-70\n   */\n  get isProtected() {\n    return this.hasTag(\"-\");\n  }\n  /**\n   * Fetch an event tagged with the given tag following relay hints if provided.\n   * @param tag The tag to search for\n   * @param marker The marker to use in the tag (e.g. \"root\")\n   * @returns The fetched event or null if no event was found, undefined if no matching tag was found in the event\n   * * @example\n   * const replyEvent = await ndk.fetchEvent(\"nevent1qqs8x8vnycyha73grv380gmvlury4wtmx0nr9a5ds2dngqwgu87wn6gpzemhxue69uhhyetvv9ujuurjd9kkzmpwdejhgq3ql2vyh47mk2p0qlsku7hg0vn29faehy9hy34ygaclpn66ukqp3afqz4cwjd\")\n   * const originalEvent = await replyEvent.fetchTaggedEvent(\"e\", \"reply\");\n   * console.log(replyEvent.encode() + \" is a reply to event \" + originalEvent?.encode());\n   */\n  fetchTaggedEvent = fetchTaggedEvent.bind(this);\n  /**\n   * Fetch the root event of the current event.\n   * @returns The fetched root event or null if no event was found\n   * @example\n   * const replyEvent = await ndk.fetchEvent(\"nevent1qqs8x8vnycyha73grv380gmvlury4wtmx0nr9a5ds2dngqwgu87wn6gpzemhxue69uhhyetvv9ujuurjd9kkzmpwdejhgq3ql2vyh47mk2p0qlsku7hg0vn29faehy9hy34ygaclpn66ukqp3afqz4cwjd\")\n   * const rootEvent = await replyEvent.fetchRootEvent();\n   * console.log(replyEvent.encode() + \" is a reply in the thread \" + rootEvent?.encode());\n   */\n  fetchRootEvent = fetchRootEvent.bind(this);\n  /**\n   * Fetch the event the current event is replying to.\n   * @returns The fetched reply event or null if no event was found\n   */\n  fetchReplyEvent = fetchReplyEvent.bind(this);\n  /**\n   * NIP-18 reposting event.\n   *\n   * @param publish Whether to publish the reposted event automatically @default true\n   * @param signer The signer to use for signing the reposted event\n   * @returns The reposted event\n   *\n   * @function\n   */\n  repost = repost.bind(this);\n  /**\n   * React to an existing event\n   *\n   * @param content The content of the reaction\n   */\n  async react(content, publish = true) {\n    if (!this.ndk) throw new Error(\"No NDK instance found\");\n    this.ndk.assertSigner();\n    const e = new _NDKEvent(this.ndk, {\n      kind: 7 /* Reaction */,\n      content\n    });\n    e.tag(this);\n    if (publish) await e.publish();\n    return e;\n  }\n  /**\n   * Checks whether the event is valid per underlying NIPs.\n   *\n   * This method is meant to be overridden by subclasses that implement specific NIPs\n   * to allow the enforcement of NIP-specific validation rules.\n   *\n   * Otherwise, it will only check for basic event properties.\n   *\n   */\n  get isValid() {\n    return this.validate();\n  }\n  get inspect() {\n    return JSON.stringify(this.rawEvent(), null, 4);\n  }\n  /**\n   * Dump the event to console for debugging purposes.\n   * Prints a JSON stringified version of rawEvent() with indentation\n   * and also lists all relay URLs for onRelays.\n   */\n  dump() {\n    console.debug(JSON.stringify(this.rawEvent(), null, 4));\n    console.debug(\"Event on relays:\", this.onRelays.map((relay) => relay.url).join(\", \"));\n  }\n  /**\n   * Creates a reply event for the current event.\n   *\n   * This function will use NIP-22 when appropriate (i.e. replies to non-kind:1 events).\n   * This function does not have side-effects; it will just return an event with the appropriate tags\n   * to generate the reply event; the caller is responsible for publishing the event.\n   */\n  reply() {\n    const reply = new _NDKEvent(this.ndk);\n    if (this.kind === 1) {\n      reply.kind = 1;\n      const opHasETag = this.hasTag(\"e\");\n      if (opHasETag) {\n        reply.tags = [\n          ...reply.tags,\n          ...this.getMatchingTags(\"e\"),\n          ...this.getMatchingTags(\"p\"),\n          ...this.getMatchingTags(\"a\"),\n          ...this.referenceTags(\"reply\")\n        ];\n      } else {\n        reply.tag(this, \"root\");\n      }\n    } else {\n      reply.kind = 1111 /* GenericReply */;\n      const carryOverTags = [\"A\", \"E\", \"I\", \"P\"];\n      const rootTags = this.tags.filter((tag) => carryOverTags.includes(tag[0]));\n      if (rootTags.length > 0) {\n        const rootKind = this.tagValue(\"K\");\n        reply.tags.push(...rootTags);\n        if (rootKind) reply.tags.push([\"K\", rootKind]);\n        const [type, id, _, ...extra] = this.tagReference();\n        const tag = [type, id, ...extra];\n        reply.tags.push(tag);\n      } else {\n        const [type, id, _, relayHint] = this.tagReference();\n        const tag = [type, id, relayHint ?? \"\"];\n        if (type === \"e\") tag.push(this.pubkey);\n        reply.tags.push(tag);\n        const uppercaseTag = [...tag];\n        uppercaseTag[0] = uppercaseTag[0].toUpperCase();\n        reply.tags.push(uppercaseTag);\n        reply.tags.push([\"K\", this.kind?.toString()]);\n        reply.tags.push([\"P\", this.pubkey]);\n      }\n      reply.tags.push([\"k\", this.kind?.toString()]);\n      reply.tags.push(...this.getMatchingTags(\"p\"));\n      reply.tags.push([\"p\", this.pubkey]);\n    }\n    return reply;\n  }\n};\nvar untrackedUnpublishedEvents = /* @__PURE__ */ new Set([\n  24133 /* NostrConnect */,\n  13194 /* NostrWaletConnectInfo */,\n  23194 /* NostrWalletConnectReq */,\n  23195 /* NostrWalletConnectRes */\n]);\nfunction shouldTrackUnpublishedEvent(event) {\n  return !untrackedUnpublishedEvents.has(event.kind);\n}\n\n// src/relay/pool/index.ts\nimport { EventEmitter as EventEmitter3 } from \"tseep\";\nvar NDKPool = class extends EventEmitter3 {\n  // TODO: This should probably be an LRU cache\n  _relays = /* @__PURE__ */ new Map();\n  status = \"idle\";\n  autoConnectRelays = /* @__PURE__ */ new Set();\n  poolBlacklistRelayUrls = /* @__PURE__ */ new Set();\n  debug;\n  temporaryRelayTimers = /* @__PURE__ */ new Map();\n  flappingRelays = /* @__PURE__ */ new Set();\n  // A map to store timeouts for each flapping relay.\n  backoffTimes = /* @__PURE__ */ new Map();\n  ndk;\n  get blacklistRelayUrls() {\n    const val = new Set(this.ndk.blacklistRelayUrls);\n    this.poolBlacklistRelayUrls.forEach((url) => val.add(url));\n    return val;\n  }\n  /**\n   * @param relayUrls - The URLs of the relays to connect to.\n   * @param blacklistedRelayUrls - URLs to blacklist for this pool IN ADDITION to those blacklisted at the ndk-level\n   * @param ndk - The NDK instance.\n   * @param opts - Options for the pool.\n   */\n  constructor(relayUrls, blacklistedRelayUrls, ndk, {\n    debug: debug8,\n    name\n  } = {}) {\n    super();\n    this.debug = debug8 ?? ndk.debug.extend(\"pool\");\n    if (name) this._name = name;\n    this.ndk = ndk;\n    this.relayUrls = relayUrls;\n    this.poolBlacklistRelayUrls = new Set(blacklistedRelayUrls);\n    this.ndk.pools.push(this);\n  }\n  get relays() {\n    return this._relays;\n  }\n  set relayUrls(urls) {\n    this._relays.clear();\n    for (const relayUrl of urls) {\n      const relay = new NDKRelay(relayUrl, void 0, this.ndk);\n      relay.connectivity.netDebug = this.ndk.netDebug;\n      this.addRelay(relay);\n    }\n  }\n  _name = \"unnamed\";\n  get name() {\n    return this._name;\n  }\n  set name(name) {\n    this._name = name;\n    this.debug = this.debug.extend(name);\n  }\n  /**\n   * Adds a relay to the pool, and sets a timer to remove it if it is not used within the specified time.\n   * @param relay - The relay to add to the pool.\n   * @param removeIfUnusedAfter - The time in milliseconds to wait before removing the relay from the pool after it is no longer used.\n   */\n  useTemporaryRelay(relay, removeIfUnusedAfter = 3e4, filters) {\n    const relayAlreadyInPool = this.relays.has(relay.url);\n    if (!relayAlreadyInPool) {\n      this.addRelay(relay);\n      this.debug(\"Adding temporary relay %s for filters %o\", relay.url, filters);\n    }\n    const existingTimer = this.temporaryRelayTimers.get(relay.url);\n    if (existingTimer) {\n      clearTimeout(existingTimer);\n    }\n    if (!relayAlreadyInPool || existingTimer) {\n      const timer = setTimeout(() => {\n        if (this.ndk.explicitRelayUrls?.includes(relay.url)) return;\n        this.removeRelay(relay.url);\n      }, removeIfUnusedAfter);\n      this.temporaryRelayTimers.set(relay.url, timer);\n    }\n  }\n  /**\n   * Adds a relay to the pool.\n   *\n   * @param relay - The relay to add to the pool.\n   * @param connect - Whether or not to connect to the relay.\n   */\n  addRelay(relay, connect = true) {\n    const isAlreadyInPool = this.relays.has(relay.url);\n    const isBlacklisted = this.blacklistRelayUrls?.has(relay.url);\n    const isCustomRelayUrl = relay.url.includes(\"/npub1\");\n    let reconnect = true;\n    const relayUrl = relay.url;\n    if (isAlreadyInPool) return;\n    if (isBlacklisted) {\n      this.debug(`Refusing to add relay ${relayUrl}: blacklisted`);\n      return;\n    }\n    if (isCustomRelayUrl) {\n      this.debug(`Refusing to add relay ${relayUrl}: is a filter relay`);\n      return;\n    }\n    if (this.ndk.cacheAdapter?.getRelayStatus) {\n      const info = this.ndk.cacheAdapter.getRelayStatus(relayUrl);\n      if (info?.dontConnectBefore) {\n        if (info.dontConnectBefore > Date.now()) {\n          const delay = info.dontConnectBefore - Date.now();\n          this.debug(`Refusing to add relay ${relayUrl}: delayed connect for ${delay}ms`);\n          setTimeout(() => {\n            this.addRelay(relay, connect);\n          }, delay);\n          return;\n        }\n        reconnect = false;\n      }\n    }\n    const noticeHandler = (notice) => this.emit(\"notice\", relay, notice);\n    const connectHandler = () => this.handleRelayConnect(relayUrl);\n    const readyHandler = () => this.handleRelayReady(relay);\n    const disconnectHandler = () => this.emit(\"relay:disconnect\", relay);\n    const flappingHandler = () => this.handleFlapping(relay);\n    const authHandler = (challenge) => this.emit(\"relay:auth\", relay, challenge);\n    const authedHandler = () => this.emit(\"relay:authed\", relay);\n    relay.off(\"notice\", noticeHandler);\n    relay.off(\"connect\", connectHandler);\n    relay.off(\"ready\", readyHandler);\n    relay.off(\"disconnect\", disconnectHandler);\n    relay.off(\"flapping\", flappingHandler);\n    relay.off(\"auth\", authHandler);\n    relay.off(\"authed\", authedHandler);\n    relay.on(\"notice\", noticeHandler);\n    relay.on(\"connect\", connectHandler);\n    relay.on(\"ready\", readyHandler);\n    relay.on(\"disconnect\", disconnectHandler);\n    relay.on(\"flapping\", flappingHandler);\n    relay.on(\"auth\", authHandler);\n    relay.on(\"authed\", authedHandler);\n    relay.on(\"delayed-connect\", (delay) => {\n      if (this.ndk.cacheAdapter?.updateRelayStatus) {\n        this.ndk.cacheAdapter.updateRelayStatus(relay.url, {\n          dontConnectBefore: Date.now() + delay\n        });\n      }\n    });\n    this._relays.set(relayUrl, relay);\n    if (connect) this.autoConnectRelays.add(relayUrl);\n    if (connect && this.status === \"active\") {\n      this.emit(\"relay:connecting\", relay);\n      relay.connect(void 0, reconnect).catch((e) => {\n        this.debug(`Failed to connect to relay ${relayUrl}`, e);\n      });\n    }\n  }\n  /**\n   * Removes a relay from the pool.\n   * @param relayUrl - The URL of the relay to remove.\n   * @returns {boolean} True if the relay was removed, false if it was not found.\n   */\n  removeRelay(relayUrl) {\n    const relay = this.relays.get(relayUrl);\n    if (relay) {\n      relay.disconnect();\n      this.relays.delete(relayUrl);\n      this.autoConnectRelays.delete(relayUrl);\n      this.emit(\"relay:disconnect\", relay);\n      return true;\n    }\n    const existingTimer = this.temporaryRelayTimers.get(relayUrl);\n    if (existingTimer) {\n      clearTimeout(existingTimer);\n      this.temporaryRelayTimers.delete(relayUrl);\n    }\n    return false;\n  }\n  /**\n   * Checks whether a relay is already connected in the pool.\n   */\n  isRelayConnected(url) {\n    const normalizedUrl = normalizeRelayUrl(url);\n    const relay = this.relays.get(normalizedUrl);\n    if (!relay) return false;\n    return relay.status === 5 /* CONNECTED */;\n  }\n  /**\n   * Fetches a relay from the pool, or creates a new one if it does not exist.\n   *\n   * New relays will be attempted to be connected.\n   */\n  getRelay(url, connect = true, temporary = false, filters) {\n    let relay = this.relays.get(normalizeRelayUrl(url));\n    if (!relay) {\n      relay = new NDKRelay(url, void 0, this.ndk);\n      relay.connectivity.netDebug = this.ndk.netDebug;\n      if (temporary) {\n        this.useTemporaryRelay(relay, 3e4, filters);\n      } else {\n        this.addRelay(relay, connect);\n      }\n    }\n    return relay;\n  }\n  handleRelayConnect(relayUrl) {\n    const relay = this.relays.get(relayUrl);\n    if (!relay) {\n      console.error(\"NDK BUG: relay not found in pool\", { relayUrl });\n      return;\n    }\n    this.emit(\"relay:connect\", relay);\n    if (this.stats().connected === this.relays.size) {\n      this.emit(\"connect\");\n    }\n  }\n  handleRelayReady(relay) {\n    this.emit(\"relay:ready\", relay);\n  }\n  /**\n   * Attempts to establish a connection to each relay in the pool.\n   *\n   * @async\n   * @param {number} [timeoutMs] - Optional timeout in milliseconds for each connection attempt.\n   * @returns {Promise<void>} A promise that resolves when all connection attempts have completed.\n   * @throws {Error} If any of the connection attempts result in an error or timeout.\n   */\n  async connect(timeoutMs) {\n    const promises = [];\n    this.status = \"active\";\n    this.debug(`Connecting to ${this.relays.size} relays${timeoutMs ? `, timeout ${timeoutMs}...` : \"\"}`);\n    const relaysToConnect = new Set(this.autoConnectRelays.keys());\n    for (const relayUrl of relaysToConnect) {\n      const relay = this.relays.get(relayUrl);\n      if (!relay) {\n        continue;\n      }\n      const connectPromise = new Promise((resolve, reject) => {\n        this.emit(\"relay:connecting\", relay);\n        return relay.connect(timeoutMs).then(resolve).catch(reject);\n      });\n      if (timeoutMs) {\n        const timeoutPromise = new Promise((_, reject) => {\n          setTimeout(() => reject(`Timed out after ${timeoutMs}ms`), timeoutMs);\n        });\n        promises.push(\n          Promise.race([connectPromise, timeoutPromise]).catch((e) => {\n            this.debug(`Failed to connect to relay ${relay.url}: ${e ?? \"No reason specified\"}`);\n          })\n        );\n      } else {\n        promises.push(connectPromise);\n      }\n    }\n    const maybeEmitConnect = () => {\n      const allConnected = this.stats().connected === this.relays.size;\n      const someConnected = this.stats().connected > 0;\n      if (!allConnected && someConnected) {\n        this.emit(\"connect\");\n      }\n    };\n    if (timeoutMs) setTimeout(maybeEmitConnect, timeoutMs);\n    await Promise.all(promises);\n    maybeEmitConnect();\n  }\n  checkOnFlappingRelays() {\n    const flappingRelaysCount = this.flappingRelays.size;\n    const totalRelays = this.relays.size;\n    if (flappingRelaysCount / totalRelays >= 0.8) {\n      for (const relayUrl of this.flappingRelays) {\n        this.backoffTimes.set(relayUrl, 0);\n      }\n    }\n  }\n  handleFlapping(relay) {\n    this.debug(`Relay ${relay.url} is flapping`);\n    let currentBackoff = this.backoffTimes.get(relay.url) || 5e3;\n    currentBackoff = currentBackoff * 2;\n    this.backoffTimes.set(relay.url, currentBackoff);\n    this.debug(`Backoff time for ${relay.url} is ${currentBackoff}ms`);\n    setTimeout(() => {\n      this.debug(`Attempting to reconnect to ${relay.url}`);\n      this.emit(\"relay:connecting\", relay);\n      relay.connect();\n      this.checkOnFlappingRelays();\n    }, currentBackoff);\n    relay.disconnect();\n    this.emit(\"flapping\", relay);\n  }\n  size() {\n    return this.relays.size;\n  }\n  /**\n   * Returns the status of each relay in the pool.\n   * @returns {NDKPoolStats} An object containing the number of relays in each status.\n   */\n  stats() {\n    const stats = {\n      total: 0,\n      connected: 0,\n      disconnected: 0,\n      connecting: 0\n    };\n    for (const relay of this.relays.values()) {\n      stats.total++;\n      if (relay.status === 5 /* CONNECTED */) {\n        stats.connected++;\n      } else if (relay.status === 1 /* DISCONNECTED */) {\n        stats.disconnected++;\n      } else if (relay.status === 4 /* CONNECTING */) {\n        stats.connecting++;\n      }\n    }\n    return stats;\n  }\n  connectedRelays() {\n    return Array.from(this.relays.values()).filter((relay) => relay.status >= 5 /* CONNECTED */);\n  }\n  permanentAndConnectedRelays() {\n    return Array.from(this.relays.values()).filter(\n      (relay) => relay.status >= 5 /* CONNECTED */ && !this.temporaryRelayTimers.has(relay.url)\n    );\n  }\n  /**\n   * Get a list of all relay urls in the pool.\n   */\n  urls() {\n    return Array.from(this.relays.keys());\n  }\n};\n\n// src/user/index.ts\nimport { nip19 as nip195 } from \"nostr-tools\";\n\n// src/events/kinds/nutzap/mint-list.ts\nvar NDKCashuMintList = class _NDKCashuMintList extends NDKEvent {\n  static kind = 10019 /* CashuMintList */;\n  static kinds = [10019 /* CashuMintList */];\n  _p2pk;\n  constructor(ndk, event) {\n    super(ndk, event);\n    this.kind ??= 10019 /* CashuMintList */;\n  }\n  static from(event) {\n    return new _NDKCashuMintList(event.ndk, event);\n  }\n  set relays(urls) {\n    this.tags = this.tags.filter((t) => t[0] !== \"relay\");\n    for (const url of urls) {\n      this.tags.push([\"relay\", url]);\n    }\n  }\n  get relays() {\n    const r = [];\n    for (const tag of this.tags) {\n      if (tag[0] === \"relay\") {\n        r.push(tag[1]);\n      }\n    }\n    return r;\n  }\n  set mints(urls) {\n    this.tags = this.tags.filter((t) => t[0] !== \"mint\");\n    for (const url of urls) {\n      this.tags.push([\"mint\", url]);\n    }\n  }\n  get mints() {\n    const r = [];\n    for (const tag of this.tags) {\n      if (tag[0] === \"mint\") {\n        r.push(tag[1]);\n      }\n    }\n    return Array.from(new Set(r));\n  }\n  get p2pk() {\n    if (this._p2pk) {\n      return this._p2pk;\n    }\n    this._p2pk = this.tagValue(\"pubkey\") ?? this.pubkey;\n    return this._p2pk;\n  }\n  set p2pk(pubkey) {\n    this._p2pk = pubkey;\n    this.removeTag(\"pubkey\");\n    if (pubkey) {\n      this.tags.push([\"pubkey\", pubkey]);\n    }\n  }\n  get relaySet() {\n    return NDKRelaySet.fromRelayUrls(this.relays, this.ndk);\n  }\n};\n\n// src/subscription/index.ts\nimport { EventEmitter as EventEmitter4 } from \"tseep\";\n\n// src/events/kinds/article.ts\nvar NDKArticle = class _NDKArticle extends NDKEvent {\n  static kind = 30023 /* Article */;\n  static kinds = [30023 /* Article */];\n  constructor(ndk, rawEvent) {\n    super(ndk, rawEvent);\n    this.kind ??= 30023 /* Article */;\n  }\n  /**\n   * Creates a NDKArticle from an existing NDKEvent.\n   *\n   * @param event NDKEvent to create the NDKArticle from.\n   * @returns NDKArticle\n   */\n  static from(event) {\n    return new _NDKArticle(event.ndk, event);\n  }\n  /**\n   * Getter for the article title.\n   *\n   * @returns {string | undefined} - The article title if available, otherwise undefined.\n   */\n  get title() {\n    return this.tagValue(\"title\");\n  }\n  /**\n   * Setter for the article title.\n   *\n   * @param {string | undefined} title - The title to set for the article.\n   */\n  set title(title) {\n    this.removeTag(\"title\");\n    if (title) this.tags.push([\"title\", title]);\n  }\n  /**\n   * Getter for the article image.\n   *\n   * @returns {string | undefined} - The article image if available, otherwise undefined.\n   */\n  get image() {\n    return this.tagValue(\"image\");\n  }\n  /**\n   * Setter for the article image.\n   *\n   * @param {string | undefined} image - The image to set for the article.\n   */\n  set image(image) {\n    this.removeTag(\"image\");\n    if (image) this.tags.push([\"image\", image]);\n  }\n  get summary() {\n    return this.tagValue(\"summary\");\n  }\n  set summary(summary) {\n    this.removeTag(\"summary\");\n    if (summary) this.tags.push([\"summary\", summary]);\n  }\n  /**\n   * Getter for the article's publication timestamp.\n   *\n   * @returns {number | undefined} - The Unix timestamp of when the article was published or undefined.\n   */\n  get published_at() {\n    const tag = this.tagValue(\"published_at\");\n    if (tag) {\n      let val = Number.parseInt(tag);\n      if (val > 1e12) {\n        val = Math.floor(val / 1e3);\n      }\n      return val;\n    }\n    return void 0;\n  }\n  /**\n   * Setter for the article's publication timestamp.\n   *\n   * @param {number | undefined} timestamp - The Unix timestamp to set for the article's publication date.\n   */\n  set published_at(timestamp) {\n    this.removeTag(\"published_at\");\n    if (timestamp !== void 0) {\n      this.tags.push([\"published_at\", timestamp.toString()]);\n    }\n  }\n  /**\n   * Generates content tags for the article.\n   *\n   * This method first checks and sets the publication date if not available,\n   * and then generates content tags based on the base NDKEvent class.\n   *\n   * @returns {ContentTag} - The generated content tags.\n   */\n  async generateTags() {\n    super.generateTags();\n    if (!this.published_at) {\n      this.published_at = this.created_at;\n    }\n    return super.generateTags();\n  }\n  /**\n   * Getter for the article's URL.\n   *\n   * @returns {string | undefined} - The article's URL if available, otherwise undefined.\n   */\n  get url() {\n    return this.tagValue(\"url\");\n  }\n  /**\n   * Setter for the article's URL.\n   *\n   * @param {string | undefined} url - The URL to set for the article.\n   */\n  set url(url) {\n    if (url) {\n      this.tags.push([\"url\", url]);\n    } else {\n      this.removeTag(\"url\");\n    }\n  }\n};\n\n// src/events/kinds/cashu/token.ts\nfunction proofsTotalBalance(proofs) {\n  return proofs.reduce((acc, proof) => {\n    if (proof.amount < 0) {\n      throw new Error(\"proof amount is negative\");\n    }\n    return acc + proof.amount;\n  }, 0);\n}\nvar NDKCashuToken = class _NDKCashuToken extends NDKEvent {\n  _proofs = [];\n  _mint;\n  static kind = 7375 /* CashuToken */;\n  static kinds = [7375 /* CashuToken */];\n  /**\n   * Tokens that this token superseeds\n   */\n  _deletes = [];\n  original;\n  constructor(ndk, event) {\n    super(ndk, event);\n    this.kind ??= 7375 /* CashuToken */;\n  }\n  static async from(event) {\n    const token = new _NDKCashuToken(event.ndk, event);\n    token.original = event;\n    try {\n      await token.decrypt();\n    } catch {\n      token.content = token.original.content;\n    }\n    try {\n      const content = JSON.parse(token.content);\n      token.proofs = content.proofs;\n      token.mint = content.mint ?? token.tagValue(\"mint\");\n      token.deletedTokens = content.del ?? [];\n      if (!Array.isArray(token.proofs)) return;\n    } catch (_e) {\n      return;\n    }\n    return token;\n  }\n  get proofs() {\n    return this._proofs;\n  }\n  set proofs(proofs) {\n    const cs = /* @__PURE__ */ new Set();\n    this._proofs = proofs.filter((proof) => {\n      if (cs.has(proof.C)) {\n        console.warn(\"Passed in proofs had duplicates, ignoring\", proof.C);\n        return false;\n      }\n      if (proof.amount < 0) {\n        console.warn(\"Invalid proof with negative amount\", proof);\n        return false;\n      }\n      cs.add(proof.C);\n      return true;\n    }).map(this.cleanProof);\n  }\n  /**\n   * Returns a minimal proof object with only essential properties\n   */\n  cleanProof(proof) {\n    return {\n      id: proof.id,\n      amount: proof.amount,\n      C: proof.C,\n      secret: proof.secret\n    };\n  }\n  async toNostrEvent(pubkey) {\n    if (!this.ndk) throw new Error(\"no ndk\");\n    if (!this.ndk.signer) throw new Error(\"no signer\");\n    const payload = {\n      proofs: this.proofs.map(this.cleanProof),\n      mint: this.mint,\n      del: this.deletedTokens ?? []\n    };\n    this.content = JSON.stringify(payload);\n    const user = await this.ndk.signer.user();\n    await this.encrypt(user, void 0, \"nip44\");\n    return super.toNostrEvent(pubkey);\n  }\n  set mint(mint) {\n    this._mint = mint;\n  }\n  get mint() {\n    return this._mint;\n  }\n  /**\n   * Tokens that were deleted by the creation of this token.\n   */\n  get deletedTokens() {\n    return this._deletes;\n  }\n  /**\n   * Marks tokens that were deleted by the creation of this token.\n   */\n  set deletedTokens(tokenIds) {\n    this._deletes = tokenIds;\n  }\n  get amount() {\n    return proofsTotalBalance(this.proofs);\n  }\n  async publish(relaySet, timeoutMs, requiredRelayCount) {\n    if (this.original) {\n      return this.original.publish(relaySet, timeoutMs, requiredRelayCount);\n    }\n    return super.publish(relaySet, timeoutMs, requiredRelayCount);\n  }\n};\n\n// src/events/kinds/highlight.ts\nimport { nip19 as nip193 } from \"nostr-tools\";\nvar NDKHighlight = class _NDKHighlight extends NDKEvent {\n  _article;\n  static kind = 9802 /* Highlight */;\n  static kinds = [9802 /* Highlight */];\n  constructor(ndk, rawEvent) {\n    super(ndk, rawEvent);\n    this.kind ??= 9802 /* Highlight */;\n  }\n  static from(event) {\n    return new _NDKHighlight(event.ndk, event);\n  }\n  get url() {\n    return this.tagValue(\"r\");\n  }\n  /**\n   * Context tag.\n   */\n  set context(context) {\n    if (context === void 0) {\n      this.tags = this.tags.filter(([tag, _value]) => tag !== \"context\");\n    } else {\n      this.tags = this.tags.filter(([tag, _value]) => tag !== \"context\");\n      this.tags.push([\"context\", context]);\n    }\n  }\n  get context() {\n    return this.tags.find(([tag, _value]) => tag === \"context\")?.[1] ?? void 0;\n  }\n  /**\n   * Will return the article URL or NDKEvent if they have already been\n   * set (it won't attempt to load remote events)\n   */\n  get article() {\n    return this._article;\n  }\n  /**\n   * Article the highlight is coming from.\n   *\n   * @param article Article URL or NDKEvent.\n   */\n  set article(article) {\n    this._article = article;\n    if (typeof article === \"string\") {\n      this.tags.push([\"r\", article]);\n    } else {\n      this.tag(article);\n    }\n  }\n  getArticleTag() {\n    return this.getMatchingTags(\"a\")[0] || this.getMatchingTags(\"e\")[0] || this.getMatchingTags(\"r\")[0];\n  }\n  async getArticle() {\n    if (this._article !== void 0) return this._article;\n    let taggedBech32;\n    const articleTag = this.getArticleTag();\n    if (!articleTag) return void 0;\n    switch (articleTag[0]) {\n      case \"a\": {\n        const [kind, pubkey, identifier] = articleTag[1].split(\":\");\n        taggedBech32 = nip193.naddrEncode({\n          kind: Number.parseInt(kind),\n          pubkey,\n          identifier\n        });\n        break;\n      }\n      case \"e\":\n        taggedBech32 = nip193.noteEncode(articleTag[1]);\n        break;\n      case \"r\":\n        this._article = articleTag[1];\n        break;\n    }\n    if (taggedBech32) {\n      let a = await this.ndk?.fetchEvent(taggedBech32);\n      if (a) {\n        if (a.kind === 30023 /* Article */) {\n          a = NDKArticle.from(a);\n        }\n        this._article = a;\n      }\n    }\n    return this._article;\n  }\n};\n\n// src/utils/imeta.ts\nfunction mapImetaTag(tag) {\n  const data = {};\n  if (tag.length === 2) {\n    const parts = tag[1].split(\" \");\n    for (let i = 0; i < parts.length; i += 2) {\n      const key = parts[i];\n      const value = parts[i + 1];\n      if (key === \"fallback\") {\n        if (!data.fallback) data.fallback = [];\n        data.fallback.push(value);\n      } else {\n        data[key] = value;\n      }\n    }\n    return data;\n  }\n  const tags = tag.slice(1);\n  for (const val of tags) {\n    const parts = val.split(\" \");\n    const key = parts[0];\n    const value = parts.slice(1).join(\" \");\n    if (key === \"fallback\") {\n      if (!data.fallback) data.fallback = [];\n      data.fallback.push(value);\n    } else {\n      data[key] = value;\n    }\n  }\n  return data;\n}\nfunction imetaTagToTag(imeta) {\n  const tag = [\"imeta\"];\n  for (const [key, value] of Object.entries(imeta)) {\n    if (Array.isArray(value)) {\n      for (const v of value) {\n        tag.push(`${key} ${v}`);\n      }\n    } else if (value) {\n      tag.push(`${key} ${value}`);\n    }\n  }\n  return tag;\n}\n\n// src/events/kinds/image.ts\nvar NDKImage = class _NDKImage extends NDKEvent {\n  static kind = 20 /* Image */;\n  static kinds = [20 /* Image */];\n  _imetas;\n  constructor(ndk, rawEvent) {\n    super(ndk, rawEvent);\n    this.kind ??= 20 /* Image */;\n  }\n  /**\n   * Creates a NDKImage from an existing NDKEvent.\n   *\n   * @param event NDKEvent to create the NDKImage from.\n   * @returns NDKImage\n   */\n  static from(event) {\n    return new _NDKImage(event.ndk, event.rawEvent());\n  }\n  get isValid() {\n    return this.imetas.length > 0;\n  }\n  get imetas() {\n    if (this._imetas) return this._imetas;\n    this._imetas = this.tags.filter((tag) => tag[0] === \"imeta\").map(mapImetaTag).filter((imeta) => !!imeta.url);\n    return this._imetas;\n  }\n  set imetas(tags) {\n    this._imetas = tags;\n    this.tags = this.tags.filter((tag) => tag[0] !== \"imeta\");\n    this.tags.push(...tags.map(imetaTagToTag));\n  }\n};\n\n// src/events/kinds/lists/index.ts\nvar NDKList = class _NDKList extends NDKEvent {\n  _encryptedTags;\n  static kinds = [\n    10063 /* BlossomList */,\n    30001 /* CategorizedBookmarkList */,\n    10004 /* CommunityList */,\n    10050 /* DirectMessageReceiveRelayList */,\n    10030 /* EmojiList */,\n    10015 /* InterestList */,\n    10001 /* PinList */,\n    10002 /* RelayList */,\n    10007 /* SearchRelayList */,\n    10006 /* BlockRelayList */,\n    10003 /* BookmarkList */\n  ];\n  /**\n   * Stores the number of bytes the content was before decryption\n   * to expire the cache when the content changes.\n   */\n  encryptedTagsLength;\n  constructor(ndk, rawEvent) {\n    super(ndk, rawEvent);\n    this.kind ??= 30001 /* CategorizedBookmarkList */;\n  }\n  /**\n   * Wrap a NDKEvent into a NDKList\n   */\n  static from(ndkEvent) {\n    return new _NDKList(ndkEvent.ndk, ndkEvent);\n  }\n  /**\n   * Returns the title of the list. Falls back on fetching the name tag value.\n   */\n  get title() {\n    const titleTag = this.tagValue(\"title\") || this.tagValue(\"name\");\n    if (titleTag) return titleTag;\n    if (this.kind === 3 /* Contacts */) {\n      return \"Contacts\";\n    }\n    if (this.kind === 1e4 /* MuteList */) {\n      return \"Mute\";\n    }\n    if (this.kind === 10001 /* PinList */) {\n      return \"Pinned Notes\";\n    }\n    if (this.kind === 10002 /* RelayList */) {\n      return \"Relay Metadata\";\n    }\n    if (this.kind === 10003 /* BookmarkList */) {\n      return \"Bookmarks\";\n    }\n    if (this.kind === 10004 /* CommunityList */) {\n      return \"Communities\";\n    }\n    if (this.kind === 10005 /* PublicChatList */) {\n      return \"Public Chats\";\n    }\n    if (this.kind === 10006 /* BlockRelayList */) {\n      return \"Blocked Relays\";\n    }\n    if (this.kind === 10007 /* SearchRelayList */) {\n      return \"Search Relays\";\n    }\n    if (this.kind === 10050 /* DirectMessageReceiveRelayList */) {\n      return \"Direct Message Receive Relays\";\n    }\n    if (this.kind === 10015 /* InterestList */) {\n      return \"Interests\";\n    }\n    if (this.kind === 10030 /* EmojiList */) {\n      return \"Emojis\";\n    }\n    return this.tagValue(\"d\");\n  }\n  /**\n   * Sets the title of the list.\n   */\n  set title(title) {\n    this.removeTag([\"title\", \"name\"]);\n    if (title) this.tags.push([\"title\", title]);\n  }\n  /**\n   * Returns the name of the list.\n   * @deprecated Please use \"title\" instead.\n   */\n  get name() {\n    return this.title;\n  }\n  /**\n   * Sets the name of the list.\n   * @deprecated Please use \"title\" instead. This method will use the `title` tag instead.\n   */\n  set name(name) {\n    this.title = name;\n  }\n  /**\n   * Returns the description of the list.\n   */\n  get description() {\n    return this.tagValue(\"description\");\n  }\n  /**\n   * Sets the description of the list.\n   */\n  set description(name) {\n    this.removeTag(\"description\");\n    if (name) this.tags.push([\"description\", name]);\n  }\n  /**\n   * Returns the image of the list.\n   */\n  get image() {\n    return this.tagValue(\"image\");\n  }\n  /**\n   * Sets the image of the list.\n   */\n  set image(name) {\n    this.removeTag(\"image\");\n    if (name) this.tags.push([\"image\", name]);\n  }\n  isEncryptedTagsCacheValid() {\n    return !!(this._encryptedTags && this.encryptedTagsLength === this.content.length);\n  }\n  /**\n   * Returns the decrypted content of the list.\n   */\n  async encryptedTags(useCache = true) {\n    if (useCache && this.isEncryptedTagsCacheValid()) return this._encryptedTags;\n    if (!this.ndk) throw new Error(\"NDK instance not set\");\n    if (!this.ndk.signer) throw new Error(\"NDK signer not set\");\n    const user = await this.ndk.signer.user();\n    try {\n      if (this.content.length > 0) {\n        try {\n          const decryptedContent = await this.ndk.signer.decrypt(user, this.content);\n          const a = JSON.parse(decryptedContent);\n          if (a?.[0]) {\n            this.encryptedTagsLength = this.content.length;\n            return this._encryptedTags = a;\n          }\n          this.encryptedTagsLength = this.content.length;\n          return this._encryptedTags = [];\n        } catch (_e) {\n        }\n      }\n    } catch (_e) {\n    }\n    return [];\n  }\n  /**\n   * This method can be overriden to validate that a tag is valid for this list.\n   *\n   * (i.e. the NDKPersonList can validate that items are NDKUser instances)\n   */\n  validateTag(_tagValue) {\n    return true;\n  }\n  getItems(type) {\n    return this.tags.filter((tag) => tag[0] === type);\n  }\n  /**\n   * Returns the unecrypted items in this list.\n   */\n  get items() {\n    return this.tags.filter((t) => {\n      return ![\n        \"d\",\n        \"L\",\n        \"l\",\n        \"title\",\n        \"name\",\n        \"description\",\n        \"published_at\",\n        \"summary\",\n        \"image\",\n        \"thumb\",\n        \"alt\",\n        \"expiration\",\n        \"subject\",\n        \"client\"\n      ].includes(t[0]);\n    });\n  }\n  /**\n   * Adds a new item to the list.\n   * @param relay Relay to add\n   * @param mark Optional mark to add to the item\n   * @param encrypted Whether to encrypt the item\n   * @param position Where to add the item in the list (top or bottom)\n   */\n  async addItem(item, mark = void 0, encrypted = false, position = \"bottom\") {\n    if (!this.ndk) throw new Error(\"NDK instance not set\");\n    if (!this.ndk.signer) throw new Error(\"NDK signer not set\");\n    let tags;\n    if (item instanceof NDKEvent) {\n      tags = [item.tagReference(mark)];\n    } else if (item instanceof NDKUser) {\n      tags = item.referenceTags();\n    } else if (item instanceof NDKRelay) {\n      tags = item.referenceTags();\n    } else if (Array.isArray(item)) {\n      tags = [item];\n    } else {\n      throw new Error(\"Invalid object type\");\n    }\n    if (mark) tags[0].push(mark);\n    if (encrypted) {\n      const user = await this.ndk.signer.user();\n      const currentList = await this.encryptedTags();\n      if (position === \"top\") currentList.unshift(...tags);\n      else currentList.push(...tags);\n      this._encryptedTags = currentList;\n      this.encryptedTagsLength = this.content.length;\n      this.content = JSON.stringify(currentList);\n      await this.encrypt(user);\n    } else {\n      if (position === \"top\") this.tags.unshift(...tags);\n      else this.tags.push(...tags);\n    }\n    this.created_at = Math.floor(Date.now() / 1e3);\n    this.emit(\"change\");\n  }\n  /**\n   * Removes an item from the list from both the encrypted and unencrypted lists.\n   * @param value value of item to remove from the list\n   * @param publish whether to publish the change\n   * @returns\n   */\n  async removeItemByValue(value, publish = true) {\n    if (!this.ndk) throw new Error(\"NDK instance not set\");\n    if (!this.ndk.signer) throw new Error(\"NDK signer not set\");\n    const index = this.tags.findIndex((tag) => tag[1] === value);\n    if (index >= 0) {\n      this.tags.splice(index, 1);\n    }\n    const user = await this.ndk.signer.user();\n    const encryptedTags = await this.encryptedTags();\n    const encryptedIndex = encryptedTags.findIndex((tag) => tag[1] === value);\n    if (encryptedIndex >= 0) {\n      encryptedTags.splice(encryptedIndex, 1);\n      this._encryptedTags = encryptedTags;\n      this.encryptedTagsLength = this.content.length;\n      this.content = JSON.stringify(encryptedTags);\n      await this.encrypt(user);\n    }\n    if (publish) {\n      return this.publishReplaceable();\n    }\n    this.created_at = Math.floor(Date.now() / 1e3);\n    this.emit(\"change\");\n  }\n  /**\n   * Removes an item from the list.\n   *\n   * @param index The index of the item to remove.\n   * @param encrypted Whether to remove from the encrypted list or not.\n   */\n  async removeItem(index, encrypted) {\n    if (!this.ndk) throw new Error(\"NDK instance not set\");\n    if (!this.ndk.signer) throw new Error(\"NDK signer not set\");\n    if (encrypted) {\n      const user = await this.ndk.signer.user();\n      const currentList = await this.encryptedTags();\n      currentList.splice(index, 1);\n      this._encryptedTags = currentList;\n      this.encryptedTagsLength = this.content.length;\n      this.content = JSON.stringify(currentList);\n      await this.encrypt(user);\n    } else {\n      this.tags.splice(index, 1);\n    }\n    this.created_at = Math.floor(Date.now() / 1e3);\n    this.emit(\"change\");\n    return this;\n  }\n  has(item) {\n    return this.items.some((tag) => tag[1] === item);\n  }\n  /**\n   * Creates a filter that will result in fetching\n   * the items of this list\n   * @example\n   * const list = new NDKList(...);\n   * const filters = list.filterForItems();\n   * const events = await ndk.fetchEvents(filters);\n   */\n  filterForItems() {\n    const ids = /* @__PURE__ */ new Set();\n    const nip33Queries = /* @__PURE__ */ new Map();\n    const filters = [];\n    for (const tag of this.items) {\n      if (tag[0] === \"e\" && tag[1]) {\n        ids.add(tag[1]);\n      } else if (tag[0] === \"a\" && tag[1]) {\n        const [kind, pubkey, dTag] = tag[1].split(\":\");\n        if (!kind || !pubkey) continue;\n        const key = `${kind}:${pubkey}`;\n        const item = nip33Queries.get(key) || [];\n        item.push(dTag || \"\");\n        nip33Queries.set(key, item);\n      }\n    }\n    if (ids.size > 0) {\n      filters.push({ ids: Array.from(ids) });\n    }\n    if (nip33Queries.size > 0) {\n      for (const [key, values] of nip33Queries.entries()) {\n        const [kind, pubkey] = key.split(\":\");\n        filters.push({\n          kinds: [Number.parseInt(kind)],\n          authors: [pubkey],\n          \"#d\": values\n        });\n      }\n    }\n    return filters;\n  }\n};\nvar lists_default = NDKList;\n\n// src/events/kinds/nutzap/index.ts\nimport debug2 from \"debug\";\nvar NDKNutzap = class _NDKNutzap extends NDKEvent {\n  debug;\n  _proofs = [];\n  static kind = 9321 /* Nutzap */;\n  static kinds = [_NDKNutzap.kind];\n  constructor(ndk, event) {\n    super(ndk, event);\n    this.kind ??= 9321 /* Nutzap */;\n    this.debug = ndk?.debug.extend(\"nutzap\") ?? debug2(\"ndk:nutzap\");\n    if (!this.alt) this.alt = \"This is a nutzap\";\n    try {\n      const proofTags = this.getMatchingTags(\"proof\");\n      if (proofTags.length) {\n        this._proofs = proofTags.map((tag) => JSON.parse(tag[1]));\n      } else {\n        this._proofs = JSON.parse(this.content);\n      }\n    } catch {\n      return;\n    }\n  }\n  static from(event) {\n    const e = new _NDKNutzap(event.ndk, event);\n    if (!e._proofs || !e._proofs.length) return;\n    return e;\n  }\n  set comment(comment) {\n    this.content = comment ?? \"\";\n  }\n  get comment() {\n    const c = this.tagValue(\"comment\");\n    if (c) return c;\n    return this.content;\n  }\n  set proofs(proofs) {\n    this._proofs = proofs;\n    this.tags = this.tags.filter((tag) => tag[0] !== \"proof\");\n    for (const proof of proofs) {\n      this.tags.push([\"proof\", JSON.stringify(proof)]);\n    }\n  }\n  get proofs() {\n    return this._proofs;\n  }\n  get rawP2pk() {\n    const firstProof = this.proofs[0];\n    try {\n      const secret = JSON.parse(firstProof.secret);\n      let payload;\n      if (typeof secret === \"string\") {\n        payload = JSON.parse(secret);\n        this.debug(\"stringified payload\", firstProof.secret);\n      } else if (typeof secret === \"object\") {\n        payload = secret;\n      }\n      if (Array.isArray(payload) && payload[0] === \"P2PK\" && payload.length > 1 && typeof payload[1] === \"object\" && payload[1] !== null) {\n        return payload[1].data;\n      }\n      if (typeof payload === \"object\" && payload !== null && typeof payload[1]?.data === \"string\") {\n        return payload[1].data;\n      }\n    } catch (e) {\n      this.debug(\"error parsing p2pk pubkey\", e, this.proofs[0]);\n    }\n    return void 0;\n  }\n  /**\n   * Gets the p2pk pubkey that is embedded in the first proof.\n   *\n   * Note that this returns a nostr pubkey, not a cashu pubkey (no \"02\" prefix)\n   */\n  get p2pk() {\n    const rawP2pk = this.rawP2pk;\n    if (!rawP2pk) return;\n    return rawP2pk.startsWith(\"02\") ? rawP2pk.slice(2) : rawP2pk;\n  }\n  /**\n   * Get the mint where this nutzap proofs exist\n   */\n  get mint() {\n    return this.tagValue(\"u\");\n  }\n  set mint(value) {\n    this.replaceTag([\"u\", value]);\n  }\n  get unit() {\n    let _unit = this.tagValue(\"unit\") ?? \"sat\";\n    if (_unit?.startsWith(\"msat\")) _unit = \"sat\";\n    return _unit;\n  }\n  set unit(value) {\n    this.removeTag(\"unit\");\n    if (value?.startsWith(\"msat\")) throw new Error(\"msat is not allowed, use sat denomination instead\");\n    if (value) this.tag([\"unit\", value]);\n  }\n  get amount() {\n    const amount = this.proofs.reduce((total, proof) => total + proof.amount, 0);\n    return amount;\n  }\n  sender = this.author;\n  /**\n   * Set the target of the nutzap\n   * @param target The target of the nutzap (a user or an event)\n   */\n  set target(target) {\n    this.tags = this.tags.filter((t) => t[0] !== \"p\");\n    if (target instanceof NDKEvent) {\n      this.tags.push(target.tagReference());\n    }\n  }\n  set recipientPubkey(pubkey) {\n    this.removeTag(\"p\");\n    this.tag([\"p\", pubkey]);\n  }\n  get recipientPubkey() {\n    return this.tagValue(\"p\");\n  }\n  get recipient() {\n    const pubkey = this.recipientPubkey;\n    if (this.ndk) return this.ndk.getUser({ pubkey });\n    return new NDKUser({ pubkey });\n  }\n  async toNostrEvent() {\n    if (this.unit === \"msat\") {\n      this.unit = \"sat\";\n    }\n    this.removeTag(\"amount\");\n    this.tags.push([\"amount\", this.amount.toString()]);\n    const event = await super.toNostrEvent();\n    event.content = this.comment;\n    return event;\n  }\n  /**\n   * Validates that the nutzap conforms to NIP-61\n   */\n  get isValid() {\n    let eTagCount = 0;\n    let pTagCount = 0;\n    let mintTagCount = 0;\n    for (const tag of this.tags) {\n      if (tag[0] === \"e\") eTagCount++;\n      if (tag[0] === \"p\") pTagCount++;\n      if (tag[0] === \"u\") mintTagCount++;\n    }\n    return (\n      // exactly one recipient and mint\n      pTagCount === 1 && mintTagCount === 1 && // must have at most one e tag\n      eTagCount <= 1 && // must have at least one proof\n      this.proofs.length > 0\n    );\n  }\n};\nfunction proofP2pk(proof) {\n  try {\n    const secret = JSON.parse(proof.secret);\n    let payload = {};\n    if (typeof secret === \"string\") {\n      payload = JSON.parse(secret);\n    } else if (typeof secret === \"object\") {\n      payload = secret;\n    }\n    const isP2PKLocked = payload[0] === \"P2PK\" && payload[1]?.data;\n    if (isP2PKLocked) {\n      return payload[1].data;\n    }\n  } catch (e) {\n    console.error(\"error parsing p2pk pubkey\", e, proof);\n  }\n}\nfunction proofP2pkNostr(proof) {\n  const p2pk = proofP2pk(proof);\n  if (!p2pk) return;\n  if (p2pk.startsWith(\"02\") && p2pk.length === 66) return p2pk.slice(2);\n  return p2pk;\n}\nfunction cashuPubkeyToNostrPubkey(cashuPubkey) {\n  if (cashuPubkey.startsWith(\"02\") && cashuPubkey.length === 66) return cashuPubkey.slice(2);\n  return void 0;\n}\n\n// src/events/kinds/simple-group/member-list.ts\nvar NDKSimpleGroupMemberList = class _NDKSimpleGroupMemberList extends NDKEvent {\n  relaySet;\n  memberSet = /* @__PURE__ */ new Set();\n  static kind = 39002 /* GroupMembers */;\n  static kinds = [39002 /* GroupMembers */];\n  constructor(ndk, rawEvent) {\n    super(ndk, rawEvent);\n    this.kind ??= 39002 /* GroupMembers */;\n    this.memberSet = new Set(this.members);\n  }\n  static from(event) {\n    return new _NDKSimpleGroupMemberList(event.ndk, event);\n  }\n  get members() {\n    return this.getMatchingTags(\"p\").map((tag) => tag[1]);\n  }\n  hasMember(member) {\n    return this.memberSet.has(member);\n  }\n  async publish(relaySet, timeoutMs, requiredRelayCount) {\n    relaySet ??= this.relaySet;\n    return super.publishReplaceable(relaySet, timeoutMs, requiredRelayCount);\n  }\n};\n\n// src/events/kinds/simple-group/metadata.ts\nvar NDKSimpleGroupMetadata = class _NDKSimpleGroupMetadata extends NDKEvent {\n  static kind = 39e3 /* GroupMetadata */;\n  static kinds = [39e3 /* GroupMetadata */];\n  constructor(ndk, rawEvent) {\n    super(ndk, rawEvent);\n    this.kind ??= 39e3 /* GroupMetadata */;\n  }\n  static from(event) {\n    return new _NDKSimpleGroupMetadata(event.ndk, event);\n  }\n  get name() {\n    return this.tagValue(\"name\");\n  }\n  get picture() {\n    return this.tagValue(\"picture\");\n  }\n  get about() {\n    return this.tagValue(\"about\");\n  }\n  get scope() {\n    if (this.getMatchingTags(\"public\").length > 0) return \"public\";\n    if (this.getMatchingTags(\"public\").length > 0) return \"private\";\n    return void 0;\n  }\n  set scope(scope) {\n    this.removeTag(\"public\");\n    this.removeTag(\"private\");\n    if (scope === \"public\") {\n      this.tags.push([\"public\", \"\"]);\n    } else if (scope === \"private\") {\n      this.tags.push([\"private\", \"\"]);\n    }\n  }\n  get access() {\n    if (this.getMatchingTags(\"open\").length > 0) return \"open\";\n    if (this.getMatchingTags(\"closed\").length > 0) return \"closed\";\n    return void 0;\n  }\n  set access(access) {\n    this.removeTag(\"open\");\n    this.removeTag(\"closed\");\n    if (access === \"open\") {\n      this.tags.push([\"open\", \"\"]);\n    } else if (access === \"closed\") {\n      this.tags.push([\"closed\", \"\"]);\n    }\n  }\n};\n\n// src/events/kinds/story.ts\nvar NDKStoryStickerType = /* @__PURE__ */ ((NDKStoryStickerType2) => {\n  NDKStoryStickerType2[\"Pubkey\"] = \"pubkey\";\n  NDKStoryStickerType2[\"Event\"] = \"event\";\n  NDKStoryStickerType2[\"Prompt\"] = \"prompt\";\n  NDKStoryStickerType2[\"Text\"] = \"text\";\n  NDKStoryStickerType2[\"Countdown\"] = \"countdown\";\n  return NDKStoryStickerType2;\n})(NDKStoryStickerType || {});\nfunction strToPosition(positionStr) {\n  const [x, y] = positionStr.split(\",\").map(Number);\n  return { x, y };\n}\nfunction strToDimension(dimensionStr) {\n  const [width, height] = dimensionStr.split(\"x\").map(Number);\n  return { width, height };\n}\nvar NDKStorySticker = class _NDKStorySticker {\n  static Text = \"text\" /* Text */;\n  static Pubkey = \"pubkey\" /* Pubkey */;\n  static Event = \"event\" /* Event */;\n  static Prompt = \"prompt\" /* Prompt */;\n  static Countdown = \"countdown\" /* Countdown */;\n  type;\n  value;\n  position;\n  dimension;\n  properties;\n  constructor(arg) {\n    if (Array.isArray(arg)) {\n      const tag = arg;\n      if (tag[0] !== \"sticker\" || tag.length < 5) {\n        throw new Error(\"Invalid sticker tag\");\n      }\n      this.type = tag[1];\n      this.value = tag[2];\n      this.position = strToPosition(tag[3]);\n      this.dimension = strToDimension(tag[4]);\n      const props = {};\n      for (let i = 5; i < tag.length; i++) {\n        const [key, ...rest] = tag[i].split(\" \");\n        props[key] = rest.join(\" \");\n      }\n      if (Object.keys(props).length > 0) {\n        this.properties = props;\n      }\n    } else {\n      this.type = arg;\n      this.value = void 0;\n      this.position = { x: 0, y: 0 };\n      this.dimension = { width: 0, height: 0 };\n    }\n  }\n  static fromTag(tag) {\n    try {\n      return new _NDKStorySticker(tag);\n    } catch {\n      return null;\n    }\n  }\n  get style() {\n    return this.properties?.style;\n  }\n  set style(style) {\n    if (style) this.properties = { ...this.properties, style };\n    else delete this.properties?.style;\n  }\n  get rotation() {\n    return this.properties?.rot ? Number.parseFloat(this.properties.rot) : void 0;\n  }\n  set rotation(rotation) {\n    if (rotation !== void 0) {\n      this.properties = { ...this.properties, rot: rotation.toString() };\n    } else {\n      delete this.properties?.rot;\n    }\n  }\n  /**\n   * Checks if the sticker is valid.\n   *\n   * @returns {boolean} - True if the sticker is valid, false otherwise.\n   */\n  get isValid() {\n    return this.hasValidDimensions() && this.hasValidPosition();\n  }\n  hasValidDimensions = () => {\n    return typeof this.dimension.width === \"number\" && typeof this.dimension.height === \"number\" && !Number.isNaN(this.dimension.width) && !Number.isNaN(this.dimension.height);\n  };\n  hasValidPosition = () => {\n    return typeof this.position.x === \"number\" && typeof this.position.y === \"number\" && !Number.isNaN(this.position.x) && !Number.isNaN(this.position.y);\n  };\n  toTag() {\n    if (!this.isValid) {\n      const errors = [\n        !this.hasValidDimensions() ? \"dimensions is invalid\" : void 0,\n        !this.hasValidPosition() ? \"position is invalid\" : void 0\n      ].filter(Boolean);\n      throw new Error(`Invalid sticker: ${errors.join(\", \")}`);\n    }\n    let value;\n    switch (this.type) {\n      case \"event\" /* Event */:\n        value = this.value.tagId();\n        break;\n      case \"pubkey\" /* Pubkey */:\n        value = this.value.pubkey;\n        break;\n      default:\n        value = this.value;\n    }\n    const tag = [\"sticker\", this.type, value, coordinates(this.position), dimension(this.dimension)];\n    if (this.properties) {\n      for (const [key, propValue] of Object.entries(this.properties)) {\n        tag.push(`${key} ${propValue}`);\n      }\n    }\n    return tag;\n  }\n};\nvar NDKStory = class _NDKStory extends NDKEvent {\n  static kind = 23 /* Story */;\n  static kinds = [23 /* Story */];\n  _imeta;\n  _dimensions;\n  constructor(ndk, rawEvent) {\n    super(ndk, rawEvent);\n    this.kind ??= 23 /* Story */;\n    if (rawEvent) {\n      for (const tag of rawEvent.tags) {\n        switch (tag[0]) {\n          case \"imeta\":\n            this._imeta = mapImetaTag(tag);\n            break;\n          case \"dim\":\n            this.dimensions = strToDimension(tag[1]);\n            break;\n        }\n      }\n    }\n  }\n  /**\n   * Creates a NDKStory from an existing NDKEvent.\n   *\n   * @param event NDKEvent to create the NDKStory from.\n   * @returns NDKStory\n   */\n  static from(event) {\n    return new _NDKStory(event.ndk, event);\n  }\n  /**\n   * Checks if the story is valid (has exactly one imeta tag).\n   */\n  get isValid() {\n    return !!this.imeta;\n  }\n  /**\n   * Gets the first imeta tag (there should only be one).\n   */\n  get imeta() {\n    return this._imeta;\n  }\n  /**\n   * Sets a single imeta tag, replacing any existing ones.\n   */\n  set imeta(tag) {\n    this._imeta = tag;\n    this.tags = this.tags.filter((t) => t[0] !== \"imeta\");\n    if (tag) {\n      this.tags.push(imetaTagToTag(tag));\n    }\n  }\n  /**\n   * Getter for the story dimensions.\n   *\n   * @returns {NDKStoryDimension | undefined} - The story dimensions if available, otherwise undefined.\n   */\n  get dimensions() {\n    const dimTag = this.tagValue(\"dim\");\n    if (!dimTag) return void 0;\n    return strToDimension(dimTag);\n  }\n  /**\n   * Setter for the story dimensions.\n   *\n   * @param {NDKStoryDimension | undefined} dimensions - The dimensions to set for the story.\n   */\n  set dimensions(dimensions) {\n    this.removeTag(\"dim\");\n    if (dimensions) {\n      this.tags.push([\"dim\", `${dimensions.width}x${dimensions.height}`]);\n    }\n  }\n  /**\n   * Getter for the story duration.\n   *\n   * @returns {number | undefined} - The story duration in seconds if available, otherwise undefined.\n   */\n  get duration() {\n    const durTag = this.tagValue(\"dur\");\n    if (!durTag) return void 0;\n    return Number.parseInt(durTag);\n  }\n  /**\n   * Setter for the story duration.\n   *\n   * @param {number | undefined} duration - The duration in seconds to set for the story.\n   */\n  set duration(duration) {\n    this.removeTag(\"dur\");\n    if (duration !== void 0) {\n      this.tags.push([\"dur\", duration.toString()]);\n    }\n  }\n  /**\n   * Gets all stickers from the story.\n   *\n   * @returns {NDKStorySticker[]} - Array of stickers in the story.\n   */\n  get stickers() {\n    const stickers = [];\n    for (const tag of this.tags) {\n      if (tag[0] !== \"sticker\" || tag.length < 5) continue;\n      const sticker = NDKStorySticker.fromTag(tag);\n      if (sticker) stickers.push(sticker);\n    }\n    return stickers;\n  }\n  /**\n   * Adds a sticker to the story.\n   *\n   * @param {NDKStorySticker|StorySticker} sticker - The sticker to add.\n   */\n  addSticker(sticker) {\n    let stickerToAdd;\n    if (sticker instanceof NDKStorySticker) {\n      stickerToAdd = sticker;\n    } else {\n      const tag = [\n        \"sticker\",\n        sticker.type,\n        typeof sticker.value === \"string\" ? sticker.value : \"\",\n        coordinates(sticker.position),\n        dimension(sticker.dimension)\n      ];\n      if (sticker.properties) {\n        for (const [key, value] of Object.entries(sticker.properties)) {\n          tag.push(`${key} ${value}`);\n        }\n      }\n      stickerToAdd = new NDKStorySticker(tag);\n      stickerToAdd.value = sticker.value;\n    }\n    if (stickerToAdd.type === \"pubkey\" /* Pubkey */) {\n      this.tag(stickerToAdd.value);\n    } else if (stickerToAdd.type === \"event\" /* Event */) {\n      this.tag(stickerToAdd.value);\n    }\n    this.tags.push(stickerToAdd.toTag());\n  }\n  /**\n   * Removes a sticker from the story.\n   *\n   * @param {number} index - The index of the sticker to remove.\n   */\n  removeSticker(index) {\n    const stickers = this.stickers;\n    if (index < 0 || index >= stickers.length) return;\n    let stickerCount = 0;\n    for (let i = 0; i < this.tags.length; i++) {\n      if (this.tags[i][0] === \"sticker\") {\n        if (stickerCount === index) {\n          this.tags.splice(i, 1);\n          break;\n        }\n        stickerCount++;\n      }\n    }\n  }\n};\nvar coordinates = (position) => `${position.x},${position.y}`;\nvar dimension = (dimension2) => `${dimension2.width}x${dimension2.height}`;\n\n// src/events/kinds/subscriptions/amount.ts\nvar possibleIntervalFrequencies = [\n  \"daily\",\n  \"weekly\",\n  \"monthly\",\n  \"quarterly\",\n  \"yearly\"\n];\nfunction calculateTermDurationInSeconds(term) {\n  switch (term) {\n    case \"daily\":\n      return 24 * 60 * 60;\n    case \"weekly\":\n      return 7 * 24 * 60 * 60;\n    case \"monthly\":\n      return 30 * 24 * 60 * 60;\n    case \"quarterly\":\n      return 3 * 30 * 24 * 60 * 60;\n    case \"yearly\":\n      return 365 * 24 * 60 * 60;\n  }\n}\nfunction newAmount(amount, currency, term) {\n  return [\"amount\", amount.toString(), currency, term];\n}\nfunction parseTagToSubscriptionAmount(tag) {\n  const amount = Number.parseInt(tag[1]);\n  if (Number.isNaN(amount) || amount === void 0 || amount === null || amount <= 0) return void 0;\n  const currency = tag[2];\n  if (currency === void 0 || currency === \"\") return void 0;\n  const term = tag[3];\n  if (term === void 0) return void 0;\n  if (!possibleIntervalFrequencies.includes(term)) return void 0;\n  return {\n    amount,\n    currency,\n    term\n  };\n}\n\n// src/events/kinds/subscriptions/tier.ts\nvar NDKSubscriptionTier = class _NDKSubscriptionTier extends NDKArticle {\n  static kind = 37001 /* SubscriptionTier */;\n  static kinds = [37001 /* SubscriptionTier */];\n  constructor(ndk, rawEvent) {\n    const k = rawEvent?.kind ?? 37001 /* SubscriptionTier */;\n    super(ndk, rawEvent);\n    this.kind = k;\n  }\n  /**\n   * Creates a new NDKSubscriptionTier from an event\n   * @param event\n   * @returns NDKSubscriptionTier\n   */\n  static from(event) {\n    return new _NDKSubscriptionTier(event.ndk, event);\n  }\n  /**\n   * Returns perks for this tier\n   */\n  get perks() {\n    return this.getMatchingTags(\"perk\").map((tag) => tag[1]).filter((perk) => perk !== void 0);\n  }\n  /**\n   * Adds a perk to this tier\n   */\n  addPerk(perk) {\n    this.tags.push([\"perk\", perk]);\n  }\n  /**\n   * Returns the amount for this tier\n   */\n  get amounts() {\n    return this.getMatchingTags(\"amount\").map((tag) => parseTagToSubscriptionAmount(tag)).filter((a) => a !== void 0);\n  }\n  /**\n   * Adds an amount to this tier\n   * @param amount Amount in the smallest unit of the currency (e.g. cents, msats)\n   * @param currency Currency code. Use msat for millisatoshis\n   * @param term One of daily, weekly, monthly, quarterly, yearly\n   */\n  addAmount(amount, currency, term) {\n    this.tags.push(newAmount(amount, currency, term));\n  }\n  /**\n   * Sets a relay where content related to this tier can be found\n   * @param relayUrl URL of the relay\n   */\n  set relayUrl(relayUrl) {\n    this.tags.push([\"r\", relayUrl]);\n  }\n  /**\n   * Returns the relay URLs for this tier\n   */\n  get relayUrls() {\n    return this.getMatchingTags(\"r\").map((tag) => tag[1]).filter((relay) => relay !== void 0);\n  }\n  /**\n   * Gets the verifier pubkey for this tier. This is the pubkey that will generate\n   * subscription payment receipts\n   */\n  get verifierPubkey() {\n    return this.tagValue(\"p\");\n  }\n  /**\n   * Sets the verifier pubkey for this tier.\n   */\n  set verifierPubkey(pubkey) {\n    this.removeTag(\"p\");\n    if (pubkey) this.tags.push([\"p\", pubkey]);\n  }\n  /**\n   * Checks if this tier is valid\n   */\n  get isValid() {\n    return this.title !== void 0 && // Must have a title\n    this.amounts.length > 0;\n  }\n};\n\n// src/events/kinds/video.ts\nvar NDKVideo = class _NDKVideo extends NDKEvent {\n  static kind = 21 /* Video */;\n  static kinds = [34235 /* HorizontalVideo */, 34236 /* VerticalVideo */, 22 /* ShortVideo */, 21 /* Video */];\n  _imetas;\n  /**\n   * Creates a NDKArticle from an existing NDKEvent.\n   *\n   * @param event NDKEvent to create the NDKArticle from.\n   * @returns NDKArticle\n   */\n  static from(event) {\n    return new _NDKVideo(event.ndk, event.rawEvent());\n  }\n  /**\n   * Getter for the article title.\n   *\n   * @returns {string | undefined} - The article title if available, otherwise undefined.\n   */\n  get title() {\n    return this.tagValue(\"title\");\n  }\n  /**\n   * Setter for the article title.\n   *\n   * @param {string | undefined} title - The title to set for the article.\n   */\n  set title(title) {\n    this.removeTag(\"title\");\n    if (title) this.tags.push([\"title\", title]);\n  }\n  /**\n   * Getter for the article thumbnail.\n   *\n   * @returns {string | undefined} - The article thumbnail if available, otherwise undefined.\n   */\n  get thumbnail() {\n    let thumbnail;\n    if (this.imetas && this.imetas.length > 0) {\n      thumbnail = this.imetas[0].image?.[0];\n    }\n    return thumbnail ?? this.tagValue(\"thumb\");\n  }\n  get imetas() {\n    if (this._imetas) return this._imetas;\n    this._imetas = this.tags.filter((tag) => tag[0] === \"imeta\").map(mapImetaTag);\n    return this._imetas;\n  }\n  set imetas(tags) {\n    this._imetas = tags;\n    this.tags = this.tags.filter((tag) => tag[0] !== \"imeta\");\n    this.tags.push(...tags.map(imetaTagToTag));\n  }\n  get url() {\n    if (this.imetas && this.imetas.length > 0) {\n      return this.imetas[0].url;\n    }\n    return this.tagValue(\"url\");\n  }\n  /**\n   * Getter for the article's publication timestamp.\n   *\n   * @returns {number | undefined} - The Unix timestamp of when the article was published or undefined.\n   */\n  get published_at() {\n    const tag = this.tagValue(\"published_at\");\n    if (tag) {\n      return Number.parseInt(tag);\n    }\n    return void 0;\n  }\n  /**\n   * Generates content tags for the article.\n   *\n   * This method first checks and sets the publication date if not available,\n   * and then generates content tags based on the base NDKEvent class.\n   *\n   * @returns {ContentTag} - The generated content tags.\n   */\n  async generateTags() {\n    super.generateTags();\n    if (!this.kind) {\n      if (this.imetas?.[0]?.dim) {\n        const [width, height] = this.imetas[0].dim.split(\"x\");\n        const isPortrait = width && height && Number.parseInt(width) < Number.parseInt(height);\n        const isShort = this.duration && this.duration < 120;\n        if (isShort && isPortrait) this.kind = 22 /* ShortVideo */;\n        else this.kind = 21 /* Video */;\n      }\n    }\n    return super.generateTags();\n  }\n  get duration() {\n    const tag = this.tagValue(\"duration\");\n    if (tag) {\n      return Number.parseInt(tag);\n    }\n    return void 0;\n  }\n  /**\n   * Setter for the video's duration\n   *\n   * @param {number | undefined} duration - The duration to set for the video (in seconds)\n   */\n  set duration(dur) {\n    this.removeTag(\"duration\");\n    if (dur !== void 0) {\n      this.tags.push([\"duration\", Math.floor(dur).toString()]);\n    }\n  }\n};\n\n// src/events/kinds/wiki.ts\nvar NDKWiki = class extends NDKArticle {\n  static kind = 30818 /* Wiki */;\n  static kinds = [30818 /* Wiki */];\n};\n\n// src/events/wrap.ts\nfunction wrapEvent(event) {\n  const eventWrappingMap = /* @__PURE__ */ new Map();\n  for (const klass2 of [\n    NDKImage,\n    NDKVideo,\n    NDKCashuMintList,\n    NDKArticle,\n    NDKHighlight,\n    NDKWiki,\n    NDKNutzap,\n    NDKSimpleGroupMemberList,\n    NDKSimpleGroupMetadata,\n    NDKSubscriptionTier,\n    NDKCashuToken,\n    NDKList,\n    NDKStory\n  ]) {\n    for (const kind of klass2.kinds) {\n      eventWrappingMap.set(kind, klass2);\n    }\n  }\n  const klass = eventWrappingMap.get(event.kind);\n  if (klass) return klass.from(event);\n  return event;\n}\n\n// src/subscription/utils.ts\nimport { nip19 as nip194 } from \"nostr-tools\";\nvar MAX_SUBID_LENGTH = 20;\nfunction queryFullyFilled(subscription) {\n  if (filterIncludesIds(subscription.filter)) {\n    if (resultHasAllRequestedIds(subscription)) {\n      return true;\n    }\n  }\n  return false;\n}\nfunction compareFilter(filter1, filter2) {\n  if (Object.keys(filter1).length !== Object.keys(filter2).length) return false;\n  for (const [key, value] of Object.entries(filter1)) {\n    const valuesInFilter2 = filter2[key];\n    if (!valuesInFilter2) return false;\n    if (Array.isArray(value) && Array.isArray(valuesInFilter2)) {\n      const v = value;\n      for (const valueInFilter2 of valuesInFilter2) {\n        const val = valueInFilter2;\n        if (!v.includes(val)) {\n          return false;\n        }\n      }\n    } else {\n      if (valuesInFilter2 !== value) return false;\n    }\n  }\n  return true;\n}\nfunction filterIncludesIds(filter) {\n  return !!filter.ids;\n}\nfunction resultHasAllRequestedIds(subscription) {\n  const ids = subscription.filter.ids;\n  return !!ids && ids.length === subscription.eventFirstSeen.size;\n}\nfunction generateSubId(subscriptions, filters) {\n  const subIds = subscriptions.map((sub) => sub.subId).filter(Boolean);\n  const subIdParts = [];\n  const filterNonKindKeys = /* @__PURE__ */ new Set();\n  const filterKinds = /* @__PURE__ */ new Set();\n  if (subIds.length > 0) {\n    subIdParts.push(Array.from(new Set(subIds)).join(\",\"));\n  } else {\n    for (const filter of filters) {\n      for (const key of Object.keys(filter)) {\n        if (key === \"kinds\") {\n          filter.kinds?.forEach((k) => filterKinds.add(k));\n        } else {\n          filterNonKindKeys.add(key);\n        }\n      }\n    }\n    if (filterKinds.size > 0) {\n      subIdParts.push(`kinds:${Array.from(filterKinds).join(\",\")}`);\n    }\n    if (filterNonKindKeys.size > 0) {\n      subIdParts.push(Array.from(filterNonKindKeys).join(\",\"));\n    }\n  }\n  let subId = subIdParts.join(\"-\");\n  if (subId.length > MAX_SUBID_LENGTH) subId = subId.substring(0, MAX_SUBID_LENGTH);\n  subId += `-${Math.floor(Math.random() * 999).toString()}`;\n  return subId;\n}\nfunction filterForEventsTaggingId(id) {\n  try {\n    const decoded = nip194.decode(id);\n    switch (decoded.type) {\n      case \"naddr\":\n        return {\n          \"#a\": [`${decoded.data.kind}:${decoded.data.pubkey}:${decoded.data.identifier}`]\n        };\n      case \"nevent\":\n        return { \"#e\": [decoded.data.id] };\n      case \"note\":\n        return { \"#e\": [decoded.data] };\n      case \"nprofile\":\n        return { \"#p\": [decoded.data.pubkey] };\n      case \"npub\":\n        return { \"#p\": [decoded.data] };\n    }\n  } catch {\n  }\n}\nfunction filterAndRelaySetFromBech32(beche2, ndk) {\n  const filter = filterFromId(beche2);\n  const relays = relaysFromBech32(beche2, ndk);\n  if (relays.length === 0) return { filter };\n  return {\n    filter,\n    relaySet: new NDKRelaySet(new Set(relays), ndk)\n  };\n}\nfunction filterFromId(id) {\n  let decoded;\n  if (id.match(NIP33_A_REGEX)) {\n    const [kind, pubkey, identifier] = id.split(\":\");\n    const filter = {\n      authors: [pubkey],\n      kinds: [Number.parseInt(kind)]\n    };\n    if (identifier) {\n      filter[\"#d\"] = [identifier];\n    }\n    return filter;\n  }\n  if (id.match(BECH32_REGEX)) {\n    try {\n      decoded = nip194.decode(id);\n      switch (decoded.type) {\n        case \"nevent\": {\n          const filter = { ids: [decoded.data.id] };\n          if (decoded.data.author) filter.authors = [decoded.data.author];\n          if (decoded.data.kind) filter.kinds = [decoded.data.kind];\n          return filter;\n        }\n        case \"note\":\n          return { ids: [decoded.data] };\n        case \"naddr\": {\n          const filter = {\n            authors: [decoded.data.pubkey],\n            kinds: [decoded.data.kind]\n          };\n          if (decoded.data.identifier) filter[\"#d\"] = [decoded.data.identifier];\n          return filter;\n        }\n      }\n    } catch (e) {\n      console.error(\"Error decoding\", id, e);\n    }\n  }\n  return { ids: [id] };\n}\nfunction isNip33AValue(value) {\n  return value.match(NIP33_A_REGEX) !== null;\n}\nvar NIP33_A_REGEX = /^(\\d+):([0-9A-Fa-f]+)(?::(.*))?$/;\nvar BECH32_REGEX = /^n(event|ote|profile|pub|addr)1[\\d\\w]+$/;\nfunction relaysFromBech32(bech322, ndk) {\n  try {\n    const decoded = nip194.decode(bech322);\n    if ([\"naddr\", \"nevent\"].includes(decoded?.type)) {\n      const data = decoded.data;\n      if (data?.relays) {\n        return data.relays.map((r) => new NDKRelay(r, ndk.relayAuthDefaultPolicy, ndk));\n      }\n    }\n  } catch (_e) {\n  }\n  return [];\n}\n\n// src/subscription/index.ts\nvar NDKSubscriptionCacheUsage = /* @__PURE__ */ ((NDKSubscriptionCacheUsage2) => {\n  NDKSubscriptionCacheUsage2[\"ONLY_CACHE\"] = \"ONLY_CACHE\";\n  NDKSubscriptionCacheUsage2[\"CACHE_FIRST\"] = \"CACHE_FIRST\";\n  NDKSubscriptionCacheUsage2[\"PARALLEL\"] = \"PARALLEL\";\n  NDKSubscriptionCacheUsage2[\"ONLY_RELAY\"] = \"ONLY_RELAY\";\n  return NDKSubscriptionCacheUsage2;\n})(NDKSubscriptionCacheUsage || {});\nvar defaultOpts = {\n  closeOnEose: false,\n  cacheUsage: \"CACHE_FIRST\" /* CACHE_FIRST */,\n  dontSaveToCache: false,\n  groupable: true,\n  groupableDelay: 100,\n  groupableDelayType: \"at-most\",\n  cacheUnconstrainFilter: [\"limit\", \"since\", \"until\"]\n};\nvar NDKSubscription = class extends EventEmitter4 {\n  subId;\n  filters;\n  opts;\n  pool;\n  skipVerification = false;\n  skipValidation = false;\n  /**\n   * Tracks the filters as they are executed on each relay\n   */\n  relayFilters;\n  relaySet;\n  ndk;\n  debug;\n  /**\n   * Events that have been seen by the subscription, with the time they were first seen.\n   */\n  eventFirstSeen = /* @__PURE__ */ new Map();\n  /**\n   * Relays that have sent an EOSE.\n   */\n  eosesSeen = /* @__PURE__ */ new Set();\n  /**\n   * The time the last event was received by the subscription.\n   * This is used to calculate when EOSE should be emitted.\n   */\n  lastEventReceivedAt;\n  /**\n   * The most recent event timestamp from cache results.\n   * This is used for addSinceFromCache functionality.\n   */\n  mostRecentCacheEventTimestamp;\n  internalId;\n  /**\n   * Whether the subscription should close when all relays have reached the end of the event stream.\n   */\n  closeOnEose;\n  /**\n   * Pool monitor callback\n   */\n  poolMonitor;\n  skipOptimisticPublishEvent = false;\n  /**\n   * Filters to remove when querying the cache.\n   */\n  cacheUnconstrainFilter;\n  constructor(ndk, filters, opts, subId) {\n    super();\n    this.ndk = ndk;\n    this.opts = { ...defaultOpts, ...opts || {} };\n    this.pool = this.opts.pool || ndk.pool;\n    this.filters = Array.isArray(filters) ? filters : [filters];\n    this.subId = subId || this.opts.subId;\n    this.internalId = Math.random().toString(36).substring(7);\n    this.debug = ndk.debug.extend(`subscription[${this.opts.subId ?? this.internalId}]`);\n    if (this.opts.relaySet) {\n      this.relaySet = this.opts.relaySet;\n    } else if (this.opts.relayUrls) {\n      this.relaySet = NDKRelaySet.fromRelayUrls(this.opts.relayUrls, this.ndk);\n    }\n    this.skipVerification = this.opts.skipVerification || false;\n    this.skipValidation = this.opts.skipValidation || false;\n    this.closeOnEose = this.opts.closeOnEose || false;\n    this.skipOptimisticPublishEvent = this.opts.skipOptimisticPublishEvent || false;\n    this.cacheUnconstrainFilter = this.opts.cacheUnconstrainFilter;\n  }\n  /**\n   * Returns the relays that have not yet sent an EOSE.\n   */\n  relaysMissingEose() {\n    if (!this.relayFilters) return [];\n    const relaysMissingEose = Array.from(this.relayFilters?.keys()).filter(\n      (url) => !this.eosesSeen.has(this.pool.getRelay(url, false, false))\n    );\n    return relaysMissingEose;\n  }\n  /**\n   * Provides access to the first filter of the subscription for\n   * backwards compatibility.\n   */\n  get filter() {\n    return this.filters[0];\n  }\n  get groupableDelay() {\n    if (!this.isGroupable()) return void 0;\n    return this.opts?.groupableDelay;\n  }\n  get groupableDelayType() {\n    return this.opts?.groupableDelayType || \"at-most\";\n  }\n  isGroupable() {\n    return this.opts?.groupable || false;\n  }\n  shouldQueryCache() {\n    if (this.opts.addSinceFromCache) return true;\n    if (this.opts?.cacheUsage === \"ONLY_RELAY\" /* ONLY_RELAY */) return false;\n    const hasNonEphemeralKind = this.filters.some((f) => f.kinds?.some((k) => kindIsEphemeral(k)));\n    if (hasNonEphemeralKind) return true;\n    return true;\n  }\n  shouldQueryRelays() {\n    return this.opts?.cacheUsage !== \"ONLY_CACHE\" /* ONLY_CACHE */;\n  }\n  shouldWaitForCache() {\n    if (this.opts.addSinceFromCache) return true;\n    return (\n      // Must want to close on EOSE; subscriptions\n      // that want to receive further updates must\n      // always hit the relay\n      this.opts.closeOnEose && // Cache adapter must claim to be fast\n      !!this.ndk.cacheAdapter?.locking && // If explicitly told to run in parallel, then\n      // we should not wait for the cache\n      this.opts.cacheUsage !== \"PARALLEL\" /* PARALLEL */\n    );\n  }\n  /**\n   * Start the subscription. This is the main method that should be called\n   * after creating a subscription.\n   *\n   * @param emitCachedEvents - Whether to emit events coming from a synchronous cache\n   *\n   * When using a synchronous cache, the events will be returned immediately\n   * by this function. If you will use those returned events, you should\n   * set emitCachedEvents to false to prevent seeing them as duplicate events.\n   */\n  start(emitCachedEvents = true) {\n    let cacheResult;\n    const updateStateFromCacheResults = (events) => {\n      if (emitCachedEvents) {\n        for (const event of events) {\n          if (!this.mostRecentCacheEventTimestamp || event.created_at > this.mostRecentCacheEventTimestamp) {\n            this.mostRecentCacheEventTimestamp = event.created_at;\n          }\n          this.eventReceived(event, void 0, true, false);\n        }\n      } else {\n        cacheResult = [];\n        for (const event of events) {\n          if (!this.mostRecentCacheEventTimestamp || event.created_at > this.mostRecentCacheEventTimestamp) {\n            this.mostRecentCacheEventTimestamp = event.created_at;\n          }\n          event.ndk = this.ndk;\n          const e = this.opts.wrap ? wrapEvent(event) : event;\n          if (!e) break;\n          if (e instanceof Promise) {\n            e.then((wrappedEvent) => {\n              this.emitEvent(false, wrappedEvent, void 0, true, false);\n            });\n            break;\n          }\n          this.eventFirstSeen.set(e.id, Date.now());\n          cacheResult.push(e);\n        }\n      }\n    };\n    const loadFromRelays = () => {\n      if (this.shouldQueryRelays()) {\n        this.startWithRelays();\n        this.startPoolMonitor();\n      } else {\n        this.emit(\"eose\", this);\n      }\n    };\n    if (this.shouldQueryCache()) {\n      cacheResult = this.startWithCache();\n      if (cacheResult instanceof Promise) {\n        if (this.shouldWaitForCache()) {\n          cacheResult.then((events) => {\n            updateStateFromCacheResults(events);\n            if (queryFullyFilled(this)) {\n              this.emit(\"eose\", this);\n              return;\n            }\n            loadFromRelays();\n          });\n          return null;\n        }\n        cacheResult.then((events) => {\n          updateStateFromCacheResults(events);\n        });\n        loadFromRelays();\n        return null;\n      }\n      updateStateFromCacheResults(cacheResult);\n      if (queryFullyFilled(this)) {\n        this.emit(\"eose\", this);\n      } else {\n        loadFromRelays();\n      }\n      return cacheResult;\n    }\n    loadFromRelays();\n    return null;\n  }\n  /**\n   * We want to monitor for new relays that are coming online, in case\n   * they should be part of this subscription.\n   */\n  startPoolMonitor() {\n    const _d = this.debug.extend(\"pool-monitor\");\n    this.poolMonitor = (relay) => {\n      if (this.relayFilters?.has(relay.url)) return;\n      const calc = calculateRelaySetsFromFilters(this.ndk, this.filters, this.pool);\n      if (calc.get(relay.url)) {\n        this.relayFilters?.set(relay.url, this.filters);\n        relay.subscribe(this, this.filters);\n      }\n    };\n    this.pool.on(\"relay:connect\", this.poolMonitor);\n  }\n  onStopped;\n  stop() {\n    this.emit(\"close\", this);\n    this.poolMonitor && this.pool.off(\"relay:connect\", this.poolMonitor);\n    this.onStopped?.();\n  }\n  /**\n   * @returns Whether the subscription has an authors filter.\n   */\n  hasAuthorsFilter() {\n    return this.filters.some((f) => f.authors?.length);\n  }\n  startWithCache() {\n    if (this.ndk.cacheAdapter?.query) {\n      return this.ndk.cacheAdapter.query(this);\n    }\n    return [];\n  }\n  /**\n   * Find available relays that should be part of this subscription and execute in them.\n   *\n   * Note that this is executed in addition to using the pool monitor, so even if the relay set\n   * that is computed (i.e. we don't have any relays available), when relays come online, we will\n   * check if we need to execute in them.\n   */\n  startWithRelays() {\n    let filters = this.filters;\n    if (this.opts.addSinceFromCache && this.mostRecentCacheEventTimestamp) {\n      const sinceTimestamp = this.mostRecentCacheEventTimestamp + 1;\n      filters = filters.map((filter) => ({\n        ...filter,\n        since: Math.max(filter.since || 0, sinceTimestamp)\n      }));\n    }\n    if (!this.relaySet || this.relaySet.relays.size === 0) {\n      this.relayFilters = calculateRelaySetsFromFilters(this.ndk, filters, this.pool);\n    } else {\n      this.relayFilters = /* @__PURE__ */ new Map();\n      for (const relay of this.relaySet.relays) {\n        this.relayFilters.set(relay.url, filters);\n      }\n    }\n    for (const [relayUrl, filters2] of this.relayFilters) {\n      const relay = this.pool.getRelay(relayUrl, true, true, filters2);\n      relay.subscribe(this, filters2);\n    }\n  }\n  // EVENT handling\n  /**\n   * Called when an event is received from a relay or the cache\n   * @param event\n   * @param relay\n   * @param fromCache Whether the event was received from the cache\n   * @param optimisticPublish Whether this event is coming from an optimistic publish\n   */\n  eventReceived(event, relay, fromCache = false, optimisticPublish = false) {\n    const eventId = event.id;\n    const eventAlreadySeen = this.eventFirstSeen.has(eventId);\n    let ndkEvent;\n    if (event instanceof NDKEvent) ndkEvent = event;\n    if (!eventAlreadySeen) {\n      ndkEvent ??= new NDKEvent(this.ndk, event);\n      ndkEvent.ndk = this.ndk;\n      ndkEvent.relay = relay;\n      if (!fromCache && !optimisticPublish) {\n        if (!this.skipValidation) {\n          if (!ndkEvent.isValid) {\n            this.debug(\"Event failed validation %s from relay %s\", eventId, relay?.url);\n            return;\n          }\n        }\n        if (relay) {\n          if (relay?.shouldValidateEvent() !== false) {\n            if (!this.skipVerification) {\n              if (!ndkEvent.verifySignature(true) && !this.ndk.asyncSigVerification) {\n                this.debug(\"Event failed signature validation\", event);\n                return;\n              }\n              if (relay) {\n                relay.addValidatedEvent();\n              }\n            }\n          } else {\n            relay.addNonValidatedEvent();\n          }\n        }\n        if (this.ndk.cacheAdapter && !this.opts.dontSaveToCache) {\n          this.ndk.cacheAdapter.setEvent(ndkEvent, this.filters, relay);\n        }\n      }\n      if (!optimisticPublish || this.skipOptimisticPublishEvent !== true) {\n        this.emitEvent(this.opts?.wrap ?? false, ndkEvent, relay, fromCache, optimisticPublish);\n        this.eventFirstSeen.set(eventId, Date.now());\n      }\n    } else {\n      const timeSinceFirstSeen = Date.now() - (this.eventFirstSeen.get(eventId) || 0);\n      this.emit(\"event:dup\", event, relay, timeSinceFirstSeen, this, fromCache, optimisticPublish);\n      if (relay) {\n        const signature = verifiedSignatures.get(eventId);\n        if (signature && typeof signature === \"string\") {\n          if (event.sig === signature) {\n            relay.addValidatedEvent();\n          }\n        }\n      }\n    }\n    this.lastEventReceivedAt = Date.now();\n  }\n  /**\n   * Optionally wraps, sync or async, and emits the event (if one comes back from the wrapper)\n   */\n  emitEvent(wrap, evt, relay, fromCache, optimisticPublish) {\n    const wrapped = wrap ? wrapEvent(evt) : evt;\n    if (wrapped instanceof Promise) {\n      wrapped.then((e) => this.emitEvent(false, e, relay, fromCache, optimisticPublish));\n    } else if (wrapped) {\n      this.emit(\"event\", wrapped, relay, this, fromCache, optimisticPublish);\n    }\n  }\n  closedReceived(relay, reason) {\n    this.emit(\"closed\", relay, reason);\n  }\n  // EOSE handling\n  eoseTimeout;\n  eosed = false;\n  eoseReceived(relay) {\n    this.debug(\"EOSE received from %s\", relay.url);\n    this.eosesSeen.add(relay);\n    let lastEventSeen = this.lastEventReceivedAt ? Date.now() - this.lastEventReceivedAt : void 0;\n    const hasSeenAllEoses = this.eosesSeen.size === this.relayFilters?.size;\n    const queryFilled = queryFullyFilled(this);\n    const performEose = (reason) => {\n      this.debug(\"Performing EOSE: %s %d\", reason, this.eosed);\n      if (this.eosed) return;\n      if (this.eoseTimeout) clearTimeout(this.eoseTimeout);\n      this.emit(\"eose\", this);\n      this.eosed = true;\n      if (this.opts?.closeOnEose) this.stop();\n    };\n    if (queryFilled || hasSeenAllEoses) {\n      performEose(\"query filled or seen all\");\n    } else if (this.relayFilters) {\n      let timeToWaitForNextEose = 1e3;\n      const connectedRelays = new Set(this.pool.connectedRelays().map((r) => r.url));\n      const connectedRelaysWithFilters = Array.from(this.relayFilters.keys()).filter(\n        (url) => connectedRelays.has(url)\n      );\n      if (connectedRelaysWithFilters.length === 0) {\n        this.debug(\n          \"No connected relays, waiting for all relays to connect\",\n          Array.from(this.relayFilters.keys()).join(\", \")\n        );\n        return;\n      }\n      const percentageOfRelaysThatHaveSentEose = this.eosesSeen.size / connectedRelaysWithFilters.length;\n      this.debug(\"Percentage of relays that have sent EOSE\", {\n        subId: this.subId,\n        percentageOfRelaysThatHaveSentEose,\n        seen: this.eosesSeen.size,\n        total: connectedRelaysWithFilters.length\n      });\n      if (this.eosesSeen.size >= 2 && percentageOfRelaysThatHaveSentEose >= 0.5) {\n        timeToWaitForNextEose = timeToWaitForNextEose * (1 - percentageOfRelaysThatHaveSentEose);\n        if (timeToWaitForNextEose === 0) {\n          performEose(\"time to wait was 0\");\n          return;\n        }\n        if (this.eoseTimeout) clearTimeout(this.eoseTimeout);\n        const sendEoseTimeout = () => {\n          lastEventSeen = this.lastEventReceivedAt ? Date.now() - this.lastEventReceivedAt : void 0;\n          if (lastEventSeen !== void 0 && lastEventSeen < 20) {\n            this.eoseTimeout = setTimeout(sendEoseTimeout, timeToWaitForNextEose);\n          } else {\n            performEose(`send eose timeout: ${timeToWaitForNextEose}`);\n          }\n        };\n        this.eoseTimeout = setTimeout(sendEoseTimeout, timeToWaitForNextEose);\n      }\n    }\n  }\n};\nvar kindIsEphemeral = (kind) => kind >= 2e4 && kind < 3e4;\n\n// src/user/follows.ts\nasync function follows(opts, outbox, kind = 3 /* Contacts */) {\n  if (!this.ndk) throw new Error(\"NDK not set\");\n  const contactListEvent = await this.ndk.fetchEvent(\n    { kinds: [kind], authors: [this.pubkey] },\n    opts || { groupable: false }\n  );\n  if (contactListEvent) {\n    const pubkeys = /* @__PURE__ */ new Set();\n    contactListEvent.tags.forEach((tag) => {\n      if (tag[0] === \"p\") pubkeys.add(tag[1]);\n    });\n    if (outbox) {\n      this.ndk?.outboxTracker?.trackUsers(Array.from(pubkeys));\n    }\n    return [...pubkeys].reduce((acc, pubkey) => {\n      const user = new NDKUser({ pubkey });\n      user.ndk = this.ndk;\n      acc.add(user);\n      return acc;\n    }, /* @__PURE__ */ new Set());\n  }\n  return /* @__PURE__ */ new Set();\n}\n\n// src/user/nip05.ts\nvar NIP05_REGEX = /^(?:([\\w.+-]+)@)?([\\w.-]+)$/;\nasync function getNip05For(ndk, fullname, _fetch = fetch, fetchOpts = {}) {\n  return await ndk.queuesNip05.add({\n    id: fullname,\n    func: async () => {\n      if (ndk.cacheAdapter?.loadNip05) {\n        const profile = await ndk.cacheAdapter.loadNip05(fullname);\n        if (profile !== \"missing\") {\n          if (profile) {\n            const user = new NDKUser({\n              pubkey: profile.pubkey,\n              relayUrls: profile.relays,\n              nip46Urls: profile.nip46\n            });\n            user.ndk = ndk;\n            return user;\n          }\n          if (fetchOpts.cache !== \"no-cache\") {\n            return null;\n          }\n        }\n      }\n      const match = fullname.match(NIP05_REGEX);\n      if (!match) return null;\n      const [_, name = \"_\", domain] = match;\n      try {\n        const res = await _fetch(`https://${domain}/.well-known/nostr.json?name=${name}`, fetchOpts);\n        const { names, relays, nip46 } = parseNIP05Result(await res.json());\n        const pubkey = names[name.toLowerCase()];\n        let profile = null;\n        if (pubkey) {\n          profile = { pubkey, relays: relays?.[pubkey], nip46: nip46?.[pubkey] };\n        }\n        if (ndk?.cacheAdapter?.saveNip05) {\n          ndk.cacheAdapter.saveNip05(fullname, profile);\n        }\n        return profile;\n      } catch (_e) {\n        if (ndk?.cacheAdapter?.saveNip05) {\n          ndk?.cacheAdapter.saveNip05(fullname, null);\n        }\n        console.error(\"Failed to fetch NIP05 for\", fullname, _e);\n        return null;\n      }\n    }\n  });\n}\nfunction parseNIP05Result(json) {\n  const result = {\n    names: {}\n  };\n  for (const [name, pubkey] of Object.entries(json.names)) {\n    if (typeof name === \"string\" && typeof pubkey === \"string\") {\n      result.names[name.toLowerCase()] = pubkey;\n    }\n  }\n  if (json.relays) {\n    result.relays = {};\n    for (const [pubkey, relays] of Object.entries(json.relays)) {\n      if (typeof pubkey === \"string\" && Array.isArray(relays)) {\n        result.relays[pubkey] = relays.filter((relay) => typeof relay === \"string\");\n      }\n    }\n  }\n  if (json.nip46) {\n    result.nip46 = {};\n    for (const [pubkey, nip46] of Object.entries(json.nip46)) {\n      if (typeof pubkey === \"string\" && Array.isArray(nip46)) {\n        result.nip46[pubkey] = nip46.filter((relay) => typeof relay === \"string\");\n      }\n    }\n  }\n  return result;\n}\n\n// src/user/profile.ts\nfunction profileFromEvent(event) {\n  const profile = {};\n  let payload;\n  try {\n    payload = JSON.parse(event.content);\n  } catch (error) {\n    throw new Error(`Failed to parse profile event: ${error}`);\n  }\n  profile.created_at = event.created_at;\n  profile.profileEvent = JSON.stringify(event.rawEvent());\n  for (const key of Object.keys(payload)) {\n    switch (key) {\n      case \"name\":\n        profile.name = payload.name;\n        break;\n      case \"display_name\":\n        profile.displayName = payload.display_name;\n        break;\n      case \"image\":\n      case \"picture\":\n        profile.picture = payload.picture || payload.image;\n        profile.image = profile.picture;\n        break;\n      case \"banner\":\n        profile.banner = payload.banner;\n        break;\n      case \"bio\":\n        profile.bio = payload.bio;\n        break;\n      case \"nip05\":\n        profile.nip05 = payload.nip05;\n        break;\n      case \"lud06\":\n        profile.lud06 = payload.lud06;\n        break;\n      case \"lud16\":\n        profile.lud16 = payload.lud16;\n        break;\n      case \"about\":\n        profile.about = payload.about;\n        break;\n      case \"website\":\n        profile.website = payload.website;\n        break;\n      default:\n        profile[key] = payload[key];\n        break;\n    }\n  }\n  return profile;\n}\nfunction serializeProfile(profile) {\n  const payload = {};\n  for (const [key, val] of Object.entries(profile)) {\n    switch (key) {\n      case \"username\":\n      case \"name\":\n        payload.name = val;\n        break;\n      case \"displayName\":\n        payload.display_name = val;\n        break;\n      case \"image\":\n      case \"picture\":\n        payload.picture = val;\n        break;\n      case \"bio\":\n      case \"about\":\n        payload.about = val;\n        break;\n      default:\n        payload[key] = val;\n        break;\n    }\n  }\n  return JSON.stringify(payload);\n}\n\n// src/user/index.ts\nvar NDKUser = class _NDKUser {\n  ndk;\n  profile;\n  profileEvent;\n  _npub;\n  _pubkey;\n  relayUrls = [];\n  nip46Urls = [];\n  constructor(opts) {\n    if (opts.npub) this._npub = opts.npub;\n    if (opts.hexpubkey) this._pubkey = opts.hexpubkey;\n    if (opts.pubkey) this._pubkey = opts.pubkey;\n    if (opts.relayUrls) this.relayUrls = opts.relayUrls;\n    if (opts.nip46Urls) this.nip46Urls = opts.nip46Urls;\n    if (opts.nprofile) {\n      try {\n        const decoded = nip195.decode(opts.nprofile);\n        if (decoded.type === \"nprofile\") {\n          this._pubkey = decoded.data.pubkey;\n          if (decoded.data.relays && decoded.data.relays.length > 0) {\n            this.relayUrls.push(...decoded.data.relays);\n          }\n        }\n      } catch (e) {\n        console.error(\"Failed to decode nprofile\", e);\n      }\n    }\n  }\n  get npub() {\n    if (!this._npub) {\n      if (!this._pubkey) throw new Error(\"pubkey not set\");\n      this._npub = nip195.npubEncode(this.pubkey);\n    }\n    return this._npub;\n  }\n  get nprofile() {\n    const relays = this.profileEvent?.onRelays?.map((r) => r.url);\n    return nip195.nprofileEncode({\n      pubkey: this.pubkey,\n      relays\n    });\n  }\n  set npub(npub2) {\n    this._npub = npub2;\n  }\n  /**\n   * Get the user's pubkey\n   * @returns {string} The user's pubkey\n   */\n  get pubkey() {\n    if (!this._pubkey) {\n      if (!this._npub) throw new Error(\"npub not set\");\n      this._pubkey = nip195.decode(this.npub).data;\n    }\n    return this._pubkey;\n  }\n  /**\n   * Set the user's pubkey\n   * @param pubkey {string} The user's pubkey\n   */\n  set pubkey(pubkey) {\n    this._pubkey = pubkey;\n  }\n  /**\n   * Equivalent to NDKEvent.filters().\n   * @returns {NDKFilter}\n   */\n  filter() {\n    return { \"#p\": [this.pubkey] };\n  }\n  /**\n   * Gets NIP-57 and NIP-61 information that this user has signaled\n   *\n   * @param getAll {boolean} Whether to get all zap info or just the first one\n   */\n  async getZapInfo(timeoutMs) {\n    if (!this.ndk) throw new Error(\"No NDK instance found\");\n    const promiseWithTimeout = async (promise) => {\n      if (!timeoutMs) return promise;\n      let timeoutId;\n      const timeoutPromise = new Promise((_, reject) => {\n        timeoutId = setTimeout(() => reject(new Error(\"Timeout\")), timeoutMs);\n      });\n      try {\n        const result = await Promise.race([promise, timeoutPromise]);\n        if (timeoutId) clearTimeout(timeoutId);\n        return result;\n      } catch (e) {\n        if (e instanceof Error && e.message === \"Timeout\") {\n          try {\n            const result = await promise;\n            return result;\n          } catch (_originalError) {\n            return void 0;\n          }\n        }\n        return void 0;\n      }\n    };\n    const [userProfile, mintListEvent] = await Promise.all([\n      promiseWithTimeout(this.fetchProfile()),\n      promiseWithTimeout(this.ndk.fetchEvent({ kinds: [10019 /* CashuMintList */], authors: [this.pubkey] }))\n    ]);\n    const res = /* @__PURE__ */ new Map();\n    if (mintListEvent) {\n      const mintList = NDKCashuMintList.from(mintListEvent);\n      if (mintList.mints.length > 0) {\n        res.set(\"nip61\", {\n          mints: mintList.mints,\n          relays: mintList.relays,\n          p2pk: mintList.p2pk\n        });\n      }\n    }\n    if (userProfile) {\n      const { lud06, lud16 } = userProfile;\n      res.set(\"nip57\", { lud06, lud16 });\n    }\n    return res;\n  }\n  /**\n   * Instantiate an NDKUser from a NIP-05 string\n   * @param nip05Id {string} The user's NIP-05\n   * @param ndk {NDK} An NDK instance\n   * @param skipCache {boolean} Whether to skip the cache or not\n   * @returns {NDKUser | undefined} An NDKUser if one is found for the given NIP-05, undefined otherwise.\n   */\n  static async fromNip05(nip05Id, ndk, skipCache = false) {\n    if (!ndk) throw new Error(\"No NDK instance found\");\n    const opts = {};\n    if (skipCache) opts.cache = \"no-cache\";\n    const profile = await getNip05For(ndk, nip05Id, ndk?.httpFetch, opts);\n    if (profile) {\n      const user = new _NDKUser({\n        pubkey: profile.pubkey,\n        relayUrls: profile.relays,\n        nip46Urls: profile.nip46\n      });\n      user.ndk = ndk;\n      return user;\n    }\n  }\n  /**\n   * Fetch a user's profile\n   * @param opts {NDKSubscriptionOptions} A set of NDKSubscriptionOptions\n   * @param storeProfileEvent {boolean} Whether to store the profile event or not\n   * @returns User Profile\n   */\n  async fetchProfile(opts, storeProfileEvent = false) {\n    if (!this.ndk) throw new Error(\"NDK not set\");\n    let setMetadataEvent = null;\n    if (this.ndk.cacheAdapter && (this.ndk.cacheAdapter.fetchProfile || this.ndk.cacheAdapter.fetchProfileSync) && opts?.cacheUsage !== \"ONLY_RELAY\" /* ONLY_RELAY */) {\n      let profile = null;\n      if (this.ndk.cacheAdapter.fetchProfileSync) {\n        profile = this.ndk.cacheAdapter.fetchProfileSync(this.pubkey);\n      } else if (this.ndk.cacheAdapter.fetchProfile) {\n        profile = await this.ndk.cacheAdapter.fetchProfile(this.pubkey);\n      }\n      if (profile) {\n        this.profile = profile;\n        return profile;\n      }\n    }\n    opts ??= {};\n    opts.cacheUsage ??= \"ONLY_RELAY\" /* ONLY_RELAY */;\n    opts.closeOnEose ??= true;\n    opts.groupable ??= true;\n    opts.groupableDelay ??= 250;\n    if (!setMetadataEvent) {\n      setMetadataEvent = await this.ndk.fetchEvent({ kinds: [0], authors: [this.pubkey] }, opts);\n    }\n    if (!setMetadataEvent) return null;\n    this.profile = profileFromEvent(setMetadataEvent);\n    if (storeProfileEvent && this.profile && this.ndk.cacheAdapter && this.ndk.cacheAdapter.saveProfile) {\n      this.ndk.cacheAdapter.saveProfile(this.pubkey, this.profile);\n    }\n    return this.profile;\n  }\n  /**\n   * Returns a set of users that this user follows.\n   *\n   * @deprecated Use followSet instead\n   */\n  follows = follows.bind(this);\n  /**\n   * Returns a set of pubkeys that this user follows.\n   *\n   * @param opts - NDKSubscriptionOptions\n   * @param outbox - boolean\n   * @param kind - number\n   */\n  async followSet(opts, outbox, kind = 3 /* Contacts */) {\n    const follows2 = await this.follows(opts, outbox, kind);\n    return new Set(Array.from(follows2).map((f) => f.pubkey));\n  }\n  /** @deprecated Use referenceTags instead. */\n  /**\n   * Get the tag that can be used to reference this user in an event\n   * @returns {NDKTag} an NDKTag\n   */\n  tagReference() {\n    return [\"p\", this.pubkey];\n  }\n  /**\n   * Get the tags that can be used to reference this user in an event\n   * @returns {NDKTag[]} an array of NDKTag\n   */\n  referenceTags(marker) {\n    const tag = [[\"p\", this.pubkey]];\n    if (!marker) return tag;\n    tag[0].push(\"\", marker);\n    return tag;\n  }\n  /**\n   * Publishes the current profile.\n   */\n  async publish() {\n    if (!this.ndk) throw new Error(\"No NDK instance found\");\n    if (!this.profile) throw new Error(\"No profile available\");\n    this.ndk.assertSigner();\n    const event = new NDKEvent(this.ndk, {\n      kind: 0,\n      content: serializeProfile(this.profile)\n    });\n    await event.publish();\n  }\n  /**\n   * Add a follow to this user's contact list\n   *\n   * @param newFollow {NDKUser} The user to follow\n   * @param currentFollowList {Set<NDKUser>} The current follow list\n   * @param kind {NDKKind} The kind to use for this contact list (defaults to `3`)\n   * @returns {Promise<boolean>} True if the follow was added, false if the follow already exists\n   */\n  async follow(newFollow, currentFollowList, kind = 3 /* Contacts */) {\n    if (!this.ndk) throw new Error(\"No NDK instance found\");\n    this.ndk.assertSigner();\n    if (!currentFollowList) {\n      currentFollowList = await this.follows(void 0, void 0, kind);\n    }\n    if (currentFollowList.has(newFollow)) {\n      return false;\n    }\n    currentFollowList.add(newFollow);\n    const event = new NDKEvent(this.ndk, { kind });\n    for (const follow of currentFollowList) {\n      event.tag(follow);\n    }\n    await event.publish();\n    return true;\n  }\n  /**\n   * Remove a follow from this user's contact list\n   *\n   * @param user {NDKUser} The user to unfollow\n   * @param currentFollowList {Set<NDKUser>} The current follow list\n   * @param kind {NDKKind} The kind to use for this contact list (defaults to `3`)\n   * @returns The relays were the follow list was published or false if the user wasn't found\n   */\n  async unfollow(user, currentFollowList, kind = 3 /* Contacts */) {\n    if (!this.ndk) throw new Error(\"No NDK instance found\");\n    this.ndk.assertSigner();\n    if (!currentFollowList) {\n      currentFollowList = await this.follows(void 0, void 0, kind);\n    }\n    const newUserFollowList = /* @__PURE__ */ new Set();\n    let foundUser = false;\n    for (const follow of currentFollowList) {\n      if (follow.pubkey !== user.pubkey) {\n        newUserFollowList.add(follow);\n      } else {\n        foundUser = true;\n      }\n    }\n    if (!foundUser) return false;\n    const event = new NDKEvent(this.ndk, { kind });\n    for (const follow of newUserFollowList) {\n      event.tag(follow);\n    }\n    return await event.publish();\n  }\n  /**\n   * Validate a user's NIP-05 identifier (usually fetched from their kind:0 profile data)\n   *\n   * @param nip05Id The NIP-05 string to validate\n   * @returns {Promise<boolean | null>} True if the NIP-05 is found and matches this user's pubkey,\n   * False if the NIP-05 is found but doesn't match this user's pubkey,\n   * null if the NIP-05 isn't found on the domain or we're unable to verify (because of network issues, etc.)\n   */\n  async validateNip05(nip05Id) {\n    if (!this.ndk) throw new Error(\"No NDK instance found\");\n    const profilePointer = await getNip05For(this.ndk, nip05Id);\n    if (profilePointer === null) return null;\n    return profilePointer.pubkey === this.pubkey;\n  }\n};\n\n// src/user/pin.ts\nasync function pinEvent(user, event, pinEvent2, publish) {\n  const kind = 10001 /* PinList */;\n  if (!user.ndk) throw new Error(\"No NDK instance found\");\n  user.ndk.assertSigner();\n  if (!pinEvent2) {\n    const events = await user.ndk.fetchEvents(\n      { kinds: [kind], authors: [user.pubkey] },\n      { cacheUsage: \"ONLY_RELAY\" /* ONLY_RELAY */ }\n    );\n    if (events.size > 0) {\n      pinEvent2 = lists_default.from(Array.from(events)[0]);\n    } else {\n      pinEvent2 = new NDKEvent(user.ndk, {\n        kind\n      });\n    }\n  }\n  pinEvent2.tag(event);\n  if (publish) {\n    await pinEvent2.publish();\n  }\n  return pinEvent2;\n}\n\n// src/events/kinds/classified.ts\nvar NDKClassified = class _NDKClassified extends NDKEvent {\n  constructor(ndk, rawEvent) {\n    super(ndk, rawEvent);\n    this.kind ??= 30402 /* Classified */;\n  }\n  /**\n   * Creates a NDKClassified from an existing NDKEvent.\n   *\n   * @param event NDKEvent to create the NDKClassified from.\n   * @returns NDKClassified\n   */\n  static from(event) {\n    return new _NDKClassified(event.ndk, event);\n  }\n  /**\n   * Getter for the classified title.\n   *\n   * @returns {string | undefined} - The classified title if available, otherwise undefined.\n   */\n  get title() {\n    return this.tagValue(\"title\");\n  }\n  /**\n   * Setter for the classified title.\n   *\n   * @param {string | undefined} title - The title to set for the classified.\n   */\n  set title(title) {\n    this.removeTag(\"title\");\n    if (title) this.tags.push([\"title\", title]);\n  }\n  /**\n   * Getter for the classified summary.\n   *\n   * @returns {string | undefined} - The classified summary if available, otherwise undefined.\n   */\n  get summary() {\n    return this.tagValue(\"summary\");\n  }\n  /**\n   * Setter for the classified summary.\n   *\n   * @param {string | undefined} summary - The summary to set for the classified.\n   */\n  set summary(summary) {\n    this.removeTag(\"summary\");\n    if (summary) this.tags.push([\"summary\", summary]);\n  }\n  /**\n   * Getter for the classified's publication timestamp.\n   *\n   * @returns {number | undefined} - The Unix timestamp of when the classified was published or undefined.\n   */\n  get published_at() {\n    const tag = this.tagValue(\"published_at\");\n    if (tag) {\n      return Number.parseInt(tag);\n    }\n    return void 0;\n  }\n  /**\n   * Setter for the classified's publication timestamp.\n   *\n   * @param {number | undefined} timestamp - The Unix timestamp to set for the classified's publication date.\n   */\n  set published_at(timestamp) {\n    this.removeTag(\"published_at\");\n    if (timestamp !== void 0) {\n      this.tags.push([\"published_at\", timestamp.toString()]);\n    }\n  }\n  /**\n   * Getter for the classified location.\n   *\n   * @returns {string | undefined} - The classified location if available, otherwise undefined.\n   */\n  get location() {\n    return this.tagValue(\"location\");\n  }\n  /**\n   * Setter for the classified location.\n   *\n   * @param {string | undefined} location - The location to set for the classified.\n   */\n  set location(location) {\n    this.removeTag(\"location\");\n    if (location) this.tags.push([\"location\", location]);\n  }\n  /**\n   * Getter for the classified price.\n   *\n   * @returns {NDKClassifiedPriceTag | undefined} - The classified price if available, otherwise undefined.\n   */\n  get price() {\n    const priceTag = this.tags.find((tag) => tag[0] === \"price\");\n    if (priceTag) {\n      return {\n        amount: Number.parseFloat(priceTag[1]),\n        currency: priceTag[2],\n        frequency: priceTag[3]\n      };\n    }\n    return void 0;\n  }\n  /**\n   * Setter for the classified price.\n   *\n   * @param price - The price to set for the classified.\n   */\n  set price(priceTag) {\n    if (typeof priceTag === \"string\") {\n      priceTag = {\n        amount: Number.parseFloat(priceTag)\n      };\n    }\n    if (priceTag?.amount) {\n      const tag = [\"price\", priceTag.amount.toString()];\n      if (priceTag.currency) tag.push(priceTag.currency);\n      if (priceTag.frequency) tag.push(priceTag.frequency);\n      this.tags.push(tag);\n    } else {\n      this.removeTag(\"price\");\n    }\n  }\n  /**\n   * Generates content tags for the classified.\n   *\n   * This method first checks and sets the publication date if not available,\n   * and then generates content tags based on the base NDKEvent class.\n   *\n   * @returns {ContentTag} - The generated content tags.\n   */\n  async generateTags() {\n    super.generateTags();\n    if (!this.published_at) {\n      this.published_at = this.created_at;\n    }\n    return super.generateTags();\n  }\n};\n\n// src/events/kinds/drafts.ts\nvar NDKDraft = class _NDKDraft extends NDKEvent {\n  _event;\n  constructor(ndk, rawEvent) {\n    super(ndk, rawEvent);\n    this.kind ??= 31234 /* Draft */;\n  }\n  static from(event) {\n    return new _NDKDraft(event.ndk, event);\n  }\n  /**\n   * Sets an identifier (i.e. d-tag)\n   */\n  set identifier(id) {\n    this.removeTag(\"d\");\n    this.tags.push([\"d\", id]);\n  }\n  get identifier() {\n    return this.dTag;\n  }\n  /**\n   * Event that is to be saved.\n   */\n  set event(e) {\n    if (e instanceof NDKEvent) this._event = e.rawEvent();\n    else this._event = e;\n    this.prepareEvent();\n  }\n  /**\n   * Gets the event.\n   * @param param0\n   * @returns NDKEvent of the draft event or null if the draft event has been deleted (emptied).\n   */\n  async getEvent(signer) {\n    if (this._event) return new NDKEvent(this.ndk, this._event);\n    signer ??= this.ndk?.signer;\n    if (!signer) throw new Error(\"No signer available\");\n    const user = await signer.user();\n    if (this.content && this.content.length > 0) {\n      try {\n        await this.decrypt(user, signer);\n        const payload = JSON.parse(this.content);\n        this._event = payload;\n        return new NDKEvent(this.ndk, payload);\n      } catch (e) {\n        console.error(e);\n        return void 0;\n      }\n    } else {\n      return null;\n    }\n  }\n  prepareEvent() {\n    if (!this._event) throw new Error(\"No event has been provided\");\n    this.removeTag(\"k\");\n    if (this._event.kind) this.tags.push([\"k\", this._event.kind.toString()]);\n    this.content = JSON.stringify(this._event);\n  }\n  /**\n   * Generates draft event.\n   *\n   * @param signer: Optional signer to encrypt with\n   * @param publish: Whether to publish, optionally specifying relaySet to publish to\n   */\n  async save({ signer, publish, relaySet }) {\n    signer ??= this.ndk?.signer;\n    if (!signer) throw new Error(\"No signer available\");\n    const user = await signer.user();\n    await this.encrypt(user, signer);\n    if (publish === false) return;\n    return this.publish(relaySet);\n  }\n};\n\n// src/events/kinds/dvm/feedback.ts\nvar NDKDvmJobFeedbackStatus = /* @__PURE__ */ ((NDKDvmJobFeedbackStatus2) => {\n  NDKDvmJobFeedbackStatus2[\"Processing\"] = \"processing\";\n  NDKDvmJobFeedbackStatus2[\"Success\"] = \"success\";\n  NDKDvmJobFeedbackStatus2[\"Scheduled\"] = \"scheduled\";\n  NDKDvmJobFeedbackStatus2[\"PayReq\"] = \"payment_required\";\n  return NDKDvmJobFeedbackStatus2;\n})(NDKDvmJobFeedbackStatus || {});\nvar NDKDVMJobFeedback = class _NDKDVMJobFeedback extends NDKEvent {\n  constructor(ndk, event) {\n    super(ndk, event);\n    this.kind ??= 7e3 /* DVMJobFeedback */;\n  }\n  static async from(event) {\n    const e = new _NDKDVMJobFeedback(event.ndk, event.rawEvent());\n    if (e.encrypted) await e.dvmDecrypt();\n    return e;\n  }\n  get status() {\n    return this.tagValue(\"status\");\n  }\n  set status(status) {\n    this.removeTag(\"status\");\n    if (status !== void 0) {\n      this.tags.push([\"status\", status]);\n    }\n  }\n  get encrypted() {\n    return !!this.getMatchingTags(\"encrypted\")[0];\n  }\n  async dvmDecrypt() {\n    await this.decrypt();\n    const decryptedContent = JSON.parse(this.content);\n    this.tags.push(...decryptedContent);\n  }\n};\n\n// src/events/kinds/dvm/request.ts\nvar NDKDVMRequest = class _NDKDVMRequest extends NDKEvent {\n  static from(event) {\n    return new _NDKDVMRequest(event.ndk, event.rawEvent());\n  }\n  set bid(msatAmount) {\n    if (msatAmount === void 0) {\n      this.removeTag(\"bid\");\n    } else {\n      this.tags.push([\"bid\", msatAmount.toString()]);\n    }\n  }\n  get bid() {\n    const v = this.tagValue(\"bid\");\n    if (v === void 0) return void 0;\n    return Number.parseInt(v);\n  }\n  /**\n   * Adds a new input to the job\n   * @param args The arguments to the input\n   */\n  addInput(...args) {\n    this.tags.push([\"i\", ...args]);\n  }\n  /**\n   * Adds a new parameter to the job\n   */\n  addParam(...args) {\n    this.tags.push([\"param\", ...args]);\n  }\n  set output(output) {\n    if (output === void 0) {\n      this.removeTag(\"output\");\n    } else {\n      if (typeof output === \"string\") output = [output];\n      this.tags.push([\"output\", ...output]);\n    }\n  }\n  get output() {\n    const outputTag = this.getMatchingTags(\"output\")[0];\n    return outputTag ? outputTag.slice(1) : void 0;\n  }\n  get params() {\n    const paramTags = this.getMatchingTags(\"param\");\n    return paramTags.map((t) => t.slice(1));\n  }\n  getParam(name) {\n    const paramTag = this.getMatchingTags(\"param\").find((t) => t[1] === name);\n    return paramTag ? paramTag[2] : void 0;\n  }\n  createFeedback(status) {\n    const feedback = new NDKDVMJobFeedback(this.ndk);\n    feedback.tag(this, \"job\");\n    feedback.status = status;\n    return feedback;\n  }\n  /**\n   * Enables job encryption for this event\n   * @param dvm DVM that will receive the event\n   * @param signer Signer to use for encryption\n   */\n  async encryption(dvm, signer) {\n    const dvmTags = [\"i\", \"param\", \"output\", \"relays\", \"bid\"];\n    const tags = this.tags.filter((t) => dvmTags.includes(t[0]));\n    this.tags = this.tags.filter((t) => !dvmTags.includes(t[0]));\n    this.content = JSON.stringify(tags);\n    this.tag(dvm);\n    this.tags.push([\"encrypted\"]);\n    await this.encrypt(dvm, signer);\n  }\n  /**\n   * Sets the DVM that will receive the event\n   */\n  set dvm(dvm) {\n    this.removeTag(\"p\");\n    if (dvm) this.tag(dvm);\n  }\n};\n\n// src/events/kinds/dvm/NDKTranscriptionDVM.ts\nvar NDKTranscriptionDVM = class _NDKTranscriptionDVM extends NDKDVMRequest {\n  constructor(ndk, event) {\n    super(ndk, event);\n    this.kind = 5e3 /* DVMReqTextExtraction */;\n  }\n  static from(event) {\n    return new _NDKTranscriptionDVM(event.ndk, event.rawEvent());\n  }\n  /**\n   * Returns the original source of the transcription\n   */\n  get url() {\n    const inputTags = this.getMatchingTags(\"i\");\n    if (inputTags.length !== 1) {\n      return void 0;\n    }\n    return inputTags[0][1];\n  }\n  /**\n   * Getter for the title tag\n   */\n  get title() {\n    return this.tagValue(\"title\");\n  }\n  /**\n   * Setter for the title tag\n   */\n  set title(value) {\n    this.removeTag(\"title\");\n    if (value) {\n      this.tags.push([\"title\", value]);\n    }\n  }\n  /**\n   * Getter for the image tag\n   */\n  get image() {\n    return this.tagValue(\"image\");\n  }\n  /**\n   * Setter for the image tag\n   */\n  set image(value) {\n    this.removeTag(\"image\");\n    if (value) {\n      this.tags.push([\"image\", value]);\n    }\n  }\n};\n\n// src/events/kinds/dvm/result.ts\nvar NDKDVMJobResult = class _NDKDVMJobResult extends NDKEvent {\n  static from(event) {\n    return new _NDKDVMJobResult(event.ndk, event.rawEvent());\n  }\n  setAmount(msat, invoice) {\n    this.removeTag(\"amount\");\n    const tag = [\"amount\", msat.toString()];\n    if (invoice) tag.push(invoice);\n    this.tags.push(tag);\n  }\n  set result(result) {\n    if (result === void 0) {\n      this.content = \"\";\n    } else {\n      this.content = result;\n    }\n  }\n  get result() {\n    if (this.content === \"\") {\n      return void 0;\n    }\n    return this.content;\n  }\n  set status(status) {\n    this.removeTag(\"status\");\n    if (status !== void 0) {\n      this.tags.push([\"status\", status]);\n    }\n  }\n  get status() {\n    return this.tagValue(\"status\");\n  }\n  get jobRequestId() {\n    for (const eTag of this.getMatchingTags(\"e\")) {\n      if (eTag[2] === \"job\") return eTag[1];\n    }\n    if (this.jobRequest) return this.jobRequest.id;\n    return this.tagValue(\"e\");\n  }\n  set jobRequest(event) {\n    this.removeTag(\"request\");\n    if (event) {\n      this.kind = event.kind + 1e3;\n      this.tags.push([\"request\", JSON.stringify(event.rawEvent())]);\n      this.tag(event);\n    }\n  }\n  get jobRequest() {\n    const tag = this.tagValue(\"request\");\n    if (tag === void 0) {\n      return void 0;\n    }\n    return new NDKEvent(this.ndk, JSON.parse(tag));\n  }\n};\n\n// src/events/kinds/cashu/tx.ts\nvar MARKERS = {\n  REDEEMED: \"redeemed\",\n  CREATED: \"created\",\n  DESTROYED: \"destroyed\",\n  RESERVED: \"reserved\"\n};\nvar NDKCashuWalletTx = class _NDKCashuWalletTx extends NDKEvent {\n  static MARKERS = MARKERS;\n  static kind = 7376 /* CashuWalletTx */;\n  static kinds = [7376 /* CashuWalletTx */];\n  constructor(ndk, event) {\n    super(ndk, event);\n    this.kind ??= 7376 /* CashuWalletTx */;\n  }\n  static async from(event) {\n    const walletChange = new _NDKCashuWalletTx(event.ndk, event);\n    const prevContent = walletChange.content;\n    try {\n      await walletChange.decrypt();\n    } catch (_e) {\n      walletChange.content ??= prevContent;\n    }\n    try {\n      const contentTags = JSON.parse(walletChange.content);\n      walletChange.tags = [...contentTags, ...walletChange.tags];\n    } catch (_e) {\n      return;\n    }\n    return walletChange;\n  }\n  set direction(direction) {\n    this.removeTag(\"direction\");\n    if (direction) this.tags.push([\"direction\", direction]);\n  }\n  get direction() {\n    return this.tagValue(\"direction\");\n  }\n  set amount(amount) {\n    this.removeTag(\"amount\");\n    this.tags.push([\"amount\", amount.toString()]);\n  }\n  get amount() {\n    const val = this.tagValue(\"amount\");\n    if (val === void 0) return void 0;\n    return Number(val);\n  }\n  set fee(fee) {\n    this.removeTag(\"fee\");\n    this.tags.push([\"fee\", fee.toString()]);\n  }\n  get fee() {\n    const val = this.tagValue(\"fee\");\n    if (val === void 0) return void 0;\n    return Number(val);\n  }\n  set unit(unit) {\n    this.removeTag(\"unit\");\n    if (unit) this.tags.push([\"unit\", unit.toString()]);\n  }\n  get unit() {\n    return this.tagValue(\"unit\");\n  }\n  set description(description) {\n    this.removeTag(\"description\");\n    if (description) this.tags.push([\"description\", description.toString()]);\n  }\n  get description() {\n    return this.tagValue(\"description\");\n  }\n  set mint(mint) {\n    this.removeTag(\"mint\");\n    if (mint) this.tags.push([\"mint\", mint.toString()]);\n  }\n  get mint() {\n    return this.tagValue(\"mint\");\n  }\n  /**\n   * Tags tokens that were created in this history event\n   */\n  set destroyedTokens(events) {\n    for (const event of events) {\n      this.tags.push(event.tagReference(MARKERS.DESTROYED));\n    }\n  }\n  set destroyedTokenIds(ids) {\n    for (const id of ids) {\n      this.tags.push([\"e\", id, \"\", MARKERS.DESTROYED]);\n    }\n  }\n  /**\n   * Tags tokens that were created in this history event\n   */\n  set createdTokens(events) {\n    for (const event of events) {\n      this.tags.push(event.tagReference(MARKERS.CREATED));\n    }\n  }\n  set reservedTokens(events) {\n    for (const event of events) {\n      this.tags.push(event.tagReference(MARKERS.RESERVED));\n    }\n  }\n  addRedeemedNutzap(event) {\n    this.tag(event, MARKERS.REDEEMED);\n  }\n  async toNostrEvent(pubkey) {\n    const encryptedTags = [];\n    const unencryptedTags = [];\n    for (const tag of this.tags) {\n      if (!this.shouldEncryptTag(tag)) {\n        unencryptedTags.push(tag);\n      } else {\n        encryptedTags.push(tag);\n      }\n    }\n    this.tags = unencryptedTags.filter((t) => t[0] !== \"client\");\n    this.content = JSON.stringify(encryptedTags);\n    const user = await this.ndk?.signer?.user();\n    await this.encrypt(user, void 0, \"nip44\");\n    return super.toNostrEvent(pubkey);\n  }\n  /**\n   * Whether this entry includes a redemption of a Nutzap\n   */\n  get hasNutzapRedemption() {\n    return this.getMatchingTags(\"e\", MARKERS.REDEEMED).length > 0;\n  }\n  shouldEncryptTag(tag) {\n    const unencryptedTagNames = [\"client\"];\n    if (unencryptedTagNames.includes(tag[0])) {\n      return false;\n    }\n    if (tag[0] === \"e\" && tag[3] === MARKERS.REDEEMED) {\n      return false;\n    }\n    if (tag[0] === \"p\") return false;\n    return true;\n  }\n};\n\n// src/events/kinds/NDKRelayList.ts\nvar READ_MARKER = \"read\";\nvar WRITE_MARKER = \"write\";\nvar NDKRelayList = class _NDKRelayList extends NDKEvent {\n  constructor(ndk, rawEvent) {\n    super(ndk, rawEvent);\n    this.kind ??= 10002 /* RelayList */;\n  }\n  static from(ndkEvent) {\n    return new _NDKRelayList(ndkEvent.ndk, ndkEvent.rawEvent());\n  }\n  get readRelayUrls() {\n    return this.tags.filter((tag) => tag[0] === \"r\" || tag[0] === \"relay\").filter((tag) => !tag[2] || tag[2] && tag[2] === READ_MARKER).map((tag) => tryNormalizeRelayUrl(tag[1])).filter((url) => !!url);\n  }\n  set readRelayUrls(relays) {\n    for (const relay of relays) {\n      this.tags.push([\"r\", relay, READ_MARKER]);\n    }\n  }\n  get writeRelayUrls() {\n    return this.tags.filter((tag) => tag[0] === \"r\" || tag[0] === \"relay\").filter((tag) => !tag[2] || tag[2] && tag[2] === WRITE_MARKER).map((tag) => tryNormalizeRelayUrl(tag[1])).filter((url) => !!url);\n  }\n  set writeRelayUrls(relays) {\n    for (const relay of relays) {\n      this.tags.push([\"r\", relay, WRITE_MARKER]);\n    }\n  }\n  get bothRelayUrls() {\n    return this.tags.filter((tag) => tag[0] === \"r\" || tag[0] === \"relay\").filter((tag) => !tag[2]).map((tag) => tag[1]);\n  }\n  set bothRelayUrls(relays) {\n    for (const relay of relays) {\n      this.tags.push([\"r\", relay]);\n    }\n  }\n  get relays() {\n    return this.tags.filter((tag) => tag[0] === \"r\" || tag[0] === \"relay\").map((tag) => tag[1]);\n  }\n  /**\n   * Provides a relaySet for the relays in this list.\n   */\n  get relaySet() {\n    if (!this.ndk) throw new Error(\"NDKRelayList has no NDK instance\");\n    return new NDKRelaySet(\n      new Set(this.relays.map((u) => this.ndk?.pool.getRelay(u)).filter((r) => !!r)),\n      this.ndk\n    );\n  }\n};\nfunction relayListFromKind3(ndk, contactList) {\n  try {\n    const content = JSON.parse(contactList.content);\n    const relayList = new NDKRelayList(ndk);\n    const readRelays = /* @__PURE__ */ new Set();\n    const writeRelays = /* @__PURE__ */ new Set();\n    for (let [key, config] of Object.entries(content)) {\n      try {\n        key = normalizeRelayUrl(key);\n      } catch {\n        continue;\n      }\n      if (!config) {\n        readRelays.add(key);\n        writeRelays.add(key);\n      } else {\n        const relayConfig = config;\n        if (relayConfig.write) writeRelays.add(key);\n        if (relayConfig.read) readRelays.add(key);\n      }\n    }\n    relayList.readRelayUrls = Array.from(readRelays);\n    relayList.writeRelayUrls = Array.from(writeRelays);\n    return relayList;\n  } catch {\n  }\n  return void 0;\n}\n\n// src/events/kinds/nip89/app-handler.ts\nvar NDKAppHandlerEvent = class _NDKAppHandlerEvent extends NDKEvent {\n  profile;\n  constructor(ndk, rawEvent) {\n    super(ndk, rawEvent);\n    this.kind ??= 31990 /* AppHandler */;\n  }\n  static from(ndkEvent) {\n    const event = new _NDKAppHandlerEvent(ndkEvent.ndk, ndkEvent.rawEvent());\n    if (event.isValid) {\n      return event;\n    }\n    return null;\n  }\n  get isValid() {\n    const combinations = /* @__PURE__ */ new Map();\n    const combinationFromTag = (tag) => [tag[0], tag[2]].join(\":\").toLowerCase();\n    const tagsToInspect = [\"web\", \"android\", \"ios\"];\n    for (const tag of this.tags) {\n      if (tagsToInspect.includes(tag[0])) {\n        const combination = combinationFromTag(tag);\n        if (combinations.has(combination)) {\n          if (combinations.get(combination) !== tag[1].toLowerCase()) {\n            return false;\n          }\n        }\n        combinations.set(combination, tag[1].toLowerCase());\n      }\n    }\n    return true;\n  }\n  /**\n   * Fetches app handler information\n   * If no app information is available on the kind:31990,\n   * we fetch the event's author's profile and return that instead.\n   */\n  async fetchProfile() {\n    if (this.profile === void 0 && this.content.length > 0) {\n      try {\n        const profile = JSON.parse(this.content);\n        if (profile?.name) {\n          return profile;\n        }\n        this.profile = null;\n      } catch (_e) {\n        this.profile = null;\n      }\n    }\n    return new Promise((resolve, reject) => {\n      const author = this.author;\n      author.fetchProfile().then(() => {\n        resolve(author.profile);\n      }).catch(reject);\n    });\n  }\n};\n\n// src/events/kinds/repost.ts\nvar NDKRepost = class _NDKRepost extends NDKEvent {\n  _repostedEvents;\n  static from(event) {\n    return new _NDKRepost(event.ndk, event.rawEvent());\n  }\n  /**\n   * Returns all reposted events by the current event.\n   *\n   * @param klass Optional class to convert the events to.\n   * @returns\n   */\n  async repostedEvents(klass, opts) {\n    const items = [];\n    if (!this.ndk) throw new Error(\"NDK instance not set\");\n    if (this._repostedEvents !== void 0) return this._repostedEvents;\n    for (const eventId of this.repostedEventIds()) {\n      const filter = filterForId(eventId);\n      const event = await this.ndk.fetchEvent(filter, opts);\n      if (event) {\n        items.push(klass ? klass.from(event) : event);\n      }\n    }\n    return items;\n  }\n  /**\n   * Returns the reposted event IDs.\n   */\n  repostedEventIds() {\n    return this.tags.filter((t) => t[0] === \"e\" || t[0] === \"a\").map((t) => t[1]);\n  }\n};\nfunction filterForId(id) {\n  if (id.match(/:/)) {\n    const [kind, pubkey, identifier] = id.split(\":\");\n    return {\n      kinds: [Number.parseInt(kind)],\n      authors: [pubkey],\n      \"#d\": [identifier]\n    };\n  }\n  return { ids: [id] };\n}\n\n// src/events/kinds/subscriptions/receipt.ts\nimport debug3 from \"debug\";\nvar NDKSubscriptionReceipt = class _NDKSubscriptionReceipt extends NDKEvent {\n  debug;\n  constructor(ndk, rawEvent) {\n    super(ndk, rawEvent);\n    this.kind ??= 7003 /* SubscriptionReceipt */;\n    this.debug = ndk?.debug.extend(\"subscription-start\") ?? debug3(\"ndk:subscription-start\");\n  }\n  static from(event) {\n    return new _NDKSubscriptionReceipt(event.ndk, event.rawEvent());\n  }\n  /**\n   * This is the person being subscribed to\n   */\n  get recipient() {\n    const pTag = this.getMatchingTags(\"p\")?.[0];\n    if (!pTag) return void 0;\n    const user = new NDKUser({ pubkey: pTag[1] });\n    return user;\n  }\n  set recipient(user) {\n    this.removeTag(\"p\");\n    if (!user) return;\n    this.tags.push([\"p\", user.pubkey]);\n  }\n  /**\n   * This is the person subscribing\n   */\n  get subscriber() {\n    const PTag = this.getMatchingTags(\"P\")?.[0];\n    if (!PTag) return void 0;\n    const user = new NDKUser({ pubkey: PTag[1] });\n    return user;\n  }\n  set subscriber(user) {\n    this.removeTag(\"P\");\n    if (!user) return;\n    this.tags.push([\"P\", user.pubkey]);\n  }\n  set subscriptionStart(event) {\n    this.debug(`before setting subscription start: ${this.rawEvent}`);\n    this.removeTag(\"e\");\n    this.tag(event, \"subscription\", true);\n    this.debug(`after setting subscription start: ${this.rawEvent}`);\n  }\n  get tierName() {\n    const tag = this.getMatchingTags(\"tier\")?.[0];\n    return tag?.[1];\n  }\n  get isValid() {\n    const period = this.validPeriod;\n    if (!period) {\n      return false;\n    }\n    if (period.start > period.end) {\n      return false;\n    }\n    const pTags = this.getMatchingTags(\"p\");\n    const PTags = this.getMatchingTags(\"P\");\n    if (pTags.length !== 1 || PTags.length !== 1) {\n      return false;\n    }\n    return true;\n  }\n  get validPeriod() {\n    const tag = this.getMatchingTags(\"valid\")?.[0];\n    if (!tag) return void 0;\n    try {\n      return {\n        start: new Date(Number.parseInt(tag[1]) * 1e3),\n        end: new Date(Number.parseInt(tag[2]) * 1e3)\n      };\n    } catch {\n      return void 0;\n    }\n  }\n  set validPeriod(period) {\n    this.removeTag(\"valid\");\n    if (!period) return;\n    this.tags.push([\n      \"valid\",\n      Math.floor(period.start.getTime() / 1e3).toString(),\n      Math.floor(period.end.getTime() / 1e3).toString()\n    ]);\n  }\n  get startPeriod() {\n    return this.validPeriod?.start;\n  }\n  get endPeriod() {\n    return this.validPeriod?.end;\n  }\n  /**\n   * Whether the subscription is currently active\n   */\n  isActive(time) {\n    time ??= /* @__PURE__ */ new Date();\n    const period = this.validPeriod;\n    if (!period) return false;\n    if (time < period.start) return false;\n    if (time > period.end) return false;\n    return true;\n  }\n};\n\n// src/events/kinds/subscriptions/subscription-start.ts\nimport debug4 from \"debug\";\nvar NDKSubscriptionStart = class _NDKSubscriptionStart extends NDKEvent {\n  debug;\n  constructor(ndk, rawEvent) {\n    super(ndk, rawEvent);\n    this.kind ??= 7001 /* Subscribe */;\n    this.debug = ndk?.debug.extend(\"subscription-start\") ?? debug4(\"ndk:subscription-start\");\n  }\n  static from(event) {\n    return new _NDKSubscriptionStart(event.ndk, event.rawEvent());\n  }\n  /**\n   * Recipient of the subscription. I.e. The author of this event subscribes to this user.\n   */\n  get recipient() {\n    const pTag = this.getMatchingTags(\"p\")?.[0];\n    if (!pTag) return void 0;\n    const user = new NDKUser({ pubkey: pTag[1] });\n    return user;\n  }\n  set recipient(user) {\n    this.removeTag(\"p\");\n    if (!user) return;\n    this.tags.push([\"p\", user.pubkey]);\n  }\n  /**\n   * The amount of the subscription.\n   */\n  get amount() {\n    const amountTag = this.getMatchingTags(\"amount\")?.[0];\n    if (!amountTag) return void 0;\n    return parseTagToSubscriptionAmount(amountTag);\n  }\n  set amount(amount) {\n    this.removeTag(\"amount\");\n    if (!amount) return;\n    this.tags.push(newAmount(amount.amount, amount.currency, amount.term));\n  }\n  /**\n   * The event id or NIP-33 tag id of the tier that the user is subscribing to.\n   */\n  get tierId() {\n    const eTag = this.getMatchingTags(\"e\")?.[0];\n    const aTag = this.getMatchingTags(\"a\")?.[0];\n    if (!eTag || !aTag) return void 0;\n    return eTag[1] ?? aTag[1];\n  }\n  set tier(tier) {\n    this.removeTag(\"e\");\n    this.removeTag(\"a\");\n    this.removeTag(\"event\");\n    if (!tier) return;\n    this.tag(tier);\n    this.removeTag(\"p\");\n    this.tags.push([\"p\", tier.pubkey]);\n    this.tags.push([\"event\", JSON.stringify(tier.rawEvent())]);\n  }\n  /**\n   * Fetches the tier that the user is subscribing to.\n   */\n  async fetchTier() {\n    const eventTag = this.tagValue(\"event\");\n    if (eventTag) {\n      try {\n        const parsedEvent = JSON.parse(eventTag);\n        return new NDKSubscriptionTier(this.ndk, parsedEvent);\n      } catch {\n        this.debug(\"Failed to parse event tag\");\n      }\n    }\n    const tierId = this.tierId;\n    if (!tierId) return void 0;\n    const e = await this.ndk?.fetchEvent(tierId);\n    if (!e) return void 0;\n    return NDKSubscriptionTier.from(e);\n  }\n  get isValid() {\n    if (this.getMatchingTags(\"amount\").length !== 1) {\n      this.debug(\"Invalid # of amount tag\");\n      return false;\n    }\n    if (!this.amount) {\n      this.debug(\"Invalid amount tag\");\n      return false;\n    }\n    if (this.getMatchingTags(\"p\").length !== 1) {\n      this.debug(\"Invalid # of p tag\");\n      return false;\n    }\n    if (!this.recipient) {\n      this.debug(\"Invalid p tag\");\n      return false;\n    }\n    return true;\n  }\n};\n\n// src/events/gift-wrapping.ts\nimport { getEventHash as getEventHash2 } from \"nostr-tools\";\n\n// src/signers/private-key/index.ts\nimport { finalizeEvent, generateSecretKey, getPublicKey, nip04, nip44 } from \"nostr-tools\";\nimport { bytesToHex as bytesToHex2, hexToBytes } from \"@noble/hashes/utils\";\nimport { nip19 as nip196 } from \"nostr-tools\";\nvar NDKPrivateKeySigner = class _NDKPrivateKeySigner {\n  _user;\n  _privateKey;\n  _pubkey;\n  /**\n   * Create a new signer from a private key.\n   * @param privateKey - The private key to use in hex form or nsec.\n   * @param ndk - The NDK instance to use.\n   */\n  constructor(privateKeyOrNsec, ndk) {\n    if (typeof privateKeyOrNsec === \"string\") {\n      if (privateKeyOrNsec.startsWith(\"nsec1\")) {\n        const { type, data } = nip196.decode(privateKeyOrNsec);\n        if (type === \"nsec\") this._privateKey = data;\n        else throw new Error(\"Invalid private key provided.\");\n      } else if (privateKeyOrNsec.length === 64) {\n        this._privateKey = hexToBytes(privateKeyOrNsec);\n      } else {\n        throw new Error(\"Invalid private key provided.\");\n      }\n    } else {\n      this._privateKey = privateKeyOrNsec;\n    }\n    this._pubkey = getPublicKey(this._privateKey);\n    if (ndk) this._user = ndk.getUser({ pubkey: this._pubkey });\n    this._user ??= new NDKUser({ pubkey: this._pubkey });\n  }\n  /**\n   * Get the private key in hex form.\n   */\n  get privateKey() {\n    if (!this._privateKey) throw new Error(\"Not ready\");\n    return bytesToHex2(this._privateKey);\n  }\n  /**\n   * Get the public key in hex form.\n   */\n  get pubkey() {\n    if (!this._pubkey) throw new Error(\"Not ready\");\n    return this._pubkey;\n  }\n  /**\n   * Get the private key in nsec form.\n   */\n  get nsec() {\n    if (!this._privateKey) throw new Error(\"Not ready\");\n    return nip196.nsecEncode(this._privateKey);\n  }\n  /**\n   * Get the public key in npub form.\n   */\n  get npub() {\n    if (!this._pubkey) throw new Error(\"Not ready\");\n    return nip196.npubEncode(this._pubkey);\n  }\n  /**\n   * Generate a new private key.\n   */\n  static generate() {\n    const privateKey = generateSecretKey();\n    return new _NDKPrivateKeySigner(privateKey);\n  }\n  /**\n   * Noop in NDKPrivateKeySigner.\n   */\n  async blockUntilReady() {\n    return this._user;\n  }\n  /**\n   * Get the user.\n   */\n  async user() {\n    return this._user;\n  }\n  /**\n   * Get the user.\n   */\n  get userSync() {\n    return this._user;\n  }\n  async sign(event) {\n    if (!this._privateKey) {\n      throw Error(\"Attempted to sign without a private key\");\n    }\n    return finalizeEvent(event, this._privateKey).sig;\n  }\n  async encryptionEnabled(scheme) {\n    const enabled = [];\n    if (!scheme || scheme === \"nip04\") enabled.push(\"nip04\");\n    if (!scheme || scheme === \"nip44\") enabled.push(\"nip44\");\n    return enabled;\n  }\n  async encrypt(recipient, value, scheme) {\n    if (!this._privateKey || !this.privateKey) {\n      throw Error(\"Attempted to encrypt without a private key\");\n    }\n    const recipientHexPubKey = recipient.pubkey;\n    if (scheme === \"nip44\") {\n      const conversationKey = nip44.v2.utils.getConversationKey(this._privateKey, recipientHexPubKey);\n      return await nip44.v2.encrypt(value, conversationKey);\n    }\n    return await nip04.encrypt(this._privateKey, recipientHexPubKey, value);\n  }\n  async decrypt(sender, value, scheme) {\n    if (!this._privateKey || !this.privateKey) {\n      throw Error(\"Attempted to decrypt without a private key\");\n    }\n    const senderHexPubKey = sender.pubkey;\n    if (scheme === \"nip44\") {\n      const conversationKey = nip44.v2.utils.getConversationKey(this._privateKey, senderHexPubKey);\n      return await nip44.v2.decrypt(value, conversationKey);\n    }\n    return await nip04.decrypt(this._privateKey, senderHexPubKey, value);\n  }\n  /**\n   * Serializes the signer's private key into a storable format.\n   * @returns A JSON string containing the type and the hex private key.\n   */\n  toPayload() {\n    if (!this._privateKey) throw new Error(\"Private key not available\");\n    const payload = {\n      type: \"private-key\",\n      payload: this.privateKey\n      // Use the hex private key\n    };\n    return JSON.stringify(payload);\n  }\n  /**\n   * Deserializes the signer from a payload string.\n   * @param payloadString The JSON string obtained from toPayload().\n   * @param ndk Optional NDK instance.\n   * @returns An instance of NDKPrivateKeySigner.\n   */\n  static async fromPayload(payloadString, ndk) {\n    const payload = JSON.parse(payloadString);\n    if (payload.type !== \"private-key\") {\n      throw new Error(`Invalid payload type: expected 'private-key', got ${payload.type}`);\n    }\n    if (!payload.payload || typeof payload.payload !== \"string\") {\n      throw new Error(\"Invalid payload content for private-key signer\");\n    }\n    return new _NDKPrivateKeySigner(payload.payload, ndk);\n  }\n};\n\n// src/events/gift-wrapping.ts\nasync function giftWrap(event, recipient, signer, params = {}) {\n  let _signer = signer;\n  params.scheme ??= \"nip44\";\n  if (!_signer) {\n    if (!event.ndk) throw new Error(\"no signer available for giftWrap\");\n    _signer = event.ndk.signer;\n  }\n  if (!_signer) throw new Error(\"no signer\");\n  if (!_signer.encryptionEnabled || !_signer.encryptionEnabled(params.scheme))\n    throw new Error(\"signer is not able to giftWrap\");\n  const rumor = getRumorEvent(event, params?.rumorKind);\n  const seal = await getSealEvent(rumor, recipient, _signer, params.scheme);\n  const wrap = await getWrapEvent(seal, recipient, params);\n  return new NDKEvent(event.ndk, wrap);\n}\nasync function giftUnwrap(event, sender, signer, scheme = \"nip44\") {\n  const _sender = sender || new NDKUser({ pubkey: event.pubkey });\n  let _signer = signer;\n  if (!_signer) {\n    if (!event.ndk) throw new Error(\"no signer available for giftUnwrap\");\n    _signer = event.ndk.signer;\n  }\n  if (!signer) throw new Error(\"no signer\");\n  try {\n    const seal = JSON.parse(await signer.decrypt(_sender, event.content, scheme));\n    if (!seal) throw new Error(\"Failed to decrypt wrapper\");\n    if (!new NDKEvent(void 0, seal).verifySignature(false))\n      throw new Error(\"GiftSeal signature verification failed!\");\n    const rumorSender = new NDKUser({ pubkey: seal.pubkey });\n    const rumor = JSON.parse(await signer.decrypt(rumorSender, seal.content, scheme));\n    if (!rumor) throw new Error(\"Failed to decrypt seal\");\n    if (rumor.pubkey !== _sender.pubkey) throw new Error(\"Invalid GiftWrap, sender validation failed!\");\n    return new NDKEvent(event.ndk, rumor);\n  } catch (_e) {\n    return Promise.reject(\"Got error unwrapping event! See console log.\");\n  }\n}\nfunction getRumorEvent(event, kind) {\n  const rumor = event.rawEvent();\n  rumor.kind = kind || rumor.kind || 14 /* PrivateDirectMessage */;\n  rumor.sig = void 0;\n  rumor.id = getEventHash2(rumor);\n  return new NDKEvent(event.ndk, rumor);\n}\nasync function getSealEvent(rumor, recipient, signer, scheme = \"nip44\") {\n  const seal = new NDKEvent(rumor.ndk);\n  seal.kind = 13 /* GiftWrapSeal */;\n  seal.created_at = approximateNow(5);\n  seal.content = JSON.stringify(rumor.rawEvent());\n  await seal.encrypt(recipient, signer, scheme);\n  await seal.sign(signer);\n  return seal;\n}\nasync function getWrapEvent(sealed, recipient, params, scheme = \"nip44\") {\n  const signer = NDKPrivateKeySigner.generate();\n  const wrap = new NDKEvent(sealed.ndk);\n  wrap.kind = 1059 /* GiftWrap */;\n  wrap.created_at = approximateNow(5);\n  if (params?.wrapTags) wrap.tags = params.wrapTags;\n  wrap.tag(recipient);\n  wrap.content = JSON.stringify(sealed.rawEvent());\n  await wrap.encrypt(recipient, signer, scheme);\n  await wrap.sign(signer);\n  return wrap;\n}\nfunction approximateNow(drift = 0) {\n  return Math.round(Date.now() / 1e3 - Math.random() * 10 ** drift);\n}\n\n// src/events/kinds/simple-group/index.ts\nvar NDKSimpleGroup = class _NDKSimpleGroup {\n  ndk;\n  groupId;\n  relaySet;\n  fetchingMetadata;\n  metadata;\n  memberList;\n  adminList;\n  constructor(ndk, relaySet, groupId) {\n    this.ndk = ndk;\n    this.groupId = groupId ?? randomId(24);\n    this.relaySet = relaySet;\n  }\n  get id() {\n    return this.groupId;\n  }\n  relayUrls() {\n    return this.relaySet?.relayUrls;\n  }\n  get name() {\n    return this.metadata?.name;\n  }\n  get about() {\n    return this.metadata?.about;\n  }\n  get picture() {\n    return this.metadata?.picture;\n  }\n  get members() {\n    return this.memberList?.members ?? [];\n  }\n  get admins() {\n    return this.adminList?.members ?? [];\n  }\n  async getMetadata() {\n    await this.ensureMetadataEvent();\n    return this.metadata;\n  }\n  /**\n   * Creates the group by publishing a kind:9007 event.\n   * @param signer\n   * @returns\n   */\n  async createGroup(signer) {\n    signer ??= this.ndk.signer;\n    if (!signer) throw new Error(\"No signer available\");\n    const user = await signer.user();\n    if (!user) throw new Error(\"No user available\");\n    const event = new NDKEvent(this.ndk);\n    event.kind = 9007 /* GroupAdminCreateGroup */;\n    event.tags.push([\"h\", this.groupId]);\n    await event.sign(signer);\n    return event.publish(this.relaySet);\n  }\n  async setMetadata({ name, about, picture }) {\n    const event = new NDKEvent(this.ndk);\n    event.kind = 9002 /* GroupAdminEditMetadata */;\n    event.tags.push([\"h\", this.groupId]);\n    if (name) event.tags.push([\"name\", name]);\n    if (about) event.tags.push([\"about\", about]);\n    if (picture) event.tags.push([\"picture\", picture]);\n    await event.sign();\n    return event.publish(this.relaySet);\n  }\n  /**\n   * Adds a user to the group using a kind:9000 event\n   * @param user user to add\n   * @param opts options\n   */\n  async addUser(user) {\n    const addUserEvent = _NDKSimpleGroup.generateAddUserEvent(user.pubkey, this.groupId);\n    addUserEvent.ndk = this.ndk;\n    return addUserEvent;\n  }\n  async getMemberListEvent() {\n    const memberList = await this.ndk.fetchEvent(\n      {\n        kinds: [39002 /* GroupMembers */],\n        \"#d\": [this.groupId]\n      },\n      void 0,\n      this.relaySet\n    );\n    if (!memberList) return null;\n    return NDKSimpleGroupMemberList.from(memberList);\n  }\n  /**\n   * Gets a list of users that belong to this group\n   */\n  async getMembers() {\n    const members = [];\n    const memberPubkeys = /* @__PURE__ */ new Set();\n    const memberListEvent = await this.getMemberListEvent();\n    if (!memberListEvent) return [];\n    for (const pTag of memberListEvent.getMatchingTags(\"p\")) {\n      const pubkey = pTag[1];\n      if (memberPubkeys.has(pubkey)) continue;\n      memberPubkeys.add(pubkey);\n      try {\n        members.push(this.ndk.getUser({ pubkey }));\n      } catch {\n      }\n    }\n    return members;\n  }\n  /**\n   * Generates an event that lists the members of a group.\n   * @param groupId\n   * @returns\n   */\n  static generateUserListEvent(groupId) {\n    const event = new NDKEvent(void 0, {\n      kind: 39002 /* GroupMembers */,\n      tags: [\n        [\"h\", groupId],\n        [\"alt\", \"Group Member List\"]\n      ]\n    });\n    return event;\n  }\n  /**\n   * Generates an event that adds a user to a group.\n   * @param userPubkey pubkey of the user to add\n   * @param groupId group to add the user to\n   * @returns\n   */\n  static generateAddUserEvent(userPubkey, groupId) {\n    const event = new NDKEvent(void 0, {\n      kind: 9e3 /* GroupAdminAddUser */,\n      tags: [[\"h\", groupId]]\n    });\n    event.tags.push([\"p\", userPubkey]);\n    return event;\n  }\n  async requestToJoin(_pubkey, content) {\n    const event = new NDKEvent(this.ndk, {\n      kind: 9021 /* GroupAdminRequestJoin */,\n      content: content ?? \"\",\n      tags: [[\"h\", this.groupId]]\n    });\n    return event.publish(this.relaySet);\n  }\n  /**\n   * Makes sure that a metadata event exists locally\n   */\n  async ensureMetadataEvent() {\n    if (this.metadata) return;\n    if (this.fetchingMetadata) return this.fetchingMetadata;\n    this.fetchingMetadata = this.ndk.fetchEvent(\n      {\n        kinds: [39e3 /* GroupMetadata */],\n        \"#d\": [this.groupId]\n      },\n      void 0,\n      this.relaySet\n    ).then((event) => {\n      if (event) {\n        this.metadata = NDKSimpleGroupMetadata.from(event);\n      } else {\n        this.metadata = new NDKSimpleGroupMetadata(this.ndk);\n        this.metadata.dTag = this.groupId;\n      }\n    }).finally(() => {\n      this.fetchingMetadata = void 0;\n    }).catch(() => {\n      throw new Error(`Failed to fetch metadata for group ${this.groupId}`);\n    });\n    return this.fetchingMetadata;\n  }\n};\nfunction randomId(length) {\n  const chars = \"ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz0123456789\";\n  const charsLength = chars.length;\n  let result = \"\";\n  for (let i = 0; i < length; i++) {\n    result += chars.charAt(Math.floor(Math.random() * charsLength));\n  }\n  return result;\n}\n\n// src/app-settings/index.ts\nvar NDKAppSettings = class _NDKAppSettings extends NDKEvent {\n  appName;\n  settings = {};\n  constructor(ndk, rawEvent) {\n    super(ndk, rawEvent);\n    this.kind ??= 30078 /* AppSpecificData */;\n    this.dTag ??= this.appName;\n    if (this.content.length > 0) {\n      try {\n        this.settings = JSON.parse(this.content);\n      } catch (error) {\n        console.error(\"Error parsing app settings\", error);\n      }\n    }\n  }\n  static from(event) {\n    return new _NDKAppSettings(event.ndk, event);\n  }\n  /**\n   * Set a value for a given key.\n   *\n   * @param key\n   * @param value\n   */\n  set(key, value) {\n    this.settings[key] = value;\n  }\n  /**\n   * Get a value for a given key.\n   *\n   * @param key\n   * @returns\n   */\n  get(key) {\n    return this.settings[key];\n  }\n  async publishReplaceable(relaySet, timeoutMs, requiredRelayCount) {\n    this.content = JSON.stringify(this.settings);\n    return super.publishReplaceable(relaySet, timeoutMs, requiredRelayCount);\n  }\n};\n\n// src/relay/auth-policies.ts\nimport createDebug2 from \"debug\";\nfunction disconnect(pool, debug8) {\n  debug8 ??= createDebug2(\"ndk:relay:auth-policies:disconnect\");\n  return async (relay) => {\n    debug8?.(`Relay ${relay.url} requested authentication, disconnecting`);\n    pool.removeRelay(relay.url);\n  };\n}\nasync function signAndAuth(event, relay, signer, debug8, resolve, reject) {\n  try {\n    await event.sign(signer);\n    resolve(event);\n  } catch (e) {\n    debug8?.(`Failed to publish auth event to relay ${relay.url}`, e);\n    reject(event);\n  }\n}\nfunction signIn({ ndk, signer, debug: debug8 } = {}) {\n  debug8 ??= createDebug2(\"ndk:auth-policies:signIn\");\n  return async (relay, challenge) => {\n    debug8?.(`Relay ${relay.url} requested authentication, signing in`);\n    const event = new NDKEvent(ndk);\n    event.kind = 22242 /* ClientAuth */;\n    event.tags = [\n      [\"relay\", relay.url],\n      [\"challenge\", challenge]\n    ];\n    signer ??= ndk?.signer;\n    return new Promise(async (resolve, reject) => {\n      if (signer) {\n        await signAndAuth(event, relay, signer, debug8, resolve, reject);\n      } else {\n        ndk?.once(\"signer:ready\", async (signer2) => {\n          await signAndAuth(event, relay, signer2, debug8, resolve, reject);\n        });\n      }\n    });\n  };\n}\nvar NDKRelayAuthPolicies = {\n  disconnect,\n  signIn\n};\n\n// src/signers/nip07/index.ts\nimport debug5 from \"debug\";\nvar NDKNip07Signer = class _NDKNip07Signer {\n  _userPromise;\n  encryptionQueue = [];\n  encryptionProcessing = false;\n  debug;\n  waitTimeout;\n  _pubkey;\n  ndk;\n  _user;\n  /**\n   * @param waitTimeout - The timeout in milliseconds to wait for the NIP-07 to become available\n   */\n  constructor(waitTimeout = 1e3, ndk) {\n    this.debug = debug5(\"ndk:nip07\");\n    this.waitTimeout = waitTimeout;\n    this.ndk = ndk;\n  }\n  get pubkey() {\n    if (!this._pubkey) throw new Error(\"Not ready\");\n    return this._pubkey;\n  }\n  async blockUntilReady() {\n    await this.waitForExtension();\n    const pubkey = await window.nostr?.getPublicKey();\n    if (!pubkey) {\n      throw new Error(\"User rejected access\");\n    }\n    this._pubkey = pubkey;\n    let user;\n    if (this.ndk) user = this.ndk.getUser({ pubkey });\n    else user = new NDKUser({ pubkey });\n    this._user = user;\n    return user;\n  }\n  /**\n   * Getter for the user property.\n   * @returns The NDKUser instance.\n   */\n  async user() {\n    if (!this._userPromise) {\n      this._userPromise = this.blockUntilReady();\n    }\n    return this._userPromise;\n  }\n  get userSync() {\n    if (!this._user) throw new Error(\"User not ready\");\n    return this._user;\n  }\n  /**\n   * Signs the given Nostr event.\n   * @param event - The Nostr event to be signed.\n   * @returns The signature of the signed event.\n   * @throws Error if the NIP-07 is not available on the window object.\n   */\n  async sign(event) {\n    await this.waitForExtension();\n    const signedEvent = await window.nostr?.signEvent(event);\n    if (!signedEvent) throw new Error(\"Failed to sign event\");\n    return signedEvent.sig;\n  }\n  async relays(ndk) {\n    await this.waitForExtension();\n    const relays = await window.nostr?.getRelays?.() || {};\n    const activeRelays = [];\n    for (const url of Object.keys(relays)) {\n      if (relays[url].read && relays[url].write) {\n        activeRelays.push(url);\n      }\n    }\n    return activeRelays.map((url) => new NDKRelay(url, ndk?.relayAuthDefaultPolicy, ndk));\n  }\n  async encryptionEnabled(nip) {\n    const enabled = [];\n    if ((!nip || nip === \"nip04\") && Boolean(window.nostr?.nip04)) enabled.push(\"nip04\");\n    if ((!nip || nip === \"nip44\") && Boolean(window.nostr?.nip44)) enabled.push(\"nip44\");\n    return enabled;\n  }\n  async encrypt(recipient, value, nip = \"nip04\") {\n    if (!await this.encryptionEnabled(nip))\n      throw new Error(`${nip}encryption is not available from your browser extension`);\n    await this.waitForExtension();\n    const recipientHexPubKey = recipient.pubkey;\n    return this.queueEncryption(nip, \"encrypt\", recipientHexPubKey, value);\n  }\n  async decrypt(sender, value, nip = \"nip04\") {\n    if (!await this.encryptionEnabled(nip))\n      throw new Error(`${nip}encryption is not available from your browser extension`);\n    await this.waitForExtension();\n    const senderHexPubKey = sender.pubkey;\n    return this.queueEncryption(nip, \"decrypt\", senderHexPubKey, value);\n  }\n  async queueEncryption(scheme, method, counterpartyHexpubkey, value) {\n    return new Promise((resolve, reject) => {\n      this.encryptionQueue.push({\n        scheme,\n        method,\n        counterpartyHexpubkey,\n        value,\n        resolve,\n        reject\n      });\n      if (!this.encryptionProcessing) {\n        this.processEncryptionQueue();\n      }\n    });\n  }\n  async processEncryptionQueue(item, retries = 0) {\n    if (!item && this.encryptionQueue.length === 0) {\n      this.encryptionProcessing = false;\n      return;\n    }\n    this.encryptionProcessing = true;\n    const currentItem = item || this.encryptionQueue.shift();\n    if (!currentItem) {\n      this.encryptionProcessing = false;\n      return;\n    }\n    const { scheme, method, counterpartyHexpubkey, value, resolve, reject } = currentItem;\n    this.debug(\"Processing encryption queue item\", {\n      method,\n      counterpartyHexpubkey,\n      value\n    });\n    try {\n      const result = await window.nostr?.[scheme]?.[method](counterpartyHexpubkey, value);\n      if (!result) throw new Error(\"Failed to encrypt/decrypt\");\n      resolve(result);\n    } catch (error) {\n      const errorMessage = error instanceof Error ? error.message : String(error);\n      if (errorMessage.includes(\"call already executing\") && retries < 5) {\n        this.debug(\"Retrying encryption queue item\", {\n          method,\n          counterpartyHexpubkey,\n          value,\n          retries\n        });\n        setTimeout(() => {\n          this.processEncryptionQueue(currentItem, retries + 1);\n        }, 50 * retries);\n        return;\n      }\n      reject(error instanceof Error ? error : new Error(errorMessage));\n    }\n    this.processEncryptionQueue();\n  }\n  waitForExtension() {\n    return new Promise((resolve, reject) => {\n      if (window.nostr) {\n        resolve();\n        return;\n      }\n      let timerId;\n      const intervalId = setInterval(() => {\n        if (window.nostr) {\n          clearTimeout(timerId);\n          clearInterval(intervalId);\n          resolve();\n        }\n      }, 100);\n      timerId = setTimeout(() => {\n        clearInterval(intervalId);\n        reject(new Error(\"NIP-07 extension not available\"));\n      }, this.waitTimeout);\n    });\n  }\n  /**\n   * Serializes the signer type into a storable format.\n   * NIP-07 signers don't have persistent state to serialize beyond their type.\n   * @returns A JSON string containing the type.\n   */\n  toPayload() {\n    const payload = {\n      type: \"nip07\",\n      payload: \"\"\n      // No specific payload needed for NIP-07\n    };\n    return JSON.stringify(payload);\n  }\n  /**\n   * Deserializes the signer from a payload string.\n   * Creates a new NDKNip07Signer instance.\n   * @param payloadString The JSON string obtained from toPayload().\n   * @param ndk Optional NDK instance.\n   * @returns An instance of NDKNip07Signer.\n   */\n  static async fromPayload(payloadString, ndk) {\n    const payload = JSON.parse(payloadString);\n    if (payload.type !== \"nip07\") {\n      throw new Error(`Invalid payload type: expected 'nip07', got ${payload.type}`);\n    }\n    return new _NDKNip07Signer(void 0, ndk);\n  }\n};\n\n// src/signers/nip46/backend/index.ts\nimport { hexToBytes as hexToBytes2 } from \"@noble/hashes/utils\";\n\n// src/signers/nip46/rpc.ts\nimport { EventEmitter as EventEmitter5 } from \"tseep\";\nvar NDKNostrRpc = class extends EventEmitter5 {\n  ndk;\n  signer;\n  relaySet;\n  debug;\n  encryptionType = \"nip04\";\n  pool;\n  constructor(ndk, signer, debug8, relayUrls) {\n    super();\n    this.ndk = ndk;\n    this.signer = signer;\n    if (relayUrls) {\n      this.pool = new NDKPool(relayUrls, [], ndk, {\n        debug: debug8.extend(\"rpc-pool\"),\n        name: \"Nostr RPC\"\n      });\n      this.relaySet = new NDKRelaySet(/* @__PURE__ */ new Set(), ndk, this.pool);\n      for (const url of relayUrls) {\n        const relay = this.pool.getRelay(url, false, false);\n        relay.authPolicy = NDKRelayAuthPolicies.signIn({ ndk, signer, debug: debug8 });\n        this.relaySet.addRelay(relay);\n        relay.connect();\n      }\n    }\n    this.debug = debug8.extend(\"rpc\");\n  }\n  /**\n   * Subscribe to a filter. This function will resolve once the subscription is ready.\n   */\n  subscribe(filter) {\n    const sub = this.ndk.subscribe(\n      filter,\n      {\n        closeOnEose: false,\n        groupable: false,\n        cacheUsage: \"ONLY_RELAY\" /* ONLY_RELAY */,\n        pool: this.pool,\n        relaySet: this.relaySet\n      },\n      false\n    );\n    sub.on(\"event\", async (event) => {\n      try {\n        const parsedEvent = await this.parseEvent(event);\n        if (parsedEvent.method) {\n          this.emit(\"request\", parsedEvent);\n        } else {\n          this.emit(`response-${parsedEvent.id}`, parsedEvent);\n        }\n      } catch (e) {\n        this.debug(\"error parsing event\", e, event.rawEvent());\n      }\n    });\n    return new Promise((resolve) => {\n      sub.on(\"eose\", () => {\n        this.debug(\"eosed\");\n        resolve(sub);\n      });\n      sub.start();\n    });\n  }\n  async parseEvent(event) {\n    if (this.encryptionType === \"nip44\" && event.content.includes(\"?iv=\")) {\n      this.encryptionType = \"nip04\";\n    } else if (this.encryptionType === \"nip04\" && !event.content.includes(\"?iv=\")) {\n      this.encryptionType = \"nip44\";\n    }\n    const remoteUser = this.ndk.getUser({ pubkey: event.pubkey });\n    remoteUser.ndk = this.ndk;\n    let decryptedContent;\n    try {\n      decryptedContent = await this.signer.decrypt(remoteUser, event.content, this.encryptionType);\n    } catch (_e) {\n      const otherEncryptionType = this.encryptionType === \"nip04\" ? \"nip44\" : \"nip04\";\n      decryptedContent = await this.signer.decrypt(remoteUser, event.content, otherEncryptionType);\n      this.encryptionType = otherEncryptionType;\n    }\n    const parsedContent = JSON.parse(decryptedContent);\n    const { id, method, params, result, error } = parsedContent;\n    if (method) {\n      return { id, pubkey: event.pubkey, method, params, event };\n    }\n    return { id, result, error, event };\n  }\n  async sendResponse(id, remotePubkey, result, kind = 24133 /* NostrConnect */, error) {\n    const res = { id, result };\n    if (error) {\n      res.error = error;\n    }\n    const localUser = await this.signer.user();\n    const remoteUser = this.ndk.getUser({ pubkey: remotePubkey });\n    const event = new NDKEvent(this.ndk, {\n      kind,\n      content: JSON.stringify(res),\n      tags: [[\"p\", remotePubkey]],\n      pubkey: localUser.pubkey\n    });\n    event.content = await this.signer.encrypt(remoteUser, event.content, this.encryptionType);\n    await event.sign(this.signer);\n    await event.publish(this.relaySet);\n  }\n  /**\n   * Sends a request.\n   * @param remotePubkey\n   * @param method\n   * @param params\n   * @param kind\n   * @param id\n   */\n  async sendRequest(remotePubkey, method, params = [], kind = 24133, cb) {\n    const id = Math.random().toString(36).substring(7);\n    const localUser = await this.signer.user();\n    const remoteUser = this.ndk.getUser({ pubkey: remotePubkey });\n    const request = { id, method, params };\n    const promise = new Promise(() => {\n      const responseHandler = (response) => {\n        if (response.result === \"auth_url\") {\n          this.once(`response-${id}`, responseHandler);\n          this.emit(\"authUrl\", response.error);\n        } else if (cb) {\n          cb(response);\n        }\n      };\n      this.once(`response-${id}`, responseHandler);\n    });\n    const event = new NDKEvent(this.ndk, {\n      kind,\n      content: JSON.stringify(request),\n      tags: [[\"p\", remotePubkey]],\n      pubkey: localUser.pubkey\n    });\n    event.content = await this.signer.encrypt(remoteUser, event.content, this.encryptionType);\n    await event.sign(this.signer);\n    await event.publish(this.relaySet);\n    return promise;\n  }\n};\n\n// src/signers/nip46/backend/connect.ts\nvar ConnectEventHandlingStrategy = class {\n  async handle(backend, id, remotePubkey, params) {\n    const [_, token] = params;\n    const debug8 = backend.debug.extend(\"connect\");\n    debug8(`connection request from ${remotePubkey}`);\n    if (token && backend.applyToken) {\n      debug8(\"applying token\");\n      await backend.applyToken(remotePubkey, token);\n    }\n    if (await backend.pubkeyAllowed({\n      id,\n      pubkey: remotePubkey,\n      method: \"connect\",\n      params: token\n    })) {\n      debug8(`connection request from ${remotePubkey} allowed`);\n      return \"ack\";\n    }\n    debug8(`connection request from ${remotePubkey} rejected`);\n    return void 0;\n  }\n};\n\n// src/signers/nip46/backend/get-public-key.ts\nvar GetPublicKeyHandlingStrategy = class {\n  async handle(backend, _id, _remotePubkey, _params) {\n    return backend.localUser?.pubkey;\n  }\n};\n\n// src/signers/nip46/backend/nip04-decrypt.ts\nvar Nip04DecryptHandlingStrategy = class {\n  async handle(backend, id, remotePubkey, params) {\n    const [senderPubkey, payload] = params;\n    const senderUser = new NDKUser({ pubkey: senderPubkey });\n    const decryptedPayload = await decrypt2(backend, id, remotePubkey, senderUser, payload);\n    return decryptedPayload;\n  }\n};\nasync function decrypt2(backend, id, remotePubkey, senderUser, payload) {\n  if (!await backend.pubkeyAllowed({\n    id,\n    pubkey: remotePubkey,\n    method: \"nip04_decrypt\",\n    params: payload\n  })) {\n    backend.debug(`decrypt request from ${remotePubkey} rejected`);\n    return void 0;\n  }\n  return await backend.signer.decrypt(senderUser, payload, \"nip04\");\n}\n\n// src/signers/nip46/backend/nip04-encrypt.ts\nvar Nip04EncryptHandlingStrategy = class {\n  async handle(backend, id, remotePubkey, params) {\n    const [recipientPubkey, payload] = params;\n    const recipientUser = new NDKUser({ pubkey: recipientPubkey });\n    const encryptedPayload = await encrypt2(backend, id, remotePubkey, recipientUser, payload);\n    return encryptedPayload;\n  }\n};\nasync function encrypt2(backend, id, remotePubkey, recipientUser, payload) {\n  if (!await backend.pubkeyAllowed({\n    id,\n    pubkey: remotePubkey,\n    method: \"nip04_encrypt\",\n    params: payload\n  })) {\n    backend.debug(`encrypt request from ${remotePubkey} rejected`);\n    return void 0;\n  }\n  return await backend.signer.encrypt(recipientUser, payload, \"nip04\");\n}\n\n// src/signers/nip46/backend/nip44-decrypt.ts\nvar Nip04DecryptHandlingStrategy2 = class {\n  async handle(backend, id, remotePubkey, params) {\n    const [senderPubkey, payload] = params;\n    const senderUser = new NDKUser({ pubkey: senderPubkey });\n    const decryptedPayload = await decrypt3(backend, id, remotePubkey, senderUser, payload);\n    return decryptedPayload;\n  }\n};\nasync function decrypt3(backend, id, remotePubkey, senderUser, payload) {\n  if (!await backend.pubkeyAllowed({\n    id,\n    pubkey: remotePubkey,\n    method: \"nip44_decrypt\",\n    params: payload\n  })) {\n    backend.debug(`decrypt request from ${remotePubkey} rejected`);\n    return void 0;\n  }\n  return await backend.signer.decrypt(senderUser, payload, \"nip44\");\n}\n\n// src/signers/nip46/backend/nip44-encrypt.ts\nvar Nip04EncryptHandlingStrategy2 = class {\n  async handle(backend, id, remotePubkey, params) {\n    const [recipientPubkey, payload] = params;\n    const recipientUser = new NDKUser({ pubkey: recipientPubkey });\n    const encryptedPayload = await encrypt3(backend, id, remotePubkey, recipientUser, payload);\n    return encryptedPayload;\n  }\n};\nasync function encrypt3(backend, id, remotePubkey, recipientUser, payload) {\n  if (!await backend.pubkeyAllowed({\n    id,\n    pubkey: remotePubkey,\n    method: \"nip44_encrypt\",\n    params: payload\n  })) {\n    backend.debug(`encrypt request from ${remotePubkey} rejected`);\n    return void 0;\n  }\n  return await backend.signer.encrypt(recipientUser, payload, \"nip44\");\n}\n\n// src/signers/nip46/backend/ping.ts\nvar PingEventHandlingStrategy = class {\n  async handle(backend, id, remotePubkey, _params) {\n    const debug8 = backend.debug.extend(\"ping\");\n    debug8(`ping request from ${remotePubkey}`);\n    if (await backend.pubkeyAllowed({ id, pubkey: remotePubkey, method: \"ping\" })) {\n      debug8(`connection request from ${remotePubkey} allowed`);\n      return \"pong\";\n    }\n    debug8(`connection request from ${remotePubkey} rejected`);\n    return void 0;\n  }\n};\n\n// src/signers/nip46/backend/sign-event.ts\nvar SignEventHandlingStrategy = class {\n  async handle(backend, id, remotePubkey, params) {\n    const event = await signEvent(backend, id, remotePubkey, params);\n    if (!event) return void 0;\n    return JSON.stringify(await event.toNostrEvent());\n  }\n};\nasync function signEvent(backend, id, remotePubkey, params) {\n  const [eventString] = params;\n  backend.debug(`sign event request from ${remotePubkey}`);\n  const event = new NDKEvent(backend.ndk, JSON.parse(eventString));\n  backend.debug(\"event to sign\", event.rawEvent());\n  if (!await backend.pubkeyAllowed({\n    id,\n    pubkey: remotePubkey,\n    method: \"sign_event\",\n    params: event\n  })) {\n    backend.debug(`sign event request from ${remotePubkey} rejected`);\n    return void 0;\n  }\n  backend.debug(`sign event request from ${remotePubkey} allowed`);\n  await event.sign(backend.signer);\n  return event;\n}\n\n// src/signers/nip46/backend/index.ts\nvar NDKNip46Backend = class {\n  ndk;\n  signer;\n  localUser;\n  debug;\n  rpc;\n  permitCallback;\n  relayUrls;\n  /**\n   * @param ndk The NDK instance to use\n   * @param privateKeyOrSigner The private key or signer of the npub that wants to be published as\n   * @param permitCallback Callback executed when permission is requested\n   */\n  constructor(ndk, privateKeyOrSigner, permitCallback, relayUrls) {\n    this.ndk = ndk;\n    if (privateKeyOrSigner instanceof Uint8Array) {\n      this.signer = new NDKPrivateKeySigner(privateKeyOrSigner);\n    } else if (privateKeyOrSigner instanceof String) {\n      this.signer = new NDKPrivateKeySigner(hexToBytes2(privateKeyOrSigner));\n    } else if (privateKeyOrSigner instanceof NDKPrivateKeySigner) {\n      this.signer = privateKeyOrSigner;\n    } else {\n      throw new Error(\"Invalid signer\");\n    }\n    this.debug = ndk.debug.extend(\"nip46:backend\");\n    this.relayUrls = relayUrls ?? Array.from(ndk.pool.relays.keys());\n    this.rpc = new NDKNostrRpc(ndk, this.signer, this.debug, this.relayUrls);\n    this.permitCallback = permitCallback;\n  }\n  /**\n   * This method starts the backend, which will start listening for incoming\n   * requests.\n   */\n  async start() {\n    this.localUser = await this.signer.user();\n    const sub = this.ndk.subscribe(\n      {\n        kinds: [24133],\n        \"#p\": [this.localUser.pubkey]\n      },\n      { closeOnEose: false }\n    );\n    sub.on(\"event\", (e) => this.handleIncomingEvent(e));\n  }\n  handlers = {\n    connect: new ConnectEventHandlingStrategy(),\n    sign_event: new SignEventHandlingStrategy(),\n    nip04_encrypt: new Nip04EncryptHandlingStrategy(),\n    nip04_decrypt: new Nip04DecryptHandlingStrategy(),\n    nip44_encrypt: new Nip04EncryptHandlingStrategy2(),\n    nip44_decrypt: new Nip04DecryptHandlingStrategy2(),\n    get_public_key: new GetPublicKeyHandlingStrategy(),\n    ping: new PingEventHandlingStrategy()\n  };\n  /**\n   * Enables the user to set a custom strategy for handling incoming events.\n   * @param method - The method to set the strategy for\n   * @param strategy - The strategy to set\n   */\n  setStrategy(method, strategy) {\n    this.handlers[method] = strategy;\n  }\n  /**\n   * Overload this method to apply tokens, which can\n   * wrap permission sets to be applied to a pubkey.\n   * @param pubkey public key to apply token to\n   * @param token token to apply\n   */\n  async applyToken(_pubkey, _token) {\n    throw new Error(\"connection token not supported\");\n  }\n  async handleIncomingEvent(event) {\n    const { id, method, params } = await this.rpc.parseEvent(event);\n    const remotePubkey = event.pubkey;\n    let response;\n    this.debug(\"incoming event\", { id, method, params });\n    if (!event.verifySignature(false)) {\n      this.debug(\"invalid signature\", event.rawEvent());\n      return;\n    }\n    const strategy = this.handlers[method];\n    if (strategy) {\n      try {\n        response = await strategy.handle(this, id, remotePubkey, params);\n      } catch (e) {\n        this.debug(\"error handling event\", e, { id, method, params });\n        this.rpc.sendResponse(id, remotePubkey, \"error\", void 0, e.message);\n      }\n    } else {\n      this.debug(\"unsupported method\", { method, params });\n    }\n    if (response) {\n      this.debug(`sending response to ${remotePubkey}`, response);\n      this.rpc.sendResponse(id, remotePubkey, response);\n    } else {\n      this.rpc.sendResponse(id, remotePubkey, \"error\", void 0, \"Not authorized\");\n    }\n  }\n  /**\n   * This method should be overriden by the user to allow or reject incoming\n   * connections.\n   */\n  async pubkeyAllowed(params) {\n    return this.permitCallback(params);\n  }\n};\n\n// src/signers/nip46/index.ts\nimport { EventEmitter as EventEmitter6 } from \"tseep\";\n\n// src/signers/deserialization.ts\nvar signerRegistry = /* @__PURE__ */ new Map();\nsignerRegistry.set(\"private-key\", NDKPrivateKeySigner);\nsignerRegistry.set(\"nip07\", NDKNip07Signer);\nsignerRegistry.set(\"nip46\", NDKNip46Signer);\nasync function ndkSignerFromPayload(payloadString, ndk) {\n  let parsed;\n  try {\n    parsed = JSON.parse(payloadString);\n  } catch (e) {\n    throw new Error(`Failed to parse signer payload: ${e instanceof Error ? e.message : String(e)}`);\n  }\n  const SignerClass = signerRegistry.get(parsed.type);\n  if (!SignerClass) {\n    throw new Error(`Unknown signer type: ${parsed.type}`);\n  }\n  try {\n    return await SignerClass.fromPayload(payloadString, ndk);\n  } catch (e) {\n    const errorMsg = e instanceof Error ? e.message : String(e);\n    throw new Error(`Failed to deserialize signer type ${parsed.type}: ${errorMsg}`);\n  }\n}\n\n// src/signers/nip46/index.ts\nvar NDKNip46Signer = class _NDKNip46Signer extends EventEmitter6 {\n  ndk;\n  _user;\n  /**\n   * The pubkey of the bunker that will be providing signatures\n   */\n  bunkerPubkey;\n  /**\n   * The pubkey of the user that events will be published as\n   */\n  userPubkey;\n  get pubkey() {\n    if (!this.userPubkey) throw new Error(\"Not ready\");\n    return this.userPubkey;\n  }\n  /**\n   * An optional secret value provided to connect to the bunker\n   */\n  secret;\n  localSigner;\n  nip05;\n  rpc;\n  debug;\n  relayUrls;\n  subscription;\n  /**\n   * @param ndk - The NDK instance to use\n   * @param userOrConnectionToken - The public key, or a connection token, of the npub that wants to be published as\n   * @param localSigner - The signer that will be used to request events to be signed\n   */\n  constructor(ndk, userOrConnectionToken, localSigner) {\n    super();\n    this.ndk = ndk;\n    this.debug = ndk.debug.extend(\"nip46:signer\");\n    if (userOrConnectionToken.startsWith(\"bunker://\")) {\n      this.connectionTokenInit(userOrConnectionToken);\n    } else {\n      this.nip05Init(userOrConnectionToken);\n    }\n    if (!localSigner) {\n      this.localSigner = NDKPrivateKeySigner.generate();\n    } else {\n      this.localSigner = localSigner;\n    }\n    this.rpc = new NDKNostrRpc(this.ndk, this.localSigner, this.debug, this.relayUrls);\n  }\n  connectionTokenInit(connectionToken) {\n    const bunkerUrl = new URL(connectionToken);\n    const bunkerPubkey = bunkerUrl.hostname || bunkerUrl.pathname.replace(/^\\/\\//, \"\");\n    const userPubkey = bunkerUrl.searchParams.get(\"pubkey\");\n    const relayUrls = bunkerUrl.searchParams.getAll(\"relay\");\n    const secret = bunkerUrl.searchParams.get(\"secret\");\n    this.bunkerPubkey = bunkerPubkey;\n    this.userPubkey = userPubkey;\n    this.relayUrls = relayUrls;\n    this.secret = secret;\n  }\n  nip05Init(nip05) {\n    this.nip05 = nip05;\n  }\n  /**\n   * We start listening for events from the bunker\n   */\n  async startListening() {\n    if (this.subscription) return;\n    const localUser = await this.localSigner.user();\n    if (!localUser) throw new Error(\"Local signer not ready\");\n    this.subscription = await this.rpc.subscribe({\n      kinds: [24133 /* NostrConnect */],\n      \"#p\": [localUser.pubkey]\n    });\n  }\n  /**\n   * Get the user that is being published as\n   */\n  async user() {\n    if (this._user) return this._user;\n    return this.blockUntilReady();\n  }\n  get userSync() {\n    if (!this._user) throw new Error(\"Remote user not ready synchronously\");\n    return this._user;\n  }\n  async blockUntilReady() {\n    if (this.nip05 && !this.userPubkey) {\n      const user = await NDKUser.fromNip05(this.nip05, this.ndk);\n      if (user) {\n        this._user = user;\n        this.userPubkey = user.pubkey;\n        this.relayUrls = user.nip46Urls;\n        this.rpc = new NDKNostrRpc(this.ndk, this.localSigner, this.debug, this.relayUrls);\n      }\n    }\n    if (!this.bunkerPubkey && this.userPubkey) {\n      this.bunkerPubkey = this.userPubkey;\n    } else if (!this.bunkerPubkey) {\n      throw new Error(\"Bunker pubkey not set\");\n    }\n    await this.startListening();\n    this.rpc.on(\"authUrl\", (...props) => {\n      this.emit(\"authUrl\", ...props);\n    });\n    return new Promise((resolve, reject) => {\n      const connectParams = [this.userPubkey ?? \"\"];\n      if (this.secret) connectParams.push(this.secret);\n      if (!this.bunkerPubkey) throw new Error(\"Bunker pubkey not set\");\n      this.rpc.sendRequest(this.bunkerPubkey, \"connect\", connectParams, 24133, (response) => {\n        if (response.result === \"ack\") {\n          this.getPublicKey().then((pubkey) => {\n            this.userPubkey = pubkey;\n            this._user = this.ndk.getUser({ pubkey });\n            resolve(this._user);\n          });\n        } else {\n          reject(response.error);\n        }\n      });\n    });\n  }\n  async getPublicKey() {\n    if (this.userPubkey) return this.userPubkey;\n    return new Promise((resolve, _reject) => {\n      if (!this.bunkerPubkey) throw new Error(\"Bunker pubkey not set\");\n      this.rpc.sendRequest(this.bunkerPubkey, \"get_public_key\", [], 24133, (response) => {\n        resolve(response.result);\n      });\n    });\n  }\n  async encryptionEnabled(scheme) {\n    if (scheme) return [scheme];\n    return Promise.resolve([\"nip04\", \"nip44\"]);\n  }\n  async encrypt(recipient, value, scheme = \"nip04\") {\n    return this.encryption(recipient, value, scheme, \"encrypt\");\n  }\n  async decrypt(sender, value, scheme = \"nip04\") {\n    return this.encryption(sender, value, scheme, \"decrypt\");\n  }\n  async encryption(peer, value, scheme, method) {\n    const promise = new Promise((resolve, reject) => {\n      if (!this.bunkerPubkey) throw new Error(\"Bunker pubkey not set\");\n      this.rpc.sendRequest(\n        this.bunkerPubkey,\n        `${scheme}_${method}`,\n        [peer.pubkey, value],\n        24133,\n        (response) => {\n          if (!response.error) {\n            resolve(response.result);\n          } else {\n            reject(response.error);\n          }\n        }\n      );\n    });\n    return promise;\n  }\n  async sign(event) {\n    const promise = new Promise((resolve, reject) => {\n      if (!this.bunkerPubkey) throw new Error(\"Bunker pubkey not set\");\n      this.rpc.sendRequest(\n        this.bunkerPubkey,\n        \"sign_event\",\n        [JSON.stringify(event)],\n        24133,\n        (response) => {\n          if (!response.error) {\n            const json = JSON.parse(response.result);\n            resolve(json.sig);\n          } else {\n            reject(response.error);\n          }\n        }\n      );\n    });\n    return promise;\n  }\n  /**\n   * Allows creating a new account on the remote server.\n   * @param username Desired username for the NIP-05\n   * @param domain Desired domain for the NIP-05\n   * @param email Email address to associate with this account -- Remote servers may use this for recovery\n   * @returns The public key of the newly created account\n   */\n  async createAccount(username, domain, email) {\n    await this.startListening();\n    const req = [];\n    if (username) req.push(username);\n    if (domain) req.push(domain);\n    if (email) req.push(email);\n    return new Promise((resolve, reject) => {\n      if (!this.bunkerPubkey) throw new Error(\"Bunker pubkey not set\");\n      this.rpc.sendRequest(\n        this.bunkerPubkey,\n        \"create_account\",\n        req,\n        24133 /* NostrConnect */,\n        (response) => {\n          if (!response.error) {\n            const pubkey = response.result;\n            resolve(pubkey);\n          } else {\n            reject(response.error);\n          }\n        }\n      );\n    });\n  }\n  /**\n   * Serializes the signer's connection details and local signer state.\n   * @returns A JSON string containing the type, connection info, and local signer payload.\n   */\n  toPayload() {\n    if (!this.bunkerPubkey || !this.userPubkey) {\n      throw new Error(\"NIP-46 signer is not fully initialized for serialization\");\n    }\n    const payload = {\n      type: \"nip46\",\n      payload: {\n        bunkerPubkey: this.bunkerPubkey,\n        userPubkey: this.userPubkey,\n        relayUrls: this.relayUrls,\n        secret: this.secret,\n        localSignerPayload: this.localSigner.toPayload(),\n        // Store nip05 if it was used for initialization, otherwise null\n        nip05: this.nip05 || null\n      }\n    };\n    return JSON.stringify(payload);\n  }\n  /**\n   * Deserializes the signer from a payload string.\n   * @param payloadString The JSON string obtained from toPayload().\n   * @param ndk The NDK instance, required for NIP-46.\n   * @returns An instance of NDKNip46Signer.\n   */\n  static async fromPayload(payloadString, ndk) {\n    if (!ndk) {\n      throw new Error(\"NDK instance is required to deserialize NIP-46 signer\");\n    }\n    const parsed = JSON.parse(payloadString);\n    if (parsed.type !== \"nip46\") {\n      throw new Error(`Invalid payload type: expected 'nip46', got ${parsed.type}`);\n    }\n    const payload = parsed.payload;\n    if (!payload || typeof payload !== \"object\" || !payload.localSignerPayload) {\n      throw new Error(\"Invalid payload content for nip46 signer\");\n    }\n    const localSigner = await ndkSignerFromPayload(payload.localSignerPayload, ndk);\n    if (!localSigner) {\n      throw new Error(\"Failed to deserialize local signer for NIP-46\");\n    }\n    let signer;\n    if (payload.nip05) {\n      signer = new _NDKNip46Signer(ndk, payload.nip05, localSigner);\n      signer.userPubkey = payload.userPubkey;\n      signer.bunkerPubkey = payload.bunkerPubkey;\n      signer.relayUrls = payload.relayUrls;\n      signer.secret = payload.secret;\n    } else {\n      signer = new _NDKNip46Signer(ndk, payload.userPubkey, localSigner);\n      signer.bunkerPubkey = payload.bunkerPubkey;\n      signer.relayUrls = payload.relayUrls;\n      signer.secret = payload.secret;\n    }\n    return signer;\n  }\n};\n\n// src/dvm/schedule.ts\nfunction addRelays(event, relays) {\n  const tags = [];\n  if (!relays || relays.length === 0) {\n    const poolRelays = event.ndk?.pool.relays;\n    relays = poolRelays ? Object.keys(poolRelays) : void 0;\n  }\n  if (relays && relays.length > 0) tags.push([\"relays\", ...relays]);\n  return tags;\n}\nasync function dvmSchedule(events, dvm, relays, encrypted = true, waitForConfirmationForMs) {\n  if (!Array.isArray(events)) {\n    events = [events];\n  }\n  const ndk = events[0].ndk;\n  if (!ndk) throw new Error(\"NDK not set\");\n  for (const event of events) {\n    if (!event.sig) throw new Error(\"Event not signed\");\n    if (!event.created_at) throw new Error(\"Event has no date\");\n    if (!dvm) throw new Error(\"No DVM specified\");\n    if (event.created_at <= Date.now() / 1e3) throw new Error(\"Event needs to be in the future\");\n  }\n  const scheduleEvent = new NDKDVMRequest(ndk, {\n    kind: 5905 /* DVMEventSchedule */\n  });\n  for (const event of events) {\n    scheduleEvent.addInput(JSON.stringify(event.rawEvent()), \"text\");\n  }\n  scheduleEvent.tags.push(...addRelays(events[0], relays));\n  if (encrypted) {\n    await scheduleEvent.encryption(dvm);\n  } else {\n    scheduleEvent.dvm = dvm;\n  }\n  await scheduleEvent.sign();\n  let res;\n  if (waitForConfirmationForMs) {\n    res = ndk.subscribe(\n      {\n        kinds: [5905 /* DVMEventSchedule */ + 1e3, 7e3 /* DVMJobFeedback */],\n        ...scheduleEvent.filter()\n      },\n      { groupable: false, closeOnEose: false }\n    );\n  }\n  const timeoutPromise = new Promise((reject) => {\n    setTimeout(() => {\n      res?.stop();\n      reject(\"Timeout waiting for an answer from the DVM\");\n    }, waitForConfirmationForMs);\n  });\n  const schedulePromise = new Promise((resolve, reject) => {\n    if (waitForConfirmationForMs) {\n      res?.on(\"event\", async (e) => {\n        res?.stop();\n        if (e.kind === 7e3 /* DVMJobFeedback */) {\n          const feedback = await NDKDVMJobFeedback.from(e);\n          if (feedback.status === \"error\") {\n            const statusTag = feedback.getMatchingTags(\"status\");\n            reject(statusTag?.[2] ?? feedback);\n          } else {\n            resolve(feedback);\n          }\n        }\n        resolve(e);\n      });\n    }\n    scheduleEvent.publish().then(() => {\n      if (!waitForConfirmationForMs) resolve(void 0);\n    });\n  });\n  return new Promise((resolve, reject) => {\n    if (waitForConfirmationForMs) {\n      Promise.race([timeoutPromise, schedulePromise]).then((e) => {\n        resolve(e);\n      }).catch(reject);\n    } else {\n      schedulePromise.then(resolve);\n    }\n  });\n}\n\n// src/ndk/index.ts\nimport debug7 from \"debug\";\nimport { EventEmitter as EventEmitter8 } from \"tseep\";\n\n// src/events/dedup.ts\nfunction dedup(event1, event2) {\n  if (event1.created_at > event2.created_at) {\n    return event1;\n  }\n  return event2;\n}\n\n// src/outbox/tracker.ts\nimport { EventEmitter as EventEmitter7 } from \"tseep\";\nimport { LRUCache as LRUCache2 } from \"typescript-lru-cache\";\n\n// src/utils/get-users-relay-list.ts\nasync function getRelayListForUser(pubkey, ndk) {\n  const list = await getRelayListForUsers([pubkey], ndk);\n  return list.get(pubkey);\n}\nasync function getRelayListForUsers(pubkeys, ndk, skipCache = false, timeout = 1e3) {\n  const pool = ndk.outboxPool || ndk.pool;\n  const set = /* @__PURE__ */ new Set();\n  for (const relay of pool.relays.values()) set.add(relay);\n  const relayLists = /* @__PURE__ */ new Map();\n  const fromContactList = /* @__PURE__ */ new Map();\n  const relaySet = new NDKRelaySet(set, ndk);\n  if (ndk.cacheAdapter?.locking && !skipCache) {\n    const cachedList = await ndk.fetchEvents(\n      { kinds: [3, 10002], authors: Array.from(new Set(pubkeys)) },\n      { cacheUsage: \"ONLY_CACHE\" /* ONLY_CACHE */, subId: \"ndk-relay-list-fetch\" }\n    );\n    for (const relayList of cachedList) {\n      if (relayList.kind === 10002) relayLists.set(relayList.pubkey, NDKRelayList.from(relayList));\n    }\n    for (const relayList of cachedList) {\n      if (relayList.kind === 3) {\n        if (relayLists.has(relayList.pubkey)) continue;\n        const list = relayListFromKind3(ndk, relayList);\n        if (list) fromContactList.set(relayList.pubkey, list);\n      }\n    }\n    pubkeys = pubkeys.filter((pubkey) => !relayLists.has(pubkey) && !fromContactList.has(pubkey));\n  }\n  if (pubkeys.length === 0) return relayLists;\n  const relayListEvents = /* @__PURE__ */ new Map();\n  const contactListEvents = /* @__PURE__ */ new Map();\n  return new Promise((resolve) => {\n    const handleSubscription = async () => {\n      const subscribeOpts = {\n        closeOnEose: true,\n        pool,\n        groupable: true,\n        subId: \"ndk-relay-list-fetch\",\n        addSinceFromCache: true,\n        relaySet\n      };\n      if (relaySet) subscribeOpts.relaySet = relaySet;\n      ndk.subscribe({ kinds: [3, 10002], authors: pubkeys }, subscribeOpts, {\n        onEvent: (event) => {\n          if (event.kind === 10002 /* RelayList */) {\n            const existingEvent = relayListEvents.get(event.pubkey);\n            if (existingEvent && existingEvent.created_at > event.created_at) return;\n            relayListEvents.set(event.pubkey, event);\n          } else if (event.kind === 3 /* Contacts */) {\n            const existingEvent = contactListEvents.get(event.pubkey);\n            if (existingEvent && existingEvent.created_at > event.created_at) return;\n            contactListEvents.set(event.pubkey, event);\n          }\n        },\n        onEose: () => {\n          for (const event of relayListEvents.values()) {\n            relayLists.set(event.pubkey, NDKRelayList.from(event));\n          }\n          for (const pubkey of pubkeys) {\n            if (relayLists.has(pubkey)) continue;\n            const contactList = contactListEvents.get(pubkey);\n            if (!contactList) continue;\n            const list = relayListFromKind3(ndk, contactList);\n            if (list) relayLists.set(pubkey, list);\n          }\n          resolve(relayLists);\n        }\n      });\n      setTimeout(() => {\n        resolve(relayLists);\n      }, timeout);\n    };\n    handleSubscription();\n  });\n}\n\n// src/outbox/tracker.ts\nvar OutboxItem = class {\n  /**\n   * Type of item\n   */\n  type;\n  /**\n   * The relay URLs that are of interest to this item\n   */\n  relayUrlScores;\n  readRelays;\n  writeRelays;\n  constructor(type) {\n    this.type = type;\n    this.relayUrlScores = /* @__PURE__ */ new Map();\n    this.readRelays = /* @__PURE__ */ new Set();\n    this.writeRelays = /* @__PURE__ */ new Set();\n  }\n};\nvar OutboxTracker = class extends EventEmitter7 {\n  data;\n  ndk;\n  debug;\n  constructor(ndk) {\n    super();\n    this.ndk = ndk;\n    this.debug = ndk.debug.extend(\"outbox-tracker\");\n    this.data = new LRUCache2({\n      maxSize: 1e5,\n      entryExpirationTimeInMS: 2 * 60 * 1e3\n    });\n  }\n  /**\n   * Adds a list of users to the tracker.\n   * @param items\n   * @param skipCache\n   */\n  async trackUsers(items, skipCache = false) {\n    const promises = [];\n    for (let i = 0; i < items.length; i += 400) {\n      const slice = items.slice(i, i + 400);\n      const pubkeys = slice.map((item) => getKeyFromItem(item)).filter((pubkey) => !this.data.has(pubkey));\n      if (pubkeys.length === 0) continue;\n      for (const pubkey of pubkeys) {\n        this.data.set(pubkey, new OutboxItem(\"user\"));\n      }\n      promises.push(\n        new Promise((resolve) => {\n          getRelayListForUsers(pubkeys, this.ndk, skipCache).then((relayLists) => {\n            for (const [pubkey, relayList] of relayLists) {\n              let outboxItem = this.data.get(pubkey);\n              outboxItem ??= new OutboxItem(\"user\");\n              if (relayList) {\n                outboxItem.readRelays = new Set(normalize(relayList.readRelayUrls));\n                outboxItem.writeRelays = new Set(normalize(relayList.writeRelayUrls));\n                for (const relayUrl of outboxItem.readRelays) {\n                  if (this.ndk.pool.blacklistRelayUrls.has(relayUrl)) {\n                    outboxItem.readRelays.delete(relayUrl);\n                  }\n                }\n                for (const relayUrl of outboxItem.writeRelays) {\n                  if (this.ndk.pool.blacklistRelayUrls.has(relayUrl)) {\n                    outboxItem.writeRelays.delete(relayUrl);\n                  }\n                }\n                this.data.set(pubkey, outboxItem);\n              }\n            }\n          }).finally(resolve);\n        })\n      );\n    }\n    return Promise.all(promises);\n  }\n  /**\n   *\n   * @param key\n   * @param score\n   */\n  track(item, type, _skipCache = true) {\n    const key = getKeyFromItem(item);\n    type ??= getTypeFromItem(item);\n    let outboxItem = this.data.get(key);\n    if (!outboxItem) {\n      outboxItem = new OutboxItem(type);\n      if (item instanceof NDKUser) {\n        this.trackUsers([item]);\n      }\n    }\n    return outboxItem;\n  }\n};\nfunction getKeyFromItem(item) {\n  if (item instanceof NDKUser) {\n    return item.pubkey;\n  }\n  return item;\n}\nfunction getTypeFromItem(item) {\n  if (item instanceof NDKUser) {\n    return \"user\";\n  }\n  return \"kind\";\n}\n\n// src/relay/sets/utils.ts\nfunction correctRelaySet(relaySet, pool) {\n  const connectedRelays = pool.connectedRelays();\n  const includesConnectedRelay = Array.from(relaySet.relays).some((relay) => {\n    return connectedRelays.map((r) => r.url).includes(relay.url);\n  });\n  if (!includesConnectedRelay) {\n    for (const relay of connectedRelays) {\n      relaySet.addRelay(relay);\n    }\n  }\n  if (connectedRelays.length === 0) {\n    for (const relay of pool.relays.values()) {\n      relaySet.addRelay(relay);\n    }\n  }\n  return relaySet;\n}\n\n// src/subscription/manager.ts\nimport { matchFilters } from \"nostr-tools\";\nvar NDKSubscriptionManager = class {\n  subscriptions;\n  seenEvents = /* @__PURE__ */ new Map();\n  constructor() {\n    this.subscriptions = /* @__PURE__ */ new Map();\n  }\n  add(sub) {\n    this.subscriptions.set(sub.internalId, sub);\n    if (sub.onStopped) {\n    }\n    sub.onStopped = () => {\n      this.subscriptions.delete(sub.internalId);\n    };\n    sub.on(\"close\", () => {\n      this.subscriptions.delete(sub.internalId);\n    });\n  }\n  seenEvent(eventId, relay) {\n    const current = this.seenEvents.get(eventId) || [];\n    current.push(relay);\n    this.seenEvents.set(eventId, current);\n  }\n  /**\n   * Whenever an event comes in, this function is called.\n   * This function matches the received event against all the\n   * known (i.e. active) NDKSubscriptions, and if it matches,\n   * it sends the event to the subscription.\n   *\n   * This is the single place in the codebase that matches\n   * incoming events with parties interested in the event.\n   *\n   * This is also what allows for reactivity in NDK apps, such that\n   * whenever an active subscription receives an event that some\n   * other active subscription would want to receive, both receive it.\n   *\n   * TODO This also allows for subscriptions that overlap in meaning\n   * to be collapsed into one.\n   *\n   * I.e. if a subscription with filter: kinds: [1], authors: [alice]\n   * is created and EOSEs, and then a subsequent subscription with\n   * kinds: [1], authors: [alice] is created, once the second subscription\n   * EOSEs we can safely close it, increment its refCount and close it,\n   * and when the first subscription receives a new event from Alice this\n   * code will make the second subscription receive the event even though\n   * it has no active subscription on a relay.\n   * @param event Raw event received from a relay\n   * @param relay Relay that sent the event\n   * @param optimisticPublish Whether the event is coming from an optimistic publish\n   */\n  dispatchEvent(event, relay, optimisticPublish = false) {\n    if (relay) this.seenEvent(event.id, relay);\n    const subscriptions = this.subscriptions.values();\n    const matchingSubs = [];\n    for (const sub of subscriptions) {\n      if (matchFilters(sub.filters, event)) {\n        matchingSubs.push(sub);\n      }\n    }\n    for (const sub of matchingSubs) {\n      sub.eventReceived(event, relay, false, optimisticPublish);\n    }\n  }\n};\n\n// src/ndk/active-user.ts\nimport createDebug3 from \"debug\";\nvar debug6 = createDebug3(\"ndk:active-user\");\nasync function getUserRelayList(user) {\n  if (!this.autoConnectUserRelays) return;\n  const userRelays = await getRelayListForUser(user.pubkey, this);\n  if (!userRelays) return;\n  for (const url of userRelays.relays) {\n    let relay = this.pool.relays.get(url);\n    if (!relay) {\n      relay = new NDKRelay(url, this.relayAuthDefaultPolicy, this);\n      this.pool.addRelay(relay);\n    }\n  }\n  return userRelays;\n}\nasync function setActiveUser(user) {\n  const pool = this.outboxPool || this.pool;\n  if (pool.connectedRelays.length > 0) {\n    setActiveUserConnected.call(this, user);\n  } else {\n    pool.once(\"connect\", () => {\n      setActiveUserConnected.call(this, user);\n    });\n  }\n}\nasync function setActiveUserConnected(user) {\n  const userRelays = await getUserRelayList.call(this, user);\n  const filters = [\n    {\n      kinds: [10006 /* BlockRelayList */],\n      authors: [user.pubkey]\n    }\n  ];\n  if (this.autoFetchUserMutelist) {\n    filters[0].kinds?.push(1e4 /* MuteList */);\n  }\n  const events = /* @__PURE__ */ new Map();\n  const relaySet = userRelays ? userRelays.relaySet : void 0;\n  this.subscribe(\n    filters,\n    { subId: \"active-user-settings\", closeOnEose: true, relaySet },\n    {\n      onEvent: (event) => {\n        const prevEvent = events.get(event.kind);\n        if (prevEvent && prevEvent.created_at >= event.created_at) return;\n        events.set(event.kind, event);\n      },\n      onEose: () => {\n        for (const event of events.values()) {\n          processEvent.call(this, event);\n        }\n      }\n    }\n  );\n}\nasync function processEvent(event) {\n  if (event.kind === 10006 /* BlockRelayList */) {\n    processBlockRelayList.call(this, event);\n  } else if (event.kind === 1e4 /* MuteList */) {\n    processMuteList.call(this, event);\n  }\n}\nfunction processBlockRelayList(event) {\n  const list = lists_default.from(event);\n  for (const item of list.items) {\n    this.pool.blacklistRelayUrls.add(item[0]);\n  }\n  debug6(\"Added %d relays to relay blacklist\", list.items.length);\n}\nfunction processMuteList(muteList) {\n  const list = lists_default.from(muteList);\n  for (const item of list.items) {\n    this.mutedIds.set(item[1], item[0]);\n  }\n  debug6(\"Added %d users to mute list\", list.items.length);\n}\n\n// src/ndk/entity.ts\nimport { nip19 as nip197 } from \"nostr-tools\";\nfunction getEntity(entity) {\n  try {\n    const decoded = nip197.decode(entity);\n    if (decoded.type === \"npub\") return npub(this, decoded.data);\n    if (decoded.type === \"nprofile\") return nprofile(this, decoded.data);\n    return decoded;\n  } catch (_e) {\n    return null;\n  }\n}\nfunction npub(ndk, pubkey) {\n  return ndk.getUser({ pubkey });\n}\nfunction nprofile(ndk, profile) {\n  const user = ndk.getUser({ pubkey: profile.pubkey });\n  if (profile.relays) user.relayUrls = profile.relays;\n  return user;\n}\n\n// src/ndk/fetch-event-from-tag.ts\nfunction isValidHint(hint) {\n  if (!hint || hint === \"\") return false;\n  try {\n    new URL(hint);\n    return true;\n  } catch (_e) {\n    return false;\n  }\n}\nasync function fetchEventFromTag(tag, originalEvent, subOpts, fallback = {\n  type: \"timeout\"\n}) {\n  const d4 = this.debug.extend(\"fetch-event-from-tag\");\n  const [_, id, hint] = tag;\n  subOpts = {};\n  d4(\"fetching event from tag\", tag, subOpts, fallback);\n  const authorRelays = getRelaysForSync(this, originalEvent.pubkey);\n  if (authorRelays && authorRelays.size > 0) {\n    d4(\"fetching event from author relays %o\", Array.from(authorRelays));\n    const relaySet2 = NDKRelaySet.fromRelayUrls(Array.from(authorRelays), this);\n    const event2 = await this.fetchEvent(id, subOpts, relaySet2);\n    if (event2) return event2;\n  } else {\n    d4(\"no author relays found for %s\", originalEvent.pubkey, originalEvent);\n  }\n  const relaySet = calculateRelaySetsFromFilters(this, [{ ids: [id] }], this.pool);\n  d4(\"fetching event without relay hint\", relaySet);\n  const event = await this.fetchEvent(id, subOpts);\n  if (event) return event;\n  if (hint && hint !== \"\") {\n    const event2 = await this.fetchEvent(id, subOpts, this.pool.getRelay(hint, true, true, [{ ids: [id] }]));\n    if (event2) return event2;\n  }\n  let result = void 0;\n  const relay = isValidHint(hint) ? this.pool.getRelay(hint, false, true, [{ ids: [id] }]) : void 0;\n  const fetchMaybeWithRelayHint = new Promise((resolve) => {\n    this.fetchEvent(id, subOpts, relay).then(resolve);\n  });\n  if (!isValidHint(hint) || fallback.type === \"none\") {\n    return fetchMaybeWithRelayHint;\n  }\n  const fallbackFetchPromise = new Promise(async (resolve) => {\n    const fallbackRelaySet = fallback.relaySet;\n    const timeout = fallback.timeout ?? 1500;\n    const timeoutPromise = new Promise((resolve2) => setTimeout(resolve2, timeout));\n    if (fallback.type === \"timeout\") await timeoutPromise;\n    if (result) {\n      resolve(result);\n    } else {\n      d4(\"fallback fetch triggered\");\n      const fallbackEvent = await this.fetchEvent(id, subOpts, fallbackRelaySet);\n      resolve(fallbackEvent);\n    }\n  });\n  switch (fallback.type) {\n    case \"timeout\":\n      return Promise.race([fetchMaybeWithRelayHint, fallbackFetchPromise]);\n    case \"eose\":\n      result = await fetchMaybeWithRelayHint;\n      if (result) return result;\n      return fallbackFetchPromise;\n  }\n}\n\n// src/ndk/queue/index.ts\nvar Queue = class {\n  queue = [];\n  maxConcurrency;\n  processing = /* @__PURE__ */ new Set();\n  promises = /* @__PURE__ */ new Map();\n  constructor(_name, maxConcurrency) {\n    this.maxConcurrency = maxConcurrency;\n  }\n  add(item) {\n    if (this.promises.has(item.id)) {\n      return this.promises.get(item.id);\n    }\n    const promise = new Promise((resolve, reject) => {\n      this.queue.push({\n        ...item,\n        func: () => item.func().then(\n          (result) => {\n            resolve(result);\n            return result;\n          },\n          (error) => {\n            reject(error);\n            throw error;\n          }\n        )\n      });\n      this.process();\n    });\n    this.promises.set(item.id, promise);\n    promise.finally(() => {\n      this.promises.delete(item.id);\n      this.processing.delete(item.id);\n      this.process();\n    });\n    return promise;\n  }\n  process() {\n    if (this.processing.size >= this.maxConcurrency || this.queue.length === 0) {\n      return;\n    }\n    const item = this.queue.shift();\n    if (!item || this.processing.has(item.id)) {\n      return;\n    }\n    this.processing.add(item.id);\n    item.func();\n  }\n  clear() {\n    this.queue = [];\n  }\n  clearProcessing() {\n    this.processing.clear();\n  }\n  clearAll() {\n    this.clear();\n    this.clearProcessing();\n  }\n  length() {\n    return this.queue.length;\n  }\n};\n\n// src/ndk/index.ts\nvar DEFAULT_OUTBOX_RELAYS = [\"wss://purplepag.es/\", \"wss://nos.lol/\"];\nvar DEFAULT_BLACKLISTED_RELAYS = [\n  \"wss://brb.io/\",\n  // BRB\n  \"wss://nostr.mutinywallet.com/\"\n  // Don't try to read from this relay since it's a write-only relay\n  // \"wss://purplepag.es/\", // This is a hack, since this is a mostly read-only relay, but not fully. Once we have relay routing this can be removed so it only receives the supported kinds\n];\nvar NDK = class extends EventEmitter8 {\n  _explicitRelayUrls;\n  blacklistRelayUrls;\n  pool;\n  outboxPool;\n  _signer;\n  _activeUser;\n  cacheAdapter;\n  debug;\n  devWriteRelaySet;\n  outboxTracker;\n  mutedIds;\n  clientName;\n  clientNip89;\n  queuesZapConfig;\n  queuesNip05;\n  asyncSigVerification = false;\n  initialValidationRatio = 1;\n  lowestValidationRatio = 1;\n  validationRatioFn;\n  subManager;\n  publishingFailureHandled = false;\n  pools = [];\n  /**\n   * Default relay-auth policy that will be used when a relay requests authentication,\n   * if no other policy is specified for that relay.\n   *\n   * @example Disconnect from relays that request authentication:\n   * ```typescript\n   * ndk.relayAuthDefaultPolicy = NDKAuthPolicies.disconnect(ndk.pool);\n   * ```\n   *\n   * @example Sign in to relays that request authentication:\n   * ```typescript\n   * ndk.relayAuthDefaultPolicy = NDKAuthPolicies.signIn({ndk})\n   * ```\n   *\n   * @example Sign in to relays that request authentication, asking the user for confirmation:\n   * ```typescript\n   * ndk.relayAuthDefaultPolicy = (relay: NDKRelay) => {\n   *     const signIn = NDKAuthPolicies.signIn({ndk});\n   *     if (confirm(`Relay ${relay.url} is requesting authentication, do you want to sign in?`)) {\n   *        signIn(relay);\n   *     }\n   * }\n   * ```\n   */\n  relayAuthDefaultPolicy;\n  /**\n   * Fetch function to use for HTTP requests.\n   *\n   * @example\n   * ```typescript\n   * import fetch from \"node-fetch\";\n   *\n   * ndk.httpFetch = fetch;\n   * ```\n   */\n  httpFetch;\n  /**\n   * Provide a caller function to receive all networking traffic from relays\n   */\n  netDebug;\n  autoConnectUserRelays = true;\n  autoFetchUserMutelist = true;\n  walletConfig;\n  constructor(opts = {}) {\n    super();\n    this.debug = opts.debug || debug7(\"ndk\");\n    this.netDebug = opts.netDebug;\n    this._explicitRelayUrls = opts.explicitRelayUrls || [];\n    this.blacklistRelayUrls = opts.blacklistRelayUrls || DEFAULT_BLACKLISTED_RELAYS;\n    this.subManager = new NDKSubscriptionManager();\n    this.pool = new NDKPool(opts.explicitRelayUrls || [], [], this);\n    this.pool.name = \"Main\";\n    this.pool.on(\"relay:auth\", async (relay, challenge) => {\n      if (this.relayAuthDefaultPolicy) {\n        await this.relayAuthDefaultPolicy(relay, challenge);\n      }\n    });\n    this.autoConnectUserRelays = opts.autoConnectUserRelays ?? true;\n    this.autoFetchUserMutelist = opts.autoFetchUserMutelist ?? true;\n    this.clientName = opts.clientName;\n    this.clientNip89 = opts.clientNip89;\n    this.relayAuthDefaultPolicy = opts.relayAuthDefaultPolicy;\n    if (opts.enableOutboxModel) {\n      this.outboxPool = new NDKPool(opts.outboxRelayUrls || DEFAULT_OUTBOX_RELAYS, [], this, {\n        debug: this.debug.extend(\"outbox-pool\"),\n        name: \"Outbox Pool\"\n      });\n      this.outboxTracker = new OutboxTracker(this);\n    }\n    this.signer = opts.signer;\n    this.cacheAdapter = opts.cacheAdapter;\n    this.mutedIds = opts.mutedIds || /* @__PURE__ */ new Map();\n    if (opts.devWriteRelayUrls) {\n      this.devWriteRelaySet = NDKRelaySet.fromRelayUrls(opts.devWriteRelayUrls, this);\n    }\n    this.queuesZapConfig = new Queue(\"zaps\", 3);\n    this.queuesNip05 = new Queue(\"nip05\", 10);\n    this.signatureVerificationWorker = opts.signatureVerificationWorker;\n    this.initialValidationRatio = opts.initialValidationRatio || 1;\n    this.lowestValidationRatio = opts.lowestValidationRatio || 1;\n    try {\n      this.httpFetch = fetch;\n    } catch {\n    }\n  }\n  set explicitRelayUrls(urls) {\n    this._explicitRelayUrls = urls.map(normalizeRelayUrl);\n    this.pool.relayUrls = urls;\n  }\n  get explicitRelayUrls() {\n    return this._explicitRelayUrls || [];\n  }\n  set signatureVerificationWorker(worker2) {\n    this.asyncSigVerification = !!worker2;\n    if (worker2) {\n      signatureVerificationInit(worker2);\n    }\n  }\n  /**\n   * Adds an explicit relay to the pool.\n   * @param url\n   * @param relayAuthPolicy Authentication policy to use if different from the default\n   * @param connect Whether to connect to the relay automatically\n   * @returns\n   */\n  addExplicitRelay(urlOrRelay, relayAuthPolicy, connect = true) {\n    let relay;\n    if (typeof urlOrRelay === \"string\") {\n      relay = new NDKRelay(urlOrRelay, relayAuthPolicy, this);\n    } else {\n      relay = urlOrRelay;\n    }\n    this.pool.addRelay(relay, connect);\n    this.explicitRelayUrls?.push(relay.url);\n    return relay;\n  }\n  toJSON() {\n    return { relayCount: this.pool.relays.size }.toString();\n  }\n  get activeUser() {\n    return this._activeUser;\n  }\n  /**\n   * Sets the active user for this NDK instance, typically this will be\n   * called when assigning a signer to the NDK instance.\n   *\n   * This function will automatically connect to the user's relays if\n   * `autoConnectUserRelays` is set to true.\n   *\n   * It will also fetch the user's mutelist if `autoFetchUserMutelist` is set to true.\n   */\n  set activeUser(user) {\n    const differentUser = this._activeUser?.pubkey !== user?.pubkey;\n    this._activeUser = user;\n    if (user && differentUser) {\n      setActiveUser.call(this, user);\n    } else if (!user) {\n      this.mutedIds = /* @__PURE__ */ new Map();\n    }\n  }\n  get signer() {\n    return this._signer;\n  }\n  set signer(newSigner) {\n    this._signer = newSigner;\n    if (newSigner) this.emit(\"signer:ready\", newSigner);\n    newSigner?.user().then((user) => {\n      user.ndk = this;\n      this.activeUser = user;\n    });\n  }\n  /**\n   * Connect to relays with optional timeout.\n   * If the timeout is reached, the connection will be continued to be established in the background.\n   */\n  async connect(timeoutMs) {\n    if (this._signer && this.autoConnectUserRelays) {\n      this.debug(\n        \"Attempting to connect to user relays specified by signer %o\",\n        await this._signer.relays?.(this)\n      );\n      if (this._signer.relays) {\n        const relays = await this._signer.relays(this);\n        relays.forEach((relay) => this.pool.addRelay(relay));\n      }\n    }\n    const connections = [this.pool.connect(timeoutMs)];\n    if (this.outboxPool) {\n      connections.push(this.outboxPool.connect(timeoutMs));\n    }\n    this.debug(\"Connecting to relays %o\", { timeoutMs });\n    return Promise.allSettled(connections).then(() => {\n    });\n  }\n  /**\n   * Get a NDKUser object\n   *\n   * @param opts\n   * @returns\n   */\n  getUser(opts) {\n    const user = new NDKUser(opts);\n    user.ndk = this;\n    return user;\n  }\n  /**\n   * Get a NDKUser from a NIP05\n   * @param nip05 NIP-05 ID\n   * @param skipCache Skip cache\n   * @returns\n   */\n  async getUserFromNip05(nip05, skipCache = false) {\n    return NDKUser.fromNip05(nip05, this, skipCache);\n  }\n  /**\n   * Creates and starts a new subscription.\n   *\n   * Subscriptions automatically start unless `autoStart` is set to `false`.\n   * You can control automatic closing on EOSE via `opts.closeOnEose`.\n   *\n   * @param filters - A single NDKFilter object or an array of filters.\n   * @param opts - Optional NDKSubscriptionOptions to customize behavior (e.g., caching, grouping).\n   * @param relaySet - Optional explicit NDKRelaySet to use for this subscription. If not provided, NDK calculates the optimal set.\n   * @param autoStart - Controls automatic starting and allows providing event handlers.\n   *   - `true` (default): Starts the subscription immediately.\n   *   - `false`: Creates the subscription but does not start it (call `subscription.start()` manually).\n   *   - `NDKSubscriptionEventHandlers` object: Starts the subscription immediately and attaches the provided handlers (`onEvent`, `onEvents`, `onEose`).\n   *     - Using `onEvents` changes behavior: it receives initial cached events in bulk, and `onEvent` is skipped for that initial batch. See {@link NDKSubscriptionEventHandlers}.\n   * @returns The created NDKSubscription instance.\n   *\n   * @example Basic subscription\n   * ```typescript\n   * const sub = ndk.subscribe({ kinds: [1], authors: [pubkey] });\n   * sub.on(\"event\", (event) => console.log(\"Kind 1 event:\", event.content));\n   * ```\n   *\n   * @example Subscription with options and direct handlers\n   * ```typescript\n   * const sub = ndk.subscribe(\n   *   { kinds: [0], authors: [pubkey] },\n   *   { closeOnEose: true, cacheUsage: NDKSubscriptionCacheUsage.PARALLEL },\n   *   undefined, // Use default relay set calculation\n   *   {\n   *     onEvents: (events) => { // Renamed parameter\n   *       if (events.length > 0) {\n   *         console.log(`Got ${events.length} profile events from cache:`, events[0].content);\n   *       }\n   *     },\n   *     onEvent: (event) => { // Renamed parameter\n   *       console.log(\"Got profile update from relay:\", event.content); // Clarified source\n   *     },\n   *     onEose: () => console.log(\"Profile subscription finished.\")\n   *   }\n   * );\n   * ```\n   *\n   * @since 2.13.0 `relaySet` parameter removed; pass `relaySet` or `relayUrls` via `opts`.\n   */\n  subscribe(filters, opts, autoStart = true) {\n    const subscription = new NDKSubscription(this, filters, opts);\n    this.subManager.add(subscription);\n    const pool = subscription.pool;\n    if (subscription.relaySet) {\n      for (const relay of subscription.relaySet.relays) {\n        pool.useTemporaryRelay(relay, void 0, subscription.filters);\n      }\n    }\n    if (this.outboxPool && subscription.hasAuthorsFilter()) {\n      const authors = subscription.filters.filter((filter) => filter.authors && filter.authors?.length > 0).flatMap((filter) => filter.authors);\n      this.outboxTracker?.trackUsers(authors);\n    }\n    if (autoStart) {\n      let eventsHandler;\n      if (typeof autoStart === \"object\") {\n        if (autoStart.onEvent) subscription.on(\"event\", autoStart.onEvent);\n        if (autoStart.onEose) subscription.on(\"eose\", autoStart.onEose);\n        if (autoStart.onEvents) eventsHandler = autoStart.onEvents;\n      }\n      setTimeout(() => {\n        const cachedEvents = subscription.start(!eventsHandler);\n        if (cachedEvents && cachedEvents.length > 0 && !!eventsHandler) eventsHandler(cachedEvents);\n      }, 0);\n    }\n    return subscription;\n  }\n  /**\n   * Publish an event to a relay\n   * @param event event to publish\n   * @param relaySet explicit relay set to use\n   * @param timeoutMs timeout in milliseconds to wait for the event to be published\n   * @returns The relays the event was published to\n   *\n   * @deprecated Use `event.publish()` instead\n   */\n  async publish(event, relaySet, timeoutMs) {\n    this.debug(\"Deprecated: Use `event.publish()` instead\");\n    return event.publish(relaySet, timeoutMs);\n  }\n  /**\n   * Attempts to fetch an event from a tag, following relay hints and\n   * other best practices.\n   * @param tag Tag to fetch the event from\n   * @param originalEvent Event where the tag came from\n   * @param subOpts Subscription options to use when fetching the event\n   * @param fallback Fallback options to use when the hint relay doesn't respond\n   * @returns\n   */\n  fetchEventFromTag = fetchEventFromTag.bind(this);\n  /**\n   * Fetch an event from the cache synchronously.\n   * @param idOrFilter event id in bech32 format or filter\n   * @returns events from the cache or null if the cache is empty\n   */\n  fetchEventSync(idOrFilter) {\n    if (!this.cacheAdapter) throw new Error(\"Cache adapter not set\");\n    let filters;\n    if (typeof idOrFilter === \"string\") filters = [filterFromId(idOrFilter)];\n    else filters = idOrFilter;\n    const sub = new NDKSubscription(this, filters);\n    const events = this.cacheAdapter.query(sub);\n    if (events instanceof Promise) throw new Error(\"Cache adapter is async\");\n    return events.map((e) => {\n      e.ndk = this;\n      return e;\n    });\n  }\n  /**\n   * Fetch a single event.\n   *\n   * @param idOrFilter event id in bech32 format or filter\n   * @param opts subscription options\n   * @param relaySetOrRelay explicit relay set to use\n   */\n  async fetchEvent(idOrFilter, opts, relaySetOrRelay) {\n    let filters;\n    let relaySet;\n    if (relaySetOrRelay instanceof NDKRelay) {\n      relaySet = new NDKRelaySet(/* @__PURE__ */ new Set([relaySetOrRelay]), this);\n    } else if (relaySetOrRelay instanceof NDKRelaySet) {\n      relaySet = relaySetOrRelay;\n    }\n    if (!relaySetOrRelay && typeof idOrFilter === \"string\") {\n      if (!isNip33AValue(idOrFilter)) {\n        const relays = relaysFromBech32(idOrFilter, this);\n        if (relays.length > 0) {\n          relaySet = new NDKRelaySet(new Set(relays), this);\n          relaySet = correctRelaySet(relaySet, this.pool);\n        }\n      }\n    }\n    if (typeof idOrFilter === \"string\") {\n      filters = [filterFromId(idOrFilter)];\n    } else if (Array.isArray(idOrFilter)) {\n      filters = idOrFilter;\n    } else {\n      filters = [idOrFilter];\n    }\n    if (filters.length === 0) {\n      throw new Error(`Invalid filter: ${JSON.stringify(idOrFilter)}`);\n    }\n    return new Promise((resolve) => {\n      let fetchedEvent = null;\n      const subscribeOpts = {\n        ...opts || {},\n        closeOnEose: true\n      };\n      if (relaySet) subscribeOpts.relaySet = relaySet;\n      const s = this.subscribe(\n        filters,\n        subscribeOpts,\n        // relaySet, // Removed: Passed via opts\n        false\n        // autoStart = false\n      );\n      const t2 = setTimeout(() => {\n        s.stop();\n        resolve(fetchedEvent);\n      }, 1e4);\n      s.on(\"event\", (event) => {\n        event.ndk = this;\n        if (!event.isReplaceable()) {\n          clearTimeout(t2);\n          resolve(event);\n        } else if (!fetchedEvent || fetchedEvent.created_at < event.created_at) {\n          fetchedEvent = event;\n        }\n      });\n      s.on(\"eose\", () => {\n        clearTimeout(t2);\n        resolve(fetchedEvent);\n      });\n      s.start();\n    });\n  }\n  /**\n   * Fetch events\n   */\n  async fetchEvents(filters, opts, relaySet) {\n    return new Promise((resolve) => {\n      const events = /* @__PURE__ */ new Map();\n      const subscribeOpts = {\n        ...opts || {},\n        closeOnEose: true\n      };\n      if (relaySet) subscribeOpts.relaySet = relaySet;\n      const relaySetSubscription = this.subscribe(\n        filters,\n        subscribeOpts,\n        // relaySet, // Removed: Passed via opts\n        false\n        // autoStart = false\n      );\n      const onEvent = (event) => {\n        let _event;\n        if (!(event instanceof NDKEvent)) _event = new NDKEvent(void 0, event);\n        else _event = event;\n        const dedupKey = _event.deduplicationKey();\n        const existingEvent = events.get(dedupKey);\n        if (existingEvent) {\n          _event = dedup(existingEvent, _event);\n        }\n        _event.ndk = this;\n        events.set(dedupKey, _event);\n      };\n      relaySetSubscription.on(\"event\", onEvent);\n      relaySetSubscription.on(\"eose\", () => {\n        resolve(new Set(events.values()));\n      });\n      relaySetSubscription.start();\n    });\n  }\n  /**\n   * Ensures that a signer is available to sign an event.\n   */\n  assertSigner() {\n    if (!this.signer) {\n      this.emit(\"signer:required\");\n      throw new Error(\"Signer required\");\n    }\n  }\n  getEntity = getEntity.bind(this);\n  set wallet(wallet) {\n    if (!wallet) {\n      this.walletConfig = void 0;\n      return;\n    }\n    this.walletConfig ??= {};\n    this.walletConfig.lnPay = wallet?.lnPay?.bind(wallet);\n    this.walletConfig.cashuPay = wallet?.cashuPay?.bind(wallet);\n  }\n};\n\n// src/zap/invoice.ts\nimport { decode } from \"light-bolt11-decoder\";\nfunction zapInvoiceFromEvent(event) {\n  const description = event.getMatchingTags(\"description\")[0];\n  const bolt11 = event.getMatchingTags(\"bolt11\")[0];\n  let decodedInvoice;\n  let zapRequest;\n  if (!description || !bolt11 || !bolt11[1]) {\n    return null;\n  }\n  try {\n    let zapRequestPayload = description[1];\n    if (zapRequestPayload.startsWith(\"%\")) {\n      zapRequestPayload = decodeURIComponent(zapRequestPayload);\n    }\n    if (zapRequestPayload === \"\") {\n      return null;\n    }\n    zapRequest = JSON.parse(zapRequestPayload);\n    decodedInvoice = decode(bolt11[1]);\n  } catch (_e) {\n    return null;\n  }\n  const amountSection = decodedInvoice.sections.find((s) => s.name === \"amount\");\n  if (!amountSection) {\n    return null;\n  }\n  const amount = Number.parseInt(amountSection.value);\n  if (!amount) {\n    return null;\n  }\n  const content = zapRequest.content;\n  const sender = zapRequest.pubkey;\n  const recipientTag = event.getMatchingTags(\"p\")[0];\n  const recipient = recipientTag[1];\n  let zappedEvent = event.getMatchingTags(\"e\")[0];\n  if (!zappedEvent) {\n    zappedEvent = event.getMatchingTags(\"a\")[0];\n  }\n  const zappedEventId = zappedEvent ? zappedEvent[1] : void 0;\n  const zapInvoice = {\n    id: event.id,\n    zapper: event.pubkey,\n    zappee: sender,\n    zapped: recipient,\n    zappedEvent: zappedEventId,\n    amount,\n    comment: content\n  };\n  return zapInvoice;\n}\n\n// src/zapper/index.ts\nimport createDebug5 from \"debug\";\nimport { EventEmitter as EventEmitter9 } from \"tseep\";\n\n// src/zapper/ln.ts\nimport { bech32 } from \"@scure/base\";\nimport createDebug4 from \"debug\";\nvar d2 = createDebug4(\"ndk:zapper:ln\");\nasync function getNip57ZapSpecFromLud({ lud06, lud16 }, ndk) {\n  let zapEndpoint;\n  if (lud16 && !lud16.startsWith(\"LNURL\")) {\n    const [name, domain] = lud16.split(\"@\");\n    zapEndpoint = `https://${domain}/.well-known/lnurlp/${name}`;\n  } else if (lud06) {\n    const { words } = bech32.decode(lud06, 1e3);\n    const data = bech32.fromWords(words);\n    const utf8Decoder = new TextDecoder(\"utf-8\");\n    zapEndpoint = utf8Decoder.decode(data);\n  }\n  if (!zapEndpoint) {\n    d2(\"No zap endpoint found %o\", { lud06, lud16 });\n    throw new Error(\"No zap endpoint found\");\n  }\n  try {\n    const _fetch = ndk.httpFetch || fetch;\n    const response = await _fetch(zapEndpoint);\n    if (response.status !== 200) {\n      const text = await response.text();\n      throw new Error(`Unable to fetch zap endpoint ${zapEndpoint}: ${text}`);\n    }\n    return await response.json();\n  } catch (e) {\n    throw new Error(`Unable to fetch zap endpoint ${zapEndpoint}: ${e}`);\n  }\n}\n\n// src/zapper/nip57.ts\nimport { nip57 } from \"nostr-tools\";\nasync function generateZapRequest(target, ndk, data, pubkey, amount, relays, comment, tags, signer) {\n  const zapEndpoint = data.callback;\n  const zapRequest = nip57.makeZapRequest({\n    profile: pubkey,\n    // set the event to null since nostr-tools doesn't support nip-33 zaps\n    event: null,\n    amount,\n    comment: comment || \"\",\n    relays: relays.slice(0, 4)\n  });\n  if (target instanceof NDKEvent) {\n    const tags2 = target.referenceTags();\n    const nonPTags = tags2.filter((tag) => tag[0] !== \"p\");\n    zapRequest.tags.push(...nonPTags);\n  }\n  zapRequest.tags.push([\"lnurl\", zapEndpoint]);\n  const event = new NDKEvent(ndk, zapRequest);\n  if (tags) {\n    event.tags = event.tags.concat(tags);\n  }\n  const eTaggedEvents = /* @__PURE__ */ new Set();\n  const aTaggedEvents = /* @__PURE__ */ new Set();\n  for (const tag of event.tags) {\n    if (tag[0] === \"e\") {\n      eTaggedEvents.add(tag[1]);\n    } else if (tag[0] === \"a\") {\n      aTaggedEvents.add(tag[1]);\n    }\n  }\n  if (eTaggedEvents.size > 1) throw new Error(\"Only one e-tag is allowed\");\n  if (aTaggedEvents.size > 1) throw new Error(\"Only one a-tag is allowed\");\n  event.tags = event.tags.filter((tag) => tag[0] !== \"p\");\n  event.tags.push([\"p\", pubkey]);\n  await event.sign(signer);\n  return event;\n}\n\n// src/zapper/index.ts\nvar d3 = createDebug5(\"ndk:zapper\");\nvar NDKZapper = class extends EventEmitter9 {\n  target;\n  ndk;\n  comment;\n  amount;\n  unit;\n  tags;\n  signer;\n  zapMethod;\n  nutzapAsFallback;\n  lnPay;\n  /**\n   * Called when a cashu payment is to be made.\n   * This function should swap/mint proofs for the required amount, in the required unit,\n   * in any of the provided mints and return the proofs and mint used.\n   */\n  cashuPay;\n  onComplete;\n  maxRelays = 3;\n  /**\n   *\n   * @param target The target of the zap\n   * @param amount The amount to send indicated in the unit\n   * @param unit The unit of the amount\n   * @param opts Options for the zap\n   */\n  constructor(target, amount, unit = \"msat\", opts = {}) {\n    super();\n    this.target = target;\n    this.ndk = opts.ndk || target.ndk;\n    if (!this.ndk) {\n      throw new Error(\"No NDK instance provided\");\n    }\n    this.amount = amount;\n    this.comment = opts.comment;\n    this.unit = unit;\n    this.tags = opts.tags;\n    this.signer = opts.signer;\n    this.nutzapAsFallback = opts.nutzapAsFallback ?? false;\n    this.lnPay = opts.lnPay || this.ndk.walletConfig?.lnPay;\n    this.cashuPay = opts.cashuPay || this.ndk.walletConfig?.cashuPay;\n    this.onComplete = opts.onComplete || this.ndk.walletConfig?.onPaymentComplete;\n  }\n  /**\n   * Initiate zapping process\n   *\n   * This function will calculate the splits for this zap and initiate each zap split.\n   */\n  async zap(methods) {\n    const splits = this.getZapSplits();\n    const results = /* @__PURE__ */ new Map();\n    await Promise.all(\n      splits.map(async (split) => {\n        let result;\n        try {\n          result = await this.zapSplit(split, methods);\n        } catch (e) {\n          result = new Error(e.message);\n        }\n        this.emit(\"split:complete\", split, result);\n        results.set(split, result);\n      })\n    );\n    this.emit(\"complete\", results);\n    if (this.onComplete) this.onComplete(results);\n    return results;\n  }\n  async zapNip57(split, data) {\n    if (!this.lnPay) throw new Error(\"No lnPay function available\");\n    const zapSpec = await getNip57ZapSpecFromLud(data, this.ndk);\n    if (!zapSpec) throw new Error(\"No zap spec available for recipient\");\n    const relays = await this.relays(split.pubkey);\n    const zapRequest = await generateZapRequest(\n      this.target,\n      this.ndk,\n      zapSpec,\n      split.pubkey,\n      split.amount,\n      relays,\n      this.comment,\n      this.tags,\n      this.signer\n    );\n    if (!zapRequest) {\n      d3(\"Unable to generate zap request\");\n      throw new Error(\"Unable to generate zap request\");\n    }\n    const pr = await this.getLnInvoice(zapRequest, split.amount, zapSpec);\n    if (!pr) {\n      d3(\"Unable to get payment request\");\n      throw new Error(\"Unable to get payment request\");\n    }\n    this.emit(\"ln_invoice\", {\n      amount: split.amount,\n      recipientPubkey: split.pubkey,\n      unit: this.unit,\n      nip57ZapRequest: zapRequest,\n      pr,\n      type: \"nip57\"\n    });\n    const res = await this.lnPay({\n      target: this.target,\n      recipientPubkey: split.pubkey,\n      paymentDescription: \"NIP-57 Zap\",\n      pr,\n      amount: split.amount,\n      unit: this.unit,\n      nip57ZapRequest: zapRequest\n    });\n    if (res?.preimage) {\n      this.emit(\"ln_payment\", {\n        preimage: res.preimage,\n        amount: split.amount,\n        recipientPubkey: split.pubkey,\n        pr,\n        unit: this.unit,\n        nip57ZapRequest: zapRequest,\n        type: \"nip57\"\n      });\n    }\n    return res;\n  }\n  /**\n   * Fetches information about a NIP-61 zap and asks the caller to create cashu proofs for the zap.\n   *\n   * (note that the cashuPay function can use any method to create the proofs, including using lightning\n   * to mint proofs in the specified mint, the responsibility of minting the proofs is delegated to the caller (e.g. ndk-wallet))\n   */\n  async zapNip61(split, data) {\n    if (!this.cashuPay) throw new Error(\"No cashuPay function available\");\n    let ret;\n    ret = await this.cashuPay(\n      {\n        target: this.target,\n        recipientPubkey: split.pubkey,\n        paymentDescription: \"NIP-61 Zap\",\n        amount: split.amount,\n        unit: this.unit,\n        ...data ?? {}\n      },\n      (pr) => {\n        this.emit(\"ln_invoice\", {\n          pr,\n          amount: split.amount,\n          recipientPubkey: split.pubkey,\n          unit: this.unit,\n          type: \"nip61\"\n        });\n      }\n    );\n    d3(\"NIP-61 Zap result: %o\", ret);\n    if (ret instanceof Error) {\n      return ret;\n    }\n    if (ret) {\n      const { proofs, mint } = ret;\n      if (!proofs || !mint) throw new Error(`Invalid zap confirmation: missing proofs or mint: ${ret}`);\n      const relays = await this.relays(split.pubkey);\n      const relaySet = NDKRelaySet.fromRelayUrls(relays, this.ndk);\n      const nutzap = new NDKNutzap(this.ndk);\n      nutzap.tags = [...nutzap.tags, ...this.tags || []];\n      nutzap.proofs = proofs;\n      nutzap.mint = mint;\n      nutzap.target = this.target;\n      nutzap.comment = this.comment;\n      nutzap.unit = \"sat\";\n      nutzap.recipientPubkey = split.pubkey;\n      await nutzap.sign(this.signer);\n      nutzap.publish(relaySet);\n      return nutzap;\n    }\n  }\n  /**\n   * Get the zap methods available for the recipient and initiates the zap\n   * in the desired method.\n   * @param split\n   * @param methods - The methods to try, if not provided, all methods will be tried.\n   * @returns\n   */\n  async zapSplit(split, methods) {\n    const recipient = this.ndk.getUser({ pubkey: split.pubkey });\n    const zapMethods = await recipient.getZapInfo(2500);\n    let retVal;\n    const canFallbackToNip61 = this.nutzapAsFallback && this.cashuPay;\n    if (zapMethods.size === 0 && !canFallbackToNip61)\n      throw new Error(\"No zap method available for recipient and NIP-61 fallback is disabled\");\n    const nip61Fallback = async () => {\n      if (!this.nutzapAsFallback) return;\n      const relayLists = await getRelayListForUsers([split.pubkey], this.ndk);\n      let relayUrls = relayLists.get(split.pubkey)?.readRelayUrls;\n      relayUrls = this.ndk.pool.connectedRelays().map((r) => r.url);\n      return await this.zapNip61(split, {\n        // use the user's relay list\n        relays: relayUrls,\n        // lock to the user's actual pubkey\n        p2pk: split.pubkey,\n        // allow intramint fallback\n        allowIntramintFallback: !!canFallbackToNip61\n      });\n    };\n    const canUseNip61 = !methods || methods.includes(\"nip61\");\n    const canUseNip57 = !methods || methods.includes(\"nip57\");\n    const nip61Method = zapMethods.get(\"nip61\");\n    if (nip61Method && canUseNip61) {\n      try {\n        retVal = await this.zapNip61(split, nip61Method);\n        if (retVal instanceof NDKNutzap) return retVal;\n      } catch (e) {\n        this.emit(\"notice\", `NIP-61 attempt failed: ${e.message}`);\n      }\n    }\n    const nip57Method = zapMethods.get(\"nip57\");\n    if (nip57Method && canUseNip57) {\n      try {\n        retVal = await this.zapNip57(split, nip57Method);\n        if (!(retVal instanceof Error)) return retVal;\n      } catch (e) {\n        this.emit(\"notice\", `NIP-57 attempt failed: ${e.message}`);\n      }\n    }\n    if (canFallbackToNip61) {\n      retVal = await nip61Fallback();\n      if (retVal instanceof Error) throw retVal;\n      return retVal;\n    }\n    this.emit(\"notice\", \"Zap methods exhausted and there was no fallback to NIP-61\");\n    if (retVal instanceof Error) throw retVal;\n    return retVal;\n  }\n  /**\n   * Gets a bolt11 for a nip57 zap\n   * @param event\n   * @param amount\n   * @param zapEndpoint\n   * @returns\n   */\n  async getLnInvoice(zapRequest, amount, data) {\n    const zapEndpoint = data.callback;\n    const eventPayload = JSON.stringify(zapRequest.rawEvent());\n    d3(\n      `Fetching invoice from ${zapEndpoint}?${new URLSearchParams({\n        amount: amount.toString(),\n        nostr: eventPayload\n      })}`\n    );\n    const url = new URL(zapEndpoint);\n    url.searchParams.append(\"amount\", amount.toString());\n    url.searchParams.append(\"nostr\", eventPayload);\n    d3(`Fetching invoice from ${url.toString()}`);\n    const response = await fetch(url.toString());\n    d3(`Got response from zap endpoint: ${zapEndpoint}`, { status: response.status });\n    if (response.status !== 200) {\n      d3(`Received non-200 status from zap endpoint: ${zapEndpoint}`, {\n        status: response.status,\n        amount,\n        nostr: eventPayload\n      });\n      const text = await response.text();\n      throw new Error(`Unable to fetch zap endpoint ${zapEndpoint}: ${text}`);\n    }\n    const body = await response.json();\n    return body.pr;\n  }\n  getZapSplits() {\n    if (this.target instanceof NDKUser) {\n      return [\n        {\n          pubkey: this.target.pubkey,\n          amount: this.amount\n        }\n      ];\n    }\n    const zapTags = this.target.getMatchingTags(\"zap\");\n    if (zapTags.length === 0) {\n      return [\n        {\n          pubkey: this.target.pubkey,\n          amount: this.amount\n        }\n      ];\n    }\n    const splits = [];\n    const total = zapTags.reduce((acc, tag) => acc + Number.parseInt(tag[2]), 0);\n    for (const tag of zapTags) {\n      const pubkey = tag[1];\n      const amount = Math.floor(Number.parseInt(tag[2]) / total * this.amount);\n      splits.push({ pubkey, amount });\n    }\n    return splits;\n  }\n  /**\n   * Gets the zap method that should be used to zap a pubbkey\n   * @param ndk\n   * @param pubkey\n   * @returns\n   */\n  async getZapMethods(ndk, recipient, timeout = 2500) {\n    const user = ndk.getUser({ pubkey: recipient });\n    return await user.getZapInfo(timeout);\n  }\n  /**\n   * @returns the relays to use for the zap request\n   */\n  async relays(pubkey) {\n    let r = [];\n    if (this.ndk?.activeUser) {\n      const relayLists = await getRelayListForUsers([this.ndk.activeUser.pubkey, pubkey], this.ndk);\n      const relayScores = /* @__PURE__ */ new Map();\n      for (const relayList of relayLists.values()) {\n        for (const url of relayList.readRelayUrls) {\n          const score = relayScores.get(url) || 0;\n          relayScores.set(url, score + 1);\n        }\n      }\n      r = Array.from(relayScores.entries()).sort((a, b) => b[1] - a[1]).map(([url]) => url).slice(0, this.maxRelays);\n    }\n    if (this.ndk?.pool?.permanentAndConnectedRelays().length) {\n      r = this.ndk.pool.permanentAndConnectedRelays().map((relay) => relay.url);\n    }\n    if (!r.length) {\n      r = [];\n    }\n    return r;\n  }\n};\n\n// src/utils/filter.ts\nfunction matchFilter(filter, event) {\n  if (filter.ids && filter.ids.indexOf(event.id) === -1) {\n    return false;\n  }\n  if (filter.kinds && filter.kinds.indexOf(event.kind) === -1) {\n    return false;\n  }\n  if (filter.authors && filter.authors.indexOf(event.pubkey) === -1) {\n    return false;\n  }\n  for (const f in filter) {\n    if (f[0] === \"#\") {\n      const tagName = f.slice(1);\n      if (tagName === \"t\") {\n        const values = filter[`#${tagName}`]?.map((v) => v.toLowerCase());\n        if (values && !event.tags.find(([t, v]) => t === tagName && values?.indexOf(v.toLowerCase()) !== -1))\n          return false;\n      } else {\n        const values = filter[`#${tagName}`];\n        if (values && !event.tags.find(([t, v]) => t === tagName && values?.indexOf(v) !== -1)) return false;\n      }\n    }\n  }\n  if (filter.since && event.created_at < filter.since) return false;\n  if (filter.until && event.created_at > filter.until) return false;\n  return true;\n}\nexport {\n  BECH32_REGEX,\n  NDKAppHandlerEvent,\n  NDKAppSettings,\n  NDKArticle,\n  NDKCashuMintList,\n  NDKCashuToken,\n  NDKCashuWalletTx,\n  NDKClassified,\n  NDKDVMJobFeedback,\n  NDKDVMJobResult,\n  NDKDVMRequest,\n  NDKDraft,\n  NDKDvmJobFeedbackStatus,\n  NDKEvent,\n  NDKHighlight,\n  NDKImage,\n  NDKKind,\n  NDKList,\n  NDKListKinds,\n  NDKNip07Signer,\n  NDKNip46Backend,\n  NDKNip46Signer,\n  NDKNostrRpc,\n  NDKNutzap,\n  NDKPool,\n  NDKPrivateKeySigner,\n  NDKPublishError,\n  NDKRelay,\n  NDKRelayAuthPolicies,\n  NDKRelayList,\n  NDKRelaySet,\n  NDKRelayStatus,\n  NDKRepost,\n  NDKSimpleGroup,\n  NDKSimpleGroupMemberList,\n  NDKSimpleGroupMetadata,\n  NDKStory,\n  NDKStorySticker,\n  NDKStoryStickerType,\n  NDKSubscription,\n  NDKSubscriptionCacheUsage,\n  NDKSubscriptionReceipt,\n  NDKSubscriptionStart,\n  NDKSubscriptionTier,\n  NDKTranscriptionDVM,\n  NDKUser,\n  NDKVideo,\n  NDKWiki,\n  NDKZapper,\n  NIP33_A_REGEX,\n  NdkNutzapStatus,\n  calculateRelaySetFromEvent,\n  calculateTermDurationInSeconds,\n  cashuPubkeyToNostrPubkey,\n  compareFilter,\n  NDK as default,\n  defaultOpts,\n  deserialize,\n  dvmSchedule,\n  eventHasETagMarkers,\n  eventIsPartOfThread,\n  eventIsReply,\n  eventReplies,\n  eventThreadIds,\n  eventThreads,\n  eventsBySameAuthor,\n  filterAndRelaySetFromBech32,\n  filterFingerprint,\n  filterForEventsTaggingId,\n  filterFromId,\n  generateContentTags,\n  generateHashtags,\n  generateSubId,\n  generateZapRequest,\n  getEventReplyId,\n  getNip57ZapSpecFromLud,\n  getRelayListForUser,\n  getRelayListForUsers,\n  getReplyTag,\n  getRootEventId,\n  getRootTag,\n  giftUnwrap,\n  giftWrap,\n  imetaTagToTag,\n  isEventOriginalPost,\n  isNip33AValue,\n  mapImetaTag,\n  matchFilter,\n  mergeFilters,\n  mergeTags,\n  ndkSignerFromPayload,\n  newAmount,\n  normalize,\n  normalizeRelayUrl,\n  normalizeUrl,\n  parseTagToSubscriptionAmount,\n  pinEvent,\n  possibleIntervalFrequencies,\n  profileFromEvent,\n  proofP2pk,\n  proofP2pkNostr,\n  proofsTotalBalance,\n  queryFullyFilled,\n  relayListFromKind3,\n  relaysFromBech32,\n  serialize,\n  serializeProfile,\n  signerRegistry,\n  strToDimension,\n  strToPosition,\n  tryNormalizeRelayUrl,\n  uniqueTag,\n  wrapEvent,\n  zapInvoiceFromEvent\n};\n","// SPDX-License-Identifier: MIT\n\nexport const DEFAULT_RELAYS = [\n  'wss://relay.damus.io',\n  'wss://nostr.wine',\n  'wss://relay.nostr.net',\n  'wss://relay.nostr.band',\n  'wss://nos.lol',\n  'wss://nostr-pub.wellorder.net',\n  'wss://relay.getalby.com',\n  'wss://relay.primal.net',\n  // 'wss://nostr.malin.onl',\n  // 'wss://nostrsatva.net',\n] as const;\n\nexport const MILLISATS_PER_SAT = 1000;\n\nexport const NPUB_LENGTH = 63;\n\nexport const DEFAULT_PROFILE_IMAGE = './assets/default_dp.png';\n","// SPDX-License-Identifier: MIT\n\nimport NDK, {\n  NDKKind,\n  NDKUser,\n  NDKUserProfile,\n  NDKEvent,\n} from '@nostr-dev-kit/ndk';\nimport { DEFAULT_RELAYS } from './constants';\nimport { DEFAULT_PROFILE_IMAGE } from './constants';\n\n// TODO: Is this class doing too much work? Time to split into smaller services?\nexport class NostrService {\n\n  private static instance: NostrService;\n  private ndk: NDK;\n  private isConnected: boolean = false;\n\n  private constructor() {\n    this.ndk = new NDK();\n  }\n\n  public static getInstance(): NostrService {\n    if (!NostrService.instance) {\n      NostrService.instance = new NostrService();\n    }\n    return NostrService.instance;\n  }\n\n  public async connectToNostr(\n    relays: string[] = [...DEFAULT_RELAYS]\n  ): Promise<void> {\n    // Identify new relays that were not part of the original set\n    const newRelays = relays.filter(r => !this.getRelays().includes(r));\n\n    // If already connected, add only the delta – keep signer & subscriptions intact\n    if (this.isConnected && newRelays.length) {\n      newRelays.forEach(url => this.ndk.addExplicitRelay(url));\n      return;\n    }\n\n    // First-time connection or reconnect after explicit close\n    this.ndk.explicitRelayUrls = relays;\n    await this.ndk.connect();\n    this.isConnected = true;\n  }\n\n  public getRelays(): string[] {\n    return this.ndk.explicitRelayUrls || DEFAULT_RELAYS;\n  }\n\n  public async resolveNDKUser(identifier: {\n    npub?: string | null;\n    nip05?: string | null;\n    pubkey?: string | null;\n  }): Promise<NDKUser | null> {\n    if (identifier.npub) {\n      return this.ndk.getUser({ npub: identifier.npub });\n    } else if (identifier.nip05) {\n      const user = await this.ndk.getUserFromNip05(identifier.nip05);\n      return user ?? null;\n    } else if (identifier.pubkey) {\n      return this.ndk.getUser({ pubkey: identifier.pubkey });\n    }\n  \n    return null;\n  }\n\n  public async resolveNDKEvent(identifier: {\n    hex?: string | null;\n  }): Promise<NDKEvent | null> {\n    if (identifier.hex) {\n      return this.ndk.fetchEvent(identifier.hex);\n    }\n  \n    return null;\n  }\n\n  /**\n   * Convenience helper to fetch zap count for a profile.\n   * It determines the user based on the provided identifier and\n   * returns the number of zap receipts found (count, **not** total sats).\n   */\n  public async getZapCount(identifier: {\n    npub?: string;\n    nip05?: string;\n    pubkey?: string;\n  }): Promise<number> {\n    const user = await this.resolveNDKUser(identifier);\n    return user ? this.fetchZaps(user) : 0;\n  }\n\n  public async getProfile(user: NDKUser | null): Promise<NDKUserProfile | null> {\n    if (!user) return null;\n\n    await user.fetchProfile();\n\n    const profile = user.profile;\n\n    if (profile && (profile.picture === undefined || profile.picture === null)) {\n      profile.picture = DEFAULT_PROFILE_IMAGE;\n    }\n\n    return profile as NDKUserProfile;\n  }\n\n  public async getPost(eventId: string): Promise<NDKEvent | null> {\n    const event = await this.ndk.fetchEvent(eventId);\n    if (!event) return null;\n\n    // Fetch referenced events (like videos)\n    const referencedEvents = event.getMatchingTags('e');\n    if (referencedEvents.length > 0) {\n      const referencedEventIds = referencedEvents.map(tag => tag[1]);\n      await this.ndk.fetchEvents({\n        ids: referencedEventIds,\n      });\n    }\n\n    // Fetch video attachments\n    const videoTags = event.getMatchingTags('a');\n    for (const tag of videoTags) {\n      const mimeType = tag[1] as string;\n      const url = tag[2] as string;\n      if (mimeType?.startsWith('video/') && url) {\n        // Add the video URL to the event's content\n        event.content = event.content + `\\n${url}`;\n      }\n    }\n\n    return event;\n  }\n\n  public async fetchFollows(user: NDKUser): Promise<number> {\n    try {\n      // console.log('Fetching follows for user:', user.npub);\n      const follows = await user.followSet();\n      const count = follows.size;\n      // console.log('Follows count:', count);\n      return count;\n    } catch (error) {\n      // console.warn('Error fetching follows:', error);\n      return 0;\n    }\n  }\n\n  public async fetchFollowers(user: NDKUser): Promise<number> {\n    try {\n      // console.log('Fetching followers for user:', user.npub);\n      const events = await this.ndk.fetchEvents({\n        kinds: [NDKKind.Contacts],\n        '#p': [user.pubkey],\n      });\n\n      const authors = new Set<string>();\n      events.forEach((e) => authors.add(e.pubkey));\n      const count = authors.size;\n      // console.log('Followers count:', count);\n      return count;\n    } catch (error) {\n      // console.warn('Error fetching followers:', error);\n      return 0;\n    }\n  }\n\n  public async fetchNotesAndReplies(user: NDKUser): Promise<[number, number]> {\n    try {\n      // console.log('Fetching notes and replies for user:', user.npub);\n      const events = await this.ndk.fetchEvents({\n        kinds: [NDKKind.Text],\n        authors: [user.pubkey],\n        limit: 1000,\n      });\n\n      let replies = 0;\n      let notesCount = 0;\n\n      events.forEach(event => {\n        if (event) {\n          // Check if this is a reply (has 'e' tag that's not a mention)\n          const isReply = event.tags.some(\n            (tag: string[]) => tag[0] === 'e' && tag[3] !== 'mention'\n          );\n          if (isReply) {\n            replies++;\n          }\n          notesCount++;\n        }\n      });\n\n      const repliesFinal = replies;\n      const notesFinal = Math.max(0, notesCount - replies);\n      // console.log('Notes:', notesFinal, 'Replies:', repliesFinal);\n\n      return [notesFinal, repliesFinal];\n    } catch (error) {\n      // console.warn('Error fetching notes and replies:', error);\n      return [0, 0];\n    }\n\n  }\n\n  public async fetchZaps(user: NDKUser): Promise<number> {\n    try {\n      // console.log('Fetching zaps for user:', user.npub);\n      const events = await this.ndk.fetchEvents({\n        kinds: [9735], // Zap receipt\n        '#p': [user.pubkey],\n        limit: 1000,\n      });\n      const count = events.size;\n      // console.log('Zaps count:', count);\n      return count;\n    } catch (error) {\n      // console.warn('Error fetching zaps:', error);\n      return 0;\n    }\n  }\n\n\n  public getNDK(): NDK {\n    return this.ndk;\n  }\n\n  /**\n   * Check if a Nostr signer is available\n   * @returns boolean indicating if a signer is available\n   */\n  public hasSigner(): boolean {\n    // Check for NIP-07 browser extension\n    if (typeof window !== 'undefined' && (window as any).nostr) {\n      return true;\n    }\n    \n    // Check for stored private key\n    if (typeof window !== 'undefined' && typeof localStorage !== 'undefined' && localStorage.getItem(\"nostr_nsec\")) {\n      return true;\n    }\n    \n    // Check if NDK already has a signer\n    return !!this.ndk.signer;\n  }\n}\n"],"names":["utils","arr","index","numArgs","argsDefCode","i","collectionLength","funcDefCode","funcCallCode","__spreadArray","this","to","from","pack","l","ar","utils_1","require$$0","require$$1","a","b","len","_a","newAr","_b","func","_i","TaskCollection","argsNum","autoRebuild","initialTasks","awaitTasks","newVal","tasks","__createBinding","o","m","k","k2","desc","__exportStar","exports","p","x","require$$2","event","c","d","e","ev","argsArr","oev","fncs","EventEmitter","listener","evtmap","evt","evto","bindTo","bound","_this","keys","keysO","type","s","h","w","y","val","options","parse","fmtLong","fmtShort","str","match","n","ms","msAbs","plural","name","isPlural","env","createDebug","coerce","disable","enable","enabled","destroy","key","selectColor","namespace","hash","prevTime","enableOverride","namespacesCache","enabledCache","debug","args","self","curr","format","formatter","extend","v","delimiter","newDebug","namespaces","split","ns","matchesTemplate","search","template","searchIndex","templateIndex","starIndex","matchIndex","skip","formatArgs","save","load","useColors","localstorage","warned","module","lastC","r","define_process_env_default","formatters","error","number","bytes","lengths","exists","instance","checkFinished","output","out","min","crypto","u8a","createView","rotr","word","shift","isLE","utf8ToBytes","toBytes","data","concatBytes","arrays","sum","pad","wrapConstructor","hashCons","hashC","msg","tmp","randomBytes","bytesLength","setBigUint64","view","byteOffset","value","_32n","_u32_max","wh","wl","Hash","blockLen","outputLen","padOffset","buffer","pos","take","dataView","oview","outLen","state","res","length","finished","destroyed","Chi","Maj","SHA256_K","IV","SHA256_W","SHA2","A","B","C","D","E","F","G","H","offset","W15","W2","s0","s1","sigma1","T1","T2","sha256","SHA256","_0n","_1n","_2n","hexes","_","bytesToHex","hex","numberToHexUnpadded","num","hexToNumber","hexToBytes","array","j","hexByte","byte","bytesToNumberBE","bytesToNumberLE","numberToBytesBE","numberToBytesLE","numberToVarBytesBE","ensureBytes","title","expectedLength","equalBytes","b1","b2","bitLen","bitGet","bitSet","bitMask","u8n","u8fr","createHmacDrbg","hashLen","qByteLen","hmacFn","reset","reseed","seed","gen","sl","pred","validatorFns","object","validateObject","validators","optValidators","checkField","fieldName","isOptional","checkVal","_3n","_4n","_5n","_8n","mod","result","pow","power","modulo","pow2","invert","u","q","tonelliShanks","P","legendreC","Q","S","Z","p1div4","Fp","root","Q1div2","g","t2","ge","FpSqrt","c1","n2","nv","FIELD_FIELDS","validateField","field","initial","opts","map","FpPow","f","FpInvertBatch","nums","lastMultiplied","acc","inverted","nLength","nBitLength","_nBitLength","nByteLength","Field","ORDER","redef","BITS","BYTES","sqrtP","lhs","rhs","lst","getFieldBytesLength","fieldOrder","bitLength","getMinHashLength","mapHashToField","fieldLen","minLen","reduced","wNAF","bits","constTimeNegate","condition","item","neg","W","windows","windowSize","elm","points","base","window","precomputes","mask","maxNumber","shiftBy","wbits","offset1","offset2","cond1","cond2","precomputesMap","transform","comp","validateBasic","curve","validatePointOpts","ut.validateObject","endo","b2n","h2b","ut","DER","sBytes","rBytesLeft","sig","slice","shl","rhl","rl","weierstrassPoints","CURVE","_c","point","_isCompressed","ut.concatBytes","fromBytes","tail","weierstrassEquation","x2","x3","isWithinCurveOrder","assertGE","normPrivateKeyToScalar","wrapPrivateKey","ut.bytesToHex","ut.bytesToNumberBE","mod.mod","pointPrecomputes","assertPrjPoint","other","Point","px","py","pz","is0","toInv","privateKey","left","right","X1","Y1","Z1","X2","Y2","Z2","U1","U2","b3","X3","Y3","Z3","t0","t1","t3","t4","t5","wnaf","I","k1neg","k1","k2neg","k1p","k2p","scalar","fake","f1p","f2p","mul","iz","z","ax","ay","zz","cofactor","isTorsionFree","clearCofactor","isCompressed","_bits","validateOpts","weierstrass","curveDef","CURVE_ORDER","compressedLen","uncompressedLen","isValidFieldElement","modN","invN","mod.invert","cat","head","y2","isYOdd","numToNByteStr","ut.numberToBytesBE","isBiggerThanHalfOrder","HALF","normalizeS","slcNum","Signature","recovery","msgHash","rec","bits2int_modN","radj","prefix","R","ir","u1","u2","ut.hexToBytes","mod.getMinHashLength","mod.mapHashToField","getPublicKey","isProbPub","getSharedSecret","privateA","publicB","bits2int","delta","ORDER_MASK","ut.bitMask","int2octets","prepSig","defaultSigOpts","lowS","prehash","ent","h1int","seedArgs","k2sig","kBytes","ik","normS","defaultVerOpts","sign","privKey","ut.createHmacDrbg","verify","signature","publicKey","sg","_sig","derError","is","_key","assertHash","buf","assertExists","assertBytes","oHash","iHash","hmac","message","HMAC","getHash","msgs","createCurve","defHash","create","secp256k1P","secp256k1N","divNearest","sqrtMod","_6n","_11n","_22n","_23n","_44n","_88n","b6","b9","b11","b22","b44","b88","b176","b220","b223","secp256k1","a1","a2","POW_2_128","c2","TAGGED_HASH_PREFIXES","taggedHash","tag","messages","tagP","tagH","pointToBytes","numTo32b","modP","GmulAdd","schnorrGetExtPubKey","priv","d_","lift_x","xx","challenge","schnorrGetPublicKey","schnorrSign","auxRand","t","rand","k_","rx","schnorrVerify","pub","schnorr","bool","wrap","encode","decode","alphabet","digits","input","letter","separator","chr","end","normalize","fn","carry","done","digit","digitBase","padding","revPadding","abc","block","pre","chk","words","encodingConst","encoding","ENCODING_CONST","_words","fromWords","toWords","fromWordsUnsafe","limit","actualLength","lowered","sepIndex","decodeUnsafe","decodeToBytes","bech32","utf8","isBytes","defaults","diff","params","box","sbox","T0","T3","T01","T23","sbox2","idx","abytes","k32","Nk","subByte","xk","encKey","s2","s3","encrypt","rounds","decrypt","dst","plaintext","pcks5","remaining","lastByte","tmp32","paddingByte","cbc","iv","_out","n32","ciphertext","ps0","ps1","ps2","ps3","o0","o1","o2","o3","core","sigma","nonce","counter","b32","isAligned","d32","o32","pos32","posj","allowShortKeys","extendNonceFn","counterLength","counterRight","anumber","abool","toClean","nonceNcLen","nc","cnt","y00","y01","y02","y03","y04","y05","y06","y07","y08","y09","y10","y11","y12","y13","y14","y15","x00","x01","x02","x03","x04","x05","x06","x07","x08","x09","x10","x11","x12","x13","x14","x15","oi","ikm","salt","prk","info","blocks","okm","HMACTmp","T","target","all","obj","i2","Queue","url","sortedArray","found","compare","start","mid","cmp","__publicField","newNode","target2","secretKey","getEventHash","valid","eventHash","kind","kindAsArray","filter","tagName","values","filters","json","sliced","pstart","pend","id","pubkey","relayURL","resolve","ch","handler","relay","reason","sub","ep","cr","reject","err","subid","so","alreadyHave","payload","ok","signAuthEvent","timeout","ret","subscription","relays","requests","set","_knownIds","subs","eosesReceived","handleEose","closesReceived","handleClose","localAlreadyHaveEventHandler","have","allOpened","reason2","relaysLength","req","subcloser","events","conn","BECH32_REGEX","uint8Array","nip19code","nip19","tlv","bytesToHex2","_d","_e","_f","_g","rest","profile","kindArray","addr","entries","vs","entry","text","privkey","bytesToHex3","normalizedKey","ctb64","ivb64","NIP05_REGEX","fetchImplementation","domain","query","fullname","nip05","maybeParent","maybeRoot","eTagEventId","eTagRelayUrl","eTagMarker","eTagAuthor","eventPointer","ref","author","count","nibble","unsigned","difficulty","now2","bytesToHex4","sha2562","wrapEvent","privkeyA","pubkeyB","sharedX","secp256k12","hkdf_extract","sha2563","conversationKey","hkdf_expand","nextPower","chunk","unpadded","unpaddedLen","suffix","concatBytes2","padded","aad","combined","plen","base642","dlen","vers","randomBytes2","chacha_key","chacha_nonce","hmac_key","mac","calculatedMac","rumor","recipientPublicKey","seal","randomKey","senderPrivateKey","recipientsPublicKeys","senderPublicKey","wrappeds","recipientPrivateKey","unwrappedSeal","wrappedEvents","unwrappedEvents","recipients","conversationTitle","replyTo","baseEvent","relayUrl","recipient","reposted","tags","lastETag","lastPTag","skipVerification","pointer","repostedEvent","uri","reacted","inheritedTags","content","max","prevIndex","prefixLen","matches","shortcode","replacer","username","proof","connectionString","pathname","searchParams","secret","invoice","encryptedContent","eventTemplate","char","metadata","lnurl","lud06","lud16","bech322","body","amount","comment","zr","zapRequestString","zapRequest","preimage","bolt11","paidAt","tagsFromZapRequest","zap","loginUrl","httpMethod","includeAuthorizationScheme","signedEvent","base643","token","method","eventB64","urlTag","methodTag","sha2564","bytesToHex5","payloadTag","payloadHash","asciis","asciiToBase16","hl","al","ai","hi","n1","arg","computed","scalars","prev","fieldN","zero","MASK","buckets","lastBits","resI","sumI","dataLen","ut.numberToHexUnpadded","lenLen","first","isLong","lengthBytes","int","ut.abytes","seqBytes","seqLeftBytes","rBytes","rLeftBytes","sLeftBytes","rs","ss","seq","Fn","ut.inRange","N","ut.isBytes","ut.aInRange","toAffineMemo","assertValidMemo","sc","sqrtError","cl","ul","isHex","isObj","LRUCacheNode_1","entryExpirationTimeInMS","next","onEntryEvicted","onEntryMarkedAsMostRecentlyUsed","clone","cloneFn","isExpired","LRUCache_1","maxSize","entryOptions","currentNodeForKey","node","callback","expiredNodes","assertNumber","chain","join","convertRadix","gcd","radix2carry","convertRadix2","radix","radix2","unsafeWrapper","checksum","newChecksum","oldChecksum","genBase58","XMR_BLOCK_LEN","base58check","BECH_ALPHABET","POLYMOD_GENERATORS","bech32Polymod","bechChecksum","genBech32","CODERS","coderTypeError","bytesToString","stringToBytes","NDKKind2","ndk","authors","relaysWithCount","writeRelays","pubkeys","pubkeysToRelays","authorsMissingRelays","preferredRelays","pool","connectedRelays","relayToAuthorsMap","sortedRelays","addAuthorToRelay","authorsInRelay","authorRelays","missingRelayCount","authorRelay","relayGoalPerAuthor","urls","normalized","urlString","protocol","stripHash","mediaType","isBase64","mimeType","normalizedMediaType","attribute","string","hasRelativeProtocol","urlObject","protocolRegex","lastIndex","protocolAtIndex","intermediate","remnant","pathComponents","lastComponent","oldUrlString","ndkRelay","timeoutMs","reconnect","cmd","_rest","event2","firstEp","authPolicy","authenticate","durations","avg","variance","notice","attempt","reconnectDelay","_err","subId","relaySub","publishConnected","_result","timeoutPromise","onConnectHandler","connectResolve","connectReject","onError","onFinally","closeOnEose","elements","lastResult","filterWithLimit","fingerprint","topSubManager","oldSubId","part","prevStatus","delay","delayType","existingDelayType","timeUntilFire","currentTime","timer","_reason","mergedFilters","filterCount","allFiltersAtIndex","generalSubManager","filterFp","sub2","_sub","_filters","currentVal","validatedCount","_nonValidatedCount","newRatio","factor","errors","publishedToRelays","intendedRelaySet","_NDKRelaySet","relayUrls","connect","temporaryRelay","requiredRelayCount","isEphemeral2","relayPublishedHandler","promises","timeoutId","success","authorWriteRelays","relayHints","pTags","authorToRelaysMap","authors2","authorFilterAndRelayPubkeyIntersection","tags1","tags2","tagMap","generateKey","isContained","smaller","larger","processTag","existingTag","hashtags","tagIds","hashtag","tagRegex","addTagIfNew","entity","newTags","_nip19Id","signer","scheme","encrypted","currentSigner","currentRecipient","sender","cachedEvent","decrypted","currentSender","currentScheme","searchTag","rootEventTag","matchingTags","replyTag2","hasMarkers2","replyTag","marker","hint","subOpts","rootTag","maxRelayCount","nip192","publish","includeSig","includeId","serializedEvent","eventArray","eventId","record","_persist","serialized","enqueue","LRUCache","persist","prevVerification","_NDKEvent","EventEmitter2","user","markerUrl","iTag","kTag","skipAuthorTag","forceTag","pTag","alt","tagNames","nostrEvent","relaySet","eTags","rawEvent","clientTag","authorMutedEntry","eventTagReference","eventMutedEntry","dTag","dTagId","reply","carryOverTags","rootTags","rootKind","extra","relayHint","uppercaseTag","EventEmitter3","blacklistedRelayUrls","debug8","removeIfUnusedAfter","relayAlreadyInPool","existingTimer","isAlreadyInPool","isBlacklisted","isCustomRelayUrl","noticeHandler","connectHandler","readyHandler","disconnectHandler","flappingHandler","authHandler","authedHandler","normalizedUrl","temporary","relaysToConnect","connectPromise","maybeEmitConnect","allConnected","someConnected","flappingRelaysCount","totalRelays","currentBackoff","stats","image","summary","timestamp","proofs","cs","mint","tokenIds","context","_value","article","taggedBech32","articleTag","identifier","nip193","parts","imeta","ndkEvent","titleTag","useCache","decryptedContent","_tagValue","mark","position","currentList","encryptedTags","encryptedIndex","ids","nip33Queries","debug2","proofTags","firstProof","rawP2pk","_unit","total","eTagCount","pTagCount","mintTagCount","member","scope","access","positionStr","dimensionStr","width","height","props","style","rotation","propValue","dimTag","dimensions","durTag","duration","stickers","sticker","stickerToAdd","stickerCount","dimension2","currency","term","perk","thumbnail","isPortrait","dur","eventWrappingMap","klass2","klass","decoded","nip194","EventEmitter4","emitCachedEvents","cacheResult","updateStateFromCacheResults","wrappedEvent","loadFromRelays","sinceTimestamp","filters2","fromCache","optimisticPublish","eventAlreadySeen","timeSinceFirstSeen","wrapped","lastEventSeen","hasSeenAllEoses","queryFilled","performEose","timeToWaitForNextEose","connectedRelaysWithFilters","percentageOfRelaysThatHaveSentEose","sendEoseTimeout","outbox","contactListEvent","_fetch","fetchOpts","names","nip46","_NDKUser","nip195","npub2","promiseWithTimeout","promise","userProfile","mintListEvent","mintList","nip05Id","skipCache","storeProfileEvent","setMetadataEvent","follows2","newFollow","currentFollowList","follow","newUserFollowList","foundUser","profilePointer","_NDKRelayList","contactList","relayList","readRelays","config","relayConfig","_NDKPrivateKeySigner","privateKeyOrNsec","nip196","recipientHexPubKey","nip44","nip04","senderHexPubKey","payloadString","createDebug2","signer2","_NDKNip07Signer","waitTimeout","debug5","activeRelays","nip","counterpartyHexpubkey","retries","currentItem","errorMessage","timerId","intervalId","EventEmitter5","parsedEvent","remoteUser","otherEncryptionType","parsedContent","remotePubkey","localUser","cb","request","responseHandler","response","parsed","SignerClass","errorMsg","_NDKNip46Signer","EventEmitter6","userOrConnectionToken","localSigner","connectionToken","bunkerUrl","bunkerPubkey","userPubkey","connectParams","_reject","peer","email","event1","relayLists","fromContactList","cachedList","list","relayListEvents","contactListEvents","subscribeOpts","existingEvent","EventEmitter7","LRUCache2","items","outboxItem","_skipCache","current","subscriptions","matchingSubs","createDebug3","userRelays","prevEvent","muteList","nip197","originalEvent","fallback","d4","relaySet2","fetchMaybeWithRelayHint","fallbackFetchPromise","fallbackRelaySet","resolve2","fallbackEvent","_name","maxConcurrency","EventEmitter8","debug7","worker2","urlOrRelay","relayAuthPolicy","differentUser","newSigner","connections","autoStart","eventsHandler","cachedEvents","idOrFilter","relaySetOrRelay","fetchedEvent","relaySetSubscription","onEvent","_event","dedupKey","wallet","createDebug4","_NostrService","newRelays","referencedEvents","referencedEventIds","videoTags","replies","notesCount","repliesFinal"],"mappings":"sbACA,OAAO,eAAe,MAAS,aAAc,CAAE,MAAO,EAAI,CAAE,6DCA5D,OAAO,eAAeA,QAAS,aAAc,CAAE,MAAO,EAAI,CAAE,EACjCA,QAAA,oBAAG,OAC9B,SAAS,oBAAoBC,EAAKC,EAAO,CACjCA,IAAU,KAEVA,IAAU,EACVD,EAAI,MAAO,EACNC,IAAUD,EAAI,OAAS,EAC5BA,EAAI,OAASA,EAAI,OAAS,EAE1BA,EAAI,OAAOC,EAAO,CAAC,EAC3B,CAC2BF,QAAA,oBAAG,6DCZ9B,OAAO,eAAc,QAAU,aAAc,CAAE,MAAO,GAAM,EAC5D,QAAA,uBAAiC,QAA8B,oBAAA,QAAA,eAAyB,QAA2B,iBAAA,OACnH,QAA4B,iBAAA,UAAY,GACxC,IAAI,iBAAmB,KACvB,SAAS,oBAAoBG,EAAS,CAClC,IAAIC,EAAc,GAClB,GAAID,IAAY,EACZ,OAAOC,EACX,QAASC,EAAI,EAAGA,EAAIF,EAAU,EAAG,EAAEE,EAC/BD,GAAgB,MAAQ,OAAOC,CAAC,EAAI,KAExC,OAAAD,GAAgB,MAAQ,OAAOD,EAAU,CAAC,EACnCC,EAEX,SAAS,sBAAsBA,EAAaE,EAAkB,CAE1D,QADIC,EAAc,GAAIC,EAAe,GAC5BH,EAAI,EAAGA,EAAIC,EAAkB,EAAED,EACpCE,GAAe,QAAQ,OAAOF,EAAG,gBAAgB,EAAE,OAAOA,EAAG;AAAA,CAAM,EACnEG,GAAgB,IAAI,OAAOH,EAAG,GAAG,EAAE,OAAOD,EAAa;AAAA,CAAK,EAEhE,MAAO,CAAE,YAAaG,EAAa,aAAcC,CAAc,EAEnE,SAAS,8BAA8BF,EAAkB,CAErD,QADIC,EAAc,GAAIC,EAAe,GAC5BH,EAAI,EAAGA,EAAIC,EAAkB,EAAED,EACpCE,GAAe,QAAQ,OAAOF,EAAG,gBAAgB,EAAE,OAAOA,EAAG;AAAA,CAAM,EACnEG,GAAgB,IAAI,OAAOH,EAAG;AAAA,CAAgC,EAElE,MAAO,CAAE,YAAaE,EAAa,aAAcC,CAAc,EAEnE,SAAS,eAAe,WAAY,aAAc,CAC9C,GAAI,WAAW,SAAW,EACtB,OAAO,QAAQ,iBACd,GAAI,WAAW,SAAW,EAC3B,OAAO,WAAW,CAAC,EACvB,IAAI,gBACJ,GAAI,WAAW,OAAS,iBAAkB,CACtC,IAAI,YAAc,oBAAoB,YAAY,EAC9C,GAAK,sBAAsB,YAAa,WAAW,MAAM,EAAG,YAAc,GAAG,YAAa,aAAe,GAAG,aAChH,gBAAkB;AAAA,cAAwC,OAAO,YAAa;AAAA;AAAA,8BAAsE,EAAE,OAAO,YAAa;AAAA,iBAAuB,EAAE,OAAO,aAAc;AAAA;AAAA,WAA+B,MAEtP,CACD,IAAI,YAAc,oBAAoB,YAAY,EAE9C,WAAW,OAAS,KAAO,EAC3B,gBAAkB;AAAA,mCAA6D,OAAO,YAAa;AAAA;AAAA,uCAAoH,EAAE,OAAO,YAAa;AAAA,yCAA8C,EAAE,OAAO,YAAa;AAAA,yCAA8C,EAAE,OAAO,YAAa;AAAA,yCAA8C,EAAE,OAAO,YAAa;AAAA,yCAA8C,EAAE,OAAO,YAAa;AAAA,yCAA8C,EAAE,OAAO,YAAa;AAAA,yCAA8C,EAAE,OAAO,YAAa;AAAA,yCAA8C,EAAE,OAAO,YAAa;AAAA,yCAA8C,EAAE,OAAO,YAAa;AAAA,yCAA8C,EAAE,OAAO,YAAa;AAAA;AAAA;AAAA,eAAgE,EAE54B,WAAW,OAAS,IAAM,EAC/B,gBAAkB;AAAA,mCAA6D,OAAO,YAAa;AAAA;AAAA,uCAAmH,EAAE,OAAO,YAAa;AAAA,yCAA8C,EAAE,OAAO,YAAa;AAAA,yCAA8C,EAAE,OAAO,YAAa;AAAA,yCAA8C,EAAE,OAAO,YAAa;AAAA;AAAA;AAAA,eAAgE,EAEnf,WAAW,OAAS,IAAM,EAC/B,gBAAkB;AAAA,mCAA6D,OAAO,YAAa;AAAA;AAAA,uCAAmH,EAAE,OAAO,YAAa;AAAA,yCAA8C,EAAE,OAAO,YAAa;AAAA,yCAA8C,EAAE,OAAO,YAAa;AAAA;AAAA;AAAA,eAAgE,EAGpb,gBAAkB;AAAA,mCAA6D,OAAO,YAAa;AAAA;AAAA,uCAAgH,EAAE,OAAO,YAAa;AAAA;AAAA;AAAA,eAAgE,EAGjT,CAMI,IAAI,YAAc,KAAK,eAAe,EACtC,OAAO,YAAY,UAAU,GAGrC,QAAA,eAAyB,eACzB,SAAS,oBAAoB,WAAY,aAAc,CACnD,GAAI,WAAW,SAAW,EACtB,OAAO,QAAQ,iBACd,GAAI,WAAW,SAAW,EAC3B,OAAO,WAAW,CAAC,EACvB,IAAI,gBACJ,GAAI,WAAW,OAAS,iBAAkB,CACtC,IAAI,YAAc,oBAAoB,YAAY,EAC9C,GAAK,sBAAsB,YAAa,WAAW,MAAM,EAAG,YAAc,GAAG,YAAa,aAAe,GAAG,aAChH,gBAAkB;AAAA,cAAwC,OAAO,YAAa;AAAA;AAAA,8BAAsE,EAAE,OAAO,YAAa;AAAA,sCAA4C,EAAE,OAAO,aAAc;AAAA;AAAA,WAAmC,MAE/Q,CACD,IAAI,YAAc,oBAAoB,YAAY,EAClD,gBAAkB;AAAA,+BAAyD,OAAO,YAAa;AAAA;AAAA;AAAA,iDAAgL,EAAE,OAAO,YAAa;AAAA;AAAA;AAAA;AAAA,WAAmG,EAE5Y,CAMI,IAAI,YAAc,KAAK,eAAe,EACtC,OAAO,YAAY,UAAU,GAGrC,QAAA,oBAA8B,oBAC9B,SAAS,uBAAuB,WAAY,CACxC,GAAI,WAAW,SAAW,EACtB,OAAO,QAAQ,iBACd,GAAI,WAAW,SAAW,EAC3B,OAAO,WAAW,CAAC,EACvB,IAAI,gBACJ,GAAI,WAAW,OAAS,iBAAkB,CACtC,IAAI,GAAK,8BAA8B,WAAW,MAAM,EAAG,YAAc,GAAG,YAAa,aAAe,GAAG,aAC3G,gBAAkB;AAAA,cAAwC,OAAO,YAAa;AAAA;AAAA;AAAA,iBAA2F,EAAE,OAAO,aAAc;AAAA;AAAA,WAA+B,OAG/N,gBAAkB;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,YAEtB,CAMI,IAAI,YAAc,KAAK,eAAe,EACtC,OAAO,YAAY,UAAU,GAGrC,QAAA,uBAAiC,yCCrHjC,IAAIC,gBAAiBC,gBAAQA,eAAK,eAAkB,SAAUC,EAAIC,EAAMC,EAAM,CAC1E,GAAIA,GAAQ,UAAU,SAAW,EAAG,QAASR,EAAI,EAAGS,EAAIF,EAAK,OAAQG,EAAIV,EAAIS,EAAGT,KACxEU,GAAM,EAAEV,KAAKO,MACRG,IAAIA,EAAK,MAAM,UAAU,MAAM,KAAKH,EAAM,EAAGP,CAAC,GACnDU,EAAGV,CAAC,EAAIO,EAAKP,CAAC,GAGtB,OAAOM,EAAG,OAAOI,GAAM,MAAM,UAAU,MAAM,KAAKH,CAAI,CAAC,CAC3D,EACA,OAAO,eAAe,eAAS,aAAc,CAAE,MAAO,EAAI,CAAE,EACtC,eAAA,eAAG,OACzB,IAAII,UAAUC,QACV,kBAAoBC,eACxB,SAAS,eAAeC,EAAGC,EAA0B,CACjD,IAAIC,EAAM,KAAK,OACf,GAAIA,EAAM,EACN,GAAID,EAAG,CACH,IAAIE,GACHA,EAAK,KAAK,QAAQ,KAAK,MAAMA,EAAI,SAAS,EAC3C,KAAK,QAAU,UAAU,MACrC,MAEY,KAAK,OAAO,KAAKH,CAAC,EAClB,KAAK,iBAILC,EAAG,CACH,GAAIC,IAAQ,EAAG,CACX,IAAIE,EAAQ,MAAM,EAAI,UAAU,MAAM,EACtCA,EAAM,KAAKA,CAAK,EAChBA,EAAM,KAAK,MAAMA,EAAO,SAAS,EACjC,KAAK,OAASA,CAC9B,KACiB,CACD,IAAIA,EAAQ,MAAM,UAAU,MAAM,EAClCA,EAAM,KAAK,MAAMA,EAAO,SAAS,EACjC,KAAK,OAASA,CAC9B,CACY,KAAK,QAAU,UAAU,MACrC,MAEgBF,IAAQ,EACR,KAAK,OAAS,CAAC,KAAK,OAAQF,CAAC,EAE7B,KAAK,OAASA,EAClB,KAAK,QAGjB,CACA,SAAS,aAAaA,EAAGC,EAA0B,CAC/C,IAAIC,EAAM,KAAK,OACf,GAAIA,EAAM,EACN,GAAID,EAAG,CACH,IAAIE,GACHA,EAAK,KAAK,QAAQ,KAAK,MAAMA,EAAI,SAAS,EAC3C,KAAK,QAAU,UAAU,MACrC,MAEY,KAAK,OAAO,KAAKH,CAAC,EAClB,KAAK,iBAILC,EAAG,CACH,GAAIC,IAAQ,EAAG,CACX,IAAIE,EAAQ,MAAM,EAAI,UAAU,MAAM,EACtCA,EAAM,KAAKA,CAAK,EAChBA,EAAM,KAAK,MAAMA,EAAO,SAAS,EACjC,KAAK,OAASA,CAC9B,KACiB,CACD,IAAIA,EAAQ,MAAM,UAAU,MAAM,EAClCA,EAAM,KAAK,MAAMA,EAAO,SAAS,EACjC,KAAK,OAASA,CAC9B,CACY,KAAK,QAAU,UAAU,MACrC,MAEgBF,IAAQ,EACR,KAAK,OAAS,CAAC,KAAK,OAAQF,CAAC,EAE7B,KAAK,OAASA,EAClB,KAAK,SAGT,KAAK,uBACL,KAAK,KAAO,sBAEZ,KAAK,QAAS,CACtB,CACA,SAAS,qBAAqBA,EAAG,CACzB,KAAK,SAAW,IAEhB,KAAK,SAAW,EACZ,KAAK,SAAWA,IAChB,KAAK,OAAS,OAIdH,UAAQ,qBAAqB,KAAK,OAAQ,KAAK,OAAO,YAAYG,CAAC,CAAC,EACpE,KAAK,OAAO,SAAW,GACvB,KAAK,OAAS,KAAK,OAAO,CAAC,EAC3B,KAAK,OAAS,GAGd,KAAK,OAAS,KAAK,OAAO,QAEtC,CACA,SAAS,mBAAmBA,EAAG,CAC3B,GAAI,KAAK,SAAW,EAEpB,IAAI,KAAK,SAAW,EAIhB,GAHI,KAAK,SAAWA,IAChB,KAAK,OAAS,GAEd,KAAK,uBAAwB,CAC7B,KAAK,KAAO,kBAAkB,iBAC9B,MACZ,KACa,CACD,KAAK,QAAS,EACd,MACZ,QAGYH,UAAQ,qBAAqB,KAAK,OAAQ,KAAK,OAAO,YAAYG,CAAC,CAAC,EACpE,KAAK,OAAO,SAAW,GACvB,KAAK,OAAS,KAAK,OAAO,CAAC,EAC3B,KAAK,OAAS,GAGd,KAAK,OAAS,KAAK,OAAO,OAE9B,KAAK,uBACL,KAAK,KAAO,sBAEZ,KAAK,QAAS,EACtB,CACA,SAAS,iBAAiBjB,EAAO,CAG7B,QAFIsB,EACAC,EAAO,CAAE,EACJC,EAAK,EAAGA,EAAK,UAAU,OAAQA,IACpCD,EAAKC,EAAK,CAAC,EAAI,UAAUA,CAAE,EAE3B,KAAK,SAAW,GAChB,KAAK,OAASD,EACd,KAAK,OAAS,GAET,KAAK,SAAW,GACrBA,EAAK,QAAQ,KAAK,MAAM,EACxB,KAAK,OAASA,EACd,KAAK,OAAS,KAAK,OAAO,UAGzBD,EAAK,KAAK,QAAQ,OAAO,MAAMA,EAAIf,gBAAc,CAACP,EAAO,CAAC,EAAGuB,EAAM,EAAK,CAAC,EAC1E,KAAK,OAAS,KAAK,OAAO,OAElC,CACA,SAAS,eAAevB,EAAO,CAG3B,QAFIsB,EACAC,EAAO,CAAE,EACJC,EAAK,EAAGA,EAAK,UAAU,OAAQA,IACpCD,EAAKC,EAAK,CAAC,EAAI,UAAUA,CAAE,EAE3B,KAAK,SAAW,GAChB,KAAK,OAASD,EACd,KAAK,OAAS,GAET,KAAK,SAAW,GACrBA,EAAK,QAAQ,KAAK,MAAM,EACxB,KAAK,OAASA,EACd,KAAK,OAAS,KAAK,OAAO,UAGzBD,EAAK,KAAK,QAAQ,OAAO,MAAMA,EAAIf,gBAAc,CAACP,EAAO,CAAC,EAAGuB,EAAM,EAAK,CAAC,EAC1E,KAAK,OAAS,KAAK,OAAO,QAE1B,KAAK,uBACL,KAAK,KAAO,sBAEZ,KAAK,QAAS,CACtB,CACA,SAAS,iBAAkB,CACnB,KAAK,SAAW,EAChB,KAAK,KAAO,kBAAkB,iBACzB,KAAK,SAAW,EACrB,KAAK,KAAO,KAAK,OAEjB,KAAK,QAAW,kBAAkB,gBAAgB,KAAK,OAAQ,KAAK,OAAO,CACnF,CACA,SAAS,eAAgB,CACjB,KAAK,SAAW,EAChB,KAAK,KAAO,kBAAkB,iBACzB,KAAK,SAAW,EACrB,KAAK,KAAO,KAAK,OAEjB,KAAK,QAAW,kBAAkB,qBAAqB,KAAK,OAAQ,KAAK,OAAO,CACxF,CACA,SAAS,uBAAwB,CAC7B,KAAK,QAAS,EACd,KAAK,KAAK,MAAM,OAAW,SAAS,CACxC,CACA,IAAI,eAAgC,UAAY,CAC5C,SAASE,EAAeC,EAASC,EAAaC,EAAcC,EAAY,CAChEF,IAAgB,SAAUA,EAAc,IACxCC,IAAiB,SAAUA,EAAe,MAC1CC,IAAe,SAAUA,EAAa,IAC1C,KAAK,WAAaA,EAClB,KAAK,KAAO,kBAAkB,iBAC9B,KAAK,QAAUH,EACf,KAAK,uBAAyB,GAC1BG,EACA,KAAK,QAAU,cAAc,KAAK,IAAI,EAEtC,KAAK,QAAU,gBAAgB,KAAK,IAAI,EAC5C,KAAK,eAAeF,CAAW,EAC3BC,EACI,OAAOA,GAAiB,YACxB,KAAK,OAASA,EACd,KAAK,OAAS,IAGd,KAAK,OAASA,EACd,KAAK,OAASA,EAAa,SAI/B,KAAK,OAAS,KACd,KAAK,OAAS,GAEdD,GACA,KAAK,QAAS,CAC1B,CACI,OAAOF,CACX,IACsB,eAAA,eAAG,eACzB,SAAS,WAAY,CACjB,KAAK,OAAS,KACd,KAAK,OAAS,EACd,KAAK,KAAO,kBAAkB,gBAClC,CACA,SAAS,OAAQ,CACb,KAAK,OAAS,KACd,KAAK,OAAS,EACd,KAAK,KAAO,kBAAkB,gBAClC,CACA,SAAS,YAAYC,EAAS,CACtB,KAAK,QAAUA,IACf,KAAK,QAAUA,EACX,KAAK,uBACL,KAAK,KAAO,sBAEZ,KAAK,QAAS,EAE1B,CACA,SAAS,eAAeI,EAAQ,CACxBA,GACA,KAAK,KAAO,aAAa,KAAK,IAAI,EAClC,KAAK,OAAS,eAAe,KAAK,IAAI,EACtC,KAAK,WAAa,mBAAmB,KAAK,IAAI,IAG9C,KAAK,KAAO,eAAe,KAAK,IAAI,EACpC,KAAK,OAAS,iBAAiB,KAAK,IAAI,EACxC,KAAK,WAAa,qBAAqB,KAAK,IAAI,EAExD,CAEA,SAAS,cAAe,CACpB,OAAI,KAAK,SAAW,EACT,CAAE,EACT,KAAK,SAAW,EACT,CAAC,KAAK,MAAM,EAChB,KAAK,MAChB,CACA,SAAS,SAASC,EAAO,CACjBA,EAAM,SAAW,GACjB,KAAK,OAAS,EACd,KAAK,KAAO,kBAAkB,kBAEzBA,EAAM,SAAW,GACtB,KAAK,OAAS,EACd,KAAK,KAAOA,EAAM,CAAC,EACnB,KAAK,OAASA,EAAM,CAAC,IAGrB,KAAK,OAASA,EAAM,OACpB,KAAK,OAASA,EACV,KAAK,uBACL,KAAK,KAAO,sBAEZ,KAAK,QAAS,EAE1B,CACA,eAAe,UAAU,UAAY,UACrC,eAAe,UAAU,MAAQ,MACjC,eAAe,UAAU,YAAc,YACvC,eAAe,UAAU,eAAiB,eAC1C,eAAe,UAAU,aAAe,aACxC,eAAe,UAAU,SAAW,sBC5SpC,IAAIC,EAAmBxB,gBAAQA,eAAK,kBAAqB,OAAO,OAAU,SAASyB,EAAGC,EAAGC,EAAGC,EAAI,CACxFA,IAAO,SAAWA,EAAKD,GAC3B,IAAIE,EAAO,OAAO,yBAAyBH,EAAGC,CAAC,GAC3C,CAACE,IAAS,QAASA,EAAO,CAACH,EAAE,WAAaG,EAAK,UAAYA,EAAK,iBAClEA,EAAO,CAAE,WAAY,GAAM,IAAK,UAAW,CAAE,OAAOH,EAAEC,CAAC,EAAM,GAE/D,OAAO,eAAeF,EAAGG,EAAIC,CAAI,CACpC,EAAK,SAASJ,EAAGC,EAAGC,EAAGC,EAAI,CACpBA,IAAO,SAAWA,EAAKD,GAC3BF,EAAEG,CAAE,EAAIF,EAAEC,CAAC,IAEXG,EAAgB9B,gBAAQA,eAAK,cAAiB,SAAS0B,EAAGK,EAAS,CACnE,QAASC,KAAKN,EAAOM,IAAM,WAAa,CAAC,OAAO,UAAU,eAAe,KAAKD,EAASC,CAAC,GAAGR,EAAgBO,EAASL,EAAGM,CAAC,CAC3H,EACD,OAAO,eAAcD,EAAU,aAAc,CAAE,MAAO,GAAM,EAC5DD,EAAavB,eAA8BwB,CAAO,mCCflD,OAAO,eAAe,MAAS,aAAc,CAAE,MAAO,EAAI,CAAE,EAC7C,MAAA,QAAG,OAClB,SAAS,SAAU,CACf,IAAIE,EAAI,CAAE,EACV,OAAAA,EAAE,UAAY,KACPA,CACX,CACe,MAAA,QAAG,QCPlB,IAAI,cAAiBjC,gBAAQA,eAAK,eAAkB,SAAUC,EAAIC,EAAMC,EAAM,CAC1E,GAAIA,GAAQ,UAAU,SAAW,EAAG,QAASR,EAAI,EAAGS,EAAIF,EAAK,OAAQG,EAAIV,EAAIS,EAAGT,KACxEU,GAAM,EAAEV,KAAKO,MACRG,IAAIA,EAAK,MAAM,UAAU,MAAM,KAAKH,EAAM,EAAGP,CAAC,GACnDU,EAAGV,CAAC,EAAIO,EAAKP,CAAC,GAGtB,OAAOM,EAAG,OAAOI,GAAM,MAAM,UAAU,MAAM,KAAKH,CAAI,CAAC,CAC3D,EACA,OAAO,eAAe,GAAS,aAAc,CAAE,MAAO,EAAI,CAAE,EACxC,GAAA,aAAG,OACvB,IAAI,kBAAoBK,iBACpB,QAAUC,QACV,QAAU0B,MACd,SAAS,KAAKC,EAAO1B,EAAGC,EAAG0B,EAAGC,EAAGC,EAAG,CAChC,IAAIC,EAAK,KAAK,OAAOJ,CAAK,EAC1B,GAAII,EAAI,CACJ,GAAIA,EAAG,SAAW,EACd,MAAO,GACX,GAAIA,EAAG,QAAU,EACbA,EAAG,KAAK9B,EAAGC,EAAG0B,EAAGC,EAAGC,CAAC,MAEpB,CAED,QADI/C,EAAM,IAAI,MAAMgD,EAAG,OAAO,EACrB5C,EAAI,EAAGgB,EAAMpB,EAAI,OAAQI,EAAIgB,EAAK,EAAEhB,EACzCJ,EAAII,CAAC,EAAI,UAAUA,EAAI,CAAC,EAE5B4C,EAAG,KAAK,MAAM,OAAWhD,CAAG,CACxC,CACQ,MAAO,EACf,CACI,MAAO,EACX,CACA,SAAS,YAAY4C,EAAO1B,EAAGC,EAAG0B,EAAGC,EAAGC,EAAG,CACvC,IAAIC,EAAK,KAAK,OAAOJ,CAAK,EACtBK,EACJ,GAAID,IAAO,OAAW,CAClB,GAAIA,EAAG,SAAW,EACd,MAAO,GACX,GAAIA,EAAG,QAAU,EACbA,EAAG,KAAK9B,EAAGC,EAAG0B,EAAGC,EAAGC,CAAC,MAEpB,CACDE,EAAU,IAAI,MAAMD,EAAG,OAAO,EAC9B,QAAS5C,EAAI,EAAGgB,EAAM6B,EAAQ,OAAQ7C,EAAIgB,EAAK,EAAEhB,EAC7C6C,EAAQ7C,CAAC,EAAI,UAAUA,EAAI,CAAC,EAEhC4C,EAAG,KAAK,MAAM,OAAWC,CAAO,CAC5C,CACA,CACI,IAAIC,EAAM,KAAK,WAAWN,CAAK,EAC/B,GAAIM,EAAK,CACL,GAAI,OAAOA,GAAQ,WAEf,GADA,KAAK,WAAWN,CAAK,EAAI,OACrB,UAAU,OAAS,EACnBM,EAAIhC,EAAGC,EAAG0B,EAAGC,EAAGC,CAAC,MAEhB,CACD,GAAIE,IAAY,OAAW,CACvBA,EAAU,IAAI,MAAM,UAAU,OAAS,CAAC,EACxC,QAAS7C,EAAI,EAAGgB,EAAM6B,EAAQ,OAAQ7C,EAAIgB,EAAK,EAAEhB,EAC7C6C,EAAQ7C,CAAC,EAAI,UAAUA,EAAI,CAAC,CAEpD,CACgB8C,EAAI,MAAM,OAAWD,CAAO,CAC5C,KAEa,CACD,IAAIE,EAAOD,EAEX,GADA,KAAK,WAAWN,CAAK,EAAI,OACrB,UAAU,OAAS,EACnB,QAASxC,EAAI,EAAGA,EAAI+C,EAAK,OAAQ,EAAE/C,EAC/B+C,EAAK/C,CAAC,EAAEc,EAAGC,EAAG0B,EAAGC,EAAGC,CAAC,MAGxB,CACD,GAAIE,IAAY,OAAW,CACvBA,EAAU,IAAI,MAAM,UAAU,OAAS,CAAC,EACxC,QAAS7C,EAAI,EAAGgB,EAAM6B,EAAQ,OAAQ7C,EAAIgB,EAAK,EAAEhB,EAC7C6C,EAAQ7C,CAAC,EAAI,UAAUA,EAAI,CAAC,CAEpD,CACgB,QAASA,EAAI,EAAGA,EAAI+C,EAAK,OAAQ,EAAE/C,EAC/B+C,EAAK/C,CAAC,EAAE,MAAM,OAAW6C,CAAO,CAEpD,CACA,CACQ,MAAO,EACf,CACI,OAAOD,IAAO,MAClB,CAEA,IAAI,aAA8B,UAAY,CAC1C,SAASI,GAAe,CACpB,KAAK,UAAa,QAAQ,SAAU,EACpC,KAAK,cAAiB,QAAQ,SAAU,EACxC,KAAK,YAAc,IAAI,IACvB,KAAK,aAAe,GAC5B,CACI,cAAO,eAAeA,EAAa,UAAW,eAAgB,CAC1D,IAAK,UAAY,CACb,OAAO,KAAK,WAAU,EAAG,MAC5B,EACD,WAAY,GACZ,aAAc,EACtB,CAAK,EACMA,CACX,IACoB,GAAA,aAAG,aACvB,SAAS,KAAKR,EAAOS,EAAU,CAI3B,OAHI,KAAK,OAAS,OACd,KAAK,KAAO,aAER,OAAO,KAAK,WAAWT,CAAK,EAAC,CACjC,IAAK,YACD,KAAK,WAAWA,CAAK,EAAIS,EACrB,OAAOT,GAAU,UACjB,KAAK,YAAY,IAAIA,CAAK,EAC9B,MACJ,IAAK,WACD,KAAK,WAAWA,CAAK,EAAI,CAAC,KAAK,WAAWA,CAAK,EAAGS,CAAQ,EAC1D,MACJ,IAAK,SACD,KAAK,WAAWT,CAAK,EAAE,KAAKS,CAAQ,CAChD,CACI,OAAO,IACX,CACA,SAAS,YAAYT,EAAOS,EAAU1B,EAAS,CAE3C,GADIA,IAAY,SAAUA,EAAU0B,EAAS,QACzC,OAAOA,GAAa,WACpB,MAAM,IAAI,UAAU,iCAAiC,EACzD,IAAIC,EAAS,KAAK,OAAOV,CAAK,EAC9B,OAAKU,GAMDA,EAAO,KAAKD,CAAQ,EACpBC,EAAO,YAAY3B,CAAO,EACtB,KAAK,eAAiB,KAAY,KAAK,cAAgB2B,EAAO,QAC9D,QAAQ,KAAK,gCAAiC,OAAO,OAAOV,CAAK,EAAG,UAAW,CAAC,IARpF,KAAK,OAAOA,CAAK,EAAI,IAAI,kBAAkB,eAAejB,EAAS,GAAM0B,EAAU,EAAK,EACpF,OAAOT,GAAU,UACjB,KAAK,YAAY,IAAIA,CAAK,GAQ3B,IACX,CACA,SAAS,eAAeA,EAAOS,EAAU,CACrC,IAAIE,EAAM,KAAK,OAAOX,CAAK,EACvBW,GACAA,EAAI,WAAWF,CAAQ,EAE3B,IAAIG,EAAO,KAAK,WAAWZ,CAAK,EAChC,OAAIY,IACI,OAAOA,GAAS,WAChB,KAAK,WAAWZ,CAAK,EAAI,OAEpB,OAAOY,GAAS,WACjBA,EAAK,SAAW,GAAKA,EAAK,CAAC,IAAMH,EACjC,KAAK,WAAWT,CAAK,EAAI,UAGrB,QAAQ,qBAAqBY,EAAMA,EAAK,YAAYH,CAAQ,CAAC,IAItE,IACX,CACA,SAAS,iBAAiBT,EAAOS,EAAUI,EAAQ9B,EAAS,CACpD8B,IAAW,SAAUA,EAAS,MAC9B9B,IAAY,SAAUA,EAAU0B,EAAS,QACxC,KAAK,aACN,KAAK,WAAa,IAAI,KAC1B,IAAIK,EAAQL,EAAS,KAAKI,CAAM,EAChC,YAAK,WAAW,IAAIJ,EAAUK,CAAK,EAC5B,KAAK,YAAYd,EAAOc,EAAO/B,CAAO,CACjD,CACA,SAAS,oBAAoBiB,EAAOS,EAAU,CAC1C,IAAIhC,EAAIE,EACJmC,GAASrC,EAAK,KAAK,cAAgB,MAAQA,IAAO,OAAS,OAASA,EAAG,IAAIgC,CAAQ,EACvF,OAAC9B,EAAK,KAAK,cAAgB,MAAQA,IAAO,QAAkBA,EAAG,OAAO8B,CAAQ,EACvE,KAAK,eAAeT,EAAOc,CAAK,CAC3C,CACA,SAAS,aAAad,EAAO,CACzB,OAAO,KAAK,OAAOA,CAAK,GAAK,CAAC,CAAC,KAAK,OAAOA,CAAK,EAAE,MACtD,CACA,SAAS,gBAAgBA,EAAOS,EAAU1B,EAAS,CAE/C,GADIA,IAAY,SAAUA,EAAU0B,EAAS,QACzC,OAAOA,GAAa,WACpB,MAAM,IAAI,UAAU,iCAAiC,EACzD,IAAIC,EAAS,KAAK,OAAOV,CAAK,EAC9B,MAAI,CAACU,GAAU,EAAEA,aAAkB,kBAAkB,iBACjDA,EAAS,KAAK,OAAOV,CAAK,EAAI,IAAI,kBAAkB,eAAejB,EAAS,GAAM0B,EAAU,EAAK,EAC7F,OAAOT,GAAU,UACjB,KAAK,YAAY,IAAIA,CAAK,IAG9BU,EAAO,OAAO,EAAGD,CAAQ,EACzBC,EAAO,YAAY3B,CAAO,EACtB,KAAK,eAAiB,KAAY,KAAK,cAAgB2B,EAAO,QAC9D,QAAQ,KAAK,gCAAiC,OAAO,OAAOV,CAAK,EAAG,UAAW,CAAC,GAEjF,IACX,CACA,SAAS,oBAAoBA,EAAOS,EAAU,CACtC,KAAK,OAAS,OACd,KAAK,KAAO,aAEhB,IAAIC,EAAS,KAAK,WAAWV,CAAK,EAClC,OAAKU,EAKI,OAAOA,GAAW,UACvB,KAAK,WAAWV,CAAK,EAAI,CAACS,EAAUC,CAAM,EACtC,OAAOV,GAAU,UACjB,KAAK,YAAY,IAAIA,CAAK,IAG9BU,EAAO,QAAQD,CAAQ,EACnB,KAAK,eAAiB,KAAY,KAAK,cAAgBC,EAAO,QAC9D,QAAQ,KAAK,gCAAiC,OAAO,OAAOV,CAAK,EAAG,eAAgB,CAAC,IAZzF,KAAK,WAAWA,CAAK,EAAI,CAACS,CAAQ,EAC9B,OAAOT,GAAU,UACjB,KAAK,YAAY,IAAIA,CAAK,GAa3B,IACX,CACA,SAAS,mBAAmBA,EAAO,CAC/B,OAAIA,IAAU,QACV,KAAK,UAAa,QAAQ,SAAU,EACpC,KAAK,cAAiB,QAAQ,SAAU,EACxC,KAAK,YAAc,IAAI,MAGvB,KAAK,OAAOA,CAAK,EAAI,OACrB,KAAK,WAAWA,CAAK,EAAI,OACrB,OAAOA,GAAU,UACjB,KAAK,YAAY,OAAOA,CAAK,GAE9B,IACX,CACA,SAAS,gBAAgB,EAAG,CACxB,YAAK,aAAe,EACb,IACX,CACA,SAAS,iBAAkB,CACvB,OAAO,KAAK,YAChB,CACA,SAAS,UAAUA,EAAO,CACtB,OAAI,KAAK,OAAS,KACP,KAAK,OAAOA,CAAK,EAAI,KAAK,OAAOA,CAAK,EAAE,eAAe,MAAO,EAAG,CAAE,EAEtE,KAAK,OAAOA,CAAK,GAAK,KAAK,WAAWA,CAAK,EACpC,cAAc,cAAc,CAAE,EAAE,KAAK,OAAOA,CAAK,EAAE,aAAY,EAAI,EAAI,EAAI,OAAO,KAAK,WAAWA,CAAK,GAAM,WAAa,CAAC,KAAK,WAAWA,CAAK,CAAC,EAAI,KAAK,WAAWA,CAAK,EAAI,EAAI,EAEpL,KAAK,OAAOA,CAAK,EACf,KAAK,OAAOA,CAAK,EAAE,aAAc,EACnC,KAAK,WAAWA,CAAK,EAClB,OAAO,KAAK,WAAWA,CAAK,GAAM,WAAa,CAAC,KAAK,WAAWA,CAAK,CAAC,EAAI,KAAK,WAAWA,CAAK,EAEhG,CAAE,CAErB,CACA,SAAS,YAAa,CAClB,IAAIe,EAAQ,KACZ,GAAI,KAAK,OAAS,KAAM,CACpB,IAAIC,EAAO,OAAO,KAAK,KAAK,MAAM,EAClC,OAAO,cAAc,cAAc,GAAIA,EAAM,EAAI,EAAG,MAAM,KAAK,KAAK,WAAW,EAAG,EAAI,EAAE,OAAO,SAAUlB,EAAG,CAAE,OAAQA,KAAKiB,EAAM,QAAWA,EAAM,OAAOjB,CAAC,GAAKiB,EAAM,OAAOjB,CAAC,EAAE,MAAO,CAAE,CAChM,KACS,CACD,IAAIkB,EAAO,OAAO,KAAK,KAAK,MAAM,EAAE,OAAO,SAAUlB,EAAG,CAAE,OAAOiB,EAAM,OAAOjB,CAAC,GAAKiB,EAAM,OAAOjB,CAAC,EAAE,OAAS,EACzGmB,EAAQ,OAAO,KAAK,KAAK,UAAU,EAAE,OAAO,SAAUnB,EAAG,CAAE,OAAOiB,EAAM,WAAWjB,CAAC,GAAKiB,EAAM,WAAWjB,CAAC,EAAE,OAAS,EAC1H,OAAO,cAAc,cAAc,cAAc,CAAE,EAAEkB,EAAM,EAAI,EAAGC,EAAO,EAAI,EAAG,MAAM,KAAK,KAAK,WAAW,EAAE,OAAO,SAAUnB,EAAG,CAAE,OAAUA,KAAKiB,EAAM,QAAWA,EAAM,OAAOjB,CAAC,GAAKiB,EAAM,OAAOjB,CAAC,EAAE,QAChMA,KAAKiB,EAAM,YAAeA,EAAM,WAAWjB,CAAC,GAAKiB,EAAM,WAAWjB,CAAC,EAAE,MAAW,CAAA,EAAG,EAAI,CACrG,CACA,CACA,SAAS,cAAcoB,EAAM,CACzB,OAAI,KAAK,OAAS,KACP,KAAK,OAAOA,CAAI,GAAK,KAAK,OAAOA,CAAI,EAAE,QAAU,GAEhD,KAAK,OAAOA,CAAI,GAAK,KAAK,OAAOA,CAAI,EAAE,QAAU,IAAM,KAAK,WAAWA,CAAI,GAAK,KAAK,WAAWA,CAAI,EAAE,QAAU,EAChI,CACA,aAAa,UAAU,KAAO,KAC9B,aAAa,UAAU,GAAK,YAC5B,aAAa,UAAU,KAAO,KAC9B,aAAa,UAAU,YAAc,YACrC,aAAa,UAAU,eAAiB,eACxC,aAAa,UAAU,iBAAmB,iBAC1C,aAAa,UAAU,oBAAsB,oBAC7C,aAAa,UAAU,aAAe,aACtC,aAAa,UAAU,gBAAkB,gBACzC,aAAa,UAAU,oBAAsB,oBAC7C,aAAa,UAAU,IAAM,eAC7B,aAAa,UAAU,mBAAqB,mBAC5C,aAAa,UAAU,gBAAkB,gBACzC,aAAa,UAAU,gBAAkB,gBACzC,aAAa,UAAU,UAAY,UACnC,aAAa,UAAU,WAAa,WACpC,aAAa,UAAU,cAAgB,2BCxSvC,IAAI7B,EAAmBxB,gBAAQA,eAAK,kBAAqB,OAAO,OAAU,SAASyB,EAAGC,EAAGC,EAAGC,EAAI,CACxFA,IAAO,SAAWA,EAAKD,GAC3B,IAAIE,EAAO,OAAO,yBAAyBH,EAAGC,CAAC,GAC3C,CAACE,IAAS,QAASA,EAAO,CAACH,EAAE,WAAaG,EAAK,UAAYA,EAAK,iBAClEA,EAAO,CAAE,WAAY,GAAM,IAAK,UAAW,CAAE,OAAOH,EAAEC,CAAC,EAAM,GAE/D,OAAO,eAAeF,EAAGG,EAAIC,CAAI,CACpC,EAAK,SAASJ,EAAGC,EAAGC,EAAGC,EAAI,CACpBA,IAAO,SAAWA,EAAKD,GAC3BF,EAAEG,CAAE,EAAIF,EAAEC,CAAC,IAEXG,EAAgB9B,gBAAQA,eAAK,cAAiB,SAAS0B,EAAGK,EAAS,CACnE,QAASC,KAAKN,EAAOM,IAAM,WAAa,CAAC,OAAO,UAAU,eAAe,KAAKD,EAASC,CAAC,GAAGR,EAAgBO,EAASL,EAAGM,CAAC,CAC3H,EACD,OAAO,eAAcD,EAAU,aAAc,CAAE,MAAO,GAAM,EAC5DD,EAAavB,MAAoBwB,CAAO,EACxCD,EAAatB,GAAiBuB,CAAO,qHCbrC,IAAIuB,EAAI,IACJ5B,EAAI4B,EAAI,GACRC,EAAI7B,EAAI,GACRW,EAAIkB,EAAI,GACRC,EAAInB,EAAI,EACRoB,EAAIpB,EAAI,OAgBZ,GAAiB,SAAUqB,EAAKC,EAAS,CACvCA,EAAUA,GAAW,CAAE,EACvB,IAAIN,EAAO,OAAOK,EAClB,GAAIL,IAAS,UAAYK,EAAI,OAAS,EACpC,OAAOE,EAAMF,CAAG,EACX,GAAIL,IAAS,UAAY,SAASK,CAAG,EAC1C,OAAOC,EAAQ,KAAOE,EAAQH,CAAG,EAAII,EAASJ,CAAG,EAEnD,MAAM,IAAI,MACR,wDACE,KAAK,UAAUA,CAAG,CACrB,CACF,EAUD,SAASE,EAAMG,EAAK,CAElB,GADAA,EAAM,OAAOA,CAAG,EACZ,EAAAA,EAAI,OAAS,KAGjB,KAAIC,EAAQ,mIAAmI,KAC7ID,CACD,EACD,GAAKC,EAGL,KAAIC,EAAI,WAAWD,EAAM,CAAC,CAAC,EACvBX,GAAQW,EAAM,CAAC,GAAK,MAAM,YAAa,EAC3C,OAAQX,EAAI,CACV,IAAK,QACL,IAAK,OACL,IAAK,MACL,IAAK,KACL,IAAK,IACH,OAAOY,EAAIR,EACb,IAAK,QACL,IAAK,OACL,IAAK,IACH,OAAOQ,EAAIT,EACb,IAAK,OACL,IAAK,MACL,IAAK,IACH,OAAOS,EAAI5B,EACb,IAAK,QACL,IAAK,OACL,IAAK,MACL,IAAK,KACL,IAAK,IACH,OAAO4B,EAAIV,EACb,IAAK,UACL,IAAK,SACL,IAAK,OACL,IAAK,MACL,IAAK,IACH,OAAOU,EAAIvC,EACb,IAAK,UACL,IAAK,SACL,IAAK,OACL,IAAK,MACL,IAAK,IACH,OAAOuC,EAAIX,EACb,IAAK,eACL,IAAK,cACL,IAAK,QACL,IAAK,OACL,IAAK,KACH,OAAOW,EACT,QACE,UAYN,SAASH,EAASI,EAAI,CACpB,IAAIC,EAAQ,KAAK,IAAID,CAAE,EACvB,OAAIC,GAAS9B,EACJ,KAAK,MAAM6B,EAAK7B,CAAC,EAAI,IAE1B8B,GAASZ,EACJ,KAAK,MAAMW,EAAKX,CAAC,EAAI,IAE1BY,GAASzC,EACJ,KAAK,MAAMwC,EAAKxC,CAAC,EAAI,IAE1ByC,GAASb,EACJ,KAAK,MAAMY,EAAKZ,CAAC,EAAI,IAEvBY,EAAK,KAWd,SAASL,EAAQK,EAAI,CACnB,IAAIC,EAAQ,KAAK,IAAID,CAAE,EACvB,OAAIC,GAAS9B,EACJ+B,EAAOF,EAAIC,EAAO9B,EAAG,KAAK,EAE/B8B,GAASZ,EACJa,EAAOF,EAAIC,EAAOZ,EAAG,MAAM,EAEhCY,GAASzC,EACJ0C,EAAOF,EAAIC,EAAOzC,EAAG,QAAQ,EAElCyC,GAASb,EACJc,EAAOF,EAAIC,EAAOb,EAAG,QAAQ,EAE/BY,EAAK,MAOd,SAASE,EAAOF,EAAIC,EAAOF,EAAGI,EAAM,CAClC,IAAIC,EAAWH,GAASF,EAAI,IAC5B,OAAO,KAAK,MAAMC,EAAKD,CAAC,EAAI,IAAMI,GAAQC,EAAW,IAAM,GAC7D,WC3JA,SAAS,MAAMC,EAAK,CACnBC,EAAY,MAAQA,EACpBA,EAAY,QAAUA,EACtBA,EAAY,OAASC,EACrBD,EAAY,QAAUE,EACtBF,EAAY,OAASG,EACrBH,EAAY,QAAUI,EACtBJ,EAAY,SAAWjE,UAAa,EACpCiE,EAAY,QAAUK,EAEtB,OAAO,KAAKN,CAAG,EAAE,QAAQO,GAAO,CAC/BN,EAAYM,CAAG,EAAIP,EAAIO,CAAG,CAC5B,CAAE,EAMDN,EAAY,MAAQ,CAAE,EACtBA,EAAY,MAAQ,CAAE,EAOtBA,EAAY,WAAa,CAAE,EAQ3B,SAASO,EAAYC,EAAW,CAC/B,IAAIC,EAAO,EAEX,QAAStF,EAAI,EAAGA,EAAIqF,EAAU,OAAQrF,IACrCsF,GAASA,GAAQ,GAAKA,EAAQD,EAAU,WAAWrF,CAAC,EACpDsF,GAAQ,EAGT,OAAOT,EAAY,OAAO,KAAK,IAAIS,CAAI,EAAIT,EAAY,OAAO,MAAM,CACtE,CACCA,EAAY,YAAcO,EAS1B,SAASP,EAAYQ,EAAW,CAC/B,IAAIE,EACAC,EAAiB,KACjBC,EACAC,EAEJ,SAASC,KAASC,EAAM,CAEvB,GAAI,CAACD,EAAM,QACV,OAGD,MAAME,EAAOF,EAGPG,EAAO,OAAO,IAAI,IAAM,EACxBvB,EAAKuB,GAAQP,GAAYO,GAC/BD,EAAK,KAAOtB,EACZsB,EAAK,KAAON,EACZM,EAAK,KAAOC,EACZP,EAAWO,EAEXF,EAAK,CAAC,EAAIf,EAAY,OAAOe,EAAK,CAAC,CAAC,EAEhC,OAAOA,EAAK,CAAC,GAAM,UAEtBA,EAAK,QAAQ,IAAI,EAIlB,IAAI/F,EAAQ,EACZ+F,EAAK,CAAC,EAAIA,EAAK,CAAC,EAAE,QAAQ,gBAAiB,CAACvB,EAAO0B,IAAW,CAE7D,GAAI1B,IAAU,KACb,MAAO,IAERxE,IACA,MAAMmG,EAAYnB,EAAY,WAAWkB,CAAM,EAC/C,GAAI,OAAOC,GAAc,WAAY,CACpC,MAAMjC,EAAM6B,EAAK/F,CAAK,EACtBwE,EAAQ2B,EAAU,KAAKH,EAAM9B,CAAG,EAGhC6B,EAAK,OAAO/F,EAAO,CAAC,EACpBA,GACL,CACI,OAAOwE,CACX,CAAI,EAGDQ,EAAY,WAAW,KAAKgB,EAAMD,CAAI,GAExBC,EAAK,KAAOhB,EAAY,KAChC,MAAMgB,EAAMD,CAAI,CACzB,CAEE,OAAAD,EAAM,UAAYN,EAClBM,EAAM,UAAYd,EAAY,UAAW,EACzCc,EAAM,MAAQd,EAAY,YAAYQ,CAAS,EAC/CM,EAAM,OAASM,EACfN,EAAM,QAAUd,EAAY,QAE5B,OAAO,eAAec,EAAO,UAAW,CACvC,WAAY,GACZ,aAAc,GACd,IAAK,IACAH,IAAmB,KACfA,GAEJC,IAAoBZ,EAAY,aACnCY,EAAkBZ,EAAY,WAC9Ba,EAAeb,EAAY,QAAQQ,CAAS,GAGtCK,GAER,IAAKQ,GAAK,CACTV,EAAiBU,CACrB,CACA,CAAG,EAGG,OAAOrB,EAAY,MAAS,YAC/BA,EAAY,KAAKc,CAAK,EAGhBA,CACT,CAEC,SAASM,EAAOZ,EAAWc,EAAW,CACrC,MAAMC,EAAWvB,EAAY,KAAK,WAAa,OAAOsB,EAAc,IAAc,IAAMA,GAAad,CAAS,EAC9G,OAAAe,EAAS,IAAM,KAAK,IACbA,CACT,CASC,SAASpB,EAAOqB,EAAY,CAC3BxB,EAAY,KAAKwB,CAAU,EAC3BxB,EAAY,WAAawB,EAEzBxB,EAAY,MAAQ,CAAE,EACtBA,EAAY,MAAQ,CAAE,EAEtB,MAAMyB,GAAS,OAAOD,GAAe,SAAWA,EAAa,IAC3D,KAAI,EACJ,QAAQ,IAAK,GAAG,EAChB,MAAM,GAAG,EACT,OAAO,OAAO,EAEhB,UAAWE,KAAMD,EACZC,EAAG,CAAC,IAAM,IACb1B,EAAY,MAAM,KAAK0B,EAAG,MAAM,CAAC,CAAC,EAElC1B,EAAY,MAAM,KAAK0B,CAAE,CAG7B,CAUC,SAASC,EAAgBC,EAAQC,EAAU,CAC1C,IAAIC,EAAc,EACdC,EAAgB,EAChBC,EAAY,GACZC,EAAa,EAEjB,KAAOH,EAAcF,EAAO,QAC3B,GAAIG,EAAgBF,EAAS,SAAWA,EAASE,CAAa,IAAMH,EAAOE,CAAW,GAAKD,EAASE,CAAa,IAAM,KAElHF,EAASE,CAAa,IAAM,KAC/BC,EAAYD,EACZE,EAAaH,EACbC,MAEAD,IACAC,aAESC,IAAc,GAExBD,EAAgBC,EAAY,EAC5BC,IACAH,EAAcG,MAEd,OAAO,GAKT,KAAOF,EAAgBF,EAAS,QAAUA,EAASE,CAAa,IAAM,KACrEA,IAGD,OAAOA,IAAkBF,EAAS,MACpC,CAQC,SAAS3B,GAAU,CAClB,MAAMsB,EAAa,CAClB,GAAGxB,EAAY,MACf,GAAGA,EAAY,MAAM,IAAIQ,GAAa,IAAMA,CAAS,CACxD,EAAI,KAAK,GAAG,EACV,OAAAR,EAAY,OAAO,EAAE,EACdwB,CACT,CASC,SAASpB,EAAQP,EAAM,CACtB,UAAWqC,KAAQlC,EAAY,MAC9B,GAAI2B,EAAgB9B,EAAMqC,CAAI,EAC7B,MAAO,GAIT,UAAWR,KAAM1B,EAAY,MAC5B,GAAI2B,EAAgB9B,EAAM6B,CAAE,EAC3B,MAAO,GAIT,MAAO,EACT,CASC,SAASzB,EAAOf,EAAK,CACpB,OAAIA,aAAe,MACXA,EAAI,OAASA,EAAI,QAElBA,CACT,CAMC,SAASmB,GAAU,CAClB,QAAQ,KAAK,uIAAuI,CACtJ,CAEC,OAAAL,EAAY,OAAOA,EAAY,MAAM,EAE9BA,CACR,CAEA,IAAA,OAAiB,8BC7RjBzC,EAAA,WAAqB4E,EACrB5E,EAAA,KAAe6E,EACf7E,EAAA,KAAe8E,EACf9E,EAAA,UAAoB+E,EACpB/E,EAAkB,QAAAgF,EAAa,EAC/BhF,EAAmB,SAAM,IAAA,CACxB,IAAIiF,EAAS,GAEb,MAAO,IAAM,CACPA,IACKA,EAAA,GACT,QAAQ,KAAK,uIAAuI,EAEtJ,CACD,GAAG,EAMHjF,EAAiB,OAAA,CAChB,UACA,UACA,UACA,UACA,UACA,UACA,UACA,UACA,UACA,UACA,UACA,UACA,UACA,UACA,UACA,UACA,UACA,UACA,UACA,UACA,UACA,UACA,UACA,UACA,UACA,UACA,UACA,UACA,UACA,UACA,UACA,UACA,UACA,UACA,UACA,UACA,UACA,UACA,UACA,UACA,UACA,UACA,UACA,UACA,UACA,UACA,UACA,UACA,UACA,UACA,UACA,UACA,UACA,UACA,UACA,UACA,UACA,UACA,UACA,UACA,UACA,UACA,UACA,UACA,UACA,UACA,UACA,UACA,UACA,UACA,UACA,UACA,UACA,UACA,UACA,SACD,EAWA,SAAS+E,GAAY,CAIhB,GAAA,OAAO,OAAW,KAAe,OAAO,UAAY,OAAO,QAAQ,OAAS,YAAc,OAAO,QAAQ,QACrG,MAAA,GAIJ,GAAA,OAAO,UAAc,KAAe,UAAU,WAAa,UAAU,UAAU,YAAY,EAAE,MAAM,uBAAuB,EACtH,MAAA,GAGJ,IAAApF,EAKI,OAAA,OAAO,SAAa,KAAe,SAAS,iBAAmB,SAAS,gBAAgB,OAAS,SAAS,gBAAgB,MAAM,kBAEtI,OAAO,OAAW,KAAe,OAAO,UAAY,OAAO,QAAQ,SAAY,OAAO,QAAQ,WAAa,OAAO,QAAQ,QAG1H,OAAO,UAAc,KAAe,UAAU,YAAcA,EAAI,UAAU,UAAU,YAAA,EAAc,MAAM,gBAAgB,IAAM,SAASA,EAAE,CAAC,EAAG,EAAE,GAAK,IAEpJ,OAAO,UAAc,KAAe,UAAU,WAAa,UAAU,UAAU,YAAA,EAAc,MAAM,oBAAoB,EAS1H,SAASiF,EAAWpB,EAAM,CAQrB,GAPCA,EAAA,CAAC,GAAK,KAAK,UAAY,KAAO,IAClC,KAAK,WACJ,KAAK,UAAY,MAAQ,KAC1BA,EAAK,CAAC,GACL,KAAK,UAAY,MAAQ,KAC1B,IAAM0B,EAAO,QAAQ,SAAS,KAAK,IAAI,EAEpC,CAAC,KAAK,UACT,OAGK,MAAA7E,EAAI,UAAY,KAAK,MAC3BmD,EAAK,OAAO,EAAG,EAAGnD,EAAG,gBAAgB,EAKrC,IAAI5C,EAAQ,EACR0H,EAAQ,EACZ3B,EAAK,CAAC,EAAE,QAAQ,cAAwBvB,GAAA,CACnCA,IAAU,OAGdxE,IACIwE,IAAU,OAGLkD,EAAA1H,GACT,CACA,EAEI+F,EAAA,OAAO2B,EAAO,EAAG9E,CAAC,EAWxBL,EAAc,IAAA,QAAQ,OAAS,QAAQ,MAAQ,IAAM,CAAC,GAQtD,SAAS6E,EAAKZ,EAAY,CACrB,GAAA,CACCA,EACKjE,EAAA,QAAQ,QAAQ,QAASiE,CAAU,EAEnCjE,EAAA,QAAQ,WAAW,OAAO,OAEpB,GAYjB,SAAS8E,GAAO,CACX,IAAAM,EACA,GAAA,CACCA,EAAApF,EAAQ,QAAQ,QAAQ,OAAO,OACpB,EAMhB,MAAI,CAACoF,GAAK,OAAO,QAAY,KAAe,QAAS,UACpDA,EAAIC,EAAY,OAGVD,EAcR,SAASJ,GAAe,CACnB,GAAA,CAGI,OAAA,kBACQ,GAMjBE,EAAA,QAAiB1G,OAAoBwB,CAAO,EAE5C,KAAM,CAAC,WAAAsF,GAAcJ,EAAO,QAM5BI,EAAW,EAAI,SAAUxB,EAAG,CACvB,GAAA,CACI,OAAA,KAAK,UAAUA,CAAC,QACfyB,EAAO,CACf,MAAO,+BAAiCA,EAAM,mIC7QhD,SAASC,SAAO,EAAG,CACf,GAAI,CAAC,OAAO,cAAc,CAAC,GAAK,EAAI,EAChC,MAAM,IAAI,MAAM,2BAA2B,CAAC,EAAE,CACtD,CAKA,SAASC,QAAM9G,KAAM+G,EAAS,CAC1B,GAAI,EAAE/G,aAAa,YACf,MAAM,IAAI,MAAM,qBAAqB,EACzC,GAAI+G,EAAQ,OAAS,GAAK,CAACA,EAAQ,SAAS/G,EAAE,MAAM,EAChD,MAAM,IAAI,MAAM,iCAAiC+G,CAAO,mBAAmB/G,EAAE,MAAM,EAAE,CAC7F,CACA,SAASuE,OAAKA,EAAM,CAChB,GAAI,OAAOA,GAAS,YAAc,OAAOA,EAAK,QAAW,WACrD,MAAM,IAAI,MAAM,iDAAiD,EACrEsC,SAAOtC,EAAK,SAAS,EACrBsC,SAAOtC,EAAK,QAAQ,CACxB,CACA,SAASyC,SAAOC,EAAUC,EAAgB,GAAM,CAC5C,GAAID,EAAS,UACT,MAAM,IAAI,MAAM,kCAAkC,EACtD,GAAIC,GAAiBD,EAAS,SAC1B,MAAM,IAAI,MAAM,uCAAuC,CAC/D,CACA,SAASE,SAAOC,EAAKH,EAAU,CAC3BH,QAAMM,CAAG,EACT,MAAMC,EAAMJ,EAAS,UACrB,GAAIG,EAAI,OAASC,EACb,MAAM,IAAI,MAAM,yDAAyDA,CAAG,EAAE,CAEtF,CChCO,MAAMC,SAAS,OAAO,YAAe,UAAY,WAAY,WAAa,WAAW,OAAS,OCArG,sEAQA,MAAMC,MAAOxH,GAAMA,aAAa,WAKnByH,aAAc3I,GAAQ,IAAI,SAASA,EAAI,OAAQA,EAAI,WAAYA,EAAI,UAAU,EAE7E4I,OAAO,CAACC,EAAMC,IAAWD,GAAS,GAAKC,EAAWD,IAASC,EAG3DC,OAAO,IAAI,WAAW,IAAI,YAAY,CAAC,SAAU,CAAC,EAAE,MAAM,EAAE,CAAC,IAAM,GAChF,GAAI,CAACA,OACD,MAAM,IAAI,MAAM,6CAA6C,EAuD1D,SAASC,cAAYxE,EAAK,CAC7B,GAAI,OAAOA,GAAQ,SACf,MAAM,IAAI,MAAM,oCAAoC,OAAOA,CAAG,EAAE,EACpE,OAAO,IAAI,WAAW,IAAI,YAAa,EAAC,OAAOA,CAAG,CAAC,CACvD,CAMO,SAASyE,UAAQC,EAAM,CAG1B,GAFI,OAAOA,GAAS,WAChBA,EAAOF,cAAYE,CAAI,GACvB,CAACR,MAAIQ,CAAI,EACT,MAAM,IAAI,MAAM,4BAA4B,OAAOA,CAAI,EAAE,EAC7D,OAAOA,CACX,CAIO,SAASC,iBAAeC,EAAQ,CACnC,MAAMxB,EAAI,IAAI,WAAWwB,EAAO,OAAO,CAACC,EAAKnI,IAAMmI,EAAMnI,EAAE,OAAQ,CAAC,CAAC,EACrE,IAAIoI,EAAM,EACV,OAAAF,EAAO,QAASlI,GAAM,CAClB,GAAI,CAACwH,MAAIxH,CAAC,EACN,MAAM,IAAI,MAAM,qBAAqB,EACzC0G,EAAE,IAAI1G,EAAGoI,CAAG,EACZA,GAAOpI,EAAE,MACjB,CAAK,EACM0G,CACX,CAEO,IAAA,OAAA,KAAW,CAEd,OAAQ,CACJ,OAAO,KAAK,WAAY,CAChC,CACA,EAQO,SAAS2B,kBAAgBC,EAAU,CACtC,MAAMC,EAASC,GAAQF,EAAU,EAAC,OAAOP,UAAQS,CAAG,CAAC,EAAE,OAAQ,EACzDC,EAAMH,EAAU,EACtB,OAAAC,EAAM,UAAYE,EAAI,UACtBF,EAAM,SAAWE,EAAI,SACrBF,EAAM,OAAS,IAAMD,EAAU,EACxBC,CACX,CAoBO,SAASG,cAAYC,EAAc,GAAI,CAC1C,GAAIpB,UAAU,OAAOA,SAAO,iBAAoB,WAC5C,OAAOA,SAAO,gBAAgB,IAAI,WAAWoB,CAAW,CAAC,EAE7D,MAAM,IAAI,MAAM,wCAAwC,CAC5D,CCrJA,SAASC,eAAaC,EAAMC,EAAYC,EAAOlB,EAAM,CACjD,GAAI,OAAOgB,EAAK,cAAiB,WAC7B,OAAOA,EAAK,aAAaC,EAAYC,EAAOlB,CAAI,EACpD,MAAMmB,EAAO,OAAO,EAAE,EAChBC,EAAW,OAAO,UAAU,EAC5BC,EAAK,OAAQH,GAASC,EAAQC,CAAQ,EACtCE,EAAK,OAAOJ,EAAQE,CAAQ,EAC5BnG,EAAI+E,EAAO,EAAI,EACflI,EAAIkI,EAAO,EAAI,EACrBgB,EAAK,UAAUC,EAAahG,EAAGoG,EAAIrB,CAAI,EACvCgB,EAAK,UAAUC,EAAanJ,EAAGwJ,EAAItB,CAAI,CAC3C,YAEO,cAAmBuB,MAAK,CAC3B,YAAYC,EAAUC,EAAWC,EAAW1B,EAAM,CAC9C,MAAO,EACP,KAAK,SAAWwB,EAChB,KAAK,UAAYC,EACjB,KAAK,UAAYC,EACjB,KAAK,KAAO1B,EACZ,KAAK,SAAW,GAChB,KAAK,OAAS,EACd,KAAK,IAAM,EACX,KAAK,UAAY,GACjB,KAAK,OAAS,IAAI,WAAWwB,CAAQ,EACrC,KAAK,KAAO5B,aAAW,KAAK,MAAM,CAC1C,CACI,OAAOO,EAAM,CACTf,SAAO,IAAI,EACX,KAAM,CAAE,KAAA4B,EAAM,OAAAW,EAAQ,SAAAH,CAAU,EAAG,KACnCrB,EAAOD,UAAQC,CAAI,EACnB,MAAM9H,EAAM8H,EAAK,OACjB,QAASyB,EAAM,EAAGA,EAAMvJ,GAAM,CAC1B,MAAMwJ,EAAO,KAAK,IAAIL,EAAW,KAAK,IAAKnJ,EAAMuJ,CAAG,EAEpD,GAAIC,IAASL,EAAU,CACnB,MAAMM,EAAWlC,aAAWO,CAAI,EAChC,KAAOqB,GAAYnJ,EAAMuJ,EAAKA,GAAOJ,EACjC,KAAK,QAAQM,EAAUF,CAAG,EAC9B,QAChB,CACYD,EAAO,IAAIxB,EAAK,SAASyB,EAAKA,EAAMC,CAAI,EAAG,KAAK,GAAG,EACnD,KAAK,KAAOA,EACZD,GAAOC,EACH,KAAK,MAAQL,IACb,KAAK,QAAQR,EAAM,CAAC,EACpB,KAAK,IAAM,EAE3B,CACQ,YAAK,QAAUb,EAAK,OACpB,KAAK,WAAY,EACV,IACf,CACI,WAAWX,EAAK,CACZJ,SAAO,IAAI,EACXG,SAAOC,EAAK,IAAI,EAChB,KAAK,SAAW,GAIhB,KAAM,CAAE,OAAAmC,EAAQ,KAAAX,EAAM,SAAAQ,EAAU,KAAAxB,CAAM,EAAG,KACzC,GAAI,CAAE,IAAA4B,CAAG,EAAK,KAEdD,EAAOC,GAAK,EAAI,IAChB,KAAK,OAAO,SAASA,CAAG,EAAE,KAAK,CAAC,EAE5B,KAAK,UAAYJ,EAAWI,IAC5B,KAAK,QAAQZ,EAAM,CAAC,EACpBY,EAAM,GAGV,QAASvK,EAAIuK,EAAKvK,EAAImK,EAAUnK,IAC5BsK,EAAOtK,CAAC,EAAI,EAIhB0J,eAAaC,EAAMQ,EAAW,EAAG,OAAO,KAAK,OAAS,CAAC,EAAGxB,CAAI,EAC9D,KAAK,QAAQgB,EAAM,CAAC,EACpB,MAAMe,EAAQnC,aAAWJ,CAAG,EACtBnH,EAAM,KAAK,UAEjB,GAAIA,EAAM,EACN,MAAM,IAAI,MAAM,6CAA6C,EACjE,MAAM2J,EAAS3J,EAAM,EACf4J,EAAQ,KAAK,IAAK,EACxB,GAAID,EAASC,EAAM,OACf,MAAM,IAAI,MAAM,oCAAoC,EACxD,QAAS5K,EAAI,EAAGA,EAAI2K,EAAQ3K,IACxB0K,EAAM,UAAU,EAAI1K,EAAG4K,EAAM5K,CAAC,EAAG2I,CAAI,CACjD,CACI,QAAS,CACL,KAAM,CAAE,OAAA2B,EAAQ,UAAAF,CAAS,EAAK,KAC9B,KAAK,WAAWE,CAAM,EACtB,MAAMO,EAAMP,EAAO,MAAM,EAAGF,CAAS,EACrC,YAAK,QAAS,EACPS,CACf,CACI,WAAWvK,EAAI,CACXA,IAAOA,EAAK,IAAI,KAAK,aACrBA,EAAG,IAAI,GAAG,KAAK,IAAG,CAAE,EACpB,KAAM,CAAE,SAAA6J,EAAU,OAAAG,EAAQ,OAAAQ,EAAQ,SAAAC,EAAU,UAAAC,EAAW,IAAAT,CAAG,EAAK,KAC/D,OAAAjK,EAAG,OAASwK,EACZxK,EAAG,IAAMiK,EACTjK,EAAG,SAAWyK,EACdzK,EAAG,UAAY0K,EACXF,EAASX,GACT7J,EAAG,OAAO,IAAIgK,CAAM,EACjBhK,CACf,CACA,EC3GA,MAAM2K,MAAM,CAACnK,EAAGC,EAAG0B,IAAO3B,EAAIC,EAAM,CAACD,EAAI2B,EAEnCyI,MAAM,CAACpK,EAAGC,EAAG0B,IAAO3B,EAAIC,EAAMD,EAAI2B,EAAM1B,EAAI0B,EAI5C0I,WAA2B,IAAI,YAAY,CAC7C,WAAY,WAAY,WAAY,WAAY,UAAY,WAAY,WAAY,WACpF,WAAY,UAAY,UAAY,WAAY,WAAY,WAAY,WAAY,WACpF,WAAY,WAAY,UAAY,UAAY,UAAY,WAAY,WAAY,WACpF,WAAY,WAAY,WAAY,WAAY,WAAY,WAAY,UAAY,UACpF,UAAY,UAAY,WAAY,WAAY,WAAY,WAAY,WAAY,WACpF,WAAY,WAAY,WAAY,WAAY,WAAY,WAAY,WAAY,UACpF,UAAY,UAAY,UAAY,UAAY,UAAY,WAAY,WAAY,WACpF,WAAY,WAAY,WAAY,WAAY,WAAY,WAAY,WAAY,UACxF,CAAC,EAGKC,KAAqB,IAAI,YAAY,CACvC,WAAY,WAAY,WAAY,WAAY,WAAY,WAAY,UAAY,UACxF,CAAC,EAGKC,WAA2B,IAAI,YAAY,EAAE,eACnD,cAAqBC,MAAK,CACtB,aAAc,CACV,MAAM,GAAI,GAAI,EAAG,EAAK,EAGtB,KAAK,EAAIF,KAAG,CAAC,EAAI,EACjB,KAAK,EAAIA,KAAG,CAAC,EAAI,EACjB,KAAK,EAAIA,KAAG,CAAC,EAAI,EACjB,KAAK,EAAIA,KAAG,CAAC,EAAI,EACjB,KAAK,EAAIA,KAAG,CAAC,EAAI,EACjB,KAAK,EAAIA,KAAG,CAAC,EAAI,EACjB,KAAK,EAAIA,KAAG,CAAC,EAAI,EACjB,KAAK,EAAIA,KAAG,CAAC,EAAI,CACzB,CACI,KAAM,CACF,KAAM,CAAE,EAAAG,EAAG,EAAAC,EAAG,EAAAC,EAAG,EAAAC,EAAG,EAAAC,EAAG,EAAAC,EAAG,EAAAC,EAAG,EAAAC,CAAC,EAAK,KACnC,MAAO,CAACP,EAAGC,EAAGC,EAAGC,EAAGC,EAAGC,EAAGC,EAAGC,CAAC,CACtC,CAEI,IAAIP,EAAGC,EAAGC,EAAGC,EAAGC,EAAGC,EAAGC,EAAGC,EAAG,CACxB,KAAK,EAAIP,EAAI,EACb,KAAK,EAAIC,EAAI,EACb,KAAK,EAAIC,EAAI,EACb,KAAK,EAAIC,EAAI,EACb,KAAK,EAAIC,EAAI,EACb,KAAK,EAAIC,EAAI,EACb,KAAK,EAAIC,EAAI,EACb,KAAK,EAAIC,EAAI,CACrB,CACI,QAAQnC,EAAMoC,EAAQ,CAElB,QAAS/L,EAAI,EAAGA,EAAI,GAAIA,IAAK+L,GAAU,EACnCV,WAASrL,CAAC,EAAI2J,EAAK,UAAUoC,EAAQ,EAAK,EAC9C,QAAS/L,EAAI,GAAIA,EAAI,GAAIA,IAAK,CAC1B,MAAMgM,EAAMX,WAASrL,EAAI,EAAE,EACrBiM,EAAKZ,WAASrL,EAAI,CAAC,EACnBkM,EAAK1D,OAAKwD,EAAK,CAAC,EAAIxD,OAAKwD,EAAK,EAAE,EAAKA,IAAQ,EAC7CG,EAAK3D,OAAKyD,EAAI,EAAE,EAAIzD,OAAKyD,EAAI,EAAE,EAAKA,IAAO,GACjDZ,WAASrL,CAAC,EAAKmM,EAAKd,WAASrL,EAAI,CAAC,EAAIkM,EAAKb,WAASrL,EAAI,EAAE,EAAK,CAC3E,CAEQ,GAAI,CAAE,EAAAuL,EAAG,EAAAC,EAAG,EAAAC,EAAG,EAAAC,EAAG,EAAAC,EAAG,EAAAC,EAAG,EAAAC,EAAG,EAAAC,CAAC,EAAK,KACjC,QAAS9L,EAAI,EAAGA,EAAI,GAAIA,IAAK,CACzB,MAAMoM,EAAS5D,OAAKmD,EAAG,CAAC,EAAInD,OAAKmD,EAAG,EAAE,EAAInD,OAAKmD,EAAG,EAAE,EAC9CU,EAAMP,EAAIM,EAASnB,MAAIU,EAAGC,EAAGC,CAAC,EAAIV,WAASnL,CAAC,EAAIqL,WAASrL,CAAC,EAAK,EAE/DsM,GADS9D,OAAK+C,EAAG,CAAC,EAAI/C,OAAK+C,EAAG,EAAE,EAAI/C,OAAK+C,EAAG,EAAE,GAC/BL,MAAIK,EAAGC,EAAGC,CAAC,EAAK,EACrCK,EAAID,EACJA,EAAID,EACJA,EAAID,EACJA,EAAKD,EAAIW,EAAM,EACfX,EAAID,EACJA,EAAID,EACJA,EAAID,EACJA,EAAKc,EAAKC,EAAM,CAC5B,CAEQf,EAAKA,EAAI,KAAK,EAAK,EACnBC,EAAKA,EAAI,KAAK,EAAK,EACnBC,EAAKA,EAAI,KAAK,EAAK,EACnBC,EAAKA,EAAI,KAAK,EAAK,EACnBC,EAAKA,EAAI,KAAK,EAAK,EACnBC,EAAKA,EAAI,KAAK,EAAK,EACnBC,EAAKA,EAAI,KAAK,EAAK,EACnBC,EAAKA,EAAI,KAAK,EAAK,EACnB,KAAK,IAAIP,EAAGC,EAAGC,EAAGC,EAAGC,EAAGC,EAAGC,EAAGC,CAAC,CACvC,CACI,YAAa,CACTT,WAAS,KAAK,CAAC,CACvB,CACI,SAAU,CACN,KAAK,IAAI,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,CAAC,EAC/B,KAAK,OAAO,KAAK,CAAC,CAC1B,CACA,EAoBO,MAAMkB,SAAyBpD,kBAAgB,IAAM,IAAIqD,QAAQ,EC3HxE,sEAKA,MAAMC,MAAM,OAAO,CAAC,EACdC,MAAM,OAAO,CAAC,EACdC,MAAM,OAAO,CAAC,EACdrE,MAAOxH,GAAMA,aAAa,WAC1B8L,QAAwB,MAAM,KAAK,CAAE,OAAQ,GAAK,EAAE,CAACC,EAAG7M,IAAMA,EAAE,SAAS,EAAE,EAAE,SAAS,EAAG,GAAG,CAAC,EAI5F,SAAS8M,aAAWjF,EAAO,CAC9B,GAAI,CAACS,MAAIT,CAAK,EACV,MAAM,IAAI,MAAM,qBAAqB,EAEzC,IAAIkF,EAAM,GACV,QAAS/M,EAAI,EAAGA,EAAI6H,EAAM,OAAQ7H,IAC9B+M,GAAOH,QAAM/E,EAAM7H,CAAC,CAAC,EAEzB,OAAO+M,CACX,CACO,SAASC,sBAAoBC,EAAK,CACrC,MAAMF,EAAME,EAAI,SAAS,EAAE,EAC3B,OAAOF,EAAI,OAAS,EAAI,IAAIA,CAAG,GAAKA,CACxC,CACO,SAASG,cAAYH,EAAK,CAC7B,GAAI,OAAOA,GAAQ,SACf,MAAM,IAAI,MAAM,4BAA8B,OAAOA,CAAG,EAE5D,OAAO,OAAOA,IAAQ,GAAK,IAAM,KAAKA,CAAG,EAAE,CAC/C,CAIO,SAASI,aAAWJ,EAAK,CAC5B,GAAI,OAAOA,GAAQ,SACf,MAAM,IAAI,MAAM,4BAA8B,OAAOA,CAAG,EAC5D,MAAM/L,EAAM+L,EAAI,OAChB,GAAI/L,EAAM,EACN,MAAM,IAAI,MAAM,0DAA4DA,CAAG,EACnF,MAAMoM,EAAQ,IAAI,WAAWpM,EAAM,CAAC,EACpC,QAAShB,EAAI,EAAGA,EAAIoN,EAAM,OAAQpN,IAAK,CACnC,MAAMqN,EAAIrN,EAAI,EACRsN,EAAUP,EAAI,MAAMM,EAAGA,EAAI,CAAC,EAC5BE,EAAO,OAAO,SAASD,EAAS,EAAE,EACxC,GAAI,OAAO,MAAMC,CAAI,GAAKA,EAAO,EAC7B,MAAM,IAAI,MAAM,uBAAuB,EAC3CH,EAAMpN,CAAC,EAAIuN,CACnB,CACI,OAAOH,CACX,CAEO,SAASI,kBAAgB3F,EAAO,CACnC,OAAOqF,cAAYJ,aAAWjF,CAAK,CAAC,CACxC,CACO,SAAS4F,kBAAgB5F,EAAO,CACnC,GAAI,CAACS,MAAIT,CAAK,EACV,MAAM,IAAI,MAAM,qBAAqB,EACzC,OAAOqF,cAAYJ,aAAW,WAAW,KAAKjF,CAAK,EAAE,QAAO,CAAE,CAAC,CACnE,CACO,SAAS6F,kBAAgB,EAAG1M,EAAK,CACpC,OAAOmM,aAAW,EAAE,SAAS,EAAE,EAAE,SAASnM,EAAM,EAAG,GAAG,CAAC,CAC3D,CACO,SAAS2M,kBAAgB,EAAG3M,EAAK,CACpC,OAAO0M,kBAAgB,EAAG1M,CAAG,EAAE,QAAS,CAC5C,CAEO,SAAS4M,qBAAmB,EAAG,CAClC,OAAOT,aAAWH,sBAAoB,CAAC,CAAC,CAC5C,CAUO,SAASa,cAAYC,EAAOf,EAAKgB,EAAgB,CACpD,IAAIlD,EACJ,GAAI,OAAOkC,GAAQ,SACf,GAAI,CACAlC,EAAMsC,aAAWJ,CAAG,CAChC,OACepK,EAAG,CACN,MAAM,IAAI,MAAM,GAAGmL,CAAK,mCAAmCf,CAAG,aAAapK,CAAC,EAAE,CAC1F,SAEa2F,MAAIyE,CAAG,EAGZlC,EAAM,WAAW,KAAKkC,CAAG,MAGzB,OAAM,IAAI,MAAM,GAAGe,CAAK,mCAAmC,EAE/D,MAAM9M,EAAM6J,EAAI,OAChB,GAAI,OAAOkD,GAAmB,UAAY/M,IAAQ+M,EAC9C,MAAM,IAAI,MAAM,GAAGD,CAAK,aAAaC,CAAc,eAAe/M,CAAG,EAAE,EAC3E,OAAO6J,CACX,CAIO,SAAS9B,iBAAeC,EAAQ,CACnC,MAAMxB,EAAI,IAAI,WAAWwB,EAAO,OAAO,CAACC,EAAKnI,IAAMmI,EAAMnI,EAAE,OAAQ,CAAC,CAAC,EACrE,IAAIoI,EAAM,EACV,OAAAF,EAAO,QAASlI,GAAM,CAClB,GAAI,CAACwH,MAAIxH,CAAC,EACN,MAAM,IAAI,MAAM,qBAAqB,EACzC0G,EAAE,IAAI1G,EAAGoI,CAAG,EACZA,GAAOpI,EAAE,MACjB,CAAK,EACM0G,CACX,CACO,SAASwG,aAAWC,EAAIC,EAAI,CAE/B,GAAID,EAAG,SAAWC,EAAG,OACjB,MAAO,GACX,QAASlO,EAAI,EAAGA,EAAIiO,EAAG,OAAQjO,IAC3B,GAAIiO,EAAGjO,CAAC,IAAMkO,EAAGlO,CAAC,EACd,MAAO,GACf,MAAO,EACX,CAIO,SAAS4I,cAAYxE,EAAK,CAC7B,GAAI,OAAOA,GAAQ,SACf,MAAM,IAAI,MAAM,oCAAoC,OAAOA,CAAG,EAAE,EACpE,OAAO,IAAI,WAAW,IAAI,YAAa,EAAC,OAAOA,CAAG,CAAC,CACvD,CAMO,SAAS+J,SAAO,EAAG,CACtB,IAAInN,EACJ,IAAKA,EAAM,EAAG,EAAIyL,MAAK,IAAMC,MAAK1L,GAAO,EACrC,CACJ,OAAOA,CACX,CAMO,SAASoN,SAAO,EAAG7D,EAAK,CAC3B,OAAQ,GAAK,OAAOA,CAAG,EAAKmC,KAChC,CAIO,MAAM2B,SAAS,CAAC,EAAG9D,EAAKV,IACpB,GAAMA,EAAQ6C,MAAMD,QAAQ,OAAOlC,CAAG,EAMpC+D,UAAW,IAAO3B,OAAO,OAAO,EAAI,CAAC,GAAKD,MAEjD6B,MAAOzF,GAAS,IAAI,WAAWA,CAAI,EACnC0F,OAAQ5O,GAAQ,WAAW,KAAKA,CAAG,EAQlC,SAAS6O,iBAAeC,EAASC,EAAUC,EAAQ,CACtD,GAAI,OAAOF,GAAY,UAAYA,EAAU,EACzC,MAAM,IAAI,MAAM,0BAA0B,EAC9C,GAAI,OAAOC,GAAa,UAAYA,EAAW,EAC3C,MAAM,IAAI,MAAM,2BAA2B,EAC/C,GAAI,OAAOC,GAAW,WAClB,MAAM,IAAI,MAAM,2BAA2B,EAE/C,IAAI1I,EAAIqI,MAAIG,CAAO,EACf1M,EAAIuM,MAAIG,CAAO,EACf1O,EAAI,EACR,MAAM6O,EAAQ,IAAM,CAChB3I,EAAE,KAAK,CAAC,EACRlE,EAAE,KAAK,CAAC,EACRhC,EAAI,CACP,EACK4D,EAAI,IAAI7C,IAAM6N,EAAO5M,EAAGkE,EAAG,GAAGnF,CAAC,EAC/B+N,EAAS,CAACC,EAAOR,UAAU,CAE7BvM,EAAI4B,EAAE4K,OAAK,CAAC,CAAI,CAAC,EAAGO,CAAI,EACxB7I,EAAItC,EAAC,EACDmL,EAAK,SAAW,IAEpB/M,EAAI4B,EAAE4K,OAAK,CAAC,CAAI,CAAC,EAAGO,CAAI,EACxB7I,EAAItC,EAAC,EACR,EACKoL,EAAM,IAAM,CAEd,GAAIhP,KAAO,IACP,MAAM,IAAI,MAAM,yBAAyB,EAC7C,IAAIgB,EAAM,EACV,MAAMmH,EAAM,CAAE,EACd,KAAOnH,EAAM2N,GAAU,CACnBzI,EAAItC,EAAG,EACP,MAAMqL,EAAK/I,EAAE,MAAO,EACpBiC,EAAI,KAAK8G,CAAE,EACXjO,GAAOkF,EAAE,MACrB,CACQ,OAAO6C,cAAY,GAAGZ,CAAG,CAC5B,EAUD,MATiB,CAAC4G,EAAMG,IAAS,CAC7BL,EAAO,EACPC,EAAOC,CAAI,EACX,IAAIlE,EACJ,KAAO,EAAEA,EAAMqE,EAAKF,EAAK,CAAA,IACrBF,EAAQ,EACZ,OAAAD,EAAO,EACAhE,CACV,CAEL,CAEA,MAAMsE,eAAe,CACjB,OAASpL,GAAQ,OAAOA,GAAQ,SAChC,SAAWA,GAAQ,OAAOA,GAAQ,WAClC,QAAUA,GAAQ,OAAOA,GAAQ,UACjC,OAASA,GAAQ,OAAOA,GAAQ,SAChC,mBAAqBA,GAAQ,OAAOA,GAAQ,UAAYA,aAAe,WACvE,cAAgBA,GAAQ,OAAO,cAAcA,CAAG,EAChD,MAAQA,GAAQ,MAAM,QAAQA,CAAG,EACjC,MAAO,CAACA,EAAKqL,IAAWA,EAAO,GAAG,QAAQrL,CAAG,EAC7C,KAAOA,GAAQ,OAAOA,GAAQ,YAAc,OAAO,cAAcA,EAAI,SAAS,CAClF,EAEO,SAASsL,iBAAeD,EAAQE,EAAYC,EAAgB,CAAA,EAAI,CACnE,MAAMC,EAAa,CAACC,EAAW/L,EAAMgM,IAAe,CAChD,MAAMC,EAAWR,eAAazL,CAAI,EAClC,GAAI,OAAOiM,GAAa,WACpB,MAAM,IAAI,MAAM,sBAAsBjM,CAAI,sBAAsB,EACpE,MAAMK,EAAMqL,EAAOK,CAAS,EAC5B,GAAI,EAAAC,GAAc3L,IAAQ,SAEtB,CAAC4L,EAAS5L,EAAKqL,CAAM,EACrB,MAAM,IAAI,MAAM,iBAAiB,OAAOK,CAAS,CAAC,IAAI1L,CAAG,KAAK,OAAOA,CAAG,eAAeL,CAAI,EAAE,CAEpG,EACD,SAAW,CAAC+L,EAAW/L,CAAI,IAAK,OAAO,QAAQ4L,CAAU,EACrDE,EAAWC,EAAW/L,EAAM,EAAK,EACrC,SAAW,CAAC+L,EAAW/L,CAAI,IAAK,OAAO,QAAQ6L,CAAa,EACxDC,EAAWC,EAAW/L,EAAM,EAAI,EACpC,OAAO0L,CACX,mnBChQA,sEAIA,MAAM3C,MAAM,OAAO,CAAC,EAAGC,MAAM,OAAO,CAAC,EAAGC,MAAM,OAAO,CAAC,EAAGiD,MAAM,OAAO,CAAC,EAEjEC,MAAM,OAAO,CAAC,EAAGC,MAAM,OAAO,CAAC,EAAGC,MAAM,OAAO,CAAC,EAE1C,OAAO,CAAC,EAAU,OAAO,EAAE,EAEhC,SAASC,MAAIlP,EAAGC,EAAG,CACtB,MAAMkP,EAASnP,EAAIC,EACnB,OAAOkP,GAAUxD,MAAMwD,EAASlP,EAAIkP,CACxC,CAQO,SAASC,MAAIjD,EAAKkD,EAAOC,EAAQ,CACpC,GAAIA,GAAU3D,OAAO0D,EAAQ1D,MACzB,MAAM,IAAI,MAAM,2BAA2B,EAC/C,GAAI2D,IAAW1D,MACX,OAAOD,MACX,IAAI5B,EAAM6B,MACV,KAAOyD,EAAQ1D,OACP0D,EAAQzD,QACR7B,EAAOA,EAAMoC,EAAOmD,GACxBnD,EAAOA,EAAMA,EAAOmD,EACpBD,IAAUzD,MAEd,OAAO7B,CACX,CAEO,SAASwF,OAAK/N,EAAG6N,EAAOC,EAAQ,CACnC,IAAIvF,EAAMvI,EACV,KAAO6N,KAAU1D,OACb5B,GAAOA,EACPA,GAAOuF,EAEX,OAAOvF,CACX,CAEO,SAASyF,SAAO1I,EAAQwI,EAAQ,CACnC,GAAIxI,IAAW6E,OAAO2D,GAAU3D,MAC5B,MAAM,IAAI,MAAM,6CAA6C7E,CAAM,QAAQwI,CAAM,EAAE,EAIvF,IAAItP,EAAIkP,MAAIpI,EAAQwI,CAAM,EACtBrP,EAAIqP,EAEJ9N,EAAImK,MAAc8D,EAAI7D,MAC1B,KAAO5L,IAAM2L,OAAK,CAEd,MAAM+D,EAAIzP,EAAID,EACR0G,EAAIzG,EAAID,EACRiB,EAAIO,EAAIiO,EAAIC,EAGlBzP,EAAID,EAAGA,EAAI0G,EAAGlF,EAAIiO,EAAUA,EAAIxO,CACxC,CAEI,GADYhB,IACA2L,MACR,MAAM,IAAI,MAAM,wBAAwB,EAC5C,OAAOsD,MAAI1N,EAAG8N,CAAM,CACxB,CASO,SAASK,gBAAcC,EAAG,CAM7B,MAAMC,GAAaD,EAAIhE,OAAOC,MAC9B,IAAIiE,EAAGC,EAAGC,EAGV,IAAKF,EAAIF,EAAIhE,MAAKmE,EAAI,EAAGD,EAAIjE,QAAQF,MAAKmE,GAAKjE,MAAKkE,IAChD,CAEJ,IAAKC,EAAInE,MAAKmE,EAAIJ,GAAKR,MAAIY,EAAGH,EAAWD,CAAC,IAAMA,EAAIhE,MAAKoE,IACrD,CAEJ,GAAID,IAAM,EAAG,CACT,MAAME,GAAUL,EAAIhE,OAAOmD,MAC3B,OAAO,SAAqBmB,EAAI1M,EAAG,CAC/B,MAAM2M,EAAOD,EAAG,IAAI1M,EAAGyM,CAAM,EAC7B,GAAI,CAACC,EAAG,IAAIA,EAAG,IAAIC,CAAI,EAAG3M,CAAC,EACvB,MAAM,IAAI,MAAM,yBAAyB,EAC7C,OAAO2M,CACV,CACT,CAEI,MAAMC,GAAUN,EAAIlE,OAAOC,MAC3B,OAAO,SAAqBqE,EAAI1M,EAAG,CAE/B,GAAI0M,EAAG,IAAI1M,EAAGqM,CAAS,IAAMK,EAAG,IAAIA,EAAG,GAAG,EACtC,MAAM,IAAI,MAAM,yBAAyB,EAC7C,IAAIxJ,EAAIqJ,EAEJM,EAAIH,EAAG,IAAIA,EAAG,IAAIA,EAAG,IAAKF,CAAC,EAAGF,CAAC,EAC/BtO,EAAI0O,EAAG,IAAI1M,EAAG4M,CAAM,EACpBnQ,EAAIiQ,EAAG,IAAI1M,EAAGsM,CAAC,EACnB,KAAO,CAACI,EAAG,IAAIjQ,EAAGiQ,EAAG,GAAG,GAAG,CACvB,GAAIA,EAAG,IAAIjQ,EAAGiQ,EAAG,IAAI,EACjB,OAAOA,EAAG,KAEd,IAAI,EAAI,EACR,QAASI,EAAKJ,EAAG,IAAIjQ,CAAC,EAAG,EAAIyG,GACrB,CAAAwJ,EAAG,IAAII,EAAIJ,EAAG,GAAG,EADO,IAG5BI,EAAKJ,EAAG,IAAII,CAAE,EAGlB,MAAMC,EAAKL,EAAG,IAAIG,EAAGzE,OAAO,OAAOlF,EAAI,EAAI,CAAC,CAAC,EAC7C2J,EAAIH,EAAG,IAAIK,CAAE,EACb/O,EAAI0O,EAAG,IAAI1O,EAAG+O,CAAE,EAChBtQ,EAAIiQ,EAAG,IAAIjQ,EAAGoQ,CAAC,EACf3J,EAAI,CAChB,CACQ,OAAOlF,CACV,CACL,CACO,SAASgP,SAAOZ,EAAG,CAKtB,GAAIA,EAAIb,QAAQD,MAAK,CAKjB,MAAMmB,GAAUL,EAAIhE,OAAOmD,MAC3B,OAAO,SAAmBmB,EAAI1M,EAAG,CAC7B,MAAM2M,EAAOD,EAAG,IAAI1M,EAAGyM,CAAM,EAE7B,GAAI,CAACC,EAAG,IAAIA,EAAG,IAAIC,CAAI,EAAG3M,CAAC,EACvB,MAAM,IAAI,MAAM,yBAAyB,EAC7C,OAAO2M,CACV,CACT,CAEI,GAAIP,EAAIX,QAAQD,MAAK,CACjB,MAAMyB,GAAMb,EAAIZ,OAAOC,MACvB,OAAO,SAAmBiB,EAAI1M,EAAG,CAC7B,MAAMkN,EAAKR,EAAG,IAAI1M,EAAGqI,KAAG,EAClBzG,EAAI8K,EAAG,IAAIQ,EAAID,CAAE,EACjBE,EAAKT,EAAG,IAAI1M,EAAG4B,CAAC,EAChBlG,EAAIgR,EAAG,IAAIA,EAAG,IAAIS,EAAI9E,KAAG,EAAGzG,CAAC,EAC7B+K,EAAOD,EAAG,IAAIS,EAAIT,EAAG,IAAIhR,EAAGgR,EAAG,GAAG,CAAC,EACzC,GAAI,CAACA,EAAG,IAAIA,EAAG,IAAIC,CAAI,EAAG3M,CAAC,EACvB,MAAM,IAAI,MAAM,yBAAyB,EAC7C,OAAO2M,CACV,CACT,CAwBI,OAAOR,gBAAcC,CAAC,CAC1B,CAIA,MAAMgB,eAAe,CACjB,SAAU,UAAW,MAAO,MAAO,MAAO,OAAQ,MAClD,MAAO,MAAO,MAAO,MAAO,MAAO,MACnC,OAAQ,OAAQ,OAAQ,MAC5B,EACO,SAASC,gBAAcC,EAAO,CACjC,MAAMC,EAAU,CACZ,MAAO,SACP,KAAM,SACN,MAAO,gBACP,KAAM,eACT,EACKC,EAAOJ,eAAa,OAAO,CAACK,EAAKhO,KACnCgO,EAAIhO,CAAG,EAAI,WACJgO,GACRF,CAAO,EACV,OAAOxC,iBAAeuC,EAAOE,CAAI,CACrC,CAMO,SAASE,QAAMC,EAAGhF,EAAKkD,EAAO,CAGjC,GAAIA,EAAQ1D,MACR,MAAM,IAAI,MAAM,oBAAoB,EACxC,GAAI0D,IAAU1D,MACV,OAAOwF,EAAE,IACb,GAAI9B,IAAUzD,MACV,OAAOO,EACX,IAAI5K,EAAI4P,EAAE,IACNvP,EAAIuK,EACR,KAAOkD,EAAQ1D,OACP0D,EAAQzD,QACRrK,EAAI4P,EAAE,IAAI5P,EAAGK,CAAC,GAClBA,EAAIuP,EAAE,IAAIvP,CAAC,EACXyN,IAAUzD,MAEd,OAAOrK,CACX,CAKO,SAAS6P,gBAAcD,EAAGE,EAAM,CACnC,MAAM5I,EAAM,IAAI,MAAM4I,EAAK,MAAM,EAE3BC,EAAiBD,EAAK,OAAO,CAACE,EAAKpF,EAAKjN,IACtCiS,EAAE,IAAIhF,CAAG,EACFoF,GACX9I,EAAIvJ,CAAC,EAAIqS,EACFJ,EAAE,IAAII,EAAKpF,CAAG,GACtBgF,EAAE,GAAG,EAEFK,EAAWL,EAAE,IAAIG,CAAc,EAErC,OAAAD,EAAK,YAAY,CAACE,EAAKpF,EAAKjN,IACpBiS,EAAE,IAAIhF,CAAG,EACFoF,GACX9I,EAAIvJ,CAAC,EAAIiS,EAAE,IAAII,EAAK9I,EAAIvJ,CAAC,CAAC,EACnBiS,EAAE,IAAII,EAAKpF,CAAG,GACtBqF,CAAQ,EACJ/I,CACX,CAaO,SAASgJ,UAAQ,EAAGC,EAAY,CAEnC,MAAMC,EAAcD,IAAe,OAAYA,EAAa,EAAE,SAAS,CAAC,EAAE,OACpEE,EAAc,KAAK,KAAKD,EAAc,CAAC,EAC7C,MAAO,CAAE,WAAYA,EAAa,YAAAC,CAAa,CACnD,CAaO,SAASC,QAAMC,EAAOzE,EAAQxF,EAAO,GAAOkK,EAAQ,GAAI,CAC3D,GAAID,GAASnG,MACT,MAAM,IAAI,MAAM,iCAAiCmG,CAAK,EAAE,EAC5D,KAAM,CAAE,WAAYE,EAAM,YAAaC,CAAK,EAAKR,UAAQK,EAAOzE,CAAM,EACtE,GAAI4E,EAAQ,KACR,MAAM,IAAI,MAAM,iDAAiD,EACrE,MAAMC,EAAQ1B,SAAOsB,CAAK,EACpBX,EAAI,OAAO,OAAO,CACpB,MAAAW,EACA,KAAAE,EACA,MAAAC,EACA,KAAMzE,UAAQwE,CAAI,EAClB,KAAMrG,MACN,IAAKC,MACL,OAASO,GAAQ+C,MAAI/C,EAAK2F,CAAK,EAC/B,QAAU3F,GAAQ,CACd,GAAI,OAAOA,GAAQ,SACf,MAAM,IAAI,MAAM,+CAA+C,OAAOA,CAAG,EAAE,EAC/E,OAAOR,OAAOQ,GAAOA,EAAM2F,CAC9B,EACD,IAAM3F,GAAQA,IAAQR,MACtB,MAAQQ,IAASA,EAAMP,SAASA,MAChC,IAAMO,GAAQ+C,MAAI,CAAC/C,EAAK2F,CAAK,EAC7B,IAAK,CAACK,EAAKC,IAAQD,IAAQC,EAC3B,IAAMjG,GAAQ+C,MAAI/C,EAAMA,EAAK2F,CAAK,EAClC,IAAK,CAACK,EAAKC,IAAQlD,MAAIiD,EAAMC,EAAKN,CAAK,EACvC,IAAK,CAACK,EAAKC,IAAQlD,MAAIiD,EAAMC,EAAKN,CAAK,EACvC,IAAK,CAACK,EAAKC,IAAQlD,MAAIiD,EAAMC,EAAKN,CAAK,EACvC,IAAK,CAAC3F,EAAKkD,IAAU6B,QAAMC,EAAGhF,EAAKkD,CAAK,EACxC,IAAK,CAAC8C,EAAKC,IAAQlD,MAAIiD,EAAM3C,SAAO4C,EAAKN,CAAK,EAAGA,CAAK,EAEtD,KAAO3F,GAAQA,EAAMA,EACrB,KAAM,CAACgG,EAAKC,IAAQD,EAAMC,EAC1B,KAAM,CAACD,EAAKC,IAAQD,EAAMC,EAC1B,KAAM,CAACD,EAAKC,IAAQD,EAAMC,EAC1B,IAAMjG,GAAQqD,SAAOrD,EAAK2F,CAAK,EAC/B,KAAMC,EAAM,OAAUvO,GAAM0O,EAAMf,EAAG3N,CAAC,GACtC,YAAc6O,GAAQjB,gBAAcD,EAAGkB,CAAG,EAG1C,KAAM,CAACrS,EAAGC,EAAG0B,IAAOA,EAAI1B,EAAID,EAC5B,QAAUmM,GAAStE,EAAOgF,kBAAgBV,EAAK8F,CAAK,EAAIrF,kBAAgBT,EAAK8F,CAAK,EAClF,UAAYlL,GAAU,CAClB,GAAIA,EAAM,SAAWkL,EACjB,MAAM,IAAI,MAAM,0BAA0BA,CAAK,SAASlL,EAAM,MAAM,EAAE,EAC1E,OAAOc,EAAO8E,kBAAgB5F,CAAK,EAAI2F,kBAAgB3F,CAAK,CAC/D,CACT,CAAK,EACD,OAAO,OAAO,OAAOoK,CAAC,CAC1B,CAkCO,SAASmB,sBAAoBC,EAAY,CAC5C,GAAI,OAAOA,GAAe,SACtB,MAAM,IAAI,MAAM,4BAA4B,EAChD,MAAMC,EAAYD,EAAW,SAAS,CAAC,EAAE,OACzC,OAAO,KAAK,KAAKC,EAAY,CAAC,CAClC,CAQO,SAASC,mBAAiBF,EAAY,CACzC,MAAMvI,EAASsI,sBAAoBC,CAAU,EAC7C,OAAOvI,EAAS,KAAK,KAAKA,EAAS,CAAC,CACxC,CAcO,SAAS0I,iBAAerO,EAAKkO,EAAY1K,EAAO,GAAO,CAC1D,MAAM3H,EAAMmE,EAAI,OACVsO,EAAWL,sBAAoBC,CAAU,EACzCK,EAASH,mBAAiBF,CAAU,EAE1C,GAAIrS,EAAM,IAAMA,EAAM0S,GAAU1S,EAAM,KAClC,MAAM,IAAI,MAAM,YAAY0S,CAAM,6BAA6B1S,CAAG,EAAE,EACxE,MAAMiM,EAAMtE,EAAO6E,kBAAgBrI,CAAG,EAAIsI,kBAAgBtI,CAAG,EAEvDwO,EAAU3D,MAAI/C,EAAKoG,EAAa3G,KAAG,EAAIA,MAC7C,OAAO/D,EAAOgF,kBAAgBgG,EAASF,CAAQ,EAAI/F,kBAAgBiG,EAASF,CAAQ,CACxF,CC9ZA,sEAIA,MAAMhH,MAAM,OAAO,CAAC,EACdC,MAAM,OAAO,CAAC,EAYb,SAASkH,OAAKnR,EAAGoR,EAAM,CAC1B,MAAMC,EAAkB,CAACC,EAAWC,IAAS,CACzC,MAAMC,EAAMD,EAAK,OAAQ,EACzB,OAAOD,EAAYE,EAAMD,CAC5B,EACKlC,EAAQoC,GAAM,CAChB,MAAMC,EAAU,KAAK,KAAKN,EAAOK,CAAC,EAAI,EAChCE,EAAa,IAAMF,EAAI,GAC7B,MAAO,CAAE,QAAAC,EAAS,WAAAC,CAAY,CACjC,EACD,MAAO,CACH,gBAAAN,EAEA,aAAaO,EAAK/P,EAAG,CACjB,IAAIjC,EAAII,EAAE,KACNC,EAAI2R,EACR,KAAO/P,EAAImI,OACHnI,EAAIoI,QACJrK,EAAIA,EAAE,IAAIK,CAAC,GACfA,EAAIA,EAAE,OAAQ,EACd4B,IAAMoI,MAEV,OAAOrK,CACV,EAWD,iBAAiBgS,EAAKH,EAAG,CACrB,KAAM,CAAE,QAAAC,EAAS,WAAAC,GAAetC,EAAKoC,CAAC,EAChCI,EAAS,CAAE,EACjB,IAAIjS,EAAIgS,EACJE,EAAOlS,EACX,QAASmS,EAAS,EAAGA,EAASL,EAASK,IAAU,CAC7CD,EAAOlS,EACPiS,EAAO,KAAKC,CAAI,EAEhB,QAASvU,EAAI,EAAGA,EAAIoU,EAAYpU,IAC5BuU,EAAOA,EAAK,IAAIlS,CAAC,EACjBiS,EAAO,KAAKC,CAAI,EAEpBlS,EAAIkS,EAAK,OAAQ,CACjC,CACY,OAAOD,CACV,EAQD,KAAKJ,EAAGO,EAAanQ,EAAG,CAGpB,KAAM,CAAE,QAAA6P,EAAS,WAAAC,GAAetC,EAAKoC,CAAC,EACtC,IAAI7R,EAAII,EAAE,KACN,EAAIA,EAAE,KACV,MAAMiS,EAAO,OAAO,GAAKR,EAAI,CAAC,EACxBS,EAAY,GAAKT,EACjBU,EAAU,OAAOV,CAAC,EACxB,QAASM,EAAS,EAAGA,EAASL,EAASK,IAAU,CAC7C,MAAMzI,EAASyI,EAASJ,EAExB,IAAIS,EAAQ,OAAOvQ,EAAIoQ,CAAI,EAE3BpQ,IAAMsQ,EAGFC,EAAQT,IACRS,GAASF,EACTrQ,GAAKoI,OAST,MAAMoI,EAAU/I,EACVgJ,EAAUhJ,EAAS,KAAK,IAAI8I,CAAK,EAAI,EACrCG,EAAQR,EAAS,IAAM,EACvBS,EAAQJ,EAAQ,EAClBA,IAAU,EAEV,EAAI,EAAE,IAAIf,EAAgBkB,EAAOP,EAAYK,CAAO,CAAC,CAAC,EAGtDzS,EAAIA,EAAE,IAAIyR,EAAgBmB,EAAOR,EAAYM,CAAO,CAAC,CAAC,CAE1E,CAMY,MAAO,CAAE,EAAA1S,EAAG,CAAG,CAClB,EACD,WAAWqO,EAAGwE,EAAgB5Q,EAAG6Q,EAAW,CAExC,MAAMjB,EAAIxD,EAAE,cAAgB,EAE5B,IAAI0E,EAAOF,EAAe,IAAIxE,CAAC,EAC/B,OAAK0E,IACDA,EAAO,KAAK,iBAAiB1E,EAAGwD,CAAC,EAC7BA,IAAM,GACNgB,EAAe,IAAIxE,EAAGyE,EAAUC,CAAI,CAAC,GAGtC,KAAK,KAAKlB,EAAGkB,EAAM9Q,CAAC,CAC9B,CACJ,CACL,CACO,SAAS+Q,gBAAcC,EAAO,CACjC3D,uBAAc2D,EAAM,EAAE,EACtBjG,iBAAeiG,EAAO,CAClB,EAAG,SACH,EAAG,SACH,GAAI,QACJ,GAAI,OACZ,EAAO,CACC,WAAY,gBACZ,YAAa,eACrB,CAAK,EAEM,OAAO,OAAO,CACjB,GAAG/C,UAAQ+C,EAAM,EAAGA,EAAM,UAAU,EACpC,GAAGA,EACE,EAAGA,EAAM,GAAG,KACzB,CAAK,CACL,CC1JA,sEAMA,SAASC,oBAAkBD,EAAO,CAC9B,MAAMxD,EAAOuD,gBAAcC,CAAK,EAChCE,iBAAkB1D,EAAM,CACpB,EAAG,QACH,EAAG,OACX,EAAO,CACC,yBAA0B,QAC1B,eAAgB,UAChB,cAAe,WACf,cAAe,WACf,mBAAoB,UACpB,UAAW,WACX,QAAS,UACjB,CAAK,EACD,KAAM,CAAE,KAAA2D,EAAM,GAAAzE,EAAI,EAAAlQ,CAAG,EAAGgR,EACxB,GAAI2D,EAAM,CACN,GAAI,CAACzE,EAAG,IAAIlQ,EAAGkQ,EAAG,IAAI,EAClB,MAAM,IAAI,MAAM,mEAAmE,EAEvF,GAAI,OAAOyE,GAAS,UAChB,OAAOA,EAAK,MAAS,UACrB,OAAOA,EAAK,aAAgB,WAC5B,MAAM,IAAI,MAAM,mEAAmE,CAE/F,CACI,OAAO,OAAO,OAAO,CAAE,GAAG3D,CAAI,CAAE,CACpC,CAEA,KAAM,CAAE,gBAAiB4D,MAAK,WAAYC,KAAK,EAAGC,KACrCC,MAAM,CAEf,IAAK,cAAqB,KAAM,CAC5B,YAAY9T,EAAI,GAAI,CAChB,MAAMA,CAAC,CACnB,CACK,EACD,UAAU+G,EAAM,CACZ,KAAM,CAAE,IAAK6C,CAAC,EAAKkK,MACnB,GAAI/M,EAAK,OAAS,GAAKA,EAAK,CAAC,IAAM,EAC/B,MAAM,IAAI6C,EAAE,+BAA+B,EAC/C,MAAM3K,EAAM8H,EAAK,CAAC,EACZ+B,EAAM/B,EAAK,SAAS,EAAG9H,EAAM,CAAC,EACpC,GAAI,CAACA,GAAO6J,EAAI,SAAW7J,EACvB,MAAM,IAAI2K,EAAE,yCAAyC,EAKzD,GAAId,EAAI,CAAC,EAAI,IACT,MAAM,IAAIc,EAAE,qCAAqC,EACrD,GAAId,EAAI,CAAC,IAAM,GAAQ,EAAEA,EAAI,CAAC,EAAI,KAC9B,MAAM,IAAIc,EAAE,qDAAqD,EACrE,MAAO,CAAE,EAAG+J,MAAI7K,CAAG,EAAG,EAAG/B,EAAK,SAAS9H,EAAM,CAAC,EACjD,EACD,MAAM+L,EAAK,CAEP,KAAM,CAAE,IAAKpB,CAAC,EAAKkK,MACb/M,EAAO,OAAOiE,GAAQ,SAAW4I,MAAI5I,CAAG,EAAIA,EAClD,GAAI,EAAEjE,aAAgB,YAClB,MAAM,IAAI,MAAM,eAAe,EACnC,IAAIrI,EAAIqI,EAAK,OACb,GAAIrI,EAAI,GAAKqI,EAAK,CAAC,GAAK,GACpB,MAAM,IAAI6C,EAAE,uBAAuB,EACvC,GAAI7C,EAAK,CAAC,IAAMrI,EAAI,EAChB,MAAM,IAAIkL,EAAE,qCAAqC,EACrD,KAAM,CAAE,EAAGnE,EAAG,EAAGsO,CAAM,EAAKD,MAAI,UAAU/M,EAAK,SAAS,CAAC,CAAC,EACpD,CAAE,EAAGnF,EAAG,EAAGoS,CAAU,EAAKF,MAAI,UAAUC,CAAM,EACpD,GAAIC,EAAW,OACX,MAAM,IAAIpK,EAAE,6CAA6C,EAC7D,MAAO,CAAE,EAAAnE,EAAG,EAAA7D,CAAG,CAClB,EACD,WAAWqS,EAAK,CAEZ,MAAMC,EAAStS,GAAO,OAAO,SAASA,EAAE,CAAC,EAAG,EAAE,EAAI,EAAS,KAAOA,EAAIA,EAChEC,EAAKqJ,GAAQ,CACf,MAAMF,EAAME,EAAI,SAAS,EAAE,EAC3B,OAAOF,EAAI,OAAS,EAAI,IAAIA,CAAG,GAAKA,CACvC,EACKpJ,EAAIsS,EAAMrS,EAAEoS,EAAI,CAAC,CAAC,EAClBxO,EAAIyO,EAAMrS,EAAEoS,EAAI,CAAC,CAAC,EAClBE,EAAMvS,EAAE,OAAS,EACjBwS,EAAM3O,EAAE,OAAS,EACjByH,EAAKrL,EAAEsS,CAAG,EACVE,EAAKxS,EAAEuS,CAAG,EAChB,MAAO,KAAKvS,EAAEuS,EAAMD,EAAM,CAAC,CAAC,KAAKE,CAAE,GAAG5O,CAAC,KAAKyH,CAAE,GAAGtL,CAAC,EACrD,CACL,EAGM8I,MAAM,OAAO,CAAC,EAAGC,MAAM,OAAO,CAAC,EAAS,OAAO,CAAC,EAAE,MAACkD,MAAM,OAAO,CAAC,EAAS,OAAO,CAAC,EACjF,SAASyG,oBAAkBvE,EAAM,CACpC,MAAMwE,EAAQf,oBAAkBzD,CAAI,EAC9B,CAAE,GAAAd,CAAI,EAAGsF,EACTzN,EAAUyN,EAAM,UACjB,CAACC,EAAIC,EAAOC,IAAkB,CAC3B,MAAM3V,EAAI0V,EAAM,SAAU,EAC1B,OAAOE,cAAe,WAAW,KAAK,CAAC,CAAI,CAAC,EAAG1F,EAAG,QAAQlQ,EAAE,CAAC,EAAGkQ,EAAG,QAAQlQ,EAAE,CAAC,CAAC,CAC3F,GACU6V,EAAYL,EAAM,YAClBzO,GAAU,CAER,MAAM+O,EAAO/O,EAAM,SAAS,CAAC,EAEvBvF,EAAI0O,EAAG,UAAU4F,EAAK,SAAS,EAAG5F,EAAG,KAAK,CAAC,EAC3ClN,EAAIkN,EAAG,UAAU4F,EAAK,SAAS5F,EAAG,MAAO,EAAIA,EAAG,KAAK,CAAC,EAC5D,MAAO,CAAE,EAAA1O,EAAG,EAAAwB,CAAG,CAC3B,GAKI,SAAS+S,EAAoBvU,EAAG,CAC5B,KAAM,CAAE,EAAAxB,EAAG,CAAC,EAAKwV,EACXQ,EAAK9F,EAAG,IAAI1O,CAAC,EACbyU,EAAK/F,EAAG,IAAI8F,EAAIxU,CAAC,EACvB,OAAO0O,EAAG,IAAIA,EAAG,IAAI+F,EAAI/F,EAAG,IAAI1O,EAAGxB,CAAC,CAAC,EAAG,CAAC,CACjD,CAKI,GAAI,CAACkQ,EAAG,IAAIA,EAAG,IAAIsF,EAAM,EAAE,EAAGO,EAAoBP,EAAM,EAAE,CAAC,EACvD,MAAM,IAAI,MAAM,6CAA6C,EAEjE,SAASU,EAAmB/J,EAAK,CAC7B,OAAO,OAAOA,GAAQ,UAAYR,MAAMQ,GAAOA,EAAMqJ,EAAM,CACnE,CACI,SAASW,EAAShK,EAAK,CACnB,GAAI,CAAC+J,EAAmB/J,CAAG,EACvB,MAAM,IAAI,MAAM,6CAA6C,CACzE,CAGI,SAASiK,EAAuB/R,EAAK,CACjC,KAAM,CAAE,yBAA0B2C,EAAS,YAAA4K,EAAa,eAAAyE,EAAgB,EAAA7S,CAAC,EAAKgS,EAC9E,GAAIxO,GAAW,OAAO3C,GAAQ,SAAU,CAIpC,GAHIA,aAAe,aACfA,EAAMiS,aAAcjS,CAAG,GAEvB,OAAOA,GAAQ,UAAY,CAAC2C,EAAQ,SAAS3C,EAAI,MAAM,EACvD,MAAM,IAAI,MAAM,aAAa,EACjCA,EAAMA,EAAI,SAASuN,EAAc,EAAG,GAAG,CACnD,CACQ,IAAIzF,EACJ,GAAI,CACAA,EACI,OAAO9H,GAAQ,SACTA,EACAkS,kBAAmBxJ,cAAY,cAAe1I,EAAKuN,CAAW,CAAC,CACrF,MACsB,CACV,MAAM,IAAI,MAAM,uBAAuBA,CAAW,8BAA8B,OAAOvN,CAAG,EAAE,CACxG,CACQ,OAAIgS,IACAlK,EAAMqK,MAAQrK,EAAK3I,CAAC,GACxB2S,EAAShK,CAAG,EACLA,CACf,CACI,MAAMsK,EAAmB,IAAI,IAC7B,SAASC,EAAeC,EAAO,CAC3B,GAAI,EAAEA,aAAiBC,GACnB,MAAM,IAAI,MAAM,0BAA0B,CACtD,CAMI,MAAMA,CAAM,CACR,YAAYC,EAAIC,EAAIC,EAAI,CAIpB,GAHA,KAAK,GAAKF,EACV,KAAK,GAAKC,EACV,KAAK,GAAKC,EACNF,GAAM,MAAQ,CAAC3G,EAAG,QAAQ2G,CAAE,EAC5B,MAAM,IAAI,MAAM,YAAY,EAChC,GAAIC,GAAM,MAAQ,CAAC5G,EAAG,QAAQ4G,CAAE,EAC5B,MAAM,IAAI,MAAM,YAAY,EAChC,GAAIC,GAAM,MAAQ,CAAC7G,EAAG,QAAQ6G,CAAE,EAC5B,MAAM,IAAI,MAAM,YAAY,CAC5C,CAGQ,OAAO,WAAWxV,EAAG,CACjB,KAAM,CAAE,EAAAC,EAAG,EAAAwB,CAAG,EAAGzB,GAAK,CAAE,EACxB,GAAI,CAACA,GAAK,CAAC2O,EAAG,QAAQ1O,CAAC,GAAK,CAAC0O,EAAG,QAAQlN,CAAC,EACrC,MAAM,IAAI,MAAM,sBAAsB,EAC1C,GAAIzB,aAAaqV,EACb,MAAM,IAAI,MAAM,8BAA8B,EAClD,MAAMI,EAAO9X,GAAMgR,EAAG,IAAIhR,EAAGgR,EAAG,IAAI,EAEpC,OAAI8G,EAAIxV,CAAC,GAAKwV,EAAIhU,CAAC,EACR4T,EAAM,KACV,IAAIA,EAAMpV,EAAGwB,EAAGkN,EAAG,GAAG,CACzC,CACQ,IAAI,GAAI,CACJ,OAAO,KAAK,SAAQ,EAAG,CACnC,CACQ,IAAI,GAAI,CACJ,OAAO,KAAK,SAAQ,EAAG,CACnC,CAOQ,OAAO,WAAWsD,EAAQ,CACtB,MAAMyD,EAAQ/G,EAAG,YAAYsD,EAAO,IAAKjS,GAAMA,EAAE,EAAE,CAAC,EACpD,OAAOiS,EAAO,IAAI,CAACjS,EAAGrC,IAAMqC,EAAE,SAAS0V,EAAM/X,CAAC,CAAC,CAAC,EAAE,IAAI0X,EAAM,UAAU,CAClF,CAKQ,OAAO,QAAQ3K,EAAK,CAChB,MAAM2D,EAAIgH,EAAM,WAAWf,EAAU9I,cAAY,WAAYd,CAAG,CAAC,CAAC,EAClE,OAAA2D,EAAE,eAAgB,EACXA,CACnB,CAEQ,OAAO,eAAesH,EAAY,CAC9B,OAAON,EAAM,KAAK,SAASR,EAAuBc,CAAU,CAAC,CACzE,CAEQ,eAAe5D,EAAY,CACvB,KAAK,aAAeA,EACpBmD,EAAiB,OAAO,IAAI,CACxC,CAEQ,gBAAiB,CACb,GAAI,KAAK,MAAO,CAIZ,GAAIjB,EAAM,oBAAsB,CAACtF,EAAG,IAAI,KAAK,EAAE,EAC3C,OACJ,MAAM,IAAI,MAAM,iBAAiB,CACjD,CAEY,KAAM,CAAE,EAAA1O,EAAG,EAAAwB,GAAM,KAAK,SAAU,EAEhC,GAAI,CAACkN,EAAG,QAAQ1O,CAAC,GAAK,CAAC0O,EAAG,QAAQlN,CAAC,EAC/B,MAAM,IAAI,MAAM,0BAA0B,EAC9C,MAAMmU,EAAOjH,EAAG,IAAIlN,CAAC,EACfoU,EAAQrB,EAAoBvU,CAAC,EACnC,GAAI,CAAC0O,EAAG,IAAIiH,EAAMC,CAAK,EACnB,MAAM,IAAI,MAAM,mCAAmC,EACvD,GAAI,CAAC,KAAK,cAAe,EACrB,MAAM,IAAI,MAAM,wCAAwC,CACxE,CACQ,UAAW,CACP,KAAM,CAAE,EAAApU,CAAC,EAAK,KAAK,SAAU,EAC7B,GAAIkN,EAAG,MACH,MAAO,CAACA,EAAG,MAAMlN,CAAC,EACtB,MAAM,IAAI,MAAM,6BAA6B,CACzD,CAIQ,OAAO2T,EAAO,CACVD,EAAeC,CAAK,EACpB,KAAM,CAAE,GAAIU,EAAI,GAAIC,EAAI,GAAIC,CAAE,EAAK,KAC7B,CAAE,GAAIC,EAAI,GAAIC,EAAI,GAAIC,CAAE,EAAKf,EAC7BgB,EAAKzH,EAAG,IAAIA,EAAG,IAAImH,EAAIK,CAAE,EAAGxH,EAAG,IAAIsH,EAAID,CAAE,CAAC,EAC1CK,EAAK1H,EAAG,IAAIA,EAAG,IAAIoH,EAAII,CAAE,EAAGxH,EAAG,IAAIuH,EAAIF,CAAE,CAAC,EAChD,OAAOI,GAAMC,CACzB,CAIQ,QAAS,CACL,OAAO,IAAIhB,EAAM,KAAK,GAAI1G,EAAG,IAAI,KAAK,EAAE,EAAG,KAAK,EAAE,CAC9D,CAKQ,QAAS,CACL,KAAM,CAAE,EAAAlQ,EAAG,CAAC,EAAKwV,EACXqC,EAAK3H,EAAG,IAAI,EAAGpB,KAAG,EAClB,CAAE,GAAIuI,EAAI,GAAIC,EAAI,GAAIC,CAAE,EAAK,KACnC,IAAIO,EAAK5H,EAAG,KAAM6H,EAAK7H,EAAG,KAAM8H,EAAK9H,EAAG,KACpC+H,EAAK/H,EAAG,IAAImH,EAAIA,CAAE,EAClBa,EAAKhI,EAAG,IAAIoH,EAAIA,CAAE,EAClBhH,EAAKJ,EAAG,IAAIqH,EAAIA,CAAE,EAClBY,EAAKjI,EAAG,IAAImH,EAAIC,CAAE,EACtB,OAAAa,EAAKjI,EAAG,IAAIiI,EAAIA,CAAE,EAClBH,EAAK9H,EAAG,IAAImH,EAAIE,CAAE,EAClBS,EAAK9H,EAAG,IAAI8H,EAAIA,CAAE,EAClBF,EAAK5H,EAAG,IAAIlQ,EAAGgY,CAAE,EACjBD,EAAK7H,EAAG,IAAI2H,EAAIvH,CAAE,EAClByH,EAAK7H,EAAG,IAAI4H,EAAIC,CAAE,EAClBD,EAAK5H,EAAG,IAAIgI,EAAIH,CAAE,EAClBA,EAAK7H,EAAG,IAAIgI,EAAIH,CAAE,EAClBA,EAAK7H,EAAG,IAAI4H,EAAIC,CAAE,EAClBD,EAAK5H,EAAG,IAAIiI,EAAIL,CAAE,EAClBE,EAAK9H,EAAG,IAAI2H,EAAIG,CAAE,EAClB1H,EAAKJ,EAAG,IAAIlQ,EAAGsQ,CAAE,EACjB6H,EAAKjI,EAAG,IAAI+H,EAAI3H,CAAE,EAClB6H,EAAKjI,EAAG,IAAIlQ,EAAGmY,CAAE,EACjBA,EAAKjI,EAAG,IAAIiI,EAAIH,CAAE,EAClBA,EAAK9H,EAAG,IAAI+H,EAAIA,CAAE,EAClBA,EAAK/H,EAAG,IAAI8H,EAAIC,CAAE,EAClBA,EAAK/H,EAAG,IAAI+H,EAAI3H,CAAE,EAClB2H,EAAK/H,EAAG,IAAI+H,EAAIE,CAAE,EAClBJ,EAAK7H,EAAG,IAAI6H,EAAIE,CAAE,EAClB3H,EAAKJ,EAAG,IAAIoH,EAAIC,CAAE,EAClBjH,EAAKJ,EAAG,IAAII,EAAIA,CAAE,EAClB2H,EAAK/H,EAAG,IAAII,EAAI6H,CAAE,EAClBL,EAAK5H,EAAG,IAAI4H,EAAIG,CAAE,EAClBD,EAAK9H,EAAG,IAAII,EAAI4H,CAAE,EAClBF,EAAK9H,EAAG,IAAI8H,EAAIA,CAAE,EAClBA,EAAK9H,EAAG,IAAI8H,EAAIA,CAAE,EACX,IAAIpB,EAAMkB,EAAIC,EAAIC,CAAE,CACvC,CAKQ,IAAIrB,EAAO,CACPD,EAAeC,CAAK,EACpB,KAAM,CAAE,GAAIU,EAAI,GAAIC,EAAI,GAAIC,CAAE,EAAK,KAC7B,CAAE,GAAIC,EAAI,GAAIC,EAAI,GAAIC,CAAE,EAAKf,EACnC,IAAImB,EAAK5H,EAAG,KAAM6H,EAAK7H,EAAG,KAAM8H,EAAK9H,EAAG,KACxC,MAAMlQ,EAAIwV,EAAM,EACVqC,EAAK3H,EAAG,IAAIsF,EAAM,EAAG1G,KAAG,EAC9B,IAAImJ,EAAK/H,EAAG,IAAImH,EAAIG,CAAE,EAClBU,EAAKhI,EAAG,IAAIoH,EAAIG,CAAE,EAClBnH,EAAKJ,EAAG,IAAIqH,EAAIG,CAAE,EAClBS,EAAKjI,EAAG,IAAImH,EAAIC,CAAE,EAClBc,EAAKlI,EAAG,IAAIsH,EAAIC,CAAE,EACtBU,EAAKjI,EAAG,IAAIiI,EAAIC,CAAE,EAClBA,EAAKlI,EAAG,IAAI+H,EAAIC,CAAE,EAClBC,EAAKjI,EAAG,IAAIiI,EAAIC,CAAE,EAClBA,EAAKlI,EAAG,IAAImH,EAAIE,CAAE,EAClB,IAAIc,EAAKnI,EAAG,IAAIsH,EAAIE,CAAE,EACtB,OAAAU,EAAKlI,EAAG,IAAIkI,EAAIC,CAAE,EAClBA,EAAKnI,EAAG,IAAI+H,EAAI3H,CAAE,EAClB8H,EAAKlI,EAAG,IAAIkI,EAAIC,CAAE,EAClBA,EAAKnI,EAAG,IAAIoH,EAAIC,CAAE,EAClBO,EAAK5H,EAAG,IAAIuH,EAAIC,CAAE,EAClBW,EAAKnI,EAAG,IAAImI,EAAIP,CAAE,EAClBA,EAAK5H,EAAG,IAAIgI,EAAI5H,CAAE,EAClB+H,EAAKnI,EAAG,IAAImI,EAAIP,CAAE,EAClBE,EAAK9H,EAAG,IAAIlQ,EAAGoY,CAAE,EACjBN,EAAK5H,EAAG,IAAI2H,EAAIvH,CAAE,EAClB0H,EAAK9H,EAAG,IAAI4H,EAAIE,CAAE,EAClBF,EAAK5H,EAAG,IAAIgI,EAAIF,CAAE,EAClBA,EAAK9H,EAAG,IAAIgI,EAAIF,CAAE,EAClBD,EAAK7H,EAAG,IAAI4H,EAAIE,CAAE,EAClBE,EAAKhI,EAAG,IAAI+H,EAAIA,CAAE,EAClBC,EAAKhI,EAAG,IAAIgI,EAAID,CAAE,EAClB3H,EAAKJ,EAAG,IAAIlQ,EAAGsQ,CAAE,EACjB8H,EAAKlI,EAAG,IAAI2H,EAAIO,CAAE,EAClBF,EAAKhI,EAAG,IAAIgI,EAAI5H,CAAE,EAClBA,EAAKJ,EAAG,IAAI+H,EAAI3H,CAAE,EAClBA,EAAKJ,EAAG,IAAIlQ,EAAGsQ,CAAE,EACjB8H,EAAKlI,EAAG,IAAIkI,EAAI9H,CAAE,EAClB2H,EAAK/H,EAAG,IAAIgI,EAAIE,CAAE,EAClBL,EAAK7H,EAAG,IAAI6H,EAAIE,CAAE,EAClBA,EAAK/H,EAAG,IAAImI,EAAID,CAAE,EAClBN,EAAK5H,EAAG,IAAIiI,EAAIL,CAAE,EAClBA,EAAK5H,EAAG,IAAI4H,EAAIG,CAAE,EAClBA,EAAK/H,EAAG,IAAIiI,EAAID,CAAE,EAClBF,EAAK9H,EAAG,IAAImI,EAAIL,CAAE,EAClBA,EAAK9H,EAAG,IAAI8H,EAAIC,CAAE,EACX,IAAIrB,EAAMkB,EAAIC,EAAIC,CAAE,CACvC,CACQ,SAASrB,EAAO,CACZ,OAAO,KAAK,IAAIA,EAAM,OAAM,CAAE,CAC1C,CACQ,KAAM,CACF,OAAO,KAAK,OAAOC,EAAM,IAAI,CACzC,CACQ,KAAKpT,EAAG,CACJ,OAAO8U,EAAK,WAAW,KAAM7B,EAAkBjT,EAAI8Q,GAAS,CACxD,MAAM2C,EAAQ/G,EAAG,YAAYoE,EAAK,IAAK/S,GAAMA,EAAE,EAAE,CAAC,EAClD,OAAO+S,EAAK,IAAI,CAAC/S,EAAGrC,IAAMqC,EAAE,SAAS0V,EAAM/X,CAAC,CAAC,CAAC,EAAE,IAAI0X,EAAM,UAAU,CACpF,CAAa,CACb,CAMQ,eAAepT,EAAG,CACd,MAAM+U,EAAI3B,EAAM,KAChB,GAAIpT,IAAMmI,MACN,OAAO4M,EAEX,GADApC,EAAS3S,CAAC,EACNA,IAAMoI,MACN,OAAO,KACX,KAAM,CAAE,KAAA+I,CAAI,EAAKa,EACjB,GAAI,CAACb,EACD,OAAO2D,EAAK,aAAa,KAAM9U,CAAC,EAEpC,GAAI,CAAE,MAAAgV,EAAO,GAAAC,EAAI,MAAAC,EAAO,GAAAvX,CAAE,EAAKwT,EAAK,YAAYnR,CAAC,EAC7CmV,EAAMJ,EACNK,EAAML,EACN3W,EAAI,KACR,KAAO6W,EAAK9M,OAAOxK,EAAKwK,OAChB8M,EAAK7M,QACL+M,EAAMA,EAAI,IAAI/W,CAAC,GACfT,EAAKyK,QACLgN,EAAMA,EAAI,IAAIhX,CAAC,GACnBA,EAAIA,EAAE,OAAQ,EACd6W,IAAO7M,MACPzK,IAAOyK,MAEX,OAAI4M,IACAG,EAAMA,EAAI,OAAQ,GAClBD,IACAE,EAAMA,EAAI,OAAQ,GACtBA,EAAM,IAAIhC,EAAM1G,EAAG,IAAI0I,EAAI,GAAIjE,EAAK,IAAI,EAAGiE,EAAI,GAAIA,EAAI,EAAE,EAClDD,EAAI,IAAIC,CAAG,CAC9B,CAUQ,SAASC,EAAQ,CACb1C,EAAS0C,CAAM,EACf,IAAIrV,EAAIqV,EACJnD,EAAOoD,EACX,KAAM,CAAE,KAAAnE,CAAI,EAAKa,EACjB,GAAIb,EAAM,CACN,KAAM,CAAE,MAAA6D,EAAO,GAAAC,EAAI,MAAAC,EAAO,GAAAvX,CAAE,EAAKwT,EAAK,YAAYnR,CAAC,EACnD,GAAI,CAAE,EAAGmV,EAAK,EAAGI,CAAG,EAAK,KAAK,KAAKN,CAAE,EACjC,CAAE,EAAGG,EAAK,EAAGI,CAAG,EAAK,KAAK,KAAK7X,CAAE,EACrCwX,EAAML,EAAK,gBAAgBE,EAAOG,CAAG,EACrCC,EAAMN,EAAK,gBAAgBI,EAAOE,CAAG,EACrCA,EAAM,IAAIhC,EAAM1G,EAAG,IAAI0I,EAAI,GAAIjE,EAAK,IAAI,EAAGiE,EAAI,GAAIA,EAAI,EAAE,EACzDlD,EAAQiD,EAAI,IAAIC,CAAG,EACnBE,EAAOC,EAAI,IAAIC,CAAG,CAClC,KACiB,CACD,KAAM,CAAE,EAAAzX,EAAG,EAAA4P,CAAC,EAAK,KAAK,KAAK3N,CAAC,EAC5BkS,EAAQnU,EACRuX,EAAO3H,CACvB,CAEY,OAAOyF,EAAM,WAAW,CAAClB,EAAOoD,CAAI,CAAC,EAAE,CAAC,CACpD,CAOQ,qBAAqBhJ,EAAG9P,EAAGC,EAAG,CAC1B,MAAM8K,EAAI6L,EAAM,KACVqC,EAAM,CAACrJ,EAAG5P,IACVA,IAAM2L,OAAO3L,IAAM4L,OAAO,CAACgE,EAAE,OAAO7E,CAAC,EAAI6E,EAAE,eAAe5P,CAAC,EAAI4P,EAAE,SAAS5P,CAAC,EAC3EmI,EAAM8Q,EAAI,KAAMjZ,CAAC,EAAE,IAAIiZ,EAAInJ,EAAG7P,CAAC,CAAC,EACtC,OAAOkI,EAAI,MAAQ,OAAYA,CAC3C,CAIQ,SAAS+Q,EAAI,CACT,KAAM,CAAE,GAAI1X,EAAG,GAAIwB,EAAG,GAAImW,CAAC,EAAK,KAC1BnC,EAAM,KAAK,IAAK,EAGlBkC,GAAM,OACNA,EAAKlC,EAAM9G,EAAG,IAAMA,EAAG,IAAIiJ,CAAC,GAChC,MAAMC,EAAKlJ,EAAG,IAAI1O,EAAG0X,CAAE,EACjBG,EAAKnJ,EAAG,IAAIlN,EAAGkW,CAAE,EACjBI,EAAKpJ,EAAG,IAAIiJ,EAAGD,CAAE,EACvB,GAAIlC,EACA,MAAO,CAAE,EAAG9G,EAAG,KAAM,EAAGA,EAAG,IAAM,EACrC,GAAI,CAACA,EAAG,IAAIoJ,EAAIpJ,EAAG,GAAG,EAClB,MAAM,IAAI,MAAM,kBAAkB,EACtC,MAAO,CAAE,EAAGkJ,EAAI,EAAGC,CAAI,CACnC,CACQ,eAAgB,CACZ,KAAM,CAAE,EAAGE,EAAU,cAAAC,CAAe,EAAGhE,EACvC,GAAI+D,IAAa3N,MACb,MAAO,GACX,GAAI4N,EACA,OAAOA,EAAc5C,EAAO,IAAI,EACpC,MAAM,IAAI,MAAM,8DAA8D,CAC1F,CACQ,eAAgB,CACZ,KAAM,CAAE,EAAG2C,EAAU,cAAAE,CAAe,EAAGjE,EACvC,OAAI+D,IAAa3N,MACN,KACP6N,EACOA,EAAc7C,EAAO,IAAI,EAC7B,KAAK,eAAepB,EAAM,CAAC,CAC9C,CACQ,WAAWkE,EAAe,GAAM,CAC5B,YAAK,eAAgB,EACd3R,EAAQ6O,EAAO,KAAM8C,CAAY,CACpD,CACQ,MAAMA,EAAe,GAAM,CACvB,OAAOpD,aAAc,KAAK,WAAWoD,CAAY,CAAC,CAC9D,CACA,CACI9C,EAAM,KAAO,IAAIA,EAAMpB,EAAM,GAAIA,EAAM,GAAItF,EAAG,GAAG,EACjD0G,EAAM,KAAO,IAAIA,EAAM1G,EAAG,KAAMA,EAAG,IAAKA,EAAG,IAAI,EAC/C,MAAMyJ,EAAQnE,EAAM,WACd8C,EAAOxF,OAAK8D,EAAOpB,EAAM,KAAO,KAAK,KAAKmE,EAAQ,CAAC,EAAIA,CAAK,EAElE,MAAO,CACH,MAAAnE,EACA,gBAAiBoB,EACjB,uBAAAR,EACA,oBAAAL,EACA,mBAAAG,CACH,CACL,CACA,SAAS0D,eAAapF,EAAO,CACzB,MAAMxD,EAAOuD,gBAAcC,CAAK,EAChCE,wBAAkB1D,EAAM,CACpB,KAAM,OACN,KAAM,WACN,YAAa,UACrB,EAAO,CACC,SAAU,WACV,cAAe,WACf,KAAM,SACd,CAAK,EACM,OAAO,OAAO,CAAE,KAAM,GAAM,GAAGA,EAAM,CAChD,CACO,SAAS6I,cAAYC,EAAU,CAClC,MAAMtE,EAAQoE,eAAaE,CAAQ,EAC7B,CAAE,GAAA5J,EAAI,EAAG6J,CAAa,EAAGvE,EACzBwE,EAAgB9J,EAAG,MAAQ,EAC3B+J,EAAkB,EAAI/J,EAAG,MAAQ,EACvC,SAASgK,EAAoB/N,EAAK,CAC9B,OAAOR,MAAMQ,GAAOA,EAAM+D,EAAG,KACrC,CACI,SAASiK,EAAKna,EAAG,CACb,OAAOwW,MAAQxW,EAAG+Z,CAAW,CACrC,CACI,SAASK,EAAKpa,EAAG,CACb,OAAOqa,SAAWra,EAAG+Z,CAAW,CACxC,CACI,KAAM,CAAE,gBAAiBnD,EAAO,uBAAAR,EAAwB,oBAAAL,EAAqB,mBAAAG,CAAqB,EAAGX,oBAAkB,CACnH,GAAGC,EACH,QAAQC,EAAIC,EAAOgE,EAAc,CAC7B,MAAM1Z,EAAI0V,EAAM,SAAU,EACpBlU,EAAI0O,EAAG,QAAQlQ,EAAE,CAAC,EAClBsa,EAAM1E,cACZ,OAAI8D,EACOY,EAAI,WAAW,KAAK,CAAC5E,EAAM,SAAU,EAAG,EAAO,CAAI,CAAC,EAAGlU,CAAC,EAGxD8Y,EAAI,WAAW,KAAK,CAAC,CAAI,CAAC,EAAG9Y,EAAG0O,EAAG,QAAQlQ,EAAE,CAAC,CAAC,CAE7D,EACD,UAAU+G,EAAO,CACb,MAAM7G,EAAM6G,EAAM,OACZwT,EAAOxT,EAAM,CAAC,EACd+O,EAAO/O,EAAM,SAAS,CAAC,EAE7B,GAAI7G,IAAQ8Z,IAAkBO,IAAS,GAAQA,IAAS,GAAO,CAC3D,MAAM/Y,EAAI+U,kBAAmBT,CAAI,EACjC,GAAI,CAACoE,EAAoB1Y,CAAC,EACtB,MAAM,IAAI,MAAM,uBAAuB,EAC3C,MAAMgZ,EAAKzE,EAAoBvU,CAAC,EAChC,IAAIwB,EAAIkN,EAAG,KAAKsK,CAAE,EAClB,MAAMC,GAAUzX,EAAI4I,SAASA,MAG7B,OADmB2O,EAAO,KAAO,IACfE,IACdzX,EAAIkN,EAAG,IAAIlN,CAAC,GACT,CAAE,EAAAxB,EAAG,EAAAwB,CAAG,CAC/B,SACqB9C,IAAQ+Z,GAAmBM,IAAS,EAAM,CAC/C,MAAM/Y,EAAI0O,EAAG,UAAU4F,EAAK,SAAS,EAAG5F,EAAG,KAAK,CAAC,EAC3ClN,EAAIkN,EAAG,UAAU4F,EAAK,SAAS5F,EAAG,MAAO,EAAIA,EAAG,KAAK,CAAC,EAC5D,MAAO,CAAE,EAAA1O,EAAG,EAAAwB,CAAG,CAC/B,KAEgB,OAAM,IAAI,MAAM,mBAAmB9C,CAAG,0BAA0B8Z,CAAa,wBAAwBC,CAAe,qBAAqB,CAEhJ,CACT,CAAK,EACKS,EAAiBvO,GAAQmK,aAAcqE,kBAAmBxO,EAAKqJ,EAAM,WAAW,CAAC,EACvF,SAASoF,EAAsB9T,EAAQ,CACnC,MAAM+T,EAAOd,GAAenO,MAC5B,OAAO9E,EAAS+T,CACxB,CACI,SAASC,EAAWjY,EAAG,CACnB,OAAO+X,EAAsB/X,CAAC,EAAIsX,EAAK,CAACtX,CAAC,EAAIA,CACrD,CAEI,MAAMkY,EAAS,CAAC9a,EAAGR,EAAMD,IAAO+W,kBAAmBtW,EAAE,MAAMR,EAAMD,CAAE,CAAC,EAIpE,MAAMwb,CAAU,CACZ,YAAYtU,EAAG7D,EAAGoY,EAAU,CACxB,KAAK,EAAIvU,EACT,KAAK,EAAI7D,EACT,KAAK,SAAWoY,EAChB,KAAK,eAAgB,CACjC,CAEQ,OAAO,YAAYhP,EAAK,CACpB,MAAMtM,EAAI6V,EAAM,YAChB,OAAAvJ,EAAMc,cAAY,mBAAoBd,EAAKtM,EAAI,CAAC,EACzC,IAAIqb,EAAUD,EAAO9O,EAAK,EAAGtM,CAAC,EAAGob,EAAO9O,EAAKtM,EAAG,EAAIA,CAAC,CAAC,CACzE,CAGQ,OAAO,QAAQsM,EAAK,CAChB,KAAM,CAAE,EAAAvF,EAAG,EAAA7D,GAAMkS,MAAI,MAAMhI,cAAY,MAAOd,CAAG,CAAC,EAClD,OAAO,IAAI+O,EAAUtU,EAAG7D,CAAC,CACrC,CACQ,gBAAiB,CAEb,GAAI,CAACqT,EAAmB,KAAK,CAAC,EAC1B,MAAM,IAAI,MAAM,2BAA2B,EAC/C,GAAI,CAACA,EAAmB,KAAK,CAAC,EAC1B,MAAM,IAAI,MAAM,2BAA2B,CAC3D,CACQ,eAAe+E,EAAU,CACrB,OAAO,IAAID,EAAU,KAAK,EAAG,KAAK,EAAGC,CAAQ,CACzD,CACQ,iBAAiBC,EAAS,CACtB,KAAM,CAAE,EAAAxU,EAAG,EAAA7D,EAAG,SAAUsY,CAAK,EAAG,KAC1BrY,EAAIsY,EAAcrO,cAAY,UAAWmO,CAAO,CAAC,EACvD,GAAIC,GAAO,MAAQ,CAAC,CAAC,EAAG,EAAG,EAAG,CAAC,EAAE,SAASA,CAAG,EACzC,MAAM,IAAI,MAAM,qBAAqB,EACzC,MAAME,EAAOF,IAAQ,GAAKA,IAAQ,EAAIzU,EAAI8O,EAAM,EAAI9O,EACpD,GAAI2U,GAAQnL,EAAG,MACX,MAAM,IAAI,MAAM,4BAA4B,EAChD,MAAMoL,EAAUH,EAAM,EAAkB,KAAP,KAC3BI,EAAI3E,EAAM,QAAQ0E,EAASZ,EAAcW,CAAI,CAAC,EAC9CG,EAAKpB,EAAKiB,CAAI,EACdI,EAAKtB,EAAK,CAACrX,EAAI0Y,CAAE,EACjBE,EAAKvB,EAAKtX,EAAI2Y,CAAE,EAChB1L,EAAI8G,EAAM,KAAK,qBAAqB2E,EAAGE,EAAIC,CAAE,EACnD,GAAI,CAAC5L,EACD,MAAM,IAAI,MAAM,mBAAmB,EACvC,OAAAA,EAAE,eAAgB,EACXA,CACnB,CAEQ,UAAW,CACP,OAAO8K,EAAsB,KAAK,CAAC,CAC/C,CACQ,YAAa,CACT,OAAO,KAAK,SAAQ,EAAK,IAAII,EAAU,KAAK,EAAGb,EAAK,CAAC,KAAK,CAAC,EAAG,KAAK,QAAQ,EAAI,IAC3F,CAEQ,eAAgB,CACZ,OAAOwB,aAAc,KAAK,UAAU,CAChD,CACQ,UAAW,CACP,OAAO5G,MAAI,WAAW,CAAE,EAAG,KAAK,EAAG,EAAG,KAAK,EAAG,CAC1D,CAEQ,mBAAoB,CAChB,OAAO4G,aAAc,KAAK,cAAc,CACpD,CACQ,cAAe,CACX,OAAOjB,EAAc,KAAK,CAAC,EAAIA,EAAc,KAAK,CAAC,CAC/D,CACA,CACI,MAAM7b,EAAQ,CACV,kBAAkBqY,EAAY,CAC1B,GAAI,CACA,OAAAd,EAAuBc,CAAU,EAC1B,EACvB,MAC0B,CACV,MAAO,EACvB,CACS,EACD,uBAAwBd,EAKxB,iBAAkB,IAAM,CACpB,MAAMpM,EAAS4R,mBAAqBpG,EAAM,CAAC,EAC3C,OAAOqG,iBAAmBrG,EAAM,YAAYxL,CAAM,EAAGwL,EAAM,CAAC,CAC/D,EASD,WAAWlC,EAAa,EAAGoC,EAAQkB,EAAM,KAAM,CAC3C,OAAAlB,EAAM,eAAepC,CAAU,EAC/BoC,EAAM,SAAS,OAAO,CAAC,CAAC,EACjBA,CACV,CACJ,EAOD,SAASoG,EAAa5E,EAAYwC,EAAe,GAAM,CACnD,OAAO9C,EAAM,eAAeM,CAAU,EAAE,WAAWwC,CAAY,CACvE,CAII,SAASqC,EAAU7I,EAAM,CACrB,MAAMpU,EAAMoU,aAAgB,WACtB5P,EAAM,OAAO4P,GAAS,SACtBhT,GAAOpB,GAAOwE,IAAQ4P,EAAK,OACjC,OAAIpU,EACOoB,IAAQ8Z,GAAiB9Z,IAAQ+Z,EACxC3W,EACOpD,IAAQ,EAAI8Z,GAAiB9Z,IAAQ,EAAI+Z,EAChD/G,aAAgB0D,CAG5B,CAWI,SAASoF,EAAgBC,EAAUC,EAASxC,EAAe,GAAM,CAC7D,GAAIqC,EAAUE,CAAQ,EAClB,MAAM,IAAI,MAAM,+BAA+B,EACnD,GAAI,CAACF,EAAUG,CAAO,EAClB,MAAM,IAAI,MAAM,+BAA+B,EAEnD,OADUtF,EAAM,QAAQsF,CAAO,EACtB,SAAS9F,EAAuB6F,CAAQ,CAAC,EAAE,WAAWvC,CAAY,CACnF,CAKI,MAAMyC,EAAW3G,EAAM,UACnB,SAAUzO,EAAO,CAGb,MAAMoF,EAAMoK,kBAAmBxP,CAAK,EAC9BqV,EAAQrV,EAAM,OAAS,EAAIyO,EAAM,WACvC,OAAO4G,EAAQ,EAAIjQ,GAAO,OAAOiQ,CAAK,EAAIjQ,CAC7C,EACCiP,EAAgB5F,EAAM,eACxB,SAAUzO,EAAO,CACb,OAAOoT,EAAKgC,EAASpV,CAAK,CAAC,CAC9B,EAECsV,EAAaC,UAAW9G,EAAM,UAAU,EAI9C,SAAS+G,EAAWpQ,EAAK,CACrB,GAAI,OAAOA,GAAQ,SACf,MAAM,IAAI,MAAM,iBAAiB,EACrC,GAAI,EAAER,OAAOQ,GAAOA,EAAMkQ,GACtB,MAAM,IAAI,MAAM,uBAAuB7G,EAAM,UAAU,EAAE,EAE7D,OAAOmF,kBAAmBxO,EAAKqJ,EAAM,WAAW,CACxD,CAMI,SAASgH,EAAQtB,EAAShE,EAAYlG,EAAOyL,EAAgB,CACzD,GAAI,CAAC,YAAa,WAAW,EAAE,KAAMvb,GAAMA,KAAK8P,CAAI,EAChD,MAAM,IAAI,MAAM,qCAAqC,EACzD,KAAM,CAAE,KAAAxM,EAAM,YAAAkE,CAAW,EAAK8M,EAC9B,GAAI,CAAE,KAAAkH,EAAM,QAAAC,EAAS,aAAcC,CAAG,EAAK5L,EACvC0L,GAAQ,OACRA,EAAO,IACXxB,EAAUnO,cAAY,UAAWmO,CAAO,EACpCyB,IACAzB,EAAUnO,cAAY,oBAAqBvI,EAAK0W,CAAO,CAAC,GAI5D,MAAM2B,EAAQzB,EAAcF,CAAO,EAC7BtZ,EAAIwU,EAAuBc,CAAU,EACrC4F,EAAW,CAACP,EAAW3a,CAAC,EAAG2a,EAAWM,CAAK,CAAC,EAElD,GAAID,GAAO,KAAM,CAEb,MAAM/a,EAAI+a,IAAQ,GAAOlU,EAAYwH,EAAG,KAAK,EAAI0M,EACjDE,EAAS,KAAK/P,cAAY,eAAgBlL,CAAC,CAAC,CACxD,CACQ,MAAMoM,EAAO2H,cAAe,GAAGkH,CAAQ,EACjC7b,EAAI4b,EAEV,SAASE,EAAMC,EAAQ,CAEnB,MAAM9b,EAAIib,EAASa,CAAM,EACzB,GAAI,CAAC9G,EAAmBhV,CAAC,EACrB,OACJ,MAAM+b,GAAK7C,EAAKlZ,CAAC,EACXwO,EAAIkH,EAAM,KAAK,SAAS1V,CAAC,EAAE,WAC3BwF,EAAIyT,EAAKzK,EAAE,CAAC,EAClB,GAAIhJ,IAAMiF,MACN,OAIJ,MAAM9I,EAAIsX,EAAK8C,GAAK9C,EAAKlZ,EAAIyF,EAAI9E,CAAC,CAAC,EACnC,GAAIiB,IAAM8I,MACN,OACJ,IAAIsP,IAAYvL,EAAE,IAAMhJ,EAAI,EAAI,GAAK,OAAOgJ,EAAE,EAAI9D,KAAG,EACjDsR,GAAQra,EACZ,OAAI6Z,GAAQ9B,EAAsB/X,CAAC,IAC/Bqa,GAAQpC,EAAWjY,CAAC,EACpBoY,IAAY,GAET,IAAID,EAAUtU,EAAGwW,GAAOjC,EAAQ,CACnD,CACQ,MAAO,CAAE,KAAAhN,EAAM,MAAA8O,CAAO,CAC9B,CACI,MAAMN,EAAiB,CAAE,KAAMjH,EAAM,KAAM,QAAS,EAAO,EACrD2H,EAAiB,CAAE,KAAM3H,EAAM,KAAM,QAAS,EAAO,EAc3D,SAAS4H,EAAKlC,EAASmC,EAASrM,EAAOyL,EAAgB,CACnD,KAAM,CAAE,KAAAxO,EAAM,MAAA8O,CAAO,EAAGP,EAAQtB,EAASmC,EAASrM,CAAI,EAChDrG,EAAI6K,EAEV,OADa8H,iBAAkB3S,EAAE,KAAK,UAAWA,EAAE,YAAaA,EAAE,IAAI,EAC1DsD,EAAM8O,CAAK,CAC/B,CAEInG,EAAM,KAAK,eAAe,CAAC,EAe3B,SAAS2G,EAAOC,EAAWtC,EAASuC,EAAWzM,EAAOmM,EAAgB,OAClE,MAAMO,EAAKF,EAGX,GAFAtC,EAAUnO,cAAY,UAAWmO,CAAO,EACxCuC,EAAY1Q,cAAY,YAAa0Q,CAAS,EAC1C,WAAYzM,EACZ,MAAM,IAAI,MAAM,oCAAoC,EACxD,KAAM,CAAE,KAAA0L,EAAM,QAAAC,CAAO,EAAK3L,EAC1B,IAAI2M,EACA/N,EACJ,GAAI,CACA,GAAI,OAAO8N,GAAO,UAAYA,aAAc,WAGxC,GAAI,CACAC,EAAO3C,EAAU,QAAQ0C,CAAE,CAC/C,OACuBE,EAAU,CACb,GAAI,EAAEA,aAAoB7I,MAAI,KAC1B,MAAM6I,EACVD,EAAO3C,EAAU,YAAY0C,CAAE,CACnD,SAEqB,OAAOA,GAAO,UAAY,OAAOA,EAAG,GAAM,UAAY,OAAOA,EAAG,GAAM,SAAU,CACrF,KAAM,CAAE,EAAAhX,EAAG,EAAA7D,CAAC,EAAK6a,EACjBC,EAAO,IAAI3C,EAAUtU,EAAG7D,CAAC,CACzC,KAEgB,OAAM,IAAI,MAAM,OAAO,EAE3B+M,EAAIgH,EAAM,QAAQ6G,CAAS,CACvC,OACe5W,EAAO,CACV,GAAIA,EAAM,UAAY,QAClB,MAAM,IAAI,MAAM,gEAAgE,EACpF,MAAO,EACnB,CACQ,GAAI6V,GAAQiB,EAAK,SAAU,EACvB,MAAO,GACPhB,IACAzB,EAAU1F,EAAM,KAAK0F,CAAO,GAChC,KAAM,CAAE,EAAAxU,EAAG,EAAA7D,CAAC,EAAK8a,EACX7a,EAAIsY,EAAcF,CAAO,EACzB2C,EAAKzD,EAAKvX,CAAC,EACX4Y,EAAKtB,EAAKrX,EAAI+a,CAAE,EAChBnC,EAAKvB,EAAKzT,EAAImX,CAAE,EAChBtC,GAAIpb,EAAAyW,EAAM,KAAK,qBAAqBhH,EAAG6L,EAAIC,CAAE,IAAzC,YAAAvb,EAA4C,WACtD,OAAKob,EAEKpB,EAAKoB,EAAE,CAAC,IACL7U,EAFF,EAGnB,CACI,MAAO,CACH,MAAA8O,EACA,aAAAsG,EACA,gBAAAE,EACA,KAAAoB,EACA,OAAAG,EACA,gBAAiB3G,EACjB,UAAAoE,EACA,MAAAnc,CACH,CACL,YCj6BO,cAAmBuK,MAAK,CAC3B,YAAY5E,EAAMsZ,EAAM,CACpB,MAAO,EACP,KAAK,SAAW,GAChB,KAAK,UAAY,GACjBC,OAAWvZ,CAAI,EACf,MAAMH,EAAM0D,UAAQ+V,CAAI,EAExB,GADA,KAAK,MAAQtZ,EAAK,OAAQ,EACtB,OAAO,KAAK,MAAM,QAAW,WAC7B,MAAM,IAAI,MAAM,qDAAqD,EACzE,KAAK,SAAW,KAAK,MAAM,SAC3B,KAAK,UAAY,KAAK,MAAM,UAC5B,MAAM6E,EAAW,KAAK,SAChBjB,EAAM,IAAI,WAAWiB,CAAQ,EAEnCjB,EAAI,IAAI/D,EAAI,OAASgF,EAAW7E,EAAK,OAAQ,EAAC,OAAOH,CAAG,EAAE,OAAM,EAAKA,CAAG,EACxE,QAASnF,EAAI,EAAGA,EAAIkJ,EAAI,OAAQlJ,IAC5BkJ,EAAIlJ,CAAC,GAAK,GACd,KAAK,MAAM,OAAOkJ,CAAG,EAErB,KAAK,MAAQ5D,EAAK,OAAQ,EAE1B,QAAStF,EAAI,EAAGA,EAAIkJ,EAAI,OAAQlJ,IAC5BkJ,EAAIlJ,CAAC,GAAK,IACd,KAAK,MAAM,OAAOkJ,CAAG,EACrBA,EAAI,KAAK,CAAC,CAClB,CACI,OAAO4V,EAAK,CACRC,gBAAa,IAAI,EACjB,KAAK,MAAM,OAAOD,CAAG,EACd,IACf,CACI,WAAW3W,EAAK,CACZ4W,SAAa,IAAI,EACjBC,QAAY7W,EAAK,KAAK,SAAS,EAC/B,KAAK,SAAW,GAChB,KAAK,MAAM,WAAWA,CAAG,EACzB,KAAK,MAAM,OAAOA,CAAG,EACrB,KAAK,MAAM,WAAWA,CAAG,EACzB,KAAK,QAAS,CACtB,CACI,QAAS,CACL,MAAMA,EAAM,IAAI,WAAW,KAAK,MAAM,SAAS,EAC/C,YAAK,WAAWA,CAAG,EACZA,CACf,CACI,WAAW7H,EAAI,CAEXA,IAAOA,EAAK,OAAO,OAAO,OAAO,eAAe,IAAI,EAAG,CAAA,CAAE,GACzD,KAAM,CAAE,MAAA2e,EAAO,MAAAC,EAAO,SAAAnU,EAAU,UAAAC,EAAW,SAAAb,EAAU,UAAAC,CAAS,EAAK,KACnE,OAAA9J,EAAKA,EACLA,EAAG,SAAWyK,EACdzK,EAAG,UAAY0K,EACf1K,EAAG,SAAW6J,EACd7J,EAAG,UAAY8J,EACf9J,EAAG,MAAQ2e,EAAM,WAAW3e,EAAG,KAAK,EACpCA,EAAG,MAAQ4e,EAAM,WAAW5e,EAAG,KAAK,EAC7BA,CACf,CACI,SAAU,CACN,KAAK,UAAY,GACjB,KAAK,MAAM,QAAS,EACpB,KAAK,MAAM,QAAS,CAC5B,CACA,EAOO,MAAM6e,OAAO,CAAC7Z,EAAMH,EAAKia,IAAY,IAAIC,OAAK/Z,EAAMH,CAAG,EAAE,OAAOia,CAAO,EAAE,OAAQ,EACxFD,OAAK,OAAS,CAAC7Z,EAAMH,IAAQ,IAAIka,OAAK/Z,EAAMH,CAAG,EC3E/C,sEAKO,SAASma,UAAQha,EAAM,CAC1B,MAAO,CACH,KAAAA,EACA,KAAM,CAACH,KAAQoa,IAASJ,OAAK7Z,EAAMH,EAAK4D,cAAY,GAAGwW,CAAI,CAAC,EACpE,YAAQ/V,aACH,CACL,CACO,SAASgW,cAAY5E,EAAU6E,EAAS,CAC3C,MAAMC,EAAUpa,GAASqV,cAAY,CAAE,GAAGC,EAAU,GAAG0E,UAAQha,CAAI,EAAG,EACtE,OAAO,OAAO,OAAO,CAAE,GAAGoa,EAAOD,CAAO,EAAG,OAAAC,EAAQ,CACvD,CCfA,sEAQA,MAAMC,aAAa,OAAO,oEAAoE,EACxFC,aAAa,OAAO,oEAAoE,EACxFlT,MAAM,OAAO,CAAC,EACdC,MAAM,OAAO,CAAC,EACdkT,aAAa,CAAC/e,EAAGC,KAAOD,EAAIC,EAAI4L,OAAO5L,EAK7C,SAAS+e,UAAQhc,EAAG,CAChB,MAAM4M,EAAIiP,aAEJ/P,EAAM,OAAO,CAAC,EAAGmQ,EAAM,OAAO,CAAC,EAAGC,EAAO,OAAO,EAAE,EAAGC,EAAO,OAAO,EAAE,EAErEC,EAAO,OAAO,EAAE,EAAGC,EAAO,OAAO,EAAE,EAAGC,EAAO,OAAO,EAAE,EACtDlS,EAAMpK,EAAIA,EAAIA,EAAK4M,EACnBiI,EAAMzK,EAAKA,EAAKpK,EAAK4M,EACrB2P,EAAMhQ,OAAKsI,EAAI/I,EAAKc,CAAC,EAAIiI,EAAMjI,EAC/B4P,EAAMjQ,OAAKgQ,EAAIzQ,EAAKc,CAAC,EAAIiI,EAAMjI,EAC/B6P,EAAOlQ,OAAKiQ,EAAI3T,MAAK+D,CAAC,EAAIxC,EAAMwC,EAChC8P,EAAOnQ,OAAKkQ,EAAKP,EAAMtP,CAAC,EAAI6P,EAAO7P,EACnC+P,EAAOpQ,OAAKmQ,EAAKP,EAAMvP,CAAC,EAAI8P,EAAO9P,EACnCgQ,EAAOrQ,OAAKoQ,EAAKN,EAAMzP,CAAC,EAAI+P,EAAO/P,EACnCiQ,EAAQtQ,OAAKqQ,EAAKN,EAAM1P,CAAC,EAAIgQ,EAAOhQ,EACpCkQ,EAAQvQ,OAAKsQ,EAAMR,EAAMzP,CAAC,EAAI+P,EAAO/P,EACrCmQ,EAAQxQ,OAAKuQ,EAAMhR,EAAKc,CAAC,EAAIiI,EAAMjI,EACnCsI,EAAM3I,OAAKwQ,EAAMX,EAAMxP,CAAC,EAAI8P,EAAO9P,EACnCU,EAAMf,OAAK2I,EAAI+G,EAAKrP,CAAC,EAAIxC,EAAMwC,EAC/BO,EAAOZ,OAAKe,EAAIzE,MAAK+D,CAAC,EAC5B,GAAI,CAAC,GAAG,IAAI,GAAG,IAAIO,CAAI,EAAGnN,CAAC,EACvB,MAAM,IAAI,MAAM,yBAAyB,EAC7C,OAAOmN,CACX,CACA,MAAM,GAAK0B,QAAMgN,aAAY,OAAW,OAAW,CAAE,KAAMG,UAAS,EACvDgB,YAAYtB,cAAY,CACjC,EAAG,OAAO,CAAC,EACX,EAAG,OAAO,CAAC,EACX,GACA,EAAGI,aAEH,GAAI,OAAO,+EAA+E,EAC1F,GAAI,OAAO,+EAA+E,EAC1F,EAAG,OAAO,CAAC,EACX,KAAM,GAON,KAAM,CACF,KAAM,OAAO,oEAAoE,EACjF,YAAc5d,GAAM,CAChB,MAAMsC,EAAIsb,aACJmB,EAAK,OAAO,oCAAoC,EAChD9S,EAAK,CAACvB,MAAM,OAAO,oCAAoC,EACvDsU,EAAK,OAAO,qCAAqC,EACjD9S,EAAK6S,EACLE,EAAY,OAAO,qCAAqC,EACxD1P,EAAKsO,aAAW3R,EAAKlM,EAAGsC,CAAC,EACzB4c,EAAKrB,aAAW,CAAC5R,EAAKjM,EAAGsC,CAAC,EAChC,IAAIiV,EAAKvJ,MAAIhO,EAAIuP,EAAKwP,EAAKG,EAAKF,EAAI1c,CAAC,EACjCrC,EAAK+N,MAAI,CAACuB,EAAKtD,EAAKiT,EAAKhT,EAAI5J,CAAC,EAClC,MAAMgV,EAAQC,EAAK0H,EACbzH,EAAQvX,EAAKgf,EAKnB,GAJI3H,IACAC,EAAKjV,EAAIiV,GACTC,IACAvX,EAAKqC,EAAIrC,GACTsX,EAAK0H,GAAahf,EAAKgf,EACvB,MAAM,IAAI,MAAM,uCAAyCjf,CAAC,EAE9D,MAAO,CAAE,MAAAsX,EAAO,GAAAC,EAAI,MAAAC,EAAO,GAAAvX,CAAI,CAClC,CACJ,CACL,EAAGsK,QAAM,EAGHE,MAAM,OAAO,CAAC,EACd,GAAMnK,GAAM,OAAOA,GAAM,UAAYmK,MAAMnK,GAAKA,EAAIqd,aACpD,GAAMrd,GAAM,OAAOA,GAAM,UAAYmK,MAAMnK,GAAKA,EAAIsd,aAEpDuB,uBAAuB,CAAE,EAC/B,SAASC,aAAWC,KAAQC,EAAU,CAClC,IAAIC,EAAOJ,uBAAqBE,CAAG,EACnC,GAAIE,IAAS,OAAW,CACpB,MAAMC,EAAOjV,SAAO,WAAW,KAAK8U,EAAM5e,GAAMA,EAAE,WAAW,CAAC,CAAC,CAAC,EAChE8e,EAAOxY,cAAYyY,EAAMA,CAAI,EAC7BL,uBAAqBE,CAAG,EAAIE,CACpC,CACI,OAAOhV,SAAOxD,cAAYwY,EAAM,GAAGD,CAAQ,CAAC,CAChD,CAEA,MAAMG,eAAgBjL,GAAUA,EAAM,WAAW,EAAI,EAAE,MAAM,CAAC,EACxDkL,WAAY,GAAMhU,kBAAgB,EAAG,EAAE,EACvCiU,OAAQrf,GAAM0N,MAAI1N,EAAGqd,YAAU,EAC/B1E,OAAQ3Y,GAAM0N,MAAI1N,EAAGsd,YAAU,EAC/BlI,QAAQoJ,YAAU,gBAClBc,UAAU,CAAChR,EAAG9P,EAAGC,IAAM2W,QAAM,KAAK,qBAAqB9G,EAAG9P,EAAGC,CAAC,EAEpE,SAAS8gB,sBAAoBC,EAAM,CAC/B,IAAIC,EAAKjB,YAAU,MAAM,uBAAuBgB,CAAI,EAChDzf,EAAIqV,QAAM,eAAeqK,CAAE,EAE/B,MAAO,CAAE,OADM1f,EAAE,SAAQ,EAAK0f,EAAK9G,OAAK,CAAC8G,CAAE,EAClB,MAAON,eAAapf,CAAC,CAAG,CACrD,CAKA,SAAS2f,SAAO1f,EAAG,CACf,GAAI,CAAC,GAAGA,CAAC,EACL,MAAM,IAAI,MAAM,uBAAuB,EAC3C,MAAM2f,EAAKN,OAAKrf,EAAIA,CAAC,EACfG,EAAIkf,OAAKM,EAAK3f,EAAI,OAAO,CAAC,CAAC,EACjC,IAAIwB,EAAIgc,UAAQrd,CAAC,EACbqB,EAAI6I,QAAQF,QACZ3I,EAAI6d,OAAK,CAAC7d,CAAC,GACf,MAAMzB,EAAI,IAAIqV,QAAMpV,EAAGwB,EAAG4I,KAAG,EAC7B,OAAArK,EAAE,eAAgB,EACXA,CACX,CAIA,SAAS6f,eAAatc,EAAM,CACxB,OAAOqV,OAAKzN,kBAAgB4T,aAAW,oBAAqB,GAAGxb,CAAI,CAAC,CAAC,CACzE,CAIA,SAASuc,sBAAoBnK,EAAY,CACrC,OAAO6J,sBAAoB7J,CAAU,EAAE,KAC3C,CAKA,SAASoK,cAAYhD,EAASpH,EAAYqK,EAAU7Y,cAAY,EAAE,EAAG,CACjE,MAAMzH,EAAI8L,cAAY,UAAWuR,CAAO,EAClC,CAAE,MAAOzH,EAAI,OAAQjV,GAAMmf,sBAAoB7J,CAAU,EACzD,EAAInK,cAAY,UAAWwU,EAAS,EAAE,EACtCC,EAAIZ,WAAShf,EAAI8K,kBAAgB4T,aAAW,cAAe,CAAC,CAAC,CAAC,EAC9DmB,EAAOnB,aAAW,gBAAiBkB,EAAG3K,EAAI5V,CAAC,EAC3CygB,EAAKvH,OAAKzN,kBAAgB+U,CAAI,CAAC,EACrC,GAAIC,IAAO/V,MACP,MAAM,IAAI,MAAM,wBAAwB,EAC5C,KAAM,CAAE,MAAOgW,EAAI,OAAQzgB,GAAM6f,sBAAoBW,CAAE,EACjD7f,EAAIuf,YAAUO,EAAI9K,EAAI5V,CAAC,EACvBiU,EAAM,IAAI,WAAW,EAAE,EAI7B,GAHAA,EAAI,IAAIyM,EAAI,CAAC,EACbzM,EAAI,IAAI0L,WAASzG,OAAKjZ,EAAIW,EAAID,CAAC,CAAC,EAAG,EAAE,EAEjC,CAACggB,gBAAc1M,EAAKjU,EAAG4V,CAAE,EACzB,MAAM,IAAI,MAAM,kCAAkC,EACtD,OAAO3B,CACX,CAKA,SAAS0M,gBAAcpE,EAAWc,EAASb,EAAW,CAClD,MAAMvI,EAAMnI,cAAY,YAAayQ,EAAW,EAAE,EAC5Cvc,EAAI8L,cAAY,UAAWuR,CAAO,EAClCuD,EAAM9U,cAAY,YAAa0Q,EAAW,EAAE,EAClD,GAAI,CACA,MAAM7N,EAAIsR,SAAOxU,kBAAgBmV,CAAG,CAAC,EAC/Bnb,EAAIgG,kBAAgBwI,EAAI,SAAS,EAAG,EAAE,CAAC,EAC7C,GAAI,CAAC,GAAGxO,CAAC,EACL,MAAO,GACX,MAAM7D,EAAI6J,kBAAgBwI,EAAI,SAAS,GAAI,EAAE,CAAC,EAC9C,GAAI,CAAC,GAAGrS,CAAC,EACL,MAAO,GACX,MAAMhB,EAAIuf,YAAUR,WAASla,CAAC,EAAGia,eAAa/Q,CAAC,EAAG3O,CAAC,EAC7Csa,EAAIuF,UAAQlR,EAAG/M,EAAGsX,OAAK,CAACtY,CAAC,CAAC,EAChC,MAAI,GAAC0Z,GAAK,CAACA,EAAE,SAAU,GAAIA,EAAE,WAAW,IAAM7U,EAGtD,MACkB,CACV,MAAO,EACf,CACA,CACY,MAACob,UAAkC,CAC3C,aAAcT,sBACd,KAAMC,cACN,OAAQM,gBACR,MAAO,CACH,iBAAkB5B,YAAU,MAAM,iBAC1C,OAAQkB,SACR,aAAQP,eACR,gBAAQ/T,kBACR,gBAAQF,kBACR,WAAQ4T,aACR,IAAQpR,KACH,CACL,EC5Ma3H,SAAS,OAAO,YAAe,UAAY,WAAY,WAAa,WAAW,OAAS,OCArG,sEAQA,MAAM,IAAOvH,GAAMA,aAAa,WAKnByH,aAAc3I,GAAQ,IAAI,SAASA,EAAI,OAAQA,EAAI,WAAYA,EAAI,UAAU,EAE7E4I,OAAO,CAACC,EAAMC,IAAWD,GAAS,GAAKC,EAAWD,IAASC,EAG3DC,OAAO,IAAI,WAAW,IAAI,YAAY,CAAC,SAAU,CAAC,EAAE,MAAM,EAAE,CAAC,IAAM,GAChF,GAAI,CAACA,OACD,MAAM,IAAI,MAAM,6CAA6C,EACjE,MAAMiE,QAAQ,MAAM,KAAK,CAAE,OAAQ,GAAK,EAAE,CAAC1G,EAAGlG,IAAMA,EAAE,SAAS,EAAE,EAAE,SAAS,EAAG,GAAG,CAAC,EAI5E,SAAS8M,aAAWjF,EAAO,CAC9B,GAAI,CAAC,IAAIA,CAAK,EACV,MAAM,IAAI,MAAM,qBAAqB,EAEzC,IAAIkF,EAAM,GACV,QAAS/M,EAAI,EAAGA,EAAI6H,EAAM,OAAQ7H,IAC9B+M,GAAOH,QAAM/E,EAAM7H,CAAC,CAAC,EAEzB,OAAO+M,CACX,CAIO,SAASI,aAAWJ,EAAK,CAC5B,GAAI,OAAOA,GAAQ,SACf,MAAM,IAAI,MAAM,4BAA8B,OAAOA,CAAG,EAC5D,MAAM/L,EAAM+L,EAAI,OAChB,GAAI/L,EAAM,EACN,MAAM,IAAI,MAAM,0DAA4DA,CAAG,EACnF,MAAMoM,EAAQ,IAAI,WAAWpM,EAAM,CAAC,EACpC,QAAShB,EAAI,EAAGA,EAAIoN,EAAM,OAAQpN,IAAK,CACnC,MAAMqN,EAAIrN,EAAI,EACRsN,EAAUP,EAAI,MAAMM,EAAGA,EAAI,CAAC,EAC5BE,EAAO,OAAO,SAASD,EAAS,EAAE,EACxC,GAAI,OAAO,MAAMC,CAAI,GAAKA,EAAO,EAC7B,MAAM,IAAI,MAAM,uBAAuB,EAC3CH,EAAMpN,CAAC,EAAIuN,CACnB,CACI,OAAOH,CACX,CAqBO,SAASxE,cAAYxE,EAAK,CAC7B,GAAI,OAAOA,GAAQ,SACf,MAAM,IAAI,MAAM,oCAAoC,OAAOA,CAAG,EAAE,EACpE,OAAO,IAAI,WAAW,IAAI,YAAa,EAAC,OAAOA,CAAG,CAAC,CACvD,CAMO,SAASyE,UAAQC,EAAM,CAG1B,GAFI,OAAOA,GAAS,WAChBA,EAAOF,cAAYE,CAAI,GACvB,CAAC,IAAIA,CAAI,EACT,MAAM,IAAI,MAAM,4BAA4B,OAAOA,CAAI,EAAE,EAC7D,OAAOA,CACX,CAIO,SAASC,iBAAeC,EAAQ,CACnC,MAAMxB,EAAI,IAAI,WAAWwB,EAAO,OAAO,CAACC,EAAKnI,IAAMmI,EAAMnI,EAAE,OAAQ,CAAC,CAAC,EACrE,IAAIoI,EAAM,EACV,OAAAF,EAAO,QAASlI,GAAM,CAClB,GAAI,CAAC,IAAIA,CAAC,EACN,MAAM,IAAI,MAAM,qBAAqB,EACzC0G,EAAE,IAAI1G,EAAGoI,CAAG,EACZA,GAAOpI,EAAE,MACjB,CAAK,EACM0G,CACX,CAEO,IAAA,OAAA,KAAW,CAEd,OAAQ,CACJ,OAAO,KAAK,WAAY,CAChC,CACA,EASO,SAAS2B,kBAAgBC,EAAU,CACtC,MAAMC,EAASC,GAAQF,EAAU,EAAC,OAAOP,UAAQS,CAAG,CAAC,EAAE,OAAQ,EACzDC,EAAMH,EAAU,EACtB,OAAAC,EAAM,UAAYE,EAAI,UACtBF,EAAM,SAAWE,EAAI,SACrBF,EAAM,OAAS,IAAMD,EAAU,EACxBC,CACX,CAoBO,SAASG,cAAYC,EAAc,GAAI,CAC1C,GAAIpB,UAAU,OAAOA,SAAO,iBAAoB,WAC5C,OAAOA,SAAO,gBAAgB,IAAI,WAAWoB,CAAW,CAAC,EAE7D,MAAM,IAAI,MAAM,wCAAwC,CAC5D,CCzJO,SAAS7B,SAAO,EAAG,CACtB,GAAI,CAAC,OAAO,cAAc,CAAC,GAAK,EAAI,EAChC,MAAM,IAAI,MAAM,2BAA2B,CAAC,EAAE,CACtD,CACO,SAASib,OAAK9hB,EAAG,CACpB,GAAI,OAAOA,GAAM,UACb,MAAM,IAAI,MAAM,yBAAyBA,CAAC,EAAE,CACpD,CACO,SAAS8G,QAAM9G,KAAM+G,EAAS,CACjC,GAAI,EAAE/G,aAAa,YACf,MAAM,IAAI,MAAM,qBAAqB,EACzC,GAAI+G,EAAQ,OAAS,GAAK,CAACA,EAAQ,SAAS/G,EAAE,MAAM,EAChD,MAAM,IAAI,MAAM,iCAAiC+G,CAAO,mBAAmB/G,EAAE,MAAM,EAAE,CAC7F,CACO,SAAS,KAAKuE,EAAM,CACvB,GAAI,OAAOA,GAAS,YAAc,OAAOA,EAAK,QAAW,WACrD,MAAM,IAAI,MAAM,iDAAiD,EACrEsC,SAAOtC,EAAK,SAAS,EACrBsC,SAAOtC,EAAK,QAAQ,CACxB,CACO,SAAS,OAAO0C,EAAUC,EAAgB,GAAM,CACnD,GAAID,EAAS,UACT,MAAM,IAAI,MAAM,kCAAkC,EACtD,GAAIC,GAAiBD,EAAS,SAC1B,MAAM,IAAI,MAAM,uCAAuC,CAC/D,CACO,SAAS,OAAOG,EAAKH,EAAU,CAClCH,QAAMM,CAAG,EACT,MAAMC,EAAMJ,EAAS,UACrB,GAAIG,EAAI,OAASC,EACb,MAAM,IAAI,MAAM,yDAAyDA,CAAG,EAAE,CAEtF,CACA,MAAM,OAAS,CACf,OAAIR,SACJ,KAAIib,OACJ,MAAIhb,QACA,KACA,OACA,MACJ,ECrCA,SAAS6B,eAAaC,EAAMC,EAAYC,EAAOlB,EAAM,CACjD,GAAI,OAAOgB,EAAK,cAAiB,WAC7B,OAAOA,EAAK,aAAaC,EAAYC,EAAOlB,CAAI,EACpD,MAAMmB,EAAO,OAAO,EAAE,EAChBC,EAAW,OAAO,UAAU,EAC5BC,EAAK,OAAQH,GAASC,EAAQC,CAAQ,EACtCE,EAAK,OAAOJ,EAAQE,CAAQ,EAC5BnG,EAAI+E,EAAO,EAAI,EACflI,EAAIkI,EAAO,EAAI,EACrBgB,EAAK,UAAUC,EAAahG,EAAGoG,EAAIrB,CAAI,EACvCgB,EAAK,UAAUC,EAAanJ,EAAGwJ,EAAItB,CAAI,CAC3C,CAEO,MAAM,aAAauB,MAAK,CAC3B,YAAYC,EAAUC,EAAWC,EAAW1B,EAAM,CAC9C,MAAO,EACP,KAAK,SAAWwB,EAChB,KAAK,UAAYC,EACjB,KAAK,UAAYC,EACjB,KAAK,KAAO1B,EACZ,KAAK,SAAW,GAChB,KAAK,OAAS,EACd,KAAK,IAAM,EACX,KAAK,UAAY,GACjB,KAAK,OAAS,IAAI,WAAWwB,CAAQ,EACrC,KAAK,KAAO5B,aAAW,KAAK,MAAM,CAC1C,CACI,OAAOO,EAAM,CACT,OAAO,OAAO,IAAI,EAClB,KAAM,CAAE,KAAAa,EAAM,OAAAW,EAAQ,SAAAH,CAAU,EAAG,KACnCrB,EAAOD,UAAQC,CAAI,EACnB,MAAM9H,EAAM8H,EAAK,OACjB,QAASyB,EAAM,EAAGA,EAAMvJ,GAAM,CAC1B,MAAMwJ,EAAO,KAAK,IAAIL,EAAW,KAAK,IAAKnJ,EAAMuJ,CAAG,EAEpD,GAAIC,IAASL,EAAU,CACnB,MAAMM,EAAWlC,aAAWO,CAAI,EAChC,KAAOqB,GAAYnJ,EAAMuJ,EAAKA,GAAOJ,EACjC,KAAK,QAAQM,EAAUF,CAAG,EAC9B,QAChB,CACYD,EAAO,IAAIxB,EAAK,SAASyB,EAAKA,EAAMC,CAAI,EAAG,KAAK,GAAG,EACnD,KAAK,KAAOA,EACZD,GAAOC,EACH,KAAK,MAAQL,IACb,KAAK,QAAQR,EAAM,CAAC,EACpB,KAAK,IAAM,EAE3B,CACQ,YAAK,QAAUb,EAAK,OACpB,KAAK,WAAY,EACV,IACf,CACI,WAAWX,EAAK,CACZ,OAAO,OAAO,IAAI,EAClB,OAAO,OAAOA,EAAK,IAAI,EACvB,KAAK,SAAW,GAIhB,KAAM,CAAE,OAAAmC,EAAQ,KAAAX,EAAM,SAAAQ,EAAU,KAAAxB,CAAM,EAAG,KACzC,GAAI,CAAE,IAAA4B,CAAG,EAAK,KAEdD,EAAOC,GAAK,EAAI,IAChB,KAAK,OAAO,SAASA,CAAG,EAAE,KAAK,CAAC,EAE5B,KAAK,UAAYJ,EAAWI,IAC5B,KAAK,QAAQZ,EAAM,CAAC,EACpBY,EAAM,GAGV,QAASvK,EAAIuK,EAAKvK,EAAImK,EAAUnK,IAC5BsK,EAAOtK,CAAC,EAAI,EAIhB0J,eAAaC,EAAMQ,EAAW,EAAG,OAAO,KAAK,OAAS,CAAC,EAAGxB,CAAI,EAC9D,KAAK,QAAQgB,EAAM,CAAC,EACpB,MAAMe,EAAQnC,aAAWJ,CAAG,EACtBnH,EAAM,KAAK,UAEjB,GAAIA,EAAM,EACN,MAAM,IAAI,MAAM,6CAA6C,EACjE,MAAM2J,EAAS3J,EAAM,EACf4J,EAAQ,KAAK,IAAK,EACxB,GAAID,EAASC,EAAM,OACf,MAAM,IAAI,MAAM,oCAAoC,EACxD,QAAS5K,EAAI,EAAGA,EAAI2K,EAAQ3K,IACxB0K,EAAM,UAAU,EAAI1K,EAAG4K,EAAM5K,CAAC,EAAG2I,CAAI,CACjD,CACI,QAAS,CACL,KAAM,CAAE,OAAA2B,EAAQ,UAAAF,CAAS,EAAK,KAC9B,KAAK,WAAWE,CAAM,EACtB,MAAMO,EAAMP,EAAO,MAAM,EAAGF,CAAS,EACrC,YAAK,QAAS,EACPS,CACf,CACI,WAAWvK,EAAI,CACXA,IAAOA,EAAK,IAAI,KAAK,aACrBA,EAAG,IAAI,GAAG,KAAK,IAAG,CAAE,EACpB,KAAM,CAAE,SAAA6J,EAAU,OAAAG,EAAQ,OAAAQ,EAAQ,SAAAC,EAAU,UAAAC,EAAW,IAAAT,CAAG,EAAK,KAC/D,OAAAjK,EAAG,OAASwK,EACZxK,EAAG,IAAMiK,EACTjK,EAAG,SAAWyK,EACdzK,EAAG,UAAY0K,EACXF,EAASX,GACT7J,EAAG,OAAO,IAAIgK,CAAM,EACjBhK,CACf,CACA,CC7GA,MAAM2K,MAAM,CAACnK,EAAGC,EAAG0B,IAAO3B,EAAIC,EAAM,CAACD,EAAI2B,EAEnCyI,MAAM,CAACpK,EAAGC,EAAG0B,IAAO3B,EAAIC,EAAMD,EAAI2B,EAAM1B,EAAI0B,EAI5C0I,WAAW,IAAI,YAAY,CAC7B,WAAY,WAAY,WAAY,WAAY,UAAY,WAAY,WAAY,WACpF,WAAY,UAAY,UAAY,WAAY,WAAY,WAAY,WAAY,WACpF,WAAY,WAAY,UAAY,UAAY,UAAY,WAAY,WAAY,WACpF,WAAY,WAAY,WAAY,WAAY,WAAY,WAAY,UAAY,UACpF,UAAY,UAAY,WAAY,WAAY,WAAY,WAAY,WAAY,WACpF,WAAY,WAAY,WAAY,WAAY,WAAY,WAAY,WAAY,UACpF,UAAY,UAAY,UAAY,UAAY,UAAY,WAAY,WAAY,WACpF,WAAY,WAAY,WAAY,WAAY,WAAY,WAAY,WAAY,UACxF,CAAC,EAGK,GAAK,IAAI,YAAY,CACvB,WAAY,WAAY,WAAY,WAAY,WAAY,WAAY,UAAY,UACxF,CAAC,EAGKE,WAAW,IAAI,YAAY,EAAE,eACnC,cAAqB,IAAK,CACtB,aAAc,CACV,MAAM,GAAI,GAAI,EAAG,EAAK,EAGtB,KAAK,EAAI,GAAG,CAAC,EAAI,EACjB,KAAK,EAAI,GAAG,CAAC,EAAI,EACjB,KAAK,EAAI,GAAG,CAAC,EAAI,EACjB,KAAK,EAAI,GAAG,CAAC,EAAI,EACjB,KAAK,EAAI,GAAG,CAAC,EAAI,EACjB,KAAK,EAAI,GAAG,CAAC,EAAI,EACjB,KAAK,EAAI,GAAG,CAAC,EAAI,EACjB,KAAK,EAAI,GAAG,CAAC,EAAI,CACzB,CACI,KAAM,CACF,KAAM,CAAE,EAAAE,EAAG,EAAAC,EAAG,EAAAC,EAAG,EAAAC,EAAG,EAAAC,EAAG,EAAAC,EAAG,EAAAC,EAAG,EAAAC,CAAC,EAAK,KACnC,MAAO,CAACP,EAAGC,EAAGC,EAAGC,EAAGC,EAAGC,EAAGC,EAAGC,CAAC,CACtC,CAEI,IAAIP,EAAGC,EAAGC,EAAGC,EAAGC,EAAGC,EAAGC,EAAGC,EAAG,CACxB,KAAK,EAAIP,EAAI,EACb,KAAK,EAAIC,EAAI,EACb,KAAK,EAAIC,EAAI,EACb,KAAK,EAAIC,EAAI,EACb,KAAK,EAAIC,EAAI,EACb,KAAK,EAAIC,EAAI,EACb,KAAK,EAAIC,EAAI,EACb,KAAK,EAAIC,EAAI,CACrB,CACI,QAAQnC,EAAMoC,EAAQ,CAElB,QAAS/L,EAAI,EAAGA,EAAI,GAAIA,IAAK+L,GAAU,EACnCV,WAASrL,CAAC,EAAI2J,EAAK,UAAUoC,EAAQ,EAAK,EAC9C,QAAS/L,EAAI,GAAIA,EAAI,GAAIA,IAAK,CAC1B,MAAMgM,EAAMX,WAASrL,EAAI,EAAE,EACrBiM,EAAKZ,WAASrL,EAAI,CAAC,EACnBkM,EAAK1D,OAAKwD,EAAK,CAAC,EAAIxD,OAAKwD,EAAK,EAAE,EAAKA,IAAQ,EAC7CG,EAAK3D,OAAKyD,EAAI,EAAE,EAAIzD,OAAKyD,EAAI,EAAE,EAAKA,IAAO,GACjDZ,WAASrL,CAAC,EAAKmM,EAAKd,WAASrL,EAAI,CAAC,EAAIkM,EAAKb,WAASrL,EAAI,EAAE,EAAK,CAC3E,CAEQ,GAAI,CAAE,EAAAuL,EAAG,EAAAC,EAAG,EAAAC,EAAG,EAAAC,EAAG,EAAAC,EAAG,EAAAC,EAAG,EAAAC,EAAG,EAAAC,CAAC,EAAK,KACjC,QAAS9L,EAAI,EAAGA,EAAI,GAAIA,IAAK,CACzB,MAAMoM,EAAS5D,OAAKmD,EAAG,CAAC,EAAInD,OAAKmD,EAAG,EAAE,EAAInD,OAAKmD,EAAG,EAAE,EAC9CU,EAAMP,EAAIM,EAASnB,MAAIU,EAAGC,EAAGC,CAAC,EAAIV,WAASnL,CAAC,EAAIqL,WAASrL,CAAC,EAAK,EAE/DsM,GADS9D,OAAK+C,EAAG,CAAC,EAAI/C,OAAK+C,EAAG,EAAE,EAAI/C,OAAK+C,EAAG,EAAE,GAC/BL,MAAIK,EAAGC,EAAGC,CAAC,EAAK,EACrCK,EAAID,EACJA,EAAID,EACJA,EAAID,EACJA,EAAKD,EAAIW,EAAM,EACfX,EAAID,EACJA,EAAID,EACJA,EAAID,EACJA,EAAKc,EAAKC,EAAM,CAC5B,CAEQf,EAAKA,EAAI,KAAK,EAAK,EACnBC,EAAKA,EAAI,KAAK,EAAK,EACnBC,EAAKA,EAAI,KAAK,EAAK,EACnBC,EAAKA,EAAI,KAAK,EAAK,EACnBC,EAAKA,EAAI,KAAK,EAAK,EACnBC,EAAKA,EAAI,KAAK,EAAK,EACnBC,EAAKA,EAAI,KAAK,EAAK,EACnBC,EAAKA,EAAI,KAAK,EAAK,EACnB,KAAK,IAAIP,EAAGC,EAAGC,EAAGC,EAAGC,EAAGC,EAAGC,EAAGC,CAAC,CACvC,CACI,YAAa,CACTT,WAAS,KAAK,CAAC,CACvB,CACI,SAAU,CACN,KAAK,IAAI,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,CAAC,EAC/B,KAAK,OAAO,KAAK,CAAC,CAC1B,CACA,EAEA,MAAM,eAAemB,QAAO,CACxB,aAAc,CACV,MAAO,EACP,KAAK,EAAI,YACT,KAAK,EAAI,UACT,KAAK,EAAI,UACT,KAAK,EAAI,WACT,KAAK,EAAI,SACT,KAAK,EAAI,WACT,KAAK,EAAI,WACT,KAAK,EAAI,YACT,KAAK,UAAY,EACzB,CACA,CAKY,MAACD,SAASpD,kBAAgB,IAAM,IAAIqD,QAAQ,EAClCrD,kBAAgB,IAAM,IAAI,MAAQ,EC1HxD,oEACO,SAAS,aAAa,EAAG,CAC5B,GAAI,CAAC,OAAO,cAAc,CAAC,EACvB,MAAM,IAAI,MAAM,kBAAkB,CAAC,EAAE,CAC7C,CACA,SAAS,SAASvD,EAAM,CACpB,MAAMkd,EAAO,CAAChiB,EAAGC,IAAO0B,GAAM3B,EAAEC,EAAE0B,CAAC,CAAC,EAC9BsgB,EAAS,MAAM,KAAKnd,CAAI,EACzB,QAAO,EACP,OAAO,CAACyM,EAAKrS,IAAOqS,EAAMyQ,EAAKzQ,EAAKrS,EAAE,MAAM,EAAIA,EAAE,OAAS,MAAS,EACnEgjB,EAASpd,EAAK,OAAO,CAACyM,EAAKrS,IAAOqS,EAAMyQ,EAAKzQ,EAAKrS,EAAE,MAAM,EAAIA,EAAE,OAAS,MAAS,EACxF,MAAO,CAAE,OAAA+iB,EAAQ,OAAAC,CAAQ,CAC7B,CACA,SAAS,SAASC,EAAU,CACxB,MAAO,CACH,OAASC,GAAW,CAChB,GAAI,CAAC,MAAM,QAAQA,CAAM,GAAMA,EAAO,QAAU,OAAOA,EAAO,CAAC,GAAM,SACjE,MAAM,IAAI,MAAM,qDAAqD,EACzE,OAAOA,EAAO,IAAKljB,GAAM,CAErB,GADA,aAAaA,CAAC,EACVA,EAAI,GAAKA,GAAKijB,EAAS,OACvB,MAAM,IAAI,MAAM,iCAAiCjjB,CAAC,eAAeijB,EAAS,MAAM,GAAG,EACvF,OAAOA,EAASjjB,CAAC,CACjC,CAAa,CACJ,EACD,OAASmjB,GAAU,CACf,GAAI,CAAC,MAAM,QAAQA,CAAK,GAAMA,EAAM,QAAU,OAAOA,EAAM,CAAC,GAAM,SAC9D,MAAM,IAAI,MAAM,kDAAkD,EACtE,OAAOA,EAAM,IAAKC,GAAW,CACzB,GAAI,OAAOA,GAAW,SAClB,MAAM,IAAI,MAAM,uCAAuCA,CAAM,EAAE,EACnE,MAAMvjB,EAAQojB,EAAS,QAAQG,CAAM,EACrC,GAAIvjB,IAAU,GACV,MAAM,IAAI,MAAM,oBAAoBujB,CAAM,eAAeH,CAAQ,EAAE,EACvE,OAAOpjB,CACvB,CAAa,CACJ,CACJ,CACL,CACA,SAAS,KAAKwjB,EAAY,GAAI,CAC1B,GAAI,OAAOA,GAAc,SACrB,MAAM,IAAI,MAAM,iCAAiC,EACrD,MAAO,CACH,OAAS9iB,GAAS,CACd,GAAI,CAAC,MAAM,QAAQA,CAAI,GAAMA,EAAK,QAAU,OAAOA,EAAK,CAAC,GAAM,SAC3D,MAAM,IAAI,MAAM,8CAA8C,EAClE,QAASP,KAAKO,EACV,GAAI,OAAOP,GAAM,SACb,MAAM,IAAI,MAAM,iCAAiCA,CAAC,EAAE,EAC5D,OAAOO,EAAK,KAAK8iB,CAAS,CAC7B,EACD,OAAS/iB,GAAO,CACZ,GAAI,OAAOA,GAAO,SACd,MAAM,IAAI,MAAM,oCAAoC,EACxD,OAAOA,EAAG,MAAM+iB,CAAS,CAC5B,CACJ,CACL,CACA,SAAS,QAAQxP,EAAMyP,EAAM,IAAK,CAE9B,GADA,aAAazP,CAAI,EACb,OAAOyP,GAAQ,SACf,MAAM,IAAI,MAAM,8BAA8B,EAClD,MAAO,CACH,OAAOxa,EAAM,CACT,GAAI,CAAC,MAAM,QAAQA,CAAI,GAAMA,EAAK,QAAU,OAAOA,EAAK,CAAC,GAAM,SAC3D,MAAM,IAAI,MAAM,iDAAiD,EACrE,QAAS9I,KAAK8I,EACV,GAAI,OAAO9I,GAAM,SACb,MAAM,IAAI,MAAM,oCAAoCA,CAAC,EAAE,EAC/D,KAAQ8I,EAAK,OAAS+K,EAAQ,GAC1B/K,EAAK,KAAKwa,CAAG,EACjB,OAAOxa,CACV,EACD,OAAOqa,EAAO,CACV,GAAI,CAAC,MAAM,QAAQA,CAAK,GAAMA,EAAM,QAAU,OAAOA,EAAM,CAAC,GAAM,SAC9D,MAAM,IAAI,MAAM,iDAAiD,EACrE,QAASnjB,KAAKmjB,EACV,GAAI,OAAOnjB,GAAM,SACb,MAAM,IAAI,MAAM,oCAAoCA,CAAC,EAAE,EAC/D,IAAIujB,EAAMJ,EAAM,OAChB,GAAKI,EAAM1P,EAAQ,EACf,MAAM,IAAI,MAAM,2DAA2D,EAC/E,KAAO0P,EAAM,GAAKJ,EAAMI,EAAM,CAAC,IAAMD,EAAKC,IACtC,GAAI,GAAIA,EAAM,GAAK1P,EAAQ,GACvB,MAAM,IAAI,MAAM,8CAA8C,EAEtE,OAAOsP,EAAM,MAAM,EAAGI,CAAG,CAC5B,CACJ,CACL,CACA,SAASC,YAAUC,EAAI,CACnB,GAAI,OAAOA,GAAO,WACd,MAAM,IAAI,MAAM,iCAAiC,EACrD,MAAO,CAAE,OAASljB,GAASA,EAAM,OAASD,GAAOmjB,EAAGnjB,CAAE,CAAG,CAC7D,CACA,SAAS,aAAawI,EAAMvI,EAAMD,EAAI,CAClC,GAAIC,EAAO,EACP,MAAM,IAAI,MAAM,4BAA4BA,CAAI,8BAA8B,EAClF,GAAID,EAAK,EACL,MAAM,IAAI,MAAM,0BAA0BA,CAAE,8BAA8B,EAC9E,GAAI,CAAC,MAAM,QAAQwI,CAAI,EACnB,MAAM,IAAI,MAAM,oCAAoC,EACxD,GAAI,CAACA,EAAK,OACN,MAAO,CAAE,EACb,IAAIyB,EAAM,EACV,MAAMM,EAAM,CAAE,EACRqY,EAAS,MAAM,KAAKpa,CAAI,EAM9B,IALAoa,EAAO,QAASxgB,GAAM,CAElB,GADA,aAAaA,CAAC,EACVA,EAAI,GAAKA,GAAKnC,EACd,MAAM,IAAI,MAAM,kBAAkBmC,CAAC,EAAE,CACjD,CAAK,IACY,CACT,IAAIghB,EAAQ,EACRC,EAAO,GACX,QAAS3jB,EAAIuK,EAAKvK,EAAIkjB,EAAO,OAAQljB,IAAK,CACtC,MAAM4jB,EAAQV,EAAOljB,CAAC,EAChB6jB,EAAYtjB,EAAOmjB,EAAQE,EACjC,GAAI,CAAC,OAAO,cAAcC,CAAS,GAC9BtjB,EAAOmjB,EAASnjB,IAASmjB,GAC1BG,EAAYD,IAAUrjB,EAAOmjB,EAC7B,MAAM,IAAI,MAAM,8BAA8B,EAIlD,GAFAA,EAAQG,EAAYvjB,EACpB4iB,EAAOljB,CAAC,EAAI,KAAK,MAAM6jB,EAAYvjB,CAAE,EACjC,CAAC,OAAO,cAAc4iB,EAAOljB,CAAC,CAAC,GAAKkjB,EAAOljB,CAAC,EAAIM,EAAKojB,IAAUG,EAC/D,MAAM,IAAI,MAAM,8BAA8B,EAClD,GAAKF,EAEKT,EAAOljB,CAAC,EAGd2jB,EAAO,GAFPpZ,EAAMvK,MAFN,SAKhB,CAEQ,GADA6K,EAAI,KAAK6Y,CAAK,EACVC,EACA,KACZ,CACI,QAAS3jB,EAAI,EAAGA,EAAI8I,EAAK,OAAS,GAAKA,EAAK9I,CAAC,IAAM,EAAGA,IAClD6K,EAAI,KAAK,CAAC,EACd,OAAOA,EAAI,QAAS,CACxB,CACA,MAAM,IAAM,CAAC/J,EAAGC,IAAQA,EAAQ,IAAIA,EAAGD,EAAIC,CAAC,EAAhBD,EACtB,YAAc,CAACP,EAAMD,IAAOC,GAAQD,EAAK,IAAIC,EAAMD,CAAE,GAC3D,SAAS,cAAcwI,EAAMvI,EAAMD,EAAIwjB,EAAS,CAC5C,GAAI,CAAC,MAAM,QAAQhb,CAAI,EACnB,MAAM,IAAI,MAAM,qCAAqC,EACzD,GAAIvI,GAAQ,GAAKA,EAAO,GACpB,MAAM,IAAI,MAAM,6BAA6BA,CAAI,EAAE,EACvD,GAAID,GAAM,GAAKA,EAAK,GAChB,MAAM,IAAI,MAAM,2BAA2BA,CAAE,EAAE,EACnD,GAAI,YAAYC,EAAMD,CAAE,EAAI,GACxB,MAAM,IAAI,MAAM,sCAAsCC,CAAI,OAAOD,CAAE,cAAc,YAAYC,EAAMD,CAAE,CAAC,EAAE,EAE5G,IAAIojB,EAAQ,EACRnZ,EAAM,EACV,MAAMmK,EAAO,GAAKpU,EAAK,EACjBuK,EAAM,CAAE,EACd,UAAWvG,KAAKwE,EAAM,CAElB,GADA,aAAaxE,CAAC,EACVA,GAAK,GAAK/D,EACV,MAAM,IAAI,MAAM,oCAAoC+D,CAAC,SAAS/D,CAAI,EAAE,EAExE,GADAmjB,EAASA,GAASnjB,EAAQ+D,EACtBiG,EAAMhK,EAAO,GACb,MAAM,IAAI,MAAM,qCAAqCgK,CAAG,SAAShK,CAAI,EAAE,EAE3E,IADAgK,GAAOhK,EACAgK,GAAOjK,EAAIiK,GAAOjK,EACrBuK,EAAI,MAAO6Y,GAAUnZ,EAAMjK,EAAOoU,KAAU,CAAC,EACjDgP,GAAS,GAAKnZ,EAAM,CAC5B,CAEI,GADAmZ,EAASA,GAAUpjB,EAAKiK,EAAQmK,EAC5B,CAACoP,GAAWvZ,GAAOhK,EACnB,MAAM,IAAI,MAAM,gBAAgB,EACpC,GAAI,CAACujB,GAAWJ,EACZ,MAAM,IAAI,MAAM,qBAAqBA,CAAK,EAAE,EAChD,OAAII,GAAWvZ,EAAM,GACjBM,EAAI,KAAK6Y,IAAU,CAAC,EACjB7Y,CACX,CACA,SAAS,MAAMoC,EAAK,CAChB,oBAAaA,CAAG,EACT,CACH,OAASpF,GAAU,CACf,GAAI,EAAEA,aAAiB,YACnB,MAAM,IAAI,MAAM,yCAAyC,EAC7D,OAAO,aAAa,MAAM,KAAKA,CAAK,EAAG,GAAK,EAAGoF,CAAG,CACrD,EACD,OAASiW,GAAW,CAChB,GAAI,CAAC,MAAM,QAAQA,CAAM,GAAMA,EAAO,QAAU,OAAOA,EAAO,CAAC,GAAM,SACjE,MAAM,IAAI,MAAM,+CAA+C,EACnE,OAAO,WAAW,KAAK,aAAaA,EAAQjW,EAAK,GAAK,CAAC,CAAC,CAC3D,CACJ,CACL,CACA,SAAS,OAAO4G,EAAMkQ,EAAa,GAAO,CAEtC,GADA,aAAalQ,CAAI,EACbA,GAAQ,GAAKA,EAAO,GACpB,MAAM,IAAI,MAAM,mCAAmC,EACvD,GAAI,YAAY,EAAGA,CAAI,EAAI,IAAM,YAAYA,EAAM,CAAC,EAAI,GACpD,MAAM,IAAI,MAAM,wBAAwB,EAC5C,MAAO,CACH,OAAShM,GAAU,CACf,GAAI,EAAEA,aAAiB,YACnB,MAAM,IAAI,MAAM,0CAA0C,EAC9D,OAAO,cAAc,MAAM,KAAKA,CAAK,EAAG,EAAGgM,EAAM,CAACkQ,CAAU,CAC/D,EACD,OAASb,GAAW,CAChB,GAAI,CAAC,MAAM,QAAQA,CAAM,GAAMA,EAAO,QAAU,OAAOA,EAAO,CAAC,GAAM,SACjE,MAAM,IAAI,MAAM,gDAAgD,EACpE,OAAO,WAAW,KAAK,cAAcA,EAAQrP,EAAM,EAAGkQ,CAAU,CAAC,CACpE,CACJ,CACL,CACA,SAAS,cAAcN,EAAI,CACvB,GAAI,OAAOA,GAAO,WACd,MAAM,IAAI,MAAM,qCAAqC,EACzD,OAAO,YAAa7d,EAAM,CACtB,GAAI,CACA,OAAO6d,EAAG,MAAM,KAAM7d,CAAI,CACtC,MACkB,CAAA,CACb,CACL,CA6BO,MAAM,OAAS,MAAM,OAAO,CAAC,EAAG,SAAS,kBAAkB,EAAG,KAAK,EAAE,CAAC,EAChE,OAAS,MAAM,OAAO,CAAC,EAAG,SAAS,kCAAkC,EAAG,QAAQ,CAAC,EAAG,KAAK,EAAE,CAAC,EAChF,MAAM,OAAO,CAAC,EAAG,SAAS,kCAAkC,EAAG,QAAQ,CAAC,EAAG,KAAK,EAAE,CAAC,EAC7E,MAAM,OAAO,CAAC,EAAG,SAAS,kCAAkC,EAAG,KAAK,EAAE,EAAG4d,YAAW7f,GAAMA,EAAE,cAAc,QAAQ,KAAM,GAAG,EAAE,QAAQ,QAAS,GAAG,CAAC,CAAC,EAC3K,MAAM,OAAS,MAAM,OAAO,CAAC,EAAG,SAAS,kEAAkE,EAAG,QAAQ,CAAC,EAAG,KAAK,EAAE,CAAC,EAC5H,UAAY,MAAM,OAAO,CAAC,EAAG,SAAS,kEAAkE,EAAG,QAAQ,CAAC,EAAG,KAAK,EAAE,CAAC,EACtI,UAAaqgB,GAAQ,MAAM,MAAM,EAAE,EAAG,SAASA,CAAG,EAAG,KAAK,EAAE,CAAC,EACtD,OAAS,UAAU,4DAA4D,EAChE,UAAU,4DAA4D,EACzE,UAAU,4DAA4D,EAC/F,MAAM,cAAgB,CAAC,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,GAAI,EAAE,EACrC,UAAY,CACrB,OAAOlb,EAAM,CACT,IAAI+B,EAAM,GACV,QAAS7K,EAAI,EAAGA,EAAI8I,EAAK,OAAQ9I,GAAK,EAAG,CACrC,MAAMikB,EAAQnb,EAAK,SAAS9I,EAAGA,EAAI,CAAC,EACpC6K,GAAO,OAAO,OAAOoZ,CAAK,EAAE,SAAS,cAAcA,EAAM,MAAM,EAAG,GAAG,CACjF,CACQ,OAAOpZ,CACV,EACD,OAAOzG,EAAK,CACR,IAAIyG,EAAM,CAAE,EACZ,QAAS7K,EAAI,EAAGA,EAAIoE,EAAI,OAAQpE,GAAK,GAAI,CACrC,MAAMiW,EAAQ7R,EAAI,MAAMpE,EAAGA,EAAI,EAAE,EAC3BmK,EAAW,cAAc,QAAQ8L,EAAM,MAAM,EAC7CgO,EAAQ,OAAO,OAAOhO,CAAK,EACjC,QAAS5I,EAAI,EAAGA,EAAI4W,EAAM,OAAS9Z,EAAUkD,IACzC,GAAI4W,EAAM5W,CAAC,IAAM,EACb,MAAM,IAAI,MAAM,0BAA0B,EAElDxC,EAAMA,EAAI,OAAO,MAAM,KAAKoZ,EAAM,MAAMA,EAAM,OAAS9Z,CAAQ,CAAC,CAAC,CAC7E,CACQ,OAAO,WAAW,KAAKU,CAAG,CAC7B,CACL,EAEM,cAAgB,MAAM,SAAS,kCAAkC,EAAG,KAAK,EAAE,CAAC,EAC5E,mBAAqB,CAAC,UAAY,UAAY,UAAY,WAAY,SAAU,EACtF,SAAS,cAAcqZ,EAAK,CACxB,MAAMnjB,EAAImjB,GAAO,GACjB,IAAIC,GAAOD,EAAM,WAAc,EAC/B,QAASlkB,EAAI,EAAGA,EAAI,mBAAmB,OAAQA,KACrCe,GAAKf,EAAK,KAAO,IACnBmkB,GAAO,mBAAmBnkB,CAAC,GAEnC,OAAOmkB,CACX,CACA,SAAS,aAAa/H,EAAQgI,EAAOC,EAAgB,EAAG,CACpD,MAAMrjB,EAAMob,EAAO,OACnB,IAAI+H,EAAM,EACV,QAASnkB,EAAI,EAAGA,EAAIgB,EAAKhB,IAAK,CAC1B,MAAMyC,EAAI2Z,EAAO,WAAWpc,CAAC,EAC7B,GAAIyC,EAAI,IAAMA,EAAI,IACd,MAAM,IAAI,MAAM,mBAAmB2Z,CAAM,GAAG,EAChD+H,EAAM,cAAcA,CAAG,EAAK1hB,GAAK,CACzC,CACI0hB,EAAM,cAAcA,CAAG,EACvB,QAASnkB,EAAI,EAAGA,EAAIgB,EAAKhB,IACrBmkB,EAAM,cAAcA,CAAG,EAAK/H,EAAO,WAAWpc,CAAC,EAAI,GACvD,QAASkG,KAAKke,EACVD,EAAM,cAAcA,CAAG,EAAIje,EAC/B,QAASlG,EAAI,EAAGA,EAAI,EAAGA,IACnBmkB,EAAM,cAAcA,CAAG,EAC3B,OAAAA,GAAOE,EACA,cAAc,OAAO,cAAc,CAACF,EAAM,GAAK,EAAE,EAAG,GAAI,EAAG,EAAK,CAAC,CAC5E,CACA,SAAS,UAAUG,EAAU,CACzB,MAAMC,EAAiBD,IAAa,SAAW,EAAI,UAC7CE,EAAS,OAAO,CAAC,EACjBC,EAAYD,EAAO,OACnBE,EAAUF,EAAO,OACjBG,EAAkB,cAAcF,CAAS,EAC/C,SAAS1B,EAAO3G,EAAQgI,EAAOQ,EAAQ,GAAI,CACvC,GAAI,OAAOxI,GAAW,SAClB,MAAM,IAAI,MAAM,8CAA8C,OAAOA,CAAM,EAAE,EACjF,GAAI,CAAC,MAAM,QAAQgI,CAAK,GAAMA,EAAM,QAAU,OAAOA,EAAM,CAAC,GAAM,SAC9D,MAAM,IAAI,MAAM,uDAAuD,OAAOA,CAAK,EAAE,EACzF,MAAMS,EAAezI,EAAO,OAAS,EAAIgI,EAAM,OAC/C,GAAIQ,IAAU,IAASC,EAAeD,EAClC,MAAM,IAAI,UAAU,UAAUC,CAAY,kBAAkBD,CAAK,EAAE,EACvE,OAAAxI,EAASA,EAAO,YAAa,EACtB,GAAGA,CAAM,IAAI,cAAc,OAAOgI,CAAK,CAAC,GAAG,aAAahI,EAAQgI,EAAOG,CAAc,CAAC,EACrG,CACI,SAASvB,EAAO5e,EAAKwgB,EAAQ,GAAI,CAC7B,GAAI,OAAOxgB,GAAQ,SACf,MAAM,IAAI,MAAM,6CAA6C,OAAOA,CAAG,EAAE,EAC7E,GAAIA,EAAI,OAAS,GAAMwgB,IAAU,IAASxgB,EAAI,OAASwgB,EACnD,MAAM,IAAI,UAAU,wBAAwBxgB,EAAI,MAAM,KAAKA,CAAG,mBAAmBwgB,CAAK,GAAG,EAC7F,MAAME,EAAU1gB,EAAI,YAAa,EACjC,GAAIA,IAAQ0gB,GAAW1gB,IAAQA,EAAI,YAAa,EAC5C,MAAM,IAAI,MAAM,uCAAuC,EAC3DA,EAAM0gB,EACN,MAAMC,EAAW3gB,EAAI,YAAY,GAAG,EACpC,GAAI2gB,IAAa,GAAKA,IAAa,GAC/B,MAAM,IAAI,MAAM,yDAAyD,EAC7E,MAAM3I,EAAShY,EAAI,MAAM,EAAG2gB,CAAQ,EAC9BP,EAASpgB,EAAI,MAAM2gB,EAAW,CAAC,EACrC,GAAIP,EAAO,OAAS,EAChB,MAAM,IAAI,MAAM,yCAAyC,EAC7D,MAAMJ,EAAQ,cAAc,OAAOI,CAAM,EAAE,MAAM,EAAG,EAAE,EAChDvb,EAAM,aAAamT,EAAQgI,EAAOG,CAAc,EACtD,GAAI,CAACC,EAAO,SAASvb,CAAG,EACpB,MAAM,IAAI,MAAM,uBAAuB7E,CAAG,eAAe6E,CAAG,GAAG,EACnE,MAAO,CAAE,OAAAmT,EAAQ,MAAAgI,CAAO,CAChC,CACI,MAAMY,EAAe,cAAchC,CAAM,EACzC,SAASiC,EAAc7gB,EAAK,CACxB,KAAM,CAAE,OAAAgY,EAAQ,MAAAgI,CAAK,EAAKpB,EAAO5e,EAAK,EAAK,EAC3C,MAAO,CAAE,OAAAgY,EAAQ,MAAAgI,EAAO,MAAOK,EAAUL,CAAK,CAAG,CACzD,CACI,MAAO,CAAE,OAAArB,EAAQ,OAAAC,EAAQ,cAAAiC,EAAe,aAAAD,EAAc,UAAAP,EAAW,gBAAAE,EAAiB,QAAAD,CAAS,CAC/F,CACO,MAAMQ,SAAS,UAAU,QAAQ,EACjB,UAAU,SAAS,EACnC,MAAMC,OAAO,CAChB,OAASrc,GAAS,IAAI,YAAW,EAAG,OAAOA,CAAI,EAC/C,OAAS1E,GAAQ,IAAI,YAAW,EAAG,OAAOA,CAAG,CACjD,EACa2I,MAAM,MAAM,OAAO,CAAC,EAAG,SAAS,kBAAkB,EAAG,KAAK,EAAE,EAAGyW,YAAW7f,GAAM,CACzF,GAAI,OAAOA,GAAM,UAAYA,EAAE,OAAS,EACpC,MAAM,IAAI,UAAU,oCAAoC,OAAOA,CAAC,gBAAgBA,EAAE,MAAM,EAAE,EAC9F,OAAOA,EAAE,YAAa,CAC1B,CAAC,CAAC,EACI,OAAS,CACf,KAAIwhB,OAAI,IAAEpY,MAAK,OAAQ,OAAQ,OAAQ,UAAW,OAAQ,SAC1D,EACkE,UAAO,KAAK,MAAM,EAAE,KAAK,IAAI,ICzX/F,SAAS,OAAO,EAAG,CACf,GAAI,CAAC,OAAO,cAAc,CAAC,GAAK,EAAI,EAChC,MAAM,IAAI,MAAM,kCAAkC,CAAC,EAAE,CAC7D,CACA,SAAS,KAAKhM,EAAG,CACb,GAAI,OAAOA,GAAM,UACb,MAAM,IAAI,MAAM,yBAAyBA,CAAC,EAAE,CACpD,CACO,SAASqkB,UAAQtkB,EAAG,CACvB,OAAQA,aAAa,YAChBA,GAAK,MAAQ,OAAOA,GAAM,UAAYA,EAAE,YAAY,OAAS,YACtE,CACA,SAAS,MAAMC,KAAM+G,EAAS,CAC1B,GAAI,CAACsd,UAAQrkB,CAAC,EACV,MAAM,IAAI,MAAM,qBAAqB,EACzC,GAAI+G,EAAQ,OAAS,GAAK,CAACA,EAAQ,SAAS/G,EAAE,MAAM,EAChD,MAAM,IAAI,MAAM,iCAAiC+G,CAAO,mBAAmB/G,EAAE,MAAM,EAAE,CAC7F,CCjBA,uEAKO,MAAM,IAAOnB,GAAQ,IAAI,YAAYA,EAAI,OAAQA,EAAI,WAAY,KAAK,MAAMA,EAAI,WAAa,CAAC,CAAC,EAKzF,KAAO,IAAI,WAAW,IAAI,YAAY,CAAC,SAAU,CAAC,EAAE,MAAM,EAAE,CAAC,IAAM,GAChF,GAAI,CAAC,KACD,MAAM,IAAI,MAAM,6CAA6C,EA4H1D,SAAS,UAAUylB,EAAUvT,EAAM,CACtC,GAAIA,GAAQ,MAAQ,OAAOA,GAAS,SAChC,MAAM,IAAI,MAAM,yBAAyB,EAE7C,OADe,OAAO,OAAOuT,EAAUvT,CAAI,CAE/C,CAEO,SAAS9D,aAAWlN,EAAGC,EAAG,CAC7B,GAAID,EAAE,SAAWC,EAAE,OACf,MAAO,GACX,IAAIukB,EAAO,EACX,QAAStlB,EAAI,EAAGA,EAAIc,EAAE,OAAQd,IAC1BslB,GAAQxkB,EAAEd,CAAC,EAAIe,EAAEf,CAAC,EACtB,OAAOslB,IAAS,CACpB,CAOO,MAAM,WAAa,CAACC,EAAQ9iB,KAC/B,OAAO,OAAOA,EAAG8iB,CAAM,EAChB9iB,GC9IL,WAAa,GAGb,KAAO,IAEb,SAAS,KAAK,EAAG,CACb,OAAQ,GAAK,EAAM,KAAO,EAAE,GAAK,EACrC,CACA,SAAS,IAAI3B,EAAGC,EAAG,CACf,IAAI8J,EAAM,EACV,KAAO9J,EAAI,EAAGA,IAAM,EAEhB8J,GAAO/J,EAAI,EAAEC,EAAI,GACjBD,EAAI,KAAKA,CAAC,EAEd,OAAO+J,CACX,CAGA,MAAM,MAAwB,IAAM,CAChC,IAAIyX,EAAI,IAAI,WAAW,GAAG,EAC1B,QAAStiB,EAAI,EAAGsC,EAAI,EAAGtC,EAAI,IAAKA,IAAKsC,GAAK,KAAKA,CAAC,EAC5CggB,EAAEtiB,CAAC,EAAIsC,EACX,MAAMkjB,EAAM,IAAI,WAAW,GAAG,EAC9BA,EAAI,CAAC,EAAI,GACT,QAASxlB,EAAI,EAAGA,EAAI,IAAKA,IAAK,CAC1B,IAAIsC,EAAIggB,EAAE,IAAMtiB,CAAC,EACjBsC,GAAKA,GAAK,EACVkjB,EAAIlD,EAAEtiB,CAAC,CAAC,GAAKsC,EAAKA,GAAK,EAAMA,GAAK,EAAMA,GAAK,EAAMA,GAAK,EAAK,IAAQ,GAC7E,CACI,OAAOkjB,CACX,GAAI,EAEE,QAA0B,KAAK,IAAI,CAAC3Y,EAAGQ,IAAM,KAAK,QAAQA,CAAC,CAAC,EAE5D,SAAY,GAAO,GAAK,GAAO,IAAM,EACrC,SAAY,GAAO,GAAK,EAAM,IAAM,GAK1C,SAAS,UAAUoY,EAAMhC,EAAI,CACzB,GAAIgC,EAAK,SAAW,IAChB,MAAM,IAAI,MAAM,mBAAmB,EACvC,MAAMC,EAAK,IAAI,YAAY,GAAG,EAAE,IAAI,CAAC7Y,EAAGQ,IAAMoW,EAAGgC,EAAKpY,CAAC,CAAC,CAAC,EACnDhB,EAAKqZ,EAAG,IAAI,QAAQ,EACpBpZ,EAAKD,EAAG,IAAI,QAAQ,EACpBsZ,EAAKrZ,EAAG,IAAI,QAAQ,EACpBsZ,EAAM,IAAI,YAAY,IAAM,GAAG,EAC/BC,EAAM,IAAI,YAAY,IAAM,GAAG,EAC/BC,EAAQ,IAAI,YAAY,IAAM,GAAG,EACvC,QAAS9lB,EAAI,EAAGA,EAAI,IAAKA,IACrB,QAASqN,EAAI,EAAGA,EAAI,IAAKA,IAAK,CAC1B,MAAM0Y,EAAM/lB,EAAI,IAAMqN,EACtBuY,EAAIG,CAAG,EAAIL,EAAG1lB,CAAC,EAAIqM,EAAGgB,CAAC,EACvBwY,EAAIE,CAAG,EAAIzZ,EAAGtM,CAAC,EAAI2lB,EAAGtY,CAAC,EACvByY,EAAMC,CAAG,EAAKN,EAAKzlB,CAAC,GAAK,EAAKylB,EAAKpY,CAAC,CAChD,CAEI,MAAO,CAAE,KAAAoY,EAAM,MAAAK,EAAO,GAAAJ,EAAI,GAAArZ,EAAI,GAAAC,EAAI,GAAAqZ,EAAI,IAAAC,EAAK,IAAAC,CAAK,CACpD,CACA,MAAM,cAAgC,UAAU,KAAOliB,GAAO,IAAIA,EAAG,CAAC,GAAK,GAAOA,GAAK,GAAOA,GAAK,EAAK,IAAIA,EAAG,CAAC,CAAC,EAC3G,cAAgC,UAAU,QAAUA,GAAO,IAAIA,EAAG,EAAE,GAAK,GAAO,IAAIA,EAAG,EAAE,GAAK,GAAO,IAAIA,EAAG,CAAC,GAAK,EAAK,IAAIA,EAAG,EAAE,CAAC,EACjI,SAA2B,IAAM,CACnC,MAAMtB,EAAI,IAAI,WAAW,EAAE,EAC3B,QAASrC,EAAI,EAAGsC,EAAI,EAAGtC,EAAI,GAAIA,IAAKsC,EAAI,KAAKA,CAAC,EAC1CD,EAAErC,CAAC,EAAIsC,EACX,OAAOD,CACX,GAAI,EACG,SAAS,YAAY8C,EAAK,CAC7B6gB,MAAO7gB,CAAG,EACV,MAAMnE,EAAMmE,EAAI,OAChB,GAAI,CAAC,CAAC,GAAI,GAAI,EAAE,EAAE,SAASnE,CAAG,EAC1B,MAAM,IAAI,MAAM,qDAAqDA,CAAG,EAAE,EAC9E,KAAM,CAAE,MAAA8kB,CAAK,EAAK,cACZG,EAAM,IAAI9gB,CAAG,EACb+gB,EAAKD,EAAI,OACTE,EAAW7hB,GAAM,UAAUwhB,EAAOxhB,EAAGA,EAAGA,EAAGA,CAAC,EAC5C8hB,EAAK,IAAI,YAAYplB,EAAM,EAAE,EACnColB,EAAG,IAAIH,CAAG,EAEV,QAASjmB,EAAIkmB,EAAIlmB,EAAIomB,EAAG,OAAQpmB,IAAK,CACjC,IAAIsiB,EAAI8D,EAAGpmB,EAAI,CAAC,EACZA,EAAIkmB,IAAO,EACX5D,EAAI6D,EAAQ,SAAS7D,CAAC,CAAC,EAAI,QAAQtiB,EAAIkmB,EAAK,CAAC,EACxCA,EAAK,GAAKlmB,EAAIkmB,IAAO,IAC1B5D,EAAI6D,EAAQ7D,CAAC,GACjB8D,EAAGpmB,CAAC,EAAIomB,EAAGpmB,EAAIkmB,CAAE,EAAI5D,CAC7B,CACI,OAAO8D,CACX,CACO,SAAS,eAAejhB,EAAK,CAChC,MAAMkhB,EAAS,YAAYlhB,CAAG,EACxBihB,EAAKC,EAAO,MAAO,EACnBH,EAAKG,EAAO,OACZ,CAAE,MAAAP,CAAK,EAAK,cACZ,CAAE,GAAAJ,EAAI,GAAArZ,EAAI,GAAAC,EAAI,GAAAqZ,CAAI,EAAG,cAE3B,QAAS3lB,EAAI,EAAGA,EAAIkmB,EAAIlmB,GAAK,EACzB,QAASqN,EAAI,EAAGA,EAAI,EAAGA,IACnB+Y,EAAGpmB,EAAIqN,CAAC,EAAIgZ,EAAOH,EAAKlmB,EAAI,EAAIqN,CAAC,EAEzCgZ,EAAO,KAAK,CAAC,EAEb,QAASrmB,EAAI,EAAGA,EAAIkmB,EAAK,EAAGlmB,IAAK,CAC7B,MAAMsC,EAAI8jB,EAAGpmB,CAAC,EACR6D,EAAI,UAAUiiB,EAAOxjB,EAAGA,EAAGA,EAAGA,CAAC,EACrC8jB,EAAGpmB,CAAC,EAAI0lB,EAAG7hB,EAAI,GAAI,EAAIwI,EAAIxI,IAAM,EAAK,GAAI,EAAIyI,EAAIzI,IAAM,GAAM,GAAI,EAAI8hB,EAAG9hB,IAAM,EAAE,CACzF,CACI,OAAOuiB,CACX,CAEA,SAAS,UAAUR,EAAKC,EAAK3Z,EAAIC,EAAIma,EAAIC,EAAI,CACzC,OAAQX,EAAM1Z,GAAM,EAAK,MAAYC,IAAO,EAAK,GAAK,EAClD0Z,EAAMS,IAAO,EAAK,MAAYC,IAAO,GAAM,GAAK,CACxD,CACA,SAAS,UAAUT,EAAO5Z,EAAIC,EAAIma,EAAIC,EAAI,CACtC,OAAQT,EAAO5Z,EAAK,IAASC,EAAK,KAAO,EACpC2Z,EAAQQ,IAAO,GAAM,IAAUC,IAAO,GAAM,KAAO,GAAK,EACjE,CACA,SAASC,UAAQJ,EAAIla,EAAIC,EAAIma,EAAIC,EAAI,CACjC,KAAM,CAAE,MAAAT,EAAO,IAAAF,EAAK,IAAAC,CAAK,EAAG,cAC5B,IAAI7jB,EAAI,EACPkK,GAAMka,EAAGpkB,GAAG,EAAKmK,GAAMia,EAAGpkB,GAAG,EAAKskB,GAAMF,EAAGpkB,GAAG,EAAKukB,GAAMH,EAAGpkB,GAAG,EAChE,MAAMykB,EAASL,EAAG,OAAS,EAAI,EAC/B,QAASpmB,EAAI,EAAGA,EAAIymB,EAAQzmB,IAAK,CAC7B,MAAM+Y,EAAKqN,EAAGpkB,GAAG,EAAI,UAAU4jB,EAAKC,EAAK3Z,EAAIC,EAAIma,EAAIC,CAAE,EACjDvN,EAAKoN,EAAGpkB,GAAG,EAAI,UAAU4jB,EAAKC,EAAK1Z,EAAIma,EAAIC,EAAIra,CAAE,EACjDkF,EAAKgV,EAAGpkB,GAAG,EAAI,UAAU4jB,EAAKC,EAAKS,EAAIC,EAAIra,EAAIC,CAAE,EACjD8M,EAAKmN,EAAGpkB,GAAG,EAAI,UAAU4jB,EAAKC,EAAKU,EAAIra,EAAIC,EAAIma,CAAE,EACtDpa,EAAK6M,EAAM5M,EAAK6M,EAAMsN,EAAKlV,EAAMmV,EAAKtN,CAC/C,CAEI,MAAMF,EAAKqN,EAAGpkB,GAAG,EAAI,UAAU8jB,EAAO5Z,EAAIC,EAAIma,EAAIC,CAAE,EAC9CvN,EAAKoN,EAAGpkB,GAAG,EAAI,UAAU8jB,EAAO3Z,EAAIma,EAAIC,EAAIra,CAAE,EAC9CkF,EAAKgV,EAAGpkB,GAAG,EAAI,UAAU8jB,EAAOQ,EAAIC,EAAIra,EAAIC,CAAE,EAC9C8M,EAAKmN,EAAGpkB,GAAG,EAAI,UAAU8jB,EAAOS,EAAIra,EAAIC,EAAIma,CAAE,EACpD,MAAO,CAAE,GAAIvN,EAAI,GAAIC,EAAI,GAAI5H,EAAI,GAAI6H,CAAI,CAC7C,CACA,SAASyN,UAAQN,EAAIla,EAAIC,EAAIma,EAAIC,EAAI,CACjC,KAAM,CAAE,MAAAT,EAAO,IAAAF,EAAK,IAAAC,CAAK,EAAG,cAC5B,IAAI7jB,EAAI,EACPkK,GAAMka,EAAGpkB,GAAG,EAAKmK,GAAMia,EAAGpkB,GAAG,EAAKskB,GAAMF,EAAGpkB,GAAG,EAAKukB,GAAMH,EAAGpkB,GAAG,EAChE,MAAMykB,EAASL,EAAG,OAAS,EAAI,EAC/B,QAASpmB,EAAI,EAAGA,EAAIymB,EAAQzmB,IAAK,CAC7B,MAAM+Y,EAAKqN,EAAGpkB,GAAG,EAAI,UAAU4jB,EAAKC,EAAK3Z,EAAIqa,EAAID,EAAIna,CAAE,EACjD6M,EAAKoN,EAAGpkB,GAAG,EAAI,UAAU4jB,EAAKC,EAAK1Z,EAAID,EAAIqa,EAAID,CAAE,EACjDlV,EAAKgV,EAAGpkB,GAAG,EAAI,UAAU4jB,EAAKC,EAAKS,EAAIna,EAAID,EAAIqa,CAAE,EACjDtN,EAAKmN,EAAGpkB,GAAG,EAAI,UAAU4jB,EAAKC,EAAKU,EAAID,EAAIna,EAAID,CAAE,EACtDA,EAAK6M,EAAM5M,EAAK6M,EAAMsN,EAAKlV,EAAMmV,EAAKtN,CAC/C,CAEI,MAAMF,EAAKqN,EAAGpkB,GAAG,EAAI,UAAU8jB,EAAO5Z,EAAIqa,EAAID,EAAIna,CAAE,EAC9C6M,EAAKoN,EAAGpkB,GAAG,EAAI,UAAU8jB,EAAO3Z,EAAID,EAAIqa,EAAID,CAAE,EAC9ClV,EAAKgV,EAAGpkB,GAAG,EAAI,UAAU8jB,EAAOQ,EAAIna,EAAID,EAAIqa,CAAE,EAC9CtN,EAAKmN,EAAGpkB,GAAG,EAAI,UAAU8jB,EAAOS,EAAID,EAAIna,EAAID,CAAE,EACpD,MAAO,CAAE,GAAI6M,EAAI,GAAIC,EAAI,GAAI5H,EAAI,GAAI6H,CAAI,CAC7C,CACA,SAAS,OAAOjY,EAAK2lB,EAAK,CACtB,GAAI,CAACA,EACD,OAAO,IAAI,WAAW3lB,CAAG,EAE7B,GADAglB,MAAOW,CAAG,EACNA,EAAI,OAAS3lB,EACb,MAAM,IAAI,MAAM,oDAAoDA,CAAG,UAAU2lB,EAAI,MAAM,EAAE,EACjG,OAAOA,CACX,CAgGA,SAAS,qBAAqB7d,EAAM,CAEhC,GADAkd,MAAOld,CAAI,EACPA,EAAK,OAAS,aAAe,EAC7B,MAAM,IAAI,MAAM,uEAAuE,UAAU,EAAE,CAE3G,CACA,SAAS,qBAAqB8d,EAAWC,EAAOF,EAAK,CACjD,IAAIhc,EAASic,EAAU,OACvB,MAAME,EAAYnc,EAAS,WAC3B,GAAI,CAACkc,GAASC,IAAc,EACxB,MAAM,IAAI,MAAM,yDAAyD,EAC7E,MAAM/lB,EAAI,IAAI6lB,CAAS,EACvB,GAAIC,EAAO,CACP,IAAI5O,EAAO,WAAa6O,EACnB7O,IACDA,EAAO,YACXtN,EAASA,EAASsN,CAC1B,CACI,MAAM9P,EAAM,OAAOwC,EAAQgc,CAAG,EACxB7kB,EAAI,IAAIqG,CAAG,EACjB,MAAO,CAAE,EAAApH,EAAG,EAAAe,EAAG,IAAAqG,CAAK,CACxB,CACA,SAAS,aAAaW,EAAM+d,EAAO,CAC/B,GAAI,CAACA,EACD,OAAO/d,EACX,MAAM9H,EAAM8H,EAAK,OACjB,GAAI,CAAC9H,EACD,MAAM,IAAI,MAAM,yCAAyC,EAC7D,MAAM+lB,EAAWje,EAAK9H,EAAM,CAAC,EAC7B,GAAI+lB,GAAY,GAAKA,EAAW,GAC5B,MAAM,IAAI,MAAM,kCAAkCA,CAAQ,EAAE,EAChE,MAAM5e,EAAMW,EAAK,SAAS,EAAG,CAACie,CAAQ,EACtC,QAAS/mB,EAAI,EAAGA,EAAI+mB,EAAU/mB,IAC1B,GAAI8I,EAAK9H,EAAMhB,EAAI,CAAC,IAAM+mB,EACtB,MAAM,IAAI,MAAM,0BAA0B,EAClD,OAAO5e,CACX,CACA,SAAS,QAAQ8P,EAAM,CACnB,MAAM1O,EAAM,IAAI,WAAW,EAAE,EACvByd,EAAQ,IAAIzd,CAAG,EACrBA,EAAI,IAAI0O,CAAI,EACZ,MAAMgP,EAAc,WAAahP,EAAK,OACtC,QAASjY,EAAI,WAAainB,EAAajnB,EAAI,WAAYA,IACnDuJ,EAAIvJ,CAAC,EAAIinB,EACb,OAAOD,CACX,CA6CO,MAAM,IAAM,WAAW,CAAE,UAAW,GAAI,YAAa,IAAM,SAASE,EAAI/hB,EAAKgiB,EAAIrV,EAAO,CAAA,EAAI,CAC/FkU,MAAO7gB,CAAG,EACV6gB,MAAOmB,EAAI,EAAE,EACb,MAAMN,EAAQ,CAAC/U,EAAK,eACpB,MAAO,CACH,QAAS,CAAC8U,EAAWD,IAAQ,CACzB,MAAMP,EAAK,YAAYjhB,CAAG,EACpB,CAAE,EAAApE,EAAG,EAAAe,EAAG,IAAKslB,CAAM,EAAG,qBAAqBR,EAAWC,EAAOF,CAAG,EAChEU,EAAM,IAAIF,CAAE,EAElB,IAAIjb,EAAKmb,EAAI,CAAC,EAAGlb,EAAKkb,EAAI,CAAC,EAAGf,EAAKe,EAAI,CAAC,EAAGd,EAAKc,EAAI,CAAC,EACjDrnB,EAAI,EACR,KAAOA,EAAI,GAAKe,EAAE,QACbmL,GAAMnL,EAAEf,EAAI,CAAC,EAAKmM,GAAMpL,EAAEf,EAAI,CAAC,EAAKsmB,GAAMvlB,EAAEf,EAAI,CAAC,EAAKumB,GAAMxlB,EAAEf,EAAI,CAAC,EACnE,CAAE,GAAAkM,EAAI,GAAAC,EAAI,GAAAma,EAAI,GAAAC,CAAI,EAAGC,UAAQJ,EAAIla,EAAIC,EAAIma,EAAIC,CAAE,EAC/CzkB,EAAE9B,GAAG,EAAIkM,EAAMpK,EAAE9B,GAAG,EAAImM,EAAMrK,EAAE9B,GAAG,EAAIsmB,EAAMxkB,EAAE9B,GAAG,EAAIumB,EAE3D,GAAIM,EAAO,CACP,MAAMG,EAAQ,QAAQJ,EAAU,SAAS5mB,EAAI,CAAC,CAAC,EAC9CkM,GAAM8a,EAAM,CAAC,EAAK7a,GAAM6a,EAAM,CAAC,EAAKV,GAAMU,EAAM,CAAC,EAAKT,GAAMS,EAAM,CAAC,EACnE,CAAE,GAAA9a,EAAI,GAAAC,EAAI,GAAAma,EAAI,GAAAC,CAAI,EAAGC,UAAQJ,EAAIla,EAAIC,EAAIma,EAAIC,CAAE,EAC/CzkB,EAAE9B,GAAG,EAAIkM,EAAMpK,EAAE9B,GAAG,EAAImM,EAAMrK,EAAE9B,GAAG,EAAIsmB,EAAMxkB,EAAE9B,GAAG,EAAIumB,CACvE,CACY,OAAAH,EAAG,KAAK,CAAC,EACFgB,CACV,EACD,QAAS,CAACE,EAAYX,IAAQ,CAC1B,qBAAqBW,CAAU,EAC/B,MAAMlB,EAAK,eAAejhB,CAAG,EACvBkiB,EAAM,IAAIF,CAAE,EACZhf,EAAM,OAAOmf,EAAW,OAAQX,CAAG,EACnC5lB,EAAI,IAAIumB,CAAU,EAClBxlB,EAAI,IAAIqG,CAAG,EAEjB,IAAI+D,EAAKmb,EAAI,CAAC,EAAGlb,EAAKkb,EAAI,CAAC,EAAGf,EAAKe,EAAI,CAAC,EAAGd,EAAKc,EAAI,CAAC,EACrD,QAASrnB,EAAI,EAAGA,EAAI,GAAKe,EAAE,QAAS,CAEhC,MAAMwmB,EAAMrb,EAAIsb,EAAMrb,EAAIsb,EAAMnB,EAAIoB,EAAMnB,EACzCra,EAAKnL,EAAEf,EAAI,CAAC,EAAKmM,EAAKpL,EAAEf,EAAI,CAAC,EAAKsmB,EAAKvlB,EAAEf,EAAI,CAAC,EAAKumB,EAAKxlB,EAAEf,EAAI,CAAC,EAChE,KAAM,CAAE,GAAI2nB,EAAI,GAAIC,EAAI,GAAIC,EAAI,GAAIC,CAAI,EAAGpB,UAAQN,EAAIla,EAAIC,EAAIma,EAAIC,CAAE,EACpEzkB,EAAE9B,GAAG,EAAI2nB,EAAKJ,EAAOzlB,EAAE9B,GAAG,EAAI4nB,EAAKJ,EAAO1lB,EAAE9B,GAAG,EAAI6nB,EAAKJ,EAAO3lB,EAAE9B,GAAG,EAAI8nB,EAAKJ,CAC9F,CACY,OAAAtB,EAAG,KAAK,CAAC,EACF,aAAaje,EAAK0e,CAAK,CACjC,CACJ,CACL,CAAC,ECvXK,aAAgBziB,GAAQ,WAAW,KAAKA,EAAI,MAAM,EAAE,EAAE,IAAK3B,GAAMA,EAAE,WAAW,CAAC,CAAC,CAAC,EACjF,QAAU,aAAa,kBAAkB,EACzC,QAAU,aAAa,kBAAkB,EACzC,WAAa,IAAI,OAAO,EACxB,WAAa,IAAI,OAAO,EACT,WAAW,MAAK,EAC9B,SAAS,KAAK3B,EAAGC,EAAG,CACvB,OAAQD,GAAKC,EAAMD,IAAO,GAAKC,CACnC,CAEA,SAAS,YAAYA,EAAG,CACpB,OAAOA,EAAE,WAAa,IAAM,CAChC,CAEA,MAAM,UAAY,GACZ,YAAc,GAGd,YAAc,GAAK,GAAK,EACxB,UAAY,IAAI,YACtB,SAAS,UAAUgnB,EAAMC,EAAO7iB,EAAK8iB,EAAOnf,EAAMZ,EAAQggB,EAASzB,EAAQ,CACvE,MAAMzlB,EAAM8H,EAAK,OACXmb,EAAQ,IAAI,WAAW,SAAS,EAChCkE,EAAM,IAAIlE,CAAK,EAEfmE,EAAY,YAAYtf,CAAI,GAAK,YAAYZ,CAAM,EACnDmgB,EAAMD,EAAY,IAAItf,CAAI,EAAI,UAC9Bwf,EAAMF,EAAY,IAAIlgB,CAAM,EAAI,UACtC,QAASqC,EAAM,EAAGA,EAAMvJ,EAAKknB,IAAW,CAEpC,GADAH,EAAKC,EAAO7iB,EAAK8iB,EAAOE,EAAKD,EAASzB,CAAM,EACxCyB,GAAW,YACX,MAAM,IAAI,MAAM,uBAAuB,EAC3C,MAAM1d,EAAO,KAAK,IAAI,UAAWxJ,EAAMuJ,CAAG,EAE1C,GAAI6d,GAAa5d,IAAS,UAAW,CACjC,MAAM+d,EAAQhe,EAAM,EACpB,GAAIA,EAAM,IAAM,EACZ,MAAM,IAAI,MAAM,6BAA6B,EACjD,QAAS8C,EAAI,EAAGmb,EAAMnb,EAAI,YAAaA,IACnCmb,EAAOD,EAAQlb,EACfib,EAAIE,CAAI,EAAIH,EAAIG,CAAI,EAAIL,EAAI9a,CAAC,EAEjC9C,GAAO,UACP,QACZ,CACQ,QAAS8C,EAAI,EAAGmb,EAAMnb,EAAI7C,EAAM6C,IAC5Bmb,EAAOje,EAAM8C,EACbnF,EAAOsgB,CAAI,EAAI1f,EAAK0f,CAAI,EAAIvE,EAAM5W,CAAC,EAEvC9C,GAAOC,CACf,CACA,CACO,SAAS,aAAaud,EAAMjW,EAAM,CACrC,KAAM,CAAE,eAAA2W,EAAgB,cAAAC,EAAe,cAAAC,EAAe,aAAAC,EAAc,OAAAnC,CAAM,EAAK,UAAU,CAAE,eAAgB,GAAO,cAAe,EAAG,aAAc,GAAO,OAAQ,EAAI,EAAE3U,CAAI,EAC3K,GAAI,OAAOiW,GAAS,WAChB,MAAM,IAAI,MAAM,yBAAyB,EAC7Cc,cAAQF,CAAa,EACrBE,OAAQpC,CAAM,EACdqC,KAAMF,CAAY,EAClBE,KAAML,CAAc,EACb,CAACtjB,EAAK8iB,EAAOnf,EAAMZ,EAAQggB,EAAU,IAAM,CAC9ClC,MAAO7gB,CAAG,EACV6gB,MAAOiC,CAAK,EACZjC,MAAOld,CAAI,EACX,MAAM9H,EAAM8H,EAAK,OAKjB,GAJKZ,IACDA,EAAS,IAAI,WAAWlH,CAAG,GAC/BglB,MAAO9d,CAAM,EACb2gB,OAAQX,CAAO,EACXA,EAAU,GAAKA,GAAW,YAC1B,MAAM,IAAI,MAAM,uBAAuB,EAC3C,GAAIhgB,EAAO,OAASlH,EAChB,MAAM,IAAI,MAAM,gBAAgBkH,EAAO,MAAM,2BAA2BlH,CAAG,GAAG,EAClF,MAAM+nB,EAAU,CAAE,EAIlB,IAAItoB,EAAI0E,EAAI,OAAQnD,EAAGgmB,EACvB,GAAIvnB,IAAM,GACNuB,EAAImD,EAAI,MAAO,EACf4jB,EAAQ,KAAK/mB,CAAC,EACdgmB,EAAQ,mBAEHvnB,IAAM,IAAMgoB,EACjBzmB,EAAI,IAAI,WAAW,EAAE,EACrBA,EAAE,IAAImD,CAAG,EACTnD,EAAE,IAAImD,EAAK,EAAE,EACb6iB,EAAQ,WACRe,EAAQ,KAAK/mB,CAAC,MAGd,OAAM,IAAI,MAAM,wCAAwCvB,CAAC,EAAE,EAS1D,YAAYwnB,CAAK,IAClBA,EAAQA,EAAM,MAAO,EACrBc,EAAQ,KAAKd,CAAK,GAEtB,MAAMhC,EAAM,IAAIjkB,CAAC,EAEjB,GAAI0mB,EAAe,CACf,GAAIT,EAAM,SAAW,GACjB,MAAM,IAAI,MAAM,sCAAsC,EAC1DS,EAAcV,EAAO/B,EAAK,IAAIgC,EAAM,SAAS,EAAG,EAAE,CAAC,EAAGhC,CAAG,EACzDgC,EAAQA,EAAM,SAAS,EAAE,CACrC,CAEQ,MAAMe,EAAa,GAAKL,EACxB,GAAIK,IAAef,EAAM,OACrB,MAAM,IAAI,MAAM,sBAAsBe,CAAU,cAAc,EAElE,GAAIA,IAAe,GAAI,CACnB,MAAMC,EAAK,IAAI,WAAW,EAAE,EAC5BA,EAAG,IAAIhB,EAAOW,EAAe,EAAI,GAAKX,EAAM,MAAM,EAClDA,EAAQgB,EACRF,EAAQ,KAAKd,CAAK,CAC9B,CACQ,MAAMZ,EAAM,IAAIY,CAAK,EAErB,IADA,UAAUF,EAAMC,EAAO/B,EAAKoB,EAAKve,EAAMZ,EAAQggB,EAASzB,CAAM,EACvDsC,EAAQ,OAAS,GACpBA,EAAQ,IAAG,EAAG,KAAK,CAAC,EACxB,OAAO7gB,CACV,CACL,CC5JA,SAAS,WAAWvE,EAAG3B,EAAGsC,EAAG6D,EAAK+gB,EAAKzC,EAAS,GAAI,CAChD,IAAI0C,EAAMxlB,EAAE,CAAC,EAAGylB,EAAMzlB,EAAE,CAAC,EAAG0lB,EAAM1lB,EAAE,CAAC,EAAG2lB,EAAM3lB,EAAE,CAAC,EACjD4lB,EAAMvnB,EAAE,CAAC,EAAGwnB,EAAMxnB,EAAE,CAAC,EAAGynB,EAAMznB,EAAE,CAAC,EAAG0nB,EAAM1nB,EAAE,CAAC,EAC7C2nB,EAAM3nB,EAAE,CAAC,EAAG4nB,EAAM5nB,EAAE,CAAC,EAAG6nB,EAAM7nB,EAAE,CAAC,EAAG8nB,EAAM9nB,EAAE,CAAC,EAC7C+nB,EAAMb,EAAKc,EAAM1lB,EAAE,CAAC,EAAG2lB,EAAM3lB,EAAE,CAAC,EAAG4lB,EAAM5lB,EAAE,CAAC,EAExC6lB,EAAMhB,EAAKiB,EAAMhB,EAAKiB,EAAMhB,EAAKiB,EAAMhB,EAAKiB,EAAMhB,EAAKiB,EAAMhB,EAAKiB,EAAMhB,EAAKiB,EAAMhB,EAAKiB,EAAMhB,EAAKiB,EAAMhB,EAAKiB,EAAMhB,EAAKiB,EAAMhB,EAAKiB,EAAMhB,EAAKiB,EAAMhB,EAAKiB,EAAMhB,EAAKiB,EAAMhB,EAC/K,QAAS1iB,EAAI,EAAGA,EAAIif,EAAQjf,GAAK,EAC7B2iB,EAAOA,EAAMI,EAAO,EACpBQ,EAAM,KAAKA,EAAMZ,EAAK,EAAE,EACxBQ,EAAOA,EAAMI,EAAO,EACpBR,EAAM,KAAKA,EAAMI,EAAK,EAAE,EACxBR,EAAOA,EAAMI,EAAO,EACpBQ,EAAM,KAAKA,EAAMZ,EAAK,CAAC,EACvBQ,EAAOA,EAAMI,EAAO,EACpBR,EAAM,KAAKA,EAAMI,EAAK,CAAC,EACvBP,EAAOA,EAAMI,EAAO,EACpBQ,EAAM,KAAKA,EAAMZ,EAAK,EAAE,EACxBQ,EAAOA,EAAMI,EAAO,EACpBR,EAAM,KAAKA,EAAMI,EAAK,EAAE,EACxBR,EAAOA,EAAMI,EAAO,EACpBQ,EAAM,KAAKA,EAAMZ,EAAK,CAAC,EACvBQ,EAAOA,EAAMI,EAAO,EACpBR,EAAM,KAAKA,EAAMI,EAAK,CAAC,EACvBP,EAAOA,EAAMI,EAAO,EACpBQ,EAAM,KAAKA,EAAMZ,EAAK,EAAE,EACxBQ,EAAOA,EAAMI,EAAO,EACpBR,EAAM,KAAKA,EAAMI,EAAK,EAAE,EACxBR,EAAOA,EAAMI,EAAO,EACpBQ,EAAM,KAAKA,EAAMZ,EAAK,CAAC,EACvBQ,EAAOA,EAAMI,EAAO,EACpBR,EAAM,KAAKA,EAAMI,EAAK,CAAC,EACvBP,EAAOA,EAAMI,EAAO,EACpBQ,EAAM,KAAKA,EAAMZ,EAAK,EAAE,EACxBQ,EAAOA,EAAMI,EAAO,EACpBR,EAAM,KAAKA,EAAMI,EAAK,EAAE,EACxBR,EAAOA,EAAMI,EAAO,EACpBQ,EAAM,KAAKA,EAAMZ,EAAK,CAAC,EACvBQ,EAAOA,EAAMI,EAAO,EACpBR,EAAM,KAAKA,EAAMI,EAAK,CAAC,EACvBX,EAAOA,EAAMK,EAAO,EACpBU,EAAM,KAAKA,EAAMf,EAAK,EAAE,EACxBU,EAAOA,EAAMK,EAAO,EACpBV,EAAM,KAAKA,EAAMK,EAAK,EAAE,EACxBV,EAAOA,EAAMK,EAAO,EACpBU,EAAM,KAAKA,EAAMf,EAAK,CAAC,EACvBU,EAAOA,EAAMK,EAAO,EACpBV,EAAM,KAAKA,EAAMK,EAAK,CAAC,EACvBT,EAAOA,EAAMK,EAAO,EACpBM,EAAM,KAAKA,EAAMX,EAAK,EAAE,EACxBU,EAAOA,EAAMC,EAAO,EACpBN,EAAM,KAAKA,EAAMK,EAAK,EAAE,EACxBV,EAAOA,EAAMK,EAAO,EACpBM,EAAM,KAAKA,EAAMX,EAAK,CAAC,EACvBU,EAAOA,EAAMC,EAAO,EACpBN,EAAM,KAAKA,EAAMK,EAAK,CAAC,EACvBT,EAAOA,EAAMK,EAAO,EACpBM,EAAM,KAAKA,EAAMX,EAAK,EAAE,EACxBM,EAAOA,EAAMK,EAAO,EACpBN,EAAM,KAAKA,EAAMC,EAAK,EAAE,EACxBN,EAAOA,EAAMK,EAAO,EACpBM,EAAM,KAAKA,EAAMX,EAAK,CAAC,EACvBM,EAAOA,EAAMK,EAAO,EACpBN,EAAM,KAAKA,EAAMC,EAAK,CAAC,EACvBL,EAAOA,EAAMC,EAAO,EACpBU,EAAM,KAAKA,EAAMX,EAAK,EAAE,EACxBM,EAAOA,EAAMK,EAAO,EACpBV,EAAM,KAAKA,EAAMK,EAAK,EAAE,EACxBN,EAAOA,EAAMC,EAAO,EACpBU,EAAM,KAAKA,EAAMX,EAAK,CAAC,EACvBM,EAAOA,EAAMK,EAAO,EACpBV,EAAM,KAAKA,EAAMK,EAAK,CAAC,EAG3B,IAAIO,EAAK,EACThjB,EAAIgjB,GAAI,EAAKhC,EAAMgB,EAAO,EAC1BhiB,EAAIgjB,GAAI,EAAK/B,EAAMgB,EAAO,EAC1BjiB,EAAIgjB,GAAI,EAAK9B,EAAMgB,EAAO,EAC1BliB,EAAIgjB,GAAI,EAAK7B,EAAMgB,EAAO,EAC1BniB,EAAIgjB,GAAI,EAAK5B,EAAMgB,EAAO,EAC1BpiB,EAAIgjB,GAAI,EAAK3B,EAAMgB,EAAO,EAC1BriB,EAAIgjB,GAAI,EAAK1B,EAAMgB,EAAO,EAC1BtiB,EAAIgjB,GAAI,EAAKzB,EAAMgB,EAAO,EAC1BviB,EAAIgjB,GAAI,EAAKxB,EAAMgB,EAAO,EAC1BxiB,EAAIgjB,GAAI,EAAKvB,EAAMgB,EAAO,EAC1BziB,EAAIgjB,GAAI,EAAKtB,EAAMgB,EAAO,EAC1B1iB,EAAIgjB,GAAI,EAAKrB,EAAMgB,EAAO,EAC1B3iB,EAAIgjB,GAAI,EAAKpB,EAAMgB,EAAO,EAC1B5iB,EAAIgjB,GAAI,EAAKnB,EAAMgB,EAAO,EAC1B7iB,EAAIgjB,GAAI,EAAKlB,EAAMgB,EAAO,EAC1B9iB,EAAIgjB,GAAI,EAAKjB,EAAMgB,EAAO,CAC9B,CAkGO,MAAM,SAA2B,aAAa,WAAY,CAC7D,aAAc,GACd,cAAe,EACf,eAAgB,EACpB,CAAC,aC1MM,cAAmBhhB,MAAK,CAC3B,YAAY5E,EAAMsZ,EAAM,CACpB,MAAO,EACP,KAAK,SAAW,GAChB,KAAK,UAAY,GACjB,OAAO,KAAKtZ,CAAI,EAChB,MAAMH,EAAM0D,UAAQ+V,CAAI,EAExB,GADA,KAAK,MAAQtZ,EAAK,OAAQ,EACtB,OAAO,KAAK,MAAM,QAAW,WAC7B,MAAM,IAAI,MAAM,qDAAqD,EACzE,KAAK,SAAW,KAAK,MAAM,SAC3B,KAAK,UAAY,KAAK,MAAM,UAC5B,MAAM6E,EAAW,KAAK,SAChBjB,EAAM,IAAI,WAAWiB,CAAQ,EAEnCjB,EAAI,IAAI/D,EAAI,OAASgF,EAAW7E,EAAK,OAAQ,EAAC,OAAOH,CAAG,EAAE,OAAM,EAAKA,CAAG,EACxE,QAASnF,EAAI,EAAGA,EAAIkJ,EAAI,OAAQlJ,IAC5BkJ,EAAIlJ,CAAC,GAAK,GACd,KAAK,MAAM,OAAOkJ,CAAG,EAErB,KAAK,MAAQ5D,EAAK,OAAQ,EAE1B,QAAStF,EAAI,EAAGA,EAAIkJ,EAAI,OAAQlJ,IAC5BkJ,EAAIlJ,CAAC,GAAK,IACd,KAAK,MAAM,OAAOkJ,CAAG,EACrBA,EAAI,KAAK,CAAC,CAClB,CACI,OAAO4V,EAAK,CACR,cAAO,OAAO,IAAI,EAClB,KAAK,MAAM,OAAOA,CAAG,EACd,IACf,CACI,WAAW3W,EAAK,CACZ,OAAO,OAAO,IAAI,EAClB,OAAO,MAAMA,EAAK,KAAK,SAAS,EAChC,KAAK,SAAW,GAChB,KAAK,MAAM,WAAWA,CAAG,EACzB,KAAK,MAAM,OAAOA,CAAG,EACrB,KAAK,MAAM,WAAWA,CAAG,EACzB,KAAK,QAAS,CACtB,CACI,QAAS,CACL,MAAMA,EAAM,IAAI,WAAW,KAAK,MAAM,SAAS,EAC/C,YAAK,WAAWA,CAAG,EACZA,CACf,CACI,WAAW7H,EAAI,CAEXA,IAAOA,EAAK,OAAO,OAAO,OAAO,eAAe,IAAI,EAAG,CAAA,CAAE,GACzD,KAAM,CAAE,MAAA2e,EAAO,MAAAC,EAAO,SAAAnU,EAAU,UAAAC,EAAW,SAAAb,EAAU,UAAAC,CAAS,EAAK,KACnE,OAAA9J,EAAKA,EACLA,EAAG,SAAWyK,EACdzK,EAAG,UAAY0K,EACf1K,EAAG,SAAW6J,EACd7J,EAAG,UAAY8J,EACf9J,EAAG,MAAQ2e,EAAM,WAAW3e,EAAG,KAAK,EACpCA,EAAG,MAAQ4e,EAAM,WAAW5e,EAAG,KAAK,EAC7BA,CACf,CACI,SAAU,CACN,KAAK,UAAY,GACjB,KAAK,MAAM,QAAS,EACpB,KAAK,MAAM,QAAS,CAC5B,CACA,EAOO,MAAM6e,OAAO,CAAC7Z,EAAMH,EAAKia,IAAY,IAAIC,OAAK/Z,EAAMH,CAAG,EAAE,OAAOia,CAAO,EAAE,OAAQ,EACxFD,OAAK,OAAS,CAAC7Z,EAAMH,IAAQ,IAAIka,OAAK/Z,EAAMH,CAAG,EC9DxC,SAAS,QAAQG,EAAM8lB,EAAKC,EAAM,CACrC,cAAO,KAAK/lB,CAAI,EAMT6Z,OAAK7Z,EAAMuD,UAAQwiB,CAAI,EAAGxiB,UAAQuiB,CAAG,CAAC,CACjD,CAEA,MAAM,aAAe,IAAI,WAAW,CAAC,CAAC,CAAC,EACjC,aAAe,IAAI,WAOlB,SAAS,OAAO9lB,EAAMgmB,EAAKC,EAAMzgB,EAAS,GAAI,CAGjD,GAFA,OAAO,KAAKxF,CAAI,EAChB,OAAO,OAAOwF,CAAM,EAChBA,EAAS,IAAMxF,EAAK,UACpB,MAAM,IAAI,MAAM,iCAAiC,EACrD,MAAMkmB,EAAS,KAAK,KAAK1gB,EAASxF,EAAK,SAAS,EAC5CimB,IAAS,SACTA,EAAO,cAEX,MAAME,EAAM,IAAI,WAAWD,EAASlmB,EAAK,SAAS,EAE5C+Z,EAAOF,OAAK,OAAO7Z,EAAMgmB,CAAG,EAC5BI,EAAUrM,EAAK,WAAY,EAC3BsM,EAAI,IAAI,WAAWtM,EAAK,SAAS,EACvC,QAAS6I,EAAU,EAAGA,EAAUsD,EAAQtD,IACpC,aAAa,CAAC,EAAIA,EAAU,EAG5BwD,EAAQ,OAAOxD,IAAY,EAAI,aAAeyD,CAAC,EAC1C,OAAOJ,CAAI,EACX,OAAO,YAAY,EACnB,WAAWI,CAAC,EACjBF,EAAI,IAAIE,EAAGrmB,EAAK,UAAY4iB,CAAO,EACnC7I,EAAK,WAAWqM,CAAO,EAE3B,OAAArM,EAAK,QAAS,EACdqM,EAAQ,QAAS,EACjBC,EAAE,KAAK,CAAC,EACR,aAAa,KAAK,CAAC,EACZF,EAAI,MAAM,EAAG3gB,CAAM,CAC9B,CC7DA,IAAI,UAAY,OAAO,eACnB,SAAW,CAAC8gB,EAAQC,IAAQ,CAC9B,QAASnnB,KAAQmnB,EACf,UAAUD,EAAQlnB,EAAM,CAAE,IAAKmnB,EAAInnB,CAAI,EAAG,WAAY,GAAM,CAChE,EAOI,eAAiB,OAAO,UAAU,EAClC,SAAYonB,GAAQA,aAAe,OACvC,SAAS,cAActpB,EAAO,CAa5B,GAZI,CAAC,SAASA,CAAK,GAEf,OAAOA,EAAM,MAAS,UAEtB,OAAOA,EAAM,SAAY,UAEzB,OAAOA,EAAM,YAAe,UAE5B,OAAOA,EAAM,QAAW,UAExB,CAACA,EAAM,OAAO,MAAM,gBAAgB,GAEpC,CAAC,MAAM,QAAQA,EAAM,IAAI,EAC3B,MAAO,GACT,QAASupB,EAAK,EAAGA,EAAKvpB,EAAM,KAAK,OAAQupB,IAAM,CAC7C,IAAI1K,EAAM7e,EAAM,KAAKupB,CAAE,EACvB,GAAI,CAAC,MAAM,QAAQ1K,CAAG,EACpB,MAAO,GACT,QAAShU,EAAI,EAAGA,EAAIgU,EAAI,OAAQhU,IAC9B,GAAI,OAAOgU,EAAIhU,CAAC,GAAM,SACpB,MAAO,EAEf,CACE,MAAO,EACT,CAcA,IAAI,cAAgB,CAAE,EACtB,SAAS,cAAe,CACtB,MAAO,IAAM2e,QACb,UAAW,IAAM,UACjB,aAAc,IAAM,aACpB,6BAA8B,IAAM,6BACpC,8BAA+B,IAAM,8BACrC,aAAc,IAAM,aACpB,YAAa,IAAM,YACnB,YAAa,IAAM,WACrB,CAAC,EACD,IAAI,YAAc,IAAI,YAAY,OAAO,EACrC,YAAc,IAAI,YACtB,SAAS,aAAaC,EAAK,CACrBA,EAAI,QAAQ,KAAK,IAAM,KACzBA,EAAM,SAAWA,GACnB,IAAI5pB,EAAI,IAAI,IAAI4pB,CAAG,EACnB,OAAA5pB,EAAE,SAAWA,EAAE,SAAS,QAAQ,OAAQ,GAAG,EACvCA,EAAE,SAAS,SAAS,GAAG,IACzBA,EAAE,SAAWA,EAAE,SAAS,MAAM,EAAG,EAAE,IACjCA,EAAE,OAAS,MAAQA,EAAE,WAAa,OAASA,EAAE,OAAS,OAASA,EAAE,WAAa,UAChFA,EAAE,KAAO,IACXA,EAAE,aAAa,KAAM,EACrBA,EAAE,KAAO,GACFA,EAAE,SAAU,CACrB,CACA,SAAS,8BAA8B6pB,EAAa1pB,EAAO,CACzD,KAAM,CAACujB,EAAKoG,CAAK,EAAI,aAAaD,EAAcnrB,GAC1CyB,EAAM,KAAOzB,EAAE,GACV,EACLyB,EAAM,aAAezB,EAAE,WAClB,GACFA,EAAE,WAAayB,EAAM,UAC7B,EACD,OAAK2pB,GACHD,EAAY,OAAOnG,EAAK,EAAGvjB,CAAK,EAE3B0pB,CACT,CACA,SAAS,6BAA6BA,EAAa1pB,EAAO,CACxD,KAAM,CAACujB,EAAKoG,CAAK,EAAI,aAAaD,EAAcnrB,GAC1CyB,EAAM,KAAOzB,EAAE,GACV,EACLyB,EAAM,aAAezB,EAAE,WAClB,GACFyB,EAAM,WAAazB,EAAE,UAC7B,EACD,OAAKorB,GACHD,EAAY,OAAOnG,EAAK,EAAGvjB,CAAK,EAE3B0pB,CACT,CACA,SAAS,aAAatsB,EAAKwsB,EAAS,CAClC,IAAIC,EAAQ,EACR9I,EAAM3jB,EAAI,OAAS,EACvB,KAAOysB,GAAS9I,GAAK,CACnB,MAAM+I,EAAM,KAAK,OAAOD,EAAQ9I,GAAO,CAAC,EAClCgJ,EAAMH,EAAQxsB,EAAI0sB,CAAG,CAAC,EAC5B,GAAIC,IAAQ,EACV,MAAO,CAACD,EAAK,EAAI,EAEfC,EAAM,EACRhJ,EAAM+I,EAAM,EAEZD,EAAQC,EAAM,CAEpB,CACE,MAAO,CAACD,EAAO,EAAK,CACtB,CACA,IAAI,UAAY,KAAM,CAIpB,YAAYjN,EAAS,CAHrBoN,EAAA,cACAA,EAAA,YAAO,MACPA,EAAA,YAAO,MAEL,KAAK,MAAQpN,CACjB,CACA,EACI4M,QAAQ,KAAM,CAGhB,aAAc,CAFdQ,EAAA,cACAA,EAAA,aAEE,KAAK,MAAQ,KACb,KAAK,KAAO,IAChB,CACE,QAAQ3iB,EAAO,CACb,MAAM4iB,EAAU,IAAI,UAAU5iB,CAAK,EACnC,OAAK,KAAK,KAGC,KAAK,OAAS,KAAK,OAC5B,KAAK,KAAO4iB,EACZ,KAAK,KAAK,KAAO,KAAK,MACtB,KAAK,MAAM,KAAOA,IAElBA,EAAQ,KAAO,KAAK,KACpB,KAAK,KAAK,KAAOA,EACjB,KAAK,KAAOA,IATZ,KAAK,MAAQA,EACb,KAAK,KAAOA,GAUP,EACX,CACE,SAAU,CACR,GAAI,CAAC,KAAK,MACR,OAAO,KACT,GAAI,KAAK,QAAU,KAAK,KAAM,CAC5B,MAAMC,EAAU,KAAK,MACrB,YAAK,MAAQ,KACb,KAAK,KAAO,KACLA,EAAQ,KACrB,CACI,MAAMd,EAAS,KAAK,MACpB,YAAK,MAAQA,EAAO,KACbA,EAAO,KAClB,CACA,EAGI,GAAK,KAAM,CACb,mBAAoB,CAClB,OAAOhJ,UAAQ,MAAM,iBAAkB,CAC3C,CACE,aAAa+J,EAAW,CACtB,OAAO7f,aAAW8V,UAAQ,aAAa+J,CAAS,CAAC,CACrD,CACE,cAAcrK,EAAGqK,EAAW,CAC1B,MAAMnqB,EAAQ8f,EACd,OAAA9f,EAAM,OAASsK,aAAW8V,UAAQ,aAAa+J,CAAS,CAAC,EACzDnqB,EAAM,GAAKoqB,eAAapqB,CAAK,EAC7BA,EAAM,IAAMsK,aAAW8V,UAAQ,KAAKgK,eAAapqB,CAAK,EAAGmqB,CAAS,CAAC,EACnEnqB,EAAM,cAAc,EAAI,GACjBA,CACX,CACE,YAAYA,EAAO,CACjB,GAAI,OAAOA,EAAM,cAAc,GAAM,UACnC,OAAOA,EAAM,cAAc,EAC7B,MAAM8C,EAAOsnB,eAAapqB,CAAK,EAC/B,GAAI8C,IAAS9C,EAAM,GACjB,OAAAA,EAAM,cAAc,EAAI,GACjB,GAET,GAAI,CACF,MAAMqqB,EAAQjK,UAAQ,OAAOpgB,EAAM,IAAK8C,EAAM9C,EAAM,MAAM,EAC1D,OAAAA,EAAM,cAAc,EAAIqqB,EACjBA,CACR,MAAa,CACZ,OAAArqB,EAAM,cAAc,EAAI,GACjB,EACb,CACA,CACA,EACA,SAAS,eAAeW,EAAK,CAC3B,GAAI,CAAC,cAAcA,CAAG,EACpB,MAAM,IAAI,MAAM,wDAAwD,EAC1E,OAAO,KAAK,UAAU,CAAC,EAAGA,EAAI,OAAQA,EAAI,WAAYA,EAAI,KAAMA,EAAI,KAAMA,EAAI,OAAO,CAAC,CACxF,CACA,SAASypB,eAAapqB,EAAO,CAC3B,IAAIsqB,EAAYvgB,SAAO,YAAY,OAAO,eAAe/J,CAAK,CAAC,CAAC,EAChE,OAAOsK,aAAWggB,CAAS,CAC7B,CACA,IAAI,EAAI,IAAI,GACR,kBAAoB,EAAE,kBACtB,aAAe,EAAE,aACjB,cAAgB,EAAE,cAClB,YAAc,EAAE,YAGhB,cAAgB,CAAE,EACtB,SAAS,cAAe,CACtB,YAAa,IAAM,YACnB,WAAY,IAAM,WAClB,gBAAiB,IAAM,gBACvB,kBAAmB,IAAM,kBACzB,aAAc,IAAM,aACpB,aAAc,IAAM,aACpB,SAAU,IAAM,SAChB,kBAAmB,IAAM,kBACzB,gBAAiB,IAAM,gBACvB,mBAAoB,IAAM,mBAC1B,eAAgB,IAAM,eACtB,gBAAiB,IAAM,gBACvB,gBAAiB,IAAM,gBACvB,kBAAmB,IAAM,kBACzB,WAAY,IAAM,WAClB,gBAAiB,IAAM,gBACvB,oBAAqB,IAAM,oBAC3B,sBAAuB,IAAM,sBAC7B,SAAU,IAAM,SAChB,sBAAuB,IAAM,sBAC7B,oBAAqB,IAAM,oBAC3B,aAAc,IAAM,aACpB,KAAM,IAAM,MACZ,wBAAyB,IAAM,wBAC/B,uBAAwB,IAAM,uBAC9B,UAAW,IAAM,UACjB,UAAW,IAAM,UACjB,uBAAwB,IAAM,uBAC9B,cAAe,IAAM,cACrB,aAAc,IAAM,aACpB,qBAAsB,IAAM,qBAC5B,WAAY,IAAM,WAClB,cAAe,IAAM,cACrB,aAAc,IAAM,aACpB,SAAU,IAAM,SAChB,SAAU,IAAM,SAChB,mBAAoB,IAAM,mBAC1B,sBAAuB,IAAM,sBAC7B,WAAY,IAAM,WAClB,cAAe,IAAM,cACrB,aAAc,IAAM,aACpB,YAAa,IAAM,YACnB,WAAY,IAAM,WAClB,UAAW,IAAM,UACjB,MAAO,IAAM,MACb,gBAAiB,IAAM,gBACvB,gBAAiB,IAAM,gBACvB,UAAW,IAAM,UACjB,gBAAiB,IAAM,gBACvB,SAAU,IAAM,SAChB,SAAU,IAAM,SAChB,cAAe,IAAM,cACrB,iBAAkB,IAAM,iBACxB,kBAAmB,IAAM,kBACzB,aAAc,IAAM,aACpB,eAAgB,IAAM,eACtB,QAAS,IAAM,QACf,qBAAsB,IAAM,qBAC5B,eAAgB,IAAM,eACtB,cAAe,IAAM,cACrB,gBAAiB,IAAM,gBACvB,SAAU,IAAM,SAChB,eAAgB,IAAM,eACtB,UAAW,IAAM,UACjB,UAAW,IAAM,UACjB,OAAQ,IAAM,OACd,UAAW,IAAM,UACjB,OAAQ,IAAM,OACd,KAAM,IAAM,KACZ,iBAAkB,IAAM,iBACxB,cAAe,IAAM,cACrB,KAAM,IAAM,KACZ,cAAe,IAAM,cACrB,aAAc,IAAM,aACpB,IAAK,IAAM,IACX,QAAS,IAAM,QACf,WAAY,IAAM,WAClB,aAAc,IAAM,aACpB,kBAAmB,IAAM,kBACzB,gBAAiB,IAAM,gBACvB,OAAQ,IAAM,OACd,+BAAgC,IAAM,+BACtC,cAAe,IAAM,cACrB,kBAAmB,IAAM,iBAC3B,CAAC,EACD,SAAS,cAAcC,EAAM,CAC3B,MAAO,MAAOA,GAAQA,EAAO,KAAO,CAAC,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,GAAI,GAAI,GAAI,GAAI,GAAI,EAAE,EAAE,SAASA,CAAI,CACjG,CACA,SAAS,kBAAkBA,EAAM,CAC/B,MAAO,CAAC,EAAG,CAAC,EAAE,SAASA,CAAI,GAAK,KAAOA,GAAQA,EAAO,GACxD,CACA,SAAS,gBAAgBA,EAAM,CAC7B,MAAO,MAAOA,GAAQA,EAAO,GAC/B,CACA,SAAS,kBAAkBA,EAAM,CAC/B,MAAO,MAAOA,GAAQA,EAAO,GAC/B,CACA,IAAI,+BAAiC,kBACrC,SAAS,aAAaA,EAAM,CAC1B,OAAI,cAAcA,CAAI,EACb,UACL,kBAAkBA,CAAI,EACjB,cACL,gBAAgBA,CAAI,EACf,YACL,kBAAkBA,CAAI,EACjB,gBACF,SACT,CACA,SAAS,OAAOvqB,EAAOuqB,EAAM,CAC3B,MAAMC,EAAcD,aAAgB,MAAQA,EAAO,CAACA,CAAI,EACxD,OAAO,cAAcvqB,CAAK,GAAKwqB,EAAY,SAASxqB,EAAM,IAAI,GAAK,EACrE,CACA,IAAI,SAAW,EACX,cAAgB,EAChB,eAAiB,EACjB,SAAW,EACX,uBAAyB,EACzB,cAAgB,EAChB,OAAS,EACT,SAAW,EACX,WAAa,EACb,KAAO,GACP,qBAAuB,GACvB,cAAgB,GAChB,gBAAkB,GAClB,gBAAkB,GAClB,eAAiB,GACjB,mBAAqB,GACrB,gBAAkB,GAClB,eAAiB,KACjB,SAAW,KACX,aAAe,KACf,gBAAkB,KAClB,eAAiB,KACjB,OAAS,KACT,UAAY,KACZ,MAAQ,KACR,sBAAwB,KACxB,WAAa,KACb,UAAY,KACZ,YAAc,IACd,QAAU,KACV,WAAa,KACb,IAAM,KACN,WAAa,KACb,SAAW,IACX,QAAU,MACV,UAAY,MACZ,aAAe,MACf,gBAAkB,MAClB,gBAAkB,MAClB,kBAAoB,MACpB,iBAAmB,MACnB,cAAgB,MAChB,cAAgB,MAChB,wBAA0B,MAC1B,qBAAuB,MACvB,cAAgB,MAChB,gBAAkB,KAClB,WAAa,MACb,iBAAmB,MACnB,kBAAoB,MACpB,aAAe,MACf,SAAW,MACX,WAAa,IACb,aAAe,MACf,UAAY,MACZ,aAAe,MACf,aAAe,MACf,cAAgB,MAChB,gBAAkB,MAClB,aAAe,MACf,oBAAsB,MACtB,sBAAwB,MACxB,gBAAkB,MAClB,UAAY,MACZ,UAAY,MACZ,YAAc,MACd,UAAY,MACZ,aAAe,MACf,kBAAoB,MACpB,uBAAyB,MACzB,MAAQ,MACR,KAAO,MACP,SAAW,MACX,kBAAoB,MACpB,sBAAwB,MACxB,mBAAqB,MACrB,oBAAsB,MAG1B,SAAS,YAAYyqB,EAAQzqB,EAAO,CAOlC,GANIyqB,EAAO,KAAOA,EAAO,IAAI,QAAQzqB,EAAM,EAAE,IAAM,IAG/CyqB,EAAO,OAASA,EAAO,MAAM,QAAQzqB,EAAM,IAAI,IAAM,IAGrDyqB,EAAO,SAAWA,EAAO,QAAQ,QAAQzqB,EAAM,MAAM,IAAM,GAC7D,MAAO,GAET,QAASyP,KAAKgb,EACZ,GAAIhb,EAAE,CAAC,IAAM,IAAK,CAChB,IAAIib,EAAUjb,EAAE,MAAM,CAAC,EACnBkb,EAASF,EAAO,IAAIC,CAAO,EAAE,EACjC,GAAIC,GAAU,CAAC3qB,EAAM,KAAK,KAAK,CAAC,CAAC8f,EAAGpc,CAAC,IAAMoc,IAAMrQ,EAAE,MAAM,CAAC,GAAKkb,EAAO,QAAQjnB,CAAC,IAAM,EAAE,EACrF,MAAO,EACf,CAIE,MAFI,EAAA+mB,EAAO,OAASzqB,EAAM,WAAayqB,EAAO,OAE1CA,EAAO,OAASzqB,EAAM,WAAayqB,EAAO,MAGhD,CACA,SAAS,aAAaG,EAAS5qB,EAAO,CACpC,QAASupB,EAAK,EAAGA,EAAKqB,EAAQ,OAAQrB,IACpC,GAAI,YAAYqB,EAAQrB,CAAE,EAAGvpB,CAAK,EAChC,MAAO,GAGX,MAAO,EACT,CA4CA,IAAI,iBAAmB,CAAE,EACzB,SAAS,iBAAkB,CACzB,SAAU,IAAM,SAChB,OAAQ,IAAM,OACd,kBAAmB,IAAM,kBACzB,aAAc,IAAM,aACpB,eAAgB,IAAM,eACtB,iBAAkB,IAAM,gBAC1B,CAAC,EACD,SAAS,SAAS6qB,EAAMzb,EAAO,CAC7B,IAAI5Q,EAAM4Q,EAAM,OAAS,EACrBmU,EAAMsH,EAAK,QAAQ,IAAIzb,CAAK,IAAI,EAAI5Q,EACpC,EAAIqsB,EAAK,MAAMtH,CAAG,EAAE,QAAQ,GAAG,EAAIA,EAAM,EAC7C,OAAOsH,EAAK,MAAM,EAAG,EAAI,EAAE,CAC7B,CACA,SAAS,OAAOA,EAAMzb,EAAO,CAC3B,IAAI5Q,EAAM4Q,EAAM,OACZmU,EAAMsH,EAAK,QAAQ,IAAIzb,CAAK,IAAI,EAAI5Q,EAAM,EAC1CssB,EAASD,EAAK,MAAMtH,CAAG,EACvBxC,EAAM,KAAK,IAAI+J,EAAO,QAAQ,GAAG,EAAGA,EAAO,QAAQ,GAAG,CAAC,EAC3D,OAAO,SAASA,EAAO,MAAM,EAAG/J,CAAG,EAAG,EAAE,CAC1C,CACA,SAAS,kBAAkB8J,EAAM,CAC/B,IAAItH,EAAMsH,EAAK,MAAM,EAAG,EAAE,EAAE,QAAQ,SAAS,EAC7C,GAAItH,IAAQ,GACV,OAAO,KACT,IAAIwH,EAASF,EAAK,MAAMtH,EAAM,EAAI,CAAC,EAAE,QAAQ,GAAG,EAChD,GAAIwH,IAAW,GACb,OAAO,KACT,IAAIlB,EAAQtG,EAAM,EAAI,EAAIwH,EACtBC,EAAOH,EAAK,MAAMhB,EAAQ,EAAG,EAAE,EAAE,QAAQ,GAAG,EAChD,GAAImB,IAAS,GACX,OAAO,KACT,IAAIjK,EAAM8I,EAAQ,EAAImB,EACtB,OAAOH,EAAK,MAAMhB,EAAQ,EAAG9I,CAAG,CAClC,CACA,SAAS,aAAa8J,EAAMI,EAAI,CAC9B,OAAOA,IAAO,SAASJ,EAAM,IAAI,CACnC,CACA,SAAS,iBAAiBA,EAAMK,EAAQ,CACtC,OAAOA,IAAW,SAASL,EAAM,QAAQ,CAC3C,CACA,SAAS,eAAeA,EAAMN,EAAM,CAClC,OAAOA,IAAS,OAAOM,EAAM,MAAM,CACrC,CAGA,IAAI,cAAgB,CAAE,EACtB,SAAS,cAAe,CACtB,cAAe,IAAM,aACvB,CAAC,EACD,SAAS,cAAcM,EAAUzL,EAAW,CAC1C,MAAO,CACL,KAAM,WACN,WAAY,KAAK,MAAM,KAAK,IAAG,EAAK,GAAG,EACvC,KAAM,CACJ,CAAC,QAASyL,CAAQ,EAClB,CAAC,YAAazL,CAAS,CACxB,EACD,QAAS,EACV,CACH,CAGA,eAAe,aAAc,CAC3B,OAAO,IAAI,QAAS0L,GAAY,CAC9B,MAAMC,EAAK,IAAI,eACTC,EAAU,IAAM,CACpBD,EAAG,MAAM,oBAAoB,UAAWC,CAAO,EAC/CF,EAAS,CACV,EACDC,EAAG,MAAM,iBAAiB,UAAWC,CAAO,EAC5CD,EAAG,MAAM,YAAY,CAAC,EACtBA,EAAG,MAAM,MAAO,CACpB,CAAG,CACH,CACA,IAAI,WAAcvL,IAChBA,EAAE,cAAc,EAAI,GACb,IAIL,cAAgB,KAAM,CAsBxB,YAAY2J,EAAKna,EAAM,CArBvB0a,EAAA,YACAA,EAAA,kBAAa,IACbA,EAAA,eAAU,MACVA,EAAA,gBAAYljB,GAAQ,QAAQ,MAAM,eAAe,KAAK,GAAG,KAAKA,CAAG,EAAE,GACnEkjB,EAAA,eAAU,MACVA,EAAA,uBAAkB,MAClBA,EAAA,yBAAoB,MACpBA,EAAA,sBAAiB,MACjBA,EAAA,gBAA2B,IAAI,KAC/BA,EAAA,gCACAA,EAAA,0BACAA,EAAA,yBAAoC,IAAI,KACxCA,EAAA,0BAAqC,IAAI,KACzCA,EAAA,WACAA,EAAA,4BAAuB,IAAIR,SAC3BQ,EAAA,oBAAe,IACfA,EAAA,kBACAA,EAAA,oBACAA,EAAA,cAAS,GACTA,EAAA,oBACAA,EAAA,mBAEE,KAAK,IAAM,aAAaP,CAAG,EAC3B,KAAK,YAAcna,EAAK,YACxB,KAAK,WAAaA,EAAK,yBAA2B,SACtD,CACE,aAAa,QAAQma,EAAKna,EAAM,CAC9B,MAAMic,EAAQ,IAAI,cAAc9B,EAAKna,CAAI,EACzC,aAAMic,EAAM,QAAS,EACdA,CACX,CACE,sBAAsBC,EAAQ,CAC5B,OAAS,CAACnhB,EAAGohB,CAAG,IAAK,KAAK,SACxBA,EAAI,MAAMD,CAAM,EAElB,KAAK,SAAS,MAAO,EACrB,OAAS,CAACnhB,EAAGqhB,CAAE,IAAK,KAAK,mBACvBA,EAAG,OAAO,IAAI,MAAMF,CAAM,CAAC,EAE7B,KAAK,mBAAmB,MAAO,EAC/B,OAAS,CAACnhB,EAAGshB,CAAE,IAAK,KAAK,kBACvBA,EAAG,OAAO,IAAI,MAAMH,CAAM,CAAC,EAE7B,KAAK,kBAAkB,MAAO,CAClC,CACE,IAAI,WAAY,CACd,OAAO,KAAK,UAChB,CACE,MAAM,SAAU,CACd,OAAI,KAAK,kBACA,KAAK,mBACd,KAAK,UAAY,OACjB,KAAK,YAAc,OACnB,KAAK,kBAAoB,IAAI,QAAQ,CAACJ,EAASQ,IAAW,CACxD,KAAK,wBAA0B,WAAW,IAAM,OAC9CA,EAAO,sBAAsB,EAC7B,KAAK,kBAAoB,QACzBntB,EAAA,KAAK,UAAL,MAAAA,EAAA,WACA,KAAK,sBAAsB,4BAA4B,CAC/D,EAAS,KAAK,iBAAiB,EACzB,GAAI,CACF,KAAK,GAAK,IAAI,KAAK,WAAW,KAAK,GAAG,CACvC,OAAQotB,EAAK,CACZD,EAAOC,CAAG,EACV,MACR,CACM,KAAK,GAAG,OAAS,IAAM,CACrB,aAAa,KAAK,uBAAuB,EACzC,KAAK,WAAa,GAClBT,EAAS,CACV,EACD,KAAK,GAAG,QAAWhrB,GAAO,OACxBwrB,EAAOxrB,EAAG,SAAW,iBAAiB,EAClC,KAAK,aACP,KAAK,WAAa,GAClB,KAAK,kBAAoB,QACzB3B,EAAA,KAAK,UAAL,MAAAA,EAAA,WACA,KAAK,sBAAsB,0BAA0B,EAExD,EACD,KAAK,GAAG,QAAU,SAAY,OACxB,KAAK,aACP,KAAK,WAAa,GAClB,KAAK,kBAAoB,QACzBA,EAAA,KAAK,UAAL,MAAAA,EAAA,WACA,KAAK,sBAAsB,yBAAyB,EAEvD,EACD,KAAK,GAAG,UAAY,KAAK,WAAW,KAAK,IAAI,CACnD,CAAK,EACM,KAAK,kBAChB,CACE,MAAM,UAAW,CAEf,IADA,KAAK,aAAe,GAEJ,KAAK,eAAf,IAGJ,MAAM,YAAa,EAErB,KAAK,aAAe,EACxB,CACE,YAAa,WACX,MAAMosB,EAAO,KAAK,qBAAqB,QAAS,EAChD,GAAI,CAACA,EACH,MAAO,GAET,MAAMiB,EAAQ,kBAAkBjB,CAAI,EACpC,GAAIiB,EAAO,CACT,MAAMC,EAAK,KAAK,SAAS,IAAID,CAAK,EAClC,GAAI,CAACC,EACH,OAEF,MAAMd,EAAK,SAASJ,EAAM,IAAI,EACxBmB,GAAcvtB,EAAAstB,EAAG,mBAAH,YAAAttB,EAAA,KAAAstB,EAAsBd,GAE1C,IADAtsB,EAAAotB,EAAG,gBAAH,MAAAptB,EAAA,KAAAotB,EAAmB,KAAMd,GACrBe,EACF,MAER,CACI,GAAI,CACF,IAAI1lB,EAAO,KAAK,MAAMukB,CAAI,EAC1B,OAAQvkB,EAAK,CAAC,EAAC,CACb,IAAK,QAAS,CACZ,MAAMylB,EAAK,KAAK,SAAS,IAAIzlB,EAAK,CAAC,CAAC,EAC9BtG,EAAQsG,EAAK,CAAC,EAChB,KAAK,YAAYtG,CAAK,GAAK,aAAa+rB,EAAG,QAAS/rB,CAAK,GAC3D+rB,EAAG,QAAQ/rB,CAAK,EAElB,MACV,CACQ,IAAK,QAAS,CACZ,MAAMirB,EAAK3kB,EAAK,CAAC,EACX2lB,EAAU3lB,EAAK,CAAC,EAChBqlB,EAAK,KAAK,kBAAkB,IAAIV,CAAE,EACpCU,IACFA,EAAG,QAAQM,EAAQ,KAAK,EACxB,KAAK,kBAAkB,OAAOhB,CAAE,GAElC,MACV,CACQ,IAAK,OAAQ,CACX,MAAMc,EAAK,KAAK,SAAS,IAAIzlB,EAAK,CAAC,CAAC,EACpC,GAAI,CAACylB,EACH,OACFA,EAAG,aAAc,EACjB,MACV,CACQ,IAAK,KAAM,CACT,MAAMd,EAAK3kB,EAAK,CAAC,EACX4lB,EAAK5lB,EAAK,CAAC,EACXklB,EAASllB,EAAK,CAAC,EACfolB,EAAK,KAAK,mBAAmB,IAAIT,CAAE,EACrCS,IACF,aAAaA,EAAG,OAAO,EACnBQ,EACFR,EAAG,QAAQF,CAAM,EAEjBE,EAAG,OAAO,IAAI,MAAMF,CAAM,CAAC,EAC7B,KAAK,mBAAmB,OAAOP,CAAE,GAEnC,MACV,CACQ,IAAK,SAAU,CACb,MAAMA,EAAK3kB,EAAK,CAAC,EACXylB,EAAK,KAAK,SAAS,IAAId,CAAE,EAC/B,GAAI,CAACc,EACH,OACFA,EAAG,OAAS,GACZA,EAAG,MAAMzlB,EAAK,CAAC,CAAC,EAChB,MACV,CACQ,IAAK,SACH,KAAK,SAASA,EAAK,CAAC,CAAC,EACrB,OACF,IAAK,OAAQ,CACX,KAAK,UAAYA,EAAK,CAAC,EACvB,KAAK,YAAc,QACnByN,EAAA,KAAK,UAAL,MAAAA,EAAA,UAAezN,EAAK,CAAC,GACrB,MACV,CACA,CACK,MAAa,CACZ,MACN,CACA,CACE,MAAM,KAAKsW,EAAS,CAClB,GAAI,CAAC,KAAK,kBACR,MAAM,IAAI,MAAM,8BAA8B,EAChD,KAAK,kBAAkB,KAAK,IAAM,QAChCne,EAAA,KAAK,KAAL,MAAAA,EAAS,KAAKme,EACpB,CAAK,CACL,CACE,MAAM,KAAKuP,EAAe,CACxB,GAAI,CAAC,KAAK,UACR,MAAM,IAAI,MAAM,+CAA+C,EACjE,GAAI,KAAK,YACP,OAAO,KAAK,YACd,MAAMxrB,EAAM,MAAMwrB,EAAc,cAAc,KAAK,IAAK,KAAK,SAAS,CAAC,EACvE,YAAK,YAAc,IAAI,QAAQ,CAACf,EAASQ,IAAW,CAClD,MAAMQ,EAAU,WAAW,IAAM,CAC/B,MAAMV,EAAK,KAAK,mBAAmB,IAAI/qB,EAAI,EAAE,EACzC+qB,IACFA,EAAG,OAAO,IAAI,MAAM,gBAAgB,CAAC,EACrC,KAAK,mBAAmB,OAAO/qB,EAAI,EAAE,EAE/C,EAAS,KAAK,cAAc,EACtB,KAAK,mBAAmB,IAAIA,EAAI,GAAI,CAAE,QAAAyqB,EAAS,OAAAQ,EAAQ,QAAAQ,EAAS,CACtE,CAAK,EACD,KAAK,KAAK,WAAa,KAAK,UAAUzrB,CAAG,EAAI,GAAG,EACzC,KAAK,WAChB,CACE,MAAM,QAAQX,EAAO,CACnB,MAAMqsB,EAAM,IAAI,QAAQ,CAACjB,EAASQ,IAAW,CAC3C,MAAMQ,EAAU,WAAW,IAAM,CAC/B,MAAMV,EAAK,KAAK,mBAAmB,IAAI1rB,EAAM,EAAE,EAC3C0rB,IACFA,EAAG,OAAO,IAAI,MAAM,mBAAmB,CAAC,EACxC,KAAK,mBAAmB,OAAO1rB,EAAM,EAAE,EAEjD,EAAS,KAAK,cAAc,EACtB,KAAK,mBAAmB,IAAIA,EAAM,GAAI,CAAE,QAAAorB,EAAS,OAAAQ,EAAQ,QAAAQ,EAAS,CACxE,CAAK,EACD,YAAK,KAAK,YAAc,KAAK,UAAUpsB,CAAK,EAAI,GAAG,EAC5CqsB,CACX,CACE,MAAM,MAAMzB,EAAS7H,EAAQ,CAC3B,KAAK,SACL,MAAMkI,GAAKlI,GAAA,YAAAA,EAAQ,KAAM,SAAW,KAAK,OACnCsJ,EAAM,IAAI,QAAQ,CAACjB,EAASQ,IAAW,CAC3C,KAAK,kBAAkB,IAAIX,EAAI,CAAE,QAAAG,EAAS,OAAAQ,EAAQ,CACxD,CAAK,EACD,YAAK,KAAK,aAAeX,EAAK,KAAO,KAAK,UAAUL,CAAO,EAAE,UAAU,CAAC,CAAC,EAClEyB,CACX,CACE,UAAUzB,EAAS7H,EAAQ,CACzB,MAAMuJ,EAAe,KAAK,oBAAoB1B,EAAS7H,CAAM,EAC7D,OAAAuJ,EAAa,KAAM,EACZA,CACX,CACE,oBAAoB1B,EAAS7H,EAAQ,CACnC,KAAK,SACL,MAAMkI,EAAKlI,EAAO,KAAOA,EAAO,MAAQA,EAAO,MAAQ,IAAM,QAAU,KAAK,OACtEuJ,EAAe,IAAI,aAAa,KAAMrB,EAAIL,EAAS7H,CAAM,EAC/D,YAAK,SAAS,IAAIkI,EAAIqB,CAAY,EAC3BA,CACX,CACE,OAAQ,OACN,KAAK,sBAAsB,+BAA+B,EAC1D,KAAK,WAAa,IAClB7tB,EAAA,KAAK,KAAL,MAAAA,EAAS,OACb,CACE,WAAW2B,EAAI,CACb,KAAK,qBAAqB,QAAQA,EAAG,IAAI,EACpC,KAAK,cACR,KAAK,SAAU,CAErB,CACA,EACI,aAAe,KAAM,CAavB,YAAYmrB,EAAON,EAAIL,EAAS7H,EAAQ,CAZxCiH,EAAA,cACAA,EAAA,WACAA,EAAA,cAAS,IACTA,EAAA,aAAQ,IACRA,EAAA,gBACAA,EAAA,yBACAA,EAAA,sBACAA,EAAA,gBACAA,EAAA,eACAA,EAAA,gBACAA,EAAA,oBACAA,EAAA,0BAEE,KAAK,MAAQuB,EACb,KAAK,QAAUX,EACf,KAAK,GAAKK,EACV,KAAK,iBAAmBlI,EAAO,iBAC/B,KAAK,cAAgBA,EAAO,cAC5B,KAAK,YAAcA,EAAO,aAAewI,EAAM,gBAC/C,KAAK,OAASxI,EAAO,OACrB,KAAK,QAAUA,EAAO,QACtB,KAAK,QAAUA,EAAO,UAAa/iB,GAAU,CAC3C,QAAQ,KACN,oDAAoD,KAAK,EAAE,cAAc,KAAK,MAAM,GAAG,oBACvFA,CACD,CACP,EACA,CACE,MAAO,CACL,KAAK,MAAM,KAAK,WAAa,KAAK,GAAK,KAAO,KAAK,UAAU,KAAK,OAAO,EAAE,UAAU,CAAC,CAAC,EACvF,KAAK,kBAAoB,WAAW,KAAK,aAAa,KAAK,IAAI,EAAG,KAAK,WAAW,CACtF,CACE,cAAe,OACT,KAAK,QAET,aAAa,KAAK,iBAAiB,EACnC,KAAK,MAAQ,IACbvB,EAAA,KAAK,SAAL,MAAAA,EAAA,WACJ,CACE,MAAM+sB,EAAS,mBAAoB,OAC7B,CAAC,KAAK,QAAU,KAAK,MAAM,YAC7B,KAAK,MAAM,KAAK,YAAc,KAAK,UAAU,KAAK,EAAE,EAAI,GAAG,EAC3D,KAAK,OAAS,IAEhB,KAAK,MAAM,SAAS,OAAO,KAAK,EAAE,GAClC/sB,EAAA,KAAK,UAAL,MAAAA,EAAA,UAAe+sB,EACnB,CACA,EAGI,WACJ,GAAI,CACF,WAAa,SACf,MAAQ,CACR,CAaA,IAAI,mBAAqB,KAAM,CAO7B,YAAYlc,EAAM,CANlB0a,EAAA,cAAyB,IAAI,KAC7BA,EAAA,cAAyB,IAAI,KAC7BA,EAAA,mBAAc,IACdA,EAAA,oBACAA,EAAA,wBAAmC,IAAI,KACvCA,EAAA,mBAEE,KAAK,YAAc1a,EAAK,YACxB,KAAK,WAAaA,EAAK,uBAC3B,CACE,MAAM,YAAYma,EAAK1G,EAAQ,CAC7B0G,EAAM,aAAaA,CAAG,EACtB,IAAI8B,EAAQ,KAAK,OAAO,IAAI9B,CAAG,EAC/B,OAAK8B,IACHA,EAAQ,IAAI,cAAc9B,EAAK,CAC7B,YAAa,KAAK,iBAAiB,IAAIA,CAAG,EAAI,WAAa,KAAK,YAChE,wBAAyB,KAAK,UACtC,CAAO,EACG1G,GAAA,MAAAA,EAAQ,oBACVwI,EAAM,kBAAoBxI,EAAO,mBACnC,KAAK,OAAO,IAAI0G,EAAK8B,CAAK,GAE5B,MAAMA,EAAM,QAAS,EACdA,CACX,CACE,MAAMgB,EAAQ,CACZA,EAAO,IAAI,YAAY,EAAE,QAAS9C,GAAQ,QACxChrB,EAAA,KAAK,OAAO,IAAIgrB,CAAG,IAAnB,MAAAhrB,EAAsB,OAC5B,CAAK,CACL,CACE,UAAU8tB,EAAQ9B,EAAQ1H,EAAQ,CAChC,OAAO,KAAK,aACVwJ,EAAO,IAAK9C,IAAS,CAAE,IAAAA,EAAK,OAAAgB,CAAM,EAAG,EACrC1H,CACD,CACL,CACE,cAAcwJ,EAAQ3B,EAAS7H,EAAQ,CACrC,OAAO,KAAK,aACVwJ,EAAO,QAAS9C,GAAQmB,EAAQ,IAAKH,IAAY,CAAE,IAAAhB,EAAK,OAAAgB,CAAM,EAAG,CAAC,EAClE1H,CACD,CACL,CACE,aAAayJ,EAAUzJ,EAAQ,CACzB,KAAK,cACPA,EAAO,cAAgB,CAACwI,EAAON,IAAO,CACpC,IAAIwB,EAAM,KAAK,OAAO,IAAIxB,CAAE,EACvBwB,IACHA,EAAsB,IAAI,IAC1B,KAAK,OAAO,IAAIxB,EAAIwB,CAAG,GAEzBA,EAAI,IAAIlB,CAAK,CACd,GAEH,MAAMmB,EAA4B,IAAI,IAChCC,EAAO,CAAE,EACTC,EAAgB,CAAE,EACxB,IAAIC,EAActD,GAAO,OACnBqD,EAAcrD,CAAE,IAEpBqD,EAAcrD,CAAE,EAAI,GAChBqD,EAAc,OAAQtuB,GAAMA,CAAC,EAAE,SAAWkuB,EAAS,UACrD/tB,EAAAskB,EAAO,SAAP,MAAAtkB,EAAA,KAAAskB,GACA8J,EAAa,IAAM,CAClB,GAEJ,EACD,MAAMC,EAAiB,CAAE,EACzB,IAAIC,EAAc,CAACxD,EAAIiC,IAAW,OAC5BsB,EAAevD,CAAE,IAErBsD,EAAWtD,CAAE,EACbuD,EAAevD,CAAE,EAAIiC,EACjBsB,EAAe,OAAQxuB,GAAMA,CAAC,EAAE,SAAWkuB,EAAS,UACtD/tB,EAAAskB,EAAO,UAAP,MAAAtkB,EAAA,KAAAskB,EAAiB+J,GACjBC,EAAc,IAAM,CACnB,GAEJ,EACD,MAAMC,EAAgC/B,GAAO,OAC3C,IAAIxsB,EAAAskB,EAAO,mBAAP,MAAAtkB,EAAA,KAAAskB,EAA0BkI,GAC5B,MAAO,GAET,MAAMgC,EAAOP,EAAU,IAAIzB,CAAE,EAC7B,OAAAyB,EAAU,IAAIzB,CAAE,EACTgC,CACR,EACKC,EAAY,QAAQ,IACxBV,EAAS,IAAI,MAAO,CAAE,IAAA/C,EAAK,OAAAgB,CAAM,EAAIlB,IAAO,CAC1CE,EAAM,aAAaA,CAAG,EACtB,IAAI8B,EACJ,GAAI,CACFA,EAAQ,MAAM,KAAK,YAAY9B,EAAK,CAClC,kBAAmB1G,EAAO,QAAU,KAAK,IAAIA,EAAO,QAAU,GAAKA,EAAO,QAAU,GAAG,EAAI,MACvG,CAAW,CACF,OAAQ8I,EAAK,CACZkB,EAAYxD,GAAIsC,GAAA,YAAAA,EAAK,UAAW,OAAOA,CAAG,CAAC,EAC3C,MACV,CACQ,IAAIS,EAAef,EAAM,UAAU,CAACd,CAAM,EAAG,CAC3C,GAAG1H,EACH,OAAQ,IAAM8J,EAAWtD,CAAE,EAC3B,QAAUiC,GAAW,CACfA,EAAO,WAAW,gBAAgB,GAAKzI,EAAO,OAChDwI,EAAM,KAAKxI,EAAO,MAAM,EAAE,KAAK,IAAM,CACnCwI,EAAM,UAAU,CAACd,CAAM,EAAG,CACxB,GAAG1H,EACH,OAAQ,IAAM8J,EAAWtD,CAAE,EAC3B,QAAU4D,GAAY,CACpBJ,EAAYxD,EAAI4D,CAAO,CACxB,EACD,iBAAkBH,EAClB,YAAajK,EAAO,OACtC,CAAiB,CACjB,CAAe,EAAE,MAAO8I,GAAQ,CAChBkB,EAAYxD,EAAI,qDAAqDsC,CAAG,EAAE,CAC1F,CAAe,EAEDkB,EAAYxD,EAAIiC,CAAM,CAEzB,EACD,iBAAkBwB,EAClB,YAAajK,EAAO,OAC9B,CAAS,EACD4J,EAAK,KAAKL,CAAY,CACvB,CAAA,CACF,EACD,MAAO,CACL,MAAM,OAAQ,CACZ,MAAMY,EACNP,EAAK,QAASlB,GAAQ,CACpBA,EAAI,MAAO,CACrB,CAAS,CACT,CACK,CACL,CACE,iBAAiBe,EAAUzJ,EAAQ,CAC7B,KAAK,cACPA,EAAO,cAAgB,CAACwI,EAAON,IAAO,CACpC,IAAIwB,EAAM,KAAK,OAAO,IAAIxB,CAAE,EACvBwB,IACHA,EAAsB,IAAI,IAC1B,KAAK,OAAO,IAAIxB,EAAIwB,CAAG,GAEzBA,EAAI,IAAIlB,CAAK,CACd,GAEH,MAAMmB,EAA4B,IAAI,IAChCC,EAAO,CAAE,EACTS,EAAe,OAAO,KAAKZ,CAAQ,EAAE,OACrCI,EAAgB,CAAE,EACxB,IAAIC,EAActD,GAAO,OACnBqD,EAAcrD,CAAE,IAEpBqD,EAAcrD,CAAE,EAAI,GAChBqD,EAAc,OAAQtuB,GAAMA,CAAC,EAAE,SAAW8uB,KAC5C3uB,EAAAskB,EAAO,SAAP,MAAAtkB,EAAA,KAAAskB,GACA8J,EAAa,IAAM,CAClB,GAEJ,EACD,MAAMC,EAAiB,CAAE,EACzB,IAAIC,EAAc,CAACxD,EAAIiC,IAAW,OAC5BsB,EAAevD,CAAE,IAErBsD,EAAWtD,CAAE,EACbuD,EAAevD,CAAE,EAAIiC,EACjBsB,EAAe,OAAQxuB,GAAMA,CAAC,EAAE,SAAW8uB,KAC7C3uB,EAAAskB,EAAO,UAAP,MAAAtkB,EAAA,KAAAskB,EAAiB+J,GACjBC,EAAc,IAAM,CACnB,GAEJ,EACD,MAAMC,EAAgC/B,GAAO,OAC3C,IAAIxsB,EAAAskB,EAAO,mBAAP,MAAAtkB,EAAA,KAAAskB,EAA0BkI,GAC5B,MAAO,GAET,MAAMgC,EAAOP,EAAU,IAAIzB,CAAE,EAC7B,OAAAyB,EAAU,IAAIzB,CAAE,EACTgC,CACR,EACKC,EAAY,QAAQ,IACxB,OAAO,QAAQV,CAAQ,EAAE,IAAI,MAAOa,EAAK9D,EAAInsB,IAAQ,CACnD,GAAIA,EAAI,QAAQiwB,CAAG,IAAM9D,EAAI,CAC3BwD,EAAYxD,EAAI,eAAe,EAC/B,MACV,CACQ,GAAI,CAACE,EAAKmB,CAAO,EAAIyC,EACrB5D,EAAM,aAAaA,CAAG,EACtB,IAAI8B,EACJ,GAAI,CACFA,EAAQ,MAAM,KAAK,YAAY9B,EAAK,CAClC,kBAAmB1G,EAAO,QAAU,KAAK,IAAIA,EAAO,QAAU,GAAKA,EAAO,QAAU,GAAG,EAAI,MACvG,CAAW,CACF,OAAQ8I,EAAK,CACZkB,EAAYxD,GAAIsC,GAAA,YAAAA,EAAK,UAAW,OAAOA,CAAG,CAAC,EAC3C,MACV,CACQ,IAAIS,EAAef,EAAM,UAAUX,EAAS,CAC1C,GAAG7H,EACH,OAAQ,IAAM8J,EAAWtD,CAAE,EAC3B,QAAUiC,GAAW,CACfA,EAAO,WAAW,gBAAgB,GAAKzI,EAAO,OAChDwI,EAAM,KAAKxI,EAAO,MAAM,EAAE,KAAK,IAAM,CACnCwI,EAAM,UAAUX,EAAS,CACvB,GAAG7H,EACH,OAAQ,IAAM8J,EAAWtD,CAAE,EAC3B,QAAU4D,GAAY,CACpBJ,EAAYxD,EAAI4D,CAAO,CACxB,EACD,iBAAkBH,EAClB,YAAajK,EAAO,OACtC,CAAiB,CACjB,CAAe,EAAE,MAAO8I,GAAQ,CAChBkB,EAAYxD,EAAI,qDAAqDsC,CAAG,EAAE,CAC1F,CAAe,EAEDkB,EAAYxD,EAAIiC,CAAM,CAEzB,EACD,iBAAkBwB,EAClB,YAAajK,EAAO,OAC9B,CAAS,EACD4J,EAAK,KAAKL,CAAY,CACvB,CAAA,CACF,EACD,MAAO,CACL,MAAM,OAAQ,CACZ,MAAMY,EACNP,EAAK,QAASlB,GAAQ,CACpBA,EAAI,MAAO,CACrB,CAAS,CACT,CACK,CACL,CACE,cAAcc,EAAQ9B,EAAQ1H,EAAQ,CACpC,MAAMuK,EAAY,KAAK,UAAUf,EAAQ9B,EAAQ,CAC/C,GAAG1H,EACH,QAAS,CACPuK,EAAU,MAAO,CACzB,CACA,CAAK,EACD,OAAOA,CACX,CACE,kBAAkBf,EAAQ3B,EAAS7H,EAAQ,CACzC,MAAMuK,EAAY,KAAK,cAAcf,EAAQ3B,EAAS,CACpD,GAAG7H,EACH,QAAS,CACPuK,EAAU,MAAO,CACzB,CACA,CAAK,EACD,OAAOA,CACX,CACE,MAAM,UAAUf,EAAQ9B,EAAQ1H,EAAQ,CACtC,OAAO,IAAI,QAAQ,MAAOqI,GAAY,CACpC,MAAMmC,EAAS,CAAE,EACjB,KAAK,cAAchB,EAAQ9B,EAAQ,CACjC,GAAG1H,EACH,QAAQ/iB,EAAO,CACbutB,EAAO,KAAKvtB,CAAK,CAClB,EACD,QAAQqK,EAAG,CACT+gB,EAAQmC,CAAM,CACxB,CACA,CAAO,CACP,CAAK,CACL,CACE,MAAM,IAAIhB,EAAQ9B,EAAQ1H,EAAQ,CAChC0H,EAAO,MAAQ,EACf,MAAM8C,EAAS,MAAM,KAAK,UAAUhB,EAAQ9B,EAAQ1H,CAAM,EAC1D,OAAAwK,EAAO,KAAK,CAACjvB,EAAGC,IAAMA,EAAE,WAAaD,EAAE,UAAU,EAC1CivB,EAAO,CAAC,GAAK,IACxB,CACE,QAAQhB,EAAQvsB,EAAO,CACrB,OAAOusB,EAAO,IAAI,YAAY,EAAE,IAAI,MAAO9C,EAAKF,EAAInsB,IAAQ,CAC1D,GAAIA,EAAI,QAAQqsB,CAAG,IAAMF,EACvB,OAAO,QAAQ,OAAO,eAAe,EAEvC,IAAIvkB,EAAI,MAAM,KAAK,YAAYykB,CAAG,EAClC,OAAOzkB,EAAE,QAAQhF,CAAK,EAAE,KAAMwrB,GAAW,CACvC,GAAI,KAAK,YAAa,CACpB,IAAIiB,EAAM,KAAK,OAAO,IAAIzsB,EAAM,EAAE,EAC7BysB,IACHA,EAAsB,IAAI,IAC1B,KAAK,OAAO,IAAIzsB,EAAM,GAAIysB,CAAG,GAE/BA,EAAI,IAAIznB,CAAC,CACnB,CACQ,OAAOwmB,CACf,CAAO,CACP,CAAK,CACL,CACE,sBAAuB,CACrB,MAAMjc,EAAsB,IAAI,IAChC,YAAK,OAAO,QAAQ,CAACgc,EAAO9B,IAAQla,EAAI,IAAIka,EAAK8B,EAAM,SAAS,CAAC,EAC1Dhc,CACX,CACE,SAAU,CACR,KAAK,OAAO,QAASie,GAASA,EAAK,OAAO,EAC1C,KAAK,OAAyB,IAAI,GACtC,CACA,EAGI,YACJ,GAAI,CACF,YAAc,SAChB,MAAQ,CACR,CACG,IAAC,WAAa,cAAc,kBAAmB,CAChD,aAAc,CACZ,MAAM,CAAE,YAAa,wBAAyB,WAAW,CAAE,CAC/D,CACA,EAGI,cAAgB,CAAA,EACpB,SAAS,cAAe,CACtB,aAAc,IAAMC,eACpB,cAAe,IAAM,cACrB,eAAgB,IAAM,eACtB,OAAQ,IAAM,OACd,eAAgB,IAAM,eACtB,YAAa,IAAM,YACnB,YAAa,IAAM,YACnB,aAAc,IAAM,aACpB,WAAY,IAAM,WAClB,eAAgB,IAAM,eACtB,WAAY,IAAM,WAClB,WAAY,IAAM,UACpB,CAAC,EAGD,IAAI,eAAiB,CACnB,WAAapmB,GAAU,sBAAsB,KAAKA,GAAS,EAAE,EAC7D,SAAWA,GAAU,oBAAoB,KAAKA,GAAS,EAAE,EACzD,QAAUA,GAAU,mBAAmB,KAAKA,GAAS,EAAE,EACvD,OAASA,GAAU,qBAAqB,KAAKA,GAAS,EAAE,EACxD,OAASA,GAAU,qBAAqB,KAAKA,GAAS,EAAE,EACxD,OAASA,GAAU,kBAAkB,KAAKA,GAAS,EAAE,EACrD,YAAcA,GAAU,uBAAuB,KAAKA,GAAS,EAAE,CACjE,EACI,cAAgB,IAChBomB,eAAe,2DACnB,SAAS,oBAAoBroB,EAAQ,CACnC,MAAMsoB,EAAa,IAAI,WAAW,CAAC,EACnC,OAAAA,EAAW,CAAC,EAAItoB,GAAU,GAAK,IAC/BsoB,EAAW,CAAC,EAAItoB,GAAU,GAAK,IAC/BsoB,EAAW,CAAC,EAAItoB,GAAU,EAAI,IAC9BsoB,EAAW,CAAC,EAAItoB,EAAS,IAClBsoB,CACT,CACA,SAAS,eAAeC,EAAW,CACjC,GAAI,CACF,OAAIA,EAAU,WAAW,QAAQ,IAC/BA,EAAYA,EAAU,UAAU,CAAC,GAC5B,OAAOA,CAAS,CACxB,MAAc,CACb,MAAO,CAAE,KAAM,UAAW,KAAM,IAAM,CAC1C,CACA,CACA,SAAS,OAAOC,EAAO,mBACrB,GAAI,CAAE,OAAAhU,EAAQ,MAAAgI,CAAO,EAAGc,SAAO,OAAOkL,EAAO,aAAa,EACtDtnB,EAAO,IAAI,WAAWoc,SAAO,UAAUd,CAAK,CAAC,EACjD,OAAQhI,EAAM,CACZ,IAAK,WAAY,CACf,IAAIiU,EAAM,SAASvnB,CAAI,EACvB,GAAI,GAAC7H,EAAAovB,EAAI,CAAC,IAAL,MAAApvB,EAAS,IACZ,MAAM,IAAI,MAAM,4BAA4B,EAC9C,GAAIovB,EAAI,CAAC,EAAE,CAAC,EAAE,SAAW,GACvB,MAAM,IAAI,MAAM,0BAA0B,EAC5C,MAAO,CACL,KAAM,WACN,KAAM,CACJ,OAAQC,aAAYD,EAAI,CAAC,EAAE,CAAC,CAAC,EAC7B,OAAQA,EAAI,CAAC,EAAIA,EAAI,CAAC,EAAE,IAAK3tB,GAAM,YAAY,OAAOA,CAAC,CAAC,EAAI,CAAA,CACtE,CACO,CACP,CACI,IAAK,SAAU,CACb,IAAI2tB,EAAM,SAASvnB,CAAI,EACvB,GAAI,GAAC3H,EAAAkvB,EAAI,CAAC,IAAL,MAAAlvB,EAAS,IACZ,MAAM,IAAI,MAAM,0BAA0B,EAC5C,GAAIkvB,EAAI,CAAC,EAAE,CAAC,EAAE,SAAW,GACvB,MAAM,IAAI,MAAM,0BAA0B,EAC5C,GAAIA,EAAI,CAAC,GAAKA,EAAI,CAAC,EAAE,CAAC,EAAE,SAAW,GACjC,MAAM,IAAI,MAAM,0BAA0B,EAC5C,GAAIA,EAAI,CAAC,GAAKA,EAAI,CAAC,EAAE,CAAC,EAAE,SAAW,EACjC,MAAM,IAAI,MAAM,yBAAyB,EAC3C,MAAO,CACL,KAAM,SACN,KAAM,CACJ,GAAIC,aAAYD,EAAI,CAAC,EAAE,CAAC,CAAC,EACzB,OAAQA,EAAI,CAAC,EAAIA,EAAI,CAAC,EAAE,IAAK3tB,GAAM,YAAY,OAAOA,CAAC,CAAC,EAAI,CAAE,EAC9D,QAAQ6T,EAAA8Z,EAAI,CAAC,IAAL,MAAA9Z,EAAS,GAAK+Z,aAAYD,EAAI,CAAC,EAAE,CAAC,CAAC,EAAI,OAC/C,MAAME,EAAAF,EAAI,CAAC,IAAL,MAAAE,EAAS,GAAK,SAASD,aAAYD,EAAI,CAAC,EAAE,CAAC,CAAC,EAAG,EAAE,EAAI,MACrE,CACO,CACP,CACI,IAAK,QAAS,CACZ,IAAIA,EAAM,SAASvnB,CAAI,EACvB,GAAI,GAAC0nB,EAAAH,EAAI,CAAC,IAAL,MAAAG,EAAS,IACZ,MAAM,IAAI,MAAM,yBAAyB,EAC3C,GAAI,GAACC,EAAAJ,EAAI,CAAC,IAAL,MAAAI,EAAS,IACZ,MAAM,IAAI,MAAM,yBAAyB,EAC3C,GAAIJ,EAAI,CAAC,EAAE,CAAC,EAAE,SAAW,GACvB,MAAM,IAAI,MAAM,0BAA0B,EAC5C,GAAI,GAACK,EAAAL,EAAI,CAAC,IAAL,MAAAK,EAAS,IACZ,MAAM,IAAI,MAAM,yBAAyB,EAC3C,GAAIL,EAAI,CAAC,EAAE,CAAC,EAAE,SAAW,EACvB,MAAM,IAAI,MAAM,yBAAyB,EAC3C,MAAO,CACL,KAAM,QACN,KAAM,CACJ,WAAY,YAAY,OAAOA,EAAI,CAAC,EAAE,CAAC,CAAC,EACxC,OAAQC,aAAYD,EAAI,CAAC,EAAE,CAAC,CAAC,EAC7B,KAAM,SAASC,aAAYD,EAAI,CAAC,EAAE,CAAC,CAAC,EAAG,EAAE,EACzC,OAAQA,EAAI,CAAC,EAAIA,EAAI,CAAC,EAAE,IAAK3tB,GAAM,YAAY,OAAOA,CAAC,CAAC,EAAI,CAAA,CACtE,CACO,CACP,CACI,IAAK,OACH,MAAO,CAAE,KAAM0Z,EAAQ,KAAAtT,CAAM,EAC/B,IAAK,OACL,IAAK,OACH,MAAO,CAAE,KAAMsT,EAAQ,KAAMkU,aAAYxnB,CAAI,CAAG,EAClD,QACE,MAAM,IAAI,MAAM,kBAAkBsT,CAAM,EAAE,CAChD,CACA,CACA,SAAS,SAAStT,EAAM,CACtB,IAAImH,EAAS,CAAE,EACX0gB,EAAO7nB,EACX,KAAO6nB,EAAK,OAAS,GAAG,CACtB,IAAIrO,EAAIqO,EAAK,CAAC,EACVlwB,EAAIkwB,EAAK,CAAC,EACVzqB,EAAIyqB,EAAK,MAAM,EAAG,EAAIlwB,CAAC,EAE3B,GADAkwB,EAAOA,EAAK,MAAM,EAAIlwB,CAAC,EACnByF,EAAE,OAASzF,EACb,MAAM,IAAI,MAAM,kCAAkC6hB,CAAC,EAAE,EACvDrS,EAAOqS,CAAC,EAAIrS,EAAOqS,CAAC,GAAK,CAAE,EAC3BrS,EAAOqS,CAAC,EAAE,KAAKpc,CAAC,CACpB,CACE,OAAO+J,CACT,CACA,SAAS,WAAW9K,EAAK,CACvB,OAAO,YAAY,OAAQA,CAAG,CAChC,CACA,SAAS,WAAW4H,EAAK,CACvB,OAAO,YAAY,OAAQI,aAAWJ,CAAG,CAAC,CAC5C,CACA,SAAS,WAAWA,EAAK,CACvB,OAAO,YAAY,OAAQI,aAAWJ,CAAG,CAAC,CAC5C,CACA,SAAS,aAAaqP,EAAQtT,EAAM,CAClC,IAAIsb,EAAQc,SAAO,QAAQpc,CAAI,EAC/B,OAAOoc,SAAO,OAAO9I,EAAQgI,EAAO,aAAa,CACnD,CACA,SAAS,YAAYhI,EAAQvU,EAAO,CAClC,OAAO,aAAauU,EAAQvU,CAAK,CACnC,CACA,SAAS,eAAe+oB,EAAS,CAC/B,IAAI9nB,EAAO,UAAU,CACnB,EAAG,CAACqE,aAAWyjB,EAAQ,MAAM,CAAC,EAC9B,GAAIA,EAAQ,QAAU,CAAE,GAAE,IAAK3E,GAAQ,YAAY,OAAOA,CAAG,CAAC,CAClE,CAAG,EACD,OAAO,aAAa,WAAYnjB,CAAI,CACtC,CACA,SAAS,aAAatG,EAAO,CAC3B,IAAIquB,EACAruB,EAAM,OAAS,SACjBquB,EAAY,oBAAoBruB,EAAM,IAAI,GAE5C,IAAIsG,EAAO,UAAU,CACnB,EAAG,CAACqE,aAAW3K,EAAM,EAAE,CAAC,EACxB,GAAIA,EAAM,QAAU,IAAI,IAAKypB,GAAQ,YAAY,OAAOA,CAAG,CAAC,EAC5D,EAAGzpB,EAAM,OAAS,CAAC2K,aAAW3K,EAAM,MAAM,CAAC,EAAI,CAAE,EACjD,EAAGquB,EAAY,CAAC,IAAI,WAAWA,CAAS,CAAC,EAAI,CAAA,CACjD,CAAG,EACD,OAAO,aAAa,SAAU/nB,CAAI,CACpC,CACA,SAAS,YAAYgoB,EAAM,CACzB,IAAI/D,EAAO,IAAI,YAAY,CAAC,EAC5B,IAAI,SAASA,CAAI,EAAE,UAAU,EAAG+D,EAAK,KAAM,EAAK,EAChD,IAAIhoB,EAAO,UAAU,CACnB,EAAG,CAAC,YAAY,OAAOgoB,EAAK,UAAU,CAAC,EACvC,GAAIA,EAAK,QAAU,IAAI,IAAK7E,GAAQ,YAAY,OAAOA,CAAG,CAAC,EAC3D,EAAG,CAAC9e,aAAW2jB,EAAK,MAAM,CAAC,EAC3B,EAAG,CAAC,IAAI,WAAW/D,CAAI,CAAC,CAC5B,CAAG,EACD,OAAO,aAAa,QAASjkB,CAAI,CACnC,CACA,SAAS,UAAUunB,EAAK,CACtB,IAAIU,EAAU,CAAE,EAChB,cAAO,QAAQV,CAAG,EAAE,QAAO,EAAG,QAAQ,CAAC,CAAC,EAAGW,CAAE,IAAM,CACjDA,EAAG,QAAS9qB,GAAM,CAChB,IAAI+qB,EAAQ,IAAI,WAAW/qB,EAAE,OAAS,CAAC,EACvC+qB,EAAM,IAAI,CAAC,SAAS,CAAC,CAAC,EAAG,CAAC,EAC1BA,EAAM,IAAI,CAAC/qB,EAAE,MAAM,EAAG,CAAC,EACvB+qB,EAAM,IAAI/qB,EAAG,CAAC,EACd6qB,EAAQ,KAAKE,CAAK,CACxB,CAAK,CACL,CAAG,EACMloB,cAAY,GAAGgoB,CAAO,CAC/B,CA4FA,IAAI,cAAgB,CAAE,EACtB,SAAS,cAAe,CACtB,QAAS,IAAMrK,UACf,QAAS,IAAMF,SACjB,CAAC,EAKD,SAASA,UAAQmG,EAAWe,EAAQwD,EAAM,CACxC,MAAMC,EAAUxE,aAAqB,WAAayE,aAAYzE,CAAS,EAAIA,EACrExnB,EAAM2b,YAAU,gBAAgBqQ,EAAS,KAAOzD,CAAM,EACtD2D,EAAgB,eAAelsB,CAAG,EACxC,IAAIgiB,EAAK,WAAW,KAAK3d,cAAY,EAAE,CAAC,EACpCod,EAAY,YAAY,OAAOsK,CAAI,EACnC5J,EAAa,IAAI+J,EAAelK,CAAE,EAAE,QAAQP,CAAS,EACrD0K,EAAQ,OAAO,OAAO,IAAI,WAAWhK,CAAU,CAAC,EAChDiK,EAAQ,OAAO,OAAO,IAAI,WAAWpK,EAAG,MAAM,CAAC,EACnD,MAAO,GAAGmK,CAAK,OAAOC,CAAK,EAC7B,CACA,SAAS7K,UAAQiG,EAAWe,EAAQ5kB,EAAM,CACxC,MAAMqoB,EAAUxE,aAAqB,WAAayE,aAAYzE,CAAS,EAAIA,EAC3E,GAAI,CAAC2E,EAAOC,CAAK,EAAIzoB,EAAK,MAAM,MAAM,EAClC3D,EAAM2b,YAAU,gBAAgBqQ,EAAS,KAAOzD,CAAM,EACtD2D,EAAgB,eAAelsB,CAAG,EAClCgiB,EAAK,OAAO,OAAOoK,CAAK,EACxBjK,EAAa,OAAO,OAAOgK,CAAK,EAChC1K,EAAY,IAAIyK,EAAelK,CAAE,EAAE,QAAQG,CAAU,EACzD,OAAO,YAAY,OAAOV,CAAS,CACrC,CACA,SAAS,eAAezhB,EAAK,CAC3B,OAAOA,EAAI,MAAM,EAAG,EAAE,CACxB,CAGA,IAAI,cAAgB,CAAE,EACtB,SAAS,cAAe,CACtB,YAAa,IAAMqsB,cACnB,QAAS,IAAM,QACf,QAAS,IAAM,QACf,aAAc,IAAM,aACpB,aAAc,IAAM,aACpB,uBAAwB,IAAM,sBAChC,CAAC,EACD,IAAIA,cAAc,0CACd,QAAW3nB,GAAU2nB,cAAY,KAAK3nB,GAAS,EAAE,EACjD,OACJ,GAAI,CACF,OAAS,KACX,OAASgD,EAAG,CAEZ,CACA,SAAS,uBAAuB4kB,EAAqB,CACnD,OAASA,CACX,CACA,eAAe,aAAaC,EAAQC,EAAQ,GAAI,CAC9C,GAAI,CACF,MAAM1F,EAAM,WAAWyF,CAAM,gCAAgCC,CAAK,GAC5D9mB,EAAM,MAAM,OAAOohB,EAAK,CAAE,SAAU,SAAU,EACpD,GAAIphB,EAAI,SAAW,IACjB,MAAM,MAAM,qBAAqB,EAGnC,OADa,MAAMA,EAAI,KAAM,GACjB,KACb,MAAW,CACV,MAAO,CAAE,CACb,CACA,CACA,eAAe,aAAa+mB,EAAU,OACpC,MAAMvtB,EAAQutB,EAAS,MAAMJ,aAAW,EACxC,GAAI,CAACntB,EACH,OAAO,KACT,KAAM,EAAGK,EAAO,IAAKgtB,CAAM,EAAIrtB,EAC/B,GAAI,CACF,MAAM4nB,EAAM,WAAWyF,CAAM,gCAAgChtB,CAAI,GAC3DmG,EAAM,MAAM,OAAOohB,EAAK,CAAE,SAAU,SAAU,EACpD,GAAIphB,EAAI,SAAW,IACjB,MAAM,MAAM,qBAAqB,EAEnC,MAAMwiB,EAAO,MAAMxiB,EAAI,KAAM,EACvB6iB,EAASL,EAAK,MAAM3oB,CAAI,EAC9B,OAAOgpB,EAAS,CAAE,OAAAA,EAAQ,QAAQzsB,EAAAosB,EAAK,SAAL,YAAApsB,EAAcysB,EAAO,EAAK,IAC7D,MAAY,CACX,OAAO,IACX,CACA,CACA,eAAe,QAAQA,EAAQmE,EAAO,CACpC,MAAMhnB,EAAM,MAAM,aAAagnB,CAAK,EACpC,OAAOhnB,EAAMA,EAAI,SAAW6iB,EAAS,EACvC,CAGA,IAAI,cAAgB,CAAE,EACtB,SAAS,cAAe,CACtB,MAAO,IAAM,KACf,CAAC,EACD,SAAS,MAAMlrB,EAAO,CACpB,MAAMyN,EAAS,CACb,MAAO,OACP,KAAM,OACN,SAAU,CAAE,EACZ,SAAU,CAAE,EACZ,OAAQ,CAAA,CACT,EACD,IAAI6hB,EACAC,EACJ,QAAShG,EAAKvpB,EAAM,KAAK,OAAS,EAAGupB,GAAM,EAAGA,IAAM,CAClD,MAAM1K,EAAM7e,EAAM,KAAKupB,CAAE,EACzB,GAAI1K,EAAI,CAAC,IAAM,KAAOA,EAAI,CAAC,EAAG,CAC5B,KAAM,CAACxU,EAAGmlB,EAAaC,EAAcC,EAAYC,CAAU,EAAI9Q,EACzD+Q,EAAe,CACnB,GAAIJ,EACJ,OAAQC,EAAe,CAACA,CAAY,EAAI,CAAE,EAC1C,OAAQE,CACT,EACD,GAAID,IAAe,OAAQ,CACzBjiB,EAAO,KAAOmiB,EACd,QACR,CACM,GAAIF,IAAe,QAAS,CAC1BjiB,EAAO,MAAQmiB,EACf,QACR,CACM,GAAIF,IAAe,UAAW,CAC5BjiB,EAAO,SAAS,KAAKmiB,CAAY,EACjC,QACR,CACWN,EAGHC,EAAYK,EAFZN,EAAcM,EAIhBniB,EAAO,SAAS,KAAKmiB,CAAY,EACjC,QACN,CACI,GAAI/Q,EAAI,CAAC,IAAM,KAAOA,EAAI,CAAC,EAAG,CAC5B,KAAM,CAACxU,EAAGmlB,EAAaC,CAAY,EAAI5Q,EACvCpR,EAAO,OAAO,KAAK,CACjB,GAAI+hB,EACJ,OAAQC,EAAe,CAACA,CAAY,EAAI,CAAA,CAChD,CAAO,CACP,CACI,GAAI5Q,EAAI,CAAC,IAAM,KAAOA,EAAI,CAAC,EAAG,CAC5BpR,EAAO,SAAS,KAAK,CACnB,OAAQoR,EAAI,CAAC,EACb,OAAQA,EAAI,CAAC,EAAI,CAACA,EAAI,CAAC,CAAC,EAAI,CAAA,CACpC,CAAO,EACD,QACN,CACA,CACE,OAAKpR,EAAO,OACVA,EAAO,KAAO8hB,GAAaD,GAAe7hB,EAAO,OAE9CA,EAAO,QACVA,EAAO,MAAQ6hB,GAAe7hB,EAAO,MAGvC,CAACA,EAAO,MAAOA,EAAO,IAAI,EAAE,QAASoiB,GAAQ,CAC3C,GAAI,CAACA,EACH,OACF,IAAItM,EAAM9V,EAAO,SAAS,QAAQoiB,CAAG,EAIrC,GAHItM,IAAQ,IACV9V,EAAO,SAAS,OAAO8V,EAAK,CAAC,EAE3BsM,EAAI,OAAQ,CACd,IAAIC,EAASriB,EAAO,SAAS,KAAM5N,GAAMA,EAAE,SAAWgwB,EAAI,MAAM,EAC5DC,GAAUA,EAAO,SACdD,EAAI,SACPA,EAAI,OAAS,CAAE,GAEjBC,EAAO,OAAO,QAASrG,GAAQ,SACzBhrB,EAAAoxB,EAAI,SAAJ,YAAApxB,EAAY,QAAQgrB,MAAS,IAC/BoG,EAAI,OAAO,KAAKpG,CAAG,CAC/B,CAAS,EACDqG,EAAO,OAASD,EAAI,OAE5B,CACA,CAAG,EACDpiB,EAAO,SAAS,QAASoiB,GAAQ,CAC/B,GAAIA,EAAI,OAAQ,CACd,IAAIC,EAASriB,EAAO,SAAS,KAAM5N,GAAMA,EAAE,SAAWgwB,EAAI,MAAM,EAC5DC,GAAUA,EAAO,SACdD,EAAI,SACPA,EAAI,OAAS,CAAE,GAEjBC,EAAO,OAAO,QAASrG,GAAQ,CACzBoG,EAAI,OAAO,QAAQpG,CAAG,IAAM,IAC9BoG,EAAI,OAAO,KAAKpG,CAAG,CAC/B,CAAS,EACDqG,EAAO,OAASD,EAAI,OAE5B,CACA,CAAG,EACMpiB,CACT,CAGA,IAAI,cAAgB,CAAE,EACtB,SAAS,cAAe,CACtB,sBAAuB,IAAM,sBAC7B,uBAAwB,IAAM,uBAChC,CAAC,EACD,IAAI,QACJ,GAAI,CACF,QAAU,KACZ,MAAQ,CACR,CACA,SAAS,wBAAwBwhB,EAAqB,CACpD,QAAUA,CACZ,CACA,eAAe,sBAAsBxF,EAAK,CACxC,OAAO,MAAO,MAAM,MAAMA,EAAI,QAAQ,QAAS,SAAS,EAAE,QAAQ,SAAU,UAAU,EAAG,CACvF,QAAS,CAAE,OAAQ,wBAAwB,CAC5C,CAAA,GAAG,KAAM,CACZ,CAGA,IAAI,cAAgB,CAAE,EACtB,SAAS,cAAe,CACtB,cAAe,IAAM,cACrB,OAAQ,IAAM,OACd,QAAS,IAAM,OACjB,CAAC,EAGD,SAAS,OAAOlf,EAAK,CACnB,IAAIwlB,EAAQ,EACZ,QAASxG,EAAK,EAAGA,EAAK,GAAIA,GAAM,EAAG,CACjC,MAAMyG,EAAS,SAASzlB,EAAI,UAAUgf,EAAIA,EAAK,CAAC,EAAG,EAAE,EACrD,GAAIyG,IAAW,EACbD,GAAS,OACJ,CACLA,GAAS,KAAK,MAAMC,CAAM,EAC1B,KACN,CACA,CACE,OAAOD,CACT,CACA,SAAS,QAAQE,EAAUC,EAAY,CACrC,IAAIH,EAAQ,EACZ,MAAM/vB,EAAQiwB,EACRpR,EAAM,CAAC,QAASkR,EAAM,WAAYG,EAAW,UAAU,EAE7D,IADAlwB,EAAM,KAAK,KAAK6e,CAAG,IACN,CACX,MAAMsR,EAAO,KAAK,MAAM,IAAI,OAAO,QAAS,EAAG,GAAG,EAOlD,GANIA,IAASnwB,EAAM,aACjB+vB,EAAQ,EACR/vB,EAAM,WAAamwB,GAErBtR,EAAI,CAAC,GAAK,EAAEkR,GAAO,SAAU,EAC7B/vB,EAAM,GAAK,cAAcA,CAAK,EAC1B,OAAOA,EAAM,EAAE,GAAKkwB,EACtB,KAEN,CACE,OAAOlwB,CACT,CACA,SAAS,cAAcW,EAAK,CAC1B,OAAOyvB,aACLC,SAAQ,YAAY,OAAO,KAAK,UAAU,CAAC,EAAG1vB,EAAI,OAAQA,EAAI,WAAYA,EAAI,KAAMA,EAAI,KAAMA,EAAI,OAAO,CAAC,CAAC,CAAC,CAC7G,CACH,CAGA,IAAI,cAAgB,CAAE,EACtB,SAAS,cAAe,CACtB,YAAa,IAAM,aACnB,iBAAkB,IAAM,kBACxB,UAAW,IAAM,WACjB,eAAgB,IAAM,eACxB,CAAC,EAGD,IAAI,cAAgB,CAAE,EACtB,SAAS,cAAe,CACtB,YAAa,IAAM,YACnB,WAAY,IAAM,WAClB,WAAY,IAAM,WAClB,YAAa,IAAM,YACnB,iBAAkB,IAAM,iBACxB,UAAW,IAAM2vB,YACjB,eAAgB,IAAM,cACxB,CAAC,EAGD,IAAI,cAAgB,CAAE,EACtB,SAAS,cAAe,CACtB,QAAS,IAAM,SACf,QAAS,IAAM,SACf,mBAAoB,IAAM,mBAC1B,GAAI,IAAM,EACZ,CAAC,EASD,IAAI,iBAAmB,EACnB,iBAAmB,MACvB,SAAS,mBAAmBC,EAAUC,EAAS,CAC7C,MAAMC,EAAUC,YAAW,gBAAgBH,EAAU,KAAOC,CAAO,EAAE,SAAS,EAAG,EAAE,EACnF,OAAOG,QAAaC,SAASH,EAAS,UAAU,CAClD,CACA,SAAS,eAAeI,EAAiBpL,EAAO,CAC9C,MAAMzkB,EAAO8vB,OAAYF,SAASC,EAAiBpL,EAAO,EAAE,EAC5D,MAAO,CACL,WAAYzkB,EAAK,SAAS,EAAG,EAAE,EAC/B,aAAcA,EAAK,SAAS,GAAI,EAAE,EAClC,SAAUA,EAAK,SAAS,GAAI,EAAE,CAC/B,CACH,CACA,SAAS,cAAcxC,EAAK,CAC1B,GAAI,CAAC,OAAO,cAAcA,CAAG,GAAKA,EAAM,EACtC,MAAM,IAAI,MAAM,2BAA2B,EAC7C,GAAIA,GAAO,GACT,MAAO,IACT,MAAMuyB,EAAY,GAAK,KAAK,MAAM,KAAK,KAAKvyB,EAAM,CAAC,CAAC,EAAI,EAClDwyB,EAAQD,GAAa,IAAM,GAAKA,EAAY,EAClD,OAAOC,GAAS,KAAK,OAAOxyB,EAAM,GAAKwyB,CAAK,EAAI,EAClD,CACA,SAAS,WAAWvmB,EAAK,CACvB,GAAI,CAAC,OAAO,cAAcA,CAAG,GAAKA,EAAM,kBAAoBA,EAAM,iBAChE,MAAM,IAAI,MAAM,2DAA2D,EAC7E,MAAMrN,EAAM,IAAI,WAAW,CAAC,EAC5B,WAAI,SAASA,EAAI,MAAM,EAAE,UAAU,EAAGqN,EAAK,EAAK,EACzCrN,CACT,CACA,SAAS,IAAIgnB,EAAW,CACtB,MAAM6M,EAAW,YAAY,OAAO7M,CAAS,EACvC8M,EAAcD,EAAS,OACvBrX,EAAS,WAAWsX,CAAW,EAC/BC,EAAS,IAAI,WAAW,cAAcD,CAAW,EAAIA,CAAW,EACtE,OAAOE,cAAaxX,EAAQqX,EAAUE,CAAM,CAC9C,CACA,SAAS,MAAME,EAAQ,CACrB,MAAMH,EAAc,IAAI,SAASG,EAAO,MAAM,EAAE,UAAU,CAAC,EACrDJ,EAAWI,EAAO,SAAS,EAAG,EAAIH,CAAW,EACnD,GAAIA,EAAc,kBAAoBA,EAAc,kBAAoBD,EAAS,SAAWC,GAAeG,EAAO,SAAW,EAAI,cAAcH,CAAW,EACxJ,MAAM,IAAI,MAAM,iBAAiB,EACnC,OAAO,YAAY,OAAOD,CAAQ,CACpC,CACA,SAAS,QAAQtuB,EAAKia,EAAS0U,EAAK,CAClC,GAAIA,EAAI,SAAW,GACjB,MAAM,IAAI,MAAM,sCAAsC,EACxD,MAAMC,EAAWH,cAAaE,EAAK1U,CAAO,EAC1C,OAAOD,OAAKiU,SAASjuB,EAAK4uB,CAAQ,CACpC,CACA,SAAS,cAActF,EAAS,CAC9B,GAAI,OAAOA,GAAY,SACrB,MAAM,IAAI,MAAM,gCAAgC,EAClD,MAAMuF,EAAOvF,EAAQ,OACrB,GAAIuF,EAAO,KAAOA,EAAO,MACvB,MAAM,IAAI,MAAM,2BAA6BA,CAAI,EACnD,GAAIvF,EAAQ,CAAC,IAAM,IACjB,MAAM,IAAI,MAAM,4BAA4B,EAC9C,IAAI3lB,EACJ,GAAI,CACFA,EAAOmrB,OAAQ,OAAOxF,CAAO,CAC9B,OAAQ9mB,EAAO,CACd,MAAM,IAAI,MAAM,mBAAqBA,EAAM,OAAO,CACtD,CACE,MAAMusB,EAAOprB,EAAK,OAClB,GAAIorB,EAAO,IAAMA,EAAO,MACtB,MAAM,IAAI,MAAM,wBAA0BA,CAAI,EAChD,MAAMC,EAAOrrB,EAAK,CAAC,EACnB,GAAIqrB,IAAS,EACX,MAAM,IAAI,MAAM,8BAAgCA,CAAI,EACtD,MAAO,CACL,MAAOrrB,EAAK,SAAS,EAAG,EAAE,EAC1B,WAAYA,EAAK,SAAS,GAAI,GAAG,EACjC,IAAKA,EAAK,SAAS,GAAG,CACvB,CACH,CACA,SAAS,SAAS8d,EAAWyM,EAAiBpL,EAAQmM,cAAa,EAAE,EAAG,CACtE,KAAM,CAAE,WAAAC,EAAY,aAAAC,EAAc,SAAAC,CAAU,EAAG,eAAelB,EAAiBpL,CAAK,EAC9E4L,EAAS,IAAIjN,CAAS,EACtBU,EAAa,SAAS+M,EAAYC,EAAcT,CAAM,EACtDW,EAAM,QAAQD,EAAUjN,EAAYW,CAAK,EAC/C,OAAOgM,OAAQ,OAAOL,cAAa,IAAI,WAAW,CAAC,CAAC,CAAC,EAAG3L,EAAOX,EAAYkN,CAAG,CAAC,CACjF,CACA,SAAS,SAAS/F,EAAS4E,EAAiB,CAC1C,KAAM,CAAE,MAAApL,EAAO,WAAAX,EAAY,IAAAkN,CAAG,EAAK,cAAc/F,CAAO,EAClD,CAAE,WAAA4F,EAAY,aAAAC,EAAc,SAAAC,CAAU,EAAG,eAAelB,EAAiBpL,CAAK,EAC9EwM,EAAgB,QAAQF,EAAUjN,EAAYW,CAAK,EACzD,GAAI,CAACja,aAAWymB,EAAeD,CAAG,EAChC,MAAM,IAAI,MAAM,aAAa,EAC/B,MAAMX,EAAS,SAASQ,EAAYC,EAAchN,CAAU,EAC5D,OAAO,MAAMuM,CAAM,CACrB,CACA,IAAI,GAAK,CACP,MAAO,CACL,mBACA,aACD,EACD,QAAS,SACT,QAAS,QACX,EAGI,SAAW,EAAI,GAAK,GAAK,GACzB,IAAM,IAAM,KAAK,MAAM,KAAK,IAAK,EAAG,GAAG,EACvC,UAAY,IAAM,KAAK,MAAM,IAAK,EAAG,KAAK,OAAQ,EAAG,QAAQ,EAC7D,qBAAuB,CAAC7b,EAAYuG,IAAc,mBAAmBvG,EAAYuG,CAAS,EAC1F,aAAe,CAACzV,EAAMkP,EAAYuG,IAAc,SAAS,KAAK,UAAUzV,CAAI,EAAG,qBAAqBkP,EAAYuG,CAAS,CAAC,EAC1H,aAAe,CAACzV,EAAMkP,IAAe,KAAK,MAAM,SAASlP,EAAK,QAAS,qBAAqBkP,EAAYlP,EAAK,MAAM,CAAC,CAAC,EACzH,SAAS,YAAYtG,EAAOwV,EAAY,CACtC,MAAM0c,EAAQ,CACZ,WAAY,IAAK,EACjB,QAAS,GACT,KAAM,CAAE,EACR,GAAGlyB,EACH,OAAQ,aAAawV,CAAU,CAChC,EACD,OAAA0c,EAAM,GAAK9H,eAAa8H,CAAK,EACtBA,CACT,CACA,SAAS,WAAWA,EAAO1c,EAAY2c,EAAoB,CACzD,OAAO,cACL,CACE,KAAM,KACN,QAAS,aAAaD,EAAO1c,EAAY2c,CAAkB,EAC3D,WAAY,UAAW,EACvB,KAAM,CAAA,CACP,EACD3c,CACD,CACH,CACA,SAAS,WAAW4c,EAAMD,EAAoB,CAC5C,MAAME,EAAY,kBAAmB,EACrC,OAAO,cACL,CACE,KAAM,SACN,QAAS,aAAaD,EAAMC,EAAWF,CAAkB,EACzD,WAAY,UAAW,EACvB,KAAM,CAAC,CAAC,IAAKA,CAAkB,CAAC,CACjC,EACDE,CACD,CACH,CACA,SAAS/B,YAAUtwB,EAAOsyB,EAAkBH,EAAoB,CAC9D,MAAMD,EAAQ,YAAYlyB,EAAOsyB,CAAgB,EAC3CF,EAAO,WAAWF,EAAOI,EAAkBH,CAAkB,EACnE,OAAO,WAAWC,EAAMD,CAAkB,CAC5C,CACA,SAAS,eAAenyB,EAAOsyB,EAAkBC,EAAsB,CACrE,GAAI,CAACA,GAAwBA,EAAqB,SAAW,EAC3D,MAAM,IAAI,MAAM,qCAAqC,EAEvD,MAAMC,EAAkB,aAAaF,CAAgB,EAC/CG,EAAW,CAACnC,YAAUtwB,EAAOsyB,EAAkBE,CAAe,CAAC,EACrE,OAAAD,EAAqB,QAASJ,GAAuB,CACnDM,EAAS,KAAKnC,YAAUtwB,EAAOsyB,EAAkBH,CAAkB,CAAC,CACxE,CAAG,EACMM,CACT,CACA,SAAS,YAAYnS,EAAMoS,EAAqB,CAC9C,MAAMC,EAAgB,aAAarS,EAAMoS,CAAmB,EAC5D,OAAO,aAAaC,EAAeD,CAAmB,CACxD,CACA,SAAS,iBAAiBE,EAAeF,EAAqB,CAC5D,IAAIG,EAAkB,CAAE,EACxB,OAAAD,EAAc,QAASzyB,GAAM,CAC3B0yB,EAAgB,KAAK,YAAY1yB,EAAGuyB,CAAmB,CAAC,CAC5D,CAAG,EACDG,EAAgB,KAAK,CAACv0B,EAAGC,IAAMD,EAAE,WAAaC,EAAE,UAAU,EACnDs0B,CACT,CAGA,SAAS,YAAYC,EAAYlW,EAASmW,EAAmBC,EAAS,CACpE,MAAMC,EAAY,CAChB,WAAY,KAAK,KAAK,KAAK,IAAG,EAAK,GAAG,EACtC,KAAM,qBACN,KAAM,CAAE,EACR,QAASrW,CACV,EAED,OADwB,MAAM,QAAQkW,CAAU,EAAIA,EAAa,CAACA,CAAU,GAC5D,QAAQ,CAAC,CAAE,UAAA/W,EAAW,SAAAmX,CAAQ,IAAO,CACnDD,EAAU,KAAK,KAAKC,EAAW,CAAC,IAAKnX,EAAWmX,CAAQ,EAAI,CAAC,IAAKnX,CAAS,CAAC,CAChF,CAAG,EACGiX,GACFC,EAAU,KAAK,KAAK,CAAC,IAAKD,EAAQ,QAASA,EAAQ,UAAY,GAAI,OAAO,CAAC,EAEzED,GACFE,EAAU,KAAK,KAAK,CAAC,UAAWF,CAAiB,CAAC,EAE7CE,CACT,CACA,SAAS,WAAWX,EAAkBa,EAAWvW,EAASmW,EAAmBC,EAAS,CACpF,MAAMhzB,EAAQ,YAAYmzB,EAAWvW,EAASmW,EAAmBC,CAAO,EACxE,OAAO1C,YAAUtwB,EAAOsyB,EAAkBa,EAAU,SAAS,CAC/D,CACA,SAAS,gBAAgBb,EAAkBQ,EAAYlW,EAASmW,EAAmBC,EAAS,CAC1F,GAAI,CAACF,GAAcA,EAAW,SAAW,EACvC,MAAM,IAAI,MAAM,qCAAqC,EAGvD,MAAO,CAAC,CAAE,UADc,aAAaR,CAAgB,CACf,EAAE,GAAGQ,CAAU,EAAE,IACpDK,GAAc,WAAWb,EAAkBa,EAAWvW,EAASmW,EAAmBC,CAAO,CAC3F,CACH,CACA,IAAI,aAAe,YACf,kBAAoB,iBAGpB,cAAgB,CAAE,EACtB,SAAS,cAAe,CACtB,kBAAmB,IAAM,kBACzB,iBAAkB,IAAM,iBACxB,wBAAyB,IAAM,uBACjC,CAAC,EACD,SAAS,kBAAkBlT,EAAGsT,EAAUF,EAAU1d,EAAY,OAC5D,IAAI+U,EACJ,MAAM8I,EAAO,CAAC,GAAGvT,EAAE,MAAQ,CAAA,EAAI,CAAC,IAAKsT,EAAS,GAAIF,CAAQ,EAAG,CAAC,IAAKE,EAAS,MAAM,CAAC,EACnF,OAAIA,EAAS,OAAS,cACpB7I,EAAO,QAEPA,EAAO,cACP8I,EAAK,KAAK,CAAC,IAAK,OAAOD,EAAS,IAAI,CAAC,CAAC,GAEjC,cACL,CACE,KAAA7I,EACA,KAAA8I,EACA,QAASvT,EAAE,UAAY,KAAMrhB,EAAA20B,EAAS,OAAT,MAAA30B,EAAe,KAAMogB,GAAQA,EAAI,CAAC,IAAM,KAAO,GAAK,KAAK,UAAUuU,CAAQ,EACxG,WAAYtT,EAAE,UACf,EACDtK,CACD,CACH,CACA,SAAS,wBAAwBxV,EAAO,CACtC,GAAI,CAAC,CAAC,OAAQ,aAAa,EAAE,SAASA,EAAM,IAAI,EAC9C,OAEF,IAAIszB,EACAC,EACJ,QAAShK,EAAKvpB,EAAM,KAAK,OAAS,EAAGupB,GAAM,IAAM+J,IAAa,QAAUC,IAAa,QAAShK,IAAM,CAClG,MAAM1K,EAAM7e,EAAM,KAAKupB,CAAE,EACrB1K,EAAI,QAAU,IACZA,EAAI,CAAC,IAAM,KAAOyU,IAAa,OACjCA,EAAWzU,EACFA,EAAI,CAAC,IAAM,KAAO0U,IAAa,SACxCA,EAAW1U,GAGnB,CACE,GAAIyU,IAAa,OAGjB,MAAO,CACL,GAAIA,EAAS,CAAC,EACd,OAAQ,CAACA,EAAS,CAAC,EAAGC,GAAA,YAAAA,EAAW,EAAE,EAAE,OAAQzzB,GAAM,OAAOA,GAAM,QAAQ,EACxE,OAAQyzB,GAAA,YAAAA,EAAW,EACpB,CACH,CACA,SAAS,iBAAiBvzB,EAAO,CAAE,iBAAAwzB,CAAgB,EAAK,CAAA,EAAI,CAC1D,MAAMC,EAAU,wBAAwBzzB,CAAK,EAC7C,GAAIyzB,IAAY,QAAUzzB,EAAM,UAAY,GAC1C,OAEF,IAAI0zB,EACJ,GAAI,CACFA,EAAgB,KAAK,MAAM1zB,EAAM,OAAO,CACzC,MAAe,CACd,MACJ,CACE,GAAI0zB,EAAc,KAAOD,EAAQ,IAG7B,GAACD,GAAoB,CAAC,YAAYE,CAAa,GAGnD,OAAOA,CACT,CAGG,IAAC,cAAgB,CAAA,EACpB,SAAS,cAAe,CACtB,gBAAiB,IAAM,gBACvB,MAAO,IAAM,OACb,KAAM,IAAM,IACd,CAAC,EACD,IAAI,gBAAkB,IAAI,OAAO,UAAUjG,eAAa,MAAM,GAAG,EACjE,SAAS,KAAKpmB,EAAO,CACnB,OAAO,OAAOA,GAAU,UAAY,IAAI,OAAO,IAAI,gBAAgB,MAAM,GAAG,EAAE,KAAKA,CAAK,CAC1F,CACA,SAAS,OAAOssB,EAAK,CACnB,MAAM9xB,EAAQ8xB,EAAI,MAAM,IAAI,OAAO,IAAI,gBAAgB,MAAM,GAAG,CAAC,EACjE,GAAI,CAAC9xB,EACH,MAAM,IAAI,MAAM,sBAAsB8xB,CAAG,EAAE,EAC7C,MAAO,CACL,IAAK9xB,EAAM,CAAC,EACZ,MAAOA,EAAM,CAAC,EACd,QAAS,OAAOA,EAAM,CAAC,CAAC,CACzB,CACH,CAGA,IAAI,cAAgB,CAAE,EACtB,SAAS,cAAe,CACtB,oBAAqB,IAAM,oBAC3B,uBAAwB,IAAM,sBAChC,CAAC,EACD,SAAS,oBAAoBie,EAAG8T,EAASpe,EAAY,CACnD,MAAMqe,EAAgBD,EAAQ,KAAK,OAAQ/U,GAAQA,EAAI,QAAU,IAAMA,EAAI,CAAC,IAAM,KAAOA,EAAI,CAAC,IAAM,IAAI,EACxG,OAAO,cACL,CACE,GAAGiB,EACH,KAAM,SACN,KAAM,CAAC,GAAGA,EAAE,MAAQ,CAAE,EAAE,GAAG+T,EAAe,CAAC,IAAKD,EAAQ,EAAE,EAAG,CAAC,IAAKA,EAAQ,MAAM,CAAC,EAClF,QAAS9T,EAAE,SAAW,GACvB,EACDtK,CACD,CACH,CACA,SAAS,uBAAuBxV,EAAO,CACrC,GAAIA,EAAM,OAAS,SACjB,OAEF,IAAIszB,EACAC,EACJ,QAAShK,EAAKvpB,EAAM,KAAK,OAAS,EAAGupB,GAAM,IAAM+J,IAAa,QAAUC,IAAa,QAAShK,IAAM,CAClG,MAAM1K,EAAM7e,EAAM,KAAKupB,CAAE,EACrB1K,EAAI,QAAU,IACZA,EAAI,CAAC,IAAM,KAAOyU,IAAa,OACjCA,EAAWzU,EACFA,EAAI,CAAC,IAAM,KAAO0U,IAAa,SACxCA,EAAW1U,GAGnB,CACE,GAAI,EAAAyU,IAAa,QAAUC,IAAa,QAGxC,MAAO,CACL,GAAID,EAAS,CAAC,EACd,OAAQ,CAACA,EAAS,CAAC,EAAGC,EAAS,CAAC,CAAC,EAAE,OAAQzzB,GAAMA,IAAM,MAAM,EAC7D,OAAQyzB,EAAS,CAAC,CACnB,CACH,CAGA,IAAI,cAAgB,CAAE,EACtB,SAAS,cAAe,CACtB,MAAO,IAAM,MACf,CAAC,EACD,IAAI,YAAc,MACd,eAAiB,iBACrB,SAAU,OAAOO,EAAS,CACxB,MAAMC,EAAMD,EAAQ,OACpB,IAAIE,EAAY,EACZ32B,EAAQ,EACZ,KAAOA,EAAQ02B,GAAK,CAClB,IAAIhmB,EAAI+lB,EAAQ,QAAQ,IAAKz2B,CAAK,EAClC,GAAI0Q,IAAM,GACR,MAEF,GAAI+lB,EAAQ,UAAU/lB,EAAI,EAAGA,CAAC,IAAM,QAAS,CAC3C,MAAMxO,EAAIu0B,EAAQ,UAAU/lB,EAAI,EAAE,EAAE,MAAM,WAAW,EAC/CgT,EAAMxhB,EAAIwO,EAAI,GAAKxO,EAAE,MAAQw0B,EACnC,GAAI,CACF,IAAIN,EACA,CAAE,KAAAntB,EAAM,KAAApF,CAAI,EAAK,OAAO4yB,EAAQ,UAAU/lB,EAAI,EAAGgT,CAAG,CAAC,EACzD,OAAQ7f,EAAI,CACV,IAAK,OACHuyB,EAAU,CAAE,OAAQntB,CAAM,EAC1B,MACF,IAAK,OACL,IAAK,OACHjJ,EAAQ0jB,EAAM,EACd,SACF,QACE0S,EAAUntB,CACtB,CACY0tB,IAAcjmB,EAAI,IACpB,KAAM,CAAE,KAAM,OAAQ,KAAM+lB,EAAQ,UAAUE,EAAWjmB,EAAI,CAAC,CAAG,GAEnE,KAAM,CAAE,KAAM,YAAa,QAAA0lB,CAAS,EACpCp2B,EAAQ0jB,EACRiT,EAAY32B,EACZ,QACD,MAAc,CACbA,EAAQ0Q,EAAI,EACZ,QACR,CACK,SAAU+lB,EAAQ,UAAU/lB,EAAI,EAAGA,CAAC,IAAM,SAAW+lB,EAAQ,UAAU/lB,EAAI,EAAGA,CAAC,IAAM,OAAQ,CAC5F,MAAMxO,EAAIu0B,EAAQ,UAAU/lB,EAAI,CAAC,EAAE,MAAM,cAAc,EACjDgT,EAAMxhB,EAAIwO,EAAI,EAAIxO,EAAE,MAAQw0B,EAC5BE,EAAYH,EAAQ/lB,EAAI,CAAC,IAAM,IAAM,EAAI,EAC/C,GAAI,CACF,IAAI0b,EAAM,IAAI,IAAIqK,EAAQ,UAAU/lB,EAAIkmB,EAAWlT,CAAG,CAAC,EACvD,GAAI0I,EAAI,SAAS,QAAQ,GAAG,IAAM,GAChC,MAAM,IAAI,MAAM,aAAa,EAK/B,GAHIuK,IAAcjmB,EAAIkmB,IACpB,KAAM,CAAE,KAAM,OAAQ,KAAMH,EAAQ,UAAUE,EAAWjmB,EAAIkmB,CAAS,CAAG,GAEvExK,EAAI,SAAS,SAAS,MAAM,GAAKA,EAAI,SAAS,SAAS,MAAM,GAAKA,EAAI,SAAS,SAAS,OAAO,GAAKA,EAAI,SAAS,SAAS,MAAM,GAAKA,EAAI,SAAS,SAAS,OAAO,EAAG,CACvK,KAAM,CAAE,KAAM,QAAS,IAAKA,EAAI,SAAQ,CAAI,EAC5CpsB,EAAQ0jB,EACRiT,EAAY32B,EACZ,QACV,CACQ,GAAIosB,EAAI,SAAS,SAAS,MAAM,GAAKA,EAAI,SAAS,SAAS,MAAM,GAAKA,EAAI,SAAS,SAAS,OAAO,GAAKA,EAAI,SAAS,SAAS,MAAM,EAAG,CACrI,KAAM,CAAE,KAAM,QAAS,IAAKA,EAAI,SAAQ,CAAI,EAC5CpsB,EAAQ0jB,EACRiT,EAAY32B,EACZ,QACV,CACQ,GAAIosB,EAAI,SAAS,SAAS,MAAM,GAAKA,EAAI,SAAS,SAAS,MAAM,GAAKA,EAAI,SAAS,SAAS,MAAM,GAAKA,EAAI,SAAS,SAAS,OAAO,EAAG,CACrI,KAAM,CAAE,KAAM,QAAS,IAAKA,EAAI,SAAQ,CAAI,EAC5CpsB,EAAQ0jB,EACRiT,EAAY32B,EACZ,QACV,CACQ,KAAM,CAAE,KAAM,MAAO,IAAKosB,EAAI,SAAQ,CAAI,EAC1CpsB,EAAQ0jB,EACRiT,EAAY32B,EACZ,QACD,MAAc,CACbA,EAAQ0jB,EAAM,EACd,QACR,CACK,SAAU+S,EAAQ,UAAU/lB,EAAI,EAAGA,CAAC,IAAM,OAAS+lB,EAAQ,UAAU/lB,EAAI,EAAGA,CAAC,IAAM,KAAM,CACxF,MAAMxO,EAAIu0B,EAAQ,UAAU/lB,EAAI,CAAC,EAAE,MAAM,cAAc,EACjDgT,EAAMxhB,EAAIwO,EAAI,EAAIxO,EAAE,MAAQw0B,EAC5BE,EAAYH,EAAQ/lB,EAAI,CAAC,IAAM,IAAM,EAAI,EAC/C,GAAI,CACF,IAAI0b,EAAM,IAAI,IAAIqK,EAAQ,UAAU/lB,EAAIkmB,EAAWlT,CAAG,CAAC,EACvD,GAAI0I,EAAI,SAAS,QAAQ,GAAG,IAAM,GAChC,MAAM,IAAI,MAAM,gBAAgB,EAE9BuK,IAAcjmB,EAAIkmB,IACpB,KAAM,CAAE,KAAM,OAAQ,KAAMH,EAAQ,UAAUE,EAAWjmB,EAAIkmB,CAAS,CAAG,GAE3E,KAAM,CAAE,KAAM,QAAS,IAAKxK,EAAI,SAAQ,CAAI,EAC5CpsB,EAAQ0jB,EACRiT,EAAY32B,EACZ,QACD,MAAc,CACbA,EAAQ0jB,EAAM,EACd,QACR,CACA,KAAW,CACL1jB,EAAQ0Q,EAAI,EACZ,QACN,CACA,CACMimB,IAAcD,IAChB,KAAM,CAAE,KAAM,OAAQ,KAAMD,EAAQ,UAAUE,CAAS,CAAG,EAE9D,CAGA,IAAI,cAAgB,CAAE,EACtB,SAAS,cAAe,CACtB,mBAAoB,IAAM,mBAC1B,wBAAyB,IAAM,wBAC/B,oBAAqB,IAAM,oBAC3B,qBAAsB,IAAM,qBAC5B,qBAAsB,IAAM,oBAC9B,CAAC,EACD,IAAI,mBAAqB,CAAClU,EAAGtK,IAAe,CAC1C,IAAIse,EACJ,GAAI,OAAOhU,EAAE,SAAY,SACvBgU,EAAU,KAAK,UAAUhU,EAAE,OAAO,UACzB,OAAOA,EAAE,SAAY,SAC9BgU,EAAUhU,EAAE,YAEZ,QAEF,OAAO,cACL,CACE,KAAM,gBACN,KAAM,CAAC,GAAGA,EAAE,MAAQ,CAAA,CAAE,EACtB,QAAAgU,EACA,WAAYhU,EAAE,UACf,EACDtK,CACD,CACH,EACI,qBAAuB,CAACsK,EAAGtK,IAAe,CAC5C,IAAIse,EACJ,GAAI,OAAOhU,EAAE,SAAY,SACvBgU,EAAU,KAAK,UAAUhU,EAAE,OAAO,UACzB,OAAOA,EAAE,SAAY,SAC9BgU,EAAUhU,EAAE,YAEZ,QAEF,OAAO,cACL,CACE,KAAM,gBACN,KAAM,CAAC,CAAC,IAAKA,EAAE,uBAAuB,EAAG,GAAGA,EAAE,MAAQ,EAAE,EACxD,QAAAgU,EACA,WAAYhU,EAAE,UACf,EACDtK,CACD,CACH,EACI,oBAAsB,CAACsK,EAAGtK,IAAe,CAC3C,MAAM6d,EAAO,CAAC,CAAC,IAAKvT,EAAE,wBAAyBA,EAAE,UAAW,MAAM,CAAC,EACnE,OAAIA,EAAE,mCACJuT,EAAK,KAAK,CAAC,IAAKvT,EAAE,kCAAmCA,EAAE,UAAW,OAAO,CAAC,EAErE,cACL,CACE,KAAM,eACN,KAAM,CAAC,GAAGuT,EAAM,GAAGvT,EAAE,MAAQ,CAAA,CAAE,EAC/B,QAASA,EAAE,QACX,WAAYA,EAAE,UACf,EACDtK,CACD,CACH,EACI,wBAA0B,CAACsK,EAAGtK,IAAe,CAC/C,IAAIse,EACJ,GAAI,OAAOhU,EAAE,SAAY,SACvBgU,EAAU,KAAK,UAAUhU,EAAE,OAAO,UACzB,OAAOA,EAAE,SAAY,SAC9BgU,EAAUhU,EAAE,YAEZ,QAEF,OAAO,cACL,CACE,KAAM,mBACN,KAAM,CAAC,CAAC,IAAKA,EAAE,wBAAwB,EAAG,GAAGA,EAAE,MAAQ,EAAE,EACzD,QAAAgU,EACA,WAAYhU,EAAE,UACf,EACDtK,CACD,CACH,EACI,qBAAuB,CAACsK,EAAGtK,IAAe,CAC5C,IAAIse,EACJ,GAAI,OAAOhU,EAAE,SAAY,SACvBgU,EAAU,KAAK,UAAUhU,EAAE,OAAO,UACzB,OAAOA,EAAE,SAAY,SAC9BgU,EAAUhU,EAAE,YAEZ,QAEF,OAAO,cACL,CACE,KAAM,gBACN,KAAM,CAAC,CAAC,IAAKA,EAAE,cAAc,EAAG,GAAGA,EAAE,MAAQ,EAAE,EAC/C,QAAAgU,EACA,WAAYhU,EAAE,UACf,EACDtK,CACD,CACH,EAGI,cAAgB,CAAE,EACtB,SAAS,cAAe,CACtB,sBAAuB,IAAM,sBAC7B,SAAU,IAAM,SAChB,MAAO,IAAM,MACb,WAAY,IAAM,UACpB,CAAC,EACD,IAAI,sBAAwB,UACxB,MAAQ,IAAM,IAAI,OAAO,MAAM,sBAAsB,MAAM,MAAO,GAAG,EACzE,SAAU,SAASse,EAAS,CAC1B,MAAMI,EAAUJ,EAAQ,SAAS,MAAK,CAAE,EACxC,UAAWjyB,KAASqyB,EAClB,GAAI,CACF,KAAM,CAACC,EAAWjyB,CAAI,EAAIL,EAC1B,KAAM,CACJ,UAAAsyB,EACA,KAAAjyB,EACA,MAAOL,EAAM,MACb,IAAKA,EAAM,MAAQsyB,EAAU,MAC9B,CACF,MAAY,CACjB,CAEA,CACA,SAAS,WAAWL,EAASM,EAAU,CACrC,OAAON,EAAQ,WAAW,MAAO,EAAE,CAACK,EAAWjyB,IACtCkyB,EAAS,CACd,UAAAD,EACA,KAAAjyB,CACN,CAAK,CACF,CACH,CAGA,IAAI,cAAgB,CAAE,EACtB,SAAS,cAAe,CACtB,uBAAwB,IAAM,wBAC9B,eAAgB,IAAM,cACxB,CAAC,EACD,IAAI,QACJ,GAAI,CACF,QAAU,KACZ,MAAQ,CACR,CACA,SAAS,wBAAwB+sB,EAAqB,CACpD,QAAUA,CACZ,CACA,eAAe,eAAe/D,EAAQmJ,EAAUC,EAAO,CACrD,GAAI,CAEF,OADU,MAAO,MAAM,QAAQ,2BAA2BD,CAAQ,IAAIC,CAAK,MAAM,GAAG,KAAM,IAC3E,4DAA4DpJ,CAAM,EAClF,MAAW,CACV,MAAO,EACX,CACA,CAGA,IAAI,cAAgB,CAAE,EACtB,SAAS,cAAe,CACtB,oBAAqB,IAAM,oBAC3B,sBAAuB,IAAM,qBAC/B,CAAC,EACD,SAAS,sBAAsBqJ,EAAkB,CAC/C,KAAM,CAAE,SAAAC,EAAU,aAAAC,CAAc,EAAG,IAAI,IAAIF,CAAgB,EACrDrJ,EAASsJ,EACTjJ,EAAQkJ,EAAa,IAAI,OAAO,EAChCC,EAASD,EAAa,IAAI,QAAQ,EACxC,GAAI,CAACvJ,GAAU,CAACK,GAAS,CAACmJ,EACxB,MAAM,IAAI,MAAM,2BAA2B,EAE7C,MAAO,CAAE,OAAAxJ,EAAQ,MAAAK,EAAO,OAAAmJ,CAAQ,CAClC,CACA,eAAe,oBAAoBxJ,EAAQf,EAAWwK,EAAS,CAO7D,MAAMC,EAAmB,MAAM5Q,UAAQmG,EAAWe,EAAQ,KAAK,UAN/C,CACd,OAAQ,cACR,OAAQ,CACN,QAAAyJ,CACN,CACG,CAC+E,CAAC,EAC3EE,EAAgB,CACpB,KAAM,iBACN,WAAY,KAAK,MAAM,KAAK,IAAG,EAAK,GAAG,EACvC,QAASD,EACT,KAAM,CAAC,CAAC,IAAK1J,CAAM,CAAC,CACrB,EACD,OAAO,cAAc2J,EAAe1K,CAAS,CAC/C,CAGA,IAAI,cAAgB,CAAE,EACtB,SAAS,cAAe,CACtB,oBAAqB,IAAM,mBAC7B,CAAC,EACD,SAAS,oBAAoBjoB,EAAM,CACjC,OAAAA,EAAOA,EAAK,KAAM,EAAC,YAAa,EAChCA,EAAOA,EAAK,UAAU,MAAM,EACrB,MAAM,KAAKA,CAAI,EAAE,IAAK4yB,GACvB,WAAA,cAAA,GAAa,EAAC,KAAKA,CAAI,GAAK,WAAA,cAAA,GAAa,EAAC,KAAKA,CAAI,EAC9CA,EAEF,GACR,EAAE,KAAK,EAAE,CACZ,CAGG,IAAC,cAAgB,CAAA,EACpB,SAAS,cAAe,CACtB,eAAgB,IAAM,eACtB,eAAgB,IAAM,eACtB,eAAgB,IAAM,eACtB,uBAAwB,IAAM,wBAC9B,mBAAoB,IAAM,kBAC5B,CAAC,EAED,IAAI,QACJ,GAAI,CACF,QAAU,KACZ,MAAQ,CACR,CACA,SAAS,wBAAwB7F,EAAqB,CACpD,QAAUA,CACZ,CACA,eAAe,eAAe8F,EAAU,CACtC,GAAI,CACF,IAAIC,EAAQ,GACR,CAAE,MAAAC,EAAO,MAAAC,CAAO,EAAG,KAAK,MAAMH,EAAS,OAAO,EAClD,GAAIE,EAAO,CACT,GAAI,CAAE,MAAArT,CAAK,EAAKuT,SAAQ,OAAOF,EAAO,GAAG,EACrC3uB,EAAO6uB,SAAQ,UAAUvT,CAAK,EAClCoT,EAAQ,YAAY,OAAO1uB,CAAI,CAChC,SAAU4uB,EAAO,CAChB,GAAI,CAAChzB,EAAMgtB,CAAM,EAAIgG,EAAM,MAAM,GAAG,EACpCF,EAAQ,IAAI,IAAI,uBAAuB9yB,CAAI,GAAI,WAAWgtB,CAAM,EAAE,EAAE,SAAU,CACpF,KACM,QAAO,KAGT,IAAIkG,EAAO,MADD,MAAM,QAAQJ,CAAK,GACR,KAAM,EAC3B,GAAII,EAAK,aAAeA,EAAK,YAC3B,OAAOA,EAAK,QAEf,MAAa,CAChB,CACE,OAAO,IACT,CACA,SAAS,eAAe,CACtB,QAAAhH,EACA,MAAApuB,EACA,OAAAq1B,EACA,OAAA9I,EACA,QAAA+I,EAAU,EACZ,EAAG,CACD,GAAI,CAACD,EACH,MAAM,IAAI,MAAM,kBAAkB,EACpC,GAAI,CAACjH,EACH,MAAM,IAAI,MAAM,mBAAmB,EACrC,IAAImH,EAAK,CACP,KAAM,KACN,WAAY,KAAK,MAAM,KAAK,IAAG,EAAK,GAAG,EACvC,QAASD,EACT,KAAM,CACJ,CAAC,IAAKlH,CAAO,EACb,CAAC,SAAUiH,EAAO,UAAU,EAC5B,CAAC,SAAU,GAAG9I,CAAM,CAC1B,CACG,EAID,GAHIvsB,GAAS,OAAOA,GAAU,UAC5Bu1B,EAAG,KAAK,KAAK,CAAC,IAAKv1B,CAAK,CAAC,EAEvBA,GAAS,OAAOA,GAAU,UAC5B,GAAI,kBAAkBA,EAAM,IAAI,EAAG,CACjC,MAAM,EAAI,CAAC,IAAK,GAAGA,EAAM,IAAI,IAAIA,EAAM,MAAM,GAAG,EAChDu1B,EAAG,KAAK,KAAK,CAAC,CACf,SAAU,kBAAkBv1B,EAAM,IAAI,EAAG,CACxC,IAAIE,EAAIF,EAAM,KAAK,KAAK,CAAC,CAAC8f,EAAGpc,CAAC,IAAMoc,IAAM,KAAOpc,CAAC,EAClD,GAAI,CAACxD,EACH,MAAM,IAAI,MAAM,6BAA6B,EAC/C,MAAM5B,EAAI,CAAC,IAAK,GAAG0B,EAAM,IAAI,IAAIA,EAAM,MAAM,IAAIE,EAAE,CAAC,CAAC,EAAE,EACvDq1B,EAAG,KAAK,KAAKj3B,CAAC,CACpB,EAEE,OAAOi3B,CACT,CACA,SAAS,mBAAmBC,EAAkB,CAC5C,IAAIC,EACJ,GAAI,CACFA,EAAa,KAAK,MAAMD,CAAgB,CACzC,MAAa,CACZ,MAAO,2BACX,CACE,GAAI,CAAC,cAAcC,CAAU,EAC3B,MAAO,0CACT,GAAI,CAAC,YAAYA,CAAU,EACzB,MAAO,oCACT,IAAI51B,EAAI41B,EAAW,KAAK,KAAK,CAAC,CAAC3V,EAAGpc,CAAC,IAAMoc,IAAM,KAAOpc,CAAC,EACvD,GAAI,CAAC7D,EACH,MAAO,sCACT,GAAI,CAACA,EAAE,CAAC,EAAE,MAAM,gBAAgB,EAC9B,MAAO,wCACT,IAAIM,EAAIs1B,EAAW,KAAK,KAAK,CAAC,CAAC3V,EAAGpc,CAAC,IAAMoc,IAAM,KAAOpc,CAAC,EACvD,OAAIvD,GAAK,CAACA,EAAE,CAAC,EAAE,MAAM,gBAAgB,EAC5B,wCACIs1B,EAAW,KAAK,KAAK,CAAC,CAAC3V,EAAGpc,CAAC,IAAMoc,IAAM,UAAYpc,CAAC,EAG1D,KADE,0CAEX,CACA,SAAS,eAAe,CACtB,WAAA+xB,EACA,SAAAC,EACA,OAAAC,EACA,OAAAC,CACF,EAAG,CACD,IAAIL,EAAK,KAAK,MAAME,CAAU,EAC1BI,EAAqBN,EAAG,KAAK,OAAO,CAAC,CAACzV,CAAC,IAAMA,IAAM,KAAOA,IAAM,KAAOA,IAAM,GAAG,EAChFgW,EAAM,CACR,KAAM,KACN,WAAY,KAAK,MAAMF,EAAO,QAAO,EAAK,GAAG,EAC7C,QAAS,GACT,KAAM,CAAC,GAAGC,EAAoB,CAAC,IAAKN,EAAG,MAAM,EAAG,CAAC,SAAUI,CAAM,EAAG,CAAC,cAAeF,CAAU,CAAC,CAChG,EACD,OAAIC,GACFI,EAAI,KAAK,KAAK,CAAC,WAAYJ,CAAQ,CAAC,EAE/BI,CACT,CAGA,IAAI,cAAgB,CAAE,EACtB,SAAS,cAAe,CACtB,SAAU,IAAM,SAChB,YAAa,IAAM,YACnB,qBAAsB,IAAM,qBAC5B,cAAe,IAAM,eACrB,kBAAmB,IAAM,kBACzB,uBAAwB,IAAM,uBAC9B,wBAAyB,IAAM,wBAC/B,uBAAwB,IAAM,uBAC9B,oBAAqB,IAAM,oBAC3B,cAAe,IAAM,aACvB,CAAC,EAID,IAAI,qBAAuB,SAC3B,eAAe,SAASC,EAAUC,EAAYta,EAAMua,EAA6B,GAAOhK,EAAS,CAC/F,MAAMjsB,EAAQ,CACZ,KAAM,SACN,KAAM,CACJ,CAAC,IAAK+1B,CAAQ,EACd,CAAC,SAAUC,CAAU,CACtB,EACD,WAAY,KAAK,MAAM,IAAI,KAAI,EAAG,QAAS,EAAG,GAAG,EACjD,QAAS,EACV,EACG/J,GACFjsB,EAAM,KAAK,KAAK,CAAC,UAAW,YAAYisB,CAAO,CAAC,CAAC,EAEnD,MAAMiK,EAAc,MAAMxa,EAAK1b,CAAK,EAEpC,OAD4Bi2B,EAA6B,qBAAuB,IACnDE,OAAQ,OAAO,YAAY,OAAO,KAAK,UAAUD,CAAW,CAAC,CAAC,CAC7F,CACA,eAAe,cAAcE,EAAO3M,EAAK4M,EAAQ,CAC/C,MAAMr2B,EAAQ,MAAM,qBAAqBo2B,CAAK,EAAE,MAAOjxB,GAAU,CAC/D,MAAMA,CACV,CAAG,EAID,OAHc,MAAM,eAAenF,EAAOypB,EAAK4M,CAAM,EAAE,MAAOlxB,GAAU,CACtE,MAAMA,CACV,CAAG,CAEH,CACA,eAAe,qBAAqBixB,EAAO,CACzC,GAAI,CAACA,EACH,MAAM,IAAI,MAAM,eAAe,EAEjCA,EAAQA,EAAM,QAAQ,qBAAsB,EAAE,EAC9C,MAAME,EAAW,YAAY,OAAOH,OAAQ,OAAOC,CAAK,CAAC,EACzD,GAAI,CAACE,GAAYA,EAAS,SAAW,GAAK,CAACA,EAAS,WAAW,GAAG,EAChE,MAAM,IAAI,MAAM,eAAe,EAGjC,OADc,KAAK,MAAMA,CAAQ,CAEnC,CACA,SAAS,uBAAuBt2B,EAAO,CACrC,OAAKA,EAAM,WAGJ,KAAK,MAAM,IAAI,KAAM,EAAC,QAAS,EAAG,GAAG,EAAIA,EAAM,WAAa,GAF1D,EAGX,CACA,SAAS,kBAAkBA,EAAO,CAChC,OAAOA,EAAM,OAAS,QACxB,CACA,SAAS,oBAAoBA,EAAOypB,EAAK,CACvC,MAAM8M,EAASv2B,EAAM,KAAK,KAAM8f,GAAMA,EAAE,CAAC,IAAM,GAAG,EAClD,OAAKyW,EAGEA,EAAO,OAAS,GAAKA,EAAO,CAAC,IAAM9M,EAFjC,EAGX,CACA,SAAS,uBAAuBzpB,EAAOq2B,EAAQ,CAC7C,MAAMG,EAAYx2B,EAAM,KAAK,KAAM8f,GAAMA,EAAE,CAAC,IAAM,QAAQ,EAC1D,OAAK0W,EAGEA,EAAU,OAAS,GAAKA,EAAU,CAAC,EAAE,YAAW,IAAOH,EAAO,YAAa,EAFzE,EAGX,CACA,SAAS,YAAYpK,EAAS,CAC5B,MAAMnpB,EAAO2zB,SAAQ,YAAY,OAAO,KAAK,UAAUxK,CAAO,CAAC,CAAC,EAChE,OAAOyK,aAAY5zB,CAAI,CACzB,CACA,SAAS,wBAAwB9C,EAAOisB,EAAS,CAC/C,MAAM0K,EAAa32B,EAAM,KAAK,KAAM8f,GAAMA,EAAE,CAAC,IAAM,SAAS,EAC5D,GAAI,CAAC6W,EACH,MAAO,GAET,MAAMC,EAAc,YAAY3K,CAAO,EACvC,OAAO0K,EAAW,OAAS,GAAKA,EAAW,CAAC,IAAMC,CACpD,CACA,eAAe,eAAe52B,EAAOypB,EAAK4M,EAAQjB,EAAM,CACtD,GAAI,CAAC,YAAYp1B,CAAK,EACpB,MAAM,IAAI,MAAM,wCAAwC,EAE1D,GAAI,CAAC,kBAAkBA,CAAK,EAC1B,MAAM,IAAI,MAAM,mCAAmC,EAErD,GAAI,CAAC,uBAAuBA,CAAK,EAC/B,MAAM,IAAI,MAAM,mDAAmD,EAErE,GAAI,CAAC,oBAAoBA,EAAOypB,CAAG,EACjC,MAAM,IAAI,MAAM,sCAAsC,EAExD,GAAI,CAAC,uBAAuBzpB,EAAOq2B,CAAM,EACvC,MAAM,IAAI,MAAM,yCAAyC,EAE3D,GAAYjB,GAAS,OAAOA,GAAS,UAAY,OAAO,KAAKA,CAAI,EAAE,OAAS,GACtE,CAAC,wBAAwBp1B,EAAOo1B,CAAI,EACtC,MAAM,IAAI,MAAM,mEAAmE,EAGvF,MAAO,EACT,+uBC9nFA,SAAS,QAAQ,EAAG,CAChB,GAAI,CAAC,OAAO,cAAc,CAAC,GAAK,EAAI,EAChC,MAAM,IAAI,MAAM,kCAAoC,CAAC,CAC7D,CAEA,SAASxS,UAAQtkB,EAAG,CAChB,OAAOA,aAAa,YAAe,YAAY,OAAOA,CAAC,GAAKA,EAAE,YAAY,OAAS,YACvF,CAEA,SAASklB,SAAOjlB,KAAM+G,EAAS,CAC3B,GAAI,CAACsd,UAAQrkB,CAAC,EACV,MAAM,IAAI,MAAM,qBAAqB,EACzC,GAAI+G,EAAQ,OAAS,GAAK,CAACA,EAAQ,SAAS/G,EAAE,MAAM,EAChD,MAAM,IAAI,MAAM,iCAAmC+G,EAAU,gBAAkB/G,EAAE,MAAM,CAC/F,CAEA,SAAS,MAAM6C,EAAG,CACd,GAAI,OAAOA,GAAM,YAAc,OAAOA,EAAE,QAAW,WAC/C,MAAM,IAAI,MAAM,iDAAiD,EACrE,QAAQA,EAAE,SAAS,EACnB,QAAQA,EAAE,QAAQ,CACtB,CAEA,SAAS,QAAQoE,EAAUC,EAAgB,GAAM,CAC7C,GAAID,EAAS,UACT,MAAM,IAAI,MAAM,kCAAkC,EACtD,GAAIC,GAAiBD,EAAS,SAC1B,MAAM,IAAI,MAAM,uCAAuC,CAC/D,CAEA,SAAS,QAAQG,EAAKH,EAAU,CAC5Bge,SAAO7d,CAAG,EACV,MAAMC,EAAMJ,EAAS,UACrB,GAAIG,EAAI,OAASC,EACb,MAAM,IAAI,MAAM,yDAA2DA,CAAG,CAEtF,CCzCO,MAAM,OAAS,OAAO,YAAe,UAAY,WAAY,WAAa,WAAW,OAAS,OCIrG,sEAsBO,SAAS,WAAWxI,EAAK,CAC5B,OAAO,IAAI,SAASA,EAAI,OAAQA,EAAI,WAAYA,EAAI,UAAU,CAClE,CAEO,SAAS,KAAK6I,EAAMC,EAAO,CAC9B,OAAQD,GAAS,GAAKC,EAAWD,IAASC,CAC9C,CAyBA,MAAMkE,QAAwB,MAAM,KAAK,CAAE,OAAQ,GAAK,EAAE,CAACC,EAAG7M,IAAMA,EAAE,SAAS,EAAE,EAAE,SAAS,EAAG,GAAG,CAAC,EAK5F,SAAS8M,aAAWjF,EAAO,CAC9Bme,SAAOne,CAAK,EAEZ,IAAIkF,EAAM,GACV,QAAS/M,EAAI,EAAGA,EAAI6H,EAAM,OAAQ7H,IAC9B+M,GAAOH,QAAM/E,EAAM7H,CAAC,CAAC,EAEzB,OAAO+M,CACX,CAEA,MAAMssB,SAAS,CAAE,GAAI,GAAI,GAAI,GAAI,EAAG,GAAI,EAAG,GAAI,EAAG,GAAI,EAAG,GAAK,EAC9D,SAASC,gBAAczL,EAAI,CACvB,GAAIA,GAAMwL,SAAO,IAAMxL,GAAMwL,SAAO,GAChC,OAAOxL,EAAKwL,SAAO,GACvB,GAAIxL,GAAMwL,SAAO,GAAKxL,GAAMwL,SAAO,EAC/B,OAAOxL,GAAMwL,SAAO,EAAI,IAC5B,GAAIxL,GAAMwL,SAAO,GAAKxL,GAAMwL,SAAO,EAC/B,OAAOxL,GAAMwL,SAAO,EAAI,GAEhC,CAKO,SAASlsB,aAAWJ,EAAK,CAC5B,GAAI,OAAOA,GAAQ,SACf,MAAM,IAAI,MAAM,4BAA8B,OAAOA,CAAG,EAC5D,MAAMwsB,EAAKxsB,EAAI,OACTysB,EAAKD,EAAK,EAChB,GAAIA,EAAK,EACL,MAAM,IAAI,MAAM,mDAAqDA,CAAE,EAC3E,MAAMnsB,EAAQ,IAAI,WAAWosB,CAAE,EAC/B,QAASC,EAAK,EAAGC,EAAK,EAAGD,EAAKD,EAAIC,IAAMC,GAAM,EAAG,CAC7C,MAAMC,EAAKL,gBAAcvsB,EAAI,WAAW2sB,CAAE,CAAC,EACrCloB,EAAK8nB,gBAAcvsB,EAAI,WAAW2sB,EAAK,CAAC,CAAC,EAC/C,GAAIC,IAAO,QAAanoB,IAAO,OAAW,CACtC,MAAM8lB,EAAOvqB,EAAI2sB,CAAE,EAAI3sB,EAAI2sB,EAAK,CAAC,EACjC,MAAM,IAAI,MAAM,+CAAiDpC,EAAO,cAAgBoC,CAAE,CACtG,CACQtsB,EAAMqsB,CAAE,EAAIE,EAAK,GAAKnoB,CAC9B,CACI,OAAOpE,CACX,CAwBO,SAASxE,cAAYxE,EAAK,CAC7B,GAAI,OAAOA,GAAQ,SACf,MAAM,IAAI,MAAM,oCAAsC,OAAOA,CAAG,EACpE,OAAO,IAAI,WAAW,IAAI,YAAa,EAAC,OAAOA,CAAG,CAAC,CACvD,CAMO,SAAS,QAAQ0E,EAAM,CAC1B,OAAI,OAAOA,GAAS,WAChBA,EAAOF,cAAYE,CAAI,GAC3Bkd,SAAOld,CAAI,EACJA,CACX,CAIO,SAASC,iBAAeC,EAAQ,CACnC,IAAIC,EAAM,EACV,QAASjJ,EAAI,EAAGA,EAAIgJ,EAAO,OAAQhJ,IAAK,CACpC,MAAMc,EAAIkI,EAAOhJ,CAAC,EAClBgmB,SAAOllB,CAAC,EACRmI,GAAOnI,EAAE,MACjB,CACI,MAAM+J,EAAM,IAAI,WAAW5B,CAAG,EAC9B,QAASjJ,EAAI,EAAGkJ,EAAM,EAAGlJ,EAAIgJ,EAAO,OAAQhJ,IAAK,CAC7C,MAAMc,EAAIkI,EAAOhJ,CAAC,EAClB6K,EAAI,IAAI/J,EAAGoI,CAAG,EACdA,GAAOpI,EAAE,MACjB,CACI,OAAO+J,CACX,CAEO,MAAM,IAAK,CAEd,OAAQ,CACJ,OAAO,KAAK,WAAY,CAChC,CACA,CAQO,SAAS,gBAAgBzB,EAAU,CACtC,MAAMC,EAASC,GAAQF,EAAU,EAAC,OAAO,QAAQE,CAAG,CAAC,EAAE,OAAQ,EACzDC,EAAMH,EAAU,EACtB,OAAAC,EAAM,UAAYE,EAAI,UACtBF,EAAM,SAAWE,EAAI,SACrBF,EAAM,OAAS,IAAMD,EAAU,EACxBC,CACX,CAkBO,SAAS,YAAYI,EAAc,GAAI,CAC1C,GAAI,QAAU,OAAO,OAAO,iBAAoB,WAC5C,OAAO,OAAO,gBAAgB,IAAI,WAAWA,CAAW,CAAC,EAG7D,GAAI,QAAU,OAAO,OAAO,aAAgB,WACxC,OAAO,OAAO,YAAYA,CAAW,EAEzC,MAAM,IAAI,MAAM,wCAAwC,CAC5D,CC3MO,SAAS,aAAaE,EAAMC,EAAYC,EAAOlB,EAAM,CACxD,GAAI,OAAOgB,EAAK,cAAiB,WAC7B,OAAOA,EAAK,aAAaC,EAAYC,EAAOlB,CAAI,EACpD,MAAMmB,EAAO,OAAO,EAAE,EAChBC,EAAW,OAAO,UAAU,EAC5BC,EAAK,OAAQH,GAASC,EAAQC,CAAQ,EACtCE,EAAK,OAAOJ,EAAQE,CAAQ,EAC5BnG,EAAI+E,EAAO,EAAI,EACflI,EAAIkI,EAAO,EAAI,EACrBgB,EAAK,UAAUC,EAAahG,EAAGoG,EAAIrB,CAAI,EACvCgB,EAAK,UAAUC,EAAanJ,EAAGwJ,EAAItB,CAAI,CAC3C,CAEO,SAAS,IAAI7H,EAAGC,EAAG0B,EAAG,CACzB,OAAQ3B,EAAIC,EAAM,CAACD,EAAI2B,CAC3B,CAEO,SAAS,IAAI3B,EAAGC,EAAG0B,EAAG,CACzB,OAAQ3B,EAAIC,EAAMD,EAAI2B,EAAM1B,EAAI0B,CACpC,CAKO,MAAM,eAAe,IAAK,CAC7B,YAAY0H,EAAUC,EAAWC,EAAW1B,EAAM,CAC9C,MAAO,EACP,KAAK,SAAWwB,EAChB,KAAK,UAAYC,EACjB,KAAK,UAAYC,EACjB,KAAK,KAAO1B,EACZ,KAAK,SAAW,GAChB,KAAK,OAAS,EACd,KAAK,IAAM,EACX,KAAK,UAAY,GACjB,KAAK,OAAS,IAAI,WAAWwB,CAAQ,EACrC,KAAK,KAAO,WAAW,KAAK,MAAM,CAC1C,CACI,OAAOrB,EAAM,CACT,QAAQ,IAAI,EACZ,KAAM,CAAE,KAAAa,EAAM,OAAAW,EAAQ,SAAAH,CAAU,EAAG,KACnCrB,EAAO,QAAQA,CAAI,EACnB,MAAM9H,EAAM8H,EAAK,OACjB,QAASyB,EAAM,EAAGA,EAAMvJ,GAAM,CAC1B,MAAMwJ,EAAO,KAAK,IAAIL,EAAW,KAAK,IAAKnJ,EAAMuJ,CAAG,EAEpD,GAAIC,IAASL,EAAU,CACnB,MAAMM,EAAW,WAAW3B,CAAI,EAChC,KAAOqB,GAAYnJ,EAAMuJ,EAAKA,GAAOJ,EACjC,KAAK,QAAQM,EAAUF,CAAG,EAC9B,QAChB,CACYD,EAAO,IAAIxB,EAAK,SAASyB,EAAKA,EAAMC,CAAI,EAAG,KAAK,GAAG,EACnD,KAAK,KAAOA,EACZD,GAAOC,EACH,KAAK,MAAQL,IACb,KAAK,QAAQR,EAAM,CAAC,EACpB,KAAK,IAAM,EAE3B,CACQ,YAAK,QAAUb,EAAK,OACpB,KAAK,WAAY,EACV,IACf,CACI,WAAWX,EAAK,CACZ,QAAQ,IAAI,EACZ,QAAQA,EAAK,IAAI,EACjB,KAAK,SAAW,GAIhB,KAAM,CAAE,OAAAmC,EAAQ,KAAAX,EAAM,SAAAQ,EAAU,KAAAxB,CAAM,EAAG,KACzC,GAAI,CAAE,IAAA4B,CAAG,EAAK,KAEdD,EAAOC,GAAK,EAAI,IAChB,KAAK,OAAO,SAASA,CAAG,EAAE,KAAK,CAAC,EAG5B,KAAK,UAAYJ,EAAWI,IAC5B,KAAK,QAAQZ,EAAM,CAAC,EACpBY,EAAM,GAGV,QAASvK,EAAIuK,EAAKvK,EAAImK,EAAUnK,IAC5BsK,EAAOtK,CAAC,EAAI,EAIhB,aAAa2J,EAAMQ,EAAW,EAAG,OAAO,KAAK,OAAS,CAAC,EAAGxB,CAAI,EAC9D,KAAK,QAAQgB,EAAM,CAAC,EACpB,MAAMe,EAAQ,WAAWvC,CAAG,EACtBnH,EAAM,KAAK,UAEjB,GAAIA,EAAM,EACN,MAAM,IAAI,MAAM,6CAA6C,EACjE,MAAM2J,EAAS3J,EAAM,EACf4J,EAAQ,KAAK,IAAK,EACxB,GAAID,EAASC,EAAM,OACf,MAAM,IAAI,MAAM,oCAAoC,EACxD,QAAS5K,EAAI,EAAGA,EAAI2K,EAAQ3K,IACxB0K,EAAM,UAAU,EAAI1K,EAAG4K,EAAM5K,CAAC,EAAG2I,CAAI,CACjD,CACI,QAAS,CACL,KAAM,CAAE,OAAA2B,EAAQ,UAAAF,CAAS,EAAK,KAC9B,KAAK,WAAWE,CAAM,EACtB,MAAMO,EAAMP,EAAO,MAAM,EAAGF,CAAS,EACrC,YAAK,QAAS,EACPS,CACf,CACI,WAAWvK,EAAI,CACXA,IAAOA,EAAK,IAAI,KAAK,aACrBA,EAAG,IAAI,GAAG,KAAK,IAAG,CAAE,EACpB,KAAM,CAAE,SAAA6J,EAAU,OAAAG,EAAQ,OAAAQ,EAAQ,SAAAC,EAAU,UAAAC,EAAW,IAAAT,CAAG,EAAK,KAC/D,OAAAjK,EAAG,OAASwK,EACZxK,EAAG,IAAMiK,EACTjK,EAAG,SAAWyK,EACdzK,EAAG,UAAY0K,EACXF,EAASX,GACT7J,EAAG,OAAO,IAAIgK,CAAM,EACjBhK,CACf,CACA,CCnHA,MAAM,SAA2B,IAAI,YAAY,CAC7C,WAAY,WAAY,WAAY,WAAY,UAAY,WAAY,WAAY,WACpF,WAAY,UAAY,UAAY,WAAY,WAAY,WAAY,WAAY,WACpF,WAAY,WAAY,UAAY,UAAY,UAAY,WAAY,WAAY,WACpF,WAAY,WAAY,WAAY,WAAY,WAAY,WAAY,UAAY,UACpF,UAAY,UAAY,WAAY,WAAY,WAAY,WAAY,WAAY,WACpF,WAAY,WAAY,WAAY,WAAY,WAAY,WAAY,WAAY,UACpF,UAAY,UAAY,UAAY,UAAY,UAAY,WAAY,WAAY,WACpF,WAAY,WAAY,WAAY,WAAY,WAAY,WAAY,WAAY,UACxF,CAAC,EAGK,UAA4B,IAAI,YAAY,CAC9C,WAAY,WAAY,WAAY,WAAY,WAAY,WAAY,UAAY,UACxF,CAAC,EAKK,SAA2B,IAAI,YAAY,EAAE,EAC5C,MAAM,eAAe,MAAO,CAC/B,aAAc,CACV,MAAM,GAAI,GAAI,EAAG,EAAK,EAGtB,KAAK,EAAI,UAAU,CAAC,EAAI,EACxB,KAAK,EAAI,UAAU,CAAC,EAAI,EACxB,KAAK,EAAI,UAAU,CAAC,EAAI,EACxB,KAAK,EAAI,UAAU,CAAC,EAAI,EACxB,KAAK,EAAI,UAAU,CAAC,EAAI,EACxB,KAAK,EAAI,UAAU,CAAC,EAAI,EACxB,KAAK,EAAI,UAAU,CAAC,EAAI,EACxB,KAAK,EAAI,UAAU,CAAC,EAAI,CAChC,CACI,KAAM,CACF,KAAM,CAAE,EAAAiL,EAAG,EAAAC,EAAG,EAAAC,EAAG,EAAAC,EAAG,EAAAC,EAAG,EAAAC,EAAG,EAAAC,EAAG,EAAAC,CAAC,EAAK,KACnC,MAAO,CAACP,EAAGC,EAAGC,EAAGC,EAAGC,EAAGC,EAAGC,EAAGC,CAAC,CACtC,CAEI,IAAIP,EAAGC,EAAGC,EAAGC,EAAGC,EAAGC,EAAGC,EAAGC,EAAG,CACxB,KAAK,EAAIP,EAAI,EACb,KAAK,EAAIC,EAAI,EACb,KAAK,EAAIC,EAAI,EACb,KAAK,EAAIC,EAAI,EACb,KAAK,EAAIC,EAAI,EACb,KAAK,EAAIC,EAAI,EACb,KAAK,EAAIC,EAAI,EACb,KAAK,EAAIC,EAAI,CACrB,CACI,QAAQnC,EAAMoC,EAAQ,CAElB,QAAS/L,EAAI,EAAGA,EAAI,GAAIA,IAAK+L,GAAU,EACnC,SAAS/L,CAAC,EAAI2J,EAAK,UAAUoC,EAAQ,EAAK,EAC9C,QAAS/L,EAAI,GAAIA,EAAI,GAAIA,IAAK,CAC1B,MAAMgM,EAAM,SAAShM,EAAI,EAAE,EACrBiM,EAAK,SAASjM,EAAI,CAAC,EACnBkM,EAAK,KAAKF,EAAK,CAAC,EAAI,KAAKA,EAAK,EAAE,EAAKA,IAAQ,EAC7CG,EAAK,KAAKF,EAAI,EAAE,EAAI,KAAKA,EAAI,EAAE,EAAKA,IAAO,GACjD,SAASjM,CAAC,EAAKmM,EAAK,SAASnM,EAAI,CAAC,EAAIkM,EAAK,SAASlM,EAAI,EAAE,EAAK,CAC3E,CAEQ,GAAI,CAAE,EAAAuL,EAAG,EAAAC,EAAG,EAAAC,EAAG,EAAAC,EAAG,EAAAC,EAAG,EAAAC,EAAG,EAAAC,EAAG,EAAAC,CAAC,EAAK,KACjC,QAAS9L,EAAI,EAAGA,EAAI,GAAIA,IAAK,CACzB,MAAMoM,EAAS,KAAKT,EAAG,CAAC,EAAI,KAAKA,EAAG,EAAE,EAAI,KAAKA,EAAG,EAAE,EAC9CU,EAAMP,EAAIM,EAAS,IAAIT,EAAGC,EAAGC,CAAC,EAAI,SAAS7L,CAAC,EAAI,SAASA,CAAC,EAAK,EAE/DsM,GADS,KAAKf,EAAG,CAAC,EAAI,KAAKA,EAAG,EAAE,EAAI,KAAKA,EAAG,EAAE,GAC/B,IAAIA,EAAGC,EAAGC,CAAC,EAAK,EACrCK,EAAID,EACJA,EAAID,EACJA,EAAID,EACJA,EAAKD,EAAIW,EAAM,EACfX,EAAID,EACJA,EAAID,EACJA,EAAID,EACJA,EAAKc,EAAKC,EAAM,CAC5B,CAEQf,EAAKA,EAAI,KAAK,EAAK,EACnBC,EAAKA,EAAI,KAAK,EAAK,EACnBC,EAAKA,EAAI,KAAK,EAAK,EACnBC,EAAKA,EAAI,KAAK,EAAK,EACnBC,EAAKA,EAAI,KAAK,EAAK,EACnBC,EAAKA,EAAI,KAAK,EAAK,EACnBC,EAAKA,EAAI,KAAK,EAAK,EACnBC,EAAKA,EAAI,KAAK,EAAK,EACnB,KAAK,IAAIP,EAAGC,EAAGC,EAAGC,EAAGC,EAAGC,EAAGC,EAAGC,CAAC,CACvC,CACI,YAAa,CACT,SAAS,KAAK,CAAC,CACvB,CACI,SAAU,CACN,KAAK,IAAI,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,CAAC,EAC/B,KAAK,OAAO,KAAK,CAAC,CAC1B,CACA,CAmBO,MAAM,OAAyB,gBAAgB,IAAM,IAAI,MAAQ,ECxHjE,MAAM,aAAa,IAAK,CAC3B,YAAYxG,EAAMsZ,EAAM,CACpB,MAAO,EACP,KAAK,SAAW,GAChB,KAAK,UAAY,GACjB,MAAMtZ,CAAI,EACV,MAAMH,EAAM,QAAQyZ,CAAI,EAExB,GADA,KAAK,MAAQtZ,EAAK,OAAQ,EACtB,OAAO,KAAK,MAAM,QAAW,WAC7B,MAAM,IAAI,MAAM,qDAAqD,EACzE,KAAK,SAAW,KAAK,MAAM,SAC3B,KAAK,UAAY,KAAK,MAAM,UAC5B,MAAM6E,EAAW,KAAK,SAChBjB,EAAM,IAAI,WAAWiB,CAAQ,EAEnCjB,EAAI,IAAI/D,EAAI,OAASgF,EAAW7E,EAAK,OAAQ,EAAC,OAAOH,CAAG,EAAE,OAAM,EAAKA,CAAG,EACxE,QAASnF,EAAI,EAAGA,EAAIkJ,EAAI,OAAQlJ,IAC5BkJ,EAAIlJ,CAAC,GAAK,GACd,KAAK,MAAM,OAAOkJ,CAAG,EAErB,KAAK,MAAQ5D,EAAK,OAAQ,EAE1B,QAAStF,EAAI,EAAGA,EAAIkJ,EAAI,OAAQlJ,IAC5BkJ,EAAIlJ,CAAC,GAAK,IACd,KAAK,MAAM,OAAOkJ,CAAG,EACrBA,EAAI,KAAK,CAAC,CAClB,CACI,OAAO4V,EAAK,CACR,eAAQ,IAAI,EACZ,KAAK,MAAM,OAAOA,CAAG,EACd,IACf,CACI,WAAW3W,EAAK,CACZ,QAAQ,IAAI,EACZ6d,SAAO7d,EAAK,KAAK,SAAS,EAC1B,KAAK,SAAW,GAChB,KAAK,MAAM,WAAWA,CAAG,EACzB,KAAK,MAAM,OAAOA,CAAG,EACrB,KAAK,MAAM,WAAWA,CAAG,EACzB,KAAK,QAAS,CACtB,CACI,QAAS,CACL,MAAMA,EAAM,IAAI,WAAW,KAAK,MAAM,SAAS,EAC/C,YAAK,WAAWA,CAAG,EACZA,CACf,CACI,WAAW7H,EAAI,CAEXA,IAAOA,EAAK,OAAO,OAAO,OAAO,eAAe,IAAI,EAAG,CAAA,CAAE,GACzD,KAAM,CAAE,MAAA2e,EAAO,MAAAC,EAAO,SAAAnU,EAAU,UAAAC,EAAW,SAAAb,EAAU,UAAAC,CAAS,EAAK,KACnE,OAAA9J,EAAKA,EACLA,EAAG,SAAWyK,EACdzK,EAAG,UAAY0K,EACf1K,EAAG,SAAW6J,EACd7J,EAAG,UAAY8J,EACf9J,EAAG,MAAQ2e,EAAM,WAAW3e,EAAG,KAAK,EACpCA,EAAG,MAAQ4e,EAAM,WAAW5e,EAAG,KAAK,EAC7BA,CACf,CACI,SAAU,CACN,KAAK,UAAY,GACjB,KAAK,MAAM,QAAS,EACpB,KAAK,MAAM,QAAS,CAC5B,CACA,CAWO,MAAM,KAAO,CAACgF,EAAMH,EAAKia,IAAY,IAAI,KAAK9Z,EAAMH,CAAG,EAAE,OAAOia,CAAO,EAAE,OAAQ,EACxF,KAAK,OAAS,CAAC9Z,EAAMH,IAAQ,IAAI,KAAKG,EAAMH,CAAG,EC9E/C,sEAKA,MAAMsH,MAAsB,OAAO,CAAC,EAC9BC,MAAsB,OAAO,CAAC,EAC9BC,MAAsB,OAAO,CAAC,EAC7B,SAAS,QAAQ7L,EAAG,CACvB,OAAOA,aAAa,YAAe,YAAY,OAAOA,CAAC,GAAKA,EAAE,YAAY,OAAS,YACvF,CACO,SAAS,OAAOkT,EAAM,CACzB,GAAI,CAAC,QAAQA,CAAI,EACb,MAAM,IAAI,MAAM,qBAAqB,CAC7C,CACO,SAAS,MAAMlG,EAAOjE,EAAO,CAChC,GAAI,OAAOA,GAAU,UACjB,MAAM,IAAI,MAAMiE,EAAQ,0BAA4BjE,CAAK,CACjE,CAEA,MAAM,MAAwB,MAAM,KAAK,CAAE,OAAQ,GAAK,EAAE,CAACgD,EAAG7M,IAAMA,EAAE,SAAS,EAAE,EAAE,SAAS,EAAG,GAAG,CAAC,EAI5F,SAAS,WAAW6H,EAAO,CAC9B,OAAOA,CAAK,EAEZ,IAAIkF,EAAM,GACV,QAAS/M,EAAI,EAAGA,EAAI6H,EAAM,OAAQ7H,IAC9B+M,GAAO,MAAMlF,EAAM7H,CAAC,CAAC,EAEzB,OAAO+M,CACX,CACO,SAAS,oBAAoBE,EAAK,CACrC,MAAMF,EAAME,EAAI,SAAS,EAAE,EAC3B,OAAOF,EAAI,OAAS,EAAI,IAAMA,EAAMA,CACxC,CACO,SAAS,YAAYA,EAAK,CAC7B,GAAI,OAAOA,GAAQ,SACf,MAAM,IAAI,MAAM,4BAA8B,OAAOA,CAAG,EAC5D,OAAOA,IAAQ,GAAKN,MAAM,OAAO,KAAOM,CAAG,CAC/C,CAEA,MAAM,OAAS,CAAE,GAAI,GAAI,GAAI,GAAI,EAAG,GAAI,EAAG,GAAI,EAAG,GAAI,EAAG,GAAK,EAC9D,SAAS,cAAc8gB,EAAI,CACvB,GAAIA,GAAM,OAAO,IAAMA,GAAM,OAAO,GAChC,OAAOA,EAAK,OAAO,GACvB,GAAIA,GAAM,OAAO,GAAKA,GAAM,OAAO,EAC/B,OAAOA,GAAM,OAAO,EAAI,IAC5B,GAAIA,GAAM,OAAO,GAAKA,GAAM,OAAO,EAC/B,OAAOA,GAAM,OAAO,EAAI,GAEhC,CAIO,SAAS,WAAW9gB,EAAK,CAC5B,GAAI,OAAOA,GAAQ,SACf,MAAM,IAAI,MAAM,4BAA8B,OAAOA,CAAG,EAC5D,MAAMwsB,EAAKxsB,EAAI,OACTysB,EAAKD,EAAK,EAChB,GAAIA,EAAK,EACL,MAAM,IAAI,MAAM,mDAAqDA,CAAE,EAC3E,MAAMnsB,EAAQ,IAAI,WAAWosB,CAAE,EAC/B,QAASC,EAAK,EAAGC,EAAK,EAAGD,EAAKD,EAAIC,IAAMC,GAAM,EAAG,CAC7C,MAAMC,EAAK,cAAc5sB,EAAI,WAAW2sB,CAAE,CAAC,EACrCloB,EAAK,cAAczE,EAAI,WAAW2sB,EAAK,CAAC,CAAC,EAC/C,GAAIC,IAAO,QAAanoB,IAAO,OAAW,CACtC,MAAM8lB,EAAOvqB,EAAI2sB,CAAE,EAAI3sB,EAAI2sB,EAAK,CAAC,EACjC,MAAM,IAAI,MAAM,+CAAiDpC,EAAO,cAAgBoC,CAAE,CACtG,CACQtsB,EAAMqsB,CAAE,EAAIE,EAAK,GAAKnoB,CAC9B,CACI,OAAOpE,CACX,CAEO,SAAS,gBAAgBvF,EAAO,CACnC,OAAO,YAAY,WAAWA,CAAK,CAAC,CACxC,CACO,SAAS,gBAAgBA,EAAO,CACnC,cAAOA,CAAK,EACL,YAAY,WAAW,WAAW,KAAKA,CAAK,EAAE,QAAO,CAAE,CAAC,CACnE,CACO,SAAS,gBAAgB,EAAG7G,EAAK,CACpC,OAAO,WAAW,EAAE,SAAS,EAAE,EAAE,SAASA,EAAM,EAAG,GAAG,CAAC,CAC3D,CACO,SAAS,gBAAgB,EAAGA,EAAK,CACpC,OAAO,gBAAgB,EAAGA,CAAG,EAAE,QAAS,CAC5C,CAEO,SAAS,mBAAmB,EAAG,CAClC,OAAO,WAAW,oBAAoB,CAAC,CAAC,CAC5C,CAUO,SAAS,YAAY8M,EAAOf,EAAKgB,EAAgB,CACpD,IAAIlD,EACJ,GAAI,OAAOkC,GAAQ,SACf,GAAI,CACAlC,EAAM,WAAWkC,CAAG,CAChC,OACepK,EAAG,CACN,MAAM,IAAI,MAAMmL,EAAQ,6CAA+CnL,CAAC,CACpF,SAEa,QAAQoK,CAAG,EAGhBlC,EAAM,WAAW,KAAKkC,CAAG,MAGzB,OAAM,IAAI,MAAMe,EAAQ,mCAAmC,EAE/D,MAAM9M,EAAM6J,EAAI,OAChB,GAAI,OAAOkD,GAAmB,UAAY/M,IAAQ+M,EAC9C,MAAM,IAAI,MAAMD,EAAQ,cAAgBC,EAAiB,kBAAoB/M,CAAG,EACpF,OAAO6J,CACX,CAIO,SAAS,eAAe7B,EAAQ,CACnC,IAAIC,EAAM,EACV,QAASjJ,EAAI,EAAGA,EAAIgJ,EAAO,OAAQhJ,IAAK,CACpC,MAAMc,EAAIkI,EAAOhJ,CAAC,EAClB,OAAOc,CAAC,EACRmI,GAAOnI,EAAE,MACjB,CACI,MAAM+J,EAAM,IAAI,WAAW5B,CAAG,EAC9B,QAASjJ,EAAI,EAAGkJ,EAAM,EAAGlJ,EAAIgJ,EAAO,OAAQhJ,IAAK,CAC7C,MAAMc,EAAIkI,EAAOhJ,CAAC,EAClB6K,EAAI,IAAI/J,EAAGoI,CAAG,EACdA,GAAOpI,EAAE,MACjB,CACI,OAAO+J,CACX,CAEO,SAAS,WAAW/J,EAAGC,EAAG,CAC7B,GAAID,EAAE,SAAWC,EAAE,OACf,MAAO,GACX,IAAIukB,EAAO,EACX,QAAStlB,EAAI,EAAGA,EAAIc,EAAE,OAAQd,IAC1BslB,GAAQxkB,EAAEd,CAAC,EAAIe,EAAEf,CAAC,EACtB,OAAOslB,IAAS,CACpB,CAIO,SAAS,YAAYlhB,EAAK,CAC7B,GAAI,OAAOA,GAAQ,SACf,MAAM,IAAI,MAAM,iBAAiB,EACrC,OAAO,IAAI,WAAW,IAAI,YAAa,EAAC,OAAOA,CAAG,CAAC,CACvD,CAEA,MAAM,SAAY,GAAM,OAAO,GAAM,UAAYqI,OAAO,EACjD,SAAS,QAAQ,EAAGrE,EAAKmuB,EAAK,CACjC,OAAO,SAAS,CAAC,GAAK,SAASnuB,CAAG,GAAK,SAASmuB,CAAG,GAAKnuB,GAAO,GAAK,EAAImuB,CAC5E,CAMO,SAAS,SAASzoB,EAAOxJ,EAAG8D,EAAKmuB,EAAK,CAMzC,GAAI,CAAC,QAAQjyB,EAAG8D,EAAKmuB,CAAG,EACpB,MAAM,IAAI,MAAM,kBAAoBzoB,EAAQ,KAAO1F,EAAM,WAAamuB,EAAM,SAAWjyB,CAAC,CAChG,CAMO,SAAS,OAAO,EAAG,CACtB,IAAItD,EACJ,IAAKA,EAAM,EAAG,EAAIyL,MAAK,IAAMC,MAAK1L,GAAO,EACrC,CACJ,OAAOA,CACX,CAMO,SAAS,OAAO,EAAGuJ,EAAK,CAC3B,OAAQ,GAAK,OAAOA,CAAG,EAAKmC,KAChC,CAIO,SAAS,OAAO,EAAGnC,EAAKV,EAAO,CAClC,OAAO,GAAMA,EAAQ6C,MAAMD,QAAQ,OAAOlC,CAAG,CACjD,CAKO,MAAM,QAAW,IAAOoC,OAAO,OAAO,EAAI,CAAC,GAAKD,MAEjD,IAAO5D,GAAS,IAAI,WAAWA,CAAI,EACnC,KAAQlJ,GAAQ,WAAW,KAAKA,CAAG,EAQlC,SAAS,eAAe8O,EAASC,EAAUC,EAAQ,CACtD,GAAI,OAAOF,GAAY,UAAYA,EAAU,EACzC,MAAM,IAAI,MAAM,0BAA0B,EAC9C,GAAI,OAAOC,GAAa,UAAYA,EAAW,EAC3C,MAAM,IAAI,MAAM,2BAA2B,EAC/C,GAAI,OAAOC,GAAW,WAClB,MAAM,IAAI,MAAM,2BAA2B,EAE/C,IAAI1I,EAAI,IAAIwI,CAAO,EACf1M,EAAI,IAAI0M,CAAO,EACf1O,EAAI,EACR,MAAM6O,EAAQ,IAAM,CAChB3I,EAAE,KAAK,CAAC,EACRlE,EAAE,KAAK,CAAC,EACRhC,EAAI,CACP,EACK4D,EAAI,IAAI7C,IAAM6N,EAAO5M,EAAGkE,EAAG,GAAGnF,CAAC,EAC/B+N,EAAS,CAACC,EAAO,QAAU,CAE7B/M,EAAI4B,EAAE,KAAK,CAAC,CAAI,CAAC,EAAGmL,CAAI,EACxB7I,EAAItC,EAAC,EACDmL,EAAK,SAAW,IAEpB/M,EAAI4B,EAAE,KAAK,CAAC,CAAI,CAAC,EAAGmL,CAAI,EACxB7I,EAAItC,EAAC,EACR,EACKoL,EAAM,IAAM,CAEd,GAAIhP,KAAO,IACP,MAAM,IAAI,MAAM,yBAAyB,EAC7C,IAAIgB,EAAM,EACV,MAAMmH,EAAM,CAAE,EACd,KAAOnH,EAAM2N,GAAU,CACnBzI,EAAItC,EAAG,EACP,MAAMqL,EAAK/I,EAAE,MAAO,EACpBiC,EAAI,KAAK8G,CAAE,EACXjO,GAAOkF,EAAE,MACrB,CACQ,OAAO,YAAY,GAAGiC,CAAG,CAC5B,EAUD,MATiB,CAAC4G,EAAMG,IAAS,CAC7BL,EAAO,EACPC,EAAOC,CAAI,EACX,IAAIlE,EACJ,KAAO,EAAEA,EAAMqE,EAAKF,EAAK,CAAA,IACrBF,EAAQ,EACZ,OAAAD,EAAO,EACAhE,CACV,CAEL,CAEA,MAAM,aAAe,CACjB,OAAS9G,GAAQ,OAAOA,GAAQ,SAChC,SAAWA,GAAQ,OAAOA,GAAQ,WAClC,QAAUA,GAAQ,OAAOA,GAAQ,UACjC,OAASA,GAAQ,OAAOA,GAAQ,SAChC,mBAAqBA,GAAQ,OAAOA,GAAQ,UAAY,QAAQA,CAAG,EACnE,cAAgBA,GAAQ,OAAO,cAAcA,CAAG,EAChD,MAAQA,GAAQ,MAAM,QAAQA,CAAG,EACjC,MAAO,CAACA,EAAKqL,IAAWA,EAAO,GAAG,QAAQrL,CAAG,EAC7C,KAAOA,GAAQ,OAAOA,GAAQ,YAAc,OAAO,cAAcA,EAAI,SAAS,CAClF,EAEO,SAAS,eAAeqL,EAAQE,EAAYC,EAAgB,CAAA,EAAI,CACnE,MAAMC,EAAa,CAACC,EAAW/L,EAAMgM,IAAe,CAChD,MAAMC,EAAW,aAAajM,CAAI,EAClC,GAAI,OAAOiM,GAAa,WACpB,MAAM,IAAI,MAAM,4BAA4B,EAChD,MAAM5L,EAAMqL,EAAOK,CAAS,EAC5B,GAAI,EAAAC,GAAc3L,IAAQ,SAEtB,CAAC4L,EAAS5L,EAAKqL,CAAM,EACrB,MAAM,IAAI,MAAM,SAAW,OAAOK,CAAS,EAAI,yBAA2B/L,EAAO,SAAWK,CAAG,CAEtG,EACD,SAAW,CAAC0L,EAAW/L,CAAI,IAAK,OAAO,QAAQ4L,CAAU,EACrDE,EAAWC,EAAW/L,EAAM,EAAK,EACrC,SAAW,CAAC+L,EAAW/L,CAAI,IAAK,OAAO,QAAQ6L,CAAa,EACxDC,EAAWC,EAAW/L,EAAM,EAAI,EACpC,OAAO0L,CACX,CAYO,MAAM,eAAiB,IAAM,CAChC,MAAM,IAAI,MAAM,iBAAiB,CACrC,EAKO,SAAS,SAASqU,EAAI,CACzB,MAAM1R,EAAM,IAAI,QAChB,MAAO,CAAC6nB,KAAQh0B,IAAS,CACrB,MAAM7B,EAAMgO,EAAI,IAAI6nB,CAAG,EACvB,GAAI71B,IAAQ,OACR,OAAOA,EACX,MAAM81B,EAAWpW,EAAGmW,EAAK,GAAGh0B,CAAI,EAChC,OAAAmM,EAAI,IAAI6nB,EAAKC,CAAQ,EACdA,CACV,CACL,sZCvUA,sEAGA,MAAMptB,MAAM,OAAO,CAAC,EAAGC,MAAM,OAAO,CAAC,EAAGC,MAAsB,OAAO,CAAC,EAAGiD,MAAsB,OAAO,CAAC,EAEjG,IAAsB,OAAO,CAAC,EAAG,IAAsB,OAAO,CAAC,EAAG,IAAsB,OAAO,CAAC,EAI/F,SAAS,IAAI9O,EAAGC,EAAG,CACtB,MAAMkP,EAASnP,EAAIC,EACnB,OAAOkP,GAAUxD,MAAMwD,EAASlP,EAAIkP,CACxC,CAQO,SAAS,IAAIhD,EAAKkD,EAAOC,EAAQ,CACpC,GAAID,EAAQ1D,MACR,MAAM,IAAI,MAAM,yCAAyC,EAC7D,GAAI2D,GAAU3D,MACV,MAAM,IAAI,MAAM,iBAAiB,EACrC,GAAI2D,IAAW1D,MACX,OAAOD,MACX,IAAI5B,EAAM6B,MACV,KAAOyD,EAAQ1D,OACP0D,EAAQzD,QACR7B,EAAOA,EAAMoC,EAAOmD,GACxBnD,EAAOA,EAAMA,EAAOmD,EACpBD,IAAUzD,MAEd,OAAO7B,CACX,CAEO,SAAS,KAAKvI,EAAG6N,EAAOC,EAAQ,CACnC,IAAIvF,EAAMvI,EACV,KAAO6N,KAAU1D,OACb5B,GAAOA,EACPA,GAAOuF,EAEX,OAAOvF,CACX,CAKO,SAAS,OAAOjD,EAAQwI,EAAQ,CACnC,GAAIxI,IAAW6E,MACX,MAAM,IAAI,MAAM,kCAAkC,EACtD,GAAI2D,GAAU3D,MACV,MAAM,IAAI,MAAM,0CAA4C2D,CAAM,EAEtE,IAAItP,EAAI,IAAI8G,EAAQwI,CAAM,EACtBrP,EAAIqP,EAEJ9N,EAAImK,MAAc8D,EAAI7D,MAC1B,KAAO5L,IAAM2L,OAAK,CAEd,MAAM+D,EAAIzP,EAAID,EACR0G,EAAIzG,EAAID,EACRiB,EAAIO,EAAIiO,EAAIC,EAGlBzP,EAAID,EAAGA,EAAI0G,EAAGlF,EAAIiO,EAAUA,EAAIxO,CACxC,CAEI,GADYhB,IACA2L,MACR,MAAM,IAAI,MAAM,wBAAwB,EAC5C,OAAO,IAAIpK,EAAG8N,CAAM,CACxB,CASO,SAAS,cAAcM,EAAG,CAM7B,MAAMC,GAAaD,EAAIhE,OAAOC,MAC9B,IAAIiE,EAAGC,EAAGC,EAGV,IAAKF,EAAIF,EAAIhE,MAAKmE,EAAI,EAAGD,EAAIjE,QAAQF,MAAKmE,GAAKjE,MAAKkE,IAChD,CAEJ,IAAKC,EAAInE,MAAKmE,EAAIJ,GAAK,IAAII,EAAGH,EAAWD,CAAC,IAAMA,EAAIhE,MAAKoE,IAErD,GAAIA,EAAI,IACJ,MAAM,IAAI,MAAM,6CAA6C,EAGrE,GAAID,IAAM,EAAG,CACT,MAAME,GAAUL,EAAIhE,OAAO,IAC3B,OAAO,SAAqBsE,EAAI1M,EAAG,CAC/B,MAAM2M,EAAOD,EAAG,IAAI1M,EAAGyM,CAAM,EAC7B,GAAI,CAACC,EAAG,IAAIA,EAAG,IAAIC,CAAI,EAAG3M,CAAC,EACvB,MAAM,IAAI,MAAM,yBAAyB,EAC7C,OAAO2M,CACV,CACT,CAEI,MAAMC,GAAUN,EAAIlE,OAAOC,MAC3B,OAAO,SAAqBqE,EAAI1M,EAAG,CAE/B,GAAI0M,EAAG,IAAI1M,EAAGqM,CAAS,IAAMK,EAAG,IAAIA,EAAG,GAAG,EACtC,MAAM,IAAI,MAAM,yBAAyB,EAC7C,IAAIxJ,EAAIqJ,EAEJM,EAAIH,EAAG,IAAIA,EAAG,IAAIA,EAAG,IAAKF,CAAC,EAAGF,CAAC,EAC/BtO,EAAI0O,EAAG,IAAI1M,EAAG4M,CAAM,EACpBnQ,EAAIiQ,EAAG,IAAI1M,EAAGsM,CAAC,EACnB,KAAO,CAACI,EAAG,IAAIjQ,EAAGiQ,EAAG,GAAG,GAAG,CACvB,GAAIA,EAAG,IAAIjQ,EAAGiQ,EAAG,IAAI,EACjB,OAAOA,EAAG,KAEd,IAAI,EAAI,EACR,QAASI,EAAKJ,EAAG,IAAIjQ,CAAC,EAAG,EAAIyG,GACrB,CAAAwJ,EAAG,IAAII,EAAIJ,EAAG,GAAG,EADO,IAG5BI,EAAKJ,EAAG,IAAII,CAAE,EAGlB,MAAMC,EAAKL,EAAG,IAAIG,EAAGzE,OAAO,OAAOlF,EAAI,EAAI,CAAC,CAAC,EAC7C2J,EAAIH,EAAG,IAAIK,CAAE,EACb/O,EAAI0O,EAAG,IAAI1O,EAAG+O,CAAE,EAChBtQ,EAAIiQ,EAAG,IAAIjQ,EAAGoQ,CAAC,EACf3J,EAAI,CAChB,CACQ,OAAOlF,CACV,CACL,CAYO,SAAS,OAAOoO,EAAG,CAGtB,GAAIA,EAAI,MAAQd,MAAK,CAKjB,MAAMmB,GAAUL,EAAIhE,OAAO,IAC3B,OAAO,SAAmBsE,EAAI1M,EAAG,CAC7B,MAAM2M,EAAOD,EAAG,IAAI1M,EAAGyM,CAAM,EAE7B,GAAI,CAACC,EAAG,IAAIA,EAAG,IAAIC,CAAI,EAAG3M,CAAC,EACvB,MAAM,IAAI,MAAM,yBAAyB,EAC7C,OAAO2M,CACV,CACT,CAEI,GAAIP,EAAI,MAAQ,IAAK,CACjB,MAAMa,GAAMb,EAAI,KAAO,IACvB,OAAO,SAAmBM,EAAI1M,EAAG,CAC7B,MAAMkN,EAAKR,EAAG,IAAI1M,EAAGqI,KAAG,EAClBzG,EAAI8K,EAAG,IAAIQ,EAAID,CAAE,EACjBE,EAAKT,EAAG,IAAI1M,EAAG4B,CAAC,EAChBlG,EAAIgR,EAAG,IAAIA,EAAG,IAAIS,EAAI9E,KAAG,EAAGzG,CAAC,EAC7B+K,EAAOD,EAAG,IAAIS,EAAIT,EAAG,IAAIhR,EAAGgR,EAAG,GAAG,CAAC,EACzC,GAAI,CAACA,EAAG,IAAIA,EAAG,IAAIC,CAAI,EAAG3M,CAAC,EACvB,MAAM,IAAI,MAAM,yBAAyB,EAC7C,OAAO2M,CACV,CACT,CAwBI,OAAO,cAAcP,CAAC,CAC1B,CAIA,MAAM,aAAe,CACjB,SAAU,UAAW,MAAO,MAAO,MAAO,OAAQ,MAClD,MAAO,MAAO,MAAO,MAAO,MAAO,MACnC,OAAQ,OAAQ,OAAQ,MAC5B,EACO,SAAS,cAAckB,EAAO,CACjC,MAAMC,EAAU,CACZ,MAAO,SACP,KAAM,SACN,MAAO,gBACP,KAAM,eACT,EACKC,EAAO,aAAa,OAAO,CAACC,EAAKhO,KACnCgO,EAAIhO,CAAG,EAAI,WACJgO,GACRF,CAAO,EACV,OAAO,eAAeD,EAAOE,CAAI,CACrC,CAMO,SAAS,MAAMG,EAAGhF,EAAKkD,EAAO,CAGjC,GAAIA,EAAQ1D,MACR,MAAM,IAAI,MAAM,yCAAyC,EAC7D,GAAI0D,IAAU1D,MACV,OAAOwF,EAAE,IACb,GAAI9B,IAAUzD,MACV,OAAOO,EACX,IAAI5K,EAAI4P,EAAE,IACNvP,EAAIuK,EACR,KAAOkD,EAAQ1D,OACP0D,EAAQzD,QACRrK,EAAI4P,EAAE,IAAI5P,EAAGK,CAAC,GAClBA,EAAIuP,EAAE,IAAIvP,CAAC,EACXyN,IAAUzD,MAEd,OAAOrK,CACX,CAKO,SAAS,cAAc4P,EAAGE,EAAM,CACnC,MAAM5I,EAAM,IAAI,MAAM4I,EAAK,MAAM,EAE3BC,EAAiBD,EAAK,OAAO,CAACE,EAAKpF,EAAKjN,IACtCiS,EAAE,IAAIhF,CAAG,EACFoF,GACX9I,EAAIvJ,CAAC,EAAIqS,EACFJ,EAAE,IAAII,EAAKpF,CAAG,GACtBgF,EAAE,GAAG,EAEFK,EAAWL,EAAE,IAAIG,CAAc,EAErC,OAAAD,EAAK,YAAY,CAACE,EAAKpF,EAAKjN,IACpBiS,EAAE,IAAIhF,CAAG,EACFoF,GACX9I,EAAIvJ,CAAC,EAAIiS,EAAE,IAAII,EAAK9I,EAAIvJ,CAAC,CAAC,EACnBiS,EAAE,IAAII,EAAKpF,CAAG,GACtBqF,CAAQ,EACJ/I,CACX,CAuBO,SAAS,QAAQ,EAAGiJ,EAAY,CAEnC,MAAMC,EAAcD,IAAe,OAAYA,EAAa,EAAE,SAAS,CAAC,EAAE,OACpEE,EAAc,KAAK,KAAKD,EAAc,CAAC,EAC7C,MAAO,CAAE,WAAYA,EAAa,YAAAC,CAAa,CACnD,CAgBO,SAAS,MAAME,EAAOzE,EAAQxF,EAAO,GAAOkK,EAAQ,GAAI,CAC3D,GAAID,GAASnG,MACT,MAAM,IAAI,MAAM,0CAA4CmG,CAAK,EACrE,KAAM,CAAE,WAAYE,EAAM,YAAaC,CAAK,EAAK,QAAQH,EAAOzE,CAAM,EACtE,GAAI4E,EAAQ,KACR,MAAM,IAAI,MAAM,gDAAgD,EACpE,IAAIC,EACJ,MAAMf,EAAI,OAAO,OAAO,CACpB,MAAAW,EACA,KAAAjK,EACA,KAAAmK,EACA,MAAAC,EACA,KAAM,QAAQD,CAAI,EAClB,KAAMrG,MACN,IAAKC,MACL,OAASO,GAAQ,IAAIA,EAAK2F,CAAK,EAC/B,QAAU3F,GAAQ,CACd,GAAI,OAAOA,GAAQ,SACf,MAAM,IAAI,MAAM,+CAAiD,OAAOA,CAAG,EAC/E,OAAOR,OAAOQ,GAAOA,EAAM2F,CAC9B,EACD,IAAM3F,GAAQA,IAAQR,MACtB,MAAQQ,IAASA,EAAMP,SAASA,MAChC,IAAMO,GAAQ,IAAI,CAACA,EAAK2F,CAAK,EAC7B,IAAK,CAACK,EAAKC,IAAQD,IAAQC,EAC3B,IAAMjG,GAAQ,IAAIA,EAAMA,EAAK2F,CAAK,EAClC,IAAK,CAACK,EAAKC,IAAQ,IAAID,EAAMC,EAAKN,CAAK,EACvC,IAAK,CAACK,EAAKC,IAAQ,IAAID,EAAMC,EAAKN,CAAK,EACvC,IAAK,CAACK,EAAKC,IAAQ,IAAID,EAAMC,EAAKN,CAAK,EACvC,IAAK,CAAC3F,EAAKkD,IAAU,MAAM8B,EAAGhF,EAAKkD,CAAK,EACxC,IAAK,CAAC8C,EAAKC,IAAQ,IAAID,EAAM,OAAOC,EAAKN,CAAK,EAAGA,CAAK,EAEtD,KAAO3F,GAAQA,EAAMA,EACrB,KAAM,CAACgG,EAAKC,IAAQD,EAAMC,EAC1B,KAAM,CAACD,EAAKC,IAAQD,EAAMC,EAC1B,KAAM,CAACD,EAAKC,IAAQD,EAAMC,EAC1B,IAAMjG,GAAQ,OAAOA,EAAK2F,CAAK,EAC/B,KAAMC,EAAM,OACNvO,IACO0O,IACDA,EAAQ,OAAOJ,CAAK,GACjBI,EAAMf,EAAG3N,CAAC,IAEzB,YAAc6O,GAAQ,cAAclB,EAAGkB,CAAG,EAG1C,KAAM,CAACrS,EAAGC,EAAG0B,IAAOA,EAAI1B,EAAID,EAC5B,QAAUmM,GAAStE,EAAO,gBAAgBsE,EAAK8F,CAAK,EAAI,gBAAgB9F,EAAK8F,CAAK,EAClF,UAAYlL,GAAU,CAClB,GAAIA,EAAM,SAAWkL,EACjB,MAAM,IAAI,MAAM,6BAA+BA,EAAQ,eAAiBlL,EAAM,MAAM,EACxF,OAAOc,EAAO,gBAAgBd,CAAK,EAAI,gBAAgBA,CAAK,CAC/D,CACT,CAAK,EACD,OAAO,OAAO,OAAOoK,CAAC,CAC1B,CAkCO,SAAS,oBAAoBoB,EAAY,CAC5C,GAAI,OAAOA,GAAe,SACtB,MAAM,IAAI,MAAM,4BAA4B,EAChD,MAAMC,EAAYD,EAAW,SAAS,CAAC,EAAE,OACzC,OAAO,KAAK,KAAKC,EAAY,CAAC,CAClC,CAQO,SAAS,iBAAiBD,EAAY,CACzC,MAAMvI,EAAS,oBAAoBuI,CAAU,EAC7C,OAAOvI,EAAS,KAAK,KAAKA,EAAS,CAAC,CACxC,CAcO,SAAS,eAAe3F,EAAKkO,EAAY1K,EAAO,GAAO,CAC1D,MAAM3H,EAAMmE,EAAI,OACVsO,EAAW,oBAAoBJ,CAAU,EACzCK,EAAS,iBAAiBL,CAAU,EAE1C,GAAIrS,EAAM,IAAMA,EAAM0S,GAAU1S,EAAM,KAClC,MAAM,IAAI,MAAM,YAAc0S,EAAS,6BAA+B1S,CAAG,EAC7E,MAAMiM,EAAMtE,EAAO,gBAAgBxD,CAAG,EAAI,gBAAgBA,CAAG,EAEvDwO,EAAU,IAAI1G,EAAKoG,EAAa3G,KAAG,EAAIA,MAC7C,OAAO/D,EAAO,gBAAgBgL,EAASF,CAAQ,EAAI,gBAAgBE,EAASF,CAAQ,CACxF,CClcA,sEAGA,MAAMhH,MAAM,OAAO,CAAC,EACdC,MAAM,OAAO,CAAC,EACpB,SAAS,gBAAgBqH,EAAWC,EAAM,CACtC,MAAMC,EAAMD,EAAK,OAAQ,EACzB,OAAOD,EAAYE,EAAMD,CAC7B,CACA,SAAS,UAAUE,EAAGL,EAAM,CACxB,GAAI,CAAC,OAAO,cAAcK,CAAC,GAAKA,GAAK,GAAKA,EAAIL,EAC1C,MAAM,IAAI,MAAM,qCAAuCA,EAAO,YAAcK,CAAC,CACrF,CACA,SAAS,UAAUA,EAAGL,EAAM,CACxB,UAAUK,EAAGL,CAAI,EACjB,MAAMM,EAAU,KAAK,KAAKN,EAAOK,CAAC,EAAI,EAChCE,EAAa,IAAMF,EAAI,GAC7B,MAAO,CAAE,QAAAC,EAAS,WAAAC,CAAY,CAClC,CACA,SAAS,kBAAkBE,EAAQ7R,EAAG,CAClC,GAAI,CAAC,MAAM,QAAQ6R,CAAM,EACrB,MAAM,IAAI,MAAM,gBAAgB,EACpCA,EAAO,QAAQ,CAACjS,EAAGrC,IAAM,CACrB,GAAI,EAAEqC,aAAaI,GACf,MAAM,IAAI,MAAM,0BAA4BzC,CAAC,CACzD,CAAK,CACL,CACA,SAAS,mBAAmB85B,EAASloB,EAAO,CACxC,GAAI,CAAC,MAAM,QAAQkoB,CAAO,EACtB,MAAM,IAAI,MAAM,2BAA2B,EAC/CA,EAAQ,QAAQ,CAACn2B,EAAG3D,IAAM,CACtB,GAAI,CAAC4R,EAAM,QAAQjO,CAAC,EAChB,MAAM,IAAI,MAAM,2BAA6B3D,CAAC,CAC1D,CAAK,CACL,CAGA,MAAM,iBAAmB,IAAI,QACvB,iBAAmB,IAAI,QAC7B,SAAS,KAAK0Q,EAAG,CACb,OAAO,iBAAiB,IAAIA,CAAC,GAAK,CACtC,CAeO,SAAS,KAAKjO,EAAGoR,EAAM,CAC1B,MAAO,CACH,gBACA,eAAeQ,EAAK,CAChB,OAAO,KAAKA,CAAG,IAAM,CACxB,EAED,aAAaA,EAAK/P,EAAGjC,EAAII,EAAE,KAAM,CAC7B,IAAIC,EAAI2R,EACR,KAAO/P,EAAImI,OACHnI,EAAIoI,QACJrK,EAAIA,EAAE,IAAIK,CAAC,GACfA,EAAIA,EAAE,OAAQ,EACd4B,IAAMoI,MAEV,OAAOrK,CACV,EAaD,iBAAiBgS,EAAKH,EAAG,CACrB,KAAM,CAAE,QAAAC,EAAS,WAAAC,CAAU,EAAK,UAAUF,EAAGL,CAAI,EAC3CS,EAAS,CAAE,EACjB,IAAIjS,EAAIgS,EACJE,EAAOlS,EACX,QAASmS,EAAS,EAAGA,EAASL,EAASK,IAAU,CAC7CD,EAAOlS,EACPiS,EAAO,KAAKC,CAAI,EAEhB,QAASvU,EAAI,EAAGA,EAAIoU,EAAYpU,IAC5BuU,EAAOA,EAAK,IAAIlS,CAAC,EACjBiS,EAAO,KAAKC,CAAI,EAEpBlS,EAAIkS,EAAK,OAAQ,CACjC,CACY,OAAOD,CACV,EAQD,KAAKJ,EAAGO,EAAanQ,EAAG,CAGpB,KAAM,CAAE,QAAA6P,EAAS,WAAAC,CAAU,EAAK,UAAUF,EAAGL,CAAI,EACjD,IAAIxR,EAAII,EAAE,KACNwP,EAAIxP,EAAE,KACV,MAAMiS,EAAO,OAAO,GAAKR,EAAI,CAAC,EACxBS,EAAY,GAAKT,EACjBU,EAAU,OAAOV,CAAC,EACxB,QAASM,EAAS,EAAGA,EAASL,EAASK,IAAU,CAC7C,MAAMzI,EAASyI,EAASJ,EAExB,IAAIS,EAAQ,OAAOvQ,EAAIoQ,CAAI,EAE3BpQ,IAAMsQ,EAGFC,EAAQT,IACRS,GAASF,EACTrQ,GAAKoI,OAST,MAAMoI,EAAU/I,EACVgJ,EAAUhJ,EAAS,KAAK,IAAI8I,CAAK,EAAI,EACrCG,EAAQR,EAAS,IAAM,EACvBS,EAAQJ,EAAQ,EAClBA,IAAU,EAEV5C,EAAIA,EAAE,IAAI,gBAAgB+C,EAAOP,EAAYK,CAAO,CAAC,CAAC,EAGtDzS,EAAIA,EAAE,IAAI,gBAAgB4S,EAAOR,EAAYM,CAAO,CAAC,CAAC,CAE1E,CAMY,MAAO,CAAE,EAAA1S,EAAG,EAAA4P,CAAG,CAClB,EASD,WAAWiC,EAAGO,EAAanQ,EAAG+N,EAAM5P,EAAE,KAAM,CACxC,KAAM,CAAE,QAAA0R,EAAS,WAAAC,CAAU,EAAK,UAAUF,EAAGL,CAAI,EAC3Ca,EAAO,OAAO,GAAKR,EAAI,CAAC,EACxBS,EAAY,GAAKT,EACjBU,EAAU,OAAOV,CAAC,EACxB,QAASM,EAAS,EAAGA,EAASL,EAASK,IAAU,CAC7C,MAAMzI,EAASyI,EAASJ,EACxB,GAAI9P,IAAMmI,MACN,MAEJ,IAAIoI,EAAQ,OAAOvQ,EAAIoQ,CAAI,EAS3B,GAPApQ,IAAMsQ,EAGFC,EAAQT,IACRS,GAASF,EACTrQ,GAAKoI,OAELmI,IAAU,EACV,SACJ,IAAI/O,EAAO2O,EAAY1I,EAAS,KAAK,IAAI8I,CAAK,EAAI,CAAC,EAC/CA,EAAQ,IACR/O,EAAOA,EAAK,OAAQ,GAExBuM,EAAMA,EAAI,IAAIvM,CAAI,CAClC,CACY,OAAOuM,CACV,EACD,eAAe6B,EAAGxD,EAAGyE,EAAW,CAE5B,IAAIC,EAAO,iBAAiB,IAAI1E,CAAC,EACjC,OAAK0E,IACDA,EAAO,KAAK,iBAAiB1E,EAAGwD,CAAC,EAC7BA,IAAM,GACN,iBAAiB,IAAIxD,EAAGyE,EAAUC,CAAI,CAAC,GAExCA,CACV,EACD,WAAW1E,EAAGpM,EAAG6Q,EAAW,CACxB,MAAMjB,EAAI,KAAKxD,CAAC,EAChB,OAAO,KAAK,KAAKwD,EAAG,KAAK,eAAeA,EAAGxD,EAAGyE,CAAS,EAAG7Q,CAAC,CAC9D,EACD,iBAAiBoM,EAAGpM,EAAG6Q,EAAW4kB,EAAM,CACpC,MAAM7lB,EAAI,KAAKxD,CAAC,EAChB,OAAIwD,IAAM,EACC,KAAK,aAAaxD,EAAGpM,EAAGy1B,CAAI,EAChC,KAAK,WAAW7lB,EAAG,KAAK,eAAeA,EAAGxD,EAAGyE,CAAS,EAAG7Q,EAAGy1B,CAAI,CAC1E,EAID,cAAcrpB,EAAGwD,EAAG,CAChB,UAAUA,EAAGL,CAAI,EACjB,iBAAiB,IAAInD,EAAGwD,CAAC,EACzB,iBAAiB,OAAOxD,CAAC,CAC5B,CACJ,CACL,CAWO,SAAS,UAAUjO,EAAGu3B,EAAQ1lB,EAAQwlB,EAAS,CASlD,GAFA,kBAAkBxlB,EAAQ7R,CAAC,EAC3B,mBAAmBq3B,EAASE,CAAM,EAC9B1lB,EAAO,SAAWwlB,EAAQ,OAC1B,MAAM,IAAI,MAAM,qDAAqD,EACzE,MAAMG,EAAOx3B,EAAE,KACToS,EAAQ,OAAO,OAAOP,EAAO,MAAM,CAAC,EACpCF,EAAaS,EAAQ,GAAKA,EAAQ,EAAIA,EAAQ,EAAIA,EAAQ,EAAIA,EAAQ,EAAI,EAC1EqlB,GAAQ,GAAK9lB,GAAc,EAC3B+lB,EAAU,IAAI,MAAMD,EAAO,CAAC,EAAE,KAAKD,CAAI,EACvCG,EAAW,KAAK,OAAOJ,EAAO,KAAO,GAAK5lB,CAAU,EAAIA,EAC9D,IAAInL,EAAMgxB,EACV,QAASj6B,EAAIo6B,EAAUp6B,GAAK,EAAGA,GAAKoU,EAAY,CAC5C+lB,EAAQ,KAAKF,CAAI,EACjB,QAAS5sB,EAAI,EAAGA,EAAIysB,EAAQ,OAAQzsB,IAAK,CACrC,MAAMsM,EAASmgB,EAAQzsB,CAAC,EAClBwH,EAAQ,OAAQ8E,GAAU,OAAO3Z,CAAC,EAAK,OAAOk6B,CAAI,CAAC,EACzDC,EAAQtlB,CAAK,EAAIslB,EAAQtlB,CAAK,EAAE,IAAIP,EAAOjH,CAAC,CAAC,CACzD,CACQ,IAAIgtB,EAAOJ,EAEX,QAAS5sB,EAAI8sB,EAAQ,OAAS,EAAGG,EAAOL,EAAM5sB,EAAI,EAAGA,IACjDitB,EAAOA,EAAK,IAAIH,EAAQ9sB,CAAC,CAAC,EAC1BgtB,EAAOA,EAAK,IAAIC,CAAI,EAGxB,GADArxB,EAAMA,EAAI,IAAIoxB,CAAI,EACdr6B,IAAM,EACN,QAASqN,EAAI,EAAGA,EAAI+G,EAAY/G,IAC5BpE,EAAMA,EAAI,OAAQ,CAClC,CACI,OAAOA,CACX,CAgFO,SAAS,cAAcqM,EAAO,CACjC,qBAAcA,EAAM,EAAE,EACtB,eAAeA,EAAO,CAClB,EAAG,SACH,EAAG,SACH,GAAI,QACJ,GAAI,OACZ,EAAO,CACC,WAAY,gBACZ,YAAa,eACrB,CAAK,EAEM,OAAO,OAAO,CACjB,GAAG,QAAQA,EAAM,EAAGA,EAAM,UAAU,EACpC,GAAGA,EACE,EAAGA,EAAM,GAAG,KACzB,CAAK,CACL,CC1VA,sEAKA,SAAS,mBAAmBxD,EAAM,CAC1BA,EAAK,OAAS,QACd,MAAM,OAAQA,EAAK,IAAI,EACvBA,EAAK,UAAY,QACjB,MAAM,UAAWA,EAAK,OAAO,CACrC,CACA,SAAS,kBAAkBwD,EAAO,CAC9B,MAAMxD,EAAO,cAAcwD,CAAK,EAChCE,eAAkB1D,EAAM,CACpB,EAAG,QACH,EAAG,OACX,EAAO,CACC,yBAA0B,QAC1B,eAAgB,UAChB,cAAe,WACf,cAAe,WACf,mBAAoB,UACpB,UAAW,WACX,QAAS,UACjB,CAAK,EACD,KAAM,CAAE,KAAA2D,EAAM,GAAAzE,EAAI,EAAAlQ,CAAG,EAAGgR,EACxB,GAAI2D,EAAM,CACN,GAAI,CAACzE,EAAG,IAAIlQ,EAAGkQ,EAAG,IAAI,EAClB,MAAM,IAAI,MAAM,4EAA4E,EAEhG,GAAI,OAAOyE,GAAS,UAChB,OAAOA,EAAK,MAAS,UACrB,OAAOA,EAAK,aAAgB,WAC5B,MAAM,IAAI,MAAM,uEAAuE,CAEnG,CACI,OAAO,OAAO,OAAO,CAAE,GAAG3D,CAAI,CAAE,CACpC,CACA,KAAM,CAAE,gBAAiB,IAAK,WAAY,GAAK,EAAG,GAC3C,MAAM,eAAe,KAAM,CAC9B,YAAY/P,EAAI,GAAI,CAChB,MAAMA,CAAC,CACf,CACA,CAQO,MAAM,IAAM,CAEf,IAAK,OAEL,KAAM,CACF,OAAQ,CAACsf,EAAKvY,IAAS,CACnB,KAAM,CAAE,IAAK6C,CAAC,EAAK,IACnB,GAAI0V,EAAM,GAAKA,EAAM,IACjB,MAAM,IAAI1V,EAAE,uBAAuB,EACvC,GAAI7C,EAAK,OAAS,EACd,MAAM,IAAI6C,EAAE,2BAA2B,EAC3C,MAAM4uB,EAAUzxB,EAAK,OAAS,EACxB9H,EAAMw5B,oBAAuBD,CAAO,EAC1C,GAAKv5B,EAAI,OAAS,EAAK,IACnB,MAAM,IAAI2K,EAAE,sCAAsC,EAEtD,MAAM8uB,EAASF,EAAU,IAAMC,oBAAwBx5B,EAAI,OAAS,EAAK,GAAG,EAAI,GAEhF,OADUw5B,oBAAuBnZ,CAAG,EACzBoZ,EAASz5B,EAAM8H,CAC7B,EAED,OAAOuY,EAAKvY,EAAM,CACd,KAAM,CAAE,IAAK6C,CAAC,EAAK,IACnB,IAAIpB,EAAM,EACV,GAAI8W,EAAM,GAAKA,EAAM,IACjB,MAAM,IAAI1V,EAAE,uBAAuB,EACvC,GAAI7C,EAAK,OAAS,GAAKA,EAAKyB,GAAK,IAAM8W,EACnC,MAAM,IAAI1V,EAAE,uBAAuB,EACvC,MAAM+uB,EAAQ5xB,EAAKyB,GAAK,EAClBowB,EAAS,CAAC,EAAED,EAAQ,KAC1B,IAAI5vB,EAAS,EACb,GAAI,CAAC6vB,EACD7vB,EAAS4vB,MACR,CAED,MAAMD,EAASC,EAAQ,IACvB,GAAI,CAACD,EACD,MAAM,IAAI9uB,EAAE,mDAAmD,EACnE,GAAI8uB,EAAS,EACT,MAAM,IAAI9uB,EAAE,0CAA0C,EAC1D,MAAMivB,EAAc9xB,EAAK,SAASyB,EAAKA,EAAMkwB,CAAM,EACnD,GAAIG,EAAY,SAAWH,EACvB,MAAM,IAAI9uB,EAAE,uCAAuC,EACvD,GAAIivB,EAAY,CAAC,IAAM,EACnB,MAAM,IAAIjvB,EAAE,sCAAsC,EACtD,UAAW5K,KAAK65B,EACZ9vB,EAAUA,GAAU,EAAK/J,EAE7B,GADAwJ,GAAOkwB,EACH3vB,EAAS,IACT,MAAM,IAAIa,EAAE,wCAAwC,CACxE,CACY,MAAMzF,EAAI4C,EAAK,SAASyB,EAAKA,EAAMO,CAAM,EACzC,GAAI5E,EAAE,SAAW4E,EACb,MAAM,IAAIa,EAAE,gCAAgC,EAChD,MAAO,CAAE,EAAAzF,EAAG,EAAG4C,EAAK,SAASyB,EAAMO,CAAM,CAAG,CAC/C,CACJ,EAKD,KAAM,CACF,OAAOmC,EAAK,CACR,KAAM,CAAE,IAAKtB,CAAC,EAAK,IACnB,GAAIsB,EAAMR,MACN,MAAM,IAAId,EAAE,4CAA4C,EAC5D,IAAIoB,EAAMytB,oBAAuBvtB,CAAG,EAIpC,GAFI,OAAO,SAASF,EAAI,CAAC,EAAG,EAAE,EAAI,IAC9BA,EAAM,KAAOA,GACbA,EAAI,OAAS,EACb,MAAM,IAAIpB,EAAE,gDAAgD,EAChE,OAAOoB,CACV,EACD,OAAOjE,EAAM,CACT,KAAM,CAAE,IAAK6C,CAAC,EAAK,IACnB,GAAI7C,EAAK,CAAC,EAAI,IACV,MAAM,IAAI6C,EAAE,qCAAqC,EACrD,GAAI7C,EAAK,CAAC,IAAM,GAAQ,EAAEA,EAAK,CAAC,EAAI,KAChC,MAAM,IAAI6C,EAAE,qDAAqD,EACrE,OAAO,IAAI7C,CAAI,CAClB,CACJ,EACD,MAAMiE,EAAK,CAEP,KAAM,CAAE,IAAKpB,EAAG,KAAMkvB,EAAK,KAAMxK,CAAG,EAAK,IACnCvnB,EAAO,OAAOiE,GAAQ,SAAW,IAAIA,CAAG,EAAIA,EAClD+tB,OAAUhyB,CAAI,EACd,KAAM,CAAE,EAAGiyB,EAAU,EAAGC,CAAc,EAAG3K,EAAI,OAAO,GAAMvnB,CAAI,EAC9D,GAAIkyB,EAAa,OACb,MAAM,IAAIrvB,EAAE,6CAA6C,EAC7D,KAAM,CAAE,EAAGsvB,EAAQC,CAAe,EAAG7K,EAAI,OAAO,EAAM0K,CAAQ,EACxD,CAAE,EAAGjlB,EAAQ,EAAGqlB,CAAY,EAAG9K,EAAI,OAAO,EAAM6K,CAAU,EAChE,GAAIC,EAAW,OACX,MAAM,IAAIxvB,EAAE,6CAA6C,EAC7D,MAAO,CAAE,EAAGkvB,EAAI,OAAOI,CAAM,EAAG,EAAGJ,EAAI,OAAO/kB,CAAM,CAAG,CAC1D,EACD,WAAWE,EAAK,CACZ,KAAM,CAAE,KAAMqa,EAAK,KAAMwK,CAAK,EAAG,IAC3BO,EAAK/K,EAAI,OAAO,EAAMwK,EAAI,OAAO7kB,EAAI,CAAC,CAAC,EACvCqlB,EAAKhL,EAAI,OAAO,EAAMwK,EAAI,OAAO7kB,EAAI,CAAC,CAAC,EACvCslB,EAAMF,EAAKC,EACjB,OAAOhL,EAAI,OAAO,GAAMiL,CAAG,CAC9B,CACL,EAGM7uB,MAAM,OAAO,CAAC,EAAGC,MAAM,OAAO,CAAC,EAAS,OAAO,CAAC,EAAE,MAAC,IAAM,OAAO,CAAC,EAAS,OAAO,CAAC,EACjF,SAAS,kBAAkBoF,EAAM,CACpC,MAAMwE,EAAQ,kBAAkBxE,CAAI,EAC9B,CAAE,GAAAd,CAAI,EAAGsF,EACTilB,EAAK,MAAMjlB,EAAM,EAAGA,EAAM,UAAU,EACpCzN,EAAUyN,EAAM,UACjB,CAACC,EAAIC,EAAOC,IAAkB,CAC3B,MAAM3V,EAAI0V,EAAM,SAAU,EAC1B,OAAOE,YAAe,WAAW,KAAK,CAAC,CAAI,CAAC,EAAG1F,EAAG,QAAQlQ,EAAE,CAAC,EAAGkQ,EAAG,QAAQlQ,EAAE,CAAC,CAAC,CAC3F,GACU6V,EAAYL,EAAM,YAClBzO,GAAU,CAER,MAAM+O,EAAO/O,EAAM,SAAS,CAAC,EAEvBvF,EAAI0O,EAAG,UAAU4F,EAAK,SAAS,EAAG5F,EAAG,KAAK,CAAC,EAC3ClN,EAAIkN,EAAG,UAAU4F,EAAK,SAAS5F,EAAG,MAAO,EAAIA,EAAG,KAAK,CAAC,EAC5D,MAAO,CAAE,EAAA1O,EAAG,EAAAwB,CAAG,CAC3B,GAKI,SAAS+S,EAAoBvU,EAAG,CAC5B,KAAM,CAAE,EAAAxB,EAAG,EAAAC,CAAC,EAAKuV,EACXQ,EAAK9F,EAAG,IAAI1O,CAAC,EACbyU,EAAK/F,EAAG,IAAI8F,EAAIxU,CAAC,EACvB,OAAO0O,EAAG,IAAIA,EAAG,IAAI+F,EAAI/F,EAAG,IAAI1O,EAAGxB,CAAC,CAAC,EAAGC,CAAC,CACjD,CAKI,GAAI,CAACiQ,EAAG,IAAIA,EAAG,IAAIsF,EAAM,EAAE,EAAGO,EAAoBP,EAAM,EAAE,CAAC,EACvD,MAAM,IAAI,MAAM,6CAA6C,EAEjE,SAASU,EAAmB/J,EAAK,CAC7B,OAAOuuB,QAAWvuB,EAAKP,MAAK4J,EAAM,CAAC,CAC3C,CAGI,SAASY,EAAuB/R,EAAK,CACjC,KAAM,CAAE,yBAA0B2C,EAAS,YAAA4K,EAAa,eAAAyE,EAAgB,EAAGskB,CAAC,EAAKnlB,EACjF,GAAIxO,GAAW,OAAO3C,GAAQ,SAAU,CAIpC,GAHIu2B,QAAWv2B,CAAG,IACdA,EAAMiS,WAAcjS,CAAG,GAEvB,OAAOA,GAAQ,UAAY,CAAC2C,EAAQ,SAAS3C,EAAI,MAAM,EACvD,MAAM,IAAI,MAAM,qBAAqB,EACzCA,EAAMA,EAAI,SAASuN,EAAc,EAAG,GAAG,CACnD,CACQ,IAAIzF,EACJ,GAAI,CACAA,EACI,OAAO9H,GAAQ,SACTA,EACAkS,gBAAmB,YAAY,cAAelS,EAAKuN,CAAW,CAAC,CACrF,MACsB,CACV,MAAM,IAAI,MAAM,wCAA0CA,EAAc,eAAiB,OAAOvN,CAAG,CAC/G,CACQ,OAAIgS,IACAlK,EAAM,IAAIA,EAAKwuB,CAAC,GACpBE,SAAY,cAAe1uB,EAAKP,MAAK+uB,CAAC,EAC/BxuB,CACf,CACI,SAASuK,EAAeC,EAAO,CAC3B,GAAI,EAAEA,aAAiBC,GACnB,MAAM,IAAI,MAAM,0BAA0B,CACtD,CAKI,MAAMkkB,EAAe,SAAS,CAACv5B,EAAG2X,IAAO,CACrC,KAAM,CAAE,GAAI1X,EAAG,GAAIwB,EAAG,GAAImW,CAAC,EAAK5X,EAEhC,GAAI2O,EAAG,IAAIiJ,EAAGjJ,EAAG,GAAG,EAChB,MAAO,CAAE,EAAA1O,EAAG,EAAAwB,CAAG,EACnB,MAAMgU,EAAMzV,EAAE,IAAK,EAGf2X,GAAM,OACNA,EAAKlC,EAAM9G,EAAG,IAAMA,EAAG,IAAIiJ,CAAC,GAChC,MAAMC,EAAKlJ,EAAG,IAAI1O,EAAG0X,CAAE,EACjBG,EAAKnJ,EAAG,IAAIlN,EAAGkW,CAAE,EACjBI,EAAKpJ,EAAG,IAAIiJ,EAAGD,CAAE,EACvB,GAAIlC,EACA,MAAO,CAAE,EAAG9G,EAAG,KAAM,EAAGA,EAAG,IAAM,EACrC,GAAI,CAACA,EAAG,IAAIoJ,EAAIpJ,EAAG,GAAG,EAClB,MAAM,IAAI,MAAM,kBAAkB,EACtC,MAAO,CAAE,EAAGkJ,EAAI,EAAGC,CAAI,CAC/B,CAAK,EAGK0hB,EAAkB,SAAUx5B,GAAM,CACpC,GAAIA,EAAE,MAAO,CAIT,GAAIiU,EAAM,oBAAsB,CAACtF,EAAG,IAAI3O,EAAE,EAAE,EACxC,OACJ,MAAM,IAAI,MAAM,iBAAiB,CAC7C,CAEQ,KAAM,CAAE,EAAAC,EAAG,EAAAwB,GAAMzB,EAAE,SAAU,EAE7B,GAAI,CAAC2O,EAAG,QAAQ1O,CAAC,GAAK,CAAC0O,EAAG,QAAQlN,CAAC,EAC/B,MAAM,IAAI,MAAM,0BAA0B,EAC9C,MAAMmU,EAAOjH,EAAG,IAAIlN,CAAC,EACfoU,EAAQrB,EAAoBvU,CAAC,EACnC,GAAI,CAAC0O,EAAG,IAAIiH,EAAMC,CAAK,EACnB,MAAM,IAAI,MAAM,mCAAmC,EACvD,GAAI,CAAC7V,EAAE,cAAe,EAClB,MAAM,IAAI,MAAM,wCAAwC,EAC5D,MAAO,EACf,CAAK,EAMD,MAAMqV,CAAM,CACR,YAAYC,EAAIC,EAAIC,EAAI,CAIpB,GAHA,KAAK,GAAKF,EACV,KAAK,GAAKC,EACV,KAAK,GAAKC,EACNF,GAAM,MAAQ,CAAC3G,EAAG,QAAQ2G,CAAE,EAC5B,MAAM,IAAI,MAAM,YAAY,EAChC,GAAIC,GAAM,MAAQ,CAAC5G,EAAG,QAAQ4G,CAAE,EAC5B,MAAM,IAAI,MAAM,YAAY,EAChC,GAAIC,GAAM,MAAQ,CAAC7G,EAAG,QAAQ6G,CAAE,EAC5B,MAAM,IAAI,MAAM,YAAY,EAChC,OAAO,OAAO,IAAI,CAC9B,CAGQ,OAAO,WAAWxV,EAAG,CACjB,KAAM,CAAE,EAAAC,EAAG,EAAAwB,CAAG,EAAGzB,GAAK,CAAE,EACxB,GAAI,CAACA,GAAK,CAAC2O,EAAG,QAAQ1O,CAAC,GAAK,CAAC0O,EAAG,QAAQlN,CAAC,EACrC,MAAM,IAAI,MAAM,sBAAsB,EAC1C,GAAIzB,aAAaqV,EACb,MAAM,IAAI,MAAM,8BAA8B,EAClD,MAAMI,EAAO9X,GAAMgR,EAAG,IAAIhR,EAAGgR,EAAG,IAAI,EAEpC,OAAI8G,EAAIxV,CAAC,GAAKwV,EAAIhU,CAAC,EACR4T,EAAM,KACV,IAAIA,EAAMpV,EAAGwB,EAAGkN,EAAG,GAAG,CACzC,CACQ,IAAI,GAAI,CACJ,OAAO,KAAK,SAAQ,EAAG,CACnC,CACQ,IAAI,GAAI,CACJ,OAAO,KAAK,SAAQ,EAAG,CACnC,CAOQ,OAAO,WAAWsD,EAAQ,CACtB,MAAMyD,EAAQ/G,EAAG,YAAYsD,EAAO,IAAKjS,GAAMA,EAAE,EAAE,CAAC,EACpD,OAAOiS,EAAO,IAAI,CAACjS,EAAGrC,IAAMqC,EAAE,SAAS0V,EAAM/X,CAAC,CAAC,CAAC,EAAE,IAAI0X,EAAM,UAAU,CAClF,CAKQ,OAAO,QAAQ3K,EAAK,CAChB,MAAM2D,EAAIgH,EAAM,WAAWf,EAAU,YAAY,WAAY5J,CAAG,CAAC,CAAC,EAClE,OAAA2D,EAAE,eAAgB,EACXA,CACnB,CAEQ,OAAO,eAAesH,EAAY,CAC9B,OAAON,EAAM,KAAK,SAASR,EAAuBc,CAAU,CAAC,CACzE,CAEQ,OAAO,IAAI1D,EAAQwlB,EAAS,CACxB,OAAO,UAAUpiB,EAAO6jB,EAAIjnB,EAAQwlB,CAAO,CACvD,CAEQ,eAAe1lB,EAAY,CACvBgF,EAAK,cAAc,KAAMhF,CAAU,CAC/C,CAEQ,gBAAiB,CACbynB,EAAgB,IAAI,CAChC,CACQ,UAAW,CACP,KAAM,CAAE,EAAA/3B,CAAC,EAAK,KAAK,SAAU,EAC7B,GAAIkN,EAAG,MACH,MAAO,CAACA,EAAG,MAAMlN,CAAC,EACtB,MAAM,IAAI,MAAM,6BAA6B,CACzD,CAIQ,OAAO2T,EAAO,CACVD,EAAeC,CAAK,EACpB,KAAM,CAAE,GAAIU,EAAI,GAAIC,EAAI,GAAIC,CAAE,EAAK,KAC7B,CAAE,GAAIC,EAAI,GAAIC,EAAI,GAAIC,CAAE,EAAKf,EAC7BgB,EAAKzH,EAAG,IAAIA,EAAG,IAAImH,EAAIK,CAAE,EAAGxH,EAAG,IAAIsH,EAAID,CAAE,CAAC,EAC1CK,EAAK1H,EAAG,IAAIA,EAAG,IAAIoH,EAAII,CAAE,EAAGxH,EAAG,IAAIuH,EAAIF,CAAE,CAAC,EAChD,OAAOI,GAAMC,CACzB,CAIQ,QAAS,CACL,OAAO,IAAIhB,EAAM,KAAK,GAAI1G,EAAG,IAAI,KAAK,EAAE,EAAG,KAAK,EAAE,CAC9D,CAKQ,QAAS,CACL,KAAM,CAAE,EAAAlQ,EAAG,EAAAC,CAAC,EAAKuV,EACXqC,EAAK3H,EAAG,IAAIjQ,EAAG,GAAG,EAClB,CAAE,GAAIoX,EAAI,GAAIC,EAAI,GAAIC,CAAE,EAAK,KACnC,IAAIO,EAAK5H,EAAG,KAAM6H,EAAK7H,EAAG,KAAM8H,EAAK9H,EAAG,KACpC+H,EAAK/H,EAAG,IAAImH,EAAIA,CAAE,EAClBa,EAAKhI,EAAG,IAAIoH,EAAIA,CAAE,EAClBhH,EAAKJ,EAAG,IAAIqH,EAAIA,CAAE,EAClBY,EAAKjI,EAAG,IAAImH,EAAIC,CAAE,EACtB,OAAAa,EAAKjI,EAAG,IAAIiI,EAAIA,CAAE,EAClBH,EAAK9H,EAAG,IAAImH,EAAIE,CAAE,EAClBS,EAAK9H,EAAG,IAAI8H,EAAIA,CAAE,EAClBF,EAAK5H,EAAG,IAAIlQ,EAAGgY,CAAE,EACjBD,EAAK7H,EAAG,IAAI2H,EAAIvH,CAAE,EAClByH,EAAK7H,EAAG,IAAI4H,EAAIC,CAAE,EAClBD,EAAK5H,EAAG,IAAIgI,EAAIH,CAAE,EAClBA,EAAK7H,EAAG,IAAIgI,EAAIH,CAAE,EAClBA,EAAK7H,EAAG,IAAI4H,EAAIC,CAAE,EAClBD,EAAK5H,EAAG,IAAIiI,EAAIL,CAAE,EAClBE,EAAK9H,EAAG,IAAI2H,EAAIG,CAAE,EAClB1H,EAAKJ,EAAG,IAAIlQ,EAAGsQ,CAAE,EACjB6H,EAAKjI,EAAG,IAAI+H,EAAI3H,CAAE,EAClB6H,EAAKjI,EAAG,IAAIlQ,EAAGmY,CAAE,EACjBA,EAAKjI,EAAG,IAAIiI,EAAIH,CAAE,EAClBA,EAAK9H,EAAG,IAAI+H,EAAIA,CAAE,EAClBA,EAAK/H,EAAG,IAAI8H,EAAIC,CAAE,EAClBA,EAAK/H,EAAG,IAAI+H,EAAI3H,CAAE,EAClB2H,EAAK/H,EAAG,IAAI+H,EAAIE,CAAE,EAClBJ,EAAK7H,EAAG,IAAI6H,EAAIE,CAAE,EAClB3H,EAAKJ,EAAG,IAAIoH,EAAIC,CAAE,EAClBjH,EAAKJ,EAAG,IAAII,EAAIA,CAAE,EAClB2H,EAAK/H,EAAG,IAAII,EAAI6H,CAAE,EAClBL,EAAK5H,EAAG,IAAI4H,EAAIG,CAAE,EAClBD,EAAK9H,EAAG,IAAII,EAAI4H,CAAE,EAClBF,EAAK9H,EAAG,IAAI8H,EAAIA,CAAE,EAClBA,EAAK9H,EAAG,IAAI8H,EAAIA,CAAE,EACX,IAAIpB,EAAMkB,EAAIC,EAAIC,CAAE,CACvC,CAKQ,IAAIrB,EAAO,CACPD,EAAeC,CAAK,EACpB,KAAM,CAAE,GAAIU,EAAI,GAAIC,EAAI,GAAIC,CAAE,EAAK,KAC7B,CAAE,GAAIC,EAAI,GAAIC,EAAI,GAAIC,CAAE,EAAKf,EACnC,IAAImB,EAAK5H,EAAG,KAAM6H,EAAK7H,EAAG,KAAM8H,EAAK9H,EAAG,KACxC,MAAMlQ,EAAIwV,EAAM,EACVqC,EAAK3H,EAAG,IAAIsF,EAAM,EAAG,GAAG,EAC9B,IAAIyC,EAAK/H,EAAG,IAAImH,EAAIG,CAAE,EAClBU,EAAKhI,EAAG,IAAIoH,EAAIG,CAAE,EAClBnH,EAAKJ,EAAG,IAAIqH,EAAIG,CAAE,EAClBS,EAAKjI,EAAG,IAAImH,EAAIC,CAAE,EAClBc,EAAKlI,EAAG,IAAIsH,EAAIC,CAAE,EACtBU,EAAKjI,EAAG,IAAIiI,EAAIC,CAAE,EAClBA,EAAKlI,EAAG,IAAI+H,EAAIC,CAAE,EAClBC,EAAKjI,EAAG,IAAIiI,EAAIC,CAAE,EAClBA,EAAKlI,EAAG,IAAImH,EAAIE,CAAE,EAClB,IAAIc,EAAKnI,EAAG,IAAIsH,EAAIE,CAAE,EACtB,OAAAU,EAAKlI,EAAG,IAAIkI,EAAIC,CAAE,EAClBA,EAAKnI,EAAG,IAAI+H,EAAI3H,CAAE,EAClB8H,EAAKlI,EAAG,IAAIkI,EAAIC,CAAE,EAClBA,EAAKnI,EAAG,IAAIoH,EAAIC,CAAE,EAClBO,EAAK5H,EAAG,IAAIuH,EAAIC,CAAE,EAClBW,EAAKnI,EAAG,IAAImI,EAAIP,CAAE,EAClBA,EAAK5H,EAAG,IAAIgI,EAAI5H,CAAE,EAClB+H,EAAKnI,EAAG,IAAImI,EAAIP,CAAE,EAClBE,EAAK9H,EAAG,IAAIlQ,EAAGoY,CAAE,EACjBN,EAAK5H,EAAG,IAAI2H,EAAIvH,CAAE,EAClB0H,EAAK9H,EAAG,IAAI4H,EAAIE,CAAE,EAClBF,EAAK5H,EAAG,IAAIgI,EAAIF,CAAE,EAClBA,EAAK9H,EAAG,IAAIgI,EAAIF,CAAE,EAClBD,EAAK7H,EAAG,IAAI4H,EAAIE,CAAE,EAClBE,EAAKhI,EAAG,IAAI+H,EAAIA,CAAE,EAClBC,EAAKhI,EAAG,IAAIgI,EAAID,CAAE,EAClB3H,EAAKJ,EAAG,IAAIlQ,EAAGsQ,CAAE,EACjB8H,EAAKlI,EAAG,IAAI2H,EAAIO,CAAE,EAClBF,EAAKhI,EAAG,IAAIgI,EAAI5H,CAAE,EAClBA,EAAKJ,EAAG,IAAI+H,EAAI3H,CAAE,EAClBA,EAAKJ,EAAG,IAAIlQ,EAAGsQ,CAAE,EACjB8H,EAAKlI,EAAG,IAAIkI,EAAI9H,CAAE,EAClB2H,EAAK/H,EAAG,IAAIgI,EAAIE,CAAE,EAClBL,EAAK7H,EAAG,IAAI6H,EAAIE,CAAE,EAClBA,EAAK/H,EAAG,IAAImI,EAAID,CAAE,EAClBN,EAAK5H,EAAG,IAAIiI,EAAIL,CAAE,EAClBA,EAAK5H,EAAG,IAAI4H,EAAIG,CAAE,EAClBA,EAAK/H,EAAG,IAAIiI,EAAID,CAAE,EAClBF,EAAK9H,EAAG,IAAImI,EAAIL,CAAE,EAClBA,EAAK9H,EAAG,IAAI8H,EAAIC,CAAE,EACX,IAAIrB,EAAMkB,EAAIC,EAAIC,CAAE,CACvC,CACQ,SAASrB,EAAO,CACZ,OAAO,KAAK,IAAIA,EAAM,OAAM,CAAE,CAC1C,CACQ,KAAM,CACF,OAAO,KAAK,OAAOC,EAAM,IAAI,CACzC,CACQ,KAAKpT,EAAG,CACJ,OAAO8U,EAAK,WAAW,KAAM9U,EAAGoT,EAAM,UAAU,CAC5D,CAMQ,eAAeokB,EAAI,CACf,KAAM,CAAE,KAAArmB,EAAM,EAAGgmB,CAAG,EAAGnlB,EACvBqlB,SAAY,SAAUG,EAAIrvB,MAAKgvB,CAAC,EAChC,MAAMpiB,EAAI3B,EAAM,KAChB,GAAIokB,IAAOrvB,MACP,OAAO4M,EACX,GAAI,KAAK,OAASyiB,IAAOpvB,MACrB,OAAO,KAEX,GAAI,CAAC+I,GAAQ2D,EAAK,eAAe,IAAI,EACjC,OAAOA,EAAK,iBAAiB,KAAM0iB,EAAIpkB,EAAM,UAAU,EAE3D,GAAI,CAAE,MAAA4B,EAAO,GAAAC,EAAI,MAAAC,EAAO,GAAAvX,CAAE,EAAKwT,EAAK,YAAYqmB,CAAE,EAC9CriB,EAAMJ,EACNK,EAAML,EACN3W,EAAI,KACR,KAAO6W,EAAK9M,OAAOxK,EAAKwK,OAChB8M,EAAK7M,QACL+M,EAAMA,EAAI,IAAI/W,CAAC,GACfT,EAAKyK,QACLgN,EAAMA,EAAI,IAAIhX,CAAC,GACnBA,EAAIA,EAAE,OAAQ,EACd6W,IAAO7M,MACPzK,IAAOyK,MAEX,OAAI4M,IACAG,EAAMA,EAAI,OAAQ,GAClBD,IACAE,EAAMA,EAAI,OAAQ,GACtBA,EAAM,IAAIhC,EAAM1G,EAAG,IAAI0I,EAAI,GAAIjE,EAAK,IAAI,EAAGiE,EAAI,GAAIA,EAAI,EAAE,EAClDD,EAAI,IAAIC,CAAG,CAC9B,CAUQ,SAASC,EAAQ,CACb,KAAM,CAAE,KAAAlE,EAAM,EAAGgmB,CAAG,EAAGnlB,EACvBqlB,SAAY,SAAUhiB,EAAQjN,MAAK+uB,CAAC,EACpC,IAAIjlB,EAAOoD,EACX,GAAInE,EAAM,CACN,KAAM,CAAE,MAAA6D,EAAO,GAAAC,EAAI,MAAAC,EAAO,GAAAvX,CAAE,EAAKwT,EAAK,YAAYkE,CAAM,EACxD,GAAI,CAAE,EAAGF,EAAK,EAAGI,CAAG,EAAK,KAAK,KAAKN,CAAE,EACjC,CAAE,EAAGG,EAAK,EAAGI,CAAG,EAAK,KAAK,KAAK7X,CAAE,EACrCwX,EAAML,EAAK,gBAAgBE,EAAOG,CAAG,EACrCC,EAAMN,EAAK,gBAAgBI,EAAOE,CAAG,EACrCA,EAAM,IAAIhC,EAAM1G,EAAG,IAAI0I,EAAI,GAAIjE,EAAK,IAAI,EAAGiE,EAAI,GAAIA,EAAI,EAAE,EACzDlD,EAAQiD,EAAI,IAAIC,CAAG,EACnBE,EAAOC,EAAI,IAAIC,CAAG,CAClC,KACiB,CACD,KAAM,CAAE,EAAAzX,EAAG,EAAA4P,CAAC,EAAK,KAAK,KAAK0H,CAAM,EACjCnD,EAAQnU,EACRuX,EAAO3H,CACvB,CAEY,OAAOyF,EAAM,WAAW,CAAClB,EAAOoD,CAAI,CAAC,EAAE,CAAC,CACpD,CAOQ,qBAAqBhJ,EAAG9P,EAAGC,EAAG,CAC1B,MAAM8K,EAAI6L,EAAM,KACVqC,EAAM,CAACrJ,EAAG5P,IACVA,IAAM2L,OAAO3L,IAAM4L,OAAO,CAACgE,EAAE,OAAO7E,CAAC,EAAI6E,EAAE,eAAe5P,CAAC,EAAI4P,EAAE,SAAS5P,CAAC,EAC3EmI,EAAM8Q,EAAI,KAAMjZ,CAAC,EAAE,IAAIiZ,EAAInJ,EAAG7P,CAAC,CAAC,EACtC,OAAOkI,EAAI,MAAQ,OAAYA,CAC3C,CAIQ,SAAS+Q,EAAI,CACT,OAAO4hB,EAAa,KAAM5hB,CAAE,CACxC,CACQ,eAAgB,CACZ,KAAM,CAAE,EAAGK,EAAU,cAAAC,CAAe,EAAGhE,EACvC,GAAI+D,IAAa3N,MACb,MAAO,GACX,GAAI4N,EACA,OAAOA,EAAc5C,EAAO,IAAI,EACpC,MAAM,IAAI,MAAM,8DAA8D,CAC1F,CACQ,eAAgB,CACZ,KAAM,CAAE,EAAG2C,EAAU,cAAAE,CAAe,EAAGjE,EACvC,OAAI+D,IAAa3N,MACN,KACP6N,EACOA,EAAc7C,EAAO,IAAI,EAC7B,KAAK,eAAepB,EAAM,CAAC,CAC9C,CACQ,WAAWkE,EAAe,GAAM,CAC5B,aAAM,eAAgBA,CAAY,EAClC,KAAK,eAAgB,EACd3R,EAAQ6O,EAAO,KAAM8C,CAAY,CACpD,CACQ,MAAMA,EAAe,GAAM,CACvB,aAAM,eAAgBA,CAAY,EAC3BpD,WAAc,KAAK,WAAWoD,CAAY,CAAC,CAC9D,CACA,CACI9C,EAAM,KAAO,IAAIA,EAAMpB,EAAM,GAAIA,EAAM,GAAItF,EAAG,GAAG,EACjD0G,EAAM,KAAO,IAAIA,EAAM1G,EAAG,KAAMA,EAAG,IAAKA,EAAG,IAAI,EAC/C,MAAMyJ,EAAQnE,EAAM,WACd8C,EAAO,KAAK1B,EAAOpB,EAAM,KAAO,KAAK,KAAKmE,EAAQ,CAAC,EAAIA,CAAK,EAElE,MAAO,CACH,MAAAnE,EACA,gBAAiBoB,EACjB,uBAAAR,EACA,oBAAAL,EACA,mBAAAG,CACH,CACL,CACA,SAAS,aAAa1B,EAAO,CACzB,MAAMxD,EAAO,cAAcwD,CAAK,EAChCE,sBAAkB1D,EAAM,CACpB,KAAM,OACN,KAAM,WACN,YAAa,UACrB,EAAO,CACC,SAAU,WACV,cAAe,WACf,KAAM,SACd,CAAK,EACM,OAAO,OAAO,CAAE,KAAM,GAAM,GAAGA,EAAM,CAChD,CAQO,SAAS,YAAY8I,EAAU,CAClC,MAAMtE,EAAQ,aAAasE,CAAQ,EAC7B,CAAE,GAAA5J,EAAI,EAAG6J,CAAa,EAAGvE,EACzBwE,EAAgB9J,EAAG,MAAQ,EAC3B+J,EAAkB,EAAI/J,EAAG,MAAQ,EACvC,SAASiK,EAAKna,EAAG,CACb,OAAO,IAAIA,EAAG+Z,CAAW,CACjC,CACI,SAASK,EAAKpa,EAAG,CACb,OAAO,OAAOA,EAAG+Z,CAAW,CACpC,CACI,KAAM,CAAE,gBAAiBnD,EAAO,uBAAAR,EAAwB,oBAAAL,EAAqB,mBAAAG,CAAqB,EAAG,kBAAkB,CACnH,GAAGV,EACH,QAAQC,EAAIC,EAAOgE,EAAc,CAC7B,MAAM1Z,EAAI0V,EAAM,SAAU,EACpBlU,EAAI0O,EAAG,QAAQlQ,EAAE,CAAC,EAClBsa,EAAM1E,YAEZ,OADA,MAAM,eAAgB8D,CAAY,EAC9BA,EACOY,EAAI,WAAW,KAAK,CAAC5E,EAAM,SAAU,EAAG,EAAO,CAAI,CAAC,EAAGlU,CAAC,EAGxD8Y,EAAI,WAAW,KAAK,CAAC,CAAI,CAAC,EAAG9Y,EAAG0O,EAAG,QAAQlQ,EAAE,CAAC,CAAC,CAE7D,EACD,UAAU+G,EAAO,CACb,MAAM7G,EAAM6G,EAAM,OACZwT,EAAOxT,EAAM,CAAC,EACd+O,EAAO/O,EAAM,SAAS,CAAC,EAE7B,GAAI7G,IAAQ8Z,IAAkBO,IAAS,GAAQA,IAAS,GAAO,CAC3D,MAAM/Y,EAAI+U,gBAAmBT,CAAI,EACjC,GAAI,CAAC4kB,QAAWl5B,EAAGoK,MAAKsE,EAAG,KAAK,EAC5B,MAAM,IAAI,MAAM,uBAAuB,EAC3C,MAAMsK,EAAKzE,EAAoBvU,CAAC,EAChC,IAAIwB,EACJ,GAAI,CACAA,EAAIkN,EAAG,KAAKsK,CAAE,CAClC,OACuBygB,EAAW,CACd,MAAMpI,EAASoI,aAAqB,MAAQ,KAAOA,EAAU,QAAU,GACvE,MAAM,IAAI,MAAM,wBAA0BpI,CAAM,CACpE,CACgB,MAAMpY,GAAUzX,EAAI4I,SAASA,MAG7B,OADmB2O,EAAO,KAAO,IACfE,IACdzX,EAAIkN,EAAG,IAAIlN,CAAC,GACT,CAAE,EAAAxB,EAAG,EAAAwB,CAAG,CAC/B,SACqB9C,IAAQ+Z,GAAmBM,IAAS,EAAM,CAC/C,MAAM/Y,EAAI0O,EAAG,UAAU4F,EAAK,SAAS,EAAG5F,EAAG,KAAK,CAAC,EAC3ClN,EAAIkN,EAAG,UAAU4F,EAAK,SAAS5F,EAAG,MAAO,EAAIA,EAAG,KAAK,CAAC,EAC5D,MAAO,CAAE,EAAA1O,EAAG,EAAAwB,CAAG,CAC/B,KACiB,CACD,MAAMk4B,EAAKlhB,EACLmhB,EAAKlhB,EACX,MAAM,IAAI,MAAM,qCAAuCihB,EAAK,qBAAuBC,EAAK,SAAWj7B,CAAG,CACtH,CACS,CACT,CAAK,EACKwa,EAAiBvO,GAAQmK,WAAcqE,gBAAmBxO,EAAKqJ,EAAM,WAAW,CAAC,EACvF,SAASoF,EAAsB9T,EAAQ,CACnC,MAAM+T,EAAOd,GAAenO,MAC5B,OAAO9E,EAAS+T,CACxB,CACI,SAASC,EAAWjY,EAAG,CACnB,OAAO+X,EAAsB/X,CAAC,EAAIsX,EAAK,CAACtX,CAAC,EAAIA,CACrD,CAEI,MAAMkY,EAAS,CAAC9a,EAAGR,EAAMD,IAAO+W,gBAAmBtW,EAAE,MAAMR,EAAMD,CAAE,CAAC,EAIpE,MAAMwb,CAAU,CACZ,YAAYtU,EAAG7D,EAAGoY,EAAU,CACxB,KAAK,EAAIvU,EACT,KAAK,EAAI7D,EACT,KAAK,SAAWoY,EAChB,KAAK,eAAgB,CACjC,CAEQ,OAAO,YAAYhP,EAAK,CACpB,MAAMtM,EAAI6V,EAAM,YAChB,OAAAvJ,EAAM,YAAY,mBAAoBA,EAAKtM,EAAI,CAAC,EACzC,IAAIqb,EAAUD,EAAO9O,EAAK,EAAGtM,CAAC,EAAGob,EAAO9O,EAAKtM,EAAG,EAAIA,CAAC,CAAC,CACzE,CAGQ,OAAO,QAAQsM,EAAK,CAChB,KAAM,CAAE,EAAAvF,EAAG,EAAA7D,GAAM,IAAI,MAAM,YAAY,MAAOoJ,CAAG,CAAC,EAClD,OAAO,IAAI+O,EAAUtU,EAAG7D,CAAC,CACrC,CACQ,gBAAiB,CACbg4B,SAAY,IAAK,KAAK,EAAGjvB,MAAKmO,CAAW,EACzC8gB,SAAY,IAAK,KAAK,EAAGjvB,MAAKmO,CAAW,CACrD,CACQ,eAAekB,EAAU,CACrB,OAAO,IAAID,EAAU,KAAK,EAAG,KAAK,EAAGC,CAAQ,CACzD,CACQ,iBAAiBC,EAAS,CACtB,KAAM,CAAE,EAAAxU,EAAG,EAAA7D,EAAG,SAAUsY,CAAK,EAAG,KAC1BrY,EAAIsY,EAAc,YAAY,UAAWF,CAAO,CAAC,EACvD,GAAIC,GAAO,MAAQ,CAAC,CAAC,EAAG,EAAG,EAAG,CAAC,EAAE,SAASA,CAAG,EACzC,MAAM,IAAI,MAAM,qBAAqB,EACzC,MAAME,EAAOF,IAAQ,GAAKA,IAAQ,EAAIzU,EAAI8O,EAAM,EAAI9O,EACpD,GAAI2U,GAAQnL,EAAG,MACX,MAAM,IAAI,MAAM,4BAA4B,EAChD,MAAMoL,EAAUH,EAAM,EAAkB,KAAP,KAC3BI,EAAI3E,EAAM,QAAQ0E,EAASZ,EAAcW,CAAI,CAAC,EAC9CG,EAAKpB,EAAKiB,CAAI,EACdI,EAAKtB,EAAK,CAACrX,EAAI0Y,CAAE,EACjBE,EAAKvB,EAAKtX,EAAI2Y,CAAE,EAChB1L,EAAI8G,EAAM,KAAK,qBAAqB2E,EAAGE,EAAIC,CAAE,EACnD,GAAI,CAAC5L,EACD,MAAM,IAAI,MAAM,mBAAmB,EACvC,OAAAA,EAAE,eAAgB,EACXA,CACnB,CAEQ,UAAW,CACP,OAAO8K,EAAsB,KAAK,CAAC,CAC/C,CACQ,YAAa,CACT,OAAO,KAAK,SAAQ,EAAK,IAAII,EAAU,KAAK,EAAGb,EAAK,CAAC,KAAK,CAAC,EAAG,KAAK,QAAQ,EAAI,IAC3F,CAEQ,eAAgB,CACZ,OAAOwB,WAAc,KAAK,UAAU,CAChD,CACQ,UAAW,CACP,OAAO,IAAI,WAAW,CAAE,EAAG,KAAK,EAAG,EAAG,KAAK,EAAG,CAC1D,CAEQ,mBAAoB,CAChB,OAAOA,WAAc,KAAK,cAAc,CACpD,CACQ,cAAe,CACX,OAAOjB,EAAc,KAAK,CAAC,EAAIA,EAAc,KAAK,CAAC,CAC/D,CACA,CACI,MAAM7b,EAAQ,CACV,kBAAkBqY,EAAY,CAC1B,GAAI,CACA,OAAAd,EAAuBc,CAAU,EAC1B,EACvB,MAC0B,CACV,MAAO,EACvB,CACS,EACD,uBAAwBd,EAKxB,iBAAkB,IAAM,CACpB,MAAMpM,EAAS,iBAAiBwL,EAAM,CAAC,EACvC,OAAO,eAAeA,EAAM,YAAYxL,CAAM,EAAGwL,EAAM,CAAC,CAC3D,EASD,WAAWlC,EAAa,EAAGoC,EAAQkB,EAAM,KAAM,CAC3C,OAAAlB,EAAM,eAAepC,CAAU,EAC/BoC,EAAM,SAAS,OAAO,CAAC,CAAC,EACjBA,CACV,CACJ,EAOD,SAASoG,EAAa5E,EAAYwC,EAAe,GAAM,CACnD,OAAO9C,EAAM,eAAeM,CAAU,EAAE,WAAWwC,CAAY,CACvE,CAII,SAASqC,EAAU7I,EAAM,CACrB,MAAMpU,EAAM87B,QAAW1nB,CAAI,EACrB5P,EAAM,OAAO4P,GAAS,SACtBhT,GAAOpB,GAAOwE,IAAQ4P,EAAK,OACjC,OAAIpU,EACOoB,IAAQ8Z,GAAiB9Z,IAAQ+Z,EACxC3W,EACOpD,IAAQ,EAAI8Z,GAAiB9Z,IAAQ,EAAI+Z,EAChD/G,aAAgB0D,CAG5B,CAWI,SAASoF,EAAgBC,EAAUC,EAASxC,EAAe,GAAM,CAC7D,GAAIqC,EAAUE,CAAQ,EAClB,MAAM,IAAI,MAAM,+BAA+B,EACnD,GAAI,CAACF,EAAUG,CAAO,EAClB,MAAM,IAAI,MAAM,+BAA+B,EAEnD,OADUtF,EAAM,QAAQsF,CAAO,EACtB,SAAS9F,EAAuB6F,CAAQ,CAAC,EAAE,WAAWvC,CAAY,CACnF,CAKI,MAAMyC,EAAW3G,EAAM,UACnB,SAAUzO,EAAO,CAEb,GAAIA,EAAM,OAAS,KACf,MAAM,IAAI,MAAM,oBAAoB,EAGxC,MAAMoF,EAAMoK,gBAAmBxP,CAAK,EAC9BqV,EAAQrV,EAAM,OAAS,EAAIyO,EAAM,WACvC,OAAO4G,EAAQ,EAAIjQ,GAAO,OAAOiQ,CAAK,EAAIjQ,CAC7C,EACCiP,EAAgB5F,EAAM,eACxB,SAAUzO,EAAO,CACb,OAAOoT,EAAKgC,EAASpV,CAAK,CAAC,CAC9B,EAECsV,EAAaC,QAAW9G,EAAM,UAAU,EAI9C,SAAS+G,EAAWpQ,EAAK,CACrB0uB,gBAAY,WAAarlB,EAAM,WAAYrJ,EAAKR,MAAK0Q,CAAU,EAExD1B,gBAAmBxO,EAAKqJ,EAAM,WAAW,CACxD,CAMI,SAASgH,EAAQtB,EAAShE,EAAYlG,EAAOyL,EAAgB,CACzD,GAAI,CAAC,YAAa,WAAW,EAAE,KAAMvb,GAAMA,KAAK8P,CAAI,EAChD,MAAM,IAAI,MAAM,qCAAqC,EACzD,KAAM,CAAE,KAAAxM,EAAM,YAAAkE,CAAW,EAAK8M,EAC9B,GAAI,CAAE,KAAAkH,EAAM,QAAAC,EAAS,aAAcC,CAAG,EAAK5L,EACvC0L,GAAQ,OACRA,EAAO,IACXxB,EAAU,YAAY,UAAWA,CAAO,EACxC,mBAAmBlK,CAAI,EACnB2L,IACAzB,EAAU,YAAY,oBAAqB1W,EAAK0W,CAAO,CAAC,GAI5D,MAAM2B,EAAQzB,EAAcF,CAAO,EAC7BtZ,EAAIwU,EAAuBc,CAAU,EACrC4F,EAAW,CAACP,EAAW3a,CAAC,EAAG2a,EAAWM,CAAK,CAAC,EAElD,GAAID,GAAO,MAAQA,IAAQ,GAAO,CAE9B,MAAM/a,EAAI+a,IAAQ,GAAOlU,EAAYwH,EAAG,KAAK,EAAI0M,EACjDE,EAAS,KAAK,YAAY,eAAgBjb,CAAC,CAAC,CACxD,CACQ,MAAMoM,EAAO2H,YAAe,GAAGkH,CAAQ,EACjC7b,EAAI4b,EAEV,SAASE,EAAMC,EAAQ,CAEnB,MAAM9b,EAAIib,EAASa,CAAM,EACzB,GAAI,CAAC9G,EAAmBhV,CAAC,EACrB,OACJ,MAAM+b,EAAK7C,EAAKlZ,CAAC,EACXwO,GAAIkH,EAAM,KAAK,SAAS1V,CAAC,EAAE,WAC3BwF,EAAIyT,EAAKzK,GAAE,CAAC,EAClB,GAAIhJ,IAAMiF,MACN,OAIJ,MAAM9I,EAAIsX,EAAK8C,EAAK9C,EAAKlZ,EAAIyF,EAAI9E,CAAC,CAAC,EACnC,GAAIiB,IAAM8I,MACN,OACJ,IAAIsP,GAAYvL,GAAE,IAAMhJ,EAAI,EAAI,GAAK,OAAOgJ,GAAE,EAAI9D,KAAG,EACjDsR,GAAQra,EACZ,OAAI6Z,GAAQ9B,EAAsB/X,CAAC,IAC/Bqa,GAAQpC,EAAWjY,CAAC,EACpBoY,GAAY,GAET,IAAID,EAAUtU,EAAGwW,GAAOjC,CAAQ,CACnD,CACQ,MAAO,CAAE,KAAAhN,EAAM,MAAA8O,CAAO,CAC9B,CACI,MAAMN,EAAiB,CAAE,KAAMjH,EAAM,KAAM,QAAS,EAAO,EACrD2H,EAAiB,CAAE,KAAM3H,EAAM,KAAM,QAAS,EAAO,EAc3D,SAAS4H,EAAKlC,EAASmC,EAASrM,EAAOyL,EAAgB,CACnD,KAAM,CAAE,KAAAxO,EAAM,MAAA8O,CAAO,EAAGP,EAAQtB,EAASmC,EAASrM,CAAI,EAChDrG,EAAI6K,EAEV,OADa8H,eAAkB3S,EAAE,KAAK,UAAWA,EAAE,YAAaA,EAAE,IAAI,EAC1DsD,EAAM8O,CAAK,CAC/B,CAEInG,EAAM,KAAK,eAAe,CAAC,EAe3B,SAAS2G,EAAOC,EAAWtC,EAASuC,EAAWzM,EAAOmM,EAAgB,OAClE,MAAMO,EAAKF,EACXtC,EAAU,YAAY,UAAWA,CAAO,EACxCuC,EAAY,YAAY,YAAaA,CAAS,EAC9C,KAAM,CAAE,KAAAf,EAAM,QAAAC,EAAS,OAAA1X,CAAQ,EAAG+L,EAGlC,GADA,mBAAmBA,CAAI,EACnB,WAAYA,EACZ,MAAM,IAAI,MAAM,oCAAoC,EACxD,GAAI/L,IAAW,QAAaA,IAAW,WAAaA,IAAW,MAC3D,MAAM,IAAI,MAAM,+BAA+B,EACnD,MAAMm2B,EAAQ,OAAO1d,GAAO,UAAYkd,QAAWld,CAAE,EAC/C2d,EAAQ,CAACD,GACX,CAACn2B,GACD,OAAOyY,GAAO,UACdA,IAAO,MACP,OAAOA,EAAG,GAAM,UAChB,OAAOA,EAAG,GAAM,SACpB,GAAI,CAAC0d,GAAS,CAACC,EACX,MAAM,IAAI,MAAM,0EAA0E,EAC9F,IAAI1d,EACA/N,EACJ,GAAI,CAGA,GAFIyrB,IACA1d,EAAO,IAAI3C,EAAU0C,EAAG,EAAGA,EAAG,CAAC,GAC/B0d,EAAO,CAGP,GAAI,CACIn2B,IAAW,YACX0Y,EAAO3C,EAAU,QAAQ0C,CAAE,EACnD,OACuBE,GAAU,CACb,GAAI,EAAEA,cAAoB,IAAI,KAC1B,MAAMA,EAC9B,CACoB,CAACD,GAAQ1Y,IAAW,QACpB0Y,EAAO3C,EAAU,YAAY0C,CAAE,EACnD,CACY9N,EAAIgH,EAAM,QAAQ6G,CAAS,CACvC,MACsB,CACV,MAAO,EACnB,CAGQ,GAFI,CAACE,GAEDjB,GAAQiB,EAAK,SAAU,EACvB,MAAO,GACPhB,IACAzB,EAAU1F,EAAM,KAAK0F,CAAO,GAChC,KAAM,CAAE,EAAAxU,EAAG,EAAA7D,CAAC,EAAK8a,EACX7a,EAAIsY,EAAcF,CAAO,EACzB2C,EAAKzD,EAAKvX,CAAC,EACX4Y,EAAKtB,EAAKrX,EAAI+a,CAAE,EAChBnC,GAAKvB,EAAKzT,EAAImX,CAAE,EAChBtC,GAAIpb,EAAAyW,EAAM,KAAK,qBAAqBhH,EAAG6L,EAAIC,EAAE,IAAzC,YAAAvb,EAA4C,WACtD,OAAKob,EAEKpB,EAAKoB,EAAE,CAAC,IACL7U,EAFF,EAGnB,CACI,MAAO,CACH,MAAA8O,EACA,aAAAsG,EACA,gBAAAE,EACA,KAAAoB,EACA,OAAAG,EACA,gBAAiB3G,EACjB,UAAAoE,EACA,MAAAnc,CACH,CACL,CC9hCA,sEAKO,SAAS,QAAQ2F,EAAM,CAC1B,MAAO,CACH,KAAAA,EACA,KAAM,CAACH,KAAQoa,IAAS,KAAKja,EAAMH,EAAK4D,cAAY,GAAGwW,CAAI,CAAC,EAC5D,WACH,CACL,CACO,SAAS,YAAY3E,EAAU6E,EAAS,CAC3C,MAAMC,EAAUpa,GAAS,YAAY,CAAE,GAAGsV,EAAU,GAAG,QAAQtV,CAAI,EAAG,EACtE,MAAO,CAAE,GAAGoa,EAAOD,CAAO,EAAG,OAAAC,CAAQ,CACzC,CCPA,sEAQA,MAAM,WAAa,OAAO,oEAAoE,EACxF,WAAa,OAAO,oEAAoE,EACxF,IAAM,OAAO,CAAC,EACd,IAAM,OAAO,CAAC,EACd,WAAa,CAAC5e,EAAGC,KAAOD,EAAIC,EAAI,KAAOA,EAK7C,SAAS,QAAQ+C,EAAG,CAChB,MAAM4M,EAAI,WAEJd,EAAM,OAAO,CAAC,EAAGmQ,EAAM,OAAO,CAAC,EAAGC,EAAO,OAAO,EAAE,EAAGC,EAAO,OAAO,EAAE,EAErEC,EAAO,OAAO,EAAE,EAAGC,EAAO,OAAO,EAAE,EAAGC,EAAO,OAAO,EAAE,EACtDlS,EAAMpK,EAAIA,EAAIA,EAAK4M,EACnBiI,EAAMzK,EAAKA,EAAKpK,EAAK4M,EACrB2P,EAAM,KAAK1H,EAAI/I,EAAKc,CAAC,EAAIiI,EAAMjI,EAC/B4P,EAAM,KAAKD,EAAIzQ,EAAKc,CAAC,EAAIiI,EAAMjI,EAC/B6P,EAAO,KAAKD,EAAI,IAAK5P,CAAC,EAAIxC,EAAMwC,EAChC8P,EAAO,KAAKD,EAAKP,EAAMtP,CAAC,EAAI6P,EAAO7P,EACnC+P,EAAO,KAAKD,EAAKP,EAAMvP,CAAC,EAAI8P,EAAO9P,EACnCgQ,EAAO,KAAKD,EAAKN,EAAMzP,CAAC,EAAI+P,EAAO/P,EACnCiQ,EAAQ,KAAKD,EAAKN,EAAM1P,CAAC,EAAIgQ,EAAOhQ,EACpCkQ,EAAQ,KAAKD,EAAMR,EAAMzP,CAAC,EAAI+P,EAAO/P,EACrCmQ,EAAQ,KAAKD,EAAMhR,EAAKc,CAAC,EAAIiI,EAAMjI,EACnCsI,EAAM,KAAK6H,EAAMX,EAAMxP,CAAC,EAAI8P,EAAO9P,EACnCU,EAAM,KAAK4H,EAAI+G,EAAKrP,CAAC,EAAIxC,EAAMwC,EAC/BO,EAAO,KAAKG,EAAI,IAAKV,CAAC,EAC5B,GAAI,CAAC,KAAK,IAAI,KAAK,IAAIO,CAAI,EAAGnN,CAAC,EAC3B,MAAM,IAAI,MAAM,yBAAyB,EAC7C,OAAOmN,CACX,CACA,MAAM,KAAO,MAAM,WAAY,OAAW,OAAW,CAAE,KAAM,QAAS,EAazD,UAAY,YAAY,CACjC,EAAG,OAAO,CAAC,EACX,EAAG,OAAO,CAAC,EACX,GAAI,KACJ,EAAG,WAEH,GAAI,OAAO,+EAA+E,EAC1F,GAAI,OAAO,+EAA+E,EAC1F,EAAG,OAAO,CAAC,EACX,KAAM,GACN,KAAM,CAEF,KAAM,OAAO,oEAAoE,EACjF,YAAcjP,GAAM,CAChB,MAAMsC,EAAI,WACJyc,EAAK,OAAO,oCAAoC,EAChD9S,EAAK,CAAC,IAAM,OAAO,oCAAoC,EACvD+S,EAAK,OAAO,qCAAqC,EACjD9S,EAAK6S,EACLE,EAAY,OAAO,qCAAqC,EACxD1P,EAAK,WAAWrD,EAAKlM,EAAGsC,CAAC,EACzB4c,EAAK,WAAW,CAACjT,EAAKjM,EAAGsC,CAAC,EAChC,IAAIiV,EAAK,IAAIvX,EAAIuP,EAAKwP,EAAKG,EAAKF,EAAI1c,CAAC,EACjCrC,EAAK,IAAI,CAACsP,EAAKtD,EAAKiT,EAAKhT,EAAI5J,CAAC,EAClC,MAAMgV,EAAQC,EAAK0H,EACbzH,EAAQvX,EAAKgf,EAKnB,GAJI3H,IACAC,EAAKjV,EAAIiV,GACTC,IACAvX,EAAKqC,EAAIrC,GACTsX,EAAK0H,GAAahf,EAAKgf,EACvB,MAAM,IAAI,MAAM,uCAAyCjf,CAAC,EAE9D,MAAO,CAAE,MAAAsX,EAAO,GAAAC,EAAI,MAAAC,EAAO,GAAAvX,CAAI,CAClC,CACJ,CACL,EAAG,MAAM,EAGH,IAAM,OAAO,CAAC,EAEd,qBAAuB,CAAE,EAC/B,SAAS,WAAWof,KAAQC,EAAU,CAClC,IAAIC,EAAO,qBAAqBF,CAAG,EACnC,GAAIE,IAAS,OAAW,CACpB,MAAMC,EAAO,OAAO,WAAW,KAAKH,EAAM5e,GAAMA,EAAE,WAAW,CAAC,CAAC,CAAC,EAChE8e,EAAO,YAAYC,EAAMA,CAAI,EAC7B,qBAAqBH,CAAG,EAAIE,CACpC,CACI,OAAO,OAAO,YAAYA,EAAM,GAAGD,CAAQ,CAAC,CAChD,CAEA,MAAM,aAAgB9K,GAAUA,EAAM,WAAW,EAAI,EAAE,MAAM,CAAC,EACxD,SAAY,GAAM,gBAAgB,EAAG,EAAE,EACvC,KAAQlU,GAAM,IAAIA,EAAG,UAAU,EAC/B,KAAQA,GAAM,IAAIA,EAAG,UAAU,EAC/B,MAAQ,UAAU,gBAClB,QAAU,CAACsO,EAAG9P,EAAGC,IAAM,MAAM,KAAK,qBAAqB6P,EAAG9P,EAAGC,CAAC,EAEpE,SAAS,oBAAoB+gB,EAAM,CAC/B,IAAIC,EAAK,UAAU,MAAM,uBAAuBD,CAAI,EAChDzf,EAAI,MAAM,eAAe0f,CAAE,EAE/B,MAAO,CAAE,OADM1f,EAAE,SAAQ,EAAK0f,EAAK,KAAK,CAACA,CAAE,EAClB,MAAO,aAAa1f,CAAC,CAAG,CACrD,CAKA,SAAS,OAAOC,EAAG,CACf,SAAS,IAAKA,EAAG,IAAK,UAAU,EAChC,MAAM2f,EAAK,KAAK3f,EAAIA,CAAC,EACfG,EAAI,KAAKwf,EAAK3f,EAAI,OAAO,CAAC,CAAC,EACjC,IAAIwB,EAAI,QAAQrB,CAAC,EACbqB,EAAI,MAAQ,MACZA,EAAI,KAAK,CAACA,CAAC,GACf,MAAMzB,EAAI,IAAI,MAAMC,EAAGwB,EAAG,GAAG,EAC7B,OAAAzB,EAAE,eAAgB,EACXA,CACX,CACA,MAAM,IAAM,gBAIZ,SAAS,aAAauD,EAAM,CACxB,OAAO,KAAK,IAAI,WAAW,oBAAqB,GAAGA,CAAI,CAAC,CAAC,CAC7D,CAIA,SAAS,oBAAoBoS,EAAY,CACrC,OAAO,oBAAoBA,CAAU,EAAE,KAC3C,CAKA,SAAS,YAAYoH,EAASpH,EAAYqK,EAAU,YAAY,EAAE,EAAG,CACjE,MAAMtgB,EAAI,YAAY,UAAWqd,CAAO,EAClC,CAAE,MAAOzH,EAAI,OAAQjV,GAAM,oBAAoBsV,CAAU,EACzD,EAAI,YAAY,UAAWqK,EAAS,EAAE,EACtCC,EAAI,SAAS5f,EAAI,IAAI,WAAW,cAAe,CAAC,CAAC,CAAC,EAClD6f,EAAO,WAAW,gBAAiBD,EAAG3K,EAAI5V,CAAC,EAC3CygB,EAAK,KAAK,IAAID,CAAI,CAAC,EACzB,GAAIC,IAAO,IACP,MAAM,IAAI,MAAM,wBAAwB,EAC5C,KAAM,CAAE,MAAOC,EAAI,OAAQzgB,GAAM,oBAAoBwgB,CAAE,EACjD7f,EAAI,UAAU8f,EAAI9K,EAAI5V,CAAC,EACvBiU,EAAM,IAAI,WAAW,EAAE,EAI7B,GAHAA,EAAI,IAAIyM,EAAI,CAAC,EACbzM,EAAI,IAAI,SAAS,KAAKhU,EAAIW,EAAID,CAAC,CAAC,EAAG,EAAE,EAEjC,CAAC,cAAcsT,EAAKjU,EAAG4V,CAAE,EACzB,MAAM,IAAI,MAAM,kCAAkC,EACtD,OAAO3B,CACX,CAKA,SAAS,cAAcsI,EAAWc,EAASb,EAAW,CAClD,MAAMvI,EAAM,YAAY,YAAasI,EAAW,EAAE,EAC5Cvc,EAAI,YAAY,UAAWqd,CAAO,EAClCuD,EAAM,YAAY,YAAapE,EAAW,EAAE,EAClD,GAAI,CACA,MAAM7N,EAAI,OAAO,IAAIiS,CAAG,CAAC,EACnBnb,EAAI,IAAIwO,EAAI,SAAS,EAAG,EAAE,CAAC,EACjC,GAAI,CAAC,QAAQxO,EAAG,IAAK,UAAU,EAC3B,MAAO,GACX,MAAM7D,EAAI,IAAIqS,EAAI,SAAS,GAAI,EAAE,CAAC,EAClC,GAAI,CAAC,QAAQrS,EAAG,IAAK,UAAU,EAC3B,MAAO,GACX,MAAMhB,EAAI,UAAU,SAAS6E,CAAC,EAAG,aAAakJ,CAAC,EAAG3O,CAAC,EAC7Csa,EAAI,QAAQ3L,EAAG/M,EAAG,KAAK,CAAChB,CAAC,CAAC,EAChC,MAAI,GAAC0Z,GAAK,CAACA,EAAE,SAAU,GAAIA,EAAE,WAAW,IAAM7U,EAGtD,MACkB,CACV,MAAO,EACf,CACA,CAYO,MAAM,QAAkC,CAC3C,aAAc,oBACd,KAAM,YACN,OAAQ,cACR,MAAO,CACH,iBAAkB,UAAU,MAAM,iBAClC,OACA,aACA,gBACA,gBACA,WACA,GACH,CACL,8CCvOA,OAAO,eAAe40B,eAAS,aAAc,CAAE,MAAO,EAAI,CAAE,EACxCA,eAAA,aAAG,OACvB,MAAM,YAAa,CACf,YAAYj3B,EAAK0E,EAAO7F,EAAS,CAC7B,KAAM,CAAE,wBAAAq4B,EAA0B,KAAM,KAAAC,EAAO,KAAM,KAAAvC,EAAO,KAAM,eAAAwC,EAAgB,gCAAAC,EAAiC,MAAAC,EAAO,QAAAC,CAAS,EAAG14B,GAAmD,GACzL,GAAI,OAAOq4B,GAA4B,WAClCA,GAA2B,GAAK,OAAO,MAAMA,CAAuB,GACrE,MAAM,IAAI,MAAM,2EAA2E,EAE/F,KAAK,MAAQI,GAA6C,GAC1D,KAAK,QAAUC,GAAmD,KAAK,aACvE,KAAK,IAAMv3B,EACX,KAAK,cAAgB,KAAK,MAAQ,KAAK,QAAQ0E,CAAK,EAAIA,EACxD,KAAK,QAAU,KAAK,MACpB,KAAK,wBAA0BwyB,EAC/B,KAAK,KAAOC,EACZ,KAAK,KAAOvC,EACZ,KAAK,eAAiBwC,EACtB,KAAK,gCAAkCC,CAC1C,CACD,IAAI,OAAQ,CACR,OAAO,KAAK,MAAQ,KAAK,QAAQ,KAAK,aAAa,EAAI,KAAK,aAC/D,CACD,IAAI,WAAY,CACZ,OAAO,OAAO,KAAK,yBAA4B,UAAY,KAAK,IAAK,EAAG,KAAK,QAAU,KAAK,uBAC/F,CACD,iBAAkB,CACd,GAAI,KAAK,eAAgB,CACrB,KAAM,CAAE,IAAAr3B,EAAK,MAAA0E,EAAO,UAAA8yB,CAAS,EAAK,KAClC,KAAK,eAAe,CAAE,IAAAx3B,EAAK,MAAA0E,EAAO,UAAA8yB,CAAW,CAAA,CAChD,CACJ,CACD,uCAAwC,CACpC,GAAI,KAAK,gCAAiC,CACtC,KAAM,CAAE,IAAAx3B,EAAK,MAAA0E,CAAO,EAAG,KACvB,KAAK,gCAAgC,CAAE,IAAA1E,EAAK,MAAA0E,CAAO,CAAA,CACtD,CACJ,CACD,aAAaA,EAAO,CAChB,OAAI,OAAOA,GAAU,WAAa,OAAOA,GAAU,UAAY,OAAOA,GAAU,SACrEA,EAEJ,KAAK,MAAM,KAAK,UAAUA,CAAK,CAAC,CAC1C,CACL,CACoBuyB,eAAA,aAAG,aC7CvB,OAAO,eAAeQ,WAAS,aAAc,CAAE,MAAO,EAAI,CAAE,EAC5CA,WAAA,SAAG,OACnB,MAAM,eAAiBh8B,eASvB,MAAM,QAAS,CAiBX,YAAYoD,EAAS,CACjB,KAAK,YAAc,IAAI,IACvB,KAAK,KAAO,KACZ,KAAK,KAAO,KACZ,KAAM,CAAE,QAAA64B,EAAU,GAAI,wBAAAR,EAA0B,KAAM,eAAAE,EAAgB,gCAAAC,EAAiC,QAAAE,EAAS,MAAAD,CAAO,EAAGz4B,GAAmD,GAC7K,GAAI,OAAO,MAAM64B,CAAO,GAAKA,GAAW,EACpC,MAAM,IAAI,MAAM,iCAAiC,EAErD,GAAI,OAAOR,GAA4B,WAClCA,GAA2B,GAAK,OAAO,MAAMA,CAAuB,GACrE,MAAM,IAAI,MAAM,2EAA2E,EAE/F,KAAK,gBAAkBQ,EACvB,KAAK,wBAA0BR,EAC/B,KAAK,eAAiBE,EACtB,KAAK,gCAAkCC,EACvC,KAAK,MAAQC,EACb,KAAK,QAAUC,CAClB,CAmBD,IAAI,MAAO,CACP,YAAK,WAAU,EACR,KAAK,YAAY,IAC3B,CAkBD,IAAI,eAAgB,CAChB,OAAO,KAAK,gBAAkB,KAAK,IACtC,CAuBD,IAAI,QAAS,CACT,OAAK,KAAK,KAGN,KAAK,KAAK,WACV,KAAK,iCAAiC,KAAK,IAAI,EACxC,KAAK,QAET,KAAK,eAAe,KAAK,IAAI,EANzB,IAOd,CAuBD,IAAI,QAAS,CACT,OAAK,KAAK,KAGN,KAAK,KAAK,WACV,KAAK,iCAAiC,KAAK,IAAI,EACxC,KAAK,QAET,KAAK,eAAe,KAAK,IAAI,EANzB,IAOd,CAoBD,IAAI,SAAU,CACV,OAAO,KAAK,eACf,CACD,IAAI,QAAQ7yB,EAAO,CACf,GAAI,OAAO,MAAMA,CAAK,GAAKA,GAAS,EAChC,MAAM,IAAI,MAAM,iCAAiC,EAErD,KAAK,gBAAkBA,EACvB,KAAK,iBAAgB,CACxB,CAwBD,IAAI1E,EAAK0E,EAAOizB,EAAc,CAC1B,MAAMC,EAAoB,KAAK,YAAY,IAAI53B,CAAG,EAC9C43B,GACA,KAAK,iCAAiCA,CAAiB,EAE3D,MAAMC,EAAO,IAAI,eAAe,aAAa73B,EAAK0E,EAAO,CACrD,wBAAyB,KAAK,wBAC9B,eAAgB,KAAK,eACrB,gCAAiC,KAAK,gCACtC,MAAO,KAAK,MACZ,QAAS,KAAK,QACd,GAAGizB,CACf,CAAS,EACD,YAAK,cAAcE,CAAI,EACvB,KAAK,YAAY,IAAI73B,EAAK63B,CAAI,EAC9B,KAAK,iBAAgB,EACd,IACV,CAuBD,IAAI73B,EAAK,CACL,MAAM63B,EAAO,KAAK,YAAY,IAAI73B,CAAG,EACrC,OAAK63B,EAGDA,EAAK,WACL,KAAK,iCAAiCA,CAAI,EACnC,OAEX,KAAK,cAAcA,CAAI,EAChBA,EAAK,OAPD,IAQd,CAwBD,KAAK73B,EAAK,CACN,MAAM63B,EAAO,KAAK,YAAY,IAAI73B,CAAG,EACrC,OAAK63B,EAGDA,EAAK,WACL,KAAK,iCAAiCA,CAAI,EACnC,MAEJA,EAAK,MAND,IAOd,CAuBD,OAAO73B,EAAK,CACR,MAAM63B,EAAO,KAAK,YAAY,IAAI73B,CAAG,EACrC,OAAK63B,EAGE,KAAK,iCAAiCA,CAAI,EAFtC,EAGd,CAwBD,IAAI73B,EAAK,CACL,MAAM63B,EAAO,KAAK,YAAY,IAAI73B,CAAG,EACrC,OAAK63B,EAGDA,EAAK,WACL,KAAK,iCAAiCA,CAAI,EACnC,IAEJ,GANI,EAOd,CAeD,OAAQ,CACJ,KAAK,KAAO,KACZ,KAAK,KAAO,KACZ,KAAK,YAAY,OACpB,CAiCD,KAAKjpB,EAAW,CACZ,IAAIipB,EAAO,KAAK,KAChB,KAAOA,GAAM,CACT,GAAIA,EAAK,UAAW,CAChB,MAAMV,EAAOU,EAAK,KAClB,KAAK,iCAAiCA,CAAI,EAC1CA,EAAOV,EACP,QACH,CACD,MAAMrL,EAAQ,KAAK,eAAe+L,CAAI,EACtC,GAAIjpB,EAAUkd,CAAK,EACf,YAAK,cAAc+L,CAAI,EAChB/L,EAEX+L,EAAOA,EAAK,IACf,CACD,OAAO,IACV,CAqBD,QAAQC,EAAU,CACd,IAAID,EAAO,KAAK,KACZn9B,EAAQ,EACZ,KAAOm9B,GAAM,CACT,GAAIA,EAAK,UAAW,CAChB,MAAMV,EAAOU,EAAK,KAClB,KAAK,iCAAiCA,CAAI,EAC1CA,EAAOV,EACP,QACH,CACDW,EAASD,EAAK,MAAOA,EAAK,IAAKn9B,CAAK,EACpCm9B,EAAOA,EAAK,KACZn9B,GACH,CACJ,CAqBD,CAAC,QAAS,CACN,IAAIm9B,EAAO,KAAK,KAChB,KAAOA,GAAM,CACT,GAAIA,EAAK,UAAW,CAChB,MAAMV,EAAOU,EAAK,KAClB,KAAK,iCAAiCA,CAAI,EAC1CA,EAAOV,EACP,QACH,CACD,MAAMU,EAAK,MACXA,EAAOA,EAAK,IACf,CACJ,CAqBD,CAAC,MAAO,CACJ,IAAIA,EAAO,KAAK,KAChB,KAAOA,GAAM,CACT,GAAIA,EAAK,UAAW,CAChB,MAAMV,EAAOU,EAAK,KAClB,KAAK,iCAAiCA,CAAI,EAC1CA,EAAOV,EACP,QACH,CACD,MAAMU,EAAK,IACXA,EAAOA,EAAK,IACf,CACJ,CAsBD,CAAC,SAAU,CACP,IAAIA,EAAO,KAAK,KAChB,KAAOA,GAAM,CACT,GAAIA,EAAK,UAAW,CAChB,MAAMV,EAAOU,EAAK,KAClB,KAAK,iCAAiCA,CAAI,EAC1CA,EAAOV,EACP,QACH,CACD,MAAM,KAAK,eAAeU,CAAI,EAC9BA,EAAOA,EAAK,IACf,CACJ,CAsBD,EAAE,OAAO,QAAQ,GAAI,CACjB,IAAIA,EAAO,KAAK,KAChB,KAAOA,GAAM,CACT,GAAIA,EAAK,UAAW,CAChB,MAAMV,EAAOU,EAAK,KAClB,KAAK,iCAAiCA,CAAI,EAC1CA,EAAOV,EACP,QACH,CACD,MAAM,KAAK,eAAeU,CAAI,EAC9BA,EAAOA,EAAK,IACf,CACJ,CACD,kBAAmB,CACf,IAAIA,EAAO,KAAK,KAChB,KAAOA,IAAS,MAAQ,KAAK,KAAO,KAAK,iBAAiB,CACtD,MAAMjD,EAAOiD,EAAK,KAClB,KAAK,iCAAiCA,CAAI,EAC1CA,EAAOjD,CACV,CACJ,CACD,eAAe,CAAE,IAAA50B,EAAK,MAAA0E,GAAS,CAC3B,MAAO,CACH,IAAA1E,EACA,MAAA0E,CACZ,CACK,CACD,cAAcmzB,EAAM,CAChB,KAAK,mBAAmBA,CAAI,EACvB,KAAK,MAKNA,EAAK,KAAO,KAAK,KACjB,KAAK,KAAK,KAAOA,EACjB,KAAK,KAAOA,IANZ,KAAK,KAAOA,EACZ,KAAK,KAAOA,GAOhBA,EAAK,sCAAqC,CAC7C,CACD,mBAAmBA,EAAM,CACjBA,EAAK,OAAS,OACdA,EAAK,KAAK,KAAOA,EAAK,MAEtBA,EAAK,OAAS,OACdA,EAAK,KAAK,KAAOA,EAAK,MAEtB,KAAK,OAASA,IACd,KAAK,KAAOA,EAAK,MAEjB,KAAK,OAASA,IACd,KAAK,KAAOA,EAAK,MAErBA,EAAK,KAAO,KACZA,EAAK,KAAO,IACf,CACD,iCAAiCA,EAAM,CACnC,OAAAA,EAAK,gBAAe,EACpB,KAAK,mBAAmBA,CAAI,EACrB,KAAK,YAAY,OAAOA,EAAK,GAAG,CAC1C,CACD,YAAa,CAET,GAAI,CAAC,KAAK,wBACN,OAEJ,MAAME,EAAe,CAAA,EACrB,UAAWF,KAAQ,KAAK,YAAY,OAAM,EAClCA,EAAK,WACLE,EAAa,KAAKF,CAAI,EAG9BE,EAAa,QAAQF,GAAQ,KAAK,iCAAiCA,CAAI,CAAC,CAC3E,CACL,CACgBJ,WAAA,SAAG,sBC9oBnB,IAAI/6B,EAAmBxB,gBAAQA,eAAK,kBAAqB,OAAO,OAAU,SAASyB,EAAGC,EAAGC,EAAGC,EAAI,CACxFA,IAAO,SAAWA,EAAKD,GAC3B,IAAIE,EAAO,OAAO,yBAAyBH,EAAGC,CAAC,GAC3C,CAACE,IAAS,QAASA,EAAO,CAACH,EAAE,WAAaG,EAAK,UAAYA,EAAK,iBAClEA,EAAO,CAAE,WAAY,GAAM,IAAK,UAAW,CAAE,OAAOH,EAAEC,CAAC,CAAE,IAE3D,OAAO,eAAeF,EAAGG,EAAIC,CAAI,CACpC,EAAK,SAASJ,EAAGC,EAAGC,EAAGC,EAAI,CACpBA,IAAO,SAAWA,EAAKD,GAC3BF,EAAEG,CAAE,EAAIF,EAAEC,CAAC,CACd,GACGG,EAAgB9B,gBAAQA,eAAK,cAAiB,SAAS0B,EAAGK,EAAS,CACnE,QAASC,KAAKN,EAAOM,IAAM,WAAa,CAAC,OAAO,UAAU,eAAe,KAAKD,EAASC,CAAC,GAAGR,EAAgBO,EAASL,EAAGM,CAAC,CAC5H,EACA,OAAO,eAAcD,EAAU,aAAc,CAAE,MAAO,EAAI,CAAE,EAC5DD,EAAavB,WAAuBwB,CAAO,kCCf3C,oEACA,OAAO,eAAcA,EAAU,aAAc,CAAE,MAAO,GAAM,EAC5DA,EAAgB,MAAAA,EAAA,cAAwBA,MAAcA,EAAwB,cAAAA,EAAA,IAAcA,OAAeA,EAAkB,QAAAA,EAAA,OAAiBA,EAAsB,YAAAA,EAAA,UAAoBA,EAAoB,UAAAA,EAAA,aAAuBA,SAAiBA,EAAoB,UAAAA,EAAA,OAAiBA,kBAA0BA,EAAoB,UAAAA,EAAA,OAAiBA,SAAiBA,EAAgB,MAAAA,EAAA,aAAuB,OAChZ,SAAS+6B,EAAa74B,EAAG,CACrB,GAAI,CAAC,OAAO,cAAcA,CAAC,EACvB,MAAM,IAAI,MAAM,kBAAkBA,CAAC,EAAE,EAE7ClC,EAAA,aAAuB+6B,EACvB,SAASC,KAASx3B,EAAM,CACpB,MAAMkd,EAAO,CAAChiB,EAAGC,IAAO0B,GAAM3B,EAAEC,EAAE0B,CAAC,CAAC,EAC9BsgB,EAAS,MAAM,KAAKnd,CAAI,EACzB,QAAO,EACP,OAAO,CAACyM,EAAKrS,IAAOqS,EAAMyQ,EAAKzQ,EAAKrS,EAAE,MAAM,EAAIA,EAAE,OAAS,MAAS,EACnEgjB,EAASpd,EAAK,OAAO,CAACyM,EAAKrS,IAAOqS,EAAMyQ,EAAKzQ,EAAKrS,EAAE,MAAM,EAAIA,EAAE,OAAS,MAAS,EACxF,MAAO,CAAE,OAAA+iB,EAAQ,OAAAC,CAAQ,EAE7B,SAASC,EAASA,EAAU,CACxB,MAAO,CACH,OAASC,GAAW,CAChB,GAAI,CAAC,MAAM,QAAQA,CAAM,GAAMA,EAAO,QAAU,OAAOA,EAAO,CAAC,GAAM,SACjE,MAAM,IAAI,MAAM,qDAAqD,EACzE,OAAOA,EAAO,IAAKljB,GAAM,CAErB,GADAm9B,EAAan9B,CAAC,EACVA,EAAI,GAAKA,GAAKijB,EAAS,OACvB,MAAM,IAAI,MAAM,iCAAiCjjB,CAAC,eAAeijB,EAAS,MAAM,GAAG,EACvF,OAAOA,EAASjjB,CAAC,CACjC,CAAa,CACJ,EACD,OAASmjB,GAAU,CACf,GAAI,CAAC,MAAM,QAAQA,CAAK,GAAMA,EAAM,QAAU,OAAOA,EAAM,CAAC,GAAM,SAC9D,MAAM,IAAI,MAAM,kDAAkD,EACtE,OAAOA,EAAM,IAAKC,GAAW,CACzB,GAAI,OAAOA,GAAW,SAClB,MAAM,IAAI,MAAM,uCAAuCA,CAAM,EAAE,EACnE,MAAMvjB,EAAQojB,EAAS,QAAQG,CAAM,EACrC,GAAIvjB,IAAU,GACV,MAAM,IAAI,MAAM,oBAAoBujB,CAAM,eAAeH,CAAQ,EAAE,EACvE,OAAOpjB,CACvB,CAAa,CACJ,CACJ,EAEL,SAASw9B,EAAKha,EAAY,GAAI,CAC1B,GAAI,OAAOA,GAAc,SACrB,MAAM,IAAI,MAAM,iCAAiC,EACrD,MAAO,CACH,OAAS9iB,GAAS,CACd,GAAI,CAAC,MAAM,QAAQA,CAAI,GAAMA,EAAK,QAAU,OAAOA,EAAK,CAAC,GAAM,SAC3D,MAAM,IAAI,MAAM,8CAA8C,EAClE,QAASP,KAAKO,EACV,GAAI,OAAOP,GAAM,SACb,MAAM,IAAI,MAAM,iCAAiCA,CAAC,EAAE,EAC5D,OAAOO,EAAK,KAAK8iB,CAAS,CAC7B,EACD,OAAS/iB,GAAO,CACZ,GAAI,OAAOA,GAAO,SACd,MAAM,IAAI,MAAM,oCAAoC,EACxD,OAAOA,EAAG,MAAM+iB,CAAS,CAC5B,CACJ,EAEL,SAASS,EAAQjQ,EAAMyP,EAAM,IAAK,CAE9B,GADA6Z,EAAatpB,CAAI,EACb,OAAOyP,GAAQ,SACf,MAAM,IAAI,MAAM,8BAA8B,EAClD,MAAO,CACH,OAAOxa,EAAM,CACT,GAAI,CAAC,MAAM,QAAQA,CAAI,GAAMA,EAAK,QAAU,OAAOA,EAAK,CAAC,GAAM,SAC3D,MAAM,IAAI,MAAM,iDAAiD,EACrE,QAAS9I,KAAK8I,EACV,GAAI,OAAO9I,GAAM,SACb,MAAM,IAAI,MAAM,oCAAoCA,CAAC,EAAE,EAC/D,KAAQ8I,EAAK,OAAS+K,EAAQ,GAC1B/K,EAAK,KAAKwa,CAAG,EACjB,OAAOxa,CACV,EACD,OAAOqa,EAAO,CACV,GAAI,CAAC,MAAM,QAAQA,CAAK,GAAMA,EAAM,QAAU,OAAOA,EAAM,CAAC,GAAM,SAC9D,MAAM,IAAI,MAAM,iDAAiD,EACrE,QAASnjB,KAAKmjB,EACV,GAAI,OAAOnjB,GAAM,SACb,MAAM,IAAI,MAAM,oCAAoCA,CAAC,EAAE,EAC/D,IAAIujB,EAAMJ,EAAM,OAChB,GAAKI,EAAM1P,EAAQ,EACf,MAAM,IAAI,MAAM,2DAA2D,EAC/E,KAAO0P,EAAM,GAAKJ,EAAMI,EAAM,CAAC,IAAMD,EAAKC,IACtC,GAAI,GAAIA,EAAM,GAAK1P,EAAQ,GACvB,MAAM,IAAI,MAAM,8CAA8C,EAEtE,OAAOsP,EAAM,MAAM,EAAGI,CAAG,CAC5B,CACJ,EAEL,SAASC,EAAUC,EAAI,CACnB,GAAI,OAAOA,GAAO,WACd,MAAM,IAAI,MAAM,iCAAiC,EACrD,MAAO,CAAE,OAASljB,GAASA,EAAM,OAASD,GAAOmjB,EAAGnjB,CAAE,CAAG,EAE7D,SAASg9B,EAAax0B,EAAMvI,EAAMD,EAAI,CAClC,GAAIC,EAAO,EACP,MAAM,IAAI,MAAM,4BAA4BA,CAAI,8BAA8B,EAClF,GAAID,EAAK,EACL,MAAM,IAAI,MAAM,0BAA0BA,CAAE,8BAA8B,EAC9E,GAAI,CAAC,MAAM,QAAQwI,CAAI,EACnB,MAAM,IAAI,MAAM,oCAAoC,EACxD,GAAI,CAACA,EAAK,OACN,MAAO,CAAE,EACb,IAAIyB,EAAM,EACV,MAAMM,EAAM,CAAE,EACRqY,EAAS,MAAM,KAAKpa,CAAI,EAM9B,IALAoa,EAAO,QAASxgB,GAAM,CAElB,GADAy6B,EAAaz6B,CAAC,EACVA,EAAI,GAAKA,GAAKnC,EACd,MAAM,IAAI,MAAM,kBAAkBmC,CAAC,EAAE,CACjD,CAAK,IACY,CACT,IAAIghB,EAAQ,EACRC,EAAO,GACX,QAAS3jB,EAAIuK,EAAKvK,EAAIkjB,EAAO,OAAQljB,IAAK,CACtC,MAAM4jB,EAAQV,EAAOljB,CAAC,EAChB6jB,EAAYtjB,EAAOmjB,EAAQE,EACjC,GAAI,CAAC,OAAO,cAAcC,CAAS,GAC9BtjB,EAAOmjB,EAASnjB,IAASmjB,GAC1BG,EAAYD,IAAUrjB,EAAOmjB,EAC7B,MAAM,IAAI,MAAM,8BAA8B,EAIlD,GAFAA,EAAQG,EAAYvjB,EACpB4iB,EAAOljB,CAAC,EAAI,KAAK,MAAM6jB,EAAYvjB,CAAE,EACjC,CAAC,OAAO,cAAc4iB,EAAOljB,CAAC,CAAC,GAAKkjB,EAAOljB,CAAC,EAAIM,EAAKojB,IAAUG,EAC/D,MAAM,IAAI,MAAM,8BAA8B,EAClD,GAAKF,EAEKT,EAAOljB,CAAC,EAGd2jB,EAAO,GAFPpZ,EAAMvK,MAFN,UAOR,GADA6K,EAAI,KAAK6Y,CAAK,EACVC,EACA,MAER,QAAS3jB,EAAI,EAAGA,EAAI8I,EAAK,OAAS,GAAKA,EAAK9I,CAAC,IAAM,EAAGA,IAClD6K,EAAI,KAAK,CAAC,EACd,OAAOA,EAAI,QAAS,EAExB,MAAM0yB,EAAM,CAACz8B,EAAGC,IAAQA,EAAQw8B,EAAIx8B,EAAGD,EAAIC,CAAC,EAAhBD,EACtB08B,EAAc,CAACj9B,EAAMD,IAAOC,GAAQD,EAAKi9B,EAAIh9B,EAAMD,CAAE,GAC3D,SAASm9B,EAAc30B,EAAMvI,EAAMD,EAAIwjB,EAAS,CAC5C,GAAI,CAAC,MAAM,QAAQhb,CAAI,EACnB,MAAM,IAAI,MAAM,qCAAqC,EACzD,GAAIvI,GAAQ,GAAKA,EAAO,GACpB,MAAM,IAAI,MAAM,6BAA6BA,CAAI,EAAE,EACvD,GAAID,GAAM,GAAKA,EAAK,GAChB,MAAM,IAAI,MAAM,2BAA2BA,CAAE,EAAE,EACnD,GAAIk9B,EAAYj9B,EAAMD,CAAE,EAAI,GACxB,MAAM,IAAI,MAAM,sCAAsCC,CAAI,OAAOD,CAAE,cAAck9B,EAAYj9B,EAAMD,CAAE,CAAC,EAAE,EAE5G,IAAIojB,EAAQ,EACRnZ,EAAM,EACV,MAAMmK,EAAO,GAAKpU,EAAK,EACjBuK,EAAM,CAAE,EACd,UAAWvG,KAAKwE,EAAM,CAElB,GADAq0B,EAAa74B,CAAC,EACVA,GAAK,GAAK/D,EACV,MAAM,IAAI,MAAM,oCAAoC+D,CAAC,SAAS/D,CAAI,EAAE,EAExE,GADAmjB,EAASA,GAASnjB,EAAQ+D,EACtBiG,EAAMhK,EAAO,GACb,MAAM,IAAI,MAAM,qCAAqCgK,CAAG,SAAShK,CAAI,EAAE,EAE3E,IADAgK,GAAOhK,EACAgK,GAAOjK,EAAIiK,GAAOjK,EACrBuK,EAAI,MAAO6Y,GAAUnZ,EAAMjK,EAAOoU,KAAU,CAAC,EACjDgP,GAAS,GAAKnZ,EAAM,EAGxB,GADAmZ,EAASA,GAAUpjB,EAAKiK,EAAQmK,EAC5B,CAACoP,GAAWvZ,GAAOhK,EACnB,MAAM,IAAI,MAAM,gBAAgB,EACpC,GAAI,CAACujB,GAAWJ,EACZ,MAAM,IAAI,MAAM,qBAAqBA,CAAK,EAAE,EAChD,OAAII,GAAWvZ,EAAM,GACjBM,EAAI,KAAK6Y,IAAU,CAAC,EACjB7Y,EAEX,SAAS6yB,EAAMzwB,EAAK,CAChB,OAAAkwB,EAAalwB,CAAG,EACT,CACH,OAASpF,GAAU,CACf,GAAI,EAAEA,aAAiB,YACnB,MAAM,IAAI,MAAM,yCAAyC,EAC7D,OAAOy1B,EAAa,MAAM,KAAKz1B,CAAK,EAAG,GAAK,EAAGoF,CAAG,CACrD,EACD,OAASiW,GAAW,CAChB,GAAI,CAAC,MAAM,QAAQA,CAAM,GAAMA,EAAO,QAAU,OAAOA,EAAO,CAAC,GAAM,SACjE,MAAM,IAAI,MAAM,+CAA+C,EACnE,OAAO,WAAW,KAAKoa,EAAapa,EAAQjW,EAAK,GAAK,CAAC,CAAC,CAC3D,CACJ,EAEL,SAAS0wB,EAAO9pB,EAAMkQ,EAAa,GAAO,CAEtC,GADAoZ,EAAatpB,CAAI,EACbA,GAAQ,GAAKA,EAAO,GACpB,MAAM,IAAI,MAAM,mCAAmC,EACvD,GAAI2pB,EAAY,EAAG3pB,CAAI,EAAI,IAAM2pB,EAAY3pB,EAAM,CAAC,EAAI,GACpD,MAAM,IAAI,MAAM,wBAAwB,EAC5C,MAAO,CACH,OAAShM,GAAU,CACf,GAAI,EAAEA,aAAiB,YACnB,MAAM,IAAI,MAAM,0CAA0C,EAC9D,OAAO41B,EAAc,MAAM,KAAK51B,CAAK,EAAG,EAAGgM,EAAM,CAACkQ,CAAU,CAC/D,EACD,OAASb,GAAW,CAChB,GAAI,CAAC,MAAM,QAAQA,CAAM,GAAMA,EAAO,QAAU,OAAOA,EAAO,CAAC,GAAM,SACjE,MAAM,IAAI,MAAM,gDAAgD,EACpE,OAAO,WAAW,KAAKua,EAAcva,EAAQrP,EAAM,EAAGkQ,CAAU,CAAC,CACpE,CACJ,EAEL,SAAS6Z,EAAcna,EAAI,CACvB,GAAI,OAAOA,GAAO,WACd,MAAM,IAAI,MAAM,qCAAqC,EACzD,OAAO,YAAa7d,EAAM,CACtB,GAAI,CACA,OAAO6d,EAAG,MAAM,KAAM7d,CAAI,OAEpB,CAAA,CACb,EAEL,SAASi4B,EAAS78B,EAAKyiB,EAAI,CAEvB,GADA0Z,EAAan8B,CAAG,EACZ,OAAOyiB,GAAO,WACd,MAAM,IAAI,MAAM,gCAAgC,EACpD,MAAO,CACH,OAAO3a,EAAM,CACT,GAAI,EAAEA,aAAgB,YAClB,MAAM,IAAI,MAAM,6CAA6C,EACjE,MAAM+0B,EAAWpa,EAAG3a,CAAI,EAAE,MAAM,EAAG9H,CAAG,EAChC6J,EAAM,IAAI,WAAW/B,EAAK,OAAS9H,CAAG,EAC5C,OAAA6J,EAAI,IAAI/B,CAAI,EACZ+B,EAAI,IAAIgzB,EAAU/0B,EAAK,MAAM,EACtB+B,CACV,EACD,OAAO/B,EAAM,CACT,GAAI,EAAEA,aAAgB,YAClB,MAAM,IAAI,MAAM,6CAA6C,EACjE,MAAM2lB,EAAU3lB,EAAK,MAAM,EAAG,CAAC9H,CAAG,EAC5B88B,EAAcra,EAAGgL,CAAO,EAAE,MAAM,EAAGztB,CAAG,EACtC+8B,EAAcj1B,EAAK,MAAM,CAAC9H,CAAG,EACnC,QAAShB,EAAI,EAAGA,EAAIgB,EAAKhB,IACrB,GAAI89B,EAAY99B,CAAC,IAAM+9B,EAAY/9B,CAAC,EAChC,MAAM,IAAI,MAAM,kBAAkB,EAC1C,OAAOyuB,CACV,CACJ,EAELrsB,EAAA,MAAgB,CAAE,SAAA6gB,EAAU,MAAAma,EAAO,SAAAS,EAAU,MAAAH,EAAO,OAAAC,EAAQ,KAAAN,EAAM,QAAAvZ,CAAS,EAC3E1hB,EAAA,OAAiBg7B,EAAMO,EAAO,CAAC,EAAG1a,EAAS,kBAAkB,EAAGoa,EAAK,EAAE,CAAC,EACxEj7B,EAAiB,OAAAg7B,EAAMO,EAAO,CAAC,EAAG1a,EAAS,kCAAkC,EAAGa,EAAQ,CAAC,EAAGuZ,EAAK,EAAE,CAAC,EACpGj7B,EAAoB,UAAAg7B,EAAMO,EAAO,CAAC,EAAG1a,EAAS,kCAAkC,EAAGa,EAAQ,CAAC,EAAGuZ,EAAK,EAAE,CAAC,EACvGj7B,EAAA,gBAA0Bg7B,EAAMO,EAAO,CAAC,EAAG1a,EAAS,kCAAkC,EAAGoa,EAAK,EAAE,EAAG7Z,EAAW7f,GAAMA,EAAE,YAAa,EAAC,QAAQ,KAAM,GAAG,EAAE,QAAQ,QAAS,GAAG,CAAC,CAAC,EAC7KvB,EAAiB,OAAAg7B,EAAMO,EAAO,CAAC,EAAG1a,EAAS,kEAAkE,EAAGa,EAAQ,CAAC,EAAGuZ,EAAK,EAAE,CAAC,EACpIj7B,EAAoB,UAAAg7B,EAAMO,EAAO,CAAC,EAAG1a,EAAS,kEAAkE,EAAGa,EAAQ,CAAC,EAAGuZ,EAAK,EAAE,CAAC,EACvI,MAAMW,EAAaha,GAAQoZ,EAAMM,EAAM,EAAE,EAAGza,EAASe,CAAG,EAAGqZ,EAAK,EAAE,CAAC,EACnEj7B,EAAA,OAAiB47B,EAAU,4DAA4D,EACvF57B,EAAA,aAAuB47B,EAAU,4DAA4D,EAC7F57B,EAAA,UAAoB47B,EAAU,4DAA4D,EAC1F,MAAMC,EAAgB,CAAC,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,GAAI,EAAE,EAClD77B,EAAoB,UAAA,CAChB,OAAO0G,EAAM,CACT,IAAI+B,EAAM,GACV,QAAS7K,EAAI,EAAGA,EAAI8I,EAAK,OAAQ9I,GAAK,EAAG,CACrC,MAAMikB,EAAQnb,EAAK,SAAS9I,EAAGA,EAAI,CAAC,EACpC6K,GAAOzI,EAAQ,OAAO,OAAO6hB,CAAK,EAAE,SAASga,EAAcha,EAAM,MAAM,EAAG,GAAG,EAEjF,OAAOpZ,CACV,EACD,OAAOzG,EAAK,CACR,IAAIyG,EAAM,CAAE,EACZ,QAAS7K,EAAI,EAAGA,EAAIoE,EAAI,OAAQpE,GAAK,GAAI,CACrC,MAAMiW,EAAQ7R,EAAI,MAAMpE,EAAGA,EAAI,EAAE,EAC3BmK,EAAW8zB,EAAc,QAAQhoB,EAAM,MAAM,EAC7CgO,EAAQ7hB,EAAQ,OAAO,OAAO6T,CAAK,EACzC,QAAS5I,EAAI,EAAGA,EAAI4W,EAAM,OAAS9Z,EAAUkD,IACzC,GAAI4W,EAAM5W,CAAC,IAAM,EACb,MAAM,IAAI,MAAM,0BAA0B,EAElDxC,EAAMA,EAAI,OAAO,MAAM,KAAKoZ,EAAM,MAAMA,EAAM,OAAS9Z,CAAQ,CAAC,CAAC,EAErE,OAAO,WAAW,KAAKU,CAAG,CAC7B,CACJ,EACD,MAAMqzB,EAAe3xB,GAAW6wB,EAAMS,EAAS,EAAI/0B,GAASyD,EAAOA,EAAOzD,CAAI,CAAC,CAAC,EAAG1G,EAAQ,MAAM,EACjGA,EAAA,YAAsB87B,EACtB,MAAMC,EAAgBf,EAAMna,EAAS,kCAAkC,EAAGoa,EAAK,EAAE,CAAC,EAC5Ee,EAAqB,CAAC,UAAY,UAAY,UAAY,WAAY,SAAU,EACtF,SAASC,EAAcna,EAAK,CACxB,MAAMnjB,EAAImjB,GAAO,GACjB,IAAIC,GAAOD,EAAM,WAAc,EAC/B,QAASlkB,EAAI,EAAGA,EAAIo+B,EAAmB,OAAQp+B,KACrCe,GAAKf,EAAK,KAAO,IACnBmkB,GAAOia,EAAmBp+B,CAAC,GAEnC,OAAOmkB,EAEX,SAASma,EAAaliB,EAAQgI,EAAOC,EAAgB,EAAG,CACpD,MAAMrjB,EAAMob,EAAO,OACnB,IAAI+H,EAAM,EACV,QAASnkB,EAAI,EAAGA,EAAIgB,EAAKhB,IAAK,CAC1B,MAAMyC,EAAI2Z,EAAO,WAAWpc,CAAC,EAC7B,GAAIyC,EAAI,IAAMA,EAAI,IACd,MAAM,IAAI,MAAM,mBAAmB2Z,CAAM,GAAG,EAChD+H,EAAMka,EAAcla,CAAG,EAAK1hB,GAAK,EAErC0hB,EAAMka,EAAcla,CAAG,EACvB,QAASnkB,EAAI,EAAGA,EAAIgB,EAAKhB,IACrBmkB,EAAMka,EAAcla,CAAG,EAAK/H,EAAO,WAAWpc,CAAC,EAAI,GACvD,QAAS,KAAKokB,EACVD,EAAMka,EAAcla,CAAG,EAAI,EAC/B,QAASnkB,EAAI,EAAGA,EAAI,EAAGA,IACnBmkB,EAAMka,EAAcla,CAAG,EAC3B,OAAAA,GAAOE,EACA8Z,EAAc,OAAOV,EAAc,CAACtZ,EAAM,GAAK,EAAE,EAAG,GAAI,EAAG,EAAK,CAAC,EAE5E,SAASoa,EAAUja,EAAU,CACzB,MAAMC,EAAiBD,IAAa,SAAW,EAAI,UAC7CE,EAASmZ,EAAO,CAAC,EACjBlZ,EAAYD,EAAO,OACnBE,EAAUF,EAAO,OACjBG,EAAkBiZ,EAAcnZ,CAAS,EAC/C,SAAS1B,EAAO3G,EAAQgI,EAAOQ,EAAQ,GAAI,CACvC,GAAI,OAAOxI,GAAW,SAClB,MAAM,IAAI,MAAM,8CAA8C,OAAOA,CAAM,EAAE,EACjF,GAAI,CAAC,MAAM,QAAQgI,CAAK,GAAMA,EAAM,QAAU,OAAOA,EAAM,CAAC,GAAM,SAC9D,MAAM,IAAI,MAAM,uDAAuD,OAAOA,CAAK,EAAE,EACzF,MAAMS,EAAezI,EAAO,OAAS,EAAIgI,EAAM,OAC/C,GAAIQ,IAAU,IAASC,EAAeD,EAClC,MAAM,IAAI,UAAU,UAAUC,CAAY,kBAAkBD,CAAK,EAAE,EACvE,OAAAxI,EAASA,EAAO,YAAa,EACtB,GAAGA,CAAM,IAAI+hB,EAAc,OAAO/Z,CAAK,CAAC,GAAGka,EAAaliB,EAAQgI,EAAOG,CAAc,CAAC,GAEjG,SAASvB,EAAO5e,EAAKwgB,EAAQ,GAAI,CAC7B,GAAI,OAAOxgB,GAAQ,SACf,MAAM,IAAI,MAAM,6CAA6C,OAAOA,CAAG,EAAE,EAC7E,GAAIA,EAAI,OAAS,GAAMwgB,IAAU,IAASxgB,EAAI,OAASwgB,EACnD,MAAM,IAAI,UAAU,wBAAwBxgB,EAAI,MAAM,KAAKA,CAAG,mBAAmBwgB,CAAK,GAAG,EAC7F,MAAME,EAAU1gB,EAAI,YAAa,EACjC,GAAIA,IAAQ0gB,GAAW1gB,IAAQA,EAAI,YAAa,EAC5C,MAAM,IAAI,MAAM,uCAAuC,EAC3DA,EAAM0gB,EACN,MAAMC,EAAW3gB,EAAI,YAAY,GAAG,EACpC,GAAI2gB,IAAa,GAAKA,IAAa,GAC/B,MAAM,IAAI,MAAM,yDAAyD,EAC7E,MAAM3I,EAAShY,EAAI,MAAM,EAAG2gB,CAAQ,EAC9BP,EAASpgB,EAAI,MAAM2gB,EAAW,CAAC,EACrC,GAAIP,EAAO,OAAS,EAChB,MAAM,IAAI,MAAM,yCAAyC,EAC7D,MAAMJ,EAAQ+Z,EAAc,OAAO3Z,CAAM,EAAE,MAAM,EAAG,EAAE,EAChDvb,EAAMq1B,EAAaliB,EAAQgI,EAAOG,CAAc,EACtD,GAAI,CAACC,EAAO,SAASvb,CAAG,EACpB,MAAM,IAAI,MAAM,uBAAuB7E,CAAG,eAAe6E,CAAG,GAAG,EACnE,MAAO,CAAE,OAAAmT,EAAQ,MAAAgI,CAAO,EAE5B,MAAMY,EAAe4Y,EAAc5a,CAAM,EACzC,SAASiC,EAAc7gB,EAAK,CACxB,KAAM,CAAE,OAAAgY,EAAQ,MAAAgI,CAAK,EAAKpB,EAAO5e,EAAK,EAAK,EAC3C,MAAO,CAAE,OAAAgY,EAAQ,MAAAgI,EAAO,MAAOK,EAAUL,CAAK,CAAG,EAErD,MAAO,CAAE,OAAArB,EAAQ,OAAAC,EAAQ,cAAAiC,EAAe,aAAAD,EAAc,UAAAP,EAAW,gBAAAE,EAAiB,QAAAD,CAAS,EAE/FtiB,EAAA,OAAiBm8B,EAAU,QAAQ,EACnCn8B,EAAA,QAAkBm8B,EAAU,SAAS,EACrCn8B,EAAe,KAAA,CACX,OAAS0G,GAAS,IAAI,YAAW,EAAG,OAAOA,CAAI,EAC/C,OAAS1E,GAAQ,IAAI,YAAW,EAAG,OAAOA,CAAG,CAChD,EACDhC,EAAc,IAAAg7B,EAAMO,EAAO,CAAC,EAAG1a,EAAS,kBAAkB,EAAGoa,EAAK,EAAE,EAAG7Z,EAAW7f,GAAM,CACpF,GAAI,OAAOA,GAAM,UAAYA,EAAE,OAAS,EACpC,MAAM,IAAI,UAAU,oCAAoC,OAAOA,CAAC,gBAAgBA,EAAE,MAAM,EAAE,EAC9F,OAAOA,EAAE,YAAa,EACzB,CAAC,EACF,MAAM66B,EAAS,CACX,KAAMp8B,EAAQ,KAAM,IAAKA,EAAQ,IAAK,OAAQA,EAAQ,OAAQ,OAAQA,EAAQ,OAAQ,OAAQA,EAAQ,OAAQ,UAAWA,EAAQ,UAAW,OAAQA,EAAQ,OAAQ,UAAWA,EAAQ,SAC1L,EACKq8B,EAAiB,2CAA2C,OAAO,KAAKD,CAAM,EAAE,KAAK,IAAI,CAAC,GAC1FE,EAAgB,CAACh7B,EAAMmE,IAAU,CACnC,GAAI,OAAOnE,GAAS,UAAY,CAAC86B,EAAO,eAAe96B,CAAI,EACvD,MAAM,IAAI,UAAU+6B,CAAc,EACtC,GAAI,EAAE52B,aAAiB,YACnB,MAAM,IAAI,UAAU,oCAAoC,EAC5D,OAAO22B,EAAO96B,CAAI,EAAE,OAAOmE,CAAK,CACnC,EACDzF,EAAA,cAAwBs8B,EACxBt8B,EAAc,IAAAA,EAAQ,cACtB,MAAMu8B,EAAgB,CAACj7B,EAAMU,IAAQ,CACjC,GAAI,CAACo6B,EAAO,eAAe96B,CAAI,EAC3B,MAAM,IAAI,UAAU+6B,CAAc,EACtC,GAAI,OAAOr6B,GAAQ,SACf,MAAM,IAAI,UAAU,gCAAgC,EACxD,OAAOo6B,EAAO96B,CAAI,EAAE,OAAOU,CAAG,CACjC,EACDhC,EAAA,cAAwBu8B,EACxBv8B,EAAgB,MAAAA,EAAQ,qBChZxB,KAAM,CAAC,OAAQ,IAAK,IAAI,EAAIxB,IAiDvB,OAAO,GAAG,EACV,OAAO,GAAG,EACV,OAAO,GAAG,EACV,OAAO,IAAI,EAGM,OAAO,qBAAqB,EAExB,OAAO,IAAI,EAErC,MAAM,SAAW,CACf,aAAc,EACd,eAAgB,GAChB,YAAa,GACb,MAAO,GACP,iBAAkB,GAClB,OAAQ,EACR,sBAAuB,GACvB,iBAAkB,EAClB,WAAY,EACZ,aAAc,EACd,SAAU,EACZ,EAIA,QAASZ,EAAI,EAAGwD,EAAO,OAAO,KAAK,QAAQ,EAAGxD,EAAIwD,EAAK,OAAQxD,IACzCwD,EAAKxD,CAAC,EACN,SAASwD,EAAKxD,CAAC,CAAC,EAAE,SAAQ,EC/D7C,IAAC,SAA4B4+B,IAC9BA,EAASA,EAAS,SAAc,CAAC,EAAI,WACrCA,EAASA,EAAS,KAAU,CAAC,EAAI,OACjCA,EAASA,EAAS,eAAoB,CAAC,EAAI,iBAC3CA,EAASA,EAAS,SAAc,CAAC,EAAI,WACrCA,EAASA,EAAS,uBAA4B,CAAC,EAAI,yBACnDA,EAASA,EAAS,cAAmB,CAAC,EAAI,gBAC1CA,EAASA,EAAS,OAAY,CAAC,EAAI,SACnCA,EAASA,EAAS,SAAc,CAAC,EAAI,WACrCA,EAASA,EAAS,WAAgB,CAAC,EAAI,aACvCA,EAASA,EAAS,UAAe,CAAC,EAAI,YACtCA,EAASA,EAAS,UAAe,EAAE,EAAI,YACvCA,EAASA,EAAS,WAAgB,EAAE,EAAI,aACxCA,EAASA,EAAS,aAAkB,EAAE,EAAI,eAC1CA,EAASA,EAAS,qBAA0B,EAAE,EAAI,uBAClDA,EAASA,EAAS,MAAW,EAAE,EAAI,QACnCA,EAASA,EAAS,MAAW,EAAE,EAAI,QACnCA,EAASA,EAAS,WAAgB,EAAE,EAAI,aACxCA,EAASA,EAAS,MAAW,EAAE,EAAI,QACnCA,EAASA,EAAS,OAAY,EAAE,EAAI,SACpCA,EAASA,EAAS,kBAAuB,GAAG,EAAI,oBAChDA,EAASA,EAAS,SAAc,IAAI,EAAI,WACxCA,EAASA,EAAS,cAAmB,EAAE,EAAI,gBAC3CA,EAASA,EAAS,gBAAqB,EAAE,EAAI,kBAC7CA,EAASA,EAAS,gBAAqB,EAAE,EAAI,kBAC7CA,EAASA,EAAS,eAAoB,EAAE,EAAI,iBAC5CA,EAASA,EAAS,mBAAwB,EAAE,EAAI,qBAChDA,EAASA,EAAS,gBAAqB,EAAE,EAAI,kBAC7CA,EAASA,EAAS,aAAkB,IAAI,EAAI,eAC5CA,EAASA,EAAS,MAAW,IAAI,EAAI,QACrCA,EAASA,EAAS,OAAY,IAAI,EAAI,SACtCA,EAASA,EAAS,MAAW,IAAI,EAAI,QACrCA,EAASA,EAAS,qBAA0B,GAAG,EAAI,uBACnDA,EAASA,EAAS,wBAA6B,IAAI,EAAI,0BACvDA,EAASA,EAAS,sBAA2B,IAAI,EAAI,wBACrDA,EAASA,EAAS,qBAA0B,IAAI,EAAI,uBACpDA,EAASA,EAAS,sBAA2B,IAAI,EAAI,wBACrDA,EAASA,EAAS,mBAAwB,IAAI,EAAI,qBAClDA,EAASA,EAAS,4BAAiC,IAAI,EAAI,8BAC3DA,EAASA,EAAS,2BAAgC,IAAI,EAAI,6BAC1DA,EAASA,EAAS,mBAAwB,IAAI,EAAI,qBAClDA,EAASA,EAAS,iBAAsB,IAAI,EAAI,mBAChDA,EAASA,EAAS,eAAoB,GAAG,EAAI,iBAC7CA,EAASA,EAAS,UAAe,IAAI,EAAI,YACzCA,EAASA,EAAS,YAAiB,IAAI,EAAI,cAC3CA,EAASA,EAAS,oBAAyB,IAAI,EAAI,sBACnDA,EAASA,EAAS,aAAkB,IAAI,EAAI,eAC5CA,EAASA,EAAS,WAAgB,IAAI,EAAI,aAC1CA,EAASA,EAAS,WAAgB,IAAI,EAAI,aAC1CA,EAASA,EAAS,cAAmB,IAAI,EAAI,gBAC7CA,EAASA,EAAS,kBAAuB,GAAG,EAAI,oBAChDA,EAASA,EAAS,qBAA0B,IAAI,EAAI,uBACpDA,EAASA,EAAS,uBAA4B,IAAI,EAAI,yBACtDA,EAASA,EAAS,qBAA0B,IAAI,EAAI,uBACpDA,EAASA,EAAS,sBAA2B,IAAI,EAAI,wBACrDA,EAASA,EAAS,sBAA2B,IAAI,EAAI,wBACrDA,EAASA,EAAS,SAAc,GAAG,EAAI,WACvCA,EAASA,EAAS,QAAa,KAAK,EAAI,UACxCA,EAASA,EAAS,UAAe,KAAK,EAAI,YAC1CA,EAASA,EAAS,aAAkB,KAAK,EAAI,eAC7CA,EAASA,EAAS,cAAmB,KAAK,EAAI,gBAC9CA,EAASA,EAAS,eAAoB,KAAK,EAAI,iBAC/CA,EAASA,EAAS,eAAoB,KAAK,EAAI,iBAC/CA,EAASA,EAAS,gBAAqB,KAAK,EAAI,kBAChDA,EAASA,EAAS,gBAAqB,KAAK,EAAI,kBAChDA,EAASA,EAAS,aAAkB,KAAK,EAAI,eAC7CA,EAASA,EAAS,cAAmB,KAAK,EAAI,gBAC9CA,EAASA,EAAS,UAAe,KAAK,EAAI,YAC1CA,EAASA,EAAS,8BAAmC,KAAK,EAAI,gCAC9DA,EAASA,EAAS,YAAiB,KAAK,EAAI,cAC5CA,EAASA,EAAS,sBAA2B,KAAK,EAAI,wBACtDA,EAASA,EAAS,SAAc,IAAI,EAAI,WACxCA,EAASA,EAAS,YAAiB,KAAK,EAAI,cAC5CA,EAASA,EAAS,UAAe,GAAG,EAAI,YACxCA,EAASA,EAAS,sBAA2B,GAAoB,EAAG,wBACpEA,EAASA,EAAS,wBAA6B,KAAK,EAAI,0BACxDA,EAASA,EAAS,SAAc,KAAK,EAAI,WACzCA,EAASA,EAAS,qBAA0B,KAAqB,EAAG,uBACpEA,EAASA,EAAS,YAAiB,KAAK,EAAI,cAC5CA,EAASA,EAAS,YAAiB,KAAK,EAAI,cAC5CA,EAASA,EAAS,mBAAwB,KAAK,EAAI,qBACnDA,EAASA,EAAS,iBAAsB,KAAK,EAAI,mBACjDA,EAASA,EAAS,iBAAsB,KAAK,EAAI,mBACjDA,EAASA,EAAS,YAAiB,KAAK,EAAI,cAC5CA,EAASA,EAAS,cAAmB,KAAwB,EAAG,gBAChEA,EAASA,EAAS,SAAc,KAAK,EAAI,WACzCA,EAASA,EAAS,eAAoB,KAAK,EAAI,iBAC/CA,EAASA,EAAS,mBAAwB,KAAK,EAAI,qBACnDA,EAASA,EAAS,KAAU,KAAK,EAAI,OACrCA,EAASA,EAAS,MAAW,KAAK,EAAI,QACtCA,EAASA,EAAS,iBAAsB,KAAK,EAAI,mBACjDA,EAASA,EAAS,wBAA6B,IAAI,EAAI,0BACvDA,EAASA,EAAS,aAAkB,KAAK,EAAI,eAC7CA,EAASA,EAAS,yBAA8B,KAAyB,EAAG,2BAC5EA,EAASA,EAAS,OAAY,IAAI,EAAI,SACtCA,EAASA,EAAS,WAAgB,IAAI,EAAI,aAC1CA,EAASA,EAAS,IAAS,IAAI,EAAI,MACnCA,EAASA,EAAS,UAAe,IAAI,EAAI,YACzCA,EAASA,EAAS,WAAgB,KAAK,EAAI,aAC3CA,EAASA,EAAS,sBAA2B,KAAK,EAAI,wBACtDA,EAASA,EAAS,sBAA2B,KAAK,EAAI,wBACtDA,EAASA,EAAS,aAAkB,KAAK,EAAI,eAC7CA,EAASA,EAAS,cAAmB,KAAK,EAAI,gBAC9CA,EAASA,EAAS,SAAc,KAAK,EAAI,WACzCA,EAASA,EAAS,aAAkB,KAAK,EAAI,eAC7CA,EAASA,EAAS,gBAAqB,KAAK,EAAI,kBAChDA,EAASA,EAAS,YAAiB,KAAK,EAAI,cAC5CA,EAASA,EAAS,cAAmB,KAAK,EAAI,gBAC9CA,EAASA,EAAS,QAAa,KAAK,EAAI,UACxCA,EAASA,EAAS,gBAAqB,KAAK,EAAI,kBAChDA,EAASA,EAAS,WAAgB,KAAK,EAAI,aAC3CA,EAASA,EAAS,gBAAqB,KAAK,EAAI,kBAChDA,EAASA,EAAS,cAAmB,KAAK,EAAI,gBAC9CA,EAASA,EAAS,kBAAuB,KAAK,EAAI,oBAClDA,EAASA,EAAS,cAAmB,IAAI,EAAI,gBAC7CA,EAASA,EAAS,YAAiB,KAAK,EAAI,cAC5CA,EAASA,EAAS,aAAkB,KAAK,EAAI,eAC7CA,EAASA,EAAS,kBAAuB,KAAK,EAAI,oBAClDA,EAASA,EAAS,WAAgB,KAAK,EAAI,aACpCA,IACN,SAAW,CAAE,CAAA,EAgChB,SAAS,iBAAiBC,EAAKvM,EAAQ5uB,EAAO,QAAS,CACrD,GAAI,CAACm7B,EAAI,cAAe,OACxB,MAAM7qB,EAAO6qB,EAAI,cAAc,KAAK,IAAIvM,CAAM,EAC9C,GAAKte,EACL,OAAItQ,IAAS,QACJsQ,EAAK,YAEPA,EAAK,UACd,CACA,eAAe,kBAAkB6qB,EAAKvM,EAAQ5uB,EAAO,QAAS,CAC5D,GAAKm7B,EAAI,cACT,OAAKA,EAAI,cAAc,KAAK,IAAIvM,CAAM,GACpC,MAAMuM,EAAI,cAAc,WAAW,CAACvM,CAAM,CAAC,EAEtC,iBAAiBuM,EAAKvM,EAAQ5uB,CAAI,CAC3C,CAGA,SAAS,uBAAuBm7B,EAAKC,EAAS,CAC5C,MAAMC,EAAkC,IAAI,IAC5C,OAAAD,EAAQ,QAASxM,GAAW,CAC1B,MAAM0M,EAAc,iBAAiBH,EAAKvM,CAAM,EAC5C0M,GACFA,EAAY,QAASjR,GAAU,CAC7B,MAAMwE,EAAQwM,EAAgB,IAAIhR,CAAK,GAAK,EAC5CgR,EAAgB,IAAIhR,EAAOwE,EAAQ,CAAC,CAC5C,CAAO,CAEP,CAAG,EACoB,MAAM,KAAKwM,EAAgB,QAAS,CAAA,EAAE,KAAK,CAACj+B,EAAGC,IAAMA,EAAE,CAAC,EAAID,EAAE,CAAC,CAAC,EACjE,IAAKmwB,GAAUA,EAAM,CAAC,CAAC,CAC7C,CAGA,SAAS,0BAA0B4N,EAAKI,EAASv7B,EAAO,OAAQ,CAC9D,MAAMw7B,EAAkC,IAAI,IACtCC,EAAuC,IAAI,IACjD,OAAAF,EAAQ,QAASvR,GAAW,CAC1B,MAAMqB,EAAS,iBAAiB8P,EAAKnR,EAAQhqB,CAAI,EAC7CqrB,GAAUA,EAAO,KAAO,GAC1BA,EAAO,QAAShB,GAAU,EACDmR,EAAgB,IAAInR,CAAK,GAAqB,IAAI,KAC1D,IAAIL,CAAM,CACjC,CAAO,EACDwR,EAAgB,IAAIxR,EAAQqB,CAAM,GAElCoQ,EAAqB,IAAIzR,CAAM,CAErC,CAAG,EACM,CAAE,gBAAAwR,EAAiB,qBAAAC,CAAsB,CAClD,CACA,SAAS,iCAAiCN,EAAKI,EAASv7B,EAAM,CAAE,MAAA6uB,EAAO,gBAAA6M,CAAiB,EAAG,GAAI,CAC7F7M,MAAU,GACV6M,MAAoC,IAAI,KACxC,MAAMC,EAAOR,EAAI,KACXS,EAAkBD,EAAK,gBAAiB,EAC9CC,EAAgB,QAASvR,GAAU,CACjCqR,GAAA,MAAAA,EAAiB,IAAIrR,EAAM,IAC/B,CAAG,EACD,MAAMwR,EAAoC,IAAI,IACxC,CAAE,gBAAAL,EAAiB,qBAAAC,CAAsB,EAAG,0BAA0BN,EAAKI,EAASv7B,CAAI,EACxF87B,EAAe,uBAAuBX,EAAKI,CAAO,EAClDQ,EAAmB,CAACnN,EAAQvE,IAAU,CAC1C,MAAM2R,EAAiBH,EAAkB,IAAIxR,CAAK,GAAK,CAAE,EACzD2R,EAAe,KAAKpN,CAAM,EAC1BiN,EAAkB,IAAIxR,EAAO2R,CAAc,CAC5C,EACD,SAAW,CAACpN,EAAQqN,CAAY,IAAKT,EAAgB,QAAO,EAAI,CAC9D,IAAIU,EAAoBrN,EACxB,UAAWxE,KAASuR,EACdK,EAAa,IAAI5R,EAAM,GAAG,IAC5B0R,EAAiBnN,EAAQvE,EAAM,GAAG,EAClC6R,KAGJ,UAAWC,KAAeF,EACpBJ,EAAkB,IAAIM,CAAW,IACnCJ,EAAiBnN,EAAQuN,CAAW,EACpCD,KAGJ,GAAI,EAAAA,GAAqB,GACzB,UAAW7R,KAASyR,EAAc,CAChC,GAAII,GAAqB,EAAG,MACxBD,EAAa,IAAI5R,CAAK,IACxB0R,EAAiBnN,EAAQvE,CAAK,EAC9B6R,IAER,CACA,CACE,UAAWtN,KAAU6M,EACnBE,EAAK,4BAA2B,EAAG,QAAStR,GAAU,CACpD,MAAM2R,EAAiBH,EAAkB,IAAIxR,EAAM,GAAG,GAAK,CAAE,EAC7D2R,EAAe,KAAKpN,CAAM,EAC1BiN,EAAkB,IAAIxR,EAAM,IAAK2R,CAAc,CACrD,CAAK,EAEH,OAAOH,CACT,CAGA,SAAS,8BAA8BV,EAAKC,EAASgB,EAAqB,EAAG,CAC3E,OAAO,iCAAiCjB,EAAKC,EAAS,QAAS,CAAE,MAAOgB,EAAoB,CAC9F,CAGA,SAAS,qBAAqB7T,EAAK,CACjC,GAAI,CACF,OAAO,kBAAkBA,CAAG,CAChC,MAAU,CACN,MACJ,CACA,CACA,SAAS,kBAAkBA,EAAK,CAC9B,IAAIzkB,EAAI,aAAaykB,EAAK,CACxB,oBAAqB,GACrB,SAAU,GACV,UAAW,EACf,CAAG,EACD,OAAKzkB,EAAE,SAAS,GAAG,IACjBA,GAAK,KAEAA,CACT,CACA,SAAS,UAAUu4B,EAAM,CACvB,MAAMC,EAA6B,IAAI,IACvC,UAAW/T,KAAO8T,EAChB,GAAI,CACFC,EAAW,IAAI,kBAAkB/T,CAAG,CAAC,CAC3C,MAAY,CACZ,CAEE,OAAO,MAAM,KAAK+T,CAAU,CAC9B,CACA,IAAI,2BAA6B,aAC7B,yBAA2B,WAC3B,cAAgB,CAACt7B,EAAM0oB,IAAYA,EAAQ,KAAMH,GAAWA,aAAkB,OAASA,EAAO,KAAKvoB,CAAI,EAAIuoB,IAAWvoB,CAAI,EAC1H,mBAAqC,IAAI,IAAI,CAAC,SAAU,QAAS,OAAO,CAAC,EACzE,kBAAqBu7B,GAAc,CACrC,GAAI,CACF,KAAM,CAAE,SAAAC,CAAQ,EAAK,IAAI,IAAID,CAAS,EACtC,OAAOC,EAAS,SAAS,GAAG,GAAK,CAACA,EAAS,SAAS,GAAG,GAAK,CAAC,mBAAmB,IAAIA,CAAQ,CAChG,MAAU,CACN,MAAO,EACX,CACA,EACI,iBAAmB,CAACD,EAAW,CAAE,UAAAE,KAAgB,aACnD,MAAM97B,EAAQ,0DAA0D,KAAK47B,CAAS,EACtF,GAAI,CAAC57B,EACH,MAAM,IAAI,MAAM,gBAAgB47B,CAAS,EAAE,EAE7C,MAAMv8B,IAAOzC,EAAAoD,EAAM,SAAN,YAAApD,EAAc,OAAQ,GAC7B6H,IAAO3H,EAAAkD,EAAM,SAAN,YAAAlD,EAAc,OAAQ,GACnC,IAAImE,IAAOiR,EAAAlS,EAAM,SAAN,YAAAkS,EAAc,OAAQ,GACjC,MAAM6pB,EAAY18B,EAAK,MAAM,GAAG,EAChC4B,EAAO66B,EAAY,GAAK76B,EACxB,IAAI+6B,EAAW,GACXD,EAAUA,EAAU,OAAS,CAAC,IAAM,WACtCA,EAAU,IAAK,EACfC,EAAW,IAEb,MAAMC,IAAW/P,EAAA6P,EAAU,MAAK,IAAf,YAAA7P,EAAmB,gBAAiB,GAW/CgQ,EAAsB,CAAC,GAVVH,EAAU,IAAKI,GAAc,CAC9C,GAAI,CAACr7B,EAAK0E,EAAQ,EAAE,EAAI22B,EAAU,MAAM,GAAG,EAAE,IAAKC,GAAWA,EAAO,KAAI,CAAE,EAC1E,OAAIt7B,IAAQ,YACV0E,EAAQA,EAAM,YAAa,EACvBA,IAAU,0BACL,GAGJ,GAAG1E,CAAG,GAAG0E,EAAQ,IAAIA,CAAK,GAAK,EAAE,EAC5C,CAAG,EAAE,OAAO,OAAO,CACyB,EAC1C,OAAIw2B,GACFE,EAAoB,KAAK,QAAQ,GAE/BA,EAAoB,OAAS,GAAKD,GAAYA,IAAa,6BAC7DC,EAAoB,QAAQD,CAAQ,EAE/B,QAAQC,EAAoB,KAAK,GAAG,CAAC,IAAIF,EAAWv3B,EAAK,KAAI,EAAKA,CAAI,GAAGxD,EAAO,IAAIA,CAAI,GAAK,EAAE,EACxG,EACA,SAAS,aAAa26B,EAAWj8B,EAAU,GAAI,CAsB7C,GArBAA,EAAU,CACR,gBAAiB,OACjB,kBAAmB,GACnB,UAAW,GACX,WAAY,GACZ,oBAAqB,GACrB,UAAW,GACX,kBAAmB,GACnB,SAAU,GACV,sBAAuB,CAAC,WAAW,EACnC,oBAAqB,GACrB,kBAAmB,GACnB,qBAAsB,GACtB,mBAAoB,GACpB,oBAAqB,GACrB,GAAGA,CACJ,EACG,OAAOA,EAAQ,iBAAoB,UAAY,CAACA,EAAQ,gBAAgB,SAAS,GAAG,IACtFA,EAAQ,gBAAkB,GAAGA,EAAQ,eAAe,KAEtDi8B,EAAYA,EAAU,KAAM,EACxB,UAAU,KAAKA,CAAS,EAC1B,OAAO,iBAAiBA,EAAWj8B,CAAO,EAE5C,GAAI,kBAAkBi8B,CAAS,EAC7B,OAAOA,EAET,MAAMS,EAAsBT,EAAU,WAAW,IAAI,EAC/B,CAACS,GAAuB,SAAS,KAAKT,CAAS,IAEnEA,EAAYA,EAAU,QAAQ,2BAA4Bj8B,EAAQ,eAAe,GAEnF,MAAM28B,EAAY,IAAI,IAAIV,CAAS,EAEnC,GADAU,EAAU,SAAWA,EAAU,SAAS,YAAa,EACjD38B,EAAQ,WAAaA,EAAQ,WAC/B,MAAM,IAAI,MAAM,kEAAkE,EAiBpF,GAfIA,EAAQ,WAAa28B,EAAU,WAAa,WAC9CA,EAAU,SAAW,SAEnB38B,EAAQ,YAAc28B,EAAU,WAAa,UAC/CA,EAAU,SAAW,UAEnB38B,EAAQ,sBACV28B,EAAU,SAAW,GACrBA,EAAU,SAAW,IAEnB38B,EAAQ,UACV28B,EAAU,KAAO,GACR38B,EAAQ,oBACjB28B,EAAU,KAAOA,EAAU,KAAK,QAAQ,iBAAkB,EAAE,GAE1DA,EAAU,SAAU,CACtB,MAAMC,EAAgB,iCACtB,IAAIC,EAAY,EACZ5wB,EAAS,GACb,OAAW,CACT,MAAM5L,EAAQu8B,EAAc,KAAKD,EAAU,QAAQ,EACnD,GAAI,CAACt8B,EACH,MAEF,MAAM67B,EAAW77B,EAAM,CAAC,EAClBy8B,EAAkBz8B,EAAM,MACxB08B,EAAeJ,EAAU,SAAS,MAAME,EAAWC,CAAe,EACxE7wB,GAAU8wB,EAAa,QAAQ,UAAW,GAAG,EAC7C9wB,GAAUiwB,EACVW,EAAYC,EAAkBZ,EAAS,MAC7C,CACI,MAAMc,EAAUL,EAAU,SAAS,MAAME,EAAWF,EAAU,SAAS,MAAM,EAC7E1wB,GAAU+wB,EAAQ,QAAQ,UAAW,GAAG,EACxCL,EAAU,SAAW1wB,CACzB,CACE,GAAI0wB,EAAU,SACZ,GAAI,CACFA,EAAU,SAAW,UAAUA,EAAU,QAAQ,CACvD,MAAY,CACZ,CAKE,GAHI38B,EAAQ,uBAAyB,KACnCA,EAAQ,qBAAuB,CAAC,iBAAiB,GAE/C,MAAM,QAAQA,EAAQ,oBAAoB,GAAKA,EAAQ,qBAAqB,OAAS,EAAG,CAC1F,IAAIi9B,EAAiBN,EAAU,SAAS,MAAM,GAAG,EACjD,MAAMO,EAAgBD,EAAeA,EAAe,OAAS,CAAC,EAC1D,cAAcC,EAAel9B,EAAQ,oBAAoB,IAC3Di9B,EAAiBA,EAAe,MAAM,EAAG,EAAE,EAC3CN,EAAU,SAAW,GAAGM,EAAe,MAAM,CAAC,EAAE,KAAK,GAAG,CAAC,IAE/D,CAOE,GANIN,EAAU,WACZA,EAAU,SAAWA,EAAU,SAAS,QAAQ,MAAO,EAAE,EACrD38B,EAAQ,UAAY,oDAAoD,KAAK28B,EAAU,QAAQ,IACjGA,EAAU,SAAWA,EAAU,SAAS,QAAQ,SAAU,EAAE,IAG5D,MAAM,QAAQ38B,EAAQ,qBAAqB,EAC7C,UAAWmB,IAAO,CAAC,GAAGw7B,EAAU,aAAa,KAAI,CAAE,EAC7C,cAAcx7B,EAAKnB,EAAQ,qBAAqB,GAClD28B,EAAU,aAAa,OAAOx7B,CAAG,EAOvC,GAHI,CAAC,MAAM,QAAQnB,EAAQ,mBAAmB,GAAKA,EAAQ,wBAA0B,KACnF28B,EAAU,OAAS,IAEjB,MAAM,QAAQ38B,EAAQ,mBAAmB,GAAKA,EAAQ,oBAAoB,OAAS,EACrF,UAAWmB,IAAO,CAAC,GAAGw7B,EAAU,aAAa,KAAI,CAAE,EAC5C,cAAcx7B,EAAKnB,EAAQ,mBAAmB,GACjD28B,EAAU,aAAa,OAAOx7B,CAAG,EAIvC,GAAInB,EAAQ,oBAAqB,CAC/B28B,EAAU,aAAa,KAAM,EAC7B,GAAI,CACFA,EAAU,OAAS,mBAAmBA,EAAU,MAAM,CAC5D,MAAY,CACZ,CACA,CACM38B,EAAQ,sBACV28B,EAAU,SAAWA,EAAU,SAAS,QAAQ,MAAO,EAAE,GAEvD38B,EAAQ,oBAAsB28B,EAAU,OAC1CA,EAAU,KAAO,IAEnB,MAAMQ,EAAelB,EACrB,OAAAA,EAAYU,EAAU,SAAU,EAC5B,CAAC38B,EAAQ,mBAAqB28B,EAAU,WAAa,KAAO,CAACQ,EAAa,SAAS,GAAG,GAAKR,EAAU,OAAS,KAChHV,EAAYA,EAAU,QAAQ,MAAO,EAAE,IAEpCj8B,EAAQ,qBAAuB28B,EAAU,WAAa,MAAQA,EAAU,OAAS,IAAM38B,EAAQ,oBAClGi8B,EAAYA,EAAU,QAAQ,MAAO,EAAE,GAErCS,GAAuB,CAAC18B,EAAQ,oBAClCi8B,EAAYA,EAAU,QAAQ,aAAc,IAAI,GAE9Cj8B,EAAQ,gBACVi8B,EAAYA,EAAU,QAAQ,oBAAqB,EAAE,GAEhDA,CACT,CAOA,IAAI,uBAAyB,EACzB,sBAAwB,IACxB,qBAAuB,KAAM,CAqB/B,YAAYmB,EAAUvC,EAAK,CApB3BrS,EAAA,iBACAA,EAAA,WACAA,EAAA,gBACAA,EAAA,kBACAA,EAAA,oBACAA,EAAA,wBAAmB,CACjB,SAAU,EACV,QAAS,EACT,UAAW,CAAA,CACZ,GACDA,EAAA,cACAA,EAAA,iBACAA,EAAA,uBACAA,EAAA,yBACAA,EAAA,YACAA,EAAA,gBAA2B,IAAI,KAC/BA,EAAA,yBAAoC,IAAI,KACxCA,EAAA,0BAAqC,IAAI,KACzCA,EAAA,cAAS,GACTA,EAAA,uBAAkB,MA+blBA,EAAA,6BAAwB,CACtB,UAAW,IAAM,CACf,KAAK,iBAAiB,UACtB,KAAK,iBAAiB,YAAc,KAAK,IAAK,CAC/C,EACD,aAAc,IAAM,CACd,KAAK,iBAAiB,cACxB,KAAK,iBAAiB,UAAU,KAAK,KAAK,MAAQ,KAAK,iBAAiB,WAAW,EAC/E,KAAK,iBAAiB,UAAU,OAAS,KAC3C,KAAK,iBAAiB,UAAU,MAAO,GAG3C,KAAK,iBAAiB,YAAc,MACrC,EACD,QAAS,IAAM,CACb,KAAK,iBAAiB,WACtB,KAAK,iBAAiB,YAAc,KAAK,IAAK,CACpD,CACG,GA/cC,KAAK,SAAW4U,EAChB,KAAK,QAAU,EACf,MAAM7e,EAAO,KAAK,MAAM,KAAK,OAAQ,EAAG,GAAG,EAC3C,KAAK,MAAQ,KAAK,SAAS,MAAM,OAAO,eAAeA,CAAI,EAAE,EAC7D,KAAK,IAAMsc,CACf,CAeE,MAAM,QAAQwC,EAAWC,EAAY,GAAM,CACzC,GAAI,KAAK,UAAY,GAAwB,KAAK,UAAY,GAAwB,KAAK,iBAAkB,CAC3G,KAAK,MACH,oFACA,KAAK,OACN,EACD,MACN,CACQ,KAAK,mBACP,aAAa,KAAK,gBAAgB,EAClC,KAAK,iBAAmB,QAEtB,KAAK,iBACP,aAAa,KAAK,cAAc,EAChC,KAAK,eAAiB,QAExBD,MAAc,KAAK,WACf,CAAC,KAAK,WAAaA,IAAW,KAAK,UAAYA,GAC/C,KAAK,YAAW,KAAK,eAAiB,WAAW,IAAM,KAAK,kBAAkBC,CAAS,EAAG,KAAK,SAAS,GAC5G,GAAI,CACF,KAAK,sBAAsB,QAAS,EAChC,KAAK,UAAY,EAAsB,KAAK,QAAU,EACrD,KAAK,QAAU,EACpB,KAAK,GAAK,IAAI,UAAU,KAAK,SAAS,GAAG,EACzC,KAAK,GAAG,OAAS,KAAK,UAAU,KAAK,IAAI,EACzC,KAAK,GAAG,QAAU,KAAK,aAAa,KAAK,IAAI,EAC7C,KAAK,GAAG,UAAY,KAAK,UAAU,KAAK,IAAI,EAC5C,KAAK,GAAG,QAAU,KAAK,QAAQ,KAAK,IAAI,CACzC,OAAQ3+B,EAAG,CACV,WAAK,MAAM,wBAAwB,KAAK,SAAS,GAAG,GAAIA,CAAC,EACzD,KAAK,QAAU,EACX2+B,EAAW,KAAK,mBAAoB,EACnC,KAAK,SAAS,KAAK,kBAAmB,EAAI,GAAK,GAAK,GAAK,GAAG,EAC3D3+B,CACZ,CACA,CAOE,YAAa,OACX,KAAK,QAAU,EACf,GAAI,EACF1B,EAAA,KAAK,KAAL,MAAAA,EAAS,OACV,OAAQ,EAAG,CACV,KAAK,MAAM,uBAAwB,CAAC,EACpC,KAAK,QAAU,CACrB,CACA,CASE,kBAAkBqgC,EAAW,CAC3B,KAAK,MAAM,uBAAuB,KAAK,SAAS,GAAG,GAAI,KAAK,SAAS,EACjEA,GAAa,CAAC,KAAK,kBACrB,KAAK,mBAAoB,CAE/B,CAOE,WAAY,QACVrgC,EAAA,KAAK,WAAL,MAAAA,EAAA,UAAgB,YAAa,KAAK,UAC9B,KAAK,mBACP,aAAa,KAAK,gBAAgB,EAClC,KAAK,iBAAmB,QAEtB,KAAK,iBACP,aAAa,KAAK,cAAc,EAChC,KAAK,eAAiB,QAExB,KAAK,sBAAsB,UAAW,EACtC,KAAK,QAAU,EACf,KAAK,SAAS,KAAK,SAAS,EAC5B,KAAK,SAAS,KAAK,OAAO,CAC9B,CAQE,cAAe,QACbA,EAAA,KAAK,WAAL,MAAAA,EAAA,UAAgB,eAAgB,KAAK,UACrC,KAAK,sBAAsB,aAAc,EACrC,KAAK,UAAY,GACnB,KAAK,mBAAoB,EAE3B,KAAK,QAAU,EACf,KAAK,SAAS,KAAK,YAAY,CACnC,CAQE,UAAUuB,EAAO,QACfvB,EAAA,KAAK,WAAL,MAAAA,EAAA,UAAgBuB,EAAM,KAAM,KAAK,SAAU,QAC3C,GAAI,CACF,MAAMsG,EAAO,KAAK,MAAMtG,EAAM,IAAI,EAC5B,CAAC++B,EAAK9T,EAAI,GAAG+T,CAAK,EAAI14B,EAC5B,OAAQy4B,EAAG,CACT,IAAK,QAAS,CACZ,MAAMhT,EAAK,KAAK,SAAS,IAAId,CAAE,EACzBgU,EAAS34B,EAAK,CAAC,EACrB,GAAI,CAACylB,EAAI,CACP,KAAK,MAAM,2CAA2Cd,CAAE,EAAE,EAC1D,MACZ,CACUc,EAAG,QAAQkT,CAAM,EACjB,MACV,CACQ,IAAK,QAAS,CACZ,MAAMhT,EAAU3lB,EAAK,CAAC,EAChBqlB,EAAK,KAAK,kBAAkB,IAAIV,CAAE,EACpCU,IACFA,EAAG,QAAQM,EAAQ,KAAK,EACxB,KAAK,kBAAkB,OAAOhB,CAAE,GAElC,MACV,CACQ,IAAK,OAAQ,CACX,MAAMc,EAAK,KAAK,SAAS,IAAId,CAAE,EAC/B,GAAI,CAACc,EAAI,OACTA,EAAG,OAAOd,CAAE,EACZ,MACV,CACQ,IAAK,KAAM,CACT,MAAMiB,EAAK5lB,EAAK,CAAC,EACXklB,EAASllB,EAAK,CAAC,EACfolB,EAAK,KAAK,mBAAmB,IAAIT,CAAE,EACnCiU,EAAUxT,GAAA,YAAAA,EAAI,MACpB,GAAI,CAACA,GAAM,CAACwT,EAAS,CACnB,KAAK,MAAM,wCAAyCjU,CAAE,EACtD,MACZ,CACciB,EAAIgT,EAAQ,QAAQ1T,CAAM,EACzB0T,EAAQ,OAAO,IAAI,MAAM1T,CAAM,CAAC,EACjCE,EAAG,SAAW,EAChB,KAAK,mBAAmB,OAAOT,CAAE,EAEjC,KAAK,mBAAmB,IAAIA,EAAIS,CAAE,EAEpC,MACV,CACQ,IAAK,SAAU,CACb,MAAMK,EAAK,KAAK,SAAS,IAAId,CAAE,EAC/B,GAAI,CAACc,EAAI,OACTA,EAAG,SAASzlB,EAAK,CAAC,CAAC,EACnB,MACV,CACQ,IAAK,SACH,KAAK,SAASA,EAAK,CAAC,CAAC,EACrB,OACF,IAAK,OAAQ,CACX,KAAK,gBAAgBA,EAAK,CAAC,CAAC,EAC5B,MACV,CACA,CACK,OAAQnB,EAAO,CACd,KAAK,MAAM,8BAA8B,KAAK,SAAS,GAAG,KAAKA,EAAM,OAAO,GAAIA,GAAA,YAAAA,EAAO,KAAK,EAC5F,MACN,CACA,CASE,MAAM,gBAAgBua,EAAW,WAC/B,MAAMyf,EAAa,KAAK,SAAS,cAAc1gC,EAAA,KAAK,MAAL,YAAAA,EAAU,wBAIzD,GAHA,KAAK,MAAM,iCAAkC,CAC3C,WAAY,CAAC,CAAC0gC,CACpB,CAAK,EACG,KAAK,UAAY,EAAwB,CAC3C,KAAK,MAAM,kCAAkC,EAC7C,MACN,CAEI,GADA,KAAK,QAAU,EACXA,GACF,GAAI,KAAK,SAAW,EAAmB,CACrC,KAAK,QAAU,EACf,IAAI92B,EACJ,GAAI,CACFA,EAAM,MAAM82B,EAAW,KAAK,SAAUzf,CAAS,CAChD,OAAQvf,EAAG,CACV,KAAK,MAAM,uCAAwCA,CAAC,EACpDkI,EAAM,EAChB,CAEQ,GADA,KAAK,MAAM,iCAAkC,CAAC,CAACA,CAAG,EAC9CA,aAAe,UAAYA,IAAQ,GAAM,CACvCA,aAAe,UACjB,MAAM,KAAK,KAAKA,CAAG,EAErB,MAAM+2B,EAAe,SAAY,CAC/B,GAAI,KAAK,SAAW,GAAqB,KAAK,QAAU,EAAuB,CAC7E,MAAMp/B,EAAQ,IAAI,SAAS,KAAK,GAAG,EACnCA,EAAM,KAAO,MACbA,EAAM,KAAO,CACX,CAAC,QAAS,KAAK,SAAS,GAAG,EAC3B,CAAC,YAAa0f,CAAS,CACxB,EACD,MAAM1f,EAAM,KAAM,EAClB,KAAK,KAAKA,CAAK,EAAE,KAAK,IAAM,CAC1B,KAAK,QAAU,EACf,KAAK,SAAS,KAAK,QAAQ,EAC3B,KAAK,MAAM,2BAA2B,CACtD,CAAe,EAAE,MAAOG,GAAM,CACd,KAAK,QAAU,EACf,KAAK,SAAS,KAAK,cAAeA,CAAC,EACnC,KAAK,MAAM,wBAAyBA,CAAC,CACrD,CAAe,CACf,MACc,KAAK,MAAM,yDAA0D,KAAK,OAAO,CAEpF,EACGkI,IAAQ,MACL1J,EAAA,KAAK,MAAL,MAAAA,EAAU,OAIbygC,EAAc,EAAC,MAAOj/B,GAAM,CAC1B,QAAQ,MAAM,uBAAwBA,CAAC,CACvD,CAAe,GALD,KAAK,MAAM,kDAAkD,GAC7D4T,EAAA,KAAK,MAAL,MAAAA,EAAU,KAAK,eAAgBqrB,KAOnC,KAAK,QAAU,EACf,KAAK,SAAS,KAAK,QAAQ,CACrC,CACA,OAEM,KAAK,SAAS,KAAK,OAAQ1f,CAAS,CAE1C,CAKE,QAAQva,EAAO,CACb,KAAK,MAAM,sBAAsB,KAAK,SAAS,GAAG,IAAKA,CAAK,CAChE,CAKE,IAAI,QAAS,CACX,OAAO,KAAK,OAChB,CAKE,aAAc,CACZ,OAAO,KAAK,UAAY,CAC5B,CASE,YAAa,CACX,MAAMk6B,EAAY,KAAK,iBAAiB,UACxC,GAAIA,EAAU,OAAS,IAAM,EAAG,MAAO,GAEvC,MAAMC,EADMD,EAAU,OAAO,CAAC,EAAG9gC,IAAM,EAAIA,EAAG,CAAC,EAC7B8gC,EAAU,OACtBE,EAAWF,EAAU,IAAKv/B,IAAOA,EAAIw/B,IAAQ,CAAC,EAAE,OAAO,CAAC,EAAG/gC,IAAM,EAAIA,EAAG,CAAC,EAAI8gC,EAAU,OAG7F,OAFe,KAAK,KAAKE,CAAQ,EACL,qBAEhC,CAUE,MAAM,SAASC,EAAQ,CACrB,KAAK,SAAS,KAAK,SAAUA,CAAM,CACvC,CAWE,mBAAmBC,EAAU,EAAG,CAC9B,GAAI,KAAK,iBAAkB,OAC3B,GAAI,KAAK,aAAc,CACrB,KAAK,SAAS,KAAK,WAAY,KAAK,gBAAgB,EACpD,KAAK,QAAU,EACf,MACN,CACI,MAAMC,EAAiB,KAAK,YAAc,KAAK,IAAI,EAAG,KAAO,KAAK,IAAG,EAAK,KAAK,YAAY,EAAI,KAAO,KAAK,iBAAiB,SAAW,GACvI,KAAK,iBAAmB,WAAW,IAAM,CACvC,KAAK,iBAAmB,OACxB,KAAK,QAAU,EACf,KAAK,QAAO,EAAG,MAAOC,GAAS,CACzBF,EAAU,uBACZ,WACE,IAAM,CACJ,KAAK,mBAAmBA,EAAU,CAAC,CACpC,EACD,KAAOA,EAAU,GAAK,CACvB,EAED,KAAK,MAAM,kBAAkB,CAEvC,CAAO,CACF,EAAEC,CAAc,EACjB,KAAK,SAAS,KAAK,kBAAmBA,CAAc,EACpD,KAAK,MAAM,kBAAmBA,CAAc,EAC5C,KAAK,iBAAiB,gBAAkB,KAAK,IAAK,EAAGA,CACzD,CAQE,MAAM,KAAK9iB,EAAS,WACd,KAAK,SAAW,KAAqBne,EAAA,KAAK,KAAL,YAAAA,EAAS,cAAe,UAAU,OACzEE,EAAA,KAAK,KAAL,MAAAA,EAAS,KAAKie,IACd7I,EAAA,KAAK,WAAL,MAAAA,EAAA,UAAgB6I,EAAS,KAAK,SAAU,SAExC,KAAK,MAAM,oBAAoB,KAAK,SAAS,GAAG,8BAA8BA,CAAO,GAAI,KAAK,OAAO,CAE3G,CAOE,MAAM,KAAK5c,EAAO,CAChB,MAAMqsB,EAAM,IAAI,QAAQ,CAACjB,EAASQ,IAAW,CAC3C,MAAMrqB,EAAM,KAAK,mBAAmB,IAAIvB,EAAM,EAAE,GAAK,CAAE,EACvDuB,EAAI,KAAK,CAAE,QAAA6pB,EAAS,OAAAQ,CAAM,CAAE,EAC5B,KAAK,mBAAmB,IAAI5rB,EAAM,GAAIuB,CAAG,CAC/C,CAAK,EACD,YAAK,KAAK,WAAW,KAAK,UAAUvB,EAAM,SAAQ,CAAE,CAAC,GAAG,EACjDqsB,CACX,CAQE,MAAM,QAAQrsB,EAAO,CACnB,MAAMqsB,EAAM,IAAI,QAAQ,CAACjB,EAASQ,IAAW,CAC3C,MAAMrqB,EAAM,KAAK,mBAAmB,IAAIvB,EAAM,EAAE,GAAK,CAAE,EACnDuB,EAAI,OAAS,GACf,QAAQ,KAAK,iEAAiEvB,EAAM,EAAE,QAAQ,EAEhGuB,EAAI,KAAK,CAAE,QAAA6pB,EAAS,OAAAQ,CAAM,CAAE,EAC5B,KAAK,mBAAmB,IAAI5rB,EAAM,GAAIuB,CAAG,CAC/C,CAAK,EACD,YAAK,KAAK,YAAY,KAAK,UAAUvB,CAAK,CAAC,GAAG,EACvCqsB,CACX,CASE,MAAM,MAAMzB,EAAS7H,EAAQ,CAC3B,KAAK,SACL,MAAMkI,GAAKlI,GAAA,YAAAA,EAAQ,KAAM,SAAS,KAAK,MAAM,GACvCsJ,EAAM,IAAI,QAAQ,CAACjB,EAASQ,IAAW,CAC3C,KAAK,kBAAkB,IAAIX,EAAI,CAAE,QAAAG,EAAS,OAAAQ,EAAQ,CACxD,CAAK,EACD,YAAK,KAAK,aAAaX,CAAE,KAAK,KAAK,UAAUL,CAAO,EAAE,UAAU,CAAC,CAAC,EAAE,EAC7DyB,CACX,CACE,MAAMuT,EAAOpU,EAAQ,CACnB,KAAK,KAAK,aAAaoU,CAAK,IAAI,EAChC,MAAMnU,EAAM,KAAK,SAAS,IAAImU,CAAK,EACnC,KAAK,SAAS,OAAOA,CAAK,EACtBnU,GAAKA,EAAI,QAAQD,CAAM,CAC/B,CAQE,IAAIqU,EAAU,CACT,QAAK,KAAK,WAAWA,EAAS,KAAK,KAAK,KAAK,UAAUA,EAAS,cAAc,EAAE,UAAU,CAAC,CAAC,EAAE,IACjG,KAAK,SAAS,IAAIA,EAAS,MAAOA,CAAQ,CAC9C,CAwBE,IAAI,iBAAkB,CACpB,OAAO,KAAK,gBAChB,CAEE,IAAI,KAAM,CACR,OAAO,KAAK,SAAS,GACzB,CACE,IAAI,WAAY,OACd,OAAO,KAAK,SAAW,KAAqBphC,EAAA,KAAK,KAAL,YAAAA,EAAS,cAAe,UAAU,IAClF,CACA,EAGI,kBAAoB,KAAM,CAG5B,YAAYmgC,EAAU,CAFtB5U,EAAA,iBACAA,EAAA,cAEE,KAAK,SAAW4U,EAChB,KAAK,MAAQA,EAAS,MAAM,OAAO,WAAW,CAClD,CAWE,MAAM,QAAQ5+B,EAAO6+B,EAAY,KAAM,CACrC,IAAIzS,EACJ,MAAM0T,EAAmB,IAChB,IAAI,QAAQ,CAAC1U,EAASQ,IAAW,CACtC,GAAI,CACF,KAAK,aAAa5rB,CAAK,EAAE,KAAM+/B,GAAY,CACzC,KAAK,SAAS,KAAK,YAAa//B,CAAK,EACrCA,EAAM,KAAK,kBAAmB,KAAK,QAAQ,EAC3CorB,EAAQ,EAAI,CACxB,CAAW,EAAE,MAAMQ,CAAM,CAChB,OAAQC,EAAK,CACZD,EAAOC,CAAG,CACpB,CACA,CAAO,EAEGmU,EAAiB,IAAI,QAAQ,CAAC31B,EAAGuhB,IAAW,CAChDQ,EAAU,WAAW,IAAM,CACzBA,EAAU,OACVR,EAAO,IAAI,MAAM,YAAYiT,CAAS,IAAI,CAAC,CAC5C,EAAEA,CAAS,CAClB,CAAK,EACKoB,EAAmB,IAAM,CAC7BH,IAAmB,KAAMryB,GAAWyyB,EAAezyB,CAAM,CAAC,EAAE,MAAOoe,GAAQsU,EAActU,CAAG,CAAC,CAC9F,EACD,IAAIqU,EACAC,EACJ,MAAMC,EAAWvU,GAAQ,CACvB,WAAK,SAAS,MAAM,iBAAkBA,EAAK7rB,EAAM,EAAE,EACnD,KAAK,SAAS,KAAK,iBAAkBA,EAAO6rB,CAAG,EAC/C7rB,EAAM,KAAK,uBAAwB,KAAK,SAAU6rB,CAAG,EAC/CA,CACP,EACKwU,EAAY,IAAM,CAClBjU,GAAS,aAAaA,CAAO,EACjC,KAAK,SAAS,eAAe,UAAW6T,CAAgB,CACzD,EACD,OAAI,KAAK,SAAS,QAAU,EACnB,QAAQ,KAAK,CAACH,IAAoBE,CAAc,CAAC,EAAE,MAAMI,CAAO,EAAE,QAAQC,CAAS,GAExF,KAAK,SAAS,QAAU,GAC1B,QAAQ,KAAK,+DAAgE,KAAK,SAAS,GAAG,EAC9F,KAAK,SAAS,QAAS,GAEvB,QAAQ,KAAK,kEAAmE,KAAK,SAAS,GAAG,EAE5F,QAAQ,KAAK,CAClB,IAAI,QAAQ,CAACjV,EAASQ,IAAW,CAC/BsU,EAAiB9U,EACjB+U,EAAgBvU,EAChB,KAAK,SAAS,KAAK,UAAWqU,CAAgB,CACtD,CAAO,EACDD,CACD,CAAA,EAAE,MAAMI,CAAO,EAAE,QAAQC,CAAS,EACvC,CACE,MAAM,aAAargC,EAAO,CACxB,OAAO,KAAK,SAAS,aAAa,QAAQA,EAAM,UAAU,CAC9D,CACA,EAGA,SAAS,kBAAkB4qB,EAAS0V,EAAa,CAC/C,MAAMC,EAAW,CAAE,EACnB,UAAW9V,KAAUG,EAAS,CAC5B,MAAM5pB,EAAO,OAAO,QAAQypB,GAAU,CAAA,CAAE,EAAE,IAAI,CAAC,CAAC9nB,EAAKgoB,CAAM,IACrD,CAAC,QAAS,OAAO,EAAE,SAAShoB,CAAG,EAC1B,GAAGA,CAAG,IAAIgoB,CAAM,GAElBhoB,CACR,EAAE,KAAI,EAAG,KAAK,GAAG,EAClB49B,EAAS,KAAKv/B,CAAI,CACtB,CACE,IAAIiqB,EAAKqV,EAAc,IAAM,GAC7B,OAAArV,GAAMsV,EAAS,KAAK,GAAG,EAChBtV,CACT,CACA,SAAS,aAAaL,EAAS,CAC7B,MAAMnd,EAAS,CAAE,EACX+yB,EAAa,CAAE,EAGrB,OAFA5V,EAAQ,OAAQnb,GAAM,CAAC,CAACA,EAAE,KAAK,EAAE,QAASgxB,GAAoBhzB,EAAO,KAAKgzB,CAAe,CAAC,EAC1F7V,EAAUA,EAAQ,OAAQnb,GAAM,CAACA,EAAE,KAAK,EACpCmb,EAAQ,SAAW,EAAUnd,GACjCmd,EAAQ,QAASH,GAAW,CAC1B,OAAO,QAAQA,CAAM,EAAE,QAAQ,CAAC,CAAC9nB,EAAK0E,CAAK,IAAM,CAC3C,MAAM,QAAQA,CAAK,EACjBm5B,EAAW79B,CAAG,IAAM,OACtB69B,EAAW79B,CAAG,EAAI,CAAC,GAAG0E,CAAK,EAE3Bm5B,EAAW79B,CAAG,EAAI,MAAM,KAAqB,IAAI,IAAI,CAAC,GAAG69B,EAAW79B,CAAG,EAAG,GAAG0E,CAAK,CAAC,CAAC,EAGtFm5B,EAAW79B,CAAG,EAAI0E,CAE1B,CAAK,CACL,CAAG,EACM,CAAC,GAAGoG,EAAQ+yB,CAAU,EAC/B,CAGA,IAAI,qBAAuB,KAAM,CAqC/B,YAAYjV,EAAOmV,EAAaC,EAAe,CApC/C3W,EAAA,oBACAA,EAAA,aAAwB,IAAI,KAC5BA,EAAA,sBACAA,EAAA,cAIAA,EAAA,cAAS,GACTA,EAAA,gBACAA,EAAA,cAIAA,EAAA,aAAQ,IAKRA,EAAA,uBAIAA,EAAA,iBAIAA,EAAA,kBAIAA,EAAA,uBACAA,EAAA,UAAK,KAAK,OAAQ,EAAC,SAAS,EAAE,EAAE,UAAU,CAAC,GAW3CA,EAAA,eAMAA,EAAA,kBAA6B,IAAI,KAoIjCA,EAAA,2BAAsB,IAAM,CAC1B,GAAI,KAAK,SAAW,EACpB,IAAI,KAAK,MAAM,OAAS,EAAG,CACzB,KAAK,MAAM,0FAA2F,CACpG,OAAQ,KAAK,OACb,YAAa,KAAK,YAClB,MAAO,KAAK,MACZ,UAAW,KAAK,MAAM,KACtB,GAAI,KAAK,GACT,MAAO,KAAK,KACpB,CAAO,EACD,KAAK,QAAS,EACd,MACN,CACI,KAAK,MAAM,2BAA4B,CACrC,OAAQ,KAAK,OACb,YAAa,KAAK,YAClB,MAAO,KAAK,MACZ,UAAW,KAAK,MAAM,IAC5B,CAAK,EACD,KAAK,OAAS,EACd,KAAK,QAAS,EACf,GAUDA,EAAA,2BAAsB,IAAM,CAC1B,MAAM4W,EAAW,KAAK,MACtB,KAAK,MAAM,0BAA2B,KAAK,MAAM,IAAI,EACjD,KAAK,MACP,KAAK,MAAM,MAAM,KAAK,KAAK,EAE3B,KAAK,MAAM,sFAAuF,CAChG,SAAAA,CACR,CAAO,EAEH,KAAK,OAAS,OACd,KAAK,OAAS,EACd,KAAK,QAAS,EACd,KAAK,MAAM,kCAA0CA,EAAU,KAAK,KAAK,CAC7E,GAAK,KAAK,IAAI,GA7LV,KAAK,MAAQrV,EACb,KAAK,cAAgBoV,EACrB,KAAK,MAAQpV,EAAM,MAAM,OAAO,OAAO,KAAK,EAAE,GAAG,EACjD,KAAK,YAAcmV,GAAe,KAAK,SAAS,SAAS,EAAE,EAAE,UAAU,CAAC,CAC5E,CAEE,IAAI,OAAQ,CACV,OAAI,KAAK,OAAe,KAAK,QAC7B,KAAK,OAAS,KAAK,YAAY,MAAM,EAAG,EAAE,EACnC,KAAK,OAChB,CAEE,aAAaG,EAAM,CACjB,KAAK,WAAW,IAAIA,CAAI,CAC5B,CACE,QAAQvU,EAAc1B,EAAS,CAU7B,GATA,KAAK,MAAM,cAAe,CACxB,QAAAA,EACA,WAAY0B,EAAa,WACzB,OAAQ,KAAK,OACb,YAAa,KAAK,YAClB,GAAI,KAAK,MACT,MAAO,KAAK,MACZ,UAAW,KAAK,MAAM,IAC5B,CAAK,EACG,MAAK,MAAM,IAAIA,EAAa,UAAU,EAU1C,OATAA,EAAa,GAAG,QAAS,KAAK,WAAW,KAAK,KAAMA,CAAY,CAAC,EACjE,KAAK,MAAM,IAAIA,EAAa,WAAY,CAAE,aAAAA,EAAc,QAAA1B,EAAS,EAC7D,KAAK,SAAW,GACd0B,EAAa,QAAU,CAAC,KAAK,QAAU,KAAK,OAAO,OAAS,MAC1D,KAAK,SAAW,GAAmB,KAAK,SAAW,IACrD,KAAK,aAAaA,EAAa,KAAK,EAIlC,KAAK,OAAM,CACjB,IAAK,GACH,KAAK,sBAAsBA,CAAY,EACvC,MACF,IAAK,GACH,MACF,IAAK,GACH,KAAK,sBAAsBA,CAAY,EACvC,MACF,IAAK,GACH,WAAK,MAAM,uDAAwDA,EAAc1B,CAAO,EAClF,IAAI,MAAM,+CAA+C,CACvE,CACA,CAKE,WAAW0B,EAAc,CAEvB,GADA,KAAK,MAAM,OAAOA,EAAa,UAAU,EACrC,KAAK,MAAM,OAAS,EAAG,CACzB,GAAI,CAAC,KAAK,MAAO,OACjB,KAAK,MAAO,EACZ,KAAK,QAAS,CACpB,CACA,CACE,OAAQ,CACN,GAAI,KAAK,SAAW,EAAgB,OACpC,MAAMwU,EAAa,KAAK,OAExB,GADA,KAAK,OAAS,EACVA,IAAe,EACjB,GAAI,CACF,KAAK,MAAM,MAAM,KAAK,KAAK,CAC5B,OAAQ,EAAG,CACV,KAAK,MAAM,6BAA8B,EAAG,IAAI,CACxD,MAEM,KAAK,MAAM,0EAA2E,CACpF,MAAO,KAAK,MACZ,WAAAA,EACA,IAAK,IACb,CAAO,EAEH,KAAK,QAAS,CAClB,CACE,SAAU,CACJ,KAAK,gBAAgB,aAAa,KAAK,cAAc,EACzD,KAAK,MAAM,IAAI,QAAS,KAAK,mBAAmB,EAChD,KAAK,MAAM,IAAI,SAAU,KAAK,kBAAkB,EAC5C,KAAK,SAAS,KAAK,QAAQ,IAAI,CACvC,CACE,sBAAsBxU,EAAc,CAClC,GAAI,CAACA,EAAa,cAAe,CAC/B,KAAK,OAAS,EACd,KAAK,QAAS,EACd,MACN,CACI,GAAIA,EAAa,QAAQ,KAAM7B,GAAW,CAAC,CAACA,EAAO,KAAK,IACtD,KAAK,eAAiB,KAAK,eAAgB,EACvC,KAAK,eAAe,QAAU,IAAI,CACpC,KAAK,OAAS,EACd,KAAK,QAAS,EACd,MACR,CAEI,MAAMsW,EAAQzU,EAAa,eACrB0U,EAAY1U,EAAa,mBAC/B,GAAI,CAACyU,EAAO,MAAM,IAAI,MAAM,6CAA6C,EACzE,GAAI,KAAK,SAAW,EAClB,KAAK,SAASA,EAAOC,CAAS,MACzB,CACL,MAAMC,EAAoB,KAAK,UACzBC,EAAgB,KAAK,SAAW,KAAK,IAAK,EAChD,GAAID,IAAsB,YAAcD,IAAc,WAChDE,EAAgBH,IACd,KAAK,gBAAgB,aAAa,KAAK,cAAc,EACzD,KAAK,SAASA,EAAOC,CAAS,WAEvBC,IAAsB,YAAcD,IAAc,UACvDE,EAAgBH,IACd,KAAK,gBAAgB,aAAa,KAAK,cAAc,EACzD,KAAK,SAASA,EAAOC,CAAS,WAEvBC,IAAsB,WAAaD,IAAc,UACtDE,EAAgBH,IACd,KAAK,gBAAgB,aAAa,KAAK,cAAc,EACzD,KAAK,SAASA,EAAOC,CAAS,WAEvBC,IAAsB,WAAaD,IAAc,WACtDE,EAAgBH,IACd,KAAK,gBAAgB,aAAa,KAAK,cAAc,EACzD,KAAK,SAASA,EAAOC,CAAS,OAGhC,OAAM,IAAI,MAAM,kCAAkCC,CAAiB,IAAID,CAAS,EAAE,CAE1F,CACA,CACE,SAASD,EAAOC,EAAW,CACzB,KAAK,OAAS,EACd,MAAMG,EAAc,KAAK,IAAK,EAC9B,KAAK,SAAWA,EAAcJ,EAC9B,KAAK,UAAYC,EACjB,MAAMI,EAAQ,WAAW,KAAK,QAAQ,KAAK,IAAI,EAAGL,CAAK,EACnDC,IAAc,aAChB,KAAK,eAAiBI,EAE5B,CAwBE,eAAgB,CACV,KAAK,WAAW,KAAO,EACzB,KAAK,OAAS,MAAM,KAAK,KAAK,UAAU,EAAE,KAAK,GAAG,EAElD,KAAK,OAAS,KAAK,YAAY,MAAM,EAAG,EAAE,EAE5C,KAAK,QAAU,IAAI,KAAK,OAAQ,EAAC,SAAS,EAAE,EAAE,UAAU,EAAG,CAAC,CAAC,EACjE,CAiBE,SAAU,CACR,GAAI,KAAK,SAAW,EAGpB,IAAI,CAAC,KAAK,MAAM,UAAW,CACzB,KAAK,OAAS,EACd,KAAK,MAAM,gCAAiC,CAC1C,OAAQ,KAAK,OACb,GAAI,KAAK,MACT,YAAa,KAAK,YAClB,MAAO,KAAK,MACZ,UAAW,KAAK,MAAM,IAC9B,CAAO,EACD,KAAK,MAAM,KAAK,QAAS,KAAK,mBAAmB,EACjD,MACN,CACQ,KAAK,MAAM,OAAS,GACtB,KAAK,MAAM,KAAK,SAAU,KAAK,kBAAkB,EAEnD,KAAK,OAAS,EACd,KAAK,cAAe,EACpB,KAAK,eAAiB,KAAK,eAAgB,EAC3C,KAAK,MAAM,IAAI,IAAI,EACvB,CACE,SAAU,CACZ,CACE,QAAQphC,EAAO,CACb,KAAK,cAAc,cAAcA,EAAO,KAAK,KAAK,CACtD,CACE,OAAO4/B,EAAO,CAEZ,GADA,KAAK,MAAQ,GACTA,IAAU,KAAK,MAAO,CACxB,KAAK,MAAM,8CAA+CA,EAAO,KAAK,KAAK,EAC3E,KAAK,MAAM,MAAMA,CAAK,EACtB,MACN,CACQ,KAAK,MAAM,OAAS,GACtB,KAAK,MAAO,EAEd,SAAW,CAAE,aAAAtT,CAAc,IAAI,KAAK,MAAM,OAAM,EAC9CA,EAAa,aAAa,KAAK,KAAK,EAChCA,EAAa,cACf,KAAK,MAAM,gCAAiC,CAC1C,QAASA,EAAa,QACtB,WAAYA,EAAa,WACzB,OAAQ,KAAK,OACb,YAAa,KAAK,YAClB,MAAO,KAAK,MACZ,UAAW,KAAK,MAAM,IAChC,CAAS,EACD,KAAK,WAAWA,CAAY,EAGpC,CACE,QAAQ+U,EAAS,CACf,KAAK,OAAS,CAClB,CACE,SAAS7V,EAAQ,CACf,GAAKA,EACL,SAAW,CAAE,aAAAc,CAAc,IAAI,KAAK,MAAM,OAAM,EAC9CA,EAAa,eAAe,KAAK,MAAOd,CAAM,CAEpD,CAKE,gBAAiB,CACf,MAAM8V,EAAgB,CAAE,EAClB1W,EAAU,MAAM,KAAK,KAAK,MAAM,OAAQ,CAAA,EAAE,IAAKpZ,GAASA,EAAK,OAAO,EAC1E,GAAI,CAACoZ,EAAQ,CAAC,EACZ,YAAK,MAAM,yBAAiC,KAAK,KAAK,EACtD,QAAQ,MAAM,4BAA6B,KAAK,KAAK,EAC9C,CAAE,EAEX,MAAM2W,EAAc3W,EAAQ,CAAC,EAAE,OAC/B,QAASptB,EAAI,EAAGA,EAAI+jC,EAAa/jC,IAAK,CACpC,MAAMgkC,EAAoB5W,EAAQ,IAAKH,GAAWA,EAAOjtB,CAAC,CAAC,EAC3D8jC,EAAc,KAAK,GAAG,aAAaE,CAAiB,CAAC,CAC3D,CACI,OAAOF,CACX,CACA,EAGI,4BAA8B,KAAM,CAQtC,YAAY/V,EAAOkW,EAAmB,CAPtCzX,EAAA,cACAA,EAAA,sBACAA,EAAA,0BAME,KAAK,MAAQuB,EACb,KAAK,cAAgC,IAAI,IACzC,KAAK,kBAAoBkW,CAC7B,CAIE,gBAAgBhW,EAAKb,EAAS,CAC5B,IAAIiV,EACJ,GAAI,CAACpU,EAAI,cACPoU,EAAW,KAAK,mBAAmBpU,EAAKb,CAAO,MAC1C,CACL,MAAM8W,EAAW,kBAAkB9W,EAASa,EAAI,WAAW,EACvDiW,IAEF7B,GADqB,KAAK,cAAc,IAAI6B,CAAQ,GACxB,IAAI,KAAMC,GAASA,EAAK,OAAS,CAAgB,GAE/E9B,MAAa,KAAK,mBAAmBpU,EAAKb,EAAS8W,CAAQ,EACjE,CACI7B,EAAS,QAAQpU,EAAKb,CAAO,CACjC,CACE,mBAAmBgX,EAAMC,EAAUnB,EAAa,CAC9C,MAAMb,EAAW,IAAI,qBAAqB,KAAK,MAAOa,GAAe,KAAM,KAAK,iBAAiB,EACjGb,EAAS,QAAU,KAAK,yBAAyB,KAAK,IAAI,EAC1D,MAAMiC,EAAa,KAAK,cAAc,IAAIjC,EAAS,WAAW,GAAK,CAAE,EACrE,YAAK,cAAc,IAAIA,EAAS,YAAa,CAAC,GAAGiC,EAAYjC,CAAQ,CAAC,EAC/DA,CACX,CACE,yBAAyBpU,EAAK,CAC5B,IAAIqW,EAAa,KAAK,cAAc,IAAIrW,EAAI,WAAW,GAAK,CAAE,EACzDqW,EAEMA,EAAW,SAAW,EAC/B,KAAK,cAAc,OAAOrW,EAAI,WAAW,GAEzCqW,EAAaA,EAAW,OAAQ3gC,GAAMA,EAAE,KAAOsqB,EAAI,EAAE,EACrD,KAAK,cAAc,IAAIA,EAAI,YAAaqW,CAAU,GALlD,QAAQ,KAAK,4DAA6DrW,EAAI,WAAW,CAO/F,CACA,KAeI,UAAWhtB,GAAA,cAAwB+B,kBAAa,CA8ClD,YAAYipB,EAAK0V,EAAY9C,EAAK,CAChC,MAAO,EA9CTrS,EAAA,YACAA,EAAA,eACAA,EAAA,qBACAA,EAAA,aACAA,EAAA,kBACAA,EAAA,mBAIAA,EAAA,8BAIAA,EAAA,8BACAA,EAAA,0BAKAA,EAAA,2BAAsB,GAKtBA,EAAA,8BAAyB,GAMzBA,EAAA,eAAU,IACVA,EAAA,mBAAc,IACdA,EAAA,cAgHAA,EAAA,YACAA,EAAA,cAlGE,KAAK,IAAM,kBAAkBP,CAAG,EAChC,KAAK,OAAyB,IAAI,IAClC,KAAK,MAAQtmB,aAAM,aAAasmB,CAAG,EAAE,EACrC,KAAK,aAAe,IAAI,qBAAqB,KAAM4S,CAAG,EACtD,KAAK,aAAa,SAAWA,GAAA,YAAAA,EAAK,SAClC,KAAK,IAAM,KAAK,aAAa,IAAI,KAAK,KAAK,YAAY,EACvD,KAAK,MAAQ,KAAK,aAAa,MAAM,KAAK,KAAK,YAAY,EAC3D,KAAK,KAAO,IAAI,4BAA4B,KAAMA,EAAI,UAAU,EAChE,KAAK,UAAY,IAAI,kBAAkB,IAAI,EAC3C,KAAK,WAAa8C,EAClB,KAAK,sBAAwB9C,GAAA,YAAAA,EAAK,uBAClC,KAAK,sBAAwBA,GAAA,YAAAA,EAAK,sBAClC,KAAK,oBAAqBA,GAAA,YAAAA,EAAK,oBAAqB59B,GAAU,gCAAgC,KAAK,IAAI,EACvG,KAAK,sBAAuB,EACvB49B,GACH,QAAQ,MAAM,2BAA2B,CAE/C,CACE,uBAAwB,CACtB,WAAW,IAAM,CACf,KAAK,sBAAuB,CAC7B,EAAE,GAAG,CACV,CACE,IAAI,QAAS,CACX,OAAO,KAAK,aAAa,MAC7B,CACE,IAAI,iBAAkB,CACpB,OAAO,KAAK,aAAa,eAC7B,CAIE,MAAM,QAAQwC,EAAWC,EAAY,GAAM,CACzC,OAAO,KAAK,aAAa,QAAQD,EAAWC,CAAS,CACzD,CAIE,YAAa,CACP,KAAK,SAAW,GAGpB,KAAK,aAAa,WAAY,CAClC,CAQE,UAAUxS,EAAc1B,EAAS,CAC/B,KAAK,KAAK,gBAAgB0B,EAAc1B,CAAO,CACnD,CAWE,MAAM,QAAQ5qB,EAAO6+B,EAAY,KAAM,CACrC,OAAO,KAAK,UAAU,QAAQ7+B,EAAO6+B,CAAS,CAClD,CACE,eAAgB,CACd,MAAO,CAAC,CAAC,IAAK,KAAK,GAAG,CAAC,CAC3B,CACE,mBAAoB,CAClB,KAAK,qBACT,CACE,sBAAuB,CACrB,KAAK,wBACT,CAIE,IAAI,iBAAkB,CACpB,OAAI,KAAK,yBAA2B,EAC3B,EAEF,KAAK,qBAAuB,KAAK,oBAAsB,KAAK,uBACvE,CACE,qBAAsB,CACpB,OAAI,KAAK,QACA,GAEL,KAAK,wBAA0B,OAC1B,GAEF,KAAK,gBAAkB,KAAK,qBACvC,CACE,IAAI,WAAY,CACd,OAAO,KAAK,aAAa,SAC7B,CAGA,EAjHE7U,EAlCavrB,GAkCN,iCAAiC,CAAC8sB,EAAOwW,EAAgBC,IAAuB,CACrF,GAAIzW,EAAM,wBAA0B,QAAUA,EAAM,wBAA0B,OAAQ,MAAO,GAC7F,IAAI0W,EAAW1W,EAAM,gBACrB,GAAIA,EAAM,gBAAkBA,EAAM,sBAAuB,CACvD,MAAM2W,EAASH,EAAiB,IAChCE,EAAW,KAAK,IAAI1W,EAAM,sBAAuBA,EAAM,gBAAkB2W,CAAM,CACrF,CACI,OAAID,EAAW1W,EAAM,gBACZ0W,EAEF1W,EAAM,eACd,GA7CY9sB,IAsJX,gBAAkB,cAAc,KAAM,CAOxC,YAAYme,EAASulB,EAAQC,EAAmBC,EAAkB,CAChE,MAAMzlB,CAAO,EAPfoN,EAAA,eACAA,EAAA,0BAIAA,EAAA,yBAGE,KAAK,OAASmY,EACd,KAAK,kBAAoBC,EACzB,KAAK,iBAAmBC,CAC5B,CACE,IAAI,aAAc,CAChB,MAAMF,EAAS,CAAE,EACjB,SAAW,CAAC5W,EAAOM,CAAG,IAAK,KAAK,OAC9BsW,EAAO,KAAK,GAAG5W,EAAM,GAAG,KAAKM,CAAG,EAAE,EAEpC,OAAOsW,EAAO,KAAK;AAAA,CAAI,CAC3B,CACA,EACI,YAAc,MAAMG,EAAa,CAKnC,YAAY/V,EAAQ8P,EAAKQ,EAAM,CAJ/B7S,EAAA,eACAA,EAAA,cACAA,EAAA,YACAA,EAAA,aAEE,KAAK,OAASuC,EACd,KAAK,IAAM8P,EACX,KAAK,KAAOQ,GAAQR,EAAI,KACxB,KAAK,MAAQA,EAAI,MAAM,OAAO,UAAU,CAC5C,CAIE,SAAS9Q,EAAO,CACd,KAAK,OAAO,IAAIA,CAAK,CACzB,CACE,IAAI,WAAY,CACd,OAAO,MAAM,KAAK,KAAK,MAAM,EAAE,IAAKvmB,GAAMA,EAAE,GAAG,CACnD,CAYE,OAAO,cAAcu9B,EAAWlG,EAAKmG,EAAU,GAAM3F,EAAM,CAEzD,GADAA,EAAOA,GAAQR,EAAI,KACf,CAACQ,EAAM,MAAM,IAAI,MAAM,kBAAkB,EAC7C,MAAMtQ,EAAyB,IAAI,IACnC,UAAW9C,KAAO8Y,EAAW,CAC3B,MAAMhX,EAAQsR,EAAK,OAAO,IAAI,kBAAkBpT,CAAG,CAAC,EACpD,GAAI8B,EACEA,EAAM,OAAS,GAAqBiX,GACtCjX,EAAM,QAAS,EAEjBgB,EAAO,IAAIhB,CAAK,MACX,CACL,MAAMkX,EAAiB,IAAI,SAAS,kBAAkBhZ,CAAG,EAAG4S,GAAA,YAAAA,EAAK,uBAAwBA,CAAG,EAC5FQ,EAAK,kBAAkB4F,EAAgB,OAAQ,gCAAgCF,CAAS,EAAE,EAC1FhW,EAAO,IAAIkW,CAAc,CACjC,CACA,CACI,OAAO,IAAIH,GAAa,IAAI,IAAI/V,CAAM,EAAG8P,EAAKQ,CAAI,CACtD,CAgDE,MAAM,QAAQ78B,EAAO6+B,EAAW6D,EAAqB,EAAG,OACtD,MAAMN,EAAoC,IAAI,IACxCD,EAAyB,IAAI,IAC7BQ,EAAe3iC,EAAM,YAAa,EACxCA,EAAM,cAAgB,UACtB,MAAM4iC,EAAyBrX,GAAU,CACvC6W,EAAkB,IAAI7W,CAAK,CAC5B,EACDvrB,EAAM,GAAG,kBAAmB4iC,CAAqB,EACjD,GAAI,CACF,MAAMC,EAAW,MAAM,KAAK,KAAK,MAAM,EAAE,IAAKtX,GACrC,IAAI,QAASH,GAAY,CAC9B,MAAM0X,EAAYjE,EAAY,WAAW,IAAM,CACxCuD,EAAkB,IAAI7W,CAAK,IAC9B4W,EAAO,IAAI5W,EAAO,IAAI,MAAM,yBAAyBsT,CAAS,IAAI,CAAC,EACnEzT,EAAQ,EAAK,EAE3B,EAAayT,CAAS,EAAI,KAChBtT,EAAM,QAAQvrB,EAAO6+B,CAAS,EAAE,KAAMkE,GAAY,CAC5CD,GAAW,aAAaA,CAAS,EACjCC,GACFX,EAAkB,IAAI7W,CAAK,EAC3BH,EAAQ,EAAI,GAEZA,EAAQ,EAAK,CAE3B,CAAW,EAAE,MAAOS,GAAQ,CACZiX,GAAW,aAAaA,CAAS,EAChCH,GACHR,EAAO,IAAI5W,EAAOM,CAAG,EAEvBT,EAAQ,EAAK,CACzB,CAAW,CACX,CAAS,CACF,EAED,GADA,MAAM,QAAQ,IAAIyX,CAAQ,EACtBT,EAAkB,KAAOM,GAC3B,GAAI,CAACC,EAAc,CACjB,MAAMx9B,EAAQ,IAAI,gBAChB,uCACAg9B,EACAC,EACA,IACD,EACD,MAAApiC,EAAM,cAAgB,QACtBA,EAAM,aAAemF,GACrB1G,EAAA,KAAK,MAAL,MAAAA,EAAU,KAAK,uBAAwBuB,EAAOmF,EAAO,KAAK,WACpDA,CAChB,OAEQnF,EAAM,cAAgB,UACtBA,EAAM,KAAK,YAAa,CAAE,SAAU,KAAM,kBAAAoiC,EAAmB,EAE/D,OAAOA,CACb,QAAc,CACRpiC,EAAM,IAAI,kBAAmB4iC,CAAqB,CACxD,CACA,CACE,IAAI,MAAO,CACT,OAAO,KAAK,OAAO,IACvB,CACA,EAGI,EAAIvgC,aAAY,sBAAsB,EAC1C,eAAe,2BAA2Bg6B,EAAKr8B,EAAO,OACpD,MAAMusB,EAAyB,IAAI,IAC7ByW,EAAoB,MAAM,kBAAkB3G,EAAKr8B,EAAM,MAAM,EAC/DgjC,GACFA,EAAkB,QAAS9P,GAAa,OACtC,MAAM3H,GAAQ9sB,EAAA49B,EAAI,OAAJ,YAAA59B,EAAU,SAASy0B,GAC7B3H,GAAOgB,EAAO,IAAIhB,CAAK,CACjC,CAAK,EAEH,IAAI0X,EAAajjC,EAAM,KAAK,OAAQ6e,GAAQ,CAAC,IAAK,GAAG,EAAE,SAASA,EAAI,CAAC,CAAC,CAAC,EAAE,IAAKA,GAAQA,EAAI,CAAC,CAAC,EAAE,OAAQ4K,GAAQA,GAAA,YAAAA,EAAK,WAAW,SAAS,EAAE,OAAQA,GAAQ,CACvJ,GAAI,CACF,WAAI,IAAIA,CAAG,EACJ,EACb,MAAY,CACN,MAAO,EACb,CACG,CAAA,EAAE,IAAKA,GAAQ,kBAAkBA,CAAG,CAAC,EACtCwZ,EAAa,MAAM,KAAK,IAAI,IAAIA,CAAU,CAAC,EAAE,MAAM,EAAG,CAAC,EACvDA,EAAW,QAAS/P,GAAa,OAC/B,MAAM3H,GAAQ9sB,EAAA49B,EAAI,OAAJ,YAAA59B,EAAU,SAASy0B,EAAU,GAAM,IAC7C3H,IACF,EAAE,uBAAwB2H,CAAQ,EAClC3G,EAAO,IAAIhB,CAAK,EAEtB,CAAG,EACD,MAAM2X,EAAQljC,EAAM,gBAAgB,GAAG,EAAE,IAAK6e,GAAQA,EAAI,CAAC,CAAC,EAC5D,OAAIqkB,EAAM,OAAS,EACK,MAAM,KAC1B,iCAAiC7G,EAAK6G,EAAO,OAAQ,CACnD,gBAAiB,IAAI,IAAIF,CAAiB,CAC3C,CAAA,EAAE,KAAI,CACR,EACa,QAAS9P,GAAa,OAClC,MAAM3H,GAAQ9sB,EAAA49B,EAAI,OAAJ,YAAA59B,EAAU,SAASy0B,EAAU,GAAO,IAC9C3H,IACF,EAAE,2BAA4B2H,CAAQ,EACtC3G,EAAO,IAAIhB,CAAK,EAExB,CAAK,EAED,EAAE,iCAAkC2X,EAAM,MAAM,GAElDzkC,EAAA49B,EAAI,OAAJ,MAAA59B,EAAU,8BAA8B,QAAS8sB,GAAUgB,EAAO,IAAIhB,CAAK,GACpE,IAAI,YAAYgB,EAAQ8P,CAAG,CACpC,CACA,SAAS,6BAA6BA,EAAKzR,EAASiS,EAAM,CACxD,MAAMpvB,EAAyB,IAAI,IAC7B6uB,EAA0B,IAAI,IAMpC,GALA1R,EAAQ,QAASH,GAAW,CACtBA,EAAO,SACTA,EAAO,QAAQ,QAASqF,GAAWwM,EAAQ,IAAIxM,CAAM,CAAC,CAE5D,CAAG,EACGwM,EAAQ,KAAO,EAAG,CACpB,MAAM6G,EAAoB,8BAA8B9G,EAAK,MAAM,KAAKC,CAAO,CAAC,EAChF,UAAWpJ,KAAYiQ,EAAkB,OACvC11B,EAAO,IAAIylB,EAAU,EAAE,EAEzB,UAAWzI,KAAUG,EACnB,GAAIH,EAAO,QACT,SAAW,CAACyI,EAAUkQ,CAAQ,IAAKD,EAAkB,QAAO,EAAI,CAC9D,MAAME,EAAyC5Y,EAAO,QAAQ,OAC3DqF,GAAWsT,EAAS,SAAStT,CAAM,CACrC,EACDriB,EAAO,IAAIylB,EAAU,CACnB,GAAGzlB,EAAO,IAAIylB,CAAQ,EACtB,CACE,GAAGzI,EAGH,QAAS4Y,CACvB,CACA,CAAW,CACX,KAEQ,WAAWnQ,KAAYiQ,EAAkB,OACvC11B,EAAO,IAAIylB,EAAU,CAAC,GAAGzlB,EAAO,IAAIylB,CAAQ,EAAGzI,CAAM,CAAC,CAIhE,MACQ4R,EAAI,mBACNA,EAAI,kBAAkB,QAASnJ,GAAa,CAC1CzlB,EAAO,IAAIylB,EAAUtI,CAAO,CACpC,CAAO,EAGL,OAAInd,EAAO,OAAS,GAClBovB,EAAK,4BAA6B,EAAC,MAAM,EAAG,CAAC,EAAE,QAAStR,GAAU,CAChE9d,EAAO,IAAI8d,EAAM,IAAKX,CAAO,CACnC,CAAK,EAEInd,CACT,CACA,SAAS,8BAA8B4uB,EAAKzR,EAASiS,EAAM,CAEzD,OADU,6BAA6BR,EAAKzR,EAASiS,CAAI,CAE3D,CAIA,SAAS,UAAUyG,EAAOC,EAAO,CAC/B,MAAMC,EAAyB,IAAI,IAC7BC,EAAe5kB,GAAQA,EAAI,KAAK,GAAG,EACnC6kB,EAAc,CAACC,EAASC,IACrBD,EAAQ,MAAM,CAACt8B,EAAOhK,IAAUgK,IAAUu8B,EAAOvmC,CAAK,CAAC,EAE1DwmC,EAAchlB,GAAQ,CAC1B,SAAW,CAAClc,EAAKmhC,CAAW,IAAKN,EAC/B,GAAIE,EAAYI,EAAajlB,CAAG,GAAK6kB,EAAY7kB,EAAKilB,CAAW,EAAG,CAC9DjlB,EAAI,QAAUilB,EAAY,QAC5BN,EAAO,IAAI7gC,EAAKkc,CAAG,EAErB,MACR,CAEI2kB,EAAO,IAAIC,EAAY5kB,CAAG,EAAGA,CAAG,CACjC,EACD,OAAAykB,EAAM,OAAOC,CAAK,EAAE,QAAQM,CAAU,EAC/B,MAAM,KAAKL,EAAO,OAAM,CAAE,CACnC,CAmBA,IAAI,aAAe,WAAgD,mDAAA,GAAA,EACnE,SAAS,iBAAiB1P,EAAS,CACjC,MAAMiQ,EAAWjQ,EAAQ,MAAM,YAAY,EACrCkQ,EAAyB,IAAI,IAC7BnlB,EAAsB,IAAI,IAChC,GAAIklB,EACF,UAAWE,KAAWF,EAChBC,EAAO,IAAIC,EAAQ,MAAM,CAAC,CAAC,IAC/BplB,EAAI,IAAIolB,EAAQ,MAAM,CAAC,CAAC,EACxBD,EAAO,IAAIC,EAAQ,MAAM,CAAC,CAAC,GAG/B,OAAO,MAAM,KAAKplB,CAAG,CACvB,CACA,eAAe,oBAAoBiV,EAAST,EAAO,GAAI,CACrD,MAAM6Q,EAAW,2DACXrB,EAAW,CAAE,EACbsB,EAAerkB,GAAM,CACpBuT,EAAK,KAAMzkB,GAAO,CAAC,IAAKkR,EAAE,CAAC,CAAC,EAAE,SAASlR,EAAG,CAAC,CAAC,GAAKA,EAAG,CAAC,IAAMkR,EAAE,CAAC,CAAC,GAClEuT,EAAK,KAAKvT,CAAC,CAEd,EACDgU,EAAUA,EAAQ,QAAQoQ,EAAWrlB,GAAQ,CAC3C,GAAI,CACF,MAAMulB,EAASvlB,EAAI,MAAM,YAAY,EAAE,CAAC,EAClC,CAAE,KAAA3d,EAAM,KAAAoF,CAAI,EAAKsnB,cAAM,OAAOwW,CAAM,EAC1C,IAAItkB,EACJ,OAAQ5e,EAAI,CACV,IAAK,OACH4e,EAAI,CAAC,IAAKxZ,CAAI,EACd,MACF,IAAK,WACHwZ,EAAI,CAAC,IAAKxZ,EAAK,MAAM,EACrB,MACF,IAAK,OACHu8B,EAAS,KACP,IAAI,QAAQ,MAAOzX,GAAY,CAC7B+Y,EAAY,CAAC,IAAK79B,EAAM,MAAM,sBAAsB89B,CAAM,CAAC,CAAC,EAC5DhZ,EAAS,CACV,CAAA,CACF,EACD,MACF,IAAK,SACHyX,EAAS,KACP,IAAI,QAAQ,MAAOzX,GAAY,CAC7B,KAAM,CAAE,GAAAH,EAAI,OAAA6E,CAAM,EAAKxpB,EACvB,GAAI,CAAE,OAAAimB,CAAM,EAAKjmB,GACb,CAACimB,GAAUA,EAAO,SAAW,KAC/BA,EAAS,CAAC,MAAM,sBAAsB6X,CAAM,CAAC,GAE/CD,EAAY,CAAC,IAAKlZ,EAAIsB,EAAO,CAAC,CAAC,CAAC,EAC5BuD,GAAQqU,EAAY,CAAC,IAAKrU,CAAM,CAAC,EACrC1E,EAAS,CACV,CAAA,CACF,EACD,MACF,IAAK,QACHyX,EAAS,KACP,IAAI,QAAQ,MAAOzX,GAAY,CAC7B,MAAMH,EAAK,CAAC3kB,EAAK,KAAMA,EAAK,OAAQA,EAAK,UAAU,EAAE,KAAK,GAAG,EAC7D,IAAIimB,EAASjmB,EAAK,QAAU,CAAE,EAC1BimB,EAAO,SAAW,IACpBA,EAAS,CAAC,MAAM,sBAAsB6X,CAAM,CAAC,GAE/CD,EAAY,CAAC,IAAKlZ,EAAIsB,EAAO,CAAC,CAAC,CAAC,EAChC4X,EAAY,CAAC,IAAK79B,EAAK,MAAM,CAAC,EAC9B8kB,EAAS,CACV,CAAA,CACF,EACD,MACF,QACE,OAAOvM,CACjB,CACM,OAAIiB,GAAGqkB,EAAYrkB,CAAC,EACb,SAASskB,CAAM,EACvB,MAAgB,CACf,OAAOvlB,CACb,CACA,CAAG,EACD,MAAM,QAAQ,IAAIgkB,CAAQ,EAC1B,MAAMwB,EAAU,iBAAiBvQ,CAAO,EAAE,IAAKmQ,GAAY,CAAC,IAAKA,CAAO,CAAC,EACzE,OAAA5Q,EAAO,UAAUA,EAAMgR,CAAO,EACvB,CAAE,QAAAvQ,EAAS,KAAAT,CAAM,CAC1B,CACA,eAAe,sBAAsBiR,EAAU,CAC7C,MAAO,EACT,CAGA,eAAe,QAAQnR,EAAWoR,EAAQC,EAAS,QAAS,CAC1D,IAAIC,EACJ,GAAI,CAAC,KAAK,IAAK,MAAM,IAAI,MAAM,wBAAwB,EACvD,IAAIC,EAAgBH,EAKpB,GAJKG,IACH,KAAK,IAAI,aAAc,EACvBA,EAAgB,KAAK,IAAI,QAEvB,CAACA,EAAe,MAAM,IAAI,MAAM,eAAe,EACnD,MAAMC,EAAmBxR,IAAc,IAAM,CAC3C,MAAM+P,EAAQ,KAAK,gBAAgB,GAAG,EACtC,GAAIA,EAAM,SAAW,EACnB,MAAM,IAAI,MAAM,yEAAyE,EAE3F,OAAO,KAAK,IAAI,QAAQ,CAAE,OAAQA,EAAM,CAAC,EAAE,CAAC,EAAG,CACnD,GAAM,EAOJ,GANIsB,IAAW,SAAW,MAAM,oBAAoBE,EAAe,OAAO,IACxED,EAAY,MAAMC,EAAc,QAAQC,EAAkB,KAAK,QAAS,OAAO,IAE5E,CAACF,GAAaD,IAAW,UAAY,MAAM,oBAAoBE,EAAe,OAAO,IACxFD,EAAY,MAAMC,EAAc,QAAQC,EAAkB,KAAK,QAAS,OAAO,GAE7E,CAACF,EAAW,MAAM,IAAI,MAAM,0BAA0B,EAC1D,KAAK,QAAUA,CACjB,CACA,eAAe,QAAQG,EAAQL,EAAQC,EAAQ,aAC7C,IAAI7lC,GAAAF,EAAA,KAAK,MAAL,YAAAA,EAAU,eAAV,MAAAE,EAAwB,kBAAmB,CAC7C,IAAIkmC,EAAc,KAIlB,GAHI,OAAO,KAAK,IAAI,aAAa,mBAAsB,aACrDA,EAAc,KAAK,IAAI,aAAa,kBAAkB,KAAK,EAAE,GAE3DA,EAAa,CACf,KAAK,QAAUA,EAAY,QAC3B,MACN,CACA,CACE,IAAIC,EACJ,GAAI,CAAC,KAAK,IAAK,MAAM,IAAI,MAAM,wBAAwB,EACvD,IAAIJ,EAAgBH,EAKpB,GAJKG,IACH,KAAK,IAAI,aAAc,EACvBA,EAAgB,KAAK,IAAI,QAEvB,CAACA,EAAe,MAAM,IAAI,MAAM,eAAe,EACnD,MAAMK,EAAgBH,GAAU,KAAK,OACrC,GAAI,CAACG,EAAe,MAAM,IAAI,MAAM,4CAA4C,EAChF,MAAMC,EAAgBR,IAAW,KAAK,QAAQ,MAAM,QAAQ,EAAI,QAAU,SAO1E,IANKQ,IAAkB,SAAW,KAAK,OAAS,IAAM,MAAM,oBAAoBN,EAAe,OAAO,GAAK,KAAK,QAAQ,OAAO,QAAQ,IACrII,EAAY,MAAMJ,EAAc,QAAQK,EAAe,KAAK,QAAS,OAAO,GAE1E,CAACD,GAAaE,IAAkB,SAAW,MAAM,oBAAoBN,EAAe,OAAO,IAC7FI,EAAY,MAAMJ,EAAc,QAAQK,EAAe,KAAK,QAAS,OAAO,GAE1E,CAACD,EAAW,MAAM,IAAI,MAAM,0BAA0B,EAC1D,KAAK,QAAUA,GACX/W,GAAAha,EAAA,KAAK,MAAL,YAAAA,EAAU,eAAV,MAAAga,EAAwB,mBAC1B,KAAK,IAAI,aAAa,kBAAkB,IAAI,CAEhD,CACA,eAAe,oBAAoBwW,EAAQC,EAAQ,CACjD,OAAKD,EAAO,kBACPC,EACE,EAAQ,MAAMD,EAAO,kBAAkBC,CAAM,EADhC,GADkB,EAGxC,CAuEA,SAAS,oBAAoBxkC,EAAO,CAClC,UAAW6e,KAAO7e,EAAM,KACtB,GAAI6e,EAAI,CAAC,IAAM,MAAQA,EAAI,CAAC,GAAK,IAAI,OAAS,EAAG,MAAO,GAE1D,MAAO,EACT,CAQA,SAAS,WAAW7e,EAAOilC,EAAW,CACpCA,MAAcjlC,EAAM,QAAS,GAC7B,MAAMklC,EAAellC,EAAM,KAAK,KAAK,YAAY,EACjD,GAAI,CAACklC,EAAc,CACjB,GAAI,oBAAoBllC,CAAK,EAAG,OAChC,MAAMmlC,EAAenlC,EAAM,gBAAgBilC,CAAS,EACpD,GAAIE,EAAa,OAAS,EAAG,OAAOA,EAAa,CAAC,CACtD,CACE,OAAOD,CACT,CACA,IAAI,cAAgC,IAAI,IAAI,CAAC,IAAK,IAAK,GAAG,CAAC,EACvD,eAAiC,IAAI,IAAI,CAAC,IAAK,IAAK,GAAG,CAAC,EAC5D,SAAS,YAAYllC,EAAOilC,EAAW,CACrC,GAAIjlC,EAAM,OAAS,KAAyB,CAC1C,IAAIolC,EACJ,UAAWvmB,KAAO7e,EAAM,KACtB,GAAI,cAAc,IAAI6e,EAAI,CAAC,CAAC,EAAGumB,EAAYvmB,UAClC,eAAe,IAAIA,EAAI,CAAC,CAAC,EAAG,CACnCumB,EAAYvmB,EACZ,KACR,CAEI,OAAOumB,CACX,CACEH,MAAcjlC,EAAM,QAAS,GAC7B,IAAIqlC,EAAc,GACdC,EACJ,UAAWzmB,KAAO7e,EAAM,KACtB,GAAI6e,EAAI,CAAC,IAAMomB,EAEf,KADKpmB,EAAI,CAAC,GAAK,IAAI,OAAS,IAAGwmB,EAAc,IACzCA,GAAexmB,EAAI,CAAC,IAAM,QAAS,OAAOA,EAC1CwmB,GAAexmB,EAAI,CAAC,IAAM,SAAQymB,EAAWzmB,GAC5CwmB,IAAaC,EAAWzmB,GAE/B,OAAOymB,CACT,CACA,SAAS,aAAazmB,EAAK,CACzB,OAAOA,EAAI,CAAC,IAAM,KAAOA,EAAI,CAAC,IAAM,MACtC,CAGA,eAAe,iBAAiBA,EAAK0mB,EAAQ,CAC3C,GAAI,CAAC,KAAK,IAAK,MAAM,IAAI,MAAM,wBAAwB,EACvD,MAAM,EAAI,KAAK,gBAAgB1mB,EAAK0mB,CAAM,EAC1C,GAAI,EAAE,SAAW,EAAG,OACpB,KAAM,CAACl7B,EAAG4gB,EAAIua,CAAI,EAAI,EAAE,CAAC,EACzB,IAAIja,EAAQia,IAAS,GAAK,KAAK,IAAI,KAAK,SAASA,CAAI,EAAI,OAEzD,OADc,MAAM,KAAK,IAAI,WAAWva,EAAI,CAAE,EAAEM,CAAK,CAEvD,CACA,eAAe,eAAeka,EAAS,CACrC,GAAI,CAAC,KAAK,IAAK,MAAM,IAAI,MAAM,wBAAwB,EACvD,MAAMC,EAAU,WAAW,IAAI,EAC/B,GAAKA,EACL,OAAO,KAAK,IAAI,kBAAkBA,EAAS,KAAMD,CAAO,CAC1D,CACA,eAAe,gBAAgBA,EAAS,CACtC,GAAI,CAAC,KAAK,IAAK,MAAM,IAAI,MAAM,wBAAwB,EACvD,MAAMH,EAAW,YAAY,IAAI,EACjC,GAAKA,EACL,OAAO,KAAK,IAAI,kBAAkBA,EAAU,KAAMG,CAAO,CAC3D,CAGA,SAAS,eAAgB,CACvB,GAAI,KAAK,OAAS,OAAQ,MAAM,IAAI,MAAM,cAAc,EACxD,MAAO,CAAC,EAAG,CAAC,EAAE,SAAS,KAAK,IAAI,GAAK,KAAK,MAAQ,KAAO,KAAK,KAAO,KAAO,KAAK,MAAQ,KAAO,KAAK,KAAO,GAC9G,CACA,SAAS,aAAc,CACrB,GAAI,KAAK,OAAS,OAAQ,MAAM,IAAI,MAAM,cAAc,EACxD,OAAO,KAAK,MAAQ,KAAO,KAAK,KAAO,GACzC,CACA,SAAS,oBAAqB,CAC5B,GAAI,KAAK,OAAS,OAAQ,MAAM,IAAI,MAAM,cAAc,EACxD,OAAO,KAAK,MAAQ,KAAO,KAAK,KAAO,GACzC,CAIA,IAAI,oBAAsB,EAC1B,SAAS,OAAOE,EAAgB,oBAAqB,CACnD,IAAIpZ,EAAS,CAAE,EASf,OARI,KAAK,SAAS,OAAS,EACzBA,EAAS,KAAK,SAAS,IAAKhB,GAAUA,EAAM,GAAG,EACtC,KAAK,QACdgB,EAAS,CAAC,KAAK,MAAM,GAAG,GAEtBA,EAAO,OAASoZ,IAClBpZ,EAASA,EAAO,MAAM,EAAGoZ,CAAa,GAEpC,KAAK,qBACAC,cAAO,YAAY,CACxB,KAAM,KAAK,KACX,OAAQ,KAAK,OACb,WAAY,KAAK,gBAAiB,EAClC,OAAArZ,CACN,CAAK,EAECA,EAAO,OAAS,EACXqZ,cAAO,aAAa,CACzB,GAAI,KAAK,MAAO,EAChB,OAAArZ,EACA,OAAQ,KAAK,MACnB,CAAK,EAEIqZ,cAAO,WAAW,KAAK,MAAK,CAAE,CACvC,CAGA,eAAe,OAAOC,EAAU,GAAMtB,EAAQ,CAC5C,GAAI,CAACA,GAAUsB,EAAS,CACtB,GAAI,CAAC,KAAK,IAAK,MAAM,IAAI,MAAM,uBAAuB,EACtD,KAAK,IAAI,aAAc,EACvBtB,EAAS,KAAK,IAAI,MACtB,CACE,MAAMpkC,EAAI,IAAI,SAAS,KAAK,IAAK,CAC/B,KAAM,QAAQ,IAAI,CACtB,CAAG,EACD,OAAK,KAAK,cAAaA,EAAE,QAAU,KAAK,UAAU,KAAK,UAAU,GACjEA,EAAE,IAAI,IAAI,EACN,KAAK,OAAS,GAChBA,EAAE,KAAK,KAAK,CAAC,IAAK,GAAG,KAAK,IAAI,EAAE,CAAC,EAE/BokC,GAAQ,MAAMpkC,EAAE,KAAKokC,CAAM,EAC3BsB,GAAS,MAAM1lC,EAAE,QAAS,EACvBA,CACT,CACA,SAAS,QAAQH,EAAO,CACtB,OAAIA,EAAM,OAAS,EACV,EAEF,EACT,CAGA,SAAS,UAAU8lC,EAAa,GAAOC,EAAY,GAAO,CACxD,MAAM9Z,EAAU,CAAC,EAAG,KAAK,OAAQ,KAAK,WAAY,KAAK,KAAM,KAAK,KAAM,KAAK,OAAO,EACpF,OAAI6Z,GAAY7Z,EAAQ,KAAK,KAAK,GAAG,EACjC8Z,GAAW9Z,EAAQ,KAAK,KAAK,EAAE,EAC5B,KAAK,UAAUA,CAAO,CAC/B,CACA,SAAS,YAAY+Z,EAAiB,CACpC,MAAMC,EAAa,KAAK,MAAMD,CAAe,EACvC3Z,EAAM,CACV,OAAQ4Z,EAAW,CAAC,EACpB,WAAYA,EAAW,CAAC,EACxB,KAAMA,EAAW,CAAC,EAClB,KAAMA,EAAW,CAAC,EAClB,QAASA,EAAW,CAAC,CACtB,EACD,OAAIA,EAAW,QAAU,IAAG5Z,EAAI,IAAM4Z,EAAW,CAAC,GAC9CA,EAAW,QAAU,IAAG5Z,EAAI,GAAK4Z,EAAW,CAAC,GAC1C5Z,CACT,CASA,IAAI,OACA,gBAAkB,CAAE,EACxB,SAAS,0BAA0BhrB,EAAG,CACpC,OAASA,EACT,OAAO,UAAayF,GAAQ,CAC1B,KAAM,CAACo/B,EAASz4B,CAAM,EAAI3G,EAAI,KACxBq/B,EAAS,gBAAgBD,CAAO,EACtC,GAAI,CAACC,EAAQ,CACX,QAAQ,MAAM,4BAA6BD,CAAO,EAClD,MACN,CACI,OAAO,gBAAgBA,CAAO,EAC9B,UAAW9a,KAAW+a,EAAO,SAC3B/a,EAAQ3d,CAAM,CAEjB,CACH,CACA,eAAe,qBAAqBzN,EAAOomC,EAAU,CAiBnD,OAhBgB,IAAI,QAAShb,GAAY,CACvC,MAAMib,EAAarmC,EAAM,UAAW,EACpC,IAAIsmC,EAAU,GACT,gBAAgBtmC,EAAM,EAAE,IAC3B,gBAAgBA,EAAM,EAAE,EAAI,CAAE,MAAAA,EAAO,SAAU,EAAI,EACnDsmC,EAAU,IAEZ,gBAAgBtmC,EAAM,EAAE,EAAE,SAAS,KAAKorB,CAAO,EAC1Ckb,IACL,qBAAQ,YAAY,CAClB,WAAAD,EACA,GAAIrmC,EAAM,GACV,IAAKA,EAAM,IACX,OAAQA,EAAM,MACpB,GACA,CAAG,CAEH,CAGA,IAAI,aAAe,iBACnB,SAAS,UAAW,CAMlB,GALI,OAAO,KAAK,MAAS,UACrB,OAAO,KAAK,SAAY,UACxB,OAAO,KAAK,YAAe,UAC3B,OAAO,KAAK,QAAW,UACvB,CAAC,KAAK,OAAO,MAAM,YAAY,GAC/B,CAAC,MAAM,QAAQ,KAAK,IAAI,EAAG,MAAO,GACtC,QAASxC,EAAI,EAAGA,EAAI,KAAK,KAAK,OAAQA,IAAK,CACzC,MAAMqhB,EAAM,KAAK,KAAKrhB,CAAC,EACvB,GAAI,CAAC,MAAM,QAAQqhB,CAAG,EAAG,MAAO,GAChC,QAAShU,EAAI,EAAGA,EAAIgU,EAAI,OAAQhU,IAC9B,GAAI,OAAOgU,EAAIhU,CAAC,GAAM,SAAU,MAAO,EAE7C,CACE,MAAO,EACT,CACA,IAAI,mBAAqB,IAAI07B,KAAAA,SAAS,CACpC,QAAS,IACT,wBAAyB,GAC3B,CAAC,EACD,SAAS,gBAAgBC,EAAS,OAChC,GAAI,OAAO,KAAK,mBAAsB,UAAW,OAAO,KAAK,kBAC7D,MAAMC,EAAmB,mBAAmB,IAAI,KAAK,EAAE,EACvD,GAAIA,IAAqB,KACvB,YAAK,kBAAoB,CAAC,CAACA,EACpB,KAAK,kBAEd,GAAI,CACF,IAAIhoC,EAAA,KAAK,MAAL,MAAAA,EAAU,qBACZ,qBAAqB,KAAM+nC,CAAO,EAAE,KAAM/4B,GAAW,OAC/C+4B,IACF,KAAK,kBAAoB/4B,EACrBA,GAAQ,mBAAmB,IAAI,KAAK,GAAI,KAAK,GAAG,GAEjDA,KACHhP,EAAA,KAAK,MAAL,MAAAA,EAAU,KAAK,oBAAqB,MACpC,mBAAmB,IAAI,KAAK,GAAI,EAAK,EAE/C,CAAO,MACI,CACL,MAAMqE,EAAO,OAAO,IAAI,YAAW,EAAG,OAAO,KAAK,UAAS,CAAE,CAAC,EACxDuF,EAAM,QAAQ,OAAO,KAAK,IAAKvF,EAAM,KAAK,MAAM,EACtD,OAAIuF,EAAK,mBAAmB,IAAI,KAAK,GAAI,KAAK,GAAG,EAC5C,mBAAmB,IAAI,KAAK,GAAI,EAAK,EAC1C,KAAK,kBAAoBA,EAClBA,CACb,CACG,MAAc,CACb,YAAK,kBAAoB,GAClB,EACX,CACA,CACA,SAAS,cAAe,CACtB,OAAO,gCAAgC,KAAK,WAAW,CACzD,CACA,SAAS,gCAAgC29B,EAAiB,CACxD,MAAM1b,EAAY,OAAO,IAAI,YAAW,EAAG,OAAO0b,CAAe,CAAC,EAClE,OAAO17B,aAAWggB,CAAS,CAC7B,CAGA,IAAI,qBAAuC,IAAI,IAAI,CACjD,EACA,EACA,KACA,GACA,EACA,KACA,CACF,CAAC,EACG,SAAW,MAAMoc,WAAkBC,kBAAc,CAgCnD,YAAYtK,EAAKr8B,EAAO,OACtB,MAAO,EAhCTgqB,EAAA,YACAA,EAAA,mBACAA,EAAA,eAAU,IACVA,EAAA,YAAO,CAAE,GACTA,EAAA,aACAA,EAAA,UAAK,IACLA,EAAA,YACAA,EAAA,cAAS,IACTA,EAAA,0BACAA,EAAA,gBAIAA,EAAA,cAgBAA,EAAA,qBAAgB,WAChBA,EAAA,qBA6LAA,EAAA,iBAAY,UAAU,KAAK,IAAI,GAC/BA,EAAA,oBAAe,aAAa,KAAK,IAAI,GACrCA,EAAA,gBAAW,SAAS,KAAK,IAAI,GAC7BA,EAAA,uBAAkB,gBAAgB,KAAK,IAAI,GAM3CA,EAAA,qBAAgB,cAAc,KAAK,IAAI,GACvCA,EAAA,mBAAc,YAAY,KAAK,IAAI,GACnCA,EAAA,aAAQ,IAAM,KAAK,MAAQ,KAAK,MAAQ,KAAO,KAAK,MAAQ,KAM5DA,EAAA,0BAAqB,mBAAmB,KAAK,IAAI,GAOjDA,EAAA,cAAS,OAAO,KAAK,IAAI,GACzBA,EAAA,eAAU,QAAQ,KAAK,IAAI,GAC3BA,EAAA,eAAU,QAAQ,KAAK,IAAI,GAoZ3BA,EAAA,wBAAmB,iBAAiB,KAAK,IAAI,GAS7CA,EAAA,sBAAiB,eAAe,KAAK,IAAI,GAKzCA,EAAA,uBAAkB,gBAAgB,KAAK,IAAI,GAU3CA,EAAA,cAAS,OAAO,KAAK,IAAI,GAhoBvB,KAAK,IAAMqS,EACX,KAAK,WAAar8B,GAAA,YAAAA,EAAO,WACzB,KAAK,SAAUA,GAAA,YAAAA,EAAO,UAAW,GACjC,KAAK,MAAOA,GAAA,YAAAA,EAAO,OAAQ,CAAE,EAC7B,KAAK,IAAKA,GAAA,YAAAA,EAAO,KAAM,GACvB,KAAK,IAAMA,GAAA,YAAAA,EAAO,IAClB,KAAK,QAASA,GAAA,YAAAA,EAAO,SAAU,GAC/B,KAAK,KAAOA,GAAA,YAAAA,EAAO,KACfA,aAAiB0mC,KACf,KAAK,QACP,KAAK,MAAQ1mC,EAAM,OACnBvB,EAAA,KAAK,MAAL,MAAAA,EAAU,WAAW,UAAUuB,EAAM,GAAI,KAAK,QAEhD,KAAK,cAAgBA,EAAM,cAC3B,KAAK,aAAeA,EAAM,aAEhC,CAhCE,IAAI,UAAW,CACb,IAAIqI,EAAM,CAAE,EACZ,OAAK,KAAK,IAGRA,EAAM,KAAK,IAAI,WAAW,WAAW,IAAI,KAAK,EAAE,GAAK,CAAE,EAFnD,KAAK,OAAOA,EAAI,KAAK,KAAK,KAAK,EAI9BA,CACX,CA+BE,OAAO,YAAYg0B,EAAKr8B,EAAO,CAC7B,OAAO,IAAI0mC,GAAUrK,EAAK,YAAYr8B,CAAK,CAAC,CAChD,CAIE,UAAW,CACT,MAAO,CACL,WAAY,KAAK,WACjB,QAAS,KAAK,QACd,KAAM,KAAK,KACX,KAAM,KAAK,KACX,OAAQ,KAAK,OACb,GAAI,KAAK,GACT,IAAK,KAAK,GACX,CACL,CACE,IAAI,OAAO4mC,EAAM,OACf,KAAK,OAASA,EAAK,OACnB,KAAK,QAAUA,GACfnoC,EAAA,KAAK,SAAQ,MAAbA,EAAa,IAAQ,KAAK,IAC9B,CAIE,IAAI,QAAS,CACX,GAAI,KAAK,QAAS,OAAO,KAAK,QAC9B,GAAI,CAAC,KAAK,IAAK,MAAM,IAAI,MAAM,uBAAuB,EACtD,MAAMmoC,EAAO,KAAK,IAAI,QAAQ,CAAE,OAAQ,KAAK,OAAQ,EACrD,YAAK,QAAUA,EACRA,CACX,CAqBE,YAAYxC,EAAQljC,EAAM2lC,EAAW,CACnC,MAAMC,EAAO,CAAC,GAAG,EACXC,EAAO,CAAC,GAAG,EACjB,OAAQ7lC,EAAI,CACV,IAAK,MAAO,CACV,MAAMuoB,EAAM,IAAI,IAAI2a,CAAM,EAC1B3a,EAAI,KAAO,GACXqd,EAAK,KAAKrd,EAAI,UAAU,EACxBsd,EAAK,KAAK,GAAGtd,EAAI,QAAQ,KAAKA,EAAI,IAAI,EAAE,EACxC,KACR,CACM,IAAK,UACHqd,EAAK,KAAK,IAAI1C,EAAO,YAAa,CAAA,EAAE,EACpC2C,EAAK,KAAK,GAAG,EACb,MACF,IAAK,UACHD,EAAK,KAAK,OAAO1C,EAAO,YAAa,CAAA,EAAE,EACvC2C,EAAK,KAAK,KAAK,EACf,MACF,IAAK,OACHD,EAAK,KAAK,QAAQ1C,EAAO,QAAQ,KAAM,EAAE,CAAC,EAAE,EAC5C2C,EAAK,KAAK,MAAM,EAChB,MACF,IAAK,eACHD,EAAK,KAAK,gBAAgB1C,CAAM,EAAE,EAClC2C,EAAK,KAAK,cAAc,EACxB,MACF,IAAK,oBACHD,EAAK,KAAK,qBAAqB1C,CAAM,EAAE,EACvC2C,EAAK,KAAK,mBAAmB,EAC7B,MACF,IAAK,yBACHD,EAAK,KAAK,0BAA0B1C,CAAM,EAAE,EAC5C2C,EAAK,KAAK,wBAAwB,EAClC,MACF,IAAK,OACHD,EAAK,KAAK,QAAQ1C,EAAO,MAAM,GAAG,EAAE,MAAM,EAAG,CAAC,EAAE,KAAK,GAAG,CAAC,EAAE,EAC3D2C,EAAK,KAAK,MAAM,EAChB,MACF,IAAK,MACHD,EAAK,KAAK,OAAO1C,EAAO,YAAa,CAAA,EAAE,EACvC2C,EAAK,KAAK,KAAK,EACf,MACF,QACE,MAAM,IAAI,MAAM,mCAAmC7lC,CAAI,EAAE,CACjE,CACQ2lC,GACFC,EAAK,KAAKD,CAAS,EAErB,KAAK,KAAK,KAAKC,CAAI,EACnB,KAAK,KAAK,KAAKC,CAAI,CACvB,CAaE,IAAI3d,EAAQmc,EAAQyB,EAAeC,EAAU,CAC3C,IAAI5T,EAAO,CAAE,EAEb,GADkBjK,EAAO,eAAiB,OAC3B,CACb6d,MAAa,KACb,MAAMpoB,EAAM,CAACooB,EAAU7d,EAAO,MAAM,EAChCmc,GAAQ1mB,EAAI,KAAS,GAAI0mB,CAAO,EACpClS,EAAK,KAAKxU,CAAG,CACnB,SAAeuK,aAAkBsd,GAAW,CACtC,MAAM1mC,EAAQopB,EACd4d,OAAkBhnC,GAAA,YAAAA,EAAO,UAAW,KAAK,QACzCqzB,EAAOrzB,EAAM,cAAculC,EAAQyB,EAAeC,CAAQ,EAC1D,UAAWC,KAAQlnC,EAAM,gBAAgB,GAAG,EACtCknC,EAAK,CAAC,IAAM,KAAK,SACjB,KAAK,KAAK,KAAMpnB,GAAMA,EAAE,CAAC,IAAM,KAAOA,EAAE,CAAC,IAAMonB,EAAK,CAAC,CAAC,GAC1D,KAAK,KAAK,KAAK,CAAC,IAAKA,EAAK,CAAC,CAAC,CAAC,EAEhC,SAAU,MAAM,QAAQ9d,CAAM,EAC7BiK,EAAO,CAACjK,CAAM,MAEd,OAAM,IAAI,MAAM,mBAAoBA,CAAM,EAE5C,KAAK,KAAO,UAAU,KAAK,KAAMiK,CAAI,CACzC,CAOE,MAAM,aAAanI,EAAQ,SACzB,GAAI,CAACA,GAAU,KAAK,SAAW,GAAI,CACjC,MAAM0b,EAAO,OAAMjoC,GAAAF,EAAA,KAAK,MAAL,YAAAA,EAAU,SAAV,YAAAE,EAAkB,QACrC,KAAK,QAASioC,GAAA,YAAAA,EAAM,SAAU,EACpC,CACS,KAAK,aACR,KAAK,WAAa,KAAK,MAAM,KAAK,IAAK,EAAG,GAAG,GAE/C,KAAM,CAAE,QAAA9S,EAAS,KAAAT,CAAM,EAAG,MAAM,KAAK,aAAc,EACnD,KAAK,QAAUS,GAAW,GAC1B,KAAK,KAAOT,EACZ,GAAI,CACF,KAAK,GAAK,KAAK,aAAc,CAC9B,MAAY,CACjB,CACI,OAAO,KAAK,SAAU,CAC1B,CAiCE,gBAAgB3I,EAAS6a,EAAQ,CAC/B,MAAMzlB,EAAI,KAAK,KAAK,OAAQjB,GAAQA,EAAI,CAAC,IAAM6L,CAAO,EACtD,OAAI6a,IAAW,OAAezlB,EACvBA,EAAE,OAAQjB,GAAQA,EAAI,CAAC,IAAM0mB,CAAM,CAC9C,CAOE,OAAO7a,EAAS6a,EAAQ,CACtB,OAAO,KAAK,KAAK,KAAM1mB,GAAQA,EAAI,CAAC,IAAM6L,IAAY,CAAC6a,GAAU1mB,EAAI,CAAC,IAAM0mB,EAAO,CACvF,CAME,SAAS7a,EAAS,CAChB,MAAM2I,EAAO,KAAK,gBAAgB3I,CAAO,EACzC,GAAI2I,EAAK,SAAW,EACpB,OAAOA,EAAK,CAAC,EAAE,CAAC,CACpB,CAIE,IAAI,KAAM,CACR,OAAO,KAAK,SAAS,KAAK,CAC9B,CAME,IAAI,IAAI8T,EAAK,CACX,KAAK,UAAU,KAAK,EAChBA,GAAK,KAAK,KAAK,KAAK,CAAC,MAAOA,CAAG,CAAC,CACxC,CAIE,IAAI,MAAO,CACT,OAAO,KAAK,SAAS,GAAG,CAC5B,CAIE,IAAI,KAAK9/B,EAAO,CACd,KAAK,UAAU,GAAG,EACdA,GAAO,KAAK,KAAK,KAAK,CAAC,IAAKA,CAAK,CAAC,CAC1C,CAME,UAAUqjB,EAAS,CACjB,MAAM0c,EAAW,MAAM,QAAQ1c,CAAO,EAAIA,EAAU,CAACA,CAAO,EAC5D,KAAK,KAAO,KAAK,KAAK,OAAQ7L,GAAQ,CAACuoB,EAAS,SAASvoB,EAAI,CAAC,CAAC,CAAC,CACpE,CAME,WAAWA,EAAK,CACd,KAAK,UAAUA,EAAI,CAAC,CAAC,EACrB,KAAK,KAAK,KAAKA,CAAG,CACtB,CASE,MAAM,KAAK0lB,EAAQ,SACZA,EAIH,KAAK,OAAS,MAAMA,EAAO,KAAM,IAHjC9lC,EAAA,KAAK,MAAL,MAAAA,EAAU,eACV8lC,GAAS5lC,EAAA,KAAK,MAAL,YAAAA,EAAU,QAIrB,MAAM0oC,EAAa,MAAM,KAAK,aAAc,EAC5C,YAAK,IAAM,MAAM9C,EAAO,KAAK8C,CAAU,EAChC,KAAK,GAChB,CAQE,MAAM,mBAAmBC,EAAUzI,EAAW6D,EAAoB,CAChE,YAAK,GAAK,GACV,KAAK,WAAa,KAAK,MAAM,KAAK,IAAK,EAAG,GAAG,EAC7C,KAAK,IAAM,GACJ,KAAK,QAAQ4E,EAAUzI,EAAW6D,CAAkB,CAC/D,CASE,MAAM,QAAQ4E,EAAUzI,EAAW6D,EAAoB,WAErD,GADK,KAAK,KAAK,MAAM,KAAK,KAAM,EAC5B,CAAC,KAAK,IAAK,MAAM,IAAI,MAAM,6DAA6D,EAI5F,IAHI,CAAC4E,GAAYA,EAAS,OAAS,KACjCA,EAAW,KAAK,IAAI,kBAAoB,MAAM,2BAA2B,KAAK,IAAK,IAAI,GAErF,KAAK,OAAS,KAAyB7oC,EAAA,KAAK,IAAI,eAAT,MAAAA,EAAuB,gBAAgB,CAChF,MAAM8oC,EAAQ,KAAK,gBAAgB,GAAG,EAAE,IAAK1oB,GAAQA,EAAI,CAAC,CAAC,EAC3D,KAAK,IAAI,aAAa,eAAe0oB,CAAK,CAChD,CACI,MAAMC,EAAW,KAAK,SAAU,EAChC,IAAI7oC,EAAA,KAAK,IAAI,eAAT,MAAAA,EAAuB,qBAAuB,4BAA4B,IAAI,EAChF,GAAI,CACF,KAAK,IAAI,aAAa,oBAAoB,KAAM2oC,EAAS,SAAS,CACnE,OAAQnnC,EAAG,CACV,QAAQ,MAAM,0CAA2CA,CAAC,CAClE,CAEQ,KAAK,OAAS,KAAyB4T,EAAA,KAAK,IAAI,eAAT,MAAAA,EAAuB,iBAChE,KAAK,IAAI,aAAa,eAAe,KAAK,gBAAgB,GAAG,EAAE,IAAK8K,GAAQA,EAAI,CAAC,CAAC,CAAC,EAErF,KAAK,IAAI,WAAW,cAAc2oB,EAAU,OAAQ,EAAI,EACxD,MAAMjb,EAAS,MAAM+a,EAAS,QAAQ,KAAMzI,EAAW6D,CAAkB,EACzE,OAAAnW,EAAO,QAAShB,GAAK,OAAK,OAAA9sB,EAAA,KAAK,MAAL,YAAAA,EAAU,WAAW,UAAU,KAAK,GAAI8sB,GAAM,EACjEgB,CACX,CAME,MAAM,cAAe,WACnB,IAAI8G,EAAO,CAAE,EACb,MAAM1kB,EAAI,MAAM,oBAAoB,KAAK,QAAS,KAAK,IAAI,EACrDmlB,EAAUnlB,EAAE,QAElB,GADA0kB,EAAO1kB,EAAE,KACL,KAAK,MAAQ,KAAK,mBAAkB,GAElC,CADS,KAAK,gBAAgB,GAAG,EAAE,CAAC,EAC7B,CACT,MAAMrD,EAAQ,KAAK,SAAS,OAAO,EAEnC,IAAI1J,EAAM,CAAC,GAAG,MADK0J,EAAQ,EAAI,EACD,CAAC,EAAE,IAAI,IAAM,KAAK,OAAQ,EAAC,SAAS,EAAE,EAAE,CAAC,CAAC,EAAE,KAAK,EAAE,EAC7EA,GAASA,EAAM,OAAS,IAC1B1J,EAAM,GAAG0J,EAAM,QAAQ,eAAgB,GAAG,EAAE,QAAQ,SAAU,EAAE,CAAC,IAAI1J,CAAG,IAE1EyxB,EAAK,KAAK,CAAC,IAAKzxB,CAAG,CAAC,CAC5B,CAEI,GAAI,KAAK,mBAAoB,CAC3B,MAAM6lC,EAAY,CAAC,WAAUhpC,EAAA,KAAK,MAAL,YAAAA,EAAU,aAAc,EAAE,GACnDE,EAAA,KAAK,MAAL,MAAAA,EAAU,aAAa8oC,EAAU,MAAK1zB,EAAA,KAAK,MAAL,YAAAA,EAAU,WAAW,EAC/Dsf,EAAK,KAAKoU,CAAS,CACzB,MAAe,KAAK,uBACdpU,EAAOA,EAAK,OAAQxU,GAAQA,EAAI,CAAC,IAAM,QAAQ,GAEjD,MAAO,CAAE,QAASiV,GAAW,GAAI,KAAAT,CAAM,CAC3C,CACE,IAAI,oBAAqB,SAMvB,MALI,KAAC50B,EAAA,KAAK,MAAL,MAAAA,EAAU,aAAc,GAACE,EAAA,KAAK,MAAL,MAAAA,EAAU,cACpC,qBAAqB,IAAI,KAAK,IAAI,GAClC,KAAK,YAAa,GAClB,KAAK,cAAe,GAAI,CAAC,KAAK,mBAAoB,GAClD,KAAK,MAAO,GACZ,KAAK,OAAO,QAAQ,EAE5B,CACE,IAAI,sBAAuB,CACzB,OAAO,qBAAqB,IAAI,KAAK,IAAI,CAC7C,CACE,OAAQ,SACN,MAAM+oC,GAAmBjpC,EAAA,KAAK,MAAL,YAAAA,EAAU,SAAS,IAAI,KAAK,QACrD,GAAIipC,GAAoBA,IAAqB,IAAK,MAAO,SACzD,MAAMC,EAAoB,KAAK,aAAc,EACvCC,GAAkBjpC,EAAA,KAAK,MAAL,YAAAA,EAAU,SAAS,IAAIgpC,EAAkB,CAAC,GAClE,OAAIC,GAAmBA,IAAoBD,EAAkB,CAAC,EAAU,QACjE,IACX,CAQE,iBAAkB,CAChB,GAAI,KAAK,MAAQ,KAAK,MAAQ,KAAO,KAAK,MAAQ,IAAK,CACrD,MAAME,EAAO,KAAK,gBAAgB,GAAG,EAAE,CAAC,EAExC,OADeA,EAAOA,EAAK,CAAC,EAAI,EAEtC,CACI,MAAM,IAAI,MAAM,gDAAgD,CACpE,CAQE,kBAAmB,CACjB,OAAI,KAAK,OAAS,GAAK,KAAK,OAAS,GAAK,KAAK,MAAQ,KAAK,MAAQ,KAAO,KAAK,KAAO,IAC9E,GAAG,KAAK,IAAI,IAAI,KAAK,MAAM,GAE7B,KAAK,MAAO,CACvB,CAKE,OAAQ,CACN,OAAI,KAAK,qBACA,KAAK,WAAY,EAEnB,KAAK,EAChB,CASE,YAAa,CACX,GAAI,KAAK,qBAAsB,CAC7B,MAAMC,EAAS,KAAK,MAAQ,GAC5B,MAAO,GAAG,KAAK,IAAI,IAAI,KAAK,MAAM,IAAIA,CAAM,EAClD,CACI,GAAI,KAAK,gBACP,MAAO,GAAG,KAAK,IAAI,IAAI,KAAK,MAAM,IAEpC,MAAM,IAAI,MAAM,kCAAkC,CACtD,CAQE,SAAU,CACR,OAAO,KAAK,qBAAuB,IAAM,GAC7C,CAcE,aAAavC,EAAQ,CACnB,IAAI1mB,EACJ,OAAI,KAAK,qBACPA,EAAM,CAAC,IAAK,KAAK,WAAU,CAAE,EAE7BA,EAAM,CAAC,IAAK,KAAK,MAAK,CAAE,EAEtB,KAAK,MACPA,EAAI,KAAK,KAAK,MAAM,GAAG,EAEvBA,EAAI,KAAK,EAAE,EAEbA,EAAI,KAAK0mB,GAAU,EAAE,EAChB,KAAK,sBACR1mB,EAAI,KAAK,KAAK,MAAM,EAEfA,CACX,CAcE,cAAc0mB,EAAQyB,EAAeC,EAAU,CAC7C,IAAI5T,EAAO,CAAE,EACb,OAAI,KAAK,qBACPA,EAAO,CACL,CAAC4T,GAAY,IAAK,KAAK,WAAU,CAAE,EACnC,CAACA,GAAY,IAAK,KAAK,EAAE,CAC1B,EAED5T,EAAO,CAAC,CAAC4T,GAAY,IAAK,KAAK,EAAE,CAAC,EAEpC5T,EAAOA,EAAK,IAAKxU,GAAQ,WACvB,OAAIA,EAAI,CAAC,IAAM,KAAO0mB,EACpB1mB,EAAI,OAAKpgB,EAAA,KAAK,QAAL,YAAAA,EAAY,MAAO,EAAE,GACrBE,EAAA,KAAK,QAAL,MAAAA,EAAY,KACrBkgB,EAAI,MAAK9K,EAAA,KAAK,QAAL,YAAAA,EAAY,GAAG,EAEnB8K,CACb,CAAK,EACDwU,EAAK,QAASxU,GAAQ,CAChBA,EAAI,CAAC,IAAM,KACbA,EAAI,KAAK0mB,GAAU,EAAE,EACrB1mB,EAAI,KAAK,KAAK,MAAM,GACX0mB,GACT1mB,EAAI,KAAK0mB,CAAM,CAEvB,CAAK,EACDlS,EAAO,CAAC,GAAGA,EAAM,GAAG,KAAK,gBAAgB,GAAG,CAAC,EACxC2T,GAAe3T,EAAK,KAAK,GAAG,KAAK,OAAO,eAAe,EACrDA,CACX,CAaE,QAAS,CACP,OAAI,KAAK,qBACA,CAAE,KAAM,CAAC,KAAK,MAAO,CAAA,CAAG,EAE1B,CAAE,KAAM,CAAC,KAAK,MAAO,CAAA,CAAG,CACnC,CACE,aAAc,CACZ,OAAI,KAAK,qBACA,CAAE,KAAM,CAAC,KAAK,MAAO,CAAA,CAAG,EAE1B,CAAE,KAAM,CAAC,KAAK,MAAO,CAAA,CAAG,CACnC,CAQE,MAAM,OAAO7H,EAAQqa,EAAU,GAAM,OACnC,GAAI,CAAC,KAAK,IAAK,MAAM,IAAI,MAAM,uBAAuB,EACtD,KAAK,IAAI,aAAc,EACvB,MAAM1lC,EAAI,IAAIumC,GAAU,KAAK,IAAK,CAChC,KAAM,EACN,QAASlb,GAAU,EACzB,CAAK,EACD,OAAArrB,EAAE,IAAI,KAAM,OAAQ,EAAI,EACxBA,EAAE,KAAK,KAAK,CAAC,KAAK1B,EAAA,KAAK,OAAL,YAAAA,EAAW,UAAU,CAAC,EACpConC,IACF,KAAK,KAAK,SAAS,EACnB,MAAM1lC,EAAE,QAAS,GAEZA,CACX,CAKE,IAAI,YAAYoB,EAAK,CACnB,KAAK,UAAU,GAAG,EACdA,GAAK,KAAK,KAAK,KAAK,CAAC,GAAG,CAAC,CACjC,CAKE,IAAI,aAAc,CAChB,OAAO,KAAK,OAAO,GAAG,CAC1B,CAyCE,MAAM,MAAMuyB,EAAS+R,EAAU,GAAM,CACnC,GAAI,CAAC,KAAK,IAAK,MAAM,IAAI,MAAM,uBAAuB,EACtD,KAAK,IAAI,aAAc,EACvB,MAAM1lC,EAAI,IAAIumC,GAAU,KAAK,IAAK,CAChC,KAAM,EACN,QAAA5S,CACN,CAAK,EACD,OAAA3zB,EAAE,IAAI,IAAI,EACN0lC,GAAS,MAAM1lC,EAAE,QAAS,EACvBA,CACX,CAUE,IAAI,SAAU,CACZ,OAAO,KAAK,SAAU,CAC1B,CACE,IAAI,SAAU,CACZ,OAAO,KAAK,UAAU,KAAK,SAAU,EAAE,KAAM,CAAC,CAClD,CAME,MAAO,CACL,QAAQ,MAAM,KAAK,UAAU,KAAK,SAAU,EAAE,KAAM,CAAC,CAAC,EACtD,QAAQ,MAAM,mBAAoB,KAAK,SAAS,IAAKorB,GAAUA,EAAM,GAAG,EAAE,KAAK,IAAI,CAAC,CACxF,CAQE,OAAQ,SACN,MAAMwc,EAAQ,IAAIrB,GAAU,KAAK,GAAG,EACpC,GAAI,KAAK,OAAS,EAChBqB,EAAM,KAAO,EACK,KAAK,OAAO,GAAG,EAE/BA,EAAM,KAAO,CACX,GAAGA,EAAM,KACT,GAAG,KAAK,gBAAgB,GAAG,EAC3B,GAAG,KAAK,gBAAgB,GAAG,EAC3B,GAAG,KAAK,gBAAgB,GAAG,EAC3B,GAAG,KAAK,cAAc,OAAO,CAC9B,EAEDA,EAAM,IAAI,KAAM,MAAM,MAEnB,CACLA,EAAM,KAAO,KACb,MAAMC,EAAgB,CAAC,IAAK,IAAK,IAAK,GAAG,EACnCC,EAAW,KAAK,KAAK,OAAQppB,GAAQmpB,EAAc,SAASnpB,EAAI,CAAC,CAAC,CAAC,EACzE,GAAIopB,EAAS,OAAS,EAAG,CACvB,MAAMC,EAAW,KAAK,SAAS,GAAG,EAClCH,EAAM,KAAK,KAAK,GAAGE,CAAQ,EACvBC,GAAUH,EAAM,KAAK,KAAK,CAAC,IAAKG,CAAQ,CAAC,EAC7C,KAAM,CAAChnC,EAAM+pB,EAAI5gB,EAAG,GAAG89B,CAAK,EAAI,KAAK,aAAc,EAC7CtpB,EAAM,CAAC3d,EAAM+pB,EAAI,GAAGkd,CAAK,EAC/BJ,EAAM,KAAK,KAAKlpB,CAAG,CAC3B,KAAa,CACL,KAAM,CAAC3d,EAAM+pB,EAAI5gB,EAAG+9B,CAAS,EAAI,KAAK,aAAc,EAC9CvpB,EAAM,CAAC3d,EAAM+pB,EAAImd,GAAa,EAAE,EAClClnC,IAAS,KAAK2d,EAAI,KAAK,KAAK,MAAM,EACtCkpB,EAAM,KAAK,KAAKlpB,CAAG,EACnB,MAAMwpB,EAAe,CAAC,GAAGxpB,CAAG,EAC5BwpB,EAAa,CAAC,EAAIA,EAAa,CAAC,EAAE,YAAa,EAC/CN,EAAM,KAAK,KAAKM,CAAY,EAC5BN,EAAM,KAAK,KAAK,CAAC,KAAKtpC,EAAA,KAAK,OAAL,YAAAA,EAAW,UAAU,CAAC,EAC5CspC,EAAM,KAAK,KAAK,CAAC,IAAK,KAAK,MAAM,CAAC,CAC1C,CACMA,EAAM,KAAK,KAAK,CAAC,KAAKppC,EAAA,KAAK,OAAL,YAAAA,EAAW,UAAU,CAAC,EAC5CopC,EAAM,KAAK,KAAK,GAAG,KAAK,gBAAgB,GAAG,CAAC,EAC5CA,EAAM,KAAK,KAAK,CAAC,IAAK,KAAK,MAAM,CAAC,CACxC,CACI,OAAOA,CACX,CACA,EACI,2BAA6C,IAAI,IAAI,CACvD,MACA,MACA,MACA,KACF,CAAC,EACD,SAAS,4BAA4B/nC,EAAO,CAC1C,MAAO,CAAC,2BAA2B,IAAIA,EAAM,IAAI,CACnD,CAIA,IAAI,QAAU,cAAcsoC,MAAAA,YAAc,CAuBxC,YAAY/F,EAAWgG,EAAsBlM,EAAK,CAChD,MAAOmM,EACP,KAAAtmC,CACD,EAAG,GAAI,CACN,MAAO,EAzBT8nB,EAAA,eAA0B,IAAI,KAC9BA,EAAA,cAAS,QACTA,EAAA,yBAAoC,IAAI,KACxCA,EAAA,8BAAyC,IAAI,KAC7CA,EAAA,cACAA,EAAA,4BAAuC,IAAI,KAC3CA,EAAA,sBAAiC,IAAI,KAErCA,EAAA,oBAA+B,IAAI,KACnCA,EAAA,YAmCAA,EAAA,aAAQ,WAlBN,KAAK,MAAQwe,GAAUnM,EAAI,MAAM,OAAO,MAAM,EAC1Cn6B,IAAM,KAAK,MAAQA,GACvB,KAAK,IAAMm6B,EACX,KAAK,UAAYkG,EACjB,KAAK,uBAAyB,IAAI,IAAIgG,CAAoB,EAC1D,KAAK,IAAI,MAAM,KAAK,IAAI,CAC5B,CAtBE,IAAI,oBAAqB,CACvB,MAAMhnC,EAAM,IAAI,IAAI,KAAK,IAAI,kBAAkB,EAC/C,YAAK,uBAAuB,QAASkoB,GAAQloB,EAAI,IAAIkoB,CAAG,CAAC,EAClDloB,CACX,CAmBE,IAAI,QAAS,CACX,OAAO,KAAK,OAChB,CACE,IAAI,UAAUg8B,EAAM,CAClB,KAAK,QAAQ,MAAO,EACpB,UAAWrK,KAAYqK,EAAM,CAC3B,MAAMhS,EAAQ,IAAI,SAAS2H,EAAU,OAAQ,KAAK,GAAG,EACrD3H,EAAM,aAAa,SAAW,KAAK,IAAI,SACvC,KAAK,SAASA,CAAK,CACzB,CACA,CAEE,IAAI,MAAO,CACT,OAAO,KAAK,KAChB,CACE,IAAI,KAAKrpB,EAAM,CACb,KAAK,MAAQA,EACb,KAAK,MAAQ,KAAK,MAAM,OAAOA,CAAI,CACvC,CAME,kBAAkBqpB,EAAOkd,EAAsB,IAAK7d,EAAS,CAC3D,MAAM8d,EAAqB,KAAK,OAAO,IAAInd,EAAM,GAAG,EAC/Cmd,IACH,KAAK,SAASnd,CAAK,EACnB,KAAK,MAAM,2CAA4CA,EAAM,IAAKX,CAAO,GAE3E,MAAM+d,EAAgB,KAAK,qBAAqB,IAAIpd,EAAM,GAAG,EAI7D,GAHIod,GACF,aAAaA,CAAa,EAExB,CAACD,GAAsBC,EAAe,CACxC,MAAMvH,EAAQ,WAAW,IAAM,QACzB3iC,EAAA,KAAK,IAAI,oBAAT,MAAAA,EAA4B,SAAS8sB,EAAM,MAC/C,KAAK,YAAYA,EAAM,GAAG,CAC3B,EAAEkd,CAAmB,EACtB,KAAK,qBAAqB,IAAIld,EAAM,IAAK6V,CAAK,CACpD,CACA,CAOE,SAAS7V,EAAOiX,EAAU,GAAM,SAC9B,MAAMoG,EAAkB,KAAK,OAAO,IAAIrd,EAAM,GAAG,EAC3Csd,GAAgBpqC,EAAA,KAAK,qBAAL,YAAAA,EAAyB,IAAI8sB,EAAM,KACnDud,EAAmBvd,EAAM,IAAI,SAAS,QAAQ,EACpD,IAAIuT,EAAY,GAChB,MAAM5L,EAAW3H,EAAM,IACvB,GAAIqd,EAAiB,OACrB,GAAIC,EAAe,CACjB,KAAK,MAAM,yBAAyB3V,CAAQ,eAAe,EAC3D,MACN,CACI,GAAI4V,EAAkB,CACpB,KAAK,MAAM,yBAAyB5V,CAAQ,qBAAqB,EACjE,MACN,CACI,IAAIv0B,EAAA,KAAK,IAAI,eAAT,MAAAA,EAAuB,eAAgB,CACzC,MAAMoqB,EAAO,KAAK,IAAI,aAAa,eAAemK,CAAQ,EAC1D,GAAInK,GAAA,MAAAA,EAAM,kBAAmB,CAC3B,GAAIA,EAAK,kBAAoB,KAAK,IAAG,EAAI,CACvC,MAAMgY,EAAQhY,EAAK,kBAAoB,KAAK,IAAK,EACjD,KAAK,MAAM,yBAAyBmK,CAAQ,yBAAyB6N,CAAK,IAAI,EAC9E,WAAW,IAAM,CACf,KAAK,SAASxV,EAAOiX,CAAO,CAC7B,EAAEzB,CAAK,EACR,MACV,CACQjC,EAAY,EACpB,CACA,CACI,MAAMiK,EAAiBvJ,GAAW,KAAK,KAAK,SAAUjU,EAAOiU,CAAM,EAC7DwJ,EAAiB,IAAM,KAAK,mBAAmB9V,CAAQ,EACvD+V,EAAe,IAAM,KAAK,iBAAiB1d,CAAK,EAChD2d,EAAoB,IAAM,KAAK,KAAK,mBAAoB3d,CAAK,EAC7D4d,EAAkB,IAAM,KAAK,eAAe5d,CAAK,EACjD6d,EAAe1pB,GAAc,KAAK,KAAK,aAAc6L,EAAO7L,CAAS,EACrE2pB,EAAgB,IAAM,KAAK,KAAK,eAAgB9d,CAAK,EAC3DA,EAAM,IAAI,SAAUwd,CAAa,EACjCxd,EAAM,IAAI,UAAWyd,CAAc,EACnCzd,EAAM,IAAI,QAAS0d,CAAY,EAC/B1d,EAAM,IAAI,aAAc2d,CAAiB,EACzC3d,EAAM,IAAI,WAAY4d,CAAe,EACrC5d,EAAM,IAAI,OAAQ6d,CAAW,EAC7B7d,EAAM,IAAI,SAAU8d,CAAa,EACjC9d,EAAM,GAAG,SAAUwd,CAAa,EAChCxd,EAAM,GAAG,UAAWyd,CAAc,EAClCzd,EAAM,GAAG,QAAS0d,CAAY,EAC9B1d,EAAM,GAAG,aAAc2d,CAAiB,EACxC3d,EAAM,GAAG,WAAY4d,CAAe,EACpC5d,EAAM,GAAG,OAAQ6d,CAAW,EAC5B7d,EAAM,GAAG,SAAU8d,CAAa,EAChC9d,EAAM,GAAG,kBAAoBwV,GAAU,QACjCtiC,EAAA,KAAK,IAAI,eAAT,MAAAA,EAAuB,mBACzB,KAAK,IAAI,aAAa,kBAAkB8sB,EAAM,IAAK,CACjD,kBAAmB,KAAK,MAAQwV,CAC1C,CAAS,CAET,CAAK,EACD,KAAK,QAAQ,IAAI7N,EAAU3H,CAAK,EAC5BiX,GAAS,KAAK,kBAAkB,IAAItP,CAAQ,EAC5CsP,GAAW,KAAK,SAAW,WAC7B,KAAK,KAAK,mBAAoBjX,CAAK,EACnCA,EAAM,QAAQ,OAAQuT,CAAS,EAAE,MAAO3+B,GAAM,CAC5C,KAAK,MAAM,8BAA8B+yB,CAAQ,GAAI/yB,CAAC,CAC9D,CAAO,EAEP,CAME,YAAY+yB,EAAU,CACpB,MAAM3H,EAAQ,KAAK,OAAO,IAAI2H,CAAQ,EACtC,GAAI3H,EACF,OAAAA,EAAM,WAAY,EAClB,KAAK,OAAO,OAAO2H,CAAQ,EAC3B,KAAK,kBAAkB,OAAOA,CAAQ,EACtC,KAAK,KAAK,mBAAoB3H,CAAK,EAC5B,GAET,MAAMod,EAAgB,KAAK,qBAAqB,IAAIzV,CAAQ,EAC5D,OAAIyV,IACF,aAAaA,CAAa,EAC1B,KAAK,qBAAqB,OAAOzV,CAAQ,GAEpC,EACX,CAIE,iBAAiBzJ,EAAK,CACpB,MAAM6f,EAAgB,kBAAkB7f,CAAG,EACrC8B,EAAQ,KAAK,OAAO,IAAI+d,CAAa,EAC3C,OAAK/d,EACEA,EAAM,SAAW,EADL,EAEvB,CAME,SAAS9B,EAAK+Y,EAAU,GAAM+G,EAAY,GAAO3e,EAAS,CACxD,IAAIW,EAAQ,KAAK,OAAO,IAAI,kBAAkB9B,CAAG,CAAC,EAClD,OAAK8B,IACHA,EAAQ,IAAI,SAAS9B,EAAK,OAAQ,KAAK,GAAG,EAC1C8B,EAAM,aAAa,SAAW,KAAK,IAAI,SACnCge,EACF,KAAK,kBAAkBhe,EAAO,IAAKX,CAAO,EAE1C,KAAK,SAASW,EAAOiX,CAAO,GAGzBjX,CACX,CACE,mBAAmB2H,EAAU,CAC3B,MAAM3H,EAAQ,KAAK,OAAO,IAAI2H,CAAQ,EACtC,GAAI,CAAC3H,EAAO,CACV,QAAQ,MAAM,mCAAoC,CAAE,SAAA2H,CAAQ,CAAE,EAC9D,MACN,CACI,KAAK,KAAK,gBAAiB3H,CAAK,EAC5B,KAAK,MAAO,EAAC,YAAc,KAAK,OAAO,MACzC,KAAK,KAAK,SAAS,CAEzB,CACE,iBAAiBA,EAAO,CACtB,KAAK,KAAK,cAAeA,CAAK,CAClC,CASE,MAAM,QAAQsT,EAAW,CACvB,MAAMgE,EAAW,CAAE,EACnB,KAAK,OAAS,SACd,KAAK,MAAM,iBAAiB,KAAK,OAAO,IAAI,UAAUhE,EAAY,aAAaA,CAAS,MAAQ,EAAE,EAAE,EACpG,MAAM2K,EAAkB,IAAI,IAAI,KAAK,kBAAkB,KAAI,CAAE,EAC7D,UAAWtW,KAAYsW,EAAiB,CACtC,MAAMje,EAAQ,KAAK,OAAO,IAAI2H,CAAQ,EACtC,GAAI,CAAC3H,EACH,SAEF,MAAMke,EAAiB,IAAI,QAAQ,CAACre,EAASQ,KAC3C,KAAK,KAAK,mBAAoBL,CAAK,EAC5BA,EAAM,QAAQsT,CAAS,EAAE,KAAKzT,CAAO,EAAE,MAAMQ,CAAM,EAC3D,EACD,GAAIiT,EAAW,CACb,MAAMmB,EAAiB,IAAI,QAAQ,CAAC31B,EAAGuhB,IAAW,CAChD,WAAW,IAAMA,EAAO,mBAAmBiT,CAAS,IAAI,EAAGA,CAAS,CAC9E,CAAS,EACDgE,EAAS,KACP,QAAQ,KAAK,CAAC4G,EAAgBzJ,CAAc,CAAC,EAAE,MAAO7/B,GAAM,CAC1D,KAAK,MAAM,8BAA8BorB,EAAM,GAAG,KAAKprB,GAAK,qBAAqB,EAAE,CACpF,CAAA,CACF,CACT,MACQ0iC,EAAS,KAAK4G,CAAc,CAEpC,CACI,MAAMC,EAAmB,IAAM,CAC7B,MAAMC,EAAe,KAAK,MAAK,EAAG,YAAc,KAAK,OAAO,KACtDC,EAAgB,KAAK,MAAO,EAAC,UAAY,EAC3C,CAACD,GAAgBC,GACnB,KAAK,KAAK,SAAS,CAEtB,EACG/K,GAAW,WAAW6K,EAAkB7K,CAAS,EACrD,MAAM,QAAQ,IAAIgE,CAAQ,EAC1B6G,EAAkB,CACtB,CACE,uBAAwB,CACtB,MAAMG,EAAsB,KAAK,eAAe,KAC1CC,EAAc,KAAK,OAAO,KAChC,GAAID,EAAsBC,GAAe,GACvC,UAAW5W,KAAY,KAAK,eAC1B,KAAK,aAAa,IAAIA,EAAU,CAAC,CAGzC,CACE,eAAe3H,EAAO,CACpB,KAAK,MAAM,SAASA,EAAM,GAAG,cAAc,EAC3C,IAAIwe,EAAiB,KAAK,aAAa,IAAIxe,EAAM,GAAG,GAAK,IACzDwe,EAAiBA,EAAiB,EAClC,KAAK,aAAa,IAAIxe,EAAM,IAAKwe,CAAc,EAC/C,KAAK,MAAM,oBAAoBxe,EAAM,GAAG,OAAOwe,CAAc,IAAI,EACjE,WAAW,IAAM,CACf,KAAK,MAAM,8BAA8Bxe,EAAM,GAAG,EAAE,EACpD,KAAK,KAAK,mBAAoBA,CAAK,EACnCA,EAAM,QAAS,EACf,KAAK,sBAAuB,CAC7B,EAAEwe,CAAc,EACjBxe,EAAM,WAAY,EAClB,KAAK,KAAK,WAAYA,CAAK,CAC/B,CACE,MAAO,CACL,OAAO,KAAK,OAAO,IACvB,CAKE,OAAQ,CACN,MAAMye,EAAQ,CACZ,MAAO,EACP,UAAW,EACX,aAAc,EACd,WAAY,CACb,EACD,UAAWze,KAAS,KAAK,OAAO,OAAM,EACpCye,EAAM,QACFze,EAAM,SAAW,EACnBye,EAAM,YACGze,EAAM,SAAW,EAC1Bye,EAAM,eACGze,EAAM,SAAW,GAC1Bye,EAAM,aAGV,OAAOA,CACX,CACE,iBAAkB,CAChB,OAAO,MAAM,KAAK,KAAK,OAAO,OAAM,CAAE,EAAE,OAAQze,GAAUA,EAAM,QAAU,CAAkB,CAChG,CACE,6BAA8B,CAC5B,OAAO,MAAM,KAAK,KAAK,OAAO,OAAQ,CAAA,EAAE,OACrCA,GAAUA,EAAM,QAAU,GAAqB,CAAC,KAAK,qBAAqB,IAAIA,EAAM,GAAG,CACzF,CACL,CAIE,MAAO,CACL,OAAO,MAAM,KAAK,KAAK,OAAO,KAAI,CAAE,CACxC,CACA,KAMI,kBAAmB9sB,GAAA,cAAgC,QAAS,CAI9D,YAAY49B,EAAKr8B,EAAO,CACtB,MAAMq8B,EAAKr8B,CAAK,EAFlBgqB,EAAA,cAGE,KAAK,OAAL,KAAK,KAAS,MAClB,CACE,OAAO,KAAKhqB,EAAO,CACjB,OAAO,IAAIvB,GAAkBuB,EAAM,IAAKA,CAAK,CACjD,CACE,IAAI,OAAOu9B,EAAM,CACf,KAAK,KAAO,KAAK,KAAK,OAAQzd,GAAMA,EAAE,CAAC,IAAM,OAAO,EACpD,UAAW2J,KAAO8T,EAChB,KAAK,KAAK,KAAK,CAAC,QAAS9T,CAAG,CAAC,CAEnC,CACE,IAAI,QAAS,CACX,MAAMzkB,EAAI,CAAE,EACZ,UAAW6Z,KAAO,KAAK,KACjBA,EAAI,CAAC,IAAM,SACb7Z,EAAE,KAAK6Z,EAAI,CAAC,CAAC,EAGjB,OAAO7Z,CACX,CACE,IAAI,MAAMu4B,EAAM,CACd,KAAK,KAAO,KAAK,KAAK,OAAQzd,GAAMA,EAAE,CAAC,IAAM,MAAM,EACnD,UAAW2J,KAAO8T,EAChB,KAAK,KAAK,KAAK,CAAC,OAAQ9T,CAAG,CAAC,CAElC,CACE,IAAI,OAAQ,CACV,MAAMzkB,EAAI,CAAE,EACZ,UAAW6Z,KAAO,KAAK,KACjBA,EAAI,CAAC,IAAM,QACb7Z,EAAE,KAAK6Z,EAAI,CAAC,CAAC,EAGjB,OAAO,MAAM,KAAK,IAAI,IAAI7Z,CAAC,CAAC,CAChC,CACE,IAAI,MAAO,CACT,OAAI,KAAK,MACA,KAAK,OAEd,KAAK,MAAQ,KAAK,SAAS,QAAQ,GAAK,KAAK,OACtC,KAAK,MAChB,CACE,IAAI,KAAKkmB,EAAQ,CACf,KAAK,MAAQA,EACb,KAAK,UAAU,QAAQ,EACnBA,GACF,KAAK,KAAK,KAAK,CAAC,SAAUA,CAAM,CAAC,CAEvC,CACE,IAAI,UAAW,CACb,OAAO,YAAY,cAAc,KAAK,OAAQ,KAAK,GAAG,CAC1D,CACA,EAzDElB,EADqBvrB,GACd,OAAO,OACdurB,EAFqBvrB,GAEd,QAAQ,CAAC,KAA0B,GAFrBA,OAgEnB,YAAaA,GAAA,cAA0B,QAAS,CAGlD,YAAY49B,EAAKmL,EAAU,CACzB,MAAMnL,EAAKmL,CAAQ,EACnB,KAAK,OAAL,KAAK,KAAS,MAClB,CAOE,OAAO,KAAKxnC,EAAO,CACjB,OAAO,IAAIvB,GAAYuB,EAAM,IAAKA,CAAK,CAC3C,CAME,IAAI,OAAQ,CACV,OAAO,KAAK,SAAS,OAAO,CAChC,CAME,IAAI,MAAMsL,EAAO,CACf,KAAK,UAAU,OAAO,EAClBA,GAAO,KAAK,KAAK,KAAK,CAAC,QAASA,CAAK,CAAC,CAC9C,CAME,IAAI,OAAQ,CACV,OAAO,KAAK,SAAS,OAAO,CAChC,CAME,IAAI,MAAM2+B,EAAO,CACf,KAAK,UAAU,OAAO,EAClBA,GAAO,KAAK,KAAK,KAAK,CAAC,QAASA,CAAK,CAAC,CAC9C,CACE,IAAI,SAAU,CACZ,OAAO,KAAK,SAAS,SAAS,CAClC,CACE,IAAI,QAAQC,EAAS,CACnB,KAAK,UAAU,SAAS,EACpBA,GAAS,KAAK,KAAK,KAAK,CAAC,UAAWA,CAAO,CAAC,CACpD,CAME,IAAI,cAAe,CACjB,MAAMrrB,EAAM,KAAK,SAAS,cAAc,EACxC,GAAIA,EAAK,CACP,IAAItd,EAAM,OAAO,SAASsd,CAAG,EAC7B,OAAItd,EAAM,OACRA,EAAM,KAAK,MAAMA,EAAM,GAAG,GAErBA,CACb,CAEA,CAME,IAAI,aAAa4oC,EAAW,CAC1B,KAAK,UAAU,cAAc,EACzBA,IAAc,QAChB,KAAK,KAAK,KAAK,CAAC,eAAgBA,EAAU,SAAQ,CAAE,CAAC,CAE3D,CASE,MAAM,cAAe,CACnB,aAAM,aAAc,EACf,KAAK,eACR,KAAK,aAAe,KAAK,YAEpB,MAAM,aAAc,CAC/B,CAME,IAAI,KAAM,CACR,OAAO,KAAK,SAAS,KAAK,CAC9B,CAME,IAAI,IAAI1gB,EAAK,CACPA,EACF,KAAK,KAAK,KAAK,CAAC,MAAOA,CAAG,CAAC,EAE3B,KAAK,UAAU,KAAK,CAE1B,CACA,EAtHEO,EADevrB,GACR,OAAO,OACdurB,EAFevrB,GAER,QAAQ,CAAC,KAAoB,GAFrBA,IA0HjB,SAAS,mBAAmB2rC,EAAQ,CAClC,OAAOA,EAAO,OAAO,CAACv6B,EAAKykB,IAAU,CACnC,GAAIA,EAAM,OAAS,EACjB,MAAM,IAAI,MAAM,0BAA0B,EAE5C,OAAOzkB,EAAMykB,EAAM,MACpB,EAAE,CAAC,CACN,QACI,eAAgB71B,GAAA,cAA6B,QAAS,CAUxD,YAAY49B,EAAKr8B,EAAO,CACtB,MAAMq8B,EAAKr8B,CAAK,EAVlBgqB,EAAA,eAAU,CAAE,GACZA,EAAA,cAMAA,EAAA,gBAAW,CAAE,GACbA,EAAA,iBAGE,KAAK,OAAL,KAAK,KAAS,KAClB,CACE,aAAa,KAAKhqB,EAAO,CACvB,MAAMo2B,EAAQ,IAAI33B,GAAeuB,EAAM,IAAKA,CAAK,EACjDo2B,EAAM,SAAWp2B,EACjB,GAAI,CACF,MAAMo2B,EAAM,QAAS,CAC3B,MAAY,CACNA,EAAM,QAAUA,EAAM,SAAS,OACrC,CACI,GAAI,CACF,MAAMtC,EAAU,KAAK,MAAMsC,EAAM,OAAO,EAIxC,GAHAA,EAAM,OAAStC,EAAQ,OACvBsC,EAAM,KAAOtC,EAAQ,MAAQsC,EAAM,SAAS,MAAM,EAClDA,EAAM,cAAgBtC,EAAQ,KAAO,CAAE,EACnC,CAAC,MAAM,QAAQsC,EAAM,MAAM,EAAG,MACnC,MAAY,CACX,MACN,CACI,OAAOA,CACX,CACE,IAAI,QAAS,CACX,OAAO,KAAK,OAChB,CACE,IAAI,OAAOgU,EAAQ,CACjB,MAAMC,EAAqB,IAAI,IAC/B,KAAK,QAAUD,EAAO,OAAQ9V,GACxB+V,EAAG,IAAI/V,EAAM,CAAC,GAChB,QAAQ,KAAK,4CAA6CA,EAAM,CAAC,EAC1D,IAELA,EAAM,OAAS,GACjB,QAAQ,KAAK,qCAAsCA,CAAK,EACjD,KAET+V,EAAG,IAAI/V,EAAM,CAAC,EACP,GACR,EAAE,IAAI,KAAK,UAAU,CAC1B,CAIE,WAAWA,EAAO,CAChB,MAAO,CACL,GAAIA,EAAM,GACV,OAAQA,EAAM,OACd,EAAGA,EAAM,EACT,OAAQA,EAAM,MACf,CACL,CACE,MAAM,aAAapJ,EAAQ,CACzB,GAAI,CAAC,KAAK,IAAK,MAAM,IAAI,MAAM,QAAQ,EACvC,GAAI,CAAC,KAAK,IAAI,OAAQ,MAAM,IAAI,MAAM,WAAW,EACjD,MAAMe,EAAU,CACd,OAAQ,KAAK,OAAO,IAAI,KAAK,UAAU,EACvC,KAAM,KAAK,KACX,IAAK,KAAK,eAAiB,CAAA,CAC5B,EACD,KAAK,QAAU,KAAK,UAAUA,CAAO,EACrC,MAAM2a,EAAO,MAAM,KAAK,IAAI,OAAO,KAAM,EACzC,aAAM,KAAK,QAAQA,EAAM,OAAQ,OAAO,EACjC,MAAM,aAAa1b,CAAM,CACpC,CACE,IAAI,KAAKof,EAAM,CACb,KAAK,MAAQA,CACjB,CACE,IAAI,MAAO,CACT,OAAO,KAAK,KAChB,CAIE,IAAI,eAAgB,CAClB,OAAO,KAAK,QAChB,CAIE,IAAI,cAAcC,EAAU,CAC1B,KAAK,SAAWA,CACpB,CACE,IAAI,QAAS,CACX,OAAO,mBAAmB,KAAK,MAAM,CACzC,CACE,MAAM,QAAQjD,EAAUzI,EAAW6D,EAAoB,CACrD,OAAI,KAAK,SACA,KAAK,SAAS,QAAQ4E,EAAUzI,EAAW6D,CAAkB,EAE/D,MAAM,QAAQ4E,EAAUzI,EAAW6D,CAAkB,CAChE,CACA,EAnGE1Y,EAHkBvrB,GAGX,OAAO,MACdurB,EAJkBvrB,GAIX,QAAQ,CAAC,IAAsB,GAJpBA,OA0GhB,cAAeA,GAAA,cAA4B,QAAS,CAItD,YAAY49B,EAAKmL,EAAU,CACzB,MAAMnL,EAAKmL,CAAQ,EAJrBxd,EAAA,iBAKE,KAAK,OAAL,KAAK,KAAS,KAClB,CACE,OAAO,KAAKhqB,EAAO,CACjB,OAAO,IAAIvB,GAAcuB,EAAM,IAAKA,CAAK,CAC7C,CACE,IAAI,KAAM,CACR,OAAO,KAAK,SAAS,GAAG,CAC5B,CAIE,IAAI,QAAQwqC,EAAS,CACfA,IAAY,OACd,KAAK,KAAO,KAAK,KAAK,OAAO,CAAC,CAAC3rB,EAAK4rB,CAAM,IAAM5rB,IAAQ,SAAS,GAEjE,KAAK,KAAO,KAAK,KAAK,OAAO,CAAC,CAACA,EAAK4rB,CAAM,IAAM5rB,IAAQ,SAAS,EACjE,KAAK,KAAK,KAAK,CAAC,UAAW2rB,CAAO,CAAC,EAEzC,CACE,IAAI,SAAU,OACZ,QAAO/rC,EAAA,KAAK,KAAK,KAAK,CAAC,CAACogB,EAAK4rB,CAAM,IAAM5rB,IAAQ,SAAS,IAAnD,YAAApgB,EAAuD,KAAM,MACxE,CAKE,IAAI,SAAU,CACZ,OAAO,KAAK,QAChB,CAME,IAAI,QAAQisC,EAAS,CACnB,KAAK,SAAWA,EACZ,OAAOA,GAAY,SACrB,KAAK,KAAK,KAAK,CAAC,IAAKA,CAAO,CAAC,EAE7B,KAAK,IAAIA,CAAO,CAEtB,CACE,eAAgB,CACd,OAAO,KAAK,gBAAgB,GAAG,EAAE,CAAC,GAAK,KAAK,gBAAgB,GAAG,EAAE,CAAC,GAAK,KAAK,gBAAgB,GAAG,EAAE,CAAC,CACtG,CACE,MAAM,YAAa,OACjB,GAAI,KAAK,WAAa,OAAQ,OAAO,KAAK,SAC1C,IAAIC,EACJ,MAAMC,EAAa,KAAK,cAAe,EACvC,GAAKA,EACL,QAAQA,EAAW,CAAC,EAAC,CACnB,IAAK,IAAK,CACR,KAAM,CAACrgB,EAAMW,EAAQ2f,CAAU,EAAID,EAAW,CAAC,EAAE,MAAM,GAAG,EAC1DD,EAAeG,cAAO,YAAY,CAChC,KAAM,OAAO,SAASvgB,CAAI,EAC1B,OAAAW,EACA,WAAA2f,CACV,CAAS,EACD,KACR,CACM,IAAK,IACHF,EAAeG,cAAO,WAAWF,EAAW,CAAC,CAAC,EAC9C,MACF,IAAK,IACH,KAAK,SAAWA,EAAW,CAAC,EAC5B,KACR,CACI,GAAID,EAAc,CAChB,IAAIrsC,EAAI,OAAMG,EAAA,KAAK,MAAL,YAAAA,EAAU,WAAWksC,IAC/BrsC,IACEA,EAAE,OAAS,QACbA,EAAI,WAAW,KAAKA,CAAC,GAEvB,KAAK,SAAWA,EAExB,CACI,OAAO,KAAK,SAChB,CACA,EAlFE0rB,EAFiBvrB,GAEV,OAAO,MACdurB,EAHiBvrB,GAGV,QAAQ,CAAC,IAAqB,GAHpBA,IAuFnB,SAAS,YAAYogB,EAAK,CACxB,MAAMvY,EAAO,CAAE,EACf,GAAIuY,EAAI,SAAW,EAAG,CACpB,MAAMksB,EAAQlsB,EAAI,CAAC,EAAE,MAAM,GAAG,EAC9B,QAASrhB,EAAI,EAAGA,EAAIutC,EAAM,OAAQvtC,GAAK,EAAG,CACxC,MAAMmF,EAAMooC,EAAMvtC,CAAC,EACb6J,EAAQ0jC,EAAMvtC,EAAI,CAAC,EACrBmF,IAAQ,YACL2D,EAAK,WAAUA,EAAK,SAAW,CAAE,GACtCA,EAAK,SAAS,KAAKe,CAAK,GAExBf,EAAK3D,CAAG,EAAI0E,CAEpB,CACI,OAAOf,CACX,CACE,MAAM+sB,EAAOxU,EAAI,MAAM,CAAC,EACxB,UAAWtd,KAAO8xB,EAAM,CACtB,MAAM0X,EAAQxpC,EAAI,MAAM,GAAG,EACrBoB,EAAMooC,EAAM,CAAC,EACb1jC,EAAQ0jC,EAAM,MAAM,CAAC,EAAE,KAAK,GAAG,EACjCpoC,IAAQ,YACL2D,EAAK,WAAUA,EAAK,SAAW,CAAE,GACtCA,EAAK,SAAS,KAAKe,CAAK,GAExBf,EAAK3D,CAAG,EAAI0E,CAElB,CACE,OAAOf,CACT,CACA,SAAS,cAAc0kC,EAAO,CAC5B,MAAMnsB,EAAM,CAAC,OAAO,EACpB,SAAW,CAAClc,EAAK0E,CAAK,IAAK,OAAO,QAAQ2jC,CAAK,EAC7C,GAAI,MAAM,QAAQ3jC,CAAK,EACrB,UAAW3D,KAAK2D,EACdwX,EAAI,KAAK,GAAGlc,CAAG,IAAIe,CAAC,EAAE,OAEf2D,GACTwX,EAAI,KAAK,GAAGlc,CAAG,IAAI0E,CAAK,EAAE,EAG9B,OAAOwX,CACT,QAGI,UAAWpgB,GAAA,cAAwB,QAAS,CAI9C,YAAY49B,EAAKmL,EAAU,CACzB,MAAMnL,EAAKmL,CAAQ,EAFrBxd,EAAA,gBAGE,KAAK,OAAL,KAAK,KAAS,GAClB,CAOE,OAAO,KAAKhqB,EAAO,CACjB,OAAO,IAAIvB,GAAUuB,EAAM,IAAKA,EAAM,SAAQ,CAAE,CACpD,CACE,IAAI,SAAU,CACZ,OAAO,KAAK,OAAO,OAAS,CAChC,CACE,IAAI,QAAS,CACX,OAAI,KAAK,QAAgB,KAAK,SAC9B,KAAK,QAAU,KAAK,KAAK,OAAQ6e,GAAQA,EAAI,CAAC,IAAM,OAAO,EAAE,IAAI,WAAW,EAAE,OAAQmsB,GAAU,CAAC,CAACA,EAAM,GAAG,EACpG,KAAK,QAChB,CACE,IAAI,OAAO3X,EAAM,CACf,KAAK,QAAUA,EACf,KAAK,KAAO,KAAK,KAAK,OAAQxU,GAAQA,EAAI,CAAC,IAAM,OAAO,EACxD,KAAK,KAAK,KAAK,GAAGwU,EAAK,IAAI,aAAa,CAAC,CAC7C,CACA,EA7BErJ,EADavrB,GACN,OAAO,IACdurB,EAFavrB,GAEN,QAAQ,CAAC,EAAe,GAFlBA,OAiCX,SAAUA,GAAA,cAAuB,QAAS,CAoB5C,YAAY49B,EAAKmL,EAAU,CACzB,MAAMnL,EAAKmL,CAAQ,EApBrBxd,EAAA,uBAkBAA,EAAA,4BAGE,KAAK,OAAL,KAAK,KAAS,MAClB,CAIE,OAAO,KAAKihB,EAAU,CACpB,OAAO,IAAIxsC,GAASwsC,EAAS,IAAKA,CAAQ,CAC9C,CAIE,IAAI,OAAQ,CACV,MAAMC,EAAW,KAAK,SAAS,OAAO,GAAK,KAAK,SAAS,MAAM,EAC/D,OAAIA,IACA,KAAK,OAAS,EACT,WAEL,KAAK,OAAS,IACT,OAEL,KAAK,OAAS,MACT,eAEL,KAAK,OAAS,MACT,iBAEL,KAAK,OAAS,MACT,YAEL,KAAK,OAAS,MACT,cAEL,KAAK,OAAS,MACT,eAEL,KAAK,OAAS,MACT,iBAEL,KAAK,OAAS,MACT,gBAEL,KAAK,OAAS,MACT,gCAEL,KAAK,OAAS,MACT,YAEL,KAAK,OAAS,MACT,SAEF,KAAK,SAAS,GAAG,EAC5B,CAIE,IAAI,MAAM5/B,EAAO,CACf,KAAK,UAAU,CAAC,QAAS,MAAM,CAAC,EAC5BA,GAAO,KAAK,KAAK,KAAK,CAAC,QAASA,CAAK,CAAC,CAC9C,CAKE,IAAI,MAAO,CACT,OAAO,KAAK,KAChB,CAKE,IAAI,KAAKpJ,EAAM,CACb,KAAK,MAAQA,CACjB,CAIE,IAAI,aAAc,CAChB,OAAO,KAAK,SAAS,aAAa,CACtC,CAIE,IAAI,YAAYA,EAAM,CACpB,KAAK,UAAU,aAAa,EACxBA,GAAM,KAAK,KAAK,KAAK,CAAC,cAAeA,CAAI,CAAC,CAClD,CAIE,IAAI,OAAQ,CACV,OAAO,KAAK,SAAS,OAAO,CAChC,CAIE,IAAI,MAAMA,EAAM,CACd,KAAK,UAAU,OAAO,EAClBA,GAAM,KAAK,KAAK,KAAK,CAAC,QAASA,CAAI,CAAC,CAC5C,CACE,2BAA4B,CAC1B,MAAO,CAAC,EAAE,KAAK,gBAAkB,KAAK,sBAAwB,KAAK,QAAQ,OAC/E,CAIE,MAAM,cAAcipC,EAAW,GAAM,CACnC,GAAIA,GAAY,KAAK,0BAAyB,EAAI,OAAO,KAAK,eAC9D,GAAI,CAAC,KAAK,IAAK,MAAM,IAAI,MAAM,sBAAsB,EACrD,GAAI,CAAC,KAAK,IAAI,OAAQ,MAAM,IAAI,MAAM,oBAAoB,EAC1D,MAAMvE,EAAO,MAAM,KAAK,IAAI,OAAO,KAAM,EACzC,GAAI,CACF,GAAI,KAAK,QAAQ,OAAS,EACxB,GAAI,CACF,MAAMwE,EAAmB,MAAM,KAAK,IAAI,OAAO,QAAQxE,EAAM,KAAK,OAAO,EACnEtoC,EAAI,KAAK,MAAM8sC,CAAgB,EACrC,OAAI9sC,GAAA,MAAAA,EAAI,IACN,KAAK,oBAAsB,KAAK,QAAQ,OACjC,KAAK,eAAiBA,IAE/B,KAAK,oBAAsB,KAAK,QAAQ,OACjC,KAAK,eAAiB,CAAE,EAChC,MAAY,CACrB,CAEK,MAAY,CACjB,CACI,MAAO,CAAE,CACb,CAME,YAAY+sC,EAAW,CACrB,MAAO,EACX,CACE,SAASnqC,EAAM,CACb,OAAO,KAAK,KAAK,OAAQ2d,GAAQA,EAAI,CAAC,IAAM3d,CAAI,CACpD,CAIE,IAAI,OAAQ,CACV,OAAO,KAAK,KAAK,OAAQ,GAChB,CAAC,CACN,IACA,IACA,IACA,QACA,OACA,cACA,eACA,UACA,QACA,QACA,MACA,aACA,UACA,QACR,EAAQ,SAAS,EAAE,CAAC,CAAC,CAChB,CACL,CAQE,MAAM,QAAQsQ,EAAM85B,EAAO,OAAQ7G,EAAY,GAAO8G,EAAW,SAAU,CACzE,GAAI,CAAC,KAAK,IAAK,MAAM,IAAI,MAAM,sBAAsB,EACrD,GAAI,CAAC,KAAK,IAAI,OAAQ,MAAM,IAAI,MAAM,oBAAoB,EAC1D,IAAIlY,EACJ,GAAI7hB,aAAgB,SAClB6hB,EAAO,CAAC7hB,EAAK,aAAa85B,CAAI,CAAC,UACtB95B,aAAgB,QACzB6hB,EAAO7hB,EAAK,cAAe,UAClBA,aAAgB,SACzB6hB,EAAO7hB,EAAK,cAAe,UAClB,MAAM,QAAQA,CAAI,EAC3B6hB,EAAO,CAAC7hB,CAAI,MAEZ,OAAM,IAAI,MAAM,qBAAqB,EAGvC,GADI85B,GAAMjY,EAAK,CAAC,EAAE,KAAKiY,CAAI,EACvB7G,EAAW,CACb,MAAMmC,EAAO,MAAM,KAAK,IAAI,OAAO,KAAM,EACnC4E,EAAc,MAAM,KAAK,cAAe,EAC1CD,IAAa,MAAOC,EAAY,QAAQ,GAAGnY,CAAI,EAC9CmY,EAAY,KAAK,GAAGnY,CAAI,EAC7B,KAAK,eAAiBmY,EACtB,KAAK,oBAAsB,KAAK,QAAQ,OACxC,KAAK,QAAU,KAAK,UAAUA,CAAW,EACzC,MAAM,KAAK,QAAQ5E,CAAI,CAC7B,MACU2E,IAAa,MAAO,KAAK,KAAK,QAAQ,GAAGlY,CAAI,EAC5C,KAAK,KAAK,KAAK,GAAGA,CAAI,EAE7B,KAAK,WAAa,KAAK,MAAM,KAAK,IAAK,EAAG,GAAG,EAC7C,KAAK,KAAK,QAAQ,CACtB,CAOE,MAAM,kBAAkBhsB,EAAOw+B,EAAU,GAAM,CAC7C,GAAI,CAAC,KAAK,IAAK,MAAM,IAAI,MAAM,sBAAsB,EACrD,GAAI,CAAC,KAAK,IAAI,OAAQ,MAAM,IAAI,MAAM,oBAAoB,EAC1D,MAAMxoC,EAAQ,KAAK,KAAK,UAAWwhB,GAAQA,EAAI,CAAC,IAAMxX,CAAK,EACvDhK,GAAS,GACX,KAAK,KAAK,OAAOA,EAAO,CAAC,EAE3B,MAAMupC,EAAO,MAAM,KAAK,IAAI,OAAO,KAAM,EACnC6E,EAAgB,MAAM,KAAK,cAAe,EAC1CC,EAAiBD,EAAc,UAAW5sB,GAAQA,EAAI,CAAC,IAAMxX,CAAK,EAQxE,GAPIqkC,GAAkB,IACpBD,EAAc,OAAOC,EAAgB,CAAC,EACtC,KAAK,eAAiBD,EACtB,KAAK,oBAAsB,KAAK,QAAQ,OACxC,KAAK,QAAU,KAAK,UAAUA,CAAa,EAC3C,MAAM,KAAK,QAAQ7E,CAAI,GAErBf,EACF,OAAO,KAAK,mBAAoB,EAElC,KAAK,WAAa,KAAK,MAAM,KAAK,IAAK,EAAG,GAAG,EAC7C,KAAK,KAAK,QAAQ,CACtB,CAOE,MAAM,WAAWxoC,EAAOonC,EAAW,CACjC,GAAI,CAAC,KAAK,IAAK,MAAM,IAAI,MAAM,sBAAsB,EACrD,GAAI,CAAC,KAAK,IAAI,OAAQ,MAAM,IAAI,MAAM,oBAAoB,EAC1D,GAAIA,EAAW,CACb,MAAMmC,EAAO,MAAM,KAAK,IAAI,OAAO,KAAM,EACnC4E,EAAc,MAAM,KAAK,cAAe,EAC9CA,EAAY,OAAOnuC,EAAO,CAAC,EAC3B,KAAK,eAAiBmuC,EACtB,KAAK,oBAAsB,KAAK,QAAQ,OACxC,KAAK,QAAU,KAAK,UAAUA,CAAW,EACzC,MAAM,KAAK,QAAQ5E,CAAI,CAC7B,MACM,KAAK,KAAK,OAAOvpC,EAAO,CAAC,EAE3B,YAAK,WAAa,KAAK,MAAM,KAAK,IAAK,EAAG,GAAG,EAC7C,KAAK,KAAK,QAAQ,EACX,IACX,CACE,IAAImU,EAAM,CACR,OAAO,KAAK,MAAM,KAAMqN,GAAQA,EAAI,CAAC,IAAMrN,CAAI,CACnD,CASE,gBAAiB,CACf,MAAMm6B,EAAsB,IAAI,IAC1BC,EAA+B,IAAI,IACnChhB,EAAU,CAAE,EAClB,UAAW/L,KAAO,KAAK,MACrB,GAAIA,EAAI,CAAC,IAAM,KAAOA,EAAI,CAAC,EACzB8sB,EAAI,IAAI9sB,EAAI,CAAC,CAAC,UACLA,EAAI,CAAC,IAAM,KAAOA,EAAI,CAAC,EAAG,CACnC,KAAM,CAAC0L,EAAMW,EAAQ2c,CAAI,EAAIhpB,EAAI,CAAC,EAAE,MAAM,GAAG,EAC7C,GAAI,CAAC0L,GAAQ,CAACW,EAAQ,SACtB,MAAMvoB,EAAM,GAAG4nB,CAAI,IAAIW,CAAM,GACvB1Z,EAAOo6B,EAAa,IAAIjpC,CAAG,GAAK,CAAE,EACxC6O,EAAK,KAAKq2B,GAAQ,EAAE,EACpB+D,EAAa,IAAIjpC,EAAK6O,CAAI,CAClC,CAKI,GAHIm6B,EAAI,KAAO,GACb/gB,EAAQ,KAAK,CAAE,IAAK,MAAM,KAAK+gB,CAAG,EAAG,EAEnCC,EAAa,KAAO,EACtB,SAAW,CAACjpC,EAAKgoB,CAAM,IAAKihB,EAAa,QAAO,EAAI,CAClD,KAAM,CAACrhB,EAAMW,CAAM,EAAIvoB,EAAI,MAAM,GAAG,EACpCioB,EAAQ,KAAK,CACX,MAAO,CAAC,OAAO,SAASL,CAAI,CAAC,EAC7B,QAAS,CAACW,CAAM,EAChB,KAAMP,CAChB,CAAS,CACT,CAEI,OAAOC,CACX,CACA,EA5TEZ,EAFYvrB,GAEL,QAAQ,CACb,MACA,MACA,MACA,MACA,MACA,MACA,MACA,MACA,MACA,MACA,KACD,GAdWA,IA+TV,cAAgB,WAIhB,WAAYA,GAAA,cAAyB,QAAS,CAKhD,YAAY49B,EAAKr8B,EAAO,CACtB,MAAMq8B,EAAKr8B,CAAK,EALlBgqB,EAAA,cACAA,EAAA,eAAU,CAAE,GAiGZA,EAAA,cAAS,KAAK,QA5FZ,KAAK,OAAL,KAAK,KAAS,MACd,KAAK,OAAQqS,GAAA,YAAAA,EAAK,MAAM,OAAO,YAAawP,aAAO,YAAY,EAC1D,KAAK,MAAK,KAAK,IAAM,oBAC1B,GAAI,CACF,MAAMC,EAAY,KAAK,gBAAgB,OAAO,EAC1CA,EAAU,OACZ,KAAK,QAAUA,EAAU,IAAKjtB,GAAQ,KAAK,MAAMA,EAAI,CAAC,CAAC,CAAC,EAExD,KAAK,QAAU,KAAK,MAAM,KAAK,OAAO,CAE9C,MAAY,CACN,MACN,CACA,CACE,OAAO,KAAK7e,EAAO,CACjB,MAAMG,EAAI,IAAI1B,GAAWuB,EAAM,IAAKA,CAAK,EACzC,GAAI,GAACG,EAAE,SAAW,CAACA,EAAE,QAAQ,QAC7B,OAAOA,CACX,CACE,IAAI,QAAQm1B,EAAS,CACnB,KAAK,QAAUA,GAAW,EAC9B,CACE,IAAI,SAAU,CACZ,MAAMr1B,EAAI,KAAK,SAAS,SAAS,EACjC,OAAIA,GACG,KAAK,OAChB,CACE,IAAI,OAAOmqC,EAAQ,CACjB,KAAK,QAAUA,EACf,KAAK,KAAO,KAAK,KAAK,OAAQvrB,GAAQA,EAAI,CAAC,IAAM,OAAO,EACxD,UAAWyV,KAAS8V,EAClB,KAAK,KAAK,KAAK,CAAC,QAAS,KAAK,UAAU9V,CAAK,CAAC,CAAC,CAErD,CACE,IAAI,QAAS,CACX,OAAO,KAAK,OAChB,CACE,IAAI,SAAU,OACZ,MAAMyX,EAAa,KAAK,OAAO,CAAC,EAChC,GAAI,CACF,MAAMrX,EAAS,KAAK,MAAMqX,EAAW,MAAM,EAC3C,IAAI9f,EAUJ,GATI,OAAOyI,GAAW,UACpBzI,EAAU,KAAK,MAAMyI,CAAM,EAC3B,KAAK,MAAM,sBAAuBqX,EAAW,MAAM,GAC1C,OAAOrX,GAAW,WAC3BzI,EAAUyI,GAER,MAAM,QAAQzI,CAAO,GAAKA,EAAQ,CAAC,IAAM,QAAUA,EAAQ,OAAS,GAAK,OAAOA,EAAQ,CAAC,GAAM,UAAYA,EAAQ,CAAC,IAAM,MAG1H,OAAOA,GAAY,UAAYA,IAAY,MAAQ,QAAOxtB,EAAAwtB,EAAQ,CAAC,IAAT,YAAAxtB,EAAY,OAAS,SACjF,OAAOwtB,EAAQ,CAAC,EAAE,IAErB,OAAQ9rB,EAAG,CACV,KAAK,MAAM,4BAA6BA,EAAG,KAAK,OAAO,CAAC,CAAC,CAC/D,CAEA,CAME,IAAI,MAAO,CACT,MAAM6rC,EAAU,KAAK,QACrB,GAAKA,EACL,OAAOA,EAAQ,WAAW,IAAI,EAAIA,EAAQ,MAAM,CAAC,EAAIA,CACzD,CAIE,IAAI,MAAO,CACT,OAAO,KAAK,SAAS,GAAG,CAC5B,CACE,IAAI,KAAK3kC,EAAO,CACd,KAAK,WAAW,CAAC,IAAKA,CAAK,CAAC,CAChC,CACE,IAAI,MAAO,CACT,IAAI4kC,EAAQ,KAAK,SAAS,MAAM,GAAK,MACrC,OAAIA,GAAA,MAAAA,EAAO,WAAW,UAASA,EAAQ,OAChCA,CACX,CACE,IAAI,KAAK5kC,EAAO,CAEd,GADA,KAAK,UAAU,MAAM,EACjBA,GAAA,MAAAA,EAAO,WAAW,QAAS,MAAM,IAAI,MAAM,mDAAmD,EAC9FA,GAAO,KAAK,IAAI,CAAC,OAAQA,CAAK,CAAC,CACvC,CACE,IAAI,QAAS,CAEX,OADe,KAAK,OAAO,OAAO,CAAC6kC,EAAO5X,IAAU4X,EAAQ5X,EAAM,OAAQ,CAAC,CAE/E,CAME,IAAI,OAAOlL,EAAQ,CACjB,KAAK,KAAO,KAAK,KAAK,OAAQtJ,GAAMA,EAAE,CAAC,IAAM,GAAG,EAC5CsJ,aAAkB,UACpB,KAAK,KAAK,KAAKA,EAAO,aAAY,CAAE,CAE1C,CACE,IAAI,gBAAgB8B,EAAQ,CAC1B,KAAK,UAAU,GAAG,EAClB,KAAK,IAAI,CAAC,IAAKA,CAAM,CAAC,CAC1B,CACE,IAAI,iBAAkB,CACpB,OAAO,KAAK,SAAS,GAAG,CAC5B,CACE,IAAI,WAAY,CACd,MAAMA,EAAS,KAAK,gBACpB,OAAI,KAAK,IAAY,KAAK,IAAI,QAAQ,CAAE,OAAAA,EAAQ,EACzC,IAAI,QAAQ,CAAE,OAAAA,EAAQ,CACjC,CACE,MAAM,cAAe,CACf,KAAK,OAAS,SAChB,KAAK,KAAO,OAEd,KAAK,UAAU,QAAQ,EACvB,KAAK,KAAK,KAAK,CAAC,SAAU,KAAK,OAAO,SAAQ,CAAE,CAAC,EACjD,MAAMlrB,EAAQ,MAAM,MAAM,aAAc,EACxC,OAAAA,EAAM,QAAU,KAAK,QACdA,CACX,CAIE,IAAI,SAAU,CACZ,IAAImsC,EAAY,EACZC,EAAY,EACZC,EAAe,EACnB,UAAWxtB,KAAO,KAAK,KACjBA,EAAI,CAAC,IAAM,KAAKstB,IAChBttB,EAAI,CAAC,IAAM,KAAKutB,IAChBvtB,EAAI,CAAC,IAAM,KAAKwtB,IAEtB,OAEED,IAAc,GAAKC,IAAiB,GACpCF,GAAa,GACb,KAAK,OAAO,OAAS,CAE3B,CACA,EApJEniB,EAHcvrB,GAGP,OAAO,MACdurB,EAJcvrB,GAIP,QAAQ,CAACA,GAAW,IAAI,GAJjBA,OAqLZ,0BAA2BA,GAAA,cAAwC,QAAS,CAK9E,YAAY49B,EAAKmL,EAAU,CACzB,MAAMnL,EAAKmL,CAAQ,EALrBxd,EAAA,iBACAA,EAAA,iBAA4B,IAAI,KAK9B,KAAK,OAAL,KAAK,KAAS,OACd,KAAK,UAAY,IAAI,IAAI,KAAK,OAAO,CACzC,CACE,OAAO,KAAKhqB,EAAO,CACjB,OAAO,IAAIvB,GAA0BuB,EAAM,IAAKA,CAAK,CACzD,CACE,IAAI,SAAU,CACZ,OAAO,KAAK,gBAAgB,GAAG,EAAE,IAAK6e,GAAQA,EAAI,CAAC,CAAC,CACxD,CACE,UAAUytB,EAAQ,CAChB,OAAO,KAAK,UAAU,IAAIA,CAAM,CACpC,CACE,MAAM,QAAQhF,EAAUzI,EAAW6D,EAAoB,CACrD,OAAA4E,MAAa,KAAK,UACX,MAAM,mBAAmBA,EAAUzI,EAAW6D,CAAkB,CAC3E,CACA,EApBE1Y,EAH6BvrB,GAGtB,OAAO,OACdurB,EAJ6BvrB,GAItB,QAAQ,CAAC,KAAyB,GAJZA,OA0B3B,wBAAyBA,GAAA,cAAsC,QAAS,CAG1E,YAAY49B,EAAKmL,EAAU,CACzB,MAAMnL,EAAKmL,CAAQ,EACnB,KAAK,OAAL,KAAK,KAAS,KAClB,CACE,OAAO,KAAKxnC,EAAO,CACjB,OAAO,IAAIvB,GAAwBuB,EAAM,IAAKA,CAAK,CACvD,CACE,IAAI,MAAO,CACT,OAAO,KAAK,SAAS,MAAM,CAC/B,CACE,IAAI,SAAU,CACZ,OAAO,KAAK,SAAS,SAAS,CAClC,CACE,IAAI,OAAQ,CACV,OAAO,KAAK,SAAS,OAAO,CAChC,CACE,IAAI,OAAQ,CACV,GAAI,KAAK,gBAAgB,QAAQ,EAAE,OAAS,EAAG,MAAO,SACtD,GAAI,KAAK,gBAAgB,QAAQ,EAAE,OAAS,EAAG,MAAO,SAE1D,CACE,IAAI,MAAMusC,EAAO,CACf,KAAK,UAAU,QAAQ,EACvB,KAAK,UAAU,SAAS,EACpBA,IAAU,SACZ,KAAK,KAAK,KAAK,CAAC,SAAU,EAAE,CAAC,EACpBA,IAAU,WACnB,KAAK,KAAK,KAAK,CAAC,UAAW,EAAE,CAAC,CAEpC,CACE,IAAI,QAAS,CACX,GAAI,KAAK,gBAAgB,MAAM,EAAE,OAAS,EAAG,MAAO,OACpD,GAAI,KAAK,gBAAgB,QAAQ,EAAE,OAAS,EAAG,MAAO,QAE1D,CACE,IAAI,OAAOC,EAAQ,CACjB,KAAK,UAAU,MAAM,EACrB,KAAK,UAAU,QAAQ,EACnBA,IAAW,OACb,KAAK,KAAK,KAAK,CAAC,OAAQ,EAAE,CAAC,EAClBA,IAAW,UACpB,KAAK,KAAK,KAAK,CAAC,SAAU,EAAE,CAAC,CAEnC,CACA,EA9CExiB,EAD2BvrB,GACpB,OAAO,MACdurB,EAF2BvrB,GAEpB,QAAQ,CAAC,IAAyB,GAFdA,IA0D7B,SAAS,cAAcguC,EAAa,CAClC,KAAM,CAAC3sC,EAAGwB,CAAC,EAAImrC,EAAY,MAAM,GAAG,EAAE,IAAI,MAAM,EAChD,MAAO,CAAE,EAAA3sC,EAAG,EAAAwB,CAAG,CACjB,CACA,SAAS,eAAeorC,EAAc,CACpC,KAAM,CAACC,EAAOC,CAAM,EAAIF,EAAa,MAAM,GAAG,EAAE,IAAI,MAAM,EAC1D,MAAO,CAAE,MAAAC,EAAO,OAAAC,CAAQ,CAC1B,OACI,iBAAkBnuC,EAAA,KAAuB,CAW3C,YAAY24B,EAAK,CALjBpN,EAAA,aACAA,EAAA,cACAA,EAAA,iBACAA,EAAA,kBACAA,EAAA,mBA0DAA,EAAA,0BAAqB,IACZ,OAAO,KAAK,UAAU,OAAU,UAAY,OAAO,KAAK,UAAU,QAAW,UAAY,CAAC,OAAO,MAAM,KAAK,UAAU,KAAK,GAAK,CAAC,OAAO,MAAM,KAAK,UAAU,MAAM,GAE5KA,EAAA,wBAAmB,IACV,OAAO,KAAK,SAAS,GAAM,UAAY,OAAO,KAAK,SAAS,GAAM,UAAY,CAAC,OAAO,MAAM,KAAK,SAAS,CAAC,GAAK,CAAC,OAAO,MAAM,KAAK,SAAS,CAAC,GA5DpJ,GAAI,MAAM,QAAQoN,CAAG,EAAG,CACtB,MAAMvY,EAAMuY,EACZ,GAAIvY,EAAI,CAAC,IAAM,WAAaA,EAAI,OAAS,EACvC,MAAM,IAAI,MAAM,qBAAqB,EAEvC,KAAK,KAAOA,EAAI,CAAC,EACjB,KAAK,MAAQA,EAAI,CAAC,EAClB,KAAK,SAAW,cAAcA,EAAI,CAAC,CAAC,EACpC,KAAK,UAAY,eAAeA,EAAI,CAAC,CAAC,EACtC,MAAMguB,EAAQ,CAAE,EAChB,QAASrvC,EAAI,EAAGA,EAAIqhB,EAAI,OAAQrhB,IAAK,CACnC,KAAM,CAACmF,EAAK,GAAGwrB,CAAI,EAAItP,EAAIrhB,CAAC,EAAE,MAAM,GAAG,EACvCqvC,EAAMlqC,CAAG,EAAIwrB,EAAK,KAAK,GAAG,CAClC,CACU,OAAO,KAAK0e,CAAK,EAAE,OAAS,IAC9B,KAAK,WAAaA,EAE1B,MACM,KAAK,KAAOzV,EACZ,KAAK,MAAQ,OACb,KAAK,SAAW,CAAE,EAAG,EAAG,EAAG,CAAG,EAC9B,KAAK,UAAY,CAAE,MAAO,EAAG,OAAQ,CAAG,CAE9C,CACE,OAAO,QAAQvY,EAAK,CAClB,GAAI,CACF,OAAO,IAAIpgB,EAAiBogB,CAAG,CACrC,MAAY,CACN,OAAO,IACb,CACA,CACE,IAAI,OAAQ,OACV,OAAOpgB,EAAA,KAAK,aAAL,YAAAA,EAAiB,KAC5B,CACE,IAAI,MAAMquC,EAAO,OACXA,EAAO,KAAK,WAAa,CAAE,GAAG,KAAK,WAAY,MAAAA,CAAO,GACrDruC,EAAO,KAAK,aAAZ,aAAAA,EAAwB,KACjC,CACE,IAAI,UAAW,OACb,OAAOA,EAAA,KAAK,aAAL,MAAAA,EAAiB,IAAM,OAAO,WAAW,KAAK,WAAW,GAAG,EAAI,MAC3E,CACE,IAAI,SAASsuC,EAAU,OACjBA,IAAa,OACf,KAAK,WAAa,CAAE,GAAG,KAAK,WAAY,IAAKA,EAAS,UAAY,GAElEtuC,EAAO,KAAK,aAAZ,aAAAA,EAAwB,GAE9B,CAME,IAAI,SAAU,CACZ,OAAO,KAAK,sBAAwB,KAAK,iBAAkB,CAC/D,CAOE,OAAQ,CACN,GAAI,CAAC,KAAK,QAAS,CACjB,MAAM0jC,EAAS,CACZ,KAAK,qBAAiD,OAA1B,wBAC5B,KAAK,iBAAkB,EAA2B,OAAxB,qBACnC,EAAQ,OAAO,OAAO,EAChB,MAAM,IAAI,MAAM,oBAAoBA,EAAO,KAAK,IAAI,CAAC,EAAE,CAC7D,CACI,IAAI96B,EACJ,OAAQ,KAAK,KAAI,CACf,IAAK,QACHA,EAAQ,KAAK,MAAM,MAAO,EAC1B,MACF,IAAK,SACHA,EAAQ,KAAK,MAAM,OACnB,MACF,QACEA,EAAQ,KAAK,KACrB,CACI,MAAMwX,EAAM,CAAC,UAAW,KAAK,KAAMxX,EAAO,YAAY,KAAK,QAAQ,EAAG,UAAU,KAAK,SAAS,CAAC,EAC/F,GAAI,KAAK,WACP,SAAW,CAAC1E,EAAKqqC,CAAS,IAAK,OAAO,QAAQ,KAAK,UAAU,EAC3DnuB,EAAI,KAAK,GAAGlc,CAAG,IAAIqqC,CAAS,EAAE,EAGlC,OAAOnuB,CACX,CACA,EApGEmL,EADoBvrB,EACb,OAAO,QACdurB,EAFoBvrB,EAEb,SAAS,UAChBurB,EAHoBvrB,EAGb,QAAQ,SACfurB,EAJoBvrB,EAIb,SAAS,UAChBurB,EALoBvrB,EAKb,YAAY,aALCA,MAsGlB,UAAWA,GAAA,cAAwB,QAAS,CAK9C,YAAY49B,EAAKmL,EAAU,CACzB,MAAMnL,EAAKmL,CAAQ,EAHrBxd,EAAA,eACAA,EAAA,oBAGE,QAAK,OAAL,KAAK,KAAS,IACVwd,EACF,UAAW3oB,KAAO2oB,EAAS,KACzB,OAAQ3oB,EAAI,CAAC,EAAC,CACZ,IAAK,QACH,KAAK,OAAS,YAAYA,CAAG,EAC7B,MACF,IAAK,MACH,KAAK,WAAa,eAAeA,EAAI,CAAC,CAAC,EACvC,KACZ,CAGA,CAOE,OAAO,KAAK7e,EAAO,CACjB,OAAO,IAAIvB,GAAUuB,EAAM,IAAKA,CAAK,CACzC,CAIE,IAAI,SAAU,CACZ,MAAO,CAAC,CAAC,KAAK,KAClB,CAIE,IAAI,OAAQ,CACV,OAAO,KAAK,MAChB,CAIE,IAAI,MAAM6e,EAAK,CACb,KAAK,OAASA,EACd,KAAK,KAAO,KAAK,KAAK,OAAQiB,GAAMA,EAAE,CAAC,IAAM,OAAO,EAChDjB,GACF,KAAK,KAAK,KAAK,cAAcA,CAAG,CAAC,CAEvC,CAME,IAAI,YAAa,CACf,MAAMouB,EAAS,KAAK,SAAS,KAAK,EAClC,GAAKA,EACL,OAAO,eAAeA,CAAM,CAChC,CAME,IAAI,WAAWC,EAAY,CACzB,KAAK,UAAU,KAAK,EAChBA,GACF,KAAK,KAAK,KAAK,CAAC,MAAO,GAAGA,EAAW,KAAK,IAAIA,EAAW,MAAM,EAAE,CAAC,CAExE,CAME,IAAI,UAAW,CACb,MAAMC,EAAS,KAAK,SAAS,KAAK,EAClC,GAAKA,EACL,OAAO,OAAO,SAASA,CAAM,CACjC,CAME,IAAI,SAASC,EAAU,CACrB,KAAK,UAAU,KAAK,EAChBA,IAAa,QACf,KAAK,KAAK,KAAK,CAAC,MAAOA,EAAS,SAAQ,CAAE,CAAC,CAEjD,CAME,IAAI,UAAW,CACb,MAAMC,EAAW,CAAE,EACnB,UAAWxuB,KAAO,KAAK,KAAM,CAC3B,GAAIA,EAAI,CAAC,IAAM,WAAaA,EAAI,OAAS,EAAG,SAC5C,MAAMyuB,EAAU,gBAAgB,QAAQzuB,CAAG,EACvCyuB,GAASD,EAAS,KAAKC,CAAO,CACxC,CACI,OAAOD,CACX,CAME,WAAWC,EAAS,CAClB,IAAIC,EACJ,GAAID,aAAmB,gBACrBC,EAAeD,MACV,CACL,MAAMzuB,EAAM,CACV,UACAyuB,EAAQ,KACR,OAAOA,EAAQ,OAAU,SAAWA,EAAQ,MAAQ,GACpD,YAAYA,EAAQ,QAAQ,EAC5B,UAAUA,EAAQ,SAAS,CAC5B,EACD,GAAIA,EAAQ,WACV,SAAW,CAAC3qC,EAAK0E,CAAK,IAAK,OAAO,QAAQimC,EAAQ,UAAU,EAC1DzuB,EAAI,KAAK,GAAGlc,CAAG,IAAI0E,CAAK,EAAE,EAG9BkmC,EAAe,IAAI,gBAAgB1uB,CAAG,EACtC0uB,EAAa,MAAQD,EAAQ,KACnC,CACQC,EAAa,OAAS,SACxB,KAAK,IAAIA,EAAa,KAAK,EAClBA,EAAa,OAAS,SAC/B,KAAK,IAAIA,EAAa,KAAK,EAE7B,KAAK,KAAK,KAAKA,EAAa,MAAK,CAAE,CACvC,CAME,cAAclwC,EAAO,CACnB,MAAMgwC,EAAW,KAAK,SACtB,GAAIhwC,EAAQ,GAAKA,GAASgwC,EAAS,OAAQ,OAC3C,IAAIG,EAAe,EACnB,QAAShwC,EAAI,EAAGA,EAAI,KAAK,KAAK,OAAQA,IACpC,GAAI,KAAK,KAAKA,CAAC,EAAE,CAAC,IAAM,UAAW,CACjC,GAAIgwC,IAAiBnwC,EAAO,CAC1B,KAAK,KAAK,OAAOG,EAAG,CAAC,EACrB,KACV,CACQgwC,GACR,CAEA,CACA,EA9JExjB,EADavrB,GACN,OAAO,IACdurB,EAFavrB,GAEN,QAAQ,CAAC,EAAe,GAFlBA,IAgKX,YAAe8sC,GAAa,GAAGA,EAAS,CAAC,IAAIA,EAAS,CAAC,GACvD,UAAakC,GAAe,GAAGA,EAAW,KAAK,IAAIA,EAAW,MAAM,GAGpE,4BAA8B,CAChC,QACA,SACA,UACA,YACA,QACF,EAeA,SAAS,UAAUpY,EAAQqY,EAAUC,EAAM,CACzC,MAAO,CAAC,SAAUtY,EAAO,SAAQ,EAAIqY,EAAUC,CAAI,CACrD,CACA,SAAS,6BAA6B9uB,EAAK,CACzC,MAAMwW,EAAS,OAAO,SAASxW,EAAI,CAAC,CAAC,EACrC,GAAI,OAAO,MAAMwW,CAAM,GAAKA,IAAW,QAAUA,IAAW,MAAQA,GAAU,EAAG,OACjF,MAAMqY,EAAW7uB,EAAI,CAAC,EACtB,GAAI6uB,IAAa,QAAUA,IAAa,GAAI,OAC5C,MAAMC,EAAO9uB,EAAI,CAAC,EAClB,GAAI8uB,IAAS,QACR,4BAA4B,SAASA,CAAI,EAC9C,MAAO,CACL,OAAAtY,EACA,SAAAqY,EACA,KAAAC,CACD,CACH,QAGI,qBAAsBlvC,GAAA,cAAmC,UAAW,CAGtE,YAAY49B,EAAKmL,EAAU,CACzB,MAAMhoC,GAAIgoC,GAAA,YAAAA,EAAU,OAAQ,MAC5B,MAAMnL,EAAKmL,CAAQ,EACnB,KAAK,KAAOhoC,CAChB,CAME,OAAO,KAAKQ,EAAO,CACjB,OAAO,IAAIvB,GAAqBuB,EAAM,IAAKA,CAAK,CACpD,CAIE,IAAI,OAAQ,CACV,OAAO,KAAK,gBAAgB,MAAM,EAAE,IAAK6e,GAAQA,EAAI,CAAC,CAAC,EAAE,OAAQ+uB,GAASA,IAAS,MAAM,CAC7F,CAIE,QAAQA,EAAM,CACZ,KAAK,KAAK,KAAK,CAAC,OAAQA,CAAI,CAAC,CACjC,CAIE,IAAI,SAAU,CACZ,OAAO,KAAK,gBAAgB,QAAQ,EAAE,IAAK/uB,GAAQ,6BAA6BA,CAAG,CAAC,EAAE,OAAQvgB,GAAMA,IAAM,MAAM,CACpH,CAOE,UAAU+2B,EAAQqY,EAAUC,EAAM,CAChC,KAAK,KAAK,KAAK,UAAUtY,EAAQqY,EAAUC,CAAI,CAAC,CACpD,CAKE,IAAI,SAASza,EAAU,CACrB,KAAK,KAAK,KAAK,CAAC,IAAKA,CAAQ,CAAC,CAClC,CAIE,IAAI,WAAY,CACd,OAAO,KAAK,gBAAgB,GAAG,EAAE,IAAKrU,GAAQA,EAAI,CAAC,CAAC,EAAE,OAAQ0M,GAAUA,IAAU,MAAM,CAC5F,CAKE,IAAI,gBAAiB,CACnB,OAAO,KAAK,SAAS,GAAG,CAC5B,CAIE,IAAI,eAAeL,EAAQ,CACzB,KAAK,UAAU,GAAG,EACdA,GAAQ,KAAK,KAAK,KAAK,CAAC,IAAKA,CAAM,CAAC,CAC5C,CAIE,IAAI,SAAU,CACZ,OAAO,KAAK,QAAU,QACtB,KAAK,QAAQ,OAAS,CAC1B,CACA,EA5EElB,EADwBvrB,GACjB,OAAO,OACdurB,EAFwBvrB,GAEjB,QAAQ,CAAC,KAA6B,GAFrBA,OAgFtB,UAAWA,GAAA,cAAwB,QAAS,CAAjC,kCAGburB,EAAA,gBAOA,OAAO,KAAKhqB,EAAO,CACjB,OAAO,IAAIvB,GAAUuB,EAAM,IAAKA,EAAM,SAAQ,CAAE,CACpD,CAME,IAAI,OAAQ,CACV,OAAO,KAAK,SAAS,OAAO,CAChC,CAME,IAAI,MAAMsL,EAAO,CACf,KAAK,UAAU,OAAO,EAClBA,GAAO,KAAK,KAAK,KAAK,CAAC,QAASA,CAAK,CAAC,CAC9C,CAME,IAAI,WAAY,OACd,IAAIuiC,EACJ,OAAI,KAAK,QAAU,KAAK,OAAO,OAAS,IACtCA,GAAYpvC,EAAA,KAAK,OAAO,CAAC,EAAE,QAAf,YAAAA,EAAuB,IAE9BovC,GAAa,KAAK,SAAS,OAAO,CAC7C,CACE,IAAI,QAAS,CACX,OAAI,KAAK,QAAgB,KAAK,SAC9B,KAAK,QAAU,KAAK,KAAK,OAAQhvB,GAAQA,EAAI,CAAC,IAAM,OAAO,EAAE,IAAI,WAAW,EACrE,KAAK,QAChB,CACE,IAAI,OAAOwU,EAAM,CACf,KAAK,QAAUA,EACf,KAAK,KAAO,KAAK,KAAK,OAAQxU,GAAQA,EAAI,CAAC,IAAM,OAAO,EACxD,KAAK,KAAK,KAAK,GAAGwU,EAAK,IAAI,aAAa,CAAC,CAC7C,CACE,IAAI,KAAM,CACR,OAAI,KAAK,QAAU,KAAK,OAAO,OAAS,EAC/B,KAAK,OAAO,CAAC,EAAE,IAEjB,KAAK,SAAS,KAAK,CAC9B,CAME,IAAI,cAAe,CACjB,MAAMxU,EAAM,KAAK,SAAS,cAAc,EACxC,GAAIA,EACF,OAAO,OAAO,SAASA,CAAG,CAGhC,CASE,MAAM,cAAe,SAEnB,GADA,MAAM,aAAc,EAChB,CAAC,KAAK,OACJlgB,GAAAF,EAAA,KAAK,SAAL,YAAAA,EAAc,KAAd,MAAAE,EAAkB,IAAK,CACzB,KAAM,CAACguC,EAAOC,CAAM,EAAI,KAAK,OAAO,CAAC,EAAE,IAAI,MAAM,GAAG,EAC9CkB,EAAanB,GAASC,GAAU,OAAO,SAASD,CAAK,EAAI,OAAO,SAASC,CAAM,EACrE,KAAK,UAAY,KAAK,SAAW,KAClCkB,EAAY,KAAK,KAAO,GAClC,KAAK,KAAO,EACzB,CAEI,OAAO,MAAM,aAAc,CAC/B,CACE,IAAI,UAAW,CACb,MAAMjvB,EAAM,KAAK,SAAS,UAAU,EACpC,GAAIA,EACF,OAAO,OAAO,SAASA,CAAG,CAGhC,CAME,IAAI,SAASkvB,EAAK,CAChB,KAAK,UAAU,UAAU,EACrBA,IAAQ,QACV,KAAK,KAAK,KAAK,CAAC,WAAY,KAAK,MAAMA,CAAG,EAAE,SAAQ,CAAE,CAAC,CAE7D,CACA,EA5GE/jB,EADavrB,GACN,OAAO,IACdurB,EAFavrB,GAEN,QAAQ,CAAC,MAA6B,MAA2B,GAAqB,EAAe,GAF/FA,OAgHX,SAAUA,GAAA,cAAc,UAAW,CAGvC,EAFEurB,EADYvrB,GACL,OAAO,OACdurB,EAFYvrB,GAEL,QAAQ,CAAC,KAAiB,GAFrBA,IAMd,SAAS,UAAUuB,EAAO,CACxB,MAAMguC,EAAmC,IAAI,IAC7C,UAAWC,IAAU,CACnB,SACA,SACA,iBACA,WACA,aACA,QACA,UACA,yBACA,uBACA,oBACA,cACA,QACA,QACJ,EACI,UAAW1jB,KAAQ0jB,EAAO,MACxBD,EAAiB,IAAIzjB,EAAM0jB,CAAM,EAGrC,MAAMC,EAAQF,EAAiB,IAAIhuC,EAAM,IAAI,EAC7C,OAAIkuC,EAAcA,EAAM,KAAKluC,CAAK,EAC3BA,CACT,CAKA,SAAS,iBAAiBssB,EAAc,CACtC,MAAI,qBAAkBA,EAAa,MAAM,GACnC,yBAAyBA,CAAY,EAK7C,CAoBA,SAAS,kBAAkB7B,EAAQ,CACjC,MAAO,CAAC,CAACA,EAAO,GAClB,CACA,SAAS,yBAAyB6B,EAAc,CAC9C,MAAMqf,EAAMrf,EAAa,OAAO,IAChC,MAAO,CAAC,CAACqf,GAAOA,EAAI,SAAWrf,EAAa,eAAe,IAC7D,CA2DA,SAAS,aAAarB,EAAI,CACxB,IAAIkjB,EACJ,GAAIljB,EAAG,MAAM,aAAa,EAAG,CAC3B,KAAM,CAACV,EAAMW,EAAQ2f,CAAU,EAAI5f,EAAG,MAAM,GAAG,EACzCR,EAAS,CACb,QAAS,CAACS,CAAM,EAChB,MAAO,CAAC,OAAO,SAASX,CAAI,CAAC,CAC9B,EACD,OAAIsgB,IACFpgB,EAAO,IAAI,EAAI,CAACogB,CAAU,GAErBpgB,CACX,CACE,GAAIQ,EAAG,MAAM,YAAY,EACvB,GAAI,CAEF,OADAkjB,EAAUC,cAAO,OAAOnjB,CAAE,EAClBkjB,EAAQ,KAAI,CAClB,IAAK,SAAU,CACb,MAAM1jB,EAAS,CAAE,IAAK,CAAC0jB,EAAQ,KAAK,EAAE,CAAG,EACzC,OAAIA,EAAQ,KAAK,SAAQ1jB,EAAO,QAAU,CAAC0jB,EAAQ,KAAK,MAAM,GAC1DA,EAAQ,KAAK,OAAM1jB,EAAO,MAAQ,CAAC0jB,EAAQ,KAAK,IAAI,GACjD1jB,CACjB,CACQ,IAAK,OACH,MAAO,CAAE,IAAK,CAAC0jB,EAAQ,IAAI,CAAG,EAChC,IAAK,QAAS,CACZ,MAAM1jB,EAAS,CACb,QAAS,CAAC0jB,EAAQ,KAAK,MAAM,EAC7B,MAAO,CAACA,EAAQ,KAAK,IAAI,CAC1B,EACD,OAAIA,EAAQ,KAAK,aAAY1jB,EAAO,IAAI,EAAI,CAAC0jB,EAAQ,KAAK,UAAU,GAC7D1jB,CACjB,CACA,CACK,OAAQtqB,EAAG,CACV,QAAQ,MAAM,iBAAkB8qB,EAAI9qB,CAAC,CAC3C,CAEE,MAAO,CAAE,IAAK,CAAC8qB,CAAE,CAAG,CACtB,CACA,SAAS,cAAc5jB,EAAO,CAC5B,OAAOA,EAAM,MAAM,aAAa,IAAM,IACxC,CACA,IAAI,cAAgB,mCAChB,aAAe,0CACnB,SAAS,iBAAiB8tB,EAASkH,EAAK,CACtC,GAAI,CACF,MAAM8R,EAAUC,cAAO,OAAOjZ,CAAO,EACrC,GAAI,CAAC,QAAS,QAAQ,EAAE,SAASgZ,GAAA,YAAAA,EAAS,IAAI,EAAG,CAC/C,MAAM7nC,EAAO6nC,EAAQ,KACrB,GAAI7nC,GAAA,MAAAA,EAAM,OACR,OAAOA,EAAK,OAAO,IAAKtB,GAAM,IAAI,SAASA,EAAGq3B,EAAI,uBAAwBA,CAAG,CAAC,CAEtF,CACG,MAAY,CACf,CACE,MAAO,CAAE,CACX,CAUA,IAAI,YAAc,CAChB,YAAa,GACb,WAAY,cACZ,gBAAiB,GACjB,UAAW,GACX,eAAgB,IAChB,mBAAoB,UACpB,uBAAwB,CAAC,QAAS,QAAS,OAAO,CACpD,EACI,gBAAkB,cAAcgS,MAAAA,YAAc,CA8ChD,YAAYhS,EAAKzR,EAAStb,EAAMswB,EAAO,CACrC,MAAO,EA9CT5V,EAAA,cACAA,EAAA,gBACAA,EAAA,aACAA,EAAA,aACAA,EAAA,wBAAmB,IACnBA,EAAA,sBAAiB,IAIjBA,EAAA,qBACAA,EAAA,iBACAA,EAAA,YACAA,EAAA,cAIAA,EAAA,sBAAiC,IAAI,KAIrCA,EAAA,iBAA4B,IAAI,KAKhCA,EAAA,4BAKAA,EAAA,sCACAA,EAAA,mBAIAA,EAAA,oBAIAA,EAAA,oBACAA,EAAA,kCAA6B,IAI7BA,EAAA,+BAqKAA,EAAA,kBA2HAA,EAAA,oBACAA,EAAA,aAAQ,IA9RN,KAAK,IAAMqS,EACX,KAAK,KAAO,CAAE,GAAG,YAAa,GAAG/sB,GAAQ,CAAA,CAAI,EAC7C,KAAK,KAAO,KAAK,KAAK,MAAQ+sB,EAAI,KAClC,KAAK,QAAU,MAAM,QAAQzR,CAAO,EAAIA,EAAU,CAACA,CAAO,EAC1D,KAAK,MAAQgV,GAAS,KAAK,KAAK,MAChC,KAAK,WAAa,KAAK,OAAM,EAAG,SAAS,EAAE,EAAE,UAAU,CAAC,EACxD,KAAK,MAAQvD,EAAI,MAAM,OAAO,gBAAgB,KAAK,KAAK,OAAS,KAAK,UAAU,GAAG,EAC/E,KAAK,KAAK,SACZ,KAAK,SAAW,KAAK,KAAK,SACjB,KAAK,KAAK,YACnB,KAAK,SAAW,YAAY,cAAc,KAAK,KAAK,UAAW,KAAK,GAAG,GAEzE,KAAK,iBAAmB,KAAK,KAAK,kBAAoB,GACtD,KAAK,eAAiB,KAAK,KAAK,gBAAkB,GAClD,KAAK,YAAc,KAAK,KAAK,aAAe,GAC5C,KAAK,2BAA6B,KAAK,KAAK,4BAA8B,GAC1E,KAAK,uBAAyB,KAAK,KAAK,sBAC5C,CAIE,mBAAoB,OAClB,OAAK,KAAK,aACgB,MAAM,MAAK59B,EAAA,KAAK,eAAL,YAAAA,EAAmB,MAAM,EAAE,OAC7DgrB,GAAQ,CAAC,KAAK,UAAU,IAAI,KAAK,KAAK,SAASA,EAAK,GAAO,EAAK,CAAC,CACnE,EAH8B,CAAE,CAKrC,CAKE,IAAI,QAAS,CACX,OAAO,KAAK,QAAQ,CAAC,CACzB,CACE,IAAI,gBAAiB,OACnB,GAAK,KAAK,YAAa,EACvB,OAAOhrB,EAAA,KAAK,OAAL,YAAAA,EAAW,cACtB,CACE,IAAI,oBAAqB,OACvB,QAAOA,EAAA,KAAK,OAAL,YAAAA,EAAW,qBAAsB,SAC5C,CACE,aAAc,OACZ,QAAOA,EAAA,KAAK,OAAL,YAAAA,EAAW,YAAa,EACnC,CACE,kBAAmB,OACjB,OAAI,KAAK,KAAK,kBAA0B,KACpCA,EAAA,KAAK,OAAL,YAAAA,EAAW,cAAe,aAAsC,IACxC,KAAK,QAAQ,KAAMgR,GAAM,OAAA,OAAAhR,EAAAgR,EAAE,QAAF,YAAAhR,EAAS,KAAMe,GAAM,gBAAgBA,CAAC,GAAE,EAC7D,GAEpC,CACE,mBAAoB,OAClB,QAAOf,EAAA,KAAK,OAAL,YAAAA,EAAW,cAAe,YACrC,CACE,oBAAqB,OACnB,OAAI,KAAK,KAAK,kBAA0B,GAKtC,KAAK,KAAK,aACV,CAAC,GAACA,EAAA,KAAK,IAAI,eAAT,MAAAA,EAAuB,UAEzB,KAAK,KAAK,aAAe,UAE/B,CAWE,MAAM6vC,EAAmB,GAAM,CAC7B,IAAIC,EACJ,MAAMC,EAA+BjhB,GAAW,CAC9C,GAAI+gB,EACF,UAAWtuC,KAASutB,GACd,CAAC,KAAK,+BAAiCvtB,EAAM,WAAa,KAAK,iCACjE,KAAK,8BAAgCA,EAAM,YAE7C,KAAK,cAAcA,EAAO,OAAQ,GAAM,EAAK,MAE1C,CACLuuC,EAAc,CAAE,EAChB,UAAWvuC,KAASutB,EAAQ,EACtB,CAAC,KAAK,+BAAiCvtB,EAAM,WAAa,KAAK,iCACjE,KAAK,8BAAgCA,EAAM,YAE7CA,EAAM,IAAM,KAAK,IACjB,MAAMG,EAAI,KAAK,KAAK,KAAO,UAAUH,CAAK,EAAIA,EAC9C,GAAI,CAACG,EAAG,MACR,GAAIA,aAAa,QAAS,CACxBA,EAAE,KAAMsuC,GAAiB,CACvB,KAAK,UAAU,GAAOA,EAAc,OAAQ,GAAM,EAAK,CACrE,CAAa,EACD,KACZ,CACU,KAAK,eAAe,IAAItuC,EAAE,GAAI,KAAK,KAAK,EACxCouC,EAAY,KAAKpuC,CAAC,CAC5B,CACA,CACK,EACKuuC,EAAiB,IAAM,CACvB,KAAK,qBACP,KAAK,gBAAiB,EACtB,KAAK,iBAAkB,GAEvB,KAAK,KAAK,OAAQ,IAAI,CAEzB,EACD,OAAI,KAAK,oBACPH,EAAc,KAAK,eAAgB,EAC/BA,aAAuB,QACrB,KAAK,sBACPA,EAAY,KAAMhhB,GAAW,CAE3B,GADAihB,EAA4BjhB,CAAM,EAC9B,iBAAiB,IAAI,EAAG,CAC1B,KAAK,KAAK,OAAQ,IAAI,EACtB,MACd,CACYmhB,EAAgB,CAC5B,CAAW,EACM,OAETH,EAAY,KAAMhhB,GAAW,CAC3BihB,EAA4BjhB,CAAM,CAC5C,CAAS,EACDmhB,EAAgB,EACT,OAETF,EAA4BD,CAAW,EACnC,iBAAiB,IAAI,EACvB,KAAK,KAAK,OAAQ,IAAI,EAEtBG,EAAgB,EAEXH,KAETG,EAAgB,EACT,KACX,CAKE,kBAAmB,CACN,KAAK,MAAM,OAAO,cAAc,EAC3C,KAAK,YAAenjB,GAAU,SAC5B,IAAI9sB,EAAA,KAAK,eAAL,MAAAA,EAAmB,IAAI8sB,EAAM,KAAM,OAC1B,8BAA8B,KAAK,IAAK,KAAK,QAAS,KAAK,IAAI,EACnE,IAAIA,EAAM,GAAG,KACpB5sB,EAAA,KAAK,eAAL,MAAAA,EAAmB,IAAI4sB,EAAM,IAAK,KAAK,SACvCA,EAAM,UAAU,KAAM,KAAK,OAAO,EAErC,EACD,KAAK,KAAK,GAAG,gBAAiB,KAAK,WAAW,CAClD,CAEE,MAAO,OACL,KAAK,KAAK,QAAS,IAAI,EACvB,KAAK,aAAe,KAAK,KAAK,IAAI,gBAAiB,KAAK,WAAW,GACnE9sB,EAAA,KAAK,YAAL,MAAAA,EAAA,UACJ,CAIE,kBAAmB,CACjB,OAAO,KAAK,QAAQ,KAAMgR,UAAM,OAAAhR,EAAAgR,EAAE,UAAF,YAAAhR,EAAW,OAAM,CACrD,CACE,gBAAiB,OACf,OAAIA,EAAA,KAAK,IAAI,eAAT,MAAAA,EAAuB,MAClB,KAAK,IAAI,aAAa,MAAM,IAAI,EAElC,CAAE,CACb,CAQE,iBAAkB,CAChB,IAAImsB,EAAU,KAAK,QACnB,GAAI,KAAK,KAAK,mBAAqB,KAAK,8BAA+B,CACrE,MAAM+jB,EAAiB,KAAK,8BAAgC,EAC5D/jB,EAAUA,EAAQ,IAAKH,IAAY,CACjC,GAAGA,EACH,MAAO,KAAK,IAAIA,EAAO,OAAS,EAAGkkB,CAAc,CACzD,EAAQ,CACR,CACI,GAAI,CAAC,KAAK,UAAY,KAAK,SAAS,OAAO,OAAS,EAClD,KAAK,aAAe,8BAA8B,KAAK,IAAK/jB,EAAS,KAAK,IAAI,MACzE,CACL,KAAK,aAA+B,IAAI,IACxC,UAAWW,KAAS,KAAK,SAAS,OAChC,KAAK,aAAa,IAAIA,EAAM,IAAKX,CAAO,CAEhD,CACI,SAAW,CAACsI,EAAU0b,CAAQ,IAAK,KAAK,aACxB,KAAK,KAAK,SAAS1b,EAAU,GAAM,GAAM0b,CAAQ,EACzD,UAAU,KAAMA,CAAQ,CAEpC,CASE,cAAc5uC,EAAOurB,EAAOsjB,EAAY,GAAOC,EAAoB,GAAO,OACxE,MAAM5I,EAAUlmC,EAAM,GAChB+uC,EAAmB,KAAK,eAAe,IAAI7I,CAAO,EACxD,IAAI+E,EAEJ,GADIjrC,aAAiB,WAAUirC,EAAWjrC,GACrC+uC,EAkCE,CACL,MAAMC,EAAqB,KAAK,OAAS,KAAK,eAAe,IAAI9I,CAAO,GAAK,GAE7E,GADA,KAAK,KAAK,YAAalmC,EAAOurB,EAAOyjB,EAAoB,KAAMH,EAAWC,CAAiB,EACvFvjB,EAAO,CACT,MAAMzP,EAAY,mBAAmB,IAAIoqB,CAAO,EAC5CpqB,GAAa,OAAOA,GAAc,UAChC9b,EAAM,MAAQ8b,GAChByP,EAAM,kBAAmB,CAGrC,CACA,KA7C2B,CAIrB,GAHA0f,MAAa,IAAI,SAAS,KAAK,IAAKjrC,CAAK,GACzCirC,EAAS,IAAM,KAAK,IACpBA,EAAS,MAAQ1f,EACb,CAACsjB,GAAa,CAACC,EAAmB,CACpC,GAAI,CAAC,KAAK,gBACJ,CAAC7D,EAAS,QAAS,CACrB,KAAK,MAAM,2CAA4C/E,EAAS3a,GAAA,YAAAA,EAAO,GAAG,EAC1E,MACZ,CAEQ,GAAIA,EACF,IAAIA,GAAA,YAAAA,EAAO,yBAA0B,IACnC,GAAI,CAAC,KAAK,iBAAkB,CAC1B,GAAI,CAAC0f,EAAS,gBAAgB,EAAI,GAAK,CAAC,KAAK,IAAI,qBAAsB,CACrE,KAAK,MAAM,oCAAqCjrC,CAAK,EACrD,MAChB,CACkBurB,GACFA,EAAM,kBAAmB,CAEzC,OAEYA,EAAM,qBAAsB,EAG5B,KAAK,IAAI,cAAgB,CAAC,KAAK,KAAK,iBACtC,KAAK,IAAI,aAAa,SAAS0f,EAAU,KAAK,QAAS1f,CAAK,CAEtE,EACU,CAACujB,GAAqB,KAAK,6BAA+B,MAC5D,KAAK,YAAUrwC,EAAA,KAAK,OAAL,YAAAA,EAAW,OAAQ,GAAOwsC,EAAU1f,EAAOsjB,EAAWC,CAAiB,EACtF,KAAK,eAAe,IAAI5I,EAAS,KAAK,IAAG,CAAE,EAEnD,CAYI,KAAK,oBAAsB,KAAK,IAAK,CACzC,CAIE,UAAU5lB,EAAM3f,EAAK4qB,EAAOsjB,EAAWC,EAAmB,CACxD,MAAMG,EAAU3uB,EAAO,UAAU3f,CAAG,EAAIA,EACpCsuC,aAAmB,QACrBA,EAAQ,KAAM9uC,GAAM,KAAK,UAAU,GAAOA,EAAGorB,EAAOsjB,EAAWC,CAAiB,CAAC,EACxEG,GACT,KAAK,KAAK,QAASA,EAAS1jB,EAAO,KAAMsjB,EAAWC,CAAiB,CAE3E,CACE,eAAevjB,EAAOC,EAAQ,CAC5B,KAAK,KAAK,SAAUD,EAAOC,CAAM,CACrC,CAIE,aAAaD,EAAO,OAClB,KAAK,MAAM,wBAAyBA,EAAM,GAAG,EAC7C,KAAK,UAAU,IAAIA,CAAK,EACxB,IAAI2jB,EAAgB,KAAK,oBAAsB,KAAK,MAAQ,KAAK,oBAAsB,OACvF,MAAMC,EAAkB,KAAK,UAAU,SAAS1wC,EAAA,KAAK,eAAL,YAAAA,EAAmB,MAC7D2wC,EAAc,iBAAiB,IAAI,EACnCC,EAAe7jB,GAAW,OAC9B,KAAK,MAAM,yBAA0BA,EAAQ,KAAK,KAAK,EACnD,MAAK,QACL,KAAK,aAAa,aAAa,KAAK,WAAW,EACnD,KAAK,KAAK,OAAQ,IAAI,EACtB,KAAK,MAAQ,IACT/sB,EAAA,KAAK,OAAL,MAAAA,EAAW,aAAa,KAAK,KAAM,EACxC,EACD,GAAI2wC,GAAeD,EACjBE,EAAY,0BAA0B,UAC7B,KAAK,aAAc,CAC5B,IAAIC,EAAwB,IAC5B,MAAMxS,EAAkB,IAAI,IAAI,KAAK,KAAK,kBAAkB,IAAK93B,GAAMA,EAAE,GAAG,CAAC,EACvEuqC,EAA6B,MAAM,KAAK,KAAK,aAAa,KAAM,CAAA,EAAE,OACrE9lB,GAAQqT,EAAgB,IAAIrT,CAAG,CACjC,EACD,GAAI8lB,EAA2B,SAAW,EAAG,CAC3C,KAAK,MACH,yDACA,MAAM,KAAK,KAAK,aAAa,KAAM,CAAA,EAAE,KAAK,IAAI,CAC/C,EACD,MACR,CACM,MAAMC,EAAqC,KAAK,UAAU,KAAOD,EAA2B,OAO5F,GANA,KAAK,MAAM,2CAA4C,CACrD,MAAO,KAAK,MACZ,mCAAAC,EACA,KAAM,KAAK,UAAU,KACrB,MAAOD,EAA2B,MAC1C,CAAO,EACG,KAAK,UAAU,MAAQ,GAAKC,GAAsC,GAAK,CAEzE,GADAF,EAAwBA,GAAyB,EAAIE,GACjDF,IAA0B,EAAG,CAC/BD,EAAY,oBAAoB,EAChC,MACV,CACY,KAAK,aAAa,aAAa,KAAK,WAAW,EACnD,MAAMI,EAAkB,IAAM,CAC5BP,EAAgB,KAAK,oBAAsB,KAAK,MAAQ,KAAK,oBAAsB,OAC/EA,IAAkB,QAAUA,EAAgB,GAC9C,KAAK,YAAc,WAAWO,EAAiBH,CAAqB,EAEpED,EAAY,sBAAsBC,CAAqB,EAAE,CAE5D,EACD,KAAK,YAAc,WAAWG,EAAiBH,CAAqB,CAC5E,CACA,CACA,CACA,EACI,gBAAmB/kB,GAASA,GAAQ,KAAOA,EAAO,IAGtD,eAAe,QAAQjb,EAAMogC,EAAQnlB,EAAO,EAAkB,SAC5D,GAAI,CAAC,KAAK,IAAK,MAAM,IAAI,MAAM,aAAa,EAC5C,MAAMolB,EAAmB,MAAM,KAAK,IAAI,WACtC,CAAE,MAAO,CAACplB,CAAI,EAAG,QAAS,CAAC,KAAK,MAAM,CAAG,EACzCjb,GAAQ,CAAE,UAAW,EAAK,CAC3B,EACD,GAAIqgC,EAAkB,CACpB,MAAMlT,EAA0B,IAAI,IACpC,OAAAkT,EAAiB,KAAK,QAAS9wB,GAAQ,CACjCA,EAAI,CAAC,IAAM,KAAK4d,EAAQ,IAAI5d,EAAI,CAAC,CAAC,CAC5C,CAAK,EACG6wB,KACF/wC,GAAAF,EAAA,KAAK,MAAL,YAAAA,EAAU,gBAAV,MAAAE,EAAyB,WAAW,MAAM,KAAK89B,CAAO,IAEjD,CAAC,GAAGA,CAAO,EAAE,OAAO,CAAC5sB,EAAKqb,IAAW,CAC1C,MAAM0b,EAAO,IAAI,QAAQ,CAAE,OAAA1b,CAAM,CAAE,EACnC,OAAA0b,EAAK,IAAM,KAAK,IAChB/2B,EAAI,IAAI+2B,CAAI,EACL/2B,CACb,EAAuB,IAAI,GAAK,CAChC,CACE,OAAuB,IAAI,GAC7B,CAGA,IAAI,YAAc,8BAClB,eAAe,YAAYwsB,EAAKjN,EAAUwgB,EAAS,MAAOC,EAAY,GAAI,CACxE,OAAO,MAAMxT,EAAI,YAAY,IAAI,CAC/B,GAAIjN,EACJ,KAAM,SAAY,WAChB,IAAI3wB,EAAA49B,EAAI,eAAJ,MAAA59B,EAAkB,UAAW,CAC/B,MAAM2vB,EAAU,MAAMiO,EAAI,aAAa,UAAUjN,CAAQ,EACzD,GAAIhB,IAAY,UAAW,CACzB,GAAIA,EAAS,CACX,MAAMwY,EAAO,IAAI,QAAQ,CACvB,OAAQxY,EAAQ,OAChB,UAAWA,EAAQ,OACnB,UAAWA,EAAQ,KACjC,CAAa,EACD,OAAAwY,EAAK,IAAMvK,EACJuK,CACnB,CACU,GAAIiJ,EAAU,QAAU,WACtB,OAAO,IAEnB,CACA,CACM,MAAMhuC,EAAQutB,EAAS,MAAM,WAAW,EACxC,GAAI,CAACvtB,EAAO,OAAO,KACnB,KAAM,CAACwI,EAAGnI,EAAO,IAAKgtB,CAAM,EAAIrtB,EAChC,GAAI,CACF,MAAMwG,EAAM,MAAMunC,EAAO,WAAW1gB,CAAM,gCAAgChtB,CAAI,GAAI2tC,CAAS,EACrF,CAAE,MAAAC,EAAO,OAAAvjB,EAAQ,MAAAwjB,CAAK,EAAK,iBAAiB,MAAM1nC,EAAI,MAAM,EAC5D6iB,EAAS4kB,EAAM5tC,EAAK,YAAW,CAAE,EACvC,IAAIksB,EAAU,KACd,OAAIlD,IACFkD,EAAU,CAAE,OAAAlD,EAAQ,OAAQqB,GAAA,YAAAA,EAASrB,GAAS,MAAO6kB,GAAA,YAAAA,EAAQ7kB,EAAS,IAEpEvsB,EAAA09B,GAAA,YAAAA,EAAK,eAAL,MAAA19B,EAAmB,WACrB09B,EAAI,aAAa,UAAUjN,EAAUhB,CAAO,EAEvCA,CACR,OAAQJ,EAAI,CACX,OAAIja,EAAAsoB,GAAA,YAAAA,EAAK,eAAL,MAAAtoB,EAAmB,YACrBsoB,GAAA,MAAAA,EAAK,aAAa,UAAUjN,EAAU,OAExC,QAAQ,MAAM,4BAA6BA,EAAUpB,CAAE,EAChD,IACf,CACA,CACA,CAAG,CACH,CACA,SAAS,iBAAiBnD,EAAM,CAC9B,MAAMpd,EAAS,CACb,MAAO,CAAA,CACR,EACD,SAAW,CAACvL,EAAMgpB,CAAM,IAAK,OAAO,QAAQL,EAAK,KAAK,EAChD,OAAO3oB,GAAS,UAAY,OAAOgpB,GAAW,WAChDzd,EAAO,MAAMvL,EAAK,YAAW,CAAE,EAAIgpB,GAGvC,GAAIL,EAAK,OAAQ,CACfpd,EAAO,OAAS,CAAE,EAClB,SAAW,CAACyd,EAAQqB,CAAM,IAAK,OAAO,QAAQ1B,EAAK,MAAM,EACnD,OAAOK,GAAW,UAAY,MAAM,QAAQqB,CAAM,IACpD9e,EAAO,OAAOyd,CAAM,EAAIqB,EAAO,OAAQhB,GAAU,OAAOA,GAAU,QAAQ,EAGlF,CACE,GAAIV,EAAK,MAAO,CACdpd,EAAO,MAAQ,CAAE,EACjB,SAAW,CAACyd,EAAQ6kB,CAAK,IAAK,OAAO,QAAQllB,EAAK,KAAK,EACjD,OAAOK,GAAW,UAAY,MAAM,QAAQ6kB,CAAK,IACnDtiC,EAAO,MAAMyd,CAAM,EAAI6kB,EAAM,OAAQxkB,GAAU,OAAOA,GAAU,QAAQ,EAGhF,CACE,OAAO9d,CACT,CAGA,SAAS,iBAAiBzN,EAAO,CAC/B,MAAMouB,EAAU,CAAE,EAClB,IAAInC,EACJ,GAAI,CACFA,EAAU,KAAK,MAAMjsB,EAAM,OAAO,CACnC,OAAQmF,EAAO,CACd,MAAM,IAAI,MAAM,kCAAkCA,CAAK,EAAE,CAC7D,CACEipB,EAAQ,WAAapuB,EAAM,WAC3BouB,EAAQ,aAAe,KAAK,UAAUpuB,EAAM,SAAQ,CAAE,EACtD,UAAW2C,KAAO,OAAO,KAAKspB,CAAO,EACnC,OAAQtpB,EAAG,CACT,IAAK,OACHyrB,EAAQ,KAAOnC,EAAQ,KACvB,MACF,IAAK,eACHmC,EAAQ,YAAcnC,EAAQ,aAC9B,MACF,IAAK,QACL,IAAK,UACHmC,EAAQ,QAAUnC,EAAQ,SAAWA,EAAQ,MAC7CmC,EAAQ,MAAQA,EAAQ,QACxB,MACF,IAAK,SACHA,EAAQ,OAASnC,EAAQ,OACzB,MACF,IAAK,MACHmC,EAAQ,IAAMnC,EAAQ,IACtB,MACF,IAAK,QACHmC,EAAQ,MAAQnC,EAAQ,MACxB,MACF,IAAK,QACHmC,EAAQ,MAAQnC,EAAQ,MACxB,MACF,IAAK,QACHmC,EAAQ,MAAQnC,EAAQ,MACxB,MACF,IAAK,QACHmC,EAAQ,MAAQnC,EAAQ,MACxB,MACF,IAAK,UACHmC,EAAQ,QAAUnC,EAAQ,QAC1B,MACF,QACEmC,EAAQzrB,CAAG,EAAIspB,EAAQtpB,CAAG,EAC1B,KACR,CAEE,OAAOyrB,CACT,CACA,SAAS,iBAAiBA,EAAS,CACjC,MAAMnC,EAAU,CAAE,EAClB,SAAW,CAACtpB,EAAKpB,CAAG,IAAK,OAAO,QAAQ6sB,CAAO,EAC7C,OAAQzrB,EAAG,CACT,IAAK,WACL,IAAK,OACHspB,EAAQ,KAAO1qB,EACf,MACF,IAAK,cACH0qB,EAAQ,aAAe1qB,EACvB,MACF,IAAK,QACL,IAAK,UACH0qB,EAAQ,QAAU1qB,EAClB,MACF,IAAK,MACL,IAAK,QACH0qB,EAAQ,MAAQ1qB,EAChB,MACF,QACE0qB,EAAQtpB,CAAG,EAAIpB,EACf,KACR,CAEE,OAAO,KAAK,UAAU0qB,CAAO,CAC/B,CAGA,IAAI,QAAU,MAAM+jB,EAAS,CAQ3B,YAAY1gC,EAAM,CAPlB0a,EAAA,YACAA,EAAA,gBACAA,EAAA,qBACAA,EAAA,cACAA,EAAA,gBACAA,EAAA,iBAAY,CAAE,GACdA,EAAA,iBAAY,CAAE,GAgLdA,EAAA,eAAU,QAAQ,KAAK,IAAI,GAzKzB,GALI1a,EAAK,OAAM,KAAK,MAAQA,EAAK,MAC7BA,EAAK,YAAW,KAAK,QAAUA,EAAK,WACpCA,EAAK,SAAQ,KAAK,QAAUA,EAAK,QACjCA,EAAK,YAAW,KAAK,UAAYA,EAAK,WACtCA,EAAK,YAAW,KAAK,UAAYA,EAAK,WACtCA,EAAK,SACP,GAAI,CACF,MAAM6+B,EAAU8B,cAAO,OAAO3gC,EAAK,QAAQ,EACvC6+B,EAAQ,OAAS,aACnB,KAAK,QAAUA,EAAQ,KAAK,OACxBA,EAAQ,KAAK,QAAUA,EAAQ,KAAK,OAAO,OAAS,GACtD,KAAK,UAAU,KAAK,GAAGA,EAAQ,KAAK,MAAM,EAG/C,OAAQhuC,EAAG,CACV,QAAQ,MAAM,4BAA6BA,CAAC,CACpD,CAEA,CACE,IAAI,MAAO,CACT,GAAI,CAAC,KAAK,MAAO,CACf,GAAI,CAAC,KAAK,QAAS,MAAM,IAAI,MAAM,gBAAgB,EACnD,KAAK,MAAQ8vC,cAAO,WAAW,KAAK,MAAM,CAChD,CACI,OAAO,KAAK,KAChB,CACE,IAAI,UAAW,SACb,MAAM1jB,GAAS5tB,GAAAF,EAAA,KAAK,eAAL,YAAAA,EAAmB,WAAnB,YAAAE,EAA6B,IAAKqG,GAAMA,EAAE,KACzD,OAAOirC,cAAO,eAAe,CAC3B,OAAQ,KAAK,OACb,OAAA1jB,CACN,CAAK,CACL,CACE,IAAI,KAAK2jB,EAAO,CACd,KAAK,MAAQA,CACjB,CAKE,IAAI,QAAS,CACX,GAAI,CAAC,KAAK,QAAS,CACjB,GAAI,CAAC,KAAK,MAAO,MAAM,IAAI,MAAM,cAAc,EAC/C,KAAK,QAAUD,cAAO,OAAO,KAAK,IAAI,EAAE,IAC9C,CACI,OAAO,KAAK,OAChB,CAKE,IAAI,OAAO/kB,EAAQ,CACjB,KAAK,QAAUA,CACnB,CAKE,QAAS,CACP,MAAO,CAAE,KAAM,CAAC,KAAK,MAAM,CAAG,CAClC,CAME,MAAM,WAAW2T,EAAW,CAC1B,GAAI,CAAC,KAAK,IAAK,MAAM,IAAI,MAAM,uBAAuB,EACtD,MAAMsR,EAAqB,MAAOC,GAAY,CAC5C,GAAI,CAACvR,EAAW,OAAOuR,EACvB,IAAItN,EACJ,MAAM9C,EAAiB,IAAI,QAAQ,CAAC31B,EAAGuhB,IAAW,CAChDkX,EAAY,WAAW,IAAMlX,EAAO,IAAI,MAAM,SAAS,CAAC,EAAGiT,CAAS,CAC5E,CAAO,EACD,GAAI,CACF,MAAMpxB,EAAS,MAAM,QAAQ,KAAK,CAAC2iC,EAASpQ,CAAc,CAAC,EAC3D,OAAI8C,GAAW,aAAaA,CAAS,EAC9Br1B,CACR,OAAQtN,EAAG,CACV,GAAIA,aAAa,OAASA,EAAE,UAAY,UACtC,GAAI,CAEF,OADe,MAAMiwC,CAEtB,MAAwB,CACvB,MACZ,CAEQ,MACR,CACK,EACK,CAACC,EAAaC,CAAa,EAAI,MAAM,QAAQ,IAAI,CACrDH,EAAmB,KAAK,cAAc,EACtCA,EAAmB,KAAK,IAAI,WAAW,CAAE,MAAO,CAAC,KAAK,EAAuB,QAAS,CAAC,KAAK,MAAM,CAAC,CAAE,CAAC,CAC5G,CAAK,EACK9nC,EAAsB,IAAI,IAChC,GAAIioC,EAAe,CACjB,MAAMC,EAAW,iBAAiB,KAAKD,CAAa,EAChDC,EAAS,MAAM,OAAS,GAC1BloC,EAAI,IAAI,QAAS,CACf,MAAOkoC,EAAS,MAChB,OAAQA,EAAS,OACjB,KAAMA,EAAS,IACzB,CAAS,CAET,CACI,GAAIF,EAAa,CACf,KAAM,CAAE,MAAApb,EAAO,MAAAC,CAAK,EAAKmb,EACzBhoC,EAAI,IAAI,QAAS,CAAE,MAAA4sB,EAAO,MAAAC,CAAK,CAAE,CACvC,CACI,OAAO7sB,CACX,CAQE,aAAa,UAAUmoC,EAASnU,EAAKoU,EAAY,GAAO,CACtD,GAAI,CAACpU,EAAK,MAAM,IAAI,MAAM,uBAAuB,EACjD,MAAM/sB,EAAO,CAAE,EACXmhC,IAAWnhC,EAAK,MAAQ,YAC5B,MAAM8e,EAAU,MAAM,YAAYiO,EAAKmU,EAASnU,GAAA,YAAAA,EAAK,UAAW/sB,CAAI,EACpE,GAAI8e,EAAS,CACX,MAAMwY,EAAO,IAAIoJ,GAAS,CACxB,OAAQ5hB,EAAQ,OAChB,UAAWA,EAAQ,OACnB,UAAWA,EAAQ,KAC3B,CAAO,EACD,OAAAwY,EAAK,IAAMvK,EACJuK,CACb,CACA,CAOE,MAAM,aAAat3B,EAAMohC,EAAoB,GAAO,CAClD,GAAI,CAAC,KAAK,IAAK,MAAM,IAAI,MAAM,aAAa,EAC5C,IAAIC,EAAmB,KACvB,GAAI,KAAK,IAAI,eAAiB,KAAK,IAAI,aAAa,cAAgB,KAAK,IAAI,aAAa,oBAAqBrhC,GAAA,YAAAA,EAAM,cAAe,aAA+B,CACjK,IAAI8e,EAAU,KAMd,GALI,KAAK,IAAI,aAAa,iBACxBA,EAAU,KAAK,IAAI,aAAa,iBAAiB,KAAK,MAAM,EACnD,KAAK,IAAI,aAAa,eAC/BA,EAAU,MAAM,KAAK,IAAI,aAAa,aAAa,KAAK,MAAM,GAE5DA,EACF,YAAK,QAAUA,EACRA,CAEf,CASI,OARA9e,MAAS,CAAE,GACXA,EAAK,aAALA,EAAK,WAAe,cACpBA,EAAK,cAALA,EAAK,YAAgB,IACrBA,EAAK,YAALA,EAAK,UAAc,IACnBA,EAAK,iBAALA,EAAK,eAAmB,KACnBqhC,IACHA,EAAmB,MAAM,KAAK,IAAI,WAAW,CAAE,MAAO,CAAC,CAAC,EAAG,QAAS,CAAC,KAAK,MAAM,CAAC,EAAIrhC,CAAI,GAEtFqhC,GACL,KAAK,QAAU,iBAAiBA,CAAgB,EAC5CD,GAAqB,KAAK,SAAW,KAAK,IAAI,cAAgB,KAAK,IAAI,aAAa,aACtF,KAAK,IAAI,aAAa,YAAY,KAAK,OAAQ,KAAK,OAAO,EAEtD,KAAK,SALkB,IAMlC,CAcE,MAAM,UAAUphC,EAAMogC,EAAQnlB,EAAO,EAAkB,CACrD,MAAMqmB,EAAW,MAAM,KAAK,QAAQthC,EAAMogC,EAAQnlB,CAAI,EACtD,OAAO,IAAI,IAAI,MAAM,KAAKqmB,CAAQ,EAAE,IAAKnhC,GAAMA,EAAE,MAAM,CAAC,CAC5D,CAME,cAAe,CACb,MAAO,CAAC,IAAK,KAAK,MAAM,CAC5B,CAKE,cAAc81B,EAAQ,CACpB,MAAM1mB,EAAM,CAAC,CAAC,IAAK,KAAK,MAAM,CAAC,EAC/B,OAAK0mB,GACL1mB,EAAI,CAAC,EAAE,KAAK,GAAI0mB,CAAM,EACf1mB,CACX,CAIE,MAAM,SAAU,CACd,GAAI,CAAC,KAAK,IAAK,MAAM,IAAI,MAAM,uBAAuB,EACtD,GAAI,CAAC,KAAK,QAAS,MAAM,IAAI,MAAM,sBAAsB,EACzD,KAAK,IAAI,aAAc,EAKvB,MAJc,IAAI,SAAS,KAAK,IAAK,CACnC,KAAM,EACN,QAAS,iBAAiB,KAAK,OAAO,CAC5C,CAAK,EACW,QAAS,CACzB,CASE,MAAM,OAAOgyB,EAAWC,EAAmBvmB,EAAO,EAAkB,CAClE,GAAI,CAAC,KAAK,IAAK,MAAM,IAAI,MAAM,uBAAuB,EAKtD,GAJA,KAAK,IAAI,aAAc,EAClBumB,IACHA,EAAoB,MAAM,KAAK,QAAQ,OAAQ,OAAQvmB,CAAI,GAEzDumB,EAAkB,IAAID,CAAS,EACjC,MAAO,GAETC,EAAkB,IAAID,CAAS,EAC/B,MAAM7wC,EAAQ,IAAI,SAAS,KAAK,IAAK,CAAE,KAAAuqB,EAAM,EAC7C,UAAWwmB,KAAUD,EACnB9wC,EAAM,IAAI+wC,CAAM,EAElB,aAAM/wC,EAAM,QAAS,EACd,EACX,CASE,MAAM,SAAS4mC,EAAMkK,EAAmBvmB,EAAO,EAAkB,CAC/D,GAAI,CAAC,KAAK,IAAK,MAAM,IAAI,MAAM,uBAAuB,EACtD,KAAK,IAAI,aAAc,EAClBumB,IACHA,EAAoB,MAAM,KAAK,QAAQ,OAAQ,OAAQvmB,CAAI,GAE7D,MAAMymB,EAAoC,IAAI,IAC9C,IAAIC,EAAY,GAChB,UAAWF,KAAUD,EACfC,EAAO,SAAWnK,EAAK,OACzBoK,EAAkB,IAAID,CAAM,EAE5BE,EAAY,GAGhB,GAAI,CAACA,EAAW,MAAO,GACvB,MAAMjxC,EAAQ,IAAI,SAAS,KAAK,IAAK,CAAE,KAAAuqB,EAAM,EAC7C,UAAWwmB,KAAUC,EACnBhxC,EAAM,IAAI+wC,CAAM,EAElB,OAAO,MAAM/wC,EAAM,QAAS,CAChC,CASE,MAAM,cAAcwwC,EAAS,CAC3B,GAAI,CAAC,KAAK,IAAK,MAAM,IAAI,MAAM,uBAAuB,EACtD,MAAMU,EAAiB,MAAM,YAAY,KAAK,IAAKV,CAAO,EAC1D,OAAIU,IAAmB,KAAa,KAC7BA,EAAe,SAAW,KAAK,MAC1C,CACA,EAimBI,YAAc,OACd,aAAe,QACf,aAAe,MAAMC,WAAsB,QAAS,CACtD,YAAY9U,EAAKmL,EAAU,CACzB,MAAMnL,EAAKmL,CAAQ,EACnB,KAAK,OAAL,KAAK,KAAS,MAClB,CACE,OAAO,KAAKyD,EAAU,CACpB,OAAO,IAAIkG,GAAclG,EAAS,IAAKA,EAAS,SAAQ,CAAE,CAC9D,CACE,IAAI,eAAgB,CAClB,OAAO,KAAK,KAAK,OAAQpsB,GAAQA,EAAI,CAAC,IAAM,KAAOA,EAAI,CAAC,IAAM,OAAO,EAAE,OAAQA,GAAQ,CAACA,EAAI,CAAC,GAAKA,EAAI,CAAC,GAAKA,EAAI,CAAC,IAAM,WAAW,EAAE,IAAKA,GAAQ,qBAAqBA,EAAI,CAAC,CAAC,CAAC,EAAE,OAAQ4K,GAAQ,CAAC,CAACA,CAAG,CACxM,CACE,IAAI,cAAc8C,EAAQ,CACxB,UAAWhB,KAASgB,EAClB,KAAK,KAAK,KAAK,CAAC,IAAKhB,EAAO,WAAW,CAAC,CAE9C,CACE,IAAI,gBAAiB,CACnB,OAAO,KAAK,KAAK,OAAQ1M,GAAQA,EAAI,CAAC,IAAM,KAAOA,EAAI,CAAC,IAAM,OAAO,EAAE,OAAQA,GAAQ,CAACA,EAAI,CAAC,GAAKA,EAAI,CAAC,GAAKA,EAAI,CAAC,IAAM,YAAY,EAAE,IAAKA,GAAQ,qBAAqBA,EAAI,CAAC,CAAC,CAAC,EAAE,OAAQ4K,GAAQ,CAAC,CAACA,CAAG,CACzM,CACE,IAAI,eAAe8C,EAAQ,CACzB,UAAWhB,KAASgB,EAClB,KAAK,KAAK,KAAK,CAAC,IAAKhB,EAAO,YAAY,CAAC,CAE/C,CACE,IAAI,eAAgB,CAClB,OAAO,KAAK,KAAK,OAAQ1M,GAAQA,EAAI,CAAC,IAAM,KAAOA,EAAI,CAAC,IAAM,OAAO,EAAE,OAAQA,GAAQ,CAACA,EAAI,CAAC,CAAC,EAAE,IAAKA,GAAQA,EAAI,CAAC,CAAC,CACvH,CACE,IAAI,cAAc0N,EAAQ,CACxB,UAAWhB,KAASgB,EAClB,KAAK,KAAK,KAAK,CAAC,IAAKhB,CAAK,CAAC,CAEjC,CACE,IAAI,QAAS,CACX,OAAO,KAAK,KAAK,OAAQ1M,GAAQA,EAAI,CAAC,IAAM,KAAOA,EAAI,CAAC,IAAM,OAAO,EAAE,IAAKA,GAAQA,EAAI,CAAC,CAAC,CAC9F,CAIE,IAAI,UAAW,CACb,GAAI,CAAC,KAAK,IAAK,MAAM,IAAI,MAAM,kCAAkC,EACjE,OAAO,IAAI,YACT,IAAI,IAAI,KAAK,OAAO,IAAK9Q,GAAM,OAAA,OAAAtP,EAAA,KAAK,MAAL,YAAAA,EAAU,KAAK,SAASsP,GAAE,EAAE,OAAQ/I,GAAM,CAAC,CAACA,CAAC,CAAC,EAC7E,KAAK,GACN,CACL,CACA,EACA,SAAS,mBAAmBq3B,EAAK+U,EAAa,CAC5C,GAAI,CACF,MAAMtd,EAAU,KAAK,MAAMsd,EAAY,OAAO,EACxCC,EAAY,IAAI,aAAahV,CAAG,EAChCiV,EAA6B,IAAI,IACjC9U,EAA8B,IAAI,IACxC,OAAS,CAAC75B,EAAK4uC,CAAM,IAAK,OAAO,QAAQzd,CAAO,EAAG,CACjD,GAAI,CACFnxB,EAAM,kBAAkBA,CAAG,CACnC,MAAc,CACN,QACR,CACM,GAAI,CAAC4uC,EACHD,EAAW,IAAI3uC,CAAG,EAClB65B,EAAY,IAAI75B,CAAG,MACd,CACL,MAAM6uC,EAAcD,EAChBC,EAAY,OAAOhV,EAAY,IAAI75B,CAAG,EACtC6uC,EAAY,MAAMF,EAAW,IAAI3uC,CAAG,CAChD,CACA,CACI,OAAA0uC,EAAU,cAAgB,MAAM,KAAKC,CAAU,EAC/CD,EAAU,eAAiB,MAAM,KAAK7U,CAAW,EAC1C6U,CACX,MAAU,CACV,CAEA,CAyTA,IAAI,oBAAsB,MAAMI,EAAqB,CASnD,YAAYC,EAAkBrV,EAAK,CARnCrS,EAAA,cACAA,EAAA,oBACAA,EAAA,gBAOE,GAAI,OAAO0nB,GAAqB,SAC9B,GAAIA,EAAiB,WAAW,OAAO,EAAG,CACxC,KAAM,CAAE,KAAAxwC,EAAM,KAAAoF,CAAI,EAAKqrC,cAAO,OAAOD,CAAgB,EACrD,GAAIxwC,IAAS,OAAQ,KAAK,YAAcoF,MACnC,OAAM,IAAI,MAAM,+BAA+B,CAC5D,SAAiBorC,EAAiB,SAAW,GACrC,KAAK,YAAc/mC,aAAW+mC,CAAgB,MAE9C,OAAM,IAAI,MAAM,+BAA+B,OAGjD,KAAK,YAAcA,EAErB,KAAK,QAAU,aAAa,KAAK,WAAW,EACxCrV,IAAK,KAAK,MAAQA,EAAI,QAAQ,CAAE,OAAQ,KAAK,QAAS,GAC1D,KAAK,QAAL,KAAK,MAAU,IAAI,QAAQ,CAAE,OAAQ,KAAK,QAAS,EACvD,CAIE,IAAI,YAAa,CACf,GAAI,CAAC,KAAK,YAAa,MAAM,IAAI,MAAM,WAAW,EAClD,OAAOvO,aAAY,KAAK,WAAW,CACvC,CAIE,IAAI,QAAS,CACX,GAAI,CAAC,KAAK,QAAS,MAAM,IAAI,MAAM,WAAW,EAC9C,OAAO,KAAK,OAChB,CAIE,IAAI,MAAO,CACT,GAAI,CAAC,KAAK,YAAa,MAAM,IAAI,MAAM,WAAW,EAClD,OAAO6jB,cAAO,WAAW,KAAK,WAAW,CAC7C,CAIE,IAAI,MAAO,CACT,GAAI,CAAC,KAAK,QAAS,MAAM,IAAI,MAAM,WAAW,EAC9C,OAAOA,cAAO,WAAW,KAAK,OAAO,CACzC,CAIE,OAAO,UAAW,CAChB,MAAMn8B,EAAa,kBAAmB,EACtC,OAAO,IAAIi8B,GAAqBj8B,CAAU,CAC9C,CAIE,MAAM,iBAAkB,CACtB,OAAO,KAAK,KAChB,CAIE,MAAM,MAAO,CACX,OAAO,KAAK,KAChB,CAIE,IAAI,UAAW,CACb,OAAO,KAAK,KAChB,CACE,MAAM,KAAKxV,EAAO,CAChB,GAAI,CAAC,KAAK,YACR,MAAM,MAAM,yCAAyC,EAEvD,OAAO,cAAcA,EAAO,KAAK,WAAW,EAAE,GAClD,CACE,MAAM,kBAAkBwkC,EAAQ,CAC9B,MAAM/hC,EAAU,CAAE,EAClB,OAAI,CAAC+hC,GAAUA,IAAW,UAAS/hC,EAAQ,KAAK,OAAO,GACnD,CAAC+hC,GAAUA,IAAW,UAAS/hC,EAAQ,KAAK,OAAO,EAChDA,CACX,CACE,MAAM,QAAQ0wB,EAAW9rB,EAAOm9B,EAAQ,CACtC,GAAI,CAAC,KAAK,aAAe,CAAC,KAAK,WAC7B,MAAM,MAAM,4CAA4C,EAE1D,MAAMoN,EAAqBze,EAAU,OACrC,GAAIqR,IAAW,QAAS,CACtB,MAAM3T,EAAkBghB,cAAM,GAAG,MAAM,mBAAmB,KAAK,YAAaD,CAAkB,EAC9F,OAAO,MAAMC,cAAM,GAAG,QAAQxqC,EAAOwpB,CAAe,CAC1D,CACI,OAAO,MAAMihB,cAAM,QAAQ,KAAK,YAAaF,EAAoBvqC,CAAK,CAC1E,CACE,MAAM,QAAQu9B,EAAQv9B,EAAOm9B,EAAQ,CACnC,GAAI,CAAC,KAAK,aAAe,CAAC,KAAK,WAC7B,MAAM,MAAM,4CAA4C,EAE1D,MAAMuN,EAAkBnN,EAAO,OAC/B,GAAIJ,IAAW,QAAS,CACtB,MAAM3T,EAAkBghB,cAAM,GAAG,MAAM,mBAAmB,KAAK,YAAaE,CAAe,EAC3F,OAAO,MAAMF,cAAM,GAAG,QAAQxqC,EAAOwpB,CAAe,CAC1D,CACI,OAAO,MAAMihB,cAAM,QAAQ,KAAK,YAAaC,EAAiB1qC,CAAK,CACvE,CAKE,WAAY,CACV,GAAI,CAAC,KAAK,YAAa,MAAM,IAAI,MAAM,2BAA2B,EAClE,MAAM4kB,EAAU,CACd,KAAM,cACN,QAAS,KAAK,UAEf,EACD,OAAO,KAAK,UAAUA,CAAO,CACjC,CAOE,aAAa,YAAY+lB,EAAe3V,EAAK,CAC3C,MAAMpQ,EAAU,KAAK,MAAM+lB,CAAa,EACxC,GAAI/lB,EAAQ,OAAS,cACnB,MAAM,IAAI,MAAM,qDAAqDA,EAAQ,IAAI,EAAE,EAErF,GAAI,CAACA,EAAQ,SAAW,OAAOA,EAAQ,SAAY,SACjD,MAAM,IAAI,MAAM,gDAAgD,EAElE,OAAO,IAAIwlB,GAAqBxlB,EAAQ,QAASoQ,CAAG,CACxD,CACA,EA0SA,SAAS,WAAWQ,EAAM2L,EAAQ,CAChC,OAAAA,MAAWyJ,aAAa,oCAAoC,GACrD,MAAO1mB,GAAU,CACtBid,GAAA,MAAAA,EAAS,SAASjd,EAAM,GAAG,4CAC3BsR,EAAK,YAAYtR,EAAM,GAAG,CAC3B,CACH,CACA,eAAe,YAAYvrB,EAAOurB,EAAOgZ,EAAQiE,EAAQpd,EAASQ,EAAQ,CACxE,GAAI,CACF,MAAM5rB,EAAM,KAAKukC,CAAM,EACvBnZ,EAAQprB,CAAK,CACd,OAAQG,EAAG,CACVqoC,GAAA,MAAAA,EAAS,yCAAyCjd,EAAM,GAAG,GAAIprB,GAC/DyrB,EAAO5rB,CAAK,CAChB,CACA,CACA,SAAS,OAAO,CAAE,IAAAq8B,EAAK,OAAAkI,EAAQ,MAAOiE,CAAQ,EAAG,GAAI,CACnD,OAAAA,MAAWyJ,aAAa,0BAA0B,GAC3C,MAAO1mB,EAAO7L,IAAc,CACjC8oB,GAAA,MAAAA,EAAS,SAASjd,EAAM,GAAG,yCAC3B,MAAMvrB,EAAQ,IAAI,SAASq8B,CAAG,EAC9B,OAAAr8B,EAAM,KAAO,MACbA,EAAM,KAAO,CACX,CAAC,QAASurB,EAAM,GAAG,EACnB,CAAC,YAAa7L,CAAS,CACxB,EACD6kB,MAAWlI,GAAA,YAAAA,EAAK,QACT,IAAI,QAAQ,MAAOjR,EAASQ,IAAW,CACxC2Y,EACF,MAAM,YAAYvkC,EAAOurB,EAAOgZ,EAAQiE,EAAQpd,EAASQ,CAAM,EAE/DyQ,GAAA,MAAAA,EAAK,KAAK,eAAgB,MAAO6V,GAAY,CAC3C,MAAM,YAAYlyC,EAAOurB,EAAO2mB,EAAS1J,EAAQpd,EAASQ,CAAM,CAC1E,EAEA,CAAK,CACF,CACH,CACA,IAAI,qBAAuB,CACzB,WACA,MACF,EAII,eAAiB,MAAMumB,EAAgB,CAYzC,YAAYC,EAAc,IAAK/V,EAAK,CAXpCrS,EAAA,qBACAA,EAAA,uBAAkB,CAAE,GACpBA,EAAA,4BAAuB,IACvBA,EAAA,cACAA,EAAA,oBACAA,EAAA,gBACAA,EAAA,YACAA,EAAA,cAKE,KAAK,MAAQqoB,aAAO,WAAW,EAC/B,KAAK,YAAcD,EACnB,KAAK,IAAM/V,CACf,CACE,IAAI,QAAS,CACX,GAAI,CAAC,KAAK,QAAS,MAAM,IAAI,MAAM,WAAW,EAC9C,OAAO,KAAK,OAChB,CACE,MAAM,iBAAkB,OACtB,MAAM,KAAK,iBAAkB,EAC7B,MAAMnR,EAAS,OAAMzsB,EAAA,OAAO,QAAP,YAAAA,EAAc,gBACnC,GAAI,CAACysB,EACH,MAAM,IAAI,MAAM,sBAAsB,EAExC,KAAK,QAAUA,EACf,IAAI0b,EACJ,OAAI,KAAK,IAAKA,EAAO,KAAK,IAAI,QAAQ,CAAE,OAAA1b,EAAQ,EAC3C0b,EAAO,IAAI,QAAQ,CAAE,OAAA1b,EAAQ,EAClC,KAAK,MAAQ0b,EACNA,CACX,CAKE,MAAM,MAAO,CACX,OAAK,KAAK,eACR,KAAK,aAAe,KAAK,gBAAiB,GAErC,KAAK,YAChB,CACE,IAAI,UAAW,CACb,GAAI,CAAC,KAAK,MAAO,MAAM,IAAI,MAAM,gBAAgB,EACjD,OAAO,KAAK,KAChB,CAOE,MAAM,KAAK5mC,EAAO,OAChB,MAAM,KAAK,iBAAkB,EAC7B,MAAMk2B,EAAc,OAAMz3B,EAAA,OAAO,QAAP,YAAAA,EAAc,UAAUuB,IAClD,GAAI,CAACk2B,EAAa,MAAM,IAAI,MAAM,sBAAsB,EACxD,OAAOA,EAAY,GACvB,CACE,MAAM,OAAOmG,EAAK,SAChB,MAAM,KAAK,iBAAkB,EAC7B,MAAM9P,EAAS,OAAM5tB,GAAAF,EAAA,OAAO,QAAP,YAAAA,EAAc,YAAd,YAAAE,EAAA,KAAAF,KAA+B,CAAE,EAChD6zC,EAAe,CAAE,EACvB,UAAW7oB,KAAO,OAAO,KAAK8C,CAAM,EAC9BA,EAAO9C,CAAG,EAAE,MAAQ8C,EAAO9C,CAAG,EAAE,OAClC6oB,EAAa,KAAK7oB,CAAG,EAGzB,OAAO6oB,EAAa,IAAK7oB,GAAQ,IAAI,SAASA,EAAK4S,GAAA,YAAAA,EAAK,uBAAwBA,CAAG,CAAC,CACxF,CACE,MAAM,kBAAkBkW,EAAK,SAC3B,MAAM9vC,EAAU,CAAE,EAClB,OAAK,CAAC8vC,GAAOA,IAAQ,YAAoB9zC,EAAA,OAAO,QAAP,MAAAA,EAAc,QAAQgE,EAAQ,KAAK,OAAO,GAC9E,CAAC8vC,GAAOA,IAAQ,YAAoB5zC,EAAA,OAAO,QAAP,MAAAA,EAAc,QAAQ8D,EAAQ,KAAK,OAAO,EAC5EA,CACX,CACE,MAAM,QAAQ0wB,EAAW9rB,EAAOkrC,EAAM,QAAS,CAC7C,GAAI,CAAC,MAAM,KAAK,kBAAkBA,CAAG,EACnC,MAAM,IAAI,MAAM,GAAGA,CAAG,yDAAyD,EACjF,MAAM,KAAK,iBAAkB,EAC7B,MAAMX,EAAqBze,EAAU,OACrC,OAAO,KAAK,gBAAgBof,EAAK,UAAWX,EAAoBvqC,CAAK,CACzE,CACE,MAAM,QAAQu9B,EAAQv9B,EAAOkrC,EAAM,QAAS,CAC1C,GAAI,CAAC,MAAM,KAAK,kBAAkBA,CAAG,EACnC,MAAM,IAAI,MAAM,GAAGA,CAAG,yDAAyD,EACjF,MAAM,KAAK,iBAAkB,EAC7B,MAAMR,EAAkBnN,EAAO,OAC/B,OAAO,KAAK,gBAAgB2N,EAAK,UAAWR,EAAiB1qC,CAAK,CACtE,CACE,MAAM,gBAAgBm9B,EAAQnO,EAAQmc,EAAuBnrC,EAAO,CAClE,OAAO,IAAI,QAAQ,CAAC+jB,EAASQ,IAAW,CACtC,KAAK,gBAAgB,KAAK,CACxB,OAAA4Y,EACA,OAAAnO,EACA,sBAAAmc,EACA,MAAAnrC,EACA,QAAA+jB,EACA,OAAAQ,CACR,CAAO,EACI,KAAK,sBACR,KAAK,uBAAwB,CAErC,CAAK,CACL,CACE,MAAM,uBAAuBpa,EAAMihC,EAAU,EAAG,SAC9C,GAAI,CAACjhC,GAAQ,KAAK,gBAAgB,SAAW,EAAG,CAC9C,KAAK,qBAAuB,GAC5B,MACN,CACI,KAAK,qBAAuB,GAC5B,MAAMkhC,EAAclhC,GAAQ,KAAK,gBAAgB,MAAO,EACxD,GAAI,CAACkhC,EAAa,CAChB,KAAK,qBAAuB,GAC5B,MACN,CACI,KAAM,CAAE,OAAAlO,EAAQ,OAAAnO,EAAQ,sBAAAmc,EAAuB,MAAAnrC,EAAO,QAAA+jB,EAAS,OAAAQ,CAAM,EAAK8mB,EAC1E,KAAK,MAAM,mCAAoC,CAC7C,OAAArc,EACA,sBAAAmc,EACA,MAAAnrC,CACN,CAAK,EACD,GAAI,CACF,MAAMoG,EAAS,OAAM9O,GAAAF,EAAA,OAAO,QAAP,YAAAA,EAAe+lC,KAAf,YAAA7lC,EAAyB03B,GAAQmc,EAAuBnrC,IAC7E,GAAI,CAACoG,EAAQ,MAAM,IAAI,MAAM,2BAA2B,EACxD2d,EAAQ3d,CAAM,CACf,OAAQtI,EAAO,CACd,MAAMwtC,EAAextC,aAAiB,MAAQA,EAAM,QAAU,OAAOA,CAAK,EAC1E,GAAIwtC,EAAa,SAAS,wBAAwB,GAAKF,EAAU,EAAG,CAClE,KAAK,MAAM,iCAAkC,CAC3C,OAAApc,EACA,sBAAAmc,EACA,MAAAnrC,EACA,QAAAorC,CACV,CAAS,EACD,WAAW,IAAM,CACf,KAAK,uBAAuBC,EAAaD,EAAU,CAAC,CAC9D,EAAW,GAAKA,CAAO,EACf,MACR,CACM7mB,EAAOzmB,aAAiB,MAAQA,EAAQ,IAAI,MAAMwtC,CAAY,CAAC,CACrE,CACI,KAAK,uBAAwB,CACjC,CACE,kBAAmB,CACjB,OAAO,IAAI,QAAQ,CAACvnB,EAASQ,IAAW,CACtC,GAAI,OAAO,MAAO,CAChBR,EAAS,EACT,MACR,CACM,IAAIwnB,EACJ,MAAMC,EAAa,YAAY,IAAM,CAC/B,OAAO,QACT,aAAaD,CAAO,EACpB,cAAcC,CAAU,EACxBznB,EAAS,EAEZ,EAAE,GAAG,EACNwnB,EAAU,WAAW,IAAM,CACzB,cAAcC,CAAU,EACxBjnB,EAAO,IAAI,MAAM,gCAAgC,CAAC,CAC1D,EAAS,KAAK,WAAW,CACzB,CAAK,CACL,CAME,WAAY,CAMV,OAAO,KAAK,UALI,CACd,KAAM,QACN,QAAS,EAEV,CAC4B,CACjC,CAQE,aAAa,YAAYomB,EAAe3V,EAAK,CAC3C,MAAMpQ,EAAU,KAAK,MAAM+lB,CAAa,EACxC,GAAI/lB,EAAQ,OAAS,QACnB,MAAM,IAAI,MAAM,+CAA+CA,EAAQ,IAAI,EAAE,EAE/E,OAAO,IAAIkmB,GAAgB,OAAQ9V,CAAG,CAC1C,CACA,EAOI,YAAc,cAAcyW,MAAAA,YAAc,CAO5C,YAAYzW,EAAKkI,EAAQiE,EAAQjG,EAAW,CAC1C,MAAO,EAPTvY,EAAA,YACAA,EAAA,eACAA,EAAA,iBACAA,EAAA,cACAA,EAAA,sBAAiB,SACjBA,EAAA,aAGE,QAAK,IAAMqS,EACX,KAAK,OAASkI,EACVhC,EAAW,CACb,KAAK,KAAO,IAAI,QAAQA,EAAW,CAAA,EAAIlG,EAAK,CAC1C,MAAOmM,EAAO,OAAO,UAAU,EAC/B,KAAM,WACd,CAAO,EACD,KAAK,SAAW,IAAI,YAA4B,IAAI,IAAOnM,EAAK,KAAK,IAAI,EACzE,UAAW5S,KAAO8Y,EAAW,CAC3B,MAAMhX,EAAQ,KAAK,KAAK,SAAS9B,EAAK,GAAO,EAAK,EAClD8B,EAAM,WAAa,qBAAqB,OAAO,CAAE,IAAA8Q,EAAK,OAAAkI,EAAQ,MAAOiE,EAAQ,EAC7E,KAAK,SAAS,SAASjd,CAAK,EAC5BA,EAAM,QAAS,CACvB,CACA,CACI,KAAK,MAAQid,EAAO,OAAO,KAAK,CACpC,CAIE,UAAU/d,EAAQ,CAChB,MAAMgB,EAAM,KAAK,IAAI,UACnBhB,EACA,CACE,YAAa,GACb,UAAW,GACX,WAAY,aACZ,KAAM,KAAK,KACX,SAAU,KAAK,QAChB,EACD,EACD,EACD,OAAAgB,EAAI,GAAG,QAAS,MAAOzrB,GAAU,CAC/B,GAAI,CACF,MAAM+yC,EAAc,MAAM,KAAK,WAAW/yC,CAAK,EAC3C+yC,EAAY,OACd,KAAK,KAAK,UAAWA,CAAW,EAEhC,KAAK,KAAK,YAAYA,EAAY,EAAE,GAAIA,CAAW,CAEtD,OAAQ5yC,EAAG,CACV,KAAK,MAAM,sBAAuBA,EAAGH,EAAM,SAAQ,CAAE,CAC7D,CACA,CAAK,EACM,IAAI,QAASorB,GAAY,CAC9BK,EAAI,GAAG,OAAQ,IAAM,CACnB,KAAK,MAAM,OAAO,EAClBL,EAAQK,CAAG,CACnB,CAAO,EACDA,EAAI,MAAO,CACjB,CAAK,CACL,CACE,MAAM,WAAWzrB,EAAO,CAClB,KAAK,iBAAmB,SAAWA,EAAM,QAAQ,SAAS,MAAM,EAClE,KAAK,eAAiB,QACb,KAAK,iBAAmB,SAAW,CAACA,EAAM,QAAQ,SAAS,MAAM,IAC1E,KAAK,eAAiB,SAExB,MAAMgzC,EAAa,KAAK,IAAI,QAAQ,CAAE,OAAQhzC,EAAM,OAAQ,EAC5DgzC,EAAW,IAAM,KAAK,IACtB,IAAI5H,EACJ,GAAI,CACFA,EAAmB,MAAM,KAAK,OAAO,QAAQ4H,EAAYhzC,EAAM,QAAS,KAAK,cAAc,CAC5F,MAAY,CACX,MAAMizC,EAAsB,KAAK,iBAAmB,QAAU,QAAU,QACxE7H,EAAmB,MAAM,KAAK,OAAO,QAAQ4H,EAAYhzC,EAAM,QAASizC,CAAmB,EAC3F,KAAK,eAAiBA,CAC5B,CACI,MAAMC,EAAgB,KAAK,MAAM9H,CAAgB,EAC3C,CAAE,GAAAngB,EAAI,OAAAoL,EAAQ,OAAAtT,EAAQ,OAAAtV,EAAQ,MAAAtI,CAAK,EAAK+tC,EAC9C,OAAI7c,EACK,CAAE,GAAApL,EAAI,OAAQjrB,EAAM,OAAQ,OAAAq2B,EAAQ,OAAAtT,EAAQ,MAAA/iB,CAAO,EAErD,CAAE,GAAAirB,EAAI,OAAAxd,EAAQ,MAAAtI,EAAO,MAAAnF,CAAO,CACvC,CACE,MAAM,aAAairB,EAAIkoB,EAAc1lC,EAAQ8c,EAAO,MAA0BplB,EAAO,CACnF,MAAMkD,EAAM,CAAE,GAAA4iB,EAAI,OAAAxd,CAAQ,EACtBtI,IACFkD,EAAI,MAAQlD,GAEd,MAAMiuC,EAAY,MAAM,KAAK,OAAO,KAAM,EACpCJ,EAAa,KAAK,IAAI,QAAQ,CAAE,OAAQG,EAAc,EACtDnzC,EAAQ,IAAI,SAAS,KAAK,IAAK,CACnC,KAAAuqB,EACA,QAAS,KAAK,UAAUliB,CAAG,EAC3B,KAAM,CAAC,CAAC,IAAK8qC,CAAY,CAAC,EAC1B,OAAQC,EAAU,MACxB,CAAK,EACDpzC,EAAM,QAAU,MAAM,KAAK,OAAO,QAAQgzC,EAAYhzC,EAAM,QAAS,KAAK,cAAc,EACxF,MAAMA,EAAM,KAAK,KAAK,MAAM,EAC5B,MAAMA,EAAM,QAAQ,KAAK,QAAQ,CACrC,CASE,MAAM,YAAYmzC,EAAc9c,EAAQtT,EAAS,CAAA,EAAIwH,EAAO,MAAO8oB,EAAI,CACrE,MAAMpoB,EAAK,KAAK,OAAQ,EAAC,SAAS,EAAE,EAAE,UAAU,CAAC,EAC3CmoB,EAAY,MAAM,KAAK,OAAO,KAAM,EACpCJ,EAAa,KAAK,IAAI,QAAQ,CAAE,OAAQG,EAAc,EACtDG,EAAU,CAAE,GAAAroB,EAAI,OAAAoL,EAAQ,OAAAtT,CAAQ,EAChCqtB,EAAU,IAAI,QAAQ,IAAM,CAChC,MAAMmD,EAAmBC,GAAa,CAChCA,EAAS,SAAW,YACtB,KAAK,KAAK,YAAYvoB,CAAE,GAAIsoB,CAAe,EAC3C,KAAK,KAAK,UAAWC,EAAS,KAAK,GAC1BH,GACTA,EAAGG,CAAQ,CAEd,EACD,KAAK,KAAK,YAAYvoB,CAAE,GAAIsoB,CAAe,CACjD,CAAK,EACKvzC,EAAQ,IAAI,SAAS,KAAK,IAAK,CACnC,KAAAuqB,EACA,QAAS,KAAK,UAAU+oB,CAAO,EAC/B,KAAM,CAAC,CAAC,IAAKH,CAAY,CAAC,EAC1B,OAAQC,EAAU,MACxB,CAAK,EACD,OAAApzC,EAAM,QAAU,MAAM,KAAK,OAAO,QAAQgzC,EAAYhzC,EAAM,QAAS,KAAK,cAAc,EACxF,MAAMA,EAAM,KAAK,KAAK,MAAM,EAC5B,MAAMA,EAAM,QAAQ,KAAK,QAAQ,EAC1BowC,CACX,CACA,EAkRI,eAAiC,IAAI,IACzC,eAAe,IAAI,cAAe,mBAAmB,EACrD,eAAe,IAAI,QAAS,cAAc,EAC1C,eAAe,IAAI,QAAS,cAAc,EAC1C,eAAe,qBAAqB4B,EAAe3V,EAAK,CACtD,IAAIoX,EACJ,GAAI,CACFA,EAAS,KAAK,MAAMzB,CAAa,CAClC,OAAQ7xC,EAAG,CACV,MAAM,IAAI,MAAM,mCAAmCA,aAAa,MAAQA,EAAE,QAAU,OAAOA,CAAC,CAAC,EAAE,CACnG,CACE,MAAMuzC,EAAc,eAAe,IAAID,EAAO,IAAI,EAClD,GAAI,CAACC,EACH,MAAM,IAAI,MAAM,wBAAwBD,EAAO,IAAI,EAAE,EAEvD,GAAI,CACF,OAAO,MAAMC,EAAY,YAAY1B,EAAe3V,CAAG,CACxD,OAAQl8B,EAAG,CACV,MAAMwzC,EAAWxzC,aAAa,MAAQA,EAAE,QAAU,OAAOA,CAAC,EAC1D,MAAM,IAAI,MAAM,qCAAqCszC,EAAO,IAAI,KAAKE,CAAQ,EAAE,CACnF,CACA,CAGA,IAAI,eAAiB,MAAMC,WAAwBC,kBAAc,CA8B/D,YAAYxX,EAAKyX,EAAuBC,EAAa,CACnD,MAAO,EA9BT/pB,EAAA,YACAA,EAAA,cAIAA,EAAA,qBAIAA,EAAA,mBAQAA,EAAA,eACAA,EAAA,oBACAA,EAAA,cACAA,EAAA,YACAA,EAAA,cACAA,EAAA,kBACAA,EAAA,qBAQE,KAAK,IAAMqS,EACX,KAAK,MAAQA,EAAI,MAAM,OAAO,cAAc,EACxCyX,EAAsB,WAAW,WAAW,EAC9C,KAAK,oBAAoBA,CAAqB,EAE9C,KAAK,UAAUA,CAAqB,EAEjCC,EAGH,KAAK,YAAcA,EAFnB,KAAK,YAAc,oBAAoB,SAAU,EAInD,KAAK,IAAM,IAAI,YAAY,KAAK,IAAK,KAAK,YAAa,KAAK,MAAO,KAAK,SAAS,CACrF,CAlCE,IAAI,QAAS,CACX,GAAI,CAAC,KAAK,WAAY,MAAM,IAAI,MAAM,WAAW,EACjD,OAAO,KAAK,UAChB,CAgCE,oBAAoBC,EAAiB,CACnC,MAAMC,EAAY,IAAI,IAAID,CAAe,EACnCE,EAAeD,EAAU,UAAYA,EAAU,SAAS,QAAQ,QAAS,EAAE,EAC3EE,EAAaF,EAAU,aAAa,IAAI,QAAQ,EAChD1R,EAAY0R,EAAU,aAAa,OAAO,OAAO,EACjDvf,EAASuf,EAAU,aAAa,IAAI,QAAQ,EAClD,KAAK,aAAeC,EACpB,KAAK,WAAaC,EAClB,KAAK,UAAY5R,EACjB,KAAK,OAAS7N,CAClB,CACE,UAAUrF,EAAO,CACf,KAAK,MAAQA,CACjB,CAIE,MAAM,gBAAiB,CACrB,GAAI,KAAK,aAAc,OACvB,MAAM+jB,EAAY,MAAM,KAAK,YAAY,KAAM,EAC/C,GAAI,CAACA,EAAW,MAAM,IAAI,MAAM,wBAAwB,EACxD,KAAK,aAAe,MAAM,KAAK,IAAI,UAAU,CAC3C,MAAO,CAAC,KAAyB,EACjC,KAAM,CAACA,EAAU,MAAM,CAC7B,CAAK,CACL,CAIE,MAAM,MAAO,CACX,OAAI,KAAK,MAAc,KAAK,MACrB,KAAK,gBAAiB,CACjC,CACE,IAAI,UAAW,CACb,GAAI,CAAC,KAAK,MAAO,MAAM,IAAI,MAAM,qCAAqC,EACtE,OAAO,KAAK,KAChB,CACE,MAAM,iBAAkB,CACtB,GAAI,KAAK,OAAS,CAAC,KAAK,WAAY,CAClC,MAAMxM,EAAO,MAAM,QAAQ,UAAU,KAAK,MAAO,KAAK,GAAG,EACrDA,IACF,KAAK,MAAQA,EACb,KAAK,WAAaA,EAAK,OACvB,KAAK,UAAYA,EAAK,UACtB,KAAK,IAAM,IAAI,YAAY,KAAK,IAAK,KAAK,YAAa,KAAK,MAAO,KAAK,SAAS,EAEzF,CACI,GAAI,CAAC,KAAK,cAAgB,KAAK,WAC7B,KAAK,aAAe,KAAK,mBAChB,CAAC,KAAK,aACf,MAAM,IAAI,MAAM,uBAAuB,EAEzC,aAAM,KAAK,eAAgB,EAC3B,KAAK,IAAI,GAAG,UAAW,IAAIiG,IAAU,CACnC,KAAK,KAAK,UAAW,GAAGA,CAAK,CACnC,CAAK,EACM,IAAI,QAAQ,CAACzhB,EAASQ,IAAW,CACtC,MAAMwoB,EAAgB,CAAC,KAAK,YAAc,EAAE,EAE5C,GADI,KAAK,QAAQA,EAAc,KAAK,KAAK,MAAM,EAC3C,CAAC,KAAK,aAAc,MAAM,IAAI,MAAM,uBAAuB,EAC/D,KAAK,IAAI,YAAY,KAAK,aAAc,UAAWA,EAAe,MAAQZ,GAAa,CACjFA,EAAS,SAAW,MACtB,KAAK,aAAY,EAAG,KAAMtoB,GAAW,CACnC,KAAK,WAAaA,EAClB,KAAK,MAAQ,KAAK,IAAI,QAAQ,CAAE,OAAAA,EAAQ,EACxCE,EAAQ,KAAK,KAAK,CAC9B,CAAW,EAEDQ,EAAO4nB,EAAS,KAAK,CAE/B,CAAO,CACP,CAAK,CACL,CACE,MAAM,cAAe,CACnB,OAAI,KAAK,WAAmB,KAAK,WAC1B,IAAI,QAAQ,CAACpoB,EAASipB,IAAY,CACvC,GAAI,CAAC,KAAK,aAAc,MAAM,IAAI,MAAM,uBAAuB,EAC/D,KAAK,IAAI,YAAY,KAAK,aAAc,iBAAkB,CAAE,EAAE,MAAQb,GAAa,CACjFpoB,EAAQooB,EAAS,MAAM,CAC/B,CAAO,CACP,CAAK,CACL,CACE,MAAM,kBAAkBhP,EAAQ,CAC9B,OAAIA,EAAe,CAACA,CAAM,EACnB,QAAQ,QAAQ,CAAC,QAAS,OAAO,CAAC,CAC7C,CACE,MAAM,QAAQrR,EAAW9rB,EAAOm9B,EAAS,QAAS,CAChD,OAAO,KAAK,WAAWrR,EAAW9rB,EAAOm9B,EAAQ,SAAS,CAC9D,CACE,MAAM,QAAQI,EAAQv9B,EAAOm9B,EAAS,QAAS,CAC7C,OAAO,KAAK,WAAWI,EAAQv9B,EAAOm9B,EAAQ,SAAS,CAC3D,CACE,MAAM,WAAW8P,EAAMjtC,EAAOm9B,EAAQnO,EAAQ,CAiB5C,OAhBgB,IAAI,QAAQ,CAACjL,EAASQ,IAAW,CAC/C,GAAI,CAAC,KAAK,aAAc,MAAM,IAAI,MAAM,uBAAuB,EAC/D,KAAK,IAAI,YACP,KAAK,aACL,GAAG4Y,CAAM,IAAInO,CAAM,GACnB,CAACie,EAAK,OAAQjtC,CAAK,EACnB,MACCmsC,GAAa,CACPA,EAAS,MAGZ5nB,EAAO4nB,EAAS,KAAK,EAFrBpoB,EAAQooB,EAAS,MAAM,CAInC,CACO,CACP,CAAK,CAEL,CACE,MAAM,KAAKxzC,EAAO,CAkBhB,OAjBgB,IAAI,QAAQ,CAACorB,EAASQ,IAAW,CAC/C,GAAI,CAAC,KAAK,aAAc,MAAM,IAAI,MAAM,uBAAuB,EAC/D,KAAK,IAAI,YACP,KAAK,aACL,aACA,CAAC,KAAK,UAAU5rB,CAAK,CAAC,EACtB,MACCwzC,GAAa,CACZ,GAAKA,EAAS,MAIZ5nB,EAAO4nB,EAAS,KAAK,MAJF,CACnB,MAAM3oB,EAAO,KAAK,MAAM2oB,EAAS,MAAM,EACvCpoB,EAAQP,EAAK,GAAG,CAC5B,CAGA,CACO,CACP,CAAK,CAEL,CAQE,MAAM,cAAcwJ,EAAUnF,EAAQqlB,EAAO,CAC3C,MAAM,KAAK,eAAgB,EAC3B,MAAMlnB,EAAM,CAAE,EACd,OAAIgH,GAAUhH,EAAI,KAAKgH,CAAQ,EAC3BnF,GAAQ7B,EAAI,KAAK6B,CAAM,EACvBqlB,GAAOlnB,EAAI,KAAKknB,CAAK,EAClB,IAAI,QAAQ,CAACnpB,EAASQ,IAAW,CACtC,GAAI,CAAC,KAAK,aAAc,MAAM,IAAI,MAAM,uBAAuB,EAC/D,KAAK,IAAI,YACP,KAAK,aACL,iBACAyB,EACA,MACCmmB,GAAa,CACZ,GAAKA,EAAS,MAIZ5nB,EAAO4nB,EAAS,KAAK,MAJF,CACnB,MAAMtoB,EAASsoB,EAAS,OACxBpoB,EAAQF,CAAM,CAC1B,CAGA,CACO,CACP,CAAK,CACL,CAKE,WAAY,CACV,GAAI,CAAC,KAAK,cAAgB,CAAC,KAAK,WAC9B,MAAM,IAAI,MAAM,0DAA0D,EAE5E,MAAMe,EAAU,CACd,KAAM,QACN,QAAS,CACP,aAAc,KAAK,aACnB,WAAY,KAAK,WACjB,UAAW,KAAK,UAChB,OAAQ,KAAK,OACb,mBAAoB,KAAK,YAAY,UAAW,EAEhD,MAAO,KAAK,OAAS,IAC7B,CACK,EACD,OAAO,KAAK,UAAUA,CAAO,CACjC,CAOE,aAAa,YAAY+lB,EAAe3V,EAAK,CAC3C,GAAI,CAACA,EACH,MAAM,IAAI,MAAM,uDAAuD,EAEzE,MAAMoX,EAAS,KAAK,MAAMzB,CAAa,EACvC,GAAIyB,EAAO,OAAS,QAClB,MAAM,IAAI,MAAM,+CAA+CA,EAAO,IAAI,EAAE,EAE9E,MAAMxnB,EAAUwnB,EAAO,QACvB,GAAI,CAACxnB,GAAW,OAAOA,GAAY,UAAY,CAACA,EAAQ,mBACtD,MAAM,IAAI,MAAM,0CAA0C,EAE5D,MAAM8nB,EAAc,MAAM,qBAAqB9nB,EAAQ,mBAAoBoQ,CAAG,EAC9E,GAAI,CAAC0X,EACH,MAAM,IAAI,MAAM,+CAA+C,EAEjE,IAAIxP,EACJ,OAAItY,EAAQ,OACVsY,EAAS,IAAIqP,GAAgBvX,EAAKpQ,EAAQ,MAAO8nB,CAAW,EAC5DxP,EAAO,WAAatY,EAAQ,WAC5BsY,EAAO,aAAetY,EAAQ,aAC9BsY,EAAO,UAAYtY,EAAQ,UAC3BsY,EAAO,OAAStY,EAAQ,SAExBsY,EAAS,IAAIqP,GAAgBvX,EAAKpQ,EAAQ,WAAY8nB,CAAW,EACjExP,EAAO,aAAetY,EAAQ,aAC9BsY,EAAO,UAAYtY,EAAQ,UAC3BsY,EAAO,OAAStY,EAAQ,QAEnBsY,CACX,CACA,EAyFA,SAAS,MAAMiQ,EAAQvV,EAAQ,CAC7B,OAAIuV,EAAO,WAAavV,EAAO,WACtBuV,EAEFvV,CACT,CAOA,eAAe,oBAAoB/T,EAAQmR,EAAK,CAE9C,OADa,MAAM,qBAAqB,CAACnR,CAAM,EAAGmR,CAAG,GACzC,IAAInR,CAAM,CACxB,CACA,eAAe,qBAAqBuR,EAASJ,EAAKoU,EAAY,GAAOrkB,EAAU,IAAK,OAClF,MAAMyQ,EAAOR,EAAI,YAAcA,EAAI,KAC7B5P,EAAsB,IAAI,IAChC,UAAWlB,KAASsR,EAAK,OAAO,OAAM,EAAIpQ,EAAI,IAAIlB,CAAK,EACvD,MAAMkpB,EAA6B,IAAI,IACjCC,EAAkC,IAAI,IACtCpN,EAAW,IAAI,YAAY7a,EAAK4P,CAAG,EACzC,IAAI59B,EAAA49B,EAAI,eAAJ,MAAA59B,EAAkB,SAAW,CAACgyC,EAAW,CAC3C,MAAMkE,EAAa,MAAMtY,EAAI,YAC3B,CAAE,MAAO,CAAC,EAAG,KAAK,EAAG,QAAS,MAAM,KAAK,IAAI,IAAII,CAAO,CAAC,CAAG,EAC5D,CAAE,WAAY,aAA+B,MAAO,sBAAsB,CAC3E,EACD,UAAW4U,KAAasD,EAClBtD,EAAU,OAAS,OAAOoD,EAAW,IAAIpD,EAAU,OAAQ,aAAa,KAAKA,CAAS,CAAC,EAE7F,UAAWA,KAAasD,EACtB,GAAItD,EAAU,OAAS,EAAG,CACxB,GAAIoD,EAAW,IAAIpD,EAAU,MAAM,EAAG,SACtC,MAAMuD,EAAO,mBAAmBvY,EAAKgV,CAAS,EAC1CuD,GAAMF,EAAgB,IAAIrD,EAAU,OAAQuD,CAAI,CAC5D,CAEInY,EAAUA,EAAQ,OAAQvR,GAAW,CAACupB,EAAW,IAAIvpB,CAAM,GAAK,CAACwpB,EAAgB,IAAIxpB,CAAM,CAAC,CAChG,CACE,GAAIuR,EAAQ,SAAW,EAAG,OAAOgY,EACjC,MAAMI,EAAkC,IAAI,IACtCC,EAAoC,IAAI,IAC9C,OAAO,IAAI,QAAS1pB,GAAY,EACH,SAAY,CACrC,MAAM2pB,EAAgB,CACpB,YAAa,GACb,KAAAlY,EACA,UAAW,GACX,MAAO,uBACP,kBAAmB,GACnB,SAAAyK,CACD,EACGA,IAAUyN,EAAc,SAAWzN,GACvCjL,EAAI,UAAU,CAAE,MAAO,CAAC,EAAG,KAAK,EAAG,QAASI,CAAS,EAAEsY,EAAe,CACpE,QAAU/0C,GAAU,CAClB,GAAIA,EAAM,OAAS,MAAuB,CACxC,MAAMg1C,EAAgBH,EAAgB,IAAI70C,EAAM,MAAM,EACtD,GAAIg1C,GAAiBA,EAAc,WAAah1C,EAAM,WAAY,OAClE60C,EAAgB,IAAI70C,EAAM,OAAQA,CAAK,CACnD,SAAqBA,EAAM,OAAS,EAAkB,CAC1C,MAAMg1C,EAAgBF,EAAkB,IAAI90C,EAAM,MAAM,EACxD,GAAIg1C,GAAiBA,EAAc,WAAah1C,EAAM,WAAY,OAClE80C,EAAkB,IAAI90C,EAAM,OAAQA,CAAK,CACrD,CACS,EACD,OAAQ,IAAM,CACZ,UAAWA,KAAS60C,EAAgB,SAClCJ,EAAW,IAAIz0C,EAAM,OAAQ,aAAa,KAAKA,CAAK,CAAC,EAEvD,UAAWkrB,KAAUuR,EAAS,CAC5B,GAAIgY,EAAW,IAAIvpB,CAAM,EAAG,SAC5B,MAAMkmB,EAAc0D,EAAkB,IAAI5pB,CAAM,EAChD,GAAI,CAACkmB,EAAa,SAClB,MAAMwD,EAAO,mBAAmBvY,EAAK+U,CAAW,EAC5CwD,GAAMH,EAAW,IAAIvpB,EAAQ0pB,CAAI,CACjD,CACUxpB,EAAQqpB,CAAU,CAC5B,CACA,CAAO,EACD,WAAW,IAAM,CACfrpB,EAAQqpB,CAAU,CACnB,EAAEroB,CAAO,CACX,GACmB,CACxB,CAAG,CACH,CAGA,IAAI,WAAa,KAAM,CAWrB,YAAYlrB,EAAM,CAPlB8oB,EAAA,aAIAA,EAAA,uBACAA,EAAA,mBACAA,EAAA,oBAEE,KAAK,KAAO9oB,EACZ,KAAK,eAAiC,IAAI,IAC1C,KAAK,WAA6B,IAAI,IACtC,KAAK,YAA8B,IAAI,GAC3C,CACA,EACI,cAAgB,cAAc+zC,MAAAA,YAAc,CAI9C,YAAY5Y,EAAK,CACf,MAAO,EAJTrS,EAAA,aACAA,EAAA,YACAA,EAAA,cAGE,KAAK,IAAMqS,EACX,KAAK,MAAQA,EAAI,MAAM,OAAO,gBAAgB,EAC9C,KAAK,KAAO,IAAI6Y,cAAU,CACxB,QAAS,IACT,wBAAyB,EAAI,GAAK,GACxC,CAAK,CACL,CAME,MAAM,WAAWC,EAAO1E,EAAY,GAAO,CACzC,MAAM5N,EAAW,CAAE,EACnB,QAASrlC,EAAI,EAAGA,EAAI23C,EAAM,OAAQ33C,GAAK,IAAK,CAE1C,MAAMi/B,EADQ0Y,EAAM,MAAM33C,EAAGA,EAAI,GAAG,EACd,IAAKgU,GAAS,eAAeA,CAAI,CAAC,EAAE,OAAQ0Z,GAAW,CAAC,KAAK,KAAK,IAAIA,CAAM,CAAC,EACnG,GAAIuR,EAAQ,SAAW,EACvB,WAAWvR,KAAUuR,EACnB,KAAK,KAAK,IAAIvR,EAAQ,IAAI,WAAW,MAAM,CAAC,EAE9C2X,EAAS,KACP,IAAI,QAASzX,GAAY,CACvB,qBAAqBqR,EAAS,KAAK,IAAKgU,CAAS,EAAE,KAAMgE,GAAe,CACtE,SAAW,CAACvpB,EAAQmmB,CAAS,IAAKoD,EAAY,CAC5C,IAAIW,EAAa,KAAK,KAAK,IAAIlqB,CAAM,EAErC,GADAkqB,MAAe,IAAI,WAAW,MAAM,GAChC/D,EAAW,CACb+D,EAAW,WAAa,IAAI,IAAI,UAAU/D,EAAU,aAAa,CAAC,EAClE+D,EAAW,YAAc,IAAI,IAAI,UAAU/D,EAAU,cAAc,CAAC,EACpE,UAAWne,KAAYkiB,EAAW,WAC5B,KAAK,IAAI,KAAK,mBAAmB,IAAIliB,CAAQ,GAC/CkiB,EAAW,WAAW,OAAOliB,CAAQ,EAGzC,UAAWA,KAAYkiB,EAAW,YAC5B,KAAK,IAAI,KAAK,mBAAmB,IAAIliB,CAAQ,GAC/CkiB,EAAW,YAAY,OAAOliB,CAAQ,EAG1C,KAAK,KAAK,IAAIhI,EAAQkqB,CAAU,CAChD,CACA,CACA,CAAW,EAAE,QAAQhqB,CAAO,CACnB,CAAA,CACF,EACP,CACI,OAAO,QAAQ,IAAIyX,CAAQ,CAC/B,CAME,MAAMrxB,EAAMtQ,EAAMm0C,EAAa,GAAM,CACnC,MAAM1yC,EAAM,eAAe6O,CAAI,EAC/BtQ,MAAS,gBAAgBsQ,CAAI,GAC7B,IAAI4jC,EAAa,KAAK,KAAK,IAAIzyC,CAAG,EAClC,OAAKyyC,IACHA,EAAa,IAAI,WAAWl0C,CAAI,EAC5BsQ,aAAgB,SAClB,KAAK,WAAW,CAACA,CAAI,CAAC,GAGnB4jC,CACX,CACA,EACA,SAAS,eAAe5jC,EAAM,CAC5B,OAAIA,aAAgB,QACXA,EAAK,OAEPA,CACT,CACA,SAAS,gBAAgBA,EAAM,CAC7B,OAAIA,aAAgB,QACX,OAEF,MACT,CAGA,SAAS,gBAAgB81B,EAAUzK,EAAM,CACvC,MAAMC,EAAkBD,EAAK,gBAAiB,EAI9C,GAAI,CAH2B,MAAM,KAAKyK,EAAS,MAAM,EAAE,KAAM/b,GACxDuR,EAAgB,IAAK93B,GAAMA,EAAE,GAAG,EAAE,SAASumB,EAAM,GAAG,CAC5D,EAEC,UAAWA,KAASuR,EAClBwK,EAAS,SAAS/b,CAAK,EAG3B,GAAIuR,EAAgB,SAAW,EAC7B,UAAWvR,KAASsR,EAAK,OAAO,OAAM,EACpCyK,EAAS,SAAS/b,CAAK,EAG3B,OAAO+b,CACT,CAIA,IAAI,uBAAyB,KAAM,CAGjC,aAAc,CAFdtd,EAAA,sBACAA,EAAA,kBAA6B,IAAI,KAE/B,KAAK,cAAgC,IAAI,GAC7C,CACE,IAAIyB,EAAK,CACP,KAAK,cAAc,IAAIA,EAAI,WAAYA,CAAG,EACtCA,EAAI,UAERA,EAAI,UAAY,IAAM,CACpB,KAAK,cAAc,OAAOA,EAAI,UAAU,CACzC,EACDA,EAAI,GAAG,QAAS,IAAM,CACpB,KAAK,cAAc,OAAOA,EAAI,UAAU,CAC9C,CAAK,CACL,CACE,UAAUya,EAAS3a,EAAO,CACxB,MAAM+pB,EAAU,KAAK,WAAW,IAAIpP,CAAO,GAAK,CAAE,EAClDoP,EAAQ,KAAK/pB,CAAK,EAClB,KAAK,WAAW,IAAI2a,EAASoP,CAAO,CACxC,CA4BE,cAAct1C,EAAOurB,EAAOujB,EAAoB,GAAO,CACjDvjB,GAAO,KAAK,UAAUvrB,EAAM,GAAIurB,CAAK,EACzC,MAAMgqB,EAAgB,KAAK,cAAc,OAAQ,EAC3CC,EAAe,CAAE,EACvB,UAAW/pB,KAAO8pB,EACZ,aAAa9pB,EAAI,QAASzrB,CAAK,GACjCw1C,EAAa,KAAK/pB,CAAG,EAGzB,UAAWA,KAAO+pB,EAChB/pB,EAAI,cAAczrB,EAAOurB,EAAO,GAAOujB,CAAiB,CAE9D,CACA,EAII,OAAS2G,aAAa,iBAAiB,EAC3C,eAAe,iBAAiB7O,EAAM,CACpC,GAAI,CAAC,KAAK,sBAAuB,OACjC,MAAM8O,EAAa,MAAM,oBAAoB9O,EAAK,OAAQ,IAAI,EAC9D,GAAK8O,EACL,WAAWjsB,KAAOisB,EAAW,OAAQ,CACnC,IAAInqB,EAAQ,KAAK,KAAK,OAAO,IAAI9B,CAAG,EAC/B8B,IACHA,EAAQ,IAAI,SAAS9B,EAAK,KAAK,uBAAwB,IAAI,EAC3D,KAAK,KAAK,SAAS8B,CAAK,EAE9B,CACE,OAAOmqB,EACT,CACA,eAAe,cAAc9O,EAAM,CACjC,MAAM/J,EAAO,KAAK,YAAc,KAAK,KACjCA,EAAK,gBAAgB,OAAS,EAChC,uBAAuB,KAAK,KAAM+J,CAAI,EAEtC/J,EAAK,KAAK,UAAW,IAAM,CACzB,uBAAuB,KAAK,KAAM+J,CAAI,CAC5C,CAAK,CAEL,CACA,eAAe,uBAAuBA,EAAM,OAC1C,MAAM8O,EAAa,MAAM,iBAAiB,KAAK,KAAM9O,CAAI,EACnDhc,EAAU,CACd,CACE,MAAO,CAAC,KAA2B,EACnC,QAAS,CAACgc,EAAK,MAAM,CAC3B,CACG,EACG,KAAK,yBACPnoC,EAAAmsB,EAAQ,CAAC,EAAE,QAAX,MAAAnsB,EAAkB,KAAK,MAEzB,MAAM8uB,EAAyB,IAAI,IAC7B+Z,EAAWoO,EAAaA,EAAW,SAAW,OACpD,KAAK,UACH9qB,EACA,CAAE,MAAO,uBAAwB,YAAa,GAAM,SAAA0c,CAAU,EAC9D,CACE,QAAUtnC,GAAU,CAClB,MAAM21C,EAAYpoB,EAAO,IAAIvtB,EAAM,IAAI,EACnC21C,GAAaA,EAAU,YAAc31C,EAAM,YAC/CutB,EAAO,IAAIvtB,EAAM,KAAMA,CAAK,CAC7B,EACD,OAAQ,IAAM,CACZ,UAAWA,KAASutB,EAAO,SACzB,aAAa,KAAK,KAAMvtB,CAAK,CAEvC,CACA,CACG,CACH,CACA,eAAe,aAAaA,EAAO,CAC7BA,EAAM,OAAS,MACjB,sBAAsB,KAAK,KAAMA,CAAK,EAC7BA,EAAM,OAAS,KACxB,gBAAgB,KAAK,KAAMA,CAAK,CAEpC,CACA,SAAS,sBAAsBA,EAAO,CACpC,MAAM40C,EAAO,cAAc,KAAK50C,CAAK,EACrC,UAAWwR,KAAQojC,EAAK,MACtB,KAAK,KAAK,mBAAmB,IAAIpjC,EAAK,CAAC,CAAC,EAE1C,OAAO,qCAAsCojC,EAAK,MAAM,MAAM,CAChE,CACA,SAAS,gBAAgBgB,EAAU,CACjC,MAAMhB,EAAO,cAAc,KAAKgB,CAAQ,EACxC,UAAWpkC,KAAQojC,EAAK,MACtB,KAAK,SAAS,IAAIpjC,EAAK,CAAC,EAAGA,EAAK,CAAC,CAAC,EAEpC,OAAO,8BAA+BojC,EAAK,MAAM,MAAM,CACzD,CAIA,SAAS,UAAUxQ,EAAQ,CACzB,GAAI,CACF,MAAM+J,EAAU0H,cAAO,OAAOzR,CAAM,EACpC,OAAI+J,EAAQ,OAAS,OAAe,KAAK,KAAMA,EAAQ,IAAI,EACvDA,EAAQ,OAAS,WAAmB,SAAS,KAAMA,EAAQ,IAAI,EAC5DA,CACR,MAAY,CACX,OAAO,IACX,CACA,CACA,SAAS,KAAK9R,EAAKnR,EAAQ,CACzB,OAAOmR,EAAI,QAAQ,CAAE,OAAAnR,EAAQ,CAC/B,CACA,SAAS,SAASmR,EAAKjO,EAAS,CAC9B,MAAMwY,EAAOvK,EAAI,QAAQ,CAAE,OAAQjO,EAAQ,OAAQ,EACnD,OAAIA,EAAQ,SAAQwY,EAAK,UAAYxY,EAAQ,QACtCwY,CACT,CAGA,SAAS,YAAYpB,EAAM,CACzB,GAAI,CAACA,GAAQA,IAAS,GAAI,MAAO,GACjC,GAAI,CACF,WAAI,IAAIA,CAAI,EACL,EACR,MAAY,CACX,MAAO,EACX,CACA,CACA,eAAe,kBAAkB3mB,EAAKi3B,EAAerQ,EAASsQ,EAAW,CACvE,KAAM,SACR,EAAG,CACD,MAAMC,EAAK,KAAK,MAAM,OAAO,sBAAsB,EAC7C,CAAC3rC,EAAG4gB,EAAIua,CAAI,EAAI3mB,EACtB4mB,EAAU,CAAE,EACZuQ,EAAG,0BAA2Bn3B,EAAK4mB,EAASsQ,CAAQ,EACpD,MAAM5Y,EAAe,iBAAiB,KAAM2Y,EAAc,MAAM,EAChE,GAAI3Y,GAAgBA,EAAa,KAAO,EAAG,CACzC6Y,EAAG,uCAAwC,MAAM,KAAK7Y,CAAY,CAAC,EACnE,MAAM8Y,EAAY,YAAY,cAAc,MAAM,KAAK9Y,CAAY,EAAG,IAAI,EACpE8B,EAAS,MAAM,KAAK,WAAWhU,EAAIwa,EAASwQ,CAAS,EAC3D,GAAIhX,EAAQ,OAAOA,CACvB,MACI+W,EAAG,gCAAiCF,EAAc,OAAQA,CAAa,EAEzE,MAAMxO,EAAW,8BAA8B,KAAM,CAAC,CAAE,IAAK,CAACrc,CAAE,CAAG,CAAA,EAAG,KAAK,IAAI,EAC/E+qB,EAAG,oCAAqC1O,CAAQ,EAChD,MAAMtnC,EAAQ,MAAM,KAAK,WAAWirB,EAAIwa,CAAO,EAC/C,GAAIzlC,EAAO,OAAOA,EAClB,GAAIwlC,GAAQA,IAAS,GAAI,CACvB,MAAMvG,EAAS,MAAM,KAAK,WAAWhU,EAAIwa,EAAS,KAAK,KAAK,SAASD,EAAM,GAAM,GAAM,CAAC,CAAE,IAAK,CAACva,CAAE,CAAG,CAAA,CAAC,CAAC,EACvG,GAAIgU,EAAQ,OAAOA,CACvB,CACE,IAAIxxB,EACJ,MAAM8d,EAAQ,YAAYia,CAAI,EAAI,KAAK,KAAK,SAASA,EAAM,GAAO,GAAM,CAAC,CAAE,IAAK,CAACva,CAAE,CAAC,CAAE,CAAC,EAAI,OACrFirB,EAA0B,IAAI,QAAS9qB,GAAY,CACvD,KAAK,WAAWH,EAAIwa,EAASla,CAAK,EAAE,KAAKH,CAAO,CACpD,CAAG,EACD,GAAI,CAAC,YAAYoa,CAAI,GAAKuQ,EAAS,OAAS,OAC1C,OAAOG,EAET,MAAMC,EAAuB,IAAI,QAAQ,MAAO/qB,GAAY,CAC1D,MAAMgrB,EAAmBL,EAAS,SAC5B3pB,EAAU2pB,EAAS,SAAW,KAC9B/V,EAAiB,IAAI,QAASqW,GAAa,WAAWA,EAAUjqB,CAAO,CAAC,EAE9E,GADI2pB,EAAS,OAAS,WAAW,MAAM/V,EACnCvyB,EACF2d,EAAQ3d,CAAM,MACT,CACLuoC,EAAG,0BAA0B,EAC7B,MAAMM,EAAgB,MAAM,KAAK,WAAWrrB,EAAIwa,EAAS2Q,CAAgB,EACzEhrB,EAAQkrB,CAAa,CAC3B,CACA,CAAG,EACD,OAAQP,EAAS,KAAI,CACnB,IAAK,UACH,OAAO,QAAQ,KAAK,CAACG,EAAyBC,CAAoB,CAAC,EACrE,IAAK,OAEH,OADA1oC,EAAS,MAAMyoC,EACXzoC,GACG0oC,CACb,CACA,CAGA,IAAI,MAAQ,KAAM,CAKhB,YAAYI,EAAOC,EAAgB,CAJnCxsB,EAAA,aAAQ,CAAE,GACVA,EAAA,uBACAA,EAAA,kBAA6B,IAAI,KACjCA,EAAA,gBAA2B,IAAI,KAE7B,KAAK,eAAiBwsB,CAC1B,CACE,IAAIhlC,EAAM,CACR,GAAI,KAAK,SAAS,IAAIA,EAAK,EAAE,EAC3B,OAAO,KAAK,SAAS,IAAIA,EAAK,EAAE,EAElC,MAAM4+B,EAAU,IAAI,QAAQ,CAAChlB,EAASQ,IAAW,CAC/C,KAAK,MAAM,KAAK,CACd,GAAGpa,EACH,KAAM,IAAMA,EAAK,KAAI,EAAG,KACrB/D,IACC2d,EAAQ3d,CAAM,EACPA,GAERtI,GAAU,CACT,MAAAymB,EAAOzmB,CAAK,EACNA,CAClB,CACA,CACA,CAAO,EACD,KAAK,QAAS,CACpB,CAAK,EACD,YAAK,SAAS,IAAIqM,EAAK,GAAI4+B,CAAO,EAClCA,EAAQ,QAAQ,IAAM,CACpB,KAAK,SAAS,OAAO5+B,EAAK,EAAE,EAC5B,KAAK,WAAW,OAAOA,EAAK,EAAE,EAC9B,KAAK,QAAS,CACpB,CAAK,EACM4+B,CACX,CACE,SAAU,CACR,GAAI,KAAK,WAAW,MAAQ,KAAK,gBAAkB,KAAK,MAAM,SAAW,EACvE,OAEF,MAAM5+B,EAAO,KAAK,MAAM,MAAO,EAC3B,CAACA,GAAQ,KAAK,WAAW,IAAIA,EAAK,EAAE,IAGxC,KAAK,WAAW,IAAIA,EAAK,EAAE,EAC3BA,EAAK,KAAM,EACf,CACE,OAAQ,CACN,KAAK,MAAQ,CAAE,CACnB,CACE,iBAAkB,CAChB,KAAK,WAAW,MAAO,CAC3B,CACE,UAAW,CACT,KAAK,MAAO,EACZ,KAAK,gBAAiB,CAC1B,CACE,QAAS,CACP,OAAO,KAAK,MAAM,MACtB,CACA,EAGI,sBAAwB,CAAC,sBAAuB,gBAAgB,EAChE,2BAA6B,CAC/B,gBAEA,+BAGF,EACI,IAAM,cAAcilC,MAAAA,YAAc,CAkEpC,YAAYnnC,EAAO,GAAI,CACrB,MAAO,EAlET0a,EAAA,2BACAA,EAAA,2BACAA,EAAA,aACAA,EAAA,mBACAA,EAAA,gBACAA,EAAA,oBACAA,EAAA,qBACAA,EAAA,cACAA,EAAA,yBACAA,EAAA,sBACAA,EAAA,iBACAA,EAAA,mBACAA,EAAA,oBACAA,EAAA,wBACAA,EAAA,oBACAA,EAAA,4BAAuB,IACvBA,EAAA,8BAAyB,GACzBA,EAAA,6BAAwB,GACxBA,EAAA,0BACAA,EAAA,mBACAA,EAAA,gCAA2B,IAC3BA,EAAA,aAAQ,CAAE,GAyBVA,EAAA,+BAWAA,EAAA,kBAIAA,EAAA,iBACAA,EAAA,6BAAwB,IACxBA,EAAA,6BAAwB,IACxBA,EAAA,qBAqPAA,EAAA,yBAAoB,kBAAkB,KAAK,IAAI,GAqI/CA,EAAA,iBAAY,UAAU,KAAK,IAAI,GAvX7B,KAAK,MAAQ1a,EAAK,OAASonC,aAAO,KAAK,EACvC,KAAK,SAAWpnC,EAAK,SACrB,KAAK,mBAAqBA,EAAK,mBAAqB,CAAE,EACtD,KAAK,mBAAqBA,EAAK,oBAAsB,2BACrD,KAAK,WAAa,IAAI,uBACtB,KAAK,KAAO,IAAI,QAAQA,EAAK,mBAAqB,CAAE,EAAE,CAAE,EAAE,IAAI,EAC9D,KAAK,KAAK,KAAO,OACjB,KAAK,KAAK,GAAG,aAAc,MAAOic,EAAO7L,IAAc,CACjD,KAAK,wBACP,MAAM,KAAK,uBAAuB6L,EAAO7L,CAAS,CAE1D,CAAK,EACD,KAAK,sBAAwBpQ,EAAK,uBAAyB,GAC3D,KAAK,sBAAwBA,EAAK,uBAAyB,GAC3D,KAAK,WAAaA,EAAK,WACvB,KAAK,YAAcA,EAAK,YACxB,KAAK,uBAAyBA,EAAK,uBAC/BA,EAAK,oBACP,KAAK,WAAa,IAAI,QAAQA,EAAK,iBAAmB,sBAAuB,CAAE,EAAE,KAAM,CACrF,MAAO,KAAK,MAAM,OAAO,aAAa,EACtC,KAAM,aACd,CAAO,EACD,KAAK,cAAgB,IAAI,cAAc,IAAI,GAE7C,KAAK,OAASA,EAAK,OACnB,KAAK,aAAeA,EAAK,aACzB,KAAK,SAAWA,EAAK,UAA4B,IAAI,IACjDA,EAAK,oBACP,KAAK,iBAAmB,YAAY,cAAcA,EAAK,kBAAmB,IAAI,GAEhF,KAAK,gBAAkB,IAAI,MAAM,OAAQ,CAAC,EAC1C,KAAK,YAAc,IAAI,MAAM,QAAS,EAAE,EACxC,KAAK,4BAA8BA,EAAK,4BACxC,KAAK,uBAAyBA,EAAK,wBAA0B,EAC7D,KAAK,sBAAwBA,EAAK,uBAAyB,EAC3D,GAAI,CACF,KAAK,UAAY,KACvB,MAAY,CACZ,CACA,CACE,IAAI,kBAAkBiuB,EAAM,CAC1B,KAAK,mBAAqBA,EAAK,IAAI,iBAAiB,EACpD,KAAK,KAAK,UAAYA,CAC1B,CACE,IAAI,mBAAoB,CACtB,OAAO,KAAK,oBAAsB,CAAE,CACxC,CACE,IAAI,4BAA4BoZ,EAAS,CACvC,KAAK,qBAAuB,CAAC,CAACA,EAC1BA,GACF,0BAA0BA,CAAO,CAEvC,CAQE,iBAAiBC,EAAYC,EAAiBrU,EAAU,GAAM,OAC5D,IAAIjX,EACJ,OAAI,OAAOqrB,GAAe,SACxBrrB,EAAQ,IAAI,SAASqrB,EAAYC,EAAiB,IAAI,EAEtDtrB,EAAQqrB,EAEV,KAAK,KAAK,SAASrrB,EAAOiX,CAAO,GACjC/jC,EAAA,KAAK,oBAAL,MAAAA,EAAwB,KAAK8sB,EAAM,KAC5BA,CACX,CACE,QAAS,CACP,MAAO,CAAE,WAAY,KAAK,KAAK,OAAO,IAAM,EAAC,SAAU,CAC3D,CACE,IAAI,YAAa,CACf,OAAO,KAAK,WAChB,CAUE,IAAI,WAAWqb,EAAM,OACnB,MAAMkQ,IAAgBr4C,EAAA,KAAK,cAAL,YAAAA,EAAkB,WAAWmoC,GAAA,YAAAA,EAAM,QACzD,KAAK,YAAcA,EACfA,GAAQkQ,EACV,cAAc,KAAK,KAAMlQ,CAAI,EACnBA,IACV,KAAK,SAA2B,IAAI,IAE1C,CACE,IAAI,QAAS,CACX,OAAO,KAAK,OAChB,CACE,IAAI,OAAOmQ,EAAW,CACpB,KAAK,QAAUA,EACXA,GAAW,KAAK,KAAK,eAAgBA,CAAS,EAClDA,GAAA,MAAAA,EAAW,OAAO,KAAMnQ,GAAS,CAC/BA,EAAK,IAAM,KACX,KAAK,WAAaA,CACxB,EACA,CAKE,MAAM,QAAQ/H,EAAW,SACnB,KAAK,SAAW,KAAK,wBACvB,KAAK,MACH,8DACA,OAAMlgC,GAAAF,EAAA,KAAK,SAAQ,SAAb,YAAAE,EAAA,KAAAF,EAAsB,MAC7B,EACG,KAAK,QAAQ,SACA,MAAM,KAAK,QAAQ,OAAO,IAAI,GACtC,QAAS8sB,GAAU,KAAK,KAAK,SAASA,CAAK,CAAC,GAGvD,MAAMyrB,EAAc,CAAC,KAAK,KAAK,QAAQnY,CAAS,CAAC,EACjD,OAAI,KAAK,YACPmY,EAAY,KAAK,KAAK,WAAW,QAAQnY,CAAS,CAAC,EAErD,KAAK,MAAM,0BAA2B,CAAE,UAAAA,CAAS,CAAE,EAC5C,QAAQ,WAAWmY,CAAW,EAAE,KAAK,IAAM,CACtD,CAAK,CACL,CAOE,QAAQ1nC,EAAM,CACZ,MAAMs3B,EAAO,IAAI,QAAQt3B,CAAI,EAC7B,OAAAs3B,EAAK,IAAM,KACJA,CACX,CAOE,MAAM,iBAAiBvX,EAAOohB,EAAY,GAAO,CAC/C,OAAO,QAAQ,UAAUphB,EAAO,KAAMohB,CAAS,CACnD,CA6CE,UAAU7lB,EAAStb,EAAM2nC,EAAY,GAAM,OACzC,MAAM3qB,EAAe,IAAI,gBAAgB,KAAM1B,EAAStb,CAAI,EAC5D,KAAK,WAAW,IAAIgd,CAAY,EAChC,MAAMuQ,EAAOvQ,EAAa,KAC1B,GAAIA,EAAa,SACf,UAAWf,KAASe,EAAa,SAAS,OACxCuQ,EAAK,kBAAkBtR,EAAO,OAAQe,EAAa,OAAO,EAG9D,GAAI,KAAK,YAAcA,EAAa,iBAAgB,EAAI,CACtD,MAAMgQ,EAAUhQ,EAAa,QAAQ,OAAQ7B,GAAW,OAAA,OAAAA,EAAO,WAAWhsB,EAAAgsB,EAAO,UAAP,YAAAhsB,EAAgB,QAAS,EAAC,EAAE,QAASgsB,GAAWA,EAAO,OAAO,GACxIhsB,EAAA,KAAK,gBAAL,MAAAA,EAAoB,WAAW69B,EACrC,CACI,GAAI2a,EAAW,CACb,IAAIC,EACA,OAAOD,GAAc,WACnBA,EAAU,SAAS3qB,EAAa,GAAG,QAAS2qB,EAAU,OAAO,EAC7DA,EAAU,QAAQ3qB,EAAa,GAAG,OAAQ2qB,EAAU,MAAM,EAC1DA,EAAU,WAAUC,EAAgBD,EAAU,WAEpD,WAAW,IAAM,CACf,MAAME,EAAe7qB,EAAa,MAAM,CAAC4qB,CAAa,EAClDC,GAAgBA,EAAa,OAAS,GAAOD,GAAeA,EAAcC,CAAY,CAC3F,EAAE,CAAC,CACV,CACI,OAAO7qB,CACX,CAUE,MAAM,QAAQtsB,EAAOsnC,EAAUzI,EAAW,CACxC,YAAK,MAAM,2CAA2C,EAC/C7+B,EAAM,QAAQsnC,EAAUzI,CAAS,CAC5C,CAgBE,eAAeuY,EAAY,CACzB,GAAI,CAAC,KAAK,aAAc,MAAM,IAAI,MAAM,uBAAuB,EAC/D,IAAIxsB,EACA,OAAOwsB,GAAe,SAAUxsB,EAAU,CAAC,aAAawsB,CAAU,CAAC,EAClExsB,EAAUwsB,EACf,MAAM3rB,EAAM,IAAI,gBAAgB,KAAMb,CAAO,EACvC2C,EAAS,KAAK,aAAa,MAAM9B,CAAG,EAC1C,GAAI8B,aAAkB,QAAS,MAAM,IAAI,MAAM,wBAAwB,EACvE,OAAOA,EAAO,IAAKptB,IACjBA,EAAE,IAAM,KACDA,EACR,CACL,CAQE,MAAM,WAAWi3C,EAAY9nC,EAAM+nC,EAAiB,CAClD,IAAIzsB,EACA0c,EAMJ,GALI+P,aAA2B,SAC7B/P,EAAW,IAAI,YAA4B,IAAI,IAAI,CAAC+P,CAAe,CAAC,EAAG,IAAI,EAClEA,aAA2B,cACpC/P,EAAW+P,GAET,CAACA,GAAmB,OAAOD,GAAe,UACxC,CAAC,cAAcA,CAAU,EAAG,CAC9B,MAAM7qB,EAAS,iBAAiB6qB,EAAY,IAAI,EAC5C7qB,EAAO,OAAS,IAClB+a,EAAW,IAAI,YAAY,IAAI,IAAI/a,CAAM,EAAG,IAAI,EAChD+a,EAAW,gBAAgBA,EAAU,KAAK,IAAI,EAExD,CASI,GAPI,OAAO8P,GAAe,SACxBxsB,EAAU,CAAC,aAAawsB,CAAU,CAAC,EAC1B,MAAM,QAAQA,CAAU,EACjCxsB,EAAUwsB,EAEVxsB,EAAU,CAACwsB,CAAU,EAEnBxsB,EAAQ,SAAW,EACrB,MAAM,IAAI,MAAM,mBAAmB,KAAK,UAAUwsB,CAAU,CAAC,EAAE,EAEjE,OAAO,IAAI,QAAShsB,GAAY,CAC9B,IAAIksB,EAAe,KACnB,MAAMvC,EAAgB,CACpB,GAAGzlC,GAAQ,CAAE,EACb,YAAa,EACd,EACGg4B,IAAUyN,EAAc,SAAWzN,GACvC,MAAMnmC,EAAI,KAAK,UACbypB,EACAmqB,EAEA,EAED,EACKnmC,EAAK,WAAW,IAAM,CAC1BzN,EAAE,KAAM,EACRiqB,EAAQksB,CAAY,CACrB,EAAE,GAAG,EACNn2C,EAAE,GAAG,QAAUnB,GAAU,CACvBA,EAAM,IAAM,KACPA,EAAM,iBAGA,CAACs3C,GAAgBA,EAAa,WAAat3C,EAAM,cAC1Ds3C,EAAet3C,IAHf,aAAa4O,CAAE,EACfwc,EAAQprB,CAAK,EAIvB,CAAO,EACDmB,EAAE,GAAG,OAAQ,IAAM,CACjB,aAAayN,CAAE,EACfwc,EAAQksB,CAAY,CAC5B,CAAO,EACDn2C,EAAE,MAAO,CACf,CAAK,CACL,CAIE,MAAM,YAAYypB,EAAStb,EAAMg4B,EAAU,CACzC,OAAO,IAAI,QAASlc,GAAY,CAC9B,MAAMmC,EAAyB,IAAI,IAC7BwnB,EAAgB,CACpB,GAAGzlC,GAAQ,CAAE,EACb,YAAa,EACd,EACGg4B,IAAUyN,EAAc,SAAWzN,GACvC,MAAMiQ,EAAuB,KAAK,UAChC3sB,EACAmqB,EAEA,EAED,EACKyC,EAAWx3C,GAAU,CACzB,IAAIy3C,EACEz3C,aAAiB,SAClBy3C,EAASz3C,EADoBy3C,EAAS,IAAI,SAAS,OAAQz3C,CAAK,EAErE,MAAM03C,EAAWD,EAAO,iBAAkB,EACpCzC,EAAgBznB,EAAO,IAAImqB,CAAQ,EACrC1C,IACFyC,EAAS,MAAMzC,EAAeyC,CAAM,GAEtCA,EAAO,IAAM,KACblqB,EAAO,IAAImqB,EAAUD,CAAM,CAC5B,EACDF,EAAqB,GAAG,QAASC,CAAO,EACxCD,EAAqB,GAAG,OAAQ,IAAM,CACpCnsB,EAAQ,IAAI,IAAImC,EAAO,OAAQ,CAAA,CAAC,CACxC,CAAO,EACDgqB,EAAqB,MAAO,CAClC,CAAK,CACL,CAIE,cAAe,CACb,GAAI,CAAC,KAAK,OACR,WAAK,KAAK,iBAAiB,EACrB,IAAI,MAAM,iBAAiB,CAEvC,CAEE,IAAI,OAAOI,EAAQ,SACjB,GAAI,CAACA,EAAQ,CACX,KAAK,aAAe,OACpB,MACN,CACI,KAAK,eAAL,KAAK,aAAiB,CAAE,GACxB,KAAK,aAAa,OAAQl5C,EAAAk5C,GAAA,YAAAA,EAAQ,QAAR,YAAAl5C,EAAe,KAAKk5C,GAC9C,KAAK,aAAa,UAAWh5C,EAAAg5C,GAAA,YAAAA,EAAQ,WAAR,YAAAh5C,EAAkB,KAAKg5C,EACxD,CACA,EA6DSC,aAAa,eAAe,EAqE5B,aAAa,YAAY,glCC3iTrB,eAAiB,CAC5B,uBACA,mBACA,wBACA,yBACA,gBACA,gCACA,0BACA,wBAGF,EAEa,kBAAoB,IAIpB,sBAAwB,0BCPxBC,GAAN,MAAMA,EAAa,CAMhB,aAAc,CAHd7tB,EAAA,YACAA,EAAA,mBAAuB,IAGxB,KAAA,IAAM,IAAI,GAAI,CAGrB,OAAc,aAA4B,CACpC,OAAC6tB,GAAa,WACHA,GAAA,SAAW,IAAIA,IAEvBA,GAAa,QAAA,CAGtB,MAAa,eACXtrB,EAAmB,CAAC,GAAG,cAAc,EACtB,CAET,MAAAurB,EAAYvrB,EAAO,OAAY,GAAA,CAAC,KAAK,UAAU,EAAE,SAAS,CAAC,CAAC,EAG9D,GAAA,KAAK,aAAeurB,EAAU,OAAQ,CACxCA,EAAU,QAAeruB,GAAA,KAAK,IAAI,iBAAiBA,CAAG,CAAC,EACvD,MAAA,CAIF,KAAK,IAAI,kBAAoB8C,EACvB,MAAA,KAAK,IAAI,QAAQ,EACvB,KAAK,YAAc,EAAA,CAGd,WAAsB,CACpB,OAAA,KAAK,IAAI,mBAAqB,cAAA,CAGvC,MAAa,eAAese,EAIA,CAC1B,OAAIA,EAAW,KACN,KAAK,IAAI,QAAQ,CAAE,KAAMA,EAAW,KAAM,EACxCA,EAAW,MACP,MAAM,KAAK,IAAI,iBAAiBA,EAAW,KAAK,GAC9C,KACNA,EAAW,OACb,KAAK,IAAI,QAAQ,CAAE,OAAQA,EAAW,OAAQ,EAGhD,IAAA,CAGT,MAAa,gBAAgBA,EAEA,CAC3B,OAAIA,EAAW,IACN,KAAK,IAAI,WAAWA,EAAW,GAAG,EAGpC,IAAA,CAQT,MAAa,YAAYA,EAIL,CAClB,MAAMjE,EAAO,MAAM,KAAK,eAAeiE,CAAU,EACjD,OAAOjE,EAAO,KAAK,UAAUA,CAAI,EAAI,CAAA,CAGvC,MAAa,WAAWA,EAAsD,CACxE,GAAA,CAACA,EAAa,OAAA,KAElB,MAAMA,EAAK,aAAa,EAExB,MAAMxY,EAAUwY,EAAK,QAErB,OAAIxY,IAAYA,EAAQ,UAAY,QAAaA,EAAQ,UAAY,QACnEA,EAAQ,QAAU,uBAGbA,CAAA,CAGT,MAAa,QAAQ8X,EAA2C,CAC9D,MAAMlmC,EAAQ,MAAM,KAAK,IAAI,WAAWkmC,CAAO,EAC3C,GAAA,CAAClmC,EAAc,OAAA,KAGb,MAAA+3C,EAAmB/3C,EAAM,gBAAgB,GAAG,EAC9C,GAAA+3C,EAAiB,OAAS,EAAG,CAC/B,MAAMC,EAAqBD,EAAiB,IAAWl5B,GAAAA,EAAI,CAAC,CAAC,EACvD,MAAA,KAAK,IAAI,YAAY,CACzB,IAAKm5B,CAAA,CACN,CAAA,CAIG,MAAAC,EAAYj4C,EAAM,gBAAgB,GAAG,EAC3C,UAAW6e,KAAOo5B,EAAW,CACrB,MAAAna,EAAWjf,EAAI,CAAC,EAChB4K,EAAM5K,EAAI,CAAC,EACbif,GAAA,MAAAA,EAAU,WAAW,WAAarU,IAE9BzpB,EAAA,QAAUA,EAAM,QAAU;AAAA,EAAKypB,CAAG,GAC1C,CAGK,OAAAzpB,CAAA,CAGT,MAAa,aAAa4mC,EAAgC,CACpD,GAAA,CAKK,OAHS,MAAMA,EAAK,UAAU,GACf,UAGR,CAEP,MAAA,EAAA,CACT,CAGF,MAAa,eAAeA,EAAgC,CACtD,GAAA,CAEF,MAAMrZ,EAAS,MAAM,KAAK,IAAI,YAAY,CACxC,MAAO,CAAC,QAAQ,QAAQ,EACxB,KAAM,CAACqZ,EAAK,MAAM,CAAA,CACnB,EAEKtK,MAAc,IACpB,OAAA/O,EAAO,QAASptB,GAAMm8B,EAAQ,IAAIn8B,EAAE,MAAM,CAAC,EAC7Bm8B,EAAQ,UAGR,CAEP,MAAA,EAAA,CACT,CAGF,MAAa,qBAAqBsK,EAA0C,CACtE,GAAA,CAEF,MAAMrZ,EAAS,MAAM,KAAK,IAAI,YAAY,CACxC,MAAO,CAAC,QAAQ,IAAI,EACpB,QAAS,CAACqZ,EAAK,MAAM,EACrB,MAAO,GAAA,CACR,EAED,IAAIsR,EAAU,EACVC,EAAa,EAEjB5qB,EAAO,QAAiBvtB,GAAA,CAClBA,IAEcA,EAAM,KAAK,KACxB6e,GAAkBA,EAAI,CAAC,IAAM,KAAOA,EAAI,CAAC,IAAM,SAClD,GAEEq5B,IAEFC,IACF,CACD,EAED,MAAMC,EAAeF,EAId,MAAA,CAHY,KAAK,IAAI,EAAGC,EAAaD,CAAO,EAG/BE,CAAY,OAClB,CAEP,MAAA,CAAC,EAAG,CAAC,CAAA,CACd,CAIF,MAAa,UAAUxR,EAAgC,CACjD,GAAA,CASK,OAPQ,MAAM,KAAK,IAAI,YAAY,CACxC,MAAO,CAAC,IAAI,EACZ,KAAM,CAACA,EAAK,MAAM,EAClB,MAAO,GAAA,CACR,GACoB,UAGP,CAEP,MAAA,EAAA,CACT,CAIK,QAAc,CACnB,OAAO,KAAK,GAAA,CAOP,WAAqB,CAOtB,OALA,OAAO,OAAW,KAAgB,OAAe,OAKjD,OAAO,OAAW,KAAe,OAAO,aAAiB,KAAe,aAAa,QAAQ,YAAY,EACpG,GAIF,CAAC,CAAC,KAAK,IAAI,MAAA,CAEtB,EApOE5c,EAFW6tB,GAEI,YAFV,IAAM,aAANA","x_google_ignoreList":[0,1,2,3,4,5,6,7,8,9,10,11,12,13,14,15,16,17,18,19,20,21,22,23,24,25,26,27,28,29,30,31,32,33,34,35,36,37,38,39,40,41,42,43,44,45,46,47,48,49,50,51,52,53,54]}